[
    {
        "id": 1,
        "task_id": 2921,
        "test_case_id": 1,
        "question": "The University of Lagado is organising events for the upcoming Fresher’s week and has been told — much to the surprise of its staff — that some of the undergraduates may enjoy a beer tasting. While sourcing a wide variety of drinks for the students to taste, the university realised that in the interests of safety there should be a limit on the alcohol consumption of any student, enforced by a strict limit on the amount any individual is allowed to spend.\n\nIn common with many popular establishments, the drinks with varying strengths are served in varying amounts: Either a litre, a half litre or a third of a litre to limit possible intoxication. $1\\% $ of a litre at $100\\% $ strength equals one unit of alcohol.\n\nThe students are looking forward to the event, but in order to make the most of their money and still be bright-eyed and bushy tailed for the first week of morning lectures, they don’t wish to get too drunk. How can the students spend all their money and consume in full their self-imposed alcohol limit for the night?\n\n-----Input-----\n - One line containing three numbers:\n - $m$ ($0.00 \\le m \\le 10.00$), the amount of money they can spend to two decimal places;\n - $u$ ($0.0 \\le u \\le 20.0$), the number of units they aim to drink to one decimal place;\n - $d$ ($1 \\le d \\le 8$), the number of different drinks available.\n - Another $d$ lines, each containing:\n - up to $20$ lowercase latin letters (the name of the drink);\n - an integer between $0$ and $100$ (its strength as a percentage);\n - its size (either ‘$1/1$’ for a litre, ‘$1/2$’ for a half or ‘$1/3$’ for a third);\n - a real number to two decimal places; its cost.\n\nName, strength, price and cost will be separated by spaces.\n\n-----Output-----\nIf the students’ aims are possible, write one or more lines, each listing the name of the drink purchased followed by the positive integer count of how many drinks of that type were bought. If there are several solutions, output any.\n\nOtherwise, output a single line containing the word IMPOSSIBLE.\n\n-----Examples-----\nSample Input:\n10.00 9.0 2\nfire 2 1/1 4.00\nwater 10 1/2 2.00\nSample Output:\nfire 2\nwater 1",
        "solutions": "",
        "difficulty": "interview",
        "input": "10.00 9.0 2\nfire 2 1/1 4.00\nwater 10 1/2 2.00\n",
        "output": "fire 2\nwater 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/drinkresponsibly"
    },
    {
        "id": 2,
        "task_id": 2921,
        "test_case_id": 2,
        "question": "The University of Lagado is organising events for the upcoming Fresher’s week and has been told — much to the surprise of its staff — that some of the undergraduates may enjoy a beer tasting. While sourcing a wide variety of drinks for the students to taste, the university realised that in the interests of safety there should be a limit on the alcohol consumption of any student, enforced by a strict limit on the amount any individual is allowed to spend.\n\nIn common with many popular establishments, the drinks with varying strengths are served in varying amounts: Either a litre, a half litre or a third of a litre to limit possible intoxication. $1\\% $ of a litre at $100\\% $ strength equals one unit of alcohol.\n\nThe students are looking forward to the event, but in order to make the most of their money and still be bright-eyed and bushy tailed for the first week of morning lectures, they don’t wish to get too drunk. How can the students spend all their money and consume in full their self-imposed alcohol limit for the night?\n\n-----Input-----\n - One line containing three numbers:\n - $m$ ($0.00 \\le m \\le 10.00$), the amount of money they can spend to two decimal places;\n - $u$ ($0.0 \\le u \\le 20.0$), the number of units they aim to drink to one decimal place;\n - $d$ ($1 \\le d \\le 8$), the number of different drinks available.\n - Another $d$ lines, each containing:\n - up to $20$ lowercase latin letters (the name of the drink);\n - an integer between $0$ and $100$ (its strength as a percentage);\n - its size (either ‘$1/1$’ for a litre, ‘$1/2$’ for a half or ‘$1/3$’ for a third);\n - a real number to two decimal places; its cost.\n\nName, strength, price and cost will be separated by spaces.\n\n-----Output-----\nIf the students’ aims are possible, write one or more lines, each listing the name of the drink purchased followed by the positive integer count of how many drinks of that type were bought. If there are several solutions, output any.\n\nOtherwise, output a single line containing the word IMPOSSIBLE.\n\n-----Examples-----\nSample Input:\n10.00 9.0 2\nfire 2 1/1 4.00\nwater 10 1/2 2.00\nSample Output:\nfire 2\nwater 1",
        "solutions": "",
        "difficulty": "interview",
        "input": "2.00 3.0 3\nfirewater 1 1/1 1.00\nwindwater 1 1/1 1.00\nearthwater 1 1/1 1.00\n",
        "output": "IMPOSSIBLE\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/drinkresponsibly"
    },
    {
        "id": 3,
        "task_id": 75,
        "test_case_id": 9,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n..........\n..........\n....*.....\n..........\n..........\n..........\n....*.....\n....*.....\n....*.....\n..........\n",
        "output": "YES\n1 5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 4,
        "task_id": 75,
        "test_case_id": 10,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n..........\n..........\n.**....***\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n",
        "output": "YES\n3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 5,
        "task_id": 75,
        "test_case_id": 30,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 20\n....................\n.........*..........\n....................\n....................\n....................\n....................\n....................\n....................\n...*................\n....................\n",
        "output": "YES\n9 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 6,
        "task_id": 75,
        "test_case_id": 31,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 20\n....................\n.........*..........\n....................\n....................\n....................\n....................\n....................\n....................\n...*..............*.\n....................\n",
        "output": "YES\n9 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 7,
        "task_id": 75,
        "test_case_id": 32,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 20\n....................\n.........*..........\n....................\n....................\n....................\n....................\n....................\n....................\n...*..............*.\n.........*..........\n",
        "output": "YES\n9 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 8,
        "task_id": 75,
        "test_case_id": 33,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 20\n....................\n.........*..........\n....................\n....................\n....................\n....................\n....................\n....................\n...*.....*........*.\n.........*..........\n",
        "output": "YES\n9 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 9,
        "task_id": 75,
        "test_case_id": 34,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 2\n..\n.*\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 10,
        "task_id": 75,
        "test_case_id": 41,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 4\n....\n..*.\n....\n",
        "output": "YES\n1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 11,
        "task_id": 75,
        "test_case_id": 46,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n....\n.*..\n..*.\n....\n",
        "output": "YES\n3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 12,
        "task_id": 75,
        "test_case_id": 52,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 5\n.....\n.....\n..*..\n.....\n.....\n",
        "output": "YES\n1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 13,
        "task_id": 75,
        "test_case_id": 56,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n....\n....\n..*.\n....\n",
        "output": "YES\n1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 14,
        "task_id": 75,
        "test_case_id": 64,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n...\n.*.\n..*\n",
        "output": "YES\n3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 15,
        "task_id": 75,
        "test_case_id": 66,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n...\n...\n.*.\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 16,
        "task_id": 75,
        "test_case_id": 71,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 5\n.....\n..*..\n.*.*.\n..*..\n.....\n",
        "output": "YES\n3 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 17,
        "task_id": 75,
        "test_case_id": 74,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n...\n.*.\n...\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 18,
        "task_id": 75,
        "test_case_id": 87,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n...\n..*\n.*.\n",
        "output": "YES\n3 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 19,
        "task_id": 401,
        "test_case_id": 1,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 3\n4 2\n5 7 6\n",
        "output": "25\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 20,
        "task_id": 401,
        "test_case_id": 3,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n9\n1\n",
        "output": "19\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 21,
        "task_id": 401,
        "test_case_id": 5,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 3\n7 2 5 8 6\n3 1 9\n",
        "output": "12\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 22,
        "task_id": 401,
        "test_case_id": 6,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "4 5\n5 2 6 4\n8 9 1 3 7\n",
        "output": "12\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 23,
        "task_id": 401,
        "test_case_id": 14,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n8\n9\n",
        "output": "89\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 24,
        "task_id": 401,
        "test_case_id": 15,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n9\n8\n",
        "output": "89\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 25,
        "task_id": 401,
        "test_case_id": 16,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n1\n2\n",
        "output": "12\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 26,
        "task_id": 401,
        "test_case_id": 17,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n2\n1\n",
        "output": "12\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 27,
        "task_id": 618,
        "test_case_id": 1,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "AC|T\nL\n",
        "output": "AC|TL\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 28,
        "task_id": 618,
        "test_case_id": 3,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "W|T\nF\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 29,
        "task_id": 618,
        "test_case_id": 4,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "ABC|\nD\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 30,
        "task_id": 618,
        "test_case_id": 5,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "A|BC\nDEF\n",
        "output": "ADF|BCE\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 31,
        "task_id": 618,
        "test_case_id": 10,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "A|XYZ\nUIOPL\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 32,
        "task_id": 618,
        "test_case_id": 11,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "K|B\nY\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 33,
        "task_id": 618,
        "test_case_id": 12,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "EQJWDOHKZRBISPLXUYVCMNFGT|\nA\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 34,
        "task_id": 618,
        "test_case_id": 14,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "ERACGIZOVPT|WXUYMDLJNQS\nKB\n",
        "output": "ERACGIZOVPTB|WXUYMDLJNQSK\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 35,
        "task_id": 618,
        "test_case_id": 15,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "CKQHRUZMISGE|FBVWPXDLTJYN\nOA\n",
        "output": "CKQHRUZMISGEA|FBVWPXDLTJYNO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 36,
        "task_id": 618,
        "test_case_id": 16,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "V|CMOEUTAXBFWSK\nDLRZJGIYNQHP\n",
        "output": "VDLRZJGIYNQHP|CMOEUTAXBFWSK\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 37,
        "task_id": 618,
        "test_case_id": 17,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "QWHNMALDGKTJ|\nPBRYVXZUESCOIF\n",
        "output": "QWHNMALDGKTJF|PBRYVXZUESCOI\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 38,
        "task_id": 618,
        "test_case_id": 19,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "IB|PCGHZ\nFXWTJQNEKAUM\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 39,
        "task_id": 618,
        "test_case_id": 20,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "EC|IWAXQ\nJUHSRKGZTOMYN\n",
        "output": "ECJUHRGTMN|IWAXQSKZOY\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 40,
        "task_id": 618,
        "test_case_id": 21,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "VDINYMA|UQKWBCLRHZJ\nXEGOF\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 41,
        "task_id": 618,
        "test_case_id": 22,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "ZLTPSIQUBAR|XFDEMYC\nHNOJWG\n",
        "output": "ZLTPSIQUBARG|XFDEMYCHNOJW\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 42,
        "task_id": 618,
        "test_case_id": 23,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "R|FLZOTJNU\nGIYHKVX\n",
        "output": "RGIYHKVX|FLZOTJNU\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 43,
        "task_id": 618,
        "test_case_id": 24,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "W|TL\nQROFSADYPKHEJNMXBZVUCIG\n",
        "output": "WQOSDPHJMBVCG|TLRFAYKENXZUI\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 44,
        "task_id": 618,
        "test_case_id": 25,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "NRDFQSEKLAYMOT|ZH\nGUXIBJCVPW\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 45,
        "task_id": 618,
        "test_case_id": 26,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "FGRT|\nAC\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 46,
        "task_id": 618,
        "test_case_id": 28,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "A|\nB\n",
        "output": "A|B\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 47,
        "task_id": 618,
        "test_case_id": 32,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "QWERTYUIOPASDFGHJKLZXCVBN|\nM\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 48,
        "task_id": 618,
        "test_case_id": 33,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "QWERTY|VBN\nUIOPASDFGHJKLZXC\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 49,
        "task_id": 618,
        "test_case_id": 34,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "ABC|D\nKSL\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 50,
        "task_id": 618,
        "test_case_id": 35,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "A|BCDEF\nGH\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 51,
        "task_id": 618,
        "test_case_id": 37,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "A|BC\nDE\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 52,
        "task_id": 618,
        "test_case_id": 39,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "AB|CDEF\nXYZRT\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 53,
        "task_id": 792,
        "test_case_id": 2,
        "question": "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses the card.\n\nShe starts with 0 money on her account.\n\nIn the evening of i-th day a transaction a_{i} occurs. If a_{i} > 0, then a_{i} bourles are deposited to Luba's account. If a_{i} < 0, then a_{i} bourles are withdrawn. And if a_{i} = 0, then the amount of money on Luba's account is checked.\n\nIn the morning of any of n days Luba can go to the bank and deposit any positive integer amount of burles to her account. But there is a limitation: the amount of money on the account can never exceed d.\n\nIt can happen that the amount of money goes greater than d by some transaction in the evening. In this case answer will be «-1».\n\nLuba must not exceed this limit, and also she wants that every day her account is checked (the days when a_{i} = 0) the amount of money on her account is non-negative. It takes a lot of time to go to the bank, so Luba wants to know the minimum number of days she needs to deposit some money to her account (if it is possible to meet all the requirements). Help her!\n\n\n-----Input-----\n\nThe first line contains two integers n, d (1 ≤ n ≤ 10^5, 1 ≤ d ≤ 10^9) —the number of days and the money limitation.\n\nThe second line contains n integer numbers a_1, a_2, ... a_{n} ( - 10^4 ≤ a_{i} ≤ 10^4), where a_{i} represents the transaction in i-th day.\n\n\n-----Output-----\n\nPrint -1 if Luba cannot deposit the money to her account in such a way that the requirements are met. Otherwise print the minimum number of days Luba has to deposit money.\n\n\n-----Examples-----\nInput\n5 10\n-1 5 0 -5 3\n\nOutput\n0\n\nInput\n3 4\n-10 0 20\n\nOutput\n-1\n\nInput\n5 10\n-5 0 10 -11 0\n\nOutput\n2",
        "solutions": "[\"n, d = map(int, input().split())\\nline = list(map(int, input().split()))\\npref = [0] * n\\nmaxx = 0\\nfor i in range(n):\\n    pref[i] = pref[max(i - 1, 0)] + line[i]\\n    maxx = max(maxx, pref[i])\\nmaxr = [0] * n\\nfor i in range(n - 1, -1, -1):\\n    if i == n - 1:\\n        maxr[i] = pref[i]\\n    else:\\n        maxr[i] = max(maxr[i + 1], pref[i])\\nsm = 0\\nbon = 0\\nans = 0\\nb = True\\nif maxx > d:\\n    b = False\\nfor i in range(n):\\n    elem = line[i]\\n    sm += elem\\n    if elem == 0:\\n        #print(sm, bon)\\n        if sm + bon < 0:\\n            ans += 1\\n            bon += max(0, d - (maxr[i] + bon))\\n        if sm + bon < 0:\\n            b = False\\n            break\\n    if sm + bon > d:\\n        b = False\\n        break\\nif b == False:\\n    print(-1)\\nelse:\\n    print(ans)\", \"n,d=map(int,input().split())\\na=list(map(int,input().split()))\\nf=True\\nb=[a[0]]\\nfor i in range(1,n):\\n    b.append(b[i-1]+a[i])\\nif max(b)>d:\\n    f=False\\n        \\nh=[0]*n\\nh[n-1]=b[n-1]\\nfor i in range(n-2,-1,-1):\\n    h[i]=max(b[i],h[i+1])\\nx,k=0,0\\nfor i in range(n):\\n    if a[i]==0 and b[i]+x<0:\\n        k+=1\\n        x+=d-(h[i]+x)\\n        if b[i]+x<0:\\n            f=False\\n            break\\nif f:\\n    print(k)\\nelse:\\n    print(-1)\", \"n, d = [int(x) for x in input().split()]\\ntr = [int(x) for x in input().split()]\\ncash = 0\\nflag = False\\ngr = []\\nfor i in tr:\\n    if i != 0:\\n        cash += i\\n    gr.append(cash)\\n    if cash > d:\\n        flag = True\\n        break\\nif flag:\\n    print(-1)\\nelse:\\n    mx = [-1] * n\\n    mx[-1] = gr[-1]\\n    for i in range(n - 2, -1, -1):\\n        mx[i] = max(gr[i], mx[i + 1])\\n    acash = 0\\n    count = 0\\n    for i in range(n):\\n        if tr[i] == 0:\\n            if gr[i] + acash < 0:\\n                acash += (d - mx[i] - acash)\\n                if gr[i] + acash < 0:\\n                    count = -1\\n                    break\\n                count += 1\\n    print(count)\", \"n, d = map(int, input().split())\\na = list(map(int, input().split()))\\npref = [0 for i in range(n)]\\nc = 0\\nfor i in range(n):\\n    c += a[i]\\n    if a[i] == 0:\\n        c = max(0, c)\\n    pref[i] = c\\nsuff = [0 for i in range(n)]\\nsuff[-1] = pref[-1]\\nmc = suff[-1]\\nfor i in range(n-2, -1, -1):\\n    suff[i] = max(mc, pref[i])\\n    mc = suff[i]\\n    if a[i] == 0 and i > 0:\\n        mc = pref[i-1]\\nif max(suff) > d:\\n    print(-1)\\n    return\\nc = 0\\nans = 0\\nfor i in range(n):\\n    if a[i] != 0:\\n        c += a[i]\\n    else:\\n        if c < 0:\\n            ans += 1\\n            c = max(0, c)\\n            c += d - suff[i]\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\nimport math\\nimport collections\\nimport bisect\\nimport heapq\\nimport time\\nimport random\\nimport itertools\\nimport sys\\n\\n\\\"\\\"\\\"\\ncreated by shhuan at 2017/11/24 00:20\\n\\n\\\"\\\"\\\"\\n\\nN, D = map(int, input().split())\\nA = [int(x) for x in input().split()]\\n\\npresum = [0] * (N+1)\\n\\nfor i in range(1, N+1):\\n    presum[i] = presum[i-1] + A[i-1]\\n\\nrightmax = [0] * N\\nmx = float('-inf')\\nfor i in range(N-1, -1, -1):\\n    mx = max(mx, presum[i+1])\\n    rightmax[i] = mx\\n\\n# print(presum)\\n# print(rightmax)\\n\\nif any(v > D for v in presum):\\n    print(-1)\\n    return\\n\\nans = 0\\nadded = 0\\nfor i in range(N):\\n    if A[i] == 0:\\n        if presum[i+1] + added < 0:\\n            dmin = 0-presum[i+1]-added\\n            dmax = min(D-presum[i+1]-added, D-added-rightmax[i])\\n            if dmin > dmax:\\n                print(-1)\\n                return\\n\\n            added += dmax\\n            ans += 1\\nprint(ans)\", \"n, d = list(map(int, input().split()))\\na = [0] + list(map(int, input().split()))\\nb = [0] * (n + 2)\\nb[n] = a[n]\\nnow = a[n]\\nfor i in range(n - 1 , 0 , -1):\\n    now = a[i] + max(now, 0)\\n    b[i] = now\\nnow = 0\\nres = 0\\nfor i in range(1 , n + 1):\\n    if a[i] == 0:\\n        if now < 0:\\n            res += 1\\n            now = min(d, max(0, d - b[i + 1]))\\n    else:\\n        now += a[i]\\n        if now > d:\\n            res = -1\\n            break\\nprint(res)\\n\\n\\n\", \"f = lambda: map(int, input().split())\\nn, d = f()\\nh = s = k = 0\\nfor q in f():\\n    h, s = h + q, min(d, s + q)\\n    if h > d:\\n        k = -1\\n        break\\n    if q == 0:\\n        h = max(0, h)\\n        if s < 0: s, k = d, k + 1\\nprint(k)\", \"def main():\\n\\tn, d = map(int, input().split())\\n\\ta = list(map(int, input().split()))\\n\\t\\n\\tpref, mx, add, ans = [0] * n, [0] * n, 0, 0\\n\\n\\tfor pos in range(n):\\n\\t\\tpref[pos] = a[pos] if not pos else a[pos] + pref[pos-1]\\n\\n\\tfor pos in range(n-1, -1, -1):\\n\\t\\tmx[pos] = pref[pos] if pos == n - 1 else max(mx[pos + 1], pref[pos])\\n\\n\\tfor i in range(n):\\n\\t\\tif pref[i] + add > d:\\n\\t\\t\\tprint(\\\"-1\\\")\\n\\t\\t\\treturn\\n\\t\\tif a[i] == 0 and pref[i] + add < 0:\\n\\t\\t\\tans += 1\\n\\t\\t\\tadd += max(-(pref[i] + add), d - mx[i] - add)\\n\\tprint(ans)\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"[n, d] = [int(x) for x in input().split(' ')]\\nA = [int(a) for a in input().split(' ')]\\n\\ndef solve():\\n    ans = 0\\n    bal = 0\\n    minGap = 0\\n    for i in range(n):\\n        if A[i] == 0:\\n            if bal < 0:\\n                go = min(-bal, minGap)\\n                minGap -= go\\n                bal += go\\n                if bal < 0:\\n                    ans += 1\\n                    bal = 0\\n                    minGap = d\\n        else:\\n            bal += A[i]\\n            if bal > d:\\n                return -1\\n            minGap = min(minGap, d - bal)\\n    return ans\\n\\nprint(solve())\", \"n, d = list(map(int, input().split()))\\nl = list(map(int, input().split()))\\nmus = [0] * n\\nmus[0] = l[0]\\ncnt = 0\\nans = 0\\nfor i in range(1, n):\\n    mus[i] = mus[i - 1] +  l[i]\\nsuf = [0] * n\\nsuf[-1] = mus[-1]\\nfor i in range(n - 2, -1, -1):\\n    suf[i] = max(mus[i], suf[i + 1])\\nfor i in range(n):\\n    if l[i] == 0 and mus[i] + cnt < 0:\\n        if (d - suf[i] - cnt < 0 or d - suf[i] < abs(mus[i])):\\n            print(-1)\\n            return\\n        else:\\n            cnt += (d - suf[i]  - cnt)\\n            ans += 1\\nif suf[0] > d:\\n    print(-1)\\n    return\\nprint(ans)\", \"#Bhargey Mehta (Sophomore)\\n#DA-IICT, Gandhinagar\\nimport sys, math, queue, bisect\\n#sys.stdin = open(\\\"input.txt\\\", \\\"r\\\")\\nMOD = 10**9+7\\nsys.setrecursionlimit(1000000)\\n\\nn, d = map(int, input().split())\\na = list(map(int, input().split()))\\np = [0 for i in range(n)]\\nfor i in range(n):\\n    p[i] = p[i-1]+a[i]\\nmx = [-1 for i in range(n)]\\nmx[-1] = p[-1]\\nfor i in range(n-2, -1, -1):\\n    mx[i] = max(mx[i+1], p[i])\\nc = 0\\nans = 0\\nfor i in range(n):\\n    p[i] += c\\n    if p[i] > d:\\n        print(-1)\\n        return\\n    if a[i] != 0 or p[i] >= 0: continue\\n\\n    av = d-(mx[i]+c)\\n    if -p[i] > av:\\n        print(-1)\\n        return\\n    ans += 1\\n    c = d-mx[i]\\nprint(ans)\", \"import os\\nimport sys\\n\\ndef log(*args, **kwargs):\\n    if os.environ.get('CODEFR'):\\n        print(*args, **kwargs)\\n\\n\\n#n = int(input())\\nn, d = tuple(map(int,input().split()))\\na = list(map(int,input().split()))\\n\\ns = 0\\nk = 0\\ndep = 0\\nfor i in a:\\n    if i == 0:\\n        if s < 0:\\n            if dep < -s:\\n                k += 1\\n                dep = d\\n            else:\\n                dep += s\\n            s = 0\\n    else:\\n        s += i\\n        if s > d:\\n            print(-1)\\n            return\\n        dep = min(dep, d - s)\\n\\nprint(k)\\n\", \"R = lambda: map(int, input().split())\\nn, k = R()\\narr = list(R())\\ntup = [0, 0]\\nres = 0\\nfor x in arr:\\n    if x != 0:\\n        tup[0], tup[1] = tup[0] + x, tup[1] + x\\n        tup[1] = min(tup[1], k)\\n    elif tup[1] < 0:\\n        tup[0], tup[1] = 0, k\\n        res += 1\\n    else:\\n        tup[0] = max(0, tup[0])\\n    if tup[0] > k:\\n        res = -1\\n        break\\nprint(res)\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"import sys\\ninput = sys.stdin.readline\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nans = 0\\nub, lb = 0, 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        if lb < 0:\\n            lb = 0\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\n\\nprint(ans)\\n\", \"n,d=list(map(int,input().split()))\\na=list(map(int,input().split()))\\ns=0\\nm=0\\nans=0 \\nflag=True\\nn=len(a)\\nfor i in range(n):\\n    if a[i]==0:\\n        if s<0:\\n            s=d\\n            m=d\\n            ans+=1\\n        else:\\n            m=min(m,s)\\n    elif a[i]<0:\\n        s=s+a[i] \\n    else:\\n        if(s+a[i]>d):\\n            if(s+a[i]-d)>m:\\n                flag=False\\n                break \\n            else:\\n                m-=(s+a[i]-d)\\n                s=d \\n        else:\\n            s=s+a[i] \\nif flag:\\n    print(ans)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nub, lb = 0, 0\\nans = 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        lb = max(lb, 0)\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "3 4\n-10 0 20\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/893/D"
    },
    {
        "id": 54,
        "task_id": 995,
        "test_case_id": 2,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "5\n5 -4 2 1 8\n",
        "output": "5 5 3 2 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 55,
        "task_id": 995,
        "test_case_id": 4,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "3\n-10 -5 7\n",
        "output": "3 2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 56,
        "task_id": 995,
        "test_case_id": 6,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "8\n-5 5 10 -5 9 -2 5 7\n",
        "output": "8 7 7 5 6 3 0 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 57,
        "task_id": 995,
        "test_case_id": 7,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "19\n-51 -47 -57 57 -62 41 42 53 47 -7 -41 -37 -41 -46 -47 41 -39 -59 -50\n",
        "output": "19 19 18 17 16 15 14 13 12 11 10 11 7 4 3 1 0 0 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 58,
        "task_id": 995,
        "test_case_id": 8,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "25\n94 -94 61 -98 89 -91 83 61 -3 53 91 61 -3 -3 95 -67 -73 -59 -73 37 -47 -3 94 -79 -73\n",
        "output": "26 26 25 29 27 26 27 27 23 20 14 16 10 10 7 8 4 0 0 0 0 0 0 0 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 59,
        "task_id": 995,
        "test_case_id": 9,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "80\n8861 -8846 -3257 8263 -8045 4549 9626 -8599 5755 -3559 5813 -7411 9151 -1847 2441 4201 2381 4651 -6571 199 -6737 -6333 -9433 -4967 9041 -9319 6801 5813 -2731 -8599 7681 -1303 -7333 6067 -1847 -6333 6047 -7907 -7333 8677 -937 829 2441 -5702 -8045 -3037 -4882 -7703 9001 -5702 -2039 -7493 9173 -6047 6046 5802 -8609 9173 8083 8291 -1453 2381 7321 -859 8539 -2011 2374 8263 8111 -5897 -2017 -2311 -571 4993 -3389 -7789 1847 -4799 4651 -5702\n",
        "output": "80 79 78 77 77 78 77 76 75 74 73 72 72 71 70 71 69 68 67 66 68 66 69 64 66 65 63 60 58 57 55 56 52 53 48 48 46 45 44 41 42 42 39 39 36 35 33 33 31 29 28 27 25 26 23 22 25 22 15 16 12 13 9 12 5 4 3 0 0 0 0 0 0 0 0 0 0 0 0 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 60,
        "task_id": 995,
        "test_case_id": 11,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "2\n6649609 -8006683\n",
        "output": "2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 61,
        "task_id": 995,
        "test_case_id": 12,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "4\n0 -7955897 3123413 -7955897\n",
        "output": "5 5 0 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 62,
        "task_id": 995,
        "test_case_id": 23,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 -4 0 2 1 8\n",
        "output": "8 8 3 2 0 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 63,
        "task_id": 995,
        "test_case_id": 25,
        "question": "SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, such that the product of any pair of integers in the same group is a perfect square. \n\nEach integer must be in exactly one group. However, integers in a group do not necessarily have to be contiguous in the array.\n\nSaMer wishes to create more cases from the test case he already has. His test case has an array $A$ of $n$ integers, and he needs to find the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$ for each integer $k$ between $1$ and $n$ (inclusive).\n\n\n-----Input-----\n\nThe first line of input contains a single integer $n$ ($1 \\leq n \\leq 5000$), the size of the array.\n\nThe second line contains $n$ integers $a_1$,$a_2$,$\\dots$,$a_n$ ($-10^8 \\leq a_i \\leq 10^8$), the values of the array.\n\n\n-----Output-----\n\nOutput $n$ space-separated integers, the $k$-th integer should be the number of contiguous subarrays of $A$ that have an answer to the problem equal to $k$.\n\n\n-----Examples-----\nInput\n2\n5 5\n\nOutput\n3 0\n\nInput\n5\n5 -4 2 1 8\n\nOutput\n5 5 3 2 0\n\nInput\n1\n0\n\nOutput\n1",
        "solutions": "[\"#!/usr/bin/env python3\\n\\nfrom math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\npsq = [p*p for p in primes]\\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p, pp in zip(primes, psq):\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\", \"from math import sqrt\\n\\nprimes = [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,\\n\\t\\t\\t101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n\\t\\t\\t197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,\\n\\t\\t\\t311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,\\n\\t\\t\\t431, 433, 439, 443, 449, 457, 461, 463] \\n\\n\\ndef sqfree(x):\\n\\tif x == 0:\\n\\t\\treturn x\\n\\ty = 1\\n\\tfor p in primes:\\n\\t\\tpp=p*p\\n\\t\\twhile x % pp == 0:\\n\\t\\t\\tx //= pp\\n\\t\\tif x % p == 0:\\n\\t\\t\\tx //= p\\n\\t\\t\\ty *= p\\n\\t\\tif abs(x) < p:\\n\\t\\t\\tbreak\\n\\tif int(sqrt(abs(x)))**2 == abs(x):\\n\\t\\treturn (y if x > 0 else -y)\\n\\telse:\\n\\t\\treturn x * y\\n\\nn = int(input().strip())\\nais = list(map(int, input().strip().split()))\\nbis = list(map(sqfree, ais))\\n\\n\\nprev = [-1 for i in range(n)]\\nlast = {}\\n\\n\\nfor i, b in enumerate(bis):\\n\\tif b in last:\\n\\t\\tprev[i] = last[b]\\n\\tlast[b] = i\\n\\t\\nres = [0 for i in range(n)]\\t\\nfor l in range(n):\\n\\tcnt = 0\\n\\tfor r in range(l, n):\\n\\t\\tif bis[r] != 0 and prev[r] < l:\\n\\t\\t\\tcnt += 1\\n\\t\\tres[max(cnt - 1, 0)] += 1\\n\\n\\nprint(' '.join(map(str, res)))\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 0 -1\n",
        "output": "5 1 0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/980/D"
    },
    {
        "id": 64,
        "task_id": 1292,
        "test_case_id": 1,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 3 2\n1 1\n1..\n...\n..2\n",
        "output": "6 3 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 65,
        "task_id": 1292,
        "test_case_id": 3,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 4 2\n1 1\n....\n1..2\n....\n",
        "output": "6 6 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 66,
        "task_id": 1292,
        "test_case_id": 4,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 4 2\n2 1\n....\n1..2\n....\n",
        "output": "9 3 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 67,
        "task_id": 1292,
        "test_case_id": 5,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 4 2\n1 1000000000\n....\n....\n..2.\n...1\n",
        "output": "3 13 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 68,
        "task_id": 1292,
        "test_case_id": 6,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 4 2\n1 1000000000\n....\n....\n..1.\n...2\n",
        "output": "15 1 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 69,
        "task_id": 1292,
        "test_case_id": 8,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "5 5 1\n1\n.....\n.....\n..1..\n.....\n.....\n",
        "output": "25 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 70,
        "task_id": 1292,
        "test_case_id": 12,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 4 2\n5 1\n1#.2\n.#..\n####\n....\n",
        "output": "2 4 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 71,
        "task_id": 1292,
        "test_case_id": 13,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 4 2\n5 1\n1#.2\n.#..\n.##.\n....\n",
        "output": "8 4 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 72,
        "task_id": 1292,
        "test_case_id": 16,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 7 1\n1\n###11..\n1...11.\n.1#1##.\n",
        "output": "15 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 73,
        "task_id": 1292,
        "test_case_id": 17,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 4 2\n3 1\n1#.2\n.#..\n.#..\n....\n",
        "output": "8 5 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 74,
        "task_id": 1292,
        "test_case_id": 18,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 2 2\n1 1\n.1\n2.\n",
        "output": "3 1 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 75,
        "task_id": 1292,
        "test_case_id": 19,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 3 2\n1 2\n...\n21.\n",
        "output": "4 2 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 76,
        "task_id": 1292,
        "test_case_id": 20,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 3 2\n4 1\n1#2\n.#.\n...\n",
        "output": "5 2 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 77,
        "task_id": 1355,
        "test_case_id": 1,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n",
        "output": "1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 78,
        "task_id": 1355,
        "test_case_id": 2,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "4 9\n0 0\n0 1\n1 1\n1 0\n0 0 1 1\n1 1 0 0\n0 0 1 0\n0 0 0.5 0\n0 0.5 1 0.5\n0 1 1 1\n1 1 1 0\n0.75 0.75 0.75 0.25\n0 0.25 1 0.75\n",
        "output": "1.41421356237309514547\n1.41421356237309514547\n1.00000000000000000000\n1.00000000000000000000\n1.00000000000000000000\n1.00000000000000000000\n1.00000000000000000000\n1.00000000000000000000\n1.11803398874989490253\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 79,
        "task_id": 1355,
        "test_case_id": 3,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "9 7\n0 0\n0 2\n1 1\n2 2\n3 1\n4 2\n5 1\n6 2\n6 0\n0 1 6 1\n0 1.5 6 1.5\n0 2 6 1\n0 1 6 2\n0 2 6 2\n0 0 0 2\n0 0 6 0\n",
        "output": "6.00000000000000000000\n3.00000000000000000000\n2.95448465757342138005\n2.95448465757342093596\n0.00000000000000000000\n2.00000000000000000000\n6.00000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 80,
        "task_id": 1355,
        "test_case_id": 4,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "12 8\n0 0\n10000 0\n10000 5002\n2 5002\n2 9998\n10000 9998\n10000 10000\n0 10000\n0 5000\n9998 5000\n9998 2\n0 2\n5000 -1 5000 10001\n0 0 10000 10000\n0 0 1 1\n0 0 2 2\n0 5000 5000 5000\n-2 0 10002 10000\n-2 10000 10002 0\n-10000 0 20000 10000\n",
        "output": "6.00000000000000000000\n8.48528137423856954058\n8.48528137423856954058\n8.48528137423856954058\n10000.00000000000000000000\n2.83125515610529765453\n8.48471631080716015560\n6.32455532033675815740\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 81,
        "task_id": 1355,
        "test_case_id": 5,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "12 7\n0 2\n9998 2\n9998 5000\n0 5000\n0 10000\n10000 10000\n10000 9998\n2 9998\n2 5002\n10000 5002\n10000 0\n0 0\n5000 -1 5000 10001\n0 0 10000 10000\n0 0 1 1\n0 5000 5000 5000\n-2 0 10002 10000\n-2 10000 10002 0\n-10000 0 20000 10000\n",
        "output": "6.00000000000000000000\n8.48528137423856954058\n8.48528137423856954058\n10000.00000000000000000000\n2.83125515610529765453\n8.48471631080716015560\n6.32455532033675815740\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 82,
        "task_id": 1355,
        "test_case_id": 6,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "9 5\n0 0\n6 0\n6 2\n5 1\n4 2\n3 1\n2 2\n1 1\n0 2\n-1 2 7.5 1\n0 1 6 1\n0 1.5 6 1.5\n0 2 6 1\n0 0 0 2\n",
        "output": "2.79811274979359403403\n6.00000000000000000000\n3.00000000000000000000\n2.95448465757342138005\n2.00000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 83,
        "task_id": 1355,
        "test_case_id": 7,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "4 5\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n0 0 100000 99999\n-100000 -100000 100000 99999\n",
        "output": "1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000\n1.41420649132296061268\n0.70710147787905963668\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 84,
        "task_id": 1355,
        "test_case_id": 8,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "9 5\n0 0\n0 2\n1 1\n2 2\n3 1\n4 2\n5 1\n6 2\n6 0\n-1 2 7.5 1\n0 1 6 1\n0 1.5 6 1.5\n0 2 6 1\n0 0 0 2\n",
        "output": "2.79811274979359403403\n6.00000000000000000000\n3.00000000000000000000\n2.95448465757342138005\n2.00000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 85,
        "task_id": 1355,
        "test_case_id": 12,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 1\n99999.99 -100000\n-100000 100000\n100000 -100000\n99999.99 -100000 -100000 100000\n",
        "output": "282842.70540355128468945622\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 86,
        "task_id": 1355,
        "test_case_id": 13,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 3\n100000 100000\n-99999.99 -100000\n-100000 -100000\n100000 100000 -99999.99 -100000\n-99999.99 -100000 -100000 -100000\n-100000 -100000 -100000 -99999.99\n",
        "output": "282842.70540355128468945622\n0.01000000000000000021\n0.00000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 87,
        "task_id": 1355,
        "test_case_id": 14,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 7\n99999.99 -100000\n-100000 100000\n-99999.99 100000\n1 1 1.01 1.01\n99999.99 -100000 -100000 100000\n-99999.99 100000 -100000 100000\n99999.99 -100000 -99999.99 100000\n-100000 100000 99999.99 -100000\n1 1 2 2\n-100000 100000 100000 -100000\n",
        "output": "0.00353553399432175773\n282842.70540355128468945622\n0.01000000000000000021\n282842.69833248376380652189\n282842.70540355128468945622\n0.00353553399432175860\n141421.35623730949009768665\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 88,
        "task_id": 1355,
        "test_case_id": 15,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 1\n-99999.99 100000\n100000 -100000\n100000 -99999.99\n-99999.99 100000 100000 -100000\n",
        "output": "282842.70540355128468945622\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 89,
        "task_id": 1355,
        "test_case_id": 16,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 1\n2 2\n100000 100000\n-99999.99 -100000\n100000 100000 -99999.99 -100000\n",
        "output": "282842.70540355128468945622\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 90,
        "task_id": 1355,
        "test_case_id": 18,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 8\n-100000 -100000\n100000 100000\n0 1\n-100000 -100000 100000 -80000\n-100000 -100000 100000 -99000\n-100000 -100000 100000 -99990\n-100000 -100000 100000 -99999\n-100000 -100000 100000 -99999.99\n-100000 -100000 100000 100000\n-100000 -100000 100000 99999.99\n-100000 100000 100000 -100000\n",
        "output": "0.00000000000000000000\n0.00000000000000000000\n0.00000000000000000000\n0.00000000000000000000\n0.00000000000000000000\n282842.71247461898019537330\n0.00000000000000000000\n0.70710324567031901388\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 91,
        "task_id": 1355,
        "test_case_id": 19,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 8\n-100000 -100000\n100000 100000\n1 0\n-100000 -100000 100000 -80000\n-100000 -100000 100000 -99000\n-100000 -100000 100000 -99990\n-100000 -100000 100000 -99999\n-100000 -100000 100000 -99999.99\n-100000 -100000 100000 100000\n-100000 -100000 100000 99999.99\n-100000 100000 100000 -100000\n",
        "output": "0.00000000000000000000\n0.00000000000000000000\n0.00000000000000000000\n0.00000000000000000000\n0.00000000000000000000\n282842.71247461898019537330\n281435.54176649585133418441\n0.70710324567031901388\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 92,
        "task_id": 1463,
        "test_case_id": 2,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "3\n1 5 2\n1 1 1\n1 2 3\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 93,
        "task_id": 1463,
        "test_case_id": 8,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "4\n1 1 1 1\n1 13 1 2\n4 5 1 3\n7 11 6 1\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 94,
        "task_id": 1463,
        "test_case_id": 13,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "3\n1 1 4\n1 1 2\n1 1 2\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 95,
        "task_id": 1463,
        "test_case_id": 15,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "3\n1 2 1\n2 2 3\n1 3 1\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 96,
        "task_id": 3183,
        "test_case_id": 2,
        "question": "-----Input-----\nThe first line of input contains a line contains a line with four non-negative integers, $2 \\le n \\le 250$, $0 \\le m \\le 5000$, $0 \\le s \\le n-1$ and $0 \\le t \\le n-1$, separated by single spaces, where $n$ is the numbers of nodes in the graph, $m$ is the number of edges, $s$ is the source and $t$ is the sink ($s \\ne t$). Nodes are numbered from $0$ to $n-1$. Then follow $m$ lines, each line consisting of four (space-separated) integers $u$, $v$, $c$ and $w$ indicating that there is an edge from $u$ to $v$ in the graph with capacity $1 \\le c \\le 10000$ and cost $1 \\le w \\le 1000$.\n\n-----Output-----\nOutput a single line containing two integers; the size $F$ of a maximum flow from node $s$ to node $t$, and the cost of a mimimum cost flow of size $F$. You may assume that $F < 2^{31}$.\n\n-----Examples-----\nSample Input 1:\n4 4 0 3\n0 1 4 10\n1 2 2 10\n0 2 4 30\n2 3 4 10\nSample Output 1:\n4 140\n\nSample Input 2:\n2 1 0 1\n0 1 1000 100\nSample Output 2:\n1000 100000",
        "solutions": "",
        "difficulty": "competition",
        "input": "2 1 0 1\n0 1 1000 100\n",
        "output": "1000 100000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/mincostmaxflow"
    },
    {
        "id": 97,
        "task_id": 75,
        "test_case_id": 1,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 4\n.*..\n....\n.*..\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 98,
        "task_id": 75,
        "test_case_id": 6,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n.........*\n.........*\n........**\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n",
        "output": "YES\n3 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 99,
        "task_id": 75,
        "test_case_id": 7,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n..........\n..........\n....*.....\n..........\n..........\n**..*.****\n....*.....\n....*.....\n....*.....\n..........\n",
        "output": "YES\n6 5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 100,
        "task_id": 75,
        "test_case_id": 8,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n.........*\n",
        "output": "YES\n1 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 101,
        "task_id": 75,
        "test_case_id": 11,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n..........\n..........\n..........\n..........\n..........\n***.*.****\n..........\n..........\n..........\n..........\n",
        "output": "YES\n6 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 102,
        "task_id": 75,
        "test_case_id": 14,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n....\n....\n....\n....\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 103,
        "task_id": 75,
        "test_case_id": 16,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n....\n...*\n....\n*..*\n",
        "output": "YES\n4 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 104,
        "task_id": 75,
        "test_case_id": 17,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n*...\n*...\n....\n****\n",
        "output": "YES\n4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 105,
        "task_id": 75,
        "test_case_id": 18,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n..*.\n....\n...*\n....\n",
        "output": "YES\n3 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 106,
        "task_id": 75,
        "test_case_id": 19,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n***.\n....\n*...\n....\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 107,
        "task_id": 75,
        "test_case_id": 21,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "1 1\n.\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 108,
        "task_id": 75,
        "test_case_id": 22,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "1 2\n.*\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 109,
        "task_id": 75,
        "test_case_id": 23,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "1 3\n...\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 110,
        "task_id": 75,
        "test_case_id": 24,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 1\n.\n*\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 111,
        "task_id": 75,
        "test_case_id": 26,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 3\n*.*\n...\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 112,
        "task_id": 75,
        "test_case_id": 37,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n*...\n....\n....\n...*\n",
        "output": "YES\n4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 113,
        "task_id": 75,
        "test_case_id": 38,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 4\n...*\n...*\n",
        "output": "YES\n1 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 114,
        "task_id": 75,
        "test_case_id": 39,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 2\n..\n..\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 115,
        "task_id": 75,
        "test_case_id": 40,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n...*\n....\n....\n*...\n",
        "output": "YES\n4 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 116,
        "task_id": 75,
        "test_case_id": 42,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n..*\n.*.\n..*\n",
        "output": "YES\n2 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 117,
        "task_id": 75,
        "test_case_id": 43,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n...\n...\n...\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 118,
        "task_id": 75,
        "test_case_id": 45,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 7\n...*...\n...*...\n...*...\n..*.*..\n...*...\n",
        "output": "YES\n4 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 119,
        "task_id": 75,
        "test_case_id": 54,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 5\n.....\n.....\n.....\n.....\n.....\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 120,
        "task_id": 75,
        "test_case_id": 58,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n...\n*.*\n.*.\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 121,
        "task_id": 75,
        "test_case_id": 59,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 2\n..\n..\n**\n",
        "output": "YES\n3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 122,
        "task_id": 75,
        "test_case_id": 60,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 4\n...*\n...*\n...*\n",
        "output": "YES\n1 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 123,
        "task_id": 75,
        "test_case_id": 65,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 5\n....*\n....*\n....*\n",
        "output": "YES\n1 5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 124,
        "task_id": 75,
        "test_case_id": 67,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n*.*\n.*.\n...\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 125,
        "task_id": 75,
        "test_case_id": 68,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n*..\n...\n..*\n",
        "output": "YES\n3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 126,
        "task_id": 75,
        "test_case_id": 69,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 3\n..*\n..*\n",
        "output": "YES\n1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 127,
        "task_id": 75,
        "test_case_id": 72,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n.*.\n..*\n...\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 128,
        "task_id": 75,
        "test_case_id": 73,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n..*\n*..\n*..\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 129,
        "task_id": 75,
        "test_case_id": 75,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 4\n....\n....\n....\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 130,
        "task_id": 75,
        "test_case_id": 76,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "10 10\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 131,
        "task_id": 75,
        "test_case_id": 78,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n..*\n*..\n...\n",
        "output": "YES\n2 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 132,
        "task_id": 75,
        "test_case_id": 79,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n*..\n.*.\n...\n",
        "output": "YES\n2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 133,
        "task_id": 75,
        "test_case_id": 81,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n.*..\n*.**\n....\n.*..\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 134,
        "task_id": 75,
        "test_case_id": 83,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n..*\n*..\n..*\n",
        "output": "YES\n2 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 135,
        "task_id": 75,
        "test_case_id": 84,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "6 6\n..*...\n......\n......\n......\n......\n*....*\n",
        "output": "YES\n6 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 136,
        "task_id": 75,
        "test_case_id": 85,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n***\n.*.\n...\n",
        "output": "YES\n1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 137,
        "task_id": 75,
        "test_case_id": 86,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n.*..\n*...\n.*..\n.*..\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 138,
        "task_id": 75,
        "test_case_id": 90,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 5\n*...*\n.....\n.....\n.....\n..*..\n",
        "output": "YES\n1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 139,
        "task_id": 75,
        "test_case_id": 91,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n**.\n...\n..*\n",
        "output": "YES\n1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 140,
        "task_id": 75,
        "test_case_id": 93,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 4\n....\n....\n*..*\n....\n.*..\n",
        "output": "YES\n3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 141,
        "task_id": 75,
        "test_case_id": 96,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n.*.\n*..\n...\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 142,
        "task_id": 75,
        "test_case_id": 97,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n.*.\n..*\n.*.\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 143,
        "task_id": 75,
        "test_case_id": 98,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 3\n.*.\n.*.\n.*.\n***\n...\n",
        "output": "YES\n4 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 144,
        "task_id": 75,
        "test_case_id": 102,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n*..\n**.\n...\n",
        "output": "YES\n2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 145,
        "task_id": 75,
        "test_case_id": 103,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 3\n.*.\n.*.\n.**\n",
        "output": "YES\n3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 146,
        "task_id": 75,
        "test_case_id": 104,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "2 4\n....\n....\n",
        "output": "YES\n1 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 147,
        "task_id": 75,
        "test_case_id": 105,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "4 4\n*...\n....\n....\n..**\n",
        "output": "YES\n4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 148,
        "task_id": 75,
        "test_case_id": 107,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 5\n.*...\n.....\n...*.\n...*.\n.....\n",
        "output": "YES\n1 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 149,
        "task_id": 75,
        "test_case_id": 110,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "6 3\n...\n...\n...\n...\n**.\n.*.\n",
        "output": "YES\n5 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 150,
        "task_id": 75,
        "test_case_id": 112,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "5 5\n*..*.\n.....\n.....\n.....\n...*.\n",
        "output": "YES\n1 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 151,
        "task_id": 75,
        "test_case_id": 113,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "3 4\n.*..\n*.**\n....\n",
        "output": "YES\n2 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 152,
        "task_id": 75,
        "test_case_id": 114,
        "question": "You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (\".\") or it can be occupied by a wall (\"*\"). \n\nYou have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.\n\nYou are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.\n\n\n-----Input-----\n\nThe first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field. \n\nThe next n lines contain m symbols \".\" and \"*\" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to \".\", then the corresponding cell is empty, otherwise it equals \"*\" and the corresponding cell is occupied by a wall.\n\n\n-----Output-----\n\nIf it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print \"NO\" in the first line (without quotes).\n\nOtherwise print \"YES\" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\n3 4\n.*..\n....\n.*..\n\nOutput\nYES\n1 2\n\nInput\n3 3\n..*\n.*.\n*..\n\nOutput\nNO\n\nInput\n6 5\n..*..\n..*..\n*****\n..*..\n..*..\n..*..\n\nOutput\nYES\n3 3",
        "solutions": "[\"n, m = list(map(int, input().split()))\\np = []\\nans = 0\\nfor i in range(n):\\n    s = input()\\n    ans += s.count('*')\\n    p.append(s)\\ndp = []\\nfor i in range(n):\\n    dp.append([0] * m)\\nfor i in range(n):\\n    col = p[i].count('*')\\n    for t in range(m):\\n        dp[i][t] = col\\nfor i in range(m):\\n    col = 0\\n    for t in range(n):\\n        if p[t][i] == '*':\\n            col += 1\\n    for t in range(n):\\n        dp[t][i] += col\\nf = False\\nfor i in range(n):\\n    for t in range(m):\\n        if dp[i][t] - int(p[i][t] == '*') == ans:\\n            f = True\\n            print('YES')\\n            print(i + 1, t + 1)\\n            break\\n    if f:\\n        break\\nif not f:\\n    print('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\ncntx = [0] * n\\ncnty = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            cntx[i] += 1\\n            cnty[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = cntx[i] + cnty[j] - int(a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    d = [[0] * m for i in range(n)]\\n    al = 0\\n    val_x = [0] * n\\n    val_y = [0] * m\\n    for i in range(n):\\n        s = input()\\n        cnt = 0\\n        for j in range(m):\\n            d[i][j] = s[j]\\n            cnt += (s[j] == '*')\\n            al += (s[j] == '*')\\n        val_x[i] = cnt\\n    for i in range(m):\\n        cnt = 0\\n        for j in range(n):\\n            cnt += (d[j][i] == '*')\\n        val_y[i] = cnt\\n    for i in range(n):\\n        for j in range(m):\\n            if val_x[i] + val_y[j] - (d[i][j] == '*') == al:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n    print(\\\"NO\\\")\\n    \\nmain()\", \"#!/usr/bin/env pypy3\\n\\nimport array\\nimport itertools\\n\\nIMPOSSIBLE = (-1, -1)\\n\\n\\ndef place_bomb(height, width, is_wall):\\n    # zero-based\\n    walls_row = array.array(\\\"L\\\", (sum(row) for row in is_wall))\\n    walls_column = array.array(\\\"L\\\")\\n    for column_idx in range(width):\\n        walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\\n    total_walls = sum(walls_row)\\n    for bomb_r, bomb_c in itertools.product(list(range(height)), list(range(width))):\\n        wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\\n        wiped_walls -= is_wall[bomb_r][bomb_c]\\n        if wiped_walls == total_walls:\\n            # one-based\\n            return (bomb_r + 1, bomb_c + 1)\\n    else:\\n        return IMPOSSIBLE\\n\\n\\ndef main():\\n    height, width = list(map(int, input().split()))\\n    is_wall = [array.array(\\\"B\\\",\\n               [c == \\\"*\\\" for c in input()]) for _ in range(height)]\\n    ans = place_bomb(height, width, is_wall)\\n    if ans != IMPOSSIBLE:\\n        print(\\\"YES\\\")\\n        print(*ans)\\n    else:\\n        print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\\n            \\n    \\n\", \"R, C = [int(x) for x in input().split()]\\ngrid = [list(input()) for _ in range(R)]\\n\\nwpr = [0] * R\\nwpc = [0] * C\\nn = 0\\n\\nfor r in range(R):\\n    for c in range(C):\\n        if grid[r][c] != '*':\\n            continue\\n        wpr[r] += 1\\n        wpc[c] += 1\\n        n += 1\\n\\nfor r in range(R):\\n    for c in range(C):\\n        field = 1 if grid[r][c] == '*' else 0\\n\\n        if wpr[r] + wpc[c] - field == n:\\n            print('YES')\\n            print(r+1, c+1)\\n            return\\n\\nprint('NO')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nx = [0] * n\\ny = [0] * m\\ncnt = 0\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j] == '*':\\n            x[i] += 1\\n            y[j] += 1\\n            cnt += 1\\nfor i in range(n):\\n    for j in range(m):\\n        cur = x[i] + y[j] - (a[i][j] == '*')\\n        if cur == cnt:\\n            print('YES')\\n            print(i + 1, j + 1)\\n            return\\nprint('NO')\\n\", \"x, y = list(map(int, input().split(' ')))\\nmap_x, map_y = {}, {}\\nmax_r, max_rv = 0, 0\\nmax_c, max_cv = 0, 0\\nstr_l = []\\n\\nfor _ in range(x):\\n    str = input()\\n    str_l.append(str)\\n    for i in range(len(str)):\\n        if str[i] == '*':\\n            if i not in map_y:\\n                map_y[i] = {}\\n            map_y[i][_] = None\\n\\n# transpose string arrays\\nstr_t = list(zip(*str_l))\\n\\n# find column contains max number of walls\\nfor _ in range(y):\\n    walls = str_t[_].count('*')\\n    if walls > max_cv:\\n        max_c = _\\n        max_cv = walls\\n\\n# find row contains max number of walls\\nfor _ in range(x):\\n\\n    walls = str_l[_].count('*')\\n\\n    if walls > max_rv:\\n        max_r = _\\n        max_rv = walls\\n\\n    # if number same, then do a smart row choice\\n    elif walls == max_rv:\\n        if str_l[_][max_c] == '.':\\n            max_r = _\\n            max_rv = walls\\n\\n\\ndef check(r, c):\\n\\n    sum = 1 if c in map_y else 0\\n\\n    # remove from column\\n    for yy in range(y):\\n        if yy in map_y and yy != c:\\n            if len(map_y[yy]) == 1 and r in map_y[yy]:\\n                sum += 1\\n\\n    return len(map_y) == sum\\n\\nfor c in range(y):\\n    if check(max_r, c) is True:\\n        print(\\\"YES\\\")\\n        print(max_r+1, c+1)\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"st=input()\\ntmp=st.split(' ')\\nm=int(tmp[0])\\nn=int(tmp[1])\\nmapp=[]\\noc=[]\\nfor i in range(m):\\n    tmp=input()\\n    mapp.append(tmp)\\n    for j in range(n):\\n        if tmp[j]!='.':\\n            oc.append((i,j))\\nfor x in range(m):\\n    for y in range(n):\\n        for i in oc:\\n            if i[0]!=x and i[1]!=y:\\n                break\\n        else:\\n            print('YES')\\n            print(x+1,y+1)\\n            return\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), 0\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                t += 1\\n                if t == n + m:\\n                    print(\\\"NO\\\")\\n                    return\\n                walls.add((x, y))\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        for y, b in enumerate(yy):\\n            if a + b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys;input = sys.stdin.readline;print = sys.stdout.write\\n\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    arr, have, dpx, dpy, cnt = [0]*n, set(), [0]*n, [0]*m, 0\\n    for i in range(n):\\n        arr[i] = input().rstrip()\\n        for j in range(m):\\n            if arr[i][j] == \\\"*\\\":\\n                dpx[i], dpy[j], cnt = dpx[i] + 1, dpy[j] + 1, cnt + 1\\n\\n    for i in range(n):\\n        for j in range(m):\\n            if dpx[i] + dpy[j] - (arr[i][j] == \\\"*\\\") == cnt: print(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1)), return\\n\\n    print(\\\"NO\\\")\\n\\n\\nmain()\\n\", \"t = input;p = print;r = range\\nn, m = map(int, t().split())\\na, x, y, c =  [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c: p(\\\"YES\\\\n{0} {1}\\\".format(i + 1, j + 1));return\\np(\\\"NO\\\")\\n\", \"t = input;p = print;r = range;n, m = map(int, t().split());a, x, y, c = [], [0]*n, [0]*m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int, t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j]==\\\"*\\\":x[i]+=1;y[j]+=1;c+=1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i]+y[j]-(a[i][j] == \\\"*\\\")==c:p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\");return\\np(\\\"NO\\\")\\n\", \"t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\\\"*\\\") for i in r(n)],[g[i].count(\\\"*\\\") for i in r(m)];c=(s(x)+s(y))//2;[(p(\\\"YES\\\\n\\\",i+1,\\\" \\\",j+1,sep=\\\"\\\"),return) if x[i]+y[j]-(a[i][j]==\\\"*\\\")==c else 0 for j in r(m) for i in r(n)];p(\\\"NO\\\")\\n\", \"def main():\\n    n, m = [int(x) for x in input().split()]\\n\\n    board = []\\n    cols = [0] * m\\n    rows = [0] * n\\n    total = 0\\n    for i in range(0, n):\\n        r = input()\\n        board.append(r)\\n        for j in range(0, m):\\n            if r[j] == '*':\\n                cols[j] += 1\\n                rows[i] += 1\\n                total += 1\\n\\n    for i in range(0, n):\\n        for j in range(0, m):\\n            count = rows[i] + cols[j]\\n            if board[i][j] == '*':\\n                count -= 1\\n            if count == total:\\n                print(\\\"YES\\\")\\n                print(i + 1, j + 1)\\n                return\\n\\n    print(\\\"NO\\\")\\n\\nmain()\", \"n, m = input().split()\\nn, m = int(n), int(m)\\ns = []\\nfor i in range(n): s.append( str( input() ) )\\ncnt, cntr, cntc = 0, [], []\\nfor i in range(n):\\n  tcnt = 0\\n  for j in range(m):\\n    if s[i][j] == '*':\\n      tcnt += 1\\n  cntr.append( tcnt )\\nfor i in range(m):\\n  tcnt = 0\\n  for j in range(n):\\n    if s[j][i] == '*':\\n      tcnt += 1\\n      cnt += 1\\n  cntc.append( tcnt )\\nai , aj = -1, -1\\nfor i in range(n):\\n  for j in range(m):\\n    tmp = cntr[i] + cntc[j]\\n    if s[i][j] == '*': tmp -= 1\\n    if tmp == cnt:\\n      ai, aj = i, j\\nif ai == -1: print( \\\"NO\\\" )\\nelse:\\n  print( \\\"YES\\\" )\\n  print( str( ai + 1 ) + \\\" \\\" + str( aj + 1 ) )\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"row,col = list(map(int,input().split()))\\na = []\\nx = [0]*row; y = [0]*col\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\ntotal = 0\\nfor i in range(row):\\n    for j in range(col):\\n        if a[i][j] == \\\"*\\\":\\n            x[i]+=1; y[j]+=1; total+=1\\nfor i in range(row):\\n    for j in range(col):\\n        if (x[i]+y[j]-(a[i][j]==\\\"*\\\"))==total:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\\n\", \"row,col = map(int,input().split())\\na = []\\nfor i in range(row):\\n    s = input()\\n    a.append(s)\\n\\nx = [i.count(\\\"*\\\") for i in a]\\n#print(x)\\n\\nao = []\\nfor i in range(col):\\n    new = \\\"\\\"\\n    for j in range(row):\\n        new +=a[j][i]\\n    ao.append(new)\\ny = [i.count(\\\"*\\\") for i in ao]\\n#print(y)\\n\\ntotal = sum(x)\\n\\nfor i in range(row):\\n    for j in range(col):\\n        cnt = x[i]+y[j]\\n        if a[i][j] == \\\"*\\\":\\n            cnt-=1\\n        if total ==cnt:\\n            print(\\\"YES\\\")\\n            print(i+1,j+1)\\n            return\\nprint(\\\"NO\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    xx, yy, walls, t = [0] * n, [0] * m, set(), n + m\\n    for x in range(n):\\n        for y, c in enumerate(input()):\\n            if c == '*':\\n                walls.add((x, y))\\n                if len(walls) == t:\\n                    print(\\\"NO\\\")\\n                    return\\n                xx[x] += 1\\n                yy[y] += 1\\n    for x, a in enumerate(xx):\\n        t = len(walls) - a\\n        for y, b in enumerate(yy):\\n            if b - ((x, y) in walls) == t:\\n                print(\\\"YES\\\")\\n                print(x + 1, y + 1)\\n                return\\n    print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"t = input\\np = print\\nr = range\\nn, m = map(int, t().split())\\na, x, y, c = [], [0] * n, [0] * m, 0\\nfor i in r(n):\\n    a.append(t())\\n    for j in r(m):\\n        if a[i][j] == \\\"*\\\":\\n            x[i] += 1\\n            y[j] += 1\\n            c += 1\\nfor i in r(n):\\n    for j in r(m):\\n        if x[i] + y[j] - (a[i][j] == \\\"*\\\") == c:\\n            p(\\\"YES\\\\n\\\", i + 1, \\\" \\\", j + 1, sep=\\\"\\\")\\n            return\\np(\\\"NO\\\")\\n\", \"import sys, math, string, fractions, functools, collections\\nsys.setrecursionlimit(10**7)\\nRI=lambda x=' ': list(map(int,input().rstrip().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=1010\\n#################################################\\ncol=[0]*MAX\\nrow=[0]*MAX\\ntot=0\\nn, m = RI()\\ns=[0]*MAX\\nfor i in range(n):\\n    s[i]=RS()[0]\\n    for j in range(m):\\n        if s[i][j]=='*':\\n            row[i]+=1\\n            col[j]+=1\\n            tot+=1\\nfor i in range(n):\\n    for j in range(m):\\n        if row[i]+col[j]- (s[i][j]=='*')==tot:\\n            print(\\\"YES\\\")\\n            print(i+1, j+1)\\n            return\\nprint(\\\"NO\\\")\"]",
        "difficulty": "interview",
        "input": "6 5\n..*..\n..*..\n.*...\n..*..\n..*..\n..*..\n",
        "output": "YES\n3 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/699/B"
    },
    {
        "id": 153,
        "task_id": 119,
        "test_case_id": 1,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 10\n2 9\n3 9\n2 3\n2 9\n",
        "output": "2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 154,
        "task_id": 119,
        "test_case_id": 9,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 1\n2 3\n2 2\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 155,
        "task_id": 119,
        "test_case_id": 12,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n2 3\n1 2\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 156,
        "task_id": 119,
        "test_case_id": 16,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n1 3\n4 4\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 157,
        "task_id": 119,
        "test_case_id": 17,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n1 3\n67 1234567\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 158,
        "task_id": 119,
        "test_case_id": 18,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2\n1 1\n1 1\n",
        "output": "2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 159,
        "task_id": 119,
        "test_case_id": 20,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2\n1 1\n1 10\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 160,
        "task_id": 119,
        "test_case_id": 23,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2\n1 1\n1 2\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 161,
        "task_id": 119,
        "test_case_id": 25,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2\n1 3\n3 3\n",
        "output": "2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 162,
        "task_id": 119,
        "test_case_id": 26,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 10\n11 13\n12 12\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 163,
        "task_id": 119,
        "test_case_id": 28,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 3\n4 5\n4 4\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 164,
        "task_id": 119,
        "test_case_id": 29,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 1\n2 6\n3 5\n10 15\n20 25\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 165,
        "task_id": 119,
        "test_case_id": 30,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 1000\n1001 1007\n1002 1007\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 166,
        "task_id": 119,
        "test_case_id": 31,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 3\n2 5\n3 4\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 167,
        "task_id": 119,
        "test_case_id": 34,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 10\n11 12\n4 5\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 168,
        "task_id": 119,
        "test_case_id": 36,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 3\n100 102\n108 110\n1 3\n",
        "output": "4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 169,
        "task_id": 119,
        "test_case_id": 37,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 3\n5 9\n5 6\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 170,
        "task_id": 119,
        "test_case_id": 38,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 3\n3 4\n3 5\n",
        "output": "2 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 171,
        "task_id": 119,
        "test_case_id": 40,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n2 3\n1 4\n100 200\n1000 2000\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 172,
        "task_id": 119,
        "test_case_id": 41,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 1\n2 100\n3 99\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 173,
        "task_id": 119,
        "test_case_id": 42,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n1 3\n12 1234\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 174,
        "task_id": 119,
        "test_case_id": 46,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n2 5\n2 3\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 175,
        "task_id": 119,
        "test_case_id": 47,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 3\n1 4\n5 10\n11 13\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 176,
        "task_id": 119,
        "test_case_id": 48,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n7 15\n6 9\n9 10\n10 11\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 177,
        "task_id": 119,
        "test_case_id": 49,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n2 3\n100 200\n1000 2000\n1 4\n",
        "output": "1 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 178,
        "task_id": 119,
        "test_case_id": 50,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n10 20\n5 9\n11 19\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 179,
        "task_id": 119,
        "test_case_id": 51,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "10\n1 2\n2 3\n3 4\n4 5\n5 6\n6 6\n6 7\n7 8\n8 9\n9 10\n",
        "output": "6 7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 180,
        "task_id": 119,
        "test_case_id": 58,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "6\n10 11\n12 13\n15 16\n15 17\n18 19\n59 60\n",
        "output": "3 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 181,
        "task_id": 119,
        "test_case_id": 60,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 6\n7 60\n80 90\n4 5\n8 80\n",
        "output": "4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 182,
        "task_id": 119,
        "test_case_id": 64,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n4 4\n2 3\n4 5\n",
        "output": "1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 183,
        "task_id": 119,
        "test_case_id": 67,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 1\n2 2\n5 10\n2 4\n",
        "output": "2 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 184,
        "task_id": 119,
        "test_case_id": 68,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n11 12\n11 15\n43 45\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 185,
        "task_id": 119,
        "test_case_id": 72,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 1\n1 2\n1 3\n",
        "output": "2 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 186,
        "task_id": 119,
        "test_case_id": 74,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "11\n22226 28285\n9095 23314\n19162 25530\n255 13298\n4904 25801\n17914 23501\n8441 28117\n11880 29994\n11123 19874\n21505 27971\n7658 14109\n",
        "output": "11 5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 187,
        "task_id": 119,
        "test_case_id": 76,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 10\n12 15\n1 3\n17 18\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 188,
        "task_id": 119,
        "test_case_id": 78,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 1000\n1001 1003\n1 1\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 189,
        "task_id": 119,
        "test_case_id": 80,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2\n1 1\n1 3\n",
        "output": "1 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 190,
        "task_id": 119,
        "test_case_id": 83,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n2 8\n1 3\n2 9\n1 2\n",
        "output": "4 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 191,
        "task_id": 119,
        "test_case_id": 84,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n3 6\n1 3\n3 9\n",
        "output": "1 3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 192,
        "task_id": 119,
        "test_case_id": 85,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "6\n2 40\n5 50\n10 60\n3 45\n1 40\n100 111\n",
        "output": "1 5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 193,
        "task_id": 119,
        "test_case_id": 86,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 2\n4 4\n3 3\n2 3\n",
        "output": "3 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 194,
        "task_id": 119,
        "test_case_id": 87,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 1\n4 5\n7 9\n1 1\n",
        "output": "4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 195,
        "task_id": 119,
        "test_case_id": 88,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "6\n30 35\n18 29\n28 32\n4 9\n1002 129212\n8 281\n",
        "output": "2 6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 196,
        "task_id": 119,
        "test_case_id": 90,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "5\n2 4\n3 6\n4 5\n222 333\n111 444\n",
        "output": "3 2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 197,
        "task_id": 119,
        "test_case_id": 91,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n4 5\n1 1\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 198,
        "task_id": 119,
        "test_case_id": 93,
        "question": "You are given a sequence a_1, a_2, ..., a_{n} of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment a_{i} lies within segment a_{j}.\n\nSegment [l_1, r_1] lies within segment [l_2, r_2] iff l_1 ≥ l_2 and r_1 ≤ r_2.\n\nPrint indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Input-----\n\nThe first line contains one integer n (1 ≤ n ≤ 3·10^5) — the number of segments.\n\nEach of the next n lines contains two integers l_{i} and r_{i} (1 ≤ l_{i} ≤ r_{i} ≤ 10^9) — the i-th segment.\n\n\n-----Output-----\n\nPrint two distinct indices i and j such that segment a_{i} lies within segment a_{j}. If there are multiple answers, print any of them. If no answer exists, print -1 -1.\n\n\n-----Examples-----\nInput\n5\n1 10\n2 9\n3 9\n2 3\n2 9\n\nOutput\n2 1\n\nInput\n3\n1 5\n2 6\n6 20\n\nOutput\n-1 -1\n\n\n\n-----Note-----\n\nIn the first example the following pairs are considered correct:  (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders;  (3, 2), (4, 2), (3, 5), (4, 5) — touch one border;  (5, 2), (2, 5) — match exactly.",
        "solutions": "[\"n = int(input())\\na = []\\nfor i in range(1, n + 1):\\n    l, r = list(map(int, input().split()))\\n    a.append([l, -r, i])\\na.sort()\\nhh = a[0][1]\\nwahh = max(-1, a[0][2])\\nfor i in range(1, n):\\n    if a[i][1] >= hh:\\n        print(a[i][2], wahh)\\n        return\\n    else:\\n        hh = a[i][1]\\n        wahh = a[i][2]\\nprint(-1, -1)\\n\", \"n = int(input())\\nL = []\\nfor i in range(n):\\n    L.append(list(map(int, input().split()))+[i+1])\\n#print(L)\\nL.sort(key=lambda X:(X[0],-X[1],X[2]))\\n#print(L)\\nX = 0\\nfor i in range(1,n):\\n    if L[i][1]<=L[i-1][1]:\\n        print(L[i][2],L[i-1][2])\\n        X = 1\\n        break\\nif X == 0:\\n    print(-1,-1)\", \"#!/usr/bin/env python3\\n\\nn = int(input().strip())\\nais = [tuple(map(int, input().strip().split())) for _ in range(n)]\\n\\ndef solve(ais):\\n\\tbis = [(l, r, i + 1) for i, (l, r) in enumerate(ais)]\\n\\tbis.sort(key=lambda t: (t[0], -t[1]))\\n\\trr = bis[0][1] - 1\\n\\tir = bis[0][2]\\n\\tfor l, r, i in bis:\\n\\t\\tif r <= rr:\\n\\t\\t\\treturn (i, ir)\\n\\t\\telse:\\n\\t\\t\\trr = r\\n\\t\\t\\tir = i\\n\\treturn (-1, -1)\\n\\t\\t\\n\\ni, j = solve(ais)\\nprint(i, j)\\n\", \"n = int(input())\\n\\nsegments = []\\n\\nfor i, _ in enumerate(range(n)):\\n    a, b = map(int, input().split())\\n    segments.append(((a, b), i + 1))\\n\\nsegments.sort(key=lambda x: (x[0][0], -x[0][1]))\\n\\nlast_r = 0\\nlast_index = 0\\n\\nfor segment, index in segments:\\n    if last_r >= segment[1]:\\n        print(index, last_index)\\n        break\\n\\n    last_r = segment[1]\\n    last_index = index\\nelse:\\n    print(-1, -1)\", \"def res(d,N):\\n    for i in range(1,N):\\n        if d[i][1] <= d[i-1][1]:\\n            return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\\n    return '-1 -1'    \\n\\nN = int(input())\\nd = []\\nfor i in range(N):\\n    a,b = list(map(int,input().split()))\\n    d.append((a,b,i))\\nd = sorted(d, key = lambda x:(x[0],-x[1]))\\nprint(res(d,N))\\n\", \"import sys\\n\\ndef inn(a,b):\\n\\treturn (a[0] <= b[0] and b[1] <= a[1])\\n\\nn = int(input())\\n\\nseg = []\\n\\na,b = map(int,input().split())\\nseg.append((a,b,1))\\n\\nfor i in range(2,n+1):\\n\\ta,b = map(int,input().split())\\n\\tseg.append((a,b,i))\\n\\t\\nseg.sort(key=lambda x : (x[0],-x[1]))\\n\\nmain = seg.pop(0)\\n\\t\\nfor i in seg:\\n\\tif inn(main,i):\\n\\t\\tprint(i[2],main[2])\\n\\t\\treturn\\n\\tif main[1] < i[1]:\\n\\t\\tmain = i\\n\\nprint(-1,-1)\", \"def solution():\\n    \\n    n = int(input())\\n    segments = []\\n    for i,_ in enumerate(range(n)):\\n        x,y = input().split(\\\" \\\")\\n        segments.append((int(x), int(y), i+1))\\n\\n    segments = sorted(segments, key=lambda x: (x[0], -x[1]))\\n\\n    for i,seg in enumerate(segments):\\n        j = i+1\\n        if j >= n:\\n            print(\\\"-1 -1\\\")\\n            return\\n\\n        while segments[j][1] <= seg[1]:\\n            print(\\\"{} {}\\\".format(segments[j][2], seg[2]))\\n            return\\n\\n    print(\\\"-1 -1\\\")\\n    return\\n\\nsolution()\\n\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n    a.append(list(map(int,input().split()))+[i])\\na.sort(key=lambda f:(f[0],-f[1]))\\nfor i in range(n-1):\\n    if a[i][1]>=a[i+1][1]:\\n        print(a[i+1][2]+1,a[i][2]+1)\\n        break\\nelse:\\n    print(-1,-1)\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\", \"\\nn = int(input())\\npairs = [list(map(int, input().split()))+[i] for i in range(n)]\\npairs.sort(key=lambda x:(x[0], -x[1]))\\nfor i in range(1, n):\\n    if pairs[i][1] <= pairs[i-1][1]:\\n        print(pairs[i][2]+1, pairs[i-1][2]+1)\\n        break\\nelse:\\n    print(-1, -1)\", \"import sys\\nn = int(sys.stdin.readline())\\n\\nintervals = list([(int(x[0]), int(x[1])) for x in list(map(str.split, sys.stdin.readlines()))])\\nintervals = list(enumerate(intervals))\\n\\nintervals.sort(key=lambda x : 1000000009 * x[1][0] - x[1][1])\\n\\nr = 0\\nans1 = -1\\nans2 = -1\\nfor interval in intervals:\\n    if interval[1][1] <= r:\\n        ans1 = interval[0]\\n        break\\n    else:\\n        ans2 = interval[0]\\n        r = interval[1][1]\\n\\nif ans1 == -1:\\n    print('-1 -1')\\nelse:\\n    print(ans1 +1, ans2 +1)\\n\", \"def main():\\n    n = int(input())\\n    seg = []\\n    for i in range(n):\\n        l, r = map(int, input().split())\\n        seg.append((l, r, i+1))\\n\\n    seg = sorted(seg, key=lambda x: (x[0], -x[1]))\\n\\n    lar = 0\\n    sma = -1\\n    for i in range(1, len(seg)):\\n        if seg[i][1] <= seg[lar][1]:\\n            sma = i\\n            break\\n        else:\\n            lar = i\\n    if sma != -1:\\n        print(seg[sma][2], seg[lar][2])\\n    else:\\n        print(-1, -1)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(map(int, stdin.readline().split()))\\n\\nn = int(input())\\n\\na = [list(rint()) + [i+1] for i in range(n)]\\n\\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\\n\\nstart = [-1, -1, -1]\\n\\nfor aa in a:\\n    if start[1] >= aa[1]:\\n        ans = [aa[2], start[2]]\\n        print(*ans)\\n        return\\n    else:\\n        start = aa\\n\\nprint(-1, -1)\\n\\n\\n\", \"n=int(input())\\na=sorted((l,-r,i)for i,(l,r)in\\nenumerate((map(int,input().split())for _ in[0]*n),1))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"n=int(input())\\na=sorted((l,-r,i)for l,r,i in(map(int,input().split()+[i+1])for i in range(n)))\\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))\", \"from operator import itemgetter\\ndef cmpnr(a, b):\\n    if a[0] < b[0]:\\n        return True\\n    if a[0] > b[0]:\\n        return False\\n    return a[1] > b[1]\\n\\nn = int(input())\\nseg = []\\nfor i in range(n):\\n    a, b = list(map(int, input().split()))\\n    seg.append((a, b, i + 1))\\n\\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\\n\\nmaxr = 0\\nmaxri = 0\\nfor a, b, i in seg:\\n    if b <= maxr:\\n        print(i, maxri)\\n        return\\n\\n    if b > maxri:\\n        maxr = b\\n        maxri = i\\n\\nprint(-1, -1)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 10\n9 20\n3 5\n",
        "output": "3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/976/C"
    },
    {
        "id": 199,
        "task_id": 319,
        "test_case_id": 4,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "10 1\n1\n0\n0\n0\n0\n0\n0\n0\n0\n1\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 200,
        "task_id": 319,
        "test_case_id": 13,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "4 5\n00000\n11000\n00110\n00011\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 201,
        "task_id": 319,
        "test_case_id": 14,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "4 3\n000\n010\n001\n100\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 202,
        "task_id": 319,
        "test_case_id": 18,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "3 3\n010\n101\n000\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 203,
        "task_id": 319,
        "test_case_id": 19,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 2\n11\n00\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 204,
        "task_id": 319,
        "test_case_id": 23,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 5\n11111\n00000\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 205,
        "task_id": 319,
        "test_case_id": 26,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 2\n00\n11\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 206,
        "task_id": 319,
        "test_case_id": 30,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "4 4\n1111\n0000\n0000\n0000\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 207,
        "task_id": 319,
        "test_case_id": 32,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 1\n0\n1\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 208,
        "task_id": 319,
        "test_case_id": 41,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "3 3\n111\n000\n000\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 209,
        "task_id": 319,
        "test_case_id": 43,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 3\n111\n000\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 210,
        "task_id": 319,
        "test_case_id": 49,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "3 3\n000\n000\n111\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 211,
        "task_id": 319,
        "test_case_id": 57,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 6\n111111\n000000\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 212,
        "task_id": 319,
        "test_case_id": 58,
        "question": "You are given n switches and m lamps. The i-th switch turns on some subset of the lamps. This information is given as the matrix a consisting of n rows and m columns where a_{i}, j = 1 if the i-th switch turns on the j-th lamp and a_{i}, j = 0 if the i-th switch is not connected to the j-th lamp.\n\nInitially all m lamps are turned off.\n\nSwitches change state only from \"off\" to \"on\". It means that if you press two or more switches connected to the same lamp then the lamp will be turned on after any of this switches is pressed and will remain its state even if any switch connected to this lamp is pressed afterwards.\n\nIt is guaranteed that if you push all n switches then all m lamps will be turned on.\n\nYour think that you have too many switches and you would like to ignore one of them. \n\nYour task is to say if there exists such a switch that if you will ignore (not use) it but press all the other n - 1 switches then all the m lamps will be turned on.\n\n\n-----Input-----\n\nThe first line of the input contains two integers n and m (1 ≤ n, m ≤ 2000) — the number of the switches and the number of the lamps.\n\nThe following n lines contain m characters each. The character a_{i}, j is equal to '1' if the i-th switch turns on the j-th lamp and '0' otherwise.\n\nIt is guaranteed that if you press all n switches all m lamps will be turned on.\n\n\n-----Output-----\n\nPrint \"YES\" if there is a switch that if you will ignore it and press all the other n - 1 switches then all m lamps will be turned on. Print \"NO\" if there is no such switch.\n\n\n-----Examples-----\nInput\n4 5\n10101\n01000\n00111\n10000\n\nOutput\nYES\n\nInput\n4 5\n10100\n01000\n00110\n00101\n\nOutput\nNO",
        "solutions": "[\"n, m = list(map(int, input().split()))\\na = [list(map(int, input())) for i in range(n)]\\n\\nignorable = [True] * n\\n\\nfor i in range(m):\\n    cnt = 0\\n    for j in range(n):\\n        cnt += a[j][i]\\n    if cnt == 1:\\n        for j in range(n):\\n            if a[j][i]:\\n                ignorable[j] = False\\n\\nif any(ignorable):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"def main():\\n    n, m = map(int, input().split())\\n    a = []\\n    for i in range(n):\\n        a.append(input())\\n    ans = \\\"NO\\\"\\n    count = [0] * m\\n    for i in range(n):\\n        for j in range(m):\\n            if (a[i][j] == '1'):\\n                count[j] += 1\\n    for i in range(n):\\n        ans = \\\"YES\\\"\\n        for j in range(m):\\n            if (count[j] == 1 and a[i][j] == '1'):\\n                ans = \\\"NO\\\"\\n                break\\n        if (ans == \\\"YES\\\"):\\n            break\\n    print(ans)\\nmain()\", \"n, m = [int(v) for v in input().split()]\\n\\na = []\\nfor _ in range(n):\\n    a.append([int(v) for v in input()])\\n\\ncolsums = [sum(a[i][j] for i in range(n)) for j in range(m)]\\n\\nfor row in a:\\n    if all(rv < sv for (rv, sv) in zip(row, colsums)):\\n        print(\\\"YES\\\")\\n        return\\n\\nprint(\\\"NO\\\")\\n\", \"'''n = int(input())\\na = list(map(int,input().split()))\\nt = 0\\nt2 = 0\\nfor i in range(n//2):\\n    t+=abs(2*i+1-a[i])\\n    t2+=abs(2*i+2-a[i])\\nprint(min(t,t2))\\n'''\\nn,m = list(map(int,input().split()))\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nf = [True]*n\\nfor j in range(m):\\n    l = -1\\n    c = 0\\n    for i in range(n):\\n        if a[i][j] == '1':\\n            l = i\\n            c+=1\\n    if c==1:\\n        f[l] = False\\nif True in f:print('YES')\\nelse :print('NO')\\n\", \"import re\\nimport math\\nimport decimal\\nimport bisect\\n\\ndef read():\\n\\treturn input().strip()\\n\\nn, m = [int(x) for x in read().split()]\\nswitches = []\\nfor i in range(n):\\n\\tswitches.append(int(read(), 2))\\n\\nallon = int(\\\"1\\\"*m, 2)\\nfor i in range(n):\\n\\tans = 0\\n\\tfor j in range(n):\\n\\t\\tif j != i:\\n\\t\\t\\tans |= switches[j]\\n\\t\\tif ans == allon:\\n\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\treturn\\nprint(\\\"NO\\\")\\n\", \"def getIntList():\\n    return list(map(int, input().split()));\\ndef getTransIntList(n):\\n    first=getIntList();\\n    m=len(first);\\n    result=[[0]*n for _ in range(m)];\\n    for i in range(m):\\n        result[i][0]=first[i];\\n    for j in range(1, n):\\n        curr=getIntList();\\n        for i in range(m):\\n            result[i][j]=curr[i];\\n    return result;\\nn, m=getIntList();\\na=[];\\nfor _ in range(n):\\n    s=input();\\n    a.append([int(s[i]) for i in range(m)]);\\nsumA=[0]*m;\\nfor i in range(n):\\n    for j in range(m):\\n        sumA[j]+=a[i][j];\\ndef check():\\n    for i in range(n):\\n        for j in range(m):\\n            if a[i][j]==1 and sumA[j]==1:\\n                break;\\n        else:\\n            return \\\"YES\\\";\\n    return \\\"NO\\\";\\nprint(check());\", \"#!/usr/bin/env python3\\n\\n[n, m] = list(map(int, input().strip().split()))\\nbis = [input().strip() for _ in range(n)]\\n\\ntrbis = [''.join(bis[i][j] for i in range(n)) for j in range(m)]\\n\\nnec = [0 for i in range(n)]\\nfor col in trbis:\\n\\tif col.count('1') == 1:\\n\\t\\tnec[col.index('1')] = 1\\n\\nif sum(nec) < n:\\n\\tprint ('YES')\\nelse:\\n\\tprint ('NO')\\n\", \"arr = []\\nfreq = {}\\n\\ndef exclude(i, n, m):\\n    s = arr[i]\\n    for j in range(m):\\n        if s[j] == '1':\\n            if freq[j] <= 1:\\n                return False\\n    return True\\n\\nn, m = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == '1':\\n            if j in freq:\\n                freq[j] += 1\\n            else:\\n                freq[j] = 1\\n    arr.append(s)\\nans = False\\nfor i in range(n):\\n    if exclude(i, n, m):\\n        ans = True\\nprint('YES' if ans else 'NO')\", \"(n, m) = list(map(int, input().split()))\\n\\nlst = []\\nfor x in range(n):\\n    lst.append(input())\\n\\narray = [0] * m\\nfor x in range(n):\\n    for y in range(m):\\n        if lst[x][y] == '1':\\n            array[y] += 1\\n\\nF = False\\nfor x in range(n):\\n    flag = True\\n    for y in range(m):\\n        if lst[x][y] == '1' and array[y] == 1:\\n            flag = False\\n    if flag:\\n        F = True\\n        break\\n\\nif F:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"m,n=list(map(int,input().split()))\\na=[]\\nfor i in range(m):\\n    a.append(list(map(int,list(input()))))\\nb=[0]*n\\nfor j in range(n):\\n    b[j]=0\\n    for i in range(m):\\n        b[j]+=a[i][j]\\nfor i in range(m):\\n    for j in range(n):\\n        if(b[j]==a[i][j]):\\n            break\\n    else:\\n        print(\\\"YES\\\")\\n        break\\nelse:\\n    print(\\\"NO\\\")\", \"n, m = [int(x) for x in input().split()]\\narr = []\\nfor i in range(n):\\n    x = input()\\n    arr.append([int(x[j]) for j in range(len(x))])\\n\\narr_T = list(zip(*arr))\\n\\nT = [sum(x) for x in arr_T]\\n\\nfor i in range(n):\\n    if all(T[j] - arr[i][j] > 0 for j in range(m)):\\n        print('YES')\\n        break\\nelse:\\n    print('NO')\\n\\n\\n\\n\\n\", \"s = [int(x) for x in input().split()]\\nc = []\\na = [False for x in range(s[0])]\\nfor _ in range(s[0]):\\n\\tc.append(input())\\nfor i in range(s[1]):\\n\\tlast = -1\\n\\tq = 0\\n\\tfor j in range(s[0]):\\n\\t\\tif c[j][i] == '1':\\n\\t\\t\\tlast = j\\n\\t\\t\\tq += 1\\n\\tif q == 1:\\n\\t\\ta[last] = True\\nif all(x for x in a):\\n\\tprint('NO')\\nelse:\\n\\tprint('YES')\", \"n, m = list(map(int, input().split()))\\na = [int(input(), 2) for _ in range(n)]\\n\\nl = a[::]\\nr = a[::]\\nf = 2**m - 1\\n\\nfor i in range(1, n):\\n    l[i] |= l[i-1]\\n    r[-i-1] |= r[-i]\\n\\nres = False\\nfor i in range(n):\\n    x = l[i-1] if i != 0 else 0\\n    y = r[i+1] if i != n-1 else 0\\n\\n    if (x | y) == f:\\n        res = True\\n        break\\n\\nprint(\\\"YES\\\" if res else \\\"NO\\\")\\n\", \"m, n = map(int,input().split()) \\nD1 = {}\\nD2 = {}\\n\\nfor i in range(m):\\n    D1[i] = []\\nfor i in range(n):\\n    D2[i] = []\\n\\nfor i in range(m):\\n    L = input()\\n    for j in range(n):\\n        if L[j] == '1':\\n            D1[i].append(j)\\n            D2[j].append(i)\\n\\nX = 0\\nfor i in range(m):\\n    E = 0\\n    for j in D1[i]:\\n        if len(D2[j]) == 1:\\n            E = 1\\n            break\\n    if E == 0:\\n        X = 1\\n        break\\nif X == 1:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a = []\\nwas_already = was_twice = 0\\nn = int(input().split()[0])\\nfor _ in range(n):\\n\\tai = int(input(), base=2)\\n\\ta.append(ai)\\n\\twas_twice |= was_already & ai\\n\\twas_already |= ai\\nfor ai in a:\\n\\tif ai & (ai ^ was_twice):\\n\\t\\tcontinue\\n\\tprint(\\\"YES\\\")\\n\\tbreak\\nelse:\\n\\tprint(\\\"NO\\\")\\n\", \"T = input().split(' ')\\nn = int(T[0])\\nm = int(T[1])\\nS = [0] * n\\nQ = []\\nfor i in range(n):\\n    Q.append(input())\\nfor i in range(m):\\n    a = -1\\n    b = -1\\n    for j in range(n):\\n        if Q[j][i] == '1':\\n            if a==-1:\\n                a=j\\n            else:\\n                b=j\\n                break\\n    if a!=-1 and b==-1:\\n        S[a] = 1\\nb = False\\nfor j in range(n):\\n    if S[j] == 0:\\n        b = True\\n        break\\nif b:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"n, m = list(map(int, input().split()))\\nd = [0] * m\\ns = list(list(map(int, input())) for i in range(n))\\nfor x in s:\\n    for i in range(m):\\n        d[i] += x[i]\\nfor x in s:\\n    f = 1\\n    for i in range(m):\\n        if x[i]:\\n            if d[i] == 1:\\n                f = 0\\n                break\\n    if f:\\n        print('YES')\\n        return\\nprint('NO')\\n\", \"R = lambda: map(int, input().split())\\n\\ndef func():\\n    n, m = R()\\n    cnt = [0]*m\\n    ss = []\\n\\n    for i in range(n):\\n        s = input()\\n        ss.append(s)\\n        for j, ch in enumerate(s):\\n            if ch == '1': cnt[j] += 1\\n\\n    for i in range(n):\\n        s = ss[i]\\n        for j, ch in enumerate(s):\\n            if ch == '1' and cnt[j] <= 1: break\\n        else:\\n            return 1\\n\\n    return 0\\n\\n\\nprint('YES' if func() else 'NO')\", \"def read():\\n    return list(map(int,input().split()))\\nn,m=read()\\na=[]\\nfor i in range(n):\\n    a.append(input())\\nans=[0]*n\\nfor i in range(m):\\n    ind=-1\\n    for j in range(n):\\n        if a[j][i]=='1':\\n            if ind!=-1:\\n                ind=-1\\n                break\\n            ind=j\\n    if ind!=-1:\\n        ans[ind]=1\\nif 0 in ans:\\n    print('YES')\\nelse:\\n    print('NO')\\n        \\n        \\n\\n    \\n    \\n\", \"n,m=map(int,input().split())\\nr=[input() for _ in [0]*n]\\nd={j:0 for j in range(m)}\\nfor i in r:\\n    for j in range(m):\\n        d[j]+=int(i[j])\\nl=list(d.values())\\nfor i in r:\\n    f=True\\n    for j in range(m):\\n        if i[j]=='1' and l[j]==1:f=False;break\\n    if f:print(\\\"YES\\\");return\\nprint(\\\"NO\\\")\", \"n,m=list(map(int,input().split()))\\nl=[int(input(),2) for i in range(n)]\\nc=int('1'*m,2)\\nb=True\\nfor i in range(len(l)):\\n    s=0\\n    for j in range(len(l)):\\n        if i!=j:\\n            s=s|l[j]\\n    if s==c:\\n        b=False\\n        print('YES')\\n        break\\nif b:\\n    print('NO')\\n\", \"n,m = list(map(int,input().split()))\\n\\nans = 0\\nmat = []\\nfor i in range(n):\\n    mat.append(input())\\nl = [0]*m\\n\\nfor j in range(m):\\n    for i in range(n):\\n        l[j]+= (mat[i][j]=='1')\\n\\nfor i in range(n):\\n    flag = 0 \\n    for j in range(m):\\n        if mat[i][j]=='1' and l[j]==1:\\n            flag = 1 \\n    if flag == 0 : \\n        print(\\\"YES\\\")\\n        return\\nprint(\\\"NO\\\")\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nN,M = list(map(int, input().split()))\\nlights = [[int(x) for x in input().strip()] for i in range(N)]\\n\\nA = [sum([lights[i][j] for i in range(N)]) for j in range(M)]\\nfull = [i for i,x in enumerate(A) if x > 1]\\n\\ndef main():\\n\\tfor row in lights:\\n\\t\\tif sum(row) == sum([row[i] for i in full]):\\n\\t\\t\\treturn \\\"YES\\\"\\n\\treturn \\\"NO\\\"\\nprint(main())\\n\", \"t = input().split(\\\" \\\")\\nt = [int(e) for e in t]\\n\\nl = []\\nfor i in range(t[0]):\\n    tt = input().strip()\\n    assert len(tt) == t[1]\\n    l.append(tt)\\n\\nassert t[0] == len(l)\\nassert t[1] == len(l[0])\\n\\nlsum = []\\nfor i in range(t[1]):\\n    lsum.append(sum(int(l[j][i]) for j in range(t[0])))\\n\\nfor i in range(t[0]):\\n    can_be_ignore = True\\n\\n    for j in range(t[1]):\\n        if lsum[j] == 1 and l[i][j] == '1':\\n            can_be_ignore = False\\n            break\\n\\n    if can_be_ignore:\\n        print(\\\"YES\\\")\\n        return\\n\\n\\nprint(\\\"NO\\\")\\n\\n\", \"n, m = list(map(int, input().split()))\\na = [list(map(int, list(input()))) for _ in range(n)]\\n\\nans = \\\"NO\\\"\\ncnt = [0 for _ in range(m)]\\nfor i in range(n):\\n    for j in range(m):\\n        cnt[j] += a[i][j]\\nfor i in range(n):\\n    ok = True\\n    for j in range(m):\\n        if a[i][j] == 1 and cnt[j] == 1:\\n            ok = False\\n            break\\n    if ok:\\n        ans = \\\"YES\\\"\\n        break\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "3 5\n00000\n10101\n01010\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/985/B"
    },
    {
        "id": 213,
        "task_id": 401,
        "test_case_id": 2,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 214,
        "task_id": 401,
        "test_case_id": 4,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 1\n5 4 2 3 6 1 7 9 8\n9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 215,
        "task_id": 401,
        "test_case_id": 7,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 9\n4 2 1 6 7\n2 3 4 5 6 7 8 9 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 216,
        "task_id": 401,
        "test_case_id": 8,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 9\n5 4 3 2 1 6 7 8 9\n3 2 1 5 4 7 8 9 6\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 217,
        "task_id": 401,
        "test_case_id": 9,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 5\n2 3 4 5 6 7 8 9 1\n4 2 1 6 7\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 218,
        "task_id": 401,
        "test_case_id": 10,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 9\n1 2 3 4 5 6 7 8 9\n1 2 3 4 5 6 7 8 9\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 219,
        "task_id": 401,
        "test_case_id": 11,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 9\n1 2 3 4 5 6 7 8 9\n9 8 7 6 5 4 3 2 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 220,
        "task_id": 401,
        "test_case_id": 12,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 9\n9 8 7 6 5 4 3 2 1\n1 2 3 4 5 6 7 8 9\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 221,
        "task_id": 401,
        "test_case_id": 13,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "9 9\n9 8 7 6 5 4 3 2 1\n9 8 7 6 5 4 3 2 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 222,
        "task_id": 401,
        "test_case_id": 18,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n9\n9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 223,
        "task_id": 401,
        "test_case_id": 19,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 1\n1\n1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 224,
        "task_id": 401,
        "test_case_id": 20,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "4 5\n3 2 4 5\n1 6 5 9 8\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 225,
        "task_id": 401,
        "test_case_id": 21,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 2\n4 5 6\n1 5\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 226,
        "task_id": 401,
        "test_case_id": 22,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 4\n1 3 5 6 7\n2 4 3 9\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 227,
        "task_id": 401,
        "test_case_id": 23,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 5\n1 3 5 7 9\n2 4 6 8 9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 228,
        "task_id": 401,
        "test_case_id": 24,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 2\n1 8\n2 8\n",
        "output": "8\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 229,
        "task_id": 401,
        "test_case_id": 25,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 5\n5 6 7 8 9\n1 2 3 4 5\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 230,
        "task_id": 401,
        "test_case_id": 26,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 5\n1 2 3 4 5\n1 2 3 4 5\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 231,
        "task_id": 401,
        "test_case_id": 27,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 5\n1 2 3 4 5\n2 3 4 5 6\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 232,
        "task_id": 401,
        "test_case_id": 28,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 2\n1 5\n2 5\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 233,
        "task_id": 401,
        "test_case_id": 29,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "4 4\n1 3 5 8\n2 4 6 8\n",
        "output": "8\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 234,
        "task_id": 401,
        "test_case_id": 30,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n1 5 3\n2 5 7\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 235,
        "task_id": 401,
        "test_case_id": 31,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n3 6 8\n2 6 9\n",
        "output": "6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 236,
        "task_id": 401,
        "test_case_id": 32,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 2\n1 4\n2 4\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 237,
        "task_id": 401,
        "test_case_id": 33,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 3\n3 4 5 6 7\n1 5 9\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 238,
        "task_id": 401,
        "test_case_id": 34,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "4 4\n1 2 3 4\n2 5 6 7\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 239,
        "task_id": 401,
        "test_case_id": 35,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "5 5\n1 2 3 4 5\n9 2 1 7 5\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 240,
        "task_id": 401,
        "test_case_id": 36,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 2\n1 3\n2 3\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 241,
        "task_id": 401,
        "test_case_id": 37,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n3 2 1\n3 2 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 242,
        "task_id": 401,
        "test_case_id": 38,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n1 3 5\n2 3 6\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 243,
        "task_id": 401,
        "test_case_id": 39,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n5 6 7\n5 6 7\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 244,
        "task_id": 401,
        "test_case_id": 40,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 2\n5\n2 5\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 245,
        "task_id": 401,
        "test_case_id": 41,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n2 4 9\n7 8 9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 246,
        "task_id": 401,
        "test_case_id": 42,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n1 2 4\n3 4 5\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 247,
        "task_id": 401,
        "test_case_id": 43,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 2\n1 4 9\n2 4\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 248,
        "task_id": 401,
        "test_case_id": 44,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 3\n3 5 6\n1 5 9\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 249,
        "task_id": 401,
        "test_case_id": 45,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 2\n1 2 4\n3 4\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 250,
        "task_id": 401,
        "test_case_id": 46,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 4\n8 9\n1 2 3 9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 251,
        "task_id": 401,
        "test_case_id": 47,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "1 2\n9\n8 9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 252,
        "task_id": 401,
        "test_case_id": 48,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 2\n1 2 4\n4 2\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 253,
        "task_id": 401,
        "test_case_id": 49,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 3\n4 5\n1 3 5\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 254,
        "task_id": 401,
        "test_case_id": 50,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "3 2\n1 2 3\n2 3\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 255,
        "task_id": 401,
        "test_case_id": 51,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "4 3\n1 3 5 9\n2 8 9\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 256,
        "task_id": 401,
        "test_case_id": 52,
        "question": "You are given two lists of non-zero digits.\n\nLet's call an integer pretty if its (base 10) representation has at least one digit from the first list and at least one digit from the second list. What is the smallest positive pretty integer?\n\n\n-----Input-----\n\nThe first line contains two integers n and m (1 ≤ n, m ≤ 9) — the lengths of the first and the second lists, respectively.\n\nThe second line contains n distinct digits a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 9) — the elements of the first list.\n\nThe third line contains m distinct digits b_1, b_2, ..., b_{m} (1 ≤ b_{i} ≤ 9) — the elements of the second list.\n\n\n-----Output-----\n\nPrint the smallest pretty integer.\n\n\n-----Examples-----\nInput\n2 3\n4 2\n5 7 6\n\nOutput\n25\n\nInput\n8 8\n1 2 3 4 5 6 7 8\n8 7 6 5 4 3 2 1\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example 25, 46, 24567 are pretty, as well as many other integers. The smallest among them is 25. 42 and 24 are not pretty because they don't have digits from the second list.\n\nIn the second example all integers that have at least one digit different from 9 are pretty. It's obvious that the smallest among them is 1, because it's the smallest positive integer.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        break\\nelse:\\n    print(min(a[0], b[0]), max(a[0], b[0]), sep = '')\\n\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na.sort()\\nb.sort()\\nans = 100\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] == b[j]:\\n            ans = min(ans, a[i])\\nans = min(ans, min(a[0] * 10 + b[0], b[0] * 10 + a[0]))\\nprint(ans)\\n\", \"n,m=map(int,input().split())\\na=input().split()\\nb=input().split()\\nfor i in range(n):\\n    a[i]=int(a[i])\\nfor i in range(m):\\n    b[i]=int(b[i])\\na.sort()\\nb.sort()\\nc=[]\\nfor i in range(n):\\n    if a[i] in b:\\n        c.append(a[i])\\n    else:\\n        c.append(min(a[i]*10+b[0],b[0]*10+a[i]))\\nfor i in range(m):\\n    if b[i] in a:\\n        c.append(b[i])\\n    else:\\n        c.append(min(b[i]*10+a[0],a[0]*10+b[i]))\\nprint(min(c))\", \"import sys\\n\\n#sys.stdin = open(\\\"input.txt\\\")\\n#sys.stdout = open(\\\"output.txt\\\", \\\"w\\\")\\n\\nn, n1 = map(int, input().split())\\na1 = set(map(int, input().split()))\\na2 = set(map(int, input().split()))\\na = set(a1).intersection(a2)\\nif a:\\n    print(sorted(list(a))[0])\\nelse:\\n    a = sorted(list(a1))[0]\\n    b = sorted(list(a2))[0]\\n    a, b = min(a, b), max(a, b)\\n    print(a, b, sep='')\", \"l, lt = input().split()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    if i in b:\\n        print(i)\\n        return\\nif min(a) < min(b):\\n    print(str(min(a)) + str(min(b)))\\nelse:\\n    print(str(min(b)) + str(min(a)))\\n    \\n\\n\\n\", \"n,k=map(int,input().split(' '))\\nm=list(map(int,input().split(' ')))\\nm.sort()\\nh=list(map(int,input().split(' ')))\\nh.sort()\\np=0\\nfor i in m:\\n    if i in h:\\n        print(i)\\n        p=1\\n        break\\nif p==0:\\n    print(min(m[0]*10+h[0],h[0]*10+m[0]))\", \"a,b = list(map(int, input().split()))\\n\\nmas1 = list(map(int, input().split()))\\nmas2 = list(map(int, input().split()))\\n\\nmin1 = min(mas1)\\nmin2 = min(mas2)\\n\\nheh = 10\\n\\nfor i in mas1:\\n    for j in mas2:\\n        if i == j and i < heh:\\n            heh = i\\nif heh != 10:\\n    print(heh)\\n    return\\nif min1 < min2:\\n    print(str(min1)+str(min2))\\nelse:\\n    print(str(min2)+str(min1))\\n\", \"n, m = map(int, input().split())\\ndata1 = list(map(int, input().split()))\\ndata2 = list(map(int, input().split()))\\ndata1.sort()\\nfor i in data1:\\n    if i in data2:\\n        print(i)\\n        break\\nelse:\\n    print(min(min(data1), min(data2)) * 10 + max(min(data1), min(data2)))\", \"n , m = list(map(int, input().split()))\\nA = input().split()\\nB = input().split()\\n\\nA.sort()\\nB.sort()\\n\\nfor i in A:\\n    if i in B:\\n        print(i)\\n        return\\n\\n\\n\\nif(A[0] < B[0]):\\n    print(A[0]+B[0])\\nelse:\\n    print(B[0] + A[0])\\n\", \"n, m = map(int, input().split())\\nfirst = list(map(int, input().split()))\\nsecond = list(map(int, input().split()))\\nfirst.sort()\\nsecond.sort()\\nif len((set(map(int, first)) & set(map(int, second)))):\\n    print(min((set(map(int, first)) & set(map(int, second)))))\\nelse:\\n    f = min(first[0], second[0])\\n    s = max(first[0], second[0])\\n    print(f * 10 + s)\", \"input()\\na, b = list(map(int, input().split())), list(map(int, input().split()))\\nam, bm = min(a), min(b)\\nm = 10\\nfor x in a:\\n  if x in b:\\n    if x < m:\\n      m = x\\nif m == 10:\\n  print(min(am, bm), max(am, bm), sep = '')\\nelse:\\n  print(m)\", \"N, M = map(int, input().split())\\n\\na = sorted(list(map(int, input().split())))\\nb = sorted(list(map(int, input().split())))\\nc = sorted(list(set(a) & set(b)))\\n\\nif c != []: print(c[0])\\nelse: print(10 * min(a[0], b[0]) + max(a[0], b[0]))\", \"m, n = map(int, input().split())\\na = set(map(int, input().split()))\\nb = set(map(int, input().split()))\\nc = a & b\\nif len(c) != 0:\\n    print(min(c))\\nelse:\\n    x = min(a)\\n    y = min(b)\\n    if x < y:\\n        print(x, y, sep='')\\n    else:\\n        print(y, x, sep='')\", \"n, m = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nf = True\\nfor i in range(1, 10):\\n    if i in a and i in b:\\n        print(i)\\n        f = False\\n        break\\nif f:\\n    print(str(min(min(a), min(b))) + str(max(min(a), min(b))))\", \"import sys\\nn, m = [int(x) for x in input().split()]\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\na.sort()\\nb.sort()\\nfor i in range(n):\\n    if a[i] in b:\\n        print(a[i])\\n        return\\nprint(min(a[0], b[0])*10 + max(a[0], b[0]))\", \"n, k = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nam = min(a)\\nbm = min(b)\\nmi = 100\\nfor i in range(n):\\n    if a[i] in b and a[i] < mi:\\n        mi = a[i]\\nif mi < 10:\\n    print(mi)\\n\\nelif am == bm:\\n    print(am)\\nelse:\\n    print(10 * min(am, bm) + max(am, bm))\", \"n,m=map(int,input().split())\\nmn1=10\\nb=[False]*9\\nfor i in input().split():\\n    mn1=min(mn1,int(i))\\n    b[int(i)-1]=True\\nmn2=10\\nmnans=10\\nfor i in input().split():\\n    mn2=min(mn2,int(i))\\n    if (b[int(i)-1]):\\n        mnans=min(mnans,int(i)-1)\\nif (mnans<10):\\n    print(mnans+1)\\nelse:\\n    print(min(mn1,mn2),max(mn1,mn2),sep='')\\n\", \"n,m = map(int,input().split())\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\na = sorted(a)\\nb = sorted(b)\\nfor i in a:\\n    for j in b:\\n        if i==j:\\n            print(str(i))\\n            return\\n\\nprint(min(int(str(a[0])+str(b[0])),int(str(b[0])+str(a[0]))) )\", \"n, m = list(map(int, input().split()))\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\na.sort()\\nb.sort()\\nc = 0\\nfor i in range(n):\\n    if b.count(a[i]) != 0:\\n        print(a[i])\\n        c = 1\\n        break\\nif c == 0:\\n    k = a[0]\\n    n = b[0]\\n    print(str(min(n, k)) + str(max(n, k)))\\n\\n    \\n\", \"s = input().split(' ')\\nl1 = int(s[0])\\nl2 = int(s[1])\\ns = input().split(' ')\\na1 = s\\nfor i in range(l1):\\n    a1[i] = int(a1[i])\\na1.sort()\\ns = input().split(' ')\\na2 = s\\nfor i in range(l2):\\n    a2[i] = int(a2[i])\\na2.sort()\\n\\nfor i in range(l1):\\n    for j in range(l2):\\n        if a1[i] == a2[j]:\\n            print(str(a1[i]))\\n            quit()\\n\\nprint(str(min(a1[0],a2[0]))+str(max(a1[0],a2[0])))\", \"n, m = list(map(int, input().split()))\\na = set(list(map(int, input().split())))\\nb = set(list(map(int, input().split())))\\n\\ninter = a & b\\n\\nif inter:\\n    print(min(inter))\\nelse:\\n    mina = min(a)\\n    minb = min(b)\\n    \\n    if mina > minb:\\n        mina, minb = minb, mina\\n\\n    print('{}{}'.format(mina, minb))\\n\", \"s = map(int, input().split())\\na = tuple(map(int, input().split()))\\nb = tuple(map(int, input().split()))\\n\\nboth_have_num = 10\\nfor i1 in a:\\n    for i2 in b:\\n        if i1 == i2:\\n            both_have_num = min(both_have_num, i1)\\nmin_a = min(a)\\nmin_b = min(b)\\nans = 0\\nif both_have_num < 10:\\n    print(both_have_num)\\nelse:\\n    print(min(min_a, min_b)*10+max(min_a, min_b))\", \"#!/usr/bin/env python3\\n\\ndef m(s1, s2):\\n    si = s1.intersection(s2)\\n    if si:\\n        return min(si)\\n    smin, smax = sorted(map(min, (s1, s2)))\\n    return smin * 10 + smax\\n\\ndef __starting_point():\\n    input()\\n    print(m(*(set(map(int, input().split())) for i in range(2))))\\n\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\narr1 = sorted(list(map(int, input().split())))\\narr2 = sorted(list(map(int, input().split())))\\nfor i in range(n):\\n    if arr1[i] in arr2:\\n        print(arr1[i])\\n        break\\nelse:\\n    mn1 = min(arr1)\\n    mn2 = min(arr2)\\n    if mn1 < mn2:\\n        print(mn1 * 10 + mn2)\\n    else:\\n        print(mn2 * 10 + mn1)\\n\\n\\n\", \"n, m = map(int, input().split())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nans = []\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i] != b[j]:\\n            ans.append(a[i] * 10 + b[j])\\n            ans.append(a[i] + b[j] * 10)\\n        else:\\n            ans.append(a[i])\\nprint(min(ans))\"]",
        "difficulty": "interview",
        "input": "2 2\n1 9\n9 2\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/870/A"
    },
    {
        "id": 257,
        "task_id": 422,
        "test_case_id": 1,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 2\n5 5\n2 2\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 258,
        "task_id": 422,
        "test_case_id": 2,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 2\n5 6\n2 2\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 259,
        "task_id": 422,
        "test_case_id": 4,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "53 3\n2 3 1 2 2 6 1 5 6 1 5 3 1 1 6 4 3 2 4 1 1 4 4 3 5 6 1 2 2 1 2 2 2 5 4 2 1 4 2 5 3 1 3 6 6 4 4 5 2 1 2 2 1\n5 2 6 3 5 5 1 1 2 4 6 1 4 2 4 1 4 4 5 3 6 4 6 5 6 3 4 4 3 1 1 5 5 1 1 2 4 4 3 1 2 2 3 2 3 2 2 4 5 1 5 2 6\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 260,
        "task_id": 422,
        "test_case_id": 5,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "59 4\n8 1 7 5 4 2 7 5 7 4 4 2 3 7 6 5 1 4 6 6 2 4 6 7 6 7 5 8 8 8 6 3 7 7 2 8 5 5 8 1 2 3 3 6 8 2 3 1 8 3 1 2 3 7 7 3 2 7 5\n1 4 8 6 3 8 2 2 5 7 4 8 8 8 7 8 3 5 4 5 2 6 3 7 3 5 7 8 1 3 7 7 4 8 6 7 6 6 3 7 7 6 8 2 1 8 6 8 4 6 6 2 1 8 1 1 1 1 8\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 261,
        "task_id": 422,
        "test_case_id": 6,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "81 2\n1 2 3 1 3 3 3 3 2 2 2 1 2 1 2 1 2 1 3 3 2 2 1 3 1 3 2 2 3 2 3 1 3 1 1 2 3 1 1 2 1 2 1 2 3 3 1 3 2 2 1 1 3 3 1 1 3 2 1 3 1 3 1 2 1 2 3 3 2 1 3 3 2 1 2 1 3 2 2 3 3\n2 3 1 3 1 1 2 3 2 2 3 3 3 2 2 3 3 1 1 3 1 2 2 1 3 2 3 3 3 3 3 1 1 3 1 2 2 1 1 3 2 3 1 1 2 2 1 1 2 1 3 1 3 2 3 3 1 2 2 2 1 3 2 3 3 1 2 3 1 3 1 1 1 3 3 2 3 3 2 3 2\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 262,
        "task_id": 422,
        "test_case_id": 7,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "17 3\n8 2 4 5 4 5 3 6 6 6 4 1 5 5 8 6 3\n8 4 1 5 1 3 5 6 7 1 5 5 2 6 4 5 4\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 263,
        "task_id": 422,
        "test_case_id": 8,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "33 4\n8 6 6 8 2 5 5 5 2 7 2 6 1 6 7 4 7 4 3 8 6 8 8 4 6 4 8 1 2 1 3 6 8\n7 2 5 2 2 5 2 3 6 8 3 2 2 5 2 7 2 4 7 3 4 6 5 6 3 6 3 3 7 2 3 2 1\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 264,
        "task_id": 422,
        "test_case_id": 9,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "69 2\n2 3 2 3 2 2 2 3 1 2 1 2 3 3 1 2 1 1 1 2 1 2 1 2 2 2 3 2 2 1 2 1 2 2 1 2 2 2 2 3 1 1 2 1 1 1 2 1 3 1 3 1 3 2 2 2 1 1 3 3 1 2 1 3 3 3 1 2 2\n2 1 3 3 2 1 1 3 3 3 1 1 2 3 3 3 3 1 1 3 3 3 3 3 3 2 2 3 2 3 2 1 3 3 3 3 3 2 2 3 3 3 3 2 2 3 1 3 3 2 2 3 3 3 1 2 2 2 3 2 1 3 2 2 1 2 1 1 2\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 265,
        "task_id": 422,
        "test_case_id": 10,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "65 3\n2 1 4 2 4 1 3 2 3 4 3 4 4 3 1 4 4 3 3 1 4 2 1 1 4 3 4 4 3 1 2 4 4 4 3 2 1 4 1 3 4 1 4 3 4 1 1 3 3 2 2 1 2 2 3 2 1 4 2 3 3 3 3 4 3\n1 3 1 3 3 2 1 4 3 4 3 3 1 3 4 2 3 3 1 1 1 3 3 1 1 2 3 3 4 2 2 1 1 3 1 3 4 1 1 2 4 4 3 3 2 2 4 4 4 4 1 1 3 2 3 3 3 2 4 4 1 1 3 4 3\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 266,
        "task_id": 422,
        "test_case_id": 11,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "94 3\n4 2 1 6 1 1 1 5 1 3 3 3 6 1 6 6 3 5 3 1 4 1 3 6 4 5 3 4 6 5 5 2 1 5 4 5 6 5 2 2 6 5 4 6 1 3 5 1 2 5 5 2 1 3 4 5 6 4 3 1 4 4 1 5 4 4 2 2 2 4 4 3 6 2 6 1 5 6 1 3 5 5 1 3 5 3 5 2 6 1 3 6 1 5\n5 6 3 5 4 1 4 6 3 1 4 4 3 3 6 2 1 1 4 6 4 2 4 1 3 1 5 3 6 2 5 6 1 6 6 2 2 2 2 5 2 6 1 4 1 5 1 3 6 6 5 3 2 6 6 2 5 6 3 4 4 4 2 3 1 2 4 5 2 6 3 3 3 3 1 1 1 3 6 3 3 6 5 2 4 1 2 2 1 6 3 5 1 5\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 267,
        "task_id": 422,
        "test_case_id": 18,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 2\n1 5\n1 1\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 268,
        "task_id": 422,
        "test_case_id": 19,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 1\n1 1\n2 2\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 269,
        "task_id": 422,
        "test_case_id": 20,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "3 2\n4 1 1\n1 4 3\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 270,
        "task_id": 422,
        "test_case_id": 22,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 3\n3 7\n2 1\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 271,
        "task_id": 422,
        "test_case_id": 23,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "4 2\n6 6 2 2\n2 2 6 6\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 272,
        "task_id": 422,
        "test_case_id": 24,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "3 2\n6 9 1\n3 3 4\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 273,
        "task_id": 422,
        "test_case_id": 25,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "9 5\n7 2 9 1 1 9 1 2 7\n10 1 9 10 9 2 9 6 4\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 274,
        "task_id": 422,
        "test_case_id": 26,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "10 2\n4 6 7 4 4 3 10 3 6 9\n6 2 7 7 6 4 10 3 2 4\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 275,
        "task_id": 422,
        "test_case_id": 27,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "10 3\n7 9 1 3 6 4 4 6 10 4\n3 2 6 10 9 4 7 5 8 6\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 276,
        "task_id": 422,
        "test_case_id": 28,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 3\n3 1 5 1 1\n1 1 4 5 5\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 277,
        "task_id": 422,
        "test_case_id": 29,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "4 4\n3 2 1 10\n9 10 7 5\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 278,
        "task_id": 422,
        "test_case_id": 31,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 2\n4 6 3 5 10\n7 8 8 2 4\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 279,
        "task_id": 422,
        "test_case_id": 32,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "4 4\n5 1 2 1\n1 9 1 3\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 280,
        "task_id": 422,
        "test_case_id": 33,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "3 2\n4 1 4\n9 3 9\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 281,
        "task_id": 422,
        "test_case_id": 34,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 1\n6 9\n7 10\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 282,
        "task_id": 422,
        "test_case_id": 35,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "2 1\n6 4\n5 3\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 283,
        "task_id": 422,
        "test_case_id": 36,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 4\n3 6 7 8 9\n9 6 3 1 3\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 284,
        "task_id": 422,
        "test_case_id": 37,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "4 1\n8 2 10 6\n8 3 10 7\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 285,
        "task_id": 422,
        "test_case_id": 38,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "3 5\n1 1 1\n10 1 10\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 286,
        "task_id": 422,
        "test_case_id": 39,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 3\n1 1 2 2 3\n6 1 7 7 10\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 287,
        "task_id": 422,
        "test_case_id": 40,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 4\n1 8 10 10 3\n7 4 2 2 6\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 288,
        "task_id": 422,
        "test_case_id": 41,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 4\n9 7 2 1 3\n9 8 9 7 4\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 289,
        "task_id": 422,
        "test_case_id": 43,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "44 14\n28 27 28 14 29 6 5 20 10 16 19 12 14 28 1 16 8 1 15 4 22 1 8 26 28 30 1 28 2 6 17 21 21 8 29 3 30 10 9 17 13 10 29 28\n6 21 13 6 9 8 5 23 24 7 7 19 13 4 25 3 24 15 19 14 26 8 16 3 15 3 1 1 29 9 30 28 3 5 18 14 14 5 4 27 19 18 13 15\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 290,
        "task_id": 422,
        "test_case_id": 44,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 2\n6 9 5 8 10\n5 8 7 6 3\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 291,
        "task_id": 422,
        "test_case_id": 45,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "29 15\n11 8 3 9 30 27 29 13 18 14 30 22 27 22 19 1 14 24 28 21 9 18 3 15 3 12 19 12 24\n18 11 23 11 2 1 1 1 1 1 28 7 14 27 21 14 21 27 1 6 17 3 4 9 8 18 4 23 15\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 292,
        "task_id": 422,
        "test_case_id": 49,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "5 3\n1 6 1 3 6\n6 1 1 1 1\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 293,
        "task_id": 422,
        "test_case_id": 50,
        "question": "Vova has taken his summer practice this year and now he should write a report on how it went.\n\nVova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly $n$ pages and the $i$-th page will include $x_i$ tables and $y_i$ formulas. The pages are numbered from $1$ to $n$.\n\nVova fills the pages one after another, he can't go filling page $i + 1$ before finishing page $i$ and he can't skip pages. \n\nHowever, if he draws strictly more than $k$ tables in a row or writes strictly more than $k$ formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.\n\nNote that the count doesn't reset on the start of the new page. For example, if the page ends with $3$ tables and the next page starts with $5$ tables, then it's counted as $8$ tables in a row.\n\nHelp Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\n\n-----Input-----\n\nThe first line contains two integers $n$ and $k$ ($1 \\le n \\le 3 \\cdot 10^5$, $1 \\le k \\le 10^6$).\n\nThe second line contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^6$) — the number of tables on the $i$-th page.\n\nThe third line contains $n$ integers $y_1, y_2, \\dots, y_n$ ($1 \\le y_i \\le 10^6$) — the number of formulas on the $i$-th page.\n\n\n-----Output-----\n\nPrint \"YES\" if Vova can rearrange tables and formulas on each page in such a way that there is no more than $k$ tables in a row and no more than $k$ formulas in a row.\n\nOtherwise print \"NO\".\n\n\n-----Examples-----\nInput\n2 2\n5 5\n2 2\n\nOutput\nYES\n\nInput\n2 2\n5 6\n2 2\n\nOutput\nNO\n\nInput\n4 1\n4 1 10 1\n3 2 10 1\n\nOutput\nYES\n\n\n\n-----Note-----\n\nIn the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):   page $1$: \"TTFTTFT\"  page $2$: \"TFTTFTT\" \n\nThat way all blocks of tables have length $2$.\n\nIn the second example there is no way to fit everything in such a way that there are no more than $2$ tables in a row and $2$ formulas in a row.",
        "solutions": "[\"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\telse:\\n\\t\\treturn b\\nn, k = map(int, input().split())\\nx = [int(t) for t in input().split()]\\ny = [int(t) for t in input().split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, x[i] + f - k * y[i])\\n    s = max(0, y[i] + s - k * x[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def max(a, b):\\n\\tif a > b:\\n\\t\\treturn a\\n\\treturn b\\nn, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"def get(px, py, x, y):\\n\\tans = 10**18\\n\\tnonlocal k\\n\\tif px <= k:\\n\\t\\tcnt = (px + x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, px + x - cnt * k)\\n\\t\\telif y > cnt and y <= x * k:\\n\\t\\t\\tans = min(ans, 1)\\n\\tif py <= k:\\n\\t\\tcnt = (x + k - 1) // k - 1\\n\\t\\tif y == cnt:\\n\\t\\t\\tans = min(ans, x - cnt * k)\\n\\t\\telif y > cnt and y <= (x - 1) * k + (k - py):\\n\\t\\t\\tans = min(ans, 1)\\n\\treturn ans\\n\\nn, k = map(int, input().split())\\nx = list(map(int, input().split()))\\ny = list(map(int, input().split()))\\ndp = [[10**18] * (n + 1), [10**18] * (n + 1)]\\ndp[0][0], dp[1][0] = 0, 0\\nfor i in range(n):\\n\\tdp[0][i + 1] = get(dp[0][i], dp[1][i], x[i], y[i])\\n\\tdp[1][i + 1] = get(dp[1][i], dp[0][i], y[i], x[i])\\nprint('YES' if min(dp[0][-1], dp[1][-1]) <= k else 'NO')\", \"n, k = map(int, input().split())\\no = [int(t) for t in (input()+' '+input()).split()]\\nf, s = 0, 0\\nfor i in range(n):\\n    f = max(0, o[i] + f - k * o[i+n])\\n    s = max(0, o[i+n] + s - k * o[i])\\n    if f > k or s > k:\\n        print('NO')\\n        return\\nprint('YES')\"]",
        "difficulty": "interview",
        "input": "4 1\n1 1 1 1\n2 1 1 2\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1076/F"
    },
    {
        "id": 294,
        "task_id": 618,
        "test_case_id": 2,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|ABC\nXYZ\n",
        "output": "XYZ|ABC\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 295,
        "task_id": 618,
        "test_case_id": 8,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|C\nA\n",
        "output": "A|C\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 296,
        "task_id": 618,
        "test_case_id": 13,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|MACKERIGZPVHNDYXJBUFLWSO\nQT\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 297,
        "task_id": 618,
        "test_case_id": 27,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|FGRT\nAC\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 298,
        "task_id": 618,
        "test_case_id": 29,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|A\nB\n",
        "output": "B|A\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 299,
        "task_id": 618,
        "test_case_id": 36,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|ABC\nD\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 300,
        "task_id": 618,
        "test_case_id": 38,
        "question": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. \n\nThe scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.\n\n\n-----Input-----\n\nThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale. \n\nThe second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet. \n\nIt is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.\n\n\n-----Output-----\n\nIf you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input.\n\nIf there are multiple answers, print any of them.\n\n\n-----Examples-----\nInput\nAC|T\nL\n\nOutput\nAC|TL\n\nInput\n|ABC\nXYZ\n\nOutput\nXYZ|ABC\n\nInput\nW|T\nF\n\nOutput\nImpossible\n\nInput\nABC|\nD\n\nOutput\nImpossible",
        "solutions": "[\"x = input()\\nz = input()\\na, b = -1, -1\\np, q ='', ''\\np = x[:x.find('|')]\\nq = x[x.find('|') + 1:]\\nn = 0\\nwhile n < len(z):\\n    if len(p) < len(q):\\n        p += z[n]\\n    else:\\n        q += z[n]\\n    n += 1\\nif len(p) == len(q):\\n    print(p, '|', q, sep = '')\\nelse:\\n    print('Impossible')\\n\", \"(a, b) = input().split('|')\\nc = input()\\ni = 0\\nwhile len(c)>0:\\n    if(len(a)<len(b)):\\n        a += c[0]\\n    else:\\n        b += c[0]\\n    c = c[1::]\\n\\nprint(['Impossible', a+'|'+b][len(a)==len(b)])\", \"scales  = input().split('|')\\nweights = list(input())\\n\\nbalance = len(scales[0]) - len(scales[1])\\n\\nwhile weights:\\n    if len(scales[0]) < len(scales[1]):\\n        scales[0] += weights[0]\\n        weights.pop(0)\\n    else:\\n        scales[1] += weights[0]\\n        weights.pop(0)\\n    balance = len(scales[0]) - len(scales[1])\\n\\nif balance == 0:\\n    print('|'.join(scales))\\nelse:\\n    print('Impossible')\\n\\n\\n\"]",
        "difficulty": "interview",
        "input": "|ASD\nX\n",
        "output": "Impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/382/A"
    },
    {
        "id": 301,
        "task_id": 792,
        "test_case_id": 16,
        "question": "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses the card.\n\nShe starts with 0 money on her account.\n\nIn the evening of i-th day a transaction a_{i} occurs. If a_{i} > 0, then a_{i} bourles are deposited to Luba's account. If a_{i} < 0, then a_{i} bourles are withdrawn. And if a_{i} = 0, then the amount of money on Luba's account is checked.\n\nIn the morning of any of n days Luba can go to the bank and deposit any positive integer amount of burles to her account. But there is a limitation: the amount of money on the account can never exceed d.\n\nIt can happen that the amount of money goes greater than d by some transaction in the evening. In this case answer will be «-1».\n\nLuba must not exceed this limit, and also she wants that every day her account is checked (the days when a_{i} = 0) the amount of money on her account is non-negative. It takes a lot of time to go to the bank, so Luba wants to know the minimum number of days she needs to deposit some money to her account (if it is possible to meet all the requirements). Help her!\n\n\n-----Input-----\n\nThe first line contains two integers n, d (1 ≤ n ≤ 10^5, 1 ≤ d ≤ 10^9) —the number of days and the money limitation.\n\nThe second line contains n integer numbers a_1, a_2, ... a_{n} ( - 10^4 ≤ a_{i} ≤ 10^4), where a_{i} represents the transaction in i-th day.\n\n\n-----Output-----\n\nPrint -1 if Luba cannot deposit the money to her account in such a way that the requirements are met. Otherwise print the minimum number of days Luba has to deposit money.\n\n\n-----Examples-----\nInput\n5 10\n-1 5 0 -5 3\n\nOutput\n0\n\nInput\n3 4\n-10 0 20\n\nOutput\n-1\n\nInput\n5 10\n-5 0 10 -11 0\n\nOutput\n2",
        "solutions": "[\"n, d = map(int, input().split())\\nline = list(map(int, input().split()))\\npref = [0] * n\\nmaxx = 0\\nfor i in range(n):\\n    pref[i] = pref[max(i - 1, 0)] + line[i]\\n    maxx = max(maxx, pref[i])\\nmaxr = [0] * n\\nfor i in range(n - 1, -1, -1):\\n    if i == n - 1:\\n        maxr[i] = pref[i]\\n    else:\\n        maxr[i] = max(maxr[i + 1], pref[i])\\nsm = 0\\nbon = 0\\nans = 0\\nb = True\\nif maxx > d:\\n    b = False\\nfor i in range(n):\\n    elem = line[i]\\n    sm += elem\\n    if elem == 0:\\n        #print(sm, bon)\\n        if sm + bon < 0:\\n            ans += 1\\n            bon += max(0, d - (maxr[i] + bon))\\n        if sm + bon < 0:\\n            b = False\\n            break\\n    if sm + bon > d:\\n        b = False\\n        break\\nif b == False:\\n    print(-1)\\nelse:\\n    print(ans)\", \"n,d=map(int,input().split())\\na=list(map(int,input().split()))\\nf=True\\nb=[a[0]]\\nfor i in range(1,n):\\n    b.append(b[i-1]+a[i])\\nif max(b)>d:\\n    f=False\\n        \\nh=[0]*n\\nh[n-1]=b[n-1]\\nfor i in range(n-2,-1,-1):\\n    h[i]=max(b[i],h[i+1])\\nx,k=0,0\\nfor i in range(n):\\n    if a[i]==0 and b[i]+x<0:\\n        k+=1\\n        x+=d-(h[i]+x)\\n        if b[i]+x<0:\\n            f=False\\n            break\\nif f:\\n    print(k)\\nelse:\\n    print(-1)\", \"n, d = [int(x) for x in input().split()]\\ntr = [int(x) for x in input().split()]\\ncash = 0\\nflag = False\\ngr = []\\nfor i in tr:\\n    if i != 0:\\n        cash += i\\n    gr.append(cash)\\n    if cash > d:\\n        flag = True\\n        break\\nif flag:\\n    print(-1)\\nelse:\\n    mx = [-1] * n\\n    mx[-1] = gr[-1]\\n    for i in range(n - 2, -1, -1):\\n        mx[i] = max(gr[i], mx[i + 1])\\n    acash = 0\\n    count = 0\\n    for i in range(n):\\n        if tr[i] == 0:\\n            if gr[i] + acash < 0:\\n                acash += (d - mx[i] - acash)\\n                if gr[i] + acash < 0:\\n                    count = -1\\n                    break\\n                count += 1\\n    print(count)\", \"n, d = map(int, input().split())\\na = list(map(int, input().split()))\\npref = [0 for i in range(n)]\\nc = 0\\nfor i in range(n):\\n    c += a[i]\\n    if a[i] == 0:\\n        c = max(0, c)\\n    pref[i] = c\\nsuff = [0 for i in range(n)]\\nsuff[-1] = pref[-1]\\nmc = suff[-1]\\nfor i in range(n-2, -1, -1):\\n    suff[i] = max(mc, pref[i])\\n    mc = suff[i]\\n    if a[i] == 0 and i > 0:\\n        mc = pref[i-1]\\nif max(suff) > d:\\n    print(-1)\\n    return\\nc = 0\\nans = 0\\nfor i in range(n):\\n    if a[i] != 0:\\n        c += a[i]\\n    else:\\n        if c < 0:\\n            ans += 1\\n            c = max(0, c)\\n            c += d - suff[i]\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\nimport math\\nimport collections\\nimport bisect\\nimport heapq\\nimport time\\nimport random\\nimport itertools\\nimport sys\\n\\n\\\"\\\"\\\"\\ncreated by shhuan at 2017/11/24 00:20\\n\\n\\\"\\\"\\\"\\n\\nN, D = map(int, input().split())\\nA = [int(x) for x in input().split()]\\n\\npresum = [0] * (N+1)\\n\\nfor i in range(1, N+1):\\n    presum[i] = presum[i-1] + A[i-1]\\n\\nrightmax = [0] * N\\nmx = float('-inf')\\nfor i in range(N-1, -1, -1):\\n    mx = max(mx, presum[i+1])\\n    rightmax[i] = mx\\n\\n# print(presum)\\n# print(rightmax)\\n\\nif any(v > D for v in presum):\\n    print(-1)\\n    return\\n\\nans = 0\\nadded = 0\\nfor i in range(N):\\n    if A[i] == 0:\\n        if presum[i+1] + added < 0:\\n            dmin = 0-presum[i+1]-added\\n            dmax = min(D-presum[i+1]-added, D-added-rightmax[i])\\n            if dmin > dmax:\\n                print(-1)\\n                return\\n\\n            added += dmax\\n            ans += 1\\nprint(ans)\", \"n, d = list(map(int, input().split()))\\na = [0] + list(map(int, input().split()))\\nb = [0] * (n + 2)\\nb[n] = a[n]\\nnow = a[n]\\nfor i in range(n - 1 , 0 , -1):\\n    now = a[i] + max(now, 0)\\n    b[i] = now\\nnow = 0\\nres = 0\\nfor i in range(1 , n + 1):\\n    if a[i] == 0:\\n        if now < 0:\\n            res += 1\\n            now = min(d, max(0, d - b[i + 1]))\\n    else:\\n        now += a[i]\\n        if now > d:\\n            res = -1\\n            break\\nprint(res)\\n\\n\\n\", \"f = lambda: map(int, input().split())\\nn, d = f()\\nh = s = k = 0\\nfor q in f():\\n    h, s = h + q, min(d, s + q)\\n    if h > d:\\n        k = -1\\n        break\\n    if q == 0:\\n        h = max(0, h)\\n        if s < 0: s, k = d, k + 1\\nprint(k)\", \"def main():\\n\\tn, d = map(int, input().split())\\n\\ta = list(map(int, input().split()))\\n\\t\\n\\tpref, mx, add, ans = [0] * n, [0] * n, 0, 0\\n\\n\\tfor pos in range(n):\\n\\t\\tpref[pos] = a[pos] if not pos else a[pos] + pref[pos-1]\\n\\n\\tfor pos in range(n-1, -1, -1):\\n\\t\\tmx[pos] = pref[pos] if pos == n - 1 else max(mx[pos + 1], pref[pos])\\n\\n\\tfor i in range(n):\\n\\t\\tif pref[i] + add > d:\\n\\t\\t\\tprint(\\\"-1\\\")\\n\\t\\t\\treturn\\n\\t\\tif a[i] == 0 and pref[i] + add < 0:\\n\\t\\t\\tans += 1\\n\\t\\t\\tadd += max(-(pref[i] + add), d - mx[i] - add)\\n\\tprint(ans)\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"[n, d] = [int(x) for x in input().split(' ')]\\nA = [int(a) for a in input().split(' ')]\\n\\ndef solve():\\n    ans = 0\\n    bal = 0\\n    minGap = 0\\n    for i in range(n):\\n        if A[i] == 0:\\n            if bal < 0:\\n                go = min(-bal, minGap)\\n                minGap -= go\\n                bal += go\\n                if bal < 0:\\n                    ans += 1\\n                    bal = 0\\n                    minGap = d\\n        else:\\n            bal += A[i]\\n            if bal > d:\\n                return -1\\n            minGap = min(minGap, d - bal)\\n    return ans\\n\\nprint(solve())\", \"n, d = list(map(int, input().split()))\\nl = list(map(int, input().split()))\\nmus = [0] * n\\nmus[0] = l[0]\\ncnt = 0\\nans = 0\\nfor i in range(1, n):\\n    mus[i] = mus[i - 1] +  l[i]\\nsuf = [0] * n\\nsuf[-1] = mus[-1]\\nfor i in range(n - 2, -1, -1):\\n    suf[i] = max(mus[i], suf[i + 1])\\nfor i in range(n):\\n    if l[i] == 0 and mus[i] + cnt < 0:\\n        if (d - suf[i] - cnt < 0 or d - suf[i] < abs(mus[i])):\\n            print(-1)\\n            return\\n        else:\\n            cnt += (d - suf[i]  - cnt)\\n            ans += 1\\nif suf[0] > d:\\n    print(-1)\\n    return\\nprint(ans)\", \"#Bhargey Mehta (Sophomore)\\n#DA-IICT, Gandhinagar\\nimport sys, math, queue, bisect\\n#sys.stdin = open(\\\"input.txt\\\", \\\"r\\\")\\nMOD = 10**9+7\\nsys.setrecursionlimit(1000000)\\n\\nn, d = map(int, input().split())\\na = list(map(int, input().split()))\\np = [0 for i in range(n)]\\nfor i in range(n):\\n    p[i] = p[i-1]+a[i]\\nmx = [-1 for i in range(n)]\\nmx[-1] = p[-1]\\nfor i in range(n-2, -1, -1):\\n    mx[i] = max(mx[i+1], p[i])\\nc = 0\\nans = 0\\nfor i in range(n):\\n    p[i] += c\\n    if p[i] > d:\\n        print(-1)\\n        return\\n    if a[i] != 0 or p[i] >= 0: continue\\n\\n    av = d-(mx[i]+c)\\n    if -p[i] > av:\\n        print(-1)\\n        return\\n    ans += 1\\n    c = d-mx[i]\\nprint(ans)\", \"import os\\nimport sys\\n\\ndef log(*args, **kwargs):\\n    if os.environ.get('CODEFR'):\\n        print(*args, **kwargs)\\n\\n\\n#n = int(input())\\nn, d = tuple(map(int,input().split()))\\na = list(map(int,input().split()))\\n\\ns = 0\\nk = 0\\ndep = 0\\nfor i in a:\\n    if i == 0:\\n        if s < 0:\\n            if dep < -s:\\n                k += 1\\n                dep = d\\n            else:\\n                dep += s\\n            s = 0\\n    else:\\n        s += i\\n        if s > d:\\n            print(-1)\\n            return\\n        dep = min(dep, d - s)\\n\\nprint(k)\\n\", \"R = lambda: map(int, input().split())\\nn, k = R()\\narr = list(R())\\ntup = [0, 0]\\nres = 0\\nfor x in arr:\\n    if x != 0:\\n        tup[0], tup[1] = tup[0] + x, tup[1] + x\\n        tup[1] = min(tup[1], k)\\n    elif tup[1] < 0:\\n        tup[0], tup[1] = 0, k\\n        res += 1\\n    else:\\n        tup[0] = max(0, tup[0])\\n    if tup[0] > k:\\n        res = -1\\n        break\\nprint(res)\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"import sys\\ninput = sys.stdin.readline\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nans = 0\\nub, lb = 0, 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        if lb < 0:\\n            lb = 0\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\n\\nprint(ans)\\n\", \"n,d=list(map(int,input().split()))\\na=list(map(int,input().split()))\\ns=0\\nm=0\\nans=0 \\nflag=True\\nn=len(a)\\nfor i in range(n):\\n    if a[i]==0:\\n        if s<0:\\n            s=d\\n            m=d\\n            ans+=1\\n        else:\\n            m=min(m,s)\\n    elif a[i]<0:\\n        s=s+a[i] \\n    else:\\n        if(s+a[i]>d):\\n            if(s+a[i]-d)>m:\\n                flag=False\\n                break \\n            else:\\n                m-=(s+a[i]-d)\\n                s=d \\n        else:\\n            s=s+a[i] \\nif flag:\\n    print(ans)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nub, lb = 0, 0\\nans = 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        lb = max(lb, 0)\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "5 10\n-8 -24 0 -22 12\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/893/D"
    },
    {
        "id": 302,
        "task_id": 792,
        "test_case_id": 24,
        "question": "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses the card.\n\nShe starts with 0 money on her account.\n\nIn the evening of i-th day a transaction a_{i} occurs. If a_{i} > 0, then a_{i} bourles are deposited to Luba's account. If a_{i} < 0, then a_{i} bourles are withdrawn. And if a_{i} = 0, then the amount of money on Luba's account is checked.\n\nIn the morning of any of n days Luba can go to the bank and deposit any positive integer amount of burles to her account. But there is a limitation: the amount of money on the account can never exceed d.\n\nIt can happen that the amount of money goes greater than d by some transaction in the evening. In this case answer will be «-1».\n\nLuba must not exceed this limit, and also she wants that every day her account is checked (the days when a_{i} = 0) the amount of money on her account is non-negative. It takes a lot of time to go to the bank, so Luba wants to know the minimum number of days she needs to deposit some money to her account (if it is possible to meet all the requirements). Help her!\n\n\n-----Input-----\n\nThe first line contains two integers n, d (1 ≤ n ≤ 10^5, 1 ≤ d ≤ 10^9) —the number of days and the money limitation.\n\nThe second line contains n integer numbers a_1, a_2, ... a_{n} ( - 10^4 ≤ a_{i} ≤ 10^4), where a_{i} represents the transaction in i-th day.\n\n\n-----Output-----\n\nPrint -1 if Luba cannot deposit the money to her account in such a way that the requirements are met. Otherwise print the minimum number of days Luba has to deposit money.\n\n\n-----Examples-----\nInput\n5 10\n-1 5 0 -5 3\n\nOutput\n0\n\nInput\n3 4\n-10 0 20\n\nOutput\n-1\n\nInput\n5 10\n-5 0 10 -11 0\n\nOutput\n2",
        "solutions": "[\"n, d = map(int, input().split())\\nline = list(map(int, input().split()))\\npref = [0] * n\\nmaxx = 0\\nfor i in range(n):\\n    pref[i] = pref[max(i - 1, 0)] + line[i]\\n    maxx = max(maxx, pref[i])\\nmaxr = [0] * n\\nfor i in range(n - 1, -1, -1):\\n    if i == n - 1:\\n        maxr[i] = pref[i]\\n    else:\\n        maxr[i] = max(maxr[i + 1], pref[i])\\nsm = 0\\nbon = 0\\nans = 0\\nb = True\\nif maxx > d:\\n    b = False\\nfor i in range(n):\\n    elem = line[i]\\n    sm += elem\\n    if elem == 0:\\n        #print(sm, bon)\\n        if sm + bon < 0:\\n            ans += 1\\n            bon += max(0, d - (maxr[i] + bon))\\n        if sm + bon < 0:\\n            b = False\\n            break\\n    if sm + bon > d:\\n        b = False\\n        break\\nif b == False:\\n    print(-1)\\nelse:\\n    print(ans)\", \"n,d=map(int,input().split())\\na=list(map(int,input().split()))\\nf=True\\nb=[a[0]]\\nfor i in range(1,n):\\n    b.append(b[i-1]+a[i])\\nif max(b)>d:\\n    f=False\\n        \\nh=[0]*n\\nh[n-1]=b[n-1]\\nfor i in range(n-2,-1,-1):\\n    h[i]=max(b[i],h[i+1])\\nx,k=0,0\\nfor i in range(n):\\n    if a[i]==0 and b[i]+x<0:\\n        k+=1\\n        x+=d-(h[i]+x)\\n        if b[i]+x<0:\\n            f=False\\n            break\\nif f:\\n    print(k)\\nelse:\\n    print(-1)\", \"n, d = [int(x) for x in input().split()]\\ntr = [int(x) for x in input().split()]\\ncash = 0\\nflag = False\\ngr = []\\nfor i in tr:\\n    if i != 0:\\n        cash += i\\n    gr.append(cash)\\n    if cash > d:\\n        flag = True\\n        break\\nif flag:\\n    print(-1)\\nelse:\\n    mx = [-1] * n\\n    mx[-1] = gr[-1]\\n    for i in range(n - 2, -1, -1):\\n        mx[i] = max(gr[i], mx[i + 1])\\n    acash = 0\\n    count = 0\\n    for i in range(n):\\n        if tr[i] == 0:\\n            if gr[i] + acash < 0:\\n                acash += (d - mx[i] - acash)\\n                if gr[i] + acash < 0:\\n                    count = -1\\n                    break\\n                count += 1\\n    print(count)\", \"n, d = map(int, input().split())\\na = list(map(int, input().split()))\\npref = [0 for i in range(n)]\\nc = 0\\nfor i in range(n):\\n    c += a[i]\\n    if a[i] == 0:\\n        c = max(0, c)\\n    pref[i] = c\\nsuff = [0 for i in range(n)]\\nsuff[-1] = pref[-1]\\nmc = suff[-1]\\nfor i in range(n-2, -1, -1):\\n    suff[i] = max(mc, pref[i])\\n    mc = suff[i]\\n    if a[i] == 0 and i > 0:\\n        mc = pref[i-1]\\nif max(suff) > d:\\n    print(-1)\\n    return\\nc = 0\\nans = 0\\nfor i in range(n):\\n    if a[i] != 0:\\n        c += a[i]\\n    else:\\n        if c < 0:\\n            ans += 1\\n            c = max(0, c)\\n            c += d - suff[i]\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\nimport math\\nimport collections\\nimport bisect\\nimport heapq\\nimport time\\nimport random\\nimport itertools\\nimport sys\\n\\n\\\"\\\"\\\"\\ncreated by shhuan at 2017/11/24 00:20\\n\\n\\\"\\\"\\\"\\n\\nN, D = map(int, input().split())\\nA = [int(x) for x in input().split()]\\n\\npresum = [0] * (N+1)\\n\\nfor i in range(1, N+1):\\n    presum[i] = presum[i-1] + A[i-1]\\n\\nrightmax = [0] * N\\nmx = float('-inf')\\nfor i in range(N-1, -1, -1):\\n    mx = max(mx, presum[i+1])\\n    rightmax[i] = mx\\n\\n# print(presum)\\n# print(rightmax)\\n\\nif any(v > D for v in presum):\\n    print(-1)\\n    return\\n\\nans = 0\\nadded = 0\\nfor i in range(N):\\n    if A[i] == 0:\\n        if presum[i+1] + added < 0:\\n            dmin = 0-presum[i+1]-added\\n            dmax = min(D-presum[i+1]-added, D-added-rightmax[i])\\n            if dmin > dmax:\\n                print(-1)\\n                return\\n\\n            added += dmax\\n            ans += 1\\nprint(ans)\", \"n, d = list(map(int, input().split()))\\na = [0] + list(map(int, input().split()))\\nb = [0] * (n + 2)\\nb[n] = a[n]\\nnow = a[n]\\nfor i in range(n - 1 , 0 , -1):\\n    now = a[i] + max(now, 0)\\n    b[i] = now\\nnow = 0\\nres = 0\\nfor i in range(1 , n + 1):\\n    if a[i] == 0:\\n        if now < 0:\\n            res += 1\\n            now = min(d, max(0, d - b[i + 1]))\\n    else:\\n        now += a[i]\\n        if now > d:\\n            res = -1\\n            break\\nprint(res)\\n\\n\\n\", \"f = lambda: map(int, input().split())\\nn, d = f()\\nh = s = k = 0\\nfor q in f():\\n    h, s = h + q, min(d, s + q)\\n    if h > d:\\n        k = -1\\n        break\\n    if q == 0:\\n        h = max(0, h)\\n        if s < 0: s, k = d, k + 1\\nprint(k)\", \"def main():\\n\\tn, d = map(int, input().split())\\n\\ta = list(map(int, input().split()))\\n\\t\\n\\tpref, mx, add, ans = [0] * n, [0] * n, 0, 0\\n\\n\\tfor pos in range(n):\\n\\t\\tpref[pos] = a[pos] if not pos else a[pos] + pref[pos-1]\\n\\n\\tfor pos in range(n-1, -1, -1):\\n\\t\\tmx[pos] = pref[pos] if pos == n - 1 else max(mx[pos + 1], pref[pos])\\n\\n\\tfor i in range(n):\\n\\t\\tif pref[i] + add > d:\\n\\t\\t\\tprint(\\\"-1\\\")\\n\\t\\t\\treturn\\n\\t\\tif a[i] == 0 and pref[i] + add < 0:\\n\\t\\t\\tans += 1\\n\\t\\t\\tadd += max(-(pref[i] + add), d - mx[i] - add)\\n\\tprint(ans)\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"[n, d] = [int(x) for x in input().split(' ')]\\nA = [int(a) for a in input().split(' ')]\\n\\ndef solve():\\n    ans = 0\\n    bal = 0\\n    minGap = 0\\n    for i in range(n):\\n        if A[i] == 0:\\n            if bal < 0:\\n                go = min(-bal, minGap)\\n                minGap -= go\\n                bal += go\\n                if bal < 0:\\n                    ans += 1\\n                    bal = 0\\n                    minGap = d\\n        else:\\n            bal += A[i]\\n            if bal > d:\\n                return -1\\n            minGap = min(minGap, d - bal)\\n    return ans\\n\\nprint(solve())\", \"n, d = list(map(int, input().split()))\\nl = list(map(int, input().split()))\\nmus = [0] * n\\nmus[0] = l[0]\\ncnt = 0\\nans = 0\\nfor i in range(1, n):\\n    mus[i] = mus[i - 1] +  l[i]\\nsuf = [0] * n\\nsuf[-1] = mus[-1]\\nfor i in range(n - 2, -1, -1):\\n    suf[i] = max(mus[i], suf[i + 1])\\nfor i in range(n):\\n    if l[i] == 0 and mus[i] + cnt < 0:\\n        if (d - suf[i] - cnt < 0 or d - suf[i] < abs(mus[i])):\\n            print(-1)\\n            return\\n        else:\\n            cnt += (d - suf[i]  - cnt)\\n            ans += 1\\nif suf[0] > d:\\n    print(-1)\\n    return\\nprint(ans)\", \"#Bhargey Mehta (Sophomore)\\n#DA-IICT, Gandhinagar\\nimport sys, math, queue, bisect\\n#sys.stdin = open(\\\"input.txt\\\", \\\"r\\\")\\nMOD = 10**9+7\\nsys.setrecursionlimit(1000000)\\n\\nn, d = map(int, input().split())\\na = list(map(int, input().split()))\\np = [0 for i in range(n)]\\nfor i in range(n):\\n    p[i] = p[i-1]+a[i]\\nmx = [-1 for i in range(n)]\\nmx[-1] = p[-1]\\nfor i in range(n-2, -1, -1):\\n    mx[i] = max(mx[i+1], p[i])\\nc = 0\\nans = 0\\nfor i in range(n):\\n    p[i] += c\\n    if p[i] > d:\\n        print(-1)\\n        return\\n    if a[i] != 0 or p[i] >= 0: continue\\n\\n    av = d-(mx[i]+c)\\n    if -p[i] > av:\\n        print(-1)\\n        return\\n    ans += 1\\n    c = d-mx[i]\\nprint(ans)\", \"import os\\nimport sys\\n\\ndef log(*args, **kwargs):\\n    if os.environ.get('CODEFR'):\\n        print(*args, **kwargs)\\n\\n\\n#n = int(input())\\nn, d = tuple(map(int,input().split()))\\na = list(map(int,input().split()))\\n\\ns = 0\\nk = 0\\ndep = 0\\nfor i in a:\\n    if i == 0:\\n        if s < 0:\\n            if dep < -s:\\n                k += 1\\n                dep = d\\n            else:\\n                dep += s\\n            s = 0\\n    else:\\n        s += i\\n        if s > d:\\n            print(-1)\\n            return\\n        dep = min(dep, d - s)\\n\\nprint(k)\\n\", \"R = lambda: map(int, input().split())\\nn, k = R()\\narr = list(R())\\ntup = [0, 0]\\nres = 0\\nfor x in arr:\\n    if x != 0:\\n        tup[0], tup[1] = tup[0] + x, tup[1] + x\\n        tup[1] = min(tup[1], k)\\n    elif tup[1] < 0:\\n        tup[0], tup[1] = 0, k\\n        res += 1\\n    else:\\n        tup[0] = max(0, tup[0])\\n    if tup[0] > k:\\n        res = -1\\n        break\\nprint(res)\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"import sys\\ninput = sys.stdin.readline\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nans = 0\\nub, lb = 0, 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        if lb < 0:\\n            lb = 0\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\n\\nprint(ans)\\n\", \"n,d=list(map(int,input().split()))\\na=list(map(int,input().split()))\\ns=0\\nm=0\\nans=0 \\nflag=True\\nn=len(a)\\nfor i in range(n):\\n    if a[i]==0:\\n        if s<0:\\n            s=d\\n            m=d\\n            ans+=1\\n        else:\\n            m=min(m,s)\\n    elif a[i]<0:\\n        s=s+a[i] \\n    else:\\n        if(s+a[i]>d):\\n            if(s+a[i]-d)>m:\\n                flag=False\\n                break \\n            else:\\n                m-=(s+a[i]-d)\\n                s=d \\n        else:\\n            s=s+a[i] \\nif flag:\\n    print(ans)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nub, lb = 0, 0\\nans = 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        lb = max(lb, 0)\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "6 2\n-2 3 0 -2 0 0\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/893/D"
    },
    {
        "id": 303,
        "task_id": 792,
        "test_case_id": 29,
        "question": "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses the card.\n\nShe starts with 0 money on her account.\n\nIn the evening of i-th day a transaction a_{i} occurs. If a_{i} > 0, then a_{i} bourles are deposited to Luba's account. If a_{i} < 0, then a_{i} bourles are withdrawn. And if a_{i} = 0, then the amount of money on Luba's account is checked.\n\nIn the morning of any of n days Luba can go to the bank and deposit any positive integer amount of burles to her account. But there is a limitation: the amount of money on the account can never exceed d.\n\nIt can happen that the amount of money goes greater than d by some transaction in the evening. In this case answer will be «-1».\n\nLuba must not exceed this limit, and also she wants that every day her account is checked (the days when a_{i} = 0) the amount of money on her account is non-negative. It takes a lot of time to go to the bank, so Luba wants to know the minimum number of days she needs to deposit some money to her account (if it is possible to meet all the requirements). Help her!\n\n\n-----Input-----\n\nThe first line contains two integers n, d (1 ≤ n ≤ 10^5, 1 ≤ d ≤ 10^9) —the number of days and the money limitation.\n\nThe second line contains n integer numbers a_1, a_2, ... a_{n} ( - 10^4 ≤ a_{i} ≤ 10^4), where a_{i} represents the transaction in i-th day.\n\n\n-----Output-----\n\nPrint -1 if Luba cannot deposit the money to her account in such a way that the requirements are met. Otherwise print the minimum number of days Luba has to deposit money.\n\n\n-----Examples-----\nInput\n5 10\n-1 5 0 -5 3\n\nOutput\n0\n\nInput\n3 4\n-10 0 20\n\nOutput\n-1\n\nInput\n5 10\n-5 0 10 -11 0\n\nOutput\n2",
        "solutions": "[\"n, d = map(int, input().split())\\nline = list(map(int, input().split()))\\npref = [0] * n\\nmaxx = 0\\nfor i in range(n):\\n    pref[i] = pref[max(i - 1, 0)] + line[i]\\n    maxx = max(maxx, pref[i])\\nmaxr = [0] * n\\nfor i in range(n - 1, -1, -1):\\n    if i == n - 1:\\n        maxr[i] = pref[i]\\n    else:\\n        maxr[i] = max(maxr[i + 1], pref[i])\\nsm = 0\\nbon = 0\\nans = 0\\nb = True\\nif maxx > d:\\n    b = False\\nfor i in range(n):\\n    elem = line[i]\\n    sm += elem\\n    if elem == 0:\\n        #print(sm, bon)\\n        if sm + bon < 0:\\n            ans += 1\\n            bon += max(0, d - (maxr[i] + bon))\\n        if sm + bon < 0:\\n            b = False\\n            break\\n    if sm + bon > d:\\n        b = False\\n        break\\nif b == False:\\n    print(-1)\\nelse:\\n    print(ans)\", \"n,d=map(int,input().split())\\na=list(map(int,input().split()))\\nf=True\\nb=[a[0]]\\nfor i in range(1,n):\\n    b.append(b[i-1]+a[i])\\nif max(b)>d:\\n    f=False\\n        \\nh=[0]*n\\nh[n-1]=b[n-1]\\nfor i in range(n-2,-1,-1):\\n    h[i]=max(b[i],h[i+1])\\nx,k=0,0\\nfor i in range(n):\\n    if a[i]==0 and b[i]+x<0:\\n        k+=1\\n        x+=d-(h[i]+x)\\n        if b[i]+x<0:\\n            f=False\\n            break\\nif f:\\n    print(k)\\nelse:\\n    print(-1)\", \"n, d = [int(x) for x in input().split()]\\ntr = [int(x) for x in input().split()]\\ncash = 0\\nflag = False\\ngr = []\\nfor i in tr:\\n    if i != 0:\\n        cash += i\\n    gr.append(cash)\\n    if cash > d:\\n        flag = True\\n        break\\nif flag:\\n    print(-1)\\nelse:\\n    mx = [-1] * n\\n    mx[-1] = gr[-1]\\n    for i in range(n - 2, -1, -1):\\n        mx[i] = max(gr[i], mx[i + 1])\\n    acash = 0\\n    count = 0\\n    for i in range(n):\\n        if tr[i] == 0:\\n            if gr[i] + acash < 0:\\n                acash += (d - mx[i] - acash)\\n                if gr[i] + acash < 0:\\n                    count = -1\\n                    break\\n                count += 1\\n    print(count)\", \"n, d = map(int, input().split())\\na = list(map(int, input().split()))\\npref = [0 for i in range(n)]\\nc = 0\\nfor i in range(n):\\n    c += a[i]\\n    if a[i] == 0:\\n        c = max(0, c)\\n    pref[i] = c\\nsuff = [0 for i in range(n)]\\nsuff[-1] = pref[-1]\\nmc = suff[-1]\\nfor i in range(n-2, -1, -1):\\n    suff[i] = max(mc, pref[i])\\n    mc = suff[i]\\n    if a[i] == 0 and i > 0:\\n        mc = pref[i-1]\\nif max(suff) > d:\\n    print(-1)\\n    return\\nc = 0\\nans = 0\\nfor i in range(n):\\n    if a[i] != 0:\\n        c += a[i]\\n    else:\\n        if c < 0:\\n            ans += 1\\n            c = max(0, c)\\n            c += d - suff[i]\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\nimport math\\nimport collections\\nimport bisect\\nimport heapq\\nimport time\\nimport random\\nimport itertools\\nimport sys\\n\\n\\\"\\\"\\\"\\ncreated by shhuan at 2017/11/24 00:20\\n\\n\\\"\\\"\\\"\\n\\nN, D = map(int, input().split())\\nA = [int(x) for x in input().split()]\\n\\npresum = [0] * (N+1)\\n\\nfor i in range(1, N+1):\\n    presum[i] = presum[i-1] + A[i-1]\\n\\nrightmax = [0] * N\\nmx = float('-inf')\\nfor i in range(N-1, -1, -1):\\n    mx = max(mx, presum[i+1])\\n    rightmax[i] = mx\\n\\n# print(presum)\\n# print(rightmax)\\n\\nif any(v > D for v in presum):\\n    print(-1)\\n    return\\n\\nans = 0\\nadded = 0\\nfor i in range(N):\\n    if A[i] == 0:\\n        if presum[i+1] + added < 0:\\n            dmin = 0-presum[i+1]-added\\n            dmax = min(D-presum[i+1]-added, D-added-rightmax[i])\\n            if dmin > dmax:\\n                print(-1)\\n                return\\n\\n            added += dmax\\n            ans += 1\\nprint(ans)\", \"n, d = list(map(int, input().split()))\\na = [0] + list(map(int, input().split()))\\nb = [0] * (n + 2)\\nb[n] = a[n]\\nnow = a[n]\\nfor i in range(n - 1 , 0 , -1):\\n    now = a[i] + max(now, 0)\\n    b[i] = now\\nnow = 0\\nres = 0\\nfor i in range(1 , n + 1):\\n    if a[i] == 0:\\n        if now < 0:\\n            res += 1\\n            now = min(d, max(0, d - b[i + 1]))\\n    else:\\n        now += a[i]\\n        if now > d:\\n            res = -1\\n            break\\nprint(res)\\n\\n\\n\", \"f = lambda: map(int, input().split())\\nn, d = f()\\nh = s = k = 0\\nfor q in f():\\n    h, s = h + q, min(d, s + q)\\n    if h > d:\\n        k = -1\\n        break\\n    if q == 0:\\n        h = max(0, h)\\n        if s < 0: s, k = d, k + 1\\nprint(k)\", \"def main():\\n\\tn, d = map(int, input().split())\\n\\ta = list(map(int, input().split()))\\n\\t\\n\\tpref, mx, add, ans = [0] * n, [0] * n, 0, 0\\n\\n\\tfor pos in range(n):\\n\\t\\tpref[pos] = a[pos] if not pos else a[pos] + pref[pos-1]\\n\\n\\tfor pos in range(n-1, -1, -1):\\n\\t\\tmx[pos] = pref[pos] if pos == n - 1 else max(mx[pos + 1], pref[pos])\\n\\n\\tfor i in range(n):\\n\\t\\tif pref[i] + add > d:\\n\\t\\t\\tprint(\\\"-1\\\")\\n\\t\\t\\treturn\\n\\t\\tif a[i] == 0 and pref[i] + add < 0:\\n\\t\\t\\tans += 1\\n\\t\\t\\tadd += max(-(pref[i] + add), d - mx[i] - add)\\n\\tprint(ans)\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"[n, d] = [int(x) for x in input().split(' ')]\\nA = [int(a) for a in input().split(' ')]\\n\\ndef solve():\\n    ans = 0\\n    bal = 0\\n    minGap = 0\\n    for i in range(n):\\n        if A[i] == 0:\\n            if bal < 0:\\n                go = min(-bal, minGap)\\n                minGap -= go\\n                bal += go\\n                if bal < 0:\\n                    ans += 1\\n                    bal = 0\\n                    minGap = d\\n        else:\\n            bal += A[i]\\n            if bal > d:\\n                return -1\\n            minGap = min(minGap, d - bal)\\n    return ans\\n\\nprint(solve())\", \"n, d = list(map(int, input().split()))\\nl = list(map(int, input().split()))\\nmus = [0] * n\\nmus[0] = l[0]\\ncnt = 0\\nans = 0\\nfor i in range(1, n):\\n    mus[i] = mus[i - 1] +  l[i]\\nsuf = [0] * n\\nsuf[-1] = mus[-1]\\nfor i in range(n - 2, -1, -1):\\n    suf[i] = max(mus[i], suf[i + 1])\\nfor i in range(n):\\n    if l[i] == 0 and mus[i] + cnt < 0:\\n        if (d - suf[i] - cnt < 0 or d - suf[i] < abs(mus[i])):\\n            print(-1)\\n            return\\n        else:\\n            cnt += (d - suf[i]  - cnt)\\n            ans += 1\\nif suf[0] > d:\\n    print(-1)\\n    return\\nprint(ans)\", \"#Bhargey Mehta (Sophomore)\\n#DA-IICT, Gandhinagar\\nimport sys, math, queue, bisect\\n#sys.stdin = open(\\\"input.txt\\\", \\\"r\\\")\\nMOD = 10**9+7\\nsys.setrecursionlimit(1000000)\\n\\nn, d = map(int, input().split())\\na = list(map(int, input().split()))\\np = [0 for i in range(n)]\\nfor i in range(n):\\n    p[i] = p[i-1]+a[i]\\nmx = [-1 for i in range(n)]\\nmx[-1] = p[-1]\\nfor i in range(n-2, -1, -1):\\n    mx[i] = max(mx[i+1], p[i])\\nc = 0\\nans = 0\\nfor i in range(n):\\n    p[i] += c\\n    if p[i] > d:\\n        print(-1)\\n        return\\n    if a[i] != 0 or p[i] >= 0: continue\\n\\n    av = d-(mx[i]+c)\\n    if -p[i] > av:\\n        print(-1)\\n        return\\n    ans += 1\\n    c = d-mx[i]\\nprint(ans)\", \"import os\\nimport sys\\n\\ndef log(*args, **kwargs):\\n    if os.environ.get('CODEFR'):\\n        print(*args, **kwargs)\\n\\n\\n#n = int(input())\\nn, d = tuple(map(int,input().split()))\\na = list(map(int,input().split()))\\n\\ns = 0\\nk = 0\\ndep = 0\\nfor i in a:\\n    if i == 0:\\n        if s < 0:\\n            if dep < -s:\\n                k += 1\\n                dep = d\\n            else:\\n                dep += s\\n            s = 0\\n    else:\\n        s += i\\n        if s > d:\\n            print(-1)\\n            return\\n        dep = min(dep, d - s)\\n\\nprint(k)\\n\", \"R = lambda: map(int, input().split())\\nn, k = R()\\narr = list(R())\\ntup = [0, 0]\\nres = 0\\nfor x in arr:\\n    if x != 0:\\n        tup[0], tup[1] = tup[0] + x, tup[1] + x\\n        tup[1] = min(tup[1], k)\\n    elif tup[1] < 0:\\n        tup[0], tup[1] = 0, k\\n        res += 1\\n    else:\\n        tup[0] = max(0, tup[0])\\n    if tup[0] > k:\\n        res = -1\\n        break\\nprint(res)\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"import sys\\ninput = sys.stdin.readline\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nans = 0\\nub, lb = 0, 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        if lb < 0:\\n            lb = 0\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\n\\nprint(ans)\\n\", \"n,d=list(map(int,input().split()))\\na=list(map(int,input().split()))\\ns=0\\nm=0\\nans=0 \\nflag=True\\nn=len(a)\\nfor i in range(n):\\n    if a[i]==0:\\n        if s<0:\\n            s=d\\n            m=d\\n            ans+=1\\n        else:\\n            m=min(m,s)\\n    elif a[i]<0:\\n        s=s+a[i] \\n    else:\\n        if(s+a[i]>d):\\n            if(s+a[i]-d)>m:\\n                flag=False\\n                break \\n            else:\\n                m-=(s+a[i]-d)\\n                s=d \\n        else:\\n            s=s+a[i] \\nif flag:\\n    print(ans)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nub, lb = 0, 0\\nans = 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        lb = max(lb, 0)\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "6 1\n-3 0 0 0 -2 3\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/893/D"
    },
    {
        "id": 304,
        "task_id": 792,
        "test_case_id": 33,
        "question": "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses the card.\n\nShe starts with 0 money on her account.\n\nIn the evening of i-th day a transaction a_{i} occurs. If a_{i} > 0, then a_{i} bourles are deposited to Luba's account. If a_{i} < 0, then a_{i} bourles are withdrawn. And if a_{i} = 0, then the amount of money on Luba's account is checked.\n\nIn the morning of any of n days Luba can go to the bank and deposit any positive integer amount of burles to her account. But there is a limitation: the amount of money on the account can never exceed d.\n\nIt can happen that the amount of money goes greater than d by some transaction in the evening. In this case answer will be «-1».\n\nLuba must not exceed this limit, and also she wants that every day her account is checked (the days when a_{i} = 0) the amount of money on her account is non-negative. It takes a lot of time to go to the bank, so Luba wants to know the minimum number of days she needs to deposit some money to her account (if it is possible to meet all the requirements). Help her!\n\n\n-----Input-----\n\nThe first line contains two integers n, d (1 ≤ n ≤ 10^5, 1 ≤ d ≤ 10^9) —the number of days and the money limitation.\n\nThe second line contains n integer numbers a_1, a_2, ... a_{n} ( - 10^4 ≤ a_{i} ≤ 10^4), where a_{i} represents the transaction in i-th day.\n\n\n-----Output-----\n\nPrint -1 if Luba cannot deposit the money to her account in such a way that the requirements are met. Otherwise print the minimum number of days Luba has to deposit money.\n\n\n-----Examples-----\nInput\n5 10\n-1 5 0 -5 3\n\nOutput\n0\n\nInput\n3 4\n-10 0 20\n\nOutput\n-1\n\nInput\n5 10\n-5 0 10 -11 0\n\nOutput\n2",
        "solutions": "[\"n, d = map(int, input().split())\\nline = list(map(int, input().split()))\\npref = [0] * n\\nmaxx = 0\\nfor i in range(n):\\n    pref[i] = pref[max(i - 1, 0)] + line[i]\\n    maxx = max(maxx, pref[i])\\nmaxr = [0] * n\\nfor i in range(n - 1, -1, -1):\\n    if i == n - 1:\\n        maxr[i] = pref[i]\\n    else:\\n        maxr[i] = max(maxr[i + 1], pref[i])\\nsm = 0\\nbon = 0\\nans = 0\\nb = True\\nif maxx > d:\\n    b = False\\nfor i in range(n):\\n    elem = line[i]\\n    sm += elem\\n    if elem == 0:\\n        #print(sm, bon)\\n        if sm + bon < 0:\\n            ans += 1\\n            bon += max(0, d - (maxr[i] + bon))\\n        if sm + bon < 0:\\n            b = False\\n            break\\n    if sm + bon > d:\\n        b = False\\n        break\\nif b == False:\\n    print(-1)\\nelse:\\n    print(ans)\", \"n,d=map(int,input().split())\\na=list(map(int,input().split()))\\nf=True\\nb=[a[0]]\\nfor i in range(1,n):\\n    b.append(b[i-1]+a[i])\\nif max(b)>d:\\n    f=False\\n        \\nh=[0]*n\\nh[n-1]=b[n-1]\\nfor i in range(n-2,-1,-1):\\n    h[i]=max(b[i],h[i+1])\\nx,k=0,0\\nfor i in range(n):\\n    if a[i]==0 and b[i]+x<0:\\n        k+=1\\n        x+=d-(h[i]+x)\\n        if b[i]+x<0:\\n            f=False\\n            break\\nif f:\\n    print(k)\\nelse:\\n    print(-1)\", \"n, d = [int(x) for x in input().split()]\\ntr = [int(x) for x in input().split()]\\ncash = 0\\nflag = False\\ngr = []\\nfor i in tr:\\n    if i != 0:\\n        cash += i\\n    gr.append(cash)\\n    if cash > d:\\n        flag = True\\n        break\\nif flag:\\n    print(-1)\\nelse:\\n    mx = [-1] * n\\n    mx[-1] = gr[-1]\\n    for i in range(n - 2, -1, -1):\\n        mx[i] = max(gr[i], mx[i + 1])\\n    acash = 0\\n    count = 0\\n    for i in range(n):\\n        if tr[i] == 0:\\n            if gr[i] + acash < 0:\\n                acash += (d - mx[i] - acash)\\n                if gr[i] + acash < 0:\\n                    count = -1\\n                    break\\n                count += 1\\n    print(count)\", \"n, d = map(int, input().split())\\na = list(map(int, input().split()))\\npref = [0 for i in range(n)]\\nc = 0\\nfor i in range(n):\\n    c += a[i]\\n    if a[i] == 0:\\n        c = max(0, c)\\n    pref[i] = c\\nsuff = [0 for i in range(n)]\\nsuff[-1] = pref[-1]\\nmc = suff[-1]\\nfor i in range(n-2, -1, -1):\\n    suff[i] = max(mc, pref[i])\\n    mc = suff[i]\\n    if a[i] == 0 and i > 0:\\n        mc = pref[i-1]\\nif max(suff) > d:\\n    print(-1)\\n    return\\nc = 0\\nans = 0\\nfor i in range(n):\\n    if a[i] != 0:\\n        c += a[i]\\n    else:\\n        if c < 0:\\n            ans += 1\\n            c = max(0, c)\\n            c += d - suff[i]\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\nimport math\\nimport collections\\nimport bisect\\nimport heapq\\nimport time\\nimport random\\nimport itertools\\nimport sys\\n\\n\\\"\\\"\\\"\\ncreated by shhuan at 2017/11/24 00:20\\n\\n\\\"\\\"\\\"\\n\\nN, D = map(int, input().split())\\nA = [int(x) for x in input().split()]\\n\\npresum = [0] * (N+1)\\n\\nfor i in range(1, N+1):\\n    presum[i] = presum[i-1] + A[i-1]\\n\\nrightmax = [0] * N\\nmx = float('-inf')\\nfor i in range(N-1, -1, -1):\\n    mx = max(mx, presum[i+1])\\n    rightmax[i] = mx\\n\\n# print(presum)\\n# print(rightmax)\\n\\nif any(v > D for v in presum):\\n    print(-1)\\n    return\\n\\nans = 0\\nadded = 0\\nfor i in range(N):\\n    if A[i] == 0:\\n        if presum[i+1] + added < 0:\\n            dmin = 0-presum[i+1]-added\\n            dmax = min(D-presum[i+1]-added, D-added-rightmax[i])\\n            if dmin > dmax:\\n                print(-1)\\n                return\\n\\n            added += dmax\\n            ans += 1\\nprint(ans)\", \"n, d = list(map(int, input().split()))\\na = [0] + list(map(int, input().split()))\\nb = [0] * (n + 2)\\nb[n] = a[n]\\nnow = a[n]\\nfor i in range(n - 1 , 0 , -1):\\n    now = a[i] + max(now, 0)\\n    b[i] = now\\nnow = 0\\nres = 0\\nfor i in range(1 , n + 1):\\n    if a[i] == 0:\\n        if now < 0:\\n            res += 1\\n            now = min(d, max(0, d - b[i + 1]))\\n    else:\\n        now += a[i]\\n        if now > d:\\n            res = -1\\n            break\\nprint(res)\\n\\n\\n\", \"f = lambda: map(int, input().split())\\nn, d = f()\\nh = s = k = 0\\nfor q in f():\\n    h, s = h + q, min(d, s + q)\\n    if h > d:\\n        k = -1\\n        break\\n    if q == 0:\\n        h = max(0, h)\\n        if s < 0: s, k = d, k + 1\\nprint(k)\", \"def main():\\n\\tn, d = map(int, input().split())\\n\\ta = list(map(int, input().split()))\\n\\t\\n\\tpref, mx, add, ans = [0] * n, [0] * n, 0, 0\\n\\n\\tfor pos in range(n):\\n\\t\\tpref[pos] = a[pos] if not pos else a[pos] + pref[pos-1]\\n\\n\\tfor pos in range(n-1, -1, -1):\\n\\t\\tmx[pos] = pref[pos] if pos == n - 1 else max(mx[pos + 1], pref[pos])\\n\\n\\tfor i in range(n):\\n\\t\\tif pref[i] + add > d:\\n\\t\\t\\tprint(\\\"-1\\\")\\n\\t\\t\\treturn\\n\\t\\tif a[i] == 0 and pref[i] + add < 0:\\n\\t\\t\\tans += 1\\n\\t\\t\\tadd += max(-(pref[i] + add), d - mx[i] - add)\\n\\tprint(ans)\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"[n, d] = [int(x) for x in input().split(' ')]\\nA = [int(a) for a in input().split(' ')]\\n\\ndef solve():\\n    ans = 0\\n    bal = 0\\n    minGap = 0\\n    for i in range(n):\\n        if A[i] == 0:\\n            if bal < 0:\\n                go = min(-bal, minGap)\\n                minGap -= go\\n                bal += go\\n                if bal < 0:\\n                    ans += 1\\n                    bal = 0\\n                    minGap = d\\n        else:\\n            bal += A[i]\\n            if bal > d:\\n                return -1\\n            minGap = min(minGap, d - bal)\\n    return ans\\n\\nprint(solve())\", \"n, d = list(map(int, input().split()))\\nl = list(map(int, input().split()))\\nmus = [0] * n\\nmus[0] = l[0]\\ncnt = 0\\nans = 0\\nfor i in range(1, n):\\n    mus[i] = mus[i - 1] +  l[i]\\nsuf = [0] * n\\nsuf[-1] = mus[-1]\\nfor i in range(n - 2, -1, -1):\\n    suf[i] = max(mus[i], suf[i + 1])\\nfor i in range(n):\\n    if l[i] == 0 and mus[i] + cnt < 0:\\n        if (d - suf[i] - cnt < 0 or d - suf[i] < abs(mus[i])):\\n            print(-1)\\n            return\\n        else:\\n            cnt += (d - suf[i]  - cnt)\\n            ans += 1\\nif suf[0] > d:\\n    print(-1)\\n    return\\nprint(ans)\", \"#Bhargey Mehta (Sophomore)\\n#DA-IICT, Gandhinagar\\nimport sys, math, queue, bisect\\n#sys.stdin = open(\\\"input.txt\\\", \\\"r\\\")\\nMOD = 10**9+7\\nsys.setrecursionlimit(1000000)\\n\\nn, d = map(int, input().split())\\na = list(map(int, input().split()))\\np = [0 for i in range(n)]\\nfor i in range(n):\\n    p[i] = p[i-1]+a[i]\\nmx = [-1 for i in range(n)]\\nmx[-1] = p[-1]\\nfor i in range(n-2, -1, -1):\\n    mx[i] = max(mx[i+1], p[i])\\nc = 0\\nans = 0\\nfor i in range(n):\\n    p[i] += c\\n    if p[i] > d:\\n        print(-1)\\n        return\\n    if a[i] != 0 or p[i] >= 0: continue\\n\\n    av = d-(mx[i]+c)\\n    if -p[i] > av:\\n        print(-1)\\n        return\\n    ans += 1\\n    c = d-mx[i]\\nprint(ans)\", \"import os\\nimport sys\\n\\ndef log(*args, **kwargs):\\n    if os.environ.get('CODEFR'):\\n        print(*args, **kwargs)\\n\\n\\n#n = int(input())\\nn, d = tuple(map(int,input().split()))\\na = list(map(int,input().split()))\\n\\ns = 0\\nk = 0\\ndep = 0\\nfor i in a:\\n    if i == 0:\\n        if s < 0:\\n            if dep < -s:\\n                k += 1\\n                dep = d\\n            else:\\n                dep += s\\n            s = 0\\n    else:\\n        s += i\\n        if s > d:\\n            print(-1)\\n            return\\n        dep = min(dep, d - s)\\n\\nprint(k)\\n\", \"R = lambda: map(int, input().split())\\nn, k = R()\\narr = list(R())\\ntup = [0, 0]\\nres = 0\\nfor x in arr:\\n    if x != 0:\\n        tup[0], tup[1] = tup[0] + x, tup[1] + x\\n        tup[1] = min(tup[1], k)\\n    elif tup[1] < 0:\\n        tup[0], tup[1] = 0, k\\n        res += 1\\n    else:\\n        tup[0] = max(0, tup[0])\\n    if tup[0] > k:\\n        res = -1\\n        break\\nprint(res)\", \"H,L,t=0,0,0\\nn,d=map(int,input().split())\\nfor i in map(int,input().split()):\\n    if i==0:\\n        if H<0:H=d;t+=1\\n        L=max(L,0)\\n    L+=i\\n    H=min(d,H+i)\\n    if L>d:print(-1);return()\\nprint(t)\", \"import sys\\ninput = sys.stdin.readline\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nans = 0\\nub, lb = 0, 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        if lb < 0:\\n            lb = 0\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\n\\nprint(ans)\\n\", \"n,d=list(map(int,input().split()))\\na=list(map(int,input().split()))\\ns=0\\nm=0\\nans=0 \\nflag=True\\nn=len(a)\\nfor i in range(n):\\n    if a[i]==0:\\n        if s<0:\\n            s=d\\n            m=d\\n            ans+=1\\n        else:\\n            m=min(m,s)\\n    elif a[i]<0:\\n        s=s+a[i] \\n    else:\\n        if(s+a[i]>d):\\n            if(s+a[i]-d)>m:\\n                flag=False\\n                break \\n            else:\\n                m-=(s+a[i]-d)\\n                s=d \\n        else:\\n            s=s+a[i] \\nif flag:\\n    print(ans)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn, d = list(map(int, input().split()))\\na = list(map(int, input().split()))\\nub, lb = 0, 0\\nans = 0\\n\\nfor x in a:\\n    if x == 0:\\n        if ub < 0:\\n            ub, lb = d, 0\\n            ans += 1\\n        lb = max(lb, 0)\\n    else:\\n        ub = min(d, ub+x)\\n        lb += x\\n        if lb > d:\\n            print(-1)\\n            return\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "6 4\n-1 0 2 -4 0 5\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/893/D"
    },
    {
        "id": 305,
        "task_id": 914,
        "test_case_id": 1,
        "question": "Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants to create a string s using stickers. She may buy as many sheets of stickers as she wants, and may specify any string of length n for the sheets, but all the sheets must be identical, so the string is the same for all sheets. Once she attains the sheets of stickers, she will take some of the stickers from the sheets and arrange (in any order) them to form s. Determine the minimum number of sheets she has to buy, and provide a string describing a possible sheet of stickers she should buy.\n\n\n-----Input-----\n\nThe first line contains string s (1 ≤ |s| ≤ 1000), consisting of lowercase English characters only. The second line contains an integer n (1 ≤ n ≤ 1000).\n\n\n-----Output-----\n\nOn the first line, print the minimum number of sheets Piegirl has to buy. On the second line, print a string consisting of n lower case English characters. This string should describe a sheet of stickers that Piegirl can buy in order to minimize the number of sheets. If Piegirl cannot possibly form the string s, print instead a single line with the number -1.\n\n\n-----Examples-----\nInput\nbanana\n4\n\nOutput\n2\nbaan\n\nInput\nbanana\n3\n\nOutput\n3\nnab\n\nInput\nbanana\n2\n\nOutput\n-1\n\n\n\n-----Note-----\n\nIn the second example, Piegirl can order 3 sheets of stickers with the characters \"nab\". She can take characters \"nab\" from the first sheet, \"na\" from the second, and \"a\" from the third, and arrange them to from \"banana\".",
        "solutions": "[\"from collections import Counter\\n\\ns = input()\\nn = int(input())\\n\\nd = Counter()\\n\\nfor c in s:\\n    d[c] += 1\\n\\nif len(d) > n:\\n    print(-1)\\nelse:\\n    left = 0\\n    right = 10**10\\n    s = \\\"\\\"\\n    lastok = (\\\"\\\", 0)\\n    while left + 1 < right:\\n        mid = (left + right) // 2\\n        s = \\\"\\\"\\n        for (c, cnt) in list(d.items()):\\n            cntnow = (cnt - 1) // mid + 1\\n            s += c * cntnow\\n        if len(s) < n:\\n            s += 'a' * (n - len(s))\\n        if len(s) == n:\\n            lastok = (s, mid)\\n            right = mid\\n        else:\\n            left = mid\\n    print(lastok[1])\\n    print(lastok[0])\\n\", \"s = input()\\nn = int(input())\\nfreq = [0 for i in range(0, 300)]\\nraport = [0 for i in range(0, 300)]\\ndifferentLetters = 0\\ntickets = 0\\nsol = ''\\n\\nfor c in s: freq[ord(c)] += 1\\nfor i in freq:\\n    if i > 0: differentLetters += 1\\n\\nif differentLetters > n:\\n    print('-1')\\n    return\\n\\nfor i in 'abcdefghijklmnopqrstuvwxyz':\\n    if freq[ord(i)] == 0: continue\\n    sol += i\\n    freq[ord(i)] -= 1\\n    raport[ord(i)] = freq[ord(i)]\\n\\n\\nfor i in range(differentLetters, n):\\n    #pun litera cu cea mai mare frecventa\\n\\n    maxRaport = raport[ord('z')]\\n    chosenLetter = 'z'\\n    for j in 'abcdefghijklmnopqrstuvwxyz':\\n        if raport[ord(j)] > maxRaport:\\n            maxRaport = raport[ord(j)]\\n            chosenLetter = j\\n\\n\\n    sol += chosenLetter\\n    raport[ord(chosenLetter)] = freq[ord(chosenLetter)] / sol.count(chosenLetter)\\n    \\n\\nfor i in sol:\\n    a = s.count(i)\\n    b = sol.count(i)\\n\\n    if a%b == 0: tickets = max(tickets, int(a//b))\\n    else: tickets = max(tickets, int(a//b) + 1)\\n\\nprint(tickets)\\nprint(sol)\\n        \\n\\n\\n\", \"import math\\nfrom fractions import Decimal\\nS=input()\\n\\nN=int(input())\\nSrep={}\\nansrep={}\\nfor item in \\\"abcdefghijklmnopqrstuvwxyz\\\":\\n    Srep[item]=0\\n    ansrep[item]=0\\n\\nfor item in S:\\n    Srep[item]+=1\\n    ansrep[item]+=1\\n\\nQ=list(set(S))\\n\\nif(len(Q)>N):\\n    print(-1)\\n\\nelse:\\n    n=len(Q)\\n    ans=list(S)\\n    num=1\\n    req=1\\n    n=len(ans)\\n    while(len(ans)>N):\\n        n=len(ans)\\n        minn=req+1005\\n        removal=ans[0]\\n        k=True\\n        for item in ans:\\n            if(ansrep[item]==1):\\n                continue\\n            if(math.ceil(Srep[item]/(ansrep[item]-1))>req):\\n                if(minn>math.ceil(Srep[item]/(ansrep[item]-1))):\\n                    minn=math.ceil(Srep[item]/(ansrep[item]-1))\\n                    removal=str(item)\\n                continue\\n            else:\\n                ansrep[item]-=1\\n                ans.remove(item)\\n                k=False\\n                break\\n        if(k):\\n            ansrep[removal]-=1\\n            req=math.ceil(Srep[removal]/ansrep[removal])\\n            ans.remove(removal)\\n    g=\\\"\\\"\\n    if(len(ans)<N):\\n        g=S[0]*(N-len(ans))\\n    print(req)\\n    for item in ans:\\n        print(item,end=\\\"\\\")\\n    print(g)\\n        \\n        \\n        \\n        \\n    \\n    \\n    \\n\\n\\n\", \"s = input()\\nn = int(input())\\n\\nsymb_cnt = {}\\nfor c in s:\\n\\tsymb_cnt[c] = symb_cnt[c] + 1 if c in symb_cnt else 1\\nfor cnt in range(1, len(s) + 1):\\n\\ts1 = \\\"\\\"\\n\\tfor c in symb_cnt:\\n\\t\\ts1 += c * ((symb_cnt[c] + cnt - 1) // cnt)\\n\\tif len(s1) <= n:\\n\\t\\tfor i in range(n - len(s1)):\\n\\t\\t\\ts1 += 'a'\\n\\t\\tprint(cnt)\\n\\t\\tprint(s1)\\n\\t\\treturn\\nprint(-1)\\n\", \"s = input()\\nn = int(input())\\n\\nd = {}\\nfor c in s:\\n    if c not in d: d[c] = 0\\n    d[c] += 1\\n    \\ndcl = list(d.values())\\n\\nfound = False\\nfor x in range(1,1001):\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n        found = True\\n        print(x)\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n        s += (n-len(s))*'a'\\n        print(s)\\n        break\\nif not found:\\n    print(-1)\\n\", \"from math import ceil\\np = {i: 0 for i in 'abcdefghijklmnopqrstuvwxyz'}\\nt = input()\\nfor i in t: p[i] += 1\\np = {i: p[i] for i in p if p[i] > 0}\\nn = int(input())\\nif len(p) > n: print(-1)\\nelif len(t) > n:\\n    r = [[p[i], p[i], 1, i] for i in p]\\n    for i in range(n - len(p)):\\n        j = max(r)\\n        j[2] += 1\\n        j[0] = j[1] / j[2]\\n    print(ceil(max(r)[0]))\\n    print(''.join(j[3] * j[2] for j in r))     \\nelse: print('1\\\\n' + t * (n // len(t)) + t[: n % len(t)])  \", \"from collections import Counter\\nfrom heapq import heappushpop\\n\\n\\ndef main():\\n    cnt, n = Counter(input()), int(input())\\n    if n < len(cnt):\\n        print(-1)\\n        return\\n    h = list((1 / v, 1, c) for c, v in cnt.most_common())\\n    res = list(cnt.keys())\\n    _, v, c = h.pop(0)\\n    for _ in range(n - len(cnt)):\\n        res.append(c)\\n        v += 1\\n        _, v, c = heappushpop(h, (v / cnt[c], v, c))\\n    print((cnt[c] + v - 1) // v)\\n    print(''.join(res))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\n\\nn = int(input())\\n\\n\\n\\nd = {}\\n\\nfor c in s:\\n\\n    if c not in d: d[c] = 0\\n\\n    d[c] += 1\\n\\n    \\n\\ndcl = list(d.values())\\n\\n\\n\\nfound = False\\n\\nfor x in range(1,1001):\\n\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n\\n        found = True\\n\\n        print(x)\\n\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n\\n        s += (n-len(s))*'a'\\n\\n        print(s)\\n\\n        break\\n\\nif not found:\\n\\n    print(-1)\\n\\n\", \"import sys\\nimport math\\nsys.setrecursionlimit(100000)\\n\\n#sys.stdin = open(\\\"INP.txt\\\", 'r')\\n# sys.stdout = open(\\\"OUT.txt\\\", 'w')\\n\\n\\ndef main():\\n    s = input()\\n    n = int(input())\\n    M = dict()\\n    for char in s:\\n        if char in M:\\n            M[char] += 1\\n        else:\\n            M[char] = 1\\n    if n < len(M):\\n        print(-1)\\n    else:\\n        l = 1\\n        r = len(s)\\n        while l != r:\\n            k = l+(r-l)//2\\n            smallest_n = 0\\n            for it in list(M.values()):\\n                tmp = math.ceil(it/k)\\n                smallest_n += tmp\\n            if smallest_n <= n:\\n                r = k\\n            else:\\n                l = k+1\\n        sticker = ''\\n        for char, occ in zip(list(M.keys()), list(M.values())):\\n            sticker += (char*math.ceil(occ/l))\\n\\n        if len(sticker) < n:\\n            sticker += (n-len(sticker))*list(M.keys())[0]\\n        print(\\\"{}\\\\n{}\\\".format(l, sticker))\\n\\n\\nmain()\\n\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n\\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"import math\\nfrom sys import stdin\\nfrom math import ceil\\n\\ndef __starting_point():\\n    s = input()\\n    n = int(input())\\n    dictionary = {}\\n\\n    for i in s:\\n        if i in dictionary:\\n            dictionary[i] = dictionary[i] + 1\\n        else:\\n            dictionary[i] = 1\\n\\n    if len(dictionary) > n:\\n        print(-1)\\n    else:\\n        if len(s) < n:\\n            print(1)\\n            newS = s\\n        else:\\n            lengthS = len(s) // n\\n            newLength = len(s)\\n            while lengthS < newLength:\\n                mid = (lengthS + newLength) // 2\\n                total = 0\\n                for i in dictionary:\\n                    total = total + ceil(dictionary[i] / mid)\\n                if total > n:\\n                    lengthS = mid + 1\\n                else:\\n                    newLength = mid\\n            print(lengthS)\\n            newS = ''\\n            for i in dictionary:\\n                for j in range(ceil(dictionary[i] / lengthS)):\\n                    newS = newS + i\\n        for i in range(n - len(newS)):\\n            newS = newS + s[0]\\n        print(newS)\\n\\n__starting_point()\", \"def check(mid):\\n    ans = []\\n    res = 0\\n    for c, count in d:\\n        tmp = count // mid\\n        if (count % mid != 0):\\n            tmp += 1\\n        ans.append((c, tmp))\\n        res += tmp\\n    return res <= n, ans\\n        \\n\\na = input()\\nn = int(input())\\nd = dict()\\nt = 0\\nfor i in a:\\n    if i not in d:\\n        d[i] = 1\\n        t += 1\\n    else: d[i] += 1\\nans = []\\nres = \\\"\\\"\\nfor i in d:\\n    ans.append(i)\\n    res = i\\nif n >= len(a):\\n    print(1)\\n    print(a, end = '')\\n    n -= len(a)\\n    for u in range(n):\\n        print(res, end ='')\\nelse:\\n    d = (sorted(d.items(), key = lambda d:(d[1], d[0])))\\n    l = 1\\n    r = len(a)\\n    res = []\\n    count_res = 0\\n    while (l <= r):\\n        mid = (l + r) // 2\\n        flag, tmp = check(mid)\\n        if (flag):\\n            r = mid - 1\\n            count_res = mid\\n            res = tmp\\n        else:\\n            l = mid + 1\\n        #print(l, r, tmp)\\n    if (len(res) == 0):\\n        print(-1)\\n    else:\\n        ttt = 0\\n        print(count_res)\\n        for c, sl in res:\\n            for j in range(sl):\\n                print(c, end = '')\\n                ttt += 1\\n        n -= ttt\\n        for i in range(n):\\n            print(a[0], end = '')\\n\\n \\n    \\n\\n\", \"s = input()\\nn = int(input())\\n\\nfrom collections import Counter\\nc = Counter(s)\\nout = Counter()\\ncontrib = Counter()\\n\\nfor letter in c:\\n    out[letter] = 1\\n    contrib[letter] = c[letter]\\n\\nsum_vals = sum(out.values())\\nfrom math import ceil\\nfrom fractions import Fraction\\n\\nif sum_vals > n:\\n    print(-1)\\nelse:\\n    while sum_vals < n:\\n        el, _ = contrib.most_common(1)[0]\\n        out[el] += 1\\n        sum_vals += 1\\n        contrib[el] = ceil(Fraction(c[el], out[el]))\\n\\n    print(max(contrib.values()))\\n    print(''.join(out.elements()))\\n        \\n    \\n    \\n\", \"s = input()\\nn = int(input())\\nd = {}\\nr = 0\\nfor a in s:\\n    d.setdefault(a, 0)\\n    d[a] += 1\\n    if(d[a] > r):\\n        r = d[a]\\nif (len(d) > n):\\n    print(-1)\\nelse:\\n    l = 0\\n    while r - l > 1:\\n        k = (l + r) // 2\\n        cur = 0\\n        for x in d.values():\\n            cur += (x+k-1) // k\\n        if cur > n:\\n            l = k\\n        else:\\n            r = k\\n    print(r)\\n    s = ''\\n    for a in d.keys():\\n        s += a * ((d[a] + r - 1) // r)\\n    l=len(s)\\n    s += 'a' * (n-len(s))\\n    print(s)\"]",
        "difficulty": "interview",
        "input": "banana\n4\n",
        "output": "2\nbaan\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/335/A"
    },
    {
        "id": 306,
        "task_id": 914,
        "test_case_id": 10,
        "question": "Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants to create a string s using stickers. She may buy as many sheets of stickers as she wants, and may specify any string of length n for the sheets, but all the sheets must be identical, so the string is the same for all sheets. Once she attains the sheets of stickers, she will take some of the stickers from the sheets and arrange (in any order) them to form s. Determine the minimum number of sheets she has to buy, and provide a string describing a possible sheet of stickers she should buy.\n\n\n-----Input-----\n\nThe first line contains string s (1 ≤ |s| ≤ 1000), consisting of lowercase English characters only. The second line contains an integer n (1 ≤ n ≤ 1000).\n\n\n-----Output-----\n\nOn the first line, print the minimum number of sheets Piegirl has to buy. On the second line, print a string consisting of n lower case English characters. This string should describe a sheet of stickers that Piegirl can buy in order to minimize the number of sheets. If Piegirl cannot possibly form the string s, print instead a single line with the number -1.\n\n\n-----Examples-----\nInput\nbanana\n4\n\nOutput\n2\nbaan\n\nInput\nbanana\n3\n\nOutput\n3\nnab\n\nInput\nbanana\n2\n\nOutput\n-1\n\n\n\n-----Note-----\n\nIn the second example, Piegirl can order 3 sheets of stickers with the characters \"nab\". She can take characters \"nab\" from the first sheet, \"na\" from the second, and \"a\" from the third, and arrange them to from \"banana\".",
        "solutions": "[\"from collections import Counter\\n\\ns = input()\\nn = int(input())\\n\\nd = Counter()\\n\\nfor c in s:\\n    d[c] += 1\\n\\nif len(d) > n:\\n    print(-1)\\nelse:\\n    left = 0\\n    right = 10**10\\n    s = \\\"\\\"\\n    lastok = (\\\"\\\", 0)\\n    while left + 1 < right:\\n        mid = (left + right) // 2\\n        s = \\\"\\\"\\n        for (c, cnt) in list(d.items()):\\n            cntnow = (cnt - 1) // mid + 1\\n            s += c * cntnow\\n        if len(s) < n:\\n            s += 'a' * (n - len(s))\\n        if len(s) == n:\\n            lastok = (s, mid)\\n            right = mid\\n        else:\\n            left = mid\\n    print(lastok[1])\\n    print(lastok[0])\\n\", \"s = input()\\nn = int(input())\\nfreq = [0 for i in range(0, 300)]\\nraport = [0 for i in range(0, 300)]\\ndifferentLetters = 0\\ntickets = 0\\nsol = ''\\n\\nfor c in s: freq[ord(c)] += 1\\nfor i in freq:\\n    if i > 0: differentLetters += 1\\n\\nif differentLetters > n:\\n    print('-1')\\n    return\\n\\nfor i in 'abcdefghijklmnopqrstuvwxyz':\\n    if freq[ord(i)] == 0: continue\\n    sol += i\\n    freq[ord(i)] -= 1\\n    raport[ord(i)] = freq[ord(i)]\\n\\n\\nfor i in range(differentLetters, n):\\n    #pun litera cu cea mai mare frecventa\\n\\n    maxRaport = raport[ord('z')]\\n    chosenLetter = 'z'\\n    for j in 'abcdefghijklmnopqrstuvwxyz':\\n        if raport[ord(j)] > maxRaport:\\n            maxRaport = raport[ord(j)]\\n            chosenLetter = j\\n\\n\\n    sol += chosenLetter\\n    raport[ord(chosenLetter)] = freq[ord(chosenLetter)] / sol.count(chosenLetter)\\n    \\n\\nfor i in sol:\\n    a = s.count(i)\\n    b = sol.count(i)\\n\\n    if a%b == 0: tickets = max(tickets, int(a//b))\\n    else: tickets = max(tickets, int(a//b) + 1)\\n\\nprint(tickets)\\nprint(sol)\\n        \\n\\n\\n\", \"import math\\nfrom fractions import Decimal\\nS=input()\\n\\nN=int(input())\\nSrep={}\\nansrep={}\\nfor item in \\\"abcdefghijklmnopqrstuvwxyz\\\":\\n    Srep[item]=0\\n    ansrep[item]=0\\n\\nfor item in S:\\n    Srep[item]+=1\\n    ansrep[item]+=1\\n\\nQ=list(set(S))\\n\\nif(len(Q)>N):\\n    print(-1)\\n\\nelse:\\n    n=len(Q)\\n    ans=list(S)\\n    num=1\\n    req=1\\n    n=len(ans)\\n    while(len(ans)>N):\\n        n=len(ans)\\n        minn=req+1005\\n        removal=ans[0]\\n        k=True\\n        for item in ans:\\n            if(ansrep[item]==1):\\n                continue\\n            if(math.ceil(Srep[item]/(ansrep[item]-1))>req):\\n                if(minn>math.ceil(Srep[item]/(ansrep[item]-1))):\\n                    minn=math.ceil(Srep[item]/(ansrep[item]-1))\\n                    removal=str(item)\\n                continue\\n            else:\\n                ansrep[item]-=1\\n                ans.remove(item)\\n                k=False\\n                break\\n        if(k):\\n            ansrep[removal]-=1\\n            req=math.ceil(Srep[removal]/ansrep[removal])\\n            ans.remove(removal)\\n    g=\\\"\\\"\\n    if(len(ans)<N):\\n        g=S[0]*(N-len(ans))\\n    print(req)\\n    for item in ans:\\n        print(item,end=\\\"\\\")\\n    print(g)\\n        \\n        \\n        \\n        \\n    \\n    \\n    \\n\\n\\n\", \"s = input()\\nn = int(input())\\n\\nsymb_cnt = {}\\nfor c in s:\\n\\tsymb_cnt[c] = symb_cnt[c] + 1 if c in symb_cnt else 1\\nfor cnt in range(1, len(s) + 1):\\n\\ts1 = \\\"\\\"\\n\\tfor c in symb_cnt:\\n\\t\\ts1 += c * ((symb_cnt[c] + cnt - 1) // cnt)\\n\\tif len(s1) <= n:\\n\\t\\tfor i in range(n - len(s1)):\\n\\t\\t\\ts1 += 'a'\\n\\t\\tprint(cnt)\\n\\t\\tprint(s1)\\n\\t\\treturn\\nprint(-1)\\n\", \"s = input()\\nn = int(input())\\n\\nd = {}\\nfor c in s:\\n    if c not in d: d[c] = 0\\n    d[c] += 1\\n    \\ndcl = list(d.values())\\n\\nfound = False\\nfor x in range(1,1001):\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n        found = True\\n        print(x)\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n        s += (n-len(s))*'a'\\n        print(s)\\n        break\\nif not found:\\n    print(-1)\\n\", \"from math import ceil\\np = {i: 0 for i in 'abcdefghijklmnopqrstuvwxyz'}\\nt = input()\\nfor i in t: p[i] += 1\\np = {i: p[i] for i in p if p[i] > 0}\\nn = int(input())\\nif len(p) > n: print(-1)\\nelif len(t) > n:\\n    r = [[p[i], p[i], 1, i] for i in p]\\n    for i in range(n - len(p)):\\n        j = max(r)\\n        j[2] += 1\\n        j[0] = j[1] / j[2]\\n    print(ceil(max(r)[0]))\\n    print(''.join(j[3] * j[2] for j in r))     \\nelse: print('1\\\\n' + t * (n // len(t)) + t[: n % len(t)])  \", \"from collections import Counter\\nfrom heapq import heappushpop\\n\\n\\ndef main():\\n    cnt, n = Counter(input()), int(input())\\n    if n < len(cnt):\\n        print(-1)\\n        return\\n    h = list((1 / v, 1, c) for c, v in cnt.most_common())\\n    res = list(cnt.keys())\\n    _, v, c = h.pop(0)\\n    for _ in range(n - len(cnt)):\\n        res.append(c)\\n        v += 1\\n        _, v, c = heappushpop(h, (v / cnt[c], v, c))\\n    print((cnt[c] + v - 1) // v)\\n    print(''.join(res))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\n\\nn = int(input())\\n\\n\\n\\nd = {}\\n\\nfor c in s:\\n\\n    if c not in d: d[c] = 0\\n\\n    d[c] += 1\\n\\n    \\n\\ndcl = list(d.values())\\n\\n\\n\\nfound = False\\n\\nfor x in range(1,1001):\\n\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n\\n        found = True\\n\\n        print(x)\\n\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n\\n        s += (n-len(s))*'a'\\n\\n        print(s)\\n\\n        break\\n\\nif not found:\\n\\n    print(-1)\\n\\n\", \"import sys\\nimport math\\nsys.setrecursionlimit(100000)\\n\\n#sys.stdin = open(\\\"INP.txt\\\", 'r')\\n# sys.stdout = open(\\\"OUT.txt\\\", 'w')\\n\\n\\ndef main():\\n    s = input()\\n    n = int(input())\\n    M = dict()\\n    for char in s:\\n        if char in M:\\n            M[char] += 1\\n        else:\\n            M[char] = 1\\n    if n < len(M):\\n        print(-1)\\n    else:\\n        l = 1\\n        r = len(s)\\n        while l != r:\\n            k = l+(r-l)//2\\n            smallest_n = 0\\n            for it in list(M.values()):\\n                tmp = math.ceil(it/k)\\n                smallest_n += tmp\\n            if smallest_n <= n:\\n                r = k\\n            else:\\n                l = k+1\\n        sticker = ''\\n        for char, occ in zip(list(M.keys()), list(M.values())):\\n            sticker += (char*math.ceil(occ/l))\\n\\n        if len(sticker) < n:\\n            sticker += (n-len(sticker))*list(M.keys())[0]\\n        print(\\\"{}\\\\n{}\\\".format(l, sticker))\\n\\n\\nmain()\\n\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n\\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"import math\\nfrom sys import stdin\\nfrom math import ceil\\n\\ndef __starting_point():\\n    s = input()\\n    n = int(input())\\n    dictionary = {}\\n\\n    for i in s:\\n        if i in dictionary:\\n            dictionary[i] = dictionary[i] + 1\\n        else:\\n            dictionary[i] = 1\\n\\n    if len(dictionary) > n:\\n        print(-1)\\n    else:\\n        if len(s) < n:\\n            print(1)\\n            newS = s\\n        else:\\n            lengthS = len(s) // n\\n            newLength = len(s)\\n            while lengthS < newLength:\\n                mid = (lengthS + newLength) // 2\\n                total = 0\\n                for i in dictionary:\\n                    total = total + ceil(dictionary[i] / mid)\\n                if total > n:\\n                    lengthS = mid + 1\\n                else:\\n                    newLength = mid\\n            print(lengthS)\\n            newS = ''\\n            for i in dictionary:\\n                for j in range(ceil(dictionary[i] / lengthS)):\\n                    newS = newS + i\\n        for i in range(n - len(newS)):\\n            newS = newS + s[0]\\n        print(newS)\\n\\n__starting_point()\", \"def check(mid):\\n    ans = []\\n    res = 0\\n    for c, count in d:\\n        tmp = count // mid\\n        if (count % mid != 0):\\n            tmp += 1\\n        ans.append((c, tmp))\\n        res += tmp\\n    return res <= n, ans\\n        \\n\\na = input()\\nn = int(input())\\nd = dict()\\nt = 0\\nfor i in a:\\n    if i not in d:\\n        d[i] = 1\\n        t += 1\\n    else: d[i] += 1\\nans = []\\nres = \\\"\\\"\\nfor i in d:\\n    ans.append(i)\\n    res = i\\nif n >= len(a):\\n    print(1)\\n    print(a, end = '')\\n    n -= len(a)\\n    for u in range(n):\\n        print(res, end ='')\\nelse:\\n    d = (sorted(d.items(), key = lambda d:(d[1], d[0])))\\n    l = 1\\n    r = len(a)\\n    res = []\\n    count_res = 0\\n    while (l <= r):\\n        mid = (l + r) // 2\\n        flag, tmp = check(mid)\\n        if (flag):\\n            r = mid - 1\\n            count_res = mid\\n            res = tmp\\n        else:\\n            l = mid + 1\\n        #print(l, r, tmp)\\n    if (len(res) == 0):\\n        print(-1)\\n    else:\\n        ttt = 0\\n        print(count_res)\\n        for c, sl in res:\\n            for j in range(sl):\\n                print(c, end = '')\\n                ttt += 1\\n        n -= ttt\\n        for i in range(n):\\n            print(a[0], end = '')\\n\\n \\n    \\n\\n\", \"s = input()\\nn = int(input())\\n\\nfrom collections import Counter\\nc = Counter(s)\\nout = Counter()\\ncontrib = Counter()\\n\\nfor letter in c:\\n    out[letter] = 1\\n    contrib[letter] = c[letter]\\n\\nsum_vals = sum(out.values())\\nfrom math import ceil\\nfrom fractions import Fraction\\n\\nif sum_vals > n:\\n    print(-1)\\nelse:\\n    while sum_vals < n:\\n        el, _ = contrib.most_common(1)[0]\\n        out[el] += 1\\n        sum_vals += 1\\n        contrib[el] = ceil(Fraction(c[el], out[el]))\\n\\n    print(max(contrib.values()))\\n    print(''.join(out.elements()))\\n        \\n    \\n    \\n\", \"s = input()\\nn = int(input())\\nd = {}\\nr = 0\\nfor a in s:\\n    d.setdefault(a, 0)\\n    d[a] += 1\\n    if(d[a] > r):\\n        r = d[a]\\nif (len(d) > n):\\n    print(-1)\\nelse:\\n    l = 0\\n    while r - l > 1:\\n        k = (l + r) // 2\\n        cur = 0\\n        for x in d.values():\\n            cur += (x+k-1) // k\\n        if cur > n:\\n            l = k\\n        else:\\n            r = k\\n    print(r)\\n    s = ''\\n    for a in d.keys():\\n        s += a * ((d[a] + r - 1) // r)\\n    l=len(s)\\n    s += 'a' * (n-len(s))\\n    print(s)\"]",
        "difficulty": "interview",
        "input": "baba\n3\n",
        "output": "2\naba\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/335/A"
    },
    {
        "id": 307,
        "task_id": 914,
        "test_case_id": 12,
        "question": "Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants to create a string s using stickers. She may buy as many sheets of stickers as she wants, and may specify any string of length n for the sheets, but all the sheets must be identical, so the string is the same for all sheets. Once she attains the sheets of stickers, she will take some of the stickers from the sheets and arrange (in any order) them to form s. Determine the minimum number of sheets she has to buy, and provide a string describing a possible sheet of stickers she should buy.\n\n\n-----Input-----\n\nThe first line contains string s (1 ≤ |s| ≤ 1000), consisting of lowercase English characters only. The second line contains an integer n (1 ≤ n ≤ 1000).\n\n\n-----Output-----\n\nOn the first line, print the minimum number of sheets Piegirl has to buy. On the second line, print a string consisting of n lower case English characters. This string should describe a sheet of stickers that Piegirl can buy in order to minimize the number of sheets. If Piegirl cannot possibly form the string s, print instead a single line with the number -1.\n\n\n-----Examples-----\nInput\nbanana\n4\n\nOutput\n2\nbaan\n\nInput\nbanana\n3\n\nOutput\n3\nnab\n\nInput\nbanana\n2\n\nOutput\n-1\n\n\n\n-----Note-----\n\nIn the second example, Piegirl can order 3 sheets of stickers with the characters \"nab\". She can take characters \"nab\" from the first sheet, \"na\" from the second, and \"a\" from the third, and arrange them to from \"banana\".",
        "solutions": "[\"from collections import Counter\\n\\ns = input()\\nn = int(input())\\n\\nd = Counter()\\n\\nfor c in s:\\n    d[c] += 1\\n\\nif len(d) > n:\\n    print(-1)\\nelse:\\n    left = 0\\n    right = 10**10\\n    s = \\\"\\\"\\n    lastok = (\\\"\\\", 0)\\n    while left + 1 < right:\\n        mid = (left + right) // 2\\n        s = \\\"\\\"\\n        for (c, cnt) in list(d.items()):\\n            cntnow = (cnt - 1) // mid + 1\\n            s += c * cntnow\\n        if len(s) < n:\\n            s += 'a' * (n - len(s))\\n        if len(s) == n:\\n            lastok = (s, mid)\\n            right = mid\\n        else:\\n            left = mid\\n    print(lastok[1])\\n    print(lastok[0])\\n\", \"s = input()\\nn = int(input())\\nfreq = [0 for i in range(0, 300)]\\nraport = [0 for i in range(0, 300)]\\ndifferentLetters = 0\\ntickets = 0\\nsol = ''\\n\\nfor c in s: freq[ord(c)] += 1\\nfor i in freq:\\n    if i > 0: differentLetters += 1\\n\\nif differentLetters > n:\\n    print('-1')\\n    return\\n\\nfor i in 'abcdefghijklmnopqrstuvwxyz':\\n    if freq[ord(i)] == 0: continue\\n    sol += i\\n    freq[ord(i)] -= 1\\n    raport[ord(i)] = freq[ord(i)]\\n\\n\\nfor i in range(differentLetters, n):\\n    #pun litera cu cea mai mare frecventa\\n\\n    maxRaport = raport[ord('z')]\\n    chosenLetter = 'z'\\n    for j in 'abcdefghijklmnopqrstuvwxyz':\\n        if raport[ord(j)] > maxRaport:\\n            maxRaport = raport[ord(j)]\\n            chosenLetter = j\\n\\n\\n    sol += chosenLetter\\n    raport[ord(chosenLetter)] = freq[ord(chosenLetter)] / sol.count(chosenLetter)\\n    \\n\\nfor i in sol:\\n    a = s.count(i)\\n    b = sol.count(i)\\n\\n    if a%b == 0: tickets = max(tickets, int(a//b))\\n    else: tickets = max(tickets, int(a//b) + 1)\\n\\nprint(tickets)\\nprint(sol)\\n        \\n\\n\\n\", \"import math\\nfrom fractions import Decimal\\nS=input()\\n\\nN=int(input())\\nSrep={}\\nansrep={}\\nfor item in \\\"abcdefghijklmnopqrstuvwxyz\\\":\\n    Srep[item]=0\\n    ansrep[item]=0\\n\\nfor item in S:\\n    Srep[item]+=1\\n    ansrep[item]+=1\\n\\nQ=list(set(S))\\n\\nif(len(Q)>N):\\n    print(-1)\\n\\nelse:\\n    n=len(Q)\\n    ans=list(S)\\n    num=1\\n    req=1\\n    n=len(ans)\\n    while(len(ans)>N):\\n        n=len(ans)\\n        minn=req+1005\\n        removal=ans[0]\\n        k=True\\n        for item in ans:\\n            if(ansrep[item]==1):\\n                continue\\n            if(math.ceil(Srep[item]/(ansrep[item]-1))>req):\\n                if(minn>math.ceil(Srep[item]/(ansrep[item]-1))):\\n                    minn=math.ceil(Srep[item]/(ansrep[item]-1))\\n                    removal=str(item)\\n                continue\\n            else:\\n                ansrep[item]-=1\\n                ans.remove(item)\\n                k=False\\n                break\\n        if(k):\\n            ansrep[removal]-=1\\n            req=math.ceil(Srep[removal]/ansrep[removal])\\n            ans.remove(removal)\\n    g=\\\"\\\"\\n    if(len(ans)<N):\\n        g=S[0]*(N-len(ans))\\n    print(req)\\n    for item in ans:\\n        print(item,end=\\\"\\\")\\n    print(g)\\n        \\n        \\n        \\n        \\n    \\n    \\n    \\n\\n\\n\", \"s = input()\\nn = int(input())\\n\\nsymb_cnt = {}\\nfor c in s:\\n\\tsymb_cnt[c] = symb_cnt[c] + 1 if c in symb_cnt else 1\\nfor cnt in range(1, len(s) + 1):\\n\\ts1 = \\\"\\\"\\n\\tfor c in symb_cnt:\\n\\t\\ts1 += c * ((symb_cnt[c] + cnt - 1) // cnt)\\n\\tif len(s1) <= n:\\n\\t\\tfor i in range(n - len(s1)):\\n\\t\\t\\ts1 += 'a'\\n\\t\\tprint(cnt)\\n\\t\\tprint(s1)\\n\\t\\treturn\\nprint(-1)\\n\", \"s = input()\\nn = int(input())\\n\\nd = {}\\nfor c in s:\\n    if c not in d: d[c] = 0\\n    d[c] += 1\\n    \\ndcl = list(d.values())\\n\\nfound = False\\nfor x in range(1,1001):\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n        found = True\\n        print(x)\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n        s += (n-len(s))*'a'\\n        print(s)\\n        break\\nif not found:\\n    print(-1)\\n\", \"from math import ceil\\np = {i: 0 for i in 'abcdefghijklmnopqrstuvwxyz'}\\nt = input()\\nfor i in t: p[i] += 1\\np = {i: p[i] for i in p if p[i] > 0}\\nn = int(input())\\nif len(p) > n: print(-1)\\nelif len(t) > n:\\n    r = [[p[i], p[i], 1, i] for i in p]\\n    for i in range(n - len(p)):\\n        j = max(r)\\n        j[2] += 1\\n        j[0] = j[1] / j[2]\\n    print(ceil(max(r)[0]))\\n    print(''.join(j[3] * j[2] for j in r))     \\nelse: print('1\\\\n' + t * (n // len(t)) + t[: n % len(t)])  \", \"from collections import Counter\\nfrom heapq import heappushpop\\n\\n\\ndef main():\\n    cnt, n = Counter(input()), int(input())\\n    if n < len(cnt):\\n        print(-1)\\n        return\\n    h = list((1 / v, 1, c) for c, v in cnt.most_common())\\n    res = list(cnt.keys())\\n    _, v, c = h.pop(0)\\n    for _ in range(n - len(cnt)):\\n        res.append(c)\\n        v += 1\\n        _, v, c = heappushpop(h, (v / cnt[c], v, c))\\n    print((cnt[c] + v - 1) // v)\\n    print(''.join(res))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\n\\nn = int(input())\\n\\n\\n\\nd = {}\\n\\nfor c in s:\\n\\n    if c not in d: d[c] = 0\\n\\n    d[c] += 1\\n\\n    \\n\\ndcl = list(d.values())\\n\\n\\n\\nfound = False\\n\\nfor x in range(1,1001):\\n\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n\\n        found = True\\n\\n        print(x)\\n\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n\\n        s += (n-len(s))*'a'\\n\\n        print(s)\\n\\n        break\\n\\nif not found:\\n\\n    print(-1)\\n\\n\", \"import sys\\nimport math\\nsys.setrecursionlimit(100000)\\n\\n#sys.stdin = open(\\\"INP.txt\\\", 'r')\\n# sys.stdout = open(\\\"OUT.txt\\\", 'w')\\n\\n\\ndef main():\\n    s = input()\\n    n = int(input())\\n    M = dict()\\n    for char in s:\\n        if char in M:\\n            M[char] += 1\\n        else:\\n            M[char] = 1\\n    if n < len(M):\\n        print(-1)\\n    else:\\n        l = 1\\n        r = len(s)\\n        while l != r:\\n            k = l+(r-l)//2\\n            smallest_n = 0\\n            for it in list(M.values()):\\n                tmp = math.ceil(it/k)\\n                smallest_n += tmp\\n            if smallest_n <= n:\\n                r = k\\n            else:\\n                l = k+1\\n        sticker = ''\\n        for char, occ in zip(list(M.keys()), list(M.values())):\\n            sticker += (char*math.ceil(occ/l))\\n\\n        if len(sticker) < n:\\n            sticker += (n-len(sticker))*list(M.keys())[0]\\n        print(\\\"{}\\\\n{}\\\".format(l, sticker))\\n\\n\\nmain()\\n\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n\\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"import math\\nfrom sys import stdin\\nfrom math import ceil\\n\\ndef __starting_point():\\n    s = input()\\n    n = int(input())\\n    dictionary = {}\\n\\n    for i in s:\\n        if i in dictionary:\\n            dictionary[i] = dictionary[i] + 1\\n        else:\\n            dictionary[i] = 1\\n\\n    if len(dictionary) > n:\\n        print(-1)\\n    else:\\n        if len(s) < n:\\n            print(1)\\n            newS = s\\n        else:\\n            lengthS = len(s) // n\\n            newLength = len(s)\\n            while lengthS < newLength:\\n                mid = (lengthS + newLength) // 2\\n                total = 0\\n                for i in dictionary:\\n                    total = total + ceil(dictionary[i] / mid)\\n                if total > n:\\n                    lengthS = mid + 1\\n                else:\\n                    newLength = mid\\n            print(lengthS)\\n            newS = ''\\n            for i in dictionary:\\n                for j in range(ceil(dictionary[i] / lengthS)):\\n                    newS = newS + i\\n        for i in range(n - len(newS)):\\n            newS = newS + s[0]\\n        print(newS)\\n\\n__starting_point()\", \"def check(mid):\\n    ans = []\\n    res = 0\\n    for c, count in d:\\n        tmp = count // mid\\n        if (count % mid != 0):\\n            tmp += 1\\n        ans.append((c, tmp))\\n        res += tmp\\n    return res <= n, ans\\n        \\n\\na = input()\\nn = int(input())\\nd = dict()\\nt = 0\\nfor i in a:\\n    if i not in d:\\n        d[i] = 1\\n        t += 1\\n    else: d[i] += 1\\nans = []\\nres = \\\"\\\"\\nfor i in d:\\n    ans.append(i)\\n    res = i\\nif n >= len(a):\\n    print(1)\\n    print(a, end = '')\\n    n -= len(a)\\n    for u in range(n):\\n        print(res, end ='')\\nelse:\\n    d = (sorted(d.items(), key = lambda d:(d[1], d[0])))\\n    l = 1\\n    r = len(a)\\n    res = []\\n    count_res = 0\\n    while (l <= r):\\n        mid = (l + r) // 2\\n        flag, tmp = check(mid)\\n        if (flag):\\n            r = mid - 1\\n            count_res = mid\\n            res = tmp\\n        else:\\n            l = mid + 1\\n        #print(l, r, tmp)\\n    if (len(res) == 0):\\n        print(-1)\\n    else:\\n        ttt = 0\\n        print(count_res)\\n        for c, sl in res:\\n            for j in range(sl):\\n                print(c, end = '')\\n                ttt += 1\\n        n -= ttt\\n        for i in range(n):\\n            print(a[0], end = '')\\n\\n \\n    \\n\\n\", \"s = input()\\nn = int(input())\\n\\nfrom collections import Counter\\nc = Counter(s)\\nout = Counter()\\ncontrib = Counter()\\n\\nfor letter in c:\\n    out[letter] = 1\\n    contrib[letter] = c[letter]\\n\\nsum_vals = sum(out.values())\\nfrom math import ceil\\nfrom fractions import Fraction\\n\\nif sum_vals > n:\\n    print(-1)\\nelse:\\n    while sum_vals < n:\\n        el, _ = contrib.most_common(1)[0]\\n        out[el] += 1\\n        sum_vals += 1\\n        contrib[el] = ceil(Fraction(c[el], out[el]))\\n\\n    print(max(contrib.values()))\\n    print(''.join(out.elements()))\\n        \\n    \\n    \\n\", \"s = input()\\nn = int(input())\\nd = {}\\nr = 0\\nfor a in s:\\n    d.setdefault(a, 0)\\n    d[a] += 1\\n    if(d[a] > r):\\n        r = d[a]\\nif (len(d) > n):\\n    print(-1)\\nelse:\\n    l = 0\\n    while r - l > 1:\\n        k = (l + r) // 2\\n        cur = 0\\n        for x in d.values():\\n            cur += (x+k-1) // k\\n        if cur > n:\\n            l = k\\n        else:\\n            r = k\\n    print(r)\\n    s = ''\\n    for a in d.keys():\\n        s += a * ((d[a] + r - 1) // r)\\n    l=len(s)\\n    s += 'a' * (n-len(s))\\n    print(s)\"]",
        "difficulty": "interview",
        "input": "banana\n5\n",
        "output": "2\naabna\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/335/A"
    },
    {
        "id": 308,
        "task_id": 914,
        "test_case_id": 24,
        "question": "Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants to create a string s using stickers. She may buy as many sheets of stickers as she wants, and may specify any string of length n for the sheets, but all the sheets must be identical, so the string is the same for all sheets. Once she attains the sheets of stickers, she will take some of the stickers from the sheets and arrange (in any order) them to form s. Determine the minimum number of sheets she has to buy, and provide a string describing a possible sheet of stickers she should buy.\n\n\n-----Input-----\n\nThe first line contains string s (1 ≤ |s| ≤ 1000), consisting of lowercase English characters only. The second line contains an integer n (1 ≤ n ≤ 1000).\n\n\n-----Output-----\n\nOn the first line, print the minimum number of sheets Piegirl has to buy. On the second line, print a string consisting of n lower case English characters. This string should describe a sheet of stickers that Piegirl can buy in order to minimize the number of sheets. If Piegirl cannot possibly form the string s, print instead a single line with the number -1.\n\n\n-----Examples-----\nInput\nbanana\n4\n\nOutput\n2\nbaan\n\nInput\nbanana\n3\n\nOutput\n3\nnab\n\nInput\nbanana\n2\n\nOutput\n-1\n\n\n\n-----Note-----\n\nIn the second example, Piegirl can order 3 sheets of stickers with the characters \"nab\". She can take characters \"nab\" from the first sheet, \"na\" from the second, and \"a\" from the third, and arrange them to from \"banana\".",
        "solutions": "[\"from collections import Counter\\n\\ns = input()\\nn = int(input())\\n\\nd = Counter()\\n\\nfor c in s:\\n    d[c] += 1\\n\\nif len(d) > n:\\n    print(-1)\\nelse:\\n    left = 0\\n    right = 10**10\\n    s = \\\"\\\"\\n    lastok = (\\\"\\\", 0)\\n    while left + 1 < right:\\n        mid = (left + right) // 2\\n        s = \\\"\\\"\\n        for (c, cnt) in list(d.items()):\\n            cntnow = (cnt - 1) // mid + 1\\n            s += c * cntnow\\n        if len(s) < n:\\n            s += 'a' * (n - len(s))\\n        if len(s) == n:\\n            lastok = (s, mid)\\n            right = mid\\n        else:\\n            left = mid\\n    print(lastok[1])\\n    print(lastok[0])\\n\", \"s = input()\\nn = int(input())\\nfreq = [0 for i in range(0, 300)]\\nraport = [0 for i in range(0, 300)]\\ndifferentLetters = 0\\ntickets = 0\\nsol = ''\\n\\nfor c in s: freq[ord(c)] += 1\\nfor i in freq:\\n    if i > 0: differentLetters += 1\\n\\nif differentLetters > n:\\n    print('-1')\\n    return\\n\\nfor i in 'abcdefghijklmnopqrstuvwxyz':\\n    if freq[ord(i)] == 0: continue\\n    sol += i\\n    freq[ord(i)] -= 1\\n    raport[ord(i)] = freq[ord(i)]\\n\\n\\nfor i in range(differentLetters, n):\\n    #pun litera cu cea mai mare frecventa\\n\\n    maxRaport = raport[ord('z')]\\n    chosenLetter = 'z'\\n    for j in 'abcdefghijklmnopqrstuvwxyz':\\n        if raport[ord(j)] > maxRaport:\\n            maxRaport = raport[ord(j)]\\n            chosenLetter = j\\n\\n\\n    sol += chosenLetter\\n    raport[ord(chosenLetter)] = freq[ord(chosenLetter)] / sol.count(chosenLetter)\\n    \\n\\nfor i in sol:\\n    a = s.count(i)\\n    b = sol.count(i)\\n\\n    if a%b == 0: tickets = max(tickets, int(a//b))\\n    else: tickets = max(tickets, int(a//b) + 1)\\n\\nprint(tickets)\\nprint(sol)\\n        \\n\\n\\n\", \"import math\\nfrom fractions import Decimal\\nS=input()\\n\\nN=int(input())\\nSrep={}\\nansrep={}\\nfor item in \\\"abcdefghijklmnopqrstuvwxyz\\\":\\n    Srep[item]=0\\n    ansrep[item]=0\\n\\nfor item in S:\\n    Srep[item]+=1\\n    ansrep[item]+=1\\n\\nQ=list(set(S))\\n\\nif(len(Q)>N):\\n    print(-1)\\n\\nelse:\\n    n=len(Q)\\n    ans=list(S)\\n    num=1\\n    req=1\\n    n=len(ans)\\n    while(len(ans)>N):\\n        n=len(ans)\\n        minn=req+1005\\n        removal=ans[0]\\n        k=True\\n        for item in ans:\\n            if(ansrep[item]==1):\\n                continue\\n            if(math.ceil(Srep[item]/(ansrep[item]-1))>req):\\n                if(minn>math.ceil(Srep[item]/(ansrep[item]-1))):\\n                    minn=math.ceil(Srep[item]/(ansrep[item]-1))\\n                    removal=str(item)\\n                continue\\n            else:\\n                ansrep[item]-=1\\n                ans.remove(item)\\n                k=False\\n                break\\n        if(k):\\n            ansrep[removal]-=1\\n            req=math.ceil(Srep[removal]/ansrep[removal])\\n            ans.remove(removal)\\n    g=\\\"\\\"\\n    if(len(ans)<N):\\n        g=S[0]*(N-len(ans))\\n    print(req)\\n    for item in ans:\\n        print(item,end=\\\"\\\")\\n    print(g)\\n        \\n        \\n        \\n        \\n    \\n    \\n    \\n\\n\\n\", \"s = input()\\nn = int(input())\\n\\nsymb_cnt = {}\\nfor c in s:\\n\\tsymb_cnt[c] = symb_cnt[c] + 1 if c in symb_cnt else 1\\nfor cnt in range(1, len(s) + 1):\\n\\ts1 = \\\"\\\"\\n\\tfor c in symb_cnt:\\n\\t\\ts1 += c * ((symb_cnt[c] + cnt - 1) // cnt)\\n\\tif len(s1) <= n:\\n\\t\\tfor i in range(n - len(s1)):\\n\\t\\t\\ts1 += 'a'\\n\\t\\tprint(cnt)\\n\\t\\tprint(s1)\\n\\t\\treturn\\nprint(-1)\\n\", \"s = input()\\nn = int(input())\\n\\nd = {}\\nfor c in s:\\n    if c not in d: d[c] = 0\\n    d[c] += 1\\n    \\ndcl = list(d.values())\\n\\nfound = False\\nfor x in range(1,1001):\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n        found = True\\n        print(x)\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n        s += (n-len(s))*'a'\\n        print(s)\\n        break\\nif not found:\\n    print(-1)\\n\", \"from math import ceil\\np = {i: 0 for i in 'abcdefghijklmnopqrstuvwxyz'}\\nt = input()\\nfor i in t: p[i] += 1\\np = {i: p[i] for i in p if p[i] > 0}\\nn = int(input())\\nif len(p) > n: print(-1)\\nelif len(t) > n:\\n    r = [[p[i], p[i], 1, i] for i in p]\\n    for i in range(n - len(p)):\\n        j = max(r)\\n        j[2] += 1\\n        j[0] = j[1] / j[2]\\n    print(ceil(max(r)[0]))\\n    print(''.join(j[3] * j[2] for j in r))     \\nelse: print('1\\\\n' + t * (n // len(t)) + t[: n % len(t)])  \", \"from collections import Counter\\nfrom heapq import heappushpop\\n\\n\\ndef main():\\n    cnt, n = Counter(input()), int(input())\\n    if n < len(cnt):\\n        print(-1)\\n        return\\n    h = list((1 / v, 1, c) for c, v in cnt.most_common())\\n    res = list(cnt.keys())\\n    _, v, c = h.pop(0)\\n    for _ in range(n - len(cnt)):\\n        res.append(c)\\n        v += 1\\n        _, v, c = heappushpop(h, (v / cnt[c], v, c))\\n    print((cnt[c] + v - 1) // v)\\n    print(''.join(res))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\n\\nn = int(input())\\n\\n\\n\\nd = {}\\n\\nfor c in s:\\n\\n    if c not in d: d[c] = 0\\n\\n    d[c] += 1\\n\\n    \\n\\ndcl = list(d.values())\\n\\n\\n\\nfound = False\\n\\nfor x in range(1,1001):\\n\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n\\n        found = True\\n\\n        print(x)\\n\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n\\n        s += (n-len(s))*'a'\\n\\n        print(s)\\n\\n        break\\n\\nif not found:\\n\\n    print(-1)\\n\\n\", \"import sys\\nimport math\\nsys.setrecursionlimit(100000)\\n\\n#sys.stdin = open(\\\"INP.txt\\\", 'r')\\n# sys.stdout = open(\\\"OUT.txt\\\", 'w')\\n\\n\\ndef main():\\n    s = input()\\n    n = int(input())\\n    M = dict()\\n    for char in s:\\n        if char in M:\\n            M[char] += 1\\n        else:\\n            M[char] = 1\\n    if n < len(M):\\n        print(-1)\\n    else:\\n        l = 1\\n        r = len(s)\\n        while l != r:\\n            k = l+(r-l)//2\\n            smallest_n = 0\\n            for it in list(M.values()):\\n                tmp = math.ceil(it/k)\\n                smallest_n += tmp\\n            if smallest_n <= n:\\n                r = k\\n            else:\\n                l = k+1\\n        sticker = ''\\n        for char, occ in zip(list(M.keys()), list(M.values())):\\n            sticker += (char*math.ceil(occ/l))\\n\\n        if len(sticker) < n:\\n            sticker += (n-len(sticker))*list(M.keys())[0]\\n        print(\\\"{}\\\\n{}\\\".format(l, sticker))\\n\\n\\nmain()\\n\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n\\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"import math\\nfrom sys import stdin\\nfrom math import ceil\\n\\ndef __starting_point():\\n    s = input()\\n    n = int(input())\\n    dictionary = {}\\n\\n    for i in s:\\n        if i in dictionary:\\n            dictionary[i] = dictionary[i] + 1\\n        else:\\n            dictionary[i] = 1\\n\\n    if len(dictionary) > n:\\n        print(-1)\\n    else:\\n        if len(s) < n:\\n            print(1)\\n            newS = s\\n        else:\\n            lengthS = len(s) // n\\n            newLength = len(s)\\n            while lengthS < newLength:\\n                mid = (lengthS + newLength) // 2\\n                total = 0\\n                for i in dictionary:\\n                    total = total + ceil(dictionary[i] / mid)\\n                if total > n:\\n                    lengthS = mid + 1\\n                else:\\n                    newLength = mid\\n            print(lengthS)\\n            newS = ''\\n            for i in dictionary:\\n                for j in range(ceil(dictionary[i] / lengthS)):\\n                    newS = newS + i\\n        for i in range(n - len(newS)):\\n            newS = newS + s[0]\\n        print(newS)\\n\\n__starting_point()\", \"def check(mid):\\n    ans = []\\n    res = 0\\n    for c, count in d:\\n        tmp = count // mid\\n        if (count % mid != 0):\\n            tmp += 1\\n        ans.append((c, tmp))\\n        res += tmp\\n    return res <= n, ans\\n        \\n\\na = input()\\nn = int(input())\\nd = dict()\\nt = 0\\nfor i in a:\\n    if i not in d:\\n        d[i] = 1\\n        t += 1\\n    else: d[i] += 1\\nans = []\\nres = \\\"\\\"\\nfor i in d:\\n    ans.append(i)\\n    res = i\\nif n >= len(a):\\n    print(1)\\n    print(a, end = '')\\n    n -= len(a)\\n    for u in range(n):\\n        print(res, end ='')\\nelse:\\n    d = (sorted(d.items(), key = lambda d:(d[1], d[0])))\\n    l = 1\\n    r = len(a)\\n    res = []\\n    count_res = 0\\n    while (l <= r):\\n        mid = (l + r) // 2\\n        flag, tmp = check(mid)\\n        if (flag):\\n            r = mid - 1\\n            count_res = mid\\n            res = tmp\\n        else:\\n            l = mid + 1\\n        #print(l, r, tmp)\\n    if (len(res) == 0):\\n        print(-1)\\n    else:\\n        ttt = 0\\n        print(count_res)\\n        for c, sl in res:\\n            for j in range(sl):\\n                print(c, end = '')\\n                ttt += 1\\n        n -= ttt\\n        for i in range(n):\\n            print(a[0], end = '')\\n\\n \\n    \\n\\n\", \"s = input()\\nn = int(input())\\n\\nfrom collections import Counter\\nc = Counter(s)\\nout = Counter()\\ncontrib = Counter()\\n\\nfor letter in c:\\n    out[letter] = 1\\n    contrib[letter] = c[letter]\\n\\nsum_vals = sum(out.values())\\nfrom math import ceil\\nfrom fractions import Fraction\\n\\nif sum_vals > n:\\n    print(-1)\\nelse:\\n    while sum_vals < n:\\n        el, _ = contrib.most_common(1)[0]\\n        out[el] += 1\\n        sum_vals += 1\\n        contrib[el] = ceil(Fraction(c[el], out[el]))\\n\\n    print(max(contrib.values()))\\n    print(''.join(out.elements()))\\n        \\n    \\n    \\n\", \"s = input()\\nn = int(input())\\nd = {}\\nr = 0\\nfor a in s:\\n    d.setdefault(a, 0)\\n    d[a] += 1\\n    if(d[a] > r):\\n        r = d[a]\\nif (len(d) > n):\\n    print(-1)\\nelse:\\n    l = 0\\n    while r - l > 1:\\n        k = (l + r) // 2\\n        cur = 0\\n        for x in d.values():\\n            cur += (x+k-1) // k\\n        if cur > n:\\n            l = k\\n        else:\\n            r = k\\n    print(r)\\n    s = ''\\n    for a in d.keys():\\n        s += a * ((d[a] + r - 1) // r)\\n    l=len(s)\\n    s += 'a' * (n-len(s))\\n    print(s)\"]",
        "difficulty": "interview",
        "input": "aaaaaaabbbbbbb\n3\n",
        "output": "7\naba\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/335/A"
    },
    {
        "id": 309,
        "task_id": 914,
        "test_case_id": 28,
        "question": "Piegirl is buying stickers for a project. Stickers come on sheets, and each sheet of stickers contains exactly n stickers. Each sticker has exactly one character printed on it, so a sheet of stickers can be described by a string of length n. Piegirl wants to create a string s using stickers. She may buy as many sheets of stickers as she wants, and may specify any string of length n for the sheets, but all the sheets must be identical, so the string is the same for all sheets. Once she attains the sheets of stickers, she will take some of the stickers from the sheets and arrange (in any order) them to form s. Determine the minimum number of sheets she has to buy, and provide a string describing a possible sheet of stickers she should buy.\n\n\n-----Input-----\n\nThe first line contains string s (1 ≤ |s| ≤ 1000), consisting of lowercase English characters only. The second line contains an integer n (1 ≤ n ≤ 1000).\n\n\n-----Output-----\n\nOn the first line, print the minimum number of sheets Piegirl has to buy. On the second line, print a string consisting of n lower case English characters. This string should describe a sheet of stickers that Piegirl can buy in order to minimize the number of sheets. If Piegirl cannot possibly form the string s, print instead a single line with the number -1.\n\n\n-----Examples-----\nInput\nbanana\n4\n\nOutput\n2\nbaan\n\nInput\nbanana\n3\n\nOutput\n3\nnab\n\nInput\nbanana\n2\n\nOutput\n-1\n\n\n\n-----Note-----\n\nIn the second example, Piegirl can order 3 sheets of stickers with the characters \"nab\". She can take characters \"nab\" from the first sheet, \"na\" from the second, and \"a\" from the third, and arrange them to from \"banana\".",
        "solutions": "[\"from collections import Counter\\n\\ns = input()\\nn = int(input())\\n\\nd = Counter()\\n\\nfor c in s:\\n    d[c] += 1\\n\\nif len(d) > n:\\n    print(-1)\\nelse:\\n    left = 0\\n    right = 10**10\\n    s = \\\"\\\"\\n    lastok = (\\\"\\\", 0)\\n    while left + 1 < right:\\n        mid = (left + right) // 2\\n        s = \\\"\\\"\\n        for (c, cnt) in list(d.items()):\\n            cntnow = (cnt - 1) // mid + 1\\n            s += c * cntnow\\n        if len(s) < n:\\n            s += 'a' * (n - len(s))\\n        if len(s) == n:\\n            lastok = (s, mid)\\n            right = mid\\n        else:\\n            left = mid\\n    print(lastok[1])\\n    print(lastok[0])\\n\", \"s = input()\\nn = int(input())\\nfreq = [0 for i in range(0, 300)]\\nraport = [0 for i in range(0, 300)]\\ndifferentLetters = 0\\ntickets = 0\\nsol = ''\\n\\nfor c in s: freq[ord(c)] += 1\\nfor i in freq:\\n    if i > 0: differentLetters += 1\\n\\nif differentLetters > n:\\n    print('-1')\\n    return\\n\\nfor i in 'abcdefghijklmnopqrstuvwxyz':\\n    if freq[ord(i)] == 0: continue\\n    sol += i\\n    freq[ord(i)] -= 1\\n    raport[ord(i)] = freq[ord(i)]\\n\\n\\nfor i in range(differentLetters, n):\\n    #pun litera cu cea mai mare frecventa\\n\\n    maxRaport = raport[ord('z')]\\n    chosenLetter = 'z'\\n    for j in 'abcdefghijklmnopqrstuvwxyz':\\n        if raport[ord(j)] > maxRaport:\\n            maxRaport = raport[ord(j)]\\n            chosenLetter = j\\n\\n\\n    sol += chosenLetter\\n    raport[ord(chosenLetter)] = freq[ord(chosenLetter)] / sol.count(chosenLetter)\\n    \\n\\nfor i in sol:\\n    a = s.count(i)\\n    b = sol.count(i)\\n\\n    if a%b == 0: tickets = max(tickets, int(a//b))\\n    else: tickets = max(tickets, int(a//b) + 1)\\n\\nprint(tickets)\\nprint(sol)\\n        \\n\\n\\n\", \"import math\\nfrom fractions import Decimal\\nS=input()\\n\\nN=int(input())\\nSrep={}\\nansrep={}\\nfor item in \\\"abcdefghijklmnopqrstuvwxyz\\\":\\n    Srep[item]=0\\n    ansrep[item]=0\\n\\nfor item in S:\\n    Srep[item]+=1\\n    ansrep[item]+=1\\n\\nQ=list(set(S))\\n\\nif(len(Q)>N):\\n    print(-1)\\n\\nelse:\\n    n=len(Q)\\n    ans=list(S)\\n    num=1\\n    req=1\\n    n=len(ans)\\n    while(len(ans)>N):\\n        n=len(ans)\\n        minn=req+1005\\n        removal=ans[0]\\n        k=True\\n        for item in ans:\\n            if(ansrep[item]==1):\\n                continue\\n            if(math.ceil(Srep[item]/(ansrep[item]-1))>req):\\n                if(minn>math.ceil(Srep[item]/(ansrep[item]-1))):\\n                    minn=math.ceil(Srep[item]/(ansrep[item]-1))\\n                    removal=str(item)\\n                continue\\n            else:\\n                ansrep[item]-=1\\n                ans.remove(item)\\n                k=False\\n                break\\n        if(k):\\n            ansrep[removal]-=1\\n            req=math.ceil(Srep[removal]/ansrep[removal])\\n            ans.remove(removal)\\n    g=\\\"\\\"\\n    if(len(ans)<N):\\n        g=S[0]*(N-len(ans))\\n    print(req)\\n    for item in ans:\\n        print(item,end=\\\"\\\")\\n    print(g)\\n        \\n        \\n        \\n        \\n    \\n    \\n    \\n\\n\\n\", \"s = input()\\nn = int(input())\\n\\nsymb_cnt = {}\\nfor c in s:\\n\\tsymb_cnt[c] = symb_cnt[c] + 1 if c in symb_cnt else 1\\nfor cnt in range(1, len(s) + 1):\\n\\ts1 = \\\"\\\"\\n\\tfor c in symb_cnt:\\n\\t\\ts1 += c * ((symb_cnt[c] + cnt - 1) // cnt)\\n\\tif len(s1) <= n:\\n\\t\\tfor i in range(n - len(s1)):\\n\\t\\t\\ts1 += 'a'\\n\\t\\tprint(cnt)\\n\\t\\tprint(s1)\\n\\t\\treturn\\nprint(-1)\\n\", \"s = input()\\nn = int(input())\\n\\nd = {}\\nfor c in s:\\n    if c not in d: d[c] = 0\\n    d[c] += 1\\n    \\ndcl = list(d.values())\\n\\nfound = False\\nfor x in range(1,1001):\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n        found = True\\n        print(x)\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n        s += (n-len(s))*'a'\\n        print(s)\\n        break\\nif not found:\\n    print(-1)\\n\", \"from math import ceil\\np = {i: 0 for i in 'abcdefghijklmnopqrstuvwxyz'}\\nt = input()\\nfor i in t: p[i] += 1\\np = {i: p[i] for i in p if p[i] > 0}\\nn = int(input())\\nif len(p) > n: print(-1)\\nelif len(t) > n:\\n    r = [[p[i], p[i], 1, i] for i in p]\\n    for i in range(n - len(p)):\\n        j = max(r)\\n        j[2] += 1\\n        j[0] = j[1] / j[2]\\n    print(ceil(max(r)[0]))\\n    print(''.join(j[3] * j[2] for j in r))     \\nelse: print('1\\\\n' + t * (n // len(t)) + t[: n % len(t)])  \", \"from collections import Counter\\nfrom heapq import heappushpop\\n\\n\\ndef main():\\n    cnt, n = Counter(input()), int(input())\\n    if n < len(cnt):\\n        print(-1)\\n        return\\n    h = list((1 / v, 1, c) for c, v in cnt.most_common())\\n    res = list(cnt.keys())\\n    _, v, c = h.pop(0)\\n    for _ in range(n - len(cnt)):\\n        res.append(c)\\n        v += 1\\n        _, v, c = heappushpop(h, (v / cnt[c], v, c))\\n    print((cnt[c] + v - 1) // v)\\n    print(''.join(res))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\n\\nn = int(input())\\n\\n\\n\\nd = {}\\n\\nfor c in s:\\n\\n    if c not in d: d[c] = 0\\n\\n    d[c] += 1\\n\\n    \\n\\ndcl = list(d.values())\\n\\n\\n\\nfound = False\\n\\nfor x in range(1,1001):\\n\\n    if sum([(dc-1)//x+1 for dc in dcl]) <= n:\\n\\n        found = True\\n\\n        print(x)\\n\\n        s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\\n\\n        s += (n-len(s))*'a'\\n\\n        print(s)\\n\\n        break\\n\\nif not found:\\n\\n    print(-1)\\n\\n\", \"import sys\\nimport math\\nsys.setrecursionlimit(100000)\\n\\n#sys.stdin = open(\\\"INP.txt\\\", 'r')\\n# sys.stdout = open(\\\"OUT.txt\\\", 'w')\\n\\n\\ndef main():\\n    s = input()\\n    n = int(input())\\n    M = dict()\\n    for char in s:\\n        if char in M:\\n            M[char] += 1\\n        else:\\n            M[char] = 1\\n    if n < len(M):\\n        print(-1)\\n    else:\\n        l = 1\\n        r = len(s)\\n        while l != r:\\n            k = l+(r-l)//2\\n            smallest_n = 0\\n            for it in list(M.values()):\\n                tmp = math.ceil(it/k)\\n                smallest_n += tmp\\n            if smallest_n <= n:\\n                r = k\\n            else:\\n                l = k+1\\n        sticker = ''\\n        for char, occ in zip(list(M.keys()), list(M.values())):\\n            sticker += (char*math.ceil(occ/l))\\n\\n        if len(sticker) < n:\\n            sticker += (n-len(sticker))*list(M.keys())[0]\\n        print(\\\"{}\\\\n{}\\\".format(l, sticker))\\n\\n\\nmain()\\n\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n\\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"s = input()\\nn = int(input())\\ncnt = {}\\nfor c in s:\\n    if cnt.get(c) == None:\\n        cnt[c] = 1\\n    else:\\n        cnt[c] += 1\\n \\nif (n < len(cnt)):\\n    print(-1)\\nelse:\\n    ansNum = 0;\\n    while(True):\\n        ansNum+=1\\n        l = 0;\\n        char = []\\n        for c, v in cnt.items():\\n            need = (v + ansNum -1)//ansNum\\n            l+= need\\n            char.append((c, need))\\n        if (l > n):\\n            continue\\n        \\n        \\n        print(ansNum)\\n        ans = \\\"\\\".join([str(c[0])*c[1] for c in char])\\n        ans = ans + 'a'*(n - len(ans))\\n        print(ans)\\n        break\", \"import math\\nfrom sys import stdin\\nfrom math import ceil\\n\\ndef __starting_point():\\n    s = input()\\n    n = int(input())\\n    dictionary = {}\\n\\n    for i in s:\\n        if i in dictionary:\\n            dictionary[i] = dictionary[i] + 1\\n        else:\\n            dictionary[i] = 1\\n\\n    if len(dictionary) > n:\\n        print(-1)\\n    else:\\n        if len(s) < n:\\n            print(1)\\n            newS = s\\n        else:\\n            lengthS = len(s) // n\\n            newLength = len(s)\\n            while lengthS < newLength:\\n                mid = (lengthS + newLength) // 2\\n                total = 0\\n                for i in dictionary:\\n                    total = total + ceil(dictionary[i] / mid)\\n                if total > n:\\n                    lengthS = mid + 1\\n                else:\\n                    newLength = mid\\n            print(lengthS)\\n            newS = ''\\n            for i in dictionary:\\n                for j in range(ceil(dictionary[i] / lengthS)):\\n                    newS = newS + i\\n        for i in range(n - len(newS)):\\n            newS = newS + s[0]\\n        print(newS)\\n\\n__starting_point()\", \"def check(mid):\\n    ans = []\\n    res = 0\\n    for c, count in d:\\n        tmp = count // mid\\n        if (count % mid != 0):\\n            tmp += 1\\n        ans.append((c, tmp))\\n        res += tmp\\n    return res <= n, ans\\n        \\n\\na = input()\\nn = int(input())\\nd = dict()\\nt = 0\\nfor i in a:\\n    if i not in d:\\n        d[i] = 1\\n        t += 1\\n    else: d[i] += 1\\nans = []\\nres = \\\"\\\"\\nfor i in d:\\n    ans.append(i)\\n    res = i\\nif n >= len(a):\\n    print(1)\\n    print(a, end = '')\\n    n -= len(a)\\n    for u in range(n):\\n        print(res, end ='')\\nelse:\\n    d = (sorted(d.items(), key = lambda d:(d[1], d[0])))\\n    l = 1\\n    r = len(a)\\n    res = []\\n    count_res = 0\\n    while (l <= r):\\n        mid = (l + r) // 2\\n        flag, tmp = check(mid)\\n        if (flag):\\n            r = mid - 1\\n            count_res = mid\\n            res = tmp\\n        else:\\n            l = mid + 1\\n        #print(l, r, tmp)\\n    if (len(res) == 0):\\n        print(-1)\\n    else:\\n        ttt = 0\\n        print(count_res)\\n        for c, sl in res:\\n            for j in range(sl):\\n                print(c, end = '')\\n                ttt += 1\\n        n -= ttt\\n        for i in range(n):\\n            print(a[0], end = '')\\n\\n \\n    \\n\\n\", \"s = input()\\nn = int(input())\\n\\nfrom collections import Counter\\nc = Counter(s)\\nout = Counter()\\ncontrib = Counter()\\n\\nfor letter in c:\\n    out[letter] = 1\\n    contrib[letter] = c[letter]\\n\\nsum_vals = sum(out.values())\\nfrom math import ceil\\nfrom fractions import Fraction\\n\\nif sum_vals > n:\\n    print(-1)\\nelse:\\n    while sum_vals < n:\\n        el, _ = contrib.most_common(1)[0]\\n        out[el] += 1\\n        sum_vals += 1\\n        contrib[el] = ceil(Fraction(c[el], out[el]))\\n\\n    print(max(contrib.values()))\\n    print(''.join(out.elements()))\\n        \\n    \\n    \\n\", \"s = input()\\nn = int(input())\\nd = {}\\nr = 0\\nfor a in s:\\n    d.setdefault(a, 0)\\n    d[a] += 1\\n    if(d[a] > r):\\n        r = d[a]\\nif (len(d) > n):\\n    print(-1)\\nelse:\\n    l = 0\\n    while r - l > 1:\\n        k = (l + r) // 2\\n        cur = 0\\n        for x in d.values():\\n            cur += (x+k-1) // k\\n        if cur > n:\\n            l = k\\n        else:\\n            r = k\\n    print(r)\\n    s = ''\\n    for a in d.keys():\\n        s += a * ((d[a] + r - 1) // r)\\n    l=len(s)\\n    s += 'a' * (n-len(s))\\n    print(s)\"]",
        "difficulty": "interview",
        "input": "cccbba\n10\n",
        "output": "1\nabbcccaaaa\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/335/A"
    },
    {
        "id": 310,
        "task_id": 994,
        "test_case_id": 15,
        "question": "A tourist hiked along the mountain range. The hike lasted for n days, during each day the tourist noted height above the sea level. On the i-th day height was equal to some integer h_{i}. The tourist pick smooth enough route for his hike, meaning that the between any two consecutive days height changes by at most 1, i.e. for all i's from 1 to n - 1 the inequality |h_{i} - h_{i} + 1| ≤ 1 holds.\n\nAt the end of the route the tourist rafted down a mountain river and some notes in the journal were washed away. Moreover, the numbers in the notes could have been distorted. Now the tourist wonders what could be the maximum height during his hike. Help him restore the maximum possible value of the maximum height throughout the hike or determine that the notes were so much distorted that they do not represent any possible height values that meet limits |h_{i} - h_{i} + 1| ≤ 1.\n\n\n-----Input-----\n\nThe first line contains two space-separated numbers, n and m (1 ≤ n ≤ 10^8, 1 ≤ m ≤ 10^5) — the number of days of the hike and the number of notes left in the journal.\n\nNext m lines contain two space-separated integers d_{i} and h_{d}_{i} (1 ≤ d_{i} ≤ n, 0 ≤ h_{d}_{i} ≤ 10^8) — the number of the day when the i-th note was made and height on the d_{i}-th day. It is guaranteed that the notes are given in the chronological order, i.e. for all i from 1 to m - 1 the following condition holds: d_{i} < d_{i} + 1.\n\n\n-----Output-----\n\nIf the notes aren't contradictory, print a single integer — the maximum possible height value throughout the whole route.\n\nIf the notes do not correspond to any set of heights, print a single word 'IMPOSSIBLE' (without the quotes).\n\n\n-----Examples-----\nInput\n8 2\n2 0\n7 0\n\nOutput\n2\n\nInput\n8 3\n2 0\n7 0\n8 3\n\nOutput\nIMPOSSIBLE\n\n\n\n-----Note-----\n\nFor the first sample, an example of a correct height sequence with a maximum of 2: (0, 0, 1, 2, 1, 1, 0, 1).\n\nIn the second sample the inequality between h_7 and h_8 does not hold, thus the information is inconsistent.",
        "solutions": "[\"3\\n\\nimport sys\\n\\n(n, m) = list(map(int, input().split()))\\n\\nfirstData = None \\n\\nmaxHeight = -1\\n\\nfor i in range(m):\\n    (d, h) = list(map(int, input().split()))\\n\\n    if firstData is None:\\n        firstData = (d, h)\\n    else:\\n        if (d - prevD) < abs(h - prevH):\\n            print (\\\"IMPOSSIBLE\\\")\\n            return\\n        maxH = max(h, prevH)\\n        minH = min(h, prevH)\\n        resource = d - prevD - (maxH - minH) # \\\"free\\\" days for going up-down\\n        possibleH = maxH + resource // 2\\n        maxHeight = max(maxHeight, possibleH)\\n\\n    (prevD, prevH) = (d, h)\\n    lastData = (d, h)\\n\\nmaxHeight = max(maxHeight, firstData[1] + firstData[0] - 1)\\nmaxHeight = max(maxHeight, lastData[1] + (n - lastData[0]))\\n\\nprint (maxHeight)\\n\", \"n,m = list(map(int,input().split(' ')))\\nd = []\\nfor i in range(m):\\n    d.append(list(map(int,input().split(' '))))\\nispossible = True\\nmaxheights = []\\n# first and last days\\nmaxheights.append(d[0][1]+d[0][0]-1)\\nmaxheights.append(d[-1][1]+n-d[-1][0])\\n# other days\\nfor i in range(m-1):\\n    d1 = d[i]\\n    d2 = d[i+1]\\n    if abs(d2[1]-d1[1]) > d2[0]-d1[0]:\\n        ispossible = False\\n    maxheights.append((d1[1]+d2[1]+d2[0]-d1[0]) // 2)\\nif ispossible:\\n    print(max(maxheights))\\nelse:\\n    print('IMPOSSIBLE')\\n\", \"import sys\\nf = sys.stdin\\n\\nn, m  = map(int, f.readline().strip().split())\\n\\nres = True\\nfor i in range(m):\\n   d, h  = map(int, f.readline().strip().split()) \\n   if i==0:\\n       maxH = h + (d - 1)\\n       hpr = h\\n       dpr = d\\n   else: \\n       if abs(h-hpr)>(d-dpr):\\n           res = False\\n       else:\\n           dt = d - dpr - (max(hpr, h) - min(hpr, h))\\n           maxH = max(maxH, max(hpr, h) + (dt // 2))\\n           hpr = h\\n           dpr = d       \\n\\nmaxH = max(maxH, hpr + (n - dpr))\\n\\n       \\nif res:\\n    print(maxH)  \\nelse :\\n    print('IMPOSSIBLE')\", \"n, m = list(map(int, input().split()))\\nnotes = [list(map(int, input().split())) for _ in range(m)]\\n\\nif m == 1:\\n    d, h = notes[0]\\n    print(max(h+(d-1), h+(n-d)))\\n    return\\n\\nd0, h0 = notes[0]\\nans = h0+(d0-1)\\nfor i in range(m-1):\\n    d1, h1 = notes[i]\\n    d2, h2 = notes[i+1]\\n    if d2-d1 < abs(h1-h2):\\n        ans = -1\\n        break\\n    else:\\n        ans = max((h1+h2+(d2-d1))//2, ans)\\nelse:\\n    dm, hm = notes[m-1]\\n    ans = max(ans, hm+(n-dm))\\nprint(ans if ans != -1 else 'IMPOSSIBLE')\\n        \\n    \\n\", \"n,m = list(map(int,input().split()))\\nl = []\\nfor i in range(m):\\n    l.append(list(map(int,input().split())))\\nans = max(l[0][1]+l[0][0]-1,l[-1][1]+n-l[-1][0])\\nfor i in range(m-1):\\n    if abs(l[i][1]-l[i+1][1]) > abs(l[i][0]-l[i+1][0]):\\n        ans = 'IMPOSSIBLE'\\n        break\\n    if l[i][1] > l[i+1][1]:\\n        ans = max(ans,l[i][1]+((l[i+1][0]-l[i][0])-(l[i][1]-l[i+1][1]))//2)\\n    else:\\n        ans = max(ans,l[i+1][1]+((l[i+1][0]-l[i][0])-(l[i+1][1]-l[i][1]))//2)\\nprint(ans)\\n\", \"__author__ = '\\u0414\\u0430\\u043d\\u0438\\u043b\\u0430'\\nn, m = map(int, input().split())\\nl = []\\nfor i in range(m):\\n    d, h = map(int, input().split())\\n    l.append((d, h))\\nk = - 1\\nflag = True\\nfor i in range(m - 1):\\n    b = l[i + 1][1]\\n    a = l[i][1]\\n    y = l[i + 1][0]\\n    x = l[i][0]\\n    if a + y - x >= b and a - y + x <= b:\\n        if (y - x - a + b)//2 >= b - a:\\n            k1 = (y - x - a + b)//2 + a\\n            if k1 > k:\\n                k = k1\\n        else:\\n            k1 = max(a, b)\\n            if k1 > k:\\n                k = k1\\n    else:\\n        flag = False\\n\\nb = l[0][0] - 1 + l[0][1]\\na = l[-1][1] + n - l[-1][0]\\nif flag:\\n    print(max(k, a, b))\\nelse:\\n    print('IMPOSSIBLE')\", \"def maxheight(start, end):\\n    start_day, start_height = start\\n    end_day, end_height = end\\n    \\n    ddays = end_day - start_day\\n    dheight = end_height - start_height\\n    \\n    xdays = ddays - abs(dheight)\\n    \\n    if xdays < 0:\\n        return -1\\n    else:\\n        return xdays // 2 + max(start_height, end_height)\\n\\nimport sys\\ndata = sys.stdin\\n\\ndays = int(data.readline().split()[0])\\n\\nentries = []\\nfor l in data.read().splitlines():\\n    entries.append(tuple(map(int, l.split(' '))))\\nentries.sort()\\n\\nmaxheights = []\\n\\nfor e in entries:\\n    maxheights.append(e[1])\\n\\nfor i in range(len(entries) - 1):\\n    h = maxheight(entries[i], entries[i+1])\\n    if h < 0:\\n        print(\\\"IMPOSSIBLE\\\")\\n        break\\n    else:\\n        maxheights.append(h)\\nelse:\\n    first = entries[0]\\n    maxheights.append(first[0] - 1 + first[1])\\n\\n    last = entries[-1]\\n    maxheights.append(days - last[0] + last[1])\\n\\n    print(str(max(maxheights)))\", \"import sys\\n\\n\\nn, m = list(map(int, str.split(sys.stdin.readline())))\\npd = ph = None\\ntop = None\\nfor _ in range(m):\\n\\n    d, h = list(map(int, str.split(sys.stdin.readline())))\\n    if pd is None:\\n\\n        top = d - 1 + h\\n\\n    else:\\n\\n        if pd and d - pd < abs(h - ph):\\n\\n            print(\\\"IMPOSSIBLE\\\")\\n            return\\n\\n        delta = d - pd - 1 - abs(h - ph)\\n        top = max(top, max(ph, h) + (delta // 2) + (delta % 2))\\n\\n    pd, ph = d, h\\n\\ntop = max(top, h + n - d)\\nprint(top)\\n\", \"n, m = list(map(int, input().split(' ')))\\nl = [list(map(int, input().split(' '))) for _ in range(m)]\\n\\nans = max(l[0][0] + l[0][1] - 1, n - l[-1][0] + l[-1][1])\\n\\nfor i in range(1, m):\\n    dd, dh = abs(l[i][0] - l[i - 1][0]), abs(l[i][1] - l[i - 1][1])\\n    if dd < dh:\\n        print('IMPOSSIBLE')\\n        return\\n    ans = max(ans, max(l[i][1], l[i - 1][1]) + ((dd - dh) >> 1))\\n\\nprint(ans)\\n\", \"def main():\\n    import sys\\n    tokens = [int(i) for i in sys.stdin.read().split()]\\n    tokens.reverse()\\n    \\n    result = 0\\n    n, m = tokens.pop(), tokens.pop()\\n    pd, ph = 0, 0\\n    for i in range(m):\\n        d, h = tokens.pop(), tokens.pop()\\n        if i == 0:\\n            result = h + (d - 1)\\n        else:\\n            delta_d = d - pd\\n            delta_h = abs(h - ph)\\n            if delta_h > delta_d:\\n                print(\\\"IMPOSSIBLE\\\")\\n                return\\n            else:\\n                result = max(result, max(h, ph) + (delta_d - delta_h) // 2)\\n        if i == m - 1:\\n            result = max(result, h + (n - d))\\n        pd, ph = d, h\\n    print(result)\\n    \\nmain()\", \"n, m = map(int, input().split())\\npossible = True\\nday_prev, h_prev = map(int, input().split())\\nh_max = h_prev + (day_prev - 1)\\nfor i in range(m - 1):\\n    day, h = map(int, input().split())\\n    if abs(h - h_prev) > day - day_prev:\\n        possible = False\\n        break\\n    h_new = max(h, h_prev) + (day - day_prev - abs(h - h_prev)) // 2\\n    h_max = max(h_max, h_new)\\n    day_prev, h_prev = day, h\\nh_max = max(h_max, h_prev + (n - day_prev))\\nif possible:\\n    print(h_max)\\nelse:\\n    print(\\\"IMPOSSIBLE\\\")\", \"n, m = map(int, input().split())\\nd, h = [], []\\nfor i in range(m):\\n    di, hi = map(int, input().split())\\n    d.append(di)\\n    h.append(hi)\\nmaximum = h[0]\\nif d[0] != 1:\\n    d.insert(0, 1)\\n    h.insert(0, -1)\\n    m += 1\\nflag = 0\\nfor i in range(1, m):\\n    diff = d[i] - d[i - 1]\\n    if h[i - 1] == -1:\\n        if diff + h[i] > maximum:\\n            maximum = diff + h[i]\\n    else:\\n        if abs(h[i] - h[i - 1]) > diff:\\n            flag = 1\\n            break\\n        elif abs(h[i] - h[i - 1]) < diff:\\n            p = diff - (abs(h[i - 1] - h[i]))\\n            if max(h[i], h[i - 1]) + p // 2 > maximum:\\n                maximum = p // 2 + max(h[i], h[i - 1])\\n        else:\\n            if max(h[i], h[i - 1]) > maximum:\\n                maximum = max(h[i], h[i - 1])\\nif d[m - 1] < n:\\n    if maximum < h[m - 1] + n - d[m - 1]:\\n        maximum = h[m - 1] + n - d[m - 1]\\nif flag == 1:\\n    print(\\\"IMPOSSIBLE\\\")\\nelse:\\n    print(maximum)\", \"n, m = list(map(int, input().split()))\\nl_d, l_h = list(map(int, input().split()))\\nm_h = l_h + l_d - 1\\nfor i in range(1, m):\\n    n_d, n_h = list(map(int, input().split()))\\n    if abs(n_h - l_h) > n_d - l_d:\\n        print(\\\"IMPOSSIBLE\\\")\\n        return\\n    m_h = max(m_h, max(l_h, n_h) + (n_d - l_d - abs(n_h - l_h)) // 2)\\n    l_d, l_h = n_d, n_h\\nm_h = max(m_h, l_h + n - l_d)\\nprint(m_h)\\n\", \"n, m = input().split()\\nn = int(n)\\nm = int(m)\\n#print(str(n)+' '+str(m))\\narr = []\\nfor i in range(m):\\n    d, h = input().split()\\n    arr.append([int(d), int(h)])\\n\\nlast = arr[0]\\nres = arr[0][1]\\nfor i in range(1, m):\\n    if arr[i][0] - last[0] < abs(arr[i][1] - last[1]):\\n        print(\\\"IMPOSSIBLE\\\")\\n        return\\n    else:\\n        diff = arr[i][1] - last[1]\\n        res = max(res, (arr[i][0]-last[0]+diff)//2 + last[1])\\n        res = max(res, arr[i][1])\\n        last = arr[i]\\nprint(max(arr[0][1]+arr[0][0]-1, max(res, n - arr[len(arr)-1][0] + arr[len(arr)-1][1]))) \", \"N,M = list(map(int,input().split()))\\nH = []\\nfor i in range(M):\\n    d,h = list(map(int,input().split()))\\n    H.append((d,h))\\n#print(H[0])\\nbest = (H[0][0]-1) + H[0][1]\\nfor i in range(M - 1):\\n    diffd = H[i + 1][0] - H[i][0]\\n    diffh = abs(H[i + 1][1] - H[i][1])\\n    if (diffd >= diffh):\\n        best = max(best,max(H[i + 1][1],H[i][1]) + ((diffd - diffh) // 2))\\n    else:\\n        print(\\\"IMPOSSIBLE\\\")\\n        break\\nelse:\\n    best = max(best,H[M - 1][1] + (N - H[M - 1][0]))\\n    print(best)\", \"n, m = list(map(int, input().split()))\\nld, lh = list(map(int, input().split()))\\nmh = lh + (ld - 1) # 1-indexed\\nfor i in range(1, m):\\n\\td, h = list(map(int, input().split()))\\n\\tif abs(h - lh) > (d - ld):\\n\\t\\tprint('IMPOSSIBLE')\\n\\t\\treturn\\n\\tmh = max(mh, max(h, lh) + ((d - ld) - abs(h - lh)) // 2)\\n\\tld, lh = d, h\\nmh = max(mh, lh + (n - ld))\\nprint(mh) \\n\", \"n, m = [int(x) for x in input().split()]\\nd = []\\nh = []\\ns = 0\\namax = 0\\nfor i in range(m):\\n    p, q = [int(x) for x in input().split()]\\n    d.append(p)\\n    h.append(q)\\nfor i in range(m-1):\\n    if abs((h[i+1]-h[i]))/(d[i+1]-d[i]) > 1:\\n        print('IMPOSSIBLE')\\n        s += 1\\n        break\\nif s == 0:\\n    for i in range(m-1):\\n        lshift = h[i]-0\\n        rshift = h[i+1]-0\\n        a = d[i+1] + rshift - (d[i] - lshift)\\n        if a // 2 > amax:\\n            amax = a // 2\\n    b = h[0] + d[0] - 1\\n    c = h[m-1] + n - d[m-1]\\n    if amax >= b and amax >= c:\\n        print(amax)\\n    elif b >= amax and b >= c:\\n        print(b)\\n    else:\\n        print(c)\\n\", \"[n, k] = [int(x) for x in input().split()]\\nData = type('Data', (object,), {'index': 0, 'value': 0})\\n\\ndata = [Data() for _ in range(k)]\\nfor i in range(k):\\n    [data[i].index, data[i].value] = [int(x) for x in input().split()]\\n\\ndata.sort(key=lambda x: x.index)\\n\\nans = max(data[0].value + data[0].index - 1, data[k-1].value + n - data[k-1].index)\\n\\nfor i in range(1, k):\\n    L = data[i].index - data[i-1].index\\n    minH = min(data[i].value, data[i-1].value)\\n    maxV = max(data[i].value, data[i-1].value)\\n\\n    if minH + L < maxV:\\n        ans = -1\\n        break\\n\\n    ans = max(ans, (L + minH + maxV) // 2)\\n\\nif ans < 0:\\n    print(\\\"IMPOSSIBLE\\\")\\nelse:\\n    print(ans)\\n\", \"n,m=[int(x) for x in input().split()]\\nL=[[int(x) for x in input().split()] for z in range(m)]\\nmaxh=max([x[1] for x in L])\\ndef possible(a,b):\\n\\tif abs(a[1]-b[1])>abs(a[0]-b[0]):\\n\\t\\treturn False\\n\\treturn True\\ndef maxp(a,b):\\n\\tt=abs(a[0]-b[0])\\n\\tt-=abs(a[1]-b[1])\\n\\tm=max(a[1],b[1])\\n\\treturn m+(t//2)\\nposs=True\\nfor i in range(len(L)-1):\\n\\tif not possible(L[i],L[i+1]):\\n\\t\\tposs=False\\n\\t\\tbreak\\n\\tmaxh=max(maxh,maxp(L[i],L[i+1]))\\nmaxh=max(maxh,L[0][0]-1+L[0][1],n-L[-1][0]+L[-1][1])\\nif poss:\\n\\tprint(maxh)\\nelse:\\n\\tprint('IMPOSSIBLE')\\n\", \"\\nimport os\\nimport sys\\nimport functools\\nimport collections\\nimport itertools\\n\\n\\nclass Solution:\\n    def __init__(self):\\n        self.M = 0\\n        self.N = 0\\n        self.notes = None\\n\\n    def readInput(self):\\n        self.N, self.M = [int(x) for x in input().split()]\\n        self.notes = []\\n        for i in range(self.M):\\n            di, hi = [int(x) for x in input().split()]\\n            self.notes.append((di, hi))\\n    def readMockInput(self):\\n        pass\\n\\n    def solve(self):\\n\\n        if self.notes[0][0] > 1:\\n            self.notes = [(1, sum(self.notes[0])-1)] + self.notes\\n        if self.notes[-1][0] < self.N:\\n            self.notes.append((self.N, self.notes[-1][1]+self.N-self.notes[-1][0]))\\n\\n        res = max([x[1] for x in self.notes])\\n        for i in range(1, len(self.notes)):\\n            d1, h1 = self.notes[i-1]\\n            d2, h2 = self.notes[i]\\n            if abs(h1-h2) > abs(d1-d2):\\n                print('IMPOSSIBLE')\\n                return\\n            res = max(res, (abs(d1-d2)+h1+h2) // 2)\\n\\n        print(res)\\n\\n\\n\\n\\ns = Solution()\\ns.readInput()\\n# s.readMockInput()\\ns.solve()\", \"n,m = list(map(int, input().split()))\\nmax_height = 0\\nprev_d, prev_h = [0,0]\\nfor i in range(m) :\\n\\td,h = list(map(int, input().split()))\\n\\tif(i == 0) :\\n\\t\\tmax_height = (d-1) + h\\n\\t\\tprev_d = d\\n\\t\\tprev_h = h\\n\\n\\t\\t#crap - fix this\\n\\t\\tif(i == m-1) :\\n\\t\\t\\tmax_height = max(max_height, n-d+h)\\n\\n\\t\\tcontinue\\n\\n#\\tprint(\\\"calculating  \\\",  prev_d, prev_h,d,h) \\n\\tintersection = (-1*(prev_d - prev_h) + (d + h))/2\\n\\tday = (intersection - prev_h) + prev_d\\n#\\tprint(\\\"intersection: \\\", intersection, \\\" at day \\\", day)\\n\\n\\tif(day > d or day < prev_d) :\\n#\\tif(day > d) :\\n\\t\\tmax_height = -1\\n\\t\\tbreak\\n\\t\\t\\n\\tmax_height = max(max_height, int(intersection))\\n\\t\\n\\tif(i == m-1) :\\n\\t\\tmax_height = max(max_height, n-d+h)\\n\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\tprev_d = d\\n\\tprev_h = h\\n\\t\\nif(max_height >= 0) :\\n\\tprint(max_height)\\nelse :\\n\\tprint(\\\"IMPOSSIBLE\\\")\\n\\n#16160178\\n\", \"import math\\nn,m = map(int,input().split())\\na = []\\nfor i in range(m):\\n    d,h = map(int,input().split())\\n    a.append([d,h])\\nmax_ = -1\\nc1 = 0\\ng = (a[0][0] - 1) + a[0][1]\\nif (g > max_):\\n    max_ = g\\nfor i in range(len(a)-1):\\n    g = math.floor(((a[i+1][0] - a[i][0]) + a[i][1] + a[i+1][1]) / 2)\\n    if ((a[i][1] > g) or (a[i+1][1] > g)):\\n        c1 = -1\\n        break\\n    else:\\n        if (g > max_):\\n            max_ = g\\ng = (n - a[len(a)-1][0]) + a[len(a)-1][1]\\nif (g > max_):\\n    max_ = g\\nif (c1 != -1):\\n    print(max_)\\nelse:\\n    print('IMPOSSIBLE')\", \"#  Precondition: d1 < d2\\ndef possible(d1,h1,d2,h2):\\n    if (d2-d1 < abs(h2-h1)):\\n        return -1\\n    elif h1==h2:\\n        return (d2-d1)//2 + h1\\n    elif h1 > h2:\\n        diff = h1 - h2\\n        newd2 = d2 - diff\\n        if newd2 < d1:\\n           return -1\\n        else:\\n           return (newd2-d1)//2 + h1\\n    else:  # h1 < h2\\n        diff = h2 - h1\\n        newd1 = d1+diff\\n        if newd1 > d2:\\n            return -1\\n        else:\\n            return (d2-newd1)//2 + h2\\n\\n# print (\\\"Input n and m (days and notes)\\\")\\ninfo = input().split()\\nn = int(info[0])\\nm = int(info[1])\\n\\n# print (\\\"Input first day/height pair\\\")\\nfirst = input().split()\\noldd = int(first[0])\\noldh = int(first[1])\\nanswer = (oldd-1) + oldh  # Compute what day one could be\\n\\nbad = False\\nfor i in range(m-1):\\n    # print (\\\"Input next day/height pair\\\")\\n    inf = input().split()\\n    newd = int(inf[0])\\n    newh = int(inf[1])\\n    pos = possible(oldd, oldh, newd, newh)\\n    if (pos == -1):\\n        print (\\\"IMPOSSIBLE\\\")\\n        bad = True\\n        break\\n    else:   #  Can do it--check to see if a greater height\\n        if pos > answer:\\n            answer = pos\\n    oldd = newd\\n    oldh = newh\\n\\n#  If we are still OK, compute what the last day could be\\nif (not bad):\\n    endheight = (n - oldd) + oldh\\n    if endheight > answer:\\n        answer = endheight\\n    print (answer)\\n        \\n        \\n    \\n    \\n\\n\\n        \\n       \\n\", \"N, M = list(map(int, input().split()))\\nH = []\\nD = []\\nfor i in range(M):\\n    d, h = list(map(int, input().split()))\\n    H.append(h)\\n    D.append(d)\\n\\nres = max(max(H), H[M - 1] + N - D[M - 1])\\nres = max(res, H[0] + D[0] - 1)\\n\\nfor i in range(M - 1):\\n    dest = D[i + 1] - D[i]\\n    diff = abs(H[i + 1] - H[i])\\n    if diff > dest:\\n        res = float('inf')\\n        break\\n    else:\\n        res = max(res, (dest - diff) // 2 + max(H[i + 1], H[i]))\\n\\nif res == float('inf'):\\n    print(\\\"IMPOSSIBLE\\\")\\nelse:\\n    print(res)\\n    \\n\", \"from sys import stdin\\ninput = stdin.readline\\n\\nn, m = (int(x) for x in input().split())\\npd, ph = (int(x) for x in input().split())\\nres = ph + pd - 1\\nfor i in range(1, m):\\n\\td, h = (int(x) for x in input().split())\\n\\tdd = d - pd\\n\\tdh = abs(h - ph)\\n\\tif dd < dh:\\n\\t\\tprint('IMPOSSIBLE')\\n\\t\\treturn\\n\\tdd -= dh\\n\\tres = max(res, max(ph, h) + dd // 2)\\n\\tpd = d\\n\\tph = h\\nres = max(res, ph + (n - pd))\\nprint(res)\\n\"]",
        "difficulty": "interview",
        "input": "8 3\n2 0\n7 3\n8 0\n",
        "output": "IMPOSSIBLE\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/538/C"
    },
    {
        "id": 311,
        "task_id": 1292,
        "test_case_id": 2,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 4 4\n1 1 1 1\n....\n#...\n1234\n",
        "output": "1 4 3 3 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 312,
        "task_id": 1292,
        "test_case_id": 9,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 7 2\n13 1\n....###\n.#..1..\n.#.###.\n2#.....\n",
        "output": "18 1 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 313,
        "task_id": 1292,
        "test_case_id": 10,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "3 8 3\n1 1 1\n.222.321\n2.##3.31\n2#1.2131\n",
        "output": "7 10 4 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 314,
        "task_id": 1292,
        "test_case_id": 11,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "4 7 2\n13 1\n###....\n..1..#.\n.###.#.\n.....#2\n",
        "output": "18 1 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 315,
        "task_id": 1292,
        "test_case_id": 15,
        "question": "Kilani is playing a game with his friends. This game can be represented as a grid of size $n \\times m$, where each cell is either empty or blocked, and every player has one or more castles in some cells (there are no two castles in one cell).\n\nThe game is played in rounds. In each round players expand turn by turn: firstly, the first player expands, then the second player expands and so on. The expansion happens as follows: for each castle the player owns now, he tries to expand into the empty cells nearby. The player $i$ can expand from a cell with his castle to the empty cell if it's possible to reach it in at most $s_i$ (where $s_i$ is player's expansion speed) moves to the left, up, right or down without going through blocked cells or cells occupied by some other player's castle. The player examines the set of cells he can expand to and builds a castle in each of them at once. The turned is passed to the next player after that. \n\nThe game ends when no player can make a move. You are given the game field and speed of the expansion for each player. Kilani wants to know for each player how many cells he will control (have a castle their) after the game ends.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $m$ and $p$ ($1 \\le n, m \\le 1000$, $1 \\le p \\le 9$) — the size of the grid and the number of players.\n\nThe second line contains $p$ integers $s_i$ ($1 \\le s \\le 10^9$) — the speed of the expansion for every player.\n\nThe following $n$ lines describe the game grid. Each of them consists of $m$ symbols, where '.' denotes an empty cell, '#' denotes a blocked cell and digit $x$ ($1 \\le x \\le p$) denotes the castle owned by player $x$.\n\nIt is guaranteed, that each player has at least one castle on the grid.\n\n\n-----Output-----\n\nPrint $p$ integers — the number of cells controlled by each player after the game ends.\n\n\n-----Examples-----\nInput\n3 3 2\n1 1\n1..\n...\n..2\n\nOutput\n6 3 \n\nInput\n3 4 4\n1 1 1 1\n....\n#...\n1234\n\nOutput\n1 4 3 3 \n\n\n\n-----Note-----\n\nThe picture below show the game before it started, the game after the first round and game after the second round in the first example:\n\n [Image] \n\nIn the second example, the first player is \"blocked\" so he will not capture new cells for the entire game. All other player will expand up during the first two rounds and in the third round only the second player will move to the left.",
        "solutions": "[\"n, m, p = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\n\\nfield = []\\nfor _ in range(n):\\n    s = list(input().strip())\\n    field.append(s)\\n\\n\\ndef neighbours(i, j):\\n    for di, dj in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n        if 0 <= i+di < n and 0 <= j+dj < m:\\n            yield i+di, j+dj\\n\\ndef colors():\\n    return [str(i) for i in range(1, p+1)]\\n\\n\\nedges = {c:[] for c in colors()}\\nfor c in colors():\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] == c:\\n                if not all(field[n_i][n_j] == c for (n_i, n_j) in neighbours(i, j)):\\n                    edges[c].append((i,j))\\n# print(edges)\\n\\n\\ndef up_field(color):\\n    edge_color = edges[color]\\n\\n    new_edge = []\\n    for (i,j) in edge_color:\\n        for (n_i, n_j) in neighbours(i, j):\\n            if field[n_i][n_j] == '.':\\n                field[n_i][n_j] = color\\n                new_edge.append((n_i, n_j))\\n    edges[color] = new_edge\\n\\n\\ndef print_field():\\n    for l in field:\\n        print(l)\\n    print('-'*100)\\n\\n# print_field()\\n\\n\\nwhile any(len(x) > 0 for x in list(edges.values())):\\n    for s, c in zip(speeds, colors()):\\n        for i in range(s):\\n            up_field(c)\\n            if len(edges[c]) == 0:\\n                break\\n\\n    # print_field()\\n\\n\\ncounts = {c:0 for c in colors()}\\ncounts['.'] = 0\\ncounts['#'] = 0\\n\\nfor i in range(n):\\n    for j in range(m):\\n        counts[field[i][j]] += 1\\n\\nprint(*(counts[c] for c in colors()))\\n\\n\\n\\n\", \"from collections import defaultdict as dd, deque\\n\\nn,m,p = list(map(int,input().split()))\\nS = [0]+[int(x) for x in input().split()]\\nM = [list(input())+['#'] for i in range(n)]\\nM.append(['#']*m)\\n\\nfront = [[], [],[],[],[],[],[],[],[],[]]\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if M[i][j] not in '.#':\\n            a = int(M[i][j])\\n            front[a].append((i,j))\\n            M[i][j] = a\\n\\ndef expand(p):\\n    s = S[p]\\n    Q = deque()\\n    for i,j in front[p]:\\n        Q.append((i,j,0))\\n\\n    new = False\\n    nfront = []\\n    while Q:\\n        i,j,d = Q.popleft()\\n        nfront.append((i,j))\\n        if d >= s:\\n            continue\\n\\n        for di,dj in [(-1,0), (1,0), (0,1), (0,-1)]:\\n            if M[i+di][j+dj] == '.':\\n                new = True\\n                M[i+di][j+dj] = p\\n                Q.append((i+di,j+dj,d+1))\\n\\n    nnfront = []\\n    for i,j in nfront:\\n        if M[i-1][j] == '.' or \\\\\\n           M[i+1][j] == '.' or \\\\\\n           M[i][j+1] == '.' or \\\\\\n           M[i][j-1] == '.':\\n            nnfront.append((i,j))\\n\\n    front[p] = nnfront\\n    return new\\n\\n\\nwhile any([expand(i) for i in range(1,p+1)]):\\n    #for _ in M:\\n    #    print(*_)\\n    pass\\n\\nC = dd(int)\\nfor i in range(n):\\n    for j in range(m):\\n        C[M[i][j]] += 1\\nprint(*(C[i] for i in range(1,p+1)))\\n\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"from collections import deque\\n\\nn, m, p = [int(v) for v in input().split()]\\ns = [int(v) for v in input().split()]\\n\\nd = {'.': 0, '#': 10}\\nd.update({str(v) : v for v in range(1, p + 1)})\\n\\nfield = [[d[c] for c in input().strip()] for _ in range(n)]\\n\\nans = [0] * p\\ndists = [[[9999999 for _ in range(m)] for _ in range(n)] for _ in range(p)]\\nfrontiers = [deque() for _ in range(p)]\\nfor i in range(n):\\n    for j in range(m):\\n        pp = field[i][j]\\n        if 1 <= pp <= 9:\\n            frontiers[pp - 1].append((i, j, 0))\\n            ans[pp - 1] += 1\\n            dists[pp - 1][i][j] = 0\\n\\noff = [(1, 0), (0, 1), (-1, 0), (0, -1)]\\ncurr_lim = s[:]\\n\\ndef dump():\\n    for line in field:\\n        print(line)\\n    print()\\n\\nwhile True:\\n    was = False\\n    for pp in range(1, p + 1):\\n        # dump()\\n        while frontiers[pp - 1]:\\n            i, j, dist = frontiers[pp - 1].popleft()\\n            if field[i][j] not in (0, pp):\\n                continue\\n            if dist > curr_lim[pp - 1]:\\n                frontiers[pp - 1].appendleft((i, j, dist))\\n                break\\n            if field[i][j] != pp:\\n                field[i][j] = pp\\n                ans[pp - 1] += 1\\n                was = True\\n            for di, dj in off:\\n                ni, nj = i + di, j + dj\\n                if 0 <= ni < n and 0 <= nj < m and field[ni][nj] == 0:\\n                    # print(ni, nj)\\n                    new_dist = dist + 1\\n                    if new_dist < dists[pp - 1][ni][nj]:\\n                        frontiers[pp - 1].append((ni, nj, new_dist))\\n                        dists[pp - 1][ni][nj] = new_dist\\n    if was:\\n        for i in range(p):\\n            curr_lim[i] += s[i]\\n    else:\\n        break\\n\\nprint(' '.join(str(v) for v in ans))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/1/20 21:02\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Kilani and the Game.py\\n\\n# import atexit\\n# import io\\n# import sys\\n#\\n# _INPUT_LINES = sys.stdin.read().splitlines()\\n# input = iter(_INPUT_LINES).__next__\\n# _OUTPUT_BUFFER = io.StringIO()\\n# sys.stdout = _OUTPUT_BUFFER\\n#\\n#\\n# @atexit.register\\n# def write():\\n#     sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\nfrom collections import deque\\n\\n\\ndef check_empty(deque_array):\\n    count = 0\\n    for q in deque_array:\\n        count += len(q)\\n    return count == 0\\n\\n\\ndef print_grid(grid):\\n    for i in range(len(grid)):\\n        for j in range(len(grid[0])):\\n            print(grid[i][j], end='')\\n        print()\\n    print()\\n\\n\\ndef main():\\n    n, m, p = map(int, input().split())\\n    s = list(map(int, input().split()))\\n    grid = [list(input()) for _ in range(n)]\\n\\n    deque_array = [deque() for _ in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                deque_array[x - 1].append((i, j, 0))\\n\\n    # print(deque_array)\\n    curr_round = 1\\n    while not check_empty(deque_array):\\n        for r in range(p):\\n            while deque_array[r]:\\n                x, y, step = deque_array[r].popleft()\\n                if step >= s[r] * curr_round:\\n                    deque_array[r].appendleft((x, y, step))\\n                    break\\n\\n                for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\\n                    nx, ny = x + dx, y + dy\\n                    # print(nx, ny)\\n                    if nx < 0 or nx >= n or ny < 0 or ny >= m or grid[nx][ny] != '.':\\n                        continue\\n                    grid[nx][ny] = str(r + 1)\\n                    deque_array[r].append((nx, ny, step + 1))\\n        # print_grid(grid)\\n        curr_round += 1\\n\\n    cell_count = [0] * p\\n    for i in range(n):\\n        for j in range(m):\\n            if '1' <= grid[i][j] <= '9':\\n                x = int(grid[i][j])\\n                cell_count[x - 1] += 1\\n    for r in range(p):\\n        print(cell_count[r], end=' ')\\n    print()\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# import sys\\n#\\n# f = open('input1.txt', 'r')\\n#\\n#\\n# sys.stdin = f\\n\\nn, m, p = list(map(int, input().split()))\\ns = list(map(int, input().split()))\\n\\nq = [[] for _ in range(p)] # fromnt of each palyer\\ncounts = [0] * p\\n\\nfield = []\\nfor i in range(n):\\n    line = input()\\n    field.append([0] * m)\\n    for j, c in enumerate(line):\\n        if c == '.':\\n            field[i][j] = 0\\n        elif c == '#':\\n            field[i][j] = -1\\n        else:\\n            # player\\n            pi = int(c)\\n            field[i][j] = pi\\n            counts[pi-1] += 1\\n\\ndef get_neibs(i, j):\\n    up = (i - 1, j) if i > 0 else None\\n    down = (i + 1, j) if i < n - 1 else None\\n    left = (i, j - 1) if j > 0 else None\\n    right = (i, j + 1) if j < m - 1 else None\\n    nbs = [up, down, left, right]\\n    return [a for a in nbs if a is not None]\\n\\n\\n\\ndef init_bounds(field, q):\\n    for i in range(n):\\n        for j in range(m):\\n            if field[i][j] > 0:\\n                index  = field[i][j]-1\\n                nbs = get_neibs(i, j)\\n                neib_vals = [field[a[0]][a[1]] for a in nbs]\\n                if 0 in neib_vals:\\n                    q[index].append((i, j))\\n\\ndef step_one(index, field, front: list):\\n    new_front = []\\n\\n    total_add = 0\\n    for i, j in front:\\n        nbs = get_neibs(i, j)\\n        for a in nbs:\\n            if field[a[0]][a[1]] == 0:\\n                # if not yet added\\n                field[a[0]][a[1]] = index+1\\n                counts[index] += 1\\n                total_add += 1\\n                new_front.append(a)\\n\\n\\n    return new_front, total_add\\n\\n\\n\\n\\n\\ndef  step(index, field, front, speed):\\n    added_len = 0\\n    while speed > 0:\\n        front, added_len = step_one(index, field, front)\\n        speed -= 1\\n        if added_len == 0:\\n            break\\n\\n    q[index] = front\\n    return front, added_len\\n\\ninit_bounds(field, q)\\n\\nwhile True:\\n\\n    progress = 0\\n    added = 0\\n    for i in range(p):\\n        _, added = step(i, field, q[i], s[i])\\n        progress += added\\n\\n    if progress == 0:\\n        break\\n\\n\\n\\nprint(\\\" \\\".join(map(str, counts)))\\n\\n# f.close()\\n\", \"n, m, p=map(int, input().split())\\ns=list(map(int, input().split()))\\na=[]\\nfront=[set() for i in range(p)] \\nfor i in range(n):\\n    a.append([(int(0) if ch=='.' else (-1 if ch=='#' else (int(ch) if not front[int(ch)-1].add( (i, j) ) else -99 ))) for j, ch in enumerate(input())])\\n\\nmove=[(-1, 0), (1, 0), (0, -1), (0, 1)]\\ni=0\\nblocked=[False]*p\\nactiveplayers=p\\n\\ni=0\\nwhile activeplayers>0:\\n    if blocked[i]:\\n        i=(i+1)%p\\n        continue\\n    aset=front[i]\\n    mademove=False\\n    for gtime in range(s[i]):\\n        newset=set()\\n        for x,y in aset:\\n            for dx, dy in move:\\n                if 0<=x+dx<n and 0<=y+dy<m:\\n                    if a[x+dx][y+dy]==0:\\n                        newset.add( (x+dx, y+dy) )\\n                        a[x+dx][y+dy]=(i+1)\\n                        mademove=True\\n        aset=newset\\n        if len(aset)==0:\\n            mademove=False\\n            break\\n    front[i]=aset\\n    if not mademove:\\n        blocked[i]=True\\n        activeplayers=activeplayers-1\\n    i=(i+1)%p\\n\\nres=[0]*p\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if a[i][j]>0:\\n            res[int(a[i][j])-1]=res[int(a[i][j])-1]+1\\n\\nfor i in range(p):\\n    print(res[i], end=' ')\\n\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor b in sys.stdin.read():\\n    for c in b:\\n        if c=='.':\\n            board.append(-1)\\n        elif 0<=ord(c)-49<=9:\\n            board.append(ord(c)-49)\\n        elif c=='#':\\n            board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nQ = dq()\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n    # Do S[p] moves\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(*count)\", \"import sys\\nfrom collections import deque as dq\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [dq() for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = dq(p for p in range(P) if new_castles[p])\\nwhile player_Q:\\n    p = player_Q.popleft()\\n    Q = new_castles[p]\\n\\n    goal = Q[-1][1] + S[p]\\n    while Q and Q[0][1] != goal:\\n        pos,moves = Q.popleft()\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q:\\n        player_Q.append(p)\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    if inp[ind]=='.':\\n        board.append(-1)\\n    elif 49<=ord(inp[ind])<=58:\\n        board.append(ord(inp[ind])-49)\\n    elif inp[ind]=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\ncount = [0 for _ in range(P)]\\nfor x in board:\\n    if x >= 0:\\n        count[x] += 1\\nprint(' '.join(str(x) for x in count))\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\ninp = sys.stdin.read()\\nfor ind in range(len(inp)):\\n    c = inp[ind]\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"import sys\\n\\nh,w,P = [int(x) for x in input().split()]\\nS = [int(x) for x in input().split()]\\n\\nboard = []\\nfor c in sys.stdin.read():\\n    if c=='.':\\n        board.append(-1)\\n    elif 49<=ord(c)<=58:\\n        board.append(ord(c)-49)\\n    elif c=='#':\\n        board.append(-2)\\n\\nnew_castles = [[] for _ in range(P)]\\nnew_castles_ind = [0 for _ in range(P)]\\n\\nfor pos in range(h*w):\\n    if board[pos]>=0:\\n        new_castles[board[pos]].append((pos,0))\\n\\nplayer_Q = [p for p in range(P) if new_castles[p]]\\nplayer_Q_ind = 0\\n\\nwhile player_Q_ind != len(player_Q):\\n    p = player_Q[player_Q_ind]\\n    player_Q_ind += 1\\n    Q = new_castles[p]\\n    Q_ind = new_castles_ind[p]\\n\\n    goal = Q[Q_ind][1] + S[p]\\n    while Q_ind != len(Q) and Q[Q_ind][1] != goal:\\n        pos,moves = Q[Q_ind]\\n        Q_ind += 1\\n        y = pos//w\\n        x = pos - y*w\\n        \\n        if 0<x and board[pos-1]==-1:\\n            board[pos-1]=p\\n            Q.append((pos-1,moves+1))\\n        \\n        if x<w-1 and board[pos+1]==-1:\\n            board[pos+1]=p\\n            Q.append((pos+1,moves+1))\\n    \\n        if 0<y and board[pos-w]==-1:\\n            board[pos-w]=p\\n            Q.append((pos-w,moves+1))\\n        \\n        if y<h-1 and board[pos+w]==-1:\\n            board[pos+w]=p\\n            Q.append((pos+w,moves+1))\\n    if Q_ind != len(Q):\\n        player_Q.append(p)\\n        new_castles_ind[p] = Q_ind\\n\\nprint(*[len(new_castles[p]) for p in range(P)])\", \"from collections import deque\\nimport math\\n\\n\\ndef add(x, y):\\n    return (x[0] + y[0], x[1] + y[1])\\n\\n\\nh, w, n = list(map(int, input().split()))\\nspeeds = list(map(int, input().split()))\\narr = [None] * h\\ncastles = [deque() for _ in range(n)]\\ncastles_count = [0] * n\\nfor i in range(h):\\n    arr[i] = list(input())\\n    for j in range(w):\\n        if arr[i][j] not in ('.', '#'):\\n            arr[i][j] = int(arr[i][j]) - 1\\n            castles[arr[i][j]].append((i, j))\\n            castles_count[arr[i][j]] += 1\\n\\n\\ndef get(x):\\n    if (x[0] >= 0) and (x[1] >= 0) and (x[0] < h) and (x[1] < w):\\n        return arr[x[0]][x[1]]\\n    return None\\n\\n\\nhas_changes = True\\nwhile has_changes:\\n    has_changes = False\\n    for p in range(n):\\n        cur_lvl = castles[p]\\n        cur_lvl_num = 0\\n        while (cur_lvl_num < speeds[p]) and cur_lvl:\\n            next_lvl = []\\n            for cell in cur_lvl:\\n                for move in ((0, 1), (0, -1), (-1, 0), (1, 0)):\\n                    next_cell = add(cell, move)\\n                    val = get(next_cell)\\n                    if val == '.':\\n                        has_changes = True\\n                        next_lvl.append(next_cell)\\n                        arr[next_cell[0]][next_cell[1]] = p\\n                        castles_count[p] += 1\\n            cur_lvl_num += 1\\n            cur_lvl = next_lvl\\n        castles[p] = cur_lvl\\n\\nprint(' '.join(map(str, castles_count)))\\n\", \"import sys\\nfrom collections import deque, Counter\\n\\ndef __starting_point():\\n    n, m, p = list(map(int, input().split()))\\n    speeds = list(map(int, input().split()))\\n    field = sys.stdin.readlines()\\n\\n    lands = [-1] * (n * m)\\n\\n    graph = [[] for _ in range(n * m)]\\n\\n    starts = [deque() for _ in range(p)]\\n\\n    levels = [-1] * n * m\\n\\n    def calc(x, y): return x * m + y\\n\\n\\n    for i in range(n):\\n        for j in range(m):\\n            point = calc(i, j)\\n            if field[i][j].isdigit():\\n                player = int(field[i][j]) - 1\\n                starts[player].appendleft(point)\\n                lands[point] = player\\n                levels[point] = 0\\n            elif field[i][j] == '#':\\n                continue\\n\\n            if 0 <= i - 1 and field[i - 1][j] == '.':\\n                graph[point].append(calc(i - 1, j))\\n            if i + 1 < n and field[i + 1][j] == '.':\\n                graph[point].append(calc(i + 1, j))\\n            if 0 <= j - 1 and field[i][j - 1] == '.':\\n                graph[point].append(calc(i, j - 1))\\n            if j + 1 < m and field[i][j + 1] == '.':\\n                graph[point].append(calc(i, j + 1))\\n\\n    cnt = 0\\n    while [s for s in starts if s]:\\n        player = cnt % p\\n        turn = cnt // p + 1\\n\\n        while starts[player]:\\n            if levels[starts[player][-1]] == speeds[player] * turn:\\n                break\\n\\n            node = starts[player].pop()\\n\\n            for nxt in graph[node]:\\n                if lands[nxt] != -1:\\n                    continue\\n                level = levels[node] + 1\\n                lands[nxt] = player\\n                levels[nxt] = levels[node] + 1\\n                starts[player].appendleft(nxt)\\n\\n        cnt += 1\\n\\n    cnt = list(Counter([l for l in lands if l != -1]).items())\\n    cnt.sort()\\n\\n    print(\\\" \\\".join([str(x[1]) for x in cnt]))\\n\\n\\n\\n__starting_point()\", \"n, m, p = list(map(int, input().split()))\\ns = [int(i) for i in input().split()]\\n\\np_size = [0] * p\\nfield = []\\nfield_free = 0\\npp = [set() for _ in range(p)]\\nfor y in range(n):\\n    for x,i in enumerate(input()):\\n        if not (i == '.' or i == '#'):\\n            pp[int(i)-1].add(x + y*m)\\n        c = i != '#'\\n        field_free += int(c)\\n        field.append(c)\\n\\ndef append_nearest(fp, ppn, pi):\\n    nonlocal field_free\\n    nonlocal p_size\\n    if not field[fp]:\\n        return\\n    if fp % m > 0 and field[fp-1]:\\n        ppn.add(fp - 1)\\n    if fp % m < m-1 and field[fp+1]:\\n        ppn.add(fp + 1)\\n    if fp // m > 0 and field[fp - m]:\\n        ppn.add(fp - m)\\n    if fp // m < n-1 and field[fp + m]:\\n        ppn.add(fp + m)\\n    field[fp] = False\\n    field_free -= 1\\n    p_size[pi] += 1\\n\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    ppn = pp[pi] = set()\\n    for fp in ppi:\\n        append_nearest(fp, ppn, pi)\\n    del ppi\\n\\nppn = set()\\nfor pi in range(p):\\n    ppi = pp[pi]\\n    if len(ppi) > 0:\\n        for _ in range(s[pi]):\\n            for fp in ppi:\\n                append_nearest(fp, ppn, pi)\\n            ppi.clear()\\n            ppi,ppn = ppn,ppi\\n\\n            if field_free == 0 or len(ppi) == 0:\\n                break\\n        pp[pi] = ppi\\n\\n        if field_free == 0:\\n            break\\nnmlp = n*m - m\\nssss = True\\nwhile field_free > 0 and ssss:\\n    ssss = False\\n    for pi in range(p):\\n        ppi = pp[pi]\\n        if len(ppi) > 0:\\n            for _ in range(s[pi]):\\n                for fp in ppi:\\n                    if not field[fp]:\\n                        continue\\n                    if fp % m > 0 and field[fp-1]:\\n                        ppn.add(fp - 1)\\n                    if fp % m < m-1 and field[fp+1]:\\n                        ppn.add(fp + 1)\\n                    if fp > m-1 and field[fp - m]:\\n                        ppn.add(fp - m)\\n                    if fp < nmlp and field[fp + m]:\\n                        ppn.add(fp + m)\\n                    field[fp] = False\\n                    field_free -= 1\\n                    p_size[pi] += 1\\n                ppi.clear()\\n                ppi,ppn = ppn,ppi\\n            pp[pi] = ppi\\n            ssss |= len(ppi) > 0\\n\\n\\nprint(' '.join(map(str, p_size)))\\n\", \"from collections import deque\\nimport sys\\nDBG =   False\\nn,m,p = list(map(int, input().split()))\\nspd = list(map(int, input().split()))\\nspd.insert(0,-1)  # p starts at 1\\ngrid = [ [0] * m for i in range(n) ]\\nc2d = { \\\"#\\\":-1, \\\".\\\":0, \\\"1\\\":1, \\\"2\\\":2, \\\"3\\\":3, \\\"4\\\":4,\\n        \\\"5\\\":5, \\\"6\\\":6, \\\"7\\\":7, \\\"8\\\":8, \\\"9\\\":9 }\\ncastle = [ [] for i in range(p+1)]\\n\\nfor i in range(n):\\n  s = input()\\n  for j in range(m):\\n    v = c2d[s[j]]\\n    grid[i][j] = v\\n    if v>0:\\n      castle[v].append([i,j])\\n\\nif DBG:\\n  print(grid)\\n  print(\\\"\\\\n\\\")\\n  print(spd)\\n  print(\\\"\\\\n\\\")\\n\\ndef mark(proc,t):\\n  nonlocal changed, grid, castle, newcastle\\n  dir = [ [1,0], [-1,0], [0,1], [0,-1] ]\\n  while len(proc) > 0:\\n    ent = proc.popleft()\\n    c = ent[0]\\n    s = ent[1]\\n    for d in dir:\\n      x = c[0]+d[0]\\n      y = c[1]+d[1]\\n      if x<0 or n<=x or y<0 or m<=y or grid[x][y]!=0:\\n          continue\\n      changed = True\\n      grid[x][y] = t\\n      if s>1:\\n        proc.append([ [x,y], s-1 ])\\n      else:\\n        newcastle.append([x,y])\\n\\n\\nchanged = True\\nwhile changed:\\n  if DBG:\\n    print(\\\"---- new loop ----\\\")\\n  changed = False\\n  for t in range(1,p+1):\\n    newcastle = []\\n    proc = deque([])\\n    for c in castle[t]:\\n        proc.append([c, spd[t]])\\n    mark(proc, t)\\n    if False and DBG:\\n        print((\\\"turn for %d, (%d,%d) ended\\\" %\\n                     (t,c[0],c[1])))\\n        print(grid)\\n    #for x in $newcastle\\n    #  $castle[t] << x\\n    #end\\n    castle[t] = newcastle\\n\\na = [ 0 for i in range(p+1) ]\\nfor x in range(n):\\n  for y in range(m):\\n    if grid[x][y] != -1:\\n      a[grid[x][y]] += 1\\n\\nfor i in range(1,p+1):\\n  sys.stdout.write(\\\"%d \\\" % a[i])\\nprint(\\\"\\\")\\n\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        new_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if new_frontier:\\n                new_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope = new_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import time\\n\\n\\ndef get_frontiers(feild, n, m, p):\\n    # print(feild)\\n    # print(n, m)\\n    frontiers = [[] for i in range(p)]\\n    for i in range(n):\\n        for j in range(m):\\n            ele = feild[i][j]\\n            if 1 <= ele <= 9:\\n                # print('ele:', ele)\\n                frontiers[ele - 1].append((i, j))\\n    return frontiers\\n\\ndef go(player_id, frontier, n_turn, feild, n, m):\\n    frontier = frontier\\n    # print('In go:', player_id, frontier, n_turn)\\n    while n_turn and frontier:\\n        n_turn -= 1\\n        new_frontier = []\\n        for i, j in frontier:\\n            # Down.\\n            if i + 1 < n:\\n                new_space = feild[i + 1][j]\\n                if not new_space:\\n                    feild[i + 1][j] = player_id\\n                    new_frontier.append((i + 1, j))\\n            # Up.\\n            if i - 1 >= 0:\\n                new_space = feild[i - 1][j]\\n                if not new_space:\\n                    feild[i - 1][j] = player_id\\n                    new_frontier.append((i - 1, j))\\n            # Rigth.\\n            if j + 1 < m:\\n                new_space = feild[i][j + 1]\\n                if not new_space:\\n                    feild[i][j + 1] = player_id\\n                    new_frontier.append((i, j + 1))\\n            # Left.\\n            if j - 1 >= 0:\\n                new_space = feild[i][j - 1]\\n                if not new_space:\\n                    feild[i][j - 1] = player_id\\n                    new_frontier.append((i, j - 1))\\n\\n            # for d_i, d_j in (-1, 0), (1, 0), (0, 1), (0, -1):\\n                # check boarder.\\n                # new_i, new_j = i + d_i, j + d_j\\n                # if new_i < 0 or new_j < 0 or new_i > n - 1 or new_j > m - 1:\\n                    # continue\\n                # new_space = feild[new_i][new_j]\\n                # if new_space == 0:\\n                    # feild[new_i][new_j] = player_id\\n                    # new_frontier.append((new_i, new_j))\\n        frontier = new_frontier\\n                # print('haha:', frontier)\\n        # print('player:', player_id)\\n\\n        # for ele in feild:\\n            # print(ele)\\n    # print('Got new frontier:', frontier)\\n    return frontier\\n\\ndef solve(speeds, feild, n, m, p):\\n    frontiers = get_frontiers(feild, n, m, p)\\n    # print('f:', frontiers)\\n    hope = set(range(p))\\n    while hope:\\n        lost_hope = set()\\n        for i in hope:\\n            n_turn = speeds[i]\\n            frontier = frontiers[i]\\n            new_frontier = go(i + 1, frontier, n_turn, feild, n, m)\\n            # print('i:', i)\\n            # print(new_frontier)\\n            if not new_frontier:\\n                lost_hope.add(i)\\n            frontiers[i] = new_frontier\\n        hope -= lost_hope\\n    result = get_frontiers(feild, n, m, p)\\n    return [len(ele) for ele in result]\\n\\ndef test():\\n    n, m, p = 1000, 1000, 9\\n    speeds = [1000000, 100000, 100000, 100000, 100000, 100000, 100000, 100000, 1]\\n    feild = [[0, -1] * (m // 2) for i in range(n)]\\n    for i in range(m):\\n        if i % 4 != 1:\\n            feild[0][i] = 0\\n        if i % 4 != 3:\\n            feild[n - 1][i] = 0\\n    # feild[0][0] = 1\\n    for i in range(9):\\n        feild[0][i * 8] = i + 1    \\n    # for ele in feild:\\n        # print(ele)\\n    tick = time.time()\\n    result = solve(speeds, feild, n, m, p)\\n    tock = time.time()\\n    print(' '.join(map(str, result)))\\n    print('T:', round(tock - tick, 5))\\n\\ndef main():\\n    d = {str(i): i for i in range(1, 10)}\\n    d['.'] = 0\\n    d['#'] = -1\\n    n, m, p = map(int, input().split())\\n    speeds = list(map(int, input().split()))\\n    feild = []\\n    for i in range(n):\\n        feild.append(list(map(d.get, input())))\\n    # for ele in feild:\\n        # print(ele)\\n    result = solve(speeds, feild, n, m, p)\\n    print(' '.join(map(str, result)))\\n    # for ele in feild:\\n        # print(ele)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"[n, m, p] = [int(x) for x in input().split()]\\ns = [int(x) for x in input().split()]\\n\\n\\ncoord_change = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\ngrid = []\\n\\nvisited = [[False]*1010 for x in range(1010)]\\n\\nqueue = [[] for x in range(10)]\\ncontrolled = [0]*10\\n\\nfor i in range(n):\\n    grid.append(input())\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            continue\\n        elif grid[i][j] == '#':\\n            visited[i][j] = True\\n        else:\\n            player = int(grid[i][j])-1\\n            visited[i][j] = True\\n            queue[player].append([i,j])\\n            controlled[player] += 1\\n\\n\\n\\ncurr_p = 0\\nwhile any(queue):\\n    moves = 0\\n    # print(curr_p, queue,s)\\n    while moves < s[curr_p] and queue[curr_p]:\\n        new_queue = []\\n        curr_queue = queue[curr_p]\\n        for coord in curr_queue:\\n            for change in coord_change:\\n                new_coord = [coord[0]+change[0],coord[1]+change[1]]\\n                if new_coord[0] < 0 or new_coord[1] < 0 or new_coord[0] >= n or new_coord[1] >= m:\\n                    continue\\n                if visited[new_coord[0]][new_coord[1]]:\\n                    continue\\n\\n                visited[new_coord[0]][new_coord[1]] = True\\n                controlled[curr_p] += 1\\n                new_queue.append(new_coord)\\n        moves += 1\\n        queue[curr_p] = new_queue\\n    curr_p += 1\\n    curr_p %= p\\n\\n# print(grid[0])\\n# print(controlled)\\nfor i in range(p):\\n    print(controlled[i],end=' ')\", \"import sys\\nimport math\\nfrom collections import defaultdict,deque\\nimport heapq\\nmod=998244353\\ndef check(x,y,n,m):\\n\\treturn (0<=x<n and 0<=y<m)\\nn,m,k=list(map(int,sys.stdin.readline().split()))\\ngrid=[]\\ns=list(map(int,sys.stdin.readline().split()))\\nfor i in range(n):\\n\\tgrid.append(list(sys.stdin.readline()[:-1]))\\nq=deque()\\ndic=defaultdict(deque)\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tdic[int(grid[i][j])].append([i,j])\\n\\t\\t\\t#q.append([int(grid[i][j]),i,j])\\nq=True\\ndirs=[[0,1],[0,-1],[1,0],[-1,0]]\\nwhile q:\\n\\tz=True\\n\\tfor i in range(k):\\n\\t\\tnq=deque()\\n\\t\\twhile dic[i+1]:\\n\\t\\t\\tj=dic[i+1].popleft()\\n\\t\\t\\t#print(j,'j')\\n\\t\\t\\tnq.append(j+[s[i]])\\n\\t\\t\\tz=False\\n\\t\\tp=i+1\\n\\t\\twhile nq:\\n\\t\\t\\t#print(nq,'nq')\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tdic[p].append([x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\t\\t\\n\\tif z:\\n\\t\\tq=False\\n\\n'''for i in range(k):\\n\\tfor j in dic[i+1]:\\n\\t\\tq.append([i+1]+j)\\n#print(q,'q')\\n\\nwhile q:\\n\\tp,curx,cury=q.popleft()\\n\\n\\t#print(p,'p',curx,'curx',cury,'cury',s[p-1])\\n\\tnq=deque()\\n\\tnq.append([curx,cury,s[p-1]])\\n\\tif int(grid[curx][cury])==p:\\n\\t\\twhile nq:\\n\\t\\t\\tx,y,dis=nq.popleft()\\n\\t\\t\\t#print(x,'x',y,'y',dis,'dis')\\n\\t\\t\\tif dis==0:\\n\\t\\t\\t\\tq.append([p,x,y])\\n\\t\\t\\telse:\\n\\t\\t\\t\\tfor i,j in dirs:\\n\\t\\t\\t\\t\\tnx,ny=x+i,y+j\\n\\t\\t\\t\\t\\tif check(nx,ny,n,m) and grid[nx][ny]=='.':\\n\\t\\t\\t\\t\\t\\tgrid[nx][ny]=p\\n\\t\\t\\t\\t\\t\\t#print(nx,'nx',ny,'ny',dis-1,'dis-1')\\n\\t\\t\\t\\t\\t\\tnq.append([nx,ny,dis-1])\\n\\tfor i in range(n):\\n\\t\\tprint(grid[i])\\n\\tprint('\\\\n')'''\\nans=[0 for _ in range(k)]\\n#print(ans,'ans')\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\tif grid[i][j]!='.' and grid[i][j]!='#':\\n\\t\\t\\tans[int(grid[i][j])-1]+=1\\n#print(grid,'grid')\\nprint(*ans)\\n\\n\"]",
        "difficulty": "interview",
        "input": "5 5 1\n100\n..#..\n..#..\n###..\n...1.\n.....\n",
        "output": "16 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1105/D"
    },
    {
        "id": 316,
        "task_id": 1355,
        "test_case_id": 9,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "5 1\n0 0\n-1 1\n2 1\n2 -1\n1 0\n100 0 101 0\n",
        "output": "2.00000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 317,
        "task_id": 1355,
        "test_case_id": 10,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 1\n100000 100000\n-100000 -100000\n100000 -100000\n1.15 99999.99 1.16 99999.99\n",
        "output": "0.01000000000000000021\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 318,
        "task_id": 1355,
        "test_case_id": 11,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 1\n100000 100000\n-100000 -100000\n100000 -100000\n0 99999.99 0.01 99999.99\n",
        "output": "0.01000000000000000021\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 319,
        "task_id": 1355,
        "test_case_id": 17,
        "question": "Given simple (without self-intersections) n-gon. It is not necessary convex. Also you are given m lines. For each line find the length of common part of the line and the n-gon.\n\nThe boundary of n-gon belongs to polygon. It is possible that n-gon contains 180-degree angles.\n\n\n-----Input-----\n\nThe first line contains integers n and m (3 ≤ n ≤ 1000;1 ≤ m ≤ 100). The following n lines contain coordinates of polygon vertices (in clockwise or counterclockwise direction). All vertices are distinct.\n\nThe following m lines contain line descriptions. Each of them contains two distict points of a line by their coordinates.\n\nAll given in the input coordinates are real numbers, given with at most two digits after decimal point. They do not exceed 10^5 by absolute values.\n\n\n-----Output-----\n\nPrint m lines, the i-th line should contain the length of common part of the given n-gon and the i-th line. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n4 3\n0 0\n1 0\n1 1\n0 1\n0 0 1 1\n0 0 0 1\n0 0 1 -1\n\nOutput\n1.41421356237309514547\n1.00000000000000000000\n0.00000000000000000000",
        "solutions": "[\"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"def main():\\n    from math import hypot\\n    n, m = list(map(int, input().split()))\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = list(map(float, input().split()))\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"import math\\n\\neps = 1e-9\\n\\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n\\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n\\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n\\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n\\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n\\n        if ss == es: continue\\n\\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n\\n    print(total_t * (q - p).length())\\n    \\nn, m = list(map(int, input().split()))\\n\\npolygon = []\\nfor i in range(n):\\n    x, y = list(map(float, input().split()))\\n    polygon.append(Vector(x, y))\\narea = sum([cross(x[0], x[1]) for x in zip(polygon, polygon[1:] + polygon[:1])])\\nif (area < 0): polygon.reverse()\\n\\nfor i in range(m):\\n    x1, y1, x2, y2 = list(map(float, input().split()))\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\\n\", \"def main():\\n    from math import hypot\\n    n, m = map(int, input().split())\\n    vertices = list(tuple(map(float, input().split())) for _ in range(n))\\n    ax, ay = vertices[-1]\\n    for i, (bx, by) in enumerate(vertices):\\n        vertices[i], ax, ay = (bx, by, bx - ax, by - ay), bx, by\\n    for _ in range(m):\\n        x0, y0, x1, y1 = map(float, input().split())\\n        x1 -= x0\\n        y1 -= y0\\n        bx, by = vertices[-1][:2]\\n        tmp = (bx - x0) * y1 - (by - y0) * x1\\n        t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n        res = []\\n        for bx, by, abx, aby in vertices:\\n            s, tmp = t, (bx - x0) * y1 - (by - y0) * x1\\n            t = -1 if tmp < 0 else 1 if tmp > 0 else 0\\n            if s != t:\\n                res.append((((bx - x0) * aby - (by - y0) * abx) / (x1 * aby - y1 * abx), s - t))\\n        res.sort()\\n        t, w = 0, 0.\\n        for i, (tmp, s) in enumerate(res, -1):\\n            if t:\\n                w += tmp - res[i][0]\\n            t += s\\n        print(w * hypot(x1, y1))\\n \\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import math\\n \\neps = 1e-9\\n \\ndef sign(n):\\n    if n > eps: return 1\\n    if n < -eps: return -1\\n    return 0\\n \\ndef cross(a, b):\\n    return a.x * b.y - a.y * b.x\\n \\nclass Vector:\\n    def __init__(self, x, y):\\n        self.x = x\\n        self.y = y\\n \\n    def __add__(self, v):\\n        return Vector(self.x + v.x, self.y + v.y)\\n    \\n    def __sub__(self, v):\\n        return Vector(self.x - v.x, self.y - v.y)\\n    \\n    def length(self):\\n        return math.hypot(self.x, self.y)\\n \\ndef solve(polygon, p, q):\\n    intersections = []\\n    for (a, b) in zip(polygon, polygon[1:] + polygon[:1]):\\n        ss = sign(cross(a - p, q - p))\\n        es = sign(cross(b - p, q - p))\\n \\n        if ss == es: continue\\n \\n        t = cross(a - p, a - b) / cross(q - p, a - b)\\n        intersections.append((t, es - ss))\\n    intersections = sorted(intersections)\\n    total_t, previous_t, count = [0] * 3\\n    \\n    for t, order in intersections:\\n        if (count > 0): total_t += t - previous_t\\n        previous_t = t\\n        count += order\\n    # print(total_t) \\n \\n    print(total_t * (q - p).length())\\n    \\nn, m = map(int, input().split())\\n \\npolygon = []\\nfor i in range(n):\\n    x, y = map(float, input().split())\\n    polygon.append(Vector(x, y))\\narea = sum(map(lambda x: cross(x[0], x[1]), zip(polygon, polygon[1:] + polygon[:1])))\\nif (area < 0): polygon.reverse()\\n \\nfor i in range(m):\\n    x1, y1, x2, y2 = map(float, input().split())\\n    solve(polygon, Vector(x1, y1), Vector(x2, y2))\"]",
        "difficulty": "interview",
        "input": "3 1\n-100000 -100000\n100000 -100000\n0 1\n-100000 -100000 100000 -99999\n",
        "output": "199999.00001749978400766850\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/598/F"
    },
    {
        "id": 320,
        "task_id": 1463,
        "test_case_id": 11,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "4\n1 2 3 5\n1 1 1 1\n1 1 1 1\n1 1 1 1\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 321,
        "task_id": 1463,
        "test_case_id": 12,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "1\n2\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 322,
        "task_id": 1463,
        "test_case_id": 14,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "1\n5\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 323,
        "task_id": 1463,
        "test_case_id": 16,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "3\n2 1 1\n2 1 1\n2 1 1\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 324,
        "task_id": 1463,
        "test_case_id": 17,
        "question": "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.\n\nHelp Okabe determine whether a given lab is good!\n\n\n-----Input-----\n\nThe first line of input contains the integer n (1 ≤ n ≤ 50) — the size of the lab. \n\nThe 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 ≤ 10^5).\n\n\n-----Output-----\n\nPrint \"Yes\" if the given lab is good and \"No\" otherwise.\n\nYou can output each letter in upper or lower case.\n\n\n-----Examples-----\nInput\n3\n1 1 2\n2 3 1\n6 4 1\n\nOutput\nYes\n\nInput\n3\n1 5 2\n1 1 1\n1 2 3\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn the first sample test, the 6 in the bottom left corner is valid because it is the sum of the 2 above it and the 4 on the right. The same holds for every number not equal to 1 in this table, so the answer is \"Yes\".\n\nIn the second sample test, the 5 cannot be formed as the sum of an integer in the same row and an integer in the same column. Thus the answer is \"No\".",
        "solutions": "[\"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            return\\nprint(\\\"Yes\\\")\\n\", \"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                return\\nprint(\\\"Yes\\\")\", \"def main():\\n    n = int(input())\\n    a = []\\n    for _ in range(n):\\n        a.append(list(map(int, input().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            e = a[i][j]\\n            if e == 1:\\n                continue\\n            else:\\n                fl = False\\n                for i1 in range(n):\\n                    for j1 in range(n):\\n                        if a[i1][j] + a[i][j1] == e:\\n                            fl = True\\n                            break\\n                    if fl:\\n                        break\\n                if fl:\\n                    continue\\n                else:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\nmain()\", \"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\", \"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\", \"from sys import stdin, stdout\\n\\ndef main():\\n    n = int(stdin.readline())\\n    mat = []\\n    for i in range(n):\\n        mat.append(list(map(int, stdin.readline().split())))\\n    for i in range(n):\\n        for j in range(n):\\n            st = True\\n            for u in range(n):\\n                for k in range(n):\\n                    if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\\n                        st = False\\n                        break\\n                if not st: break\\n            if st:\\n                return False\\n    return True\\n\\n\\nprint('Yes' if main() else 'No')\\n\", \"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\", \"n = int(input())\\ndata = []\\nfor i in range(n):\\n    data += [list(map(int, input().split()))]\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if data[i][j] == 1:\\n            t = True\\n            continue\\n        t = False\\n        for k in range(n):\\n            for m in range(n):\\n                if data[i][k] + data[m][j] == data[i][j]:\\n                    t = True\\n                    break\\n        if not t:\\n            print(\\\"No\\\")\\n            break\\n    if not t:\\n        break\\nif t:\\n    print(\\\"Yes\\\")\\n\", \"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\", \"def solve(g):\\n    for i in range(n):\\n        for j in range(n):\\n            if g[i][j] == 1:continue\\n            for p in range(n):\\n                for q in range(n):\\n                    if p == i or q == j:continue\\n                    if g[i][q] + g[p][j] == g[i][j]:break\\n                else:\\n                    continue\\n                break\\n            else:\\n                return \\\"No\\\"\\n    return \\\"Yes\\\"\\n\\nn = int(input())\\n\\ng = []\\n\\nfor i in range(n):\\n    g.append([int(item) for item in input().split()])\\n    \\nprint(solve(g))\", \"#! 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\", \"#!/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\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom sys import stdin, stdout\\n\\ndef rint():\\n    return list(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            return\\n\\nprint(\\\"Yes\\\")\\n\\n\\n\\n\", \"def int_input():\\n    return list(map(int, input().split()))\\n\\n\\nn = int(input())\\nmatr = [list(int_input()) for i in range(n)]\\n\\ngood = True\\nfor row in range(n):\\n    nums = set(matr[row])\\n    for col in range(n):\\n        num = matr[row][col]\\n        if num == 1:\\n            continue\\n        cur_good = False\\n        for i in range(n):\\n            cur_good |= num - matr[i][col] in nums\\n        good &= cur_good\\n\\nprint('Yes' if good else 'No')\\n\", \"#def proverka(b, k, m, p):\\n#  for i in range()\\n\\nn = int(input()) \\na = []\\nfor i in range(n):\\n    a.append([int(j) for j in input().split()])\\nflag = \\\"Yes\\\" \\nfor i in range(n):\\n  for j in range(n):\\n    if(a[i][j] != 1):\\n      f = False\\n      for k in range(n):\\n        if(f):\\n          break\\n        for z in range(n):\\n          if(a[k][j] + a[i][z] == a[i][j]):\\n            f = True\\n          if(f):\\n            break\\n      if(not(f)):\\n        flag = \\\"No\\\"\\n\\nprint(flag)\", \"n=int(input())\\na=[[0]*n for i in range(n)]\\nf=True\\nd=True\\nfor i in range(n):\\n    a[i]=list(map(int,input().split(\\\" \\\")))\\nfor i in range(n):\\n    for j in range(n):\\n        s=a[i][j]\\n\\n        if s!=1:\\n            f = False\\n            for t in range(n):\\n                if t!=i:\\n                    x=s-a[t][j]\\n                    if x in a[i]:\\n                        f=True\\n        if f==False:\\n            d=False\\nif not d:\\n    print('No')\\nelse:\\n    print('Yes')\", \"n=int(input())\\na=[]\\nfor i in range(n):\\n\\ta.append(list(map(int,input().split())))\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tc=0\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif a[i][j]==a[i][k]+a[l][j]:\\n\\t\\t\\t\\t\\tc=1\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\tif c:\\n\\t\\t\\t\\tbreak\\n\\t\\tif not c:\\n\\t\\t\\tprint('No')\\n\\t\\t\\treturn\\nprint('Yes')\\n\", \"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                return\\nprint('Yes')\", \"n = int(input())\\na = []\\nfor i in range(n):\\n\\ta.append([int(x) for x in input().split()])\\nfor i in range(n):\\n\\tfor j in range(n):\\n\\t\\tif a[i][j]==1:\\n\\t\\t\\tcontinue\\n\\t\\tval = False\\n\\t\\tfor k in range(n):\\n\\t\\t\\tfor l in range(n):\\n\\t\\t\\t\\tif (a[i][k]+a[l][j]==a[i][j]):\\n\\t\\t\\t\\t\\tval = True\\n\\t\\tif val==False:\\n\\t\\t\\tprint(\\\"No\\\")\\n\\t\\t\\treturn\\nprint(\\\"Yes\\\")\\n\\t\\t\\t\\t\\n\\t\\t\\n\", \"from itertools import *\\nn=int(input())\\nf=[list(map(int,input().split())) for _ in range(n)]\\nfor i,j in product(list(range(n)),list(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(list(range(i)), list(range(i+1,n)))))):\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\\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\", \"import sys\\n\\ndef is_good(lab):\\n  n = len(lab)\\n  for i in range(n):\\n    for j in range(n):\\n      v = lab[i][j]\\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))):\\n        return False\\n  return True\\n\\nn = int(input())\\n\\nlab = [[int(i) for i in input().split()] for _ in range(n)]\\n\\nprint('Yes' if is_good(lab) else 'No')\\n\", \"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')\"]",
        "difficulty": "interview",
        "input": "1\n60000\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/821/A"
    },
    {
        "id": 325,
        "task_id": 1697,
        "test_case_id": 1,
        "question": "Fox Ciel is playing a mobile puzzle game called \"Two Dots\". The basic levels are played on a board of size n × m cells, like this:\n\n[Image]\n\nEach cell contains a dot that has some color. We will use different uppercase Latin characters to express different colors.\n\nThe key of this game is to find a cycle that contain dots of same color. Consider 4 blue dots on the picture forming a circle as an example. Formally, we call a sequence of dots d_1, d_2, ..., d_{k} a cycle if and only if it meets the following condition:\n\n  These k dots are different: if i ≠ j then d_{i} is different from d_{j}.  k is at least 4.  All dots belong to the same color.  For all 1 ≤ i ≤ k - 1: d_{i} and d_{i} + 1 are adjacent. Also, d_{k} and d_1 should also be adjacent. Cells x and y are called adjacent if they share an edge. \n\nDetermine if there exists a cycle on the field.\n\n\n-----Input-----\n\nThe first line contains two integers n and m (2 ≤ n, m ≤ 50): the number of rows and columns of the board.\n\nThen n lines follow, each line contains a string consisting of m characters, expressing colors of dots in each line. Each character is an uppercase Latin letter.\n\n\n-----Output-----\n\nOutput \"Yes\" if there exists a cycle, and \"No\" otherwise.\n\n\n-----Examples-----\nInput\n3 4\nAAAA\nABCA\nAAAA\n\nOutput\nYes\n\nInput\n3 4\nAAAA\nABCA\nAADA\n\nOutput\nNo\n\nInput\n4 4\nYYYR\nBYBY\nBBBY\nBBBY\n\nOutput\nYes\n\nInput\n7 6\nAAAAAB\nABBBAB\nABAAAB\nABABBB\nABAAAB\nABBBAB\nAAAAAB\n\nOutput\nYes\n\nInput\n2 13\nABCDEFGHIJKLM\nNOPQRSTUVWXYZ\n\nOutput\nNo\n\n\n\n-----Note-----\n\nIn first sample test all 'A' form a cycle.\n\nIn second sample there is no such cycle.\n\nThe third sample is displayed on the picture above ('Y' = Yellow, 'B' = Blue, 'R' = Red).",
        "solutions": "[\"#!/usr/bin/env python\\n\\nimport sys\\n\\nsys.setrecursionlimit(10000)\\n\\nn, m = list(map(int, input().split(' ')))\\n\\ndef neighbors(i, j):\\n    return [(i+1, j), (i-1, j), (i, j+1), (i, j-1)]\\n\\ndef valid(i, j):\\n    nonlocal n, m\\n    if i < 0 or i >= n or j < 0 or j >= m:\\n        return False\\n    return True\\n\\ndef dfs(f, i, j):\\n    color = f[i][j]\\n    f[i][j] = color.lower()\\n    c = 0\\n    for n, m in neighbors(i, j):\\n        if valid(n, m):\\n            if f[n][m] == color:\\n                cycle_found = dfs(f, n, m)\\n                if cycle_found:\\n                    return True\\n            elif f[n][m] == color.lower():\\n                c += 1\\n    if c > 1:\\n        return True\\n\\n    f[i][j] = None\\n\\n    return False\\n\\nf = []\\nfor i in range(n):\\n    f.append(list(input().strip()))\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if f[i][j]:\\n            cycle_found = dfs(f, i, j)\\n            if cycle_found:\\n                print(\\\"Yes\\\")\\n                return\\n\\nprint(\\\"No\\\")\\n\", \"import sys\\nsys.setrecursionlimit(10000)\\n\\nn, m = map(int, input().split())\\nA = []\\n\\nfor i in range(n):\\n    A.append(input() + '1')\\n\\nA.append('1' * (m + 1))\\nans = 0\\nused = [[False] * m for i in range(n)]\\nB = ''.join(A)\\nB = list(set(B))\\ndef dfs(i, j, b, c):\\n    nonlocal ans\\n    used[i][j] = True\\n    \\n    if A[i - 1][j] == b and c != 3:\\n        if used[i - 1][j]:\\n            ans = 1\\n        else:\\n            dfs(i - 1, j, b, 1)\\n\\n    if A[i][j + 1] == b and c != 4:\\n        if used[i][j + 1]:\\n            ans = 1\\n        else:\\n            dfs(i, j + 1, b, 2)\\n\\n    if A[i + 1][j] == b and c != 1:\\n        if used[i + 1][j]:\\n            ans = 1\\n        else:\\n            dfs(i + 1, j, b, 3)\\n\\n    if A[i][j - 1] == b and c != 2:\\n        if used[i][j - 1]:\\n            ans = 1\\n        else:\\n            dfs(i, j - 1, b, 4)\\n\\nfor i in range(len(B)):\\n    used = [[False] * m for i in range(n)]\\n    if B[i] != '1':\\n        b = B[i]\\n        for x in range(n):\\n            for y in range(m):\\n                if A[x][y] == b and not used[x][y]:\\n                    dfs(x, y, b, -1)\\n\\nif ans == 0:\\n    print('No')\\nelse:\\n    print('Yes')\", \"import math\\nln, cl = (int(x) for x in input().split())\\n\\nin_dt = []\\n\\nfor i in range(ln):\\n    in_dt.append(input())\\n\\ndef is_adj(x_1, y_1, x_2, y_2):\\n    if math.abs(x_2 - x_1) == 1 and y_2 - y_1 == 0:\\n        return True\\n    elif math.abs(y_2 - y_1) == 1 and x_2 - x_1 == 0:\\n        return True\\n    return False\\n\\nch_dt = [[0 for x in range(55)] for y in range(55)]\\n\\ndef neighb(x, y, ln, cl, lst):\\n    res = []\\n    if x - 1 >= 0 and lst[x][y] == lst[x - 1][y]:\\n        res.append((x - 1, y))\\n    if y - 1 >= 0 and lst[x][y] == lst[x][y - 1]:\\n        res.append((x, y - 1))\\n    if x + 1 < ln and lst[x][y] == lst[x + 1][y]:\\n        res.append((x + 1, y))\\n    if y + 1 < cl and lst[x][y] == lst[x][y + 1]:\\n        res.append((x, y + 1))\\n    return res\\n\\npath = []\\n\\ndef go_path(lst, path):\\n    nonlocal ln\\n    nonlocal cl\\n    while True:\\n        if len(path) == 0:\\n            break\\n        cur_x = path[-1][0]\\n        cur_y = path[-1][1]\\n        del path[-1]\\n        #print (cur_x, cur_y)\\n        #print (path)\\n        neighbours = neighb(cur_x, cur_y, ln, cl, lst)\\n        #print(neighbours)\\n        if len(neighbours) != 0:\\n            for neighbour in neighbours:\\n                if neighbour in path:\\n                    return True\\n                # print (\\\"_______\\\")\\n                #print (ch_dt)\\n                #print (neighbour)\\n                #print (\\\"+++++++\\\")\\n                if ch_dt[neighbour[0]][neighbour[1]] == 0: \\n                    path.append(neighbour)\\n                    ch_dt[neighbour[0]][neighbour[1]] = 1\\n        #print(path)\\n    #print (False)\\n    return False\\nfor i in range(ln):\\n    for j in range(cl):\\n        if ch_dt[i][j] == 0:\\n            ch_dt[i][j] = 1\\n            path.append((i, j))\\n            if go_path(in_dt, path):\\n                print (\\\"Yes\\\")\\n                return\\nprint(\\\"No\\\")\\n\", \"n, m = map(int, input().split())\\ntabl = []\\nfor l in range(n):\\n    tabl.append(list(input()))\\ndef lstsos(i, j):\\n    nonlocal n, m\\n    ne = [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]\\n    for l, k in ne:\\n        if 0 <= l < n and 0 <= k < m:\\n            yield (l, k)\\ndef degree(i, j):\\n    deg = 0\\n    for l, k in lstsos(i, j):\\n        deg += (tabl[l][k] == tabl[i][j])\\n    return deg\\nfinished = False\\nwhile not finished:\\n    finished = True\\n    for l in range(n):\\n        for k in range(m):\\n            if tabl[l][k] != 'NO' and degree(l, k) in (0, 1):\\n                tabl[l][k] = 'NO'\\n                finished = False\\ncycle = False\\nfor l in range(n):\\n    for k in range(m):\\n        if tabl[l][k] != 'NO':\\n            cycle = True\\nif cycle:\\n    print (\\\"Yes\\\")\\nelse:\\n    print (\\\"No\\\")\", \"n, m = [int(x) for x in input().split()]\\n\\nfield = [\\\"\\\"] * n\\nlabels = [[0]] * n\\n\\nimport sys\\nsys.setrecursionlimit(10000)\\n\\nfor i in range(n):\\n    field[i] = input().strip()\\n    labels[i] = [0] * m\\n\\ndef is_valid(i, j):\\n    return 0 <= i < n and 0 <= j < m\\n\\n\\ndef dfs(i, j, p, k, cc = 0):\\n    if labels[i][j] == k:\\n        return True\\n    labels[i][j] = k\\n\\n    res = False\\n    dd = [[0, 1], [1, 0], [-1, 0], [0, -1]]\\n    for d in dd:\\n        if is_valid(i + d[0], j + d[1]) and (i + d[0] != p[0] or j + d[1] != p[1]):\\n            if field[i + d[0]][j + d[1]] == field[i][j]:\\n                res = res or dfs(i + d[0], j + d[1], [i, j], k, cc + 1)\\n\\n    return res\\n\\nok = False\\nk = 1\\nfor i in range(n):\\n    for j in range(m):\\n        if labels[i][j] == 0:\\n            ok = ok or dfs(i, j, [i, j], k)\\n            k += 1\\n\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    l = [c for _ in range(n) for c in input()]\\n    neigh = []\\n    for y in range(n):\\n        for x in range(m):\\n            yx = y * m + x\\n            neigh.append([])\\n            if x and l[yx] == l[yx - 1]:\\n                neigh[-1].append(yx - 1)\\n                neigh[-2].append(yx)\\n            if y and l[yx] == l[yx - m]:\\n                neigh[-1].append(yx - m)\\n                neigh[-1 - m].append(yx)\\n    field = [0] * len(l)\\n\\n    def dfs(t):\\n        field[t] = 1\\n        for v in neigh[t]:\\n            if not field[v]:\\n                neigh[v].remove(t)\\n                dfs(v)\\n            elif field[v] == 1:\\n                raise OverflowError\\n        field[t] = 2\\n\\n    for i, flag in enumerate(field):\\n        if not flag:\\n            try:\\n                dfs(i)\\n            except OverflowError:\\n                print('Yes')\\n                return\\n    print('No')\\n\\n\\ndef __starting_point():\\n    import sys\\n\\n    sys.setrecursionlimit(10000)\\n    main()\\n\\n__starting_point()\", \"#f = lambda: input()\\n#file = open(\\\"btest\\\", \\\"r\\\")\\n#f = lambda:file.readline()\\n\\n# n, m = map(int, f().split())\\n\\n# g = []\\n\\n# for i in range(n):\\n#     g.append(f())\\n\\n# disco = [[False for _ in range(m)] for _ in range(n)]\\n\\n# #print(disco)\\n# #print(parent)\\n          \\n# def found_cycle(w):\\n#     nonlocal disco\\n#     s = []\\n#     s.append(w)\\n#     while s:\\n#         v = s.pop()\\n#         if disco[v[0]][v[1]] == False:\\n#             if v[0] > 0 and g[v[0]-1][v[1]] == g[v[0]][v[1]]:\\n#                 s.append([v[0]-1, v[1]])\\n                \\n#             if v[0] < n-1 and g[v[0]+1][v[1]] == g[v[0]][v[1]]:\\n#                 s.append([v[0]+1, v[1]])\\n                \\n#             if v[1] > 0 and g[v[0]][v[1]-1] == g[v[0]][v[1]]:\\n#                 s.append([v[0], v[1]-1])\\n                \\n#             if v[1] < m-1 and g[v[0]][v[1]+1] == g[v[0]][v[1]]:\\n#                 s.append([v[0], v[1]+1])\\n                \\n#         else:\\n#             disco[v[0]][v[1]] = True\\n#     return False\\n\\n# found = False\\n# for i in range(n):\\n#     if found:\\n#         break\\n#     for j in range(m):\\n#         if disco[i][j] == False:\\n#             found = found_cycle([i,j])\\n#             break\\n\\n# if found:\\n#     print (\\\"Yes\\\")\\n# else:\\n#     print (\\\"No\\\")\\n\\n#Editorial\\nimport sys\\nsys.setrecursionlimit(10000)\\n\\n#file = open(\\\"btest\\\", \\\"r\\\")\\n#f = lambda:file.readline()\\nf = lambda:input()\\n\\nn,m = list(map(int, f().split()))\\n\\nmatrix = []\\n\\ndisco = [[0 for _ in range(m)] for _ in range(n)]\\n\\nfor i in range(n):\\n    matrix.append(f())\\n\\ndef valid_node(i, j):\\n    return 0 <= i < n and 0 <= j < m\\n\\ndef dfs(i, j, p, k, cc = 0):\\n    if disco[i][j] == k:\\n        return True\\n    \\n    disco[i][j] = k\\n\\n    res = False\\n    dd = [[0,1], [1,0], [-1,0], [0,-1]]\\n    for d in dd:\\n        if valid_node(i+ d[0], j+d[1]) and (i + d[0] != p[0] or j + d[1] != p[1]):\\n            if matrix[i + d[0]][j+ d[1]] == matrix[i][j]:\\n                res = res or dfs(i + d[0], j+d[1], [i,j], k, cc+1)\\n\\n    return res\\n\\nok = False\\nk = 1\\nfor i in range(n):\\n    for j in range(m):\\n        if disco[i][j] == 0:\\n            ok = ok or dfs(i, j, [i, j], k)\\n            k += 1\\n\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import sys\\n#sys.stdin=open('in.txt')\\nsys.setrecursionlimit(3000)\\nisin = lambda x, y : 0<=x<m and 0<=y<n\\n\\ndef dfs(curx, cury, fax=-1, fay=-1):\\n    nonlocal found\\n    vis[curx][cury]=True\\n    dx=[0, 0,1,-1]\\n    dy=[1,-1,0, 0]\\n    for i in range(4):\\n        newx=curx+dx[i]\\n        newy=cury+dy[i]\\n        if isin(newx,newy) and vis[newx][newy] and G[curx][cury]==G[newx][newy] and not (fax==newx and fay == newy):\\n            found=True\\n        if isin(newx,newy) and not vis[newx][newy] and G[curx][cury]==G[newx][newy] :\\n            dfs(newx,newy,curx, cury)\\n\\nm,n = list(map(int, input().split()))\\nvis=[[False]*n for i in range(m)]\\nfound=False\\nG=[input() for i in range(m)]\\nfor i in range(m):\\n    for j in range(n):\\n        found=False\\n        if not vis[i][j]:\\n            dfs(i,j)\\n        if found:\\n            print('Yes')\\n            return\\n\\nprint('No')\\n\", \"import sys\\n#sys.stdin=open('in.txt')\\nsys.setrecursionlimit(10000)\\nisin = lambda x, y: 0<=x<m and 0<=y<n\\n\\ndef dfs(curx, cury, fax=-1, fay=-1):\\n    nonlocal found\\n    vis[curx][cury]=True\\n    dx=[0, 0, 1, -1]\\n    dy=[1, -1, 0, 0]\\n    for i in range(4):\\n        newx=curx+dx[i]\\n        newy=cury+dy[i]\\n        if isin(newx,newy) and vis[newx][newy] and G[curx][cury]==G[newx][newy] and not (fax == newx and fay == newy):\\n            found=True\\n        if isin(newx,newy) and not vis[newx][newy] and G[curx][cury]==G[newx][newy]:\\n            dfs(newx, newy, curx, cury)   \\n\\nm,n = list(map(int, input().split()))\\nvis=[[False]*n for i in range(m)]\\nfound=False\\nG=[input() for i in range(m)]\\nfor i in range(m):\\n    for j in range(n):\\n        found = False\\n        if not vis[i][j]:\\n            dfs(i, j)\\n        if found:\\n            print('Yes')\\n            return\\nprint('No')    \\n\", \"import sys\\n#sys.stdin=open('in.txt')\\nsys.setrecursionlimit(10000)\\nisin = lambda x, y: 0<=x<m and 0<=y<n\\n\\ndef dfs(curx, cury, fax=-1, fay=-1):\\n    nonlocal found\\n    vis[curx][cury]=True\\n    dx=[0, 0, 1, -1]\\n    dy=[1, -1, 0, 0]\\n    for i in range(4):\\n        newx=curx+dx[i]\\n        newy=cury+dy[i]\\n        if isin(newx,newy) and vis[newx][newy] and G[curx][cury]==G[newx][newy] and not (fax == newx and fay == newy):\\n            found=True\\n            return\\n        if isin(newx,newy) and not vis[newx][newy] and G[curx][cury]==G[newx][newy]:\\n            dfs(newx, newy, curx, cury)   \\n\\nm,n = list(map(int, input().split()))\\nvis=[[False]*n for i in range(m)]\\nfound=False\\nG=[input() for i in range(m)]\\nfor i in range(m):\\n    for j in range(n):\\n        found = False\\n        if not vis[i][j]:\\n            dfs(i, j)\\n        if found:\\n            print('Yes')\\n            return\\nprint('No')    \\n\", \"import sys\\nsys.setrecursionlimit(3000)\\n\\nn,m = map(int, input().split(' '))\\nL = []\\ndx = [-1, 0, 0, 1]\\ndy = [0, -1, 1, 0]\\nfor i in range(n) :\\n    L.append(input())\\n\\ndef dfs(y, x, p_y, p_x, visited) :\\n    nonlocal dx, dy, n, m, L\\n    visited[y][x] = 1\\n    for i in range(4) :\\n        new_y = y + dy[i]\\n        new_x = x + dx[i]\\n        if new_y < 0 or new_y >= n or new_x < 0 or new_x >= m : continue\\n        if new_y == p_y and new_x == p_x : continue\\n        if L[y][x] == L[new_y][new_x] :\\n            if visited[new_y][new_x] == 1: return True\\n            if dfs(new_y, new_x, y, x, visited) : return True\\n    return False\\n\\ndef solve() :\\n    nonlocal n,m,L\\n    visited = [[0 for j in range(m)] for i in range(n)]\\n    for i in range(n) :\\n        for j in range(m) :\\n            if visited[i][j] == 1:continue\\n            if dfs(i, j, -1, -1, visited) :\\n                return True\\n    return False\\n\\nif solve() : print(\\\"Yes\\\")\\nelse : print(\\\"No\\\")\", \"import sys\\n#sys.stdin = open('in.txt')\\nsys.setrecursionlimit(10000)\\nisin = lambda x, y: 0 <= x < n and 0 <= y < m\\n\\ndef dfs(curx, cury, fax = -1, fay = -1):\\n    nonlocal found\\n    vis[curx][cury] = True\\n    dx = [1, -1, 0, 0]\\n    dy = [0, 0, 1, -1]\\n    for i in range(4):\\n        newx = curx + dx[i]\\n        newy = cury + dy[i]\\n        if isin(newx, newy):\\n            if G[curx][cury] == G[newx][newy] and vis [newx][newy] and not (newx == \\n\\nfax and newy == fay):\\n                found = True\\n                print(\\\"Yes\\\")\\n                return\\n            if G[curx][cury] == G[newx][newy] and not vis[newx][newy]:\\n                dfs(newx, newy, curx, cury)\\n\\nn, m = map(int, input().split())\\nvis = [[False] * m for _ in range(n)]\\nG = [input() for _ in range(n)]\\nfound = False\\nfor i in range(n):\\n    for j in range(m):\\n        if not vis[i][j]:\\n            dfs(i, j)\\n        if found:\\n            print('Yes')\\n            return\\nprint('No')\", \"import sys\\ndef dfs(i,j,vis,out,mapp,s=2):\\n    if vis[i][j] and vis[i][j]!= s-1:\\n        return True\\n    t=[(0,1),(1,0),(-1,0),(0,-1)]\\n    vis[i][j]=s\\n    out[i][j]=True\\n    for k in t:\\n        try:\\n            (u,v)=(k[0]+i,k[1]+j)\\n            if u<0 or v<0:\\n                continue\\n            if vis[u][v]!=s-1 and mapp[u][v]==mapp[i][j] and dfs(u,v,vis,out,mapp,s+1):\\n                return True\\n        except Exception:\\n            pass\\n    vis[i][j]=0\\n    return False\\nsys.setrecursionlimit(2500)\\n(n,m)=input().split()\\n(n,m)=(int(n),int(m))\\nexist=set()\\nmapp=[0 for i in range(n)]\\nfor i in range(n):\\n    mapp[i]=input()\\nfor i in range(n):\\n    for j in range(m):\\n        exist.add(mapp[i][j])\\nkey=0\\nt=[(0,1),(1,0),(-1,0),(0,-1)]\\nout=[[False for i in range(m)] for j in range(n)]\\nfor c in exist:\\n    if key:\\n        break\\n    vis=[[0 for i in range(m)] for j in range(n)]\\n    for i in range(n):\\n        if key:\\n            break\\n        for j in range(m):\\n            if key:\\n                break\\n            if mapp[i][j]==c and not out[i][j] and dfs(i,j,vis,out,mapp):\\n                key=1\\n                break\\nif key:\\n    print('Yes')\\nelse:\\n    print('No')\\n                            \\n                \\n\", \"def q():\\n    n,m=map(int,input().split())\\n    p=[k for _ in range(n) for k in input()]\\n    w=[]\\n    for z in range(n):\\n        for j in range(m):\\n            ds=z*m+j\\n            w.append([])\\n            if j and p[ds]==p[ds-1]:\\n                w[-1].append(ds-1)\\n                w[-2].append(ds)\\n            if z and p[ds]==p[ds-m]:\\n                w[-1].append(ds-m)\\n                w[-1-m].append(ds)\\n    pol=[0]*len(p)\\n    def zss(g):\\n            pol[g]=1\\n            for f in w[g]:\\n                if not pol[f]:\\n                    w[f].remove(g)\\n                    zss(f)\\n                elif pol[f]==1:\\n                    raise OverflowError\\n            pol[g]=2\\n    for i,flag in enumerate(pol):\\n        if not flag:\\n            try:\\n                zss(i)\\n            except OverflowError:\\n                print('Yes')\\n                return\\n    print('No')\\nif 1==1:\\n    import sys\\n    sys.setrecursionlimit(10000)\\n    q()\", \"t, u = list(map(int, input().split(' ')))\\n\\ndef ok(x, y, inx):\\n    if not (0 <= x <= t-1 and 0 <= y <= u-1):\\n        return False\\n    if not inx[x][y]:\\n        return False\\n    return True\\n        \\n\\n\\ndef dfs(graph, start, path=[]):\\n    inx = [[False] * u for _ in range(t)]\\n    for i in graph:\\n        a, b = i[0], i[1]\\n        inx[a][b] = True\\n    visited = [[False] * u for _ in range(t)]\\n    parent = [[0] * u for _ in range(t)]\\n    \\n    q=[start]\\n    \\n    while q:\\n        \\n        bd = q.pop(0)\\n        a = bd[0]\\n        b = bd[1]\\n\\n        if not visited[a][b]:\\n            for bad in [(a-1, b), (a, b-1), (a+1, b), (a, b+1)]:\\n                x = bad[0]\\n                y = bad[1]\\n                if ok(x, y, inx):\\n                    if visited[x][y] and (x, y) != parent[a][b]:\\n                        return True\\n                    q=[(x, y)]+q\\n                    parent[x][y] = (a, b)\\n            visited[a][b] = True\\n    return False\\n\\ngraph = {}\\nfor i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\\n    graph[i] = []\\n\\nfor i in range(t):\\n    x = input()\\n    for j in range(u):\\n        graph[x[j]].append((i, j))\\n\\ngraph2 = {}\\nfor i in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\\n    if graph[i] != []:\\n        graph2[i] = graph[i]\\n\\nfor i in graph2:\\n    for e in graph2[i]:\\n        if dfs(graph2[i], e):\\n            print(\\\"Yes\\\")\\n            quit()\\n\\n\\nprint(\\\"No\\\")\\n\", \"import sys\\nsys.setrecursionlimit(10000)\\n\\ndef f(i, j):\\n    return -1 < i < n and -1 < j < m\\n\\n\\ndef dfs(c, r, l):\\n    used[c][r] = 1\\n    for (i, j) in {(0, 1), (-1, 0), (1, 0), (0, -1)}:\\n        if f(c + i, r + j) and a[c + i][r + j] == a[c][r]:\\n            if used[c + i][r + j] == 0:\\n                prev[c + i][r + j] = (c, r)\\n                dfs(c + i, r + j, l + 1)\\n            elif used[c + i][r + j] == 1 and prev[c][r] != (c + i, r + j):\\n                nonlocal s \\n                s = \\\"Yes\\\"\\n    used[i][j] = 2\\n            \\n\\n\\nn, m = map(int, input().split())\\na = []\\ns = \\\"No\\\"\\nfor i in range(n):\\n    a.append(list(input().rstrip()))\\n\\nused = [[0 for i in range(m)] for i in range(n)]\\nprev = [[-1 for i in range(m)] for i in range(n)]\\nfor i in range(n):\\n    for j in range(m):\\n        if used[i][j] == 0:\\n            dfs(i, j, 0)\\nprint(s)\", \"import sys\\nsys.setrecursionlimit(10000)\\n\\nn,m = map(int, input().split())\\n\\nboard = []\\nfor _ in range(n):\\n    board.append(input().rstrip())\\n\\nvisited = [[False for _ in range(m)] for _ in range(n)]\\nfoundCycle = False\\n    \\ndx = [1,-1,0,0]\\ndy = [0,0,1,-1]\\n\\ndef dfs(x, y, fromX, fromY, color):\\n    nonlocal board, visited, foundCycle\\n\\n    if x < 0 or x >= n or y < 0 or y >= m: \\n        return\\n    if board[x][y] != color: \\n        return\\n\\n    if visited[x][y]:\\n        foundCycle = True\\n        return\\n    \\n    visited[x][y] = True\\n    for f in range(4):\\n        nextX = x + dx[f]\\n        nextY = y + dy[f]\\n        if nextX == fromX and nextY == fromY:\\n            continue\\n        dfs(nextX, nextY, x, y, color)\\n        \\nfor i in range(n):\\n    for j in range(m):\\n        if not visited[i][j]:\\n            dfs(i,j,-1,-1, board[i][j])\\nprint(\\\"Yes\\\" if foundCycle else \\\"No\\\")\", \"msg_in = input().split()\\nx = int(msg_in[0])\\ny = int(msg_in[1])\\nnum_of_transform = [0, 0]\\nmatrix = []\\nblank = []\\nfor i in range(y+2):\\n    blank.append(' ')\\nmatrix.append(blank)\\nfor i in range(x):\\n    msg_in = input()\\n    matrix.append([' '])    \\n    for j in msg_in:\\n        matrix[i+1].append(j)\\n    matrix[i+1].append(' ')\\nmatrix.append(blank)\\nwhile True:\\n    for i in range(1, x + 1):\\n        for j in range(1, y + 1):\\n            sum = 0\\n            if matrix[i][j] != ' ':\\n                if matrix[i][j-1] == matrix[i][j]:\\n                    sum += 1\\n                if matrix[i][j+1] == matrix[i][j]:\\n                    sum += 1\\n                if matrix[i-1][j] == matrix[i][j]:\\n                    sum += 1\\n                if matrix[i+1][j] == matrix[i][j]:\\n                    sum += 1\\n                if sum < 2:\\n                    matrix[i][j] = ' '\\n                    num_of_transform[0] += 1\\n    if num_of_transform[0] == x * y:\\n        print('No')\\n        break\\n    elif num_of_transform[0] == num_of_transform[1]:\\n        print('Yes')\\n        break\\n    else:\\n        num_of_transform[1] = num_of_transform[0]\\n\", \"# 510B\\nimport string\\n\\n__author__ = 'artyom'\\n\\nn, m = map(int, input().split())\\ngraph = []\\nfor _ in range(n):\\n  graph.append(input())\\n\\n\\ndef neighbours(vertex, colour):\\n  x, y = vertex\\n  res = []\\n  if x > 0 and graph[x - 1][y] == colour:\\n    res.append((x - 1, y))\\n  if y > 0 and graph[x][y - 1] == colour:\\n    res.append((x, y - 1))\\n  if x < n - 1 and graph[x + 1][y] == colour:\\n    res.append((x + 1, y))\\n  if y < m - 1 and graph[x][y + 1] == colour:\\n    res.append((x, y + 1))\\n  return res\\n\\n\\ndef find_cycle(colour, start):\\n  visited = set()\\n  stack = [(start, None)]\\n  while stack:\\n    v, parent = stack.pop()\\n    if v in visited:\\n      return set()\\n    visited.add(v)\\n    for u in neighbours(v, colour):\\n      if u != parent:\\n        stack.append((u, v))\\n  return visited\\n\\n\\nfor c in string.ascii_uppercase:\\n  visited = set()\\n  for i in range(n):\\n    for j in range(m):\\n      if (i, j) not in visited and graph[i][j] == c:\\n        t = find_cycle(c, (i, j))\\n        if not t:\\n          print('Yes')\\n          return\\n        visited |= t\\n\\nprint('No')\", \"# 510B\\n__author__ = 'artyom'\\n\\nn, m = map(int, input().split())\\ngraph = []\\nfor _ in range(n):\\n  graph.append(input())\\n\\n\\ndef neighbours(vertex, colour):\\n  x, y = vertex\\n  res = []\\n  if x > 0 and graph[x - 1][y] == colour:\\n    res.append((x - 1, y))\\n  if y > 0 and graph[x][y - 1] == colour:\\n    res.append((x, y - 1))\\n  if x < n - 1 and graph[x + 1][y] == colour:\\n    res.append((x + 1, y))\\n  if y < m - 1 and graph[x][y + 1] == colour:\\n    res.append((x, y + 1))\\n  return res\\n\\n\\ndef find_cycle(x, y):\\n  colour = graph[x][y]\\n  visited = set()\\n  stack = [((x, y), None)]\\n  while stack:\\n    v, parent = stack.pop()\\n    if v in visited:\\n      return set()\\n    visited.add(v)\\n    for u in neighbours(v, colour):\\n      if u != parent:\\n        stack.append((u, v))\\n  return visited\\n\\n\\nvisited = set()\\nfor i in range(n):\\n  for j in range(m):\\n    if (i, j) not in visited:\\n      t = find_cycle(i, j)\\n      if not t:\\n        print('Yes')\\n        return\\n      visited |= t\\n\\nprint('No')\", \"# coding=utf-8\\nimport sys\\n\\nsys.setrecursionlimit(10000)\\ng = []\\n\\nn, m = list(map(int, input().split()))\\nidx = [[False for i in range(m)] for j in range(n)]\\nfor k in range(n):\\n    g.append(input())\\n\\n\\ndef dfs(i, j, li, lj):\\n    idx[i][j] = True\\n    if i + 1 < n and g[i][j] == g[i + 1][j]:\\n        if idx[i + 1][j] is False:\\n            return dfs(i + 1, j, i, j)\\n        elif not (li == i and lj == j) and i + 1 != li:\\n            return 'Yes'\\n    if i - 1 >= 0 and g[i][j] == g[i - 1][j]:\\n        if idx[i - 1][j] is False:\\n            return dfs(i - 1, j, i, j)\\n        elif not (li == i and lj == j) and i - 1 != li:\\n            return 'Yes'\\n    if j - 1 >= 0 and g[i][j] == g[i][j - 1]:\\n        if idx[i][j - 1] is False:\\n            return dfs(i, j - 1, i, j)\\n        elif not (li == i and lj == j) and j - 1 != lj:\\n            return 'Yes'\\n    if j + 1 < m and g[i][j] == g[i][j + 1]:\\n        if idx[i][j + 1] is False:\\n            return dfs(i, j + 1, i, j)\\n        elif not (li == i and lj == j) and j + 1 != lj:\\n            return 'Yes'\\n    return None\\n\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if not idx[i][j]:\\n            ans = dfs(i, j, i, j)\\n            if ans:\\n                print(ans)\\n                break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('No')\\n\", \"#A\\n'''\\nn, m = map(int, input().split())\\nrow = ['#' * m if i % 2 == 0 else '.' * (m - 1) + '#' if i % 4 == 1\\n       else '#' + '.' * (m - 1) for i in range(n)]\\nprint('\\\\n'.join(row))\\n'''\\n#B\\nimport sys\\nsys.setrecursionlimit(5000)\\nn, m = list(map(int, input().split()))\\ndx = [-1, 0, 0, 1]\\ndy = [0, -1, 1, 0]\\nL = list(input() for i in range(n))\\n\\ndef check(x, y, px, py):\\n    return (x >= 0 and x < n and y >= 0 and y < m)\\n            \\n\\ndef DFS(x, y, px, py, visited):\\n    #print(x, y, px, py, '\\\\n', visited)\\n    visited[x][y] = True\\n    for i in range(4):\\n        newx = x + dx[i]\\n        newy = y + dy[i]\\n        if not check(newx, newy, px, py): continue\\n        if (newx == px and newy == py): continue\\n        #print('Bug ', visited)\\n        if L[x][y] == L[newx][newy]:\\n            if visited[newx][newy]:\\n                #print('Here True', newx, newy, x, y)\\n                return True\\n            if DFS(newx, newy, x, y, visited):\\n                #print(newx, newy, x, y, visited)\\n                return True\\n    return False\\n        \\ndef solve():\\n#    visited = [[False] * m] * n\\n    visited = [[False for j in range(m)] for i in range(n)]    \\n    for i in range(n):\\n        for j in range(m):\\n            if visited[i][j]: continue\\n            if DFS(i, j, -1, -1, visited): return True\\n    return False\\n\\nprint('Yes' if solve() else 'No')\\n'''\\n3 3\\nAAA\\nABA\\nABA\\n'''\\n\"]",
        "difficulty": "interview",
        "input": "3 4\nAAAA\nABCA\nAAAA\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/510/B"
    },
    {
        "id": 326,
        "task_id": 2370,
        "test_case_id": 2,
        "question": "In Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n - People traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n - Different roads may have had different lengths, but all the lengths were positive integers.\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\n-----Constraints-----\n - 1 \\leq N \\leq 300\n - If i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n - A_{i, i} = 0\n\n-----Inputs-----\nInput is given from Standard Input in the following format:\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\n-----Outputs-----\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\n-----Sample Input-----\n3\n0 1 3\n1 0 2\n3 2 0\n\n-----Sample Output-----\n3\n\nThe network below satisfies the condition:\n - City 1 and City 2 is connected by a road of length 1.\n - City 2 and City 3 is connected by a road of length 2.\n - City 3 and City 1 is not connected by a road.",
        "solutions": "[\"from scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nimport numpy as np\\n\\nn = int(input())\\na = np.array([list(map(int, input().split())) for _ in range(n)])\\n\\ng = csr_matrix(a)\\ndist = floyd_warshall(g)\\n\\nif (dist == a).all():\\n    sm = a.sum()\\n\\n    INF = 10 ** 18 + 1\\n    for i in range(n):\\n        a[i, i] = INF\\n\\n    for u in range(n):\\n        for v in range(n):\\n            if u == v:\\n                continue\\n\\n            mn = np.min(a[u] + a[v])\\n            if mn == a[u, v]:\\n                sm -= a[u, v]\\n\\n    ans = sm // 2\\n    print(ans)\\n\\nelse:\\n    print((-1))\\n\", \"import sys\\n\\nimport numpy as np\\n\\nsys.setrecursionlimit(10000)\\nINF = float('inf')\\n\\nN = int(sys.stdin.readline())\\nA = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]\\nA = np.array(A, dtype=float) + np.diag([np.inf] * N)\\n\\nuseless = np.zeros((N, N), dtype=bool)\\nimpossible = np.zeros((N, N), dtype=bool)\\nfor via in range(N):\\n    # R[i][j]: i -> via -> j \\u306e\\u8ddd\\u96e2\\n    R = sum(np.meshgrid(A[via], A[via]))\\n    useless |= R == A\\n    impossible |= R < A\\n\\nif (impossible ^ np.eye(N, dtype=bool)).sum():\\n    print((-1))\\nelse:\\n    print((int(A[~useless].sum() // 2)))\\n\", \"import sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\n\\nN = ir()\\nINF = 10 ** 9\\nA = np.array([lr() for _ in range(N)])\\nnp.fill_diagonal(A, INF)\\nanswer = 0\\nfor i in range(N-1):\\n    for j in range(i+1, N):\\n        detour = np.min(A[i]+A[j])\\n        if detour > A[i, j]:\\n            answer += A[i, j]\\n        elif detour < A[i, j]:\\n            print((-1))\\n            return\\n\\nprint(answer)\\n# 38\\n\", \"import sys\\nimport numpy as np\\n\\nread = sys.stdin.read\\n\\nN, *A = list(map(int, read().split()))\\nA = np.array(A, np.int64).reshape(N, N)\\n'''\\nanswer = 0\\nfor i, j in product(range(N), repeat=2):\\n    if i < j:\\n        continue\\n    edge = A[i][j]\\n    for k in range(N):\\n        if i == k or j == k:\\n            continue\\n\\n        tmp = A[i][k] + A[k][j]\\n        if tmp < edge:\\n            print(-1)\\n            return\\n        elif tmp == edge:\\n            break\\n    else:\\n        answer += edge\\n'''\\n\\nuseless = np.zeros_like(A)\\n\\nfor i in range(N):\\n    grid = A[i] + A[i, None].T\\n    if np.any(grid < A):\\n        print((-1))\\n        return\\n    grid[i] = np.inf\\n    grid[:, i] = np.inf\\n\\n    useless |= (A == grid)\\n\\nprint((A[useless != 1].sum() // 2))\\n\", \"from numpy import *\\nN = int(input())\\nA = array([input().split() for _ in range(N)], dtype=int64).reshape(N,N)\\n\\nfill_diagonal(A, 10**9)\\n\\nans = 0\\nfor i in range(N):\\n  for j in range(i+1,N):\\n    d = min(A[i]+A[j])\\n    if A[i][j] < d:\\n      ans += A[i][j]\\n    elif d < A[i][j]:\\n      print((-1))\\n      return\\n\\nprint(ans)\\n\", \"import scipy.sparse as s,numpy as n\\nf=n.loadtxt(open(0),skiprows=1)\\ng=s.csgraph.dijkstra(f)\\nh=n.where(g,g,1)\\nprint(int(sum(t[j]*all(t[j]<t+h[j])for i,t in enumerate(h)for j in range(i)))*(f==g).all()or-1)\", \"import math\\nimport numpy as np\\nimport decimal\\nimport collections\\nimport itertools\\nimport sys\\nimport random\\n#Union-Find\\nclass UnionFind():\\n    def __init__(self, n):\\n        self.n = n\\n        self.par = list(range(self.n))\\n        self.rank = [1] * n\\n        self.count = n\\n    def find(self, x):\\n        if self.par[x] == x:\\n            return x\\n        else:\\n            self.par[x] = self.find(self.par[x])\\n            return self.par[x]\\n    def unite(self, x, y):\\n        p = self.find(x)\\n        q = self.find(y)\\n        if p == q:\\n            return None\\n        if p > q:\\n            p, q = q, p\\n        self.rank[p] += self.rank[q]\\n        self.par[q] = p\\n        self.count -= 1\\n    def same(self, x, y):\\n        return self.find(x) == self.find(y)\\n    def size(self, x):\\n        return self.rank[x]\\n    def count(self):\\n        return self.count\\n\\n#\\u7d20\\u6570\\u95a2\\u9023\\ndef prime_numbers(x):\\n    if x < 2:\\n        return []\\n    prime_numbers = [i for i in range(x)]\\n    prime_numbers[1] = 0\\n    for prime_number in prime_numbers:\\n        if prime_number > math.sqrt(x):\\n            break\\n        if prime_number == 0:\\n            continue\\n        for composite_number in range(2 * prime_number, x, prime_number):\\n            prime_numbers[composite_number] = 0\\n    return [prime_number for prime_number in prime_numbers if prime_number != 0]\\ndef is_prime(x):\\n    if x < 2:\\n        return False\\n    if x == 2 or x == 3 or x == 5:\\n        return True\\n    if x % 2 == 0 or x % 3 == 0 or x % 5 == 0:\\n        return False\\n    prime_number = 7\\n    difference = 4\\n    while prime_number <= math.sqrt(x):\\n        if x % prime_number == 0:\\n            return False\\n        prime_number += difference\\n        difference = 6 - difference\\n    return True\\n#Prime-Factorize\\ndef prime_factorize(n):\\n    res = []\\n    while n % 2 == 0:\\n        res.append(2)\\n        n //= 2\\n    f = 3\\n    while f ** 2 <= n:\\n        if n % f == 0:\\n            res.append(f)\\n            n //= f\\n        else:\\n            f += 2\\n    if n != 1:\\n        res.append(n)\\n    return res\\n#nCr\\nmod = 10 ** 9 + 7\\nclass counting:\\n    def __init__(self, n):\\n        self.n = n\\n        self.fa = [1] * (self.n + 1)\\n        self.fi = [1] * (self.n + 1)\\n        for i in range(1, self.n + 1):\\n            self.fa[i] = self.fa[i - 1] * i % mod\\n            self.fi[i] = pow(self.fa[i], mod - 2, mod)\\n    def comb(self, n, r):\\n        if n < r:return 0\\n        if n < 0 or r < 0:return 0\\n        return self.fa[n] * self.fi[r] % mod * self.fi[n - r] % mod\\n    def per(self, n, r):\\n        if n < r:return 0\\n        if n < 0 or r < 0:return 0\\n        return self.fa[n] * self.fi[n - r] % mod\\n#\\u62e1\\u5f35Euclid\\u306e\\u4e92\\u9664\\u6cd5\\ndef extgcd(a, b, d = 0):\\n    g = a\\n    if b == 0:\\n        x, y = 1, 0\\n    else:\\n        x, y, g = extgcd(b, a % b)\\n        x, y = y, x - a // b * y\\n    return x, y, g\\n#BIT\\nclass BinaryIndexedTree():\\n    def __init__(self, n):\\n        self.n = n\\n        self.BIT = [0] * (self.n + 1)\\n    def add(self, i, x):\\n        while i <= self.n:\\n            self.BIT[i] += x\\n            i += i & -i\\n    def query(self, i):\\n        res = 0\\n        while i > 0:\\n            res += self.BIT[i]\\n            i -= i & -i\\n        return res\\n#Associative Array\\nclass AssociativeArray():\\n    def __init__(self, q):\\n        self.dic = dict()\\n        self.q = q\\n    def solve(self):\\n        for i in range(self.q):\\n            Query = list(map(int, input().split()))\\n            if Query[0] == 0:\\n                x, y, z = Query\\n                self.dic[y] = z\\n            else:\\n                x, y = Query\\n                if y in self.dic:\\n                    print(self.dic[y])\\n                else:\\n                    print(0)\\n#Floor Sum\\ndef floor_sum(n, m, a, b):\\n    res = 0\\n    if a >= m:\\n        res += (n - 1) * n * (a // m) // 2\\n        a %= m\\n    if b >= m:\\n        res += n * (b // m)\\n        b %= m\\n    y_max = (a * n + b) // m\\n    x_max = y_max * m - b\\n    if y_max == 0:\\n        return res\\n    res += y_max * (n + (-x_max // a))\\n    res += floor_sum(y_max, a, m, (a - x_max % a) % a)\\n    return res\\n#Z-Algorithm\\ndef z_algorithm(s):\\n    str_len = len(s)\\n    res = [0] * str_len\\n    res[str_len - 1] = str_len\\n    i, j = 1, 0\\n    while i < str_len:\\n        while i + j < str_len and s[i + j] == s[j]:\\n            j += 1\\n        res[i] = j\\n        if j == 0:\\n            i += 1\\n            continue\\n        k = 1\\n        while i + k < str_len and j > res[k] + k:\\n            res[i + k] = res[k]\\n            k += 1\\n        i += k\\n        j -= k\\n    return res\\nclass Manacher():\\n    def __init__(self, s):\\n        self.s = s\\n    def coustruct(self):\\n        i, j = 0, 0 \\n        s_len = len(self.s)\\n        res = [0] * s_len\\n        while i < s_len:\\n            while i - j >= 0 and i + j < s_len and self.s[i - j] == self.s[i + j]:\\n                j += 1\\n            res[i] = j\\n            k = 1\\n            while i - k >= 0 and k + res[i - k] < j:\\n                k += 1\\n            i += k\\n            j -= k\\n#mod-sqrt\\ndef mod_sqrt(a, p):\\n    if a == 0:\\n        return 0\\n    if p == 2:\\n        return 1\\n    k = (p - 1) // 2\\n    if pow(a, k, p) != 1:\\n        return -1\\n    while True:\\n        n = random.randint(2, p - 1)\\n        r = (n ** 2 - a) % p\\n        if r == 0:\\n            return n\\n        if pow(r, k, p) == p - 1:\\n            break\\n    k += 1\\n    w, x, y, z = n, 1, 1, 0\\n    while k:\\n        if k % 2:\\n            y, z = w * y + r * x * z, x * y + w * z\\n        w, x = w * w + r * x * x, 2 * w * x\\n        w %= p\\n        x %= p\\n        y %= p\\n        z %= p\\n        k >>= 1\\n    return y\\nclass SegmentTree:\\n    def __init__(self, lis, ele, op):\\n        self.len = len(lis)\\n        self.n = 1 << ((self.len - 1).bit_length())\\n        self.op = op\\n        self.ele = ele\\n        self.tree = self._build(lis)\\n    def _build(self, lis):\\n        res_tree = [self.ele] * (self.n - 1) + lis + [self.ele] * (self.n - self.len)\\n        for i in range(self.n - 2, -1, -1):\\n            res_tree[i] = self.op(res_tree[i * 2 + 1], res_tree[i * 2 + 2])\\n        return res_tree\\n    def __get__(self, i):\\n        return self.tree[self.n + i - 1]\\n    def update(self, i, x):\\n        i += self.n - 1\\n        self.tree[i] = x\\n        while i > 0:\\n            i -= 1\\n            i >>= 1\\n            self.tree[i] = self.op(self.tree[i * 2 + 1], self.tree[i * 2 + 2])\\n    def query(self, l, r):\\n        l +=  self.n - 1\\n        r += self.n - 1\\n        L = self.ele\\n        R = self.ele\\n        while l < r:\\n            if l & 1 == 0:\\n                L = self.op(L, self.tree[l])\\n                l += 1\\n            if r & 1 == 0:\\n                r -= 1\\n                R = self.op(R, self.tree[r])\\n            l -= 1\\n            l >>= 1\\n            r >>= 1\\n        return self.op(L, R)\\ndef compress(l):\\n    n = len(l)\\n    sorted_list = sorted(set(l))\\n    d = {sorted_list[i]: i for i in range(len(sorted_list))}\\n    return [d[i] for i in l]\\nclass WeightedUnionFind:\\n    def __init__(self, n):\\n        self.n = n\\n        self.par = list(range(n))\\n        self.rank = [0] * n\\n        self.weight = [0] * n\\n    def find(self, x):\\n        if self.par[x] == x:\\n            return x\\n        else:\\n            y = self.find(self.par[x])\\n            self.weight[x] += self.weight[self.par[x]]\\n            self.par[x] = y\\n            return y\\n    def unite(self, x, y, w):\\n        p, q = self.find(x), self.find(y)\\n        if self.rank[p] < self.rank[q]:\\n            self.par[p] = q\\n            self.weight[p] = w - self.weight[x] + self.weight[y]\\n        else:\\n            self.par[q] = p\\n            self.weight[q] = -w - self.weight[y] + self.weight[x]\\n            if self.rank[p] == self.rank[q]:\\n                self.rank[p] += 1\\n    def same(self, x, y):\\n        return self.find(x) == self.find(y)\\n    def diff(self, x, y):\\n        return self.weight[x] - self.weight[y]\\nimport numpy as np\\nn = int(input())\\na = [np.array(list(map(int, input().split()))) for i in range(n)]\\nans = sum([sum(a[i]) for i in range(n)]) // 2\\nfor i in range(n):\\n    a[i][i] = 10 ** 9\\nfor i in range(n - 1):\\n    for j in range(i + 1, n):\\n        m = min(a[i] + a[j])\\n        if m < a[i][j]:\\n            print(-1);return()\\n        if m == a[i][j]:\\n            ans -= a[i][j]\\nprint(ans)\", \"N = int(input())\\ndic = [0]*N\\ndist = [[0]*N for i in range(N)]\\nfor i in range(N):\\n  dic[i] = [int(c) for c in input().split()]\\n  for j in range(N):\\n    dist[i][j] = dic[i][j]\\n  dic[i][i] = float('inf')\\n\\nans = 0\\nfor i in range(N):\\n  for j in range(i):\\n    d = min(a+b for a, b in zip(dic[i],dic[j]))\\n    if d<dic[i][j]:\\n      print(-1)\\n      return\\n    elif d>dic[i][j]:\\n      ans += dic[i][j]\\nprint(ans)\", \"N = int(input())\\nA = [list(map(int,input().split())) for i in range(N)]\\n\\nfrom scipy.sparse.csgraph import floyd_warshall as fw\\nimport numpy as np\\na = fw(A)\\nans = 0\\nfor i in range(N):\\n    a[i][i] = np.inf\\nfor i in range(N):\\n    for j in range(i):\\n        if A[i][j]!=a[i][j]:\\n            print(-1)\\n            return\\n        else:\\n            if a[i][j] < np.min(a[i]+a[j]):\\n                ans += a[i][j]\\nprint(int(ans))\", \"import sys\\n\\nimport numpy as np\\n\\nsys.setrecursionlimit(10000)\\nINF = float('inf')\\n\\nN = int(sys.stdin.readline())\\nA = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]\\n\\nA = np.array(A, dtype=float)\\n\\nuseless = np.zeros((N, N), dtype=bool)\\nimpossible = np.zeros((N, N), dtype=bool)\\nfor via in range(N):\\n    # R[i][j]: i -> via -> j \\u306e\\u8ddd\\u96e2\\n    R = sum(np.meshgrid(A[via], A[via]))\\n    R[via] = np.inf\\n    R[:, via] = np.inf\\n    useless |= R == A\\n    impossible |= R < A\\nif impossible.sum():\\n    print((-1))\\nelse:\\n    print((int(A[~useless].sum() // 2)))\\n\", \"import numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\nN = int(input())\\nA = [[int(x) for x in input().split()] for _ in range(N)]\\n\\nif np.any(A != floyd_warshall(A)):\\n    print((-1))\\nelse:\\n    ans = 0\\n    A += np.diag([float('inf')] * N)\\n    for i in range(N):\\n        for j in range(i + 1, N):\\n            if np.min(A[i] + A[j]) != A[i, j]:\\n                ans += int(A[i, j])\\n    print(ans)\\n\", \"import numpy as np\\nimport sys\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\n\\ndef main():\\n    N = int(readline())\\n    A = np.array(read().split(), dtype=np.int64).reshape(N,N)\\n\\n    INF = 10**15\\n    ans = 0\\n    for i in range(N):\\n        B = A[i,:] + A\\n        np.fill_diagonal(B, INF)\\n        B[:,i] = INF\\n        C = B.min(axis=1)\\n        C[i] = 0\\n\\n        if (C < A[i,:]).sum() > 0:\\n            print((-1))\\n            return\\n        else:\\n            index = C > A[i,:]\\n            ans += A[i, index].sum()\\n\\n    print((ans // 2))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nimport sys\\n\\n\\ndef solve(N: int, A: \\\"List[List[int]]\\\"):\\n    import numpy as np\\n    from scipy.sparse.csgraph import floyd_warshall\\n    A = np.array(A, dtype=np.float64)\\n    B = floyd_warshall(A, directed=True)\\n    if not np.array_equal(A, B):\\n        return -1\\n    delta = 1e-1\\n    _, pre = floyd_warshall(A-delta, return_predecessors=True)\\n    return int(A[pre == [[i]*N for i in range(N)]].sum()) // 2\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    N = int(next(tokens))  # type: int\\n    A = [[int(next(tokens)) for _ in range(N)] for _ in range(N)]  # type: \\\"List[List[int]]\\\"\\n    print((solve(N, A)))\\n\\ndef test():\\n    import doctest\\n    doctest.testmod()\\n\\ndef __starting_point():\\n    #test()\\n    main()\\n\\n__starting_point()\", \"import sys\\nimport numpy as np\\n\\ndef main():\\n    input = sys.stdin.readline\\n    N = int(input())\\n    A = np.array([list(map(int, input().split())) for i in range(N)])\\n    #A = [list(map(int, input().split())) for _ in range(N)]\\n    #A = np.array(A)\\n\\n    INF = 10**10\\n    for i in range(N):\\n        A[i][i] = INF\\n\\n    ans = 0\\n    for i in range(N):\\n        for j in range(i):\\n            #bipas = min(map(sum, zip(A[i], A[j])))\\n            bipas = np.min(A[i] + A[j])\\n\\n            if A[i][j] > bipas:\\n                print((-1))\\n                return 0\\n            elif A[i][j] < bipas:\\n                ans += A[i][j]\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5c0f\\u3055\\u3044\\u8ddd\\u96e2\\u304b\\u3089\\u898b\\u3066\\u3044\\u304f\\n# \\u65e2\\u306b\\u4f5c\\u3063\\u305f\\u9053\\u306e\\u7bc4\\u56f2\\u3067\\u3001\\u4efb\\u610f\\u306e2\\u70b9\\u306e\\u6700\\u77ed\\u8ddd\\u96e2\\u3092\\u6301\\u3063\\u3066\\u304a\\u304f\\n# \\u65e2\\u5b58\\u306e\\u6700\\u77ed\\u8ddd\\u96e2\\u3088\\u308a\\u5927\\u304d\\u3044\\uff1a\\u77db\\u76fe\\n# \\u65e2\\u5b58\\u306e\\u6700\\u77ed\\u8ddd\\u96e2\\u3068\\u7b49\\u3057\\u3044\\uff1a\\u5897\\u3084\\u3057\\u3066\\u3082\\u4f55\\u3082\\u5909\\u308f\\u3089\\u305a\\n# \\u65e2\\u5b58\\u306e\\u6700\\u77ed\\u8ddd\\u96e2\\u3088\\u308a\\u5c0f\\u3055\\u3044\\uff1a\\u8ffd\\u52a0\\u3059\\u308b\\u5fc5\\u8981\\u3042\\u308a\\n\\nimport numpy as np\\nN = int(input())\\nA = [[int(x) for x in input().split()] for _ in range(N)]\\n\\nedge = []\\n\\nfor i in range(N):\\n  for j in range(i):\\n    edge.append((A[i][j],j,i))\\nedge.sort()\\n\\nINF = 10**18\\ndist = np.full((N,N),INF,dtype=np.int64) - np.eye(N,dtype=np.int64)*INF\\n\\nanswer = 0\\nfor d,x,y in edge:\\n  if d > dist[x,y]:\\n    answer = -1\\n    break\\n  if d == dist[x,y]:\\n    continue\\n  # \\u8ffd\\u52a0\\n  answer += d\\n  dist[x,y] = d\\n  dist[y,x] = d\\n  # \\u8ddd\\u96e2\\u884c\\u5217\\u306e\\u66f4\\u65b0\\n  # (i,j) -> (i,x),(x,y),(y,j)\\n  dist_use_xy = np.add.outer(dist[:,x], dist[:,y]) + d\\n  dist = np.minimum(dist,np.minimum(dist_use_xy,dist_use_xy.T))\\n  \\nprint(answer)\\n\", \"def warshall_floyd(graph):\\n    num_v = len(graph)\\n\\n    for k in range(num_v):\\n        for i in range(num_v):\\n            for j in range(num_v):\\n                if graph[i][j] > graph[i][k] + graph[k][j]:\\n                    graph[i][j] = graph[i][k] + graph[k][j]\\n    return graph\\n\\nN = int(input())\\ngraph = [[float(\\\"inf\\\") for _ in range(N)] for _ in range(N)]\\nfor i in range(N):\\n    a_list = list(map(int, input().split()))\\n    for j in range(N):\\n        if i == j:\\n            continue\\n        graph[i][j] = a_list[j]\\n# import copy\\n# a_list = copy.deepcopy(graph)\\nimport numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\nw_graph = floyd_warshall(graph, directed=False)\\nresult = 0\\nfor i in range(N):\\n     w_graph[i][i] = float(\\\"inf\\\")\\nfor i in range(N):\\n    for j in range(i):\\n        if i == j:\\n            continue\\n        if w_graph[i][j] != graph[i][j]:\\n            print((-1))\\n            return\\n        if w_graph[i][j] < np.min(w_graph[i] + w_graph[j]):\\n            result += w_graph[i][j]\\nprint((int(result)))\\n\", \"from numpy import *\\nN = int(input())\\nA = array([input().split() for _ in range(N)], dtype=int64)\\n\\nfill_diagonal(A, 10**10)\\n\\nans = 0\\nfor i in range(N):\\n  for j in range(i+1,N):\\n    d = min(A[i]+A[j])\\n    if A[i][j] < d:\\n      ans += A[i][j]\\n    elif d < A[i][j]:\\n      print((-1))\\n      return\\n\\nprint(ans)\\n\", \"import numpy as np\\n \\nN = int(input())\\nA = np.array([input().split() for _ in range(N)], dtype=np.int64).reshape(N,N)\\n\\nnp.fill_diagonal(A, 10**9+1)\\n\\nans = 0\\nfor i in range(N-1):\\n  for j in range(i+1,N):\\n    d = np.min(A[i]+A[j])\\n    if d > A[i][j]:\\n      ans+=A[i][j]\\n    elif d < A[i][j]:\\n      print(-1)\\n      return\\n\\nprint(ans)\", \"import numpy as np\\n\\nN = int(input())\\nA = np.array([input().split() for _ in range(N)], dtype=np.int64).reshape(N,N)\\n\\nINF = 10**15\\nnp.fill_diagonal(A, INF)\\n\\nans = 0\\nfor i in range(N-1):\\n    for j in range(i+1,N):\\n        detour = np.min(A[i]+A[j])\\n        if detour > A[i][j]:\\n            ans+=A[i][j]\\n        elif detour < A[i][j]:\\n            print(-1)\\n            return\\nprint(ans)\", \"import numpy as np\\nN = int(input())\\nA = np.array([list(map(int,input().split())) for _ in range(N)],dtype=np.int64)\\n\\nINF = 10**9+10\\nE = np.zeros(((N*(N-1))//2,3),dtype=np.int64)\\nk = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        E[k,0] = A[i][j]\\n        E[k,1] = i\\n        E[k,2] = j\\n        k += 1\\nE = E[E.argsort(0)[:,0]]\\nB = np.ones((N,N),dtype=np.int64)*INF\\nans = 0\\nfor l,i,j in E:\\n    l_min = np.min(B[i]+B[j])\\n    if l > l_min:\\n        ans = -1\\n        break\\n    elif l < l_min:\\n        ans += l\\n    B[i][j] = l\\n    B[j][i] = l\\nprint(ans)\", \"# solution\\n\\nimport io\\nimport math\\nimport scipy.sparse as s,numpy as n\\n\\nf=n.loadtxt(open(0),skiprows=1)\\n\\ng=s.csgraph.dijkstra(f)\\n\\nh=n.where(g,g,1)\\n\\nprint(int(sum(t[j]*(t[j]<t+h[j]).all()for i,t in enumerate(h)for j in range(i)))*(f==g).all()or-1)\", \"import sys\\nimport numpy as np \\nfrom scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\n'''\\nA\\u304c\\u6700\\u77ed\\u8ddd\\u96e2\\u3092\\u8868\\u3059\\u3001\\u3068\\u3044\\u3046\\u306e\\u306fSnuke\\u306e\\u63a8\\u6e2c\\u3067\\u3057\\u304b\\u306a\\u3044\\u3002\\n\\u306a\\u306e\\u3067\\u3001A\\u3092\\u3001A[v, u]\\u304c\\u8fba\\u306e\\u91cd\\u307f\\u3092\\u8868\\u3057\\u3066\\u3044\\u308bgraph\\u3068\\u3057\\u3066\\u6349\\u3048\\u3001floyd_warshall\\u3067\\u5b9f\\u969b\\u306b\\u6700\\u77ed\\u8ddd\\u96e2\\u3092\\u6c42\\u3081\\u3001B\\u3068\\u3059\\u308b\\u3002\\n\\nB[v, u] < A[v, u]\\u304c\\u5b58\\u5728\\u3057\\u305f\\u3089A\\u304c\\u6700\\u77ed\\u8ddd\\u96e2\\u3092\\u8868\\u3059\\u3068\\u3044\\u3046\\u63a8\\u6e2c\\u306f\\u9593\\u9055\\u3063\\u3066\\u3044\\u305f\\u3053\\u3068\\u306b\\u306a\\u308b\\u3002\\n\\u3082\\u3057B[v, u] == B[v, w] + B[w, u](\\u305f\\u3060\\u3057 w \\u2260 v, w \\u2260 u)\\u3068\\u306a\\u308b\\u3088\\u3046\\u306aw\\u304c\\u5b58\\u5728\\u3057\\u305f\\u3089\\u3001\\nA\\u306egraph\\u3067edge(v, u)\\u306f\\u306a\\u304f\\u3066\\u3082\\u826f\\u3044\\u3053\\u3068\\u306b\\u306a\\u308b\\u306e\\u3067\\u3001A[v, u] = A[u, v] = 0\\u3068\\u3057\\u3066\\u8fba\\u3092\\u6d88\\u3059\\u3002(\\u4eee\\u306b\\u8fba\\u3092\\u6d88\\u3057\\u3066\\u3082\\u3001shortest_dist(v, u)\\u306b\\u306f\\u5f71\\u97ff\\u3057\\u306a\\u3044\\u305f\\u3081)\\n\\n\\u6700\\u5f8c\\u306b\\u6b8b\\u3063\\u305f\\u8fba\\u3005\\u3060\\u3051\\u3092\\u3064\\u306a\\u3052\\u3066\\u3067\\u304d\\u308b\\u30b0\\u30e9\\u30d5\\u306e\\u5408\\u8a08\\u306e\\u8fba\\u306e\\u91cd\\u307f\\u304c\\u7b54\\u3048\\u3068\\u306a\\u308b\\n'''\\n\\nn = int(sys.stdin.readline().rstrip())\\nA = np.array(sys.stdin.read().split(), dtype=np.int64).reshape(n, n)\\n\\ndef main():\\n    B = floyd_warshall(csr_matrix(A), directed=False).astype(np.float64)\\n    if np.any(B < A):\\n        return -1\\n        \\n    np.fill_diagonal(B, np.inf)\\n    \\n    for v in range(n-1):\\n        for u in range(v+1, n):\\n            detours = B[v] + B[u]\\n            if np.any(detours == B[v, u]):\\n                A[v, u] = A[u, v] = 0\\n\\n    return np.sum(A) // 2\\n\\ndef __starting_point():\\n    ans = main()\\n    print(ans)\\n__starting_point()\", \"import numpy as np\\nimport sys\\n\\ndef read_data():\\n    try:\\n        LOCAL_FLAG\\n        import codecs\\n        import os\\n\\n        lines = []\\n        file_path = os.path.join(os.path.dirname(__file__), 'data.dat')\\n        with codecs.open(file_path, 'r', 'utf-8') as f:\\n            n_lines = int(f.readline())\\n            for i in range(n_lines):\\n                lines.append(f.readline().rstrip(\\\"\\\\r\\\\n\\\"))\\n\\n    except NameError:\\n        lines = []\\n        n_lines = int(input())\\n        for i in range(n_lines):\\n            lines.append(input())\\n    return lines\\n\\nraw_data = read_data()\\ntarray = []\\nfor each in raw_data:\\n    tarray.append(each.split())\\nA = np.array(tarray, dtype='int64')\\nN = A.shape[0]\\n\\n\\ndef Restoring_Road_Network2():\\n\\n    not_available = False\\n    for k in range(0, N):\\n        for i in range(0, N):\\n            if(k==i): continue\\n            for j in range(0, N):\\n                if((i==j) or (j==k)): continue\\n                if(A[i][k] + A[k][j] < A[i][j]):\\n                    not_availabel = True\\n                if(A[i][k] + A[k][j] == A[i][j]):\\n                    B[i][j] = 1\\n                    B[j][i] = 1\\n\\n    try:\\n        LOCAL_FLAG\\n        print(B)\\n    except NameError:\\n        pass\\n\\n    if(not_available):\\n        print(-1)\\n    else:\\n        total_dis = 0\\n        for i in range(0, N):\\n            for j in range(i, N):\\n                if(B[i][j] == 0):\\n                    total_dis += A[i][j]\\n        print(total_dis)\\n\\ndef Restoring_Road_Network3():\\n\\n    import scipy.sparse.csgraph as graph\\n\\n    MAX = [10000000000]*N  # should be > 2*10**9\\n    d = np.diag(MAX)\\n    C = A.copy()\\n    C += d\\n    total_dis = 0\\n    n_path = 0\\n    for i in range(N-1):\\n        for j in range(i+1, N):\\n            dis_two_node = np.min(C[i] + C[j])\\n            if dis_two_node > C[i,j]:\\n                total_dis += C[i,j]\\n                # print(i, j)\\n            elif dis_two_node < C[i,j]:\\n                print(-1)\\n                return\\n\\n    print(total_dis)\\n\\ndef AA():\\n    import numpy as np\\n\\n    for i in range(N):\\n        A[i][i] = 10000000000\\n\\n    result = 0\\n    for i in range(N-1):\\n        for j, d1 in enumerate(A[i][i+1:], start=i+1):\\n            d2 = np.min(A[i]+A[j])\\n            # print(A[i][i+1:])\\n            # print (i, j, d1, d2)\\n            if d1 >= d2:\\n                if d1 > d2:\\n                    print(-1)\\n                    return\\n            else:\\n                result += d1\\n    print(result)\\n\\nRestoring_Road_Network3()\", \"def RestoringRoadNetwork():\\n    import sys\\n    n = int(input())\\n    wf = [list(map(int, input().split())) for _ in range(n)]\\n    ans = 0\\n\\n    # Warshall Floyd\\n    for i in range(n-1):\\n        for j in range(i+1, n):\\n            d = wf[i][j]\\n            # k\\u3092\\u4e2d\\u7d99\\u3057\\u305f\\u3068\\u304d\\u306e\\u8ddd\\u96e2\\n            for k in range(n):\\n                if k in (i, j):\\n                    continue\\n                num = wf[i][k]+wf[k][j]\\n                if num < d:\\n                    print((-1))\\n                    return\\n                elif num == d:\\n                    break\\n            else:\\n                ans += d\\n    else:\\n        print(ans)\\n\\ndef __starting_point():\\n    RestoringRoadNetwork()\\n    \\n\\n__starting_point()\", \"import numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\nN = int(input())\\nA = np.asarray([[int(Aij) for Aij in input().split()] for _ in range(N)])\\n\\nA2 = floyd_warshall(A, directed=False)\\n\\nif np.any(A != A2):\\n    print(-1)\\nelse:\\n    d = 0\\n    A += np.diag([2*10**9] * N)\\n    for i in range(N):\\n        for j in range(i + 1, N):\\n            if np.min(A[i] + A[j]) != A[i, j]:\\n                d += A[i, j]\\n    print(d)\", \"import sys\\nimport numpy as np\\ninput = sys.stdin.readline\\nn = int(input())\\nG = np.array([list(map(int, input().split())) for _ in range(n)], dtype=float)\\nuse = np.ones((n,n),dtype=bool)\\nimpossible = np.zeros((n,n),dtype=bool)\\nfor w in range(n):\\n    D = sum(np.meshgrid(G[w], G[w]))\\n    D[w] = np.inf\\n    D[:,w] = np.inf\\n    use &= ~(G == D)\\n    impossible |= G > D\\nif impossible.any():\\n    print(-1)\\nelse:\\n    print(int(np.sum(G[use]) / 2))\", \"import numpy as np\\nn=int(input())\\nl=[np.array(input().split(), dtype=np.int64) for _ in [0]*n]\\nl+=np.diag([10**10]*n)\\n\\nv=0\\nfor i in range(n-1):\\n  for j,d1 in enumerate(l[i][i+1:]):\\n    d2=np.min(l[i]+l[j+i+1])\\n    if d1>=d2:\\n      if d1>d2:\\n        print(-1)\\n        return\\n    else:\\n      v+=d1\\nprint(v)\", \"import sys\\nimport numpy as np\\ninput = sys.stdin.readline\\nn = int(input())\\nG = np.array([list(map(int, input().split())) for _ in range(n)], dtype=float)\\nG2 = G\\nfor i in range(n):\\n    G2[i,i] = np.inf\\nuse = np.ones((n,n),dtype=bool)\\nimpossible = np.zeros((n,n),dtype=bool)\\nfor w in range(n):\\n    D = sum(np.meshgrid(G2[w], G2[w]))\\n    use &= ~(G == D)\\n    impossible |= G > D\\nif impossible.sum() > n:\\n    print(-1)\\nelse:\\n    print(int(np.sum(G[use]) / 2))\", \"import numpy as np\\nN=int(input())\\nA=[np.array(list(map(int,input().split()))) for i in range(N)]\\nans=sum([sum(A[i]) for i in range(N)])\\nans//=2\\nfor i in range(N):\\n    A[i][i]=10**10\\ndef main(ans):\\n    for i in range(N):\\n        for j in range(i+1,N):\\n            Min=np.min(A[i]+A[j])\\n            if Min<A[i][j]:\\n                return -1\\n            if Min==A[i][j]:\\n                ans-=A[i][j]\\n    return ans\\nprint(main(ans))\", \"import numpy as np\\nN = int(input())\\nA = np.array([list(map(int, input().split())) for _ in range(N)])\\n\\nfor i in range(N):\\n    A[i][i] = 10 ** 9\\n\\nans = 0\\nfor i in range(N):\\n    for j in range(i+ 1, N):\\n        dp = np.min(A[i] + A[j])\\n        if A[i][j] < dp:\\n            ans += A[i][j]\\n        elif A[i][j] > dp:\\n            print((-1))\\n            return\\n\\nprint (ans)\\n\", \"import sys\\nimport numpy as np \\nfrom scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nn = int(sys.stdin.readline().rstrip())\\nA = np.array(sys.stdin.read().split(), dtype=np.float64).reshape(n, n)\\n\\ndef main():\\n    B = floyd_warshall(csr_matrix(A), directed=False)\\n    if np.any(B < A):\\n        return -1\\n        \\n    np.fill_diagonal(B, np.inf)\\n    \\n    total_length = 0\\n    for v in range(n-1):\\n        for u in range(v+1, n):\\n            detours = B[v] + B[u]\\n            if np.all(detours > B[v, u]):\\n                total_length += B[v, u]\\n\\n    return int(total_length)\\n\\ndef __starting_point():\\n    ans = main()\\n    print(ans)\\n__starting_point()\", \"N, *L = map(int, open(0).read().split())\\ncost = []\\nfor i,m in enumerate(zip(*[iter(L)]*N)):\\n  cost.append(list(m))\\n  cost[i][i] = 10**10\\nans = 0\\nfor i in range(N):\\n  for j in range(i):\\n    m = min(a+b for a, b in zip(cost[i],cost[j]))\\n    if m<cost[i][j]:\\n      print(-1)\\n      return\\n    if m>cost[i][j]:\\n      ans += cost[i][j]\\nprint(ans)\", \"def main():\\n    n=int(input())\\n    if n==1:\\n        print(0)\\n        return 0\\n    import numpy as np\\n    p=np.array([np.array(list(map(int,input().split()))) for _ in [0]*n])\\n    if n==2:\\n        print(p[0][1])\\n        return 0\\n    import scipy.sparse.csgraph as sp\\n    ans=0\\n    d=np.full((n,n),0)\\n    for i in range(n):\\n        for j in range(i+1,n):\\n            b=p[i][j]\\n            if b!=np.sort(p[i]+p[j])[2]:\\n                d[i][j],d[j][i]=b,b\\n                ans+=b\\n    s=sp.shortest_path(d)\\n    if (s==p).all():\\n        print(ans)\\n    else:\\n        print(-1)\\nmain()\", \"from numpy import *\\nN = int(input())\\nA = array([list(map(int,input().split())) for n in range(N)])\\nans = 0\\n\\nfor n in range(N):\\n  A[n][n] = 10**9\\n\\nfor i in range(N):\\n  for j in range(i+1,N):\\n    dp = min(A[i]+A[j])\\n    if A[i][j]<dp:\\n      ans+=A[i][j]\\n    elif dp<A[i][j]:\\n      print(-1)\\n      return\\n\\nprint(ans)\", \"import numpy as np\\nN = int(input())\\nA = [np.array(input().split(), dtype=np.int64) for _ in [0]*N]\\ninf = 10**10\\nfor i in range(N):\\n    A[i][i] = inf\\n \\nresult = 0\\nfor i in range(N-1):\\n    for j, d1 in enumerate(A[i][i+1:], start=i+1):\\n        d2 = np.min(A[i]+A[j])\\n        if d1 >= d2:\\n            if d1 > d2:\\n                print(-1)\\n                return\\n        else:\\n            result += d1\\nprint(result)\", \"import sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\n\\nN = ir()\\nA = np.array([lr() for i in range(N)])\\nINF = 10 ** 10\\nnp.fill_diagonal(A, INF)\\nanswer = 0\\nfor i in range(N):\\n    for j in range(i+1, N):\\n        detour = np.min(A[i] + A[j])\\n        if A[i, j] < detour:\\n            # \\u6700\\u77ed\\u8ddd\\u96e2\\u3068\\u3057\\u3066\\u3053\\u306e\\u9053\\u8def\\u306f\\u5fc5\\u8981\\n            answer += A[i, j]\\n        elif A[i, j] > detour:\\n            print((-1))\\n            return\\n\\nprint(answer)\\n# 05 hint\\n\", \"import sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\n\\nN = ir()\\nA = np.array([lr() for i in range(N)])\\nINF = 10 ** 9\\nnp.fill_diagonal(A, INF)\\nanswer = 0\\nfor i in range(N):\\n    for j in range(i+1, N):\\n        detour = np.min(A[i] + A[j])\\n        if A[i, j] < detour:\\n            # \\u6700\\u77ed\\u8ddd\\u96e2\\u3068\\u3057\\u3066\\u3053\\u306e\\u9053\\u8def\\u306f\\u5fc5\\u8981\\n            answer += A[i, j]\\n        elif A[i, j] > detour:\\n            print((-1))\\n            return\\n\\nprint(answer)\\n# 05 hint\\n\", \"def main():\\n    N = int(input())\\n    A = [list(map(int, input().split())) for _ in range(N)]\\n    ans = 0\\n    for i in range(N):\\n        A[i][i] = float('INF')\\n    for i in range(N):\\n        for j in range(i):\\n            if i == j:\\n                A[i][j] = float('INF')\\n                continue\\n            b = min(list(map(sum, list(zip(A[i], A[j])))))\\n            if A[i][j] > b:\\n                print((-1))\\n                return\\n            if b > A[i][j]:\\n                ans += A[i][j]\\n    print(ans)\\n\\n\\nmain()\\n\", \"from scipy.sparse.csgraph import floyd_warshall\\nimport numpy as np\\nimport sys\\nsdin = sys.stdin.readline\\n\\nn = int(sdin())\\ngraph = np.array([[0 for _ in range(n)] for _ in range(n)], dtype=float)\\nfor i in range(n):\\n    graph[i] = np.array(list(map(int, sdin().split())))\\n    \\n# \\u30ef\\u30fc\\u30b7\\u30e3\\u30eb\\u30d5\\u30ed\\u30a4\\u30c9\\u3067\\u6700\\u77ed\\u8ddd\\u96e2\\u51fa\\u3059\\nshortest = floyd_warshall(graph, directed=False)\\n\\n\\nif any([graph[i,j] != shortest[i,j] for i in range(n) for j in range(n)]):\\n    print(-1)\\n    \\nelse:\\n    total = 0\\n    INF = float(\\\"inf\\\")\\n    \\n    for i in range(n):\\n        graph[i,i] = INF\\n    \\n    for i in range(n):\\n        for j in range(i+1,n):\\n            via_k = np.min(graph[i] + graph[j])\\n            \\n            if via_k > graph[i,j]:\\n                total += graph[i,j]\\n                \\n    print(int(total))\", \"N = int(input())\\ngraph = [[float(\\\"inf\\\") for _ in range(N)] for _ in range(N)]\\nfor i in range(N):\\n    a_list = list(map(int, input().split()))\\n    for j in range(N):\\n        if i == j:\\n            continue\\n        graph[i][j] = a_list[j]\\nimport numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\nw_graph = floyd_warshall(graph, directed=False)\\nfor i in range(N):\\n    w_graph[i][i] = float(\\\"inf\\\")\\nresult = 0\\nfor i in range(N):\\n     w_graph[i][i] = float(\\\"inf\\\")\\nfor i in range(N):\\n    for j in range(i):\\n        if w_graph[i][j] != graph[i][j]:\\n            print((-1))\\n            return\\n        if w_graph[i][j] < np.min(w_graph[i] + w_graph[j]):\\n            result += w_graph[i][j]\\nprint((int(result)))\\n\", \"import numpy as np\\nN=int(input())\\nA=[np.array(list(map(int,input().split()))) for i in range(N)]\\nans=sum([sum(A[i]) for i in range(N)])\\nans//=2\\nfor i in range(N):\\n    A[i][i]=10**10\\ndef main(ans):\\n    for i in range(N):\\n        for j in range(i+1,N):\\n            Min=min(A[i]+A[j])\\n            if Min<A[i][j]:\\n                return -1\\n            if Min==A[i][j]:\\n                ans-=A[i][j]\\n    return ans\\nprint(main(ans))\", \"from itertools import product\\ndef main(): \\n    with open(0) as f:\\n        N = int(f.readline())\\n        A = [list(map(int, line.split())) for line in f.readlines()]\\n\\n    possible = True\\n    ans = 0\\n    r = range(N)\\n    for i,j in product(r, r) :\\n        if j <= i: continue\\n        for k in r:\\n            if k == i or k == j:\\n                continue\\n            if A[i][j] < A[i][k] + A[k][j]:\\n                continue\\n            elif A[i][j] == A[i][k] + A[k][j]:\\n                break\\n            else:\\n                possible = False\\n            break\\n        else:\\n            ans += A[i][j]\\n    print(ans if possible else -1)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom copy import deepcopy\\nimport numpy as np\\nreadline=sys.stdin.readline\\nread=sys.stdin.read\\n\\ndef main():\\n    n=int(readline())\\n    a=np.array([list(map(int,l.split())) for l in read().splitlines()])\\n    cost=deepcopy(a)\\n    for k in range(n):\\n        arr=np.stack([cost,[cost[k]]+np.transpose([cost[k]])])\\n        cost=np.amin(arr,axis=0)\\n    f=np.sum(cost<a)\\n    if f:\\n        print((-1))\\n        return\\n    filt=np.sum([([cost[k]]+np.transpose([cost[k]]))==cost for k in range(n)],axis=0)==2\\n    print((np.sum(a[filt])//2))\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n=int(input())\\nINF=float(\\\"inf\\\")\\ng=[[INF]*n for _ in range(n)]\\nans=0\\nfor i in range(n):\\n\\tfor j,c in enumerate(map(int,input().split())):\\n\\t\\tif i!=j:\\n\\t\\t\\tg[i][j]=c\\nfor i in range(n):\\n\\tfor j in range(i):\\n\\t\\tm=min(a+b for a,b in zip(g[i],g[j]))\\n\\t\\tif g[i][j]>m:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\treturn\\n\\t\\tif g[i][j]<m:\\n\\t\\t\\tans+=g[i][j]\\nprint(ans)\", \"import sys\\nimport numpy as np \\nfrom scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nn = int(sys.stdin.readline().rstrip())\\nA = np.array(sys.stdin.read().split(), dtype=np.int64).reshape(n, n)\\n\\ndef main():\\n    B = floyd_warshall(csr_matrix(A), directed=False).astype(np.float64)\\n    if np.any(B < A):\\n        return -1\\n        \\n    np.fill_diagonal(B, np.inf)\\n    \\n    for v in range(n-1):\\n        for u in range(v+1, n):\\n            detours = B[v] + B[u]\\n            if np.any(detours == B[v, u]):\\n                A[v, u] = A[u, v] = 0\\n                \\n    return np.sum(A) // 2\\n\\ndef __starting_point():\\n    ans = main()\\n    print(ans)\\n__starting_point()\", \"n = int(input())\\nimport numpy as np\\na = np.array([list(map(int,input().split())) for _ in range(n)])\\nans = 0\\nfor i in range(n):\\n    a[i][i] = 10**9+1\\nfor i in range(n):\\n    for j in range(i,n):\\n        if i==j:\\n            continue\\n        dp = np.min(a[i]+a[j])\\n        if a[i][j]<dp:\\n            ans += a[i][j]\\n        elif a[i][j]>dp:\\n            print(-1)\\n            return\\nprint(ans)\", \"from numpy import *\\nN = int(input())\\nA = array([list(map(int,input().split())) for n in range(N)])\\n\\nfill_diagonal(A, 10**10)\\n\\nans = 0\\nfor i in range(N):\\n  for j in range(i+1,N):\\n    d = min(A[i]+A[j])\\n    if A[i][j] < d:\\n      ans += A[i][j]\\n    elif d < A[i][j]:\\n      print((-1))\\n      return\\n\\nprint(ans)\\n\", \"#!/usr/bin/env python3\\nimport sys\\n\\n\\ndef solve(N: int, A: \\\"List[List[int]]\\\"):\\n    import numpy as np\\n    from scipy.sparse.csgraph import floyd_warshall\\n    A = np.array(A, dtype=np.float64)\\n    B = floyd_warshall(A, directed=True)\\n    if not np.array_equal(A, B):\\n        return -1\\n    delta = 1e-1\\n    _, pre = floyd_warshall(A-delta+np.identity(N)*delta, return_predecessors=True)\\n    return int(A[pre == [[i]*N for i in range(N)]].sum()) // 2\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    N = int(next(tokens))  # type: int\\n    A = [[int(next(tokens)) for _ in range(N)] for _ in range(N)]  # type: \\\"List[List[int]]\\\"\\n    print((solve(N, A)))\\n\\ndef test():\\n    import doctest\\n    doctest.testmod()\\n\\ndef __starting_point():\\n    #test()\\n    main()\\n\\n__starting_point()\", \"from scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nimport numpy as np\\n\\nn = int(input())\\na = np.array([list(map(int, input().split())) for _ in range(n)])\\n\\ng = csr_matrix(a)\\ndist = floyd_warshall(g)\\n\\nif (dist == a).all():\\n    sm = a.sum()\\n    sm //= 2\\n\\n    INF = 10 ** 18 + 1\\n    for i in range(n):\\n        a[i, i] = INF\\n\\n    for u in range(n):\\n        for v in range(u + 1, n):\\n            mn = np.min(a[u] + a[v])\\n            if mn == a[u, v]:\\n                sm -= a[u, v]\\n\\n    print(sm)\\n\\nelse:\\n    print((-1))\\n\", \"import numpy as np\\nimport sys\\n\\ndef read_data():\\n    try:\\n        LOCAL_FLAG\\n        import codecs\\n        import os\\n\\n        lines = []\\n        file_path = os.path.join(os.path.dirname(__file__), 'data.dat')\\n        with codecs.open(file_path, 'r', 'utf-8') as f:\\n            n_lines = int(f.readline())\\n            for i in range(n_lines):\\n                lines.append(f.readline().rstrip(\\\"\\\\r\\\\n\\\"))\\n\\n    except NameError:\\n        lines = []\\n        n_lines = int(input())\\n        for i in range(n_lines):\\n            lines.append(input())\\n    return lines\\n\\nraw_data = read_data()\\ntarray = []\\nfor each in raw_data:\\n    tarray.append(each.split())\\nA = np.array(tarray, dtype='int64')\\nN = A.shape[0]\\n\\ndef Restoring_Road_Network():\\n\\n    import scipy.sparse.csgraph as graph\\n\\n    MAX = [10000000000]*N  # should be > 2*10**9\\n    d = np.diag(MAX)\\n    C = A.copy()\\n    C += d\\n    total_dis = 0\\n    n_path = 0\\n    for i in range(N-1):\\n        for j in range(i+1, N):\\n            dis_two_node = np.min(C[i] + C[j])\\n            if dis_two_node > C[i,j]:\\n                total_dis += C[i,j]\\n                # print(i, j)\\n            elif dis_two_node < C[i,j]:\\n                print(-1)\\n                return\\n\\n    print(total_dis)\\n\\nRestoring_Road_Network()\", \"import numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\nn = int(input())\\na = np.array([[int(i) for i in input().split()] for i in range(n)])\\nd,ans = floyd_warshall(a,directed=False),0\\nif any(a[i][j]!=d[i][j] for i in range(n) for j in range(n)): ans = -1\\nelse:\\n\\tinf = 10**10\\n\\tfor i in range(n): a[i][i] = inf\\n\\tfor i in range(n):\\n\\t\\tfor j in range(i+1,n):\\n\\t\\t\\tnum = np.min(a[i]+a[j])\\n\\t\\t\\tif num>a[i][j]: ans+=a[i][j]\\nprint(int(ans))\", \"import sys\\nimport numpy as np \\nfrom scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nn = int(sys.stdin.readline().rstrip())\\nA = np.array(sys.stdin.read().split(), dtype=np.float64).reshape(n, n)\\n\\ndef main():\\n    B = floyd_warshall(csr_matrix(A), directed=False).astype(np.int64)\\n    if np.any(B < A):\\n        return -1\\n        \\n    np.fill_diagonal(A, np.inf)\\n    \\n    total_length = 0\\n    for v in range(n-1):\\n        for u in range(v+1, n):\\n            detours = A[v] + A[u]\\n            if np.all(detours > B[v, u]):\\n                total_length += B[v, u]\\n\\n    return total_length\\n\\ndef __starting_point():\\n    ans = main()\\n    print(ans)\\n__starting_point()\", \"N = int(input())\\ngraph = [[float(\\\"inf\\\") for _ in range(N)] for _ in range(N)]\\nfor i in range(N):\\n    a_list = list(map(int, input().split()))\\n    for j in range(N):\\n        if i == j:\\n            continue\\n        graph[i][j] = a_list[j]\\nimport numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\nw_graph = floyd_warshall(graph, directed=False)\\nfor i in range(N):\\n    w_graph[i][i] = float(\\\"inf\\\")\\nresult = 0\\nfor i in range(N):\\n     w_graph[i][i] = float(\\\"inf\\\")\\nfor i in range(N):\\n    for j in range(i):\\n        if w_graph[i][j] != graph[i][j]:\\n            print((-1))\\n            return\\n        if w_graph[i][j] < np.min(w_graph[i] + w_graph[j]):\\n            result += w_graph[i][j]\\nprint((int(result)))\\n\", \"def main():\\n    inf=float(\\\"inf\\\")\\n    n=int(input())\\n    alst=[list(map(int,input().split())) for _ in range(n)]\\n \\n    for i in range(n):\\n        alst[i][i]=inf\\n \\n    sm=0\\n    token=0\\n \\n    for i in range(n):\\n        for j in range(i+1,n):\\n            for k in range(n):\\n                if alst[i][k]+alst[k][j]>alst[i][j]:\\n                    continue\\n                elif alst[i][k]+alst[k][j]==alst[i][j]:\\n                    break\\n                else:\\n                    token=1\\n                    break\\n            else :\\n                sm+=alst[i][j]\\n    \\n    if token : sm=-1\\n \\n    print(sm)\\n \\nmain()\", \"from scipy.sparse.csgraph import floyd_warshall\\nimport numpy as np\\n\\n\\ndef main():\\n    INF = 10**12\\n    N = int(input())\\n    A = [list(map(int, input().split(' '))) for _ in range(N)]\\n    wf = floyd_warshall(A)\\n    for i in range(N):\\n        A[i][i] = INF\\n        wf[i][i] = INF\\n    ans = 0\\n    for i in range(N):\\n        for j in range(N):\\n            if A[i][j] != wf[i][j]:\\n                print(-1)\\n                return\\n            if wf[i][j] < np.min(wf[i] + wf[j]):\\n                ans += wf[i][j]\\n    print(int(ans // 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import itertools\\nimport numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\n\\ndef main():\\n    N = int(input())\\n    matr = np.array([tuple(map(int, input().split())) for _ in range(N)], dtype=np.int64)\\n    way = floyd_warshall(matr).astype(int)\\n    if np.any(way < matr):\\n        print((-1))\\n        return\\n\\n    ans = 0\\n    for a, b in itertools.combinations(list(range(N)), 2):\\n        eq = (matr[a, b] == (matr[a] + matr[:, b]))\\n        eq[a] = eq[b] = False\\n        if not np.any(eq):\\n            ans += matr[a, b]\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\nimport sys\\n\\n\\ndef solve(N: int, A: \\\"List[List[int]]\\\"):\\n    import numpy as np\\n    from scipy.sparse.csgraph import floyd_warshall\\n    A = np.array(A, dtype=np.float64)\\n    B = floyd_warshall(A, directed=True)\\n    if not np.array_equal(A, B):\\n        return -1\\n    delta = 1e-3\\n    _, pre = floyd_warshall(A-delta+np.identity(N)*delta, return_predecessors=True)\\n    return int(A[pre == [[i]*N for i in range(N)]].sum()) // 2\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    N = int(next(tokens))  # type: int\\n    A = [[int(next(tokens)) for _ in range(N)] for _ in range(N)]  # type: \\\"List[List[int]]\\\"\\n    print((solve(N, A)))\\n\\ndef test():\\n    import doctest\\n    doctest.testmod()\\n\\ndef __starting_point():\\n    #test()\\n    main()\\n\\n__starting_point()\", \"import numpy as np\\n\\nfrom scipy.sparse import csr_matrix\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\n\\ndef solve():\\n    N = int(input())\\n    A = np.array([input().split() for _ in range(N)], dtype=np.int64).reshape(N, N)\\n    \\n    B = floyd_warshall(csr_matrix(A), directed=False)\\n    \\n    if np.any(B < A):\\n        print((-1))\\n        return\\n    \\n    np.fill_diagonal(B, np.inf)\\n    for i in range(N - 1):\\n        for j in range(i + 1, N):\\n            if B[i][j] == np.min(B[i] + B[j]):\\n                A[i][j] = A[j][i] = 0\\n    print((np.sum(A) // 2))\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"import numpy as np\\n\\nn = int(input())\\na = np.array([np.array(input().split(), dtype=np.uint64) for _ in range(n)], dtype=np.uint64)\\n\\nfor i in range(n):\\n  a[i,i] = 1e9 + 1\\n\\nans = 0\\nfor u in range(n):\\n    for v in range(u + 1, n): \\n        dist = a[u,v]\\n        cd = np.min(a[u] + a[v])\\n        if dist > cd:\\n            print(-1)\\n            return\\n        if dist < cd:\\n            ans += dist\\n \\nprint(int(ans))\", \"from scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nimport numpy as np\\n\\nn = int(input())\\na = [list(map(int, input().split())) for _ in range(n)]\\n\\na = np.array(a)\\n\\ng = csr_matrix(a)\\ndist = floyd_warshall(g)\\n\\nbl = dist == a\\n\\nif bl.all():\\n    sm = dist.sum()\\n    INF = 10 ** 18 + 1\\n    inf = np.array([INF] * n)\\n    inf = np.diag(inf)\\n    dist += inf\\n    for u in range(n):\\n        for v in range(n):\\n            if u == v:\\n                continue\\n\\n            mn = np.min(dist[u] + dist[v])\\n            if mn == dist[u, v]:\\n                sm -= dist[u, v]\\n\\n    ans = int(sm) // 2\\n    print(ans)\\n\\nelse:\\n    print((-1))\\n\", \"def main():\\n    inf=float(\\\"inf\\\")\\n    n=int(input())\\n    alst=[list(map(int,input().split())) for _ in range(n)]\\n\\n    for i in range(n):\\n        alst[i][i]=inf\\n\\n    sm=0\\n    token=0\\n\\n    for i in range(n):\\n        for j in range(i+1,n):\\n            for k in range(n):\\n                if alst[i][k]+alst[k][j]>alst[i][j]:\\n                    continue\\n                elif alst[i][k]+alst[k][j]==alst[i][j]:\\n                    break\\n                else:\\n                    token=1\\n                    break\\n            else :\\n                sm+=alst[i][j]\\n    \\n    if token : sm=-1\\n\\n    print(sm)\\n\\nmain()\", \"from numpy import *\\nN = int(input())\\nA = array([input().split() for _ in range(N)], dtype=int64)\\n\\nfill_diagonal(A, 10**9)\\n\\nans = 0\\nfor i in range(N):\\n  for j in range(i+1,N):\\n    d = min(A[i]+A[j])\\n    if A[i][j] < d:\\n      ans += A[i][j]\\n    elif d < A[i][j]:\\n      print((-1))\\n      return\\n\\nprint(ans)\\n\", \"import heapq\\nINF = 10**10\\nn = int(input())\\na = [[int(item) for item in input().split()] for _ in range(n)]\\nb = [[INF for _ in range(n)] for _ in range(n)]\\n\\nans = 0\\nfor i in range(n):\\n    ans += sum(a[i])\\n    a[i][i] = INF\\nans //= 2\\n\\nfor i in range(n):\\n    for j in range(i):\\n        bipas = min(map(sum, zip(a[i], a[j])))\\n        if a[i][j] > bipas:\\n            print(-1)\\n            return\\n        if a[i][j] == bipas:\\n            ans -= a[i][j]\\nprint(ans)\", \"import numpy as np\\nimport scipy.sparse.csgraph as graph\\n\\nN = int(input())\\nG = np.array([list(map(int, input().split())) for i in range(N)])\\n\\nG2 = graph.floyd_warshall(G, directed=False)\\n\\nif np.any(G != G2):\\n    print((-1))\\n    return\\nelse:\\n    c = [2*10**9]*N\\n    d = np.diag(c)\\n    G += d\\n    ans = 0\\n    for i in range(N):\\n        for j in range(i+1, N):\\n            two = np.min(G[i]+G[j])\\n            if two != G[i,j]:\\n                ans += G[i,j]\\n\\nprint(ans)\\n\", \"import sys\\n\\ndef main():\\n    input = sys.stdin.readline\\n    N = int(input())\\n    A = [list(map(int, input().split())) for _ in range(N)]\\n\\n    INF = 10**10\\n    for i in range(N):\\n        A[i][i] = INF\\n\\n    ans = 0\\n    for i in range(N):\\n        for j in range(i):\\n            bipas = min(list(map(sum, list(zip(A[i], A[j])))))\\n\\n            if A[i][j] > bipas:\\n                print((-1))\\n                return 0\\n            elif A[i][j] < bipas:\\n                ans += A[i][j]\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import scipy.sparse as s,numpy as n\\nf=n.loadtxt(open(0),skiprows=1)\\ng=s.csgraph.dijkstra(f)\\nh=n.where(g,g,1)\\na=0\\nfor i,t in enumerate(h):\\n  for j in range(i):\\n    a+=t[j]*(t[j]<t+h[j]).all()\\nprint(int(a)*(f==g).all()or-1)\", \"import numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall as wf\\nn=int(input())\\ns=np.array([list(map(int,input().split()))for i in range(n)])\\nif np.any(s!=wf(s,directed=False)):\\n    print(-1)\\nelse:\\n    c=0\\n    for i in range(n):\\n        s[i][i]=10**10\\n    for i in range(n):\\n        for j in range(i+1,n):\\n            d=np.min(s[i]+s[j])\\n            if s[i,j]!=d:\\n                c+=s[i,j]\\n    else:\\n        print(c)\", \"import numpy as np\\nN = int(input())\\nA = [np.array(input().split(), dtype=np.int64) for _ in range(N)]\\nans = 0\\ninf = 10**10\\nresult = 0\\nfor i in range(N):\\n    A[i][i] = inf\\n\\nfor i in range(N-1):\\n    for j, d1 in enumerate(A[i][i+1:], start=i+1):\\n        d2 = np.min(A[i]+A[j])\\n        if d1 >= d2:\\n            if d1 > d2:\\n                print((-1))\\n                return\\n        else:\\n            result += d1\\n\\nprint(result)\\n\", \"import sys\\ninput=sys.stdin.readline\\nN=int(input())\\ndist=[list(map(int,input().split())) for i in range(N)]\\nans=sum([sum(dist[i]) for i in range(N)])\\nfor i in range(N):\\n    dist[i][i]=float('inf')\\nans//=2\\ndef main(ans):\\n    for i in range(N):\\n        for j in range(i+1,N):\\n            Min=min(map(sum,zip(dist[i],dist[j])))\\n            if Min<dist[i][j]:\\n                return -1\\n            if Min==dist[i][j]:\\n                ans-=dist[i][j] \\n    return ans\\nprint(main(ans))\", \"import sys\\nfrom copy import deepcopy\\nimport numpy as np\\nreadline=sys.stdin.readline\\nread=sys.stdin.read\\n\\ndef main():\\n    n=int(readline())\\n    a=np.array([list(map(int,l.split())) for l in read().splitlines()])\\n    cost=deepcopy(a)\\n    for k in range(n):\\n        arr=np.stack([cost,[cost[k]]+np.transpose([cost[k]])])\\n        cost=np.amin(arr,axis=0)\\n    cost2=deepcopy(a)\\n    f=np.sum(cost<a)\\n    if f:\\n        print((-1))\\n        return\\n    filt=np.sum([([cost[k]]+np.transpose([cost[k]]))==cost for k in range(n)],axis=0)==2\\n    print((np.sum(a[filt])//2))\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import numpy as np\\nN = int(input())\\nA = np.array([input().split() for _ in range(N)], dtype=np.int64)\\n\\nnp.fill_diagonal(A, 10**9)\\n\\nans = 0\\nfor i in range(N):\\n  for j in range(i+1,N):\\n    d = np.min(A[i]+A[j])\\n    if A[i][j] < d:\\n      ans += A[i][j]\\n    elif d < A[i][j]:\\n      print((-1))\\n      return\\n\\nprint(ans)\\n\", \"from scipy.sparse.csgraph import floyd_warshall\\nfrom scipy.sparse import csr_matrix\\n\\nimport numpy as np\\n\\nn = int(input())\\na = np.array([list(map(int, input().split())) for _ in range(n)])\\n\\ng = csr_matrix(a)\\ndist = floyd_warshall(g)\\n\\nif (dist == a).all():\\n    sm = dist.sum()\\n\\n    INF = 10 ** 18 + 1\\n    for i in range(n):\\n        dist[i, i] = INF\\n\\n    for u in range(n):\\n        for v in range(n):\\n            if u == v:\\n                continue\\n\\n            mn = np.min(dist[u] + dist[v])\\n            if mn == dist[u, v]:\\n                sm -= dist[u, v]\\n\\n    ans = int(sm) // 2\\n    print(ans)\\n\\nelse:\\n    print((-1))\\n\", \"def main():\\n    N = int(input())\\n    r = range(N)\\n    A = [list(map(int, input().split())) for _ in r]\\n\\n    for i in r: A[i][i] = float('inf')\\n    possible = True\\n    ans = 0\\n    for i in r :\\n        for j in range(i+1,N):\\n            for k in r:\\n                if A[i][j] < A[i][k] + A[k][j]:\\n                    continue\\n                elif A[i][j] == A[i][k] + A[k][j]:\\n                    break\\n                else:\\n                    possible = False\\n                    break\\n            else:\\n                ans += A[i][j]\\n    print(ans if possible else -1)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import numpy as np\\n\\nN = int(input())\\nA = np.array([input().split() for _ in range(N)], dtype=np.int64).reshape(N,N)\\n\\nINF = 10**15\\nnp.fill_diagonal(A, INF)\\n\\nans = 0\\nfor i in range(N-1):\\n    for j in range(i+1,N):\\n        detour = np.min(A[i]+A[j])\\n        if detour > A[i][j]:\\n            ans+=A[i][j]\\n        elif detour < A[i][j]:\\n            print((-1))\\n            return\\nprint(ans)\\n\", \"def main():\\n    n = int(input())\\n    m = [list(map(int, input().split())) for _ in range(n)]\\n\\n    ans = 0\\n    for i in range(n - 1):\\n        for j in range(i + 1, n):\\n            d = m[i][j]\\n            for k in range(n):\\n                if k in (i, j):\\n                    continue\\n                t = m[i][k] + m[k][j]\\n                if t < d:\\n                    print((-1))\\n                    return\\n                if t == d:\\n                    break\\n            else:\\n                ans += d\\n    else:\\n        print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nstdin = sys.stdin\\n\\ndef li(): return map(int, stdin.readline().split())\\ndef li_(): return map(lambda x: int(x)-1, stdin.readline().split())\\ndef lf(): return map(float, stdin.readline().split())\\ndef ls(): return stdin.readline().split()\\ndef ns(): return stdin.readline().rstrip()\\ndef lc(): return list(ns())\\ndef ni(): return int(stdin.readline())\\ndef nf(): return float(stdin.readline())\\n\\nimport numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\n\\nn = ni()\\ng = np.zeros((n,n))\\nfor i in range(n):\\n    g[i,:] = np.array(list(li()))\\n    \\n    \\ndist = floyd_warshall(g, directed=False)\\n\\nconsis = True\\nfor i in range(n):\\n    for j in range(n):\\n        if g[i,j] != dist[i,j]:\\n            consis = False\\n            break\\n        \\nif not consis:\\n    print(-1)\\n    \\nelse:\\n    total = 0\\n    INF = float(\\\"inf\\\")\\n    \\n    for i in range(n):\\n        dist[i,i] = INF\\n        \\n    for i in range(n):\\n        for j in range(i+1,n):\\n            via_k = np.min(dist[i] + dist[j])\\n            \\n            if via_k > dist[i,j]:\\n                total += dist[i,j]\\n                \\n    print(int(total))\", \"import numpy as np\\nfrom scipy.sparse.csgraph import floyd_warshall\\nINF = 10**9\\n\\nn = int(input())\\na = np.array([list(map(int, input().split())) for _ in range(n)])\\na_opt = floyd_warshall(a)\\n# for i in range(n): print(a[i], a_opt[i])\\n\\nfor i in range(n):\\n    a[i][i] = INF\\n    \\nans = 0\\nfor i in range(n):\\n    for j in range(i+1, n):\\n        if a_opt[i][j] < a[i][j]:\\n            print((-1))\\n            return\\n        else:\\n            d = a[i][j]\\n            if d < np.min(a[i]+a[j]):\\n                ans += d\\n                \\n            # Straight solution, but TLE in python\\n            # for k in range(n):\\n            #     if k in [i, j]:\\n            #         continue\\n            #     elif a[i][k]+a[k][j] == d:\\n            #         d = 0\\n            # ans += d\\nprint(ans)\\n\", \"#!/usr/bin/env python3\\nimport sys\\n\\n\\ndef solve(N: int, A: \\\"List[List[int]]\\\"):\\n    import numpy as np\\n    from scipy.sparse.csgraph import floyd_warshall\\n    A = np.array(A, dtype=np.float64)\\n    B = floyd_warshall(A, directed=True)\\n    if not np.array_equal(A, B):\\n        return -1\\n    delta = 1e-7\\n    _, pre = floyd_warshall(A-delta+np.identity(N)*delta, return_predecessors=True)\\n    return int(A[pre == [[i]*N for i in range(N)]].sum()) // 2\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    N = int(next(tokens))  # type: int\\n    A = [[int(next(tokens)) for _ in range(N)] for _ in range(N)]  # type: \\\"List[List[int]]\\\"\\n    print((solve(N, A)))\\n\\ndef test():\\n    import doctest\\n    doctest.testmod()\\n\\ndef __starting_point():\\n    #test()\\n    main()\\n\\n__starting_point()\", \"import scipy.sparse as s,numpy as n\\nf=n.loadtxt(open(0),skiprows=1)\\ng=s.csgraph.dijkstra(f)\\nh=n.where(g,g,1)\\nprint(int(sum(t[j]*(t[j]<t+h[j]).all()for i,t in enumerate(h)for j in range(i)))*(f==g).all()or-1)\", \"import sys\\nimport numpy as np\\n\\nsr = lambda: sys.stdin.readline().rstrip()\\nir = lambda: int(sr())\\nlr = lambda: list(map(int, sr().split()))\\n\\nN = ir()\\nA = np.array([lr() for i in range(N)])\\nINF = 10 ** 10\\nnp.fill_diagonal(A, INF)\\nanswer = 0\\nfor i in range(N):\\n    for j in range(i+1, N):\\n        detour = np.min(A[i] + A[j])\\n        if A[i, j] < detour:\\n            # \\u6700\\u77ed\\u8ddd\\u96e2\\u3068\\u3057\\u3066\\u3053\\u306e\\u9053\\u8def\\u306f\\u5fc5\\u8981\\n            answer += A[i, j]\\n        elif A[i, j] > detour:\\n            print((-1))\\n            return\\n\\nprint(answer)\\n# 05 hint\\n\", \"from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall\\nimport numpy as np\\nN = int(input())\\nA = np.array([list(map(int, input().split())) for _ in [0]*N], dtype=np.int)\\nD = csgraph_from_dense(A)\\nD = floyd_warshall(D, directed=False)\\n\\nif (A == D).all():\\n    ans = 0\\n    D += np.identity(N, int) * (1 << 60)\\n    for i in range(N):\\n        for j in range(i+1, N):\\n            a = np.min(D[i]+D[j])\\n            if a > D[i, j]:\\n                ans += D[i, j]\\n    print((int(ans)))\\nelse:\\n    print((-1))\\n\"]",
        "difficulty": "interview",
        "input": "3\n0 1 3\n1 0 1\n3 1 0\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc074/tasks/arc083_b"
    },
    {
        "id": 327,
        "task_id": 2793,
        "test_case_id": 1,
        "question": "Given a directed weighted graph and two vertices $s$, $t$, the goal is to find a subset $U$ of the vertices such that $s \\in U$, $t \\not\\in U$, and the weight of edges from $U$ to $\\overline{U}$ is minimized.\n\n-----Input-----\nThe first line of input contains four non-negative integers, $2 \\le n \\le 500$, $0 \\le m \\le 10000$, $0 \\le s \\le n-1$ and $0 \\le t \\le n-1$, separated by single spaces, where $n$ is the numbers of nodes in the graph, $m$ is the number of edges, $s$ is the source and $t$ is the sink ($s \\ne t$). Nodes are numbered from $0$ to $n-1$. Then follow $m$ lines, each line consisting of three (space-separated) integers $u$, $v$ and $w$ indicating that there is an edge from $u$ to $v$ in the graph with weight $1 \\le w \\le 10^8$.\n\n-----Output-----\nOutput should begin with a line containing an integer $k$, giving the size of $U$. Then follow $k$ lines giving the vertices in $U$, one per line. If there are multiple choices for $U$ any one will be accepted.\n\nYou may assume that there is a cut such that the total weight of edges from $U$ to $\\overline{U}$ is less than $2^{31}$.\n\n-----Examples-----\nSample Input 1:\n4 5 0 3\n0 1 10\n1 2 1\n1 3 1\n0 2 1\n2 3 10\nSample Output 1:\n2\n1\n0\n\nSample Input 2:\n2 1 0 1\n0 1 100000\nSample Output 2:\n1\n0",
        "solutions": "",
        "difficulty": "interview",
        "input": "4 5 0 3\n0 1 10\n1 2 1\n1 3 1\n0 2 1\n2 3 10\n",
        "output": "2\n1\n0\n\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/mincut"
    },
    {
        "id": 328,
        "task_id": 2793,
        "test_case_id": 2,
        "question": "Given a directed weighted graph and two vertices $s$, $t$, the goal is to find a subset $U$ of the vertices such that $s \\in U$, $t \\not\\in U$, and the weight of edges from $U$ to $\\overline{U}$ is minimized.\n\n-----Input-----\nThe first line of input contains four non-negative integers, $2 \\le n \\le 500$, $0 \\le m \\le 10000$, $0 \\le s \\le n-1$ and $0 \\le t \\le n-1$, separated by single spaces, where $n$ is the numbers of nodes in the graph, $m$ is the number of edges, $s$ is the source and $t$ is the sink ($s \\ne t$). Nodes are numbered from $0$ to $n-1$. Then follow $m$ lines, each line consisting of three (space-separated) integers $u$, $v$ and $w$ indicating that there is an edge from $u$ to $v$ in the graph with weight $1 \\le w \\le 10^8$.\n\n-----Output-----\nOutput should begin with a line containing an integer $k$, giving the size of $U$. Then follow $k$ lines giving the vertices in $U$, one per line. If there are multiple choices for $U$ any one will be accepted.\n\nYou may assume that there is a cut such that the total weight of edges from $U$ to $\\overline{U}$ is less than $2^{31}$.\n\n-----Examples-----\nSample Input 1:\n4 5 0 3\n0 1 10\n1 2 1\n1 3 1\n0 2 1\n2 3 10\nSample Output 1:\n2\n1\n0\n\nSample Input 2:\n2 1 0 1\n0 1 100000\nSample Output 2:\n1\n0",
        "solutions": "",
        "difficulty": "interview",
        "input": "2 1 0 1\n0 1 100000\n",
        "output": "1\n0\n\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/mincut"
    },
    {
        "id": 329,
        "task_id": 3004,
        "test_case_id": 4,
        "question": "You need to hire some people to paint a fence. The fence is composed of $10000$ contiguous sections, numbered from $1$ to $10000$.\n\nYou get some offers from painters to help paint the fence. Each painter offers to paint a contiguous subset of fence sections in a particular color. You need to accept a set of the offers, such that:\n - Each section of the fence is painted.\n - At most 3 colors are used to paint the fence.\n\nIf it is possible to satisfy these two requirements, find the minimum number of offers that you must accept.\n\n-----Input-----\nThe first line of input contains an integer $N$, the number of offers. Then follow $N$ lines, one for each offer, each containing “$C$ $A$ $B$” where $C$ is the color, which is an uppercase string of up to 10 letters, $A$ is the first section and $B$ is the last section to be painted. $1 \\leq A \\leq B \\leq 10000$.\n\nYou may assume that $1 \\leq N \\leq 300$.\n\n-----Output-----\nOutput one line containing the number of offers that need to be accepted, or “IMPOSSIBLE” if there is no acceptable set of offers.\n\n-----Examples-----\nSample Input 1:\n2\nBLUE 1 5000\nRED 5001 10000\nSample Output 1:\n2\n\nSample Input 2:\n3\nBLUE 1 6000\nRED 2000 8000\nWHITE 7000 10000\nSample Output 2:\n3\n\nSample Input 3:\n4\nBLUE 1 3000\nRED 2000 5000\nORANGE 4000 8000\nGREEN 7000 10000\nSample Output 3:\nIMPOSSIBLE\n\nSample Input 4:\n2\nBLUE 1 4000\nRED 4002 10000\nSample Output 4:\nIMPOSSIBLE",
        "solutions": "",
        "difficulty": "competition",
        "input": "2\nBLUE 1 4000\nRED 4002 10000\n",
        "output": "IMPOSSIBLE\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/paintingafence"
    },
    {
        "id": 330,
        "task_id": 3183,
        "test_case_id": 1,
        "question": "-----Input-----\nThe first line of input contains a line contains a line with four non-negative integers, $2 \\le n \\le 250$, $0 \\le m \\le 5000$, $0 \\le s \\le n-1$ and $0 \\le t \\le n-1$, separated by single spaces, where $n$ is the numbers of nodes in the graph, $m$ is the number of edges, $s$ is the source and $t$ is the sink ($s \\ne t$). Nodes are numbered from $0$ to $n-1$. Then follow $m$ lines, each line consisting of four (space-separated) integers $u$, $v$, $c$ and $w$ indicating that there is an edge from $u$ to $v$ in the graph with capacity $1 \\le c \\le 10000$ and cost $1 \\le w \\le 1000$.\n\n-----Output-----\nOutput a single line containing two integers; the size $F$ of a maximum flow from node $s$ to node $t$, and the cost of a mimimum cost flow of size $F$. You may assume that $F < 2^{31}$.\n\n-----Examples-----\nSample Input 1:\n4 4 0 3\n0 1 4 10\n1 2 2 10\n0 2 4 30\n2 3 4 10\nSample Output 1:\n4 140\n\nSample Input 2:\n2 1 0 1\n0 1 1000 100\nSample Output 2:\n1000 100000",
        "solutions": "",
        "difficulty": "competition",
        "input": "4 4 0 3\n0 1 4 10\n1 2 2 10\n0 2 4 30\n2 3 4 10\n",
        "output": "4 140\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/mincostmaxflow"
    },
    {
        "id": 331,
        "task_id": 3334,
        "test_case_id": 1,
        "question": "Optimistan is a strange country. It is situated on an island with a huge desert in the middle, so most people live in port towns along the coast. As the name suggests, people of Optimistan (also called Optimists) like to optimise everything, so they only built roads necessary to connect all port towns together and not a single extra road. That means that there is only one way to get from one port town to another without visiting the same place twice.\n\nThe government installed multi-directional distance signs in $1$-kilometre intervals on one side of the road, to provide important information to drivers. Thus whenever you go from one port town to another, you pass the first sign at the port town and then one each kilometre. Every distance sign contains the shortest distances to all port towns, each written on a separate small sign directed towards the goal town.\n\nThe signs also serve another important function: to guide drivers on intersections. This means that distance of each intersection from every port town is an integer number of kilometres.\n\nYou bought a tourist guide of Optimistan which does not have a map of the country, but it contains a huge table with the shortest distances between all pairs of port towns. You quickly calculated the average shortest distance between all pairs of port towns, but then you started wondering: if the signs also contained shortest distances to all other signs, what would be the average number written on a sign? Could this be calculated just from the distance table in the tourist guide?\n\n-----Input-----\nThe input consists of:\n - one line with an integer $n$ ($2 \\le n \\le 500$), the number of ports;\n - $n-1$ lines, the $i$th of which contains $n-i$ integers. The $j$th integer on the $i$th line denotes the distance between port $i$ and port $i+j$ in kilometres. Each distance is between $1$ and $10^6$ (inclusive).\n\nYou can assume that the distances correspond to a road network in which there is exactly one path between two port towns that does not visit the same place twice. All roads can be used in both directions.\n\n-----Output-----\nOutput one line with the average distances in kilometres between all pairs of distance signs in Optimistan. Your answer should have an absolute or relative error of at most $10^{-9}$.\n\nIf it is impossible to determine the exact average of distances between all pairs of distance signs in Optimistan, output “impossible”.\n\n-----Examples-----\nSample Input:\n3\n4 4\n2\nSample Output:\n2.13333333333333",
        "solutions": "",
        "difficulty": "competition",
        "input": "3\n4 4\n2\n",
        "output": "2.13333333333333\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/optimistan"
    },
    {
        "id": 332,
        "task_id": 3334,
        "test_case_id": 2,
        "question": "Optimistan is a strange country. It is situated on an island with a huge desert in the middle, so most people live in port towns along the coast. As the name suggests, people of Optimistan (also called Optimists) like to optimise everything, so they only built roads necessary to connect all port towns together and not a single extra road. That means that there is only one way to get from one port town to another without visiting the same place twice.\n\nThe government installed multi-directional distance signs in $1$-kilometre intervals on one side of the road, to provide important information to drivers. Thus whenever you go from one port town to another, you pass the first sign at the port town and then one each kilometre. Every distance sign contains the shortest distances to all port towns, each written on a separate small sign directed towards the goal town.\n\nThe signs also serve another important function: to guide drivers on intersections. This means that distance of each intersection from every port town is an integer number of kilometres.\n\nYou bought a tourist guide of Optimistan which does not have a map of the country, but it contains a huge table with the shortest distances between all pairs of port towns. You quickly calculated the average shortest distance between all pairs of port towns, but then you started wondering: if the signs also contained shortest distances to all other signs, what would be the average number written on a sign? Could this be calculated just from the distance table in the tourist guide?\n\n-----Input-----\nThe input consists of:\n - one line with an integer $n$ ($2 \\le n \\le 500$), the number of ports;\n - $n-1$ lines, the $i$th of which contains $n-i$ integers. The $j$th integer on the $i$th line denotes the distance between port $i$ and port $i+j$ in kilometres. Each distance is between $1$ and $10^6$ (inclusive).\n\nYou can assume that the distances correspond to a road network in which there is exactly one path between two port towns that does not visit the same place twice. All roads can be used in both directions.\n\n-----Output-----\nOutput one line with the average distances in kilometres between all pairs of distance signs in Optimistan. Your answer should have an absolute or relative error of at most $10^{-9}$.\n\nIf it is impossible to determine the exact average of distances between all pairs of distance signs in Optimistan, output “impossible”.\n\n-----Examples-----\nSample Input:\n3\n4 4\n2\nSample Output:\n2.13333333333333",
        "solutions": "",
        "difficulty": "competition",
        "input": "4\n2 2 2\n2 2\n2\n",
        "output": "1.6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/optimistan"
    },
    {
        "id": 333,
        "task_id": 3370,
        "test_case_id": 1,
        "question": "The $N$ citizens of Eagleton have chosen to build their houses in a row along a single street (so that the houses can be numbered from $1$ to $N$, with $1$ the leftmost house and $N$ the rightmost). The houses have varying heights, with house $i$ being $h_ i$ inches tall. \n\nUnfortunately, all is not well in Eagleton: the citizens have a bit of an envy problem. Every day, one random citizen (the owner of house $i$, let’s say) emerges from their house and compares their house’s height to the heights of the two neighboring houses. If house $i$ is at least as tall as the average, plus $k$ inches (in other words, if $h_ i \\geq (h_{i-1} + h_{i+1}) / 2 + k$), the citizen retreats back into their house, satisfied. Otherwise, the citizen remodels their house to have new height $(h_{i-1} + h_{i+1}) / 2 + k$. (The citizen does this remodeling even if the new height is only a tiny fraction of an inch taller than the old height—like we said, Eagleton has an envy problem.)\n\nThe left of house $1$ and the right of house $N$ is a nature preserve; the citizens of these houses treat the preserve as a “house” having height zero inches, for the purposes of the above calculations.\n\nThe city council of Eagleton is fed up with the constant construction traffic and noise, and has hired you to compute what Eagleton will look like when all of the remodeling is finally over. After some calculations, you discover that it is guaranteed that each house will converge to a final finite height after infinitely many days of the above remodeling process. Print the final height of the house that ends up tallest.\n\n-----Input-----\nThe first line of input consists of an integer $N$ and real number $k$, separated by a space $(1 \\leq N \\leq 100000; 0 \\leq k \\leq 10^{20})$: the number of houses in Eagleton and the number of inches each citizen wants their own house to be taller than the average of their neighbors.\n\n$N$ lines follow. The $i$th such line (starting at $i=1$) contains a real number $h_ i$ ($0 \\leq h_ i \\leq 10^{20}$), the initial height (in inches) of house $i$.\n\nThe real numbers in the input may be provided in scientific notation (see for instance Sample Input 2) and will have at most ten digits after the decimal point.\n\n-----Output-----\nPrint the height (in inches) of the tallest house, after all houses have been remodeled over infinitely many days of the process described above. Your answer will be judged correct if the absolute or relative error is within $10^{-6}$.\n\n-----Examples-----\nSample Input:\n3 1\n39\n10\n40\nSample Output:\n40.5",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1\n39\n10\n40\n",
        "output": "40.5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/skysthelimit"
    },
    {
        "id": 334,
        "task_id": 3370,
        "test_case_id": 2,
        "question": "The $N$ citizens of Eagleton have chosen to build their houses in a row along a single street (so that the houses can be numbered from $1$ to $N$, with $1$ the leftmost house and $N$ the rightmost). The houses have varying heights, with house $i$ being $h_ i$ inches tall. \n\nUnfortunately, all is not well in Eagleton: the citizens have a bit of an envy problem. Every day, one random citizen (the owner of house $i$, let’s say) emerges from their house and compares their house’s height to the heights of the two neighboring houses. If house $i$ is at least as tall as the average, plus $k$ inches (in other words, if $h_ i \\geq (h_{i-1} + h_{i+1}) / 2 + k$), the citizen retreats back into their house, satisfied. Otherwise, the citizen remodels their house to have new height $(h_{i-1} + h_{i+1}) / 2 + k$. (The citizen does this remodeling even if the new height is only a tiny fraction of an inch taller than the old height—like we said, Eagleton has an envy problem.)\n\nThe left of house $1$ and the right of house $N$ is a nature preserve; the citizens of these houses treat the preserve as a “house” having height zero inches, for the purposes of the above calculations.\n\nThe city council of Eagleton is fed up with the constant construction traffic and noise, and has hired you to compute what Eagleton will look like when all of the remodeling is finally over. After some calculations, you discover that it is guaranteed that each house will converge to a final finite height after infinitely many days of the above remodeling process. Print the final height of the house that ends up tallest.\n\n-----Input-----\nThe first line of input consists of an integer $N$ and real number $k$, separated by a space $(1 \\leq N \\leq 100000; 0 \\leq k \\leq 10^{20})$: the number of houses in Eagleton and the number of inches each citizen wants their own house to be taller than the average of their neighbors.\n\n$N$ lines follow. The $i$th such line (starting at $i=1$) contains a real number $h_ i$ ($0 \\leq h_ i \\leq 10^{20}$), the initial height (in inches) of house $i$.\n\nThe real numbers in the input may be provided in scientific notation (see for instance Sample Input 2) and will have at most ten digits after the decimal point.\n\n-----Output-----\nPrint the height (in inches) of the tallest house, after all houses have been remodeled over infinitely many days of the process described above. Your answer will be judged correct if the absolute or relative error is within $10^{-6}$.\n\n-----Examples-----\nSample Input:\n3 1\n39\n10\n40\nSample Output:\n40.5",
        "solutions": "",
        "difficulty": "competition",
        "input": "5 0.1\n1.01e6\n1.0e3\n100\n20.45\n0\n",
        "output": "1010000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/skysthelimit"
    },
    {
        "id": 335,
        "task_id": 3378,
        "test_case_id": 1,
        "question": "Ivan is planning a large European tour with his jazz band. There are a total of $n$ cities in Europe, numbered with integers $1$ through $n$. Ivan is planning $d$ concerts in cities $a_1, a_2, \\dots , a_ d$ in that exact order, never having two consecutive concerts in the same city ($a_ i \\not= a_{i+1}$), possibly visiting some of the cities many times and, finally, ending the tour in the same city where it begun ($a_1 = a_ d$).\n\nIvan always takes a direct flight between cities $a_ i$ and $a_{i+1}$. However, he is trying to be smart with his ticket purchases in order to save money. As you may know, airlines price tickets based on supply and demand and, for example, it may be possible that one-way tickets are more expensive than round trip tickets between same cities. Generally, there are two kinds of tickets available for purchase:\n - One-way ticket from the origin city $a$ to destination city $b$ can be used to fly from $a$ to $b$ once (but not in the opposite direction).\n - Round trip ticket from the origin city $a$ to destination city $b$ can be used to fly once from $a$ to $b$, and once from $b$ to $a$. The return segment (from $b$ to $a$) does not need to be used. However, the segments have to be flown in order – it is not allowed for Ivan to use the return segment of $a$ ticket to fly from $b$ to a unless he has used the first segment of that ticket to fly from $a$ to $b$ before.\n\nYou are given a list of available airfares, find the least amount of money Ivan needs to spend on tickets to be able to complete his journey. Ivan can purchase an arbitrary number of tickets for each airfare. Once again, Ivan needs to take a direct flight from $a_ i$ to $a_{i+1}$ for every $i = 1, 2, \\dots , d - 1$. You may assume that is possible to complete the journey using the airfares.\n\n-----Input-----\nThe first line contains two integers $n$ and $d$ ($2 \\le n, d \\le 300000$) – the number of cities in Europe and the number of concerts. The following line contains integers $a_1, a_2, \\dots , a_ d$ ($1 \\le ai \\le n, ai \\not= a_{i+1}, a_1 = a_ d$) – the planned tour schedule.\n\nThe following line contains an integer $m$ ($3 \\le m \\le 300000$) – the number of airfares. The $k$-th of the following $m$ lines contains four tokens $s_ k$, $d_ k$, $t_ k$, $p_ k$, describing the $k$-th airfare as follows:\n - $s_ k$ and $d_ k$ ($1 \\le s_ k, d_ k \\le n, s_ k \\not= d_ k$) are the origin and the destination city respectively,\n - $t_ k$ is an uppercase letter “O” or “R” denoting a one-way or round trip ticket respectively,\n - $p_ k$ ($1 \\le pk \\le 10^9$) is the ticket price, an integer.\n\n-----Output-----\nOutput the least amount of money necessary to purchase tickets that allow Ivan to complete the planned tour.\n\n-----Examples-----\nSample Input:\n2 5\n1 2 1 2 1\n4\n1 2 R 6\n1 2 O 3\n2 1 O 3\n1 2 R 5\nSample Output:\n10",
        "solutions": "",
        "difficulty": "competition",
        "input": "2 5\n1 2 1 2 1\n4\n1 2 R 6\n1 2 O 3\n2 1 O 3\n1 2 R 5\n",
        "output": "10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/jazzjourney"
    },
    {
        "id": 336,
        "task_id": 3378,
        "test_case_id": 2,
        "question": "Ivan is planning a large European tour with his jazz band. There are a total of $n$ cities in Europe, numbered with integers $1$ through $n$. Ivan is planning $d$ concerts in cities $a_1, a_2, \\dots , a_ d$ in that exact order, never having two consecutive concerts in the same city ($a_ i \\not= a_{i+1}$), possibly visiting some of the cities many times and, finally, ending the tour in the same city where it begun ($a_1 = a_ d$).\n\nIvan always takes a direct flight between cities $a_ i$ and $a_{i+1}$. However, he is trying to be smart with his ticket purchases in order to save money. As you may know, airlines price tickets based on supply and demand and, for example, it may be possible that one-way tickets are more expensive than round trip tickets between same cities. Generally, there are two kinds of tickets available for purchase:\n - One-way ticket from the origin city $a$ to destination city $b$ can be used to fly from $a$ to $b$ once (but not in the opposite direction).\n - Round trip ticket from the origin city $a$ to destination city $b$ can be used to fly once from $a$ to $b$, and once from $b$ to $a$. The return segment (from $b$ to $a$) does not need to be used. However, the segments have to be flown in order – it is not allowed for Ivan to use the return segment of $a$ ticket to fly from $b$ to a unless he has used the first segment of that ticket to fly from $a$ to $b$ before.\n\nYou are given a list of available airfares, find the least amount of money Ivan needs to spend on tickets to be able to complete his journey. Ivan can purchase an arbitrary number of tickets for each airfare. Once again, Ivan needs to take a direct flight from $a_ i$ to $a_{i+1}$ for every $i = 1, 2, \\dots , d - 1$. You may assume that is possible to complete the journey using the airfares.\n\n-----Input-----\nThe first line contains two integers $n$ and $d$ ($2 \\le n, d \\le 300000$) – the number of cities in Europe and the number of concerts. The following line contains integers $a_1, a_2, \\dots , a_ d$ ($1 \\le ai \\le n, ai \\not= a_{i+1}, a_1 = a_ d$) – the planned tour schedule.\n\nThe following line contains an integer $m$ ($3 \\le m \\le 300000$) – the number of airfares. The $k$-th of the following $m$ lines contains four tokens $s_ k$, $d_ k$, $t_ k$, $p_ k$, describing the $k$-th airfare as follows:\n - $s_ k$ and $d_ k$ ($1 \\le s_ k, d_ k \\le n, s_ k \\not= d_ k$) are the origin and the destination city respectively,\n - $t_ k$ is an uppercase letter “O” or “R” denoting a one-way or round trip ticket respectively,\n - $p_ k$ ($1 \\le pk \\le 10^9$) is the ticket price, an integer.\n\n-----Output-----\nOutput the least amount of money necessary to purchase tickets that allow Ivan to complete the planned tour.\n\n-----Examples-----\nSample Input:\n2 5\n1 2 1 2 1\n4\n1 2 R 6\n1 2 O 3\n2 1 O 3\n1 2 R 5\nSample Output:\n10",
        "solutions": "",
        "difficulty": "competition",
        "input": "4 10\n1 2 3 1 2 1 3 2 4 1\n9\n2 4 O 10\n1 3 R 1\n3 1 R 10\n2 3 R 20\n1 2 R 10\n1 2 O 20\n2 3 O 5\n3 2 O 5\n4 1 O 10\n",
        "output": "60\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/jazzjourney"
    },
    {
        "id": 337,
        "task_id": 3428,
        "test_case_id": 1,
        "question": "In 1978 AD the great Sir Isaac Newton, whilst proving that $\\mathcal{P}$ is a strict superset of $\\mathcal{NP}$, defined the Beta Alpha Pi Zeta function $f$ as follows over any sequence of positive integers $a_1, \\dots , a_ n$. Given integers $1\\leq i\\leq j\\leq n$, we define $f(i, j)$ as $\\gcd (a_ i, a_{i+1}, \\dots , a_{j-1}, a_ j)$. \n\nAbout a century later Lothar Collatz applied this function to the sequence $1, 1, 1, \\dots , 1$, and observed that $f$ always equalled $1$. Based on this, he conjectured that $f$ is always a constant function, no matter what the sequence $a_ i$ is. This conjecture, now widely known as the Collatz Conjecture, is one of the major open problems in botanical studies. (The Strong Collatz Conjecture claims that however many values $f$ takes on, the real part is always $\\frac{1}{2}$.)\n\nYou, a budding young cultural anthropologist, have decided to disprove this conjecture. Given a sequence $a_ i$, calculate how many different values $f$ takes on.\n\n-----Input-----\nThe input consists of two lines.\n - A single integer $1 \\leq n \\leq 5 \\cdot 10^5$, the length of the sequence.\n - The sequence of integers $a_1, a_2, \\dots , a_ n$. It is given that $1 \\leq a_ i \\leq 10^{18}$.\n\n-----Output-----\nOutput a single line containing a single integer, the number of distinct values $f$ takes on over the given sequence.\n\n-----Examples-----\nSample Input:\n4\n9 6 2 4\nSample Output:\n6",
        "solutions": "",
        "difficulty": "competition",
        "input": "4\n9 6 2 4\n",
        "output": "6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/collatzconjecture"
    },
    {
        "id": 338,
        "task_id": 3428,
        "test_case_id": 2,
        "question": "In 1978 AD the great Sir Isaac Newton, whilst proving that $\\mathcal{P}$ is a strict superset of $\\mathcal{NP}$, defined the Beta Alpha Pi Zeta function $f$ as follows over any sequence of positive integers $a_1, \\dots , a_ n$. Given integers $1\\leq i\\leq j\\leq n$, we define $f(i, j)$ as $\\gcd (a_ i, a_{i+1}, \\dots , a_{j-1}, a_ j)$. \n\nAbout a century later Lothar Collatz applied this function to the sequence $1, 1, 1, \\dots , 1$, and observed that $f$ always equalled $1$. Based on this, he conjectured that $f$ is always a constant function, no matter what the sequence $a_ i$ is. This conjecture, now widely known as the Collatz Conjecture, is one of the major open problems in botanical studies. (The Strong Collatz Conjecture claims that however many values $f$ takes on, the real part is always $\\frac{1}{2}$.)\n\nYou, a budding young cultural anthropologist, have decided to disprove this conjecture. Given a sequence $a_ i$, calculate how many different values $f$ takes on.\n\n-----Input-----\nThe input consists of two lines.\n - A single integer $1 \\leq n \\leq 5 \\cdot 10^5$, the length of the sequence.\n - The sequence of integers $a_1, a_2, \\dots , a_ n$. It is given that $1 \\leq a_ i \\leq 10^{18}$.\n\n-----Output-----\nOutput a single line containing a single integer, the number of distinct values $f$ takes on over the given sequence.\n\n-----Examples-----\nSample Input:\n4\n9 6 2 4\nSample Output:\n6",
        "solutions": "",
        "difficulty": "competition",
        "input": "4\n9 6 3 4\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/collatzconjecture"
    },
    {
        "id": 339,
        "task_id": 3444,
        "test_case_id": 1,
        "question": "Lukáš loves skiing. One morning, the sun was shining like no other sun had ever shone before, and he wanted to do something exciting. There had been a slight storm during the night, and the wind had cleared snow from certain parts of the mountain, making them icy and more dangerous to ski down. Lukáš was aware of this, but brave as he (mostly) is, he decided that he would climb his favourite mountain and go for some really exciting skiing. \n\nLukáš starts at the top of the mountain, and wants to get to the bottom. There are $N$ small cabins scattered along the mountainside, numbered $0$ to $N-1$. He will always go from one cabin to another, along certain pistes. For each piste, which always connects exactly two cabins, he has calculated the probability of falling along that piste. The cabin numbered $0$ is located at the top, and the cabin numbered $N-1$ is located at the bottom of the mountain.\n\nIf Lukáš feels like it, he can take his skis off and walk down a piste instead. By doing this, it is guaranteed that he will not fall along this piste in the direction that he walks. But taking the skis off is not very brave…\n\nLukáš can only ski down the mountain, i.e. from a lower numbered cabin to a higher numbered one, but he can walk along any piste in any direction. It is guaranteed that Lukáš can walk from the top of the mountain to the bottom of it.\n\nYour task is to help Lukáš predict his chances of getting down the hill without falling. For each number $k \\in [0,N-1]$ you should calculate the maximum probability that Lukáš gets down the hill without falling, while walking along at most $k$ pistes, and assuming he choses his walking wisely.\n\n-----Input-----\nThe first line contains two integers $1 \\le N \\le 300$ and $0 \\le M \\le \\frac{N(N-1)}{2}$, the number of cabins and pistes respectively.\n\nThen follow $M$ lines, each describing a piste with three numbers $0 \\le a, b < N$ and $0 \\le w \\le 1$, where $a$ and $b$ are the numbers of the cabins the piste connects, and $w$ is the probability that Lukáš will fall while skiing down the piste.\n\n-----Output-----\nOutput should consist of $N$ floating point numbers $p_ k$ ($k \\in [0,N-1]$), each denoting the maximum probability that Lukáš didn’t fall when walking along at most $k$ pistes. If it is impossible to get down the hill by walking along at most $k$ pistes, then output $p_ k=-1$. Output them on a single line separated by spaces. Your answer is considered correct if the relative or absolute error is at most $10^{-9}$.\n\n-----Examples-----\nSample Input:\n2 1\n0 1 0.5\nSample Output:\n0.500000000 1.000000000",
        "solutions": "",
        "difficulty": "competition",
        "input": "2 1\n0 1 0.5\n",
        "output": "0.500000000 1.000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/dangerousskiing"
    },
    {
        "id": 340,
        "task_id": 3444,
        "test_case_id": 2,
        "question": "Lukáš loves skiing. One morning, the sun was shining like no other sun had ever shone before, and he wanted to do something exciting. There had been a slight storm during the night, and the wind had cleared snow from certain parts of the mountain, making them icy and more dangerous to ski down. Lukáš was aware of this, but brave as he (mostly) is, he decided that he would climb his favourite mountain and go for some really exciting skiing. \n\nLukáš starts at the top of the mountain, and wants to get to the bottom. There are $N$ small cabins scattered along the mountainside, numbered $0$ to $N-1$. He will always go from one cabin to another, along certain pistes. For each piste, which always connects exactly two cabins, he has calculated the probability of falling along that piste. The cabin numbered $0$ is located at the top, and the cabin numbered $N-1$ is located at the bottom of the mountain.\n\nIf Lukáš feels like it, he can take his skis off and walk down a piste instead. By doing this, it is guaranteed that he will not fall along this piste in the direction that he walks. But taking the skis off is not very brave…\n\nLukáš can only ski down the mountain, i.e. from a lower numbered cabin to a higher numbered one, but he can walk along any piste in any direction. It is guaranteed that Lukáš can walk from the top of the mountain to the bottom of it.\n\nYour task is to help Lukáš predict his chances of getting down the hill without falling. For each number $k \\in [0,N-1]$ you should calculate the maximum probability that Lukáš gets down the hill without falling, while walking along at most $k$ pistes, and assuming he choses his walking wisely.\n\n-----Input-----\nThe first line contains two integers $1 \\le N \\le 300$ and $0 \\le M \\le \\frac{N(N-1)}{2}$, the number of cabins and pistes respectively.\n\nThen follow $M$ lines, each describing a piste with three numbers $0 \\le a, b < N$ and $0 \\le w \\le 1$, where $a$ and $b$ are the numbers of the cabins the piste connects, and $w$ is the probability that Lukáš will fall while skiing down the piste.\n\n-----Output-----\nOutput should consist of $N$ floating point numbers $p_ k$ ($k \\in [0,N-1]$), each denoting the maximum probability that Lukáš didn’t fall when walking along at most $k$ pistes. If it is impossible to get down the hill by walking along at most $k$ pistes, then output $p_ k=-1$. Output them on a single line separated by spaces. Your answer is considered correct if the relative or absolute error is at most $10^{-9}$.\n\n-----Examples-----\nSample Input:\n2 1\n0 1 0.5\nSample Output:\n0.500000000 1.000000000",
        "solutions": "",
        "difficulty": "competition",
        "input": "2 1\n0 1 0.25\n",
        "output": "0.750000000 1.000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/dangerousskiing"
    },
    {
        "id": 341,
        "task_id": 3568,
        "test_case_id": 1,
        "question": "Your friend’s newest hobby is to play movie theme songs on her freshly acquired floppy drive organ. This organ is a collection of good old floppy drives, where each drive has been tampered with to produce sound of a unique frequency. The sound is produced by a step motor that moves the read/write head of the floppy drive along the radial axis of the drive’s spin disk. The radial axis starts in the center of the spin disk and ends at the outer edge of the spin disk.\n\nThe sound from one drive will play continuously as long as the read/write head keeps moving in one direction; when the head changes direction, there is a brief pause of $1$fs—one floppysecond, or about $100$ microseconds. The read/write head must change direction when it reaches either the inner or the outer end point of the radial axis, but it can also change direction at any other point along this axis, as determined by your friend. You can make the head stay still at any time and for as long as you wish. The starting position of the read-write head can be chosen freely.\n\nYour friend is a nutcase perfectionist, and will not accept any pauses where there are not supposed to be any; nor will she accept sound when there is meant to be silence. To figure out whether a given piece of music can be played—perfectly—on her organ, she has asked for your help.\n\nFor each frequency, you are given a list of intervals, each describing when that particular frequency should play, and you must decide if all of the frequencies can be played as intended. You can assume your friend has enough drives to cover all the required frequencies.\n\n-----Input-----\nThe first line contains an integer $f, 1 \\leq f \\leq 10$, denoting the number of frequencies used. Then follow $f$ blocks, on the format:\n - A single line with two integers $t_ i, 1\\leq t_ i \\leq 10\\ 000$ and $n_ i, 1\\leq n_ i \\leq 100$; the number of floppyseconds it takes for the read/write head of frequency $i$ to move between the end points of its radial axis, and the number of intervals for which frequency $i$ should play.\n - $n_ i$ lines, where the $j$-th line has two integers $t_{i,2j}, t_{i,2j+1}$, where $0\\leq t_{i,2j},t_{i,2j+1} \\leq 1\\ 000\\ 000$, indicating that the $i$-th frequency should start playing at time $t_{i,2j}$ and stop playing at time $t_{i,2j+1}$. You can assume that these numbers are in stricly ascending order, i.e. $t_{i,1} < t_{i,2} < \\dots < t_{i, 2n_ i}$.\n\n-----Output-----\nIf it is possible to play all the $f$ frequencies as intended, output “possible”. Otherwise output “impossible”.\n\n-----Examples-----\nSample Input:\n1\n6 2\n0 4\n6 12\nSample Output:\npossible",
        "solutions": "",
        "difficulty": "competition",
        "input": "1\n6 2\n0 4\n6 12\n",
        "output": "possible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/floppy"
    },
    {
        "id": 342,
        "task_id": 3785,
        "test_case_id": 1,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "3 4 2\n#..#\n..#.\n#...\n",
        "output": "#.X#\nX.#.\n#...\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 343,
        "task_id": 3785,
        "test_case_id": 2,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n",
        "output": "#XXX\n#X#.\nX#..\n...#\n.#.#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 344,
        "task_id": 3785,
        "test_case_id": 3,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "3 3 2\n...\n.#.\n...\n",
        "output": "X..\nX#.\n...\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 345,
        "task_id": 3785,
        "test_case_id": 4,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "3 3 2\n#.#\n...\n#.#\n",
        "output": "#X#\nX..\n#.#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 346,
        "task_id": 3785,
        "test_case_id": 5,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "7 7 18\n#.....#\n..#.#..\n.#...#.\n...#...\n.#...#.\n..#.#..\n#.....#\n",
        "output": "#XXXXX#\nXX#X#X.\nX#XXX#.\nXXX#...\nX#...#.\nX.#.#..\n#.....#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 347,
        "task_id": 3785,
        "test_case_id": 6,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "5 9 19\n.........\n.#.#.#.#.\n.........\n.#.#.#.#.\n.........\n",
        "output": "XXXXXX...\nX#X#X#.#.\nXXXXX....\nX#X#.#.#.\nXXX......\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 348,
        "task_id": 3785,
        "test_case_id": 8,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "2 3 1\n..#\n#..\n",
        "output": "X.#\n#..\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 349,
        "task_id": 3785,
        "test_case_id": 12,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "3 3 1\n#..\n.#.\n...\n",
        "output": "#..\nX#.\n...\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 350,
        "task_id": 3785,
        "test_case_id": 14,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "5 4 4\n#..#\n....\n.##.\n....\n#..#\n",
        "output": "#XX#\nXX..\n.##.\n....\n#..#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 351,
        "task_id": 3785,
        "test_case_id": 15,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "5 5 2\n.#..#\n..#.#\n#....\n##.#.\n###..\n",
        "output": "X#..#\nX.#.#\n#....\n##.#.\n###..\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 352,
        "task_id": 3785,
        "test_case_id": 16,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "4 6 3\n#.....\n#.#.#.\n.#...#\n...#.#\n",
        "output": "#.....\n#X#.#X\nX#...#\n...#.#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 353,
        "task_id": 3785,
        "test_case_id": 18,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "8 6 5\n####.#\n...#..\n.#..#.\n..#...\n####.#\n..#..#\n.#.#..\n......\n",
        "output": "####.#\nXX.#..\nX#..#.\nXX#...\n####.#\n..#..#\n.#.#..\n......\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 354,
        "task_id": 3785,
        "test_case_id": 19,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "16 14 19\n##############\n..############\n#.############\n#..###########\n....##########\n..############\n.#############\n.#.###########\n....##########\n###..#########\n##...#########\n###....#######\n###.##.......#\n###..###.#..#.\n###....#......\n#...#...##.###\n",
        "output": "##############\nXX############\n#X############\n#XX###########\nXXXX##########\nXX############\nX#############\nX#.###########\nX...##########\n###..#########\n##...#########\n###....#######\n###.##.......#\n###..###.#..#.\n###...X#......\n#X..#XXX##.###\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 355,
        "task_id": 3785,
        "test_case_id": 20,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "17 18 37\n##################\n##################\n#################.\n################..\n###############..#\n###############.##\n##############...#\n###############.#.\n##############....\n############....##\n############..#.#.\n#############.....\n####.########..##.\n##.....###.###.#..\n####.........#....\n####.##.#........#\n###..###.....##...\n",
        "output": "##################\n##################\n#################X\n################XX\n###############XX#\n###############X##\n##############XXX#\n###############X#X\n##############XXXX\n############XXXX##\n############X.#.#.\n#############.....\n####X########..##.\n##XXXXX###.###.#..\n####XXXXXX...#....\n####X##X#........#\n###XX###X....##...\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 356,
        "task_id": 3785,
        "test_case_id": 23,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "16 10 38\n##########\n##########\n##########\n..########\n...#######\n...#######\n...#######\n....######\n.....####.\n......###.\n......##..\n.......#..\n.........#\n.........#\n.........#\n.........#\n",
        "output": "##########\n##########\n##########\nXX########\nXXX#######\nXXX#######\nXXX#######\nXXXX######\nXXXXX####.\nXXXXX.###.\nXXXX..##..\nXXX....#..\nXXX......#\nXX.......#\nX........#\n.........#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 357,
        "task_id": 3785,
        "test_case_id": 24,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "15 16 19\n########.....###\n########.....###\n############.###\n############.###\n############.###\n############.###\n############.###\n############.###\n############.###\n############.###\n.....#####.#..##\n................\n.#...........###\n###.########.###\n###.########.###\n",
        "output": "########XXXXX###\n########XXXXX###\n############.###\n############.###\n############.###\n############.###\n############.###\n############.###\n############.###\n############.###\nXXXX.#####.#..##\nXXX.............\nX#...........###\n###.########.###\n###X########.###\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 358,
        "task_id": 3785,
        "test_case_id": 25,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "12 19 42\n.........##########\n...................\n.##.##############.\n..################.\n..#################\n..#################\n..#################\n..#################\n..#################\n..#################\n..##########.######\n.............######\n",
        "output": "XXXXXXXXX##########\nXXXXXXXXXXXXXXXXXXX\nX##X##############X\nXX################X\nXX#################\nXX#################\nXX#################\nX.#################\nX.#################\n..#################\n..##########.######\n.............######\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 359,
        "task_id": 3785,
        "test_case_id": 33,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "3 5 2\n..#..\n..#..\n....#\n",
        "output": "X.#..\nX.#..\n....#\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 360,
        "task_id": 3785,
        "test_case_id": 35,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "4 5 1\n###..\n###..\n..##.\n.....\n",
        "output": "###..\n###..\nX.##.\n.....\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 361,
        "task_id": 3785,
        "test_case_id": 39,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "10 10 1\n##########\n##..##..##\n#...##...#\n#.######.#\n#..####..#\n#..####..#\n#.######.#\n#........#\n##..##..##\n##########\n",
        "output": "##########\n##.X##..##\n#...##...#\n#.######.#\n#..####..#\n#..####..#\n#.######.#\n#........#\n##..##..##\n##########\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 362,
        "task_id": 3785,
        "test_case_id": 41,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "2 5 2\n###..\n###..\n",
        "output": "###X.\n###X.\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 363,
        "task_id": 3785,
        "test_case_id": 51,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "5 5 1\n###..\n###..\n####.\n..##.\n.....\n",
        "output": "###..\n###..\n####.\nX.##.\n.....\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 364,
        "task_id": 3785,
        "test_case_id": 53,
        "question": "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common side.\n\nPavel drew a grid maze with all empty cells forming a connected area. That is, you can go from any empty cell to any other one. Pavel doesn't like it when his maze has too little walls. He wants to turn exactly k empty cells into walls so that all the remaining cells still formed a connected area. Help him.\n\n\n-----Input-----\n\nThe first line contains three integers n, m, k (1 ≤ n, m ≤ 500, 0 ≤ k < s), where n and m are the maze's height and width, correspondingly, k is the number of walls Pavel wants to add and letter s represents the number of empty cells in the original maze.\n\nEach of the next n lines contains m characters. They describe the original maze. If a character on a line equals \".\", then the corresponding cell is empty and if the character equals \"#\", then the cell is a wall.\n\n\n-----Output-----\n\nPrint n lines containing m characters each: the new maze that fits Pavel's requirements. Mark the empty cells that you transformed into walls as \"X\", the other cells must be left without changes (that is, \".\" and \"#\").\n\nIt is guaranteed that a solution exists. If there are multiple solutions you can output any of them.\n\n\n-----Examples-----\nInput\n3 4 2\n#..#\n..#.\n#...\n\nOutput\n#.X#\nX.#.\n#...\n\nInput\n5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n\nOutput\n#XXX\n#X#.\nX#..\n...#\n.#.#",
        "solutions": "[\"import sys\\n\\nn, m, k = (int(x) for x in sys.stdin.readline().split(' '))\\nmaze = []\\nfor i in range(n):\\n    maze.append(list(sys.stdin.readline().strip()))\\n\\nfor y in range(n):\\n    for x in range(m):\\n        if maze[y][x] == '.':\\n            x0, y0 = x, y\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print('no spare room')\\n    return\\n\\nstack = []\\nstack.append((x0,y0))\\nwhile stack:\\n    x, y = stack[-1]\\n\\n    if maze[y][x] == '.':\\n        maze[y][x] = '0'\\n        if x > 0 and maze[y][x-1] == '.':\\n            stack.append((x-1, y))\\n    elif maze[y][x] == '0':\\n        maze[y][x] = '1'\\n        if y < n-1 and maze[y+1][x] == '.':\\n            stack.append((x, y+1))\\n    elif maze[y][x] == '1':\\n        maze[y][x] = '2'\\n        if x < m-1 and maze[y][x+1] == '.':\\n            stack.append((x+1, y))\\n    elif maze[y][x] == '2':\\n        maze[y][x] = '3'\\n        if y > 0 and maze[y-1][x] == '.':\\n            stack.append((x, y-1))\\n    elif maze[y][x] == '3':\\n        if k > 0:\\n            maze[y][x] = 'X'\\n            k -= 1\\n        stack.pop()\\n\\nfor y in range(n):\\n    for x in range(m):\\n        maze[y][x] = '.' if maze[y][x] == '3' else maze[y][x]\\n\\nprint(\\\"\\\\n\\\".join([\\\"\\\".join(s) for s in maze]))\\n\", \"n, m, k = list(map(int, input().split()))\\nt = [input().replace('.', 'X') for i in range(n)]\\nk = n * m - k - sum(i.count('#') for i in t)\\nt = [list(i) for i in t]\\ni, p = 0, []\\nwhile k:\\n    if 'X' in t[i]:\\n        j = t[i].index('X')\\n        t[i][j], p = '.', [(i, j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x, y = p.pop()\\n    for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\\n        if i < 0 or j < 0: continue\\n        if i < n and j < m and t[i][j] == 'X':\\n            t[i][j] = '.'\\n            p.append((i, j))\\n            k -= 1\\n            if k == 0: break\\nfor i in range(n): t[i] = ''.join(t[i])\\nprint('\\\\n'.join(t))\\n\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p = [(i, j)]\\n            x += 1\\n\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p[-1]\\n    p.pop()\\n    #print(i,j,sa)\\n    if not visited[i][j]:\\n        if ok(i, j-1):\\n            if not visited[i][j-1]:\\n                p.append((i, j-1))\\n        if ok(i, j+1):\\n            if not visited[i][j+1]:\\n                p.append((i, j+1))\\n        if ok(i+1, j):\\n            if not visited[i+1][j]:\\n                p.append((i+1, j))\\n        if ok(i-1, j):\\n            if not visited[i-1][j]:\\n                p.append((i-1, j))\\n        visited[i][j] = True\\n        sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\n\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            x += 1\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i,j))\\n            break\\nvisited = [[False for _ in range(b)] for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] == '.':\\n            return True\\n    return False\\n\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    if visited[i][j]:\\n        continue\\n    #print(i,j,sa)\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n    visited[i][j] = True\\n    sa+=1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"a, b, c = map(int, input().split(' '))\\narray = [[i for i in input()] for j in range(a)]\\np = []\\nx = 0\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.':\\n            p.append((i, j))\\n            x += 1\\n\\nvisited = [[False] * b for i in range(a)]\\ndef ok(i, j):\\n    if 0 <= i <= a-1 and 0 <= j <= b-1:\\n        if array[i][j] != '#':\\n            return True\\n    return False\\nsa = 0\\nwhile sa < x-c:\\n    i, j = p.pop()\\n    \\n    if visited[i][j]:\\n    \\n        continue\\n    if ok(i, j-1):\\n        if not visited[i][j-1]:\\n            p.append((i, j-1))\\n\\n    if ok(i, j+1):\\n        if not visited[i][j+1]:\\n            p.append((i, j+1))\\n\\n    if ok(i+1, j):\\n        if not visited[i+1][j]:\\n            p.append((i+1, j))\\n\\n    if ok(i-1, j):\\n        if not visited[i-1][j]:\\n            p.append((i-1, j))\\n     \\n    visited[i][j] = True\\n    sa += 1\\n\\nfor i in range(a):\\n    for j in range(b):\\n        if array[i][j] == '.' and not visited[i][j]:\\n            array[i][j] = 'X'\\n\\nfor each in [''.join(i) for i in array]:\\n    print(each)\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    nxt = {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, set()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = [], [l.index(True)]\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        nxt.clear()\\n        for i in cur:\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.append(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    if res[j]:\\n                        nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    n, m, k = map(int, input().split())\\n    mn = m * n\\n    l = [_ == '.' for _ in range(n) for _ in input()]\\n    neigh = [[] for _ in range(mn)]\\n    for y in range(n - 1):\\n        for x in range(m):\\n            yx = y * m + x\\n            if l[yx] and l[yx + m]:\\n                neigh[yx].append(yx + m)\\n                neigh[yx + m].append(yx)\\n    for y in range(n):\\n        for x in range(m - 1):\\n            yx = y * m + x\\n            if l[yx] and l[yx + 1]:\\n                neigh[yx].append(yx + 1)\\n                neigh[yx + 1].append(yx)\\n    res = [True] * mn\\n    cur, nxt = set(), {l.index(True)}\\n    cnt = sum(l) - k\\n    while cnt:\\n        cur, nxt = nxt, cur\\n        while cur:\\n            i = cur.pop()\\n            if res[i]:\\n                res[i] = False\\n                cnt -= 1\\n                if not cnt:\\n                    break\\n                for j in neigh[i]:\\n                    nxt.add(j)\\n    for x, (a, b) in enumerate(zip(res, l)):\\n        if a and b:\\n            l[x] = 2\\n    l = [''.join(('#', '.', 'X')[_] for _ in l[x:x + m]) for x in range(0, mn, m)]\\n    print('\\\\n'.join(l))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from queue import Queue, PriorityQueue\\nn, m, k = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n    a.append(list(input()))\\nlvl = [[0] * m for i in range(n)]\\nx = y = -1\\nfor i in range(n):\\n    if '.' in a[i]:\\n        x = i\\n        y = a[i].index('.')\\n        break\\nq = Queue()\\nq.put((x, y))\\nans = []\\nlvl[x][y] = 1\\nwhile not q.empty():\\n    x, y = q.get()\\n    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:\\n        nx = x + dx\\n        ny = y + dy\\n        if nx < 0 or ny < 0 or nx >= n or ny >= m:\\n            continue\\n        if lvl[nx][ny]:\\n            continue\\n        if a[nx][ny] == '#':\\n            continue\\n        lvl[nx][ny] = lvl[x][y] + 1\\n        q.put((nx, ny))\\n        ans.append((-lvl[nx][ny], nx, ny))\\nans.sort()\\nfor i in range(k):\\n    _, x, y = ans[i]\\n    a[x][y] = 'X'\\nprint('\\\\n'.join(''.join(l) for l in a))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\nadded = set()\\nwhile len(added) < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  added.add(vertex)\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"# 377A\\nfrom sys import stdin\\n\\n__author__ = 'artyom'\\n\\n\\ndef read_int_ary():\\n  return map(int, stdin.readline().strip().split())\\n\\n\\ndef dfs(graph, start):\\n  visited, tree, processed, stack = set(), [], set(), [start]\\n  while stack:\\n    vertex = stack.pop()\\n    if vertex not in visited:\\n      visited.add(vertex)\\n      stack.extend(graph[vertex] - visited)\\n    if not vertex in processed:\\n      tree.append(vertex)\\n    processed.add(vertex)\\n  return tree\\n\\n\\nn, m, k = read_int_ary()\\ngrid = []\\nfor i in range(n):\\n  grid.append(list(stdin.readline().strip()))\\n\\ngraph = {}\\nfor i in range(n):\\n  for j in range(m):\\n    if grid[i][j] == '.':\\n      v = (i, j)\\n      graph[v] = set()\\n      if i > 0 and grid[i - 1][j] == '.':\\n        u = (i - 1, j)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n      if j > 0 and grid[i][j - 1] == '.':\\n        u = (i, j - 1)\\n        graph[v].add(u)\\n        graph[u].add(v)\\n\\nprocessed = dfs(graph, next(iter(graph.keys())))\\n\\ni = 0\\nwhile i < k:\\n  vertex = processed.pop()\\n  grid[vertex[0]][vertex[1]] = 'X'\\n  i += 1\\nfor i in range(n):\\n  print(''.join(grid[i]))\", \"maze = [['0' for j in range(510)] for i in range(510)]\\nvisited = [[0 for j in range(510)] for i in range(510)]\\nn,m,k = tuple(int(i) for i in input().split())\\nsx = -1\\nsy = -1\\nfor i in range(n):\\n\\ts = input()\\n\\tfor j in range(m):\\n\\t\\tmaze[i][j] = s[j]\\n\\t\\tif(sx==-1 and s[j]=='.'):\\n\\t\\t\\tsx=i\\n\\t\\t\\tsy=j\\n\\n\\nstack = [(sx,sy)]\\nans = []\\nwhile(len(stack)!=0):\\n\\tcurr = stack.pop()\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\t#print(x,y)\\n\\tif(x<0 or y<0 or x>=n or y>=m or visited[x][y]==1 or maze[x][y]=='#'):\\n\\t\\tcontinue\\n\\tvisited[x][y] = 1\\n\\tstack.append((x+1,y))\\n\\tstack.append((x-1,y))\\n\\tstack.append((x,y+1))\\n\\tstack.append((x,y-1))\\n\\tans.append(curr)\\n\\nfor i in range(k):\\n\\tcurr = ans[len(ans)-i-1]\\n\\tx = curr[0]\\n\\ty = curr[1]\\n\\tmaze[x][y] = 'X'\\ns = \\\"\\\"\\nfor i in range(n):\\n\\tfor j in range(m):\\n\\t\\ts+=maze[i][j]\\n\\ts+=\\\"\\\\n\\\"\\nprint(s)\\n\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.pop()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import deque,namedtuple\\ndx = [0,0,1,-1]\\ndy = [1,-1,0,0]\\n\\ndef main():\\n    n,m,limit = map(int,input().split())\\n    a,sx,sy,tot = [],0,0,0\\n    for i in range(n):\\n        s,t = input(),[]\\n        for j,c in enumerate(s):\\n            if c == '.':\\n                sx,sy = i,j\\n                tot += 1\\n                c = 'X'\\n            t.append(c)\\n        a.append(t[:])\\n\\n    dq,done = deque([(sx,sy)]),0\\n    while len(dq) > 0:\\n        now = dq.popleft()\\n        if done >= tot - limit:\\n            break\\n        if(a[now[0]][now[1]] == 'X'):\\n            done += 1\\n        else:\\n            continue\\n        a[now[0]][now[1]] = '.'\\n        for i in range(4):\\n            tx,ty = dx[i] + now[0],dy[i] + now[1]\\n            if 0 <= tx < n and 0 <= ty < m and a[tx][ty] == 'X':\\n                dq.append((tx,ty))\\n    for i in a:\\n        print(\\\"\\\".join(i))\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ndef solve(n, m, k, grid, r, c):\\n    move = [(0, 1), (0, -1), (1, 0), (-1, 0)]\\n    visited = [[False for i in range(m)] for j in range(n)]\\n    q = [(r, c)]\\n    grid[r][c] = 'O'\\n    visited[r][c] = True\\n    k -= 1\\n    while k != 0 and len(q) != 0:\\n        r, c = q.pop()\\n        for i in range(4):\\n            x, y = r + move[i][0], c + move[i][1]\\n            if x >= 0 and x < n and y >= 0 and y < m and not visited[x][y] and grid[x][y] == '.':\\n                q.append((x, y))\\n                grid[x][y] = 'O'\\n                visited[x][y] = True\\n                k -= 1\\n                if k == 0:\\n                    break\\n\\nn, m, k = list(map(int, sys.stdin.readline().split()))\\ngrid = []\\nfor i in range(n):\\n    s = list(input())\\n    grid.append(s)\\n\\nr = 0\\nc = 0\\ncnt = 0\\nfind = False\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            cnt += 1\\n            if not find:\\n                r, c = i, j\\n                find = True\\n\\nsolve(n, m, cnt-k, grid, r, c)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == '.':\\n            grid[i][j] = 'X'\\n#print(grid)\\n\\nfor i in range(n):\\n    for j in range(m):\\n        if grid[i][j] == 'O':\\n            grid[i][j] = '.'\\n\\nfor i in range(n):\\n    print(''.join(map(str, grid[i])))\\n\\n\", \"from typing import List, Tuple, Set\\n\\n\\ndef find_neighbors(x: int, y: int, m: int, n: int) -> List[Tuple[int, int]]:\\n    neighbors = [(x + 1, y), (x - 1, y), (x, y + 1), (x, y - 1)]\\n    return [p for p in neighbors if 0 <= p[0] < n and 0 <= p[1] < m]\\n\\n\\ndef dfs(\\n    n: int,\\n    m: int,\\n    maze: List[List[str]],\\n    start: Tuple[int, int],\\n    max_path_length: int,\\n) -> Set[Tuple[int, int]]:\\n    visited = [[0] * m for _ in range(n)]\\n    d = [start]\\n    path = set()\\n    while d:\\n        x, y = d.pop()\\n        visited[x][y] = 1\\n        path.add((x, y))\\n        for xo, yo in find_neighbors(x, y, m, n):\\n            if not visited[xo][yo] and maze[xo][yo] == '.':\\n                d.append((xo, yo))\\n        if len(path) == max_path_length:\\n            break\\n    return path\\n\\n\\ndef place_blocks(\\n    n: int,\\n    m: int,\\n    k: int,\\n    maze: List[List[str]],\\n    path: Set[Tuple[int, int]]\\n) -> List[List[str]]:\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] == '.' and k > 0 and (i, j) not in path:\\n                maze[i][j] = 'X'\\n                k -= 1\\n            if k == 0:\\n                return maze\\n\\n\\ndef solve(n: int, m: int, k: int, maze: List[List[str]]) -> List[List[str]]:\\n    empty_cell_count = sum(row.count('.') for row in maze)\\n    for i in range(n):\\n        for j in range(m):\\n            if maze[i][j] != '#':\\n                path = dfs(n, m, maze, (i, j), empty_cell_count - k)\\n                if len(path) >= empty_cell_count - k:\\n                    return place_blocks(n, m, k, maze, path)\\n\\nn, m, k = list(map(int, input().split()))\\nmaze = [list(input()) for _ in range(n)]\\n\\nfor line in solve(n, m, k, maze):\\n    print(''.join(line))\", \"from sys import stdin\\nfrom collections import deque\\n\\ndef __starting_point():\\n    R, C, K = list(map(int, stdin.readline().rstrip().split()))\\n    maze = []\\n    start = None\\n    for r in range(0, R):\\n        line = stdin.readline()\\n        if start is None:\\n            for c in range(0, C):\\n                if line[c] == '.':\\n                    start = (r, c)\\n                    break\\n        maze.append(list(line))\\n\\n    order = deque()\\n    stack = deque()\\n    stack.append(start)\\n\\n    def add_to_stack(row, col):\\n        if 0 <= row < R and \\\\\\n                0 <= col < C and \\\\\\n                maze[row][col] == '.':\\n            stack.append((row, col))\\n            maze[row][col] = ','\\n\\n    while len(stack) > 0:\\n        (r, c) = stack.pop()\\n        order.append((r, c))\\n        add_to_stack(r-1, c)\\n        add_to_stack(r+1, c)\\n        add_to_stack(r, c-1)\\n        add_to_stack(r, c+1)\\n\\n    for k in range(0, K):\\n        (r, c) = order.pop()\\n        maze[r][c] = 'X'\\n\\n    for r in range(0, R):\\n        line = ''\\n        for c in range(0, C):\\n            ch = maze[r][c]\\n            if ch == ',':\\n                line += '.'\\n            else:\\n                line += ch\\n        print(line)\\n\\n\\n__starting_point()\", \"n,m,k=list(map(int,input().split()))\\nM=[input() for i in range(n)]\\nT=[[] for i in range(n)]\\np=0\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='#' :\\n            T[i].append(M[i][j])\\n        else :\\n            T[i].append('X')\\nfor i in range(n) :\\n    p=p+M[i].count('#')\\nfor i in range(n) :\\n    for j in range(m) :\\n        if M[i][j]=='.' :\\n            a=i\\n            b=j\\n            break\\nt=(n*m)-p-k\\nl=[[a,b]]\\nT[a][b]='.'\\nt=t-1\\nwhile t>0  :\\n    r=l[0]\\n    \\n    del(l[0])\\n    i=r[0]\\n    j=r[1]\\n  \\n    if i+1!=n  :\\n        if M[i+1][j]=='.' and T[i+1][j]!='.'  :\\n            l.append([i+1,j])\\n            T[i+1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if i-1!=-1  :\\n        if M[i-1][j]=='.' and T[i-1][j]!='.'  :\\n            l.append([i-1,j])\\n            T[i-1][j]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j+1!=m  :\\n        if M[i][j+1]=='.' and  T[i][j+1]!='.'  :\\n            l.append([i,j+1])\\n            T[i][j+1]='.'\\n            t=t-1\\n    if t<=0 :\\n        break\\n    if j-1!=-1  :\\n        if M[i][j-1]=='.' and  T[i][j-1]!='.' :\\n            l.append([i,j-1])\\n            T[i][j-1]='.'\\n            t=t-1\\n            \\nfor i in range(n) :\\n    S=''\\n    for j in range(m) :\\n        S=S+T[i][j]\\n    print(S)\\n\", \"#make every dot into X,turn the question into find a connected line of dot\\n#scan the graph and find the first X's position in every line,and to each X find if there is another\\n#X near it ,take it in and do it again\\nn,m,k = map(int,input().split())\\ng = [input().replace('.','X') for i in range(n)]\\nk = n*m - k - sum(i.count('#')for i in g)\\ng = [list(i) for i in g]\\ni,p = 0,[]\\nwhile k:\\n    if 'X'in g[i]:\\n        j = g[i].index('X')\\n        g[i][j],p = '.',[(i,j)]\\n        k -= 1\\n        break\\n    i += 1\\nwhile k:\\n    x,y = p.pop()\\n    for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\\n        if i < 0 or j < 0:\\n            continue\\n        if i < n and j < m and g[i][j] == 'X':\\n            g[i][j] = '.'\\n            p.append((i,j))\\n            k -= 1\\n            if k == 0:\\n                break\\nfor i in range(n):\\n    g[i]=''.join(g[i])\\nprint('\\\\n'.join(g))\", \"import sys\\nfrom collections import defaultdict\\n\\ndef main():\\n    sys.setrecursionlimit(1 << 30)\\n    g = []\\n    adj = defaultdict(set)\\n    vis = set()\\n    def valid(x, y):\\n        nonlocal n, m\\n        return x >= 0 and x < n and y >= 0 and y < m\\n    def bfs(x, y):\\n        nonlocal g, vis, adj\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        s = 0\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            s += 1\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n        return s\\n    def bfs2(x, y):\\n        nonlocal g, vis, adj, count\\n        q = []\\n        q.append((x, y))\\n        vis.add((x, y))\\n        while len(q) > 0:\\n            (x, y) = q.pop()\\n            g[x][y] = 'o'\\n            count -= 1\\n            if count <= 0:\\n                return\\n            for c in [[-1, 0], [1, 0], [0, -1], [0, 1]]:\\n                nx = c[0] + x\\n                ny = c[1] + y\\n                if valid(nx, ny) and (nx, ny) not in vis:\\n                    if g[nx][ny] == '.':\\n                        vis.add((nx, ny))\\n                        q.append((nx, ny))\\n    (n, m, k) = list(map(int, input().split(' ')))\\n    for i in range(n):\\n        g.append(list(input()))\\n    s = 0\\n    f = False\\n    l = None\\n    for i in range(n):\\n        if f:\\n            break\\n        for j in range(m):\\n            if g[i][j] == '.' and (i, j) not in vis:\\n                s = bfs(i, j)\\n                l = (i, j)\\n                f = True\\n                break\\n    vis = set()\\n    count = s - k\\n    bfs2(l[0], l[1])\\n    f = lambda i: 'X' if i == '.' else ('#' if i == '#' else '.')\\n    for row in g:\\n        print(''.join(list(map(f, row))))\\nmain()\\n\\n\", \"from collections import deque as dq\\n\\nclass Graph:\\n    def __init__(self,n=0,m=0):\\n        self.g=[None for i in range(n)]\\n        self.vis=[[False for j in range(m)] for i in range(n)]\\n        self.dx=(1,0,-1,0)\\n        self.dy=(0,1,0,-1)\\n\\n    def affiche(self):\\n        for i in range(len(self.g)):\\n            print(\\\"\\\".join(self.g[i]))\\n    def readG(self,n):\\n        for i in range(n):\\n            self.g[i]=list(input())\\n\\n    def get(self,i,j):\\n        return self.g[i][j]\\n            \\n    def dfsIt(self,u):\\n        nonlocal k,A\\n        L=dq()\\n        A=[]\\n        L.append(u)        \\n        while len(L)!=0:\\n            u=L.pop()\\n            self.vis[u[0]][u[1]]=True\\n            b=True\\n            for t in range(4):\\n                x=u[0]+self.dx[t]\\n                y=u[1]+self.dy[t]\\n                if x>=0 and x<n and y>=0 and y<m and not self.vis[x][y] and self.g[x][y]!='#':\\n                    self.vis[x][y]=True\\n                    L.append((x,y))\\n                    b=False\\n            if b and k>0:\\n                k-=1\\n                self.g[u[0]][u[1]]='X'\\n            else:\\n                A.append(u)\\n    \\nn,m,k=list(map(int,input().split()))\\ng=Graph(n,m)\\ng.readG(n)\\n\\ndef f():\\n    nonlocal n,m,g\\n    for i in range(n):\\n        for j in range(m):\\n            if g.get(i,j)=='.':\\n                return (i,j)\\n            \\ng.dfsIt(f())\\nwhile k!=0:\\n    k-=1\\n    u=A.pop()\\n    g.g[u[0]][u[1]]='X'\\n\\ng.affiche()\\n    \\n\", \"r,c,n = map(int,input().split())\\nfield = []\\nfield.append('#'*(c+2))\\nfor _ in range(r):\\n    field.append('#'+input()+'#')\\nfield.append('#'*(c+2))\\n\\n\\np_x = 0\\np_y = 0\\n\\n\\nnot_walls = 0\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        p_x,p_y = x,y\\n        not_walls += 1\\nprocess = [(p_x,p_y)]\\nvalid = set()\\n\\nwhile len(valid) < (not_walls-n):\\n    x,y = process.pop()\\n    valid.add((x,y))\\n\\n    for a,b in [(1,0),(-1,0),(0,1),(0,-1)]:\\n        if field[a+x][b+y] == '.' and (a+x,b+y) not in valid:\\n            process.append((x+a,y+b))\\n\\n\\n\\nfor x in range(1,r+1):\\n    for y in range(1,c+1):\\n        if field[x][y] == '#':continue\\n        if (x,y) not in valid:\\n            field[x] = field[x][:y] + 'X' + field[x][y+1:]\\n\\nfield = [x[1:-1] for x in field[1:-1]]\\nprint('\\\\n'.join(field))\", \"n, m, k = list(map(int, input().split()))\\nmaze = [[\\\"#\\\"]*(m+2)]+[list(\\\"#\\\"+input()+\\\"#\\\") for i in range(n)]+[[\\\"#\\\"]*(m+2)]\\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\\n\\nempty = -k\\nx, y = None, None\\nfor i in range(n+2):\\n    empty += maze[i].count(\\\".\\\")\\n    for j in range(m+2):\\n        if maze[i][j] == \\\".\\\":\\n            x, y = i, j\\n            break\\n\\nstack = [(x,y)]\\nwhile empty:\\n    (x, y) = stack.pop()\\n    if maze[x][y] == \\\"v\\\":\\n        continue\\n    for dx, dy in steps:\\n        if maze[x+dx][y+dy] == \\\".\\\":\\n            stack.append((x+dx, y+dy))\\n    maze[x][y] = \\\"v\\\"\\n    empty -= 1\\n\\nfor row in maze[1:-1]:\\n    print(\\\"\\\".join(row[1:-1]).replace(\\\".\\\",\\\"X\\\").replace(\\\"v\\\",\\\".\\\"))\\n\"]",
        "difficulty": "competition",
        "input": "4 4 1\n##..\n##..\n..#.\n....\n",
        "output": "##..\n##..\nX.#.\n....\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/377/A"
    },
    {
        "id": 365,
        "task_id": 3861,
        "test_case_id": 3,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n-1 -4 -9\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 366,
        "task_id": 3861,
        "test_case_id": 12,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n-1 -2 -3\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 367,
        "task_id": 3861,
        "test_case_id": 16,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-1\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 368,
        "task_id": 3861,
        "test_case_id": 28,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-439\n",
        "output": "-439\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 369,
        "task_id": 3861,
        "test_case_id": 29,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-1000000\n",
        "output": "-1000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 370,
        "task_id": 3861,
        "test_case_id": 30,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-917455\n",
        "output": "-917455\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 371,
        "task_id": 3861,
        "test_case_id": 34,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "2\n-524272 -1000000\n",
        "output": "-524272\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 372,
        "task_id": 3999,
        "test_case_id": 3,
        "question": "AtCoDeer the deer has N square tiles. The tiles are numbered 1 through N, and the number given to each tile is written on one side of the tile. Also, each corner of each tile is painted in one of the 1000 colors, which are represented by the integers 0 between 999. The top-left, top-right, bottom-right and bottom-left corner of the tile with the number i are painted in color C_{i,0}, C_{i,1}, C_{i,2} and C_{i,3}, respectively, when seen in the direction of the number written on the tile (See Figure 1).\nFigure 1: The correspondence between the colors of a tile and the input\nAtCoDeer is constructing a cube using six of these tiles, under the following conditions:\n - For each tile, the side with the number must face outward.\n - For each vertex of the cube, the three corners of the tiles that forms it must all be painted in the same color.\nHelp him by finding the number of the different cubes that can be constructed under the conditions.\nSince each tile has a number written on it, two cubes are considered different if the set of the used tiles are different, or the tiles are used in different directions, even if the formation of the colors are the same. (Each tile can be used in one of the four directions, obtained by 90° rotations.) Two cubes are considered the same only if rotating one in the three dimensional space can obtain an exact copy of the other, including the directions of the tiles.\nFigure 2: The four directions of a tile\n\n-----Constraints-----\n - 6≦N≦400\n - 0≦C_{i,j}≦999 (1≦i≦N , 0≦j≦3)\n\n-----Input-----\nThe input is given from Standard Input in the following format:\nN\nC_{1,0} C_{1,1} C_{1,2} C_{1,3}\nC_{2,0} C_{2,1} C_{2,2} C_{2,3}\n:\nC_{N,0} C_{N,1} C_{N,2} C_{N,3}\n\n-----Output-----\nPrint the number of the different cubes that can be constructed under the conditions.\n\n-----Sample Input-----\n6\n0 1 2 3\n0 4 6 1\n1 6 7 2\n2 7 5 3\n6 4 5 7\n4 0 3 5\n\n-----Sample Output-----\n1\n\nThe cube below can be constructed.",
        "solutions": "[\"from collections import defaultdict\\nN, = list(map(int, input().split()))\\n\\ndef normal(xs):\\n    return tuple(min((xs[j:] + xs[:j] for j in range(1, 5))))\\n\\ndd = defaultdict(int)\\ncc = dict()\\nnorm = dict()\\nss = []\\nfor _ in range(N):\\n    xs = list(map(int, input().split()))\\n    cnd = [tuple(xs[j:] + xs[:j]) for j in range(1, 5)]\\n    x = min(cnd)\\n    for item in cnd:\\n        norm[item] = x\\n    dd[x] += 1\\n    cc[x] = (4 if x[0] == x[1] else 2)if x[0] == x[2] and x[1] == x[3] else 1\\n    ss.append(x)\\n\\ndef icr(x):\\n    dd[x] += 1\\n\\ndef dcr(x):\\n    dd[x] -= 1\\n\\ndef f(ff, gg):\\n    a,b,c,d=ff\\n    e,h,g,f=gg\\n    tl = [(a,e,f,b), (b,f,g,c), (c,g,h,d), (d,h,e,a)]\\n    for cp in tl:\\n        if cp not in norm:\\n            return 0\\n    r = 1\\n    for cp in tl:\\n        cp = norm[cp]\\n        r *= dd[cp]*cc[cp]\\n        dcr(cp)\\n    for cp in tl:\\n        cp = norm[cp]\\n        icr(cp)\\n    return r\\n\\nr = 0\\nfor i in range(N):\\n    ff = ss[i]\\n    dcr(ff)\\n    for j in range(i+1, N):\\n        sl = ss[j]\\n        dcr(sl)\\n        x, y, z, w = sl\\n        sls = [(x,y,z,w), (y,z,w,x), (z,w,x,y), (w,x,y,z)]\\n        for s in sls:\\n            r += f(ff, s)\\n        icr(sl)\\n    icr(ff)\\nprint((r//3))\\n\", \"from collections import defaultdict\\nN, = list(map(int, input().split()))\\n\\ndd = defaultdict(int)\\ncc = dict()\\nnorm = dict()\\nss = []\\nfor _ in range(N):\\n    xs = list(map(int, input().split()))\\n    cnd = [tuple(xs[j:] + xs[:j]) for j in range(1, 5)]\\n    x = min(cnd)\\n    for item in cnd:\\n        norm[item] = x\\n    dd[x] += 1\\n    cc[x] = (4 if x[0] == x[1] else 2)if x[0] == x[2] and x[1] == x[3] else 1\\n    ss.append(x)\\n\\ndef f(ff, gg):\\n    a,b,c,d=ff\\n    e,h,g,f=gg\\n    tl = [(a,e,f,b), (b,f,g,c), (c,g,h,d), (d,h,e,a)]\\n    for i in range(4):\\n        if tl[i] not in norm:\\n            return 0\\n        tl[i] = norm[tl[i]]\\n    r = 1\\n    for cp in tl:\\n        r *= dd[cp]*cc[cp]\\n        dd[cp] -= 1\\n    for cp in tl:\\n        dd[cp] += 1\\n    return r\\n\\nr = 0\\nfor i in range(N):\\n    ff = ss[i]\\n    dd[ff]-=1\\n    for j in range(i+1, N):\\n        sl = ss[j]\\n        x, y, z, w = sl\\n        dd[sl]-=1\\n        sls = [(x,y,z,w), (y,z,w,x), (z,w,x,y), (w,x,y,z)]\\n        for s in sls:\\n            r += f(ff, s)\\n        dd[sl]+=1\\n    dd[ff]+=1\\nprint((r//3))\\n\", \"from collections import deque\\nN = int(input())\\nC = []\\nM = {}\\nfor i in range(N):\\n    *c, = list(map(int, input().split()))\\n    c = tuple(min(c[j:] + c[:j] for j in range(1, 5)))\\n    C.append(c)\\n    if c not in M:\\n        M[c] = deque([i])\\n    else:\\n        M[c].append(i)\\ndef count(p, q, r, s):\\n    if p == q == r == s:\\n        return 4\\n    if p == r and q == s:\\n        return 2\\n    return 1\\ndef solve(ci, cj, k):\\n    R = {}\\n    for l in range(4):\\n        #  [l]   [l-1]\\n        # [l+k] [l+k+1]\\n        c = ci[l], ci[l-1], cj[k-l], cj[k-l-1]\\n        c = tuple(min(c[j:] + c[:j] for j in range(1, 5)))\\n        if c not in M:\\n            return 0\\n        R[c] = R.get(c, 0) + 1\\n    res = 1\\n    for c in R:\\n        m = M[c]\\n        cnt = len(m)\\n        if c == cj:\\n            cnt -= 1\\n        if cnt < R[c]:\\n            return 0\\n        k = count(*c)\\n        for p in range(cnt-R[c]+1, cnt+1):\\n            res *= p * k\\n    return res\\n\\nans = 0\\nfor i in range(N):\\n    ci = C[i]\\n    q = M[ci]; q.popleft()\\n    if not q:\\n        del M[ci]\\n    for j in range(i+1, N):\\n        cj = C[j]\\n        for k in range(4):\\n            ans += solve(ci, cj, k)\\nprint(ans)\\n\", \"import sys\\nfrom collections import Counter\\nreadline = sys.stdin.readline\\n\\ndef compress(L):\\n    L2 = list(set(L))\\n    L2.sort()\\n    C = {v : k for k, v in enumerate(L2, 1)}\\n    return L2, C\\n\\ndef order(a, b, c, d):\\n    if a == b == c == d:\\n        return 4\\n    if a == c and b == d:\\n        return 2\\n    return 1\\n\\n\\nlimit = 5\\ncalc = [[None]*limit for _ in range(limit*400)]\\nfor i in range(limit*400):\\n    calc[i][1] = i\\n    for j in range(2, limit):\\n        calc[i][j] = calc[i][j-1]*(i-j+1)\\npp = [[pow(i, j) for j in range(10)] for i in range(10)]\\n\\nN = int(readline())\\nC = [tuple(map(int, readline().split())) for _ in range(N)]\\nD = Counter()\\n\\n\\n\\nRot = []\\nfor i in range(N):\\n    a, b, c, d = C[i]\\n    Rot.append((a, b, c, d))\\n    Rot.append((d, a, b, c))\\n    Rot.append((c, d, a, b))\\n    Rot.append((b, c, d, a))\\nLc, Cr = compress(Rot)\\nLc = [None] + Lc\\nCc = []\\n\\nOd = Counter()\\nBase = Counter()\\nD = Counter()\\nfor i in range(N):\\n    a, b, c, d = C[i]\\n    a, b, c, d = min((a, b, c, d), (b, c, d, a), (c, d, a, b), (d, a, b, c))\\n    od = order(a, b, c, d)\\n    r1 = Cr[(a, b, c, d)]\\n    r2 = Cr[(b, c, d, a)]\\n    r3 = Cr[(c, d, a, b)]\\n    r4 = Cr[(d, a, b, c)]\\n    Base[r1] = r1\\n    Base[r2] = r1\\n    Base[r3] = r1\\n    Base[r4] = r1\\n    Od[r1] = od\\n    Od[r2] = od\\n    Od[r3] = od\\n    Od[r4] = od\\n    Cc.append((r1, r2, r3, r4))\\n    D[r1] += 1\\n\\n\\nans = 0\\nfor i in range(N):\\n    D[Cc[i][0]] -= 1\\n    a, b, c, d = Lc[Cc[i][0]]\\n    for j in range(i+1, N):\\n        D[Cc[j][0]] -= 1\\n        for idx in range(4):\\n            e, f, g, h = Lc[Cc[j][idx]]\\n            E = Counter()\\n            r1 = (b, e, h, c)\\n            if r1 not in Cr:\\n                continue\\n            r1 = Base[Cr[r1]]\\n            r2 = (a, f, e, b)\\n            if r2 not in Cr:\\n                continue\\n            r2 = Base[Cr[r2]]\\n            r3 = (d, g, f, a)\\n            if r3 not in Cr:\\n                continue\\n            r3 = Base[Cr[r3]]\\n            r4 = (c, h, g, d)\\n            if r4 not in Cr:\\n                continue\\n            r4 = Base[Cr[r4]]\\n            \\n            E[r1] += 1\\n            E[r2] += 1\\n            E[r3] += 1\\n            E[r4] += 1            \\n            res = 1\\n            for k, n in list(E.items()):\\n                res *= calc[D[k]][n] * pp[Od[k]][n]\\n            ans += res\\n        \\n        D[Cc[j][0]] += 1\\n\\nprint(ans)\\n\", \"from collections import defaultdict\\nN, = list(map(int, input().split()))\\n\\ndef normal(xs):\\n    mnx = min(xs)\\n    xi = xs.index(mnx)\\n    if xs[(xi+3)%4] == mnx:\\n        if xs[(xi+2)%4] == mnx:\\n            xi = (xi+2)%4\\n        else:\\n            xi = (xi+3)%4\\n    if xs[(xi+1)%4] > xs[(xi+3)%4]:\\n        xi = (xi+2)%4\\n    return (xs[xi%4], xs[(xi+1)%4], xs[(xi+2)%4], xs[(xi+3)%4])\\n#x = (0,2,2,0)\\n#print(normal(x))\\n\\ndd = defaultdict(int)\\ncc = defaultdict(int)\\nss = []\\nfor _ in range(N):\\n    a, b, c, d = list(map(int, input().split()))\\n    x = normal([a,b,c,d])\\n    n=1\\n    if x[0] == x[2] and x[1] == x[3]:\\n        n *= 2\\n        if x[0] == x[1]:\\n            n *= 2\\n    dd[x] += 1\\n    cc[x] = n\\n    ss.append(x)\\n\\ndef icr(x):\\n    dd[x] += 1\\n\\ndef dcr(x):\\n    dd[x] -= 1\\n\\ndef f(ff, gg):\\n    #print(dd)\\n    a,b,c,d=ff\\n    e,h,g,f=gg\\n    tl = list(map(normal, [(a,e,f,b), (b,f,g,c), (c,g,h,d), (d,h,e,a)]))\\n    r = 1\\n    for cp in tl:\\n        if cp not in dd:\\n            r = 0\\n            break\\n        r *= dd[cp]*cc[cp]\\n        dcr(cp)\\n    for cp in tl:\\n        if cp not in dd:\\n            break\\n        icr(cp)\\n    return r\\n\\nr = 0\\nfor i in range(N):\\n    ff = ss[i]\\n    dcr(ff)\\n    for j in range(i+1, N):\\n        sl = ss[j]\\n        dcr(sl)\\n        x, y, z, w = sl\\n        sls = [(x,y,z,w), (y,z,w,x), (z,w,x,y), (w,x,y,z)]\\n        for s in sls:\\n            r += f(ff, s)\\n        icr(sl)\\n    icr(ff)\\nprint((r//3))\\n\", \"from collections import defaultdict\\nN, = map(int, input().split())\\n\\ndd = defaultdict(int)\\ncc = dict()\\nnorm = dict()\\nss = []\\nfor _ in range(N):\\n    xs = list(map(int, input().split()))\\n    cnd = [tuple(xs[j:] + xs[:j]) for j in range(1, 5)]\\n    x = min(cnd)\\n    for item in cnd:\\n        norm[item] = x\\n    dd[x] += 1\\n    cc[x] = (4 if x[0] == x[1] else 2)if x[0] == x[2] and x[1] == x[3] else 1\\n    ss.append(x)\\n\\ndef f(ff, gg):\\n    a,b,c,d=ff\\n    e,h,g,f=gg\\n    tl = [(a,e,f,b), (b,f,g,c), (c,g,h,d), (d,h,e,a)]\\n    for i in range(4):\\n        if tl[i] not in norm:\\n            return 0\\n        tl[i] = norm[tl[i]]\\n    r = 1\\n    for cp in tl:\\n        r *= dd[cp]*cc[cp]\\n        dd[cp] -= 1\\n    for cp in tl:\\n        dd[cp] += 1\\n    return r\\n\\nr = 0\\nfor i in range(N):\\n    ff = ss[i]\\n    dd[ff]-=1\\n    for j in range(i+1, N):\\n        sl = ss[j]\\n        x, y, z, w = sl\\n        dd[sl]-=1\\n        sls = [(x,y,z,w), (y,z,w,x), (z,w,x,y), (w,x,y,z)]\\n        for s in sls:\\n            r += f(ff, s)\\n        dd[sl]+=1\\nprint(r)\", \"from collections import defaultdict\\nN, = map(int, input().split())\\ndd = defaultdict(int)\\ncc = dict()\\nnrm = dict()\\nss = []\\nfor _ in range(N):\\n  xs = list(map(int, input().split()))\\n  cnd = [tuple(xs[j:]+xs[:j])for j in range(4)]\\n  x = min(cnd)\\n  for item in cnd:\\n    nrm[item] = x\\n  dd[x] += 1\\n  cc[x] = (4 if x[0]==x[1]else 2)if x[0]==x[2]and x[1]==x[3]else 1\\n  ss.append(x)\\ndef f(ff, gg):\\n  a,b,c,d=ff\\n  e,h,g,f=gg\\n  tl = [(a,e,f,b), (b,f,g,c), (c,g,h,d), (d,h,e,a)]\\n  q = defaultdict(int)\\n  for p in tl:\\n    if p not in nrm:\\n      return 0\\n    q[nrm[p]] += 1\\n  r= 1\\n  for p, c in q.items():\\n    for i in range(c):\\n      r *= dd[p]-i\\n    r *= cc[p]**c\\n  return r\\nr = 0\\nfor i in range(N):\\n  ff = ss[i]\\n  dd[ff]-=1\\n  for j in range(i+1, N):\\n    sl = ss[j]\\n    x, y, z, w = sl\\n    dd[sl]-=1\\n    r += sum(f(ff,tuple(sl[j:]+sl[:j]))for j in range(4))\\n    dd[sl]+=1\\nprint(r)\"]",
        "difficulty": "competition",
        "input": "6\n0 0 0 0\n0 0 0 0\n0 0 0 0\n0 0 0 0\n0 0 0 0\n0 0 0 0\n",
        "output": "122880\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc062/tasks/arc062_c"
    },
    {
        "id": 373,
        "task_id": 4011,
        "test_case_id": 1,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n1337\n1 2 5 4 6 6 3 1 9\n",
        "output": "1557\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 374,
        "task_id": 4011,
        "test_case_id": 2,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n11111\n9 8 7 6 5 4 3 2 1\n",
        "output": "99999\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 375,
        "task_id": 4011,
        "test_case_id": 3,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n33\n1 1 1 1 1 1 1 1 1\n",
        "output": "33\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 376,
        "task_id": 4011,
        "test_case_id": 4,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n1234\n1 1 4 5 1 1 1 1 1\n",
        "output": "1245\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 377,
        "task_id": 4011,
        "test_case_id": 7,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n51\n1 2 5 4 6 6 3 1 9\n",
        "output": "61\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 378,
        "task_id": 4011,
        "test_case_id": 8,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n51\n1 2 3 4 5 6 7 8 9\n",
        "output": "51\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 379,
        "task_id": 4011,
        "test_case_id": 9,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n738\n3 7 4 9 4 6 7 3 3\n",
        "output": "748\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 380,
        "task_id": 4011,
        "test_case_id": 11,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n1733\n1 2 5 4 6 6 3 1 9\n",
        "output": "1755\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 381,
        "task_id": 4011,
        "test_case_id": 12,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "15\n164563457334873\n4 3 3 3 6 6 8 8 5\n",
        "output": "464563457334873\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 382,
        "task_id": 4011,
        "test_case_id": 14,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "8\n71222655\n8 4 8 9 7 6 6 4 8\n",
        "output": "78444677\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 383,
        "task_id": 4011,
        "test_case_id": 15,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "7\n6545161\n7 2 3 5 9 6 8 1 3\n",
        "output": "6959767\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 384,
        "task_id": 4011,
        "test_case_id": 16,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n4444\n2 1 4 3 6 5 8 9 7\n",
        "output": "4444\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 385,
        "task_id": 4011,
        "test_case_id": 17,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n77372\n1 4 7 7 9 1 9 9 7\n",
        "output": "99794\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 386,
        "task_id": 4011,
        "test_case_id": 18,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n33\n4 5 5 8 7 7 5 4 4\n",
        "output": "55\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 387,
        "task_id": 4011,
        "test_case_id": 22,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n512\n3 3 7 7 2 4 7 9 4\n",
        "output": "533\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 388,
        "task_id": 4011,
        "test_case_id": 23,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n87\n6 2 9 2 4 3 9 6 4\n",
        "output": "89\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 389,
        "task_id": 4011,
        "test_case_id": 24,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n21558\n6 9 4 9 6 6 5 9 7\n",
        "output": "96669\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 390,
        "task_id": 4011,
        "test_case_id": 25,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "8\n72231447\n7 9 4 5 1 2 7 6 5\n",
        "output": "79947557\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 391,
        "task_id": 4011,
        "test_case_id": 26,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n47\n9 1 2 3 7 3 8 6 1\n",
        "output": "48\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 392,
        "task_id": 4011,
        "test_case_id": 28,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n4841\n6 4 7 1 7 1 3 9 7\n",
        "output": "4941\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 393,
        "task_id": 4011,
        "test_case_id": 30,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "7\n3243631\n6 3 6 5 2 9 2 2 2\n",
        "output": "6356966\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 394,
        "task_id": 4011,
        "test_case_id": 31,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n814\n5 7 1 7 4 3 9 4 4\n",
        "output": "857\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 395,
        "task_id": 4011,
        "test_case_id": 33,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "10\n2422346641\n4 2 8 7 4 7 1 9 7\n",
        "output": "2722877774\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 396,
        "task_id": 4011,
        "test_case_id": 35,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n3753\n5 8 3 2 6 5 7 4 3\n",
        "output": "3763\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 397,
        "task_id": 4011,
        "test_case_id": 36,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n35\n1 8 7 2 1 8 8 6 2\n",
        "output": "75\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 398,
        "task_id": 4011,
        "test_case_id": 37,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n7362\n2 6 4 6 5 7 5 5 8\n",
        "output": "7476\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 399,
        "task_id": 4011,
        "test_case_id": 41,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n5422\n3 4 1 8 6 5 1 7 2\n",
        "output": "6844\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 400,
        "task_id": 4011,
        "test_case_id": 42,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n743\n4 4 4 8 5 8 6 6 5\n",
        "output": "784\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 401,
        "task_id": 4011,
        "test_case_id": 43,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n13362\n5 3 6 5 8 7 8 8 3\n",
        "output": "56673\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 402,
        "task_id": 4011,
        "test_case_id": 44,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n235\n4 7 3 2 6 8 8 7 5\n",
        "output": "736\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 403,
        "task_id": 4011,
        "test_case_id": 47,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n42\n2 3 8 5 6 5 3 1 8\n",
        "output": "53\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 404,
        "task_id": 4011,
        "test_case_id": 50,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "6\n848821\n2 3 9 4 9 6 5 3 5\n",
        "output": "848832\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 405,
        "task_id": 4011,
        "test_case_id": 51,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "6\n422354\n8 4 3 6 7 9 7 6 8\n",
        "output": "644376\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 406,
        "task_id": 4011,
        "test_case_id": 53,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "6\n853377\n3 5 7 3 9 5 8 1 5\n",
        "output": "897788\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 407,
        "task_id": 4011,
        "test_case_id": 54,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n613\n6 4 4 5 7 5 4 3 4\n",
        "output": "664\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 408,
        "task_id": 4011,
        "test_case_id": 56,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n22\n8 5 2 7 9 3 8 8 1\n",
        "output": "55\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 409,
        "task_id": 4011,
        "test_case_id": 57,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n6785\n6 9 7 3 8 2 9 4 3\n",
        "output": "6985\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 410,
        "task_id": 4011,
        "test_case_id": 60,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n11636\n9 2 2 1 3 8 1 7 5\n",
        "output": "99836\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 411,
        "task_id": 4011,
        "test_case_id": 62,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n14241\n4 8 1 9 7 8 7 3 5\n",
        "output": "49894\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 412,
        "task_id": 4011,
        "test_case_id": 63,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "19\n4752348644348366742\n6 7 9 7 5 7 9 9 5\n",
        "output": "7957979777979977977\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 413,
        "task_id": 4011,
        "test_case_id": 64,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "6\n463364\n9 7 7 4 9 7 3 3 6\n",
        "output": "477774\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 414,
        "task_id": 4011,
        "test_case_id": 65,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n14824\n6 3 4 5 4 7 9 9 7\n",
        "output": "65935\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 415,
        "task_id": 4011,
        "test_case_id": 70,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n3511\n2 9 9 9 7 7 2 7 1\n",
        "output": "9722\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 416,
        "task_id": 4011,
        "test_case_id": 74,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "2\n36\n1 4 7 5 3 2 7 8 7\n",
        "output": "76\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 417,
        "task_id": 4011,
        "test_case_id": 75,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "6\n135642\n7 9 3 8 4 8 2 3 8\n",
        "output": "735642\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 418,
        "task_id": 4011,
        "test_case_id": 76,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "8\n25711736\n9 3 1 1 3 2 8 8 1\n",
        "output": "35711736\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 419,
        "task_id": 4011,
        "test_case_id": 77,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "9\n145553875\n9 2 5 3 8 6 3 1 5\n",
        "output": "945553875\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 420,
        "task_id": 4011,
        "test_case_id": 78,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n536\n7 7 8 9 7 5 6 5 6\n",
        "output": "786\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 421,
        "task_id": 4011,
        "test_case_id": 84,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "4\n3411\n2 9 5 8 1 9 9 1 1\n",
        "output": "5822\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 422,
        "task_id": 4011,
        "test_case_id": 87,
        "question": "You are given a long decimal number $a$ consisting of $n$ digits from $1$ to $9$. You also have a function $f$ that maps every digit from $1$ to $9$ to some (possibly the same) digit from $1$ to $9$.\n\nYou can perform the following operation no more than once: choose a non-empty contiguous subsegment of digits in $a$, and replace each digit $x$ from this segment with $f(x)$. For example, if $a = 1337$, $f(1) = 1$, $f(3) = 5$, $f(7) = 3$, and you choose the segment consisting of three rightmost digits, you get $1553$ as the result.\n\nWhat is the maximum possible number you can obtain applying this operation no more than once?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of digits in $a$.\n\nThe second line contains a string of $n$ characters, denoting the number $a$. Each character is a decimal digit from $1$ to $9$.\n\nThe third line contains exactly $9$ integers $f(1)$, $f(2)$, ..., $f(9)$ ($1 \\le f(i) \\le 9$).\n\n\n-----Output-----\n\nPrint the maximum number you can get after applying the operation described in the statement no more than once.\n\n\n-----Examples-----\nInput\n4\n1337\n1 2 5 4 6 6 3 1 9\n\nOutput\n1557\n\nInput\n5\n11111\n9 8 7 6 5 4 3 2 1\n\nOutput\n99999\n\nInput\n2\n33\n1 1 1 1 1 1 1 1 1\n\nOutput\n33",
        "solutions": "[\"def main():\\n    n = int(input())\\n    a = list(map(int, input()))\\n    f = [0] + list(map(int, input().split()))\\n    i = 0\\n    while f[a[i]] <= a[i]:\\n        i += 1\\n        if i == n:\\n            break\\n    for j in range(i, n):\\n        if f[a[j]] < a[j]:\\n            break\\n        else:\\n            a[j] = f[a[j]]\\n    print(\\\"\\\".join(str(x) for x in a))\\n    return 0\\n\\nmain()\", \"n = int(input())\\ns = input()\\nd = input().split()\\nx = 0\\nfor i in s:\\n    if d[int(i) - 1] > i:\\n        break\\n    x += 1\\nr = s[:x]\\np = x\\nfor i in s[x:]:\\n    if d[int(i) - 1] >= i:\\n        r += d[int(i) - 1]\\n    else:\\n        r += s[p:]\\n        break\\n    p += 1\\nprint(r)\", \"# AC\\nimport sys\\n\\n\\nclass Main:\\n    def __init__(self):\\n        self.buff = None\\n        self.index = 0\\n\\n    def __next__(self):\\n        if self.buff is None or self.index == len(self.buff):\\n            self.buff = sys.stdin.readline().split()\\n            self.index = 0\\n        val = self.buff[self.index]\\n        self.index += 1\\n        return val\\n\\n    def next_int(self):\\n        return int(next(self))\\n\\n    def solve(self):\\n        n = self.next_int()\\n        s = [int(x) for x in next(self)]\\n        x = [self.next_int() for _ in range(0, 9)]\\n        id = 0\\n        while id < n and s[id] >= x[s[id] - 1]:\\n            id += 1\\n        while id < n and s[id] <= x[s[id] - 1]:\\n            s[id] = x[s[id] - 1]\\n            id += 1\\n        print(''.join([str(x) for x in s]))\\n\\n\\ndef __starting_point():\\n    Main().solve()\\n\\n__starting_point()\", \"def main():\\n    input()\\n    n = [int(x) for x in input()]\\n    f = [0]+[int(x) for x in input().split()]\\n    for i in range(len(n)):\\n        if f[n[i]] > n[i]:\\n            n[i] = f[n[i]]\\n            for j in range(i+1, len(n)):\\n                if f[n[j]] < n[j]:\\n                    break\\n                n[j] = f[n[j]]\\n            break\\n    print(''.join(str(x) for x in n))\\nmain()\\n\\n\", \"n = int(input())\\na = list(input())\\nfi = list(map(int,input().split()))\\nflag = 0\\nfor i in range(n):\\n    if fi[int(a[i])-1] > int(a[i]) and flag != 2:\\n        flag = 1\\n        print(fi[int(a[i])-1],end=\\\"\\\")\\n    elif fi[int(a[i])-1] == int(a[i]) and flag == 1:\\n        print(a[i],end=\\\"\\\")\\n    else:\\n        if flag == 1:\\n            flag = 2\\n        print(a[i],end=\\\"\\\")\\n    \\n\", \"a = int(input())\\nN = list(input())\\nf = list(map(int, input().split()))\\n\\nind = 0\\n\\nfor i, n in enumerate(N):\\n    if int(n) < f[int(n) - 1]:\\n        N[i] = f[int(n) - 1]\\n        ind = 1\\n    if int(n) > f[int(n) - 1] and ind == 1:\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, N))))\\n        \\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\n\\ns = [int(x) for x in input().strip()]\\n\\nf = list(map(int, input().split()))\\n\\nstarted = False\\nfor i in range(len(s)):\\n  if f[s[i]-1] > s[i]:\\n    started = True\\n    s[i] = f[s[i]-1]\\n  elif started and f[s[i]-1] < s[i]:\\n    break\\n\\nprint(''.join([str(x) for x in s]))\\n\", \"n = int(input())\\nl = [*map(int, input())]\\nd = {}\\nfor i, j in enumerate(map(int, input().split())):\\n    d[i + 1] = j\\n\\ni = 0\\nwhile i < n and d[l[i]] <= l[i]:\\n    i += 1\\nwhile i < n and d[l[i]] >= l[i]:\\n    l[i] = d[l[i]]\\n    i += 1\\nprint(''.join(map(str, l)))\", \"#\\t!/usr/bin/env python3\\n#\\tencoding: UTF-8\\n#\\tModified: <26/Apr/2019 08:18:47 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return map(int, sys.stdin.readline().split())\\n\\n\\ndef input(): return sys.stdin.readline().strip()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(input())\\n    f = get_array()\\n    flag = False\\n    for i in range(n):\\n        x = int(a[i])\\n        if (x < f[x - 1]):\\n            flag = True\\n            a[i] = f[x - 1]\\n        else:\\n            if flag == True and x > f[x - 1]:\\n                break\\n    print(*a, sep='')\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nf = list(map(int,input().split()))\\nf = {i+1:f[i] for i in range(9)}\\n\\nst = n\\nfor i in range(n):\\n\\tc = int(a[i])\\n\\tif f[c] > c:\\n\\t\\tst = i\\n\\t\\tbreak\\n\\nfor i in range(st,n):\\n\\tc = int(a[i])\\n\\tif f[c] >= c:\\n\\t\\ta[i] = str(f[c])\\n\\telse:\\n\\t\\tbreak\\n\\nprint(''.join(a))\", \"n=int(input())\\ns=str(input())\\ndict1={}\\narr=list(map(int,input().split()))\\nfor i in range(1,10):\\n\\tdict1[i]=arr[i-1]\\nans=''\\ni=0\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]>int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=s[i]\\n\\t\\ti+=1\\n#print(ans)\\nwhile(i<n):\\n\\tif(dict1[int(s[i])]<int(s[i])):\\n\\t\\tbreak\\n\\telse:\\n\\t\\tans+=str(dict1[int(s[i])])\\n\\t\\ti+=1\\nans+=s[i:]\\nprint(ans)\\n\\n\", \"n = int(input())\\na1 = list(map(int, list(input())))\\nu = list(map(int, input().split()))\\na2 = []\\nfor i in range(n):\\n    a2.append(u[a1[i] - 1])\\nok = False\\ni1 = -1\\nfor i in range(n):\\n    if a2[i] > a1[i]:\\n        i1 = i\\n        ok = True\\n        break\\nif ok:\\n    i2 = n\\n    for i in range(i1 + 1, n):\\n        if a2[i] < a1[i]:\\n            i2 = i\\n            break\\n    for i in range(i1, i2):\\n        a1[i] = a2[i]\\nprint(''.join(map(str, a1)))\\n\", \"\\n\\n\\ninput()\\nA = list(map(int,input()))\\nf = tuple(map(int,input().split()))\\n\\nfor i,a in enumerate(A):\\n    if a < f[a-1]:\\n        break\\nfor j,a in enumerate(A[i:], start=i):\\n    if a > f[a-1]:\\n        break\\n    else:\\n        A[j] = f[a-1]\\n\\nprint(*A, sep='')\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n##################################\\n# University of Wisconsin-Madison\\n# Author: Yaqi Zhang\\n##################################\\n# This module contains\\n##################################\\n\\n# standard library\\nimport sys\\n\\ndef main():\\n    # nums = list(map(int, input().split()))\\n    n = int(input())\\n    s = input()\\n    assert(len(s) == n)\\n    digits = list(s)\\n    m = [0]\\n    m.extend(list(map(int, input().split())))\\n    change = False\\n    for i, ch in enumerate(digits):\\n        d = int(ch)\\n        if m[d] > d:\\n            digits[i] = str(m[d])\\n            change = True\\n        else:\\n            if m[d] < d and change:\\n                break\\n    print(''.join(digits))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"n = int(input())\\ns = list(input())\\nf = [0] + list(map(int, input().split()))\\ncok = 1\\nfor i in range(n):\\n    q = int(s[i])\\n    if cok:\\n        if f[q] > q:\\n            cok = 0\\n            s[i] = str(f[q])\\n    else:\\n        if f[q] >= q:\\n            s[i] = str(f[q])\\n        else:\\n            print(''.join(s))\\n            return\\nprint(''.join(s))\\n\\n\", \"n=int(input())\\nnum=[int(x) for x in list(input())]\\nf=[int(x) for x in input().split()]\\nflag=0\\nfor i in range(n):\\n    if num[i]<f[num[i]-1]:\\n        num[i]=f[num[i]-1]\\n        flag=1\\n    elif num[i]>f[num[i]-1]:\\n        if flag==1:\\n            break\\nprint(*num,sep='')\\n\", \"n = int(input())\\ns = [int(item) for item in list(input())]\\nf = [0] + [int(item) for item in input().split()]\\n\\nnew_s = [0] * n\\nfor i in range(n):\\n    new_s[i] = f[int(s[i])]\\n\\ni = 0\\nidx = -1\\nfor j in range(n):\\n    if new_s[j] > s[j]:\\n        idx = j\\n        break\\n\\nif idx == -1:\\n    print(''.join(str(item) for item in s))\\nelse:\\n    start = idx\\n    while idx < n and new_s[idx] >= s[idx]:\\n        idx += 1\\n    u = [str(item) for item in s[:start]]\\n    v = [str(item) for item in new_s[start:idx]]\\n    w = [str(item) for item in s[idx:]]\\n    assert(len(u) + len(v) + len(w) == n)\\n    print(''.join(u) + ''.join(v) + ''.join(w))\\n\", \"n = int(input())\\na = input()\\n\\nf = [int(x) for x in input().split()]\\n\\n\\nr = \\\"\\\"\\n\\nflag = -1\\nfor c in a:\\n\\n    k = f[int(c)-1]\\n    if flag == -1:\\n        if k > int(c):\\n            flag = 0\\n            r += str(k)\\n        else:\\n            r += c\\n\\n    elif flag == 0:\\n        if k < int(c):\\n            r += c\\n            flag = 1\\n        else:\\n            r += str(k)\\n    else:\\n        r += c\\n\\nprint(r)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\n\\\"\\\"\\\"Codeforces Round #555 (Div. 3)\\n\\nProblem B. Long Number\\n\\n:author:         Kitchen Tong\\n:mail:    kctong529@gmail.com\\n\\nPlease feel free to contact me if you have any question\\nregarding the implementation below.\\n\\\"\\\"\\\"\\n\\n__version__ = '0.2'\\n__date__ = '2019-04-26'\\n\\nimport sys\\n\\n\\ndef solve(a, f):\\n    mydict = dict(list(zip(list(map(str, list(range(1, 10)))), f)))\\n    ans = []\\n    flag = -1\\n    for ch in a:\\n        if mydict[ch] > ch and flag <= 0:\\n            ans.append(mydict[ch])\\n            flag = 0\\n        else:\\n            ans.append(ch)\\n            if flag >= 0 and mydict[ch] < ch:\\n                flag = 1\\n    return ''.join(ans)\\n\\ndef main(argv=None):\\n    n = int(input())\\n    a = list(input())\\n    f = list(input().split())\\n    print(solve(a, f))\\n    return 0\\n\\ndef __starting_point():\\n    STATUS = main()\\n    return(STATUS)\\n\\n\\n__starting_point()\", \"n = int(input())\\na = list(input())\\nd = dict()\\ns = input().split()\\ncan = set()\\nfor i in range(9):\\n    if i < int(s[i]):\\n        can.add(str(i + 1))\\n    d[str(i + 1)] = s[i]\\nfor i in range(n):\\n    if a[i] < d[a[i]]:\\n        a[i] = d[a[i]]\\n        i += 1\\n        while i < n and a[i] in can:\\n            a[i] = d[a[i]]\\n            i += 1\\n        break\\nprint(*a, sep='')\\n\", \"n = int(input())\\nx = list(input())\\nf = dict(zip(range(1,10), map(int, input().strip().split())))\\n\\nfor i in range(n):\\n    p = int(x[i])\\n    if p<f[p]:\\n        while i<n and int(x[i])<=f[int(x[i])]:\\n            x[i] = str(f[int(x[i])])\\n            i += 1\\n        break\\nprint(\\\"\\\".join(x))\", \"n = int(input())\\ns = input()\\nperm = list(map(int,input().split()))\\nwyn = list(map(int,s))\\nc = 0\\nfor i in range(n):\\n\\tif c == 1:\\n\\t\\tbreak\\n\\tif perm[int(s[i])-1] > int(s[i]):\\n\\t\\twyn[i] = perm[int(s[i])-1]\\n\\t\\tj = i \\n\\t\\tc = 1\\n\\t\\twhile True:\\n\\t\\t\\tj += 1\\n\\t\\t\\tif j < n and perm[int(s[j])-1] >= int(s[j]):\\n\\t\\t\\t\\t\\twyn[j] = perm[int(s[j])-1]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tbreak\\nfor i in wyn:\\n\\tprint(i, end = \\\"\\\")\", \"n = int(input())\\ns = list(input())\\nf = [int(elem) for elem in input().split()]\\nind = -1\\nfor i in range(n):\\n    if f[int(s[i]) - 1] > int(s[i]):\\n        ind = i\\n        break\\nif ind == -1:\\n    for i in range(n):\\n        print(s[i], end='')\\nelse:\\n    x = i\\n    while x < n and f[int(s[x]) - 1] >= int(s[x]):\\n        s[x] = f[int(s[x]) - 1]\\n        x += 1\\n    for i in range(n):\\n        print(s[i], end='')\", \"n = int(input())\\na = list(input())\\n\\nf = ['0']\\nf.extend(list(input().split()))\\n# print('f:', f)\\n\\nstarted = False\\nfor i, item in enumerate(a):\\n\\tif not started:\\n\\t\\tif int(f[int(item)]) > int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\t\\tstarted = True\\n\\telse:\\n\\t\\tif int(f[int(item)]) >= int(item):\\n\\t\\t\\ta[i] = f[int(item)]\\n\\t\\telse:\\n\\t\\t\\tbreak\\n\\nprint(''.join(a))\\n\", \"n = int(input())\\na = input()\\nsp = list(map(str, input().split()))\\nnew = \\\"\\\"\\nfl1 = True\\nfl2 = False\\nfor x in a:\\n\\tif int(x) > int(sp[int(x) - 1]) and not fl1 or fl2:\\n\\t\\tfl2 = True\\n\\t\\tnew += x\\n\\telse:\\n\\t\\tif int(x) < int(sp[int(x) - 1]):\\n\\t\\t\\tnew += sp[int(x) - 1]\\n\\t\\t\\tfl1 = False\\n\\t\\telse:\\n\\t\\t\\tnew += x\\nprint(new)\\n\"]",
        "difficulty": "introductory",
        "input": "3\n167\n3 1 6 6 7 8 5 6 3\n",
        "output": "387\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1157/B"
    },
    {
        "id": 423,
        "task_id": 4108,
        "test_case_id": 1,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "azzel\napple\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 424,
        "task_id": 4108,
        "test_case_id": 2,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "chokudai\nredcoder\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 425,
        "task_id": 4108,
        "test_case_id": 6,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "vmhna\nzvvvk\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 426,
        "task_id": 4108,
        "test_case_id": 7,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "uvan\naimq\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 427,
        "task_id": 4108,
        "test_case_id": 8,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "kjpicclvk\ndhuvsejod\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 428,
        "task_id": 4108,
        "test_case_id": 9,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "igyyfcafwgctiwnsaxpisxggcopgkwrnyxaeofoxwkcocoycrttxeneponcxwoyyoagcegrwscfyfgerceafacpewwwgrgysyrptfkkanfngtaypncnggssyatrkxarsfwcfsowncxxgrwnssnacykkaeeriowxanosnosxfrckcypoexkssyawkectaopwposontxpfctcpskgwxxpckswaapanykkkoknfkcynkayytfrtwwpffkoxtokrsfpnkroskgyyrsxagaryrisekctcnaypxckweksatnpttyaxexiniiytawtnaarinxxktraapswtttgoksrfywkfapienpnwntaginowtyserarxcppfnxynkipewpkcwstntsenifgsnwfaeoenwnrkeckiaeoeopfwcoxtionocexypkkaconeixyweftysofoixwxstgrrysrkifwgcnrxscpeweofkxnkswtnctaeircrgsxifpxwoxpcxrwekfrkcanpkxsnesgffxggwwxeigxwoixnifeiykwctrpsoygffrwcyfsxfkkoreteitxciwaaeatwniarfcswptgaccfcickfiaxtfnyioafwwxokfewksnpoyngpnftsiyeirfraxsyttotpfxgykgskwkrxekypinstpceegaxofiweffxipfostcgeitxwkrncackrsyefegrcgfwpiiekriegcgpnnnoiygkoeprwrifniwatooonrggigyaooxxnnpetpwngppofncowgxsxptrfasfypynnnaskcsnrcyrioagwonrtoaiagrftssikyranoftxenowrpfrgciaowgscsyawcneakcxaiiarcetttokpxtroiniiynpycwwogxspefcswoaxpaakwyrpkytegtpctonpgoycpgagtstccwpsyycpfsentwyganxekworrrwiwrwfexyoesxrprkinrtnyrggsyofkgoxaigkxfgxofcsryprffxrocoxexyttecakteritnsanrwgnroeonwttrysositiprxakwirocsorxrgoxfrncptrrnyxyktytoaccatoaniaapikwkoticaptgenpsnfngtciiekkkxtefrcfsfopgpkngekfpkkrfgopiteingxgkgsefprxaicrnwtxernifpixxsttrinnicepwteenksisinokekokrofexitafkrwfpppsanoseoeppffxfftneoaitfoxswarwankitfgogspeysxynfaewoccfegkatgaaoxaeoewokkarwfofwkoesagsxnoggfcosccnogygfyikptanpogoogkswkyoikapacoweraofgaeapngnkkxytigxcxtcwwcnxkfkgyiiicxarspoaygapficoeakopeckrrietrpforsaxksnxstpaxktwinofswsgawinnatkncrysargecxryxtwrctswstinatcwofrgaoxonpypcnfpoogykgckspsxwoprfigcrrtxcgcatirrgceggckoxfokinyacfiyxcntttpoakageiirxepefoswksgyaxttttceranyytfnfkyycnrirriiefkieiprisrcsatnonickfyiyapygpgxpyngkptpnxaowtnatiigswktkwneyfrkpakstoingkineioopofyefeepyfwwrnygigrggiktcoxpryccyaetiipiiwcwwpnpxacytsiwepweswrfrsxnfxatyitatecosrctangpkpixoafypgekwxotxtagocrctepscrfyxniterwkwsxkgfyoactsykgieopwxefysfwtosnniceonynwngagfcxftwccncfrtwxxrcceciywkcywfiwagfossaentnfxeineoxsncnfgcrnkeiexasexwcsyxegwstopfcinkncxpoaskfywppwrgctptggnpccerraaykkpwwppxygaxwocyxkkktirsgexwrsitefnwoeerpegyofexrnitrnoektstakfwxpnrrsireoswpxxegckyyoatkxsotesfnnrecieypkgnargrwfrwpresgowaxxxwxxxnyypoxtywxkfkgxyortyxascgnrssgtipfpsicstycexkpcnaexiksioiikfxofxkxfnnfetwsxertsefyakcfoacrfggsepaxxwwfcxosscfwyxfffecrgsrkyayspnkipwncoeyeorawrwywknianpyntkxrpnoegoixooexiwesxxowpnxffocyrkencpkkywnoacecernnrctgwcrinrxwncpfcwcystxcatxraecexkwacisifxocikitpgoykipoopkrxgyrrxrfggafogxtfikgrwsifpoxporataccyoftptpagwcwcxrreoscyntcerrtsnoktgptwynrpoygaefxfikgsyfffxnxpnfrcfseewpfnircyyacwixwocyftgakoeetxfpxngystgcixocexnetixaexwiinnisgkfatkparkixwrkcosfcfigxonnrnntretroceogapgytkaxrcawakwprgiikcokofwnnoskxyaitwxrgrpyxcregfykkgocnwttwpekiooctxagnixntnsrniixkfwrwpnnffwifewgtrkteeyisncyeontnsictnxprowerywwwyceicwrpcrfixkanxekgoeccocwrxrtxyanafnioioiakcrosfrfreyocpkcyfeypfpgkwkngrkgcospeotsyyfyiiwcfpxawrrawywkwcgawtesfetsknwkfkfppraetkrgixskatcgttytyasfatxxssnpcoofiknaypykwstawofxienftwikxgpeseniorfgtapkixkicataioetrrexrcrenptoifwcsgpknixenitfaetwrgkncfpsksnrwykkwfanfcfnxiekgcfktryyfpkwnrowxatgaywopcogpeyofgpnctyoxfcksiyasicpkoaprirritetttwcorkcgcroawwfcygnxtprixsogcryanyfciesggeeoacnctiwpwptrrpxifrfxnywwtiixrogeatstxisiryxpsntocynisxaryxyfkwyxttycgfegfsafcefwsssofsrrxwpciycwiffcyyciowenrteiewygakwwrffrpatwpanrxpoprkiiogpygigsaaoccxxxayycrftxaenxoinwrrosffptkntokapsttsknwctopykerraaxapyoxnywockpgfwoywcwkgfxxapixwscarkffttestenaiccsnkftnfcntsncgpeowrgptxgopstscrpyfoyegnfnsryiitcoersykgitpannonasckeosyeytiwpcgxcpkpirxgpseofopgaecrxtscaywcxnyrefywspwcxyyaafxnwiopiotwpgctenygsyfnecatskpwwpooerryswcnstctncfttwgopgnkayycroknacrrexragkwgtksekxexacexxpcsnepiksitronnkeiceinnoassnpeggnatgkycgkwgctpwaarinxoreicxysipeksfegrsrgaepsyaecsxwcwsgtfonkxsooeaawpfoicncgpewgoxfykrykcoywrtntifxywpynwepooeapcipngoectwnwrtxeitwtgxxtkfeirasancapkgwyeraoypwsctsgacifrrswcwxrpgnitxayktpwoiiiperiaeittogytorinwxtkkteiietiygewxrcgewopswstcwgewiwgwakagtinntcxcpnwawkfikeyopgoewonetwopipwwwfrrpnrtikpkafnxxnsxiwxiantgynneinfppeskiostrxferssawwpkwetkpyiikwpxpkaxxtppgfggyekpinpkeapxgeokyirppiriyfgtyfpgttxnxstgyyetxxxkayosryorotsirwcfcnetkpgagenapipfptefserwroxiicyayienaecrekosgkpysspctaaygiwsayasiixppicfowitaetpitskxosykipntnkgfonaeekrkkyfsogenarayrrwancpnratpttxtpyytcicnoapciiccnwpesiefnxcofwekstfsxngfeaxgwtpgwggweiaayaiytswcnwgcxkxakicyoakkxataseitanoxogwswfgcacxwixeegarprafskscpteoiirgkwweogoipxsexftgtygpyfaekecngitccosyorscnctacgggyyttsecrfeggtnsiwwxpyfrggxetwnpseppxxgyocwtatskxotieaxkxeksnctrnkwrxsoptyeopiewxgiaposxwaopyxgnrrtytyxynwcocisagapyyprefxgtkfxagxgoptncosrwnxkyctneectfytsesyriffnkfceaypxisyfsfpyrgfaacsswyipnpnintxystotexofftkckgtkpprktceriittxggxeangfyrinsfxkfxyxopsycowanexopcairkkpxgpnaaisynpywosnykekynrnwnfirkeeskygtxkfrrkwooifstppxwapykpcakpanaowxtcafginpopfkrfoffcayteptkrecffekrnesnnxconnycyfxpstxstwykkppwaggonnacrayoyakawsayassepxonsfyaycpnccgiayfpettnxyokaykcosonsegtcsgkiykaorxrywynaykwpnyppgwoikkyieiigcnffcxskfcxisrgwgkowpprpwossgtgwokyyiitntcxtggtsgtafsssopnyffrgaeefxgexfrakkpiffpacspfwcpgsxxxfwcxaaakaptwnertskeepifeygwaariofigngfpyepeoyanpgeafrcpnccirwpoogntycpwyggwcaacwtpcefategpefesoygfogkcxknotoreknisnygcsfnsfpyxgtipopgssernyxsnpnxkcrxikrrnoxigtykrtspngiwakeixnwntagyrwowwccftcooigtnkrxcgegnncpatespectawyepncoprcswnswgecgcfotrkpcttcngocenfxxspeotrpeoriffasigsgkkownownawenrwfnfeygxttxaxasgxpfopnixtwcttfwtancwcnracorscfkrpenpgorsckakfnyieixiocwoiysitnxigkyonssxkrfyftwgiwasowtkraatyxenxfsifaoosorkrgnpoanyysnsyspesnearssckncoaaksrxwgswceytykiannyeyxiwarecnxkfixerakygafnyenrappsyofcppenwprsapaepyxfifeogeyaryraywxwakpfsnwcncasrrtncryasytkxpptcxypanwotciooxxtwcasnkscinawwokcitniswaiyogxgxrieisaniirctrfircxtkgecncrgsrirfgkriticpwtywsrocsgitoyaiansritrwwagcfrkcfiarceiwfeaxftrnxwiinfgrgcarayixonegxpwtpnwwfrxxrsawysotrtxxgixyscnrccyaxktnrotpgcxcwfnewxyywrcgtgxtsosoatxxnkiotaycesatyoewxcywsxorsccgcseergnsencxwfgrysnkgnnrpcfgapciceocfegfnkkkxscwxkxtcxptitcswetrxccwfctyrwwsigpgrroxfgieyacxyscfrosipawystktfwsyiigtwsttnsgwogaagooriypfsgerkknxxpektfwsxyppnwpetaoroyytpgafaaxeiiewcroxfsyctnwneapncxyoitapcryrspiawewgkapincscnpwaaxrrywesngrkykpyyrwantgipsfarpfiixxyoknrgxykcscsofnynceccikesesnaywpxnwgnpyscorekssfixeryaepsfiieankfaksafpgawiksgpscggyfspgoweyrcroncexaxwcwsfkkwentcoaxksfgxcioeoyosyxkrsfoaffokiognyxycknyoeowfapowypeigocxktyaetsiookwtynsknoieoknccgckepircwrpiatfxgptsxiseonyseriiwwfaxfcecgsfgraaniksfofpapifwitktpsferrytxngicaxccrakfxtwtkxioiecktpipkptpwriaepcxponkrtcxextfasteogiafyfgwgfokaoseincposcneekwawaxfgafcayoeantfioiniircsgnsieteiwxncoiygrwgryifnketccwieocnnkxyfrpywoprwktsfyaycfrktifkxtioneepooxrkaacweikrownactggcrfcagwinpyekwsxcpgfxpiaotskyokskgtsgtnegcefgkygrggarnpfcxtexywcfaeroygwptarfrooscyenycieeogtyogoygawwkkkpsneoisgcnsfcwisoctsrnkkaetegtwsoescaktiftrcxwgwcnsrarksftxnkkeprkiaessyntaxicansoaryegpofnweikywiiayiocwpsskrspoksppwayykieooowfcsyifgtkewpcngfnatpwwsxpiropyogtpnykixxcninnotkpkgpsegiiaixfrnekxraeskpxofknxectperfrsffoniorgpfxfankttwkogcnigenkrkncsgsytoxypesfcnicnyaffiioyrecsfogrktwfckoafgoecofsfkgegoofircwrwkesocrieyanrgfiainppsewxnyewoxsnkefascffiowskigsgscnpcapffawianiirtitpsopoipxkwscntewcwoyyeppcwnerokfcxctcyfwpaywtopncisogicegwwwfkgaprxtctreswonoowncneacskekookgkwgecasrrtwwigawpwxefxkkfkpptkwwofxrfkotssxanikstpsfpxrfwfitspfywixfxafiynkffrsaecxgretppwoyicnogfgwgxwngxfkpgxxriniiswnoeceotprwxakgcgctenrreagiknnrotwpgakktrgpifaxorfkcexgfyecfwppppsteirxaonnotrffyxexeeprwpatpsfxgectcxaoicknsgcecackpkpgpoccswnnxcpffetiagpfcxrkeseskseffyifgaiikofisnfkrawstpxwcyispykktxrcffwntnygptgsefgyxgsrxrrpfggwfkesokawaywaxcygoywynyfrrxcefrtooktefpwofyxnpkgctfotisiyfrsopyyosxpgiwgkgncsrtgfxykgrkcntxnpiittwxnfwaipfnkseexpyfipieogeskoosfgwkoysgccaaxnyoegxanskyokkykeacgasnskypnttcnafxcesisoxsfsptppyoacnaarrwntkrfiwipikeeesopirextixkkeeorsecaxsckxtttansoyiofpyisakkyrsekenkogiefgfrnoiksreekniykewawcwxxywiipngtcscnxsfpryktffrxrgixnntffexitcpeiefsfpegcwgnwppeotfgrpwgwocrwfagxryfkagsxswkiopewgtxtgacwxyftxrexeiykxoxcpyrsxsxotawtnisfgncrciwgsiykixxsotcawanpiwysetaaspfktfgafagfgnrrkgwfgntaxiknikeeeipaygnetiwytceaiiwggawxnnceceatptfoskksigsptxkticegttreafcsgassawcyyscryxtcfxnygnretrgtprgecaecooggscpyocengygognnxgrrtfstoifitawsnyswreytttfwngeoogttewkptcngyowkptkwttnrywpetgkwcwcryospxkyynankocgrgnrwakcfnginnxnieesxxfonipspkxgfeckganscpiyitnattwinwpgsrepcefkontwywaosckenaptysopgrkcsisexwcrpcnyxpeneynawcfpxcfniitcnngixinckefrcgtoggpoociprwyasxrgaxxeftirapyaptxtfyrrnyyseyreikaoitnptcsiknraifpexatnrscykokyfsyykaespireornrkosrinywcktkknfniakogstnskcengfxrskgpgcxwxyyftyoteigwskwakagegawftpapogrwirrtntgnetcfecwrgnopswkatiyienycsxncoprkctckytopcnxtorpcroawerypxrkeakspxffgfowssyntsnnnkgfepwpkaxoaxgicrfoytftegyengixccppficwnartrferwftxktyiwsnyyffaypiaaoittxxfawapwstnpesptcoygpctcarrpepgisssexxeecieoyonygcagiyfnknkycxnfkakcitkrkkygcgynkegcnxfeptianfiiywftesgnoyytrccfksrrywxcspkyfotskfefkrtopccapxxfiwfyxtgisyppiwxiscgkarxxosicysiocnwcfsftpwxyxergynokapsniwswrpkctprxxswoifietoakcixekpcicngktncxkfpoyscoacyccxcxcskrfpeosrysginywksynsytposwwgsparaxipxxfitwffngfcxcisnianpgxsapwcwyxrfppossnecxkggaptrekxrokcatoattxrfoxfwiecitpywsgwnfpxtogopicowifswsckcsfagxpfnegxxosicgoywcpocryweeeenwrywioxgksyactipwenscxantcxaxckytoyayiffiocsyrweefyfkeayrpapxyfrntywxaygctfccnxxfrnkyiopgoeternnxkyiepgnrkicoentanyewipkrwgprggkckynpcawxiotesntrsnpxgegwoncnwpncwafinkiytracecxaiasgcfitprfofkswrapisfytowygoefeipkxtwpncwywotaiwcrpwpsisapsttrasetwkxxxxaiksrorkficxkrsggtnxxfsnttywokeefkgwafrkgrxwwswfnrnyoycrikkfsaewnaktxyntkpyrsxsoseswrwgfyscoitxwsitrixcoofgiefigygfriwgeprcroskgainkfykrsnxyasskgayioyyogfgsftscgxiarfofwitnoixxonayffngyktrkytgpeoprokeawxwncwtwoinnrskrfonegpxxayacaanfagcyyocefyweftxispfitfxfpsicrkenwxgxaatoptckxotawwwciogpsropnpgrgwikfgwxoxfetcctpkikcraxoxrpiotxiagnogifeggnsktoafseaofgykrekfrecncyaaerkxffwnwgcgynafssafofpsxknfwapokaiwaoeiictregfpsctggtxxpsnenpiwanwatkoyewcgfpotaoeoywkxrackysfxcxaniscikraeenyssyeennarcikyiggsnixewptncnrgatpnwktyyptfxrisrkkigticfypkcixstrixixccgfroeaxtwassogniowocoftkkcfegkynnisptkccxfewctfwsfroiciixyfeoxocpyxkttyrwwtscgpptexsoyoogkiyfktypefyeenosaointprspgrewiapirngxpeowriypppnsitfigyoowkctttttctsncpgcgneyiycykyixpogynxnswtxtrwpafgytaisntprroxxnoixygfgrpawfkswrafoaxyrxwoaxwrwaenkngfkrypsfggnfknytxkaiosirgeeritwniaypykntgrnwnyiacpswweoywkwgfncappxprnctktwnespwkoxiwwrsokyxsigayxfrytrissrcntsewgkxntpakenoxnipnaxrxkakciwtnasyksiksanwksifsxircxasngiyrtnkcprgeypypoffoarxcpfgxootrkpakykcikneyaioegxategpfoxkwxkwotrrfytwfoenatkeiikkfyigxtpyxcsxanrtfrootwskeiwsepwgtptaggceeakaeiokiergxnftkrsipeesnyrtgaotosneypgppkfatiprwsyysakpgcwoxawyaexgkayganetfowckorpncnaganieiarrksnnsonpfnpgyyaeergwnnykroccwcwkiypesyegtekapaoyocywcinrcxxrscoicptnygiccgfkpxnyrxroyekaisswtytkrpanonccfsantsycpeiwetxpgxpscsopxafcgpieapwcgnykfsctoixgankesktyywniipckrxskaantrswiftncokggpxpktysgrnkwaopiaooiwcppeenctteasiwakpywggfifpoxgxcawxinkiaewocnesrwsofacyoacakewfewpaeyxnckpryowxyswxowfoiwtwiariswcpycrosteexetawtsrwgpyrtfcgoskwyiotxrktiocwoyaeyitekggoxnsfraikfixpixfkypkwnnxagtioeeoxensfnreopepnknwotnctcernsyfwoirtoecewoxfessgcgnfscftieiiixofptsfasxeyroiwafenixiwnrwfnxtcpgrgoperyafrcaarcecnsgacrowsyisyciapnkpnapfyskfpykyciofkotxxtseaiwnoscoktpgyrsxspcxieryyfnxswxceisxcfryokxipwxeyyewgirepsnaeeapncyiiyeyssrkxiyxierwwspxkxxcgtcpyrrtfanncwtotaxewantakkeixtfyrycoxrgsisnprgriatxosstwicykryiittcgyctxxxafiftognfifitiorfpepnienrewxgssxcasoxiweagkiwnaeaynppawasekewewwrxxfawrriiktwfsoinoytisngittiffrsywgfyraepepxpstfcisyfxwkpxtxxwigfotksainxrtyraxowxxewkcyaweogsykoyprcpoinxiaioyktfniacfcpnxcgxkaafxwenrscyierixtwikpxcgsixcsxiwerfoctpprwtsgpksrafswkiexfcrifacwkyoieynatinkfskciwncowypfapyeyfyinypcpfywspongaawgpigrssitypsfgrkttxrowkctesieonnncrssgnpgsgxsfxpwaexskikrcxwgxkfkaytatraowysnapxrpntewwxgkcarexecggnpekpoirfntwkfpwiwewoscgwiixeoypwnkrgifkitkpypyenwiiixfoggkkitaytookewoecixwsssogcniftssinikrtoikxprcffwoegrrpxxspnxgopacxeyeoisrponfggrpfoxrfngtiixnywgnpxascpepnitoctkgpsswrksokcnwfoonpopnkfoercpxspfpetcewsexstpgfpwcwaringygcryncwaocsxptkpxgiexyaekikgkgsketetegowefpgfnoaoetgrnwoieskownxptoeyeoskpieyyanwfcxotcwxexawfsisawaxwyoggyowfyyspicpwsfcnyeiigwnoanagtkwfnnwffnifkstrspycywxfgiwgcignyganxwyyxyoekxcgcanxtarxrxwiatrnpfwxetgoyoigipopxkpaosnikkopwtffoegrigswkcwsctescwikexoooywepfxsxcirnfixgryntoxrrgtasrrncotaffrysacyksasoftkittgpswxcxyfaekcssrawynngsxiewerwotsyfockrkrispnesswkyngafxsekfeetyxsswopxyxainckfykiyeirgawpaxxkpgwwfwfssryeayypgisrynsftisisfxowsoisnfraosrreerwwwkakgpwskoifforgaggsnowogoiyprxornayexniweawtnaagowpygerpwykgonggycegeoaacscpgwwggkesyaxrnsnfgpfsweasfewynkyryfxciyisnkiookenxfgwegoifgwsfeoaocapwpeaxgxcyeoxkiotwkrgcxyfixsranixrfppfrpnwxorwaxnxonnwcfnxrookksyywsknpkrcreseekyirxxosrnwkyrrwgwpnnooakorkkyiwaeetyrcxfgeeacttanpewwoyofsfionatekyrrorxwwyttwfwtatwnkktrcaxiktsxaeyxwwseytessfwywookfkfwxwckgatkaiykapsfkpfyorywcfwowxswcrytasysnppfewtcgnwkgsgorxtykxkorokksaitgtwgepaspieewfryrrirxkfapkoggttpnatpawncffceiffeakppfnfiyggkrckeagiewryfgcrnstxcwfnwnagiseswaxfoypoaoyresaxyawtwyyygocoewctnffcrixiectnwoxttensiotcaprxsiankiaeocftooekgtwgxfowpnpxantnagytrikiefoxexaonkwkfeecrwniigkcepxscfgrptwrccktnktfwygnkogkxyoxygxiwyrcsrfagfgefttrrsxayrecsoexpkxpwrpsrypcsgrrsptswicsieantyiyawxncfynksytkepgystkfwtokcxnciafesyyrrxiwtkckyacaiwsxfyngiwcspfpcyyenaikcgtarryawgxsworpxatipsxctrayofipcefpefnekpyiasxwgcsgssesfrckwitxxkswxsnitiarntpfkprwerxoncfonktikcesyayswncofswsikratnennygfggixscrffgyfsafcfprkarrwsexofekpkcirtoekwnnwixigngxfngriysfsstopwtxopkrfrnortfncyysesirnkfacytsgniyofperskcpxxrptnafrssfepipaewpktospfsscferwywswwwnkotpewefwxaopepysfgksxtwonaneefwxswrkyoykcfcakfkppwtroxeaifwticifgxiyakxtrngtoiaginttaorfpnxpnnyggarsytyxpretpysroakfkrgffrpskitarcpttretxxrancpxcrsxrgayfxxcgtrrkffencnkrftogtpwairxtnyorfwtassyoknscayttnoiaysokyfcweatnnkrseyccoippnpygtyipryaerkptifwstrwfcgyaswsykixfaarcxkggifipcorgcogrotpixacfxgpnksgnpyitaskiiaggkcayokyaewskwgcesccswrcrswrycpprtfaeafeeigrnknifcafwporynpfniiskeafgcccrpiwkktisnrpxxnyrfaawcgppontgpetowcgfygcowxfwspasyceckggexooerigtcnayywptfweryxxfttngfnrcggpxfsnnknapppxnrkikwgococciotwksrxpgenoscgcrnyncptyewxiiayikfteernextgyaktogowxoknnaoayfrceswofpggpaottiiotisksywnxkiyyaxoxppyscpkxrkcasxpyaytxnyreggrkxtfoanfrpotetnerccxaenxnyseirkcftieaxnfxcckfnryrnynawatnncykprgkroinirappggfpyoawniwytnwycyiaagaoiwsgxorecnegkxwgpkpsrwpotgeypyyntpxsiwcrpxxoaaasitfxrasccwxngnikwpasyxyfsppftxpetntrtagrarokcteipwyertfwopenrpopwiewcsffrtaxatgiykweoiwkxtrfryxcoonrofowwenxcpwgyfpsoswaygyowerowyrxcngnstsnietgrgfsrwgrrafgectcwrtrtnicgrxnsociyptgytagycippwgpnpsyrgwsktyafpwixffikkfyyiikeifcswptrtskffyexnxkncoxywwrpxgsxoorpiietcacrxwsrcknrfsaratiwscptpffecayafrtsxpwpniooptpnaeaswtytigwieoinasokcfnsrppagtsntxsgfiwxxtkenyfareftpspxpgsefrkpfanntwfffpapagrsaaytiefggiwykkoxopfgsfepgxrswoooegskinktstykwcfgooyswnofcoinxpyocxorrrckypenprkwiwtwgpnxspywgpxrsxgpftgeywieoccowopoyryscyrwxokxegceasycsnnnwkiifrkxxoxsfwiotgiikcxicpfefnsnipaigcfyckkweaawyywwigtfkiyioxxcesgkeacppcketpttinwocwpraafsoseiescrsgxxirxofpoiaykiptntxpaeixkgnpicextwieycnygpagkiweipcagtynrwckepgyskpootktanfoykxxgynicpgkyaxcngfkprewprexwysrarsafaeoknktfwargcwfooyyeprnrcnrragocscrgogoogkcrainnaaagsxknxnosppncagrrsyrwkcnneockeiywyxtgisiigrtaytonaiffeyrwkockyywaksnekganaonapoixooepoetstgnkkworxgpaccpeaepawoytcnnyppwegtgknyetppcxneagcoaastofweeigiscyankekrnksatnokyisxafgyesrfspgooscakoaariogsceresreckciptxseoofnrxynnyikneypiatxfiwefepoyxppcatxtngoceopsoaogetcwtxfroragrwaiwgxytapkrpicsoowoswryggtcsasfoofwpkixesgiopprinafocpyeknypognoysewkwtswwikiggpnwefxrsiowckpapynxsaynkpyarerctfniitewfyrxnccxkwysoaagtxcwetnaygonwgyfoytoerexyaoerypfypgiygtcyroforgspiywccscircfatrgxrknaspisnppoxeikcetgnwinrrxrnfnpepfiyysfrrrwancygiissktkafgocitaawpxetfngsiiciagwookwokawtgspygggartgewofwreasckttkkxfcnykxeycxgxgixfcripypfwrggcaxrtiyroafwftsaxorgcnoxicfooarxwgafpayporetiypoitpxwkrgnfneeyciyotyifciwisakrrwecfwowwiakiyrksonwfaxxiwpyxoiwwxkkkaatefypwcaknnkegikctcsrsgeoesysgnngrxgtangwkernyxtwicfifgxtrgyawetgggyywenwkriwitacaxccipoofriiyeytcncfgcoipwkegxewxnkwceatatcstkctykpnignkxwxoxgfcxtcpoykpxrgcfxciacnscsixkrsxfxexyweipasxxgwngsykfosynkayyeyictyfgsrcgkwscstxassyptkgnkrosnrsrysargoxpaxakxcikakaatnocrerrorewkgkfrtsoxxwwwwtkpyproxxkepfricpretfxwkoeasfnoxfankskcsfiywiwyxcccfpsskkknncfaksiosiiiyoxaaycgcofinnskwfgccncgiegxyoikpxcgccpkraywrxtwrcwcpkcgprwpaeofpgyxcteiroipswacwaagawgagfanciwwysnsxyxyacirrfkanxwtgtopisxryagftcpwrrtktraynfytkwgnnfyxtgicsfxgyoifgwtpxeiofrrgttinpepyrwntkyrfoytwwpxontgiwrnopsctorgtxkgsyfownnwtfwfgkixkiekpsrngkrekoarynyogwxoxoprssycttenkgrnceeetorsntfsnpkwiswfynpykarsyfreetfgxygkfaaaksxwcwrxaofoifscgornoisptsxtfegncfknatyttawrnigpkgskcttanxosoecapeysgrttixonxgiggisyyckpxoficcntwnoptkcxrffxpeyaxwtecgngcnxpxxgrweceocyeswxyoxaygtxaoiccawpnyprrrfriopippxprtorcnayoeifctpiaieotesgewafeekiafatgiscrcfwfgscfyrycnpxpkkpwofcaannratfngyaoogwawawnpwosfpossnwratpeofixtrrxofpnaggcknenisyrpcpygygtscnynfwniokpkkftaowwsrxtgckwwcoosgrrnrpexfegcnrrkxowipiasnfkrafnnxwysytyfiyrakrpotfofiinxgapsxnoaxayffoyiwwsgfeskyxwiawyxnwncsfsgigpagtcesrisxeacprttpwrrasxsincienwcgoityornorkooiinaineypapxfpeistkfwsepkpnysysycpkiknkinwsiofsxaiyypfirgftifrssxnrpyokciferiycwgowrxxfcfkirgokwrycsatffggtwrwffpiyftsxyegctxnxkncwspfttfytynxcyxtircriectfwypeigxxpsscregyywcscfxyaytptaxotpwfseiekikfyefkwskerorxfiaotysersgakykscnfcrcwercxgpxacifkgeyeaiitoowcorcestccegangxgcokrxtyyfeyonxasnpcgfcfcykwkfyprtfgopceyxonfgyyrnxnynfceoygickrccfcyicsagfwkfwfocosewekertrterenantygxrcfeecinxnikwwiwafnwxtiraxpyikknyewiiipwykgowcygcgxeagrngkwswkpwsfetkayyniwytwtookatafcyywstfxyxwiaoiinxgiarpcsoinspxtrgyifcnxntkkpofcepoiwpgwtgopcsstkikwkrpkckgottyiyaeiitweyteseekigegifnpnxwpsripexgfinfiyiaexttykgtnwrpoawygwcccnyfpkfysgwcoacsnynecksxicxxiafeoifyknpyycnxgfaxtasgcykpascpwfyntrpoporfcnfnnnpiareenotnrwncskicaoctfpiteiewartcettwgetrenxgyrkxcxswesrocsfyyxrcfkngktnaopogpwcaatorotppxpkwiceiepinyisstfiarekkxfnfgyfypatnakgwyfikyarsxkfpakicreooncnofyfxercrrknegrfxycgwwryaipsryfikskwarynrfcspaikkxgnxcyeewocoxkwocipypgoysieweagetatsrgargaoefpaxkwoswpfpcasxrssfnggirppipyepxwwpowoeoxpkigkronwncaxraysitnysaagnpiskpgooncgfwerapgrttiopxowrogiroiakcrexoigooxawyaorysycxaxikocckxoeyanonekrprcygioioccwtccwrwnwcycsekingnrncntgkessnotxorncicnwsowywwxragacygcxnnaxtxeffsxakkccfptawgccrppnfcctninwoiettiowwskprftxgsxtcngpwxrygscppwtpfngiraiixiynceitowcowsxiapwacgcsocfrxkxkcygwgrnytscfgpwarysgatactffsotcsecsywefnycercniyewsiggpsxxkooeygetgwwrpgaakwgioepgxcyttpxcscxoneyyaofergynwwxgirxferairtttensypfsrxxysgptkipxetkcrpxnwcfpytpxkipiwxccgpeoxacgcxkerfainfxfronnwtgxpacrwoyewwiaaprcexwpaaxtxkekgwegwitpnecritieayfyetnfpkcgrkottoipptgxaknciwesaaasrttffnppypsogwttwiorrfcixcsrarcirxyrweiwsxsrtwnxraosgtyoyncyaykxffwnnokyaikegnnwxxifyxernyesaxaigrorenrawxxcwsrstxxcpsoppratcnxrwfxfwcfxerekipeocafkgefnekrgesawyxeeoicsaoecxeyeyggcyfffgiaffokxotcoffekkoxeoiysgsccsxkwxnfniacxrswgytoygrnrcegcfgspkgxiareekfatiwinryenrytosrwnpyckegrtrawfoyfonepyktawpkwtisrrowfrxxrcwogrrkrfeopxffecyyskanstxtegsfygoeoownktickfyipfxrgnrwctxxwgncoksyosaekfatyxtaggkorxixsriegrgriinwgiforogpgapnffintsaopkipnnewkfrxtkknetypioknkawrsxtwtctckrystakcctpcywfsfkgcxswxkontfrwtefwfirrncpwkywaywrckrikgtnfkxciprergffnyytcgitgifgyirtkwaxypwkkpxopckrspoiiwxocwiixyxeyoyrsnarxsygnntyoiwgratfkogttennakswoyotyxtkkonexfyrxwwtfiyrsagppifiiegtpiiyifkgsgwkfigfpikwroirsnniexgrrwrwgopgcnoopkxpkkpnprspisnryipngosefnceytxcxetttrpnpngnnegiwkcekipwfcwyigcagpyxsaiwpxeecrwnsexscgfyfiwpfwairpkycowrpygtgieypnaefipkffcerpsaagewafcwprsgxegxnnioxptgftrrpofckpcrnyekpaircecekcytcyspgxkyaonpwoiikxyirygywfswgkwxwnkfisnfysnngewxxaossroeanexggyxacwgkewinafssirkwfwkwxyftwgkfwiwtxasngkinntkffrtipyoxtseaifffaarawaopagfyacnrtyakcwcaisataxnexyiwxtssikaatexexoexsnyeoytcwiceiexcciiwktsoryssskeyowggknkxtoefnrkxnpiyangprpxfenconaynwgxfwooffktfyrseiktewxotfwxpoyapyiiacgigrkacpnnigpcgeaoiynpfsrotsrpkntoirrekkarowaixoyxxgifgcckacfwfyceniefggkfsatnyepsngosxoirfecxrpccoryerineyxsorwawcyycceignwfwokxnrraypoiofkyntsfksfrisycisepsxinftfiryxafnoognsfkiepoxwpsycfnwkwkxnygxikitigyrwxsaswopxxogseegpyxcittiypwasioieknrxintcytpxirgytwgxxeisotitraoorpitcinktixwtcsknenaintrfarnfkgcrccfcasxiifiokscwxrwyptrssawcrotnatikrnossonnrfwayxgxrgwxwiwfwgragoeyesgwnxgssfsynekcpiexgskpwpriygotooesrgsfsttrikconwrsecsftitkcapwwweifswapwycprnfexgfkopepragotgfyritecoaikiigynftnyoaxeginkxkppwayrynoxiantiigengpxpaiisywygrkpsatexfyxxpckctpkysexkntennrrkgfewwespgkotaeerpxitygcaggpkwanggckgpancwxwxitcxwgxwexkintsrcynysxiyfkiisitfpycynpeefcwnafnegiokotwxsiiiywixspgwnaysfskkatwxigtrssacetocrkotstpkwknoaxeakgxygsfpipwpnstrsxkypnctrtprtpanewogcrsiioggregyfnwkkrrxwfkakwarikwwwckwsnkiscwaaaacakktkrtryoepwytrncfcnkcprpowgptaprgkiewpitnitoktypeepineopknxfegckgwsposroxwcerckpfyeioxgckwxwftkrnancxexwncwtosscnocieaxeoyinxorntyppwxypecxkarwewwkininswxecgottfscenwyxawkaetysiyekkxxtgoisfwwptearsctsakgsyfxtawgnytfiwyxkwksxokifrppcespkkxtkwnsnfxkkoewccfoskkateifxntgcnwontwrpaioakefwyifckfciiktgwritececwaxroyneiwyoortyotpyereekgtooprfaxptsxitniegsggkwanprfopcrpgoicxkrrxnceytpraoerggesfsasnytwaeikcxccaxptrerptyixswyiwnewxxrntnppsogyfygiwskxpcsaropkowowwainpiesyigeirgtokypiwkcckywfxesggtwkxyrrfatoaocsfgsefiacicrxoangsyrfccoxgpwsycinfkfafpwpoywpweetfywaykirnwfypwksifcwwcoptrnitpstxskxnayxwxafxxknpwisetecfcnckgegtfitpxorisfntfityfapcwpesgwwpfnisnsriayyygtsiwconkanscarkgppnnsxwnnpsngtsrtyortwegnkxrgtgytkyywyagpntencptcgitisyyiitnkifngeerwonwekncpyrrwpwetaykoggonkitgyxssryeaitgpgwgyxxtexarefkwkaptpwiyogrgiissneesogrskggpeefngeapirkofkneagingorxnpcxoerioeriywoekoeitaktegpnxnfwtyciopewiesnpyfnyknkffnergntnwyonitaknweofkwcraowintpxsiniagytxaotcafxrecftoowakefciwccftiecggxfafagxxpyagtntocatekfytpxkkyeofcfxrrtnirokikrytikwcgkyafknnknrskaecwoyiwxckrcaospiawtxtapxpocrswowospiwfyfoowytfneaansaypssgyofkwxagxpwswtpcwwoxekaxkktaixtrcifexioknskinrsgcpwspaaipycfwoyrnatateafgskexyxerfprwcananxpeocgcpwaiiprkrycarapksxswncftwfcexgpackfsycstnceysfsnetyogertcasyrnofknowyrnkfrirfkntncicnfrafkopwrcsrcysiftgttsecpwkrywicgipggkxkwgkwfokewtngkeiiwxfsinkakrkfrnaicekwwfwgnnxrotiycpisfgfkornaorxsirrtacawcspxfpcaixtorfterfttyaokpteprcywsrocinrkpwkgpgcitniixnyowpygwfseiftcaoygwniyanfwyifwiccaeyawoofxakfagsynesonywctcxifgwaynaiitxnasgaxyawanpyxnisciasotttftsxsonnoksapfokawcrfnyewowkrttfxccsytffnewgfyetkefrnysgxsggsgynancweoatswrwsfxwfoaxoyrfkyknrginnwsfetackparcattixnkonrygfcyowtfifyxcpefokctkgwkxgpekowkponrfxktppwtxxkayetcpcywwsgfecfrftnrwneafakyrstrwycsrkgyecrowfrrgcexioacfnpkgaiactcppgtyxorcktgkskkkteayrxkctxaesprtkriraagxwxaxotieagfoniwcegwctkxeeoceonpaeoyftcxffxoxrwyikewtegwwtxyikyokkrygkneogayafiswppxfyeitgtykrncaoieckwycgsoxfwcprnekeaoasfeeiygyoonstfnycxgppkeppxpktyinaenskoeckfyaprpcwpeaixtxnwcetwtffpxaxcrofkoetcknotefoncneitretxfgpncsrtfwegaiotcaogeaaaitgpxxtpofcexyfofniesgywyntpwyrrkgtoyasyaccaoptykxceernoesoaigfxtswpspsawwpaxpkyxfkigkyxpytppawtkaiwiosrxnpeaaarsnergonwgapgpcnggfkfrwsyfaenxwsaspncyayngaxekpekngysspsxwnfxpaiyargrnyosnwseyotfxfakpstnsttnapappopksgcryraggtnrpcpfffwswyxefpswkingsyretgxpinesowsercxofcoaexksnawgnafitwgyeoxksniftiaaxaryxregwrskaowecgeotyptfanksacfwxgckwwnnccsikkrrpofetitykctkcfyaskkripginaekrasntncgaekasggwokknictrgksnsnsggsnpxxafrxsgxyxckonfxginpewxwkkwiiwxxwexrspwaescpsefiyaagyppxwgftaxotgkianeraxpwfxonrfwiktyowtgkpsokogwowikswcrigcnyxywkxpysrgkgtnwpftknaefcrwxrrgctyfygtnrfigryketattafpassgcfsnokwyyfxaixyywckkxksfgxspxwpwxsortgexfpgsfwynwpptrproiwaxtpsgficfawsraekscngwkioonnwtxyarrycpacnfiapiitieyrtcnegsfyixyfwtpattiyoopwsxepaaxopgactgaecxopkiossxeakgxiciopnfwargefafwxctrcsfnaxxofcngksskrrwteaftncorikpftwokyktkonyperytxrwtypcxxwgokxgkprgkpeptarxyptcrgkftkntokkikeswaogikwefrppfipgcatxatnpkscsxgnwgfpswksktciixsgyyynefteaxixwtenerwwwskgygagtycpxtkgftwosipxsccctxcftynkspnganooenifaswoppgygsakratsnpofwwnnaiyerawgpcxewtnfswygtaaixrpseyxttpkinotnxtakgwfpwgxwfyseecrtsyxfigxfnxgwayciatnetexawtaccxtopwkwriktteiixnfwargtniwxtntewcxxsrnostwxigwaoiiagkopxyxiaackksaxciykopksfixtxrnxtaiocaxnnowsrsfotxaketxegfnsciriporpckxffxffsciwskrpoknfraotanwnrynwwfyrfeawowotxssxrkaygteysxafygwfikarniircasiiyiiotpgfifietfponssraeiyifonpyocenxepfgiwwtkakrkociryfrtgppooekaecppttytfankrriooyeniirwcotkxkxicfntikfnnrfesxrxikcacnfewxecprawxxntgaenrwcreeppegekgrntkwpnsywppcpnpssrroeyynfntsiottirxgfrfffretxyikxepsiaetnrgssksyxtggypeogyrygfnctxnnrwscicsefaaeaepsxgnwaoaswfytfxerekskwwaewktiwtssytcfikgypaxniftkttctatgrppwpgstfcafoionskpefetgsoxxctairooiwkxsgnarxyxnakxwyoprnktanfoifoffcciptxtoifoktoyysprytnnpxiifgtsoincgwogtscngctwkogaeppwogakywcxernaxkgpkerpyxenggprfxxawskrrxoxfyegkoerkowapgswocpoetkypekgfoerrgkwwcenwartcekyexerycysspacrrxfopipcficrncsnofxftkcsysefcifygwnsyxrgwrnwyfyskfopritikpkcpgpfkwoiieyiacpknynxtiakowswgpkkcwfiaakisyoirrnkyifysofrkaxgstfapacifiyscnifwkctnkgxeyefgwkprcsccxgfxwioopnxogooaaptcnxffgetcoaprksaeknsxkwptgsspienoekpekewacckfoksweigitncnkrfeiycoysiccktotyrtgigcayfwwkosskesxcpaxsncnyrorogkspswckpgoptnexniekaaaoaaotkarxgascccfpitxaatsefyaaipfcyaewccwasrkwgxoongwsconeipoyoppkganeprcyogtwkfygywnrcwgxtfrcpecoacktasopsysenaosxisxyrgnsxnooftkeeypigcagpisiigyfxrksaktypxfkwparfftoitfggpoefeyxneeiwswrgyeexokogaeryrfpaorwoetycifxfcssysktopptiowpcrxisaynkginrenicriesaxistonnssnstkonfpxwprigraroisynarsiefopnxgxarafangsaspxsxwkfwffrraorrysxkxpksyynroepofonyywetwyyyffgxwxycntyngtparcgegfwiytgkwtwnikcwcarcxnraypissoeosxxywgpwfpkgicyprfaifrnickssroeropowpfycakrkfiaesnyxnknnpfsxnagpsgwygsoafgnsycgkcrprprpgnakkeaofiatkwsettcyipipnxxxspkwxsxretoyritkcggagtycfeccgcetansfgktpegpnwsopapgyocwwipksxrkirfotnkrfkrefwngngwwcpwtftxfnfrronxwkixpkyxfaorcytyxiiyrgneoiiyyipnrfasogtctaafweoyosxopykfkkfsgwyxyfnxntwcwciesxowpfgkogpfspwxpxrgwgsokyecniinoitrfxisogccpxgkyrooforokstxptefkkiiisfnnwtxyknigcsrcxkxierpggsifeexarwonctpxakrrcerokxsiftfkyawcnfiesfanyccitcictwoncfxkxesctcsanpswykxooppgrpnncwixxfnkgwegtyaxceyaigeprkxsrwxxacawwakngtkywprwkacswytpnnerwwtirprgxrtoxypfcyttgfcynnwsytgeepatwicgcyopenryneftwpasgrgtakgepcsfskntncrscepfaacsagwyfrcxtgerfktsgsstyxewpenyrsgsxfosgkgaekyrxnffkgwirpaytkfgneysikeaoxxeetrftiasfcxikyicrywakkysnxpwwfxgtnfgtxfgrftxieafcsiknkktfpyeifgnciswygwtsppakaekfttfseewrpfyyacraoaygkwinfipptppyecocrixrwkitrfwpagosgfytcxsyfntksgkpxyyikkfrytawsnrgyaowgkinnsakpitfyxcrfipscsgrsngykfenstnckigcsisatgfrgenxycoeyknwpttskaewfkokcfcyiaifpxxgpttgnfcwoskrifgsswtisyaasfnnenwsaxacgxgygaafpfytarcyrpnftsriaygifnininagttskcffycwifwckprrwxeifeeiroryfraxkgwaxgxkrcgoxcgyaaorsawrygfiyfakctwsetnkapywxsssfwftscgigpcpfywiwxeixkwtitycknwtngcwfgokrpetytiporrweeypsofekktgrkgtfpowafotftsggaofyawscyseynoeyctrtagsknfsaxtkccpofcngncnayrynfnniwrwyticpiepwwtysafxfxtowoyfcnnnykkepfxggeofsrcotkocoiewnrnfetesnngfprcsxncpyncksfaagtekafaypckfxcgaacxkkittpgspoppskfwgniwnnniaffnpwpkktsprrcyygnifxrcitystrtxaiwtyaanrappiaywrxwfnteasacswgeeinyfcrofefastwwipktfncrpietxrgoyykrtypapxgxyycsowwekfsetgeyfgsyntgworypryfiiyrrigecsttsrkarspnipxyokcscgfcgwsrptaipecggewwwgsrtkgrskgxrptttofanxakosecwgoopapfftxenofkfprktintnrikanyikaocwxgerwtpswxiwesyggoykawfagpyantopysoeoyxngkrkkcigkinkaryogyypnfxwcxgrxkcswrkagsrtpxkkrsrpnckffacpkwkewceoprortpwwyfskycecsyfxoafxwoxrncewknyixtxkoinnxrpeerkonigskawfsiarkaxasfwneepnnoxtscyfcxecegetrwtyoierexsaytcosrcwkgyxisyxagwiepkwwkwkfwnexfyppafngfgpgtrgacxxipyffgxcycctyifscsepgyaitegeepkoexkctwiwgorxegxwfrafknfcytsonxgernsnnfepggapoyyyywwirsswtrcnxyotsgxkikkixiisankckgnaasrpftixnweknkawigacfpokrrgfnaafpoyiifnwekfcwsatkyaxeerpnrokeanxgcrecxogatrsxixfskksryriikepogteektynwngaynkogrfcpfoxaookxetotaxcngtncgsewrewkisrpkiskggrfoaepeefiereoyskogwtwxsigyffaxpygifkrexnykokgpgwygpkoifetycixnincongyaewickkgcgkeripnrgccgycaxrcrcswotyknegypnwcckenrxwfcawnkfnwacaakngakpfecsxxwpxyeaxnxetocnttckiwoacwckcaxxnxiesexanwnssfaoptaerixnnwopaoyxpypcoxxxpitrrogoyyriynowixsfasixfgrkiifsfaxxposkwgawgfncsesfynysirkefktkiwsrpcnfftftrprfponryxtkyeygcepyytispinxckecapcfyaykyyyaewgtynrkewtfpfsnoextkgtexsfpyriowrkrwnytwcxcptgxnaixwptxiogeaaayargytcpaanwirycfxapifoypgncccayfssxrsknesyoyssenxfpfreoftornerekxygsrgpfyryatfnpioiockgrttyffxpnrikepwacskfnxgapiyxepgiagccigwinxxiaparxyiegyaxowpffctpggpywkiigsoafpxppskynckagxggrpxektgpsoppayinxpiwfarncfknynecncsanwayarkcrtgrxpngrwysckacoofsrpecikyeswwxeckrirfaaentnoiaacicgefnenacwayypxpkcrragycpgsgfkerfgsycxcftgfsgxgyxitrgnixekxwrrtccrgianfpgekewcenfxwiwnetoyecktxrtnxieywcnkreseocfxxrpkpwrxixktoiernypiysnawwwekxafarrfnaogpkrsrfifcfgppnfccefawwryefyyxkeywoeoifietegttitokcxtsxyeinpotxoceixfoianksnwnkairstkfccrninagnsrktytfrofcxytrpcoyyyyenyprxpkfgrostggnctittspkyxegwkipypxwaysseiwcoxrepwwngtgpkocpierppyrcwpwrfwokwsxkiptekaxiawnyocxciesggoxfkcptwwceeecxepkrtygigiyegcfokswfscacnfenentroktkrwkstxyritctcestewxoswafgowkpncssoycwrwsogkanxnttiexptxookgfgwgowxxnosrgwnainwakortieypkyaeypniwfcfxxagiincrecpnksttikfsnkktpigsrayixpwyxfoykryckoffecspeoarfncaftctpkgcstkgikgepearracyyncnnxwxyfpgwopspcprxnktxofesgiwyeniipniwnnttxwwrefaetoyirwrntofcpgfwoafwntgioyotyfkyinpxotewppeitocaskragktokyrcortnfitreerxpopstcywfspitnikpwipxkfpgcnopxfpxkofncxgyxatcywxarpeaprkrssotctwncyxynwkyyaietkasigxxectgfkstpiwgsysgftefyncaaatrxotoeowfrrynoxkkgnrgktottnxprpfxigwynaokykkyxortrntcxsopoaxyrfgksoyefnxwesyfpeokyayrwserfacccwyexigciywofnsfstageaiaftnyspiaxngfcrswwonnftoafkekfpxcxtkpertrcefncnigtasscpooccyweroyawynnficrtwaytaocprfwyrwitkoagipoxfpriagrocwtrxpteeyntyyannotkgykycytxxgafaynaxiwtiaaeitcffskaieraprtaxytxogcxaxiieinaxkoxofyeociesorsanxrsxogiffyrxtnrtiroyitxtkgntkwgskkowxetgnpssyinxpkeyrykfwkxfaortieyyepiccfntctnwffngxranspyypsforyckioasexwecsonfykwywwkysrxakxcktwciaxcppxtyfwxrtyryotfpxaeirtknpfagyxfkgorsefekpeswtwspeaspisoykffcnaepywwkrtcpnyapoayyirnspwkwgxstngtfstfyrnwegnrftiatpxosicyccfnkysffnkxkfgieepotpwwywtwprnktyenxagkpfpxsffpnaisfwnnocininaowxssgpykiyncytirfyscorftoiogatsngtxgorteotypcwpkiwtttyexxrikppoccstcsftrcpeicnyyxtnswwetrywtcxnpgrgetixxakxiyoniwttxweiktgynktotxpnnsxexifipteekestktarwgrsirettxpfcoaoscckengygwsieoneafacotaeniorygscgfxeyayxxxrpefityoicytnracpscwwspswnaocygksnkttorfttsskiggpkoioorpsnkwtfngsaxfskeiecrnweiwptetsooxpcacypkotfsoekktpaxetcctrtcanpepokxfsccewattcpkrarktfeseskgfrworngagxtofxncxpxeynxeffkaxtrtgkfscnwkerosryosxpispxtfpsseaxpngrtpykacyxnsncgpwcyyrkgowsfaoaenckkgfkxarsonrfrspcracxkcygxrneiswsftwkifgytygircgroxxkfxairasgegnoeywnnsstcggngtwspneyraxxpfkkpcywgygnfkccpirrprigswsosktyreopsckrnsaorkiyfenwoxskayscnanowwytnnsawfgprsogaspaciyynxerwxarfgwaxaxwinwrifoexaefiaccaoxfwcogsocfxxyfyowtranoyecneacssycwnoxkiosnpayetiexrcgnfansrgaxpernsfeccgtsxkwosxyafkaworfyttwppcpcreigatfywapntgcenyptacgfppotswxtfkkyacagnyfxyiriiwcfrgwoarenairkkxiefefosetwifooxynfkfswcyprnptcgrewpywwppeiwwwsaitrgxaetoykapgttrwcaotfcgoingpxwayriisnckfrskfoxynwrxeoggswfnregyyeoptwcnkkoyogroyckayxcotwekekkeyewpffsxnrogfaaiixgxcgoatkfcarcptsgicpyoknrigtckrfiorrpwrkkoixngotxxiawkftxfsottwyoypcgwnastyfngcirfykkpxpitpicixiwexoreccftaneorkogywpaoywewecgwegcryrsrrwontkaaaockgksatoinysksowttkipctpaieiwiessftxskekfowywkkpggwprkknionxwotaakfyyraixxrwnatnoeioarpokeweepxneassnwnnisoinpsnonwcrtfrfefytopacyfcfxispykorycrgckgptkawprnpkttsitegwtcooiicgaywfxetrcneiapsenrecgwostpgogtwnokernrengagonkctrrigwecnfgtxfxwonyfnatxeatfcxtsgkwgwkcyafcarereoysaspowsgrwckwrsrcasarapsacwcariyorifyceasgkwotakoncrxkysexicancnoaktapogwneixffrcstftagfingcrotosetksitcekgwwxgnwtxxgxngstrcyxgayapcaixipcwinxgtrokokcowgxiexnsckstsarxefpsxseeprcgffonxxsneniasyeikpfwoxwanrrxxtkoxrfinskyfsnftriicwapitwsaekotcnfpsecprtwipxikogsttcgstrtpikceoiggnksfsxekcoiooanognxpxegffsoaaxsatwgiywtofnferopgnciyfnewrgwktgottpragowryryixtcagysxrokntcaipntonryetagtkcpyitatscyifkacnfetpikgsxfwkfexnweewpiowoegxactxoessakcrngaffkcewpxoecipfestkokxeaeynwxfggteyagocxckneeyecstoiepcteirpskieafnanopewioraykxfxkowwfnrxrtofsxtktksekgcnkowrwpfeceowrarpiiksioaswfxkngwsatsypfspoegkinekwigwfctfrkegteecknpxpssesoargtfierepiocwfynwiyxroonnxcgwrgwnoatnekaytwxppysafpfinykskiirknpayewsypyakcfosiawieceetgofoyrxakesekcocxsieaopciisrkcpafaipateyfytcopwawapeksffrniygewpffrorafgciawegyitaacgcrsyfgfrktpeygitkyaxnpogcwatptwrotripniotoaekeckyoetekcxanctwtopesyspxixiatengrppxrronpcewpttacyxnrcgpgwyiyeerfgnyoontxtiynwgpoxtxtoppagtiofoipnkwwnekeysxswnkwitefxowsfsengogwennokkggrfpixgnciyecieiistswienakswpiikixxakystftgykwkctsacpkkxcccyagwwfrrgwctkftsnaggeefiesnircirxxgcoaxpgreofeiitcttnkfwafpxrxegpegxnsrraxgxixiawogxaosorescxrkcatgkriyxonkxtpxxritswptgckxxkgfagtgncttftnpokfyygpgeyoiffcakftoeffigwecswwswirocrewfgikgeffngfkiyakrwkxirrxtoapktekyyaanwrkfpossnfnscpgeftciygfwrpyiwpewioprfspfttoirpecpiipskikiipiyctiotwratyxwtrskoocsipkskyetoeyknxyokaietwrrcsrnikiprtxyicyyctfcsosgngrorgpfxxgwcwrfkccnetyxanecxsrwxppfkfroaankstepoiwgwycricsgykrcswfcarwrpekgefttarggnrkcctxtxpwexengppfonixkpeosxyipxxwifntosifyonitacsewoctwrkkfgafgpkksegpkprpntwniaiootwkarnxxpiaowcerwkwaigxxeanoocsryiiaereyyiespxsypekopaarowspparcfkoaeyekiyotxxariofyixxtxgfpcciyneywskxgsfessaescpifrypigiynegwgtnsptanocccoagyexgrkneygrcagspaxaosfitseorgfwspaspgntnerckixtcayieyskrtfywswefygnpekrxciokxnkswkrnncarrpkrkiaxcxifiganwnacsxonigyifkewfkweksktayensyxfgyniwgeirniygpteppifpagsskaikpgcowygfngkscseprxpsfwycerwefxwieeeoenwwpyooccaeppfpeikxfpciktaoopgiwyaspcxconnansxgowkxeaniyrwawopwxoxxnwingxrcfntrgkcfayyaypgtayaeiakigaypniknwrtwnykttnrpioktcypfepoaysrnatweikywaoipkknwcneackickfgaoyoeafwatpfoxcxsxxkwgnopykeratsfyspoispfckragsecgxortnoksyfacktsiasscfxrgrfgyiaspntfsneniyifnannptarfsxiinygcyoptncpcnntwopcgrtoscnktfniistcprstwarrtnkkgpatnittsxcxrttofptpngnewegoxoygpepeaaiirfteygrayxyxsyxwrscekpfktggkaspekcrerwftptfakrywkwaogrctxweikkogcnrxtniwecrwnksaancsptpnxyececarsiwnfafepaenxcaoppirfwsktrgogwffesctcrrsxkxwswagafrigynpotowwpaeorowigtocisyypsggkettcxaenywskogtacraynpfssxpkypoctapgytsrnraepsyytgapxyfrwppexepgpawnrteieetyikynrrngxpcecaaynypyotnraanpaowtsixkrtgypnwcnfttranfpgnwaosgypipsosxtsnrwropaeyrnkfytpwariwocnfnkakxaickwacpsxonyywfcprgxiwiicngstakntceksoeokoicwkapkwotsspsneertonaanxrsxenrxgwawgfaktigokgpfcfaxasyfrnxcspspegkecyikcocesyorynpecosknakftwotcgcknxntiifsotfnxgkirofygeefkfcgyyangxiorwpfxsrswtnktrnxcyeenskfygfnrcaryygostwgtywikxnfxinxcknoxgskonkeisetcawgtskeoggytnypffifxwnexxpcscixakpstegxewwcretexeygxcnwtookcctxkycntfkngoepoowragitxaskfgfcntowipirtywayignknfysnorxogweesfwcnptkkftgnkegctiewfxwnxysaepeysgasgsifewgkrxksnfksirieoaockoiypsrfxfktoxxpwcpcofiwkwappcynoarswexaiercgaecxwygyewfgpttaeaaoacgnrtasrafkccwxcofwccxcwstwgtxnospocgiysocxfrtswexccxwtrtockeafpnrypkxcfeswiwcneyisckakxaaroekxcinteftegxccnrpcyxosenowsiirrwcoeicarrwcwwgwrekrgaoeeggfawkawcaysnkpfsfxxxfxtfnacfgyfrfnxofwaafiwtoptnwpncxiyytinptegsorfgtyfprpnfnaiwsepniffkiogcaskiascfcokwisotctxwxrfypnkkfprtcsnswpngforrisfooyoniaippercippoxcprxnkncwxepriisoetagaiiexksnynnwsgfetttpeienaisntrynfgwpekifxowywnwtsgesncxefokwnffoxgeknygwisxoakrfexifsoytxtxocnsncnfptfnkictnfxtrergcapgfcfertgngtwafccxwtpntkcfxpoykigwpwtefotnaagpfkpretfwnpwwcppncspsxcnycfxtptxypstpigyapwitectreapwawgokyricarcicpwngxyackycecrpkffccgwcsceowoynnaikwyryiekxronntnwaxkxencfteppawcegxecfpncrseysfkswfrtpftpyytaygwecnnixxocggxgipxxoacinaefagcfisensoyixfeitktikaciekptswccycoeaeeagepcionweytetnxcrfgxirsfwnewepwxsfirfwirncytpykaapetkoyroiwirccycwfxkfysrsgctkngiocnwiwiesspooaigagyaoeasxsfkxftnxfxrfkgsrtpwapakrntaxaproieinroowneweonccxiopwxkwtkninkosatsyrpngwckaiykafxpcrcgoftfsrogkxfooixifiwkywrpnrfareocswxkekxxrxkrarncraitxxsrkfgxfgftnotypwokicifrpgsrwpowryrxycctaeisnkycwnwpicefeifetrstanoxwssknktnnwgoppeitonwkspexnftaggkwctaoxespaaaxaipitengixreaetsixnyferfrkoxyeoxtkkcwgctgcsoiotyskafcygorotirsansksyptsykeganfwxgwcrtexoyoryepptygoxerksweiriiwoeerffspconyrkxernawcnxceoyynywxsgisyksgkiftokpsffrsioptfnsakisapsniticygkyeofsgkffctkrnysirnoaccinntcwsttoassexforyiacfifxtskrffgicxpynykynyaaorcyiakyygyinacsiancgewoftgiikegetxegwoesyyrropfnkytxpxkygnptyyytoagswktnffwgftapnrgccrstiwtsrpynxkgryctgetxoytgtfrswtfnocoteoykexaecfofcspxfxoxyoxcarooinnseocfwpxycpsyxxstnycxeongtprafnsorrynoxappesessaofeiikefkasnxaeegrxragwnepwnspfrfnnkcrkgktycexnxweicaykepcrysniosfyfgwipgcinwtkyifxgktrcyepfcicreoptwewecwxrxryfsspgeooiessfwgocniiewkaasepoipftytkyigatgtyayeotsrggfsxegakfeoapekknxceogiipncfswngeyaiotiirknprfnoswxypfnxxkaoxtwntcinecfnxyksyecttetkwycoasaoisswfprfciprwainpyfepxpnkrfixkyecncgkoapgnnapkixnswseaneffwgonyiceaxiwkrsnxpceiypiaknoiogsakxyygkskraotgkktfkiisywsfokgoraspawatxeionrfpkffakxkarfxekseefgxyycaysnwpserprxfyfwnapopgakckckpnrscttstssaceenratfortrwnknaifnwectefcwgaogokxxrgeypxfspxoxyxripxifggswgnaxygygerfcswyswkntyciewwiaiapttciyntgoeecptkyopaeayxgwpxcgnksotwkkyywrstsoxpfgwwpryknnxepwpkcfisffnsrssoewcktxrtwryoxysoxwtcswkswnaetrgngofxonyxtcagrgayxfyirgywfaogenkofpkypwwcoxcrrpwrsacgwraeiacyteytxaptxeenccesxsfkifiwixrpfnrirscckxteoiayirfkntcirsocaatexfgiwfsppeaeikkrkrisfrnktstyaakxikxyfpwfpwgwnkgkfanrgoipraakgypsoyogyxoyiwoewgsittpgrftxgtgpttfsnxeexarxxgteoarkcxsofwsksxoipnkxfgtsecixecasnrcrfnxkcieawkwtpccerynypaoefgiypfayckaxfscttgewyoipycetiwgnaxrwcronssfcpypropnooxceyrwgkpoxrxyitynceknxgepsygtwifgwsopkregoygioteawgoriefcxfiewnicrgwgefrogcasiagatfaxkiecfftonwkirpoapacgeyfctofowxxeewyrryrxsnietsptpeipfrsnwgepakenoossgoxgrkenaocpgnokkcrxpixeirwsooigatosepwgnexkrcpssfagxrogwrwaetwixwpeianpaoefpyopefssyfcwnkiingfyysypesynrrtafekytxwfpaoyfxeskaoccgtarsiwopwwnoewnkirwexpcfkaycsskryotxrsnggsiftfipfetocsegykektwwtpanntcpscpxegckroriefkicytaysonrpoxfwawxgnakrookfepcfprrkeowpseixaxfwnfxwkwwynwygskfcgcaepryikasspporktrwgipexgfsgxrxnseiakiypaywexckxkeffkpfxwipwaipfkaxnwynifxkswxawfkyfewfkpetktiekisxxxwxpnpiikaoieneeokckntkyfopeicfkpafixcrxrkxkgfseofwxnenpgaynogyxxnkpoiiooafxotrefgnxpgwfytfftgckxenkfineaxkyxeyenpynwerwgwiofyrxoensceywfcnokfrekfkogwwogeiiwnontiioaswnynnpactfacscwgkfxrgroswyrwcwfacekegewsggffxfpnkxeocoksopfrssnctwneagteeicpawkktpaptxknrekrgcxxwpfirxwgnnpgaykeoioyitpacsfysynoggpwfacfcosfxporraspwewiyiroaiexeapprrkxerokrstxftonecgkfytiggyaitfpywxirwxwikfxcpapkowgxrokiryyypnxeoppnyypwptskicapnpwxgxtircrykknfsipsespggngeewspxkfiyxkfcickeygfngiiiawrogpfyfrowkierpgacsgeaeicriwioaiwgfrstfwiiogkkxnrogfiwyswkoetsreynioprxicityycwxfpyyysngorwfoyxfygpewofcrxfkywkprctnxppeaniasfwowoyookecextpiproaessgniintypinicriorpgskonnoeiosfrwtaitstosxgtoygrfpaeyxtogggeafitcpegtkaxrarakawnagwcwsycgtwyeyiinerfniessxkiwniwyscaitafkattyygnanpetoecxposycrrcxsyneywracpkgaaroxctaayfyaasaxagxsyfstyawwnntsfnkpckttireykceayrrcyrpoppkyiepgwkarcrtnfgcgtepaifewyssetgsnfostaonecoaaratyetiygwkaynerkcwicoacrspacapnpxgcocgtsrnpattaparraerixcogefiwayopyconrpgpatsiiegiykonppfyfakaaconkraaerwxckynokskxirotgrygntenkgswxwncxerfrkpgtwwwxcnoaxkioienwwiitwwpggtgpeoogtswcsftywfngfcynektgecrtegkeeigynytxrypcpnprixaffwgnsfektfoikcpsxptkwowgeasrspocarwfpgfeeorexskrcpwoiarrkawikepcrxirrftcifwrsgstcawgciyennapipffyoxtaaweggattroywwxrcrwtgffooygoeonnrsnkysfocyxiiaysiteowkkcyfxyaxawpioskpkxretwrpckwwanfyrisiaorrpwstefrwpxofeorpesrtkogxwfrirgcwfneeiwrowprfagnygrspisefcsxgtcgkwtwnypkocxackfaskgagsawyiwncncginrtpeoxyixrwigkwporxrofcrpftrgysefarwpftrnpntooksknkcekpxagkionkwnopatgyystatwkixxptcxinfcpwoysonggktccpgpfnfiarccaaotatotefgoscftgeyorppcytfykigxrfowonxcaoofoyxxpsseayygxysspnoipgaasofcergacgrrefaxesgcecsroytktfcisapsospakykcyrttaxrorcgsfwaefaptowyyerienaecaxcwrkcpnyixrcgoytrkackxcnrkioxtkcxacininsxfxtpoxkfeistkfenwyiseaefigsxstiysxwxeexiaktfprtwkipocxcatfkiskxpirgfnrgxcfeskkgscngisaykkxotifircfcoknpafwyexiraxkgfynsgckagpisiynixyotroferapyywascweiryrxtosxnaoxfewwwyitctcciynoykcwparfgciacfkyraktnpftrewegfsswogfaenxtifagoyiaofrrgwceexesprgsitoynyygekyyyienrikiegxswfyrekgrwoskxgkwrwsfpngwksapenagetsctxrpxotinigktokxiixgwiogikpwcpicpfkorttwffnyonyefywtxgyoreokrswppfpoairwctcpyskxfkefpnggarwaxafpraenackiceefaftekpxsxwnprxortroexpcnsfakfgowsyayroafxpoiixrggpsegxknyopyofinayegegptooorfrexnststacoxeyaxwoeagecssngttknffapfettkxfpoygpngctrwckkytwrgewioggrwpkfosrscorfncnxrxggynkfawrppyyttinexpspopgannfttppgtpykciaanarnaacfcxtcepkaefxicenniapfitxpcnkwoognapxfcnaerirnsrxsrxfrxcigniewgyxtspaagffkxxkgpytesewttifcpoxnggcgecektxxwywettffsownowkrcnerspntyixinnkckseywekenewexfkpfeenrcoysienfnwtcgwspwkpgogwxwgcnppgfxorrctrosfyxpxpytipgrcopscawtkckakxsrtwogkswskkyaeckoifxwsoktoyfierxxfceaoyyogfroxcrfxywggocoetsywxgyyikcosfepcyfnpcrxskyscxacrwwirstepikkarofyxgyrrwgnrxccwgnopytyiitwwafwesgwnoifiwcfoegryifnaketcsscawxewpstscpgeofaarksfciiacicawckxynyrgospxtweattekkgprwgsanycswsiixgpstrcywxgisrykikeatfcfnggiyanyfesykpfgtooicnkrcatccfasieptokfxnoxxkpaxprxetgnftepyterkcoaykspcpkgrtoktiinsxeeaitopwexktnrxscropwweoonxyneakaocwyryietsixkpkngfosnnspfgneycgyonfrweffgfttgcoxpfiegngpoywixypweakwfanfnaegigaipnaefggroxeaapgtkxposseggcifnixteyppgwpsecgggyisicptkfeksknstcefksapofitkpkaretsxnoofkpntansgptrgtkcxgnxigigearrcegtckkpoxkfwxwetcrckeyyxgeawsxrxcaoferrxaffpygryrwratxecoxipeorkgpwkrfwxkxtnwcesnwrwffgxcocpkoroscrtyfypcnwnkiseptfsixkkwckrkysgnnygyrewyxkptyfgypitgypoxngwettrnstxtkitegoxxytypgxaantgftpfrywsswerkpokrocitikinxaingyrwynsxoxkgxapsespirfxncyirirwsofsscwkyoascwkrwcyniswrxgpycstnrfnitasetxerergwskfyppaocwfgtanfnfsrfxecirggniseiencckrnatwesepeyryrwrcertkoayrrtgswxcwrtensyfgfgngftgoktipkxncgxtagyspxgweykeokgronywnsrgtxawaawriigftioywtfyfsegwikgyfgpyckcoxpyrawpoxooogfsnesgfwcpywsgexcgoyaryirwtpikgkogftcroactnrwkkiyiaegsiityonwsyeawnoekxwixnotxpkegangfsyeatkekspwfgncpggwxypotwercpyaacfwypognopynonscriptatyaeoiwropgnestxtcygggrireaccropcfskoinfgxxxrxnsfstcrxssyiknnyfspftsepygeyyiwicatcaxptrokgcynosgfyfancixftitsapxngssfyoxayfkckekynakkxraiiegeayggesonigtsnswknoawtgsyxwrrsksgggefwekiaxerspigwsexwxcefxtcwyfatnpigygxykcrsxwwnwwcrxnatwnssyskonnpneeaftntnpickwakggworsrkkigkonxyntcwrckcarxxotswpcgrtnigwctcwgwofsyikgwoicnkyoxnsfskecoiafikkaiescxkkiwckyaorfrfpwewtpgnytxigriyywxesiiwffpgrtwcgtpxraotrsoyietyaawoffiswweswfrcsecpwigeeacesowawpwoaywsfwttipxgxwpxgootkssaiwigkowfcpwwifknewrowacxyrinkwiofakrswwnkekefacteyyaoopoyprifiaskcyetowkaonoxfstnytpaketennitfrnwcatrrxaxwaciwkkaxeigssrrftncoixoxppgeyfacewotcrwsyegkgfnxrseeaanrsosaacketrnetoxkieaowknkaeyftsriipwiepcexrfxocgyfipynftwxsprocewnwtafsaaotsaffxnppxwariegkyofcxgefncioftraypyattoaycstekffcsasypgsxooxrninyotoxcypwtiognrfaityftyieirykyoatwopifxiktyxpnpisipxtwecepwskkfsioiiafietfrxfiapetknpwxaxfaartnorpesyeieyaipeeayipfrrscckffaeyfnscyteytgwgcxgtooitaoanwgsrkrycnppywkrstpowtwsiofaixyreertkrxacfwfgsskgiyywokktaaogtcorxcppxwiyngpxprktioefgriecawrrwrcfsefeixtgtsynfsexfcacooircwkogananoenotnpnrkinfnyawewaansirongsrikpotkxakgifgiapoaisretngsfakyrtenogcwgntftnfwcrreprnytkkgoyiixtorekkyxtriycfynpgkragkceaxrgggirkyoysswaapycetakktksenrwesnygxcktkswccyexysneexeaiywaenntrcageccrarenenegnfgefctfagixooxytoogairctkxwtecfcnkeyngxwkgtowgryrkgoxcarwygcexrxoyfgerctgosennwiprissnnscnrcippwiyfgcytxxfrkiroxgikotrnwcicrxecxxggxgeyeggpinrtosinyctxewpoxrrcefakfsfsoksoxxpniytocrwxrkfatrypoiencneyaipocoktgxprtoskfsgogyfpafrprnatsawoxncoirwteronytsanokcrwpswssaonnoksrwofnxecfawpoofkkenfxwrfiwnrnooeepxnkcwstawftarnisikpaeaxeorxpgxoykowfcrfrypkptwetkirfgcgytksprxttaipkawpsgskennwkraekakpicxxrsexetxtprgwisptswknnynypkytfpfntkryysgiwwaynggoiwoxcnsftnwxpgfnwsnxktkgasaacarsxnyggcsxacywnaawyrosgygpgfgxfxwgotrpxwnxgkisxyrpcgwksgxioitsxxwfesrsctyipkantaysgonaptgnwcokcaopwgwttwgewyxcfgcgkkiocknycopatgaionisyaiiefcrfpyfpxnxaekwkpxoasgnfgcosieyncocrcpotcweoacesgoxsgiyxtegxwtytrgkrsyfaxnincpwcrieyycwpxkxrkcietfpeoeifikkygwxnpngswreirykyefcnpnsekcwnkpiapwktfwiatywccttsccgwayssntsseaeocpffnngtxaxwewaacttgctptrgyyotxprcnpkkccfxkrwffwgetrwwiiynrgosoekkcaxpwypofkewgepiccfcaknnspeyaggnencakgexnfcsfaagtofsoacfexnokwigoxysxewaeaswciraxywoaewtyfkgsynxiikrgoryexygwfknkneritscfpyixptgpwoxpkprptwynrgsiyaaoxtewyerytfkeigkttsckrkxyogspnprroyywiafxkwgewrewsygpopciykogyworsgofsoctppxoirfteiffkkprxsainrspksxaereogkigxiopcxyeiwiwieitaeeiriafokoeonoknrcioonogxiyiskrpgwaicxtawesfpnyapxyoitifrpxtngxfctppyosnxccnxfxpfanaitnfaettiwotnaaiyycxpgkfisffkixakpaeayoiifokookpeetkxspoxyxwgaepreyesaeinixafgrkncyxxksgpyantxipangfaisxtgsroitsxwnnoirpnsocyakeopyfyycyexxioptongkytpokngkttnkfencgowkosioyeeswfororcgtppsneegwycpisyrpnonrkyosapkcfwypwsiegcyyxnnkpisfgowkgcfacinskxnygokwyiroyrtncasigfpcwktyfxxgfexwwewpiwesfpnpfxpyksswyaginftxrsfgoosiippipgosaeierygpwxrfxgaotpneirxcypxocsywnpawcafigcxrncseoropipoxfxcfsytaogpartoeioapfsswxaoonfprekeknxaefgasiifyceccaceoxrkasrynsgeckrriooixeritneyaafyfpofycxtgxiainfrpocorettpoitoeefxxswnrwyetrtcrnctewrxfprkewoonttrwcknipoyfgniaoxakxrrnfygnpcawftkktwaecnwieyeniagifoyxppekppckkeersfaeiwscgkkcyroxwitktrcywyrckyxoykpfkprostfxgptcraccrcyfkgsxecsanornesopkyotkycxtpxxixxcfkgxrroefpgwsfnfickwgskieafwtewpgnkaxpiyfnikcekpocsaxwsnwicyattspkygxyekngyaenkoaypiikcfspnfattoffcrsranaxcwaeiessatogkpxsipsesxcytfgtwewottrgikskxknptrittcgysafpxxpgsoxyxxaskgayieeificrssoctsrcpsrfrogipefpktokgarkpraneoprtagntronoexptncwnyitscxxapgecnirwaftnteenkssoatontkyrfxtnetsopyyxrkysaofkixssrgopfsceoraxkofotgsyyxanksskxgrnnnyriieeafsigpoaekwcwpysxpoicynsknwtafarpnswtxtarfifkpwnpgtixxeonfaxkiwrioeiynypgxgipwotktkikcstrsraksoffkywtgyrcgpnkkfpiykkopfpaareckcgfyfkfkxfyngpxfsxkywkggpxocaikgowkiwxgtsgakitafcsrsrnrgwtextognxyrnwnykkwgcwytpkayfwospycxnysxyeockfcigayporfeepxonkpkcaywtoxcrgrrayrinnpctykfasgeokssxyixxneyrigknegyxxsstprwerfxitwrytfcttknxfngrsxgpeknopxfoopwxoyggnrkkorpkaegprofogokaaeeegoxgrcowcpxwrxiftgkiaettifniwnscxyeifgkspaoaeftgiarwtwyggnrkcsygnxnfenxwyygycowpwfccxotaceyfrawsxkywnrcffnfriwoefyrckfgawkntrkkkfkpgewxxknfcaexanfixgykineaeasokkxkngciwnykicowcpyfkpsexyktgtciroxgitgkakysipxnnrfetgkpsifseynteonicrpenfofckgsepagwifrtpnstowwxknooxwoeyptrrsrakiprwyietgxfngpyeaxtpcoepeoygcffeeygrtrswrfktsygweitrkekcfkaioirsoorxpprtnrineywksyocsnxnwnwtyfififwpkftrwgapppswwsaxckstypkonripsaspgneksaocaxtenpiekysypxttxtpxpykaciwacxtaotekrrktteaaskxikoccacwwyxtoaxtgaktngwftearakytixxwexiaawcaykaoyopsnneweponwpsnsnxxcisartxnfiicackwkepeyyrppgoxnypexigtpsifkwtknrxgeifgekkyfnpcpoxsrtygyrkfotknifaawcyfswwptfsaecwpgtsotpeongcgptwykiwwrgxnenatcsnrtgspxooaigyxfkffxcwgatprnfnfkgrafgtknoowctygfygsfiantgxcrnancxorntaykofxswckrpynneikxtxttgsofpaorwkgsooggikgkggnpktckgotsppgsffsskxknpnwrktypxgtpfipiwtapkpwpxaesnpfopasyakkfpxiopcwpkroissexonwpaiwarfwfccpegeeikxwiyfgapyfogotieggxscggsxooyafatyrkokgoykcpyfaytikfwpxgwxggsppprcexefpywyraspnnxpixyswenatkntfcaknstregfraxnpfxpyaycoaxrgayfpcnytoaktyoenfeffgfsnokfynpgsaxyafskikraocppncsynokkcsfiafengwfscrwicarsxkpoptttkcopwsnosfpfykxowixtxicixanywfepyxnitncsanxktsaifgttxoxcpygygkykeyipwycxaycettnegopfaketxcxntkefaicgagoertfkwriaxyigicsnwonnncscnytpkiiixwfecgrxfsxtsosfkfyygprypwiiweopweckorgtesktgscyregagxawiysrnscwksxfatirsatiyrxtokopixtstkcngcaeppposstpyockwkaoawprpsxrwagtefknkseiokpnwifatxpieprfygkpoykpfcetwcpsnwwkingcxeoeypoiopiowfkyksgcysyppankntfsefxakxiyesrntrgwsewksreywanigkawoypwnnacyoinkkafegstcwgwftwisftncossegpsyennrksetfaeegifsgritkkrtxfpoiaxapxnorgooytowyfeiotintxipyenorkpgstoafsnkkwyeyapepkktngoowkkegrtrraofacxnriicfsockintkpfrnciketneispacgxrrftrsgafyrokptnxwegigtsttsrnkkiynngxntakikpsawegyrfxssnpaetpanikyestocotkorpttktxnfciosoaawgwixygefgtioggctetrfnpsfxgfnptfyryexsipsnkoaxxyxiaingaifkotttgwcrkwnpenfgfocsigaeoagfgkfoygpeowgiakoptrssgnrrnyfriopgftggsrxrpfkrywcteggtrgsskaktkxkoypirsxsgkyppefeaggwngyixcoposftxntksyacayetepntnerkwfpnfpktxikrktinkocyyisaiipxcwkawiccstrayeoaawipsgaianrffirotfppntnfitgfrgnxwpsrriwffiynsporrneftnswcognyriisfntgsoroystwciirkcxsnwaacstxicgtopyogepaiwapxcotcnogrxscioanftsareckeraroiiaxrfapffnewxgktiskgriocgxgaykngpcfennwixgxrrpfirpwscwekncrgnieoytwoeaxwptykxcwiyepacnocsxgnkirfgertksrsgxfarresigpfpgsfxifoyoxgrctxepfaartoxkgnsctirersekknywxtaseynoostcpxriercoiiefipkewgoirpkytxgrptoeseyiwfnpcffkwwropaoxewtxssoyngiwaitofewieyttaoyoprernofnxnkicecerkcwkngsnrwfapgewefooorriasxnkxcokygifssafnwwapnipwpkycnaopppatsrfgxcgeiwrppiwxkcwxtytoxayykoapycyerotrryyfnrcgyeapaiyaaffwifnnwtppotsepifiossrencsonootskfnrgikscnotyreygasosaaackcioaeoneswnfpxoxspreiwgeacckoxxowaxoeokpcwcckktwycsseafwnnxwryrgskrcwwforoaaweygkkefrnyccpcgkignsptrekyaiakyxecganattertwnrswawfwpifcfpyeifxrkassigkpefasepexxfkeggtsicnciixayxspxxyyistsoyrpcofptpkxsoneexwatrgpgxpawacxsscxosneaiatitakswwswggskifspgwfrwrxfwfwakrifyatcexaewwaicwarkerkieoetoswxgniapgexxytgxnygoaxkyfxgrtkrisitygtasyayyorpnakxfrnigycpfrxkswrcrsnxgsrnasttpspwxxgeewegtfrcoctsitnrkrakcpeweopfptkwowxikkspxoptcnrgatfrecwwgoiygitkkynwyfaatcfftweteyeigftsyrtcaoixtgtrprpiftpcowxftiwkkayncycrtiggsrwyftkpcpsignxoywgwonketicpotkocgrpxonroprycsfsrnorsoesyxxxixwraygroxwrnsgywrtwwfoxxfcerpkpeposotrafxnpyysirfptoegoaoknxktsyynpnttxxpiixkyenkrrtftogoxrpkwetarnyxscpxoakxxiigykokcynestwnscrreeyfiriwxokprxespcttctskstrsginyxsnptrckpaykewawnrpfxyyiarxesyixxfoeaawrpiykkfxrrcwwoofxrnsrwagnepcwywpotponnywaakrrwnocneaitnessxessykagspsgctcspyoywtxpswekgcpoasrfofeasfcwprtrswpwpciyefcxoacpcwtnnayapgreorcwsftosknroafceyfxakanwwkgkxifwpaipacxgtfosknceyaoxpngosnwcaccoprcknpcfepswgwwoynkpfywrperrscsrpxcaieaoorexsiiiyoofireenoscweccptiptxsfxixtrapoyfysangciocnokgypgwastfggrwpctrcyppcfkcigessstffrnrkewntspcgasnaaookyosaekpwngxxsgsrcanreepwnwaicespetccciswrxiytscspifxpkkinaicenfrxegpcxctksoiwwrtpttpcgkryknfgixperfkactprrofyoorciapotsxyxitkxxnxiwraxsgnsgkcxrneceaaygcooyrocfffeigakxwsxtafyaeryyxotccpiiyrxswacoicokiogcaipsssyoccffaegorwkoiieoscgcswtekoxregexsrgpwfinsyoptekgoercyskyeswwokkasfyfotoefegxaottsfskcaeoixkgtywycticexwpckrnfigaigkxexcwxcpyxcnpxiigroiwipsiisxcgksscgeywinyyteaayysarywywkngrsxrortxfiwepyfwxafppgkgitpycsweapnkrgcppsnxwctrpaepffikorckirnxyswotosfoexacwoktexxxtpnfskfrgkpkxxcykosytcokgpynkkroyckkxnnynpciftaexrcyoansixnrwrtftwfcfgagiaowsniicaiknssaanwkkrgxgwyiswapxswwiwaoxsoknfkkkicrcnerkepcgfkxasaieaetirpxrknsinfkyankesciciegwyeiayrakwoyykycywgryieeponeyfirgnexcrogegknnftngnfnakfxrptnywxaigaygctooycoasaxeiatigsriyxgegwncgtorinwoysctasgsotpswpnrpypnnexnpnpciocefffscssxyiygfwgpnykxkxineaescynnsrtsxeesswtykncfpttocytcangnrttkoxxxoyrergetgnynaorgpngkctxkxacypcoewecgxoatyxtireaewksinackyrnewerryspaksnwksrxrryewrfxecsptrwaneifxscketkcrxpcwckipitcaexxkagogyoyocrkfstnponxiiipekgyfapitwrrksfwywfcootainkiaotanwwkrttywacktikweyskcgfswwikarsroskoinostpowkxeycoiixxfocrgeipfiiyyigatpkoaxigkgwnxyyksnetfownffyppsooopwxnpnpesgtoeiwsoyiforfsfipftawttaryxxtkgooeaycftogffswtinawntcpcytnxrxfypptpxggewpfockgritnwtfworgyopwowicksakwryignrwicayctcfrcefotwsiwxyconixiwkgaoeyrnptkreawkocrinryfgtyefocnxifriaironrnywskfrfceofgxnacypawwncckrepxeoorfsfgfkcrxreyesipfeacopskteirxcxfcwstwfkctfsnxctciixtrsrgkgwtrgosoearnrynexcgrcpoaspwtowappcikckckoexcttrctgokspwefcgxyisfycgeopiweyosoxtoseeeawawwgeaaagkoxpyryntwppkxgsnwweyxkecpgifsasefngsirofsyycxxrxcgotnfctoaykagaiatkospnfrcwtptkxoniprgyappypatgcaxxktwgstyanxxckanokortttwkwrpiiestfkgyscrrfwirksfcgygkaexfaxrickiacsapfncpxkacxosaeceytrskgwygktsryraagagarrykyoykaxgkcggypkoaegxswgiktsgtnofropyexgssxarxwpksnytetnxswpyxfartpwtgwiixfxtgekogitnasirwnonnaektegiwtaiaayranwxsrsxfrwtxorskwynrgtrssioakegetyocowewpycwexttsksnxntasgyxgnsscsngxccwotssgipnongeagrsrxssrywrncrktnwfofpkxwcpkecsrfgwresipowywecnfyiaogsaconcgoeewgrgrayxygorfwticrrfoycotioafonoootespoixeysreteokrtpitxygkgcectsxsnssisifffacawoinsrgsfrkayakyxkkkctokyikfcnrokynaasxxkxrkayicxrawewyscwsaiyxgxyrkttfinpaooxxowkwcpycicteoaktignanxxcckxonixcfrrtckateyiswaxgronoinyrcgrfepxxeikwwpeegtinxnknfryeyicwiaxapfxkixsaifgfsnxisixgaraykrgsxrsywgxotkokpfnwiayiiokseppxoikereaatrygotwxrppegoooseytnkrynkpgspxgonaroaronitcnwptweonecgeextaawfrcrcsteagaoarxcffsocwaskortykrcceigekifxfkcfwrfiwkiswffaywafnnentkfgsceggoansrgyownioppepwrkepcipfpireyenkkrfxfekaaxtgwtkpssnyytotiogorpwacyikatkyapsgyygecykrsspcorocgognffefsyosifgnarikxfapketfatkytyxpsoofgrtecxnyywoneofsxcecyyxcexrorwpotxfkfpiswpwgswcfippsgecnnkpgxegeeptnsgttowixserxrofeykxepkpspnrykwnfpaxaepyfcotxwaagcpiarxtyrwpcoritxssprwsiwxpeycxfpwkfpxcyeffnpxicpnckappfagarypyxncernnpsapocosnfrfeoixpxprekwrekskokeoegfykaiasaeawwnstgocwnpforkroktcxoxkyfcwcrawenoacnwnftggypnyergewpxwerseragreioxokpxfiwxpkxgnestwnigyieaiexnsoigeerkwegaixspkxyxaaeskipkecxgyxcexpewegprgfyyyyeoikifoowgetiexpsotwcicrwtggpiegfrtoxsgaarffeakofktxiwrgynncpsawfiikxfrwcpnkixpsrwyraiweyrtrycosaoccgsswaaxkywkfytffcxsiwifatorttfynagiewykeyswyefrnoketroweyykekkyrewrspncriryyffgpkagngfpaokwwyecrskpofkxxcprfesykrpcnwnnsnwxsikkirafrsxwxfpataswagenrifncwipxrewwypnaexxstpcptfwigtoerorgpwxiwkkcsfgrknegspsrkfyoskfxxgygsixayfcctwwopoorapayytgkoapyapkyfwoaxnyxgoyssaastpypkwscssofckynektftiyneetcrespwronskgngketysssnxrsprctnwftosnfistpxoysfckrtppsenfofoiweogtgwkpgtpyycwrptgsnypnfckotwtregyyxnotoxcryftkiowcawsasrfwetigryinkpssfygpwxxxofasofaipgskoearnsifwfckgcatpafeaywpxenkwxtfscxtsnyfekpwsfnfgspeytgseoagnpogwnwsiggoicfcpkoywxeygokegnswofxrwnykiaecngactpfygpwoyicwiypfyxygsxfwswsxkaxwktpfpwrwceotgxoitppenxraosxygfyinyosworxpyoycksgyixieieysoticyerweeoxtttnwentkyypawtskwsgkgxsforrknoxpaksrnfkyiiotnnexrfffitgaaowrixwwktiokfwyxpyorknyrnpeeysgrckxxnprxxknanfoposgopsntoiaoiackkifcigypwwifaopngxcacwoyinypafngosnxkwtkosgcwrektkxfwwekxaxgyigikntkwgekyxfpxsgoaksywsfxfxwpeirocpennryneoesgrxtasokeowpgftorfownenfiwiseoeowoafwkknrfykextekaxircwroygcxxeysfrskogfntritatkkrtxpkfryarpkseawwwksaeopftkentgrffrgcpisxpgrxesginfwyaoxpnriitwfsepteyrrsaasnecxsrfrfyeowragrwyyapparkpxkyyokfawakggxwnkykoygxtagotaowfkyncctgscfposywioypekiyfkkacttgkfnkgknkyogixwntxxxiyptaiykaointgfwxropnwgfpktgtcpspxppecwgocrofwocyekepkgcicnosyokkyitgkycpwsysycfntaaspowrxxesksyrexkknitcsotgtyfopkiwnannwcftofnnoekocaieseytfaecopaaxwytxcptgywtaftskywsxnpigkyepoceaxkpewkwsycrraoxieewfppxaarttfpitfryoipxsffynpscxpknpoynixgwernpetxtarfaksgwiyggcioofetaictnpxstfryfrrecsoffkafoygpfxpxraoerfxiaxtxcnnofspaepxptnooittnggfkgarkgfetnkagigxsoypgapciattnxfepnxetoetoknknnooinkykikwafxntptkpeynpwtsfwroyrkiwxaexptxpxfyofyxoieoweyxswaixwynfxtcwxwfccpfrxwrkaniknxiegnafacxoistcfotnwefergrcgyxktkcngekyfxorisgtpxrscwacikysapgtcoastxpaninswxnxxxtxwspicfofgikonigtttoosnrrxfnignexesxawpipcfgswtttiwfkyecoksgfrttwxwyeprkxkfxggxprkarrfotfnitncrsrfcwpiitafkifrppkykxiootwaaccnfwkannnerkcosoocyxcawxkwfaieyecxkgakawsyrgcifngoynrrnrwenotsyyoifaofsyitfkxsteiypicsffrnkiawepiwryxpowirnwrporxnxnkienxwykfnnxoitfeoootnkogykxtxwtroeooefsgrxactosixpypixntxkxakknteikopagggnycixnkwwftgcrfiprsypitiryxyoccnfpnwyoiggekexeogwftnnoraeisirfwecafkpweftxkciwssiogaxynfsnxtnpnkcfkyxkxrnktanxtrxpcpcrcyninfwfacfexowforgroyeesepkiewprfiyksxekioxwcniaefsrxospenaytfweyiktepgscykessrnegofxpnirnkykginfoporysykorxipgtrocexfpyspokaycsaworexnaefryycfxsxknxoxogxnfricwiggesokancknpfiagkofynnyiickggkxewscftrwgcyigatyickiaaigxxoyyxytnpyktserrfgrynnwyxatagnnypsxretpgnycifxgnoiirokpawksecxppnsgkaxgrntexkywwxfkifrfrxpyfpooskkacpfwopirofffsnwwcpestcnritnkioxfwtwiyxpoestpeefrwpxennfsnorfowesppsswistttptaaixpfxnryrepyewfffriaxygxokkosxnyfoioergpwatawkktyyeegcfpencxcxkcxoekstokwfxswwcnorxxyernoxtystwiixyyosfgpwccceggwtsgxcrkrsnppowtosterpniexgarkagygpgexepoxexsfigoxpaykfokgorkngktekxrpewfoxwetiygnnopanxnctynnarkkgfifrgrornwfwwtkirnpfkggawtkiatceekrstwxkrtoxtatfkpaoawwgkkecoycatrcfnwreoatnxaoetaiitfwopfwkfwoyyfiiiowyaoxocwrawsorriewkikgaokxwanxgaisffxcokfyorrosfxexswpaypwicoykiioygtfascxwwrwxwanyifncfftnknprirkkopwswkxtgosfgpwsgnwiefsgaiscekfncgyoscwkaicsnoeenpssxpssxakpsncfxwpnifwrayagkwoexpefkkstarogaayoygtosswoiokacoxwpnaxsptnkefccxxoirntxoxcwaiyppiepgnssetwcpkcyftexxretwxfriwytctcwynrocwwawcepwsntairnnyasptetyfsioxscnxnfaikyxriyapgyoanasgnpfrxcaxxneysrcctekpxiyiceyeprsgxcxctekkgogcpkaigafpcatpaetgioptnkypinrktkweekxcysnpyynicxyisrktfnkcnatykasgirrktecpkeargkposacicifpgwtyfnanffgeskepoponrsprirrkcxkesysoepsprytntkorgixtesywrpeyggartiorfotttafiacissieptosaptnapkafoygfkfgyoiorkrotspgypexfegsragktwwwitseexysoxxewkeiwnnnkiyxtpyfkwaiyfxkkyttxoycysygfopkrfyxkgkiaonscwxarrxttitncsaccsntxsfwpepxrteytrrcxyipfgiffgiwoccnewsrfeoxgscexofnexyieirkioxknoopkroikggfxgieppoikoxapotxoktxxercsapxcptypntcwtoostcooxrwryxgwxpaacxkiyacgipyockcaroyakgexcgpiwigitntcoapytprtpyckefgaasxcxysiwtyregaigtosxwgofinsgfootwygiwtwaacaekfccitkskttykgccnpostnonaswkaokttficrnecfepwiknoypasoiteopkwtktaneeftpyeinwxyywrsncxyrcofgnnirexiynnpaswrrrakxgitfrgfgiofxafpgpnosgwfxoegsyiofrscxtsfirfnkccrgaryipkpeieerwwoycsrniiytynywscosnnrwncstesinfkfcpinxncnpikscwgcoxxrfwxrwyysfcesparpfcatwrytgnpnskaxnsxifwxkwnaxnopynfawnafcipapgxtkreytaskiiiaysaeppxfrnkarigpngkeesafyfpppttfskoiopcogwtooenieryfernrywokacsogncfrntaprfrrxefpknwnokeswkwtgeypyrscgypswrnapiftpaeafxwffiytieortfwtxsipkcwrcciscpcxwwrnyircgrfnatptoxfgioxooirkafsyiipocgaperccriayyrfssapstccxityitkrgrgckxecnryangykwnoyeaireckwycxxxpgsnoefpcpsgosswpaxwceieeaiwgygfxgatcsonxgcgraeocoowcnfyrsnaiotgrgykotyecxapswsaactaxgfopigngpnetiogwioprprepengirsospiwwaseeegtgktkanftrgxykaigaffiinrxostcxgffenpteccsyytackiactkixwaspnngoxgikpcncfanssiksgnppkfrispiaewtcangcrgkyweyxkoaertxnysfrcgswxwonrwyetaptynfkeixopfysptawaewcsnptwikpynakrwfiytatatwigoeynctsntwyoyrncotywkarsxnxynkkxxnykfnsgrkcstrrgftkocpioreykitwpycwwnxcaffcnrkgnpastxxniacxiiyrgpypwxcxxngxrsxirooyoxyyeagswnwwaxeginacsgrskyfsweiatawwastkwsonswpwictrptgirggocnkaogncxyoakeynnnggwygrnxexntcsiisytrwttxookrewfrfpxxpyirgitkrgpxgspfytrowxykcpaokwnapsfarrpeagxcekxwxfosieafwttaxyogkweciwxacpexgysrpcnpeipeiipfrycrykctgyscyinkrkcragkcfisgpgkyrwfeggacnycgrowngtysfxifpgiorpfkyrtwkpyaywypaaeffaiyfxiaeenykicnniyrfiyrsricfyoriefiyginawcnykyfgxppwkyxsgfregxrwepwncioengegywokitrgxytywrkxygioaoosgifpyxykwsosskxktyioipiiarrnwyitwkpgkeygereiyrgiaangraipocpsoxgptkperwawtpnfcitarcgkxaopkoffckieenfkwaggxoiicpknsetsanwirykapionwpnwxtrkinxtagfsefwgangxingaywxparkpwafifnckwperyipexyxfkywifxknotxpswwakkyioifkenygsapgwkyxikcckxcwncrnankpcrnytpyrkoncryttknwnsayicxprcnoapktfttpiypnswnfwgatrkfkepfrrnngtytggexxgnfrcnagfccwpokofaaxkgostfpxcxcwntgyfnpawwsagypgoikgxnpsakxsrcgkxaxkcweitktkswtrcogtfcskoktparoprfaysrtixxkwycysyprkfatsiiercpsnpfrrewiaigpoysfkcpofakxskecwyyyyxetoikygaofgstnsnkyepeagsxnfrrfckynoiipfaskeffsrefwfyifoinkratoxerrrargtfscfoaagawgkcwikfywgfgtgffiyokyysrgkpfiofigtytoyiiwaefciosoitorwnoasktrkrtsgpcscsrgywokcccgxtaignfffytyxkcsxywxxitgaietkyiorpyaktwywieiciifrexeigwtepgckcogneftfiigpnyrwpkfpckknntwopsnanopnnxopesanicagcktptgrexriyipxgcnipoagrfaioarnkxgwwgpxorikpwwgeairwkncipferkpwcyakenffopyyiensseanfaiwrfgnypxgnfsnpngofwncffncxprwtkprrcfinorsnwgcffswnkxrfaxpsiesnofnffaragtecrsfytpekeetkrsaegocgnginrtotsgrktawxatoyfiksaxogotygcrfkikyryeeiegyxckxfokpeenaaayikpncxgxwrynrxtkpcykgackfsanoktagptsycnigwtcecrktkotroxgknrwanwysasgwxyrfegerywgnxxpcraycicppcewrongtiswrpprfngcsnatnnkriigteksocfyrsnsxperntpytkfxixwaeanfgskoecagkreywcwosiixircogkxypgtyfgyrrpygorooscsciytetkeyrwpewafnoxfycpcccppinpsniptrergekiypcitsgocpkegrapfkerxptfnkinpcowxgecoskepoperyiposrfeopwwkntawakofekinwtsrrseccrnicgpetotsoppgyxtnafiatnocptwyfsaekwepiekgkxiognsytpniaeytnkrpstgipxwtiwrcftfoyafskktkswasfnpypwcssostrppfxcfiarktytegtotywcrewxpkrrsnkgcooyixoffakrsxfgcnkgwcoatgogwypageykrfkwspsckgaacftxftpeonincfctcaigcgrntnxygkgtsfccsfagyyyengaoofpsrcgcooakfixoaogtinxnaroiaaiirpsrisitxxaiiyxixakyekepsryaspaekgtcfctnyoxwrkgenwkraestcxgfoxeytgscffpepkrtarcysygxcstaanoyoarttnopietwxoigppgwogariyefrfrfrwopnyfpptkpwyxgfiwraxrxraynygryxntnsswcafkinriwcwwoetfreweswpoggwnirsieoktcrprwacekxxrytnsykfgcwanfgyssgkowowxkeexigiytotsfpayknxyenoytccsraiankxafiafckxaokeofgptciieicpgkfcactnpeaygynttwxoyogayawkekexfgycxegwncieggrkyeyfikigpyaseakxockistyxtcireeywnoscptpfpytiyewsgynxkxttoaxiyonakwegsryyyxffrwigktfsypskpaeirncysfesscnntxgigyapxrotksttcaarexwrkrwkpaetyyystrwrtpoetkayycperwseoaekknytoyikfwwocnesapkwfesyygskyncrckxpnaiinoxesknpegxoweoaffxkwxseswyfwcyorteowiiteooaxgaiisfecixxeweopefasoosgixecgifiicyisrrtttyoiorsgesrtcpegcwxogfenwwffgywgigtianfkrsoosgigytpgiyipfyafyagtnwxxsecowygwosagkyfppnysfistwxcggryxnokrsoxpnyagonrkxtywwagwwngwstwnksctegkyoynigeasktiaextkawxiterpnpfygiwttsfksegoapefcccoiyxxotkerireasecefknsknxwfgkrpictwgowrygatoingiyrnaokyntsowpxgofioccxwnxoatpnekigoyrstketrtwsgowaygsogwaeykwegkgciitswfayoecfonaxewitycsxtncnrgraxcxgeyniewiiagrxctysxgwtgxikgapcggaosoktpypewywawcpgegowpsrafragitfkpawktoxoxopiiwgnrgtarxxgkeyrfskysktfskfpfatspyyikcninnfewpnewapccsgcksoitkogpnrwktswanproxntgttxtwgewkwrrrtakkkysknnkwxwoeyokwairxticnfrswowxrcsfxsforgptfyniifnwwtrcxpgcwtwgiwccgocktragfoocfoeisicwtyottpyinreepteaiaeacosootoakkskaikrrxfexkwotpgngnwcxcateaoaaynsrtywispttfecwyprpxfkofotfifgoaitrfegyaeeaaeyttcpiifyctcorrntyripcryynxwirwtepergntxwoxxaoakpgtoexenywgrfsraoiaktyfexwotisiypkkwocpofcerxcoxfykgawscgcrtkisfxoogrscgsgptixkkenigaefrxfiyficaonfworprninaoegpkxsnttswwfogwtooiikpfaesogxkosfkwfrtiwgsycfteoxrnacnrtritewxgsewpkefriwfkxkigsinwsgnwyfriwiptcaypnctsekicpecegtwnfaptntrfnikawasxnpookyccekywffxirgxnkkfgawicayckgpieapoipeagpspoyaiysynrkwnxoycfacioaeotykenifyyegxfnpigsirnnysgseorntgpeenknsxrfcrfpfwexkattyarfrtognppgnxcyforfknaaxyiyypxoayfrsffncoxignpxttxcfnpypttxafsraocyitratenfrfwfiskwopxfffntpaiectfeknwankgancwxxfenkxyxygkosytaerpgaitieiiswcrynkeatgwyrareiaxggegfeiocxwsisfencfnnrwkkkicsnfwykgfctnagraitconissataotfeiwcepoaoakxxsgtkwfeayopitwyykynxyxkgcanrnwopcgsegiknokfyoyckkwcrgepysfitopctrcaxktokfygrxgcinocnfsseofpyfponirssenpwcisgyxyttyngsosxkyfepwwsfywookowcooypwsteegcyppcnnfipicneaiiorigfkssxykgsenxtyiwstppfefsgxfffcagncikwkygkwatgpyeawktnffnooncnwrwxoiencktfiarknoxorpaiocsxxeynwewnssxraswerioepyfefegxcwonafwaeokernsofykgrckoygaxpepcyowcyrtfrtnykrnascnonfiproiwrnxxccrxrnrcnyayxfgfncaxatggppewpffknoaxcrppoyeaeecynyekisfpwpoafkoocxxyggptxytifnxktttcnyepgnkipxwgaegfggoootxsyftninxxgseeagtwtwfrfgepasoyinofoirfeaowxtekayrnseprrgoconoaocsxwwoofnsxigeggocfnwyiifnttrosxpksyskoowkeneewwyacxykriyxpwfpcpapswaieecpokkfargncektporworercoggtnsgnafgacagtsongegffcgipfosssnnawtfiegosocigarxpxprnwsiwogtyeofkyfexpegntoniprxanfeixcwerkwxxonyxcecfyoksiocnpkrtgrweiwroxykxigppgeyergnoornpiniwseysniietcrecokayekkgpsaetnaaafrortpokcocfnrsiifyeowskageycrpcggsefrkyastkxnfrnfkfgpcsoiockpcrkrisgafacrxpaornryefspioeeigitnsstigaryrgiittwywankiswoxysnnxfsierswkpotrwfyfkesotykkkoswcaseywnsionksakeanffgfcetynsenexfyxyywckssaaekotackxkfyypgpsfgaccienftfgxgrgwreoterftckxfasgoannsakpspxgxfifwwikipyenwgyofxoepiyceskngckpoytaxanpkftintersakacwogsywowtscgryowfrrpoaoasoorfyentifpgwwiaeikiwgryanfwxykeaeykcotgfxxrpnssrkxaiiienceeksserosrxexfgkpyxgyykewsnpyxckoopryrkstwicytnrrixkesfsenfenfwoixixasirgcngxttrcrotfafawfpywyskngwnafkieiestifkyctkcticxyraegtcarxfxgpwnponoiwxfnriycpyitikicxnyapgswxacxokcypfwxforyapforakkgrgnypixkaeffrrangwikyggoynirxigspaxyexoytponfarncgtfrtefccfgaepgieiryirtinwkyisrscfspeoaaeaonxnatrwxcrgrrrfyaniycgstwkkasoxkeoxxaoiwnxkssgpfipokfxfoipteeitxcctxawwkcacwogyaxoeycwsxerskiprcgnfcwnipyafecsiotkissffyepetieoxttekioxnexxrnntrweapeytrnncgaenioypwrakypsefprfnftgpieixaeoyooknoapkswycgkwynfrwwgytirxxwtotwgiftaaepcpwfycwcfcxtsfaapnnyiaswnipiwayesegnkwxooppyaynoycsisawrygpeppyostiytcasgaykfgatrspyapafxgffgperekasyxirkoxcgattticwfpkpgiootekpyaiteftkxcoagippgyfygeyryineffwfesgaeakwwptgeepcerakffpockaaotkrsixpaicceestxoskkinccwkepngesxcwscekwfyewsfooiaocaocwyionoeownywctcoopyxxikpcskietggnpkssprfwpyownpwencnkxfxopyypnptasprkstcsgcayftnpwktgosnwasikfpokiyinwoinkignypkyswwoetgaxonryfosontxyytccsiksaofekretoieiokgtowyfcateaorggcsoeykccgfnxsegpagonkakxyagsncyyrnixrkpyrreyiatxnsiafacwtrncskfwyoegpioytnwpftsgsnefgxixgrscgrxtcaygteacsroxknfwrraaprccoaxsatexyxwygwaiiggwtafokfwofgikpweyctxeoerganottgannntixfsrcwexkakwkrfoywofaypiyrtrnttgeopkggkoaprkakaccxntgieaykooraikfgotrpfgipxpwcitaiiywpfwspiaeekrykkwiwofnyfkyrepregwrttwfeefxeaaoyiogxkfisoxienoeifiswxyncyyxacoxxiwnxskywwaanipiyeoatnfnktkewsfyfgwywpskiftxsswiyegrpppgernsowawxgkspafpgpecwpfakcsoigewgnfocoynyfrsgxwopxeowaspeetrxktetkopprawngoywipfgiwgtykwienckcpfrgoyxigaigcnggnsksefokfxxewswgpcyeepeorypiggpsnywecnfierwfwrcarsrcnnggerfkciwrryspsywtfgfgnwgfxcsaipinwcgnoryeysaaysgtnpyisiiyggeaxyffpgsopgyekgrnwtrgtscnraifweaycranogoriexraosyicxggpppfaeynwgyypsgpastsgrrspennrawyfoskgxggixyktiowoixsrifpnyygncxsptwfwocfoxaogtiewiaiixgrafospynrtnyrrakioiagyerrxsfrfkwtktctywosspetrnfogccsykogsokpntycotropocxkaioatpxtiesgpwcgrpexaoonffxncfgwxpypykkaxfktpsypftkperccytxrpwtcetynatacxispocaseafpegtoekocyykctarpaswxfnsriagpogswcnrssattfrewwgyyxctnapgyckpfgowixerrrrsskwcigoxprawwesooricritrepitkyigynocrcwoognaxsxkketswxccffacxsynnksgsgctswkktpcyootnttkeorfoewriffkroxkrefxxkxgcxwfincswcayceiiwfxrccwtewpxowrnxpafkxtaeygftygcyooksnfciwtkgassioaspewkeanypopwscarnpanecwkfyfynsasxegttnofpwgpcxkninewppwygrcfeewgixeeacnasxiieystkcsfrksyncknowpiynkpxygiyttcwixoporrikoptiatowexstayneyekirxexyxxsycssergicafcsypwakrppoxsxsewxsirsosgsfxcoinpcpprnwngcipxootytcxiwykeeirpkskkkstggiygnsntpkaknyrwikrfnyoxpaykpicpntaospknyfxaciocfxppsepyfkfsrnoscgtaxaoxtckargocokefwtstftaipecratetyxteaypfarsweyiewyckrfoeniwgkifwxiecpxkripakgnfisroskprgfassewxctirwpwwkocnssassowcwpanrwfsxikfrotiiytykpaatopwnfpwtenwgiyxwxyeoctepsssspotptepktwskeyxftfeptpsprgcrxrcfkopfktarfptwnkpicypaefyyagfnkrcaeappnicepwxafxytgfegwtwpitkairscwctswytxwrfyikxniaxiyninowtisranipaprrcxyxrrxxoniiscncnrpkinksyatrngwgcfysgetntsfesritgconygosoxcgaskyrtxcykcasfynwypnstkatyattagisxkrxprxwktpfypieagetseesixxrnkypwtiwrigwfwekyespxiwoytttnfyeckcppociayeysitggppcntpwkixakwcgagsscrworkogafkswxywwpiwespicxfafaxyiepiotnscnawrcxrawcofaswpiinrrokicitraxgycrotfirxnwtngkntfnokfsxekcxcfwypeiycfgtpnrsaipgtnrfkrnpsexrtfgwypyyscsaaxngwiifocwpryrnafsasegwcksrrwskfrgnxfpgacapefkkcspayytyypkxtofyfwcggyiningfyiroypkskrtfrfcxfcfrxkytxpptkgnnaiktpwgaeggrcfwnxosnkkwxteigfnsiifseyoeyetgfgppswwtksssrxprxtaaxxanscpaonewxfikocciosnpaixnreagctrtkaaytykxsyoecofktorocyetpgkpxxfrfswwptposncyfgfyecentxfppeexkgsyeectcxrpwsataiecrkckcefyttgfoxawfkrtgfpfctirkpxsiokicpeweftogwgfnirsawkinocnoepwekcirixfpisxrakcwccsnseyacfifyencaeixipefgagrnknkpwsowsernsfparrfkriwpeoyasrieikaxasffgwoopcoiyikookiepnwnwcrecwwxptpxrankxafyfotntkoyxxwsgnpktttsowpwxsoapynwifgekniaexasexfxkgwgxxfacytkrxkyknypnotigiionknrwgcrrynnereocwxkgfswxrwygitacwisftkstakfexsnyweccnrwssptfxkieiwantxpgeyfysiefwyatfspywyxyxckpwyppgpffgensyepwwnfkoycoyyirnyfkitkriirnnyyitcwwworwigioepygoawrwfopxgtepntwcftgxikfrtkxgxxsceffkgwkyisgtowgykocysknnkfsnwccenifyaocpoksygepgtagatrrwftwrkoitxfrokkrsxxpesttegiwckfrseekxrgnxnxkekoeikcwkspwoykwftypcegkengnofipsayonacnpkswksfegsakykesiyokraoeigrtctwowscswrtynikekstnreafiancafrygskyertntsccpoytifepxxwxoefkrtwaysrtkgrcfxfrsnwftwicfiwofnreiyiyexsysowregcoxyyrspgyokeynxxgawctxgopakicrtsxceixfnygwctienytsieneseoixakpkcpixycfonyekppkessknkcxinyscapcegsokxcsssaoksteygaefypecpscxgrecfetnccsasnxacwnypsxptaxynwnitrrexaafoxgnniggstgcstrrxgfaekwkoosikiiogricaprerppiofnifnafoifepigrpyppggxwgfcswgktecgrwoiossrnxyiepaxfotysigoxgxsgoiarsnfyrkcnnoytknfoaepsfrysykpyryxgxipokopegycoxioktnsxtnkfytywpasogangwaakkiskfoxawriferxgecwtgnpkyrwecxoitowngegfesnrggkarffxsgnxxfsfcfaxkropcercsregefxnngeexniccpeixxocgrryrpaopogywpknnfpoxafxpxcrkycynokkainsrgawfiyetcoapaeiicocskpnxipaeoxnaxfwkooniwasekcnieortfeppagsacixskyakcckenyokeafpeykrntippopsctxpwegcyrygynnkiapeayffcittagrckgrteyspigfrinpfwapytogpeywgkptgetyfifgwaxcgrawttafakoktopoaricfggyxkaaweopewaeeeaoixcrrifwctroywtoxkgwrrftixpsfwanyiecioxwitnensiwcgeweowosxsicycawrsrscpkxstwsawspanantoyksgesnegywwiycgrsnrssskgirigpnfaknkccifeiykfxnypweasnwakkfrskoytpcaegrirayofrfrcftxxagpgsrpfayrccrekfgktywficikgtfgeiefsgyyyktkcwctsxiooepipkxecspfpkkwwcextoaetwiyfiwrypfaaktypwwpefcooeggtnryaeprwprwaitfofcsrgaowwceyogfxersysrwrpxasifxfswokyaasfowyeesepcoooropiofcpoeccxitxyysiioraxrotwispotrwokcctwaeketctnwgofxfpecsafoygowexpsxxceaganpnncxeyxpeetnpaaoxteeswyxxxkrowticyoiesngpspypxeknpryxcwgtetafssipacponsgysofywxpxwgpnikwpyiegrgpyptogfonegrgrsiyfraxnrprfgacsooefrpgnacygixcwrirnayawxkttcwtoniykfptawfsgygrioapowyxpfxegntftkwanisayrasfatygoitofepsoawpgwkiiakkyyagnkayrnapnigncoyfxtswrckiityfciwaioortgxgnxafnyeegexypnetifwysxkeffifnfoineaxipcnreiyyaroigyowpsrcpkspixwncgntiteawcxxrxsiakcokwoyotagocsnpwxsfggkearinygiiansirwxfkgnxayotpfefotwcgigktfkiysnngotngkfksppprnckorgstytnipnyexrrrptkknkcerraappsgxsypkssripfrykawasxtiewicscpppewofwptfctnrekyrptxrenektixwwnocteprixagprytsitkfnerykwfwceyfpgeofaennetfgxxxrosaxtrnpnncpscfyyrkawsgifwyreaseeoyctsocxgkxsfxrpskrcfskekxwxffyswccfsiwgpxyckepagoyrtttynytyigacrgwatstonptxpctkkwcriokraenkoaikarifwtcstiiatrfragacxxgfeoxgtnxpweptykptrgrpyxxtcwrwnxnstaeoyntrfwrtatkraitpfsxttpcacoxcxreffexrepneesnoyorxnfesxkgpswpipkxfnngoooaxgitfiwirsksopkgoisootikrsnxgnpkakokwgistaenftpyxagtpnisnaawxxtnppnfgsyxggpownwnprogorotriganxeiotyisssweprwgrgssiiaiixpgrenxirawyetyeponxikrkwsgcwacpiegyrffigkoexkeeraegrgyrooetyiriyorgwekwaprkkifrwffprkckicnosxepsrkrrkowyocrnoesefrygterikegespkpooacxnkafaxfyyfpaoiokcnnnfaetwsreckesinfrgeorsgfottngxtsirtweaowpawxseaoxynpriwywkeynppexopftcwetkgfatcaxytfxwywxnpexfyritkerarpscsfpisrrkcokfowswayrstinkfttxafkfexnttkfgkkforaironpcefincafpxxxsreoekgnntagsgirwyowkceaxxxxfgtepccxipioccfptnttnngiongnstnwtfwexprpnfoicncesckskascpkosxspaeryxpexnnkwyoxoypgcitoseowxrnpkonpgnrrsricgiggsciyytpcknktkknoxfrastcffcegxnnsnnyfyyspsaefcxwnygsygwytitwapiaexcnxexgfrwtfxepksosnareicskgoyarxaxekrftfxgswfticapnxgtyoywaokicrefxwcokngrsyagicwiyxrwppnfgrpcpypkekifaixyffpfitxyaatffgfncyofcyinyekirwwegpxpiagnpgrawpfpikftpogngaewgayfwcagkywxrsifnpopfasrewoicyssytkfxsxkkpsffgtteecoosyyssackeayrfcaoooxntwkgaytwnxgipyrggtsgkcrigatpnxtprgoxwxeoiyaspttwntgrwysaagkfoccrexoawrxgwipptgfngcsokpetktyitystgwkryeaaayaaapccsraxcyaoiokacrtxcaewfkptwwkxnsiswnfwxcfgaosfpeganownrnnoiariaoaippigxywagtxwgiceofireftikkwgseaayyifarwwfiycaiiigftkwtocecwsponsypfrgcgrteytycyopnepscpxoatsprgkrnarrganygwaaryspaiirfctogpfsoocyprefgfgtpptfxkyftnptaypfsifyfcwxafexategfgaoyefnwniarfnonxskrconsrrsotakcttatikkeirkaxinoktywnisrasrtexeffcrixsxsekyfyfattgrwfcpxfgttxwproxksxycptsrckegiainokwciiiapaspitfiwggysipntfccefynayrfcixkeorggxaisapkcwxkfnarfgapgxnaegaynnppnwkoiexosetonaytofrwifinkarpptppxtgxtrfgrkeskcxoeatfeyeoystknnofroriypprwoacenxyatktscaftgkicookrfpyxxysgonrrfxaekpnapxpwtpnnaoiytysppiiynigykxtoxggcnwpfcgrpxpwnfxpastrygtcyyycfgnfytsftinaoepagokrgffrfytatxacepeipnrnrneoftrwititgcrfsofcigcsiskoyopktokfrwsgrxwccicnnyfisaeytteycyoyfkeyxgwigxwopyoioisstegxotknawoexfkxxcxcewiexaawwpsfrrinopecscoywxeyriangpixynoaksgwgpnrtikxesonaonfexenrgxttgatftgpsxrniyfwksopnagpnxiegxytkopfiswowptycooyiepifipangokfioxtccisoyptryaexkecyrsfrksgcrikspfxcraifowncewnfsorestnttnxgxxxyfrtofkftreyyifckpaxstnawrkftcepcifngwkkggrefpfxnysysxttsanitiapcyyxnnatrkgexwxanwntcaswpxrfcpnwaetcacioycaxxcfkigkiweifgiywwwriwttaysfncfyniifccfnrygptxgngyckeoyytiitsexyseptasrstonnrkscknkweerffaaaeccftixaegparnpyttrwiisxopxroeswxxwopyfxrscogtteeaescrapcyrfoskiyrcyfyokiaaesnaywfetoiixxgwxgpenffwpoixpifpxwpfksgrytksxakrswxwftscircgkpipwtcnnxfrgtwcoknxsepprpewfogrwcgcxnysfkafsosntakswgrirskegftaxwfecyfapctgicywsyfacceeiapynrsnrxyskfxgpckwcipgfexwosyysrrgttcwyfpwxfxpfixxykrskpoeccftropefttgatekoykxowgoagaefgaasfwpgsnownxtrppognfgnpprewwpsgkkpexkocfkoykfxsyeetnpartgnfacwnsgowigktwtkegswcegfwayfywkxirpoawrrgeeysirnfpfksgykraicotcofrcytxpxniacyscpygsrrgesfnspkrgfxypytxagnxyxkaaxoigntewepfesokycgtercsywfxwkefnittwyfyatskpnxaecoxsyrnnnsgtnegnxxrkcxrtnpyaxooxgnngxnckgyatfkgyrswywxfykgynykyeoekxnppxfafspyeyoinogcrskrgyrpgxyrsnsyyyittsptxnosoeipaapwanyanepxkcppgnpissgwonrwxtaigtwweyysoygxoscnnoysasoeaaxsskikkcgosnpsogesakgrocntssntncikxciskxxapawxkccgxaaaoecrwtcrtrxwntyfifpgxoskekgpesnsisxgiwgtytrannfcecngpegftgorwkoscwwsfxeecknywecewnnassnfirynxegxsnxwoarwconspxpokirpeggotoociwrkgpetecttyepfsptexsxxaxsccxfnfpresfnnffpysgwngipafriygowxiwapkigeakyxskykkygneecencxwyfpykfaoaeonfcreooaexewgnxeprarkywyikfefaynaggketsteiwowfsxgrnntkoyygrkrnsawgaixkxcksciegogfpknxffrwcrtwfpfxefkkkccxxwgftigkkxpwnyyascitkkagxypswgssaakcrfyxexwoarxngeaoagowpfxtpoytawrsxcgrsngyaknesrwayerscakpttxcxcacpyfrfnwekesccstgiakxoiaekakrsxpfrwtypaocfxpggfxicxwgwctniipoifgecsanwciwisctkieefwwycnspspnpxacwxrxgariixofokxosstoxfgtnnxxakkagepkictnpwiaoiacarswcfryepgarsfentoosakspeenwcpscyrwpcogocptpypintoggwockxaoittoyrrniwxssayescosfeoseperyaxfeiknpsrsiotiriifecxgsxotgfiigotpgwppafrppcfciaswxawxycoossyekkrppeftecrceoeywecewwgsarpwicecfspffknecisgxxpacroecofrwrpwgkxfwkoncoertatcycpecoyspcsskyrnoocngnnkfpiifawoifanwtkykorysstsyrwwkxkyroccnnxpxfaxkkxwkxeiwwwrspciitkeggiakgaiteoosniisefwsiyfskwaaaiyfaeeeoesxypgtxwoggsnigckyeetnrinkpkiscgsgrcepskgeitfspffntysrrkpxcfsyckkyfeefyxsfgiexgksgigwrckirkofaoprxrtgopnwpckfwipwiscakxnsrskwwgtpcawpspaoftanottprankxcotxwspknyeognapypxekctyryyffixfrrnkxpotafkgkppfsexgwsgfxeycgspfrstfwypwykgfkfirxtosfxxfpkrfgpiaawsgrxtsgrtniiewnkwkooryprypeygptyipigckaxxaeaewkasirspnaxyfxxiyxepfyfptefrtwfiotsgpskrtwfoeoipcngnanrfyrncwnxpankocrpwwaoticixyknyewryxoteexcagpaiwnierrwrtotkpsrepccwpwcwsgwpgetwwfopfreeowtaykwyfgcxconeppcgcanyetgfpaoinagteockeipcgptesswcrifssgpystwesegscainigrkgcetctecyayeosiwpyfpfewttxpftcewcxoassxfacsepyrxfnrraaxyfewpowfnpeyyrofnxpnwyencrkakatngnwepnntfxtintfaxokgfpftkwtntikotnxnfsyxcywtrfwknxrcenepwtnxtyyekfitofinetfgnyigeaixtpaynnpiktkfetecnarpgkasyxspyyitaatweycwrxtxaaknacwfptffceaoxptrxskfafyipgyaccytfkxkaxwrwrexaaponrxecfgwexcrgyafcywartwffkfwggtkpwgpfayiktcwpokpptsfikesfnfgrfigkipoooawfyaoaxfasxnxfwygxtaffyifxctyywnkskttraikngcefacwfitrwnseycwxoxiywcnnkxywxxpwkyrkeekrrtncsiwkgtoopaasgoxiywacsspysgxertrccxskeieeagnngyftraiwcfxpypgespfacrnxesftctwsneygykoesnpfwfpsyeeattcygwpktocoscctyepxknswietsinnaacroptkacofwfwripcpfgffnogwgwpecysapykpscwfrtgowwinagtcegswinngepoieoweiskeynowkswfkkciwskrygctftrpfgaeayfywiooygpxfreaowikafnrgrcrwcaotwireiironrkpcacfopcrgryiesrycsgnkrfaoxcegxwnrroyxcpwoprngropffkfogsntfytsnexiaksxwanwgrpcwgtnnyyieaifgfkwikteepnowirisesniynxoxswigttcxapknfeaffteoiaxyxoanrngfoxsnsosxsytnegsfasrpotxfagaxiewxgrkneicikykiroerwgnpfsrwfpggoyeyeaikeifecrgepxinrnpnntfwkpwngxgnyapfrncktyktcnipogxffyngrfppoacitscyrstyoxwicecfitoxnioaxnrpggsrratoeefygnotrypefxkkftifekynpscgoywafskiasnerxwocrowokxwkxpgkfgikocktkketpsifaxgacyfiegtrckysxetitrrwfcgpcfnggrkxcrkrckeyyoooswpgrnwkfpwifynwrfxwtpooegxgkxywrgwfeoxnixtfaykyfpwtetowixapoogstonegwwcpxeanfepwretcgksripygnocynnecnrfyswwotwsrowssyeccongrrryifwcnikxogysfpkipexsyywasntrscrkxspconaafpnpprxosokswgknnenaitpgoategwosariopagfxsgtitwiirpnrtksiaiepoxxyorkfpnkgpotopfwkwcxracsgwifpnfpceiinnrctgfwirktoxyiforeikrgfriwiokgkrrintfytyogwrftngceptkinenpsswgyapcgyrawpogiewfiinrywonkwkwfpsfesiieynepnntxnxswrsrnsaoywfpxgyfyrccgssfypgtroifafxfciysecyxrspfnwrknfgkyyyiokestaxfxtgwyrprrypfpgefwogorrokoykgfewttxyynkeysyagiaooiossxoyyriatiorxwwaepnowxswisatiyinxwsicynaiaeincpoiitwegfaktgxssyrcnfprkikykaypkaioskaatnpnnwyprgfgrxstyaeokfkfxgpttgeknopptrxyskeooxtksnieartiofgakicgfiysssswxgntaerpprxtiicagaggstysexswiakgfxfaernfopwkfgfefososksrffwyppafsiigxneksifatogwgwowgiicnikennorinwpioteywxsayfcnwscooxatfiiypxpcksxkwgikcakwtattsikkyiogwroeyecyeafckrcycpcittafgitxrroxgisyricapsokfxirxnwncitwrsccrwasknykokpfwtxkiacoktofpxapsnnxxyapiyensipowggascinsngrkgworrwikyorcwkffeeapcrgkaepwocroocogefkewpwocspxxfpeiafgwnwrawiwsxsscrefpeettypxotinynsnogggwrsntgaxnaooggrtwgfeawfoaxxxepwrcnriscnweooctwgogporkngikitprnowtggopncogyeyfyaacynnspkxfwfpawistcoxiitatknappxiiganxfsgngiwisgkfykpyssgrxiktsykyrftyiekatcioekwawyonrsgykxaxkefyacixatgagncoarafsctwawarxeyxpnwikpftfnykwnconaawrxfeyepsnycwgxeewsioxikeiekikpttokyikpxeanopnogggnseckpgxnycxfgennykkeyappfgfgexsxirwoownkwsxaoxnfgkxxtgeifwkewweyfccwftcaxfiapckptgxtkxstkgfegfrrkkwfscrfgpkckrkppakttxiwxrninxeywpcwytgcxxxiypkgrrkxxgyosxfpkcryosxoyxxptcysgxkoyfyftcrwsaoccpeporfktkptyeofipknppapnggwaairpnswsoakigfokepwfsncnxpexxynpyskwtgsfgiorpxycyerwfogpesxcwrsktofwnwgayftsfpcasgpgcpeyfisafipnnxfppknanpfogitfkxrkksrrfnstycewatkeaagixntescesxaxicttpccwgctgnoernxpsxfwnoptenisgaexptwfcorociwccoegwsntgrtptorwtnpcyfoxoopipneorkwxpwofgpkiatwokskfayaccixcrxgnkywoyeoekgkeyixsesrktynttxpxkpgxfigfytkprswyoexncngpcfwapfrstofxfocxrsfpaxrtsftreygtcsatogeowsaiikirywwcpxwpppokigsysoeareaknftircxixgkcgpknaffssinfypetxtigtyixaoxcnywpcciiecsneernxxaaieyesywxpsgwsxfrcksfxfettsgsknwwwgaaggfngrcrpckfekncipopocfapioeofnxotoockfkcpogkfpaigsxnepinncyixgwkprccxtffiowttcyafwsocirxwoigiotxrsffesaainyicaxknwcssnyanwfkoetaarwnfcwnrfpyfiwixsyacagtkcproeswpnywytsofxstaawyrningxreofnagosfnfpkoxpfaoisrcwfrefcffafafwotisgrwtcwknpcyowcpwcxsrwyykwseteansaainxyiipkifafnwpnepskawesyfycatissrwwpgfaokkesxtgoatrofexrexxatiraiyngfnxscywkypisaxrkrsnfryniwywfofwiekasipgkaarwnfkrcyfsrftcyggggpytcynrakowcefxnsygpwfaepxfaeafocxrcecniinrfwctyggiciogectsesacitpxcyaeckfxiffpaaitpocnrskrgxgtppaocngskptonfrgpxepcgynsotykstkkofocpsfeyanrxgwpxtwpsakgkyrpfpyspfyeinponcxtefgfaenewkfinxstiriowytesnwicxryckrgignsoaxyspfycyrxenyftsyswnweswxxtewgxyoaaaaenowtrtoinfaotwkkxpaaiwpxxcyroggiokyeitoktayywyiptpcrcftnooiwegypeoxacpxosctwawrwgwytykicwfrnxaywnxtnafrriknginkckitnykgstftrwokenpoicotwpacewwokecnrccrkikwixwfkanetiriynxprnaarpeciipkcoxtocxksgrstrogeyaypfyxyrnpptwotirpgksaaecefeepiekfccrfgicygixanwsinxiaiswnftogpyakaeexrsxfoarxeyyyfnrkswtrspsktkynoikyaraigxffxsonoftearatsnrxanekprknigkkpwoxreiwgerikcotgoitgfpfceegtoaiiypykfkcpeiwweiriswaopiyesroenyergnnfxtgkiswfxkkxaaswpgpsnyepyexorcgyfkisrxergrcyoatefocwiafaepnwfnoteggpcwwcggppetfnocnkkwpnagysxpfptkexspyoxccsxiatnwtoonkxnficsofnawxtnanaffkitrgeaxyewwrkpnryrfrixoofigkocppnwsxoffaigyfxiywitrnfnnacigrarfscaoxxctyyxwfkssxgawrcrrkoncioxcsgicggprwernpxstwsktgynesntpkasgrytncssspwnxinkcrryofxxxxxfxwpfskfkpgcncfcocnasrkcpapwyxaxtyseikcxenwpxsttraaprnackiktseyiowyteireactayreaytyegpopkiotcswikkpiopcxaoenrwntkggtnxypnecscopxktpypcnefswyygrcyoykipfessastpfxoxypgwsyoranyytwrocawnkecaitcxtnwwtfpxwgykoapxseogprapnspeataoeofnyxpewcownowepyowniwantfaewpknctxpofstkgcscsriiretafsikarrxtoseocofnopgcenrgkaexgksiraoyaoyrxtticxyirgpexognnooicnkaxscafwaeptxitrrxywognywgsykxsxekkfggeoegnrongtkapixotwnsggwpctxkerxrwpgcskssoiexnstywccweoskfyraeycegakoeckepgxiryfortspfpekepngnettowppwrpsipskcceggtkyppcotrffyfyoncsgwcgkxgoesercrfcyfnptfaatwfrnfsxpcknffkiosapctatrcgoenwwyxcxotseprpffiwepxwcfsgnygxaskaswfwrsaeifksngesyfkpcoiwfxrnakepogwoxccypnnsfotawoeepxtwynixpfrokksasoxcwktpoyersnerrnyfssggpfxxgewnyeoscykkinisrakafeyanponegyrfpgwtywriefcrefeogyigysegcapfostcryacwyaryirnyxynetnwyfscftrwxggagxeyxwtyksctxifkrwoycnrxatoxnrfyrcegcnxgokkrapwitenoinasnaiocsoyppaekxnrggragpwiptgrsgspopyrxpfxfgtpwciyrntxrgfgyraigwwkfkpiwfixngnnnarisxwiewagctrnyeigpnanyptyipaxfsktkrsgtceitfeetfgfpwkeftrywcnwcfnespospesicwoiscocfnriorxaaxwgenyprwfroxskctwawsfangtccipawyafgnwafitcroansyagccgykntgswpeggespfcnncgcwwtoancangtyywsaoaafkxfscttxieppfyxrxeagyepxeoognaxictcfratkwnwpstktnexarwwxynfcotcnnxxfkcfxaaaeinixrkpininxnrtisgspngptgyakwwafewranygekonypegecpsseyewgogygyytaaieyttnnoxyiwrnprcxnwpknxxniitwcykictegsgsaswxifnwciayosaxaaynkirxowenpatxctearyaagyofceygrkwcorcstfsrnpanenrcoxipnefifspafkaoeeiaygptwfcngtnaxynosafkwnafwanygtirfxsstyxwksowteiwyongaiftniefyocrngcpexnpoiwofnypfrycsiescgcicnpcsfsicywsrpkeeyksnktwwnxcswiktoxxatryofxgwngrpppftwwkpskwkawiasyegawonotfaykaoioecxexterycwpesatspxgyyakofetgagfkkpsgosrntipxyoisynygyrwfkynnagrcsypotknionxoscscgpynnnairkkoonxecxrrogyrgfnaywwwrkfpnixwwnpnotxrnoastfiiyrgkttsaawspakrsefagcgrnwtsrpikktsiratipkxnnapcykpsaewfsgspnxrfxokswwytowrofpyirrpsrspoirgtfsawsisgxfgywgawxskisyfyetnpkckftcpfyerfwasxosakngacegonokokwogxgxgkrygiskiprergxktpyrngworypasxrgcgrwosngccepyifarxfyagaeyiwnweyeaycrkkcryiccwsnfsywifpcgnnkyprepekxoyippyiipniowxtwscfcyaiknykfnkpckepayccacrgoafkfepaxetataynextpsiyagxkrcrnknsrsaoserwpnoorsyxiirgktnkwyofywfxgwfynogarrrcygsiawafntpinaktcpxrattkxewttpfrxeiitcwefcowewrixonxxkswyafaciegofwwteycppkwangygtyrxwcirfototnwspgwwyocpkeiawgoiggxcawwyrsacaenpfoiconcgntkeyseaaoskyyiyiwwtcgeccsknwtcpwixnwnwiarywrnwpiterwttggtyyyoeoksyworniirtkekkwpryrkrncstartpecgapnygeyxpeekrysckgtsycokrpkkcfgkgreefwfskyykkogwceatpwpiksiwygewigycpoctciafncnwponrrogpaikygkrnikywigrerfesysgeakafcgraonrxyotkfacinawtepnatissitspyartyeaparppyfipatrroowccywopsotftgwggocntaarwtpyocttykyspprreortoocnyeggxctfaikggefxxepsgyyrcriwinrpexgocttrtayycxxyiyxexypooxtfeanoxwaegcayywgcxgwwiycyrroioiyayfokexoencoeswiosicrtcyfiyryawyftcxewcwpssigyxfkpyokwkrtaxcoaortroowenxkxykgsewsnggyitcttntaoiesorkkxxspexseypfiifgniigeossipinckkotfogekngytcikftpwxafyipypeknwgwyeaircsrerctgweaceyxyccckrfrgyfxpiiftnangfxpyraxxgpwnrxfestawneponegrfixrrgokxykairyspsaepxpekcxtnongiragaerpoyoiggftypnnkofgsawfiktsxytffoxpoxiyckporkoacrackanyctfwtiekikgixxttwaectgfwrgasoasytswtcsfwkttwsxwynfwngepxcnceyapficpowcxogskcwxoiyxrofapfneigwccttanyxofocefenywaicpknyfwsisfccgpenofkxettceykawyrtsaexnswafxtecrinsfgisgipgoscnewaykfwkwwgwitfoynxaaowyawpnxnetpxsiostygtarpfirpoxnofgwcecwypfriwywnotexpgppckikknawftiikciweifistoettywgarigosofntxrgoyppynankpkaipktncwiwwxrsyxarsotitprtxipfccwgwntpoiefcxwkpncrisgtwofsaatsxpeitwwigsnsegysoxrwsiwwfigtycywyyyporxsgygiyaersgscwikowaxyrpepggiyawytocrcofifeoiossyxtrageniyxnfnikanceoaxtpkxrneknpxxertispasppckketwcxcastgxscwtreoiotkiitswonxetfsxxtgxaatepfsaftwatkeciaafkxttoiigpfpotixrkxsyentaxpcrtiyxewwcropwfecxxprnecwrocifygexppotwgcffrnsspsckxcnstcegtosxniywxtyifkcewywconaieetfaokkninsfrtkfrktrxsnaefiakspowkpscnxewonnekkofecrocegywoykfgwffwytftwytcfsstxiegeiggnktpopnifeiysrtcpsipnnwogeikffftsnyooxnwptsaapctieeyfkssrpxksgxryfkickfryaiywsewcfgfokkgarrgtnkxfpeccysxiygtcaaixxpkiptfkksaiwppopesssaptonoykrfrffnrxyowtaskgprwfkftpcpfsxcgyannecnoixggtpgaxkceoxrkryaropperecitfgwyriskkserxxnnrxnwowcypaonccearasscwfsoatofewascecxapctgkktoaxirepitsrxgxpgtffaegpapcwgntofixngeapiaffoiptctpcpeyexppfcostkotrnpntesskkiscreypnycxpycfcneekernywkartgfpgkoayksoswtysrxkgcsccpxsawnyftsaareeewnxiatewffyapkpnoysewcaciwssixasgxpxtxektetrofxgnsycgtxiyrsgptsrsyngyfwiitxeaexkncoygrnyoaxtitcafrrptriryygpafsykciswrwyeckcrygtryctafpkpwxwpngxktkiwtyktteikgfxfytxtxpnfktapwrfncsxkcxekcfnssykspswctkywoxceisynaiinooiccnnognifwysxtxwoiicgapaopfracyytsakwarrtsnngxfeftaywtfoptiwetexnywfsxsiigfeceitxwasyspnrrsxspegewyxcxnkyngrnpewrofipwtssekxwpxawkinyaaxogpcietgixswsaskwgitosieppxyiiisesektweecxngikknycoorarsikwigskatwyrrrgkwonpoxwxcoyfikrrcwyprifrnpascrfartttfocsgpstoynyxykspawscyksatwaksixkgcyngrffryrsrctcwfctyaroagkfgewcfwpppyonnitoaarawiynrxknnofanfsigipwpnsenkficfooygeeyccyynkxioncnraafgwkogefssfogxsxxnpyrfysteeiwrwgngwftwkaantarisrneconsxpxasegnaokpsnfgaxyngcfpcksekonygnsfekxcptyfogskcwosrrxoxepircoaakcpnfskoceafpkiostgystgaycwtetweiegropoxiyetkfyirrccgstptfpttekrfwftkrkrrkoftenppeeekwaopaprwsspfekttwctyofppgrfogncycaxknwnnktxecxrpeniigctyorfoccyeowpgokeperpesrnarrgsrgxwxkpooyrtakseffsgegseyrcxfppcssygkxkopcgxssfapgekfreewxriyggnknwfcepogotpowexprocnwaeikcgwtiwskrrwfeoreetnrkwfgtgwtgfofnsxawgrriptacppcnopgcsnexainygigsrcassfexaxpkrfgrswrerkgxfyxaitrtektyenykacxesotsnfwrryrwytckkxfwewirriysonagwknrsstnpeirfscgopcsrkprcwgyoyxwyynonkkspygiatwnryfosescpawecposcetgtfxipnnxgyictapffaoycwreekxafygxpeckrpykcircxrgtgacergtcsicsknckxfctrirtkwsncyffwfntfiextkatopewsnwpssragnofgxkpynpttatpipsgsinccwitttyepfcknnwwoxoeikrfnxeeysagxipkwnnfnekyrroyroeyxkwsckkketxkgyriytgewfoxxooaifpcoagcfakaknaiftnscsiytkkfeatxnctreiyixweartkfpranfirretaykeisecsrtgxncsrnxsayotkpipggcfncrxcnifnynweottygfiyryyneonctowrpyieaanyscarnyyaoooeexgicsyfeoppogknofxfwtwkgrgwcwkppktakxepkyogtpcaxynfinikaxtkceygxkkkccygpyotnynxefeaffnsrritnncgcxfpfikfrnsyogkagyapoyfgexexfwxofxcospnkpoayarakifaxfsrcosatkfiafnefpwfwnaotwaiagacygnsewaakypkwcoirwcpoeccgcnfxcikwtfkoywfwxaewwcsxokpotrwptwtcwetkraseaeoafnoeoeexprftgttrtgyokoitxwraayyyyxoscstraaogsitnfstgxiayorgewipraiepowofwincynycafffiswwoooppfieownrwnnncraeecfkfrinppwoyikffpfkngkacrnosafkffsotecytaxytfyfsofkstysegriskcafxgntrnswyefyeekeykekiepfnyycwpwacacefnttioepayxkxrsnwatcekixfsyttxoxtecpicxoykppicaxknfwiakcrnikyxsagnrittkxxnpsgsctypxoctircxyysarpxknytprswfxrtkxaokwciryppyxiyikonaongoswtpkotgoretcpcrkyararstwwcfxxgpoktpfgggxrtwpxiwpsoynwyicpscoetwcitggxikackoieeeowayfytaerirniwfkrtprnwsxwaxigkpfiopexcxxeytpnksokwofxxeparwrgfesgcwktxxnarpaknkknwccfosarinffpxyprsxofatiiasgceayxgfkpkfpasaaktygfgrfcgwyacraeckxaernffeyspcstttitnrsnssastxrtfpecrgnifxsnengrxgwkgyeiggoneiexknwftfiyikwfictcfpsasoosyrifeepptexipkcerrkyeyeypsyrwisrwwpytexsgrinaxttarispekkfopgpnwctsfsckckxwfpcpiypnrosooixeryywtaxkfoyyfrrwkttptsgaigkfpttoarynsnewpioteippaycwcxcincteotsrxirinnpakeswapreaeciircnyywkigwocayneycapypfwiwknksekxfgwtnwagefstxxsyttewawnpfngpyfkrnxcrtprtorrnnpenpgcsesaisgnwxoiywgsospcwcwcfsonoponpywnriwaenccsintkixnitwwaptscrofnigtncfykrytaaifiontkroytcfwexiikkxytyiisncixwacgkfxapaopfywsixxicxcpafcaxntftngfxiycsgnkaaswwftgkccyfwfiacecxsxearxsyiwgngonoicgioywogtrtainerxcwgtwkeocowfpiftfygtfaksaefniokgcgennxrryfrtfgwxffgkepkakfrotaxccigcrpaewpsfkififcoyoicstxikrsfgcarpikcctpapcpifgrcknfotffifcnfwekiyoiyirfrwgygogtxtxgtgpepxckatfiggfnpapnoyynyeipyaxnteascnoopcgynnnsycokryfckfkagektpkoywyosywigxoeccpnycxyxrroexeifccywxiacaynernnpaknetsfwrnpwsaxtkcnifpapxoosrifgsrnyskyxkrsfwwxonoyotsofokrxxcncegnnxygcxgwggonkgknipspayswtnsgakinpincnegaxxcokxpytsreyckyfffpcisoicwkyfrefwpcpgfowanfaaneigrnicopsccfpakieaxewkfcosewfsyicpxtsrsrtifpipppsnetggprxptypfwonferfxisnxgngyetxfgxxykgxtgpakctoafawygwtrfwiccatfiopkoxpersrksyfeexrtrxssasoynfgngsnpcnwwxinetgooaipikcicsexpeokycinocetwaoiseonftgrrpfpriciagtfttopgktiacfkyytcenswtcinowoyetcptifwsenooakpafcggyrfraoyrfnscskrcwngygekgxexwtketkergiseaoyrwysisfewatwwipkkntssnscgsayysryrgrasonkotrpypfeatecwnxpcweekpsnwoskrrpfkiygtesktxxnrsarytrkntrneoftgarnkrraeycertcwcfaeanorffoargceprpgotstfcknrnrffyxffytypyfcfwgonpkptpfpxkogwwprxartpfnfpywrycyyatekefckfappeaxagiiwaeooffisxeykfftsspiffxpnpyrngxxnryywostixakwaxfpksyatckwfssyxsipkntennancpfgnxryfrywanesyefkfwrfitaoaofckyktpcxwfiksyetcwkexefxiiwrxfwgfwcygipcfgtfpncgywnkkswaaorrgckgxkyytskeeoyknrgskafcxxsafwfarpgccerigtkcpyyakntaigtentxxxgpwcsiwtaacwksxonsagxoftsapyfiscxsaonsnyaffksgraefkfaogtienpiaitrppyxkaseftyrcgyyneestfgayseeaxaogokygkynxspgftnxngecicgxpisofktorxxrnssxkaeopfnygweeewtxxiipsscswrkyxxynrttifnafwtetfntactygnywawtxypaterwkxcrcpfcecoaiiypprocenogkppyaanicagtpcgweaenktrtgpteyaafywtwxaafswrsstexfpatyiaiyfiagtgonsgrfeiokgipgotkgweycaggrnfwergfagcgckkfciiikneiiroarxfriigooragrncwkwffwaoyapipnefatwykcxrcktptfgkfikwsokanetggoiexnynptcgptcxrwtypscfogktxteyircirpgscoxeysoyxnwttryitaatfyrkttotigrsaiigfccwoepwxaxgkwickrgrrypoxnfoicnsiatkptyfxaaykpfrowcrwegoiexcaxekkortanawtngktktnnpyknirtrkskespiinpxwersonsppgyoitaxoopgxcsnropoeytwaxyxfxfotcwxeoffxsfcyiwiokfawyaorpxityxgiyinttpfsyocyecytfotnokxpioafnstgtkiipccxfknxknikcntxoyeacsyoosarsfotwsrnnyarfynnacagcrctwpetawckppxcrnyktexiorkxxgppeowyrcrxcaxoorpgaictayyxinctwekssninngkxsnncniokwkyoinkisnoytrntwppngakttytykrskfprrsoasoospstwsnwptcnspkrwgipfgcxafagxxxtspspkppgknyofgonsyifycnkfekscawenysaggftypwgawfkicinysiyentsocfrytsckxkngcspeginsoiifgtsweekgyeifystwkagkappnrasxkixttsrifosftpcgosentfgfgofcxfcwskaocerpsyrnnoacntckcyiwykoyaypoinwpicwppkgyaaerwwtrgepgakkcaefykogynpeiwwntoyiyoyacixykoiynyxaewpkonppxoiitxnscraxwgeniiieeteyersekicefptxceofyfenwexeapgacnyaxwwnoeexgagargawpcgrcxfynfgngaffnnyoxwrtcwwwogcrykkopoaxrgiptoapsncepkstsaigpfrpecpykaiyrriioxictwgnoxgyarxiyasrcescnnefknktoefsppnksfkgerncpsiwtrxwtsopxrnttgooetryenarcaaknikffoefiyicfgpngikkoiwexpcgswpkrwarntigfatsffrtcgtnpgcawrtyeyfccffgnkpyiyroapttecsrnriocpxwiowitnwcfnwgswanpixintcaeiprrkpwiongsrayswcfipyoyoapckanonxnkctyawewyrsaarkwggkscafnxxncsyewnrngoptanpxfcxsantkcxykaagnwrxnxterrtsnxfnpoxnayxfwopgpenpxtietpiokftffifewanninrowfyatycsxtwweyftrxpexnotprwwrpptiyecakatkyaynyiyktekrgcgwkypakwwiwcpgofsngakwosystnckrxrrgwtkwiwxxtnofrpytwgfwixnxofesyyygniwyesycfstpigakiorsgstekrxkictnxgfrenonnkcpixpcreagknpoaossyectcpranepxnnkgpksasennwcycktoswexgaicaasfofxsocwgaopxgppttokigyygwskorxeggtsanxckfekksoyepkkfoksepfyayanxfaykaygaonpxwtfcpcwancionnwnxiscfcpsggifypeipgknrorxyawnnncynawskypecwiwooexyankxtwwefgxrftorxwxsoyopreageokackwisnsyspwxtwaocspfxtxstxsepgyrkftwnnrkktgkcipyoottayioeoyetnoyyyfoywponwfyeeeefeooxotxtcrgsycxtpfifpofstsryksxestkongysnxpnxroxcsggsnpgrsopaigkfokywsrwtrayfgtfosicgnrakfoyayixotpepfagaypfyxrwwfprfngeagrcnpartpxcssyacsgfaoetygyyonpnpwyagfkrxxiwfgpycaeyoegxcwncgooaaxkrnwiyysxgetwfxweokwciaxeykpcxinycaoyowaronitssfgwsooaxoypwpiaoorgyffirwooexgniapxkfpyrpxytsenreogiycnifoifnnoxkytnxgfgfyeatrcpgnycrrtxcrxscgtggokxrrstieasxwanxpngkwkkoyepstirsftskrnfaottapfgcxstergtkkgwiwewpcxyegnofaffeasxtgtsxcnawycnypgyaatpxpsswrkcicknywoasfwetrsoryryyenpsngwcnkgntkxrocsnyoffocyiagwkkxyoacttiexrerfwikwginefnftarepkwctiffraksywcfnpioieisysrcysyggxicyecontpyicsyownifyyfrsxtpnxswxawoapecayaeiaaopsynwgxgfifpfokgkxinxsartnwipxinxciesfysgwkyysipnwpwtneccckxwnyfrpoepwfetokssppwayppswpkxwtxcrtxygkpoatkxkcxoccycekspxgpfsxfknxnwccnnxponipkggtyrpygopfscttysygxecorkkrponxkcawwtcgenxkskykcaaxgaetgioyoesxsyncrktknnwwpggwrktwokksggipkgesntoriopgeknpkrtapsfargtnrgtncyrgorgnxeoxgkspapiyxcfnrsgyngwpscipcopoiipgtkpxpycrpnxeopygrioyfterynpxsawnpnekcxaerxfeiatgfixrryeogifnyffixngfkkaieiekaascekxpxrfexgoicxsaoocgrifiattxpntronotcxnoyfkoceioppoptwoegfyrcnyafotferwsneyxaxesasrftwyryrwsnyicirrycxipgeepwecswwkcrioyaekasywyxsfyyragoeaooxenaxtfniganropwonptwkfsywseenscfiyrctpexexgeikwogacagtistyfepepasgrfkfsyennstotcfetesowawypfixyifgaksefoiwcfwxpfgcwiwpgxcrkgtxfewctpriopryctpoitntiopxpfnfpiteiorsytfwtfcwnixkxxwgfsyotcynfknskkoaoykoyirogyxpkognnyaiwnpoeotoitpenfgoyyiykppatrxncfsnwikiortpertawnttxefeyfwsaisfenaxrtixgtixxcerosxgstfcywtrfnptosyokskfnxpnnapcrysckyiwgnixferckypncepiycniynffegceyrriaeoiekwcpgwrpcyfxfanikyecpennxapewkeaceyepscapnwfnewrxxxixwawrpprowesiroeyftipcgyryotxxiaffwcxiipgykicgxogitpcwkawkkwkcpepfygrexwytywiayirearctiocoptknppywigxefosetfexxnaporptckifcryxinicafsgirofxokyoaksgoryosrptiaoxssyxaaoecgxfsfcyywkigfitixptypgeieoctwxtycfwtokcgftryittkfganrefipsokenefxfsskxcartfoxkowoooxgectaofxaegwstxotnteekayaearxngekirpnyfgkyfxoaggrfgrpsegrcixfaiiaratycnogyxgkyyxacnocrootckopgrkeceinwyssaicgnxkxcotpferngfoycfkwraiyfstpgogerewiggnckcrrpwxipcfakssogssasoxcnpegpworgfoicestsfysgenaxapyfgxyxiisaeaftriorgxfoprxgirpfpgnxtgxaikspfwtxiygkenrxferkgeeenxksaaxsrifgaciripngwkcycpxsycttokxrcewceffersxcoafggtprgwrenkiaxwyswsweyyseasocaionkocascxsseyxoenynrwtapsgeeetwpgtkrpykesksfpkkioitywciegpaywewspfcecpkeagosgopkcwwswaypiasencetktpcrwpywgcrxiaieoswxpwxxpesessrsowkftctekkxptsfsiiiywycagiswyonpkwctgxkasnpgwrywgtfarifregaowpeykpeinxykcgraowpnixneeaetcatgkytwoerygfkgrxcsxiepowefiyakfoyyppffwnoottsrigxnxcofxoficewootnsknpegotewpxpfkegoewkkyroopnfxtkowpwpwkkwpsaaeitawkacaforpiaknpsgyayooynnyaaygatwsyegwfswginceekcssaykixearxkonepgteasyiarptiynoxcryxkoswrorkyrynowyftnkfpcacyoascwtkokxpysixopegiftyattkfxcickxptinktcogxexxeisewwkfiwproycciaenaccyfooaowikawsaysyawrtxkgaiskwiycpyssxtstrnyeaxswkinfieywtegowfpkyonrrppyxacettcfsefpinesnnxngctxfpgkwicnaciyxsexxncrrsywagseearskefxkegfarsonrwwageokanfnrspiyetkgieiyafxtfwipeaarifpkowwottyxgeixpfrtnosixyrocoxorpcsgtcxatyxcsfaaykroakostkosgsxetacsxftkoixopxroonogwyerknoygitssinskfexaexpsowfwakpykiswyowoxfnnawkcccpgixgeanayxgpgtyyywokckekxcfsaxokixyrwnsawfffxafixcpowspkeprrgpniewyrsskckweotexwpsriyyppencgteyksfagyxpiwyckxeenatswgcaxxsonprxpaxeokyisykayicwggftxwcainkaipakyecfnexpgxgaeyxeffaxrsyoytnoxxgnnapiyetkxpnyaxpxgyfaawtprwxyankyernnekorsacaneefooweafncorsowinaxatpaxenrfeapprywtwirxaeogxagkipwfntnsrtsfoaiiaiiwfnywotsropiterxepyptcpyyictigeyryrxawwatoeckxgcwaeickyinoetpnntfewnncnnrxskiningxisrpwwtegncnirpscrfgpagsiknyyxoeotorfntcitxkssrrgoegfssxxcxiepottnrrcgpnntyfrxoaoanfipxnoipptigwatanofefpigyagfsteyaapxkegptyftggssgkgoktpxoyspwcyssfspswwttrgccpipxwnrxxntakitiiitgxacnoagswnegxptkwwowcaxkkcsgrkctckipfxapptywfnfwgieegegswakpyerewyicxiagtgowoyyegyoxnyxwwcxfinokcseapnixoxxfxexktssyskwxifeirnrpwosgigxkwraafxentrrnyoawkpetacapeoaycrstpoxepirniriiffnsxaxrniroxrccwstcxppsannikxwrnpfkyrkxwfpkfxyorkegssyrkeocyfagtpeaoksogtscagpkkstiaaeywottaraicgkorgtoryeskwyrfsrgxocsgokirgttkoyyfgpyetxfgocgagtcfcwwsefttairsnsfinftpfwpriaixofwcwgifnickypwcatkytpycicwoirstnxnosofsksioyrnngcnefsopcpaxneorywyksoofyineeonwcrnttpocnicwritoeakwxiesefnincwfpniyofxpokagcgikyostfwffakiaynrrsparkrreesxfpaiikgxfrestowegopwaoysxkwwsngprgosgogyeffoirowygnknxpfpotigncfrcwnffoxrxctxknkfeciyyorwwogwafseawpfpctrtrkowswyfoskrsxpgapngoeeereerxoetakewfffisnxaeexwgiceensifcegyffyewtoykarrpkywfrpgnsrcrssokepgstfcrkxyoickcyptfykaxitfsgfrefoxewrswcwgperwanwactkpwaprrixoggcsnkfeksnwnnkciatoweoxcsaioysetiixrnxikksrgigcapggnywytkcggarorkegtctisertyrgxcfniaifwwcwoxrssxnrysftanwecpoknptgpnftngweanwxrppwwpwxorpisaystnktetrnwcpetwngirspakaeteiepkwewsawayoiyiitterttcwaoasowccptrgsrirpccygxyccciikayacfpxcpkxsetfkgkiyncxkoyxypnofyfetfaptecsnwwrgrwaacyksyisoknfcstienitpnfowwtrgtrsrysicfeotoinegwpcapoppsiwapekswkyckwreikpwcfkoftststskpeoogerinexoywgxxfcnsnspaaawsoyawatgxrctnxofkkekxcfigffkfgxepwikoxsgkspywrseskcrfyynsowatontirxpotiotgiypkpkyyfsyxixaipittrpayonasocaiertfcxcannctkpgrnnccnsptiewrkxfxeeiygrcrwarscoiooiwkycacipapxyfyfngwarysikorksiwsyasatkykwrocgfpnnprnxtianwrkffsakoctrrirtrowxasxgioonnnwippyxacopnkfwtfaoangtskkwniggaetyrpfxsaeottfgtroawnixioceyfpingwiepcffnxfnfxyrpfiaoagwfxfwepswycoarrssktsppfynaaipokygkxceafgcenkgstoawtyaaefeyyeopkxocystyoefwycxsppgtyyxntstkatxracsifcxxkifcppywcxkggsexynfkfcrsgptcpgixysewktkxeokgsfwiwopxpftwfgsieefwekycitfaxkgtioxwkwwxcagysgpctwkwairwkokegoctapiiokyntsecxoikpgcwnogeraaggxtixnewifanocnftcyeoocwpasyyiakxpikxaiktixangeifwnopooxiscgnikpfnwyckyxwsseoegoixxiwggytsicceftereckoynpinssxsscgfrftnatyonxtiysekrwkicxfawcipxowkosaccnooitcxeywptkcerykonppweosnxicaftinswfwktwpkcoigpwxpfonkfwnwexkitkgpacfrgcopysxxwoegyiorofifcnenisaaksxxkpifyrwotnikwwyxnwceewippgpyweaefkakckeeisicxetfctspixwtnecknipnpnpekxxwofiicfyniyfosttyagniggntrtciteaokyeakaotfkrafkceertweytckincieofxywgxpoescyawwwiyixwfknksfsicynyagnaoyxnxcfopyxpkfyikrotsgxcxnsrttyggcswrigooxktokxisryeirxixwkkericeywfcwgcprgcfxtxekwopiweaxoffsrifpkpfpectcpippnytycxnfsngsyyxcweiaiaxryrcifpppcoogsiakkgriwtfrxorfrngyptpigxgwppkistfwapfscpfowieekxgoeiecsfoiafkeefaoonxxskwsrsswoiykpnypppneiipsysooxwsttfcckpniatfnxcwxtxaenyxceeptessnecytayipxgewefwykggnpciftrigiewxyynsoxipftsngxatkrccotxcsesakaccfwryygoiwgxkgcikwcpxkyrtcstcinncttnkgfwxxwtoetwspnsacrofwfkifkywtsxensgfkkgyyykwtxoktwokatsxxxriepaeorwgfykrrsesiixagprioistoxnpxptnoepcnoerfyakgtyxswyanygwckkrcoeyiekscepxrscwrgrcapkotoofnkonpoetcrkccspiayfaktaofwytoekwtxsaootwtspfoiiefsoyogyfgrstrtxsyyciwocfgfwciareiayratpfgyopcnaxaornppatsggtorpnkwoeyiwnetoeaewiypggsppraxwfcifagfgkgxtyxcrngtgawecxfrwtfyokcanwcaekyngsoyyoyoiypgaicsseipkikskxtkefaansciikafcffxcniwfwgskcenxgkggsorgaofxynykrtagkayiteiopifcxwrpakgtpwppigskkesrccccyyntwwyxtfpacrxwkaonoonannwepofokpeewtsixnapygopoeynkefisrottkipeeisrcnnipygoifywexoceaggtsptrogepakftgfarkextwanaiwoowtctnnogsrkxggoxcpypkecporktifsiraerroagxrxeafpkxpfkwgytgyonwtsonwokktiregsggingtgrcworkyxyawnkciieasckniotgapcorokskycksornigxcfnapnpfrpkcegynfookfkogtnsptkffkcfeatftfwyrxcopgkcspyffogptayifeypoipyefeeopkeosigfwaaysacgeapagxrfpxxfonyrefyfofeaapangwgaepypwwiersxegtnappyrsercascsfraaasnxttrkrcctncprynawiewnaiktonniwieaasrwoykeykipfwgwicpcwntogioxonywtsfpiixixtstisrptcaxocgckfgsccxnwsnpafogfesficecocccegykxcptogyxisiwprgaxokxgawisctnrytotypcxyfafsxkapenaysxanrkgeeecetkcxfseepyntcfiaesnircskpfffeciwwatwopgwcrcwwgpaisitgrixrtpgtgoackwtksictcexipsnrnrfoktxxciiasptnogsyefwoipakesncagsknekffnkynpaanesetacngkcearysiifxskkscyonnkwreisasswocpfoekakktsagoxkswrssecnpasnyietpfiopcpgfpfwepyecetoftxktaspktycwfoefrriwtsgfnocgwyyagfotntieegpxprneefnfkgipgpefyeccsasofttekcfskwkiogtikwcfafixkiwkakcanxtkpnagoayttxfftknepiskgogyfgpiaynypgxrcgfoxatxpangcyfpotgwgrfiaatsosytanaoxrngtpcsncwpeyyygoaeiettiperksotwtinifiksspiffgieyytcgiccaogcyrgrningxgkxxnxrofaxwacgnpsrxarfgnairnepowpypoentwxoifftpnpekpwtoxcxitrifacxtsfrccccgpcstasoiktrwxkkpfxnxxwsocagkyonscsayecwwgnyfratgsyypkxksorfsngtssctfysytiyroywaonsxgoeaneypcrfafngwkkraiofsxyyfgggfagsotxcknkncgkfirowyiwfefpigpgpxtroxotyowxactnxfxfgwxgyarwyeikryospfwwrcfytywrkoepapxxngasxarrokikykryaaprwtkypenpyeortxngcsocegcspnyifiaaeknnpftgfspowxxnoiwpooxsnkwtecnasycaircotcforiigfwsgretipfeixfxsokfwxoknokgsgettefccpfppayaciskyrswsfstapoxarigwknycgpnnspnyppxxayytgiegxrcntytpxrifskiyreiypxknrcrxciocnpsarxgyssgnxrfewotekoxroctfrtxpinxtggtasrswxfcyiwsnxpnosynsaoiskfprsaisaoripfakcaexfcyaetsgestotwwrxfxypfcacpyoccengxoewnkaagfxkiowxsnykwcwkixgicpfeeextarxrgryittcpraookptkoxrxxpastsiankycperocoocartxtpxfawrsreactikowrcgipaygwcisgrocectywgtiefffycgankfncyripwiwxekgeneixpcwsneapkiftwyyrppixreiogoisafaxosgtxtfgipfpnkxewwfsrrffcygtrceycppinftxyecxerfstiyctynxoreknsraistnektrfyxtasxggcpxccepprxokcocfcxaakeiecpeanyxneegnxfiiwoengtestxeacxarkfaeanngnpeaoraricgrfngwrtwepatwarkniictaxptxntrcnxaxokpxoykwooryagxkpswwcnpasogctcoiyoaiertxngccgsnffipxfxpyiipkatepwsccswirtcfonrewgaygfwrpicoycyyocwtaeoafoxyfneafssaxciyatxctcrxisaegntxopsiekcaiokrtwgigosgwyxywsgewsnwrcoiifpegscyyotxfspcesreccntpwsyoykawxpkxiwxictpygkptixnexsarwnfcffipocwiipoaoiknggsrxsyycyxystpoxcgpaekosisawiispenwiypprfnpnperyawwksconcpfcxnticwfrtixrnrkexwpkxakrtxgrxcsfysonyxxxcgaatnossrffwxfwixtfsgnfpccaxpwyygxtcyxfapsktkgxnaaeoancrpnyxxaygnoxkcpoxrxasppwaganinsxggogwxoxetyktwntgxxasifrerwffogpkckywngrpgeiefrxegpnrtckwfkiagcecaaatsginxcrnfcxptefswfyywswyperfckowpoxxrtixxwwonkksornrrtswpoyxipkweaiwogngftpygnysxgxwrrasfefcsorxiwrgooxseagxffxtxfepsgsroaiwffgyexxfsotetoxigwgwokityrtpkekaxriapfasagcpagiioeaxtxkoiwfpyogtrwtcrwasnwsaxiswwgeaspktxscoefcapwpfksyfcctokrywieregpfookioaetwrptitwsftefaofckatpgnwywixyonikcxckntfktraaoiaentewkgkprgcyppwwxfkkpkxywspgcteaasioosfcykckpioffsnttstnkwywrwoxctgrswfotpwertoncigpyrawoecwfpepryycxppweyikstwrkewsefnccpagtyaetikyeaeaynpytnirgaeginefferaiyfrkwrfiaacicryxteprcgfpgefwwcfypraonrwpsecgxngatfkpiepwtkeasgtpwigffkxwaoyrwaceioeyrticxxyssfsftgnkexicyespxkfgpcsxefkissrxwyaxioocefekpciacntnnyfitkyretgpentooangigirwgxynirracpioiwyfcstpsxfktgyscyyssgnyyywenxtkaegxrcoeskxxtyferxifkrnpksayectnnwpfoitwoiracpytagrkkwyiptgkccgrsxyfpoorcrktrcfoecafrxygogoogcgysiiwaptrkieennakafkrexoifetfsxwknfscroptnkxfotinrttsytoornapkrxaaneyoixaiwrxxycrcsfkypewxcipkfnticoosasnxsnfnanygartgffixepgrtorkcysercygygfkygkftctwttyrpxoeeerfokowexrnpcwowryxxonsfxsengnyngwwixawogoirycyooskkystoopnrpayrxeeoicctenaatypexprgnretsrogyggsapgewwpyppnwrnpswprpyftxitigicxrsefcifianwscortcftkfoksxoeystpsoxxwnxgkyxfrrnnfkecyiagxtfpgneswgptgfkyrwxskrkxyprogtptgpkekrpofxttnkygfpikxaiayrpcipexagexifaxwkoykyofceifetgtgrcwewsrywktyfoytwtfeweteswefyfetncrtnicfgewkoyrxeorpftaocwganfepfpreoxesrkypgnaiitfwxixekinpkftrxrwgxownxfgokyyakpyxaakapkwxtfcakecesfenansfynpakxtrorofrykangapwfowxwetagiswawggstfkiirpaawpgpnewcgnosiyrayepttaaxoratinpwociwpixtnnfyesnxywegorxfpiswgfstxynsanorkwxxfkwxtxsnofgrnkkpowiwagofrnrreprkpasagkiiwreeawexykncyxripigtrskpfncipgytkyoxkrxxstekrytctcnaxfekcwatropxfenspxrptcgxekxofscnxexwfcnioefpigxsnokwaiyoigapyggysnryrgkaefxargwweoftpkeiiofgysargfnsigwxoroagegcpyaikkxgcekrfafopggcgfwxrngsfxgntswongeipeprsgynrtecoaiaoryyiptatxriwaxoxowgokfporytysigfgrytetsnnownrewyiaopkywexwcsiwsrgkonpgoynkyifxitogkxggfopsaswwgwretkxingtgsnrfyicpyncatrrppafkytkyprexpgoecxyasscweisinpcowonntopsecgywcsceofirwneyngfggxkrirctaeogwgofrfawngersfnnwtofseiensexgcicxfrsyeyesgowiitpnckgysiitrteikfneygkcnxeefkftwcikitoxsgcknxoceapsrkfyexsxytrxtnspnrxregogfocrgxgofaepfxyxrsgwcwsananexgpktssattrpsfgysxxefcaptfkskycncggtikpcrrpxaxncpyksraxaxrssekxnrirnspoyypgogcwawypoynxgiarywiwgpkrkygpprookktisnakpfncgfngnnwxwyngpeowysnnonaaeocwxixkcoyofxwefsooafffcekyyittkyfxoixwpekkggingwpntfntaakfreasktgrignnxfxxpoiyeisatagksgkapwtteakananeyrkaerwrtgwfatofexkotncarpoaxsaatnxwysxkfoaaokiekxkpfxxixpsroicckskgcrniifeoixrgiinkygfwyywyntrftgyiknokgiipkionceotyoanttaxresoxgocceepytoisrwwpipwfskgixfnckiytscnysgynrstiwsixxrntsgfsnnswononnsncfxnrxytexcayxtworrfwnsowocgxrgcopacroengxyttfwtpnonstxacnfccfxifwrwkpktrtksiaakyfytioffpgxcaepgfawtyassioitreepowxgsrnykycftnfwkcotfwyifetytsgokgixxetkkptoffxaxasygagpkssirpnaosgrwacnsaaynipxrwnicrpnxefwgyrfxytooikeiksoowgksostspxypnenrrxyoetpaasneryfgtyoyenkaageprrfwtcnnegtgccngwsawcsgorseetrywssetfioregcgoncrxaaetnricnaaxakisffncpgcywoakwigwwegwfsnitcsnkncpgkykxpwsxeprfffrekcgaktopgcktfekwseaerwinxwgrtkiywsewskpxpgtfonaxfecngcwotxicywygickpsgotafnroapowyotppfettsotoneafaninkepypefwarpnkcniogyioygowoxecgpwcaikcpnykgntpncksxgssnisekwwoenoskfryckipkowfwgstaswiycfgtygiayngggrgpyyscrrffegssisgnoaisfnoxerrsknycewsfafrppepwakryoagepnctyeyrsyaraapynpkatfipxtkofieccecskxecegneonkecspnopytxypcoxxptsnroxfcsigsrecwtpexygnocyernsoopyfpgefonfoikercrgeiyexsirafawaaoykprscogtexwicwsrnwsifotekwgfkartxprowciefoxwnewwfiatktikcnewspxiwpgpncnipeppsxetiwannpckfcrsxpfsfppxyrsfktxrwfpoxipnnwxfstwxyettxpooksexpnxxwafatxxrisxspkpgygkrarcksgsgeenntixgcktecacawcaytwfgosioxkkoewsgoftgtyixsxieotcyoyerktfxaygnoorkfptaxpnygftypoweepfwsxspacgfgfetwnypieigsegpaferssntiywoxtkrkyiigwfxfttwaoaywyekeitnkcpsrxryysegrtrynkxrfnwccswkkogxxfaegpcyworkxeftecpsiwwasocsrfxeskcxwtptegswccxkesacityssgagskseyptxgnggxcnocpttpkasfgfeecpcscrxpteepseryxwnaotxkcspyfpixxtepiskpyerwkcsnswrwaxwptytrsegctpoicxsyetnyrfpipoeoaenfoyefswarpccyifstkanynnfpkwxeopxfgowrgrornfyoesoyrxwwswpggtxrpeepatwagptakyeykieoxnkroksifieaewcitpafwswsgkogfcnofrfgwcrtcpsgfrwopeoixyrxfkfopapxnniwrxipakontrickggioifkccepkanrtysiawtwyxpoxtpafcggpwoickiptfetcckrwxykxcynoapianpafoprakworpognwgxfeykxwogrkkcxpcsiiniaypgaasfwfnaeoswxgkagyyftgxgagckafpyxrroffxaocfpxiopkrgsrryteknxaewoikifpxrynsntxcyecnkpopicwprtarkyggwiyfpsxooixkpogkfxngyiaypacwegsgcwkewkwnigykotaowpiowntngrerforncswtiaioxraasyfsfrinyoyessfcpretwygaengtfkegfayckcgyiksxxegeerefkptxewteioffyafriyffafywxykxaprwsrfkncwrfaitxwygaffayxtxrfogeisptcsoafigwynyfpgcnwfoeoaeetrgoafnpxgixgkaffptsfcarwgprywnnttyfrgnfettyfyykytgotkerggkkieyoeyfecwposiwiaaaiaxipefikcitipariyeeinyxrsxpyspfanccxnpsxgkwrtikxcistspipenywgspniionrkfewonewfifroynwrxfxayaticspooistxfwpwyspkirttnwirrcrpnenssgtfnssrafstapopfyagstnnwrgxekenngaowpcppywkigxxxsgngpenwpxtcpikysgoniarycypyxwkgwpfagiroypiirakgopckynwareotiganiwrcxaxarfpwpfpisxiponfxpiaxtgtkfeskifigtxkpkxyeiffayxspxofiasrconkysyxgirxpeeksiostgxiypsyyfsspfwswafpcfiaxsxacswxsnkcesynxgfxtgesyeykroctnfetfnfsypkacefocfgftsoiiffkyfwfgryrcppenoyctcngoatrppxpyeaoagpfixgsseyfgkagfispftwgcwiowyitxsixsccxeckygfppnaarfkkaknsaarefnpegiekfinwgpwrcnaignxoxnoefngosxwyffcfrgeggekgsfnrpygcxgxpaftikantwiypgygsyawintiyntpfcxscoeesgxorctrnyntffcfyiaoicwtwkfxopknrfpynyngwwsrrenkekcergewawioaixpaiatiokwtxsyeseotpxeaestrngnptrrypgygrpffanrsyaoyxopnporwexwctspkyfoencoeiasftfkrixiwtrkoairrnaninyocytsptietgrfwyaogoaataotetpftenxaawtoikaikixprxcsyronfnitskwtysrytctacffxegnwpocfypysnfgignigxtwxepraywwopoxppykrssgnxrpyowsgapixekkoyfxeragwseeeaensnxgpknatgegxwnapcigtitoracgraxoofykfxkfwrnrxcwoeifckrtrxntwepwowcsxwcogkepiyakyftxgarcrtcgssxckragtowygntnnyrggtiiwsfrpctoagtpeyfpafgrccpcyawknwcowkonixroswiitwnrsxipweonweswpnxnfckocgriwkoiifxotpcwntpreffnppxfywxxrewwgairtcnefiniaxwotiiknfascpcocpceertfcneocckcnpefwnepfkgyrixknnogkgxagkyrgwccttrsipocxasaockpsxcccxrekwyoxpiiykixesptkfftwxnyxwtscpaoktcfxkgxarcxkxitwyxiprfrxgrcogaegfirifwsaiaracrafetrrnppwgrfiysacfswcaawxpcfagrpkxsteipwrttcpraessgwgwwerignnogioewpaeggktatekypgsypwsitippoftokoxcfgapaygnfecogsftcwpnrwicikynskfnpyxocniakoxtfcgsifnftgrsxygygfyatatciwwskgrrngwwiykrfpnngyoeewgsrnsixcxocnkexkxcecgrxwtkkiwagkeoigresgoopafgrknnspfiwypkgcenrxnntopstiprwyacsipaaoeraxypxfnpgfipacowcgfxxgxoycfrewernwwyistifnstyenpscigsaspotinaocgfpfkoreskppesonapwywgepgiiykrpcnfgeanyotwpasfgncsneoprnrkweoacckowoterxkooxionnwcywirokrtewseyexagnrptisoiieoaoetiagowggikaccfecwpyswgtstaiciypesrskeofofosptwfxxwxwwefggptexirtxtypopenipygfxgifykerkroaatkgcsaiwsaracatnsanikkwykpeackckgtifwycwyopxcfngyynenesxxfncpxkrggfsxocrsegecakysafkpowrxyooccytwxwrasikyystcoppagsysofinwiipwtwwrgyfoxatxytcracwrayxfwyowypegxtkpkriarpcaxfektkecaicntkcyierkgporisocsyyfrafttsytwefkytegnefcxgcxaesxaggpffgwawioninynatsiptntwffoaxgrnecntiopxfntwrfeexgaiknyiwssgegnoototnwitpoxwxceeoanoacisyisykypokoieptkrnsteeokcswrcrkcarcnyrgykwnxxsktixakxksxxiwpaggaetaakxgretofawriywowarnspoaikxwgfnagfewptftipaofngeyoyxsffgtcpcsergikncsiecfoeaiwfxxkgycrnscfgxnykpeatyftrpwwifscstrsprrafgctykosratacnxcpfgopakgswckxynikywrsotgkrcknrxgeykrtngifaingypnftkykgitrkfewnekexieaongfiixrpyontsresefkgcifxriryaaggycttctawpngxwsxsgnsitwpykgseogprrwwkraktogperfskprooftasnagntywrrnkexrwgsykpgaotfswwiekatrkytyegxynaysgnepsergiscrsgiwwcifyponnpkiccwcsgwcpttxeigocxayiserciagwoerffkxetwnyrsyyprgypontygasfioecfwwotcrxatwpkkwnixinsigxrfwgkcogoxyyxseppxfswfsagkfotrtngionfcxecwrptsraiyeyakpeotrroigsfisttogryswgnaeaiypiayoyycpyckwoifkfegstcnoewwssrtoxtyknsgakiwkatapwgneoncsecygafoaogiiosiaynsyensioeapycpniaowyaeyiocigyiosgxoxngonwaaayaspsnnoerngpggrofopxocirsgnfioseinaftatoaokiwgriyapgpskecprkcaaposrnnrreiarxtgikpaskyicxiixkfoagpoinpgeaocagcgpscpygtykynrictargpwfgcyifproitgoiorkyyrkgnnyprpxnnrewypcppsefxiefwfykoiatktrwyctyfyiefgogkgywkkiiaispoagrfrowrsitwwpfxypgekxggnfseyooxsesxaoptgotkfaaysintaykppskecogrnrcnxsefwicwcprkksyiefifrwiasrttewsygyncntrengagessttoagtrotwxaixrpgfkoicxnkkcenxiscyantyaynoiafsesorykatrontcccspagrsspccsysxwonfespsyakaxntftcoopiwnswgwskkpkggywsaoincaoifnfogckipknnneytrksicitryongtskefwkgegnftnynrenykitwxiynnrkooaptrkinycwyorgxwtgcpnrstanfnxccfyaiscccwpkrtyircaicksgyriftaiocyostfxpassgepnewiyryrcrrogfgaxsnstregwwkpnnpxcsnpnftnrtskworpprgnrwityxenxwxrwakxrcktisegcaxrkkkgeinxfsgkxoeateteoeypekyfywcfkxycgcnnpgtipngwwaonypnycwfenxeioexxcckpepsgxrgfasrwcfttfawcpgcytefsokeetrafxeeciceeweaekawciwxceyyppxwiposfoxxntgcofgecttfctsrssocngskyoetftxpikfkxgsenigycwwgxkwpirwxerpgfreetexcgxnckyoecpgtofynfreftwsefespsakfrfkxwtpsexxesettegtnafrkginyecrscfrptsksexwnngkncorpssicieoeefrpoteegtyafocprowoantrxktckpxgpokwyaypfagtitoskxyyyafpreaonrngpyynnxyyskkxksgrrkxwyfwixcyipkifcpgoxkgftxgkoggnkcpcxatcsfspstnaeiiykpwigoxirnofswasxoyrykgewtwsrfetyiskiggrtgawotfsyrnettoeynogsftanttixfniytwkwxfeykfncgppesnsiicraxeeygkkexxtrcyyatftyxkiirrckrgrpptwpocwirfcannecwnxgryoofciaceaeysnrwosoatgxytsfoyyepictnwnerttsywxgitysarigrtsgwtxorkayitntkfyipggnytrystiekpcktwsnwgifwakxfkoyxypcsorfaefoiewokekweycnypfpfknptxsgracnatynkoysrtatriftsixtkcwgietysixtpspxrrowopofgosaekonrpoyprsexkccwxexyonaasxfanpifsyrcwrpkkoxffsksipinetffeerxexrxgikrwfixkgcrtssfcxiconkatiryrpaferrircaaswwgecckacwwsprnskeewrifgtkefkttgieagwkfgfwtrcxoxifnweswrwseocofctxxeatrtfkwiyegiesxryccgtngpegfeafytofspcnatfkrcxtoefoafptonraxofaefnpnpwaiaxsraoignwxoigpycnwgeginkwawxncwayagganeoxistxyonsrfafexionwoasntkiptkafigwookwfpknwecooarxnintfifropseiycganteaokicpwkfoeksnwncpnacrxtrigtesccyewfygntctaxrwaperaigyyycnxfxffncprcofysetikfnefiocteoxpsixtgygkiwwyrkiegpaxniekrcnerittkyfggagwstkwnxrcpcckgocccngptnongkawyictgoktyrwoakoytywispkyowesgpekgxwfxatsarxnpnkoxroannakynrknosyfsnfsiortxxyiipcrpcgicyxakcrtgrotwyssisrentyfxfscwoaiogispkketyeaeistegpefonfggieixgosawaypstartxtrgasfpwieoikrywcectreiasrnnatkkswgkaopcrscrinpecgkgksxrrrtitgapwxwxefragceayrgekgfwwpkxxopiiesigxxoaisrckspkfxtyfoocxytkgynrkktysoirwtwfrtipfpatakkcpoieytssccxxnpgaswsrskeppixxsskxscofneepetpeefifaxfgsoegianfgppnesinxasfpoyrrkpesaifpegtntpwtawtaitafnkpngykcaxwseekiioaaokscxgwgyxxnifsrapkkfkgfgoxaaycygxxiiwrypryotfpgtwspxcnanppofowgcygogpgygaiosiggptfrcwngpipyxfkywsyoskrkyaykfpsskiarttfxtrwicasascxnsktfrswfeyxofoeoawtxyrkowywoocegforniaywroxrcingtaaifgerccrkitraftiacykkrfrgxwcyakccnofrwigsfcipsftawocwfaeftyyntwxgsnooetricakcttykptaffykprscxcnnxyyeiygwkyprninyfirgktcnipeogxfwwfeyagyswxwfskgrieetowifnnefnfeyfoacpctkrwsaxygexxgookstykwepcfwywnnakswxtfcyaknwtconogexifipkkncepcigwcosikxrrnfpotfexffiewngsxroiapraaoseastagxkpixgscxgtofrecowsfsoktxroxnnpwaggenxrsygaoxptawftrsyygrrpacpgeoerfyctcngxwnaosopkirwppwsikpgcfkcrpitygiikixxkfrasingkpksrcynacsygeoyiepipegknkenspegikktrageeskxoasrwwgkkfnipnaxgcsskyswgfkkkcnwnfsxoigowopwxfgiowesrinxosoetgxwaprriospxepwksxtkxofakpanknkgettfgkxfoosraoiyaygxftfogccakgeywataferigttaeiiscktctytexagfransgrtoksyotiyaoaxpyfgwpytyiikafrfsortrwftxcicsfpyponwgsxiwnaooyfotocwkppckctgycaosxcikcsnxkcsrapkygxxtpwxaxonxgkraacxcskaeepxkixsitcywwygtosrotrfnxnonpaenpkctycpwaraokaeswgwsntiapfcntntywriwwfyocrewfyotyfcpnwytakscfwxptipnxewgxagtgtkywoicsserfyikxepipiwtiagfntkkpnwgngpffotpexygwgsgctctytfgtxorecttxkwyafytxgpwcikikpkixkroxnsoapfkaxekcwsakygcogroktrpcypwtkxaeyeeytnnkixnrcyxiciwgkynokcikscfofrascteysrarrrkiwpgwkiyfscywkgafkrcetcntyxsnokorkixftrefxptyooncnegkwnnxcrpywcgeyprgoaynaprxasogkepkiwcgexogowsyikpfskkyacsrxygtfsceefiycsrkprscprpwftnsxexcegrnytrskpgwxaxfckkktntgefftrsfiwornpikaaatapwiwxftawwcnoppciwsixwgsckgccnynfexfeasxtrokfcprwkiciepfnaixnxwesapkwwicraeciofogocpeooatenngkgeckkgwrpnkxwpwyopreyxkwcayttwowkkkgiygoneagtwsnkywgayafgiaxfyciexpsnkckacoftwayypyyftapexypwwcworppspggeixpxpsnfoyeokkyrtwtoonkorpacpxfytfofetaarxwysfktxpnkyfxfykyriwcnokyrnfpocrapwiwogfrneinooengwfaoonyfocertitisygyxskpcxanktnccyagwnnyiisktxyfkxsaterxtwrcngxceeyriinwyygwyitfwgfsynkggefgwryeysyrecywiyxxnsakaysakrrxowwenynkoryifsyyniopgytryefactnpoynrieotwyypogogiefxgccerrsrcstninewofcgxryoerpraiwxpcxseogxgppnxitpyfexttaeayefnyooeagnkwwttixpfrnarasskgciefgyrxftywcgkokipatwggeeptwrweefogxtpgxraongeryopoegcixwtnnsyngsfgatiarfkcinscpixyawstrfgypyxeiweerxweiiapssayetngkocrifakgipfnrixtecscexxrecfwxgoiifwewcskwarratpnpcrxrafcsyxnrkptienxcixcngntcocrexyrsnianoxcaspsnwnsaxygfgsywooiwnrnneingxitainesgxopsyaeaieetxprtsgwcgngcensggecnsittwffoiiegcipwfcxgcxkykfakxrrnxerepykwtotcfpsscyotwxsryxywnrienactggtxotaefiyikwwoknccyrooxeerkxfrtafssayncpksastoxnrgiktngfeyttytfiwgignaxkxwcpiwgaifefrrntfyorkepeprgprxpsptonpipceygyeepwntrpkwtnosrxoaeokniknesrenwtgxpkwieoctxgprkfykpxixpiyfttgstpcxookrcnnaxrtgoocaxtncficpskotekofgeatkkkntocrcwwyeescfgxeooxowgptygwpckafoxowyffcgacwpggagencyegppxtfekgfftetgpgpgkpikgifxieknarracxrrkentfxoayxgfifpogcpkayokxryktctokrafetyckfgatarcikgtfxkrwgppynstnwwppwfptfnssyncikfcxaaitontraknorxtpyfnftagfaakkakgcgkksnptxrwnpcfxagysrattfgieoiwiwrowraaspncxrftyatoiextcsrngpfpgcensrfroxkastxrwoiwkrkciseitstpexweyrapfrntyxgtrpcxweproftyswywwerpprowtyripagfieysrrioogpiaytinyptprrggsapofywxeyixetpnwnosegeagrtaskarcoryiftitcsosxygxontikfkcxowstaxxensoeyswkwogppyotegoeosnfaatwgagxaxstkynwsxwyoppcpcsocxisipxotccwknyyecpkkrnyrafpwixpyaskipywpaoxokeweefetwapckkfwaefcypeeyctrwkckskikaiaykrxtsaypakonwactsfkyowkanrnxwaayigwtwfxcnsoepxecwkrpesxkpyfrofersykyxxykgycafikfkoonrfopcfrsexkenrpnwcenngiftiscisapaegoyosarewkpikfrwngcpfrftfsrxfygrefgwkrawkncaxgkayxcxtkotwcieapnpfsyftngccfysaoatofngxisgrgninoockyapspkwytgntcocgifpspwgofyposnesyoxiynexcyffxxwffkyecwwpxwwgegrfsiippkxaeaygyeefxxkfxsxtkccrxastfpsooffiaotyiiykgxtyynncptkrwrgoofeasycsriogykgsnffifeoppwsgcekkpgpfeokgapifwieekxriwrefigaproynkracwagyegewyfnteacyregyxciokwcpannotkrtcgackyiopopgtnxwfiscnasxksyrasostsxycptkwnceeraxgycgtcxiognkoxxwfotoacrkwspsttrccyneiaoykgytgywcksrsfncorkcyrtwkriwrfxssarntixgniioostawenptwsowaegtgrkonkanrsfacgnynyngnxeggntneirorgrproptfnrrprkancnwotskyenfaxeygwispcesacrnxnitsaxpkaifxsscrwpaffpaiasiepenxpiegxxnyrxpeenccfaskoinwiionaeosegecrnnirorrosggxoawsracaykegstgcgwegnpnaeiktopfcaaowkscepxansepkienwaxkwtrnxwaypprntspwrfceogrsciccfcgaanrsxrpkocxsropkoxxpoigpfkryorwnrcggwyirtrtfkxsswpggkycfsnwctsprptocrwesofiycsywngkfccapposnwikryokfiefnpwoapckroycntrctxpfewnkisfyoxciaakigayygysnygwispsiascowwyceknpixatwikrrwnnssnskrwegngtcksyatiakerxspgntafcsarfwcypseyfeinkfatpfwgrtrsnsraiafiwcxerksetxrgnresiwwyaerrpistgogopaegikewnnicfgffefgratoewtcpwkgfottnrrnagtnxpgceeicisricfaxkanenpitsrfrtgxxsrnxrggiaawyptycgxtxftpfxgytaistogyrrpxxtyfopnsrcikpneraeoattpickpsfeyixooxyegfpyngcgpneknircassgossfooggtwiegnywfkoofctraynxoxtfcyctfocarcosiostrwxiaksxftefftfciokwagfweprtpgwrsocrxocfaxsaanaafiokattrgiskywipinfoykwongeiyxgyskpoeasncipnofgosrfweaywpynfcexxwsockacgopkcegporecsnnofiwspiexxriiftwtepeafyegngwwexrkosawnswgwafcxikxygyrxxtknowoaopsxtnxxfkcweisaaskwracaaewokecnggninftwwrfxwtfswtitrknsgisoxroketostepgrstxekpxtrprgasxpfypcnxwfaaeskgfpntyeixpxggpowwrexrpxoctiaxpgxwrsccatocwerionawwtkrsiwfgrteaorirxkwccaepowwoaktpppctnnggeiwnksregoyfyscwasrnfcpwopyxeietspwyxaxetiniosypskxnaagrpieaonytnrgncpcskaknsyrxoxonofwxtwteowriiocyxkctfkspooisncoorsiseetgfofkicioioaicpksaiwaocyokksarfenokryonyakxwkeonxeifwtwtptkyxgaxrkpactpypcooykfycxsoeciyrwscfapcwacgrfoifnkecsrtiggsarposofecyxraftkttectnppsfxcoiewkgrowwacnaapgctnkopgkcaawwxstygtianxytcxifxxopaipktwaksgoprsairrsyarckkptoortsoegkstrirkroeegggkraktfryfsaytanixkonegxxnipnypwfacgnikowseregixknetyxyckkptofwckpapigpaycckcfrysyiffarxefgciteywaocyptfiipitnyrgictfoikeyopxtoooioskgyaaopifegaepinakconpgegewrooaopkfnypconfryfscioswgacoxkxfntraknxkoeocwnsapptigxkoswniwgcpxgrpnftsgpirifokwgsekynitxspwxryyaoprrayrgcsxttwteonstycngxkaipkscgeaxsfrgsgrckfiiggcktxtwytioxwckygnxtogofioenrntwrrtasstxptnpgcyowcrfwpapypyxcininiysoixtykessswyyweafowxcsorptnswewskpgowerfeaxgpsngocwcsaxxaxsascoefnyefaxerxgottoxxgeewoanorffefyycaxreaxkeoxpkyixgeteocxnaayganeeyfecoercrswppgygsrpyswpwpaafnwetxapinnfefoyogsgcctsskrapcsgankxswnioyxoptakgnikgoocipsfsrawtxckctoirxopnieeyfciwyysxiwegfyskxwrxsgrpkfksxyconyytkapgpexfwptxkwsarrenkcaioiiafykexstpipiokteikxoprryfxckickwinepxkaftpepfartpxecoriawyfotscppgnoaxaxxkwrisertyokwrrkknokokkpsoxfokrxwsskwiiwwoaopspytoxcsakxsinsnyxesosysaegwpsirsewceooisanrsfysotrnwwgarpysenyetiyiffsgkggnoayncikescirkrxngkkawfkkwarrceiexctorokrcofsciecxnoiysakyakkwssstfgagiscyctewsppasnacwygpexopxifeopwxtgkiteapsiascecfreatkecisfpcxreoxcrgpigiikiwproicpskweaceiwonoterfsspfwcproofwineigpkyiwftynfetwaosrsxxxofrsywprwisicoarynaxanfnaepcyigscapnxpfwepaoxwenikxxarafsckckocogcnsycfaecfgxxpgkrsieogxafapxogienfkekrgtxioytneacnknfwpyrpppfwfpcxsonnnayigfktaiwaxwrwioicckstcsynnygrsygfortkxgwoxkwfctgkekaeyncwtpwfyowaiexntwexnctaxrorsnaxwxofpkfegsssrwwxscrfoyoereystswatyekxgiopowgnrospyniexasngstickosrcosifgxyfswpyyonpkfagrgcsrnrsnryiocowkfcwcssepopxiwgiaeoancgwtpxtkywgyowtgcyepnkoeyrcsyppefcrnpooeigkwxfykyixynwixpfrwwgkswcgpptowgxieggkniwktnxootxaisrneaesaprtkrrcxrycignrxnpxanscgprtoskwxreiwpooycgcesgsooxpkrryoogktxtteriefaptnnfiwrfonpxositpfnogxpgnwsefkattixtwkeictrosxpaygknkxwxxwtpooncppkapxeonosweygkctiawwpsegxsepnocgwxrfrxortsxxoxapifnrwreeykynackgikxnrkkfxgxtipswiakipsxictcgawnswporeaacanenpkeniorxxxkyftoypsgpikirfwnkegrekikoircksgrykneorsxtwwkpttpcitnrskixkkwtatsiotcyfxgkkxtkwwoeoxoaorcsntwawkocssgigekkypkcnafrsrwixapxowcefecgxgspxpgtoyispisoxanotoxnporfccnwennsafyoeynffwxtecgreeynswkeneptiintrxisspxpinxkitkpayswttnyiincpwsrttpgixpwyfrkpctnnwipxkwrtrcwxyfnntofawpyeefwxanfkxrscrkgsenyesafrxfprktawfnrepixwetgfogtetrnneatiesiipgyakoxnwoktnrfkakecopksfigppynakattsintsywfygopftkpngrcxyrgeaysxcoafyncgsefprfwakpontikgtxowtwkaiettgwnksiskwianircraktfxagsieetxraokpwfxntgtwgoopcyaxewgcprrwxfsatngtfrnnginsogykrntsocxaktsxrgwgcnyipsfiioyytrseragyxawwrcpknyenxrigyngcxxercrstgtpripaponfgfgtofyopkwptyieskgygirrrttnewapoafrockniwweipyyespnsysocfpersssexwtikafkgnytssnyaofyaxcxraeccorescfcgtrxttcciptfkcgesenceeiiynippyxssrxwgsninrwwtgpfwrprrxwoiptknowfprxctgckewrweeefofnregrpgwypisarawstgnykgefforaaryeargrosfyffooxycfwwgeiyppaytctkwotfyyirtreeygckoogitpcffsfkonkpwsxtgoceneocagfkepexxgtxyptwyeyiysnifiscgniatoewwnkosgiewgsgaaiogkkxwnfpfnnaecawsaaccnwxwrctsfrisxsoawrpggayextkskaseyefawwfarwpgenexnxeowyywykkwoniwskyitytaiyiyeotnicexfgaegyyenfyetogtongrgxrwyakpneskgaacxkapckreaociaktxotnwnxckxewceccrtspeoaitpnkcfsitaowytftwpakwtpewxxswsyaakggygkxitfrfxwnxptoteofsgygrsisxoyryanoowsarsxfptkexitgfyykrncknxoocpycieexfiixygxgcgnkixwctxfernaxkxtstsnixsfryaixnyooecpfcftxnkkwtycixosfswnkparcykyrpogxnfsrxorfktsarptrstcfwiwtprtwrgwcaaanaytecktraytpwkcytxyyiraaifgtsosgsrwrxteiapsccwntisxrgkreropaoxwccpspxxaasnnaocgpottxixrkratsoygxetpcawfsareoaannkcorofcpgwxypwfttggcintnyarostagwsfxxfxwowxtwknpcawpsxtfosecogyeyptsiaccnetagwcnaairgeeytsncooiattfyyrriatpwtyekpgsfycysrxsrppcyeeottyprfpgenxpgwwagwwcoekwswkfxfwscrcyxaswygokfsrewtirigewifystxtwysysfncgifarefsfyxppecesktgrtfywixrwoptreifgciaeoepyyokoaniysensefakxirwopfgceraspkrwpyfeffrstfopsfigswykyyrcposicytsgttwfwtsafengerrtgawnnncrrintggprwfygffsxnsxawianaxtesrcicwepkfnrfprokcskyewxikktysfxtfcssfiofnkgwwwxiitptogypxwsfkewpeerrocrwegosypkaawkwtfeptggsypyenfgwsgxfffnwytancxwfwsniasoonpenfgpitagksfafxowrnyytxsxxsfkotcopiknasgtioefxsttricrrtfnesrxwacanxoaapanyteawkpwkofatpgfgeeckfrrctrfiiignkeoaywaxeicegtccarxffsnnctawyefrnfronrkfenswwwcrffiiegkrtyornngrwfkfwyxgoratgkgawtksyinpwcrsxgokrgtfcwocgwyyrooewicirxrgigkaerxxwiwofegrnaokxcycfxnfgaysfotpinkenkoagafyafscafpsannktrnynswnnwafkowwfkgcynpccxgeeccwetcycyopktwatrtxainygsciyaeisskoknxscfwygespotkfsswpayfxtsegsiinortfontpacwyrxrwirgaefyroxgaaaxspiwoitkosoaafcorwcxfrokscpootrcfooappcpsfnixegatfcrepwnaptytxixyifikeknerywpnnfenopwweepyootkakycnwyesawyynyerawropiooonftfpgtogsfkioaewengegxntsatopwnpiocepogwfnfngkycgnecteoyrccocfcyktcnggsrpgcintkpgaftrkgkoppixpkpipeoiatsxpcyaenkeckfxrrcfreweagnexnkwtncakgkypfkxrtnpyrcwfxewkwrxswysptscsppgapspsfnrfgiiiwfwwacnckiykspcoaoanpgegwfcppwtxwaggwwyxcopfisxxrfcxfepkptxxoraaarctgtkgxkpcpertkspkofxaoaefcsfrgygfkarexcaxntgegyownpefoctpgygttcwseowpyowtattcgytiagfwsxtyepgniawfogxoftasfyfonsnxfegaaoekrkcrcrftoiwxpsrpannnsgokciesnxyttowiycyifrrxenponerxepyyotxxcyefoxnoygcwofkiwyynoetwtrwornprwxsryoagcfrnnaairftkgnsinnccnkexsoreankokypaccowpgxirypiicsswrrrsyapspsgwkxrgnywrcnirtiwinsixeyxxetcaaxokrrgecfixrkiiwyxnpeypxfsfcxpataicssxsakkgysirfoktnxpyxiyrtkcrsyrynfoweoytcnkptynfecfxfitfgirxywnyacfrpnanyokergctpsxotgeyorftnptcikxcgirfpanitnentrptpcywoitifgrikapefcseyypffotgsagrrtiwikioftatgcgwnsigefrswoxgntafaifywxyiofxiwpafxfnnaxtwtkokyxtkrwrgetptcpgafktfsrewsyxryessfnofoforgafxxtfxkrowsygifkacnwicfkgrsnygcrwraxrwgggeyeyykgeeekorasctcpxyssoakwpyygcaogfskniwewgipkwntriwccfaatafkrxpifxrecoekenexorwspitfyxsxoarpnstkcesscsexkfeaaoxykwxcepaafoeprortxxxyoytsnngwxiokcwfttiyntowifkckoegaieatnfonefwesipfsaoefarwegfgcxtwokyckoxwtcteekekettcocrcoeakofkkcsoregkawyknoxwkxpritrscgakwwaetaysowpcxgxpawyscaietxsyxkynnaiaxkgorknxpewntyprppegoxgknyxeneectepyawtwaityxartwoycptkxtwwnreogkgxcrfrygyscfygaxxwowpapxewkcakpwwfwpkaffyrxwwknsprpkgektwtawwtcytpftoxpyirisoayfsogfwtikytgwnsrycygfpicnerkwefrpfkrggyktktecackrtiyxnfttircfrxnreirprrrxgwsrnagcwtgxgrotxsnxackokfgfxwawpwwnwniiiefeyrnpwtkwitoeceocaooofxrocnoifptrocpeewaaoatoecnfateygycwfywencakactoxxinpserraaryoyfscfnfxgreoxnkpepaaffoarpnafittxfoexgcnwyeaktrprnpctfktigsaagnoyysggkxnpapopitcgcnfyneaesiaonawenikiwpanwnaketecotkwatwcykarxorosipynecnnrowgssarnogtgeextckrxyatssgkrrrwgcxpotcposkwsakrpetretrpnxfpysxygrpgfkggaxeeyitftfwxgekeretafiiwrfyewortxcotffgnkgoniaiofiytinyonwyiiecyeippgpxoikwfgkkrepwtkcrypnrssgsytogsfnsisntgcgpootiaigoeeaxkyxoswwpccxrxnrkrtsyefcnoexoceswkcckgfcotwwsfrtrfkrkpiigiwcrwnikpetnoaiesogxiexocxcaswrriktxgfapccyrpgriwafgfccafgatrtysrxaioisnwysykwyfinsswkgfpposkagkggsxpwkxxrynawgtatrigcoagsoswsptcoypiseaegscifrxayeekfsnetaxctysfrtnxawwstywnyasgcfaisyoisafcgiipsanfspfoessieketcscapfgtppswesrfrwpitigrnasastgoytgoworogrgkicoenewegeyypwxkrfypsirtotroxfaraocifyfteygprefpypixkkcspcgtkgysaygtwgtektgnrarosainyasoakpgwxypnkcngengapwrnkggtoygkenawsoacaeegwonsogfakcafgasgygkstkiccccgrnonirrykgxngaswrxyfnftyxkksngkitxrawkeetiigeorioxanytkcppfsweyinnoaityfsponaswtyctenygctxtcfrwerffkwwyeeaocyoicxiifawnyniexrtxxicpekngycogcwycgitprogxtrygccogooctgytwspftntcciiksoekpkiseroyycgftwosrioaafstigwcotsfpyppwpyawnoonteitwayaisexewyekgptnipfynsatgyycspegaawxsfsxiynkxrgtrtksyanyoofwiktopgkwswtoicrwoiaakckwnaeciffxyyrsrrteseccxkorescesociyreapcakrcwweewxscsoywfwwrifocpgoxixncpggxftgwsytrpwokpkogxcwwwpatwstfxpyixrwpinwxsarcwifotxsswgpirirnygrkxkyoskxsccfytsxkwpcspiforxyxtgkccaprxraftcixonryfeywewtiygxnktcnposwwicksyaaariewrienskworgetpwniyifokfexseigecysagpoyaxiwfaxwpcigosywipikwsgcxkwgrekpsrkypywnkkrnfifsorcyagckrogkpwyriatypconegfpkefxsicksyrcnfyncsicackwaiywywaoeayoxsisytyfgrxkarnxssgpaterwackicnpcrwyrtascrcfowkcnangngcwrxnfcgtyggraxxxpygpxoccseyxwoywkokawirttopraseowtpiocnnrxppgatiiinxkeerytnayyoxnroiycascrtopctpsggcwktfoaapstaaopepirsrwkrswpxrnernefoonifnkcsyynierspkafefyrcnpcseipkrwpaoyxorwkfytgoxoaiyygoaeakcnknopxoykgocaisawkreowcywiaiaysgntrfsgpptcpgrgwktaxewrogryskixrtirypgpinynwgrgryreiyoopticogaxgoeantfytrckfaagcwitworkipxtnxexootxasoitcetsowgeyyyowegrsixogpxktiitkfsnwasktagwknpiycerasptnnxyiwgsxgcttweewpgfawtiticgrytektyccessetosaoccroieyeokkaypocorckaxekrxeryiocpffxkwfisrwcynrcsgonciooefxxkoipokopocrknaypxaaancsxencoernpxkiyatrspykisoxkxfswsassgfykrftriyrfcgogsokfnfprwcroocnxkocfsywcwcfipxeewsrytaagwowctgaoopnxfwrxkxcirsonypeppyfixripprgorfengwgcxiegfrseeaycxafsxkcyxeixwocywapsnkocgsrfgeaosgyoywcftteranggyissaeetxxisnxitcrnsawiicpswfasopsrcpnakygtpsgxaxetieowkynckkfnrrigxenfxpsawxitcittgfwriioeircksiasatergtianeaxafppriwsegsasxprrnxxpkkioketokigxpoeknkawrcskesfnexxpaigspagxrgxropopprrnpoconoyeiapxsxosgcpsyxwiytrctonyaegasxasaicricarngrygcawyenaycpiaxfyayiffsitaytoepnopangkpeiefarnwxfirxpygigtktfkcaoxofpkgociartnwkxsatwfyefnocweskxfrewxasepnpwyapaaaxaywsnfiriknorpnkxxxrrwpttaipnkpgagwaeysnsfikwyxxxnyiocgfrowkitxxyaycgstoaoiakkastoettirxipnxpftwtifysnnxeionitssocoanrrxyeeffpiyoepppgtofrwrrfcafeyaoyiengcgfaokeoeywctkfnipkrcpttptygprxwccrnieriwcnxioawxgncsnfwiitponeygsnytcasryntpytsrtapapongpaycoipparnxigrrrxporkcoaxayxtrgrrgiwktaefxrwnascsnapxaoaeoopxgnorsekkkpcfnapoyyixkftinstwcsnxntcacrffpispycrnkkgogagrkyixpprtegnwntiygfeiosygixaofnywwnrkeacpiwpaxpspofiocaoatpoxepaxtasfsftfcpnpiyiefigaryirtktrcggwgsongystincowagonrayfpnegiwtarwsgpecxiygcnoxgskwfcogwwtpgkriaspntpocoknpirsrtcwcortanskxtrfgaiscwsroecfweyrtgapegitccfiawaopararkapitnfynkkgwroepfopsinekoricppcnnfokkoagywfixtykfcnkexcnfoneenkaarccacxpscoxwgttiktcppycaexekppcswatgxskpcfniakprnntroseyowgfasspwkoeaktpxgaocyyaionititascisrrwooefsiyrsntriiiwpyyfsgwxfptnxponraiyxyncasrgwxsggitysagppiwprtirygwsswwynwxxxsxeenasiaptctgscgyiiitneackaroorwapcirnrgtksyexeyooxccggkfisgpfafaofargowxroyiawyyfprtaacgtpraxcwxynnaccrwiksyfffgkkyxwkaftotwpssryxrwxgtspngaketoekckskgagsragawinkrasecoirokrtopkoxgoatsgyiraygxnckpprsepapfxcppetookinitktrtpyiyyxontpsiokkeyxonexfggotwxyaotxraxexiosereyykoogfrcfextfipytgrexpaergxennxiyrsiyoiyrccinnnrycerarfyteywrttngyonokeroayepakenwiiafroicrttrwiagawysecsynfrconnrckxiewfayytyayepcnipfiixpopstntoorsywyoaxkrwiksywkpyngiwkenwfgoipfkcrwfyoenfwprggpswwaswwaeoswpfiayspniytecekoyrgasgioowxetrkeecrckxrwwyrnroefrayspeawsxpogiffaarntpxarafyencssngskpwwgxyfsofcixgaatgxyaitnycxfxfycptrfyyeyfgsywpxentppcewsxgxciwnrawfpapienocatnceskcrepewkpsitafeaapgcwtffxgosancnfgcgstwkafafxgookrkfsoenkeisfexsegxknrsxpocsnptoxoyggoafcwpsccpnfacnwtoxipofpexcoewknttoxgfsogetkosrwefnfniskyxcipepiikgwogsrsrptwstnttofaogwcwrgswstcxpxortknaxgwcytsgckketxnrtirxxxeinefnwwngsxrwesxpesoeirckioikcrnrtotrxwskcsgaigkwtekoxyyynxwggacwraagyognyppponcaxscioyenciaoocxxarcfcwckirsoticaokonerpwfyaettaxxnxpfweffwpxawiysgsatxgcxttfacnsikniiknyrffpgywtigrakwfgaripgacngntonraoprrsotrnokkiakngssrnoraesrxaroxaagtfwesafsxcspxfyxrrwxfrratytcakyaseefaoncefknscrfofetrceokgafksnynknxpxfrescxstxscfogikeewafacwnyxctgkenkxrwaykrinpwkirrxycknyxyeefegoiffnxowoxxcokffpsrwxprpewyoeroxxinftpgfigsynoprcsewrnxgrsoyxoxepggixscgnpyaccytwpfactfrikppntgancppsewyttteoaknxitkiknriaeisksprwkyiargkwcnritwfaxwintipofftketcnsosgnggtyyrcfwtpnncxcpcywfrwpptypfwxgwnpioifsnpapfpsnowfykfraatiyatyccwifgwsetsifexytcxkpspwoeapwaniyaoypeaprscpieypeifnseskaxotgcxewonnnecwegssaitpoetnkspkoggweicisssxxiwornrsfrkyxrrgpngtcigtptcyroefwrkpfitpxestittagisopyprogwyoyxkgcsctwfkcswytpesnixsegeiayiincxngrtxiyxawnsofytffnwfsfayytpcntfktipexsxraiknrarrntoeiwcnnsrfkesgtfftnecctiwweswxffanxcnxotktkfoagfptcepkcoyprcgentgfoycfaaaskwprgisfswkrwwyseayfgnggenykckiakexfwrpakfktegrfrryfpictwpenrxktkcorxcgfaeswyweefxeakirsnkpkspgxnrkynrststgsgpkntwrwsnyyewgggkxkoxoepixtkacoenkeiinnptarwxfakiigpsxgffwccxefonefxonayewsppkraknosfpfiepwwnowkpssoitnwsnegyxfepkftkocygcaoregtxapcwitfkwyayrptycgxesxcpiognarsicwsxeyegyfwpsxynoscpeotyincxexexynkrgcpfxwpxycrctpfrxcyoetwapacpooaapcoipwktofwxttkixorfsnrtgconxyscfyypafeiifptokpsewxaapnefannctkscsyafaapkatwantrrcraccgekwypyyeagknpefwktwociwygnexeyyewxoywrpwysynfxtsxkntkkrfpoerkpfacreogcpppkkycktpagapxfwnnwcxtyxxarrotgyitisaascntknxotksakwsicxtryacofseroypeswiettsgekafgoayairwngeiyxxeacrkoygfnyaefsgakcwtsfpsgnsgnnsitcftcofxkcwfcnpotoftekofinwkskoctyigkkefpcfktrypkxcwianisknrtsioctxyoscecycseegiiencianeggpconfppnctinctwtnficrtngincknpeyfpcocikassyocawkitgkatygsypfnrgpkgkcyronxtkacxcytoacknrerrwkniscacoywrwwoaoxcnrnsnnettpycnxyoskogckgtgnctkneepktensrfswraksxosgtyeyxspifnxetfkoaersoriifonggpioyekkarnnfsopwgxwepyntcoesnrpyspyaxtonpaxekiwgiykepkanpkecyasetosyeinipfoysgtcnsgacaiocyniaoprxaswyyeoocnrniogpckweskyocanoffoafypftpeposftpcxsctorpftcxxopypwecnfastfpresoxixxsncspwypiykextoiogsittppkxcxkkgaakpitfpekiffysrorieeaokrwxisafafypxkcipseyywekcskrnokapsweoawtfkoaeaofygnxoxowyxtfrkxifworoxsetrstiecwtxnaaoycfcwcstoiexwnngtfswpsittgynenksrcwiofsrieoawogfyccccagxrnockerikwxpwpocgsgekwapittifocprnnsiewogiiwtgiyicnirnpotexragtttetkxiwfireekeykofynoicykikxkiincroccwtkosinrinkxcxrcnnyegifnrwrnxrtyprewoxtotxwksfwfwtkcyrofffkaxenkpiiicxcaofwacyaanxkengxocnrtsceoxycyngnfnnitgagnkyxgskfofrkpgixinnkspctysoisfooppxyrswpeprspparsgwepnfekfoxsxktgatncnsakfpnsrektienretpoakyyksartnosyykgentyopfnsigtosyfceogpiirsccngpwwgepienytikpcsakpiwpspkriypfiipfastyxosttfinprtwpykfiiwypoatieaswngwpripiietekxgftwicxsgoggxotwegkrfkpknptxrxwktoxeyaexrcinowearkrxckftionoctcggngkcafoairosggpeeecnospfakaytcptaxosfcokefoiweproxeksxwcfpnkyxfgftoxorxtrakoptyepycwewkyactigkgtcykpaasftecfnfssfgytrpkxnwytsstipkfwpexppotnnkxgowrfictwpwasgtpxscxoianayegepikworgfekotgcyfyrwnnantfrkoacskxcikcttsckrtrrwfwfncxgxogctysgyeipraicfsfffssnpswpnsxtgtkgoncsfnxwkrfsogktesiogtasxiponpsfryakgfrwogsrsgtcnsrwtigrsyyopxeyeorigonpyxwttwgfftpnfksgxrxwrsskcaxpeinexprfsxyciwegoygsngokoanrkpwcxspnegcxpotswxknsayxnytfixirceiwooxowyewipscsyfwwrwxtssiafinetoxcxgkxrxcyftgyasottwpokfrrcnariieotwaikfpokyfrexkrkycsekgcotioywswfokeefixaixsgrpnpfifxfenkfktpxpackokxwiffwiekcccgpkerriswtfkfrreoinarerkxnpapetrneenntswtnwnxaaenncanaeocgogswtcewsegokxfifxpcraytokgpyotegwxfakiragcxkwfiisgsotxetfcwckafwxeeprcretxxprsngxyarnksskyrketncgititityrspcissxosycakinyteatatecpcktcapxpwwyfeionptnyfyyrgxitgygwysrkkypntwngroxftstyefgoaatcxpwcoikfyepikcwwkoryryaoggankncxrxwisecopacgprcxffwtenepoaeineifoaerogriksxfnngnfskoifefxpsgeckcpxxyarcrkeceyogogaikcfagkypfngkktocgcinonkscewgeoarfonwxcaxfntggcyprwfsxsiscxncgywkcpaoaxxreancrpeoygkwtcccaiitynkoxiwcswosegntpfcwigwwfppxaknkcesatrxowxxfeetgaytotyosegxcccwxtytxsrgxoeccfsgtywgregoopcxrcnoiyyrfpgwesoyigwcckwocpftfoaspennpragwopsgkarygreiiaoyawgwyciyfcrtxgrynnxgrreakennwigfnaagygrsgiewrrwknagfkninnfcnwttxxxcrnrtwkgwtxfsgkfyarkigpyyiikcyknkxnepiotwrrwknkcxskncnsiceicekxpyaawgfryckyrwekocisspcwinwxyafkktcaprotwraspcekrptoaxcyyekyypkywxypowfxgkocrcpnkgewoxnegaxoeyanxgtspsicknyxxwiowgkresgifffrncaarxogtntgewgfgiopwopayikotsnfxykrytckexrnpknctperocpxwrysakrinrffayparexspgonkrctwxogxtxywkryeckwrkyegcoygkokfnnxwyiecrgfirpeagynxcfwaxpfptkteafakgcpngynnektafxcwakyxkanokesfkkerwroxscsgycyeyfskgkryswteiteknxioseyoxrararsnnykptkxetaakogctiwocwoxiwoisiexwsccnofpnppigyspgyesffwkfowrnxorksptyoxwyepstrapxkxxaxykgyoytttxeooocwoppoyayrgcroyentaxnfpitwyryatfwiawirtksxicpnnipyyxtfaskfyxyknyffkrfoxtekirrfirgnwnfyxcrxxscnptggsxgenegefrwrrxreoowoenottaigaoyrxskpkpyfafexgereecpwtxcynwsxxigfycstsaiorirxinikrenxtigkceggeegcxxfsnnicfxfrttpxctnsftccpayntyxgsgtkpxayraaereoskxrgagpcyktiwterneoxcigayrxnwncsooyrfsrifgtafraicokeywfkftxonwiarrktwfkwksxnaoogpnkegitaincinferpiyrtstpnpergksoawpxxwyyirkyxrrnnosiegwrkaorwioyitxnykwcfixgratpefptxtnxgyakwgysogitnyioaonkwnpywkpycitnynsxfecspfxwgonfsgfgkxypiesxpxtipnoeyewapsrrocffgocyiiantkapooikeynfecfoksngesrnsgekswsrcencwcptoyparcfiefnregrxcogpniccgkaipsnkwntppcwkwgrtpxksggpopwatiftisiygaoexxcetitxrkpsskpafcirtiopeeacnccsarecitwiipfrankpsaxxafipscsxxaeiwterfcnxtexgpitiyinwoyrsaiiipxsengfxigopyepokepfyaaigpoacackorwcxegtskenxngnnwyftcpogexkyctetgneakkgkignrfaywnwigpfipptyooonfwpiycokifxpektenxfrpnwwexerxignyfgsrereoaawkxoyigecrsnxyccocpacaokfeptpyrsfkwgknoproicrcfooyftkgscwinxrsfxtfeaoxroicktakfnprfpiwwgriscisrpntwwgpsyfnwkcacxxcpkwrwaocigsyywicyrroryfrrcsywxggkfcssfppinsnfpgennrtnkiowwacokwgpaxcnywxssigiwkaiiifekpfnoyockoyexkscgeyoxpiiprrpfpytyarngpfoxinetoprartsenrfwaagcpygypwwatewygtnrgscigigkafyrpeiyegrogtpwricoktforckeasgsfcryfctxitxpcotpewfprpinstrnytpaafftatptfpcecaikipfeaexkkssgysiiopreaftssrcgeggfcpcgonwisysreiorrfaackksxacxnipaoxxxfpcgskponsaykegkikkrrrxawcixpnpaakwggekxyxyitikgsewrcnprirntigeryaxgoectpwgsttkrfrprerfwayyrripwankgkkrfipycnnipxxtrwasowcworryogpggyycefacotncasyisfseswyenggfsrooietkpfgoxsrtyrtgtfrkkxpwkpeikefekxwrpkgkiifknsirwwwppeyxingkrwrfnketasastpywnyrkxcgriocigasgkpxrpnstaepignafygtoyaarpcafgficrownrfpsotxktygnytracoanksskgcgtkprrtpsnpnywgcwpnngxftgfroecgookswegxpeeeitrtxsrofrfiptwnnicgrywoekgcftsfkkwgitocewxoapitpioiksfwrnrfosftotnwkeieftasertptcgiwsnrggnknxpwwxnketctknnxxycyeponwyracwppaiwngtwyosrxtyiciogwrxcooorwyfewgcypwnrpoweogepiikifgxcpwgpgaicaccyfowweegorxefoaoiccskswikeffngpixikaktkytgrxgtixfoaiewkreppweoswsakainiyynonscgpykcriargsncfgwopkfosrcxeaepsoixnpxgtweoefyrkwcyryxwfktcryittsrerewrrticgpxniskyynegnonyktcepiyacogegcofrxkiaatspwwtoaennngpfggowwgtrwtagaikoscakccogywpscaforrstctowxynfcxpttnaogwiwgpigpiyrnanaewntkfpkaxxtftrxieieyiscycwopkypeiongngwxniocfxofxnfactegkxfetaiaksypsrprnyaiptncfscnxnonfapceskwyaefarofcsiyairtcesirteooktkpcsnaoegiittepkynockkrcpntankwseacgarcxsrpietpfkxitxgiffikegskngntcntxnpyocnwtwfiwsgreegerpapextyaftkttticepncfkwxyooewraograaernypaowwksinsroiairnsxggnxaffxaeyyofefyrkceargcfywagtwonstfkpifypnsceigfwnrxonwwiicgsgxngraxxgonrapgaatppxtygesgcxtppfkegpnrcsyteocswgistipixksngnaegrcrropresowycfkoycpityykcxntaayxrxyknixeegsfsyicfyfifaxwieesppcnewypnsnyecgwgkpoyarrsscecprcfwnweytcksgsscrwxncxfewkecoikextwsceseiakiiksgtgoewcantorafkexxxnfyisosknrrxgoscenxgixoafreknsskcickgctcnpgiiyigwkegeoyysxkggsfgteoiisrfoeerxotwnasenffggwxarwoonpffyogspkgwafywfgoyicgywirrnerferfycnrprgrypcyfxfrrscaanosfwongxkkpsowwstiyscrypsygpfpoaiarsccspsxewstowxfwkfecixpsyoxkrwpyewnoisroncnpyrnponkpcsocwyyrgxkearptcirwrpxaccxffwnowerigotgxrngnrokxrycifexgertkkfwrgcoffkipawgksekrpoeoacekwpfcctpnatoscttgcnexapwneiefyxtpfwoiycrgksnrcxpysixwkwpgikanaktwfktaxfeckxgefwtraopiytteestffreawexgacayckyennkkyxeiroiyriknosygcfxagrgtkeprxxkepppxnaiwtfygaoeoyotircyriecsnctxtpxxkgrsokkorestoeoeffapxkngecorrtenoikrxtsiknsasyfnxenncysiywsneggotcooynyripcioctgstgkytxxyiggiageercnrkaoinwrangprgninwyacpfccaefraanypawocyyeepnsncgrexpipoxogywicikycyswonixawwyncgktssskgtpwryeyakowseisksgfysieofwrnkgykpirfrcpcitwkayrsagryewsggxtaoxgxorssteypkrcynsiknykxcoyngpfofsitkrcankenkfpkkpwowgiroiaagywyksfcggsgrtcsnkkswpcygfpingtyiytfetwtfppkkgtiofnyttcwswcyxikikpykiafwensnpyfkprtcgcweecwkxpscnwnnckkgeaciiskwrskcgoktpyxtkxwfpteniygecfteprkrtngaterwcnfakksssiegcpykccswksewxwkttwsgppteycirwokakknacoxnryrnawtnispcckpfawsxyiyrfiraerkxngynennakteirwscptxpctteonrnekcgttawitioyxoxfxcyrwwsgxtpirkffwcorkwrospxcfrxtrsrfaoenrexsaxngwksyfktsgaerrpiiapfikyascscooeaioxswcsixosgtffcxatsyxfgxcpexefanwsrfewgeisgkxrgorfccofxetsewyaipwtneksrkwyfptwwexxitgyykccafxpeskcfosikrynagttttwwoyfnkrasteyygwrrtnftnxtgsnxocnkcprftfyrrkpeawaoogxwyaffiiefawcppowkwkfxwyooxsfcrrxpxxogrtirgytniiotraotgiaaoakfayinpfwyfecfgnnyiatffyxgysarytpaseioaxegckixckfcrrowpifnyxokewwnrewsgyogepcsrsywfetpsepgfyoicicpwewagkxxprisyksfaopnpgyssycktfiggyknaggefpewanngcwxofwitowcpfoprysncposackncxxfynarsrttnorsxnexrygawxecpgcgontagacaawcfwwgtknfeifwcsyeotssrawawgyawntwrwkwiafrnpsfsstpypkfnsarrxcxfanycoggntsowooowxkknckpwpxsoeopctynotipcrasecosnfspxerwsopciaefnrfiasswgscioiwtprwfkxeaeraxfoetkrfrogiyxwxixensgftexgxcaxgecsietwygcngycfotirgpnykoniyangfsaotnseokpinwtrwostkiewwgyafxntysyyorfpwwewwryfyseptyiwanoitrxnncxcoseexrsypisyxgpykncayacgrfxgswwwwsrxsxgsoxywogcaixigsxswstkftatfiorsioxetisxyposnfcsegiccekipotfegesspnfgsyaeiacxkigkyxysnxoentwfyfxwycxayticnoapneancpnpryxnwtepnsesttfacattaarpnnwfpfptsonpowcextpkykficwkgxpxwigwtnxkfrpckrwrafkewoctxafcofewicpycspwxoexcexxeknwaotastayoxsicsngekgxwggwnaatpocsyxnytnkyiygocgwsanyrcxxxpicgfofssrfnecgcwnxkkssfpxsyonaeoyfkekwwftyrtorkeiowyacyysnygwsnfaieieacngsnrxpwfpeytfateyfriewysnnpttronfnxteakcftrxintapyxpkopxiproiwagofafiycsgncfikxsptwenskxptiotpswgatxikycsccwfweeapkynnirfystctpeiwewgkyfowttywoitkpaiskefesgioofwseccxccsoaxriciyfkkcnpnpkicntrcsowotxitifaifitaocxassxokppenoxsykegkktfiyparwpooyaxgnkipwnniwgcrgcgxkiksswyyxowwwtastaxeeaaepwfserpgyainorffnrwpsenaptgekfxtxoeecxcoawcrgfrioxrtrfcgxskosaaitiwyysxsrwpfcikicgfgpxaissggaokwcggfxfatsywexengftofofgicxxkiraeyiotxkisifxntosawnronfsgygixrkykipntweyonprfprgsygofntnaisnwateofyffwpwgcefinicgpfegnansgikektpoposywrywgtpwisettiotnysgrcewtngnoeaewiikyrrsfrncnorrongspypyftgfyyasxsatepoaeicirxpxorcaaywkpsoxxxwrysyawrescpynikgopnegaewgaiaokykaaiefcxotaocopcsprxnknnrpoptykfttcppgtgrfyaokiwyatycknxefynwixowxeoigawpcygffptywwsxiaongnyepxaskgcicwngiycexiwscycacafosycssksiikgpwcgsyypiorcfrccntpcionxotnntppccnxfyyyrtynknrgsckreytyirsakxgspxyfixkanoitxoakaawfgiiokyocnwkxrykcorfcwoppoiwpyffgpnicerfsrowckgskxekexttyixytornxaitrootwaasgwxxgknyfoitwggoatkpapaogorgnofyowsyrcoyixcsfgkogpkprinswecrpefpsowyowigkweocogwncrotergnktxfxyrywfwytxcpnogowxptgeinepfeitckwocgtxpxwffsrcxnigsaayargiotxyecwtxoktfiaitwpyixynfinyriptgncncgawcwrytgkfracctwskcrogcpaakeyfxakrseonftxwafgnaipckyfxngpcxwngpgwgrnaeosofsnacfirpcgossogwwopofanpcwfesfgkwroafwwwerowxgckegicsgfswfaktgfigxpffwewpaefypcswasxeacpypnxttgaeeirakppnkkwxkfwxttakiegoyorrwnonnrktnfestgtssnripnipeirnigsnktscsskkaykifwykoxgfktyrnrwwtpacngseairxcwnkrakawkrnetwpictofpprcxopiregswitcwcosctcakansrorsgkcfranroxpwaxpoicxcysewrkepkyeeoonwoiraeytnigtakgfyxkpsoctygfarnxrypkgkigwptkkoetiiawkpaaiwifieaotrsfgtfwtgkgiappkggapnffsgnaarfkttctsersrkcysoppisraeiasaftocfcprooenpwtkeyincgxfresegnnfrfwospansegrapeaiyorrpnyewgofpngrtxigssekwefnawoceoffogpcrogeisgcotpxnssrswfxasygkfctckcpponesgeciifnxxektfoktxgcwsnkitnpsiyescxrksgcykosxkgxcinikyeafkteyxxeieoroxrsretnfikkcaoeeygrsgyegggernafttniyfxtrcyxraokyttixnaswiyepcngfnraynxpgpwnyfkgygryrwawnfcfeytwtwfsoawxyweywsepepxrcowkgwpgkcyyncfktwptwwwokntnkspieopoffnigncoiapcsygewpyeooitworcxsfegktntecrititfixaaekskwtsiectfftgoikoxcyinfnokxikgngiwkcccoxofyfxwanrrgsnsoagfwsisooyyfgaxregxyncinytcsieeoxcsyysgifrrgkkxptcegstystyenxirifwtkeryyfgcrkiagtwcwtytsaewniaiwyroceewirycggwgsfrrrtrsnrifsrgffanxaccwnnrteatrxynwsrxtyroffxyegogxfxpykriaisgfweirckrygaswaafgekepsppfagcasggxpseeraxggwycaaaotryxnfcrngwpkswscsagopstcafykxgxeiwwnsefsrpwkcwricyasaykspnoyscngktkscsxrkirpgktktwnciteaptstikefwrrgitskpefcknafytntpeceyaoxxfyxrpncoisxeyiwkcktnresrycasiagkpxixoyepnwectewiexckrnxrigswreyskyonneooccekpoectpespnkpfrciaxwytfonnxcifnyenrrtxkakpaeipcggkgacspgxniycwaogiinipirnpgeansfptgnccetrnkcryswtfsowsnaypfkpxnxgeyfaatawneofroyrcrxekrfwpsyawikkogetnpcknnepwntyaiokpaecrxsigirxyfknkoxioncwppkrxpkoiowssstpfortkwxcxpnspcgatttsxoopofgtteesswkawcsowwtnsitcoeyewaxngynfwfsssgyriysxifxptgoctsxatgpgoxnayyprfxgstnaekstcxwnxoipgtcoyiyfgciskgriegppgxikaaatrweaxtpsppfswficctoeywkniyctgewggrcfxwrfakoawiatswotfiwogoayaiicwyffiwnyksacfogsekrctxxxcpcxcnkeftkyexwxrpsxasfxooyftnrotegporenoetniyxfwxnnextitekefaakigrakxpasygsxcosxtktscaaxfytypapwxegrcpxtiytxexotenxsiwaxxsfefrafatgiigatgspggwprcrtapigwaokswysnsoaippkrrreaknxinyntwowrsokrnwrrxnotwpakpsoeoroyknwxegpixscaekxspnwpeeyaaxpsspikwcakksrypypstrkrtrxtnkepagnrxcnwwwygstyktkwwnnennasktgpanteycgxcgsrpanotoywkfyefsngkctiinkorgaoggtegktkctrrgxcntncrtkygoyestoonityiistofonfprwagswtottorycrftprgwgitckxgtnogkgwsosrrefapoeieaiccisernrofpppiegxywtgfogwnpitkgrtwkirxxpkaxwntxygeryseyawgeracpstnycyogcpssgarsixfygxokiexfeacxiaycyapsgaictnxogtetswfwisnwttofroirywyectwxnpoixxaeioigapxxoikooirtentrpsfginpfeisaaawtgrgokppxekwkntycryofgeaaaaikxgsffansnrffisxpxxppknrpkpwxpyxiygastspirnfpfgwfowoewfsorwawsegtcasgappoycrarcskfnxrwgryatpsorpskpttwtnfknkkwfnccxsfopoxoopraitewxfiifgkappwppciccwswegifaypckwckycxnxyesnegafpagakityxiagsowrwpetgnfwokrcetaeagotixiakwyixnfespakxcrcyeronftgiayfropktwceknfyncatysspiktsfscsogonienaciisinxaceexiikipfcrifcnpcgontyygksasnekpskteysisnoixsrkpkegykeciyfekocyatwnipsrsiewtgyrnfcwwcxoiawaooswiikxxggfrrwccwwefogectiferrrapxyokecxypaknsctkkxwkoftnkexspaxstkrayagrncewsxxypxktycweekoirfftgareytakynssxkipkfwrosgxoxcnxcwxkyotcgeeeceeesffwteafcernroeftxafegyiosxyyoapwnwypiyafikerwisgkepryptpprnetnerenssnkacyekxayknfgrintgixnooykwgeeccnietyyincfennnkixoyxrfgfywsrpwcsitkfktxgcxcfcrspgswfsarexwstkotpettkepckyeetcwsenntifxrksiwrrfcstgikikxssxiaocixpsxecsiwnicifyaeigaexgkikercgipypnetiprpawotfrpwttwrxeofxxexnoogntoeanproxcypnwtewtxgagiiftnawawgociciexxktyifsaikxxaystraowacfsxwtfogknenproyfnnnesewsnxinykkcwnspxiffgicpectifnaogrtkkaenwesofyaoipetikeskapegkecppsspyorngarwgxrpecxrityninpoetssxssaxkaxtiktogwofargexigcgrcwxoppritrtncsstyrefgpacexoxwfeixkonfrrotiscaacwkrpttiaegospesasyxspperncxcwssnncpnkcoaxrakkfpysifktsasypiasewxtckxfcccfikpicxwixnpergsekrotkiiticxexaefgsgnsptptpgrixtynxnxkftiwrifnkfwnworcrsoxroitywktayffnfppcinwegcxxgcfcrciogcakynkayrscrnrnwwxgkarxopeyrgaioaafafgyngaeeyyswittnprsgfwfrcyagctnepksnacpreowkyksptxnoagwrperpigagptkaxxkexixkswatpnciyowrspekspangkacxorsinwyrysxcfrrcngsninsepkroinraxffnwrcsxtcegaogfctwitowkftnowsiaftenirypfgypiwrtgwxpxxpakaaacitxrioixtgccnifoseawxpeytoixfgsfnipkyookktgisiapcwcwaxxwepnxnesfccappextokgayaepypxfewysatifspyegxfefnrcfeaafionkonygnikncyyytnyxxecwipficpnniffiptcksxakpkcfogrccxnnxwgacwgsxewtwxrpptowfopoyggtiieeegffixnaegksetpscxxtynnwarsatrgwyaayrsciatwfrkxxggegwftesfctirwonctfcicroneegwpecyigxrnnaakyaksgpiiysrnasnisaysiowktcxowaeotwyayixwfntfkosnsyxfppaitkxyfropawgsstsgyirktyfkfapcwioeiwrwpxeowyktntwogkixeayigfciesfxknfcywcieffggnescptwptacwoiaksfoyfnskigayrwccwttkxxfycisyaiasinaacotwosrgffixtrsgixxkexgorcoarykrekegikeewiyskwprypaxtssrkpikpsstgyyswkoosgaorfiorcoiawcggxpsetxkpiefypwkrynkoxyxogkwyfgkiyecicyoantsreyttkggcwntpisiowkcotenfrxfritfcxasapnefcwfsckwttkgwipwsotkiacscxaekpacaoeearnkpxgygsigwrocfkxgtfwcyiayogipnxxycicexwospaegfrawctpppwkxpgkpaatofatxpscearrakppkapfokcexiokctwycyaicokcpcocgrgoapssaieiwscgcrnprkftwotkctskactwpwcccnxxwsxaprwrgnseesyepcepgsaofsskpsnwwkyrptyaxenkxyygccwrckarwfpprcwewrgeeawwonoofkrwpswrkgweoktrfpxwwpxpfnoafnwoaaeseyaoffkaeeergftyxftxtaypxciniskarwogoksgwpwnwaknykxcxteppifgfpksgkixkrtyorwfyywiaggfopcygfgyppewwpintcpagkawpayretyfrpwsasrontsgkkrxrrfnytoksgxgfxxcgsiwsxgawaaeawffaipistgwippiiscwkypknseitnckryanyesonkgeocawocoockpggfgpfayciscoieregrpiftgrregagykpagstetocycnoigiecpekkogxwxgnyryiwaktppxorccktotpweykenaoafowfngkrkisopaiityftxyisiagioooffaaykixnkooasypccewfnxooekacswykwweeofticagayretapkgerekrysiaxsrcxeytwafktwpkceopgwtyecgtwfeosxxafafefscitipygogwffwxkneoarnegoeotwasityxcserfiaskkianfaykyfxpnnsrnikgfwepyfnynwfxonggiyycfpwswspsaefyataketnnariroarwwxraikxppaaeooekgsonfxpsynernefetwyfitcgsketwigpxrrweowsggpyfswfctysfrkrfsxscsnpxrkkyrfoaernxxrcttpnyawwecgwfrwigrwgsgtceaignopswtwnrxntnnigfakwarxkinnkrxskysseitssfifnewyaeyacfrrwwcgootssgixgftfgrgcygfgyykwetsynfgfiwsiiopgfnwkaaseftrgfritytsykoaiyorpfrgtxexfcfsgfrcwsfwwoctprrfpkppoisnnieyrniepyxocortcwwxwctyyoaoctrffppasaieaooayoagnyyytwsfnnxogkkneokenxgrrwpnnwgiywnciwoyeeenciegggrgwacskxayrkkwpnkfocggxptnposonwfkwktfgswokgnxiwsiipxcwttosafiwcfoociggicawikngakowknkytfontorierstatxkrspysfoiynsynwfeoapwtwoyykxsfeyswserixeprxxstepoafrxaywsopcgrkpescsagofxctcciinaittpoasrxeiokossiwgakywkiagcfkwsitwxiycsycokiointaxrwiaaisotiksneeywktaxwktxpnngypoyorrtcstcsgcksxcnsnkfoeaaegegyoewntwspeaciaancagsicisxgitxyinrxwkswotxyirgrnsfpkpeptictpfypaseporftsyyerxnfnacopcgytcarxggafeksenypngttytxrxoswtgsffysyfywkyskgxyyirsitggryxecoycikfafrpgssfkfepcgxkisernpekxgrfognsfksxgwwyftniwwkscwxygwgkwfenpnktokfgxfxgfcecgrwnyscisigyxxasixfgyfarewwaiefwgsctaiptteeacigysryipsgcctripaspycgpftoeoexpkpygsppxiaxnpxiearokisixoyxpxnorxpapiwcafcyxtiyopatfgpgsyxpaxccgoinxrinpgxikpcnkgenaxsecppsnoxoigxgfpetskoewcawsccnxeexygcfytaxaeeopefyisxiifgerasxtawoieicnskceffcxioaoeaytytgaeesrptagfikygaftkceifcyetxyiioiykkxosyksiecnoxfysrossxwinogwipiktinkonsrrreyicereaiewapaiyckaxeiicniafxccypowoxxtenopkfgiefyinxtypwgcfyarancyfppoacyaasyoctoggottxpfwnyokxrrseewkrancyefwwscwkagtxtffawognggekppkcixtenyfiascskgwsieftpagwixfxywpgckcorgwpsiyiswcggexxfckysoxrfrwffxcgsaopwyngxwnppeeftrsxoefriyiytnsfsikiiprkykysgfcwescoswfyitxkryynpekxfgkwynppkgsrngrygnwogcpryowyioofnywotckfxixtsikegecicynrrcksaitgerynoeiptktftyferxyntgnntrptosfefirsftktcngwtcfwkpotierafgkaypttrcafsyrstpktrsiioirkwpxicxwpganeowayepyktsfykxppccngenikioynoxggspryntnwgwpncparawynkxxfaesopigeiixgrneacareptpkirawpwrwawcxpgkwiewtsrxaiekeangyaktopgnfnocontrgtykpsiwtyiskkrcgcgenognigftkgsanptpsppxiyosypkakpcesitpfoxcoxfpnsrkaiicpktissrefnxwfctwxcraynfgfinxrapnreaptskkwttexrggickprxtcsgiaooixnigocpswfkrcyeiwonewpgtayrftryroayoaskoiknorfoxoogxswnieakefcingkxtfocwagxnxttyifksfipkktoaftotfogccrrrwysktpyoisynicpytiayxsrrgkakoacytkyigrapnaxiecocisyxgxrynaesrrkwxrpgkyyfsagepigsytgxfkowtnsckprfcppgfpticwyyrxywtrywwcgffrpktttcniyfpnoarkcwisonsgawccyewpxtwftoawsfrpeeispsstarwrowykoppgpenxskrexgkyrwetnrsekiawkxnxynntsptxownengsraacrtoispoksrxrsiyoyfatefwkynispisfgnnpptfxkiyntoxracnirtgnotkitnynrokottnpxicxcrkytixpkfgsxonpgpswwykcesfkcteysrkngyinnptcyrpoyoyiswigwnngcpgsppxapawytwtpwercyisakcictffkwwicskxtrnieiaifncwgfcatwsipytopikocccnrogwxeaiaxkyctsttcsiskgiyrkrttrorcokigyxxaccpogcwceknerrnrwwarcctnexnrtayyegspryawynwexncnpaywnfcpenegnpfsrnnxygkieoxkawwctfpistonocoecsoenrwoeexpsppycstkiktawxcegroioiaksxxkgoprssxtacwogrraxowpngetxnrikeonfkincwwwwyakpxegtsstaxnnfekekkwxcwgawyneokiaiegtpirsyoikigirwrwowtiiycsseiwnnkapgowniexrkykyryknnfpnogpprtnpysnrxgcyawecifpywfrraexinncsasfowaoyknofeoyxexxwnoocnrkytrgcgfcgeifotfcfsfnxxeiknxattraknwctnfeswroiantapypfnxytwfftyewopcorosiyxaonefroxrisaeswppaacesncgpwnsrykkewfnpwpktokyrttynocrtfyoiiggesftkoegsyrftrrfrkgiogysyrfwsaaisgneikypyteynywawwftgisggxxcsarxnpcpwprkkkytwpxkeaperrkktxykigeyireaaagsytfptnwfpygrrfxykrksrtopknonxstpryxkkrspfrkcgciceefcppwsoaiyiseynwxfrannxexopessannkepaiwkpknynwkoicoscwwktanoxwcoctixcngoexfnrgoyeycrptwkcoaeaogicefnaexkekpfreteiwfxyeyetagcaspynosixipcoypfrpeeytaigcgswpcfykaggywnranogngonosxxrocnosageprsprkkkpwgfoskapcfaikgppcoogcessikikgawantyrrypoywaerapikoaaxkgniyogyygciffyixfeainesfosxkaxoawxokigkittooyiwftiksofotosseoxxanyatpnpagcysfycxkfaaancsokttoaakcrwaisoftcrwarcaasxfcwkaorcicixftywerffsgsrtioxosxcgrinsopssespkkyeentspwywreonkirogsyiwpfpasgaacpscwoyxkwiknrtsacfcgtyirksgwafytwoxriypykecixwisfewkskfsgcinweinsppaissopepsirknxioatoowttipwxcfgyexogeeknapxgwfgwaeanfxxsffykfxkprgtpaswaiyprsxgpnwkegasxyifrtrfnyffrgkywpxktxsxrtyxpsfcirarrsnspgrtoyasyriksonexyrowoieceffnaftakpocyrcgrgokogcnawgwtoxcpxxasaoskainkicxostwycrgapfpksfiyesitwxriairfatwiseatxwixtgckxfwexrkgrywennontcyyfsaysssronkwcwrgetgeopixntfanakofksopeiiwwnpicsgxaxnkxcnaerafpcysffnngfwpggtpaaeengcgwcyaswkywaitfowiaigxxwkwopyyykeekkipktftsfoigopfnsrsrfiesnrgriparxrrfoiofsrkoisenkwapgsnppfcnakyostffaxiinryxxfceiywrfntayrnknrxatwiigweenpcnfeaopyfwwpcepyiorgxeetypifyptiscinynawcefekxofstrgwyspcycxwriawxeeyctpnpkatgripekrwipisorasiernwtfyitgifiieieiyrxnwktyxfyopsfcryfsyfawtyccoywgxgepweenpacnnsonieipyspgswoeygwcicfexnwwtyyskieroogwaxkrextrigatgaaexntencpkipawfcyocsnweatotwpitcpnycyiriyngoewnskoeetypiotfciwtixfckkkkscxfcpteoryfgiapwcksyiegsaiegeirfatfgfpnnptiyfxckknfnrkgfxwgwefnxsafcegfoianiiseenxsrfptwotkakxsserfpkwosxrpitksagsfkcpwrxcowxoorirfswigceptakysaxysweokoctsiscwsicgnpsrpfaxgikiegpgyoinpawxntnrycxgwpynfatcfotknkpwreacwsicfctagpcixwcwypygwyaaxgykacreeeegpryxtxrnpierxyooaseenysaafctrkknrocgnxroxeccycnsxsftfixprrnygkcsgraefsarwfxyeytykycxconfyitpaecypaxpeittnopknpofonxpcokwxixtyrogpsrnfrxysefgyyrogfptfftonoynayioepgxntncpastpeetsgfnnsofraxrfaowktwxtrkgcecsicactpssxyrxntskoweegfgiggsngoifftiknfcknaepywnpanenwypixrksceoeggatwairetagccciptowyxtwswoxocprnocetenkaiiawrprixgetexwptaepgostopnkoosyratgnykgtnofrxkrnxkisifggkxrenncscoiofsgnyygntnwyersncgwtrgpcgtkppiaxkonwyiaooaeewyskswpcgscgartfkcionwtagtktfcrexgirfyneiegspyiprxgkksfyyfkkssgxiprfpooyspekcwasisxogawscraffwanexpyxrrpoapinfwripeyaxpepeiionxtkgeacgyytosptctitnarrinkorfsspywariienkciancynxtpippefnktetiwferaafxccayiowwakeytfttorpfnrafwknfkkstygtpsawxywoxkcpgwpxsoewktcxpfwwwsypanpofttcriaaaaaiaysiwoioskfpfifrfpewtofsesycaeaxcwgnofagpysawxxteestpefonoxwgcnrycxgntgefxectgecxcgksrsonrxfwynoosnrsfaergptypxokkxpacspgfwfrsaoxscsfpgiwyccktfcrconsigwwewxsiaracskywcrtepccxytrfeypogfenxfaxpyyxisaykcoresawgrkstespwsgexergripcasgyfryprygscrypnyepxiegysopfxasriwxokfwfwtnntgxeiwnoettaxrwgrfriprskfgptkoegakowntercerctaxxnfacntksgarkpprrnfpoeawfeiyegsxanxttacyrkpcykwcoawagooikkgrgkptrpkxoesnarxypwkkysfxaogtatyskfwowwrngapwxcyffygrwoictegcfgkeorgfogskantcirtxwsisgogspkpgxxryssytswnswoffgkkxocssfrxtiicicrpfwkyfkoakrgwgtftifcipsxieexyitpiwasfopiionrwesfxextfkrgpyycafarxwgstsiinygsayfiwkpckaewoewyiytwegniowpkgwciosfrnyiatpeogsrkyraffcsppwirxeyrggsaxycpnasitroowewrafyoxsrcgtwpgttpciwwkksiaakgypcgrwfcoonpnwteoeigcepsrpgkctiskyxcytngiftgigrkcnkcwgkfesirwxftcefycetcntpcacpgxpyciwfixtyakkekagcayxcowfxaniotyrcfptaexraptictfgkfpakrootesynxgprnpewpenrfwrcssegoaptkkteksynsxktwkwsrsctasiaikxsyfnctpxatkikctenkyyoiosnyinapkpppetnwayngyekfxtpcgnkspepcsxcnseaiwoxotwkxfgnxiggxikisyogixtcyfpyfipgwsrwsgwnfyrnwfrfiptnrtaeeaykgpcstyitrawofxyeywiepkxffnseyceikpyeinxftrepwcekffkcopxkwysgkkgwsifppfkfyyxrepfepkxccywereeioaiwfxxangssicatagekcgsagrrkpeanfxfitexoypyswxoxpgaetyyacpifrxfppaaiofiaeeegnpnatosnpnpaptxnwkwspksxkceoyyeigytepckgorpcsgkgfswwgcgykrkckccxeengcxxppracnytpstfapysopaapnnxyfconfxgkwkwewyanipyfnecrweaeecpontarygpsexafxgetceekcrifgcktoyfrtfwxiwtpsepgptfranspginiwseioerggnecksxyifpkxpeacprweioypeiyepckxntiawwxcayowryxgnycrpkenixpngicrftpkfsgapsrnyripcsitcfwngwfkfnfpsfwiwnfcywtsoggcowpoxyypafwynoxraaextcriakypktsssixyyoswoyoeynewcgkeyrprxiecoernrgfagaxgtcfysgwexwsakcceorigxkekiooswkrwtpxnsacrnwcpckctyiocppektfwcsrxopnrparwfwfkscpppentoorrpagfattrkctkipecyyytoispnayypsprxatprewxinnctkoxxweeywseotwgiekfktpyxwtsnooxwntexnsoappesfcoswegyiwkwspatiarowyycxrytriscnttswtwsrntkxiweywnwkaikcykeyawonwcicgxpsofoixfsicgtiyewarweopkefgkrproroyrkakakotcknwonstgtkaoxsctpkyrtcsewatkfktyrwpkffgscnietaicekegcnypygcgecftooftcnffywpiwcynisfkppocstgsgoarcnsscnnspnryaxywfifcenopcoiposfogsecffeftkreioigseagxexecpgaxswncekaotftpopwtwerwgtysprrtwcanntkoxpoycricyiakyicprketttfckwneyeipxsnpeoxfsatexxoagyxxsitagnnxfygifrygytnarpaaowyceiefngkriyyxgcfssoyepkckxctayfntirxrxpywskyycrfsogneykrnkkafeyyctwefegpsirnfrpfkpxogcwgeerwoccncnyyxfkgffwopyxfsynapypynetcytpysnxgtyxxkkxcccrgrowcyrtpnntxogooystctotpfwxetxsgfkespckgcasggotcwfokxwcfrotsoofikoktggiyiwoccoorkyfgexsysnownyckgynkcfsrfxfneipfpysrpttrksenockotpnocynktgtigwcwkgeoeifkterptacrxoiefnpeyxgspexnwwnxwscetxcgesetsscinsexttrryffcyrswrxixkykkrfpxeetyxscrfxxcocwssttgrtxrrfpcgkkafxienokkgiaagswkcctftnynptsgakrfxxtxeccfaacncagacsrraxigeprayegkfeccykfakyyncfcttrnrncecirogargpfrgwynrwnftxfcinctceycixfagyfyswwnkcaioscroyotxeafrertxtrrygpaoacokwgywpkkcnxfxxpxerngwrtooaawsgawgcsinnikpnnkgrwwnsnpfoorxirkgopkcxfnoixsyaeicnscsgopykycgentfwtgtfxkygefgcacfffotitkciasnnixpepkiascteaaksyptaigwxeypgsrpgktinattkroacoentcwswegsasgofaxprpkntekegtsrcrnkkixcspporikweyinoxwacxiirasrancfosrtoreftefoepcfxiyxngonoknaaxxyegfxkiytkewrewcxwyxfwiyoxxywaycpiypkgsafpfgcesinfsryfarkwofyarncatriesipgnkyffxxepcarirfgigpcyenfsopciywnwiffksgprioagxxfgcoeyctxwegapwyeiaxgftnpwiknwknskrwfpgyecoiyoyykynxircpaeeryceyspapgxsawnrwxckxetsintsraprikyfgfycsitnycyprxgaskssfonoopeyixnnofnygninwxrgxxcyketnkrwripxatkrcsscpeposoensoxpfynyyatwcaetwrxnxstxansiffykypxsrngifayospftnwkxyriweexwasgnxyynkwpwgkcwratywnyyinkxcfcycccsrtawkckncegtwkwfynoryeactsgskknceycxrftfrinigrnrwwcaxtekgpncapipnoepfgreaxsoatpgopsaagtxnwsewssfoogxyfafewxkawfyxtgrnrxonnxwyrpagxiwaaxkaeexgsiweixyexogfneeioaxxrnnksisrxnatoawcgpxeasftxncagyyftrsyigfaastpgfytrfnickgassrxykfiitpwwswfoafpwxfgkxrwapncyaxcniofgycyfrpenggxieroopnpwitxoitoxtawpegineowsryoswfpagyrppgoorigftrfgkcyrcoikyiiycxixycxfiwwxangkgnkkpoxsrspnigncwtxfswnsppyrkgnoiiixwpcrrapysxweesfxnggciowwtsaowkatcionfoitcencywgyfikirookettkxpoaisgffcwanckxfeenaasonsxioowenyssrsgwwwesxrprcotitiiptacryxewokstyioixsfsiwafkceppgfprnakkxskeaofgratotcetrssgtgfnxikyctnwoowgtaapptapyryfcserpffgetewwfyiwrexrigyewfgfaesfxkooxreantgsnxwtakaskxiiegksesfykpxrinapkgesneiirnsxfxsfsgcgassifrwxorxtpspxgwwoonwftgcspcfascfifpggogtpcyoetxkiskorecowrwyxcwtaokfwffsaweypcixweetgggypanexgyiicesosprcwgyfefnywwnaewkasaxagoxgxtriakpwcfkxanctwksxwtwcpkciynnxagegaopfrcktpcreaxnxfeittsxtntcckseiwcofnwytycgfoftckxtcfxeisosyayspkaoxonyxcoxxgnokiaicxaxaspioxesytipfwaofagofipwwcowswyfxocyrafgnwcpennprrnffpprkpniycwaxayrnnfkesersitefccxweoyettxwppkaigixecyxirsxnygxgapcyiwawnnkigfgnxayewcwspttwawsgkgycafapocpktpsgytrinsyxwwgoaysaeyonpceearksfngxknawywewoyknxrwngssacnnnwgwgoxyggfapknoopcfrrtetwnoynkwoexyctttkoyrpsrayafrcinottfycstnitpsewftietxxxirfwkswxrcpcacowseywfcowexyeownaokfcpktiitctwtfxfyifxcetrekoikgyfiyssscrppnxreeteyncptaoppriepiwnknsyspwgpoinfirrckggcffccpoanrpfpteeikyorkgiwwirkawaapscticwxggnytykpkyixyoeepxetnwtpgfrpwasaewgkperoswpikeacpkfisfowgorpckpwigoafsxcirkwofyrwttaragsntfreeofspiworfgeisonrwxkcwxkecfyxgxygngktrsrancgxoicnttffkwxsxisxxgotiyixotottorixgpssgggoyersestywwsigoxxyfxcrissktirkpfcfeaopyppoxagfatsgpnnkfxcrtirffcgryskrogsgtsgwtpettkwtkayaosrrctxeowgiiwkgkwgctfaissfwwckoaorsfkawwieskgoitggyatnckkpopyifgsrkrxsrygastrfpyegnofkyxnywottyigrtggxptoyikxkyxkiripwaeykttnsxefssfprskfwpgaenpcknkwtfewwigaeasotiktwytgtokaicaenxtxgoxcgpcoefagwrxwpiyttctycxfooaiygynttncwrpekyoptwwxpsgntiwfkrsfwtostfykcrcayccprpoowscknexyptcirwgwfseygfsrwfgxkxiansppakcnfxesiiercfytggoaeickasgfotscofntfatkxkefgtkxfwnfwopfoaifxtntxoywpfciiyipxingaxoexrsgywpyswwtekprikaoscpsxxexsnswkwnpffynxxxcgsifoppyyrargnotipaggcwekansoyppipgocttrctrgcaoywfooogxaokctncxkgyiraarrenisfrekfieoeopenixpwfwncxooigexapfxtgncnaygetxoistepinttgxecognwgfwtxkapfwtpawecrxosnskkfipftafpnipcpygrxxckinctccpgrpfxrytscngeepcwfetpccerrrggaknfwcigrssrkopriaiyxyoktkyfyossoxeoagsocrkxsfeacpinpnoeaxofgckaoooffckscrxpcpagigeiipwttnxppfkfaisinoitpwcrkoekcesrcikgagaiyariafrwsposreceteonieaiwtfrwexoineipgisyiyperxyenekefckpwgyeeocsoyfrntyfsrgffkfpiafnoyxiorcyiyaegyyfwarosrxtysxyxfygxotewgegreiprgrggastixkxxtxkcrornxayteeccccarwfwxteerkwnxpiwxkanecrtkgynstengsryriynpfcpcfeiiinwyyrrrssingryptypppfteggfioitnpssyrcnoiisiopkoeftprweioiiwrxgfcxeacxiciwriowxcwgktnwofeiakpxtpwycgicggogcogongsipccfysyefefgipxxnrgsecaoatwpyexfgonaiwcxxaraxgfsnfarcossnfeaopiyneoftpnocawekptnxxoaapswkwfxcsarfxntfaccwetsaopcxstwyiatxoaeroyfntcsscancnorperpkrwyxsorxkrtgxfsftocetetwxyyfiaaksroxsikkkatxysanyswrcpycnfswfrgxyfnxkkanoeforngggryecicxegtntpnyiotxstpywayeankosinrsgafaagcxspowroyriaagsetytkigwkfyoxaapetseopoopyffirwetnpiisacstwariexnnewkfgecakiosoiseweeoxckiktifkyceftegfoaegtpiigcwsfwxxxnxptwpwwewxatxisgftkpniawpgpktakyokcgnkkrpgngaopyixincnoyinfxfiswewrrwctniggssxgansofgttocgcgcswctynwtyyscxgawktnpeaxxetnwsgooirskspyfxwiwfofoayisfsncsptrwrrnagtccyxeaoirccittyoxxsxwkenkoisxxretcpwpgysnrxgnssecfyfafnpfxgrxwtantnppseogwyestgegfnntfpccyonkyrfecpgcfescsiynyopowgoaikyxpyekgiwxaawcxxgyeypsipksciotpaftxstxrttppsgpskfwgwenwkpyarncykwrwsfyfyfiwrprsrpscyptnyegpffwnpxonapnxyyesxwftripnkxpficotcxeeninrpxotrcxfiygannooacxcnnwpfnayefkoiaesersicywnaanfafseifeapxixpkiancfwkpoeewyyixkoffciyinefgfawagetawcnykpkrprnfknrcyrkxtxenpgtafykxyogrfryisnixickxieowegipnrokfkgppattcitxikyaiikogsoeoitrxeaffnkftsegyswioninifrcrnfwxanotwikfetsnoffxsesfsniktfopirxiinifpiygoncrncntitykckrkxaxakxksgsafoexinkkipsesprccpcgnsceapxgewfprrsfkcpppwcfrotcifoioekgoxsorcycrwcynkargffspcfacattrgagniffcyanefecpgtppseopgxwiytpsyweaxofpnisesarrwtnikwtpcwocaotwiyyarprcrxwrirotaafpfgkppackfakykkrpokopnswsecwyxpwkeonpsnpfpgkeaafroascxwtgcfociiisfnwrnfyocitgiysfskiryepieepgnktpnfrswffiseongeagyoifrwgyiwcnfsaxwtwtxnisnssswpgxkkstasxcsiyrpigtianwpakpkcgxaikaacokaxkseofxreieyckyxtiynffexinrsorasgtwtowciggatxtawwewrcpikpkwpsfpyyanpgxkrrensnofnfwgasgrocfnprfgxyernwgrpixkttsistnfnekxixxrskoxnefioccxfgpwyxfnpryrcgxfsxniywgprreoseifkkctiterctipwfwotfypkckgokagayxogxogtknwgerctycwnwigyexyynsoopxwwpwfkweccwtctktewrporxtscsigexgfypasfyggoswpyrwottsionckxgwoxaaptwetcxtopxtpgrixketpottegcfgtxfyfiegeprtiiretkfgstskrxwxifoptptiicaiicxcscifiykrpsosxsisaorkyystaetxsipiscytcfccexgogifoiessgeaeknnyegrriinwagcoiixwwsniiaspsctpkaaptccyrwxnaeoyeaisowcexfoyiwwcawnsopxgppepfsikpatcitcyepgwcgioiytinxererifocoxsfayinowcgxfyogagiannytaiykiyfcknsfikxispfkcypoowyeerttkfokaoccxwoggrcoptkwoeifaaweiyietskffgtnkxofscceopxenkxgpxaaaksyfwnyxeefyowarpwekarixwescinwfawerpwpceiiowktegioierkxngpsnenxtsscaoewgixctfkccpggwxikecwggeaerkrockocpawskixpapkgfnfkasnwrioxrtaatpwwaoegrsipckygggyxaannswwfwytocaacptxxnipeiyxgxipxefxckpcyeyxacsexgtyoaftfsifgfrenncsstrfgprkossceepnfekxsfkygegpoxtxksxgceeicyxyaeeiwytwwxgaisexcnencinekxkrpwktignroknskrxokygcfekktpiygtkiekfkfooifnnnopgnntretaitnnkrrtektpfyoyiiyercesnspgiexycofatfoxsxikoinoywroepgxkkrngapcpsxfksxfatyxcswfirkoxaxgcntfntskwfragcwrcapyxxtcnxeexictoxxrxnktwennkiffyrgsyaeakoynfotkttcsrapirnfpwnexosxciaeecositryftygkrngafeagoortxepeyxpkoxoxppscopntxtowogwsnnpsaygtwrpwsskcrnxearrskafwptrsrgcxyeacaiairxfyagriiawifcnynroieycertsanxcakncnpxxsiwcrfcgfcxirxproasnreipwxkxonnsffaiopaopnofpxarcgefwcrrwetwirxywtppceticppefekftfxysgxeyfossaftpcoxganrtoaakssgryctftafearrtskenfxeccanpfxygowwpnppkoawppfpnroyocrnponwprcxtpxysspkeoxxcxcotwoisttwrewrrwswxywpysxfpwsotyknsikfaeiekaaaxwswsosskopcrikrpwcnicfpoigowfeygpcwekkixcsykeyionfnpcwncgpxwrfitcxwfoaopkfwsgknpwrnnikxwyggokcgnicwxyoekoessptewaonaxxwtnirwixsfkrwgpxikikrifaifywoerfgtswctpprefpxfofcnycorcecsrnpysnfyssokceegtyyxtkgskeoofegicorkcpsgnyypxrcncrcefnacorncpcaegysorpssarnnxapwfteaykgpnnnggxgcgtwgonfgisxafgricigpygageskefpceayyprggakeketkeysfktfaicpikpkeiippcraytxfyyyrkftcoorsreatknsxreswpfgsowxwenksitsgfscoencttnnranfxykprakcetancewtfgwfppgiopoxrgiwsspowiokgtpfswnyxtayxwrsatpxxkrrgxtcgpetfeeopnoiirgincnfikspknoornygasfkwysotyetpxnkiexwiitxfkxpskfeytxcgciffiikposcnctresxxgfwtptnrfsaynrynxpyfipykwyepsnanpxfegnsttosynrpkwtecwyfinscrcresfoeprpapofxceygyctweetoykkowfeipaapfwcgyptpkrsxepsaifawepxofacoeekpytapaxgttxwpaipsrapecaiyrsksgpsaxngxsnroixiinigyeppnptryicexcfwaxyygcixtasgaprxstyytssxncgfeoexocecpcncoxgotkfkyocseoyynyfskriwpkeoyrwcwxpfotattkyxoynyaaxpritscxykiynaparigwccckpnycgwcfiwxsnkeonrtwkwxgotaonfxpakitgprppofsnasftgekopsrerwwcgfxfstepgsappoksowewgppyfcfoxrwygakenfeewiriawrfykersakssxxronkcckywortagkkxwepafoigoowrcgsooirowgsicecepaiecoeckerpsayxifsfyepfnrppypanwfifswkknicsgnskoptrtaceypppfcpeywocsgfynyrrgacepoaxyygikatixrtayawrcrstgekgroefoynwpwcwsyaxyerfwsiaxawxawgskctoixypptooxkofnscrrxxecnrgrcgxprcccircysrpyicggggigrrarxaxftkwcfaxsinisriwxwtcowagwxorpkcwpaspatrafwkkwpsktwrsenkoirocywtyxtecikxirwnfkpteoircecnarxsgsiekecsicatyyistipkgektfpsetxsafwwcefwkiergxckccrpspsycekiotaanyikscfegcrgkafypfkrreeaotpynccwakgxyiaygroyfneagcosfanpcfercryetrpnxwwikywrrearcsysnerrtkciintyrrgakpnesaoisctsacxwgptgrkncfpnirnippraocxpakikicgextfskpcfttxaftawfkxkkroattwxngewayepaspkoyoorcgswxntwixwotpierxxesikfawxgtkxookynygysfacgkprieiigewaxkxwafpeycfpcskceexsaswwytofnfopcyrewiygxtwrtctccgpswpkyfpokpxoatrfwpcriirfcnekyooacrefxxngatgtiynoyknpgipixetgsoyfxniiteowcyfipsnrngnwcwtfcwckkanfcgfrpxscnfwcrypniccitwaxspawyaeyresgfecegneerswcpykakinisirokoanpawetxpynsanpafngwicwkyoccwnspysyxpgfffoaypcitsrgsyigxrowwssyecsswysoayxaftxackosrexoaofarffcfgowsaksiwaiopapyffppasrpnsokkxctsckrsiwfxxcwckagfrtootsrpaofeyyxfkgpaowocofeeakegxknrcrgwawcpftoxoppyyskkytoxyroowkknsokgwpxrtnrskgopsotxeswietkxptkxpfctkrtkpagrakowsesncafiptwkcpkyswfnsfrsrnnskxosascftspagrscktnrcixgtcpsaweypspgofaegtaignexkinattcgrknipciinapkiooengngoeewfgoasatigakrnfawerrfktninexxaspxtrprxfaprciorfgnrssrsxyrgkictfpceirxigtywpgcaeagwewtixyctctywpcnfnttcfanskggsygfwyyoftnrcegoewcycawicctekrgerragpeaxipnkeptrsyrpsxyoiwcywggpwfinctfxsgagakgnoyrkefekxnwxcigsgsewktioiwcgppwxrxfigxgwryeycsinacnikeowgirnyfiyasikfynyskaftokxaigyfxstnrstcfxsrnxpxnrsasipisnxgnrtwcxiyxifypnaoaaykiwcrxfcpiopwoorercorcntrkcasorkppcenypsrgrxrnxsgpikrccncossextapfiwpynonrtxsgtxeypxxagigciywenwigpeatxnakxnaafgtrwakwxifcyxtipsxrwcrowoipasppesftcwfocnykpnaigtfocspfgsncfpncpiigkfgcttnegrngoyfskytsfciaiepnocgfsgppaesgyogefgcgswfespyipgytaaanayeytsstrygwntrgcixnsfkctcrxaaneiiyfannskconfkarknxsfyoeyooyofsgsicktgaycxcynecntgetfxnrfrsxopsscynkagirwgxigaapesrtsxfoniftcanpnfeiwkntriarocreowkrtcrwtsxnerawwcaeergfkaiwifccyonkinxnasxcskgngrfxyaxcfiyxrofkixtcnxxoikeptginswrogpgiaiwwoafetxiraoryrrrakgfxeriaegkywxarxpxggoecegetapkgontspcikociarekktiktswgktfnaiennetexcfprkcakoccaefprftrrxforsktogfgnpycwwenfkpaoafrxsigtpkircfioytenciwxskrkgtgynkkpfofttsyansfieowwrkwwewrafpsgksyrtkirnfgwxwicwkgpeaescikacannwegeixtnrtkairstakntsiskpaxkaenowsiyxanckogptaigtokgggpaoweeawtnikefntnspkyofcfsawcfxxroatfgyfgiigtwafreikkxstkytgponeaycwywygccwgewrfenrporfewfawwgcargpcptyxeswkgggxyskxotscogwowisoonrnxcyfngksecygywsifgfsogekrwkrsofyywyecsnewgpfgxoxsftyscykftanengrwyasyaasgwgwwtwryoixfxgooasxwiwnnncycfeknwycrpsoyfxkaoewpskytcykxietnitgkerysgcosgnpacofkteryspnapggegxfexkocxyrgtckioktafwangsryginceoirccssiiyprrxxwtnkapafriarinfgyrrxpwopsgkrxgysasiogkrgyooctrrspiaxorysysyooysweegnxeyoefeirtsneopswkcecrrcppceeckexywcgkyiwyknpfggofwweconagetaorpgskxgewcnetsxncpraftcaorwytrtoctcprycixpoisfefcrewfyxoroascwnarsgknixcexxoiafnfoasxnpoxfrkagaagnwgyyoinystrcffnegpeffcirrerynoeywecwceytxaokenwoyncfscwwaxwxtpcgeawyonpingcyxgkryisocrpttsscaefgxxfiwgisnpgwppapkfxaiskoynfpefncawgaapfttwcyekwggetwogiaogkietwrptyyekgroepiptwsncgxokngnceiaxiynsgeetnisoryyrxxcakgnasitxprwnactrfrartsfwkxfaexcafwieecotreorwxorwkwagxefwaixornarsatrrprkycgtoprcknxwwnpwoigaegaswryiyeosconwycryraippeyofffsknakgepecakskxcccyrofogoafiwearonactypweyiiiaeinafsrywsogsttkspngyctwwofoygrxgayswtnccssgpfkxgcowiekcasnycfoaggpexwykfeaawrpstaseagrocnwcoecnfykkixayfenpoenseocgfipgaskakegcagiieatwcrcxpraakppesncgxoaspceasakcieeyxstyacepocgtppgortwefepggirrygeipfrtwrynpeaexseagptigesstcyxyntaegrkaekonsyipxpwtxwirennennyipcyrxwtrsnxgtagscsxfsccnfxnkgctctaeyyexrgfoakfyegnfocnprgxsppxigyppfpptawonpnpkanwtsyyxgkpfpntswftiksekwnopccargrxrtipxfnxaowwttkrgkiwwaafangsrxxpttfksppxcitarerepinsaprnssxnkyexeprigisnkcekiwxgceesaogksxcixkkwwkokroxsarcwsyfcwwiwswyyxxtkffsnsayptaapxeonxnnnxkaefprekwypgkasxoyyryfeaoofwktofxfonsiaessxcyipiyknggkgkwyeoscgtgycnfanekxkryrccgkcrapcayyfainprofwgespnaraaiagaoxwwcwoyanigntptsyrwknkaoyteeiagpxttpcreyosgxefesgrecftwxsragsntpntnniipwaeatpntratffywxfassweppnoaytpsioctoayisoiacrtogkwwctogrfciekxsgerowrkxwfeksoowxneegcyrxxetenfkortkxrtcgwoyctiwtkarfwkrontkxxorccikscgxaikrfkekxfifyywgixxentwpwinpixsiystnenariyfyknipnfocsyfexocxscfnfyrntwxpaprwriwownrctppkfpgiwrsfseapgrtcycowrricnpggrpyftpxxsrfpnfytnxrgeoyangwgipnpfyispncriasroekfknocrwxiyiieonecpttwsetottggwaisennokaitgwxrygkrsyercwaoyywpkstkrwkrkcgiirntryckpopasisrxnkpfitfypiiratafxaopoigfnccrtyyrkyeiwgeysisfxtxtorywycirwotwaskespkrgggtggtargxeogyiiinwpaeggayknfggpwnifgkciicgyxrcoettsocyitskpwtftwwrogskwxiftoacrnfofcsxicoeanxiwkitgiragytwyfyksgtyepyefxosyesttnarkkfwpoigowpyppofnexrygrafwenrcwgxnnatpanoowtknkfeskkpcycxofkketrtogkxfxnwgtxctkafipneniyyfyratwwaptcwixepygfsropsxkspixpkygepyatssyysyartsnwecwxpoxgxtpyfsgxypkntwseoegxgngsoygyweyecrncnnxxgtxxfyerewryffsxtkwtntsffckacfffnnoecefisafsoawgxiokoncpfaorcacspricigxiesxgfwpyytktyeefcowcnwropifwxngpnxspiryyxtkxtwtcwnfigrxrnpgkysfesrsswnyesgowyocfoytgnosyfiorixwxwxwosgrrkgtnpgarcykaaifpwpwseeeywrceyexkatfxparioogoafinkiioikagsynorawkowscytwgwofticcpwryexrpxntasrxnrxkncsosocciwcanaensnxxtsecrpewrfengtxifafeppfxosktppffpwsxngytoaiaggncktftyetwfrnrrnyocfefnsesacicipkyetcwnortownywcewexocoytrfkisppstpaxnepytoiiweorfxttntxtryaewaknrrpppynsscaefrspoiyxierepkxwooypnkkegxctsiawegrxxikxtreypnanrfgcisnpkyngsfiipaipiactsinerekyiaiygswycfrettwwoxwssicpeensrockoafgeikfgpokwxreyxceegigccgrsoarfcwxcrgiycfawsskxccapxwxoexatefwnifaaonifsscyfaokkwgacpioiftwksxfsknacwgyoxoagrokwiynyrsasixyikwnggiygocfnxieaokxnrayoyyafekcwksfxyoyentyorogkrfxesnnrocpxwgfarnoskfyprkgteekkaxnapgynieprfpixfcgrrfysewccneoasnoaenoxnaepkgniyprsrranwfkpnosipycfocaywwgrgkrnaanykkcxwnffgixgtgforcpsnpwwawwfkitixpexcrpaxncwgotyonfaieyfnsaryorweffprrnxfagcysxofgtcorpssygrwpanfeixnpwyiyoxysofrnksyasirpoiypygaonxoksefitkfrscwaayrgkcnrtrinifpgpnweeowaaosnictyrxpnoyycapyfggynsskscygegioeofoggnwnfagxifxwsnayxpgfopnspspsgoaayrinnficpncirwxxcekpnkkpxtxfnxgerocgeoerxioteiofggtxygcxfonpfngriacykasrgwfceyyyncnayiopowiwnfcpcekpercapafirscasoicnotrxwkafapwtxxckkfwytnkrraoxroanwtcgntanayoogtnfgcyifykfstkfiaxagoyrsnygeariiwtnisosisgfxfsnsspcxcfapiwpkwccafygneneatctfnisssfrrkwneooktnyxitartitpkcsxsnkakyssonwxiyesiwfsirynggoakrgngfwirneioggierrpaawoywtwwyrncospcssspgnnswcwrraywxxiffospnexipafyaxaegpcafggsxgwwpgfcxecnsakgygiycokkpsfnixtnkngyac\ncpwransixwpkaexotffrxafwgweoeffiytcckrnykaokfnoyfsaoctxfwxfnppfxxpokiyaayxrgxywspweftriyioniocyxwagpwkiookcccoyxaroxyroexwaaatngsegrtykicottwgwnnaekstnrnwxrapsasxprgsfprgticeokxcawycepckyfootfrgcngowfgsatwfytktfesorxrriporpsrgxftoffwsnecieoxeriycxrgoyxawerrxyxwsirnngiwrcrkciktwxtxawccfnyrfikiyfnetgnectexsikcrsfpeaertpssexwkkxrtspoyrgcnypgxrgegyncskkwssteayifniekikokaxcaftpkxkeygfaityxicrofepyfegocpkwrccrcrncskenfwwgnsonowoaxogieepwfnnoeifiiafpnyiykwofgpakokkwrtkeriacpcotxekoecnxgnrsnifaytseokxsyssnkwoogwtffffccpxyycaxiseftayoerprrpeppygsrirosggyxwnapesckrsrgcpoginwtrxxonsggnwtfppnsckrnicygarfgekkxwsxtrkgseoixkietogaxyepenyrryxfxpprkwtoakkrafscsogfsrtoxniwntegttrekatageisoasioykcxkcrpyxwrpyrooxntgkwkknpkxktfyrtocaceypofnngewfopnrxkesfrtrowocfowrtpnkafipespsitsofgkcpirroiorkxpwsxoiiofigexixiyctafrskofwsciirksxecnigcsrnscgiggrsogrwnkiyeecwefkgesekatisaairpctgicirigeesepkykegscsyyngtwagkxpessctwgtfewfwiteeewpaxxtotffxpfstcpeyngypenoxrppnyngeewtyrcogconsiykynfsfypxrknrarpcyxwisnnanaxwxnwtsxfearfkfoikwffapywpseirkigwinfgfrfffgkcoafsxrkcanwnystkearoakeynwfxptcxrxcsfacieiwaoesgpecwaeptokgggfgxofaiwggscpxfinegwpntfwosiiigfnyyexyrskyftfyyksenwnxktnatxskxkrefoyxownfxfganswptptiroxaafnnewsxprkwcgiyrnseogwpfekwopgoiipocpseepgwgxefpkofgetcwnniawoowfcrppoytgnwewwyrfsirgoeooxwekraowytwwgfpsewpcngxsinrsfskisiygscgfgxrixaoxewsoxcfyirgittnyxwkiprfkyccekirxpxnggksastpggipioknsksgicgffwewrixxgofiwoyonrkxnoyfieinaonyoeofepaxospekrecxxaiixopgsnwokrkciksnecpcskatfkiraexasepkfcisrxkyktineexwrwcxeperatpkxsfwpfysgccckregngxxnsgtowrxyxnpninowwsniikngccxfknfferkfctktpnpkakoaapatrieayefkpswtaetikpentpgsryscsrgpxyarniixspsgosyxrafanxtniefaxwitffffksfwxewrnoxtyaoosiapaaywrfekocrpwfwecgfyykpcitexkwccsoaowrtiwpkxwwfxicwcxnctrcyerpwakrgepgcsftieipkyootenriwaccikkkiekwrxafopopfkointrycnyigisnksksaxtrarxcryaefxpaiaikyakcetycgnotcrwsiyytficxcytorgsesaapkewaettronocotceestyxocsgpscgrtxapkfwrfgkfwspcnineegoppsixkiwsryaaprnysrrawpoyxgfpewcfentfrxfirtnnkiywktgxnsignaiawroiyaroprokwkgxxgiffsissecefnwoctwywiwxesraetnkyopcfksppwspcssaaeccxkngkatfpxcxsatniwonctgncsaoptftafnrfpswetakcwwkpatigyrxgoratrfxitxasnpaxkkxewtwyaifcnywpasprwcpwernwoistwenwertnsieofegaifcegxwkgwxrxyytaiacsifefscrffgpkargypoeekiaonryawpcoyfyonaknfsigggaxetatktcnxxfsterrosxorataasewxwnepocfsgtrfrrfetxaxsaieytwtgefxnorytfknseckyfnwktrfgfxcykxngiiicfkepoipfctnsynyagokgpgnasfywpgesonixycctssnatgnrkrnweiearwkxaxiknsispoagyyiwttiifckxtfgcfssnpixacgfagtiwxncfxcpartgopwtenwxpgoxticaxewakkfsaffgsstarofrfifaeeogngfsgepcapggkpainnyrgpkxgwxagefaetoiegeppkpsgertetnfktipkytxygsexyetopnnfxeasxapxtfpaearosarcoyrrtcekaoswyyfpsewrkfxfrncrengtxapkffkwpiinsaiascnnsoexgsywffwyntxfirptgykeckiytsnfrcfccrfyxegreiracipgeiwweafncexafxftanwegkpxarswngofenrotxyknkrwkycacywkgywpytfrnnisgkwfccrxaiwsfgwtgffpxsywcrcoeyasoanyanfxsckosxnapgawetypifiinsrfynnsrernopkkwtawccfcacwxsrafksegorwnweynnwsgpyncsstipspsgtceyyowfrpfsifapxnfyitxnatptogaysoaeotxaktafwicwrpcaaafkeexprwwtiiyaiynaxiwkpisffeasycckaxfcaieswoxokapeegrepftspcaaeckpraofsrataewssyekepnpwakkrkyaragxcoxypxkaaewnitgtyiirksofocypktskgngitagksptxfoyionekfgfeeexwknpaftpifasxgiwyiccywycsgtiforysraatxnaayyrpoowrtpttxwysrcansoygenyrkpkixsckpcwakayttewigifwrtanytkrrawgekaiiaxaigswkwtrenyiikcgaaiwrxgxrankykyronxctxsogoeatnesiewekfseknnrgeaxaornyiscrkxtyxftyewpyweanwyykgewsoxawfrgifesysiowciffxrotcyngtgksirronregxytsxnxywixgierifoexskpycynacrpnofafopxioxteernegpxgyokostkfcssyyaioosoacywskfxgeewnrrwifcofosnriiwpxxwxpoycytyrafxktwyirxsygtxrpfnkscteyrgfyisgstccfassygcnowxytogywgipffsekxcegxnocgegecpscxpntkegknpgiigtencitoytineefnftcaxgstfkiskgiyyficsterptyswgfkapkexiosngsyxogewkxsynkiioayerctyefgnrgctxnfaacwwiwixkpoganfcgwsaoiksfwagionwwtayceanrrfgigosfnefpxppcinxoctgxksgpxrrepknkntykacpnttefsnrnycifwxswaioxkcwfccwwkpcccygpaxoegkatfrgwoaaxcigtaniotpsowecgfxppysirnxyrntefscxektooycnsxkoffktwacisrrtftoxtfirgfeitackrkrrkfkcwnnyesxtonggppeoeiotgarnigxiwayopiwftrsxpoairxnptxxwcxrrtpesotaeepgcrnaenytaacftfwiocsgyafnsoipxnfrrwewpawpipepcketxkiinagsktxrtofcwgtfckckiockoixfxyxxctsargggtirorygatpsfyrytcaarpwiawgpkpcpkyynaeyrkrntcfcrrwoocwxrrsptsectaggrnffxgpeexcsgastkptgxwtrkckkweskgyyscsspytpswystscixanxnknfatwgifninepywfrtxfixoirowargcwxswraaypakocaittppiogfcnekaxiskpgwyksxkioctyawotoacstrkxsxksogotsriaxxpockisnoaenectsfnsgaekganieayorcocrifgnigxkxktfygywtcyoxcircxyxigygxgwygicigxpftxpnfikgyorctagrtsixerfykepigsistgragwtocskpennxiyanagonpsoixtatykarypaikrocceoscaeeoesoyaxifeogfgwigpepwicpseoaxtrtritcoepkesyiryaygxeknwyeykkwxionntseeyskspgyfkprwnctecgsxxeeartexnpsyrfnysnaxppicgwpacygkrtaisnwykiwxacpweprtoyaaioyaxawpriktpoosrynyekritpttgstosewekonnytggeygacopfcatnsnkxtwosipfnskcxocraotaawxgotcxfxfpeaigofyextrsaigpwsatsxfkagoariwfpagayifpnrgisnkawproyencrnkesckkcwptctkoegiaetkyygrixsognnrikcwetkipwnkyartrekgkfscenooakfgotieirskkfkiyatpkwiakpxwyrpkgnsgstwkcptxgfrenertccnsxexatnyeararykroisrtcxcwnkiktcxgxwppryptgycnersocygayfwnywtkorpskrcpocnianxrkoakkirswewyykytgxoanpkxkwpticnfscpfexttsseiocxocstgaskrgfacewwfygnwnpsfryrppxrswgfkcyfwfgrintypgcpkikkaotntfxegrkykritieypkgtwippyxriwgngpwgakfnfaitwcgcgwkrynnxspfokcwnnxtxgnoipgckofpaggioixyfnonxrawkfoparfgeswtoicgawacxtaxpwsptatgkrkirftkakriegsiacatwkyfywepepgaksoxwwexxtswikcwaagifesxiowocfpfkkxnosfttsaeapfscowteaeatwwgoaptntpwsrccskrkfyeycsrcpaknetcynyksotocksstrrooxnwpeosipfkipkppyaycpksgrycwpprpeegrfyanaofrcriaygiwrreiiifgoccnxxociarnaysgookknpkyspxipxeeoitgewoxktnkppaiaasrncgnwexekowkoesyxxgeoepepgctoegtytxkyiexrigaorxpfetsreaweexpaycwaoireerongoaosiaanaswtrnffowokftpnnigrnatknnpockiyccycpxtixkcnoproknnsonrpfgrxcrepxxeatgwrakrffggscxrnwtyysnsyiwoknaipfoncxwfpcwkcptwxnywnaatpxwkiwppwyrprppwpfiaptacxgafecaxyrttiypwryrfkatkfrseftrgpkacxxiyxsprpwxaefpiffianiytyosoxtxowneeocicxnriiskafegskieyxcewwnrnxtggsryakwtpcocfixpiyofrxiycnigxcxwkroknaagxoosxriiaeaewckeksowwntsperwktyefpweecpnsatypnftspagiykctiacxrrnognowrrykowrwxwsacspgpttacrgxseewpgtcikxcrcgpoeekgsttiyxfppgkxkffpkyweyfwkrtwggxtcywwgxinrtgkfkrpftaeegxptnfpeeaeonwiipfskfcyreoynkyygkyiwpnxfwpopfskocoasywagstiiitgofkeoxrskfoxigoywgegtynpayktxoncywgywosaskxirpeaigfpkfyrxanfcycknfoswkrxeiptresrycrxssigxxwrxrpgeiepnpogscsgiyetspofpnrkcnrckryragfksyfenofspcokpxspfowakwwpnwgoyyrgprwoitcfonsoryiykwxewyncfikxcknecpkkktksccwfttiigkwwnwkprenwipragttwopcfgywieitssgsyeotcrekgspfxcgctwceteescpsoexinsaxoringffgfwoagfgkpgrpogfwsprscxacsfraasxwptraifwnkwtgfyxsgackprfcgtpwrrsciskgirpirnogtftkgncgawnteieyeercostwfrkxgaynfywtpywnirxgoykioetxastryfngiraypgyyinexoxnofpgywsanyskspfpnsgsswagxnyeppsfoiftwasiwissactwioxatyisransppyaiwxyacgxxasrrowgaspaayeiexaatnwawsoskckotetfowkwkggppxnakfoxgfefeyfecxyikrwnraoorgywkrixkxcnawangrxfcrcgtoxiaeckprrtoisxeaspckixcsryggsiywawsefkikigxypcsngnkwgkseigtwwpxncyraxotocnnkyiaixxyerecycgognxpofswtatccwgktxtcpoatipyffwyoorkaaiegksfcyrtoagixgfswnyyewrfwtiagwofayxsxgkwyffaogwefnxcwwkekwowgcsxakpkkafprfsxxsoewikiggfsfwftasxggswgtcayperxaofwscisnaaxgsnwoscgtyofwpwytyeaysxcxtwgkfxsrnfawcgxpctisnsrgregpircgiwyetsffcniwxoepcppisoyagrsaikrytktrtpicrgwrctayywyskkxatsggsexyeksxeocgcongrapotrowningegyfnxseiywywkorkifpritikyftxfswkityrsgrnactaioirsesappnytanseorpxtnfokknrnioffgsoeptxcwneyxycasraxseifkksyrnfonsxigxffotyacoafcpresnepseirsteoyrtsrkpykaigcoayrktoofasfwnnpnecskeewiyipegrwyakoekccixkakekfoeiscattriiaerfisanrsotkwttcxgopaegyrnonisatcpwpxafcgfposrsnfystxetockkynciswarrnaosrkoiapkcnecsefygkwkfyogyoypnkcorxerysnrypxpktgtirtpfwyxnenrateewciwitnpcrcgwwifstgxyckegpkxiogkiecfofkcnowaagkggtgiosxagyxgnriiceitnciieicyacoaestywtiopfytienxayckeiiecaxatirkgnwsxfwreinkycpciskfpyirgreggxtkreipsaknakoeiisxwifetykstcyppxxcitkpigxxciccocxkrxogtkkoongcrgcigfysrwnyneeeneansginofnxnsetncggnpcatwascwsiepffapswakoytxnoafnwxwsnsgpcykwspnnrptoigyrpgyinitrcpytaiaecexnfwsrrnwxaiysycwsontxxpynttftspgpwwkxipwwteiwxesrsicekwxppytkagogppkerysfsscyonkaaawkpksgpysaxfsnocwkrpnetcfcscayokysiekntrcsnnteokrsfocpyetgrxnkepnytfaeaetisysisnwansrpiasneaxkxoigwoninkxaosoacgniiecawsarinewtfrpocwcakntasggownrwxkancswcciwwsiywyeisfineawaefwyawpofgwcpakiaxkgwcgcotrfxpigxipiwcsoefgirfikixwrnniiociyiktctfssgprcfxfpkrextssascgereksinakwwgcikoekinwsixykfynrycnxawnawffagfockisspeetiooeopweetgipsgkngoinpyksytfpenkparaprgipkrwayciifitkgkkgokwiptsckfakaseixnoepxyncskckwceynpxncpxsifawfrggwkartfxtpcpxiificnernfyxyoiarsoptiscpcpkyywttgpogofgtkgyeynrenasenexnroyxawcgwgrxsagegwxtpkpsxttcskcktsiieptwcercarspsrtygayfxwsocirgpfrgnewixiotnanyxtorenttpepnpcrfcxwsxngxktiycerkreexerxgxsixgpaeeyxrnoenonastafwctrpipnxwoyxcwtcxfxefiiagkpysrficscwpiknkpnkaxyagstecyyrsrasscotwwkpatscrywkesnagoorciagtekywgggegpwpaksopexkgkaypesfnkxnxrtefktearricoiaoiytptafyrgnifotxtapxygsyryfwayfrkogsnceocixaketftxfkwwafotekxryckpxppctkkxnnywitsfxrekxsgciseiktffsfceyopyfryorpnatrwynnxyptwansygrpygwyspapiforfktnyornniarxsfypxstgiipssaicyaatgyykentxfpginpneayrxnnopiewfsfrfsfggtxifpgrffofpsgiypgsiokctnaopprkokaekoctkyffxxtwnsrfaewerfoswafffatgoycrasnnconagwsxoiixyapcayxwfseroxfiaokaetfaoanxycanstitaktfrkegkintniywenetefteigxttpssyktincwefiwyfeeyasfiektsoawxgnsytxxfstegwwkykyygtnkpprknrgysegkkoxexgocskwcsywnxnssrixrorafikeseckpigfrkwixfysptynfnocpwoipscarfpneoraxifkwnipixktwackckicexexfnyywokttpkyyncotisppkcrggykwtpwnafarfpogaoafgfktayxoonyekogrnktgwkrrseiktoppwsinycsokfgptappxrswxnstycefwnseergteacsaipskinsefryfkiaakarcfitgygtpyycnwxnipwxcgpswfnkwewsrxnperfkisiortgwossgwrpesycykgsknncotsfpikgepcrxysewikpfwpgrstptoygrefforyrxgtaorranrppyfcyntrotxgywgcgaekptsxnwrnngrergxnekrykknoeffigfyscwykxwxenfncsgwtwogririrwsxyiaayayygikksxgantxaxcsrsgpnsckiaknicogtotreexokfwenywetefexpwepnooycosgefofokxniycfycrsafipkccpgpgwaaipfsaotkkiwarftwgkgfeocweiosrytacrrffcxyaytewnoccwxfrssekwcwrinpynnsyxyytkciraexacxftefytecaiycrycsgkaxosotnetsfeaigoxogfenfpxofcngtoksrtnwrfwcciteixxwcxygiocxgkpgifakfaegwaekksiikyeynrpnpcpexwnsxpxyiireaktpgfpxnrsaipxytiggakenopcnywwkgkprrxrxpynxsrayafggreprefnwcnwcocsrorngsxotpwxggrofwytftofetfpctkcoypaawoxnaeoaowaanysekkegxeeoaktgxrieytncyryetpwsrenoaykipekigysxixnseripkgcrcawiikxfsfwgtknopfwngfirgenyiaaokcftpwfikapcosgexcixtsyyniwfwxtwstteikfxcorwtexefpafsikrseokwyfoacpnocytwrxkotfoptakgcotxpknienpkcspixocoknxtoigypgogangerpkinnatscrpxwtgwgiokfniatntceekkcfxxfxeyspkaywawkpwnxyscokwgrksttyyoteoxrksgtiwostrrixewpekpxcyttpogatykwcoskerxiwyyngoextocxcgkacpecwkpgswgtknwftwknyyfnicsrppsonffyfwkyfsxxagnkrfaecnwgtfnekyrgtiioagxypctwccstkcsrpxckewinrgfiyyrxftaexysooypnanpwnkatiykofrkraccawgssaiwyiwekoirxtxpknrpifagfytsxwtencgceosgrxttrnkwinwxxrktcwykpegencsnecrccfscfoyrnioigkwxfprgyywwtxraxcopwkeonyoexesykpgrpfwgfckeirerknnrwnecpwcgpwnrgescfspnerycegcnrfnkcnrwkarapkrpyeeecewswpprgtpkskktrirsarfntwkpinrwgnpeixexreronyktnceskswogfstofeesrwtppttgnetaxknosewocnfannaoireksrnpskgerfekfkswfsckxcocptnfxetksyikfcnistrnxkrnrtocctokppcstsapptgycsfsswgiangiyicornexoxtycfxcicngikrkokcyoonnenwsrektitrytwnxyysiacskgoakkpiwgcrrawgwaersxkrxoieecwnpxecosswogfrktptfpawgiynfyfstoowcnginitynewtxxgywckcpfpxtgpkekgwwxxrekxtrxyaenatskiornfapoofgpanwfcepxcecprneiwgwrtcoextrpxfffwsektwwsffwcwayrpigwswceoeapxixfrrsnypwykywoosokkcywernpfernipirkfonsopppgcxtownfnxtcrpkxwogiyokgkpixpcptgpconxyancpptorresxtonpcfycrtkayxkfsptwxepipafficenwfffysotxcntfenfowkctnixenrfcrwxiasewwkgspgynctctfttrkikeawpwxtgkyyosppsafwpspixptxwoyrtsstkptynxcagpayatyeoatfoxnwgkfeatoookgnpaiwkoargexgxgrgcsgocicyfioacfkfppskxnspkyyerpcspcfyigpagnrgaaffosgswkatkiewtyfixxieyfskfcxgiwroggxteiaggfnfggygegoeyfnyafgccssaynsrwiraapxkfrikgfxxifxwtwwrfpkwocrgxixasnoioakwgpnkcfyykaoysntyagtskitggxgafkapfocrgfskxricpitgixywgigwsweoitioayxswgaagwgxxgkxpeitoknpcgftwfitsxwowgayppkopfrtswwnfngrggitsrxggkxceirfstryrepxtaoxfosaksroycecsiekxnxrwoaccceistgerptpksccppaccwooaowkttoayciynafcnsonifskraokixakorkkpofsfaexfwiwswxpegnncosynkrantpriwyewarctcokgyxywtigxcnwonkktxkeyrxiwctpgxxrgcprkwixepxxnaipncxyoyaigcoipfkssgwpwnnfteaggckoogaaxtfccexixcaonnttfotktssxysrfyntifeppgfypaktcrrifnefgegcwptyrwrexkacxwirccgsnfxpypgtxxwcyaknxcwetnktxwkyxartoecnxpxoicnskkpcxtcwxngosfoxywpykniyeoaiorcacsfwrtiegirngyrogoygcfpcsisiopsxawktefpexcporcwtxextnixwnaxofykngxcwnaxswsattryrsrikrwegorptsrcstwgaoffyagacrpeewaiepsniwctfytsooraiiwownsnpgxiiggtagataknotyinaokftxwwifanfrpoexntctseigttntfeewyykgffoefyywstpwoggytnikxogioxxkngekyoikiyxtfaranipygwytywgrfrifxaagextxioyncgkngwatcffkxpksgkigeicxriwsfpexiotfaxrgireisxrpteariegipspsyeneawternkpyarnkscfpykgknpoyeyapfyecekkepgranwxacrpwtieiganrpyrewpxonsxoeinkyrroyisopygfrretapnpxinitrswgncfkepxgeronfsyoirgowpypfspeftaxtnkxgwffcgyickpxfxeatyesgtenkcccfpaiaiipfstfricwgxnoipginrfxgraswnaxkckonyyctongkseapngotfpgtnxxocikkekywxoypatfsffokrfffpksxprpkoeycnfxkroxctyreorcxcynwsocrygwksgokayiaexwetapsporatreppeocptoprwciwpiwnrtxaacnnsftsfknfcaeoftxktrxycwwnwtgpxciaiwfyrenrknwsoogxcgegnwxgksgirpikkngnakrweyecswxetxaxtkewisyngrnotcyfgfxtgnewtppexoowykoersftwftnpsgfkokowatttxnxkesyayagitekfgectkgokiyysoaarsnngwnkaarenwtfowsoiaxcirrfacxokcptooxcwrntyxyitxnsisexeoofsrngcxwwffaapskewywtwogssnaawwoawfripggsgxsgginieaikwrgknepiksspgwnpaewisrcttosgwenisgkxpxsyxeyxenxeipospkcofeaywggonnreerowfakykcaapniwtesooiokikraeecfckaannytcstcrxiskxywsafpepssrirykfckrkskckenrwnkksxitfypksnscaiocywcrwotocecoiswwonetxxiaxtynfewewfapwoxitwyigcarirgreyxactorycyrrfgkirtpnecytratfnpkxeenikgtfftonxteixnefcootitkayfceoffpritynkwifnswixeyrfyiegixccpxyakwprrgxtnfeofxxcosxeiicostwfafppaccgnckyocstpnpcintkoxfpnsgrkaiyyigcekcwyayiwoktnggxrynippgipigcirefsfxotyweackgaakrrowxcoygsfiycyppeowyaxifceopyxfrprkganinsoopfgsfnkyfrwnoattpisrxigaiingypkwatrnesteerwgewxekaosnakwfakxritgfrywiwroxatrappsyekkgpatwckerasxeyixtwcckttsefskgrgticfxfpkayperwrsontyssywnoskfioftsnxcknnonaaoitewnpkosowtfcpefwckgrcngsnsgkopogpwsgknooxtekggwoarewtyykooipnspeakfwwocwykiooofpypiwarnkryrsyaiknrygwtnparwrgxkayesttnrwsagsyowaxoarieosepopokgxxikoairrwternceckaixirkffeokgcyexeigtnkxxegnnwfoxfxcxgaekitepwktxrowcrxncereascikyscxcnnoeitiwrtxtyixafnfwiscsrpykwanyperrcirxrfyossfofxkcferwafnofwpaofwtesockaaxsyaearpakoteefafwoeggsaonawnxfcyyckxrwtrxtipaprpsegpsofxcfsyeteroegwykywpxnesifpxpxcytnyyicrftgyicrxcifspycxeowfiyasxnspagykaekxkxocyrnfwwgticnoagsnsnyxnekipxoospykpksiirxsgackykwkfxfxcxikxartgfxxaoyceicxaksyfnonosonaotrapwresioeagofyweockfrktroxtsfcsyxoaegcggcxpponaptfcanfnykocprofnowfiritewfxgcwtetttonyskyonciwfcyokeiotfgxfpxcawprortonaixtgiasxcrrpfpgkoyppaftscyfkgcstkrecpestaewrkogsonyfkgarkrywcnosiwoocefwtackxiwfggincfwtostwfstsyixpwagafgktpcxtwoskyaeaifoooxpxkgiixtwinyrtpsnoeeexesynyaixeyyfprssfnywnaykwfokffpcpigaigewaxtroifstyonfngsipenapaygwesoyynftegfnrirkrfsgrrexgppkokgfookytspoaysycrstgcaoyfecxxyryoooknckrpgekxywpocykeceikneaicfngaswpofoefrixyeccsccixesgacsyyfyrtsswskkgnasaswpircgrooctxyxrrportsefsaicxirigxeetaycwioxaspociaicoctnyfproctpisrftesynyrkitpgnprrgpkyierrpcirfgtxnxnwckcawosfaepoxpffcekyppcnnwoxacioawexgtaxytfpkafggctnnpycckycnxiykiwcpokkgikytcgcwctgfcyncaapweoecweottaryygpcportcniwccpnrskcxtcgiefxpsrcptngrxyccsrkrkngiakffgttwtfwxpnpgyrifkatcrgtstenyasfawgrkaksspanxscigaxxegecgipcrrgekpoyyxxnasitpetewwokfngikctaixcyfkoronsexykkggsxytyggirkaxskaterpkgtcrsrgkfnayxppwcpkwikexnetiofnpwfsnaceywxtikcscagnyggtaygnneswwecgxpkorftnieoknsiptnaxgfwfgaatgfiyakrnniygyfwoyettexspsftateifwcaptosxngpafnafpkpxfrftgactwpneprafewswpypweackikwcyrrnyptppgnpkanxenpgwkarswcegenggxastxwkyfkpkfgpwkkgfpwnxxyiirnngkfnsyifakfaocoieoattpagtgscoyxrxfiswwfcrxyawtcacyptngpefxkkxarxegincnoyyropffctrraggtoaitxeiwwecpfsowewxraptknoxpkigcxxcxinyknkpeaoayfsnykenigittpxicrtogsgstkstaswsxrpsnsfgckcggsypxtsoyxprwtaregropnopgwtgpyxkasoyngrfxakstoicosanasncixxkwxsfarrotfppeatxkrrfeaxpfinfsworxgorikgexooopxrftfyycggwfikagrraryksxckysfoeiraryciifkefyskkekgpfcgkssaxigokiixgxkskskosnokniangopettefattogpxiarecakinisrkfsoecroatcoxfxroteigxcfoikexetfnokxiaotyksscpwxpyyssyisxipwwcpfnoifaeenxrpxteoprtaxscipixekieeooeokfkoowpsxatypsfiaekcwtexxikngrnynytryteewspfatixcexrngaxfwtpksiskfgpwtitraoewxatyrnyotofnwgnxwxsgaygctesitpxcakxtsfaygstrixcwycyygtsstryxctnsekingcwttnrrksnecxnpcsxsttkkwesricyagcnagxspyprwgkgektxewoetfrtcnixnxfwrwackarpxnoiofarywxeaagpwrgcwyoyrksscrxgkrgrwpieexykekaeawxocpywaycrssfsfwrfanwnsarxffyopccgfsootpcteisynascewonscyserarogyggigxyesfooiyegifcsggcfxtyofowonoenecotaxwecseorpyefxwiocryoeptpayeecnkyxyiafpwrgsagfyotsgwaoscitrigtwcocaacokcfeinoiorrptirsfitwgaogptspyfgppknixnwfnwesegkrcrwetgyosnoitypkfsitixiwtaicktgikyoteyopfeakoecafaxorxyfngespsiwcixpkfficwerexripkanwktkpnprrfoceswsoycxkpxfrfkniswsykricsrwpgwcrancpgafciiaayiiocgfyysayykgktiwnnssoaegeckcggiaaoiawaxofftaewxiswrriinerxcnncokaxccppfsxotytkrrigewcfwtnrkcokwpiinigrssywkfgoosksigrokesniynggoatnytginkestrcpotefyekcgkgycipxgefctgkcafnroyfsepprxotxfkefocnrsrskxpayinwfpewaowctewrwxwacfsxoypfggteakcfkxfanrkporaayirxreftoywswxxtffcpgnercokcxkcyfowtwipfrtofctxyotnytiawwetpxnakpnnrrwxeygpsxywryegkxktorpoeptwiefkpcpcpkpagkkpxpgntrtktstrsxipttstoepfpyrxwocgpieagckynwsfgweftpapnxweasoeniawwftyseiisenewngsgpasngkaapctasggpffiewornpynnrpegrwgkgftppntrttrwkkareywtefecogkwxkfkygkpspegnoxrsifeeryowfgsaepwgsongpyeaoyxtpayecsstpxwsytifgrktwfnffifkeeptwatsorfawtrsoraasrnksiotcrtyptfkkycntxtxioawwyskkocfiwpyfxwstsxrftygwrincfwcypkoiffessrwpynotcroingipsyresfotrcfpxtfxasigyponwicrafneeonkecckcwpckynwswnewfryycfgopsnaexynottyppwwpwotygkpkxfowcexneogtawskpxeifwetiyfcswgcignpoiexsiyktxtwpwteneinyfagtowgxatkptgwnyycegttsnwxkrkrsegknogyppnfikiigiktexrgyxfsyokirxxpttpekxpaskfggnfnwtnfieaoepgpsnxwtitxkaawtpatkkneeycsxcfkaxaixsiakcxenwxrkcttsaaxcirspwtfnospgtegrexxsnfoswigcnarracgkiscpkfkspgopntfewwkrwwirrkkxyngkpcyiorrifxtecparaxifcfxirfetfrwnrwxtyaneowaixgiixifnroyekiygstxskytwrftarfieaweepeeinroexxtknwocynsnpircoyrpkgncakcwosrgewpfnsprikrwtiygecyscpifgaaywrfoefkrsofgksrtgfwpprinywsngaatnnixyxgsgeicgkpkyygatorweypwykyeifanoackctaaxopryrerswaxpaaiofygnweewoytefeegyrogfpkkpnpixyytiayxiwyxnxtopwknwratrogxrwxgsktwxagosaxtstkewasicsfpayieegwokispxcgnasakksryytgatsarfxneaskaytwffexrfygtnrpeyyxotwnyiktxgertntaoyffegsryyreoxsssfxppkkgnypowtgkrcicwfyewtpifsyrscagngxwsycaeagxnpnrwcswoapeektsngerpcxptkpfsfwoeopwctararpriyaxyxgrytnnrfcaofxiowsrrnwpfrrtwnwggxkirionfnrnrenfsowenyerfcroowetigprotcrpceoayogrpagniyxyxsxocakeatosefxscsfrrcoicfawrgfnctywfiesfyefktirnipogfwtxnkkwetsrwrigfcateixoxxgfxpsswiafrngyoktryyefpeeskfxporskofeeyyawxckxnepacxfaniaarsensoxyeowkrstwenttwcetfoosxrrtxwrgkowxtntotrggkkkoteoxitciwecxepnaorpgkaapnspcsyiefkpnorywgtgknaopgxcacfoosxriyfosesnksecffofitcwcniietagikfnxgcyerfcsxinnsnxpctknfxirnogcrsaxrrrnrwokceersnigkegsnpeofrpskgkgytrrersoipcsfrpitciwfnrwykefraoaipxteopaorgrfypwessxnkaorwypnykfsaktspixwksntniroykwgocpnxawsyatccersttectkfwaxxyxgrpwxcfpkaoensowfkgeawitkwktfoinnkkfoxaxycxnrayfockpaxrkrinrgptpxyttxewwxasxpskfcryftiysescscafnpnpncwrnaxcogwwwyccygeiryafwrtsxpwygywoskrygtigeakswpkrfyfweaaeawewfrgipcgieagtakrxxraakggyreprtiigiccfeatgeaograsocnakgxgrfapeeckepggcigfrgtftwysskckwtscwysyseeipygxaesnppigircrkwkffxwwotesfwkepoawypnrcarsxeokpnokrrfnswiwteyxafofxrntarspnggcifnyccwanygkicwoaytawktsoiowacfrpccxoesksgaiysxaoywettgpofenrnneicogawxsnsnroxgnoarsttciafonfoynpgsaoeixsgsietxsagfrtneycirxwfsskpreaeaaoytnwgtxcroyttooprorooswrairotaywwoynnyyrerswscxrafweoawnpwpcagwrwcwegkyswntwgyfgrrnweptwicwrxtpyyketscwgpcgxncniiwkokkprecpfnogwfntotapkooeyiooyettfgngafxrtrotfriwfngfaprncweoceooywwwxikeknwfcfxgywssewpefycksgarsanigrsyaxkonxgeswnewfgfitgexogfnwisfatgraftksnknnonystrnfswoygefgnyrprxgtiwwsiyfstrriynpgnksocnyixcpigxyerwtwaaaritwcystynwnfretcpeaepipegsfcnkwfespasiygseraygpnoaaeteiwfoforfrkfpwcfiegfikaaskotwngrkaeiesarkngpiogotkxanrcxpgefpopiysctsssiyisfawrpppecnkioxenyeaytynrnffowxfwcppcktwckirtxoakyraoyifxkogoegcpfyxsyicryengapxygapfxeatrtwpeayarisoigkwwwtyyawftircrgtgcwxwyexcgoaknrsrykptrwscpngaewpkwxnforwtfrwnikaciwysccrpsoiektkfwtptwptcnrfryoifyfwwgsrsanyknegrepfkyxsaxocykcryxkfcgsporgctfwcssgiftpsrrgnkoyaicocnacpynasityykowyfkssxrykangkkopnyoxparrxaenwtpgegwestxottfatcfnkptapsaepwfkstxrwoyatgnysrrcfkfgwkwrrasottcrrkoxaxxgtngiesxppinytirpsarwnxsiprkaskpywgioexxnaxyognfxtrwaseckopoayaayxsrrpfssoesagrprwygckofxneyyswgkawgsprfkyatitartxwaaraesniptytggcocpefoknoaptooiakaxnswyneonswanfxfkeypwysrtgeefepgpsogpnrtaaaocixrcswksnontiypogktgonorntfowktcopgrtwaxyyosxxsfnxptwonaooyxexwnrxfciakooaxoyyrgrarertfwpxyeyorfwwknkgoocsofpeitwtynaesaryfgigfkakwsaskxrcnwsnwraeprxrapsrtiffpygppweicrgcpiiyaxgfktggcpwyogpgsxnnpxtanwwsasnpaonxosecwyxxpcnnpfsywtxxsknasycitosfxppynsaoytxtfyacippxrieyscggiyaepioatwftokwgpcgweitaistoxeyiptgsnaygxkirkxgxtppgexngwnnskceorapyroxptioeogfrsowinksscpeoexxwnpxwcyickrsixospktfactkgecwafreicpfkwgistiyeosrpxnokxaryxyoengxxkypownwoynepntfteoxiaekwnggxaterosyiapxkxykrrsfceagykfsttyaiwexpkxitppknpwrkcotpxwrfaeoxwatkykfpcnswinnrccxtwgtekcaeyytfsopcgpatnkcpkfaagtftwxkxstnsesrpikikxricrsoysxcngwokckntttxxpgyesreitrfopnyygnsccgwspwcwrfisgtwwwgayxnoeiokpcxwwpcericeafategffrtgwfifkxtaxxffnsxiofkgwgpfggnncpnsscawwtaykwpnptyyxksiytsttayrnsxopryistafxkfogytygggiriptgktskycsnweteywxkpcokgiirteetcgetktrwiciirracfiyykgncssecxfxoyrxiccntxtggckforrknxsfiiwiorposywaxkrfgpgrfekiogsgaakxacsxycgcncwpninwfkpnexrgyyporwkngykwkeenrkooaypisippegfeyweeffpyaytfxwitnwawreytskkecgaxowoewgcgieyyietyskgpgapagryccycooyrpnywocnxcxencncgrxpnfgaikegkccgpicgxrkxrpktkatyceospgwokeefaoesfotgerfneoxarxpypafoagyfgfftxwsgrenxspofiwnxerycxixyseoyxsgyaawywceeokkckoanxitiaypasxrxgriwkcktwnwarctceprrywetwaisxoganxkiccotpfoparrfscfnggainnackakfkponayfxaigtpeaoaxwxwpnawitcenapcrrgfsifixapooyxcfnarwiwyposetfcoctsrkapiwtartioxwetsxtwxfiynyxstxytkyfeeepecxgfoxtecxsyofcxaccnteenikxwrwkwtytaxgneswffypxnwatkotgtrserayffswsaaeewpperfksrxxanatotexwrckagxsfeyiwetgreeppofrtrifskyacsyixxkkfnpxpcetrwxekywiaaiayryaxyopsfeyswaxirwgfrkcgcsxwneffpgxekyfpeentkggcxwpfrrnexxiccttnexsyxcgoskwicfcwtawtssfcggrxxcstiskgpaskyyekyyfrgoywyoiaiywftfcaewyckroiwtgyxntnkgynicwxaxycwcwipfknietgiwicassgfgwoxktxicynatyrsxtgnikfnegrgsccrorepncwgpwgieoantyrsikfgtewsotyscigiitwxirswinkwycocctfsrwnfcxwkxxyiyxweigpkgttxkeypppfttnpxkkstyickiiwapwaeynepeaxgwtfnfygsoiptistrofwocgyanooxcwiaxifwwinripokyyyannxsxrkcsaywiogysggttrftygkrwcsoeeyoyxigsxkkwcscgpikywkaiiipycxepfayiywpnewrrpsgpiksnxekowieiarytpccxawaawiorxfrsnopewkxnrgiawxxtnfttxipgwtayefepareesepcxgeyosyoriexskikggfoittfxtinnnkpogrecyeagnfgkxffetaiiwppfxeycgitpitrptoigpwyyyftiinngkotxcrtppktyioiycakrtexkokeyxowcnpsyftwakrotkxifyrfkycctrrgynfntatknkoegtaaynyrigktperoafcfiapikecwirxsnpogporekeiceiwfeisweppoxtpcpwyppyeioryyiokfcpsffakggffygxfcfcrsoxyextxaenpckwfncegnwworopawfiyckgwsrxoiwwyseciaxwgkwnnprtxirpxsefyctatyntkegictrakeeeawsnyrnxorwreeifrtyfaitrowfsrrxtfirressfswipnagkexiftgsypesxcxanacninogopgtcysppigprsyyggscrrxoeocfpycgweyccpcgteytrsnrrrpixiskxrkwionregygpkgkapxwexrsypsnrfgsrkyipipkocfkpgfxgrctffrfifcoxfpkkwtskfnpxoskeixtokorssnasosnsgrnexwasfcegpogfoiattfitgygekpgapoyxpfeokocsioatxpsctfyiagyoytawycwsxwfwsskeswswiptiknnnyiyyefpfoncowsfrerepskgkyifssyxayekkyycafrsinwaatifaigsosxaarteeetfxkxokaosfsgtxowsoriaeregifwitkckioetgafeapxkgkcrypsgirfxskckxxfywgryscryxexxfkcxnekiywaxcgskpneyirkarixewicirpwpaigkeergotoftftixrnyaswtsepppwkrofngwpacxxryncfcnittagpsrpgtagsccrxaafcgiraprckfyrionyccprgxyxtyrtpstyawtcrekfitppeentixokpwnppffpogawrtgeporocseffryskantcsnnfwwytttwceswswkyoatkpcytfpntxnynpwnagcaagxfeearottkgfinatonnycapsgcsaiwifasexenfwwaweookcwntiroxpascanctxoftwctcpirygrcxfposxcpigfiainxikntacypcefitspepcrogtkfxswarxkgcrtixpsxfnoafkntisepnxpgpxtsxsfcyrnxniktnoesgifwgccsiirxkwekttxnynonrixexkfkypwnkgitwyrakpxeienicyacnrianyseiaippeaxyxorocaxotytkgxsxfskeioxiwtgywcatcgwwipririrtkeiaaxiaotrywcknioefpynfioktwpckftyteatykkkgcgccokgggortewfxfsacwwreoyscckferkiwopnygyknsoypxtnyffieexeiotasniatgfrgogpgartywsnxicawaretspwxofgwwfwgaoigeeracoyafgseeirgstrtxaaacrcxwppkyanrofyixxncpxrynioforgkengexpirpgiygwnsiwergietygkikfaxyrocforayxfxggogogxxfrftfrgeorioofwrtgkoeycoprayoastnxtwfkeoyyegxecwrysfakaseycwfengxawcaocppeneaokrtopasgypxcstssgkrakopcagpggfxgsceyxyenxcaetxyrcfsxoaxyyptgrkokaftitckcwfickeaayrysesagyofeosyyiysoeiictayyopwstsokgoxyxeyyxfcxsixrascntnwreciwrkiyxnocxkypwtcfckisnfpgtoygitsiotkkcoxoxgfefotxncapixxntfitaptgntstttakywtpekfyxkaktrxawpaeforoikiayeysyypypnnngigctpsyxoynxrgfgrferrriatrfprnisxtrfsggyeerexrgfpiexgckcfyicygpfeoefxraanpswgtteetcrciwfipiaktgraposgseeiiretspeinxxairgakfpycgeoxtstpsfxioxnkweekprccwkkoapsesrsnxfkfpicpgegwnerpeygpnonysepypeogxgfrxoyexyfcoetartrwnscpgfpptrykwwetprkxkggaxfotacexwwkotttykfasrxfsrwoyweotsgxtgxtspaiscwacktskiokkeaggcnxixiyakgogtgxeinnyticgyrtxafrxiikpokrpnenrincxnpcrpycnngfcgnssksarnoyikootgsyxoftcsptwwkwcxrkwipwnwpxkfksrrxnenkrggeaocarwyysffataptotxwcgifprgarfgwyoffokifrxyywitxtiotosnnknyftypnosgxprengwrkangarfafewyttnoxakiesffctsktnyeikiffeikextxcwtaenrnwpycwcoycinpwwyokissrwoekokkwasyoaatcpeykxextnkfrekwrwywsxfrcsnwgegkwfnitaecggoiwpgxeafxcwitxpaeyywxcypcewkfienwcrnweifknnswepiwsirgwwngogxfwfesikxsswygwtitysnxnktpewewxkrcxkryrtrktkonfrgpgygkgccsyaoticswntxrxtraieterfnicixgckstgiscsnaoofwsfkxokcweckxykxgoxkptetrwenpcewreoskyacspofpkgpkesytpokkxrckogpeywrefeggkyrpwrkieofeikewkckowxonffffktprpnttcokapkewytacipixcaoowpkonxateyoggxnnkgrtnraepcxofssiwygcnpprenxciwsrpewyxcfxgpckfxaxfitygtiioyycggerfcrnfannieypcpngatxaanfsgopkcfrkfycfknxstrkaxtckffrkrrfxkcxywsixpxffnnowrgosonwgtrccfkixyrwtnreeiwxnkyfrxwiscssysceyprrpxgnxyecenwgagycgoksxpnsicpwexkccfwsgkeeyawiwancpoatkxtxowcepcrriynoxrskoywyxrnftyrneeofoypegfniiacctwttxgwgffaortgwfgwrfnctgesfeotfyyggyawfwrcyiyytnirfskranapfskkaixkywcxtsyrosorkafyyysexywxiascnatysnpyawetfynirxawwyksntntpcktoaocrwoawfficxwaoysfwsnirtacaxkoffestateixfnarptcigcygyxnckapoxfpsrwyynfowceeetngytngpwoyrtkgxsypncniroigawgnkgfcweksrceanyieaysfnkrwcynsnoywkfaoyktgoswtocscypootpiniwrtfcekfotrkosyctnexcsfrpgkisogiawnfowctfpicpfwnfefoyencycyergecrawnwcxciktaoetpawwksexgtyefonfpsftyctxewftfiryofpepkpkfytapifkxckkteaaascksarffwgcayrcyoroeyntxxrstewgryxsnrfpptasskexnnnpaoggtcxpeccraptrncfewftxrsfxswkkfyoxireeswxeersgsntwtyotwysatpgtpgirrpnipofwccpngtwsoeigictfpsfwgnsotysercartyoicxkrarencckregeofpoprsarcokrfenweyotgryfcynenecwkpxtiwkssxfsktkyoxeagytrktcwonatxntcsksnpcpyktktctgncrrsxnfrkeakrgepxicxtfoieekfynxyrtonsaxpagarrxaewrnxfgxwrykgcccrygktwnarksaoxnnxoiwpyewoxekyopsncfgtewsxppacnykwakfxxyggyskieyxnxnfktcxgoxcffgwwgxrwerfftrngcgrooecsrfrtfoeagotagtcnrfsiiaoyinwtyfcptfwkrpfnrrgiaaornsrorsrftopecsaeeepfwagpfrgtpsaoncextwsconwraoaiwywewwkicotixtnctifkrkwroipistyftrrfpaorfiwcyfyfinsaggywtcxeekyryfxkerrspaiytaoafntwrpcsgsscinatnsstkrtigpkykfangkitwggecfaeiwaofcagnayrfcyeswporfkwtikgerwkcrcyfixxgtepkkcnwweggxaanwpanxftpweynnfswyiewrswtfspeockxswkaeagxngryocpfooipttnkagpiasweyanxfnxxkiytnnrgntfownewexgtkxnepgeaeisstnywgkwewasttpaasoonrogxronkasrgopoeytfwogwipgaasenkwsekatkatrsrssttpsrfrprcgnesawarwkfswcayncxtfxrpcegkewaewenftnfetpktckfeycgpecfsneaicecniiwnxecxrgsprsepkosgngietpyaintascknkxoxioferarisokrfnetxpyoawexyicgiprfygwoaitgyaewgspsyceseeeaecywpintnoprtspoaaattysxxensposkekyegcwpwinoycaaapcnrfkitryonxaacecfkwxrerneooewxrgxxntanspasixyxnicwppagnrpnxwwrfrepttacggiisncrgssskxrityttifeigcercngpkfkierogrgcyfxoipnsotfsxxsxckstayfftpngtnyfpanreyakpfwpiynnxsrpgckwpcxfewtcpxscxwtxesesrpksecfrnssetpanktttasrtofreaecaxtkttknyoxegiatypewfwpesaeregrrsakprtwgooosfipesrccnaoixnpwxyfwpapxfeftiisnwscftpookrkektocnasstxgkpypxnckignrwcknaeripcyyptogefsnyseaswsrinrferexsragseaxewiwixifspsncnginketcntxoxtfkkykwrpkcwxnpfryekrptecispgknyxetywksgfanckfprakwoyifrkyyxskotnewspxsrfropsntwtxfyfrtxepwoaxtikenwfywtrgfiygctxkesgknxffineyersetetoesnxpicpookytrgsirswnpgortnfssfppiroorekcyinaxcoifpogafpirpggpoeetffefaswfraykxxnoxfsscfegagossfwyexkawosfipneostppxtrwgcrykiewwsyorgeoxsakerfccenrpnxnxewfnwttyrrgiwnctwpxtnnnyscciwkyaisxpasrptencacpfewtkyawkknxcwekssnystxntckywwyycpyaaawaggpewnesxfxkwfkcnnnxpgefoetrrtyesfntptkxowcgagcrraffkkoinwksieierietkryatrcneyccistxeefkxsteafyacppefftynowciiikoocayoeixrxyswwtcatyakxwspkeogxrgofowokekwtekeynpotewgfrntrotxrsorakrexwkcnteckapfosstwgsesiafssgxrronpnxoxtxscnccarpxswnroogcarpgaikkrxyacerxateaganrwgtgccorrkitfigaxinscxktgasegtkagppanctwncrnctffnppptcfgteticxgcytxxpkcrprogtrecgseogpynneitrnftxxtynekeycwgfwcpitfrpptfoangyieccxcecgsfpnsinnasrswxpxrrtwcycreaotynowcyoscpknyogpyikrnsioftyicrgpiystkkswyyewyyegrwysinecwspncxgfgorctkewknrryagxtoggftfoatyyctptrgitecwsgeywasrkniieetpxsaeteicgpfwwpkwosyykaciwrifnakeexkacenxpcfaiaicfsxticcgcikwcysagpxssfgywakafnypteyisesngprfexpfgwoftgsgyoswnxeigeeskfyxiiakrwepfpikfkwxyoeieiakrrotoiwrgpognwigawgkaoptwasrfwpsxrarckkreifyswffspiefpyxransrisgafrgyopxxrakiwrkgxorwtygipipnwocafnsgsnnokyrkwtwtsxywxpxxrierkyfytkwywxfasartxopeakyfcxwkfoogxaptxntaaagnpgipyypkwatygwasgwrgntfonrnoftptxrxtaywofwkenkoyxgoracccpaykkefyteekcrkpcsssrpfeawfnrcgpfnerrfaaetfifyfontwrxnferorpgtsyicegxxeaapasiygiiysaeyncwkwexakfaxxiefpwnopnnopctiiskcyxnkteoyiketnskefpkpxrptersttwrxtprooneopkwwtprtegwtaetraeekxiygweiwafwsaicattyaittexcxfeocewggierpfgiopwftirigxtfgrokeiowpcpopasaitgwfawxawfirknoggyeiefypcafxkogpoatyecotnpsyonttacfopcacggigkrniiparyraafroiiswtyastsgycrgtraanpixskinkwcprstfwgytpaktwrcaragskknawfkpsceffcxysiefxitnosspxkepfsswgycxxxgreopanxonoptnegnwowstyocnetkoyfptnxyieaynpxnsriixogxfpwrwkpkkxcctfiyxsppfafsfcyityssxcsiyakypsnrniwpsesiswpryicoiteexncexcffynikywgxwnigacxfaoswsyrgesyepncercsgestwfsngcsgnipwgwoearxkfagyrpppgfygkwwenxsrgxpowsorkkygnfnwwwaanyrtptwitocattkspkxfnkxsxfctrgiytosinxsagwxnxxeknwrscstrkycrcaokfwfxyiofwycxsgwpnawgkgnecnnpfapktxancaeypwricxiipyiwieccxsfpxioxnsgawatenoptettpxrgnyfppwtiogwkxiixpgffxnyygwyaiiepafparxoxoirekisxfgsofrcstfkgpxkircfieeewoystknwiwyotyycwgecikpkkgpcofoneogaiytseoioxgktittcisnfxysgptaoxofrtafkiegwycyggiageontwposowskaptocptwxwxkwksopxytywpccgykkkoaorargsnaxoefrgpognnppsxetyaieonnkswakiiyffagirpgiarpecgywssoteoprwisingsyypryoswwrnxpywpgkcaigsoixorfckfertgkxaesfynxioycectsxcfkagwafsnrkpetwnfywagcgkciyswacprwfsgrxcnpfagagacpotkfsiaysacftfxsitafcrgxyesefsrreesfrnsyoxriyaxxonartiwptxkfrpacwficcseignnisxroswgyaeespgieppfxowfwceieesoexyepxttfteffkgoycsccgekopsgiyoxyrfnyckpgagccgyarcytsycwcpiaxwaopxootisrgtosieftgrkfsssoocfoxsekesaiyppyfaxcaaettrxkcnxnweewfpxoparxoweoywnfaxtcefriwgtrcsgwyngxxwkgoeikrecentypkgncaageftorckipcegiwkeofyxwiswkpwkppwnxfixfriaofyifpsrxrixgorinpyoworfxcnkoogisfioxtcsoafynepnwoptxwnrfxacrwfgfcfwggknngpfnepgkksfrpisspfxnpfxyxpinftxpknpfopsgcisfrfnoewwcrfeyonxkoexckwcsiptksokofctrpaxoefafcxrefoptgttyopnwfefrcytyyrerafptpwppgxxscfpacrworkfokxkpfxopggsoxgpwtiwyteowarwkxcgcawsnipagxioregtwrtnnirpkksnrcgooetppiwrsykaygscpxfrgwptscwsceaxrpseagonykncogsoepsogfcewgxrwcgnpnsircwkxfpwkefenrfcpnerstaewyccgrrfptpnrksfoygwocrfepriireicsixsgsrwixsfawfxrtsixfaarscsygfpiewxistgwranaawpfwsycsncogaxrnrkwnxxssoafaookeeosnxisgoniicwtrtnggerotyanweieicsaofnswgccygofwotproeswygreyxioregerickpararycaxitoaniyrtrawgxtwxngfyxapeercfifyfwxrngayppkxiwyswnxxkcpgpowtfynriwtngreyrkicffffekatprfogtnoyasysrfkwkgoyesnxxnirfstppwngyrknnyxkncnfpntpsrxgatekxxxgxoanyintggogcoricprnfconoaonnpftrffyxorwnptnpoafatfppcgkniptytpatxcstgyraxrxayowiyiyxofctriiioeagposnnnfaferiyefceepaogpkarfptxwfgracfcpkpippnxkekpocakwoiritosknanppowsfxcwrnwirrssactwysgstwssetwkygspigoirawaoxkexpfpweoispwtgoxngptgxsreoccowetxprwccokgpxcrsipwnkxrwcifgrksnntwffpksyykgsngpcxnosfweosnyswsotncsinnsiewxcarwxxinpstxyscoinnycsrexngewypkystnsnngxgoakixynfawkrkkarxygkotiosopsxatayoxragcegatfnprygetotafoixnrprfxfkkpkofeirentrwkksgggfprwsieoecxfsxearwifrogirnygstragowayfispocaikixrartaxteorsxcgscfygyocefxnkokxfcoseewixgfipiwwikcxtsoapycxwwxnsoiysgassrxppoakrytinfxysyewkxsawfarnepecgkgsnoyrtkigorxkfcictyppepxitorefwoafnofxxwfotxttyiyipfakarkfxcwkcgnstenfiwiiiwwpswyspwaxkxokrpfwipayotiwrkoxgwnrkxewansrpswitceokityrkwtwkxfpwtyxnktwccrsagcgrtnkrpscayxxykiixspiowkataytwwofeasgnpgastiwacfnygkrckwpkroreptosyfawspgkfasrxwyaopwecapcxinantfgnyrrarycgynswfwciyytyaxwwneinpgxrafakoatafcixkcewrxxysroittfpetnngrxyenoisrocitgaotocfwgokfrxnrcywyirogginaenawktspsiniaigpoioxsaseforoayniiyngofffksogttnwyxioittgrnpetgtoapsesgxtpggppxwyxpypaeegppfepegrfkrkwyxfgywgkroainiasftecxrokscrxgkyaieontekfaoyinnwkwrxagxifyfoeiyaggstftgxaastwpkacetpowwoctogxpfknxnxnxctwsfnwwarwcfeonpcxgexexgfsfoxfesasyycignrpsxpcicctkanxkckycwtoocspxypktraixwxcgikreexfasyfrnoicgsnofyyortctcerkkepopfataynwgfrsefkstfaiiyxgpgsregnpgniregtrktnowaippkpiwornigiaswkgfofsaacetftogfgcrkrkenofiekocsipkooxrfkfnprpowfgykgretirpyafeaipxkkfcstyiwawnwfapfkcyofsereaatgepftsgrckoyxfffennxcporanyfwyrwgkpxsifynkyyissaeopofgwextaryaaiggxkecxrxcrwgkafffyaxcxawtkargffiwkxcyktgkrrsfatfprncctiskygwrcnkyffoyrfsixirewsgppstekyrswkoetcktgnnerceykycfnciftxaktcppakttgeogppynkipeekcktwkngyttyopekiopnppifpyxxaaaftptxyokyxaiwkoicetonksccnnofcopoapgsnrxyttyopofawopfpwnfgnfgoasceeykitcfoctygorfnwwsfynpyaceiooxfestrxytewsfgotsxreafccgoccsocyacsryiakorftfspokgyrapgkeargcepakxwswnfopcaaynrykotgwkniiitpfeetarkxpxkgykiknrsyrsecnorxwpiacotcxfogatpsopfxsgtrfsaytcweotnptiiecsetgawskrpotfxyarkaxacyotcgfoytocgkfrckoroippaycngftkintsgekcpafiyeasisxoxgeieokfspkcppgoxeiafyeocaoeprogwioogtytrawfwkcfcgciwokotcwyxgnxgopanrwgcratetetwppcosxoagxeeorkfxnyrfyranyrnwngaywffprispssnkcwskcgwiiyoirytpartowsxcraycgswxtesaoaaeacokcrcxxxagrrrfyrssrcectkftrcgpxeapisnxyctcexiyneyntxowanfsppnsccaxiewoicacopciiotiraxgonttintkpypicaftaawfpsxkkwakgpgkgityttatgrryrgprxxenkerctawososcieigakgtggfsyxafcpywaankicfwxwenrtntanpnotgpaxnkofgkkggkfaaiwppnfiaitxxsafxpwixffsecpxcakwkxosaecteegtgrwoatkeksfcoxnyxgtpgrafnkectapypfwrrctiwtnikxeitenfrogcyioixarpynettoxyioyowaperrkspogknxenpfnpigtsnctxwxspsgtkowreysaayccntocattpprwngkytoertynrcnxapcoyfinaktexsgisxaxpakceoykcwrknxpcnrerpoypscyoscfnxpcpwaigfwsiaykrpiwkikoacsngwasaxnsprgcgyeswttrfiikrfcnnepxoesrrnogcpigfirowpkgwtpwkgowywtfgpfyfsxrcsetfingiptgktafrkspnffkoenswpoypxssfyoyktxsaowkksrsyexnixnwnckergaafgxnxatoswwoseifntxnrsggefpffwetgfnxynnsiteposweaaeinswfwaaegnyxgtifpaxgaksnxncnpyrctwennnsawgpkiankrscgsrogsiceenksrefefortyfagkxwogpapkppycixfsrkgaocfxgxkpgeookonkptiecypynksinssxcrrrpiysncfroniasgoxgpaitspyygagtankpcikwtgtgreeyoarcnkgftwpacffrfseferoigsxsctwioykoprstrnftfirrcixokwfynpatwiaxigeratrnfoxeoipstisnyyktnwfnwtspxyykswcipyofefaafsoytyerfnkwccynfcttrtcittfwcyakkoifwwissnpwpiskgpptxponryyefroykseafpcyawwnknyoennnigosiprcrforcgaowfkgcrasnnsttsiscxcetpksiranpgxrstetxwgptiyeekfsckcsyyexgyckxptkwfnknkoeictsgncgktrkxsytnfroxirtfogewkwiftcifxanxasfrxsgyistsnpwxtpcxseeiixexsxisfgfenonsigegaoowwkcwnnrstgeixwwtfkgkkifsfkrpynwcwtgnrttieefoowaefapnseraaaisfkwosrpwecogkonootttaeyfnaspseeoykkgoacacnxnokwgytfpstntpxnkgtceakrgfxsykwxxotitstgtiyeccttnsyepokootinscfppnsaaxtyewryfyrttcrkskkccfgiefrxpfewcnwiwgwycgpkkiwtrrngxosikrawtxctxkxitooasyosgnogigoaytsokonniopwntyyyssgcanpkotytipogxewewxscypctoafktnrfnkewkosatspwxegsnkpeickxrceetsfeikinftryptiswrxaoxckpcxtefrepowwokfkxosttxswpspcykfysppkaixkitrgfkrrowygkasgggnxtxawtritinsxyppnfktcyrgokfixwiooyknxrfgyaresnxsnrnowiytptirwixrxpyogngixewgtxsxfknywptkkpopasyyapogxfxoppaacfcgsrpyctefyssenypkxycrwtaxcnfnrkytafrrrtycigykfcsyptsrygrkgsnnonikafsykskenfeffciryyggkrtagirernffwowynogiipksnanoeoxocxktakxnairengyotgssygrwyweoenpnccprpwfkscoftnetkwpfikyrsoirwtfagegswrnapsakxygrgictoyfctcayioxftcnxxwtgtgyttxnfksapnwoccpgkprpcoxfgsncefrkgkfritaoneexwsyyxregpppksikkryykxtyxekenorwfeoffrkcyswfeirttwxfxryacpifasxxperkynyksnksnctpepegypxoisoeaaxixtangngcnwfcfyrsocsgnrpkpkyapnrfiariapiefxgkoaigxeneowcswtstpcensxpfiwfpaprpiesfgwoycegietrifwncentxfgwntxgrroxosfwpergknnxxgsocprfootfspxepoywgefketfawtsngxsioanxakniinogkwopkpxfpxapscrfpyxyinywktggkgtsesgaxceixoxxxnfgspfioyacrrgyterkteegtpcseryyownpwtrnentpwakkpaeiiaegccrigictofgetkficyekxyrpwxiosnicspwfgnkiyptarpyynnfkwkapkteaakrpteskeexssaxckgwkfaxssiogksptfwcxgrfwyknwxnsnaowpkpegktfttrstgwrycfiorcfsnxccofapxeecatacopnaggkwiwcnficinieaynggwssfpgycspwpcgfkykosrcettwwfgfstfiypygcxfowkwwftyapfaigyogfrnogaxywfgwgneonnowkxkrgyfepxrteiogaaapicnwrwopttakrwfgpaknareitgopwwofnfokfxfpsknncnkyogkgrccwaokkwikxgrnnwtirggtarxypewgpiikkyaetyrrpsiicrkwsokyeicyikrcnfkcynttpgtigticfptstktcsfciaittwfeeprwiyrpkaooswryywxncwftcswcksisrenetwffwswagywxryaiyoigfnaswcraotyscgyprnwtrpfpsctpsrposfwrfycctkaogetsxfntytsaeffaiiyprygtnkrxkatpkptroatcfnigakgtxooiytkfriionseykowgotsrgrefgoysiffxspexrwfxxkfpgaesypgngicaxsiyrncftkowptfascwnayoysknoepeoxyioxeaigfoakgiyxtersncxxggwxiitgeygakefecfocgppoocagntrnctnoprwckfiaektkxogstaaogsssapenyxickergrcrxntfctngfwpfxaxsaaoktwroortgwxrgrgiiesaopkgfrttxgprnotaxwnopwewcipagppfcwncywpgkkrxfrrcpctnsfnrfxkwxkocxaacnkknekggtfptoernpytepkstkpnpycefsiffegiteepcseyrfccggspwpfktgasnsrarkcynfnocfcwyrpnaeyycpfkoxwwwokxsytcgceorywgnwowkicwngriytpokcosntitfsfnxyoectwektcgywkkaxerakartwwxgcsotfcpwnopcoafrcpksiriwnxotfepogpoisoosyrykntrneekcycowifkkwktxfwpoowysfckisnpkxcncxigxyxissookxnripcxxfywyfcanonosconeiygpwpsciostxfkfyggfyoaswfpyppfookgefnnwoytwofkroxscaxoayisxgpnckgfixgstotxpkexgtyfpieoowwwngkfscoffwyowgyayoxxywkssxgcfntyroeoopefraptctpeyxpnwsffosieywacnctintegtoapkcpgppeoxgntywfsxasfxxgrptpgofkxxeynxnrcaraiafctyywkaxsntoiiyfrtoytrwsafitaxtwtiergptgaweapkyowcioxwkegttsnnesinocewfwfrrgenrawyfwnarwkxiifaexwcaikafsgagiepywtigykgnwkoatkrtiffriagxwgycensyxpgowtoycisxyygaanxkccoffeiasgwofirwnotcpekxxxxyyrcipotewxgcckyttxpixpaxkwparfpofstixicttosgeyerrkayceiinngieyfssryoyoiaycrrawifttasaarktxntkcxpnnrxterxkneereoiecnpsiycigfikppcnexiicakcwetcxsewgnreagkfonafoifttrysnipcarogyyptgywkcrkgsfwtwcyigxswgskicrnfnfsygyekoaastnwcowierspskcwwcfoxinkkcopekkgisgyeppkfyariynxryfsirstcwpfsrwefopfaaicpetwtxxprtwapgatckeyagfskfkrpxekefeeyfiyykxopigniyfwcgrxwwteyeykceypxytyoyneitpswiwwxscsoipwettafaiepcfrkkpxwryrrryaoopfosysawrgrsfxcprxnsftewgfrwpiwsagtywrsfnegiptinewwykwfnrnyxstyioagegteairgxotitrkncayanagpwkixgakafeakgfwngxyckfpkcfirxntkspcorpncepkiwerxpwgrosnpyxtyrwxongyykceiapxcwccrtisyygyytcicwgsxcnyeprnxtappfafrwggatwcsnwcakscopfecefktiakwyyyywtawakwracyrkfenankwawywxoixexinrtwnragxnwacsrwpifwgknffgonsrxigkgwwspikwcegnefaonkocacwpargpxyiciaycfaecxnfprespgepfspstcapyxgspwgwxxiefexxeetsppyisisxwrpsryfgaxsocoinfyokasaynkyxpaoitsfotyteiogyrfxaeifrigynfscfwsyargafgaagopyerxewxecrawnfwpkgokaykkypeexsrfwcapcxpocnckrfkywepctfaaasnfkiriwwtipgfkfypaoowwisawcrpegrciogoyyixctxrtognrycefccwpckywpiengngefpkwptasyisgcxiexgcitngycwppsxxtrpipaxgeofixtanpxescasorsanstrnyekrieincfwkpfinoawsxygpwoasxnrxswykexanocfwffyiyggesocppnticwxfxsgnygykociryxxcyrnxosenwogigwknrriywgffaffwreatnfncioofpspsonfpxtfwryrxanxnieninxerfaewwarossgprawcogkooxincsetysrrceakponsyppnykftkfkaonowwyccaryyyxewxeaggeegsyiwgtskcenprtiiptyswgpesxkgoiaxarggfafreyftkitnratxtifkaworweenxnyccwawtysifnonfkiksaenwwkkeroyfkkiaiexwcygagpkixririknfaaontegcnrxaonwniapxrweyptrpiwkcknatoconspxygcrpstistkwckripxpenwpyexgriciiysykfginpnfksigkpepwknogoxsrsrwcytcykxsynwgxxnrxpcwktfgyxpkprgegynnocttwitpfprttrpkwscscixkiccewawexgsregnfntasartfeecyoswraaaytcwceytgwfscpnokrspgkegykenerocoeengifarxerfrsfwstapopptsrsxcoixxfsskxkticeronycexcfopagicpynaryagrnkeysfckiisxcyywanerpkpcgsaewokfnfypkncfganywfcfefeirwcfwwownnoksyfkwccsnrtfitffpxsfnrparxppxssffpaiccctxcpoptkwfotgcxcntweoakwsacinaoeprnxareoeeyiknnrocrfpyoatcofrtifyrssrnysciikspnfgtiwtryfokwoagogaxxcnacxrtpaenxtrrxyeewkyaakopcirnxykkrexoseserkrtkpricrywctfrcnafwikorksostnpwygftsgiswrycrynkoygrfrkypftrxgtkpoxaiactcyiycxafsprkryasxkgnpgsignxfoyrfkxasayiiwtfapnkweecetknrxacgfyxaroxinenxyscnacpinpctnsxkpfpfkeyfytcxkoiteffxywoftrkfseeogciaeotwgrpixayeikpensfociapksfaypkskyktpegrwriwpefintsfkrwwrkyyrsriepsfyigwikoytreiyyygtryakfogknfwkiwyieoxkinkasiiygysegicsfwyewagefscspaxxkeggnteosspooyaoiyaxxeongkrcrttyprpptoxpigwxkxwwptnspnsgntpnkwpoxwfwwooeconiycorakioxctptyyxsefpkwgentafypoteoeyotpgxysnfxrisstfarsntgkwynxfyfrwfxfeoepwtrtwkofiteptrasyeasrnfafcwgytogsocggrrpyrntegcxpnkxeokicaoswrfxckietpatcsokonkysxoorgxnneyoseenyningerxtwikxiyxkoknessokkespiiwkpeetioxxfxwgtwtofcwrssnwtegneweixrfifstrrgpsyxogcnpfkaitgwgkppitiyrwsepwgktesgencrttspcgykrispktxankwwgoygipeyrfgriirksftrkgnwkfrxsapwwtwyiaewckoifxfofssrpgwkgfnnipaagoxiroxakfywponxpswncgwfatowkfcorwaokafnpnocgeioxgcaagngrtratwtgxpinooferggcktwkcgkkkgtpeixxpnciaxtfcaterocxxnapewyncgsfpkiptecpasksypciokcktctyeypifigcxyxyiwreyacygcywgsgsatfryokyskofccpfioxysxyyyropxpowsngrsriipnkpfrnesfwckgyscgrrnxyrtfawigkoxpxgftnxnxinaeegowoyxwngfxiixkrnorafcnpiproanokpknyofffrariciayepttkwpwrekiywnwrrccikeatgkacpfnpcxfwnggrafwccwknittkooasxfgkwxcwxcgpantniyxogtccikftonekxyfyxcxwegypnenyctrfggyntcfkkykwitttxtwptniwtkiiepaeffypptxgextacpywtaxctriiacgkrkaiascotnenwkiygntfotckewyeeikgogswssiekfewkkaswggteakkycfeeerxtcapiftpkysowywfwekrswxfeicoakagnyypwgiwtsyofytnfcewecowsprcwfpkoxowfwatontskoxoxypfnxgesxwxnogiyttknxwosgifopeicxpxsgfgceraaicatspfrnwagcnyofoxptgwtcfewnekosanarcgspygfxgyngafotpatnkwytgcwocrppgrrffgosrgfxsgwspositfneaycxirppafnipcgpttxaoeosegnsfkkokefwskapncfyerknnpnsntpskgepwisxkpffgxtpoftcwyxiwrywpecsiosapakgcieexeypgritrctftagotiyswceynoorkgxpsfoppgsypxcenrosegftawnkntacioporanrpfyssotasornrywwwxsirtxoyafaspwsfkexxxwarrsrikxxggwwyoeyfwryyxpwnxfrgcgyeapkcpiyiwwwkctncwaniasxkrfxwaexkskrapeccstiakwxpegowxfayparnskxfrcncikfnwoktngksskanoeeextygeaxswssiwyinffxrgcyopncfxkgykktfiaytieoreynexwyrxinyrkrecennfyciinypcowefirkwgotfxaaafsfafpogixocgayatswaewiarrcixptrxgksrtgprgxpncaiyappgaxnxgogieeonkteoasewckwafrwaxoxwfeeaicxcsesyagktfsaxncxagarxgpawnyeaawigiteiexknnkexkwskkystftxesnkyerowycwpwrenssotttgeopanpcpxyrytwrotpyttaprxyseoswrgrtrcopyagksnawfegoawspysggceeaswwsnoyfeoowtcscswxtotxtaxpogsekptafpyyyckwxcoxoyyppgppewoxksepxgcfkafkwtseprxrcyoicgiwpkofxnnportkerkkxgkoxofxttkafpxpftxockrcgwxrrpnxcnnwxrirpistyekwyxrxxrtcftixstkyknxfoakxprkokywrwttgiesrgngenffnwgtptrisssngkacyxkirkypsnxoktxyontaasoeaypxackgtcwgceykgtefswxpcfcrkfswwketwnaickarongaigefanecfceswkenfxparkxgxwyiynwpyxxritrntcycgfxyapsrnaaegnrnkesaarnorrntxgpxtswiknpsignweeeyxktkrossagoyopxcftcrikgeeeenoakwiiepwptiinwasaassoptsosyascanckewxwsntpisikyiryrgyiwrtyeywgkxfewkessrcftetfwoipatyktcexswrtswosxxyxpiopooyipffawirsrarrstenxgyainnikoessyssfnffywygkniecsfoyfocfapacgwpgkeisekeonxcanekwrytysgxkpiyrotfgxegekrxnaneoycnapigwseoaftfcgtrpixknecitrsoxyfgopicpfexcwwsnoxwiwfwrkrpngpefnnwnpaefggannonsiftnifpsfkrpxcckowewpgoswoxgcwnwprnawtosogkcogfncigorfcexypnswtwngyxkctpifyyfarneyerrwynnoaakkittyffyygirkgfxnigtttesacrogfacseopwfxooayorixpogawseawxotecektpfgywaacsaoxcfyggorntiixketgcxeocpwwaonsoiytrwkarafpafyaocrxfkgggfgggwiiyxgeifgtptrgixaeigkcnrwaccresypycsnceinogtynwkogstcsxsstpgxpgtgpwwpoefcgoaecopiktnpxknaprrcoykggffpngxccnpfigppponarcatikicywtsyfwnxoioxakfafiftwskwyiwetgaywxorxsgxxogsfocggxfywgppxniatownyttifwxknonoawwanerfnaswagfwnypnfnicegnkegakonogtfknscspgxnstseyrxitsyxxytagriaagaprrkpxrgepstrafcspyxgyxakeknnixpeyeykrfnfngaaoxcniwenoaaecwxteryefiwayxirkopgpstrcipppgwgywpanpcoofypwsaniiknfsgfxniperktxooegpygwricernsgxnogwoesgkogfsswwscrtpketykatsgfatnxcpnpsrgxwwawweaoeaxnoxrkyrietkgankfktfyarsstnxtxpfwwxctgiksefgarayignaorpittrxnwfeefyotsxxnegkrwsgwewcawssgtpfafywwppfspofreateooiscwnioxwewcsnewgyaxfoaifffinosnfaynapsgtkwgotrxonnxnfagaegikwkpwsxsxsktnaxcpapaoixnytnipoiypyrtftwratrnxcyoxeciipissfnpygkfaakfiftfnrkfeocpoectwftptpyyakoetarsgctkenreeieikcpkeggccwynxxpstwkiyitfcekfxpgsowpefstgryocowsxaprekytsgtsnkeksxoeaaoganaowyexspfncrytwsgowsepkoefartwnpyctcwafittfpkwpnpwgsotrnpteaiipytfwaxfgkerkifxynxryoixprywneixgpntcsikcsnytxkyasaaseoeeefnxatnrnaxkffpnirwgeyasgcxrnaikwipnsocrrooxknwnesfyfyeaaygspapgwiffessgaxrokecegscsaigycwexniwscgkaigiptfigeeinrporpckpnopfcccxpcaagfynsinfsppniinsxfowaeosofirktffappaykefykwagyxyatssxryirsrckkxnngggkiinapegkowgxswfaaxcppyetwextkyceectwfnexyitoaakkgkyixgwifxntyrpfxifnftrpggkysgfcnkatppeeoceowksnncwtpewpnwecwnryoxfaryegrxycecnayipxiorwpwcaissenxoacitrseykwwxwkcntoxcioiesfynrgnytysagrycoxpxyrkonagecnkifngwiaopifcyfngiikkpgwfsxysxefyrneowircipwonkectyffyxxoaaicfnwcenewnpeefrxyrwtkiinaxtwknaaogakrtfretcotgogknoggyncwoystcseaxwwtosnoswwxkccwyorrwkertinrtfrneyfkkaswgxaosngicsyotcporacarkoycikoncgfnfcrepxwtgcxxokkfypxsnwnryofrxgpitaitnxifaewespgifyiwfoyxxokynsywrxonefwfaegoseferggetposakckwnkytrfioakxiyfcnecrknspaacfnfgayrwsegkiteyfxsssyoaskoseexriexaswfgetteossoesirofganrofxycfcenfrofsfrfktkreswwengnywfkftpstoixyrxofxwoefxysyfffpaaywaestytkpwggwcgsfgskweriwwoswpyyoctsxceagpoacckffytfoetyisstfygytkggeyyrprriotyswytokygroxtisayysasipreipyreegwgceriioegggtkixcaixaxecsafnpnwoetyrkrowkysypyeopcoafaxgssnikisowkonaotxcrtyiccynekkirsfckikcssgyysnpxfsekoeysectgxcitsywewtrpxwkootattipcxrowkakiaafkwnywakeyeegeyiiensnwxkynssnnwfyocsopwgnxpfotcepcgwrpokgrfeyrfrrfoskkiksiecfnwfrngtgktsnixkttgkekcosekwxgxrfcfprnkngfsgoorkayakpctcnyeoxssartffoxrxsygcogpereiryipkotonwrsennxcixacnwneknrrriieeconaporrewcsffgyiparrgoefwycoyyggrixnfekectgxesokgtgotcwneawtfagcxyeioxysofgrskyxcgfkxyigrwaaeieigiwfnxnsckrkyiiyaopgretpgkrgrxyewnxcafwgtinewoonepiecociasppwtpnokiygscipcpyiarpkknccfisywywswegicexeogxppetntretyyatenoasseegrrgokwrpiaswcpgtpgigxycinxfkwogxynksattygrywkksciwyifxcwitotiwawfwpsatooctiregtpaatfxxspceyygfkyitynktykwkxfgenkprswyxyptapxppnkieoyetaonppotawocwwgnxwwinipgycegcefittyyfkrrxwwknakixiktkfckikccoygxwcpikinywnnrskipyoeewgixtkitnxcxwcorencrtsitkxagaifiwkitfywiyyrfxsttisossrnwppngctpngscarfrtxfyyayfxccrerfxtiissewengerrecrekpcccxywipparkoopgrogpakttysppykncypfnyrcgggpfngkkktkyefwoaectooyspoirfkkasxpsrwrpyioyoxikwyrokpanywnnsafyxxrweinyfirrfnkknfeynopkeoryopocxirpxrtngtwxexaotwscwirncpwcpyigresyxyrccoawigcwywgtnagstaawxgsreitaecywrsfktosgwfwekriafxffnnpenxxsrewtagnrorwwnykeocyonekfioywnxyancfwcfronrnpxeatyneenwrxnowpggcyoxeayoxasppkcsrcrttxfwxfwkfowafpwpoirgeegkgkcrgypxywsgefneepfekwnfnwaknxacnptayowyrxacntktpwisosgsxnfxsicsewgsrtixwccgtapipefrsfkcxfetakkeigowgpcspkxxcxatarwyxkwiicwcicyocwokaccntwnxkktcagfrcfnoieitskwwioigsfkaonwgtpsgoaktirkpwiowakyycixpnyyowfyackykoyigpspoxroikaiakifgfktypcwfnwnkcaaewnaikcietgyyengiykwfxensxxggefnkcwtcnswkffxtnsewscfksixrgrgasosckwssaneapsangetronwnarcasaprtasesnyfeifcaxncrsexikskwcaseaffkrnpatnpskanosfpokgpeawgfsswprarnkakisgxworgyfeywffpaggackficxeaeggrsgicnwannikgtewaxeyrngnfpwofgiifanrergecxcxkeggwtsxekinockeixofgnifcgxacnnrncooarwcowngfpraicwtrwwaynprkynsnoxnporpwtttgcnfgtgengyesencfoeagnnfpneiaffcsryraaxgprsoikngicnpaxcsykficetepfcissrefceewcrfxrkkrxxasiypcroattwggyotepfcgiyywfyoekxaxiieyrkpkkgossofnaxgpcinewfwokywngixsekynaiacyskfofrtkyswncnwyfkkgaaifocwratityiiafkwersycpkaypssggixtwargitncncxpwiwnonnstococwkifygwfrwyicnxaotccpsgoaikoycpssokwtpktckpyrkfstcrycnrripcyrxfoianaxwnogkgfnfcpttfowenxkgtcprgnsxoxixcigtacpxkppxtsxrwigintwixoxfpkyxfiyosrxngteikoecsxxtfeiwctwxsoxtwnnrntoysanfayskepgryecgscoxwicoassffpkgpnonrcprakkwstcpxpykyspfseteycpoaaiegwrsnkgnnaktpgefetgsxsonteysytyeyfaskoyngyxwtaengogepkceoxrskpiprfrpxtkxcoswnyxcnwootfkfkgprkpnkixokwepsxswssancrwcsoeosfgwnxsirafraispwtoennfsoxnwwtgipayifxyaftecpikinpatesptgesxwooyxxgatkknfostaxfwknerrnapnkrfswyiotfcgnyrpgyskxectixtctrecrewornoprtirarrkawypngeogifnpkoaxirfyekapaxxcniowinsooxreixrxirkfftttycwoxscrnwcpnfscxnecawttkoeorefcxocnktespeangfrfnwcakatcpegwttoyatskocciwekgsnkwcxkaioryxpwfostifsskisxnfycctacyxtcyyfkiitsoxxxfpncispretofynwrpwkeyffcgysaxyixreywitsggnwswwxetytrycorssksgpawotgakoctygxptwgoneyoapacppxwsxarypgpkwteeftxrnwsrowtatwncrciexgiyocpnwsnwikppssxiaoncpxratefpntxkprxonxpcptrorxxpsanfaftocxnasoikwarpskswyycofgwiofxgcwtopkcnppsxfctsrcrcnwynkyppkfskwssaeseycxyxsygtfcnweofnfxiioyynfwoaxtpngnenipfykifexywnscxrsnorfffptrkyageneaocfxwxxfwnwoknctotxxtrtfronkcaaeffsrkfyfgopgttptyyetffxpgaptxeccgkwstceycpygapfpsecypifsgpgkpsiwtppackongraoeyyfxisnwxrprfrgfwrgptyrggaswsscfwxonoxeyafgktrnrneowaaokrstwwaxefyrkttearyspkgxaptnogrpionpfyyyyceosagkxwwxeappigogooyafykeycpgronengkxsntwcrnonkntytyryxnncfwwgnyppoeskrypngatococtcoppisprksstxpscwptakfceygfniscyitteganppfwewiryercoprigrcagaayprrfptocxtkfkifkgnirxifiwipaagnopaexxteopyfxpigwytrnepxescsipacxyiixcgyrsfrtrwncaerpgitratnwegwysseefgwpfksypwtcoogyipsysoxroctxxcprftxicrnnkkgwixorgkwctixttitoknrkcwctiyweenwkpgnocscxgcpcyeyyixknwkkaafwetapsfsystooocxysaogesgttooxaconkgcntgeeekwcxisxpyisckttiacotowtxrsoprpawxstcaootwsitofkfnfggifssywrencnwgcpyaiteppagarsgwweppogsenyosopcpyornfrwfyyoxeprayfrfxnafpkrgaiptkrcgcftsxyofregerknfgipegaogositgxgnyiacgcgxekfewscprwnansfrcsitsggcxenkfkwysficoekkcypteprkpkrprwaatrfprwekgstwstooosykirwoesfienokssfrrkfgwwnonokeyepxcttcsrcyegtesnoreeaokpncrkcckfniicnaigenpgwirwaoeareyaronkonxxrrcnyixnowrirxrwwgraaepcexspsekfcwicfaoieeepfwroxxreeoftyenwrixftyetfeewaifyoertfnfnaixcygtiiwkwtxnrarwafktnpwrswwgwsoocggpxwsycytgrpontrkwcnysisewkeefswfyrcaoynoptxwefifkxcntowkyeicxyratncscogfnaynwigyowoiwkfnpygnpwssenwwrsgswntopanrexrryxxnsyafikcgarkggopesakyikyegepiaawiicoiaostkxsewyencstwakspyogkewacnitxtipciitkocysaoxawatxcaswifntettwpwsktxrcewctnowrpgactryrngfgiipeixeosrfctfktkrorkfpeykyxrafsaaewerwoenponfarwxycftkesisowincgwnxyatnentiexynwgexaynaxkfoaiygatoktcygpprpxfcciwecwwwtrpoyfytkgxkgrsnapxiepeoriowrsgnnyypsnfwkaeapoafpegteisfcwiippkiyskkxseeggpkfkyfcewyocyenxirynenkaayoyrscccoggoonsoxixwirnkrsipwtwtingwptktnsetattirnriwtornwgpoyeskwpssifpeocrwxiieannptcaaifgncytipxectpoptaexynnkyggpsfpigersciyysfgscnrtkaggxcsnicsxnwfnpcpeyfgigoariwxtkycwsfcfaytneyaggcfxspsoexktnsgotynsnwrtewngtpyxicnxkninngngnctapyoxcaicrswiftciwcieyxcffrcykakgsyggpsefppwrpngnscwskwyrgckyfnfigapyyxccwongtrrkyeaotgaxtnkexkeegapxgpfsonseyifcrfwpygexrxysnxfspcfcntncpkrgypworggxcsnrxifnyxnaifoooowfaifsxgrtciknesyfowcngkwengkgntiexikisppsxnciafoopiptokiaykygipaweifgkirnepnnwggpawtisxyrxoeoawwgtisoyrwatsnxowekwiofsytafryarrtntiwynkfgsxeocweacwygrorfxwnwfywnfkpswtsieaknongkskcrnpseyapxptcfakyscpiexfirxoposytgefywnfifxeksfnayfycsckyceeakcoeftggggkstcaxatpsngtacrrewggpcweeifxtooptrfkpatragffcfpwawixinasttpckofwktegiwetyiacgcxcocfafrpicnxsegfcseasgnxxprsopsrirpasfroyanaxctrkswtpitacwgikcctrkisxiixrprcpecnrgskapxpfsewxsggxwkippwriteatieryoxyaxtokfgfwnfefxswwactapxworyggkiknkkwpkrniixnopifopegscypsepgpycsnatowfgrgkkexyentgxekfffnsxrycaxywyrarfstprfgxgpoenneytstnakgxgaysxegskrwxrsporrwctexkpcokxpritaotpaonwnikkoatgppfwfrnriwkpcckpxpycgtwpfkyxtksfkxossneaorpycnerreggycwowysfkwfketxiofnrpyxekxoxiftgaknticpgngkwscnstakoowiccioowwkanstisrrcwsgofyewnwarkeywfteiiyepgascattsresnpiytnsgceasgsgnnrpaxokgefkccxrwsxfxnxpettnportiwwscyetnngpofnepfcpaxsnssgipoxgxnyigteeiaffecnryyeogcxixxrtsipteiyopioowxckxsweyacyraofskysawrgyoxfasiyyywcsepsrixxftneeeeenecwnyrnrwoisinitisgyxriwgwcfegeafykpriekscweyaaxggwxsgirpraykfptcfakpxkgiagfxkgfafkowtwrptaiycprrwptwiegtksxcsarooasefwskiyitwerawfwisknycffoxiftfrpwnkyygyawnetefwocyftxgsffacxtigcsrkigpaieasccanwecofrtgweyktowxgwsywkgagtktnsfewkcitcstckwftcspcgsangkcwrsiaewtnyaroiyiyxppxkagnyprgxxeatyktitnstwoiksxorgkeorypxgtfgtfxeaapiefpxowketossttpisrgeyigncgkwaepaxxefctosfcoyfreyekrrnooktkosxtsoargwpetacsyoocwiaerkxexcwoiyryytpkesyafciicktyrnfxgkfikogrtkirkwoepxfntxaywnwkrkwsoskaatcwwcxwypwyriikooarfwwitaxnnfnftsiyocioreotkykxixnifnswanggacnxsnyewirsnnrptygwiagaxiotksccfeietaykwxwnnpckwecinyosfoegyrgycncxygkpnrysokyfnrwitpcnexsgrkwtocteiifwssyntagctkkweacfspewnxtrrygyteicrawtfkxyskxxsfnyyoowneeokcsfktyifrrpspyxgrgnkfgswtskofxnwocafcxpknixknktofpofykoigwntyaixfgicfgxfpxsfefskascfnyinaxceoogoekfecafryiaepnrxctfisxegatesxnfxikoiseotrrxgwcpakstpsgysgptiytfwwgkresxooxgowcpwaoxyoywtwfxewnenoawcipfxsaexonofxgpoccrnrwpcnpesosssgxpyecpkcgoiaxsfkpowsgsfwafpwgenyrarxyoaikpankkanonwcrknaxfciscinskywtywkypictpyitinsxptxeggecoksfwxcnxteyriacgcyngsoaiipwgcfgnoscgnpaixtgsyfgoiiofrsaoycwkookywnissioiccatgsigsoaffcygtggnrenyiaaepkwwnfexekgofkwekttosgepiainxgarcscwyaraskegxccefsnitaisseenrinegggkpspexrwpspsesxapyoywsowaofgrccgnkcxgsfokrtsfwkokiwyykfkcotofoffaggpkfaasstefpcxswxiescwrseesppacifrpiakoyoygycepnscipgftygeggfsrpxetckswgaeiakgxfggoftnikfoxrcitxiyanyxswgsksxitepwsknpnywgnrgtkkpgfowacnisoasgefstygnrcsgncgsfoapxneyyafecrytcakpcftsogpnaspknftixsoiwkeswtpctnsfwnxfiypkyioipiswiynypifcyxwrkkfrysraccseiycprateegaxftneocsoxwwwnaccrwyrcrgcpgyfkogctstangfrgtptkiekeakxficwkygayweoffgrtnkaogonrrwyotyxsapweftpyfsfofxcnrfssgoxiyfwtarsptsetyiyiowfsssgpxrrttsekiexxtofxonsgfcccxrnwspeccswstaexstgyanppfxoraayggcywgrxykngoioxscayxwprraypxgapwressgwifrwygkcnyoywsexnetryccfatcxtnwfpxxwyxywtpxoanygcypyoenofcogceyrpyfnfkaswrirnaiwnfkxncgyetygrsogikotstrtrctoeoeorxfopyrpwxkxoerawfxsoctxfwgyexoioxctysoiikwfpngxenfgogkfpcsckfkgfixrrixfpiicysnyfcpnwiossrfwxkwkretfpwwfppwsptceacyinifgprsfrnsrwirkwgfiigixotgnrnkwgekagagfskeawypfgoerxixsrsyxygtykxcwsttxyfeppxorasrcftnfcneocnfstogxxxifoypgcgnsawpsgraiwexgaarekcaawnxekppaicknitckcxpetseerycfgngipkotnccakfiwwrcgsofoafxecipxntatascywoccftiwrkpgcotpooeigccfxygigkswntpitsiosarkfykggtyrffpfpccaiokiiyrscaiwcpescscpgxfcxscwpakxcaaooaffftktryfctxsppxarkrrcwxfxrxsiyagxawkiogwsfokfewkkrxfyiroayfitrxwrrinoroxkkncnyrffrrtocikgawcwprypcfokcpofiwtiaipgnsiscwtsxxtowgprforxsprfcpoxkxnkyfyokgrgnioxgtsxeftarngipsgcakwsgapyypaywfgxafkgwgxwwfnpwgaxxttciifctwytanaocootisaggxcawftiaafrfywwxxktxattisfkooeiangprookneekwyoffxixpcpsxwkeotiaaxagffieefpfekefwtteankgstecgkoigffcoieoccpfifxxtptpfgfntrketksitkycptypixaifnpfxfgcfnaiekcicwyypofenrwftrcrxageitgtxaxttckserefroykcysoofpaiaasagtpkytxrreeywkeykfwnppnosppoktyypwpsirrtantokrsofaiprnawcegnfpwfwkrscocfkgpxiyxkxiaockgikfefiiirxnxofnewppnasgsonewfxgeeowcsxenkyagcskwtskoxnpexxotrefrgpxfywygkwewkrieastsopxgogkxwtftpoonafwssrtnoygcnprayefanntewtepfirwtxrtgixgirgsfiancapkrpropeeaacgkiaoncxogytgyfaycaiyncraacyecfsncsokweisikfgwnpiwtcietoyricetpfextngwnskpociiaagsfetntiknksfcgpiwrsfncypyniiowkstnrekaaikfrgcfxaygkesycgneakixpsynopyopwotyiskcgfrncrccocpantfseggtcfgcwseskaweyptyafoagxwnpxwtestnocikicfwnxpcfcstakewowwirprrsgcnappripckpnpyatkaafcogxpotytnsaexotfwwfsgsrwrgpwrasicpccexyfegxytapawxaepwniicocsawtpkniecrwsixpyoactnyggayewkpaccpoysykofytexcypccnpoafifcfffwtxeyofopfgkxyoyicprtcgefxwkwoopfgcfatixitnpnktptyyfeaxgokspfesnsprgsiktgeawrexskrsweekxapywgywwirrkacieigyaoeyicaxktptarppayctsekanyeeaoeggakwnygnacgarkipggnreaatppownwtapexreyfksagewixapfekccixtwcnkieewxskicxtipnfokewwtacoinnxsyywyireisyaikoatyespfceafpnrikcfcitsgpkkangtrrspsynxarnxraxeysgknpgrywtcrwyisekctsskrrtnkixtikofctfrnocnncfanacfainyyaepkokpoosrawtwspnkpfyxaiwypwssctokprnnnaysfttescwayggwiapkkfnryyxweryoexfnrpirnxfgpfcykcinontrrogxxoasrenwkiifyepfoaiggpeewrpwanrrygpcwwtwkyyygwatstfrxnxnnsxeftcagyrowxcnrnawiwnyeiofgsskistpeooawogeriktexrxfgxtwwkxkipanocfxpyrrykxeessxesctcifwgtsiikgxgyyicnytgatnkcgyikiegwiaorratgepxkwpayxeoewoanngkowgwicosatnpesokgwpgnntpwaiawiwkfkewwnityartaxswsakyyrrpyixkfwsfiewfiniskkrkxsfcrgxaonwortgfrytycafyxeroiyiiweygcsfnayggxkkkcsepgakcnnfgwrwstfykcigipcyypegyoeweaekrakaxtneosyfioaepfxyowayxyfsofncppaekgkersitfoxsftgeapaignxxwaxpxffowgnyfripycxcfkirixfoaxfiagnwrwcecwsoerarpcafraakpronenfaeaewsnragwcxnsiyeriekrinsyyfrywyciarfcteikpyfsgppsttpiisstospncfyeaectppiogwgtwnxgiffaygrcgxxayssoenknagfcantwapckakesfcnyeypponkikpaecgyfywsxxyeywkokcfeiesrfsoxswkcxtnpwcayykrecwegcrpsfggetowipkaopeycygyrcopatypkwwefpppykykrackkiesoprrsfittxgxyprcpoyrgacfxxxorctswteceitfnprxxicfwxpnxswgyixngxaaantiyowyatfsfefrywgcyifrygacgryperoifsoxnnxfxyxiaicniafgxtgornokcincwwwftsspatggxgcpfsxersstngsnypopwcwsyksrnpinttfokkfiiffsreptsisxggnocrtoknyyntoeyeeswfxnfyakkpcxcosocnacrggsagxpyxskitsyewegykosgtrwysnogefsoinwirykrtsfosynkreiwafntoyrictyxxetekwpxitggriwsnyrtikgnwrptyaofyaogficakackpkoxtwtepfkarnfpxxiioyawanwaakrxncnarxrxxrtnakswwkkkrcgtwgwxcyywnkraaciaftnwwoxntosifigerscssraekiexwksppoiaftxntiifktcwotrkwkxwkyxsgxxoyxoecerwttfxagryknnyokoykfxienwwiyyforertwioeyyngwokrnxkkcexpfoosrscnikwtotawtckewxtiscgkpriocapcyrxxcnktxkkasxrcnoaocaontnsyegcoxxpwagiwwistwoiyskegpsfopoyxigyynkegewrxnoxycxkxroenfegpaxakrafksfrgiekytaysncxxfxcfairrenckcpxxpfytsgocrsxyyaswkpxnyiotwiyxrwxicoftfecffstsrrywfopgacsxfntykyiwgckiwtyikaoanepwsseofpiagwnngtficxkkregnfoewkirxwfripxiexoaogikxoaiypiyrsireniaxpxarcysifnncnsanpkeargatwkcyscwyyxgostnoerwfswaagawpwyoypsiicpaaafkwnirsscctetkprxnsekkfygoepwrcssnskrfxxtfxtkfercyirrrkaerofxpfaokcnteettgpnwitgoingrgrsgpnasyiypfarrnkgaesiaxkpfpeckgxarnwxgsnpxxkagfrkpykiyxaoesiyxseygftarwpwooinsixeispnsfscktaafonpfxffsktsiatcxwfpkggsfyigxsffgtttkkeopiyfnktwwtorstnencacroxocicrwwragrekwrftoawigefsnpsprgearikfoerrriifowftasfseknkgnnsyxxpassioienwnprnxsyftorgofgwtfnokekencetneitywsrwtgfgxgrpngenyxitygarnpgnsknwcncsgtacgpgogifosykcggrfwrcitpxciwtkiioisneiprcanrtfcncegkcciyetrwtaxcwacaickarxgykgktgnstktkkewxnaoaaxaoftrtpaecxggffffetyiyaxggtoypasnyaoepgftxokcpwxgpkwtctncpsifsfignnnpycctttwwnpktcsxcsssixgkkinrnxpswwctfprnnwnrsorgixstygnrnnytakifagefanfnytnryafykoxpyrigneosaxsycfknfkkrkfrkrpkwnsfficwcgigiknsaaptkwgferexyscgaikrpenyfaaeteakiwpietfrwwpigersncpgrixsprfeygosxpaareeswyoyiafwetiapxieffygxwersfawxycnexaregtrcipxfwwfepfprtsgtsotycawrtaotxkaiwixrfgxgxyaccineeowtrawnoooexacwepcwytfscfpiwyitkacipaooeprgirtpkkktcgfnfagkxpxspcnrxawxscyecgeporwnptwkeieekfawsrytrctneekwgxcxonkyoicraeesgxwgrsrrsciintygxpsnnwefwxyetngappgyoikgfeonrwrnwgyggrafonoxniocfgixgkiregkxsnnkfywiyaaapasxysyygyaexanwkixospneysksoxeocrofkpootskpkerscnanpfprcnpiainwygyttyfxpnkkwwakepwrikxxrfkfkfwyfxcpyxccwfakeyoxpsgeaagxpywkrrntwowsciaynyirirecnwiwpfwsxtyttpekxffcagerntffnxxcraawayogpornwaatgxfsyskcwptakpwwgficieipsiaktayxepxpsswgrkycgwxkgkippxisffcrpoctigfskfigwfwncpcrsrykrenocascgoknyaeeyfaakcgcswnsowfnrxseixawxatxxsswkswoiykygpyoscetpfcoytywicicinytstwtswfcsxpcgksiiypsarpespaccgwayixtnspoasinfrxfaggpnptsarxtfainckepprrefafppysipecgiornegwgtwnfcypeepieiwgnigesanasonepfiyosrggyccnaoriifncnpgikieyekgxeyfpcosotstpioptfctoaxagpskxeicoacrktitcnwpnanfoangrygknsptroiokssexxfnxanocennorkwrgrnxtageiipoixwgkcwynrpnpnitftpiyaeprxynoigxwpriiawgwiwpnoxirsntannpnisnckrpftpfpxnxcofotoaeaeoaowkweirganpoonswgwstffsfkpwfgesakgyisttwiofsssyfitrxfnirnrgokrawrtfcftyfcpoetkiiwsfiefexxtkekpniifcepgigfskxsswgrskayncxswcygearispnwgwettyxpnoyxsfyrferxynccetstftaytntrxeeisikossefoieocootsrorspwywgfycasyogrpswpsiskogeeitrewfayxkfirfnnnwipytpicrfnxkncwiwontcgsnggskpoxspitwyiinwgrpkgekcrnitykcnyfpiweayxyxapnwpwwwyskaoowxewafwnctsnkxnepyseosofkaenoeefroeaowgriatgngcfocaxncpiiganptwrtewkxyxryfnkkexaxeyygytfsnosoyswisccepskaottgpwpripiykewktrfipstikacgtpyktsnaoxxwnwxpipgoanaatworapginrffaiksycaipstctfkaiwapncyksttgrwgnioofxnxgtfxnsyiyrxicsofokroekecarkarkxopykgtfxcfypynkcgaccpwrrsayysyioygffyxfxoxgytsrtaxwfwnkgakicsewickkrwysctyrxxwnrpfoakyraeesxygxfaxrsaxsktnaogxsrxxgkfikxaicingkgstxnntgxoikwxwotayanirsxsxnnfennfafwfnincotswrwawnwertoccwxegxawnsnwfcxfiffgakrknirngwwkgegoppcgkttnnpyekfrnnayywpnnewswfxsoeesxffctyapegrcgenwryfgaircnyyfeypwrsakssgsiwnosexfnxfcgskyfknrncxnpagtgtnirfrawiecnpryfkaicrkekneppcxenconcifopwinoanwsiofcsrrycggtxxoiroerffayrkktfrsxoyrgnieeygncngxwoiikxpoariwffgrsagpoaksaeeeowciypcaggicryetsygoetnaygwfnpyieygtsysfgnnryoxgknrngtoapkswpgpaxwwfergyknafxioffskkyanogfykkgegtotrforfseywonasesokipioewpytnratxeexsyyergktwnsfockkkcaeeppwyyiycxrfeefsxaapnsgncakansagiafosfcgcaefwgakxcreixiwnikitgppfwwxtikstorwwfggspigoawiockgksraxaowakfggnfcaceggnycxyyakenwgafpgpfnpgoaotsyoxnkptropwotarockfigooxsnckxongoioirrnippprskppxtgxenxppottxgoxsicrcnncgtfgwpwskngacfriexirawanornprcytrgskaootpkesfswaiowaiexcafwyintoraeakfpxipxwoyitekfytfescaaxfpagganfxraatapoxygpponiictkwcegeorcpirxoxxfwtesntpisypgarwafneggfrwnxtcixckotpkeigekrrtxagsgcasorarasswfrspxaxryrkywppsweckxytsywwoftpagettwoeiysxtwtkfacgefenentaicektnneynifpcptrngcfgtxwepafeopfpsaawnyftifkifantastrewptgnsyaoarppwiienrsersprisaetfkgiyfttygxyntacyxssfgxnfssgigoixiacwkagcirwweixsfrakeptxreeowwktcfxixeigettxwogpiagffepsiackryyspssoreyssisptrcrftpsrpystfaxsacwwsograafafrxyrnwxxytgyttywyacyscwaisywrxcopwnoiegngoeeeaywywrwworsftnotsyfpnfisrnkryigcksfygoonafwcogcnrpipsfypfksaytinxfayirersoiywkopsytppnoayckkrofkpnfyacrgorgwwsxgyerpeaayxpntynawiotyksanonotnienicyrgtikxwyfxsstgisairifpcfrtfgfwtpscwpicwwrofggkxccaxokwogrrigknfrtofswkpccsatfpftfgipefrtpfsfegkcwrtswwetppaesyixgecokspppkkakfkxykrpiknwaeiktnfnksckekgwogisfgeccstkkeogogxogcwioxienfsnosognnssftecxaiccctoixfrrtwtgexopwatgwysikwryaygpownxwkiwfrgpfxxpptepiacosteofgxepfgyxikyissknrsratknywwsrynrokxsiwypcaxecaytwexsaaottkaxfksgxiggrsprnntknpfpinowsoprrtpckewioycwrxcgxsapongaynnxaioaswoigcxafkfniinnosrwfpfxtgwaakiyxsxptiwecptcpascinscoycgswpepsaigkpwxxrwcptsoyxgfycinpwftftgwirgstsesriafgckcfxyggxrcooryignseesiyfkcsxsotwagswenieygsariefrggoscxeseakxxaysenswtesgfenctwowksweapkawptrnannpnkcgsspsxtcnfgafiyeacckfnaxewkestawxccxwwapfkigrgarfgfsfpfrakrxoiocrfwgrccpciwotnysogrctyfyasirxexxocarcpceeastnxwfaconcpesetnkyfffospcfkyfinyawpogrptxyoyakrxerpiaseonxkstssriwpewixkgorswtgtyyfkiaiwxgskwessrowrygyksscifiratyckeogpiggyntneyticogtweowwaatrpoffocyrtxekooaygseirnkrrytfkwrrntrykwnfgfgsengfrgfogtswecaniwicgsiptsscsepyiniwyoopnfwkpworsxtxefgcsssifsgcyrfwkicpcttkefgsreaccknoexnatxeceytftwxkgoktrgircpysyfywceacgtiywneaeyaeykwofxrnacssxrraoripwfttaagfptktfkastfffntfcwtscnfkkkknkttetaeaixoyfieawnpnwtnyayxfryekyartsofysewsexteiyooyswoxytwgporntrfcyxcaxgfnoantypiosxgrntfgfpetawkwngogfwnfexccnwxnsokgoxiswgxaweiyyfgiyongtkafofftswswcfgonrxeepcnowfigkftkoeicsiottggerxscpffyeokacnecktrcipgekfrwiepsfigtftcgxtspayynocyttgetfwcwpgttxofnnpxcttkeospgwernwfxwefayksxktopfispntpnssterfaseononfkgaxiwosfixxaeixeyioaootrexxyapkgyecgsewsorcrrtfkwyapxynayrxsngtaagwnoieyakxoarrocpckcwiefkostngnnkgyeaoayeisgcfisfwofggawewyycxripirsfctgynckaxytxfxffkswysocisrosarextiysftnntifpgocrreftgiaapkexkxncprcopsknsnagxkwrciapnnxgryfcinswptpkpyfyxifyfooepifkitsawfpiyftcspnffnxyeawseycegctgwkigfgkpggtwyfscoeonpnwntrorepseygxascpwepseipkynfyocrffypwscwcaskiiirecsfnxwtkwcnkatryywwcgfwwycwrecaeixaeforwtgarerietiifikryweownyenrsesciissewtspwrooafxwfotwnyiaafyfoekitxrrxwtserigccaiokseryrfriggeogkaoptftkyeyfsixrarssccwoocxractrryoopwrokysatxptwokrswrxagwyngxoasxoasifxotxosekteorywgwpfeinsxyofsocwyipwitwtppwoarwewfixwsektwfoxptfnakxfsweygcswskriegkxenkpgaonpexxfktopnsfnnpesonrrgpkpkrggyikrewexnkeotpieygttioxpnpgaaewsaxtstaiestfnrtikptwwtwactkonfxisfgntankxcyskfegekygyxnacfxfxcysfpipxxfiepwokkwckiyccrixptfgkrgyfcfeynffxgotkgtteksgeanspogsxtwctswacrnyfcykksyinpfxiawkekeokprctogigoapyafnkwkwgyoxnrnyfkssyatainkakytcgcfwnpefpnogrykntpcincewnoicpcwoeixroaenkciawxptwxfiawtpasaptwewnsnwpakptxyfancanicspereeconyftaifsnrsyrrtgtfrtfpxtofewrtossfgpcswtktatpawksnotffpfrwwgaxesinyscprptxawkxagcsaaeknkfncygpynksgexapeoapeeikxtyeoyanifcaxnswatyftryrnsewssgwixfyirfpcospenkxirfwsikwpfispfsnnkoikfxxpgktpkrciwocxwifnengsprfkiwkssegwkcrkgikfkwyigwscnskcxeeepecgcxwwxtckypxtkfnapwiofxftaeepgnncieppwofrpioetopawicrgcrrcriwkwnfoxkecfafcpgfpxkgxiaptitwarswwfcpoekntykankeesgwtxwairpnixfepspignyopxtnetrftgryotxftyxwapgteyyfeggtkioenyniffcrponpapewafwokpktiaceafincatrionaxfpaarnogsxknpwytrksknenyyreigxantertcttteokiagtnegkocyaetasakkrgfgkgxesokrpxwsfnorfnetgooxnoxwykoxipengppgxgafistofeorffegistixttairtwoxrkikpscfyygpiosereitawnkxsontfinrcxgpfnyawotokxkcpoosirixxwcepwingryytoyygyteiswkowctxontpikyaynfyoksgegwfnoefeppygkgnaxptxoentwxeopxwnwoseaoegprywncaepforksxenkxrokkkseryggeyxpnogipxpwsocrifiweyfiaatrexikciknnkxyeitgnooawxocxksrpgecfycyckffykgytigptsrtigyieyykfetksfsxcagwyokkkacwoarxwfrkyrynwrrptpafcipkowgfckcywnikiwrkgotyotwriccycgfwpgyksikarawixcwfcoixepgpktycewceewkykyyxytcrnaiakrrewaynypppfcfigopycftswrciaoergyswocxfcoangxpnxkogtcwkfrwkpsefrioxgtcwspeskkgkaigaorfactkxfonroxeiyepkwtcknpfgrntffwwnncsttaayxpoeseitnetnpikcttasyrswkotakcwewnrkotkcrrfxttwsneartcwcwcrrcwyggkpagcrgigntxwpgrswyofgfttfssfggfogacyfkocnycopsikkriyygfrpekgxertskwoakgyfpgxwapfsteixfertycxtxrfxfstcfnasrnwigiftgyicartrewfypetwkopnafgaarneipirewapsraitoekeekpykccrnpcwxtfiipgksgiifnttgtcprgcygfyfgcxaerogpyrcpfiwfyyeayaxsfkgeycrpsnpkfcakotcnwrftsxxwwfegikaainyknwpskyssesoiaenworcpisgipfeykeesixxyfcgoykkgxyrknerkongxytsxccgoktrgsnsxywpfkaropkpfgneancpwkggxpnwrtcctaafeokpewnxastypefxtitetxwiyoaiegafeiynggfrxtgrtyartyoyekagiyenartpetwexttstocfkxrstfopayypsyrnkegkewytcncgrwfrpycftctenssgcriiiwopeokgsgfeowoafffctrirkreinygetrpefxcsygcnnnegnpeiwtcywrkwxxowspkcfxyyrircktakecwyxpffwwksioakfryngofewpcfirekksgaycoigeeytswxewgektrfpyfrgfpicoonaecigpsrgpwgrfkinskewoeogkfeknngexyftfasteeossgwpfkarewsfgeweofnggcawxcefgsrfkxsskrtxygigskknttckgnsitxytcpsgegawgeksxnkgwwxfcacpxegktoegorpwcnsasyxayntgppgppcnsfctayxtwpakxekwfwaiwffpiapokfxfxegccgatkireoicgkpirfpstkawssankcssissxeyrpspsoepyxwccakosispxwyixnowgoyprsffetktatxnsaipaeryyxxotkonyyeeiepkwtaasxxiowssafnxetgtgsnpwestpwwapocgagstnknwpofgonyakfggwerkowafnaooyyorotrawetfywcifyynywyccaaxoiiwpwecsxeesagrpapppaoegistgoycskoewarcctcigerriyoxriairpwnegwwafcnsncopkkokoycgrwfkxkcfpiepgoaotctffkoftesfeccienpstriykgwspeteenekerayyfyrcepnkpxsxwctyopoercxggneksaxxsftgcrwkagigwktgfixyawtekwpxspxppnnsyegexspxtexiicyaiewwygssprecxswnrfxrecnwrneftxrkoyyfxrktifngoawkgtrytoayigowrryapggkfctaagxgpiortxoatxfkyrcfxnyxoetiyotrpxoaartffnowfkaenotiogoainiccyknaagpxysynpsnawncwxpgpetncicopnspirfwcigarfawfipictpxyasestytnyryptfxssoisknytwiwgesktxfcfryttnfpskktscixsaawtispicxpatkgrcepkyknspsicnwspftnewtrgoioprftyancnngrpgfsxxywgxrxxkkyenwgpproenxkyatckotwcgtfyerccysowxotyotofknntpxtcfosrsewnwtaposinxicsnntexeiaersrnkipfftxcctocgnykgcwnwiaxaxrtcycfntyrxyewogwsotkkkxkkxetkagrkcnnnpysegkkecopikksypnikofnnfkcatfrgxxwrfcnxwosyxixyytrkwoyanixreftpirifwanfrgepanyonxkntekcxycicowkxcgscgiarwcgwxxpetooiysrnkryscssripgatckteiygptfykappexseprryxopoigwoosfcfarioogxtxrkoaiapykxafxoeinspgpnccictexyyesxfynagsckiwtrswaowsnasockgscexwwccwcetxwpygfyasrakaxsciwkacsopxywgrgkakpkwrckcygcgftpfppaakxaaicgtgytciiwaxoyxpxwiifoefiiipprgfginweiwreykanrorpfsiertfefwstnfnkangwakiysccxoxcggifryfpytrsniyapkspawsntccaxoaxyxfypinktatpskocwigwtwwypcgwkrycrfircxkprwcinrtnayayayrwkttokxpsketfcoeenisysywgggcytfgcgaoexiasetnrrkreinponnrnoekwcprteyorywfcxykyrixnffsytcgatsapxewtaptaopfwrwrffnyfepegpwpaaxwgftsgytigpkxanieigssiarwoxssiisywapkcxrenekkpfoxixcgxyitpttpcrfigipwgwefnfnsocgxfyprtxrypcyfgygarfrcxtionwsswxseapgscxrnnygrtiaxxpxaxtcegyeopttssscpwwfegitwsrncangtgsoayrrcspoogkafxwneygktaanoaxtgcspeptikfnwpsocpkwinnsensnefxwnpgtgocnenckwycfitgxxyyraywwnfsggpwtrforeikgnoiksroyatgcafggknkffktwretifyaftkncfieywwoaffesayargaexgiypnieerpniwwfcierooykefsnrnixyowaiwopefykcrarektroyncpctwewnacnoypkknckrfipangeroaptecrcceigofyowiacrcgpxcrtrkotiagwpptrfsaykietprwoicstokxggooeapeskcpngstisnaifktticwgyffpgrewpregprapegsokpncstwttepyiosprwnscfirfecyyktkotpeepcoofaypiiknakxkirtfswpsyyeyyionxnasgaftseapfykrxcrpiengcipwetcrtygiisttpaiekfcwarikxfrtswwcktysepignapsycncracwritpowcewntsrncsckerparowginxoitwfyeectkofptxtnpniskspyggryeerwpnfxctasprccfescikkcpwwowfckgknrgrirkkpypiekaniaywpecaskirspwswswkreectnppinfspfntyaafgospoosaxaipakgtrfkgrgtanrxgnrikkxackfairpsipktnefcoewtkyifgcccpfpecnrsrynypifsfgosgtfeseintwfewrnfprxtayoeiesyxaafooiycxpotteratrepyxfkpxepecrrkxpikfcnicoiwxoineaekrctwpckgetnnyxpnwrwnwkiaiwpwwsfafiesnysoyffeickpgpgexfxipnwwwittoypgrroxpcanxetxnxsofwawpoeocwwrpyancgwnyiwntcpkkreotkpkiyntpgnrkkngttseeyrcyxyyctpfrwsfwwwskppwyfyttecyaaniirwspganseiceaegksfeikkwakyyskifagfpweokckncfrooswipnaxpopkceffsytepwnaysoegarxiitaeiykygrgiincxffotpcoeroiprciwerfxaiyaipssiaasronceecatkacywsygixtncnrpnrfcayeksyonrrofffrcaetractrgayeeexpkwgktxconfrxxykyppegowxptpyateswewastkwistkxnfgroafeycfgsfocirrxitkfpkryikwexyicxoxigwrtattnsrtswtkaixriiywpgfngragtncfatkrcaeygttacaywntppknytftofnoxyaxaeyffipctinoncipgxkpgfxgawnoftwisgegtxswwgayooatxwsrctkfpcskatkgkcpfwooywwxgecnipngonoroeafeixsoaogckienxcanftrigscigkrfsoytfftftpfwogpiyykpwrpryrearknggsyipprgninneispcncoyrikseorooytxogtnefsfrxagorgfpakptwpniecxwgroawcwwpoyrrkyxiiiiffsaccfeanwgixecrgtsttsgssckwtntrwkkcaypesgwfotwtkfsrknpyxtaarpwkkpyxisspwfotpnfcketikgooaywaxtokwgrnaongxrkeacgsgpcttcaiasstoyxreooteiwfwrkiwtxrapnypxgkxxtgoexekgnwrewnrcofaoftscaytsctrrapxkoyoopsoaoxictxrfefgcsrippkgyirsptaogwitxtryrfirytxspoeinsgwswnxwrikofsnttrnrtoasywarnnrinkganancfxeitworiywfnntowagfpnkfwtpwfknkktwrktyponcggfygiokgwgoexnweentsfxknfntnkggwgsocogkwfwccpkxyekoasgwwfxykxigyiynxgggyseaaxrxiiasiwxfsgcpkcsgpratsspcpkggyxctfrkfrpwncocpiwicsatoptetsfcaynwppepeayapyxwaigetioirnoyiiescyswgntonkynpikitiiikofreiwatofepypcwxogetreogcpyiasxfatafwiefngnyergwksgfyegsxrokkkikarienykkwfsainpgkyspxiyrwnnnkipccgactwocixiccowgpypaoxpexawoaotgircarypiaikepwysxsxntraeeippgywastoyfknctpwgrkysigoyrskrnnsrfswggskykagisorikgxfyppneyrryiftssrcxkpygyyctiwntkrgrraygoterycxyykiswgysfpkawnptwiwonwnckwfkikatnaeragywraficntknxxpcayonstiocffgontasapkkowewxskknsnropwowknfkiiygytnaakrinyrcrptoaprcingnperpcrgrigsearwsgotgfaaennarskwpyrotofnowpgfsfwoexiontegaewgsoifnwtaocoxnpggaytyfagsgtexsoawiysicwkfffotgkpkaapwkxrytacapspnpryywpnnopkffaiopiigtoifxoxspsoeoreesextngecgioswyxegxnosgpxskwtcwfwtksacetpnnawswkrwcateiepaxpngieaynxiiiiowiyagytpraxcerrwneseecytigorftsyiygfkiccosfnxgaoyffwrerytxnysoayyianfyfapfxtfcgtsyeotkgskfwixngnsocrrxgptnyeffnooongoytaeirsrsiornpxtcfpcnknwpowoweaxtetaftcegiasenenoceofgxcfkprxftywnccxinfafcxrtkwgweesogyegxxtrprfrxfggwxcarfwkswfktxaesoiytikoiywsfpnpggkrsswnaonywtceestpcwtteysrcakisgyfigpxitaintxpponcyoxkapwnkpeneytrncetrstroyokaakniiwnwwgfgipyrfxycynyagwtegxpocrsfiowssywsfwweegffaopkoexisafawexpnyrpfxkpfwersxixeiptiswygxeofyyosexnkctakrtextianxaewpseaooagyxycenifpcysewstyfsygtpyrnwxygpygtxpwngrigkenifgkayokyataccxenefwnigiwftiiksoetkcsrggonerptceysfrcicrpeopiwnkkkeagxexoxfpaaiwxgttrwartexeewgyaypgsrfiwkxtittigxaeawengcxyxkgiaprtcxiopwgfocipyoxtikiafcoapknnnfiogsrnsifxpwcpcekrokskpewicyskgwrpnacffxwwpexkptotpygngetyoaeanopwnwsrekccnyxxnnifoaxikfiwwpsnaefkiekxnyapfiafsetxkrsyxgpyaskraxnfeagyeooiweiikwwxetritinieggrkpkiwkgsfeskkosenppctksoakyaekgiegxrngkgssoswkgtxgxpioxnsocxackwgacgxrsppiagewaesaxisegetrwetfrcttxfgoerwycciswgytoiaitpftgpkxaesoiioysnnpwenewfppwrgakwcyiiycpxaintsxkcogfoncxwpitfiffticagktgntefnskgnyygeipfgaeiaixepygkosaetwypkrigptrxacopotyocfefcyokcyscxitppnwkoyifftaenywikyxkiisawcyftfrgcewrepcepiawforwapeskeygxcsninnpwticppwtgtprsooyxeyffifefyawteiowgkrtypygcppywkscpfwwxnswswkxfgccryitsiwniesapicnxapexsxrkecwregrxaeoxeiynfytsfeeeioggastyyxnncencpeanyosnwiigewcffoeaifengwyraroesggktgsixwsfeegfosteriwtexegywwcgogspsyeootocetekafracsaoeegypnxkxcnntowrirfcsoxwokpknxekowsxaircnrpgoikigggayopseixsniewaknycnffcycfwkxnirtcwteexapeecctsrrytxsxxaycwtfepwrckgpctosonawfosfyeoecxxgynkniytxepcxotteykgoenneaenkwyoyxtgpcnnofkeenytakatepococtrpafxawrkrgexpgwngygoiwgopptkgeaertpcnwftoaxcaixcgyscygepyccokgywraeyitknigwcwnryfniiatrxfcpkxkownttrptgkacxwapacynakngtnirgawoscfcpeftsprieirsanraxggtpgksakcrorwxoifwwccenrrwrefcywoiakggypttynifrirwptnnysaayasrcfcxcteiaoxycntawckxatsipowfxgctkicnwkwxffiewwckfpryacxrkcyknsiiwgoafgkaprfkgkgfswfaspxogkopsknnkxgpfnxrcxnpggipixfeakwxionwoknccinfwxgtsxcwykioesoganrwpkwcarkgyoawcponnrecgtfxcgikptkfxapieefyynynaosrkepifkywernowiyeknrpyyxecfgepttiknkrwipgisassfnparfxkaowksattgsopopxcoefspxxgiwptpcfniyawyenraofyiffyyosfffckseargkoexitkyreeafnkxepnrxswrygfkiasscwntpactpxgiwfagoxrrcfpwaoriioxyefnwttxixraxintkignxefotottoiofyppcgwaxrpkkssgrgnrxketpnkanyecrsnyixtwasrentapsxaayfattxsgwrxeggskftpegpcxeefixiynrfwkceipwrnsapittygyseysnsgsfogxaonnpekwoxatxrifykxifofonrfornaiacaafxwetkkkxntrtckexswictcxfeetsyneyksosfsoccpegctotpxfifttyrrfyattwsxwgfxekktpiiaksggafwkewxosxkayxtofooygwokccwfwwscxswycwxwfnaepapopiexyknipnpgscyitxainarntryetkfyawyteecseorfenxxssnrkifpgoeanwoskycowaonrfxceyrxrefwxtoawaowrkrxwtneaasrfonwpregpgfxwipwkegokepngecrtfrftnikpnkaoaoxickcyxfcrafntfacankckakycknfnkasixaspinokcrtfxektxwnagticogsnkwnwxktekyxrfwosgppancepekrpswrnaxexcoetcsenotrffgrwfeggrgwrceanigrkikynksgsynfswgreaxtxtnxfrgsogwcntceckagopycgcooyanrppxwggcwowskciostypfxgfkwaaggetxgapswctipcwpeassnfkysefckotxenwpyconyaefsygstxrceenrceaeystnoxsrrwtcpcgotnxsxxkwxrwgygorppcxkkgckefrsifexpwpoaxyrwnsipwofarfterxeeyakrxfaiaisgenkricgaxtwenksywexwaioekretnyisekecnisptknwpoeystrcgpftpogwfoofysxfxorgknegxoccktnawrkpptnofygxonsypocetxtgokoiwfgprreoikrxngntwooioncexsoyneosayctsokpwkwxyofsxakitgpgtxffpwagaexpcgetetcotrnwtxfafyponoxfakaysstcsxkcfpgtwrfckeciypcyxortswotfsrfpnepatoreoontwygyccocxkarepsoaoysxnfpiwfsigaxxwwgnrfarfwxkewotkiefgyyickpypswitctssatwykiofciyiktnpxcskfsonooerxpxiagktocotnxngcsokxynsscatnykpksykeoipienxyfkfkyotcppawsirofyppaxakprnskforisekknrnaciprpateyoirsetikgwyxrnfkeyefaxeasywsxexkotontixoeotngkwnefexyocicygsgskeowrayygaaxwynofyeeknigwanryrfisiooaprwixxwegesiwfryxgegexyykresxpxsywtffwotoicgcfwtfseopgxfcpcowrxrfowwxttrrapysgrwnsionsosscecfsowktcfysstsggkticeperitftnecknyttgnnnikrffpaarfnetpecwkrroopsocwsansaggrnxkgyraoxposseneewtpfkpygagoryorgwcaakgrgsgskfxrgkxcxaocngatnkertasigxwtgeyggasecfyerntggtrpkrerwneepewyxtpiiryroixsppnktpexoppsrfoncffcfsaxnaofprstroppwrptsiktaftgsaagexkyteotiikkwfatpyxccwpwcnyropensirpfayisfyofsxyapcypeexsayonyssyctstssysinesxefakeigfeactxxncsytctioexoitwgixtksoefaancawstsyaegisniinepncxcrwraxarypggrfnfaptnnwoeigkwongcafgyyptpaxkkwtceoyxsfrfinasncritancfpnkafayotropeekarrwatnnegegyfogowryypxwsgtyoxcgisyggfspwexcspixwsekncofxnefattprkpryttcorytyaywefwsksxxeftkawggyskxfnoaftfksrggokwxxncaisskoaoiisocygciyotxykkaxfcyykanptxkoiotsixeggkasxpisggegrpynnsiwoifctgrcpocckocnyspaiysrsiworfrewcyekwxnnnxkriogratwoirankrcykgkxcpsecoxarpfcykcyrwewoantsgenkisoictaepifcfopirwyotagnsxtgwtcftawwnkaaytatskgngspsrkwfwkncgxwsrisptofptfotctekiowcigpriwsfrosawsiryeoyyspykrcctkstyrnxfirpwrtcncoyagycpfinoafopgfsoooxowffyixxnnkoyypyostgpynstekxxyrsfikcyngnxwwkwcgrxftgokwsiafkfxyfgxggwfswrganpweartnpkiikiyrekikosktsrkiywstwfaefwiteewaysxteniypoyxkicawkefostifkxsyttwfnwokntsntprkxixokpfkeypxgngcggtfrwxyitoakecpicyxscypntakrconrgxaewxtcipkntecskccnpgarapriskcywepcwowsispwkwwyekapcgsswirnixyewnynwwefxynraexcnwtepwsscenyacefkaaewttrykewseecgngaeexpyeywrwoforxgxiryoyokkssapeoirakigigcigfacnotypterrtkcyotnaoafpeyepktaiftfkxranegfosttxrnwagewsfonafwtckkwncyeywgiononkacsfwpkpoykowgnkxyysapfctearxrfppocnenaacgtgfcfkrkpasriwyxexffykoxaxfsrexnsciiycrrtoeengkowifctxreknakiwypccgytiyxnekyriecawakoyciierkygipafyyogoyrykfwaeosooeistiwaawrgynonkkiwiyixewakkwykxfecsgtaeriywfnwpeeakwpyrwfkxcriysycxcgecwafaxykoiawtpieyfkasfxnwpwtktgksntfknycgxwiifpnyargsfssnwrcektwenotcxoxtxsnftkytfxeccycwooaexwkkwgacgowagrfkfrpktesrxtrypnpkgkcipawgncycyortonistnxnocixaiwyonxctwktpefxenrntwgwesspcxepwgrtsaxpirooptpnriikwrgsxafypgcacfewteawgnioowctpirpwankaiirxcefreifstgwpgswgntwxgrctxwtoscoenkfrectoxrriewiyppspgfwoggyncnsgktyceorgoffnaoeogoirgnwfexxtnnegtinweptwrxoyxxfakrsegkctprpnwexfsysaeifkisrwtwpicwxagxrfoocpfnwyettperwtornesofpgfwgickoyoicrkcrcspofrtagtcwptcsasoxkxntxsiycapgptexggyfnynxpsftfkyyniwxkacfogksoanrkongfiriofpryeekokkxknrwaekcakptnnfgnxpfnngnfcefregwxcyxnrsicxngpaecfognngfeaexntokpywaiytgnpocfsfnwoiscntktgkkaxotgnsweopeorgnnwaynigxcowxfcssaafnxosnkaafnffrfaotarkxoorrpkftkfnkicwtypcpgggpgepwknpripapwgxpfkkpsfexyewfywngsiieswyeorcxapreipyaywpwksfcoywspptsxrnkctskcnpnxtfscxenegfgapiywttpyaencwcfywrpxaascpxxixwsksyyoansyyxgnyagwtwnfgoyasscxoekrkssogtcwiwwfcrpoeeeyosowkscweaiwprfyotspgxfifwfecrocwngopxtfwppxgrotwirfscgxktapogspcxiegegxnwcwnwpyepwtsnewpgeaoarnkyrpnpoaerwrefkpnngfeywetnpgyxitsrfyfeopxewkkryptyaoepfwyffnyywncycgnwinpgeyegiyceysrikyfseoneaokyfkfrxtiasnkansnyfwrgikntinonaytppnnrfncnoxfxiwwkstfiaisotgaxwwewfkgtgownpeoyykfnorgonpywnacoicptcfpaeypeyiiekirfonwwsggxnrrgrsyggxknswkopkrnpscowcxisgposetestknsotyecfnninxokookroynsxwfoieoewgnaprgsacpfwofoyfgcpsapfsawnieyitkkyoetxiaxsfsanninfpgtpicacrnetwrsxnwfsfsoccyxxksrkrikxokcgcptgpewgpgaptrcaeyfkyktawekgkyaxsoswaxxfwofoxwnngsxyfgtfetwswtxckeciaywrfntksitkpgynanrxpepcaxrtgpxxsgspsftifaywapkaoxncfgtotggagtakawnakseggcatprgprpewxeiyfxtsnspayrcafyxfaiaginnekoscwtinfwfysnopospoeacekwxgfcctwtewwfrxyyosexwftcyogwpekrrtfnekxgocykkkgksyseowrsgaokoecsgwipoapatxgioxgettnfrnerncxsxeictkpnirxaxesackwctciyecitorkwpfgrfnaeogxixaioyyeirxgoatcfosassfxooappcynxwiatgoawkfnwgnoxiiwifgcrscitcrtspextycppacsxyepwcktsckycwsesnirtioxpcrtppnetawicsawxknnswwenfceexkccogpxaisknpspgectapprsngyiwitiwikkxanisktiiriswkncskwnrofxpersstoroegorfxociiaaxypwtiegygtirwyeiiiexkrcftewppfrpekywarnnacesfecayiwgtraineroegxierepacfepwxnxeoxitogkonpxpncygpgxgixgnkaxxswwcoxnpfyginyciggcewingoxwreyakpwcxaaiwxgkyyococckxposstoptkcwgkooragakrfwoyfwcypapwwtnatrteinogwgfosnkitoynaicwsxcpiprfsyrnswfetispgrteanioypnsnaoxyefofonfgagaipccyroxxsoccpfrxnwssoftkkcoyxsypeietisrkereikioxecarrpcgorktpoxkyottwgnoxrssywnpcfwroiksxessatwyapwxcfgiypwggtkxgefwenswonpwgitcioneeoetfinxkckxsccfpyapnsyafkswyipoygywtapsgtionwnrtxkyrwwkytsgwcfcokwoppfrxwisnokgsftacwgynosiysktwxsxrcktgiirtctakxertteptsscifcpxtrxakcykfkegosxwapytppktgtkapgotcooprgiinkicwfycoayagpipfwkyxyrktntntywacneececcknoowakepxaeafwtwkspwfoneopnfrkxrxtggaroiygpcygxgigasygsprrcfrwkgiriroapncficftweinsoffskskyeensiwerxoonyetixykokigrfygnrwtcxefttiifacecxgyprffyaitwwgoyfytnpscppwcaccxofntegaefaixgicxgfencftcfwkoearwrxpgxwigenkrarkigpisarifpkxrowtxpytiyffnxgnaayfacknrfakosknieoiegkyegoownnocgcptspsfsgaypwasacnntgeoxskisaptwensacxnkkeogprsfpcyyokosttatascpawteceikktgstgipyfpyfrfwtrtpkwarxsyakktriycxixrigxisfxofrcseeyrapegreryeepcwgoogkaggreoxkatngcxpfctcgxsywtgpreconsgonkcwanapwgtnsokftfeynnoaiwiykxoprsiypkintkgpcneerofixsyinoesfrwkgafnaxwccpnyiyaxywxxgnoiafrtyxgagiseiwnotwgroycirefsprfcxytaorxirsxeokfrxasopngpsofwsnarfropaxrnkcskrkepkgtsonppexwftsayxkyknroipnexpxfggoofiaaiagcwsoecyeyosypacwfroyktowxxccrxgratowkxnyrwxttnagysgosafcxxsrkexcoyfrwogtanyccpkrgaxrfafkoefsgfyoskwykxopyixyopccipnfwtsswrpiiciyociwaaekpotiegfpykxipgoctkxnnrekacsfxyffwxofwtsafogynptkincctaixegacwrrcspepsypoexncoritoteffeykwwenycnygorntaxasoptsniekicxwayxgpfkfgrwktaxxtpoynpyaatoxfycosgkgpfwpgftffiwfirctpnrnkoyaistkccyyxateafrsyogrpcrgagwcosktsiykifogntgtopptypgfsyfksyptkgwfiwspgtcfgkfptipofptyoetesotscgggfgywysstkxsowooxtntwetipxyosnptykpsgnagatgtrpcoxpfgwowyrkiwxriggwtyxssxxkpgxeaoprwgyrfpiepperntgowtpswokgtigoiowyiwfoafrfsxpiagxowcnoifpnwxtpaotptxrffxrossfwxwessxkcfwiwwyknepkncnfrtpgaraxcfiafnfpknotorofcrrppgpywtgoxnxtcxypaccwnefwokreoosnykftteykyegtwaotarnggfypsagfrwwyrkitoxsxiseykncpiciwxrryfpknpnxcpgyxaakcyfofsisaxksogokyyaatgoaxtacegpexwonrtpiesrriksepyifgsafgfstpgnykytxfrgaxtsaiiiywgoxyywiiyfyectsnkywyfgrgesanaittwpcsycocyrrwroofcygtpsigtpnsntoirpwrssskfaxrypipaxftsoayrkncrokosnasfsxksfrpacepfssxrttgwaxrpsficftxoecaoiwsxyagsnseiinfgpyiiicwrxafpxigpiryofxpnagptiftyanewgyyokwskcpfxfxixxtonogeysyaxkoccrwssweiyswsnasxayrctxwwxosxcpafeksecexcgrexirapykoigexrrrokpsenyoretkgakaktkfwkrfnfcinrefioisswoapwsoccgtsfwsficnksekptkeeiirwkwyoexongyxcinaangciwoifaknytrkkaxgnekkipikkckgkrgcipceikffwwecpwtynteesaoitnokiaaniayxyytisoyrftkanaewprnreoykspoficcoercwpxcekxwonxkkakeioesirftkiwoatnfsnxknacyknkywygrnxnrecawykeekykaakoasgnxropsfkixyinxwayrykecssorsitxwyypipktkknxwtakkoafgntiwxtctgsaxerairweowtrcfgfwngoapatyrefffgnwxkgtsxsowffsseffyrreryoxxrecfncpeifpwrpniwoteronaeortoosriwiegaiynywyasgkppfrwcpotepxstnycgyetfxfrokcacyxnkafpyrpooxaogctanyfxskaatkfstoynagsaapenspfacrcenkfrnsiowwkysyppixgekkforrkeeaxiffganaferppxxirxoxwwacwticpxnigsskicseoxfttnipgikgkfysxctytgaoefayntffkwpiascskxaayfceopafygxpoxayocaetxrgfpasarnfpwoosfaxfyapkrwiracyscopncgrenrtfefwiytxngkntpkctrkrckfisfwnwnrswaeyoxgisgafsrtfyxagaxpnaypearicopkafypeawywexxtctwtnotygkrtsxwtfwxykeriicekeftsggyengswpnyfxicxwrrtennyrypwpskannkkxekexeoprxcnperoixayyniepitsrgapxfxwgnkxxpxiggyccokiirgiccywxsyrkkcxpnoarknraaopkgocrnoncaxietepnsckycxcyktitniaeekgaxanrcpfkopkyexfiioasowkonkgnfatnywisganrxieatkntgnwatsxgetngknswswcgpgeyxgtposcetpowfiscokopsrcgcesicgfgoogsktepyaeftsyxngnkeptsctgysarpwargnpocttrcnwrsckittgxespsanpnxtwykpfiogsakgtrpiwcrntkryscsiwsgixeaxpoakyiifkcnfosaiagexcgwkxgpofffisenennsiwxitnfykaprnsknptiaktewypeaoforpccfxrpkowgespkrxiskxpaarfnoogocyarcsexiwiirotiiisowastsorgcfpiaotrafxctgrtfafcpywrftckyowkroecnegaygxeswsrtextgssgrfsxrstyfnysnyptxaeefppwixwiopifegrixaoxtacfyypyxksafnenyictgptopywrrkafkgkpyakowkntsnoopkpeotygcgfwyagxaeaxogynwcpktprxfcikiaxkpgyxssgarrycorgtwixyixpswkiororyexxxapaogwceceknxgoikgfxokronccwreetwppkypoeetgpyxirywrneafnttiefarofsxrrafytpxcacnxapwnwgagrriwtpkfayyiieeswogycyxyrkwwpeeyyreyitnskkwkawkknpngenoytkopgsnowwskypsegynwtfxxrwkygpnwkoasawcagcagpagnsrwsofrigecykkrpptggtryieocofeespnyxgwrrnronoteggfifoeeppcxfwxftanwoacyweisgswwtntcoifotowofogptypoowanxicsowpwfenrfcyftyrxrfgfrnwyyrpgxaaneaxcpigygyiesyranxycnkfetntktgcaefxrtcfcttikontxspgfcxtexipsoaggpnokxiixrpaxgnapgifrrxnxoecifgriistnxcpoynipwynagcticngknaffsaceoysttkaxpigriaafrwagnnfrwxyieisseffkpfocrfwxspsfnpxoraispwktoenccnkfgofycecnyroxpkkatcpnssknsnkfntgiwiarxcygefokeeottryafrckwincfcssgryceanifgrscaitstokepnpwrrsikwipocityprexxsnwtankennpkcsoyextpgwxggtykgyagoerwpeoyieoatnxkitcynytraextesswcgooksexyfogtewagcnaxyffoxxwgiwoktkxnfiaisoecsgtytwrpxcwwcyprwoinrixwpafopprpeernxgypsorwryxifsgiyfoktfpkwpwkorsrksywkoprraxgokkyretgyxccorrnspwsgeoiyyrfyconrrriscsnyetpotctwcenoptckyxpsetytkaoecgwxxptywekwcryearetngrwgsrsrokaanorenttyxgtpfgfoenantoiigrokfcgagnkxpoaagkppyiraiafakegonxgsyoxatryftapfgtgewfnocwfafpprgnxnytxaxcnaeipiynwfwtscoyepcsgttfntaticrwwiriaofigtyeipriyseriyxgwrfoeeawcegetseorxggieiyrgkkwerpeypaifccfoatyxtaxnsestswgkswriafiwcgxgtrgkycocysapgwnisasafcxpccnftixkcnftafniwscfagryincewapwsekcoegoaoarfctpiyykxnfprekwpwpcapgonsarrwscosownntawkefocoyoiaiafanoaetxkiaaercfgnfaeowciprprwrperxtesytgwnrgekricygrfoitoxtraxwifwcaregkfkkfassrpesxifepipcorfstripryintnxgyiakfyxgxxxrpcwocrpfnyifcrognrxikaisafeystrtxrpenaxknewafttsiskorcsseixwfciokfwxotgfsgwxegytorkwrpcioketotcyfprwnyrrfgiyxefoanyikknpfiyxrwxyiwxwcnasyekeikoxsfaxyrwocegenirrrasaoknnaxynpctxswprgggagwcpcenagccistwwipcypecoyiroiisfsnkenkgyeaxtrniwxcrpipkwnsgpeseckygwrccpixgkiptntotiwkttgakssorokirrocxwsrecwcftwxkfercigfaactcrrropfotskgoacysrfcogfgnopgenfipkewysrirgitnacgffwffnagwkefwccictxwwywookpewewysntfktrrfxacattsrtxwgiwenfantnkaggxecfynraewsrfnenfrfxpcistrfxsnwtixgwcpctonxskpsttksocngttsfntikxapapyfofeyrwiegsrasiifgocssfppyraefnreygakxeacxisoeikkfxppscffocfpanconyfsrooknocxfkfyfxkifcpfeesygrgfygrxxetccksfsrtxfpnyffsptwofaxfkngiaswtfsxpktacffwtotopkneoiikxxyxiyaspskctnioexftkxwxgpcewieyktoeowwsepawfnkeaagkgfknsfttkgosrccaapewnxsgxgyyroipknofxenafciortrpwgacookkwacxckkntoeawoexgtsokxftwtkoipecassyfsoynogapgxnripsyiwpefgcyaxnofwfekpckkxeckppgwyygfkasortixpngropwnsxpeakiyikeexkinceotppnckciyrcgxxgawswixexgniyfesxrwapkseipeisosaitixkefxyspgsteigywyscsygefonoyfcttpcsxsskpsoepagpskyoetwyfgkgpkkaewxayociosoiksyookisypaacnntppkoipwcnieoierfrngrexxsekxkwfrcatainwyyiftaceyxfefcsxpksgiaooaetagknpfprcctrsiifxttekkxrenxagnyygfsiwrygyatesxoprasonkfaafanpcoposgereciwpcogpnknxxsanftxrkwkwxowxewywatswpwikfofkkwcsaxwrcastyxetgktrsprskyxkscaoewrcpktiaeowxrnfrwepewpfnaaoyawiettrxissgexaottigeasinpiwyrtakrtnokgarrrsatixiccfkkyinoekttetcowafocwirgntetcfnniogicwoogoksifkowweankronnakaowoworwpropnepkrsgxxgiexxrksanetgfeonpnwtoiwrgftrexfraiatrxgnkafirnogagxiproanerxcowwfsyasccwwcnwansyyfsiprnieggpatsaxgrstxeawfnsnagonggrrgroiorryswaexcswinegofyxgaanopktpcpcxtcxggywsiexnafgatpkeaiyxsownwoiksyxnxtergyaexctpcrxripykpayawkeckfxgwnxsafeoaxwieckwxtnafycfcckxwwxtcafxpwgonpkfyxxpttowpgfapsfwawxxooygwtnfcekfpekawscstykokgoxagyrgxitxfpnapaiytyefoetsaprnrietcyageeksytkfycrctowwftakotktysnggacogoegeyarfscyecftwwiwiytiepypwetaiicrsffkiwrrxsfxgnwcpewfgyrpwfcwgtetrkckknkacgwirrncgknifwkkfiaxcriryrprgpgfrxeaygfwgrtscgiaynrftcrgsxsecggfpocacneisytkwekicrxwkyerwfnxtnkxyfrfeefrofignprnrttsxntwinxykerksxwscikssopnapyipygwgkotftygxkcrwprnxcsoiwnxnanyxenfoxknocrxgcrsigeorgfeieartacipkgwswnyfnasoiinfygtgatnsoepyoxospsttirfgwywrcfaosaitiopnwywcotnfwtyskyftepfskeifnneecnnrfkiccweccokoxnyppwwregkgfofkkneerneyeariixegyanwyttnnpgtafppfroeaffssiwarxcxottnkgyfiyxptofroysnnpnktwwcyoikrrwownktrogwpncpkkrexpcxknpogwxtfsrxgicgofkokcfnsakgifxkofeiptrciwgsstarxaiogirfptwtwoasecnpyisgyeryfxgytyayefiwarcsikkxgeofioaieptosrteecntatgixrcywyaaxiifskpgtfrofaofciryxynsitxrifxacrxpcxneyygxsapeosppttyagckswacytcgkoaoxrtsrgsxyngiosfsfsosekoosaskpxtxoxwxtwansxxwxrgsisctayrfksngekfocpywikygixsespaygewrgpneyyixcwgnnwgpgypkwksewpkoeesfxewkksiingyrtpscpptsgktykokixsspxtxxtyooetgcyxgigfrkoyaoiockoswsgkpratwniggtcryikwegsykwrpkscgercaxsecgfwwxsaywcxniktoxyipiinioggsxyexwrtieyxtwrteewtpownrxftxcsxioocfpxaxanreyycwoorfinysciaywxwatixckytnpfiyfcsorniigwwtyscprxftrnpknswctgwirxtfisaxiaewnkcsrpynfteipggrpogffofysfocpywypgyitccfikrswpegacprxxcssyysyrxckosoairyfgapgrkxeywosagniygxncifwykfnkpsrngawncoxaxysyxgpgnpciekxrykaexosxkypccfgkxxwpyaototwgkoprkcsspinonnknoxgatkcaiwcrontaasxxsgoasewoikkpipyxpingergskswpayxnxaoeeyxsexoopggcfwafioeaenawneofagpyatofxxweeafntwsyxiprwskxgktgaawpirwynkfpettefkonwfsoiowskrspxigyyotyynttooacpkosfcnrttniaxgfseteanifiantigxityptyaxcepgryenaknnaniptrcgonckwxawocxytixetingeyggsggnptrgaaxopyrfcpwpsntfrctsokpfeofyrwtkgysipwstnotyxnckgfcwfsnikeecytirgiotwrikowtxkiysstnpcywpkeexppnacakwkgnfkosocckexrtygcsycocgnieprefofxeearstctgtwyeaseenrickpyggyrcxgiggkctrkisoospsnaccxnecanycapaxrsyopytextrkatyakwoxyaekrweaxwxogyewnfwisecnggkyronwsafkpeweoowtccxkexwetiapgewoecxyiigatickxptsgccarxypcnoxakgtxpxerciigkwtcctgrawwwiassookpcsryxkotfnfyicgyxsniwctwfekpkaywcfegekapsptyfwyresggoxwpkgtsfasxosiwiyrgrsyfxetetstnceacaktcxpptiferianrywttpysittxypykkaontnrpiptptgpiwrygpcgtiftrrygxnkstrxftsfgrecrktsekpncacawarfeogexrwgiawfwittfrnfieytkipfxcyingwicgioxntpnsrkiyxapooygxwtytnkifexgnaraakiaswwyneitpkcroxtccgisggwoiasrtworiggcceyafoapgsefaiepneetwgpwracgryotwxygpxxyfgxirrwattxaytkoryaxpxrxtkkooorxgranxfnygfagspertskoeespwsfwcngiosprtcykxkoperskafefirrwatncirwgwpowgfiirinxfyfpnngxeknoipakfcgtifwanppwpasfxopiantprkftweatttptyrofggtwpnkogkwpsgritswokokcxttgtwrnsfwitsnxfnyiptycogiterensaxgrsertkticsygwwapoertycspcoiweoxwsnayowpxpntrcoykrfspaeywcexffgtwxxgfxoiyeaacaktsyafisoergpwryiokgeynxoyoxirnppooiraeacfaptecirfoseatotnptksxsacxxagyyaewaswoiftcixncwgwfwfeipspspfytpeafrkyyycffckgntceiytxwasyckcyrwotckxnkgeowysoticiygeegeygyitknsfkngekxeotaateeokkctgstxnnknffigexkgerktewrfpeokaktiesggfogskkfnkitkxixycwwofoyxwfycwcwggnsckaegwpssnkntftoyoiiayyrxgwiyogsreycsptfetwagrosprottipwynyxgcaeiriatpxetwspkkfnipcffyepckonfyrecxeyoxwrnryefitsffargwowkencwaercygxxksrigptppgnfrkeyawpwptrakpretwxxfneirpircpskwergnawkwngxawekitxpgcfntayiwwostgegeercxpykxaftrcxxrrstrtrrwytentrxecyyrcppcctgtwywfateiygreypsysfekytyfygkocwypxykcikttpygsxynfytaxsccogxwfyksfkapfpnnyoroostgfsiprkyipxrxesorrgcnrrcgxxikpkeiatxtrxitnyipkiestpfygrfgrrcyyyanogopyifiakcywwgysgicfowketwepnktwceaorpakgwypgyikinxkgarkipynwiexkteixowpopprpcwxtpiwyrckgikpctstakxnyywnciwxttncpskpowrfpcnafsnkacgtyxyeeetnxyfcwxcpypitgxfsgegsnsgkwifpoyigwsewnckwgteckspreegxgnyirirtitoisyfingkinoeeworxypktoegngwetopksnrkrxoaeptfaskgisrsncwfxwwwncnwieytsssgfponragpcgecxcptpiiryaiyfssfoxyfontxareoctercniaorkrgkfsicawcnftcgpkesackesiagextxysgecetnwrnkoyyyxcceyixntftkxkfyaycgafkreoptwtcosxtywfspkegysoyapirtyxitypnoefnycwfftswrngoxoiyxsxysxfptitcrniciyykwtwepcopgktgsiocawearfcoftcaoifkwsrtkfxiyfwwknixswttkporcenfrfpefscpewnxccoryciowwatcoepkoorspcrasettaegpyxskgkygwxarxxiexfiposxeswegsyiowxatyrcexkpcwttfioikyoyttewrxxfttoraeaakxpkngwassnpcxntswetypawnstoewoscyknrgaapeacrkpiaxtyewgforsreceecawttsiwwrgwektstyckforiapgccwykoeykwstiocexnxetxayeetegwpnsxcxkkfrfsgiropresxrrneoeapwycpgrpwyepiaiogcsycwtxkggigskswrksptxeeerfnatfwyowprpxncsrkoxkrprtpxiryoxfrsktxyeaccrwaawipasxyrperrcagayptaifneorrearcctktetgtxiysacgcrtiyyopokrrfwrisgnxyxcpegwetciknkioeoywewoatfpywpytegstateswtxniisckssygnftkfsnnceakioxkkfsycrkskwappsaxepyywewpserparwgfycaasfppsiwcyxaawopewcfnxrwiasscpwercxaxicefnssatngcwfkkncegsnrexyixroyksfkygnxenwxragcnsxkwpeckaontoakaxsskgapkyppwofgrtesctrasxnrgrkitwrynpowwfsgrgaaypsayfcnfotwnarwsoxiefxokgfyeitgnfsioyknwxncgrwtsaproaetcacrgpkaaocsrypyrcpgspxixgranegoypkkaexgtrwcnesaoacottwifgekcoiwxxcenygasoanxssopsytofrxsaytiegrayexocoisfpwynpptffaxykxgofegccxiwrsfksexpofsoieekxixyaoawxpwgwtsnonoatnftwrcwafpkyrofopxxxaaskcgwtgnxtirspcckpwffkywsyfytinwkxyyykecaprgnrosfayysfgtnfgeiexgkiitxkyinioaxeaaiipwanriokyksikkppfspwwfeyyxecoyspsxccaowncxwxxectpwarstcnwxeiaoirkcxckkkntnsxkoxwocfwpygxgcyaosfroknntxggxfkgxoxtynfnnttefinccokpfwwgfaiarctanffpxaxkkfoirttopawinnynrtsrwcyeaotiksktigonrkwkeeoaefwacfkfpfyspnpyiospgatkccsrtyopkcoyoggptorrecsnwnssgkigcyggiiscecxiaynxpyeytgcxwoogfkearyrgykfkngccngxcwokskesektcffcfrrctspcyrfpafagpfpfktaspikenogkoffksnfkatoatsoxoexcfgrwskyroggiergwirxkgtipgraetascseirekcikiixaywktgpawsrinypagtcfanacwgrcawkceeycyfggrooforepanxnecsewataktnyofoxypyetfxfgsttcygxyenwarkepaonffrxsirsettiwfipkkenppefoeoiosrpeciaenkxsgereayayspeynxfgpesfttkiwninaesrrcafipetynycsrwgxifrfxwtoesnyxetxnraygxwaxyaincpcawxacxocigggsgfakiraxgfawcrifaeffpxggpnoaytyoyxcxeakpgwyiicsapyexorxkxtwgteciiwyweeggyssgtiowtaaepexrxgaytfoekawigcnygxktggssritxtniwocefwcnaaooipsasfgxtyagocyneenectceacrswigcwyeantykitofkfwaypgiiskagocisggpxokkfaysittpgaanffxxpgawcafkrwoynfifyxeyxwwifkktaafwxnwoksewoccgoccitkrcycrnencyixifegycfotrnyxkcapxpokcpnfyaeacfyfynsiopngxknynfewwkikyraoxanfcpexctwaxkpnoipgktkwfftrtgspfyksykngrepxctwnoikxgywrxcwfnknnxyantwynpoycfrffxiwtypifayoaacncaygnksokxxaogcsssixxpsaoowxcnfonnyesyegcpgsgeakyxipickwrnsxnwxtriyrfkceprrafyneaniyynptnsroccceppawatofwecynrkcwkkxxtixckotyfwrggcrcankwaooyfwfksnocyoennnscfagsiecncyspgyttswksnowpagoryngnetcxsffaeyeeynrtaitwprsgyoaptkneyaaxpixxanskyxecgigsetggwgsfakgcrwcrtngawonokkirnxxiaxnppposrktgfcgekpikoaiigxennyssiagcfknxsnxtsxrnksycccixnnppkorxaftxssoxcnrncfeotxgaorogcaryfpswcixyeotrxoanictiocffxttkcpipxexoporgkxeecpctnkoxsgtreifinesnogfyntawpsrksrtgognfgnyignwygssraxsfsycsscgnrtccnroifswiieokkiickaififtwracgaxaegpsfoyipfgkpyyrtrseyincfokywtarnyycwgfneaykoyppstxantsawgicfxexcpxogknfxteogggeywpctpartytggnitxcienxtryiwttaxinttgwwiwynspekoganixkwcsgwafaepefpnprkrskxfcwssnkstwcckkwfttargrfiscfkygcffsfkxgcxtwptttsnanwoatoynrptgkcksokoesaygatwcswptikwtocnsnsorfioskiaktfxiitinifraisooyxwoipsarwognaxrortwwpewrwpwktpgayewifgksrkirnexxinxkckgoskesrcasigrorfwnrexaswfxicnekcrcxeycfywayiywwogwywynsxnopppcnccgisirpfrywitgtgswokocniwwcaecgooccfeitwnpyeexnienkwrwaeetxgggxiaoaroerwiwkxarywrtnegtgkniynxofonrgxkeigesaokoftcswkntiawofoaaicyktcwftcagaaiofapgoncyeafkwospgcntoetnagynfntsysenkoggtkrxrixixnatpcewyxwgsssyotripkysefaatcpfifpnxxekswtskxekwfftaeeifkntestfoictnrpcffstkacaxctxswxceyxftgoinxssggpxnarosypssiisrkeytxkgsrtrfwgiitcwoepxfwppiyycxxxyfgwywyocrexosfcxispxapcpsypekfeekaiggetrxxokinpexrppcfeswkfwenyniewgagpiyyeygrrofypxntrasewfepfxarixyfxfsntcktfaisrwafsnkinenpanopxefcsfginxwsgsftrkxoiawyetaokftxnaswaipreiopxnwgspasksaxwawifctpapnoxprgwkniykffwnntaoygoxxapcprptnagaoiocsypoknxycteosagngpnfcefptnepcwgnenssgeacartrfearxcxokawaiwognranyxkcyfexfkyynstntntxogneeanerxtcyfopnrgiscpinroxysfoixcxgexcoookfkffrokkkrtxgyiaiwefyytgrcwffoigtonyrspckcopwrcsaxpciinggagnrxewpnexkitkrksketxcywpanfeyetgxwsyarikyyiykernkggtefrceikwggntkwxtxaeeeftfayssoceptricnaapfsatcpnrirtkogpkgasntsknckypwnygtkngxckonoieactrfirtecaiakkrkrkaaitixitkgrtnrriytxkorgcfrstecrewxpaxyiogrccgkagfytcwieoewgcfyigpkaeyferfssgpgerotxrsewkcsafwxwwkoteorsfekskkiakwfgcacgpafegxactfiwareaccsxktoroeixnxfofyinfogeectcwgwekcrigrwccncwrgnnfxeccrsywxwrokracagccaifawnatewfpxpytgfnytoncaprfaocsyxfifonwpiskxrcknxwnrxoofrarakigirxapfesnaapxinxesxkpxwxxxeocyxsgoicaoeoxtaeysegirtrnonecgcwccscspppknkfxswcarcpatkiktigtttnextistpnwaxtiwkkcggtgatkisngakfoficnfcksigrgiateepswykxxggxftfnyinsneoxktesrwkwggnntgxwsgnpaaentkeoiscfkgraxwxswianrapoyggostffyooreswgwtwpaioisnfskgkypgtsgcksprpcwgscsgrkakitarcgacifrgxetxtypwfskissxtcoyygxstoaokkeairxefgayyorxxxcoiewtaiwtyrcygrxwkaxkaxwsenwfyefoxwonroogekkfpananceokrkxkagnppcxnfkctxaeitannosrotspgptnpfapsftscfppkifkpwwowetprcnorrxkwcarixfwsxyyoyfatoynsypysaoiowttapgpotkkgerfetyccwiiexesxrxayfknistketikycriironitaccynxaxnrxrwppopcixcsprwkastgpkytoepketieigycxxpraeongwiifxwoxpcgnoniignogaxafyxegptpyscfyfrcfnpsyycronwwtyrgorooyewcreexfsgcoagaxpoitgoytycywaitfwpykgkoyipnxegfkkrnyskageiafynxasegccyafcsfgyoingpyftpygnioppwygsnywntkyypkrkaiyigwnoawwyckyxnxcwpapoxsgygyaotfaotctxtoxorpitkskckokffwcerxnfwypxataxtengxgtipnfnakfowxknwfwperriywioarofygfoacoakraosxgxtygpsfgytgrwocefwsrisoksogwcxsrooatforksgcytgigkkoctsytongrignogyoforyarpiiiioxstspxxfroesogycxefnsnaferrysorpaexgcrkkappoktxptegsfariwwnyckfpsstgpafnywtsgycafiaksfoiaeainxckxnnrccfkkgtiftpieppngcsfspkexaeepiwkrsofitoicfiopawxtoeaxfoiitottiaofacywnasaiipprytkrwrpykxtffionactyxptggnyapocitaynwfwwcwfgcsttsakpacgfgpykekcfkrowaspwnfsygaoffiywkoggceynyepfsrexoaxaryfgsfttncpratworcycatpixctpggrircsgkipnneffxyxxakykiiertxkyikytipfxkgwigrxicckkceyiytfcnccxpntiwotepesiwooenaocyfaxwctrwrtoeicccwgacyanewfpexcwpsceygxicpntaeyycowpxpxsfoxrerftyreyiinfayercwiywpntxefeaoriigwxexgnaipetsxfnkfckcapfoesraiswtyccpiryfgggxpkcxpksyrctxokawcspfpntrnkeykpokifygowtfgepcngecwipotyfcpwprcyoiercoxkrwyxrfwfcsrrxsnpnytxifgoirxtorwcfxpgafwitskonwrkneypiryfxisnfsiypigircgpfcfcgtkgfteypyfafnoxergxseyyowgakxcgirpiswixcfxagyixintcrisgsosoicxesnioafooxgeeewfowetiiykfectfcrtrgcpxaatwxgyktcawptissxewwogapppserkkxfasgfftesxtpfigyixatwiawyooicrantggwyaggtwkwpxyxcrxycwexskxsknttspnsriyffspkxywrgnknfxiswiykpwrxcwgtfetxcrnfaotetgpffotgkgrisrstwetfrotigpygcrxktcifcpgpgfyosaxnyowwaiwoxocragekcxtoxfyrpexapxfwowpsfscoxoxfxkpfttwapitogeotkgsanfaxirnggoicpactxrpweasekettaegytpaikaytcokffftckoxypetowerapparnyscgyragocrswpfikxgywassefpcoyeoiaackkcwongcapapioxfakrafiikyykatygtiixtpkfktrrgfwtitxirgekrxekxfptiwnnercnpyxcifsxiyotsipttkneertpwtrtwtixrsgfwegggsiyeksitkxswerpfgaxywfrpyterenycygyyonfrxnaxpfxniotoytrnsnwxcixttisertinyfcicinpwekkcyxfaggoctciaogttwsencxereipxytsfwkwwfnpexpwwxotxnksocoiepkonxykkgfiegnyerifekpectifcgwysrtioyxnokgtyoftfcinaakxgsoofpyygkkaeepysepaixsygcppiwycngytwyxiwsgrfoawyoegekapktcrfsirrnsxxpoeksnewygcepaipaaoncxpptkpxirypgygakxoapgskgegnwwxpcykoygyewxxseewrrptrkatrpoewtkrsrgcxiyrkynskeewgpoywgoexoextwtwwxxswtitstfkpgweyetyoiwyfecpfaxiatsfgkogyegygpixpigxsoxfoigcfksgfiwpgenfgfpnnypagfatkwstwgsorwkpkngxscenpxewfopoaranrigtetnwrotipgxascreygacnfknstickyrenxkcegykwswcfgwgggegfcysnpxprstxwsreeexxcwaagpwsrwogocgkfysynprcfeeesfptionxtcrpaeefgfioyatgtpgrrgyatkaapxepwsewnacapnfyssekptspayytitgsxxefkknnwpftkwwwoatnxcxxnignkfgtfpksoiongtrktkfciarnspwrxiwaawafowxeciixspkxpciseptgceosiysncppawtskfoysfaigyxfsawfayxagwgwtsowgfitpwwgxsepoxxxewtxritgegfeaxoxxopcragknexcsgyiysgwegtgkttweostxykrrrwinsgwtffpernapsyaciysesaigixnnwpywfixsrrotogoxrfpewwxakoscsapfonkptyfopegtnsfccsxrkgiwpcwgewywtnptigtgawtekwgeagynynaniwswpfpknpogxfpxaraxioocoytsofyapsitcgotsxgfnwskopcagxcyowkiepfoisteoyrcnitoccaworxpgywsawtitrswpxyxaicitxagsyreaxnogpyicyxtkinckfxaogwkopaiinpgcgtwgxgxrgwpasnfsrrocxtkwntwypskrtxpiwwissntrrtgofcnpeafrnisrkeisntskksrggxiigiewyitecoaapraiwwfigkekrwwiycgaoeyrwinspgrwxssaxtykftcongyywcrtkgraweogtiffgptspapagyipyxxcttknypfxysaxpppcwffnyocenwasewtsxgpfefsigyxoceyoopafygowwpcwxapxfocyyccfsceeeyekksgypgwaiaoyiofpppaskgirgxttxcgwipxsxoaryfkekftteiioornpyowngngtngxotcextfpgcffnwxaggioawxgeicefssgiixcpryfnnnorrfecrgnatacwyyxfexceoaywsogrkatkriryrogoyxgogcpsrxgykitpxtrxatwrteotgayofpxgfoesirwwxykwgwneiwwkattrpsparaxawfpffetsawyptrrkfetskenootacefgtaexgekeptykxkffrttonxinkeanpwfaoxkewgkxoekssepfxypftpfxiipsssxfikxgxnfakfcxaasoftstrkxtgfkwgrkscppgnxtpixaaxcpgogcfykiyfsnxitssxirepkcngffafgfkwispwnppewtwyasattxyfcftgerxcpryfcrwfsopcrkscnotpwnrixcnftksncwxoowyccgyccgktycwnpgfywspfakikrtfxogyopttcekaxrkkixirexccfxsxtknxgfywkgcyewtopnnggxsawegxgnfksiyysoyrwccoefnytnipeoggaoefgpasfienenfiwaxnffkfnoyfcweksawwikcyeoeipcsxgcnwgwpkstigasikyrixkwkcrwypagnkggwoicanneotygsisnoioyacrgngneottrxrnytksrkpynkeykoersxyewtiyswatetfootgnicwyiiwsngiscatepwtnwkeitkcrsaateonytokartyxcknsnspyrfeipwkwpproctoyxyxwacyasaatngtocicxoycyaiewetxarsgeocifayoirrkaesxapxeeekpsknsccsoyexckyewkytkpxirptprixsxataxecyriyogporcakrtefffsecoogicxggoftosfwwwtsigeyiptfksipgttieegxinicirpxytapigtrtskxwcnfgkaageesewncknncwegcpfyoygaeoieaangisyprspprsfxnnwofcapoxgrcnogxpwogisosatsxgtwxxytaxstrrpgrsoyyxstxgkyxegxteggoanckygnyeiywenfexxcenxxgafaigrfgykkngtsiknrsyixntnkaxiktrognrysfsrsewenxkyieyaeyintoprkkcgngicsfeiaorksrexcgfrxpswcrpxxefirsfefkknkotpnnsetcteeitrnnwyxcewxwkcftkxteepsnawonpoyfstwxiykcxseoxytfetekwoopeyioswfgiifacwngianxprwwsaogsiwwykcfaaaktgrseparprsxpgkpyrywxcrfpgxorcisxpacngecpsapwtnnarkaisytyosooaffxincawssieiwifcnxcwwafwnceocswptpnyswgwnwystcnfrnxggapfgafiicpnocykaypnkefaierwywctkgwcgspfgtfwkgwxyiwpkfwkpnsykyrgetaoiekctssskickoyygpawtkasrywrtoockpipyyyeepctxsxynxrfexxowsoaipoawaifxtkncxrwnpawekyapaagopytwfwxtocftferoiyiacnriycfawkyspeykokpgfppsiesoxaepfegcsytnfannscnyngffawisanrapwkeyexgprsxgxxsatkpcissyxnrkyoannaskiiapcckycenngseisetararntgonwaikwritfwxioksaontfingggyrcwxopynycrxccfykgfnosooksfrirpgrkencxwgrnrakoxnxxfnwpiacwksxeraritxeiongkycfckknekgrpxysrwrywoesxrfsxyayaoyowrsacxcysffkcooorertetkwpeargitksrkppsswagxcengrppowyeonnciiekntsknetsgfkcywwrxgrstynwnpkwccstcrwyytpascyskofenkwrnartifoigtxkoaegwicpanrcfgfxwafioekyeiwptosgxypicyekfkofncwyefstyiwktafpsiekekefsrxoiwnecwefixiawnxeiftkacgwgiwttggwitpwcratnceaarpetxnysxaoitsefyinffwgnkppnwatrwykceggwskngssiaryiyfgnggwrgacgsaxxixgiiokrcfwffkgorswkncractipcfoskekffkcetfcxwcfyfsneayersarrxnwtkxrwngixktoiwwwrrfirawgogwencsscieafeegxxtaofpapyggyisarsetarygrcypieaxfgitnykxtfwkycpkaayokrgnotgfgpxcsokpfeekgixrtfonsfgknyogricaynwyosyossypainaitnericniswtatnakrtnpscryrtiafporrknwinraxfwreicpgspyrsxayptiaeftyikifiykkoppksipgskoowitsnwwsiapsiacasnpixasopsirswkfnwitiprgyyftigcrpaorgafoyfwnsxowrorifxtseargieifatgirsxkxxcrspyigitfcxcctgteisxsysskaawfiseftyrtoiroaosiarskkwraksyxnycxgryetyoafkfeywpnsekanrtgkxytxppntsoowptfkrrgxssnytwcoeckwfsaitkysxwfywfgeatswgekrpcopfrkwrgswrkifgykatyfkpspwntfyoaisyogigptifspgtwxegycffkttisxsptowirckyrftigstnntgnfwnawkwtynawieyiatxwnaieetwfwckisngyanwxkytepeeysiywcfwpfrkeatptoypaawwreierroggrwpanwkrpnnfyxtxpkkgtrxcepygngnfweripwykffckriyrxstrgwycktgcanrtgkgtnfosetetcfeanxrepnctxteykaxyapkicaesggtfiniciyatpkecssoanycwypaaofsksryxicptnyxpktgctonfiiiigoexstirkxprcewcwtioyokrcgwpaapntiwxssypkctoppcaopfpispxswtakexgoaaakarepcnpxkkrkfrtnfstpifrprerppsixtiicartypsxpsreiexissfkopnsxcxsexafwxkcteataecryncncarifxtnnnrgeksrwpppieigtncgifggserksoetisxayiktefifsosnsspaogosrfeoyrntnxrwopepssrywiafytpynttwwefxycwkwxywwgxyockwsnkrnteyeraogasisygrnwsyxkrapksxkawtgrffrygxastyffroksaftwnsypoatyfniktowppxyiisowccokwpksfaprwiygrwpcwywrxpfwnppwngyafetyaanpswxacwfrnppcfwtgapkgycsocwxpwppkakreonacpieyotooetackorxnrwrswaexecratekfgkexipstckgxrxeirnaptstiaioosorigntgpxtyoowkkkistywngrgfaiwagetynitrkntpckwxtekryecinwsrfenonatetxeaxgrtwafkwfickcrfgiaporoaifrwggynakinsnyynofaxwrescfayyapwrncwkewwtassreotcxnpiacwcgyoaweyietpgsgfkokwprctxonkrtaoifnfxcssgsanxrtgiyreipriaayirxaxxcncnsieoetoiafyofkpwxgpinynnnyyswycwsyeaoarotsiynsecrxnytorakyptoagyepwtswynxfgronxctoyxyoaisyxcapoxyfftwekfktxpotswfecaaconnawsnryoexecxyyrigewkpskewxnyefipckotfoysotrtgsxrwcieywskoiewtaycersygfesfanpepxikpcttetcfkcpwyiyfnccxceayypgnpskateieorexeifnaofgytaacwtrnxxisgxppktacgprnwtrfnxkerxrfiykroitaptfcycntrkknpegpeyoxwswnpnenksrnrawewgirtrecpnncpkriiiowrkxxpycanrnxxktpsgxkxreswgwkaxskkssaycascseggkssigsgktiotoycaikcykotrenpnewixgfatrowftakocengrpxgoiercnppyoytaekanicirgncekkwxixkaeewxysoefgxsryyrfxrkasiopapapafxywipyyetyfigrpsfakgagakiwiraigwewccfnkptswasfnffxoepaofocfyxrrfwsacsoxtenayafknotggaiewcitprnfkwpriccrtxfxfgtoogsrsiexecpykitwgiowxienncakskwtgkpskpntgkxtoxpryenssosnyrtpnknewyokiriweefgxixrkikftotogpringorfwnsorratioipstsryikcoktgxntsceigensaooifwxcnyeypyiesiofcriwgtgeexkgsixwktforcaiiigppafsrtepciyctykosawnicpoccnwwegrsrikygaxetceenkkaogfataftykoeiiiceafaeyxoetkiinyoafcoxkottwiexistpffxnwockytfpociirctiwnantgywksswxgoctwyorgxfoxkppgtfgcocfipfnixaeoxfsseoxxkgrksscponsggofoxyopkcxxcrsgonrspssniscaaeeeixsxacrocaenyornfgxrpowffpprifrsreskwptacxxcrsrieyrsisypikpikrewfggconxfirfxckrtipyywicpscefgnrraigwxtacxgywikrxwatgeiffkrffwrfcefwtcneortixiwsrokcteskogetkfgseoaywypirsfeecptcorxkyopnnnxsiggxetoasaokconoptwctwgfprtaysnefrxfairkexswrsiawkxtiwecxfygrxpsxnngfwgxkeywotsrxiacetoeaefcrxfkircxrfkoitfortrnssecfpkixonpxwkgofseincgewnwarakgngroiwsofsskragneicgrfergstrkynrrkxcxteyiyofifkfnyrorxfycakpakrseptykftexgxgxyssfrwarekaggrtoiapctictepctpypkecyiistnwswwpofywofkynncrntcxsetxrywaftecfkwyaxgwereegefroftfaaaektttictwwtfgfxoixtfksagesnwpacfxfgancpgcpxaryepiwsspwffeangyrnfefrsfnnrxnteakrpxxnpxoscsnfeixeeyiswaooyeokskoknxcxxexkttctkstaagpogtfxeyrwrwfngnkeokxkkiwcaeifscyeeponfiyaygptxpxepsprxkseaporikookkoieenysspinenxaaweiasynaiiwgfsafeoyoarwegfxggkxktyrexogowifrapcakxskteipogfxescsiyttfxnyxpnoagnxgpitrkfcnrnaetscpgxxracnrcryesgttowsrkopagpsipsnkxwpfxayawswkxorytgcweecffpxrfexxsstypkocxrgtxcptfpaesfrcinpeoxgawknwaeaseofgrcofytopasfptgtsrcswfcrwfipasfsyenkiywnecotsnyonorefwpkyeweapwstkfkcgwyxxtinnotifppgsargwttprkfsnkintrysokyxsyokrycyxiksiciwatfwgxinpknsxkoxeitowspiiorgpwysrcsawwicrcoxaweryoowtwcgapnapypfogtkeeikapaexrwyyrwgnipxaptwkkgisiiygxkipacppwnxgsrwygeegnpwyiyeegkpcakxniseakeowpapfpsctfxygpppweyksonepotwfkwtrkwnfggpowtgigirtxciekoayrksesosscfnaiwtokerfiakaoskgrrorposxngfcscpownpwwaftttsncwpfitrpnewkraksenxwscckekxeposfnoyxkxktggcretfpokixysefiitiwgigtrnkwawfxynrcorstwxtpixinttfnaroyicpsexyneankgtextpiragrnswxnwpccoxpyipyxwsaccowyfnscrigieeiwrcxcgtipoyffcpifxxtxfnxxiyfceoorniyynwwpsysnwokssxasrptccgitrcowgeisfceyypopcrgpppnkrwnstftirtfkeryiokftewppwxxwnwfafgxsowntepskatwxgxayksxncggoiwfofwccgakcfoasxoyipoporgnfxwkpfkoxtoawcxpitrantxirkgyoynixfniaepaewitawkcnwxwpsyaxsfawggnnagawanwikigprpwnkgkerryyofypptwxkgnayyxiokooniwiotscpyfyxkptxxnggirryegiespwgteeenwioyrwtsygfrkorprrxxxegcipewswggrcookrefefpaproykcxiswxpxsapokxfgeotkiawcoyaarxnxwxkxncgffxxpwcgsrorrxnpwfisspweeaxcgytcictxxftowooffikngitasigyfpynykycfksoonyxttpkarwnoteyxafxaoanxrrewcrwkprknkrecxwrorppnrsypxcccwwkfepsorxcxnsrkagygyawfcsfxreioxptipogyorwexwsyagkwposgnfoatfggxwignonpixtcsxnwytaerafosfaxgitgsryyroioarwxxawyswsfcoicwssoenaonxtkiottryckoewkkkpaxaeyxtnxnpwacsspioxfctkroinaynrrcopatikcetgwpawptpryncxsxntynatascrkpknagykxawaiopcysxoosrsewccesrkaiarsseefifkwtscfxgicwwgpcsoacftyxeafpiptocxeitttxcfnkcoifwcsxwtcktokwpprpnoeiwcowogpigiifntcckkotxekntgtpiiyrycprknnsowpeprgrarfaoxeoapentgpkcrxkwwcktycygrgpspffstsyiowfrixpgxoysinoctwrntyxiekgkwytpesweoacktknfxrcifxfecnraixfpaayxkxkcxxapiowespyrffskostsfraikwpfgitokoitnxerpggaywccatgksssownootccoaxcagogprtyigriitofcwyigntxxyaiatcefsniewaasgtocpcowpowpfxsgsgkcsarnwrgeeanaxepkpkfpyifictwrfwkptsosocesptinetnesngiakorenkagpgryfwyxwxsfgpwasinyisestsngwikyrcfgkngxtniypfgpxaikypxakttrarwiysgtkoppaakwrfstirrxiwsagsrcykgiogxieyxwpkawnrepaeopnnprkoyrsosaisaeswftiscacnpcyoxkkokxwgwkeafgnaraaapikwsinrcefttkcxgtoxggkxsfwgtccrypsyxtpgpxsyeoosegnnegkfftnknfxrikgxoinfcgoactsyanrwpnfwsyikponcsxetsccppioyoesoxgeeotsxgwoggawweafokyoieawwnrkowsxiyfaktiycopyapwperysosgkoxixxtwxkytcfinrtfiwpaffriesaggfexefrspekkoynyfpinfnpngecpkkywwiskcfwsysfkiocorwtfgxxyyikiwxincsckfairyoyyixcesienkcrkitprkeacyikykpgrppryoaotkcigsatxgnrkeeesnfpytyrsxxeotyikseopetgnxkrsyyripiroiaiswoppfpocrkoktffyerooynoaktppyxntkkxetacsgyksnnoocegxcttswnnftoywrocgnfcnotfpiofcpxxskxnkxnfisxwxoxfwifnenxxyiggstynctsoerrwytccyapfyixfwyfownwtgpgxyiiywyekcyatcencrnkipewyfterxcwfkcstpyxtsiswfxswtsrwiyticffxoerkgxwaipxcxwegiienncstckxpotaoexsosxtrexfipnkeokxarrncxoitnnrpwgcorykrxwtktgikrcwniiawsgatyiaaoiskegwcskpknfeawnctpfixorysxiewfypecrcwoprgsgracnragenkireokncaxgtwpfaakkyannxkgckeogigfirfkssrrfekpxtpfxprstyfoinegoxoarkwxeerkwwwesgpcanfogtktftapxifxpkiysiaeaweeroxytrrtxkyatktknngwersokitxxakstprxeayprsygyfnsekssifypfcyskootaittfsfxpwiptiaoyaorfaeefpoopgokkxisxrgtpscxgsowxospscfgiwniigknxggsfwgctiffkkwsysioxkewpwtetofcpiprfifyctspegccfsiorayyyroawcxfkfgrtcykpyryonfypktncxsrofrwpxnxiwipacrgfxygoxfkcyooeagteoetxyyakfwrxifsyprsfreitfsowntnyparxigsrksrnwrrwctcopxtpggofcfryniooyoxaiysrrycwifonwpsoafpfankacanwwrroaptnsfaaicycifeprprwfrpgncksyswfnrwxaioickkicrewyiscssirrokgippyrcxyriotrawfearecnwakspfokinakwxrxasogakxcisngrryyypkoiwfriiycrykcecraacyowwakfipxctrgrrsgitesxfxsgcaspywiirwngcyefpfxnpxgkxresofskssgrakpxcyiwaewiaaktsxskrioaagcpaptfeteneifxccyoeawpxrnncitxrcxtyweinxeaxyxngtksxkeygesocryfnrayogkxxwppgwnprfgyiyittkgpteyciypetyoanniegayfenoeiwkekngscyxnkcokpyorexotxniitnekaykcfgpwcaskryxrcfnwacckeepaoffriignewkyrintyprxfsgoaaaacctfnsrxgyakffocxxasnaseaoysetisriwxnanfxxrwkgcgttoecfgnnppkngciwwtcrcrnecftteynixxeweetoxapxofaspptaxgtaopggtgrngfpswncfnkinossfpgannfeofygxfawgykptgekoirpeirnixxtcwpnsfetrkccsxkcyoftokwiyxyfcnkawykwonftpipiwckcgoreewxpyfryngtwswofyyfiranpoofrsgooknwkcgssoicetncpatciwntwxfysiwtygirsieenfsgxyxaastxyeskexfogcekiwoiotsagogiggcinccoarsnkpnciyfktayyxgcgcofgcsacxcrcpgnxswynyyawfwrnsygxxeiengsfitoosaytctttcerrsirwcweytktwiafstapwixgykitysnywekxcytwipgknsxnpgyycoyiptpcawxcnrekgkxgentkarxnxtopfecepeksyonakeoeigeokiypkacfoisofintapxowsfrtspfgsonygtasyktrwpscaxctyarpkccofgnesafyfftxnwcckccxfnfykwafpcgstpaxessieitykkexyfwpyfeowfrsigfgioxneoyccccyxeyeoytefctoigpepoyeycyarnaganptxyptekapyefwtysniykopiikrpwtankokyywsnoyfgkpgierporfefysetksacnfnecfiegfapistgwskgsiwswxfescakwsykyaangigaaggxwsscnwnwaytswtcikeawrfrnpicroewecpocasernxwirxcxgnrkctiaegnitnkcpiwfiywcetkeikeekrscgtagyagfteypiysokroecoocsggawtiyfesfasrfpfotiocygsfxieeewpiontnyyxnskioicserryynweyftsgktfnrkrccnafxatxrkptcfgiffysfocysngpkpkgisoysxewcnwkfangakfnxpkcfysswaaxtsnseakgrinaxepsagwfewrtwepwxtpcgotngnpfiyosinpreywacksyrewaptawycogaeprfiyiicnckkgwrfsspxnfyaiawkpckcorfntcaafctparwgpyrknkyopttncykiieiiytgexpipfnrriswswrpisaxiytctaepapngpnpagtiegyyetrwwksteyfrkorranpfwgxcwttfgeosrpwcsspcoixoioerpryycffetcccagyagekkggkwcnykxwofgpstxnnsxcwyksgwaokrneaetkkieitgcixonxptexaxnioeyrtyggpapcffyeyxcwniprpionowegpyyoogtrcioonengayfckeksonatntnopieerpxgkfptaerpypnesatygcsxtsnyofopexrfrpwsackftswxnwxoyfotnsasgpyscgaktnfnncwcoiknpspiownkosgsyoprkrawtwtyfcxfcoawcpykaaptasfyoxikcasostkgkcpprfxxynxsistxxtsoywfwfnaonffgyeygakwtgkpipxewetxiggfcrwyteeecxfyfgcxkyiwfsprotwskogkcogpgtrfrggpknietagtitwiywxesrssxwtwafrnaaiwwoaoxnfgtrpcfgafirseknfscpetcektpogcwifonnwafccyepgtsosfkwegyroipicsopfikepcyifigigntyfiyyrypprowcioyffwptxinxiisawiptsetassawwiisenfffxafsrsxoyirxkfafpxygreoywefnpergstpaetgrggcnopptrftiscrexfritxnictwwtpcwfnnowspikxnyxtciroyrekrkeaafpefatxsegpaxttacggyoceeorsfntpacootgarwgwgtotxostnftcyfxitfpeiynortowrwxpsyckixwknwytcftcporcktitocsixtakxosraenefxfcncfaeiwstotcewaokpskwnkpairctioaewecnnyxiespoyggfgxoptaefkicaetranpgpacwfpefsnpsfxpwaosisiogcicxfaornxgiiacyrixtoiwggrkfnegrxyktsnaecgnosgpwirfnesowiecsowocoxsgktytnysginpxwiotyytocctwtngswicnkynorcxtgnccckxtceoirkopiyonycngraonpoewnnckcwgknfwiycgyekgiwfwseaaogkkpxgrwwsrrcernceaagrpkotftxxcstssxrasnkyaoayysxpwspwkpxspoysrayiyyrrgfrpncfrteonrafxsxccawgisoykgpxeicsrxgrgcrxskacwpiatnwwxietwpxkoycpaicityiaigrgsyxtxyorinxgsxtewcgewtpieifykcxrkwrfkkttsctpxgkfaspoagronferwytiafongxsexfwrorpocwarrtkappgcrwggpcpnpkgtaxynoancaoropgwwroogwsnnyosggxnraaiaykxyxrifytwwpyxgkpgygnatiniwxttkswcarkfpsioenxkykossnxnctywgsykoxgwkgpftxxwsfkcotnwsoxaepoyykrcknsgctiktnntowixtokpyoitawesyyxycnegyforniairiwwtskyokippnseekrantraeoicysrpaswypfkyiexryoifrtyeroeipsprfkgnrakfeekpktxtexyxkasnprrigtkkfoxyofkoookxsgnaaspfneaxifexgtrfaapesgycpfkwisonsxgfsewowcsfnrofoxfxcgcsninkfacacnytgcefckfcykwkwexitcrocworiffsinracwaccctrsasrywpktwtnnspositpgwiyfokcwfkttpactxieynkorasakixpapanpeggkryrcaypkiannaotprteifpsnstreprosopcriiitetnfnecgsxxoysytgoncypyttffnogexkoefsipsfaiypkkteiyffyopnxxorrewaikoyafyafksepxpncarkxffnoixrpgoacicafaygkcspgpcfxtikkcpxfioocoynxxxaxysxpnyxonngsegiicssxakgaxefscyxeafxtnnefkotoenewfrxpgpyonckpxirxfogycggnokrkwywwngoigyooewykkxgeoocfigggtaxfesnixsocwrycyiygotwyaignfreoekpccsyknyxwcricxpifgygfrywstfyisoraryiyexrpxworaracsipakgwayaprkncxxopayrwknirsgnfasawkikfgteenfexwsitpyekfpcrirasxkyxfigypgorwepetfkwsckiakcpkeirxsexpoycxkfyrftsskttiikrwtkiawkywsrwnxipgecfantsseipnsfksxxaergrwgkpwioorogiywoespficgtoppspwpxswokgsynwaosiikaxsrixfycanytcysgfwnrweseokfnggagcsktnxtfxixekrxncwyfgcprrtokaswirsskwcsafgptrwgkixeypopxefnrsrteptsicwwrxewrtptcyyyawntxarceiewsywiogaaayettwtnoaakkyycrgciytccasypaitkfkcgesofsncnyyyofxpfyepnewaotiayegaowotesgffwxneoyasgkryaiecsetpwoaitfpfnoipyroxpkowwoeprgggaxckgeawywwnycnpiiatkfcrspfiaokcooxinecxngrtgcpgayctanpctotgfgppicfnnpcsfrygintoykrxiaeeeiwieisrknarfkecexwyegynettfnasxtakowtxkstkaspfencesskeapakrknggrpoxgrewgyfoyeityearayiggenfafwgwcekoxiweapfaeketakseypcgeeynknxgngaoppogaoywoocwxixagwpocgtrycfysytgpwwrxxxkgrsepsfsactcxytrxscxxestacwgrwytktxtfrscekowpeyigkreywscwkkfggewyywprcigrryxfwfwyaxrxaxeasrkwgosxeiscccfoyafrarccsskssgyraowgsakfioeioyxwgstatfcrnfknysoriappsrtxogtooakorariaxxoeisasixarfotfkyattspafppyatntsnwxcgoycataatxfixnawxocopaireoastorocytyxxkngwtkpkgpiipykxsxtnwwwpkoefcaontocswparoxacrpxeewrgecsaefokxfykfgcokxgiwyasfiftoiwyyogxypenfoetrpkenkgiepgfifgwyogpiasetoakaycncpyscaatnxtpxfcfkiaceswtpeegkptpogweetprttpxaksaxwynopswnkpygggcaoxotrwwekrcrsafixftnokggggpreoynngsysxnnpyeweewwrsxwrwcewfepfogyaywpxsnwnocntctkcnytxcgcykoaigyogwwtfixgxiyrnsexcoxfgawytxwyrwaacasnrsrrcnsiieyntwtettwxgpakcenppnorgwwcwwipiicyckopngfwircirfiesefkyskognwgogrpafepgoytcxcwkaosnctrxikagkgotapepgrcfpesnkywgreixifkxtsnaopgfnxtwracikrsnfsigafyywpraynyiytotspksgippypsegikkepprpwnixpniswiotsafforygyskrwyrakfypystpeyxrwrkofrkipfnkrtifgacspwyxypkcaofxsniccietpgcgttycppreeoonxxciicckntokiapnkxxxgweftrkiefwgrsyiarrecrtnasrkeywgeyarxgfgoxsikcyeefwerafickkrtpxnnaogxkfagrfsyyerpwrncxtyoeteiseicerftaiokkkikkkynncakgnikxsxtknaegnkofptyefftgwcscfwpfgnprkxcpyorkwxfwawwxskaskxksyysrgifkregfrsnoxpsaopesttfrcokkiispkaffpsinksssrpetfexnonfcyxwciyparnraeoieinixywoycnygxkecyartawkaarkwirfkkaicykssapnexrypcxxniyaoprpreyyepgtipewyekiypcspipnfgkpogkeorprkxiopwfwskapwxwgctanxwcaacxektneekesttosatkgswxteifwscakcaeogoppnasgcgcotipipkeerafpnygpreegfyaxgtcginyecantorskswxtfnssskykcysepsfrricsywepnnopiwkiapnsgtoxarrgksckytnfgtpwkaprkyrgwkorkiwwyywftxsogxcoexwkiexpafspswtkayyeyygergeapratoctngxokepoioxicetwwxpaxasiyyafxknowgiketecnkpertsnxxtapyiggicrxwaapgkotywkygyfeywwkxsieicyyssiwsritgexgrrnwfypnraygyfwpgykceaireniiinprwpiecpeswkxoykrxtarppapiekegknoyosywawawoxpeafsesernapcxpnsrncsctxixytextpafcragfnnsnwwipsckoieeoinixiptoigrfsrgfxyixsxscceorgxetwkfxogptggngnofsogkkffycpaaswxyoncnxifgoiaskwrysgiwxktcrfrywaestgocxwkxwpogowargeerkeperycgawsipftcxywkrywgsorgietxypscfxfyeinxxisoyspsykwrxtpsxgennscxiyeaikogtoniacpatcrnastcypgnakspxfwnofwpcxaoceweewgrgggipaexptpeaoiispntykgcewkfatpenoynspwrfttrraopypgwicicgeeckwseskyniigwwkeatrogfgkwfwenkcfygapnywfkoenknsxinkggnptsrtsfosprsifffasfeekicpwnpiwsspnnpwairyegrwrintoxiiessecogicoyekcacexwwatcntwtfooappkkkonnpesgkorykawyieeafsscgxygaxocfggfxyipgacnxreeookocnakyniapxctsianipixtskkocwkifpoexssggrfgryowppfyxsgyspygfyptcraietcgktacfgfpecnsanrtysyfenwwgparefnxtwgcoyyayofpxrafnrngwicptkpcxcwektcfrasactorpekgfponipkynersnifcipknnooskyiwacwagictpgryntfnsyrpogfxciicaareenfipyfgpgypsggitactyxonnpeaxyopeerkeotxitgxfrxkrkoprkkcpfyrcwxfwgeayyxrwprwyyaoffycrttyogtxnptxitpgciooewykaerwpknfwcrxfsrtefetorcfnorpfkipiftgsayxkfaarooicsawpyptcritaksnxenxpaniegygwsknicnyircaarocpwcytarpgiyiegkrwgigtkkgxsrweofoypocxtinreoancifpgftopwseefipikectywgkonxgciawwwcreworwggatngaewyikgxxgrwwrgwntrikeptriacfifgpitriwitioxotgwyygpkpcyioixswxrnactariayrgiacwciiiseecyegwxcxosykkyfkwikwoygtnyyrwysccrfxwafgeksreffoiicxirgxcnwwxickcxokkgcctsttnrxcwycxrocktraxnweccwewnstgnsctggkykfgtnnrgkkkxonafenaeagfweipspyrgxctotryocwcscgrsfreieakwwpnonwryorperxaftxcnffcpgoontwifonofwwkccwpsaiwgorgcwgfxkafnxwcygyxtsayorrxexxnsfatryoeoneeioypcyeogcggkgcnngpwpyaocpwwppyicrfwrsykpasirxfgsfkytsroktigctittirwoonowngfipyitpkxkoxwpnaoxxkogofrwgoyakatifistpopkiwkrrtoeceosfxfpcgrawwetxiiratawckfrksgtgntcnsorxrpytwgppafnaefpypgoptttnnggfrpesrttgyfwiikcnsettkrgiycfrcckktnapigogfxkagwrokxkrxfypgeyxiekfacgnracwriktwocafkioacnktyeegngnknyipapwfotocnncersktgxskotktacgypafeiykxnpgyrrpgsngfrfnewssyxspronckwfnsfscnetsoopffinwcycywygknfgagrkassgxpxtgxccexgprewwggkttkroytsnewyfskxsknkacfnpaioyrkacpowexxcktcyoowfnycniafynxrxnyeyiyswexrrfxntgkxseexiaawsfgcckiocnxcpoxcoyoaikgpostwycacsxesasspongrcgxerpssrxeyrfyykpayynpnskcfgkfginxxcciottayyopeonanoxoifonoffrckayfsnonpcypptwonscrggyknaxonxpafayfrtgpftxwnxoaekeninyonxicyncctiawxxnwrwwtpysspkfxspkwfetitxaicceciafftgtiaxnnwwgygpkgttgftgosfffacynssetorrsktrkseoxxcwsscopfcsipctfkkksipkoooxocgiyregfxrrcwsrntiooewaswtytscnrcranoyctrosepcyppweicaatygnpcinttipoopigcprsogrtcrsrfantsatxpkxyagaerxywfyntpfsyfscnktgwcactffreynkfycykxpekwxeeyakwtgnxegfcytwioxrwkyiygotneiaiippsgpaawtgyxekptrtyypcogrfcrpgoinrcypacepfiyfitrptpsagexcpggpytapryskkfcragecraewssofwtftxxaiyaiyoiryeisysrntkggkokoftkcsacywkgipggsigoypipyeopaefpsxecryctaefpxoxsynwrwkwapiawnfwgykwtxnayffkxesnsgitwiofaigxeoognkryksfwsoaafaexetycaoynnfyfnfcrfyroeffpxypaooxfekitfiprngnxwoyynrnkwioerpykxswkreoxntosynryeoccfnaspccryicefocorcnkswsratrnoeneonikioxcsfyipypofeegypenofngxkccgpkncoyiagpwaakkgipofyxfpwyoiiaxpwgywfiownatktkewrwfoywwepgeswepkgxtrpypetfewestxewgwpcignifeapftwganowoyfewgeiiotpsexpswoeprwisroksgeykiwwystetpoeonwkayrtkcigcyiisekkefoinfagegkktwknfpyeppnokxgyeagctpkpisyriknnieptgtkgfafaogkkyxwagonprfognarikpnifkaefpptpfrretyfrypkistenfyxtyyecpstocpwprapsrtsyxxxkfpikxkgpkcgwgpfirgekppispgneiifwtcteeakstwrnopknfpseafwcoinfgxgsifnwwtgifggyftiatootaaewncsftrexxykkcrxgsifknccyicrgoaeanngctosookrwwripeaksfnpgyiyrocypknawgocpenefcwoiritxocwypfpyciookeenirfytexnxcnneioygtwcfsoecswwkknaxyetknxpfpfasynyprppwxrfrfyonickyitycnfpaerxffswkrenorcfswwroyxsoxfosctoiwxftcfpttnsfctairnepeayprkokipifsxxirygpaokxfstkpwaranafnkxefsaossaxwatynknpxynaraisocaincrwtapkxgnorgfwaaxignyfxyawraxypptpxrcwepiecwogsktcgfkwfraynfrewwiisoksprptfsteooywxfsascocwsiwgxgcfsreengkytwpokppeoxskgigxkwawrpxgcwcxcgcieworcpkcayxegpkrkgsofgratwosnstitsaxoafrwypcafpyrrxioiokstosponaroygswawywwepftyfwrgrwikypawnteitenwsyxrgppiwrapyyxknsecniaceixgfsnonpsexgwsxkgwayrrcaakexoopirwxeaiyopgttpespotiwycnrxifkpctskcwoagfxnaxfxtgftgyrtprstxntettoeycspkgrknipsoreanticgoeseaafpnrynpwrratgnatantoiixxxcfyrawftpyfspiwfapgfeyxxorgrtgifarfpoxgwsgepkitipyfeoexfsgkyxxrcexworffnygokwpoyfaoenrtcasyirwxniwwonwapicffxefcaxfccionnxwraaaispfnwstgxricpytsyogciifkcweacnatgcynxwkkpywyyagxcxtcfrtwwowkseyrxkeorfxckasxykrpgcresefssaywaetcsksoyxggixatpywtryxexypftfngakncrfspywpynosswwanerpfsatexgispxaostarpasfsxtrtaaswepieixrfapewrnoyetswowyccfrikynriakfyxrsofpsswaifxwtftfpycpocssoiwoywwegwgcfacawckxifpygripiannrccpiyreaxspkpgpnsiconigacypwfatwprtiiisxtocekgpgerfiayaaiypyropfxrxaaxtxitrpofeegiiwtoicikrskxxsxccgxiiaskesxagffkoywxfgcfsckesiswgfcsniwkskoswnyxsseforpktergccianwpyatstitkiytksxctkkewywwfiyarpragceikoxtptpgryeerotwxyyeagictoxxgetcwsokaesxprktsnrpsiccccfgrwekoayyagessnkrkrrceicogcfsktrpgpkoawpxyftprpopxcxctcappfiyykpcssrgwotcspkexrfrfxfrssnwstowwxaswfysxeoifgckipnwfcnxxgkepssiygyntcgtfrstnktfekeecsttisxrfaxoioniokpntaninynseekprsegaaxgrsciasnkycxtpgsagwfwnsefacnnafkctwitxtypfegtsknxtexpygkycwwggikysiowcsyxfrrkcnswcwratrfxaafstixanftppookynartkoyfxnaxxnxroptofyfxncyggpyoskprfwfakfsfcgccnaopyooeeiygxeswiwcwxrrrfacwerkgwkxxrraefrpokfpxkgggoyfanwascnwfoxxnefrxryxatwrstseyawxferrxywnxrioipikkniwwcytgpfpykfscenxgsseketwkyygssrkwgpcrwrsfscrtpityiccragstecitiapeisotkensxotfkfixwacritgkgtopiknsgkerkrwnxkakpcnefkfkagoigywfstypepwitfwnxwkkfagpoioycwinfrgoofcsxgstosotstyeextistygokwxywxrrrwcontyrgwingprowwittoikyyprprogcgsafxxfwtfcgkxgwprtggerospftoffoipnnfpenkgpskyntyergetgcetrporpaattfpcnaprytntatyykteegsfgawswgoifynfierngggsiytraatggrixcgpytnaixcgxiggyenicrgtxipipenafckxnnyoyxaptetyeioxpsytwyykywrrfkksaywcfcxktsrpxtoyfpcwnwgyoggiwyictfercprsxayginioafpxryocgnfactexpfwfrkipecpynkcryrnyoipsckpsywwgpyytwkwypxrseptgattcaapwceinofketokkrsgweocnocgkgsneeynnfrnerwxoawgycgpfwxyeowscrkogyefpnxaxnsfnnxorfcweraeyexafewynipxgxxysywoxatfgyfxprytskefxtctpkiknnsgnagrwtifxioxotrtoisgcocateiweegygtyrgpsrpietyacfixogwnwrynpfkypacexpgpxngacpykgaecpeaoirenckexroxfcksstsaiffnygfyyyxtsrcicxokaoktwpesangsgrtnrytwkppccswpiyoegesreisgkxgnwifynnssoncwooawggkksoiocifgycrfcgpantcpgpoeecrctwfffrkkrrpwranayntpotwnsyxyxnpkysxoxpwgxexxntptnyxrtpyksrcgwoyswwnisgrftyanngeppsxfeenikpfcxnsagfxsrsxegacppockkswisnkgtwfnccwikwfptxoekkafwpnfwapyipsfsgciknkretnyaxocfywifiecxpgcekkfiawswrgaoxpwkrxcpwpytxgypkxscanfpaopnppkpkpfxescrafenftwynixfnyfngcafiitfcoeokwckkswgissytspkpwfywoyctkfocipinkesccaffyrpkxttocgerxkeaxpogaoggkesaksiwrpwgcniftiysckgatacwpaiwsfifpxpfsotkcsyrtkkafwptanipcapenirrrryieniwaktxfnopgwciryfpkoygpkokpxnganonwsswapfneirrsnsxronecocknseygnikontpgsppykkseyxnwactargreyykxnwrctyexwparygoynriwcxeitcettxpxnycpoikwagrfygefycktrtiaypyicypioswyxwngeoprpkowoftpswgcesasxfieocwfsngaintarsrwcxkgicypiniagowipecicfwfocfggeofrgixkkkkowxfeaexswpkxefttgykksfyggniaxrrsxtiosextekiifisyeynanpewxxsforiyoxgknygxcnefkfafrfieitsnfpawgkifwgewkpaastwrswtntsewitrcepeafxtowyxsnxefyknoffxtonwannatstfsgfptkwoesasiwgyawkkayonssytnxgexngtcraceaxroikiypigiawyyefxesayrtckkonopooysotpnnaprsnirsgkwfcswgskscfwpexryiktkoogacgpxkagoiiipwatcfeacyctetiwxstikaksrgppgcxwxpeokakecwagkwotyatwsrttyfxgaosfroastnxerxserpypnoorexkssiyitptnyosffosascfkxysiocaxowioarwwpgertscfpgttgkkcfyrycwioyiogxanriptscagoaranixkeopxnfskpkoywfpwxeorrynffnrryyoepwxnwttfywkricgypyetogcyixgnncgskewfexxwtgwpsncxpwkfgewkwkpptsearokgioffatywaiapasgxxpsrtxnyywfcgxppksripgsifseawpwwknsrakapcnkxggneiigfptccgrkfanaatxwnsxgncrsnrryafoawygcefcteriwocweytkcraiewncccyfwgswtnaaixpgggggpgfypctptyrnwnpnxnwkcatnykyfigkgeicostngowfygceeakkyawkntstecoisxfieosaoknekiaokieioryxytsxencfsttysxyngkxowafwetrrewgiywoncnxygteyiynwopcfiiranixitsypocckceypgxgiyrfcixakwiiefaxnkfwtonksengewffepygfritxkygcoxryakywcyokekxoxpwigyofnxfwxfoyixfwsfkwepkofytwnegyxpcetrncncassaoekpcstkaagexcoxnxpwxyrnowartkogrtcsakxikxiageesngisaryogxrwwxxsnwtkgcnkpfkoyegseaagifxrwifrcitgcgottprroxorwaxwretkysgxefwcrrfynegtoagafyrnctccxsogwceifnnfoxctpiakoinorktxontoyrgsaipxaecypyotoywrwoeexfyyfaycsyctnnorretiyynxeappipixwncrfnrtgrxocoanapnipwyepkkefpawpcgyntwpptsxckynekeanrxowffigngxecoyayppsfoygfnpcrwirgkctkcfpfackosptcwrociptynxsfpgawktoyxrfxgnniywwcpxekfxooygefiwsgypaxttckcxgnfteyxioacwoaawipccrrypggrofwioxcnittswscaktkpoikwyxworiapyrfeifasopnaopoxrisricornkypxcenaiknfikaisawigiwoewfipcnpeafgrrkrgoigfeitcnegsptafxinwagkexgwapianornwgrxttakyfseowxswkcwksxncxiyykotgwarrakryfsyeracrcyxyiagypgpreyfnsiawegarpriaksrfftptysfpsgwrwwwkascgfsofkrneawiosrywkwiyeisykgpctetacrenosepooeprpyftopeaifnwfnpwocyxcyocsnfxscnxnpwasxagkkgfrowiyafpaxgctnefkfcpkwrennsykfikprwfkpsenaxkwcikrnnritwercfyorrocypnwwnrnffexkwnkwreiifckxkkptgpcneegsoyypigagokrioygoxxrwkgsnenpaketfwfycetewogkaffgiwpnxenwwggptnpgkkkoswsgatyswswgwaescrcywryeriktffkpofakwirotxwiyoronyccoiofrxririiekksoieewwxgisfawyangwfytwggwssefnitsneorcrckcfgspwfnskixckgkkiwtsagxfowykegneokaikkrixpnoiratfnxancepcawykwowanxgsywopspcykptkxooskiryefpnwrewkgiwxckptfwkpfkwiresapgcceigftcxfeosfixwrkspewsopixnawrnyogwyxsfxpwiypaincsocnrnsnwyncpcsnifcaytooitcwteffwgncfstexggkeaixpgrfwrayyypefftyctftkfskciorkfxwxepkitkxsxongogeoainfyockecygriiktxpoerkrpttycrxcawesygixsciwiriafptiwwkranciyxetwsxwgxcncnryiwwwksattxxwgongaaxriarpwkifffatpywsgffwywxegawxkcepssiarteeckkfcyktacopkrnrawfecaysttecsakesytgwwkynityckofpcrcywgapgxtcffiexfaxpyisaaycacyxsarepckfcscrgprifrkfgctscipioewytntpenypioapfkcgxcktwrknorxwxtxtfxrgrgrtairsctsyaoargteyiawrfxaiykcgarnrafxcwrnnoyispkagpikrkoisfwfoiokinattnaisnnfcwpcifspynrwwtiyaoyotgxisyyissywsxfgefcnpnikstwitpwtyntoykinnknarxkptpoykgoekekiwogeycsikrgtanawtwcackxcoafywxxacigssartewtfixpifpgrfpiwxrkaaanircskfkpweyswktenygakeetgofeeypagossenfopnxfofasgxwggtcfikpknsorxpffeoinyytfkwrireiagfnsapxexewfcyrffixnytoskfrxsrrgnkffiacknkowypxsnxwnrwetoicokkxctiisisffenronnctwfenyfsgwfwfskaifawfyseoafeerreiiixoxtcifxawssaetottfyaiatawncekaeyonrkywiroigyootaicntrecinxtayttnprtraoopfpctiittxrfnokeyfystcsfirofsrinyxnenskpwnwfyxwaaxrykstirtawstifsraoapocicroktkpnrakxwagixetpknswkfeoywkesccsecyikaeiokykayyipsykeaaxxfnnifxycxeperfrrxnwekkafeyixneeiticyyaaoxaexxnwiorrgnepkstrropggoycriianasfswayogrxneeaekiinggisigogiyxxgepokwxgfkornkiifrngrffsiniaaxsxsikipxtogxownxocfsxcsnaenipsiaikfipengofnfyccsrigptyixtftaekgnxkxaeaxxfowgtgitrcofcwrriseneewekxsocxattggcyogcoiypssprwssroxccsyswnttxepxrotwrienstpeyfgkpisyiyotwfrfioksancaoanerfoknoiginnntaparipgysspewkwrpgyiakggryfwagpocekfwoyxworapsgaarxtgitksaicyckoygyotngewxwrsakrkoayxixsrrpeiywwtxprckfpstecgieppxgyxgsintyxatxknakntkwinepfesotstrsggeefkonerpfarkcxkciecfencpfteefcgfiwpfwroygnwnoikypsnyxfngxrctnfgxsigaxpkypwosrfnneekwigxpxnopowifksnytwipfcscpnnryowxptgoeenoitkfiaeckogwcfkpgeonaswcprscrsyrxcnwofkitpftffrfsepxiwgkkxfikfywgwoeygcsxceirekaypsayxgwxprfnonfiypasfifwxeogyryyntsttwkfpesstnsfospscexoeeifrkasrxcxpwegarxiyyiwkwtytksytewnfsffgacigkacxeseyaegsypnnfrfweyxsopngftywnascrefxpckkecgyoseffsrcwcoricxgafcsffpsreinifiiiyxagcrirsikoacrcnfstxfkgiayoyrrsikfiexnanxpspoxsxccigeakrowsigwpwstkwnoxkgeytgawotwyggoaescykcyynttoefngnkcergcnfeaoxsxetssecfxwgoepcggergkkeoypckpefketonskkptgeexssrypyxesgatgciowekgynaesigoffnaxyfponggyawonfaxnspirogyyxefrnppawccycntgnwcenorexcgwsifgeisptnofifnxwksooepkxttwswcpaetpateagcwkopsktcyxftycnwgofxwwottxponaxnorifxitprfppfiepefienpccegsorosrrwteyxywsposicaenycsywwfxrostpppecwixxgwfyeckkynesooiptccaygtcrgaiptsntpaiksifcofnprpxttrkaarewtgpyonnicgsirenkksggytsyepttcksfyyxyoccckyexwxitapappwagixfekctryafptpeynypcgnrikwwonwxsgrreyrkgtnoxgataikaxyyoaonseprfiascttcoaggwwagwfxfniykxwnnokakccnfpcxkexpofkcnongkynerttexkgsaoysecagrgyreppkorykynfrwexpsgwrokyskppxsyeneynyoiogyypnxcetxeawyweoccttscnaoiywingyinpnwootoawiftkaerpyrtxkitcxcfeicagtrncnnygckfwipeckkaooofwgskeofppikytywxicofnknsfccsgkcrgygegoteoeaxpgrwcinregsiacryecaciwripfssegokogtwnxirawixkgesenkpaayeasaiirykpcitnscfafiontnaireainekpytyfgfywrgtetsfeiteeostrpgpiegegywptekyfapwncgtngotnpwccitcycfnetifxgnosciwksswxxsnnwwxrwspficgegfxssnrkykxypakniiecktfkaaecwwrgpopekifepxyesfoeogwifpcgcssrponosegfkcicywaacgcyorofigngwtiwrawyofaxpsyfeccotgfygkftswikkgxrynsoersgcfckctfrsexcsoyygissscocotefoongwrsttwinxxakacstfsrctkefiaaartfxwyxgfgnxipstaanfiyaspawykcnapkaeeepxncrycexiwigitcykfcnitckefktcsgtrniwrappaiacanenfpneikaxkrtprofnpfyyyixwwsexkkakfsiwagtwwxpkwpcsrsyfywcowtpsnpxxirooinniiwtgsxwnwakkprftxropccpxrgcggwyiapiceoosfafrwrfpeftkkwekascawonxwcgygkcorwkxtycwprkgiwrnpyntcotxwirwcpotgnyeipxrctnfxcaagxgoysanxkktnywpctxnokpytsxcericerkinfeoefosoraxyxgsioetpisaannrceyepyeeotapfpetataatxpeowyyoootfkxykyafccypoteefneixpyyrapxrwninkgtwfwwtegongayowssrneixapxnnioxfyrxtoyoayocawkaarcargfgtyxxiaektcoppcrorcoiangpyynccirtgtxynrgccpkyrotpaoofgasirrwtwfpnoyxrxeyxfogyaxnwfkostnrfesfctaafpoxaooewatfprerferpxpwcgkfraasyeknyynwxyrncwogkswirsrcankccpogkgytapracfaoatrgpigkseaeoteiowitkngocxecwpfaaiafienttgpfofsaasicxwkrftwaccewyosapcnrxyncatyanfrixigfiiwxwttcyirskefwaipxcocnykfonyxcnoerepgsywwgrisnekyppkxinfaootgkpirgyontayitnsangarerknoarencsnctwntgpneasaetfcwnippfpwepsogetkexyofcwfyccakrwxprgtyiwyeekeysycrcswnnfseeeioypntwwffxgxostapwgooickrgsytfwwpwotiaaxiaxoigtfcntttoegtriasierofpxggxxkspynxkrnpktktwkspewcncsiettpokegwneaosisgfokaetpyakwpsaaoekitosconcaergwncawgckixetysyrrnpwnagnwspwiwfoxeeirpsiaiiwoxwnexfayisokkwicnkawiikxxxoogrsncipoxyyxrtwxpgpfeftrarfnftyytektgoytixreynkgiwpswstkgetnoirgtttnniryixewiwgopokppwcaasewwnrngpypstpawcixrtkrikyxiprogogpfgxpgnxcywtyxkikaktspkgpcanxcketpskpwopyfpfwkxefkskrknirwcofkktiytfnxsafnyxonnrnwpgnstfeptxifpfgkoffncgxtyxeafyefenfoetakcokoxkpwxoxoogyapereeaerixtxsegfakkiiiigxcnceakkxrcsewpcergskixarofsyaksoyxfxpfswniwinkpppscffxxxyypsoxfwafwwwnakoonptpaswyyfxistppyptwrtknawxckptppcxeoniekgiepipcxptceicorasctnkpgrweawcfiopiootoitotsoypwiinfyfknknopweesxoykigtgacwfkenotsgpcieegxgeonysngxityysnkgtwpfsktnawstigckrwaseetggwycrcneiygxnesangiickaygtwieyacfpgaetgkxtfnsaiyyigsistxwkxwrxcfeytxerxaoenynatikakaceffnpggryxteyprrrgaefygsfycxiwfisnycnxoefnserrgstkntxsoooxfkipiekoasawsfptaeyawfcgfkgsrtypsxyognggoieywtcxtfxpggoykafarpocrnfteggwkayktwttwfnnpxckaswppygiyacgxpkesskcrnokigrptytpykckkteirprapnrfiknakontgkoawppoicynceeesewacwcckcegaepyonarwspgcwowragrftriosrrxwosogtwfpepsistfpsnenpyckcxxciaspooyyeogsytnoaatioioiyciafscaffyieogcraswkgeekascyottpxyrywfnecpcntntgfpynysiywaxcxxsgoaiifekgtpxiipaafteeyecrksrtpyeexkaiwcwofysxeosyykinfngnswneoxecagsaswwyktocfkyaokonssanwiiftsrfxnkiwoinkyiypfsftwtcotgprfewfkropceggcieeofkfwypwryiptawgnaeyaexaawwyowyrncockscrwfgxsifrcxcynfnfnpcxwxyxwyifwasfkownncswetsgwseffkyecnaxpwsrewnpitaiekkspsxwetaxienpfogssttgieisscwnsgfknrtpgkykxypifcsggsngnykpnkgwepewrpgsincrwtkkcffpertnnipfpsknongcgokagcisfrwrxwxsnrsxifxreaekswoagnfreftoxnxfpyspepirepktckopwsxtrnrowwgaaipaeprfgpprtoytktpaxekgnnsrnaykofycptspspnxixsncegstacprnkaystnneykynysprantwpxeppspnwpfotsixsisapafrirxregegreryoygntkepsrrpwykywxiiwiosyikgweokcnwxxynriwwwcinxtaipntptkroteytxifixcifsrgxonnywingigaaxogospnnifgsknkiwoawwyktwoecpfawyfckgetnwspykygxxcasprcawictigtacpffgxwxixecxpxtaggnwnorwwgirngrfrrxwtrtwsycykicfewcrktswyswnworkggnxtgyiecaointipppynscxsnftipaopfynyrpxfkwpkkwosrawsnxycnnpyktsokgoftpnxcofpcisnygecacaespysyyycwoerryagyeiypfxwpoapgscwgrwrioegprggitrgeryktnexkpkfirfeapfsnnkepsxytxgyoacatcipoogaeagcckcxiwprwrcwynwffgswoerxxksystnsncogyoxtinswxnoefkxscoxwperaaypyasnskrepeexyrtesknptiienowcfenswxfxioenyespfcowxxktykpnrriapakxiapwcnctanfwrirotrgogfetoetoarscokxiaficscpofkeffsyttweccwcnrckiicaiarakcxwtxeayiypokeonfwgynfootycwfxctaayptsireocteggwackaieatweawoxperkawtaakoinoaenfnpkokwxappxkarnoyayrxecepntwawappigppieiyipnpfrxwytyeypygtxrffyagkaeypwpyifainiikeotopntpkyyokgkrssfkoxxppscgoitppeccysppgywyiawrggwaiifxcesgktfkgpytcikentfpccigcsytweowwkwnyprwgaipaifkwocioptpfapsekxkxpntiteyngfpstcioenftogopgssfagpfrpfnirsynprepywnrifwttcfkkxaarntrgtiiectooxitwarctkpnggckpfpkayrnnoasretnyiiktweksreowegggryfncsfekknftcgxwckrgxpeckyipscngckxwcwikpptcrakoptpkxresowyskseayyigtkcopeianriiwooceprkicookgkxrxtirtiwgcyrpewgwronsnrgyscxptexaggawccgtkoxypwirfooofeggssyccncfatiggiwaeespwkpfeoepwekneirwifkfegiykeoaftgnanypnonxkssiyyaxnowxrtyyikkwsnkreynrfokowteaeryeoikkpifefgkkpcfacceogpykeisksipskrerxwcraposxtrsyrxetrfoinkrrawpfoarpkrnrnttpnssstwossaxkagpassrxxakrawnftfppfkxikysywopkefitnganteyeprtpstfcxtkwoerrxsogwiwyenryengafeiycnpxrtegeoisansayrcnxgoicxigwfeeaisekkepiateexesrackssrpnnfxoyfgkgrtfsntaraaiyxgwpxsnwcsketyeipgkkitypaxfnaforxsognkgottxaekwkfewrtetewwyitwsaeatctocysswygfoacxwcyyrixsekgxxyrgncwaxyxoiefkgigpgpxenfgoxppgcpnisfsxtpkfikxaygseigrsisweeypcixnioniepxewxtgysxkpwceretssynngptwgtwstnwegxiokncixxckacpxefcawwikapiwwknkrnanefyoekfntyygnawiteogsxatggryyoxfianagnkgxxayrksnekiigswnefotccwswwrtgcwwnwsxtftixswtscwxieawefyywrkteeieitactpyaacxkcxxcycefcwfyenwcytafrsyprngkpkrgggecycytyyrtwixprxwcispinwtpotcnkfowickrrpeiyfrkfptsnswicsiowecxnpaiecntgtwrncyorswcxssprecfootriospiceftkrtkyywakcgtsgeecaspxcpeynrxcoweprprxpngpnfctkxnoayciawwxknwentnisfitxikiyxswfysnfyytrikkoaffearoyrkttnkopitxriwyosffwexisixiknsgitxsiwigkofytxwyygxssegwcnakgfrowsssooeoioacotsnopyegnoxpipowfogokyrknwikgffwxoogrkrkarkfynrangpiwprwrkppwwixgfaenfffxrnaittxyxkgarsyexkycwnoytcecksrypayonyitksiaassxgsnefrwxgrikagsikcanocnwwoptwtexopcyywtcptroawnycsfeagfecxygaweerxxoeaiowkankktwstppxopsisnprywrsttxsfogynrcfytafkawesrpkecppaenrewyrnkfaeioipnnpprwtyisiaxkyeeoncawasxnygfsxfsewfnpwfrcfkwysgswenkosyaatyfsxwrcakicfnpsyixixkyntkwxwgwtneikfofiackkatfrrtcnkpwggwnciofwawrxyekwygpngckwetngitkkrwfagwgeoaaecwgpwyxgwkigpfxyryowygesoeysxtpeppspofkwwswaxfpikeincgeffoipeagyogwxeyaffayyesionktketikiwisiteotarnrftiyktffsfnyrxpcwrktfxcicewntagaarfetfsfggewxpayiefrpfsgwgxpociiirwsfiocinpceysrktsxacrceotagtsnewgrpaowxwwtnysgynaokrtwyxkxccionenyakwoygwwtrytckcowwfnintexcfogrksnkkcpxpgcxnfrkxygryyeextsriirfctxagorreckwgntpottcxioyttpxtcoypikikwgpkitkirkxwygfepnynfkwnsxwwfwgscnpnycrrspiyosyrtwaxagikfwwwniwkfctiyonfsfxxogikwtgeffoprgapexagfgcxixyaokroxtkntfscwcicyfgefkxncypgegcegcoyriatpefwwattertnsyixxeekisxoxioewxiiipxifyxwfpioooopoxxgxegenarcingeypspyxpcecaitcgocetxwricwgywgaxgncrrcwyracxyksrtpxtifcafeakiprepxcsnrwaktpxikisgxeyoypkrkiypigaffpyapwrokranwykaeygnccikncrpkxoeiriixwywyfikrptaggsfpryinkoixorgnfwnrxxkkgtawfsiicgroefpgfoxtfnskgoityngswinkxixfkaxwseccprfcxxkgxiyfyskxxarippsafxxogrwskygtpyiaygiecowaoxrsinwspxspwwxgtiewgrprpiokeanyrwinaaegnagcnrerrxtgaacesokcgfkwgywrtfttxioycesacpectawpkxeekyprngceoarettrfsfofyngiorwxpkppokcgerecgnwkfinwiyrikkeygyccfatnsntwifxkcpfoeacxaiaiiowycwrfnwtrwetgaxncwixppxniskrfttgixkneesogaoapfstfrswopwpekaoytfnesppaktcifnpwysxsoscicanicirrgsnionxweyisncixfwspiipacgeywgcfgkfxkyonkikoskkxyciwfrgrpspypxtrtgswgckaewfsygswgnsocpicrftiicsywfyfewonnntgfwipayxoyfpoextccyyfkiyycfytgfegnaegirtyxketgtngxnninotcygrypcgptwgwfnnwwgyxwsytrreiayirxypcneeicirgonxattayxwgtnkffenrowgtctitnkkgrkoersxixocgciwnatetwwffyrrfatefxttcrrsytrocwexasxyrotwytaekycpkarewarewniarxarwgoxgrtcykysignpwacriwrfycnsynxyxssyretygyinaywgoxyirasxipeoaiwygckfwywotngkoagposkerpsgaaioxrspwippsgwrpttksosotkkcnotgygapogrxsngckxxnraspskeegyweaxwxengwxiptxnosxyyxyefxorpianwikpxepoafcwoigkgockcapefiaiafcwisnsaaingsyrooyfoncfftnasxikotkcifigcpiiakrxokxxgowkgepwsrkwaxyfxwyeftpcifcoowcnpsianeyogogrostfxrknkresceipoyoykcraptpciowwcexenpoeocxfkfiypsgisprktcopxsfnpfgyprnfsfyrgnatregpofneyasxyaineyxsewesxygypwpyseosxaciepfepnfwsgtggfrpcixeniwptwcttxkxitxisaxrigytxrwwiksfwyxoxexseyowprxiisityykeagwnpcwfstsxaeyoaekfweegopoipfckscpowkgaesgresggnoaxcgrcepnifeapwyexcixtctpwgywwkynaicntisfrwsgpoantiywnoysinwsiwppornoiaaskoxsotfnyrfaynipgpkwstionyowwgkyoftoknoioycnkywfpwofagggsgfkfayyaxfocsaxoipesynriaixeggskppfngssyritsnrgxrseynftkfttftnyoypiraogfieifskisaokanesxnxyetwyyifsrgopxcoepoggwkyxayentspnaigswsnkpcrsaxpgxtixktcrxaixcayeskxgccigkkxonrgpcpniiftsrpsesgyeiyrosoxnefgeinpfextnrpeaiseetprkwaopsycxtowopgpcctgnkaepxgtxfxxxgronekxpgkorfcegxeweootkikokagwrotsaywiprtipgxkrrapraycoransgpksskakeinwxrigrtiigknwxnaxxentxyratonoswficcksnrwgtgnxeypoawrpxinptfaksipceyrxroaofsrrwntnaayfgsynpktccxrcckcxgnwyoryfxarpxsnocecpicrowkgkyiprgigssckokpeasxargpxyagrsaypyrwgergkstcypfegsirtowagpoatrooowgtckkgcasprknsasywrftninygcineextganofnoppoacgnxkprreyarfaowtskgficfcfoiicokcxnksxwtxnkcngccoigxowiwafekycroooefyretayitoctcpyttsxseifnsorykifofcypnonytokrxcrxytnffcfkiyskcownoeteynafyifrnagsksoxcfgyfggyococcacxftpeneottgyecpcsssifinkrscfixwytfnergtkcwyrfaifrepkaspaorkxfyoityoswgitnrakxfywsgwookoenkertiefxoairptragncgsoyxfopsiktpxiiyyppfwxxeecasrgwgnxpgxpsnofxxewctwyorxeofygyptorxofttiaxxywpgetxfyfyfttfyckkosekftknkpxaysktwycrikixxiwwikkirkefciorfpcfrswnootncckitsgokagtxwoyreokciskayesiwxgnaigtxcfaxatiaiwxfipewtpynknixkcnfetxtgyicsgxyorspeikeetpgnsntgyeswtenxrgoggoscofftpsfyaxinnskowknnipxxkxfstkfckicikfaegtrksctfsinyiccgeceawiokgcftswpsoifeorxfpytixwaayyigknoeenpcopyswocwwgwrnegpyrtfsnwknsigcoggwnaacifkrcookactopgtorpkacxwaffkroxtkwpwacysioetrsosikpgepfsyokkaspytxffxeeigrosgypaewxcsgiaxnxgxayncrengkeigncpkkitaxktxcetxcrcgoekncgpetxsgxygaxxwxrfioatwxirseccswctpogkogycxfpfktyitscfixfxgpwwkftnnnyrsgrokwkigryreiiifxtntotgnpckgxtsgiafwckfpppgkpsgnyxfcytoyaarywsofiacctntfoxeogfycasiiyyownreoitcpkrigysfintgoowkecfrnkggcxwyagykgoxtiscitkisnfrrpegfnkswtksyktionpwogyrgrkoigoppkgacixiewxggrwwkysioetgywikgygripkkfeyafgikwtioawwotxacknkwoopxxfokpwnxacxfswkgkeykgowapokyyaifefsagkoxrgkrtsyfpwewcaecpxksskssfpwifxecaxyseoagoyiyenyiisnesroiaiagkffkexontgrnfkosntiswxoeywwepofwwnwwagctswswrgscayffeorwnwsaycnaprykrcstwiigxoxexapwensegtccaarxorpccggngsoyxeewaanrywweipagxkxkwpsygwxsyyesrfkekwxpopysrikrpceoikkygtoryeiperrccrtrxteygxicyfniccpcycffeearnnysygfwaggwektsesssergknwxkrcfworgyetffxfnkgttncratnentsypgkyyeifpwpfrsoororcfktyioaofisngskrerxfxiiorixgwigffngpswxtncokywsgxggpgogteccictfgsposawayfxcrsrgtfakkpgoweaawixkftyoeknkyoxkinaceyxgoysawsassppwcgkgawsaxgannfcengyyckwwstgfawyptiatgfpytpgixatorcciatoxnipkreyokxtcxrecnkryttceskkoifxeekaksnrtxarexaioctfiapcargxncrxtsareetxiipryioegprxnrkrenpnffcopeeksacwcpswpeypfyasksgxpfnfrspwsntiyfnketieyinsnfxsacewgwxcxpctcsxiawwrnwopcxynykgwoxaifitcxxpiswooxwfnaweeyxnwsnfasexoktfgsocopwswnfpywsixpgyxtkrnrstixcepfppktskiwaacykataaoocgpyksstrgpaocexforxyfkxicgtffcwryarxcrxrioppxsaxfirwtwgypyxesrwnpanfwppxgagnegtwtponsiixaffxrfkpcokfypyneaeatxfcfipxctacgyrkywrxoooaooagxoektofpppscwgkoogfrsnoowcspnorippiofexitkaaytifpayrwcanaccxtoyrcepnatgixsntniyepitkgsepcrpaopxgofacfnfryoafkwfknetyfkyaasgxrrncwtpotcwfwwtnskexfoxgncksxicoessgawgsttcarsrnkyrrwifietnrrkaxatorenescoaeiargnpwskspffnfxgaccgwaicpekwfonyxtwyerywpewrfokwfgayyffyfgxaysckicewteoeawfnyoefwrsacyktkoeosoytfofckfkixsisseeoaeenfkxkcxfnnyearcasaynnirginnnsstkiknpygnytgcoeptrtsiwngtxigiywxpipoepkyeoncwffarafkknitciscxtwpncesowseywpxffeareacaicsnpoxexsworfynkyxyycsfkyotcftintfaostyfnptxpececectyoxxroaswogxifrggpnwcwcykkkfcxikfkerganewgxpttotgnpsrpptprgoyfstxgcrtcyifacoctnapiiwcxfkexwesagyxesxersiytytiipcigsgksyseeaykixwkcxnksoaepngnkwwnetyrawwnnwcyesofatgpgoosiranafkacnxsxxsftinknsykygipipwrfkaicstxatcsfcikcketitfaxnrpywwyawgeskwfatppcktxneaasaeaxfgkcgrsxxwwwfsyyigknxywtpfepkxkwrecttfwsrrkoeiaypgckoxeepreaxkfwsgsxnoipyswrfsoynppwgpwpgiaypskxkrfpgpfoycfinxkaacctecyypiwkksyxtirtgnokprnowtrcexkfeikkopoiioxytgxniceixopfingcyyreiigwecetkegakncspnggtspnyyifngtrrcogiwptpnacryenyrsgicoftetgoxtrcpfsfxygypefprcsoopfotinsepkgtresxgftffgnkricryneftfksaftxtorxnekyssxtiwecongxstyrnfwxroakkrrgesgwofspkwxnwpenioxxnfykciisktgystgkstesgkwrospfwxyxxgscnrwstypwfintigfccoxorxsggsfrriecsnnopeoaontxiwyswccgccnrpapewkeixwgesicotaftsngpkfnsygxftxcknnwxxsengoifyetnoaitxwyyfoxcwgsnkpeswcfpftefytnxsryfgypxwtpfwfogtsetryknparnxyicggfxorisxaxpspnwowsckktcggtyspiafxewstffigwfnoofsyyryifokoptktntooscsngoepnecysgfewontwsywywyotggfxpssnpiwsipxceeikrwsrrweaenseokxtioktkxeptakptnooaefoientswnsoxpgifrgyxocnikfffsisgfptwtcpcsniwikrwkxigwgnpxyigytpistaxecrgngwcaeeirrncfasrxxgtextgscaiosagsgfttoasnoifpnfrnyarnpgegotfxysfokgxppcaspytypyonenysyywieingwpcwrciignfoskskgaianspyyynxxrcskttrasfepagxapawriyeysrgrfyytscepfkypcnypxfsootgrxosoncpxskptoopkxxwggctfcaccfxsitywiyyywossycicxxgfceepnntywskepwgnfgegkowignooyeoccwoniekisygrofopfitrrwynspeasrsofgiiwcxgsypecwrgketannxegncocktknnpfaiirxsfrgtrnstfnygtiaencenswwneewtrpfggfexoefcywcknaxpfptsptifecgowcrpttriiitfegxtefxtkecgggasoykoxafrpitaacocssgkryasxscexgwygyewxoynwxoapiktreigcfikwirfnttanxoisotcnoygacnfarankytxexxpwtxwyxoenatnncyskipktekxpfiexotfegckxxefecypxssopcxixripraceaegciinsfxnprpfnskaoskiakeyprixynwkgkxawyykecrrexaywtfxoisfwoexokofsiyrrcyyakgfpnspkrprtrgeignawrerkfongpafepixtnkwfnkotiwrcxiixixsiyrksnccosytstctgetopkkwcnsstkpnppgnwsfpfrctnowgrtrrcxarkxpgiwitaekrtkiseosxyspngfayktreyfyysrcttocannnniiweffigepyknagftkxwxxwkwwfoyxpxtyoofecsgwkyirxyxoiwtopscaxeetsyooscanwwsyirxspifogxnokrrecyeaxroyktperpkatogefkwksfxxfenewwxrcatgrrxgnyiytonyxatespcsakoaaxkrgagokpytgyptfrierixwfecxwfxttesaorcrrswreranfxatigikfwtnssokcntwsxerkynxaxtctintcxawsrgnpwkywypaytnoriwpxxtptxrewcyetpptnpokepepfiagnxyrtncyippxryekispoiyxsyiopooxytoxcsrpfkkicknrokykrgapyggpxwiaopipxpokkykwrfrkoyiyffsoacgorewkyyiacoankcncpakkkcwgeeatannewnyaiwkfsofwkstexwwsfsokkcafxitoitsypfrfsnynfwexrsxgxwifecpyssgsgecescayenkgxnrntprcnngwfcwykpxrpocpsnonxnnnoritgnyexrigscsfyarkgxtgrkfscnewaiexeiyngipkpcgtkyowkicgkwatrooonoetngpcooyiwenpskocwsanctyppponsffkefxyrfnanffrykscserasgaeyrerxkntfetcsnenogsycwawapxteggnsskcyewxrciopfxsyktocwnkrctwotppwtiwykkwocoeknwrtnokaicsspgcttcnixwwtfaosckccfxnypxotktteckrxgtcfacconwykcwisoeypsxynyrpypfoyionoexpegtekcyteinfpxopaasfecrpwxnrfiikrpxewesoorygyawoopwptrsyryopionnckcxpeeotnpctftsxrestfnpkpsgtsftktnkwgetywkrxkieegppetwoysctrxripryskiwiyrganrpxgkegykwrnipyxerfrapskkecxciekwkxgawreyncwnfyoiiirxkosoeesyoatcxefeswspstccyspprsoiienrsnnkxrniarawswrgrtggwgaxpkgfknrwycagkaprwksawoyxfyiyxowefgxsppeywyotyfexgngseaspkngecpannnnryncekcxsteafgttypgwggfcxnkrtixwcnckionffrwipakerciiytgtcxapcwreccnepiciesiaxifkxwcgrxokwoiynapkpwrfttaksxpcgiiprrrpkrcxegntwtwnrtpsaxfisfpopysryrygeaxgxeixfgknewgpgprfgrikafiostaixcypffanpieifatxoykyggwrkcgkaaxtstitaikkyafetiyowyioxaegwrncxnorncywispskkotwwyperpcyxfggwxsfyxxgcwtfeonwkcinksanxenpxassrpfcraoesyposgpgcxtpfgxtwxtrcroeeopnnypyykiknsctiacfcpcekyxgkasrftwinrywwcywiyyggkiiersorganweieygaspctsiaosiygtwanagnsxnwyckagriccrwgapofxeotxgaxnepaegyswgerrekcacfgpnisfcwgywxciwckxsctpyacksckxasypktnkogpnikoecrocexeffagpgiypnknyixnnowrgxofwtkkrpgtsxfgcwitfnftsgrsnypooogekagaraiseenyakxxtyetxgaggykcecskwtinyoaxnxxnkaegeygpkfacaoknestxfanrsykirfnscraxnoneifresopppinrkwtpwniasyfsfgotrowosgynfcwokytspefiiayysgaosxrxsckpkgxcregeprsypywtgoffpcaappnireanoinyyswpegiongoapcesineiwgxaotwcakscewoteapigekcgrrnygnnoyyagxtnxnpngkktosonyokwigwoorwgpssfxowreocegokngkatpkokwwrwyokxakasnrapwrfaefoykefkatwssnekgyegweanwgkgxtygxitfxxaikrgtycffnwykcxrnenxsixksoaegwrnnrcwppsygpgyissytkeoyfcnncfsaenpxwaofrkirpfaysnxiniixnfekoxkpxgipwokpcckgnsikegnenagsckorwegxycsotnksxtaefrsrxcrfigifcrofcwfanxsspyorcniixegpcynocaonnweyfcixitkfgytgsfgsneyirtyesgwogckafwpnppsyxnfssyxkxstwrrcagciinigiceyxgnrykotxcsckfsscyowfsiyyapwywyoaikfftcnxwnypngwesnfpaesgawatogfytgktaegragncpicxwigggnrkkewxccappfgpfsgepcrwpynnkgyfiirgenigpkyctetrgwkkoxkwnaywiggkirwxgtnyxgagkcyyfkrkwswcgrrxrfgxgoeitefwerggkcspaoafppxrytntifwrayrosopagorywaentfptskrnonkkkecrswgnawpngyeopcfpiifcfiyoapntxfyxggaesggffxwttcxawaaecfyxigsytfoksfxrwrpeyirwicgrgfaakcpopncxagsfarxxgcokrgppgegpoycrcaxksfpprioggpcxeoexgsrfrfxtseiaeytotkgaskypkckrnykrssxokgegtxsfpyixreafenafkcwfckgscffrokcytegcnxopnkyfyptcipnnextaifsoaorypxxtsxkoefayesefcpeopkxpntkeyrwfifsgixwstngntwepteakkxskoweoftrtyarniyyffgpttytgifcyrneokkcsxxcpnitntysxppcweecewtfifafxgneracfpxeyfoaexwnsryiakfxonfpyoyaiingyyfoistcefatofcopwnnykreikoestiokokiwyiewsarkorswoppoaksipatfapskknsnaigeoyanrpyropffnpiyakxwafyconrgwrkeptysoyfetokcreyfsrpptgfkxiafknosxoiaesnggiccpcperwtogsniocygtpryncgoptsccagfikgsxxnopotynsknwewwipsetiaoeryowexxkwrsrsafrgiwsaaknysxsfipnceycgptericniiccrwiiifowgetkorganxoctggeipoagsptawytckionewwfypxsefxsaknyiekrattfisyertnnracgipyxxanateanpxonkpagirxrxxrnricssfkyeatsoowwktkptaogxspoepcgftwpcnaxyewtgpxeswaeeciexxawkytagkkwoixsgksfagginancptiyofgnsytpwesnxxckcwgcwpwkwirkaerppsgoyraexatnicoanirirptirtpenefeeiaygxoooapxtxfogawynfxfaiggxwcpgcowrwiwrffsgkfxrxsainixxctticexxywaykiagooxsnneowkkeiyogyarwaoecaxrirrckyroffyiyywfawycfyayipegsesrsngacopnspskwfcnxaenpetpxtcgxoiceycxggfwgrtigpaawwptoniskrgepyrwocfryerptiafgctatgiyaxreyerytotayxpgeewtirpystgkskiaynsyogkrogspkgftxitixpnospoereranfofcaifteipxiefepofoeocfopipoewnaewsnproftxiagoxaypekxnfrkwpoypyaoxgocatiyrwkssepfgsgotswytpeagafrgxfwgprxtiiktyigkktkytfgepnktonocpowkwcpiwyktgeaxaxpaitkwrkyfpxfgfoekrscfkfrrceptssaykkfyrywofnrwxcsiakioyeekkgxakeswyfxnsfysgewwpiocwgiforxagpyscfrpcegiwckwxatfggptfgegcwxprawttyxfsfkrxpawaaoyatykckrtssfaookfogitwnigasysreactypwnsyrietixgtaggceotaienenwkgpotnfkeaxygpowcygayenrgotgxpcnwgogfpnwsxopysrgcwxtfksixsrkyirricwaiartkopgkarffoxpeytossxprickarpwcsrfgxaxkrornyiksttgrnotapkpxyrrnrpfgawrcpgrwecfxwrosyoyacriwaeonxkskxaiisyekegasfkgxgxfrxtpyxaieicsrpraieoecwwxfwaofiskxytifogfncsfcartxwyrxiwtispgsexrtgrrpxyckcffrfaoetgswrercwapisnyiwnkeaayykptietiyaogyrxongikccnfoscswynxfxwwexyconrifncnoxpsafwoiwrprrgtasanekoxrfrxpapkfwroacpwwfexpcosowcogrnsngpacioiocrxfsseywntricsseaeostpwoirtnwgooptpefnstsexgcrntwgxnokycatpiogcgieagewcywagaorxrpxnargrxpkoypgigacrfnfckwkwogrytecckeeaycpricggopnkyeptctinwnrrestynaaygkgwnyitcakgkgaccotgwasawcyxiiyrxrnfkfiyxiwgrskaifsfrytatiryyaxxttescwktypwnrpwrwwfgfiwryoxficwwxwkkoxnfgsgtnxixpgfopcxxkpppnotiiseetipgxsgfyottrrswrfywepwekktpaokcterasrwwgpggyxsiosckekrtcrtkyfeeoktkwkwoiatkoafaerfpkexpogtxewnkayxkgckkewgficgtpxkkxtsotgtypggsgycaxsnntctrnawsspoxsgarsswtirpfiifiweaperistwxtrssytsxwnoxeixkweekgaocxgrxnnooyiexscaffysyfpctrsgpwntsiecnwicriwacesfcsggawecrpcwwcfxwxwwcwnpgwagieognkigefxaapfwcxfxnrgarnxyknaxowrgieepfeywxwcegknwpnnpgspfaftyteaetcskktipiesxppyrgnkoyrpkfeikccsxseaooyxfgrcawitinpewpftnxepfispoeiecrxtrsggoettyexppgkgkcirkrytccsaywkxcrafknwckkiwsygafwsnaywgopfriapgiexxstostcxxfrtcxcecygiywowaagixoeykkcwoaipreixiowtkkroyaapfenwworernnwrfckfncrxacooeaifccoepsxaornrxwnagkkoewasnwkkgktscppwnyrnifxktfsrfforfpcwsencwtwnyrtitgyfcgoyapppaotnrktexyrntepotfcokoafswgfraetsifcofctygyrepxwkgponwrnfxegsnifirsntycrxekpwaxkyxfixeyypoeecxexwokpkwswtoyiyopfkaywtnwsxrisxirxfxgonryfnkstnywitrweywntcgrccwscotffxowxctpaintsytxfpfrcekcfsinpreirskiwrrraryiicnaapporccscrwxkscpwxgoaactwinofcpkpayyoyfktaixkroywneioiacikakkyiwytkepsygetxpsonnonctgonorwoxwtoncywxyiegiynxggyecwaxgpncsrcaonfeyogirwxnioawcxxyipyropxwpxstoanarosiogcsakpkfkkxityacnxreogfsnfcawfcspxeotfrptkaegyaxfnsopxgfwoffpsketestnwofcygsfyrywnwsyoyycgoesfkwwyntpnacgypcpyygiacptegafpyxgsywwfgpcefgioeegyxxtcogywggfkpkeggascgcytyrirtakantcrcroowwesgrnteonknkfnkiefprxcsxgttxofcrxpereisgcgsoxenixioatepgkirwxxatpyekgywirpeiyxfooypfcgcyknrprpoefwiysosrcorykpoaccwesifxgetatissrfpgpeefkxkifiotosewtnycagaiicoraeaiwtgapwfnncfttxrggpkorynifxatgopeonycsffkcxncapgoctngfeyeorcfnngtocknseiccrkrctcoiyegrwrrgnwxnyeeytkcprpoonyncnagyeooycoaigfwkxegtncyipysggeoysctyioaftncwcfafkgfyeieacorneyxsngcioewiapysyxoxkowpxiopcfkaynnispcetkwiwwpytfgoxygprxfaraxawpixocxiagffcfyrregayooykefkryektioitsoxgwtaxtcspsokofnseykpfcfcrtxrpnwxpaprfnaenycrpafxyoxsgiagptpxykygwwsfagsyktxweasntrrsxsptnnoytkwaeicskfefigyxgeykpnrryfxsntsyepoenntafgitgniwxkyskwykpxyaktfxayxrwfrgpoitgfxrattngyncsswskiyrkkcpfpwkoxcfgrtkriipergrkrntkpyigaaxppgkxnpygsxytarcaaieotwgkofxstspygaiwcwegnionwtyxysnfyaekatirrfsipycgxxsgtyxrtpgwriskiyknforcrnftoftfwsritxekxfysxfwewraoapxawncfesksxgakkcipcpaswixioccpnyaoefirkowreptorpkintnristcggorooaoptyegofeosxppikpasippkpifgitgkyafcaptwnfapksegfirkppkigegapxroscyencxkpsrfiwipyrnwfpxoxkooearxkpwygrsgrtkppyecpnkafryaifwweeiparwpoeeipiitierxetoarrttsoixoiponfyxcsfskkkskgsyopstnsesykasiooswigacgyicypkwnngwycgrtfaestgnscecysyowifrcywssxwatpofxwofpspaxiwfagpgkikesncyxxscegpfyficytsaeewfsaanaywowccrepwccakpcekyxypikrcewwfargotowwrkxfynyyiftsrgggcrwryowfygenysticrxwskainiyigftrfypkrsaxiyssaktrxyntiwfkaoxesrkwsfangkgkapyfypyscgsyxwpgyskgeretpoctspsregtytgiosppkigcygxpskcanxwticigrsagyootcsxcergsiyciipccypfcfkpynpskgcgkncfgcwtnociwgrpgerocioitaxnewpoepwpciytknopxnprpecxsspptipfpraianyyowxinenwrxkeayygyiokxkrypsgrccoiprtkrpscypefrnfsxfisegcsgcnngontirpyywkkapttktwckkaopwyorsotpswfryfanwksrwgxgwxopwrxcgfippnparorrotrcpwayirngrgykpestkwefsiyrircikfswesiweypngcnxoocrgxaneawiweppnpiskxsnfeftpgxytwapyiwiwrffcaaowtotnoarofkfsxksgykskesxtfegciocoxeygokoceawrwyeaaiyrirayppkwacikxigxywyxafogfnecytipxownxoskcpeptasgsfeatxksaawkwswixniecyesoerapfikxrxkkekxeoeypeowgkkfexstkstsgyagnciaxwpwsectfeicaieneknppgorwfyxnpiyicwprsrwsrgefgoyakiffxyxgyyitaccrwgayixfcrkysgottxipgoakrfcoookowcwgrytwkerorgfwkynsresexaknrakgxxpitpgtpfawagnfxospntaeagwefoyfxfncgfnxrtoysiktipegrkanaenrccgntakrexfirwewwiarressfcpaynexkreyoipykprannynikftwfnxftxwsgaxcfssefwacgsyfoxwfocfywgwpntxnrasftxsspgxeynfweyaoppwyygpifggaoffrksaenwopswskgfxesstwpkcnynxnynooaepnwoxnntnwyopfwoyptriasgtwwxrtrgkrtiarfnneeacsyxngkckxntycgnnngaotfixgyssitsgocyetppefgwigfecnykxtenpgtrgkangtgsefigsyapagranxrkorpsaspfckskaknakpoeaawyyfrapsicknpcfnkkfgynpkraytgceosyfaeenyakoccrfrffoasrwwxrsxofykorrtekeotiyrciyfcsesyyxpextxgnprkykirwponxrcpenfywafsnstiwctpwyigxnwsktxgepnrcspwperacgirirpikekensffctraawrffsitapywwrixoofrcawcsgngxnwtogtgnonragfettsfkrtoxsraocrxxykpratwwcypsfiytrnowagwwexycesyafikncsykkxoakgiygpwyrpsyknxfnrpggrgxinpaofoawffiscespwceiowycnsrckcyxeswkxnrpyptxaoctyyocxwkyfifroyrssitaynwprokwixefykcprwncwoxyawatfoxknntxfxeoagtxxgsxwwfnifsaxtaeofcoiogkrwayescxssoxkxoeskrxfrrstknnponfyicfreceksnsiyocactoxpxpxcyefpggfgffoprryeogsaegeiyxyowsyirpgrspitoataxkketrncksfckaknkewckwsttfityokntntrespfinfixygnpwriiwowocggpwnygtarrpcgxnacoronktickptyxfagixxnniefgfakcstiicenxyykrcicxpswfssyfeffaripxgkegienaknfakigpfixfiyorgetytaskaynkgpotetonksnwetnisoatryxascxnciipakpeeciefoptieorwopngrngkocgkrrypprfkfsxwswiwkecsyewefppxkgrawonwesxygpwefapoogrkstwisfccrorwxxexewfseyxgfgnooxkwxknsciscitiyxtxsoyetawceooxtncfanatnkanwiaritfwggctesgktgtcggsfykrrkoekktgraoexpkfasifxfkawcyxkstgfrpwkrpofyepesykxpwroixigcpprenyncoarstwncsonpxoksfpggtrinawcnprgwityokeipeayffspcnceacyaakprneitxcakeknwgnyprxyktrcfntgiwstifacxertantwagroitaewrspkswriywpetitrseatpofwotogsokxwrpssgayixwecaocoptrnspgasaikkrrineenekfywrgfcgcrwcsefyitrcoxryaafftaktexryoapctyaxxpekcwkrweifaawtogafrcityrkxepcffsotkeatieiorgiwkicrwoycoarscnacrsffnspiyxwwytsnnfncrfnyeegosrxngkiscoanskrfxoapptgoefwiaciiyariyxweirkcpsxonpffxenagkefyttfwsgswcsrgapfrtnxrxgiigcoyygpcfpckrtpxeaewrsxwpngonfayecaksioiktyoxeaaxsrcpsceexraicfrwkoksiyskixiinyintfxsptporcenwxoffccaexgeitwcrktsftkekyfrwoxwnconirkpxkxrssxcskiwciowcsxokyinywskxfikoisxnsrisxcrgxgwrxwfkkkikcycwwxoawryrraxpxygxnsacrwpsxcoswkpekexkxtsfrasikyryctonyatnkkyxcawwaaoskagerstykctisngssgtpxkryxswyrokxnkrnrycnyireitiwasnekaryfprnispyaxserxsxatiiatrwwiyaygwwaofiynyycopgsopfpitxsketeafineipisoprxrtrifttsskscyxkrapaxfacseffypgiyrotgrrwpcoixxgcocgkxyerxetpkkicswekityyctonxrawanwgcopfsnfnyattcisopspafskcaeeofciriwnweaowrkrocceexkreaxefgksgayrptxsngwttnowgscnikweikiwxskpcocxaitkeaxwennncykraccynncicgfxwpocyciktkgwepenxxysfwcfrfcttytrrifckxswnkxspwpxrntsytwwwoieatcsnseaixwrectopftrorwpewiwaowitsefgsiwwatxxkyeatswinfixargfernywacekwpwgnnpikscnnnfytaeisanksntcriaspeksxnixcepgykccroywofsiaianaaxrprkgcwceaorfftywwygncwywpewaectfxayyarwafseigowgfgafktgantescornkgatttroswgpcrtgxokeoeoxoiyotipifnptginrnwwyresywrffkxwiywinfpowgosxoggnntyoycrgarpkcafnpeepkfnyrnieopcxtooeakpgoonsnoofokotkfnsfgnoiiyygfsyxcpxggwernxproneepnecaccxnwrctixoepegystptgrcowsrinffrgtfysafgoayrpaooeognrgwntixonyrexpiwpaopefcopocycktpaptgfeycoggocoeeorewkpatrswionacnpayectcogfwwrtwnxayccsnsoxoopayxeooreikpxnyaxfxkweagtentygryxtfikiypkresexctgiiikpyaokxwawryiiwwgiicttgtcraatgfipfsgnisytspnyrxgtrpegrtxrrwtnyngkencpcycewkossityfsrxgsawxpcfkcgxiaitrofefcapoeisctsrraerkfxepciawoeexoiwxrcpekweesgpwsieftfgpoitpwnryyocwcssnakgooirttoggeaniikepeigtssaantarayyefyxnfsapnkwwonfwgraixxpnsknokoicwafxcxkergiecpxiioysnewfwoaeecifgrseickasraecrfegxatkisewetpisyrrwieaicesotyntefcwfrspfktgptxigiyncxapkopxsofxtotfoinwiypyptwyegcraknwkeiwtxicaekeaspecsgetnfrsoeicsgeycygaaxfxyxprxckotxwayxiyacogtnnfgogixwkkcgpkwyspcianfayttxgppctcsyswoeppooagogagrstafpsgtrnaeccpngsnxwtkesaiaykpoaasankkcffronntknffcyawctoofaspretopteersokrftprpfeangxgspwfocfafcoxnxpneggokeaeptfsiorsocgainnrewryorpokpiexpcynwkeptangexopxkpyexwakgxpkopwywyfkskgcakxsrwfgxsryinwfrorswtfkfgwnfkikrrkwoxgscegixwcapkpogsxwfxkcwetsyetkpsrfxxtfpytwfonxxkagwswepspaxycosinrkweokxtsnyftpxotcwfwnywknageasreocnniofpirwenekgafkyoaksriiinwgpgppwnyanxpicoestpwopsxneoxgycsgerirtsffiatsorykgwsotanwoaseetiprrkrfcetfwganynntrxnnnwryewxwrtkfisnerxteiafxktxieifscytixfocryotrgfpgkeckagwywtxgaxkwwktiwatwxcipcwpcsxaeggissynaynrsnigktnaeraxeficcscaoweipgpcnfxksxrscyttoeiokosceoryopxwprrsosgrxckfkiycekaegearkcpyfsoxstaifnoneaoskcawwkettcfrtkxynacnaswyonrtrtcgaaaeserkyfgfgopakrnokiarotrpffytggxyssocsrggxkscantcytpgeipxxngietriwatteicxsafefpaesypykekttnyxsoieccnnggwyrkcfcactoyysggcctgcnxpwooyoeyoopspkgprcxorskwpryywocswgkcpyxiaatyockspyoreweyfekfeksekpwtywritnkgfcootssxkkxtcngrfriggwspcakyttptrprxgkkinirggssfaiyaixepyrefcygnwkwyyxpxfrnirxryrirksxcsrryepanfwrysyigptifcixctatikitpycctskaeepgeafsnkckcngwctepacfpoigxpxoxkfegiatxfifxxnorpxawskifaxganswrekksproannatseakpesknittapargfniktnnwxpafsrcpnsycpekfxnfpkopeiiwefgrcwxxoeasnktneeityekppityacngnwwgiiosirftiyawswipsartenwsyoxrgpffpoikricfgfpctrasooexfspwwopwpoipxknynetafckgiroggrxxtceitfoynpfifwwktcfgepniktwfenxwxrogspsyttwnoynsrfnxcstgaawpyxepogppsofwrcgaxskyakkxcokcekrgtysgrcngrexpaonxfcpcxtegaxgwwyfkrrowgacirkxgyekfpeaciiraayknyroxoapinenwrgfwkxcxytsafyyfcstyrnptnayseirsstsggtpakcswrtytcaniwknciroxisoysyortwtowcyorstteakrooctgxkcaffrttpwsywkgrnccticfrptttnwfwpcgxsrxfxyfgprsxfocaswgxcxoergfkyaasxcygoyftcgetgxpktykwtwtroeeprtgpxxcakxsikirgpepxrnnktroifkekpoasreekosscnteneieogkrpakwcraextcixesikxkgyiprfyieisstkpapcxaeafpegnsncpyiyxwfrcgsfwkxxipxexnftyyntnerinkxcgnstncwgtncakytirggeyfgkgxwgrtakkngnctkooygtsgcseniffirexcaxeapwgwxwykowytneinyfkakxtkocfrfcweskypnweweifasffpixnaofpixeipnywfiektcnpfgyesywgofrgkreretifxsnccoapistgoysysfeskrpwettywfrwryppxeyogirfrcrneneiepregxaoneegtfikpiegryfnststytsgtaxgwcxkyptkgotnfcktirnxraxteayniyfetgkoiooiewwtsgwanigsnsfrtiwxtnstcnpxpakcneoicakaaatsfyrftsipcniftrkptanoenweigcwxtxatsgpeaopgyeixxwnwortfwwgnayifnroiyarxkiwkyagkcxrtoytsfnrogxrxfcistypcttikncagirepcnoopsincatyacnyayfpewcgognorawieactyrfgkgpnttteweroppeacpsfxawystkkkekyfsfgpekffnwxyynsfcsgfrcntrnnwiwpogpokcgeaxtpnyaftsnsoypwksgwgfockytffsnakonsxpxrxnyoxxkeowwrtronttrfaywtgfyfixyaoigtfnkieefxftttrsirxwokrefcwtifrkikprskgpinsogycwtntknxpefkiiyiipekyogiyffnfxayycyrrosgygycwpxioxttiaefexxwtxayknygpiepxpoekkagficptegywtipgpitiasfnwxtiawpyxnakyfsfxrpawoswxxowrfpkxxwipxnoaesescirigctyngkwtewnnikrfwwissctegiptgckeoagefanwrgnooiasswfiirfisepfrpciwtrroprfaioiciaonifsiggwcktkicktaagxffowiwtxaispciiwsxyrieaiopknewyxiwasoxefiiyxrxrsopgrnnoaacancewswofxpnrgaixoayaksfgyngcoxrgryywgseyipogeekokiopwixxokrwtffeesgypawkakcctrnsopriagpeifnrtxtsykefrrooyefafoopxrgeyrgakxwroaixyxornsgfewwciwrcprkeskaptnswcnysgikfceapriyigosfooagfosskycckioewrtxnaspktrsypwasgeoncnoggaonpfgrxsspfofnctfkaakeywynagakpncigwatyesowgnsgnwrwenxnaogiacwskwxgnkcycwfwckgirprcifxxsfwawwoswrgsekswocrgxycikoksooegyaecrfnrwrnowcrronwcseefppxssornsyfpngrngtitpktgaawgoaoyitfexenpyccnixefgcaigifwasowknerregxekopsistffxtwnniaxxgooatgpaekpcckiwnytckcexgwarstewrpoieeiepsfrsrwkgtgfnysfrkspopaawepixatoyoyaryagycyexwysynoiriooyfweaytfewxcagxkoxtwstwocaowfergytfsoxnegryatpitygsgysipeerceyngxxtanwwkgaerxxnkgewnpsnyctxeotxproketttwexnanffioocnprgoxxgxfryeirfyntkpxgxfippnrknfyrrkrownioryygepotrppeoeryryrtystrspgsotwkaakngaatowepgxkigrpspyxrnytkixtgaitenextakpoeintprkekanstrepgtafryyiwcewffyyfpyepwcciwnstpngkksexweaktwxageyipwpekrpkkttktrnrttcwyegafwynpgkricakeeprsoxsfsfaxfakkcywngapeikexsogencawrypyrnowcapaxgtkcegafxsftatnscoseceyogfoiakypaweigreayngfoyaxpeicfiffoayyaxfeiasykrpsoicaasxxryskieswiyeyaarrckyxpifgoisgoeywfwxcorokraekctkanxaispesencxcgirgxwestptngxfcekggowcxoicftfxryyixeorxoxcwpkkefrkrgkgcetiwfcgfixyynyncxngscsygxennftwiionyttawiakpyfsgyikctsyifykxgxtofoopoefkynttpfkopniyooineaftntctstkskitageckiyktxwfknecptixftkwawgfkkisrfefpgnwcxoygonftayocgtyipaxpoacitiggitrinkpstptxxwapxynpacogtowaywfnowwrspescnsckykorxixckaoftystpafwrnypapepcagpiraoprftakftwnkgrtkigngetxefnsokywypcipewrnnpickxkexpwrgscrarwswxxntikycytfierwenxnrspycyfrxpiyxcwocixgsiwognippggfpptionffygffrorapcssyytgkokirioopggtpgcgetnnagkcepycxxppskxeissitrgeiiwwnyetafarxxpokcincasxritrcwppspoxyyfcrnottyrypoxtrkyspfsootgasfaopsrkyaxiwtaknfkriorofipweokniaorignsxtfnykwwxetaenrkntisxyxyrewgfpscnwkcgtciakcxcecginyetfwnooakgrinrengsxrwtxggfpxexknatfcyceeanniwoskxitrierifntcacpwnxatniaeftasfapgcckawesgrwssxxcekfowyefcxfkoreratxwtkwacpknrwiwiwrwgorrwewosaxarayaxyepwaayatkwnwfxectiowpkgoirfscynocknawgwseckgytkspgccnafykppykskcsoyowgysorggwiagyoownnpkctxswfssxwkoxcoronawwsaxaaxcrrgxkfcaknkitorcernrforwywkostexypnkkxftcnoygkwcoytsowfkgtfeawgfkiyyawecyfapnoxracnsnnpnrkkwacgaytxngcaxytxggyxsryptaixafwanrrfisaeaeptgccfyrrtinpcwfnecyayexnafocxpsincifwrtpnnkyyxcwfstaixtpsopwyfxkyntaxinweanegypofwtscpixgnskktsrkiiricwirfscycskcnxffinotwysgkefstaafwwccwctaforwrentcikesktoagcyrwekpnckapfniycoiposwtpkeypfraeacwcakskpsfngoatcoegarwaocsffikoaayscerxrxykorstofwwsnprppoprakexofenyftrpxeewaawkrewgyrnoosnscasnpkgtkwowysecapaerggcawgarrskkfiyeinrgegpeypgriekscexriaayggeipxywcanstywoakoxkeeysntycpoisgxxgiorpyiwrnrywotwsankccrxccpxxrrefsorwifptxxpneakiwgxgepninepxnkanxcsxceafgsktcgpeoppepnsxtfkrpfoyaeyrfacxnagxnpkgckkwkkpsxtkeearsctifsyswpxitfxwrosigrictyxokcwnsywxprxcapfokifyiwpnoggfcxntknrxytnoryxaoncwwxpsfcysoggasspefeoyokpiorwrffogatxckfwcfrfkpngstgiriaggetwxfxkxycgewggptnfosckkctfaknkkofxtonwrrwswpeffapgfepcfeseatwcrscxgaxtoexceoyracegotygeayarkcgypiynwgfpkkoctrpyweiosgygrryxffaogaygxneskgyrgfacnnkexnfoasxwkffetacsfpraeokxasagtfnnkoyxffxkteyyynewwrrosfwtcaorxipicnfkcawpnyfxyigosoecyfigkgoeswsxciyctgwkkraysokxwiewarwnynctktwciagxgxwxpfgefeoxfassxnigtneptcyxxscwnxxacscooerpxptsnsxsxksnytcksfkxnixttckapowxtaixwiktgftoxwgospfefeyetigrkgatykneyiynxxitpingcxonsiafcnpkynfknrapxspwtoncaesrrckayxcxponigakpeteeonewyycpgnxsoftraxffknwkkyrnewtxyrtnkkffgceireskwgiengspggxyksytefktcrxyacksaacikanttyexxaecxortceasataxoorrrtaktepaipckiekwsgtxworggwsywiyfpknrwstxfcoaorsgtwoeiginttyexpfntykysrykinntnpaicisppkagoprnseoifkxniyepssysewiarsnepxstoixygexxxsxctrikkxysporkoyswktnxwyrorofaxxkxytpwiynxwpaipcnsxcfrknxgtgpweaktwgtxoxnfwckyyesrgtxcfwsfrnygraywpecrysaspxtfrcotiwsegcyfgaiikxyaakiarncgeefeoxwceinwrgtksytcnrokgcparcrantpssrrntegefiesxgfntirwgexrxpsxowawefaaekccegyewyrnixfnapfykyiyignswswsicxsgeitocccfiifokpxfgncxayewcfofctyrxfoapokgrycwrxnfnckggkgckcnxopwiopkgoagrxeexggroofxkwxappopiinkgaokgtoxgytisgroeoxngwkkirkwooiponxoanacfyyrircayicfyfykkpwfoegkyswwpopxixrcrnnecctakyncrkwtgcfwsxigxyektrwstrxxnsycpcakfegntnexsagxywsooipnsfiicgsforpictgfagcraytptcginxwiietkyryogpfyegtfckaaowtnksxsskpitogceysysxteostgxyaaipgntsntfswoygtkpeyoypkaeygonxaskfipxecnyyrwxkgkggtfascoaeixtfaattwxtxttycxgpxtagfcctfssffxkxycyiexgncktgcswcwigocxcickorfycsacofnoxxsckwacpicxeawffrkayicowioesisppcrtrrwxkiwnstocnsatagwrttkfpttfkaanosognexaxtanxpcnsongwxsicktikttfccceprkrscnineofcyykcwknfiryogxygspoxyfgertseokycskcnonpaoketonscpyngaoxgnarysrsstsfyaxsnyctfoknosfxwxeoapccypfnyaxxpfswosrytisfpeiwpoefkxcacgggxpacifyafscsnxkaiwkgkwpwkoynisrcnkywgypfoykxgfowstggkakpcntntxnxrnwcinpkonprggyrtacsoxrgkpkygxrsowptotaregsxiewoknwtwpfyiayyypfpyngcxwwwkisrpteksfkgfafsxsnntcenciwwiracirpxaetgrfxgtfpnertotkoiwnfeyfpixfksogwefogwnekgaxacwkgfgxpytporcccaffgcnapxixoaoicecfkeiotgrsxyxfrwaxcyiwsogkcwrcesntxcanxcsprgipcfyiixwytpkrarncawacwaisxnxftpnfnccoyxygsfrskoxkwnrfeygetifrixfernioywtxoianciyyopnawyxxosrtfgpitisgiwfsgypaffrtcfnryyexfrgsorrtwsftewgxxegkscawokockyaetaangainsrwagwygkwcnryaexctfgaosfyxxinrnocrcxxgytaaixxrtegeeoasopkyewwpsfapxwygxcseypwxrgyrwfcoptkeesgeftosneaxcgykirtwtgfggfeyxxwnyytkygoxwxcfoirtneskffycorgcoywxnrfgapagxaecggxgkyspwafaooitiwkntrstgwattpgrgesycfsktsycgsnenrkfwcfyxaokknkwowytowsxagggtipexiycrystsapfwtoraotstxsantcraitwoxacgefftyeeynsewactsgttfekecsxenipgrttgetffxoxgxkxancwefkftxnccrsrottiytnwkpacafsgkygxfnoponrgrcygyrexiscyscxgkwxexgwyxapnnwfowwckpixoiwppfgeonraooiwcftowoyessweagsccygyswgtsetykicfeewisswnyfcaeeyrsgyfipatynewwfsygtfaeanfgipwwexpkfyioopfgkwptgacnatrcowiockpagpyatekfpwaoysgfoerpxreoeawwokesocssyriktxgwfxtewaptktonxytcpsryyiwktkeecswecifpirxypetywrangiarokicgnxkpiwnrcopyapfktyxwestregxfeftksoeerfwtcsctfskwsanaktepgkrcsooegakxtyfpgwerefrxxynikgofrnyaafgpckewrepawwrswcxritawecxngktecgarfrnwisycpssxiieacoakrigkffanytwiowgasriwrnggoanacereyasykyxwprprexpixytfyeisoctrirsaaaeewofkyxkpaxntwsffosyiiocywcicxnpyoacccogfestkptrwieccwikxpikgngakonnxaocnpnreageennsyeptnrocownoossiwsyyigccagfrcwswafferypfayaagfxsyetwxfpyagnerntofafooopxpwaorayrfiysckakfcerwitroppxakkaiokaraxcpippxxginpffrosiyykienetfxepiisaeaooirntxxrseynppcptxwtyfcgerxnowoxnkrptoyoggregiyefioisicwspscnrwskexoffwtxcrsofrcrkksxrttgfwpypwwkonkfckknnwfgfanecpascgcxkfayrrkiogetctkcoiopkffpkafyrowogwgoxfiifittfxwsfctiseieksisioxewsnogprkoriiowpioexrexwrargafiktywoctrkkngtkyntaokxnsktegxewfwgntgofnonnaecyoxkseywtnpcsekxfiepefyktfeyofggcfcikktrrirtgsepapgfwgyexeoxpcriracscgxiaikwxxfckacgpyetogserpiitawntwgxxnyinsoogpssgirgrnrwtsgfnegpoawkgtgececwsgcpaiksgwixxonypnpegwttfeinsgxcpcfwtykanitiayxrgwpcagxapteckayeacenpfsfeyaefarfnkkkwkieonteakieyftniegiisakksprecxcrcafageoskycnnfwescgartaoaxykxgfnnycyggkkcwwkxnryxeegsgatakecxirgoeynkfpckaoxkkwwtnxaxpnyrfgiyfpeerrnswewikaxcekrfcpggpgfxfgeftwynkfycgepxconxrioiyecsknnwoekrfnwkksarooiecwnxxskeepiiaaskeyfeiotyrcpinicagcayyniooxeeiyapyrowgyrffkrffnxotfcftpgpfcnanigkcfirxtpcaofesasrofspicegeficicpwnrspkaopcpigyyonocteraepifsgafxyeaosprnskoxoyiixtxkwsicowcopktgsafxyprnoakcytafyipoppacepxycpsrcfitiianyxcsniecreefpfeckpowroaaerkfwwwnaaswerryafpirppcgwcgkfskwkgeocansnfoytpwapyaxtnctiofgstteicpgepnccpsxpwtrfffgsseyexriygfcptofyooaaxnaforxciytkkftfepoyerrciyiowprfcrgpppwfiekwngfpfcwskcxxwyowprysekrtcpkpgxfawiiegcggcptxenxystwkcresxopgceeasnaaepwocagfknkwgxkkykwieokftyftxpkeyrproontpaaneapsssrwtoxkifkgosnorennkagppcwwnekfiopawpaxwatpowcfffnappssortaeixawwrafptpfigrxakertrkfetciswyfnacgrxtarepnfxnrfiiaxxofsnsagarsrtkoaggfsfxporawkxtgninpgwprkicpxeyswtowtxkrkpikpcnkpyckwwteawiwcfwwfkptxffptrniwynngroonnfoeninixytefkeaegkswircnsikoscctxtwgcnpfirocyxetpccfykipgecorcsswxaepxweyknfiagafsarkopiaxgrkkkgcysfxsetxcxkkpnxafngpaxtcnyxxeanpxxkyynycpwsgorkepnaoyfwkyeiegsgispstotwoaifywwpowxyffooyixxetktinwfiockfiiwioakfaxysxxxwpepyrexrcptsxkofowrorgweckexyfwysxnoyxrfpwpwrtinrwoneoxiannxnpnitenwrrcayrnswetyrkpeatrtxyysgytysyoxskecgynikowtontpgaanpaofokrwogwtfewnktrtiyptgaewyianfpgoftfagcficyecncyyrkycycpwaprsssfpffknwntsitcynxkxkwyrorfpnyyfegfkrrffignxypscggapngpoytyeggxakkkaneretrgtynyoaetcytxpgkxkopncparirptkaognkgwerorixfwyopxneyrireenfcoxfyixfekeenrieskrpfcgeioyrwskfpxrgxpekcpipxwcwgporkkxotatnanapexsfgycaykwwwcrxtnsocwgieexfsinispaagowyxwoagoyiixeggniopxgwxirnfxptsfiiwxoefeafxawyafgcaixkrnpawwkksapetrwcswwnnwtogcxaokwtxtiyknnxfyrgsaiyssnccfaaacikycycrftgarwifanwsaesfswcsgoiggoenkkgxtaaronpsgatssfigwyoiygpcpngykeksnccgckttricsapxtewgyigsiaetnaciaiwpxfoxienwtyeiwponpgpseprsagifwiknpaywkwixtoarneycgxeroixapewyenstgnrsapykwsewoweayeynifxsesprastkyopncoiiyppxerckraaesfstsxpekernrfwcsropacfxgrwekpkspifgisxpgsfykpgpwwkgefetxtigetafaroeyenyrkptepcaofcigaioccpwxpxpxarkpggepgtaxfcirsptknwfsnptracwirnafakgafrrroioiitroootxakcnenygiccxktfyiirnkxrpctwsfofrsytfweasfnnpkkekptagyspgaonxotowogxafcysepigcgxkaywcetnoccncogtpokkxgitfgnoykkpxoyaxaegggixiecwwrfgsxtnfpeesiwexfsptntxorksokewpxwopfocsypckxopkaforprngefxtintxgfeneoototoeenxnanxoktxpttncxaortkfitwxgftgyaseacnrktffkoekicxfyngrgykficnksoegcigtiwwkskgtrxatwgyofweiyayyorxgrtwigowooneoyikfefkseigkaefxinyetgeffwaoxrtrgnapairicnpirkggfxfykygoftnktyffpfytkppiagfftwcyaytrotefekffenieypexgyisascxkipcxrpfestierfwcainirpysnwoatfopayptarriteteonkntaesigwpeesanpagwaosayaaagrfcawkrnfergraxegcwgkntxtprpgfkfyffwfwsssopoiawyfetfsexonoxnkxxxpgaxnwxspyeaxnyoofkkxkexonwpkeoirinfpifownktknexggswycoaakkaixipcnpwpgraoxgwtyoykkppxkaywkpseegpxogrnwfiokteayawyneptesrckkrwxiicrrtgwykyxysenrnwpiwokocskxwkfowstsfykwfwktoeonxetfkefnitkagxaxcsyiwonwwaxfrcckawxreroogentagikeccrtaaafrngyxenyxctfcktayoeaoeaywgpyicgirayrptrrkgooisepepfgrotoaoekpssfapiofxaegnxepprwtrxwsksxpsieswixwfissoniosyyrygxstfprttaoyfetnaiywaccrciexrcpwcscwernryxxesksrxookgtigxcffynngagwataeciopnwxogxnocftnntrpnxeffcpaeaptatyssrsfnafwstyoewxksocxrgsogxngnkcfaastegrpkynniayrasfkprpnnkprkeaeicagksxscwficitfipswccftrpyyxctkrtrrcgyftggaiwkfrekeasrnxkrcxcfcyenxiyscokorcnspagkiootpcwoekgneicpaewgkffceifwikcrnpkscixsckpnrssyckwpcypxoccsotoencnkypreyycfocapafysesrawkckcerxierxfxaxrartsnxowoforoiiyfgtapiycsaexeaxgpkakxnspipeoiryaopyiysgttncynretrickirefreoterwakaxckswikcxktyrfgiywtnwrowrkyfawtrrexirtowkfcxknkoorfxwcxrpktnkprkcrirtcetsnnnnrawxwsaaitrgwrkcfagipwpeigttcwrtsegakftooessroxasxgkwietnyypcfoiswwxkseipcyxwkcfeineowirnegenpafoapptffiookxnixsngsspkfwiwsogaeggsnyotwrinxrnfinrseyaxrgeairnnxrxxneriefcypewennsstcxotytscoaxiinrpefxcasxkkpcesrfnxecpyiyyfyikfwxxweosefkikscogofiotryewsypiwckeriincyorkkfgcpcgsiwtgareaetcikwixxpfstexyrtfcfexsnafxskktntfwkonsppgiiacaaeoconngtxaocnocxnsiaokynktanffoofgcncxifpffaspxnyrxgsgwnyrrgperfcieayfxtytxrgnfffykefcepgyisgafyswfgckanfspxegccfrysasawiratgtixctgcnnpiecgtfyncyspxagigertnnkyagakpensgxwaipoifofesirgwtenwyxcffsntcikkkasofasowctfxaroeyfwsispxtpogcosronickryxikgsfpkgfynsrxcifsystfcrngtfraotycatiyifwttawpspcxanikrntaxrtyfiaskeiynxworpytopgcsntcianwpiwncsnkntfksififkxokixgcscieipragtkawgccrykeoafkntsnwynafiaekcnanpxftnwkwrwrnfagwpnreirrakgggyirygxnncoigfxiftxtkfsaeexyakcoxfeysxnwwagyyrkessswgtooaiewkiixgwaxsinkcnaexyneycrrnftepxkkycekkxyoysacaftacfygawoawopxxwspwtnciiwsoacytkpopianwyncosytafykxigxaftpierxgxksiirxkoktnwtwxygxitrxnksckftaoxfnifskskicrweapcryyenyrarftekgofaxraictsgaesaiyryswiwfraraiaosixxyesnxrkgrxokwepieantpkkrnfsefxatsygewgogxxegkcxsenoecxfroiiixforacsgxrygtessetpcwfkctekrftwysinoakcyewwgisfrcgrneefoofyrpkfesesnraieoteinnoccoexckxnnaxsoioxttkiyxnxantkgotagoaisxnyppgtfpscafniwancrxwnsxxopggtxsyxtxyxnatwkiygkkkwncgownxoawygtsikeacyitscxgtgpcfckccrpitapeasiapnrxrcxtpwpyafnaxxnwgtxnpcifnfnpsygoofcaiekkrfxfnerkxxywgpfagtgnsacxwiyoyyipsgasyyarxapowrfrngsorpacookingkpcgtnigosgfxnifkycwtxnrcaprokxcrixifnpeeoakwrriscckooeggscwgsenawckfssnycfpkcxycanywktireycrgkgoesoxftiwnttpwaasrgowpgyckfgsenseerpfassxosantcskckeoareskwokgkpyyasfcorckcgyaawggyttsxtoextsrgyxotwtkfanctocpwoggyksrcykrgargaxyxyyaawyxnxwxioskygcgxcrnycigfsieanexwikorkcgkcksnasnkaw\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 429,
        "task_id": 4108,
        "test_case_id": 10,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "wepezpvhvuhqhwxzwvxxzlxxzxwheuuwhlwhlwhzqqeuqxvzqwwlzplexehhzvxwpzqzlzzzxveephexqehepwwpxqvwxhvlwuexzwxwhulueuvhzvxwuwwhvpzlwlqewuxwlhwwwzzqhpxpxuvpexupuwxplhwphxzupwhvwwwuzueueewlhwuvzlzpwqxqpvphwxzpulvlwuqewuquzlhqluhphhquwzxezqwepluewvqhzqxpxxxuupeuqxqpxeuhwqwhwvpwwxpxzuhvlwzphvzewqepqvzvuuqwwellzxlvuexqhzqpvluvzuzepwqezpluhqzhwzpupzqxquuvlxxuvlhzquwpplewqvxeupqzuzplxqqxqvlqluuhxwehpqwwqeupzvxzweuxzvhvwlvxuxppwlhupeulxxqqxwevhuevqhqhzeuuvvuupqzqvhlhxhwuwuxxvqzqwxeleehplepwpwplpvxllpezqequvwzlllhquxqhphzxqluqewxullxvleuexxuuphwxpwuveuzlvvuwzqwpqzwuuqqlpzplezuxexeexqvvxwxvwqqzqhhwzpzzpqwwhwxzluqppxeuxzwquphhweuqhheqvvvlpvqhxvlvwlpueheehxvhpwxlqqvpuuqlqluwzxwlzhqqvehxhqqepqvhewvvhevhqexuhpeuuzxxlxzpvwzpuhvvzhlqqpxevlvhxqluppwqxzwhxhqepzvqvqxvqvlxhvzphlvhzzlhuvzlvlvzpuezlxhpxhxppuuwuweqhpqquxwhzwupwzxvzlwuqlvupvupezevzwuhqhehwzzqpzevuxhxlzqzpuqevwwhlwueuqpvxqepxzewhwexvwzluevvvwhqeuxqzpvzhpwwvzzpxxqvlxuvzplewvzleqhzelwwphhlzpzwxzhuvzhzhxxqhwewzvweeeuplqueqvxzplquuxwlhuxvxpluwuqlxvuvvxzqeezpvwxeuwullxwlzwhueepzpezwqxwhuupzevzzzehzlveeuqlqqlvhzqueulqzlqvzwuuwvhzhzehqlhxlxwhuzhlvheeeeehwvehvvehhvxluvqhquxeuzvhulqxuwuxqwexwwexwvhpuvphexxzppuqzzvzpulzexxvexpvuuuvhhzhxpuxzexpzqvwlvupxqxpwqxehelphheppeuvhhelqzpvvzxpwleeupwuulwuwqwvxelzwzqwxvullulvzlplwpxzwxzeluuwhhpxlexevwulpexqqllwzquvepxewwlzelhwqvqwpvewwuuhquuhwwqezqlvzvxuqpqvlpuuqxllqwhzvelzhhwexpqhxeellvwupxxwxlpzuxluphqqpwuwwzuwxezzquxqheuzvlexwlqlplwezuxzueueppuxeehzqzlzlqzlepequzewqhzhlhquxuqzpzxhwwqlhhvpqxzpleveqqhlzeupqxvhqzulhwxzhvzxevuvehwlzvlxuuuezwleuqvxllxexzeqzhvlulwpexepxuxpvupwvwqexlevhlwzzquzuvzpehwuehulelepxhphwluzuehplewqzxepuwlzlxlzuqwxvquzqlvzlulpwwehvqqpulqvhvuuwxqlhezhqephuquzhhhxuuwehpzxzwuzxuvevxvxqzxquxwzqvepeuxzqqeeqwzuwzhulxvqqqxxwzxuewhlplqxqeluupwwpevhvlxpxevpxwxwewqwuwphlqzpzxwxquqqqluzzxqlwuvwuehpxwwhlppqlluuhhpuxlhhuweeqqqvwzlqhvhplvvzelzzhlhvzeeepxzulxeqqpqxlexlwewexxzpllhlewellhlhppeewvhlwevhvxwweeuqeevvzwelephhhvlhwxzzqzzwzleqxevpzllzzzwlplxxpeeulppuuulzqqhhllpxvwweqxwxxeqlqwwexeezvxqhphpqeqxqqqelqvuqwevzlhwzevlzehzwxpqvlpepuuwlxpwveuvqxpwvuwuwuuzepplzzpwhvvxeppwephvezhezuvquvvphpxzqlqhuwxpqhzpwvwwwllevllxzeuuqvvvzzupqlleuvvzwwuluepwhpuupwqvuluexxzveplhpuepuzpzuvpzxuwvxhhpzqqhuqxqzxluzuxezxveqluzlvlzlvwphpwqewhwewzzvvhvuwzlqpxxpvpvwuuhhzuvzlvlxzvzxlzzuwhxhwhuvepuluuqwqhppvuvpehwwlvezxwxeexqxeqevvppxzlzvweuqzqlvhuqweqqvhzzuupppuqqhwuewhuqwvevlzluxehwhwhwzvppehzzevppzuqpxzxxzxpxexxvhvwxpuqlhqvhzuwwqvxqqvxwzweewhqwzuwpuvxxelpzheuxqeuxqhlzpwuplqhqqhwpzvwqeqppzppuhwwqxqwlpeepxewqqzxlwqluelpwuhxzlezvlqezllxqpluqhqxqwexwzquqpwlqxheephuqwxhzlzqqquxhwxwuwqwplwxxpzqwqxlqwuvuxeqvvvhevuvulvhqlpwwezqlxzvxpplewulppqwlxxehevwwvphxeqpuhxluvwuhhxvqwuqevqheqzzzzpxlwwequpqqwuhqleluhzhxplzpuhvxzpuhhuxwlvlvqpepwhhvqhhlpwqzuplwqvxxxzlxhppezvpxpxlevlvweewplepppqhqhzvhzwxlzzwwxvwqevxzzpulweelphlhuzuzlluvelpvphevxxlulevuzulvqxppxxzlvxqpuwwlewuvxzuphluvvhzxvqqquhwqxelpuwzwhuqppqhllehvpzwuqwlwhxzlzuvzlzlhxhpvvevhplvhxezpupvpluwwwwllqzquuwphulpzelluuqvxhhxxvpxwvuxleulvqzqlqxlwvpuzqxlwllvhwezvhlzwhqlexzxlvhelhqvlhzwhhehulzphwqleppqquzeqlwvelwvlxhlxulwxlhlzvwzqqqqwevhveqqlvlzqllxexxullevqhpqwhplhzxwxquewzexlzvhvxeexxqpxeuvuxuxelexzhulhuxxqhepuqhelqxxvhvlvxhuvuwwvexvvzlzupwuzzewvwpxuzelwxwwqxhuhuhehhepqlxqvuvqxwwwhhvquzppzheqxxzvxzhllvzqplxhqhevzzhhhqzxhwpwuewwupqzuqeexwulvzuzhhzvzqzewllqxxxxlhzphlqelpqwzwqxphvezlpuwquuzluzppvvlqwqevhewhewlzqqvquqzvqvxelqqeezuxqweepphpqlwuxhqxlzuzpwlpxlevqzwlpxqelpppuhxqpequhqzwllveuqpqqqxxqhxvxxpexuhvzphuxwwpxveuulxpvxvhwxqzxzullvwwwxhhlxlxzzxvwqvwzzvhlqxlpuhxvxhehqxehplxqhuelhpxxxuqzlqwzluxqlwxwezqwpupquexqzwzhxuzwewvllqxvuwhzvzwuvezzehlxphxezhhleqpzelqphwuuelvxhezzelexepvqehqwpuqupvvvhhwuuxeewulhzepevzvvwuhpleuvhvlwwuxlxezzxlxqvqqephzqeueexlewqvzlhvvqpxwllvveqlzxepvxhzwxvlqxxqhlhquevezqwlvpwqxqlhepvzzhuqqplqppwheeqxhwqhqhlwwwzxpuwewqlevzueqvhlqqeqvzxlvzpveuuqvuwlevhzehxpleeehvvxpzwuxlqupewxxxvuezzzuxphuuqhvexuzxlwvhvllzluuehlzvqwxhvhhzuphlhxhxvxwvqqvwlzuuleuqxehuvpupxwquxpezwwzwwlxvulzxwwuwvvvhwulelevhhvhquepzhvxzveuvxxlupwvwvzqvwlxhqlxquphevvqeuevhhuqhhqqxehluqpuwquuhwzpzlhuuehwpvlzwqlexhzpqelqweeuzhpqhxlxvwqwhvllzhuezzlhzvlqzvqeuzqpvhwwuewuvhqlpwupxzeqhuwqhvhwqwlpvhzuqzxvexlzuqzxxvvxueexwhzhezzelvvqluqehulxweqhuvllxpwpvxwexqwelzqxphzqxelzvqevxhlzupvpxppeexhhqpeeuzvpqhxqxpzxpwxphqxewqveevqvequuwpvwpqqwvwewxwvpwwlpllwupzvqeuwhleuvzpheeqeqqvxlzxqplxwhvhxuqqlxlpphuuhwwwuvvuzewpqlzvzlhelxpuwuqvqzxlxzqzhuxqpuxwuvqvxuexvvzpzzqhuqvzwvxlpuxuuvwzvxlhwlxlqzpzvelzwquxpxqueuwpuullupheqexwquvveevqphvzllpveleqpquexzpuwvxweeqzqvxhullvwhwuzevwuhuhzwexwpxppzuwpweuweuhvuzuxwzpwveulwwlxvhezwxhzpullvwxupvhhlueuuhuhhzluvxqwlezxewxvlhepulhweeeqzuxullqzvpuzwwlhzxqxlewppwuhhuqqxqexhzlvqllhxzvphuzqwlxvwwqvwzxxhlqeqwwxeqpxulpqvuhwhuzewhhzuewzxqvqpqvquqlhvzxvlellweqppqepevxpuhqwhxwheqhzuuqeqpwllezhlwuhxxeeeuuwuzxzhvqxqpuphqhvehxweqwpuzvqwqveelqlllzqvwvuuzlhupwxpupplhzlqwqpulqxlvwhwzwvlvxhppuxvpevvhxpllppzulquxqlxqxpzhxhhqlhxxzzzhuwwepxuxlpexwvzvlphvxlxvpvuwpxhwqhxqvqwvueephwxxqxxewqzuevevwwwlqexwwexlehzeexewhqlzlwqxhhzzhpvuzxwvzpqpuvzhxwlwxqlpevwxqlvevzeqqzpvvhpllqwwwqzelphweuwwwzewxpwpvzqxuwvzeuxlvwpzvuhvuqepqevehwxlhzhvluvwlevxlevxvlxeqpwhqwzeeeuupqhehzwvexhlewxzuuuehvhlhlzwlxhepvvhexuzxzwplhqqpupelhlevhvlwxuvweweuzpqhwwpqeuheqlqepqzhhlxpzhphwpwllqhlpxxpzwlwevlxxhelvlppwuuhhlqqzevuxzpulhluqeqehxzueuzllluzevvpweueveuuhvpeuhxqwehvlueewpvpxpuwwxvquuvzzexhhwzpvlhzuqwwuzlxxxeuheevepqqpwlvxzppeewhzhuvvwwhhvvvpzuqzpqpvuzpwuquxepvvhxqxlqvpppqpvvveuzhqzzpuhpqlhxhzqphvzehuqzezhwuhzwhheuuxxhqxzzquhwwwewhelhqzqqqvqvxzvwuvuvpquqweqvzwulexwxlquhpzqwvuvlpllwevluqhhevqzpwzulexlqxpvhvxvzzuuevvvuwqeeqzzvwppwxhuzqwhvuqewuuupzpzpepuvvupvlwpllewhxppqhevzzewxpzuxevvvxvhelxuhwqelxzeqxveqqhwzwhwzhhlveeveevpzzpeuvxzpzqxuvzwlxqewqxwvzewxxlpppwvqhlwzlxwlwelxqquuwezqexxqlzzepzphqlxlhlwpxquzwuqhxhzzwuwexhehpxzuuzvzvvwzqqvwxvhwwhxuvlpleevzvqeplzwwwwuxpuwhhuuelzeuvxuuevvuwpzevqxqepzuzwplhexwplvuqxzzpqezwquvqzvuexehweuxwpuezexpxuuluhluqxxhxvxqwpwevwwxpqwheqxuvlxpwzvlvululxewluulxpulpplwpelwvuxzlpluhlezhvvueqxuxxvvwpqhlexheeqvqllxqupevwzzuuqevlwxhlezpzleeewlhlzzxxpqwqxzuuhxqxlxuzewlqzlxvuqezzzhqhevvuzeqlqquuvpwxxzvwvuvvhqhuvleppqvqqwlvqqzuzvvluxlqhxlppwzzzweupevxuhzzevqhupllvlphhupwzulppeqvlelpqeeqzuzuelzqpulwlwqquzeuelppllwxppxvzwhhzzxzwxpvqvpxwhxhlqluxuzezupqhevvpzlpwuupxxqqezhuxpvwuxzpuxlweuxhvpewhlxvzlqzzzzxphqlwhluhvhlxwxzupxqzpvplpuzluqxwxzuheezzvvuwxwhqhxxxlxuuuxqupuqelqlxqzqpeuuxqwvhvhhuwupvlvuqeqpuqhexvevzleqwelhlqhexzzlvwuzuehwlpzwhqlpuqwpvupezlhhzlzqhpzvvexexhehuehuhxzqhwwpqueqwqhheehelzuexwvpuupzlvqhlpxuluqpweuwhqxehhlvupeeevxqzhlvzhvwwehxwpqzxvluzxewvpzllhwwxhvzupxpuhwzwzzqhppuhuuuqhwuvvzlvupxxxwehuzhepwxqhqxqzqwezxvlvpppvulhzweeqeehevzpqlhqvwelwuveqwupepppwxzllvheqexhuuzullelxzuqlwwhhluxqueqlxwhzullwhvxzhwwxvxlqepxwxzxlwxlhplhhvzzlwxlxluqpxuxpepvwpvxuvpqzuxvwlquzxehxhhueqqhevvzxzquvlzlvvxwvupxlezxxwvvewepzuqvwwlhxqzxzzvpquvlphzwxlhquuvhqpellqpvuhvvllqxvhwwwqxeehepqwvzqvpuulzvhwqpppeqhxevuvpeuvuehuvpxuwwzqvquxzzxqexpqzxwpexwuhqewzpvueplxezlpxxhulweqhhuzlzhlvzpeluqxhvwllxqhehlvppqxqvqhvevppzvpxzulzleewuqezpvlueqvxxzuevvxvzuvqxlllphepelqzlqhhzhqvhewevwlzxhhweplellezqqqwzxlqwwvzwwplxqpxlqzelvqhehwhzpuvxleelpluzlhezxvppzzhqqqlwvuwlvpvuuwulvzhuphxpzpxqlxpeleqzxvpevqhexhelqhpwvxeepxvwzuxevqlzzwzwvpvppwhhuqhupphuquhuwpvlezeqqpwphwqqxpxhhpwzpxvuzlxphwxqwlxqxvlzqvpvqhpeuzpuwzuepzpxephhqzhhpzluulhzzwxpveuxzhexwwvpevzuzxvxzhepwewwxpphvzqlqzllhxwzpxxeexpqhqeweuewqhuqxvveeplwzuxzzhwzvuquuxvulhxxwxqxwzwxuhqueeuzpqwzpqvlzuvzqzpxwlpxwpvlvlxuezuwqlelqqhuzeqezuqqplphluqexwhpvvllqhhpxhelwxeewzvlluewvxzlwelzhphuehvzzzlxupzquqpvqwlxezqezpzqhvzxqhueupzqvvwwzwpepevuzphwuzlhxqvuelpxzzuvqwehhvuevwqzpzvhqeezuzlpuvuzqxulvehxqzqxqlqlppxpeuvpevpvlwwvvhewwuhpwpqwwpxqleexuzqvquvzqqzquzeehlleuwphpvxeeqplvqqwlqqzzvuplwuwlhzqzwqvwpvuzpphequqzuzqwpzvxqhlxuhlqpeuhxphzlezpeuqeevqequqzppeevqpuxupelhluqqwphzuvhlvzhxwpqexplxeqppehuppeuveuwvhqzuwuxxwpzzlhlwevxhzpqqwxxheqvvuxlhhlqhxxpxlppqepzexplxvlphxqupqlplqulxwqquzlzlvuwepehzqplpuvhqvwewhevezwzzequhquuvepwxvzxzwxxvlwzpvuxuxewhqpxeulwvuexwwelpxxvzqpevqvhppxxpexxpwqpqvzzezewqzuquqqwhvzepxzehzphewxlwephwxluhevzzwlezhlevhzxevxhpvvplzzuqhuehzhuxehqvlvqvluzlwhwqeqxuwhhhwhquxlqxuxueqhzpuxuvulqhwhwxuupzvwlqwvwhvulxeuelqvqwxuxuwqhvvleqequuevellxlqqhhqvuehqweluzhxeqvplxueqqlvqphvxlpppvxexqeuxqzqlxeuxheluxxphxhqhlelxxupwzexupwelhulhppzvlwuhhexxeqpzhlwzzvhxeqheuuvxhhuqlepehzehqllluwvxlxeuuhxevlvuxxzuevlqpupexwvphvewvephzquvpexqvzvweveeweweqpvexquhzwexewevwqpqlvvvwxuhhpzzxqxzqulexpeuvhxhvuvxzhquqlewlpzqqhxuzeqevvphqwvplxqvwlqwzwxxqeulppxlxxexehzezwlvezqqlpxlhvwzxxpuwlvwqwqzehzqppvwuvzwllvwezwpwpzuzelqpwxuqelxlxwppvpvelvuevpqzxpppqhwphplhzqvhpqvlwpzppqxlezweqllwppqhvxzuqqluewppleluzhqpqqqwulvezvhxqwpwwzexpqlxhxphzhvhehuexxppzwllzqezxwluhlhqpwlvlevqvehuevvwuuqhqxvphexlzelehqzeqwvzhzwvwpwlpvzqpzlhleuuulupehxpqwxwzpzupxzlxquxevpwxqpvzellwhepqqlquwhqxehzwlhuhvhhppzwvvexzwlhqwqveqpepxxqeuezvwqqluqlzxpveqqepvwvlphhhpplwzvhzzplphlxeeuvupxlehwzpwpxluuuhuxvwpwqvwhuwxzvpwhqpuuuqwqehwzluhzvzqlulwezpzqwvuxpluzuquxwzvhueuzpueppxuxhwxxlxhhupezpwwwhvvwlhqvlwpqvwwhxhwqzxweexxpwplvplzqqzwveqvwlzphqulxeqlqewhhluwvxwhzvulvpqzzexlvwxqeeveqqwpupxxzxxhxwzuwwvqwwvqwehllzevqhquqqlupzllwzqwwuwhwxexhqlxqvquqzvequhwwxulwelwhqhewwpvphupeqxzwzxlvplpqwqxexhxlvehvehqplwwzwwvehhewpqwelxwzvvuvuuuuewvzzpquhzeuwzlppwzezuppzewuqxuepuleeuuxzwvewhxqwuvlvzevpuwhvehhxulxxwzwqehxwuhqlhpqwqxvzwhhhxuwzuhllqquqvlqwpxeulqzwhevwpxqphxwppzuhwxlhuuxelvwuepqluzuheevwvquhwxzpveuveqvqpehppuphelhwqplxxqheewevwzxlhezqhzzxqlxhuuephlpeewxpvhpvpwpzlpllpelhwzzxzlwzexvwvhhhvxqxwvlwwqwvluelehllelxxxheeelwlvuwhzhzpxelezuhqzvwvqweeuwllzpzhvzvupplehpevxlqulqpwuvlhxzepwpqupqulqxxxzwqelvuuuevwlhzlwvuzuluvxvlzwepuxqewhxxzwplxvevxvqzuqlqqxulwxezqwweuwwuxzhqvxwqwxlpxxvhvzvpehhphuhuwhullzezelqqqveuqplzlhelhzwxelulwqwpuwuuhepquxvuzxxwlluxqhvqpvwuuvhuxezqluhxxvwpqvehepvpzwwxxhwehqhllhvzzhewpzquxplqquwhwhzqzvxehlzuweqwvpuvxlwwzwlvexqpwwlluequuqzuzpexxulwzxlvzqzppppzvpllzqvxlpwqzwwzupwqulzepuqepxllwhxlwlzveqvequwvvhexlpxqepuvwwzhuppezqwueeewxpepvwppxxuvxwlhllppzquwxuqhqhwehuuppulqewpquzxzepvzwuepwpvuehvvxlhuwelxpplxvhuuuxpqxlpqlpxeleqwxllupezhzellqqvlwqehvppuweheqpzvzqeuzvqhplqquqxxzzhvwhezzxvpqhevxpxwqlqwqxzuhehwveepxwxqluhepqzuwpzpwqulqzzhwwhxlhpuvuvuhulxpvvzvxhpwlhvhwxplphevxvvupzeppqupexlqhxqzvluwvzuqqvhulqplxzzevhuppxzephqevuxupwpuwquhvwwhpeelhlpwzuuxvzupphuvhxxvwhheuwllxpzlvqvphzpxxvqepxzvxehqvqvzzhvqzuvhhzlpwvwuxqvuwzuxxqhuvhqxxqvvhqquwzhupxpqwqwwpuxvlwlzqxppevvuupwqlqqxulewpxpxhqwluhqzquqqeqlvzvppzhvvupvvlwpwwxuhwuheqvqpuwxxuwuwxzhxppvvwvezzzzepplqluzqhwelezvvxhzleuxqpzvluqulppqpqwlqwvllphqqvuzxlwxullqlxlzhzlpevwhuzqwuluxxppeluzlxxhxlxzvzqzvqhzxquvpzwwvlqevlelleqxellxulzevpqwvlpwpepeqhllwxlpxlxwzxqxvheuuwpvxphzlzwuxvuqlwpzuvwqvlepzhulzhleeuwulpwlvvvpxulzuwxvleqwwlpuvqllvevwuxxplvvhzuzvhzlxqeqhxuhvzlhuwuxhvzxpupplzhqzvqvqwhxhwqqqzulpvuzzzvhwulwwwwxvvuhvxvppwpwzqexlhhqwxzqhqupqepxqpuxzhpzuvxppwxwwewqppzlzzewzlhzpwlwlzvuhqhzpwuphlpwxepzlhlwxuuxzhllhqluwxlhxqpzxvevlwwzpvvhzellueqlqxhwlhqvqxpzexlvxppwxwezvxqveqplxeehqppxwwxqvvlzqpwezvxpquqeqluvepeuvvhzxqvwxhxzqzuephwluwxplwqxlzuhxuhvvlpwqllxpuuuheuqvhqwxphhvewqqxvqpzvzeevpelxeuuwxlqqxvezqzppllzlhelqqllxpvvlxulehweqpqwvpewpxqlvzzhwhlwqxplphqqlpwuvhleevulwxqhlpqvhvulhuhpvwwwuvhxuqqwvlvuhvhexvezpzvwhexhqzvwezpvzpzvphllwewexqvxlwhqwuuvzxhpelhhpxzwhlhpzvwlvpvhqqqlvqhqxxulpuuzzhlehqeueleelelhhuxqlpxqpzulhepphwwvuueuepleuvuvezzxzvuulehewwhpzpuwzpzexzuwhueueqezxxwxvqzqxvxlhvlqxuwwzuwwxvvvwqxzwwepvuwxvlxupxplzqwpulhpuhehhquxeuexqwpxhuxxeheuxelulevvwvhlpupwpzhxluzlvxpwqpzwhuxphzllvqvwxuhhvllwxvzepquhxphlueuqhwehzlwexeeezxvxxxluuuqwxvhwzlxqewzlzxuvuqqqhxzxqppphpwzqqvzhzlzexzqvqezexplxulphqexxpluxwevzpzeqvvpxheevuxuzpwhzxuzuhuuvlhhqhuqvqqzpvvpuewzweehxzzzwulpvvhphxwhlpezeluvuzlxelzwwhhvphwhuzpxuqexqppvexpvpqzhqleupwzzwplppelxppxhexuvhzexqeqwzzzzvelxuzevpzluelzxvqupvlhwlwwvvpzhxqvhllwphqlxhplvuxlqhhhhwxueqwqwxupvzxlxhwxlxzlxuulwvzqvqehvhpzqwxxpevezpxxexzhqzzweqewvvwupxwelplevuzwzupuquwuqqwzpxeeezzzweupvpupxhzwuhuexzhuhexhxuvzhzpqehhpuwwwuvxzwexqhhuequelpuuzzpqehzpwpphzuzqhhvllzqwvxxwphehuzxqxuuxelexvwpvwxhluuqzhpvuqpeqwqvhpqhqlpwqlequwplzlzpulwhhhwxzulpvphuwwhpuuvllhxvwwuelhlpepwuzpzqwevzxpqvvvvqzuuuwzuezuwxlelwxhpvvpuhqzlqqxvpllwvuehwvuzhluluxzzpzzzpuvwwzweulehezxhuhzxhwxqpqxxhvxpvqqvlhwvqhezpllqwpwlzuzwhhllwhvheveqqpwxwehppzwqluvqhexpzwwlqzlzlzzvpvxxplhxequxqpwuzvwlupxpqzlxzhpxuvlueuewuuuppwuwelqzuwvwhpezpqeehppzlupvhezwevwpeuvzephvlhqvqzxuvvvvlxvulpzqvhehvupxxxwqeevzlzxwvqqwhwzwhvwlhlpzhhxvzuzewllhxxphqhupwzxwpxwvqpvqhqwqxllhhxppzzzlqpzqxlwwlzzwwuhuvqvpvhewzhxhleuxquuwppqpewqzevwxzuzhpewzezpwuppwwqlvxulluhxhxzhwwulxqzeullqxxepxlvlphxhhevuvlpzvvphwzeehppluxwuheppeqexlxqxeqxhuqxwelzhwxxzvwxhlpllpplxzhxqhlqqlhqezwhlzqveuxxpzpeqexezzxepxheuvlluxvhuuzqvvpplqxppelvzwvvqpluquxuhpuwlepphhvpeuwuppvvpuwpuezpuwezequllezqwephhwuuzuqlzhhxlulxzpelelvvvlllwueexxxxezllhlvqlxwphxxxuxxplveeehwlvwvlqqzphxpevpehuvpqeqexelwelwwvhzewwlqwwvzuphhvuwwzlxhvevxxwzvwxvpqqqhzwzeluxqvqqwuhzhwevluevzelehqxvlqxwhuewvexevhxwuzlvwpzlhlulzhzelxqxuzxqqhewqxlwepwhwpqpqlulwuqxwpvhqeeevhuewvzxqvzuhqzlxlehpzwxxquuvewxweuuewplulluuxelhwuqqllxeuwqhehhhpvqpevwzqhuqhuhxuwlwexphlqxqwwlxlulzzhlpehzhquzqwxlhwvupzpvewzluvpxhlueexvwvvuuxhzzpqvewqlpzpuhwxlvxulhlueupphxehhevvqhvwxzxhlqqwxvzqpuvlquupzqlwuzuhzpqulvlhwvxllxwpupvpuxuqqwhpvqewxepepwpqwpvxwvwuvvlehxwzevhppqehwuvwephzuuhqpvplqepxwzwhxvzqeupxvvxhqxxpvqwqlhupxpxvzvehpwxeqepqqhpqwxhvuzxqzpxqeqqezvhwzzqpzvpwvehvxqzvlhhphqxwqhueeuqzxhuexzvqvwpxlpvpezulluxxevzehquxuvzvpzxqevuvwwulhhlwxphwqwxlqlpewlhuqevppxveuxhxuwvevvuexvuqwzplqzeqhpvzqhpluwqhwevepeqvupwhhuzwqvqwlplzhuulwzqpvvhewlphwhqphqpuvvxlwwhlqwwxvezwvxuvewevpzueeulvquwuuulllvewhqevxxpewhhwpwlhupwpehzxquzweezuzelvxluzwzleuupzhelululwxlxxexlhuuwleluhezpuzvvezzuvxeuzvvhxlvzvvzqllvxuxulqpqwxuuuqqlxewqxuzlwqpqqexvhlxevhuqlexvhxulhhhuzpllwhvhzxeuexwwxhqwvpxlhqvxqxzppphxzwzhhvhwppheevvuzwpuuehvhhexeexezuzvqqhzuqquvzlxullvxvluqwlhqqqhqvlvpzqqzlwquvuzpzvqzllvqwpvlhxulzulhwwqwzlhpuhzeuuuvvhuuqhzwvueexppeqhzzzqvwqevexhewhvxxlwxuvvuwhvzpzezuweeqweexwpphqvelhvwzhxphwlxhhwuuvepqeeellexhppvhpevuxelelzwllxvhxepwvpwlzvuhlzxzzxluhvzwweuvzpqpwqwvzpuezqqzlhelvluellxhuqqwqhvvvlehxhxvplheuxzullvzqwuelqlvhwzuqlevuxuvpewulxehqeqvqqeeexevplpeuqpwxxlhhpqxxpwxvewuezwxueuuplveuzlehuwpxvuzplquxxzxxxvhqhwxqhuhwvvuluvxuwvpzpwhvwwhplezvzqvphxwhpuzuzhpeepwpvxeqzxellhexwuzuupwlqvlpvvwzexvphpxlwvqzeuhvexpzqexuqwpxxevllhplvevhhzhehwveveeueuqevezpqvhwuxpwzqewwzzqhxquwlzxvqwuvxvxheulhvupzqlwwwuvqvqhwqhxvqxqeeqhpeqlewhpwqewhvxlhvwhuelwxuxzuhvelzxzlvhqhuqwzuvquqxpewpxuxpllquhhppzeplpupvqvepullxquvzvepwhzqhxqwqpuvuxxvzuvulvqxlhqwvueewzvlqxuqvqzwluvuuzwzxwqvluuveqehlueqpuxlhlleppxuwlvlwqplehwvuuuveheplxhuxuzhuluxxxqplxwhplvlexqpzuxpulvluluzuzzexzhhhvehxvuwequwexexluxveeexuwveheqvlxhluxpvhxwqvuhuzzwuvpxuhvzppleelezzluevxulzuxpulevhxhveqvuzwwwvxuqpqulvpwvuxpwvqpwupzuzpexxxxzqzqelzvplllxxhullzweewlhhxzqzuuexhpvwquqeuxzqxwleleulqxzuphvpvlhlevpvlxqwvvzpvzwwvhehlepluqxezzwvqxzzhhelhuzxvhxwhwpqelhlpqqepqexxvvvhlxwwzwxxqezpehhuqezhvqxluwhuqppzpeqqvwvqvuwzxxlppzwhzluwulhulzxqxpluhpvpvhzquuzzevuvxvzleuwvwvqxxzqxhulxhzlxvqqhpzxuzwxlwvqhvqpwwhlulupuzluzqzwzlqelqezxlueupqzqxlqluvheeepuplhplpewquhhhvplvwuxveuhevuwpwpueuzuxxhuuvxxuxxuewvwuzlxpzhxpeeelvzplxhhxqllpppvqqlzwzpqlvpulewppvzxeplpluluxewwqhqhuwxzuqwwvhvvzhqvxpqpwvpxxzuwvwlxpqlexuwvvwxzlexulhqluqzqzevzplvlhwqzeehlzpwzhxqlevuzhwhuhwzqvvqupellpzqezlhvhzueplhvquphpxhlzleluwqwweehqqzuxwzzphwwewwhxzzhvuqhhhwlzlxhhhxhzelxvevhzqlpqzhwlppqlexueeuxpllxuphwpxquvezuxvppqlhwvhhhlzupqlvvvhwvuzpwphluveveqpvxlpvvquezxwxllxqwxzuhxxzwelqeqwhhwxqwlllxxwxvuuxlxpplwuuuvhvppxpuzeellqvvlpzpxulueeqhlepxvhulxzlplqxpheuluzlleezzwxlxuuwlepzlhxuzlqvvxuuwxquqpvwvpevwpqpeullpvuqhevwuuzwpqwlqqhvqqelzhhezpvhxxzpxhvlxvwelqxpwxezlzxqzupzwehvzxzvplqzvphxzzuqqwqeuwwvzhzlqpphxqwwqheezqwuwlphwuvhwqxeuxpwewwxvehqpvzeqpelvwzzevvxhpxevxzueqvhxpqlwquuzwzwwxeqehqweqewhqlupzqluvuuvhzleluvvepxhzwlxpwhxpxqwhqqqzxzwxeluvxuuepvlewvpzezhwlhhqxzqlpzwvezxeqlwqhwqwulwzuzuxpuelvvvvzeqwwwpppwhewwzhwqwuzwzuuhehllexzqlwlhhwezhzuxzqpxvuezzvezzlvwwvzelqhelwqqhxlhhxuuvxvhhvpxexvhpxzvhzelpzhzqzwzhzwwvwvwelzlpzwpewqqhppwxzhlhevlelwhveuxpuvuvqzzhewxxwqvwxzzqxzwuxqqvhpqeveqzhuzzzllhupeqpxlwzwlupevzxqvwxlvqqpzllzqpupwzwlhhqzwuvepqwwqpvvhpwhwwqhzxlqpvlvepvpzlelexlhlplquzlwpxxuplxhpvqeevzhhwzlluxlupxlwqwuxhxzxxewlzhepuplwlulwhwzquhelwpwxwqhuvpqlxlvvzphhuhxhewqvlueqwllquwxhlhlpzveewvvuzwepzwwhhwpzqexuuqulxqxelzluwqphqhuquewzlvevxezuwweulexvpphplpwuzzhelvpqhqzlppxxhvzleeewxzpxxqeqhuwhhhhzhwxpquewuuuzhplzzxxpzxplqheelezuhvewxpuhwvwvqwxhpehzqpwzqlvhhlxxwlpzllxqvuxwzuqllvpqeulvvxpeqhhpwpqxvqeeqxuvevhxwxlhzpeellwpzzuwezvlewzpuezxlquuvlhuullpxezqxpwvupzhzzplvxupepzqzvqluxuzvxepqevqxpueuuxvvvuueevxqvzxxzppeqxpwxuhhpzqwehxzqwplpewplexqvevxxqpzqevhhqhpqulvpvvwvpuqhwlhwzqwxzuzqevppxhwqvvuxwezwqhxwxqlwwqewuplxhwphwuhvuplpxqwxzehvevquexzwvlqwzvuvvluvxhexxxlhexvwhvuzexepllelzqxxpxwvuuvxwxqwuwwhhxuzvhepeqluxwzvelvxveveuxulelxxhuzzpxpwuulqlwxwwlevzqlxwqlhplplqzxpzzqpwuxqpqwheexzeulvevqpzhxxxpvzqxluuqvxezpvpzhplxqwvwhxlppullvhwhzulwqqlhwzhqpezhxluzwlpupuvllqplhxxwhluvppphqwxvhpvxzqpxqhlwezlupqhvplvuhvwvuuppzqehqqveuhhwwxeuulxvvqwxllhxvqqeqlwwqlqhezvuxzvezxhqwqxuplxvuhlzhlhewlvluzexzwwquqxwhzexvxxxxzxphqphllxvqzpeehuqpqhhqwvhhxvqwqpxxqxeuexupwwlvplphxlewvllzxzwllhzxzezhwqzvlvhxzwpxqwuhzqeuxuxvwxzqvhxwhxuxqpzlxweluzlezewplezplvepwvpepxzzzplqhlwxuxzelqqzzzqxeeepwxluxwelxezhxehppwvwelpxeplvhuvpvwvhlhuueveepqewhluvxhxhwvvuxhvhqhzuzhvlhquezewvupxxwuhxvlhzwuzuvwwpeqzlehxveulhwvlpzvqwvevxqxqzwqwhuqhquwhwuvhhwzlllhuuulqwpelhuqlxvhwpxzllpeuquvqupzzwxvlwvuxuxulzpephlwxzxezlexxqzvxzllvvuwweuxqqvhzlqzhwxpxhqzhxxlhhwezhuzxxpelzzeqvuzvqlqwlveuvzevxwlwplepuqzluuzuqxwzxhwhlezzhehuwhwxxeeqeezxelehzeuxxzvzqeplzzwlvzlzvvxxqxhqzwhhpqezzqvhequqehxphluulpvuhzelwpwvzlvxzzqlqqlzezplwwxqqzequulzvxlzxhzpxplxuvplquzvpwvvlwqlpxwuqqwvvzquzqlwuuweuuqupuwlvxezvzqvxpwzpxlvpxpqwzepzewhhqehquxpxzvhwlxuwphuxqleepupzpvpehezezppvxhwzlezzzxzqphuqhuuwzzehxuqhwuzqlwxxqquvquxxzvhpxvlwwwxxwzuzzzwvxpwuvezvhxlpqezezqqwlzezppzpvzzhpqvzxpllvwpuhvxeuzzuhluhxqvqepzvzxhqpluphlexvvqpuqqpqhzhpvvvvlwqqhexulqppwezqvvhvxwvqhvpzpqwluxuplzxzxzewuzpxpllvheqwwquqepwlplwwvvllzwlxqlqzlqpqvuwupqlvppwzvellpxwqpzxexezeppzhlllzqwuqqllxxwzxeuxppuhhxuqxllwwpueqlheppzzewwuepwuzqphzuhhlxlzvhuhlzzzwqueweeqwepqwexhzwwwqzepvehqpxlzqplhpxhezeepxpuevpzuqvwelhphqxxpuuvwlplqxvlllqlvezzhpxqquwzqquppxuevuqluuvluxhwhwzppehhvhulpwzphphuzzxlzpxexwpzwvewvzwzzppexpzwlepzvvwpululqhhwwvwwzquxzezvppvxuwxuwhzxpleeqlxwvhzxvlvvxeqpzlxeqelplqeqpezqlphpllvqwxqlhuvwxvxqpqxhzuuxqplxvlhxquvqzqwzqhqqlxxvuwzxlqwezwqwzzhhwxwwhlvhluezvvxvqqhhvhqvwlqpeehewwxuluqqevqzzqhvwexepvhhuzvqzzhzevqlzuuzpqllwwxxwhppelvuxzxhlvvuluwepuwzxelxulpvvpwuvzuzhxzuvelulhuezxzqqzelehvplwlzzxlqxxvehzxhzepwullzqpzwveezleeuwhhqxxzhlqpzpelplweevvhzuqqpwxluvlxuhhxleepvuvxhqqzuqxwepxzuhweehvqphzvwpzxvxuxehexuhvphwplweqlzuehzpllxhzvexwlqxpvzupwvvlqzuhqquwvvqwezzpvwzzewqhuxwpuueexhullwwuzweplxqpzuuwquwwuxlphvexqwqzquwvexvehvepqlhulwhvhuevpweqhllewwqlquxxvhuhhpxelvzelpwqxxlwuxvweqxvxheqwuxhxwlhpzqzvuepxezzexphzplzzvpzvpxuveevhexqzluuxvxxuqphxplwhzlpuxzewlzwxwwvqqvwuqlhzlqhewwpvuwlxlzvllhewuluzzpvpxwulluzphqpxeluuqzqluxhwvqhzqvvvzplllweeuqwlqpzxeuphuvvqpuuzehqxzvqlxeqeqxzzvlxxlzwhelezehzhhzwluhqwuxvhzuwwvuxeqwxvhwhxpweuxzpwewuhulzpxwzuqpxxqwhzwwpzxephpwezvewzezuuehvqqvpvvuluxzhqhqqzxuqpzulwhwxqhlvhxquwhlpwxelpqxzzvevxvluzhqzewqlulevezhqpxlvqqqluxqzqvzpeqpqpzwqhphhwxvwzhpelwqwxqvpzpxvwuwxelxlupzzzzuvepplpepepqhwuuzzezlxzxwhvpzvepwqeewewxepxlpehueqhxqzxzxlexzeqqzhqhqpwzuuzxvlqwvuqqlepewlveuxqwhqhhqvxuqhzqpzlvwuwhpxlvvzewlphqhqhxqleqqppuezvwwwxlzqwhuwvezzwzqzxqwzeuehwphwhhwhqvxepwpqelqqxevweewulwvezvxxwhehuhuxzpeuewhwzpqvlzxqqvlzquhuvqlxzvwzwehzvzxphvwwpuxpphlehwqlzzepzxehhqzxuqpqevuwvxehxwvwexqhlxezqhlpqwlphuvlvuepzzwvxlxzwxwzppehqhxxxevlvwqxluzwvwuxzqqppxeqxwlxpepqevhhuuwuwhzwxvpqhqzwuzqhwuepxhwwwzvquwuwpexlhlvwvxvuzuuqehqxvuqlwwlplhzexqeqqlqzulwehppzquzxzezvvuplwxvzwqeqxzwwplwvvzuxpqzhphzphxllheeuzvuupuhzqqlxqwewxxvhuzxupeewxlhxvqwhuxwzelquxelepquullxwlewhqpvevvxxxwqhqpvzzhzxvhzvelezvluupuxeelwlzhvhzwzxwvqhwwlxvpwzxqullewhuveezvxwuhuhluzqllhwllupquhxvuxuupeuhqhqhhvwzlxwwpwqvlqpexpluxuvxulqhxhvheuxhzzvphlxphzhlpuzvzlupxpwphvuwphqlqqzlxluqlpxvlppuqupzpxqvhvepwelelwlzeuzwzexequlquxlluvveevvhplulzhwpvlwxelqhlxeulpellxwxppzpqvhhwlhqvvlupvzexlxlqzqvzxeuzppqlzezuzqehzvqlpuhvezwpewhvewzxwplqhhexppplvvwzpvlzuzhlewuhuplxhlwzxhpllveezlhuvpxquuxxxllplwuqhelhpezpxwqeqxeqpuzhvhhzpzpuuvlepqxewlqqxezzxuxpulxexulhhzzlqhzwuxzxxqqxwwvellqellexlpuhelvxqhelhxvepxluplvhzhwzxvhxhhvhzeqzuxuhqqwuvhullvuezvzeevhxeupxhqxzxhlxqxvezxpuxphxexluplhvzxvuqwzwqhelllwuwvqvlexelvwquxqqqvehpwuqzlzexhlvhvuxwhuvxwwxqqqlxzwwqwulzleeepuxhwhlvvheulqzuxhlpeuxwwwvhveqeqhupqqqhpvwuezezpveevhuuuweelpvvhqqqullexhuuqxzllwpwzvvuvexxlpequxuhellepzzwqhqlwqqxelpxphhwlzxpvqvvvxewuxlhphvqvwphqlpxxqexlpvwwhhhezllexxupuezlxwxzhewuwlllpphezxqxvpvhxzuvzuwppehuzzwpuhhzuxuupwzluhwqvezzwwvvhqhlezuwpwwzpwwwhhqwxluzeqqhlepepllpveluplhzhvzupezvvzzeqzelheupzpuwxxxzhuwvllhxxuwhlwzulhhlpvxwhpwvuzwxeulvllwhuphxpvqqvuvlwwehlevpwveuzxpuqeqpulwqvlwlhzepepxplhevhleleuqvzeewexlheqwzuxzuzupllzlpwlzppqwwwzqzqwqxqpplhulevxupuqlqwqquuzevxellhlpqxwlwhhpwlxxupxvuuvzhzzhwzuxxqxxuvpzehpxzzwuuqxqqwhxupheeveluvpvphzvhuvuxzpzxpuequhephqzzwlqeuqhuquwvzhezppqpzulhqhvqxlwzxevxulhehquppvplllqlleupqqzhzpuxuvhpupwxlpxpqppzqqvueuphxxqvxwwhqlhxeuqwvzhequqhhvzhqwplxhxphzphqpzplhvexzwzvwvulhwxvlqvelewuvxxuezxqhwxlqlhvpezqwezqvvlxwxzpvuvqzpvlhewewvlxhhhhxwwvehpllzhhlquvezqlueuwvexxvwxvehqvzhwqzzhwvplzvhwepzwexvzxvphzvexlwweuqvxxlhlwezuvzhvpuuqxxqwlpxvhhexuppwhzlqhvelvqwlepeqhuepxuqzxzlllhwezquqhxvlpvehluvupzullpphwzxzhlxuuvzqwwvluqexxxveuxpplpwvvlwpzhzzeuewzvvwvxqpllzlquhqvwvulpupxhxzpzxwphqhhpxhxuvzxhlxvuzlpqvpplwhqvvuzqlvhllzhquwuqvzvuzzxwhwwxhhzpuqlevplvpupexqpevpvueqqzvulxpqzzhvlxxzzqlhuzlppxeupvlwzuwplwppzlvzxxpexwwhxxhpvxelzllewweuzphqwhpwhqwhzhehlwxvquwxlxzepuzexepwhlzuzuuxlulhhqvwxeepzlwpvvvlxlhwqzeqlhpphxqhlquuhqvlzexelwxppqhhphezwpzqxxelxewqzvueevwvwvhvvuxhxwlqexphewvupwplxphhlvpwvuvvpxehelqhuezlppvqwxwpvqqheqqwhwlzlzhlpxlwepzxphxzpezleuzhhuqzxwwlzllzupqxwqqhpvqhlqhxpvwehwqvhpuexxxezpepxqlzezzhqqpwhvelvhhqvuqzpphuxplpeuluxxzzppwlhvzlphhuuuuwhvvweewvzuvvlpehlzevlxqezwevwzpxvxwuzveqvpqlqwpqxxhplvhvlzuuhzzupwewvquheexqlluzpwvzhuxhwuuqhhzpehquevqxzlleupvlwuheewwllwxwzlhxpwqlhvxeuuexxevzhqpuhwxwzqqvqhvzvzxupuvwzvwhluvhxevzlqeqhqlplxqxwhvlhqqvhluewqhqexuqwxpewuhzqqepqulhxeeephhpzhupwhzzqphepxzphpqqxpxuxzzwzwuvevluvhehwvzwhllhzwxwphxpwuzhwphppqpvezvlwevxwphplhvqwepwlezuwvhvuzplphxlqweezvzluqvezxphxuvhxehwlllqzwvzhzqlzqveullhlvxlzuxuewwueevphxexqwvqlheqxuzuvhzhwezuvxvxquxupuxqwzvzepxzvqpwlzuezzquwqqepuzxlwqzvqlupqzhqxhxwqvuvqephplepepzzlvvzzxqvzzlxwqvwzvwezuvvwxzuuzuxlweehqpewqulhlqxvqhuuzlhhxwzwuepuhpxpupzluqqhhzxvhzqwweqxewhlpxqxwzheulhhueqxuvlqppxqlulelwpuxxzxxxqwxxpzellvwewwhvwvxwxwvpuzuzlzqpvvpvveewhpxehvuwhppqhxhvzqqpzzuhppwpexvqxvplhlwlhpqullhwxezluwvuzwepxhhepvvuzvwzlpuxewuhqluzhxewlpzqvvzlewuwzvhpvxhpzzzxpvuquxwuzwhhvqelqzzuwxuzuxuqezhqqehezlwvphlppzueuhxzhuezvqvuxqxullwxlxulelllxlhwveppwzezlxhlwqzxheeuwxpqpqzhpplzxlxllppxpepvuphvqqpllwwluvlqqvlpuzvzexehupwzweqzphzluqpllpquvhxxpqquqlvwulwxvevwezuezuzeepwhlxzqpqzllphuvxpvlpzpuwexhxhxheehuwuzxhvevxhequvwzhqqvuuvzwllvhzwvzxxvqvhvppwezwhpwxlzhxuwvqwxwxueqwvzpplqvqvqlvzzezvzzvlvpqppxvpluuzxxqleplplpwwqllequhzpzpzlvvwlxlwuqqwhxxzuupwuwvqlhpveeuuqqzhuhquleuvupluqqezelhqelzehlvzhvpzzxxhhvhzvplhwwuwpphqhlqeuqhzwzxlvuzzelpquvpulvphhzqqhxeqxwhhwelwhvwhuhzwhplqehlexzuwuuuxhplwweequveuwvpvxwvhvueqzzwuuhehzqvvzxzeewpphwwuwxhvewqlhpxlpqquqpzxpuzhxeuehezwzxhpllwpevhhleuzeuvvuvhhxpxqplzexvvzhlzhxwhuwxzxlqeqhhppwqlxlqqwvlpuepvvulvxzuweuwvvexwxwzxzlvlehqhuphulqzeeexvzuqlxeewquepwelxulvxuvzzveqpxxhvvlwllxehhzpheuvhzqvellevpezvpzquxzhpxeqhqhuepulwppqqweelelqlzelehuwhhxeqqevwpvxlxvhzlxlqplhuhvhxpepuhlhvzzeuluxvxzphhlexxwwqzpqzwxwxpxuphevxqwuqhqzhzpeuluhewhuvlvzxzxwehzhvellzhzlhhepluhpwzwquepupzuevvezllepzhelzuwvzqxzhhlzlpwulzwepxpwhqlwwxuhqeqxvvlelulqqxllhwpwqqllzllvqqwlwevhwhphheezvxwvwzwqzxeqvelvlevephehxhheulqwqpzhpquxvlhwuqxqwxzwpqqlhehuqhvvepelqlwhpzuwquqhvqepxvlwqpqpwxqzhhxqwlwwexhwxlqupqwqzwzuxhwhzeqzquxzheuzzpeqqwhelqppqwxeqxqhqhqezvwuwqlpzxqvxvvzpvwhlzeuquuhvlwxxzpuwlvxxzpxxxwhvpvzullxehuquhwuvlvvhvlhxvxpphqewwvhzvwuzqezlvlxxzwvlepzvpepqvqvwzuhpwqzzezqvqzvhxvxxpzhppzluxplxpwleqwuzxpuzewuvwevxwqvzxpleuewhwzqxeeevxehxhqelvxlwheuhvwqvhxhwxxveueexlvhlvhxxulzuhxlelqhxzuxezlzvpxpuxzwhlvwvpleqwzpxwqzqwwhlhvwvpvwvxxhhlhhwzupuzuwpzeheeppulzlhxzweqxvqxqpwhqvewzhwvlqzpqlvlhulvwxzzezzuuuepxhwpehhuxvxwevxzlezhxlzhllzpxzzqqvxevzvuuzzpzllqxuevhxhulhexquuwuupvhlvqxuvvepqxxqpxwvvqupwuzhvvxuevwvexpwehppeuhwvuvxvvhuuuuzxppvqhzvvxxlxvxvhvwqphxwuzzwqewlxzelewxhehzxxhuzhhuqhwvleeqpxuqqzhlqexwuwpxvqwewwxuzvxpeehvqwqqezwqhlqvvewzxpqpvphwxqlpzwlzzquelvhvzwvwwezzxlpuuevwqlulhuwhqewvlplvlphwzhuqxzzhlhwzuzqwqulzzwuveuezzzpvquexvxxwhhzuhpvwppwlzqlwelqquepullpelqvuuwxlupzquppwqvlxlqwwvexlqhquuqeewqqvvwuxvzvehhhxhqpqzpluqhwzpepvuxxexzzxuphwhwhhwwvvqxhvzxweuxwlheulhvepxuhwvxwupuwxzuhpewhwuuxuvwheuuxhwqleeueelwpewqwlevuhzlhzwpuzpezqzwehxhlzluqlzhvexwzlzuvvlqqxewlpulephxuwzhlplvewwxuwulpuupqlpqepqpequuvlzelvhzqqeupepqxzulhhqpplvueqvzvppwwwuuuzuewpvqzqwuppuxzlzhlehvzvllwqwqulxevpxeelzeulwxuvphevuxxplwqxzzqhqwvzlllxzzvzvzqwzhllqwwhqwwheheexuuzqhuexlqphwqpxqzvlxxpwpzvvlxwepvpeexhpvlepzpqqlwqqvzvzhvxzqhhxveqhuxeuplwqqxpqxhvpuxzvzvwlvpeuqpueqheuveuexeplhvpuvwzheeuezwuhlhzehueellqvphevulhvxpwxpqwuuezzvzpzvphhhqvxqzewvuhzwxzhpulwqvlxeqquwqvxwvhexuqqzwvzhvxlhvlpwpevelwvqvwvqhvxhvwlzuxexxqplxzxvpwweuxhxhxhuzlvxxwplqplphulhlxxpwqqvxlpllezzvzvzpvuvplqzhxxlzelveeqzehvxwuhlplwqxhelquwvzlhvquezlzuhuzulvxlzuuzuquphhxwpwwlwpuxxexzvepuzplxuvepxzqpzhzlzuxehlpuxhqzuuqqvewzlupluwxqxelwvlwwuvvlhzhuuvqvzphqeuveupxwwwphlzxzeqlevqzeexpwqhwlevwpvvwvxzhxuuuelxheqelwpeqelwepvlwlxehhlvqvqpxhpvvzhvzpzelxxhqplwxwlwuwlqwveepzqwvqpwppzquwlhpuxlwpuquzuuzpwwuvexpzwzxvxhvevxevelqpwvpxxelhxqxwhwupvpppuepqpvhexhpvxwqleqxqzqlhzxwvlqpqvuxplxpphxuzpppwqqlhlueqwvexhqepevvuzuzvzzzuzwlplqxpzhuqquqqwwvpphlqluqxuqlweeuzvxvxqwhplxpwwwxzeeezelhwvhewpxulzhqxuquqhlqhxwehwhqwluwheqwhqwwqlzqeplhvxzuvzeqwqzwqqezuuhpqhvhxphluxxuvvuphxvvxlqewllwewuhqhquevuwupvqqhuzzwxlxqqeqwlhqwexlppxqqxzxlxwxxxhqwuxvpllzlpeuvvepeuphhhwpwpzwpvpuquzuuwpxplxvuvquvulllhxulqezezpvzqzhqpxpvvvvxwzxzxplxpqvweezqvpzpupvxezvxlpzhpevzvwuhxzlqzhzxlzpxewuvwwxlezxpzlxwhhhwllqxpqzlpppehhzuuqpllvhvxeuvqwxplwxzequvwvxqxuquqlqxzwluvxqvxuzezepehzzzhhehuzxuvvppuplvwzpupeulhzewhqpqxlpwquvzepvehevzwzqlzhvpqqwelpqwezpxeqxhwpwzvxqepulvuvpxwhquxlxlwwwvhezhzeeeeleuvpppqzllvzlxxlvzqwexxxewuhhqulhleuexlpuuuvquulzqpzqwwxeuwpwequxqquvzwzhwepezhuwzuwwllwvewlxvqvpuepzxvpwppuqlueqvpxqwhvwlxwulhleqxpuxqpvwllwzwqlxhuxlqlvzzvqzzlxelluqpwlllllvzlevzlpxpvpqvuzvhwvplxpzwupzpqlpzqwluhlhwuqqzplzpqlwxuwluwzpxevvuzpzzppelulpuhwluuqhulzqvzpweqwuzwzwuhxvwueqhulqwvwhplweqlxvwqlvxqvqhwlhlxlpzzqxpqlpxzulwplhwvzvqueulhezhleehuwxuuvhhlehxqequlvupwpwullwezuppwwevxlwulezvuqhhhxeeqleqqqwhwpxwwzzeqzuqzxvuhewpwlhezuqzveqvwuzuxllxuvezwuwhuhhwueeuqxeuzepxqlpxqehhupvzepphzewuqlhlphwzuqhuxvqqpxquuqvwzxxllehzvplzllhuvphvlhqzxwxqvluxwhzxlhqqzxuxzzvwpulwzxxqqwqpelphlulhwpqqlhzqewzehqplhvhvhxqzzqveheplxvqxwvqlvehxlhxzxzwppqelezxxxlhllzwulquxuulqxuzxezhzpxhxzwezhpzzzhuppxeezzvplewpeuqheuqvhvhelvzlzqqqxxuqzlvwpeewhuweqhwvwuhuzquwhhhuulxexlzxhqzqluuvhwllepweqxuveqzvuhhvxuppvpzpuhhhvvqvuxlwxxpeewlzxqlhvxuupzvexhuvxvqxulllwezqzullppvhlqplhwvhxwvvwhexpqupqpqxqhqwhvplepzvqpxqpqewvzluzhlphzxvvxwqevezhxxqlhlpepqqpuwlhwpexpzuwqzvlqwpxluzlvxxpllzvxqhqlvvuvxqhwquqevevzvuuuxxvwlxequxlzpxleqpuhwlelwhhzhvpvvwhhplxlxqvzqzzuzvlzuqppqvplzhvpqxelvxulvwzqhhpvqxlxvzeehzxuzhpxphhulxvlexpqpwvzplzxezvwphzuwqphvlppueelqlqxeheelqlvlvvqepwhwqvlhhvezwqlxuupzpvzxqexvpwlpeeupveqllhvxqqeuzpuzuuxxzpxvzzqeuupuwqwqwqephwwehlqxwzpexzhlwwxuuvlwzewpphzuqzupueuxwphxwwlxpxequhxpewplllpewqplexpwelxqqleezxuuuzelpvlxwwlpvhzvhlqlelwlxxhpezzqxpqhxhvuuququzzxuwzlxuuqephlxxhlqvxxxxhpqvzhzqpvwxvuvwvpqevhxlxupwvleeqpqzqvllwvlvplqhewqlhezpxqxzvwhqxhpelpvxupuvuxzxqlphzqhpzwquezlpppveveqzelvzuzevlpluxqqlxxhzwwexqplplxhzehpehhxqhhuwzexzqwllzvlehhhhqzwhlvuuphwxeqvxxqeupvhvulvqqhqllwlzllxqlwhqqeqlzhzwuhxzezxllelwlzhwelwvwhlqqvezzwzzwulelqwxvvwpqeuelxwuvzhezzqxwwuhvxxluexplvhquqqhqqlqhhwvlpvexxqllhhuhzhvlwqwqvxlepqeuwqpphwwvqqluvzezwlzeuhphelpwllzuvpzqpeepwheepxwxwxqqxzeqezzppupwleplphzhexpvlxqevlvlhxexxhhxvpppqwhwpqqhvphphluvleqwwzzwvplhevlezvpeplexhvxhlwxhvvxwqzlelwwuezxwuuwqzevluuvzeppwlwlxlxequpheqlpqqxuhvveezvqqhluqvhzpvxzuhvpuxpvzxlhwlxqexuwxzhlphwlhqwvhlppwwxueezxwwhwxewlhpuxlequqvlvzuxqlqphzueehlqehplwlqqvzpxvxqxwlhzqvzlzllpzhvhwlxuevvzhqvzvveuhqewwwlexwzqehhqxezzqplewhqqluvxuwwweevzzwvqewhllzpvppwupvxexuzxwqpevlelzpvqwhuqvuhxewpxwxvwlwzuwewwuplqhpzpvlqvvlvqqvlwppezpwpzuhxpuvvpwqlpqlevvpuewvxxxqhzwzxqpzzuweppzlzlwxqzuzpvhulepuqeplvwzzqwlpxpepuvuplxlqhvlvwpzppevpwpxpxevhuleeplqpvuupuluezpqwvpxpqvvhpqexxqxvvpplpvxluxpwuzxxplzuqhlzxhqheuwwwhuheelpvhhzxxwwevvqppvuhvvwlehhppvxqeqwzzzhqlepwwehuqlplxuvqwxwvwhpuequqwhehqvvuupxexqvvuqzqvzlwwxlwqeewlevzlwpxhuluuvwvzpzuuwqphpwvhpxzxxphxlzezupuevqpplexvqwxhlluqvuxhevquhqveqwuxzwzlpehhxevhulhhhhpxwvlqxewwvwuuhullehxuevexeuqxluuuhuxlquwvulhezelzuvxzlhqlxvvelllvqwpqlvqzqeexvuvlpllphzqqpqvelxluquwpuvwxlhvhxzweluqzquqqepuehqxleevvlxpwhlvpwvwhvelxexxeuuuelqhwhqquxxvvwvwvwxheezwqvqewvwupqquuqwehqllhzpwzzxpwwllxhhzewlzvxpqepxheqwehxevhvzwxzwzzvxwelvzhvxzhephlphphqzplxpzxxvqppezwuuqlvvwzvuwlhuzppeqwvvwqzpvvvzqwupzluzxeuwluvzxueqvuphzlwheulvleewpeqzxxvpvzwpzxxevqppvlqevhpppuxvuvhexpvupuphuuuwwvevxzlhxexvwhluvxlpxvuqhuquxvuqleqxwleepelqhepxzzvzzxpphpzzwuwveqqqvvwhuuwvxuwzlqexxlexqexvquhqxezeqvpqhquvxewuxzewxeppluwxhvqllewxzuuhlewqxwqlpvzxvvupluqvhzpwxqhxelwqlexupqxhpquhphhzpewzpwqwpvvvphpeplvquzwwuvewlupuuvvwzewvzwxlxpeulqppqqhxxhpzwhwplhqeuexzzuhpuxhxlweqpqzvxlpxexxheqzxvvpuewvqexuwhzwevpveeqqllevpqxzvwuqxlwzzuxuxzzwezhqlevqwlpxuzpzuxzpxhuvlzhqlwvzqxhqlvvehehppphxwulhqvzhvqwzqqqexzeequepzvwzxuzvpuwuhwzxwveluluzwvvxvquplhxvhxllehuppqzzqvwvhuezeqeqehqlvhpwxxqvlxeuzueulwhwvevwpupxplwpvwvvhhlvzpelzxvvpuxhlvwuxlwqwwxpqvhpzpxuqpewuzlwuwvwewzzuxeuwelqvqhxuhvvupzqvzxlwlxluphxeuqhehllwhvhzqxvxzuupheuqwhlpwuvzuvhlpqvvezlpqxwuxxupueqvzpzwvpevvwhpvqwvelvxevpeehwluvzwhzllvuzvhupxlppuwxwzhuxuphzevlqluuxlzzuezzqpevlpuexqhzwhxqpuewexehhuvuelwphwzuzlwwvhlvplvlxelwzhlqxhlvpwzpzwhvwuxvpheplzplwehwlwluhzzwpupwlvulvzvquwluwqhqlzphhwvlelwqllqzlwuvxepzzpzelwpwuzqwvzvzllpulhehppwelzeezuhhwxqvuphupupwlqququelepvxzxlxhxuqzzvxqeqpxzezezxxllllqzzwpppwpuvuuxuqpvphuulelzuwhvepuhvvxwhpulvhqvquuqxvwhuwzqqwlevellzhwwzzhwhzuzqqqxzxlxzzxvxxxwxllelluezpvhuppehwxllepuxuexwqxpeuzqzqqluwewhwplulqzvvuqpuewpvpewvwuxvehuwezvwzzzlwvxevhzeupwlvuuvvuvqvuuhuzvplhxlzhvevwqexwvehwppwqppzwwhzevuxqqlvqvqzvpwhwlelvezwzpupqvexhulhzvewpwevpvvhhhleqxelluxevuxhqzvqzqwwvupqwplehqepepzpuvhpevvlhezqzvqezwpwlluxhehqzlpxlquplzzuueqpuuwlhvuvepuqppqxhheuwhxqluhxxlexullvxvhvqvzzqzhzevhlxexzupepuzuzxpezqppwhqehepxwzhvhxxeqxphlwzlvexhhqxwhphqqlxxzzqhvwuwhqpllxzhzlvlqupwqezuwqewvlzlvvqphpezpqxlveeqhpqhuwhxheuqllupwewqphveeqxlpelpwvuxwulvlllxuxvlezvuulqzezpepllhvwvqxexpzllplphlzhuuphuvuhzhqxhzvzzvpexevxpuzhzweuqevhuewqhlqvllxquepvvpwhupzhezlphqwvxwhhleeweepzvxxxvqwwpqphewezhxepzvhweqpwvppeuqlxvehpvqvhpqwzqzwqwlpqvxhhwlvhwvlxxewwxhhvvehwlppuezuxzpuvxewzxxvxlxuzupuzlqepexzzxwpvewuvwhqzezvvpeupeuhxuuqxzwzuevzzxxzzupqhxpxhpphzeqphxzvuwupvwuqhvhlhvwqzwhlqlqhuhzuplxweqlqxzhvexwhzeeehueqpwqqezlqwwlzwzvhplhxpwqzqqvvhlezeuxlvzuluwxuphleppppwhhlqzuppluhxlwzuluxpwuvlvupzvupqpeqehlvexzhpwxqvevhezwqzzuwxvxxvzwuwluvlwhheupvlwzhhpzhzexplqlzlpuqhzzewvqweppuuezlxhuuxhuwlpqlphzexupzlzvppvxpeqxzhzzzvpzwllwpwuepwxwexqlwwzluxzepvhhvuwqexxuqvhxelvpphxhppvqvhwxxzewlqxxppxeuhqwzzqwezhueevpqhwzqvlpxqvevlvxeuqulvhulhvxvqzppequeulvvepwuexxqvepezpzvlvlxpvxqulxlupxllwpppwuhqvvlqlulqulhluhqhwphzpweepehhvevvlqululxewzwlezwellezxqxhlhllupxuquvzwwzezuxwxllhxuxvlqqpvzwuqqzweevxqexqquxzxxhppvqxeuppzewwvxuvqeeuppwuxlxzzlqlpwphwezeexhquuwzupxqewexhvwzwwvqhexeqqpevqzhvxpwhvppzwvzuwuueuvwexwlwvhhphuveupeupwluhvlppuwlwexellwqhuxvwvzuwweuxqwwhlhxzezxzevhqezvqezhqzupuwlhwuppllvweehzhxulxhwwhpxlzlwuvpphxulwlwzlxhqplvlezqevhuuezqlvwxzuwewqxlhzlwhpzluhhlewellqxzqeulezhhppwzqhwuqzxpxzpzuvzxzzluhheeuevlxxpxequlpwhzhzqwluvwzleppqzhhvlzepqequvlhzzvxxxpxlhxxqpvzvhpeqlezwuwpplelhuzwqhqwzvxpvzevpxvexzhvppxulewuzvzwuqvuuupzvlwlwvwvlwevxxlvqzhwepvxxzpweeeezpvezvxuewewpeuwehxqqzlwxvequqxluwelpqxwlhplhewzqzpvwpvewhhlphuqqepxxvevvwpxhhueuxqqepuuueuuepzpweuwpvhhzlhwuuezxxwwqquvpwpvlzvhhezvhllvpwepvqlqvwlwzqhwlzvlzlzqxhxlhevlzzxwvpzhxzzxlpuxeupzvepqzpxlxwwxphlpzzvwzzqpzvpvhpzzxxxxelzhuhexpvxhexqhxlxpqxvhvpzwexwwzhxxqwlvuuvuqvwehxulhuheevwqvvvquhlzuxpzwqvzuxphxlqqlwephepxqvuhuvuwwxplhxluhpzzezulphuluxlxhqqleqwqhzzzeplvhwxwpwexzezhphqlulpeuqpepveevwhqvlxhllwqqxzxepvqhuxhpuxluwxheuzqqhzqxleexpezxqzzwhxewhezevpvxevzhlevuxzxevpuwzuxvuwluqphewpwlxzweexpzhwvhluvvuehhzhwepqhxehqlehxqxwlzlepwzpexqhvhwzhlzxehuvxxeqqhhhqhzueuvwvpepvhxvwzquppzpqvqzvwluuwxvuewlpzpvqqhezevuwexxxuhvuhqvzwepepxqwpvexqzlueluhppwlpvwpqlvhwpqlwezuvqxqvqphwpvwuppwuvzhvvwvpeuhzlxqevxzhehpeheeeqxluzpeelelqzqqwqlxhxuewuxpuxulxehhpuxqlhpqullqvxpuxxxuxvxllhxwllhxzvxhlvuxezwhvuwulweqzvelxwxvwxlquwheuzzxueehxqzuzpxexhhvxqwlzqexwzwwllpwwhlwxxvquzzehezuequwlxpxexzvpxpleuwlevevhexwepzuqlpxwxxllvlwvqwxplhxhueelxzvzqqexhvlvlqhqeqvqlwvuulpvqqpvpexxwpwehvqeuxqlzhhexwpevzxqplzhvvqvlzxqvuzxplpepehlhpxvhuqzpulelpvzwpluwvvlwxvlzlxxhlzlexhhveevheplwpqwpepeeuvqpupqzpueupzxehezulhxeepvxpwqqpelhvlqqxqvqhuzqxuwhpvzhxxulxlvpwquzzpvezqllxzwuzuuphuuvqqpvuvqueeuhxxqhzeqplzlulplphhxzelxzelqwvpwwhpwxhpqehupqzequlqppxevuewpxhvuxxeelzzwhepeuuhuhvluzvqlvvzepuuuvhvwzweplxppzluvupllvvwhzvhzlzxphupuzxpzullexxzeqxuhvxhhwlvlpvxpxqxvhzhxeqhzlxhuuupuhwzpqpzlzplzlevxllexuxexvhvwlueewuxzvqplqlelhqzxlhwhwhhqzpqwuhzlpvvhxpwqzhlvxuuuwpxexwuwuxqqpehqvphphxzeupuewzlpqhzvuzvhzheqeweelwphzxlweleexuzvxwhhlhuzhpvzwhxelqupxlewqzhveuhwwpzzhwzepllvuwxxqweqwezwppveqhxzwvqzqwvqexxllzuxeuzxuvxlqexqqzhezlvuzwxeweluvwueqqepewellvuevzplhewwvwvexppuvelzevhqwlwwwpvhvplvvuphlepxuuphxxuzvhwxvhqxqxxzlqlzhhpzzqhlqzulzqhuuvquueexlvhqveluxxvhqxvlppweqhqqhxzhwelhuxhwwhllwplvplwlvzuzezlvvzhhpezpzvhpzxlpvpzvvqwppxuevvluwxxxwqewzvellvvpwlqxwvvzzhhxwwhwpulqpqwvuzxuhullxvvhleqehqpzxwzwlqeexuhvwzwzplqwpvphhqxuuwlppewlppqluelzpzqexwhlhuvquzxzxeqwqqwpweexlhxepvelwluhwpwuqwvlvwlxqvzqvwqzwxezpqwwlewuuvvzzwluzleezequvweezpzxxuwvhllpwpxqlvquxvxwqwhphlqxzxuuxzuewwqpvhevpqxuqwulllxeezhuwhhxxuqupwupuxqulppvuhxlulwpevhhwqqpuqxlelpxqvlvzhewpuvwzxhvzwwxvqpuphhqvewuzqxqqwwvpquphhzpqqlwhlhheeepzexxpulllvveqvwzequluhvhxqhwpheupululwlewqlhqzvlqzzzvxwqwxwwlphezwxewepqvqpxhxpepvxvuqelzwxvzepulxhwzupwewvwexwzhxzlewlxzqlhlhwhehueqhehzpxqxzxlppvzpuwppphluhxehhxwvvpzhepqzxhxvxuquzwzzplweexhqxlweepqqvwqxpppwvwlxvlpqqvwlxpuxwvwpvqxhxuppxvplpzpxewhuluvzlvqpvwzwleuwwqpvqxzphlhxlzuveeuqvxelzveqhqxqzxqqqulwuuzhwwlzzxwxewhuquxzlhuhzhllvvvvlpwzuzzwhqlpxhvvpehpupuuqlxlvlpwlhuzxhwpxulwxwluqxxxlpzellwlupxpuuweexwuwvxpxxplxzxxvhqvzhzexxqqeuuelxxphwhzzexhululvwhplwzexeplwehwzepxqhhphuvzzzhpwehqhwpvlhuqzzqzwzlwxlluzewvuxuzluzevhwlwhzhwelpwzxlexppqezlvhvvqqwzzwhzqxphvvevuewpwxwwvulxllxpvphelpzvhzxephzvphuuzzxlwhphlwuulxexzzhppzhzwzwvhxwuxuxvvuupeuxqxwepzuqpqqvlwwxqhwvzhuvqhqxeqxeezvlzlvelquupzvxvuqezuqqzvqpweuplxqwqzhhqvvuluqexluexqzzzpwzwlzxlwphhxvvvhuzpxwuvqqxuezeexxvvqxpzqulzhhlpzxhqqepexvexvhvvuqlpplqevwhqewwzxpuevvwuezhwwzexzppxhwxvvxlwueqxzqexuhxpllqhplzwxuluevlqllepvpzwpxpvzzllllxwqlxluhlqhvxzxwqevwezqzvqvzwwlhquzpuhzzhupzvluxwvzeplhvzupxlpvwzhhexqqxxxqlhpexqhvxlpquuzzlzvzzxqlqvqlpxxpqxxphvqleuqpxwuehquuwwhewvwlvuhxuzveqlqzzpuhuzqvlzuvqhxvevxlpwuhpxxqzehphlwwqwlelvqwhezzlelvulhzwlvvvvllqqzhhlzxwzvwplwzvhulzpezuqlqxplphxwuphxuwwhlwlwvwpzepwxqzxzqvzhwvwwqelwvuevwehwweuexwveqplxuxupexpxwwzzlvwxpzuzhpvwpxhqzhlhulqvzvupwxpwvlzhxehlqzlwwwpvuhqxwxxuwhvlqppquvlvlwphxxwhhwewwvxllvuhqeuzeehpeevzupheelepqwxlxxuhxllveqpepuhuhqzvlvvwwlezxluxxvwehhzzpxzzxexhvpvuvzzhwuzvwwqvupllqpqhvquxvxpuvlxxphqzwhhxvlqzxwwzllpeqxlezuvzpzezqepzuzwqzhplevpppplezhluwhwxqqqzwxqzwlxxvwezuvvwwuuuqvxhhpwxlxxvxeheeulwpuxuqlleuxwleuxplepxweulhqewzzuxeuuvhwqeqlpqplqlqqzzhehqvqvlqzlxuuwxezhpvvpuuxuvhvwuulhpuxwzpwpxuvqezzzezuzqxzlzeuelqppwwquwpvzzehpuvxvxepxqzeeeeuwwxvhpqqwpwqzpuqwupqzhluvuuxzlzqqhpzzquzlhhzwpzuqzpuwwpzvhuzwhllulllzvqhepwqzxlzuwqwxuuuwpwwluzezvhxzpwwhxqezevzhplwevwvpzhuuuehwhwvlzqeezwhuzqwlxqxlvxzxplepqvzpvhelzzqelqvhlxhlzppzuqzpuxlqxvpwxqqxvepzupvwpqewwplhluwlzxuuexqqeuewxvlvxwxqxvhevpzppeezhvvveqeuqheulzuwhuhzwxxxvuhpwvhqevzwxewuqpelqulxeuvxvxpuzhlwwzvwvxpehvwzupeulwwhzhwpwuzllpplupxqxlhwvepepwuvqvvqhlwpwpzlxzlzppuvvqvluwlphexhvqhwhzewephuhwhezhuhlpwevhqqqvuvvxhpwvqpplhhhvvhuvpxqphwexvzxluzuwvvuhehuqqlzquzuwqvvwhuluephzvlwhpqvwzeqzhwvpxhueeweuppqhezlplqeqzqhupeelepqeewqhphzuwxeqxuqeqzweezqhzxlhpvqqpuzevupwxqelvhwhuxhvvpwpzuquhzxzlxezvqwuweqvqezuweeuevhewwlhweeveuuquxpwvlluzhhqewhphupuuqlvuzlphhzhewhlzlzwuquvzphhzwpqhpvzulqeuwzzwpzxulzxwwplwlppeqzzuulwvpeellwuvpzexqxzppzxehlpvpqlqqweveuepzppqqppuewpwpuhxzwuevzplezweephzexzxwqhwuhvhhuvqeqhhweewewpwhvuqxlvzqxqqhlhzhxquwezqhwwqhxlpqwqhpvpluqxqxqxplhxzzulzhpplheeqzpvuuwvvuxvlzlpquxzvvxvqvzuweuvwqeqeppwxqvhzwuuvvhvheueelwwqhpvuuuwvevhqwxppqhzqwhwpvqxhpuzwqpplvepvezwhpxwlpeexhxvlvqveueevuqqlpzeqhzwwevvuuppxuhxqlezlpphuvpvxuhzllxueepvvuphezuhlqzlzvleqwvezqwwvlvxulpueqluqpxvhlpvzxqqwqzzzzwqvwvwhhzwezwzvxxvheehuhpwhvuuxxhpxhzqewupzveehpluupqwpluhlxezhuuxwhuhpeuqevhluevwupllwxzwqvpezvpwhllhvvpqezwwlzpzwuupwhvxllwlqwpepewlzeuvxlhlzpxqlewhzllxzplwqevwuuuzupupxpwqwpxlpqhehuzuheexqeelxxezhqxwvluhxzqpxuuzeqvquhwqwuzxzlvewzeqwlxzuwuvuwhhxlelwqvpwvxhuwequvewxvwwpxluwuzqqxhuuvlwxpvzhxweexequhxxluupzvwewwzhzwxluehhxhzwzuluqwzllllhhepuhvpzzexuuhxvqlvwpvvqleqlupvxwqxxqlxlhvepxxhvxqplxxlzzehvehpwqwqvwelqxuuzqhxvwvvuezvelevxqpvupulzueuhewwwxzeehxezpzhqlzluuuxuvleveweqzzuwuqexxxqxxhwhwwpeluzwzulhvuleqlhxuhulvwpxezwvuzuwexwuuxuvplwulqvvxehvqvlxzvewuhzeuwzluwxwqzwuphuxpwelhwewzzqllzxqwvlupvqvephpqehpwqewqxxpzpzzlleeqhqxwzpwvqvxpewwxzqwuqlqqpwvhpphzppwwlzhxpqexhlqxxulqlvhvlpulwequzhhzxqqlxzpzzeeqvuzluzhewxpwqxvqphvwppzzzelqpvlzuvpuqlxeqqxzvpxhplzwezlpuxlphzuhewxlehqxhvhwppeulwwvxqpzzwhhvzequppzvlxhuwwqxzwpzxezhpuxlpwezezueevxqxhleuquvqheewxqpqwxuuwquhqhhwzzwlzwzlezheluhzvxeuehpqevhqqqlluvplxvpvuplxhezxzzhvlxwqlzxwpepwzwxqphxqxzhxuezwhhzwuhwuuuwvxqweqzwpqvvwvzvvlpwuquzxulqllwlwepxwxlppxpqphxzpqepxlewlzuqevwzehhwxhzewlzezehevvueeqxuhqepwzuhvweevpwxvqqlelvhhuqzehpevvplwppzhlzuuhlvexxevzhuxpuvwllvwvuxhwzzvpxepelwphvqpzwevpepupvxeplzvlzwluxphvuhqezewxxlqzwulqzlxpwxxevvwuqqqulevqpzphpqvpzwuephqvphuvvxupexllqhhexqxhuplexpvlpxwevqlezqhwquplhuhzzhvllpxzzpwqlxuveleqepuepxqwqeuvhxehluevqlvvqqxwvvhpxwzvehxllqlwlvwheuvuuhwwphxwvlpvwxhewxpzpelqhwhqwuwxeeqhluephvuwxzwzluqezuulqqlxwwwzwzeulpuweqxqzhpwexzwuzvlhqlqvpxqxhxlulpulqxlxqllxzllphvezzvvhuuvxueeuqzpxlpvpllxpwhwzhuvuwplqvwhhwepuhhpwwllqevlqllzuzpzphplvvvzlppvlxhhxplquzhpqhzqzlweuhuqveqwpqweqhheuewppzwvqquehzupwuevhxlvlzpwuluqqwzexlvhqplevqlehpvpxvpxellpvhpxezhzehulqvlwquuxzpwuezupxwxqxvllzlqqqlequulwxzheqphhxlveuuwzppevqvxlzlzpqxzpvhwlvqwuqqpvzuvweppuqxzxwlvqzxzuqwlxwevhqupwlzuwzqxvphxewvwexzuplzzplqewhwqwvwwzlpvlhhlqzevhxvpwvwvzqhlwqeuwqeupqhwhvwwuuqxpvuzpxhzuzhhzpzequueqqqlzzuhxuewhvvehzzzvuxuxezhlpewhxxllpzppzqqzqhhepzwluwqlxlzehzzlquhpzuvehqqhhqzxzezuvuxxuwpqxpzhuxzzuzvqqpuzqzzpvppeexelvxhvqhppqlexpwpqvqpwwuvlxlxxlxueewwphwpxwzzueelxuhvwlezvzxwwqlzvhhqxwhxuqlwuxvexexpvxzxwpuvwqlzqhhhxzlxwlvvhlhwuvxuexexvuuuzhqlxzxplxuexquweuxpepvpvxzhzvppxlelzevppqxuxxhezplwqqqhwxlwehqvqwlpulzlqqupxquzvehevzehwhwhxevpzqqvhuwzuuplpvuvqwzxwqhxxxeevupuqpuwvewxzuuwpvpzwvzulhpvzzlehpxxvvheewlqvlhwleulxpvepehvqxwlpqlxphpwhwewllwvxvhvzqvxehlhwqwlehpewwlxhpqpxxeqvpuzxuqhvzvwlvhvqewppelzpqxhwzhwulvuplqzlvwqhxxzqwpzqluhqheqhhxvlwvuqlluqvelxevvzxvqxlxxvuxlluwqpzqvzwwlhqeeqzlxwpqzupqheuxwpuplvvzxueequppupvphvxzuqhzqzwxewzueevzqelqwlzzzepwuwllqlqhzhzwlvuwevlvuewhxuuphleeeuwxlzuxqxvzzuzpzehewepzvuwvvhqqwqqplzzpheuepvwxzvhxxupxhxuqvpweupqqwwquleephweuzhqwezqzzxhhuwlulqphpxhpqupwqplxlupxqpqpzlplxzewlhwxxqlhhvhqxhqhxhhhwxhxluupwwzzlvxluzuhlwezxhxhplvxweueqhexepzqwhululuvwluvezxwxeeewzuxzelzzzpqwewlqzulxlphlxvhxzquwpqulpuvepqhuvqqquevzzxlwzxwhlzxuzhpewvhwxvhpwhzqhwwlxepvuxxplzpuqlwpqxzzvhzpwwqehhuzplxzppwzuvvuqhwplzpqelxhheuqpuxwvzqxluqwuuwwluppvezupeqzxxxewzuquhzvpwppewvqxqxxwpuzzwxhxxuqhepzlevqlppwzqwvqwuxuxvvxhzelvlqpvevupwhqzpupvpuqppzvzulphuvlezwzhvzuqqqwhwzuelvvewxwexvlxvuvqlqvxheqeqquhhxuuhlqxvepppxpvxlvexhwveuzvxlwhqzwuzhzlzwqpuxquvevelxxuxevzhvelullxllzlqwxxllplwzquxxpzlvuqwulqqhppqvwqvhqxzeevhluppeupehlxqhhpwplzxzwqhvpxzvqupzupuepeeqheelexhlpvxupehxuzeuhplxehexueuhqqlhqqehpulezquxepeuewqezzzuuvuqxlhwwhzwqqqupplxwhvwqvuxhzhqvqwzpzwxexpeuwlzuzxqzuwlhxuwxpqhpvxqveueuqlephqllhxzlhzlwuzqzwqlxhqzeuwexuqelwupeelxvzquzqvxqveluqhuwluwquqqqwzlweehqhhxuvxvhlphpexlhqlwvvwwvhhpluuvuuwuupxvhezeulpuewplqppqpqlvqelvpxqxuhuhwwllzppxzewplpeqhulwhhvexevpzwphezuppxzzwlluxlplqeuvqwevuhxezqevlxwwqzeqehexewhzlhwxvuwlwvxzxxxppvezlhwwwuwhxuqxezhwhqvhlvzzvplupvxlvlhlhpexhlxpwwlwuupxxuqqvlhxwulxzqplqxvwweevvzqplhuheelhhqpzlwhuhxzzveupvzpxuuvvuwxqpzqwpuhlxzwqqhhvuzxhhlpuqquvhwqqzvuqxplzexulhhlhxqwpuqqqehuxxhxqpzxxwpxzlezzuhleepqwlhhlqzqwwvulzxhplxwpvhpplwepuzwlvlzuxppheqzvwpqvzlplpvxhlwwqewvwqwvhxqeehxwzewlvqzzlqppvlxpplvphzeehuzpqvphvpxelzxewqvxepzeuwwhpphvxzllepppwxlxeqexhvhuwuezvuzqvxvpxzqzwqxvlplqlqhxpzxheluluuhvwppuuvzxzlxuqzuphuupqxuzhuwzuupvepzlhlzquuvxehhzuqupvuzzwzuvepzplvqhzhuzpxupvhhhwqpxzwehpqehqhqzzpupeqqqwwxllhheqpqlelpullqlpupuwlvxuxelueppwluxxhplevwwpqwllhlphpuvvuhwwzqvxhhuppezwvezwhpqlqzzehvqhzepwlelulweuuzhvhlzuwulhlpplzzhpxvevhuzvhwqwlppuhhxzvvxqxehwwluxhupehvpvzxuquulqhvwpuxuleuzqwlvhhppwqluepxuppuvwwqxxzwhhqhvlhpppuuhlvulqhhpvphuxwpqulqzwvxxzwlzxzqhqvhxvhxxzelpzhvwlxqlelqewhuvxuvhzpuupxqqpquwwplwpewxpeeqhelevvhxlhpvluhwxlxxlhpwpqvpwzpevvpqwwxvhuzvhqevuhhlxquqhzzexuhueuqwwexlxqhpqpzwlwxxllpqulxuwzxllehwqzplpvwlvhxhqqpuwuwwuwqlphuxvvpvwzhvqzupxwhheuvuwxhqllqweeluvwlzeqwehpvxqwxvuvpqwezqxlelxhxhuplwuwxlhpqzqzpuevhxhhhzeeluuzxxvwevvwelqleezzuwelwqplpzupehquuuwquqzqwwwxphxpqwwpuwvhlupexxvvvzxvzevxxwvvuzhplulxhwhqqllqquwxqleeuwvqeuuxveewewqlvweqxluvuuveewevlzezhlzqpqxewxzlzxuxlqhluxxhvvpvveqpevuxwxvppzplxlqpxxexxvwwezxzhweqppvxxhevzlzlhuwzvlxzzquxhwlqpphwvpvxxzxzwhuwzhqlvuvehzxqlpvhulhlxhzwzqzhzzpuzhvxvqzulphewvvvlxppxqpulwqhwvpuhxhephhevvzuexzxqvqxlzzheuwpphpxueuuwlvvezxwehhqlhqzvvlplveewhpxlvpwhepxzephwwepwuwepzehepvqelvpwqxhxvpluupxvwpqzvxxlzxzqlqulqquxqlzlxlqwxxxexuvvupquvvwwwxqzelpzvqupleuzhqzuqxxvhhxvplhzpexluhlzveeupvxwqupzqllxewxevvehwuwlhupwvxppqhzvxlpuevpuqvuexqxevvppevxwuhuvxhlzhveqxzzplzuxexwlewzepzwzhepelxvexwzxvhqwphpqwhqphlxpzvhvuqxquwppvqlzevuvhuvhxpqqulllxuezzlpuqvexzxwxqwpuepqeqzzzzvppexuxzulpwzquuwhzupehuppqpwlxlxeelpwzwllqhezezpqhzxxpueevlzqzeqqpwveuwpuwlhuqxvwwvzqhelezlxhxzwzuzqxuuwuqxlzplpvlzlzveezqzpphqlplxzzuqvwzqvlzwzhuzhwqlzuuzwehqhhepvqplxvluveuzuqwluhxwhulhqpxhllllqqqqxvzplwquhhwphzvplpqwxuzqeeuhwqplwlexvxlvpqzvpzqlzwvhhvuhqhhvplvvzvezzlppxvuzuqlpwzxhxhvleqwzxvwewqzulhllvzllxzeplwzhevlqlezeuppezevvuuepvewzpvxevwhphuelxhuqzulvuqeexzppxwvxupzqueqlelepxzwewpwhqlhvvleeequxplhxewpxuuzqvwuvwquhwzpplxuzewpzvwhzexhelexexlwvplqwzzqwlpqulelzwqhwlwlzhlqvhqezlhehvlzlexqxxupwevpvvuehlzlexuvexhxpvwwwpxxqzwwevpzhlqvxwewzzxzhvphppwlwuuelpeequzhzzzwxhwehqevxwxzhxlzlpzqquullpuhvhwwlxepxvzxvhhxplzupxhqpzzepwvlvheezuhqzqwphqepqwqqvllqezxzuvlvllvupqlvwqpvxephqpuxuheqezewevpquevwhzuplvvpqvpqqwwphqhuewpqvpeqhhpeqzhlwweewplxqezewqlppzxwvllveehxvplqlvhzzezqqqvlzhqvlqleuvwpplvlhxezwhlquwwzlllvzzuwuxulhwwezppzqvqpuqqpevlplvzvluhzlqqewwueewvhpuhwuvwhvllxqewvplpvlvqhhplzlhhxxppzlqxepphwwvzueepqwxwlpelpehvhwuwzzlwexelhpvxwuzlxelzexexehuuwlqlhpexvehllwvxuhlhueevvzqeupzvvzvluhhlhzwqqupeppvxhzvhquevhvpehhxhuhqlhzzxezuvhqhwwpzpevqhvzwvxlqwveulpwlvuzlxhwzxpuzxwqhvhuvezwlulqqvzwppzwphphpuwhzhqzxhwlpvhplevzeppezplzwxzuzqxzhzzewvxelzhxxvzlvezzlwwllxluepppzxelezxqpzzxexzvvzuuzxplzlvezhuppevwvqwhppuuzvlpuxhhuvxexwlluzhphxhxeulzqxlvwqhxwlxelhlxulzphuvvpxepzwxeuxhvxvvplvxzvllqupulqpwzvxllqxpuppevzehehqhlvpwxzuqxhxvqxezuvelullwlwqvqpxeullwlqxvuluvpxqhlxleevvhvxuweewxhqpqvhlvwplpwvvpzxwuqqhpzhzlqevwuvvphhezhpzhqxwlwpuuexzwzwzqqxhxwqpwzzzpqphhwlpqluvxhzwhplulewvhulpqhuhzxwhvpvhpxlwpulwvulpxeplxqueqhxwvzhwxevzvvwuhelpuhwqxeqqueppeuqhvlqhhepuzwuxxzqzhhlphwulxehzuzwphvuvqvzwquxpzzphhwvwhphxhzqxuwqwepezxlhwpwxllllpxzzewexpuwxllzqwpuweuvuzezvpuvzehvexvpelvezqhxuhehpullhxwhphxlepxluplzluvzevwlxeulxuplwxzwuppwelwxevulzelwzevqwleqplqepehwvwlpphzppewhuepxxqveqhuvupxwphpuwpqlxzzuvwhevquqplvveewlqwxpvhplwvuwexwewexupxwevellvvxxeezpvexxvwxwppxzpewuhlhwhwzluuhulqvqxvxwzppxuullluvuevuzhwlvpqhehqvvweellzvqwlzhehuzeqwxxuhwxwvphhqhwuplplwllxvvxqwwqvphzxeheevevhqvxhpzzpxpvexppuehpqwquevuexhvpxhevpqewxhuwpzqhzzhpweeqwehzevvhpuwqlwlpxwqhzpqwvzpxxqexxqhpweexuvzuqpuuhqzulwwehelwwhwxpvpxppeqxpwhzqulzpzewelqexvuveqqllzueezvvwwphxxwzqvheevzuehqvvqvwqzpqqqzlehxuqhueuxehwzpvlxvqplveexxewvupuwvvhwzqpeplvhuhxelevqxhevhzpxquvwzlplehzuwzexqxvwzwzexuwxqzlzzvhpwqlwwleuqlhuelewuzewwexezhzvxzpqhphqxxvvwqpzvzlwxehlhpzxezuzqpheepqzeuwhpvpvxxhxwplwhzxxhuzzelzqvehzpqhwqexzvuwxzhwqxlqvqewlvlppvlxzzphlxqlhqvpleqpleqeelhulqqxphxpvuqqvvwzveqeexxxzhxeuppeeeuwlpzxqxlexuhxqvlevvxlluxxppwqwewpulllhvelwhwlehhphuhlvpqpxuveueeepvhezuvhhxxuxupevwuwullepqpxqepxveleuxezqwvleqxvxqqhhzqpzeleuuvuxpxlvlelzvuuvulupwpwhlelexxvuelluzwplzxvwwlexhvhwzuwqphquxzlxulqvplpqpveveeqxewqellpxzhezvhlxqqzqxhzqwuhqwwlwwwhhlvupquqezwwlvvzelqvqvuuevueuwwhuvepxuvxevlhzehuqwzqvlluzqpqwlvpvupzqwqzppxwwelevhxwlehlzluhvqepqhwewqzxxxlqxqvvwwpevvulqqplxzzwexleweqhvuvlhzxlzxwewxvphluzwluxwuphwhwehqewzqwqwqeuzzehhhpepqwlzuwlxexeezlpqhvvxqwuvqxwxwzxppqvzvxvqvzeqzlpzlhuxzxwupuvlhvlqqlphlvupwqqwleqqvxezhhezxzxxvuvzwvhpexqqeueuvwvzhvuqlvqqueezelleeqeeppwpehwlluluvlexlwuhxzqzpuwzuxuwphvlzvluhlpulqzzevlvzulqlhquxexuqxpzpwphpzhuwxquzeuhlxewulzehxuqhhvewwveuhewwuheuzxexwewwhehpvlxuzhupvxhzxwqplpuwxwwxxvvpuzqeuuzvqhhuelwwuqweuvpeeeqvzzlqxxueueqeqquwxxexlhxlqxhvuuvpzhlhlwvxvvexvezhqlvupxhhvqzhwuzhwzzulxzwhuhwuvzhxwphwuxqvuzuxupvpwpzwvxwpxzphpexqzxupvhxqzehzwhuwzvuzeqhvqhqehwllzveqlvwexvvphxhuuuuxeuvupvpuzvlvxuwqwzuzpxqqqvlhwhephquzwxuhzpwhvqxweuwpzwqhexlwwvlxwvhvzxeezhuuhxxupuluvwzpvpelqvvuqhweuqezuxeuxpzuppveuvwepwuvveueuhzpeeqephuvxpueuluqxhvqhlphxvhwpqlvwzhpppequqpxxvvhhqphxvpequlqvpvxuxwuvxwppzllhpwxzevqzewvxewvehlzuvxhqxexuplqpvhepqhvuzuhvppvehlexlhuwxpzlxexxeuphhewxhxuelqlwzeeuhzwezlpeuqupzeuwlheehwwqelxzhlvxxlxlzqwuwvvzhuupleqehxvpeuueqvhuwqzpvhvlewqqwwvhvvzpppeulqphvvqhwqxlzewxlqxqeuvwlzpwewvqxlzpvuplvhhzulzuzvwzewzvvewlzzqzzllewhzuxzulqhvpvzqvpuxqzhzwhzlpxqqvzqvzxvpwqpzweuhlvevupezeephxhxzevzhqhuzxehuewlpllzzvuuzplzqpxuezvuqluwzwvzxlvwxqpvwqelwvzphzewqzlqpzzxqpzuluehvluwpwlwuzehllxhuehuvqwqhequevuvxhwpeppzqlvvqqqehhpxzquveqxpxqhlzzvplwqlxxzlqzvvupwzlxlpwqqphpvezhvhpxwwqevpzvzpuvvxxxupuupxlwuhzwquxvxqvvulxxqquqlhzvvlzhevqzhwwwvlevuuveqeqpwvulhqhhzwwzwqveeuupvewqxvepupxxqwzuexwpezhwlzuqzzhhwxuephvpepeleuuzhwlphxxuxpezzwzuvzwwpqqwwpuuvpxplvxqqlpwxqhxxppewplxwqpxhxwzluuppzxelllzxeqllwexqvqwwzpllqeeqwepxewhzpwzxvvzuhvxvzwxuvhzepuhwuuvzxpqwzuehphwvvpuvwxzezlxxquzvwzzzvvwwlzepxqzvlvzqqpqxvqehvexwhxqqpxeeuxpzzxeuuvlqlwzepphwwxuleuhzzqhqzuxexheqqzlqlpzzezpuxqqeuupzlpxqehvqxwplvqxxhuquwwpuuppelepvezhvwphwpxlphpwxzpxlpqqhluqqhlwvezwqxpllqhlpeqwevulzevvwewhqzeppzzvpzwheqpwxulhphzwqhluhxwxpqpqquzwlheeuhwuwqexqwuzwehezxuqxwpulzhzwwhwwpwzuehehvwxvuzpvlvwpzlvpzwvxplqhlhlelpzpxvhzqqvvpwvlxpzvzueuzuhepxxwzexxvwwxuluzvehvevlvuqqxxuwvhqzhvlpelveqevxqupvlxuuuwlhzupqwhvxveqqezwwwqwhqvzhpvvvuuxzzlpqezhhqlpwwvplquwzwhpvqppwzqlvvzllwpwzheueuuphxqwzxxvuqvvuzevqquxuueepeupzqeuuhwqpxhvhqqxhhvqequpupeluquzhzwpzpqlpzwhqxeezullwpwxzqxlwpehehllvzwuquqwwvzxehexxwhezuepqqwlplhphlqelexwvpllxpupzvxpphpezvwpexqeuxhwxuexuxzuuexhewuuwzqzvweuzvlupppluppeezlpxqvvvpehupqlpwphlpxuhxvhhqupzlxpqqpzpqwehzlvhvlvhzqzeuhlvhvqelwewuupqpuvvquuupzzvlqzvluzpxwevellphqlvvzwlhplepueeppuuhlphzwuwllhulzuuuzqhlpeuxzewpvqeqelezxwexuqveuupupxvpvhuwxhqvhvlhzplzqwwpwleqqlzzvzqhxzzxquvuexpuqxqvlllvuhzppvpezuhlzquhhhwvewhxehwquxlhvplxewzvxuxzvuwezlupqwwzuewpzvxxewlhpehwhlhpzplwhvxwlllzxhezzvzxwwhlvxphuvvxluwvxvpuxwlqvvhzhehepwwvpzpphwwquzqxxewzpuqlzxevphexuuzhlxxqpleexzzzpewwplleupzlxqxlepqxxzlvzlhzulweqxhlwlezvxelzpqzwwqwzxxuqhwwzlpzlezhqqhwwwzxxvuxlxhheppeuhvvvvhvweqlluvqhlevzhpzwuvpuqpvxzxpuuhzxpqzpuvvqwxlzqzvhqqxvhqzpqqppuxlhwqxevqezevlpwqqlhuweuhquvzxxqzpelvhqwhzhpeqhuxvpwpulvehhzpvelqhzwxxwwxevuvhuxpvwlhxwpevhqplllpqxulehvzhqxzuwvzqluvppevxheuzxwuwpxqpzxuehwweuquuezxzvhzlehzpeqplwwehvllxlzuuwpeqeqxxxlquzhpvezuuxvuuqhlzeexwvhlppvxexplwlhpzvlpqvwwxuzvxzxvxelxvwvelpexqhlpeqlehlwwxxehqlzzwzhuvlwzlhevqwqquphzlzpqwlhpuvveevwpxpwvqwhqxhzqxhvlvwvvlzhuhuxqwlxqqexzxwzppzluhzvzuulpepxpppuzvuxqxpulvupwhweqvewzezwzpwxppqxhzhqxpqvexhquvlwlvewzuhphhuvvlhqzqhhplzwqpueqzwlulpuwqvplpexzwpzelvzwulqvhpxvwezqeuuzphlvewhvhxuxuqwheewqzvhwqwqpepzvqxqvvpluzzlwzhzhvqvzelhluzqeulwhuulphwhvvzulpezwxqqxvuvzqwxhvwhvzvqzxelhpvwpqexzxeewhqlquuvvwxupxzqexuqevqpqxuzzxhvewqeuhzqzxhxzwlphulvvhhpuevzppwvlzzzezewpquellvvlewwzzlzquhzeqzhvvqwpewelpvqphhlupzlzevxzhqxquewwvlzuhxpxqzwulpzvxwvhhwvpxxhqqquelpuqzzlvqpzvhuzhqpxlwlxpxeevqhvvhwhwwzvwpveqxevevhqqxelzeqlexxleplzwuuqhuehvxezqxvvpeuqphqueewpelwwvewqwwulzzlphvzhlewvvuuhqvpvhuuuxqweuxvzuvqlewxlxqxelwqhvhwxwvlevzvuuqvexwvluxupupweehwqwlezehzxvqhezulzzqzeewueleuzhpqeuuhhulxxelquwvqlppvwpxlxpvvuhvzhzqzwzhwvqwheheqexxxueqheexzwezxxhxzzqvllxlzqquuzqwwwulpxlpwuzwuepxpullueqpuvlpwqeppppueqvqvuhqzweezzvpveuqwxwzzluxlpqqvhvwlhvxvxzxlzzexxhvulxwqhpzphpllqlqqzvulhpwluuewphqvzqzeplqzphquwxlvwleqxlxxvewwwlxpvuphppwlpequxqhllwvwlewhhuhheeqvhewwwpexevhevqlvehuzeplwewexuueuehwuwlplezzhhwlvvlxxlvlvplwlulxxlqexpvxpzxlzxwhxhhzuxeqwpezxlxvwqhwqhvvueeullvpuwqqzhwqplvwzuzhqwxelwuzuezzqphzwqphxellewwuzwzhzqppwqwxpzqqxwzhhexleqvhlhpwlqevplhhzeewwqxezwlpuqhwqxheqlvvvepzuqvpxewqzzuxpvewuuvupzhzxxwqqhzwpvlhzzwwhxhpllehppxvpxqqevwqweuehvlhxhxqppzuhzpuhzvlppwlezeluvzuqzzlpqvpeewleqhlzelquwhqqulezuhewxzxvwepxwzwexpuqvxhzqvqvlxxueqpqpplhqhvzuwweuzexwuwxvuxhhhvpueuwhhpeuuullzeewuuxzpupqzuplzxwqxupxwwlxxxvlwlvzezeuuulplxuppwzwpuhqpxhwuhhlelxxwvvqlzppeuvqwuuvzwulzzqvzlhwlhlvvueeepzezxlzhueplwzuwhxlxuwwvzqzzwvqpwppleuvxvxhwheuqxupvlqzppevqvewvuphqevxuqpvvzzexlwvxvepppuxheuzqlpqwqvlluvpulepwlhluhvhvulwvewqulzhxquewxxxeezzvpzuzlqellhhevpphwplhuzqwppzhuwqqppplhvpewxzpqplpeuheqzupqqzqxhxpezuwvxuhvqeulwpevlhhuuzwululxhqewhhwuevwuxvwlhxxwqwxxuzplwewuzhwxpwvveehhluxvuwhlzhwlzvqwwqqulzvqqplwpplzqxlhzvleewpquxuzeuluhqwxvwxhweqhhlzpvvzzvuxeuzlxwzweqzvuqplvqqzwlzeulpvzpupveeuhzhwvlzhlzvwzwzvxuuxqevzquwqwzvhwqvzxhlhluvlvwpuplwpxxuezwepevzzvpqpvzxlqvqpzxzlwxuvhqepzvxvpuzqqvlveuxleupvwzezuzehqvwzexwwqpuuzhwuexplleuepqlvxlzvxelpwpxxqlwueqwuvlpzwulxepvzhehlzezwqleqquzpqwvhluqheeuqqzepeupvzzhwwxwwquupzllvzehpzhxqhzxllwxzlpqezwpxeewvqexphvpwvqhhhvvhzpwewwzxzvppwvwxqzzxqhewvqelpzlqzqlxwpllewxqqlehzupzphvwuhpvqulpplhlzuvpqxepzlpqwhhwwpxhlqxxeuzequpeuhlhpewleuxluepxvewuvvvplwpuxquwphzlhvvheezhzvupxvhlzzzehqllhxpuquqwhxluexzwhqzhvwqxuuqzwluvqphxxveuevzvxlvpuhzxwxzwuveeqpuuxzvweqpqxpxlvpwepqpvwxwqqppqxlxqwpwwhqxelxzlheplpqlezzlqephellhxhqqvwexqllxuqpvzxvxlpuvphhpvwhezhqwlxwuzlqqpuqlevxlvwzlvxwuvwlzulwzxplwpvpqpvellvhelvvhzvhezuwvxxqphpqlexvuvxwuzpuxqwxhxhvuvxvhuhzuzlewzqzqqvlhzwphehpquuxwhxlvplphhlphewuvwllxulzehxqzqzlzquxxxvwqpuwlwpllzqphqxuxzqluuphvvpppzulhuvuuqeqxphhlqvlzuzhehluevuwwwvhxlvlzzpezvquwpuwpqewhvwxqexepvhzpueqqqwwuquleevplvqueeqqwlqxlqqwhwxpqlqzleqvzqzvpuhluqwvwwvvlqqwqpxphxzqzzxuezeewxhezuqhqxzuvvepzehulqqpuzqqlpqhxupwwhwpuhphvvelupwlqlhpevewewpxuhvlhuqwelelexvpvvplxplqqqeexvvvzpqluwpeqevpwvpvqlexepweqvpzevwhqxlwxpwevelulequxwvzluevupxezvlvquxupwwuplzxqwwwuhwwhqezpuuupezwzplueuzexezwuwvwzuqqzlwuhpxuwxlvvuhvuuuulpzlzzqzqquluhuhhwqqxpphqhxehvvxvqepxevzuewxpewhwhhuxehewhvwzewpxuvxuezvzuhzwvqhxhquzuvpleveuwlvevuwhuxllqvzzhxezuleleuuzezvwxwwhqzlvpexlluwhuxuewhxqluvqvqhvlphplwllpluxzuxwwuvwxpxweeuwzuwhplquqluevxwzqhlvxwzzvpuwqvvqhuulvzhlqvhzlzqppzwlxqzzeqpzqzupxvehwuuvwqpzluhvxphlweuqvqqzuvwplvxuxqqwuhvhuqwhqlwlxqvpqwwuxlwxlqzppeqzzheuphlwxveeuhhpllqzzeewuhqzxlqzeqxhxzqlhxqxqpzulvhhxlxvlplwpweqxeewlqvvwplxwuzpewlwqehzpuheupvwpleuxqwqvwzvqppepzuxqwhzquuzqlxvqwphzlzpxvwuhueqhuquuhwuvuzxehvzqpeeehlwvzvhzvqphqvllzqxuxluqwquuzwqpupqpxezpzulwxquqzleqwxqzvpvzxquqvphuhqxhuevppxweevhlxpwzxwphqpqvheqqxpxhxxwuqelvwqzhpxewxuuezvewhqehuhhvxuupqupqhehwevwuvqvxzpwqevehxuwqwuwwwwpuuvqhphwuexepppvuxxxxvewevuxxwzvevexuvhphlwheevzvewxzevepexlxzlxuvvvzqhwwvveexlvzuvlxeuquulvzqlvwezzzuvzzehvzlvuluhluvzqvehlvehwqwwqhwllluxlphuvupelzwupuplvlhlplhhxphhweluvzzuhzwzlupxzuevwpqzxvvuvvqqluplvexhuxzeuuuvlxzuqxqwuuhpvxlelvlzwexhxhlhlulllevvuehwxwqvzqxpzqlzpzvuewheuulwqlzhepzxuqpppzlhpwlvzquvexqlqppppxwqhhuzluxpuhehheqwexwzhepqxwxewpeqlqepppwxulzvlhlwlwhhhzwvxewxpxxvzpqweexquzxxlqwxhulqwqwexevxvlqvhzzwvxehwwwupuhvwwlluqpzehhhxqwxlvluevhxzxllvlwuuvwpwhpquvequwzhvzxvewvxuezxeueqlvhvelhzlvuwevwxepplehlwqhvhzzeqwhhxhlpxwhuqphzvhlhvpqzveluuwxzvvxxhwzzqeueexvzxhqzwwwhhzvphplexuqepeuplqpwhhewulhvzzwqxqllvxxvqppewlhvqqluxxluluqvleezzevvvqwupqwpqwpwllexwhxuhweppqvhvpqlwzupwuzuveulpeqxvzqquqhxzheluxhulvhwwweeqeuxwwllpeuxeeqllqwhhqpuqvhqleveewpzuplzeuwwvvqhlepzlzwxphpxexhxlzwuehpphehexzzhlwpvxwezzuhhzpeuxhezlxllpzeezuhpxupeveeppwpxhllwxexezqhuvllzzpeeqhwqupzvxehuwquzeelexhvluwwevhhlvpevzwxwllvuexpeuxxweqwweqqqpzzzeuuqzxzvphxwuqhlhquvwvxehqvpzxvxlpqxlpquvxuqeqvzvlelpuzpehppqpwlhwpxlvzvvexhwplwzvlzhuuvhqzxlxvhwuwezwxzwzewzhuzuxezquqvexuuvhzwhvuhpvueupppxpqxqxpzxqvhvzwuwqxhqwwzuwueuhepzvvqqhwqzxqvphvlwwullezwxxvuexppxvhlvhzqxzzvqlhphqvlhhqxqlhuxqvqlppvzqvuevzzhuzvpqewxzuqepzhwwepleuxuulvhveuxpuzzhuveeqhevxlqlvlzuzxpuuezwpzpvluvpqqzpuhlhexqeupqvllzxpzzuuqxpwphuwuzpzwxveuzwpzvzplpwzeuzxvuwvvlelupezxehxvzzxquvvhuevzqezppehvhqhhulwhxezeppxhluzzuzhxzqqhveuhhheqplzluuxulqqwehuuwevvhuwhwpupzxwxzwhzppvxexzlwvhpeuuxwlwllvhzelzuuwzheqqzvvwluwzpxvwvxxhuuquxzwxeuepvwxweeehqhhwwhlvqwpzevhevpxpvquwuzxvxvlupueppewpzvphwpqvxwpqwzexvxwzlpuzhpxhpluexzpuzevqqpvhuxhzuphlzlqlqpvuxwuuwwuwlxzhvqewpzlqlupqhzpzhzxzvevlxpvphzppxlvuxzwqhxehvqvhzhlllulhphuquxuvxzexxlvwevqvvvelvllhqvevvzqeezzpleqepwlzxzzvlevelxlveelxwxphelpzhluzqpxuuepzhxvulleuevxulwpxqzzewplplllxvvpwhevqewuhvuzeelzeevuelzehuxvleweqvwpqhhhplxeeehlwuzzvzpxxuewuzxvpzevhleuphqlzxppuepxqzxzezvhxzwxzupuepzvhwlpwhqphvllpqveqephxuxvzxeqwxvelzquehuwxxwvxzhwhxvvuhhqzzqqxhwhhhwewqzhlwxvvqeuphqqhpeeuevqlqlxewwuppvuqxhxqzxxqqxuhzwllzvxvzzhzwqulueqxhqqpeuvvvhxvpwvvpxlwvelzuhxhlxhqvwqquxvvplvqwqpehuwzqvhhhuvpvwqwvevpewuzuwhpxewpqevevweuevvxqhhquxullewphlpvxvwhhpuvlepwezplpepxlpuepxxpelpllppquxvqqqhxequqzphlllhezvwlluwhuwwhulvuzuqhvwuxlzzphxzqhvzlwlzzzhzxhvvpewzvvzuehewqwwzveeehxqzwexpwxxlhwxwuxuzqwxvwzphwehphlwpxlxhqqvewlzqpvlzxqvpuhlwwqelpwupvlwezpzupvuxueewqlulevhhhzezlppvvuuxxxellpzqzuwzuvhplwhevzxwxhxhewwplxpluxzeupzqppvhxzeeeluuqvlveuexhzeluvpxqhheuwhhzwplullzvvpwpllevvqpqzvewzlhwpvppqwzlxhwxhlpqqxplzvvvpvvxhqxlwewlwezvwphqlhlzplxwevhwwllzupqwuqvheqxhuluevvheexluexqleuwpuqpwxlvwhplpweuxppzlwquulzvequuwpqxzhxxxwlehuevuzexxlqwqqevppeppeuzlelpwexzzwuxwuhelwlxvqwlqvlepeeequepvpphelzupeuqqvhpzxlvzvveelwzquelpwquwhlqzlvzpuwwuqqulwhzlvqqpwvphlevhphehuuhqhlxhxexvwvevqwwhwzpheuluxuphlpvhepzxpxuvhzwpqqpxhexeezzvlqppevplupluwewwpvxzvuxxhwqwqlppwvwhwxvxpeueqzepwlpveuelzexweuulqxqvhqwxvwqpzxllhwephvepuqzuxhxhquvvpwvvehzwzplvpvupwqpvvehuqxewuwplquplwllxlepepqpezvzhlexqvzvuvzelxxelelxzwqpweuvvupheuehvzzpzhhqeuwqqvwuhevlpzpwehpzxepzwlvhhewhqvvvleqvvhqwhvvwwwphhvxxxpqqlzxvlxpxveezezvhzuzlppwlxwzlexpueqppvuxlwehxvuhvhuhlewzzhzxezlxeqwlqwhzwxwepxuvxxwvxulvzlpvzzhqpwhpvhwxhpuulvhpxupwvzeplhqphpvhqulwqvvehpwxuehlzzzpelqleqlevlvxulvzeheqvxhzplhepxvxvllzuuhqzqwvvzveephxllzvexuvlqxlqexvlpxuhlzpvhuzevqlpehpqpxvhuxqlzlzxvezqxhzhlpweuqwxzuzqwvquxuepuxlhzupxlheevwuluuuxwuvppwwqluvpvvlpzwqvwhzzvwpweuphvlehlvxewlvphpphqueeeupevulwvuvuzvlhvluqehlehzzllqpwezlphhqquvewuepqppepphqeluwlhexlhuzeqwhzxehuvzzlvpvpxezhvhxlxxvpuewhlzxzqzlzvzhppheeqeplvpeexvhlqxqpvleqhxhuqxlzzvqwvvwzwuqlwvhzzqqepehllewzhqzhpeqpwpluwpqlqupvpwhpehuxxwwuuehxlepvuzxpqueeelvhquxppxzpuwxqvuwqzelqqezeplhxwwvllllllxxwzzuhwvuvwxulvzlhhvlwwqwlvpxxvuxuvxwlhhvqhelhexpwxxxuhqexhhlzvqwzzxuzvvvewxqhzevvlvuxheuezlxxvqxpzpzpvqlvpvvqhqpwvqhwulhvuvhvxpqeqlhxxpqqxulhwpxhpwxuhquwplppzhuwpxewuvlllwepuqwehezqwuvvueuvwqevepquhpphxvuqzvuvlqwuuluuqxpxuzhwuhlxxhluwzvqlexvhwlqlxzqhlzwqzqhquwvphqzzwxquqzpuzvpvezexlwuxlezpepluehpxvvhzxuwevlqlpzxwlhlpzqxveezezwhuehwepxlvuwuxqpxvuuwxevulphzzzvzlvqzexelvwzxepveuhezxzluhluvlqzhwwpupzlezxpxvzhhvzvqhpvzeqezwuzzvhvwveehwhuhexvqlqvhhwezuzexuuqxwpellevvvhhzqvzhuqlhzxvvlzlzhqpxvplpzpxuuquzpeweupqvheexzwvxhqepqzqlxvqxqxzvzpwehqqeluhpqqluwvpvzexhwellquplzzwhvllezwqxwevvqeqvxwwplzzullxvqehvlpvxhzpeuzxqzlzhlzvhqzpveqeqqhqqphwqzxwuvllxvqleuquhxpueezhluuxhqlzxevvhuxzvweqqhvxppelwpqxhwqlzehpehqvpxwhqzehpwpeluvvzqqxqwxhuphwvelexuwphupvuhqlwqwpxupuxlvzlxpwwpvwxeulpwwpvzeexlqhzvwuhwwxquphhwvpqhllwwueuhpqwxlzhuxpzlwhzqwwuwllxxqhqwlehuwzhwpqwqwxepxuveehzzquevhelzvveuuewpwwhwpqzuzexvxehwhzzuvlhhpzzevzzwhqpqvxplwlhvqqwvzlqwqpxwppqvvlwpzzevhvvzvehewvzxxlwhhuqxpqulexepqhxlhvxlhwwxpvulwxvvhzwweevhqxuxhxvevlqwvzleellzwupvwzpvvezwveepeuzvxlplpvqvpxqhxzqeqpwxxzvvhzwzwwhzuepzuuwwqqvewzuheuphzzqzqwzxqqexlhplzuxhxvlpxpwwwwuupuzzqqhxhxeuepuepeqvvwxhwwlqxzpzluqxxhwuepxlhewuwehuuwlvvqqxhlwqpuhvuzulwehxlwhlelhwqwvlzwlvhppeqhqhvvevhelxlzpluluxlzexexuupvewpwveuvhzpwzlheuzvhvqxzwlluuzhwplxzqqhxueuxqezzlwwxlllwuuwllhupeezxwllpupzelheqxewzwwlpplzphxqvuwvvpxvzllxhwvwppwpqewuwxewqpvzwzhqllqevuevwlpwpvzqhupzqlexqqpqzewhvquhzqeqhvqeueezewzpvupxzvhhvzvxxvzupphppzquxhhpwuplvwxxpxwzvhqeuwwpvhpzhuqwwlppvhllluuzzuehvxzzeuvpvhxxwxqqwuvpqzpwlvqheulhxqlzvpqhquxwwpvqzlllqqlqxqqxvpvphlxxwvpxpxeuzphwpzeeluwzelxqwphxqhhwzxxwzqhlewqeeeqhxueeqwxvehhwvhuuquweqphlewzexhvezwwhzwlweqxvvlhwzuezwvpxqzxwpzxvvvllpvwzuheuwwewwzuxulzwuxvlveqhhweppvzuwxqzxelzxvvhlzhuzvveqelpeqzpqxuuwpphzhueuvpvewxqleehzqwulhpwlzvuxlzpqqvxxluqephwpzxwxzuvxzhuuqeqvwpplpvvhqxwuvuuezuvupuxewvwhphwveuezqpxeepwzqxvwvehezuzlwvxpvxwqxzheqehwepulwlqlxwweuwvuuwlelqvvwpllqwvxlxxpvzqpqxxlhpvzvqlxpplzwwzuxellqxqhlqelzluhvwhupqhvvpwlwphzqxxuhxlewevllhuuzzulqzpzuuqullpzuxwpwwvvzzlppexqpqzxuqlzxpvllvpezlphuhvehxxlxqeeqvquphpqulwxzvpvhvuvzluweueqqhuvlellzvvvehxlqqvpvwvvwevhxvzhuuvupwxqhxwvuupxelwqlvqxlehluxlwxweuezvhhelzzzqezlluhhwzzpepexzhvqhvqvquxuupelpxqxhlexquhxzhlzlwzeluzxhzweqwpwvvpvpuvlpllzexwzvuhwquvelexlqlqezqquhehqvvvqhxpvqpzvpqhhzqzqzehppuxhuuuxpewvzehvlwuxwzxpqwpeezqhqzewzzulxzqueheevpwhqlxpvvezlwpzlelzlezuwuqeluqwpepuhwxxlxzzhuxwluqpzpexzhheqeuwpeuhwqhlxphqwelzwwulehuqxwqpphxhhvzxluxzlwvhplzlwxxpzlhvhuvupzquqhlxuqvvzplplqvqzlvweeppuzpzlqzpxzvhzxlplpeqxzvehqvqulqleuwppehqzxllquqxxvhxphuzzpplxzwwxwewwluhvquqqupuezzeleuzzhezpzxphxpwqhqulezhuupewzqzwxvvzqwxulzxxeuwphqlhwepvlqzxhwzevzuuuhqphzvxhvwxxpquehwxvzhuluzpwwpluqwpxqluxhxuwxuuzqqhxpluwlpluqexvvxhwwhlxveqpleexzqxleuvxvhzpwezuvlvluhluulzvwxxxxhvlpheulvhezeexhpuwvqpvvhvlpzuupeuulllppwlvlxewppeqquzvhwlehlllvqzlhehpppzpeuuhqvzxxhuwxluuvhhqxhvlxhhwqupppequhuzezqzhxuppvlhzpwzepvlzhexuqxehwhwxwvpvhvzxequhehhheluxpzxleqxhlquelezwqvxulexqexelxupzevqluhpvhwzzuwpzuqquewupuxuuwqxqvepvexluqzquehpvqzzxzuzzhuvzpllzvhhzlzzquvppeelplvlqllupwluezwqphzlzwxuwpeveehqllxexhlhuwqqveppeppvxzxlvuhhlwwlwpvppxlwupwpeqezhlxvvwlhhuewwqvzvwvququqezhqpluvzhvzxpqlqzqulevpzqqpeluzxpwepvpwxepvuzxzvqphhqxlxewvzqzxluvppvuwvvvzpuhhwulzpxhevlpqpvuzeevxwpwlqvvlhhwwwuulwlpluwuvqwwhwlhphxhwhqwevhwehwvpxzewuhxhveqveqvelqqvzeepevxvlxwvhpwvwuvhxwzwquvuwwvpvlzqzvxwqwqzuzzuxvwvwehzxhuqppqppexevqhzwvwwuxexqwuxwqlxhvuhexvpzvlppvvzlxwwzeulephleqeqwwwwxpvwellpvqexlzquwhehupxpulpewvzezhxpxhhpulpxhhuhlezezuuhuvvwezlweevexxzlvezlpuvlqxwulvxeepewqvwvqzxpphqxhqhlpehhluuqvewwvewxpulwhlzxhxeupzhvlvvxuwppvqzpqwepxewlwphuvlqwvhqexpwpzzpquveehxzhhxwuuuwlzxhuwphxllqpvhxzhvpwpeqxvuzqeuxzlezxxhzeqqehzqhhhqpvqxvqpqzvvqvelqvwplhpezuupwxepqeuuqlqxewpehzuqwuelzquuvqhvpzzhvxpuqzeppvlvpuhlephuzwqlwwxxwuwhzxwqezzzzzhvzpuqhehquxhhqlzlvwvzzleevqlxwzqxzqzvewxvezhvepxlzuqhlvzellqphwhxeveqllhweuveqewvqhvquehuqvxwpeqeqxxxxwwvxpwqqhplzellhvhpwpuepuwphpwqlpxuphqvxwheuuvhqqzvluqqplhpxhxzxwlezhzqlvwqvzexpplwhuuvwzlvelxquwxuvlqevlhwzwvluuxhvhqevhwzhzuzwwlqevpxelvuzllzlwuqqpqxvwxuxvpqzuhpxeelzhupxwwxxqxeqeexvhzvhwhqxzxuuwxzuhqlqlwxwqllewlxhueheqeqvwqqwzpweppvlhhvxzhhzhxxhxpxzuevzexuwlzvuqppzpepvxxuuxpwxuxpvqzvvehxeuzwwqzlwzxlpewlxvuppvvwpvqhqhvuehvzlzzvqhzzezehhhuulzzwupeuwvhlhllvvwwpwqwpwzxuhleqhuvhqlwhwxeppvxevhezxluqevqqxexeqphuvluvzuvlzqpxwxzpxwqzpwepxpzzzwvwquwxxzheqvvwpeezvqxeqhelevxvqhpzupxwvuvzuvvuxvhwweqwwzezwhewelxhhvvlpevxxeeepwwhezpvppvhhvhvhwzezhexlxwhzqxzppupxuhwvwezxlhuqlzxuzxzqvhqhxupxvwuqpxvheuuhvpeqplhpelhuqwpvzulzxwellplvezuzhqwhhuequzzhquvwlhplelhleqhzlevvhephhqezwvvzwhuvhuvuzzquhupxhhuqluqhwzpplpqqxwzzezhpzezplxwpwzlelxuwpxlevlwqhweqxqpwhupuluxqeluplqpqqwwvpxlhxhhzpuuvuwqlulvehpwwwweppeqhexqvzxeevwwwuwpvwvqpeewvwwvzvqlvvqzqxhzqqewuuzpphhxwuwpwhhzpwuvxqvuuuxeuhxewzzxxqvxzewzpwullhqwuevuhuzzlwwuhzevexqevzuqqzpequueellxuxwvphlvxvpvuwpvexzhlxpqqzxluzelheqqllxzxevxhxzveehvlwuxhwuxlzewqvhhhxuewluzwqqzhzhhhuuehvllxhhqwppvepvueqhxhuhuulupwlvulvupvpqpqzvehewvxqhxexuwvxwzxxwzpehuwuuhzevzuvqlzlpvzwezvpqwwulhzpeqezhuhzvzewuwuluhzxzhvwqhwepeepuhlwvxpzqxuuepwexlzlwewzuveluqlqlpxpquevqpuzuuqphpxlvzwzlhvupuwhzxqxlzpuqpxwhxvueqhxxuwlllvxpzvzlzpxzhzqvxeuvveuwxlvqxwpwuhhpwelwqzewuhzeppuluxzphhpqlwhzupvqexxqhehqppzwueuleewplzeqppwhhvvlxeqqpwuzeuwullphvwzplvhlxpeehuelxvpzzulpzlzwqwqwwepzhpvlvpwvuwpwwhhxvvlvxzhxwxzupwpvuuxxuvxelquwphehlzlqzepqqlvuulqzwvezxxwepuqelwplhxulwpwuvwpwxxqqlqxhhqzqvevhhezwzpzuzwwlwwwzlxhzleqhvqxlphehveqlwxwuhpxqlevhlpehuhpqzqwxuzzxzuvhlueuuwvueuzpxllhvzvxqehxzuuqvpquellpvwwwhhzvvqpuwvpzzqqzhphewhplwvuhelqhuelxuxvzxwxuwvxhuzzzlehlqpelewquqhlplvvvwxwwlpvlveupxpelvuhppqpzwulepphheqlehpeuzulezqzzupexwhuwuvuexphqpxpwllqwllzuewwzvephqhhplewulxxpuwqlzwxqhwzequxzweewupehzeeevzuuqlxhpzlezhqlwelexxhuupeqwvzqzhuphleuzqqvpwqeuhqxhlwhluxeqeplxvxhpqeqlzuhpwphzhwhvlxzvvlelqquvqhpelpzxuwupwxeuvzzhuwllvepwvxqqxhexqwqzvphxlxxpxvpzqqzplphvqvwxheuvwxlpvehzwpvpwzveqexuwxvxwqwpwvluuwqwwepeqlxuvwxehvuxwquwhvvzupzwpuzqvhehzwquexxlupvuevwvzxwvhqhevqevxxhhueuvqvuwqxwwhwvxzexphluulvvehpzwzqxqlxwwwlqxwxxhzepzewhewxuvlqvzwvzlquqwpzllvpuwuuzxhvhuxwqqzhehupqhhpqzeqpvluvvhvulxeevxhelvxzqxwehwvlpzqhxvlqwphxehwuwuvpqwwewplplhwzequwhpvvuvlvwxhxezpzxlweevqehvwzuuhqvwlevvlwzwxhlzhzpwqwppvelexphwxqhxueuepwllwwlpqwhwwzpwhuuplxzuwweupuwpxzzvzzvvqwuvuwphhuxwlxlxwqhhxzeuqqpulueuxhwuxxpluuphuhpuhqelpzxqheeppppwhphxqlzwpeevzhxhuwuqpezvzepzqquhwhezlveuuxqwlwezwzexvvxxhxelpuzqxxuvuxhwqpzvhvuzvzlpwheplepqvxlwpvwhuxewwvqzllpxlvehxvuwvewzwpqxzxlvqppppeezqeuexlvlupvhuxulxzhwewxvxeulvhuqqwlulwlphhxxxxuexhvpwuhplvhpxwuzehxxexpphwuxeppwhhvllxlwzlzqwwehlxqxqeleeehppzquxhhzheehvhwzezzquvxwqhzvhwhpwewpueupheuvwqxwlqpeqlqxlxqehzhuwphqvqxqppvlezpwpuhppzhhuwlxzzpvzpzvhvwewzpvvzqplzwqxwlvwlpzhuuehxlelhpxhhvhulzvzphqeulwzevxlpzxuuhqpuzuvehpxlzlqqxeevwqvvlzqxzuuvlxuvuwhxexqluhlwlvlqwulxuqwxvwwzqpxzzqxhwvhulqvvllqhvuwqzzqlxvvquehhqpwehlphwvhzpuehhezhhvxpqhwzzxxvqqzuxzppzwzwphqpwlhqquhhexqvhvplxlwelzppzhvpepqleqeuequlxuuvqzueuxwwezwzpzqpvleeqwqxuvwplezwqepwwpwvhzzqzvxwxqwxeulxqeqlqzxuwzxzlxluzpupvlhvuwxpzwzqxvquxvhzvzqxuquppwulhwullvhzhzupheqqulzqevuzhllqqhqwvxpvuhqxhweewuqwzhxxzvuwxquuqhvlwvzplqequehvhvqqplllzlhexxvuuelpzppzluevuuqvqpuepuvuhwqvqzwvplwxupvqpqlwhzuvvxqewvwqqzeequlvwepvwzphvwvphexwzvvxuwpvqvqwvwpwxxezulzuwuwhzxhplvzeuvvvvhhheqpvvluuelvqwvexquqvvlzpupzqqwhlvlpeeuvhuuqehpuqvexhpeehvzhuvlvuqhweeqleeepvxuqzwezuwhhplqlpwhezpllleeevzvlpweewxhequeuvvuxuqllxeqevezwvwplwpxqplvpluzqqlqqhhhpxwuhpezvxwpwlqxeehpxqvxxplzxwxpuelhluxqvvhhvwwvelxqhuuvelexxelzzpvhvwzhxupeppuvzqwqvwwhhwvzlhqhqppuhpuhxxqqvxqqeuelwxhezxexxwphvqlvwpxxlwhzevvlwhewzhlvwzhxeeveuzvpuzwzulxvxxqexvxqquuzhxzhulvpphwwlpwhpzuxueewqexvzexuhzzxlhewwepzvuxluvuzueehlexquxwhxphlpevzxvhvzvuvvuupqexwehlxvlhxpwuzxewveezzvqwwxwwplqlexpluxpulquhuqppuluhqqelquqxxlqlxuplhwzuhwwhlwqveqpwhuuqvxvqeuhuuelpxxzhexlzzvhzelxzhhuwuzlphwqwvhlwzezxepvewvvhhlzwvpexeqzxxpzpweplhluuueelquuqhlplpxhehuzllwqleepzqlqewvwxhuvqpqlzwvxuxlqhhzxeupuwuvzpphwqphpqxheqxhpvppppllxpexqllhqpquxxvqpzezlpvlezquhpuuxvuxewphpvquplvvvhzzhwvepxpevqvpxuuhqexzpuwlvquwlqluulzulpwwuxxqwveuwwhpuhexpexqxwxhqpupqlqzlweewwphuplwuvqwluxxzhwwphephwwvuvqwpxwelhlhwxhqzhhzueqpzlueeweqxevqvhqqeqppqvplquewwpwpqlvxxlhqphhqlwlpewhwwzzhxuxpzxvevqxehqhvxzxzpqevzzhvwzelzuwuzwllxwevwvzelzpqvpqvwzeeulvpewuhhzeehhpevuqluxqpeuvhzzvqlpwlqwuuwzvvzeezpulqweelhqqzvvxhzzxxpupwzpxvqexepzuxuzelweqzpqvwlqhezezuvzxepexhlvuzvqxqzpelpplxeqhlhxhlvqxxhwveuxwxlqehqxhqwvhluezevqwhpuqeevqvzhezwhpzqvwzzlqvuppllzhllzuzqupqeuxvxzvvhvwlewehwhhewpvpepuhqvheewllewhexxvexqzpqeexhevhwqqeuxzlxqzuzxllwqvzehzhqzhhwexqewuzwzvwvlulxexpuwhpvxvlwxwuxllplxwuvqxleeeqhwvzhplhelzexqwezpxuxeqxuvuwvlvuelqpezhxelppqlqzxwvvupxuppvqxelplelhwqqeezeqplwwwplxvzxwvhlhqxweqzzwuvhhqwuzzxxvheqephulezwxzqphuhxlhhxxhlvvzxwvxeuzzlzlqvuhhxwuzzpzhuuvhxwwqvzlzzuwvxeuulwqppzulxvzuzphuewxxvuhuuwvuwplhuuxxuwzxqleqvqhuhwuzlzzeuvhqqzxvevvqlzhvuqxuzpuuwvhqwzzveezuxluhhuxzpuqwxhpxqwezlzlxqvpeluewpzeuluuppwxzlqvppvqpphwzuhupxzvuplevupuzllxlpqehpezwwpelexvzhplqhzwevxxxzezzuezeeelxewpwvppezvlxehzlzzhzhxwuzxxpwevqpqlvvpqvqvxwxuxhpqwlpeelvxhzxewqelwlqwhlellpqhpzpwqplxhzlwqvvxzvzhvxqzepewepxwzvupvpuwvxhqevelzlxqqxpwhlpuevlhezzxevqluzehlqpqevuvuxheehhlpxpwzpvhphlxvhxwzzqullezlhuuqqzqxvvwqqqzwvphzhpqhuvupxxeevxlhvevpvpezvxexhxpvxpeqehuvhzzpzeuzwlwlxlvvlzvzxzvlhpxxzqqxwwewvzwpxppeqxpwwuqzuehuhlhvuqquwwpexxeqvzwuvvqezepqeuulhxhpepzwzlvhlvuewuveepelqhueveexhhlzlzlzpxzzphwpuvqeuqhwplvvwzuueeuhxwplzqwequqepqzzuqulhpwzlzuueqwwxuuxpevuxpveuxqzevzpqqewxevwhwluuhzphvqpeveplwhppxxeqzxvzxexehqqehvqlulleewvpzxvhzvpvvxzpqpqxhlzewppvvhvzpwppquvqhvehvwwxzvwzepuehupelhewqxlulqwuqvwwvevuzlpvehphevpqxuvleuvxlzqvwlpevqlpphuzweeveuhxuzlzuzqpwzlzzulzeqeupqvvewwpqwzvxpezwquvzxzxllzzulwphzhvvpxvzxvvhzxepelzppupeplxhqppuvvqpvxvhlwquzxllllwqlwlqxpezhpvuhzuhlhqxxxpvpheluvxvwzvhqlllwhlwxwvzqwqzwpwevppwwqzhvwuwqpwewhqxuqlewhqxzezvezuxqpwhzwuqwvwzxvqvuhlqhqpzqphhpelhwhepepzplvlqxuzqxwvuexhlvehwexuwplxxeulwlzuxhxllxxzxhxwulzhzxzzpqpqpuqqlluhpvuqxeqwluuvxzuhuhzlllhqlxpxpxhqhepqphlqhexqqewuuxuvhlvehuvhlpqqxuuzxpqzulqhzupevwlehwllhlhqzuxqupzzehewheqeqxzxwxqpwhqllphxzvxpzuhwzvexlpxqelvezeqzhqhvuelvzwuzzwvewxqwqppwwwwlevhphpuuezwvpphxzxhlqwxxpvzhzveexhzhlquewzuuwxvphheupupzxheuhxpvuzqhzvpuxqewqlxwepuxuzhwxpzxwwwleeuqlehquwezuelvqzwuxeuzpxzxhhwxvlxppqlqxwlwppulleheuvqwueqhweuuzxuehvuwelwhpupxhulzlqlzhqwezzpwzuvpuvhehehqquwpuezqhpuwlhpupzqhupzupvhxlpluupvhehhzlvxwqpzhvhwwllluwqquhepzvzqezhhzzvwhwxehluvzqwlhvxppxxheelpzzvulqquleuwwlzzzxzzwxzxhphxlwpuhvpezvvzlqpqhuezwexxhvequeelphqwlezvphpeuuxxuwvwuezuwpzzpuvxxpwqvxxpllzwxzwwwqezelqxpwvzzhzqeeqveeqvephpvzxhwqwzexwzzvlphvuehxzvuvqquehwpqzwzxzqlexxvzvxphqqeuepuxupexwuzqzxvpvzqwwuzhlxxxheplxqvqzulqhwhzwvhqlelwvzxeluvhpxxlhvzevuupwxxepvlzewvqxevluqlqphuwplzhpleuhlxqzuhvuhxwwzuxelzpzlxhzeqvllvxleqzlehxqpeuzuuuzzplhzphqwlhqzueqhvwzxupzpplzvuzexlvlezxehlxvxuqppxhqezxvpuhvxelxppplqxqpwwvzlzzvxxehqhvleplvzqpevhveulqehppxzhpxelqzuxpwhuulxwwexlulvllqhqxvzwwplxppuqplezpxxlvlxlvelhquzwvvuwpqzhqzqellwppehqvuuxuxwphzhuzleuwvxzepuzpzhpuveuxuzelephqzwvhvxwwzuxwehzzwewuvlzxwvxhlzhhvlxhuuqhzqwxuelxepqulwhpxelppxhxxeqhwqvpxepuxuwzhulppuexlvevwqupllhvwqqeuzvvzhuupxzuupqpzhezuhhqqlhuxhzvhlqqphexpqlqvwhqewuxuvpzlvxpxwhuqqxlheeepvxewwxuqezwplvqpewwpuxvhzhlzuvehpwpuhxxzpulwuxqveweqlvllpwqwxpqlhqllzzhupvzuppepelpvlxwzwpuqlhexxlxwpxlzxlxhpvevpeqzewxqwhephqqlpwzqlwqvzzvqplzwhlzhvexhzhpepwxwhwxzevqlleuxhhzehppwehzezlxpwlxwevhpelewueqvpqluzuqhzxhlzwxqezzelhlpzqvlzzhpzqwuuewlqxqwphlpqvzqehexzvzvwwvwzxueeuzwhpueevvqquhxwxlvqvezuqhxepqqhhvuexwpvqvphqqphhhwepwuwhleuqlqheeweuvxxwzwvxvxluwhexxhuppxqwvzqlqqlqhupveulvzhpevphwlxzhuuzwhzlqzwlwqlhlphxexlpqvlzqpxpplppvzqpuwexqhzxwlhlezvlzxxwzqpqhpuvhepqhvwzhlphzllppquqxhpelxeeluvhxphlqxulppxzuqpzxhvqvulvpzezlqehuhvpuexhexqlexxlzxluhqewxpweqxwvuvhluuuqplvxvqewxzhpvuwwewuehhwxwhqlqlplzwhwvpuulzplluvhqluzzvhxlehwqweevzheeehlhvpwpvwqvehhelluewzzlxquqwhvqwwpxpwpwpeuuwluwweuzphxuqqllqlvwvluqhwxeeuxwxuveevvhzuzpuuqlleeqlqhzvpqzhehqlxeelwzwpzhvqwvequlllpewepxplpwwppxeppwewlezeqvewwpqqepwewuquzvzwzvpwqxewpzzpuvqhwhzvvqxqvhhvlhvwpxlvpqqzhwvplpexvulwwellxvzleqlvvzezeelhwqvuqxhvlehvuwzxxwqzvhqvuxlzzequxeqlxzwvllhwuplvpwewhvhpupvxlqxvzwelhppwlzxvxhxlpqwzhwzluxxuhvxuqqwzleepleqvqxhuvelvwvleupwwelexqlvxlqewqzexzepppleewepzulhxvlhvupuhvezzvvhxelwuvuhzzwpzvwpvhwuuwqqxluwwlppqvwpvpwllullpuwxpqxewwzxpxhuhwqzwhlxqxevvzqhuvlqvupwuevxewqquzhpqpxpzpuwphwvxuvhlvvwxqwxwuhqzzzhhzeppvuuqvzwwhxehzlxeplxhuwvxpxvqxquwqeqpexpuuwzvvhuwquuuvvwqzzpqeuexhlwxwzwuzhhxzevxvplzlqhphpuqwzpzvvhwewwlzqzhuepewlphwxxxhvueqeexveqeqqhpvpxwxwehqwvlvwwluelvqwzpuphhwhqewuuewwpehxqvxwqhvewwhpwuuepwqpuuvxupuhlhvwqqulpxxllvzlhvwhxqueehhhwzvlxxqlepwpqvwzxzzwzpzeevexhuhxhxlqplvwqzppuhqqhlxzuuzqhlqluupwzwuwzvqlpqhvvhvxplvuvlzqvwleuwuuxzvvwexeqzvexvzlzezelezlxhpqhlwuqqlzxewuzvpvpzvuxqvpxppqhhulwhxpexppxzeexquzlzqvqveewevuezqepxxzwzezqqewlezulvhulhzqwllvqhxepuvupllqppzexzxwwhzqexhuevlquvqhwuuzxxhpqqphqvhhpvvqewzzwvzlwhuwxvphuwhpvhlxvlqpqhppwqepuvzpxzuhxwlexxepexzuhluvhvzlexxxxuvvpuleuwhxzvwwehwwqqpwzzxlzqevlwuuwvhveewpehzzpwvezvqeuqwzlevxezvvvwwhvvvvwhveuxvvxuwpuqqpueewzpuluxvuzelxxvzpzvqeehwhupzpewzeuxxlzqwphulplwhvhquwqwqzepehuqxxlzuvqwllwzpzvulhpwwpeeluvwppzwhqpwvqluwqxvpueexuqweuveepvvqplevvxzlpzhqlvpvllwuxpxhxupwllqezeexpqezelxuwuwwvhhxwzpueevzheqwzxevzxlxwxxvwexplzllwvzvwpqqxqwxxhvqvqqelwqqqexvluqlqveuhxzzzxupeuvvpehplexpvwexleelxweluqhvwexlqxhpplpzexlzxwpeuveqexvhlqequwewhwleqqquezhhpwhzewqpuxuzlxpxzuvxhhzwzqhzlplxxqvzxxxuzzuwxxuwzwhwxveewvxppxqvuepxezqhqeppphhvzeppzphlzwwuvhuqeqlpwvxwwwuwhewehlulvxvxlxezphhqxqezvppuqlpwexzeupzqzhhqhzppleevwvqlhxhhehxuxlexzvpeelelvelelhplepxvuhhplvzhqwevlpuupwxulxqqephxzveeqpuwuhllueehzxhzxvxvulwqevevlhvllxzequhvzwwpxuuzexlhpvqzleqwpqvzvwuexlwzwluzellephqxuqvwzuluexevpuwleqpvulxlzuevephveuuellpvuevppxpvevuxuqzluzpuvzxelwwuuewhzlpqxxevxwuwhlzuzeluuehelwhxxuuzqvqwuqeewzphhvxvluluplqvxxzevxheuuplwuvqlhupzhxelpwqpwvuvxwqqphhhlvhvuxlppwqleepuvvvlqqeqpwpqqwxleelpqlzlhvevpezlevxlxezqqzqvpzwlqvxxxqpxzepxllhvhqquwlllquewlwupweehxxuuzpxeevzpquxwehphhluhwqhvvqlwzqqvwelqlvqwlxxphlxzpelzwlvvzwlhvpveeezvllhpwhexvpwquelqvuezpphlzwhzlzxxeuulxzxuxqqueuuxpvhllulzxuuhzhhxwewxvvwlleeheuwpxlwxvxzzlzwuxuezlzvwzhpwpxlluezxphzwvqvuuhlvvxvzzvuqhxzuzxxhqxzlqxvzupvwlplepqxzqxxvwhhqxqeezvqphzquhvvvxzxzeuuuxwwuwwzwxpzzxzpwqxzuqevvuwpxlqluvxhwuhvuxqlqwqhzexvwuuluzqzwqqeulqxwwqhquuhuxpululqhzhwluvxpwwqhvhhluqzlpuuvzeeqlluhqwqqexqwvvepzwhxwzvexxeqzllwwxvueehwxvvxzzzqqpxelpxewlquzwxvexwqxlvlpquwplpvwuqlqhpqzvxwuqzluxllhwxupvhpxvqzelqxqqvleuhphqhpvluvhvhxwxhuweplqzzwzxvqhpzxqhezpuevvxqxevxhelwqlwuehqwvqqvluzpwhuzzwhqezhlwullzxzeheqqwuhwlvxweeqpvzzuxxuzvppxqelhqqqlzwpzxzhlxzhveezzewwlhzlexhpqlvxwuhevxzhlhqueeuqwhwuhqlwpwleelhehvxeqqezzxzvqhlqxlxzxzlqwzzzlvwlqlhllxhhqllhpzzzvxhuhwhzwlehhqpzuuhzwvupvzzxpuulpupwelpewhqqvuxuwqzhuwvexwvhuqhzxzvpuhpphzlwqllwxqzllpxqxuxhpqhzvxqeuzxheqlheuzhwhlwhxelvvwphuuwhwlvqvvxuzqlqlqplhlwwhheuxeezzxlpuelhellqwwlvvwlhxhlvhzhhpuvuhwuwvuulxqezvxehvxwxpvqqvllulvhpvvueqephuxwzlwhlqpuwzxqewpllqwzqhwhxvqlluzupplpwvxqqzzwpxhvxzqzequuppvquxlqqlqeelpxxwlzzpqwzpzezpuhvhpvlpqphxxvvquwzzuqeqewhpplvzelqpqzxeuwwhxlplqvvlluzuehhequvqzhpuhzwqwqwxeuqqzlhvluzllvlxweuwpewwxuqexehewvxuzwevveeqpezuvlxvpwhevxqhpvevqzwxlvvupleuquqqwzwhuzxzuluehpxzhvzpvpezevxwxqzelxveqhqlqppvqwpqlqpzwlzvezuzxzhphpqhqzhhehvquuepquxeqpphxwhvwevhqevewueewzzevzlpvqvxvllexvlqxppuvhhvxquwplwxwzzlqlhqeuxuhzpewvpxwvhwqqpvzqqwxqzhlpwzlpequpplxwqevplvwlhlhlhlhwulhwwwvewzxvlvqwvuzzqqzzhzhzuwellpezvxuwhvuveleezvexlhuhzpuzeqxwvquehpuxuqzeeqxzqzhvzzqexzhlxvzhqhqxvpwuqwlhzqvuqwvxuqvwwxpxupzpqleupqzuxewhuzwqvuhuvphhwqlqllzhxqxezlqpwevlhzzxxwwzhzvezzupeeewhuxhhehezhpuwlzlehvxpxvlxxquuuqwxqqxzppehwhzuzqvpxuuvppxzehpvhquuwphhwwplzpvxweewwvuhhpweuzqxwvhxxxvqlquvuwehlzezvulxqphhvvxweqvuphwehehqlwvlwevewvzzxveuzwzuqqevqlhqhvqquhuplqelhhvexluhlphwhvhpulzwewvephpzzhpzwezwqlzhvlzwxllhpvppewqlzuvuvzhwvvllelvuqvquzzvelepvxxqxvvwwzuuzwhheqxvvevqwuuwewlqhzwxqhqhhqqllzevuvzeweqqhphwxlwezpxehxwqvqlxuzwlwqlqqvxhpxwhzhvleqwewzlqhzhpxhvzzwhuplxuvhwqwzhzlwvlzuvxqzlqupwwvuqlhxlqlhvvvpxuphuzuewhwwzuzqlpxzqeuzveqwzppvxvevvwwuuzhlhqvpzvvzlxpzulxuuvheqplpeqlzuepvphuxuvxulphxhpvwvexpxeevuuhlxzzehlzzvxehxvvhwuqlewvhqxewvuhlqzuqzpvuwlxwxhewxwvhzeeuhxxhlxxwqqxezuehxvxzxlvxlevqqppxlhwuhhqqeluezxepuweqvqheuxppvxwqhxqpzzzvvxqlhhxzlxhxvxuqvwwpuvuexvzwxelqlhpvuzqezxwvwlxulwhvvxppeelxwxvvlwhhlqlhevxwlvhhupupzvppqvquuwhlqxzzpvxeezupppwpplpzeqqxqqhxveqwuhzexuqhpeuqpqqzulwxvhhxqueuuvvuuuwwwqppeplxqpehpluqvvzehzeppzquqlxhhqupzzheeeexwwwvzlppxhzulezluepquvuzxvlpvqpwhhqhhxeuzxhpqpeezxwhpvqzplwluwpqheqzvuzuxvuwlvzhvpuxpqvexxphpxlppwllqxvvlzvuepwvvuvwquwwpupevvpexehhqwelvxlpvlxwlluqlpxvzzxvpzhwlpzlhpwhelphvphxuulzvzzzqpezpwqlxvxezeuhvwphvwvwuppvhlxzxpwqlhqxzpxlzezhhzwqqepxhlzvzezwqwzuxqepwxvzplqvvvxuwvqphqupvhehwxwlelzulehlpzeqwuzxuezzhlpuhhupppvuphwpzuzlwuzvlpeqhwxvqhvpuuwvupqquxlqhxzvwevqxwpwqplhppelveqwllzwxvhxezelpzexeuuuehuzwvzvqehxxxlwwuwplelvlhzexuhupxullpvllezwzpvvzwvlhzwulevxlquxhvhvewvquplpzluhxulevlwxpquvhvzqzwevpeueuwxxheqhhvlzvzwzqlvzveqwvpxulluellvwlhzllxulvwxxxzvwuhleuzqwxvhluzlhlhlxzhwzelhepuewvuexvvwlhzeqqvvxepzppvvvluewxuvzlxhwueweuhxpupxxwqqlpepvwehxupluvphhuveeplwpxeqqpxpxupqvzzzqxzzulzxwlvvuvhxxuzvuvewuzwvwzqqzpxezlxwvzlveewxwlxppllvvehvvvhhuqzvzwvplelwwxvupvxpxeevvpwvxxevzzqellxqhueueqxzqezzppxqplzqvuqwxzzuxhvlxlvulevwhxeepwqwphwxlqulvvwlqxlzvwwuhzulqleqxuewpquepqvwpzwuvxxehxphqehehhwulxzhphuvhhwxeeqplllqwelwlqxzxvwvevzuhxqlxzxlpppvxqqxupzuwluqppphhpxuuuwuhqppzpuexxpllxpwhzwvqxzlpuzphpeewhqqwwulxhvxqvqxuqxhvqhwvhpuwhpuvuhuqluuzlwwuhheuhvhhwhvpvqzxpueezpxhqlhhpelezueuwlwzqwzuvpleezeluvwhueqeelzeuxqpquvuvwpxexevvwluuwxuwuwzvhewheepquqezlexuwhewulhxlwuzxhhweqvphlwezhlueulwzlxlxxzquwhlveqvvuzuevxzwevhvpuvwvxlhhuxvleqhhuxplepqvqhzlexhvwlehvplvppwuzqhepzhxvphpvuxpxvulvqwxvhpwxpqpevzwqpuhqqluwzhpewqqupzzuuzvulvvzvxzquhwxvpvzzxuvxulwwhqwellhuzehzvhweqpqevhqvwqvqlllhpqplzlzqxwqquzlqhepzwzwwuvuhzeeqqvqpwqxlpxzxvwxhpequlvlzuzhwlxqlvuxqeluvvehwewwewpwlzplwpvlhhehpppzqqwlzuwehphelvhxvhuqvplhhlpzhxqhpvhqeqlqxxpqpuwxlqlhhvhzvluqzqxpzhuwezxeupeppqqlzxleqzpehwzpquqxhhlpqwupzlqwuzhxuxpxllhuzvlpxvwvllxpqvzzvqzqvwxehpvxuwlxwqlqxhwvlpwvvplvwlvulluhqwlvhhvzewwxueuhlzqvulhpqxvhhuwqepwvuwxvuwqqpxphlvxvzpzvpezqvwuvheqpqpqhelwuxxwlxlhxwxexvpzzelpvxewuqhevhhlpqzqhpqulqwuvzlulwlpwhpepvxzvhzhxxuhelwpueezhqvxphqexvuzxxhepzzxpulhwhheeueqvexexhpehzuqqvqzzwwhhuqhvvelpeulquhuuxzehvquzwuvuuupehllpluwxwxvlpxlqevpvwxpwepxxlxxlxwpxveqqvqqlzullhepvhelpzhxvqqwvlhqvqvxxpzxxqhwwvleevqpequelxewlwxlwxxzhezezqxeeezwhhxluppxvwwxpzwzexwphwlvlxeuuheuwhqzxvqpqhzqqhzwxqqulzzepvlqehzvvleluzwqleelwxvppelllwhhllhezpeqpqqzzulzxwqxleuqweeqqzlwxqhxvqxzhzzllezeeuvhxqexqwxhpwwwwxqxplhxqlhlpxhvhlzvqwzvpxlxzxhullzvwhxvvqxwpxulwxlevpevpuwqvelhewpxvexxxeuzehhxvewlqvzqvwqzzvezwhllwxzepeuuvupehhlzpxxepqwhphuzpuqxvhpvwqlxelxuwuqhlqvxzevhxulwzueppuzzeuhleuwllepwhuhvxeqphxlxqhpzlwqezuqelwvuwpeeqzuwqhqqqppqqlplhqvhwuuhlxhqvvplwuhzquxhuxqlpuphlepxvzewehuxplzhleevxlqxpwlxlhupepqxepuvlquvxluvuequxzuhzlpwwvuxhlwuxhxvpupqpzqwlwxzvppuwuhvhvlluxlqzpelpezveewuluvllqzhzlvqhuhepppeuzwhzwxllvupququqevxuepqlvxpqzxulxvhelhewvxelluqhqvuuhppwlzwvuwphvhpqelvpehzxlxwhupzpxxphpwpelhwzxlzpwuqzqupwquzuhlpleuuuvuwhxplxwlwvpzwepquvplhupxhvuzvwzqpwuwlhuvzeuzllxezpuzqwwzwhpeqweuqqehheepwpqhuvhquqlvepwhxvpxuxvwzqeexuluwhehqeexxxquwwquulxzuhlpvxwlhulllvulxxeevxvuwhhvxpxvzqhwzwzlxzhexpqwxqzxqxzquqvlppuvlhwquuzzupevqhvexqxqzvpvlvwhzzeuewxeppehvzwuephwwvlvhppvlvwqhxwlqeezqxllpeezxzlwphuzvxzwezwxwlelwwvxuvwpzpepvuhzlzuuewzwlwuwweuuwzhqwuvlwvzuqllwzxpweewuqxpuvxvhqxpuhwqvuzluxeewuuxepvwhuqqzwvpllewwpzplzwuphlqvxhvqxvuplxzvqhzwequhvvhhxuzwzwphvxhwhxvqluuezvewphpqqewvxzpwlzwlvpexxlqpvuhzwpwxewhvhleqlpllulxhzqxuxzvhzuxlvlzwwezweuvqhxpepzezuwwqpqlplluhwuehqpzvqqwluzwvveqpqlhzqueehvqvpqxqlxqlzeqqluqqwhppwzulllxhpzqzeulqulxhhelwpupqplhwwxqhzleqqxwqvhuhqqpvwepzhlwulwvvvxxuwlxlvpwuvewxwzlhxhupqzqxqvwuquheelwpexhhwlevevveqpuxxqlqzqpeqwvzulhupzeuuxlxzqhelpeeezxwlhlhphhhhuhwwvqwqwvlevvvlwlwlplpllzwuxvepepqhzzzzzpvhlzeephxeuvlzqvzxlwlpphvwzqquxeuhvxehzveepvzlwpuzexwuxwezvvhlwphezuulwqpqlqzzpuwhxzexlwewzwllhlhzvevzwppqxqevupwvxzvephqwhpullvuxzhevepehzwzzwvuxlplvvvhpvhuwwpuulzeulppeezxxqwwlxzxzqlqvlxhzvqpxevplvlzwvhuuuhuzxzlpheqlwquvwewwueqzexhxpxvuwzeuzxzxplwpqpppzwweqlupeuplzxulhzhqzwpeuvueqxxzzhvelppqqvhphzluqxqhqvzxlqeezqexuzqhphlxvveqlhlqzxzzpwxheqhpezqvzheqzzlvvpqxxwpwewuluzxquqhqqxuqzlevzvqpwzxzzqxeuepleehpqzxuuhphuhvuvxzwhzpzlvhwzeuehwhqvwleuvqhuuquezuvhezuelxxxhwwluhqwhlqxlpqqhllpwvuzexxpplqwvqupxluwzwxhlhpleeuepwphwuxzzewpzwevlweupzzulxhpphwuqhqxvuhpxhhllqphlxqquhzuvexxezlpxeepvqqvwuwxxphlzupvphvwplqxpwpuxvlzzxwxvlvxvzxeuwphzuxheweuuwhxqquezllhhexlhuuuxlvqqzeephlpqzvzxuwlwezvvvqvvhxhhuhqqhzvxqhzpwvzhuuplllxhpuevzuzzqwuxwhelulvzhuwxwpexlzulwpvxluexxwpexuxvzwexhehvwuvhezvqhqvqphllqupxvzxuvqlxeluuzlzvepzhuehhepxewzlvzhqeqweqlplzqpqqpzvvuvpwzpxlveqvvllxveeqqlwlhvluqpvqwwhqpxxuleullwvlqphelllhehhuzlqhupewzwlxpxluzzzxpllxxpppwvwwvelzzwqzzvvvxzlwlpwhvxlvxwpewhqxqeqlxzpeluqexppzzvuuxlqvquehhluxhzwzlpvzvzuuzxzwqwxvxxwuewzllxhzvhxpwwwxzzuvuupzevxwulxxhhwhpwvqqepuqwqzqpvpuxewelwpqhzwhhlvpphvpzlhqpuuvphxwwxwuhhvzehqzhehupwuppezulquzxpvhqwhvpzqxhlvuuqxhlezzevxxxzzzhlxwhxeqwlvqqezweulevezuxlxlvppwvuvhqvqxxlwvleqhewhvhweqllxzxuzvuexhvpvvvqplezeuvqwzqvlzeulwqupephpqwwvhlzlqlzpzlwzqqlwpvxxvhzuzwluelwxzvuhwlvpllvvqpuvwexehexexzzpvlexqxquezphvvzvuvvvqxvvhqxlxpevwzqlhepewxuuqleepzhzzlwxezvwhqqlwpuvhvvlqpewelwvhlvzquvupzhlzuzuvhewxezexxzwqhxqlxuppqpuxqzxwvwluuquuhlhwvvwvzqlqxqepzlhzpewlpzqxzwuxwpwezhhepvehqhvqvqlxulqxzqphwuwwxxwxluevqelqqpzzvqlplepuuewluwhzzxzuvuehqepewxvwwxhvupqlhquzzuhzhhwzuqvppuphluqllplxhxevwlqxvepevevzzwuppuxlveulqwuzqweuzqexquuxuquvhupeuwuwvwhvwqvwexvzplpuvxqpehxvlwxllqpqzewhupuzpxluulexzzxwuwuhehwzqevxvuluupxelhvewqpewwxzzxhvhqhzvpzqpllexehxexqeqhwhluvxhphlqqqzzxueuxwlequeuexuwzuhwpeqqhwzehelhqvxxwvezqvhqpzexevpehqpvepwhxlexwlzlxxpewhhhwhvzwzpzhevzpezuvlqqwpqqwzvuuullhezuwuweuevwpwvzhepxuxvwqphqvveppzhpephzpwzzqpqeqeuhvlxzvwlhwqlqhzuwuhwehwvlvhhvweqwlpzeqvxlzwpzuqlxqhzlxwzqwlqwqlxpzxvuuehhvvzwullxpxlhzzxxqwzvlhevlhuuuzqullzxhlhhehqeehpvqvhvxuwquepvvxeheuhwqwqvhlxlzzxxxqwuvuhzxqlwvvuuhehvlhqxqwpzzhhpxhhpxeuhpexexwhzhlwzezwplhzhhzzequhpwlxuxzqzhpwlxwpuwzwpuequhqeqpwpxqpvxzzwuwwqluwwwhuhhwzqzuxllhepqqewuwqwzwvvvhzvveqleuuvweuxwuxpuwepeuxvpleuzxwllhwevxqwpzlhlzuwluwwzzeuplpxuwpzphuhzellzveuzhqqpvwvwpuzuzvhvvhxuqxqqlqwzpuwhuqzuwqelehehhvezuhvzlllqquxvwxhqwplhpulhlwxpphhphwuehwhwvwlxhqwepzuuxuzvlhvelzqqzellqluwvvwvpzqvlhpplhpppzulxhhvwvelqqzwqhlwhwppelulepxvuzzuleuxzlwuepvqlpxullxweewwzwlwvhwvuxpqewuwqzxvwquvwhpuhhzphqexpuuehwpepzvxxwpzpqupvwqhpelhwlwxpqpzlvwelqwxwllvlqqewqzuqxzxuxzplqeuxxlezvuqwqxquzhzuhqplwvwwpzlxhzulpxqhevphlzpzwzxuhxpqeuqvuxpqqvxuuxwzzpwxeppxvvwuxwppuphzlqvpvzvuzwxhxeuqepuzwuxwlpehlxpxphhhhlwwepzhzwhwwxexezexuueuquzpppelluehxvqvxlweqlxpwquhxvzveuwxxhpwhlquppvpvwhulhpvqvlqlxxlvqupeqheezppvvwxwqhvzevhhevwuvqpxxvlzevhupvhllluvxupwxqlqlwhexplhvzvxvweehuzheqehwqqxzhxqvpulvxhvuqzlhzwpwxxpuwulhezpzphvlzzwzuxphppvweezlveulwephwzuwuhvlzzwxeheqpzvxlxexlqlvwzlvxxlxvwxluxlvqlzuzvexuvqzvexxephvxpevlehpwqzxewquwlhxlxeexepvvzwvzzlwhlqpuxupuupqzppweepqevqehhewexheqvuuzuvvuevvelhupzhwvqvzvxwxqqhvlllqvhhzluqlxevzlwuplvhwzlzxuxpuuvexqvhhllqhvulexuqhzzppvzllzvwuxxwhvzqexvxupxpvzvlquuzxuvlxxuhphexlppxeuvhluhxuuqhlvhpxlqpzhllvxxqwzxwqupuwxvhevuhvhpxwpuqpzqhveppqvxqpuqlxhqhpzxwvhhuvhwquxxhulzzwzvvupxzepluvpxlvehlxwhqzhupvlqueqhhwwphxlexzxuvhqzpuhxlzuxellulwlweuxleulvpezzxvqwhuplquzpphwuepxxqzuqveeqphzpvzwqpqxzpwlvlhlxzxzwwvphelwvhpevvqhlwwqlzwzqewuhvzepuhwpwvpehqqlzxhuhzvxpvxwuqxxezlqeplxhvezhhvzeeulxhhhlqeehelpuezewxuzvxuwqvqxlvhlzppzehpeupllwevxhvlwhhpqeulzwxququxpzxvzqvvuplqhvzqppvvzxqvxzeuluehvuxuplexewqpzzxwwvpehzwqpxqvlhqwluwxeezwqeluehvuzlleqhexqwxwwuqvwexpwvuvuzvwwxzhllluevqwwzwzhhhxqeuqzlhzpuqpwqhxxuxzeuphzluhluuxxqxpwuxvuwxvvzwveuqquxxwhzllplvqwzhzwlqvlehpvelxlhqhuzhhzqhzhhuxuuxxhhpvxuhwvqvqeuzhpvxwpwwpvlueuvwveveevvhuupvqxzuxphupeevuhwvxxzpvlhvqezvluleqqvwlpxxhlpxzhwqlxvvulxuueuxwqxqveheelqhzqxlxvpqwqwzhwhpqquplpueehvxhzewlheueeulqvxqhpwwhqzhuwplpuhpwvvqlpupzzpxheuzxleevlpwzeqqwhzvxuvhvxzlqlllvwxwxpqqeheeeezweewepxhvwuwuexuexexpuxvpxwqwueuwweuzvhwzpweuzwxvpuzxhpwlhlevuhvqwpuhlvzqlvxvhlwhvleeueuqxzwpeupwepphxxxpllvwupwlqqvuxwhuvpuzxqzwzwzevhvveqxvxxzphxhzvxhvqxqxpzxxqqpvvhpvphlhlwpvhquzxehpewzpeuepwvpuqhxuhpehevwlhxexxwexlvpzvqhlhqlexlwvwvezxzlhezzvqepxhpvlevvzuwpevvqhlzxhvwwllvzelexxxevvvvlwlzxzewhleepupvexhplqlpuxupxhqzpzlvepzlvppuzxqupwxxhvluvvxqpepullhhzhqlwquqvupvhwhuwezpzzvvwezlvppewwzzhuphwqeuzuvxvqzelqeuxezpuzpuulxlvzqxpzvelhwwxezxqzeuuxxvzzqxlhxwpevvexluulxequhphqhwlvxvluxhqxequwllwuwxhzpxlppppqpeqpuluvqeuhxqllhqpeuqhpzxqpzuzxxxxwzlwxeqvlqevwhvlevwzzhqvhhllqueuhzlquepxwzwvqvhlwvewlzpxzwhlquqqzewzeueulevzuzpuheplhwueelxzhqvlluvpvqhzwuvuqvpvzpvwlxqwhqzvxevlulzluvlzwevvqhqxeuplpqwwpzwqhelluhqlxlpxheepwxvzvxvzhvhuelewvzevpwlzzhxvweulvzwewphuqpvvelhxlhuwqqleqqphwvuzvxlwephuhhvepwzpqlwlvwpvepzxeqxlwqvqvlxhpequlxexluvuewvwvzvxwhpzuwuqzlwuquuuvqevluwezvlvhvhzezwxvvzeuqeeqpphzwqluvpvhlqhzlhqwwequwzhzhuplqeevwvwqelpewvqxlvpulxpwvluepwepxppuxeppvplhlxzqzqlzxxelpeqephhzlpequqvezqqvxpvluzluwplwvuqezvuexvhwpqqvpupplxzwpqluquhhuqexpepexxhveqqxvvhelwpwhlvlxphxzzueewuqexquwwwezhhzlvxvzlexpppxequwzhwwepzzeuplhxllwvuzpxhxwpxwuhhlqhveeplxhzezeqvvheqpwevzpveqeewzuxphpqvhvlpqvhpzzxwqpphuxzhxuwhxelxxvzqqwvwzeuvlvxvhvhxevhwzvwwvwlhqzpwpxwqvupxxquwevhhzhzuqwzzqxpuhlvqzqehehquzuequwwehqlvxvhplxpzxqxqphpqvlxuwuuqqxuzxqpuzxpeqwluquvuxluhvpepwwvhwxuuxhevupxelpxzuewqxzhwqzexwelqlzhexzehvxvzepvvzeplzevzwxlvwpxwvqpluwhpuvqexxhwwwpuzhzeqvxupevqwpevplwlzphlzvuxqwpzuqzepxvvwuephxxhexzwqwhwzhhuqhuulhwzehxhpzzxweqpuwqhhlvxqxewuqepvwuzvhhlxxxpvvhquevewzpuzvquvqpullwhlvuwlhhhxpzzelvevwpqzphphueweelvvpqeezxxepququqlexqzlupzxepzelelxpzzuexhlqxeqpqqzzlqxhzvpuhhquxhhvwuheqlxvxxxuhwlhehvvlwqxpllpulepquqqvwuepewulelqhwuelewpplqwzqpqzheevvxppuqqhqwxuehqepzvzluqluxwlplluzzuuwquqqlhlllllzzhxuzquleuzezllxlwvqvxhuqqzvheehpzhuxplhqplpqxwxuuqzwwleuequuhlzhhvqhhhlquhqpxqpeuwuvwwphlwhxqqzxzpxwpqxqzqwlpqluevqwupvvqqwuqvqehuqqlhvweqzlzzpppuzeqeqhlzvqxwhequuzxxplzueuplqvuxqvhxzpzxluwplhvlhpvvxulpweevhvlwhlulxqzlwpeuwwquwelzqvzhzvepvvqeuquuezhehpuwuluwevvvqxheewzzuuzzwlpzwuhewzzzzuwwxuqveehvxhxwuwxhuppezepxxuxhpqvzwevzhvzvexuvvzequxxwzewhvxqwuqhxvllzwxuxzuxeuzwzqhppwhwhlhxhqxhlppzuvuvluzpwlhhxuxvexvwzvvwqwzvhqxuhwlpeluxvuxupelpwzevequpvqvelzphwuzxeupzxvwlvpuzlhhqeulxvzlllxxzwvxwxwuuhuhewhlhwuexwvzwlhvezzhuhuqzzlvvhqeqquvzwlllqvxpqwlvwzvpwqehwllhwexxqvhwhpulxwxqpwlxzqwpqhewvlxzewpqhzhxuvuezuwzvuzlepuwlhehwxpxlevxezwhphplzlpqxvpeewvxepwxpqwqwwevlzqxphuxhzhpuhpupxvvppeuvlvlxxuvppvwweppxuqwpxlllvehuupvwexvxuuphxzuwhuzvlxwqzepxpzvxhvuvevqwepzvxqllzzzhphuuuwvpepxpwuwwzuquuvluwxzvewevlehwweluehpwwezlewvwwqhhvuuhxvvwzelvuxuhvqveluqupwqelxpexzqllxpeqwwuuzxxvvlevqhqlepxuxvuzzleqxuhhwzwvuexxuhpwxhlxlpzqqhwwexuqlzvxzplhzuphzpxvvppxwhquevxhezpvqvzevvvvhpepzlvqxuzevqelewqeuwzlqqzhluhppzehezlpvpueuxhueelvxxqqxvhheevwpxhzlpvvhvvzehhezpxhzzepvhpzlxqppxzzxvxuxwqwwlplpleeuuxezhwqvzzphuhwezpvwxxuewqueveezllwhvxezweulvqzleuvxevlhqeqhuvzzvqxwlxqewxeehqhewplquqehzwhhzvwueuvzvlqhvwhvxxxeleqquepvlveehuwhwepwwwvelzepuqevhxqlzlxhhewqehezwuqzzzxvuewzxlewlulxveepzpelqhxhxexwhvveepzewwpwlqxhvhzlxpwuxlxpwpwwewxlqhuupvpxhzqepwhlzzuzqlvehlzvvzwlpezpzwvpxxzuvlzlhvxwxzvzvzpxuxwlqupepqwwhwzequlvqewppwwqqzuqlxvqwvxluqxvlqlxuzqeehqzehquqqplhvuqeuhxevhuvhhqhlzvxqzpvlzwwlwxvwwhevqvxxxzxzhlhhxvqvlzpeluplzqzhquephevewlueqxllwqvuzpuxxzxuuxqquqqeuewwxlwwewqphhqzeevzeupuqewhpzxqhewxepxhvlwxuuxzxewpeewvluhlewvzwvxhuxexuwvuvuvzuzuxqwezqzvpvvxqhuzeqxlxhwxlzqwlqxvuwqqpphzxuvehqlpxxpzvwlhvwlzhhqeqquvlpulhevwxzwlxpewvzeuhwwuvvwlhlpeuxzheqhzpxlvpwppuhxwwzqlplvuevepxuuvxpuxxhveqelevzzqhwpvwxhhhwhezuzwxllwhhzqvhzxeuuvxqxwzzvzvvpvpqplvpzuzwvlqzlpxhvuxwzquulpvhlvpexqxxuxxplllvuhzewvvvlzzxepuhquezxuwxvvpzhxuhhwqlhllwhqvlwzxelqpqxehxwvlqhepzvehpluqhhhplewpvwzwxxzwwqhpuphllqqllvhelxewpeuexuehexzxpzuvepqzeqvqvlzqhpzhzqquplqwqxuxewvhhvupvplzppvehzzlzvleuzxllexuxuueuzvqxhxqzuxwqeqhqupzlzxxuqpvlwpezwlvvhlewlphqxuvezewhllhpzpvuhquwhhllveplzvvepphzeeehvzlzzvphvhpuevzehquvwxuwlvpuwppvvevxpzuhpqzqwlwquwwqxwhpxewzhqwxzhzqphzwhpqzqpxwupulvwelqvzlxwqlwxuzvqqphhlezhupppzxlwpheqwvuqqhqeheuqeplpxwuzpuqwwpuvepepelvzwzpevvhwzpzewulxvvvwpxuehvhvpzzxqvxevzulxpepphuvqxlezeluvluvxuwpxuvqvhevuqxzewwwvwezxpuxpxuvhquzhpvwvelhevhpqpevzpxplphveqxpullexepveuqlwphhvllzzuuxqqlhepqwzlleeuluwzpxexpxuulvxevxhulqpeuuwwpewvxlxuuuulexuxhuhplzphxhphpxwhzwpuxqxwezpwxpzwuxwqzqvehvuxzevwhzuuquewvvwqwvxzlpvuzvuvuqxwvhpqvhuzexweqpuwveqwwwehvzeqvxxeqqexehpzuxeqzzzlvhwpvzxxzlluzllzvhhzhzpulzhephepuhuwuhhppqqhuxlqhhwzllzqupwppzvxzzpelzhqewuzewlxhpwuquhpewvwehvwzxeuzlzzwuxwqxxeqqzvuhlxxvlqlluhlqxqvezxqxqhlwllzpueqqepxvvuzeuqvqvueqwuzwxewellvwqeuqxzepzvpqelxqvppwqlqpxwwqupuzwzehwwllwvplplllqxvppqwxvhvlzvvzqzzxuquqxvqvwhxhxhlqxwvpzzueqhhhpqvxqpphuzxveuhxvhpzhexqhewqzlqxuvzhewppuxleewvhlvuzulhpzplpuvxewxzhqpxplxzlvepvpqhephxeeqvxxuuqwzewhzxxwepzzqlqzevewhzzlvlhuevpzhxvzvuvevqwzpexppeezeevzzplvqvpquexwqeuuqehlhqzuwhlvuqvzhwezwplqluxvhllzuxpzupqpelluhxzhpeqxuzeelwexvhewzppqvxxzhhlqpplvewxuzulzhpvpqpzvpuzpvvezwlqzhhuhvpeqvpwhzzvuwzuqxpwxeevuezvwpqexlxzqxplxhuxwwqwhxluplezqlqwzvlqpvlxzuhzzeqqlweezpqevxuwlqpexeelpevwuxpvuepwzxzlpluxvwwvewzuzqwzxhhxzvpqxvxwelepxwzqllvzqpzxhlwupquhqwvzewhlwzelxluuvlzuvlplzhuqhzvxvhxeluvwplhpzhqhluwqvzuhzxhvvehhqzxewxhzxeuullevzpvxquvvhlzlluuveuwwhqxxwzpwxhvxwxexvevxxlzhxqxlehwpxlvhqhpwpzpvuuqhzlewwzuueuxlluvqhzzxuwxzqhupewhwzxuheppwquxevpuzhzhwqxwwzhvulvwpquuzvpqllqhlluezewwxplqzlzepwhqzhpeqpqewexuzzeupeqvwvqphvlxvlqhzwlzqhveuqeeewzqhlxevqeehlxweqphlqpxuwpvwhphzeqwuuhqvhvwvexpuwlvhphqvvvqhwzwwhhxewuewlwvuvhpwzzzvhlvhluuqzzelzhvqqpqzvqwxlpqwpvqwllwvpqlelpevvupvuvpzwzppxxvvhepevxezxulexuqvuwxwzqlxwqhpewzlxzhzwpvvxepqwluplzlweevqvxwzhxuluzhvehvwphpxxwhupxhlvzhvwlwuwhwzwwwxvvqwuwqleqvqqxzvquwvuqvwvqlpuqhhhhxpweuvpppzplqezlvvvewqzwzqleqhlhzzvuhlhlhhxpwwuezupleupqlzhxuhxxuuvuewqwlqlwuxqvpepxwqvqpqvqpquqzehqhuwvevhvwuwwqevlzplzhzzvpehlqlqllxuvlezphqupxpqqhuqllvzveuvwelxzuzwpwhzwpqeuxwepuppqhpplwlhpupwqlppzuhlvlwequlvvpzuzeeplqxpxqpulwvpwvxeeqxvlhhvhxpupueuuezqpvqupquqqphqvvxpwzuvpvluhepxhphhuhpelqwvxzwquhwuuwxvevqzqwvxxwuplwhxewvlpqqluwpvpuvlxuqellhvuuxxqhqlzzewlllelxqzvpluxhhpplqhpxvxlzqqwwwuxqevuxuuluuuuqzxvwpzlxlhuulxuvvxzpwxxxuqvhpzuzvpwqxluheqwuqwuqvhqhwplzpvulwuvpwlqwpphqxxqpqvplhqwqvpvluezxhxweuuzxwuxquhhwqphwezvwhvzpppvwhzweelehxlxpqvhxlquphxuuhuxqvwvvuzxleehqwvhwuhlvxluxxhxqqhxeqqqlhwqhluwwpqvzxxvlzxvqzlzqxexzvhzwhelphzqwvveqpzqzevellquxqplepzwpqqplpuzevhwevvppplxuzhezzeepzehuevpwlewwuqqehpwxezwpuqvwhhpuxxpqwhvzuqelevwezwvhevwhlxqelwlhueplxzhqhhxhleevxlhwwhvuhzwzpzuqxvwxvqpexqxqhuehezheelxpvhzuzlxuwwuqpvlqqquweelelvxxevxppuevvxlhqvzleepvvuwvehwuwwqqhlphvpwelpzeppvqzzqzhxeehvzlhxqxulvpwxhxehxhexelexzqwulwpvvevzzlzvwevwlzphlzxxvlzuulllvvqxvvuxuvqxllqzzzwqhvulqhlvpqwvhuzxxwhvllvqxwzplhwlhelxlzhewhwqxluxzxqpwqulzxzlpzulpveqqqzpwexxpzlwwxzxhuvleezpphuvxlhlewlxxzqevezwwxvpqlpzpweeplvlqxhxxuqzpxlvezuzhxhxqpxleevwqzhzulhxzqqeqqevuhxvwppqxxzupelwlxvqqquvhhppwlpxleeezhpxhqquxzhxhwheqlhwplzlvxxhxwxuzxwwwhpvuupuwuwwuhhlupuhuvuzuxvezuhzlxwlhxqzzuuuhwzwzzwhxuxvwpleqpqewezllpxvvpuxppuqupzqzelpzxqhlqzeppphzpelxhzupqqqweewwwewzhqwplwqvzzphehhzvvzqelvzuuphxhqvxvhxqpzqhqlepuqvzwvzhvvvzpezlvqzquhqhehepeuvvpvevxulewvqwvlxpqewhwvuhphzxqzlzwlwzhvzwhzxwluxlxuwlpwqqxvwhpvxqwvvppuqeevxlwvwelpvpzuzweeewhxvphepwuuhwuwqlvqqhezpehzxzhpzhvlvlhuluzzqelevwxhxwppezzlwezhheuhqvpzepwvwuzelxpxzuehhxzuvpuzvzwwqpquqvqxuhxqeewlwlhxwppezqqlelelwpqlzuhhpxplwuhwzxlhvhewwhxqvwqhwzexvqqzzzeeplvzvhezwlqhvuhxuwvzzxvpxhhupzxpuwvhqqeuupezqpvuwlqlqvvxxwzvxepeuqqhwvllqhlpluvhlzexvqxpezpeuvehzevpvpqhvlvuhwpqhzlluhlxwwzelwxlzqqzqppexqvquxqlwlqpwwqphwuxzvzlhwqppuevepvezhpvxxlhwxplexeezvzquwlhzeuuzqqeehvwlxphqvhphhpzevhlexqqpeeuxvhpqzezeuewvqlzpvuvzvuveewvvhxzxphupeeuuzuhvpuvepulwehhxquvlqxqqlhvhhlzheqxhuuzuhvpqhpeewxelpvxzqvwuqqheuvhwzlpxzwpquzpezhueuvhxpxhvqxhplzvxpzlpwxexpuxlepevhhlpzwequxzuzluppuxwpuwpeevvwxqpppqvehevpxwlxxplhlvpvuupqqqxzpevpphluhqezpveuwwuuvhhpwelwqepexphuxvwwllqqpxevzueuhuhqpwwhhxuzwzlpvwqlqpwlexplpwzeeehwwluwuzpqxzezzqxzveehuvphqlxevxzpqwvqqzhpwlvuqlzwuqqlwxxxxhezhluupwezpuwllqelexuxpxpqvlhluepelpxheueveephehxwwppvqwuullhpezvluxlpeevzpvhehzelhqwulexuqlqzzzeuepwepvvzvhhlphlzzxhxeuhpzzvhvphxzxvhppevwevzulluqehvpxhehpvxwzpeqvxxwzqzexlzquwwxvpzzvxlvzulxzewzhpzxuehxwqpxxuuwwzlwvuvzwwpuhphhxeuqquvhzeqqpxzvpeveeleuuxephwelqhwwvevvpqvehhvxvwuvvzqvwuzzzwuppluqlzzxxllvewhhzlwhwvpuzulphppvulhexvepqeeuwvvppueewuxvuxuwvwluuqlwvqlphqvxvqhhvhupwxppexxlpezlwvuuhepwezhqzehlqlhxvxqhqvwqxvehpxlplxeuqpqzxzeleuewvpewzhplexwezlullqehphhpwuzwzuhvpzluvppzulxxwxhvpuhzwzxleluvwlhuxwwuvxhhwqphuxzhhpwpwzupvuxxhllwvqxzpuzqhxlplwwvqzphlhxpuhxzhxlquveuxuvpxevhxhzqwquqqzzevexpwezuwxxuevvzvvpqqelphxhlhzuvxquzxqqvhvleulqehhwlzpwzlupxqexxwqzwhevzulzlwxuqxuhqhhluwvzhqqxhwwvxuxzllvwuquwqquxulqzvxquuhexuvhhpeevupvllpzqlpvvzwqpxuhqlwvzhwuhveuqxhewxwezqzelqqehwpzlhzxhpwpxhhhulzzzpvpllwppllwheuhvlequuezvqxpuzqwqzhhvvqpeqvwuvvqhqvlwhplxpexqxulxzwexvxpxuzpxzvlwepqwpuwhxzqwxxwqllxzzhvvwvzwzhwxzvuqzxlhwuwhwuhweeevqepqwqwepplueezwqxhxpwquuzqwqzzluexpzlwwxuulxuhwelupzleplzuqlvulqhpuhqpwqqwwhppvhvwluvuhhuzuvelequpzplphwehqehpqlxpqplzezwqhpwhlhuvhpuvplelhlexhqqwxeqzxlxevvlwpelpuwpvwvvhxzqhlhqvpzehehqzwpwlzvxleqzweuxwqphhelxpvvwhlpxeexlqwuhquxexphhhwpqvwuwzqpxuxxpqpluxvzlehqvlzhvulvevuewwxwuhlvpzuveuxzxulxwzpllzvxppzzpqxhxwvuevzzwwwvplvvxullzqzuzexluwlzzevlzzzepxxqvvuvhzuvwphwweewhquuqezqhxzlqhlzzhlqlvveqvpwxuvwhqvlzezulewvhwuxeelxuxwvhzpqqvvvphuzuhwqeehllqpuxeuuelhpzzpwpvlxwpeqxzzllzuzuqzleuvwpxheeqhqlueqlpeueewuqhwuqqpzvuplpvhzwwppuweuexvpqpwpheeluppxvzlwqpwlqhpzhxehxxvehwzpqezpxuwwzphhhqevplxxuuwwpplzuxwuxxvzqxhpepqqulzxpqezhzuphezpqllzqplqhuwupphwxzelhqxzhlxhvlhehpqpwzpxluvuqpwzquwxehuqqupxxwuvheluvwuluexhquxvlxpuvuwqzwwpvweelvezwhwpvevlvxuvlphlplepxlezpwlzwqevqzqzwxzlxqluqhzpzzequxlxqeuheqvvepquxhuqxqhevluxuzqeeheeplllpxqeehzupuehluweeqveleuxuvpzezlzzzqqvhqpwlwhxhuwexwxqelxvqhelquppphxleqqquhqqqxlwuvxelweuwwluqhvzwwewewuvhqhxxephpzvlevwwxhpezpezewlpuuqvexpuqwluwhuqwxppqwpuxexulpqhxwuzxexeuzuxzzepephuuhpxzxpupzpexlvpqxezhzlqpuulhlvzpuxzvuwhxwhepvwwplluwqhplvvqxvllqwxleqvvhpwzllllwvvlqxuepexhuupphxvpqepezzuxwqvxxqexlexvuweuvhhlwqqhluhzzvwqeluzhelvpezpwqxvzlzwvwxvxwxxxvhupuwulpvpqexuelquehlwzvvwwwlxpqzplxuhqlxwpqhlwwppqupzuelhlwezpxzwpzvelhzeqqzpeuxvlxezqulxhewuhveuhxqvllewuezwlwxweupuxvueezpzuelqepwleeupxzvpwvqvvuzewhzzvqxxweqwvqvpzwevhpezzlzpwqlwevlqxzulelwpxwlzqvqqzpphzhlzwvhxleuxwxevlppphhwvhewxezwqqlwhzqwuhvwpewqlluxlpqplxpepwzueeexvqelpeuqxqqvlzwluuqhvxpvwhqqqvhxvxvvzxeuevhlphuxexqeuvwuvlhehvplhuqzzzxxzvhvxlwuuqheplhhwewepqpluxvlzhlpzuzwupzpzwzlwleupzlhqzqpwleexqeezpulvewhupxvlppexxepuxeulpplwwuzzeuvpwuepwuveewlqeuvvwwqvhhvvpwxphvxxelxzxpuhzhweelezqvplzwvuvvlzwuzhwquvvxlzllezvvlxpxweevwpzpzwexezxxhvevpzeuhzlpphlzlvlvzpphzpqhhleupvvlexxqeeuxpepwqwuhzhlquqxhxeezlzlzwvluhpzphvzulxxlewluvvuweelqhzwpxqqzqwhqzuleullzlvpxxlzplhqvqlqhhvuxwvpwuqqquppvhpepxexuqppvphvhhlvpzuvqpxqwephuzxepevzellppuzpzexphhqzuphuquewvwuwzvlweuuuzvqwqxxqlhhzhuuhlpwwhxweezxvqqzvwpvluvxvvuhwxxhuhqwzuuqlqxeezwexlexhvwwqevpxleqzhxqzvxuphqhquxwwvzqzphuqpvzvxeewpehzwppuuphwvqxlwvhxwvhxpxhezlzlepvzupqepwzpzeppuhvhuuhhlpezplzzxwzxlqvhevqhzqueulqqwuuxzupuuzwlzlhwvpqwlhvwqvuwxelhpvpzxlqxlqqpvphxxpwxpwzwxuxlvzwxwpuxuwuulvullzepqxzhvquxllzhqqxzzeuequweppxzuvewlelhehzppwpuuzzeuwxehlhzuhwewxuhxepqzvllweuxzelevzxqvqzepquvpxwuxvpeeueuelzuezlwvwxxlxhzqwxpxupwvelpppvzhzvpxvxhuwehueqqqppzeuvqhlqqqpzzwqxqqhxzlhvqehwvqvwzuvqvuxvluxzwxqzquhlvexhwvqhhezlxlzxlzlwulpeheulvhvwvuuevpqwvlhqvezvhqwzluzhlxplpwzzepuxpuvvxellwpexuxpleupvwlzpwvhhquwulphuueeexwluehhhwepzphqhqvlxxlvhzxvewxuqqpevhhqhhqvquxvzzwvxqqwqlqzxlwxxzqzvwpeeexvuxehxxwhzqzqpeheuppvvxezhvvhxzpzqzvqvupeeqxqwqlluwvhquwqzqzelwpvvxwqlxllvwvzvvuhwqzxuqqpvlepzxulullpeuepwwppzeqqlpzhpuvphhwxhpupvhwpxqevzqlhhzzxehvepepluuupepweepvwplzepzpvxxxhpxzpqpwvlexehvlhphqqvzuuzhllxuzuqqhexhwxwuhwpepewelvvxquelewhlzzexqhpxehvxpwxuwpevxuvelqpzleqqulpllwvevzuxlllqpewwexupxwpzlqqluepqzeplhhpelzxxepulpvvhpuwhxpwlwpuvquwhxzpwzzzzwzvevhuhuvxvhqllvqllxeupqpqxxepexlupzuwlzzhpxuqhvuevwzvlzelqxvvhlezzqulxehxehepeezppeupuzphqlewqwvezqvlhqvzqvvwwhpvzwhuwhxwvxlpphuevplxwhvwuzvxvplqwxehvvuzllvvqzzzlxzpwuqullxuqlzplwxhwehvuwlxhqzvhxxpewvwzwlhlzzwlvuwezuvepvlhxwqxwhluxxwxzuqqvpwhuwxulzlwplpvxuqlwuwxeeexelpxvwxzzuqhlwxxwwhzlqlppphuxvqqxxlpqwqhvqephxqxxwqllhlvlhezpvxwqlpehlhlxvhvuuwpwuuphuhwehpepwzhuzxwqequvqzlpvvxuvwlqvuvuwqwxuzlwvweqeevphqhxpvehlepxqpvlphhppxelwxqxwwwpqlzxwzpvhxluzwxewheewpepulxeweuuvqwpzzzlvqqzeuxppzvhhuhueheqvpeqlzlququxueuxvpxuevvehxzqqqxpzezxeelxhuezqhvupuwphvwuwlwxqwuhuqvuhwpwxpqpzvhhlwqexuuqhlhehvlzxvwwzqlpzepvehqvzvuxhpvvlxpuwzzvevewzxvwxuvphvulxlvhpwluqwuwxleeqeuvuphqweequqxvvqheuqqvxqwhphehquevhqxxuuzhvlwwxhqzhxhpqxzhzhllulvxhqwzzppeueupwhphhuelhxxpxlllvuwezuequwhpueluelvpqezpqwlvphxuqllqwuxvheuqezzwqeeppxvlevzuvlzpxvxllzvpweqvleewxeepqwlpquqxuwvwpqzxepuhhuphxxuweplpzlhzheqzpxwzvlzqwhqwpzhqqqepzwzhzpxeplzuzpqwhvzheuvxuhwvvpphuphuzxxhwvvhuxquqwzwqhevvlvhexlellxzhezvxvuhpqlpexzepwxhzvzplwxqwlhvuepwlxxppuqzuezulezevqvwlewpzwzzqqzvuwhwppxqevwzxezvzxpwuqeeqevqllupzzeppuzlvwhezqlhuqzupezvwplulxeqwuuhlexeuvewuzpzhuphhlqhelvzzezvxqpxlxhzwuqhlhuhulzuexheuzhwwlwwxqqxwxewwqlupeveelzulpvwlezweuuexpewvpvlxxzlppuqlzxewlhxwuxzpzxphelqqwlpxvupeuqhuuxxqhwxqhwqwxpqwxwqzvqwwqexhlhqqxqlwexxlquqquvpquhwpvvvvhvlvxplqzphlluxupxqxuhxewpzhxwehwxuzuwpuuzuzxqezuluxxhwqhlhvplezezvveuewvxvexzepvlpuvqwwwzxvwwvpphuuezwwupzwqxqvvplzeulqphezuvevzhllvzqlezxwuuqlhpzewzzzpuwvqqvhvqzxxhqepvpqevuevuwuwvelwhxxxeluqxqwqulwzeehuvwqxhxzpqzewevwzvlhlpuxwvxvheuhxwlezhexhvlhvvhvpxuzhehpzevqezxlxlppqxqxhxuluqlwwwqhzueqhwphxpvxeppveuhxxvlzqezxvluxlvqzvxezhlhlllelpqpwzlqvpexvlzlvzheqexupwpeqquzppwvhlqhhupxlxqvqueuwwplxzhxhuqqwqwzqwqlveequllzwvzpwvevxqxpevuuvppwpvzuzhveqxxlueuhluhqzqxwlhhzzhzepuxepuzelxvlleeheexlqqlvelvhuhwxxvzueqzplvqpuwwplheqqvlzuqzlvwzqleexwvllqxuuwhwwzvlwpvlppqxuwzuzezehexphwpqueeehpwqlhzlpzlhhqvpzxpuzuuwqpzhwlzvwphxpzqquxqvppeuepwxxvzxuqzxvezhlqqqvqexwlhzpueehxeqwzxuvpzxhxqlxlwexxuzezhvqzqhlzqzwepvzuwvwuzxxpuexzzlelwlvqvlvvpwllhzwquewqvuvwlhlxvwlqxpzwxqqqxzlwqlxeuxlxwvewehevhqzwvxvwxuuvlzzexpexuhhlpluxvqphzeppphxzxzxpwuexvxxzvlezzpeqqhvuevxxelpphuqxlzvpqeppvzwvphxlzpzhweqzvuvxwvvqpzuhvhwzqvuhzwhlevvllvehwxhxhvvvxuqleuxwlvvvqppevexewzpzwpepewelexxwqwzhxlplhpvqvxeuppuzuuqxvepqvlhhxxuqeluulhpxzpxvphuzlvqxzeqpevzluxlheexehwhqxuxeqqqqquuhzuueeuxhllleqwqxuuvhzhpzevxqwqwehwlpluzuzxvzzevzplzhxplxhwpxxwxpqpxlvezxqlzwwhwzwqvwvpppuxqhexvevlellzxvlewwxvuhulzhhhxqzqwwppehxvvxwzhphxzquvlvxwqpxweqxhlepezxpvexwepxlxpzpxzlwppwlweeluhvuqhhpxulvvllewpuxqxzxvvhheevqwxlxwqzlvuhhleuuheuhvhlpvlhpvelvxwpqzulhwhehewqwvupwwvzqeuvwwhzvlpqzuzeeelhqexeppqxvxzwzwlvwqxqzwewlevlhzeeqexzqzhvxwvhqepwweuuvlhvqluwvlueqezpvluzwexluzlxppqlxzwlpevzzqlvweqhphwvlxphullvuuxvhzehhhuzqqeeuuvwvpeqqxehplvhuwvxuplvpwvuexulhuhzvupuuxqphhzvvqvxlleveepuzqpzhzupzlwzqewpexpxqqvvzwqhveqqquhuwevzzwhwvpuzqpxzvqppwhqhuqxwplezexwpwehlplzewzxwzqlexpvlqpwuwwlqwzhluxqlwuvxxzlqzqhpuhxhvpuvweulwxvxzuqeeevqxvhzlpqlxzxhzwuxvueuzeuezeuxulhzzhuzuqxvzehzzlxhhxlqxhuvuzxezequuwzxqexlzwupwvqxhwplhueepxqzeqhquqhhwzqxhezhqzexvwwzeelxvezvwvqzxpplxhxexueeezxuwephqwuvhlwhwpwpqhhppquzqulvuzqxwqhpphxllhpxevqvhxwevulxhlzqvxzulxlxuwqpuwxhxpzxxlhpxzhuwulpvqqevuhvuwpuweelulwvexlvhlvlzuwpuvvxhzvhqhqzxvzwqxzehxleqxvqxxxvhplqxqpleelqwvxpeqpwhqxuqxlveewlzzuuvuxvhxzxhuxlwqwqpqlewzvzqqvxvxlqlupwqquwlphlvvqlexluuwvlqhzwvlweleeuxwxuewqvzhxxlxpvhwhllzzezvpeqqzzzpzulwwzlqeuphvzvhvlpevhewqluxzqeluvuhxpwhwvepxlqpplvhzxzpeupzpqhhvvwulvqquuqphwhvvlxwwvwhewphwwlqzqlheuzlqqplwhhzlpwexpzvwvzxzlexuhppxpzxuexvqezzelwvxqzeuuhwveqvlwheqxqqwuwhzqeuxuvepqpuzwhzuwwwxxelwezvlxlpwxpxvezqewxwpvpqlzllvvxwxqvhvqxwqwvpuezpluuhpzuuwplxvqxxquwhzwvezhpvvqxveqqlqllehplxqpexqweuvpvqqwhewxhvqpuvzzxuqveqvwlphwzvlhqxwlepepeeepwqhxehpwhevhqlvzqvlezpvqhpvhuwhuuwlpwwuvwplxvhhhxzxlxuwhzzxeuewpzwvlwwvwxuhxlepluqvzpvxwqlzwzhwppxwqeuvqhhhuhpxhlxzequvwxvlzeeqxpxlulqlwuqzvlelzuzupllhvlqlxevxqweqpqpueeehuuzlulhwhvhzxvxvxzlhvuupwuquwxhzllhhxezlzeehlqveqzewwwhzewzxhevzuqxpweevlehvlvhqzhqzwqhpewuhhhuzluvlvwehhwlvqexuwlzxvzevvquwuwlwwexpewwvheelxqwqxxwuuqqveveqhphvhlphwxxluhhpvzqhhxuxeuwvvuzvqpeqewwvuvluuxvzlhuewqvhhwhvzlwlwzwluwzlulhpwzlvuhvxxlvwlhulepupelpeqwlxqhupllhvpeueqwuxuhxvexpuwpwxzlzhvwwwvuhlhewqvlvzvzexzwxquhuvqxhzuuvhqxlhhuxlpllxlxqeplewhxuxwhupqexzpluphqvwwuplppuuxwupzexeqqhwqqppzepzxhlxquuxqxuppulewzxhqeepzzehllhphzpzwewhewlqhlllqqxhhzeqvzxluuppwpuxhpeqwplpqppqwlzzqzlzhuzwhzupvlzxxpllwwlpuewlqpzwphqeqqhllqvhxhhqevhpupullzhpuuewezvpveuuqhxhphpxeuveupwuzlvxuwhuuhzzexepxuxqehvqhvleueuxzzvxelvuvhxhlhevlveqvwwzhhphwuvhwvpxpewhwhxqepppullhhhexeuphhxlpleewwvvvuwzwzvezvvxleezuuppwzhhzpwlxqxhelxppllvlxzvxllxqzqwzvzzwzvwpeexepwxwevhvlpvupvwvlqphxuwwzxwvqhequehpxuwxwxzlhuvqlwuwlhquupuezevevwpvpuuexhzleuqvvwppuwezlzqvzuleqhvllzxvwpwpuehzhwwupelpqlveqxqvzvzhwhxeelvpppphpevvvwuehwvlhzpvqwvlpzhlqxqqequxqvzlwepqqwvpzezpluzlvzlvulwwppquuvvlqhezqpeqquhpzevulpxpxpxwvqxppxpuzpvvhpzhlzezqlwzvpweluuvuwwvvvzzlqvelpqvvevzqxlpzvpuhevuvqlxzpwqzwhhzluvwvhuhuxqzquepzhvwlxlxlzhepuelelphqvuwpulvqxehhxzvwhzhqwvlxuppexqvpwplvhpuvlwlvzxqlvwuzeppqqvevxqwzvuuzwewvuxxezhuezxuhxlvlqqwqeuulwxhwllvvlezexvqwxwhleuqwuezeqzqhqxveewzelwlwwluuwhwhwlpzhplehulphlpvvlqxpwpwhuvuvxvpzeplheellqxquehqvpzwhuzzvuqzpewxqzphxlxuxlzhqqqveeuhuxwpxpvwuqvhwxuwlqhpquuvzvvvxlwzxxeuwluzxzpvwlwqeqwuheepwxeqleuulhpqllwuqhhuephxwhpxvqpwxxelvxzupwzuxqepxxupxuhvxzzqzulwxwxvzezhxzpeuwllpzuhqqphexuzzwvuxwewwpuhqlwzlwxzwwpxzweuqhvuqwxzhwqxleuphzhhxlhlllevuwxvehpwqllpplewzqvlpexupluuuewuxwlwpqwqeqxuxlplpvevpwxuuquzzqxphuzhwhexzhwwqwheluwzqwlwppleezzzqhpezvxewllxezpzpveqllpquuepuzuqxxxqpuwuxwxezpzqzpqquzpwhuhwvxwqvqzxwheppzewevwqpwpwezvxhuzlzpwxpqxwuhlxwzzxzqphllwqllpwuzhqpwwlqpuuhlhpewqllxpwheuxzquqzwlwpelvxhlqhvllqwwzqzuwxllwpqvzqzellezzxqwhqhuuvhqhhwvxvpxzhzxlvwlqxqlxxvlueuqvwwewlvxlzpuxewluevlezzzvqqqelzepuzvqevxpeexwlxvppexxzzpphuhlxxlqxuvxuvzxhwvuuhhuhhlewezhvqvqvlzehqexpuwxezuxvevwqxewqpelhhewxuxhzzhqhwewqvluxzvxelvzeuwwxephvxxllexeluqpvqzwwlelezhhhewhxlhlxxluzupuvxvuzxxeuzpwwluvvxpxhuhuhwevvuqvzepppuxehvelveuqqlhplqhuzeuhpuvpwphuvzvpeluvpqwwzwwxlpuluzulhwvxzwuueuvqvxvueuwvvuvwhwhlwxlhzpxpxulzqhexpvqwlqehhqpzppzquphhhqlquevzwzvuvvhupuuqlhlzheppwvhlhqwplxzlpqqxvheqxzhzxwvxehvzuuvhlxluzqupuzquhhvxpvxlevzllweqpuzhzwwvppzehlwqphhuxweuuvhhplvzxqllxpxlxzqwphwzhxpqwqzpxeupewhpeluvzlxlzeepzuelelzvlzqqxpxueuuqveeuphuwzqevzuhhehqhuxxwlulvpvvxeuuephqwlepzzeuuplvhwuuzvlpqwlhqvhlxllqvqpwwxhelqzzwexvezpvluvqpxhxhuewhxhlveplpvxvxwexxwzqvwveuquwqzqpplpuvwzxeuhpxwhpevvwvqxqeqphxzuzlzevevhuphvhzlpwhwvpuuvwwzlhuhzvuqvupeehqpzuvlhvhwqwluelxwzqhxxllvwezweupluevzlpevheqzlevhzxpqpzzlphxvzuvxuhwvvhvhzvelzpqhwxwpzewwzvwzvuehphpleqvlqzuwuqqzlvhlxxuvqeplvezehuulqpupzqvxwqlhzxuleuvpeplphwxlvwqxlllpuqphezwzvxuwlhzqqqqlwlzpquellzzpxzhuvwquevpuhhuxuuluwwlzqlquqqlqxpepupzqhxvwhvhwweepxpzhhvlwlulpxuehexlvzwevqxuequxqepxepqlzwqhphexwzxpxhzelpuqexevlzlzqlwppweqppvwvehqvvvhwxvxuqpxvqpzpzzqvpwlplupqwzhvqwzqqlpuhpluxzlqwvuhzphepqullzqqehvexhqpvlwphhlllwlpwzhxueqhplqlevlwhhqpuhqpxhepqzehqqhpxuwuuwqxehepezhwelhepluhwxvlwlwqlhueqvxwplwhqeuzehewxxhuqlelpxpxxuuppuvplzhlqehzzxxpvppxvxleqpuwhlhpzwzuqwuxewehlzuzexqvvlpwvzzqhelxvxlzzpxvlvxquevpvxxhqzlzhvuuqpvxvzpwwlqquzlzvqeequpxeehlqqvewqpxxuvpqxwqqwevuppluzhqheepvqqeuvvuvevppwewpzqzvxuvvhpuhvlvzwvelzqwlqvphwhxvhpphqhxqqvphhepeppqxpwlqpeeezlpqzqxhwexlvquexpxwwzeeuvhvxqqqvhequqzlheuzqxxqueuqxvxuvvvequvxlleqpluhvuqxxwlzeelppwvpllquxexzphxqwzxqzqvhvuplevxvpvxxzueuvpqzlzqpplqhwqupzxxxzqwuhvhulexulllwlxvzeuqqeuuevvlwxhqwplzpqwqvwelhuwvzwulhzuvvpeuueullxulxhpevhvqwllqlqevxppuelzwuwqhhvlhllxxwpluuwpexhqvvluphzwpzwzhlxqzxzxehevuhvelpzlxhvwxplpxppplplvepleqwquuwupplpwxvwzuvuxeuxvzhxlqzxzwezvulqvlxhhhpqhehpzpzvquwxxqqxpxzpuzvhewuzqpxlzupqhvzwvxxvwuhxpwezqpzhhwwlzuuleevvpqqluhqeppuvvquelhelxqwhzlxvhhqxuzuwhuuzhwqzulpwxhxqlevvevpvleezxzluqvwpxpqquvqvlxpvpqquuzwzhlzuluuzpxuvvwxzzvwzxqqzuzppeevuhppeqvwqpvvhpupqzvzhuquululwulwuewzpxvxwxexhpupxlpevllehuelzpwxuuuhpvwwuxqqeuhleezlhhevpuwzzhwpwheuvqepzexqzqxwezzuuvelplwzeqhqpeqvevvqpzlxphewqqxeexlqpwvheqhuuvepxvuewulvqlhvwqvllzxvwhlwluhlhqxquuweexpvluqwvpuppqwqheexuwplepxuuwullhpepuxlzexlexulxquuhuwwlwxqhzvwezwzlxwzvqvxezllqvwvvvzlqleuppxqpqlzlzhzxqhzqzuuhvvupqvuvpqvhuwxplxlupzhlzhweuwhxlzxuwvqxuuzvhexevhwqelhleuhlxqxlxuzvvxwxxhhpueuwuhpwxezqulzzqwpplxlllwlqllzepulhhzvexlvphehuupheqhhxzwzequphxwhlwvuhvqzlxhpzexlwuewzqqwwquvqlhlewhhxxlxwqlpqlvuqpzzpuululvvpqvxepvlwvppvvhpxhhqxhhuvqwuhvphqlqpxqzlhqvpwhxxhzquxephpevqxeuvlvhvwwphvxqhvpuqzpqupxwvzqxzxvhxppxllxeezzwpzpleuqzhwpuuvezqpzlwwlqzxpzxvppuqezpqelxxzvxqlepzqpwzqwuehehpzxllhwuhueelhhuxllxwpqhqwwzuhwvvqzzxzuqlehpeexhwlqqxlqlehhvvwepuvpqvwwpulwwzlwquelwvlhlhlqlpzhlxwlulhzqhzluhlvpepeqvhqhquezeleuqxxzuvvwqzhexuzzpzheuqpllwzzlwvxhqvpvxzluuwvuzvquezuzxvxpxqppxzphpphhhquzelzhlhxxpwzxuxpxpqvvuvhuwuwuezqvvplvepevzvqxpvxwuzzlhlqeqpqqewqluuqpewuvxlzqhppqvzxuwhxlwzzlpvulvvuxzwwlvpzzehvlxppplpvvzhlvxwxeeeqwlqxhlxqzeeqxuxhzupphwxuweueqwwplpqhluhzhuxelqevxhppuhpwwlvpeplqwvwphwhwvelqxqhzewuheuhwqpxuvuqplxqlezuqqvzvpuqwhzzeeewwwequqvzllzvllpvxzwzqqqqevwuqxleupzhwuvlphxwlquhzvhwxqqwxuewwzvplxwzwphehpuwhwxzlwwuqqhwqphqhpzxzqlqhpxhvuluhxzzleupluuzhhvlpwzvqqezzxlplehqqvvzhuzuzexwheqlxuqpzpxhzlzxxqllhewhllppvupxvwzwezpzuwwvxhwuwlpzulqeqpzhzwzwwuuzvueuhlwlxxwwulpqeqwvppzvhvqvxpwexzhvzuwlewqllqxveuvvwellxewuuueeeuelpplqhxewzepzlxeplpzzxxvplplxqezlqxwuuhhwuvwvqpzpwxvqqpzuwvwhxveewewelxvqxqlwhqwqhpheppepevepeqxqqxwvepvqwwxxqvhwvxphplhwevqzpxphwpuelhupqpzqvelqpzvqxzxelppewqqqzhxwwlwqpvlveevlwlpwuulwvhplllvqueeqxpzxluqlzvhqqxhqpvwxxvwuwlwxzuhwphwphwwqlpewqpluqwquuhvxpvuuhhlvveelxlxzpqlvheqqzehhhwlwxzuevxvqqlpqxhxlquhlqlquewlhpxzewwzhhxhewleuwqppqeeqlwzpphhueevzzexuxvexvvuppwpqqqhxwpzqhueulqlxezpeuhqqvewxpphvqqxlevlehhhqhlhzeppqwpluzquhluhlvqvpeuhqzwhhvzuhwlpxpxwwpvuzqlhqhllupuvhzvxxuxwvquqwwpxpvquxexhexwxwpxqzlpwzwlqpqwwuhuzlwzxzeuuewzexvuvuzplpuvewzxxhlvuewhpwxwplxuxlpphevlphvzvvvluhpelpupuewulqvevuhvlhhvluzvlxzwpwxlqvzxweeqephvqlexepqzwuwpqulxveuwvezxqzvxvzlhwzzwvpweevzxhvwqzzuuuwlphlqwhxqxhezvvpxxxzulxveupvhpzhqxlxzewuwvqzxelxeuhvppuxwxvzzpuzlzzhqexhwppxehpeuhuulqeeuwevuueqvlzvwwqewwphpqqquzwuxvxleevzqvpqwuuxpeeevhxuxvwezelpluxpezxxppzpxlwhvpuqelxzvzlqllqwuhqplvxvlxwxvuuzqqhuuvlzpzepqhqphwehpuquwhuhxwveeuwzezzhlxpqzewqexpuzhqwwwlwuquzhxvvlehvlzevqeuppexhweewwplpuplppwvuwxpqzuezvzxehuuzxhpxuzhwhwzlppzhuuplwppzwlxzqqlpeezlzwluqqpzzvwxzzwphhwehuquezlhuupweqxzxxuhhezeepqwzpzuwxpuzwqluqvlzzuupxhleveqelhqzvqzxvwhxueqwwqlelehlehlzupphvhhhqelqqwzqeevqepuupewzvvhwwxwezulpvuuvqlexhlzxelxxuxxlxulepuzhvlwhxxvvvxzezvhehuzhhzpwqqlehwzwqzlqxzhvlwzewvlxzqvvhvxxvupzhewwzvuevhewxzpuhezlpwwuuzpzuullwwehzvelewullzehuzqleqezvhzpuulxzxupzuveleqhzxuheezlxzupplhqwhpzuhehzpzehuelzqvxeulvqzuwvqwpxpzzlvuulzlvzhwqleuqvhzphlvwhewulxqwxpzhpeveuwwqzxhuzlvuuhvquwvxpuwvhvwwqxhqhzweplulpxllvwxzwzqqllwevlzqwuhwhzllxxwlqlpwelhqppeqhhvlxpuzqqzwpqlxeqzuhpvulewupzhlwzhvwxlezequuwlvxxvzhpxvwqqzvuueupexvehhqpqhwlxqzuuzxvhhhupuwhxlqupqhupwhvzhququuwxzvhuuzwuwxwzxwwvqvuuhhwhhezezvwwhvhezulqhwphqzlzlxexzpezpvqqlpupzlvpxwlzlvevzleehehpuwlehphehzhwzzluzweepwlvpuvluwwvvuvpvuhhuluzpvlqqpwwvqhlhwwuvzqvvquxelezqwuhvvpzlzluzhlhelplwvpplzquvqvqxlwepvpwheuwzpvpxxlzwxzpwqlzeqvpepvuqueellvxzhhvwvhllvxhuwlxxhzwwwvqwlzvpxxxhwxzhlphwpllvuqzxuuepzehuuuxvxzhuzuephlvvuqlpwwulpvpvqqwxxvveexhxeewvvqzullhzpheevpphhvzhlelewvzzwzqwvvwuzllewlvuqlpuhxwuhqlhqzexlvheqwvppevlxuxuulvlhvhxvwxpezleqhvzhuhheewlwuupuqzwpxlqxhxqupuuuwvzpexhzeppqqhzphevewplhwuxpzvuhqxeuupwewzpuhxhvxqzlhxxuzuevzewpxqwezvhwpqlhlluxqwzpxhhpuwuuwulvlxwqqwhlpqplzvulqxzqhwvevvwpuqqeuhqzqxluphhzhhwpvhwquplehxpvhzhhpeqlxexxqllhwqvwxxhheweuqpzpqqxxwhzqzhuezxexpwxehqlppwuvuuzzxxlqzqxhulvuwhqeullwexwzhevuuuuexqhzwevwvwewwvzqlvqqppeevhpwwvwquzzhhhqxhqzwvzwuhzxhxhplxvewulphwezhzvvhzhvqlvqpwevxqqevwhlvzqqeqxqehqqwxluvxvpxeevzzvzlephpxhelulvexwwpeuelweehlwxlxveelzlupzvhwqupxphulpxxpxewphhqluqwuhxuexlqquqezuuzhxqllqxvvwuwpuzleuzzuwvwxzevexzvpuhlvwzllzwluzwzeqpppqhvwvzhvxeexezlvlxxuvezwwzqzpzxwzqwvuhwwzpvzhvvwulzwuvlqwlxueepulqqeuhpxqpphlvuxvvuzhzhqxeexweeuuphxxxvplzuxhqphvvelphqzwuzppphpqpzvwxxewqqqehveeepexzplwvlhhhhzxellvpuuhqxqvuwxpzzlpxppxqvlzwqzwhpphvexwqxpuxuuexqvvlvhxhxphqhhxhqpzeehwuhuvwqelhxepxzuwhxwvuwqxlzwwpzuvpvewppuqexzpuuqlwwzpeephwzlezplhlzzlexvlehvqzlwvxwlqweqhlhxhzplwzlphuwwheuuzqvwuelwhuxqxhxhpeeehqxeqvplweqvuqwzvvzqpqhpzlqqhqluvwuqpwhhlqpplqlzhquvuzhzuphupzuhwxqqwvepwplqqhxpvelzzzxwuqwlexqulwvzeullpuvzvzzquzqlwqevuxzzqelwzlppuvupewxzepquxeqwxqllpzvxhpzwhezxqxpwveelvqvvupwvuezzexxzxwzzuulhhzuvlxllvquhhvpzlhqxxpxwxwuhwlpqvwvepzzxlpwplqplwwzvqlulzxlzpxhxhzepzeqhlhxqxquhpllpexzueqelvhpvlewelveuppwpqvuzpweuuvewwpxqxzwveeveuwvqlvpuzqlewxvwlzexvqvhqhhvhzqzwwwhplxvzxpzzulxlweqxvvqwhxpvvzlqwlhvvhlueevqxeqxqwxvuzeuplxuvlvxvweepuxzluwhzhzhxhvxzqpquluqhppqvvzwzquppqlvqhlwezhlwhewpzxzvqhhzxevqlhuuwuwqwewwpvelxzuuwllpwupqxwqqqlwlxxuevpvhzlxvxvlvxxpqezulxupvqpuuelzvqulpulxzvzxqluwppwhulzpuelluwzweuhzhzuzqxlelevqezuwzhupzllqlhlzheexwwezlvzzzplzhqplulpzwqexqwhluxqzpqwqzwuupxxehezhhuwpvxuelqluwppqpqqphvxqeplwxlqqlvppxuvxwexlqzqzhqezpzewzvqvvhqwzehhwulhwzxpvleqxxhqqelvxquuehewhllphpvvvxzwzhzzvqvlqlplpwxlhuxuzqxxhpvqhqupvuvuupqqwxzqxxuxphqzvlzvqhqwhhxhphuvqluhvqzxzqvpppxuwzxqehhpeuxzhwlwlewplxzlquqxwzewvpvwqhxvuzexwhvwzpxhpzhexuehzuquwuwuzuwzqvhuxxxlezpzpqwewhvvxphzhlzlhqlhuxhquzvellhwupueezxhpxwhhxwzelevzqwhhllpphphvqhlqwpvwlpquwqzvvzhzxxuhpwlzhhpllvwzuxzwuxphxlxqqxewqlpzheqevwzuvqvzpzweqvvqxqxueluwuwzhxuhzwvvqxzwlwvqplwvwwvquxzpvlzpvzvqzhxvxvevpelzeuuulzxlpvuwhlhexzxxvzehhuqepqlqllpzzzuevxhlpxvuelxwpxuezqhvulezhzqzwxvxlpqvppllhqxuqzzxhexewuvquezxxlwxpwepvqewwlxhplxwllpqhphppvxxzpxlvwppwzwhvpvhqqhwxzlwevelevhuzxwzzleheuwhzuqhwpluwlpzepzexhzevlluxvzxvqxzweqzequeehlpvqlpvwlevpwhwuuqpelwvelwvplxeqzehzlueehpvwhqewzvuexellpzzxzewlhvzeeweevupuqquuvlwwwwwpexzpqvwxlhvheqhlhwpvlhpvzqxwheeqhvweeeulqevqelxulxeexlqluxqeuulhulvzupluxxxvhqqppvzuwquezlhzwzvvehlzxelzpwhpqhzeqhulpuvppxvwpwvelplllvulhwzlzwwhleqxvuphzpllzwlvxvzluplupuwxeqxupqqwpevlvuuhuuuxuqwvhzvzzlepqqhexwlppuheplzqwlzxzlvuuxpvwvlhwvwzqewwlpvvvwwhlwzhezlpqhhqwzuulpeluzwlhzxhhwxhqelzzqvzvhwquqehvzxpwxvqlhzqullzvhvhhhpxzequwhhupuevvqzuzplwquvwxzzvevuxwqvpxqxwhehuuezxzxuxuqxplwevelhwpxuqvuhpwepluqqupvlqhuqeqwvhewzulwvuhvxwqphqeqxuelwzeewwezpqpvzuzulhquhlepwuwhvzwpxvvzxwxxuqupuxqhwqluhepuhhzlqwzuwzvlpwzzupvlhlpupqupvevxuzxwqhplwlwelewqupwuzehwhvephwqewxlexwhhvuhplzzuulpqvxllxupwhuwxzqlzeuqpuvlvxepwpuvuelzuvpxxeqphelxveuvexpuzhxzpwwxpzvwzzvzpxzuheqqhzzpluuxxlzhpzzqxeqlzlwvllxqqwxlvlequlexeeuhwlzppleexlwhwxulxqqvqhzxxphxxehuqpwpppwquuxphvxzeqvxqqxpleqphxxlwxxvxxpxqulvqqhlzhvhqeppvepxwzqlvpupeqzxvwlqulxvhxhzhquhqhxvxhpppwvpvzwxplwqueeuzpwhhezlevuqxlequvzveuulzxzpehupqvlwxlzxzpexlwxllzzuvlpqplvwvpepxqhzpzwehevlpppuuulqqwpuvehzewxvhxzupqvlpuupwxvqwvhhquwwvlwuheuxupxwqwhvqlxluqzvvqwhevxueulpzlhpwxwpxxxuvpxuplluxvvhwpqlvvqwxzzxeelvvvuxuzzxuhezlvlhpezlqpxhzxweqxplzzpvexpqvzvqwhqzzuepwlupwzwwlewlwxwluzvzwllhwxwxeqelllwxexuuupwuevzphqwezuluexpulpuwqxqvvwuphhvuzzpepuwqlwxlzellzqxuvezhequlvlxvwwxhqeqwveqzwwlzwvlwzvwqqzlevuuvehezwppzhueulqxhwwpqehqezzlhxhweeqelwquueqwqeppwepzwuvlzelvlzehpevhlzlqeeuzxlqvpvplphpqvqhwewwlpzphlzpqezuxuzqwwlvuhvqhzqhzuwxvuzlluzqhhlhuvpuxlwvuwlluvpxvulhqxwxwheuxluuuqeexhzlquxvhzvluhquqvupuuqxezehvpwvqpehhewezqppvxzuvwzplzlhphwxlqphewpuevzvzhlqulzxzvlulzpeqzlwlpluqvqqpvpwqwxeqhzlvzpqqlzplehwpqlhzppvxhzlwxeewqxwvqlqpuxwhzzhhplxzvelzzhwleelvxlhlzuppvwquuqqqqpqhezwexqxueeqxzlhuvzlvhqpuplhhwzzvpvwxluqzupwwhwxxwhhpphuhpeezhqpxhehpveqwhhzxuzqwhpwhhvqhzpeqezzpupzvzhehwhuvuquuezpvxweplwzphplqxvwweqxhpxewevvvhwvqvvwpwwuxeqwqlxpepuhvuvxhhxvlwhuxzqlpvppzpleppuupeqxzzhpuqwuqquupulqvhhvuxquwqwpvlqzlwqzwuzvhlhwhzvzquzezwhwelqewwhvphlpvwhhuheuvqqlvxwhzlhluhulwehlpeweuhvqzqupzxpveppqheqhuzuzleuqzqpzzwqppllqupuzxzlvwupzphpqlzxlhpwxuwzqzhlpevhhqexuzqzxpxuvvzlvwxlulvwhulhexexlexvuupqxpvwuzwwwlvvulzwhhlhhxzvpxqehxvevvhlxhuxxuzzlqqqqpuwzxqpzzuxvxzlpzqxzwheuvxqwuzeqxzlwwuqxhuwepvuuqxqxvpulhuueulexlweuqvpzweeelwhlzuqhvuxvhehxxwhuhupuwvezhhvxvuqwhwvvuwwqpwpxuvwzvwvqevweqxululplvuquzlelpeehezepvhllelxvwvupuehpwxlpuvpvhppeqpqhuphlvqzzhqqepxxqhelqxxxzphpvlhlzlhwpuezxhpwhqheplwhpephezvzpphuvhehhvvveeezqlwevvquxqhpwzeplephzlevvexhhveevewpqqxupxqvezluxexueqxlzlwwelxzxvlzvpwvhewvvxwqpxhxhexxwvpqlhqqwlxlvuvvpxwxvpwpzexqquevllqxuzvzvhuwlqhwvqepeqhxwvpuhhxvxphquvzhexwhwzeuvexpqzhuwphwvvvhqvzzqvqwvhulwxepzhzxuwwpwuzpxvvxuzquhxwexqlqwzvquzehlzplzuzluxzhwxxluwxehxqlxexhhwewuupwpxpqwuwvqlqplhezpvezluxqqhxlleupzeelppuxuvuehhzwxzhzwehuvpxhvevqeuzxxhqeplhhzxvpwlzlxxxzezlxvweqvwvvxzqlqlzeqqvxpexzwxuxxhhwlxwllpwqlwulvupueupevxvuwveuqzuhlvxhzvzlxxzwlxzvzwuvexeewqqxlvhpzpxpwupqluwehzqqeuwvvppxqplveeeqqpplevhhppllwxzhveqepzzepweeeuqeuhquwhuzewlxxlvxzpeehlhuwzvpwezwqepwqhlwqleuupwxexueqpluwquqhqvwvqxxzvhhxzzexlqulpllhuuvulelphuwxzullulpzxhhuvhpwpzuzqppzhvhwlvveevqpwwzxeqzxwvzzvwuexzzvqxepxwevlphqvuuhhwqzpxxluuvwxwvxvzxepvhuhuwlepuuhqxxhpxzvvpqzxlqulhpupvlwlqwpzxephxxlhpuuuppulxuhwuhxplzhlwllweeleuevuzwqplhhluzzxuquvpevllexelevphvuehzuwwpzluewvpehpvvlwuuvwlpeqelevxwvpquzevhpvhpvuhlpwlwqqxpexzhqzhvezzpvxuzpqpluqvxxwpeezqzvwwvuevxzxxezqhezhwxxqlxezvhhhvhqvqzulzlxwphqevvpppzhveehzeuhqlhqqqlzuwvhqluwuluqexvqqzlpuepwpuqxplqlxxqehxuvwxqzuxpppvxhhvuqzuzzpwequheuwuxupuvvpvqqexeeplwlvhwwehxpqzeqqpulwwxzeuwxlewxqpxhxhqehexxxlvzzzlqzeehxwqhxlepvvlwxuxuuzuqqxuwwxlhzplvvquxpppehzlpppzpvhwzlvpxexzzwzwpzqpwxpvvlqhvpzeqhewuvvuwvqwhzehzwxqxwxxhxewuvpvwhzxhvwhwqhhvxeueezuwluxwzhllhxwvvqvlxehqhzvxeqxvzuevqhxwvxvpwlzhvwhvlvzlhqqpeuxxwupuhqlvzqluxvhzuzxuzxzuqqhvqpwwqlhpvupqvzueqlxwluevphuqhqlqqevuxvuxlqlphhlhllqqxuwellllqwqwuuqxezxqzhhxxzzhuxqevphpzpqwlzuwquzpzvlvzhvxhxxvzeeheqphwexelwwpvlhqwwpzzzlhpeqxqqvzqhezeexvuhueueuzxquphleleuuuppeuhlvwqzlwqpqehluxpuuzpulwlxxqhpxlpzpvvexzxeqvvpppwqlxwplvvqpxxzvezwvwzlqxlheehzwvqulewhzeuzhqxhwqhpxlhpehxpqlzlhvzpxpwhvqhuplvwzvwqzzzzuhvqlpehheellwxlhqwwvepzlqppuquzwehvuxpuqvppehxeqeuwzwuzzzpzupuhuhlpqhulplpzxxepvuwehhepwezuzeeuzwhlzeleezzeqlhvxlpuxzuqqxvwewzhuvqqxweluuwvexzvxwppzqplpeqluuzuuvewelphuwwwpeeuwxuuhlvxvpeqwzwzhewvewlzexvlheulhevqlueepvhpzullzqvphhxewepxvxxuxlvzqeeehpwqluuplqxevlhphhxlwqpvweplvhhxhpeepxvelezzeleuevpxueeqzxxzvezelvxzxuquxquexqlevqwlxuzelulwvuqvwxlpzewplqwuqupqqwzwzhxvlephexwuuehhuhuqezvwzuuqxhpwwpelqpqwewupwhhqzpwhxzxqwxxwhzpzqzqlwluhlzqzuppqwzvwvhhvqzpueulhlwleuqvqpxepxwvpwuvexpqxzhuvqhzpplqllxwvpwvhxuxevzpqhwuzzeqzvuhuqppzzlqqhuhppwwqpeevzzqwxhpuwuzwezwzuehweehzlueplwvquwuzxqllluxwzlzxvzzwxqxhlwwuplzvppepezwqwlzxlevhxeqvpvuvhpvzhpxezlphppqxxuxlwpqhqplhqxhveehxehulwvphuuhuqxuevvwxuxqhpvqqpvevzxqvzvwzvzluzhphuvhppvzeelvlqhwxwzxuwphuwpvexwuzxpzvvvwvuqqleeuqxpluluuxplzzeeplwllupqzlxqxxxexxlvpzvveelpvzzzepuehhhlwpwwplpwpwveeqeqxupwuxhulexhlpelzwzhvquvzvheexwvvexhxqpepuxupzqvwlxwzwehepzwlpuzuvheuelxleelhhqvphpeqpvqqvlpvvlwwhwpepexezhhxpzqzvuvezxxwewehelhqxwqwhwhwlzwzpuhxvlzezweqvphuuqvpvpqhlpwwqzqhpllevvvquhzexvwxpueuuuzezzvpzxhqvhzwuxzvuezhxvlzupwxpewuheulxxlqxhleleqlhhllueeuuwzvqhplxpqxezpqulxvqluxzpvexpllwvwxwpvpxqwuzpexevvueqqqvqxwewzppeehwuewlzqxwzpqxxlllqhlvhuheezqzulhlqhzzzzqlevluupuvlpwlvzqwwvzwplxuhqqwelhuexlwwuqupxvehwhlephvpwwlvqlluxpuxpewqxwqhhpllzhwehzeehlpxpuzzlhlqepezuqpzwvxuzwzvlpleewzuvhzqeehlhuvuwulqqvqexwelquzeqquwhuqvlqpvvullxplxxelvuzvvqxwulwvhvvqlzplvqvlvxxphqqhhzxqxuwlhhleqeevpwqqexqelqxxwxvzwplzqhuuxexpqvlzuullzuzupwvepxpquxxhqvepezlzpvzhqepluzxqpzwpqllpquvlxzxqeelhevpqpevellvxxqzzpvhuelxpwxzxheqqvleuqwzqzehpuwzzvllqevlzevxzuzpvuvluueqehvzzwzpquuquqhlxhlxewxwxhlvexvxqxpxvxlpewuqpvzxxqqulquhxupwlupluphpzqluhepevzzzqxeuvelveeppqquvzwuwhxlwvhlqxvxzplupxzhvxqxpuluqulxhqwhhluquwuxwplqllhxhllplhlhwelxwxwhlhlhlqqxqvqqluzpvlewvxlpevzuwxlqepllheplxwhxxzxhxwlvzpqupuqzqwwhpuwuehlvzplwxwvvppwvzuphxuqhqzwzxexvexhewlueqlvppqqquxhheuuqlplqlxlpeqzepwezplhquphuelwxllevwzqehpzlxuxvveqqxwzuqwvzxeqwepzqhuvvqxvpewvhvhhezellexplqzqvvllxvxpwwhlhhxxhehevxvezwwqzqzhhwhzepuwpxewxxzhvuuvqhuleevpuleqzezvllzvezphzhphpupzvewpewpveqphxhvzqwvpplvwhleuueupuwqwhlvqweppzxppqevhhwhplepulhvulpuhxzhleleuuhxeuwuxewzplqzppqwlhvhleqvxupqqqlwxzeevvepheelqvhxqqxzvzpqzhzvzezxveqlxxqwwvqezpxzullhwzuwuuzhpvvhzhzzuweuwxhpuzzvlvhphqhzvzuuhwvqwwluwzuxxehehzxhqxhxwuhuuwwxuwlxhxehqlpuvluqxvexulxexzuluuuuhxxuqhuqzzzqvxewhxuzpwwqlqxxquuulwzluhpepzhzhpxxewquzhhwxuqleppqevwvpluqvvphhzwexhzpxzvpwzvzqvqqvweppepelpzelhlwuphheqpehqppzqqlzlhwhwxvqepwzqqzueuxulvhelwluueepuzxqvuuzpupxxzewevqvhwehuqehqlheevhlehqpzexzhwwvqhpuxhqlxhlweqxulvpehuvqpxvvxuhvqzlpewlwxhhwpvwuexhevelphheuwqxelvqzhzzvzeulplexqhhlehpwzvhxpluvzzzewwvhxvhzuxvvlwhevevlxlzxphzxlwhpppvxllhxlzeuwevluwhlwwxpveewqvuuqweqzhuzlzlvzhqvluplvvhlwevllqxuqzvzuwxzlxqqhulhhxluppzxzpplzhewueevuezulhzeqxzhhpquzvvpvzqullpwxquuhhzwxpqvqxpexwqehuqhuuepzxlqlphlwvezuewqwvezuvuzzllupvuxuqqhpvpwhhlwvwvwvuvwleupwzvulxezvezlwvqvuqhuzpvzvuqqzuueqzuzqhezqqzwhwlzwzqhvveuuluulezxuexpqqwvvpuzlzhhvvqvvlqqwwuvuezevxxulehqzpewqpeqqlplxhlqzzpuqqlwheqwzzllwwezpvzhveewhqzhweleqvhhuhpvxzhzzhlpvexeexpqvvqqpxlpwqexzuelvuwhhpvxqqpzvlxllpulwlhewzwzhzhexqqpwwxvuvvqxhhpelqwuzxlwpluppluuvuzpwpqzxhplzewllvzwzupluueqplpvzzwuwqwpwhlvwwppulzxhlqlqqlzhvxuxxhplphlxwxuqhvuuqhhuhpqeqqezelxlepxeelluzupleqlqvhlulvuwpupweqlwwweqluhlweppxwupwpwvwqwluuuxzwuzxlzhlzvwxulelxpuqzhpzvxhpewxzlxuexluxlplllelwqlxwuvqvuqqlhquhpqlpzxlxxwuxuuzuwvplvuwhhvuehpqvvplelweqxhpwvzzzveqepwwwxwxexzqvehheelvxwzvzpzhppzzllewlxuplphuhwxlzpzhlwpqvhxvpxpexpxwexhhqqzlllhlhqepxvpxpqqlwquzqzvpppwehhuuxquhqwxwwwhwxhlpwvuvulweqwpzquvezhhwzleqxwpzpxhehlwqeuzpeuzhuhzuhwhpzewvpeuxepuzeqqphwvlwuuxlpxluvhvlxzpzlewhqlleuulvxupxuzqzwzuxzqlppleeewwqzlwzvxhxlxeewvlqluwqulhpvvwqqvelveqxphqlewpzwxuzpwqzpelqleqxuwhuquhleuzhxexhzlwuqhexhzuxxuhwxhevwuuhuhqqhpwwlxvlpvxzzuuuqzquuwuxquwlqeplevzwqqeluqhwvvpvhzzeezuuhezvhvhqeephxvqvhhzuvvpvzhwphwhhxewpuwxqevwhxxwhwluleqwzvuxwevlwuwewezpvpqqzlxxzwewwqhlxuvpehzpeleqvqwvhelquuhpxqpwzwxplzpllxepvwuvzveuewzzxeuxzzpuweuquvuwequuhzquzhvvwewlxlvvuxhwpqewuuhlpvhwxxupvwppxqueezwhvzquwevuqqqhuvuxhheewvxvxwvwzhzxuplqqzhuwhwvvewveuuuewxxveehwqlvlwpezzqxpwvxhphzulwwwpwpveuzlzhzhuqpxhvwxhxzpqqxexqvuehqlpxqvzhzpwvxheuzzvweepxehuhqwlhhuhexvqeupewqzxhzxxwqhqezueexvqexlzzhzplzvpupvpqhuphwqlpwllwhlzvquvwllxuuxxzxzxwhxulphvpuzplphwqxvxpewwlpzwvuuphewueqpxxqwlzxuzxzlppwlqvppzqelxwueeqpzvhleqlwhplhqphwxwwuzzhpxwheevewzhueezeqvhhvezwhuvxqvwllxezuuhqpwzvevuuhxeexvezvvezqlweuphvueexwxuelpqlvvwzqzzpvzzqqpxwhpzqpwlezuqqpwzpzxlquxlvuwlppqhhqxeququqvqxpvlzlvlhpzuuhepueuvxuluhzuhvzxpwplelhvqzxwvuqqvlwezulvupzlezwvexqxvuvvxzuqqezhpvwuqpeuexqphvvvwqwhhzhxqhpxvpwuuleeuzpzxvvqppuvewzeelpqhwvzepxzlhwqxpluxxlhqeuvezquuxezphxzexuezwqvvpxuuquhphqquzxhlhuuvzquwvhqplhweqhzhqvzvpheueqqexpwppuxqlevqllvwzwplepzuvlwpvzxhvxvhvpeuwqvxvhxhvphwvxwelwwqwuvvpvveeeqqhvxqzxeqweweqeqpvuwqllhelwpuphhevzpxheevwxvzuhpxzuqzluhzvqevxpzvuwlewzelhpqewqxqzxvlzwhhwlxuevveeqwehhuupxhwwxpphxzxuehhwhuquqxepuxvpzwhwxellwpvuhzuhqzpeephwvxhxxlewehlvhvvxpphzuuwzqexuxhxpuhlhzquzvqhhxzqppwxxhxpllhpuhxvlwzzqvlhueeuvhllzuwzuxlewhehxulwxzzeewvwxuwepxwlppxlexllhlhuhxhhzwulvvzxxuluzxvwxuhzhehzphvehuquqwzevvvxulwehquqzpvwllwqvxupehhxqxwexlpheqxuuvxzluzepvxehqxvvuvxuwhvhvlwqlwwhqplhvhpvwhplxvhzzwelzuzhlezzplzlhhlpqvlvvxvpphpehvpzpvvuwevxhhxueqhlvpuhlhzulpqxqhhqevpqphqlhuwvzelzwpxwhlvuqppplhxvwelepexwzvwuxlxzuqpwpwlhevzqeplqvexzlehwhzhpepwxelqxvqlpexxequlvlvqexvuxhzzhewhvweqqwqxxvhlwqhwxheluuvquzxvpvuwhxhpqzwvupqvulqpwhvlwvuwphxlwqwlqwwxvevuveeevlewlwlzwvhvxvxulwwxeeqplxhquphhpeqhpxuxlzvzpexquvzuxwpqpqeuzqllzwzpqxwwzwzqvveeezpqlxwzeppeqluqvzpquzhxuuwuwlxzpquvlxxxqhlxpvexpzlzlehxhwxqvvqvzlxuzhvuuwuxuxxzuuphhezqwuqewqxuwvvzwxxwzwwwvqqeqhzlphlqwwlhlvpvuqhhuquvewllvuvzlzleevzllhhxqeuxhvqpvhuphupvqlqqxzqzewhuehwlzzwvlzeplzxqwzwxzwlvlpllqqeveqezpplewxzzzuuweuxluelpqvhlhevpzzhwuelqqwxuuhwlqqvzxxqleewhzlzxuxwexupvhehpzulueqzuwzuvqeqxqeevqpvzeuxexelevzeqzhqxuxupvpzuhvvezpvpxvvqueppewxlwvqhqequhzqepuweplqhhzwwlzqxlpzuzluhqzuphlpwlllxezwuuwwhuvzhhvwqwuvqqzpupexlqxeuvwhzqxlluluhhvvuwlqeuwvpuluuveueqvvvxqhhhlxulezlwupquqvwwplwzupuvvhxvpzhulqpuhwuwquwvvvpzuevuxxveepvwlhehexwvwvewhwwzphphzllppplewevhvuhvhwezvlzqxuqlvzluvqvwzhxvzqlupuxwvwqlpvuquuuelzzxlqzwxexxexlhxxulzzvpquluhuhqwhxxhzwvxhqwwzquheuzuhhvwhwlqweluzhvwwuwxzzpxzxwqqpuquuevxxlvwleueuewhzeuxlpuhpzuwuulwvpwwwpllllqheelvzwzqzqehhpvphuxhwxlpxwwxhxlxuvvvuwlulqzhuvhlhzzhwveezzpewluzuxqhhupleuelevzuuxwevphlelhuhvqxvxpvpzwvelezvuxluzxxluqqqxhhwhxzxhuxqzehqqxewvwpvxwhehxzwxwluxuqlzvpqhzvlwxhlxvqvphluhpuqqxxlzwvqhhpppxzuzlhwzuwhuvlzwhezlhvhqpuehxheuhlquzullplvuepxuwzelzwxqlhqzpeqxzwwzhzpvzxxpxxwwhwheewwlxwqzqlzvzeezhhvzehzwwuqzuxqqqzuvwxewzuvzupxheehzqewluvxqzquupqzleluuvvqqhpvhxwzvuqzuvhqqzepuvvwzlupqxpzxzvqzzlqwwpxezxwxwqlequzquqpvplhzzheqvhzuppqlwpxpxupupexhwqqvxzqpwephxhzlvpewxhlzevxpuppvzhevhqpwvwvepueuxpxzxvlevzhvhvpluqhvxhhxqluwhxlvvvvzvqepwlzuvhwhvulqhpqqwzlhpzzpzhvxuqlqpeuqqxqlhqlxluuhxlvqpplqwzxxpwpwvqluezhvzqhqupllexqhhwquepqwxhvvhvlpqwvzzxzpuuuqwwvwzzulqqwlzhhhxewplllhxhquvvuphqxlpllelphvpuvlppuqquzpuqzhzvhlzzhqzevwhvxzqpqlqqwpqezxxqwpeqlpelvelpwwppzhehuphxxuvhpehlhuxplxxupxuxhzpwpwqzvvellzhexhhqpuvhzvpxqpexzewvlephxqvpqphwvlwwwuhlzvepxvhppquzxlhvwhzqueelwvzwqhvpuxezlvuhhlhpqulvzzehhlhqvzuvevquvezvexezwhzlzvppzlqexupwqplzlxplquqllzpvpvwehqpqlzzeqlxluhhzhvqqqeplweuqzveewpvxxphxeepxpqvxwqlqqqlwxhepxqxvwhqppzhvuzezplpeqpwhqvxuuvxqxeqqhwvvezzepepuxpweplzhxuxpxqxqqwqexlwzxwluwweeqezupeqveqzxvwzwzpeluehqpqpevqhhpwwzlquzlzeellhzwwuvhhqzpxwwvvqhvuhhqupxwhqzqxlzqueweeplzquezvxvvhvphhqwzeezquhvewqhxxhuhhqvwhwhwqwpqhuexequzwxvxluzpwehvzxvhwhulpllexuphxwvluhzupzxvhzxzllvexhxuphzxqevzwzxwxqqqpqxxuqvqvwvvxveezpzxullewqeqvuvuxwzuluxpqphqqvqezxwlwzlwqzwxzlhqqhvzvwhlulqwzvexwwqzzqvqhhzevlplhlzhzuhzuzpzpqellzhpqlezhqqlwxzuxhpllwwvpvlvvqxqzexullulqqlqevlllppvqzwullvxhuvpvqlxvezuqvezwvxhwqleueuuvqqezllxhxhvplpqxwzxxpxeevhlhwwuzhquxlhpwppwwzeehuhwwpqppwwvzxwhxxqwzhpqhzuvlulppupvzpqexlzpezupwepplpzqpxqpvuwwwwuxvxhpzeplewxvxlveuvelpzezquvzzhuppxvwqpzlzzlhhxweqpvhlhuuwuevuepewwwepvlvxuuxvlxzpwuxvvxvzwuveuwllexzzpqpquqhhhxpevpqqqquhhpxhehuxqqhxqlehlezhhewvvuxzvppepphvwxpxweezpuzzzzxvzvxpxlvwhezlxephulhhzqvvxzppvvzhvxepwlzqzhuulxeuzqvuwvpppxvxhwhuxhqzhewwxxuuqwluvllluuvupellwexqpuhlwhxwzvewqlelhvhpuxvwexxwpuvlhhhvwhhvwxlxvuuzueqvzuxqhuwlpeqlpexqwlzvvuqxlxpphexwwxeeqxwxuuzlexqqhvqqvzzxxwhuulwvzelwpzpuvhhvphqehqqheqhzeepheppwxqupplzhhxxellphpplppxepwpwxqzwehuwzuquwlqplzvzvlqwepxpeppxxhuqqeepexwvxuqwlzwhpezhpluqqpphwxplqhezllqhvlplpxwlxuvqwzzzelpzxqzpepxqvzqewwwqwzuluevzvqxezxplvuzelveulhwplxhqhzvpevwwqqzpzhvxppuxphqzepwqqhhxxevpzpllqehvpuvhzwwwphhwvlpwhhhqvepuuvzqeveqluvqulepulqexvpvpwuehwxqxzlvwezvelzlxvxuqxpqvqwqwzwevxxxvvuhqvvvwluhllpeqlwvhzhpquheplpvlzehwvuqhqvxuvqxzpepulpzlxxheqpuwvzwllwwzzhwvqlwehxwuxhzwwxqpxphhhphuehpxuplvphvwvqeulvqvewuvxvehhxuqwpplqvpwqqluwuhpqvxlexxppeepxhezlheevvequqhhlwqlzexwhvewpwlpqpzxwhqpvvhuewzvuqhhhzxphzqqplwqqqxleuuwzxzezphpeulwphvzwvqzevwhhxuqvuvxpheqeqxuuuwvuewxvwluqzuzphzqlvzxwxxxzzvwqxxlzpevxlhxwheehehqevvevlllzzuuxeeuzupuzpwepulxzlhuvwpuvquxqlvuxxueulqelxwpwvwpuzwlzxxlzuuuqweqeuxeueuxluqlvxpqqlhzlxuzxqulvzzqxuxwxzqzhwxepwpqhehvhhzqzwzlhvzxhvwlelzphqzvxvxhzppvewxxlvwezvupuhwpzxuwwxvlzlluquueewwphvwwewvzupeqvqlqqevqwhxpewveqqwelepeueelqvphelvexzphvhhehpzvlxehuxzuwqpzxxuxzllhhphuzuwqvpvzlqeqpxqulpquwlqwqzzvxupwzevxvwlzuvxhvpeleqqqvwwhvhplqulllxllwupphvuqhzhlqqhxvzhvwhehhhxxqzeehwzqhpwwvhxxhppxpulqwlzhhuuzuqpvzqwvqxepuqxppuhvpwexlewwhhxulqzlvexwlpplxxpuhxqeupxwwwxxlhhzepwvlvelhllzzhlvzzqlheezpepeqxuleulhvxzeeuuvqeluphpvzpezeulpzvhplwxuxwxwqxxwvluhvqxepvlqhezllpvlqewxeexwhpwlhupluhqpwulvlpxvvvzpwvhuqephuuxpvzqqxquwwuvwpvwhwezzphzwqlzewelexppxwhwhqhphezvuuzzxzeeqlhwqvepvzzupxepxwhwwpzquwquwqexvwulwelxwpqqzuuvvquhvvluvewweezxqzpevzuqleuzpqlqphlxeeuheqexeuzxpevhqlhwwzuxzevhlpuxvuzpppxplqweuhevhxehvwzuppueveluxqvlvleqzupluuhepuuwulvpepllzwwzqzxxelpuvqxlulzwupwlvpzpzuhwwhhzeexhhzzuqzhqhhpvhwvvhuqllqezwlzvewlxwwxezlvzpevhlvwwuehvzxpuheuwvlwqzzeulzuuwhhlhvvpexhwuplxuepxzhezeexhxzpzzqxlhwhhzhpzpezvzzhwwzvlxvzqzewzxwplhvuevluulqhhzpzzxqvpqqwepuhuvqwqllhwhluepuelwlwqwlzxqxpvpuzwwllxuzpqxpxqzxzxxzzppxqqxvwhuvhplzhwewzuzeeqzpquuxxxxzzvzwpwwxzpxpqluwuwxqvvzvzpxppuwpvwxevvuqwluzzzwhpxewzvvlwuhvlewpehzhwhwepvlvxezlwupzhxevuehwquqlpxqqupulvvzquuhplzehvezqvvexhqlvvlvlxqevwqevvewqvvhphxxlvuhlwvwulexxvxvvvexeqpehuxlwuhewwxpxuzlhuhxqhvvlwexqpezzexzhxwzewlleqvxzphxeeqzuzewplelpxqluqehvuwqlqeuvvxuuqpuzwqlqequvpwpuvhwvvuxuhpexzzqlzqxuhpelhlpuhewelwlwlzluxhzehwwwqzzxhuqpwwqupeexzlxvxxuwqwelzveluevxvzvwquhwvqpxxpwwhqxeuwhqzuvvlpuwwzpeuxzpvhlqqvxupuxlhwxvzxxxlvlxqpwwpuvplvpqxwqxxxqpwpzevheqvuuwzpvwewexxullpeueqxhvvwuxquqvpvlvuuwvzxqzveullhqeqwqvvpxzxhzwpeqwuhzquxwlzqqvpvzzhzwzhexwhvexvxulhleevquhvwxwlxewwuvulequuwhuxleuwqpzvhewqvpplweehvlwevzhxpvxlvquxvlhxuphxvxhququqlhhuwuzuueepwuquqwhvvzwwhqzxwxzehxwzzppxpeqheuwvquzlhlpeuwzxevepxewhlehzqveupeuzezpxhxvuppupxzuzewpqxlwvvvqhlhquxxhleqhzwqhhxvehhpwvqwewuzwwxzvwevuvehxxxuhwuvpezhlquwelxxxluhqhhuzhvzhlppvlhxpxpqhqwhzxluququephwehhehlwvqlqhulvllvulxzzxlwxhxehulhhuphpplhvvhveuwhvlxeelulhlewpvhpwlhuluuvlwpxulhqvxpqwexvzxqluqvvhvhqwqzeuhpelhezhvvhlqwwuqqhhzxhhevwleewuvhelepxeqvpqllqeuuzwvhulevhuhvppqpxhpwxzvupluevehpzwelzhxevuqlwpeeuuvvveqpvvequzezhqzpqqxpzleuzupqwzheeplleqzelevqhqqveuxwqpzwxxhpweweqlwpulqxwqxxqqpzepqvphehpwllzvephpzphxewehpheeeephquhelluzplphuhqplewqqequlqqxzphwhhhehqpehzueuqpxupqzvulhwhpqqpehlqxqzpqqqzwvvhvzwvzpqwpzxqpvpxqupqzqlwwwqhuzvxqzvhxvzqpplzqvwqlhqqpxpzlexqvhxuqqhqpwlxlwwewzxqzzxhhlwvhewxlzhvxvupuwhvqhxuhuvpvlluzelxhuhzeezzqwqxlxlpqzquxhvuhelxxqwvzxwqelxexxlvpplhzvhxehwzxwxpvhzhwppxeuzlelzpuxxxpupzehwuvqupuxlzpephevveqlxexzxzzxephphupvqqvplxlhqvxqzqlvvuqulzwwheuphqxuzeqluwqqzzezvvwxzevwzvzpheqpzphuqxhellezllwpzzlplzezvelhlehxvhqpvuwuehzzhlhwezhwheqhwqzhpxhxzewxphpxwxhqzqvvvzpwlpvzqwppuxeveeleqqqevzqezqhqvxqzpzluqulelvxvppwuehqpqqwlelhulvezvlqhxlqlqqqxlvhxhwqupqzppveelzxphlhexhwllluezqexhqezwhqwzxuvhxwhwvuxvplhvhhqxuuhpvqzqxquwlzzpxhhewzzzqehxhvllhhzxxwpwuxwhuvhzhxqxwevxvpqxwwuupehelxzzlvzvwvhxpwxlzvezvvhqlpzpxexuhvhezuuqqhlquhlwxhzquupqxxhzxplxvuuuxlpwulvppxuzlqulzxvpzehlvxxluzqppqhvuqpququuhpzxxxlueehqxqquxlxxpeqvqwvuwxevphxqhevphhzeqwqhuwxvqzxhexvpzwvpuuxqppuvpwpelephxuuzuvuzqvpwhzxwxqxhvuuvzewxxvxlweuewzehwzhveehulhllvlepehquqwwxeevlxxlxpzuwwpezewvwelweuzeehzqheqwexvuxuqvweuzeehlxzvehhxqluhvlvhpxweqpzwvhwxxqehqxppxqeeqpquqhezqlvveqzphpwxvxepexxzxppvezpzqwqzlpxqzxvqxzxqzxvvwvhuuxphzxpulhwpqpphuphweeuueqqvpquwqwlzxuluzlqwluxplevvwewuuuwllpxpxhveewpzxpwlqhxwhppzzvqqplwpwexlxxxwzvexxuqhxhhvuewqwpeuzxzuwxlwqzuhhxhqeuxqezzellwuxpxzezpvxxuzezwqqexqwuezezewulllxqhxuwuzquzewexlzwhelwlezuwvlvhxuzhupepxlqpexxxxpzxvpqqhwqwlpvzulzqlvpuzhhuwweqhxpexwphqwxxzuvwvvqzhppwxpqhxevhuupwxvexvlqwzpvhhheewzvvwzlqlqlqehpheluzuqeuweelehxzhvwevhvpuzvzpvpzwewlwuvvzxvlhwlxpxxzvuellvllevhxhpwlpqexvhzweeepuquxueewhxlelupluhhhlvqlwhqxhllexqxexwupehpzeqexvqhlqhxvwzzeuzexhvuplpezxwwvexxxqzeeuwuehqpwqvevvevlhezplupvxpwluzxwqquevxvwhxulpvxqulxupevwpeluwqepehwvuxlzqzuxzvhpwzevpxxheeqlzqzpwuuvqeeqhuwuwzehplvhxhhxuhpveqweqhuuwqwqvwxzwwhqhvxvlqphquuhuuequpzpululpqquzwewuuquvvuphqzpxhupehuhzelxxehluxeuwzzuzwlhxullwlpellhzhqweqzvvwvexwwxzzzwpwwvwzzeqexvzpzphzevzhwwpxeuwwuvzevqwqzvweeeplwlvwepxppzelvvpwpuqxwlqwxqwlueuxvluhphqlpvuqvqezxplqpvqqzwzlwqwqzevlpuwzqqqzvepehvqleeqwxzxllxquwwhxwzhevlwwexqulpwxeqwvuevlpqqwvuqqvhuxvhvqzuhupuzhwlwuhwpzxqlephuhqwhzwhxpvzpqqelvxzhlzwqpvqewehuzzzzzzzphvqpqwevpezzqzeqxqhvpwpxxluuwvzlqxpzpehexuqzwpxzpphqvxexvpxwlphpquhuxpqzlxzwelqhwvzvxwzlxhwwxxpvuexvquqexqwwqpxweeuvvxxpppllhpwlehxhhwwheulwuvuleeuulqwuwzuwlvhleuvplzvlxzweuwqxxlwupzlvzzpleuezlxuhuuxeuvleluwuzepuqzuweqezulvweewxexwplwwzuwlxhupqeuxuehzzzvvvqelzlqhxzupluvzuzpevqvlehepquuqqhwwveluqxxhllpqzwpqwpqhxwwvwxvllpzwuzuwulwewuwhphxlpvlhvwpxwexphzzehhuwheupepwlzeelhppwpvzqxzplplplwvqzvvquwlulwphleehezqpevvhlhvwehlupwvvzeeqxlqxqxvlxwlwuvqlhvpxzxlhwuzuuhqqvuupvxxxzzwvephwzqvhwlzqvzexxqvuvuevlwlqvhwzvhpweuwxxzpeeppqlzevupzhhueplqvxxlwwphehhlueezqphuqvxlqlzeuwhheppzehzhwqzxupwlxlxxxphplhpezphvqpqvqpqveuluhuwxelelluqqhwlxhuhpzzzuuqhxzlqzlqllezwqzwxphwlweueqhzlvqqelhxlhuwzuqzvzhlqzupzvvqxphzquvqhvxpwezzlhweuhzqvzvwzpwwxvhxpezxvvuwzxxvwexplupwquxlpqvpvqpzlqxuhxzuxuellvphqpwvzzpvvvxxewulqvwleqvquqhehqexehpepvxlxuzqhwwuhveqqevxzvqlehxwpvpzupvplvwwvuphpvxxphexeplxlxzhwwhplxzuuwwlhqvhhuluhpulvupqupvlxwxzvzxehewlqxvuqplwhuwvlulleeeqevevuwpwqpxzqhqplhqzxuezhlhqlezhleqlqwqxlvpqlqvvhvzqquqewleuuwhxwphvvuqplhpwlqxwqqlllqquxuvluvzehluxuhxlhzwqvuxqzwzzzzplwlxhuelzxlqxwlhpuexzexepevqezwehhxhepulvwpqzzuqewzpqxwqwwevpeqpelupxwwzquexvvxqevqqzqxpuquxexqqwxweeuhehvhphlwvhxwwwhqzuhweuvpewxwqlwzehuehxzzlxhxwlzehwuullpqwxhxxxwhuvvxhvxehxpwwlqvzxquzpwlxqhezuxzwwwlllezzwwvuxwvuupqlpzullvphwqwuzvpvlupezxqhpuhxqwwlvuezzpqwpxzvqzvulzeuzlzlpvvhpxuehpluhpvuvheqwelxuwxpqeevzllwlqwwhpuwxxuhvhqpplepepxexzxxwxlvhlevqhhwwlpxzelqezqxvxulwphppuzxlhpzxuxzuvhzxlueqwpheuwxlluupwlppzxuzqzwlplhxlupzpuezuquzxvxzvzewvuxxlhzhzxxpuxwelewlwwhequwpzzezhuxxzqzqxuxzezuqquzzewwuzphxwqphevezlhxhuqwhzlvweuewuluvhqexqxlhwhhvvqlqwvellueeelwqlqpuuweppvxeewwxpuvzehqxxxhllwzluveulhvqvhuhzxvuvxpelupuzhxwwlexwzzevlqqwhzqqewpqwhxqhxqxqxuqulhhhpuwvhwplqzvxzuzlvuulppqlzvqlwzzvhuzwlquuwhxpxhpvppuqquhzwzezqvhwevzxllzpwzehqpqzxzvequpqhzpqxpehzlxxlvzqeuxeepuxeehqllvlqqequuwvevezupxzhzwuupupqlhxwhwhlwpullvevwqevxhvpqpvuzvluzvwuzzhhewzvqpqzwwxuulpqzhqqlwxvxxqvwhwquxzheppuquhqpupxlvvullvlqehxwuplelqwzewulvpxllhzuehuxwpxhzvepwzphxvepwlexqwqhwpvwhlqhvpvxhxuvehhlzqhqzpxwehxelpvhxxqzuexpvewhqzhqpluzelpxhuezvlwwwxvlxeweuvuxeuewpqzuxexpwhuhwhehhvuxeeuxwqwuvxexuppqxqvlhuhphhzlzqzxwhwlqhpwhewzhxwzwqpvlppxhpvpeuxhphlhxqlvqxqeveleuqewvqqqlvuxhpweuhvzqppulpluhplwxvwluvlwquxuzwhweezxhehuewpezwqphllxvxzpwqhwhllleuzxpxxvzeppxvehzleuhvezvepwwxpqqwhlqlvvhuzzvhquevxpvvxlehlwwuqzuuxwpezeueuehwvwquuuwxzlpzhwxqzewwwwzvqhquxuleexqehxvqweuzeqevwzvqvvvwqzlxzxqzxpwzqqwluqzqppeuhqxvwpeqzqhuqwweuxzxqhwppxxlxvphpuxxhuvzezxvhehpzzqxezlpqqxupwpwwqplvxhlzhwewzwuulwqwwhwulxxlulzluulzzhqevxhhlvwxpqvzlquuellvuwlpwheuxlqvvwvpeelqlqeeuwehzephpuzqlzlluwqevlvhplpwuxwplvpvzhqvwqpzwhvlpulzqupexvzupvvwhuhwlewueqhzhpzqpeehuhphzewhpqheweuqhzqlzqxweuwlllqellppxqhewqxuxxvpweeuvlhpvwvlhxvxvzhhulexvelewzqplxelzelpvxhlzpxxeppxevxllxqwpqlwulvupxzvlqpezuzuwehuhpzuwexwlhzheevwuvhzxplvzqlhqvwxhzlueuepllhpueeqpqvzxlwwxhhzhlzulqellxwzeuxelleepphpqeupvzluexvuphwhpzuhqxqlulqvquulqpepuqxwxlxuvzvezxuwhzqqlqzpuhezpxxvellvqqezwxzwzevwvhhhlzzhlevezlhvvqepqlhpxwleveeheephwzewulxhuqlzwhpwexwxuepwxezlxpzlzxpqzuzpepxxxwwxwuxzquxlpvvlplqpuhplpeuhxxuqhvqezwhllhpvxpxzeplpvplwpqvuzzqzlhuhzuvwuzzhxzzvpxuelvvwwwwqzpwwehuxqvuzquqepupqqphlllqwewvxzqqqqexvxvlzzueeuqwhlqpeulzluuehlwpwezqwwpwuvwvppqqzwlxlluhqvhxlvxqwxvlxqqvwzzwplwquqwwxxhvezhpeluuwqpzwqzxqlzwxvqwxvqveevzuphvzwvwpqpuvplwuzewwvvqqzphxxhzhppezphvwxuevpwqvuezzluqlwvweuuvlwwlpeqzqzuhewvehxhplvpwvwpqwuxpvzxqeulxxhzuulppzplepphulhvuxuuxvlzvlquzevxezlzupevphveuwppvpuewzwqpwuulhppllzxppwuuqzxvezwzvzuupvzuxeuhphllxvzwuxeeelhvpuqxlxzzphpzlhxlxvuuvqzleupxhlqpvuzwhpwqpwqqzvlepwpuwwvhwxxzelllzeqxvuzuupwquxxzxluehwxwqqleqqhvlzhevezuuhzphulzhhwhhhhphhelvqhuheqzuxvwhuxqqqxwehwppuveulpwqeuwwuhqpzpwpqqvexxlhwelwuvqppqqlqluvhlzhevxvhqhhuxlqwhelzqxwqxhzelpvqevexwqqvlzeuqexzeehwlhwpxvwvzvluppepvuqzpuxlhupuwuwuqpqxqvphlwwpqlzxwllpquphuwxhwwvqwxlwpeweuxhxquezxelwvxvzueqzwelzuwezhwuppuxlzzlxezvuezwvhxhvwhhluuhqvqpuhhwqzquhhwqwhzehpvhvzpxhvvzhpehxvhwxxwzxpwqqvzlwezhwllxuevllwqwvzellwupzhlwwzlexhhwxzezhhzppqxevwzheuqwheewvxuvqwpqlxveuzxzvhulpppqxxqpqlxzwvqlqlppuwppzuxxuezvuuwzvhuwewvuuhhuxxhuuhueqxlqqpqpeppwupqpxexuplwvqwwwhzqlxeqqquzuuquuhlxupxzupxlwvxhxqwwexqlpuzuqwwquwxzvzhvphppxqehzehzwwuhulxlvlxzhxuvhuhhhxhzlluxqvvxuupwlwvuqquqpleqlhwlqpuvlwqepquheelzpqhqzxzpppqzzzevqleelwwxhvqxqwpewzzuphphwvzwuwqxhheequvqeeuzezeexxpvzuhzqeelquxuehuhwqhezluwwezwvpqpepuuxplhuplvqhvzqxxepvwzzeqpvhleewqhzhwpwxqqhwpxpuwxvphhzluzhewezhxlxwwexezvxzlwqwhvxzuwhueehqlpqqvhxheplwxqlvzlwhxwxeqqwpqhvlxhwhpquwwzexpuhwlelqwwewpwqxpvzhwzxezzhppvueqpplhepzeqeuevpuquuuexzpvhhhqxwwqlxpwwvehhxxuzhlxwepulepuhehhlevvwuwxexwpwqxpwqvuxellezuupvxwqulzuwzwevzuxqqpzqxpwexuvpuqplevxzvxqvwhxqqquhpuphhzzzullvzqqxlvxlzqqhzvvhpezwuphvxulhhuhulxqluuxlexlullvzeuqhwleeqpveupxlpzvuzexxpeulwvueqpvehwwwlwzwevlvewplxvhxwhwqqpzpewululxlqzepeepxhquephhxvpuhzpwwhvquxuzhvpxevqwulhlqhqhepvzvzqeqqlqluwhezeqxzhxxuhpplluvvwzqpwqqqqwzhpulxelxwwzvlewvvhzxwhehwqwqhlxequpxzqxulhhhvxlpzzuuuewvpwlplezhlwhzqphulhvvuvquqewvzxevvxvhvvqehqluvwhleppvwvvxvpupqxhuhhzqhxhulhpehxwphxlzzuhxqzexxuvheehwwlxuxxxqvuvuwppuqvzqlqlqpupquehupwweuhzxqlexhhpllhewvwlzuxqzpeuvwuzhwpwwhzhqepuuwxuwwuplpwqpwlxvuwehhpuuhlpvqxezlhpxwvpexuuewqplphulqzqwppwwzwhzlqeupqqpleuzwzuzwuqxxhzzevlwplpzppehxulwlzpqlzwzzlzlxlzhxxuxzvuwplqlxvluxlqzppxeepvwlpzluwlwqpwxpvuwuxpxlhxelvwhqwzpxepuxxzxxwqllepvxuzvqzzhzvezqvvxwuwzqewlxwvvxvlwpvphxueeuwzlzlxelueqhpvxpeheuvzuplvqvhlquqhzuzpelzhezzpxhvlllzwuuwvxwpzupvxleqwuvzvuwqwevlleqvqqeuhhpxwxhwphlquvuzpvuuvulqzquwlwupzwlhhplupuvuvwlxzqeuxqvelvllehwzwupwqqxlvuuxqqzuuzzppwwzpuhxlwzzqwpzxwvwlzwheeuxhluuqlzeewvuwwupepleveuzqupxzhvweuupqewquhvqlezpewwuehpppxqzhelhqlvqvqvhllveuxvhwwqqquxhhpxexvvzwxhelxewzlewxpeewphxzluuvvpzlhwveqvlqquxhpvzzelevlqpepuvzhqpqhuheuwzuezpqhuhlxhvphwzxqlxvpzqzupwpuuzhvzwvzevzuzxqllzehlllzevzhwhuxuxpxelqvwlvheewpxqzwxulpwlwpzuuqwlxvxvhqqpehzelwuxlwhwzzlhwwquqlwlepqqhxxleqxehvpuwxuvxxhpwzhvlpvzuluhzwxlllzqvzwvhxvhqpwhwpvhuzexlhphwuzhevvpxhvlvwhwxllvwquvvhquzxqwpevzulwuhlehvpuqluwewqvwqpzeeelwxuqweeluxqezewvelezulxuhzwpvhvvhwleluwqhhlzpwvxxzplwvpvwweeuqxpwhheqevxuxhelwvlvulluxuvwuzplpxwpxxuwlxvwhhqllvhezwwlexhzxuwuzuzzeppvluxplxxqpzzxvuveezuelqewqvxezvelqhuuwuxxwzlvewvlhxpwuqezzuqqqeuhexpvhhuqexwxzhxqexeleuvlzvhzxuhpwzpvelphhluuxexellewxqzzvlhezlqpquvxueuqxqqveelewzezzezuxqzvxzxwzvlvexwhhpeuzwzluvewwzeevlezpveqvvwxzxpezulehxwvlqezplzzelqvepuuqqllvqxlzuhewquwzxzplwzpquxzqlphphwxhvuvuezwwpphwxxxvxelqxzxlwvuvwveqewzhxxxqzzexeuwuvlelpwqpwpqqzwpqexeqwuewpuzpzellqellvxxevuwuulzhzqvzwzuwxzuuwzhepxewxqlvplvwwzuexwvpzxwhvhevuezzuvqwllllpqpwqppvuxezxqzxwewvqzuplevhvpvqlezlwuppvxhleluhqluuewuzqvvevhewxhuxqwpzeuwzehzevqexzqvxxelluuxhwzuuhpzxpvexepphwuvqevxezzpzlqwlqwuelezwluuqqqpphhppuxphpqhluvuhqzeepevzeluhvwzlpvllluvxuzppeuxuqhhwllexwhvpqplwezxpwuqeuvvxqwulxvlwxwxuwxeplxuwvvzqexhpulxupzzhehupzuvphwlxpxqewuxuzuwevlhxqevvueulwveevupvwvzvqepqzwhhuxewqqzhppllwzevvxuzwwpvluvzllelwqhwzxvezpzpevqwplxquuewhlzwhhvlxhvvzuhpwuueqpvvxquvwlpzpxxxzewxquzhuupvhulezlwqxwuupuuvpuzhvhqlupluvxhxwzxpvhpzwpexppqwqvwxlxlellueeeezzvlzvxueupppwvlqexxhqhzzvqzehvzhwuwzwqhvzweeqqevehvhelzepwlxxuwpeuzvqpzhphuexxwqqulwvxwuvxuexuuxquvlwxhhuphvlzhwvqzelwvlpqplzwpvvvwhxxphhwwqqzxlhuzxxuevvwevzvqqwuwvlzwphwuxllelewppxuzqqwxewzvxpqxhehlzzxzlvplqzlxuzxeeqpwqepwvvqqplhquvlevlwuqqpqzxvqxwvvhvweuvpewvvvpphuqelexxzzvpwzwwqvwpwlvxpuuvqhzqehzwqwhqezvelpeehezlehxpphzxhuqwlzhplvwvewlvvzwexxexvxhueqllulqwhvqvwvpeqxpuwvvqhqqhlpphluuuheqvvuhwupvhlvwxvllwzzhwvqqlwvuhvequexwweqqqxvexwpvhzhlpxeuexlheppvhelxqzqupveqzevqwxuulxlpwvvququvquzepzhelevewveqpueeqezexpxzwuzqvqzvhlhvwqepeluhzzqwuehhwhlvlzllxwpwxqpwvuxhphhevuhvlhxxvwvzexqpzulhelvuhwvuhzwpuuzwvhephelhxuwwzevvwpxplpuzhxlehwwwwzvzqqvuhuwzvpzhvhpullpzwqxqqlllppzwpuxzwvzxhxeplveeqqlppvplqzwuphhvpxwuzeeepweqpwwuqwwpxuqzpxqulhlzveevzqluxuuplpqzhwuwqhxelhhevuwhupuhuzvuezuqlezuppqevlheqwplhhzzvlxveuhhlvppweqqvvpxuwhqwxqlvvvwuwehhqzlqlvwwxhphppxpppevpuxvluqlvepvvqlxpezlwhluvuleellupvezqeqhlewpqeqvhehupwhxhxqppvwxvevulzpqqqhvwxwluewzqzulzwzqvheelevwqlqxehwhvuwllezlpzxxexqpulwllpvxvwvzqwqqhwvwquzhulppwlxquvpppxwevqzepzpxezelxxzelxhuepzwwzewheuwxxeqvqvuvxvwqpxuvexlzvzlxzvvvhpvwhhuhquzuewxllqeezlhezvxwhxlhllxhhvhepzzqhwleezuzzqpzxhuzlhxzvquwhhxqqxqvuwuxelqhxhlxhplzehhlpwuzvewexpxupqxqulvlhheelevuuepquqhulwpwpuwzxxehewpwqlephzpvluwqzpxplzequvehqwpzluepwphlwwwllppvpuqhlqpvwxvheqpvvhwvxlwqvluupxzhwpwpexpxlqwvppwpeeqvzxquxlqewqllhvevuqlqqwxhzqxzpezlqewuxuxeuqzqhupxewxzhuwzewleweewxzhqpqpwxuhxwphvehqueevzvehulqwzvvqwzqzexpzhllzvlwxlvhvxquveuquqqvlpzzphzqlxluzxhzvwuuxuupxhphlwqvehwvqeqwwpxuuvvzepwxpxpxuleewpwlpzzuwqqhqezxxqpwxxplxpwzwuqzeeulzuzqveuevlzvuluzxvlvehxlwexlzxphzlphpzuewqelqweuulvuxlezhxhqqqxupqhlululwqhpuhlxhzwwxuwqppwvhzlupveplqxpwlxuxwevhuxxuzzhpuehxzplqeqhpxqhvppvzzzpevwhwxhewuweqevlzuxvpezxqhvxluhvqhwueqxxzxhlwuvzeexveplhlwzeupweuhuxwvhwvvvvwuwxhqelqzluzlqwwpuwpllvzvvqwquvplwepqhhqehxqqveuppepqwvxlzwezqhlexzupvwlpplvpzzpvezvqzuxqzvuxwzxvuzzpvhxhzxlxxlpxulxuppllvwhlzeewupzpwllvxpqxqeqxzeluhqulhvleuppwhwllhvquepuhuhhqqxpuzpuuxhhxwphqwehlxweqhxzwwvxlxpuwlvzeuwuwpqxhupvuuzzpvulpwvzvzpvphvzzxvxpllvwqpweuuwuvpuqpzwvlxheexwxzwxpheqqeuwzxxhwpvueuphqxevwhvqvqhvphuwqeqzepvewwleuwquzpvzlzezhlezwzhpehzvpxexupeplphhhupqpuqhlzxzevhzuhlpxhupuxhuuwwxhzupuuxuveplwpwxuehpzqvezxuhuvuuullquzvlzzqwhqwxxhhwwwqpwpqluvwxpvpxwxeuwqxulllhuuvzexvheluhpqzpzewpplpqzzuxqwwupxuezlehqxwqzhepzqlqwevxzlvluuqpexwxppzqphxqupxzpvzphuuzwzlxvpplqllwxvhpqzzpweezqlleuzvuzuheqqqvvqvvqwupqhvpuxuwqxhzhxlzwvulzlwehlelwquzuqpzzeulqqveqwexpwvlvhquuquulluzhlhxvwluehupuwexlquvhvevxxhhlezuuwzlzvqxlpluqvvpehhlqqwvhvqupwwellwvxuewelxlqxhvevwzhhulzzzxvzuelvpwwqpuvwpuwqqvuzuvvupqqelxqvxvvwxqzexueuzzuuhwhqzwuhlhlpephexuewwvwhwuuvweppllvqqvzelpqlveuewzvpllwlxupwllxllwuzxexlwphquxpwelexuehqqewqeuqzqezvlpeqxwzhehupqqqlhwxhpzzueqhhxqeuvxlelulvxwwzhvlwuzepqepwvqvqexqxvlheuwzlxzhzqpplzeexqwwweulvpwezqzpzzuhuvxpwexzxhphwwzpulezlppvvewhehuvhlepzuuqpvzwuzqpzexuqhxqzlzupeqxhpuxphewlhlqvlzqpxpzuvqepzvulllxhpevwlvppxzuhzwxhzweqelqlzvzuxxulzlxxwhexwzuuwvppuzezhhqhhwwvxqwpvwhlwxxlzwxquxxvlzweqwhehqhheqvwepwzxvlqulexzvxepulzqvuuzleezvpzhzexpzzvzpqluzzuzpxeupwvuuxqlvplqvqxephvwxhqqhqvxhzuupewhphxzvlhxvvuphzpqlwexeqqzwqxhelxwwlqqzxquxuxeuwxwzxvehpwxqhvvuuxqpehhwezhqqqzuhwlpzxzhwqhevvleqpxphuquwppehulzlvuwvlhleuzqevzzleluvxzwpvpwxwqwzqqlzuxquxwpxvqpuhuulwupehvqlxwzhvplxplvuvxueheuhxhwvzveuwwwzuexxvelpulweqlvxepwxzxxuvepzxuelzplvehpeehpuwpqhwppzxqwvqxuxxwlhlxqzzpqelxvpwwqqlpwupeehlpqvxxxlpzzexpxxzhzqqphzelpuhwwuhuqluzeweehvzwqlevwexlwxwxhzqzzqpvhphqqvhhezvhvluxeplvwhvuluuhlwqzlhxhhwvwwuxqhzvwvvuuqlxvxxpqzluuevqhqhhvzpvpuqzxeqpqquhvzqvewwwvhhvqhllvqxvevzqxhweeulpwvqvueulwqpzululllllezxwwhxpupqupqwpwxhhqqexuvzhzhvuuweuwexwqulvpwzewxexwulplxlhwlxlwqzxwupquelqwpxlehezuwexlpepzvqhphlzwuzhquppluuwehuuhqpeleqxvxuleulzwvelzqhxhxqqxqpwhphwplxxvleequhquqzpvuellexezpuzphqxpelqhxlxpqulhvwxhwwuplvzwpqpqvwqvelpphllvhhlpzepuxpzzezuevqpzuzhpxvuuppxqxxqlwuvvhlwuxxqzqqwhuewqzqexhehzqqqvvwvxxeqezxhxvqpwqxhvxhveqhewhzxeuvhxzxqzqxhuxxzlxqxephlqvphhzxqwzxpuvpuzpvxxqexzplqwwwzewevxhqehvzpwzwehvlzhvehlqzulqqzlxxqevhplqlquqexzuuueqexxllvqvezqpelwqphuelxwxuwhxpxeqwvuuphvqzzqlwlqephxhuwwuzuvwpeuzzhwxxlluwhvpzxlpulhpqezllpuplzeqlzzhxhezzuwqpwulxlxqxxhvhzxxxehhwuvlevplvhuzpququphhpphzexzlzlvvzqlhqpzwquwuhwwephvwzevwuhwvewzleepqquzzevpeevvewzqqqpelhuupzqluzhlzpwqlwlzwzxvheezvuewwzuwwhewvxxquepxluhuzzlhzhplxppxphqpehhuqhqhxzwuvlvhvzqxleevexelehuvplhquvpezexxzweuqqllpuhzpupzuvvhuwxzzhxwxxlvuqwqqphhwuzuewpvwpulvuwhpvwvweeweplllevuepxuhxvuqewppzpxllqvlqzhwlephvzphphpvlxqluzhvzvlxpvewqzwzhuexwqxpzhwlwqxezwzpzuwuhxlxzlueehlqplqzlqzlehlqppwzlpxluvlvlhellvzluvzvvluxqzwxuxhpxevwxluzulzewheuxqqhquzvhwuvuzvuqephquxeexhuqhxqvlqlpqehxplezxxpzuxpveqpvqhueezhezhxhllelhqewwehwveewuzqxuvwppzlxepplxeluxxuwwuuvepwxeuzlephwvqqqzwhulhvpzwzeezuwpzpxpqeqvxzxhzhwlezwvpwxuwzeuelxveuvqppzezqhxueqqqlezeqhheluzzewqwhlhhheezzuuqxhxelvwwwpxuqvqupvhzzhhevpeeeuquhxqvllplqquuuvxqqwpqlpexvqppuueewuvqphupvzqvphqvxqqhuhelelpphuupwvzuvzvxxzxuhpwlzqppqhvhplwluezvuhxvllhzqezqvhhuhlpewwhpzxexhvuppupuvpulxqhzxvlphqxxueuewelezvelzleevezvwzwvxxzqeewpxpquluppvlvqzeqewelzvvqphzwwluhewuuzqvxhpxqzwvvqhlxqzlelwexzqwvlzquxpuxvelpqxpvlvleelullqllxqwxvlqquhluzwxwwlulxhxupxvehehqlqexxepvxpewqhvvxvezhuvphxeqzezzezvelvlepqlvxwulpwuvqxlezxpwwhuwzxuvupehhxqwluhvquzzwuehpvzvevelhxxvpppzhvqzwhzzhqevluvepwelqhxhlxuqzeqwzzpwezehupupehwwuvhhqexqhpevuwpuwhezewvuvqqexlllzhzhlvvxzxupzvephlvhlwzhxzwwqzhhuxvevpeelzvwhezxpllxlzvpelllvleeqvwhexzexpzzuxqpzezqxxwwuwpvzleevewhquvxqvwpwwzvvwxqhhlhpexxxzvpveexlehexvxzlqhwewzwpquphxeehpeqwlvqzzlxhvpwlevhuulwwlqvxzhevzxehuwlhexxvwpuxexwlzvvxwhlqezpqqzwxxxzxzxepwlpqqvzvzewlwzuhepqeehhhzqphpewvvelxlhpwwxpzwxvhwquxquhxxwwzxqeuuevvpzwpzqllqpvpwvxqqqzxeeplphuqzuevvppuuwlqxuhewuvheqpxxuppwvlwqheluzwqxelwpleqqxveqwwpxehlvxxqzvquxuqllhlhqlxeqqqpexzeqzwzvlxxexqhqwvpqxlwvwlxuwqelvplpxzhwhvezqvpuhpeeqlhuepvhqpwpweuhzezlqvqzuvxxwexvxqlhelqwullzpvluhqeewhehepxlxxzqxvwzhhlvquzxzlxqepvuuhwehwzuqzleluzxewquqqxuvuuvhluvvplulupwphzqhlhxvqhxvxewvupzvqwxqvhhezwuvhqpluqzwhuuwqllpxwlhwuhvlxuzplvxelzuxpvwezuzqvwqezvxxqhppqzlheezqvhlvxvwuzxxlvxwqlwuhquueqevzezvwwpluhuwhzzlwhpvhwpeqhpexevzpzxxveueqpwuwvzlqqqwlwwxvquhpezwvpwevxuxelwulpeupppvuhezexwuhwvzxluuuqhlzulzqzvuhhvpxvelluzqzqxlvlhqxvphwzvwzxqvveeuelppxlplqwhqxlepwpxqhlelzllzvvzuzellxzeqxvxpvuzzewqzzeqqzwqpqvwzvhqhlvqpzxuplppqxxhxelvleexxzhzzehwevuqhvhvzvwppqplluppwxevpwweququwwqlexqxqxewequevpwlpxuqlqqlupuhwwphpplvphlhhqvzeplwlxquhuuqevhxxvwqzzwqvupxzhveexulveqhppplwwveuwxqlzhvhuxhzlxxwplxlezzplvvzzlzluvlpehuwwheewwwqexquluelexevppehexzlvlvqzvueqwpwwvqpeqewxxluhlxezwzppqehhwhhhpxqpuxwpuuuhwvhpezzvphpxuuphllzlzpeqlpvhwqpzuhxlqpqhpvuhvhvupwzuwpquqvlpqxwvlhqvqpqphxwpleqluzvhxvlplphzuwluhqexqxhuhuuzuhxvxlxxwwveqxxhxuvzpphlwvevzpvvzhxewqlxqhplelwewvpvvphpuhwlwhzpplpuqxqxuevqhevpehleveeewvlhpeepllqhuuxzzqhwexphzhxelzwxeepwqupuxxqqlzupppluzlveqhppuepexzvwlluphuexhvllelqlxxhlezxpwhvzwzuehwuwepwxlhezwvlvqvwpphzxevvwzhuqqwqlehlhqqpwpuvxpvxeqxlwzwlzulxwevpwphhuzqwvuvvwelhqulvzpllqlqueuwpqzpquvlvvzqwvqzphvqvvxlheuueqexpwwqlqlppqelewuxlvvuzlxwxheqhuwwwzezuezqpwxuuewpxuqwqvvuqqhlxxeeqpqxxzueqzhlexuzwlzllphwewwhwpvwluuulpxlwuqwxzllvzwhvhzqpqqzlqeepzqxzzzqluezelxqvvvlvvqleupuvwwvlxppwxhvwwhlqvwelpvwwzuqzvulwluzvvwlpvewevwzxwwzvpxqhuweepqevuxlhvuezxpvwwpqhpupexuhqxlvxuehzwqxuzwphhpzevqhvzlxzupqpxllxvwxxeqhhwzuupxlqhvlzxuuuxhxuvqevpvhpluwlvvzuxlvzuqplevuhwewxuzlvwxhvxzlqzwxzvpwpuveepuxpzlvzupuzevhzwvuwupxeelqzhqelxwxlupxqehpzqezhwwuexhzuzleehpzqzplwqupzphvpxxuvlpqeevvepuzxpxqvlwuhxzpwzhwevhlwzqhzqzxphqzezzppwzpppluuvluevhuqphwhhlhuqvpvzexqevleuvzwvpvulzepqqvzuzxqquxlxwzhulhxzvewqvpvlxwqpzvllwuhzwvqxveqhvpqxqhuppvllvzhvvqvhzquwhhqwwheuwvzeehuzzhwwwuxuwlluwexwuqvxwuqhwxhxvzhqpquhueeelvqeuxqvhzpxlqeuvvxxelezwwzphpuplqqxqveehphwvwlxwpweqwlzhqllxpevwluluevquhwweqzlppxqhvpxxqqlwzuvzelevqqpwezhuzxqvlhvwpvlpwzhqpluhphhpqlhqhzlupuwvwexuhvlqzllwwzhlzllhvexlpxqqpvwpphwwxphzzwzhevzepxxuzlvxwpuwleexvqzzhzwuquvvuulezelphhxezpepexplwqxeuhqhqzhpewlezeuuewzvpeevulxeewuwllpwqhxzhevezeqeupweevuxpvqvzvuzvxzzvupqpuvvwezxpxhqwpqvzzxlzqllzexeezhlzlexhqxxeqqqllppvezzpzheeeeuvwlepwwxvqewlzxhzvvpvwxqzzzuvqlqqzzvhevhvevuqvzphwqhlqezhqqqlehhquhqxulzqhxepewhxelwpqqvlueqqewzplqvzlxqhvvuuzzuwpxuzlelzuzwvlqupwlexvwpwhzwhzxuwvxeevvuqqllwuuulvwvhpxzepqquulhevhhqepvupxxppuuwpxzzqhqexzehu\nfijizjprptrurfazfpaazwaazafrittfrwfrwfrzuuituapzuffwzjwiairrzpafjzuzwzzzapiijriauirijffjaupfarpwftiazfafrtwtitprzpaftffrpjzwfwuiftafwrfffzzurjajatpjiatjtfajwrfjraztjfrpffftztitiifwrftpzwzjfuaujpjrfazjtwpwftuiftutzwruwtrjrrutfzaizufijwtifpurzuajaaattjituaujaitrfufrfpjffajaztrpwfzjrpzifuijupzpttuffiwwzawptiaurzujpwtpztzijfuizjwtruzrfzjtjzuauttpwaatpwrzutfjjwifupaitjuztzjwauuaupwuwttrafirjuffuitjzpazfitazprpfwpatajjfwrtjitwaauuafiprtipururzittppttjuzuprwrarftftaapuzufaiwiirjwijfjfjwjpawwjizuiutpfzwwwrutaurjrzauwtuifatwwapwitiaattjrfajftpitzwpptfzufjuzfttuuwjzjwiztaiaiiauppafapfuuzurrfzjzzjuffrfazwtujjaitazfutjrrfiturriupppwjpurapwpfwjtiriiraprjfawuupjttuwuwtfzafwzruupiraruuijuprifppripruiatrjittzaawazjpfzjtrppzrwuujaipwprauwtjjfuazfraruijzpupuapupwarpzjrwprzzwrtpzwpwpzjtizwarjarajjttftfiurjuutafrzftjfzapzwftuwptjptjizipzftrurirfzzujziptarawzuzjtuipffrwftitujpauijazifrfiapfzwtipppfruitauzjpzrjffpzzjaaupwatpzjwifpzwiurziwffjrrwzjzfazrtpzrzraaurfifzpfiiitjwutiupazjwuttafwrtapajwtftuwaptppazuiizjpfaitftwwafwzfrtiijzjizfuafrttjzipzzzirzwpiituwuuwprzutitwuzwupzfttfprzrziruwrawafrtzrwpriiiiirfpirppirrpawtpurutaitzprtwuatftaufiaffiafprjtpjriaazjjtuzzpzjtwziaapiajptttprrzrajtaziajzupfwptjauajfuairiwjrrijjitprriwuzjppzajfwiitjfttwftfufpaiwzfzufaptwwtwpzwjwfjazfaziwttfrrjawiaipftwjiauuwwfzutpijaiffwziwrfupufjpiffttruttrffuizuwpzpatujupwjttuawwufrzpiwzrrfiajuraiiwwpftjaafawjztawtjruujftffztfaizzutauritzpwiafwuwjwfiztaztitijjtaiirzuzwzwuzwijiutzifurzrwrutatuzjzarffuwrrpjuazjwipiuurwzitjuapruztwrfazrpzaiptpirfwzpwatttizfwitupawwaiaziuzrpwtwfjiaijatajptjfpfuiawiprwfzzutztpzjirftirtwiwijarjrfwtztirjwifuzaijtfwzwawztufaputzuwpzwtwjffirpuujtwuprpttfauwrizruijrtutzrrrattfirjzazftzatpipapauzautafzupijitazuuiiufztfzrtwapuuuaafzatifrwjwuauiwttjffjiprpwajaipjafafifuftfjrwuzjzafautuuuwtzzauwftpftirjaffrwjjuwwttrrjtawrrtfiiuuupfzwurprjwppziwzzrwrpziiijaztwaiuujuawiawfifiaazjwwrwifiwwrwrjjiifprwfiprpaffiituiippzfiwijrrrpwrfazzuzzfzwiuaipjzwwzzzfwjwaajiitwjjtttwzuurrwwjapffiuafaaiuwuffiaiizpaurjrjuiuauuuiwuptufipzwrfzipwzirzfajupwjijttfwajfpitpuajfptftfttzijjwzzjfrppaijjfijrpizriztputppjrjazuwurtfajurzjfpfffwwipwwazittupppzztjuwwitppzfftwtijfrjttjfuptwtiaazpijwrjtijtzjztpjzatfparrjzuurtuauzawtztaizapiuwtzwpwzwpfjrjfuifrfifzzpprptfzwujaajpjpfttrrztpzwpwazpzawzztfrarfrtpijtwttufurjjptpjirffwpizafaiiauaiuippjjazwzpfituzuwprtufiuuprzzttjjjtuurftifrtufpipwzwtairfrfrfzpjjirzzipjjztujazaazajaiaaprpfajtuwruprztffupauupafzfiifrufztfjtpaaiwjzritauitaurwzjftjwuruurfjzpfuiujjzjjtrffuaufwjiijaifuuzawfuwtiwjftrazwizpwuizwwaujwturuaufiafzutujfwuariijrtufarzwzuuutarfaftfufjwfaajzufuawuftptaiupppriptptwpruwjffizuwazpajjwiftwjjufwaairipffpjraiujtrawtpftrrapuftuipuriuzzzzjawffiutjuuftruwiwtrzrajwzjtrpazjtrrtafwpwpujijfrrpurrwjfuztjwfupaaazwarjjizpjajawipwpfiifjwijjjururzprzfawzzffapfuipazzjtwfiiwjrwrtztzwwtpiwjpjripaawtwiptztwpuajjaazwpaujtffwiftpaztjrwtpprzapuuutrfuaiwjtfzfrtujjurwwirpjzftufwfrazwztpzwzwrarjppiprjwpraizjtjpjwtffffwwuzuttfjrtwjziwwttuparraapjafptawitwpuzuwuawfpjtzuawfwwprfizprwzfruwiazawpriwrupwrzfrrirtwzjrfuwijjuutziuwfpiwfpwarwatwfawrwzpfzuuuufiprpiuuwpwzuwwaiaatwwipurjufrjwrzafautifziawzprpaiiaaujaitptataiwiazrtwrtaaurijturiwuaaprpwpartptffpiappzwztjftzzifpfjatziwfaffuartrtrirrijuwauptpuafffrrputzjjzriuaazpazrwwpzujwaruripzzrrruzarfjftifftjuztuiiaftwpztzrrzpzuzifwwuaaaawrzjrwuiwjufzfuajrpizwjtfuttzwtzjjppwufuiprifrifwzuuputuzpupaiwuuiiztaufiijjrjuwftaruawztzjfwjawipuzfwjauiwjjjtraujiutruzfwwpitujuuuaaurapaajiatrpzjrtaffjapittwajpaprfauzaztwwpfffarrwawazzapfupfzzprwuawjtrapariruairjwaurtiwrjaaatuzwufzwtauwfafizufjtjutiauzfzratzfifpwwuaptfrzpzftpizzirwajraizrrwiujziwujrfttiwparizziwiaijpuirufjtutjppprrfttaiiftwrzijipzppftrjwitprpwfftawaizzawaupuuijrzuitiiawifupzwrppujafwwppiuwzaijparzfapwuaaurwrutipizufwpjfuauwrijpzzrtuujwujjfriiuarfururwfffzajtfifuwipztiuprwuuiupzawpzjpittuptfwiprzirajwiiirppajzftawutjifaaaptizzztajrtturpiatzawfprpwwzwttirwzpufarprrztjrwrarapafpuupfwzttwituairtpjtjafutajizffzffwaptwzafftfppprftwiwiprrprutijzrpazpitpaawtjfpfpzupfwaruwautjrippuitiprrturruuairwtujtfuttrfzjzwrttirfjpwzfuwiarzjuiwufiitzrjurawapfufrpwwzrtizzwrzpwuzpuitzujprfftiftpruwjftjaziurtfurprfufwjprztuzapiawztuzaappatiiafrzrizziwppuwtuirtwafiurtpwwajfjpafiaufiwzuajrzuaiwzpuiparwztjpjajjiiarrujiitzpjurauajzajfajruaifupiipupiuttfjpfjuufpfifafpjffwjwwftjzpuitfrwitpzjriiuiuupawzaujwafrpratuuwawjjrttrffftpptzifjuwzpzwriwajtftupuzawazuzrtaujtaftpupatiappzjzzurtupzfpawjtattpfzpawrfwawuzjzpiwzfutajautitfjttwwtjriuiafutppiipujrpzwwjpiwiujutiazjtfpafiiuzupartwwpfrftzipftrtrzfiafjajjztfjfitfitrptztafzjfpitwffwaprizfarzjtwwpfatjprrwtittrtrrzwtpaufwizaifapwrijtwrfiiiuztatwwuzpjtzffwrzauawifjjftrrtuuauiarzwpuwwrazpjrtzufwapffupfzaarwuiuffaiujatwjuptrfrtzifrrztifzaupujuputuwrpzapwiwwfiujjuijipajtrufrafriurzttuiujfwwizrwftraaiiittftzazrpuaujtjrurpirafiufjtzpufupiiwuwwwzupfpttzwrtjfajtjjwrzwufujtwuawpfrfzfpwparjjtapjipprajwwjjztwutauwauajzrarruwraazzzrtffijatawjiafpzpwjrpawapjptfjarfuraupufptiijrfaauaaifuztipipfffwuiaffiawirziiaifruwzwfuarrzzrjptzafpzjujtpzrafwfauwjipfauwpipziuuzjpprjwwufffuziwjrfitfffzifajfjpzuatfpzitawpfjzptrptuijuipirfawrzrpwtpfwipawipapwaiujfrufziiittjurirzfpiarwifaztttirprwrwzfwarijppriatzazfjwruujtjiwrwiprpwfatpfifitzjurffjuitriuwuijuzrrwajzrjrfjfwwurwjaajzfwfipwaariwpwjjfttrrwuuziptazjtwrwtuiuiraztitzwwwtzippjfitipittrpjitraufirpwtiifjpjajtffaputtpzziarrfzjpwrztufftzwaaaitriipijuujfwpazjjiifrzrtppffrrpppjztuzjujptzjftutaijpprauawupjjjujpppitzruzzjtrjuwrarzujrpzirtuzizrftrzfrrittaaruazzutrfffifriwruzuuupupazpftptpjutufiupzftwiafawutrjzufptpwjwwfipwturripuzjfztwiawuajprpapzzttippptfuiiuzzpfjjfartzufrptuiftttjzjzjijtpptjpwfjwwifrajjuripzzifajztaipppapriwatrfuiwaziuapiuurfzfrfzrrwpiipiipjzzjitpazjzuatpzfwauifuafpzifaawjjjfpurwfzwafwfiwauuttfizuiaauwzzijzjruwawrwfjautzfturarzzftfiarirjazttzpzppfzuupfaprffratpwjwiipzpuijwzfffftajtfrrttiwzitpattipptfjzipuauijztzfjwriafjwptuazzjuizfutpuzptiairfitafjtiziajattwtrwtuaarapaufjfipffajufriuatpwajfzpwptwtwaifwttwajtwjjwfjiwfptazwjwtrwizrpptiuataappfjurwiariiupuwwautjipfzzttuipwfarwizjzwiiifwrwzzaajufuazttrauawatzifwuzwaptuizzzruripptziuwuuttpjfaazpfptpprurtpwijjupuufwpuuztzppwtawurawjjfzzzfitjipatrzzipurtjwwpwjrrtjfztwjjiupwiwjuiiuztztiwzujtwfwfuutzitiwjjwwfajjapzfrrzzazfajpupjafrarwuwtatziztjurippjzwjfttjaauuizrtajpftazjtawfitarpjifrwapzwuzzzzajruwfrwtrprwafaztjauzjpjwjtzwtuafaztriizzpptfafruraaawatttautjtuiwuwauzujittaufprprrtftjpwptuiujturiapipzwiufiwrwuriazzwpftztirfwjzfruwjtufjptjizwrrzwzurjzppiaiarirtirtrazurffjutiufurriiriwztiafpjttjzwpurwjatwtujfitfruairrwptjiiipauzrwpzrpffirafjuzapwtzaifpjzwwrffarpztjajtrfzfzzurjjtrttturftppzwptjaaafirtzrijfauruauzufizapwpjjjptwrzfiiuiiripzjuwrupfiwftpiuftjijjjfazwwpriuiarttztwwiwaztuwffrrwtautiuwafrztwwfrpazrffapawuijafazawfawrjwrrpzzwfawawtujatajijpfjpatpjuztapfwutzairarrtiuurippzazutpwzwppafptjawizaafppifijztupffwrauzazzpjutpwjrzfawruttprujiwwujptrppwwuaprfffuaiirijufpzupjttwzprfujjjiuraiptpjitptirtpjatffzuputazzauiajuzafjiaftruifzjptijwaizwjaartwfiurrtzwzrwpzjiwtuarpfwwaurirwpjjuaupurpipjjzpjaztwzwiiftuizjpwtiupaaztippapztpuawwwjrijiwuzwurrzruprifipfwzarrfijwiwwizuuufzawuffpzffjwaujawuziwpurirfrzjtpawiiwjwtzwrizapjjzzruuuwfptfwpjpttftwpzrtjrajzjauwajiwiuzapjipuriariwurjfpaiijapfztaipuwzzfzfpjpjjfrrturtjjrtutrtfjpwiziuujfjrfuuajarrjfzjaptzwajrfaufwauapwzupjpurjitzjtfztijzjaijrruzrrjzwttwrzzfajpitazriaffpjipztzapazrijfiffajjrpzuwuzwwrafzjaaiiajuruifitifurtuappiijwfztazzrfzptuttaptwraafauafzfatrutiitzjufzjupwztpzuzjafwjafjpwpwatiztfuwiwuurtziuiztuujwjrwtuiafrjppwwurrjariwfaiifzpwwtifpazwfiwzrjrtirpzzzwatjzutujpufwaizuizjzurpzaurtitjzuppffzfjijiptzjrftzwrauptiwjazztpufirrptipfuzjzpruiiztzwjtptzuatwpirauzuauwuwjjajitpjipjpwffpprifftrjfjuffjauwiiatzuputpzuuzutziirwwitfjrjpaiiujwpuufwuuzzptjwftfwrzuzfupfjptzjjriutuztzufjzpaurwatrwujitrajrzwizjituiipuiutuzjjiipujtatjiwrwtuufjrztprwpzrafjuiajwaiujjirtjjitpitfpruztftaafjzzwrwfiparzjuufaariupptawrrwuraajawjjuijziajwapwjrautjuwjwutwafuutzwzwptfijirzujwjtprupfifripizfzziutruttpijfapzazfaapwfzjptataifrujaitwfptiaffiwjaapzujipuprjjaajiaajfujupzzizifuztutuufrpzijazirzjrifawfijrfawtripzzfwizrwiprzaiparjppjwzzturtirzrtairupwpupwtzwfrfuiuatfrrrfrutawuatatiurzjtatptwurfrfattjzpfwufpfrptwaitiwupufatatfurppwiuiuttipiwwawuurruptirufiwtzraiupjwatiuuwpujrpawjjjpaiauitauzuwaitariwtaajrarurwiwaatjfziatjfiwrtwrjjzpwftrriaaiujzrwfzzpraiurittparrtuwijirziruwwwtfpawaittraipwptaaztipwujtjiafpjrpifpijrzutpjiaupzpfipiififiujpiautrzfiaifipfujuwpppfatrrjzzauazutwiajitprarptpazrutuwifwjzuuratziuippjrufpjwaupfwufzfaauitwjjawaaiairzizfwpizuuwjawrpfzaajtfwpfufuzirzujjpftpzfwwpfizfjfjztziwujfatuiwawafjjpjpiwptipjuzajjjurfjrjwrzuprjupwfjzjjuawizfiuwwfjjurpaztuuwtifjjwiwtzrujuuuftwpizpraufjffziajuwarajrzrprirtiaajjzfwwzuizafwtrwrujfwpwipupirtippftturuapjriawziwiruziufpzrzfpfjfwjpzujzwrwitttwtjirajufafzjztjazwautaipjfaujpziwwfrijuuwutfruairzfwrtrprrjjzfppiazfwrufupiujijaauitizpfuuwtuwzajpiuuijpfpwjrrrjjwfzprzzjwjrwaiitptjawirfzjfjawtttrtapfjfupfrtfazpjfrujtttufuirfzwtrzpzuwtwfizjzufptajwtztutafzprtitzjtijjatarfaawarrtjizjfffrppfwrupwfjupffrarfuzafiiaajfjwpjwzuuzfpiupfwzjrutwaiuwuifrrwtfpafrzptwpjuzziawpfauiipiuufjtjaazaarafztffpuffpufirwwzipurutuuwtjzwwfzufftfrfaiaruwauputuzpiutrffatwfiwfruriffjpjrtjiuazfzawpjwjufuaiarawpirpirujwffzffpirrifjufiwafzpptpttttifpzzjutrzitfzwjjfziztjjziftuatijtwiittazfpifrauftpwpzipjtfrpirratwaafzfuiraftruwrjufuapzfrrratfztrwwuutupwufjaitwuzfripfjaujrafjjztrfawrttaiwpftijuwtztriipfputrfazjpitpiupujirjjtjriwrfujwaauriifipfzawrizurzzauwarttijrwjiifajprjpjfjzwjwwjiwrfzzazwfziapfprrrpauafpwffufpwtiwirwwiwaaariiiwfwptfrzrzjaiwiztruzpfpufiitfwwzjzrpzptjjwirjipawutwujftpwrazijfjutjutwuaaazfuiwptttipfwrzwfptztwtpapwzfijtauifraazfjwapipapuztuwuuatwfaizuffitfftazrupafufawjaaprpzpjirrjrtrtfrtwwziziwuuupitujwzwriwrzfaiwtwfufjtfttrijutaptzaafwwtaurpujpfttprtaizuwtraapfjupirijpjzffaarfirurwwrpzzrifjzutajwuutfrfrzuzpairwztfiufpjtpawffzfwpiaujffwwtiuttuztzjiaatwfzawpzuzjjjjzpjwwzupawjfuzffztjfutwzijtuijawwfrawfwzpiupiutfppriawjauijtpffzrtjjizuftiiifajijpfjjaatpafwrwwjjzutfatururfirttjjtwuifjutzazijpzftijfjptirppawrtfiwajjwaprtttajuawjuwjaiwiufawwtjizrziwwuupwfuirpjjtfiriujzpzuitzpurjwuutuaazzrpfrizzapjuripajafuwufuaztrirfpiijafauwtrijuztfjzjfutwuzzrffrawrjtptptrtwajppzparjfwrprfajwjripapptjzijjutjiawurauzpwtfpztuuprtwujwazziprtjjazijruiptatjfjtfutrpffrjiiwrwjfzttapztjjrtpraapfrritfwwajzwpupjrzjaapuijazpairupupzzrpuztprrzwjfpftauptfztaaurtpruaauppruutfzrtjajufuffjtapwfwzuajjippttjfuwuuatwifjajarufwtruzutuuiuwpzpjjzrpptjppwfjffatrftriupujtfaatftfazrajjppfpizzzzijjwuwtzurfiwizpparzwitaujzpwtutwjjujufwufpwwjruuptzawfatwwuwawzrzwjipfrtzuftwtaajjiwtzwaarawazpzuzpurzautpjzffpwuipwiwwiuaiwwatwzipjufpwjfjijiurwwfawjawafzauaprittfjpajrzwzftaptuwfjztpfupwijzrtwzrwiitftwjfwpppjatwztfapwiuffwjtpuwwpipftaajwpprztzprzwauiuratrpzwrtftarpzajtjjwzruzpupufrarfuuuztwjptzzzprftwffffapptrpapjjfjfzuiawrrufazurutjuijaujtazrjztpajjfaffifujjzwzzifzwrzjfwfwzptrurzjftjrwjfaijzwrwfattazrwwruwtfawraujzapipwffzjpprziwwtiuwuarfwrupuajziawpajjfafizpaupiujwaiirujjaffauppwzujfizpajutuiuwtpijitpprzaupfarazuztijrfwtfajwfuawztratrppwjfuwwajtttrituprufajrrpifuuapujzpziipjiwaittfawuuapizuzjjwwzwriwuuwwajppwatwirfiujufpjifjauwpzzrfrwfuajwjruuwjftprwiiptwfaurwjuprptwrtrjpffftpratuufpwptrpriapizjzpfriaruzpfizjpzjzpjrwwfifiaupawfrufttpzarjiwrrjazfrwrjzpfwpjpruuuwpuruaatwjttzzrwiruitiwiiwiwrrtauwjaujztwrijjrffpttitijwitptpizzazpttwiriffrjzjtfzjziaztfrtitiuizaafapuzuapawrpwuatffztffapppfuazffijptfapwatjajwzufjtwrjtrirrutaitiaufjartaairitaiwtwippfprwjtjfjzrawtzwpajfujzfrtajrzwwpupfatrrpwwfapzijutrajrwtiturfirzwfiaiiizapaaawtttufaprfzwauifzwzatptuuurazaujjjrjfzuupzrzwziazupuiziajwatwjruiaajwtafipzjziuppjariiptatzjfrzatztrttpwrrurtupuuzjppjtifzfiirazzzftwjpprjrafrwjiziwtptzwaiwzffrrpjrfrtzjatuiaujjpiajpjuzruwitjfzzfjwjjiwajjariatprziauiufzzzzpiwatzipjzwtiwzaputjpwrfwffppjzrauprwwfjruwarjwptawurrrrfatiufufatjpzawarfawazwattwfpzupuirprjzufaajipizjaaiazruzzfiuifppftjafiwjwiptzfztjtutftuufzjaiiizzzfitjpjtjarzftrtiazrtriaratpzrzjuirrjtffftpazfiaurrtiutiwjttzzjuirzjfjjrztzurrpwwzufpaafjrirtzauattaiwiapfjpfarwttuzrjptujiufuprjuruwjfuwiutfjwzwzjtwfrrrfaztwjpjrtffrjttpwwrapfftiwrwjijftzjzufipzajuppppuztttfztiztfawiwfarjppjtruzwuuapjwwfptirfptzrwtwtazzjzzzjtpffzfitwirizartrzarfaujuaarpajpuupwrfpurizjwwufjfwztzfrrwwfrpripiuujfafirjjzfuwtpuriajzffwuzwzwzzpjpaajwraiutaujftzpfwtjajuzwazrjatpwtitiftttjjftfiwuztfpfrjizjuiirjjzwtjprizfipfjitpzijrpwrupuzatppppwaptwjzuprirptjaaafuiipzwzafpuufrfzfrpfwrwjzrrapztzifwwraajrurtjfzafjafpujpurufuawwrrajjzzzwujzuawffwzzfftrtpupjprifzrarwitauttfjjujifuzipfaztzrjifzizjftjjffuwpatwwtrarazrfftwauzitwwuaaijawpwjrarriptpwjzppjrfziirjjwtaftrijjiuiawauaiuartuafiwzrfaazpfarwjwwjjwazraurwuuwruizfrwzupitaajzjiuiaizzaijaritpwwtaprttzuppjjwuajjiwpzfppujwtutatrjtfwijjrrpjitftjjppjtfjtizjtfiziutwwizufijrrfttztuwzrrawtwazjiwiwpppwwwftiiaaaaizwwrwpuwafjraaataajwpiiirfwpfpwuuzjrajipjirtpjuiuiaiwfiwffprziffwuffpztjrrptffzwarpipaafzpfapjuuurzfziwtaupuuftrzrfipwtipziwiruapwuafrtifpiaipraftzwpfjzwrwtwzrziwauatzauurifuawfijfrfjujuwtwftuafjpruiiiprtifpzaupztruzwawirjzfaauttpifafittifjwtwwttaiwrftuuwwaitfurirrrjpujipfzurturtratfwfiajrwuauffwawtwzzrwjirzrutzufawrfptjzjpifzwtpjarwtiiapfppttarzzjupifuwjzjtrfawpatwrwtitjjrairrippurpfazarwuufapzujtpwuttjzuwftztrzjutwpwrfpawwafjtjpjtatuufrjpuifaijijfjufjpafpftppwirafziprjjuirftpfijrzttrujpjwuijafzfrapzuitjapparuaajpufuwrtjajapzpirjfaiuijuurjufarptzauzjauiuuizprfzzujzpjfpirpauzpwrrjruafurtiituzartiazpupfjawjpjiztwwtaaipzirutatpzpjzauiptpfftwrrwfajrfufawuwjifwrtuipjjapitaratfpipptiaptufzjwuziurjpzurjwtfurfipijiuptjfrrtzfupufwjwzrttwfzujpprifwjrfrujrujtppawffrwuffapizfpatpifipjztiitwputftttwwwpifruipaajifrrfjfwrtjfjirzautzfiiztziwpawtzfzwittjzriwtwtwfawaaiawrttfwiwtrizjtzppizztpaitzpprawpzppzuwwpatatwujufatttuuwaifuatzwfujuuiaprwaiprtuwiapratwrrrtzjwwfrprzaitiaffarufpjawrupauazjjjrazfzrrprfjjriipptzfjttirprriaiiaiztzpuurztuutpzwatwwpapwtufwruuurupwpjzuuzwfutptzjzpuzwwpufjpwratwztwrffufzwrjtrzitttpprtturzfptiiajjiurzzzupfuipiarifrpaawfatpptfrpzjziztfiiufiiafjjrupiwrpfzrajrfwarrfttpijuiiiwwiarjjprjiptaiwiwzfwwapraijfpjfwzptrwzazzawtrpzffitpzjujfufpzjtizuuzwriwpwtiwwartuufurpppwirarapjwritaztwwpzuftiwuwprfztuwiptatpjiftwairuiupuuiiiaipjwjitujfaawrrjuaajfapiftizfatittjwpitzwirtfjaptzjwutaazaaaprurfaurtrfpptwtpatfpjzjfrpffrjwizpzupjrafrjtztzrjiijfjpaiuzaiwwriaftzttjfwupwjppfziapjrjawfpuzitrpiajzuiatufjaaipwwrjwpiprrzrirfpipiitituipizjuprftajfzuiffzzurautfwzapuftpaparitwrptjzuwffftpupurfurapuauiiurjiuwifrjfuifrpawrpfrtiwfataztrpiwzazwprurtufztputuajifjatajwwutrrjjzijwjtjpupijtwwautpzpijfrzuraufujtptaapztptwpuawrufptiifzpwuatupuzfwtpttzfzafupwttpiuirwtiujtawrwwijjatfwpwfujwirfptttpirijwartatzrtwtaaaujwafrjwpwiaujztajtwpwtwtztzziazrrrpiraptfiutfiaiawtapiiiatfpiriupwarwtajprafuptrtzzftpjatrpzjjwiiwizzwtipatwztajtwiprarpiuptzfffpatujutwpjfptajfpujftjztzjiaaaazuzuiwzpjwwwaartwwzfiifwrrazuzttiarjpfutuitazuafwiwitwuaztjrpjpwrwipjpwaufppzjpzffprirwijwtuaizzfpuazzrriwrtzaprafrfjuiwrwjuuijuiaappprwaffzfaauizjirrtuizrpuawtfrtujjzjiuupfpuptfzaawjjzfrzwtftwrtwzauajwtrjpjprzuttzziptpapzwitfpfpuaazuartwarzwapuurjzatzfawfpurpujffrwtwtjtzwtzuzfzwuiwuizawtitjuzuawuwtpriiijtjwrjwjifutrrrpjwpftapitriptfjfjtitztaarttpaataatifpftzwajzrajiiiwpzjwarrauwwjjjpuuwzfzjuwpjtwifjjpzaijwjwtwtaiffururtfaztuffprppzrupajujfpjaaztfpfwajuwiatfppfazwiatwruwtuzuzipzjwpwrfuziirwzjfzrauwiptzrfrtrfzupputjiwwjzuizwrprztijwrputjrjarwzwiwtfuffiiruuztafzzjrffiffrazzrpturrrfwzwarrrarziwapiprzuwjuzrfwjjuwiatiitajwwatjrfjautpiztapjjuwrfprrrwztjuwppprfptzjfjrwtpipiujpawjpputizafawwaufaztraazfiwuiufrrfaufwwwaafapttawajjwftttprpjjajtziiwwuppwjzjatwtiiurwijaprtwazwjwuajritwtzwwiizzfawattfwijzwratzwuppattfautujpfpjipfjujitwwjpturipfttzfjufwuurpuuiwzrrizjpraazjarpwapfiwuajfaizwzauztjzfirpzazpjwuzpjrazztuufuitffpzrzwujjrauffuriizuftfwjrftprfuaitajfiffapirujpziujiwpfzzipparjaipaztiuprajuwfuttzfzffaiuirufiuifruwtjzuwtpttprzwiwtppijarzfwajfrajaufruuuzazfaiwtpattijpwifpjzizrfwrruazuwjzfpizaiuwfurfuftwfztztajtiwppppziufffjjjfriffzrfuftzfzttrirwwiazuwfwrrfizrztazujaptizzpizzwpffpziwuriwfuurawrrattpaprrpjaiaprjazprziwjzrzuzfzrzffpfpfiwzwjzfjifuurjjfazrwripwiwfrpitajtptpuzzrifaafupfazzuazftauuprjuipiuzrtzzzwwrtjiujawfzfwtjipzaupfawpuujzwwzujtjfzfwrruzftpijuffujpprjfrffurzawujpwpijpjzwiwiawrwjwutzwfjaatjwarjpuiipzrrfzwwtawtjawfuftarazaaifwzrijtjwfwtwfrfzutriwfjfafurtpjuwawppzjrrtrarifupwtiufwwutfarwrwjzpiifpptzfijzffrrfjzuiattutwauaiwzwtfujrurtutifzwpipaiztffitwiapjjrjwjftzzriwpjuruzwjjaarpzwiiifazjaauiurtfrrrrzrfajutiftttzrjwzzaajzajwuriiwiztrpifajtrfpfpufarjirzujfzuwprrwaafwjzwwauptafztuwwpjuitwppajiurrjfjuapuiiuatpiprafawrzjiiwwfjzztfizpwifzjtizawuttpwrttwwjaizuajfptjzrzzjwpatjijzuzpuwtatzpaijuipuajtittapppttiipaupzaazjjiuajfatrrjzufirazufjwjifjwiaupipaaujzuiprrurjutwpjppfpjturfwrfzufaztzuipjjarfupptafizfurafauwffuiftjwarfjrftrptjwjaufazirpiputiazfpwufzptppwtpariaaawriapfrptziaijwwiwzuaajafpttpafauftffrratzprijiuwtafzpiwpapipitatwiwaartzzjajfttwuwfaffwipzuwafuwrjwjwuzajzzujftaujufriiazitwpipujzraaajpzuawttupaizjpjzrjwaufpfrawjjtwwprfrztwfuuwrfzrujizrawtzfwjtjtpwwujwraafrwtpjjjrufaprjpazujaurwfizwtjurpjwptrpfpttjjzuiruupitrrffaittwappufawwrapuuiuwffuwurizptazpizarufuatjwaptrwzrwrifwpwtziazffutuafrziapaaaazajrujrwwapuzjiirtujurrufprrapufujaauaitiatjffwpjwjrawifpwwzazfwwrzazizrfuzpwprazfjauftrzuitatapfazuprafrataujzwafiwtzwizifjwizjwpijfpjijazzzjwurwfataziwuuzzzuaiiijfawtafiwaizrairjjfpfiwjaijwprtpjpfprwrttipiijuifrwtpararfpptarprurztzrpwrutizifptjaaftrapwrzftztpffjiuzwirapitwrfpwjzpufpipauauzfufrturutfrftprrfzwwwrtttwufjiwrtuwaprfjazwwjitutputjzzfapwfptatatwzjijrwfazaizwiaauzpazwwpptffitauuprzwuzrfajaruzraawrrfizrtzaajiwzziuptzpuwufwpitpzipafwfjwijtuzwttztuafzarfrwizzrirtfrfaaiiuiizaiwirzitaazpzuijwzzfwpzwzppaauaruzfrrjuizzupriutuirajrwttwjptrziwfjfpzwpazzuwuuwzizjwffauuziuttwzpawzarzjajwatpjwutzpjfppwfuwjaftuufppzutzuwfttfittutjtfwpaizpzupajfzjawpjajufzijzifrruirutajazprfwatfjrtauwiijtjzjpjirizizjjparfzwizzzazujrturttfzziraturftzuwfaauutputaazprjapwfffaafztzzzfpajftpizprawjuizizuufwzizjjzjpzzrjupzajwwpfjtrpaitzztrwtraupuijzpzarujwtjrwiappujtuujurzrjppppwfuuriatwujjfizupprpafpurpjzjufwtatjwzazaziftzjajwwpriuffutuijfwjwffppwwzfwauwuzwujuptftjuwpjjfzpiwwjafujzaiaizijjzrwwwzuftuuwwaafzaitajjtrratuawwffjtiuwrijjzzifftijftzujrztrrwawzprtrwzzzfutifiiufijufiarzfffuzijpirujawzujwrjariziijajtipjztupfiwrjruaajttpfwjwuapwwwuwpizzrjauutfzuutjjatiptuwttpwtarfrfzjjirrprtwjfzjrjrtzzawzjaiafjzfpifpzfzzjjiajzfwijzppfjtwtwurrffpffzutazizpjjpatfatfrzajwiiuwafprzapwppaiujzwaiuiwjwuiujizuwjrjwwpufauwrtpfapaujuarzttaujwapwrautpuzufzuruuwaaptfzawufizfufzzrrfaffrwprwtizppapuurrprupfwujiiriffatwtuuipuzzurpfiaijprrtzpuzzrzipuwzttzjuwwffaafrjjiwptazarwpptwtfijtfzaiwatwjppjftpztzraztpiwtwrtizazuuziwirpjwfwzzawuaapirzarzijftwwzujzfpiizwiitfrruaazrwujzjiwjwfiipprztuujfawtpwatrrawiijptparuuztuafijaztrfiirpujrzpfjzapatairiatrpjrfjwfiuwztirzjwwarzpiafwuajpztjfppwuztruutfppufizzjpfzzifurtafjttiiartwwfftzfijwaujzttfutfftawjrpiaufuzutfpiapirpijuwrtwfrprtipjfiurwwiffuwutaaprtrrjaiwpziwjfuaawftapfiuapariuftarafwrjzuzptijaizziajrzjwzzpjzpjatpiipriauzwttapaatujrajwfrzwjtazifwzfaffpuupftuwrzwuriffjptfwawzpwwriftwtzzjpjaftwwtzjrujaiwttuzuwtarfpurzupppzjwwwfiitufwujzaitjrtppujttziruazpuwaiuiuazzpwaawzfriwizirzrrzfwtruftaprztffptaiufaprfrajfitazjfiftrtwzjafztujaaufrzffjzaijrjfizpifzizttirpuupjpptwtazruruuzatujztwfrfaurwprautfrwjfaiwjuazzpipapwtzruzifuwtwipizrujawpuuuwtauzupzjiujujzfurjrrfapfzrjiwfufaupjzjapftfaiwawtjzzzztpijjwjijijurfttzzizwazafrpjzpijfuiififaijawjirtiurauzazawiaziuuzrurujfzttzapwufptuuwijifwpitaufrurrupaturzujzwpftfrjawppzifwjrururauwiuujjtizpfffawzufrtfpizzfzuzaufzitirfjrfrrfrupaijfjuiwuuaipfiiftwfpizpaafrirtrtazjitifrfzjupwzauupwzutrtpuwazpfzfirzpzajrpffjtajjrwirfuwzzijzairruzatujuiptfpairafpfiaurwaizurwjufwjrtpwptijzzfpawazfafzjjiruraaaipwpfuawtzfpftazuujjaiuafwajijuiprrttftfrzfapjuruzftzurftijarfffzputftfjiawrwpfpaptzttuiruaptuwffwjwrziauiuuwuztwfirjjzutzazizpptjwfapzfuiuazffjwfppztajuzrjrzjrawwriitzpttjtrzuuwaufifaaprtzatjiifawrapufrtafziwutaiwijuttwwafwifrujpippaaafurujpzzrzaprzpiwizpwttjtaiiwfwzrprzfzafpurffwapjfzautwwifrtpiizpaftrtrwtzuwwrfwwtjutraptattjitrururrpfzwaffjfupwujiajwtatpatwurarpritarzzpjrwajrzrwjtzpzwtjajfjrptfjruwuuzwawtuwjapwjjtutjzjauprpijfiwiwfwzitzfziaiutwutawwtppiipprjwtwzrfjpwfaiwurwaitwjiwwafajjzjuprrfwruppwtjpziawawuzupzaitzjjuwziztzuirzpuwjtrpizfjifrpifzafjwurriajjjwppfzjpwztzrwiftrtjwarwfzarjwwpiizwrtpjauttaaawwjwfturiwrjizjafuiuaiujtzrprrzjzjttpwijuaifwuuaizzatajtwaiatwrrzzwurzftazaauuaffpiwwuiwwiawjtriwpauriwrapijawtjwprzrfzaprarrprziuztatruuftprtwwptizpziipraitjaruazarwauapizajtajraiawtjwrpzaptufzfuriwwwftfpupwiaiwpfutauuupirjftuzwziarwprptafrtpaffauuuwazffuftwzwiiijtarfrwppritwuztarwjitafffprpiuiurtjuuurjpftizizjpiiprtttfiiwjppruuutwwiarttuazwwfjfzpptpiaawjiutatriwwijzzfuruwfuuaiwjajrrfwzajpupppaiftawrjrpupfjruwjaauiawjpffrrrizwwiaatjtizwafazriftfwwwjjrizauapjpraztpztfjjirtzzfjtrrztattjfzwtrfupizzffpprurwiztfjffzjfffrrufawtziuurwijijwwjpiwtjwrzrpztjizppzziuziwritjzjtfaaazrtfpwwraatfrwfztwrrwjpafrjfptzfaitwpwwfrtjrajpuuptpwffirwipjfpitzajtuiujtwfupwfwrzijijajwriprwiwitupziifiawriufztaztztjwwzwjfwzjjufffzuzufuaujjwrtwipatjtuwufuuttzipaiwwrwjuafwfrrjfwaatjapttpzrzzrfztaauaatpjzirjazzfttuauufratjriipiwtpjpjrzprtptazjzajtiutrijruzzfwuiturtutfpzrizjjujztwrurpuawfzaipatwrirutjjpjwwwuwwitjuuzrzjtatprjtjfawjajujjzuuptitjraaupaffruwraitufpzriuturrpzrufjwarajrzjrujzjwrpiazfzpfptwrfapwupiwiftpaatizaurfawuwrpjizufizuppwafazjptpuzjpwrififpwarrrraffpirjwwzrrwutpizuwtitfpiaapfapirupzrfuzzrfpjwzprfijzfiapzapjrzpiawffitupaawrwfiztpzrpjttuaaufwjaprriatjjfrzwurpiwpufwijiurtijatuzazwwwrfizuturapwjpirwtptjztwwjjrfzazrwattpzuffpwtuiaaapitajjwjfppwfjzrzzitifzppfpaujwwzwutrupfptwjtjarazjzafjrurrjaratpzarwaptzwjupjjwfrupptzuwprwwzrutftupzptzzafrffarrzjtuwipjwpjtjiaujipjptiuuzptwajuzzrpwaazzuwrtzwjjaitjpwfztfjwfjjzwpzaajiaffraarjpaiwzwwiffitzjrufrjfrufrzrirwfaputfawazijtziaijfrwztzttawtwrrupfaiijzwfjpppwawrfuziuwrjjraurwuttrupwziaiwfajjurrjrizfjzuaaiwaifuzptiipfpfprpptarafwuiajrifptjfjwajrrwpjfptppjairiwurtizwjjpufafjpuuriuufrfwzwzrwjawfijzajrazjizwitzrrtuzaffwzwwztjuafuurjpurwurajpfirfuprjtiaaaizjijauwzizzruujfrpiwprruptuzjjrtajwjitwtaazzjjfwrpzwjrrttttfrppfiifpztppwjirwzipwauizfipfzjapaftzpiupjuwufjuaarjwprpwzttrzztjfifputriiauwwtzjfpzrtarftturrzjirutipuazwwitjpwftriiffwwfafzwrajfuwrpaittiaaipzrujtrfafzuupurpzpzatjtpfzpfrwtpraipzwuiuruwjwauafrpwruuprwtifuruiatufajiftrzuuijutwraiiijrrjzrtjfrzzujrijazjrjuuajatazzfzftpipwtprirfpzfrwwrzfafjrajftzrfjrjjujpizpwfipafjrjwrpufijfwiztfprptzjwjrawufiizpzwtupizajratprairfwwwuzfpzrzuwzupitwwrwpawztatifftiipjraiaufpuwriuatztprzrfiztpapautatjtaufzpzijazpujfwztizzutfuuijtzawfuzpuwtjuzruarafuptpuijrjwijijzzwppzzaupzzwafupfzpfiztppfazttztawfiirujifutwrwuapurttzwrrafzftijtrjajtjzwtuurrzaprzuffiuaifrwjauafzritwrrtiuatpwujjauwtwiwfjtaazaaaufaajziwwpfiffrpfpafafpjtztzwzujppjppiifrjairptfrjjurarpzuujzztrjjfjiapuapjwrwfwrjutwwrfaizwtfptzfijarrijpptzpfzwjtaiftruwtzraifwjzuppzwiftfzprjparjzzzajptutaftzfrrpuiwuzztfatztatuizruuirizwfpjrwjjztitrazrtizpuptauatwwfawatwiwwwawrfpijjfzizwarwfuzariitfajujuzrjjwzawawwjjajijptjrpuujwwffwtpwuupwjtzpziairtjfzfiuzjrzwtujwwjutpraajuutuwpftwfapipfiztiztziijfrwazujuzwwjrtpajpwjzjtfiararariirtftzarpipariutpfzruupttpzfwwprzfpzaapuprpjjfizfrjfawzratfpufafatiufpzjjwupupuwpzzizpzzpwpjujjapjwttzaauwijwjwjffuwwiutrzjzjzwppfwawftuufraazttjftfpuwrjpiittuuzrtrutwitptjwtuuiziwruiwzirwpzrpjzzaarrprzpjwrfftfjjrurwuiturzfzawptzziwjutpjtwpjrrzuuraiuafrrfiwfrpfrtrzfrjwuirwiaztftttarjwffiiutpitfpjpafprptiuzzfttrirzuppzaziifjjrfftfarpifuwrjawjuutujzajtzraitirizfzarjwwfjiprrwitzitpptprrajaujwziappzrwzrafrtfazawuiurrjjfuwawuufpwjtijpptwpaztfitfppiafafzazwpwirurtjrtwuziiiapztuwaiifutijfiwatwpatpzzpiujaarppwfwwairrzjritprzupiwwipjizpjzutazrjaiururtijtwfjjuufiiwiwuwziwirtfrraiuuipfjpawaprzwawujwrtrprajijtrwrpzzitwtapazjrrwiaaffuzjuzfafajatjripaufturuzrzjitwtrifrtpwpzazafirzrpiwwzrzwrrijwtrjfzfutijtjztippizwwijzriwztfpzuazrrwzwjftwzfijajfruwffatruiuappwiwtwuuawwrfjfuuwwzwwpuufwfiprfrjrriizpafpfzfuzaiupiwpwipijrirarritwufujzrjutapwrftuaufazfjuuwrirturppijiwuwfrjztfuturpuijapwfujujfauzrraufwffiarfawutjufuzfztarfrziuzutazritzzjiuufriwujjufaiuaururuizpftfuwjzaupappzjpfrwzituttrpwfaazjtfwpaazjaaafrpjpztwwairtutrftpwpprpwrapajjruiffprzpftzuizwpwaazfpwijzpjijupupfztrjfuzzizupuzprapaajzrjjzwtajwajfwiuftzajtziftpfipafupzajwitifrfzuaiiipairaruiwpawfritrpfuprarfaapitiiawprwpraatwztrawiwuraztaizwzpjajtazfrwpfpjwiufzjafuzuffrwrpfpjpfpaarrwrrfztjtztfjziriijjtwzwrazfiuapuaujfrupifzrfpwuzjuwpwrtwpfazzizztttijarfjirrtapafipazwizrawzrwwzjazzuupaipzpttzzjzwwuatiprartwriauttfttjprwpuatppijuaaujafpputjftzrppatipfpiajfirjjitrfptpapprttttzajjpurzppaawapaprpfujraftzzfuifwaziwifarirzaartzrrturfpwiiujatuuzrwuiaftfjapufiffatzpajiirpufuuizfurwuppifzajujpjrfauwjzfwzzutiwprpzfpffizzawjttipfuwtwrtfruifpwjwpwjrfzrtuazzrwrfztzufutwzzftpitizzzjputiapaafrrztrjpfjjfwzuwfiwuutijtwwjiwupttfawtjzutjjfupwawuffpiawuruttuiifuuppftapzpirrrarujuzjwturfzjijptaaiazzatjrfrfrrffppuarpzafitafwritwrpijatrfpaftjtfaztrjifrfttatpfrittarfuwiitiiwfjifufwiptrzwrzfjtzjizuzfirarwzwtuwzrpiafzwztppwuuaifwjtwijratfzrwjwpiffatftwjttjuwjuijujiuttpwziwprzuuitjijuaztwrrujjwptiupzpjjffftttztifjpuzuftjjtazwzrwirpzpwwfufutwaipjaiiwzitwfatpjriptaajwfuazzurufpzwwwazzpzpzufzrwwuffruffririiattzurtiawujrfujauzpwaajfjzppwafijpjiiarjpwijzjuuwfuupzpzrpazurrapiurtaitjwfuuajuarpjtazpzpfwpjitujtiuritpitiaijwrpjtpfzriitizftrwrzirtiiwwupjriptwrpajfajufttizzpzjzpjrrrupauzifptrzfazrjtwfupwaiuutfupafpriatuuzfpzrpawrpwjfjipiwfpupfpurparpfwztaiaaujwazapjffitararartzwpaafjwujwjrtwrwaajfuupawjwwizzpzpzjptpjwuzraawziwpiiuzirpaftrwjwfuariwutfpzwrputizwztrtztwpawzttztutjrrafjffwfjtaaiazpijtzjwatpijazujzrzwztairwjtaruzttuupifzwtjwtfauaiwfpwfftppwrzrttpupzjruitpitjafffjrwzaziuwipuziiajfurfwipfjppfpazratttiwariuiwfjiuiwfijpwfwairrwpupujarjppzrpzjziwaarujwfafwftfwufpiijzufpujfjjzutfwrjtawfjtutzttzjfftpiajzfzaparpipaipiwujfpjaaiwrauafrftjpjjjtijujpriarjpafuwiuauzuwrzafpwujuptajwajjratzjjjfuuwrwtiufpiaruijipptztzpzzztzfwjwuajzrtuutuuffpjjrwuwtuatuwfiitzpapaufrjwajfffaziiiziwrfprifjatwzruatuturwurafirfrufwtfriufruffuwzuijwrpaztpziufuzfuuizttrjurprajrwtaatpptjrappawuifwwfiftrurutiptftjpuurtzzfawauuiufwrufiawjjauuazawafaaaruftapjwwzwjitppijitjrrrfjfjzfjpjtutzttfjajwaptputptwwwratwuizizjpzuzrujajppppafzazajwajupfiizupjzjtjpaizpawjzrjipzpftrazwuzrzawzjaiftpffawizajzwafrrrfwwuajuzwjjjirrzttujwwprpaitpufajwfaziutpfpauatutuwuazfwtpaupatzizijirzzzrrirtzatppjjtjwpfzjtjitwrzifrujuawjfutpzijpiripzfzuwzrpjuufiwjufizjaiuarfjfzpauijtwptpjafrutawawfffprizrziiiiwitpjjjuzwwpzwaawpzufiaaaiftrrutwrwitiawjtttputtwzujzuffaitfjfiutauutpzfzrfijizrtfztffwwfpifwapupjtijzapjfjjtuwtiupjaufrpfwaftwrwiuajtaujpfwwfzfuwartawuwpzzpuzzwaiwwtujfwwwwwpzwipzwjajpjuptzprfpjwajzftjzjuwjzufwtrwrftuuzjwzjuwfatfwtfzjaipptzjzzjjiwtwjtrfwtturtwzupzjfiuftzfzftrapftiurtwufpfrjwfiuwapfuwpaupurfwrwawjzzuajuwjaztwfjwrfpzputitwrizrwiirtfattprrwirauiutwptjfjftwwfiztjjffipawftwizpturrraiiuwiuuufrfjaffzziuztuzaptrifjfwriztuzpiupftztawwatpizftfrtrrftiituaitzijauwjauirrtjpzijjrziftuwrwjrfzturtapuujauttupfzaawwirzpjwzwwrtpjrpwruzafaupwtafrzawruuzatazzpfjtwfzaauufujiwjrwtwrfjuuwrzuifzirujwrprprauzzupirijwapuafpuwpirawrazazfjjuiwizaaawrwwzftwutattwuatzaizrzjarazfizrjzzzrtjjaiizzpjwifjiturituprpriwpzwzuuuaatuzwpfjiifrtfiurfpftrtzutfrrrttwaiawzaruzuwttprfwwijfiuatpiuzptrrpatjjpjzjtrrrppuptawfaajiifwzauwrpattjzpiartpapuatwwwfizuztwwjjprwujwrfprafppfriajutjujuaurufrpjwijzpujaujuifpzwtzrwjrzappafuipizraauwrwjijuujtfwrfjiajztfuzpwufjawtzwpaajwwzpauruwpptpaurfutuipipzptttaapfwaiutawzjawiujtrfwiwfrrzrpjppfrrjwawaupzuzztzpwztujjupjwzrpjuaiwpatwpfzurrjpuawapziirzatzrjajrrtwapwiajujfpzjwzaizpfjrztfujrpwjjtiiwuwuairiiwuwpwppuijfrfupwrrpizfuwattjzjpzauiapjfwjiitjpiuwwrpauuitzjtzttaazjapzzuittjtfufufuijrffirwuafzjiazrwffattpwfzifjjrztuztjtitafjraffwajaiutrajifjwwwjifujwiajfiwauuwiizatttziwjpwaffwjprzprwuwiwfwaarjizzuajurarpttututzzatfzwattuijrwaarwupaaaarjupzrzujpfaptpfpjuiprawatjfpwiiujuzupwwfpwpjwurifuwrizjauazpfruarjiwjpatjtptazauwjrzurjzfutizwjjjpipiuziwpztzipwjwtauuwaarzffiaujwjwarzirjirraurrtfziazufwwzpwirrrruzfrwpttjrfaiupaauitjprptwpuuruwwfwzwwauwfruuiuwzrzftrazizawwiwfwzrfiwfpfrwuupizzfzzftwiwufappfjuitiwaftpzrizzuafftrpaawtiajwprutuuruuwurrfpwjpiaauwwrrtrzrpwfufupawijuitfujjrffpuuwtpzizfwzitrjriwjfwwztpjzujiijfriijafafauuaziuizzjjtjfwijwjrzriajpwauipwpwraiaarrapjjjufrfjuurpjrjrwtpwiuffzzfpjwripwizpjijwiarparwfarppafuzwiwfftizafttfuzipwttpzijjfwfwawaiutjriuwjuuatrppiizpuurwtuprzjpaztrpjtajpzawrfwauiatfazrwjrfwrufprwjjffatiizaffrfaifwrjtawiutupwpztauwujrztiirwuirjwfwuupzjapauafwrzupzwzwwjzrprfwatippzrupzppitruifffwiafzuirruaizzujwifruuwtpatfffiipzzfpuifrwwzjpjjftjpaiatzafujipwiwzjpufrtuptraifjafapfwfztfifftjwurjzjpwuppwpuupwfjjizjfjztrajtppjfuwjuwippjtifpaaaurzfzaujzztfijjzwzwfauztzjprtwijtuijwpfzzufwjajijtptjwawurpwpfjzjjipjfjajaiprtwiijwujpttjtwtizjufpjajupprjuiaauappjjwjpawtajftzaajwzturwzaruritfffrtriiwjprrzaaffippujjptrppfwirrjjpauiufzzzruwijffirtuwjwatpufafpfrjtiutufriruppttjaiaupptuzupzwffawfuiifwipzwfjartwttpfpzjzttfujrjfprjazaajrawziztjtipujjwiapufarwwtuptariputrupiuftazfzwjirraiprtwrrrrjafpwuaiffpfttrtwwiratipiaituawtttrtawutfptwriziwztpazwruwappiwwwpufjuwpuzuiiaptpwjwwjrzuujupiwawtutfjtpfawrprazfiwtuzutuuijtiruawiippwajfrwpjfpfrpiwaiaaitttiwurfruutaappfpfpfariizfupuifpftjuuttufiruwwrzjfzzajffwwarrzifwzpajuijariufiraiprpzfazfzzpafiwpzrpazrijrwjrjruzjwajzaapujjizfttuwppfzptfwrtzjjiufppfuzjpppzuftjzwtzaitfwtpzatiuptjrzwfritwpwiifjiuzaapjpzfjzaaipujjpwuiprjjjtaptpriajptjtjrtttffpipazwraiapfrwtpawjapturtutaptuwiuafwiijiwurijazzpzzajjrjzzftfpiuuuppfrttfpatfzwuiaawiauiaputruaiziupjurutpaiftazifaijjwtfarpuwwifazttrwifuafuwjpzapptjwtuprzjfauraiwfuwiatjuarjutrjrrzjifzjfufjpppjrjijwputzfftpifwtjttppfzifpzfawajitwujjuuraarjzfrfjwruitiazztrjtarawfiujuzpawjaiaariuzappjtifpuiatfrzfipjpiiuuwwipjuazpftuawfzztatazzfizruwipufwjatzjztazjartpwzruwfpzuaruwppirirjjjraftwrupzrpufzuuuiaziiutijzpfzatzpjtftrfzafpiwtwtzfppaputjwraprawwirtjjuzzupfprtiziuiuiruwprjfaaupwaitztitwfrfpipfjtjajwfjpfpprrwpzjiwzappjtarwpftawfuffajuprjzjatujiftzwftfpfifzztaitfiwupuratrpptjzupzawfwawtjraiturirwwfrprzuapazttjritufrwjftpztprwjuppizwjuaftaatjtiupzjzfpjippfrjpufpiwpaipjiirfwtpzfrzwwptzprtjawjjtfafzrtatjrzipwuwttawzztizzujipwjtiaurzfraujtifiairrtptiwfjrfztzwffprwpjwpwaiwfzrwuarwpjfzjzfrpftapjrijwzjwfirfwfwtrzzfjtjfwptwpzputfwtfuruwzjrrfpwiwfuwwuzwftpaijzzjziwfjftzufpzpzwwjtwrirjjfiwziiztrrfauptjrtjtjfwuututiwijpazawaratuzzpauiujazizizaawwwwuzzfjjjfjtpttatujpjrttwiwztfrpijtrppafrjtwpruputtuapfrtfzuufwipiwwzrffzzrfrztzuuuazawazzapaaafawwiwwtizjprtjjirfawwijtatiafuajitzuzuuwtfifrfjwtwuzpptujtifjpjifpftapirtfizpfzzzwfpaiprzitjfwpttpptpupttrtzpjwrawzrpipfuiafpirfjjfujjzffrziptauuwpupuzpjfrfwiwpizfzjtjupiartwrzpifjfipjpprrrwiuaiwwtaiptaruzpuzuffptjufjwiruijijzjtprjippwrizuzpuizfjfwwtariruzwjawutjwzzttiujttfwrptpijtujjuarritfrauwtraawiatwwpaprpupzzuzrziprwaiaztjijtztzajizujjfruirijafzrpraaiuajrwfzwpiarruafrjruuwaazzurpftfrujwwazrzwpwutjfuiztfuifpwzwppujrjizjuawpiiurjurtfrarituwwtjfifujrpiiuawjiwjfptaftwpwwwatapwizpttwuzizjijwwrpfpuaiajzwwjwjrwzrttjrtptrzruarzpzzpjiaipajtzrzfituiprtifurwupwwautijppjfrtjzrizwjrufpafrrwiifiijzpaaapuffjujrifizraijzprfiujfpjjituwapirjpuprjufzuzfufwjuparrfwprfpwaaiffarrppirfwjjtiztazjtpaifzaapawatztjtzwuijiazzafjpiftpfruzizppjitjitrattuazfztipzzaazztjurajarjjrziujrazptftjpfturprwrpfuzfrwuwurtrztjwafiuwuazrpiafrziiirtiujfuuizwuffwzfzprjwrajfuzuupprwizitawpztwtfatjrwijjjjfrrwuztjjwtrawfztwtajftpwptjzptjujiuirwpiazrjfaupiprizfuzztfapaapzftfwtpwfrritjpwfzrrjzrziajwuwzwjturzzifpufijjttizwarttartfwjuwjrziatjzwzpjjpajiuazrzzzpjzfwwfjftijfafiauwffzwtazijprrptfuiaatupraiwpjjrarjjpuprfaazifwuaajjaitrufzzufizrtiipjurfzupwjaupipwpaitutwprtwrpapuzjjiutitwppijftiaaupijizjzpwpwajpautwawtjawwfjjjftruppwuwtwutwrwtrurfjrzjfiijirrpippwutwtwaifzfwizfiwwizauarwrwwtjatutpzffziztafawwratapwuujpzftuuzfiipauiauutazaarjjpuaitjjziffpatpuiitjjftawazzwuwjfjrfiziiaruttfztjauifiarpfzffpuriaiuujipuzrpajfrpjjzfpztfttitpfiafwfprrjrtpitjitjfwtrpwjjtfwfiaiwwfurtapfpztffitauffrwrazizazipruizpuizruztjtfwrftjjwwpfiirzratwarffrjawzwftpjjratwfwfzwarujwpwizuiprttizuwpfaztfifuawrzwfrjzwtrrwifiwwuazuitwizrrjjfzurftuzajazjztpzazzwtrriitipwaajaiutwjfrzrzufwtpfzwijjuzrrpwzijuiutpwrzzpaaajawraaujpzprjiuwizftfjjwiwrtzfurufzpajpzipjapiazrpjjatwiftzpzftuptttjzpwfwfpfpwfipaawpuzrfijpaazjfiiiizjpizpatififjitfirauuzwfapiutuawtfiwjuafwrjwrifzuzjpfjpifrrwjrtuuijaapippfjarrtitauuijtttittijzjfitfjprrzwrfttizaaffuutpjfjpwzprrizprwwpjfijpuwupfwfzurfwzpwzwzuarawripwzzafpjzrazzawjtaitjzpijuzjawaffajrwjzzpfzzujzpjprjzzaaaaiwzrtriajpariaurawajuaprpjzfiaffzraaufwpttptupfiratwrtriipfuppputrwztajzfupztajrawuuwfijrijauptrtptffajwrawtrjzziztwjrtwtawaruuwiufurzzzijwprfafjfiazizrjruwtwjitujijpiipfrupwarwwfuuazaijpurtarjtawtfaritzuurzuawiiajizauzzfraifrizipjpaipzrwiptazaipjtfztaptfwtujrifjfwazfiiajzrfprwtpptirrzrfijurairuwirauafwzwijfzjiaurprfzrwzairtpaaiuurrrurztitpfpjijprapfzutjjzjupuzpfwttfaptifwjzjpuuriziptfiaaatrptrupzfijijaufjpiauzwtiwtrjjfwjpfjuwprfjuwfiztpuaupujrfjpftjjftpzrppfpjitrzwauipazrirjiriiiuawtzjiiwiwuzuufuwaratiftajtatwairrjtauwrjutwwupajtaaatapawwrafwwrazparwptaizfrptftwfiuzpiwafapfawutfritzzatiirauztzjaiarrpaufwzuiafzffwwjffrwfaaputzziriztiutfwajaiazpjajwitfwipipriafijztuwjafaawwpwfpufajwrartiiwazpzuuiarpwpwuruiupuwfpttwjpuujpjiaafjfirpuitauwzrriafjipzaujwzrppupwzauptzajwjijirwrjaprtuzjtwiwjpzfjwtfppwfapwzwaarwzwiarrpiiprijwfjufjijiitpujtjuzjtitjzairiztwraiijpajfuujiwrpwuuaupurtzuatfrjpzraatwawpjfutzzjpizuwwazftzttjrttpuujptputiitraaurziujwzwtwjwjrraziwaziwufpjffrjfarjuirtjuziutwujjaiptifjarptaaiiwzzfrijittrtrpwtzpuwppzijtttprpfzfijwajjzwtptjwwppfrzprzwzajrtjtzajztwwiaaziuatrparrfwpwjpajauaprzraiurzwartttjtrfzjujzwzjwzwipawwiataiaprpfwtiiftazpujwuwiwruzawrfrfrruzjuftrzwjpprajfuzrwpatttfjaiaftftauujirupjrjrazitjtifzwjurzptzprzriuifiiwfjrzawfiwiiatzpafrrwrtzrjpzfraiwutjawifuzrpitrffjzzrfzijwwptfaaufiufizfjjpiurazfpuzufpuiaawwztaitzatpawuiauuzrizwptzfaifiwtpftiuuijifiwwptipzjwriffpfpiajjtpiwziprufwfffjprpjwpptjrwijattjraatzprfapruauaazwuwzrrjzzurwuztwzurttputtiiawprupiwtaapruapwjjfiuruurazrfiwrtarffrwwfjwpjwfwpztzizwppzrrjizjzprjzawjpjzppufjjatippwtfaaafuifzpiwwppjfwuafppzzrraffrfjtwujufptzatrtwwapprwiuirujzafzfwuiiatrpfzfzjwufjpjrruattfwjjifwjjuwtiwzjzuiafrwrtputzazaiufuufjfiiawraijpiwfwtrfjftufpwpfwaupzupfuzfaizjuffwifttppzzfwtzwiiziutpfiizjzaatfprwwjfjauwputapafufrjrwuazattaztiffujpripjuatuftwwwaiizrtfrraatutjftjtautwjjptrawtwfjiprrfuujtuawiwjaupwpzrifjtpfzarpzffapujtjrrupiftzuauuffpjutjrrzjuuwfrwrriiijziaajtwwwppiupfziutwtrpraurfjritjtwtwfwifuwruzpwuzzzpafufaffwjrizfaifijupujarajijpaptuiwzfapzijtwarfztjfifpfiafzrazwifwazuwrwrfrirtiurirzjauazawjjpzjtfjjjrwtrairrafppjzrijuzarapatutzfzzjwfiiaruawfiijuupfuajjjfpfwapwjuupfwajtafpfjpuaratjjapjwjzjaifrtwtpzwpujpfzfwitffujpuazjrwrawztpiitupaiwzpiuruauzauuutwfttzrffwzzafaifrtutazwrtrzrwwppppwjfztzzfruwjarppjirjtjttuwawpwjfwrtzarfjatwfafwtuaaawjziwwfwtjajttfiiaftfpajaajwazaaprupzrziaauuittiwaajrfrzziartwtwpfrjwfziaijwfirfzijaurrjrtpzzzrjfirurfjpwrtuzzuzfzwfawwtzifptatzwtziprfwfrzrfiwjfzawiajjuizwprppuufzzfrzuajrppiptifjfaffptwawwajpjriwjzprzaijrzpjrttzzawfrjrwfttwaiazzrjjzrzfzfpraftatappttjitauafijztujuupwffaurfpzrtpuruaiuaiizpwzwpiwuttjzpaptuiztuuzpujfitjwaufuzrrupptwtuiawtiauzzzjfzfwzawfjrrappprtzjaftpuuatiziiaappuajzutwzrrwjzaruuijiapiaprpptuwjjwuipfruiffzajtippftizrffziazjjarfappawftiuazuiatrajwwurjwzfatwtipwuwwijpjzfjajpzzwwwwafuwawtrwurpazafuipfizuzpupzffwrutzjtrzzrtjzpwtafpzijwrpztjawjpfzrriauuaaauwrjiaurpawjuttzzwzpzzauwupuwjaajuaajrpuwitujaftiruttffrifpfwptratzpiuwuzzjtrtzupwztpurapipawjftrjaauzirjrwffufwiwpufrizzwiwptwrzfwppppwwuuzrrwzafzpfjwfzprtwzjiztuwuajwjraftjratffrwfwfpfjzijfauzazupzrfpffuiwfptipfirffitiafpiujwatatjiajaffzzwpfajztzrjpfjaruzrwrtwupzptjfajfpwzrairwuzwfffjptruafaatfrpwujjutpwpwfjraafrrfiffpawwptruitziirjiipztjriiwijufawaatrawwpiujijtrtruzpwppffwizawtaapfirrzzjazzaiarpjptpzzrftzpffuptjwwujurputapajtpwaajruzfrrapwuzaffzwwjiuawiztpzjzizuijztzfuzrjwipjjjjwizrwtfrfauuuzfauzfwaapfiztppfftttuparrjfawaapairiitwfjtatuwwitafwitajwijafitwruifzztaittprfuiuwjujwuwuuzzrirupupwuzwattfaizrjppjttatprpfttwrjtafzjfjatpuizzziztzuazwzitiwujjffutfjpzzirjtpapaijauziiiitffaprjuufjfuzjtuftjuzrwtpttazwzuurjzzutzwrrzfjztuzjtffjzprtzfrwwtwwwzpurijfuzawztfufatttfjffwtzizprazjffrauizipzrjwfipfpjzrtttirfrfpwzuiizfrtzufwauawpazajwijupzjpriwzzuiwuprwarwzjjztuzjtawuapjfauuapijztjpfjuiffjwrwtfwzattiauuitifapwpafauapripjzjjiizrpppiuituritwztfrtrzfaaaptrjfpruipzfaiftujiwutwaitpapajtzrwffzpfpajirpfztjitwffrzrfjftzwwjjwtjauawrfpijijftpuppurwfjfjzwazwzjjtppupwtfwjriarpurfrzifijrtrfrizrtrwjfipruuuptpparjfpujjwrrrpprtpjaujrfiapzawtztfpptrirtuuwzutztfuppfrtwtijrzpwfrjupfziuzrfpjartiifitjjurizwjwuiuzurtjiiwijuiifurjrztfaiuatuiuzfiizurzawrjpuujtziptjfauiwprfrtarppjfjztutrzazwaizpuftfiupuiztfiitipriffwrfiipittutajfpwwtzrruifrjrtjttuwptzwjrrzrifrwzwzftutpzjrrzfjurjpztwuitfzzfjzatwzaffjwfwjjiuzzttwfpjiiwwftpjziauazjjzairwjpjuwuufipitijzjjuujjtifjfjtrazftipzjwizfiijrziazafurftrprrtpuiurrfiififjfrptuawpzuauurwrzrautfizurffurawjufurjpjwtuauauajwrazztwzrjjwriiuzjpttfpptapwzwjutazppapupztfitpfuiuijjfauprzfttpprpritiiwffurjptttfpiprufajjurzufrfjpuarjtzfujjwpijpizfrjafwjiiarapwpupitiiptuuwjziurzffippttjjatrauwizwjjrtpjpatrzwwatiijpptjriztrwuzwzpwiufpizuffpwpatwjtiuwtujaprwjpzauufuzzzzfupfpfrrzfizfzpaapriirtrjfrpttaarjarzuiftjzpiirjwttjufjwtrwaizrttafrtrjituiprwtipftjwwfazfupjizpjfrwwrppjuizffwzjzfttjfrpawwfwufjijifwzitpawrwzjauwifrzwwazjwfuipftttztjtjajfufjawjurirtztriiauiiwaaizruafpwtrazujattziuputrfuftzazwpifziufwaztftptfrrawiwfupjfpartfiutpifapffjawtftzuuarttpwfajpzrafiiaiutraawttjzpfiffzrzfawtirrarzfztwtufzwwwwrrijtrpjzziattrapuwpfjppuwiuwtjpafuaauwawrpijaarpaujwaawzzirpirjfufupfiwuattzurapfpptizpiwipaujptjtwztitrifffaziiraizjzruwzwtttatpwipifiuzztftuiaaauaarfrffjiwtzfztwrptwiuwratrtwpfjaizfptztfiafttatpjwftwuppairpupwazpiftrzitfzwtfafuzftjrtajfiwrfifzzuwwzaufpwtjpupijrjuirjfuifuaajzjzzwwiiuruafzjfpupajiffazuftuwuujfprjjrzjjffwzrajuiarwuaatwuwprpwjtwfiutzrrzauuwazjzziiuptzwtzrifajfuapujrpfjjzzziwujpwztpjtuwaiuuazpjarjwzfizwjtawjrztrifawiruarprfjjitwffpaujzzfrrpziutjjzpwartffuazfjzaizrjtawjfiziztiipauarwitutpuriifaujufattfutrurrfzzfwzfzwizriwtrzpaitirjuipruuuwwtpjwapjptjwarizazzrpwafuwzafjijfzfaujrauazratizfrrzftrftttfpaufiuzfjuppfpzppwjftutzatwuwwfwfijafawjjajujrazjuijawifwztuipfzirrfarzifwziziripptiiuatruijfztrpfiipjfapuuwiwprrtuzirjippjwfjjzrwzttrwpiaaipzrtajtpfwwpfptarfzzpjaijiwfjrpujzfipjijtjpaijwzpwzfwtajrptruizifaawuzftwuzwajfaaippftuuutwipujzjrjupjzftijrupjrtppatjiawwurriauartjwiajpwjafipuwizurfutjwrtrzzrpwwjazzjfuwatpiwiuijtijaufuitprairwtipuwppuuafpprjafzpirawwuwfwpfritpttrffjrafpwjpfarifajzjiwurfruftfaiiurwtijrptfazfzwtuizttwuuwafffzfzitwjtfiuauzrjfiazftzpwruwupjauarawtwjtwuawauwwazwwjrpizzpprttpatiituzjawjpjwwajfrfzrtptfjwupfrrfijtrrjffwwuipwuwwztzjzjrjwpppzwjjpwarrajwutzrjurzuzwfitrtupiufjufiurritifjjzfpuutirztjftiprawpwzjftwtuufziawprujwipuwirjpjapjaiwwjprjaizrzirtwupwfuttazjftiztjafauapwwzwuuuwiuttwfazriujrrawpittfzjjipupawzwzjuazjprfwpuftuujpztpfijjtuazafwpuzaztufwafiprutjfwztfzuapjraifpfiaztjwzzjwuifrfufpffzwjpwrrwuziprapjfpfpzurwfuitfuitjurfrpffttuajptzjarztzrrzjziuttiuuuwzztratifrppirzzzptataizrwjifraawwjzjjzuuzurrijzfwtfuwawzirzzwutrjztpiruurruzaziztptaatfjuajzrtazztzpuujtzuzzjpjjiiaiwparpurjjuwiajfjupujfftpwawaawatiiffjrfjafzztiiwatrpfwizpzaffuwzprruafratuwftapiaiajpazafjtpfuwzurrrazwafwpprwrftpatiaiaptttzruwazajwatiautfitajijpjpazrzpjjawiwzipjjuataarizjwfuuurfawfirupufwjtwzwuutjautzpiripzirfrfraipjzuuprtfzttjwjptpufzafuraaaiiptjtujtfpifazttfjpjzfpztwrjpzzwirjaappriifwupwrfwitwajpijirpuafwjuwajrjfrfifwwfpaprpzupairwrfufwirjiffwarjujaaiupjtzaturpzpfwprpuifjjiwzjuarfzrftwptjwuzwpfuraazufjzuwtruriurrapwfptuwwtupiwaippzapuawaaptawwtfujzupzffwruiiuzwafjuztjuritafjtjwppzatiiutjjtjpjrpazturzuzfaifztiipzuiwufwzzzijftfwwuwurzrzfwptfipwptifrattjrwiiitfawztauapzztzjzirifijzptfppruufuujwzzjritijpfazpraatjaratupjfitjuuffutwiijrfitzrufizuzzarrtfwtwujrjarjutjfujwawtjaujujzwjwazifwrfaauwrrpruarurarrrfarawttjffzzwpawtztrwfizararjwpafitiuriaijzufrtwtwtpfwtpizafaiiifztaziwzzzjufifwuztwawjrwaprazutfjutwjtpijurtpuuutipzzawfzafrwzatzrjifprfaprjfrzurffwaijptaajwzjtuwfjuazzprzjffuirrtzjwazjjfztppturfjwzjuiwarritujtafpzuawtufttffwtjjpiztjiuzaaaifztutrzpjfjjifpuauaafjtzzfaraaturijzwipuwjjfzufpuftatapparziwpwujpiptjfruzjtjpjtujjzpztwjrtpwizfzrpztuuufrfztiwppifafiapwaptpuwupariuiuutrrattrwuapijjjajpawpiarfpitzpawfruzftzrzwzfujtautpipiwaataipzrpiwtwwawwzwufaawwjwfzutaajzwptuftwuurjjupfupruaziiprwtjjitjirwaurrjfjwzazfurpjazputjztjtijiiuriiwiarwjpatjiratzitrjwairiatitruuwruuirjtwizutaijitifuizzzttptuawrffrzfuuutjjwafrpfuptarzrupufzjzfaiajitfwztzauztfwratfajurjpaupitituwijruwwrazwrzwftzuzfuwaruzitfiatuiwftjiiwapzutzupaupiwturtfwtfutuuufzwfiirurratpaprwjrjiawruwfppffprrjwttpttfttjaprizitwjtifjwujjujuwpuiwpjauatrtrffwwzjjazifjwjiurtwfrrpiaipjzfjriztjjazzfwwtawjwuitpufiptraizuipwaffuziuiriaifrzwrfaptfwfpazaaajjpizwrffftfratuaizrfruprwpzzpjwtjpawpwrwrjiarwajffwfttjaatuupwraftwazujwuapffiippzujwrtriiwrrujzwfrtrazzpitjpzjattpptfaujzufjtrwazfuurrptzarrwjtuutprfuuzptuajwziatwrrwraufjtuuuirtaaraujzaafjazwizztrwiijufwrrwuzuffptwzarjwafjprjjwfijtzfwpwztajjriuzpfjupzwjwjparwffuifpfufprauiirafzifwpuzzwujjpwajjwpjrziirtzjupjrpjaiwzaifupaijzitffrjjrpazwwijjjfawaiuiarprtftizptzupapjazuzfuapwjwuwurajzariwtwttrpfjjttpzazwatuztjrttjuatzrtfzttjpijzwrwzuttpairrztutjptzzfztpijzjwpurzrtzjatjprrrfujazfirjuiruruzzjtjiuuuffawwrriujuwiwjtwwuwjtjtfwpataiwtijjfwtaarjwipffjufwwrwjrjtpptrffzuparrtjjizfpizfrjuwuzzirpurzijfwiwtwfittzrprwztftwrwjjwzzrjapiprtzprfufwjjtrrazppauairffwtartjirpjpzatuttwurpfjtatwitzufwprrjjfuwtijatjjtpffuaazfrrurpwrjjjttrwptwurrjpjrtafjutwuzfpaazfwzazuruprapraaziwjzrpfwauwiwuifrtpatprzjttjauujutffjwfjifajiiuriwipprawrjpwtrfawaawrjfjupjfzjippjuffaprtzpruiptrrwauturzziatrtituffiawaurjujzfwfaawwjutwatfzawwirfuzjwjpfwpraruujtftfftfuwjrtappjpfzrpuztjafrritptfaruwwufiiwtpfwziufirjpaufaptpjufizuawiwarartjwftfawrjuzuzjtiprarrrziiwttzaapfippfiwuwiizztfiwfujwjztjirutttfutuzufffajrajuffjtfprwtjiaapppzapzipaafpptzrjwtwarfruuwwuutfauwiitfpuittapiififuwpfiuawtpttpiifipwzizrwzujuaifazwzatawurwtaarppjppiujiptafapjjzjwawujaaiaapffizazrfiujjpaaripzwzwrtfzpwazzutarfwujjrfpjpaazazfrtfzruwptpirzauwjprtwrwarzfzuzrzzjtzrpapuztwjrifpppwajjaujtwfurfpjtrarijrrippztiazaupuawzzritfjjrjatittfwppizafirruwruzppwjwpiifrjawpjfrijazijrffijftfijzirijpuiwpjfuarapjwttjapfjuzpaawzazuwutwuutauwzwawufaaaiatpptjutppfffauziwjzputjwitzruztuaaprrapjwrzjiawtrwzpiitjpafutjzuwwaifaippirftfwrtjfpajjurzpawjtipjtuptiauaippjjipaftrtparwzrpiuazzjwztaiafwifzijzfzrijiwapiafzaprufjrjufrujrwajzprptuautfjjpuwziptprtprajuutwwwatizzwjtupiazafaufjtijuiuzzzzpjjiataztwjfzuttfrztjirtjjujfwawaiiwjfzfwwurizizjurzaajtiipwzuziuujfpitfjtfwrtuapffpzuriwizwarazfztzuattftuawzjwjpwzwzpiizuzjjruwjwazztupfzupwzfzrtzrfuwzttzfirurrijpujwapwtpitztufwtrafrtwrujarwwwwuuuuapzjwfutrrfjrzpjwjufatzuiitrfujwfwiapawpjuzpjzuwzfprrptrurrpjwppzpizzwjjaptztuwjfzararpwiufzapfifuztwrwwpzwwazijwfzripwuwizitjjizippttijpifzjpaipfrjrtiwartuztwptuiiazjjafpatjzutiuwiwijazfifjfruwrppwiiiutajwraifjattzupftpfutrfzjjwatzifjzpfrziariwiaiawfpjwufzzufwjutwiwzfurfwfwzrwupruizwrirpwzwiauaatjfipjpptirwzwiatpiarajpfffjaauzffipjzrwupafifzzazrpjrjjfwfttiwjiiutzrzzzfarfiruipafazrawzwjzuuttwwjtrprffwaijapzaprrajwztjarujzzijfpwpriiztruzufjruijufuupwwuizaztpwpwwptjuwpfujpaijrujtatriuizifipjutipfrztjwppjupjuuffjrurtifjupjiurrjiuzrwffiifjwauizifuwjjzafpwwpiirapjwuwprzzizuuupwzrupwuwitpfjjwpwraizfrwutffzwwwpzztftatwrffizjjzupujtuujipwjwpzpwtrzwuuifftiifprjtrftpfrpwwauifpjwjpwpurrjwzwrraajjzwuaijjrffpztiijufafwjiwjirprftfzzwfiaiwrjpaftzwaiwziaiairttfwuwrjiapirwwfpatrwrtiippzuitjzppzpwtrrwrzfuutjijjparzprutiprpjirrartruwrzzaiztprurffjzjipurpzfpawufpitwjfwptzwarfzajtzafurprtpizfwtwuupzfjjzfjrjrjtfrzruzarfwjprjwipzijjizjwzfaztzuazrzzifpaiwzraapzwpizzwffwwawtijjjzaiwizaujzzaiazppzttzajwzwpizrtjjipfpufrjjttzpwjtarrtpaiafwwtzrjraraitwzuawpfurafwaiwrwatwzjrtppjaijzfaitarpappjwpazpwwutjtwujfzpawwuajtjjipzirirurwpjfaztuarapuaiztpiwtwwfwfupujaitwwfwuaptwtpjaurwawiipprpatfiifarujuprwpfjwjfppjzaftuurjzrzwuipftppjrrizrjzruafwfjttiazfzfzuuarafujfzzzjujrrfwjuwtparzfrjwtwifprtwjurtrzafrpjprjawfjtwfptwjaijwautiurafpzrfaipzppftriwjtrfuaiuutijjiturpwurrijtzftaazuzrrwjrftwairztzfjrptpupzfutajzzjrrfpfrjrarzuatfufijizawrfjfawwwwjazzifiajtfawwzufjtfitptzizpjtpzirpiapjiwpizuratrirjtwwrafrjrawijawtjwzwtpzipfwaitwatjwfazftjjfiwfaiptwziwfzipufwiujwuijirfpfwjjrzjjifrtijaaupiurtptjafjrjtfjuwazztpfriputujwppiifwufajprjwfptfiafifiatjafipiwwppaaiizjpiaapfafjjazjiftrwrfrfzwttrtwupuapafzjjattwwwtptiptzrfwpjuriruppfiiwwzpufwzrirtziufaatrfafpjrrurftjwjwfwwappauffupjrzairiipipruparjzzjajpiajjtirjufutiptiarpjaripjuifartfjzurzzrjfiiufirzipprjtfuwfwjafurzjufpzjaauiaaurjfiiatpztujttruztwffiriwffrfajpjajjiuajfrzutwzjzifiwuiaptpiuuwwztiizppffjraafzupriipztiruppupfuzjuuuzwiraturtitairfzjpwapujwpiiaaifptjtfpprfzujijwprtraiwipuariprzjautpfzwjwirztfziauapfzfziatfauzwzzprjfuwffwituwrtiwiftziffiaizrzpazjurjruaappfujzpzwfairwrjzaiztzujriijuzitfrjpjpaarafjwfrzaartzziwzupirzjurfuiazptfazrfuawupuifwpwjjpwazzjrwauwrupjwiujwiuiiwrtwuuajrajptuuppfzpiuiiaaazraitjjiiitfwjzauawiatraupwippawwtaajjfufifjtwwwrpiwfrfwirrjrtrwpjujatpitiiijpriztprraatatjipftftwwijujauijapiwitaizufpwiuapauurrzujziwittptajawpwiwzpttptwtjfjfrwiwiaaptiwwtzfjwzapffwiarprfztfujrutazwatwupjwjujpipiiuaifuiwwjazrizprwauuzuarzuftruffwfffrrwptjutuizffwppziwupupttiptitffrtpijatpaipwrzirtufzupwwtzujufwpjptjzufuzjjaffiwiprafwirwzwtrpuijurfifuzaaawuauppffjipptwuujwazzfiawifiurptpwrzawzafifapjrwtzfwtaftjrfrfiruifzufufuitzzirrrjijufwztfwaiaiizwjurppauftpuafafzajjupzpapupziuzwjzwrtazaftjtpwrpwuuwjrwptjfuufwiuupaizrrizazaaptpzfprjiauuititpfpzrptuwpuutiiziwwiiuiijjfjirfwwtwtpwiawftrazuzjtfztatfjrpwzpwtrwjtwuzzipwpztwuwrutaiatuajzjfjrjzrtfautzitrwaiftwziraturrpiffpitrifftritzaiafiffrirjpwatzrtjparzafujwjtfaffaappjtzuittzpurrtiwfftufitpjiiiupzzwuaatitiuiuutfaaiawrawuarpttpjzrwrwfpappiapizruwptjarrpuzrftzrfzztwazfrtrftpzrafjrftauptztatjpjfjzfpafjazjrjiauzatjprauzirzfrtfzptziurpuruirfwwzpiuwpfiappjrarttttaitptjpjtzpwpatfufztzjauuupwrfrijrutzfatrzjfrpuafitfjzfuriawffpwafprpzaiizrttraatjtwtpfzjpjiwuppturfituiztaitajztjjpitpfijftppititrzjiiuijrtpajtitwtuarpurwjraprfjuwpfzrjjjiutujaapprrujrapjiutwupjpataftpafjjzwwrjfazipuzifpaifpirwztparuaiatjwujprijurptztrpjjpirwiawrtfajzwaiaaitjrrifaratiwuwfziitrzfizwjitutjzitfwriirffuiwazrwpaawawzuftfppzrttjwiuirapjittiuprtfuzjprpwifuuffprppzjjjitwujrppurfuawzifawuauitpfwzjfifpuawzjptjwprrztwztzpfzifzppifwzzuzzwwifrztaztwurpjpzupjtauzrzfrzwjauupzupzapjfujzfitrwpiptjiziijrarazipzrurtzairtifwjwwzzpttzjwzujatizptuwtfzfpzawpfaujpfuiwfpzjrzifuzwujzzaujztwtirpwtfjfwftzirwwartirtpufuriutiptparfjijjzuwppuuuirrjazutpiuajaurwzzpjwfuwaazwuzpptjfzwawjfuujrjpizrprjaffuipjzpzjtppaaatjttjawftrzfutapaupptwaauutuwrzppwzripuzrfffpwipttpiuiujfptwrurrzffzfupiittjpifuapijtjaaufztiafjizrfwztuzzrrfatijrpjijiwittzrfwjraatajizzfztpzffjuuffjttpjajwpauuwjfauraajjifjwafujarafzwttjjzaiwwwzaiuwwfiaupuffzjwwuiiufijaifrzjfzappztrpapzfatprzijtrfttpzajufztirjrfppjtpfazizwaautzpfzzzppffwzijauzpwpzuujuapuirpiafrauujaiitajzzaittpwuwfzijjrffatwitrzzuruztaiariuuzwuwjzzizjtauuittjzwjauirpuafjwpuaartutffjttjjiwijpizrpfjrfjawjrjfazjawjuurwtuurwfpizfuajwwurwjiufiptwzippfifruzijjzzpjzfriujfatwrjrzfurwtrafajujuutzfwriitrftfuiauftzfirizatuafjtwzrzffrffjfztirirpfaptzjpwpfjzwpjzfpajwurwrwiwjzjaprzuuppjfpwajzpztitztrijaafziaapffatwtzpirpipwptuuaatfpruzrpwjiwpiuipautjpwatttfwrztjufrpapiuuizfffufrupzrjpppttazzwjuizrruwjffpjwutfzfrjpujjfzuwppzwwfjfzritittjraufzaaptupptzipuutattiijitjzuittrfujarpruuarrpuiutjtjiwtutzrzfjzjuwjzfruaiiztwwfjfazuawfjirirwwpzftutuffpzairiaafriztijuufwjwrjrwuiwiafpjwwajtjzpajjrjizpfjiauitarfatiatazttiarifttfzuzpfitzpwtjjjwtjjiizwjaupppjirtjuwjfjrwjatraprrutjzwajuujzjufirzwprpwprzuzitrwprpuiwfifttjujtpputttjzzpwuzpwtzjafipiwwjruwppzfwrjwijtiijjttrwjrzftfwwrtwztttzurwjitazifjpuiuiwizafiatupittjtjapjprtfaruprpwrzjwzuffjfwiuuwzzpzurazzautptiajtuaupwwwptrzjjpjiztrwzutrrrfpifrairfutawrpjwaifzpatazptfizwtjuffztifjzpaaifwrjirfrwrjzjwfrpafwwwzarizzpzaffrwpajrtppawtfpapjtafwupprzririjffpjzjjrffutzuaaifzjtuwzaipjriattzrwaaujwiiazzzjiffjwwitjzwauawijuaazwpzwrztwfiuarwfwizpaiwzjuzffufzaaturffzwjzwizruurfffzaaptawarrijjitrpppprpfiuwwtpurwipzrjzftpjtujpazajttrzajuzjtppufawzuzpruuapruzjuujjtawrfuaipuizipwjfuuwrtfitrutpzaauzjiwprufrzrjiurtapjfjtwpirrzjpiwurzfaaffaiptprtajpfwrafjiprujwwwjuatwirpzruaztfpzuwtpjjiparitzaftfjaujzatirffituttizazprzwirzjiujwffirpwwawzttfjiuiuaaawutzrjpizttaptturwziiafprwjjpaiajwfwrjzpwjupffatzpazapaiwapfpiwjiaurwjiuwirwffaairuwzzfzrtpwfzwripufuutjrzwzjufwrjtppiipfjajfpufruarzuarpwpfppwzrtrtaufwauuiazafzjjzwtrzpzttwjijajjjtzptauajtwptjfrfiupifzizfzjfajjuarzruajupiarutpwfwpifztrjrrtppwruzurrjwzfujtiuzfwtwjtfupjwjiazfjziwpzftwuprjapfizuittzjrwpifrpratatufriifuzprfufujijzpuauppjwtzzwfzrzrpupziwrwtzuitwfrttwjrfrppztwjizfauuaptpzufarpfrpzpuzaiwrjpfjuiazaiifruwuttppfatjazuiatuipujuatzzarpifuitrzuzarazfwjrtwpprrjtipzjjfpwzzzizifjutiwwppwiffzzwzutrziuzrppufjifiwjpujrrwtjzwzipazruautiffpwztrajauzftwjzpafprrfpjaaruuutiwjtuzzwpujzprtzrujawfwajaiipurpprfrffzpfjpiuaipipruuaiwziuwiaawijwzftturtirpaizuappjitujrutiifjiwffpifufftwzzwjrpzrwifppttrupjprtttaufitapztpuwifawauaiwfurprfafpwipzpttupiafpwtatjtjfiirfufwizirzapuriztwzzuziiftiwitzrjuittrrtwaaiwutfpuwjjpfjawajpptrpzrzuzfzrfpufririuiaaatiuriiazfizaarazzupwwawzuuttzuffftwjawjftzftijajtwwtiujtpwjfuijjjjtiupuptruzfiizzpjpitufafzzwtawjuuprpfwrpapazawzziaarptwafurjzjrjwwuwuuzptwrjfwttifjrupzuzijwuzjrutfawpfwiuawaapifffwajptjrjjfwjiutaurwwfpfwifrrtrriiuprifffjiaipripuwpirtzijwfifiattitirftfwjwizzrrfwppwaawpwpjwfwtwaawuiajpajzawzafrarrztaiufjizawapfurfurpptiitwwpjtfuuzrfujwpfztzrufaiwftztizzujrzfujraiwwifftzfzrzujjfufajzuuafzrriawiuprwrjfwuipjwrrziiffuaizfwjturfuariuwpppijztupjaifuzztajpifttptjzrzaafuurzfjpwrzzffrarjwwirjjapjauuipfufitirpwraraujjztrzjtrzpwjjfwiziwtpztuzzwjupjiifwiurwziwutfruutwiztrifazapfijafzfiajtuparzupupwaatiujujjwrurpztffitziaftfaptarrrpjtitfrrjitttwwziifttazjtjuztjwzafuatjaffwaaapwfwpzizitttwjwatjjfzfjtrujarftrrwiwaafppuwzjjitpufttpzftwzzupzwrfwrwpptiiijzizawzrtijwfztfrawatffpzuzzfpujfjjwitpaparfrituatjpwuzjjipupifptjruipatujppzziawfpapijjjtaritzuwjufupwwtpjtwijfwrwtrprptwfpifutwzrautifaaaiizzpjztzwuiwwrripjjrfjwrtzufjjzrtfuujjjwrpjifazjujwjitriuztjuuzuarajiztfpatrpuitwfjipwrrttzftwtwaruifrrftipftapfwraafufaatzjwfiftzrfajfppiirrwtaptfrwzrfwzpuffuutwzpuujwfjjwzuawrzpwiifjutatzitwtrufapfarfiurrwzjppzzptaitzwafzfiuzptujwpuuzfwzitwjpzjtjpiitrzrfpwzrwzpfzfzpattauipzutfufzprfupzarwrwtpwpfjtjwfjaatizfijipzzpjujpzawupujzazwfatpruijzpapjtzuupwpitawitjpfziztzirupfziaffujttzrftiajwwitijuwpawzpaiwjfjaauwftiuftpwjzftwaijpzrirwzizfuwiuutzjufprwturiituuzijitjpzzrffaffuttjzwwpzirjzraurzawwfazwjuizfjaiifpuiajrpjfpurrrpprzjfiffzazpjjfpfauzzaurifpuiwjzwuzuwafjwwifauuwirztjzjrpftrjputwjjwrwztpjuaijzwjufrrffjarwuaaitziutjitrwrjifwitawtijapiftpppjwfjtautfjrzwrppriizrzptjaprwzzziruwwrajtutufrawtiazfruzrpfuattuzfwtpujraapitipzpawpjtrzafazftpiiujttazpfiujuajawpjfijujpfafuujjuawaufjffruaiwazwrijwjuwizzwuijriwwraruupfiauwwatujpzapawjtpjrrjpfrizrufwaftzwuujtuwipawpfzwpaftpfwztwfzajwfjpjujpiwwpriwpprzpriztfpaaujrjuwiaptpaftzjtaufararptpaprtrztzwifzuzuupwrzfjrirjuttafrawpjwjrrwjriftpfwwatwzirauzuzwzutaaapfujtfwfjwwzujruatazuwttjrppjjjztwrtpttuiuajrrwupwztzrirwtiptfffprawpwzzjizputfjtfjuifrpfauiaijprzjtiuuufftutwiipjwputiiuufwuawuufrfajuwuzwiupzuzpjtrwtufpffppwuufujajrazuzzatiziifarizturuaztppijzirtwuujtzuuwjuratjffrfjtrjrppiwtjfwuwrjipififjatrpwrtufiwiwiapjppjwajwuuuiiapppzjuwtfjiuipjfpjpuwiaijfiupjzipfruawfajfipiwtwiutafpzwtiptjaizpwputatjfftjwzauffftrffruizjtttjizfzjwtitziaizftfpfztuuzwftrjatfawpptrpttttwjzwzzuzuutwtrtrrfuuajjrurairppapuijaipztifajifrfrrtairifrpfzifjatpatizpztrzfpurarutztpjwipitfwpiptfrtawwupzzraiztwiwittzizpfaffruzwpjiawwtfrtatifrauwtpupurpwjrjwfwwjwtaztafftpfajafiitfztfrjwutuwtipafzurwpafzzpjtfuppurttwpzrwuprzwzujjzfwauzziujzuztjapirfttpfujzwtrpajrwfitupuuztpfjwpatauuftrprtufruwfwaupjufftawfawuzjjiuzzritjrwfapiitrrjwwuzziiftruzawuziuarazuwrauaujztwprrawapwjwfjfiuaiifwuppfjwaftzjifwfuirzjtritjpfjwitaufupfzpujjijztaufrzuttzuwapufjrzwzjapftrtiurtuttrftptzairpzujiiirwfpzprzpujrupwwzuatawtufuttzfujtjujaizjztwfautuzwiufauzpjpzautupjrtruartipjjafiiprwajfzafjrujupriuuajaraaftuiwpfuzrjaifattizpifruirtrrpattjutjurirfipftpupazjfuipiratfuftffffjttpurjrftiaijjjptaaaapifiptaafzpipiatprjrwfriipzpifazipijiawazwatpppzurffppiiawpztpwaituttwpzuwpfizzztpzzirpzwptwtrwtpzupirwpirfuffurfwwwtawjrtptjiwzftjtjwpwrwjwrrajrrfiwtpzztrzfzwtjaztipfjuzapptppuuwtjwpiartazitttpwaztuaufttrjpawiwpwzfiararwrwtwwwipptirfafupzuajzuwzjzptifrittwfuwzrijzatujjjzwrjfwpzutpiauwujjjjafurrtzwtajtrirriufiafzrijuafaifjiuwuijjjfatwzpwrwfwfrrrzfpaifajaapzjufiiautzaawufartwufufiaipapwuprzzfpairffftjtrpffwwtujzirrraufawpwtiprazawwpwfttpfjfrjutpiutfzrpzapifpatizaitiuwprpiwrzwptfipfaijjwirwfurprzziufrrarwjafrtujrzprwrpjuzpiwttfazppaarfzzuitiiapzaruzfffrrzpjrjwiatuijitjwujfrriftwrpzzfuauwwpaapujjifwrpuuwtaawtwtupwiizzipppuftjufjufjfwwiafratrfijjuprpjuwfztjftztpitwjiuapzuuturazriwtartwprfffiiuitaffwwjitaiiuwwufrrujtupruwipiifjztjwzitffppurwijzwzfajrjaiarawzftirjjririazzrwfjpafizztrrzjitarizwawwjziiztrjatjipiijjfjarwwfaiaizurtpwwzzjiiurfutjzpairtfutziiwiarpwtffiprrwpjipzfafwwptiajitaafiuffiuuujzzzittuzazpjrafturwrutpfpairupjzapawjuawjutpatuiupzpwiwjtzjirjjujfwrfjawpzppiarfjwfzpwzrttpruzawaprftfizfazfzifzrtztaizutupiattprzfrptrjptitjjjajuauajzauprpzftfuaruffztftitrijzppuurfuzaupjrpwfftwwizfaaptiajjaprwprzuazzpuwrjrupwrruauwrtaupuwjjpzuptipzzrtzpjuifaztuijzrffijwitattwprpitajtzzrtpiiuripawuwpwztzajttizfjzjpwtpjuuzjtrwriauitjupwwzajzzttuajfjrtftzjzfapitzfjzpzjwjfzitzaptfppwiwtjizairapzzautpprtipzuizjjirprurrtwfraizijjarwtzztzrazuurpitrrriujwzwttatwuufirttfipprtfrfjtjzafazfrzjjpaiazwfprjittafwfwwprziwzttfzriuuzppfwtfzjapfpaarttutazfaitijpfafiiirurrffrwpufjzipripjajputftzapapwtjtijjifjzpjrfjupafjufziapafzwjtzrjarjwtiazjtzipuujprtarztjrwzwuwujptafttfftfwazrpuifjzwuwtjurzjzrzazpipwajpjrzjjawptazfurairpuprzrwwwtwrjrtutatpaziaawpfipupppiwpwwrupippzuiizzjwiuijfwzazzpwipiwawpiiwafajriwjzrwtzujattijzraptwwitipatwfjauzzifjwjwwwappjfripuiftrptziiwziiptiwzirtapwifiupfjurrrjwaiiirwftzzpzjaatiftzapjziprwitjruwzajjtijauzazizprazfaztjtijzprfwjfrujrpwwjupiuijratapzaiufapiwzutirtfaafpazrfrapptrruzzuuarfrrrfifuzrwfappuitjruurjiitipuwuwaifftjjptuarauzaauuatrzfwwzpapzzrzfutwtiuaruujitppprapjfppjawfpiwztrarwarupfuutappjwpufujirtfzuprrrtpjpfufpipjiftztfrjaifjuipipfitippaurrutatwwifjrwjpapfrrjtpwijfizjwjijawjtijaajiwjwwjjutapuuuraiutuzjrwwwrizpfwwtfrtffrtwptzturpftawzzjrazurpzwfwzzzrzarppjifzppztirifuffzpiiirauzfiajfaawrfaftatzufapfzjrfirjrwfjawaruupifwzujpwzaupjtrwffuiwjftjpwfizjztjptatiifuwtwiprrrzizwjjppttaaaiwwjzuztfztprjwfripzafarariffjwajwtazitjzujjpraziiiwttupwpitiarziwtpjaurritfrrzfjwtwwzppjfjwwippujuzpifzwrfjpjjufzwarfarwjuuajwzpppjpparuawfifwfizpfjruwrwzjwafiprffwwztjuftupriuartwtippriiawtiauwitfjtujfawpfrjwjfitajjzwfuttwzpiuttfjuazraaafwirtiptziaawufuuipjjijjitzwiwjfiazzftaftriwfwapufwupwijiiiutijpjjriwztjituuprjzawpzppiiwfzutiwjfutfrwuzwpzjtfftuutwfrzwpuujfpjrwiprjrirttrurwaraiapfpipuffrfzjritwtatjrwjprijzajatprzfjuujariaiizzpwujjipjwtjwtfiffjpazptaarfufuwjjfpfrfapajitiuzijfwjpitiwziafittwuauprufapfujzawwrfijrpijtuztararutppjfppirzfzjwpjptjfujppirtuaiftfjwutjwfwwawijijujizpzrwiaupzptpziwaaiwiwazfujfitpptjritirpzzjzrruitfuupftripwjzjfirjzaijzfwprrifrupppwiupprufrppfffjrrpaaajuuwzapwajapiizizprztzwjjfwafzwiajtiujjptawfiraptrprtrwifzzrzaizwaiufwufrzfafijatpaafpatwpzwjpzzrujfrjprfarjttwprjatjfpzijwrujrjprutwfuppirjfatirwzzzjiwuwiuwipwpatwpziriuparzjwrijapapwwzttruzufppzpiijrawwzpiatpwuawuiapwjatrwzjprtzipuwjirjujaprtauwzwzapizuarzrwjfitufaztzufputatijtawrztjawriipftwtttaftpjjffuwtpjppwjzfupfrzzpfjfitjrpwirwpaifwpjrjjrutiiitjiptwfptptzpwrpwtuirwirzzwwujfizwjrruutpiftijujjijjruiwtfwriawrtziufrzairtpzzwpjpjaizrprawaapjtifrwzazuzwzpzrjjriiuijwpjiiaprwuaujpwiurartuawzzpufppfzftuwfprzzuuijirwwifzruzrjiujfjwtfjuwutjpjfrjirtaaffttirawijptzajutiiiwprutajjazjtfauptfuziwuuizijwraffpwwwwwwaafzztrfptpfatwpzwrrpwffufwpjaaptatpafwrrpuriwriajfaaatruiarrwzpufzzatzpppifaurzippwptaritizwaapuajzjzjpuwpjppurujfpurftwrptprpajuiuwraajuuatwrfjarjfatrutfjwjjzrtfjaiftpwwwfijtufirizuftpptitpfuipijutrjjraptuzptpwufttwttuajatzrftrwaarwtfzpuwiaprfwuwazurwzfuzurutfpjruzzfautuzjtzpjpiziawftawizjijwtirjapprzatfipwuwjzafwrwjzuapiizizfrtirfijawptftaujapttfaiptwjrzzzpzwpuziaiwpfzaijpitrizazwtrwtpwuzrffjtjzwizajapzrrpzpurjpziuizftzzprpfpiirfrtriapuwuprrfiztziattuafjiwwippprrzupzrtuwrzappwzwzrujapjwjzjattutzjifitjupriiazfparuijuzuwapuauazpzjfiruuiwtrjuuwtfpjpziarfiwwutjwzzfrpwwizfuafippuiupaffjwzztwwapuirpwjparzjitzauzwzrwzpruzjpiuiuuruujrfuzaftpwwapuwitutrajtiizrwttaruwzaipprtazpfiuurpajjiwfjuarfuwzirjirupjafruzirjfjiwtppzuuaufartjrfpiwiatfjrtjptruwfufjatjtawpzwajffjpfaitwjffjpziiawurzpftrffautjrrfpjurwwfftitrjufawzrtajzwfrzufftfwwaaurufwirtfzrfjufufaijatpiirzzutipriwzppittifjffrfjuztziapairfrzztpwrrjzzipzzfrujupajwfwrpuufpzwufujafjjuppwfjzziprppzpirifpzaawfrrtuajutwiaijurawrpawrffajptwfapprzffiipruatarapipwufpzwiiwwzftjpfzjppizfpiijitzpawjwjpupjaurazuiujfaazpprzfzffrztijzttffuupifztritjrzzuzufzauuiawrjwztarapwjajffffttjtzzuuraraitijtijiuppfarffwuazjzwtuaarftijawriftfirttfwppuuarwfujtrptztwfirawfrwiwrfufpwzfwprjjiururppipriwawzjwtwtawziaiattjpifjfpitprzjfzwritzprpuazfwwttzrfjwazuuratitauizzwffawwwfttfwwrtjiizafwwjtjziwriuaifzffwjjwzjrauptfppjapzwwarfpfjjfjuiftfaifujpzfzruwwuiptipfwjfjpzurtjzuwiauujuzifrputrzuiurpuitiizifzjptjazprrpzpaapztjjrjjzutarrjftjwpfaajafzpruitffjprjzrtuffwjjprwwwttzztirpazzitpjpraafauuftpjuzjfwpuritwrauwzpjurutaffjpuzwwwuuwuauuapjpjrwaafpjajaitzjrfjziiwtfziwaufjraurrfzaafzurwifuiiiuratiiufapirrfprttutfiujrwifziarpizffrzfwfiuappwrfztizfpjauzafjzapppwwjpfztritffiffztatwzftapwpiurrfijjpztfauzaiwzapprwzrtzppiuiwjiuzjuattfjjrzrtitpjpifauwiirzuftwrjfwzptawzjuupaawtuijrfjzafaztpazrttuiupfjjwjppruaftpttiztptjtaifpfrjrfpitizujaiijfzuapfpiriztzwfpajpafuazriuirfijtwfwuwaffitfpttfwiwuppfjwwufpawaajpzujuaawrjpzpuwajjwzffztaiwwuaurwuiwzwtrpfrtjurppjfwfjrzuaatrawifipwwrttzztwuzjzttutwwjztafjffppzzwjjiaujuzatuwzajpwwpjizwjrtrpiraawauiiuputjrjutwfazpjprptpzwtfitiuurtpwiwwzpppirawuupjpfppfiprapzrttptjfaurafpttjaiwfuwpuawirwtawfafitizprriwzzzuizwwtrrfzzjijiazrpurpuputattjiwjauarwiautrazrwzwfziwtzarzfiufjfppjpjtpwjwwziafzptrfutpiwiawuwuizuutrirupppurajpujzpjurrzuzuzirjjtartttajifpzirpwftafzajufjiizuruzifzztwazutiriipjfruwajppizwfjzwiwzwiztftuiwtufjijtrfaawazzrtafwtujzjiazrriuitfjitrfurwajrufiwzfftwirtuafujjrarrpzawtazwfprjwzwfaajzwrprtptjzuturwatuppzjwjwupuzwpfiijjtzjzwuzjazprzawjwjiuazpiruputwuwitfjjiruzawwutuaaprajrtzzjjwazffafiffwtrputuutjtizziwitzzrizjzajrajfurutwizrttjifzuzfappzufatwzaaitfjruwrfijpwuzarfzipztttrujrzparpfaajutirfapzrtwtzjffjwtufjauwtaratfattzuurajwtfwjwtuiapparffrwapiujwiiazuawitpaprzjfiztpwpwtrwttwzpfaaaarpwjritwpriziiarjtfpujpprpwjzttjittwwwjjfwpwaifjjiuutzprfwirwwwpuzwrirjjjzjittrupzaartfawttprruarpwarrfutjjjiutrtzizuzratjjpwrzjfzijpwzriatuairfrfafpjprpzaiutrirrriwtajzawiuarwutiwizfupatwiauiaiwatjzipuwtrjprfzztfjztuutiftjtattfuaupijpiawtuzutirjpuzzaztzzrtpzjwwzprrzwzzutpjjiiwjwpwuwwtjfwtizfujrzwzfatfjipiiruwwaiarwrtfuupijjijjpazawptrrwffwfjpjjawftjfjiuizrwappfwrrtiffupzpfpututuizrujwtpzrpzajuwuzutwipjzuujiwtzajfijpjfaijptzazpujrruawaifpzuzawtpjjptfpppzjtrrftwzjaripwjujptziipafjfwuppwrrfffttwfwjwtftpuffrfwrjrarfrufiprfirfpjaziftrarpiupiupiwuupziijipapwafprjfpftprafzfutptffpjpwzuzpafufuztzztapfpfirzartujjujjiaipurzfpfftaiauftafuwarptriapjzpwjjppzwaffzitwijrwiuiuffffajpfiwwjpuiawzutfrirtjajtwjifpzizrajarrjtwjarrtrwizizttrtppfizwfiipiaazwpizwjtpwuaftwpaiijifupfpuzajjruarurwjirrwttupiffpifajtwfrwzaraitjzrpwppatfjjpuzjufijaifwfjrtpwufpruiajfjzzjutpiirazrraftttfwzartfjrawwujprazrpjfjiuaptzuitazwizaarziuuirzurrrujpuapujuzppupiwupfjwrjizttjfaijuittuwuaifjirztuftiwzuttpurpjzzrpajtuzijjpwpjtrwijrtzfuwffaaftfrzafuizzzzzrpzjturirutarruwzwpfpzzwiipuwafzuazuzpifapizrpijawzturwpziwwujrfraipiuwwrfitpiuifpurputirtupafjiuiuaaaaffpajfuurjwziwwrprjfjtijtfjrjfuwjatjrupafrittpruuzpwtuujwrjarazafwizrzuwpfupziajjwfrttpfzwpiwautfatpwuipwrfzfpwttarpruiprfzrztzffwuipjaiwptzwwzwftuujuapfatapjuztrjaiiwzrtjaffaauaiuiiaprzprfruazattfaztruwuwfafuwwifwartiriuiupfuufzjfijjpwrrpazrrzraarajaztipziatfwzptujjzjijpaattajfatajpuzppiraitzffuzwfzawjifwaptjjppfjpururptirpzwzzpurzzizirrrttwzzftjitfprwrwwppffjfufjfzatrwiurtpruwfrfaijjpaiprizawtuipuuaiaiujrtpwtpztpwzujafazjafuzjfijajzzzfpfutfaazriuppfjiizpuaiuriwipapurjztjafptpztpptaprffiuffzizfrifiwarrppwjipaaiiijffrizjpjjprrprprfzizriawafrzuazjjtjatrfpfizawrtuwzatzazupruratjapftujaprittrpjiujwrjiwrtufjpztwzafiwwjwpiztzrufrrtiutzzrutpfwrjwiwrwiurzwipprijrruizfppzfrtprtptzzutrtjarrtuwturfzjjwjuuafzzizrjzizjwafjfzwiwatfjawipwfurfiuaujfrtjtwtauiwtjwujuuffpjawrarrzjttptfuwtwpirjffffijjiuriaupzaiipffftfjpfpujiifpffpzpuwppuzuarzuuifttzjjrraftfjfrrzjftpauptttaitraifzzaaupazifzjftwwruftiptrtzzwfftrzipiauipztuuzjiuttiiwwatafpjrwpapjptfjpiazrwajuuzawtziwriuuwwazaiparazpiirpwftarftawzifuprrratifwtzfuuzrzrrrttirpwwarrufjjpijptiurartrttwtjfwptwptjpjujuzpirifpauraiatfpafzaafzjirtfttrzipztpuwzwjpzfizpjufftwrzjiuizrtrzpziftftwtrzazrpfurfijiijtrwfpajzuattijfiawzwfifztpiwtuwuwjajutipujtzttujrjawpzfzwrptjtfrzauawzjtujafraptiuraatfwwwpajzpzwzjazrzupaitppitfawpuafjftrrjfiwfuziftrzijjtwtazjrrjuwfrztjpuiaaurirujjzftitwiifjwziujjfrrppwaiuujftzitftwwjrpfzjwprwajiirtiwapjzztwjzwzfufuffijzrjpwpjfptfjffrrappwpazrafaztjfjpttaatpaiwutfjrirwzwuzijuuwpttwuzfpizaafijtuiwfjwratwfjftpfjfaauuwuarruzupiprrizfzjztzffwfffzwarzwiurpuawjrirpiuwfaftrjauwiprwjirtrjuzufatzzaztprwtittfptitzjawwrpzpauirazttupjutiwwjpfffrrzppujtfpjzzuuzrjrifrjwfptriwurtiwatapzafatfpartzzzwirwujiwifuturwjwpppfaffwjpwpitjajiwptrjjujzftwijjrriuwirjitztwizuzztjiafrtftptiajrujajfwwufwwztiffzpijrurrjwiftwaajtfuwzfaurfziutazfiiftjirziiipzttuwarjzwizruwfiwiaarttjiufpzuzrtjrwitzuupjfuitruarwfrwtaiuijwaparjuiuwztrjfjrzrfrpwazppwiwuutpurjiwjzatftjfaitpzzrtfwwpijfpauuariaufuzpjrawaajapjzuuzjwjrpupfaritpfawjpirzfjpjfzpiuiatfapafufjfpwttfuffijiuwatpfairptafutfrppztjzfjtzuprirzfutiaawtjptipfpzafpruripuipaarrtitpuptfuaffrfpaziajrwttwppirjzfzuauwafffwuafaarzijzifrifatpwupzfpzwutufjzwwpjtfttzarprtafuuzrirtjurrjuziujpwtpprptwaiipariwpazuafirfpwjzurapwufjrairftftpjuffifjwjwrfziutfrjpptpwpfaraizjzawfiipuirpfzttrupfwippwfzfarwzrzjfufjjpiwiajrfauratitijfwwffwjufrffzjfrttjwaztffitjtfjazzpzzppuftptfjrrtafwawafurrazituujtwtitarftaajwttjrtrjtruiwjzauriijjjjfrjrauwzfjiipzrartftujizpzijzuutrfrizwpittaufwfizfziappaaraiwjtzuaatptarfujzprptzpzwjfrijwijupawfjpfrtaiffpuzwwjawpiraptfpifzfjuazawpujjjjiizuitiawpwtjprtatwazrfifapaitwprtuufwtwfwjrraaaatiarpjftrjwprjaftziraaiajjrftaijjfrrpwwawfzwzuffirwauauiwiiirjjzutarrzriirprfzizzutpafurzprfrjfifjtitjritpfuafwujiuwuawauirzrtfjrupuaujjpwizjfjtrjjzrrtfwazzjpzjzprpfifzjppzujwzfuafwpfwjzrttirawiwrjarrprtwzpzjruitwfzipawjzattrujtztpirjawzwuuaiipfuppwzuazttpwatptfraiauwtrwfwpwuftwatufapffzujazzuarfprtwuppwwurptfuzzuwapputirrujfirwjrfprzjtirrizrrpajurfzzaapuuztazjjzfzfjrujfwruutrriauprpjwawfiwzjjzrpjijuwiuitiutwattpuztitaffizfzjzujpwiiufuatpfjwizfuijffjfprzzuzpafaufaitwauiuwuzatfzazwawtzjtjpwrptfajzfzuaputaprzpzuatutjjftwrftwwprzrztjriuutwzuiptzrwwuurufpajptruarfiiftufzraazptfautturpwfpzjwuiutirprpuujwwwzwriaapttiwjzjjzwtipttupujtijtptrfupuzfpjwfatjpujuwfrztppauifpfuuziiutwpfijpfzjrpfpjriafzppatfjpupufpfjfaaiztwztftfrzarjwpzitpppprrriujppwttiwpufpiautuppwzjtjzuufrwpwjiitprttuirjtupiarjiirpzrtpwpturfiiuwiiijpatuzfiztfrrjwuwjfrizjwwwiiipzpwjfiifariutitpptatuwwaiuipizfpfjwfjaujwpjwtzuuwuurrrjaftrjizpafjfwuaiirjaupaajwzafajtiwrwtaupprrpffpiwaurttpiwiaaiwzzjprpfzratjijjtpzufupffrrfpzwrurujjtrjtraauupauuitiwfarizaiaafjrpuwpfjaawfrzippwfrifzrwpfzraiipitzpjtzfztwapaauiapauuttzrazrtwpjjrffwjfrjztatiifuiapziatrzzawriffijzptawtptztiirwiautafrajrwjipzaprpzptppttjuiafirwapwrajftzaifpiizzpuffaffjwuwiajwtajtwutrtujjtwtruuiwutuaawuwatjwrfztrffrwfupiujfrttupapuitrttiwjaazriawzzprziwazrrtftzwjrfufprwfzizaijpifpprrwzfpjiaiuzaajzjfijwrwtttiiwutturwjwjarirtzwwfuwiijzuwuifpfartpujuwzfpatawurrzaitjtftpzjjrfujrjuariuarjpjjjjwwajiauwwrujutaapujzizwjpwizutrjttaptaifjrjputjwppprzzrfpijajipupjattruiazjtfwputfwuwttwztwjfftaaufpitffrjtriajiauafarujtjuwuzwfiiffjrtjwftpufwtaazrffjrijrffptpufjafiwrwrfaruzrrztiujzwtiifiuaipupruuiujjupjwutiffjfjuwpaawrujrruwfwjifrffzzratajzapipuairurpazazjuipzzrpfziwztftzfwwafipfpziwzjupjupfziitwpjiftrrziirrjiptuwtaujitprzzpuwjfwufttfzppziizjtwufiiwruuzpparzzaajtjfzjapuiaijztatziwfiuzjupfwuriziztpzaijiarwptzpuauzjiwjjwaiurwrarwpuaarfpitafawuiruarufprwtizipufrjtuiipupzrizfrjzupfzzwuptjjwwzrwwztzutjuitapazpprpfwifirfrrifjpjijtrupriifwwifriaapiauzjuiiariprfuuitazwauztzawwfupzirzruzrrfiauiftzfzpfpwtwaiajtfrjpapwfaftawwjwaftpuawiiiurfpzrjwriwziaufizjataiuatptfpwptiwujizraiwjjuwuzafpptjatjjpuaiwjwiwrfuuiiziujwfffjwapzafprwruafiuzzftprruftzzaapriuijrtwizfazujrtrawrraarwppzafpaitzzwzwuptrraftzzjzrttpraffupzwzztfpaittwfujjztwapztzjrtifaaptrttfptfjwrttaatfzauwiupurtrftzwzzitpruuzapippuwzrptuatzjttfprufzzpiiztawtrrtazjtufarjaufizwzwaupjiwtifjzitwttjjfazwupjjpujjrfztrtjazptjwiptjtzwwawjuirjizffjiwiapzrjwurzfipaaazizztiziiiwaifjfpjjizpwairzwzzrzraftzaajfipujuwppjupupafatarjufwjiiwparzaifuiwfwufrwiwwjurjzjfujwarzwfuppazpzrpauzijifijafzptjpjtfparuipiwzwauuajfrwjtipwrizzaipuwtzirwujuiptptariirrwjajfzjprjrwaprafzzutwwizwrttuuzuappfuuuzfpjrzrjurtptjaaiipawrpipjpjizpaiarajpajiuirtprzzjzitzfwfwawppwzpzazpwrjaazuuaffifpzfjajjiuajfftuztirtrwrptuutffjiaaiupzftppuizijuittwrarjijzfzwprwptiftpiijiwurtipiiarrwzwzwzjazzjrfjtpuiturfjwppfzttiitrafjwzufiutuijuzztutwrjfzwzttiuffattajiptajpitauzipzjuuifaipfrfwttrzjrpujipijwfrjjaaiuzapzaiairuuirpuwtwwiifpjzaprzpjppazjujuarwzifjjpprpzjfjjutpurpirpffazpfzijtirtjiwrifuawtwuftupffpiptzwjpirjripjuatpwitpawzupfwjipuwjjrtzfiipitratzwztzujfzwzztwziuitjuppiffjufzpajizfutpzazawwzztwfjrzrppjapzapprzaijiwzjjtjijwarujjtppujpaprwfutzawwwwfuwfwuajizrjptrztrwruaaajpjriwtpapfzpruwwwfrwfafpzufuzfjfipjjffuzrpftfujfifruatuwifruazizpiztaujfrzftufpfzapuptrwurujzujrrjiwrfrijijzjwpwuatzuafptiarwpirfiatfjwaaitwfwztarawwaazaraftwzrzazzjujujtuuwwtrjptuaiufwttpaztrtrzwwwruwajajarurijujrwuriauuifttatprwpirtprwjuuattzajuztwurztjipfwirfwwrwruztautjzzirifriuiuazafaujfruwwjrazpajztrfzpiawjauiwpiziuzrurptiwpzftzzfpifaufujjffffwiprjrjttizfpjjrazarwufaajpzrzpiiarzrwutifzttfapjrritjtjzaritrajptzurzpjtauifuwafijtatzrfajzafffwiituwirutfiztiwpuzftaitzjazarrfapwajjuwuafwfjjtwwiritpuftiurfittzatirptfiwfrjtjartwzwuwzrufizzjfztpjtpririruutfjtizurjtfwrjtjzurtjztjprawjwttjprirrzwpafujzrprffwwwtfuutrijzpzuizrrzzpfrfairwtpzufwrpajjaariiwjzzptwuutwitffwzzzazzfazarjrawfjtrpjizppzwujurtizfiaarpiutiiwjrufwizpjrjittaatfpftiztfjzzjtpaajfupaajwwzfazfffuiziwuajfpzzrzuiiupiiupijrjpzarfufziafzzpwjrptirazptpuutirfjuzfzazuwiaapzpajruuitijtatjiaftzuzapjpzufftzrwaaarijwaupuztwurfrzfpruwiwfpzaiwtprjaawrpzipttjfaaijpwzifpuaipwtuwujrtfjwzrjwitrwauztrptraffztaiwzjzwarziupwwpawiuzwiraujitztttzzjwrzjrufwruztiurpfzatjzjjwzptziawpwizairwapatujjaruizapjtrpaiwajjjwuaujffpzwzzpaairurpwijwpzujiprpitwuirjjazrjaiwuztajfrttwaffiawtwpwwuruapzffjwajjtujwizjaawpwawpiwrutzfpptfjuzruzuiwwfjjirupttatafjrzrtzwitfpazijtzjzrjtpitatziwijruzfprpaffztafirzzfiftpwzafparwzrrpwartturzufatiwaijutwfrjaiwjjaraaiurfupjaijtatfzrtwjjtiawpipfutjwwrpfuuitzppzrttjazttjujzriztrruuwrtarzprwuujriajuwupfruiftatpjzwpajafrtuuawriiijpaiffatuizfjwpujiffjtaprzrwztpirjfjtraazjtwftaupifiuwpwwjfufajuwruwwzzrtjpztjjijiwjpwafzfjtuwriaawafjawzawarjpipjiuzifaufrijruuwjfzuwfupzzpujwzfrwzrpiarzrjijfafrfazipuwwitarrzirjjfirzizwajfwafiprjiwiftiupjuwtzturzarwzfauizziwrwjzupwzzrjzufttifwuaufjrwjupzuiriazpzpffpfzatiitzfrjtiippuutrafawpupizturaijuurrptiafjpupjruujrrrfijftfrwituwuriifitpaafzfpapawtfriaartjjaufpzuwuuwurtjpitwpzrjipjrfwazrttzfrzwuzfwfuwrwjraiawjupwzujajjwjjpzujtfiaurzafwrwizpwzaafzujurjtprijurpfzrwjrzwwjjutuarjiwaiiwtprajrwuatwjjaztujzarpuptwpjzizwuirtrpjtiariauwiaawzawtruifajfiuafptprwtttujwpapuifazrjptffiftirrfafruwuwjwzfrfpjttwzjwwtpruwtzzprawirfufiipzriiirwrpjfjpfupirriwwtifzzwautufrpuffjajfjfjittfwtffitzjratuuwwuwpfpwturfaiitafatpiipprztzjttuwwiiuwurzpjuzriruwaiiwfzfjzrpufpiutwwwjifijajwjffjjaijjfifwiziupiffjuuijfiftutzpzfzpjfuaifjzzjtpurfrzppuauprrpwrpfjawpjuuzrfpjwjiaptwffiwwapzwiuwppziziiwrfuptuarpwirptfzaafuzpruptawzziutaiuwazfpwwrftjwpjfifrprjtjpawuapzfiwrjjfwzaparawjufzrfzwtaatrpatuufzwiijwiupuartpiwpfpwitjffiwiauwpawuifuziazijjjwiifijztwrapwrptjtrpizzppraiwftptrzzfjzpfjprfttfuuawtffwjjupfjpjfwwtwwjtfajuaiffzajartrfuzfrwauaippzurtpwuptjftipaifuutzrjujajzjtfjrfpatprwppfaufaftruzzzrrzijjpttupzffrairzwaijwartfpajapuautfuiujiajttfzpprtfutttppfuzzjuitiarwfafzftzrrazipapjwzwurjrjtufzjzpprfiffwzuzrtijifwjrfaaarptiuiiapiuiuurjpjafafirufpwpffwtiwpufzjtjrrfruifttiffjiraupafurpiffrjfttijfujttpatjtrwrpfuutwjaawwpzwrpfrautiirrrfzpwaauwijfjupfzazzfzjziipiartrarawujwpfuzjjtruurwazttzurwuwttjfzftfzpuwjurpprpajwptpwzupfwitfttazppfiaiuzpiapzwziziwizwarjurwftuuwzaiftzpjpjzptaupjajjurrtwfrajiajjaziiautzwzupupiifiptizuijaazfzizuuifwiztwprtwrzufwwpuraijtptjwwujjziazaffrzuiartipwutpurfttzaarjuujruprrjppuifzzfpzwfrtfapjrtfrjprwapwujurjjfuijtpzjaztrafwiaaijiaztrwtprpzwiaaaatppjtwitfrazpffirffuujfzzawzuipwfttfprpiifjirzzjfpizpuitufzwipaizpppffrppppfrpitappatfjtuujtiifzjtwtaptziwaapzjzpuiirfrtjzjifzitaawzufjrtwjwfrprutfufuzijirtuaawztpufwwfzjzptwrjffjiiwtpfjjzfrujfpuwtfuapjtiiatufitpiijppujwippazwjzruwpjpwwftajaratjfwwuiziiajuiziwatftffprrafzjtiipzriufzaipzawafaapfiajwzwwfpzpfjuuaufaarpupuuiwfuuuiapwtuwupitrazzzatjitppjirjwiajpfiawiiwafiwturpfiawuarjjwjziawzafjitpiuiaprwuiutfifrfwiuuutizrrjfrzifujtatzwajaztparrzfzurzwjwaaupzaaatzztfaatfzfrfapiifpajjauptijaizuruijjjrrpzijjzjrwzfftprtuiuwjfpaffftfrifirwtwpapawaizjrruauizpjjtuwjfiazitjzuzrrurzjjwiipfpuwrarriratawiazpjiiwiwpiwiwrjwijaptrrjwpzrufipwjttjfatwauuijrazpiiujtftrwwtiirzarzapaptwfuipipwrpwwaziutrpzffjattziawrjpuzwiufjupzpftiawfzfwtziwwijruatupfztwtiaipjtfwiujptwawztipijrpittiwwjptipjjajpiptatuzwtzjtpzaiwffttifrzwjuaaipaftfrwztziwttiriwfraattzupuftuiifzjrrpapwtwtjwupaaziparittjwftpuwrtjzraiwjfujfptpafuujrrrwprptawjjfuwiijtpppwuuiujfjuufawiiwjuwzwrpipjizwipawaizuuzupjzfwupaaaujazijawwrpruutfwwwutifwftjfiiraattzjaiipzjutafirjrrwtrfurppuwfzuupfiwuwpufwaajrwazjiwzfwppzfwrpjpiiizpwwrjfriapjfutiwuptizjjrwzfrzwzaaittwazatauutittajprwwtwzattrzrrafifappfwwiiritfjawfapazzwzftatizwzpfzrjfjawwtizajrzfpupttrwppapzzpturaztzaaruazwuapztjpfwjwijuazuaapfrruauiizpujrzutrpppazazitttafftffzfajzzazjfuaztuipptfjawuwtparftrptauwufurziapfttwtzuzfuuitwuaffuruttrtajtwtwurzrfwtpajffurprrwtuzwjttpziiuwwtrufuuiaufppijzfrafzpiaaiuzwwffaptiirfappazzzuujaiwjaifwutzfapiafuawpwjutfjwjpftuwurjuzpaftuzwtawwrfatjprjapuziwuauupwitrjrurjpwtprprafartfijwuzzfzapurjzaurizjtippauaipariwfuwftirufpuupwtzjfrtzzfruizrwftwwzaziriuuftrfwpafiiujpzztaatzpjjauiwruuuwzfjzazrwazrpiizziffwrzwiarjuwpaftripazrwrutiitufrftruwfjfwiiwrirpaiuuizzazpurwuawazazwufzzzwpfwuwrwwarruwwrjzzzpartrfrzfwirrujzttrzfptjpzzajttwjtjfiwjifruuptatfuzrtfpiafprturzazpjtrjjrzwfuwwfauzwwjauatarjurzpauitzariuwritzrfrwfraiwppfjrttfrfwpuppatzuwuwujwrwffrritaiizzawjtiwriwwuffwppfwrarwprzrrjtptrftfpttwauizpairpafajpuupwwtwprjpptiuijrtafzwfrwujtfzauifjwwufzurfrapuwwtztjjwjfpauuzzfjarpazuziuttjjputawuuwuiiwjaafwzzjufzjzizjtrprjpwjujraapputfzztuiuifrjjwpziwujuzaitffrawjwuppwwtztirriutpuzrjtrzfufufaituuzwrpwtzwwpwafitfjiffatuiairifpatzfippiiujiztpwapjfripaurjpipuzfawpptjwitutuufzfrtzaztwtirjazrpzjpjizipafauziwapiuruwujjpufjuwujzfwzpiztzazrjrjuruzrrirputtijutaiujjrafrpfipruipiftiifzzipzwjpupapwwiapwuajjtprrpautfjwfafzzwuwruitatrzjifpjafprfuujpzuufauzrwjfzwjiutjjwafuipjwpfwrwrwrwrftwrfffpifzapwpufptzzuuzzrzrztfiwwjizpatfrptpiwiizpiawrtrzjtziuafputirjtatuziiuazuzrpzzuiazrwapzruruapjftufwrzuptufpatupffajatjzjuwitjuztaifrtzfuptrtpjrrfuwuwwzrauaizwujfipwrzzaaffzrzpizztjiiifrtarririzrjtfwzwirpajapwaautttufauuazjjirfrztzupjattpjjazirjpruttfjrrffjwzjpafiiffptrrjfitzuafpraaapuwutptfirwzizptwaujrrppafiuptjrfiriruwfpwfipifpzzapitzfztuuipuwrurpuutrtjwuiwrrpiawtrwjrfrprjtwzfifpijrjzzrjzfizfuwzrpwzfawwrjpjjifuwztptpzrfppwwiwptuputzzpiwijpaauappffzttzfrriuappipufttfifwurzfaururruuwwziptpzifiuurjrfawfizjairafupuwatzfwfuwuuparjafrzrpwiufifzwurzrjarpzzfrtjwatprfufzrzwfpwztpauzwutjffptuwrawuwrpppjatjrtztifrffztzuwjazuitzpiufzjjpapippffttzrwrupjzppzwajztwattpriujwjiuwztijpjrtatpatwjrarjpfpiajaiipttrwazzirwzzpairapprftuwifpruaifptrwuztuzjptfwafarifafprziitraarwaafuuaiztirapazawpawipuujjawrftrruuiwtizaijtfiupuritajjpafuraujzzzppauwrrazwarapatupffjtptiapzfaiwuwrjptzuizafpfwatwfrppajjiiwafappwfrrwuwripafwprrtjtjzpjjuputtfrwuazzjpaiiztjjjfjjwjziuuauurapiuftrziaturjitujuuztwfaprrautittpptttfffujjijwaujirjwtuppzirzijjzutuwarrutjzzriiiiafffpzwjjarztwizwtijutptzapwjpujfrrurraitzarjujiizafrjpuzjwfwtfjuriuzptztaptfwpzrpjtajupiaajrjawjjfwwuappwzptijfpptpfutffjtjippjiairrufiwpawjpwafwwtuwjapzzapjzrfwjzwrjfriwjrpjrattwzpzzzujizjfuwapaizitrpfjrpfpftjjprwazajfuwruazjawzizrrzfuuijarwzpzizfufztauijfapzjwupppatfpujrutjprirfafwiwztwirwjziuftzatizzrwjtrrtjjjptjrfjztzwftzpwjiurfapurpjttfptjuutawurazpfipuafjfujwrjjiwpiufwwzfapraiziwjziaitttirtzfpzpuiraaawfftfjwiwpwrziatrtjatwwjpwwizfzjppzfpwrzftwipawutarprpifputjwjzwtratwipwfajutprpzuzfipjititfaariurrpwzpzfzuwpzpiufpjatwwtiwwpfwrzwwatwpfaaazpftrwitzufaprwtzwrwrwazrfziwrijtifptiappfwrziuuppaijzjjpppwtifatpzwarftifitrajtjaafuuwjijpfiratjwtpjrrtpiijwfjaiuujajatjupzzzuazztwzafwpptpraatzptpiftzfpfzuuzjaizwafpzwpiifafwajjwwppirppprrtuzpzfpjwiwffaptjpajaiippjfpaaipzzuiwwaurtitiuazuizzjjaujwzuptufazztarpwawptwipfraiijfufjrfawutwppfwuawzpfftrztwuwiuatifjutijupfjzftpaairajruirirrftwazrjrtprrfaiiujwwwufiwfwuazapfpipztrauwazawjjjpauuatjztfwtujjjrrjatttftrujjzjtiaajwwajfrzfpuazwjtzjrjiifruufftwarpaupuatuarpurfprjtfrjtptrtuwttzwfftrritrprrfrpjpuzajtiizjaruwrrjiwiztitfwfzufztpjwiiziwtpfrtiuiiwzitaujutptpfjaiaippfwttfatftfzprifriijutuizwiatfriftwrawftzarrfiupjrwfizrwtitwfzwawaazutfrwpiupptztipazfiprpjtpfpawrrtapwiurrtajwijupurzwiarpfwirpjwpjjftzurijzrapjrjptajaptwpufaprjfajujipzfujtruuwtfzrjifuutjzzttzptwppzpazutrfapjpzzatpatwffrufiwwrtzirzprfiujuiprupfupuwwwrjujwzwzuafuutzwurijzfzfftptrziiuupujfuawjazapfarjiutwpwztzrfwauwptauiwtppirfiffifjfwzjwfjpwrrirjjjzuufwztfirjriwpraprtupjwrrwjzraurjpruiuwuaajujtfawuwrrprzpwtuzuajzrtfizaitjijjuuwzawiuzjirfzjutuarrwjuftjzwuftzratajawwrtzpwjapfpwwajupzzpuzupfairjpatfwafuwuarfpwjfppjwpfwptwwtrufwprrpziffatitrwzuptwrjuaprrtfuijfptfaptfuujajrwpapzjzpjizupftpriujujuriwftaafwawrafaiapjzziwjpaifturiprrwjuzurjutwuftpzwtwfwjfrjijpazprzraatriwfjtiizrupajruiaptzaarijzzajtwrfrriitiupiaiarjirztuupuzzffrrturppiwjitwutrttazirputzftptttjirwwjwtfafapwjawuipjpfajfijaawaawafjapiuupuuwztwwrijpriwjzrapuufpwrupupaajzaaurffpwiipujiutiwaifwfawfaazrizizuaiiizfrrawtjjapffajzfziafjrfwpwaittritfruzapujurzuurzfauutwzzijpwuirzppwiwtzfuwiiwfapjjiwwwfrrwwrizjiujuuzztwzafuawitufiiuuzwfaurapuazrzzwwiziitprauiaufarjffffauajwrauwrwjarprwzpufzpjawazartwwzpfrappuafjatwfawipjipjtfupiwrifjapiaaaitzirrapifwupzupfuzzpizfrwwfazijittptjirrwzjaaijufrjrtzjtuaprjpfuwaiwatfturwupazipratwfztijjtzzitrwitfwwijfrtrpaiujrawaurjzwfuiztuiwfptfjiiuztfuruuujjuuwjwruprfttrwaruppjwftrzutartauwjtjrwijapzifirtajwzrwiipawuajfwawrtjijuaijtpwutpawtptiutaztrzwjffptarwftarapjtjujzufwfazpjjtftrprpwwtawuzjiwjizpiiftwtpwwuzrzwpurtrijjjitzfrzfawwptjututuipatijuwpajuzatwapriwrifpaiwwturupttrjjfwzfptfjrprjuiwpjirzawafrtjzjaajrjfjiwrfzawzjftuzutjfutztrwjwitttptfrajwafwfpjzfijutpjwrtjarptzpfzujftfwrtpzitzwwaizjtzuffzfrjiufituuirriijfjurtprutuwpijfrapjatapfzuiiatwtfriruiiaaautffuttwaztrwjpafwrtwwwptwaaiipaptfrrpajapzurfzfzwazriajufauzauazutupwjjtpwrfuttzztjipurpiauauzpjpwpfrzzitifaijjirpzftijrffpwprjjpwpfurafwuiizuawwjiizazwfjrtzpazfizfafwiwffpatpfjzjijptrzwzttifzfwftffittfzruftpwfpztuwwfzajfiiftuajtpapruajtrfuptzwtaiifttaijpfrtuuzfpjwwiffjzjwzftjrwuparpuaptjwazpurzfiutrpprratzfzfjrparfrapuwttizpifjrjuuifpazjfwzfwpjiaawujptrzfjfaifrprwiuwjwwtwarzuatazprztawpwzffizfitpurajijziztffujuwjwwtrftirujzpuufwtzfppiujuwrzutiirpupjuauwauwziuuwtuufrjjfztwwwarjzuzitwutwarriwfjtjujwrffaurzwiuuafuprtruujpfijzrwftwfpppaatfwawpjftpifafzwrartjuzuaupftutriiwfjiarrfwipippiujtaauwuzujiufpztwrtjzittawazuriwjiiizafwrwrjrrrrtrffpufufpwipppwfwfwjwjwwzftapijijurzzzzzjprwziijraitpwzupzawfwjjrpfzuutaitrpairzpiijpzwfjtziaftafizpprwfjrizttwfujuwuzzjtfraziawfifzfwwrwrzpipzfjjuauiptjfpazpijrufrjtwwptazripijirzfzzfptawjwppprjprtffjttwzitwjjiizaauffwazazuwupwarzpujaipjwpwzfprtttrtzazwjriuwfutpfifftiuziarajaptfzitzazajwfjujjjzffiuwtjitjwzatwrzruzfjitptiuaazzrpiwjjuuprjrzwtuaurupzawuiizuiatzurjrwappiuwrwuzazzjfariurjizupzriuzzwppjuaafjfiftwtzauturuuatuzwipzpujfzazzuaitijwiirjuzattrjrtrptpazfrzjzwprfzitirfrupfwitpurttutiztpriztiwaaarffwtrufrwuawjuurwwjfptziaajjwufputjawtfzfarwrjwiitijfjrftazzifjzfipwfitjzztwarjjrfturuaptrjarrwwujrwauutrztpiaaizwjaiijpuupftfaajrwztjpjrpfjwuajfjtapwzzafapwpapzaitfjrztarifittfrauutizwwrriawrtttawpuuziijrwjuzpzatfwfizpppupprarrtruurzpaurzjfpzrttjwwwarjtipztzzuftafriwtwpzrtfafjiawztwfjpawtiaafjiatapzfiarirpftprizpurupujrwwutjapzatpuwaiwttzwzpijzrtirrijaifzwpzruiufiuwjwzujuujzpptpjfzjawpiuppwwapiiuuwfwrpwtujpuffrujaatwitwwfpwujriwwwrirrtzwurtjifzfwajawtzzzajwwaajjjfpffpiwzzfuzzpppazwfwjfrpawpafjifruauiuwazjiwtuiajjzzpttawuputirrwtarzfzwjpzpzttzazfufapaaftifzwwarzprajfffazztpttjzipaftwaarrfrjfpuuijtufuzujpjtaifiwfjurzfrrwpjjrpjzwrujttpjraffaftrrpziruzrirtjftjjiztwutzajprufrpjzuarwpttuarwizzipaaazzzrwafraiufwpuuizfitwipiztawawpjjfptprupuaawfpwiurifrprfiuwwazatzptiarpjpppujwizitpufzupwzitwfutjijrjuffprwzwuwzjzwfzuuwfjpaaprztzfwtiwfazptrfwpjwwppujtpfiairiaiazzjpwiauautizjrppzptpppuappruawajipfzuwrijifattuwiijzrzzwfaizpfruuwfjtprppwujifiwfprwpzutptjzrwztztprifaiziaazfurauwatjjujtauzafpfwttuttrwrfppfpzuwuauijzwrzjifwjzuazftafjfizrrijpirurpupuwatwuazujrftffaafawtipuiwuujzzpuwjwijttifwtfrzzaztptiruijifapffarptjuwrutzztrzrrfztupjjtjrwtuwwjwaraipfwuapijipipzzftjjtawpitwuftzufitzuiauttatutprtjitftfpfrpfupfiapzjwjtpaujirapwfawwujuzifrtjtzjawttwiazzaftftrirfzuipaptwttjaiwrpifujiffazzarprurzpjzujwwiairaiauiurfrwtparjrwuuuzzatitafwiutitiatfztrfjiuurfziriwrupaafpizuprujziaipjirujpijfrawiafwzwaajifrrrfrpzfzjzripzjiztpwuufjuufzptttwwriztftfitipfjfpzrijatapfujruppijjzrjijrzjfzzujuiuitrpwazpfwrfuwurztftrfirfpwprrpfiufwjziupawzfjztuwaurzwafzufwufuwajzapttirrppzftwwajawrzzaaufzpwripwrtttzutwwzarwrriruiirjpuprpatfutijppairitrfufuprwawzzaaauftptrzauwfppttrirpwruaufjzzrrjarrjaitrjiaiafrzrwfzizfjwrzrrzziutrjfwatazuzrjfwafjtfzfjtiutruiujfjaujpazzftffuwtfffrtrrfzuztawwrijuuiftfufzfppprzppiuwittpfitaftajtfijitapjwitzafwwrfipaufjzwrwztfwtffzzitjwjatfjzjrtrziwwzpitzruujpfpfjtztzprppratuauuwufzjtfrtuztfuiwirirrpiztrpzwwwuutapfarufjwrjtwrwfajjrrjrftirfrfpfwarufijzttatzpwrpiwzuuziwwuwtfppfpjzupwrjjwrjjjztwarrpfpiwuuzfurwfrfjjiwtwijaptzztwitazwftijpuwjatwwafiiffzfwfprfptajuiftfuzapfutpfrjtrrzjruiajttirfjijzpaafjzjutjpfurjiwrfwfajujzwpfiwufafwwpwuuifuztuazatazjwuitaawizptufuautzrztrujwfpffjzwarztwjauripjrwzjzfzatrajuituptajuupattafzzjfaijjappftafjjtjrzwupjpzptzfaraituijtzftafwjirwajajrrrrwffijzrzfrffaiaiziattitutzjjjiwwtirapupawfiuwajfutrapzpitfaarjfrwutjjpjpfrtwrjpupwuwaawputjiuriizjjppfafurpziprripftpujaapwziprtjprwwwtpatjfauwuwfriajwrpzpapfiirtzriuirfuuazraupjtwparptuzwrzfjfaajtftwrizjzjrpwzzfztajrjjpfiizwpitwfijrfztftrpwzzfairiujzpawaiawuwpfzwpaawapfawtawpuwztzpiatpuzpiaaijrpajipwirjfuzaifutfwrawaiiaijppzfpzzwfrwujtatjttjuzjjfiijuipuirrifiariupttztpptippiwrtjzrfpupzpafauurpwwwuprrzwtuwaipzwftjwprfzwzatajttpiauprrwwurptwiaturzzjjpzwwzpftaafrpzuiapatjajpzpwuttzatpwaatrjriawjjaitprwtratturwprjawujzrwwpaaufzafutjtfapriptrprjafjtujzurpijjupaujtuwarurjzafprrtprfutaartwzzfzpptjazijwtpjawpirwafruzrtjpwutiurrffjrawiazatpruzjtrawztaiwwtwfwfitawitwpjizzapufrtjwutzjjrftijaauztupiiujrzjpzfujuazjfwpwrwazazffpjriwfprjippurwffuwzfzuiftrpzijtrfjfpjiruuwzartrzpajpaftuaaizwuijwarpizrrpziitwarrrwuiiriwjtizifatzpatfupuawprwzjjzirjitjwwfiparpwfrrjuitwzfaututajzapzupptjwurpzujjppzaupazitwtirptatjwiaifujzzaffpjirzfujaupwrufwtfaiizfuiwtirptzwwiuriaufafftupfiajfptptzpffazrwwwtipuffzfzrrrauituzwrzjtujfuraatazitjrzwtrwttaauajftaptfappzfpituutaafrzwwjwpufzrzfwupwirjpiwawrurtzrrzurzrrtattaarrjpatrfpupuitzrjpafjffjpwtitpfpipiipprttjpuaztajrtjiiptrfpaazjpwrpuizpwtwiuupfwjaarwjazrfuwapptwattitafuaupiriiwurzuawapjufufzrfrjuutjwjtiirparzifwritiitwupaurjffruzrtfjwjtrjfppuwjtjzzjaritzawiipwjfziuufrzpatprpazwuwwwpfafajuuiriiiizfiifijarpftftiatiaiajtapjafuftitffitzprfzjfitzfapjtzarjfwrwiptrpufjtrwpzuwpaprwfrpwiitituazfjitjfijjraaajwwpftjfwuuptafrtpjtzauzfzfziprppiuapaazjrarzparpuauajzaauujpprjpjrwrwfjprutzairjifzjitijfpjturatrjiripfwraiaafiawpjzpurwruwiawfpfpizazwrizzpuijarjpwippztfjippurwzarpffwwpziwiaaaippppwfwzazifrwiijtjpiarjwuwjtatjaruzjzwpijzwpjjtzautjfaarpwtppaujijtwwrrzruwfutuptjprfrtfizjzzppfizwpjjiffzzrtjrfuitztpapuziwuitaizjtzjttwawpzuajzpiwrffaizauzittaapzzuawrafjippiawttwaiutrjrurfwpapwtaruaiutfwwftfarzjawjjjjujiujtwtpuitrauwwrujiturjzaujztzaaaafzwfaiupwuipfrpwipfzzruprrwwutitrzwutijafzfpuprwfpifwzjazfrwutuuzifzititwipztzjtrijwrftiiwazrupwwtpjpurzftptupjpzjpfwaufruzpaipwtwzwtpwzfippuruaitjwjuffjzfuriwwtruwawjariijfapzpapzrprtiwifpzipjfwzzrapfitwpzfifjrtujppiwrawrtfuuwiuujrfptzpawfijrtrrpijfzjuwfwpfjpijzaiuawfupupwarjiutwaiawtptifpfpzpafrjztftuzwftutttpuipwtfizpwprprzizfappzituiiujjrzfuwtpjprwurzwruffiutfzrzrtjwuiipfpfuiwjifpuawpjtwajfpwtijfijajjtaijjpjwrwazuzuwzaaiwjiuijrrzwjiutupizuupajpwtzwtfjwfptuizptiaprfjuupjtjjwazfjuwtutrrtuiajijiaarpiuuappriwfjfrwpwajrazztiiftuiautfffizrrzwpapzwiajjjaiutfzrffijzzitjwrawwfptzjarafjaftrrwurpiijwarziziuppriujfipzjpiuiifztajrjuprpwjuprjzzafujjrtazratfraiwaapzuufpfzitpwpaprpraiprfzpffpfwruzjfjafuptjaautfiprrzrztufzzuajtrwpuzuirirutztiutffiruwpaprjwajzauaujrjupwatfttuuatzaujtzajiufwtutptawtrpjijffprfattariptjaiwjaztifuazrfuziafiwuwzriazirpapzijppzijwzipzfawpfjafpujwtfrjtpuiaarfffjtzrziupatjipufjipjwfwzjrwzptaufjztuzijappftijraariazfufrfzrrturttwrfzirarjzzafiujtfurrwpauaiftuijpftzprrwaaajpprutipifzjtzputpujtwwfrwptfwrrrajzziwpipfjuzjrjrtifiiwppjuiizaaijututuwiauzwtjzaijziwiwajzztiarwuaiujuuzzwuarzpjtrrutarrpftriuwapaaatrfwrirppwfuajwwjtwijutuupftijiftwiwurftiwifjjwufzujuzriippajjtuurufatiruijzpzwtuwtafwjwwtzzttfutuuwrwwwwwzzratzutwitzizwwawfpupartuuzpriirjzrtajwrujwjuafattuzffwitiuttrwzrrpurrrwutrujaujitftpffjrwfrauuzazjafjuauzufwjuwtipuftjppuuftupuirtuuwrpfiuzwzzjjjtziuiurwzpuafriuttzaajwztitjwuptauprazjzawtfjwrpwrjppatwjfiiprpwfrwtwauzwfjitffutfiwzupzrzpijppuituttizrirjtftwtfipppuariifzzttzzfwjzftrifzzzztffatupiirparaftfartjjizijaatarjupzfipzrpzpiatppziutaafzifrpaufturapwwzfataztaitzfzurjjfrfrwraruarwjjztptpwtzjfwrratapiapfzppfufzpruatrfwjiwtaptatjiwjfzipiutjpupiwzjrftzaitjzapfwpjtzwrruitwapzwwwaazfpafafttrtrifrwrftiafpzfwrpizzrtrtuzzwppruiuutpzfwwwupajufwpfzpjfuirfwwrfiaauprfrjtwafaujfwazufjurifpwazifjurzratptiztfzptzwijtfwrirfajawipaizfrjrjwzwjuapjiifpaijfajufuffipwzuajrtarzrjtrjtjappjjitpwpwaatpjjpffijjatufjawwwpirttjpfiapattjraztfrtzpwafuzijajzparptpipufijzpauwwzzzrjrtttfpjijajftffztuttpwtfazpifipwirffiwtirjffizwifpffurrpttrappfziwptatrpupiwtutjfuiwajiazuwwajiuffttzaappwipuruwijataptzzwiuatrrfzfptiaatrjfarwawjzuurffiatuwzpazjwrztjrzjappjjafrutiparizjpupzipppprjijzwpuatzipuiwifuitfzwuuzrwtrjjzirizwjpjtitartiiwpaauuaprriipfjarzwjpprppzirrizjarzzijprjzwaujjazzapatafuffwjwjwiittaizrfupzzjrtrfizjpfaatifutipiizwwfrpaizfitwpuzwitpaipwruiurtpzzpuafwauifaiirurifjwutuirzfrrzpftitpzpwurpfrpaaaiwiuutijpwpiirtfrfijfffpiwzijtuiprauwzwarrifuirizftuzzzaptifzawifwtwapiijzjiwuraraiafrppiijziffjfwuarprzwajftawajfjffifawurttjpjarzuijfrwzztzuwpirwzppzfwjizjzfpjaaztpwzwrpafazpzpzjatafwutjijuffrfziutwpuifjjffuuztuwapufpawtuapwuwatzuiiruzirutuujwrptuitraiprtprrurwzpauzjpwzffwfapffripupaaazazrwrrapupwzjiwtjwzuzrutijripifwtiuawwfuptzjtaazattauutuuitiffawffifujrruziipzitjtuifrjzaurifaijarpwfattazaifjiifpwtrwifpzfpartaiatfptptpztztaufizuzpjppaurtziuawarfawzufwuaptfuujjrzatpiruwjaajzpfwrpfwzrruiuutpwjtwripfazfwajifpzitrfftppfwrwjitazriurzjawpjfjjtraffzuwjwptipijattpajtaarpiuiwipzzurfjpfarrrfriztzfawwfrrzuprzaittpauafzzpzppjpjujwpjztzfpwuzwjarptafzuttwjprwpjiauaataajwwwptrzifpppwzzaijtrutizatfappjzratrrfuwrwwfrupwfzaiwujuairafpwurijzpirjwturrrjwifjpfzfaazffurjtjrwwuuwwpriwaifjitiatiriazajztpijuziupupwzurjzrzuutjwufuataifprrptjpjwzjjpirzzwzpwitzawwiatattitzpuarauztafuiurutjzwzaatujpwfjizfwpprwifwjruatpizifrwwrjzjptrutfrrwwpijwzppijjrziiirpzwzzpjrprjtipzirutpfatfwpjtfjjppipajztrjuzufwfutffuafrjaifzrufazrzujrzfrjuzujaftjtwpfiwupzwafuwfatzpuujrrwizrtjjjzawfjriufptuuruirituijwjaftzjtuffjtpijijiwpzfzjipprfzjziftwapppfjatirprpjzzaupaipztwajijjrtpuawiziwtpwtpatfjatpupriptuazifffpfizajtajatprutzrjpfpiwriprjujipzjajwjrpiuajtwwiaijpituwfjrrpwwzzttauuwrijufzwwiitwtfzjaiajattwpaipartwujittffjifpawattttwiatartrjwzjrarjrjafrzfjtauafizjfajzftafuzupirptazipfrzttutifppfufpazwjptzptptuafprjuprtziafiujtfpiufffirpziupaaiuuiairjztaiuzzzwprfjpzaazwwtzwwzprrzrzjtwzrijrijtrtftrrjjuurtawurrfzwwzutjfjjzpazzjiwzruiftzifwarjftutrjifpfirpfzaitzwzzftafuaaiuuzptrwaapwuwwtrwuaupizauaurwfwwzjtiuuijapptzitupuptiuftzfaifiwwpfuituazijzpjuiwaupjjfuwujaffutjtzfzirffwwfpjwjwwwuapjjufaprpwzppzuzzatutuapupfrararwuafpjzztiurrrjupaujjrtzapitraprjzriaurifuzwuatpzrifjjtawiifprwptztwrjzjwjtpaifazrujajwazwpijpjurijraiiupaattufzifrzaafijzzuwuzipifrzzwpwrtipjzrapzptpipufzjiajjiiziipzzjwpupjutiafuittuirwruztfrwptupzrfizfjwuwtaprwwztajztjujiwwtrazrjiuatziiwfiaprifzjjupaazrrwujjwpifatztwzrjpjujzpjtzjppizfwuzrrtrpjiupjfrzzptfztuajfaiiptizpfjuiawazuajwartaffufrawtjwizuwufzpwujpwaztrzziuuwfiizjuipatfwujiaiiwjipftajptijfzazwjwtapffpifztzufzarrazpjuapafiwijafzuwwpzujzarwftjutrufpzifrwfziwawttpwztpwjwzrturzpapraiwtpfjwrjzrurwtfupztrzarppirruzaifarzaittwwipzjpautpprwzwwttpitffruaafzjfarpafaiapipaawzrauawirfjawprurjfjzjptturzwiffzttitawwtpurzzatfazurtjifrfzatrijjfutaipjtzrzrfuaffzrptwpfjuttzpjuwwurwwtiziffajwuzwzijfruzrjiujuifiatzzitjiupfpujrpwapwurzfwzurpituiiifzurwaipuiirwafiujrwujatfjpfrjrziufttruprpfpiajtfwprjrupppurfzffrraiftifwfptprjfzzzprwprwttuzziwzrpuujuzpufawjufjpufwwfpjuwiwjipptjptpjzfzjjaapprijipaizatwiatuptfafzuwafurjifzwazrzfjppaijufwtjwzwfiipupafzratwtzrpirpfjrjaafrtjarwpzrpfwftfrfzfffappuftfuwiupuuazputfptupfpuwjturrrrajfitpjjjzjwuizwpppifuzfzuwiurwrzzptrwrwrrajfftiztjwitjuwzratraattptifufwuwftaupjijafupujupujutuzirurtfpiprpftffuipwzjwzrzzpjirwuwuwwatpwizjrutjajuurtuwwpzpitpfiwaztzfjfrzfjuitafijtjjurjjwfwrjtjfuwjjztrwpwfiutwppjztziijwuajaujtwfpjfpaiiuapwrrprajtjtittizujputjutuujruppajfztpjpwtrijarjrrtrjiwufpazfutrfttfapipuzufpaaftjwfraifpwjuuwtfjpjtpwatuiwwrpttaauruwzzifwwwiwauzpjwtarrjjwurjapawzuuffftauiptattwttttuzapfjzwawrttwatppazjfaaatuprjztzpjfuawtriuftuftuprurfjwzjptwftpjfwufjjruaaujupjwrufupjpwtizarafittzaftautrrfujrfizpfrpzjjjpfrzfiiwirawajuprawutjrattrtaupfpptzawiirufprftrwpawtaarauuraiuuuwrfurwtffjupzaapwzapuzwzuaiazprzfriwjrzufppiujzuzipiwwutaujwijzfjuujwjtziprfippjjjwatzrizziijzirtipjfwifftuuirjfaizfjtupfrrjtaajufrpztuiwipfizfpripfrwauiwfwrtijwazrurrarwiipawrffrptrzfzjztuapfapujiauaurtirizriiwajprztzwatfftujpwuuutfiiwiwpaaipajjtippawrupzwiijpptfpirftffuurwjrpjfiwjzijjpuzzuzraiirpzwrauatwpjfarairariaiwiazuftwfjppipzzwzpfipfwzjrwzaapwzttwwwppuapptatpuawwuzzzfurptwurwpjufprtzaafrpwwpuafzjwrfwriwawzrifrfuawtazaujfutwzazwjztwjpiuuuzjfiaajzwffazartpwiizjjrtpawrwifwaazuipizffapjuwjzjfiijwpwuaraatuzjawpiztzraraujawiipfuzrztwrazuuiuuiptrapfjjuaaztjiwfwapuuutprrjjfwjawiiizrjaruutazrarfriuwrfjwzwpaarafatzafffrjpttjtftfftrrwtjtrtptztapiztrzwafwrauzztttrfzfzzfratapfjwiujuifizwwjappjtajjtutjzuziwjzaurwuzijjjrzjiwarztjuuufiifffifzrufjwfupzzjrirrzppzuiwpzttjrarupapraujzuruwijtupzfpzrpppzjizwpuzutruririjitppjpipatwifpufpwajuifrfptrjrzauzwzfwfzrpzfrzafwtawatfwjfuuapfrjpaufppjjtuiipawfpfiwjpjztzfiiifrapjrijfttrftfuwpuurizjirzazrjzrpwpwrtwtzzuiwipfarafjjizzwfizrritrupjzijfpftziwajaztirraztpjtzpzffujutupuatrauiifwfwrafjjizuuwiwiwfjuwztrrjajwftrfzawrpriffraupfurfziapuuzzziijwpzprizfwurptratfpzzapjarrtjzajtfpruuittjizujptfwuwuppaafzpaijituurfpwwurwjwtprwziapuajizjitpirzipjpjurpwptrfjurzwwtrwaffziwfawzuuzujjiauputauwfwujffujrftazpzwrfujjtipijpizrjpaawrfajwiaiizpzutfwrzittzuuiirpfwajruprjrrjziprwiauujiitaprjuzizitifpuwzjptpzptpiifpprazajrtjiittztrpjtpijtwfirrautpwuauuwrprrwzriuarttztrpjurjiifaiwjpazupftuuritprfzwjazfjutzjizrtitprajarpuarjwzpajzwjfaiajtawijiprrwjzfiutaztzwtjjtafjtfjiippfaujjjupiripjafwaajwrwpjpttjuuuazjipjjrwtruizjpitffttprrjfiwfuijiajrtapffwwuujaipztitrtrujffrratzfzwjpfuwujfwiajwjfziiirffwtftzjuazizzuazpiirtpjruwaipazjufpuuzrjfwptuwzftuuwfaaaarizrwttjfizjtfwwuiwiatajajupwrwtijiwjaritipiijriraffjjpufttwwrjizpwtawjiipzjprirziwruftwiatuwuzzzitijfijppzprrwjrwzzaraitrjzzprpjrazaprjjipfipztwwtuirpjarirjpafzjiupaafzuziawzutffapjzzpawpztwazifzrjzatirafujaattffzwfptpzffjtrjrraituutprziuujazpjipiiwittaijrfiwurffpippjupirrpapftppzupftzzzftjjwtuwzzaawwpifrrzwfrfpjtztwjrjjptwriapijuiitfppjjtiiftaptatfpfwttuwfpuwjrupapurrprtjfajjiaawjizwfpttrijfizruzirwuwrapaurupfuapirjawjwaitujuzaziwitifpjifzrjwiafizwtwwuirjrrjftzfztrpjzwtpjjztwaafarpjtrzfzawiwtpfwrtafftparrfujrtazrrjfjfztjptaarwwfpuazjtzurawjwffpuzjrwrajtrazrawutpitatpjaiprarzufutuuzzipiajfiztfaatippzppjuuiwjrarwrztpautzauuprpwitwuirrfwzjfzwtjauiaafuzfripztwzwfatuatrurrwtfpzruuarffpatazwwpftutfuutatwuzpauttriatprrjiiptjpwwjzuwjppzfujatruwfpzrftrpituarifafizuziwuuirfjzwrzarjfjarrrtwzzzjpjwwfjjwwfritrpwiuttizpuajtzufuzrrppujiupftppurupwfrjwajiauatwazfiapajatzjazpwfijufjtfrazufaafuwwazzrppfpzfzrfazptuzawrftfrftrfiiipuijufufijjwtiizfuarajfuttzufuzzwtiajzwffattwatrfiwtjzwijwztuwptwurjtrujfuuffrjjprpfwtptrrtztpiwiutjzjwjrfiruirjuwajujwzizfurjfrwrtprjtpjwiwrwiaruufaiuzawaippwfjiwjtfjpfpprazurwrupjziriruzfjfwzpawiuzfitafujrriwajppfrwjaiiawuftrutaiajrrrfjupftfzujataajujwtapzwirupwzrptwpiptiffaftrwpjztpitazatwafzjwwzpajjzzjuarafptipzzfffpjwppatwwzuztziawtfwzzipwzzzijaaupptprztpfjrffiifruttuizurazwurwzzrwuwppiupjfatpfrupwziztwifprftaiiwatafprzjuupppjrtztrfuiirwwujtaittiwrjzzjfjpwafjiuazzwwztztuzwitpfjariiuruwtiuwjitiifturftuujzptjwjprzffjjtfitiapjujfjriiwtjjapzwfujfwurjzrairaapirfzjuizjatffzjrrruipjwaattffjjwztaftaapzuarjijuutwzajuizrztjrizjuwwzujwurtftjjrfaziwruazrwarpwrirjujfzjawtptujfzutfairtuutjaaftpriwtpftwtiarutapwajtptfuzffjpfiiwpizfrfjpipwpatpwjrwjwijawizjfwzfuipuzuzfazwauwturzjzziutawauitriuppijutartuauripwtatzuiiriijwwwjauiirztjtirwtfiiupiwitatpjzizwzzzuuprujfwfrartfiafauiwapuriwutjjjrawiuuutruuuawftpaiwfitffwturpzffififtpruraaijrjzpwipffarjizjizifwjttupiajtufwtfrtufajjufjtaiatwjuraftzaiaitztazzijijrttrjazajtjzjiawpjuaizrzwujttwrwpzjtazptfrafrijpffjwwtfurjwppuapwwufawiupprjfzwwwwfppwuatijiarttjjrapjuijizztafupaauiawiaptfitprrwfuurwtrzzpfuiwtzriwpjizjfuapzwzfpfapafaaaprtjtftwjpjuiatiwutirwfzppfffwajuzjwatruwafjurwffjjutjztiwrwfizjazfjzpiwrziuuzjitapwaizutwariftrpitraupwwiftizfwfafitjtaptiizjztiwuijfwiitjazpjfpupptzifrzzpuaafiufpupjzfiprjizzwzjfuwfipwuaztwiwfjafwzupuuzjjrzrwzfprawitafaipwjjjrrfprifaizfuuwfrzuftrpfjifuwwtawjujwajijfztiiiapuiwjituauupwzfwtturpajpfruuuprapappzaitiprwjrtaiauitpftpwrirpjwrtuzzzaazprpawftturijwrrfifijujwtapwzrwjztzftjzjzfzwfwitjzwruzujfwiiauiizjtwpifrtjapwjjiaaijtaitwjjwfftzzitpjftijftpiifwuitppffuprrppjfajrpaaiwazajtrzrfiiwizupjwzfptppwzftzrfutppawzwwizppwajafiipfjzjzfiaizaarpipjzitrzwjjrwzwpwpzjjrzjurrwitjppwiaauiitajijfuftrzrwutuaraiizwzwzfpwtrjzjrpztwaawifwtpptfiiwurzfjauuzufruztwitwwzwpjaawzjwrupuwurrptafpjftuuutjjprjijaiatujjpjrprrwpjztpujaufijrtzaijipziwwjjtzjziajrruztjrtutifpftfzpwfitttzpufuaauwrrzrttrwjffrafiizapuuzpfjpwtpapptrfaartrufzttuwuaiizfiawiarpffuipjawiuzrauzpatjrurutaffpzuzjrtujpzpaiifjirzfjjttjrfpuawfprafprajarizwzwijpztjuijfzjzijjtrprttrrwjizjwzzafzawupripurzutitwuufttaztjttzfwzwrfpjufwrpfuptfaiwrjpjzawuawuujpjraajfajfzfatawpzfafjtatfttwptwwzijuazrputawwzruuazzitiutfijjaztpifwiwrirzjjfjttzzitfairwrztrfifatraijuzpwwfitaziwipzaupuzijutpjaftapjiititiwztizwfpfaawarzufajatjfpiwjjjpzrzpjapartfirtiuuujjzitpurwuuujzzfuauurazwrpuirfpupfztpuptapwtazfauzutrwpiarfpurrizwawzawzwftwjiritwprpfpttipjufpwrupizprufzwtzrwajwjfzzijtajtppaiwwfjiatajwitjpfwzjfprrutftwjrttiiiafwtirrrfijzjrurupwaawprzapifatuujiprrurruputapzzfpauufuwuzawfaazuzpfjiiiaptairaafrzuzujiritjjppaizrpprazjzuzpuptjiiuaufuwwtfprutfuzuziwfjppafuwawwpfpzpptrfuzatuujpwijzatwtwwjitijffjjziuuwjzrjtpjrrfarjtjprfjauipzuwrrzzairpijijwtttjijfiijpfjwzijzjpaaarjazjujfpwiairpwrjruupzttzrwwatztuuriarfaftrfjijifiwppautiwifrwzziaurjairpajfatfjipatpiwujzwiuutwjwwfpipztawwwujiffiatjafjzwuuwtijuzijwrrjiwzaaijtwjpprjtfrajfwfjtputfrazjfzzzzfzpiprtrtpapruwwpuwwaitjujuaaijiawtjztfwzzrjaturptipfzpwziwuapprwizzutwairairijiizjjitjtzjruwifufpizupwrupzuppffrjpzfrtfrafpawjjrtipjwafrpftzpapjwufairpptzwwppuzzzwazjftutwwatuwzjwfarfirptfwaruzpraajifpfzfwrwzzfwptfiztpijpwrafuafrwtaafaztuupjfrtfatwzwfjwjpatuwftfaiiiaiwjapfazzturwfaaffrzwuwjjjrtapuuaawjufurpuijrauaafuwwrwpwrizjpafuwjirwrwaprpttfjfttjrtrfirjijfzrtzafuiutpuzwjppatpfwuptptfufatzwfpfiuiipjrurajpirwijaujpwjrrjjaiwfauafffjuwzafzjprawtzfaifriifjijtwaifittpufjzzzwpuuzitajjzprrtrtiriupjiuwzwututatitapjatippirazuuuajzizaiiwartizurptjtfjrpftfwfauftrtuptrfjfajujzprrwfuiatturwrirpwzapffzuwjzijpirupzptarjppwajtfzzpipifzapfatpjrptwawprjfwtuftfawiiuitptjrufiiutuappurituupaufrjrirutipruaattzrpwffaruzrarjuazrzrwwtwparufzzjjititjfrjrrtiwraajawwwptfiztiutfrjtiwtiwpjuizjufwpjratuwwuftaprituizzfuiijjapwipztpwzjapawwzpjfiupwiifaiijufwjutuatfpfjuzaijtrrtjraatfijwjzwrzriuzjafzpwzufrufjzruuuijzfzrzjaijwztzjufrpzritpatrfppjjrtjrtzaarfpprtautufzfurippwpriawiwwazrizpaptrjuwjiazijfarzpzjwfaufwrptijfwaajjtuztiztwizipupfwifjzfzzuuzptfrfjjauipfzaizpzajftuiiuipuwwtjzzijjtzwpfrizuwrtuztjizpfjwtwaiufttrwiaitpiftzjzrtjrrwuriwpzzizpaujawarzfturwrtrtwztiaritzrffwffauuafaiffuwtjipiiwztwjpfwizfittiajifpjpwaazwjjtuwzaifwraftazjzajriwuufwjaptjiturttaaurfaurfufajufafuzpuffuiarwruuauwfiaawutuutpjutrfjpppprpwpajwuzjrwwtatjauatraifjzrafirfatztfjttztzauiztwtaarfurwrpjwizizppitifpapiazijpwjtpufffzapffpjjrttizfftjzfuauppjwzitwujriztpipzrwwpzuwizafttuwrjzifzzzjtfpuuprpuzaaruijpjuiptiptftfpiwfraaaiwtuaufutwfziirtpfuarazjuzifipfzpwrwjtafpapritrafwizriarpwrpprpjatzrirjzipuizawawjjuauaratwtuwfffurztiurfjrajpaijjpitraapwzuizapwtawpuzpaizrwrwwwiwjujfzwupjiapwzwpzriuiatjfjiuutzjjfprwurrtjawauputitffjwazrartuufufzufuwpiiutwwzfpzjfpipauajipttpjjfjpztzrpiuaawtitrwtruzuafwrrzzrzijtaijtziwapwwiiriiawuuwpiwprtrfaapztiuzjwpujtffjwriuupwztuzwpfzuwiiafpwwuattfrffzpwfjpwjjuatfztziziriajrfjutiiirjfuwrzwjzwrrupjzajtzttfujzrfwzpfjrajzuutaupjjitijfaapzatuzapizrwuuupuiafwrzjtiiraiufzatpjzarauwawfiaatzizrpuzurwzuzfijpztfpftzaajtiazzwiwfwpupwppjfwwrzfutifuptpfwrwapfwuajzfauuuazwfuwaitawafpifiripruzfpapfattpwzziajiatrrwjwtapujrzijjjrazazajftiapaazpwizzjiuurptipaaiwjjrtuawzpjuijjpzfpjrawzjzrfiuzptpafppujztrprfzuptrzfrwippwwpirfararpppatuwitafwpppujjipiaifzjzfjijifiwiaafufzrawjwrjpupaitjjtzttuapijupwrraatuiwttwrjazjapjrtzwpuaziujipzwtawriiairfruataiuuuuuttrzttiitarwwwiufuattprzrjzipaufufirfwjwtztzapzzipzjwzrajwarfjaafajujawpizauwzffrfzfupfpjjjtauriapipwiwwzapwiffaptrtwzrrrauzuffjjirappafzrjrazutpwpafujafiuarwijizajpiafijawajzjazwfjjfwfiiwtrpturrjatwppwwifjtauazapprriipufawafuzwptrrwittritrprwjpwrjpiwpafjuztwrfririfufptjffpzuitpffrzpwjuztziiiwruiaijjuapazfzfwpfuauzfifwipwrziiuiazuzrpafpruijffittpwrpuwtfpwtiuizjpwtzfiawtzwajjuwazfwjipzzuwpfiurjrfpwajrtwwpttaprzirrrtzuuiittpfpjiuuairjwprtfpatjwpjfptiatwrtrzptjttaujrrzppupawwipiijtzujzrztjzwfzuifjiajauuppzfurpiuuutrtfipzzfrfpjtzujazpujjfrurtuafjwiziafjfirwjwzifzafzuwiajpwujftffwufzrwtauwftpaazwuzurjtrarpjtpfitwfapaztuiiipuaprzwjuwazarzftaptitzitizitatwrzzrtztuapzirzzwarrawuartptzaiziuttfzauiawzftjfpuarfjwrtiijauziuruturrfzuarizruziapffziiwapizpfpuzajjwaraiatiiizatfijruftprwfrfjfjurrjjutzutwptzuafurjjrawwrjaipuprafiptwarwzupaztwawatfujtfarajzaawrjazrtftwjpuuiptrptfjtfiiwtwfpiawprwpwztfjtpparzpruruzapzfuazirawiuapuaaaprjwuaujwiiwufpajiujfruatuawpiifwzzttptaprazartawfufujuwifzpzuupapawuwtjfuutfwjrwppuwiawttfpwurzfpwfiwiitafatifupzraawajprfrwwzzizpjiuuzzzjztwffzwuitjrpzprpwjiprifuwtazuiwtptrajfrfpijawujjwprzazjitjzjurrppftwpuuttujrfrppwaffpfrifjrffwuzuwritzwuujwfrrzwjfiajzpfpzazwiatrjjajzatiapuizziwfpauzittrfpiupwfriuauuftfrzuitatpijujtzfrztfffaaiwfizpwawjfajapizuifafjpjuwzwwppafauprpuafufpjtizjwttrjzttfjwapuaautfrzfpizrjppuapiuuwuwwirjwaujiaufitpjpuufrifarpujtpzzatupiupfwjrfzpwruafwijijiiijfurairjfripruwpzupwizjpurjprtfrttfwjfftpfjwaprrrazawatfrzzaitifjzfpwffpfatrawijwtupzjpafuwzfzrfjjafuitpurrrtrjarwaziutpfapwziiuajawtwuwftuzpwiwztztjwwrpwuwaipaufiujujtiiirttzwtwrfrprzapapazwrpttjftutfarzwwrraizwziirwupiuzifffrzifzaripztuajfiipwirpwpruzruzfurjiftrrrtzwtpwpfirrfwpuiatfwzapzipputftfwffiajiffpriiwaufuaafttuupipiurjrprwjrfaawtrrjpzurrataitfpptzpujiuiffptpwttapzwrtifuprrfrpzwfwfzfwtfzwtwrjfzwptrpaawpfwrtwijtjiwjiufwaurtjwwrpjitiuftatrapiajtfjfazwzrpfffptrwrifupwpzpziazfautrtpuarzttpruawrrtawjwwawauijwifratafrtjuiazjwtjrupfftjwjjttaftjziaiuurfuujjzijzarwauttauatjjtwifzaruiijzzirwwrjrzjzfifrifwurwwwuuarrziupzawttjjfjtarjiufjwjujjufwzzuzwzrtzfrztjpwzaajwwffwjtifwujzfjruiuurwwuprarruiprjtjtwwzrjttifizpjpitturarjrjaitpitjftzwpatfrttrzziaijatauirpurpwititazzpaiwptprarwripwpiupffzrrjrftprfpjajifrfrauijjjtwwrrriaitjrrawjwiiffppptfzfzpizppawiizttjjfzrrzjfwauariwajjwwpwazpawwauzufzpzzfzpfjiiaijfafiprpwjptjpfpwujratffzafpuriutirjatfafazwrtpuwftfwruttjtizipipfjpjttiarzwituppfjjtfizwzupztwiurpwwzapfjfjtirzrfftjiwjuwpiuaupzpzrfraiiwpjjjjrjipppftirfpwrzjpufpwjzrwuauuiutaupzwfijuufpjzizjwtzwpzwptwffjjuttppwurizujiuutrjziptwjajajafpuajjajtzjpprjzrwzizuwfzpjfiwttptffpppzzwupiwjuppipzuawjzpjtriptpuwazjfuzfrrzwtpfprtrtauzutijzrpfwawawzrijtiwiwjruptfjtwpuairrazpfrzrufpwatjjiaupjfjwprjtpwfwpzauwpftzijjuupipaufzpttzfifptaaizrtizatrawpwuufuittwfarfwwppwiziapufafrwituftiziuzuruapiifziwfwffwttfrfrfwjzrjwirtwjrwjppwuajfjfrtptpapjzijwriiwwuautirupjzfrtzzptuzjifauzjrawatawzruuupiitrtafjajpftuprfatfwurjuttpzpppawfzaaitfwtzazjpfwfuiuftriijfaiuwittwrjuwwfturrtijrafrjapujfaaiwpaztjfztauijaatjatrpazzuztwfafapzizrazjitfwwjztruujriatzzfptafiffjtruwfzwfazffjazfiturptufazrfuawitjrzrrawrwwwiptfapirjfuwwjjwifzupwjiatjwtttiftafwfjufuiuatawjwjpipjfattutzzuajrtzrfriazrffufriwtfzufwfjjwiizzzurjizpaifwwaizjzjpiuwwjuttijtztuaaaujtftafaizjzuzjuutzjfrtrfpafupuzafrijjzifipfujfjfizpartzwzjfajuaftrwafzzazujrwwfuwwjftzrujffwujttrwrjifuwwajfritazutuzfwfjiwparwurpwwuffzuztfawwfjupzuziwwizzaufrurttprurrfpapjazrzawpfwuauwaapwtitupffifwpawzjtaifwtipwizzzpuuuiwzijtzpuipajiiafwapjjiaazzjjrtrwaawuatpatpzarfpttrrtrrwifizrpupupwziruiajtfaiztapipfuaifujiwrrifatarzzrurfifupwtazpaiwpzitffaijrpaawwiaiwtujpuzffwiwizrrrifrawrwaawtztjtpaptzaaitzjffwtppajartrtrfipptupzijjjtairpiwpituuwrjwurtzitrjtpjfjrtpzpjiwtpjuffzffawjtwtztwrfpazfttitpupaptitfpptpfrfrwfawrzjajatwzuriajpufwuirrujzjjzutjrrruwutipzfzptpprtjttuwrwzrijjfprwrufjwazwjuuapriuazrzafpairpzttprwawtzutjtzutrrpajpawipzwwfiujtzrzffpjjzirwfujrrtafittprrjwpzauwwajawazufjrfzrajufuzjaitjifrjiwtpzwawziijztiwiwzpwzuuajatittupiitjrtfzuipztrrirurtaafwtwpjppaittijrufwijzzittjwprfttzpwjufwruprwawwupujffariwuzzfiapizjpwtpujarartifrarwpijwjpapafiaafzupfpitutfuzujjwjtpfzaitrjafrjippfpuauiujraztzwzipiprtjrprzwjfrfpjttpffzwrtrzptuptjiirujztpwrprfufwtiwafzuraawwpfizfitjwtipzwjipriuzwiprzajujzzwjrapztpatrfpprprzpiwzjurfafjziffzpfzptirjrjwiupwuztftuuzwprwaatpuijwpizirttwujtjzupafuwrzatwitpjijwjrfawpfuawwwjtujrizfzpatfwrzuuuuwfwzjutiwwzzjazrtpfutipjtrrtattwtffwzuwutuuwuajijtjzurapfrprffiijajzrrpwfwtwjatiriawpzfipuatiutauijaijuwzfurjriafzajarziwjtuiaipwzwzuwfjjfiujjpfpiruppprfapatujapujzjzzupjfwjwtjufzrpufzuuwjtrjwtazwufptrzjrijutwwzuuirpiarujpwfjrrwwwfwjfzratiurjwuwipwfrrujtrujarijuziruurjatfttfuairijizrfiwrijwtrfapwfwfuwrtiupafjwfruitzirifaartuwiwjajaattjjtpjwzrwuirzzaajpjjapawiujtfrwrjzfztuftaifirwztziauppwjfpzzuriwapawzzjapwpautipjpaaruzwzrpttujpapzjffwuutzwzpuiiutjaiirwuupifujaatpjuafuufiptjjwtzruriijpuuitpptpipjjfifjzuzpatpprjtrpwpzfpiwzufwupjrfraprjjrurauupjrrijijjuajfwujiiizwjuzuarfiawputiajaffziitprpauuupriutuzwritzuaautituapatpppiutpawwiujwtrptuaafwziiwjjfpjwwutaiazjraufzauzuprptjwipapjpaaztitpjuzwzujjwurfutjzaaazuftrprtwiatwwwfwapzituuittippwfarufjwzjufupfiwrtfpzftwrztppjittitwwatwarjiprpufwwuwuipajjtiwzftfurrpwrwwaafjwttfjiaruppwtjrzfjzfzrwauzazairiptrpiwjzwarpfajwjajjjwjwpijwiufuttftjjwjfapfztptaitapzrawuzazfizptwupwarrrjurirjzjzputfaauuajazjtzpriftzujawztjurpzfpaapftrajfizujzrrffwzttwiippjuuwtruijjtpputiwriwaufrzwaprruatztfrttzrfuztwjfarauwippipjpwiizazwtupfjajuutpupwajpjuuttzfzrwztwttzjatppfazzpfzauuztzjjiiptrjjiupfujpprjtjuzpzrtuttwtwftwftifzjapafaiarjtjawjipwwirtiwzjfatttrjpfftauuitrwiizwrripjtfzzrfjfritpuijziauzuafizzttpiwjwfziurujiupippujzwajrifuuaiiawujfpriurttpijaptiftwpuwrpfupwwzapfrwfwtrwruauttfiiajpwtufpjtjjufuriiatfjwijattftwwrjijtawziawiatwauttrtffwfaurzpfizfzwafzpupaizwwupfpppzwuwitjjaujuwzwzrzaurzuzttrpptjuptpjuprtfajwawtjzrwzrfitfrawzatfpuattzpriaiprfuiwrwitrwauawatzppafaarrjtitftrjfaizutwzzufjjwawwwfwuwwzijtwrrzpiawpjrirttjriurrazfziutjrafrwfptrpuzwarjziawftifzuuffutpuwrwifrraawafuwjuwptujzzjttwtwppjupaijpwfpjjpprjarruarrtpuftrpjruwujauzwrupjfraarzutaijrjipuaitpwprpffjrpaurpjtuzjutjafpzuazaprajjawwaiizzfjzjwituzrfjttpizujzwffwuzajzapjjtuizjuiwaazpauwijzujfzuftirirjzawwrftrtiiwrrtawwafjuruffztrfppuzzaztuwirjiiarfwuuawuwirrppfijtpjupffjtwffzwfutiwfpwrwrwuwjzrwafwtwrzurzwtrwpjijiuprurutiziwituaaztppfuzriatzzjzritujwwfzzwfparupjpazwttfptzputiztzapajaujjazjrjjrrrutziwzrwraajfzatajajupptprtftftizuppjwpijipzpuajpaftzzwrwuiujuuifuwttujiftpawzurjjupzatfrawfzzwjptwpptazffwpjzzirpwajjjwjppzrwpafaiiiufwuarwauziiuatarztjjrfatfitiuffjwjurwtrzrtaiwuiparjjtrjffwpjijwufpfjrfrfpiwuaurziftritrfujatptujwauwiztuupzpjtufrzziiifffiutupzwwzpwwjpazfzuuuuipftuawitjzrftpwjrafwutrzprfauufatiffzpjwafzfjrirjtfrfazwfftuurfujrurjzazuwurjarptwtrazzwitjwttzrrpwjfzpuuizzawjwiruuppzrtztziafriuwatujzjarzwzaauwwrifrwwjjptjapfzfizjztffparftfwjztwuiujzrzfzffttzptitrwfwaafftwjuiufpjjzprpupajfiazrpztfwifuwwuapitppfiwwaiftttiiitiwjjwuraifzijzwaijwjzzaapjwjwauizwuafttrrftpfpujzjfapuujztfpfrapiififiwapuauwfrufurjrijjijipijiuauuafpijpuffaauprfpajrjwrfipuzjajrfjtiwrtjujzupiwujzpuazaiwjjifuuuzraffwfujpwpiipwfwjfttwfprjwwwputiiuajzawtuwzpruuarujpfaapftfwfaztrfjrfjrffuwjifujwtufuttrpajpttrrwppiiwawazjuwpriuuzirrrfwfaztipapuuwjuarawutrwuwutifwrjaziffzrrarifwitfujjuiiuwfzjjrrtiipzziatapiapptjjfjuuurafjzurtitwuwaizjitruupifajjrpuuawipwirrrurwrzijjufjwtzutrwtrwpupjitruzfrrpztrfwjajaffjptzuwrurwwtjtprzpaatafputuffjajputaiariafafjauzwjfzfwujufftrtzwfzazittifziaptptzjwjtpifzaarwptifrjfafjwatawjjripwjrpzpppwtrjiwjtjtiftwupiptrpwrrpwtzpwazfjfawupzafiiuijrpuwiaijuzftfjutwapitfpizauzpapzwrfzzfpjfiipzarpfuzztttfwjrwufrauarizppjaaaztwapitjprjzruawaziftfpuzaiwaitrpjjtafapzzjtzwzzruiarfjjairjitrttwuiitfipttiupwzpffuiffjrjuuutzftapawiipzupjufttajiiipratapfiziwjwtajizaajjzjawfrpjtuiwazpzwuwwuftrujwpapwafapttzuurttpwzjzijurujrfirjtutfrtrafpiitfzizzrwajuzifuiajtzrufffwftutzrappwirpwzipuitjjiarfiiffjwjtjwjjfptfajuztizpzairttzarjatzrfrfzwjjzrttjwfjjzfwazuuwjiizwzfwtuujzzpfazzfjrrfirtutizwrttjfiuazaatrriziijufzjztfajtzfuwtupwzzttjarwipiuiwruzpuzapfratiuffuwiwirwirwztjjrprrruiwuufzuiipuijttjifzpprffafiztwjpttpuwiarwzaiwaataawatwijtzrpwfraapppazizprirtzrrzjfuuwirfzfuzwuazrpwfzifpwazupprpaaptjzriffzptiprifazjtrizwjffttzjzttwwffirzpiwiftwwzirtzuwiuizprzjttwazatjztpiwiurzatriizwaztjjwrufrjztrirzjzirtiwzupaitwpuztfpufjajzzwpttwzwpzrfuwituprzjrwpfriftwaufajzrjipitffuzartzwpttrputfpajtfprpffuarurzfijwtwjawwpfazfzuuwwfipwzuftrfrzwwaafwuwjfiwrujjiurrpwajtzuuzfjuwaiuztrjptwiftjzrwfzrpfawiziuttfwpaapzrjapfuuzpttitjiapirrujurfwauzttzaprrrtjtfrawutjurtjfrpzrututtfazprttzftfafzaffpupttrrfrrizizpffrpriztwurfjruzwzwaiazjizjpuuwjtjzwpjafwzwpipzwiirirjtfwirjrirzrfzzwtzfiijfwpjtpwtffpptpjptrrtwtzjpwuujffpurwrfftpzupputaiwizuftrppjzwzwtzrwriwjwfpjjwzutpupuawfijpjfritfzjpjaawzfazjfuwziupjijptutiiwwpazrrpfprwwpartfwaarzfffpufwzpjaaarfazrwjrfjwwptuzattijzirtttapazrtztijrwpptuwjfftwjpjpuufaappiiaraiifppuztwwrzjriipjjrrpzrwiwifpzzfzufppftzwwifwptuwjtraftruwruziawpriufpjjipwatattwpwrprapfajizwiurpzrtrriifwfttjtuzfjawuarautjtttfpzjiarzijjuurzjripifjwrftajzptruaittjfifzjtrarpauzwraatztipzifjaufizprfjuwrwwtaufzjarrjtfttftwpwafuufrwjujwzptwuazurfpippfjtuuitruzuawtjrrzrrfjprfutjwirajprzrrjiuwaiaauwwrfupfaarrifitujzjuuaafrzuzrtizaiajfairuwjjftpttzzaawuzuartwptfruitwwfiafzripttttiaurzfipfpfiffpzuwpuujjiiprjffpfutzzrrruaruzfpzftrzararjwapiftwjrfizrzpprzrpuwpujfipauuipfrwpzuuiuauiruufawtpapjaiipzzpzwijrjariwtwpiaffjitiwfiirwfawapiiwzwtjzprfutjajrtwjaajaifjrruwtuftratiawuutuizttzrauwwuappftfjtzwitzztfpfazipiazpjtrwpfzwwzfwtzfziujjjurpfpzrpaiiaizwpwaatpizffzuzjzafzufptrffzjpzrppftwzftpwufwatiijtwuuitrjaujjrwptapptzrzruaiiafiittjraaapjwztarujrppiwjruzftzjjjrjujzpfaaifuuuirpiiijiazjwfpwrrrrzaiwwpjttruauptfajzzwjajjaupwzfuzfrjjrpiafuajtattiauppwprarajrurrarujziirftrtpfuiwraijaztfrafptfuawzffjztpjpifjjtuiazjttuwffzjiijrfzwizjwrwzzwiapwirpuzwfpafwufiurwrarzjwfzwjrtffrittzupftiwfrtauararjiiiruaiupjwfiuptufzppzujurjzwuuruwtpftujfrrwujjwuwzrutptzrztjrtjztrfauufpijfjwuurajpiwzzzaftufwiautwfpzitwwjtpzpzzutzuwfuiptazzuiwfzwjjtptjifazijutaiufauwwjzparjzfrizauajfpiiwpupptjfptizziaazafzzttwrrztpwawwputrrpjzwruaajafaftrfwjupfpijzzawjfjwujwffzpuwtwzawzjararzijziurwrauautrjwwjiaztiuiwprjpwifiwpitjjfjuptzjfittpiffjauazfpiipitfpuwpjtzuwifapfwziapuprurrprzuzfffrjwapzajzztwawfiuappufrajppzwufwrpprwtiipuaiuaufaptzitjwatpwpapfiijtazwtfrzrzrarpazujutwturjjuppzfzutjjuwpurwfizrwfrifjzazpurrzaipuwrttftfufiffjpiwazttfwwjftjuafuuuwfwaatipjprzwapapwpaajuiztwatjpujttiwzputwjtwazpzauwtfjjfrtwzjtiwwtfzfitrzrztzuawiwipuiztfzrtjzwwuwrwzriiaffizwpzzzjwzrujwtwjzfuiaufrwtauzjufuzfttjaairizrrtfjpatiwuwtfjjujuujrpauijwfawuuwpjjatpafiawuzuzruizjzifzpupprufzirrftwrfzajpwiuaaruuiwpauttirifrwwjrjpppazfzrzzpupwuwjwjfawrtatzuaarjpurutjptpttjuufazuaatajruzpwzpurufrrarjrtpuwtrpuzazupjjjatfzauirrjitazrfwfwifjwazwutuafzifpjpfuraptziafrpfzjarjzriatirztutftftztfzuprtaaawizjzjufifrppajrzrwzwruwrtarutzpiwwrftjtiizarjafrrafziwipzufrrwwjjrjrpurwufjpfwjutfuzppzrzaatrjfwzrrjwwpfztazftajrawauuaifuwjzriuipfztpupzjzfiuppuauatiwtftfzratrzfppuazfwfpujwfpffputazjpwzjpzpuzrapapipjiwzitttwzawjptfrwriazaapzirrtuijuwuwwjzzztiparwjaptiwafjatizurptwizrzuzfapawjupjjwwruatuzzariaiftputizaawfajfijpuiffwarjwafwwjurjrjjpaazjawpfjjfzfrpjpruurfazwfipiwiprtzafzzwiritfrzturfjwtfwjzijziarzipwwtapzapuazfiuziutiirwjpuwjpfwipjfrfttujiwfpiwfpjwaiuzirzwtiirjpfruifzptiaiwwjzzazifwrpziifiiptjtuuttpwfffffjiazjupfawrpriurwrfjpwrjpzuafriiurpfiiitwuipuiwatwaiiawuwtauittwrtwpztjwtaaapruujjpztfutizwrzfzppirwzaiwzjfrjurziurtwjtpjjapfjfpiwjwwwptwrfzwzffrwiuaptjrzjwwzfwpapzwtjwtjtfaiuatjuufjipwpttrtttatufprzpzzwijuuriafwjjtrijwzufwzazwpttajpfpwrfpfzuiffwjpppffrwfzrizwjurrufzttwjiwtzfwrzarrfaruiwzzupzprfutuirpzajfapuwrzutwwzprprrrjaziutfrrtjtippuztzjwfutpfazzpiptafupjauafrirttizazatatuajwfipiwrfjatuptrjfijwtuutjpwurtuiufprifztwfptrpafujruiuatiwfziiffizjujpztztwrutrwijftfrpzfjappzafaatutjtaurfuwtrijtrrzwufztfzpwjfzztjpwrwjtjutjpipatzafurjwfwfiwifutjftzirfrpijrfuifawiafrrptrjwzzttwjupawwatjfrtfazuwzitujtpwpaijfjtptiwztpjaaiujriwapitpiajtzrazjffajzpfzzpzjaztriuurzzjwttaawzrjzzuaiuwzwfpwwauufawpwiutwiaiitrfwzjjwiiawfrfatwauupurzaajraairtujfjjjfuttajrpaziupauuajwiujraawfaapaajautwpuurwzrpruijjpijafzuwpjtjiuzapfwutwaprarzrutruraparjjjfpjpzfajwfutiitzjfrrizwiptuawiutpzpittwzazjirtjupwfawzazjiawfawwzztpwjujwpfpjijaurzjzfiripwjjjtttwuufjtpirzifapraztjupwjttjfapufprrutffpwftritatjafufrpuwawtuzppufripatitwjzwrjfafjaaatpjatjwwtapprfjuwppufazzaiiwppptatzzatrizwpwrjizwujarzafiuajwzzjpiajupzpufruzztijfwtjfzffwifwfafwtzpzfwwrfafaiuiwwwfaiatttjftipzjrufiztwtiajtwjtfuauppftjrrptzzjijtfuwfawziwwzuatpizriutwpwapffaruiufpiuzffwzfpwfzpfuuzwipttpirizfjjzrtitwuarffjuiruizzwrarfiiuiwfuttiufuijjfijzftpwziwpwzirjiprwzwuiitzawupjpjwjrjupurfiffwjzjrwzjuiztatzuffwptrpurzurztfaptzwwtzurrwrtpjtawfptfwwtpjaptwruafafritawtttuiiarzwutaprzpwtrutuptjttuaizirpjfpujirrifizujjpaztpfzjwzwrjrfawujrifjtipzpzrwutwzazpwtwzjiuzwfwjwtupuujpjfufaiurzwpzjuuwzjwirfjuwrzjjparzwfaiifuafpuwujtafrzzrrjwazpiwzzrfwiiwpawrwztjjpfuttuuuujurizfiauatiiuazwrtpzwprujtjwrrfzzpjpfawtuztjffrfaafrrjjrtrjiizrujarirjpiufrrzatzufrjfrrpurzjiuizzjtjzpzrirfrtptuttizjpafijwfzjrjwuapffiuarjaifippprfpuppfjfftaiufuwajijtrptparrapwfrtazuwjpjjzjwijjttjiuazzrjtuftuuttjtwuprrptautfufjpwuzwfuzftzprwrfrzpzutzizfrfiwuiffrpjrwjpfrrtritpuuwpafrzwrwtrtwfirwjifitrpuzutjzajpijjuriurtztzwituzujzzfujjwwutjtzazwpftjzjrjuwzawrjfatfzuzrwjiprruiatzuzajatppzwpfawtwpfrtwriaiawiapttjuajpftzfffwpptwzfrrwrrazpjauirapipprwartaatzzwuuuujtfzaujzztapazwjzuazfritpauftziuazwfftuartfijpttuauapjtwrttitwiawfitupjzfiiiwfrwzturptapriraafrtrtjtfpizrrpaptufrfpptffujfjatpfzpfpuipfiuatwtwjwptutzwiwjiirizijprwwiwapfptjtirjfawjtpjprjjiujurtjrwpuzzruuijaauriwuaaazjrjpwrwzwrfjtizarjfrurijwfrjijrizpzjjrtprirrpppiiizuwfipputaurjfzijwijrzwippiarrpiipifjuuatjaupizwtaiatiuawzwffiwazapwzpjfprifppafujarariaafpjuwruufwawptppjafapjfjziauutipwwuatzpzprtfwurfpuijiurafpjtrrapajrutpzriafrfzitpiajuzrtfjrfppprupzzupufprtwfaijzrzatffjftzjappatzutrafiauwufzputzirwzjwztzwtazrfaawtfairauwaiarrfifttjfjajuftfpuwujwrizjpizwtauurawwitjziiwjjtatptirrzfazrzfirtpjarpipuitzaaruijwrrzapjfwzwaaazizwapfiupfppazuwuwziuupajiazfataarrfwafwwjfuwftwptjtitjipaptfpituztrwparzpzwaazfwazpzftpiaiifuuawprjzjajftjuwtfirzuuitfppjjaujwpiiiuujjwiprrjjwwfazrpiuijzzijfiiituitrutfrtzifwaawpazjiirwrtfzpjfizfuijfurwfuwittjfaiatiujwtfuturupfpuaazprrazziawutwjwwrttptwiwjrtfaztwwtwjzarrtprjfjztzujjzrprfwppiipujffzaiuzafpzzpftiazzpuaijafipwjrupttrrfuzjaawttpfafpapzaijprtrtfwijttruaarjazppjuzawutwrjtjpwfwufjzaijraawrjtttjjtwatrftrajwzrwfwwfiiwitiptzfujwrrwtzzatutpjipwwiaiwipjrptirztffjzwtifpjirjppwfttpfwjiuiwipafpjutziprjprjptrwjfwfuuajiazruzrpizzjpatzjujwtupaafjiizuzpffptipazaaizurizrfaauwaizprrrprupuztwzwafjruippjjjzrpiirzitruwruuuwztfpruwtftwtuiapuuzwjtijfjtuajwuwaauiratpfauztajjjparrptuztzzjfiutritftatjtppjpuuiaiijwfwprffirajuziuujtwffazitfawifaujararuiriaaawpzzzwuziirafurawijppwfatattztuuatffawrzjwpputajjjirzwjjjzjprfzwpjaiazzfzfjzujfajppwurpjziuriftpptfpufrzirzfauafaaraiftpjpfrzarpfrfurrpaitiiztfwtafzrwwrafppupwairurzpaiuapztipurafpapjfwzrpfrpwpzwruujitaaftjtruwpzuwtaprztzatzaztuurpujffuwrjptjupztiuwafwtipjrturuwuuiptaptawuwjrrwrwwuuatfiwwwwufufttuaizauzrraazzrtauipjrjzjufwztfutzjzpwpzrparaapziiriujrfiaiwffjpwruffjzzzwrjiuauupzuriziiaptrtititzautjrwiwitttjjitrwpfuzwfujuirwtajttzjtwfwaaurjawjzjppiazaiuppjjjfuwafjwppujaazpizfpfzwuawriirzfputwifrzitzruarfurjawrjirajuwzwrpzjajfrpurtjwpfzpfuzzzztrpuwjirriiwwfawruffpijzwujjtutzfirptajtupjjiraiuitfzftzzzjztjtrtrwjurtwjwjzaaijptfirrijfiztziitzfrwziwiizziuwrpawjtaztuuapfifzrtpuuafiwttfpiazpafjjzujwjiuwttzttpifiwjrtfffjiitfattrwpapjiufzfzrifpifwziapwritwripuwtiijprjztwwzupjrraifijapaatawpzuiiirjfuwttjwuaipwrjrrawfujpfijwprrarjiijapiwizziwitipjatiiuzaazpiziwpazatutautiauwipufwatziwtwfptupfawjzifjwuftutjuufzfzrapwijriafttirrtrtuizpfzttuarjffjiwujufiftjfrruzjfrazaufaafrzjzuzuwfwtrwzuztjjufzpfprrpuzjtitwrwfwitupujaijafpjftpiajuazrtpurzjjwuwwafpjfprataipzjurftzziuzptrtujjzzwuurtrjjffujiipzzufarjtftzfizfztirfiirzwtijwfputftzauwwwtafzwzapzzfauarwfftjwzpjjijizfufwzawipraiupjptprjpzrjaizwjrjjuaatawfjurujwruarpiirairtwfpjrttrtuatippfataurjpuujpipzaupzpfzpzwtzrjrtprjjpziiwpwurfafzatfjrtfjpiaftzajzpppfptuuwiituajwtwttajwzziijwfwwtjuzwauaaaiaawpjzppiiwjpzzzijtirrrwfjffjwjfjfpiiuiuatjftartwiarwjiwzfzrputpzpriiafppiaraujijtatjzupfwafzfirijzfwjtztpritiwawiiwrrupjrjiujpuupwjppwffrfjijiaizrrajzuzptpizaafifiriwruafufrfrfwzfzjtrapwzizfiupjrttupjpjurwjffuzurjwwippputrziapfajtitttzizzpjzaruprzftazptizrapwztjfajiftritwaawuarwiwiuwrrwwtiittfzpurjwajuaizjutwapuwtazjpiajwwfpfafjpjauftzjiaipptiuuupuafifzjjiirftifwzuafzjuaawwwurwprtriizuztwrwurzzzzuwipwttjtpwjfwpzuffpzfjwatruufiwrtiawfftutjapirfrwijrpjffwpuwwtajtajifuafurrjwwzrfirziirwjajtzzwrwuijiztujzfpatzfzpwjwiifztprzuiirwrtptftwuupuiafiwutziuutfrtupwujpptwwajwaaiwptzppuaftwfprppuwzjwpupwpaajruurrzauatfwrrwiuiipjfuuiauiwuaafapzfjwzurttaiajupwzttwwztztjfpijajutaarupijizwzjpzruijwtzaujzfjuwwjutpwazauiiwripjujipiwwpaauzzjprtiwajfazariuupwitufzuzirjtfzzpwwuipwzipaztzjptpwttiuirpzzfzjuttuturwarwaifafarwpiapauajapawjiftujpzaauutwutratjfwtjwtjrjzuwtrijipzzzuaitpiwpiijjuutpzftfrawfprwuapazjwtjazrpauajtwtutwarufrrwtutftafjwuwwrarwwjwrwrfiwafafrwrwrwuuaupuuwtzjpwifpawjipztfawuijwwrijwafraazarafwpzjutjtuzuffrjtftirwpzjwfafppjjfpztjraturuzfzaiapiarifwtiuwpjjuuutarrittuwjwuwawjiuzijfizjwrutjrtiwfawwipfzuirjzwatappiuuafztufpzaiufijzurtppuapjifprprriziwwiajwuzuppwwapajffrwrraariripapizffuzuzrrfrzijtfjaifaazrpttpurtwiipjtwiuzizpwwzpizjrzrjrjtjzpifjifjpiujrarpzufpjjwpfrwittitjtfufrwpufijjzajjuiprrfrjwijtwrptwjtrazrwiwittraitftaifzjwuzjjufwrprwiupatjuuuwfaziippijriiwuprauuazpzjuzrzpzizapiuwaauffpuizjaztwwrfztfttzrjpprzrzztfitfarjtzzpwprjrurzpzttrfpuffwtfztaairirzaruaraftrttffatfwarairuwjtpwtuapiatwaiaztwttttraaturtuzzzupaifratzjffuwuaautttwfzwtrjijzrzrjaaifutzrrfatuwijjuipfpjwtuppjrrzfiarzjazpjfzpzupuupfijjijiwjziwrwftjrriujirujjzuuwzwrfrfapuijfzuuztitatwpriwfwttiijtzaupttzjtjaazifipuprfirtuiruwriiprwirujziazrffpurjtaruwarwfiuatwpjirtpujappatrpuzwjifwfarrfjpftiaripiwjrritfuaiwpuzrzzpzitwjwiaurrwirjfzprajwtpzzziffpraprztappwfripipwawzajrzawfrjjjpawwrawzitfipwtfrwffajpiifupttufiuzrtzwzwpzrupwtjwpprwfipwwuatuzpztfazwauurtwrrawtjjzazjjwzriftiiptiztwrziuazrrjutzppjpzutwwjfauttrrzfajupuajiafuirturttijzawuwjrwfpiztifufpiztptzzwwtjptatuurjpjfrrwfpfpfptpfwitjfzptwaizpizwfpupturtzjpzptuuzttiuztzurizuuzfrfwzfzurppittwttwizatiajuufppjtzwzrrppuppwuufftptizipaatwiruzjifujiuuwjwarwuzzjtuuwfriufzzwwffizjpzrpiifruzrfiwiuprrtrjpazrzzrwjpiaiiajuppuujawjfuiaztiwptfrrjpauujzpwawwjtwfwrifzfzrzriauujffaptppuarrjiwuftzawfjwtjjwttptzjfjuzarjwzifwwpzfztjwttiujwjpzzftfufjfrwpffjjtwzarwuwuuwzrpataarjwjrwafaturptturrtrjuiuuiziwawijaiiwwtztjwiuwuprwtwptfjtjfiuwfffiuwtrwfijjaftjfjfpfufwtttazftzawzrwzpfatwiwajtuzrjzparjifazwatiawtawjwwwiwfuwaftpuptuuwrutrjuwjzawaaftattztfpjwptfrrptirjuppjwiwfiuarjfpzzzpiuijfffafaiazupirriiwpafzpzjzrjjzzwwifwatjwjrtrfawzjzrwfjuprapjajiajafiarruuzwwwrwruijapjajuuwfutzuzpjjjfirrttautrufafffrfarwjfptptwfiufjzutpizrrfzwiuafjzjarirwfuitzjitzrtrztrfrjzifpjitaijtziuujrfpwfttawjawtprpwazjzwifruwwittwpatjatzuzfztazuwjjwiiiffuzwfzparawaiifpwuwtfutwrjppfuupiwpiuajruwifjzfatzjfuzjiwuwiuatfrtutrwitzraiarzwfturiarztaatrfaripfttrtruurjffwapwjpazztttuzuttftautfwuijwipzfuuiwturfppjprzziizttrizprpruiijrapuprrztppjpzrfjrfrraifjtfauipfraafrfwtwiufzptafipwftfifizjpjuuzwaazfiffurwatpjirzjiwiupufpriwuttrjaujfzfajwzjwwaijpftpzpitifzzaitazzjtfitutptfiuttrzutzrppfifwawpptarfjuifttrwjprfaatjpfjjautiizfrpzutfiptuuurtptarriifpapafpfzrzatjwuuzrtfrfppifpitttifaapiirfuwpwfjizzuajfparjrztwfffjfjpitzwzrzrtujarpfarazjuuaiauptiruwjaupzrzjfparitzzpfiijairtrufwrrtriapuitjifuzarzaafuruiztiiapuiawzzrzjwzpjtjpjurtjrfuwjfwwfrwzputpfwwattaazazafratwjrpjtzjwjrfuapajiffwjzfpttjriftiujaaufwzatzazwjjfwupjjzuiwaftiiujzprwiuwfrjwrujrfafftzzrjafriipifzrtiiziuprrpizfrtpaupfwwaizttrujfzpipttraiiapizppizuwfitjrptiiafatiwjuwppfzuzzjpzzuujafrjzujfwiztuujfzjzawutawptfwjjurruaiututupuajpwzwpwrjzttrijtitpatwtrztrpzajfjwiwrpuzafptuupwfiztwptjzwizfpiauaptppaztuuizrjpftujitiaujrpppfufrrzraurjapjfttwiitzjzappujjtpifziiwjurfpzijazwrfuajwtaawruitpizuttaizjraziatizfuppjattutrjruutzarwrttpzutfprujwrfiurzrupzpjritiuuiajfjjtauwipuwwpfzfjwijztpwfjpzarpaprpjitfupaprarpjrfpafiwffuftppjppiiiuurpauzaiufifiuiujptfuwwriwfjtjrripzjariipfapztrjaztuzwtrzpuipajzptfwifziwrjuifuauzapwzfrrfwatippiiufirrttjarffajjrazatirrfrtutuaijtapjzfrfaiwwfjptrztruzjiijrfparaawifirwprppajjrzttfzuiatarajtrwrzutzpurrazujjfaarajwwrjtrapwfzzupwrtiitprwwztfztawifriratwfazziifpfatfijafwjjawiawwrwrtrarrzftwppzaatwtzapfatrzrirzjrpirtutufzipppatwfirutuzjpfwwfupatjirrauafiawjriuattpazwtzijpairuapptpatfrprpwfuwffrujwrprjpfrjwaprzzfiwztzrwizzjwzwrrwjupwppapjjrjirpjzjpptfiparratiurwpjtrwrztwjuaurruipjujruwrtfpziwzfjafrwptujjjwrapfiwijiafzpftawaztujfjfwripzuijwupiazwirfrzrjijfaiwuapuwjiaaiutwpwpuiaptarzzrifrpfiuufuaaprwfurfariwttputzapjptfrarjuzfptjuptwujfrpwfptfjrawfufwuffapiptpiiipwifwfwzfprpapatwffaiiujwarutjrrjiurjatawzpzjiautpztafjujuitzuwwzfzjuaffzfzuppiiizjuwafzijjiuwtupzjutzrattftfwazjutpwaaaurwajpiajzwzwirarfauppupzwatzrpttftataazttjrrizuftuifuatfppzfaafzfffpuuiurzwjrwuffwrwpjpturrtutpifwwptpzwzwiipzwwrrauitarpujprtjrtjpuwuuazuzifrtirfwzzfpwzijwzaufzfazfwpwjwwuuipiuizjjwifazzzttfitawtiwjuprwripjzzrftiwuufattrfwuupzaauwiifrzwzatafiatjprirjztwtiuztfztpuiuauiipujpzitaiaiwipziuzruatatjpjztrppizjpjapputijjifawfpuruiutrzuijtfijwurrzffwzuawjztzwtruztjrwjfwwwaizfttffrtpzrrpfuftpuuzjtjiawuaitpfrzuawwtwtrrpptfwuitfpjtwttpitiupppaurrrwatwizwftjutupffjwfztjtpprapjzrtwujtrftfutfpppjztiptaapiijpfwririafpfpifrffzjrjrzwwjjjwifiprptrprfizpwzuatuwpzwtpupfzrapzuwtjtafpfuwjptutttiwzzawuzfaiaaiawraatwzzpjutwtrtrufraarzfparuffzutritztrrpfrfwufiwtzrpfftfazzjazafuujtuttipaawpfwititifrzitawjtrjztfttwfpjfffjwwwwuriiwpzfzuzuirrjpjrtarfawjaffarawatppptfwtwuzrtprwrzzrfpiizzjifwtztaurrtjwitiwipzttafipjrwiwrtrpuapajpjzfpiwizptawtzaawtuuuarrfrazartauziruuaifpfjpafrirazfafwtatuwzpjurzpwfarwapupjrwtrjtuuaawzfpurrjjjaztzwrfztfrtpwzfrizwrprujtiraritrwutztwwjwptijatfziwzfauwruzjiuazffzrzjpzaajaaffrfriiffwafuzuwzpziizrrpzirzfftuztauuuztpfaifztpztjariirzuifwtpauzuttjuzwiwttppuurjprafzptuztpruuzijtppfzwtjuajzazpuzzwuffjaizafafuwiutzutujpjwrzzriuprztjjuwfjajatjtjiarfuupazujfijrarzwpjifarwzipajtjjpzriprujfpfpijtitajazapwipzrprpjwturparrauwtfrawppppzpuijfwztprfrptwurjuufzwrjzzjzrpatuwujituuauwruwawttrawpujjwufzaajfjfpuwtizrpzurutjwwiaurrfutijufarpprpwjufpzzazjtttuffpfzztwuufwzrrraifjwwwrarutpptjruawjwwiwjrpjtpwjjtuutzjtuzrzprwzzruzipfrpazujuwuufjuizaaufjiuwjiwpiwjffjjzrirtjraatprjirwrtajwaatjatarzjfjfuzppiwwzriarrujtprzpjaujiazifpwijraupjujrfpwffftrwzpijaprjjutzawrpfrzutiiwfpzfurpjtaizwptrrwrjutwpzzirrwrupztpiputpizpiaizfrzwzpjjzwuiatjfujwzwajwutuwwzjpjpfirujuwzziuwawtrrzrpuuuijwfituzpiifjpaajraiijajupafuwuuuwfarijauapfrujjzrptzizjwjiujfrupattpauaiuurfppizzijijtajfijwzratajauauufuiawfzafwtffiiuiztjiupiuzapfzfzjiwtirujujipurrjffzwutzwziiwwrzfftprruzjaffppurptrrutjafruzuawzutifiijwzutizpapprpjrrufziizutrpifuraartrrupfrfrfufjurtiaiutzfapawtzjfirpzaprfrtwjwwiatjrafpwtrztjzaprzazwwpiaratjrzauipzfzafauuujuaatupupfppapiizjzatwwifuiuptptafztwtajujruupuizafwfzwfuzfazwruurpzpfrwtwufzpiaffuzzupurrzipwjwrwzrztrztzjzjuiwwzrjuwizruuwfaztarjwwffpjpwppuauziatwwtwuuwuipwwwjjpuzftwwpartpjpuwapiztupizfparfuwitittpuuizwwararpjwjuafzaajaiiprwrfftzrutawrjfjjffziirtrffjujjffpzafraaufzrjurztpwtwjjtjpzjuiawzjiztjfijjwjzujaujptfffftaparjzijwifapawpitpiwjzizutpzzrtjjapfujzwzzwrrafiujprwrttftiptijifffijpwpattapwazjftappapzftpitfwwiazzjujuturrrajipjuuuutrrjarirtauurauwirwizrrifpptazpjjijjrpfajafiizjtzzzzapzpajawpfrizwaijrtwrrzuppazjjppzrpaijfwzuzrttwaitzuptfpjjjaparfrtaruzriffaattufwtpwwwttptjiwwfiaujtrwfrafzpifuwiwrprjtapfiaafjtpwrrrpfrrpfawapttztiupztaurtfwjiuwjiaufwzpptuawajjriaffaiiuafattzwiauurpuupzzaafrttwfpziwfjzjtprrpjruiruuriurziijrijjfautjjwzrraaiwwjrjjwjjaijfjfauzfirtfztutfwujwzpzpwufijajijjaartuuiijiafpatufwzfrjizrjwtuujjrfajwurizwwurpwjwjafwatpufzzziwjzauzjijaupzuifffufztwtipzpuaizajwptziwpitwrfjwarurzpjipffuuzjzrpajjtajruzijfuurraaipjzjwwuirpjtprzfffjrrfpwjfrrrupijttpzuipiuwtputwijtwuiapjpjftirfauazwpfizpiwzwapatuajupufufzfipaaapptrupppfwtrwwjiuwfprzrjutrijwjpwzirfpturupatpuazjijtwjzwaariujtfpzfwwffzzrfpuwfiraftarzffaujajrrrjrtirjatjwpjrpfpuitwpupiftpapirratufjjwupjfuuwtftrjupawiaajjiijarizwriippiuturrwfuwziafrpifjfwjujzafrujpprtifzpturrrzajrzuujwfuuuawittfzazizjrjitwfjrpzfpuzipfrratuptpajriuiuatttfptifapfwtuztzjrzuwpzafaaazzpfuaawzjipawrafriiriruippipwwwzzttaiitztjtzjfijtwazwrtpfjtputauwptaatitwuiwafjfpfjtzfwzaawztttufiuitaititawtuwpajuuwrzwatzautwpzzuatafazuzrfaijfjurirprrzuzfzwrpzarpfwiwzjruzpaparzjjpifaawpfizptjtrfjzatffapwzwwtuttiiffjrpffifpztjiupuwuuipufrajifpiuufiwijitiiwupjriwpiazjrprrirjzpwairtaztfujzaatazwwrrjrtztfupjpzwuiujautwjutfwufuzzpatjfzipapfwztparpjiwiuuupffrprjwutwwwawwftjjrpturzrwuurapzrpfrirrraauziirfzurjffpraarjjajtwufwzrrttztujpzufpuaijtuajjtrpjfiawiffrratwuzwpiafwjjwaajtrauitjafffaawrrzijfpwpiwrwwzzrwpzzuwriizjijiuatwitwrpaziittpuiwtjrjpzjizitwjzprjwfatafafuaafpwtrpuaijpwurizwwjpwuifaiiafrjfwrtjwtrujftwpwjapppzjfprtuijrttajpzuuautfftpfjpfrfizzjrzfuwzifiwiajjafrfrurjrizpttzzaziiuwrfupijpzztjaijafrffjzutfutfuiapftwfiwafjuuzttpputrppwtpiffiizauzjipztuwitzjuwujrwaiitriuiaitzajipruwrffztaziprwjtaptzjjjajwufitriprairpfztjjtipiwtaupwpwiuztjwttrijttftwpjijwwzffzuzaaiwjtpuawtwzftjfwpjzjztrffrrziiarrzztuzrurrjprfpprtuwwuizfwzpifwaffaizwpzjiprwpfftirpzajtritfpwfuzzitwzttfrrwrppjiarftjwatijazriziiarazjzzuawrfrrzrjzjizpzzrffzpwapzuzifzafjwrptipwttwurrzjzzaupjuufijtrtpufuwwrfrwtijtiwfwfufwzauajpjtzffwwatzjuajauzazaazzjjauuapfrtprjwzrfifztziiuzjuttaaaazzpzfjffazjajuwtftfauppzpzjajjtfjpfaipptufwtzzzfrjaifzppwftrpwifjirzrfrfijpwpaizwftjzraiptirfutuwjauutjtwppzuttrjwzirpizuppiaruwppwpwauipfuippifupprjraawptrwfpftwiaapapppiaiujirtawftriffajatzwrtraurppwfiaujizziazrafzifwwiupazjraiiuztzifjwiwjauwtuirptfuwuitppattujtzfuwuiutpjfjtprfpptatrjiazzuwzuatrjiwrwjtrifiwfwfwzwtarzirfffuzzartujffutjiiazwapaatfufiwzpiwtipapzpfutrfpujaajffruaitfruztppwjtffzjitazjprwuupatjtawrfapzaaawpwaujffjtpjwpjuafuaaaujfjzipriupttfzjpfifiaatwwjitiuarppftautupjpwpttfpzauzpitwwruiufuppjazarzfjiuftrzutafwzuupjpzzrzfzriafrpiapatwrwiiputrpfafwaifftptwiuttfrtawitfujzprifupjjwfiirpwfipzrajpawputapwratjraparututuwrrtftzttiijftutufrppzffruzafazirafzzjjajiuritfputzwrwjitfzaipijaifrwirzupitjitzizjaraptjjtjaztzifjuawfpppurwrutaarwiurzfurrapirrjfpufiftzffazpfiptpiraaatrftpjizrwutfiwaaawtrurrtzrpzrwjjpwrajajurufrzawtututijrfirrirwfpuwurtwpwwptwazzawfarairtwrrtjrjjwrpprpitfrpwaiiwtwrwifjprjfwrtwttpwfjatwrupajufiapzauwtupprprufuzitrjiwrizrpprwufftuurrzarripfwiiftpriwijaiupjuwwuittzfprtwiprtrpjjujarjfazptjwtipirjzfiwzraiptuwfjiittpppiujppiutzizruzjuuajzwitztjufzriijwwiuziwipuruupitafujzfaarjfifiuwfjtwuafuaauujzijupjrirjfwwzpijrjzjraifirjriiiijrutriwwtzjwjrtrujwifuuiutwuuazjrfrrrirujirztitujatjuzptwrfrjuujirwuauzjuuuzfpprpzfpzjufjzaujpjautjuzuwfffurtzpauzprapzujjwzupfuwruujajzwiaupratuurujfwawffifzauzzarrwfprifawzrpaptjtfrpuratrtpjpwwtziwartrziizzufuawawjuzutarptriwaaufpzafuiwaiaawpjjwrzprairfzafajprzrfjjaitzwiwzjtaaajtjzirftputjtawzjijrippiuwaiazazzaijrjrtjpuupjwawrupauzuwpptutwzffritjruatziuwtfuuzzizppfazipfzpzjriujzjrtuariwwizwwfjzzwjwzizpiwrwiraprujptftirzzrwrfizrfriurfuzrjarazifajrjafaruzupppzjfwjpzufjjtaipiiwiuuuipzuizurupauzjzwtutwiwpapjjftirujuufwiwrtwpizpwurawuwuuuawprarfutjuzjjpiiwzajrwriarfwwwtizuiaruizfrufzatprafrfptapjwrprruattrjpuzuautfwzzjarrifzzzuirarpwwrrzaafjftafrtprzrauafipapjuaffttjiriwazzwpzpfprajfawzpizppruwjzjaiatrprizttuurwutrwfarzuttjuaarzajwaptttawjftwpjjatzwutwzapjzirwpaawtzujjurptujututtrjzaaawtiiruauutawaajiupufptfaipjrauripjrrziufurtfapuzariapjzfpjttaujjtpjfjiwijrattztptzupjfrzafauarpttpzifaapawfitifzirfzrpiirtwrwwpwijirutuffaiipwaawajztffjizifpfiwfitziirzuriufiaptatupfitziirwazpirrauwtrpwprjafiujzfprfaauiruajjauiiujuturizuwppiuzjrjfapaijiaazajjpizjzufuzwjauzapuazauzappfprttajrzajtwrfjujjrtjrfiittiuupjutfufwzatwtzwufwtajwippfiftttfwwjajarpiifjzajfwurafrjjzzpuujwfjfiawaaafzpiaaturarrptifufjitzaztfawfuztrraruitauizziwwftajazizjpaatzizfuuiauftiziziftwwwauratftzutzifiawzfriwfwiztfpwpratzrtjijawujiaaaajzapjuurfufwjpztwzuwpjtzrrtffiurajiafjrufaaztpfppuzrjjfajuraiprttjfapiapwufzjprrriifzppfzwuwuwuirjriwtztuitfiiwirazrpfiprpjtzpzjpjzfifwftppzapwrfwajaazptiwwpwwiprarjfwjuiaprzfiiijtutatiifrawiwtjwtrrrwpuwfruarwwiauaiaftjirjziuiapurwurapfzzitziarptjwjizaffpiaaauziitftirujfupippipwrizjwtjpajfwtzafuutipapfratwjpautwatjipfjiwtfuijirfptawzuztazprjfzipjaariiuwzuzjfttpuiiurtftfzirjwprarratrjpiufiurttfufupfazffrurpapwujruttrttiutjzjtwtwjuutzfifttutpptjruzjartjirtrziwaairwtaitfzztzfwratwwfwjiwwrzrufiuzppfpiaffazzzfjffpfzziuiapzjzjrzipzrffjaitfftpzipufuzpfiiijwfwpfijajjziwppjfjtuafwufaufwtitapwtrjruwjptupuizajwujpuuzfzwfufuzipwjtfzuuuzpijirpuwiiufazawwautffrafzripwffiautwjfaiufptipwjuufptuuprtaprpuztrtjtzrfwftrfjzauwijrtrufrzfrajpzjuuiwpazrwzfujpuifirtzzzzzzzjrpujufipjizzuziuaurpjfjaawttfpzwuajzjiriatuzfjazjjrupaiapjafwjrjutrtajuzwazfiwurfpzpafzwarffaajptiaputuiauffujafiitppaajjjwwrjfwirarrffritwftptwiittwuftfztfwprwitpjwzpwazfitfuaawftjzwpzzjwitizwatrttaitpwiwtftzijtuztfiuiztwpfiifaiafjwffztfwartjuitatirzzzpppuiwzwuraztjwtpztzjipupwirijuttuurffpiwtuaarwwjuzfjufjuraffpfapwwjzftztftwfiftfrjrawjpwrpfjafiajrzzirrtfritjijfwziiwrjjfjpzuazjwjwjwfpuzpputfwtwfjrwiirizujipprwrpfirwtjfppziiuawuauapwafwftpuwrpjazawrftzttruupttjpaaazzfpijrfzuprfwzupziaauptptipwfwuprfzprjfitfaazjiijjuwziptjzrrtijwupaawffjrirrwtiizujrtupawuwzitfrrijjzirzrfuzatjfwawaaajrjwrjizjrpujupujupitwtrtfaiwiwwtuurfwartrjzzztturazwuzwuwwizfuzfajrfwfitiurzwpuuiwrawrtfztuzpzrwuztjzppuajrzutpurpajfizzwrfitrzupzpfzjffaprajizapptfzaapfiajwtjfutawjupjpujzwuatraztatiwwpjrujfpzzjpppaaiftwupfwiuputuriruiairjijpawatzurfftrpiuuipazpuwirafjpjztjpjwpffptjrjpaajriaijwawazrffrjwazttffwruprrtwtrjtwptjutjpwafazpzairifwuaptujwfrtfpwtwwiiiuipiptfjfujazurujwruzatizrwruwizrwiuwufuawpjuwupprpzuutuifwittfrafjrpptujwrjfwuafuuwwwuutatpwtpzirwtatrawrzfuptauzfzzzzjwfwartiwzawuafwrjtiaziaijipuizfirrarijtwpfjuzztuifzjuafuffipjiujiwtjaffzutiappauipuuzuajtutaiauufafiitrirprjrwfprafffruztrfitpjifafuwfzirtirazzwarafwzirfttwwjufaraaafrtpparpairajffwupzautzjfwauriztazfffwwwizzffptafpttjuwjztwwpjrfuftzpjpwtjizaurjtrauffwptizzjufjazpuzptwzitzwzwjpprjatirjwtrjptpriufiwatfajuiipzwwfwuffrjtfaatrprujjwijijaiazaafawprwipurrffwjaziwuizuapatwfjrjjtzawrjzataztprzawtiufjritfawwttjfwjjzatzuzfwjwrawtjzjtiztutzapazpzifptaawrzrzaajtafiwifwffriutfjzzizrtaazuzuataziztuutzzifftzjrafujripizwrartufrzwpfitiftwtpruiauawrfrrppuwufpiwwtiiiwfuwujttfijjpaiiffajtpziruaaarwwfzwtpitwrpuprtrzaptpajiwtjtzraffwiafzzipwuufrzuuifjufraurauauatutwrrrjtfprfjwuzpaztzwpttwjjuwzpuwfzzprtzfwuttfrajarjpjjtuutrzfzizuprfipzawwzjfzirujuzazpiutjurzjuajirzwaawpzuitaiijtaiiruwwpwuuiuttfpipiztjazrzfttjtjuwrafrfrwfjtwwpipfuiparpjujptzpwtzpftzzrrifzpujuzffattwjuzruuwfapaaupfrfutazrijjtutrujtjawpptwwpwuiraftjwiwufziftwpjawwrztirtafjarzpijfzjrapijfwiaufurfjpfrwurpjparatpirrwzuruzjafiraiwjpraauztiajpifruzrujwtziwjartizpwfffapwaifitptaitifjuztaiajfrtrfrirrptaiitafuftpaiatjjuaupwrtrjrrzwzuzafrfwurjfrifzrafzfujpwjjarjpjitarjrwrauwpuauipiwituifpuuuwptarjfitrpzujjtwjwtrjwfapfwtpwfutatzfrfiizarirtifjizfujrwwapazjfurfrwwwitzajaapzijjapirzwitrpizpijffajuufrwuwpprtzzprutipajppawirwfftuzttafjizititirfpfutttfazwjzrfauziffffzpurutatwiiauirapufitziuipfzpupppfuzwazauzajfzuufwtuzujjitruapfjiuzurtuffitazaurfjjaawapjrjtaartpzizaprirjzzuaizwjuuatjfjffujwparwzrfifzfttwfuffrftwaawtwzwttwzzruiparrwpfajupzwuttiwwptfwjfritawuppfpjiiwuwuiitfirzijrjtzuwzwwtfuipwprjwjftafjwpjpzrupfujzfrpwjtwzutjiapztjppfrtrfwiftiurzrjzujiirtrjrzifrjurifiturzuwzuafitfwwwuiwwjjaurifuataapjfiitpwrjpfpwrapapzrrtwiapiwifzujwaiwziwjparwzjaaijjaipawwaufjuwftwptjazpwujiztztfirtrjztfiafwrzriipftprzajwpzuwrupfarzwtitijwwrjtiiujupzawffarrzrwztwuiwwafzitaiwwiijjrjuitjpzwtiaptjrfrjztruauwtwuputtwujijtuafawatpzpizatfrzuuwuzjtrizjaapiwwpuuizfazfzipfprrrwzzrwipizwrppuijuwrjafwipiiriijrfziftwartuwzfrjfiafatijfaizwajzwzajuztzjijaaaffaftazutawjppwjwujtrjwjitraaturpuizfrwwrjpajazijwjpjwfjuptzzuzwrtrztpftzzrazzpjatiwppffffuzjffirtauptzutuijtjuujrwwwufifpazuuuuiapapwzztiitufrwujitwzwttirwfjfizuffjftpfpjjuuzfwawwtruprawpaufapwauupfzzfjwfutuffaarpizrjiwttfujzfuzauwzfapufapupiipztjrpzfpfjujtpjwftziffppuuzjraarzrjjizjrpfatipjfuptizzwtuwfpfittpwffwjiuzuztrifpirarjwpjfpfjuftajpzauitwaarzttwjjzjwijjrtwrptattapwzpwutzipaizwztjipjrpitfjjpjtifzfujfttwrjjwwzajjfttuzapizfzpzttjpztaitrjrwwapzftaiiiwrpjtuawazzjrjzwrawapttpuzwitjarwujptzfrjfujfuuzpwijfjtffprfaaziwwwziuaptzttjfutaazawtirfafuuwiuurpwzripizttrzjrtwzrrfrrrrjrriwpurtriuztapfrtauuuafirfjjtpitwjfuitfftrujzjfjuupiaawrfiwftpujjuuwuwtprwzripaprurrtawufriwzuafuarziwjpuipiafuupwzituiaziirfwrfjapfpzpwtjjijptuzjtawrtjtftftujuaupjrwffjuwzafwwjutjrtfarffpufawfjifitarautizaiwfpapztiuzfiwztfizrftjjtawzzwaizptizfprarpfrrwttrupujtrrfuzutrrfufrzirjprpzjarppzrjiraprfaafzajfuupzwfizrfwwatipwwfufpziwwftjzrwffzwiarrfazizrrzjjuaipfzritufriifpatpufjuwapitzazprtwjjjuaaujuwazfpuwuwjjtfjjztaatizpttfzprtfifpttrrtaarttrtiuawuujujijjftjujaiatjwfpufffrzuwaiuuutzttuttrwatjaztjawfparauffiauwjtztuffutfazpzrpjrjjauirzirzfftrtwawpwazratprtrrrarzwwtauppattjfwfptuutujwiuwrfwujtpwfuijutriiwzjuruzazjjjuzzzipuwiiwffarpuaufjifzztjrjrfpzftfuarriiutpuiitziziiaajpztrzuiiwutatirtrfurizwtffizfpjujijttajwrtjwpurpzuaaijpfzziujprwiifurzrfjfauurfjajtfapjrrzwtzrifizrawaffiaizpazwfufrpaztfrtiiruwjuuprarijwfauwpzwfrafaiuufjurpwarfrjutffziajtrfwiwuffifjfuajpzrfzaizzrjjptiujjwrijziuitipjtutttiazjprrruaffuwajffpirraatzrwafijtwijtrirrwippftfaiafjfuajfuptaiwwizttjpafutwztfzfipztauujzuajfiatpjtujwipazpaupfrauuutrjtjrrzzztwwpzuuawpawzuurzpprjizftjrpatwrrtrtwauwttawiawtwwpziturfwiiujpitjawjzptziaajitwfptiujpirfffwfzfipwpifjwaprafrfuujzjiftwtwawuzijiijarutijrrapjtrzjffrputatzrpjaipuftwrwururijpzpzuiuuwuwtfriziuazraatrjjwwtppfzujfuuuufzrjtwaiwaffzpwifpprzafrirfufurwaiutjazuatwrrrpawjzztttifpjfwjwizrwfrzujrtwrpptputuifpzaippaprppuiruwtpfrwijjpfppapjtjuartrrzurartwrjirafjrawzztrauziaatpriirffwataaauptptfjjtupzuwuwujtjutirtjffitrzauwiarrjwwrifpfwztauzjitpftzrfjffrzruijttfatfftjwjfujfwaptfirrjttrwjpuaizwrjafpjiattifujwjrtwuzufjjffzfrzwuitjuujwitzfztzftuaarzzipwfjwjzjjiratwfwzjuwzfzzwzwawzraatazptfjwuwapwtawuzjjaiijpfwjzwtfwfujfajptftajawraiwpfrufzjaijtaazaafuwwijpatzpuzzrzpizuppaftfzuifwafppapwfjpjratiitfzwzwaiwtiurjpajiritpztjwpuprwuturztzjiwzrizzjarpwwwzfttfpafjztjpawiuftpzptfufipwwiupuuitrrjafarfjrwutptzjpttptwuzutfwftjzfwrrjwtjtptpfwazuitaupiwpwwirfzftjfuuawpttauuzttzzjjffzjtrawfzzufjzafpfwzfriitarwttuwziifptfftjijwipitzutjazrpfittjuifutrpuwizjifftirjjjauzriwruwpupuprwwpitaprffuuutarrjaiappzfariwaifzwifajiifjrazwttppjzwrfpiupwuutarjpzziwipwujijtpzrujurtritfztizjurtrwarpjrfzauwapjzuztjfjttzrpzfpzipztzauwwzirwwwzipzrfrtatajaiwupfwpriifjauzfatwjfwfjzttufwapapruujirziwftawfrfzzwrffutuwfwijuuraawiuairpjtfatpaarjfzrpwjpztwtrzfawwwzupzfpraprujfrfjprtziawrjrftzrippjarpwpfrfawwpfutpprutzaufjipztwftrwirpjtuwtfifupfujziiiwfatufiiwtauizifpiwiztwatrzfjprpprfwiwtfurrwzjfpaazjwfpjpffiituajfrriuipatariwfpwptwwtatpftzjwjafjaatfwapfrruwwprizffwiarzatftztzzijjpwtajwaaujzzaptpiiztiwuifupaizpiwurttftaafzwpifpwrajftuizztuuuitriajprrtuiafazrauiaiwitpwzprzatrjfzjpiwjrrwttaiaiwwifauzzpwrizwujutpatituauupiiwifzizziztauzpazafzpwpiafrrjitzfzwtpiffziipwizjpiuppfazajiztwirafpwuizjwzziwupijttuuwwpuawztrifutfzazjwfzjutazuwjrjrfarptptizffjjrfaaapaiwuazawfptpfpiuifzraaauzziaitftpwiwjfujfjuuzfjuiaiuftifjtzjziwwuiwwpaaiptfttwzrzupzfztfazttfzrijaifauwpjwpffztiafpjzafrpriptizztpufwwwwjujfujjptaizauzafifpuztjwiprpjpuwizwftjjparwiwtruwttiftzuppiprifartaufjzitfzirzipuiazupaaiwwttarfzttrjzajpiaijjrftpuipaizzjzwufwuftiwizfwttuuujjrrjjtajrjurwtptruziijipziwtrpfzwjpwwwtpatzjjitaturrfwwiafrpjujwfizajftuitppauftwapwfafatfaijwatfppzuiarjtwatjzzrirtjztpjrfwajauiftatztfipwrauipptitwfpiiptjpfpzpuijuzfrrtaifuuzrjjwwfzippatzffjpwtpzwwiwfurfzapizjzjipufjwauttifrwzfrrpwarppztrjfttiujppautpfwjzjaaazifautzrttjprtwizwfuafttjttpjtzrpruwtjwtparafzajprjzfjiajjufupfawawiwwtiiiizzpwzpatitjjjfpwuiaarurzzpuzirpzrftfzfurpzfiiuuipirpriwzijfwaatfjitzpujzrjrtiaafuutwfpaftpatiattautpwfarrtjrpwzrfpuziwfpwjujwzfjpppfraajrrffuuzawrtzaatippfipzpuuftfpwzfjrftawwiwifjjatzuufaifzpajuarirwzzazwpjwuzwatzaiiujfuijfppuujwrutpwipwftuujuzapuafpprpfitpjifpppjjrtuiwiaazzpjfzffupfjfwpajttpurzuirzfufruizpiwjiirizwirajjrzartufwzrjwpfpifwppzfiaaiapartiuwwtwufrpupfpjiuajtfppuruurwjjrwtttriupptrftjprwpfapwwfzzrfpuuwfptrpiutiaffiuuuapiafjprzrwjaitiawrijjpriwauzutjpiuzipufattwawjfppututputzijzriwipifpiujtiiuiziajazftzupuzprwrpfuijiwtrzzuftirrfrwpwzwwafjfaujfptarjrriptrpwraapfpziaujztwriwptrfptrzfjttzfprijriwratffzippfjajwjtzrawirffffzpzuuptrtfzpjzrprjtwwjzfuauuwwwjjzfjtazfpzaraijwpiiuuwjjpjwuzftjrrpjaftziiijfiujfftuffjatuzjautwrwzpiipzuwtattjwjuzrftfuraiwrriptfrtjtrtzptiztuwiztjjuipwriufjwrrzzpwapitrrwpjjfiuuppjatfrufauwpppftfirruzwuwpffarjrjjajjjipjtapwtuwpijppuwajizwfrwtptwiiwwtjpizuiurwifjuiuprirtjfraraujjpfapiptwzjuuurpfafwtifzuztwzfzupriiwipfuwuairfrptfwwizwjzaaiaujtwfwwjpapfpzufuurfpfutzrtwjjfwautpjjjafipuzijzjaiziwaaziwartijzffzifritfaaiupuptpapfujatpiawzpzwazppprjpfrrtrutztifawwuiizwrizpafrawrwwarrprijzzurfwiiztzzujzartzwrazputfrrauuauptftaiwurarwarjwzirrwjftzpifiajatjuautwpwrriiwipttijuturtwfjfjtfzaairifjfuwijrzjpwtfuzjajwziutpirufjzwtijfjrwfffwwjjpjturwujpfapriujpprfpawfupwttjazrfjfjiajawufpjjfjiiupzautawuifuwwrpiptuwuufarzuazjizwuiftataituzurtjaifazrtfzifwifiifazrujujfatrafjrpirutiipzpirtwufzppufzuziajzrwwzpwfawprpautpitutuupwjzzjrzuwawtzarzpfttattjarjrwfupirfpuiuffjattppzijfajajatwiifjfwjzztfuuruizaaujfaajwajfzftuziitwztzupitipwzptwtzapwpirawfiawzajrzwjrjztifuiwufittwptawizraruuuatjurwtwtwfurjtrwarzffatfujjfprzwtjpijwuajfwatafiprtaatzzrjtirazjwuiurjaurpjjpzzzjipfrfariftfiuipwztapjizaurpawtrpurftiuaazarwftpziiapijwrwfzitjfitrtafprfppppftfaruiwuzwtzwuffjtfjwwpzppufutpjwfijurruirauupitjjijufpawzfizurwiaztjpfwjjwpjzzjpizpuztauzptafzaptzzjprarzawaawjatwatjjwwpfrwziiftjzjfwwpajuauiuaziwtrutwrpwitjjfrfwwrputijtrtrruuajtzjttarrafjrufirwafiurazffpawajtfwpzitftfjuartjpttzzjptwjfpzpzjpjrpzzapajwwpfujfittftpjtujzfpwariiafazfajriuuitfzaarfjptitjruaipfrpupurpjrtfuiuzijpiffwitfutzjpzwzizrwizfzrjirzpjaiatjijwjrrrtjujturwzaziprztrwjartjtarttffarztjttatpijwfjfatirjzupizatrtptttwwutzpwzzufrufaarrfffujfjuwtpfajpjafaitfuatwwwrttpziapriwtrjuzjzifjjwjuzztaufftjatizwiruafuzrijzuwufipazwpwttujiafajjzujrautjazjpzjrttzfzwapjjwuwwfaprjuzzjfiizuwwitzptztriuuuppuppuftjurpjtatfuarzrawzfptwzwfirwiwfutztujzzitwuupiufiajfpwpruttuttwwtzrwrapfwtirtjtfiawutprpipaarrwizttfzwzpuawjwtuppjirrwuufprputjffiwwfpatifiwawuarpipfzrrtwzzzapztiwpjffujtpfjtfuuptztpptjuuiwaupappfauziatitzzttrfruzftrwrwjijriatiffpfrfttpfijjwwpuupziwjuwpitifzpjwwfwatjfwwawwftzaiawfjrutajfiwiatiruuifuituzuizpwjiuafzrirtjuuuwrfarjzztiurrauitpawiwtwpaffzrpwftzijuijfpupuiauapwritfzwazrzujjwziiaufffitwpjfizuzjzztrtpajfiazarjrffzjtwizwjjppifrirtprwijzttujpzftzujziaturauzwztjiuarjtajrifwrwupwzujajztpuijzptwwwarjipfwpjjaztrzfarzfiuiwuwzpztaatwzwaafriafzttfpjjtzizrrurrffpaufjpfrwfaawzfautaapwzfiufrirurriupfijfzapwutwiazpaijtwzupttzwiizpjzrziajzzpzjuwtzztzjaitjfpttauwpjwupuaijrpfaruuruparzttjifrjrazpwrapptjrzjuwfiaiuuzfuariwaffwuuzautataitfafzapirjfaurppttaujirrfizruuuztrfwjzazrfurippwiujajrtutfjjirtwzwptfpwrwitzuipzzwiwtpazfjpjfafufzuuwztautafjapujtrttwftjirpuwafzrpjwajwptpatiritrarfpzpitfffztiaapiwjtwfiuwpaijfazaatpijzatiwzjwpirjiirjtfjurfjjzaufpuataafwrwauzzjuiwapjffuuwjftjiirwjupaaawjzziajaazrzuujrziwjtrfftrtuwtzifiirpzfuwipfiawfafarzuzzujprjruuprrizprpwtaijwpfrptwttrwfuzwrarrfpfftaurzpfppttuwapaajuzwttipururrpzjpjtuzaiujuutrpzupifffprrpurwwpuapipzuarfiitwjfpuptitwfujztwtwwwwwizaffrajtjutjufjfarruuiatpzrzrpttfitfiafutwpjfzifaiaftwjwawrfwawfuzaftjutiwufjawiriztfiawjijzpurjrwzftzrutjjwttfirttrujiwiuapatwitwzfpiwzurarauuaujfrjrfjwaapwiiutrutuzjptiwwiaizjtzjruajiwurawajutwrpfarfftjwpzfjujupfupiwjjrwwprrwjzijtajzziztipujztzrjapttjjauaauwftpprwftaauzuufrtifuzuiarirzuuuppfpaaiuizarapujfuarparpiurifrzaitprazauzuartaazwauaijrwupjrrzaufzajtpjtzjpaauiazjwufffzifiparuirpzjfzfirpwzrpirwuztwuuzwaauiprjwuwutuiaztttiuiaawwpupizujiwfujrtiwafatfrajaiufpttjrpuzzuwfwuijrartfftztpfjitzzrfaawwtfrpjzawjtwrjuizwwjtjwziuwzzrarizztfujftwawauaarprzaaairrftpwipjwprtzjututjrrjjrziazwzwppzuwrujzfutftrffijrpfzipftrfpifzwiijuutzzipjiippifzuuujiwrttjzuwtzrwzjfuwfwzfzapriizptiffztffrifpaautijawtrtzzwrzrjwajjajrujirrtururazftpwprpzuawiipiaiwirtpjwrutpjiziaazfituuwwjtrzjtjztpprtfazzrafaawptufuujrrftztifjpfjtwptfrjpfpfiifijwwwiptijatraptuifjjzjawwupwuzrfwijrpzjrjrjpwauwtzrpzpwajpifuzfzrtiafuajzrfwfuaizfzjztftrawazwtiirwujwuzwuzwirwujjfzwjawtpwpwriwwpzwtpzppwtauzfatarjaipfawtztwzifritauurutzprftptzptuijrutaiiarturaupwuwjuirajwizaajztajpiujpurtiizrizrarwwiwruiffirfpiiftzuatpfjjzwaijjwaiwtaatffttpijfaitzwijrfpuuuzfrtwrpjzfziiztfjzjajuiupazarzrfwizfpjfatfzitiwapitpujjzizuratiuuuwiziurriwtzzifufrwrrriizzttuaraiwpfffjatuputjprzzrripjiiitutraupwwjwuutttpauufjuwjiapujjttiiftpujrtjpzupjrupauurtriwiwjjrttjfpztpzpaazatrjfwzujjurprjwfwtizptrapwwrzuizuprrtrwjiffrjzaiarptjjtjtpjtwaurzapwjruaatitifiwizpiwzwiipizpfzfpaazuiifjajutwtjjpwpuziuifiwzppujrzffwtrifttzuparjauzfppurwauzwiwfiazufpwzutajtapiwjuajpwpwiiwtwwuwwaufapwuutrwtzfaffwtwaratjapiriruwuiaaijpajifurppapizrtpjraiuzizzizpiwpwijuwpaftwjftpuawizajffrtfzatptjirraufwtrputzzftirjpzpipiwraapjjjzrpuzfrzzruipwtpijfiwurarwatuziufzzjfizirtjtjirfftprruiaurjiptfjtfrizifptpuuiawwwzrzrwppazatjzpijrwprwfzrazffuzrrtapipjiiwzpfrizajwwawzpjiwwwpwiiupfriaziajzztaujzizuaafftfjpzwiipifrutpaupfjffzppfaurrwrjiaaazpjpiiawiriapazwurfifzfjutjraiirjiufwpuzzwarpjfwiprttwffwupazripzairtfwriaapfjtaiafwzppafrwuizjuuzfaaazazaijfwjuupzpzifwfztrijuiirrrzujrjifppiwawrjffajzfaprfutautraaffzauittippjzfjzuwwujpjfpauuuzaiijwjrtuztippjjttfwuatriftpriujaatjjfpwfuriwtzfuaiwfjwiuuapiuffjairwpaauzputatuwwrwruwaiuuujiaziuzfzpwaaiaurufpjuawfpfwatfuiwpjwjazrfrpizupjtrjiiuwrtijprujfjfitrzizwupuztpaafiapauwriwuftwwzjpwtruiifririjawaazuapfzrrwputzazwauijpttrfirfztuzwiwtzaifutuuatpttprwtppjwtwtjfjrzurwrapurapaifptjzpufauprrizftprujwtuzfrttfuwwjafwrftrpwatzjwpaiwztajpfiztzupfuizpaaurjjuzwriizuprwpapftzaawpafuwftruttiuipzizpffjwtrtfrzzwfrjprfjiurjiaipzjzaapitiujftfpzwuuufwffaputrjizfpjfipataiwftwjitjjjptriziaftrfpzawttturwztwzuzptrrpjapiwwtzuzuawpwruapjrfzpfzauppiitiwjjawjwufruawijfjaurwiwzwwzppztziwwaziuapajptzzifuzziuuzfujupfzprurwpujzatjwjjuaaraiwpwiiaazrzzirfipturprpzpfjjujwwtjjfaipjffiututffuwiauauaifiutipjfwjatuwuuwtjtrffjrjjwpjrwrrupzijwfwautrttuipraapfuzzfuptjazrpiiatwpiurjjjwffpitfauwzrprtarzwaafjwawizzjwppzzwzwtpwjirtffriifffuiautwtiwiaipjjiriazwpwpuzptiufjffpujiuifaawtrwaizfzjjuirrfrrrjaujtafjtttrfprjizzpjrjattjrwwzwzjiuwjprfujztrawujurjptrprptjfztfjutupwjuafpwrupujujrafjwiuwtzprapwjwjrztfwtruiauartrttztrapawaaffpiuaaratpzjjrwfpipzjppzraifuwaurjwiwfifpjppjrjtrfwfrzjjwjtuauatipuripjirwipiiifpwrjiijwwurttazzurfiajrzraiwzfaiijfutjtaauuwztjjjwtzwpiurjjtijiazpfwwtjrtiarpwwiwuwaarwizajfrpzfztirftfijfawrizfpwpupfjjrzaippfzrtuufuwirwruujfjtpajpaiuawfzfwztwafipjfjrrtzufptppfiwrutwpzjwwuwutitfjuzjutpwppzufpuzjrpuppawrittiuiajffuwuwjjuiwiftawpptzwafariurtfffziztizujfattifjatufupptuurwaaiiujuaaztiuzrwiatzfwzwwjrfiffrfjpfwtttwjawftufazwwpzfrprzujuuzwuiijzuazzzuwtiziwaupppwppuwitjtpffpwajjfarpffrwupfiwjpffztuzptwfwtzppfwjpifipfzaffzpjaurtfiijuiptawrptizajpffjurjtjiatruawpatirzfuatzfjrrjzipurpzwaztjujawwapfaaiurrfzttjawurpwzatttaratpuipjprjwtfwppztawpztujwiptrfifatzwpfarpazwuzfazpjfjtpiijtajzwpztjtziprzfptftjaiiwuzruiwafawtjauirjzuizrfftiarztzwiirjzuzjwfutjzjrpjaatpwjuiippijtzajaupwftrazjfzrfiprwfzurzuzajruzizzjjfzjjjwttpwtiprtujrfrrwrtupjpziauipwitpzfpjptwzijuupztzauutawafzrtwrazpifupjpwafujzpwwftrzfpuapiurpjuaurtjjpwwpzrppuprzutfrruffritfpziirtzzrffftatfwwtfiaftupafturfarapzrujutrtiiiwpuitauprzjawuitppaaiwizffzjrjtjwuuaupiirjrfpfwafjfiufwzruwwajipfwtwtiputrffiuzwjjaurpjaauuwfztpziwipuujfizrtzaupwrpfjpwjfzrujwtrjrrjuwrurzwtjtfpfiatrpwuzwwffzrwzwwrpiawjauujpfjjrffajrzzfzripzijaatzwpafjtfwiiapuzzrzftutppttwiziwjrraizjijiajwfuaitruruzrjifwizittifzpjiiptwaiiftfwwjfurazripiziuitjfiiptajpupzptzpazzptjujtppfizajarufjupzzawzuwwziaiizrwzwiaruaaiuuuwwjjpizzjzriiiitpfwijffapuifwzarzppjpfauzzztpuwuuzzpriprpiptupzjrfurwuizruuuwirrutruatwzuraijifraiwfjuupwtiuuifzjwupzwaurppttzztfjatzwiwztzfpwutjfwiapfjfrzfrzatfpaiipptuuwwftttwpfprjazijuuttwriprruijptjaajjttfjazzuruiazirt\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 430,
        "task_id": 4108,
        "test_case_id": 11,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "yiizlygglzgpypipzllbzpwgblzziigpgpgywpggbpylpylzlzplwypgwizgpgbywiwwzpygzpgillgbzyiwpwzgppwlbpwzilwilbbbybgzlppgwgyypybbpgbwplzbbzpzbzzzzzzppbwipyzzylyyyibwipyzbyzpygppggibzzlgpzwyglglbywwiglyggbzyzwgpzillgybypbywygzpwzligpwlzwizbpwbzzybzyyglbplpzlgzzipplizbgpgpggylgzybplwyyggyiybppzzibzlpgwplilwigbypzzipgyglibzwzplpglgpzwgwgwwwygzlzlgwgillzibgybggbybziwzlwyzlbbgypygizywyiiigllbgpggwipypyzipzzppzbigibgwiiylwwbwwllyziybwyybpwgwzgppiiyzziigwzgplpylibbbgwlzyizgpizlzlppibbigblyzpilipllilgiwzygyippgplpgyzylbzlbpzyzbzgbbgbilzpygigglpbylbyizplylypgppipwiglybilbigyiyzbzggyylzigyygylzpgpwibllwwipgbggblpzbpiylyzlybiyipbwzgzbpiplbwyzpwbbzglbgiglbglgyywbbiwbgyzpwilzyzywlwwypywyzgybyblyzilliilgzyilwgpwpgbypgiwpbggpgiblglgiwgiygliigpblpwiipbzyzyyzgippbplyybwllpwpgwyzyiiwwbpwwpyzbppiyzzbbbppwziibbbbzgpwybpgipgwzzbylizybgylyllzylpybiilyiblzpbbwlyzzzlibplbybzbpbpgbllwwwziiyibigbwlygpzbpgwzzzbybizyzwpigywgzwybwgwwliwwzbpyilpyybwiylibyzbyzbibwgzybyilypgzzpbybplzgwzyzygllzwgbzgzgzzigwzggiibwpbyzwlzliiigpzlzlglpyllyplwwyplyipybizbiliilzbzglgzlgywzzyiwzwbgwzzwpglpgglgygpygbwwibglbgbbwwwbyigwplziwzyglgizpyplbiwizlzybppilpwbbwplywiwwbiippplpllwiwzzglpzywgyiwizpizppylggbwzpliilwgpzgwbyyzziwizzywygpwlppbyililgwppiybplwzpyplgbiwplgbgpbpgwgpbppbzllplypzpbiwzypywiwpigigyyzzzwlywbzgwyigzzbgbgybgybiwppzzlplilbpzlizllbpylwwwgblbblgwlwzlygbbywpplpzlwpbzpglpzbblywgzbwbiywzgygwpgwbbwbyplpizibybiylwiwiwpzyylpbzlyizilwwzzlwizwgpyyyipwlyibwyzpylywgpywbbbwzzwwyiyiiziipylibyggbgwizlzyzzizliizwywzggzbblpwzlizwlpbbzbbgliplizgbzlwpblzbwpibyiyylizwgbpypggyzlyywbwipzzlwlbwyizgbzzpbbgyibbwgylzgwylyiggigbwlggbilgzwyziwybygggpigbbwppipzbbwzpigypwypzgypglyigpbppzgybzlpizppgbygbywgblpbllblizlygilzyzbbwbggybblwlgyigzpzzbpwwpbzbgzpiipgwlpwpzpplliwibzpwplbyggyiwypbgyzyibyllwpygpiywgizyiwlpgyzywwiwbygzizywpwpwzzwblipwbllwbbzwibzzgybglipplzyybyzgpiwiwlzizligzlzyizibpypbillpgzwyppblglwwwzbgpbiigizpplggzblbgbyglzziwwzwiwibzyglbwbypgbbpyygbliggpgybbpiypzliyiiyippiglpbwpzyziyzgzbippwipzppybypglbbigwlyyipppgpbzypibwpwiiwbbzgbwiwpipybllglibgglipgzizzgwyplwwgibibyzzlpgwlpwpiilpggpbllwybigbllpwpybbzzpbpbbzwwipiypgbblwypiizzwbigygwyplybzggiwiwybbygylpibplyliizibpbgwglpiylybgilbypybwilwggzlibizpwpyygylpzpwygiyzlpwyypwbzzppwbwwypypiwlpzbgppypgyyggwipbbwpzwpibiiypzgiwgbppgbbplypwbwlipgllbpzpgpwpzlbzzyzwizwbppziwwgwlgggyiiglplyiiyibggzylbybygbylygyzzzbwwzggbggyizwiiiwwlwzyibiwlypipzwwbzipwwibywpzlzbppwgligiyywwibbwigbylglzzipziipwbwzzwilplgpibllgwiiwbpgblpwwigpzgyibpbyiylwiiyzzwiwbiyglpyyzbbplbwypgyllwwbwlzpgigiwgbliizgliwwilplplpgzlwllbgiypzbyygwpyzyliibwwigyibbzwwbpiggzpwzlbgggzzlybypllbgpzpbipwygibiigizizbyiwyiwigipypiwbzibglwgzzpglygwlzpwgpiyilbgzbpizgwglgypgwzlliplwwppggllywbgwlbgllgylyblglpgzwbwpiwyzywlgygpgywpwlzyzilwyzgigzwgbzzpligzbypigzllplwggwziblbwbbpggiiwlwywwyzpzbipblwzbbwizybwwbppbwyggzpzyppbibigggygwipwlgizybwilzpbpblpyiibibpgzzgyylppwiwwwzzppglipgpwibgpbyzplppywlwyplgygwlglgpbigybppiilplipbggglblblyillbgygwgpggzlbpplggpipzblilpiipgibypzbbwpzygzlzgbyzgyzzigbbbggppwpwlwzpwiwlzbwlgigzgygzzwyzzwzwizzypgpgzpiizzygwipgwpigzyiygypzlwgbiggbwpyillzbpzyllziplwyzypblzgllizwzzgipipzbyibzwbigibggzbpzzipzwiggllwzwiyglgbpiygzpgpplgzwibpwpilllizliywppybilbzwgzwgibgwblppybwyyzbblzibzbzizgwyiiyzwliwgplpplylpggyzwzwyzyiwyizwlzylplzyibwplzgybbyzbplgplpbgyipgyypiiiywybbbzbiwzzggzlyybbwggyzpwbbwiygwipzlwgizygzzipzwppyyplppllzyblblygglplwylpbipylgbiibwgwibzilwigygzzbgypibgwiwgiiiggbyggwppbyiiyylzbiyiylpzpbwywgpglwzigwbiizylypwbpigblizyzlwllwwlgzypliliypiyiywilywylyizwlpipzywizwzgwwlyzpgbywwybzyyzpbzbilbwwgyllpiwyygzyyilwipbgbwywlllbpzgpzywbizizgzpzwzylbwpiizgwzllpziiiwbwwgypzygzbpbwgzgyiypiwwzbblbbzwyggggpypwyzwpiyzbwglwglpwipgippyzlplzgwlwlyziwiglibgbpilziyzywbbpiyyglipgypiwpypglygzwzwlzbzyllppyziwizyzwgyigbbliliillzpggbgywbzzbzwzlggiyplliwzyzpzyzlzbglzyzywybybgzwypilzippzzlzbzibywbygpbyyizyybglylwlyyppiyylppwyzzzlyzbyllyzbplgibzwbbpwbibglzywwywgybzblipiwywibigbyzlzilgbybzywiibgwylywgwwwwligipzlglzgiblwzbgpzgzbpzpywibgwwbwiglpzbzwiipbylzlilgbgwypbbzipgbygzillyiygwbbwbizwyywwllblbggiypwbzwzzwgpzgbwlwzbbizbgllgwbywzwlgwblbiylzwylzbpbzgbibpwzzziyyppwilipywbbbiwgzppllizgwyzwizwipbwlgzybizlbwypipbylpizlzzlzizigblzlwiiblbzpbgwyyigwlgbbybbwbyzlbwizywblgbwigpbyypplyzlglbywlpybzzzzpzzgwzppyylglyilzwzpwzygliygibwgzgblwypigzbzwybbwippwwybgybwlbpzbgizlpwigbygpybzgyiyglbililpbbpbygwzygbyzzwwbwgigiillbpzlyyylyypgbgizypwgyywillzzpipipbbbbppppbpizygpigbgpbgggygiywbyzypliipggpybpwizwzwyilzwylwlbbzbiwllligpyiplgwzbzzybyzgzigwbbpizpwyzllbpibylwyzwbbibipywwbblbiblwzlilwiipbigbglbgigwwlygbgylzggpwgpgibbpzgillpibgwpzblglgizgwiwlwwbybwgpbpwlwglwbiiygwbgiwplilwyplbbwlyggzlgybgzzblliziwlgplzyzziglzgiwpgpwlyzgzwzzwilzyizzbliwyzgblwiblbiglybwpizzpibbpgwwlybzgpiiwbpybyggbwipyyggbbypbzwzigylibpypizbipiwilwywgpbiyylbwzpziylblbybplpigplibglipbgblywyggpglzylwpgiwbpywzwywzppywwpbbigwwzgpgppzizbwzzbblibbyblzpwypplibiywlwyibibppzyzlgiblyzbbpbpybzbibbziilwbiwylbzpwzypybggzwzbgyylpzwybblwzpwpbipwyzpyzizbyzbgiwglwbwlwzylyzbbwyppzgywbybpwlwblwybwigpgbwwplzgilzbylpgbppyibwlizzlpwblwiywggbzwgygwzplbilpzybpiipliiizbwllwzwibgbblpbiyiyblwzibylbbzzgigpwgzwligwpgizyplpgyygwylylwybzpzzwlgggllwwyigzgwwbgbyylipliyplpyyiylbppyglglzwwbipilypzgwbwblwpybpzziwplbzwwbggwgplziziigibiwlpzwpbpzilbibzbpiplplpwgzwwggiylziiygzizwgzzygwlbyiiylplwzbpylppzbwilzilwyzbgilwpzlpzipbbbwibpibywlgiwiillgpiiilwbwbwbwbbblpzpizggglzlppyzllbgiplbbbbwbpwbigplliipbgbzbgyizwlbpbyzplbiplbzlgwgwbzzggzlpilwpllyybywgiywgyzwwppzbglglwpziywzlpglilplbpgbzlpibiglwwlizwwggwwblbpbbgzbbbgizpzzppizlwgllzplgbiblzplyizpggypbbylggglibpigwbplwpzyigyyywzppgwizlybgwwiypgbygwwypygzpbzybizlgwwiwbbwyzpzgbgibpglbpygpiggblpwypibwiglwbzppwiiplziiipwgiwzwpiigibgglpwbblppiwwwgwwgylwliigzwiibbzwllblgbgzgygllzwlyilzlgbyzplywwzwiiwlzzzwlgypzlypbwwwbbzyplwwzggbyglzlwzzllwbzzbbyzbziybgzgbzzwpybzlypibpbwwbwilblgplglizyzpplbbzzplbizlpiyylgwblpgglyzwglliwwiwplgwwwlzzgybigyyglgbyzigywzggwlplppgywypyyyplzzwlzgbwzwyypigbglpylzwilbibbpgbizyzbzgylzwigplillwwzglgyggwzizbizbzywllwbwgiywbiizyblipyiiwlbylbwliiizllbzlgzggybllyliipipgwpzillzglypzbbgbyzzwzyblilplzizbpbgplbpigiiwgzwbzywwylyziizzzbliblpgbwlzwwgzzwipywwzizwwbglypygzgwbglblbwzipllblilywliyzpybgylbbbyypilpllbpwpzbwlbbygpbpplyzyzbppzwlzwzizbzbllglipllwylpizybllilwzwwizlpzbpzyylpwbbiyzzbwlzwwypwlyyigzbgwzggzgybylywpzwzywipwbblzwglyzygbwbywilzwwwpzzpglzwzggwpbipzbywwblbzglggbyywbwpyybiylipbyzgyzwypwbilgpbzgzziylwzygbzlgpzgpbbpibybppizlbbzyigggbilbzpzbwiizzyyzlpbzbpiigpiwzwiwpiyzbpgzzbbibywlbpwiwilbpplpplzggpyygzbpiglpiigzybblplbwbzgglwipzgllpwpgzwlwyilgwzzplzlgywpyliiyziwbgzwwwwgwipglwipwpylwpypipibbbywlyppbpbpwbiwpybypzggbpigyywibiyizwpblpyppzlzpgbylizliwipbipibwbpgwbgwyzgibzwpwwlgzbllzwpizybbiyllyzbygppbgzglipwyppbpllglwliybzbpgbpywppppiiggzplppipbwplwlipzlgpwywylzgbbbbygwbypzilyiplyzzgzlbliylpgwppwgpliyiiywziwigibygwgywibiylgzlypywzpigpgygzywlblbbglpybzgzbipbbpwliziwwwlbpzpiwzywlbwwwblwpwpigwbyppwzyiiwblwziwyzwwiggigbbgzigzzzyilwygyzpzigypiyzpilwygglwyyblbpzgwgwgpyyplbgpgizlwgbiwzypbbzbwbzigipiwiblywlyppzwlwibwgzlwzwywbypggipipilwzwbglyzpylzzibpwpiwbwwzpwzbiliwzyypizplgppzwzbygwzyzblllwlwyzizpiygyggzgbpgyizgbpibgbbbwpylpbglwpwbyzyywglpiiywibwlywpzizgiyzzbbipbbliwlzgbgzplzibzybbzibllllpyzyggypwywizwpigibbgwiblbwywwppgyibylblbzilpligwippilbwwlpgwbziwzzylypyiligbllybplwipizyzygwpyybgbiylpzlzyplpbglywpgwbzzplzpibzipplggzwlwwpyyzbwilzzzblziliigywpglglbwgilzibiiwzzpbwlpyygzibgybwyywwgyigpppgzgzzybyiblwpiybpligwwlwwilzzwwpgwiyzwziyzwgipbibwgzwyplwwllpbgigpziyyiiiyllzzyipglilzgzpiylglbpbwzppgbbpzpilpybyygigibzizpgwgipyyilipglygbzyiiibwibyylwbyypbzbgpggzzgwpbwzbggiigpyllpgbwylpizbpbyiglzwgbggzlgpzgwwlyiibgzlglzplplzbyybpbzzlpiiggzbbgizypgyppipbzizpgyypzybppwlbblylplygzwwppwyiiilwibziwywlpgzwyzziwwgggizglipgllilllpwibpzlyyzlwlbygbyibplizwypypzpzppzlzbgwgyzwliyygbibwlzzibpigblwzilzwyywzllwyiwpybibbbpzgzpzgyilypypyglybpyzpyllywgiziggpliwwiblzpgllizbwlbgwbgpgzzygipliwbppiwppbillbilpziyibywbzpizyzblpwwybizpllpyppbzgllipibgpgbzbgwbbizppyibipyppyywbliwywwyypzlzipbgwippgzyzliwizwzpiilwbizwzziplllbbzbilybbiziwzypwglwiigigibwwiwgllwbwwwwbbwiwybllywgllgglllipgzlpppiwyyypwpylwlzzlgiipilipzlbbizlwpblybgygwpyizwbbywylwbyppbiwzbypygwwlbwwyyybpzylppbiggbplzgiwlzpbwwlzigbillplpiylwybypziliwywgwipwlgwbiiylwblpibpiiypllbpbygwlgbizwypbgplzwipzbgylllpypwygppzbgwbwwlppwpiwiwzyligyiywllggwbwigzgbyiywlypibwylbpgwwwizpywywgyzpipglpgbypppwpzbwiblzypibzbpbzzplizllllplbiywgyyypziwpyzzyilyiylwbgzybpgpgbiglywgwpiwbzpiglpzlwlilippiwbbzwzbipybiglgbzlbipwpglwlliiwgwzbigyizgbiwwybyypgbpbppbzzbigiypbilpwbgylbwbilgwwwllpzpwlylggibiibgzygbibgilzbglbppgiwibbblzlwzbygpgbwpywwpwygzbpzgzgzwlzybpyplplypilpwbpppywwipgwppgpwwyziglwpbgwilbzpiwygyywibbywbiplzzliwbilpbbwiypblyplwbzzlblilpbwbgiybzlzybywgwwipgwlppwiwglwybywbwpbizybbibibwiblwgzibyizlywzwbizgibpbwzgwpwwzgpiibgbyizzzpiblwwwzlpwlziggpwiipwbglgpwigzpwwglyplybywyplgyziyyilybgwbywgyiipblggbzzwppwibwypgllzigizlzlywgigzwbppbiilibwywzplibbypzywipblgwpwgilblblggzylypgwibygzyizzgzzlpllwbblzgiyigpbgplyllgppglzpgppyybzlbiwwyyipzzlpbiywggwibizlpyzllilipgylyzyzbbzgyzyglzyggyzliwiblgyipwylgygppwgzbgpyziyiyzwppgpzyyblyzypzililbizwbipzlylyylyglwzwbiypywzglwgwglbypbllbpyggbigiwbzzliwiliygwglyligyppglilzipzpywlpllzglgzywwlpglwbwbwllzbgbbwlzpzwpiybiywgypwbgggiglbbbpzyplpwyipglgwlyiwbplgbyzzbiwwblzzywwwiibibzzygzwwgzbzibpybgyiplibilyzilpiibpgiwzzybwwbbbypwzglbplbyyiygbizzbpyggizwgwiwpzlyzgwiyyiyyypwlwblpgyiizibwyyzziywyliiylzpwpzwybppzzgbipggzbyzgylbwwiyyibzllppzpligyzpillygpgpilpgigybwglzglpzbiywiybpblggigzylibzzywbpiiwypbbggpylbwiywgglzbwigblpwbpgpwzizzwbiwpilwwpzwziywggiilzpwyyzizwligzlgbgzbyblpggywlbpbgiwywiplpbbzgwybbbwzppbygzbbiwbgppzigwgzzgzbyiilywpbyzzpywlzyiwywwiglbbyziypgyzggipwzgywbizgbyiwiwzpiigbplzpgiyigywwplzgbwwyygibwwwiyliyyigyzwyzzizgzlgbwgpyipiywpplzlwzwgwpgzzzgplzzlwlzlpgpypblipzylglizgwgbgigybgplgbywwbizzpwbyygiylppziygwbzzyyygzilybiyzlpwpggibwwlgyggggggzyzyzyywylzzzbzibwzgwplzpzpbbbygzyilpzwpwbbwwzywpigpiwpgzbiwzzyyybgwbbbbpzlglzzpygwwybgbillzpzgbplppplyiiyiggbpgbgwlglgplzbzggbbgbggyzbbzzwzwlplgibylbpypwblwpipyyilbwpplgilgyblgpyzwyippplwggzyiwyiglpyzpllplyzbbbwywlbllgplyzywwwzilzpigzgygbgzpwbyybiiwlgwwlizyzbipwbpzypbgwbwiwbwzbbbzbizwgpggwzgzzgwybpggywiibypilpwlbgzylliwylzipbyyygglgyziybizgwgblwzggziiiwpzplyzzpbzbwipbbzpllpyiyywggggglgwzpwilpzllgwzwyllbyzwpwpiwbbbpzwwyilylgwgblbpwbzlbzgygggbppwgibbwbwgpypibgigggbippwibgiybywiplzlzwyyippybpwibbwpzibllwbibplzzzlwiwpiiwgggpzibizwipglzppwipzipzlyzgzwlglppywgizzyziyiwywzybbwiiiypzzbwgiybpgzpbpyyigbpllgibyzgbwwlgwigpzbwpgwblywwyiyppyibiiggiyplzblwigbpgbiwiwlywziwzzizblglypiwzbllpbblblylwigbziybzwibgggyyzzzlwllbwzplpililylpiipgbbgwpbigzplibilbywybippliibwzpgzbypwpybbwbbpzbwpwliiwyyzzwwggyzzylbzipygblzipybiibyywbgybbpbgzzlgbwwwgyybwylzipplppylbygziwiyzblglpzwwbywyzzyyigizpbybpzllybbziwyypllbiibzgylgggyipzyzlbplggbyylggwlylybbzwgwpgpzlyblwlpllwwppipgizyywliwygzwwilypgwyiwpziiwygbgyllplygbbwzbgywwgwwpyzbybbgzwwzbblzyyybbziyplybiipibllppywbwigblbiwiwygppzzpiywlblgywygyiigzppggwbwiiwllypbyyppzpggbwgbiiypllyplzywywlywyzlpbilywyipiizibgzlzbbzylzppbliiizyzzpbllpwplgwplpybgyzlziygwglppwilpywyzbblpllpwipzgpiwiyllbbzpwlipzgyyiwzblywiwgwlbpgpwplilbybylwliyipplgiiliwyiipzwibzlzzygbiwppzppgzylygbgiwwliipbziblwbzpygpzwbylpzylywwgwlpywygpzbgpzzbbzwliiyzlgwzwizggpygipzybiwbzwpbwlybziiypibyggywlwyzbwwgzgyzlwwbpiwwwwiyzzbpwlibyillzigpylpwbgpylwggwpbplywilblillyzzigyzbblybbpplipwypibgzzigipbywgbyzzgbgbwiggypbzzlpzzzzpiwypzwipiwlbppblybbwigpbililzbpzlpzpzzwwyylzbllzbblgzbwgzzwybpyiyywpbppwlpgyywpgppwpwllipwygipypipgilwgwgppwwiilbplypgyglbllyziwzwibzglpgbpiwlypyyyzplzblwypiwpywgbwpbilizgzyzypwpzbyzwywwypbzpywblgiizbpgplgyplwwwbgzblzglpbpbwylppizgwzypywbzizgbzwigzlbylblilbgizlbbglzggiybbiggwlgylblygizggpiwgwppwglplbzwwylzlglgyzblywwwwbywibpyzbilpblbgliibgzgbygwlgzzgyyllwypgbwbpgibwiliplbzizwwzzpwwwgyilpgiiilllwybizzzwlilgpiiypgzyzygiwilwliiyibilziigiglwzppybigbblbigbigzzblpbpwiilypzigwlyzygilwywpgpgyzgwgbwpbbzppggbzybzgbwizwyiypwzpibibzbpwiiwlggyyigzwwyipblylilwpbpygizllzippwylzibyiypglyygblzgwgygibpilzzlypbzbwwwgizzlbwlzzbwzwwlwiybligggyzlllylbgbppwiwyzyblwgwgywpwbbzylpyzpwbglygywpyziglbblwzyigbiwllpybwggplbgpibpyibipyygwwgpppzzzibwglblbygibzzbywizwwzwwwblzizzilzggllgllwbiwgipizlwwpylygzggllppglgpiwwbpllwygibzlwzpwggygigiwyzzibzlyzzzlpwyybbiblizgypybiippzlbyyibpzbpbpzizpbglgyyiigipiwgbzbpbpzbbzgwlpigybiilypzbyzbwgbgiyypybwlgypilizlilwzgllplgzipzywbwyyippizwbgbbwbpwiblylwplbzbpppplzplbwpiiwplwlgiyzllgpbipgzgglyybgwiizglzpiigpwyzyiblyzwpwlzwppppwiwpigglplzwwpzzypiwigwpgilbywbbigywywpzwbibbyyyzgiwzyllzppligglbppwpppgzzgippgwiizwwyygygipybzwzibwlyiliiylgwiiyygpwiyzyiwwpilyzpglllppzbblzgbzlwbiygppzyywlblzggygpppwwizlzbppgzpbblybiwpwlggypbizzzipwzpiblpzgwywlgylyzzpwwwwbpillyplwzwgigiiiwwgzgpwlwzibwwpyibzbgpgzipyyiwppgipwwyzgywzpblgppliyygzibbliyywzglzppybgiblgyyypglpyzppyiizbylwpligpzlgigbzbzyiwgbyzllzpzgizgywigyiypwbppwizlpybplyglblizwwbzzpgizigwpzzibpblzbpllypwiwllyzgbpigyyiwigwplzwlyzigwbyglgzpgpbpwzblyigigliizwyypplziipzpyzylbbgwypwglzbpizgzzylyylyiiiybbbiggbybpbgzgpbiziggzwglylzyzzybzzzgzywyypzbpgglbwlblpglligwglbllywwlpwbyywwwwlzzbygwggywbpzgylgwpwppiywibwplbzzpgiywylpwwgpwgzipgyygybwwgyzzipiwibwgiyyiiywzlpzbwbpwipbpggyzpibpiyblyilpywgyplygglpwwgzgbpzwwgibgyzibbllgyblwlibpbblzzglzgpbwgygbzbzizzzlzlpwpblywzygzyiwzpbplyzyiwbpzygwiblpygpzpiyizyyizzylygllwwzpbbbwygbiiylbwbpigibzzyggibpziglplwpylwgzzyybygygpgzigbgybiiibzwlywywgwbpwizzgwybgllwpwyizzywbglglgwlgzpbpbwwwppyybpbbwbyzzyzbyzyibggiwwlwiglizylwglgybbgbipbizblgliypylyzzgbgwyzywziwzwligzgyizzibglblzbizzpgylizpbiwgbpylbgigiipgpyplbgylizilwwiyygyzzwlbybbllpzwwgiwygpiiipipzypizgzpwgbgyyggyppplipgblpbpzwgglwlwwlypgpgpzgwzizzwiwizlglwpplggggiiiwiilybbwwzgpbwpibwpilwiwiggbpybpibpwgplplzgwywzilizybwgizbilwibipwzlgbzyywligplwlzlwlpiigypglpgllgllyippylygiiblglbzlipwbpziyylzzpgzbpiwpbipzbzwpyywbbzlpgpyybyybzbzbwigzwziiwzipbywiplwwwiypblbzgbgwwlbzbyllgbiigzgibgipbggzbbyliizzwwlplwbbplwpiggylziblizzzbzwiwbzlbgzyyzlzzppiplbyzygplbpwbpligpliwizzgilgpyggggbzgwbwywziglzgylwzlypbpgbiilpbzipblzlylwzzpybzpywliyybgiligllwyyybzppwbbplbpypppgzigyzzzliizbiyywbpplpzyyyywigwwlipzlwyzbbpylzbgiyibyizbygpilwzgipzbwlziizzbiilzlpizzzbwlipggblgyylwpbgggppyzwzbiglgwpiwwlwwpizpzzbwgppiybgygzpwyywzbbybplblwpwiyzzblzbzbpbibblwzgbzgllzgllpipwpiyzyiiybzzbgpglbypplywgglibgwwwblpbbypwlpiipybpyiyilgzbyibygypzbiilpbwwiylwgwzyblbgwizgyywwpllipwzywzyypwpgigyipgbilzblibgylybyiyplblwbggpyyilzpwblpizygzwbwyyppwzgypppiippygbwbybybiwlllbliliigbigbligwgipgwppypyizzlbgwiziyyiggpgwzbbpwbwyyzwbzpzigbzglpwyybppzwlybpzzywzbwizwbbybgwzwzpppliyliyygybbpwglpbliywwwgybgpbppywpiwiwlbipiwgwzpgpygbbyyblpzzlwpwpzibpbiiywgibwzzppbglgybwbpiibpgpwlllzbgbibbiwwlpliywpgwywwlbpbllwylbbbpgblplwylllzgygzzzlggwgzliwwgwgpwgzbppzlggpbgyzbyzlgwgzgzzzzlgplibzgipilpyzpzyywiyplwpzzgplwlpzyyzgyylyywillgwzwppyglzzbbbzybzwlywlwyglplybwglgblggiygipppwglglplibbpziywgylybpzzyyzziwlyypglilbyywyzlilylylbwbbgipypliywbplbipzyilzzblllwzbbgywzylgzizlggygigyipwlpwlyyyygzwppylbpzzgypiibigbgbyzplzwgwyypgzypgwiwgwzzgggpyyyygygzyzzyzlwgzybybllbwzwbbpbiwblpwlgiwwbwpwlzblgbizlpwzillwybbzblwygzyzgpwwgywwgpzblibpyzgppbylplbwbwlzbwbiyyppbgzyigzzgwizbgzwzwyizplpzzzpibzbzzlibbbyllzbplppgbzpwwyywiglylwiwziiwiwlwlzyzzlblpppgzwylyzbgzybibpbipwwypigilyilgpbyizizpzilplpyiipwbgwyzbilgpblbzigypplllgpllyiwlpbwzgyigbpgyplbwgppppyliyplypwgzillglpzylpglyggzyyizbbwwzpppbzzywpiyiiwylpllpzlpzzlyiiblylyyggybwwlzzzpigiyybpzpyzpbglpligilbgyyiwwigpwblbipgbpzizywwlgbpzzllgbzwpbgzbzilwbyzpiypyiyzizzilwypbllwlwlplizgiyliyizipziygziyzpwizzligigwwyzlwyllgiwygygizbbblwywppwwyggpypllbbygipwzywllpigywzlygllwigwzzlibiiwpizgwiybgbywizippwiwiylpgzlpipyzwipzgwbgwpiwlbyzzglgpgwzzypgiplpigggiblwyybbgbpyzlygllgplwzgzpgwwzbzbgbppgzypblbwwgpbpzwlilwglgbywbzliyzbibzwylwbyyiipwgizbpbggzliilpiwwgiiplppybzplgpwgwlyzwzliyypiiiwyziwpyiziwylbylylyzypypzzygbwwgziiggzyylgbwpbzibgpiywwblbllyiwyggibywpiblzlylyzlizpbgilgpwwpllpwpbwwzzwygpggilpbzzwpblyblwypzybliliwpzzyizwwppbyywwblibbwizwzypgllyyppgzyygigllwgbwygygilpyzglzgbgigbzggwlwggzyyzbpwizgpppwizygibpppyzgpbwzgpbbzgwiyyygbbblzbyiwlpygbpggwwgllzgiwbbzwibybibwwllbggzbwzzzyggwwigywbpiblypigwppwlwipzzyywylligilgpbwbyyglpbybpzwilzlzbgliyiigylizizzlpzwbwgblywibizbyibwybwybpywwibzyipwpzyzygypylilpwiwgllbypwylpwpbiplzlwlzwlllwgiggbgpzwzlpbpzywyglzzgzbpbilbzblzyzglypglzywzligwgwwzlwzlbgyilpbgiyplzlgpliyzyzzibgzwpwbzzgpgwibbwypzblplyyiwbwgpzylbpwwbyiywzblwzbygbpizbpgbipylwplblzwypplzbbiygipbzypbgllblwzzilzyiibigblwgipwgywpwigyilgylzigzpwgbyylwwyigpgiipgwizgiiwigiigbiyzgwpbgblwlbbilgibpzwpigbyggylpwgpygiwwllziywyizilblplbzpyyypgwzwpgwiwwwlpwllwywlggywppwggbplgpglbbbpglywpyblzziwizgzipizybblwbiizyiyzzzbbwpppyzbylliiiyzbwlwpgiigbligzzwzbzywiiwyppywwgbpzyzzzglyzpzywyiggggglwlgipppyplpzblplzyzppwzbpgyzlyggzizyllylyyzligwpwgiylwlbigzlpplpglbyilpyzlwwizgiizgwgwiwylilplgwgwwpbppyzgzwizgwywpizzpbiwigplilgbwzwzblzblggblyipgppigbygppiwyybpbbilzyygllzigppwilbziwbygwbzyzygzwwbgypiyiwwizyzyzlwybiwiiwlbwpbbbbyzlgywyiizzzlwgypwzlwywigybgbwblybwyizbybzwbzbbbpzplwywwzbbwgwypzpwizpygzgbbwypgwwzlbblbzpwbpggwgliwypipzbbzpzwgbyyglywlbpblzzbwpypbyzpwggywwllgpilzbzwpizbwpgypgplgzyiypybiylzbgiwwypiwywwyizblzwbiibyzbwbzgwbybppgwlwwlzbyizbbyggiywzyygwlwlzlbibwwyppglbyllwwygbilywwpzbyiwibgpibzpgiblwpwgziblwbggblpgzggglllbgiiylbgzzlbpywlgyygbgbwwpigggzybwpyiiwlwzbpglbzlwlglzwbyylippgllzwlizgyzlpiiwipzgblbigpgylpiwlggwwiwgpipwbgypllzllzglpgbilbpllbigpilbzzpwlgwbpligylwgyzgpiwgypgziilwpgybgylzilpbwbgppbyzlblgyllzgbwiyiyylzwwgiyiyibzpbzzbwipliyiwwgiwlbbibgywgizpibpgbglggliyzibyiywgiiyybzizyzzbiiwpbpgbwwpypzipwppigyybbwgwlwigiwgpybppbbgpgyzzblygzliyywpgzpgzbgggpygyipiypyzbiplwwggipyiiiwliyyppgwippiwyzzlylylygglpgblgpzblipilwwwbpbplgiggpgzpwigiwlzpyibgzplbgzwgpgywlylglyybgpgygbzwzyppiwzlpgzblilwllgzilbglzwzpyipzpipwzziywwliwpilggigiwzwpwwywbzzlpizlizziypbbbpibwiyiyiygzgzyibylipbbbgbgiiwwzlggpblpilygwgbzyyppipbyibbggygpgzylyizyggwgyzbiyggzyibwywzgpyplyglyliiilppiilzzggwiwpzyyywpipzpzbzlpbwzgpiwilwpbzgbbpwziwizlzgylwlgbizygizgpgllgipywgiibgzpzbiiiywbzibwywlzipzlyiyyypzzillizylywwzbizbywwzwppppzzbyillpzizgibiplgbgzgzbbiiwbizyiigggbylzyggbgglpigpbbypwwpybwgigigppibllzllgyzlbgbbpwpgypyblwlzlzbgigipgwpyygwwbwzwpzgyliypgipwbgyylylzlgpiybibiywpzyyyipyglpwwbgpyzbllbipbgyypbplppliywpwzzppypygyzzibgblyzbggizzwypwblbpyzglblbwbglgywpgygblbyblzilzlwlgzllglwbgibwzwpwyzywwbyyyiibgzgiybglzzippzgppyylliyzyggigzwggpgylllblwlyypwbbblyywgyylziiwlbglpbybbizpzwzlwgpppygiblyzgblpppgllzgwbgipyizibbzbbppgiwppyllwgwzppplppwpyblzpzlgyzzwbzpiiyllzglwygwpplzybyiyybpiwizygzbzggggipziigppywyzpzzpiwllwzwyllipibpzylbyzwbpbilzglbiywylzbzwyigbpgpplpyiwlilpipyblzywbzigwzpipwlzyggigippwbggylwbwlipzwgypwibgywlzlpigiywipyzwzlglpywggylzzzziwygilzlwbbziwlzzbblpibyyglgwzlzygzzgbgyplbiypzbwzpygyiiyzzgypzgwizzlliiypbywziiyiblbzlyiiliiyilzbygbilzlizpzbwwiliglwlpgiwpiypzwpwlgzlwlwwlpyyigiwbgblilbzbwiwpywizwgipzwllwizzlwyglgglblbwlpwlilzppbbwyibwgizygyyizzzpglglwlwigyllywyzbwpzbbzzipywziwzpbbiibplpzzipzliwwzlilybyzwillgillzliilyiwilpyzzyigbbpllybpzgbwbylwpwgbglbpwbiiwiwlzgggzgwgyllbylblzlwwyzbwgbpwpgppywpwpzbyybliypizpwygpzywwiizppgpzppglbgizbgpybilgiwpligwlbybwglpgzgplpyygllpgzyybigzlbgpigbbbillwwpyppgbwilppiggbyigwgyiiwybpzbggypzyzgiipblgbblgpgibygbpwizgygyzigbiwylbgliygplpywipygpzblwbgglyilbzzglbglbwwypbpyiggyblygibzwyzplzwpglbwzwywwlwppbbzblbzwzgbzgglbwppyiipigzbiilbzybgbyzlyllpyplpilwzbbyygpiylbizbpgywbzlpyypiwbbgbywzwilyzyziwlgybpyzgbyzblzlywbypgzpibpbgppygwygpzgygiwbigwiyplbbypyyzbziilzwbzizpblbyywlbzywpizilpwgzzlliyybwlzgliwzllblglzpwllpibilbiwllwiiliilizpwglgillyizbwwizpwlzpiyylliwlplzbibyygyygzlbpylglwzbbbglgpilbpwlizgwgziwilbpbyyyzyppgwylwpppllbigiizgpzzgyyigpiybwlpbipzylyblippwwypybylpgwpblzizllypypwpgizbzigzzipgpypwlygpbwglglpwgpzzzbilwgiwgzzgzzzlpbiwwwlpyywppypbpybiggygiyyygiyywlwlgygllgizygpwbygzpiwiiybbiwbywzpzpbizyygbzybglzygzwzggbybliwppwybylybgppyzlzgygwgggwpziyplgwziplybzwyllliyigybwbylyywwyiyibgzzppggwziwppiwiyggizblwililgybgbwpwbigpwiwwgblpzggbbzlpgzyiliylizbbzzbwybwbglbyizgzwliwpziggplybzppglzyipppppwiigbzwwbziwpiglzlbpygzlwgipiiiibzpgygbpyllbypyzibpzbbbgiwwibgpplygylpyblbzgzzwgwzlzgzplzilwwggwywibbgbizyzybpzbzbypgblligpwgigizyybpywgiwigbiwpbgpygiygwgglpppwbbywzwwppwbgzgywbpwwzyplzibwzblwbpbziwgyyzgzwgipbbgiwiwlgplwgwwizbyylybpziygilizywbplbgbibililipyyzlpgibbyygzywbwpllzzgliwlwiliplwlwppzgzlgylilzilgblbpiglbwilygbylppgzzyizgyzpizpigygizzibibwwlwzybibllpigbgyglizybbplgwilpzgzibipibzilglywiybgyiypigbgipippwwzlywbwbpgyyyzlzlpbzgylyzwyzlbblwgwpiwiiiwiggzlgiwiwzwlwlzgpblpigbyiiywwiwwybllwllipgbipgypggizibwziwpbiylzpiwigbylwwibyllybpyillyyllbibyygpzwbbbyiywbybzpzblblybwwywgpzbygwzgwzlpbggplpzlbgwzpiggpggbpzylgyllgziyyyzwzglzzpilpzwlgyglpgzygiigwgpyllgllzggyblwpywgypwplllyzypybpgpbiyyyylzpwypiwzwipliizilwpgziggyliyzbzblilwbbywzwpwwbwwyiliypywyylgwgggpylbgwgzwzyiypllyylygpwllbybbippiilwzgplgggipglplipwlpwwwigiggblyyyylwgliiyyzppgwwzzglzlwiyzybywzbgipbzybilwzzygpzlwwigliiwbgzwlwiwgiiypliizwbilgbbyybwzpgplipwlbllpylywpgipbizilgzipwiylbwizgyzgligzpbiizpwbiwligygzgbbbwzpiwgyziliwpliwpygwipbzbzpbpbygiiiibwbigpzblzwwbibbgpbbygiyzgzbyzizliyizzybgwllpzizzylzlwlggllwipygwbzbplgyzpwyzybwpgipbgbgiyiyplygybllbbzglliygwbzgwlwpzzzllwwypbyygilpzbizwillypywlbpbziiigigzwybwlwbzzwzlzwypbplbigbizbigblibbzbpzllgbpiwlpyppywiipgpgizzbbgzplpilpllizizbyllbpwpllbwpyiwizwygiyzgbblyyzbylygywgwywlwbyiiwiypbwwpbbilizigypwzwilwgipwwgzygbpizlibgliibpgbyzipygipyilppbggygbybppligzgbpyzbypbzpylwyyipgglwybilglwwigybzgwlbppiibgpwzzwyywwyzwybzygzbliybibygyylzywzwpbybyygibllbzzzwbwzwzyyibpblizwbzlizybzigggzzwizlipzlwiiiibpyiwbibbpypbbibllzwbyyzwyywgyiillgzgywyiypbwligbpwziibyblbypbilgzlwggyyzwiywliizllgzpgyzpiggzgylbpplgzybgzyggbwlybwzigzgllwilzgzywpgzzbllpyzpyigzpgizgiyblizpwybiwwiiypiibbgplzlwbbgbbyzgigylgplipbyiwbpyllygzybgizizyllbgbgzwpgglpyzlyizwbyplybipbbilgipzgzbgplpbgbgbwiyywipyzlzyibpbgpwppbylybpwbygpwyizpggbiilywlipggpbzpiwggigbzybywlzpllgwplygiwzlibppplyypwwgpbigbgyybiiiggwzpyizygyizgyllyzlpbwwwwwbbzigiplyipllwzbgwwyiwlgzzpyiyyippggbwpgyibpgbiigywpiiyilwyybipzglgzgpgyzybpbylillliplylgyyybizlzwwwlypiiwypbzgiylybyzligliwgpbzzlziyppwybgiilpgiyzpiyygglppliyibpyylwgzlwibwiwbbppbzbyzlylgzlgpibigbgpggyzygwlwyyzlyylwywzylbiwwzppzbligiiiylyiylzwwzwgiygigzzwiilybibiiiiywpyyblwyylwwblzwgiiwbzzzgblippbgwglgizbzbiibzplbgbipzbbzpgigbiilygypywzzpwplzzwilibizwyzbwzzplipbpyylzwybilpbyllyyibgpiywpgpizzwpilzgpzwylbwibzliyippzlplzbggziwblyzbwzlwbgyywblzgzbbwiglwppiigpybyzgbpbyzgwlyygybilwywypyyzlbyiyblylzypziwpiggzyggyplyiylwiygbbylwpygwzibyggbiwzyybllpwiigliybwbiwglziiygwziibggybgwyzzzwlpbypglpgygbpppyglpblwwibgzpbgwpgpygywzglizllwiylzzgpbibpbiyyipwwlyzwzwglwblzyiggipwiibiyzzigipiyizgggppzzgwgylzwpgpwpbzwwwiggyiwziyliplggplbwygywgywwbbiiwyybgwgwwyilwwbgbpplgypygpiwillzwpgywligigylbipgwbybyybyiwwpwiiizygllwbpgbzgplygpzpwpggwwgwlipywilzziilzbiybgzpzlibgpbzlggibbibzzlgliipggziwzybwpbgppgigylwwziygpzgylyiilzliybiiygbzyylywgpizyiilyybwpwlylgyzwbziwlggzgiwlgwbwlilbbggyyligwggypizwpiyipwyzpblbigpwbiyllibpylwiwwwblilgpbbzlizwwzzywippybzgpwgglzpyygiliipiblpyywlgzgpbywzizyzpzbpzzbigplbbipiipibbyzwypibwbyyibgypwypgwlyigpiibyyliwzgzylpywylyggpblywilyyyllpgiybpiiyyizzgpbzgbwzbbippiyyzgwiypzglyyzppppgilygylyylzypbbgyzgliygwbgplyyiwzzzgzpgzgyypgwlblpwbizppgpliyzigippziggpggwwpizipblzbbgzbwlplzlgizlbiwlpyiyglywzlliiibzwpzwiwzwlziiwbbwbglbbbgpzzwlblzyywzblpwbgippwllgyglplippibzwibwyipzpzglwiiyyblwybyibggwwgybzylibgbwgzlglzzzgybypwbgyiyyzligpyizipgpzgiwiygyybiylybywybylblbggblzizgzzzglggyppiypiwlwwzybggzbbiyppiybbbppzwpppzpybzbzblpypwwbgigiblgiwzyzbbipbgiglzliywiylyigyziibgwywpblwzzyygbyblyybpzzypzlyglllwzlbwggwplgbyplgwblpbpglzlziblygwggypgzbwywwbbiwpgipgzppzypgwlgllgbzbbzypglwzllpgiizbigbwbiiziybygbpgybbgligpypylglwlpyzbiibybpbygipzplwipizwzzpgbwzwywgbiibiwplpzwzlgywgplgpblwyygplyyzyipppgpgzwgwpwlbwpyzgbbgzpypyyzbbizilwylzizziggzzlgzizybygpzzwipbbpwzbgbpzypypggwgylgyyliwlywpypyygibiwgziypyyiygzwiwpzglbpbgglzblblzplpywzbpzlyilppyggigiywgyiwbzgylpillzgyzbzigzwiwwwywpgwzliywliyppiwygwbbzlgpizibgiyywwgiylizywbilliwgiyyyglwwlygpzgpwlzigwizbgyyiyligbygwbblzzybyzzzwigbibwlgyyzbiypbbigibgzbwblzzgbpizlpwlwiplwwzylzggyzgwzbpypbgwyilzlplwpgpibgwbbpllglppwzpzibpwgzylbplgggwwgpwwigybgybybyylwzbbiliilllglzzizzyygwigygwpgpglywyzzzzwlgwwiplpigbiwgbwgilpygwwllpbiiwibyblygzbiilgzlzpbllggwilyzpwipwlilpwzwwbblbpwwzzwppbgggwzlwwbyyziziiygpiliyigygpzlyiypbgpzbgizbyyibiilwglgwllzpwzigbgyggzgpbizlggpbwlwyibzwzgybgpbyggbppzlggzybzbyipiygzlwzzwwwgwwpyybzippzzipybpzpyyyyyliggylllwilwbbppzwyziiwpyzblzylibywzpglggylbbzibzpzlyzwpwywpwwibiglgbwpllgwywyibplgiglzyiwlbbliiilgwggyzilbbzlipygppbziplllzgblzzwgwzpizypppybpiwyggwgyyibpgzwwzgyibizzizwiplwzpilyizlliypyyibgibywylbwbywbzwblgpzwyywiizbgzllygwybbbgpgiwbyplggliywiwiwylylbyplzpwwlgpyllgzbwbwbpzzpwlpiwlilzlbyilwpbyyigppiybliyiwlpwwlyiwpbpblzlbgzggwyzpgygwgzyyzigigzligbyppplzpwwbyipzwyplwzlibbyiwzplpzgllbwbpilgwyiyywzlyyggzppwyyzbpyywzlbwgyiybbibwlpzwwgplblppplzgpligwpypiiygiiwgblygliipppyzibipgilzyigpwlizppwiwibibpllyylbzzblwlzlzgbgzwgipzgbglygpbbybglwlzgbgpypzgilbgiippbppwywbpzzgwzgzbwilzblyizlgybbliiwzbiyiiiwglyggiwiwlyywwbzgpblgbzlbwippibggibylwbzzbzzigpgbpplzgbyglpbyiigziwgpiygzylwzylgywlgpipzgiibypyzwlwgwbbbzyiglpwwpywlbwlpgilyyzyllygzpzwpyzwgzpizgiillgwbzpziwlglzibglbwywglziwlywylbwylbwzzipbbglzlggibwippipzzibpzlzppyllibgzipywbyzwygzgblwizpllylbpbbzbblyzypbwgblgbllzbbwzglwlgbbwzglyglibzggywbzzwiyyllwpzzywyibziyyywgwlipibpwiwwygzglppbbyzzgzizbbzwlbzgpilzzwwgzlbigippzyllywzgbgiblillggbwyyzzwplzlbwpiwglbiwwwiwygliblbyylzgggpzzlpbzllzyzzpwbiibllgblywiwbwzilwibbpwibzppipzzgbwllipblwipzizbipblliywwbwwwywpzzwbiplizzwbyblpbpiiybiygigpbgzywbbibzwgiililbipywzzbbippygbgwlyiiyiwpiywypbggpiizzgggwzyipiiiliywbziglbzlgwwlgyyliggppbbbigigypigwgybzzbibygyiygbgybzwygblpggwlpzwbgbypgilppiyplylzzpiggbbybiybyygplibwglibybwzwwbzwiigbibpwwlgzybywwypbwlgzzbzyybligwzzwlbiblbbziwwgzbygbbbbywybpwzipgwgigzwzpzgzgwylilyblbgyzwlllipwgizlzilwyywzlwplbbpppzplzpbwbwzlzywbiwlzpwililpwppliiwbipgwigzllgiwglzlpbigiygwlyzppwlwwzyplbggygwzpgbwpgzbpzyzppiygybplzlpzpibwyzglpgbbblgiwllgblggpplppyyywibzbbwwwgwzlyllgyzbgpwwzzpgyggblggpbgiiibigpbyzigwlzwlpzizbwlpyzzpwwgbiwygyiilyblwgipiywpilipizbwbgzbbyylgzwlgbppwlllilbwzipwblyiwbyybwlbllylbywwzbgglpbwwllwbigylilpizypyipibzlwizpyyzwwpbbpgwiilbpgywyzgpzgilypylpliybpwbiillbplbpwiwlizizzplzilgiyzgzizlgbyplyypbbbgwpwlwpgypbilwgwywzigwwlblzgpglzbwwwzbgypzwibwpwzzpylyggbgbwybpzliwyybppwbglblwylyblbwpblpblppyggpwbgwzpgwpylwyblllibgyggpyiwwylgpllzbgwgbzgiwylwwwipibiigwlgpyzybgbbblbpbgypiwblwzpiggwzpipgbpwwizypwpliwiwgwpypgbyppigzpzzpgllbilwpzlbpbipgpgwblbiiwgzigllizblyyzwzzlygziwwgywbibzipbyblygllwpzbizwpgwgpbzpllzlyywyzywilbzbpbylzpiyyzypzyiylyigbpwwblzzbizzilillyylwpbiypylbgyizgwzybgzilbiwyyypzliiblplbppgllzlybwgpwigligwzpplziyplzgwplbgpizpglwgzigylyilbpyzyiplywipzlzwpiilpzgzgblbilzybpibplwzblwgiwizplbzywbilzbzzgzzbyiziwigglpilbzylwgbbplilbblwbipygwizgibgwygplbiggyybpgblipwgggzpwpllyypgzlypgplzyyibyillwlpwllzglygzppwblpzlzpippiizgylgiwbbybpyglwipypybzyizyyblbgywwbzzigiibzgglypplzpzyibbpzlpiplibipylblbpzplypwypgbyglwiwwwyzpbgyibyzppzipywwzygzzpzyigyigzgzipbzzpbywpzpybgzzwyylzgzywiiibwlwbgpgzibllbiwbypwplbliplzbbpbbliylplggyyziliibppbliygpgiwizlpbiplpzyyipzbbyypzpbbbiywpzwblbppzigyypwzlilyppwpypzwwpiwwyigpigiwliyyiyziiiggizblygbgyglpylzpwgwiyylygllilwipiwibizbpilylbbilgpyyiwywilwbwlbziygpyzwzbgzgizlgyilizzylpypwbplgpiwbplbbyipyyigzwpywwwlbzwbiwbpibgzillzgyyzipbplwgzzwwwwlyiylbgiplyplwpiywzyigpzygpgygwgblbiilpiigiwwlzggbwgiyglgpzibgipzlppigpggilyzpybpyzllwpwplzgllpyzzyypiizizgwlblygzzpwbpzgwpgbglbbypzzzpwlywpgzwlzlpwgzibbiyzyibglbbzlzpiygyizipbylzwybpgziywwzggzwgzgigwizwbzbbpyyyppwpbbyliwygbpwzyzbpgbbbpbgizbplllwgziwwyzgwzigipzillywgbiygglwwbpblwwzpiizywiblggzbwywzlywwiziwwyzligwgpybwiiigwlziyzbiyibzlpigggbzzzwlylwgypbpgziiygylzbywllwlwwwglygibiwlibbwppgywwzgbbbgilliblygyybybibgwpplzilbpippbbplgpwyiggwbblbblywzipybgbzibppzipgzygblgbziibzzwbybgyygigpzzzgywbwpiizlliylyglwgppggplgppwpbyppgyybzwllwzilpywlywbglwybzlpbibpgybppwppigbpiiwlzpbgbygyzlwbiwwiwwwzypwlbyligibzllyzyiblwgliwgwpgwwbbwizwpiyzlwbzpbipzlyiblbyzgppybyizlbipwbpwzzgywlgwgwybzpzyzgygzgiiyyywiybblilgygwwiiiiywzyglzwgiizwigzlipwllpwgpgyzwppgpyzzlbiyzgpzlpizlylyiplbplgzpybyzpizbbbzizlwgwzygbipwpiiiwpigbwzbiwlizziiwlwpywgwilwyiizpygblbplzziigwbgbiwgwypyyiwipblbwzzgibplilgpwlillyzblypzpizizwypiyyyzzwwlzbizbwglgllypwpzgpwziilpwzybwzlbiglypiiblbbyiblzbglwyzwplbgzlippllzlzbyiwzgpbpywwbwbgwlgglbpbzgpwzypizwiyywzpipbibiblwppwbgwpwbiwlglpzzzyzpzbbwbygiwpyblgwypzplpwgyzwbwgyizplbiygpwbwbzbppzbipgwpbzbwlybwwwzwgigpzpbwlgizpigpyliigpzwziwliyzylwgypywpbzgbwgzwgzwzillppgzbzipzzlyzilblybygbllwwzwpwypilpypziyzppbzipzgwwbgpbppliibgpizlilbzwyyigbzlzpywpzggbilggplywypplplglipggwywyyizzlbzpyggipywiybyblyppwiipzpbbywiwwwzlzzizgbwiplgzbzbgpzllzgpyibyyplzwwlwzlbywbwyigbwgglzwpyiypillbzglbzgligblbzpgbbppizliyigillilglwpbiwgzbpwyblipzpiigbiwwgibpiybwgbypplgzgggbpzwywpylzwizlpiplplbzzgylbbwzggzyzllzgzpzplgwiblwywgyggzpgpiywzygizblgywgyiggiwgglliyzzzypyyzlipwbbwbpipllzgzzyywlyibbgyglwigwigiiybylplzpbgwywlpyzglpgwwwgwpizwgzilwwiipbzzwggzlwwzzpzillizbiiggziwyiyzizlwyziipygwpygzilggyygpiibybizpigpibbbwwlgiipgpizwipwyywgpzlyyblylzlppygpzyiyyzpyygwzgzglpzbpglwzyibpwzwziglibiygpgypbbybiywziwblzwyzlblyipwibpiybzbpwbpgwpppbzwiyzwwyzgbbygwpwzzgwpbzzlpwgpppbiwgbyyzyiylzylyyylzigzywpliyybpbiligzlwplylzppyyyliybillyywibzizipbgilbgyibzlgiwywlgzzwzglwwpiwylblbzygygglypgplglgpbbppypibgzypyzpypwygzllpwplgpppyipbzpbwibblgiiiplygpwgbgblzwggpzyliilzplzpyybbwgllgzwiiywwbizbibiybllgglbpygygwwplzbwyiiiizwylwbbppwpzlliyppyyibyzggbwywgilzygwyzwywzblgypyyzywliwgglbgzgwpgbliwzgpwlpbziwybggwpzzybbwbgiplilzwigbblbpiwbilbwziywpgzwzpiwyzlzzwzplgizyggbgwbibwywwgpwlyiglbiwiilbgzzzpwwbpwbbwwwybygwiwiypyglgpywlllbwzbiiiyzwipzzbyzwibpzgzlipbpzpziiyiwlppbbpilizggllylyippzgipziiwiipgblggzlbzzppywilpgbgzzllwiwwiplwybbwpgbpwbyylgybyylwilllzbyybliwwlibgyibppwzigzlizpbzgzllilzzpypwgglyyglplgzgpyyylgiylgibyyzbgziylwwwgyyywlzliibpippwbbzyzzzigybbbzywbbzbliywplilpwpygwwwipwwpgwpbyyzizbppypgggiliipbpygybzlgiiggliygzlbgbziwgwiwlwpllwwzizbypgwzilwwbpzbzyzppygzzwizwgblzpwwgpbypiliplybiilllpblzibwllizzzbwgwizgygblzpgblypwzwgiwwplglwlzlywllggzwbwgglgibwibizbpgpzwplipwglylpwwgglzwywwigiwyzggwwyyplpyzwwylbpgplllglwylwwgibwpbbgwlwgyziipiyyizyzppgbpllpgpiwlipybiziizblzgwlbglziybyblgyyyybblgzgblwpyzzzywplgbgyzgbbiipgblyipbpzpbppwbywlzzpizzybipyblpgbgbglzllgzzbiibzzgzigbbpzwpiwwbzbbpwibylpypizwwziwgwbgpbziziggzgygpzgllgzzwgliywwizwyppbwzybwyggwibyyywpgggwzbizygzllbyyiyzlbwzyiwyillgwiwbzgzgzzblwzwpgzyplipbbzibpzggiiglylzlpbglylpyglzpbpwpblzwliblwizgipbgyzlwlypizzgblpzlwyywzwbiwgyilwliwyzlybwiggwylplyzbybbzillzyyipzyiplpwgzwglibbpzpyizzybwbwwbywlpypgggiillzpbyiiwwlligibgzwglbzglblybbwibwgwbyibpgwlyylbyliwzywziybiglpgyggpbizwwgpilzgzwgwgpbbllbgwlggbwgyligggylbgglwwwlpllpgzypbzwllwwwbgylbwggizbgwiyzgwlpzigppbizlizlbyibwzwlbpgplygbpypzipyzygzzzyiwwlbgzglzwblgzipllyywlypwwgyigizizzzwylgzypyizwgibwizgzlygbybbwpiyizpllgipzlywbzlgpzppzplizziwylyipbypligbggwbgzggiwppywlbwgzyblppylpliwigibbbibgwzpziwbypiwzwbpylzzwzbbzblbwyiiwzpwwplwwwyiigbzpzzpggywzlliybgwlwzyzwbiylibglzlpgylbbilipipibbgyiigpipglypzlgwbbbwlllylgibbiwyzllwywpbglzybbwiyzpilgwillwyywblypiylbplizwbibyzygwbyilpwbylplbzybyzizgwwwbbwpwlzzlpgzzybbpzppwlzzzziglybzgbglbygzzzyybzwpzlwbzwigwypylzwwyzzwggplbipgyziizwzbyzyzgpyzbzpwgwyiziblyplzgygwwzlllglbiiiliylgilylilywiypgiwgibbbgwgipbzzigppbzzzzllwllywwbllibgylpgglllypyiyiipiyglypgybwlbwywbwzgbiypzwgbzgzizybpgzbpwpblwgwbzwzlyppigyizlybzglypzibwpizggybzwzlipbwwlbylylpglizipyiiggbppwwwligygwgwwlypgilgpglwglbwygwpypyzzylzwiglwbblllyypiiwwiiyiiyizwiylpbybipywyyzpplbppwibiylwpgpbzglylbiliiypwzgpzpblbiwilyybbbpblpwglplwplliwlzplbpgppwlwgyiwigzziwipiiyzbyzzlllbbyyibipgzlllzpywlglzpwylbypiwpgzlyigzppwgyllzlppzlligywbllbypiyygiyiiplpywlllbgwzilziwpzgwllwylzipglbgglyiiwiiwyizgyybizlwyigzziylpyilzlgwbbpibgbbzwwgbbbizigwiwyzwiyipwzpwwgzlwgzwyzzplbpblpbpigbybyzbbggilibwlwlgbpibyllgwibybzzyzggpwylwiybygwpwlwlllibbgpyzzblwybbyiyigiwpzgblzbgbwgpizwggzbwppbgpbgizllzyzizziyblzgggwpgiygwlgiyyggggpywwwwbblwllbigwilpzwpbyyyywiilbwiygpbwypwbgblwzyllilgzzlliggwbpwziigwwipygpzzpyiwpibybwygbibgbwwyigylbllgypylyiwbgzpwwggbigzypplwpwilzggwwglgllzwiibwyilgzppplbgyiywlgpzlblbbpigiwilygbplzygpwgyglpbwyppgylwbbyggpzwgblwylpwplblpbbgbyibgzbbgzzggygypilwiibbyppygzgiwiwlipilpgwgllbzgzgpbpbiibwgzizligyypliwbzgzwpwybzpizgzpyzllybligllbbyzywbiwgbzyzlpzziiwpgypyilggbygppgzppbiyzzpbigpbyiwlzzwbygzlgyglybzllpypgliippblwbppbwwlyppwppgilpypypgpzwywgplzzllwpbpziwgglybilypypipwzpliigypwpgbpgiwbipyyyypywiiwwyzlbyzypbiygypzzbliwzwlllzpgyygyziligywlgiiplgwiwlzyippwblyllpglbzwgizbbglgpybyigwzllwbwpglgyppyzwlwpbwlgwpigbibpziypzbizblwbpiyyppyplyizgiplgiizlgyplipgbzziylpwpbplzlzwwlpwlwibblllzbllgwwlgbyiybbipigllzgwzlbiybwiwgbppzgpwbyzglgblwbzizpwlwiiybwzpwipzwililllwgbyilpllglwgiigypipwwglpwbiggyyiililpyypbblgizbblpbybwilgpbglwbgzpyybwbzgiggwgylwlpgyybibpwibiibyiggbgilwiyllgpbibzwzwwliiipbpligwpylligwyiywwbyliglpgiwzwyblplpbywpggizbbwiizpwzgigllwbbygwiblbgpyllwizzzbbizzwywigzgbwppllpigpyzypzzbgblizyliygziiwwillzplggziyzywzwylwwlzwwlgyygwyypiyzwlgywigwpbiglzwplbzppwzizblwpippwwwzgibziwgizlgbllpbpilpwwlbplwzwgpywpizzilblizgizpilgliilzglygzlwyibzzwpgzlyggbbpbbibwyylwziibpgllpipzzzgbpbiypyizpbglzglzizzlzyipilgiziiligpzwiigywlpylwplpygziibypbgppwiwgzilyizpgzgiwbpgbyilylzzpblyybpyglgzgpbbwpgiywbppzzygygyligyywglbglbpbpgbilgyizpygywliziipglypgyzbbywplzigipyggibwgipzbizbwwwlwypbggyiyllglwwgywigbpwwpgpwppppppggwizglpplblllzwizglpwlpglyggyyzwppbygpilybybwliizyblyywplpiygpzbbylwlgwlilypgipbzygibpizpwgiwpplwpllybwgbgpbyppzggbzpwygygyylbyplwgbillyylzlwggppzwpbgyigbzbizywlgppzgylybzwpipgbgybygpiyiyiiilypbpbyiyzbbpzwylwyywlwpzipbilpbwwylglyzplilzzzybbwygyyizglglpzgppggpwzyzwyizzlbiiwiibblpzlwillwgiyipyggzzlppzzyipygbglbzwwwyibplzpygzpbpbggzwwzywblpgzbzgbbzbyziplylzggygbgylplbwpbwgplpwpywwywzbpglyzyybgwlbwlzpgblblgyggzgizyblwzbwzylzlpwpyyllbpzyllylbpgygizwbbiizgywyywbgpwgzlblpblwzlzgwipypwgzgbwilpgiwwpybwyzybwybylliwwziwylpgizbplplibiilglilpylwlwblpzbbzzbyplzbiygigywlgyzigwyygyzwbybyziyzlybzzygwbgizzgwplpllpyzggwgbllwibbgigyilplzziiwgiiglpwggzlppwwwggipzzwwwwpygilwgyzgyippwlbzplwylblbbplbglwzzblzwbpgwwiblpppbzwgbwlwpwgwgywbbiiipzzlzwzywiblygpwgyipppwlwzplpigzyliypilwiyiibziipwglzbgllwizlbzwlpwlpwzwiyplwlzblgyppgwlwgbpyiplplybbpiywpypyppzyipyyzzwigwlpibpbzzzygpbpbybglbblgbiilgblzglwzpwzbzzbpwpybypbylipplzipiwyippigybgyybylyglywiizwybwywwiiiwlzyigbpziplybyzpglgbwzizpbplwggzbgiwwigbliziiwzzgggbgbbizippybgpliylzizpgzpgglbyywipgbzzbiygpyiwllppzizpplilygibggwlzbzbyiggzlwgbipglgbywzigbywygwgyiygwggwpbbgblgpgwziplglizigzyzyllpppibliwpyilzyppwywylwylwziggppbgbzbwgpbzpbbwglbiiiywbwwbyibipblywwliggbgpbigwpgybgpwwbliypwiwzlipylyigyiwwiwlgbgzpzwlwzlbizizigpllbgwpblzpzbiippbizpiyglllzgiblzwilpglbliygliwwwippiilzlzzpzzglbzwlyywyizpbplppzpbzzpilipyypwwbgipbzpibgwwpwwybzgbzpywpbigwbpwigzwlzllbzpiywglgyylpblliwizgppbibwilzpywppgwwylzwwiylbpyilblzyyzywibyywzbypilpzilwlyyygzywwiggzgpwwipgzylgilgpylgyblzygwggpylwpbgzpggywlywliywbgwbbwbzpblyzbplpwwiwyylwwbibylzypgppwgiigwpwypgzzgyibgigpggbbzizwpgigbwlyylzilgwylplzwlbbiglygzliyzplzibgylpliiziwlypzpligigippiwbzgiwbbiwwpizwppylwybzggbpllwlpygzizibpzpbzypbplzpzwglgwzbbgypilggwbybiiipwygwzzyzpggbyypwbwywlybppziipizizwplybwiwlgywwgllywbzyygylwwgzlgpbzlzzlzggzybgwigplpzlpypwzggizgpgglwlgybwwzyibllzgggygwplgzwigizziwwpywizigzglwbbybzwyybzgypzppyilgbiiyzwzwlppbgyibgigzzbgyygwbbilwzywbbgiglwwppgwgwwpiizgzlgywwbilgzzppiwzylyilgblwpyyzizilwwlylbgzwgblbzzpzwgwyiybgzlblwyzbwlglwizbiyypbzwzpgigllylbgpgilyzlpbgillgiwppggiwiilglgzibgpwygglgyllyyizgwwigpigzwzzlgpyziywggywwgblgiwibzgybbwgpgygigpbwpplpizpiwggpziiyibyyylzzybgblzzlzwyyplbwlwlywlblylpppwiipyywyylzpizzziibiplzwziblgzgpiiwpzgiizwligpbpwggiybzyzlliizwwizywlbybppzgpzzgiwippizbgbygzwbbyizziwgywbgiizygpylzwgwlzlbizzlppiziwzlybgllpwwgbwilgylbbiiwibpgyzyziywbzzpybziizbgbgbgypbibbwyzlgpwllyiglplbzzwiizylzwwpiiwgzyypgipbwyyyppblwlgbbwygpgwzgilyzwzzyzpzpwlzilzizyzglgziwpzwybiyppgyblyibpgiygzlzbwypwgzpyiybylgyipbbzgbiiggyybbliwyibwybbylblwbybgypiwigzilplibylygyligibplpzbilpyzypiywppgbzypwlgzypbbgbiyyipzwbwiwwgyyzzibiliilpgpwzgwbipwwizplwiiwggwilyypgplggwzwzyyylyizgibyzplwizbpgwgwbglzzwzwgyppyllbggiziiippggybzgygizwygwlpgbgglibilgbylyibybygwzylwggzzbgbzgwyyybwbwblzbbwylyiygyypbwggbyygzgpwbzbgzzgyzwlgpwwigplypbpywlpylppzywwwyyggigibipgizibpwibyzypylyppilppipizpplgygypgzzpplyizgyigzyplzlylgpbiywzyywiglzbbpwgplbbpzgbilplgwbpybbzpippyzgzgpwlzwpiwzyzwyypwgppzgpizyybbipizlybywgzlypgyggbypizwgigzbbbzpbzligglwzbwpiypiyzwyiwbgglwillpwwbpzwpwpzpyilzzlpibziygbggblbgyylpipilplzilzpibplbgbplzwigbpylwwlpwgbygbgwylzgyllgzzzlilwwwpwzippyypbllwwiyylpgiwwizlyizgpbiyzplyppzgpiggllgbggbbplwbwblyybgbilbgwzglbywzzwiyizwpzbizylyppwylgzwyiziyzzzyywlyyiggwlzzllbpwzlzlbgpgwiliygybipzyiwzzplblgiwgzywbzplpbibbiibyplgbzbzlgzlzlizblilblzpibgzgplizpipyiiblpgywliilwpllpgwpwzbwiiylbbgzillypllzbizgwywilibbbwgpygpliwzpzpypgpiplbwigzzpyi\niggwxirrxwryiygywxxkwyzrkxwwggryryrizyrrkyixyixwxwyxziyrzgwryrkizgzzwyirwyrgxxrkwigzyzwryyzxkyzwgxzgxkkkikrwxyyrzriiyikkyrkzyxwkkwywkwwwwwwyykzgyiwwixiiigkzgyiwkiwyiryyrrgkwwxrywzirxrxkizzgrxirrkwiwzrywgxxrikiykizirwyzwxgryzxwzgwkyzkwwikwiirxkyxywxrwwgyyxgwkryryrrixrwikyxziirrigikyywwgkwxyrzyxgxzgrkiywwgyrirxgkwzwyxyrxrywzrzrzzzirwxwxrzrgxxwgkrikrrkikwgzwxziwxkkriyirgwizigggrxxkryrrzgyiyiwgywwyywkgrgkrzggixzzkzzxxiwgikziikyzrzwryyggiwwggrzwryxyixgkkkrzxwigwrygwxwxyygkkgrkxiwygxgyxxgxrgzwirigyyryxyriwixkwxkywiwkwrkkrkgxwyirgrrxykixkigwyxixiyryygyzgrxikgxkgrigiwkwrriixwgriirixwyryzgkxxzzgyrkrrkxywkygixiwxikgigykzwrwkygyxkziwyzkkwrxkrgrxkrxriizkkgzkriwyzgxwiwizxzziyiziwrikikxiwgxxggxrwigxzryzyrkiyrgzykrryrgkxrxrgzrgirxggrykxyzggykwiwiiwrgyykyxiikzxxyzyrziwiggzzkyzzyiwkyygiwwkkkyyzwggkkkkwryzikyrgyrzwwkixgwikrixixxwixyikggxigkxwykkzxiwwwxgkyxkikwkykyrkxxzzzwggigkgrkzxirywkyrzwwwkikgwiwzygrizrwzikzrzzxgzzwkyigxyiikzgixgkiwkiwkgkzrwikigxiyrwwykikyxwrzwiwirxxwzrkwrwrwwgrzwrrggkzykiwzxwxgggrywxwxrxyixxiyxzziyxigyikgwkgxggxwkwrxrwxrizwwigzwzkrzwwzyrxyrrxriryirkzzgkrxkrkkzzzkigrzyxwgzwirxrgwyiyxkgzgwxwikyygxyzkkzyxizgzzkggyyyxyxxzgzwwrxywizrigzgwygwyyixrrkzwyxggxzrywrzkiiwwgzgwwiziryzxyykigxgxrzyygikyxzwyiyxrkgzyxrkrykyrzrykyykwxxyxiywykgzwiyizgzygrgriiwwwzxizkwrzigrwwkrkrikrikgzyywwxyxgxkywxgwxxkyixzzzrkxkkxrzxzwxirkkizyyxywxzykwyrxywkkxizrwkzkgizwrirzyrzkkzkiyxygwgkikgixzgzgzywiixykwxigwgxzzwwxzgwzryiiigyzxigkziwyixizryizkkkzwwzzigiggwggyixgkirrkrzgwxwiwwgwxggwzizwrrwkkxyzwxgwzxykkwkkrxgyxgwrkwxzykxwkzygkigiixgwzrkyiyrriwxiizkzgywwxzxkzigwrkwwykkrigkkzrixwrzixigrrgrkzxrrkgxrwziwgzikirrrygrkkzyygywkkzwygriyziywriyrxigrykyywrikwxygwyyrkirkizrkxykxxkxgwxirgxwiwkkzkrrikkxzxrigrwywwkyzzykwkrwyggyrzxyzywyyxxgzgkwyzyxkirrigziykriwigkixxzyirygizrgwigzxyriwizzgzkirwgwizyzyzwwzkxgyzkxxzkkwzgkwwrikrxgyyxwiikiwrygzgzxwgwxgrwxwigwgkyiykgxxyrwziyykxrxzzzwkrykggrgwyyxrrwkxkrkirxwwgzzwzgzgkwirxkzkiyrkkyiirkxgrryrikkygiywxgiggigyygrxykzywiwgiwrwkgyyzgywyyikiyrxkkgrzxiigyyyrykwiygkzyzggzkkwrkzgzygyikxxrxgkrrxgyrwgwwrziyxzzrgkgkiwwxyrzxyzyggxyrrykxxzikgrkxxyzyikkwwykykkwzzgygiyrkkxziyggwwzkgrirziyxikwrrgzgzikkirixygkyxixggwgkykrzrxygixikrgxkiyikzgxzrrwxgkgwyzyiirixywyzirgiwxyziiyzkwwyyzkzziyiygzxywkryyiyriirrzgykkzywzygkggiywrgzrkyyrkkyxiyzkzxgyrxxkywyryzywxkwwiwzgwzkyywgzzrzxrrriggrxyxiggigkrrwixkikirkixiriwwwkzzwrrkrrigwzgggzzxzwigkgzxiygywzzkwgyzzgkizywxwkyyzrxgrgiizzgkkzgrkixrxwwgywggyzkzwwzgxyxrygkxxrzggzkyrkxyzzgrywrigkykigixzggiwwzgzkgirxyiiwkkyxkziyrixxzzkzxwyrgrgzrkxggwrxgzzgxyxyxyrwxzxxkrgiywkiirzyiwixggkzzgrigkkwzzkygrrwyzwxkrrrwwxikiyxxkrywykgyzirgkggrgwgwkigzigzgrgyiygzkwgkrxzrwwyrxirzxwyzrygigxkrwkygwrzrxriyrzwxxgyxzzyyrrxxizkrzxkrxxrixikxrxyrwzkzygziwizxriryrizyzxwiwgxziwrgrwzrkwwyxgrwkiygrwxxyxzrrzwgkxkzkkyrrggzxzizziwywkgykxzwkkzgwikzzkyykzirrwywiyykgkgrrrirzgyzxrgwikzgxwykykxyiggkgkyrwwriixyyzgzzzwwyyrxgyryzgkrykiwyxyyizxziyxrirzxrxrykgrikyyggxyxgykrrrxkxkxigxxkrirzryrrwxkyyxrrygywkxgxyggyrgkiywkkzywirwxwrkiwriwwgrkkkrryyzyzxzwyzgzxwkzxrgrwrirwwziwwzwzgwwiyryrwyggwwirzgyrzygrwigiriywxzrkgrrkzyigxxwkywixxwgyxziwiykxwrxxgwzwwrgygywkigkwzkgrgkrrwkywwgywzgrrxxzwzgirxrkygirwyryyxrwzgkyzygxxxgwxgizyyikgxkwzrwzrgkrzkxyyikziiwkkxwgkwkwgwrziggiwzxgzryxyyxixyrriwzwziwigzigwzxwixyxwigkzyxwrikkiwkyxryxykrigyriiygggizikkkwkgzwwrrwxiikkzrriwyzkkzgirzgywxzrgwirwwgywzyyiiyxyyxxwikxkxirrxyxzixykgyixrkggkzrzgkwgxzgrirwwkriygkrzgzrgggrrkirrzyykiggiixwkgigixywykzizryrxzwgrzkggwixiyzkygrkxgwiwxzxxzzxrwiyxgxgiygigizgxizixigwzxygywizgwzwrzzxiwyrkizzikwiiwykwkgxkzzrixxygziirwiigxzgykrkzizxxxkywrywizkgwgwrwywzwixkzyggwrzwxxywgggzkzzriywirwkykzrwrigiygzzwkkxkkwzirrrryiyziwzygiwkzrxzrxyzgyrgyyiwxyxwrzxzxiwgzgrxgkrkygxwgiwizkkygiirxgyriygzyiyrxirwzwzxwkwixxyyiwgzgwiwzrigrkkxgxggxxwyrrkrizkwwkwzwxrrgiyxxgzwiwywiwxwkrxwiwizikikrwziygxwgyywwxwkwgkizkirykiigwiikrxixzxiiyygiixyyziwwwxiwkixxiwkyxrgkwzkkyzkgkrxwizzizrikwkxgygzizgkgrkiwxwgxrkikwizggkrzixizrzzzzxgrgywxrxwrgkxzwkrywrwkywyizgkrzzkzgrxywkwzggykixwxgxrkrziykkwgyrkirwgxxigirzkkzkgwziizzxxkxkrrgiyzkwzwwzrywrkzxzwkkgwkrxxrzkizwzxrzkxkgixwzixwkykwrkgkyzwwwgiiyyzgxgyizkkkgzrwyyxxgwrziwzgwzgykzxrwikgwxkziygykixygwxwwxwgwgrkxwxzggkxkwykrziigrzxrkkikkzkiwxkzgwizkxrkzgrykiiyyxiwxrxkizxyikwwwwywwrzwyyiixrxigxwzwyzwirxgirgkzrwrkxziygrwkwzikkzgyyzzikrikzxkywkrgwxyzgrkiryikwrigirxkgxgxykkykirzwirkiwwzzkzrgrggxxkywxiiixiiyrkrgwiyzriizgxxwwygygykkkkyyyykygwirygrkrykrrrirgizkiwiyxggyrryikyzgwzwzigxwzixzxkkwkgzxxxgryigyxrzwkwwikiwrwgrzkkygwyziwxxkygkixziwzkkgkgyizzkkxkgkxzwxgxzggykgrkrxkrgrzzxirkrixwrryzryrgkkywrgxxygkrzywkxrxrgwrzgzxzzkikzrykyzxzrxzkggirzkrgzyxgxziyxkkzxirrwxrikrwwkxxgwgzxryxwiwwgrxwrgzyryzxiwrwzwwzgxwigwwkxgziwrkxzgkxkgrxikzygwwygkkyrzzxikwryggzkyikirrkzgyiirrkkiykwzwgrixgkyiygwkgygzgxzizrykgiixkzwywgixkxkikyxygryxgkrxgykrkxizirryrxwixzyrgzkyizwzizwyyizzykkgrzzwryryywgwkzwwkkxgkkikxwyziyyxgkgizxzigkgkyywiwxrgkxiwkkykyikwkgkkwggxzkgzixkwyzwiyikrrwzwkriixywzikkxzwyzykgyziwyiwgwkiwkrgzrxzkzxzwixiwkkziyywrizkikyzxzkxzikzgryrkzzyxwrgxwkixyrkyyigkzxgwwxyzkxzgizrrkwzrirzwyxkgxywikyggyxgggwkzxxzwzgkrkkxykgigikxzwgkixkkwwrgryzrwzxgrzyrgwiyxyriirzixixzikwywwzxrrrxxzzigrwrzzkrkiixgyxgiyxyiigixkyyirxrxwzzkgygxiywrzkzkxzyikywwgzyxkwzzkrrzryxwgwggrgkgzxywzykywgxkgkwkygyxyxyzrwzzrrgixwggirwgwzrwwirzxkiggixyxzwkyixyywkzgxwgxziwkrgxzywxywgykkkzgkygkizxrgzggxxrygggxzkzkzkzkkkxywygwrrrxwxyyiwxxkrgyxkkkkzkyzkgryxxggykrkwkrigwzxkykiwyxkgyxkwxrzrzkwwrrwxygxzyxxiikizrgizriwzzyywkrxrxzywgizwxyrxgxyxkyrkwxygkgrxzzxgwzzrrzzkxkykkrwkkkrgwywwyygwxzrxxwyxrkgkxwyxigwyrriykkixrrrxgkygrzkyxzywigriiizwyyrzgwxikrzzgiyrkirzziyirwykwikgwxrzzgzkkziwywrkrgkyrxkyirygrrkxyziygkzgrxzkwyyzggyxwgggyzrgzwzyggrgkrrxyzkkxyygzzzrzzrixzxggrwzggkkwzxxkxrkrwrirxxwzxigxwxrkiwyxizzwzggzxwwwzxriywxiykzzzkkwiyxzzwrrkirxwxzwwxxzkwwkkiwkwgikrwrkwwzyikwxiygkykzzkzgxkxryxrxgwiwyyxkkwwyxkgwxygiixrzkxyrrxiwzrxxgzzgzyxrzzzxwwrikgriirxrkiwgrizwrrzxyxyyriziyiiiyxwwzxwrkzwziiygrkrxyixwzgxkgkkyrkgwiwkwrixwzgryxgxxzzwrxrirrzwgwkgwkwizxxzkzrgizkggwikxgyiggzxkixkzxgggwxxkwxrwrrikxxixggygyrzywgxxwrxiywkkrkiwwzwikxgxyxwgwkykryxkygrggzrwzkwizzixiwggwwwkxgkxyrkzxwzzrwwzgyizzwgwzzkrxiyirwrzkrxkxkzwgyxxkxgxizxgiwyikrixkkkiiygxyxxkyzywkzxkkirykyyxiwiwkyywzxwzwgwkwkxxrxgyxxzixygwikxxgxzwzzgwxywkywiixyzkkgiwwkzxwzziyzxiigrwkrzwrrwrikixizywzwizgyzkkxwzrxiwirkzkizgxwzzzywwyrxwzwrrzykgywkizzkxkwrxrrkiizkzyiikgixgykiwriwziyzkgxrykwrwwgixzwirkwxrywrykkygkikyygwxkkwigrrrkgxkwywkzggwwiiwxykwkyggrygzwzgzygiwkyrwwkkgkizxkyzgzgxkyyxyyxwrryiirwkygrxyggrwikkxyxkzkwrrxzgywrxxyzyrwzxzigxrzwwyxwxrizyixggiwgzkrwzzzzrzgyrxzgyzyixzyiygygkkkizxiyykykyzkgzyikiywrrkygriizgkgigwzykxyiyywxwyrkixgwxgzgykgygkzkyrzkrziwrgkwzyzzxrwkxxwzygwikkgixxiwkiryykrwrxgyziyykyxxrxzxgikwkyrkyizyyyyggrrwyxyygykzyxzxgywxryzizixwrkkkkirzkiywgxigyxiwwrwxkxgixyrzyyzryxgiggizwgzgrgkirzrizgkgixrwxiyizwygryrirwizxkxkkrxyikwrwkgykkyzxgwgzzzxkywygzwizxkzzzkxzyzygrzkiyyzwiggzkxzwgziwzzgrrgrkkrwgrwwwigxziriwywgriygiwygxzirrxziikxkywrzrzryiiyxkryrgwxzrkgzwiykkwkzkwgrgygzgkxizxiyywzxzgkzrwxzwzizkiyrrgygygxzwzkrxiwyixwwgkyzygzkzzwyzwkgxgzwiiygwyxryywzwkirzwiwkxxxzxziwgwygirirrwrkyrigwrkygkrkkkzyixykrxzyzkiwiizrxyggizgkzxizywgwrgiwwkkgykkxgzxwrkrwyxwgkwikkwgkxxxxyiwirriyzizgwzygrgkkrzgkxkzizzyyrigkixkxkwgxyxgrzgyygxkzzxyrzkwgzwwixiyigxgrkxxikyxzgygwiwirzyiikrkgixywxwiyxykrxizyrzkwwyxwygkwgyyxrrwzxzzyiiwkzgxwwwkxwgxggrizyrxrxkzrgxwgkggzwwykzxyiirwgkrikziizzrigryyyrwrwwikigkxzygikyxgrzzxzzgxwwzzyrzgiwzwgiwzrgykgkzrwziyxzzxxykrgrywgiigggixxwwigyrxgxwrwygixrxkykzwyyrkkywygxyikiirgrgkwgwyrzrgyiigxgyrxirkwigggkzgkiixzkiiykwkryrrwwrzykzwkrrggryixxyrkzixygwkykigrxwzrkrrwxrywrzzxiggkrwxrxwyxyxwkiikykwwxyggrrwkkrgwiyriyygykwgwyriiywikyyzxkkxixyxirwzzyyzigggxzgkwgzizxyrwziwwgzzrrrgwrxgyrxxgxxxyzgkywxiiwxzxkirkigkyxgwziyiywywyywxwkrzriwzxgiirkgkzxwwgkygrkxzwgxwziizwxxzigzyikgkkkywrwywrigxiyiyirxikyiwyixxizrgwgrryxgzzgkxwyrxxgwkzxkrzkryrwwirgyxgzkyygzyykgxxkgxywgigkizkwygwiwkxyzzikgwyxxyiyykwrxxgygkryrkwkrzkkgwyyigkgyiyyiizkxgzizziiywxwgykrzgyyrwiwxgzgwzwyggxzkgwzwwgyxxxkkwkgxikkgwgzwiyzrxzggrgrgkzzgzrxxzkzzzzkkzgzikxxizrxxrrxxxgyrwxyyygziiiyzyixzxwwxrggygxgywxkkgwxzykxikrirzyigwzkkizixzkiyykgzwkiyirzzxkzziiikywixyykgrrkyxwrgzxwykzzxwgrkgxxyxygixzikiywgxgzizrzgyzxrzkggixzkxygkyggiyxxkykirzxrkgwziykryxwzgywkrixxxyiyziryywkrzkzzxyyzygzgzwixgrigizxxrrzkzgrwrkigizxiygkzixkyrzzzgwyizizriwygyrxyrkiyyyzywkzgkxwiygkwkykwwyxgwxxxxyxkgizriiiywgzyiwwigxigixzkrwikyryrkgrxizrzygzkwygrxywxzxgxgyygzkkwzwkgyikgrxrkwxkgyzyrxzxxggzrzwkgrigwrkgzzikiiyrkykyykwwkgrgiykgxyzkrixkzkgxrzzzxxywyzxixrrgkggkrwirkgkrgxwkrxkyyrgzgkkkxwxzwkiryrkzyizzyzirwkywrwrwzxwikyiyxyxiygxyzkyyyizzgyrzyyryzziwgrxzykrzgxkwygziriizgkkizkgyxwwxgzkgxykkzgiykxiyxzkwwxkxgxykzkrgikwxwikizrzzgyrzxyyzgzrxzikizkzykgwikkgkgkzgkxzrwgkigwxizwzkgwrgkykzwrzyzzwryggkrkigwwwygkxzzzwxyzxwgrryzggyzkrxryzgrwyzzrxiyxikiziyxriwgiigxikrzkizriggykxrrkwwzyyzgkziyrxxwgrgwxwxizrgrwzkyykggxgkzizwyxgkkiywizgykxrzyzrgxkxkxrrwixiyrzgkirwigwwrwwxyxxzkkxwrgigrykryxixxryyrxwyryyiikwxkgzziigywwxykgizrrzgkgwxyiwxxgxgyrixiwiwkkwriwirxwirriwxgzgkxrigyzixriryyzrwkryiwgigiwzyyrywiikxiwiywgxgxkgwzkgywxixiixirxzwzkgiyizwrxzrzrxkiykxxkyirrkgrgzkwwxgzgxgirzrxixgriyyrxgxwgywyizxyxxwrxrwizzxyrxzkzkzxxwkrkkzxwywzygikgizriyzkrrrgrxkkkywiyxyzigyrxrzxigzkyxrkiwwkgzzkxwwizzzggkgkwwirwzzrwkwgkyikrigyxgkgxiwgxyggkyrgzwwikzzkkkiyzwrxkyxkiigirkgwwkyirrgwzrzgzywxiwrzgiigiiiyzxzkxyriggwgkziiwwgizixggixwyzywzikyywwrkgyrrwkiwrixkzzgiigkwxxyywyxgriwygxxiryrygxyrgrikzrxwrxywkgizgikykxrrgrwixgkwwizkyggziykkrryixkzgizrrxwkzgrkxyzkyryzwgwwzkgzygxzzywzwgizrrggxwyziiwgwzxgrwxrkrwkikxyrrizxkykrgzizgyxykkwrzikkkzwyykirwkkgzkryywgrzrwwrwkiggxizykiwwyizxwigzizzgrxkkiwgiyriwrrgyzwrizkgwrkigzgzwyggrkyxwyrgigrizzyxwrkzziirgkzzzgixgiigriwziwwgwrwxrkzryigygizyyxwxzwzrzyrwwwryxwwxzxwxyryiykxgywixrxgwrzrkrgrikryxrkizzkgwwyzkiirgixyywgirzkwwiiirwgxikgiwxyzyrrgkzzxrirrrrrrwiwiwiizixwwwkwgkzwrzyxwywykkkirwigxywzyzkkzzwizygrygzyrwkgzwwiiikrzkkkkywxrxwwyirzzikrkgxxwywrkyxyyyxiggigrrkyrkrzxrxryxwkwrrkkrkrriwkkwwzwzxyxrgkixkyiyzkxzygyiigxkzyyxrgxrikxryiwzigyyyxzrrwigzigrxyiwyxxyxiwkkkzizxkxxryxiwizzzwgxwygrwrirkrwyzkiikggzxrzzxgwiwkgyzkywiykrzkzgzkzwkkkwkgwzryrrzwrwwrzikyrrizggkiygxyzxkrwixxgzixwgykiiirrxriwgikgwrzrkxzwrrwgggzywyxiwwykwkzgykkwyxxyigiizrrrrrxrzwyzgxywxxrzwzixxkiwzyzygzkkkywzzigxixrzrkxkyzkwxkwrirrrkyyzrgkkzkzryiygkrgrrrkgyyzgkrgikizgyxwxwziigyyikyzgkkzywgkxxzkgkyxwwwxzgzyggzrrrywgkgwzgyrxwyyzgywgywxiwrwzxrxyyizrgwwiwgigzizwikkzgggiywwkzrgikyrwykyiigrkyxxrgkiwrkzzxrzgrywkzyrzkxizzigiyyigkggrrgiyxwkxzgrkyrkgzgzxizwgzwwgwkxrxiygzwkxxykkxkxixzgrkwgikwzgkrrriiwwwxzxxkzwyxygxgxixyggyrkkrzykgrwyxgkgxkizikgyyxggkzwyrwkiyzyikkzkkywkzyzxggziiwwzzrriwwixkwgyirkxwgyikggkiizkrikkykrwwxrkzzzriikzixwgyyxyyixkirwgzgiwkxrxywzzkiziwwiigrgwykikywxxikkwgziiyxxkggkwrixrrrigywiwxkyxrrkiixrrzxixikkwzrzyrywxikxzxyxxzzyygyrgwiizxgzirwzzgxiyrzigzywggzirkrixxyxirkkzwkrizzrzzyiwkikkrwzzwkkxwiiikkwgiyxikggygkxxyyizkzgrkxkgzgziryywwygizxkxriziriggrwyyrrzkzggzxxiykiiyywyrrkzrkggiyxxiyxwizizxiziwxykgxizigyggwgkrwxwkkwixwyykxgggwiwwykxxyzyxrzyxyikriwxwgirzrxyyzgxyiziwkkxyxxyzgywrygzgixxkkwyzxgywriigzwkxizgzrzxkyryzyxgxkikixzxgigyyxrggxgziggywzgkwxwwirkgzyywyyrwixirkrgzzxggykwgkxzkwyirywzkixywixizzrzxyizirywkrywwkkwzxggiwxrzwzgwrryirgywikgzkwzykzxikwggiygkirrizxziwkzzrwriwxzzkygzzzzgiwwkyzxgkigxxwgryixyzkryixzrrzykyxizgxkxgxxiwwgriwkkxikkyyxgyziygkrwwgrgykizrkiwwrkrkzgrriykwwxywwwwygziywzgygzxkyykxikkzgrykgxgxwkywxywywwzziixwkxxwkkxrwkzrwwzikyigiizykyyzxyriizyryyzyzxxgyzirgyiygyrgxzrzryyzzggxkyxiyrirxkxxiwgzwzgkwrxyrkygzxiyiiiwyxwkxziygzyizrkzykgxgwrwiwiyzywkiwzizziykwyizkxrggwkyryxriyxzzzkrwkxwrxykykzixyygwrzwiyizkwgwrkwzgrwxkixkxgxkrgwxkkrxwrrgikkgrrzxrixkxirgwrrygzrzyyzrxyxkwzzixwxrxriwkxizzzzkizgkyiwkgxykxkrxggkrwrkirzxrwwriixxziyrkzkyrgkzgxgyxkwgwzzwwyzzzrigxyrgggxxxzikgwwwzxgxryggiyrwiwirgzgxzxggigkgxwggrgrxzwyyikgrkkxkgrkgrwwkxykyzggxiywgrzxiwirgxzizyryriwrzrkzykkwyyrrkwikwrkzgwzigiyzwygkgkwkyzggzxrriigrwzzigykxixgxzykyirgwxxwgyyzixwgkigiyrxiirkxwrzrirgkygxwwxiykwkzzzrgwwxkzxwwkzwzzxzgikxgrrriwxxxixkrkyyzgziwikxzrzrizyzkkwixyiwyzkrxirizyiwgrxkkxzwigrkgzxxyikzrryxkrygkyigkgyiirzzryyywwwgkzrxkxkirgkwwkizgwzzwzzzkxwgwwgxwrrxxrxxzkgzrgygwxzzyixirwrrxxyyrxrygzzkyxxzirgkwxzwyzrrirgrgziwwgkwxiwwwxyziikkgkxgwriyikggyywxkiigkywkykywgwykrxriiggrgygzrkwkykywkkwrzxygrikggxiywkiwkzrkrgiiyikzxriygxgwxgxzwrxxyxrwgywizkziigyygwzkrkkzkyzgkxixzyxkwkyyyyxwyxkzyggzyxzxrgiwxxrykgyrwrrxiikrzggwrxwyggryziwigkxiwzyzxwzyyyyzgzygrrxyxwzzywwiygzgrzyrgxkizkkgrizizywzkgkkiiiwrgzwixxwyyxgrrxkyyzyyyrwwrgyyrzggwzziirirgyikwzwgkzxigxggixrzggiiryzgiwigzzygxiwyrxxxyywkkxwrkwxzkgiryywiizxkxwrriryyyzzgwxwkyyrwykkxikgzyzxrriykgwwwgyzwygkxywrzizxrixiwwyzzzzkygxxiyxzwzrgrgggzzrwryzxzwgkzzyigkwkryrwgyiigzyyrgyzziwrizwykxryyxgiirwgkkxgiizwrxwyyikrgkxriiiyrxyiwyyiggwkixzyxgrywxrgrkwkwigzrkiwxxwywrgwrizgrigiyzkyyzgwxyikyxirxkxgwzzkwwyrgwgrzywwgkykxwkyxxiyzgzxxiwrkygriigzgrzyxwzxiwgrzkirxrwyrykyzwkxigrgrxggwziiyyxwggywyiwixkkrziyzrxwkygwrwwixiixigggikkkgrrkikykrwrykgwgrrwzrxixwiwwikwwwrwiziiywkyrrxkzxkxyrxxgrzrxkxxizzxyzkiizzzzxwwkirzrrizkywrixrzyzyygizgkzyxkwwyrgizixyzzryzrwgyriirikzzriwwgygzgkzrgiiggizwxywkzkyzgykyrriwygkygikxigxyizriyxirrxyzzrwrkywzzrgkriwgkkxxrikxzxgkykkxwwrxwrykzrirkwkwgwwwxwxyzykxizwirwigzwykyxiwigzkywirzgkxyirywygigwiigwwixirxxzzwykkkzirkggixkzkygrgkwwirrgkywgrxyxzyixzrwwiikiriryrwgrkrikgggkwzxizizrzkyzgwwrzikrxxzyzigwwizkrxrxrzxrwykykzzzyyiikykkzkiwwiwkiwigkrrgzzxzgrxgwixzrxrikkrkgykgwkxrxgiyixiwwrkrziwizwgzwzxgrwrigwwgkrxkxwkgwwyrixgwykgzrkyixkrgrggyryiyxkrixgwgxzzgiiriwwzxkikkxxywzzrgzirygggygywiygwrwyzrkriirriyyyxgyrkxykywzrrxzxzzxiyryrywrzwgwwzgzgwxrxzyyxrrrrgggzggxikkzzwrykzygkzygxzgzgrrkyikygkyzryxyxwrzizwgxgwikzrgwkgxzgkgyzwxrkwiizxgryxzxwxzxyggriyrxyrxxrxxigyyixirggkxrxkwxgyzkywgiixwwyrwkygzykgywkwzyiizkkwxyryiikiikwkwkzgrwzwggzwgykizgyxzzzgiykxkwrkrzzxkwkixxrkggrwrgkrgykrrwkkixggwwzzxyxzkkyxzygrrixwgkxgwwwkwzgzkwxkrwiiwxwwyygyxkiwiryxkyzkyxgryxgzgwwrgxryirrrrkwrzkzizwgrxwrixzwxiykyrkggxykwgykxwxixzwwyikwyizxgiikrgxgrxxziiikwyyzkkyxkyiyyyrwgriwwwxggwkgiizkyyxywiiiizgrzzxgywxziwkkyixwkrgigkigwkirygxzwrgywkzxwggwwkggxwxygwwwkzxgyrrkxriixzykrrryyiwzwkgrxrzygzzxzzygwywwkzryygikrirwyziizwkkikyxkxzyzgiwwkxwkwkykgkkxzwrkwrxxwrxxygyzygiwiggikwwkryrxkiyyxizrrxgkrzzzkxykkiyzxyggyikyigigxrwkigkiriywkggxykzzgixzrzwikxkrzgwriizzyxxgyzwizwiiyzyrgrigyrkgxwkxgkrixikigiyxkxzkrryiigxwyzkxygwirwzkziiyyzwriyyyggyyirkzkikikgzxxxkxgxggrkgrkxgrzrgyrzyyiyigwwxkrzgwgiigrryrzwkkyzkziiwzkwywgrkwrxyziikyywzxikywwizwkzgwzkkikrzwzwyyyxgixgiirikkyzrxykxgizzzrikrykyyizygzgzxkgygzrzwyryirkkiikxywwxzyzywgkykggizrgkzwwyykrxrikzkyggkyryzxxxwkrkgkkgzzxyxgizyrzizzxkykxxzixkkkyrkxyxzixxxwrirwwwxrrzrwxgzzrzryzrwkyywxrrykriwkiwxrzrwrwwwwxryxgkwrgygxyiwywiizgiyxzywwryxzxywiiwriixiizgxxrzwzyyirxwwkkkwikwzxizxzirxyxikzrxrkxrrgirgyyyzrxrxyxgkkywgizrixikywwiiwwgzxiiyrxgxkiiziwxgxixixkzkkrgyiyxgizkyxkgywigxwwkxxxzwkkrizwixrwgwxrrirgrigyzxyzxiiiirwzyyixkywwriyggkgrkrkiwyxwzrziiyrwiyrzgzrzwwrrryiiiirirwiwwiwxzrwikikxxkzwzkkykgzkxyzxrgzzkzyzxwkxrkgwxyzwgxxzikkwkxzirwiwryzzrizzrywkxgkyiwryykixyxkzkzxwkzkgiiyykrwigrwwrzgwkrwzwzigwyxywwwygkwkwwxgkkkixxwkyxyyrkwyzziizgrxixzgzwggzgzxzxwiwwxkxyyyrwzixiwkrwikgkykgyzziygrgxigxrykigwgwywgxyxyiggyzkrziwkgxrykxkwgriyyxxxryxxigzxykzwrigrkyriyxkzryyyyixgiyxiyzrwgxxrxywixyrxirrwiigwkkzzwyyykwwizygiggzixyxxywxywwxiggkxixiirrikzzxwwwygrgiikywyiwykrxyxgrgxkriigzzgryzkxkgyrkywgwizzxrkywwxxrkwzykrwkwgxzkiwygiyigiwgwwgxziykxxzxzxyxgwrgixgigwgywgirwgiwyzgwwxgrgrzziwxzixxrgzirirgwkkkxzizyyzzirryiyxxkkirgyzwizxxygrizwxirxxzgrzwwxgkggzygwrzgikrkizgwgyyzgzgixyrwxygyiwzgywrzkrzygzxkiwwrxryrzwwiyrgyxygrrrgkxziikkrkyiwxirxxryxzwrwyrzzwkwkrkyyrwiykxkzzrykywzxgxzrxrkizkwxgiwkgkwzixzkiiggyzrgwkykrrwxggxygzzrggyxyyikwyxryzrzxiwzwxgiiygggziwgzyigwgzixkixixiwiyiywwirkzzrwggrrwiixrkzykwgkrygizzkxkxxigzirrgkizygkxwxixiwxgwykrgxryzzyxxyzykzzwwziryrrgxykwwzykxikxziywikxgxgzywwigwzzyykiizzkxgkkzgwzwiyrxxiiyyrwiirgrxxzrkzirirgxyiwrxwrkrgrkwrrzxzrrwiiwkyzgwryyyzgwirgkyyyiwrykzwrykkwrzgiiirkkkxwkigzxyirkyrrzzrxxwrgzkkwzgkikgkzzxxkrrwkzwwwirrzzgrizkygkxiygrzyyzxzgywwiizixxgrgxrykzkiirxykikywzgxwxwkrxgiggrixgwgwwxywzkzrkxizgkgwkigkzikzikyizzgkwigyzywiwiriyixgxyzgzrxxkiyzixyzykgyxwxzxwzxxxzrgrrkrywzwxykywizirxwwrwkykgxkwkxwiwrxiyrxwizwxgrzrzzwxzwxkrigxykrgiyxwxryxgiwiwwgkrwzyzkwwryrzgkkziywkxyxiigzkzrywixkyzzkigizwkxzwkirkygwkyrkgyixzyxkxwziyyxwkkgirgykwiykrxxkxzwwgxwiggkgrkxzrgyzrizyzgrigxrixwgrwyzrkiixzzigryrggyrzgwrggzgrggrkgiwrzykrkxzxkkgxrgkywzygrkirrixyzryirgzzxxwgizigwgxkxyxkwyiiiyrzwzyrzgzzzxyzxxzizxrrizyyzrrkyxryrxkkkyrxizyikxwwgzgwrwgygwikkxzkggwigiwwwkkzyyyiwkixxgggiwkzxzyrggrkxgrwwzwkwizggziyyizzrkywiwwwrxiwywizigrrrrrxzxrgyyyiyxywkxyxwiwyyzwkyriwxirrwgwixxixiiwxgrzyzrgixzxkgrwxyyxyrxkigxyiwxzzgwrggwrzrzgzixgxyxrzrzzykyyiwrwzgwrzizygwwykgzgryxgxrkzwzwkxwkxrrkxigyryygrkiryygziikykkgxwiirxxwgryyzgxkwgzkirzkwiwirwzzkriygigzzgwiwiwxzikgzggzxkzykkkkiwxriziggwwwxzriyzwxzizgrikrkzkxikzigwkikwzkwkkkywyxzizzwkkzrziywyzgwyirwrkkziyrzzwxkkxkwyzkyrrzrxgziygywkkwywzrkiirxizxkykxwwkzyiykiwyzrrizzxxrygxwkwzygwkzyriyryxrwigiyikgixwkrgzziygzizzigwkxwzkggkiwkzkwrzkikyyrzxzzxwkigwkkirrgizwiirzxzxwxkgkzziyyrxkixxzzirkgxizzywkigzgkrygkwyrgkxzyzrwgkxzkrrkxyrwrrrxxxkrggixkrwwxkyizxriirkrkzzygrrrwikzyiggzxzwkyrxkwxzxrxwzkiixgyyrxxwzxgwriwxyggzgywrkxkgryrixygzxrrzzgzrygyzkriyxxwxxwrxyrkgxkyxxkgrygxkwwyzxrzkyxgrixzriwrygzriyrwggxzyrikrixwgxykzkryykiwxkxrixxwrkzgigiixwzzrgigigkwykwwkzgyxgigzzrgzxkkgkrizrgwygkyrkrxrrxgiwgkigizrggiikwgwiwwkggzykyrkzzyiywgyzyygriikkzrzxzgrgzryikyykkryriwwkxirwxgiizyrwyrwkrrryirigygiyiwkgyxzzrrgyigggzxgiiyyrzgyygziwwxixixirrxyrkxrywkxgygxzzzkykyxrgrryrwyzgrgzxwyigkrwyxkrwzryrizxixrxiikryrirkwzwiyygzwxyrwkxgxzxxrwgxkrxwzwyigywygyzwwgizzxgzygxrrgrgzwzyzzizkwwxygwxgwwgiykkkygkzgigigirwrwigkixgykkkrkrggzzwxrrykxygxirzrkwiiyygykigkkrriryrwixigwirrzriwkgirrwigkzizwryiyxirxixgggxyyggxwwrrzgzywiiizygywywkwxykzwrygzgxzykwrkkyzwgzgwxwrixzxrkgwirgwryrxxrgyizrggkrwywkgggizkwgkzizxwgywxigiiiywwgxxgwixizzwkgwkizzwzyyyywwkigxxywgwrgkgyxrkrwrwkkggzkgwiggrrrkixwirrkrrxygrykkiyzzyikzrgrgryygkxxwxxriwxkrkkyzyriyikxzxwxwkrgrgyrzyiirzzkzwzywrixgiyrgyzkriixixwxrygikgkgizywiiigyirxyzzkryiwkxxkgykriiykyxyyxgizyzwwyyiyiriwwgkrkxiwkrrgwwziyzkxkyiwrxkxkzkrxrizyrirkxkikxwgxwxzxrwxxrxzkrgkzwzyziwizzkiiiggkrwrgikrxwwgyywryyiixxgiwirrgrwzrryrixxxkxzxiiyzkkkxiizriixwggzxkrxykikkgwywzwxzryyyirgkxiwrkxyyyrxxwrzkrgyigwgkkwkkyyrgzyyixxzrzwyyyxyyzyikxwywxriwwzkwyggixxwrxzirzyyxwikigiikygzgwirwkwrrrrgywggryyiziwywwygzxxzwzixxgygkywixkiwzkykgxwrxkgizixwkwzigrkyryyxyigzxgxygyikxwizkwgrzwygyzxwirrgrgyyzkrrixzkzxgywzriyzgkrizxwxygrgizgyiwzwxrxyizrrixwwwwgzirgxwxzkkwgzxwwkkxygkiirxrzwxwirwwrkriyxkgiywkzwyiriggiwwriywrzgwwxxggiykizwggigkxkwxiggxggigxwkirkgxwxgwywkzzgxgrxzxyrgzygiywzyzxrwxzxzzxyiigrgzkrkxgxkwkzgzyizgwzrgywzxxzgwwxzirxrrxkxkzxyzxgxwyykkzigkzrgwiriigwwwyrxrxzxzgrixxiziwkzywkkwwgyizwgzwykkggkyxywwgywxgzzwxgxikiwzgxxrgxxwxggxigzgxyiwwigrkkyxxikywrkzkixzyzrkrxkyzkggzgzxwrrrwrzrixxkixkxwxzziwkzrkyzyryyizyzywkiikxgiygwyzirywizzggwyyrywyyrxkrgwkryikgxrgzyxgrzxkikzrxyrwryxyiirxxyrwiikgrwxkrygrkkkgxxzzyiyyrkzgxyygrrkigrzriggzikywkrriywiwrggykxrkkxryrgkirkyzgwririwgrkgzixkrxgiryxyizgyirywkxzkrrxigxkwwrxkrxkzziykyigrrikxirgkwziwyxwzyrxkzwzizzxzyykkwkxkwzwrkwrrxkzyyiggygrwkggxkwikrkiwxixxyiyxygxzwkkiirygixkgwkyrizkwxyiiygzkkrkizwzgxiwiwgzxrikyiwrkiwkxwxizkiyrwygkykryyirzirywrirgzkgrzgiyxkkiyiiwkwggxwzkwgwykxkiizxkwizygwgxyzrwwxxgiikzxwrxgzwxxkxrxwyzxxygkgxkgzxxzggxggxgwyzrxrgxxigwkzzgwyzxwygiixxgzxyxwkgkiiriirwxkyixrxzwkkkrxrygxkyzxgwrzrwgzgxkykiiiwiyyrzixzyyyxxkgrggwrywwriigrygikzxykgywixikxgyyzziyikixyrzykxwgwxxiyiyzyrgwkwgrwwgyryiyzxirykzrxrxyzrywwwkgxzrgzrwwrwwwxykgzzzxyiizyyiykyikgrrirgiiirgiizxzxrirxxrgwiryzkirwygzggikkgzkizwywykgwiirkwikrxwirwzwrrkikxgzyyzikixikryyiwxwrirzrrrzywgiyxrzwgyxikwzixxxgigrikzkixiizzigigkrwwyyrrzwgzyygzgirrgwkxzgxgxrikrkzyzkgryzgzzrkxywrrkkwxyrwigxgixgwkkwwkzikzkrxkigwrwzxgzywgrryxikwyyrxwigyyyyyzggrkwzzkwgzygrxwxkyirwxzrgyggggkwyrirkyixxkiyiwgkywkkkrgzzgkryyxirixyikxkwrwwzrzwxwrwyxwgxzzrrzizgkkrkgwiwikywkwkiyrkxxgryzrgrgwiikyizrgzgrkgzykryirgirzrrxyyyzkkizwzzyyzkrwrizkyzzwiyxwgkzwkxzkykwgzriiwrwzrgykkrgzgzxryxzrzzgwkiixikywgirgxgwizkyxkrkgkgxgxgyiiwxyrgkkiirwizkzyxxwwrxgzxzgxgyxzxzyywrwxrixgxwgxrkxkygrxkzgxirkixyyrwwigwriwygwygrirgwwgkgkzzxzwikgkxxygrkrirxgwikkyxrzgxywrwgkgygkwgxrxizgikrigiygrkrgygyyzzwxizkzkyriiiwxwxykwrixiwziwxkkxzrzygzgggzgrrwxrgzgzwzxzxwrykxygrkiggizzgzzikxxzxxgyrkgyriyrrgwgkzwgzykgixwygzgrkixzzgkixxikyigxxiixxkgkiirywzkkkigizkikwywkxkxikzzizrywkirzwrzwxykrryxywxkrzwygrryrrkywixrixxrwgiiiwzwrxwwygxywzxrirxyrwirggrzryixxrxxwrrikxzyizriyzyxxxiwiyikyrykgiiiixwyziygzwzgyxggwgxzyrwgrrixgiwkwkxgxzkkizwzyzzkzzigxgiyiziixrzrrryixkrzrwzwigiyxxiixiryzxxkikkgyyggxzwryxrrrgyrxyxgyzxyzzzgrgrrkxiiiixzrxggiiwyyrzzwwrxwxzgiwikizwkrgykwikgxzwwirywxzzgrxggzkrwzxzgzrggiyxggwzkgxrkkiikzwyryxgyzxkxxyixizyrgykgwgxrwgyzgixkzgwriwrxgrwykggwyzkgzxgrirwrkkkzwygzriwgxgzyxgzyirzgykwkwykykirggggkzkgrywkxwzzkgkkrykkirgiwrwkiwgwxgigwwikrzxxywgwwixwxzxrrxxzgyirzkwkyxriwyziwikzyrgykrkrgigiyxirikxxkkwrxxgirzkwrzxzywwwxxzziykiirgxywkgwzgxxiyizxkykwgggrgrwzikzxzkwwzwxwziykyxkgrkgwkgrkxgkkwkywxxrkygzxyiyyizggyryrgwwkkrwyxygxyxxgwgwkixxkyzyxxkzyigzgwzirgiwrkkxiiwkixirizrzizxzkiggzgiykzzykkgxgwgriyzwzgxzrgyzzrwirkygwxgkrxggkyrkiwgyirgyigxyykrrirkikyyxgrwrkyiwkiykwyixziigyrrxzikgxrxzzgrikwrzxkyyggkryzwwziizziwzikwirwkxgikgkiriixwizwzykikiirgkxxkwwwzkzwzwiigkykxgwzkwxgwikwgrrrwwzgwxgywxzggggkyigzkgkkyiykkgkxxwzkiiwziizriggxxrwrizigiykzxgrkyzwggkikxkiykgxrwxzrriiwzgizxggwxxrwyriwygrrwrixkyyxrwikrwirrkzxikzwgrwrxxzgxwrwizyrwwkxxyiwyigrwyrgwrgikxgwyzikgzzggiyggkkryxwxzkkrkkiwrgrixryxgykigzkyixxirwikrgwgwixxkrkrwzyrrxyiwxigwzkiyxikgykkgxrgywrwkryxykrkrkzgiizgyiwxwigkykryzyykixikyzkiryzigwyrrkggxizxgyrrykwygzrrgrkwikizxwyxxrzyxirgzwxgkyyyxiiyzzrykgrkriikgggrrzwyigwirigwrixxiwxykzzzzzkkwgrgyxigyxxzwkrzzigzxrwwyigiigyyrrkzyrigkyrkggrizyggigxziikgywrxrwryriwikykixgxxxgyxixriiikgwxwzzzxiyggziykwrgixikiwxgrxgzrykwwxwgiyyzikrggxyrgiwygiirrxyyxgigkyiixzrwxzgkzgzkkyykwkiwxixrwxrygkgrkryrriwirzxziiwxiixzizwixkgzzwyywkxgrgggixigixwzzwzrgirgrwwzggxikgkggggizyiikxziixzzkxwzrggzkwwwrkxgyykrzrxrgwkwkggkwyxkrkgywkkwyrgrkggxiriyizwwyzyxwwzgxgkgwziwkzwwyxgykyiixwzikgxykixxiigkrygizyrygwwzygxwrywzixkzgkwxgigyywxyxwkrrwgzkxiwkzwxzkriizkxwrwkkzgrxzyyggryikiwrkykiwrzxiirikgxziziyiiwxkigikxixwiywgzygrrwirriyxigixzgirkkixzyirzwgkirrkgzwiikxxyzggrxgikzkgzrxwggirzwggkrrikrziwwwzxykiyrxyrirkyyyirxykxzzgkrwykrzyryirizwrxgwxxzgixwwrykgkykgiigyzzxiwzwzrxzkxwigrrgyzggkgiwwgrgygigwrrryywwrzrixwzyryzykwzzzgrrigzwgixgyxrryxkzirizrizzkkggziikrzrzzigxzzkrkyyxriyirygzgxxwzyrizxgrgrixkgyrzkikiikigzzyzgggwirxxzkyrkwryxirywyzyrrzzrzxgyizgxwwggxwkgikrwywxgkrykwxrrgkkgkwwxrxggyrrwgzwikzykryyrgrixzzwgirywrixiggxwxgikggirkwiixizrygwiggxiikzyzxixriwzkwgzxrrwrgzxrzkzxgxkkrriixgrzrriygwzygigyziwykxkgryzkgixxgkyixzgzzzkxgxrykkwxgwzzwwizgyyikwryzrrxwyiirgxggygkxyiizxrwrykizwgwiwywkywwkgryxkkgyggygkkiwziygkzkiigkriyziyrzxigryggkiixgzwrwixyizixirrykxizgxiiixxyrgikyggiigwwrykwrkzwkkgyygiiwrzgiywrxiiwyyyyrgxirixiixwiykkriwrxgirzkryxiigzwwwrwyrwriiyrzxkxyzkgwyyryxgiwgrgyywgrryrrzzygwgykxwkkrwkzxyxwxrgwxkgzxyigirxizwxxgggkwzywzgzwzxwggzkkzkrxkkkrywwzxkxwiizwkxyzkrgyyzxxrirxyxgyygkwzgkzigywywrxzggiikxzikigkrrzzrikwixgkrkzrwxrxwwwrikiyzkrigiiwxgryigwgyrywrgzgiriikgixikizikixkxkrrkxwgwrwwwrxrriyygiygzxzzwikrrwkkgiyygikkkyywzyyywyikwkwkxyiyzzkrgrgkxrgzwiwkkgykrgrxwxgizgixigriwggkrzizykxzwwiirkikxiikywwiywxirxxxzwxkzrrzyxrkiyxrzkxykyrxwxwgkxirzrriyrwkzizzkkgzyrgyrwyywiyrzxrxxrkwkkwiyrxzwxxyrggwkgrkzkggwgikirkyrikkrxgryiyixrxzxyiwkggkikykirgywyxzgygwzwwyrkzwzizrkggkgzyxywzwxrizryxrykxziiryxiiwigyyyryrwzrzyzxkzyiwrkkrwyiyiiwkkgwgxzixwgwwgrrwwxrwgwikirywwzgykkyzwkrkywiyiyrrzrixriixgzxizyiyiirgkgzrwgiyiigirwzgzywrxkykrrxwkxkxwyxyizwkywxigxyyirrgrgizrigzkwrixygxxwriwkwgrwzgzzzizyrzwxgizxgiyygzirzkkwxrygwgkrgiizzrgixgwizkgxxgzrgiiirxzzxirywryzxwgrzgwkriigixgrkirzkkxwwikiwwwzgrkgkzxriiwkgiykkgrgkrwkzkxwwrkygwxyzxzgyxzzwixwrriwrzwkyiykrzigxwxyxzyrygkrzkkyxxrxyyzwywgkyzrwixkyxrrrzzryzzgrikrikikiixzwkkgxggxxxrxwwgwwiirzgrirzyryrxiziwwwwzxrzzgyxygrkgzrkzrgxyirzzxxykggzgkikxirwkggxrwxwykxxrrzgxiwyzgyzxgxyzwzzkkxkyzzwwzyykrrrzwxzzkiiwgwggirygxgigrirywxigiykrywkrgwkiigkggxzrxrzxxwyzwgrkrirrwrykgwxrrykzxzigkwzwrikrykirrkyywxrrwikwkigygirwxzwwzzzrzzyiikwgyywwgyikywyiiiiixgrrixxxzgxzkkyywziwggzyiwkxwixgkizwyrxrrixkkwgkwywxiwzyzizyzzgkgrxrkzyxxrzizigkyxrgrxwigzxkkxgggxrzrriwgxkkwxgyiryykwgyxxxwrkxwwzrzwygwiyyyikygzirrzriigkyrwzzwrigkgwwgwzgyxzwygxigwxxgiyiigkrgkizixkzkizkwzkxrywziizggwkrwxxirzikkkryrgzkiyxrrxgizgzgzixixkiyxwyzzxryixxrwkzkzkywwyzxygzxgxwxkigxzykiigryygikxgigzxyzzxigzykykxwxkrwrrziwyrirzrwiiwgrgrwxgrkiyyyxwyzzkigywziyxzwxgkkigzwyxywrxxkzkygxrzigiizwxiirrwyyziiwkyiizwxkzrigikkgkzxywzzryxkxyyyxwryxgrzyiyggirggzrkxirxggyyyiwgkgyrgxwigryzxgwyyzgzgkgkyxxiixkwwkxzxwxwrkrwzrgywrkrxirykkikrxzxwrkryiywrgxkrggyykyyzizkywwrzwrwkzgxwkxigwxrikkxggzwkgigggzrxirrgzgzxiizzkwrykxrkwxkzgyygkrrgkixzkwwkwwgryrkyyxwrkirxykiggrwgzrygirwixzwixrizxrygywrggkiyiwzxzrzkkkwigrxyzzyizxkzxyrgxiiwixxirwywzyiwzrwygwrggxxrzkwywgzxrxwgkrxkzizrxwgzxizixkzixkzwwgykkrxwxrrgkzgyygywwgkywxwyyixxgkrwgyizkiwzirwrkxzgwyxxixkykkwkkxiwiykzrkxrkxxwkkzwrxzxrkkzwrxirxgkwrrizkwwzgiixxzywwizigkwgiiizrzxgygkyzgzzirwrxyykkiwwrwgwkkwzxkwrygxwwzzrwxkgrgyywixxizwrkrgkxgxxrrkziiwwzyxwxkzygzrxkgzzzgzirxgkxkiixwrrrywwxykwxxwiwwyzkggkxxrkxizgzkzwgxzgkkyzgkwyygywwrkzxxgykxzgywgwkgykxxgizzkzzzizywwzkgyxgwwzkikxykyggikgirgrykrwizkkgkwzrggxgxkgyizwwkkgyyirkrzxiggigzygiziykrryggwwrrrzwigygggxgizkwgrxkwxrzzxriixgrryykkkgrgriygrzrikwwkgkirigirkrikwzirkxyrrzxywzkrkiyrgxyygiyxixwwygrrkkikgikiiryxgkzrxgkikzwzzkwzggrkgkyzzxrwikizziykzxrwwkwiikxgrzwwzxkgkxkkwgzzrwkirkkkkizikyzwgyrzrgrwzwywrwrzixgxikxkriwzxxxgyzrgwxwgxziizwxzyxkkyyywyxwykzkzwxwizkgzxwyzgxgxyzyyxggzkgyrzgrwxxrgzrxwxykgrgirzxiwyyzxzzwiyxkrrirzwyrkzyrwkywiwyygirikyxwxywygkziwrxyrkkkxrgzxxrkxrryyxyyiiizgkwkkzzzrzwxixxriwkryzzwwyrirrkxrrykrgggkgrykiwgrzxwzxywgwkzxyiwwyzzrkgziriggxikxzrgygizygxgygwkzkrwkkiixrwzxrkyyzxxxgxkzwgyzkxigzkiikzxkxxixkizzwkrrxykzzxxzkgrixgxygwiyigygkwxzgwyiiwzzykkyrzggxkyriziwrywrgxiyixyxgikyzkggxxkyxkyzgzxgwgwwyxwgxrgiwrwgwxrkiyxiiykkkrzyzxzyriykgxzrzizwgrzzxkxwryrxwkzzzwkriywzgkzyzwwyixirrkrkzikywxgziikyyzkrxkxzixikxkzykxykxyyirryzkrzwyrzyixzikxxxgkrirryigzzixryxxwkrzrkwrgzixzzzgygkggrzxryiwikrkkkxkykriygzkxzwygrrzwygyrkyzzgwiyzyxgzgzrzyiyrkiyygrwywwyrxxkgxzywxkykgyryrzkxkggzrwgrxxgwkxiiwzwwxirwgzzrizkgkwgykikxirxxzywkgwzyrzrykwyxxwxiiziwizgxkwkykixwygiiwiywigixigrkyzzkxwwkgwwgxgxxiixzykgiyixkrigwrzwikrwgxkgziiiywxggkxyxkyyrxxwxikzryzgrxgrzwyyxwgiyxwrzyxkrygwyrxzrwgrixigxkyiwigyxizgywxwzyggxywrwrkxkgxwikygkyxzwkxzrgzgwyxkwizkgxwkwwrwwkigwgzgrrxygxkwixzrkkyxgxkkxzkgyirzgwrgkrziryxkgrriikyrkxgyzrrrwyzyxxiiyrwxiyryxwiigkigxxzxyzxxwrxirwyyzkxywxwygyyggwrixrgzkkikyirxzgyiyikwigwiikxkrizzkwwgrggkwrrxiyyxwywigkkywxygyxgkgyixkxkywyxiyziyrkirxzgzzziwykrigkiwyywgyizzwirwwywigrigrwrwgykwwykizywyikrwwziixwrwizgggkzxzkryrwgkxxkgzkiyzyxkxgyxwkkykkxgixyxrriiwgxggkyykxgiryrgzgwxykgyxywiigywkkiiywykkkgizywzkxkyywgriiyzwxgxiyyzyiywzzygzzigrygrgzxgiigiwgggrrgwkxirkrirxyixwyzrzgiixirxxgxzgygzgkgwkygxixkkgxryiigzizgxzkzxkwgiryiwzwkrwrgwxrigxgwwixyiyzkyxrygzkyxkkigyiigrwzyizzzxkwzkgzkygkrwgxxwriiwgykyxzrwwzzzzxigixkrgyxiyxzygizwigrywiryrirzrkxkggxyggrgzzxwrrkzrgirxrywgkrgywxyygryrrgxiwyikyiwxxzyzyxwrxxyiwwiiyggwgwrzxkxirwwyzkywrzyrkrxkkiywwwyzxizyrwzxwxyzrwgkkgiwigkrxkkwxwygirigwgykixwzikyrwgizzwrrwzrwrgrzgwzkwkkyiiiyyzykkixgzirkyzwiwkyrkkkykrgwkyxxxzrwgzziwrzwgrgywgxxizrkgirrxzzkykxzzwyggwizgkxrrwkzizwxizzgwgzziwxgrzryikzgggrzxwgiwkgigkwxygrrrkwwwzxixzriykyrwggirixwkizxxzxzzzrxirgkgzxgkkzyyrizzwrkkkrgxxgkxiriikikgkrzyyxwgxkygyykkyxryzigrrzkkxkkxizwgyikrkwgkyywgyrwirkxrkwggkwwzkikriirgrywwwrizkzyggwxxgixirxzryyrryxryyzykiyyriikwzxxzwgxyizxizkrxzikwxykgkyrikyyzyygrkyggzxwykrkiriwxzkgzzgzzzwiyzxkixgrgkwxxiwigkxzrxgzrzyrzzkkzgwzygiwxzkwykgywxigkxkiwryyikigwxkgyzkyzwwrizxrzrzikwywiwrirwrggiiizgikkxgxrirzzggggizwirxwzrggwzgrwxgyzxxyzryriwzyyryiwwxkgiwrywxygwxixigyxkyxrwyikiwygwkkkwgwxzrzwirkgyzygggzygrkzwkgzxgwwggzxzyizrzgxziggwyirkxkyxwwggrzkrkgzrziyiigzgykxkzwwrgkyxgxryzxgxxiwkxiywygwgwziygiiiwwzzxwkgwkzrxrxxiyzywryzwggxyzwikzwxkgrxiyggkxkkigkxwkrxziwzyxkrwxgyyxxwxwkigzwrykyizzkzkrzxrrxkykwryzwiygwzgiizwygykgkgkxzyyzkrzyzkgzxrxywwwiwywkkzkirgzyikxrziywyxyzriwzkzrigwyxkgiryzkzkwkyywkgyrzykwkzxikzzzwzrgrywykzxrgwygryixggrywzwgzxgiwixzriyizykwrkzrwzrwzwgxxyyrwkwgywwxiwgxkxikirkxxzzwzyziygxyiywgiwyykwgywrzzkrykyyxggkrygwxgxkwziigrkwxwyizywrrkgxrryxiziyyxyxrxgyrrziziigwwxkwyirrgyizgikikxiyyzggywykkizgzzzwxwwgwrkzgyxrwkwkrywxxwryigkiiyxwzzxzwxkizkzigrkzrrxwzyigiygxxkwrxkwrxgrkxkwyrkkyygwxgigrgxxgxrxzykgzrwkyzikxgywyggrkgzzrgkygikzrkiyyxrwrrrkywzizyixwzgwxygyxyxkwwrixkkzwrrwiwxxwrwywyxrzgkxzizrirrwyrygizwirgwkxrizrigrrgzrrxxgiwwwiyiiwxgyzkkzkygyxxwrwwiizxigkkrirxzgrzgrggikixyxwykrzizxyiwrxyrzzzrzygwzrwgxzzggykwwzrrwxzzwwywgxxgwkggrrwgzigiwgwxziwggyirzyirwgxrriiryggkikgwygrygkkkzzxrggyrygwzgyziizrywxiikxixwxyyirywigiiwyiirzwrwrxywkyrxzwigkyzwzwgrxgkgiryriykkikgizwgzkxwziwxkxigyzgkygikwkyzkyrzyyykwzgiwzziwrkkirzyzwwrzykwwxyzryyykgzrkiiwigixwixiiixwgrwizyxgiikykgxgrwxzyxixwyyiiixgikgxxiizgkwgwgykrgxkrigkwxrgzizxrwwzwrxzzygzixkxkwirirrxiyryxrxrykkyyiygkrwiyiwyiyzirwxxyzyxryyyigykwykzgkkxrgggyxiryzrkrkxwzrrywixggxwyxwyiikkzrxxrwzggizzkgwkgkgikxxrrxkyirirzzyxwkziggggwzixzkkyyzywxxgiyyiigkiwrrkzizrgxwirziwzizwkxriyiiwizxgzrrxkrwrzyrkxgzwryzxykwgzikrrzywwikkzkrgyxgxwzgrkkxkygzkgxkzwgizyrwzwygziwxwwzwyxrgwirrkrzkgkzizzryzxigrxkgzggxkrwwwyzzkyzkkzzzikirzgzgiyirxryizxxxkzwkgggiwzgywwkiwzgkywrwxgykywywggigzxyykkygxgwrrxxixigyywrgywggzggyrkxrrwxkwwyyizgxyrkrwwxxzgzzgyxzikkzyrkyzkiixrikiixzgxxxwkiikxgzzxgkrigkyyzwgrwxgwykwrwxxgxwwyiyzrrxiirxyxrwryiiixrgixrgkiiwkrwgixzzzriiizxwxggkygyyzkkwiwwwgrikkkwizkkwkxgizyxgxyzyirzzzgyzzyrzykiiwgwkyyiyrrrgxggykyirikwxrggrrxgirwxkrkwgzrzgzxzyxxzzwgwkiyrzwgxzzkywkwiwyyirwwzgwzrkxwyzzrykiygxgyxikggxxxykxwgkzxxgwwwkzrzgwrirkxwyrkxiyzwzrgzzyxrxzxwxizxxrrwzkzrrxrgkzgkgwkyrywzyxgyzrxixyzzrrxwzizzgrgziwrrzziiyxyiwzzixkyryxxxrxzixzzrgkzykkrzxzriwggygiigwiwyyrkyxxyrygzxgyikgwggwkxwrzxkrxwgikikxriiiikkxrwrkxzyiwwwizyxrkriwrkkggyrkxigykywykyyzkizxwwygwwikgyikxyrkrkrxwxxrwwkggkwwrwgrkkywzygzzkwkkyzgkixyiygwzzwgzrzkrykwgwgrrwrirywrxxrwwzrxgizzgwziyykzwikzirrzgkiiizyrrrzwkgwirwxxkiigiwxkzwigzigxxrzgzkwrwrwwkxzwzyrwiyxgykkwgkywrrggrxixwxykrxixyirxwykyzykxwzxgkxzgwrgykriwxzxiygwwrkxywxziizwzkgzrigxzxgziwxikzgrrzixyxiwkikkwgxxwiigywigyxyzrwzrxgkkywyigwwikzkzzkizxyiyrrrggxxwykiggzzxxgrgkrwzrxkwrxkxikkzgkzrzkigkyrzxiixkixgzwizwgikgrxyrirrykgwzzrygxwrwzrzrykkxxkrzxrrkzrixgrrrixkrrxzzzxyxxyrwiykwzxxzzzkrixkzrrgwkrzgiwrzxywgryykgwxgwxkigkzwzxkyryxirkyiywgyiwirwwwigzzxkrwrxwzkxrwgyxxiizxiyzzrigrgwgwwwzixrwiyigwzrgkzgwrwxirkikkzygigwyxxrgywxizkwxrywyywyxgwwgzixigykiyxgrkrrzkrwrrgzyyizxkzrwikxyyixyxgzgrgkkkgkrzwywgzkiygzwzkyixwwzwkkwkxkziggzwyzzyxzzziggrkwywwyrrizwxxgikrzxzwiwzkgixgkrxwxyrixkkgxgygygkkriggrygyrxiywxrzkkkzxxxixrgkkgziwxxzizykrxwikkzgiwygxrzgxxziizkxiygixkyxgwzkgkiwirzkigxyzkixyxkwikiwgwrzzzkkzyzxwwxyrwwikkywyyzxwwwwgrxikwrkrxkirwwwiikwzywxzkwzgrziyixwzziwwzrryxkgyriwggwzwkiwiwryiwkwyzrzigwgkxiyxwrirzzwxxxrxkgggxgixrgxixgxizgiyrgzrgkkkrzrgykwwgryykwwwwxxzxxizzkxxgkrixyrrxxxiyigiggygirxiyrikzxkzizkzwrkgiywzrkwrwgwikyrwkyzykxzrzkwzwxiyygrigwxikwrxiywgkzygwrrikwzwxgykzzxkixixyrxgwgyiggrrkyyzzzxgrirzrzzxiyrgxryrxzrxkzirzyiyiwwixwzgrxzkkxxxiiyggzzggiggigwzgixykikgyiziiwyyxkyyzgkgixzyrykwrxixkgxggiyzwrywykxkgzgxiikkkykxyzrxyxzyxxgzxwyxkyryyzxzrigzgrwwgzgyggiwkiwwxxxkkiigkgyrwxxxwyizxrxwyzixkiygzyrwxigrwyyzrixxwxyywxxgrizkxxkiygiirgiggyxyizxxxkrzwgxwgzywrzxxzixwgyrxkrrxiggzggzigwriikgwxzigrwwgixyigxwxrzkkygkrkkwzzrkkkgwgrzgziwzgigyzwyzzrwxzrwziwwyxkykxykygrkikiwkkrrgxgkzxzxrkygkixxrzgkikwwiwrryzixzgikirzyzxzxxxgkkryiwwkxzikkigigrgzywrkxwkrkzrygwzrrwkzyykrykrgwxxwiwgwwgikxwrrrzyrgirzxrgiirrrryizzzzkkxzxxkgrzgxywzykiiiizggxkzgirykziyzkrkxzwixxgxrwwxxgrrzkyzwggrzzgyirywwyigzygkikzirkgkrkzzigrixkxxriyixigzkrwyzzrrkgrwiyyxzyzgxwrrzzrxrxxwzggkzigxrwyyyxkrigizxrywxkxkkygrgzgxirkyxwiryzrirxykziyyrixzkkirrywzrkxzixyzyxkxykkrkigkrwkkrwwrririygxzggkkiyyirwrgzgzxgygxyrzrxxkwrwrykykggkzrwgwxgriiyxgzkwrwzyzikwygwrwyiwxxikxgrxxkkiwizkgzrkwiwxywwggzyriyigxrrkiryyrwyykgiwwykgrykigzxwwzkirwxrirxikwxxyiyrxggyykxzkyykzzxiyyzyyrgxyiyiyrywzizryxwwxxzykywgzrrxikgxiyiygyzwyxggriyzyrkyrgzkgyiiiiyizggzziwxkiwiykgiriywwkxgzwzxxxwyriiriwgxgrizxrggyxrzgzxwigyyzkxixxyrxkwzrgwkkrxryikigrzwxxzkzyrxriyyiwzxzykzxrzygrkgkywgiywkgwkxzkygiiyyiyxigwrgyxrggwxriyxgyrkwwgixyzykyxwxwzzxyzxzgkkxxxwkxxrzzxrkigikkgygrxxwrzwxkgikzgzrkyywryzkiwrxrkxzkwgwyzxzggikzwyzgywzgxgxxxzrkigxyxxrxzrggriygyzzrxyzkgrriiggxgxyiiykkxrgwkkxykikzgxrykrxzkrwyiikzkwrgrrzrixzxyriikgkyzgkggkigrrkrgxzgixxrykgkwzwzzxgggykyxgrzyixxgrzigizzkixgrxyrgzwzikxyxykizyrrgwkkzggwyzwrgrxxzkkirzgkxkryixxzgwwwkkgwwzizgrwrkzyyxxygryiwiywwkrkxgwixgirwggzzgxxwyxrrwgiwizwzixzzxwzzxriirziiygiwzxrizgrzykgrxwzyxkwyyzwgwkxzygyyzzzwrgkwgzrgwxrkxxykygxyzzxkyxzwzryizygwwgxkxgwrgwygxrxggxwrxirwxzigkwwzyrwxirrkkykkgkziixzwggkyrxxygywwwrkykgiyigwykrxwrxwgwwxwigygxrgwggxgrywzggrizxyixzyxyirwggkiykryyzgzrwgxigwyrwrgzkyrkigxixwwykxiikyirxrwrykkzyrgizkyywwiririxgriizrxkrxkykyrkgxrigwyirizxgwggyrxiyriwkkizyxwgrgyirrgkzrgywkgwkzzzxziykrrigixxrxzzrizgrkyzzyryzyyyyyyrrzgwrxyyxkxxxwzgwrxyzxyrxirriiwzyykirygxikikzxggwikxiizyxygirywkkixzxrzxgxiyrgykwirgkygwyzrgzyyxzyxxikzrkrykiyywrrkwyziririixkiyxzrkgxxiixwxzrryywzykrigrkwkgwizxryywrixikwzygyrkrikirygigigggxiykykigiwkkywzixziizxzywgykgxykzzixrxiwyxgxwwwikkziriigwrxrxywryyrryzwiwzigwwxkggzggkkxywxzgxxzrgigyirrwwxyywwigyirkrxkwzzzigkyxwyirwykykrrwzzwizkxyrwkwrkkwkiwgyxixwrrirkrixyxkzykzryxyzyizzizwkyrxiwiikrzxkzxwyrkxkxrirrwrgwikxzwkzwixwxyzyiixxkywixxixkyrirgwzkkggwriziizkryzrwxkxykxzwxwrzgyiyzrwrkzgxyrgzzyikziwikzikixxgzzwgzixyrgwkyxyxgkggxrxgxyixzxzkxywkkwwkiyxwkgirgrizxriwgrziiriwzkikiwgiwxikwwirzkrgwwrzyxyxxyiwrrzrkxxzgkkrgrigxyxwwggzrggrxyzrrwxyyzzzrrgywwzzzzyirgxzriwrigyyzxkwyxzixkxkkyxkrxzwwkxwzkyrzzgkxyyykwzrkzxzyzrzrizkkgggywwxwzwizgkxiryzrigyyyzxzwyxygrwixgiygxzgiggkwggyzrxwkrxxzgwxkwzxyzxyzwzgiyxzxwkxriyyrzxzrkyigyxyxikkygizyiyiyywigyiiwwzgrzxygkykwwwirykykikrxkkxrkggxrkxwrxzwyzwkwwkyzyikiykixgyyxwgygzigyygrikriikixirxizggwzikzizzgggzxwigrkywgyxikiwyrxrkzwgwykyxzrrwkrgzzgrkxgwggzwwrrrkrkkgwgyyikryxgixwgwyrwyrrxkiizgyrkwwkgiryigzxxyywgwyyxgxirgkrrzxwkwkigrrwxzrkgyrxrkizwgrkizirzrigirzrrzykkrkxryrzwgyxrxgwgrwiwixxyyygkxgzyigxwiyyzizixzixzwgrryykrkwkzrykwykkzrxkgggizkzzkigkgykxizzxgrrkrykgrzyrikryzzkxgiyzgzwxgyixigrigzzgzxrkrwywzxzwxkgwgwgryxxkrzykxwywkggyykgwygirxxxwrgkxwzgxyrxkxgirxgzzzgyyggxwxwwywwrxkwzxiizigwykyxyywykwwygxgyiiyzzkrgykwygkrzzyzzikwrkwyizykgrzkyzgrwzxwxxkwygizrxriixykxxgzgwryykgkzgxwyizyyrzzixwzzgixkyigxkxwiiwizgkiizwkiygxywgxzxiiirwizzgrrwryzzgyrwixrgxryixrikxwirzrryixzykrwyrrizxizxgizkrzkkzkwykxiwkyxyzzgziixzzkgkixwiyryyzrggrzyziyrwwrigkrgryrrkkwgwzyrgrkzxiixwgxrzixyxwzxkkgrxirwxgiwyxwgkrixyxggwgzxiywyxgrgrgyygzkwrgzkkgzzygwzyyixzikwrrkyxxzxyirwgwgkywykwiykyxwywzrxrzwkkriygxrrzkikgggyzirzwwiwyrrkiiyzkzizxikyywggygwgwzyxikzgzxrizzrxxizkwiirixzzrwxrykwxwwxwrrwikrzgryxywxyiyzwrrgwryrrxzxrikzzwigkxxwrrrirzyxrwzgrgwwgzzyizgwgrwrxzkkikwziikwriywyyigxrkggiwzwzxyykrigkrgrwwkriirzkkgxzwizkkrgrxzzyyrzrzzyggwrwxrizzkgxrwwyygzwixigxrkxzyiiwgwgxzzxixkrwzrkxkwwywzrzigikrwxkxziwkzxrxzgwkgiiykwzwyrgrxxixkryrgxiwxykrgxxrgzyyrrgzggxrxrwgkryzirrxrixxiigwrzzgrygrwzwwxryiwgizrrizzrkxrgzgkwrikkzryrirgrykzyyxygwygzrrywggigkiiixwwikrkxwwxwziiyxkzxzxizxkxixyyyzggyiiziixwygwwwggkgyxwzwgkxrwryggzywrggwzxgrykyzrrgikwiwxxggwzzgwizxkikyywrywwrgzgyygwkrkirwzkkigwwgzrizkrggwiryixwzrzxwxkgwwxyygwgzwxikrxxyzzrkzgxrixkkggzgkyriwiwgizkwwyikwggwkrkrkriykgkkziwxryzxxigrxyxkwwzggwixwzzyggzrwiiyrgykziiiyykxzxrkkziryrzwrgxiwzwwiwywyzxwgxwgwiwrxrwgzywzikgiyyrikxigkyrgirwxwkziyzrwyigikixrigykkwrkggrriikkxgzigkzikkixkxzkikriygzgrwgxyxgkixirixgrgkyxywkgxyiwiygizyyrkwiyzxrwiykkrkgiigywzkzgzzriiwwgkgxggxyryzwrzkgyzzgwyxzggzrrzgxiiyryxrrzwzwiiixigwrgkiwyxzgwkyrzrzkrxwwzwzriyyixxkrrgwgggyyrrikwrirgwzirzxyrkrrxgkgxrkixigkikirzwixzrrwwkrkwrziiikzkzkxwkkzixigiriiykzrrkiirwryzkwkrwwriwzxryzzgryxiykyizxyixyywizzziirrgrgkgyrgwgkyzgkiwiyixiyygxyygygwyyxririyrwwyyxigwrigrwiyxwxixrykgizwiizgrxwkkyzryxkkywrkgxyxrzkyikkwygyyiwrwryzxwzygzwiwziiyzryywrygwiikkgygwxikizrwxiyrirrkiygwzrgrwkkkwykwxgrrxzwkzygiygiwzigzkrrxzgxxyzzkywzyzywyigxwwxygkwgirkrrkxkriixygygxyxwgxwygkyxkrkyxwzgrkyixzzxyzrkirkrzixwrixxrwwwxgxzzzyzwgyyiiykxxzzgiixyrgzzgwxigwrykgiwyxiyywrygrrxxrkrrkkyxzkzkxiikrkgxkrzwrxkizwwzgigwzywkgwixiyyzixrwzigwgiwwwiizxiigrrzxwwxxkyzwxwxkryrzgxgirikgywigzwwyxkxrgzrwizkwyxykgkkggkiyxrkwkwxrwxwxgwkxgxkxwygkrwryxgwygyiggkxyrizxggxzyxxyrzyzwkzggixkkrwgxxiyxxwkgwrzizgxgkkkzryiryxgzwywyiyrygyxkzgrwwyig\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 431,
        "task_id": 4108,
        "test_case_id": 12,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "jlvvuqusmgjjsquvvvlgljvguuddlsqmdmmvuvvudmqqqsuqlgudlgggslqslgdmdjddumsmmsulqvqsvdmgqsgvllgvgududddmqgdqgqmumuqdmsdqlgvqjdmvljugjdsqjgqqdslvggldqsvslgljjqmdvqduuqqulljqmmumqmvjlmuvvsjgvusjlulujugqqlljmjggsdvdlgldlljmlvuuvgguqqlmlqsujjjsgmumlddjmdjmuqvsmsgjgmgllsdgggmgvmvvsjjsqmmlssmqmgllmdddlgvqqvvvlguvdlggsuvsvdmgjsdmljsmqgglmluqgvgjusqdmvlsgvlugljsdqldjlumlglmsvsugmdlmqqgjlqsqvgudvjdgdsqsqmjjumsvqdmmgqldsgljvgmmvjugumslgldvsmvdqqsgjmqqlvujvdqullddummgqugjgugdsvjuquddjqllqudjjjudjlldvjvjqqvlummsqumggumgsmqmjduqlmgqusvmglglsqvgugjvsqmgjmuvvggujdgmsqumumldmvjqjgvjuqusqvsguugsuljumgdqqmdqjsjugvulgsvsdssslqmsmgmsumsqjglmsdlqsuqmvdusussgusggugqvqvjsjqmqvussqmlsldmgmvulddqmmljdjgsjlmduumsvlmvsuusjmuqvqdsglddsmqsusdjjqlgssulgmduvvqmdjuqquuuqldssssjqjjuqsgdqgvjjqmgjvmmsvssllmqujsqqlqmgsgqgldmmuqusgdudmmvsmqsmgqvgvmddjumgmggmqsgqvlvdquuqgqqjvsvqusqljjlvljvgvujsmlmlulsqmvqugjvvldmuulqllvsglqmslmslmdsjjlgsvglmlgmussmlssqljsdumsjjusgguvvjsljsgsmvsujuudqumqdlsmgglmvuvqljvlvqsjulqjdslvljgsdvsdqvjgggludduuquvdqgmjulsujqsgugqqlmmgqjlqquqququuuvgqqjludujdsqvldsvddmlgqvvduvvuvgussgjlugmuqglgdddljlmdvvvgldjvdvsgddvusmqjvvgjjmsdlgvgluusgluvqmgqmsjlsggjlsmvdvsmujsgmguqusjlmqjmlqsvjdjsjvlmsgdjdmvjljjgmsvjqulmgqjlqjjgsuvmqdsglljjuqgqvsjqsvllvgvvmvgluljvsvqlgduvsjdvmgjuujgdummddqjqsujjjuulgvulqjdqmlvssulmummldlmsjjsdgjqsvgdjmvdvquljjmdsljdsldqmvlljlgvlvsdjsmlsjjvmuvvvgudjuqdmudvumdqusmjmujussvgqsmsvgjsmldgduvulssssjqjsuusmvlqsgljjmsjuggdvugslvjlvjggmjqsdvmqujggsmsqlmdsulqljuvdlvjglsddqmuummvjgsmjvmjvsvdmqulmjsjljglmgvudjdsmqlmgdllddjujdmluqdlsddglusglgumjssjjjsqjqjlggqmujgvsdqvjljsqdgjjlusjjgmuqldggjlgmllglguqsuumvsgdjssmdvgsqqjlgummdlsvlvjmjldgmjqmljuqsgvsvjvqmvsjgumusdlmjluqjmdqsldqvvjvlgulssuvqulummqdlulvjqmllvmmldmmgqvslmqlssmdddludmmgdvvujsmuvqquuqjgqggsuumvdjlmjgmgvuvsdqjuuvlvmmqudmvvqgssjqvjdjguluumumsgljlqjqllmvgmddsvgdlqljusuldmjmuqjddqvumgmssmlvuuuuddldgjdddssvqgqsqldsdqddllsjdqjqsjjdvlvdslglqsvjvvvqmlmgllmdslljssgdqsjgsgvvvuvssssmddlvqqmssqsmluvvumdsgsjgmgmjvsuljjjdqqjvjlvssulmjuddumslldqqjmvumsdgjjjvguvllqlulqqmssjlmmmvmgujgvlludslmgqddvmlgmqvqggldujugjmuqlvgllqqlvsvdmqmvsvvudsjdjslvmgjqgvudlsmqqdmjdudddjmgljdsmggugmgjusggudulsldmqmjvdguquqjjjsjujjljudgqujgmlldddguuquvmgvqujlsmusvdvqmmmsmlqvmlsgsmdjldvldvssgslusdsjvjmdlqvdsglqsmglsuluvsmslvdvvssdulsddqljlmvjqddvvvjjulsuddmvqdusvmvqsgqdlmsullgjmvmuqggsqqmmqqvgdjjudmdggjlqqmjusmjlgqslvqssssmvdlqsqvmdvdgvsmdlldvgqujmduqddgugsjsqjvsugmlsmvjlmuqgssqqjqqulvjjjuqmdmvjgslvdsvudgujjggldmjjuugsmjlddgdjqdqjgqsdsvjgvjdsuqglquvjvqlqsddlmmqgmmqsvgmvjmvvlsmmsvmqqmgmuuuduquqvudmvjgdmglqmuudsqglgjdjuljuddmumdmmjlmgjlslmmugqdssgqgssjgljddjsusggjmgsddmqssmdmvvugsudmdgudqlgqjqldglmvlvmmvmssgvqgqjjllddgllvlgdquqgvvdvgdmumjmdgjvjlmjmvvlgljqjguljggqljjmgvgsumvqmlmqsuqdsvvlmuqmldgjjsdvsdsvslqmsqqmjugllsulgjldlmdvdqjjuqlsmqusmvjgqvussdgvdmsgqddslmqvmvssglvqgqsqglsvsugsllqmqqssjsqsglqvqquvqlgsljqglsjjljgjlmdmvmmgsvjgdqgmumqdddsjmdvqvludsjllglmqlmjddjdduddmmjvsumggmqudlljjjlmmvjgdvlgvmgdqmslggssgdqdvdjgudlduguqqlgqdsvmmqmqlgsssgmugduvsslmjvqdmdggsgdsmggldumgguqmjqqjjdsjquqgvvusjsvvqlsujusquvqjuussdlljguvvqlddgmvuqvgldljsmlldlqulljgqldlduguqlglljgdsjgjvlvddsumgdmgggugqljluudsmldsmqjvgqvquvlvjjqugjmgqqssvlmjvqsdljvlmljdmjguuudvsjuuqjssdqqljmlddqglumljmqujjvgudjdsjuqjslujvlqmlujmjugmlmjgujqqvjdvqjgddsqglmljssjsldlsjqvdsllgdlugmsssugugmjlmddlljqvjslvsjujqmvsqmulldqvlqvjgvdqvjdslmdllssjlsvdlvqsmsmmsqdsdmsmmqdmmumusmvsvsvjvsgdvsusjjvuuvmqvsvslujuvgujvvusssqqjlmgduquvmujjdjmjusssdslsmsqsdljjsmluvlgluddjmduusmssuguglggjdsvmdqqlgjqgdvuuqdggguvmduujjgvlddmgdmjldlssjujmggssslgdsuqsqqsggllggmmjvqsjuvmllgsjvgljuvqddumqugdvqmdgsgqgmvqvssjdjvdqdqmqqglqqlmumvsjjvjduvvdglssgdvlmdllqmjvmsjdjsmgduuglluqsmugmlsqusddujjjjsdujsmllgsujvlmvvdllsvmlggqslsqsdlglsvsvdmdguvjvjulslggmllqdvvlsqslsddldmvlvdvjqvvjqdsusvlljuqlqjlsjvdggmssudmlvlggsdqjmggumggdqdugmjjqgvglvvgduvgjlvvjvvlvvvlvlvdjjgsvmgguggddsqmlluqudgjvluqvsvmvsqqvmusqgdmmsmlujlqggqudjduqsmljqlgsldlsssjvvdqgqsvgvuqvvdgsqjjujglmjjdqdgvqmlssmqsssvvjmsssddlsmglmquuqsqmsmmsvusjjmgjmdgljguudvlsslgvmsjlgdljjvmmdqdjdvdqvjdsduusdqvudgquglsgjdvgudvjvsguqssqgdumsdvqulqllsvsmldqduqjdlsdlljudjusuuqllggdsqvvjqqlgqqgquummmvsusjuumllvsglvlgqqqsdgdvgvgqsuvvjddmsmuvjqvdqjsjvvqssdgumlldsgjqglvguumvqsqglgdggmugdvsjddumvjjvqsusvqvgmqumdulugsqllqjulvlvvgdvjvlulllsvjsggvmjsqqqljlllmsljsdvjdqslllusqjljjsuduqdudjqvjuuqdqgjdsgqujgqjsvqgvsgqqlvmddvvuljqvgqdugslssmuuuqlvsjggjmdlqgdjqsmljgvdvvqlgmlugdqjuluddujggjqlsvmmgdsgggjvsdsqqmuqujjlmusgvsqmjssvjlggqjjgujluvsuumgdsjduldvmljuggqummgsqsgjqvsjjjujudvujvqqumglvgulmqjjggdllumsmsuqvqsmsdjggggdsvlluvvqqjsqmvumgvqdmsslqjqlslmjuvmdvvudqdljlqvjumlvgqglddllluqlsjgdqllgumgjjmmgsvvumgljjgqmgjsvsdlslvllgvvujuldvgmsqqsdjmvmvsuvlmsulsgummjjlqqlgsvsvsjgmvmulqssdglljvdmsmjlvgdmddvjgvgsujgggmlgjdsgjumqglusmdmsusmjdvgvvmsvgmugqqvgdljjvllqggjdsvdlqdjdvvqqmvjqguvdguvvlgugjdjsdjvuvgvqlvqulvluvvludvmsqjlqjgmgglglgsjllvgqgmmlsvquvugvsljduvgsqqjmgvvmldlsgjudmjglgvjdvmqljlqlmdldjmgdjduqvmgqjllmllqjlgqsgjjmulljlvvqdlvvdlvqqddldsluslqvuggqdsgvgsujlvqjmjmqlmjvqjgvullsdmdumsdlvjlquqlusqglugmqdmjdmlvgdgqgldvddslsgmgdjgdudqgjdgggdvuuugdugsmvdqulsgvdmmqquqqmvvddvdqsjmvvsqmldlqljusvqgmjgjjvgvvumlslqslujgmslmlljgdquvuqdudslujvvlvmdmdggsldggumdqdvjqvsmduqquddvgvsdjusmjgdgggjmulsgujlgvldqvvuvmumlggdvvlvmsmduvdldsdvuumqlmjqlmddgvsdqlvsgvvdvdsgqmqlgdmllvmjgdqvuqjlsqlqusqdquugqqjjjsqluqjujlqjgdsvmqsdvqquqjlsjgvmlggmmvsglluugusqdmjdjgqsvmuljujmjmvjqqulsjvjdgqgqlgqmdlmlmvlgqqgdsudlssqvddusqumquduglguumdujvqujmdvgqllumssqdglvmgsjuggqvgmllvvvllvqvlqsljudgsgjvmvvuvvvgugugsdlvqmljqgmumslsjsgdqmjgqdvmvdguvusulsgvusgdmujjvsulmlulvgsgmqlglmgsmugjgdjsqjquvgmjqgujsulmuquugjulumvgmmllmudmgvussumgqqggummdddqglsmsmsmusddguqmjmqjlvjvlglvggusdvjquqqujdqvjmqdqdvdjlulvglqvvdjvdddmmsqusssjdqlgjqluqqmvvdljglmmmulgljuujqqsjgvjvsdggvugququmdlmglqlldmjvdslugvjvujvvuuvmsvjssqjsvlmlmsmjdmgglquujjsgmmllgsdmjdqmjjsjmumjqvgjmsuujljjjulqldjdmqlggquvjldlgdqvugujjvgjdvgjqllsdjgmqvuquumuldlmsgqgdudvmlmqlvglmdvssusgsvjmqlgmljvdvjjsjgddjgljssjjujlsvslsgqdqlqqlmuvlsddmgsqqsjvgvvqdgsmujjdjgmvjvggqsqudluvjdjlgsmqljuldgqlsqgmqmumsgsslujduvmggdmumuuvldgsssdgvjdvdggdljusgmdjgjqlslmjsvqljujgmlsvllgvqvsqgmvlvvmgmmguulsgjlvsugvldvmlluugjqlgvdssgmmsdsjmmgsjjvmlduvdgsqujdqssqvqqgmdggvqmuvmusmqlgvjslslsgljjsjmgmsjjlslmqguqglvqlvvvsgmlmssluslmjjlljjjjquugqllvqmsvmsmgummsvudugdmdglujdjdvqdjljjgsjjdvumslglldquumjglujudjqugdqljqvjmulmqdgvvsjjljsqglgsmllmlmvmsjsuquqglsuuljmvdugldjssdujdvduqlgugllduudjqljjjdgjjvlqjqslgmsusggqdmumqvjjgdusgjlddqglmsujsdgvvmgmdjumjqgldjqjdmggljsmjmvsmlsqljlvmldvdsqllmsssggvjlglmjvljdgvvqlgjljdlvdddmjgdgdmsmvldvgssldmudldvqqvmjuugmdgqmjmvgjmuldjqmmsuugmquqsludlusgqvlqgglvdvmljjjlvugsdsdqjjqujvgsjdldmqjjggdgjvlujgqlduvujjljsjvgluduldglvsuluddjlgsqdluvslsdvsjulgslsqglvlvvvjlsugvlusljdgjuvqmgmmqmuuvgujjguqjumguqvqldjqussssdjjsgqdglddlvgmdqqsudlsjuluvqvjssludqllvdqdlsgljvgumvlsmgqlvglgvdsudsqggqgjjguqmmgumsujgsddgqvdujjgljqqlsmvsdgvvjqmsjvlsjqmslljmqgjdgdmlujjummlqqqujdmsmgjmjqvumquldsmvsgqjmvlusvsjlsgvjdvldddugujsssulsvquvdjdsllqjuvjguvmmdsslsldgdusmddvuudvqjlvdgjugqdqjlvvvlmmudsdljsgmguvlgdqgqumvdjmqmvggqvqsllsjgvlqqglummjvdudmjqlgglsumglllvjjuuqqqslvlgsgumgmgmddmmuudvmgvqdvmmlmssdjgjguldlslqmlmguqsjsdsuslgudllsggldugudllujmslggjjldjmlduvvdsljsgjqmuquldqsglgljmmsmddjdvsllsgsdgqqmuvquudqjsmumsguvgvulmqmqdgsuqsqssjlmdllluuguldqqmjdlvdsqudslggvqqslllslsjgsgsgmslqjuuqgmgmsusjlsjmddmmvsvjgldgujqsmusglsmvquqvqdmgmsuuqjmludgmmsqvlglguljljudjlmvddsvgqvuvjdvdjmuuggvjjgqjdgvgsuqusdjjsvgsmldqgdgjqsuujggqmusvgqgudguuumgluqdgvjmslsulqsvqlsdsmuvjqvuusmgjgmglsmqmldjqmjqjvdvqjusddlqsqgjjudsjqqgmqsjdumdsuluguumqjumgdumlgljussmdmsgummlmjgvqqsuljujdsusqgdvgjmluqsdjmdlussquldsgmvsljllgdumddqdgmmuqvmugmduqsljujgsdussgqqluqsjddmmlqluguumvmugvdjuvguqddmdguqdmluqmslssvgluqjvgujugjqlsjgmlguvmmvgggmmjjsdqsugumqqvluggddmvslsgdlmuqlvlqguddduumvmuqjjqjjgqsqlsgvgldsvlvssllvlqudvgdggjjdmgqlumjdjvslvlllslujjjsdlggjvqujdljvdljvgvvmlqulqvlgsjdmgqmjqluvdvsqjvjusuvgvqdmssqljvuugjluvuqvjvmqvjvsujjjsgvqlgjmlmdmlsqjjvmlslvggvlqjglqdsmguljgjlmvddlqgslvllqvqlslsdvqqjdqdvlsjgmqdvvusvqvlsdvdmgqujdudssvqssvsmlluslgjgsdsujsjjvlvsvvljgmgddjlqdsqumgddgggmmuqqvmqqjmsjljusuvlljvljljgqddgvjjgmsggqdussdjuvvmglsjmsqvgqqlmlmmmulmgmjqsqldjvmvgqmudmvjuvssvmljvujsjljqldjsddmumsqqvmlsqmjvjjdvjqldqusmllvvuuvujjjvsjlqgmqqddljjljuvgjgqjmldquqqqvvsjjsvuvsvvjsugquqmvjmjujuuqdgmmmjgssvsuujvgmqjsssujdgussdugulmdslgdumdsdsusjslvqlqdsgjvmjjjglvmgsmdljgvdvujdqlusqssullsqmlgqqgldvvmsmugvjlslssvgmmqmsgssqqjdsjqsvdvdvdquullqqmdvqjgsqsqsjvmlqugdvqsqmuvljjvdlvmudvmlvjllvgqmsvdjllujuldudsdmgmvlllljgqusjsuusuumjsmgujvvgljuqggmjglsvdquqdjljljqjvjmggvvsgmgqvddjmddvmlqdjgjjjsmvvqqqdulddjljqqldsmmqlusgumdjmvvdglgvglqdqugjdldgssjsuvqvvvgdqvvmvjvdqmslgjuvldqvsvvvsuumvsuqmjdvsuujmqujmsldqjqulmvvqsquvumljmmqvvuvuvgmuvgluuvsgulvqqulqgdjgljgsssjmusmvjjsjdqmjugsjggljqqmsdgqqmuusudsqlluvmgsjjgmgqjlqjlmvjgjvsumlmvssusjugujuqvlqgdmulgdlgvvuqdvmlldvssuudlvuvmsdlllvlsdlguuussvddqsjussmgvqlvlulmqsvgjudgglsmmmdsvdlmjdlqvlljmgdqllgdljdsgumvgvljjjmvgjgglsduqmmusvmgjjdsvjvsjljlqqulmdugquluujdsqumsqjlvlmdujgsvgmvjjmdulvmqjjmmlsdsgumgmqusmldvldsqvjsgmvjjgsjuldqmqqssglqgdljdjvmjqsjlgvsgulqdmvqdldjmggjsjmjdqmlsssljdudmdvmdvlvsvmvgmvvglqdglmqusjgsuqduglvjvqjjljjmdlvlsjuqlmmdmjsjvgvjusmdmvgjlujuljjgjdqgvddsvuddudgulgusuljmjussmsdjujmqljgvldlvjvmsqvdqlvmddvgugsvmvvgddguluvvqlduugmdslmvmmdsmuumusgdvdsljdulgglmdqmvmqdsmsggmgljdjggqdjlqvdduggdgjsggluljjgdldlugddsvvusuglgmgslslgmlsqqqvmdjugqguvvluuvglljjmdqjmvslggmummdjjusqqggvuvjsvjddmvssmqsjgsjlvdqvqlllvlqslvullvqqvmgvdqqldjguljsdlmlssvsmmluvqgumgvdldldvvjdgmuqdqljglqvjvujgglqqvvddjjmusussusduvsjujmqugugqdsvdsqmsumgjlvddmmqvgumdlugquuqlqjugddduvummjlgjvlmudvqqljqdduvlgqvgdudusdgvqljmqdgumqgdvlqssjvvsmsvsuqjuqddgqmsuqgjjdlusgjulgdqdqvduljjlljlqgdvmqgmquvvusgvmusugdumqululsummjdggdvsljlusqqmujlsqldqdqqgmussjqlmmslvdssjvvmmmdljulqsljllgdmuujqgsuvjjvuuddqvlggvdssggqjsujjsdussgsvlsdsssjsgggjjlmddvjqqgmjjujsdujldqmjmmlvdldqvdumqgmjuqjljlgglumdsmlgjqdmmvvdqmqvsvvmlulvvvlqllqvjlmulsugdssgslsdslmqvdsssulmsqgulusluslqdlmvsmlmsvmldvqsqjdusmmmsqsvgdmluvujmjqlqgvljdqqlmgjmsmmvqqgujjqgmjvuumldqqujsdvssuvmqgssslludddlduvqgvqvqsmvgmdqmglvqvldqqlvjldvmsggsujvsjsjssudjulgmvqsqujlljlvsglvqglslsujvuvdglmlvmgddlgqmdvqjmdsvjmusgdqugvqmdqvggjmsqqvsggvgsumsdugsdvvuvsvsqljuujvqlsggjqvdddqjjlsvmmqmqmllsdgjlvjlmmjsuqvjjmsgduqumqlgugjdvlduddqsdugjqgmgsugmjsluuldsdqqusdmlsjgjjqgjgjsdjsdqllgldjqjsgujgmdmqqquqlmqjglglsvlqluqvulvglqqjjgqsujujdvqqdslsdlvmmugjsdlluqjssqmvmjmlvvqjsudsvlulvlmsvgvldqgslguuvvdldgduuuqguqlsdqdumsququqsjvllsjsusgsvsuvjgsuquvjqdujdsmlmsjumdjuvqvgdglmudlmlqmjvqmumllsgvgqvsgjgsqlvdmgsugsdqsmmgqvvuvvjdluvsdsdsludgluugulugvdmdllvqvldlumvjjguuvvugjqmvujvldmvvumlsdgvugjdmmdldqjvqvjvugqugjudqjjmsudmsjjsddmmuggdqujdsluguvlqmlmjmuuqumssdvlvmmjsduvlmdvmsugvmqsjmgduujlquldsmdqlmuqulmmslsjmduqlmusqqqqggdumudgsvuguugggqdvuvgjldqgdvslmqmsgqlllugujuvjdsdgsdgvsdvljlvvvvjmsvduvqdvsqsuvusjmqugjsjmqgvmjssvqluldqqmdmgjsjgvudmllumjuujjduvsmggqsqjmsgmdsvqjmvgvdujsulsslsljvmllmqdmgdusjdslgjlmvgdqljjjgsjglgjljjddqmmdvdvqqmmdgsglssvqqmqgsmuvgjjgsquvudqjlllmgvlssdqqgvvlqjjqudsqdjsqlqddmlmqjjdmdggqldqujuvjlqvgmgqvgllmmsgjjmddmqjljusdssmuuqumqmlumvlguldjvsgsjjljqlldgjqjdgqdmjddvjjmmsugmgmgmddjlljudqgqdjumvssmusggjvdvjlsjddsmvsludqsuglslmqvddmvqvdsgjvlgmgjmjqjgjuqvglduujjjlvjusjjjudqlqvjlgusmgjvugmdlmmgglugggvmvudmvsgjljgdmuulqsmmsgdjjuvsgvvjjdgjvdsqslqvddjuqsugvjlgudqdvggvqmsmgmljdljulumqdljsdsljmvlmusqvgsguddmdsljvssvsvljmdjusddvmldvddssmsdsssjqsddusssjsjgvlmdumdjsugmvggjvmmdquggdvvssvuqgmuqlumglqdqqvlsldqqssvgudgqumvjqdsgssqsvlgmsmdvgqjjsqjsmqqudqdqvdddgjqdqdgqvjgvdsvdqdvjjldujuvmsvlvvulslvvdmuvqdmdjvmjvmgumjquqsvjsjlvljgjuduvgmuuqmdqulqujsqsdqmugqsvvljsumssmsuqvvudvjmjsjduqsljqlmuvgdqvqvlvjsjmslgqqsqvdldjmvvdgjglmsvvudmssujjvglgguvssddgsgjmdulmlsgjugqmusvdmgdgsdsduujugdusljdsumsmjugvsgusdqggqvmjldsljmdmvgmmdjmgjlgsjsjmqqvusldgqqsgdsudggqqjlmggvvljsdgujvmugmddgmumdldddlqljsmsvmsuugjgumdlluvdmjgvdgmlvdlvduqdjusqsjmvsgqdsmdjdqsludjldgsvssdgdgsvlvqdmqujmjuljdsggdmdlmguggdjduvuvsvqgsuvdsmjusgvmggldusjmdjlguvvdqvjmsugluumjjqlmsmslqqqgmdjlummslususulldsgsslguumvljulumvsusqdqlqusujdqudguqlsumjujdllgudmsvllmjjgvmgglvgjquvgvuvuqjdvssgulugjddvsgqvgllussqmlqmjmujlgjvqggjvddqjvvlsqvjlqqqvqdqqqguljmllqumldgqvvvvusjljlsjgqgmmsqlqdjqssvmjslulvsdsjgsjvjlvjsgjdqdvsuqusuvgmqsvdlulglugvvlsqmqgqjsjvvmuvlulugusqmssqgsdmsdmlmglmlqjjgdlusdjmmqmmssgvsvgglquljmmlgdqmvguglglvuqlgqsmvqsvgmqqqmqjjsjvgjjmvvdglgssmugsqmmlmmjdgquuumvuusmquvuqlsujvjdjgslmsdqmudsjgddgjjmuvvljgmgqgjlmuvqjgqvjsgdldvlqvqdudlmdvggmvggduquddusgqmqumsddjmqgusvqdjsjsdqvqsjuvlqdjgqdsgjgvqulqjqsgjllgjmsmdjlgsdsqjlqmqlsdsdsvmdqvsldsudsdglmqmgqlgdsldvsmgljsudqqlummvmmjmmmgggsumjvsduvsvlqugqqsvldqlmgslllslgsjuqqqvvvdsvusmuugmmvljlmmqljqlmudqgsmqljjusqgumlggjgdmgjglsvmsqgmlugsvvvglgmlmsjludmvjmvduqsvsmgmjvvugvmmsggmgususulguuqqssujugjdsugvmdudljjdmsvvdvsdgugglgjvqdvjusdugqudjjvgdmqgsdjjvdjsvuqvjjvvjuvlmqgsqgjjmqdjgmjsqmjjqssdsmlgsjqvmqdmumjvdvvdsmsvuvsjussujjgdllgjmjvgquljlqdsqgmmdsusjdlqgsssvdlgmmjuquguslqvjdvvjssdquuugluumgqgqglusqjljvqdlssdujqmmqmvslludmuljmvjjvvuduqssdjudljjmdqggmmjdjvdjsjsdusjgdsqmlllsqsllqldvqggjsjdljvvuqgduussvjgjuugjmgdsmuggugqdjsuqujdqllljljdglusjvggmvjlgssljqluvddluuqqjvgdmulqmjvqqvmmssqudvqusmsvmlgvvmglqlujvugsgvlvmgdqlmsuggjlmmudjqsjsqjjmsvllmqvvsuvlgqqgujsjlvuddsvvvvdlgjsmqqldgmslvmvlmvlqvjuvqdssdljqdglgsvddvqgsuluujvdlvjquuslsqqvmuljgglssjjvdllsgqudujuumvvmmjvlsvvjmgmjqmvdumvusjsvjlusdgjmjudsvjlgmmgdlmjjjjlqdsdmdlgmldqugusqsvvlgvdjmmqmdgqsdvdljjvdsjqgqqugsmgglvsqvjjmdmsgqgqsjjmvvljgmgujssglvqjlllsgmjvvjjlllmgmgmsvgsjvsjlmdvdvqgumqqdqdsqllgmuvsluqsdvdjdgsgujvggqlsmdmdvdqssmldjdgslmjgqvgqgmjvmsuumqjqvsvuvgsmssdjmjvuudjjdvuvdvjlqmglmdvvvqqsmqjuldsqqdsljjsjgqjussluqsqvvuvmmuqsssjgmjggumlmsjlqmjmlqdglvlguvjjsjuqqqusjmqususqdgsdsvqqdqgvjmllmmqjjmdjgvlguqsmssvdgudjjvsmlsugvjvjdmdjjuuujsddjulsdmsquvjqlvsldsqvvusjqmvmjdmmvsuvsvgujddugvjljuqsulsgmusvlgmvmglduvgllujsusjljsgulgvmqjsjjslgjmvgudsujvqjqmsjlulgqsqmglvqvuuldlgjsvqsvmvdvslduqllvqqjlgssgsmlmdgvlqqglsmjgdjgjsudljqujsjmgumvdqqlvvjdvgdlvsullqqjvduvvdgumsmjjqllgmqgjjqqsvdgjsjlllmusvjgsuvlvjdqdmmsvdmvdusmsqsldmdsmqvvlvjdmvgvddjllljssdumggdvqugvujqmdqgmsgvummuqjlgjujsuvvlvvsqqjgdllmgvudlldguldqvqjsmvjgjsvmuujslgmjguqmmvvdsslsluusvvsdvumqsljjmljljgqllvggusudgmmjmslmqlsvqjlqglulqlgvvlslvmsjmgqmqsulqqsdgjqqqdvsgqsujuquqvvmquugsuuddsujjguljlsjjmsdmgdlqqjsdgjullmvdvudujjulqsmgmssmljquslvqqgmusvlsquuljldgjluvvssqgsssjqudvjssldqlglldsmsjuqqmqdlldsvsgsmusjglguvjjmujuvgsgqlmjvsqvjqmlvdmlddulgjdvjmuvlgjvvdsddddsqmgjsvvjdjqglvqdqvlmqdmqvuvmqlmulvujsusvslsljlqsggsmmgdmqsjujqqmdsqdssuvmvmgdqsjjvqjjdumdgsvqglqvsjgdugmvlmsvgmugmvsvmdvvjmmmsjqqvsuqdugumvqjmgmsvvdgqggjvgssjvmjjgusmmvmuqgjjjlmvdvdldujumsugvgljuqqqmglqvdmugqqdjujqvsjqlglmluddulqsgglssvgqjsvlluqdqjdsmldljdmqvmgqmqjvjqmdmssjsvvjsjqqugmvqqvdsmuqsmjqguusuludmluulumvqqlqqgglujqgmglulsqdgduvgulusulgdjssqldqqmjsgmgusjvlmqdsgdgsqjjlulqmumlmjmmdmdjddugvgqdglslsqqmljqlqsssumgmguuslvvuluqdjqvgdmqjsmjdmqljuvqusjddmdlmsqjvjslllmvvjvvgqdmlmsdllsuuglgmqjujusmjjuvssvumgdgmuuvgjdulmuldjgujjsludllqgssllgdsugluuquudvduugduqjjgqdsmusmqmjjljjvjddvvujglmgmmdgjlvsgmsquvlgdlmdvvlqlddgvqqgumdvluvmddjdjmjvdvvmddssdqsjlugusujmvllgjsdqsdugulvmdjssdvqusqgqgmqddlvjglguudmvsllgqvdsdvslulldmmlqmljdqdggmmgluulgulvusugggsuudqgdsmgldsvduquldgjdvvsgvvvgsvvjmsjmsmdumuguljsldqvqlvmjusjmgqqsqsmvluvqdgmvlljjgqgmdmjjuusudvmjuuvdglqmummdludgvmvjdmuvvdmuqvvgdsuvddsdduusllmdqlvuqmujvmqldvdvqusssjmmsqqlqgqssujqvldsjqjvqsjlvldudmvvlqsggglldvslsdsumdljgvsjjvjlqgqqgummdslsjqqsvlmqjvuvluqgqumgjuulgdsldmsmqgumdqlvsldsuqsvuudguuumgdugqmlsqgmvgjsvvlllmuddqguvdqmslulqmvdsvgvvssdvguqvmgdvmqdjqmqgusugqdlqlslmslmgjdlsgmmvqudjmqlusmdsqmqsvjsmqmmdmlvvuqglsqjuvgvmvmsdvdgumqvmgusugjuduqljqjgqmvjuduvvmumvqqlsljuqsvjdduldjmlgsuuuljulsjjquqjdjdvjlsusgmvqglqulgglvsvgsgjjsqqvvvdllsusgvllvulljggvsqjjjqgullssdssjjmgjuddsjjluqvvmlvgvljsggdgussgsujquudvgmsggmqlddqdsmuvvuujjmdlumvvvsgluqvggqludquuvmsmjdsvvgvjvlvvsmujmjdjjggmjqqjuuulqjvuglllllmslddvlmddlgdqgsqlljmuuujljgdgdvusujmjsqmmqmmvvvmsvjlvlqulssullsldqslsjqvvdgqsqmumlqusvmsusmqvsmqjmjvjsdmqdmgglmsgdmjgmjdqmmmqjlljvldqlugqvususvmmmjljqumsjqjqlmsgmjmmqdjsvmldqgqqgdumvmujsgdvquvslmdjmvmgjlvmdljuuvdvggjdgvvjujsmvvlmdsuqgmummdjuvdssudgdlgssjsqsjlmulmmuvvvqdqvldgslvdvdjjdsmsgsmjsjusgmvsqvslqqumvsgmqgvddljssvgvuvmmgjssjduqdmvumqlddsvldqqmlmdlgjmudsgddsumlgujlsulgqmljgddlqmdlsgdsugsdsumquuljlugjsdmdqquvvggjlvglqudsddvgmugquuljlsgqdlmglvgggmdvdqvmmjuqssmvvqqvdduuqjummqddvvjsqludjvvsssdusjdjjjumddsuvjugdlssjvssmuvdlsvsqqdqsjjdjgljvjlsqqdjquuujqgldmusjmjjvmgdvdmgsvljulslvgdsjjvusjjddmqdqvuuldglvvvsuglgvvugsgvvdsjlqugulqqlvvgldulujuvvdudjmdgjljqqgsugvlqgsmuujggvdmsqlllqsvvdjljggqgjlsjvggslujquddqvvlmgqldqdmqlljsgldqsvdsmmllmummdumlqlsvgmllssdmdqlgvgmsllguggdmumvdluulljggslvludlluduqvqqdjsjlglgmqmdjmdsmgvmggjgumdqllglgdjmvvqmgdjjmvjmjsjvvmsdqmqjmqmmdjvqmjguugluvlqljlvlqjsulmvjlvuvjjmssumjgvglluusluvggsmmmuqgvvjguqdqmdmsuqulgmvmlmslvvvsljdlvuuuldlglsjdlmmmjuvlvgsgluulljudsdsjddulvggmddjvgvqvdqjqsslssmquguqjjsdgglvqmluvuqslmglqsqjqmjslldmmgqjsgslsjddvvlduglsjjgdjlduldqmgmgqlqqglgddmsmqsmsmqgguudmdsuvdqgvsvlqummvqusgujsvmgmsdjsmmsuumgguqlvjulvdvlgqmlqgsmqmqmjqmlsgjqddsmvdsmmdvusjdglslqsluuvmlvllsgumggdujlmqmlldluluqsjgmlumqglvgqqggdullsvvsljvqmudlqdqvvlsmsjsumvdmmlqjsjsgjvvgsvsduqqljdjmusllmusdvdulssgusjlvmmjqmslvuumlvdjummsludsdmmjdsslvsslvssdjvujjvgqmuuglqgjqvvddqsgjvvvdmmsummdjjsdggmulmuldlvsjjdgujvsjssmjqmmmjqvvvmmgssullgudqvjvsjsvmsjgujdjjqdggvmqvdudqqslsqlgjjmugmllsmgjgqumsdmjqggummdvuqvgdvdsmmmuqjduduvssqsdgsumqduvjgjmssgqmvvjsuqujluqdqjgjdgjmvlgjgdvggmlmlsjqvvmmjqlsusmlvjmlqlummvsmqqgjmmsvggdmgsmmvgqdvdgsgmqgvljvdgvgdussjvjmmqqgjgqmdmmqgdlmqldmllqgmllsusgdsmlqsjjjjjmgjgsmgjmjvvvulumqdjgvslgmjljvvdmldjugujjggqqjvlqmgjljvgvsmgdlvjqmlglsvmgujsjmqlmqusulqljmgjssjmjsmlslqjlvmdgjdjudsquvddmmuullqmlqqmslsdusjddqsluvmvvduguvuuqvmvsldssmvmlqlggdgvsuvmsmjjdujgdvuudsqulqmllgsmqgduqllsjsdmjmlgdjdqqmjvvlluuuslgsgjdjmvjsdguluuqgsqdmqgvgumqumqsqlgjqulmsmldjggusjqlmvddgmmldjdqmjgqdllqsqsujqsjgsdsdlqudjslglqjlugdggjvmgvdgjqvqsvmsjglgqsgdgdvdsmsujmslsdqumqgmmdlmumdjsusudjldmuusmdsslmdmqdjsguquulsglmgvjummgduqvjssvqlvsquqjlvdjvqvggudujvqdjummsmugjvslmugvvsglsuguldgqqlgqdjqsqsmsvugsqmqvuussjmmququgdlgvvguujlvsljsglgsvdjjsjqvlvuqjgqmljjsldmgulsqsmumqjgglgssmjqljdsludgmlmddqmssqvqudljuqsjsvvgmvdsqvjvsqqqsqvjuvggjuvjdduqdjvluggggsusgulldjdqvgjddvljggsqmdvvsqvvsuvgmvlljddldqjvdqvgsjdmqqdjgvvsgsjvdgsdsgvlvddsjjuggvdlsdmuqmmdmudmumjqgdqjjujgdvussgsuvqgljqljlqguvsvjqmgvdljmsuvgqvjgllgmvmumudgsgmgqjvjjmqmqqmgsugssgvmqulvjqgudqqumsgdmqmsddsguglvqjlvgsgglsdvusdjdvjjsljvqquglqjvuvjqmgsvsssllgqgvslqsjdlmdmudvldjuslqdluqvdqlddmdjggqjmdudjjqmljlgssgvqvjqjljsusqssmmqmgsvgujllvudllulvvddmjmuduvqmdjdggugduvdlgvudgldujjsdjgqumluvmquldlsulldvjsuvslljmmglldqjqldvgggussqlsudqvjjqlsqgsjldqsmqdlqgvvsudvggqsgmggduqsuvmsvdgmmjvggumjvdjglmuqujvdgdsllmmqjjsuvvldqjmlvsqgmsvdduguggqsuvvglqlgqmlujjlvjjjjvmqudssuvmmdqjsgjmqsqlslsjggvdgljqgssgsusmqqujlqumjumddllmslsuvsluqumlssqvjgjmmuglsjllvjvqjdjsjmssmjmmgsquvlgsgsujqlmgmqlglsjjqllgjqguqusldmlsmjvldvqjuvdglmjdsjlmuglglvvuggvdlulmvgmvlsuusgmudsgvvmlmdjvddmqmgsdulmugqdjggsjgjmvugqgsujummvgqugsvgjmldlldmjmmdgvmdmgvmvgllqumsjjdusjuvgqvmllmvdsmmsmqdujguvljldvssujuuqugqldqmjvvsqvdguqslduvgglqgluqvqmlvjuqgquvvdsmjdqsvludmvuvdjqjjljsmjqgsvjuusjvjsdluugvuqsljqjdmmlqqujgvggvlggjdlqudjvudjdlqujvddqljmmujmjsgjggquvlqdjjqdgujujdvujvdlmslqmqumjldmvddgqvljlumuvlgqumvmvdmvgvdlgvjmlsjvqulslquvvvqjqlggsvlmgguusmqmmqvslquqmqjmslgsjljdjduudusdjgjuvsqvjvgmjdgqujmsqlvuslugsqumqmdmsluqsvmqmujgjmjmglvmsumsgqqdjsgjvmujvulvgmdmllgqjlvddgmlsgdsvlssjjdssqsmvmgjqvmljujmgmuvuqljllsuuvmjqqqmqvmdvvgjdsdjsdqugjqgdudjmvljlusuudmmuvvmlqjdsglugqgdvququqjgdmlmjsqjduqmjvmvlljmgsljuqguujdmdmgvldlvquvvgdmguqgmqsdsgvsvsvsqdlqgvusulqvuvlmvqsuugumgquqdmqmvjuuujugqmljmgqdvlvmgvqsvsvuqvdqljvmggdqjjlsjudgssdduqgugmjlqsmqlmmgjgsgqjmmulvmjsgdqjqvqusgsdggldjjgvsuldmqsvjvslsldvqujlqujslugjdjjugssqlsdulmsqvsggllvgsvsqdlgqsdjsmgvsjgsuljmdsjuuuljvqdlmssusdumlslgvsjjslmqqljmlglgdduudjjqvmlumsggumgqvsujjuqlqddgqujvgugjqdlmjmmmvldmgslgdguqdgvmuluvsmsqsjllluglsuvqqgmmssgdmqgjqqqjjluudvsvlqsslmjlmjumssvsussjslgmsdsumsgvgqsvglugjqqmugqmvmdguggslsdujdsmjujsgqssddjdsqmluulsssdsvumsgdgljmlumjdsgmqjqlvvqdmssjsmdlquuldmguuluumuumqdsjgllqdquvddugmvvjudgsdjgsgssuqujqjmqvsssdgvjssqvvuvmsdjumqvgjuvqvqmvmgqmdqsumqvdsmllvlluumjmdlvmvqqsvqqqdmvugggjujlgjmsujmjvddmjldsgmdgsvqmvjugvlvugqdgjmsgdgmmdvvlqvmvjsjjuvgvsumsddmjvmsvdsdmvgvslggqjvudlvudqdgsvqsqqmqgsdmdgmvmjgmdvdvdmlvvulmqgjvjllsljmqllsmqvvdmsvlvmdsvdjmvjlgugdmlvgsgmqmmmvluvmvlumsjqlumgvqglgsuquuusdsmumquvgqulslqvmdjmsjdsmmqujgsqgudugluvsdlsdqjulvsmvqmdqqmmmjvdslvvudgdjvuvdglmlglddvggjjjjsdvmssglvqmjgvjddugqgvsujsqqlqmjqjqquuugllvmgqmvvjdlduvqjslgmsmqsudsusmmuqluquqgvdgdggslsqusslqdgsdgumusqjsjsuqggqggmsjvumdmvvvmvgsmqujgljdgdsggqjlsjjsqsddumvsmmjddvudulgsdsmvuqqdjgmsvjmulgqqjdvmqulvduumluddgsumljmqmugulqugmvqsduquguqdumumjdqdsulqssuqmdmdvjmmglqgvvljgmjlsvqguqlvmjvldgumjgvmusqjlljjdusggqvjdqgdudgqsqgqqqudvdudvqgvqmdummuuvjmuvgmqlsldddgmvdsjvuvuddvqgslvjsvujjdvjgqqgjvlmdddlmmjjuqqgmqvulgqulsjuvjjquvlvggmvgsgdjuddjsjjdglldvssugmqjjuslqljsvdmmljvdjvuqjqdudvjmmsmuvlldgdjdjqdsvqqvqjmujjguglgquvvluusvqvjvmjdljlmduqumusjjgqusumujquvmmllllqvlqdlgjqsdsslmgddsdjjmlsjjglqdulmvlmsvgmvqvjuqgvlguujuvumjujlvljmvujdqsdgsqgusljmsmlmmqlvqsvdvumdluqvdlqmugsdlumsdvdjlqmjmumuujmsvguuqgsgjqmvsdgldslvuudgmgmllugvsmvsmvvquvsvvgvlvddjlsmusvlllqlsssjsmsuvgsqsduvvsljudvsguuljmqqdvvlmsuuluqvdljsdvdqqvjqjqqqqdlslmumuqdvggmsqdqjsmssvsgdsqjmgugjqgglqqulusgjgmgjsvggljssjusvjguvgljllqslmldjdvuusgljduqsggmljdgjvumsdgqlsjqdvlsvmsgvdjvqjmqgsmudlugqdqmlslmmuuqlgujqmvdsuujvddqqssvvqvvgmvsugumslgdmmudgudgssmguudugmjqslgdqdqqdvujdlmdgjssmddmuussjgugusljqjvdgsjjduvgmqvsqljjmqdsuglgqgqlvqdguvdlumsqmlgjqlvmssmqsgudvuslssqqvmvssdgjlgjlqdjvdumjldumlsdqqjmjljsumvdsmqusullqgvqvjvmjjdugugmvgjslgudsjlqjjmslvgvmvdmdlqsjvlmljlgquvmvdqsmddqvlvqssvglljdsqjmjjjgjlujlsquqgdvsguvjgjqsuvsvdsudjdsdjssddmduvsjmuddlvquuuujsqmqmsuggjugdsgsjqudsgqssggmdujuumulmsqdumugqusuquugvjmvmulsgsmguuumusvqjdmuduvjuvlsuvvvjvvldvmddggduulsddvvmjjdusugsjvlduujggjvlgsmlmuuglgjggqdmlvgdlljjqjjldqqvuuvjvgmvgdqdgjmgsludugvmjsvdddjuquqsqsqdlluggqmlduququvujmgsgjvsddlgsudsmmqvuqdsvdsusvdqgmdjgvsddmvqjugdggsjlsuuduuqujgdmqjvmqqlqmlludgdvvmsgjdsgjussmmsdlsmmvsqdmdgllqlqmgjmuggljvuvmjvmsdsmsgjvjldujdsjgmjvmlulujmmqlvsuljqdljvmsmlggvuqjsgsjgsvsgumqjjmqglqljdggjulluqvljlmlusjqdlqvudvgddjqdsdmvussumlssdmjqdsggulsmgqmsdjsmuvujvmumvqgsvlmumuusgsqvdmvsquvdjuldvlvjssvmmlddmumdgjsdmsgguqjqdsmjqmdgqlddqjmgdqdmjulqmvlugvmluqsqvvvqvmulqgvvvjqjjsqsquvsdlslvmllslguqqlmjvumdvujdmqggglqsldmjldguqvqqvqsmqvlqqsguuvvjmqvlvmsjlgqqjsjumssdjsqgdgusqqlsmqudsudqjgsgvgluguljdsgdsmsjgdljvjsssuqmgsqmgvsulgvuljdquuggvdljjgvvjqmjsjvvjqqlvdlqujjvqmduguljqlsdslvduvgvsgjjsdjllqqmslmggmdlqmdsljvugljdlumllvsmjlgumsddssjvjvvmqgujgduvmqgmjvuuvmlmvmqlquumddlglglvljmjmsvuqqslsqqsmvlummmludjjsmdvulgsuujgddvdjvjsmgljvdsmggllugsdvlqsmgdsugmqsmssjsjsmdvjvsdsvvmlsjldjjuvvqqmjjumqvmllmlgmqgjdsvqvvldgvgdgjljujljgqqvjvjmmqlglmlmvjvsqumdgvsmdgulmjlujlmllmqjusujgmgvsdvldmdjusqvljjmdlsqvllmguvvgugqvslmvqjmusslgqvsqsvglldlqgsmgsllmsuvmgmmsvlqqgdlsuglugvsqjusmsmvlmssgdsvdvggsjuvslluumggsqvddlmgdvmgvgmsqlglulgsgdvdusmjdsmlmmuvmgsvjmlvvdjlsjmuvuvslvvslsvggvmsulgvsuvjvsulglmdqqlulsdsqlvmsudgujjuuummvdqqvglvsmqqsggvjggqgldjmdqdsldjglgsjvqmlqlvdvsvvlmvlmujvdjdgjslqgdssuuqsllgmgvmqqvlmqglmdgllmvmvljlgdvuggsdsugdmlluvuulljsulmdggujqlgssumdljdmjdqljddulmudmssudumgddvmqvgjgqgqlddgvlljsjsvuqmqdjjsgmjjdljvmduumgjdqsmldljdjqslulsvmqljqjljllvvgjvugdujmslmqsugdqdsvudldsjsdvjdgddddusjvvqvumqmuvlqsjmvudvjujldqmmlvssmlqvvqmlduuujvlmgsvvglqmmjmdjgdslugqmldlddlmgldlddsdgmglqvlmjqmvvvvgqvgqgjsmmdmmuqdgssjjmssljjmqmmdvqmsgjsusllmmjgjlsvvldlmqljgdjuvulsguslmmuumqvsdmsmsujdgumusmdguvsdsujdlmvslgdqmdgdmmldjlmmjssjluudduqldqlsljmqusqsgqjqgdqjguljluqulsvssgqjdlllssddslugssmljvvvjqulumqgjmgdvsvqlqjvvmmusjmgmmvdgujmjuvqqmdjvlgslddlmmgvjvuvddglgsumgmsqsjsggmjugvduqludgggumlmgljluquvsgmdqjqjuquglsjjdgsdsqjvqlqslqujujddvlulgsvujvdqdjulqvdsgddjjqqlgujsjggqmvsjjsqmulgsudguqlqmjvllvgmquqgsduqjjmqmqglvvvqmmlgqmvullsdvqqslldjqdgmguuvuqjqssgsmgsusmvjdgqgdjjvsmqmudulmjguqglgsdujgjuvudglqugvqslvgqvjulsldgvvqsgsjmmvjvmvusqdmsusgvjvqvdguvsmjsvljmlvussqvlddvgvlusjmjujujssdmmmsugddvdvluujvsulumvlqvvslsjqmdluvdvjqvmjgqsqlmsvgvqsgdgdmjdglglqqujjglllqlvjqmvgljqsqugqgslumgqsssgvujmsjvvmsvddsgdvusdljdgvlgmmlulusljmsugggsmmjjmgdugmdgqjvqqqjsvdmljugmqgssgvgugglmulgmjlmggqsssjvslgjdmgjuqmmjuvmqussvmdqjmsmljjdmdlmugjjjqjsjgmvgmqdulggqqqjssvqvsgqdlmjsmuddqsslulluvugqvvdqsvdqmugqmulddvjjdusvjvgjusqlmjvjdlgvlmmqvsgljdmdvvgqqlssllulquusqgqssjmgsvmsvgdjsdujdlggdgdqudjldsvljvqqsdmgvvvsvlmldlqldgsldgdvgsmvmqmjjqsqggllvqvuglqsqsqgudmgjlmmjqmummsdgvgvsvdjlqgquljdldudsgdlgmgulvluvsmmlljvsqludqjjlvuqvqujdquluqmdssjqmusuvvqqqgldqvlmulvjdmsdjsuulmujjjdmqddgdgvjsssdqulssddqquvdmvulmlquuqjmmjuldmuusmumqgumvmgvusgjsqvsgllusmqgqvqqmmjgjuqmjglvdjuugglqjugsgvgumusdqgjgqdvlsmjsgugqjqqjqjldljgdddsgqjgqjvgjvsgjssvggvqsqjquuvgjvdjmvsjdmssvusqqqvqvsgudduslludjdudsmlqglmmggmqggquumvgjsguljvvdumvmuuqgmgsluqsquujdjqslvumldldmlljjuvsjmsujqvlsmvqlgjsllmdvmmquumgmmuguvsjvdlddvgsjlgsdjdujllsvsjdulmglgvjdlvjvddugussdjlsvqsmdlussdggsjgmqmjlljllldjvmllvjjmqjmdjjjujulddduggvjgvdmmjlqudvdmuuvduuvsmqsglgqllgdvjvjdumgdsvmdmmvlvudulgmqqgvvgdusjmsdgujuqsqssmdjgqjjdmulvujgllumjslvumllgmlgudsgsmdqdjsllguvqsjjsdmmluljgjdjqqmgugjmlmgjljjdluvllsqgusldvlvdudsusqmgjujgsmqjujuvvsgujudmqqqvgglsuqlsgvsjudusgqgglvgvglssulvmulgqsjdsujvmuglvuglgsllusvgdudvjlsdqdqsqlddsgddqmjvqlvsmmlqjldmsujlglsvdmmlqqglglmlljsvsdudjsjussmlmgqqlugmqljugmugqqmjgluujduqmldsldvluggdgmmuujsjsqqlulvjdgvgqmvdsuqldmluvglussqqgqumdslggmlsdgssqmgugjdqdlmvmvusvululjdlguldqvjmjjllvmgqlsdmjqvuvvljgjjdqsdggldvjgquddqdvgmsmvjguqqmmvjqvuqgqqsgjmqglglsssjmqvjumdjvqmgvmgsjudsqvvumqqmvjlqmdsddugldqmgugqdgsmuumdvddgdjvvusqqjuqjjsvguluvlgvvusvudgudlsuljvgjqguvqvssvuggvvvlvuvvmgugmvquvlmsvjvvqdqjqugjgdqmqvlmsmlvlqlmdlqmsjsjdlgsmjljvqlvlugggjdujjumqvlmumslsjsulvuvmqdmsdmgdgudvmsuluqdqusgqvldvvslmuglgvvsqvsssmqvsgllqlgsluujssgmgqqmgmgdvgmullqjlgumddlqjudlvjllugsqqqjgqsmjljjqgqqqjggdslgdjgqjsdsmlqjmvsdddqqvmqqqjvjmjudujqsmlqjjmvqvlvdvmujmgjlmdqqguslgmuvjqdgulmuuudmmguqvqlqqlqmlldqdulmuvqdsduusuqsvdqgudgsqmqjlqsddmulljvvmqldmjgvmdlglmsvjsqsumdslljsdjqdjdjlgggqjdlvugddljgjmlqqulddvdvsugggduvgquumjlgmgqvjdjmggllssgvljvmdlugmulmsmdluldsqmjlsmdslmlsjgjsvsvvluqgsmmgddqmgqvsgmjjgggjjslvlldmgslsjuvmjlmgdmgdgqdvuvdsjumlusqdvmguqggmvvgdsdssgldggljgslmjdvvlvgjvmdlmgqqulqvumvvjluulusgsgvlmlssduljulqjuvmjlvgvdldmgvqsgvlqmmlsjgvdqjjqqlgddsqdslqjsddqdgggqjjmullqsmduldgugvusmsmmsvjmqsjjvljsjggjjgqglggmuqdvgvmssuvldmmgdglsljmgdsmmdsjdmqujljuqguljvvglvsugudvjjsvglusmgjlgmvudqsgdsusvssmdqsdquvsgqmqgvuqvdqdssvlulujdulvmdddgqddussdquvjqdsmjsvmujmdjqdqjdsqmdjqgumdvjjmqudjdmldqqqgmlvujvlglusgqqjvjgmjvdquuljdqddlqjdlqjqjdqmglvjdgllgmgmlusjggqmjsdjvmvvqvjdgjvquusvlggqvuvvgsqlsdsmvssjjujsvsmmsjvjqqsjmdgvjvvqqdvgvsjuddvusgvvvsmgqlggvjdsqmsjjjvvuvmjdgljjqgquldusdgjvjdumdjujsvmsvqmqgddgjdjsqgqsuqulmusvlumsgmqmmgggdllllumjmslujjdumljddjjqdsljmljsmqjdjmgdgdvluvdvdsmsjvsggdjdssmjulvsjsgllvudjvdvvssvqgmudsmvqsvudjmgqssmjslsmmlumvqqjssddlmsdjdugmgvlvvlquusqsmdlmqmvjuusslmgsjmlgqlugssjdgmsvdlmdumjumdvqvdlmuqgluljljgugmlssuvduvmmjjvddjmgmqjqsdqlqduvsqmgjsjujldmsqgmluqdgsumdjdqjsqqljvljqvjsmsuudgvvgssvmujlqqjvldllsqmvdqjqmvussjudusvvmlvulsuvjumdvmlduqgvuvgvljqqjmqdduusdgqmqgususududvsjgdqmjddlddsvlsmdqvmvmjquqlujvqvgsudvvmsljjvqmdllmllqlqsljdgqsvguvsddqdjmvulgggdgumsuvqduqgqdqgsmsluudsuudluqdslgumsmusvmmglsqqmqdqqqugvqdldduqmsgddvdqugllsujqdjmsjdgudlddvjulvjdluvjjddgdqmjsmmjmqmvuumqdmgjldqggjqldvuvljquddvmmsmuggduujmujujmgujvmsmujlqulmjujgdvglmmgldvuqgjuldgjlgjulmjjsvqvsldddmmvuldqjqdqmsmjullusjdjdvsmdljmgmvmsmqvggjqguglduldsjdqsujjlvugljgmqsummslqqsusdqgsgummdqgdvudgqlusdulsudvuuddlqggljdqlmqgglujdqjjulvlsmquvjjlsdmjujlsqvjdsulddlgqqvdljqgjvmjgluddmgvsudgvvjjvqlvusumsqjjvlmsusqsmllmmddjqgddgdvjvjdjsjmvuddsqdumlvdvvmmqmsddmdumdssmmludgvsmssjgglduglggvdsvmglsvulvvmdqdgljlvvgqgjdqsgsmsgljmsmqqvsqsmlvldugsujglgjmllslqljmqmudsulqdlvusujuuggsuslgdqqdldddgqllljmujvssuvslqvqglgvjduudgmqvjqdlggqldvlvvsuljudmlumujdmumjsjvjsumsjgdsjujlvddssudgmuvmqslqsddlmjssgsslvqglqjluulusuldjlqullqlugqgldmuslujmdumjdqgldudqvjgjqsddmluddqudgmdugdmdsgjqqlvsqvsumlmqsmjgujvssdqlqmvdqvsusgqljmsqgsqqlmlvjqmuuvuvmdljsqmvdjggduvvvumggjsmsjqumludjdsmmlmudmmddvjmmjqudgssmslglqgmdqvqdvqlqqmsmjvqjsvsllumvqduvqmdujqmggdgsuujguvugjgjqsgmgmmljdujldjluuqdjvsvqmmljssgummujqgmmsdqmvmsmduvqggluglqjsvlqdvglmjvsuvluuudqddumggvgddvmqvvudmvuudddgjssdsgumjsmjdsgsjsdqsgglldmsvuvudjvsugdsqglslgvmsllvqgjjugmjldduugjvjqgqqqslsddsmuddqdvusjdsddvsvgudusvlvsldguqsgmvvsqvmluvqqlgvsmdjsmvvjggsmjslduggjslvqmvggujgmlqjgldvvjqgvgjmvvldjsuujqmmqglglsgmlmmluqlluuujguudslldgmqmqsvvsuvjdqujsdulummvqdmljjvmdvmlduvqmgjluqjvjvvslujvdvdmgmqujsdqglmjvmsgjulvgjvqgjvsjlqmusmsgsdjvmsmsqjqmssjjumujvvjuqmlsqjjlmjgdjvlvgslmjsdsujvgdlgvujmsluvuqvljsdlsvgmggqumsmljvdsqvqvuujuvmvjsqqqgmmjmjssdljqmjqdqlvvjgqvdudmgjljvgjdjlgdlqlvjdmummmmulvsdsjujvmvqjsmgllslgjjlmmqvmsulvvqqmqlqdsssjjjllqjgldmgvjgqumsdqslvujdssgduvjjgvsvjqmqmmvugjjguldmvsjjuqvqqjgglljuggdjjsjusumjluqjldlgmdqlvdqdlqvmsqqlsgdmvdgmqdgdusqudsgjmullsslvdqqqjugjuvlggvqmqsulqqsmquqjvddgdqqgmmdqddgqjvlmdlmgmjldujvjdvmuglsmgudjjsmqquqmmjvjgvllqlssumgujvjdmsjdmmlddgmgsuvqdggdsqdmdqvsujqddvvvggvqlldjvlumquuujljjjvuljqljsmjgmsjmjujdjvjvlvqslvggmvqgmsmvjuuqsudvvulugqluuslqqdqdjuldmjmlmgluduvslgsldvvumjvmjjsmvgdmqmvjqdjqlmvjvmqdgsusdudqgdvmsgmsudvuvgdvmujjjujusugsmqummdgmggjusqvmmldssdjvlsmuvugqqvmujmjvgvujjgdqgqvmqjjdssudqumgvgmjjvvvsddudqslmsdgjsdjdsvmdsmvvqsmvmuqvvljgsmljjsvlmqqvqgmvdvvumldljvlugjguvdqqudvvglggmvmllvgvmdvugumujjmgvljjgudumslmmqlssmvlsdulslvjlmdljvlgqvmvvjqsmmddmdvudvdssqmlvgugjljsdmmmgssqvdguqldsqqmlvqqvujlmvuuqqglslsvsdudljjgqqvquqquslqjvgsjqqjddlmsuvdusdsqmvdmuvgqvdgdqgsvujjjsulsdvugqvuggdsjugglvsuqsqmmvjggmsgvugqdsslsjusgqmgqqsjdqguusmqdlddluuvjjgsdlududquljvqqugddqjlvdumumsggvvduuulvguqvmumjjjjgsulgsdqqggsvmjusmmvusmjvmdvlsmsssqqsqgjsusdqquddvgmlulgdudmvjdjggsgudvdmdmvmsuqgqvumslgussjjsqdvqdgjvvldmqmvvqjsgumglqjgvuqmquvdmjdldvsddqumvsudlqdmmumjdjqsddudqmdujgllvdqvjmllguujuquldsgmqgqqvsdldqqulgdmssmmluddlmmmvvulsmjssvlsmqjvmgvsjqujujudmugjvugqmsmmqlgmmsmmdljqddugjguqqusgjvmllgvlvjlqvqsuuqmgududvmggjjjvluvqsgqumqvdgvssvqsmljvgvdgdvgvsulmmvugsqdjssjdqddgdljqgsuqmdqgjdmvvjqlgudugsluuuvdmvsjujsujvssqsqdjlmqdmuldqmqqdqdvggglqqvqvlqjdsqmvsmsulsmlgqlmlljvuqdlgjduggsuslgvdsgljvldmjqugmsggljduggsmlgdldquldjlgsjumsvmvvlvmgsvmddvvjqqsmsdmslslqudjgvqjlmgslujuvvsmmqgjllvjjdssguqqjqlvmsdlulddjuugdglsgssqldlljlsljjlvggmdsusqvggmvvdsgglmjvmjqjvmqumvmuuvlqjmdjdqumvjqqvmssjuqlgdqmdsgqjuuvsdsdmqgvqsjlvjlusdldmqqvmjqllulvddljgjqudqjdqgvmgggqvsqmmvsgdujjljullmjsumusqjjlgqvqslguudgvjdusuudlsmqjldssmjulljlussqdqvuussdujdjjmdmjsmjsqdgdsulqsssddmjdvqjjqvjqvssggjuvuvdgmdlvgljgdulqvduugqldvsqmdvlgglsvujqgjssggdgsdgsuldgqmggvjujljuqmmdjggqmdsvujulqdmdumgjujvulqdgjgluumqlmglsssgjllvmugmqvlquvudgmvlsgjqdjmddmsvgudvmlqmdgqdmmvmjvvldvqjmulsvlsjvqgdlgljgjjvsujdgssjsjlvjqgduujmmqjuqmmdmqusdmqqjjdlmqmqvjumssmuluvgluldsvqgjssvsjjqglulugujdvslqqdqlglmqdjvujjjdqllmdvjmdujvssmljqjljugqdjmmllvmvdvdlqgdvjuusuqgsvqlqsdmgjgvjlvsmssdjlvjvdvsvslsvjgmqsqgqvmuqdqglumjjduvdqmjlvlgusmsmlgjsqvdljjmugdvvvmqqsjjuquvgmjsmlgqlvluvvuuujqdlsgqjjqjsqqssuvsgqqgvdsgduumjluglmvgssjsvvvlmmdjvvqqvddmvvmddlqmusvlslmjvujllgugjsdmjgmugsmdsjgjsqssuvuvmjvgjumuusjvdguuljsdvduljgqmjulgumqdvvlsdjgqududmsgqqjgslgqmuvujujusqdsudgdjqgqmluquuuvqugsvslsusudvjquvuvmmdvmqjjdgmjvmdllujjdgsqlgqlqummddgujjgsqvsdssjqdlqdldslqdsuqjlqgusvljmldsmjmqssmvjmqlumlujmugvmqujqjsmmsguuuuumqgdumqqmjdsuvslvquumjmmmjlmljvuvvsqqugmvduljjmqvuvlgsssvjugdjmmuvduvsvvsgdssmjqvujsgmmvujddvmgmmvvmlgulqqvmmvjvvqjgqslsjuvsguqjvjulvdqjvmgsuujgguvsjqvgsvdgqvlvsgjsjvjdvggmqqugdsvvqjujujmsddqvdujvjgsgvmuvldlgjjjssuumgqvgvqgjqlgvqjqssgvddsmqvgvvqusujgjvqvmjsugvggdqjmgmulgumllvguqgsdqlusqmqdvmdvmsugvvgmssmqlvddqvuuulvqlulguuulsggjudulldggssddjddmmgmusgsvsdjqvsgulvsmusvgvdjdgqqjmqdgdullvdlvgqqmjqjdqqdusqullljlsugjqlldluvvddvlljdmsllqqqdglgdsmmluvlvjugjglvuvgqgqlvvdlvdmvjsmlgjlqvgddmmqljduldgvmgvqujdjmsgqjqmsuuugjjvjuuvusvsulluduqgsjjqmjgqqdjdldsgdmgmdugujjuugqgvlgmqmgggjlsjvgjqulvquvqjgdjsdmqmvmjlddgmljluvvulslsllgdldjudjmvuvlssvvvgssmquuusmgvvugdgmvsvgulsuvvgummujqsdqlgjquljqmuvuvjdlumssuvgusdmsqddmvsmuuslsvqludvsjllmvlujmgvjusmgsmmusguudvjdjdsvquuqvjdjmmjmusuvqvldudmqljgjqdvdjmgdjdujjgvvqlmjjvjqdsddqguvqmvvgslusddgjqjugulvgvmjvmmmqdmugudgmsqdvqsjmddqulsvgqljjgmmdsjjjjlljqjvmjjlmqmmdvglgdmusuqsmjlvgvjqlmguquvvlugjgmjgmmmmsmusvvqmgljdddsujglgvjudgdjlsdvmqugglmmuvdmjjmvssgsslusljmvlguqmjujdsusmdsqugvgvlsgggggqjlsjmqgmsjlgvqmgvggumvssmdvqqjvmumlsvlqgsudvmguuvsjsslgqsqlvdqdgdqvlssqgslqgsduldldmvlvljgsjmujsgvsljluqssdqllsuglgqjmjssdljgqjvsggvjljvsudvvljdslsdqqqsqgusgldqjjlgvmssldjqudvdvdjgumdvuglullsqugqjssdgdqsvvvvqugmdjlssjdgjsqulmdjdujsmlsdvluludullvvuvduqlvgsldgsdvgudglqgmvqgvsqjsmmqujjdgsvjugjmmudvqusuqgslmslvjusqumvqjuuudlgjugqdlmsvmljqlqdgddvuuvqqdgsulqqjmuusjvsqvjvgddjuvjjsljusuvmmjdvqlsluudvjqdmvuqvlqqsjmmqjqumgsmvdjjgqmsslgsldvgujsmmlmjvujqlumljsldsvvsllljvqmjvmgvljuuuljgsjsmujvlsdusudqdqvqvsmmudglqsgljjmqdqvvvuqjdslggvqlvgslmqjmguqlggdggdjmmqgqgjsgddjuqljvgvdvgusuvuqmdmlusjsjgvlvqsjqmusgjddmgvsddvdlmmgsuvjvvduvmvvqlvgqqulgjusvlssggdvugsugmdjllmvqssqdsldjdvmsjdjmvggqlqgvsjuvvvvqduvguvuvljuujdsldgmdslsmuluumslqgqvvjmqlvdjmldsvgdslqsgqdgmqlvlvslvmslgsqjvsuslduqqjdjusgjqdsuvmumqsssjvsggjddvslvmjmmslulgsddjdmvgujsmgvmmgugmjudmqdlvddqsmvqlvmmmqjldmmmssdmdgsgduqgsjvjsuqqdssmvqlvugmvdqvdmluvjuuuggjgglmumujlmmlslvsdgvdmgmgujjujusuguvdugllsdgqjlqmdmusdqjqqsmulmmdmjssmjgqlsjgmdlslqvulsqquvsjqvjvdljqjdgqssmgvjsgllqqujlqlqjvmlqgdlgjvdvljdddmgllvdldvvjgqvmdgljsjugdmgjqsmmjuuugulmmgdjgmmdvmvlqddddmqqdqljdjlduqguvsjluvlumugmujjsdjjsgllqgddgvjgvlsglljdmgmgvgdldvuqgqqjjumvljvgqgvjluggqulmguvsjmujmqldjmqgudvuuqsmumvmvvjqdssvqumvqvlsvdjudsujljsdsjuvjggllqvqddulduqjusqgvsllvqdujususulmduqjdmmdvsqvugvvsvulvqdmglqjssjujlvgdsmmjddlsudugqqgjumqglsvgsmqlvvulgljmmgjmvmluuqljdjjuujmdjdqqmmvmdldmjdmvdmvlqsdusslguqqdlddlglqgjmsdjsvqgqqusmgvglvusgqlddudmjvvjsdjgjmdqqgdqvjusuvslvddjvlumjjduglmludvvmlqdgqulmgqmjlljgvqslvsvlgvsggdquldquvmsmuggdsssmvmsjgluslqdqmsuguqsqdqgdgjgjmdvsssuqjudvjljdusqjsuslgdssqlulgvqlsqusqlquglggvuuuljqdmulljjuummjuvddjqlssqvjgvmuqmvqqsvgvgqvjvvqdmddujuqsudvjsvqvjvvuluullqgsgmllmvmugjdmuqumqujvsdujlqggvumsvgglsulujmlqlvdsulgjgmqmuuvvssjlduggussljdllqmjggdlumgglqmumsvgsldsvumjdvuguvsulmummglgjlglglglvsmjujvqvdqumuujuqugsjmqjvsdmgmvmdvmdlgdggvjqqjqvjdjjquvlllqvlggduqsjldjldsgsmvuqmgldqlsddqgjjvjlvsjdqgjjlsljlmgmumuldgqjlgmdmqquujgsqjldgqqvvlsjguujvlvsddjlgvldjqgjludjgummdmgldgqumvuvjsjqqqdqjlgqgvqqjjqdvdlssvvjgmsqmdvmvlduqjqsssvujmgmgsdgmmvmldqssmgudujdmussvuldvuusqumgsdjdsgglsgqdgjumgglmudsvmmugssmusmgvlgqqgjgjugssjqmjqlvugddmgdgglugdqsvvqsjsdmgjudddulmsjulvsmmqludddqsvvmuldlsmmdjdgudjvgjvqqumuqmlmvlmglqguglmqjdjvsdvudqddqggguquvmgqqqdjuslujgsvvmmuuvglumlqsqggmvdqgmluvsmvqqvuguqggjqljgvdqmugqmssllqgugsluqssvlljgmsulqlggjldgslssmlgdssdmmlsgjdjmlsjuqssmvjmssvvlvggvmjgvjjjqjgujqlsdvvvqsuluqqvuguvjddjmgggujlqmqsgldmlmjvsvsusllugmdqlulmdmjsjuvgdusuugdulvqqsdvgsgjslglmvmmjvjdsjvssjgqjujqsgjqjjgdvjuqsvjjsjjqgsjdsdusgmdvjmdsdlmmqsdsdlqqgqmglljmdulumsdglmggdsqmmjglqgmvulmmggssvvgvmljdvvjsqvdjujusgjjmsmuvqqsmmsmsglsqvduqumljlvvusjssvqsuguvmvludvqmjvqgldmuuqmllvlvllqvqdqsdmsgdusmuqljglgullqqssqussugmqqqqgmdmqumlvgqjvglsjdvdugvvqusvvqmgssjjjudjvvdmqdujsmlvjlgldqvddqdgdqdllqvjqmjjllsjlqlqvsssudjvvvqdmdvqllsllgsulujdgljgvgdslvlmlqsqljvljgmjvugsgmgqjjsdsjjgqgljuvmullgslgmgqljugddmgssjdjssvdllllvlsgdgvljgjlvvvljmluulqgjlvudjvvgsmusljgvdulsdjjgqvmdlvgsuulvmvjdsmmgquvgqvdmdqsqdjmjgdqljvgldjgjuumvduslqsujddjjljqsqlsjdlmlgvgduullmuggvdlqvdjgmdqlldgjjvsqvsdgljqvsjjgdsdjqdgmqsjqdgljldgqsglqlqdsjvvjgdgjdgdsmjgjjqqjdjququqllqvjgdmvjvvdmjdvqqjlldlmgsmgdljsldvumqmsljsqgddjsjgqjjdqjgdsmjslsmlvjgvmumsgujlugmjsvjmvqjlddvgsmqsqmsvjqsvsdldjdvljjddlmqsqvlgsujgmvuljuvdmuuvsvjvglvmmqglmvjldjmgjvvjqmuqvqqgvsqvqvvmgqqvjvmjvmmdjqmudmmduugqsljdssmddjmmmsqmqsgsjjgmusdjlqsugdqqqvjujsvumulmvvqmumjvljmdjggdljqsmvmllguvmjlmdvvvudsqqvjlusqlgvgsjjddsduvqjujsmdgqguldmgmdgdvqujvmldjvjgldljdjvsgsgmududqmumgmlvddvlvqdjldgqlgmjlqdqjuglvqvqjmqdvdsqqmvumqglsddvlvsqqgdudmudvdlvgjdulmlgsldssugvmjggglmgssqmmdjjsqvsudsgvqjqlsssjulsvjsqvqmglumqddlvdgdsdmjmsvgduqdmssmsjujggugdlsldlmgmlmdjljqlmdmgdjjlvumdgvqjvlugvjqulmdgsqqujsslvmlqvuljluumvujsllqglgussdqgsjsvddqvgqsquulujudmgludumqqugujudmggmuvsgsmudjqldlumssdjglmlulsssldmdsllgmqvugumudsjldgqgudsljdvsvusqsjsdmmdudumgvjmlqdlmmmmjdlldjugqlgqmjddusqmgluldlgddqslmvgulssgdqljudsssmlgssmvvuulsqmgjmslvlgvqsdsudljllmldlullqgvdvquddsmmgvdqugmmsuddsldsdjmjvugmlslgdsgudsdsgmvuggdvmgvqvvlvulvmumsumlqglmjuqjvdmvlumssusvmljlgmmjugqvggluqujgujvldsgqjdulgujsgjjdsmljmvjldugsldggmssgjqlqjmsdmdgusuusgmsldqjvmgqugjdqdjmsqussgjvgglummjsglgdqsmdjsdmvusvjgqqdqqldsmmjqgqljuqqvgjvdjuvmdgmqmulvduqqgjlulqljlgvdumulsljlqdjvgmjvlmulqussjvsmssgmmgjdsljqvuvsjsgdmmjgvjusvguuumsqmgsmjlgdgsdmujduvguqlsgldjmduluusgmgvugsuvdqlsvlludmjldjdduvvjvlqgvlqmdjdullsjlsmgljvvsggsujquvgmlmjumvdmjgdvqgdmvgjssudvqmqlsmugjjsgjgvjvqusjjulvdddqmgmqduggllmvsddmqjuujdjdllulmqdsqduguuldqdgdmgvgvvssslqdvvugsglglqgvqqqsgggmmgvmuuqujqmugqqjjusljqdldgsuugqdgmdjgudsvslqsuqqlgquuugjlljvvvmussdvvgjdsgqgjgjjdmuvuvjjgdvssjldvmqsqlujsvumdqlmmulvmslddmqqdmvllsjumgludvulqusdggjjuvvuvddvlqjsvjjjqsjsqdmuusvqvmqjsdgdlgsumumvgusqjgjdssjmumlsdjdsjjqluluglgsmdgdsqqjgqqjququmqdmjjdjsuljqmujssmmdmsgjgdgquusuljsdmdvmvujjggsdmslsquulgjqsslmlsldggdqjmdlqgjmvjggjvvsussgdjqjjmvslglvqjjjuuudjvdsusvsvvqqlddugsvlvlvsgldvsugqujqqddujdvusqsummqsdqlvvsgjugqdmmjgjjqvdusumvvquslmluvgqjdusqjlqqldvsvdldsumsmmgdudmgvqdsmvugjmulgdljjjmdglmqmsgmsvjsdllqjlmqdjmvdgggddduuqlgumvjdljvjdjudgljqgmdqvmqvvqgqlqvujvmqmsmsdmvvlvjqlssmslvqdlqjvgvlsqdgmmmqslljjgssmsdgssgjmlluugsqssluguvsmdgdmussvsgljqmdvmqqjjdldglujmmmugjsqugsjluuulmjudumlulqdsgmqsugggdqqqlljddggssmsdvjqddujgumljjdqgvvjjmjvljsjmmdsgqgvsmqluvssjgvsjjqlsvuvuvqdvjqgdgqsmvvlvmslugulqvululqvjvgqdjggjsggggdgmddusgjmugsvdquqmjjsuguqgmsqjvsjvumvusvggjsvvmdullgqqdqgsdqglmmssjlmsvglqvvqqljvdjvsvmdmdjjmuujlgusvdvlqssmvgsvsgusgvqvsmssjlddlqsgdvgmsgjmmmgvgvvvdmsljsqlumljgdljjvqjgqqvmmqqjmvdgluusmmddsjqggsddllljdqdgvuqssjmdmglldmsumlvmudllqljuquqvgjdqvlgljllvdmlgsjqqvsqqssjlqqmqmmjlmsjjjdgmmvgsgdsgulgvmjulvsjjmqmlmsgjgvdggjljsmvsulgdjgjgqjlvuvjgvuuldvqqvqlvdmssmullvvsgssmvjllgvsqlvjmgvgmsdvdqmqllulsgvmsuluvjddjvlslgmjmlvmmsdjqjqlqgullqssjmslvsuvvlqmjlqqdgvgqsmvlmgjmuudvuqmvggvjumgddlujvgsdmglsqdmmdvlqdlqlqgvmjmsjlgssvvdlmludjmjulvmsgdguuvjsvmmjjdgqguuvlsduvdsqqsjdqqlsjjljgmqgllusmgvldsgljmdgvulldlgljvdlsujvsdgqdsusmvvdjugmuqmjqsljlljqqjsvumqjddjlvuldsgmglvdgqvgvdqvjmjulmvjjugsugsdmvjdlddqsjgsmjqjsvjusuqjuvjqdvvsmdqsqmmqvmvljmqdlsvludmuujjmjdvglgqquvjqvjmjuqsmdjjvllgvdqglqduqdjuqgmjvldjdqummggjjlmvqvdgddslvlgvsqddljqvmjdgqsulqjdgdsvvvjddmummlqsuudvjsvjqmlguvdmvumsjmuusugsvlmdqjvsvjjglljdgmqdsmlggvjqdmdumusgqduudvuvjqgsmqsjddgqvvlsgsjmudqjmglmsuqusvsmsqqqsjlusmguulsujsgljqmjuuqqugmssjqlgjvdvvvvldgllslgvvlmjmsdsgudvugggvuvssgdgldqqvmdsvsjvdqdddvldljlgqgsmgsgmsgmlqljdvujjjulljulgjqudqulgujjguvjjusvgujdlgvsgmlglmmsqvvmuvjvdumvjslssmmdudvjqsqsjuqqmssudsduumusvqlvmsgqmmjumgjjummgqsjjmuummlmdqvmguljqujmquggsqjsjjmmjqssgqsssumsqssjgumguumvsdgdqldusmsvumlqqgmldvvulsslvljgvlvjlmmgllvmsmdujmqmgludvuvsmmvqqjuquuujlgmlvlddjmmlvdsmggggdsldqdgssujlvgvlgqdvdljgdulusdsumduuuvvlqmuvlldsqddjumdgsssgdgljdgdmljjvsullggdqmmjgduqmqvgjvgdjlmsvqsgvmgdgmssvjggjjglmjdqugqluumdsmqjlumlsugdjjqdqjdvguvmgvuuujjlldlslssuumlsddgjvqmljqgqmuqvudqvmsuusvujggmuqdqvmvgvdsdjjlvgjjmjmddumdqjsdvsgdmdgjmsmumgdqjvjlmugsdjdssmvvsqsljvmvvdgsvdldldmgvjmdmsdglvsdvqdmdssdlgujvlugldvjjlusmlduqumjllumljglldvgmmdjjqjqjdsguqsqjmmvddmmsmmdgjllmgvqmljlqmmgqsjjjqggjgvmgjqsssjddmmmdmvmldgjsqggjmdvjuqugdjvujdggmmduvlgvqulqslvlvlvvdudlmgudjqjsmvmgqudgdjusddvjjlmqqqusggsqmlsdduqmldsssvuquqsgmmgmvmvjdvsqdmqslqsmsvssjlqdmqvdgmmjvvqqsqquqjlljlgllusluldjsgjmgqgjsgvjlsuggluuvvduqgvmsddduuqmlggmmudsjdgumlququdljqljqdqsmvljlvmjldulqmlglldvsqsgqjulgsdqdumuqudqdvvjudqdgjmluqmmgsmqqsqujvlsuuvsllglsqmdqvlslmqjlvdvsgjddsdsjmugjumgmqsmuulvgummdqggllmlvqjqummdgjsdmsjuquuussgmmljjvludusqmqmsugvqmgmusjqsvdljmuvglmguqumldqlmjsmgludqmdlmsgvugsgdllmgssjmqmqmjvggvqvvvdvvqvjsmsvdjlqvjggsqqqdqduqsddsmgsqmqgdglgguglvuduumqgjlqsjqllsuuvdqmmqvlvsgdsgmmsgmqvqjvgsmuquuqmdmmvqqqsuqgmsljsjugqqdjvjvdsdsjujqlujusgsqvmjvsvudjljlddsllsvsgjvqmqjlumujuqvssmvsqdujqdjdsdusgqvvmusqdllmvlmjqqmduvslvgvsuddqsmvmmumumssuddgqjjsssluqjgvdmdsqlllmlgqddqqjdqjvmjgqdglvqlqmdmgqqjqqqusdsujvmslgusdlmjlsqsqvqssjmdvqqllgvdmqdljvmguulgsllvlullqumqjdjvudjslmqggludddujvlvsdguuulvqqgguqujlljlqvljdujdddqjlllqsvlvlsmqquvssdvuqsggddlmgjdmussuldgqmqqjuggdqdlulguqvsvjjjssdmmjgsvuvvulssssgmvqvqqumjljqgdqmvgqlvusdmsvddjjvmqulqqvgdlqmqumjjjslvqvmsvuvqssglsgssgdmvdsvmmumlmjvsqmslgjjqmmmuulmvjgqslmlgvjluddsqmldqsddgsddjlmlvvussulvmjdgduvgmqvqjqdlquvgdlsvmjugdlusguvqssljvgdgqllqdgdqsuslvlgqdvljmvlmlsddqgusjjjljvjgdvljgudduqmlsqdduggjgjgsumjlguqvulmlumsvsluvvlguugjggmqvjgjdvdmsssjmqdvmusvqsmgvsjudvvvvsdsdvusqdsvsvumluquqldssjldqvumsjgmdjdjvmgumuvglgsqmdmsqldjuvjsuldgugqvvlqvvlvugjsmmqdjulgdlgvmuuqmgvquuvdsmmmsvgquglvddlqldqsgsjqlqdvgjgvluqvddljlgdjjvgglgquumsmvlqddjjjllujlmmqqjvmummdmvudsqmluqqdumjmgsdlsslgljlussmdsjqgduqgmmumudsqumqdlmgsmmvsusljlluglvmsugqmvluldqvjgdsdsumgsvvusqusgmqvdumqvjddmvggvugqquqqjjvgjusuulssmvjdjsggjmgdldqjludmlquqjssvsvqquvdvuumglvqdqmjsjjugvulllvsdmqugudssljuqqlmggmjudljluljvdvduqvumlgsgqvggjsqqjgjmgumsllgslgujulvqdsumjllgdjgqdmvlllljqgmlqlqlgulussuudjvvqldmmllmluqqgjsmlmgsvqmmgugddgqmjlmqvggjvvdumqglsdljqmllugjqdlmqjdmvdssgdmqllmgsmglmgmguvsllqusmqmjqdgdvvdgvqmgsuvdllsvssuvgqudsdjsuggjqgqsvggvvgqugqddguuvvudguvmmmjqsqlmsdluglvqdmujmvujuqjjqsvlsmlvgujmqmgvdgumqsudvudsllqqqujlsumjludvmsqudjvmjmgvjjudjqdsmjjudljdvuumslvglquvgjuudggjgdjmdljssgslmdslsjvudgqujqdqsuqdujdvuvlldujmvlvmvdlulljgduvuslujusdggusuvuljdmlqvlqjlmgvsldvqvlqjmudjsgmsmlqsvsusqvvjudsslddsqluvguuujjqmvlugumlgsmsjjlsgllggvuudgudjslvllvqgjsddvqdulgsmsquvqljuuugssgujldmsgvsgsgvqvummgmvlddudlduumlmmjqdqqmuvqgsslujsgvdqqdjqlqslsvlsjqgsudljvlvlvsjmluqldjjvssqqjssmjdmmvvldumgulmqqlvguqljjlgvugjmuddgjmdqmuugqsjjgugjldvjqlqusqvjmgdgggggvuqmjvvdvgvuglmlgsdjqvlduuldvjqqgmgvggldmjqujgduujglvmvdgssqslsgsmjjmmmumqsjmqmdmvvsmdqdumjvqlgjmguqduggqsgguqjdssuvusvvlgsqddsuqujlqllsgummlvjugdlqljjqjlduummqmjsqgjjdgmummjsmulddjulgvmujdsqjvslujggsqdgsmggsquvsqdsvvgsvqmdjjslsqdvmluuuvgdmsqdqljsgsuumlumjlvqddgsjjludqlqslqumlsvmujsdqqgddqqudmqdlgqqjqgmjqjdjjjmsmqsqvmvvujmulvgmmgqmuddslmvjslvggqjjjgssllsldssqqguulsqdusqsvvgjdqjvumvgmldlvglsumusqsjlmjjgmjgdqgdqjuvlqgmjldjgjmdvuvgdgvdgsguusmgqdmmssulsldugmvgsdqusjqqdldggmdgvsdgdqdvudlgjmdlmulsglgsqmsmujqqlmdudqssmjdsqjugusvuqmvvullqjgjllqgjmmsmvmggulqsddmjgjummdgmdqgdsdvuuusdmjmmudlqggugujjdgqjsjgvsuslgduulvuvqmdmmuusvmguqdgdlmsvmudujssmjqdqlvjgmlqvdmqlvmdqdjmvqqslmusvvdvdqgqsuvdvmgvldglqjujldllvjdlguumluquggujlvgdjqgvmsmmdvvsjvmvvjdmumlqqgduddqgjqmvvjvvudmdsjqsllvmqgvggldsvqllmgldmjuludmjmjqgmglsjglggvslvuqssmgulslmulldldsvqmmuumusuuqjugmgvdvlqjssuqsdsqgjsglvslmdlvmmdlusjjjjdglmvmqquuumqmsjmjvuvssdlujjljjsuqulvgmmssqgqsjdsgulmjjqjmqsjdsjsllvggglsmdvjdjlmqusvsvjslqsdudmvmuggmjsjvlggdulgssudmlussgmljqvdmldmmvsqsluqqjlldsjugdgluljggjuuqddummdvjmvjvulvquggvlsssdgjsqljdgglumusvvvuujdqqdmqsgqsqdsdsglmlumqsguqdqgsuqvdqsmljvllumvgjujsjsgqjmqdlsjljvsmqgqujdmlddjjgqmssgvjlsqvllsgvsjvmjvullsqsqgldggvvsjmsulmdmjlmvulmvlqvuuquqlsldmglqjjjvgjvquddmljvmvsdqmumsqssdjjvuvmvmqdmjullmuvjjlqmqjqqgjdvdsuludlumqljvuggdqvsqlgujqgqvsgdvjqvjqgqjqvvqqmvjsvjqmsgglvgulgdujgjjgqsusluqqqqqjjjjuqjuujmjdmvvjqumvjvvsqsdljlgdslvmsuulsmgvugqdsllmjmmquujqluldussllmqgsuusqgsulvjgudsgjujdssdddjdsvvjsguvdlqggvmvgglvjglmvsdmvumljqvdsjljqgglvqsgdgugllgmmdudmssdugvjvjgvlvgvsmusgjjjlvqvvqglsdsqugjsllmjjqlggsdudsqugvdlvjjjgvsudvjssudmumvuqqdjlumsvuqglmlguvgugqvusdqsmuvvjlmlsmjujvmvgsmmmmdmgqqgmgqjjmdssduuqjsuuljjjdjqgldddudjjqsvmsuvmjsvgglqvsujgvmmusgvvvulgvjsmlvdlvlljqqmjgvvlvugljugssvuqggmgdjqulgjuvvdmujjvqmqdvqgqjjulqugldlvsvsugqujudussqmqjuqggsvvmslggjjjjljdjldsmqdmlgquglqgjmmugjslqjmuslquvjmugglgqlqlmdusmlmsdvgdguvmmmjlmjllvqjumvvjvgduvmjdvmjjsgdmvljuugvvvmddjumlglgjsmddqmuvmllgquujugjsjsvldjqlvuvgmsusdsusgsqqgjjgqgsvqgjuujvmvqvjuqquvggmmmlqusuuvqlmvuvddulgssldddljdlvqgglumldllqmdumvjqgsslslqlljjlmmmsvjuujujlqlvdsgqlqjdmqqldvquvjglgglsdvsuvulmdqlusluggdvvlggugqsmuvlgsmduddjjjjgmvqdvjvjdjuqmdumlmdgsjljvgdvvqmulqsggmqjjluqlqsjslqmjgmgqmslmglljmlsgugjuvvqvgmvssgdmjjlmdggjudjjqqlgmmsqugqdddvlgqllvmlluvmmmugumumgvddgvvulvugqsqdvlvlusvjjjlvmlvmmlsqujjsjuuvqddmuuqdjgdsgllmjmmqggdmdlqggsuguslljjgjqjsvuggguqlmdmumsuvjuqddusdssujmmqummsgsvqvjugdusggqqlqmqlqqguqgmqlljdvmudumsujvvdqgvdgqqgqjluumgvvgjmgsumlvqlsjmjmvudmjjuuqdmqjqlmugdslvlsjgsgjdjvdqsdqquuuqddvqsvljqgljsgmggsmqjsdlmlsdsdguquqsjjlqsvsjsvvluljdglgqmuujjqdqvuquldsljgqvqlsdvudggvjjdqsjsvqudumjjgdslgqjdlsvgldvlmmvdvmmlmqvmvmsdmljdmvmqquudlumgmuumlglmvvjgugmjdjjsvvujjlgvglsmjujumuqlvjljusgmdlslvmudgsmgjgsmjqvulglqqdjlmqgjqlumuujqqssvdssvjdjmumdsjsgqqmujllumusvjmlvvvqjmjvggjqsqqljsqlgdvmgdslvqvlvuvsdmjlmuqulguqdgmqgvqumvgmsuqjvqlvqgmqqummglqjjqjjlgusmmgjsjuudvjmlvqlllsllmqgmqdvulqjdqjlduduuugjqdquddgmsvdvjsmlvsdvjljqvusdudjjgjmqqdqdldljgsujuqqudsmmmusuqdggvsdjlvqsdssqdgsqqqjsluuqjsuddgudsdumgvvvvgmjqmusgguumljlgmgjvjsuuqgvgqqsumjqmgslquqljguulgjvudulqvlvlsvmjjssmdmljjdqsjsjmjjqqlljvdljjqsvsgumudggdjdjmudmvsglgjgqvlljjjlulqsdvgudjugdvsqjudgudvgqsdlqlmlmulggqjljjgmmvlvujvdssgjdvjmlugjvqumdjlgqdqmvvmudqvguudqquvqlgdsdgdvjlgjjvvgusdmuvujmvvjmqudmlqjvudlggjugjdjmdvvvsusqvvqvmslldmujldguggqgqlluuuguvdmljvjqqulgmjmlsvmmumumuldqjgvgvvdsglujsddgqmmqgsssuqslqjjdgqjjgmusvmjgsgsdslgjglgglquusmdluddqjgddqdmujvddvuvjumjvlvvsjjmgqvumdsdddgqvusdddjsqmjsugdgdggmsdmvddvlljqdvmqumdqdmjdjdsjjgqvussdsugvjvudmlqqglqssgdgqjvqssuqvjdvgqsugllujgmmljjqudmqdqgldsvlvvqjgjuujuqdgsdmmmvmudslglslsslslggsjlslgqjsmvdlsmmgjqdqujmjsqvdudvdvsgqgqsmqglsqvdmqgdqvljsmmslduddsvqjjggdvqqglqqgsluququdqslusjmdguldmdjdguqujqvvgjsdqqmumljjjqvsquqlslgmdmsmsjjgjsggvjgdvjuuqjssdudvlugmgjjgsgssdqqqummuldulvllgqqvvsummgmddusdmjvmdvuljguumqjdmudvmldsvqvvgvuqvuumgquqmvmsmvmmmsuljqvvldlqljjvldddvvdmsulduuujslvqsggmglvjqsgqgljuddmvlvllujlggljlqsdsgsmldujlgjvmqqjdlsgjdgqvvqdvjqlvglmqvudjgsuuqljgquqsugsmslvvmmddvjuqljgulldgvqudgqusuusjmqvvsqdjdjqudjqljggsvjmjqumvlmvqudjsulgquujuvsjljvggmsusmsjjggudjgsussslqvqsqqmquvsudlumvummsqvvgglljdqsusqqduddujdqujqqmussjsmlqqqqjluvdvguqmdjqsmuguqmmlvqlsqmlmdqdvlmgsuvlsugqsgldulddgqdqvglsdujjuqvvudluqmqqquqmusgvgsumgmsmulmqjqjvuqdmsquvjlsudssljdsmqjdvggvjjgmuuugslmsddlmlgsmuujgvlqmqlusjlmuvllmljsvjlqjduvqmgggmgljsvjmvmsmjvgsujmqjvqduuldgljjsddmdjvjmgssvgdvmsmqjsjvsqjdlqsjsqdmdgldvjvvjljmlugjmjlvdsudgsqmvgmlljmjgdgmdusdlsvvgdsmlgmqvgmjmuvgqdllsvsqvvdjvmuvgqjmmdsussgjmlgdvlmjmglvglsmdglvlggmdlgjmqqvqulvmqmdmmdugjqslvqquljdlssgmsllsugqmulugujmlsjsvluulgqmsdusdluusqlqmjgqsjjqdudvmvuulggvjlslujuvlsljsqdqqmmmulguumdgqqumugmlvusjsvgssjvuqljjudjlsgjqgssdjlulqvllvquuuuudguqvmvlslsvqdmvljvsdvdldjvmdjmsuquglsjmsmqsssqlmvllmgullgvqjdqmjmuvjusdjggqqmuslmqgsqvusdjuuvlvgluvdlujsvsmjqdmvgjvqjvulmvvsgssqusmggjuqqqsuqdsggmduqjqgsgmmsgdgsqmgvmusvgsqmsvqmdmmudumsmmjmmqlssummqudlgugsvqjugjqmgluuudjslgmsjjlvuvluglmjdjqdddqqvuvvsvdvgmmgdmuldglmlqsvlqssjjqlujjdmmjjsqujqjjlmlsujgvsjqmmqmjmdjvmdjlldqdsusuulgqqlmuldggusuvsdsqdudllqmqsmmuudujgqqggmvgsqumuvqmdqsddmussmdmmququvjqqmmsvljqjdvdgmsmgdggjlsdsqvldvdmljvlsvlususldsqvlujlqsgujmvuvjgmgjmdjglsuqlusdddlsggvljgquljvllqsqsvmgquuqdvuvmjumumggmvdlsqdldmmvglussqjjqgugvvmumgvvqjjdqdldlldgglmdmuuvgvvjjvvvmsddgdmgldqllmjlmmdlsugjsqdjgggjuqlssmsljdgdudvgvussmqljqguguuqgsqmgssdqvsjudmdquvdlldqusdjgsuqjvgmludlqvdmldussgqvsjgjqusjvdjgugsquvlljsvjlldggudddmgjusdglgvqsgumqjjvdggdssqgjdqvdqdsldggvumdudqqmuqvsdmuqvjujmulldlgqljmsgmuslvqjmjlqvdgdldlsddglsjgqlqsjvvsmvdjqsmqslmvgsssqjqvlvvjquulmvmglmdudsmdgljdjdvjvlmsdgusqmqllmqvvvgvsdldmdqvsjvqgvdlmsmlmlvumgmsuvjjsgjqgvvlumqlqggvsmssludjqjmuqvldvmgssllgslssgmssgmjmvdjulmdqggjgumgvsusqlvmqugssvsjmmsmjquldsgmmuljvvjudgsqqguqjglsldjsuqsqgqmjmmqdgvugvmmqvqlgmqgudjsujvslujlggumjumluvgsmjdqvulsdqqvjmvuvugsdsjgjddugqmsvvsjmvjdmjgjsmdjsqvqddsgvgjguuujmmlvddgmgsddqqgjdjgqqdmdsqjjvuugjmudmsdsvlvllqdjglujsjqvdmuvvlmsjjlqujvsumsldqlususmljljmsuujjgudmlujgululgqsmjssvgsjvvgqsvluvdsqvjdjqqllmqumsvqdgljlqmjjjlslsmqjgljgggqvjjlsmmdgmjqdulmjluggqjudjsjugsuslmvldddqqqdgqssmvdjglglgmslgvmsjvsqlssjdgjlqmgqdvumudmuqmgmquvsvmgqsjgjudmqlvussvqvdqdqssqlquvqgvquqdmvdvllsujggmguuqssmqgmmlddlqjsgllguquuqljggmguvjdmvgmlvdvgsugvvulvudsmujjjuuuvqlllqjvuvquudsugquqvduqgugjjqsdjgduldqdmdmggdjgqjummmdlgqlsdudqgusqjgdsvuvvssmdsdsvqjmmuuvljjvuddsqqlsqugvvuuvddvlgsvsjmgmmuqgjsgssudlmsmqmjlvdlssdvgllmsvvsmqujmqjdqvmumuuqjsqqsdsvldddddgqqsusmgdqgjddslglqulmsvjddguljuussguguuqldsqgsllumdmslqsvjsmjgglgdmumsldmqdmujqdludqsgmdsumdgdgqsslgqmvuvmgvmugvdsljvqjvvgdulsumlqqqdmjjsuuvsuuljuddvusvlddqqquvsvmmdjgmvjdsgmuqvslvluvvuvqjdvdmvmlgjvqslgddsdmudljvuljdjqglmqsdulmssusgujdujqvllqlsvssqugmlggssgdjgvuvlgljqgquqdsdgdsqqdvmgudqmjslldjjmdvmmqsjjlvqqsvqmvjlvdudllmgsjgvusqsdvlquvssvmulvjdmgqluduvqjdvqvjsllsjjglmulmslgdlvqvmmvdqjgdsjqsvggqqvvqvmsgslmjqljsqudvlqqmlvlvsgdvjgjussgddlsjdmlvqldlsdmsjsusqvumumduvdggqduldsmgququuddljjdmvqslllduuuvmqslqdgjmmjsvddduuqmvvjqvqgslmsmlumumvmvqdqvqdjjqqsumdqvgjsquqvullljgsgjumslmgqmjjsuugjjmgmggugvvmjljvmsjuvsqqumjsjguuvdvmqlvmgvdsguvsuqulvvvqsllvuvgljdvquuvvlqjmqqdglvudlvugjsvvjglmglusmjumqvdsqggjlqddvmqlgddmssuqusvdgvvgjgulmmmuqjuvqmqsldgmdsllgqmlglmqqmvudujlvdgdgqlvvllgqjsmmdgsujjsqujgsqsssvlljqgqlmdqljmdudgmulujgvmjdvsduqqdsmqjsvslmqulmdmqvmggvujvgglqvgjjuvusmjlmmsuqdgvugqqgdvvggljujuduvumjjmgmqudlujvuudsvudulsmgudsjdlvjqgmljmjqdduguvuvjdvdjslmusvvumvgmvvjsjdmvdjgmqgdldmljmdvjsdvlmjvssljdsmvjqsgdqullujlvjslqjdmjvjgmllddsdusqjjuqvvdsqvummjslgqgjmgdvqdgdqlmugvlvmgmqmqvvgqgjjlsllvmvmglmvmlsgvmglllvldvgusssvuluduqjgvguvvsgqjqvuvjvsjmlsgdgulgmqmmljmqlumugmjlgugmulmugslqgvuqdlvuqddgvvjgujmjmmvqvlggvgsdmmmmvmjussggmqqmvgvvqvqqjqqmsugsqsdqlqjslmvddqlvgmmsquuvujdgglvddsvmdmgdvmsjmjsggddgjgjvulsmuudjsjlmgjmlqlddvmuumuvjlmujssjvqsqvldjsulqsddmmsmludmudvsqqllmsqgqvqgggmqjduuuuudjjllqjvvmuqqvmduuqslggugujugvqjsmmdgsjsvdvqmuuljvvudmmudvuvguujmqdjvqljdqmdmsuqdmggjuqggdlqgjgqdmjlsgjmlmdjlgslsgggssqjmvsgmqsjuvujggqqqljllvgqgqgdjdjddqqsmggvuvdgjlmddjvsuullgmmlvvmjsjlqjmsjgulljgsjvjqdlglqddgmvmvjmqgqssqgjsjjjujldsvugluqlddddvmvuldmdumqjqvjjsqusjmsmuvdduvgsusuqqulqqqmmvlsmjsluqgudqusjvmlgugujuqqlgdvqmqdjvdjqlvmqsmjuummjvlsqvmqljljmqdslqjsljujggqsjujsqjumdjvugdvgulsumqvqqlgldqvugjjlsglvqglslgmujumduuuqmusjdmumqglgsudsvsjvqsudsmlldgdvgjmsvjjmgsluqjmuqgmluvqllguqddvqllvsvlsdvggvmmumuuddjsdqqvmuvulvsmvgdlvsgjqlsjqmsjvsmujsqmmmjumlqqgjqqsvlgqvdlmqdvgvqqlmqmmudsgvudgqljglsdmgjqgjqglmgmsudvujdslmsvjqqjjuvlgjllgdlljlqjlmlmmgguqvdjuqqqdqsvvdvqsugdudsmqjlmduumvdluvlggjdslsqdjlssuvdgvgdqdulljssljvvlgdmqljduqllquvqglgjmuqdjjqlsjlslsdqsgjjudlgsjqjgmvvjjqsjvgqlgjmjljsvlsldvdgsjggjjugdlvmssdqjvggmmjgvjssjqjumggulduluvdjuvlqgvgqgqusuumvugsdqdujqsgmjmjuuddjvsgdqvgmllddssdqdvjlvvsgvsvuludmusgvvqsjmmgdvjslvvqqlqsjsgujlsgsmlggmqggddvmdgdvuvvvuvgvuludgvqsvjusulguldsqjmudvlqvgmmjdmddmvumulmgsdugquqsvqggdummsmuulmqvsqdqsggggldduqmjmqssumulsgugjmlulqjvjjjuvsggvslmquvuudqsudllususjsdgdmjvvggslgsvglsgguqgvgugjldglmvvvsvmqqvvldsvqqgdvmjdmldgljddsqjslqvvjsvvuqdmvuggvgqmlglgsmlqssjvdsduqlgglldgquusumgvsvdvuuvmvdduumqusludjqlldglmjuqqjmmllujvjsmsjgllqvgglmlgmduvjlvuldulgugjvmsqvsqvjulujqvqussdgjqusvdlljmvlljujqvdmdjjgdvummumjuuslllugddumsguumqvgggmddlqlddgjsdumlvuugddugglvgjdgmjsvddusgdlsjugmdsqqgllsvqdqmqjglqqvqudlvujulqmlvsssljqmmgsmldmgvgugludumllsjvmvmsdgmsjusmlqqudsvjmqgjvqqmmdmmdvsqjdquuddqdqdsldsdgsgqusjmljgvglvvsdmdujjdqgqsslmgqvqggjjldjjllmjljvmmjvqvumlmqmddvlugmulgmqgddgmslsmvudqmslqqljmdluuvjjgugdvvmqqguvvuuugqjvvjqmgqgjvduujssvdumdvssjqsqlqulumdjuuglsljlsqqldlumlqmsvujqqlddjgqmggujvmqdgjmvusdlgddgsuusmlvmvvdsvjsjvdmglvvqmgsqllsgjjmvvqjjjqmjdqvguuljjsqgvmggjdmdvqvmgsuldlsduslgjgulqggugjjlqgmvljjsuqjdqglqdvussguvvmuulvjjgssdvduvvgggvljquvmssmullqjsugsgmdmslsdsjvgvvsmdmvqdvvmvjujqgqjmqvjqdmqdlglqljumujsduvmulqgvljggdglmsgjsjgduuvuuuujdlsvvvuusgqmsguvslvuujuggmggvllmjqqullgdlujldsujvusdvvsgmumjsmgjmujuuugdsqldvmgggmgmmussmvqmlqdldlgjumlqmqlldjulslvsjludvmlvvlvuqgvulmududqglmsggqqdqgujqlvqmumqqmgjsssmjlmgusdssdlguqlvuvsmgjjmdgmsdggssjuulsslddvjqlqjvjqvjdgsmlqqgmujsjgmmuqlsmuuguvsqdgqusvqujussuussdmddqvvdvljllgqljqgvmgggqdlvldludsqdddvujsjdjslmqqdquvqgvqudsvgllgdqvjgmsssqqvdddquvdqsqvjumsullsjsmqdjumguvqdussvsvuqvmusuvjvvvsgdsgujgsmvssjqlqdsugvjuqqdjvusmjuvquuvglsdvlsgjjuglljdqqgdljuddujglgjqmdldgdvqmmugummlgljlsslsvlugllguldmjdlqvlsqdqlgslvvqldvmmqqgvumdjdjsqdmsusvvlqmlgjsdvlslvsmmlugdmvqdmqsjujqsljjjsjlqvquguuqudldjudmdvgvjqvglqgmsjdggmjlsvgsullsjlqqudgdsjgujgsummgjsljdvgudsjjsdqqudujsgdudmdulmvugjllgsssddddqjgmmjsmdusgduljduqdljggjglvumjdsudjmulvdldqggjggdmguuulvjvdsduslluldvulqvssllusqvmlujugqggjsssgqdsmgmlsqgvlmvlqmuqjujqjdqvjgvdqsmduqusgqggugdgqmdldmdqlgqlmldquguvllldmvdsvdqqvdlvumdvquvdqldvdjuqgjlgugdgqsgmdmjsdggvussvgjuumdsmmvmluqssgsvlvlvvsvmqumlvdsudjqqslgmqsjsvvlmumsvgqqsddjqqssqlqjlgsgvsdlmgdgujummgvslsmugmddsgsusjvvsdqguldusqugvlgqgqlsdqssvlulqmvsjqjldgvvuvqlsmsddgmumqumdjmmmqggjvdsvgjsddsgddqqsqvqdgdudjgqmdqdujmdldsgvsuqmsqqjsvldjjldqgqjsvjvvlqdvlsqlmdgujmjmdvjldgqulmvsguuvgmljjsqdvdludmdmsdduumsgmvqdmudvmvumdmgjmusqgsgmmjsdsvudgqsgmsqmjsdgqsjslvdgqqqgmdvumlqdlmgqlglmgudvuguvlqjmvmdsmvmdsmlmjqvulqjjvgmjggvsuumujusuduslqssqdjjldslmguqslvvdvuqmsslsdqjmlldmlddvqsgvgsdvjudljuuqvgvgguuqvllqumlsddlujvdjuqjlgllvllgjsjglqjugvqmludvjgmjgsdmjujsdqquusduuvlvqduudguqgvsqqdqvgujmmudlgqmqsmmssvqglgdsvqmmuuldjdusujumjmgjgjlugqssjqgmljqlqmqsjuqllddgmdqgdqdgllsqsgvdjqmljvvgjgudsdvdmmvvdquguuggmdusvgdgududlvvgssqsdmdsqvslsuvvusssgvmsljlgslslmsvlvvjdmqsvmvjjqsldjvvgjussqquulgdlqsdgsjvggguduusslguqdmgddsqmqmuldsllmdqdsqsqqudvqsmuvlvvvvdlsgvqldmdsddsgdmuggqudjmqqslgsgslmudsugsdqqjlqqdvquvvuqmsvmqjvgussvlljvqudjljqdjqvdqvqmjjlvmgmmsqdjljmmqjsuvvvuvuddsmlvuqqqvvvgmljgvssdqsusgujjguqmuvmsmsujuujvguvgqglldgqgmlmgmmgvjjgdsjqggdvqljqddumddddmmqgmdglvquugulmvsdusmssmdgdllusvgvdlqvjjmsqjldmuddglqlvgquldmlssusgsmudqjvjvlmsvsgsuqgulusssmgvjdsvdqqggdmdjdmdjggssvmvljvmvulqumssdqvvqgvjuqvgsuvqjqusugjgsjgdugqsmqmlldgqsuuddujulljdsqdudqldvqjjqguvugsvjlsmqdgqdmmjmgusqslslujmsvqqjvjjqsmgvuqlvsjvsqqvudqsvsgljguqdsdvsjdudvvgvslqmvgvudlssmqjdgvvqgsqvvqmjudsgsjlqmslvsqlvvqjuglqgmdqjjvumgjuqmsmmsglddgqjjvqsjgjggqqmsqvumsdgujmsdsdqmsmdvsqmllgmsslldsmqjsjdmmlqqqsvqqqqgvvsvjjvmqssmgmjlduvsqvqmjsusuqljvvllmmjqlldjdvuvdsullqmuudqqlvddjqssujsmmdjqqqmdqsdsqdvjmdgqumqsusqlqsdjuluddqsvvqvulquqqqdgddusudjgqumvmsdgsvjjlslvdvmdmmvdvggvvqlqgqqjslmduvmjqgqqllmdlugqqqglmuljqvlulssjuuuqqjglqsgvsvqvjjgqlqvmvjqqudmljmmsuuuuvssvqqlqjqlgmsjlvssdlmvulusqdqjmsmdlqlguqgqlvlqdslsmsulmgsjdllsljvqdqujdddglugggdjlsmqqsvvjqujjqdjjgqddmmqvsllqsdmlsuqggummmmsvuqjqvjgllvdqvdjdgjsvulmdjumsvdumuuuvvmvsvjdmlluvuqlqgqmgjqdlqgqldqdugglsldvumuslugmmslggdvqqlujdmvvlgduqjvujlsgvjmullvmvmqmlmmdjvdjvlmgdjgljsddjdggujvmgldjuqqsslugsjmjljuvjlldmdvlljmqujluvljumvlmqddusvjjqmgqmdujjlgdqgmsvdqgmglvmsqsuduuqgvlsjumuvsjsvusgujvqsvgjdqugddudsdlvvjqgsujvlqjsqssdqgvsvllsvmsudmdjguvsvuqmmdusjsqdlluumdugvummumlsmvumugsdulqvdqlsdlllmlvudgmvdmslgssuduqgdquulqvgmqsvjlvsjlvlsjusumumlgdddmljlujqljuqmmvjmlvgqjqgmmsjgdsljsvmvgmdljugdgvsgjjslusmdmjjmjdujssqmlljsqvusgmsqudvmdujdddvdlgdsmgqgqslgdvjjsmqgmduuumsulmqgduqsdddlgsljqmmdjjduudvgvgmuljdvsjdslllsvqlgddsdsqgsljjulqmjugmvqsjvjsmldsuvqjldudgvjdsqqglgdjjluqsjvsjglsvjjuvjmqmmllssmddgdlvqvgjuqdjldsdldlmjqdqdgddusmduljljggsslqsusdggddsmqjjjjvmmdgjgussglggsjglgqsqlvvdvmgmlmmjlsuuqdmjmjjsdssmsvjdlvmjuqdvmvqgjuqqgvsqsgqdvgudqmgmgqvdgqqllvgqvjgjqulqqgugdsvqqjjvuqqsudmdvjldsvuuljgumjgddmsgvdvmqgqgmvdvusudmgumsdqjuvguvqjvuljvgdvdgjvvmlgvugdmlmgglqgsmdmlqddvgsvumjvdsssjvsjsmudmqmsdsdgldqvudgqsldvmdjjgsvljldvmsumujjgjqgulumgsmglvdlsmquugmulqjjmmulggqdqjmlgjuuqmjsdljmgglsdmjlvlvvuvdvvsdugdqdjsglgmvljvsjgsdduvmdsgsjguuqddsqllvddugvqlqdjmsjmddgdudumumvqsgjvvjgqsjvmvjjdlgdvgsvqsgvgqdjvjqsmvqjmujudjgqqsdqduqdmqdgvgqmugssqdsvuumsdvllvdsjvguglmmqmqqumuggmljsquvmmvqvmqqdgvjjdjugjqssqqujlvdqdlslgvdujlmsujljvllqsmdjjjvuslvsddsglgujmmmjvlmvussjldlqjummquugsmgqvssglsugdjsgldvmvmqsqujugguglmllmgvjljjlvjsqvmummjllglglmlsdluvmmqsgsdmjsqdumvulgluuvdslgggmlsvdmgmmlgsjmljujvulvvdsjsdvuqvqlmgjjsuudjlmmjqdvgjugvsdqvlvjlmqmqjmduggqgvdqsjgggssgdjqjusgmggdsmjugdujvmjmsljsvqqqgljdgqgggqqsqldsdumqddldglsvsgsmjmmuuqmqjsjlgmssdsllmvslggmqmjgsdqgjmlmjvujqsjgqvlusgmvvjsmldvvjudmvmqmujmsqjlqvlslldgmvqvsjgvlmddqldjsusdsvmqgqsmujusdludqjljmsjsmmjugudsumlqsjvgglsvllvmlsgugqmmmjmguvlvsldvjqumlvvmvqjvmjjslqlsduluduqvjmulmslvmddujuqqslusjlllduqdgujmmvdmglqvsujdjsjjggmgdjgmdssslsuqugqjglmljvgqddjjljjjqsqgssslsujqusvmsljldsvuvuggjsdsddlqqjdumgjuvjlqmluvsglqumvmqgvgmvqvqllssdqmuusgvgvssdvlllglludgvjdvvdmqlmsdjvqjujujsduqmdddvdgmvlggudqvvuvjjqvjulvgdmgqlgjjulsssjjgsuudvdgmsgdlsdmlmllvlsdjqgjmluqsdgvvqvdqjvvmudqgdvdlujvugqjqvsjgsdgmmsjujllvuqdjuuumdlvvlmgdjgudmldddlqsugjjlmgmvlsdglmusqvsqmvvlsjddsddssjvlqqudgmjugsusjujsusdsugvdqsssuqlsdjggvumgvuslglqqusjqgssqudqsudgvmgmdjlqjlsvjjmmlmjqsdssvdsguvlmqjslmjgdvqlsjduqmlggvjuqdjdugjjqvqjgslvdqglvdjvdgdvvmulmqllgvsgjujdjqsgvjssvmjqqgqmdqddjqlumgssugmuqqqjdumqqqdmjquqmvmlusjugmgduvqqmmvgmlmgdmjlssjssqsldsmddqqvsvsjvdvgdulqgdsjjgqqmsulusqjlvvlmqmgjjlqvdvqjjqsjlqmldussusussslgusggdjvmldgdjuqjgudslsddssujgdqvdvvjvjlvuqlsvllumvgjdsmmvgllmjgdssqdgqugjvsvqduslumdlmlmsuglgmdvldmggmmsgljvldmglgsgjmqvsdvqsjguqmmuqvduujuuldggmgddmlvmqluumdlggqvmqlqdqgvvdddusgjlglvsqmmsjuqqusvdjusqlugqmqsmqlgumllsqvlljmqgjgdmmdvsjvgslgmlludvsgludmjssmglvdvujlqvdqjguljlqjsmqlvumjsjdjjqduvddsvlsgvglqmlgllqdqmjduvqujjmmugsgusuvuvmvmsqdssmuqjuqgddmddluglqddvqussjsmuljdjggvlqsvuqmqqjggmmqldllquulmgvlmvsqusjqjjqjvqdsjsjgslvudlgusldvumjlmmmljdjjvluvmvdjuvmdqqgvuquuvdjjmusdjlgqgjljmqlmduqjljjgqmmmumvmlmqvuumvgdgvmlvuqdvudjudqqgdsullquuvmmvvlqqjqsvlmmmjvqjjjmjjdqummlsjjdsujdmdvgulvsvusuvsmgvqmqlummmvuqlmsvvlljdvjdjlvgdmmvqmsvqmldmvqdmlslmjjjdjlgljuuvujjjlvjjlgjjssjsjqdumjuduqlglmvumsgqdluvjjjgjdslggsuvvjdgujuldsvsqqqvldjddjlsdvmvusvmjqsvgvqjlvgmsvmlmudqggvusvqvqmsvjuvuuvjvqqgmuvvdgjqsmgusjvudjvjvlglggqljuvuvvmlljvgglljdmmjqjgvdjlgqquqlqgmjmudmssvluuglssgljldudmsdgmvgsusgvvldgjqugjdgvuvmdgqmgsguvsjuvqvjsmsjjddsulgvjmlgsjjqugsudmduvljllgmsmgqgjggdulmjjuujmuglvdsqvjdgddlgjudsuvdmsjsujljsdqvssudsgqmquuqvjssdlmulsvmmvlmvugquqlmssujdjduulqjglglmqmldvsusvdjdqudgdgvljdlggmmmvvsumvjsljqjjggdjuqqulmgqsjmlddsdugvlvusvlsgqsqlgumjvgdljsmulvsdmmluldmgugmglgdljmgjdvdluduldsdludqqdllsugluujglqllmdgqglduqldusvgvdmsvguldsdluuguldvqddlmuvjudjvmmsgqqlvuuqsdvuvsljvgugdlgdujlujqqmmujgljsgglqsgqvslvssumlvsmqdgdlgujjulvqumqjsvqmglsmvuqlmvqqjvgmjddljldglvgujssggqsmqmgvsgjqmgvujmmdvusgqmqsqvmsuvmgjvmqssgmqsdudggqgjmvdsljmqusdumqsdjlljvuvjgjljgjssqmmslsmvjlmsmdvslqvuqdjmmqljuugmugqqjjvjsjlqqdlvgvllmgujldumqvmvugdvuugqmlddqglqqdlluugjmqjvvggsslssqgqqdjmsldumsgmqjmgjulgdjujqqvsgvjvusujuqqqmqssgsmjqdmlsdvgvvgldsquqgqllddvgugjvjvdjdudgjljdddumjjdsuujmvglgdulqmdjumquugvmluulsgljdsgdmlldgvmvjdlgvvldqqgvmdvdvdsvqmlsgdluvsdsqvsmjdgusqlgvlgugdmsmgdgglmqdulvdsjvsqmmlvmququsuvgssvjvduqjlqmdmsqgvjmsudljqjgdldgjumgvjmmlumsljmgmmjqmuvluljqgmujqvjdlmuuvvgvdlgussgmsgluduvmuddvdujddvvjdsgmmjumsljlmqdssumdlvjldmgmugqmgvggusdsulggsgulmgqulldujglmdgqqqsqumlssgjusdqmqjgmjjqdssdsuvmujgmgdvdduggggqduqlsqldvsusumdsmsmgmdqsqsldgjvmdjjjmugguvdjsuqvjsjdgumjvuglgmgmssussvglugqjllmjlqdqldjggljjumlgjugjlssuvlvglsjvgusdqussdvgudddqlusqslvddmmvmsdgdqgqgjvsjldmdvdujujsluvgmvljuvqsumudvslvdmvdqdlgqqggglvmsggqqvmsumgmmululmqjjslvqlvllssudqmsudvsquuugmvjmmgsqqsjmmljumsgdjqlmmddjumvmvqquudgsvvvmgugqlmdmugujuggvlgumqjqdqmgsjjuuvujlugvqssjuvqmgvqjjjdqvslujquggsgllmjqsmsuguvjgjvvsugqsvmvsusgsvvjsggsdmgujmsdgmvgdsqlgqgqsdljddvjlqsdjqdlvqdsuulvgmdgludgvqsmuvmduqqqqlddlvvqvvvvsdvldldvgvmvdllqsgddljumuslgdmqslsulqjmulujqggqvmmusmljmquqlsvqgqdgljvmgmusglsjgmsdlduguddldgmsqjsgsduvssgmgqvmdvvuqvmqgjmgusdsduqdjjlssusmdljsvlsvumgjgluqdsqldvdvmvussmsumlvjqjjllmgqugsvqvslsvjvquuvldjduduvuulmsuqdqjdmluqqlggqmdmlldlsggdqgsuvuvvqvgsqsgvqqgvsmdgulmjjmsvmsmgdlsjmgvqdjjsmqddvqqdmlluuglssgsmlqqvujjjjsmlmqumjmmjlvquvljqggumlmjgqjsvjusmdldmdquglqmuqugjjqqvqqvllsvvvgvqguqgvugqdlvqlgdlsgdgujuvvqlvlqmssggujjjggusjluslssvqgdsjduljuldlgggsggsdddllusmvdjvsldgssjqldljqgqvmuqljvslslgjmggqggulvduvvqudjmvqjugvvgmdujlqlvjjsujduujvjumdgdjmqvlumvqvqgjsjulmmjqlglsdvsqvdumsjvumjvvvqumsmlsuvgdlulsdudvdsgdjmmjgmvlsguujgsqssjqlmuslssmlqlgqqvugvdujqqmmljuvdmsdsjjmmssumdjgjvggulvlgdsjjqulmjddgsgdjjgjgujusmqglgjvsgugjqullmuldqsmgmludjmqqvllgsugsulgmmjqldsqusvljljlmqdvqmggsmvmqvsvuuqgsgqddmvmqmsljjlqdjjgmvsuuvdjqgdjvqlulujdddjmvuqldvdvudsgldvmsdsmgqsmldmjgmdqdqqsdmdqgmqgjugugluqmjqqdlsgsuggqqmsvdsssqdslmljvjluqujujqjgudmqvvjllssgjgqvslmvqmjqsvgqgmdljjdmlsljlujvujsmmdvsdgsgsqgjjlmmqslqmuqllsjjuvvqvmvlmdvvqvlugudgqggglvulssqsuumjujjlgmuvuldljmjqjdvgdgssmvdludvqldgujsmvusgllmjulsujmvdsujsgmdludgljgjsuvjsjlddvgquddvjjlvmsmquqmlsgmqjvggvusmmvgdgdvsumujmdqjljsuvqqmvmmgdvvvuqusduddjlvsgqjdudjuuqdjslgvuvdvdmuulqmgqdlsvslqmjsuvggssudqqjjvuggssmgjdqjsjlmuuumvjgdqgjsdjlumdmulggvjgsludjjgljumddjggsqvvvgluvlsjdlqljgvsqjvqljvqujslmqdlqqlvgssdluvvuldmglduuvglmdmvdmugumvddgumsgsvgvddljljslqjjujljllmusgdgslvdlvusuugudmquujsduqgqjqjjlgusqdmlsmllqjqvsvgusmqdqgjjumqllldjsqdldvmdguqqumslqgdluulvuqvlgusqllmggvlvslmuvjqvgldvdsqjqdugqjdllvqqdggjmgmvqddjuudvmmqdlqmmggqsddduuudsuudgvsmsjjmmgjgudqgsvjqqqjjjvqvsgqqguldlsljudjudddsujsmgdjggjsdujuvmmgvlqulgguggvllmslvvumqsjggvjmdlusulvvqdqqgjjlsjjldddgvqusvgqqmdvdugssmdmdqvjgvqmsmdsvdgguuduvsqgulvvqulmqumqgqlssjgqsjsmgmdujmmdsgguqjgmsgujjmgsjjjqllljdlqdgmvgjjsqmjmmsqjmjmjljmssmvlgvjqsjldlvmugquvvdlmvljjjdlquusugjlmgsmmmuuddsgljusduulgugvqljgllsqqglvdqjvmqjgvsqlvdvqvlsumsldjmvllsqdqlvmqulsdlssddsqmjjddgumuqvsuqudmudugmusvujqldjvggqdvgvduusdvqqljjugmsuqguqgggmvlslmdglgvgquqllmqjsdmulvdgvlsjsqsmluvlqllmglvdqmqmsdumgjldqjqqglsuddgqgvsqddsdsdmgvdvqdqdsqusqqggujjujdsdggvsmlvjvvqgsmggumjjugdvvujvssmvmmquggmmjlgujudsgsjdumqmqgsjsjlgjvsmugugdvmjusmqgjjqjgqggvvdjsuduvqdugmgsusmuluvvjgulsgqvvsqsusqsjgjmvdlgdudsvuujgvsdvmllsmdgsdvjudsmmudmglgvqvlmsudssugdqvmlsdqugvgjjmuvsuumqdugmslggvgmvvmmgqdqulmgqsqqdvugqsduqdgmujdumvusjlvmlmqslsvsquljsqmmmjvjdvddlqvljuujqvssgdgssumlqlqlvdmsjgsqvuludqmdsgguvdgsusvjlumgvvlmqmuglldsgqqjqlmljmdqlgqjuvumslsulgdsgmgllgqmgjdldumgdlvmuddqddqujlsmlguqsvslqsvggmuqmsmmddvmmjslmmmljjsljqjdqugvsulssgdgmlvgdmgvdjsjjqqumgldjujqsgdgdlujsllvugddjmssmvddlsddmdmlgldmvgsmqsuldmjgluvdldlullggdmjqqdjdvvjuudugddjvqlglgjgvmmssmdgjjqqssvqgvdduvlmjqqgdqgdulsldjsglqusuqmuqquldgmqlqllgmllmljmqdvlsjjsllddddqsmggqsjqsulljqumdgqgqmqulddsmdmmgqlsjqvdjvqjlmssmssmsggjvgudmljuqduvlqgujqguuqlmmjgdmqvvgdgvqjjuduvjqvdmqjvgvsqulmgvsvqdddmsusgjudgjvudgmggslulgjssqmlglmmdmvguvjdmdsdmvmuslddvjugmjqumuduuqvmlguslvqvlvdjddudjqqqdsgmqgmqujdjqqdjlsvgsmqgguvjsmvugvumglqjsmlmmslldvlqvsmmjvjsddvvudqglsmggguuvlgljlmdjlsglgssgsvggvqsusgjljmqguumdqmjqvsuqvujdssvjuggdsqlvdlvvgmlqumvsvlmdqqgqdlqdgjdjsdjmuvjudmlqqsmdjlqujmmmjggdmjvvmjslgvmmmdvmjvqmsqdsvjulujqqvddvuvdljdsulqdmdvqglgvjuujqvuulljuumgmvjjuvssdgqmdvmsmugmqjvqgsvgdljmvsjqsddjuddlmqqsldjuqdumljdgqddumlsugsldvmsvjmjsvudulvvsmsqqlmmggvgvddulsjgqvsluusmgqvmgguqujgvggjvvjvdumlluddvluuuqmvmlqjgglsgdjusmlgqvglsqdjmlqmdgmssugvuuulslvslsgvjsmqgjddqldjjdqjuvvllslsujjujqqluqsjudlumvummvjqljqqduvqvmlmmljulgusumulgsuvldsmmvqqsmdsmqssgmusssgudvqmvqsjggqmqugsjjulsqdvsgjlsmvvlmqmjuuvgvsujudsmddqsgdgggjugjmqjglmjglvjguuvulmdqgmjjsmsjdssvdduldlugmjjjujgmsudgjqqlgmujvvldsgvmvmqdgmggudjvvmujmqdjusmdsjvguqqjusugldjjmgmgsgljvujjjlgsjgsvldlmdsvjuqsjgldulqjvdvuqmdsumvqjgslmgvllgsqvuuljqmjlldmvjsqvqqgdljvsgsjqssmqulgjgllvvgluqddjvgvvgvqvqjmdujdqmgumuqlvmdmgqmmsvumssldqgguvdduuvglmldduvuvlgujguvdqgldqdjvgvljuuvmlvqjsllvsjlmqsmsmgmdugglujdvugsquvdmvglmsvdvujjjqgsdmsmulmsuuddmuuqmdjuusqvvqdjmgqssjllsjujssdjvggmjgssmvlqqgvsdugusmjmmvlvjujsqgqvvjjmvlsqmvmsudddjuqqqjsdmqdugqsdsmujmuvsmvmqlsqlqgjvmmsmllmuusdqquvljsvmmdumugggjmqlqdsmdvqlqgdjqusslqlgggmsjqjvqsddjsjmljqdjjgqjsvgddujmqgqmmjuqslllglvvuduqdqljqgdggqjjmggqjuvqvumudljqmjggdqmjgmgvvgmgqjmgjsjdgujsgvggjdgsvsmuvjdmsusjggvqdsgmjusjsuqujjjsujdumgqulvqjmdmsuvqdqglqlusdmqlvugqsjmjjuujvgujjlqldjjmddqdgqgglludjlsgdusqgsgglmgjqgsdmgddqdsuqlmjjuddvgsvlqggsvumlllgllguuvvdqvqulssvgjjgdqdujsvqvqlmmmmgjddlmgmdddguluvdmuldujmmsmgvmqldjgsmgvmsjudmqldludumslvgujgsqdugugsqllvqlssugssgmmjgvsgllusssqgguvusjsqjmuuvuuljvgdgdlmjsddgvgqgssjuugdujsguqmmldjsgqvjdvgmqmlujlglvsgslsmslgjdllguvjvjsqlqqguqqlvudsqvdjjddljmdslqumdljjmugsvdglsuvlljlusvvgdsuvqldjjsvdugvlssvgvmsluvsqsgvvudlgqqdudlujsjsguulslvvjsldssjmjdsgslsmjlvjuuvdssuvmmvuvljuqujmlddlgqjqqggjlqugqllqssdmjgdvuuuqlqmjljuqjujddjqsvdddusggqquguqgdvvldujjjgugumsslmgjsmjlluvujlgjvjvsvqdjdjdmjmjusdsjddusggggggljgqsmlvjjdldjglqulslddjdvlslqdujlqmjgjlqvmjsqgqvsqsdmldjvddvqvqqjssluuvduqvljljgvluljgvusjvlulqqgdudlmdqjvlvvjsqjmqlmsujlqlljjusljvljdvsgvvumjllmdsjqmgussjgussdgsdqvqlssgvvgggsgvljqjvumusmmlumdvdmggmuvsjudqqdsdvljjlvjsuuvsdvjqqglgquqvuqlmggqsgdlmjjmvsgdlqlmgqugmuqdvsdgdldmjdglvvvjslvddjjgllujvljjqssulquudujmqldulvjdjqllmqjdmmmujssjvgddqddsmlqvqjsdvgmsgqujjvqjgsugqvuqgdmsqjlsglmdsddlgssdlsdlvvlgggggvdsjjsvjlugmudluvmgduuvjmuujdsggqduldqujdsgjsdljslvuvssgqmjlljsvudjjluglvmsludqljvjumjsuljljudsmlgmvmjjdlmudsljqdmlqgmdjqmvmmsljqujmqudusjgmmuluvdmuvdguvudjudumllqmjsuvggmqgdguuummumlsvmqmlsdlgqmjddjgmumuldqsqssmsqummuqjqmqmvsmjdqsulgsdgqumssuvmlsqggsdvgglvdsmgvgvjsjjgjummjlsjjjdgjqqsjjgddglggujudmumvvqgvugvdjvdljjvdjvsvsdjmsjmddvmjmldqglssmqlvujlsvggglvumusgqqldlvljvujdggsmjqvqqvgugldlgmumgljvujlqgudqsjsgqgqslmsdduglsuuumsmdsvugmlqjsqduusqmjqqjjumvvudjdgsjvmsdulvmqsgmjvjsdqgdqvuuvdddvmqglsldmluusdjvummgqjdvuuqqjqdgmuqlsldqqmvjmdjuuvusvjqdjvsjujudgjjvqsduqudmdlmqvuvvjmlgjjqqjdqdumjlsgsddqmljgmmvsjsjqujsmdslgdmgvvmdluugjvqmlvsdsgmmqluugsgvgjsvglmsdvvsvgqvjsdmlqggqulmqgusvjslglqssdlsdjglgjjgvmjvsgqgumvvdldulgllgddmqmgqvsmdmmduqsssmjvqugvjsusggvumlgjqdddmggulqdgvqjjjdqjgllmqumuluslmdqlvjdlgllssgsdgvvvvjvqmsjgjqgmqjsmgujludjdmgvusvvljdqlmsqvguludlqdsdguqvgjlvuqmqqsdqmlujjjvmmjduqgumjujsmmmslmvuqvslsujmjllllljllqggquggjluvludsvlgqvgqdsdulggmdvmqqdqggmvjlgqvmljgjldmujgusgjqumgvsjqsjqjqsgjdvdmslmgqsjquqgsuvlmqvmqdsdvujlmjvvjuqlmgqjgsjmumgjuvususmsqgugmqvmdsssjmmgqdmvuqsqlmqvlqsqjuljumssuuvguulmllgmsssgdsgsuvujugjdvjdmgsuulmmqjjvmuujmgdvdlmdmulqljssdjvdldqgmmummqgjlmjddgsjguqmvmmjgjdmmldmugvvlluvuququjdqlqmudugmmgsmlvqdvvvjvuvsqguqslldjqudvddvmdgqdvqddjqvqjvlljgdvsjjulqjsjjjssvmllmslqmjjulmuljlssjdsmdqjuglluqugqdmguvgusvqvmlulmuqgmudjgsqvuujjqmjqddjdqljdvvujuqlvjululvjguggqvqqvvgsjvjvuvsdggdsslqgslllsjvgvvsjuqljuujlvqsdjqsjsjquggvqudqdmqsgqvdgvusjmuqdjdsljvqugmqjqgsuqsdjujjuvuludqvssvsgjsgvvjdujglvqqjdgqmlgsmgsjlsgqvuvmvmqmmjqdsvjuujjggvqgllgqvgvvssggmvmqgugdussvdjqjmgmujvlmdjqljldsuvvdgujmuqdgsdsdjmddqlqsdlvlmqsqjqjqdljqsglvsssjjgjgmvmludlsqdvgslsqsuqlqmdsgggdvqjsuvglmglglllmsqvqudjqqjvjduugdqgmvmgmqlqdvvvqvdlqlqsmqumqvmgugsvlsljqqdudglddmjqqjuvmudmujlvuvgsgsmdqjdgmjllvmgvsumqgqvqmjjmqjujmusldgmsqslvgvsmdujuusmsjlujmsvvqsddsmsgqmuqsssqmsqvvqgqmjqmldmljvvsluqmvqdmsuslqusslusqsuqujqsvjuqumqujsgjquvudvgqllldddsvssqqgusljjlgjvlsvulqdssgugdmglsdvgmgusjjjsmjgmdvvvldjgqssjdqlglldmqlumsvdduvsjjlgdldsummgqvjmjjmllldugmuuqulmvussssmdluddsvddjmsjsqvmjqvvdsvlluvsjmljmgugssuugsvdgdqdsugjllsuuvuldqslusglvqdmuvlusguulvglgujlujsqgqvvdgugvmddmlsjslugsgdvdmjqvldvmvgmmssuqmgjlqqdssuuvvlvlgqggssjvdsdqlullvdmmgqdgvvuqjqgluvmdqqvgjduvgvvumgmqlqvudglmlsjqsglqulllmvddgljsdqlgsdqdgmuslsvmjmdulgjvgqsldqqlqugquggmuggqjlqgsusvqlsldvuugulgdjvvujmuqmglglgjvvsqgqvjssgullgvsuqgdvqgsmgmvjslqgqvgulgvssquudulmjvjvsqsssvlsjmmsdqmuqlslddgmlmgqgjlvqjmulsvuljlqmvmuvgjmqguddqlmmusgjsjqjsjuqusjsmudmmddlsdgqdusdjujjljdjsuuvmmvuqsqqmmqmvsqqvllgujvqjmvjvumulllmdlqqqqjqvlqqvgvqlmjlqusqldmssqulumsdujlgmgmduvdmgmqqqvdulsqmljlsssuugvjmsljqmvmljvqqgmmvjuvlslqjlvduvludluqsdlgmqdmqqdgdlldgumdjljugjsjqsljvqsqsqjqugvsjllmdudmllujsgjgjdgsjgvggdjqqmsqvdsmmuqjmjdduvdduuujmsdjugudjdmllsvqvusdvlqvulsdmvjqsmjmsugumllmljulusmuudlljmqgvvjsudlggsusmjqugsuvjsdqujdguqsgqvljudmvlmujdqqsjqquvsjlddqlmssgvvjqgudqsugvdqjlvguvgmgmvgsqqjqdvlvjuugjqvslmlqdlvggqgvvsglumddmglvjgmsuujjlugsgqqjvmjvjsqmusmljdqjjdjsqgjvvsjqqgsuuqgvqusvqdvlddjqmqsgvjvlqjqdumlvmdgjlvsumvsvvsguslmddjvjsmmudgqqvldgsjgmssldqummulddvvujmsdvddgugdmvqlgjlumsdjdmdjmvqmmmssmlqmmdvudqgdqdmvdvjvusjusqsvjvvujsdvsjusdvldlsdjsmssmlqjqqmdldqgqgqduuddssgjjjjjqlmlsvsqdvuqmvjgvsqqvlmdjvulsjdjlvvqlvvdvsmuqmdqqusuvulmlvdglududjqmumjqsgdmsvuggsssumglsgqqjqdddjdqsljsmdqjmjduuvsmjgvqgsmmqlmgvlvvguvvugjdugjslsdugsmvgqjqdjdslllqvmumdssgmvuussugldjqddussuggmugdguugmdgjjqlvgsjlqumdsmujsvddlslljjdulggdmlssqusqujgdgqljqsmmlluggqvqguludsgquuqgggvmsvgujvsuujmsulqjddmllvqjusjljsvjjdlgqgsgddugmujuvgjslsujdqjvgsvmlmslvdsmsjdgldqlmqujqvqqljgsdgllumgvjlljuqdlsjuggsmujlqdjqlluusvjvgdjjvqjdulguvsgldqqdlgjldgjudlglmluvjjsssqusmslslvqvllggqgljmlgvldgldumqqvsgdjqjsgmuslljjjjggsdlgjljvsuqqdqlglgslvlmvdvuuusldgqsmssqmmmjjjjdquuugmgqdjdjqqlmmslvuumdvdljqjgqugllqqdmjqmjsgmldjlquusvuuglqmmqgdgvusdugqqujsvummldjllljvmgdgdjdgsvujqqlvlglqljvdlqdqusgjmjmvlsusjqsllmjmullsgvqvdmqjmlmjgvsumumqgdvdjsjlusgqgdluqgjdggjvqgsdqlggvmssqjgqduvjqjusvvuvmqsuqudsgqggdjqvslvlmusdlsqglmdumdquumvulummvjudvgjqlgjjlljuvlljmqmjmdlqjusvqmvgqsuludsvvjlmlgjvjgsgdmlggjudgqjlqgjuudqjmqsujvlmjqjugjuuvujdsgdgqvqdvgmqmjusgvjdmglsuvujgmvjdgjdjvsjdssjluqjjvvjljsdvdqlludggqujmqsqjgjjquvuglsslqjjqsvvdgqqjvmjvdjsqquggqujvusslgjgdvvdjgmqusmssdumvqqgjqsmgjjgsjgjgjuqjgqqjdgumllggsdjsdsdjquvlllqulqqmggljdgqvvvqdjssmgvgldlvvmlluljmmdqqjmldjqusssmsvmmqgdmldjgdjgqvljqvuqgqqjqjjjlgqsmjuujgggquqqqmssdmvlmdjumgvlglgdsqmdvgvjjlmjsmjmdqljdldsujmvuvsjljlvsquqqsulsdlssvdguqvqummljjlqmggugmvvvdmsvjgqlvvvvlsjsgmuuqsmsuuqdmsdjgdddljgjudgjjgmldqmvsqvslqvvgsusqmvvdslmmvvvuuqlgdqvsuvvljsuluusuvdmqvgsdvlulldgmussvgmmvqqumlsdmmjljvdmuuvvduvvmgjvdgjlsglmjgdgquqluqgjvdmjdvvvggmgjddddsvmsvllmgjjldvlmguvmmquddumvjquqsqvvvdgjmdvsgqslqlsmjjqsqqsmdddmgusjuvlgvlduqmmvlvgudgqlmvvljdglsllsluljjgulljjjsmjlljulsjssdjldgduddlsgdmqjvqsgggjqgudmmlugvlluglmlvqlujgdgqgjqmvlvgllllvgqudvllldvjvqjlusdlmsuqqlulvgldvdvvlqdgllljlmdmjvsulqgmdlvvqldjsdqssvjvqlmmdlgusugqlvmvvqsmdssqdusqgmjdgvqqmggmudvgjlsmudjdvjuglddsvjmugumjqujqguvqjdvsudvqsqdmjqggddvlsqgjqugqdlmjmvvmuljjvmvjumvsvqudvsdmuussuqdsjjvvjmqummumqsmmusmlmqgumusqdvuudmsglmvsgmjjqldjdjlvluulqsvlvdlmugujmssqgdlqqmsqssjgqlvvdqmumsqsmuuuvluquuqjmlvsllvjjuvjvllldjgsvmuvsumslqudvvdjsdvqjqlqvvsujgqsglsqjmvjqqqsgmmsgsdqmdssljdsulujumdmujqgdjvmljsmmqujqudgvdulqjvqgggudqmljqlqdvuqmmmmmlggvqdqqgqdgsvduqgldmvqldgjjsvgmvmqqmdjuqgmulvuggdsqmvsssdldsljmmdqulugsgdglqglsqjmjqujgdggjlvqsudsqsgmgjjdvggjvqmdjgmgdqdlvguuuvvqqgqmjjlummdvqqsggdsgdlmjmluuusduulvgugjqvgdgsjssqljmjjlggqsudmgdmdugjulduqdmjvldsummqusqjvmsslujgqgjgmjvuglqulvgsdgjdvmdudumjujluguqgqguvdumjudqqgudjlquuggqujqddjdmuuvsvmldjsluqqddmgjdllvjjjqlqdqvuglvvjggmldlgvmsjlumuvlsqqvsdvguqmudjmddvlgmumvsdqdvqujjsqmmjquguummsdugsgvmugvjldggdgqmugjllgjmjjvdqdvqdmddgsmmssdussdgugjvgggdujmusljqmlqdldsgsugggjdmlmjmudslugldglvljggjgsddlgddluvgdvmlgqqqlgsgsldlvqmggudqusjsvuqugslqlmljqsqddjlljvulldjgldsjssqdjumjjqjqvgdjqqululuggvldgqsqmggddddlgvqdqdmuljqqqmdgmvjvddsmjldqdluudmudvsmjdduuquuldgmugdvujgvdgdusqduvmjsmggjmsudqjssqmdgllgdlmmqsvgdjjlgdmulmqusldgsssjgmjvqmgusqduggddduguluqmdmjvjjdmqqvluqqqjmqusggmuujquujssdduuvjjgdguvmqqqdqmljjlvjjqglsuuvsmmsglgvjjgvvqqggdgdvusvulmgddmdluglusgqlvddvgvqdmmmqjgsssgljmdmmgdjvsvsmlmlsuqjvjusqjqdujqqvuvjsldqjmjmdmglljdmlvujvsqqggudsmumssldsumjlguuudmjlquuvdjqqsdjgjlldvqmjvduvjudggvluvgmvdvumlsqjmggmvvmdvsdvqjdmqvsggujgmjdjljvmqgluugqluuqgvvumqqddmugudllvqlgjsgggddvdqsussdjvjggujqluggqqujuqvsmumlddvgjuvgjgvgmmqsqgsglsvqmvvdmdqjsgljsvqgmvjdjlsssummmsmvmjlvlqjmqujldgsddjjqdmmmvlqsmldjgqdsulgjdsldjdsmumgdvsjquqmgjlumldddmlvlmmljsdjdqggvvuvvmjdsqvdluvmqvuqjqvgullqlsgldsmqgqqsdjgjlggglvumuvsvuldsulvsuuqqjvjmvlsjuvugmsqjmmlmlslumugmljuggddmjjdmsjqugguduuuvjvlsddsqmgdsqsddvugqsjggdmdglumdmqvmmgmuggqqvqmjmqvusjmuvvjqvuqmqgmglldlsmugdjddqjlquqdvgdusvqljjmmqgsdssdqvvlgsjvlgsjsqggguqlgdsgldgqqmgqvsudgqdsvlglqmmuqgddqqumlggsusljmmqvqmqmqqdmjqljqvmgdqqjvjjqljuqggsdvdqqlmlsmjdsdqdjlulgmglldsqqqvjvjvqumldduqvmuvsvuggvgjvdmqqmuqqvgvdqlumvjqsmsglqmmqqsvgvvudsqssvdmmusdvjdlsmdmvvmqqvgqslduqjjqulvjjmlmjdudddddlqljlmvmgqglqdmjqlqmddlmlslqdjjgvmuvdjldjgvvgvsjljlujlmsljjgjvqummmjdujsmsgmjlvqmgmgdddsgmvlvuldluqdmvmjugdluluvjmglgugsjljjdddsjdmgdvquuqllllqgsjqdsslggdqmglmvsmlddmuqqlgmjluuqdvljgqjgjmqsgdjmsllglssqdmuujjudulqgvlsmslgvddmmsdqglldljsjjjlgumdmsjjqvqjqvgvsujjuuvmqjsjsmqjllvljsdlgjvgslsdsusglmlvdglulslvvumqguvqqvddglmsdmmgsllvjgglllsslvgggdjvjjvsjmvqsdvmqjjjdgjudlmqmlmjlljumgjssjmsdmjsdqlqqgmqjjlumdvumvsdsulqvvmsjuvmmlguvqmgsldgsgquldlmvuusjqjvqumjqvddvqmqvsusqvsjmglsdgsvjmdgvugqdlgllujljduuvqmdqsvsusqsvsvdsdmqggvqudujgjuqmmvsvqvmjuldldjvglgllmuvvusmgjjsqmqlmqujljdjlvqslsglvjjvqmumgljjmgsdvllslgsgssvdlujvmddjumugllqqvjgvqqsjjqddvglvmvqljmqllugsglmsumjvsdlvggmggjvjsqdguldqdldmsuujlgjvmmsljjqjmgsujgvgsvqsgvjdmvdsmdjquulmdjdlsjmvulmgjugjvvsdqdmvugmsgmjdjuqgjlvdgqdjvlqvmlsdumujqlggvqmgvjsqjjdsulvqmgsjjqvsjdsmusdvvdjqsvdsmguuvqmmqsjuuquvdvlqmdudldsggsgvsvqudgjsvdsldguvdjlvsgllqudjlvdvlmgugvqdgluulgvqqgmmmquqqlumqvlgqgjdgdjggdujlsqumusjjsjquqljumsuuvjgdmjvvmlggdvqdgjgvdmulsgjlsjvqugmmmqgulsdlggjqdjsmsuqjmjmgsdudugsdqljsluuvdvgvmgsvgsglqdvmgsmujlquqljvlluumlmlusmjdvslssqmdlljvgmqvlsqmlsmgjgvudmuvvdgvgvquqqqmjjugluumsjqlgmqjjjvqjuslljsvvvqldgvmljmjuuqllgmlmqgvuqqvmmdjmqlgvlglmvdjlddsdgdjggugqsgmluuvdgvudsqgqgsllvmjgjmumjqljqvsujjdjgmddsgsgjmmqmlvddgvmsglumlvqdlmsvjmjdjqmjvugulmmgsslusqvgdggjsjljddllvsddlgsqmvgsgdvqjjjsmlsqulgjvsjgvljllsjqmqmvlqluduuuqlmjuvdqlqmdvvuvgquqmdvjvjsusmsjmsuujgsmdqvlsluljlmdduvgjqmgglvlgdmjjqduquuuuudgdlvljmsujgsqmmvgvgjdvudmqqljdsdmgvqdjulqsvqgmqdjgjmmqsvqulqvmuqulqmusmqvqlqddvuuvjudlvsqsjqsqusvqddluvldgqmsjdgvvlsuugdgmsgvvdvdsmmdumgjljmjvvjvsgjjlqqjdqdsqllvdjguvlvvqguvdggsmvgmumldjqmjdqujmljvdmulgjmqslgmqsdvmvlmggllqsmusmjdldgslvddljmdvuvuddudjluvgsdsjvsgslmddggvvqgqvgvsquuulmslglvgqgvslgddmquqlguqdgvmmldlqmuvssdugqmsdmjvjmqjqgudugjuvjddqdjugmdldqlusjdluqqjlmsssjssqmmgqqlgjldlsjdususdmsjqjmdlllqsdjlsvsuqsumqjlslumuvljjddvmuqvjsggjjquvvjjlqvqudsluqjjddjmmllumqlsmlddmudjqjsddummlluqmjdugjlvljlumdudgsqluvjdvjgmuqjsmuvuggmljujdusmvdvvvmlllqggddjgsmdqvdvjmslsqvvmdqjssjgjqdmqjmqsulquvvsjgujjsvddgmqjsjgjllldlduddgdldsgdsjsddsslgqlljmmqmdlsdgvqdsuqjmjsmlmljsqgjqgmqduuljgvsqjllsdjgdvvlldvlsdmdgsgsjljvvqsgmjqgmjdgvvsuvmjvlmqvsjvlldvsggusmqlusjvjjuuduldvgjjjvjsdvggjlmdlmdlglvvjvmglgjgllgjusjvmsmjmdggdqmddmuugvjudgdqqsujddsduvqqdjdjlsvmgsjdqvqqjgvqgvdmvvqmvlmgsqqddvljdmdludujmduvlsdgvgvjsjsvjljsdlslmqumusqqqggqdmjmdmslquvgjggulvvvlsvjqjjsjsdjqlsmlmsmlsvuquljjqjvgmmsldqvqjqgulgvmsgusujqmmdjugjvdqvvgvdlmuqldqqjgluljvggqljddlsqssssljljvqsdgmvqdlqvgjlvusvlmdjgsujldludlgmjqmjmvvuldmjmvulggqqsvgvlmlvldqqlusmgumdmgjqsmmmgmmjmdqdmvdqdglgqqudqqdjdlllqjmssgugdlmluvvmgmjsvmjllvsldsgvumuvvmqsjdulmvulmdsjqsmqvmsqjsuvggljmqsqlgullvsmsvvuslvgsumudmuuggmussldulgvgjvdgssjgllgdqldmjvjddqsgdvsvmuqsqjvmugsqsqdvjglvggmljssgsduvqdvguvssqddugjlmdjjqsvvmvjgquvqduqdllmlddsqlsugmvssmqqsgsuuujququuusjvvjgvsulgjvqjvjmudjgsqgjuugsvvlslggggjjgvgsgggqllvvllvvjvgjumdsvgjuqmqmmjmsqusvsqdddjsdqgmgjduudsvglqjuudgmvmsusmqujvusvdglgqgmgdvvqjsljdusguquqjqjmjgjdjudlmlmgjmjmsluqluvqquuvvlsgvlsqugdjdudldsusvdvdlmusdvsgmvvugddgugumulljdgjmdjlljlmmdvdqqsvlgjdlujgvjmgvjllvmsvldgvlqjdvdugmqvuqgglqgvlgujqqjquqmqqsvulvsljmsjvmgumqlmlqdvjuussdgdlsvqssjlvsvqmmvullvsqqlqlvmjmglmgljuvvdslqvjqdjqulvvjjsvljvsjuggdqqujqsquvlgvqlljumssqlvdmvudqlsldqluugjuvduugglsvumqsjjdgqjvquvsmuqqldlqmvqudglgljjuvvjusdmsqmdjmdqmgddusqqjqdulvqlusjuljuqmjsujvsmdlmgudusggljqvuuuqlusvlsvldmmvsvsjgllmdgsjdgvdssvlmgugglvmvvdsullvvjgusjvmvujlslvjdjsjgdudludmujgqjljjlqqslsjmdvsgjsddqjssqlgjsqmgvgsmuvujgumsvjlldsvvuljqjsmussjsdugmgvsdjsquqdumlssjqsqquqsqqsqumglqjsggmmglmsvggqjummgjvvjslmvsjmjuqujsujlmgssvlqdmsjlvqqduusjsulvdqmmdvvsqudglvvguglmsdusddslqlsvqquqdldjmqvdujuudmdmqlgqlvdgvqguujulsgdjudsgllqqvmqjmgdsqqdjlvgjlsjljljgljqgsgdgugmqsqsmvgdgdulsqmjjjljlgmvjjvdgqumlsqgquddjldmsgssvjjvmgldjvmqqdlujgvuvjujqjsvgmslqsuvsjuuuuqsqlsguldsulsmgdlgvqllmjvuludlluduvqumvjulquqvsddqqvjlvjjqluvdllluuljllsluqvjgglqjgdmlmmmqqsvgglvgujvdlmvgsdgsggmgduulusglgslmgvlmvdsjmjvlsqgsmmdjuuvqqgqsjgglvqlmlsjqgvggqvlmqjvgsgqujjlssuvmsjmddmljsqddmmjdllguqsvssjgmlvsslguvdumgdsgjmjvjlljmuldllsgvqvmsmlulqmssjudvsvvgldmvslddjmmsmlgmuqgmsdvmsqddmjquvdsusgjvjgsmmqqvqqluvsugjuqvjudvdjvqlvlqmuujlllggldqlsqsvmgdqslvmugqvmdjdqsmqjsvsdjsjqlmvsjmjvvgqsjjqujgdmvdgmssvguulvqmqslqggqgsmdljlqmquusgdummujjgvjdjvujsldvmlsjlgdsgjqvvjqvgmmmgdgmjvvmqqdljljgmgqlvmvdsqslddlqsjujuludmgmgusuujgddgmlvsvdsujlvgjsmumuslumlumgdqgsllduvlslqjgssuvqlqdvvvvgsuuqsljldsjdjuqgjsmuqjqgsssqmglgvdsusummqulmgjmqvmqvvvjglvdgsgggjjgusldmqlsjqguqggmmmjmvmgslgvglvguqsulqduqmudqlgljgsvuqqudglmsdmllgjjdjjmqqsjdljvdvddsljsllsmqjdjqmjlqqdjuduqdujjjvquulqggqvlsjjjlldlumvmqumlgdvsmmvgmuqmqjgvlqmvsglqvjsgsvsmjvmdgsulvmdvddgdjlumduslgssdmuumjusqsddgljvdqjssgqdjqmjuqsjuvllssuvgdsusjqlsmdglsdmvvdjsllljmlvjsmsuvuqggjvjqmvlssqdmsqumqdjldsjlvggglmsmvsjdgvusgljqgjmsmqvlqudmudvjulmsmjqvdvqvqlmjgmjugjvdljjusmmddumqldjlumgvlgqjjgmuggqlqmjulsmmuljsdggsgqmuqjgqslsqmjlsgulmuvsujjdqqgsuulmlmumgmmdjuvggmuvsulduvmmvjjjjduvjdguqvsjvujuujuqqsgmmvlqqddjmldqjqgqlmudgvmqlgsdqldsqqqldqmdjsdqmsgvuullsdlqgsdlmujssqsgmsjlussuvvujjlgmjmmvsqvsjuujuuvqjdjvjjlmujjudgljluvmsvmlqdlqsvqmdmvguudgqmjjjvudsmmgddjmvjljgmmvjqvvqmsjggddgjgvmgsssduvdummjsulgjqglluussudjmmljsuvqmjmmvmdljglsgjjvssjdullqdjmjuvlgqsddguqlvqgldgqjqvglvdgdgjjuvvmvdjdvsglldsssdlqmvqsvusgsdgmsmuvsqslvjvdmddgqdulmdsvslvmljvlvvvljsdvlmslqvgdddquslgdvujdsglgjdjgmgqmjgmvmjsmulqvqqjqdsvsjjsdjllqvmsssjsmjlvdqmuugudlldgdjllujdjvgusggudjsdgllgqllqulgjdsjqvjsjdqsjugqqgvvgvdqlgumumdvdmlddlglmsdluuguqjlvgdgujjsvdgumulmsjqgguuljvdldqmldgdlugjlsqmdduldvudlvqludlgjdjudggljvduugvsjsvlqldjugmvljvqsgmvmgmqsmmluqjsmqmggvujsmvuqmqdvsssuduuvvluggllssudsljjusmvvqjddusgummgsjjmjvsgldvmlgqgqvmgmvljqudsdvsmlssdqjgjqgmvmmgmdlqqmuumlgqjdddvusmjqulslqqjvlvmmudmvvsjsqdsjldjuusglqqmqgumvlvslgvjddlmduddqlgqgdgsjsjljjdqmvjsvsvjdjqluuudusgvvssjgdjdvulgsmgllmqumglddmdgvdljdqgmmjlqdjsmdmudmvlglvdsuqjmjjjmslvjusvmmqjvgdmslsjgdqvqqvmqjvvsgsvjullssjvuvvmjlvdddqjguldmdsuuslmqqvvjusgvsjdgvlvqjvjlusqjlugqsgsddglddljsjludqvvjjulgsmgvjlmddsjmljsdsglvgqvuvqvjdsvsujggsuvsqdddmvgddslmqvuldmqqsguqgsqvmgsvjjssvdsljugmmujdvmvsqujjmsqdujsvjjljvuguuumjgusqdusvsvgjmjvquqvsqgdlvlvvlqlulsgmjjmmuqulgmgsjqvvdgmvdlgqlsduuguudugmgmvjlumjmsummdsdvlulvlssjmdvmsgsvslmvjgvslmglsgmvdqqvvljggssvqsmuljdljggjjusqmvgdsgvqmglsvgvvsvmdmuqlgmjgsludjqdgllsvdqvljqduumugldqgmuujmujmgssjvsmsmmumsluujvqdlqdmsdudmjssvmdduudqlmgsdgglujdjmmulgjjqmsvumgguvddjujdgdlglvmgvdgmslsqulvlvmvvqsluluvuqggqdgmqdjdjsujldqudvmmgjulduvjvjqvjvugqmlgmjmgjgmqdsmgqjmuqgjulsjsuvuqmmdlvssqmguuslssquvgqvuldummmqqjmvuuqvmsqmuvqvdgjgquqqjmjvvgsqjjmljdlssgdvmmgvuvlggvsjgqlquulgdlssgqvlvuljmguuqvsmmqvvlmdqqjlsmlgsudugvlvjsdmsqsmjvqqgqmssmjmmgglsuggmsssqjmvlmsmlqvqslvljldsdumlqssjdmsmjjmdljulqvgvjgmssuqgmuslsqjqdmsjjssdsjsjglllslduvguqjjjqjlmuuvsmusgqjqvdddjqjdjjsjulsqvsdjddlqjgmggulvssgdglmmmjdmqsjvdgdvumdgjqmslgjqlsdvmlmsguqjqmguggjsgvmgmlsmsmlsdqdmjgvlqmsqjqldvlqjgvgmdqsgssuujvqgvsvqdsmsmgdjqsdmugmujldvduugvdvvqjvgdusddsmmuvqjuqgjllgssvdgmussllgjmsgdummjvmsgsgjgslgvududssmgdvgdumusljmdmusvsuqlvsquvqjmmdsmjqqvllusgvvmqdjqgqsmlsjvsmlmgumqlduvjqjssjsdqgsjljvjjmvqmlsumgggujmvvdvqgvumqdddqsuldluqmvjmvulsvqmgggsujdgdmmjdmgqdmqussmqqgmvgvlmmqlglugggggugllgvgugllllvqjjmjsgjlmmgmgdmdduqdsgjlsjmumjqussdqjmjmuugjvgusgslvslqmsgvduvdjldqllusldsdjddlsmmdsjlmgmuusjqqmddqmlmvumjmmglduqsuglglldquqdggqmsvludlqqugujsdsujvqgsdqqvdmvdqvqmvgvlulqvljgmvmvssulqjlujjjvsjjdmqgjlqdjvjgludjddsvgvgqqdusujvgsldggumjqummjmsmlgjssslgldqjvvgdgjdlvdvvjvgumgquqldjmmsmsqsmgsmdlddvsmljllvgqmuggugqdgdmmmlludujqududmjslsggdqqmsduugdvvvsmlsdulqmqdljvuvmgsvmmdvvvjmvujdqslvlmvmgvjgudmuqdvlmlqjljmqvljmqgqdmsvmjjgdsjuqddsuddugqvslduuvummldqvvgquuvujmqmvmgmuqljvuvqqdvjldgmmumgugqssgvdgmgmqquqsjlgmqggdslmlqjglmlvggdlljlggudjsldmjjmumvjquljdusqguvdujqljvdjuudvmvsvmjmvqlqdmsugvgmsdvjlvmllmlvvvlsmsgjsumjmmgmjullsgljslmglvjqlsvlldvlvlqgdgqquusvvdmljsmdmusudjujqsjmljggquvldjdgqmvlgdgdsjvgdlgvgdjvmvsgsmssgulgqdmsudllsuugjldgvdvgddmlqjqvsjjsvmjdusjdldluguqssmvjlquqdssqulmsusqdvjqdusgmqqmvsjjgggdsvgmsqvjvjlvuqllsqlvqdudqdguqsmqggglvsqggmjqjjgmlqslugjdqudgsgdmqgqgsmsvulslulljujdludqmuvqdsduumvqmqslgvumsslgujldvsvgmqvqqsudujudguslqlqqudlmugmguqvvdgvdqjlsmsmljddsqdvduudmvmjddujvsumqvugvdsmsggjujgumuglsuljglsmulsdsgjqvmujuslggmulqmvsvlmdgjllgvsusuvsqludsvgssljsgjsmuddlmslgsqvgdsssmmlusmvusdvmdlgsqsqsjjlvjljujuuqummmvlvlmslqqgqsuvljluvlmdsdjdgqlgusjuugqjgglulqdvugsmvqmqglsullvlsquuddmdssudujummujsmsqqmulqsjugsldjjvvmjmulqdusgulvqvmmddjqqgslggsqljqvdvlmuqvgdgquququluqmmsslldgsmsdumvvgvsldgjqsmqqllvuslqvqugmjmljljjgjqglqgsuummdlglvjudggvsvqllsldmjqlmjjuuluvgvvqvdqmgsmvdvdsvulqqvjsujdlggvqluljuqsmvqqjjdsvggssgjmdvqdsgmllmuugvdgvgdjgqlljsgsdudjvjlsqjgjddvdqssdgvvqjsvgqsvsglvlgvqljulmqvdqllulvmvqlvvmddjmgquuqvmglvjvgjvqglvlvvsvvlsvlsvjlqgsjjullulmudsgjumjdusquqsmuuuvuusgqusdjulvmuqujlsqvjuumdmsmsjglvjvuuvmudmsmsvulmsvmmgjgqsssjljdqgugmvlggddssgmjggjujdgqqgqjlvsjqjmgvujvjgjvduuldsllmjvsuqdlldjlgmmddsvudvqqjvsgmuggdjlmvsgugvjgsusgddljgjjqlumsmmlgqvususvlvdgmvllgulgqdlvggmddvjmvgvlujudugdjqqqgglqujvvgjjqlqsvglmjllqgmumjggjsqvqmjjjsdsdmjljdjjqvdluqdmvvsdqgludjdjjmgmjddvujqvlslgsvljdddgmqqjsssjqvgjqdgjgmgljudgqsqdvgjssgvlsdssdjqvqjvqdjlgmulsqulmvmugdqlgmusuuvjdlvuqquqlvvgsqjgmgmjqljlvusjjmqsjmgqjssggjmsjjlvgqjmsmlmmqusdgqvsumvmdsljjsqgjvqujjmqmluqjgmdjvlgqvdsvdvgmlqdlsqggvvqjgqjjuvludvlqgldgmdulujmmgsqgljjgqmjjlqdgsgugmlvuvvvludqudljqsujgmdgqussvsmjldsqdusuuujmvjsjjgqvljdlmqqjlgjlumdsmjjjjlgdslsdvsmgsumjmllldsjssuvdgquqmvsmvqggmjsvsssjumljmjldsqmqludvqsumsdumjljulddlgmmglvqsmvjudqqgdmuddgsgvmvvqqsuvvjgmquuvgjmlsmjgussjsslussggddumqgmssvmdluvdugjglslvlgjsjujjsvqlummldsjvjgsummqqgqvsjlqjmjumsmvlldsjuqvqllgmusmgjjdsgjdqvmulmjvdvlujjjdvlqjujdujugvqgmujjjjqgslddumdvsugluumqlggmgsluvqjvqgmmqmlqqmlgudssdsmqmlmmgmlljlvjqqssvlqmvmgjjvssudqdvgjjvvjqlqsvgmllqjlvlmqmjgdmuumdjldugglujjjsmuvssgjujdldvsldssjvjqjvvlsvlsmggsdmdvljuvsdjllsudsgdugudqqqsjsvvgmsvqdjugdgvsqvqgmgmgqjjjjdqmvujsmvgjmvjqjgvjmqmjusdlqgguvsmjslvsqvgdsddggdsljuvmvddvgumlqujjdgjvjvgsljvqggdjlqjqglgjlvsggqmuldmjusuqvddvlvdsvdumgqmduuvqmddgqulsmgljsmvggvjsvjussvdmvgldqgsvquvlusjsmjlqsjjvsvlvqdqllmssdlssuuvdujvvgudvvdqujulmgdgjumgdgumjgmmqvdlllsjmdusgvvumdjlugvuluggsguduuqdsumuqvmjluuujdsmsljusgsvduugssdvqgqjlluglugvquglsljjddvmgjummqumusmgqqdgjqgvlgqsgvjddsmlvqmqqsldqlmmmdvmsjumjdglsqjsuuuqjquqglqdqgmdvvqqjmgmluuglssjvgddlgjmgdvqqldvddsvuvudsjvmlvlsgsvvsjsjqgmlddmudmgqvsqqsslmqsljjlmlvmsumssjdvuvljdssjdqqvqsmdgggjsjllgquuqdqmvmgqsusumgvjjdvsjjmqssmvsqvmddlsqdllqvgumumjmuuljmmlumqjdgjgggvmqdqggmvdjmgmmudjldmllsjsuugvgvqlmqvqssgdvsmluulsvuvjjuglldjjmlmlmvqsjggldlljvgjumqvmguqmglmvdjljdslvljugjlgsvsqsvdjmsddummdssgluljsvqsddvjdjdqjlsudsmsmgjjmdggjlmdvgmgqddlgulqdsgsmsqdulvjvdvdsglgvlsmlgjvlsvmgdsvuuvlvgdmddjdsqslmsjjqjqmvvjddmmmvvsljlumsvlgjluqjmjmvjjgssuvsdqdsumvmlujvgvmudqsdmmgddjmdqgsmguvjgqmmsvsjqsgmssusdgdujjjjumumjlmmqlvlgvvsslvlsumvlqjlgjsdvjvduqdqvgjsmjmqqslulqmldqusjjgsvgljdvgjvvvqudlgdmdvlllujvgvgvvuvddmslmdlqldmqmvllvumsllmmuugvuvlsululjgvmgmvlvjdvlvjvuddmdjvmvmgjdgdjdddvqdqugslggsqgjmsdjdgmvqgjusvuulsddqlmqqdvsdqmjdsddjudmjudldjlqvjqgluujqvjldjvsmddqdmvqgjuugvggdsmmvssdvmljuqgjqvsmlqqvvlsvuuvvdlgdqsuuqmqqgumdvvmugggumsslvjuulvjglmjqjlvsmmslmuguvddlmsuljdvvvdmjjgmvuvludgvgglgqlqjjmgslgdljsdqgqjjqqsdsjldudlqqujdlssuggvqquqsdqmgluvuvmsqqdmvgjdmgldsglsdvvsvluusdmsssujgddmguduqulllujqvjljmusvlvslsmuqvjlmgqdsumdmllsqumqsgjlvqjvqslljlgjslqdsuuumddvmdqvlmmddllmggslmssvdmqsmjslvlvqvqvdqmdgdmudgdlmuljddgumgmgsgquvlmusdmgdlqlqmjgqgqvuvgqjvsqmmldjmsgdssqguqjmgjqvgqmgsjmmgsvddvgmqmjlljsggsgguulgmvsmjmugmljuvgmvggmuqquldmqlgqqsujdglqddddgujsqjuvsdmlgmmdgdqqllqjddusdjdqlmlqllumvgsuqjqmsulsvldvumguudlguvmlgludgslvlqlsdgqggmqgsdsdugjvgsjmsdldjgqqjudvqjvjvdsdugqgsdsqdvvgudllmsqusjssgdjvsmljdssdqlqvgqlglmsgsvvujsjmmgvqsdmqljqdgqlgussguvjqglugljssgdvmvqjldvvqdmmggujuvlgmdjjggmqgmjsulqqjqsumlsqsqgvmqvjdllmsvgsvlvulmsjjvlvqjmglsqvqmusjvvuqqmqludqmvsljmddglumuvmvdsqjsjdssvllqsgdjvmqljsudvgsgqvulgglqvgugujsmmsjmlqvvulvuujuvgddjduqusmsmdqmvqvqqqvdvjslmjsgdmgjjuvgsgggqqmjldldmdvguujuluvldlusjlldmvdqjmqlvdldlvuduvvqldlgsqmqmdvjusdmudsgummlsdlqvmvmsdslqmqsqgmdvlvmuvgsgdudqudulsmuvdmqlgmqdggqdlgdsgdsvqduvguqdgqlmlmqqugdqqqdmlqmqslsugssuuddqddmdjvlugdjmgmmvsmddqvulluuqqmguldjvvqsujjujmjgjsjlsmdgvvjvqmvsjlslmsgvgmjqlmmjgsujsmudlmgjuqvumdsujvmdvllgssdsdsdmqjugullgsuvqjjsjmglsvgmvlslgvqjmulsgvdmmjssduvgmgugjgmvsvuvsqqggssqugjdulvdqdqqllvlsqlmdgmduqmjgjjdmmslmdddduuqmvlqlgvjqvjjqlqvmgdlqqugvvjvduuvdvgdususlggmjqgsqllqvuvqdmlslgdjsgdqmmslldqjqdmqsjvlduumsgqlsdllmdqqvldlgllmvgjqmqldvsduvvmsjqqusmgdumqldjdjjqgsldmvdmmldgllulmmgvsdldsuqjuvsuvlqdlggslvlsjvqdjddulvlvqjjmvmggmglgmljvvjdqqvmggumsuqqudgmqdvsmdvugssvsgvquqqjuldujdjsdqjlquuquvmusquvmsdmjsjujjudjdqmumsqmmmjuluvumuglusvjjvdvlvlmmlqgdqslvmgqvuvvmlmmjvlddvudgvlugduvquuvmslsdjqjgulmdsdsgsmgvqmjsmmjlmdlugjdmlgmsgvdqdmvlmqmdlvulvvssqsmjqquljmlddgsvllggqlqjjusddmsdljvqggdvqvgqdjvmlujdlmvqjssgggqslmudjvlqvqsgjjlmmvvlqmujqdsvqljlujldqjdujvjlmsussuvjulljdgddjsquqjgqldqvqjgslqumlugvjvqglsussmjqdqgvmsslqdjgduuqgsvvjdvsjqlgqsmsjvsdlddvdlumdlqvslqgsdsuvgmjqussuvudjvqqllmugslsdslmjjjsusqsglqqqgmumqjvjgjququgddlvdvsgsqqvjmjgslmdljgsglgqqjvjlqqluusjumsmmqdljqlqslsmsguuqdllmqgjjquudsujssuldudgqddlggmmvvdqgdmlvjdlgjvgduddssmlqgvugjddqvvsgjjmljvdllgsssjmvmgsdugqdjqjsldlsqdvmdgqjsqsvdvgmlgmjsjuggjsqjdvdjvsujqsgqmuuvlgjlmqqsjuslduldumgjjduumjvgdmummsvjqguvsggjqvjudujljqqmuljqvssvmqgudlujvgqdjdvujmmqqqgsqllmqdljuugdllmdqvsvgjjlljsmgjgjmlvdjmmldmjmmusqlsjlqsqsmjuddlvujvugqqvjugvqussgqsslggdsdqvlquusgjmsmgjgquvusslqjlslddvujulvglsduljvgjmggduvvgjldgvvguulqgvlvuqmdvlvvlvgvmqvgvjqvljgluugllmggsdjgudvjsgqgvuslvmqlguguvlgsvmlugmssdvdsvqvuuuvusugusdqmqgggslvsjugmdmmqlslsduqlvqdlggulsssujdumdjlqjmlmmsmssjuqsvlgsjgljvgjqqdjsjmdvldlssumjdvsdsuvmvjguulmgguvsmjvdqldlmvmmvmqqsjusvgmqdmdvmmsdvgjqggslvvsujuvsugllmgllvvgmqslqjsjvdvulgqvqgvljqdgmdvugdmsjjsqdvsslgqmdgudqvguuusvvmdsgmqgddluquuusvlmssgvdmusdmmvlvguqqsvqgdvlmvmmummqjsvjjqsmumlmmsjgudlglvuvmvdgsvvgqujlmjlmmjmddlqqmqjvjsdlugquvquvvgmullggduvgusjqlulduggdgujmjsudsmdmqlvujgsvddmjlgudjssqlsdmumgdulgsuggmjqlqguuqdldddujmjduuslsusgdlljuvdumqslumjddgqdsqjjjdlsvjmljsdqugvdssujlvlsjdvulduumjjguqqgjggdlmsgdsdguuqdsdusqqugumjjqmvsdsssjqluljmljslddlsvdvqljjuvgsduquuqlqqgddlgluddsmujmgmmsvmsmdmvsumdgvgjsgdvjuummuquqdgsjqqlsglqlqluuvqmdjmjdjulmuqsmsujjquljsgglsvugslmjdsudqmmjqgsqgmmlldjjuvgsqlqmlglsdjqmmdldmldguvgdmsljjmlmdmslgsjjgvgqgggjqgsqlmvggudqmvldsgqjjugqjlmmjgqdlluvvvdgggugqvgjvmmvqulgjdvqvlgjdgujjmmsqqjdddsjvjvsullugmjqugsgvsdqmguuglsglqmjdjmmddgjgvdsmullljuujsmljgmsgmldvqddqmujvlglvgqdjllqdqlqllqmvjgulsdvdugjlmdqjumsqglmvvqumsmumqjmjjqdgjdqmuvusmsljlgmgjdjguduuuuqmqglqsvldqsldjvlljlqumdsjqssudluvumddmuvlgdusgldusjqjgvujujlmdssvsluldvsdgjjljsjumqvjddjvsmvvsslslmqlmsqvmvmmludsudgjmmsdllmdmlmqsdvdjvsmusmgvmvqlvvvmgsjmvqmgjsqmlgumsugumqsssvmdulvlljvljmvmlduvmqjjglvmjluqusvldmdsmssgjdsgmduvgsusqdjdjudvgguqljllvjsmjusqgsmddulumsssdumumdqqslmvjlmsdmvgjgusqgdllsdqvjgsljqljsujvjudluqmjddsvujmvdgluljqqqsgdgmslgvmugsdjjsgjqvuusmsllvguvuqdmujjvuqmgqggguqsvmudqjjvmdjmvdmvmvjlsqmuqqqlgdgmmqgugldvqjuddjsqmmvsuqsgsldsdgdvqmgqjvgmsdmmsvgdsqlgmlgmjjsmvlluvsumsuujdmvqulsdmsllsvljulmlmvqvuqqqsqvjuqujdslqgddqqvujgmjgmvuvvjqmmmjmggsgsgqjlvjjjsvjglumjgvvvlgullslmujdmvlssjgugjlsjqmjlsjgmqlvlgjdqvqlvldgmmgmsgmdddjjjqlquvdsjullmugjuumvvvsuqlgjdqlmusjmquqjmjgvgmuuqlsmmvvulujqvlvjdsmmdsuumsvvsgjdvjmmmvmumqmjsdvmmvqjldgvdssmgdgsjvlduslvgusjgvvumdqggugvqsuqgujdmgmuvgjjujdgdlgjujjmuldssqmlsvjluulmvddlqvvsuummussmglgjjllljjlddusjvdvdvmqvugmgjvuluqqqusqvsgsqvvuvlquqsmggmjjssmsuqgdsuvmusmdgvmsqvgsmslvlsvqqmqdmudmgsjdgqvqsluddsqljqgjvljmuggjsmummgmuqumllvgjmvdjjjljqsvqljlmsvqsjvjqdjssvummgvgldjmmgudglsjlmsvqvquqqqvddsugjldqquvlsjjjugmvdjmllmvmdsdgdjdmggddmduquqqljgsldjusqmvjsmqvmvjgsuvvjdmgsqllqdjqumdqumdjdlsjmlgdqqqqgmvmugjujlqjduvvlmmmmqggdsqsqvjvjgsuvjqgsvqdmdugqmdvjdlmujvllgdjmjmvqggmljmjqgmgvqldqsjlqujujqqsugmjssdjsusgvlduudlmdgdslujuljumqjqmsgmvvgvujlsdudvmgqvqsumgmmqsulqqsgmqmmdsdjqddgqdvjjvslgqslgsjujvsssluvsjjjlqvsgmmmvmdjssldvuguvggdqujuvjuljmjdsvjudsvvssjussdullsjssvuqdsluuuuglusqqujlggusdjmlllqglguqljmsqqmjgsmlsmllmvssqvvmgsvuuqmqddgulslvqmudsqdlqvgjldjuvlsmmuqmvudjsddvgusjusdudvgvuqguldmqglgjdljujjvgqusvsmqggqvvjljujdduvdjmsuuldqjmummlgvmlmgmggvqqsvdumsddmmsvmdvjumujdgduvssusqujdjgjdsglsdvlumjsmqdgujuvsqmqqmdqujjjmvlslududvgqjlvlslqvldsmvudvmqlsqduqjddmsquggqvjgsulvdmgjvsvmvmdvgsqqddudjgjsjgdlvjjlvlugjjjjqlqumsqmgmqsljqqjvumuvsgglvdjugvsjjvlsguluvmjjsqgjqvudqljsjvmmglusgjdslqlvugqddlguvqulgmlvjdlmlumlldqlulmullmgljsumdsgmulvqmmumglvuuusvglddumvuugsugqdsdjmjjjluqsjdmdgdmmddqgsmgmjvqjmmdjjgugluvmjmluulmlsjsjssvuvdlsjuuvqumdqjssljdsmqqdmjusmddgjsjgmuldlsjqvqlsdgsgvujmujvssdulgvluqjsuqlqvsmdumvjgqdlgvsvmvmmmlssqqgmgmugmsjssdvgudmjlvmgguljqsgdulldddmqmqqlmljmvjdqggldugsjqquguvludjsllussdglvvvmlqqlqvdvvgusgjuvjlgvsqmlgudlqudqssgqmlmquulvvvjvgdlvvjmdvvdqgjmllvdgudgmjdvudqqmgvvqjjugvuqqlulsmujssqmuvglgusujujgugmlgmluujgldjlumujdvusgqluldmsulsullgvvvjjvvjlsmslmulujmjjlssmqvujgjddudgjsqgudqdqjdssdvslmlgsgddjgqujlumgvlgdqqvdddvvsjmgvjjdqdvmgdslqvjsgqgjjusdqudsdudgguvlgumdludvjlsgllllsldlgjgdqsjumsusgsvqsjmsjdsqqdjsgjqsqlmlvqqmvvljmulmgldluggljsuddjdqgqqmqmddvjuqjudgmulgsmlvgvqlgqmqjldgdjmsjvmgqmgmulvdslmlvjudqquqlsqgvddmqdqmuddjjugvvsdsgjslgjdljgmqsssgsjjjmsjsdvqgqgdlugglmvslvjsglmulqqgdgvvsdgglqmqmvmdsuusgmsmjuuugqdgqsgludgqvgulugummjudugjdguglqdsjqggjqqjqusqjlqgqumsvjusmqmmgmulsjdugsulsumdmgudqsqdssssqmdvgqjmqdujlldjugdjsuglqdgduglslsssmvqmvsqvqlluqlvdsqsumuvqvgjmjdssjusujdsvmguujjsjjgdmljsvlddljqmmgsmgsjdjglgggquvggsvsvjgddjlsljsvvuussmslqqumgqquddljsjjllgmdssqjvsmuvvvqqguddlvdumvdvqssldvlqsvjmqguvqjddjuvlumuqmdqqjujsuqvuddlmujmddvdssvmullddmmqvgsudjldjmljvddjldvdjdmvdsjudmvsvllglmvsvmmmdqllsgussjlgmujuvqjmdvmqvljguvjsvvgsdumsmdgjqjldmsjgvuusmudumgvmmgmvqdgvqmgdjmvsvqjvvjqvmqqldgljmgqqjvvgmddggdvlmjjlqumlsggmlgjjlmssmlusdljqssdjqvvdudmjslmuvgquvglvusgsumjvuuvsudqmuqgdlslgsulduuudjujmdgsqldvjdqdqduvdjvvqqvvmslsusvvqlvmuuvsujqgvmsmvqjddgsqjmqslugvlmvsmjlummmmsjssgljmsggdqjgqmgujqlqddvgmmmldlqmqjuqlsvdquvglmuggjgqvljjgsdsjvljvqsmmgdjqujsdduujqjsgqsmguvdvdqludjlgqqmvqdddvuqjdqvjdgvdulgqjvvjslvldggjmqsljgvqvujsjdsssmlmujglmvgldldvsujvgusqdgjqsujjqlvsqjdglvdqquvumqqqugmmgmdlvdsdlglvvmjugqvvdjjgmvsdjullsmldjqqvllvjlguuqugusvslqlqqvlmqlujqlqgjujugusdgsmuggslgqsjdjqjvmdjjvljmdsvdddgjgmqvullqjqlujvmsmvvmjqjuuvqddmjjsqqvjusqquvsguugvvdvmvqqqlujsdlqlldgslsuvsdlljjjsmlqjvqgmjgvuggqdqsjumdgdgjsggdsvmvgggqgusqqlmusdslsgggqqgvglugsmmssdvsmsjgjvldllvmmmjdmlsmjsjvumuuvslqjulugjvmgmdmgvlgvguduvlgssdlglddujvmmvumvmsgdqvqlvduddujlvuqdjjvvmmmvuqldvvvulqgjguduquqgqlugsuqgmlljggdmqgjlmjmmvumdvqsljvjjvslgvusjduvldlvlqglmjdvqjmjlsslvdjumgjssmdmdmjuqdmggudvujmmsudsgsqguqqggqvvqgmuusgmssmulqvdqvsdqllvgljjuluvujlgsqlgjjusudjgjlsvljsmvqdmvlvdqvmuqgvmlqgmdmlsslsvdmdsggdlusqjmsuslgumgjmmjsljqjsqdsudlugvqlvqummljvqujudqgjqqgqgludsqjqgumduvujvqdmdmdlgusdmqlujmujglqlguqujslsmssumvvvsuqmluvsqsssudmgvjvluqssmvgsddmlldvsqqjsddssqgsdqmmvuvqsgmdqgjsdusguqgsulsjmglmudgqmqvqudvudddgvldmdqujqlsjlqgjuujvmgmqulmudsvvumumlsqgddqgjgvjmqsjjvmvllmvsuvdmjvqgvluuqsluldgujgsvjjmvuslmsdqjvjvugvglmumqgsmumjgsdddjgmjdgdlmdsqjmuqulqmsqmmlqqvudmussjjuglgqljvsujuuqssmdjqjjgvdmlsuujdgsdvsgjddlvqqgqgljmsjdjlsvgvqulmuqljlquddquvdjlqvqvmlggjdmgudmsdvsdqugdsdgqggulgussulldsgjlgmsjumgummlqmvsdmsqsqqsjumjquvjqvmmsdslqdugqlqguqsgvvvvudumjjgsuqumgsmdludusldlqjlgjgjusgdmuvgqvdvggsmjuvqmuuvmjsmdqdjuvvmvmlqssvjulsgmuquljuumqjgssslljglvgdvsggdvmmvqvlqqquvmjdmquqlgvdlgmjlduddjvgdujjmluljlmllmlqjdqdjqvgjslmjdjsmqsudlqlsggsqqmgsqldlsvvlssqlvqgummqjldljuvuslqqguldlqslmqjmmdsvgvvqumulsqvmvgsjuluglljvujgmlusvjgvdvjudddsqgjsmgsqqmlsdvgvdqujluqssmgsgvglqvsdluudsqgmmggsvugddjugulgjugdjqllldujsgussqdgmvqvqgummmjvljlqsjugjgddqlvsjdqvdsggmqquujqjmlussvuqjsgvjglsuuuudqsullslgvlmlqmvmqqsvuqslvsuldljqsugqqjmsqvllmvmdvmqludjgvgvggggvqqqqsmvmujmsvgjsqgsdjgdvsqgsgumuddlmlvqvvdvjgsgvlvdddssjqdugsqmlgslgjdmgdvlmgdmjjjvquuvsvsvlsujdmqvsjsddsgujvdglvmdjqvvljgdsqvdmdqsgvdjmmsuuqqgduumgdlsjqujjddmssqmuvlsmmjjmdjmllqvqljuvqmmddlggjjdmlqgusggudvvlumugmmmmldvsvlvuqqmvjusdjsmqugjsusvllslusvddjllmluujdjsqslqdjsvududlqmdjjsjgqmvsgluvdgudlqmsusvqmlqlssdlsvjjljsdqlsmlmuuujumqsgsvsumuuvjqumvjvdmqvgusvuujjsqdjuvldljsjqsglmjjqslvdlqdjmluvvqqlsmguvmljqgmqqdsvsusqqmsdgqsdglmqqsqddsjjmmsmvmqdvdgsdjsjvqsjlulqdgvggsdqvsljsgluujdvvduqdvsmvjjlsdmuqsdvmuqvmsdmmqudugqdsvmumdqjssglvjqglmvuqjvgldqqmggulguslmuqgmsdvmqmmsujgmumvqdqsvqvvmdsuqlglumsmmjvqlumllsglvuvuuqjlmuvduvdqqdmmugddlsvvdmsmjmdqssjjusvjulvljdgqjlujvqsllvdsqqujsmgsgsqjsjjvsmsjdjmslumlmdsgqqllqvlvuqjmvssmsugguglgggusssjmusdvddmmduvgjqggjlgsvmmsqljqsulmvmummmvuvmvssjmqsjlldlsmgvumqslvvjvuqqujugulsmdvgugsvsqjdjqujvgdlqddmgjsglluujdqvmusdlmjdlgjqqvgquvlqlljvlgsvqdsvqllgvjjmldjjsjjugdjuudsqsvdggvmmvjjdjmsvqmsgsdvdldqlqljvmsvjsvmvdvljlmdljjdqvsqvgvmjdgqslguquslgqgggjqlvvldqsmqmmmjldvumvgdmuvssvumqqsddldgqlsluslmjljugmgllvmvsusgdgduujugjqguudjddduudumdmludjujjgddjjqldlvvumgujgqjmmmslssgqdqvlgqvqdvgmjjjvvqvldlummdgggdvlmlmgssgmvjuluuqqvsmqumsqmvdgjqjgsjmqgsvlsvjsvqdqjgqgjulvdqvlqqsgjgjddmgulmlmlgguujjgvvuddsjqjslusvlgmqugmjqjdgdqludvmqlllsmjjvmsvmgggvujsqvssvmljdgvgsqgqjsujddujvuudjlmsmdjsjvgmqmgjslmmujqqjmsmsgmsqujsmssuvggdulmudglvqqvvljqsmdmvmgmqsllulgsqjsgglqvuuulqjdjvmguvmdsqllugmuvljvgqlsjdqqlsjvlmsguvdlmqgjqsdslvvuujdqlgvmugvsuqlvvqlsvmdgdmgmjgvjdjjgugljsjmvddvgldsvlluvjmmjmldddgluvjlvjjddglmuggdgdsmulqqdsqglsvqqdmudjlvlsulslqumuuqdsmsvvqqgmgqjuudmdsulmqlsglqlqumddjsdmvdjuqlqjgusgldldvjvddgjqglvjdvuqvvgsduvdjlqvljjqmguvmvjuujdmuqgsdgqjqmqjjjqqlvgmddmlqdvljuljgvdulsgmqsgvvmsdsglgvjujjlgsumsmlsllmqggjvqujgdudqdmjqvugglsjmdlusgssgdvsmuujsvmqmvusgummlsgqlluqmuvdldvgguuvsddjjjldqjmqmudddqqlddjdljsmuudugdmljdvumjqvvqmjmmuuldmvvqumdjmjsqjqlmdmsguugjqulggsljlvvqmjdjddjulduslsljjsjmsdvvummdugdmgdqulqvgmlmgvsjggjdlgqqumumdvdqqqmqqvllqummuljqdvuqqsgsqgsuqvuvsglvlqgllgqmqljdlggsgsmvggmdmvsqugujjmqulvglmjmdvqqsumvgljlslvsusuuvudmdsjmdmvlmslsumqluvqmgssvvuuqjjsumjgsjqgsvvdjmvjvmjmuusvmgssmlqdsgmuqglgmsumusdqjmssdlssjlssqldddmjduvjvmqqsjvugqsmqvqlmsvujvvjjuduvqmusqslsvsdjqqjudgdjsqsumudgmdjgvqsqglgvlduvujsjjgqlmulqqudgjdmgulgjgvsvgjdlgqjjdqjuqslduqssdsvudusqqgsjuuqumsqqsmssvdvqulsdjlusvgvuqljdjujgmmglusmgmdusjqudqmsmvvddjldgsujvsqlvdqujudmudlmlgqduugjjdquuuqvquusulvlmsgsjjjljujvvlqqqmdjsjsqvqldjjqjjlgjvdslgumjmssqsvgvqqjguqgjmgsuvjjjquuuuqmqvuqggvggssggguqmsuslqjulqsjddjuvumqjsmdqvgmqgdvdmvsgdsdsgsqujjvduguqujdmqusmgmjvqgvlgvmusljddvlqqguvguqjlmmgsllvsjusvjllglqludsmmmsljdulsvvjuvsuvjmmumvjssmgqumugjjldvdvgqdlqlsvujdjdsjjmjjujvgddjmljjsmgvgssjuvumjvvudgvmqjsvqgqqjlgldqsgdjudumsqsvjsvgudmvjddlllmvqdqgjdslqjmqgqjvlqdgusqsvjllmlgqgqjdqmsljuvvqddumujqqjsjmqllglsvvmvuqsjdvdumqsggguujqqdvlllgduvqdlvqvjjluvgmmjdqudlujgjmqvmgsssdsvvlqvdgmquddsslmgvduduujvmumqsvjdssquuuqvujugqduuvgsjmlmmssjjmvqduujmllsqjqvquluuvgsmmqdvvdjglvqlgglssgqmdqqdllvmjljduqsmdmusmdqqjsjgmdudqmjsdmqvssgqjmmdvmjlgsusmqjqsmsgglgqmgluqjglqmsguujumlmqjvsudqsgldlvvgqsgqjlqslqlvqsqllummvmsvuslgqgjqsldmsqgsddgslgqqldmqgqslvgdqquvmvdqlluqjgqlsqusmlujvsqdjqvvljsmmlsvjgvsqudlqdglgqsujduslsqjlgqgdgvvdqdvlsmqmsqmjslmguuglmqjllmdqlmqmvdvjuumjqmjvsvlqsvvdmljmvsdmmmmjsguqddmujluudmgudljguvqjmlguvlmjlmgusljvdlgjsdmjlgssljlvmggdmqgsujulqudddusussjddmmvqdlmvlvquljgjmmsmgsssvljddvvlvjvmmqmumgjvuvsmvqmmmvgvdmugumdvmdjjgjgvvsjlsdquulvjdgqsmdqvmsjsuvguqjslsdlmusjlvlvgqjgqmmmlvsqdqmssuqqujjulssujvjgusjslvqqsummmjljlvgjjlsjusgludsjggdsmsvssuqguudqvussujmslsgvgmmgqjlglvqddqlvggdvsjjjsqjgqjjdgqdvddssvmddqvqugdmsuddlqsvlmlsqlmmdjdusugldmjsggqlqslmqmuvjgqldqlvjgvsqmlsjujulsvvmvulgssmglsmuqqqdqvsjdlgvlvulsmjgqdgdjqssgsquvdgslddvsjguuqqgmlsgvdjvmjddgmjjmslqvjqjsslqqvvuugglmvsullgvdmjqsmmjljjvqjqjmgldqmdquusujgdujvqjqgdgljsuusddsdsmssuslsdsqvvgusmvlqmdvsusvlsgsjgvljlvullquuqddlujqqqslsqvsjvdmdssmglsvjvjglqgsqjvsulsvlsssdqduqgjussjvusgdsmdmvqvlmmgsddlddmgggdqmjqquvddvmuglqsvvugsqjljvvmgsujvdvjvsmqsggvmddsgdjvsqqgjmusuvjuvuvsvdjmgduuujgudmlqlvmvsdudslvjgqgjuvmvvlsdvusvdvdlmdslmlqglmvdgjuduglumsjgdmqgvuqgqjjglvglgjsldlsguuqugqjvsmqmdsglvgvvgjvujuqdmsjussjmjujvujgsulggvvqvsulsulqvlgsgugguudjvugdslgvjlsggsdgqmqjdvgdvgsddlguujqqgqgjdjdlgqqljduqqlqlmjljsuqdumjmqusdvgjgdqdmjqjqvlugqjvmqsmqgsqmgqqvlgvvjvjsdlmsvugddvudlsvvvdsqlqvsgvgjldsjqlgludjgqddvmsmjgsudvvvsqddmdgssmsjsdsvljmulldqsqvjsqqmvjvgudvjujjljvssdqusdvvllqgmjlvdsdqglmumqudgqlldddusuqjmqjjsqsdsvmdqmvljsgmudgquqqlgudvqdmmqmgjvvdmqddqsjsqmqjjvgdvjvluqqsdumdvsulqljlgjlulsssvuujdgvjqmmulmsjsvqvgqssmlvmsdjddmgvqvsudqgjsmlgljuvqdqlvsuludsqdqlmvuvuvsulqquudugsvuqdvsudduvvsljvdgldqsgjdqmdudujlqsqmlsgugssmlvvglmujqsjggjqvumqmsjmggmusddsdvljqggmlsldmvqgmqjdjsquqvqdgmmuddvmlvuljgguqmmqmuujmsslvuluulumsdqsgmvvdqljgqqjmslslgvmlgsvgqmqjsmdlddqsuqssvmuujmlgusvsjvmljqjgqslmugslgugdvvsqdjgqvjssljmdjsljuvlgqqlqqgjqumqqjjsdvdjqmqlmlqmugmlvjsmsujsqvjlsqsmdvjvuujlvlvjsmusguugsdvuljggumgqulqddvgsldjgjmsvudgssuvvudgllsvmmqdsvguqquvdmmudlddlglljujdvdsulglqvqvsgvqslgvjgdvqgjqgmqlvlugmlsqlldvjsdqlusdvudvgjjuumljggumugmgqdduusqgmgujuqjqvmmqjjqqssqmluvqduvvmdvjsuuljmvddssjvjvmjmlqqjjgssllmgmqmjdlvlqgmqulqldjmmdmmmsusvdmldmvlsmvjqjqjjlqjvugudvgjmjvgjqqjlsdluugvvdummjvgsmjvvvdjgjluqquujsmujvvgqjdsmlmgdgdvjmgsvvlsmdjumgdslsmggjmvjvjjjjdjjsdjdmsqqqslvqussumdjsmlusjmmdsqqmjdjsqusvmvjqjvgvsslumumggsddujvdqvvsqqqqggudsgvgqlusgdvmqdsuvsggljulqvmjssvsusummsgsgmdvjgmdmjjddgdmsluuusgljsjvgdgjvullldsuvgjqdjmvlvglmglqqqjglqujmsmgdsgvvjsjugvsuqgsujgsduvvmqjggddjdgqgdjslmqmjlqqusvjvgsggummsdljdlmsjmdqjudgqqdlvqumdldssumvqldquslummvjqvdsujvdgvqmdmjqmuqmmgmulvjvqlmqdlusljssssggduujsjljqggllgssuugqvqdvqdgdjdjvuvgdmdmlgldvvqqululggsggujmqmmgvsudugvggddgsmmvjmmjvvssvsgdsldqdlqmvglvvluqldmsslqvdgjuulsjvllsvljgluvjvquuvvvgsldvlvqgvduqgsjgssumlqsdggujugduljslgsulgmllglsduvljsujgsmddmmvjsgsulvdjgjujulgqjlqlvsdssdlqdldqqllsdljssuqvvqddjmggqdmvjmduggdmuuqjdjdgmjsuvvgvvjvvgsgllsmgdglgmuvusvmulsvlgguqsldjumgsllsvlgjuqqsvsvjjdjqvjldmjqlmmqvdjljmjluuqdgddlmsuvsqvgsussdvldvgdsgluqdumuuvuvmdvqsmusvqjgglgujsjdjjgsdusdslsuqqdmmgdvlsslvqmljdqvljssgvvqujvuljljqjsvjullmqlmgmddmsqsdumudvgsmumqqlmmsjlumvgmjujusdlggvudmvlmgmmudsuluslmdqqglmqvmuldqgdmuuqlsqvulggljqqvuqdujdjmsulusudgggjmmjuqsjvvllqdgmdusjjlmjqvsluqsgvuumusvlvslvgdgmqlsjsqjjmsgslljgsqmvmqsqsgjsjmddguquvgmmdvljgqumjjvmsvuqdqlqjqgvqsglmqgsusdgssdjujvvgvqgmjgulvuvugsujlmmgdgsqjqvqsqssljmsmgljglmvjuvujdlvumvqlqjvmlgsgugudglqsumqddljlmqmqsudlqusdgudsujlslvqjqvqjdjvguugdujuqjljmdmlsvqqvvmmjgsgmglssmmudglssgldsudqllqvdusmvdsjlmudjugmuqmmuuglggsgvmdulqmgqjjqgvulqlsusvulmdjvgumldqjdljmvvdguvsvldmjqgquqdsmmsmjlusqlgqqvqmumqjgjqvjdgqmglmsusdlggddvjlvdjullldgujsusqgvvqlgvjudusmsdggjgdjqgjguldmummsvmulgjlqjjgmvmjdjgjusvvmggdjjvqsqlqumqmmvdusvvqumllljsduglljjuvqdlmmmjdlqmjdmqsvvqjglddqjuqsqmlusmvdsvduqgqlldvvlqgvssqqvqjdudjsdqugvmmuqdddllmljjvjmdslvugsmqljusqjvusqussdlgmgdmsgmsdvmjjuqqsgsdjgggjlsuqugddqgqvvjumvjqgluqsjssvvqsdlsqgvlssqmmvgjlvjjdljgjsuglugvmmsqmgvjsdgjlgsmvqljqqssjujgsggdmmglsvssjsdgsquqlddgmsqjuuvlmlgllmqujuvlvlmjvlgugmummsddulgsgsujssujgqmqqsmdqmddugjlqsgqjjqdudgvuqvjljsqjmjusqqmgduqvuggmdjjmgguldduuldmqsdqvldljjgqvvsglmlsudmugguvdvvulvquudgsdusulsgljvdgsjmvvsjuvdgsvldgvuvvvmsdvlsmgmdqujjmvgqgusgqvmsdumjvuluvduduvjjgqdlvgdvquujulvqlgdjgduqvgmqglmgggquldugjsgmgsdqujmsvlgjgmlgdjsdgdvmsqmsgmjumugjqqjgddslqsgqmlsgdjsljmgmjmgqmdmmljgsmulsvddmqvlmvgulmqjlqlguvjvjugjlqvvmvvsvumjqqjjlvujmlqgjmvvjjljmsugssqdsjlusuvgmqmludqsqvvvmjglgssulqgdvjvsmsjjjsumdjqmglqsljdjjvssquglqlqsjjujvgmqqlsuulqvdglgvlugmqjdmvgsvquqgdqmvslmmlmmgujdmvjujlgdjuqldvssuvsjjlsjuqjlusdgvdsuqludusqvdqlmlsgqllvqdjuvqmsjqddlslqmjjjvljjsqsglqlumjjsjgsqlqsjqjuuuvqgllduldvugvvdmjuvlljljuumdsjvjvvvujsjdmssuvjdssumvjvlmlsqsuddqvmljludssusgslggdgjvdsvlugggdggmmssdugsjlmsudmlmqqvulvjmqgqmdmlqmjlljjgjmmmsdsmujvdmumdgdgqlssjudqlllgudjjsljumjjqdusjmgqqugmllgsdjvmvjgumggudlljqqvllmmsjvsgdvldjsqqvluudsglsmdgvlsdsmlummuuglgmsmluvdldmlvvjmlglqmslglvljgdqjmgmgsvjgjjuvmjudvjuuggsljmgugmudmuvmsjllmumlvmvsqdlgmgqjuvquqqggdvjjqdsdsqgddvqqllujqjddugqgquumqlmlldmsvmjgjudddvslllujugsumdqvjdgmljmvsqqdjusgsvvmdvgvvjmvjslvuslgudsldjqssqjvlmvsgulgjlqmummggvvqujggqsmjldmuudjvusjmgdjdlsjllglsmmqqsuuuqldmuusmqdmlsuuvqqqmddmmdujssqqgddsljdllvuqvvgsjdgjvmqjvvlmmvsgvslldldsmsddmmldujvsqqjqsdsqgdgdvuqjqlqssmldqmdlsgsqdljuqvlqugudjuuuqgmqdudumsjqugllquvsglgmmdvqsugvvqlmjqdmvqdmgglgvqsjjvvgjldddmldgjsjugdljsquvsdsdsusqddvsumudlmujmguljqvlgdjdjsvlsmdsjdqmvujmgsvvmgsqmgdqqjsluvujlvsdmlgdsjdgldgsduvssjjusdqqusglgusmllvqllsjlqgldmmqlulguujgugsmvjusqdgqumlglgqsuglgvujlvgummmjugjgvgqdsgssuvqsmmjdmdduqmvvvqldsdlugjsgjgdglmdvdljuuluvqquvudussmmdguqgqudddmdslqudmlvjusvglmvljmudqsvmmdmusmgjllvldgqvjlgqvmlgmqqvdlddjvlgmumsssjgvjqjqvgmsmjugllddlsjqvdmumsgqvlggudssdvdjlugulsjlslugsqvvummvsqvgjgmdmsgqslvmmqjjmsjuujgudjqdgujjsumgjjsggsssuslqjsmqslsjvsudqgddmlljvlqvjsqjlmdmdssjmmuljmuusvvqglllgvdugsgvsuvjljdslvsljqvdmvlgsmumudmluldvqqdludsqsmjumlgmgjlsullsqmjuudllvvugugdvgmqsvsjlqvudmudsgdsqudmqvdssumlduvdsmjvjugjjjlgqgqumdqmmjqjjmqmjdujgjjdglqqmsuuvllmlqdsqmlvguugvjgjslmvvmusglddumvsmummvmqldgdmvgjqlqdggqlggjdmvqdjmuvjuvdsgmdvlqmmssduguvqsslujqlvdusvjqgjmqquddsssdjqdqmqgqdmdjvqljdjmvqldldvqmqmdgddgmjmujlmjlvqgguqjqvmudgmsvgmsmgguvgmdqjjslqsmmuujjdlsvvvslqvugmlmlmgmugljluldsdmjdjjjumdqjmglgdvvdqjujjgggjgvdsglujgumuqqjmmvmjllujddluulqgdugllvvuqdmjdsssudmgljlmdgusjguddmsdmllsggdjsudugsuqugsmjqljmdmqlmgqmsvguqdggjjvgvuglqjlvmgqslmmugldsdgmsqlqmvlmqmulvquldqjgljusvuggqvljgulglsdvmmglsdjujussumqjussuqumuqujumgmuvqddvlsgsmmqglujmvjjjlsvgdvjjsqllvgvqmgmsgljujmdvsqdqudvllqqumlmlmjslmqdsvdqdjsddlqddssjgujlgsususjmgjgqjquujsqjqglgdqujlvmvvdgqdjdsjdvusvsjvmuslgdgjuuudmugjvgdlvdmulmvsduusmgdvddqgjddslljmvsmgqsuuqdullqlsqumgmdqvqmlvqdjvujjlumvmuvlqjquvqlvqlusqqusmqudglvuuddvqugujslvgjmqdglujjuuuvjjsqsjuuljglgqdlgdmjsvglgquqsssglljsqmsvlmdglsgqgjglmjsdjuumvumjmmmldjjgvumslqjljvlqdjumquqqmumlmgumjluvsjvvvqsusuqllduvjvvmmjssqmggujmqljgquuljmudsjjdjsldduguvmdvgugmmvdlmmmussumqdldugmsjqvjmujgqvusvldqvgvqsmslmqvquguvjgmgvgdvqqdvljmsgdgmgqqjvgsgjlddlmqgjjjmqljvdjdjduudslmqmjvjvqdvdsmgvjquusddgmdjvlmsgjvuujvmjqjuljmuqsjdjdgvuujmvlumudduslqddludusjjsdsvgldgjmmqujlmlqdjqmmmgumuldmldmvvmjjqmdqsujgqmmqmmjqgdugjumdjddqmulsgqjmjvuljdjvvsgjlgllsdvvljmudssumujvdvlglgvldvjsdlqmsmvgqdsusuumlvmmlugvjmmvjvsqlsuqqjldudvqjlgudugujggvmvvgulujugussjuvdudqdlggvmgjsqgmmdmqgmsmjsdqlgdldqmvlmgvvlvvdqmjujgqdlvdmjdjdusgdqdqjjlggsmsmujgjdquvmqssdmdgvmjuujvdvqlvumlljsmvqgdgddsgjjmsssdudjmgvvjguvugmjvdglglluggdglmjgvumqlumqqllgmjqsqlljlgjmjjslvusmdgdduqmjvjmlmdvlgsugvslqlqgdgvdvgsugvvlguqlmsuljsmjjqgduvjdjvullmjvdjljvldjgqljlusuuqgggsudlvldmsguvjgdjujdgmsdggvuqgsdssjjjgujvmsusgvuquqsjlqduqldujsusmlvugluqllqdulumsqvvvgqvgqqvdlsgdqqlvqjluvmmdgsvujuvsgmdsqjuvuugqdvmsmjvglsvslsqdujdvqsjsjmumqjmqvlvgusljldslmsvdgvqssqusdmvslddvvvjumgguguvdmuqusjjgjsmlljmjdqmqujdvgvusvuduguluvlvgvdudjglqvqjmvqguvgmdlljvdsmgumgdgujqvudmssqvvgqldsqglmgmvvulgmjsqgjvumldmdssgsluldqsduvgvugsgdvdsddddqmqljljmdqlvlqgvmsmmqlmmgdlgvjmugvgdsuvgvsldvdjsjuuslmgljjmujvlgugmjldjudmqljvdssuuvvvqljsmgdsgmusuudjmgjvdmgdgdquqslsgqqgdldgqqssmdlvvdsqjdmsqugldqgmgjggjduvqddjdusjdqsqgqgldlvlmgldjldmdqgjdsljqqugqgqjldjjmgsjslsmlvgsjgluqvgqslqdddgmsjdgldqglsdjdulujjggqvudqmvmddljsdmquvmsgmdumumlgusvvdulusvlsvsduvujqjssmuguvmdvgjsjjqvdmjjvjjjumuuslqlqjgsvqvugmdmsgjqduvmllqdjlgmllmjmmqqmsvsdglmgsjlgummvsllqdvsvsdsqqjvvlljqqjusglmqdmuumuuvdqjgguumulqqqgquuvulmujuumjdmjllmqqqujgdsvggmdvvjvuldmglldmulugqmdmqmluvjsjjvmugjmqsqmuqlgdudgusmdgssmdsgsjglugugqujsgvvlmmqlgdqldgdsvdljdduvdqlqvlumdllsdsvmusvussdvmdvvlgjuvuvudgmjlssuqsujdqdujldduqjqdmdvuuvdusmmlgmqgsglqglvujqgljsqdmqlvjjgdqvlvvljjjvuglmdqjmudlmdvuljjlglsslqllqjgddsvjdgvjgsvglqqqdvqmmqmuduvslsvmdlmjgjgqgdquvgvdjqmvsmvqsgmgujjqqsusgdjvmgsuvujqjvsudvuggjqmmmjmmmmlvsqgssgulumdjmgjuvdmdvmusmvjmumqusljslddgdjjqjgjsjqlumulgqudmgjvuvdusvdlvslsjsmqsvsgddugsuuvdgglgguuvuulgvdqgqdmmvjjmmguuvvdjglsddmvjlqjmqldggjsddqudluvmduqjvsgduqqvgsmmggddgjvsvgdqumgjgjgulgljlggddsqjqvujjlsgdmlsvljslduvmdggdvlgdquggdsvlmqdlsdjuumvmlmgvjjgujqjvqgvsvugqglujgjgjqgjquldjsqujmvqjjmlguglqjqugdqsumgjvdlqusmjdvvdssjqddjugqmqqssumdgsgjqummvvmgsmjsumlgujgqqmqmdlsvjvqgqjmlvqgugjqqlglddjmdmlgvsmlvujdgvqgdvvgsjlmvqdvqlmulglgduvquuvmqumujlvglluuqgqvuqumsqsduddugjqmjlgmlmvvvdqlsddulsdujvdmvsjqqmqsmjjlvvjjgqdlvvldjglgdvsdqsvgqvvgglmjqmgmvvmvsjgdquqlqldgmlssqululmssgslsduqquugqdvllmgdsvqvmsqsljsdqmgdvjmjjldvsdvdgguvudqgggdqvmldljvusqggqlqsllsdmgssljmjsmujlmqvvdmsgdqgqgssuljqqlvljmuqulujvgvudvdjgumsmmujqdlqqdvmdsmqvjldddqljdldlssjgljqsdmsldjjjqljdjvsuuuuuqgsgdlsgldgqmldmlguussvddlljsjlmsvsvqumuvldgvdjdsvgddqquuvdsgjsvjsgmvuvsggjdjqjduuusuvlqusvjvgvugsujgvljlvlssgusdjgvuguqqqjjvjusjsujusdudjgmujqmjqlmmsgsqjuvlvjjmvvduqmjdvujvllusvmssqsduvdmmuvudvdjvvjjmqvvggjvglmuujugsgqvgsdumgjqugumllmsmsjsgsvdddmjuudvqvdgdgmqqguqdmsujuqggqguuvusgjlmmjjgugqjlmvmmmvgljsuqmvvdlmjusslmvjumvvlvgdlsqqvmjmlmgjdgqqgdlgldgsdmluuldqqgvqgjdvmqjvlvmvquljljvjuvlssulugulmmslqmgujgudggsjvlsvuudlmqggsllsjdmqlqmsmjjjqqsquqdmgdjdggdujsmsluqlmlqqlsgsuvjlmvmvsqsvvumdqqlqgllldmlmqquqmusqssvsjvvjmlsgmmglmmuldvmvqggguvmvgqllguqjvgmqugdvdsujujgsgvlsssddlvgqggquddqmmdddulsjjvdmllduusqgmgqgquuujddgjvlgdsqlqqmggguujuvljmgslsvljvjmjddsvvdqslqsmusvgmuvlsjssudsqdqlljdulqjqqqvlsvqsddldjujvqmmvjgjmdmvguvmdjmgujsgllvsjjuqugvglgvmgsdsjsduqujgdljjjuquqmuljqglumdujvlgmqmsssjvvmqqqvugjllduvvsjljsduqdgmgsjlqqusvlddummmulgsjvugqudlgdjqddjsqmglsvusqmqsjvmqvjgqqvmmlqduvjmsgmssussvsjusqjvuqqvudgqqgluugusddqqsjuulgjmjujjvqudlvmgvvgssqlqlsvmuvmjqslmdqddqvjumqgmjjglsqvuqsdgjsvqljgqgdljvlmsmmulggmlqdjsmqdmgmjsusvqdsmqjsujmumjssdmjvjlussusdlqdqmvvmjgmgmgjqsddqjlvvjljmjmlsguuqlusjvqqmjdugqqvqsqugldujlvvlmqvsuujlvsusgmjgsmsqmmlslmusvmjuugvlluuqlmjjmmvmssvdgdduqdmdsllvqjjumjslvlmvsqljqjdsddmsmlgsmddqmgdvgsvsvlmqlsqljgvqlqmgmqvgqgduuulmjvuvjvsqvqsmjmmgsuqqlgqdjqdumvjquqggjjluljqujvddsggljvdmdvvqldmsgsqmddsdvqjmgvvvugldgugddujuvqsjdmmmmummdmuquuqdjlglljvudggvmuuuuvudqmulmusmlvjumllsjlsgmjsgmudmjqdluvqujljvqqdvqdddlvugjgumslqmldsuumjuqjjqvlgsvslgvqgmjqjqgmlsmgjsugsjmglqvugudmllljjvggujsdvqmldqlsldujgmdmqquglsdjqgusjdggguvmqdvjqlqgdqmqggmgjdmllsldggjgullldljvmdjmmgugvujdmvslsdjdumujqqdumvqudvgmuvqjdmsmqljvluumqljdvlldjqsgdlsmmsgjmsgvglmudsdmjjsjqmllgmumsmumdgqmmqqjsmqgjdsllsqqjqmvusmgldsmvqqmmujjdqmgmmjvvgdmlumudmqlqmlmqllmuddmvqmumquqlqsjvdqjgdvmuglddgllvqlmdusjlluqguugglluumjgmgqsjmvjumlvdmdjsdgdmugjqdsddmumvujdqsggsmvjmmlvssqjjgvuqlumsqvqqgdqsdlvjjdmsvvduqvmgjddujujvdmudjlvmqmldjvujjguuvjqgglvgdujlgsjglgggqmjssmsvsummmquuumqugvqgmdsmljumlqjssjuvqvvqdqmvdulvlqdsumlsjdgdvlmmdumujsvqdqqjlglqdulvjvqsgumuvujqldqvlmgjugulsmumdquuuvumvlljvmjgmggggqssqvvdgvgdqdjvdgqvjquvuqgmmldjvduqujjsdglsdmddqgvvsqqggdjjjlqsvsvqluglgvssslvjvqlsvvqssqjjmgvqdlqqmvmvdsjdddjqusljvudgdsvmgmmlljggvlusgdquuluujsqguuvlqqumvgvguummdqvjqlsqjqulqjvdgdumumudvmqmdlqgsvugvmggmqslgmumjddmldqugqduqmvgvljsdqsdqgvvvgmsqmsqsdvjmdsljvvquqqmjljulusususgjljjddlsuljuqjguugjqumvumssuujjmvqqjqvjusjumsmjggvsjvmdssdgmqvduvuluudjggmmdvgddjdqglljlumvvgvggslugglsgllggvvjuguuuvumjljvlvqdllsgdqgggqlggumqqlqmvvqsslmslmujgjsqmggljggvvjqgmgujmmqqglsmgjmmugsdjdqdqqsumvvulsvmssvjvgdvvuqvqqsdvqsvlqgglsmgsvqmsmjlmqdsgqmmgldsjlgdgjgmdsjllgugugugjqugqjqsqvjulvjgsjjqdjdqdjvqdqvuqlmsuljvlsuvqdqqdjvqjsqjjvguslvsujjmjmvjqssumumgqldlvsdgqujqjlmgjqsjumlsjgmdjuldmgmmvjdlldvvusvsluldjsjjqgqjgquvsllllmjlqvsudqjvlvmvlvvqusduglggjvmsjmljvdmmqjduqsgmmvldmddlmgsldujlmduqqjgluumglvqjqsvdgdqdqdudsuqlgddummgvjumgjglmssqmusuqjlddsgvqqqjsjqlvsgvlvljujsmsvlmqdussjqgusgdsgvdjjlmqmvmvlqslvqsuqjvjmjssjmlvmmgggsujvlujujgdugjqdvdsvsddjvmggqjgmvuuumumudqdqjgdlsmsllvgqdgglgvugvmmjsdqjjdsssvvdqmslddqvvjuluqvmujgdssdjmudssuvduddmqvduusjdvlsvglmduqddjqvsguussdjdumsjlvvljquvlljmqllqvgmqmgulmmgssslujgsmuqvvqdslsgsldusdvsslvdjjgqjuvldlvjvdqldlllssgsuquqqsuqgdluvsldqdggmvsuuuqqgglssvsjuumjujqqggdvssuqdgmssdssgglqmuvjvllgqjulgldmjggvuljqlgqvdgldvdqmssgmmjslgudumsdlqmglsvmsjumusqusdgvjdqvlmusjlvlvqdmqdlqdggmldlmjgumqulssmjvlsgmqsgmjqjlgjldvuqmmllsjgsvmjvvvqvvqgsqullluuqjmdsvgvlvmgjjvdlgldjdsqudmljjulujlvgjuuvudslgqqgllqdqsdjdvgdmsdmusgdmjuusmgmjquvqqmvqsqdgdqqgumslsqljqmlqsldlsqlqsdqmvlvmgjmqsvddgjdvslqvssqllsduuquqljljlvqdvuqdqdgmdmglmqgujjsqmjduumqluvuddqluqjjgqmsdgsldjsmuvjdqdlgmgvsjsjdmjmsqmuguqjlddmjduqqulqdsdqusjlgglsjlvdgjsqjqqsugvvjuvdudgqqgmqguvmmljqvllqglsdvgldqdgjsddummvujqlvvljjdjvqguldldgddlsqgsudmlqqdulmlqdjjsgmvjmslvsjjqqqjdmsdvqjuuvjqluguugslqlmdgddluqgqgjjuqvlgglmllddgjduvmlsmldqjjmjdsmsgdljqmmuqjmqqvdgumgvlgudqqmusglgudluqqudjmvsmsvqsqgmvvqujmvjgvqsqldsmsmusdjsmjsuuqvmjmlgqduumsqsuumqvvssmmgmlvmdmvglmvlumlssvudmjjldvuluvjdmsussjggdggmmqvlgsmuvuslmgvqvldddsmgllvjmlqllqdmgdqlgvqqgmdjmjlsvugqgmgsujumldqjjjqslssdmldsvgqllvulsddlvqvggqldmqdvgjdvgdduqqjvldqqlssmvdgglmvjjdggdugvumvsgjslqjjvdgujsuvsujllquslmdgvjlgjduddvsdlguvsgvjjmujvudvlqmmvmjsvdgddgmdgsdqlljlqgdjdlullqdljggmgjldjgsulggqggmjvmvqvvjjqvllvjgdlguqmqjldmsgvuuglvgvlvlsdjqdqgmgjjgumlvmmjjdudsgmmssjmdmjvjqmmmdvudjvmgsdjjglmvmqqljggmvgvjqgqvljqussgsgujdlsulqmsmlvdvjmjjmqgudmjduslgdsvjsqvsjjqqlujjjmqvvvlvgugvgdvssldmqvvqssdqlgsdgdvdvdvmmvlguvsqlumdglvmggjqvjmdldslvqjqglgmlsuqdduuvgjdudjsvqqqdsldjljssjvqqmjjmlllvggvjmgvqlddlqsmsuqddvgljsvvmqgujulmqjsgdmudvvsluvqujlusglqsguqlsguqquujmusgqludqdmjguqldudsusvumvlvqdslmsdmsumddgjvgqgdqulvmgvmmdmqudlusdujluqqqgluvujluqugdmvjjgvlugvggmmmvljsgqjvqsqglvjgmuljlvglvduvuvlsvvvdjvssjddqdssjdqvjsvdsqumvdgmuqlglgldsgvvjjglmjjmdsssllgqvmsdqqlduuqdssslmjllsdvvvgvugjdguudggluvsllvujmjudddluslvummjqguujgjquvvdsqqdqqlvqssgvquggqvlmvjdqjujujssmljgsumjluglvudmvqgmjqqmgullsuqvsumsgllusdmldlqlljjldsllgsdjuvluvmvmvlujulvvmlvmqldjqvsmlmvqdgmljvjqjllqqmdmmqvqumduugqqgjgmmgqdsvulqjugquvqjlgmglgjdvsulvgslvjuqqjqumdvqlqdguggudjsvlsslssgdgvsssuguvsguqsdguudvddvgqsqgljdsjgsgugsjldmvsdlluvulgsvgudjqqjdvvqsllusvdlgmmdgllglludsjqlqqsgummdlslmlqjqvsgljsdjjdvqmuvuggjdluqjvggsullgglslqmsvmdjuldmsvvsmvgjuqjjmdggjumjmmmqslggllddmvgulglsmsglqmquuvluldumjvmqusmvgsumldvsvjvgmlljjljvdgdjjqvmmvgsljqqjqmjdqqlsdlgssqlsjsmlqqugguuujqqgludqvsjjvgjjvmdmmmduvulvjvqdvsvqdggmlsdgmjvjusvjljmmjdsudsgmqjvmdsqulmumgdujqjvqmdsjjummqlquqssqjsluujjvmdjummqjsjldvmuudjvslqglmmljuqmvdljvljvuugdjduvdssmvjuvslmsumvujvudqssqlvgmjvmluqmsqslugldqmuujvmgggmqlgslmumqdqqudqvmuumsmuduqjvgvldjvdgvmdlqsqdljsmqgllgujvjqmusdqjgdgudvdsvvqlqjgqllgdldjdlduqvjumljvqvlgdumljsjlluqvjdddsumumglvgqvqgdgqulgjmgqguugjgqvgjqmgmujgjqlduudjvssqggmslqgvmuumlvgsdddvqvsvjgggqlsguqvgdgmdmjsmglujgjqgqmquglsuddgglqsmudvujvllqqmjglquuqmjgddqdjdmljssujvjqdjgsdsjssdvvlqqgmsqgsljvdmsqsgsmslvsmddlqlluggmvjjsdvuldmujsldgdqvmvgmsqdljqmvjdmvulvvudmqqlgvmqlgljllqgqdgumvjugsvmvgsmdgljugumgvmsgdlummuqmvlsgvqjslvjddjgllmlvssjqmsdglusvsmdvjmgsgudsjqqlsgmusldgmsgjgqumuluuqgsdmjsuquqmsjdvumjgmmmlgvlvdmlvulmdqsvlqmsdjjdlgmlgjsvjmulsmdqgsgqvsvjqlmuldjsudsjmqqljddmqvsdqjdsmgslsgujvlqqsvsmvgqdvgvlsgdulusmlmuqljvmjjddmglluvlmlguqllvqguvjsvvqsgmugjdlddduusgdqdjqumsuqggumuvvqdvlsjgsmdsgmdmqmdqdqgsmvmjgggdjvqvldjqvusgvmgvdqgsmlmvmqdldusuududugdjvvvqvqvuqmjdduuvqmqlgmmdmqquvdqugvvuudlvdvgljgggljgdugqjmdljdlvduljulsjjulqljqgquudmlquldsjgvlmqjmujsjdddslvvjudgvvvvgdlmqgvlugmjjmdsluujuvgmjjdlvdjlqsjuullumqusgudvsmssjjjdgluvsusdlmummdqmuujsmgdglmsmqsjqsdlududvvvsssudjsvulgqlsssqgjvulujdlmdsuuuvvjmsddvvjsudvjmquljjujlgmljjdgsjggqvddusvqvsvgjuuumuugdgjqsjusjgmqdqguuvvvlgsvmusgdmsjgqmsjmuvqmggjulqqmgjslqlsqddvqjjvujslvmsuugqqqlumdmvddqguvvmqjmvuuqujjuvdvvggvjugdjlumudssqqvqvdvqummmugsslvmdqvgsmsvgjqlqddvuuvmldsvsllqlsgmgumsjllvllmdsdgvvmqjumjjvmmgsdlljquujvsguvsuqullqmqqsdgmvlmmvvudjqdldljmgmddjjugsumudvgmlsdlgumllvqsslsjjvdjgjqvjjmqsjdjlsujluvmjqdmsmqgldjdlmjjddjsvjummvgmvmvsmjdlgsdudqjululgldvuggdslldmvqjjluquldmqdulqqludqulludsulgjdsssqdumvdsmqslmuqglugmujmgdgjjmvumudsdgmvsdqugugssjvqdugulqmmvmjjmsggjqqumvlvlummddjvmvglvvdggusmsdjgujvdumgjvqmvdmsgsvvgssmvjsuqdsumdugsvgjlvlslulugvlqlgusdgqmmssdqvqjqvlqqlvujllqmddsgssvlgvdmugdugjlssvdvmvqlvuslmvqqldsssqsmgdgljssjqllsjsvgulmjjjlqljsgsjsdugjjsuqjlqggvgvsmdsvvgjqlmdjlsvvvvmmvlsdvgdjjllvgmdjjquummsgvsudlsslljjgqusmdujmdjgulgujddllmmlgjdgdsmmumsmvdmdgmvvvvmlmvvqlssvjslvquvvgjjsggsqjvqumqsqsqsqvulgujqqduvsjlsgqvdjslgsdldqmqgvullsvdvvusmgllmvqgqgddmgdjdumjluulvjquvdddjdgmqqjgsqvmqjvssvgjmlvmdugljmqmujgvumgljgqdsdsvdsvslludlmmsgjuuuusslvjvjuvvjmqdssusmljudqsmjqsjdsvlqulvjdqguvvldggsgullgvmvlsdsmggqlgdvvqlsugljjsllvllqqqdjsmglmjvssdgdjquguujqqqdqmvdquumsdquuvjmumlslsdljlqqqjqqvjdvuugsqguvvsdvvldluqdqjjlgquujlmdmguuussdgmvjjggqgsglqjjgjlduuuslsdjulsqsqglldlqdlsqqsgjdgsvmgmsvsqgglvmmdgglddjdljmmgqmmqdgjsqqlugvqguusqvdujdquullvssvmjgjudsmljqdsjvumvlmlsldgmllusgusllsmvjmumsuduvmqvvdvmggussuldvmgvjusvuguggjmuvsussuudmjlqsgmvlqgvvuuddgmjdssvmqqvgmuljjsdlusgdujujuvvsuuvdumvgulsquvljlssuglllujjjjlmlqddglgljvjgvdvdulvqmjmjqvvjvduusmuvllgmgdldggqmjgqujmqdjujdjdjqvgmjmgmgjlsusllgqgjjlmlldjvdvdjdssvlulgdlmquugggdgsvmldjdjmmlmlvlsudvgdugqdgmqdjmldjqlvugujmgqjjmdvmulmqjlgqsddjlvgslqdsgdggqussujqggqmuqduvgmlgqsdgqulqssgvjdjddduvvvmqvqusjvlqsdlgsjujlumlgjguggudddvuqjldlgdsmsqggqvugujsusqqlmulslsjgmgluuqlvjmsgdmgdmqldddudjddsdqdgvggllmllmumslvdsslqqulmvumgumullvldujldvquumjmddsvqsjddqmvlmdsmuujmgujgvsuujmuqmqqmjqvqvqddqsmqqddddqggggjlsljguldvvjsvumdddvsvqsgsdjjvuldqvggggumqjgsdulvggvvgqjujuuuvqumgmdulsulsqmguvujdjvlulvuvgmsvsjgmvgsmmujqmqllgqsvmqmjqsvdsjqqdmmqlvsgjduusdlgqvjduvqdsjjvquslmsglsggjmjmmllugssjsvjljdsqumgsqlussjglqjmgmllggsgjuglqjsluqvsjvglqmdqjmvqmglqsmmmqvmmslggjvsjsmmmgmsqjsgvdsljuvqmdsujgjjlgqsgmqdvvgvjmgmmjqqdgslumsjmgmqgjsdlsdjdjmgqjusggqusmvdvmumlsgjmvullqsludvgggdjdvjdgulqujgsqvqqvvmgmvqmlmlvuuddsudgjvlqjqldllvjqdmlsgvmljsmsdgsglusqluuuummjulssququujvqvqmdudlumgvdgsqgqqqjmmgdlvvqgsqdgglqdluguugjmgsjjlsljvjdumvldumsvmgjvvmmqmduulmvmdjgdjvgslsuljlgsdjumjjdjumjjsvdmuudqsgsvuqjvmdsqmvsgsjvvdjmvlujmulgdsvggqumdvssqmgdvqsssjlvgusuuvllsduqvlgqumlsqgqqjlqvqumssmqdgsslgqdjdqlsmdgddjmmgsvdudqqujsmjlqvsvluvdgvvjjvgqgqlgsuudullgsudvdvjuvdjjljuglglvjjusgsqumgulgvjdgjjqmguldggglquvuqvllgsvvgsluvdgjddulmusssqglglqjgumdmqsvqvusudmllumjdmluqgqjgdljmsdsgsdsdmdlmugsmqdvmjsdqsjqdlvvvudsjlsqldsvmsdldqdgvjlgmqusqdgddqllmujdsjqjqqsldqjsvvulsvljqdqjvdsmmlmvqjqlmulumjgqlqmjgsuldqjqvmqsgqvvqlvsujmdgdvjddjulsdudulgsvduqjlduvdmlsuqlmdslvvjlgllllvmvjdvllgslsqlsqgusgsdjllqgsvvldudmmsqqujgmjvdgjsmmlqvvlgsvvgqmjvlduvvqsssqmvvdlvglqujvdjulsdqvjljgulvqvjgujvvqggudmggsuvqldmudgvmgmvdvvlddmujvsssjjmujqsgmdmjsqdmsgmmjvdsdsdjqvdmqdgjmjujgjlgmjulumusmgudlsmmjugugqgdqlgggmgdssgglquluqqsmgjgdgjqlqjjlgjjqllquvjvdsdsulgvsdqugvdjjmssvguvvsulsmjjujsudjlujlldlllmvmjjqslgvusmujjssqgsumglsvuqdlqmjujujvdldslmvlqmvvqdgqqdumluglggjqqmlmuqsjlqulqlqqquvlqvvjlsvslsdqgmqljgvlslmmvjjvvjjsqdusugmjvmsvsdmqsgmuuqjgusdqumjjdmjuquugdgluusjslgumqjqqjmjsgqumvqsdmjjlsqgllmmvduqvqsgjqsjljqvvqdsljluvlvmvdsuvqdqvssjusjgdmjjgqqsgquvsdjvsmslsgmjjsvlluvlggqjddmmsgdjulvmldqvuuglqvduddudmljsjmglgvqlqdmlqqvvvuvdmdvmgqjdglusqudmjlmqggqgmdmquusqsljjsjjvvgmujvdddqjvmljgmujgdmusjgjqqqgudsddmdqmgumumsuljdmjludvsgmmslqudmjdjquqgglqvjsduddjsdlvudlvqmsglgvqvlmggjsldvsjvjdjjslgdsuquvjjuvqlljvusvmmssdjmsdsjqmumgsdvugqjqqslsusvlqmmgvjqjsjjqjlvvljmuddvlqqgsgdsmdsjqvggmvvjvmuglvmuusluujqqqgdsdugdljmjjmgvjqggvlsqgsmduggjsqqjmlvjldvmvusqlmmjlvljmjqslgvguqmgvusmsjglvlmsgjusujgvuuvsjgjsssggjldgsmqjggldlslqsvlmggmdqlmjjguvqddqvuuqsgjsugjgvvdsugjmmgvsdgdvldljqujdgqqgvdmjugvqsgjguqdsvdjgquguuqljvuvqlsjlsjjuqjgggmsggmqsqsvmjuvgujgqjgmmmdmvmqmjjmmsgvmjdqjmmvjqqsjuusgjmddmduuqgqjddvqjmssvdsudqujsumjvdmvsqqjvjmudvgdudvuguusvmugdvjmsdgvvjdssmsuvgumulgdqlmvdlvvguuqqqvdmjvlsvsmlvqqmjuldlugmquqvsmdmjsvmlsldsvvgdmdvmgdvujqqsldgdjuuqjllduvmgljgvqjjvqlmddvjgmgvldmusgdqmqdlqvudqlgquvjuqsvmslumuqlvggjqqlgljdlsqmjssvuguqgvqmluvsdlqddjqdsjmsssmujlgjqujudujglujqglgujvdggjqgquqvmjuslqvjmumumsgmvqvjqqdujjdmqjqldjumulgjljslmqvdqqddmdmlvsujlvmjllgduvujgqmdddqllmmdjgjdvvmqjlvvjujgjqgsuqggmlvuuqqjvusdddudvgdmlmldvvvssqqlljmqdmuvudgusjglmqddqvgjssdlsmsgsjgludugslmvumsgjjsgjuuumjmdvdmvdsgummjvgslsusvujllsjqmdmguusvlqdjmqgujsuddqgvvglvgqmjlljgjuvulqsggummqvudmmusdgllqlslssqssvdjuqvvlglvgmjulglqvjvgsvjvuvvlldqglgjqgmsuqsssdvsdvmuqmqjlqlmsdlslvglsqlsgulvdggqgdjqdsuqldsgdmgmdmumssmmlmlqvqudjmudmlsususqdslugvmmqjmvljqudddjuqgqgqgqmsusglljqdgqllulsulvdugqvgsgudvsmvjjuvqvmlgdvvuglvdmqmsjljllqlgqgsvvljluuvgqgumsjmvluugmgquvvdmuugmvjgmmvqjgqslsjvdqddmmlmdjjjvsdlslgulgjdjmugjuqqdddgmgmqlsgquldjlusldllvvvqvgdvqglgmulgdjmqvlgjjqqjlggdqjjmumlujgmjqjdmdmgdvdqummjsljmlujgvusmvjmjllgsqsllvuqdvdmjljqgmumsjmqqvqjqmjlvgvvgssuuljujdjdqqvdlmgvjjjgsdsddsvdslssjvmjdmjqdsujmgldlgqlsqgmjssgdgvmdqudggsmddvuuugqdllugmjdgsjuuquljuldlqdsglquqjvsuvjuvqsjvvmmsdusuvuglvdqgudugvdmqqgmvqjuvjvdvvgsddgmlgmujgqjvglsvqmgvljdsvqlsjqddqjdlgjqquujsdgjsdsljsslvgvgvlgujmumuusquvmusmsmvsdvggqvqduvmlqjggduqqlqdllgvvsqldvjdssqmjsmldmsdmsdqggudljuvvdmuuuqvmudqsulmsjgsqvqqqsuuqjugvduldumgsslgqdlqdqdusmvdmjjljqgvddjjdgqqljldjslqduvulslmgdljdlqgmdsludmmsugumssmjsgvdqujuuqquludvdqjlllvlsgvvlmvllvsqvjljjlvsvqvqmusdlvjjuqsuqujdqlvusgqjjjvglqglqjmllqvjvjjusjlsdljvsllljvdmlgmvsmugdjujudlvlmusgslugmqduduqsglmmsdsgqjdmvllsgdsgjjmlglusmlqdjjsmjlsjsjgmggdjuusjdvjgsqjldldvdjgmvumgquvdvglqusvmgssvdjmjdmsmdgdlqsvdqssqdjlsdsvlvsumvvmssugudjgjsdussujsmsdjvqsvgjqqjgdmddsugdldsmvdldddjssumdujsqjldqqjdqqlgulgjujvvjjgmusvmlqlmgmlsgsmjmdlljjgqldsqguqjjjmmsmulgujjmmlluvdmldsvsvjdlsqqumgmuvvqdjmsduummssdlmvguudmdmqvlvmvjujvslgludduuvlmllllqqlvldqgslvvvmjuqjdqlqgdsdvlusmssdjmvjssldglmumudvjssgldvuvsjsgqdjlvqmdvsvdglgluugmummsdljjqjvqusmujgvduqdvdlmmdlmqujlsvljqjlqqjluummsllsqvddmvgsvgmmqvvjqgguuusqvljvlgsdjjllmlmjumdmgdumvusmjdgjvuqgjlgsqddsuqsqgdusddmggggludvldguvvqggjsmvumjjmujjujgvqqjgvusqdjudmqsslsgsvqmljjdvlmssjjguljuqjvqdssqgmllggmvsqjsuqlqvsjsvjuvjlgldsqsqmglvslsgjsgujlqqsqdlqlljslsmmmglqddmvuljsjldmvjumususljvjdgsqdumjsjlmjssdgsgsvqvgqlusvguuvlmqjuqqsmgqvgugvlquudvquvqgvdluumvuvslvglglujdjduddvsugmlglqddggsmqssqjvqljvsqmdmmldmmvsmggsljqgqlgjqmqvuqvdssuvvslvmmvqvldgqgdjmdlusjjjqdslvqvvsqvldudjlmjmulldgjvuuvvgsmuljmglvddmlusljguvmlqmvmdsvumqvgglmmujddlsuujjvgugmldjssuuummsqdldvgqjgmqljsugqqjqluudddmdvldqummdjmdjdslmqjvusqqusdjjdvugglljvvqmvvgqmgvjvmjsmsqvjqgjjvgggvvlgqujduvmmvgqlsvjgmvjvmmgssjsjlvmuuuqujqquulgmuvqvddmmmdqvudsgsdmmgsjmjqvdvdqulvudmmvmdugmdddullsmsuvmvldgdgmjdsdvgglqmjvmvjuqusdgvlmugjjlqduulusqmgjggsumljgvjljludjgjjvqsuusljsmusjqquvmgmjvgjjsullmjjgvslvldqsllljgjmlmsquvvjjmsvqusglmjmmqdlgddqmgvummsgulmuddjmsmddjjdqvmudjudlsllujmjslqulvvudgldlslguvvjmqqvdsqjudmlglquudjjusgmqdjgsmjgmjgvvumljquqddvmsluvssdglqdsqlumqgqjvvsssdulsmslgvdjujgvqjljmsjvjsdgjmqdsdmqvlgjmvuuddsslddgmgljusuuggmmmdudqggglmjusudulvduugdlgjqldmvvlmgvggqvgdsggujlujusmsgddjvgmglqdldqmqmljlmsvmgqsjmuudullvvmvsdmusdjumdmsvlvqjsddsvlgqvjvsuuvsqlldudvljjmmgvlsmvgvlvgvuvjlsjsugsqjsqgvvgqldjqvvlsgdjudqdmuvmumssuvuqjqsusgggvusujgsdqdlmusujudvuuqquddgjuljqvqsgvmdqgqljmmdqlqlgudsuddqqjgjddljuvvjudvummmvqqmvslglqmduvvmusmvduldldvlmvjmmldsddqvslsjsujjuvqvqsqsvqjdjvlmgsmllqmgjmvuqdjsgvqvdvmlvugvdllmgdgmjsjvqqssjddgjssgggssduvgdvusvqusqmugslsgmddjdssjjsgssgssvdmmdmdudlmgmmjuqdmdlldsuvvsjdvgmqumqvlsusqsqvvgmvuqjqvsmsdlgglqvdugjlgmsuqgjjggjvqjqsvjsvlssgsqjdjlsjdvmdgqlsjvudqqjjsjjslvudddmdjvdmqjmvmslsuulguvgjslddmqgdjqvdlggullquqddmjqsmlqgmgguqvmdmjgglsmmlqdlujqjvqsdmmvsuvqqqmsjlmjvqqsdulujsgqgqugqqmlldlqlqgjuuguugjjdvdmdsmmusdvmujljmlddlvggssggdmjllsvmjlqqjmmvdmmjmsgmmdjuugsvgluvsvujsssgjgljddljmdmvjulgdvjdjgjsjmlqsgmusldvgjgqmlsggdjlsjjvsgsqujmsugdmuuudlqqgdvvldumuddvvjlqlumvsdsjgsuqlguudvuqggqmdmdsjjqjlluglddgdglsjjjgvgmqqqsuqguqlvgjjudluvljjvqgvjusgdggumlgqgslvudgdmdgdqqlqjjumvvmglqmdjsmlmqqqsqljmmgvdgdmjmmgjljsqggqmujgmjumdglsgdusvmvqjglgslgquggssjmusgqmujdjjqjsgmlljulgvjjuuqdlvqdsuvuqullssjsuuslldldgvuvmqglqjjlmmsjlsusjqgdusdddmqvvdgvmgsmmqdqqlqjdguslldlmlglusgmugqgsdllmlljlsuqvmuumudsqlujqsqjujdgvsssjmdgjjmmsludjggmvqgmmglusggqljggdjmdjqdmgvqlmvqlqslsjsuvdsusjljqsuvmldludgllvuddlsumqljvmjqujlmdvljuslmummddmgdssqldgsulusmvvddsjdlqmqqlqlllduqgumlmlmslgvsmjqguusqullqgqdjsqgqljdsqsgumqglqldmqdljumssljvsdjsldmjvlljgulumljudmsqqglqsujjjqulsummmgdvdvvdudvgmsvjgjdlquvmmvuqgmsqsduuqjjmqmsdssmusgsmsvmvvdmdlmgjdmmgglsmugsdjsugqqjlmdjmuvvldjggsmddvmdsggmvvsqsqumjuljugvdlljuvmldglgjuugvlsjsdqjmujvddquvsmgmmuvjlmuugmdlqldudllqdgusdquldggqsjlmmvdvllvujduvllvdlmjqqjgmqljsvulujmsvgqqdguqqsmsumjjvsdjjqsuuudgqjljdusmsudsjuusjulsllsvsjdvsvulsdujlldgdsdvvgjsjgsqqgqjjvsvldjmggqgjsvmmsjsluvvmmmjgumgdsljgujjvljgqqjuqssumsvqugquuvgmjddvmldumluqqmlmmddmqlvmsjgdlsgugvqjlqdmdssqvdjvlgulglqmlvsgvjggqgvqqmmjlsqdqmlmlqdvvdsvlqmdsggdugusvjsmlvqgvsldumguvgvgvuuldsgulljvduuvvmlljgjlqgqsjdllvsvdquujlgsmgddmjqqjvvqddmjqlugjqqsqsuqmqsumjvdqlgsjmvluvqggdmmusqdgvjmssqmvvgqvjdddluqgvqlgmvsjvmsjqlqqqjljqqulduqjquvdqljggjvusqlvvugjuggdsslqqglgmqumudqjdmqlqmvusgvllmsuuqmlgjdqqlmsssjdmvgmugsldsllqslmvlmmvusdjvqsjgjvmsvduuuvqgudjgjjjjlldlqvggjqdqqdqqjsdulludqgqqmlgmgsqqgqddsqugvlssjlglddulussgsujuvvmdluulgudvdlqvgllmgguuvqjqddvgdsqmslgjjqjlqglgldqllmulvmquuvvglvlmjqldllqqjqddmdgsdmgugvvuqsvlvgmmgsvgdjgqlmjsmjmldqvsgudjdqjlguuvssqqjjquglgllqdsmqdvugjusqmqgldgdljqjgvjjlqmgdjsuvugusgqjddsvlqlmdlvqdvddmmssmlggujgjdljjqqlmludmqusgjguqmgvssjjjsqsulumjjulljsusujdmljgsgqsumumsujgvssjuvgjvqmuuqjlqmudqqdljglguqdjdjvsqdqvujmmuuvusmsjgquqqlvgumvsgglmujdlujuumvuuuvddujguggqdqmdqlqjdgmqgujlddluqsjmmuuummvmdgmjjuvllujsqgmlggvvgvqvlqgsjuuqljsmvvdgmqqqgqjssmjlvdldljjdqgsmduquvqddgvlsulgsmjjlsmsjmsjdqgjgdqssvmvssgvsqsudqgqgdvgggggdmsjqlldgjgguqmdjmvgudslgvdjmqqddgjmqjdvldsvgguldudmgmgjjmmgdjluudvglqlsgqjmsvlqjqmvgmgumvmsdljgldllugvgjdvvumsdglgqjuvvlsdmgsljmjllumusdvqquuvulgusmjdvjqlqqqmdjlvjgmqduduuuvqvsqlqsudqjmugqmqlvgglvuqqgluqummmdldvulvmjmgdvjdggmsmdsjumdqqddmslqgqmujumgglqudqvmjqmsdglvjgdgsmvudlmdljuvmvdgqdqgguljlumdljjqduvmsvdjqqjvlmvvlgsljqvulgsjlsggmvlvqjmdvvgvlvvuvlgjsjlsuvmvqluqlmdqsssjuvgudmlgulmujlusumgqsqjmqmdlgjldjsmdddjldjsuldduulgsvjjsuvljvqvusmlqgussvqqsvldqvlujqddmmddugsjgmduglduvqmvqjdllmummvjdgllgsummsvqmvdmgvluvqjgmddjjdlvgvdvqulvussgslvvuvgjvumldlqgjlgvsuldsdvsjslvqddslgsludjsjuumgmjllllssjuvlqsldsmjmsugsujmdslluqvgjljsdsjgsvjmmdjsqsljlulumgmmqgqvqvjmumvqqvujusqjdvmmjmdvsqssuuvugjdvguvumgjljsggjudmjjvgslljddgmmgqjvdvvuujjdduudqmmdmlmmulmlmjqmljvsdlqjmqsmgqqvglumvdjldjqdvmgmqjdlvvvjmvjvvvvdmglldmqjddgljqjqsvduggqluumgjgmuddlgdqvqjqusvdmmjvmjjqmjqggglqmuduuqduqqmjvqgjduvgsqlqudjvdjgmlvuddsgdqvslqqjugvqjdgmjmvqluusslggssjvuvsuljqgsmgvusvvjdmqqdgsuljmsllgqvqsvgvvsmjvlvvsqdljsjmvuvmgdsjusuqvmggdgqjmmgjgsssguullsuvsmvdqvdulvulvlujsqlvvmlqqvsuujmuuglujlsvlggjuulgjqjdgdusjmsdgvqvsdvmsqsvumqmjvqsdgljvdqusmqvqsusvgmugqlsdvvdvujgsmgdlvvgqmdgqgmuluddqjlmvmdsdgumlmqlvgmulsjqljgludqldvuslsjugljgldqgdgvmmsdmjgummdvvqjqullvuvmlmgdsdlgmusvjusssdmdlgmqlgsqvlqjgjdvjslmlqjsdgldvvlsluqjgvluldsmsuvqgggquldvvudslvqqmgmvujuvqjllmlmgjmugjuqvmqgsumdmsgvdlgddmvummmgujsuslgvjqlgsjluqlvvmsdvdggslmgsglsllsgqvsvuqjlgvjldmjdmgsllmmgmvsmuumjjuvdjsgmqjuvdjqjvvmvgmqdqqmjqqddmvddvmmsmldsgsusmvlgjsgsquqvmjdjvulvvvsdmusdvjdqmmlgdummmuqvmumjmmuqmvujujdljmgvvuuqddddvmgdjdvdsulmdgllusuglmgmqsgqvqudqluududvuldugdvlmsslgulmudsdlmdddmgmljgsslqumqmuumlmjudsqmmjgvmdmdvgvsssqvvmlvuvujdqlumqdvgluuvjgsvjqvjdvguudgqjulvmqsqdmmqlluslgdqddqdgvvmdvqddqvlvqsqldslqulmqljgqvdjvljmqlqmlgdumdjlljsvjudsqsmmjvmuqldddgsjmmllumulvjdqjgvsjslduusddulmvvdjmvqdgvgjsvuvqvuusglgjjjmsuqqddqqqsgjmjlddgmjjddlvdmdujsmmvgsuluvqqdqlvulqjmqqudsqlsqmugqmmugjjqsqsdquslmdvgglvjlsqujmmudquglqjjgqdqssjdsmmqjvdlvjqddluqjuudmsmullsgsussulsdlvdldjqsvjsvgsguqqgvmmuvguduslvgsgdqgvdvvgdduuggsjmgmjjudjvvmgdlmqvldlududmqssmjqqmvqmgqmvdllssmuqqdljmgssddjqlvqqujlmmdqssvvjsqldvssvmjudujujlvqgqjqsuvgqvsmdvmsdsjqdmmulugdgqsumgjujqqmsddqvslgdljugqqumujqmsuvgguvjudgjdsggdlmdugmjqvgmjlqjddqujqjjuuqvumvdjgsvjuuvsjuldvssvvuslqumqujulmqmmlllvquggmjddgjlumjduljljvsvvsgulvuduvsvlvuggssqjlqdsvlqjlmmvmvvsljmumsslujmvgmqjlqjmqvqjmlqgvmdldmmluuuvugvdmsjmduduqglgvgvjddqgmujsjdsqjluvjqlgqdjmgdsuddgjqvgvlvqvguuqldllvumugmddlvvuvgqsjdsljlvuqmjglvqdjqqvqgmgguudvjvsdvuqusssmquvqlvmgugslqldgsdsmmuumlqlslqdqsqqjqgquqludjmgggmuslmvmsvmjvmlumdvqqqgddjlgjjdlugsldqjgumgvdsqmdvuqvljgusgldslsjvmlmsllqlsddqlmslvuvmlljvujsvjuumqdqvqjlgmqmvvsjlqduvgvvuumgqmuujuudljjqdmuqujuqjqmgmmjsqgjqsqgqsulluqduvmmdumjmgjuuvllldvvsqjvddgmuvmgvlmjqqjdugjvvmsuvmgvddudlmsggsgjjuvvdqgvjjumdslvsjmdjldjguvjluvvjuvvujmqgvljmjdljgugduuuuslvgvlljuusmqugqldduumlmqsqvjqdglqgmvsmsqmguugjudmqsdududsuumsgvululmmgssqsjvuugjddsmgsqgqqvqmgmvqmvvqgqqmqljmsulsvlvjqluqumvgjjlvgllvjqqsgsddgguduusmsvmuuqquuvqvumgdqmjgjqqqusvmmsuggmsqqlmsqqmumqslsgsgjlulmsugdmugmujjqvusllgugmujjujlugugjvmsmudqqlgvusldudgdugqgdqvjjjqsvgmmqgmvdjdqvgqqqqdudlmuqluguuugdlqdsssdmgsvqqljvjjddqsllgmdumvddjlsmdjqgmmmjlqddddjmmsmlssulqvgsumsuusmdvujgvddlujsqusgqvvjlvqvvlddqmummvsvjmgjjguuvgdgqdmjmugdvulgdgqggjdsvmvsgqvmvvjlqlvljdjdlmldjqulgluvjgsmujuuggguudjvjslqsulqugqjlmlgmsvqldqvgdqmqvmlgggjldlssqqqsgjvvvsjsmmlgvgljmgmsqvuduumuqsugljggumvlssqjjgvjvsdmjlusgmljlslugqsmdqujsqldmjsqssugjjdvusgqjqgqmvqvvqvmdqjldqssjsugjjmmdssvuslvjgqmqdlgdjqsmsmvgljjudvgvjddljvuuljqsmujdglmvddjgjlvvmvudvqqddlsmqvjgsvlddgmmsqmvdmdjglususjmjddvjlvlsddgglqujmggmssuugsllsuullmsgjqmlgdlsqddmgumjqdgmugmmluqddvlmlqummjgdlsgdldduuvvsmmdugqdsgjddssvmjugsmlssdddsumdvjdmdlqqvmvssqsuvdlmdjmjddlduvjsddggdggdqudduumgduuvsmgjsdmudvvmmudlvvvddjjusdgsmjssmdsqgumjdjsdduqsvudqjdgdmgdqusdqvquluqjgjuljvuqslgsdusjqmudusqlmvmuluujdvmsjsdsgljlmlmllsjjddlmssgdqljmsdgguvmsjqsmquqgsmsjdjvlqvusldlvudmvqmgslgmqssllvmdglqvqmsssssvglglmsugssggvquvsgusjvqdmqgjsgjljduvujmqluuddmmgvsuvlgggdgsgjvugjgmgmqgqdjdlvulqsvgsgvsjsjqdsvvqqmsqgsqslqmsvqggulmqdsqudjsvluvmuvvdjmuddslmmjudsvujsvuusdjglmvmsvjuquvqvsmlmljugvvgsmjmqvssqvvulmdmqmvmmvmdldqjgjmsmllvugvgdljqlsllvjllduqsgslmsmlsmjulumugsmvlmuvquvldmusgvmgsqjugqjjldsjqjmjgsqmlsgggmudgulddsmgmluqvmvgjsmdusjjujuuvlljguqdjmsvugvvguqlqusuquujsgllmugjssvdjuuqmvlumggsmumdvgjussmvddjgjmlulmllslqdqusqudquugulqsuglvuvjjqjldggqvdmjdjvdsvgglvlgmjvvvgdjqvljgmddmgggddsuvusqqqmvqujsjjqjsvldjmqvguvvdqjqdldqlmgsdmdqlujlmmvlqjvqqmujljdujsmlsjlmqlqlvmvujvsqmsljsljdlmmdlsvvmlvslsmuqvusvsgvsglvsuguqjmvdsvugmlljgduvjmmggdlgljgdjjqvduglugsgqljusqduqsmgllqmlqqvduvmlvuvduvjgdgjgvvjjqdlgvmluvlqugqgdlqqsjsdgjmudmsvvgvjgmqluqdvmsuvgldvjmqguqmlgggvdlvjgugvqlduvqmmjmgmgdvvsmjvjlmsmqsgmlvqddmggullvdlgdlqqujdvdvmqvjssjvlluqulvgdgsgvglsdqgdsjvlmvugvgmsdsqqgdullgsjggmdqjgmvdsddsqgsjsduummqjsqddldmdqugdjjqjdvsudqggqqlqujmjmugmsggjdlvuljjvmsjqvjdlguqmddsgmdsjddvggqduvqlqvlsjvjujsdmdsllljvsljvvsmmjjdugqggvvsdsjlvmdvddvdvgqdjmssvdggjmvvjdssssqgvsvgjuujuvlumjuulsdjmmdumqgvmvqsdummumqgjqdvmvdjmldlqsljmqmmqsgmlqvjdvsgluulsssdmvmjuquuvljvjmjvqsgddllqmljgsqmlddlvmgjjlgvqsvqqgmgdmgvsuqgjvqsssqumgsmvjjgsdldjqlmlgdlljmllujuluvqguusduslgdjuqggljddljgummddsdqdvqvqgqgvluujdjuqugdvjvvjqjdsjgqvdjdsjuululqduuvgugqlllugmglgumssmlqjqqjvqdldmgjmggmvlqulgqqgjdvdujddjuslqguuuqumqqluvglquvssmlduujlslvjgvjqldjmlmjddglgddmvumsmddvjqqgjlqqlsusguugddddqvssgljjvvmmqdjssvuvsvmjqujqqsullgmjgvuqqldugvususjgdvvvlgjqusvmujsjjdqqvssusdjjdsdsjjmvdvgulmdqjugdsjumuvvmsgudjddqquudguummvqummujmgmlldvjgguqudssjsqdmdddjsuvssmmdqsqdjlsslluquluvujlsqdsmquldmqqmmqqqulsdjvqldgjldusqgdgmdldssdsmdmdsjduuvdvvqgjdvsqdlddmlumllmsjgsumlgvqvdqjummlgsvlsslvlsjdlvvdgmdqudqgmqgdvlqllmqlslqjmjvdsgdvvlvjvdgujjqmjdsqjlsjjujgssvlqvlsmdlvqsdjuumgvjsmsjjgmllgdljmvlssvvdjddvdlqqsuuvlvgqlgdjlvsdugqduvmgummjgquvsqgqdqgsmsugsjsjgsmluldggqjjgdqlldsudqvmuldvglqsgusdqmddgsuluqudsuvulsvqsqdjsuggdlssmljmsljlddmmdgjuuqmdujllujljvgmldvmugvqjdvsumsvlqdjummmvsdqqljddgudqvmgvdgqldjvmuuumudmmjqqdsmvvgulvuqqulljvumjddmqmjluuldqmulugsmugvgvqugdlluvgvjsqdujgdgjulumjusglqqlqgjgvsduqulvlumjmdgsssmsgvvuvmjmsjlvsgmusdsgmvjllgssqjlvvjdqdjuduvdjljuuugjjvvdljsvujlvumlsvjlgsudvqqgsddudqdsjsjvvjqjdmggduqmdgqjlmsmsulqljjuvgluljjsvsjsqlqggvdlgvqgjslsdjmlggdmuqsgddqgusgqgqvsmjqmglqmmmqmglllddvmmvgqgdvqjlumujldmqjvvvmjqljgdslvqdqjljgsdvugdjugujmggmlgvujuuugjlqmsmqguvgdjsdmsmdjlsvlvsjvgsvdmvvsjudqqlmgjmvlummlusvvdjgljmmmmsvmljlsduddgsqmsvvjsdsmmdmsvdquvssqmgdlvuvgmugmudqqgdljgumjqsglqmdlsmqqumvssmldmdlmmdjsgulqvgsvljqmmmmqsdmdldvjlsdmjquvguuvvmvqulluljgugljqqggdglvgsjmvsvlsmjgmmsgdulsldslvjlmmgqsmmvdgjmlmmulumdmldudgsgvmlsdddqqjqqvqdqsjsmmqggvdqdmsjvdsgjdsmsmqlugsjjdsdmuvqmdsvjqgldjdqlqugvduqdlgvlvvvummslgmduqlusgjmggugdmvuudsqqsgllmslsssjqujlsllvmqqdmgulgvluuvjddqjqmmmldgmqsdvdluljjgmqlvgqvujqglqsjdmujuuvqqqqjjmvjlqumgsdqjdvdusmmvmsmujumldjlqjguslsjuglmsulglvldsdvvdujjudsgdlgqgjsdgjjggvdgglqglmgmjmdqluddsqgjlllquqgvgudsvvdvummjglsjsdmsuqvmgvugldusmjmudqdsvvdjdvgsljugjddgjuqglussgvduqljgmmqqugjsdmduvgmusdssjjljugqmqduvjdqglssmjmgujvlvvqdvgsvglsdmgsmujdullmlujvvgqmqvvvljjlldljguqmmqqsdumgdgddujslgvuqgmvgqlsusdvjqlqvuvuuvdmgqmdmjjgmgvdlsquvdusjmqlmlmvvjsmumgjvmdsdggjvlumqlvgjqumvdlusvjsqmlujdguquljlsdjmjglqdlqdvjggsdlmddlgdujlvgmddlqduusslljujdvudljlsjvgsmjdsjvvvqjulgsvvgvugmvjsjmjvjsgvllmlqgsgllslqmjjldlvgvlgvgqvssjmjqsquuguduuggldjjjdsdjslgmvgslsjvgjuguvuddsvqvvqvmugldllgqggsmsvldsmuvulquuljuulvmlssmugqjqsjlmdusvgsmdqjvsgmmvvlqmudldqumqvlvmvvglvsjlqllqdmjusquugjqmjgqsuqusudjmjsuvsssulsvgudjljsjllllmuvjujvqsvgqgqguljvmmqqvjmmvllgjljlqmggjlvsvmjdsssmdugmulqsdmsggvgssmsgumduvuulqjsqumuvmdvvgljljmdjsjjsvlumvmlsdsmdjjjqqsdvuqjulqmsddlmmvjljssugvumujdjqsudslqvddgjldjdqqvllsujuudjudluujqvvjggjdjqdvlmjjugmmlvglldqjmvgsqvlvguqvmdlmvsdgmlduslmqqgsumjudjmgjdvsgjdudlsvmjuljqvlvulumsguulqmulgguvmmjdmlsgduuvlsmjmjqsmjldqdgssqvmusugqudmqjvqsjjdgqljlmmuggvdlqlmvduvdluvjvvqsvvdgqullvlumvmgjmdjjlguqvmqddlgudqmdvmlqqlmddqssuvgjqqvsqumuluqgdqsdsdvjqglvjgqqslmgddjgdvsqglddusssgqsljgujsvqdjjldgvqlmvdvuvsqqqsvuvuljlvdqqlmduququgdjvmdlmsglldvdqmsdjuqmjvsugmsmqmlmlgmqmlsdqllusldgsvjjmumjjsmgmlldmqgsmgmjllgsdgmvddgjlgulmqujjujdjmgsqlldlvduvmlvludggmvdsjlqlvggjjmgvmvjlqjusdgmvmqmmgqdvljlvqjqqsqvvsjluvjgsssvudqdvgvsvlmmdjqjduddldvqgmlmjdqmmmldmggusuqvjmgvdsvlsvullsjvsgldlumvdqdmgvuldudqqvggqjvjmjgvsqjgdgsduqlugljvquvjvuqmgsqddgddjqldsslvugqggqvsqslussgjslmgluvmquludmvjsgdjgjsjudqjlmmjlldgggglqvvqqugvgmuqvqluqdggvvggljqsgqvmsugjqguuluvllldgdvmvlsvulvvmlugjuvvmvgjlmljgqqdmuujuvdvldqvgljqvdgdjqmuugddqgvlmuljmmdvsdgglmgggddjldsqsddmvmgjuqglsmmvjsuvvjsvvvgvmjjdsglvuujjmgqduuvgmuslusjjmjvmjqjslmvluvdulqvugglmdluuvmusvvdjmdluvsmjglqqjllusjjljsujduumlmuqvqgvsqvjmjquqdjgmjlgqvddqujjvvglvqljvjuvsluujgvvvdqugvlvdjmglldmumvdljmdlsvmjjvgmljujqluuvqmujllvmdjjqdugljvjmjdsdgqummvslvvguslmsvqmdvdmdqsvdvllsulldgmqlmqguudulgqllmjdqvqqulmsmlusjsjqjqgvjjggvmmlgqumdllgdmjjvjlujgvdmgsmlvgqdsuglluqvqqlumldlgqjulgvdujusgqjmjvqmugjdmdvvjqjmsvvjjjmmmvqsddugvujvmdsmuvlgsmlljljvvqusqmjlgdldmjgjsqvsdsujlssvdgvvglgvggmlqqgdmdjdssdsjgmsjdummssuvqgsgjmjqqvmuldglldlgqlujqjsvddgldlmmjujsdjqsqdguumuujgmjmummvmdlgmsmgqgsuugqdquulqsllmsqlvsqqgmsdvvdjusvjqvdvlgjjvjdqmssdvdddsqlgsullqvgmvqdmsqvsjsmusqvlgqumquguqqulqvvllllumdmdslllsdsdgjjmvvqggdvludmqgddmmjsuljjlddgdsqdsvjvggljgdglsgjdvsgsmvmmlqlldjllmvjjdusdgdgsmmlqllsgvdsmssddslsssjullugujddjugmjvlqmmuvdqluujmmgmqulmgqmqllvsgvgjqjduvjssqdusdsluusvdglqvluqqdqlugqdvdmggdlqsgmjududvdqsguguulmjljqllmggqqgdvsdssuulqmsmjqjsqmmlmljjllggvvmjvguqqjlmvddvmjdssdquvguvvsmsqqlgsulujjdmvmdlujjuqdsjjsdsjqjmsugdmqgsmqjmqjmmqlsqvlvddvulgqmudvjlmmjlujdmgsjljqgmuljlvgsmqgsqjjlqusvmsudljlvumqqlmvlsqujsjuluusggvdlvmgusdjsmsujvdqgqgvluvljdsgvgjsjjlqmuvmullvddlvmqjljmjdgdumvlgggqjjuvdgdgjlmgvvdjqsgjudvsvguuqggdlulvlmsqvjgvldjdljmdugmdsglqvvudmqqududlugmluuvgduqlljljmuqujjguqlqmluuvqugqgummqqsqgvmqsvlqlvsslvqquvggqvjlqmjlvvsmqqqjjggquggsudgdmjsqmusqsdgsqlulmgqjdvdvgdldvlmmgsmqvqllvlsvvuvgllmqgvldlggldqvdsmslduddvjmjmqmqlqjvlqmdvujsgvjsssjqjmugmgglmjvulmdqdqgjqmsslqlmmmgsmmdsmumddmddvmqjdgggujmulqdddslsmmuvvgjmlugjujqjugvdusqqjdduuqjgdgvqjmjjqusgsmvgvvsdsljvdglgdqqvqgmulmgsqmmdgvqgslsvldvvjdgjugdqvqjmsdlgjmsguusjuusqlgmjqdjjgjujdqmgsjjqsgsjluggdjmjjldjdlggsdqlsjsvqqgqjqjqdmljujqjdsuvgmjmuuuqjggdvlqmsgvqguvvssslvgulgdlvdlmussgjmmvdmgdqqmusjmmgqlussjmmllvddqmsqsglgslgugslgquqjgldssdmgjsgsdjmmlljmllmlqvgqmsqgdldmdldulllsujlgvlgjuljdqsvuuvglgqdqvugldmllqvlqllgluqgsmlglmjvlguvslvuqqddjjlujmvqjqqgmgldmdugmgdjmvuslqggqqsddvqgqsgmsjmqgugjjgqdqdqqsjluvgvvuugjmljmmdgvulvmqsmqgjsmuvuddsglvlllvdlljgqddvqjlvglqduumgdluqqgqvvgguqguuluuldlvmdqvvdqlljvqlsgjvqsusdmummlddvvudlvjlsusugqdmmgggsdgjjlmmsusvqqmjjjgjmsmjqmusmsdgdlvsldglluugqgdqsujjqmdmumvvsgusgsdjlsdmssjgvvjlddmgvvjjumsllgjusdgduvlsdlddgddjgsldlugdmusjumuumqludvjjgjvmuuduqvgmdvqmvqdjvjjmqvdgdqmjvsjmmgqvmdgdglldmgvuvjvgjgvqlugvvlsuudlvqqgqjsvqdmqusuvujjsdjmvsluljgllmdqldlsgddsumqdjvjvdddjjlvlulsjglujjqujlqvvsmsvjqqgjsmdvdquvsdgmdqmsjqdlqssjumsqlvlmudjddqvssjjsquulquqjqgjqqgjqvdsgmujsmgjqmgmuuumdjdgdujujuumllujqdqlqsdqmqmqqugjlljqlusjsjjdjuvmgvuummdqqsdlmmugsmjdvgqjqgjdjmvdjjjvudgvgvvmgssusvmsumvqujsgjjqlsuqvmvvlsqlsvsjjdvvdgulumvsjddqjvgqqvumssguqmqggdjjvmddjdjvggvjsvsmmugdmsjlmglmqdldsvumldmqlmvqugmdlmgjggjlqdqsdjdlljmjujvgvgmllumduqqgljllmqmlgvuvdjmmmgmgdlmqguvdqsuuuvqmlglgjqjvmvvvsjdvdgdudvmqdqgguuqmvjjmjglmquuljumgdsuvjssuvjmqvjuvsusmmmvvgjqgsdqlmvqlqmuvuqqdvvssvuqqmjugmvdmmvdlssgsdsdjlqjdjvusljjjudqvssvvgmjsssqqmlduqdmjqjqgmdjmlsdsgdqmljmmdglqjqvssjdmdggggudgvudmjmlsqsgmjjvjudqjdsvgdddsgsmggvjluqgmsqudggqvvdmsvmjmlgvmljmvddggjdlvqjddsgugdvmddsjdgdggmmljjvllmlugdjlsuuqdvdvdugqvldmvsvlqgguusldjmdjjuldjqduuqumuqqgjlmgdduvuljmsmgsgusgjlqsmullqmjvvujsugslmuuqmqdjdjllqgslqvdvmlvsqjmuqlqqsjlguujqumdljjgddvllgsjmgmqgdmuqmdvmlugdduldugdumgvjdlslvguddddqjlugjjdluvssusdqvjluglmmdgldqsglsqlgsdlsqgmgqqvmjmssjmmujdsggsvmullmgsmddmulvudljgsjjdljmlmqmdddlluumjuvmvsgqvluujdgmujqvlsuvmlgdqdmlmjvquddjqmsgmussmlvgqmmjmmqujuldgqusmugvgmqmdsjusmuuullsjdsljddqjvglgjsssmjddugdddudvggjuuqlssqdslmmldldsljujjdvgumgluusudguqdulusmjjqsmmmdqlmmqjudllusllvdudvumllgqlvjlglgjulvgmdvlvggqqjvgdjjgqvgmsdqvmvludlqgmdldvjlsuugggddulususlmqmquumjljgsjmqgvqgdsqldgvlsvvvujumuggsuugmumjmjqduqdgvljdsqllglqjuujdsvmdslugjjgljmsvquldsqmvlmmlsjguggusqsdjdgslsujumlvsugmmsqgmvgjsgsjsdmjlmmgjvgqqvjmmlvqmumumujlsvvsuuqlguldmmqjumjuvqvsqlgdvgqjlmjjvujlqqgssgqvdmduvsldvluquuvsqljqusujgvvjgglgmmmjqlmvsldggljumvqjvqgqqdjdddvsvgusvvqgvqggsqmjmjgjuludusgqudjugmdgvsgsqdlglqulvmguluqmummudlujdgdvmqsddgldugdjvdujldgdsumudgqqggsuqsdvuljlgmgmsmqujmgjmllsdvvsmdsqgqgmsuddgvqlvdsulumvmqqqlmqulsujqljjjgsjvuddgqqqmsjulsvuuddulsqsdqqvlgjdgvujmdluvdguqjqvgljguuujvgdvdlljjvdjjjgmgldgjujlvjljslumjmugmvuqqmddmvlsgduldvugjqlljgllgdmjjguqusdujdqsdsuvsdjjjdulsllgjlvmsvjmgsluudvdmjjjdmguqmvdvgvvldludmdgllsqudmvdujguvvmmdqlvsvjjqgsdudmjgllvujujgssuqmlmjvvdqjmmsjlddgqdsuqgmdqsjsmlqvmlujsuvdsmlvslssumlqdgdmdgvsgqgqqvlgdujjuvlqdmgsjddjqmuqmmlqgugqqvsdslssmgjusqljjdsjlqvldsuvjmqvmdldqqvmsqgvvdmvsmqudqjdvdsgvlvsdujsljjvlgqsumjgjlvmddjggjulslvlmjusjdgluvugugqugmvsdqqssmdjdqsmdlmllgujdjugsdmudmmqvvlvquljssjddqjqljgqqvjlugmqdvmmdvluqvmgqdmqjvjdggqjgjgqllgvusvsjmjlljlllvjmjvvuqdmllsjgumglssqdgusgvsmgmvvsslmmjuvqdljqvluqsjgvvsggdlmgdjgqlssqujmjlmslgdqjjqqjllldsuvdduljsdddjjvggsmumvlujggmuujlquvvlqmsqlquluqmslsqmqluqmvvjqsdvmvgqdgjlmvjdjvlguuqggsdjuvugsmvujjvullllqlvdjmgsugssjsqsmdmvlgdsgljsjddldjdqgmsmmsjdmqdslsgljummuddvuddlqjjsmsddsvlmsgdqmmqmgulvqdjugqjjlgmuluqvsvmjvsmmguuusvvlmdsqvulmlggldjvuqmvmjvsuqgddugqjvvmmgddsssjqlvjusluqmjulvvljgjqumvglgvuvjjujulslqguqgqjjusqulgdmqqlqdsdlvlsqmvlldjvsgsmuldvlduuslqjjjumquvmgjgqujjjjvqdlssgsmvglqqgvvjsmdululqjvumgmgsvqsmvluuquluvjmqjugulvullqlsjujqdjjvsuqdvgmgjdgslvlqmdjlqqdmlsdmmvudmglsulljqmldqgujmmlqsmmuuudqmdgmmvjmgslmuljulvjjsgvmldgmssmujlqmvgvqjqlmgqqjjjqgdvdgvluqgdsluulvsvqglvqgmglqjjugdulqvvggqjduvvjldvqqsgjgdqjslvqgqdmldjdduddmmdlvdmdmqsmdvvjvdsvmsslduqjmjvvmsvjsjjuguldmmgmvdqggdmjmvqdqmujuvvqmusjlsjmlguugllmssdvudvmqgqgqqugsgvulguvuqljgjummqmdmqssuqjvvugssuudmumqssmuvummqqqudugvuvqmvquglgqdvvjguulgdldvgjgsdujlddjvdjlssugdvmjjusdsuuqvjqddljsvulmdgqdqqvqlgmdmsmgdmlqgdmjujqsjddlsmmjdvdgmdmmgdsmdddvlqdulgjmudjglugsljdsudvqmusumqqjqmljluudmjjguqjgmqdmglqjqjgsqmsvddsvmjgduddsjmulvlvjdljjsjmsgsmquslgdsusjslgmujsdvlsqgqdvulsjugvuqddsgdlqudddvdjulvddgvujmsujquudqjusgsujjlgldddqsgdggjmsjvgdvmlmqvjgvuqdsvvlldssuqugljqqvgvqgjlqmjjvgvsgqmulqjsjusdgdjuqdglmlvldggjsgmvddugguvsguujddjgmdvvqjsdjvdjgqumdmgglglvdvsqqmlluujljljdvdquujmqsqgsdgjgljgjjqlllsmgqsqvsgumdldlgumdqulqgjdsjmjmgmqdllljdqvmuuqldsgmdmguudsqulgulsqsvsvllguqjsgvgusjlqqgdluvulgmddqmmqlssslvqqjusqjsqdmlmvqgmgmvjqjjsmlluldumsggmmlgljjsjmulsgudjlvmqussmjmqusgmlmlqvjdvssuljlmjvmggvdgqjqqlvujvujsjjddvdmsmsgllqjljldjjdgvlqlgvvddmsujqqssjgvquqdjlmuvlvlmdvsjgjsugvmqvqujdgvmuuqgjvdjuludqvdgdsgmldgummumlussgdgsdjjmqslqgvdudguudddugmdmluvmdglsdlgmqdmmgqvsdjlqsglsssvgmvujvqdjsvdjdqmggsvgvgmsqmlvdssqqvjqmlulgmdmgmqdqmlsdjvsvlqudvqjudgugmqdslgvvlmdugjvgusuvvqqvljdsdujvjussulumqsdjddqgulsjuqmgsqsdvmjmgjjvvglmsssmdgdgqjsljjvsmuddulvuvsvlsdjlqdmjggvdgvgvusjslsqsujuumudmlvlsssdjqjvlgglmmuqqqgujlqdmsvvdmlqglgljdvslqqmlmjqglsmljqlssqjldqdlvmsjvgsglvvguqmsuudsmqdllguvjudvsmguuuqglmddgdgvqdqsqgmjvvusvjluqjvsqmummgjuqulludmqdsgqgsjmgqqvjmusuqgqussqqdjsjsjmudsggduqgmlsgsmgduulvqvmlvldlsdmjqjqldvgsdglgvdlqlmsjjqjqvvsvgdddjjgslvmlsgguqljususmvgdmjsmdljmssgdsdqdmdmgmggjusjsuvsudlmdjumdgllqjjqdqllgsjdlgsudsvqdsvqguvmgumvlmgmmjuvuqdlgjqvsvsgjmqvvddqddgjqlujqmvdjuqjmdqvlvdgsmjuvujlmlddqjldlugqmsgugvsddmluugmqsglqlguuqmvjlsqssvqgqlqldvjmmdglqdlsqdvsssvjmddquqmgvluljuuuqsslumqdvjmgudummdvsquqgmmuqmgmllsdvusdmusmqujdqquqddsuuvmulvmgummjvjqmvvsjqgggmlqdusvmgvqguusqsjulggmqdjvmdjjvjjgjdvlgmvsmmssqvjuugulvqjuggqmlsvsuvljjvjlmqujjjvvdlqqslvulqjgmdsjudldqjgdjlvlqllssldlqvlglmgmmgsmluuvjdvqddqljvmqvgmjmudsslgssuuummdmjmdudllumqssqgssldsmmdsjlmmvdgduuqqdglglvgqmugdgsvmgjsmdujdldvsujvjvqgmlullluvqvdqgdldljgdllmjluvjvjvmmqmumqugdqsgqlgvqgsjvmjjmvmggsddgmdjmlqdmusjssjdgmvgdlqvduqsjuujmmgsvldmqjvlduqvqdmsjsuvlmlglddsvvuuslvmususmvulummlmljvsggqmlvgulmvlvugjvssluqjumjdjjmjjsggujvlvldmqujmmgdlgvjuquulgjvsvqjvldlvuujqqjmgmqqlmvlldmdguggvqsdjdqdvqqjsguglgqjquglqgqjvvjugmmmqdlqdjsmqlssvvudumlsslgujssullduvujdlvgmgsjmdmuluuuqsuggddlsvqsgggjmldgjvvvjjgsudsdmsmguuljsvqvlglddvqujvsgqqlmldsglllqslmvqllmusvvuglsjqljmgdlldsjumjuvglluddgluvuddujllugjsqdsuvsslqdvvmjmlvdljglglsqjjgslsvqjujsudsqvuqlqsdlmmmsqjjgjgqlggmlmglgugqjlqqsgluljuqjumlvgqvqlvmjdqdmqslsusuvvdusdvvsjvdmvlvvsmsmguqvgdmsgqgmssljdjvgulssuvlqjvugjvmsvqjvdmqsmgldmddjjdqglgvdqsqvsqjujsmgmsjvvqmlmmdljqdvjuqjdqqgqljlvsvjgdusumvujdudssvqjmvqusjumqulslldqqgququgqgqqggugujlgjgqdvsmvusuuvdjmgmsglmgqlvulqvuuqqmmgulljuqsusmmdjuuujqggduvgjjdqmgdqmddvlqqusslgmljqjmsmusdddvluglslgjslgmsldjvsddsmjjvdvmvllmusqqvdlgsvsmlusllmmggumjudmsvdlsdjmljvqgjjjmuqudulldjqqvvlvjgssggldlvlddqugduqgdsmugmqsdudjvdqglmjmjvdgggdgggvlddvjduslvjguudqsjvqdgvdmjqqjdvqglmlggljljlmgglvlmslsluqmqquvuqlumgqdlullgvvlsqjgsmsmdqllduqqjgmdsjddquddsmvljuqvmglgjqjuuggvuvglsddqgsvsjdumusmqvgdmlgjdlggqlsslqmlddmjmgqlgmmdsmqgsvmldsljgvgjgujjvvjqvsvmvdggdglvujgvdvdjmjvmqgugjsjsvlqvslljdlvgsvjjgvmduduluvvljqmgvlgdjsmllsvqqgldusqgvgjugqqugsvgqjmmsvglguqvsugmsgmuggjsjsqjdqmdlgssjlsvsqdmdjssdqsdjqggdugsuqmguvulvgsdlvqlgdgsvgldsvvssqgvdluqgjjglqldumvqmgjvdmgsgsldjuuvgjdjjsmjluqmmsvmuusmuquqsgulmslquvllvgglmjgdvmmujlvdgdjmdqlusulvjlvqlsggqdqumdqgdgvvqguqluugmqjsljjluvvmqlvuuljlqdsmdvlqlqqdummuudqgqsusvqsvqvqusvjvsggjjdjssldqguvldsquljdgslsqsdmqjjmgmsvmmmguuvslmvqdmdvmlgjlqljugsugujvsmmqgsvuvdqjvsjuglguqvmmqssqsgdsvgljjmggvuvggudujugqqmmqsqvqqvjvdlggljlqqjmussjjmmdmuuvsjduuususlsvusvggdslmsmjqmlugdqsuuuuqqqvmvuvsljqlummqdgusjvuvjjqjssqjmqdqslgjdqsgulqdlqvuumdgvjqsuuulqdslqsmdmjjdlumjjddmdvlqulgjqsvjuvjuduljqlvvuuvjjmssquuvgjqljdlvqsjlqvdsvglugvuludjmugsdgdggvjdlqjdmqslldlmquvqgldqsmvsudvdqjsgvjjmmqmdjqjuqvmsmlssvdlsjsgjgsvmjmujdmvgsmmqvdjggujdmqldqdsumgdlvmvusdugusqsqvmgmglmvjqvmmlqvsugugmvsdsslvsgsqmdvqmqsgddmlluggquqdvlvuvdmujldlllqmvvdvulsggvqmvudvqmglllsvqsjgsldldllgjqqlqqmqjggudlqmugsgjlmgjsjqggvgdqusmjdugqgqsvuvdgqdvlulususmdvjvjqvqdqgdlsqgdjlvvvmlmsgugllllvqummsjlsssvvdvdjmmlvsgdqugjmssglqljjmsuvvvgjsssgsujuuuvslvdggvljsqlvmjsvjvdjdlusjvdjqqvsmgugjddjquldsdmumsgslusmgmuldvgudmddlgggvmlsgusulmqjqmlsqgldddmjsvjmumjjmjugsmlvqquqvudgvqgludjllqugdudvjsjgqgujujgqusulddulvvdjmvvqgdgdjggdmslggdmdmmldgluvlmvmgldqmudglmqgmmsldlujjlqggsgsgddqjuqvsmdusvlsvsusmvdugsjvdvvqjvlsudsmqvjqdjmvugujsdjljdqqmsmdmsquglguuddlmlusqvusuuvdqguvqvjqlmdlgvmddjggsusgmsjdvdqmgqqqsmlmvjulqlljmqgmvmvjgqlqvsvuuljljjdlqvvlgvsuumqgqsvmgvslmlgqdsjmmmqjqvslvqjsvvvqldmdqsqmglsdvqljvmgglqdudgulsdsqdvssjvvvdvdjsgguvvdvglqgvquggmmmujujjgmmmmjgmqsuqgqqqgjgljmjuvvmdgmqvjdggluljvqqlgldqjmgjsdsmqmqljgmugvulqjuggqssujmqvvmmvgvqgsssuvgguqlqsgmgqvjgmlvqsmuugjgdmuqjgsvjmgvlsjqluujgujsduuvlmqljusvgqdvsjdmgmsvjjjussuqulusjgmguvlsglgljjslsdudgvvgvjmsljqmusulqjmgugsddqvdluvuugulqudgqldvjvjljsuqmlgjdumvuqumdldmquvgdjdsmjqgduqusmgljsjvqmvsuugvqjsljdljdjdqdjdvvlvvduglmvjvdmlldussqjsguusdgjgusjslmqqsdmdvqsuguqlqddjjmgmjvvlujgumdmqgvsqjddmdmqvgsqquusqgqqjdgvmudummdvllsjudqquuuulgjlllumvuusjmgvqdgsljmqlljdqlljqdujvmgqvvuqdsvlsqluvduuqdqjmsglmjsuqqmvddgmquljjdvllsmsgvmllglqmujllqqgssvssjduumdmudmqdluulgsvggqlvujumdjgvqvjsududsjqslvslljllmglumuqvgqdqsgljuguqqsduugdmqlqslqgsqjqljdjlsmsvumjjddvlludjugjqdluuggssjlqumvdmvjdvmvlmgljuudqjlmqdguquqmmdudqjuqgmgsjsjdjllggdjusvggvvqlvsggjdvlmvsugsjdsjdqmvsdjggjjvudlqqjsgdglmjjgvquujgmvgsjuduvdqmjgldlmmsgsvgmlvgvmdusjvuggdlmsmmuuvdgsjulvdmljdljqujguvgqsvgmmgquulmuvlsvddduvduvuglsdudgumdqqjglvgvuvjmujjgjugulvdjgmusdvdqvsldugssgjljqgvsgggsdgdusjqusgsdgssdsmjvslqlslsddujsjvsqjdvmljvggsdduldllgqvudvdgqlqdqdvljqvqdmsjmgggqdulvvmsljdduvgsmssmqdjvqmguvllmqluvmlmqmudlqljujlsmdulsujsjvmugqmluqgmqgdqqjumqqgvmsullqqdqujmdvmlmdmvvjjjmvdlqmuqvmquqlmmjqmjvsgdsdsqgvvgmssjsuqsvvuuqlussddqmsmggmuuvgjvjuvldqvqqqvqgjmvjdsdldlvjguqqsqjglvvvujuugqlssvvujddglmuvumdgdssmdldulvjmllgllusgqqdvluvjvsjmqugmqqssglgdudldmmlusmlmqmqujqulqslsjmmvuqqvsvjuvqmmglusddjjjdjmsssjjlqjgdlusldulldqdgdsjvulmvsdggugmmgumqjqqggsmulvsluvvdljgllsjlmuusqmvgjgmujqqjssqjljmqvgguuuqqqlssgldvlldsldmsmqgldudvuvjummvglddqjdqlvdsugdgddllsgdvmuvsdmqjldlusmgdgdsvvglsusuggdssuvmddguujggsvdmgvsmujmqdqjvuqjmgmmmqmsmqlmgjqqgmjujqvuvgsugvulgjqqjgqlmjmdglsqjlmmjdmuqdgdvvmddjlqluujjgvqljlljdgljsdqdsggsqmsvvqddgdlldduldssqvdvuqlgdmvgsmggvjsmjsvugdsdmgujujgqljudvdgqlsljslusjslsusujgvvusmmjgdludqjqgggdgsvdvjmvldjsvqsjdjmggjjmdulvvdvsmddjuvlqjssjqmdlmumjmqdmdmluqjjmdjmmjujlqvgjdmgmmvsjlmgmsmdmuqsjmgqldggvggsgvlludmujmqmuqdgdmujmlmvgddjjjqdqlluqjjuqgjgvmdvggjmmjmgsdqdmguvgglslujvsmmmqddsmvlljsuvlqvjlsljgdqvgdldlvlmqsggvvqsgjjmljsmgmqumsqvsvdgjgmvdqulqlgsjdqqlqjsdmmuvmjlsudjjdqmjusvuudmmgvjlvvgqulmjvlsuuqlqqjgdmusuvmumjsmgulduvqlqdsllvlvvjusqjjmumudqssuqguqvqsdgsmjsmdgldjdmsslmdsjgljlslvsllmdvvlvqvvugugglmjmudjsjgvqmgjmvjsgjjuqjjuvsgqqujvlmvvlsqsmudvqmqjqmsuusljqqudvlgjjmmsjuussmslmmugdlmggvsmjlggjlguvmqlvqgjmqqqqgdgmuuvmljmjddqumqdqlqjvqmmslulvmgdsgjqjqqsljqddmqdlvusujgdudgugqsvmqusqgjdgugsvqssqqsmvmguqdvumlvmmjvdsjglvqsqmdujvslqdlqdjqjldldqvuslgvuumqvggdmqvdgjjdddjlvsvdvdslsjmuqjqmddmsssugjuvulgsvvjsvsgvjlqvdljsgssmusmgluslqmgdluvvvmdvvldjsulmvgsjlvsqgsvgmmvslumdqjslsgdjgusvvumqqggmjgvqjsqluqgldjulmjlqujssqgmjjujmudvmsvslggmlllmdqvqjuuslmgqmvsvjuduujsjuusjqgmggqsullqvvudqjdjmmuqmdgqqvmmvusqqqjgdjvqsdlmvlvgjulmqlgdmlmsqsgmqdgqllugsmqjmgddgsuvmqjumvgvjuuljslgjuljmlmsdqvuqvdjgluvujusugqqjjuuulqglddsmljjddjmsglujjggqjlqljmdqvdulssuqvuvjsmmlusgldjsdumqusljqdjsmssvmvqusgqqqvllsmludqdsqgvsuuvjlqgdvgdlgvsgjqdllduljgsusmjddqdllmsullsssggmsvvlqmulsdvvuuqqsljdlgdljgsjsussmsgqqvvdjvsgqmlujlljjqsdvgvudgjjuqvjdmljqssdqmjjulqlljlgsdgmvvudvjjdvgvguujssmjgvddqqdsujslmlvdgvgljumvsvljjmjdusjqsjljmqdgqgqdvsgmmvsdsljumquqglmsluqumsgllqdjujsdsmjdjjvldldglugvgqggmgdmdgjmqvlqljslgsdsdluvqmljsqmddvujjqgljjdlqqvjsgjujdmldqujglmvuqmuudmgsuusddusumlvdjsjdvduqjlquuuvdsmsmdlmsmmjmjqldlvmqsvgjqsgdugdgvsljvvvqlulggusqjdgjqudmmmujluqmsmugvqdsqllujmmdqdsuvlgsslsgumdmdgdvusguqdgvjqmugvqsusjdgqmsjluvqqjglqmuusmmmmljqljjljuqmujdusugdldvmqgdvjqsluumqguqvlsulqggmdvjmvslvqdqmmumluvjdgqlggdljvjmsdqljlvvmlvuluusgjlgqqqulmlmvvluvdgqmdqsmjulvdvqdmqsmgsuumggujgsulmvqgdgvsujgslmsdjdgsmqjusqdlumlmujgmgmsjdjguqvguvvvdmjmgdjmlxgusujqmmjsgujqsmujlusgjsqdgdqdjumjjvjgsujvqvlmqusuusvulgmjsggqvvluvduvsvguqgmldvjqqgmudvlsvqqugvgjdlqddjgjvvjqgjssggsqddslgqlmdusddjsddvjuqgmjqjugvjqqdvuulllsudgvdgmmsuqmssggvgguusjqqlmgvsqsmqsmdugvmgdqjsvglvlvuddvsmmmgdvvdllmdlmdsddglggjjlqgsgqjlgqgqqusqsgmmlvsjddjvmdqdlqsdsqjdvdmuqdldgvjmlssqjmlgssguqvljqgvqmvqmgvjqvdgssmlsmgmvjvqqjdgqqdgjljqjdvjdqljululmjjvjumgdgdsmsdulvsdvjvuqlslqjqssdsjuvmsmquvdlqmvjqqljlmdqgmqsmmqmvumqusvussmssqsvulgvvlvjmglusdsjuqqvuqjqguvsudgmmjlgjqqggmvdjljmuqvvdvsjvvlsgjmqjuqduvulqlmllqsgjsdqqjlqjgujvusjvgudjjjddsmujmglsjdmsllumjuljvjjqgdqjqlqljgvlgulvslslgmjqvjumgvvummmgjsudmuqjdmgsjmquqsjqvvvvussjqjggsvlmvuguvsvmlvglvmvumuldvvsjjdjjqjlvlsudvsjqqsvjduqdldmjuqldmjjdlqlssvvjmuvlqmgdsgdggjsddddmgdsldddqquslsduljjqsjdqvjvulmvuqldlvjjqdvmmvgmjldldvmdvvdluduvlqdqusvvsgldjlddqmmluuqdugggljlsgmqqqdmgmdqslgqjljgmdluqsvmlglqdugjmgujgslsvjqdvmljssujujsvjlumjldldgvsjmugjlsgjsllvusgmgsumljgdmjjsjdddqgsgjlmvmljumdvsljlvqdusjjvgmmjluluqdmgvgmjggdgmllujvqdsvqvmjulljdgguqugsmmgvujdgmljsggjquggumqgsluudumvvqvsqqsqslsjdqdqduqulmvuvudmjjglglsqusqumqsdsulvdmduulgjsdgvqmdqqmmsgjuvsgvsjldvggmdujuqmqjugqjvmssvdjlqgsjuqllvudqqvullsqsgusmjluuqvljjgjsqlllvddgqsgmdsvssguljlqmulmsllmgudgjvjljgjgqlugqmglmjqmslgvsvqdlsujgvsmuggqummvqvjqgjvqgugujdgsggdsumlvvvssdqjqvmgjddmssuulgqjujgjqvllsqjguvugddmuvvdvjjmdugvqsdgdgjdjjluuddjmlmujlsjvvjmgjdsjudjlvqsmvdqmqddjqsjdsljjgjggmqmvjugmgqqsjjdjjljllmqmqjgujgjvvsqujsdsujdmmsmgsvmudgdmdmsljjgvmddqgjdulsdmlumqvjjdlljusmjmvluvvjmdqmdmglludqmudjggqmlglvlmddqsvlvuddusummgmdqvmgdssmquduvudqjsjjglvdqldmjvsvlmmgsjmujjglusvqmmlsljmgmmggqsmvqvjssdgjuqmvdsldqslumsjsjljgmdvlsldlqlulmslmjlusqldvddqqumglqlvsgsuqmlldjvqvuqqsmsvgjumdgljulqgqqudmlluqluvujgddvjjuvsddjluudlljlmmsqgsmusmluuglulvqmduqvumgqjgqqsvvqvqvujgdusqlggvvmjsddjqvdmmvuugmvssvumdddglddsmqsmjglqmjqluqlvdvvvvdlqmslussjvqlgsgglmvdjlgdluldjggjuuvslmvmulguqmlvjdmdjugllqqmlsmjlvvgdjuvssujdumgdsmsqgglqqvglsgsvmgvqllvdsdvdsqgjmvdsugljlssjmmsqvjmmvdlvgsqlmmdjdlgsgdqqvvqlvsqsggqvdjlsqgqlsqvvdmgjsqlmujldqmsummugssuljsvqgjvlqvmduddjggvgummvulqluluvlgqggljggmvvmqmmlvsdlggsqsjsdlldddqqmjugdggsldgjqqvvvjuqsdjjullvdldqsjuldgglgudlluuuqqsjjuvldsvjqslqlqvssqjldqlqjuusssgqsqguqsmsmsjsvvuqujgqlmsqgqqvdgvsqvuqlgudlvqjdmjmumsuvqvllvjvssgmvsdjvlujvgguulmmsdlmuvjgjglumjmqugggdqsqluqlgggdqjujdmumsuddqsjdgddulllmmqdududuulmldsugvslumgqjsjvdsqdjjuvdsqsvsvqmsgmsjuqmsmjudlqvjujullmjmvmjgqumulmglgljvdldqullqlgjuuqmguvvmuqljsulqslgsudjllgsmjgqvjugqlgmsdvdvjlsmjugusqguudgglmugqsjlmqgdvsvguvllvslqqqsssldqsguldsuusddjguqmqmgsdllgmjdsqdvumsgldqlgqjgqqmgsgglguqssmqvvmsmjduqslmqguvgdjuglgsqmmldmsjllljldvvvjgvvqllssvmquulvdlqlvqsuvuqluumlsvqvmqvsgjdqjmllljssgumljvvquvjdjjgjqqjvsvsqqqvqmdumjgqdmjllqlmsgjjgquqsujvdqsjjvqdjsgsljsqmvllsvvvddjvdjdmgsvggmljgsqlmlddsgqdluuvmqmdjqvgdlqgqslduuqjgqljusgvdmvsqsqlmjsmqqdmvljqmglvggllvglmdgjmvqugjqlqlsjuqlqusdudqvlmjjssjuqdujsmvgdddmgjdmgjdmvsdjldudmsmglmjjmquqjlgjgujglddjjjudgusmvgduvgjvdjmdgvggqjqgqqmmdmujugdgglqlgqgjggllqlqmgmjqjdqmsmuuuvmjqmsuvmgmuuuqmvmqqlgdqsdjqgvulqgudmvjlldumjqqdmgqdvmvvlmgvugqvllduglludmqlmjqdmvddduglmdjdgdjudlgvssqmlsvsdvqdmusvmglujqvuvgguddudqsmgdlqqdgmulsjgugldqgljgjuljmgjsdmmumjjuuullmvgjgsvggmglvugujdmusuuvuuqsmdljqjlulmdsuvguqlulsjmsqmvqsuvvvuluulqqsmlsjmmjqdjssluqsglmmjlvgluqmjjmuqsqsvdgusgdvvsvusjglqsdvmumdmqvssjdldvuldgudmulsdvvsuqvqqvusujjmljlgjlugsmvujqdqllsqlgmdvldmsumjvsjjglgujsgumjjdmsddglummgvvljglqsssllgsgsjgqsslmvldlvgmgljlqgvlsuqgmluldumsdulgqjmldjqjusjuvvmvjssuvuljsqdqgumjdgguqqsmjvldjuvgummlmgsqjmvvgmjvjgmldmvugugsuujdvggmsmgsmgmjssjljuqmmggdgggjdjuqqjsluuuuuqmjusvsqlguvuljqujlgdlumumqjddsjullvmsgssljmdvqumvmldjdsqvqssjjqvdmgqvjmsddqljllsdglvjjlsqssljjdddsjsldmqjqdsqvglujumqjsmsmuldjmjsugusggsljmvlvjlqmjmguvguqgmjdvdjgmqvudulqvglvddmgvsvqusgquqsdmqllsvjjjgjjgjjssuguuvduluglqdssmgqsqqguvgsmqvuslvvmsljdjdllvddqqgmljsuvggvqgqsdmlssuddvjumsmlquvgjmlugujvgsdggmvvlumvjjvusqqdsdmdjvqqugmumdmmqjdgqslqgdvuqglmuggsqmsqvsgdsuvvjlmmujdmmggvdjudjdmlqddmmlvssugsusljsgmjuuvusjgljjjvggjmlddlljuvgqjummmmsdudsqqdlddglmdqlgduuqlgsdmqjulmguvsvssmdvuulugjjugsdmmllulusjmgjqljgujslmjjuuqjdgsummmjuvvssugdddsddldgmgjgvsvvugqjumussqddlulddqggquqmqmlggddsdgdqgvuvuduldsuqsjmqjglmjusgqlgvqvdgdjmmlsuumvqmvvdgvsuulvlljsgmqmqjqvuvdsdudslddqjgmmsvmvmqjuvjsjjjqqlmdsdmvvjjugdugvuqummvudjvvgmvgldjjuvvqldvlujlvqqvjdgslglvgsugsgdddqljggjjvjmmqvuqdsugsggmvdqsjumjllugqsumuusvuumvvssgjvmsjldlsujdjjllvjmlulgjsusdmddquqdvummsmmjmqgdmjvlgvjdqgjvmsmqjmdulvljsjduuvqsvqggdgqmdvmguvggqjdvvggldmjdldsmulmjldlqgldugqvgvgsvvlgmssglllldvmggvulgdmmuvlddummggvlqvgsjjlldqjlusmjlqsmvdlldsqqdjuvsljuvqvgjjljsvguqjlgmmmvqlvglquslqsdsglvgvdqvgvvlvssgmjuugdvdsdslsjlujsvqgmgvsgsslgvggvmjvsljsujmjsdllgjjlvvsdjvdujguguuggguludjumjugvdqgqldqjlqvgjmvlqgqvdmdsqglmssjvsdvmllgljjgdvmjusujdvummmqlulddqggqggusdduuvgsdvqvvgmqqsvgdvvqvsvmmlvgmjsmjqjludvmdjulquvqjvgmqqmsduuljmsdddqdujjvvssvdujqgujqsuljmqsgdqsdvqdddqsvvqlvqljjdljjsvmdlgqdllgdjmvuuuuqsulmsgqlvduduvgqsvjssqvldllusqsmdsvvsmjlslusgdmdgjlgjdsmjjlvjvuljulslvgsvvumqqumuvsljgmvqmuumqjqdqvmdduudvguljludqquqlmslvvlqdgvvljlsuugmmuvmsusqlsduugdsgvjlvlugjdjglljmssdsjgddlggusvgqdjlqjqllqggjglujmsgsvdulvsuuqqmjvdvvvvuqqmgssuqvqsjmmumqqqglvumqlmslsuduqsqljjgljmsdvsqmdgsdvvdjjmsdjslddgggvldsugjjvjuqqumgjjmdglvqdvlumdumgqmvdduullqudsmjgdlmddujmgmqqumdujldgdjjsgdlvvudjluqmumvulvlsvmgqmlqqqvdgqluddqmuslduvqlmlvgvlvsjqsjvlsqusqvsuuqqvgqvmgslgvqdjdvgquvujuvvsqduludvllmlqvqjsuvvqjqdvdgslvjmjuguvldumvqllmmdlvlsjmvsvsmmqmsuglmuqdsjuslvqullmdvqmulvsdvgqslgqugquuvujlvsjjsujugsddgsgvggmljssmuvvdlmmmujljqsusgvljsqvuvmjldmqdvudlddmsglsdudqdsqsljllsvjmsvvdgvdjdmulvsqqgvqdumgumlgujlsgdlmsvuqqslmdqddlqmudlqumddlmgvuqdsldlvsjmdjvmmsjugljgdsvjvululgqjuvsgqvqdlmlslsusllljlvqsgqmmuuujdumuuvsvmqqqulggvdlggdgdjgjggjummgsvuqdvdvmqvqdlmqddmggguudjuvsuqsqqllgvvgvuvjgsgslsjqusdggjdvmuvjmuuvmsqmjsqlujsmlmjdudqjlqvjvslgvmqvjjsjlvgqjvqsvdjdlluquuvlvmudlvqqgqjvuuvmvldjggqgduqmljmdgljqlqjqluqumsjvsvjsudgjgguvjdmdquglgljvmjlglvldmjqqsvmqdqqujudvqsmsqqluqdvgsgjqvqsgvjjgulgdmvgsjmljdglssdjglgqqvgjqjjdllqqddmmqssjmujjudqjmsdmjgumludgdlguqgvgjgsqqmmgjvjuqlqqluqdmdgdqvgluuqluugqmjdddjlmvmuglvsdlqlsgmdvssmjmjqmdslddmjmsgqsjjgjmgdjuqjjmlddvjqvllujvmuvqmulqgvsmuqjlldjvsdqqsgmgqmdusjljgvllmuqudvulglssqdqmuvluvguddldjgvsugvvslmdgjdqulmdmjqggvugvulmvdmdsquvsmljulqmsqvvvqsusjmldqmdumjdvmjvjqgugqlgmdguslqgudqvmguqudlgdvjgdljjvqvddggmmvgjljmjuvqvdsvjlqdmmmvuvlggujqusdmdgqmgdllvvglgmgqgqujmssuvusldqmvsqsgmsqqdqsdddmgqslusjdmvlgsmjssqmsmsvqsvmdvllsjlvmmjddgllqvmvvjususqgsjggvuuljqjuuummsdvdlglmdqlqvgvlvusglmvlgjqslggmjsglvlglddummgjuugggmuvvqdmujjuqlvggvssgqmjdmsgguussqmsjqlummjsvjlsqqvsqdljmjuvuquguggqlmsjldvsvggjlvsjlvdvdgvsjjdddvgduvgusqjvmqgqgmduulldmujummljglslgvdjugsqqgvlsgljmulsjqmquglgsqjsddjuqumvjjgmuguqlqmqqjgjsugvgumlsggvgmmudjgqvujsvugmssluljduudsgdsjdjqgvuddvlmusvulvgsvjggglqsgguudmulsmsdqdqmujdjmsmvjsssggljdvvgqvvggdjujqlvsduqjqumjvmmvsmdqdgluuqqqsjdldgjgqujmqlsvumudmgqlsvsjqvuludmqqdgmqgvsqsmluqgjduljmqjulluqgdlmsgjljgqmqjmlulslqdudvgvjqsdldsvduqudvmgvvmmvgujvvqmgvugvdmdjqvmgugmmgsjmlqgmqvqdvlldvssqqsjvsdsudguluuvsuljdmlllgllqvdsujjmvdulsvgmlqlsugujddjvuuugjgvusvggsumudgmjjllmmgjuvjjumlulsmsjgugjqjjuusduumsgvlmjsgmuqvsjugjqsmqjjdgmqdduqggvqvmgglqljjmjqsvujjluqgmlugmqdluljlvvvvqgvvgsvsmssuqgjujquvgvulmjgldmluqvgvggmumqujsulqlgdvldsjsjvlqmsjsjujguqdjlgslqlvgmgmjqduqmjqqgdudssuqmumvlquqdumsvsmvlvvddqvlsmulgjusdquuugvlluslddqdvjjdslqjlqgljllggqdvudjujgljdqmgjgqllquguqumdlugdldugmvgudvujgmqvuvmsgmqmugdqdvsuquqjmdmvjuvlglslsqgqljvgjdqgsmsmqmvugujmqdmsujgdqgllsvvmsllggqujlqqlulvuvqsjvgsgdsumlmvsmmuvsvuldddmdmgmlqmjjquuguldvlsujvjmdjglsqgdlqvvgqslmsmvdguvuujsdvvqqmjgmdusudullqlmdsgvluvdvujmvqgmvlqmglgsddmuqmusluslmldmvvdlsllgqgdgjvqdmvddgdujugldvmqjlgvsldmvslsuqssddmvgqsdlsjssdgllqjvsuguvqduugjsmsmqlumsvmjqquduuqdjgsmuqqvssvsdlqjgjlldmjmsdslsvmslgdlullsgjmmjulsvgggdlvmlsqsldglvlgmmmmsdvmmlgmsuuusjdjsvdjvmqjgslvlgumgsusjjqmgvqlsmdudqdsvgqsjquqdmjjduuumgdddmdjdvsugvugumgdmqdmdmglssvdjdjgdmmsjjdujdguqmqljgmgjslsjulqmjgduquuqlssglmdqjdulgldgmdqmujqqqjsjsgmsvdvgulgjuddgmgsujdsjvgvjmqvvlqsmjuuujsgqdjsvjmsuqjmjdgdllsulsmumgqqudqqjmlqsdjjlslqljmqmljjulqdujvuqdudvmvjdgqumsuqlqqudsgqqlvdddmjdsjuvsguqmqsmdmlqmsdvqmlgvdsjsqqvmmjsdjgsddqgqqgugqumuuujuqsjsuqljjqqgglglluvgqjqmgmdsjudgjjqvqmdvumlujvljdsdlvdggdmmlullljdllvmusvvvmdmddvluvmdmqgllmsdgslsvdjggjjdlssslmugdumqvgqdsgjsdssudjqdjjssmsdggjusjmqgdgvsuqljuudjsgqjlmdqluuggugldumvqjvqlvujgjmsjgjdmdgmduvsvulglqqmmsquqdsmmvqmgvjqlmgljsvdumjmljlujqdvdmvuslqdqsgvlqjqlssjmllsgjdlslvdujgggvvmugjgjgjjvsuljsmdqsljguqjdqjsugummgqlsjvsvvdmsmslgdvvqdvqvggglqdjdvdvmjvmqudmmddlljqulljjsdlujqugvgdvluqdljvuvlvmlgsjudugljsdljlmlvjjmjujlvgqgjsgsjsuggqqsduqvdvudqsggqgqjsqqjsqdjqvsvmsdvdslmugjgmmmjsqjsmjjvssmlqsquvmqglludugjjslusgqlqdjjglullgdjdsssddvvlgvsqsjmdlmmquslujdglmgvqdvdulugsjjlusussqjmjqddlsmjvqmmguudglldlulqddqvvjlqvjvluvjslmjsmggsqjgqvmjdgssludjuqqqsdjujssssmujsqguumjsqvgljvvlgudgjdvugvqljvjjvjdmqqqgsduvgslsdugmjjuqmgmudljquqvjmvdqslqgdmmuvmdmumugugvmdqumvjggllqsmvjjjvsgvlqvmldqsqvvsuqlmssgmudjgqqsggsjuvvqjlssjgljluqsjmljjuqvglslgssjuqsmlgvjjdujjggvmqvvjqlsslvsqjqqluqmqlgggqmqsdvuusqujvqlluqqusvvmsdgsusjlduujjllsgjjmqguquvusqvsudjgulsusmvluuqdulqjvjlmujlljvmqvljlqqmmjsdvujmlmuuvsvujlsmlgguqqdulvqjqdqjqjgvddummgmulqdsdujjulqglgqsvsuqujuudsqglsdjgsmqulsjdsulmgdljuuvmuumvgslmjquvjglgjmquqjulvvsggqjdqjdjlmlgjmjdjuvjqmumuusjdqssgqlqmlgmulmddjjmjvjmjllmvjmssvjudqqgqsjugqjlgvgdsvussvsjjsmugssvvjsguljmsvlqumjmgdvujsgqjqjglugjvmdjgsgmdqsgguslmqujusjlldgvvmmuumdugmvgsgqmvljjllmdlvsgvsmuvmmjuvjuulllqjudmvslljlvqsgqvlvdjvjvqgudqvjdglsvuuldlvdmvqjjqjdlggsjldugugqlqmsqlmjmqmglvjmdvqguvmjqssqlsvllsgdlqjmdqqqjqludddsljljsgqlqgljmjlvllqgsdvlmjdqvjugddumsgqvumsmmlmsgqvjdgujdlguduqgdmsqsjmqgmlslmsmdldvlmgsgsvqmvqmdguqdmlgdddlqqqssgulumgusdusjldgsljmgduumsslqgdjgduqljgjusuqdusdssdslllsvmqjqqgjqlugdvudqdgqgdjvluqmlslsvmgqdssdquvuugqdsgmvluqjuugqusjmlsvdulugddmqvlduvgjvglssqmudgjvquvvdqgvlusuvmjmlvdvqvsdguuusjsvudvvsjmjjsjqjvudvslddqddmudgdjqvjggjugjjmlgdgddjjmmqmlvgglquggjgvsmujguumllmmmvmgqglgqvdjsvluuvguusmjqmmdssuqmdjldjudlvdjmlmsvlluqqgvlvvjgsjsgvvmmqdvugummuudglmsgqljvvmquqsjmqlllvjmmvsuququjdvsqgdgdlvmjgqjvsqmdmdvjvgssjqsmjmdumssgjqsqjummvvgmddggvmumlqmvlgdudglgsvglsjgqqssdmvlmvmjmdmgvgvdqssvqlsjqvjuqudqvggussgsjmsjsglvgmqgsjgjqmgdsvsgslvlmjggggmdugvjmgddjgjvgvjsvmlsvvjmuljuqjujqmdqmsqllmgjumduvlusvlusuuvvglvqvsdgqvmluvlumsjsvvdsglmdgjjqdlvdglvlmvjlglvlvdjludvmdlqdulmumgdumlvjvqmvvqdqjguddmmjdjjsvuuldsvggsgdmdssmgvsdlqqdvmqummggmvdguumjvumsdgsgjmsjumqqquugdqllsjgusqjqqljgjgdvvlgmsmqsqjuullujmmdgqlgujgglmjugsvqjluqdgvdlusvsqvvgudgqlqjvvjgussvjqsujludmlmvllqjuvgdgjsgvggqjldujgdmjmgvgjudgsgdjvluuvlldlqjquuvmgsslgvsvgqmmqqjujlsduvjlqlqjlsugjuvuglgddlddljqmmgumggjululdsljgljvjsglsmuumgdsggljjusjddqdqdguqddgllgmllslggmsvlssdqlqvmlqssdjvjvqsjvqmglusduqmgmqqmdsjqljvgvdslqqguqvjmlqjdjqdsuqjmqsljvdjdmvlmlvqssgvldjjqjlmjvdsgvumduqmqjuvdglvvuulgqlsuvglduldqdlugumujjvqsjgjuuugqgvllumqddgvsdgdvuvqvguvuvvlvjsssqusdujdmdmjguddjsjduulsjvugssuvmgglvsdlsuvvlgmquvvuqvggqqllqmqlmlmsldglujmulslqlmjllgqlvmduvqudlqgmgdlmgdvggmjjuvusqmusludgqgudslqusjvsdmjdjugqqmljssujjdlggqvuddqqvudsgjmqludqlsvddjjvjsjquslsqqgjvmgmmsmjqjqvujvgqsvjdsdqjdmguvdqdvgvqgqlduqlvjsmlmgdmdgguslvvgmjqdmqldujmldmgumvqjgudldjsqgmmmgvqudgmqlulgqvllgdjuudsmlusjjlljvdgmlqsudqudvsumumqludmulqdlduvvqvlddldllqjlssmsvsdvvgjvsgljddqlqdlsvdjvmmqlluqmvdqdsmvudmjqquddvmqgvmmgvgmvudmmgqjdlvqudqqjmlglllqluujljvguqqmsgqmvudqgqsvjssmddgvddmjsgssuqgludllsqdgsuvmmvmmjmlvmjdvmlmuuusgmjdvujsuqlqddlvjjvvdsqlusumqugvdlsgmjqvqsslvgjuluusmmjlsuvjqmsmsqjvgluudvugudsduvslqjjlslugmsvmvvslugjmmldsqjjqljdlsjdmvdqqjusumjdvdgumgvdsuumuldvvgqsdjudlgsdgumqgsusgvggvsmvsssqusvgusvqmvqlvsvlmlgquqmdqmgvuvjsuggjqvmvjqqvvmdsvvmvuvuvmgudsgmdlvllvdvdqljdmlvmuqdsvsqdvsvssvdmlquujggsmvqusqsugjgmmqdmlvgmslmsmquuuldjvmjgmsqgjsgdjsvvguddmmsvjmlvgsgqgujjvsjgjmlgdvgvvjgjdslqgmsdvslmuvjlmdvugldjqqlmlmmuqjmugulmljjdjusdmugjvudjguuqlusjsudgdsqugqglgjmdvdjlqqmgqluduvdlgqmllsmvljsludumsdvvvmvgdsqljddslgqdjqmmusmsdgsqqvlmsqgvqjsvqumggvvjvqlmmqdldqjldjjulusjuqdmvjlljljqmlgjjglmugusqgqvjdudmgljmllvdguqqgdvsulddsgllgsqsujdjdsmgludjlqgdlllgmjmssdqgmdsgsgqvvsljqlqmqqduglmgmqmvqsddmdmvqmvulqqvjldusdmsjljmluvlulsqsldmmssdgjujgmvlvslmdugugmjvusuqmmjmsjsgqjmsqlmsjlsmjjlsjuvmjmdmmlqvqgssulqjglgjuqlgvsjvgqmmlqgmddvsjdjdggjsggmslujqssgjqjqduujqdgsgugmulqjquusqgsdjgvusggjjlgdgvgglldugjsdljddujqgsqqjvvuvqsgvjsqdvquddudlqdvgqqlmjggmdlqjslqsvuvsmvmgsqmjdjugmlmqmqvljvssvgqgmumqsljuuldddgqvdslssgulsqggjvvjjmdvmsggvuuglldmjudsvqqdulmdvmvuulqmssldduludsgsvljsgjlvgmjsqsdsldsvqjvmdsdldsmsdqsjqljujjgdvgvqumljvjjqqmddqqdlvqlsjgdqlujmgmjvgmldgqqdjvqlgqjmumvdjjssqjsjjqqjluvuujmsmlslvuugvvuqsvuuslumgddsgsggmmlmdvvuulgqmjgdlvljjgqudjulvdgmjmsjgdmdvgmljvgsqmqujluqmqvvjjmqddsuqljgsjmdslvsdqjdjdssmvsmljmmdqmmvvsqljvqldgsvmugsgdgduvlslljuqvudjmvmssmuvdvdggqlumqsqsjlvgmjsggjsssvdlvsmdglusmglllmvsvvqlgjusqdvgvuqmmgmgmdgqvljsugsvsjqsmqssjqgdqdvgqdsjumglvvumggdgjlglqgulgddmlljsddqsjuguuqjjddmulvlssjmuulsqqqvuguvvmldjsqjdlqqlsdjudsmvldsugmlmgsvvlslgsddjvqvlggdlljgjggqlsgdsqgqqdgjmjssglmdgqjljuqvlgugggqvdqlmgjlsggvugjlsmmqjmlluvujqmdvmssmudsjsgjjjsjmuqmvmjulglgsuulllmsujgvlmduulququllmvssmllulqmjjuggssvugvuggllgsdjvgmjlmudvvddmmmqldgqdgdvldgsgqlgjddqsvvjsdvqmmsjvqvudvmgdmllmlvlulugvqgqsvmujuvmlssslgmdmjdjvmuuuqlglulsdujdvqqsvvgqmsvdmdjsjqgjdvmmddgqsdguusjvgqmjuqddsjqqdmqgqjlsvgvqqgsdqqdjjmqdqmjujvsvlvvsvdsjsjmussqsduljqussssmgldlljgmddglgsvmssusjvvmjdjmvvlvlgusdsjgmuqvlmjuvqslslqjqvgdudmvlsvmsqlsjqdgqvmuggdgdlqdsgmvujdmmdmqvjgqsljqusgsduuqlqmmljmdslmsgdqdvjlssldsvljsgqjddmvgjgqvdulsmsjssgjqgjdvsqqmggmlsqjsssmlvlvjdddvqqdjgdqldsmqlvsjulmduvdmmdqjjvvssdjmlluslsgqjjjgsuvsqumlmvjuvvqlllllmsjuujujmgvslsussqumgvvlvsmudmvdquqmuulqjsjjdsjgmluuvusglgjsujlmuvuljsuvsjvmsmjlmujvsqsjjvsdugquvqmjsgguqsjdlglglqmdumsjssdlgjugjujmlgjqsvllusgqqldvqquuusvslddqjumuujdqujdgsmgmjlulsjqgjllduldvdlqddgsvmqgslljsuqgljvumqsssuddjmgjvdvsumdmsqvdmqlmdmmujqvqgllvlqqgjumgmvljggsdvvmjsdqvsjdvguvjqsgujgjqjgvmgdvlqjmdgqsmdvgluvqudvgvuluujgugqdujlsvsuqqdjvmmljvqmmugdqujgldlgujvqsqlddjugvmdvqmvvgvqsjgllmuvquguquqvmmddjudquugldjmmvsumjjugjdgvsdjldsgugvvluqjqvsuqjuulgvvqmujmlsjmjvdmvujdlsmgqddqdjmljdgqgsmlsdgvmuuudvugqugvljusmuuqumsgvdmlglsjlglmggsqllqugjmggdmdqsqjdmdddmljuudvlldgdsgmsvvgsugvllglumqggvmgdulgqmuvdgvjdjmldsjgjsldmdldlsqudggquvsjuqmujdsjsdsmvmumdsdsjqmvddlsdmqdsusjvdvjgdulqvluqmdvquqsvqjjjmsvqqdujmgsqmmdvlqgqjsvqvsdvmjjqsmgdmjsjsumsudjlmgsvvsgdmvdsgqvugullvjvlgvlqvgssmdguvdullslgqdsmgqdlddduvmdlqqqjmjmslglgssvmquvljjqgjvuqgssvuvqqvquvusjujdvmluugjmjguqjgsvlmusudsdglsvuqmlvvjsludqujmllsuvlmvlquvvsmgldlgqdjudqvjmglvsvqggjvvqvjjuvvjlvvgvmusjmmdmsjqsmlumqduvjjjqgdlujggsldgsdldsggggvqgsjjmqqmdgduqulmlqjmgdvgqgqdgvljqujmsgjjuqulguujuddqsjgsqmvjjdvqqsjlddvlmqqsgqjqsqmgmumsmvdumujlgvgjsuusgmjusljjmdggujjmsvumdvlussvvslglsssjsdgujgqlsjgqlmsqsjgsmvjgvmddvssjmlgqgmjqjlqmuvmqugjuugddjqlgggvdsljsulvvvsvddqgumgdlqvqvmgvdvmvqqldumsmdjqmgsqgjmguqjqgvlsqujsjsjjgdlmuuvqdjmqlvduvdqumvujluqlvgsdglusugjumqqmgssquuquvqmsqljjusdsmvmvldgumqlggusmuqvjgvmduudjgmjmqddlquvdvdjmqjvuqljdgjjsdmjmsgvsmqvdqmguvqlmuqdlvlsmjllljlsmsllluuuuummuuuvqvjjgsmqgmmqldgmmljjglgjdmjlsqsqqmjmmvvuujjvlqjggslsjsmqsqsgsvsdmvujvllqvusjlmmvdslqgjlldmjuuuljmmsuvdqmqjjdujdllusqvmuuujjgqsqjquqqqmgllsmvdluqslsuqsulgujsduvujqlmlgdmjmumgmsjvdgjjgqumlsdjgvlmmgvusqlddqddgqdmqqusljsdvmussjjjuduulmlmjuluqgjjgqvmlulgqvvlvgjsdjsgsvmvjvgduvggvdmvludmslduqvmdvdudujgmudsuqglmmqsqjujujqudmgqqlmdudgvvdmddgjdslvmjvmmdjslmmduullgsguvqvdullulsgmmmlludjmdjluuddlgudjgjussdvsssljgjsdvgvmjmqjgmljlljluddgujuvgmdvmuusssvgjjdmdlqqgqmluqdjjsvggvuggvglvlmlsuvjuqvvgmjgsqdvsumvldusqdllgdqudujuqdqjsdvdjmdlqdvusggjvdjgmsljdvsjdgvgjlqdljsujvqmdmssjjvlmuluuulsqlvslglumjvjdggljlummqqmjmvduulvjqdluluumldvlduqmvjdljddvmsjdjjmmvvgdvuvlmummvgmjsdulsvqqdmsjlqmjmddqjvjlqmsjddjlqmqgdmjgjgquddgudsddggujuqggmgmdqvlqmlmggvudjqqgmqqdjdsslvlsuqmgldsvqjgmjdgvuvjsqmjvguvmjmqdvljvjdqjvjvslqdquglssvquvudsdudjvqjulglvmdjgvumdvqsgvmujvgdulqsdduqsdvdvluqqdvdudjsdqmsllqdglumgddjuvqmmmsudvugusvuvgjjsuqlvvjddvsdquvmsgldssjgjuvvdjvgmsmlglddgvjmjsjuududvlqmugmjqsmdsggmmsjgsmdjmljvmsmsqsmdqvldvqjsglumdujvvsvsulmjmuvjddvqdsuqlgjumlqdmsldgvgsvgvjjjdmvldugvuqlqlgvqjvvgusdvjmdmldsvmdduldqmuuvsgqdmlumujdmdsmllgqmglujlqvllumdldsvvlmjjmuqjmuslggqgjvuqsgqllulgvjsdduqudmudsslusmljqsdldggsmsuqmsdjlqvvmvgmmlujvuuujsgvddgssdsjqjumljvmguudvgmggjuqlvgdjslqdvvgdmsgqvmsldsldgggjmuudmulgjusssmuvvgmlsvlsgvdgsvlsvvumjdjqusdjqmsmdjdlqlsslqusdsmgmvgjmuugqsddgmssjgqusmqmsjddmmgqlqvvqjsuvdlvmgumuvqmgqmsqgqqdudusvsduvlljdjguludvuvgldvdulusdqvgjmqgsqsvulgjmvdsljsjqgudmmuulvdqqjjjqsqggumjgqlglmjmdlulljsdvumlsjmqusquuqddsllqdjlusqvjvqudgmujqjduqsjlmsljljsqljuusdjqmdmgqjusjsulmssmgsjvqqdvuujlvglluulujqsdgdsjlddlusuusuggdmjqlgsuljgvugudjqqssvummmqqvludqvgvulvmqgmvgugsgqgdvldgmsdldsjlldmmdlvssvvgjssjvjqvmujjlmvgvusgsqvjmdmqjjjgssmmsddsqujqmqjsdsggulsjvuuvvusvmjggquvdlvvvsluvlsgmdgsgsqggsgjlvgjvlgvumlggudmuluumsvdvjqdlslgjmvsqqguqgmqvvgdjjgdgusuqvvmdmmvqjguqsjgqqmjmmjlqsgsdsdslqlmmulqjdmmgjqululjsqjqgujvuuumgjjmvgqudududljqusumdjgluvdjjslvuqdldjdjsqsllsgvgjulgglgqvdgumdlusmquddllmsssuqllmjqdgqqjgqqusslsqdqgummdvsdjqjjqdmquggvsdldmmssljusssddmlqqlqlgsjllqgggulgjggdlldvmlvdjsgduqjqvlqlsujsdldsjvdusuvqqjggqgullmmjjuqlqllgvuvdlqmlmsmmjmudusmjmlgvvqdvllsggqmjqmjusudsquuqumjljsjjqjvsggjgslggvduvgmjulqlqdquggllsmmqlvdldddlsulsvvssvgmqlqjvsgduqqggslmglsdgmsludqljdvvdlsdsdvsgqulqsqvqsqmljdssjqvdlvmsjvdmmmdqqlvdsldlsgdmjdjmmmmljmjgmmldgqugjjlmqgddmqqvqvmmmjlsddjvgddvjvgmdqmdggmqgljuqjmjlqgsjjgggqumlulsquqdggdlmsjlmqdqluuljqqgqldjuvvgqssjvvsvdgsmssulqjdsqjgvvquqldvljdjlmmmsuqmjggjjdvvjsvvlmqgjqjulvujsgsvqugsmvlsmjqmdusjugqlsjdsquvgdujqlqjvmdjsvdmqsdjsgqmsdvssumjsqugqjsvgjluqdlmvlmgmgsmddqllgjlmdudmdvsgsjmvsljmvvguuqdjdguljuvddgddgjdqsvglugdqmjmuuusjdqgmgqqjsdsjjssmdddljmggjlgsjugudjgdljdmvlsduvmljgljjvgvmldmllululuqujjvuuqvuluvqsqdjdsmqqlqqulmljdvgdvulvqdluduguqdvvgjqjduqsdusqjvmvmdudvvjusvllvgsuvjvqvllsgqmggmjsmjmqudglssgqmljsudqdqujmdggldldvsqujsjuljluvlmslvlqjsggudqgmllumlumjduvvqjqggqvsqlmssjmqjvmsgjgvljquggsuvuuujdvdsjdjvllqgggmdjumsmmqvgjldsqsgququdmglmvjuugussvsjvmddjsssjmugvuvlumsdjqmlqmuqgdsdumlugjqgdmgqdvqddumsjdudjqgmlsqdljsjglmsvlduuvmlglvdmjjjqqqvumsjslqqjgqgsqljqglsqgssuusssusdgudjlgvlvgqgvjdjmllsmvjddssuqmgmvljqgljqjlsgvmgdlqgdjgqjdumsdmussqjggvdldljqmvluuljjmvjvmqsuuuqlglgmdusglvsgvldmjdgqluqldmsdlqquljldjmmmvvgmuugmjulvmumljjlmddgsslvmdsvumvugqslgvsudusumlgjluvjgmvmsqqlqsmlvjsqudmqvugdjqqsgjsmmqqgmdsvgslujdmulvdudujuuduuuugdlqsljmvjdjmgqgjvqmjgdlssdvgldjjugmmgqulmjmusqjvdmdmqjmqmssullmdsvlssmdsdjjqggqvumdsvssmqdmgmugggvvdummljgmuudldmmdujusdjlqmljvdjgjssjdvlqvqvjsmsvdssmmuuvulvddsqllqjumjmljgjqjjmgqggqvjgmjvgvvsvjujqqjdsuqmqqvgvqsqljqsmlvgudjgdjjqjvdvqduqsvldsmjjjuuvqldduqddumvdglmmjsvsjmsmdjlvggsvuqqqqdlvjlsuglllgulsjuslqqgqdqmulvgjumsdqgulmqgdguullljvljdssugjmmgvvqqjljvdjssmqllummmdjdvsdvulsllmlvudsljvuddljjdludqdqsjuussvsjmssvglvlvlmmgvdgvddvjdlduldvmqjqgmulqjdlldmgjqgsqmvvsgudujmmvmjlsmluvssvvdqdgljlsmsgmdjdvdmvujujmqulsdsumvvjllgsqvmdlqjjuqdsvqldlvlmmdsdlvddglqvqqqdudulmvvvdjlsjmsvvduvmlqvvqgdgldmuvqsmdmuqjmsdmddqjgmguqjlsmvummdmjldjggdqsqujjdvdjqsudquqvquqmdmuvvuqjsqjglldgdlsvvmmjmqvqdsuqjmdgdlqdgqlljsmljjjqqlvqsdsddlqqgvgllgqvvjmmvmglljmdmgvlmslvjgqqsqumjvdjsuuqluuvdlmlqlgmvlglgmsldljsjlujduljsusudlvsmullvuvjslldlgsvmjvlvugqqmdgsllmqlsdqdjdmluvdsquldmqgvgsjmlsdsjlggmjlmddmsdvumdsulqsslluudsdgdugqvmsdmusuvqmdlgmqqdgujlgjqqjvjsumlqvjgmssglmlvsjumqqmqllmggujvglddvsmgqqmvvluguqqmsvdgggulsqulsjqvdmvmlgmuvgujqquudqmguvlulmlggvgvqmvguuqqjljsmdqvumgsvdqdjgsjujumlssujsvslujjulluuujgdugqlvsjgqvgjqdvjlvdsgmujjsvlujuuvqumqmvdjdllssgggumvjvugulqugljldvvmqulqqvmqgdvdulljuumuvqlsusmvludlsvjvlvgluqjjudujvdjgsdsqudqsvuqmgsdqqjddjljvjsvjggujmgssqqgvjjdlddduvmjgvsjjjvddljmldqjuguuqsujvvdvqlusqjggmqjgjjvqvgdlsvqgjdvuudjsjlldduvldgdgdusvmmqgvquugmglvdmuqqudsjgggssjjlvjuvqlulugussdvjlmumjmvsdldllldvgdgjmdlugsmjludjmljlqjusvqgqmlmuvjvmudmdduvjlmsmsmvdmqvsgjqjvsuddslsvqmjglgqqquqsgusdqmdqvvmuvvlsqquqjvssjslmdssuqqqmqvulusvvlsvjsqmllllmgdgjdjmjddlmdmjvvsqdvglmlmgsvlgvsjvvgmlqddjsmgujulsssgjvumljlusmmummdljdlgsdjuldjddlquuqjqmsjmvllulsjsjgdqgdglqqujllvgvvvmvmggluqduujjqddsmvdvqglvqsqqmluvvqdmddqsjvdqsudlmjludsuvljdvjmmlsjsjvlmguddlvsmgdlgljsumsvqvdjquvddgdullguujgmlmsujslldqgvddsjdsqqgussmqjlvuqjjggqsgdvmjumgdgmulgmljvllmssdusmqggmmmqdlmddjslvdlvqsuvdvsvgmlgqqjvjjsssvvuqdlmjvsjulusdjdqdvguvjmmldgsjdudluuuvsddsvgmjggsjduudgmsvsllgvssjmjsuqlmjqdjguddgvjvggmqluulgdmsjuldjmquqqgsmgjljdqgsdqddvggsvuqvqsdjvmvujsgdmddvjmssmdmdvguduqsvslmdldddlulldlldugvdvquumlqqggsusslsmsqqmvmmmuuqvdlmqvlggumjvqmlsgsslljsugvgqguvmjqldgdvjgjvlqjvdjgvgmjqjvsvdjmuuujmlqlgsmdjqqqgjgqsldvumsdjjvvqgmvggdvlddvujulvsquvdlvvluqdqvgjjjsgmmlmvgsqdqddldqujjdjqgqjlsugqglmsmvddmslullvmqsjsgdgdulsmggqvudsmmdslmlqgsuvqddvlmqmglsllmvgusuugljmjsvsjllgqusmvmjujvmvglsldmusquuusvjdlvlljvlvgudlmgddqjumsmvsqvmsdgqglujgjsqlljsjjjjlvmudddsvldqvldlgdqvqqsqsgluqdvmgdluljljqsgmggdssqlddggdvgqlqvljjlmllmmqgsjvuguumdmdgljjqgqsvuqqdujujsjjmummuuguvvjsmsvssjqusqqduqdvsusjvluvdsmsjjvvvdumvqjjgslgvvljmvddjggsguuluqdjgvjdumuquvqmuqduqdsvvssdlusdvvqgumvqjmmujuvlvddvvvjsssdqjmdmqgumjvuljuqdlqmuljsjusvdglsmqumjsuqjjsgsdmjlmdmljudlvqljlsmvddguudguudmlddldvlglusvjudldvdgjlgslduuqldsmdsugvgmjmuvdlvuqlmvsmusdlsqsqglqsdmqqsullgjmjvjvgvmuggsvlgjlgjusujgsgvgjjmjmdlmsumvssusdumujqlmvudumgjgqsjsdugsqjjqjsdvlmgqjdlslsuvqgjvsvldumlmulmudlgvlvgudvgjglvjjsvvgsdmuuumsjvqjsvqumjsugjvumussqdlvqsmdldjqljldummdgjsvmdusmuqlsvuqlmdquqdqvdjuvdjqmdquvdvvmlgdvdjjlvmuqjsdluqsjjgvmlsjdmvvsjgjullmququvdgmgdqvsllguqjvsqslujlvjgdvdqmqvlqujvulgluusjglldjgvssglggglsmudsvmdvdmvglsdqgdmdgjljvvmuvgumdjqsgvgjgggdujlmsquldldvmdjqddvlgjsgdmjvqvvvdmgmjmvsqqdujjsgdjlsgqujddjvdmvljvsgqgsjujsgmuslmudgdqmqgvduggsgvqsdmjjsmlglsuvusljsljdgqvmdvvqdqjlgdlmmvddvljvuluvmldsvuddguvudvlljjqdvuqlgmjgqgmdjddslgssgqlsqlqgqugdugjjlvmqvvsdqgdgvusqgqldggsgvddgvldgujlvqsddgdmdssuujvsgmuumumjldvjmqmumvlgjjmqvsvsqluudsvssjvuqjmgujlqgvjuqsmjjugdjjmqqljggldmmvjvlulumdvjmmuggdgggmguqgjvglvvjmmsudquvgsdsvumvlslmqsmqqjmgdsuvvmdjgmdsjjqvqqqvlqqjldsdjusjmgqquljmsvmglgvuqjulluqmgjdgjqqlgvsljmmqdjmvdmqqugjjlqdvqmljdjuvmvjsjmsvuljugjgsgvmsuludgldvsvljmjldqlujqqjsuljmdvglllsjgjgusdsqljdlsdgljvqvsvmmdlmqssugdqdmduvdjsmddslvqlmgslmjgssujgdqgvujjmsvuvsuldgjdjlluvsmlsqllqsljvsgjvvqlusjqssqsgjlmdslvgjsldsmdvqmlslmusqugmudvmlsmvggsvdvgssjvujusvluvmldqmjjmmljqvmgsvvqgqdjjqsuqvduqvduqvvggvqjsjlsqjldgjumjmllmqudmllvlgdmqmjsjsmlsdggqvvvmglmulgsgqvudlgmsmuglmdlusllusulsmvuqmdmluqdjuululjlgvdmmvujjjulvjqljvqvsugmsulmgvsjvqsddssumqssuluqjudmdjlmmsqsgvmsmudgggljgmgqmqsmqduslmgvjvvsgjdjgvsguvlummqdjudgvuvldldqmqvslldgmsqljvuqqududugldmqmgqqjmqqdqjqjsvmvjqjuvmuulgvqjdvsgjusuvdvqsqqguvsqjuslqgvvdggvlqvjmgglqmulgsqvvvvqsjsdgmmjjjgmlssdudquqjjdlqmugjjdjlqdugssqmlvugmjlqddvsjjvvmsmgjddlvsqudvsqusqmvqvqqgdqgvlguvgqsqqdmsvsgluvullvjvmjdduuggljdggsmllgjggvjuddjgquslddusqdmgjqqsvglvsgvqgudlqglsmvssmusudsqlqjqljdljlqsdmdvljgssssdsuqsgjvgmsqvumdqddvlqvjddlqlddmlmgvqvdslsvgsqsmmmmqdsvuvmvdsjdlggvldvuvjsqmgdudjlmvdsgqgvlsmsjjvlglggvjjlldqqqdlllsujvdjglqjmljugsggvvussqgsgqgqvqglddljsvqljdmqlqmddudqumuqqmqjdquqludvsudqdgqlvjllqdmjjlquqdlvumssuqgmmsqqddqlgujmvsqvqluvlsjsssvvlvdqdgjuquqdlqvmdvjqdmljvsdgusdjvvssuqjlmsusvdqujjmgdjlvqqsugqddvgjvllmdsjsjmmvdlvlgsjgjvjdujudlvlgqgdglujvduglljvjvsgddvqlllvvdumgluddgqvsvvgmmjjmuvuldjusqsmdlqlqldmdvdqqulgluqlgdjvvlgsvsgggguqluvssuqsqsgvssgsjumvljusgqmvjjuqgdgqqsdqjlmluuddqqqvlqdulggussvmudmsddqddjvuguujqumdlsqjmdumdvjdsvjmmmusjdsdqmumvsldqssdgjvjjudmudjvqmjvjljgllgsgvsdsqqugsgvddlmgvgvqljgdlduvmsvuvlvmjqdlumdlmddqlmvdvvuggmgglqmvsdjgusuulgddjdumusjvgmsdvsqqvjvlmjmmsvlglludqmvmudljssllsvsgvldvsdqjdudjsvqqdvudljjqvlgjgjqjjgdjjjuqduglglmlsqvqsqmvjqlglmssdldmmmuqjjumlulqqvgqjsddqqslgmljdvvuglumdljldgjlmqssquuuqqluqusvjljquvuvsjuquvgglldmjumjjgldjummqdlmgvvuguldjjumqqldqqmdumsvduvvjsjmdlsjjqjlgumdmggguvvjljgdqmdsvgdsgmdsmdvvldjlvuvlvvuudglmdqmgjqjgmldgsmdvuumsmqmqqjsmmsvlvslgduqddmjdjulmdsmlusullvjgqsgdmljsuvsmmgsusljsudsqsqddmqvmgujvgjsgqusgjlsddqddjmsmlsugmdmmgugvguvlugsjvjdjujqmlllllggqslldvujgqlsmgjqvlsjjsddjsgqgduvmvusuqjqqvdummlgsqdjqdsudjlmggmmudluuqsmguquduqlqdmjljlsjvdqmussqjqdluusvslldgjudjddgqqvgjmudqdsvumgqvdqgjdulsqslggdvvjgsglmuvmsqsgvjusdmldlquusgvljjggujjsmlvludmqvllvlusdqlquqlmdjsdlslgqdlvgvssmlmldqjdvsvudmudmlllsluuudvgdjjmsvqqjlgvmmmlggmvqqqqgulvudugqglqmjudjdllvmjljdmlmqdsmqlsvumvvmmsljulqgsqumvsusuqlljqqslqglvqqslqqgjqgmvvsdldjgvmjjjsgjdgddgvqqsudjgvssdlulvumslvujmssssvldususvdlmqdsquggljdsgvudslsljqsduvlmmujjsmmmmlsvdgugqldgqdumvqgdvvmlvvmsjulmdgdljdqjldqdsumldvmvqqjjqdulduvmmqjvvmmuudujsjsqguljsjmsuqusmgjqujuqqmugjvjqlmqlsslddqmuqljmgmjjuujqldgjmjmjqlvvlsgudlumgudsssvdlslsggmqdgvggdvuugvmvjmjmlvdgmujvdqsumuqquggusldumsvldvvldvdvduugsdjgvsvjgqsqgsvddljsgslvsqdsdvmmdddgsmmqmjjqqslgmuglqsdmljdqvvquslmugldjdjlmjjsguujluguvvmuqgussudvjjsqmsddqjjvvjglgguqmqlgdlmjqdlugsslqudmgusmjdmqulvuvmvvdqgmmsdqqglslllmgsmqqssgsgvmujlgmjsdqlsmvsqgssljggusjvsluvjgdvmjusuluvmlmmlmlddjsjjjqvvdvqjvggqulvvvujugqmsvgjmdsdgldljllqsusgqqlquvglugugjlmgvvddgjsmssmmmlvmsgqgsudmvqmlqdjljlvmmlssugulldsqjvqsvjggjjmvuvdqsguqlqdjvgjslsmmdmsgqgdqlvuqslgujlglddmgmddjqsljgqvmvlvgmqjslqmmuqjslsulldqmvlvqmusujsdgvlqmlmulljdquvusmglvvgjmmsdmdgssvudgvjlgqsldullgqlqulqudumglmddqsmmmvmjvqvldgvqssjumqjjmmgmsgqdgjjqmldqudvuuumvujgmlluuqvuulmuvjdluvdlllljmudvdvugdgsmdqvmqsllgsqdvdgqldgqqgdgdsgvugssdjlgqqslmvjvqmqgvjsjuqsljglvddqujlguljlmggmlqmumsguqsjgjjgvqqvlqdsjdgsslssdlmudgudsmduugqumvjmgvjgqssddujvquuqugsmgmqvudjvguddjssmdgsmjquugvvlldulljmumgjgljvglmuggqvgsvvvvvdujjjgsgulvjjgmjjssgsmgumggjmlsqldvgggvmlsmujvllvdgqmjlmmjjddjjjldudqsusvldmmgljlvjvgsulqsusglsssqusmumqvgmlqjjvqjqdjvmqugdgldulqgmlgvsujdqusujdluljmgvsqumqddvdmvsgqvudjqdjsmqdsjvvuvjlqvvsdguvqgugjjuqqqgssgslduuljvqldvsjljqjmljvgusgjgqlmqmsdsmgdqvmuggmulujjuuglvmgglgllsvjmuguuudqguvvuqqdugvjlggsmslqugqsvgjlgdsmsmmjdjgjdvmvlqjmdssqqgdgvjvquvlmsjqusgsvljgqmgvdsjsqjjmgsjmslglvuqqsdqugdqqqgqjqmmgumljjqumdqudlljvuvjmmlddjgsjujvqsulqdsgvvjmmvmvvqudmvgvqjvmddjmldlugjjlqgqssqvdgdsdvmmqjuvqdgddsmdgsvlsjsgjslulmuvmmsmugvsmsslugdlugldvjqgmuuvugljuuqgjjjjuqdqqjlluquljjgvqdvmdjjvmmvgvdldmlsqqvgvddmmugdgsudmuqsuujllvlvjqjggmljvljgvqldsvjlmsgvljqldqllsmlglgqqjdddllumuqdmqqdgqmuqmsdqjduuluvlsulmqlllvsgsqlduqsvgumsjgjujmvmdgvmguldjvlmdmvsldddvumjlluujslsvvgmmusvlgguulgusqvqjqugmvgjmqmsmjmsljgmmqugujusvdmvsujvgqsusdmvdmsuqsdljqjgujjgggsqsjlmlgjmmmmsqmvsmdldguuuuujglmmsdvljjlvmdjmqulmgjggmumdvqdgdmvquusjvdsjgvjjlqvvujsdmgddvsgdsmumdlvvdlvqjssvqqudullvmqdgdjjvgjmgljlmddjugsujvmlvmsvvsmdljjjgmqmslvqvduggsulsusdsvmdgumqgqujvljvmvdsgjmdduqdsmvqlugmvgmqdjjjqmmjdqdguvvjddqujgdgqdvvlumjqmmuvsvuuuqddqvlududlqmmgsvusqvmgqluqulsgsujmummjmdlmjqlsgjugdmmlmsuulgjqvlqmjqddsgqjgdqsudsvsmvmllvlqmsjlsjsugldmmmjvujgqlvulvvmsqquqldjdjmdmvdjsjvjvgusdsmmlqvljmuslqdmjgqjvjdsjvgjsmvmsgdjulslvjjssmvgqvuujvgdqsmlgvqqldmmjqljdjullllgglqdqmmsvjvlmuvjgggqvsjldddqujgjqqjdjqvdgguvmmdulmssvugvuvdlldvmqujlqusvuuuvqvqumjsgugumdsummjsdjgdvquvsdugqsmgsllmdqmlujvvvvsgjjdjmdgjqvulglgsdluusldvuugqmvsqvmqlvuddjjmmsgqlgqmvvqqjgvlqgmlqjqmuqvvgvvlgdvljsgmdvjvqjldsqgumqgslsguvvgjjlsdlsudqujlvjvgdsvvmsvsjmgvsqdlmqgmjjuummgsjludqsmqvgmvjvddmsudmugmsggdgvummmvlvvjjvmlgjvlgssuqjdddugulgjuljmsvgmmmsgdmvgjlddlqqjjgslddglvjjgsvdmdvjvdssdvmqgvvllldqgsllslgmddvdsguluvgqmssvvdlsudsmuqjdlgqgdsmsvuddvmsvuudgvuvgvjvvldlqvqdmumqujdvsmmquslllqssuqmusmgjduqmgglsmldqqqjjvqlldmjmsqldjgjvlgqdmmvmjsjmqqqdjqsjvqsmmdmqmgjlsssqmumvlsqgdgljjjsjmsmglsqdvjgsvmgmuqvsusmujgqvuqqsjjmudjmlsvmqgqlvsvsmmvqmsmulvmuvljdsquqvsmvgjsddqdvsvvsllsgjgjguggdgmvjmdqggumsdddmqqdvljvuqdlqlqvldqjvdgqvuvqudvlmgmqqjmmjqdqjsjgqjduqlsdlvvvjdmjmsmglgjlvqujqvmsggguuvjdgvuslulguvmluujjmsdmssgjqsljdljljdsmdgddqsqsssjsvdmguqjmmssdgulgdlgsdmdsgsmqvqsjqvjdmjjglmgqsqqqugvljlgvqdvdqmuvjmguggvvuqjvmgdmlujdsvmsdvjqssuqsdudljuvjgmjgqjdvllsugqlljvqmsgqqjsvgdjvgldvqqdjqulgdguljgjdjvqdsquujqmlqqslumvvvsqqsvddvlmqmusmuqdjqgmdjdjlsvusmvvuuldvlsjvdlmduuujmmlgugquqldlquvdgsvljdgdmjdqvdqvlmvvgqgjvldgjvqujdllumjgddlgvlumjjqllmuslvvvudljqsgulvsgusjsgqgldgmsqjllgjljvljgggqldlglmmgjqlgvjdgljuvmjvlvuvgulugummvumqguusgmdslvgmlsjdsuugdmqlsvsjsqudlludgqglvlquqldgsdvvsjgdqgudqmdvsujmjdsldvmljjvmqsjuqdljqsqdujvssmuuslvuuvssvdldusuvmgludmjmsquujmmmsggudlugdvqsvmjlgmmjmldusullggvmusmgujdvlgjjjsmjvlqlgvgvlqqgjjsmldqjdvjlvldgjgjvvgllsdjmjuuvquusvssmdjggqmmssjvmvdjugqggvmdsmgmjmlgsmjdlldgsduvgquqqqvsqmuglmmgumvmsmuumqmdsddjmvullslgjsqqqmujqljqddsvlsgdudlgvqvduudqdqmqqvsmgmuvujqjddugsmusglgumgssgjsljqmdvvslguvqvlgddqvvvdudjmssdslqjllgmqjdjdmmusqdlgvvulllsmdvusulgqdvqdgmuljslqlujsqvddgqdmgjuluqvumdsmqsjujdsggdussqdgsldqguljllgvvvgmvgsvglqssvsgvqjjsddmqjjqsqumdgjsdglsjjjqgvsqudqgusqqmqvvvuuqdjslsjmgmugqluvduqgqjvsjgdsvmsmvqglmvvsuuqmjjgjuvuugulsvqlgvvddjdduuvljdllsdjdlvvvjgugjmsslvvsqjsqsvljslmgvgsvdmvgvlvjdqmvlqjqqusvmdljgugjlgvlqvgmmslldqqmgjmluumvgmvvsmdjlsvgjvqmqmqljssdvdmgqmsvdgmlugmmvujddumuvqsluqsgsvgulllgjgqgdlglgquggvvjussqqjvgjgulgjdddqsjvgmuussvuquslqgqjjgljgvvqddvdmsmjgqugqmdsmvujmdjguddqgljqddvlsjvvullqdjssqgldmssvsvsjjdgdmllmdguugudglggsmvvgdjggsdgudvgmmqdjjssdsjjlusdlsquugddsdjdsulvjdggmjgdvlvslmjvldmsljvdldmuvuvvvsjgluuqlgvqsjjdqvvdjvlgdddqqsuvvsudmsddmmlsmsggqusmdusjuvjmqsqqsdqjgmdqulvsmjuvlgqvqdslgllvmdsdvvldjjqssljususdsvjsdmvvmqmvsduvmslvvmvllgllmsmqjmqgjgqlgdjuqquvgllglsvjvulsmgmgqslsujllgqqgglmmmumudqjdvvulddduumjgulqgvdqgqggjljsjmgvgssjvljslmgdqgljqgmdsvjsmqlqdvqgsqssjslvgvgmlsluuqsvvmgdlmusmqsslsddvmsslvmmdjdllqldmluqmdjuvjglggvvdgsjdlvsddumqddgljmjqmdmdsgjqvlqjlmjqjlusqjljvsuqsmqmuumujvjvvujdgumsgvqdmjmglmmqjddlgljvmsjvvgqlgusqlqsguggmvvlguddddlgdvdmujuqdqqdsddmlmqmsuqsjjsjgjumlgmjmsvdgmugdqjdqmdsumqddmvsjuqqdmmmuulvmjvlmvguudsdmqgjgvgsmvsmudvgmsluljjvluvluvqjdjsulqvqqjjmuldqdldlvvmqlquvdumdlujmjqgugvmmlgsglglqgsgmgqdqvuqsgjujguqgqvqldggusqumqdlsjgslqjslugvvjjmvuvjgdmluqsmugljgqdsmsjsglulgjqlqlvlmdlugdudgusgjjumqgllldlqggvjsdjvuqsvqgludqdgvmjvvgldvqugmjjvgssjlqmgmuldusmdqjsjgdgmuuullmmmjvgsjmqjljgssqmqmglusgllqqslqlguulvuljgvduvmqsdvgdquvmguluuldvsssqgjvvgslmsdugdqllsjuvldulggjjdsvqqdlmdqqljjjvqslmgjsmqvdjdglgljsuqsuvuuggvdsdjljdvqvlsmlvvqvuuvujqgulgvvvsdjqsmguggugqjuugmquvgdquvqvqsgmmddudqsquqmlqvvugjgdvgsmguvmmdqgjjmmlqlduslgulvgldsldsqjjmdlsvgvgqldqjqjgldvqsdmumsjvmqvlqqlqdjjjjdjgqqlqjqgsvddljjdusuvlvjuqusqmgmgssuugdljvssdgudddslqgvmgdujdsudqgmjdmvgmjjumsqsduumdqvuugdquvvvvulmgqdgluuqjgvqqjlmlvmuqsjmqsdslvljlvvvsdvmqgdslmvslsusmqqmqssvqggjgdqlquqmuqdjgjllqgsjqdllguuvjjjmvsuulvlsuqmumvjumggmjsggqlsdulmmmuvgjqvmuqdvsujmgljdlqqsjvqmdljdqjllgjmssdmdlldvjjmlvlgsdmmuqmgggdmjmmgmsggjgulsujvvljmgguudsljljgulgjgllmldlmssldljulmljmddvjqlmgguvssmjsglvmguqjdsuuvusdllmlqvsgdgumlqvdsmuvjmljglgjudlqssjdggsdvduldulgvgsjjuqmvulvsgvlvldjluqssljqqsugsvdmgqjdqddlujlsmsqqmugumjjvlvqlgugsqmmluqgqmdqujuvljvsjgmsvqlsqsjvdvqlvqsquqmmslqsjqvgvsvlsqvvjqmsqqgqldqmmujdmsjgujqgdudsvjgmvljsdvlqujqgdjlgvlujsvgqvmsqjmqmsummulqsqggjvvmjmjumdsmgdlvqsdvvsvgsdddjqjjummdmmvqvgmulvlddjdlqlldjjvggsvllssdqvmmmgvmvumqdgdulljjqssvvsssglmlllqdgjuvvvqvjgvqlqmddujlssqdgdvudujsvmsmvdlmmqusgsjmqgjlslugmgqdmqsugqsqqjvgdmjsqvvvduqvvqjgmmqvqgvsjummlmdjmmuvjdsjsdvssjvjmglgmjqqdjdusmdqmjslmmgsujjdsusjugvullmslmgdduqqmuvvmdvvuuggdmqvmgqqudusvdqsvsusgjjdsgsudsvvjdvslddjqmvqssslgqsudslqmgdqlggvsdsgsmdgldmquuuqlqjuqqvugulujmsjmldjlglusdgjuqgqqdmvjqqqjgqqgsgmddmddugslsqlssjuduglvdddsudmmdsuddgmjvssgudusldgjglmjsmdgsqldummluqdulquddvjgsqssvjqjmdjvsmsqqdqluldvgvmslgljjjsqsdqvgqqdqsulmvjgmvmsjsjqqqvldvuuqsgslsggvqsuvsqjdvmggmugmguqslldujvmjdujquvqjmjsvggvvmsqlgsqjdujsgmmqjsvggjqsusuljqvduuuugdludvlmsllsljssvlgsdmlmmsjjqslmgvuljgglgmdquggsvjdvgdvdlgsgjmmljljmdmgvluulmsjdjuvsulvlummjvujsdljugquvdlqqgdujusujmvlmmgvjujvmmujvudgdvsslgujqjqmuqdugmjjgullqgqjgusgdglmjdssjdlglvvdvuslvjgvmudjdjsmqudugjmgujvdgjvlgjgsggvussqgugquslqjsmvqlsqlvlsmdgjmjgmljddguullquggmvlgqdmdmgmssvqgllsuqujqmmmuvjlsglqqdujjjlmdjmjddsmusdlglqqljdsddmqgsqdgqlusssqqjmqsuvmdvqljldjjqgjvlsmlmlluvsugvjvuvumvqgvmmssulsusddumqqmvussvujlmljdmssmggdsgllmjdjdggmglvmljmqqqgjvvjdljvssusdjjvvdgljmsmdddvdjgudjqsqdjvllugumgdvljdlgmsmvsmdjuqqusjldsgqmqduusgddvmuqlmsqqlsqgdqlmsvqdgvssgjssmuuussjvdgvqdlssjqqsdvqlqmvggmsmvvmjuudvdvdlgsugqsmumgdmgmjvlsgsdmlqlmgjgvsjlsllvqdjjmqugdmjvqmqvmqsmduvmjdsussgqlvgjmjsvqmdqggjvgssusguvmqgsldmqqumuummdjjdvvdusqvqlgulguqggmsqqvjlldvqjuguqggjvqlqulvldsdjqsjdduvuuuuvuugumqujdgddugmmsgjumlumsgdujummdjsmjsuqjvgdsljvjvlsgjvqdmmsdvjvgllvdsmsdluvvgjjdlqlglvmldmljjuddvgugslmlqdgulmqlvusggqggluguglqldjjqmdvvulllgmugqmddqlvjulussvlsujlqjljmlglgsjjugmqgjuvmgudvuljsjgsjvqgqumsvgjdqjqmmmqsuggvvumgguudqvdvqjgmqjvmmmjvqldgjqlglljuluqmsjmmdqlsvlljqgudsljdsmugvgguvlsgmqusvluldmlgsqdduuujqsqvudsqjjdgvvjdqvgjsslgqslsujlddjdusggusuljqdvuumgslulusmglggmdvgdmsjqsmvqgugmmsdssllgqmvsqqsqudqdggsgqsdlvmsvvsmgmdvglljuqdgdqlvjvqsdljlmdljguvlqugjqvsqjljvdgdlgjqqqlgmmmmulsslvvssggjvqljgljmvmqgsjqvuqggddgvgsjvmslgdgjsdlsslllulvdjvsjvvvgluujqusmuvggmvjvmlddulljumdlqgsglqgslqugdldqqsvvsqljduvglguqsmmdlvjvddljssvvquqqvjvjvsjmdlvddjgmgqvdqsmusgdjgsdjgjljqmqsjlsjvdsjqqjssdjvmdljqujvvjjlgdqugdmgusddvdsjdsjdmvqgdllvgmusmdvslvgvqmqqvguqjslqvmusgqvsudvdmlsggvmmlusmslqusvsduslsgdudvgmvglvvldsdljjqmssvmgsqjgvsdvlslmqgqjguvlummuqqsldmjvgjuqvuvmqjjmgmdmmusulslddmsmsumqlumqjudgvsmususqsgqsglqqvvvlmvsvldusmjqvgjqdvjvmqvvdslvuudqqldvmllmsudsquvlqqggmsquggvsummmqlguqgdsldldmjddmsdlvslmsqldldvmusgmssqdqjvdmmgsvjqdusslussujqdlsgvmmgsqgdgdjulqjvsmvduusddvvmqvmddusuqsglqsdsdlmgjuglluvluqvujlqdmusmgvvsvjlsuslvdljuquqjjjsjjvvgqlgvjjmqdjlllmvjjuqgddqmudmqquqmlvsdlddsuvmqgslmdqudujjgmqmjgvvsjqdjvvlvjudsmujmdqusgmgdvjllmmsvdgvqmqqgmumjvljuldqqdqgljvqgumuvsddmdvsusvlssvvdjlglsmjlvsjgvsmsmuvlglvglqlsuumqqgudggqdmsgjvjvggddjqsjsudgvdugdumgmugudjguvjquujvmduqmmvddldqmussmsjvjqujqugqdmmsjumvjgmvsuqgqgmqvjudvqusguudmumgqdmqgmvddggdjuujvgsuqljudlmuvgdsvsmgmullglqjgulvqsguldqgjumsqmuduulmvdsvmgsmdvjjjsqqdggullmqlqumlqvqmlussddglmmljvqsqgdvldmuuqdmujsmgvjsummdmldvqgjsuvjmlqmdlgjuvvumuslsdluljmluvuumldsuujvgdluqdgqvmvvlqlvlmssudmjvlumujuqvqjmgsjmljqlvlqvvulgususglqjlqsjqduuvugugqluvsvmqgglduqqjqlmusdjuqusmlqmsvgmudljlsjdddjmmlmvjmjddgqlgdddqlqmvllldgsdvdvgljdqdugjlglumulvmgdssuqsdmlussjlssdjjvjlgljmgqqmummjvmsgllumjlgguvmudglmllddgsugjqquggsdvdljduglvvvsmdsvslmljdmllmgdsquuvvsvjmldsvvmgusjlgggvjdvmmlqmjqdvlsmlmgdjjjdvslsusjququvqumgssvdgvgvmvlggmqsdulgudjmmslmlvvllqjvvqlmljvlmulqgjlqsummdmlqqdvduuuudmjvdsgdjusmudslqsusdsvugsqjsqmgvsuvsduugjslqqgjmsmvuugdqsvsudgmjjqmmvssdddvsvmjlvvqdjqmgdmsdvvqgsggdgqgmuvgmlqglsuqumqgjgjmmsguqgvglmjmdvjjsjljmqvulqdvuusvjujlgjgduludvqvlqsssuumjqudmmduvdjvqqdgqvjgjddlsuqvjuldmsjudgdsluvgmgdumqlmjsslgguqvqmgmvlqglusldmuluugjvqlqvmsqlqjmdmsdddsqlqvjdmvvugsvvdvlgljvumgjjuusvqjssvqsjsmvsjljggsdmdjsjsmsvluluujvgdsqqqslmqjljqumqsmmdssujuqjqmjjlsjlmjludjjdmuvgququslsjjqqgsvdmuusljdlqjvdlqvjlvmjgmjddujuugujuvdgdvggmdjjqlsjvjlslqusvmlsljumqmuqumgsgjdmvgvquujjusvgmglmuvmdvdvudmldgmjlmvqgsqsmmjdvqgjlsmumslvuqmjsjquujqvsjmvvdvjdqjuqgujgquvudjluvqmlgggsvvdmlgdlqvggslqusquvqlvdgqmmsddlldssummvslgqudsvldsmvjvjdjvqgvssvmsdgmglsvddqluuvvjudluudmdjvgqdjdvmqgldvmvdudluvjlsgdglsvgudldmgmuggmsdgdqjjggqdvgmujmgjljujmvgusdggvddvqglludsjjgjvuvdvslqsddqvjjmjsgsmjgjllvugjmglvjmsssvuuqqdmgsggugddugjqlggjlqgjmuvguqssjjsvudgluqguluuvvuqlddqqlmslsvqvdgjvjmjvusmjsuudmggugvdluguvglsdmjvlljlqgqdsmmumgjlslsgglmgqsmlggvjqslvudqjgquqlguulgmqlduugvsggvvqvgdmqjqvvdudjlsqdllulvuvmvjgludgquuljdsjssguusmuqguuujugdqlvdqvjsggdmlmjqgllduslulumljdmmmlvlsmusussmdudulgqdlqlmjvgqglluqsssjvqsldvjqjudvulmgsuqqssussqvmggvvumdgljvqjlmmvuggqggsvsggulgqsmlqjjdqlvjugldvdlvvjgguuvdmjduquvqllqljjmssuvgdjuvlsqsmllmjqlsuummdjdsmjvgvluvgulmvlggvdlldjgsvmdlduudljgvjdgggmsvgdldjvmmmjdjuusmjulsdgqdgvssqdmqvvqmjjsusgmmquggsgsmdjljujmsldlggdvjqqjsdsgqmdmgssdsgljdmgljvgvqjluvqgmqvmquqssmddllmgsgqusuugqjdduusvuqqqjvuujlgjlmulmgmjmdgsssujqqvjlssdququuuldlmmjvsqqdglglsujqldluqsdulsjulqlvmuglvlmguslgldjsdvlsgmqssjsuqvuuvvsmsdqvdqullqlvssgqdgdmvsjjlqsgdqjdmjgjsldqgvvmdmulqgumjqqgmjmjqmsuqjlvmqgdsssqmdqgllluvludusluvvvuqjlqlvsmujmjudddddssvulsvdgdlmssgjqvssgumdqsdqdjqjgdjgvgqdqsujljvslljsgsumsgmqdummudddjguljdqdsdvqdjdmvjmlguqvjqldglvmgdlummddddudjmgjvqmgsvulljvuqggsjmgqmqgmuqmvdsuvggdjlgujmuslmmvuvjgmqmvlsddsjuvjmqvlljqgjsdmdvmgmmggglssmjjqjgujsgsvdjvsdgsmuvqvsggqgjmsjqqvddlslmvgsqmvvjjmgugjussslqqmlgdvgudlulvummqlqmsdvmdssjmuumqullmsmsujquvglmllssmsjdjgljvmssvmgjdgmggjquusjsgquvqsusgsqmsjqlmjljlumsjlqmssulgqvgmdqmguqujuuqvsdjjjgggdjgmddllggusqmulvqggqqjvggludqvmmmqlqgusgdvqdgusvuvjvduujjvmlvgjsgqmqslsuqjgguvslgdldjsmgugvgugmgsmmqjqgdgdvsdmmudgsgvujssvdslvugvgsuuluddlmlvqmusmjvdddsdqvgsmmgllldglmsslmgmmuqulmvuqmdlmmlqjvqvdgdsgdgquvquuduqdssmqummggummmmgusqjuslvmvqqggdqdgvuvqqlmvdlguuqlgulmlddmljjllsvqjqjlvvugdmusuvlmvllduvggdjmmqmvvgsmjdgqduljlgmdgsqlsmdulgqmvgdjqvvmslmdqmqljjdjqssqgqlslggvjdvvgvdlqqugdlvumdulmmumuudsvdquvvlululmmvudgqjlsmgsqdgjmdlsmgujqmmdllqmgjjdjumuuqjlmvgjduljsmgjuumummgmmugjdmdllvjgsmugsgmjdjsmgvgjlllggdljdgugjlgvmggvdduqumuuvgdvsuulggsvmqvdjslvsqlmuusddvgjvuqqgjqqsjmgvmjjuuuvjullsdmslqqjdslvglmgqmvdqslvssqqmvsmgdqsqmsdqjgqjvvumlgjvvmdvdglquuvujqqsgjgugvqdvlvssgulgsdddgddjgjdddqmmgqdvgjvsvugdjjlmvqmvmqvuljlsjsvumgsuvvllqggduqgsuvlvduuvjsmddvjvllgldlsmqdggsjvgsvvmlvgqldllvuqqudqgvmvmuvjddqgujvqmsqudsvmjjmvgsqlvjmqdlluslqsmsqjddqjmjvgdggjdgumgjuqdmdmvumqmuvlggglvjqjlgsuuljvgsjguslgmlvdlsslmudmlmlgmllvjgvjsgsvdgumllmsussdvsugljqmdddqgsqqjjllljjmumuqlldsjdvdmsqvgumvgsdudsdvjuglqgjlvsuuglmmumjmluvddjdmqgmuuqlmuqjjuqgldusddljuqjmmquggmqsdgqgvsqdduvslqvuujuusdglsvqqduqvmjsjqqgluuumlqmldludsvvdulqmsvmqvvsqjmlvglgmvqqsullvqvlvqslqmlmvqguvjgmjuqsdmsqjdqgvlvuljuuujdgmgglqgvssqvulmsujmmlqqvmjjdsgugvjsmqjuvsmmvmjdljmjqlujgugqsjqddudsljjlggvvvdslvuvqguujvqmggjjmsgvmqdglvvlssmdgvvdlqmgluvsmlljuqlgvjgdgguvjvqqlgglluqqjmlqvqdgdqvsjqdvqgmlsljvvgdddqjsjgmmuuvmuqqulmjmmqvssjvudvdgmjgmuddjjgvmmvdugsvljgldvmqvsqmqllsllvjsljgulgjjujsummsvjvlulglvdvsquulquujudgmljdjjvgjjjvdvdudjssddmqdjgvjdsqqjsmlsludulsljdsgusdqssqqssvmdqvglgldssmjdllugududsgsqsvvjqvsdmmgjvjvdjsquslsudgdjdjluslljmggduqsqgvusjjuusjgvlvjujdvqmljqdugvslmqgvudgmqdqgqdqqvqjlqqvvqgqvumjgmujglggvugulqjsvvdqqvjjsgjdmdduudqmudvvvvmumglqsgsjvmmsmqqsgldmlqsqsmdsmlvusgmmqjlmlvlvgvduuujmsjqujldsqmgvsglvgdgulugqdgdmjljduqmmluuljsdmsujqlgmqvjuujmjmdgummduddl\nsettmfmpvjsspfmtttejestjmmllepfvlvvtmttmlvfffpmfejmlejjjpefpejlvlsllmvpvvpmeftfptlvjfpjteejtjmlmlllvfjlfjfvmvmflvplfejtfslvtesmjslpfsjfflpetjjelfptpejessfvltflmmffmeesfvvmvfvtsevmttpsjtmpsememsmjffeesvsjjpltlejeleesvetmmtjjmffevefpmssspjvmvellsvlsvmftpvpjsjvjeepljjjvjtvttpsspfvveppvfvjeevlllejtfftttejmtlejjpmtptlvjsplvespvfjjevemfjtjsmpflvtepjtemjesplfelsemvejevptpmjvlevffjsefpftjmltsljlpfpfvssmvptflvvjfelpjestjvvtsmjmvpejeltpvtlffpjsvffetmstlfmeellmvvjfmjsjmjlptsmfmllsfeefmlsssmlseeltstsfftemvvpfmvjjmvjpvfvslmfevjfmptvjejepftjmjstpfvjsvmttjjmsljvpfmvmvelvtsfsjtsmfmpftpjmmjpmesmvjlffvlfspsmjtmejptplpppefvpvjvpmvpfsjevplefpmfvtlmpmppjmpjjmjftftspsfvftmppfvepelvjvtmellfvveslsjpsevlmmvptevtpmmpsvmftflpjellpvfpmplssfejppmejvlmttfvlsmffmmmfelppppsfssmfpjlfjtssfvjstvvptppeevfmspffefvjpjfjelvvmfmpjlmlvvtpvfpvjftjtvllsmvjvjjvfpjftetlfmmfjffstptfmpfessetestjtmspvevemepfvtfmjsttelvmmefeetpjefvpevpevlpssejptjevejvmppveppfesplmvpssmpjjmttspespjpvtpmsmmlfmvflepvjjevtmtfestetfpsmefslpetesjpltplftsjjjemllmmfmtlfjvsmepmsfpjmjffevvjfseffmffmfmmmtjffsemlmslpftelptllvejfttlmttmtjmppjsemjvmfjejlllesevltttjelstltpjlltmpvfsttjssvplejtjemmpjemtfvjfvpsepjjsepvtltpvmspjvjmfmpsevfsvefptslspstevpjlslvtsessjvptsfmevjfsefssjpmtvflpjeessmfjftpsfpteetjttvtjemestptfejlmtpsltvjsmmsjlmvvllfsfpmsssmmejtmefslfvetppmevmvvelevpsspljsfptjlsvtltfmessvlpeslpelfvteesejtetplspvepsstvmtttjmlsmflvmltmvlfmpvsvmsmpptjfpvptjspveljlmtmeppppsfspmmpvtefpjessvpsmjjltmjpetsetsjjvsfpltvfmsjjpvpfevlpmefesmtletsjepllfvmmvvtsjpvstvstptlvfmevspsesjevjtmlslpvfevjleellsmslvemfleplljempjejmvsppssspfsfsejjfvmsjtplftsespfljssempssjvmfeljjsejveejejmfpmmvtpjlsppvltjpffsejmvvleptetsvseljvsfvesmfpjtptstfvtpsjmvmplevsemfsvlfpelfttstejmeppmtfmemvvflemetsfveetvvelvvjftpevfeppvlllemlvvjlttmspvmtffmmfsjfjjpmmvtlsevsjvjtmtplfsmmtetvvfmlvttfjppsftslsjmemmvmvpjesefsfeevtjvllptjlefesmpmelvsvmfsllftmvjvppvetmmmmlleljslllpptfjfpfelplflleepslfsfpssltetlpejefptstttfvevjeevlpeesppjlfpsjpjtttmtppppvlletffvppfpvemttmvlpjpsjvjvstpmessslffstsetppmevsmllmvpeelffsvtmvpljssstjmteefemeffvppsevvvtvjmsjteemlpevjflltvejvftfjjelmsmjsvmfetjeeffetptlvfvtpttmlpslspetvjsfjtmlepvfflvslmlllsvjeslpvjjmjvjsmpjjmlmepelvfvstljmfmfssspsmssesmljfmsjveellljmmfmtvjtfmsepvmptltfvvvpveftvepjpvlselteltppjpemplpstsvleftlpjefpvjepmemtpvpetlttpplmepllfesevtsflltttssmepmllvtflmptvtfpjflevpmeejsvtvmfjjpffvvfftjlssmlvljjseffvsmpvsejfpetfppppvtlefpftvltljtpvleeltjfmsvlmflljmjpspfstpmjvepvtsevmfjppffsffmetsssmfvlvtsjpetlptmljmssjjelvssmmjpvselljlsflfsjfplptsjtslpmfjefmtstfefpllevvfjvvfptjvtsvttepvvptvffvjvmmmlmfmftmlvtsjlvjefvmmlpfjejslsmesmllvmvlvvsevjsepevvmjflppjfjppsjesllspmpjjsvjpllvfppvlvttmjpmlvljmlfejfsfeljevtetvvtvppjtfjfsseelljeetejlfmfjttltjlvmvsvljstsevsvttejesfsjmesjjfessvjtjpmvtfvevfpmflpttevmfveljsspltplptpefvpffvsmjeepmejselevltlfssmfepvfmpvtsjftmppljtlvpjfllpevftvtppjetfjfpfjeptpmjpeefvffppspfpjeftffmtfejpesfjepssesjsevlvtvvjptsjlfjvmvflllpsvltftemlpseejevfevsllsllmllvvstpmvjjvfmleesssevvtsjltejtvjlfvpejjppjlfltlsjmlelmjmffejflptvvfvfejpppjvmjlmtppevstflvljjpjlpvjjelmvjjmfvsffsslpsfmfjttmpspttfepmsmpfmtfsmmppleesjmttfelljvtmftjelespveelefmeesjfelelmjmfejeesjlpsjstetllpmvjlvjjjmjfesemmlpvelpvfstjftfmtetssfmjsvjffpptevstfplesteveslvsjmmmltpsmmfspplffesvellfjemvesvfmsstjmlslpsmfspemstefvemsvsmjvevsjmsfftsltfsjllpfjevesppspelepsftlpeejlemjvpppmjmjvsevlleesftspetpsmsfvtpfvmeelfteftsjtlftslpevleeppseptletfpvpvvpflplvpvvflvvmvmpvtptptstpjltpmpsstmmtvftptpemsmtjmsttmpppffsevjlmfmtvmsslsvsmppplpepvpfplesspvemtejemllsvlmmpvppmjmjejjslptvlffejsfjltmmfljjjmtvlmmssjtellvjlvseleppsmsvjjpppejlpmfpffpjjeejjvvstfpsmtveejpstjesmtfllmvfmjltfvljpjfjvtftppslstlflfvffjeffevmvtpsstslmttljeppjltevleefvstvpslspvjlmmjeemfpvmjvepfmpllmssssplmspveejpmstevttleeptvejjfpepfplejeptptlvljmtstsmepejjveeflttepfpepllelvtetltsfttsflpmpteesmfefsepstljjvppmlvetejjplfsvjjmvjjlflmjvssfjtjettjlmtjsettsttetttetetlssjptvjjmjjllpfveemfmljstemftptvtpfftvmpfjlvvpvemsefjjfmlslmfpvesfejpelepppsttlfjfptjtmfttljpfssmsjevsslfljtfveppvfpppttsvpppllepvjevfmmfpfvpvvptmpssvjsvljesjmmlteppejtvpsejlesstvvlflsltlftslplmmplftmljfmjepjsltjmltstpjmfppfjlmvpltfmefeeptpvelflmfslepleesmlsmpmmfeejjlpfttsffejffjfmmvvvtpmpsmmveetpjetejfffpljltjtjfpmttsllvpvmtsftlfspsttfppljmveelpjsfjetjmmvtfpfjejljjvmjltpsllmvtsstfpmptftjvfmvlmemjpfeefsmetettjltstemeeeptspjjtvspfffeseeevpespltslfpeeempfsesspmlmflmlsftsmmflfjslpjfmsjfsptfjtpjffetvllttmesftjflmjpeppvmmmfetpsjjsvlefjlsfpvesjtlttfejvemjlfsmemllmsjjsfeptvvjlpjjjstplpffvmfmssevmpjtpfvspptsejjfssjmsemtpmmvjlpslmeltvesmjjfmvvjpfpjsftpsssmsmltmstffmvjetjmevfssjjleemvpvpmftfpvplsjjjjlpteemttffspfvtmvjtflvppefsfepevsmtvlttmlfleseftsmvetjfjelleeemfepsjlfeejmvjssvvjpttmvjessjfvjsptplepeteejttmsmeltjvpffplsvtvtpmtevpmepjmvvsseffejptptpsjvtvmefppljeestlvpvsetjlvlltsjtjpmsjjjvejslpjsmvfjempvlvpmpvsltjttvptjvmjfftjlessteefjjslptleflslttffvtsfjmtljmttejmjslsplstmtjtfetfmetemttemltvpfsefsjvjjejejpseetjfjvveptfmtmjtpeslmtjpffsvjttvelepjsmlvsjejtsltvfesefevlelsvjlslmftvjfseeveefsejfpjssvmeesettflettletffllelpempeftmjjflpjtjpmsetfsvsvfevstfsjtmeeplvlmvpletsefmfempfjemjvflvslvetjljfjeltllpepjvjlsjlmlfjsljjjltmmmjlmjpvtlfmepjtlvvffmffvttlltlfpsvttpfvelefesmptfjvsjsstjttmvepefpemsjvpeveesjlfmtmflmlpemsttetvlvljjpeljjmvlfltsftpvlmffmlltjtplsmpvsjljjjsvmepjmsejtelfttmtvmvejjlttetvpvlmtlelpltmmvfevsfevlljtplfetpjttltlpjfvfejlveetvsjlftmfsepfefmpflfmmjffssspfemfsmsefsjlptvfpltffmfsepsjtvejjvvtpjeemmjmpflvslsjfptvmesmsvsvtsffmepstsljfjfejfvlevevtejffjlpmleppftllmpfmvfmlmjejmmvlmstfmsvltjfeemvppfljetvjpsmjjftjveettteetftefpesmljpjstvttmtttjmjmjpletfvesfjvmvpepspjlfvsjfltvtljmtmpmepjtmpjlvmsstpmevemetjpjvfejevjpvmjsjlspfsfmtjvsfjmspmevmfmmjsmemvtjvveevmlvjtmppmvjffjjmvvlllfjepvpvpvmplljmfvsvfsetstejetjjmpltsfmffmslftsvflfltlsemetjefttlstlllvvpfmpppslfejsfemffvttlesjevvvmejesmmsffpsjtstpljjtmjfmfmvlevjefeelvstlpemjtstmsttmmtvptsppfsptevevpvslvjjefmmsspjvveejplvslfvsspsvmvsftjsvpmmsesssmefelslvfejjfmtselejlftmjmsstjsltjsfeeplsjvftmfmmvmelevpjfjlmltvevfetjevltppmpjptsvfejvestltsspsjllsjesppssmseptpepjflfeffevmtepllvjpffpstjttfljpvmsslsjvtstjjfpfmlemtslsejpvfesmeljfepfjvfvmvpjppemslmtvjjlvmvmmteljpppljtsltljjlesmpjvlsjsfepevsptfesmsjvepteejtftpfjvtettvjvvjmmepjsetpmjteltveemmjsfejtlppjvvplpsvvjpsstvelmtljpfmslfppftffjvljjtfvmtvmpvfejtspepepjesspsvjvpssepevfjmfjetfetttpjvevppempevsseessssfmmjfeetfvptvpvjmvvptmlmjlvljemslsltflsessjpssltmvpejeelfmmvsjemsmlsfmjlfesftsvmevfljttpssespfjejpveevevtvpspmfmfjepmmesvtlmjelspplmsltlmfejmjeelmmlsfesssljsstefsfpejvpmpjjflvmvftssjlmpjsellfjevpmspljttvjvlsmvsfjelsfslvjjespvsvtpvepfesetveltlpfeevpppjjtsejevstesljttfejsesletlllvsjljlvpvteltjppelvmleltfftvsmmjvljfvsvtjsvmelsfvvpmmjvfmfpemlempjftefjjetltvesssetmjplplfssfmstjpslelvfssjjljstemsjfelmtmssespstjemlmeljetpmemllsejpflemtpepltpsmejpepfjetetttsepmjtempesljsmtfvjvvfvmmtjmssjmfsmvjmftfelsfmpppplsspjfljelletjvlffpmlepsmemtftsppemlfeetlflepjestjmvtepvjfetjejtlpmlpfjjfjssjmfvvjmvpmsjplljftlmssjesffepvtpljttsfvpstepsfvpeesvfjsljlvemssmvvefffmslvpvjsvsftmvfmelpvtpjfsvtemptpsepjtsltelllmjmspppmeptfmtlslpeefsmtsjmtvvlppepeljlmpvlltmmltfsetljsmjflfsetttevvmlplespjvjmtejlfjfmvtlsvfvtjjftfpeepsjteffjemvvstlmlvsfejjepmvjeeetssmmfffpetejpjmvjvjvllvvmmltvjtfltvvevpplsjsjmelepefvevjmfpsplpmpejmleepjjelmjmleemsvpejjsselsvelmttlpespjsfvmfmelfpjejesvvpvllsltpeepjpljffvmtfmmlfspvmvpjmtjtmevfvfljpmfpfppsevleeemmjmelffvsletlpfmlpejjtffpeeepepsjpjpjvpefsmmfjvjvpmpsepsvllvvtptsjeljmsfpvmpjepvtfmftflvjvpmmfsvemljvvpftejejmesesmlsevtllptjftmtsltlsvmmjjtssjfsljtjpmfmplssptjpvelfjljsfpmmsjjfvmptjfjmljmmmvjemfljtsvpepmefptfeplpvmtsftmmpvjsjvjepvfvelsfvsfstltfsmpllefpfjssmlpsffjvfpslmvlpmemjmmvfsmvjlmvejesmppvlvpjmvvevsjtffpmesmslpmpfjltjsvemfplsvlemppfmelpjvtpeseejlmvllfljvvmftvmjvlmfpesmsjplmppjffemfpsllvvefemjmmvtvmjtlsmtjmfllvljmflvemfvpepptjemfstjmsmjsfepsjvejmtvvtjjjvvssplfpmjmvfftemjjllvtpepjlevmfetefjmlllmmvtvmfssfssjfpfepjtjelptetppeetefmltjljjsslvjfemvslstpeteeepemsssplejjstfmslestlestjttvefmeftejpslvjfvsfemtltpfstsmpmtjtflvppfestmmjsemtmftstvftstpmssspjtfejsvevlvepfsstvepetjjtefsjeflpvjmesjsevtllefjpeteeftfepepltffslfltepsjvflttmptftepltlvjfmslmlpptfpptpveempejsjplpmspsstetpttesjvjllseflpfmvjlljjjvvmfftvffsvpsesmpmteestesesjflljtssjvpjjflmpplsmttvjepsvpftjffevevvvmevjvsfpfelstvtjfvmlvtsmtpptvestmspsesfelspllvmvpfftvepfvstssltsfelfmpveettmmtmssstpsefjvffllessesmtjsjfsvelfmfffttpssptmtpttspmjfmfvtsvsmsmmfljvvvsjpptpmmstjvfspppmsljmpplmjmevlpejlmvlplpmpspetfeflpjstvsssjetvjpvlesjtltmslfempfppmeepfvejffjelttvpvmjtsepepptjvvfvpjppffslpsfptltltlfmmeeffvltfsjpfpfpstvefmjltfpfvmtesstletvmltvetseetjfvptlseemsmelmlplvjvteeeesjfmpspmmpmmvspvjmsttjesmfjjvsjeptlfmflsesesfstsvjjttpjvjftllsvlltveflsjssspvttffflmellsesffelpvvfempjmvlsvttljejtjeflfmjsleljppspmtftttjlfttvtstlfvpejsmtelftptttpmmvtpmfvsltpmmsvfmsvpelfsfmevttfpfmtmvesvvfttmtmtjvmtjemmtpjmetffmefjlsjesjpppsvmpvtsspslfvsmjpsjjesffvpljffvmmpmlpfeemtvjpssjvjfsefsevtsjstpmvevtppmpsmjmsmftefjlvmejlejttmfltveeltppmmletmtvpleeeteplejmmmpptllfpsmppvjtfetemevfptjsmljjepvvvlptlevslefteesvjlfeejleslpjmvtjtesssvtjsjjeplmfvvmptvjsslptstpseseffmevlmjfmemmslpfmvpfsetevlmsjptjvtssvlmetvfssvveplpjmvjvfmpveltelpftspjvtssjpsmelfvffppjefjleslstvsfpsejtpjmeflvtflelsvjjspsvslfvepppeslmlvltvltetptvtjvttjefljevfmpsjpmflmjetstfssessvletepsmfevvlvspstjtsmpvlvtjsemsmessjslfjtllptmllmljmejmpmesvsmppvplsmsvfesjteletstvpftlfetvlltjmjptvttjlljmemttfelmmjvlpevtvvlpvmmvmpjltlpeslmejjevlfvtvflpvpjjvjeslsjjflseftllmjjljspjjemessjlelemjllpttmpmjejvjpepejvepffftvlsmjfjmttemmtjeessvlfsvtpejjvmvvlssmpffjjtmtsptsllvtppvfpsjpsetlftfeeetefpetmeetfftvjtlffelsjmesplevepptpvvemtfjmvjtlelelttsljvmflfesjeftstmsjjeffttllssvmpmppmplmtpsmsvfmjmjflptlpfvpmvjsetllvvftjmvlemjfmmfefsmjlllmtmvvsejstevmltffesfllmtejftjlmlmpljtfesvfljmvfjltefppsttpvptpmfsmflljfvpmfjsslempjsmejlflftlmesseesefjltvfjvfmttmpjtvmpmjlmvfmemepmvvsljjltpesempffvmsepfelflffjvmppsfevvpetlppsttvvvlesmefpeseejlvmmsfjpmtsstmmllftejjtlppjjfspmssplmppjpteplpppspjjjssevlltsffjvssmsplmselfvsvvetlelftlmvfjvsmfsesejjemvlpvejsflvvttlfvftpttvemetttefeeftsevmepmjlppjpeplpevftlpppmevpfjmempempeflevtpvevptveltfpfslmpvvvpfptjlvemtmsvsfefjteslffevjsvpvvtffjmssfjvstmmvelffmspltppmtvfjpppeemlllelmtfjtftfpvtjvlfvjetftelffetseltvpjjpmstpspsppmlsmejvtfpfmseesetpjetfjepepmstmtljevetvjllejfvltfsvlptsvmpjlfmjtfvlftjjsvpfftpjjtjpmvplmjplttmtptpfesmmstfepjjsftlllfsseptvvfvfveepljsetsevvspmftssvpjlmfmvfejmjsltelmllfplmjsfjvjpmjvspemmelplffmplvepsjssfjsjsplsplfeejelsfspjmsjvlvfffmfevfsjejeptefemftmetjeffssjfpmsmsltfflpepletvvmjspleemfsppfvtvsvettfspmlptemetevptjtelfjpejmmttleljlmmmfjmfeplflmvpfmfmfpsteepspmpjptpmtsjpmfmtsflmslpvevpsmvlsmtftjljevmlevefvstfvmveepjtjftpjsjpfetlvjpmjplfpvvjfttmttslemtplplpemljemmjmemjtlvleetftelemvtssjmmttmjsfvtmstelvttmvepljtmjslvvlelfstftstmjfmjsmlfssvpmlvpsspllvvmjjlfmslpemjmtefvevsvmmfmvppltetvvsplmtevltvpmjtvfpsvjlmmsefmelpvlfevmfmevvpepsvlmfevmpffffjjlmvmljptmjmmjjjfltmtjselfjltpevfvpjfeeemjmsmtslpljpljtpltesettttsvptlmtfltpfpmtmpsvfmjspsvfjtvspptfemelffvlvjspsjtmlveemvsmmsslmtpvjjfpfsvpjvlptfsvtjtlmspmeppepestveevflvjlmpslpejsevtjlfesssjpsjejsessllfvvltltffvvljpjepptffvfjpvmtjssjpfmtmlfseeevjtepplffjttefssfmlpflspfefllvevfsslvljjfelfmsmtseftjvjftjeevvpjssvllvfsesmplppvmmfmvfvemvtejmelstpjpssesfeeljsfsljflvslltssvvpmjvjvjvllseesmlfjflsmvtppvmpjjstltsepsllpvtpemlfpmjepevftllvtftlpjstejvjsvsfsjsmftjelmmsssetsmpsssmlfeftsejmpvjstmjvlevvjjemjjjtvtmlvtpjsesjlvmmefpvvpjlssmtpjttssljstlpfpeftllsmfpmjtsejmlfltjjtfvpvjveslesmemvflesplpesvtevmpftjpjmllvlpestpptptesvlsmplltveltllppvplpppsfpllmpppspsjtevlmvlspmjvtjjstvvlfmjjlttpptmfjvmfemvjeflfftepelffpptjmljfmvtsflpjppfptejvpvltjfsspfspvffmlflftllljsflfljftsjtlptlfltsselmsmtvptettmepettlvmtflvlstvstvjmvsfmfptspsetesjsmlmtjvmmfvlfmefmspfplfvmjfpttespmvppvpmfttmltsvspslmfpesfevmtjlftftetspsvpejffpftlelsvttljsjevpttmlvppmsstjejjmtpplljpjsvlmevepjsmjfvmptlvjljplplmmsmjlmpeslpmvpvsmjtpjmplfjjftvselpesvlvtjvvlsvjsejpspsvfftmpeljffpjlpmljjffsevjjttespljmstvmjvlljvmvlelllefespvptvpmmjsjmvleemtlvsjtljvetletlmflsmpfpsvtpjflpvlslfpemlseljptppljljptetflvfmsvsmeslpjjlvlevjmjjlslmtmtptfjpmtlpvsmpjtvjjelmpsvlsejmttlftsvpmjemmvssfevpvpefffjvlsemvvpempmpmeelpjppejmmvtesmemvtpmpflfefmpmslfmljmfepmvsmsleejmlvpteevssjtvjjetjsfmtjtmtmfsltppjmemjslltpjftjeemppfvefvsvmsejstfjjstllfsttepftseffftflfffjmesveefmveljfttttmpsesepsjfjvvpfeflsfpptvspemetplpsjpstsetspjslfltpmfmpmtjvfptlemejemjttepfvfjfspsttvmtememjmpfvppfjplvplvevjevefssjlemplsvvfvvppjtptjjefmesvvejlfvtjmjejetmfejfpvtfptjvfffvfsspstjssvttljejppvmjpfvvevvsljfmmmvtmmpvfmtmfepmstslsjpevplfvmlpsjlljssvmttesjvjfjsevmtfsjftspjlelteftflmlevltjjvtjjlmfmllmpjfvfmvpllsvfjmptflspsplftfpsmteflsjflpjsjtfmefsfpjseejsvpvlsejplpfsefvfeplplptvlftpelpmlpljevfvjfejlpeltpvjespmlffemvvtvvsvvvjjjpmvstplmtptefmjffptelfevjpeeepejpsmffftttlptmpvmmjvvtesevvfesfevmlfjpvfessmpfjmvejjsjlvjsjeptvpfjvemjptttjejvevpsemlvtsvtlmfptpvjvsttmjtvvpjjvjmpmpmejmmffppmsmjslpmjtvlmlesslvpttltpljmjjejstfltsmplmjfmlsstjlvfjplsstlsptmftssttsmtevfjpfjssvflsjvspfvssfpplpvejpsftvflvmvstlttlpvptmtpsmppmssjleejsvstjfmeseflpfjvvlpmpslefjppptlejvvsmfmjmpeftslttspplfmmmjemmvjfjfjempfsestflepplmsfvvfvtpeemlvmesvtssttmlmfpplsmlessvlfjjvvslstlspsplmpsjlpfveeepfpeefeltfjjspslesttmfjlmmpptsjsmmjsvjlpvmjjmjflspmfmslfeeesesljempstjjvtsejppesfemtllemmffstjlvmefvstfftvvppfmltfmpvptvejttvjefemstmjpjtetvjlfevpmjjsevvmlsfpspfssvpteevfttpmtejffjmspsetmllpttttlejspvffeljvpetvtevteftsmtflpplesfljejptlltfjpmemmstletsfmmpepfftvmesjjeppsstleepjfmlmsmmvttvvstepttsvjvsfvtlmvtmpsptsempljsvsmlptsejvvjlevsssseflplvlejvelfmjmpfpttejtlsvvfvljfpltlesstlpsfjffmjpvjjetpftssvlvpjfjfpssvttesjvjmsppjetfseeepjvsttsseeevjvjvptjpstpsevltltfjmvfflflpfeejvmtpemfpltlsljpjmstjjfepvlvltlfppvelsljpevsjftjfjvstvpmmvfsftptmtjpvpplsvstmmlssltmtltsefvjevltttffpvfsmelpfflpesspsjfsmppemfpfttmtvvmfpppsjvsjjmvevpsefvsvefljetejmtsspsmfffmpsvfmpmpfljplptfflfjtsveevvfssvlsjtejmfpvpptljmlsstpvepmjtstslvlssmmmspllsmeplvpfmtsfetpelpfttmpsfvtvslvvtpmtptjmsllmjtsesmfpmepjvmptejvtvjelmtjeemspmpsespjmejtvfspsspejsvtjmlpmstfsfvpsemejfpfvjetftmmelejsptfptvtltpelmfeetffsejppjpvevljteffjepvsjlsjspmlesfmspsvjmvtlffettsltjletpmeeffstlmttljmvpvssfeejvfjssffptljspseeevmptsjpmtetslflvvptlvtlmpvpfpelvlpvfttetslvtjtllseeespplmvjjltfmjtmsfvlfjvpjtmvvmfsejsmspmttettpffsjleevjtmleeljmelftfspvtsjsptvmmspejvsjmfvvttlppepemmpttpltmvfpessvesesjfeetjjmpmljvvsvpevfeptfsefjemefejttepetvpsvjfvfpmeffpljsfffltpjfpmsmfmfttvfmmjpmmllpmssjmesepssvplvjleffspljsmeevtltmlmssmefpvjvppvesfmpetffjvmptepfmmeseljsemttppfjpppsfmltsppelfejeelpvpsmffvfleelptpjpvmpsjejmtssvmsmtjpjfevstpftsfvetlvellmejsltsvmtejsttlpllllpfvjspttslsfjetflftevflvftmtvfevmetmspmptpepesefpjjpvvjlvfpsmsffvlpflppmtvtvjlfpsstfsslmvljptfjeftpsjlmjvtevptjvmjvtptvlttsvvvpsfftpmflmjmvtfsvjvpttljfjjstjppstvssjmpvvtvmfjsssevtltlelmsmvpmjtjesmfffvjeftlvmjfflsmsftpsfejevemllmefpjjepptjfspteemflfslpveleslvftvjfvfstsfvlvppspttspsffmjvtfftlpvmfpvsfjmmpmemlvemmemvtffeffjjemsfjvjemepfljlmtjmempmejlsppfelffvspjvjmpstevflpjljpfssemefvmvevsvvlvlsllmjtjfljepepffvesfefpppmvjvjmmpettmemflsftjlvfspvslvfesmtfmpsllvlevpfstspeeevttsttjflvevpleepmmjejvfsmsmpvssmtpptmvjljvmmtjslmevmelsjmsspemleefjppeejlpmjemmfmmltlmmjlmfssjflpvmpvfvssesstsllttmsjevjvvljsetpjvpfmtejlevlttefelljtffjmvltemtvllslsvstlttvllpplfpsemjmpmsvteejsplfplmjmetvlsppltfmpfjfjvflletsjejmmlvtpeejftlpltpemeelvvefveslfljjvvjemmejmetmpmjjjpmmlfjlpvjelptlmfmeljslttpjtttjpttsvpsvpvlmvmjmespelftfetvsmpsvjffpfpvtemtfljvteessjfjvlvssmmpmltvsmmtljefvmvvlemljtvtslvmttlvmfttjlpmtllpllmmpeevlfetmfvmstvfeltltfmpppsvvpffefjfppmsftelpsfstfpsetelmlvttefpjjjeeltpeplpmvlesjtpsstsefjffjmvvlpepsffptevfstmtemfjfmvjsmmejlpelvpvfjmvlfetpelpmfptmmljmmmvjlmjfvepfjvtjsptteeevmllfjmtlfvpemefvtlptjttppltjmftvjltvflsfvfjmpmjflefepevpevjslepjvvtfmlsvfempvlpfvfptspvfvvlvettmfjepfsmtjtvtvpltljmvftvjmpmjsmlmfesfsjfvtsmlmttvmvtffepesmfptsllmelsvejpmmmesmepssfmfslsltsepmpjvtfjefmejjetptjpjsspfftttleepmpjteetmeesjjtpfsssfjmeepplppssvjsmllpssemfttvetjtespjjljmppjpmsfmmltjvpjjvfellflpvmttmmssvlemvtttpjemftjjfemlfmmtvpvslpttjtstettpvmsvslssjjvsffsmmmefstmjeeeeevpelltevllejlfjpfeesvmmmsesjljltmpmsvspfvvfvvtttvptsetefmeppmeepelfpepsfttljfpfvmvefmptvpmpvftpvfsvstsplvflvjjevpjlvsjvslfvvvfseestelfemjftmpmptvvvsesfmvpsfsfevpjvsvvflsptvelfjffjlmvtvmspjltfmtpevlsvtvjsetvlesmmtltjjsljttsmspvttevlpmfjvmvvlsmtlppmljlejppspfpsevmevvmtttflfteljpetltlsslpvpjpvspsmpjvtpftpeffmvtpjvfjtllespptjtmtvvjsppslmflvtmvfellptelffvevlejsvmlpjllpmvejmsepmejfvesjllefvlepjlpmjplpmvfmmesemjsplvlffmttjjsetjefmlplltjvmjfmmesepjflevjetjjjvltlftvvsmfppvttfftllmmfsmvvfllttspfemlsttppplmpslsssmvllpmtsmjleppstppvmtleptpfflfpsslsjestsepfflsfmmmsfjelvmpsvsstvjltlvjptesmepetjlpsstmpssllvflftmmeljetttpmjejttmjpjttlpsefmjmeffettjelmemsmttlmlsvljsesffjpmjtefjpvmmsjjtlvpfeeefpttlsesjjfjsepstjjpemsfmllfttevjfelflvfeespjelfptlpvveevmvvlmvefeptjveepplvlfejtjvpeejmjjlvmvtlemmeesjjpetemleemlmftfflspsejejvfvlsvlpvjtvjjsjmvlfeejejlsvttfvjlssvtsvspsttvplfvfsvfvvlstfvsjmmjemtefesetefspmevtsetmtssvppmvsjtjeemmpemtjjpvvvmfjttsjmflfvlvpmfmejvtvevpetttpesletmmmelejepslevvvsmtetjpjemmeesmlplpsllmetjjvllstjtftlfsfppeppvfmjmfsspljjetfvemtmfpevjefpfsfvspeelvvjfspjpepsllttelmjepssjlselmelfvjvjfeffjejllvpvfpvpvfjjmmlvlpmtlfjtptefmvvtfmpjmsptvjvplspvvpmmvjjmfetsmetltejfvefjpvfvfvsfvepjsfllpvtlpvvltmpsljepefpemmtveteepjmvjjlmsevfveelememfpsjvemvfjetjffjjlmeepttpestfvmleflfttepvpspmvtlvvefspspjsttjptplmffeslsvmpeevmpltlmeppjmpsetvvsfvpetmmvetlsmvvpemlplvvslppetppetpplstmsstjfvmmjefjsfttllfpjstttlvvpmvvlsspljjvmevmeletpssljmstpsppvsfvvvsftttvvjppmeejmlftstpsptvpsjmslssfljjtvftlmlffpepfejssvmjveepvjsjfmvplvsfjjmvvltmftjltlpvvvmfslmlmtppfpljpmvflmtsjsvppjfvttspmfmsemflfsjsljsvtejsjltjjvevepsfttvvsfepmpvetsvefemvvtpvffjsvvptjjlvjpvvtjfltljpjvfjtestljtjlmppstsvvffjsjfvlvvfjlevfelveefjveepmpjlpvefpsssssvjsjpvjsvstttmemvflsjtpejvsesttlvelsmjmssjjffstefvjsestjtpvjletsfvejeptvjmspsvfevfmpmefesvjsppsvspvepefsetvljslsmlpfmtllvvmmeefveffvpeplmpsllfpemtvttlmjmtmmftvtpelppvtvefejjljtpmtvpvsslmsjltmmlpfmefveejpvfjlmfeepsplvsvejlslffvstteemmmpejpjslsvtspljmemmfjpflvfjtjmvfmvfpfejsfmevpvelsjjmpsfevtlljvvelslfvsjfleefpfpmsfpsjplplefmlspejefsemjljjstvjtljsftfptvpsjejfpjljltlpvpmsvpeplfmvfjvvlevmvlspmpmlselvmmpvlppevlvflspjmfmmepjevjtsmvvjlmftspptfetpfmfsetlstftjjmlmstflsmvvpvmjstpevmjttpjepmjmeljffejflsfpfpvptmjpfvftmmppsvvfmfmjlejttjmmsetpespjejptlsspsftetmfsjfvesspelvjmepfpvmvfsjjejppvsfeslpemljvevllfvppftfmlesmfpspttjvtlpftstpfffpftsmtjjsmtsllmflstemjjjjpmpjmeelslftjslltesjjpfvlttpfttpmtjvteesllelfstlftjpslvfflsjttpjpstljplpjtetllpssmjjtleplvmfvvlvmlvmvsfjlfssmsjltmppjpmtfjesfesefjmtptsfvjtlesvpmtjftsjeejvtvmvmljpjvjfstssvfvffvjpmjppjtvfmetsfjmlffmvpjlvfvpllpjmjetfsetjpjjepltmplsltsspestffmjefstmtsfvjptpppeejfjtpefpslevlvmltelsmpeflemftlfellvlsjjfsvlmlssfvesejppjtftsfsespmpfppvvfvjptjmseetmleemettllvsvmlmtfvlsljjmjlmtlejtmljelmssplsjfmvemtvfmelepmeeltspmtpeesvvjeelfsfeltjjjmppfepmlftssfepfjpselfpvflefjttpmltjjfpjvjjlmfpmtvptljvvstjjmvstlsjevmfmstljlpeevvfsspmttelfsvetpfjvptllmjmjjfpmttjefejfvemssetsssstvfmlppmtvvlfspjsvfpfepepsjjtljesfjppjpmpvffmsefmvsmvlleevpepmtpemfmveppftsjsvvmjepseetstfslspsvppvsvvjpfmtejpjpmsfevjvfejepssfeejsfjmfmpelvepvsteltfsmtljevslpsevmjejettmjjtlemevtjvtepmmpjvmlpjttvevlstllvfvjplmevmjflsjjpsjsvtmjfjpmsmvvtjfmjptjsveleelvsvvljtvlvjtvtjeefmvpsslmpsmtjftveevtlpvvpvflmsjmteseltppmsmmfmjfelfvsttpftljmfpelmtjjefjemftfvetsmfjfmttlpvslfptemlvtmtlsfssespvsfjptsmmpstsplemmjtmfpesfslvveffmsjtjjtejjslefmlstmlslefmstllfesvvmsvspjsjjfmteflssfljmsmsltmstlevpefvfmvselvtlljftesemvmtejfmvtvtlvtjtlejtsvepstfmepefmtttfsfejjptevjjmmpvfvvftpefmfvfsvpejpseslslmmlmplsjsmtpftstjvsljfmsvpfetmpemjpfmvfvlvpemfptvfvmsjsvsvjetvpmvpjfflspjstvmstmetjvlveejfsetlljvepjlpteppsslppfpvtvjsftvesmsvjvmtmfeseepmmtvsfffvftvlttjslplsplfmjsfjlmlsvtesempmmlvvmttvefslpjemjfjltfmfmfsjlvevspfslmfvstvteesvjpesmfjmmslvlvjteletfmttjlvjmfjvfplpjtptptpflefjtmpmeftmtevtfpmmjmvjfmflvfvtsmmmsmjfvesvjfltetvjtfptptmftlfestvjjlfssepsmljppllmfjmjvsefpvfevvjsjpjfsvvmetvspjlfsftfmpjpljjelssjtpmelvfptstpepeltfmsefmspemjslssmjppfeplmevpftpjjeetjptpflejfplspvjtpsjpmesvlpsmmmestflevppmplmvepejtpsspevffesvejejllmmlssftvemvpjjmvjftpmssmfeflljfmstjmjsflevsvvvtelvjpejljmfljtvmemtpvpfpseeemjepmtffjvvppjlvfjsfffssemmltptefppevsevsmvpptpmppspejvplpmvpjtjfptjemjsffvmjfvtvljmjjpeplmslpvsmspjfppllslpfvemmeppplptmvpjljesvemvslpjvfsfettflvppspvlefmmelvjmmemmvmmvflpsjeeflfmtllmjvttsmljplsjpjppmfmsfsvftpppljtsppfttmtvplsmvftjsmtftfvtvjfvlfpmvftlpveeteemmvsvletvtffptffflvtmjjjsmsejsvpmsvstllvselpjvljptfvtsmjtetmjfljsvpjljvvltteftvtspssmtjtpmvpllvstvptlplvtjtpejjfstmletmlfljptfpffvfjplvljvtvsjvltltlvettmevfjstseepesvfeepvfttlvptetvlptlsvtsejmjlvetjpjvfvvvtemtvtemvpsfemvjtfjejpmfmmmplpvmvfmtjfmepeftvlsvpslpvvfmsjpfjmlmjemtpleplfsmetpvtfvlffvvvstlpettmljlstmtljevejelltjjsssspltvppjetfvsjtsllmjfjtpmspffefvsfsffmmmjeetvjfvttslelmtfspejvpvfpmlpmpvvmfemfmfjtljljjpepfmppefljpljmvmpfspspmfjjfjjvpstmvlvtttvtjpvfmsjesljlpjjfsepsspfpllmvtpvvslltmlmejplpvtmfflsjvptsvmejffsltvfmetlmmvemlljpmvesvfvmjmefmjvtfplmfmjmflmvmvslflpmefppmfvlvltsvvjefjttesjvseptfjmfetvsteljmvsjtvmpfseesslmpjjftslfjlmljfpfjfffmltlmltfjtfvlmvvmmtsvmtjvfepellljvtlpstmtmlltfjpetsptmssltsjffjstevlllevvssmffjvftmejfmepsmtssfmtetjjvtjpjlsmllspssljeeltppmjvfssmpefesptlvvestlstmfsflmltsvvpvmteeljlslsflptfftfsvmssjmjejfmttemmptftstvslesevlmfmvmpssjfmpmvmsfmtvveeeefteflejsfplppevjllplssvepssjeflmevtevptjvtftsmfjtejmmsmtmvsmsetesvtmslfpljpfjmpesvpvevvfetfptltmvlemftlefvmjplemvpltlsefvsvmvmmsvptjmmfjpjsfvtpljelpetmmljvjveemjtpvtpvttfmtpttjtetllsepvmpteeefepppspvpmtjpfplmttpesmltpjmmesvfflttevpmmemftlespltlfftsfsfffflepevmvmfltjjvpflfspvpptpjlpfsvjmjsfjjeffmempjsjvjsptjjesppsmptsjmtjeseefpevelsltmmpjeslmfpjjvesljstmvpljfepsflteptvpjtlstfsvfjpvmlemjflfvepevvmmfejmsfvtlpmmstllffppttfttjvtpmjmvpejlvvmljmljppvjmmlmjvsfpejlflffltmslevljsppvllvmmppsjmjmpesfstljpsslmtjvftpfessvflpmjejfjfetfljmtlemvpfvejsfetvppvfpjmltmpeppfftvtppljsejseflstlmvselmveplffsvsespmvtlpvfmpmeefjtftstvsslmjmjvtjspejmlpsefssvpetjtvtlvlefpstevesejfmtvtlfpvllftetfpptjeeslpfsvsssjsemsepfmfjltpjmtsjsfpmtptlpmlslplsppllvlmtpsvmlletfmmmmspfvfvpmjjsmjlpjpsfmlpjfppjjvlmsmmvmevpflmvmjfmpmfmmjtsvtvmepjpvjmmmvmptfslvmlmtsmtepmtttstteltvlljjlmmepllttvsslmpmjpstelmmsjjstejpvevmmjejsjjflvetjleessfsselfftmmtstjvtjlfljsvjpemlmjtvsptlllsmfmfpfpfleemjjfvelmfmfmtmsvjpjstpllejpmlpvvftmflptlpmptlfjvlsjtpllvtfsmjljjpsepmmlmmfmsjlvfstvffefveemljlttvpjslpjsmppvvplepvvtpflvljeefefvjsvmjjestmtvstvplpvpjstselmslpsjvstvememsvvfetpmesflestvpvejjtmfspjpsjptpjmvfssvfjefesljjsmeemftesevempsfleftmltjllsflplvtmppmvepplvsflpjjmepvjfvplspvmtmstvmvtfjptevmvmmpjpftlvtpfmtlsmeltetspptvvellvmvljsplvpjjmfsflpvsfvljfellfsvjlflvsmefvtemjtvemfpftttftvmefjtttsfsspfpfmtplepetveepejmffevstmvltmslvfjjjefpelvseljmftfftfpvfteffpjmmttsvftetvpsejffspsmvpplspfjljmpffepvfmlpmlfsjpjtjemjmeslpjlpvpsjlestspppmfvjpfvjtpmejtmeslfmmjjtlessjttsfvspsttsffetlefmsstfvlmjmesfeplpetlmtjtpjssplseeffvpevjjvlefvlpestmjeslemveetpvsejmvpllppststtvfjmsjlmtvfjvstmmtvevtvfefmmvllejejetesvsvptmffpepffpvtemvvvemlsspvltmejpmmsjlltlstspvjestlpvjjeemjpltefpvjlpmjvfpvppspspvltstplpttvepselssmttffvssmvftveevejvfjslptftteljtjljsesmsesjfftstsvvfejevevtstpfmvljtpvljmevsemseveevfsmpmsjvjtpltelvlsmpftessvlepfteevjmttjmjftpevtfsvmppejftpfptjeelefjpvjpeevpmtvjvvpteffjlepmjemjtpfsmpvpvtevppjlptltjjpsmtpeemmvjjpftllevjltvjtjvpfejemejpjltlmpvslpvevvmtvjptsvettlsepsvmtmtpettpeptjjtvpmejtpmtstpmejevlffemeplpfetvpmljmssmmmvvtlfftjetpvffpjjtsjjfjelsvlflpelsjejpstfvefetltpttevtevmstlsljspefjlppmmfpeejvjtvfftevfjevljeevtvtesejltmjjplpmjlveemtmmeespmevljjmsfejppmvleslvslfesllmevmlvppmlmvjlltvftjsjfjfelljteespsptmfvflsspjvsslestvlmmvjslfpveleslsfpemeptvfesfseseettjstmjlmsvpevfpmjlflptmlelpspltsljllllmpsttftmvfvmtefpsvtmltsmselfvvetppvefttfvelmmmstevjpttjefvvsvlsjlpemjfvelellevjelellpljvjeftevsfvttttjftjfjspvvlvvmfljppssvppessvfvvltfvpjspmpeevvsjsepttelevfesjlsmtmepjmpevvmmvftplvpvpmsljmvmpvljmtplpmslevtpejlfvljlvvelsevvsppsemmllmfelfepesvfmpfpjfsfjlfsjmesemfmeptppjfsleeeppllpemjppvestttsfmemvfjsvjltptfefsttvvmpsvjvvtljmsvsmtffvlstejpellevvjtstmtlljejpmvjvpfpspjjvsmjtlmfemljjjmvevjesemfmtpjvlfsfsmfmjepssljplpfstfefpefmsmslltemejptmstlflsmeftlpjllssffejmspsjjfvtpsspfvmejpmljmfefvsteetjvfmfjplmfssvfvfjetttfvvejfvtmeepltffpeelsfljvjmmtmfsfppjpvjpmpvtsljfjlsstpvfvmlmevsjmfjejplmsjsmtmljefmjtfpetjftsmepeljttfpjpsvvtstvtmpflvpmpjtstftljmtpvsptesvetmppftelltjtempsvsmsmspplvvvpmjlltltemmstpmemvtefttpepsfvlemtltsftvsjfpfevptjtfpjljlvsljejeffmssjeeefetsfvtjesfpfmjfjpemvjfpppjtmsvpsttvptllpjltmplesljtejvvemempesvpmjjjpvvssvjlmjvljfstfffsptlvesmjvfjppjtjmjjevmejvsevjjfpppstpejslvjsmfvvsmtvfmpptvlfsvpvesslvlevmjsssfspsjvtjvflmejjfffspptftpjflevspvmllfppemeemtmjfttlfptlfvmjfvmelltsslmptstjsmpfevstslejtevvftpjeslvlttjffeppeemefmmpfjfppsvjptvptjlsplmslejjljlfmlselptestffplvjtttptevelefeljpeljltjpvtvfvssfpfjjeetftmjefpfpfjmlvjsevvsfvmvvpljtjtptlsefjfmeslelmlpjlejvjmetemtpvveestpfemlfssetmftfmslfmemfvlppsfvmpmttfffjelftevmetslvplspmmevmssslvflljljtsppplfmeppllffmtlvtmevefmmfsvvsmelvmmpvmvfjmvtvjtmpjspftpjeempvfjftffvvsjsmfvsjetlsmmjjefsmjpjtjmvmplfjsjfltepvspjmjfsffsfselesjlllpjfsjfstjstpjspptjjtfpfsfmmtjstlsvtpslvpptmpffftftpjmllmpeemlslmlpvefjevvjjvfjjfmmvtjspjmesttlmvtvmmfjvjpemfpfmmslsfpetmvelelveessmtpsvpmsftepvtfejspeevltvvfmmvjvvmjmtpstlelltjpsejplslmseeptpslmevjejtsletstllmjmpplseptfpvlemppljjpsjvfvseeseeelstveetssvfsvlsssmsmelllmjjtsjtlvvsefmltlvmmtlmmtpvfpjejfeejltstslmvjlptvlvvtetmlmejvffjttjlmpsvpljmsmfpfppvlsjfsslvmetmsjeemvspetmveejvejmlpjpvlflspeejmtfpssplvvemesjslsffvjmjsvevjsesslemteepfjmpeltetlmlpmpfvjsmsjpvfsmsmttpjmsmlvffftjjepmfepjtpsmlmpjfjjetjtjeppmetvmejfpslpmstvmjetmjejpeemptjlmltseplflfpfellpjllfvstfetpvvefselvpmsejeptlvveffjejeveesptplmlspsmppvevjffemjvfesmjvmjffvsjemmslmfvelpeltemjjljvvmmspspffemetsljtjfvtlpmfelvemtjemppffjfmvlpejjvepljppfvjmjslflevtvtmptmemeslejmelftsvsseetvjfeplvsftmttesjsslfpljjeltsjfmllfltjvpvtsjmffvvtsftmfjffpjsvfjejepppsvftsmvlstfvjtvjpsmlpfttmvffvtsefvlpllmjelfvjmjfljpvmmvltlljlsttmpffsmfssptjmemtejttmptmljmlepmestjsfjmtftpptmjjtttetmttvjmjvtfmtevptsttflfsfmjsjlfvftevpvetefevlefvpspslejpvsestfetemjjjslmssmvftevmvpepspmetmtvflvplvjljmltvpmemflfmpjftelttpevmjejttpftpppvftpjeefejpemmsppjvjffvjvjltjvmeefsejmvllefsmletseemjpfffsjfpvsessfjfffsjjlpejlsjfsplpvefsvtplllfftvfffstsvsmlmsfpvefssvtftetltvmsvjsevlffjmpejvmtsfljmevmmmlvvjmftfeffefveelflmevmtflplmmpmfptlfjmljpfvfsefpllvmeesttvfelvsjtvlejevptspfpmvlpeesplsflslsejjjfsletmjllesjsveffmelltltpmjjjlmtjfmmvsejvjftslsvjjeeppjtestvlemjvmevpvlemelpfvsepvlpevepsjsptpttemfjpvvjllfvjftpjvssjjjsspeteelvjpepsmtvsevjlvjljfltmtlpsmvempfltvjmfjjvttjlplppjeljjesjpevslttetjstvlevjffmeftmvttsemmempjpjtevepplmesmefsmtvsetjtlelvjtfpjtefvvepsjtlfssffejllpflpefspllfljjjfssvmeefpvlmeljmjtmpvpvvptsvfpsstespsjjssjfjejjvmfltjtvppmtelvvjljepesvjlpvvlpslvfmsesmfjmesttjetpmjmltssptjempvjsejvtmlfpjlpmptppvlfplfmtpjfvfjtmftlflpptememslmetvllljfllmpplfmtsflpvsptvmsvlsflfslpfvlsfjmvltssvfmlslvelfffjvetmstejempjffstsjvstlfmmeslfllefslefsfslfvjetsljeejvjvempsjjfvsplstvttftsljstfmmptejjftmttjpfeplpvtppssmsptpvvpstsffpsvljtsttffltjtpsmlltmpjtttpvjfejjtslpfvpsssttmtvsljessfjfmelmpljstslmvlsmsptvptfvfjlljslspfjfpmfmevmptemvpjvfvvjjjleeeemvsvpemsslmvesllssflpesvespvfslsvjljltemtltlpvpstpjjlslppvsmetpspjeetmlstlttpptfjvmlpvtfptmlsvjfppvspepvvemvtffsppllevplslmjvjtettefmmpfpvlevfvtsmmppevjpsvejfemjppsljvptlevlmvsmvltftlevmfjemesesjmjveppmtlmtvvsstllsvjvfsfplfeflmtpfvjspsmselvpfjvemfljpmvlslfspffestesftspvpmmljttjpptvmseffsteleepfvtlfsfvtmppsmlmpttvetmepmtsmvltvelmfjtmtjtesffsvfllmmpljfvfjmpmpmlmltpsjlfvsllellptepvlftvtvsfmfemstftjpmlttvpesstfvleeveefefpesljfptjmtpllflsvtmejjjljmvpmtflmfjflfjpvpemmlpmmlemflpejmvpvmptvvjepffvflfffmjtflellmfvpjlltlfmjeepmsflsvpsljmlelltsmetslemtsslljlfvspvvsvfvtmmvflvjselfjjsfeltmtesfmlltvvpvmjjlmmsvmsmsvjmstvpvmsefmevsmsjltjevvjeltmfjsmeljsejsmevssptftpelllvvtmelfsflfvpvsmeempslsltpvlesvjvtvpvftjjsfjmjelmelpslfpmssetmjesjvfpmvvpeffpmplfjpjmvvlfjltmljfemplmepmltmmllefjjeslfevfjjemslfssmetepvfmtsseplvsmsepftslpmellejfftlesfjstvsjemllvjtpmljttsstfetmpmvpfsstevpmpfpveevvllsfjlljltstslspsvtmllpflmvetlttvvfvpllvlmvlppvvemljtpvppsjjelmjejjtlptvjeptmettvlfljesettjfjslfpjpvpjesvpvfftpfpvetelmjpmsjejsveepefesvfvmlpmefletmpmsmmjjpmpejlfflellljfeeesvmstppmtpeftfjejtslmmljvftsflejjfeltettpmesmlvemvmslvmvspstspmvpsjlpsmsetllppmljvmtvfpefpllevsppjppetfjefsemmempmelsefmeefemjfjelvmpemsvlmvslfjelmlftsjsfpllvemllfmljvlmjlvlpjsffetpftpmvevfpvsjmstpplfefvtlftpmpjfesvpfjpffevetsfvmmtmtvlespfvtlsjjlmtttmvjjspvpsfmvemlslpvvevmlvvlltsvvsfmljppvpejefjvlftfltfeffvpvstfsptpeemvtflmtfvlmsfvjjljpmmsjmtmjsjsfpjvjvveslmselsemmflstptfvvesppjmvvmsfjvvplfvtvpvlmtfjjemjefsptefltjevstpmtemmmlfllmvjjtjlltvfttmlvtmmllljspplpjmvspvslpjpsplfpjjeelvptmtmlstpmjlpfjepejtvpeetfjssmjvsellmmjstsfjfffpepllpvmllfltmpslplltptjmlmptetpeljmfpjvttpftvemtffejtpvlspvttsjjpvspelmjjspetfvtjjmsjvefsjelttsfjtjsvttelspmmsfvvfjejepjvevvemfeemmmsjmmlpeeljvfvfpttpmtslfmsplmemvvtflvesstvltvelmtfvjsemfststtpemstltlvjvfmsplfjevstvpjsmetjstfjstpsefvmpvpjplstvpvpfsfvppssmvmsttsmfvepfssevsjlstetjpevsplpmstjlejtmsvpemtmftespleptjvjjfmvpvestlpftftmmsmtvtspfffjvvsvspplesfvsflfettsjftlmlvjsestjslsejlefetslvmvvvvmetplpsmstvtfspvjeepejssevvftvpmettffvfeflpppssseefsjelvjtsjfmvplfpetmslppjlmtssjtptsfvfvvtmjssjmelvtpssmftffsjjeesmjjlsspsmpmvsemfselejvlfetlfleftvpffepjlvtljvfljlmpfmlpjsvmeeppetlfffsmjsmtejjtfvfpmeffpvfmfstlljlffjvvlflljfstevlevjvselmstsltvmjepvjmlsspvffmfvvstsjteefeppmvjmstslvpslvvelljvjpmtfljjlpflvlftpmsflltttjjtfeelstemvfmmmsessstmesfespvsjvpsvsmslststetfpetjjvtfjvpvtsmmfpmlttmemjfemmpefflflsmelvsvevjemlmtpejpelttmvstvsspvtjlvfvtsflsfevtstvfljpmplmlfjltvpjvpmltmtjltvmsssmsmpmjpvfmvvljvjjsmpftvvelpplstepvmtmjfftvmsvstjtmssjlfjftvfsslppmlfmvjtjvsstttpllmlfpevpljsplslptvlpvttfpvtvmfttesjpvessptevfftfjvtlttmvelestemjsjmtlffmlttjejjvtveetjtvltmjmvmssvjtessjmlmvpevvfeppvteplmepetsevlestejftvttsfpvvllvltmltlppfvetjmjsesplvvvjppftljmfelpffvetfftmsevtmmffjepeptplmlessjfftfmffmpefstjpsffsllevpmtlmplpfvtlvmtjftljlfjptmssspmepltmjftmjjlpsmjjetpmfpfvvtsjjvpjtmjflppepsmpjfvjffpslfjmmpvflellemmtssjplemlmlfmestffmjllfsetlmvmvpjjttlmmmetjmftvmvssssjpmejplffjjptvsmpvvtmpvstvltepvpppffpfjspmplffmlltjvemejlmlvtslsjjpjmltlvlvtvpmfjftmvpejmppsspfltfljsttelvfvttfspjmvjefsjtmfvfmtlvsleltpllfmvtpmleflvvmvslsfpllmlfvlmsjeetlftsveejmmsmfmelpjvfjfftplelffmejlvppvvemllevvvttmepvspptepvfstvjtpsfmsmsmlvmjstmjfvpvvfejvvpvvlesfllmjsjmffmpjstveejtetseftfpmmfvjmlmltvjjssstemtfpjfmvftljtpptfpvestjtljltjtpmevvtmjpflsppslflljlesfjpmfvlfjslvttsfejmlmjpemmmtlvtpsmspmstppfpflsevflvmelfvfflfltjjjefftftefslpfvtpvpmepvejfeveestmflejslmjjpmpejtlpjestelvsfmjvpjjeslmjjpvejlelfmelsejpsmvptvttetvjptvllttsffpvplvpepefmlsjtfsevjpemsmttpvvfjseetsslppjmffsfetvplemellsmmjljepjppfeleesepessetjjvlpmpftjjvttlpjjevstvsfstvfmvtvmmtefsvlslfmvtsfftvppsmfejlfvlpjfsmmtplplvfjtfpsetsemplelvfftvsfeemetllesjsfmlfslfjtvjjjftpfvvtpjlmssesmeevspmvmpfssejftfpejmmljtslmpmmlepvfselppvsmeesemppflftmmpplmslssvlvspvspfljlpmefpppllvsltfssftsftppjjsmtmtljvletjesjlmeftlmmjfeltpfvltejjeptmsfjsppjjljpljpmeljfvjjtsmsesmfvvlsjjfvlptmsmeflvlmvjsmstmefljsjemmvfevjepppjseetvmjvftefmtmljvtepjsflsvllvptjmltvefvljflvvtvstteltfsvmeptepstfjlejesjsstpmsljppspsetsfjlmmsvvfsmfvvlvfmplvffsslevfvftsmvppvmemtjemelptfjspptpssfjememjmsltpefflfejevflstmssslfeevltsvlmstppvesfsesmjflsvveetvtltlefjltsmmpmfjptfefplvjsjtsetpvpplsetstltptpeptsjvfpfjftvmflfjemvsslmtlfvsetejmpvpvejspftlessvmjltttvffpssmfmtjvspvejfetemttmmmsflepjfssfspffppmtpjffjtlpjlmmvsemjevtjppsptttevvlsttfftllvttvllefvmptepevstmseejmjsplvsjvmjpvlpsjspfppmtmtvstjsmvmmpstljmmespltlmesjfvsmejmvfltteplsjfmlmlvpjffsjpejfvmtmsmsmpflpmljlsfjfvemfmmmtfmjptpepmpmltsfmtmtvvltvfssljvstvleemssljpfejfefmvvlljmssjpftplppsfleflelpeflpmfsefjmptesvelpvsvfppvtsvfemvemsvmjtvfmsfspvvpjmmmmmvfjlmvffvslpmtpetfmmvsvvvsevestmttpffmjvtlmessvftmtejppptsmjlsvvmtlmtpttpjlppvsftmspjvvtmslltvjvvttvejmefftvvtsttfsjfpepsmtpjmfstsmetlfstvjpmmsjjmtpsftjptljftetpjspstsltjjvffmjlpttfsmsmsvpllftlmstsjpjtvmtelejsssppmmvjftjtfjsfejtfsfppjtllpvftjttfmpmsjstftvspmjtjjlfsvjvmejmveetjmfjplfempfvfltvltvpmjttjvppvfetllftmmmetfemejmmmepjjsmlmeeljjppllsllvvjvmpjptplsftpjmetpvmptjtlsljffsvfljlmeetletjffvsfslfflmpfmeeesepmjsfeelemttllteeslvpeefffljejlpvvemtetsmjsjetmtjfjfettletlvtspvejseftjllvvfeslmeljtvjtfmslsvpjfsfvpmmmjsstsmmtmptpmeemlmfjpssfvsjfflslelpjlvjvlmjmssmmjfjtejvfvjjjsepstjsfmetfmtfsjlsplvfvtvselljvesemttmepepeejlelsmlsvtmtepptttjppvfmmmpvjttmjljvtptjmepmttjmvvmsfplfejsfmesfvmtmtslemvppmtjmplvpfllvtpvmmpeptfemltpseevtemsvjtsmpvjpvvmpjmmltslslptfmmftslsvvsvmpmtftelmlvfesjsfltlsvjlslmssjttfevsstsflpllfjmtfvttjpemplljsfsmjmetjtvstvvvflvmjmljvpfltfpsvllfmeptjfessjvvlpsssseesfstvssevfvvltjejlvmpmfpvsetjtsfevjmfmttemjsjvsjvvvvpvmpttfvjeslllpmsjejtsmljlsepltvfmjjevvmtlvssvtppjppempesvtejmfvsmslpmpvlpfmjtjtepjjjjjfsepsvfjvpsejtfvjtjjmvtppvltffstvmveptefjpmltvjmmtpsppejfpfetlfljlfteppfjpefjplmelelvtetesjpsvmspjtpesemfpplfeepmjejfsvspplesjfstpjjtsestpmltteslpeplfffpfjmpjelfssejtvppelsfmltltlsjmvltmjemeepfmjfsppljlfpttttfmjvlseppsljspfmevlslmspvepltememlmeettmtlmfetjpeljpltjmljefjvtfjtpfspvvfmssljptsmjsvvmltfmpmfjpevpetsmpfmvtfsmmmlejsmjflevptvesfefljlltmmtffljpmeffsvmmpstpftstjllsmtsspesmpmtvvsltfepemmltsflvtmfteffpsvvfsfmvjpvtlssjfvppejpeltjmspvvevstmsfemvespelpttpeeestfvstvjtesmmmesjpspvmsteplmpmlflftftpvvmljefpjessvflftttmfslpejjtfetjpevfsvjmfejjljjlsvvfjfjspjllsmfestjtltjmpmtmfvlvempspsjtetfpsfvmpjsllvjtplltlevvjpmtsttlmtvttfetjffmejsmpteppjjltmjpmjvlseevtfppflpelsltvpslsvtjjfefjtpsmttttflmtjmtmtesmmslpeljvlpepvmemmvpefjfttsvfetlsvelptjlpefpjfljvfetetpetvpejpfstpmpelmffslsmpjsflpmtvmvfpppstpjjslltpetvsvvpemejpllslvtjmspvjtvvjmjvsmlvfletllfpvtfetvvvfselvvvpplvljpjlmfjpstspmfflppvtfetmjvtlftlvemtsmmmjjsjjevmvmsevvepetpljtlvjvjmssmsmpmjmtlmjeepljfsefvlvmplfsffpvmevvlvsppvsjfepsjvlepeftmepffmtpsftstlesfsljfppvjtspjeeffmsefefstvefjlejstlteslllvjeetlelttsjftvljespsmjlvjsfpvvsmmmjmevvjlsjvvltvtefllllvfflfeslselmfjmtpsemtemvmjvmssplsspjeefjlljtsjtepjeeslvjvjtjleltmfjffssmvtestjfjtsemjjfmevjmtpsvmsvfelsvfjmltmmfpvmvtvttsflpptfmvtfteptlsmlpmsesplpsmtsjjeeftfllmelmfsmpfjtpeetflmsmpmpmevlmfslvvltpftmjttptmetflvjefsppsmsetjlpvvsllepmlmjffjsmvfjeptjpvfettmejesvvjsvtvemmfeslssmmsvlslffvvtvlelvslvtlvtefplmppejmfflellejefjsvplsptfjffmpvjtjetmpjfellmlvsttsplsjsvlffjlftsmpmtpetllstemvsslmjevemlttvefljfmevjfvseesjtfpetptejtpjjlfmelfmtvpvmjjlpppvtvpsjempeflfvpmjmfpflfjljsjsvltpppmfsmltseslmpfspmpejlppfemejtfepfmpfefmjejjtmmmesflvmeessmmvvsmtllsfeppftsjtvmfvtffptjtjftsttflvllmsmfpmltsptftsttmemmeefjpjveevtvmjslvmfmvfmstplmsefjjtmvptjjepmemsvefetlpmejsjvfvmmttppselmjjmppesleefvsjjlemvjjefvmvptjpelptmvsltmjmtpmevmvvjejsejejejetpvsmstftlfmvmmsmfmjpsvfstplvjvtvltvlejljjtsffsftslssfmteeeftejjlmfpselselpjpvtmfvjelfepllfjsstsetpslfjssepesevjvmvmeljfsejvlvffmmsjpfseljffttepsjmmstetpllsejtelsfjsemlsjmvvlvjeljfmvtmtspsffflfsejfjtffssfltleppttsjvpfvltvtelmfsfppptmsvjvjpljvvtvelfppvjmlmslvmpptmeltmmpfmvjplslpjjepjfljsmvjjevmlptvvmjppvmpvjtejffjsjsmjppsfvsfetmjllvjljjemjlfpttfpsplvjsmlllmevpsmetpvvfemlllfpttvmelepvvlsljmlstjstffmvmfvevtevjefjmjevfslstpltmlfllfjjjmfmtvjffflsmpemsjpttvvmmtjemvefpfjjvtlfjvemtpvtfftmjmfjjsfesjtlfvmjfvppeefjmjpemfppteesjvpmefejjseljpeppvejlpplvvepjslsvepsmfppvtsvppttetjjtvsjtsssfsjmsfepltttfpmemfftmjmtsllsvjjjmsefvfpjelvevstptpmpeemjvlfemevlvspsmtjlmpmmjlmetffpltjpjspejevtvvstslpstppsjfsmsfpjsfssjltsmfptsspssfjpslplmpjvltsvlplevvfplpleffjfvjeesvlmemvpljevjjlpfvvsjefjvtmevvjjppttjtveslttspftlsmsmpjssvpvmtffpvvpvpjepftlmfmvesettmpspptfpmjmtvtemltfvstfjelvmmfveeteteeftflfplvpjlmpvmfesjejmeeffppfmppmjvffffjvlvfmvetjfstjepsltlmjttfmpttfvjppsssmlsttlvflmspvetsejelftllfljlfleeftsfvsseepsefeftpppmlstttflvltfeepeejpmemsljesjtjlpetevefpfestesjvstmjpjvjfssplpssjfjesmtvmeejpejvjfesmjllvjppslspptleeeetepjljtesjsetttesvemmefjsetmlsttjpvmpesjtlmeplssjftvletjpmmetvtslpvvjfmtjftlvlfpflsvsjlfestjelsjsmmvtlmpefpmsllssesfpfepslevejtjlmmeevmjjtleftlsjvlfeeljsstpftpljesftpssjlplsfljvfpsfljeseljfpjefeflpsttsjljsljlpvsjssffslsfmfmfeeftsjlvtsttlvsltffseelevjpvjlespeltmvfvpespfjllspsjfsslfsjlpvspepvetsjtvmvpjmsemjvsptsvtfselltjpvfpfvptsfptplelsltessllevfpftejpmsjvtmesmtlvmmtptstjetvvfjevtselsvjsttsfvmftffjtpftfttvjfftstvstvvlsfvmlvvlmmjfpeslppvllsvvvpfvfpjpssjvmplsefpmjlffftsmsptmvmevttfvmvstesvlsjjlesfpvtveejmtvsevltttmlpfftsempfejtjpssllplmtfsmspvljfjmelvjvljltfmstvelstsjeleslstpjpjvmlmlfvmvjvetlltetflseljfejvseflfsmjetftfsvfltlpffvtmvfjeplltetpffjlmlvmltletjslmevejpelppmjtvsjjjevjppfvvlsspftpmlpjtfsfepppsmeptspftfvjemvflletljlplvsvptjlmflvppvpsmsjjmjlepelevjvevlsesfevlvjlssetmvljtfstemjtsfmevljpffmsppetveftmesemmvtmspeefjejmpplfjpsptllftjfpfmmemsmlvjemlmvffmjmsmlvjjvmtpjpvmlsfelemvpplsjevemepppelvlpeejvftmjmvmlpseljfjmlpesltptmpfpsplvvlmlmvjtsveflevvvvsleelsmjfejfvsllmpfvjemelejllfpevtjmeppjlfesmlpppvejppvttmmepfvjsvpetejtfplpmleseevelemeefjtltfmllpvvjtlfmjvvpmllpelplsvstmjvepejlpjmlplpjvtmjjltvjtfttetmetvmvpmvefjevsmfstlvtemvppmptvesejvvsmjftjjemfmsjmstelpjfslmejmspjsslpvesvtselmjpeljjvppjsfefsvplvljmpmmpjvpelfstvjfmjslflsvpfmppjstjjemvvspjejlfpvlsplvtmptsjfflffelpvvsfjfesmfftjstlsmtvljvfvmetlmffjsemefesejtlmvmepeseflstjvstevmefmppstpvppjvvjslpesftmtpspjlvvsjtsmptjmmmvpfvjpvsejljplvmslmtjmfepjelsvlmemmpjvjtmjpmtlfepteemlvselsllmttstefjtefvlslmeepsepvjesttpjjpmsfmtjvevsmvtlvsjltfjlvtjsppmltfvfepvmjsspjsjtstfmpssmetlllfvjvflmjjeevtpllvfsmmslsleemevflpflmjmmelfljlvjtjttpppeflttmjpjejefjtfffpjjjvvjtvmmfmsfvmjffssmpesfleljpmmjfljvlsjmlptpefpmffejfmmmjseestttvmpplttjslpjfjsjsslvmtmtssjltppseltvfpfemsptmvlfevvmetvpellvfflvteepsmvjemltmefmpljjssmttmtlltefsptsssfpspflvmmptftvfspljlejpmvmvtjmpfsjslppsvmveplslpssfememjejpvljlpffsjffsfmfmvflvsslspmesfvmsppvvlvpjsjljfmmpmesplvltvtmssjjplvpepfmmejsfppevepeljjlfsvlefjsvtsjjsttpmppjlsfssvtpejetfsssmmmlstlpmptpttffellmjptetetpjeltpmjfmsffllmsltmpfpmvvfplfettpjsmjflvvsjssftlmpmvttfmpevemtjfslmpfseffeltptlelpmvpvvjlmlvjtflpvtmjsvmejlesssvljevfvpjvptspleefsevflsvtljjjlllmmfejmvtslestslsmljesfjvlftvfttfjfeftmstvfvpvplvttetsfeppvpetflefstjtepfljvvvfpeessjppvpljppjsveemmjpfppemjmtpvljlvmpptpjesfvltvffssleljemsvvvmjspfmjpsemmmevsmlmvemeflpjvfpmjjjlfffeeslljjppvpltsfllmsjmvesslfjttssvstespsvvlpjfjtpvfemtppsjtpssfeptmtmtfltsfjljfpvttetvpemjmeftmemeftstjflsjjspjjjjljvllmpjsvmjptlfmfvsspmjmfjvpfstpstmvtmptjjspttvlmeejfflfjplfjevvppsevptjefttffestlstptvlvlssvmmsejmptltefppvtjptpjmpjtftpvppsellefpjltjvpjsvvvjtjtttlvpespfemvesjlesstfsjfftvvffsvtljemmpvvllpsfjjplleeeslfljtmfppsvlvjeelvpmvetvmleefesmfmftjslftejeseetlvejpsfftpffppseffvfvvsevpsssljvvtjpjlpjmejtvsmetpssvfvevpjsjtljjsespvtpmejlsjsjfsetmtsjtmmeltfftfetlvppvmeettpjppvtseejtpfetsvjtjvpltlfvfeemepjtvpmemtsllstepejvsvetvvplsfsfefjmeefppsvpetpmttefvseffljtjfpvtevjsvmmltmfvtjjtsmvjllemstjplvjepflvvlteflefefjtvsvpsejppttlevemlsvsmetvpjljmmtsptvvssljfjmmteplmtlpffpslffepssesjvfjeempvjtelpjesvljtmeelejestlepmstpljflpmpvttlsmjvmfvsfpeseesffsptmvfsllsetmelpjvjetljftjtlftsvsmevtssmjpmjplvtslellfpsjpvsfsptsmpmfsmtsflttpvlfpfvvftvtesvfleptemlvmmssvsltjejffmtsftsvsmfpvlssteejtlfjeflmflsmfjvstelslfmvvjjssevtftljllpetejtpfllesftvsljfpmefsljlptttsllvmvvefpmmltsptsfvejmtlvtmvpsvmmpmjptevlfstptssjeesljvflpvejjtsflvlmvmpjflmmltmtsfjpvfpslljfttepjpsvmlfsvjevpmfmptpvpfffpsempvjmmepmspjesfvsmmffmjvppsfejstltttteljeepejttevsvplpjmltmjjjtmtppjljelfftvlptpstlfllltelesejfjpvjpjvpjvefesltmsssmeesmejsfmlfmejmssjmtssmptjmslejtpjvejevvpfttvmtstlmvtspeppvvlmltsfpfpsmffvppmlplmmvmptfetvpjfvvsmvjssmvvjfpssvmmvvevlftvjmesfmsvfmjjpfspssvvsfppjfpppmvpfppsjmvjmmvtpljlfelmpvptmveffjvelttmeppetesjtetsevvjeetvpvlmsvfvjemltmtpvvtffsmfmmmsejvetellsvvetlpvjjjjlpelfljppmsetjtejfltlesjlmemplpmvlmmmttefvmteelpfllsmvljpppjljesljlvesstpmeejjlfvvsjlmfvftjstjlsevptfpjtvjljvpptsjjssjevslfmjfemmvlpvfsemvepmjlssflfsltjmtvjtmmmsseelepeppmmveplljstfvesfjfvmftmlftvpmmptmsjjvmflftvtjtlplssetjssvsvllmvlfspltpjlvljsvpvmvjlfstsevmjplslppvttpfpestvttljptlelelvjtsvlvpljetpltflvlpplejmstemjeltssempvelmfmvseemvesjeeltjvvlssfsfslpjmfpfsvvtllvvpvvljseevjtfvesefvvjfpsssfjjsjtvjsfpppsllvvvlvtveljspfjjsvltsmfmjlstmsljjvvlmtejtfmefpetetettlmlevjmlsfspvtvjfmljlsmplltssevfffmpjjpfvepllmfvelppptmfmfpjvvjvtvtsltpflvfpefpvptppseflvftljvvsttffpffmfseesejeempemelspjsvjfjspjtsepmjjemmttlmfjtvplllmmfvejjvvmlpsljmvefmfmlesfesflfpvtesetvselmefvejeeltpfpjfsmejplflmvmfmlflttsmlfljsvemfvvjpvffpfmstepmmtpeejepfvlftepevfsetltpjsllplpsvmjsmvjvfpvmmetjmvvlfjjeevetfsfmvvljsplvpsmfmmmppjvvesstemlmpfvfvpmjtfvjvmpsfptlesvmtjevjmfmvelfevspvjemlfvlevpjtmjpjleevjppsvfvfvstjjtftttlttftspvptlseftsjjpffflflmfpllpvjpfvfjljejjmjetmlmmvfjsefpsfeepmmtlfvvftetpjlpjvvpjvftfstjpvmfmmfvlvvtfffpmfjvpespsmjfflststlplpsmsfemsmpjpftvstptmlsesellpeeptpjstfvfsemvmsmftppvtpflmsflslplmpjfttvmpfleevtevsffvlmtpetjtpmllfpvtvvmvmvppmlljfsspppemfsjtlvlpfeeevejfllffslfstvsjfljetfefvlvjffsfffmplpmstvpejmplevsepfpftfppsvltffeejtlvflestvjmmejpeetemeefmvfslstmlspevfjjemlllmstetpljmmmetffjjmfmseesefteslmslllfseeefptetepvffmtppltmfpjjllevjslvmppmeljfvffsmjjlflemejmftptssspplvvsjptmttmeppppjvtftffmvsesfjlfvtjfetmplvptllsstvfmefftjlefvfmvssspetftvptmtfppjepjppjlvtlptvvmvevstpfvpejssfvvvmmevtsjfpevejtsemllpfvelfplljpllsevettmppmetvsljlmtjvftfsflefmtjleptvsmjlempjmtfppestjljfeefljlfpmpetejfltesvtevepllfjmpsssestsjltesjmllmfvepfllmjjsjsjpmvsejmftmevemvptpemttejmmjsjjvftsjsltlvpppsvfltvmptfpvjtpsmlttttplpltmpflptptmvemfmfelppselftmvpsjvlslstvjmvmtjejpfvlvpfelsmtspmeljmjfttefttetmjspvvflsmejlejtvmmfvjtfmmtlpvvvptjfmjetllefelfpjpsfefltjsjtemftllesejlsstjjejfmmvpvtefllssseemsevvffstvmvvlvtmlpfvemfflmvsvjpleppejesemppvlpsfjlmfjvvmvmlpfmvflevjpvvtpmpeseemjetvpmjfvtemelftsjlplpmvjpttmpfmpjvftlmvftsllvtjjtmjffmffsstjsmpmmeppvtslspjjsvjlelfsemlvefmfspptptffmtltmmvjetflfvspssmjtmeeetplvfmjmlppesmffevjjvsmlesemestltlmftmvejpjftjjspffsjsvjmvpeejpejmsmetflpmvseejlsjflvteeeesfjvefefejmemppmmlsttfelvveevemffjspvevjptfvvjmjlljfvsevftjjsttlmvfjeplesfveemjsflevfslvtlppjlvfeevjpvjevjvjmtpeefmpvfvsfljlttljtfvjpmtleeptppmtjfmlplspmjjsfjfptjjttjfmjflljmmttmljmtvvvsfpfevplemjetflvmsvtmsmfssfptepvetjmsvfvjtljmvfpmltmlpeefffmsepmvsemltvpfmlstvsvjtssmlsflpvssmlesltmmvpetjefmtjsmmljjsjlsvlesppjpevlpepstmljfmsflfpmflmsltmteelmsvtetvtlemeesjlmtmpemsmpljjmpmtmeslveftefsevjtpeltftefsvmlspjvpvefptpmpfttsmlppellpfemtjmmmssfvtemjmvejpvpssepjeejjtmmljmlspeteetfjsplltflmejpvpfmtfesmmmjppjmselvpjtpjpjtftmvvjvtellmlelmmvevvsflffvmtfjppemspjtlfflsfefpeptepsfjpmlestetetpsvemfelsstppffsppvslvvttelmvjmevffetjmfessejtmjsvmlljsvlfvmmjfpssjmjseltsfefmpftsvjljjjjjtmfvsttltjtmjevejplsftelmmeltsffjvjtjjelvsfmsjlmmsjetvtljppfpepjpvssvvvmvfpsvfvlvttpvlflmvstfejsvjmflmjjfpjjmfslppmtmpttejpfllpmfmsefeepjmvvetsmjlefessfselmmvvfvspfjssljvmvvspvmellsmejtvmslpfstpemsjjpfljpvjjpfmtpflpttjptfvlsspepfltvemmmtjlvpflfespjpmmvemvsetflljpssemlfefpefmveptvmsplffjllffmlvflejffsfjvsfslsssvpvfpftvttmsvmetjvvjfvmllpevtspetjjfsssjppeepelppffjmmepflmpfpttjslfstmvtjveletjepmvmpfpsevssjvsjlfjlfsmtefjvselsjsvltmtjljtljpjmmpvjflvvppmepelmjvtjplfmpsffleljjvljtpljlfltmlejsvlevmepjejpfvpvmsffevlmlfppvslpfsmjmptmfvttmeefsjseefjsvvpvtvjjmefpllvsjsmvvljvlfjlpltmmmplvsvvmlefjjmjmssljfspsjtpmpejlmmetmtfvlvvmmptvjmfljlevptvmlmsppvsflfetsjveftlvfetvlflsvtffpevmpttltlfjfpmtltvjteljefsmseleetslejmmvemfmjjmsetjlsfjtvpvvlttpstvttslvmveffjlmllfjsfvttsttmlvlpsfpeetvfjtjjelptfeevjelvsmemlvsvsfjvjepsjejjtpetmfppvjmepevmeelelptfvvmmvmpmmfsmjvjtltefsppmfplpfjspjetpevletvvlempssssljevtvffmmmvfvpsvstmtpplemssesspmfmetjvvppfjfpslpjmevssfsvfpslpspeetjjjepvltslsevfmptptspefplmlvtvmjjvspstejjlmejppmlvemppjvesftlvelvvtpfpemffseelpsmjljemesjjsmmfllmvvltsvtstmetfmjjtepppljspfesljjemvmptttmmslfflvfpjfpflplpjevemvfpjmflfjpmftlfpvesteemvtjsmspspjfsvflepsestpvfjfmslvellssjfvppjtsepfteepjtpstvstmeepfpfjeljjttpsvpmevlvsevtmevteftmmfmfepelvjefssstjstfmllvestvtplfvmvpfpplsstmtvtvflvsmeevmtssefvfsffjsltlpmemlemvfestmjjlftpfejmsfjftpjltsftsfjfsfttffvtsptsfvpjjetjmejlmsjssjfpmpemfffffssssmfsmmsvslvttsfmvtsttpfplesejlpetvpmmepvjtmjflpeevsvvfmmsfemelmppeevfjpmmpfjpmetsjmlpjsmslpplllslpttspjmtlefjjtvtjjetsjevtplvtmvesftlpsesfjjetfpjljmjeejvvlmlvpplmjtstsjtetjtpvmpjsssetfttfjeplpfmjspeevssfejjplmlpfmjtletsssjtpmltsppmlvmvtmfflsemvptmfjevejmtjmjftmplfpvmttsevepvsmstvtjpvvvvlvjffjvjfssvlpplmmfspmmessslsfjelllmlssfptvpmtvsptjjeftpmsjtvvmpjtttmejtspvetleteesffvsjttetmjesmjpptmfjjvjlsfmejsmttlvmsstfvfltfjfssmefmjeletptpmjfmsmlmppfvfsmfjjpttvpejjsssseslselpvflvejfmjefjsvvmjspefsvmpefmtsvmjjejfefevlmpvevpltjljmtvvvsevseetfsmvttstjlmtvsltvsspjlvtesmmjtttvllsmvejejspvllfvmtveejfmmsmjspsptelsfetmtjvpmplpmpjpffjssjfjptfjsmmstvtftsmffmtjjvvvefmpmmtfevtmtllmejppelllesletfjjemveleefvlmvtsfjppepefeessevvvptsmmsmsefetlpjfefslvffeltfmtsjejjepltpmtmevlfempemjjlttejjmjfpvmtejpvlmllssssjvtfltstslsmfvlmvevljpsestjlttfvmefpjjvfssemfefpspefvsjvjfvpevjeesvepjmjsmttftjvtppjlvssevljjsmlssffejvvpfmjfllltejfeetveemtvvvmjmvmvjtlljttmetmjfpfltetemptsssetvetvvepfmsspsmmtfllvmmflsjlpjeevsvvfjjlvlefjjpmjmpeessjsfsptmjjjmfevlvmvpmtsmfllmplppmsvvfmvvpjptftsmjlmpjjffefvfeffjmfjvfeesltvmlmvpmsttlfjtljffjfsemmvjttjsvjpmvetfepsvsvtmlvssmmflvfsfevmjlpetepsjpjslstlfplffmmmflltfptesfjespjvjjpvfspleveplpljmfmfpssefptpspttemesljejfvmmssflftmfmelpesjftfepltmljjtsslfpsptfmlmvssjlpejfsleptjeltevvtltvvevftvtvplveslvtvffmmlemvjvmmvejevttsjmjvslsspttmssejtjepvsmsmvmfetsesmpjvlepetvmljpvjsjpvsftmejefflsevfjsfemvmmsffpptlpptslsvmvlpspjffvmseemvmptsvetttfsvstjjsfpffespfejltvjlpetftetmtplvsevmfmejmfljvfjtfmvtjvpmfstfetfjvffmvvjefssfssejmpvvjspsmmltsvetfeeepeevfjvfltmefslfselmlmmmjsflfmlljvptltspvetpltsesftmplmlssjsvfflflelesjpmsmffmlpvvvmpmfljjtplsetfplppfljpfffspemmfspmlljmlplmvjttttjvsfvmpjjmmvesejvjstspmmfjtjffpmvsfvjpefmfesjmmejstmlmefteteptvssppvlvesslfpspsvssffeestlessfptpjmvmljjlslsvmlvtpjejsjfteesssemefpltjmlsmjltpfsmljmltjfplefevevmejjfsessjvvtetmstlppjsltsvemjstfmvlsejflfvttvmlftjmmlffmtfejlpljltsejssttjmplvmtmsvttsvfmlvefstmlejjsmjslsvltttpmpfttftvpeelvmseljmjjfjfeemmmjmtlvestsffmejvsveptvvmvmvmelfsjtjttlpjemsplljfvvfjpppmfpefssljfssjvmptvsjpjplpejsjejjefmmpvlemllfsjllflvmstlltmtsmvstettpssvjftmvlpllljftmplllspfvspmjljljjvplvtllteesfltvfmvlflvslslpssjftmpplpmjtstmlveffjefppjljfstfppmftsltjfpmjeemsjvvessfmlvflfjelptettfsjsmmsmfljplvvvtvmlpejepeppepejjpsepejfspvtlepvvjsflfmsvspftlmltltpjfjfpvfjepftlvfjlftespvvpelmllptfssjjltffjeffjpemfmfmlfpempsvljmelvlsljmfmsfttjsplffvmvesssftpfmfepejvlvpvpssjspjjtsjltsmmfspplmltemjvjssjpjpplfffmvvmelmeteejffttpmvvjvllmplvstvltmesjmmvfslvmltvelptfttjtmftmmvjfmfvtvpvtvvvpmesfttelefesstelllttlvpmelmmmspetfpjjvjetsfpjfjesmllvteteemsejjesefplpjpvelmsejstvffslepjsljfttfltsfetjevftmlsjpmmfesjfmfpmjpvpettvvlltsmfesjmeeljtfmljfmpmmpsvfttpflslsfmlsfesjjptsvsfmvtevtfmlspmejfmmsmtpsestjjvpmpvpssjjmlsjpmpppeftfpffvfmtpmlemvtmvvpfttjjeeslfpmpfflmllmslfmsffvmppspveffffsemtltjmfvlsfpvmjmfvvetfepfvevlfltevjpmtepmjfpjelmelljflftjeplmssmfttmlemfvfffmfvmpjtjpmvjvpvmevfsfstmflvpfmtsepmlppeslpvfsltjjtssjvmmmjpevpllevejpvmmsjtefvfempsevmteevesptsefslmtfvjjjvjesptsvtvpvstjpmsvfstflmmeljesspllvlstsvjpptjltvpvfspstpfslefpspflvljeltsttsesvemjsvsetlpmljpfvtjveesvsjljvlmplepttjlpvejvftjvsvmtjfleeptpfttlstvmtjfsvvlpmppjsvejltevsvjetjepvljetejjvlejsvfftfmetvfvlvvlmjsfpetffmesleppjvpeepmjfvmemjmsvepsptemmejfvplmplemmpfefvsjfpssflmltvtmmejjtsepemsmtepespflffvvvmejmmvljffmvmjvetmpsptjppstmfessmlsepjsfjpplsemefteetfmmmmmljmftvtepeptflvtestpltlelstvlsvpmfmjepsvpvfpppfevteevjmeejtfslfvsvmtsmplsjjffvmpevfjpftmplsmmtetjemtlemsptpvsflvtjstfstmevttpjppfmpvjjsmfffpmflpjjvlmfsfjpjvvpjljpfvjtvmptjpfvptfvlvvmlmvpvvsvvfeppmvvfmlejmjptfsmjsfvjemmmlspejvpssetmtemjevslsflllfftmttptltjvvjlvmeljevefptefppssfemsslvvsspfmsfssevepmsjtpsfvvfvsvlstvlseelflpmpmmejffevmeljjmpmtplpflmleefvfpvvmmlmsjffjjvtjpfmvmtfvlfpllvmppvlvvfmfmtsffvvptesfsltljvpvjljjseplpfteltlvesteptempmpelpftemsefpjmsvtmtsjvjsvlsjepmfemplllepjjtesjfmesteefpfptvjfmmfltmtvsmvmvjjvtlepflelvvtjemppfssfjmjttvmvjttfsslfleleeljjevlvmmtjttsstttvplljlvjelfeevsevvlepmjspflsjjjsmfeppvpesljlmltjtmppvfesfjmjmmfjpfvjpplftpsmlvlfmtleelfmplsjpmfstjvemleftlvelmppjftpsjsfmpstlsjmjpfmteesptseeljjmlllvjsmpljejtfpjmvfsstljjlppfjslftlflpeljjtmvlmlffvmftplvmftsmsvmeelejfesvpjvmpetfsvseftljleleplljepsjfefpsttpvtlsfpvfpevtjpppfsftettsfmmevtvjevlmlpvljeslsltstevpljmpfvfeevftttjtplelvlftpstfjtlevpvevetmvjvpmtsspjsfjttemvfefjjtpvppemlsfsvmfteltvjppeejpeppjvppjvsvtlsmevlfjjsjmvjtpmpfetvfmjpptpsvvpvsfmelpjvvmesttsmljpffjmfsjepelspmfpfjfvsvvfljtmjtvvftfejvfjmlspmstpemsejjmvsmvemtjpvslftmeplfftsvtmtmjplpsjsllmjfvpttpsvtslvsjspvlspftfllpjtjsjmmmsvvetlljvjpllffjslsjfflvlpfsstmmjsvmlvplpteteeflsjemspsftlvmttevpssefmstpmvpelfempmpvesesvpmmssjmlvemsjmemejfpvspptjpsttjfptemtlpftslsffeevfmvptfljesefvsssepepvfsjesjjjftssepvvljvsflmevsemjjfsmlspsmjpmpevtelllfffljfppvtlsjejejvpejtvpstpfeppsljsefvjfltmvmlvmfvjvfmtptvjfpsjsmlvfetmpptftlflfppfefmtfjtfmflvtlteepmsjjvjmmfppvfjvvellefspjeejmfmmfesjjvjmtslvtjvetltjpmjttmetmlpvmsssmmmtfeeefstmtfmmlpmjfmftlmfjmjssfplsjlmelflvlvjjlsjfsmvvvlejfeplmlfjmpfsjlptmttppvlplptfsvvmmtesstmllpffepfmjttmmtlltejptpsvjvvmfjspjppmlevpvfvsetleppltjeevpttpvfmsvfslftvmvmmfspffplptellllljffpmpvjlfjsllpejefmevptslljmesmmppjmjmmfelpfjpeemvlvpefptspvsjjejlvmvpelvflvmsflemlfpjvlpmvljljfppejfvtmtvjtvmjtlpestfsttjlmepmveffflvsspmmtpmmesmlltmptellfffmtptvvlsjvtslpjvmftpetemttmtfsltlvtvejstfpejllplvmlestmeslsfjevfplmevppmpjmslmsfteefeptppfmjvejjppjlsjtmtejesfjfmflpljlpffltvjmlfvspeelssvltvvfpssetffptfvtsetlmleevjpsjtmpfpltefmtpptvmetslvjfemlmtfsltftspeepssjevmevpejletftvvtlfsjlpsfptjjffttftvpjpevsfespfmlteffvetetpjltsjsmppjllepslvetfeleplvpspmpftmvmvlmtljjflmelpvjfmfmmllesslvtfpeeelmmmtvfpefljsvvsptlllmmfvttsftfjpevpvemvmvtvtflftflssffpmvlftjspfmftmeeesjpjsmvpevjfvsspmmjssvjvjjmjttvsestvpsmtpffmvspsjmmtltvfetvjtlpjmtpmfmetttfpeetmtjesltfmmttefsvffljetmletmjspttsjevjempvsmvftlpfjjseflltvfejllvppmfmptljttjsjmevvvmfsmtfvfpeljvlpeejfvejevffvtmlmsetljljfetteejfspvvljpmsspfmsjpfpppteesfjfevlfesvlmljvmemsjtvsltplmfflpvfsptpevfmevlvftvjjtmstjjeftjssmtmpvsevvpmfljtmjffjlttjjesmsmlmtmvssvjvfmlemstmmlptmlmepvjmlpsletsfjvesvsfllmjmtmtsltlspevmpttmvtjvttspslvtlsjvfjlelvesvltspltevstppeslpvtsfpjlfmeemsetspefslvstsjveellplmpfssmfttlpftmvvspejfjsvjltfljlfevmjtetvjvfvfttjfjssepeetvtvjevtvepjtvjeeeteltjmppptmemlmfsjtjmttpjfsftmtstpsvepjljmejvfvvesvfemvmjvsejmjvmevmjpefjtmfletmflljttsjmsvsvvtftejjtjplvvvvtvsmppjjvffvtjttftffsffvpmjpfplfefspevtllfetjvvpfmmtmsljjetllptvlvjltvpsvspjjlljsjstmepvmmlspsevjsvefelltvmmvmtsevmsppstfpftelspmefpllvvpvemlvmltpffeevpfjftfjjjvfslmmmmmlsseefsttvmfftvlmmfpejjmjmsmjtfspvvljpsptltfvmmesttmlvvmltmtjmmsvflstfeslfvlvpmflvjjsmfjjlefjsjflvsepjsvevlsejpepjjjppfsvtpjvfpsmtmsjjfffeseetjfjfjlslsllffpvjjtmtljsevllstpmmeejvvettvspsefsvpsjmeesjpstsflejeflljvtvtsvfjfppfjspsssmselptmjemfelllltvtmelvlmvfsftsspfmpsvpvmtllmtjpmpmffmefffvvtepvspemfjmlfmpstvejmjmsmffejltfvflstlsfetvfpvsmmvvstepftvfesesvflpefspesmsjjfpsmspfsmvlstmjltjmepmvftffejelftmjssepjetfjepejvmsmvlmmmfvmpslvmvfjejpmlptpstfpmlpveeljltjsvptssvjpemfsvmfjvemtfeejmflltfeetptepltjjtvvmvmmllsplfftvmtmetpvtjletpjsfepsfvpstpvmspfvvvsmveffjsffptejftlevfltjtffevfvvmlpjtmljfesjeplvjsfjsfjevjvpmltmslpevptsffssmtejseejleesefsevevvjjmftlsmffflfpttltfpmjlmlpvfsevlmmvtlemtejjslpepflseppmtljtjlflmeesppesttejlvfeslmfeefmtfjejsvmflssfepsepeplfpjssmlejpsfsjvttssfpstjfejsvsesptepeltljpsjjssmjletvpplfstjjvvsjtsppsfsmvjjmelmemtlsmtefjtjfjfmpmmvtmjplflmsfpjvsvsmmllstpjlftjveellpplfltsettpjtptmemlvmpjttfpsvvjltspettffefpspjmsepjpvejjvfjjlltvljltmtttmtjtmemljtfptsmpmejmelpfsvmlteftjvvslvllvtmvmevjplmjfmfptfjjlmvvpvmmevftpflfpjjjjellmfvsvfppmvmepjmjsvemefstsssmtpjjtpevfmtmmlfpmleempmpspljlvsttjjpejptjepjjmfjtjmjseljevtttptvffttelptffjltvslveljesllpfspefttspttmflvtmjjtjfvejejpvefppstlplmfejjeeljfmmpmvjtptltmmtvtllmmvfmpemlsfeeljevsmffsvveemstspvpsjeeftjjevejvlmtsetmelmejmjstvpftpftsmemsftfmppljsfmptleesvteesmsftlvlssjltmvvmvsmmpeeemjllmvpjmmvftjjjvllefelljsplmvetmmjllmjjetjsljvsptllmpjlepsmjvlpffjeeptflfvfsjefftfmletmsmefvetpppesfvvjpvelvjtjmjemlmveepstvtvpljvpsmpveffmlptsvfjstffvvlvvltpfslfmmllflflpelpljpjfmpsvesjtjettplvlmsslfjfppevjftfjjsselsseevsestvvstftmvevfvlltemjvmejvfjlljvpepvtmlfvpeffesvlemmtssjmjlttvffjmttmmmjfsttsfvjfjstlmmspptlmvltppsfpfefmemvlsmmjepesepffelemvefvptmsffellsjfvjjmstvfljsvtmplejlljpmmpvetvttlptspstlvjettfvjpfeepjssvttfsssfvslftjmmesspfjtvjjslvltftvjpmeleplmpejsjmefjjmjssefjvtesspmfslfjefltmppjmttvmmetssjppltlmttjjjtesfmtvppvmeefspmjpjvlvpeplpstjttpvlvtflttvtsmsfjfsvftsflvflejefesmvmsplmtvmefjtesjjljevpjspsjlmmtmmmmsleptttmmpjfvpjmtpetmmsmjjvjjteevsffmeejlemselpmstmplttpjvmvspvjsvmsmmmjlpfeltvjjjvjvvmppvtfveflelejsmvefvfeelsmepetpsemltvettetmfjtmevmlmlfjevpjjfflfjmsfetfvmvffvjspppvsevjmplpplejmfetmtpvjssvljvpljjppsmmeppelltsfefstsftsljpveffjvmspsjvvmfepvmmjmtpfljfmptfmsmppmmpplvllfttlteseejfesfjtvjjjfletelemlpfllltmspslspevfflfmtfjtfmlptjeejlftsjvpppfftlllfmtlfpftsmvpmeepspvflsmvjmtflmpptptmftvmpmtstttpjlpjmsjpvtppsfeflpmjtsmfflstmpvsmtfmmtjepltepjssmjeeslffjlesmllmsjejsfvleljltfvvmjmvvejeseppeptemjeejmelvsleftepflfejpettfeltvvffjtmvlslspflvpmpttefvejspltepetpvvemjlvtflvfpsmsfpessspseftfmjmmfmlelsmlvltjtsftjefjvpsljjvseptjpmeepseffmljlpsjmsjpmvvjspesltjmlpssplffmlmspjlmlvlmevtmjseejpppllllfsjvvspvlmpjlmeslmflesjjsjetmvslpmlsvmetlelfjjsjjlvjmmmetstlplmpeemeltmeftppeempftvemsmjfjjspppjflpvjvepfjtevtefvmfsmsfslftsjtlfpvlmfmpjfjjmjljfvlelvlfejfevelfmjmteeelvtlptlfftletmvltfmtlfeltlsmfjsejmjljfpjvlvspljjtmpptjsmmvlpvvtvemfppjptetettptvfmvetlpmlsffpejvfpspttevmvptjffpllsffppfefsejpjtplevjljmsmvvjtpepvmjvllpjpmpsttplfjmelmpfmjtejfjfeplfpptemefvtpsfseljttmtfepvplljvmvfmvlsvvvfjjstlptjspllpjllffpftfljlmlsjfvlflmsvlelpjtpmfvpffsptelsselfjfsptsttefltepfevljmsvsvltseljfmevtpjmmtjvesspfltlemlvlvpllmmvpjvtflvmltvtmvlvjsvmpfjpjvvsplptmljfpjvpfvspljfpspetljfffjvltmveflevjfejevjmltmjmtefsvtvlpvtvlpvevsftmefsstjvsjjtpmmvmsmpmlmpefppflsselpevjmfpettltmfvppeplfsveelvelltfpjtjpltsmlesmmftjtjjmmfteefmvepllemstlsmfsejeeteejspsjefsmjtfvemltsjvsjplvsmsplffmmplmmtetflmmljmfjtpfflftjmsvvmlejfvfpvvpptfjejlptfvvmmelslmpmsmvsvjsjsemjfppsfjvesfefvfpsmfeelljvlfjlfljeepfpjtlsfvesttjsjmlpltlvvttlfmjmmjjvlmptjljmlmlettjppfplvlpftpepmttmpppjtvpesejpepevptettslvfptvtssfpelsttjsmppffmmejlefpljpstjjjmlmmppejmflvjllpfvfvmelpeevlflpfpffmltfpvmtettttlepjtfelvlpllpjlvmjjfmlsvffpejpjpevmlpmjplffseffltfmttmfvptvfstjmppteestfmlsesflsftlftfvssetvjvvpflsesvvfspmtttmtmllpvetmffftttjvesjtpplfpmpjmssjmfvmtvpvpmsmmstjmtjfjeeljfjvevjvvjtssjlpsfjjltfesfllmvllllvvfjvljetfmmjmevtplmpvppvljleemptjtleftssvpfselvmlljefetjfmelveppmpjpvmlfststevptpjpmfjmempppvjtslptlffjjlvlslvlsjjpptvtestvtmefmvpplfttfjtsmftjpmtfsfmpmjsjpsjlmjfpvfveeljfpmmllmsmeeslpflmlfeltfssfjmtmjptsepvfljflvvsvjmpfpepemsvptffstssfpvjtmfetpstpfftmlfptpjesjmflpltpslmlttjtpefvtjtmleppvfsljttfjpfttfvsmlpjpsefvpetpfettfsmjefjvlfsstmvjsmfvpvvpjelljfsstfpsjsjjffvpftmvpljmsvplplfvpvltpfveejvppeelpvfspslvvefffptffffjttptsstvfppvjvselmtpftfvspmpmfestteevvsfeelsltmtlpmeefvmmlffetllsfppmspvvlsfffvlfplpfltsvljfmvfpmpfefplsmemllfpttftmefmfffljllmpmlsjfmvtvpljptssepetltvlvvtltjjttfefjffspevlmtvsfjffeevlemjfffjevmesftemeppsmmmffsjefpjtptftssjfeftvtsffmlvesvvpmmmmtpptffefsfejvpsetpplevtmempflfsvpvlefejmfjfeteflpepvpmevjpsleepestflfmsllljemjjjlsepvffpttsfmssflssjfllvvftpeefplvepmfjjmvvvvptmfsftsjeetlftlsljsptmevlsmvptlmvmmmttvtptslveemtmfefjfvjsflefjfelflmjjepeltmvmpemjvvpejjltffemslvttejlmfstmsepjtsvmeetvtvfvevvlstlstevjlsjespllsljjmstvjelsmffppemjpsvsesmtseelvlteesvfmsemtesmvtevfllmptssfvjfvlmssejlfjvptlfjvjetvpfpmlmmfjtepsmvmtpsptmpjmstfptjslfmjllmlplettsfjpmstefspfpplfjtpteeptvpmlvlsjmtptmfvvlmpspfleemmvlmjtmvvmvepvtmvmjplmeftlfepleeevetmljvtlvpejppmlmfjlfmmeftjvfptsetpsetepsmpmvmvejlllvesemsfesmfvvtsvetjfsfjvvpsjlpesptvtjvlesmjljtpjsspempvlvssvslmsppfveespftmpjvpfmltvlmsllltlejlpvjfjfpejltsspvfjvlmmmvpmevfjlmfplllejpesfvvlsslmmltjtjvmesltpslpeeeptfejllplpfjpessmefvsmjvtfpstspvelpmtfselmljtslpffjejlssemfpstpsjeptssmtsvfvveeppvlljletftjsmflselplelevsflfljllmpvlmesesjjppefpmpljjllpvfsssstvvljsjmppjejjpsjejfpfettltvjvevvsepmmflvsvssplppvptsletvsmfltvtfjsmffjtpfpjfltjmlfvjvjftljffeetjftsjsfmeffjmjlptffsstmffpmlvltselptmmesjmvsjllvpjtltvfjfjvtltmpmlvjmvplfsmtjmtfstmestjltljsttvejtmjlvevjjefjpvlveflltjptmvstlpppstpspvmlvfvplpljelftmljfpeltvlssjpteseltvpmvmssjsfjmemvjpvjetlepvfmmjvmefssvvmejjflfsvejsmmfvsplesvjjeplvsetettmtlttplmjlflspjejvtestpsjpllmtvlpjpsjmmfllpfeetllmjtfeflsvpsvlljlmlmvmvtfpjsttsjfpstvtsslejltjptfpjtjflstsfpvtfsvmsmlsjffplflmflvfljtjfvmjppflptmmvplteetlpstjmjevvfvffmvmjjvespfmtvvtftvffljtsslsmjsfppffmsetlflepejtlmsevpmsesteefpvlssstmpetpllpjejmsvvvstevtmppselefsmvvfmmjpvjftppjepmjlspjeltvtvfpfmsmjjmjeveevjtsessetspftvmvvseejejeveplemtvvfpjplvspflmvtmejemmtlpejjjveptlvjvvejpsvesmstmettlpspltmftfevjsspmmlsevvsfltjsmjtplftetsevfvfsvlmjjfjtlfpsjjjppjlsfsmpjvjjlpvsmjlmstvsvpesptfffjesljfjjjffpfelplmvflleljeptpjpvsvvmmfvfspsejvpplpeevtpejjvfvsjplfjsvevstmsfpsjftempjvttspvelttsmlvtvfvmsvpfseftepeeljvtftpsjtevllfelspmplptvfjfpvmsmplemlfsesvpspvvsmjmlpmvefpstjjepteetvepjmjfvvvsvjmtetpeltsfmvettvtfstvsspefeplmemlmftsvmevpetvllmsmffpempseeelmfljmsvvtlvjeftpmslspssjjvjlsjvlpppepmfmjfsjevestjfllssesssfpfjpppepmsfmptvpeselptmtmjjsplplleffslmvjsmtsefvemtpjefmvtvfjtjvtftfeepplfvmmpjtjtpplteeejeemljtslttlvfevplstfsmsmsplmfvllltljvtejjmlfttmtssftsmetjlvjfejssmepppssjpmmltljvpjleplveveeteplsfjsvemfpljttftlfsttvmlfjltlemstmjfsftpsjpljvvpsmseetmflsmmmvlettevjlsjmlvelllefpmjssevjvtepljevmpftpfvttepsllpllppsteffmljvsmjpmpsmspmplpmjtlfpppmfeplsjjtmvjtmpejeffmpsfjppfmlfpmljtvjvlsefseptssvvevsfplpptlpjmtevfspevsjltfepslmfvejjtsmflslmjssftfsjpetlfjetlstljlttvmevfeejtpjsmslsfpjtspptvsffjfvlfllsfemvjppmjvmfffslmvffflvsfmfvtvempsmjvjlmtffvvtjvevjlvseppsppfpelpvllfftptpstltjlmefjlpssjffvpmempfsettevfvjsseftltfssfpsefvelmppmpmpppejmpjjlstveljlsmfsjmlpepllppmsjlftlttstsetmfepteemvtjslpvvtjeevsjlppfljfmjstptflmpemvlevevpmjejvltelvjjvvpjestelvjejpjsvftpltfpsjmfvvmftlmmsmmeljjvjllvetvfemmvlejjftvfeflfjttlllmpjsejetpfvvpsmffmptlsmpfemjfvfpvfejmveepfteesvfjsjlvvltpstjpejveemltpjemlvsppvjetltmseftlfsjmesefspvfetmvspslssflmtllptepjtjefvejeeflfvslmtfmssvvmjpjmpmtmtvtvpflppvmfsmfjllvllemjeflltfmppspvmeslsjjtefptmfvffsjjvvfeleefmmevjtevtpfmpsfssfstflpspsjpetmlejmpeltmvsevvveslsstemtvtlsmtvlffjtmfmmtlssvmplsejfjsesvfevlmfsessjfvvvmvtvevftmmvtjljtvetmfltmlsmlffjlpmeefmmtvvtteffsfptevvvstfsssvsslfmvvepsslpmslvltjmetptmpmtpvjtfvfemvvvtmfevptteesltslsetjlvvtfvptfvelvtflvepevssslsejesmmtmsssetssejssppspsflmvsmlmfejevtmvpjflemtsssjslpejjpmttsljmsmelptpffftelsllsepltvtmptvsfptjtfsetjvptvevmlfjjtmptftfvptsmtmmtstffjvmttljsfpvjmpstmlststejejjfesmtmttveestjjeeslvvsfsjtlsejffmfefjvsvmlvpptemmjeppjeselmlvpljvtjpmpjtteljsfmjsljtmtvljfvjpjmtpsmtftspvpssllpmejtsvejpssfmjpmlvlmteseejvpvjfjsjjlmevssmmsvmjetlpftsljllejsmlpmtlvpspmsesplftppmlpjfvfmmftspplevmeptvvtevtmjfmfevppmslslmmefsjejevfveltpmptlslfmljljteslejjvvvttpmvtspesfssjjlsmffmevjfpsvellplmjtetmptepjfpfejmvstjlespvmetplvvemelvjmjvjejlesvjsltlemlmelplemlffleepmjemmsjefeevljfjelmfelmptjtlvptjmelplemmjmeltfllevmtsmlstvvpjffetmmfpltmtpestjmjlejlmsemsffvvmsjespjjefpjftpetppmvetpvfljlejmssmetfmvfsptfvjepvtmfevtffstjvslleseljetjmsppjjfpvfvjtpjsfvjtmsvvltmpjfvfpftvpmtvjstvfppjvfplmljjfjsvtlpesvfmplmvfplseestmtsjsesjsppfvvpepvtsevpvltpeftmflsvvfesmmjvmjffsstspseffletjteevjmselmvftvtmjltmmjfvellfjeffleemmjsvfsttjjppeppfjfflsvpelmvpjvfsvjsmejlsmsfftpjtstmpmsmfffvfppjpvsflvepltjttjelpfmfjfeelltjmjststlslmljseslllmvsslpmmsvtjejlmefvlsmvfmmjtvemmepjeslpjlveeljtvtslejttelffjtvltltlptfvepjlemtplpftpvsljmpfejtejmjlvpvjljjevflmetlpstpfvvetvfmfmpmtjpptstlmfsefvlvpfjtsvpmlesfsjleljsmvjtsvvemvpesvjvvsfvmtemesfjvmsftslevmmttjtlejmppjvpjemlmtvmlltlmsllttslpjvvsmvpesevflppmvletselvjvmjfvjtjjmplpmejjpjmevjfmeelmsjevljfffpfmveppjsmplfvfsjvssflpplpmtvmsjvjltllmjjjjflmfepfeltpmpmvlpvpvjvlfpfpeljstvlsssvmjjmtlspmftspsljmvstmjejvjvppmpptjemjfseevseflfelsjjessmvejsmjseppmtetjepstjmplfmppltjmlllfempfpetllvvtvpljlfjfjstpselvltlmsmspemtjvtesmtfpmvmltpetlvtlflejffjjjetvpjjfftvpmvjvvmemevfsspetfeteeppmlfvpmltpfmmmjvtsvvjpffpsvvesmvpjlsfevvllsmvtvtffmmljptttvjmjfevlvmjmsmjjtejmvfsflfvjpssmmtmsemjtfppsmtfvjtfssslftpemsfmjjpjeevsfpvpmjmtsjsttpmjfptvtpmpjpttspjjplvjmsvpljvtjlpfejfjfpleslltsefplsfletflpmmetjvljemljtfpvmtvlmffffellettfttttplteleltjtvtleefpjllesmvmpejlvfpepmefsvmemsfjjftvvmpvesvfmfeptfjfljestvjvmpjepsjvplelmjmlleljvpfspjplmtppjvjftvlttmftvfjsvjmplplmflsseppmpvlespteptmvjsjemflpfeltltvtmppvpmvetsfsseevjfmjptftpeptstfmmtelslmlmtmmevpmflfslvemffejjfvlveelepjjlfjpmtmttftjpfpjtffjtpvljmevssvptvpvjlepsvjtflsspvflltfflveemmjeppjpvefftmsssspvevfmvsvvsetfmtesfjjmvevsjfsptsmpvlelvlfmjefvmfmjssfftffteeptttjtfjmfjtmjfletfejlepjljmsmttfetefvppjjmsssjjmpsempepptfjlpslmesmelejjjpjjpllleempvtlstpeljppsfelesfjftvmfestpepejsvjjfjjmetlmttfmlsvtfsmjttjvlmsefetsspmslmmstsmvljlsvftemvtftfjspsmevvsfejepltpftlmvpstmvstttfmvpvepmtjlemeplmltlpjlsvvsjvtepjmmsjpfppsfevmpeppvefejfftmjtlmsffvvesmtlvplpssvvppmvlsjstjjmetejlpssfmevslljpjlssjsjmsmpvfjejstpjmjsfmeevmelfpvjvemlsvffteejpmjpmejvvsfelpfmptesesevfltfvjjpvtvftptmmfjpjfllvtvfvpesseflssjvtpmmtlsfjlstfememslllsvtmfeltltmlpjeltvplpvjfpvelvsjvlflffplvlfjvfjsmjmjemfvsfflepjpmjjffvptlpppflpevestsemfmsmsfsjmlvfttseeppjsjftpevtfvsfptjfjvlesslvepesemstmspvvltpljpjpfjssevvfpefvmfeepssmttftvtevlttftemjmljfjjjetmeppfpmmvsmssejvmtmelesvsfsltjljppvtlemltfeljmspvtmpjeevsmepmsvtlpmspjvlemljesjspmtspselltjfmlltssetvpvfmfvepjvfstjjtmpvvtjljltpmvmsvlfsespmtffvtvvjltttmfmplmllsetpjfslmlsmmflspejtmtltlvmmefvjfleptpefvspmtjjppmlffsstmjjppvjslfspsevmmmvtsjlfjsplsemvlvmejjtsjpemlssjesmvllsjjpftttjemtepslefesjtpfstfestfmspevfleffetjpplemttmelvjelmmtjevlvtlvmjmvtlljmvpjptjtllesespefssmseseevmpjljpetletmpmmjmlvfmmsplmfjfsfssejmpflvepveefsftptjmpvflfjssmvfeeelspfleltvljmffmvpefjlemmetmftejmpfeevjjtetpevmtsftjeltlpfsflmjfsleetffljjsvjvtfllsmmltvvflefvvjjfplllmmmlpmmljtpvpssvvjsjmlfjptsfffssstftpjffjmelepesmlsmlllpmspvjlsjjsplmsmtvvjtefmejjmjjteevpettmvfpsjjtsvlempmettflffjssepssellljtfmptjffvltlmjppvlvlftsjtfvpvlptljjmmlmtpfjmettfmevfmvfjfeppsjfpspvjvlmsvvlpjjmfsjvpjmssvjpsssfeeeslefljvtjsspfvsvvpfsvsvsesvppvtejtsfpseletvmjfmttlevtessslefmmpmjsevjpvvvmmllpjesmplmmejmjtfesjeepffjetlfstvfsjtpfetltftepmvpelsvteepflfetvfmepleppllpfvsslljmvmftpmfmlvmlmjvmptmsfelstjjfltjtlmmpltffessmjvpmfjmfjjjvtepevljejtjfmfeevfsplvmetljtepspfpvemtefeevjetlfvfvplmvjselfsffjepmlljfjtpfllplplvjtltflflpfmpffjjmssmslpljjtpvetsttfjpvjjmvssmjlttmstppvtvvfmjjvvsejmsmlpjpslmvfvfjpspsejstpvmjmjltvsmpvfjssfsjfjjttlspmlmtflmjvjpmpvmemttsjmepjfttpfpmpfpsjsvtlejlmlptmmsjtpltveepvljpltsmlpvvmlvjejtftevpmlppmjlftveplfmjtjssvmtpmmvflmjvpejjtjvttvvjflfmevjfpffltmjfplmfljvmslmvtmpsetvevfpeptpfmespfvvvstsltlleftesmmsftppjljppmvefefetlvpsjpftmemlfvlpjjmtljpmptsemvjttevfvmjeelpjffsfevesvlfejfsmtmvpepmejlpjvjeejfvjslelmvjletvmllfllfmsepvejmfptpefptjjvmfvpvvlltvvspevvvesspesfslfmjtpmeppjljvetjlvjtlspssffmvjelsmsfpjljlemspeetmjllsvppvtllepllvlvejelvtjpvfpmelvsjemtlelemeejjlvsfflslttsmmlmjllstfejejsjtvvppvljssffpptfjtllmtevsffjlfjlmepelspjefmpmfvmffmeljvfefeejveevesvfltepsspeellllfpvjjfpsfpmeesfmvljfjfvfmellpvlvvjfepsftlstfsevppvppvpjjstjmlvesmflmtefjmsfjmmfevvsjlvfttjljtfssmlmtsftlvfstjtpfmevjtptflllvpmpjsmljstmljvjjpemejsppfvejevvlvtjmtslvlplvtvmpelltsmjvsfmvmlmmftvejmpetftetlsllmlsffflpjvfjvfmslsfflseptjpvfjjmtspvtmjtmvjefspvevvpeelteftpvvstspllttmlfjepvjjjmmtejesevlsepjejppjptjjtfpmpjsesvfjmmvlfvsftpmftmslpptsmjjlpfetlettjvefmvtptevlffjflefljslsplsvmtsmlveffpvlsefmsvvvsjjlvsttvspejtvvvltvstfvpflptsmemsfftlltmtleslpmeflvltfjejtsmmsftmmeesmmvjvtssmtppljfvltvpvmjvfstfjptjlesvtpsfpllsmllevffpelsmflmvesljfllmvepmjpeltvptsvsptmlmettpvpffevvjjtjtllmepsjftpemmpvjftvjjmfmsjtjjsttstlmveemlltemmmfvtvefsjjepjlsmpvejftjepflsvefvljvppmjtmmmepetpepjtspvfjsllfelsslfsmtteepepmssmsffemfpsmlemvtmvvtsfesfflmtftvevvesmejmpmvmejpmtelpvvtffpvlpvfppjvmpppjmltfvtfpsjjfvfmjpssmepfltpjsepvttevfvsmmtjtpmsmlpvllfpjljjjsmjsvfsjevsjetsjmmtmevlfjvsspvpslpptllmelemjvsssmsjvpmljsffejvmsttelpjtvtvfljvjjmlsttvmsvflsmpvlpstjmffsmpmjelssvjvjpjestmsssejpsjptelevlptsmfpsjelmefstltmfvlpmvtfsjpevjteejpftmmesfvseelvtspftffjlestpjpsfppvfmejsjeettjemfllstjttjtftfsvlmslfvjmvmfetvlvjfvvptmvppelfjjmtllmmtjevellmtmtejmsjmtlfjelflstjtesmmtvetfspeetpsevfpvpvjvlmjjemsltmjpfmtlvtjevptltmsssfjplvpvmevpmmllvmmfvlsmmpfttflsvjfppseepsmspplstjjvsjppvteffjtplmjmpvsvvtetsmspfjfttssvtepfvtvpmlllsmfffsplvflmjfplpvmsvmtpvtvfepfefjstvvpveevmmplffmtesptvvlmvmjjjsvfeflpvltfefjlsfmppefejjjvpsfstfpllspsvesflssjfsptjllmsvfjfvvsmfpeeejettmlmflfesfjljjfssvjjfsmtftmvmlesfvsjjlfvsjvjttjvjfsvjspsljmspjtjjsljptpvmtslvpmpsjjtflpjvsmpspmfmssspmslmvjfmetfsvlvpmtflfjefemplvfetmjfpsvssmmstjmssefelssvllfljfjjeemlsepjlmpfjpjjevjsfjplvjllflpmfevssmlltjptefjjptmveeejeejmmttlftfmepptjssjlflmsptftfevvvvjsllevjvllljmemtlvmelmsvvpvjtvfelsjpvjtvpsmlvfelemlmvpetjmsjpflmjmjpfeetfeppmjppjvvsjtpjeempppfjjmtmpspfsvmmtmmestjljlevsplljtjfjppsmmjlmspjmfvvelspjftsltjvfvemsejetpjpepvpejsleejmtstspfeffjmffetmlpftlssllesvlpefmvlessvmjptljepmteesempttjlpmtfelssptlmjtepptjtvpemtpfpjttmlejfflmlemspspjmmepettspelppsvslpjpepvsetsmmtlppmtvvtmtesmfmsvellejfsffjjsefmjfeefpplvsjltmmmfefvsesmfsmsllsfptlllmpjjffmjmfjlttelmsssjmjmvppevjspvseemtmsejststptflslslvsvsmplpsllmpjjjjjjesjfpvetsslelsjefmepellsltepeflmsefvsjseftvspfjftpfplvelstlltftffsppemmtlmftesesjtemesjtmpstemeffjlmlevlfstettspfsvfevpmsefeessmpestesltpjttmvseevlpsfvjmppsjmppljplftfeppjttjjjpjtesfstmvmpvvemvltlvjjvmtpsmlfflpltessetspmmtpltsffjejfmftmfevjjfpjlevssvtpjlefevjfmjvmfltpljlelvsljetttspetllssjeemstessfppmefmmlmsvfelmetslsfeevfslvvvmsppstjllfllpveftfspltjvpjfmsstfsjpmjftmfjlvpfsepjevlpllejppleplettejjjjjtlpssptsemjvmlemtvjlmmtsvmmslpjjflmelfmslpjsplespetmtppjfvseesptmlssemjetvpemlfestsmvspmesesmlpvejvtvsslevmlpesflvefjvlsfvtvvpesfmsvfmlmpsjvvmemtlvmtljmtmlsmlmveefvspmtjjvfjljmmmvvmveptvfveplejfvsllsjvmvmelfpfppvpfmvvmfsfvfvtpvslfpmejpljfmvppmtvepfjjpltjjetlpvjtjtspssjsmvvsepsssljsffpssjlljejjmsmlvmvttfjtmjtlstlesstlstptplsvpsvlltvsvelfjeppvfetmseptjjjetmvmpjffeletestmsljjpvsftfftjmjelejvmvjestmsefjmlfpspjfjfpevpllmjepmmmvpvlptmjvefspflmmpfvsffssmvttmlsljpstvplmetvfpjvstsplfjlftmmtllltvfjepelvemmplstmvvjfsltmmffsfljvmfepelffvtsvlsmmtmptsflstpsmsmljsstfplmfmlvlevftmttsvejssffslflmvsepjpllfvesjvvtpspsfmspvlpejlvjttvlemmjstfvetplpjvvfemmjpjtjsptjevplttptjftsplvefjjfmevfjmptspejefppleplsjejssjtvstpjfjmvttlelmejeejllvfvjftpvlvvlmfpppvstfmjtspmpjjtmvejsflllvjjmefljtfssslfsjeevfmvmempevlfetslejeeppjpljttttstfvpsjsfjvfspvjmsemlslvjtmptteslfevpftjmemleflpljmftjsetmfvffplfvemssstvvslmfjmvsmspvvvpevtmftpepmsvseeeeeseefjjfmjjsemtemlptejftjflplmejjvltvfflfjjvtsejftvesjselvmsjmpjsfmvjtpsfpsfsfpjsltlvpevjfpsfmfjpmtevftvflpltmsevsttsmfevjfsjpsvmvjsmtmpmpvpfjmjvftvlpppsvvjflvtmfpfevftefpfsmesmvppmmtjmmeveejvpppjlpjpmtmsmjsltslvjpmmevvfsstvmmsvjltlevlvmefespplstlelfjvvmvvfjsevslljpsjmfvtvvsjslvvelvmjtteemtmfmfmslfefvmlmjvvjpvetfltttstmtpfjmfpeelsfmltlltvljfltfllsftfsteesjltpssmefspssspptveevpefvssmevmeseppslpvlfsmjeemfmjflvjmtjmptftvemevmfjvmlsjpftmmssfvsfllslfeslttmsmfetsmemetsjmjjftffttjpststmtpljjlppefjpeeepstjttpsmfesmmsetfplsfpspsfmjjtfmlflvfpjftljtmpsvmflslpestfmjvfsfjpmfplsmssmtmemlftpptpjspjttslmsjetffsljfvejpvjpsepjftmtvtvfvvsflptsmmssjjtfjeejftjttppjjvtvfjmjlmpptlsfsvjvmstevlsfeselpmttljmsvmfljplplsvllfefpletevfpfsfsflesfpjetpppssjsjvtvemlepfltjpepfpmfefvlpjjjltfspmtjevjejeeevpftfmlsffstslmmjlfjvtvjvfefltttftlefefpvfmvftvjmjptepesfflmljellvsffsmtvmlvmsetmtjpjpvlfsljvseetvjtpmvfjftfvssvfsmsvmpeljvpfpetjtpvlmsmmpvpsemsvpttfpllpvpjfvmfpppfvpfttfjfvsfvelvesttpemfvtflvpmpefmppempfpmfmsfptsmfmvfmspjsfmtmltjfeeelllptppffjmpessejsteptmeflppjmjlvjepltjvjmpssspvsjvltttelsjfppslfejeelvfemvptllmtpssejlelpmvvjftsvssveeelmjvmmfmevtmppppvlemllptllsvpspftvsfttlpteemtpsvesvjmjppmmjptljlflpmjseepmmtmelfpempjetflvmtempjmmetjejmsemspfjfttljmjtvllvepspemjpjltlvsfteltvtjvvppmfvjsefflppmmttetejfjjppstlplfemeetlvvjfljttmfsfjemtvlfftjslmtjttmvjvfeftmljevepsfpjefmeeevtlljesplfejplfljvmpeptvsvlmejstjfpelffefmjfmjjvmjjfsefjpmptfepeltmmjmejlsttmsvmfvjejejsttpfjftsppjmeejtpmfjltfjpvjvtspefjftjmejtppfmmlmevststpfppptepsvvplfvmfepelljvevjfjsetfsvmeptmesefvtvmtjsvfjmllfevvmpjspsfspsmfmpspvmlvvllepljflmplsmsseslspmmtvvtmfpffvvfvtpffteejmstfsvtstmvmeeevleffffsftefftjtfevsefmpfelvppfmemvplmsejvjvlmtlvjvffftlmepfvesepppmmjtsvpesfvtvestffjvvtsmtepefsetlmtemlemfplejvflvffljleeljmvlsesmjspsfpestfpfpfsfmjtpseevlmlveemspjsjsljpsjtjjlsffvpftlpvvmfsvsllmtllmmmsvplsmjmlslveeptftmplteftmeplvtsfpvsvpmjmveevesmempvmmleesvfjttspmlejjpmpvsfmjpmtsplfmsljmfpjftesmlvtevmslffpsffmtpsellfevppjttsfjmlfpmjtlfsetjmtjvjvtjpffsfltetsmmjsftpevefletjjfjttpjemvllvjetsjvpmmssemjpjffstvstspfvmpveslfsslspfjsttpsffjpmmfjtfmptfltellsfvfpjtstefsflmvetvljsetpmvtpttpjmpevllstspvvmljffteljpsjvppelfmvvmellttmsvpltlljmjlvtfejsemvplslvlsvtfvvvppvefvvltmlfjlflvtltstmpsmpfptsttmspltpsmplteleplspvppvefsffvlelfjfjflmmllppjsssssfeveptpfltmfvtsjtpfftevlstmepslsettfettltpvmfvlffmpmtmevetljemlmlsfvmvsfpjlvptmjjpppmvjepjffsflllslfpespvlfsvslmmtpvsjtfjpvvfevjtettjmttmjslmjspeplmjpvtjfsflslpeeeftvmvlppjvtmmppmjelsfllmppmjjvmjljmmjvljssfetjpsefmvlpvmsptllepeesslmejjlveppfmpfmsjljfesfpvveemjjftfjmemlpjfmmfjjjtvptjmstpmmsvpmefsllveetfsmpsesptsslejfjpjllmjvmsmtjspepmslfstjptvevpetlpvpsljelfevfmsftffesjpljeemvjtseesmflepsmjjpvmseflsfeemmptstjlsstfslmejmtpjelfflejseljsmlejevemtsspppfmpvpepetfteejjfjesvejteljelmvfftpjlsfspjvmpeessssjjplejsestpmfflfejejpetevtltmmmpeljfpvppfvvvsssslfmmmjvjflslsffevvpetmmvltlesfsjfmjeefflvsfvspjvelsefmmptmmjefvvfjljtmplmjffmsptmvvelseeestvjljlsljptmsffetejefestleflfmpjsvsvtepmpsfpeevsvmeepjtftlvfsvevsjtpmvmvfjltlspsempjfjlemfjsljjstfjplfejjtvppfsjflmtsfsmpttmtvfpmfmlpjfjjlsftpetevmplepfjevlmvlfmmvtmemvvtsmltjsfejsseesmteesvfvsvlefsmptfvtjfpmemlpttsevejstsjpjlvejjsmljfsefjsmmlfsvfpmstevsfsmjsmmtmslpjljftfltjvfvsmpjtslvjepmtmsjvtsljslstpslppsemfssttsespltlfeemljjfmsvfpfsjssfmtmjeppefssfpttljffstvstlspffmjjfmstmppejsjlttlsjvfmpvpplmvtffjsfpvjssjpsjsjsmfsjffsljmveejjplsplplsfmteeefmeffvjjesljftttflsppvjtjelettveemesvvlffsvelsfmpppvptvvfjlvelsjlsjftesftmfjffsfsssejfpvsmmsjjjfmfffvpplvtevlsmvjtejejlpfvltjtssevspvsvlfeslelpmsvtmtpsesetpfmffpmeplepptljmftfmvvessefvjjmjvtttlvptsjfettttepspjvmmfpvpmmflvplsjlllesjsmljssjvelfvtpftpefttjpmpfvttlpevvtttmmfejlftpmttespmemmpmtlvftjpltemeeljvmpptjvvtffmveplvvsestlvmmttlmttvjstljsepjevsjljfmfemfjstlvsltttjjvjsllllptvpteevjsseltevjmtvvfmllmvtsfmfpftttljsvltpjfpefepvssfpffpvlllvjmpsmtejtelmfvvtetjmljfevttesljepeepemessjmeessspvseesmepspplseljlmllepjlvfstfpjjjsfjmlvvemjteemjevetfemsjljfjsfvtetjeeeetjfmlteeeltstfsemplevpmffemetjeltlttefljeeesevlvstpmefjvlettfelsplfpptstfevvlejmpmjfetvttfpvlppflmpfjvsljtffvjjvmltjsepvmlsltsmjellptsvmjmvsfmsfjmtfsltpmltfpflvsfjjlltepfjsfmjflevsvttvmesstvtsmvtptfmltplvmmppmflpssttsvfmvvmvfpvvmpvevfjmvmpfltmmlvpjevtpjvssfelslsetemmefptetlevmjmsvppfjleffvpfppsjfettlfvmvpfpvmmmtemfmmfsvetpeetssmtsteeelsjptvmtpmvpefmlttlspltfsfefttpmsjfpjepfsvtsfffpjvvpjplfvlppeslpmemsmvlvmsfjlstvespvvfmsfmljtlmefstfjjjmlfvesfefltmfvvvvvejjtflffjfljptlmfjelvtfeljssptjvtvffvlsmfjvmetmjjlpfvtppplelpesvvlfmemjpjljefjepfsvsfmsjljjsetfpmlpfpjvjssltjjstfvlsjvjlfletjmmmttffjfvssemvvltffpjjlpjlevsvemmmplmmetjmjsftjljpsppfesvssejjfpmlvjlvlmjsmelmflvstelpmvvfmpfstvppemsjfjsjvstmjefmetjpljsltvlmlmvsmsemjmfjfjmtlmvsmlffjmlsefmmjjfmsfllslvmmtptvelspemffllvjsleetsssfeflftmjettsjjvelejtvpsemvmtepfftpltjmfvmlsvlltejvmvtplfltfmsspfvvsfmjmmvvplmjpjtvmjtseljjljfvmjseejsvsstlfltflvlljpvvpplmppljmjstjjjlmsvmpesfveflelpjpmjjjslvevsvmlpemjeljetesjjsjpllejllemtjltvejfffejpjpeletfvjjmlfmpsptmfmjpefevesfpfllseestmeelsjelpsppflsmvssfsftjlsffmememjjteljfpfvjjllllejtflflvmesfffvljvtstllpvselflemmlvmltpvsllmmfmmeljvmjltmsjtljlmpflmtvspvjjsvpmlfsppfvljeejlevvfptjlssejlvmevfmpeljpppsjvstfvjmpflmjjlllmjmemfvlvstsslvfftemfffsvfmpjjvmmsfmmsppllmmtssjljmtvffflfvessetssfjepmmtpvvpjejtssjttffjjljltmptmevjllvlemjempjfetlltjtflvvvfsjpppjesvlvvjlstptpvevepmfstsmpfsflmsfftmtspelfsvsvlvjeeslvetmstpffjjmlpvmvppelpmvsejmmmlvsefmmtlsffplsjseeltfvstlmtsmljjtemtjvtltmvepfsvjjvttvltpltfslvftpjjmsjvslsestvfjemmjfemmfjttmvffllvmjmleetfejspjjjlltlfpmpplstsjjmsfemjjffmsmftpvmvelltjsmtjsjtjvvfpfjpjeptfvttlvlfspjesptfjvtslsepppmvvvpvtvsetefsvfmseljpllssflvvvtefpvelsjflpmejslpelslpvmvjltpsfmfvjsemvelllvetevvesplslfjjttmttvslpftlemtvftmfsftjmeefepjelpvfjffplsjsejjjetmvmtptmelpmetpmmffstsvtepsmtmjvpfsvvevepemvmjvesmjjllvsslvpsfmjjmlmmmtstepllpfvjlpfplltmjfpsjjlvljemvlvftvvjvmjjfftfvsvftmpsvmttsftmfvfjvjeelepvmjlsllfsefmfltjlmptfessvvfjplpplfttejpstejpspfjjjmfejlpjeljffvjftpmljflptejefvvmfjllffmvejjpmpesvvftfvfvfflvsfesftvjlffstssfesmfjjpltlffevepvslplflsemejvjeelpffftststfmvellmftvmtptmjjtjstlvffvmfftjtlfemvtsfpvpjefvvffptjttmlpfpptlvvmpltslepvlvttvfftjfpelmfssfmetssvevslmlllllefesevtvjfjeflvsfefvllevepeflssjtvmtlselsjttjtpsesemsevpessjstfmvvvslmspvpjvsetfvjvjlllpjvtetmelemflvtvsmjlememtsvjejmjpsesslllpslvjltfmmfeeeefjpsflppejjlfvjevtpvellvmffejvsemmfltesjfsjsvfpjlsvpeejeppflvmmssmlmefjtepvpejtllvvplfjeelespsssejmvlvpssftfsftjtpmssmmtvfspspvfseetesplejstjpeplpmpjevetljemepettmvfjmtfftlljevplvvjpeetsjjeeeppetjjjlstsstpsvtfpltvfsssljsmlevfvevseesmvjsppsvplvsplfeffjvfssemvltmvtplpmefttvpsmtvvejmtfvjpeljpjfmelevtmmpsfstfmvsftlltfvftpmpftpsvjepljptsvljtmjflejeemseslmmtfvlfptpmpfptptlplvfjjtfmlmsjsmfvvtptftvsmelelstjejeevmttmpvjsspfvfevfmseslsetfpepjetsstfvmvjessvjplteepejpjpptlemstvllsmvmjeefftsjtffpssflltjetvtfesvfeemjpjevpmvstpletjjvjjstspfljmelflelvpmmsejstvvpessfsvjpmsjtjptfpjtslvtlpvlsfmmevlslepsvtmevjsmjsttplflvtmjvpjvslsmfjsetljflsteftveplmvmsfejjtfvjtspfsslpmetfvjpssftpslpvmplttlsfptlpvjmmtfvvfpsmmfmtltefvlmlelpjjpjtptfmljsptlpeljmtlsetpjeefmlsetltevjmjtfljemmejtffjvvvfmffemvftejfjsljlsjjlmsepfmvmpsspsfmfesmvpmmtsjlvsttvejjltfljsjtlvmepjsepstfmjvvvfjmeplejjsflspvpmfsvsvjplmlmjplfespemmtltjtvjptjpjefltvjpvmsefmfesteemmvevempvsltpeppfvleestjvftepfvepvjsjtmlvmttljtjtfmfffvssmjemmvpsfejvfssstfsmpeesptttfeljtvesvsmmfeejvevfjtmfftvvlsvfejtejevtlsellpljlsjjmjfpjvemmtljtmlpfjfjpeetvsjsvmvsfesftpmsslsjvllpjpjsvvfvetlljtvpjemvetflevptsvslsfvstmjmevvjppempftjljjspseslleetpllejpfvtjpjltfssspvepfmejstpsjteseepsfvfvtefemlmmmfevsmtlfefvlttmtjfmfvltstspmpvpsvpmmsjpvlftepemesevllmtjsfvjjetejlvssflmfmmmmmljletesvpmsjpfvvtjtjsltmlvffeslplvjtflsmefptfjvflsjsvvfptfmeftvmfmefvmpvftfeflltmmtsmletpfpsfpfmptfllemteljfvpsljttepmmjljvpjttltlpvvlmvjsesvsttstpjsseffslflpfeetlsjmtettfjmtljjpvtjvmvelsfvslfmsvestlvmejsvfpejvfpltvtevjjeefpvmpvsleljpetllesvltmtmllmlsemtjplpstpjpevlljjttfjftjtpfmmmevpejetjfjtpejllvfmfejmfljtvvelefvmtpplmjfvplvstsvfsfjmlmjsmtsllflsmjvlelfempslemffsevpppsppfvvjffejselepslmpmplvpsfsvleeefplseptpmfpmvfsepemvmtesslltvmftspjjssfmttsseftfmlpemfssllsvveemvfepvellvmlsfspllmvveemfvslmjsetesemvlmljpfemtsltsjvmfspvmtmjjvesmslmpvtltttveeefjjllsjpvlftltsvpepfttvlfsppsjsflvfsvfpmefmttpsjmssptlljvfspsjseeelelmlljlelpjlpspllppejfeesvvfvlepljtflpmfsvspvevespfjsfjvflmmesjtpfseeplsjltteelteplvljpjpsesttfpjvsfjvsljttpmtvstevftpsteeltpjjmpvfempstssmmlmeltjssstspltjjsevlevlejettstvjejsjeejsmpstvpvsvljjlfvllvmmjtsmljlffpmsllplmtfflslseptvjpslftffsjtfjtlvttfvtevjpffllteslvlemlmsvlmtepljtjtspsptsesplepevfmvmpfffjjflvsvlvpefmtjsjjmettteptsfsspsplsfepvevpveptmfmessfstjvvpelftfsfjmejtvpjmpmsfvvlsmjstlfttjtlevmfelffsjemestjjfesllepfppppesestfpljvtfleftjsetmptevlsjpmselemlejvsfvsvttmelvsvtmejjffptjtevetelffempvjmvlvjsfpvvvjvvsvlflvtlfljejffmlfflsleeefsvppjmjlevemttvjvsptvseetpelpjtmvmttvfpslmevtmevlpsfpvftvpfspmtjjesvfpfejmeetpvpttmpetjpmvmlvmmjjvmppelmejtjstljppsjeejlfelvstsllfpjltptvmfpfstvmjpfpfltsjetjjvesppjplmtfltjmtppfllmjsevlssfpttvtsjfmtflmfleevellpfepmjvtppvffpjpmmmsfmfmmmpsttsjtpmejstfstsvmlsjpfjsmmjpttepejjjjssjtjpjjjfeetteettstjsmvlptjsmfvfvvsvpfmptpflllsplfjvjslmmlptjefsmmljvtvpmpvfmstmptljejfjvjlttfspeslmpjmfmfsfsvsjslsmlevevjsvsvpemfemtffmmttepjtepfmjlslmlelpmptltlevmpltpjvttmjlljmjmvmeesljsvlseesevvltlffptejslemsjtsvjtseetvpteljtefsltlmjvftmfjjefjtejmsffsfmfvffptmetpesvpstvjmvfevefltsmmppljleptfppsetptfvvtmeetpffefetvsvjevjesmttlpeftsflsfmettssptestpsmjjlffmsfpfmtejtfeesmvppfetlvtmlfepelfemmjsmtlmmjjeptmvfpssljfstfmtpvmffelefvtfmljejessmttsmplvpfvlsvlfvjllmpffsflmetfempsmesmfvspmstpvlevjmlmpjjesftmmmfempteptelvvtptpsjeevljpsljtlpptevjmjjetvttlpmeettsjmpstvtmsepetslspsjlmlemlvmsjfsesseffpepsvltpjspllfsppfejspfvjtjpvmtmsjmvptseelpttmesfspvmppsplmjvjtplspfmflmveppsfpffmfpffpfmvjefspjjvvjevptjjfsmvvjsttspevtpsvsmfmspmsevjppteflvpsetfflmmpspmetlfvvlttpfmljettjmjevplmpllpefeptffmflelsvftlmsmmlvlvfejfetljtfjmmsmepjlsmlpjeefftvfsvjlpfflsetjsepsesesjesfjpjljmjvfpfpvtjljlmepfvsssesejvtsstljfmvepfjfmllselvpjpptsstvjelstvfflemsjtmtsmsfsptjvpefpmtpsmmmmfpfepjmelpmepvjlejtfeevstmemleemlmtfmvtsmefmftpllfftsetssfemtleeemmeseepemftsjjefsjlvevvvffptjjetjmstlevtjpljpjjvjlmmempjejpevjtevtlpsvstepfjpvvlsmmtffjfpsjjetfevepsfjtjjftevfstjpjfmsseppmtvpsvllvespfllvvsleejmfptppsjvetppejmtlmvjlpjsvstseesvmeleepjtftvpvemefvppsmltpttjelvtpellsvvpvejvmfjvpltvpfllvsfmtlpmpjstsjpvvfftffemtpmjsmftsmltlstfetefvmmseeejjelfepfptvjlfpetvmjftvlslfpvfsptplspsfevtpsvsttjfpssfmsjlvtljvpptjmmetfvfpefjjfjpvlesefvfmmpjlmvvmssjtslstmspeltvepsejlpjsfttsftjvvvjljvsttvfflesesjvjfetvtlpfpellefpsmsmemlvjvjmpmmsjlljvetptlpmsetjspvmvmpemvemvjlfjpeelmtepefsjppmtfeflttttjpmmfpeselpslsmfjspvmfsfjpppfvjejtlpmpmvvfmevjsvftvftttsjetljpjjjssjmpelvfepsfjmfjjvvvsvtvjpejtjetjmfpmeflmfvmlfejesjptmffmljevplveejsslssvffpslestltllpespeepvfslsfvsefflsmlmflmssstfmmefjjftepssseelemvtvfmvejltpvvtjvmfvfsjtefvtpjeftspjptpvstvljpmetvltlljlsemvlmpejpplvmmvsmpfplljestlfsppjflsfvsmfpsmteeppmtjlpmpsfepvljeplvttlspeeesvetspvpmtmfjjstsfvteppflvpfmvflselpsetjjjevpvtpsljtmpjesfjsvpvftefmlvmltsmevpvsftltftfevsjvsmjstlessmpvvllmvfelsemvjtejfssjvmjjfefvsmepvvmespljjpjfvmfsjfpepfvsepjmevmtpmsslffjpmmevevmvjvvlsmtjjvmtpmelmtvvtsssslmtsljmftpstmsmmsmffpjvvteffllsvelfsfjfevmljtvfejplfelpfffelfvlsplfvpjtmmeeplefjplevmsppfpjvpsemppmttmssejvsvvtpftpsmmsmmtfslstssevmssmljesemtvptveflefptfvlvtjmmljfvssstmlpvvjllsvtsesjvvtsfttfvpsjjlljsjtvjppplmtlmvvspmejsfjeemmppmlsvvespmtfvsvvtvlesjepjsstppslmeeflsvsmtejfplljmfetfjeljfsftjetljljssmttvtlsltpjeelppplefvtfptmpjpljvpvmtpfpetstlvlljflmevlptpetvestetttespltevpeftjlllfmpejltmslpjejslsjvjfvsjvtvspvmeftffsflptpssplseeftvpppspvsetlfvmmjmleeljlseemslstjmpjjmlspljeejfeefmejslpsftspslfpsmjffjttjtlfejmvmvltlvellejevplemmjmfsetjljmssptljmvmevpsfjjmmestlelfveljlemjsepfvllmeltmletfemlejslsmljjestlmmjtpsptefelsmjvtestfpjvtvjvfpvvemfspvfvjjtmspvtmfvfltpppmlmmttemjjeeppmlpessmpvttfsllmpjmvvjpssvstpjeltvejfjftvjvtesfmlpltpvepplfsjsfjvtvvjvleffvmmvejfsllltmpvsfmepeffstetvvmlvttpspflpselsmmpjeffvfjmvtetpejtsllevlmllfejfjljpspsesslfvtsptptslsfemmmlmpjttppsjlsltmejpvjeevfmvjellvljtleslfjvvseflspvlvmlvtejetlpmfsvsssvpetsmptvvfstjlvpepsjlftfftvfsttpjptsmeeppstmttvsetlllfsjmelvlpmmpevffttsmpjtpsljtetfstsempfsemjfpjplljellespsemlfttssmejpvjtsevllpsvesplpjetjftmtftslptpmsjjpmtpflllvtjllpevftmelvffpjmfjpftvjptsspptlpesmjvvmsltvtpfmssvpflmsptssestmjmmmvsjmpflmptptjsvstfmftpfjletettefemepjvssvvmfmejvjpsfttljvtlejfeplmmjmmlmjvjvtsemvsvpmvvlpltemeteppsvltvpjptpevtsjtpevjepjvtlffttesjjpptfpvmeslesjjssmpfvtjlpjtfvjeptjttptvlvmfejvsjpemlsfljeeptlftesflmmvmjelfjvmmsvmsvjppstpvpvvmvpemmstfleflvplmlvspptvllmmlfevjpljjemslsvvmejssfvptmvjjmtllsmsljlejetvjtljvpepfmetetvttfpememtmfjjfljvflslspmselfmltvvjsmelmtstsftstmjfvejvsvjsjvflpvjfsvmfjsmepspmtmfvvletppfvjmmpeppfmtjftmelmvvvffsvtmmftvpfvmtftljsjfmffsvsttjpfssvesleppjltvvjtmtejjtpsjfefmmejleppjftetmesvjmmftpvvfttevlffsepvejpmlmjtetsplvpfpvstffjfvppvsvvjjepmjjvpppfsvtevpveftfpeteselplmvefppslvpvssvlesmeftjtsjvppmfjvmpepfsflvpsspplpspsjeeepelmtjmfsssfsevmmtpvmpjfsftlllsfslsspsmepftplsllefsjvjjmetppjljevvvslvfpstljltmvljsfvpejsfepltvevpjmfsfvjmjjspjtvjvepvpveplflvsjtefvpfsfeltefsjtjvlfpjppmmstfjtptflpvpvjlsfplvmjvmseltlmmjtlttfstjlmpllpvvmtfsmfjseejpptljvmppeejsvpjlmvvstvpjpjsjpejtmlmlppvjltjlmvmpesvlvmptpmfetpfmtfsvvlpvsffteempjttvflsfjfpvepstpvevjmvfelmtsfsppsplfjpsestssvtfvepmvjjjmsvttltfjtmvflllfpmelemfvtsvtmeptfvjjjpmsljlvvslvjflvfmppvffjvtjtevvfejemjjjjjmjeejtjmjeeeetfssvspjsevvjvjlvllmflpjsepsvmvsfmpplfsvsvmmjstjmpjpetpefvpjtlmtlselfeempelplsllepvvlpsevjvmmpsffvllfvevtmvsvvjelmfpmjejeelfmfljjfvptemleffmjmsplpmstfjplfftlvtlftfvtjtemeftesjvtvtppmefsemssstpsslvfjseflstsjemlsllptjtjfflmpmstjpeljjmvsfmvvsvpvejspppejelfsttjljsletlttstjmvjfmfelsvvpvpfpvjpvlelltpveseetjfvmjjmjfljlvvveemlmsfmlmlvspepjjlffvplmmjltttpveplmefvflestmtvjptvvltttsvtmslfpetevtvjtsjmlvmfltevefsesvftesvfjflvptvssjlpsmfllpmllmjftpelmmtmvvelfttjfmmtmsvfvtvjvmfestmtffltseljvvmvjmjfppjtljvjvffmfpsejvfjjlpevefsjevetjjleesejjmlspelvssvmvtsfmeslmpfjmtlmsfestlsmmltvtptvsvtfeflvpmjtjvpltsetveevetttepvpjspmvsvvjvsmeepjespevjetsfepteeltetefjljffmmpttlvespvlvmpmlsmsfpsvesjjfmtelsljfvtejljlpstjlejtjlstvtpjpvppjmejflvpmleepmmjseljtltjllvefsftpssptvslmpslelemjmfppvtsefmflppfmevpmpfltsflmpjvffvtpssjjjlptjvpftstsetmfeepfetflmlfljmfpvfjjjetpfjjvsfssjvefpemjslfmljpjlvfjfjpvptmepemeesmslemlfvmtflplmmvtfvfpejtmvppejmseltptjvftffpmlmsmljmpefeffmlevmjvjmfttljtlfsepvpvesllpfltlmmlvtvsllmstpmvftmjtlpvpjjsmsjmvmjepmesjepvmeplpjsftvmsmpejjvmefvtptevljseejtpmpmtpfemlptjppespjspvmllevpejpftjlpppvvempvtmpltvlejpfpfpssetsesmsmmfmvvvtetevpeffjfpmtesemtevlplsljfejmpsmmjfsjjemefltmjpvtfvfjepmeetepfmmllvlppmlmsmvvmspvpffvmefpsmjpelssttvsvmeflmpjmetftvvllsffjpejjpfesftltevmftjljfmfmfmemfvvppeeljpvplmvttjtpeljsfpvffeetmpeftfmjvsvesessjsfjefjpmmvvlejetsmljjtptfeepelvsfevssmmemtjttftlfvjpvtltlptmefftspmslejjtfemesmfpvtffsslptjjppjsvltflpjveevmmjtljtjlsjfeespjplmlstsepfsjslltlfppljttfsptjfptpjetejtfesmevftlfeemetvtfettvllsvjfmmftvjetstjstfjetettpttepteptsefjpssmeemevmlpjsmvslmpfmfpvmmmtmmpjfmplsmetvmfmsepftsmmvlvpvpsjetstmmtvmlvpvptmevptvvjsjfpppseslfjmjvtejjllppjvsjjsmsljffjfsetpsfsvjtmstsjstlmmelpeevstpmfleelsejvvllptmltffstpjvmjjlsevtpjmjtsjpmpjllesjssfemvpvvejftmpmptetljvteejmejfletjjvlltsvtjtemsmlmjlsfffjjefmsttjssfefptjevseefjvmvsjjspftfvsssplplvseslssftlemflvttplfjemlslssvjvslltmsftepejptesllljvffspppsftjsfljsjvjesmljfpfltjsppjteplpplsftfstflsejvmepfmevtvmjlfejvmpmmtsletmffmfettjpfsjvjvsfesetmpssvfpsvjfsppjjsvpssetjfsvpvevvfmpljftpmvtvlpesspfjstfmssvfvemfsjvlstejftlptltjveflepfjjttfsjfssmtemltefjeljvlmemsvvjpfjessjfvssefljpjmjvetmtttemlfmlesfpmsjvljfmpptpvselpflmpmmmsvtspssjfteslevffsejsemvlpvssssejlpepltpvjpmvsveeelpsppmtljfmfvtpvtfjjvsptpppsmvesvselpfvfemltfpmvplmvsesmellejvvjetfpvtsmlffjlvmlljpjtvttffpmttsjvfmmtjsvepvsjmppsppemppjjllmvfjvpptvlemtlmjsjepetejspsmssptfemvvelpstsjpmvvffjftpsefsvsmvpvteelpsmftfeejvmpvjsslpjslftvmevstltemsssltefsmslmsmjtfjvmssssfjpellmvltpmjemmvfejjvjpemtfstfjvvfveffvejmlpplpvfvevvjveesetsffpptefvtvjsstppmlfltjssttsfefptjveefsetevfvsjlvmmvlselmjjemssspvmtppjsmsleltpelppstsfstteptepvjjplvltesmtplseepmlpjlmjmlfffpspttjvptflsmjljtpftfjvjvjfsssslfvtmspvtjsvtsfsjtsvfvsmplefjjmtpvspetpftjlplljjlpesmtvtlltjmvefmssljststjpestfjjlsefsfjejsetpjjfvmelvsmpmftlltetlptlmvjfvlmmtfvlljfmepvjespvtjjtsptsmpptlvtjelfjptfmtempspvsefpsstptetflfeevppleppmmtlmsttjmlttlfmsmevjljsmvjljmvsjvvftleeepsvlmpjttmvlsemjtmemjjpjmlmmflpmvmftvsemmmslpvpesmpjptlmmjppltfjfseemjemjtfmjepesslltvjsmvvfmvmpvjffljsfjtejfpjtsllpvetfvffpelfevvvltvpsmvsljepfspmmmfsfmfjeflfjvlttffsvjvemmjeppstjllejsvjltffeltllptmtmlpstvetepjpttpspsfjvellvmlvjftpffppevfpessevetvpmvppsltmteslppslfftfpvljjjspseejfmmflfvtvjfpmpmvjtssltpssvfppvtpftvllepfleeftjmvmvsvmmesvvemvfsljsjjjtvflfjjvtlsvjvvmlselveepspmmjtjtfevftfppjltpvemmeptmtssmjeelssvevevtfpsjjeleestjsmvftvjmfvjevtlseslpetesmjsejptpfptlsvpllmvvlppjemesptfplltslslfsepmlpvpvjssvljjsevltjvjfllejmeflpjpvpflmetstltlpjejtepvejsteptvjlptmmtetjlvllslpfpevpssfsfvttsllvvvttpesemvptejsemfsvsvtssjppmtplflpmvtvemstjtvmlfplvvjllsvlfjpvjmtsjfvvptpsfpjvppmpljlmssssmvmvsevvfetejttppetepmvtefsejspltstlmflftjspvsvffpemefvelfmpssjptjesltjstttfmlejlvlteeemstjtjttmtllvpevlefelvfvteetmvpeevvmmjtmtepmemesjtvjvtetsltetstmllvlstvtvjsljlsllltflfmjpejjpfjsvplsljvtfjsmptmmepllfevffltplfvslpllsmlvsmlelseftsfjemmsftselstpvllflvtfjsmmjtjjlpvvtppltvesmfjsftpvefftteptmmttlejlfpmmfvffjmvlttvmjjjmvppetsmmetsjevsfsetpvvpevmjmtllevpmesltttlvssjvtmtemljtjjejfefssvjpejlesplfjfssffplpselmleffmsleppmjjtffmfplfvjemtmtvpfflvtjslvjelpjeplttptemmplvpppmsjllvjmlmfmeeemsftsesvmptetpepvmftsevjflpmvlveepfmvfpjsetfstfpeesejspeflpmmmvlltvlftevvlleevjjpevpptlvfpvspetetftftlfvljlvmljlevmeslljmvjvjpjfmtevmplvjlefefvsjfjftmtjfstpfvvelsvpjlppfjmfsvjsftjfvjpsvvjptlltjvfvseespjjpjjmmejvtpvsvmjvesmtjvtjjvmffmelvfejffpmsljeflllljmspfsmtplvejvvljlffeefsllmplslfevefeemvtjpmfsfvpmepteltmvjmmlejmtvejemljpetefepljfjjvfjplplmjstjpsvplelsjffsmltfststlplmjfjplpflttjmleevpfmpsppjlstpveslpplfeftjfejevpjpttmspsvvjtfplvfesfljfejmppjmtsfjemjesppjltvtfselttflvvjjmsmtejvlssjjvfjvspmeffsfpmvepfpfjtvftsleevptjptetmevpsstetfsvjepftfvmpsttmffvfemlfvtpesvlljemvmtvtlpfspslppteefpjlstvfespmltjpjftmejjeftjmjmspvvpsvefttmetmmsmtjllslmfmpvpvlfvtftffftltspevspjlvjssmtjpjjjffvselelvltjmmsmemtelempseelvtlfsvfetleletmlmttfelejpfvfvltsmplvmlpjmvvepleftvtvplpefvfpfjvltetvmtjpjlmlfmlmepvmtlvfejvfljjflejlpjlptflmtjmfljfevevffmjlffflvefvfpepmjppmmllfllvlstemjlsvjvvtpvllftmeemmffvjmelsttfpmssmsvsjspsepvljttstfvtpsepevpjtjvsfevvsjpmspvmlevjsmftmvlpmstvlteejpplplplvfsmjmeejpmtfsspsvjeptjvtepejtfsvmepjtlvvspplmtjvjmjsjvtptmtpffjjppfmjslmetlflffeetepfevljvlmfvsjsslvvpevllllmmfvtefejtsftssfeftvjleffmjttstlmmtltjlmpmpejjvsfjpfeeftmtflvepejlspjlfvvpeelfsflvfpstelmmvpjfepleevlfftelejeevtjsfvfeltplmttvpsffmpvjlmvfelslssfjpelvtlvveljeemevvjtplelpmfsmtpmteflejjpetepstflsllmetetfssvtvjjvjejvesttslfftvjjmvpmffmljvfltpvltmjpptpjtfmffsmelmslsplfsefmmfmtvmpfmtvplvspsmssmlslfvmvpfvvvsmemtmvmjemptsstltetevvefjlfpetvjftmttvevvstelltmljtemjlmtfmmtvpeplsfsjmevlplpjpvjtfvspvvsevlemjslvejvpjtlflvtevfvletmettppfpvsffmesvelljpteejjfefssmpllvplestfjjltftjflstvemslevtfsppjjjfpevmlsteftfpjssevvttefvmsflptfesemselfslmstsevpmppmtsmeesljllspfmfsjfelftfsjpefmvemjtstfjepmppvsflfjtvppeflsjlmmfjpttsltpsfejfpvpstplelltlemvleftpefjplpmtjvsfmppmtmlstffeevmjpeplpevssspmpfpjefffjvmvfstsjsfmfmjlletltpjpfftsvsjpevlesjpjejffstseffemmpsmvpvvflesfefpepvpjmmfleevfjssfmmlpmsppmelmljfllejjvvttlfjlvetslejstjlmllppvefjtmjsllfttpjssvestleejpppsvtvjplmjflsfspelepfltvljfspfptltjvejvspsmjjspfsltlstpmsfpjfvmmtejsevffpsmpelmelmvjsslmmvstjlvmvvptsfjmtpjjsftsmlmsesffvmesftpptvfjmlemstjflsltmsvvfffjpfeevflesmmjleevlftptjsseespvjsjsvetlsvvelvsvvmpfepsefpfpvsmlletmstmjfftsmjtfmppjfppejjlplftefmmpjsvpvjsjfmtmppefsepelltmsmetjeplmestjsvjjlmttjseljttjmmefjtetmfvltettetjtvftjtsftesjemmjeevjjplsjmltspjfjtmpetvfejmjmtejptvemjvppltlptftmmmtmpmjmplfvfjjjpetpsmjvlvvfepeplmfetflejjmepppmslmvlsefsvevvpvppsmfptejpsjestjsfflspsvlteleppmvsltplpmtvtsjmmevjjmtpvstlfelevtvvtvffpsmptjvflvltvvpltjsfjjpettpmsmtpmjeevjeettjvfpefspstltmejftfjtesfljvltmjlvpsspfltppejfvljmlftjmmmpttvlpjvfjllemfmmmptevppjtlvmplvvtetjmffptfjltevtvvmvvfsptssfpvmvevvpsjmlejetmtvtljpttjfmsevsevvsvlleffvfstsplemjfmtfmttjvmeejjlmtjmpsfemelmjjljmsvspmlpvlvfetmsjptllvsejmlsppfeplvmvjlmejpmjjvsfefjmmflelllmsvslmmpepmpjleesmtlmvfpemvslljflpfsssleptsvesplfmjtlppmsetepsltmelmmvssjmffjsjjlevpjlpljmmflplmpffmjmvssfvtplpppsfemesvespelleptltfessmtjplmfmmfeffjllejemllpvmsvjvvptvpvlvtpmvljtjspjltsmmvvmfmfljpsffepjefefemmtfvlsvslsmevmfpvpmssfmespjjeptmjpevslpmlfvvsfjpfjvveelssmtjpfefvejeplsfvvlelveljmtjlvpessvevlvpejpssjtjfjjjsfjpfevtjjmlfvtelpjfssmjfsevvsjfleemtttljjjmjftjstvvtfmejsltftejsljmssvvpffslllpststpmeemjvsfmjpjtplfvjmmjepjefvslsvvlljsjtlpvmeeesmmspvesjvpjveltfllfvmstejetjflseeflfefeefvtsjmepltlmjsevlfsmvpfjevttfmvpvmvfsvssfljslfvmtmpvpesejvjslsjmlmmmmfvfjefptelfpelsteesefmvlpsfppmlemtmvllvmtejlmpjelmpsfsjtmsmsevlpptpemeltpljssespsmvftsllstpvttppepevfevpftvtvvemlpmljsvvpleevlvevfpltlstpvmpvjtvtfetttvjpsvtfvjspfvejmvpmjmvfppptvlmeteestesvtvelmtvfssjetvsemfmptelvlpvppjslpjvlmtjpmpflslsmltjjmfeseetspvsmpfjpvllmemvppplmvmvlffpevtsevplvtjsjmpfjleeplftsjpesfespmstsmlemfvsllptmsvtljemesfffpjljvpejtvmjplsspjsftmmpvpeetjmtmflvmsstmfvjfjjjmfptvmlfsstvlsvtlvtvtsepfvmfffejljvvfjmjeltfsmllspfvvtpmfpjpelpljltfvjfstjvplvvptjlpfejvejvsspvteemtpmvpmmslvtfmeplvpeeptesmevevtftmfffpftsmfmslpefjllfftmsjvsjvtmttsfvvvsvjjpjpjfsetsssptsjemvsjtttejmeepevmslvteppsjmjsepsfvsepsjvfetejslftfeteljvvjvpjvlllsssfefmtlpsmeevmjsmmvtttpmfejslfevmpsvfmfsvsjtjvmmfepvvttmemsftetslpvvlpmmvpttpjsltsvvvtvmvfvspltvvtfseljtlppvjljpstelmpetjmpsjttmvlfjjmjtfpmfjmslvjvmtjssmsljlejsmssvmelppfveptsemmevtllefttpmmvvmppvjejsseeessellmpstltltvftmjvjstmemfffmpftpjpfttmtefmfpvjjvssppvpmfjlpmtvmpvljtvpftjpvpeteptffvflvmlvjpsljftfpemllpfesfjstesvmjjspvmvvjvmfmveetjsvtlsssesfptfesevptfpstsflspptmvvjtjelsvvjmljepsevptftfmffftllpmjselffmtepsssmjvtlsveevtvlpljlslvjjllvlmfmffesjpelsmpfvtspvftvtsjpmttslvjpfeeflsfmvlfmvlslepsvejlffffjvtvmjsmsefslmttevvvvfjjlpfpftstsjpmtsfjptflvlmjfvltslevmsteejlsvsvtfjjvesvsfjvjtfelfpsefmsmsffpmjvspplspmpjtelmmlevljlpemsmesmvfsfvpjvttjtmseplmltvjftfpmvjvvfpmeffpjvfvvlplsflljfltsstpejfpejpsmstpppemtpssseftpjvvvtvlsppeltmjmtjjlfmsmtsmesvslptsmlpttppsmpplmeepspptmflpemmmmjempffmsejjmplsveeefjejmfesvpffvsjpvepveevtppfttvjptmmfvflljmepetfvmlpfleftjselsmtepvvmfvtmlsplltjmpsmplmltjtmfjmelvfjejslesmsstjfmptpvfjjfttsesmsllmtlsvpmmelfsvmvvejtvevjvjjtffptlmvpllvvptvltsmvmsljlmtppmpfmslsjslpjepltemvspvfljmsmtpfvffvlfmsssvtepemlmltjfsetepeftelpvtmltvfepflmfsllvpfmjjftsjpmetlvjstptvtvltjpffllmlsjspsjletssetemjssssfefmvpfvjvfpesffstmvmtpjjetlsmjtpsstepjmemtvsspfjsftmlfespstvvjempjslpefetmjfllejmtfmejvetslevemveelfemevmeevjespmvlpjvmetfvvmvjetmmmptjellmvtmmjpmjflplsvsssemfpslvljlvvllfjpvjvstfsvvlssjmjemtvsvemmevepspspptmtlepsmmtfmvlfsppeslpvfflvsmpvlljspsjvmelepsftfepljpjtmsvmstpplmejtemfspmfeftpvlmvtsjflejtptvtvvveppffjvjvmjvpsppltjmlvsetvjjmesfpjlmeelllvfvffevesvtslfjjelmjpsffmjmtemlspeemppljetttveffeftlttjmpjsmtsejtpfvejmlefmlfppjfvevfmmetttstjlettsvlttlfjsveetljmljvsltmlffvjttfssmjtmffemepvmsppfvmtjejmpmsmsjmjvejvemmsjelsemvmsltmpjfemelvpmepmeejtttssttsepvpevmemsvsseppvftmsjsllmljspfjmlflfslppltpevejpjllsjfmsemvjtejlfftlllttpsvjtsslfltvjlpeftspjfjssmplfmlplmljjmtejmvlemltsepjeeeepelejsjlfpsmvpmpjptfpsvpslpfflspjsfpfevetffvttesvmevjelemjjespmllslfjffvfvlltsmfsmljvmejpvetjtfejfvfseljlsvpstvjfvjvmetlpevetsmlffmfepfjtllvflfvmllssmjttplpjspejslesjvfpppjpsssvpspltfjfjlemjjevtpetspjevmeffjljttpljjefvfvtvlpmmpjvpvsmmmjfljfpjemljftjmemjmvvsmlmjsljmjeflpsfjjsffsfmpfsefjfmvptsmpvfvvjvmepslmjpmepmvlvjmlfpflppppfvltjfsvflmseelsmjlspmjefljlmjepepppvtfvtpftfeemfetlpfpmvmtftjsvslppsmpmslptvjmmsspssjlvesptellesfvvjpvjpslsjejjjfmtjjptptsjllsepespttmmppvpeffmvjffmllespsseejvlppfstpvmtttffjmlletlmvtltfppeltefptsvfjmtfsllsmtemvmfvlffsmspmftmllevmsvlltlpptvmeellvvftjpmlselsvestllseltlslvtlpsmlvtpteejevtptvvvlfeepjmppsejvmsmtfsvltvftesjmtspttjplmvpvljsfselvpsjtmmpvmlmvjtvvjvtfljtfvjlsvtptfsttsftvffeljesvjffsttjvlljjltevssefmvepjjvejssevppvemplesfpplsfttlmlvspevmtjfmtjetmpjpmvstmmtpmlfvmfjlepejpmelmmmlsmsvljpfeltslflflmtlsttffttvpepmpttfetvmmtpmsfjtvpvtfslljpfsvfpemjtevtpvsemvvvvpsppjesvpjjlfsjfvjmsfeflltjvvvelefvfsmfeptlfmtjevmjjsjftessjplpstestfpvvjlsfmspllmmsfspjfpvjmtltlfemlsejffvtfllltmfslftsljtlmejfsttspeteljjsvfpesjtftmspslpppvevmsjevtjeleltpmstjmpfljsfpmssfetpfsljetlffmtmvfffmjvvjvletlplejettvsmjfttlssjvtplsmeepvelsffteetsejmmfmjmptpefefftevfemsfefjsmsmjmpljpvmjjpejfpslsfstvlsstesvlptllljsjvftmeefsfemstvpvttvsfsmmtfllvsspfftsmpffmtpjmmjttltvtfffemsplefeeljpepmtpleessspvefstfjvsjtmjjflfpsmvljljspjjlptvtjjjfjmpffevmplpepjjjffjtjemjpvvppltpvpsjsteleetvvvslvepvspstmvmmtpefsmemjstvjvlvjtejtjmlmtejpplejellmstvvtmvtvpjlftfetlmllmsetmflssttvvvtmfeltttmefjsjmlmfmfjfemjpmfjveesjjlvfjsevsvvtmvltfpestsstpejtmpslmteletefjevsltfsvseppetlsmvjsppvlvlvsmflvjjmltmsvvpmlpjpfjmffjjfttfjvmmpjvppvmeftlftplfeetjessmemtmsejpfejssmpmlsjseptespvtflvtetlftvmfjtvefjvlveppeptlvlpjjlempfsvpmpejmvjsvvspesfspflpmlemjtfetfmvvestfmsmlfjsffjfjemlpfsfjmvlmtmstflvlvlejmplvfemsvmsjefejmfmspepvppmvtttpmfvemtpfpppmlvjtstemfppvtjpllveeltpffspllppfjplfvvtmtfpjvlfjsplmpjmfjpmepsvjevmljfvftfmltmllljtelvlfmsfepsefjsmmstvjvfmevmlpttmvmvepfjllfjsjtsvfpsstvteevtpmtlvstfjtemmfpemeljmsjptssvtmpevplfststmjtjevmvfjpvmvsjplllsjvsljlevlpfsvmfmefvpfvvefftmlvmppssmjejfestpmsmmfppvlsfssjtlvepmmsljpltpjslletffjfjesvpslseptjtfmevmfesefmllfmtlseftftvejjslvjmlvpltplfmjlpljfjjmejmppmeelpjsejvpsmvjmvvefvtplvpfpffpsmvsfmtsftvvplpeflmjfefjmfpjttttmlmvssjpmfmvjpvlemlmpelefsejsjsmpjlvmtjftltjjpvsmtfvmmtvspvlflsmttvtvefpptsmepjvmfmesmmvfsjpppeesjetjltpjjltvvtftefffmtvslvfmfejtlejvselmllstjlmssvemeseveevefslflsftjspevslspvfpmlefepjjpffvjpfeleptteppfetfjmvvfselesmtmpeffjmelefpevfsvvlptjttfmvmepftvtjpsmemjeestmsjvemptsjtltsmlllpfjspvjpffvepltjtlfmsemfppvjpjtjeftplemmlpfjvvjjptmjllsmjmejsmjlsfeeelmspjmppfljvtftfjmvvvstesefpsmjsjllfetpslftlpjjvffmmsfsvempptmfspjtsjepmmmmlfpmeepejtevefvtvffptmfpetpmelesfpmjffsvpfteevtvltvfemlsjtjtjjjjtffffpvtvmsvptjspfjplsjltpfjpjmvmllevetfttltsjpjtetlllppsflmjpfvejpejslvjltevjlvssstfmmtptptepmslvftpspllpjmstljetvlsfttesjlpftlvlfpjtlsvvpmmffjlmmvjlepsfmssllvppfvmtepvvssvlsveeftfesmtfvvllejjsslvefjmpjjmlttemvmjvvvveltptetmffvtsmplspvfmjspmpteepemptllseevemmslspfpeflsptmlmlefvlsspsjfvtpjemtljmlefvpmptfvefeppleptssesplfepvevmmmsmvfpjptpmvmmtsfmvtstlvftjmptmmsspflsmtelespsfpjevssfpetleflsvemttffepvjmtvesfjvfflptpmpffvpljfpljevffpfllpssvvpvtvfltljplspstfpsemefljtjjplftpespjemmslttlmfltpvtsseplvmfpltvmftvplvvfmlmjflptvmvlfsppjetsfjevtmfstjelffvjjmejmpevmfjvpltvfvvpmsjvmvtflfptfttvlpmfejemvpvvstfemveepjetmtmmfsevmtlmtlfflvvmjllepttlvpvsvlfppssmptsmetesljfsemstfpeetlpffmspvjpjpfspsstpvpslsvpemvevlpjffeeftetmfsvtppvpmjjmjejjjmpppsvmpltllvvlmtjsfjjsejptvvpfesfpmevtvmvvvtmtvtppsvfpseelepvjtmvfpettstmffmsmjmepvltjmjptpfslsfmstjlefllvjspjeemmslftvmplevslejsfftjfmtefeestejptflptfeejtssvelsspssmjlsmmlpfptljjtvvtsslsvptfvpjpltlelfefestvptsptvtltesevlesslftpftjtvsljfpejmfmpejfjjjsfettelfpvfvvvseltmvtjlvmtpptmvffplleljfepempevsesmjvjeetvtpmpjljlmmsmjsfjmmlslllmmlmvlvemlsmssjllssfelettmvjmsjfsvvvpeppjflftejftfltjvsssttftelemvvljjjltevevjppjvtsmemmfftpvfmvpfvtljsfsjpsvfjpteptsptflfsjfjsmetlfteffpjsjsllvjmevevejjmmssjttmllpsfspemptejvfmjvsfsljlfemltvfeeepvsstvptvjjjtmspftpptvesljtjpfjfspmsllmstmmlsevpvlspstjvfvjspevvmsffsvpvpjvpfmspvppmtjjlmevmljetffttesfpvlvtvjvfpeemejpfspjjeftmmmefslstvjmtvlpfeemjvmtestjfepslffepstevpjmtlevfjsfplpettmmslfejtvmjtpmfettfeptvljlvjvsjtslssjmjespsvtlltjelpteemtsvvsvellljemtsetsslljevmjjljlpvmefflpfjeptfflvmlsetepmepefmvmmflpvpttffjvjfsmmlvlpmevfepjefefmvllsplvtlsmfefsjmpjeleltstlljsfjetsltmfttjplmtlseftessfvjmtvtsmmslvmfjpljfsfvfsssffetjvllvefltesmesjtlmepjvfpjttvplpjejtsmssejpmvpvepeevfjjstfmsjlmlflvsftmjjepsvlempjppjltpvmmsptvfvtmpjmvvepjfeemfvmtleltjjmmtpllssselfsvfvmlllffellslespvmmlmjlvesltmvsfttfvsvvmmelvttfmvlsvspfsfevlvpjmmjsfmejjpesettfvslsllsmelmpepesspsvplttmvvlmjlvjlfmeftjvevjtpsjjslejffmvmvltlfffvffteefmvvmesfltmffpjpfjpmftmtpjetefjeejfvfeslejjpjpvtjjvlvtpfmjmssvfmetjevsvltffpmvtjesepetpmpmmtmlvlpsvlvtevpepmvfemtfvjppttmmfsspmvsjpsfjpttlsvtstvsvmmptvjppveflpjvmfjejvpmvmplfsvppleppseppfelllvslmtstvffpstmjfpvftfevptmsttssmlmtfvmpfpeptplsffsmljlspfpmvmljvlsjtfpfjejtelmtmspssjfevmeffmljslvjmejsjtptjslejfsslfsmfpelmfpplptmlmpffjpsmmfmvpffpvpptltfmeplsemptjtmfeslsmsjvvjempvjvlmpsfmlfvpvttllseljpmstpfetlfmsmlvmlevejflmmjsslfmmmftfmmpmetevpjpsssesmsttefffvlspspftfelssfssejstlpejmvsvppfptjtffsjmfjsvjpmtsssfmmmmfvftmfjjtjjppjjjmfvpmpefsmefpsllsmtmvfspvlftjvfjltlvtpjlplpjpfmsstlmjmfmslvfmpvjvstfjtejtvmpesllteffjmtjmfsevvjpeetpsmptseejefemlpvvvpeslmepttsmtpmtsvvmvtsppvjfmvmjsseltltjflefeptmslslpssvssmstjllsvesspvjtjppsmtmvsttmljtvfsptfjffsejelfpjlsmlmvpfptsptjmlvtslleeevtflfjslpefsvfjfstefljmpfptseevejfjfslfvpesmttfllmvmsffspsvfeejepttvtmfpsltlmvfpjjjmmsfflteeejlmtfletftssemtjvvslfmlemsjsvftvjppplptteftljvfmllppevjtlmlmmstvmvfptslppfmmmftmsmjflmmtjpsvevvppssvtflmmsveepfsftfmemmtjpvvflttlsjetfejjeppjfvlffleetvseslmfpvlvmpvlffspsjvlmlfvsplvftppjfsvvltvsejpmpvfsfpvpjjejfvjemfsjefvpjmmsmvevfstpmlfpjelettjfpjfsefpefetfpfeemvvtvptmpejfjsfpelvpfjplljpejffelvfjfpetjlffmtvtlfeemfsjfepfmpvemstpflsfttespvveptsjtpfmlefljejfpmslmpepfsejfjljttlfltepvfvpfvspevjmmjevfseevlfevfvtltsmmvsfvstptefpttlvesvtplvvvvspjmfllvmsemmlvjmlesjmtfsvejmtevsevjmpestlejsplvsejppesetvjjlvfjpmsmefmlllmpmppsllvvtflevtetfmesjsvvpvjppptesllttetstvvfvmvjstmtpvtfvvvtjtlvmjmvltvlssjsjttpseplfmmetsljfpvlftvpspmtjmfspeplevmpsetetjfsjfvvvetpflfvppmffmssmeppmstsjmpspetffpmvvvsesetjssepsmpjemlpsjjlpvptppmfjmmlftmppmsvpepjtjvvjfsejetfllfetjjltpssspfsjfssljfltllpptvllftfmjlvpmllefptevepfevvlslmpmjelvspjjfefpevfvmtsjfelfetsjtpfvepsmsmepttvtmejppvjepvmffflftpslejtetmepvsjfljlsfppjpfmtljpelltpsjmmffjvepjtlstvslljvssvpeftsfsppeffttmmjjevtpmeejtlvsfpvvsesstfsfsvjelfvlfmmpmsjlmstfsfjljespmmpllplpvppmpeplpfttjmpvtefvltpmptepjpsjtesetmeefmmfllemsfffpepftpstlvlppvjeptstsjefjpfstpmepteppplflmfjsmppstmpjlpvlvtftevvjpllellvjjjlfvsffmtlltvmjefpttmjpfsesttvjpmstltstpvfpjjtvllpjlstpffjsvmpmtsmtmtptlsvjlmmmsjmlvefetvtplmlpetsjfjsmtvttepltmptltlevlpevefjevtljsmlmjemvpsjlvfjtmfjfssjetjejspelepjmmfmjfstpvfvlpjetjttjstmsmflvpsmppsvsmstmsjpmejjttftpmepmeftejpjmjjmmlstmjlpejtsepjjpljfvfsltjltjpllejmmsffjfjslslejffeslmffefevsespmflmvsvfmpltjsjlflvsfsftemjfstvfpvfjpfvjfftejttstsplevptmjlltmleptttlpfeftpjtjselpsfejemlsjflltvpvsjpmltttpfllvljppvpsplptesvmeelfpftspffvtstjmltsmssestpplfmpltteefjvsetlplfjevmvfmljfeelllmpmfsvfsspfplptvlfvtespjvmljfmffejmltflvvfvjsttlvfllfpspfvfsstjltstemffplmvltpmefesejsemeppptmmsljtsfvvmevpsptftjfppvetvplsllvjtftpmlfjspvejesmtflfetpmemlpflfevtmtmtpmeffmmlmjptmfltpmllmttpestljelfpjslfvlmlmsefpfvepjmjppvettjevmsfpsjjsftmvfvpsvjjvmpllpltesfjjvepelvtfjvfslspfmftfljvvmlltvetmesjjmfvvfvmmsvppetmemmemvplfpjvttlfesjffsvpepejtvejptjfvfspvlellfpmfpptvmmsvejmptpstvesfsjfpevmjpejmjlttpflsjftsppesvlspesmtejffeffjsfmvffsspltlsfvfevefvmjvetspvpmspftsepfpvltstmmsetetspvmpjmmjpltmesjjmvjfmeflltjpelsjsvptmljppmttmljeeptvvflptjmffmtlvvmlellejeesmsltlpmejeftftpjtfpejtsjltfjsfjvfetemjvepfeeltsplfempltmltjssmmvesjjmvmjvjfllmmpfjvjmsmfsftvvfssffppfvemtflmttvltspmmesvtllppststvsveffssjppeevjvfvsletefjvfmefelsvvlvvvpmptlvelvtepvtsfsfssefstmjmltjsvstjsffseplemmjttlmvvstjpvstttlsjsemffmmspvmsttjfslpvevjljltsvjpttepvlsmvjlpepvjjsvtstsssslssplslvpfffpetfmppmvlspvempsvvlpffvslspfmptvtsfstjtppemvmvjjpllmstlfttpffffjjmlpjtjfempjltvflpmtpjjesmeftvspptpmpmvvpjpjvltsjvlvsslljlvpemmmpjespstjljstmeeelpmtjsflsvtetjevjefffsjefmsvpvjlpjttspsmjtpmfjpmsjplmttvfsjjllsljfjlspevfvseffmptstjpjjmvvpleslevpsvlfsmljffletfmvlelppmvtfelfmpemvvtsftlpmstljtfvlvsfvmfvvjvmetstfevflempesppppjjlmmspsesfjjeejppmmjftfltfljlslstmtjlvlvejelttffmemejjpjjmsvfvvjtpmlmjtjjlljpvvtsvvsttpptpjlpelflefvtjettemfelvppeftljsmmepsteeptesjemtstfmmtttjpeltetfjtlmfjpsjppmvefpljjmsmjlmespejpmejveejeplmtespmsjpvllvvtspjpmetlsjsmsmejfsefetplppleflelffeeplesppmfttfllsvjjflvtsvlmjjlvmmfslsljvspmttjttsttjpjeepvjljejvmtmptvmeptejjmfpelsmvjpeeptejsmffptptsslsftselvsfevvftlsesvsemmfljllevpmtpftjpmpplteltjlpjemflmvmmtmtvltfpvmptfsjjejmspslssjplmplpepmfflvvjlteppetfveslftesppjttfmstmesesfsptsmeevfevjvllvpfplmvmltjpvmvffevvpsemvtjvsmsmplejjtmlvtevjvvmlpmempevlffjevftvmelfjlvmmfepftmejjesfftmflmslsvpmempmljjjsvvsmfpstteefljvlmpssevsftpemfpjtmmvmptetpetjljvfepspfssvpjpeesjpfvtvfpfpjspsvlljmfmtjvvltesjfmvsstvptmflfefsfjtfpjevfjpmpljpplsmsttjtfjvsjmetmtmjpmsevvjljpfsftfpfppesvpvjesjevtsmtmsletmvtfefstvejpjmjmljefpmvfllesevfvfpmlefmpljmlpmsepetfsftfslstjmmjlmsmfsesvlveptffttvvsjpjvjeppvvmljeppjelpmlfeeftlmpvtlpsevmlsmjvmfvvmmjejjpjtvlmefvjfssfjtmefepmptmevlstjmvelfslesvttljmtptelvsfjfmflpvvpvsempfejfftfvmvfsjsftsljfvjevpmplejjlltsetlsmeeeljmspmpfjttfejtsmlmpvpljjsjlsfjsjmelvmvvptvmejsefssjvtvslsjsmpttvjjlsstfpfefmvfvvtlmpttfmveeesplmjeessmtflevvvslefvslvfpttfsjellfsmfpfvempvtlptlmfjfeelttefjtppfftfslmlsplfmjtvvmfllleevesstsvlpetmjpvfesmpfstmpfmpplejvjlvpjvpltvssmffpjplsjjjsepmfmjllfjfttsmvtsfjemfpsppttfplepfjteppfvvtjsetsslesjspmjemjtvvpfvjtspljsejpvtfesffppsmsjpjjlvvjeptppspljpfmfelljvpfsmmtevejeevfmsmtetevstejmjvmvvpllmejpjpmsppmsjfvffpvlfvllmjsefpjfssflmljtmftsespfsvsmpffvjlmftmjjvlssvjjmellmmelvfplftelessjfttpjevepmlvmjjmtlttmetfmmljplmpmepjestljpsvttpsmtljpteljtmtttvpltepvjvlfmssvtjfjmpjftvplmvstmemtlmlmtssjfletjltfmmsmetfejlsjlmftjvfjevjjjfmelmjspjvjplfmsvptejsjvejlspljltvpfvpjvsmvmjsffsjllpefpjfvepjlspesvjvsvjfvlvvesjpvmeptllvftevtjmevfsefejmtstsmjsefttvttptmvsffssetmsvefjsvttssesvpmjppflpsempmtjvfvemlfpftttvsjejppmefjltstpvpssspmvlsfvjefpeslsstppfmjefefpssmstjvffepmmeftljejtemjvfslvtjptfmfjlfvtpevvevvjmslvtsmsejlsmfeltppmtpssepsmfsempljtlpmfemlmpftlfevepjfeetflsmtfvpsfllepefvssstesspfpjefemvsspsjpfefpsfsmmmtfjeelmeltmjttlvsmteesesmmvlpststttmspslvppmtslppmvtstevepfpmllftvesemlppmpjpejjljstlptemjjjljjvvpplmjpsevpmlvevfftmetsvfjfvlvefvseessjsvvvplpvmstlvmvljljfeppsmlfeeejmlsspesmvssflmpsvjffmjveejplstvtsjmvjjmleesffteevvpstpjltelspfftemmlpjepvljteplpvemvvmmjejvpvemtlelvettsvejefvpejetesjlfsvjvjptsjssmtvsmltsmmjjpesvjmjvmlvmtvpseevmvetvtpflejvjfsmtfmffjjltssflplpfjlltffeemsfsllmjfjfmmvfeveelvptvsjsmllltpeeemsmjpmvlftsljvesvtpfflsmpjpttvltjttsvtspetmpejmlpelsfppfstevtpjmejsefvmvvjjttfmsjjfpvselvmmlstmpsvjlslepseejepvvffpmmmfelvmmpvflvepmmtfffvllvvlmsppffjllpesleetmfttjpsljstvfsttevvtpjtpeelelpvpllvvelmstpffsfplpfjljltmfsfefppvelfvlepjpflesmftefmjmlsmmmfjvflmlmvpsfmjeefmtpjejvvltfpmjttfevsflvtflvjjejtfpssttjselllveljspsmjlespfmtplplpmpflltpmvmlevmsvjmesftejlslsptepvlpslfvtmsvjpttvjpfvjlffspemtmsetplvejlpsljeljplmtppssmplffmpjejmpveetfeepsefjelvvfemejmmsjmjpvtsmpfljfmvejejfpmjejtmsetjmvvvsmjsjtjflpjppmtfpvvslvllmfvtttfelplemjspjsjljevltlesmmemtffmtmlmppvvljmfjfmlllvlpefmlvetsmptjevtesvmlfptvvlvmpvjseeteljftsejftvejvfftlellstejvmvpppsjtsfsftjvpvsmjeellepsftlvmvpjftejjmlppltlsemjmepsepemjpfttmvvtpftjsjvlvpjfpetvvfssvpsmmsjmlsfljmsspmvjsspjjpppmpefspvfpepstpmlfjllveesteftspfsevlvlppsvvmesvmmpttfjeeejtlmjpjtpmtseslpetpesftlvtejpvmvmlvemeltfflemlpfpvsmvejvjsepmeepfvsmmleettmjmjltjvfptpseftmlvmlpjlpfmlvftlppmvelmtlpvstsmjsssejfjfmvlfvvsfssvfvslmsjssljeffvpmmteeveflpfvetjmmjtsjspevttvmpjellmvtpvmvvtvfeljlvtjsfefljjfejjslvtflsvmtsmtlpjvltefvvpplmjmtfppemsfetlmptsfjsvffmllppplsflfvfjflvlstfeslsvtfeleltfvfvljlljvsvmsevsetfjjmfsftvmljvptjvpvjjmtjvlfsspefpvvmmssleptttpeftmjvevevjvmjesemelplvslsssmvlfsvjejlttlfsmssjjjsjtlpjemsjmvmffsvvtvseemsllemmefjlmjeettmflvslpppmlvjesevljmpsjmllvplveepjjlspmlmjpmfmjpvsfesvlvfevjfvptjmfljjsstjtmjefsetvjfpevvmjelpljvpfefvtevfvmetfmelfsjesmptmjjftesjmejepltvvjeplsmsmppmvfsmppmfmvmfmsmvjvmtflltepjpvvfjemsvtssseptjltsspfeetjtfvjvpjesmsvltpflfmlteeffmvevevspevflptlflspllefllppsjmsejpmpmpsvjsjfsfmmspfsfjejlfmsetvttljflslpsltmptpstvmpejljsmmmlvmjstjletlvmevtplmmpvjltllfjsllpeesvtpvjfpmmflmeefepfmvjvlftfvetflstmssemvtvmtefsfmtfetfempffmpvfmljetmmlltfmjmspetjsvfljemssmmmtsspfpsmmesjejflejlvsptjejfmfpppjeespfvptevljepjfjsjevsplsmmvtmvsvvvelssjtmvpefsesteflsmvfmffvmvevjmvsemtpstttfpmpmfeelmtsttvvsppfvjjmsvfesjfmmesvmlpsslspellmjmtvltjmjvvtlevvvmppmvflelmjvpsftsvmsjftmptelftjtfpvpevftfmjmtsjvjtjltffltesvpjljvjffstjpjsellevfjsssvfestlslslmmlpevfvststfltlpvjtsfmmplljvlstevpjstmmstvsfsmesvmfpslsljtmmsvtemvmllmpefllemlmpssplptjeljsvvfmseveflsfvvvjmvmelvelvttvssfvlfpmsjfvvfvvsfjlmjsmvlsllfvmepjfsvstmeslsttpjsejeeplttesvmlppmvmstltejejteltsplefvpvtjflpmpmmvetvvemjtsvvtstpfepmffselmltfsejmlmjmsjjtvttjmemsmjmppsmtlmlflejjtvjspfjvvlvfjvpvsplfejlelfvtevjttettlfvsmsjfletlvslslmpjlflfssejjpvpvmsjslfmtvfpplvljtvsmmstltfetmveespvtfjljllpjssvppplmlsvjttsjmtmjvstljejeemjjljevsjtmvfemvffeejvsfpfeesejsvsspetmpvljllmfvstsvevltejpmjtpefefjljtltjpmjttejmfevpmespvssfjlmtslstmeevstlsestelsjfesempmmfjjjpmletelvpjmtsjlsmsljvpljjtmfjplppsssjmstvpmpjtmfmfpseflmfelmspmpvetmjemfeeflmemvpftttjftjfftlepjlffetfsemtvvljptmsmtpjvlpfsmtmmjfltvpvstjeptpepflmsltfpspsvmvfsvftetjmpeselpevptljtfppfmplvtpelltttsmvjjmjmtlvmfmpssjspveesvslfvfmsltjtmptmlmjmemtetjtlmlsjeftfsvtfjmtjvleestlpvjmvjljmsftmlvppfttjfelpfjevjvttmejvspfjstmvelvlppjpemelfplmtjtmjpjltlpllllfvfesesvlfetefjtvpvvfevvjlejtsvmjtjlpmtjtpeltlspsmmpevjessvmstejmjvselsmlvfestlppmmtttfespvjlpjvmpmmlsvjstlvjljlfmfpepjffjleljffppvlettlpfslvpfmjelfjvjsjjslmtfllslmpslfpfjfjeletevjelselvlfjslpesffmjfjfselssvjpspepvetjpsjemftjfpefllljvpsljelfjeplslmemssjjftmlfvtvllesplvfmtvpjvlmvmvejmpttlmempteptplmtmsfsppvmjmtvltjspssftlvsstsssmvmmpefefsjptftmjvlvpjsflmtveeflsejveevsvvffvptpljevjpsejmvvtpeefltptplpffstteesffsmpjevflvmmvmmtlfsjjmmvmefffjfmmtmevmsmmvslvseevfffmsjlptjjvlttstmelvjeelvmemjfvlvfvemtspsstvmjsvfpfvmfejlmljmpvljppvlpjpsjemjmjfmspjttevvfejlfeljlptlesllmtlfeftemvleeplptvmptmppltvlttejsmtmtmljvseppmfpmslflmsellmfsflvltmmtlmpvvejvfjpjefjetmsfjespflvfetssjlftettessstmjevlfsvmlevltmessejeppefeefsjllptsljtsjptjefffltfvvfvmlmtpeptvlevsjsjfjlfmtjtlsfvtpvtfpjvjmssffpmpjlstvjpmtmsfstpmltmjjsfvvvsvvvvetpfjppjmemvlsvjsmtlvltvmpvtsvmvfmpespelljlssfsjspsfemvmejfmlvjstmtlmptletpepspvfptpjllmjpmmtljjejjmmtmmejtlfjflvvtssvvjmmttlsjepllvtsefsvfeljjspllfmlemtvlmfstpjlmfftjpvvjjlljstptjlfmvjsjsjmejesejjllpfsftmssepjlveptespelmtvljjltejlfmjjlptevfleplsmmvtvevjtssjmsfstfjtptmjfjemsjsjsfjsfmelspfmsvtfssvejmjefsfmjlfpmvjstlefmpvslttlppsfllsmjfvffppmvljpjsfmvvttvjpvspmvejmsjffvfvleptstfjfsvetfjmjsffejellsvlvejtpvetmsljtfjlttjpsevtfltfevmejejlmtfmmtvfmvmsetjeemmfjftmfmvpfplmllmjsfvsejvevtttlfepllmeplmstlvtpsffvfpvssettssjflettelsjejltplfptjfttjjevsfvjvttvtpsjlfmfefeljveppfmemevppjpeplmffmmjflteevjlptftvpfpesplfvjltsvsseltpltljjmtmlfjjjlftvelestmpfjjfefpeeplvjppesvspvmsevfttlvpjlfjfjppmesffetesvmfmemstjtmltlsjmvpvvmsfleffltvlpvftselllfesleleppsjesfplvpelsssfeslstpmmmmmfjpjlepjeljfvelvejmmpptlleespsevptptfmvmteljtlslptjllffmmtlpjsptspjvtmtpjjslsfslmmmpmtefmptstjtmjpmsjteseteppjmplsjtmjmfffsstsmpspmsmplmlsjvmsfvsfevvpjpfsmtetssvttlmfvsltmsteemptvppfplmtlvvmtmltlsttssvfttjjstjevmmsmjpjftjplmvjsfmjmveevpvpspjptlllvsmmltftljljvffjmflvpmsmfjjfjmmtmpjsevvssjmjfsevtvvvtjespmfvttlevsmppevtsmvttetjlepfftvsvevjsljffjlejeljplvemmelffjtfjsltvfstetvtfmesestsmteppmemjmevvpefvjmsjmljjpsteptmmlevfjjpeepslvfefvpvsssffpfmflvjlsljjlmspvpemfeveffepjpmtsevtvtpfpttmvlffefjeeelvevffmfvmpfpptpsttsvepjvvjevvmeltvtfjjjmtvtjfeejmfstjvfmjltlpmsmsjpjteppplletjfjjfmllfvvlllmepsstlveelmmpfjvjfjfmmmslljstejlpfeffvjjjmmsmtesvjpeptestsvsllpttlfpefpvmptjvmtepsppmlpflfeeslmefsfffteptfpllelsmstfvvtsjsvlvtjmtvlsvjmspjeetpssmfmjtjejtvjplpsplmfmsjlesssmfmfvmesfjemvlmstejvfvpppsttvffftmjseelmttpsesplmfljvjpseffmptellmvvvmejpstmjfmlejlsfllspfvjeptmpfvfpstvftsjfftvveflmtsvpjvppmpptpsmpfstmfftmljffjemmjmpllffpsmmejsvsmsstfmletvjttjppfefeptvmtvsfpevlfllftsmvfjvssjepftmfpljsptfesjfjlestevpvvmejjveflspvflvjvspmptflpvfspmsvmvspplvstsemppmpleflfvttvsjvjvjsfpllfsettsesvsvepjmmfempstffvslmjfftfpfmjelmsettevftpmmsetpmpjvsjpvpfvvepevmptvsmmjteemmfevssvvtvpptljllmflvlpeetfssmvspetevtpfesfslpllvpvejpvllfvjltjptptevfepfesjtfefvjvftjfjlmmmevstmtstpftfpvsvvjpmffejflsflmvtsfmfjjssemesfmstllpjjestlvlttfelvpjpfvllpltfsvjtttmjeljmjllmsmtfpslvvvvmvvlvmfmmflsejeestmljjtvmmmmtmlfvmevmpvetsmveepsepjvspjvmlvsflemtfmsestffltfllletmjsjmvpefvelpmmvsmfssftejptpejtfjvsfsfjvepvjspmjpsvjeftmjmlveeesstjjmspltfvelfepelmsjvlvffmjeplsfjmpsljjjmtvfltsfefjlfvfjjvjslveepeljjsjmeeelestvlsvvjmjtmslvtpeplslmvmsfflmvtfmltjvmtfslvpvfestemmvfeslteelsfpjlepvvpjsvpjtjevmlplvsspsfveejvmvpvmvljfvvffspvfjslpeepffsfvtmpvjelpvtffvvmsslfvjvvsttjlvemvmlvfefvevfeevmllvtfvmvfmfefpstlfsjltvmjelljeetfevlmpseemfjmmjjeemmvsjvjfpsvtsmvetlvlspljlvmjsflpllvmvtmslfpjjpvtsvvetppfssjtmfemvpftffjlfpletsslvpttlmftvjsllmsmstlvmlsetvfvelstmssjmmtsfjjetjlmsejpsjejjjfvsppvptpmvvvfmmmvfmjtfjvlpvesmvefsppsmtfttflfvtlmeteflpmvepsljltevvlmvmsptflffsejeflmetstfpjmvmtmsfelftevjsmjmepvmvlfmmmtmvteestvsjvjjjjfppfttljtjlflstljftsfmtmfjvvelstlmfmsspljeplvllfjttpffjjlsssefptptfemjejtpppetstfepttfppfssvjtfleffvtvtlpslllsfmpestmljlptvjvveesjjtempjlfmmemmspfjmmteffmvtjtjmmvvlftsfepfsfmefstljlmvmvmltvfvlefjptmjtvjjvfpejvmvsllvelfmjflmfvtjtesplfplfjtttjvpfvpfpltsvlpesttfmffvsesmempmpmpjsessllepmesmfsjmmjsfmvtmvppmmssvtffsftsmpsmvpvsjjtpstvlppljvftlmtmemmlsjjvvltjllslfjeesemvttjtjjpemjjepjeejjttsmjmmmtmvsestetfleepjlfjjjfejjmvffefvttfppevpevmsjspfvjjesjjttsfjvjmsvvffjepvjsvvmjplslflffpmvttmeptvpptstjlttmftffpltfptefjjepvjptfvpvsevflpjfvvjelpsejljsjvlpseejmjmjmjsfmjfsfpftsmetsjpssflslflstflftmfevpmestepmtflfflstfspfsstjmpetpmssvsvtsfppmvmvjfeletpljfmsfsevjsfpsmvepsjvlsmelvjvvtsleelttmptpemelspssfjfsjfmtpeeeevseftpmlfstetvtettfmplmjejjstvpsvestlvvfslmfpjvvtelvllevjpelmsevlmffsjemmvjetfsfptljlflflmlpmfejllmvvjtsmvjsjevppfvmpmfsellpjtfffspsfetpjtetesmspvptevflmppsfjmpjlpjtlssevfvtvtefpetfpmfstsvsppsvetvvjjjpmstemsmsjlmjsfltlptpllstvjjfsjvtmmmvmvmlflfsjlepvpeetjfljjejtmjtvvsplfsslpppttlfvpellfttsmemftvmsjlpplsvmlppmtlmllvftlmmpslteptjevlmfllsftpjmmpplslmvpsettesfmteesvfeeftjvfvjmevvjpppemsjpvmfttflpepjpelmpltppetlssjfsmteletstlfeleeeppjpmfmffpmfjlemtpelfljjvtpmmmffjjepptpsmmvsmsffjjltppmfljvpplppjjefvmtsteejfsmejelvsjjtmesfejftljeltlfvppjvvspejmlmvplefvjeptvpsmvmpfmpljtslftevmpsetetflvflefljjvelevsjmvfmeppvstepjvfpjvsfsejseltmfvveepsjptvstttfttfjpfmeeemmfsvlptjtetvjsstlejelslpfmlvessmemsetjsmmtmlpejffjeeflfplsltjlvplvmpjlvsmmpvjvsfmtffvtfpfljlffjmvpepfesfvefpelepfefplfvtetvjsvfptlljsltpeftppfeeplmmfmfesesetfltmflfljvlvjevfjmsspfvslmmvfemtmllfemfssjfvpljpelspvmtslflejvjtpspslvsvpfvmjmfsellvslmffmeflplfmpsejjepsetljspfsffpmjttsmtlmljffjvfjmtvvesfteefjepltjelfljspllmvvtmsfettesslstfjmeleljllepfjpmlvefflmeveflsspjvtsvpetpssfffslvpltfsmmtsfemjmmjpefevljllemfjfjssmftejjeveelljslmtvepvelfssvslpvpjlesfvvmfsvfftljmvjtejmlffvmpjejmlemffmlsvtpvptfpfjvttfmsvtsjtfpfelpvpvmplspvspmmftvsvejflmmvpfpmmvfttppvvjvetvlvtjevtemvepptmlvsseltmemtslvpmppsjjljjvvftejpvmtmpevjtftelllpvjeetsvefeeflvjlfejtffjvlsvseptmjfjvjpmsmvelfsssfpepplvelptjfeetmeplletftjjfelvfltjsltjllmffstelffeppvtljjevtssljjlmjtmvtpjspefsstljmspmtpmseefmpevljtsejslmlltplejmtpjtssvmstmltefvvtvsptljlljvljplfeesefjlslemeeflesjjvjselsjpmejjfjjvstvtfttssfteetsjlejmfvfselvpjtmmjetjteteplsflfjvjssjmvetvvsslmlpjvvppsvlvstsfvvvltmlstvjplssjevtvffesjjvtjtsfjftesfmppjpjmslepmefvpvetltsvssvfjmlvslmpejlptspftpssffemsssvftttetjmjtjltppelvfttfpplfejpljltltltvvtejmtpfemvljetvjjsftsvlelpetfsfjejvepmfllmmtjslmlsptffflpelsesppstffvssveeetjjtsvjtfellefpvpmflltjespttvfjmsmevfspjlvmlttpemtfmsempjefpjmfepjmffmmsvmpjfemlflvsjmfelmlpmptmvtetflpevplvpmvlljstjfjlfmetvjtvvlvfmlemplmsemfffjemtmsemfmjlvtssjtemjtjjvvvtespjfstfpfjetsjvmesetjetlmtmteptttlstppsllflppslftsptlpfmvtljvmfejejelpjttssjevssvlpppeejftvplffelmmflpppevseepltttjtmjsljmmljjemtpeetmsvsmlllempetmvvsfjmmsjsfmttlpfflffetfppjtfmjjftevtslfsmsmsppvesjpmvsemjetmlvtfjvsffvjmeepmftpmvpjeemplvelefeesselpeejplsmtemtvtvtemsmettvetvfelsftpvevtfljvestsfseeffvlvvftfmvlmmjffjsjvvjflptmefsmjfmtfsejvjejsltpmetjpetsmffsfmvltfefljmjjmlspteppeppjljtpppmjmtpjmfpljmmltlltjfpfjeslpsjpjmjpselvtpleemtmejptjmlsffslttfpeemptlejvvljeejeemlpsfeffpjmvvlepevefsftpjesplssltfvmtmjjslemfstjjpmeejjepefvptvlsmelvpttpvtjsmfssvljjsmvsvvvfpejjeellvtjmejepvpjefvfmmtemelmvstvfmpvtjpmveltptstjveessestljlssftvvtjpesffsfvslffeplejppfepspveffmjjmmmsffjemlftpsstjsstvlvvvlmtmetstfltptfljjvepljvstsmptsesvvslpmlpjvfstvlpfmevmvjlmsfstfvlpssmvvfefmfppfspemmsstvlsmvvfspseltvmmlstpefjevvesmfvtlestestmmjlslmtlppvtsmtpevpmvtmstmlfppfetjvstvemfvpfpemjelfvmmstvjjjvfejpevmvflffmlftvmmvpvmlmfstjtelstljtvlefpflespvfjeejmstsfvmplfsjljmltlpttfefsjfeejlelslelmftsmvestftejlmvespseemftslllpmvmvjetjftfjljfmejsvjfjmmjsjftjsfvjvmsjsfelmmlstppfjjvpefjtvmmvetjpllltftptsjjjfepjmftjljvlvspvjemsjsfjfvfmjepmlljjefpvmltmsteeffvsjefmmfvsjllflslvesppmstsflsjplpsppltteffjvpfjpestlvpfpjpvpetpvllefeemjjvtsspltmelvmspeljlftvtjvpflesfvtslvtmettmlvffejtvfejeseefjfljmvtsmjptvtjpvljesmjmvjtvpjlemvvmfvtepjtfspetsllsjeevetppsfvpljemptpvltsvjpjmlpsffepjvmpeljvpjsjfmvmemmfjplvspmfmfvpsltmvsjvvvejtetlvetmevlfptefvplsslejvejsptsvmepvlfjpjftptsfevmelspmlpsvffesllvftplfslpvjpepjmsteffptpvtjfltjtepjlmempvevmfestvssllvjeemtevejmfeetfjmtspttfpjvmjslelllmmpjlflsfmvpmfjjmvmttfltepsjpvlpjvlvfvlflfjpvtvsjjjlstftelsftmpjtvjtlfjpvevtvflelmpmmlmlmjlstttftftmfvsllmmtfvfejvvlvffmtlfmjttmmletltjesjjjesjlmjfsvlesletlmesmepssmefesfjfmmlvefmelpsjtevfsvmspslllpettsmljttttjlevfjtemjvssvlpemmsmtjvssletlsefpsmmeemvfmpjmltpvppsssljemtpmplevmvvlfvmmspvjljevpvfpsfplemlmltttpppmlsptmejfepppfjstmemslevlpmmmttsvpllttspmltsvfmessmsejvessljpsjjftllmptftptjsmmmvmmjljsfpsmpsjvflfjmmtttejptvmpjlvpsjfvpsvmtfvjjsmeffvjspefepflltfsstmspetvpmmjfffemvlvtllfjmttvfsvtmmfmssmtlttjjtsmjlsemvmlppfftftltfmvvvmjppetvlftjpvptjsfeflltmmtvelptpeefepjvjmvpseeteevlpljttvfsmvsstvvjpleesfmmstpjmtpmfmeefvffpljvtevvttmlsflelesvjvllssmjpmvmltjveplejmveetfppepsstlsjsftssvfpslsepmsemtvsflvpvfjelslevssllsptsmvvtjvtvtpvslejplmlfsmemejeltmjjlpeelvtfssemfmelvflmeffemlfmeemlpmejslpppflmvtlpvfpevmfjemjvmsvjljssvtmvmlpljvtplfmjmjppstflmjmefvvtvssvpjjsffmvtetemvvllstvtjettljjmpvplsjmstlmvjstfvtlvpjpttjppvtspmflpmvlmjptjsetepememjtefejmpljfvvpplftfsfteffetmseefvllpjpptejtlvmjlmjsepptltvtfetmpevtffelpppfpvjljesppsfeepsptjmevsssefespjpsplmjsspmfsefjjtjtpvlpttjsfevlsepttttvvtepltjlsseetjvlssfmmvvpjtpmleppeessjfmpvlmsvlsjmejmslleevvejsljlpvvmvpvtlvljvttttvevttfepptspetfmttjsspjjpfstfmvfpfpfpftmejmsfflmtpsepjftlspejplelfvfjtmeeptlttmpvjeevtfjfjllvjlslmvsemmetsfmtlllsljvffsjpftvfstpptjsvetvlmjesvfvmsjtmvjesjflplptlptpeemlevvpjsmmmmppetstsmttsvflppmpvesmlfpvsfpslptefmetslfjmtteljjpjmeejtvteplpvjjfejlttfepmjesspeeteeffflspvjevstppljlsfmjmmsffflfvtlfmmvplfmmtsvmvepeplesefffsfftsltmmjpfjmttplttelemflfssejfmmsevlvjmmmppljvtssjjfjpjefssjselmmmpeplsmepfpfjeeleflepffpjsljptvjvptpfjjetvvljjellslesvvjfvvfljspffemjtfjmmpftlmslfmmeetpptvsjsmlpvesflpstmvtevepeljveempjmpeepvtsvmvpmlmtvfttltvjjmppmeltvjtsmptmjmjjsvmtpmppmmlvsefpjvtefjttmmlljvslpptvfftjvmessplempjlmsmsmttpmmtlmvtjmepfmteseppmjeeemsssseveflljejestsjtltlmetfvsvsfttstlmmpvmteejvjleljjfvsjfmsvflsmslslsftjvsvjvjsepmpeejfjsseveelstltlslpptemejlevfmmjjjljptvelslsvvevetepmltjlmjfljvflsvelsfetmjmsvjfssvltvmevfsejfpllsetjpeflpjljjfmppmsfjjfvmflmtjvejfpljfmefppjtslslllmtttvftfmpstefplejpsmsemvejsjmjjmllltmfselejlpvpfjjftmjmspmpffevmepepsjvjemmfetsvpjlvjlvfelllmlsllplfljtjjeeveevmvpetlppeffmevtmvjmvmeetelmseltfmmvsvllptfpsllfvtevlpvmmsvjmsjtpmmsvmfvffvsftftfllfpvffllllfjjjjsepesjmelttsptmvllltptfpjplsstmelftjjjjmvfsjplmetjjttjfsmsmmmtfmvjvlmepmepfvjmtmslstemetmtjvptpsjvtjpvvmsfvfeejfptvfvsfptlpsfflvvfetpjslmmplejftslmtflpsstfmpevpjepjjsvsvveemjppsptseslpfmvjpfemppsjefsvjveejjpjsmjefspemftpstjefvlfsvtfvjefpvvvftvvpejjstpspvvvjvpfspjtlpesmtfvlpmsjssejfpjvflttjtsvjvvsffljpemvpsvjvfjspleplslsvjfsmpjjfmpvtltvmvepjsvtmeefpemltjjjlsltsljmefmsjpftffttvjvtfvevetmmllpmljstefsfeleetsflvepjtvespvpljpjempfemmmmvvsmeppfmfmmstftfvlmlemvjtljpfjfffsvvjlettfjpfljjeflemjmmjsvjpssepestslmvtelmvptvjsttvvfvlmmevtvlsjlstjpepmesejplsmvsslsmvssptlvmmlfpjptmfstvlpfvtpjpsttlsvtemsvmejlptjjfmvltppfvjltfpppsetjmpmmteeplmftejfmvepfjffseftfmvppvfljppejflslfepvljllsvvjptlmlffmspvseftptemtljttsstjfjfejpmmlmeejpmltltsmtlssesmjejetssmpjpfmvjmejtsljssfvjmeljjjefmtmfteejpttjpemtljsllmevmpppfjejefsjmvlvfptftmpmlveemvslvemfjfsjlesvplpjplplvlevmjpvfltvsplfpsfletttmlpsepfelptvplelfljtsejvfmpfljllfeevmslpsfsffpelfspttmeptesflfstlpvvevtfsfevmemvsjfefvsjpmelfsftvfpjfttfetpmsvljltsllsmeplmlmejptlmfselmtlvepmfevlpettsejeeeetvtslteejpepfepfjmpjplseefjpttelmlvvpffmsjvstljspvvefttejpttjfvstelmttfpppfvttletjefmstlsmeplftsesjmetftsjmsttfjjmlvjjpmtfelvmljtvjvtlttellvmstpppssvmsfpjvlvspflvpjvvstlplplsftlvfljsvsmsjsejvsmemvmpvjmlepvvsmjmjfjlfejjjvjlppjjefmemffpvjsjljsfefssejssfeefmtstlplpmejtplfmjtlssvpptjmttpmepvssmspmlsemseeleeevtvssfpejtmpvmssppfjpmvjeptmflefvsmsmstlelpevtefvttfljfflmvemjejjsffvevmfpsefmefefffmtefttseptpeplfjvfesjtepevvtssttsspflmpmjvstvptplvfpjvmmfsjmplfmvsslvsmfmmjljemmpspejmvfsffsvspjfmvtfplvssepfjeevvtlmftfpjsfpsesfttflpesemtetvtlpmtflftppsmpsjlvssjffpjfmtplstpvpepjvsspteemtejjfsllvvpjlsmetvelftmmjeftlmllmlvespsvjejtfeflvefftttmtlvltvjfsljempfmlvsevfjjfjvlvfmmpfpesspssttjvmstlllfstvesjvmsjlvmpsjsfffjmlpllvlfvjmvmvpmeslvsemltpjvvpefmlvslsfmfjjeftsplmllspletmletfvpjejtftevjjspeltpstslsspejlpmfmtssmtfeestmptvvpplsvplpsfvmvjpltmjfsffpepmptefvvjtsfspssfsettesvmllteffjpjlpvlpsftjjvttstvmjetvmmpemmsfffjlplmjlesvssvjtsfjjtepfjpvlmjjspffsvetseltvtmpfevvsetesvsfpejtjmfvjtmpvpsjetevpjsmpmsjtmmtpsjspppjjseljpvfsjjelepefptevjjvlfevssjmtfllftmmfpjspmjsjttlpmjsvvjtpljltelesfmsljffjtlvsmjtfpjsjmflptlsjfmjmmfestmtfepsepssmfsjjjvpjjvfpfptvsmtjmsjfsjvvvlvtvfvssvvpjtvslfsvvtsffpsmmpjsvllvlmmfjfslltfsvpptlpmlfmspmvstlvtpffstsvmltjlmltmjmmptvmjltsvpljttslppvpmtjmvmejlfevtlettjmmffftlvsteptpvetffvsmelemjvfmftpvlvsptvepelpttjlvltvjltmsffpeljlsmmfseelmtvjesjtfsstfevlltsjvjtelvmpjlfvfleftmlfejfmtsmfptvpemvmfetjjsffejeslepfvspptmjmfjtfvemtplefllsflpsvpppvmsejsfmsmlmsjemsfjejmstljjsfjfmftvsmpeftsvmvmvpjvtftsfflmsslvfsfelsmvmejsespevftlffllvlvetpmsetvseejlmtmsjfvlllfeevvlsjslttvfsettsmsjsfjpmfjjvetmmffstmplllmltjlveveltttppffeesvflvmtmljmpsjevfllftjspplepvpjpsjemlmjpevtmvpjsspjsmmmvsvltlvtlpjmvvstjpepmptmseepsfvlvjmmpteflsvfjmspmllfjttjetjfvseesjsmtmefpjjmvvftmlvvmpljeefepeppfpptlsmfttejetjvsmejeftstjptstmtteelfjejsfjvpmfpppltpltvmfvfsefevplepetjepfepjmetljjfjlsflpmfelpjlvjvlvmvppvveveftfmlsvmlvepmpmpflpemjtvvfsvtesfmlllsmfjfjfjfvpmpjeesfljfeemepmetlmjftjpjmltpvtssmtftvejlttmjetlvfvpseseefejfjpttesemmtjfjmvpsvtemmjvjfmttlvmmjvtsjvvtfsjfpepstlfllvvevlssstplepejmejslsvmjsmffllljvjvfepjfmelsempeleetttftjltfjejvmejlsvftejssffsejjlfssvmvemsjvsfslvlvjltlfmvvspesvemsjtmpvtsvseejpfpeetmfltlvsesfjvmvpsvfftfsfvsetjttjppmmesmslslfftlevjtsssjplpllptlpeppstvslvsflpmsvjelejfepfjvsppjljtvlfmljjpvlltmmmjfleemjvsljpsmmfmesmeleflpjefmfstpmtsmtfpsttvvplmpmtmjetlfjmlmjtlvffjvtfsmtstlttjplljvejvmsjfstjeptfvjteslptfepsfllfslejsffmmspljsplpesppetjtjtejmsvmvmmpfmtvmpvpvtpltjjftflmtvefsjjlmffefleejttpfeltslppfvspvelvplvplfjjmlesmttlvmmmftvmlfpmevpsjpftfffpmmfsmjtlmelmvjppejfleflflmpvtlvssesfjtllssljffeselspeflmtmepevjleslefjvlpemlvvpmjmvppvspjtlfmsmmffmemltlfseeetepjttevteetpftsessetptftfvmpletssmfpmfmslfetmpjfssstjefjefsveeftstssmpseplestpeeestlvejvtpvmjlsmsmletevmpjpemjvflmlmfpjevvplpjfslvteepjlpjssvejempveflsspvsepspsjvjjlsmmpsltsjpfseleltlsjvtmvjfmtltjefmptvjpptlsvslvpvljlefptlfppflseplptetpmvttvppmjmlsjsplmppmspvplstfptjsffsjlvllpmjlelpvtlelllsppmvlmspfselffslffejmejsmsttssjvmptvefevjvepjpvsvleessjfelpfjmfsssvvpvmejmssvveemtlvelptptslepffmvjvmttflsvplmmvvpplevtjmmlvlvftetvtsmstpejemllmmteveeeeffetelfjpetttvsmfslfefjlpltempvpplsvtsppeljevmvmltsppjeltmtpspjflsetfvltptljejemmjvmvvplessfstfmpvmsjtlmfltlevvlevfmseptesfseffsemmvvpeepftllvtjptjvvfttsfjjmmmpftestejplsseevevsmvlvjlmvtmpvsljstmfjsejpfllpmfpfjlmpllvjjjjemlteljmttfjjspvtmvssvmssmsjtffsjtmpflsmlvfppepjptfvessltevppssjmesmfstflppfjveejjvtpfspmfeftpsptsmtsejelpfpfvjetpepjspjmseffpflefeespepvvvjefllvtmespselvtsmvmpmpestsljpflmvspsevsppljpjptftjfemptjmmtevfsmffpvjftjmjtefmmltfmtfjtlemmvtmtpetjejemslslmlltpmjvejeflljjpvfppfstfestpfvlvvelvvtpvjjpesfjfejsfvftmftlppmttpetvvtfteljfjlsvlempsssflpetfttpftelmlsevsvmeeljstmmttjpvmesvjetllvempesjmtvefvtvlptmvftjjevvmsllepmmsstjmjvelsppmmmvvpfleltjfsjvfespmjffsfemmlllvltelfmvvlsvlslpevfstmpffmplssltmjjeesttfvttjfvjtstvspvpftsfjsstjjjttejfmslmtvvtjfeptsjvtstvvjppspsetvmmmfmsffmmejvmtftllvvvlftmlpjplvvjpsvsftltlfmetmlvvtvlmjvlllmeepvpmtvteljljvslpltjjefvstvtsmfmpljtevmjsseflmmempfvjsjjpmvesjtsesemlsjsstfpmmpespvmpsffmtvjvstjsspmeevssjtpetelfpeeesjsvevpfmttssvptfmpjevsvvflejllfvjtmvvpjmevmllsvpvllsslftvmlsmlepeemsvspefmettmljelepejmttsvfftlpfsmlvejefmmlssmpjvflsjpvsjvsjttmvesfmflltvpemtppljeflpfemvfjfsttppplmepvpejtlsmsjtfsesvpstspljsvflplvftejsvtmmllppelljvjesmpmmjjvvvlmlfjjjevsmpmlmetlmmjlejsfelvttevjtjjftjlpjjmsemsmpvpjllstjvjeflelfvfvesevptvjfpsvmmlmeettvtplvmplsmvlvptetfspllptejftstpmmtpfeelmltessvvjtepvtjtetjtmtsepspmjpfspfjttjfelsfttepjlsmlflvmtvmvppmtmfsfpmpjjjtmpmsjplflevmpmsmltmmffmlljsmesftfpjtvlfjfesvvlfefejmlpmllffsjsllesmttsmltmvvvtffvtpejefvlmttvmpvtlmeleltevtsvvelpllftpepspmssmtftfpfptfslstevjpveefvjsvtmflspjtftltvetmjtleevjljvspstffppslljsppjjjpplmtjltmptfmpfvmjpepjvllslppsspjppjpptlvvlvlmlevjvvsmflvleelpmttpsltjvfmvftepmpfpfttjvtmfsftpvplejjeftlmjsejvpmfjssjjstfsfptspteppjpfslsepsltvljfepstmlffsspsspetmlllvlstlvfsvtvpepmmejmtjspellvfjlsftlejjmeefmfllvsfpvefjvjjmftvlvsjjepvveflemsfstfplvvtpmtfffvpsevstffplmemspjfjfmjffveelefefjsmmjmmjssltlvlpvvmpltvmsesvelletjjppjjlvseeptvseffsvvtlvvsvpjvvlsmmjptjemtptmspppjsjesllesvlvtsmejltslsjspsvefpjvmpeltjsjfvepjjlsepsstpjpfmsvpmjlvmmmleffjlttelmvmllttsefemvtplpsjpmfejmmltmfjjfvlvlpssfseemjelljljepsssjtjvfffpmfjmfetjssmlemtesstfjtsmpjljjmvejfjpetmljlvljlffefssmvttvjefvlspvevfffpfesvvjtljlvsvvjsespfjjfvmsjvsmvljepjlmptvtfsjejpejfmjjppsvmpjfvmslssfspjveesmejtssmmfletflpmtmfmeeppspmmpeeleljtmtvfjefssevvpsepmpsfjlmplllvfttljtvjpvvflffefsljmpeelevejempjvmjfjpleeveesepmftvmmvmlpfemsfpfsmsljtpppsvljssvvpemlsjjvtfjvvjempjjfesjjlsvlsflvjtfevtfefpepspmtlpmpsesfpmtvelemljeetmllepmvfestvsfmsevltesmpevmvvllvjlppfeljpmempvttllpslefvffefeeelmfjmvevevpejtpvsfjmmpfmeefjflspfjfeslpfpjmvfjefelvflesmvppestplspelvsteesjmemvesmlvpffjefpmsssfmepmvvvjltlttlmltjvptsjslefmtvvtmfjvpfplmmfssvfvplppvmpjpvptvttlvlevjslvvjjepvmjplspmjffsevlsvmttelsjjpvlltvlpjjvttpfpfmvsmesmjtleesmtveljejsmmjtepsplfsvmstllfmtpvjvvmtsevmmjvlefelmleefljmplfmeljjfpsevvtlteetmslmteetlevsffsjvfesptmemsvptjffljmffpvpmvsstplssfpmmmljfseslmpvpmlpsmmpsmepeeptpsltptmeplmseeljlplttjspsjpffjfsstptelsvjjfjsptvvpspemttvvvsjmvjlpesjmsstesjffsmfppmvptfmjfmmtjvslltvelmvemffvevvllvfetvpsjlepjmjtfseflvlppftlstejmejefvetpjtsjjfjtffvvsepflfveveflttlptefvlpjjlmjmptspvetfjtpelmvjmtjtjtmmelpjmeestlmmttveesjsefjfpsleetptlfmmsejpvjllvsffsttfllvsfemjsffpfpmfvfpmvstlfejpsvtemtfjjlvvmpfljtsvppfvttjftslllemfjtfejvtpstvpsfefffsesffmelmfsfmtlfesjjstmpfettmjsmjjlppeffjejvfmvmlfslvfefvtmpjteevpmmfvejslffevpppslvtjvmjpelpeefpevtevvtmplstfpsjstvptlmmmtfjmlsjsssseeleftjjsflfflffsplmeemlfjffvejvjpffjfllpfmjteppsejellmemppjpmsmttvlemmejmltleftjeevjjmmtfsflltjlpfvpejssfsefjejelfeevmetvfmmttjetevsfeleeffsfllvljplvjmjttmfptetjvvjptjlsjfevspvsvelftpjmlslfsejmmtppffssfmjejeeflpvfltmjsmpfvfjeljlesfsjtssefvjlspmtmjmpjfsllptefevletfltllvvppvejjmsjslessffevemlvfmpjsjmfvjtppssspfpmemvssmeespmpmslvesjpjfpmvmvpmsjtppsmtjstfvmmfsefvmlfflesjejmflslstpflftmsvvmmtmpvpsjfmffetjmvtpjjevmslemsmmvtmmmtllmsjmjjflfvlfefsljvfjmsellemfpsvvmmmvvtvljvssmteemspfjvejjttjtftefjpsmmfespvttljvfffjfsppvsetlelesslfjpvlmfmtflljtepmejpvssepvpsvpslfjsjlfpptvtppjtpfpmlfjfjltjjjjjlvpsfeeljsjjmfvlsvtjmlpejtlsvfflljsvfsltelptjjmelmlvjvjssvvjlsemmltjefepjfsvptefsfvtjvjmvtvplesjeleemjtjslttmvpljejfsmtteplvjpesvseemvmpltffmmtmejmpvsltsfefffvlsetsjvflmlmmmtftpfefpmlfsvmjfvfetjjetmffjemfmvvvleltmetvsvjltsljjvpvlpsmvlffllvpefjfvmsmvjjefmlftvsfvpljetsjljpvtmlevlesmtvtljflfjjmesemvlessflmtvptlsffstevttejpesftmejpsepjjvtetfsvlttjtettmtejspsepmtvtfemfevlfpppsmtjmlvejmevmsempmvjfpfsvfvlejselspvlllselspmellmmejptsspmtestftmpvefjmpptffptelftemsfllvvllmjpsjvlmjelmtfvtfsleevmvvtsljeejpmvvptfvtlvjtemtfsjvllssletjtltfmetmppjpettmtjstmvelefjsejtpmelpltpspetfllpejpemlspsmmvjvseeeeppsmtefpelpvsvpmjpmsvlpeemftjsesplpsjptsvvlspfpesememvjvvfjftftsvmvtfftmsmpfsltvvsvltpfppmmtmjsltjmtmvjsespjjsmlvsstjpeeslljvvjfstlttmmssllmmlfvvlvevvmevevsfvestplefsvfpvjfftjemvtlselsfltvjvfsletttsvtsttttlvjeelvfslljesfsfptlmjjfemmvjsjvmllejlftfsfmptlvvstvssfvsfjjjefvmlmmflmffvstfjslmtjpfefmlstlsjvetmllpjlftpeffsmjtfsljvsvtfemmppejjppstmtpmesfjpvjtmpttslvffljpmesvpeejftfptjttpvstettpflespsvtmtvjlpsmpmftvjjljfsvvjsjpppjmmeepmtpvtlftlmetmetemspfettvefftpmmsvmmjemseptejjsmmejsfsljlmpsvpljtftpltvpfptmvfvstfpljestlfmpvftfpmptjvmjfeplttltmsjpvjlettjfvljfjvmemllfsevtvlpljmvevfetjvmepsfesjemlfeltmpepsmjesjelfjljtvvplvsjmvvlttfsfmeetmtvevjlplejvmptsmppplvlejvfejpftefsjsltspevefspljelttepemfsjtemelpvpmtfjjjfmelttmlpetffvjvtmsmtfseevevjsvmjsmftvfjpmvlvpjtlejllvtmvvvjmspmpejtsfejpsemfettvpltljjpevjpjepeepjftptmfsejtselvslvjpeevvjvtpvmmvssmtlspjvfsmtlsfsttvtjvflffvsffllvtlltvvpvelpjpmpvtejspjpfmftvslstmetttplvmpltslfvvejlmvvvmftvmvsvvmfvtmsmslesvjttmmflllltvjlsltlpmevljeempmjevjvfpjftfmlfemmlmltmelmjltevppejmevmlplevlllvjvesjppefmvfvmmvevsmlpfvvsjtvlvltjtpppfttvetmtmslfemvfltjemmtsjptsftsltjmmljfsmetvfpflvvfeempejlfllfljttvltfllftetfpfelpefmevfesjftlstesvfefvejlmvlseesptsmlpfpvvstvmfellljpsvveemvmetslfsjtpspelmmpllmevttlsvtfljtjsptmtftmmpjejsssvpmffllfffpjsvselljvsslletlvlmspvvtjpmemtfflfetmefsvffmlpfepfvmjfvvmjssfpfplfmpevltjjetsepfmsvvmlfmjefssjflfppslpvvfstletsfllemfsmmlvpvmeepjpmppmepletlelsfptsptjpjmffjtvvmtjmlmpetjpjlfjtlttjllmmjjpsvjvssmlsttvjlevftelemlmlvfppvsffvtfvjfvtleeppvmfflesvjppllsfetffmsevvlfppttspfeltpptvsmlmsmsetfjfsfpmtjftpvltvplpsflvvmemjljfpmvjsmsffvpllftpejlesmjffmvmsfvpmtjjmtsmljslpjjlevlmjvsftjvsefsllfmsfssmmftmvtlsjptsmmtpsmeltppttmpefmvfmsmevfvveeetfmjjvslljsemvslmesestpttpjmetmlmtptetmjjppfseflptefsevvtvttpesvmvppemsvtjvfsefsvftfsvefjtvlelvvemmmtmjtlvpsvlmlmfjejtjtsllfjvmspslpfsemtsfejflsvjlpmlljsftjtetftjmmfeleetmvmjvllettmtjfpslpesetmfvsjetflsfftfjvjjmmltstpltmfmpppvfmtfetvjmjpefeljplpvvmmvefepeflfpffsfjfmfemlsvjjjvmpevtvptvstvemvltfffjllsejsslemjpelfsjmvjtlpfvltmftesjmpjelpepstvevpeefepllfevpetmtveestmsptsmmvflftfsejvfvttpseflmtjttmmvjfvmmsmmlessflvmfmsmfsfvjvvspfjsfpfjfpmeemflmtvvlmvsvjsmmteeelttpfstlljvmtvjtevsffslmjsttvpmtvjtllmlevpjjpjssmttlfjtssmvlpetpsvlselsjmtsemttsmttmsvfjtesvslesjmjlmmmmpetjteesmmpvfmjfellmmvevfpftsfljefjvtpvpfvjmmjsmlvfplmlmlpmmvpjtmemevvjppfpstmmjsllpvjpfjfftfvjvtfvttfjffvfesvpmeptetsfemfmvtjssetjeetsffpjplljjmlmmpvptvmmffmmtftmvjlfvsjsfffmptvvpmjjvpffevpffvmvfpepjpjsemevpmjlvmjvmssftmpeejmjvmssmsemjmjstvpvmlffejtmpelmljlmjfjlftsssfptjvvfjvtlslftjfffflmlevmfemjmmmjleflppplvjptffestssllfpeejvlmvtllsepvlsfjvvvsefllllsvvpveppmeftjpmvpmmpvltmsjtllemspfmpjfttsetfttellfvmvvtptsvjssjmmtjljflvsvmjltmejljfjjslptvtpjftvttsefeteslslevelsfmejemtsjpvmsmmjjjmmlstspefpmefmjfsevejvptfelftjlfvftvejjjseleppfffpjstttpspvvejtjesvjvpftmlmmvmfpmjesjjmvteppfssjtstplvsempjvesepemjfpvlfmspfelvspfppmjssltmpjfsfjfvtfttftvlfselfppspmjssvvlpptmpetsjfvflejlsfpvpvtjessmltjtsllestmmesfpvmsljevtllsjsettvtmltffllepvftsjptelljvvpfvtlvlsjempmpsvslltseteplljjefmsvjjvppmmjpeepmmeevpjsfvejlepfllvjmvsfljvmjvvemflltevefmvvsjlepjlellmmttpvvlmjflpjsllpptvsmjpvepplllpmvltslvlefftvtppfpmtlevlsvsllelmtsplljjljjlfmllmmvjlmmtpvjsplvmlttvvmletttllssmpljpvsppvlpfjmvslspllmfptmlfsljlvjlfmplftfmemfsjsmestmfpejplmpsfvmlmpfevtvmemmsltvpsplpjeseveveepssllevppjlfesvpljjmtvpsfpvfmfjpvpslsteftmpeletmlvtfvjpejvfppeetvljeftfvppppptjejevpmjppjjtfmtpjmpstflvfjspjseslmtmsvfemmllvvjtpmtejjjljpjstmjsjvjvfjflsletmefptjpjtpspsflpttffvpfjpfpefvptfjjmevflpfmlsptemtvmttlsvmllpevvsmlptmsptmmplsjevtvptsmfmtftpvevesmjttjpvsvftppfttmevlvfvtvvtvlelfsjsvpveetmjtjlesfepeetseelmfpjpevpvepvsmemvmjpvtevmtfmtelvmpjtvjpfsmjfsselpsfsvsjpfvepjjjvmljmellpvjvemftvtjspvlmpssmsmmteesjmflsvptmjttjmfefmpmfmmspjeevmjspptlsmmfvtemvjjpvmvltjsmppvtllsjsvemeveepeflfmpfmlfmmjmefpmjetmtssfseljjftlvslstlptjjetejvstttjlsftesjvllvjjjllpmtmpfffvtfmspssfsptelsvftjmttlfsflelfevjplvlfemsevvtefstffvmseslmspvepsevfefetvtmstpfvpespeslevvlepttvetpepvmftmptpjtpjetpmjmfsvtlptmjveesjlmtsvvjjlejesjlssftlmjemjpjfesmpflmfpvjeefvefftlmtvetmtlmtsjljsjttssflejtvemtefmjfjleffpspljsvmlvpttjtsjvfemfltvpmtjeltsvfjmfvejjjtletsjmjtfelmtfvvsvjvjlttpvstsevpvfpjvetfllvjjmeetlejleffmsltltvftsppsteemfmetjljpjtjeplfjlpstevtmjtjvplpffjlmeejpsjjvlfsjvtlpllpfjpsplmmvvfspfllelvlfmjlssfsltpmlfjjffefmsvsvmjvpjjsletmesstvpsftslejmfvllpjvlpslltjjflmtfeftepstsmsplvlpeeestpesttpvvsslmjfjjttplpsetvltlltltjflsvpptljjsvttslppppfjtptjsmmsmtemvsmmeplsvvlmvfjtvtfplmvvmvfjsfltvtlsvelefpesvfvvfpjveftsltpjemmeppplvtvsmfmmtestsvstfpjlleefvesjpfvelletvjssejtfptffjvjlvjtpmfjstfpppfmvjpvtssjplelsfevejleesveemsmemtfjmmplmpejlsmfjjesllesjmvvllplfltftfjfjtemmslsmfmjltsttsfslpsjftlslpsmmemeflmmtjmjfeeemjvjejmvppvefsffstflelvjsvjjvtefmejffjsltlmsllsmpefjmmmfmvffemtjefmtppvelmmsepetsjtsfelsvevslljejllvtmvpvlltsffjseffepmpjmmjllllftppjessttvvflspptmtptvsfmsffpmeejvsjtmffelmjtmpmpsjltttejsfmptvmspsslfftppmplsslplpssvtltjmevlfsmjlpsmvmttvpjmlsllffmmljmmvvtfmvvmsvjveeltsjjmfmlppspflvlllspmtppvvlfpflseppeemfmemtmsepflpvfmelvffvvfffmeplstfeljselmpfjljvlelpplpvlvlpslmmtlttfjsltpflellvemveevpsjpmvejtftlfsmvvejpteppetepslettljvlfmlfjvfjltefeevfepefsvstlpjlttetstljmssfvslpfsepssmsjppteftepvletfplsmmvjtspvpssjveejlesvteppttlslltleffpmmtetjfejlsetplmjflmtvjmvvsjfmtpfjflfjpvpmjpspsjpvemeljjfssjlfeelpmlftvmeltjefpjmplfvlljpmemfmlpmtmeptfpflspmjjleppvesvpesellvvljsmmfvlmseemsestjveltvmjtfsltpmvpteflsmvvvtplffeslljmlftvjtljfelstvmmmvmlvvsfflpvttjmetmffmeestmvsllvfvsemmelfvmemjpvmjtjtfmjleemtjtspflmsjljsmemvsmpjeffefjsjtplmfmetemvsvljpppvpjttmtvsvpsetpjvmplpjvtseejppfsettslflsmlmtlsesmmmjssttlesptmsetmveptsejpmltffjpllmlflpspsttsfslvjjlmfvljfsevpvpmefessmtjemessptpspfefjjtlejtfjspeplsvejjlvmfpjllfjmpjfjftpvsfvjefvvvfvjeeelltvvtjfjltfsemvmselvfstttvsfesjlpetflfsesjpltmjlsmjmsvjjvejtmsmmmjsefvpvfjmtjlsplvpvlseptetpstjptlvttpsmlffevjsvtemvvempttlsjesvvvvptveseplmlljpfvpttsplpvvlvptlfmtppfvjletmtjvmjvmlffjlesjmvsfpjefvlepvffmvtppvelvlevvlspjmeftjptesfvvvvfplvleltseplvsfmtjmmttvtfmeemesjmjesffjjljetjpsvtptepvsjvvpjlmepelpetsevvjfpvvtljsvevvmemvlvelmljpjtveplllffsfftflfpspvvfjjtlflvpstlpjslpvpvfemjpsslplvmtfvlptsfjelslfefmjtlmflejtetttmvvpejvlmfempjsvjjmjlvtmmlpffpjeevpepppsfmsepeetvfflvjmejtemmtsllfsfvvveljvfpltlemessjvfetjftmsfjefpslvmsmmtffffssvtsefmvjplfsltlmpvvtvpvmsmvelsefsjmpepsmjevpmejetelplttlmssmlpjlejfjspljssjjtljjefjevjvsvlfemllpfjseeefmfjtjmlpttltmvvsjepsplvpmftvjtmjelmpvsvmlflpttlsltjpesmjslljsmfjemppjtlmfesjvvffmjsplvlmtjvmplppssesmjfvflmtslfjeppvsvjmstettfltjptjeplvjpvmslmeevemsttjfvftttesseelesjmfvvffplmvjljllmspejtmfjvtjfepmpltsfeftmtmmtlvjfvlvssjvjtlepfmtlmpsvfevevttspvmvjstvlpljjstemvfetjsfmvtlemptspfvemsljmfmeseplsvsjeflefltsjjplevllejlmsetjvlleflmmppeesmsltmlesepstjpvslpstttfsmejpttjtmjvtspsvstspjteevefjpjeepefvsseletjtejtjftppsvsfpfmmjmlmmjjelssslplspejvtjpepstjsmjmtmllptfttftvmjeleejfjjpvptelpvmtmefmmesmmetveppvmjfsfpsevlmptjpvlfstpjvvttefvmlelfmvftetvttjetpsefeeflvsmpfmmjsfvsjfpmfmpmlsvspmtpppmeptjmlsespseeeevmtsmstfptjfjfjmestvvfftsvvteejsesefvjjsetptvslpppvlmjvmefplvpjjtjppvpjmvlmtmmefspfmvmtvlttjesesvlspssptemvtveplpvlsssffpltmfsmefvpllevvtsesppmjtmvmslsfpmlpeftlljselslffteepmsmmlsmlemmsfttsjjslsfltevssmjvvetjeelfsvtjpftetjmftvlevtpljvelmpevffjpmvsmlsvjsltpjslmleptvsmesftetmemvpjmmefvmejjmtvvslvepjlmmtepvsvsfpvselfljppftvmpmjfmlvfstfpssljfesevvmjjtlefevtlmtlemtsttfpttljfmeetemvtvjsvlssejmftvfllejmlfvltveffevllfppmtjsfftpfmvmemfjlfplpltsfjetsjffpevjllsjltpfjellmpppjfpesjmsptflsseljtfevtltmtpfffptmtmesetlffevlmfmfmjlstvlevpjeeltlfvplsmfvstpmjvpvfvevejvfveplfeempeljptssvmvsspvjveelvfjpvjvseejpljvtlljsejmevfmssmslsvjpfeeletlmtvetemljjvtlpsefetjjssvjtvtsefsmpljvtvfvvjfltesetfsffpfttpsemtsjppptmlfltjtptevvlsfslmlleltfjvevslfvvvelvjjmpmftsvjtlpteptmeepstpjelemvtlflvjtmelmlfftjjfstsvsjtpfsjljplmfemjestfmtstmfvjpflljllsfelppetmjfjjftpfpemppjspevjemtvfmemlvtspjlsjspsmlfsevvseeljjjjefttffmjtjvmftfemfljjttjjesfpjftvpmjsfjmmemteeeljltvteptmettvemjsmttvtjsevesjfflvmmsmtltelftjesftljlsfvmmjllfjtevmesvvltpljjevjjjllselpfpllvtvjsmfjepvvtspmttsptttjtvsslpjetmmssvjflmmtjvmpempssvstvsfspevtemtlmeftmjjevlemmtvmpttlsvlemtpvsjeffseempssespmslmmvevmftfjtpftsvsfmflsjvsejftllfmssttjetfestsmtpemmsjtttlfmjtetlsvjeelvmvtlesvleptvsstjvesmsfemmtfvmseetvlssflmjestsvslpljfmvvtpettjmpevptfvltlvlfptlteepmeeljvfevfjmmlmejfeevslftffmevpvempspsfsfjtssjjtvvejfmvleejlvsstsemsjtlvjpvetjflpmjeemftffemvelejfsmejtlmsmpjfsvstfvmjslvlttsfsvpttsssvvvtfpllmjtmstvlpvmtejpveesesttfmpfvsejlelvsjspftplpmsepptljttjejtjjveffjlvlslpplpsjvpslmvvppmtfjpjsvsfftvmeljeelejfemsfsptlljelevvsmsplsfpfljmmvmmsjvsvmvvtvlejvpvjfjpmmjflfmmefpeevpfetpffjvplttlsmptsftltejsstslfvppltlllpfejpmeeftjvtflvpftpspvmpftejfmvfmjmffmeftteeeemvlvlpeeeplpljssvttfjjltemlvfjllvvspmesselljlpflptstjjesjljepjsltpjpvtvvefeelseevtsslmpljljpvvefeepjtlpvppllpepppsmeemjmsllsmjvstefvvmtlfemmsvvjvfmevjfvfeetpjtjsfslmtsppflmplpemmptljeftemfflfemjfltlvjjlefpjvsmlmltlfpjmjmmevsesfeevjjffjltplppmmefvpvsfspfvvevesseejjttvstjmffsevtlltvslpplfmtjmttpvpffejpmemsslvtvlemssmflpssplpsfsvpmjlvfjpvfsvfsvvfepftetlltmejfvmltsevvsemslvjpsesfjvmesetjpvfjpfssefmptvpmlesetmvffevtepfmspsmemmpjjtletvjmplspvpmstlfjfjtemteslpjtjspssefvmtvmeetlletvfsesvsljlmvtejjjfssmtljljsevjttlsfpjsmltptjmmfjjlemetevpftsjtelslesvlmjvlpjefttmlvffmlmlemjvemmtjlmfeesesvmfmssjmfefvemmtfmjfjmvvffpfjtvfptefetppetffmtjjftsefvsettpvfffssjjfmjjpmljlvspfvmpfpljpfemevjfsltltjleltevvjpvftfeetepttmtjeevfjtelejjelftlpvpelmlltsvsvfvfefstefvltmspjtspppsfsvmjvjjevstmevlflfjsfvppefevvvjpvvlpvmvllvlltvfsljjjmsvmeflllpepvvmttjsvemjsmsfsmjtlmpffsllmmfsjljtfsvssfmpjpvtjttplpestljejlfftfjvmevjpfvvljtfjpeptelttsljsmjlftfsvplejsvpjmmpsmmpfejvsflssjsmslfvjpssfpjpsemjjlsvsselslejjplfepsptffjfsfsflvesmsfslpmtjvsvmmmfsjjltefvpjtfjmttpppetjmejletlevmppjsvvtlvjlffvmpsvvjfemppsvveetllfvpfpjejpejmjpejfmfsjelpplvjspjplsvveesveeveftjfvpfjlelvlelmeeepmsejtejsmeslfptmmtjejflftmjelveeftefeejemfjpvejevstejmtpetmffllssemsvtfsffjvjelvlmjvjlsvtmpefjjffplltfjfpjvpsvfjmjssjflflffpsemtjttmmjsvesvvljtmetvfpvfjspvmtmllpjeteeetleesjflltfsetjeflmmvjlemffjfttjjmfjmmemmeletvlfttlfeestfepjstfpmplvmvvellttmletsepmpmjflvvjjjpljssevvpmptffvsssjsvpvsfvmpvpljletpeljeemmjfjlfpmssfvlvmvttpjmpjplseplvppsjttsellvjttssmvpeejsmpljlmteplelljllsjpelemjlvmpsmvmmvfemltssjstvmmlmftjvltfvtflstssvftljlfvstpsvvjftvljljeelvjtmtstjsjtfemjttepmmletffjfsptflvfmpmtmssplsvtpemesjeevlfelepjllpmvflststlllssetemepsjemssfmsefttpvptsffjspvltlfmtpljvlfvpsflefppsmvpfetevmlsllftppsspfmmefmfsfjsffjsftlpjvmspvjsfvjvmmmvlsljlmsmsmmveemsflfefplfvfvffmjseesfempspsslsmtvjtmmvvlffplevvmjpvsltjfsfjslsvtlssstmljtjttvjppmptvpmvtfmspjssfepmftvttepfeptpsslttljmemvtpsllfstjfftmvppjmfvfjjlsstvllslstjjtsptpvvmjlvpsevjevflelptmvelvfevtfmjvlevjsjjseflfplsleesvsmstjtjveemvlmffjeseevfvejtmtlsvvvjvjlevfjmtlfpmmmtfvejejsfstvtttpsltljlmltvflfjjmmfvtssvsjevfmmesmvjlpmtsppmtsvftsmtpmpvvvttjsfjplfevtfefvmtmfflttpptmffvsmjvtlvvtleppjplplsefslstmpesssmlftppttjvspppffvelmflvsfsfjvlsveplpjlfvesvvljefsftppslvljjjjmljtmlvsvepfpjvsstsmlfslptjlllpjpvjjtsemfjvpfmljjfttlvptvsvejtvesvtlljjsletfsllpjmjltvllpsljljjvvessteevemjlsepmmfltltlmjftelvtptefjjmmpelsvlssmelsflmmfmvmffjsevjllmtmesvpvjpjmpjsefpvmeefvsttmspmjpevmmfvflslseefjpeftltvetpfsvmfeffpsejmmsfmvlessjllteejpsvjvfjlvmfvltvemjllmelmjlmvjtslepetjmllllfsemjsslemtppmplftsemjevvljelfpjepfejplepfjvjfftvsvppsvvmslpjjptvmeevjpvllvmetmlesjpsslesvevfvllleemmvsmtvtpjftemmsljvmsftepmtvejlflvevstfmllsfvpjvmppvetjfvvsvvfmsmeljfmpvmjtjvfvlpsmpvmmmeepslpesllfstjejspppvsllmjlllmltjjsmmfeppflpevvelelpesmssltjmvjemmpmljmflmempvssfpvvvlfevvfsmleempeetlmltmveejfetsejejsmetjvltetjjffstjlssjftjvplftvtemlefjvleltsepmmjjjllmempmpevfvfmmvsesjpsvfjtfjlpfeljteptttmsmvmjjpmmjvmvsvsflmfljteslpfeejefsmmslptvlpemjssjesvptfmelpfvtevvepsjmjjmpfplsljpepmsmvetpmjvvpfjvtjspjpsplvsevvjstjfftsvvetfvmvmvmsepttpmmfejmelvvfsmvsmtftpfejltjfsevsstmseffjppjftlvlmtpeltemfmmtpfesfmpmsjttsjjejvvvsfevtpeljjesmvtfstfjfflsllltptjmpttfjtfjjpfvsvsjsmemlmpjfmlsmjvljtpjpflejefmetvjmemfvmvvmlemsljltvfplljelmjlstlmseljlpmvmljffjjpmfpltmesejvjvpvfmsvjsveeplttpvlpfjfjvpmlljtfetlpmemvtvfffevfmepmsfesssjpstmlljfffvpsmeptmmllmepfplfftejsljtmsvlemtljmfsftjesjmmmstjltleesstlsssjvjeljsmsetsespemvsvmjvtmffvllvtepjlmeltmjsfeesjeejlvssjmfmplmslfplpmtplssslmepeejsetvptsvjpemmltlvssslvjmfvtltjttelemlvljeepfmlvtlmsjmttvvlfetptssfjplmlvsjeetmsmsjppmfvevsttlfsvvpselljflpmfjvlfpspveftvemspmtlpvetpeppmvefljlvljtpjfjfftejlmssmteflvjpsllsfvmfvvefjmjfftplpeppvjsmpfesslpseftelpmtsvftvlelfftvpfjttlvtpvfmlfsltlpjtetplmspesstejfpmvsjsetvllsjjsmepetevsmpsljemtmjmjfmjvtplffppvlslfpvleveejmslsmjplvmlvvfttetfmesppsllfsfesjfftsemjvfltvvltemftvjflvfstsljjfsjsjfeejtmptpsvseeseeetsvsttmflveepsjmvjeppfljmpjtpvjvttppevvsmtflesftemfpsjttpjjlevjlsjfeppfmsvsevpejlfssffseeelpmtllmesplllsstjjpvmvtemsjjvmmsefmttefvpfefmemfvpepfvfemfvttsfpltvtjfljsevtslstejmmfjjplsmtmjpvtmsstmeeeefetlsvjpmjppspfpvlvtejlpjespsllelslfjvpvvpslvflpepjesmvvmlltmllefsspvpllptevpjlfvvfvjmetflsmjfssejvmemftptvstpvvjmmmpttevlpftmevejjelstmfvtvstpmfjllmjfsttvvjllpppsfetsmpemfvsmettesjsfmvtjejtmtssmsmepefjmfjfssmpfmejlvffeflpletepfvteelstpjpvmeltelmmpefsssmvfmtvjsjfmsssstfleppjpvtjeffjttspvlmemefstmvjvjptfpvtemmfmemtsvfsmjmetmeefepsmsflsstpmfltjvjsljpetefvlsefflveplvvtmlvjepmeesfvelfjmsvvefpvvmmmlfvljvvtsvjpevmesmetsspjtveljvppvmsefvtjtfsfevjffsssfjltljtemfjlpemmetptfjetfjvjefssmjlmefttjjfslmttseltffpjsjlfspetfjflvelsllmllvvletlvlvfpvlttstlptvppelmfsvsttvptspssmjmelvvjvtlfjjlvsvtflfvmsmttfvmpsepsvejmmjeevppltmltvfjfjffmjpjtmejmtmfesjsmvvfvlvfppmfsttmjppmmlvmvfppvmtmvvfffmlmjtmtfvtfmjejflttsjmmejleltjsjplmsellstlseppmjltvssmplpmmftsfllesptmevljflfftfejvlvpvjlvefjlvsmsfpsllepvvsltljvlvvjlpvlllteflmejsvmlsjemjpeslpmltfvmpmvffsfvesemmlvssjmfsjvflvjefsfsjpfvptllptvsjlmllpsvmetetslesspsvpjpvfmpejlpmpspejvmspltepfjfltmepsmjtmfllpjlefmllltlsmetlljtmsvpmsfmmlfsmpjpmssejelllfpjljjsvpstjltvevftsjtmflptteelppmfmjesfftjtfjsefvsstjtpjfvmefspsmpljlsmfljeveteljjspjvtllmjjmtpjmmsllsjvlttfsplstlsjfmvlvjjejetltpffveemmsesesltlfmmsvfpfjpljsjesjssfeeepvjfpftpjmvlelejmvlfmefjslpsvsvjvfleeeslftvmmfelpjvlvjmmlpfmejmepfptpteejmfspjtjmpseffjlemtmejvllfvvfepppetffsmpfspflvevtfjvjvtsfsspveemelmvpjjvvejesspsvmepjmlsetvfmppvsvfmpjveveftsltppmesevstvjjtljfsffetmstmspsslltlvpvpjeefseselssljtefejttllvpmsffppsjtfmflsevmtetevltpsjspmjtvftfmsljtvmmfjstlsmemlftljlpjveljmvvmvemppjljplssvfpefjtlmljmmlllmjvlvemtvljeplejvflvvjftplsefpjeppptjvtmstflsptlslfvjjptjtjvpfvetlppfftsfvemejvlvjvflfveplstptefmltfsmljmjvflpejttevlmjstjmpmttffteslplmstsmppmemvfplsllfjmepsmfvjpfpltvsvjssttjevpppvljljfspesstpvmllmetmtpteplseflvsjjtljtjtmpspepfpmsmmvmlveteppplsfstejjevvmfffjmseflvpttlvefjejesltpeffvevsfjepvesfeppfselfletvpstjpjettjmfvpmmlpvfleejmtsmltpvjmmmfjevlljljtflfpfjvsttmptsemfstpfvmvvjsmfmeemlvflpjfjpsvjfftsvmpmfjfmppfflspspsvmlpjjlmfjvepjpvjlmmetftveteleplvsfsfeltjpljejtlefevpssfsfttptjlllssjpetvepjjmfesmpmpvtjlvspvlesvppjlplflvlvjvjjsmpspmtpmlevlsmvljeefssflfeejpslejpmlptflptfjmtvjmvtevjvvsmtmflejsftptpjsvfttllflljsfemsfvtlsmfsvlftetljpvsmtmsevellfselemjfvpjmjtpllvemmjvfpjefejmmfvtsepfpptfjfefeltsvvljeflepfltppptsvllfmfvjtemesmmmfppemvfltsvjmlmvvltpfmfjvvmfvjveepltmplvmpvfmslffmfllpmmtvmetvjmvvstsfvttpsfjjjveflmptvjtfjmmpfpsmejjvflstvlsstssjsltejvtpvvppftsmmjmetfsmjjfveptpmtesstsevfmsssttleffpetmefsjvlpsmlelfsjlsetefeeppeleftejevjvvjpvemmtsltfllfestvftjvsvmlppejppmmmvvlvsvlmleemvfppfjppelpvvlpsevvtljlmmffljejetjfvmjljptvjspvlmsleltpmststfjvemeeemtftlfjlelesjleevsemtststvvfvmvfmjlfpjfejtfjpstvssvtvjjplljvlsveflvmpsppsljvtjleftlmfpsmmsvvjptelvfstelmftflvpspmtevejellpttmmpetvmpmpvtmemvvevestpjjfvetjmevtetmjstppemfsmvslssvsspjjmstetelvfmsvvjlejtsmfmmejstptfsteletmmsffsvjvffevteelvljmjjtfplslfltffspjmjejfsfmjefjfsttsmjvvvfleflspvfeppttmlmveppejmsppmeelmtmsletjvjpsvlvmemmmfpmjjlleptfpjjjsveljstttssjpmlplvpvjmmesptftejelltfmstpjffevelpjeeefpevtfeevmpttmjepsfesvjleelpsmvsmtjeemlljemtmllmseemjspflpmtppeflttvsvetlesjejepfssjpeptfsmspmlpftmfefplevvvpfssjsjfejjvevjejmjfseffpjemesmfsmvetjftfetvslflvfpepmpmttlmplttpstlvtettpvpvjmftjlvpjfjvppeslstjmeppmtefstmjstvptfstlvfpvjelvllsslfjejtlfpftpfsmspvjvpsttfvevvlesfltsmfslffjfesetptsjlmpmvtmslmlpptfsvtfmpsmvfmepeelffjfmfmjfjffjjmjmsejsjfltpvtmpmmtlsvjvpjevjfetmeftmmffvvjmeesmfpmpvvlsmmmsfjjlmtjsslfvjlfvllteffmppejvesfsvpvmpllltemjepejspejvpelstpllpvsstltvteevmpfftlejptpvempeevvjjmvsmlvptleplsvestfjsssvmfmlmeelsffttetsjppjjeletellfmjlmfjlpvmjvfplmlstlfjevsvstljjjljjjtelltslmpetsjmmlfpstfljtlvsffsltfjevejjesesevjjetevpepemfvffmtmfemvjflemeejttepfsjpvpvlfeelmffsjvlpsllfmllpvtesmftvjejsfsmmjjtmtjepllfjptpslmvmpvftjlvejslejjfeppefvellvsvjfejvvlpvfjptvelpesjtjsjmssttsftptvtljjljetmsjtltlsvstvfjmjspspteftpeesletjptssjtvlmlmemttesfvjtejlspveeptffjelmpfjtjsmjffmjptjfsvvptjejmftpmjvpjvmjjspspfslfvlejppseptpflvlspplfplsfjjlmjpmfvjmtmetjpletfejljptjelpttppfjtlemfjssjefelmvtfvjstlvjpjpelsmmtjslsspvsemfvvptvmmpvmfmfpjmevpefmteetjjevsjltvvmsetljlsvlfempmetsetfepjjflfmvlfjljttfjmfemmjvfspessemttvfetmmeseflpvltefefflmvvmmlfjfpmptfptftfmptstpjjsslsppelfjmtelpfmesljpepfplvfssvjvptvvvjmmtpevtflvltvejsefesmjpmjmstpvvfjptmtlfstpsmjejmftvvfppfpjlptjessvjjtmtjjmlmsmjffvvfpftfftstlejjeseffsvmppssvvlvmmtpslmmmpmpeptmptjjlpevpvsfvemjlfpmmmmffftvtmtpesfemvvfljmpstmtssfsppfsvflfpejslfpjmefleftmmvljtsfpmmmeflpefpvlvsslemvssllvltefmejsfptsmtsmlmesfettmmtssvppfmmtjsfesletfpseftlptjemjtmemlsvmjpljljjtslefslvfpeelevfmtfjelfpvtpmltlfspjtssvvfvlsfsmftvpvepptlepspjsjptvsvmslvtjpvvftlsjjmslvfelflpmvjletvtmplmjmpfpftvjvjevtsftvveftpmjmjvtplppetpjpfvltfvfpjllveemjjfmfltetmtlvmseleeefvttltmepjjtfvtmltfvjeeeptfpsjpeleleejsffeffvfsjjmlefvmjpjsevjspsfjjtjlfmpvslmjfjfptmtljfltemempmpvltstsftflfjlepfjlsetttvevpjmjeeeetfmvvpsepppttltlsvvetpjlfmjsvppjefessvpmtttjspppjpmsmmmtpetljjtespfetvsptstlslempstlsfftpvjmjsllsfmelplvmvpjpempvjvmeltjmlvllejjjtvepjmpmevfsfvepfjelllvsptsvmvssvsmjpvetffmftmljtfjemlseefmjlmltspsjfjmsmsjfmpmellmettlsvttfjljlsjjlvpejjlvlvveljemtevtvjelfvmljevfjvvpelemssefjjpjpjllfsmftpvlmpteptpmpvtlmjpstlttfstepmlpvftsflsvtmjmsplseslffvpvlvpfmjejmmllevempftmpmmtlfjmtftsfevlejtvllsjjpmpjvpsltlfvjfffpvevtsmefeesvfjvtvtsjfeftptmmesesslefttejtpmmvfjfptvjtpevejflpsvvvfsftpetfsptttfelvlfpfvjepltfestvjjeflmljmeplpfltppstttltlspjjmttltjefjtfmjjvvvmsmssjvvvvsjvfpmfjfffjsjesvsmttvljvftsljjemestffejelfsvjsplpvfvfesjvmjtmefsmjjfppmsvfttvvtjtfjpppmtjjmfefpjvjftsjvetfpvmmjsjlvmfsjptsvjtepsfemmsjmsplmmtevfesmptjfltpslvjvptsssmppmfmempsjvjmtepjejesspeplmljttjtsvpesfvmpmefsvjmjpllftlemtmmjmefmljfeltstsespmfvejslmvtmfmvlelvfmtjlslpvsfjlmfmpvjespstfvtpmmjtfspesleslslflslttettlmjevtstlveelmppfspjmmpljsjmpspevffplvltfpmjmfefllssvjvsttemsjmvlvfjtpfsllvlvftjpffmmpfjffsljtvmlmvvlteepsmlffmmmmejseeemvtmmpsvjtfljpesvfeeslfeesflmstvjfttmflptepfemtlmmflfsvpjevspmffvtlljvfmesslteepvpjtveejefvmseeffjpptppslmmvlvmlvflemmejptjjfetmsmvlsjtftspmlmlpsfpetpeeseevjemvmftjflfpjesmjmffplmmjlvfefpefjpfsfeslsepvptmvssllteemlsmjsflemmjjppsefmvtlvtsltvtevjesmmlfsevfljmfmfvvlmlfsmfjvjpspslseejjlsmptjjttfetpjjsltevtpmjpslpslfvtplsjjsstmleffspjljevssjtfmmsjvtjpsmlmtlfvsjelevvpjptjvetjtvlmpstmjjlevpvvmmtljpsmetlveslesfmsjmtjfptjvvjfmmevmteptlllmtlmtmjeplmljmvlffsjetjtmtsvmssjsmjmetlsjvmpltlftpelmjppjsesfjtpjjjpljlmpsfmpjpljpplpvstpefepepllmspstpfsltvestjjpllmeleejftmltljfeflfltesftflvpsvjjjflmettvpesllmtjpvppvflstfvjmteevfemtvevfvmlefesmsepvlmepmspstvmjfvemfjvfjlffsmvffjtvpmeefflfmsvltvevlvttsssvtlefvmftvfmfevvsfvstpjlplpfjttjvppspmfpttmmfemppllfvpvjjvmmtjstsmtelftffftfjsvtslpleletsjmffpfsjetttmsmmjfeppttmslljevmtmvljlppvlelmetsveejeempjffltemtstpsvfmjvffppjejlmlelvvempvevfvfmsfmefpepsvvtmfftptsmtfvvjempllssslsvpppssefsjlempelmeelfljlpstmevtpljjmjvvjmvfsffjjpvmetpemttlesjeepsevmmpfvtjsjvmsffsppfsesvftjjmmmfffeppjelteelpelvpvfjelmltmtsmvvtjellfslfetlpmjljlleepjltvmtplvfselempvjljlpttjepmpmjjlppmtvlljmmsjjptlvjtpvmsvflfstmfsvjvvvfvpvfevjsffjvsmsftmtjpmjtmejsffsjfevsvljepfsevvslvmfljlttvllsefemmssjtfeseesljesplflpjjpfvpttflljleellmelppftltmfejlvtjpvjjtspvsptmjlplvjmsmsjfesmltljfepespempspepmpmsjttmpvvsjlemlfsfjjjljptltsvtelsptfpslsvjjssvlmettltpvllsmtefsppsfvlevmvsvflvlvemfssvlsvvsmseftjslvjvvtpsevjvpvlvmfpsvjfeljjtjjpjteemlvmsvfvmfljlvmsvevtjllsssflfeemfssmfjsjtvltjjsvvsvjplflvjmtjjepemstpvvvfllpvteespmteftsepesjlftjleletevfpjjttfpjssvespvjvfmvpftptljsjvtlfmefejpslffefsplvvmtvsepmlsslfvsmptmmlvvjtsettjfmevstepmmfeffsjlvmpmtvmvspvjmelmtfeflpeetettsmpfssvmvmlfppmfjmftfpljpvspvljelslvppevlpsjesepetpeevlttetfttmjmjjevsvmlspsjtfvjsvtspjssmfssmtpjffmstevttepfpvmltfvfsfvpmmpesffmltejssvvpsmmppvpevvmjlevjjtpvsejjsejmtvfetfjsvffffjljvmmtvesvsllfmvflfefstfvvpemetvjlpjsfsffpesfllvfletmpmsjlmljmjfptvfmpfjsljmjptfppffpvtvjmfltmvetvvstlpsjetfpfvlmstpefleflsfselelftmpejtmmvftjjlvftljsslllsetptltlpepsvmfsfvllvpppmjsmtmejpttsptpjtseftlespjppvmpvjempefvjlemtttvlttelspmevtjpsetpfjptjvvtpemvlfspepjlsjmpttmvffjjvsjtfspfemfjelsmevsefmsppfjvssmsvmltvptpejjveeevlftfsmmpevjfvtptsmlmmspsmmpsfjvjjfpmeefttmlfslsvvmfvljfftvvtmpfffsjlstfplevtetjsmevfejlvevpfpjvfljfeemjpvfsvjlljpmtvfsmvtjtsmmespejsmesvevplftmftlsjemtmsmpmjffssmmmefjellpvessllsvpjemssjjfsefesvlftlmeppmftmtspvvempjelsplmvfmpesflspvpptvtfmpjfffteepvemlflpfjtpmmtsefjltjlejtpjsfleelmesjpmpvsllfleevpmeepppjjvpttefvmeplttmmffpeslejlesjpspmppvpjffttlstpjfvemseessfpltjtmljssmftslvesfpplfvssmefeesejpljvttmltssltjtjmmsppvsjtllfflpmspevetljtjesmvtptessvslmpsfpsesvfljfjfltpjvvtplpesmvfmfjevpemfmvpjeeflsmsplpvslssteleljemjtjfjjvjlvljsvftefespejplplemtfvespfvlltmssfjesslefftspjsmslvelfmsjevtmfvmmlvjpmmpllmpmvetlspsltlmfsefmmmtlpvpvlevpvvsvsfeletvfptjsfpjlmjljtpestttfemejjmpfsljsfmlvvvmsemfvpvmjtflpfeemsvvlflpmtejppepjmvlvljltmpjmfljtsfvmjtfpmpsljfvpsemtffsjefvmmpvvvvesfessesmfvmslmpmjleltvfjltsfpemmvfjmftepmefjjvltsvtpetflfvvmvemtsljfejjlestsvplfesettvetmemmpjsejfffmevevttemtljfvlfpvsmetltflvfpvjpmmvjjmsjpmevtfjljtpmsjpevplsljpvfsmpflemvevmsjvjvpslsjmftjmtttlvsvjlsvemjmpmsfvvspjmsfpvmsempjspfljlflsmvsstsjpmstftevfmpmmptmejvspjjfttemtlmtptjmfjveltsffjvmlteptffmjtjslefllsjsttsfjsppjjpfllpejfevlmpllsplltsmfjvsfsmjtsffltmmeeepmljtljvvpmfvppjjtjjmmpsffevjtpfpvfpvlmjtvjlfsptjetetmlltpvvvjlttleevlevlplljejjssefjpjfsejfjffmpfpjvvetpsllstvlflefplpfsltlvmfleljtsveppfsvejppjmftesfjtfvtfvjtsftljppvepvjvtstffsljffljsesfsltslfesmemevsstsmvjljlpvplmetpltstmfepefsfpplpsmtvpvfmtlefvtsffesevlfjvfpvvfvtmvfmptmppvppfptmejttetsvjemplpsmfftmfsfjmtpmljvvsejsffjjvtlsesvmfttltpsttepjsvfsmflmtmefeveefpjsplffsefsjmstmpstjmlsssllpvmsvjepslvpeemvsmestssfjlfsfefesjtejmetpepejvsftsmvjttmvvvjspmlvmfslvjpsvfmfpsfttttmppsfsjjptevtmjmtptvetjetvtmvmelttpsslssfsetepmltpsffptslmflelvsmfelvsslefeppttsvmtefvjlpjljjspllllvjlpelllffmpeplmessfpslftstmevtmfeletssfltvvtjvseleltvlttlemlmteflfmpttpjelsellfvvemmflmjjjesepjvffflvjvlfpejfsesjvlemfptvejeflmjsvjmsjpeptsfltvesppmsmsptsemvseleljtpsvmjsepjspeetmpjvjpmvesjlvsspslllfjpjsevtvesmvltpesetflmpsstjvvsememflvjtjvsjjljveemstflptftvsmeesljjmfmjpvvjtmsljvespjjsfmjjmvfjpemmlmvttftpffpfpepslflflmfmevtmtmlvssjejepfmpfmvfplpmetlvlmmejspljtfvlffvvpjsmtpjtpseltjjvlmsmfvfsmjfstvpptlsefjpsmfeetmlfftmeepfpjmpvsemmftessjspfeeetlljfpjvlptppjmesefvmevpeevjmljstsesjsjfemjfvjevsfvpejtptflepmsjtpvmjjfmvvtftsfjstfjmjmsljpjjlpmvetttpplfsftvjsllvppmmejfsmsjsfteepfsjmtmjllvmttltssvlmjtfpljljslssemmllsvevmsepsttsvjslpsmlsetfpvtlfvfllsfpslpessjsjjvfvtsmjvjffpsslsseseevfvfsjmsjsttpfmsplpmslvvpvjptvmljlvlvpessjtvllfjslmeplvemvftssleesmpvsvtemttsvlfvlvjeemlfvmlsjjfvejetevllfptetmllmpmvvjvlftvjlppvfmlmtmlfspssjetlfelvstptevvjpsvmssjemptfvvepesvjvvjjfpvtftsppljsmfvtlpelfpemvpspsesjvltepelefemevpevsempfeltllffmvjefetpjpmfveelstftmffpvptjsmvljesmefjffmlveemfemtmsjlltssmtpllsemmleesevvpfjpvmpvemmjemetfvlmftmvjfsjffpttftftmsjlmpfejjttvspllsftlvvtmmjvtpptmvllljellpvfpvsjefvsfemfetlttttlefvpemppstfejpjjevtlsejlemelsjjsmmtpevtvmejmfvetslvlsmjeeffvepvsettjlsmtppmslmvjlpvpfjjefftjepjptvjtfeetlpltlpfjsvtlpmjeseppsvvpftsvvtletjpfevvlslejpjlffttfetpfpjjftlsepfjfepfttlvjspfevmselfvpmvvmjppmesptfjsteftvlmllsjjtjmvvtmefememtejfjjesjjvttvfvvetplejjpfpspleelllffvsmjljjpeljsfftttsmfplssmeetlelfpsmeljjejmleemmmffpssmtelptsfpefeftppfselfefsmmpppjfpfjmfpvpvpspttmfmsjfevpfjfftljtpftmfejmletfslvsvmvpmtfteetstppjvtplstemstjjmmevvplevmtsjsjemvsvfmjjjlfpfemfejjjlfsmslvmvpmllfpsljllmeeevvflmlmlmmevelpmjtpemvjfspstlpflssmtlpfptptfvpjvpsmfvpvsmleftsmsmeevsvtvsjfmvmevjejestlelfmeefejsmmfvjmttvmfespmefpejpmlseejpvsjftsmjfejvpltltsepvsmjmpfjmmljjevmjfpsevfjltptjmteetpefffpppelfpjmelpmmpllsjmfvfvjpleejvslpfltmvpjelfejfsjffvjpjjejmfppvfttvpvslmfpevfjmtjlsmjejpfvvelvpseeeseltttsjttfeepptvfmmetlefetfpmtmfemmveptftvftpjslfsveeesppjmvesttfmtslssjsffstptpffftfvlmvsjflvseefevpjssjfmfpmstlfpsstflspjpespfvteeptttllstlslvjptjjvesjpfevellpjflemmtvfvlsftjlefjfpelmmfsjfesmpjtlvtpfpfevspvfflvtesfvjetjjeetjevljsvtfmjsfefepsmfefmplmlftevssppsmflmspvtjlllvjslvjslvtplselmlvpvjevssvfmfsejsjmsjellsssmljmpvtjlmtjstlsvljtjjfsfjffvvlvmsmjljjefejfjsjjeefefvjvsfslfvpvmmmtvsfvpmtvjvmmmfvtvffejlfplsfjtmefjmlvtseelmvsfflvjfltvttevjtmjfteelmjeemlvfevsflvtlllmjevlsljlsmlejtppfveptpltflvmptvjemsftmtjjmllmlfpvjleffljvmepsjmjelfjesjsmesvjsplvvmvssmmmeevtjsjptjjvjetmjmslvmpmmtmmfpvlesfsemevlpmtjmfemepsvpfvtfpmtttmemmeffpvepsvvsflsppemfpjevvsetjemfvssvmfpfptljmpjlttptmpsjefpltvmvlvftppsleltmeljmlvmeplttpmftfftmpmssvesejsemjpvtmsflfeepfejvltelvpmvstpssjejmspjmvsslvplljemvvjttesjefpppeejpjpsjfppevteletjvjesefjtepmfjvemelmvplmejfsvelsfsmpsmttvtsppmtmespflfjmvsljjmffpvstelsmtjmvvevjpfsvttjvstsjvelvtmjmjpmmsltjjvpvjpvjvsppsesmfvvjjljjjslsmffspemmmmmfvsmptpfejmtmesfmsejlemvmvfsllpsmeetvpjppesvltfmvtvelslpftfppssftlvjftsvpllfeseepljetssepfppesslllpspelvfsflpftjemsmvfspvpvmelsvspmjmpjjpesvtetsefvsvjmtjmfjvsltlsjvftmlmeftjetllvjtptfmpjfmfplvfeeptsssjssjssppmjmmtlmemjeflppvjfpffjmtjpvftmpettvpeslsleetllffjvespmtjjtfjfplveppmlltsmvpvefmtjsvemjmstjpljjvttemvtsstmpfflplvlstffmjvmvlvvfsljfpefjltmfjevmjjpfvpftpjlpmttsevvmslvvjjtlsmlslvefllvvetppmjpmpespjvsmmtmpsjessstjjsvelleesmtjfsmvvvvplmlpfflelljevlfejlmmfejplvfsmevjmtptppvltmmemjssmjplvveemempsvjsfesjmspevssmmfsljpmvvvsmttppmjlllplleljvjsjtpttmjfsmvmppfllemellfjjfmfvfvejjllpljlfjtmtmlmelpmfpsvfsjevsmpjfejtftljlsvvepmmvtfvttljtpmmeteespjvfvfsftmtlplmlpellfsjvvptvtvfsmtspsssffevlplvttssmjlmjtmfmvvtmlsttjvtjelssmttfeltemsetfftsljpejetjpmjpjlllfesjjsstsvvftmflpmjpjjvtlfpsmvseemjfpmvmmptmmvttppjstvpselepmslsseetsvemejspmplvllfmfltmvvpvvsvfjlvstejtslfjstvpvfsvlmetespslmmtfptfjjljfvltvjmtjjfslttjjelvslelpvmevselefjelmjftjtjpttejvppjeeeeltvjjtmejlvvmtellmvvjjteftjpsseelfsempvsefpvtleelpfflsmtpesmtftjssesptjmfsejvvvtfetjefmpefplpjetjtlftjttetppjvsmmjltlplpepsemsptfjvjtpjppejtjjtvstpespmsvspleejssettplstlmsjmjmmjjjmemlsmvsmjtlfjfelfseftjsvtefjftlvlpfjevppstpltveejessjltvsmpmsltmvvvfemellfjjfjjmpllmmtjpltfttjvffptjlttftptvvetjvspvsfsemltvlsmefmtfstjvffvplmmesvplllflmssttpptlmsfjmsfpmesvfpjlfpltflllfpttfetfesslessptvlejfleejlsvtmmmmfpmevpjfetlmlmtjfptsppfteleempfpvlpttpvsepempjlvljsejslpvssetstmesmepetjpttmvffmvmtpesjvtfvmmvfsflftvllmmltjmesemlffmfevpettefljttesepmmjvvmtvpmpfeplmmjlpjtsetemjslsjeesvpplpsjllejjmptjflsefsfeefjjsjemsvpjptlmetpmmffvstlttttmffvjppmftfpsvvmvfffjetmvfevpepmlmfpfessjesvpltpfvljplttlssvplspelljjjtelpmjsstsmffmvjssvljetfltemvlmvjfvtllmmeefmlpvsjlevllmsvjvffmvlmseljlsspjlettmlsemfvmvtmeteptvjfveffftljfemllfvmpelmtfevetjtetpsfpstepfmpftpmmfftjftvjpejtflsltjfmtmsmttpflmemlteeveftfspmttfsfltljpetsvsmjmtelmvtfeevvletepsvtptpvvfvpmjevmflpsmpetfmeevltfvmetpltjfpejfmjfmmtmsetpsspmsmjplljpjtjjvesppvmttlevvvmsesfpmpjtespftmtvselvfltmlellvpjeplmlflpfpeseeptsvpttljtlslvmetpffjtflmvjmvejmsepjlevptmffpevlfllefvmlefmvllevjtmflpeletpsvlstvvpsmjesjlptstmemejfsmtpjftflevepepmpeeesetfpjfvvmmmslmvmmtptvfffmejjtlejjljlsjsjjsmvvjptmfltltvftflevfllvjjjmmlsmtpmfpffeejttjtmtsjpjpepsfmpljjsltvmtsvmmtvpfvspfemspvevslmlfseftstpejtvftsspsetjfstfptlsleemfmmtetvmletffjfstmmtvtelsjjfjlmfvesvljesfefsfemfmvpstptspmljsjjmtslvlfmjejestvsejetelvsffptvflffmsmltfpvpffemfltjpjsftfpjtssjmejlvtjpsvesljepplsjejfftjsfssleeffllvvfppsvmssmlfsvplvsjmvemljlejmfjtjsjpffvvjstsmfeffemflvljlftjemmfemmjfvslllsevtvmjetplefepjvltppvsvsfvlpellvsvpjfpssjsvjlsmfssvelltsfteemstvmtfvmefjtpvmfseelstplffpjvjfvlmpsesjteevmfmltmejeppflfvmtemtjmllelsjtpmjttpevljslfmevlvsfjjtmjtmevtlvlpfmtpvesmefvpftttfpmpsvelfvlmvsltvstsfjmjfejvljmpefjmlftvjmfmlejltsjlesstftlljjvvtjsesvsmtftlptseflvvvtmtejjmsfmplvljfvjleettjejvjfjfmsvppmtmpelfvtpfpjvpfflfplllvjfpempslvtejpvsppfvpvptfptvlteepsetvvslljeeftvttsmpmpfjpsjjtmmesfsmmmvvpltlejevlfeftjtetmpjevtejsfpejjvspjetejellmvvjsmmjjjvmttflvmssmfetjjtppjfvslvpjjmmppfvpsfemvvsptsepfftpflesvsmtmfmjmjjfevpseltptjjsetpsetltljtpssllltjlmtjmpfstvfjfjvlmmeelvmsmvvesjepejtlsmjpffjtepjesvmepsfvfmjejpfspllsmfmvtssjvmjmfefvffsjspmjtjmvepjjtjvvmlsjftmsptmjvppemeslmmlpjlpslsfjtmlltevmptmetjptsjjjefpjjmmlvmepvplflfvmslsvpvtspppjjeslttjfttjjlsmsfetplmfsfmvstvvtpvlfljemmfffpsleljsjfmsvfeptmvmlvjfeptpsftmemlvffljvfjtpfpvemfjslmesvfsmeemfjlevpjsesjfvfsvemepeflmltjtsfplelptlmfmltvjttvvtjmsttfvjtmjtlvlsftvjmjvvjpsvefjvftflteeltppffpstplpmljmemmtpmeslveeejeeftlpmssvtlmeptjvefepmjmsllstmmmjsjtmptjjpmvmljvsseevvjsmtssmvemepvpsjmjsfssmmplmmvpjtevspjvmftpsmjsfpvfssljvfllmfjjtftvjjefessvsfptmssemfjvemjvflemesettttfjttjptpvppmfjsmsfmtjtmevsjelvemftjtjjvmvfmspmefejltelpspstefvpspsmsjmflsejpefetjvjvsflmfvsffjlmlppmfvmvtefmflmvptpvtettllftepvmejsmplfmmmjteempellfltsslpefsefjeseejjfltmlsmsjeslfvjsjfeefmjmfmvlemjlelmjvtjmltmsjvftmtvpjvfvmjlfltpmfmfsvlvtsmtejepepfjfestjslfjpvpvfvtmjmsvflvpmsjlfjeepttvpeejjfmseffemetmtfpstjpjlpmvevtpvvmtptmelllvlvjvefvssfmmjmeltepmstsvlsjepfjlefttjfpevpvtljmtmmsplttffvsjvlmpmlmeefevlpjtemtltmsvtfjvtefvjejpllvmfvmpempevelvttlepeejfjljstflvtlljlmsmjeltvfsejtpelvtpepmfppllvtjfplepsppljeefstpmjmtflmmjspvpvfemvptvsffmlmmflsjpvmfftpptplefsjseelvsvplpeptvpejlemeepjsvvsmeptjjjletvepfpeljetejvvvvpltvvejvpmmmpslsptlstvfsjpetejmvjpmpssfvjtfepvlmlflptjfpsfmflvsslmmmvjlllvlsltpmjtmjmvjlvflvlvjepptlslsjlvvpsslmsljmfvfesjvjspepsmefvsjlmfmmfeppjevlfslmejeljvlfvmsfffspspjvptltjmejsmlljvjpmslpstjtsvfttefpvsmmmspjflsptsvpmfsvsljleepmepvmvjffmlffsvefplssepefesvfvessmeflmstmflmltvtsljfmvpmfeffmlpjffetlllvslpsmtpjmfvfpvlvefvpltfvejtlpspfftvvsplsjpllfjffjmjfmvmmmsmfpspmfessffjjejeemtjfsfvjvlpsmljssftfvltmvemsteslpletljjlvvemeeesleetvmptttvlvlltemtvlvfjeevpljpeptlsjjsslepppevmjlmvftjflpjsplppmlsflssppvpljjsmpsvfjljtpmfesmmlspjfsevlfemmjjmjelmvtfstfetmsjsvpsjslvljvlmtptmejeffvvpfmflpvvtfvjtsfevjesptlmvsvesemsfltlvtmpeflfpjtefsfeppsveepjslepetlmsjjjttvmjsjsjsstpmespvlfpesjmfslfspmjmvvjfepstpttlvpvpejlttfltftjjjeflsltltvstvfmlvvlleesfmeessplemsfmjtjltemflestmtetvejpsmlmjesplesevetssvsmsetjfjspjpspmjjffplmftltmlfpjjfjfspffspflsftptvpltlpevmjsjvvvspfspvsstppvefpfmtvfjeemlmjsspempjfeflssjemeejlslpppllttejtpfpsvlevvfmpemsljevjtfltlmemjpssempmppfsvsfllepvstfvvjmmljeelemefllfttseftstemtspevspvjjpfsjftvsljppemlsmfffplsmsppppvmspfjmmvspftjesttejmljsltmjtfestsstslvfffjplmtjpeplmjvssmfvjvmlesfmftsvtlfpefjlvvmtvlvmvmjmjtvlfmvtsjjeefpvtssstpjteftvelfpfttpmfevppjvmlsjffpjjpsmttfseppsjesemfpsvessmftjepejppsmfpvejtsslmssjjtvfttsfeppetpfsffemfvfejjjfvfpltmmpfmstfeemffmpttvpljpmpselmmsseepjssvfjmfmtmpftpmlsjmepmpvtemmflmefstsevmseestvfteseffvvspltmsvevmmtptmsepvejjmfflmetfsflfsfsjtllmvvjvmeflplmssmefjejfptpmfmsmmlpfjeplsjpvfmepslpmevjlesmmtvmmvtjpevsfmtsjejsvfmfsmettpjjfslfslsevejsvslsmtsfvmvmmpslfppjfefvejvmevllssvstsvseevtsvpptsmlffjfpsmjfsejtjlptmpptpsspvmjppttspjmesvptefmvsvjltmspjfsfsjemjstvlsjpjvlfpjjmpevfmsmpseeljttvvmmvlmjvtjpjfvtesseevletpjtpvmtvvsmtsmmeeefsmlvtpeesetfpjftetlststfjmlftsljeptmmeletlvtfssfslejjpselmjmjfefvpfevsvfvjetsvltfjmtvsfppfepteepjlefsvlfffsfemlllpesespjfefjesvseteefjpltevslftsmjllmvpjftmvpvvevpjftsljmslejmlmfjlvpfpsvfjvepevpvleltevjpjptfvtfvljmflvejlllefffppjmemvjmplmpseljpesvjlmmvppefjlsjlmfesjsmpmflmplpplpeeeptvfsffjsfemjltmlfljfjlstemfvepeptvjflpplfmtmmjflpjvtemfsmmjfmpsveptlmemjllvftelmtjstjeppfvmljstfmttlfjtempmtvsvetltftpljmmmpsptmlttpsvsspsfstmltpellfllvmljlsftsjjsmjssvejljllssvvfvetjjefmjjsjtpvmsjmmveevvvtvjfjejftlsptemmtjmmpvsfvvlppmfvlselsmletlsvevpteemffjtettsjpspjttvvfltmjmvvmmljevpjfesttvfmfpsvfeeetsvvtpmfmfmsltpfjljletvsjfstpfvlvltstjppsfpvsvlmvppjsfpfsmvvttjvlljjtvmvefvtejlmljejptjepsjffpplvtevtvsvlvjtjtlfpptfepsftsmfmlftjjmppjpsvpspjetjvfjpsjsfvjlptpjpetevsjjjjvlmjtsvjllsjstjtsptvepttsvmesmfsmsfvlfvpfeevjsmvlmtemptempmmttjetftpljftvemtemvpspttlpjevljssfletljetevtsejetetlsemltvleflmevmvjlmvetstfvttflfsjmllvvslssptmmelptjjpjlvlppvjtpleffltvfmvvjjvtljmmvstmvpljpjsvpsmvfffmmjlfeepsjmpfsffesjsjlttejvpvfpfsmmeemsvvljfejmsjjevsmjptfsemfljtlemptpfttjmljfefsttsjmpptsfpmsemlvevteefsmtjljspjtjjfselmsjlvsvjtjsmljpjlstemmteelefsfmmtvjppejtptjfvvffsmseplmtsefefsepmjsmtmjejllellesfvvjmvjjsmemelpesjestspjepvmmvjlpjjessmpsllflfljmflljeejveepejjvptepplfeftvefpplststfpstfvjemplmfvjvffvlpsfestjtlpeffjmftsvefslsflpmfsvfpestlslvtevetfppjtelssfsevstlpjtmvlmfvfsmtljettmmejfepmtjelmelflemjmvmsstfpsjsmmmjfjteemvflljtpljltmtftjmtmttetspppfmplmslvlvsjmllspslmmepstmjppmtvjjetplepmttejvfmttmftjjffeefvfevevpeljemsvmepefevseejfetvlmtfmlefjvjlevjltjjvssmtmpfvmpemljfjmlpefmpstplvslsmjffvesppmsslejjftmllfftmlpjsvfemlfeptllsstspsfmpepffjstvjvvpvsfsftmstjfptslplfslvjmtlfltjtfjfelmfetspvevjlvljjmpettjvsflvfelmsvelvjmvtfsjmlelspfjvvvjtfmljvfemejfteejlsmmlpvempsseestljvefpmlfmltpmvmvfemlvmeflelmttftelleleefseppvptplttjstpjesllfefleptlstvvfeemfvtlflpvtmlvsffmlltvfjtvvjtjvtmlvvjfsletfmlffsvejeeefemmsestjmffvpjfvtmlfjfptsppvlljtllvspjppmfjemleepfljpmtvvtvvsvetvsltvevmmmpjvsltmspmfeflletssttlpfempmvfmjtlepjvsftfppetjsmemmpvvsepmtsfvpvpfstjemmltmjmlplmtpefssepemjvptvttpemjsvvelpfssfeslepslvtlffsmpmvsltljmvjtlpmmvmelttjfplsmlejpljmvfjpmpjtjjtpvtpppfmptjmptfvtfetptevejfmfvlfvjtmtspmjjsftvtsffttvlpttvtmtmtvjmlpjvleteetltlfeslvetvmflptpfltptpptlvefmmsjjpvtfmpfpmjsjvvflvetjvpevpvfmmmelstvsjvpfjspjlspttjmllvvptsvetjpjfjmsstpsjsvejltjttsjslpefjvpltpevmtsevltmjelsffevevvmfsvmjmevesslsmplvmjstmlsjmmfempspmljlpfmjfjejsvltlseffvjfemlmtlejfveepvtespemlmvpltttvtjlpfesllpejflsfvvmpvpljpfftevpfjtfsptfmvjjttstfevvflelfselssmempsmflvtseesesfvejssjevmjmpfjftslmlvjesveetljmffjltpmellpjeejpfpmslslpvjemlsefjleeejvsvpplfjvlpjpjfttpesfefvfflmjevjvfvtfpllvlvtfvtmefftselmplvpsesvemtemepfpelvvppljsmsjvtetpevlmjmjvstmpmfvvsvpspjfsvpfevpsepvssepsmtvsvlvveftfjppmefsjejsmfejtpstjfvvefjvlltpslsljjspjjvpemsfppjsfsflmmsfljpjmjvmefsfmmpfjplsjtmpjjssejljtjjeelmjsplesllmsfjpffsttmtfpjtspfltfmllmlefltjffevsjjvlefspefptmtpvtvjpfvslsmjvevfvftestpptjfjvmvfpesmmellljftlpeppjmepfjjsttssvltvpjjtmmjeelvsmlptfflmevltvtmmefvppellmemlpjptespjsetjvspfplpelptfstvlplelpvplfpsfesmssjltjtfmvestssffvllffletfepsjlfemsvjvstjveljfflstfejfsvmvtlssppfspssffsemtmmsvpvepetmmjttmfptmmpemvjllpjpjjvvevlttmmejfvsjletessjfmlsmetljvsvpsjlvltjvestjpfvfmsemfvfttssvfllpmfesjpsvlpetplfslslppvtpvesvvlfvvttpfestfeljptvmjpjljlmtepeesmftmlsvtvppvmtltljjfemvfpfpsetjvspjjsppptletpvljempvjeeevtpttfejsmpfltjtmfvvjvjvljftespmjptpsfpvfppsfjlfltjflpsmvjettmvjjljsejefjmejllveespllfpsmjmmfssllvmeteppsvmmepffftmjmttvelspfsleffeplsmlpvtelpmjvevjpttepejpllstftejjleesjsjjfepjlpfjffljsvsppjevljfsesmftejmjjjftlfevjsepjjtmjsepvvfsveemtmsfvltvppvmlpspjssspsvmfvtvsmejejpmmeeevpmsjtevlmmefmfmeevtppveemefvssmjjpptmjtmjjeejplstjvsevmlttllvvvfeljfljlteljpjfejsllfpttspltfvvpstftmltvjlveevetememjtfjfptvmsmtvepppejvlvslstvmmmfejemeplmsltffpttjfvptlvlspsfjsltvvlljfpljmmpstjfvsmfllpsfflvfjfseptjtffjplfflssvflfvsmstptettptlpspsvmppfplmesfmppppvjeleesjvlljejptvppmpsttvslsvttetejmplpsjvmftevsmtfpepefsftjlmlvteptvpfepsfljftvmjjljleflpjvtmslvvlvftsjfpesfmpjplmmfefvvesvlpevpjlfltseppelptespjfsllvtjsjftlmepvpsppjsfjsltpffvjjvepfspppvetetsllltfflsjlfelpvfetpsmevlmtlvvlfssttpplsveempepjfsssjpmtpfmvevtsmttfeeeeevpsmmsmsvjtpepmppfmvjttetpvmlvtlfmfvmmefspsslpsjvemmtmpjejspmsevmtmespmtpstvpvsevmstpfpsstplmjfmtfvspjjmfpslejejefvlmvpspplejsmjsmsvejsfpteempjffeltffmmmptpellfsmvmmslfmsljpvjvsemepsfjseelmeltleflljptvfjpeespmfjestmvfpppmllsvjstltpmvlvpftlvfevlvvmsftfjeeteffjsmvjvtesjjplttvsplftpsltjmtsfpjmsjsfsjtvjltefsvljfpvltjemtfmltjtmemmsjmjflmseptpmfflstvvestfvvmjlfmsjelejmstfpfellsmjtvltfvttjtfpsjeevmtfmjmfmftvvllsmlfmmjelsvvtpmvssmjsljtplselpjmjttemfsftpmfsmmejttfvmsvepsvstlvtmslepvjfllflsvesljfjpvepljtvmmmltmjfmjtesmpvmmfmvpjtlvejepsejevjjpfeefmjsvjjlvlfpfslvlllvesmmlteeljlpjvpttjpmjteejemvfjjtvjlmejfvmtljtslsvelpsjspelvlelepfmljjfmtpsmfvmslpsplpvtvmvlplpsfvtlleplvflpmpstltsjlmeftemfvltfmfptfsssvptfflmsvjpfvvltefjfsptftpltvssfpvjlvspspmvpmlsevjpttpjlvtlpjftmjmeetstejteftjppvljmtlmeepejflpvjflelllmtvlefffsvsvpejejpptvfmtessfjstmfjpptmtfftfmtmpsmsltvemmjsvsjmfsjptevmpmlpljeptmfvettspemlfmsveepmtevtefmttpvjelejflsmlftsvjetptfjjsttftssmttsettjtvmpsvvlvpsfpvemvflmtsssfjlemsjjpeljplelpjjjjtfjpssvffvljlmfmevefsvjltjfjfljtesfmsvpjssmfmejmmsmllfpsjpfvtssltffpselltevffpjfsfpfvjvmvpvtlmvmsejtjspmmpjvsmpessvljjmssvptmvltemppttpejepppspljmsjfepsjfevpfpsjpvtsjtvlltppsvejfjvsfsefvmtvfmjsmmjllsfejjjtlpespmetttptllfjmvjleftftvjtltvtffelmvpvlsfvjpfjsvjmfsfjtepfmspspssjlevmmtflsvfetlmtlfmvtmsemfetjpljempmjsmvffvjppfmmfmtfvpfessmplpvtvteljmvfejjmpvmftsjtvlmmlsjvsvfllefmtltlsvfstmfesljssplvsvpjtpvftlfvjmtfevmfletepvseeesepvpeeemmmmmvvmmmtftssjpvfjvvfeljvvessjejslvsepfpffvsvvttmmsstefsjjpepspvfpfpjptplvtmsteeftmpsevvtlpefjseelvsmmmesvvpmtlfvfsslmsleempftvmmmssjfpfsfmfffvjeepvtlemfpepmfpmejmsplmtmsfevejlvsvmvjvpstljssjfmveplsjtevvjtmpfellflljflvffmpespltvmppsssmlmmevevsmemfjssjftvemejfttetjsplspjptvtstjlmtjjtlvtemlvpelmftvltlmlmsjvmlpmfjevvfpfsmsmsfmlvjffevlmljttlvlljslpetvstvvlspevvlmmeejpjmtftlmeemepjvvveemlsvlsemmllejmlsjsmppltpppesjspltjtvsvfsjveseesemlljmsmtjvltvmmppptjsslvleffjfvemflssptjjtmjjtjetevepmtsmfttjvsjpfltpmvtelmpfleejlfmlmsmflfspltlsvlefltmpjjstlsjvpesltpsljtjseflespmstfvlvppsstevmemmmepfetpejemvstsljjesemvvffvsvtlmmetsflememmveltelmfvtsleslltvpslssvvttjltmtevmvvtjvsplmeptfflvpsefvsvllfstsefvpsllsefvfjlvsjsjfmlljmlplljjmsmfjjvjvlftefvevjjtmlsffjvfflslppetepmfvjelptfsjvsljtmtspfvstjmtvsvfltestslfststpeflfmjepptfmtmlplmlstfsmejetvlsjtmvltfpjtvmstjlmefpllmfpltltemffltlmlsplfvpeefljemvjllsmtfvvvpmltmjmptmtjsspmfettslltplfmtvpjelppsjsmttlstjvpvejelljtsvspsmmlmltefvmjvsfpvlpjjvvpsjpvlsvestvpvpfpvlfteltfspjemvlmsttptpmevsvmtslltflpmfejsmveflvpeljtjptjtssslvtelmjtmfefejtfsttjmpltsvlvelptvllmelfvmmtpjflvemvmslvlpveejfvjemsefteemvlelpttevssvmfsvmpejjfjstmfpjfeemejtspllmfmlvmlppempvesfpleljjpvpmfvplsefttvtjvvemstmmmspjtlljpplpsfsmvestvjmmltjvjjsmfetjlspeflttjlvpjftvpelpeljjjsvmmlvmejsmpppvmttjveptepjtljptepttmvslsfmplsfvpvlslefeppefmplpvjvtjsvmmjfplljvppsjfmpvfvpsllvvjfefttfspmtletvjmvmtfvjfvpfjfflmlmptplmteeslsjmemltmtjeltlmemplftjsvfjpfptmejsvtlpespsfjmlvvmmetlffsssfpfjjmvsjfejevsvlemeespltmvepsvfmpfmmfllpeeflsempftstfmljvmsfslmfpsevpesespfesmmplsfvlvjfsmpspmevppvjpstffltmmsetjeemmemsfpljlpsellempmmpmjjlvsfejpmesjtmjmlsffpptmvvvfftemlftjtmetvfjvtjmjpjfjlteljvplelpseelvvletppttjsppstsftvmssevtjtmpjpftsvlvfsssjppvvpllpfmsfvfsplpjjmepstmmttmptvsjjfmtletttpemtepjvljpjpfjjpjsetjstejtmvejjmlvmemmvptltsflepejsvtpffjmfjvfttjlssjljmpmfttvlvvtfsjmfpsjffvsvvsefpjplplpefevvmefslvvjsfmemespfsfjmstmmmvjssvtjfmlmlmlesfmpmvlsjemtlsspetmflelslspfpeepjtjsmejjejftljmvlempvfmlleevpppmfeevsfljffsjffmppepflfjmvvltplsfssflvfmjjtplelvvppesmpppllveffefejpseefjjjmejsjjleeltvetlspjlmfsftefepmsplelpstlmpmtffsjjfjmeevvssmfefeejtmtlefvevpvvsvmlmpvsvejttflteepjjfvsfvsmpmlpfmmfmvsespssfstpjjsjpejjtlmtjvsmefeflfmjjeepvvfetlelllepmepttpptjvfefstpjlmffjjpevjepljvpemlfeslttleplpltpjfmefpftfpfveslppsftletvpstlvvvlffetlpelepjlvslsvvvvesvsjvveljfmjssevfjllvfftftvvvsepllstjlltstjvlfvljjvfjesmfsvsefjpssjjjfmvemepfmfljjlevpsevflfemmesffjfelsmttjfppsttptljpvppmefslpfsjttfmfelteslsevvvpmfvsjjsslttspttevfjsfsmetmspjptfmjpvtepvsfvlmpsmjfepslpfmtjlmsfefstvlsptlvfplspjfvpltppmvspfmjfsptjsemflevtevjvjpvllfeejsevlmlvltpjpsvtpesvttjmmflsljmesmtlljlljslfptjemjlfvsvmmmpslfjvjffsplpssppvlllesvjjsejpsmjmlsjleslvteplmtvesjesstjtvelveemememfmsstmmftmemtfpflslpvffeffmevesltjltmetflemlmjmflttjsfslmfplmpfstvtvlmlttsmpteetjpmtstfteepjfvjjvspvsvfmljeppjfvespmlflfmsvljjeleltpfmspsmesemtevpetefspjjmlfjveemvemvslmttfsfjjftpfevppsvfstvpjsjtesfmjjpmtmmmsltlpslsteefjjjvlsmvpvvftjselpfpjfmfmlvjevtsmmjmpptpstvllspppsvmjtmtemvplsfvefvmfjlplmvemjsfjlvjfltfllmvpslmlsfjvepflespsjevptelmmtvejetlvsssffftmvpspeffsjfjpfesfjepfjppmmpppmpljmlsejtetjfjtslsveepvtsllppmfvjvtesfjesfsepjtvjlefjlsjfslmvplvmppfsjjtlelesfvtemmessvtstvfpmmmfejejvlmpjetpjtelvsljfemfelvpleffmeselsvvvttjvmmjvsmetvmvessevlljppetvlptmvtmjfpejtpmlmpmvejsemtsjvtvpffefpvetspfmlvftmjlsffpjspvvffjvlptjpemslvmetlmlmsmmlmmmmjlefpesvtslsvjfjstfvsjleppltjelssmjvvjfmevsvmpfstlvlvfsvfvppmeevlpteppvlplssfjjftmvlptppvflvjvmjjjttlmvvesjvmmlelvvlmsmplsefvestlsjsppslteftftspvptlppvvmmtmetllpfeefsmvsvesjsfssvjfjjftsjvstjttptsmsffslpmfvfftjtfpfesfpvetjmlsjlssfstltflmfptelpvsssmmtfellmfllmvtljevvsptpsvpvlsetjjptmffffletsepmjeeejmepsmpeffjflfvmetjsmvplfjmevfjljmmeeesteslppmjsvvjttffsestlsppvfeemvvvlsltpltmepeevetmlpestmllesslemlflfpsmmpptpsvpptjetetevvjtljtlltslelmeltvfsfjvmefsleelvjsfjpfvttpjmlmsvvtvsepvemtppttlfljesepvpjvlsltlvtmsmsvfmeplpmvttseejpftvlefssmflptfeletevvlpletlljeftffflmlmevtttlsepsvpttlmtvefttfjljelvmtfpvlvmfsvplvllfsjvjmfsepvtmvvlvselsjjlfpfmssltlsfpmlfmftfmfvlvmttmfspfsjeeljlepttvvsvftflpmfsvljlefljfeespvesssffetfplplleffjtjeejfttsvvtvjeesvlvjtevpetsjffpfmvstlspmmfemmtlevefejvtejejvpelespsemslmespmpmletpvmeetmtspeelejptvstetmjffvljpeevfeplflslvemtlpfmelvfjtjpsveplpsejjvsevllvpltmvlpmefppeemmlpljlmjftvplvmpmtfvlejvffljmsejsffstspmveftsjvppjevetpsmvffvfeevjjmstjelltpvjffvttemjmffvptljjjmepfmepsftlvtvejvmtjmsffmmlfvjmtemevejjtjtfvtjmmffsespvlftmvjptlflsjpsmsmveppmsptpemssmeemmmsjlmjfetpsjftjsfltsetlpjvmssptemsmmtfmvfvtlsleeppjjjmvtstmjmefmjeselttvfmefftvfjltlmeesmmvmtfepmpvtemleptstetjemfssmlmstlsjplpfmlfptmfvjplffsllsestsptsjjmsvjppffjtsslelllmtvsjtpssstllesvelfsmjmmfpmsttltfempfsjjvfsjsstftjleptfjsltmmlspseellmteljljlmptvvfjtfmmjvjetlvmffmlpsjjjppssetsmtfememjmppltsevmvsvtpleleeeltjljsvlemjpvsemlsvesefsmptfjfvevmtstvmlvllmtsevpvpvtlvftpjsfstpmllpeptfvsjejfffmfpjmplfvlfttvmttepffmfstppspevlppmfffvftmemptteptspfveeeevjljslsvsllevlvsttpfltjevevjptejtpsttjvefllspvjmsmepppjstmvesempvvmvvleslejplsmelsllefmmfsfvpsvteemepspsjlfjljeffmseetjtttvtvjjemflmmssfllpvtltfjetfpffvemttflvllfpstlfpmlevsemlpmtesltsvvepspstevjmlletpvjlejespmvptftlsfmtlljlmeejmmsjvevpmspeelfjtllpslpffjmppvfsetmfssjjfpjltvsmvjljvmejvesteevpplmpvfjjvvvflevllspetletfpmtltptjvejffstsspppttmflevstpsmemplslfltjmtsvveljpslmlemmmtpllptjvsjjpslmmljvptpeejtppsvspmfevsflsjmlljtstjjvfemmejlvpsmelsvfmffjpvjseslfjplflltjjptmftfplstvtmspjlvlltsvppvlvltjmlmfptpevlelllemeeleelmjtltfmmveffjjpmppepvpffvtvvvmmftlevftejjmvstfvepjppeespmjtjfjmtvsfeljltsjstefstlsjtjvsfstptlsvmmmsvefejpvlsfffjsjfpeltmvplssttfjvtjjltelltmsmetpfmtlettemflftjssspjvvevtjpflfllelfmsslsfjfsepmjfjevpvtllvpemeetvfpspjljlmepvjjftmlpvvlpevefjpmtflltevfvjepeevtjmpmmjesvsptpseejfmpvtvsmstvtjepelvmpfmmmptsleteestetjmlevjllfsmvpvtpftvpljfjemsjspfeespssssetvmlllptelftelejlftffpfpjemfltvjlemesesfpjvjjlppfelljjltjfeftesseveevvfjpstmjmmvlvljessfjfptmfflmsmspssvmvvmmjmttspvptppsfmpfflmfltpmpstemtlpvpsstttlmvtfssjpejttesvtllsjjpjmmemflsjtslmvmfmtfvmflmflpttpplemplttfjmvtfsvvmsmtetlltttsppplfsvlvfjmvstmesmflefvmespsmptljepvfmvspmfsspjplvsevlvesmletfesepvtlljmmljmmlvelleltejemptsmleltljsejpelmmfelpvlpmjtjvsvmtletmfevtpvmplepfpfjefplvffpmeejsvststjtvmjjptejsejsmpmsjpjtjssvsvlevpmvtppmplmvmsfevtmlmvjsjfpsplmjpfssfspltevjfslepepmtfjstptelmvevmevmlejtetjmltjsjetsspttjplvmmmvpstfsptfmvspmjstmvmppfletfpvlelsfeselmvvljsptvlmpvmfeptmfevlfmflftlsmtlsfvlfmtlttvejltlssetvmfsplemfpssjtvepslvttpsjsmeevfmfmtljvjlftpeejmfstpfpemsetsjltlfvftefmstmejemmpsjeelsjtppjejjjepvmlptvltlvtjeplfjlvljsesttvmtjmvlsfpjtjsjjjlmsevpfmeleltvlsflltejspjlvstftttlvjvsvtpfflmsspjlsepjfmsllstlvtestpjfjpsmspjvmpevmljlfvfjtlmjjpjtfplvsspvejepmtmpespesljftvlttflfsejlevvtlltestmemtvelptmlljmtmlteessfltmfejvsjfjvlsllpejppjfepfefjfmjlmjssetvfttplfjljtmpfjfeljjpjtlljteljmsetfplljlvlppmmstpjvmmvmvseltsvfvmvtejssvftptpfemmlptppstmfsvjmsefjtsmfpvssmjlssvffesjjelvvtstememvltsvvmjjljjjvjmfjstjettsvvpmlfmtjplptmvtepevfpvffsvjlpmttvlsjvlpssftfffteffselplsmpsvjffmesvptvjejtmfsmeemfvjsljsffejtpesvvflsvtlvffmjssefltfveslsmtvtspsvptmesmjsjpjtvpmemljeltptesvselfemsffspmesvltjeeepsjsjmplpfeslepljestftptvvlevfppmjlflvlmtlspvllpetfevjpevsjppmsjlfjtmssvptmtpmeljslseemtpvepfeefpestpjsttfempsfppfpjsevlpetjspelpvltfvepevmpfmjvmltvepvtjjptltjppstmsmptemtvelfvssvvesftvjpttfjflssfpmftlmftlmfttjjtfspsepfseljsmvsveevfmlveetejlvfvspspvepljjftttvjevmejpjftmlejvpvmjevlempeempmepvtmfvlvemflsmmemesejtlvvtmsssmetsfestftpmjvpmevjtpstfpllppmvfppmemfsmlvlsevvpfpjtvpvmljjjesjvjfvfpvflmpevjtsttpjslsjtpjmtemvvflsmljtmtelelfvftpeeljvpfestmffmlmlmjelvfvjffsvfflfsfsptvtsfsmtvmmejtfsltpjsmpmtltfpffjmtpfsmpefjttljjteftsvjjefvmejpfttttfpspljvvsssjvepplmlfmfsslefvmjsslseflmjppfvetmjvseflltpssttvpvjslletpfmltpfmpfvtftffjlfjtejmtjfpfflvptpjemtmeetstvsllmmjjesljjpveejsjjtsmllsjfmpellmpflvjsffptjetpjtfjmlefjepvtppvmpmlpfefsfeslesefplvltesjpppplpmfpjstjvpftmvlfllteftsllefellvevjtftlpeptjpfpvvvvflptmtvtlpslejjteltmtspfvjlmlsevtlpjfjtepvpsstejejjtsseelfffleeepmstlsjefsvesmjpjjttmppfjpjfjftfjellesptfeslvfefvllmlfmvmffvfslfmfemltpmlfljfetseeflvssefmfletmvppmfjvvpffllfejmsvtpftfemtepspppttetlfljsmfmfleftvltsflvestpljmplsttppmfsevpmptlfmssvjlsetffpmjflltjsteevlpspsvvtletejpsjstslmsmletejfjljemstlmjeeststpjlltfeeettlmvjemlljftpttjvvssvmtmelsmpfpvlefefelvltlffmejemfejlsttejptpjjjjmfemtppmfpfpjtppjpsmvtesmpjfvtssmfjljffplfsevemmllfffteflmejjmpptvmlvpllfllstmjmmsfmvlepfsvlmvltslptsvvvmpslplfvmvtpelfppljstssmlvmlstfvstsesjeejpjtplpffmjpjtllevjtjtfesjlelmtvptmtetvsflemvlevllfevtlttmjjvjjefvtplsjmpmmejllslmvmpstjvpltpfftstevsvvptejeemlfvtvmlesppeeptpjteltplfslmlsptffltmlessftejsjsfssjlsssmflmjejevepftfpfvtsfejevpplelvvvmfssmvemefftjfspllffpejveslttmjemvleseljsevfppfmmmffemfmptsesfmtmtpsmfmtjjeelvsmvssjelsmvvflevjttmjmelssmvffelffvlmvptlmttspsvlepssfsejmvlvjjjmttsesjlfvlptjlpjvlpvlttelsetmtettmmljevlfvjsfsjveljpvltmmvpvfvffspvvptetpejlmfllvslsmevlpvempmeetsjfpjlvespmtpvvjpmpespmlpfpfllvftvjmstjspjfmpjsepllfllsvpvepmjvlvvjmjtjmtemjpstslsmsfveeeeejjfpeeltmsjfepvjsftepsspllspjfjlmtvtmpmfsfftlmvvejpflsflpmlsevjjvvmlemmfpvjmfmlmfeflvsesepstlfvmppfsflemmptpeeljsmlslljfftjsvmlflptmvjftlfjslmepfpejjlttsjpjevmtvpfpjtsmplvelefmmpjtessjjmsspvetemlvfteetemplfefmfevlsplepejfletjtppvevelfsltptmlvmlveeepemmmltjlssvptffsejtvvvejjvtffffjmetmlmjfjefvsmlsleetvseslvevflpvfeptmvttvvpesmefjpfmvtpmpmfeesffpefjetffpeffjsfjvttplelsjtvssspjsljlljtffpmlsjtpplemetmvpetmsvpppptelmpmptlevflpfmjjeslpjtmlpepesfplmtevvmsspvvvveptljmjfeljflmvtfjlttvettvpsmevljleslfselflpmveltvtffssflmelmtvvfsttvvmmlmspspfjmespsvpmfmpvjsfmsmffvmjstsfevfeppellfvmfesvjvssmmsfeljsvsvsfettepjmlemvjmlppptlepepjjvfljtjjltmmjtvtsvsvetljvmstlfpmvmffmjjmpelmvpteltteltltlmmjplsjtptsjfpfjptllespjpetpflpltvvllljpvvfvssffpejvmjefplveslfttfmpevmjelslsevsspjmmsemjmttvmfjmppmltsspfvpllfssttsjejjmfvfejlevsflemjppefmlvjmpvslvfmetmtvttlfjvvplffjepeeevjpvffppjpjtvmsejvsplfepvtpfjppesjjmpstpemtsjltvsmpmemtvevvevellspsssfttltfstjjfmetttmsmjfvptjsvlpljeleseefpmpjffefmtjemjmjsevjttlljspvppvvvetvpjfjpmlvtfveflsesetvveppmjmeelpfstfptsjjssvtmtlfpjmfeflstjspepvvlvpjfjlfetmfpejmsejellvjvllsfpesjftvtetjvfspefvvmfspepmeelfvtetfvmpmspljtefvevmeeslfmtmpvjettjsvvplvljpptmljtsejfpelmeejfefmefmlmvjevllfpvvvtvstfteljtfppsmvfssvvjvpjfljssfvelfmltmmmvtmsjveemmftmmevmtslemtleeeesvmltltmjljpvlftvfpeejpfltljfeljffjljlpjtmjpplsejffpevtstfvfjtspsmfpesjetllfmsejmesevjjvefvmvpjmfpsjssjtffteflpsljppepplevmljmlpvlmmjfmvtsvjtsjfppllmstfmmfmjpvjvftmlstjmllsppvljpvsfmmjtteelmeesvmvjsjestjevmjjftjptttttlmsssjpjmetssjvssppjpvjmvjjsvepfeltjjjtvepvmsteetljfvsevvssllssselmlfpmptelvvjesetstjpmefpmpjepppfmpvmvftjvefsstfsflstvfmjljelmefjvejtpmslfmpmslemesvjtpfmvflltlvtpjftmlsflspvflpsttmtsefttpljmtfjmjssmfffjppjpelmmestfeltpsesfsvestjmpjsjfevfvplpvjlftvmjjvmemssmmjetvjjejeeptsvmjmmmlfjmttmfflmjtsejjpvpefmjfptjsejlpvpvvslsjsltvtefsvlppffjljtstfmtevpsfmpjptesjfvjtlpspfssvjpsvpejetmffplfmjlfffjfsfvvjmvessfmvlfmleestmtsvvellsjpsmstfpmeflpjttsvvtvttfmlvtjtfstvllsvelemjssefjfppftljlpltvvfsmtfljllpvljptepspjspemevmtvvpvmjtpvppemjlemjeltsfjvmmtmjesmmfjssssmflffseemfmessjtfltvlsstvvtjtlelvepfftjtllvvmjljpmlvmfpmmseetetsfsjjvestesjtfelptsevpjtesfelfeepvejejffsllleemvmflvffljfvmfvplfslmmemtepmevfeeetpjpfelmfptjmvpsjsmsvtvljtvjmelstevlvtpellltmvseemmspepttjvvmptejjmmejmpftfsfmjvtjsvfvpvsvpesjvvfmjmsmptlvtpmstjfpmplvtlvpmfplesfsjmssjjjpfpsevejsvvvvpfvtpvleljmmmmmsjevvpltessetvlsvfmevjsjjvmvltfljlvtfmmpstlpsjtssefttmsplvjlltpjlpvmvlettletfspptffmlmeetvfljlsstjsvjesevllsmjpmstvetvpttpvlesssjvfvpetftlmjjpmepmplptvljmvfjfmstestvtlpjsvllmflpvtfemjvtjvflsssfvvslfljmttsllfmsjljflttemvsfvvmtptmmmfllftemlmlefvvjptmpftvjfemfmepjpmsvmvvsvlevsfepjsmjlvvevpmmejsftefvsfllpjfsjlfpmlptpvtveetefvpsepspmjelvvvstmsjfetmettvpffmfelslsvlvtlspststjmplpvveftesvmpeflvsjfstslpstjspvtvpjlsmepetssppvtjftmmstjlfpvejtffelvvsfeslsmeeeejjeflfvvptstevmtsjjjftpselllfmsjsffslsftljjmtvvlmevpptmjtmtleeltvfmsefmptmmmtftfmvspjmjmvlpmvvsplsjltfmtplmjfpvjpeevlfvemsttttpjsslsvljsftmejejplemmpeltmmjfvtpftvfetmllssvvpjfejfvttffsjtefjvefsfvmfttjttejltespjvltstfselpfjmvfjpepjmttjsseplepmlfmsetstjlpttvptpsvjtpflevfjvssmmvvjpsemlfpvftjvtstllvpmlvmjvpjjljtmvvvtettsstvejstejppmfslllmjmejsmesvptjvvvpjlvtjselleffssjpelljetssjptlvltstlppltvfjtteeelfjpeepejvlltlpjmemtjfvppttlepmlpvmfslejfjlpvptmlltvptmmljtmtjtstteleftflvmvfmsltpvvfmpeeefppmfvmpvjslmfvjjepvelfffsstfeelvsvpfelsjstejflvvtvspsvffflsfpstfpvvlvfvjsepppfvmvtepfjljessspsvpvjepfltsjptvjvmftpmpvmsjftmffpssvmlsveptvfjfetptpvvtfvpvmetvmteslpfmftpvtjspllfltpttpeepjsjsjmjjljvtsvlfjjmvplllvffltestmflefeftelfstljftmtfmltevjvffsvvsflfspsjfslmfepletttslvsvpvjejsetfmsftvpjjjmmtsljtmpemejmtvemmssvplvppjsfpesleseslpvljllfpfpppsptlvjmfsvvppljmejlejplvlpjpvftfpsftslvssjevjfpfffmjtesejtfltlfvmtsvjmjjttmfstvjlvemslptvpltsfppmfplmlesmtsjvsjfslteepmjfeestfvpjffsptjlstjeltfflsfmejljmesjslstflpfmmsfveffpemvtttpffptlltevfvmpvmflsfjvlslseptmpvttmmeltepstlevlmmmsvvejmjfmfelefmtljptesljlvslftlftevttjfjsteljstfmsleemvsjllejtemvssfeevmpetttmlesfpjmetpjmpspjfjeljvpfseejsestesjjjfelejevvjsfejtsljesmtvstetmtjmemjmvvtmvfjmmpjvlpetjvepslpmmjlvfeptpspfmleemljfjetefmfeljplttpsjlfjmlfvltpmsvslpeltvesstvfpsmflesfpflmstppvmmpetmmtpptlelmpmtvjemlvsvpfmmsvvvpjjmlemjltfptvsejvvsvelmpmeejjtvmpvjmsltejssspvstefejtjteffjsspvelfsltseteljsjsttjeeplsvsmmtfmmptppvlsjjfvvppstvtlsmjfjjtvlpvjvsvejpvsleeljplmtjfmffftpfvmjevvjmvtvpvmmvfvlpllsvtmeepejspfffvmsfesfllptepjlmlejtftlmmlflfvfftpvjvmtmsfsllmjpvmpjejmvjppjspesfvlttpejmtftejllftttlmlsvpplpefseejvfslslvvmpflejttmeeepvltmpmejfltfljvmespefemspftlljflvjsmemftmvlpvfpsmslpjjlmppfljpelfjmeseejtttjvtjptjefpptpjtfsspllvfssfpfmvljspljepsssfjtpfmlfjmpffvftttmmflspepsvjvmjfemtlmfjfstpsjlptvpvtfjevttpmmfvssjsmtmmjmeptfejttllsllmmtesleeplsletttsjmjsvppettpfspfptespevjtjptlvtjtetslfvtefsffmptvlesjmjsejteftjvvpeelffvjsvemmvtjvttpvlseptjstfvfvfesppltlvjfvptljvemjvvtmsllmvmtfpemfpjptjmeeejsjfjlejejfmjjttsmppffstjsjmejslllfpstjvmmpptmfmpefjfssjesjttflltlvpvsjfmjfvlpvtmsvlsjmllfjesflltepsttmeeflsppfjelvpptptpssljlveevljmmjmljejjpvttjlsjjpljmltjvvflsspplpssemplepfmmjllplslpmetsljjvsjltetpevstelvpestlelvmtmtttpsjemmfejtfpsslfttlstejlllffpmttpmlvpllvvepvpjjfmpvlmpsmtsvfpffplfsjvlfmetpvsmtejftflpejeetvlplttelssfppesmpmplptsplvttvfvtplmtvpettvteejeevpvfsvfjsjfejlsmffmtjeejeptstmepvjvjfpepmseejffjjevvvmvmlfslttmelllmmvsjmefjtlfjfjjsespsvjtjppstespevjlfjesfjvlptspvfefltfjpfppspetjtjvepemmfpttvjlevmpvfppeplltvppetvvlsleefelvemfvlsmtsjejjttljpsletpllmvflljesvsfvlvlpjsftefsevsfsempfsestpmfpvfvmmvmststtmsljmvpjtflvsvjevvfsllejestvpsttjfejmpfefpjmjjvttejmllllejltlvmsmflfflpllvevfvpmfpsspsjsmvejvsvptljvmjlfslfvlpmvfllvtpsmfflvvvmmetvstevtjmmlplvfjsjtjpvtpvmltjvpemesstemtemtfslspmeftffssvmelflelettvfefmtlmvlemsvsfjmjtvvejpjejefjpjvjflftmfpjsmsjmfjftfeljjmpfmvflepsjpefspemjttssvtmtsjlvemfpvmjesjflpvpspjemejsfefetevlemjlmljmpjssmvfjeeelefjjtsplstmfptfjemlfljtvsttjeltfmjvsstjppsefvjvmelmpvlfspsjljvmmmeevvvstjpsvfsesjppfvfvjempjeeffpefejmmetmesjtlmtvfpltjlfmtvjmemmeltpppfjsttjpevplmjlfeepsmtelmejjsslptfflevlffessstfpevjspvftlsljejespmfpmtmmjjtlplsesltftepvettftmmtmsfjmejtttplsfpvjmjjmjfsmmjvfmtjlfmtftfpjvvllmlfpfmfvefttmjsjltjpvjmtvvlfjssvvefelmpejmetjelpelpfssvleptjtjfelfsfsjeltfplvmvpstvfteffeflsssslsjffefsfjptllesslmpmtetsmfmpfvjvjppmmjlestppljmlllpefjtvjlmslpmlfjvslvtjvssmvpfplmmvlftmmjlfmttttmevjfljemmfsjtffsevetvmfpsvfplpetesetttpltvfjlpevtpepmpvffvfpptfjjsjlfefmfvmflsjseefjpsfleejmmtsssvtpmmetepmfvmvtsmvjjvspjjfeplmevvvmtjsftvmfltpmsvjesleffpstfvleslfseejsvpplvleeltssvetejplvvmfvjjjlvsvvjvpjjsjmepmsttesvjjmmlpesesjmejsjeevelevppelesmevesvlltsfevjjmtppvspjetvjmfslpmmtmpleeveftpjljmveftlpvmtsvesjejsmlefppsljjpltlmelmejtjpssmfvtmetpjtetelsemfppesffpmjptlvjfslfllemsepvpffvmjmvsstetfejmjpfvvemfjfvlfmsmtestpsjvptfepfpstltfetfpfmfvvpefpsftjtptepfttsfvpffjfelfvvmslvpsjmsfjlmlptsjvtespltefmsfjlsejtemsptjftvpfsvfvpmvvmefpfjjsttvsvsmvlpvjletfplttptjplllsfssmvvlvvtftjvmetellslefeelsstjjpteepplftvvvjtvtmvfljlmeessfppttpppjeveeefljsmtttftsjtfefvllmseppfljltmlmsptvpvtlevvfmpjpsvfjsepemjvjflvfpmjfpffstjlvspftttlmfttfsjvvftfjtpsmvvevlsvvmtslpspltppstsvjejvsfflslmpvlfvspevvjpmsslpmpsmjtmeevpevjllmffvmttvlttmmjjlvftvjffmlmptlfptpmpjsslpjpmlpttsltpellsfvtfpppejfpmlpefvjlfejjtplpjpvljelvfmmmfefsmfftmjmemsvpsvelsejempljsmfjfflvtsfffsjffjpjvllvllmjpepfeppsmlmjetlllpmlvvlpmlljvstppjmlmpeljsjevspvljpfelmvvemflmefmlltsjpfpptsfsvlstpvpfflfemeltjtvpejessspfplftjfflfpmevtsjvtvpspsfffteltmmfpjpepjjtfpmtpfsltvjjvmjvjmfpeelmstvslmsfmtfsvsptjjttvpfejpfslmspjvvfsptjjsfpmpmesftlmmmmjlemltevpeepespptejplvevvpssfpevjtmesjjejvlfmjjptsltjltlejpjsvvesesvlvjtemmevpslsmtpmetemvvstmsplesmjfmtleffjlmsmpmsvtevvjtsmstvvmstmljltppejmsfsfvmflmjvssjmeefjfsjmpjljevslppslejettltmpetsjtvmlslspvfmlmjsvjmstljstejsjpjjtmppfjmjfmpefspvtfepfetepvljsvsjveslljmmeefmjjvtejflvlvjvpptfjeepmfmsfvvvmtsepjefflmsssevlsvsllpvmplejeffeslpllvfjpfljfempppffsvfpmtvltfeselssfjstepveveemtpmjtstmtmvtfjtvvppmepmpllmvffvtmpptmseveslvppvjjlpjeevslsljjvjetvesvfffjsttslestppmplssttljesvpvllltlsjmlsfpflsteemjmvjlteslejvpvtpvlsmffmpselpjfvflmmpjlltvmfevpffepfjlfevptfljtppjsppvmmmppstljtfleppsffpltfefvtjjvpvttvsmmltltlejpmjfpvmvjlvjvstepjplvefevjsjtpsepeetflssvfmjlvstfvftvfpvlmtvslpmppjfetjsvsptfvlfjjstjppmpjmtvfjpelvffmvmmvvlsslttlmpftfejmejmfjjvpfftseeltfsmjmfjjstfefmetelplsfpsllmtmmmmtmmjmvfmsljllmjvvpjsmvemvpjlmsmvvlspvspmfstjlpeststepjstflvvpltstjeetlpvplemttjsslefejetvelvessmlltjmjpevefljmevfetmpjjfjjemjmjefelssfvlttmeeejvmjfvllfetsmempptepmsefsesvejejpssmjvfjsmtvjmltmespsjpstfjfmvptjslfsfvvvfpmjjttmvjjmmlftltfsjvfstvvvstfeljsfejeesmemfvpsvvlfepteesfjmlpeslpvmjtjjmtepjvfmptemelvejpfllmmmsfpftmlpfssljttslftjsppejfpepmsellslmpjjmpmesfltmmvjpemempvjejjvltjlvpsfpvtfjmjvvplppeejfvtpffpfmlfljjpjfpletvpttpvjvltjeesmfljlfetstfplesevlesjmtefmjsftpfsestljlejsfffejvvvvmeppettppjjstfesjesvtvfjpsftmfjjlljtjpstvpejljspleppeeemetlstpstttjemmsfmpvmtjjvtstvellmeesmvlefjpjefjpefmjlelffpttpfeslmtjejmfpvvletstllesppttfmfftststpsvletllsjvjftlfpvmpjlsjplsjsesfvfpsepstlpsffspplstvlesfmsttssejlfmjlvjmplltlpslpslvtfjleetjvmpvltpetjtfvfftjmfspeftvmpjftpmltlvepjjtvvempvpefmptplmpepjlmltjvtjettelplessfvpptvjpfsjtpltepevfjfsjmtemvvmffpelvstjsmftmtvfssvjvlvvmpmepellvpvpmvfemvfsmljtpvmpmpfpjfpjefftttevtptelmpvsftjsfltstvfttlpetmmlffeltveevpmlpfmteffjjvpfmjjtpmvvvfejmfjlpelelvsllvpletpevpfeleltvmpjvppflfstlvvjptsflmppemppmsflepjtvvjpfjljlsmefstpvtlmmpllttvftvllmpmfpjefplplevjsmjeemtemftmseflvmpvjttptsepmpetlesmfmfssspssttjfejtssvflseeevtssmfjllfvmlvffmfvetplellpmtvfjpevlfmlmssjvfvsjttpsflsttetsmlpvmsvlfmpjvjltseevvptljtfvffjvmvstesmelfflfjestfjmvmtpllvltpmpteppttlsejepvsetpsjtpvpvmtejetjefepmmvffjmljjflvpjststjjllsfpspmljtlmjlmvjvmjmlsjmtsfmmstvlmfvvtllelfvmppvpstsfmsfmjflvvpsmvtsjvtpmfjfjvftsmltfmpjmmlvmvjflvfjvtlljjlsmmstjpmfesmlevmtjlptpvjvmeejefsjmetfpjmelfjsmvpfvmlmmevtlptvjpvltssspffljjmeevfefmveftfvempplljevvestfpfjltelvmmflvmspvjtspmvvlveltfjspmtsvefvlejsmttmvmpeplemesvemtmmvelpmmstjlemfljftvttefetevppmlvstemvmsmftfsvjpsvesfetefttmejmpmpjefsefpsflmmtmjmjfemtptvfjjelmffsfevmplsmfmpvefvptjvmlesepslllsvvevtsvslljfejlllfefvteeeljpltltjeslflmjsejemvmetvjlppmfplvemppsepplsstsejesvjffvmvvstvpjeemvsejjmtvmljeveelljpmjsffmjjpltleslmjetttpvlptpeveslveevjlpfmmttptsvelpttvjmpsejjjtsltvvefvsfltepvevjlsssltpepmpsfmfmtfmvjpptljtjtvtejjvfplmejmlsvvpevetteefsttfevestevmefjsefpmvvlveffltlmmmmlvstlpjlsmpvmlpefpmplptmjpfspfvjtpmtplmmjspeffjsvpvtmmjlfptpmljvssfvvtppllltptvsettflsfvjlvplttfjpjjljfjvmtjvefjepmfmvfjsjsvvpjmfjtjevsvltsspsesvftmefltmmptsmsejsjlmemltftefpppmmvsfmlvvlmtlstffljftsjsllepmftsmelvpsmljlpemtjvjlmvfevsppejjmftfvjvtefjempelvmemmjstfeftvpfefsvlvplllpfeftslvttmjpttltejestmvjssmmptfspptfpspvtpsesjjplvlspspvptememmstjlpfffpevfsesfmvfpvvlppmsmfsfvssepsevsemlsslvmtjfmfmpepssffjptlvmmpeslefstleftsetvsjvsllmsmmjmsmtljltjjvlssfepstsepefmptvepesmvfvmfmvjpjslvtjtfmmssmptjvjevmtvltltmlveljvsevtfjpfpvvsltfjsepvmvpetmfvspsfmmsftpsvttltslfsmfjmsjfmtmlsemtfvejjjpttlvejleftjjpefmpfmtfetljfvvplleelppmvvtpejfmlptelpvtstslstfjtpptvpljvjeptllfemmttsmlemmlvlstjflsltvfjeltvtlmlemtsepjljeptjmlelvjvmjjvpljlfssjjfltjvmsvjsesmsvtjmpljjtlltfjeemlpssjstmtltpefpllftssvspjpvsjseetmjsvjetsvppptmmfflvjpjjmjllmjsfejjsefjsvmtjmfppssptmljemfjmemmttmfellffevpeptftljstsvstmpvspmmlvjjmjtlemjmtjeplvsteesefjflpvvmvjsepepjjevjfpvejjtsfpetmlfsjfmfejmmejvfelmmjtpjjttftjlvfsfttlmlsepfleemetmtvtsjemljfmmeslpsppjmmpvmfjmmmsmjlfetlftspjjlvevsfjeelmpememveslvvvetepvmpmppvlmlmejflefevstjfjeemfpppstfpeltsfsmltmevjpmffppmppftvjjttmvljestfsevvtmjjfjjptpjjmejfpvefsslfetsmjeltlettsjjmmtlvslmfmtfeefessvppmtjlsmtepfpveevsfepmmvvlslpvstjtemtjmevtejjtleelsjptvlelmmlesjtsljjjvptjlelstvvvslsmmpvsmepljfljtppflvfttfvsspmpjvvfmjjpjpvlsesmsvpelejjltsffsplpjfvlvjpplpjeslvjestjtfsemtfjvftvfmfppvlleevjpjfmpmmjfsllmmptmfffstmmsejsevmevjvsvljpppmsfftsepplfmfmmmelevvstpffljejepmsfelemfplmepsmefetvmjetevjmpejelspltepjvfppspmftmmttpvplftlfmeefetppjfljlvtpssefpjlfslvsjspelfjttvlvmefjmvsffjvsvsfvpmfsetvfjlpppfvlfjeeemtemlmpemtttmfsefetpvmsvsmlllllpptmeptljlevppjsftppjmvlfplflsfsjlsjtjflfpmsestpeespjpmvpjvflmvvmlllsjmeslflpltflslvtsvejmftsfeljetvjlemvvllllmlsvjstfvjptmeestmfjjpsvjfvfjvmfvtlpmtjjlsejmsvmpevvtmtsjvfvtepllpsmtsvfteesfjsplvltvjvvjjjeppvssfsjmspjptlstpljpvmtftpjjfjsvpsfftllepevtjpfvttssvjmjsmpppeffvejltjmlemetmvvfefvpltvlppsvmmvfmeevpvpmsfmtjeveeppvpslsjestvpptvjsljvjjsfmmpspjfmtfpmpjpfvpsfevsesemvpsefvppmejftjvlfvjmfmsmmftplsssjjjlsjvlleejjmpfvmetfjjffstjjemlftvvvfefjmpjltfljmptmtstlmmsstvetjspjfvfpepmfsjjmtpejlelspvjmjtjmjvjpvvfsfjljltplvvmljpjtmspptlpetmjtjpmmemllevetfvmpvstlllplftjpvvjeeeljevppevjvvmfmevtmfvlevvefstftljlpjljfmtfmmlmflppvfmvvjjmvvvvjmpfsmpetvtffjjlfljtmtffevtlejmmfejmevellvesseeptfsfsettmjlvmpmtevteelmtjjlsvvfvttjpvsljflmesejvljpfepvlmejfvtjlsfttvpevlfvfesslsfppfjfepejjtslttjtleffmjletmvlmevvmvmmlptlfmttememevvtmljfsepvjpfljsvlepvjmsfvvleefvjsslsmvmmfsevtjslmespvjsmmvmvvjvvmjslvleetsjpvmjpjvslspvjtjseeejjlesljmjsejtvjjtllmfmvmmtjltpmmejjptvftlspetpfevmmplltjstmffjsffpsvjtvssmmmtsmeeplvpeffslpetjevjfvtlfpetppffvtpvjlfpfvplfsjfsttmvejsttvltljefmmtmsffpjsjmjtfltetppjmejpllljllsjslllfvvjfltjstptmjlssevtfvtvftmesepsptmvjpmtteefjjlmfjpmtetlmmtspvlltsteejelepvfljjpstjpttvetjfeleetmffmlfjtvtvmtsllfjmstfvpfmlptvssvtjpfetsvfleempefpvpfsllfsvstjljjsljmvjsmflvlvtmvfvmtejjjetsfsejpmmestjpsjmpejvetleppevmlvevejveetsjtspjptljmveevpmppltpmjesfvlllfjpffsseeessvmvmfeelpsltlvpftjmvtjplmlpltsmjefjsetpmmjevvmvsvemtllslvfjvmmfevmfssmfjelmpllesmfsvvfmjjvfpljfjtpfllmtpeftmmsmmpljeptfflmftvspsffjemmmvefvelemlpttlmefvptvfttpfsvetjejvtffpmeetftetfpefvevtfjmtsjvsmfplvpfslfjtetmesmmmsljvjjefjtppftmevpmsvvefftvsslpjmjtspvfsmtpvvtvslesvsfemsjmjfpsfllmlpessejjtttlpetmtfjmmstfvjjssvpjtvfljetteppvljttlefvjemtpveesmfejtsjljjmtstffejjeemffsveftfljlftpsfltfjvepesttjlllfspsjvvmmtvmffmevsvvftppstmltljvsjvmllssjtvvtlmjptesjeltvftpfvfeepeetspesjmejssmspmvvptstemejetltpfmmefmmsmljveslsstjssstltlmlsppllvflsjtslpffspvepemlmepeslpjmplfppffpptvlftjejelppvsleemjmlmlpjpfpttsftplvvjststlspfmpepmljlslsempeesvjjlmfpfjtmpssmmpsjtetsmsltfvesflmjtpevfjtmljvflfjflfftfseffttfjftmvsjvmsjejjtmjmefspttlfftsspjslvllmmlfvmlttttvmvjefpjpstvvpvffpjelvefpfpvlpvetmpjvvfsevetetjtlmmmsvpsfmselpfvjtpjetjljmemjfljlvseslmfvvemmesplvpmsfejvftsmmsvsvljmvvlmlle\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 432,
        "task_id": 4108,
        "test_case_id": 13,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "wnuzuhrchrburwzwbbawcauaqqqrwrxxqbqbwbwxtzzwtrtzqbfbzurxhfzzzarfhzfutrthfawcwwuqqhfwzrbcrwwhuzbwxxbhhnffqnqftxbcxwfqqrtrbtxfcarcbhwhbbuntttnbwrqwafcnzfxbzqhwattzqcbrqqrxbhwnxuxawcuzfuxwzfartrbwbhqwbuhtwwtttbhatzhnzafnrtbaftwtquuatfuthnrbzrztrxhfxqtqfuxwqhxzznfqrxatcrfhnwtqthnhxnwharzcrctzwhhfnxcazbhauuwqqahqqrwhnbcnxbhwtzafcuxabwhuhxuffabttqbhqccqzqrhtcqxnrtcwufhzwxcufnnfrxatfqzxbxzruuzxaxufqtubuurcqtuztahaqnqahqwfrbqzannqthccbtwxbwcwauwanutubwhaqzcffbnufcnhacwwhtbczhfbrhrzhhnbtxqtnacbfrxqxcfuahbxtquafaxffqhahnhzrrcwxwfqzzbatuutatancfhaazqctqzwarfnqqhfqzwxhbuuwtzbafcquhtzutzcqatwcwnnnxhrrnzacnnhtqhhuhfzrqfbraafxwuxtznbffxttrxcnqhurcxfahuwrthbhhnxafbxthzuwfxrbqzaqthfbhbaqrazwnbxtuaqwhrruhtncaufbnbxnbbnrazutabxqaxfctrfwqxxwxfqawbfnquzrwcxffnuuhafhczquauhfxhcabuxtunzrwhhwhrhnthtazwahfwarrtcbaccwffxrfxaquczwbbawtchtbxacanqfrfwwawnbcwftuwtrahbfbhhwxubchzxuqntahuqxfzrwahrcxqtahcbcaqawwwquwfwuqxtnubnxxnbbcuqaqftqnrunztzhzachwbuczabaucaahbwuwfuqxwfnquxhhnarazbtbzhttwtaffzuhnbaratuqbtthnxqacztnuwrcuxhrrzqnxfqcaucznnncanzzrzuqzhanwqxanthabzauanxuufquhfnqxuartbrzqhtbnhwaqhuhbxutxnucaaqqanttqqcfxtnabwuxarzhanbcarnuwnxbwcfxbzzwtfncxzucxfnuwhzuzrnbnnrccaxnbbwqurafbuqnbubbubrwunwnfucfwrhatbbfzcnqfquzuhhhunctrxnawawnffqhnrcraqnuffhuxxnznxcwraufanxfurwhnhzbbzzcnacaqawhzbzbbxbbachnchzzbffrqfhwbqwbahhqzztwwnuqchbuuqqbfzbhbcfxtftccbchfwuxuburcwqfwnazzfzbwwwtuxurttnrqtfczwbfhnnwtaarrfzhutzqbtuwczhufqhtuuatxuxazbbhzttnhtnubrubxcanuzafhxffxabzwttacztwnuruxuuarntabzqtrrhzxqnnwwqrnqfzhwztfwcrraczwhhbaafttznawxzufhhqnqtxzxarrfhnzbhbauuxcbunqffrfwtzqfwrcfqqwrwfuwunbcfuwhbruubznzbacntbawbqnwhcxwzaqqfwthuhxqqxwbfcfqufhzwfabwbuqbuttbxbnanrzfufbzhtqhruhzcbwzxxaqbrcbcnfftqcrqtawtbrbrxtfzhfwanbaqwzhfwbwqrauhuqznwrttbbxrzrzqftrxuzqhttbqznffqfwurhqfncnahbfnfhuutbtnhzznuzhnxwhtxzzrabzucfbwcxxaxquqrhnhqtcwnzhzzwbuftufcqqwnawtcqfxtfauuwbuuuhunanqzrffqzauwfcxqnrqzhuhbcwaqbfrucunfwhfwfxbffcaafncxqtufxqxhxwfuthbufrabwzztrxtwuxqtcqaaancxzwxfhuaxabqarrrhhfqaxbrfrxhtrhzaaubhwuxuxnzxncuzafxcwqqrwfffbtrbfwaqrzuzbwtfccuthtzbfxcqcazbztfwcbznrxqacwcubxwtabhznzxqanbbwqqrxwbbarzqrhhhrhbtuxqwxfutxqanqawaqunzffchxnbuxttucwwfncttwfnzrranntqrztrfatzrbuuwqrrtxqfrrxcfabbtbrwcatxruauxwbnzxwqhfwwbrhfxfxntuxafaqzttqqchbfhxwcrwcztrbhwarhtfntcfcrcxafntzzarxzxunnzthhqfnfhbwxqcanatuznbzwbhbqwfanaunfruqcxqbqnrfxwttnqrrhqbutzwhwraznqaqthxqzcbafuctwrrubqtwuznxqrtrqhfuqaxnanqzbnhqtzwqtfxxaqnwhfzuxwuxxachbuqcctfrcurwtbrahnuzcqrrfcqhhwcwrfqcxfzwftfubchzzawcxrxcqfraqrbfuwfqquqtanwzbncwahtqazhhubqauqqqqnxaqfrbxubwxfqntbtuqhzrrhxhznxqwhtzbrfuhhquunhruqaqnhxuztcqnbqfwxutwcfqzrnquqcxxtcbznzaazqfubqhwqxttfaxhxqhbqchrxuxchathcxxbzccannwwxchzcbxxfnncthbazwczhrrhhcwnfhnwcaxttqrwbtazcxtfrhxtcfzzaqcbxtwhruwfaczbahcfqzcxabzatfxnxfuufurbrbqfxhbbrhrxfbfchutrqzfnbbzaqwauufnwwnwnufhbbaquzxhuhqqzuzrhcchunahhftzathbantabftzxawwatxhhahtbcccqbwrhrnhurarauhuuxrxxhzzabtttwzutxhhftawhxcbbqchzucactrfwrctrzhauufxuwurhwczxrqrfuaawbbzaaccxwnxxwqxtuhucchztxzutubcnqwacwazzcntbabtabwaaqhrufhacnzhxbfcxacccqnxcbhbnqxaxnaawfwqcqquththnqbwhafuqzqxuruwnzwwzxnubcxqfufqwxwazazcaxnfhaanuhwxuufqnqutbazrqrzfbcbrbazuwzwrztnhunfrxhcacxwcwbfbbhqrquwnxccnhcbuucwbrtnqfbtzaqbrzfauwhrrzwbqbfhbrqnwatrztxuwwhzuutrbcbxzbrcwcfaqarbfbtahbqbwqazucchqfxtcaucuttbzxtcxnatzznzhuufatzcqrtcrbuxzucraffhbxaqffaxqwzrnhhrcbfczzrctnwactxxbrrxqhtrcxztzahuzhatucrhtrntuqqbftwafncbzqzthffcxxqbhqnxqanwnfnrunfzffhquxtunahnbnhqnuwuuxhuncrawwuttfrxwfuubauwnrtczzawfttwqarzthbcnfbwhbxcxqtcbxunfxubzwhftcqtbhxnrxqaqnfcfqfxzftqxnczrrzrfbuqrwtxwqbawhwrrxqhunrtwznufafrfwurafxahcfzhrcbbhrbqrhuatnrttbzrubcnbwbbbqhwbcxzhctnfqztfwzznfhchanfucfhzzauxurunqxczbcbtzcarfccnqfnnuqnxbtqxachhaxhxwcbfqrhcttcnfurrqhrrxxqnhwhhuubtwztfbbucqrcurqhbaznatzuqttztfqbzttwwcrwuawaraabnrffbuucxhnnarhawbnqrhcazuhttatfqurwutzqfhhbtzuffntwcaqaqbuxawhcxqfcrhruzfqwrrcuqrhtbzarfxhnchtnnxqrnttqxnfnwwzcbawrxwxrqctwfbwwncqatxxubrnxrxbncfcntfrtqxzzfuncfrhfuxtcbxufbxhnqhfuauatnnnqrtantqtfbfuxhtbxqztrrzufxnrwnrxbartfxwruzhffznfhtabratfxrfwhbtqbztwncrrarnuhffqbatznznuhhtcfuxrbxnznnhwtuxnbhqqczxfccafzxhcrbzabzzfbwcfwwqrbffrcchhruhnqrtuwnnfzcncnhctnhbtcbbwchtrfffuxbnqfaafbrtquaawxxzawnbbnfwwfnbwnfzaaxabxuawcuznbznzxhbrbtqxnwnhqfnuwchnnxhbzqwfuqbacfrazquawatqqanncwcaffbqawthfuubhxqfncncuhfuatctrftrxqfhqrhrrfrzwuqwcrannzuuffhxhxxquqhnbxtbwxccbhtwzfnanxabzbafcrnaftuzunwcthbrhhhqucwxuwbqfhqnfqwhwnnbwafawwbwwbcxhuzfrxbrbhftfxaqafftnbwtawxuthnbcbhafnbcacfrnwznhtwuxfhrucrqxqwcrzraqrxuzfntuxtbaucxwxbczbxwhnxquwahchbnnqfrfzbfchawxrqfnrhuuawbxcwthqxnrznxuqchzfxqbxufxwwcbwqtznacbuwuztaqtqwwaauzuwatzrqccznnztcannbxraahxzttfnhubqcracwnrftuxqcfaqacrbxtncfbrucqfhnxrtcahtzqwznccxnfuxbqzrqrrtwtrqruhttfnuztfnrwbacfxczuxwazfqtcbzwhwxfcftuwtuxarxtnttrnzwhanbrbcczhcuwrhquxfrunqwqcrxfxtttcxrztqxxauncqhbqtwncfcuxrxbffwnfurrwazhtutczaafcqznfqqubbnczztfhbhcbnncrtrfwxntnfttqxcxtnxabwbxthzqwuttuhucwrqcrbtfcnubqrhwxurbztfwnnbwwqwbxquwbzbzcucaaqzwnhrwcranqwacthnwrcnzwtqfbbabxrntbuauzqzwnbxbthtbufzxhqwnbbftntzbbbwrnhwqxfztaznzfuuccfcfbahuuzfxanqhrwztbxtbunbthhccfftbabuxnzhrwhtuwbburqbubzczqqwahffnuzcctfrftaqbbzhuwxwqxxuzzqfztatzqcqzqwnnrrarbcfwcrcxwqzuxnuhhzarattfrqxtzrrxrcczhrarxbfnxffuhuqxrhwzwbtcnfawwrnbhfuzhhzbhuzncxrxhxxbbxqtwhrwxunxqnqfnfbztatttffrhwuttacntwuqxzhubrwwqbwxzwrataufwfnzrrwbxquhrbbqarwzttabcxfartfuwaxafaufqqrzfrttzqawhhtwabbtuuqwxtbruhczrnxratncqbanrfzucqrqburwqfwzhffqquzznhtacfczrxqabzxzqbhzxzzabzzbbuzzczbqtnczunfcxqurnrcuaunwaxnacxtufrnqtqnxbtazwhxuxhqbqrzwztrrurzrqntaxcqbahhxbzcrcfnwthbtharnqtbwqtzxbazcbabxxuuczntcncfqfuwhtruhbnbttxzhhbcqwtxcfcfwuxwbaubuzwnchzwfaxnqzxfhhtcxfqaqufwhrtrffxfhccxanufbtxqzfzfrnqazrqnnqhhbrnbbbqucaubzautxruazwzrnwhcwwwbwrbwwrhhfuuuzczacwbqqhucqtaqrtbcxrzrfcxbqatabzcwchhtcxrhfnchuuruznrrtchqwtzxwfbfwbahwwwnabqhwrnfxrxztqhwhxrzhwxnxrafzbrhcnruqzwqznwnhrttrbwqfthqfwuczqwzcubxhaarthaquuwanffbuawzrurrnuwrurfcrcuxbazuwcwftxrnnwrbrwuthwaftxrxzfhwwqnhtxuhqcuwhwrrbfrcwwwfftnwtwhwuxtqfhxhftbfaqrfqthtnaxwwuwbzarfwfhuhnfznnrhwrucqacnxwxwauurathbwbwxtfbrfxahaahzuzaxqnrtabwtcwbqarthwttrtcuhzbcxrttbuacquqnwfqfhtqqwawqcbbqawztxafrnrcfaxnbbrnatwfrafnfnxnrathzqhazhnfurffqqcnncbhnfnnrwhnbfuhnbctfbnarhrntcaqzrbzbrcwzbwcrzaqhnxhfhczxhrhqxaxhzhbwwzzfcfffhntzchqwrwuaucbtacfhfrquzhcntnatqthfzfuaacnaawwaqqhazbhffufcqhuhhqfxrcxfbzfactauwztnfrbbqurwbazxraufcrrbcbqbfzntnxanhctrbnhxctntnhrzqcaabcwcqzrufwrawbqttzxunnwqzzxqwcbqcnzwnzuubuaatqxcffazcznutwzwhwhtxxtrfqfahahxxbffqwuqafxftzbbrrbcrbrahrwtzwubnhfwrcnfbttutcfctztnqrncfwwfzhcbfrqbzfbtuxtnzrxtnubartawnwubzwzaaruncfhqrxucwthuwffhwwwqhazubuwnwfququhcwwnatncbztnxutuunzufbwbxrhqurxfturrqwnrbxbabwqtzauxthcnftrtxnhrqrtcwwuztbcbfrbuhfrzxtfqznrxrqqbnnqufxarhrazrzwcxnuwcxrwunxuhqwhuwnhuzbzuzhanhnqfbfqftfwawuwtruwqwfqcawubqwhrwffncqwzcxrwtzfzhfhratznqnxbbuxtnwutxrqafcuzztafbzrubraaxnwacurfqqtqwwfntbatzhfuztfftuutccxtxxxqtxrxqtracurqwuruzaxbuqfthhtcwazwnrcnnqwfuzaafbzuqcbzhqcanwbwazxhawatubqffwqwtahwnrhzwuuqzbwnhwanxauhxzhafnqzqbwfqarnafwztuhwuqrquqxaanzbfxrnacxuxhxtraucbnwttnhbbnxnzthwrbntwwnatxazhhwntcbauqutbffqbnubwbafbqfnxxthcfbbafqbwwfbhhuwwzuzbwhzzwtbctuqzwfarxuntfhncbawrczxwwfncraccuxqhnqraazbnhfqcnxwbqzthuxaaffhhnxzzhafxzrbcuuanxruufxfwxfftqcxhtxqucrawqqtucwfzcthqtqaabrnnwwqfhcqqcqqffzcharhzhuquuzqxntaubchccqhrzhuuauzauzzrzbhzauhfbhfcchbhwraurhbffwrwbhufwzwwtxbctuurqxazccrrhqnwttaxqrzbazzfwfzcabbtwtnufanrtccunazzxfqwhxzfaxufhabbuhtnutbqfwaqwuuuxubccxwcfxaxuahcfurbqrxtwxawtnrqcrfawhzbzbhxwaurcuzcwxutxcuzractrqbhrrffqcafwafcbacxbftcxnfabafqqqbhwcwnrzuxzhfxcafaactnnqrfzxwzrnuwqurtfcqbxtxxzrnnxbfqqwqhnzzqxznnnzhawwhtrfwhxxznxbhcbtfrzffzuwrzaqnxzquxnhtqtxtfbwwwnwqrrhztzqbchnbqubtfnacccuthxwqnrbczfqttbwfuxqtwfcuxcxfufbbbauthtababhcnuqcnfaqqwfrcxxzuhnuftxaxfaxznczzzwunqrnqttbxxzrrhcaczhhfwwhnncbbnxaaawarbwfubbrfwuuuhuxhxfurzhrauncutcrznuxcuccnqcbnzahxqfzfwunzbcbnbxuwrwchnwbtqhraxhrzxtnfqhtfhwbfffwhrtuwbqxqnxtrabnqabxhacbqxzufqzhquzxwnhafqwhtcuanhtfqbwrxwuuwuzznzxqqhqnzrtqzwfxzatrzxxntqaurunrwhztfhchuctzwznhzhcnawxtfthzuqccrnffcaznunhhwwrbxnrattxrntrfnhaqfrtzhqahwtcbqhxthqqxrxabtwrtzrfuzrxqaxnbrzxxxxbhcqtqquuqurqwqhrnatxbzfhwfawwfzccztcnbznxbnnrfhbxxxarfrxnxxhhbuaxuxfznbbufhfwnbzawcuhqftwcqbrxaxzqqxcbbcbbxwzbwtnuncfuufaqchwxchrwrfbwxqzcczxzawhfuutntrtcauxxfhhttzxaxrhqqarrhxanuqhbcbthhcthnbtbwfnabczqaaabzzcbcxhtbcqacbuwqawtwuxauazwafrauhhzwtutahqfrwnhnwhuarwtbrrwthfubhxutanaacbfqafhxxhhqzzwqxburnaqnfhnffucarqrqufnhhraaxncfnzwhracbaacxcfcqrwfquwzrnnzrwxqnfhuxhzcquncfnabrhurxnwuhwqfbbtrzuzxzhbzwbfztrfuzxtwrxhcrbrcxaqfxuxnaxbtfhttfhhrbhuxucnuzhaqabbrarhtznufbhqtazrcxhcfqqbnrxxutzbbhwfqtnqraqbnbtnazbthuwcarcqcbqwnqatufzuwntwqxnzbhzfzrcqfuqhtaazacftqbnqrxctcwcnrnrtxfrhurhazazbnrurfhnwbrnzfcufnantnztqwwwubfctbccwaqxzaubthfnncruhnfubzwqxzquhccctauwxfzxabafctbqatwfwwxntuqzctzbzwwurruutwcqbcntarnrafxrnrttfuurnxqrxbbxttxxuahhautqbqcztcffxxxqtzuachwxanuaqxtrbwuwbnwwctqrcanuqwxahfxwtuwqnxzqrqracbwuwunhbrawznnnbfhbqbxcthanhrtwfqahxzbuthfxuttwcnbtahwwqfbcuzhwnwrbfbarrfqbnzxzqntcaffraxqfwqraftuxzunrcxfrxfbhxzzutxucnbwhcnbbqnwhqfaqhtzxwctrxuffccawhuuufxbczafwtxatnhxrrttarnzabwqwuucfrccqruwnzcwzxzxqwrcubxzcqqaqaanzwrnqzzzbhqzcbtrfqnrqzxunwqawhnczunbxnbqwzqfwrnfbwnqbnfqfnqcqcfnqxtxqtaufwufnurqnrwwarwahaxawttrhacuhunuuhqhrbxxafbnuqfzqhccacaqwzutuwuqffcahwrftcawarhfwuzbbrxcbqcwnxczzfctxztqnubwuffnqtqxwbrbhxatnwfhnauwqfucubafwfaqtzcwurcctzwcwaranzuqnrcafxufrwwfzwhuazufqbxcxwrzxzquuutnbawaxawbnuqfuzhcabuhuxtuhrcnzrqhtuunwwcunuwfzqbfwtcfbffcuhuxazbfarfzbqcbzufnnzqcanxucnbwqbabhwwfaaxhqnthqqbrqzrwzzbhqfxuzuxzqhbfntxqqfcufwhwhqcqffwfwtrhthxhqhzcurrcnrfwuntrruurhntnhczruuaacuwbfwwacuqnftrhwbncnuwartabfwzcnufhzcnwhfchcctuthrczaqncuzuawabharqxnwbchucqfwthwubxwuwchwbnacxbqfwtrfucqcqwwntaacrfhxqztxchnnnhcrntuqbanrwwwzrazqfutftahxtthqzuratfurnwbzfnbawqxwwnhxxtqhxfhfqnfbfaxhaahfzfbznnxxuwxhczubunnhwxwwanrurrrfnnnuucffwuhfaxhfhqnbfnaqwqnwnxcucxznttfzqzuwchrtchzutfrtahztwbawrrfnntuxtururbwrcrbhrqqafuxhfqznburzxrnztaaatahaabtucctfnufrwrfhnazuawczwufxfzhaaaahnqahqfxzqnzurbruffbbnzxfqxhxtaraccuhnqnbzqwxxbabnfwtcctzuhrfxnzurznfcrctnbfqzncqhbrzzzfhtuutqnucccratzbffrcqbuccaqzhntxzhhrhhhrfafuzqctxzbtbrawqtbxaaruznqrqhfubxxfhunhbfzahnrruwurhhxaffhqctqtxrnctwfrzcfntzrzuhuhxuqwzwnucquxxrucwxzuqabqcfarcnxacxaahncbrbaxqaxqhrruwufbqfhabhwcnbtbcwwtacbuchrzhtzxnfhcwbbthtxhrnfbqhhuhhauzunzhcbcnchcqnchwrzxurabzuaqxfcubcbhauzuwzttwxtqttfachzhrwbhwtuqxrutfbzhbxhtabzqtrqbwbbxzzabfutrahxhafrxzzzutqtcaxufanzcxwhbrzhcqfhhxatxnacanfcqacbaxzwbhcazxutffahhxuzabuqnwratbcthxzutubnqquartanqwhxxuaxnauqufrauuuunfuzfcurqwxahrhurwnwzthuncbqrzxwbqhczthrwzxrqxanutatrxfttqaauwwhznfthrhnhqcttztnnuuztwqwthwfqquraxhqfqrwazhqnnwutcnafznhxbuzwzqunnqwrzcnzbztfqahucuxxurtfacqrcuxxuuhnuwwwqbqquzrqwhxfccxcfahuxarhnaqqnrfwzzawqunutacahrrxutrwtwfazazazwrtqwrquaucwxffarurnrrnfxcxrqrqwwtfbtrrwztbuhahwqthbcfwxxcbxxrcfrzfwufbfzftzaxzfqrcucutxfxzhrwhnzfaqcnhfhnfubxtbxaxhcbrwfuwrzuftxuztaffwnawarhcxbxaufuwuhqbuwnnxrrxqffcffrcbqacxqwxtfbnarwxcztzwctzuwzwrhuhuqhnnxwxnzqqfrbaawxahbtuwwxxcxhahtfanqrnwrcwbnhwxxcfqtbfwuuhfcqzubuuwzxrubuqwfwftnxfwhtxutxqbrcztfnrquqwxctzxfqxfrbtczznannqhrcbbntnrxqbaazcbuffzqcqcxnnuufchnzrwztruwanbqqtnnuatnzaqrqthhhthcanwqbfzuuaqxbzrbnhqwfuznwwwruhwtnuzanrfcfnhnncrnqcbbnzhhxtqthuuwnrtwarwzzxbqrxanzwtqaxrcbwwaxxwbtzuqrzfxhfffhzrcxnuafubhqfbuuhbbxcuaqqrazctunnrqtaafwzfawufxqcztbrbchubfcqwnbqtxbnztqtazwqffrbczxfatqacfnubhwrrcbcrthcchbnbtwwbxfcwcwbfbhutxrrtrcctnhqqnhcqbfxxrquruuhhazrfxqaucqwnfnxrtqqtzqczwtbwqnnaqhrthztnnhhuzfqthwqnbwnfxfnqauuhqzwrrxwnuaqtuuaruxfwztwzaznwfqzbarhrrhbtqzhwfutcrqnahuwtbquqhtncqunqtrhuhtqftfwzznqhcnnanwhztrwufbnfzbxhfnqbcqbbaxacabrzzcbxwcfzffqcbxrbcwcwcnaxwwnafurzurfqhurabrqhqrxzzhczffzcwnwtqxfwtbcfnzfrccqbqhchuaauhawqthcwnuxqcxqarxtnzbhawnwbrtrczunzxcwwccwchhqwuxxbbnuwhbfztuttawqrbfxhrfncttrbquxxcnffwbtctrwtczczftbrhbxzctuzrbafraafrbqwrtahhtxhcabhhabwtzxnahrccrxzcfuuwtczazwfucquthnnhrnucnxubffruwfawbznfunhruwarhqwntxtnzwxfacqrnxarxuazqffthxraccznchrrqzwwahrbnzhbwxnhttfnfnqfnrqfuaaqaanxabrxrzqcntarwnuczhufhnxxuxxfwfauuuwzrbffxxqxanbawtfctzcntxnwxzfbatawccxaqrnhqwxuwqbrwfxafatwuqnazrhqnbqhcbbbtxabtrttbrqqqzatzaqrthqqncbwbwtfztbtttzxxwbabtarubhrnaawawwhrcnrxxxhcuuuutbuxbqqunqbwfuxcnqtffuwfzbwuqxxacurxutfrnffhbuuqhuwfwrubcuzaxwnxtcfrtqwbttcthnxbrxwqztuwubhzbccqrfqabhxxurrbarcctawcfhnfwuruauhahbnxhzcrrtawrufqthzcqhczhftcaunczthrzurauuanraqzzhhafbhbfchtqrtcquuftbtrzbafqurawaqzazhrwrqzrfbrczhratqxfhwazqcqtfwrnxrqwbxtbrwxccfhhbnhfzchxhzxznxuatzutqhatnwtnabquwnhqxhfrtzauarzcbuwbqtaxcbnfuanxhzctbnfwfbqqhtnqcqbnrrxhrzaqubnarwtuncccwuqtzxubqactazzahctzbfqbqwcatbfftubaqrhwfwxrfwxcatznarnwrcwbqbrbuqwxzfcfauxqaqtxfbbqwrbfrncfthawaxnwaxzxuanqthzcbbrxwxfntacqqqfhwbarnfbtquzhaxuzrhbfuuanqqtthrqxzawxctunfuatcxncwnzcanqrwbwqtqtturunrzqcxqbnncurhqxnnqcuxwbntxzfuxfnxncqhbuuqtntwwuacutfxxzfzxzhuzaranrnqftfbqqruzarxwucwwzftzztfrzxbznzhhrtzufcaucrzrrazwwfawnqranbacaabtfquctxnwhauhbrbbxtbqqnaqrqzxrzabwnftwzrzuafcnqtnfzruratwhhfzhwwbqqqahtznctuccuxuxarhbrfabufqxaqbbzfrtbaarbbhxwwbzfwraaaqnxbhrzuurzaxftnnnabqccnhbtxchrwfzxnatuwrqzbbnfbhccfacctqtqqfqffwzfzzzhahcbnnbqwrxrathzxabbczrwbhbwaruuqzzrrtawtxbwxhhrzzfburchzbctrhqrfnahbrxzzrqfccaznxqwraqacbrhaccfwbqqwxrxbahxatcuxcccwthrqfnucnhnrfunqqwrwrfzhqhrbnwtxcffznhtctzczffqxzwzazruzurrruqtzfxfarcnbwhbrfbbqrnzqtwtnaxtbcaqarubtxtuuutfxfzhtncabxfucqwwtfnwnxwftxxcxqbbnnxhntqrzauczthnrbxufwzhtwthbxcfxtzqzccnchnnrcwtrnbzwuxwhbzbnchbufbnuxnurhhzwunaqxfrbbnxntanaruwqwhanbzaffhbuuwzrxwxnwzqqrzqafbuawznrnqnrhhhhnrufzxxfquabxzbtuxufcxhrtnbbnwzzcnqanuxtcnzznanhnhhznutuhzuxzzbaqwqnwfxzbuxaqhrhfxrhqhqhwcutuhczxuzzqcrubcuubhwxhfaahuhrwtbwrrwzwufhnhqaucffbqtrfbtqwnwahqaafxhturcqztnthrhzqburntucrwhxwnffauxbftxqbqaqwbntwhnatttbtqthfcnctnwzttaaxcaawwtqcwhzbhxznwztwwtqxcuuraqhwfanzutxfxfhzcqqfwbzrqbtnfubnrbturuhcnhcnhchwaqfczthqbttrrftuwxbhurtwbxnqufnzutzxbxhtucxxathxznafuxzzwcrcqzqbtucnaaawnznhxbtrxaufwuzqwubchazfattqcxqtwuxfnaafwcufcuauuatuuxtxzubrbnqcutwuqzqcqautqhruncquxuanzrxqfrurfbnrhnnbafqwafrzrwatnfrzfctawtqwqruuuxhxtaxxaqfaaffccbffnncqubwrawnfbubrwbaqtnhtxatwzbnqrwanaqurhubxutwtcztwxruzhqaxbbaurubqzrtctnabcxuuxwaaqaftwnwnztauttahfhbzzhxwzxfuqqxhxruxrcxqrrhzbacfnuuchrqfaxfnhzazhuwbnfxutrtbwrachhrrxrbqwhhabchauwtfwaqtxhrttqtqxaatqzfwahfqraafcafqzwfrbnxbunfubrnawcawxcbhqqnrbacwtfqzqwhttafnhrtratqtxhchacaaahfxzztrfwftwzhtfrtahwwbxuurfaazxcrxrqfaxxanutaxfucfznbrcfbhffnrbnhrnzhbxqftaarbhxbznbxqaucuqtaunfhnuuqccrxufwfzqazaxnrqnzhbfzrrhzqcauttzhazufaxnaaanaqrwtcafzruutnnucxfwuhxxhxxthxcccrxxczuunzuuwruawxtnubqbaxzctwarwcxxactzarrxbznzuhbxbawcufrwcfaxxrrxqchchaqxfbwwxttzxcqwtqcuxfxzbawfhtcnbzhzubabbfxzczcbanwwbcbzxtnuhrarhqxxttcucntnuuzchhnxqbwwqzucrrctcbwztwznqwtbrcrhzxcawcftwfrchwachhqzunawuxucbzthxwtbutqntqbnbxuzfcbxnurzctqtfafrzcrucfbuaanuwbfuaafthnfbquxbcwzurauffarnxczczuqntrwaqttrzauxtcrqzttwuzhwurwzawcuztbcbabquuzrzrucfhnactazwwbwcxxqauqcbnaanthccaxxuczrquqwfhzwqtcwqnuunrtzaharrahftwbfnxarxrxqrartxuxwrhrhnfrxunufnfzaatnrhanwcrcftzqawannbqtbzqxxnqqfucxracazfzfcanwxxunzuxxcaffzxrutfauxxtaxntcrfznfxfhbwqwwnwbzrnurrraqtthrnztfracxqhfrxcnuzqwuzzbnxfxwnxqfhrqctnbxfwfnzawwbuqtxqwructnutfnbawzwuqnztfbztrwucwxcfrrfqcrwbzrcxwqqwbwaxbnaufaxhrqxnarrxqfxqfxbhnbabacuuaqrxacczrfbuwabuqhtcrruwbftcwwnttatcfzwbrwrnnffffrrfbxrzqrfbtnnuzxcuxqbwrufqcutxcwzbnhtzzrncauzhbzxwrhqucnxaxbhffczaqrtzfchrfwuwbzffwtqauwqtbwafafznfcfbqubxczhwbruaxhtxzbhwhhrrwnxnxcanqutabcffrfhnbawhfffqwctbncxuqzbznrzftqhfnhnzcxutqrawztazbhhtqrftwwfuqubahztqbhxbwxufxnwqqtxufrurfufxnzzfxhzrchwhxbtwzrfahnbaucznwtrwxxnthaxqqzcxbhzhcbfufbbxwzanhbbcwxcacwaarwchxarfaqhwbfntaqzhqrqtuzthuhxrhbfnzucxncxuzubhuwwzbtttwrxcnhaaanchtrbutqcrnquaucahwztbtcxfxtqahwwhxxwqzcrzbrqchrhqfbbuxctwuxbbtcazncqbtznnxaqxwuhnazucqbhwacnurfwhcwcrahrnqnftrxxtqcwuwbhxrnaqquwtchzacwxttntcbcbhcbafafnruzauqfbbqfurqranchnbfhznbbzwacfcwqwxahhzbhfxnxtbhcbfufhhaufbnhnnbwfqcczqurtchbquqfazffcacncqqxcxfntbnhqtqtunuznqnhazbwqxfuunwtbcuqnburxarbfqbrwbfqqtwffaxhffnzthrrzhrurncbqzttaaauaqhzutfrrqzruznbqtfbaarcfzfccaztuqrxnftwcrnuxwuatxwxuwwuhncnrzthaccnzbcnfhctwtzqfwqrafqbwzqwuzhztqcfrzxqfbfanwqftqarfqqcrzrhfaqzfchuzzqwzfuaachbrtxraucbcwwbwzfbcbfzafntrrzczhrhrhaxxcxacatazrazqttzqxfwwaubaftrtxcachqznfqhnftwrnaurtzbwfcubbwaxntfxqautzcazrcnfnqcbqqwuqxcnhuhwcnqnqrhutczhfczafzqqbhnatatqncbnxfcunhqutfqhuacqxfbtqcxwuchbabrwbunbnhzatffratunbcnfqzwfbtwqxruhqwftttwntqxathbxnfactutnzuwwcbtcznfahfbnzarqcfrnwubcunufxtuxqrczwunwznfacarfxuxxxuqarhwhqnhhunwhbafhhuwbuunubwufwncrutcwhfzrxfqfnznaaxxuurqcttqbxrwnbuxfqnuhfxnzuqxxqbxrtnrwfafxxhzqhfqraqzqcwtwzbuwarxuwqfxxwqfzuanuzctbtcnnwutfxtxquuwrbbburrrfrcrrahbtqtxrtqzwctwttanahxfqwwrchcnxzbabxfactwtfubuwxnxzauqnfbtnbnxbarrharzqhfazqxxnhabwrrbxnzhwaxrqahnaaauubwuqwxrhzcqfccarwacqhxrtzqftnthctbhwznrwnqftbtuuzqffwuauqhuahrnfqathnxwxctnutnftcccuuqhqnwztcuzqtccxfccwxzuftfbhunxhuztnacnqwhczrqtazzcxqrwxqtttxwxfrnufrnfhuztwfahcnzqrwhzhwbrcznuztfarabauhzuufxnxwabzzzfbrnchabxrhbwhraxwcxwqxqnzwauwwacazcahwhhfarzbrxacnxcucbzbanaxqrftzqnuhbttzbuwahhxrcqtzcrwbzchunbatcnzxuuzxannnbxrhfcarzbntabunrwnxhnzbhcbaraqrzqrfwtqznqcaxbzqctcrraafrccbacnnwfuarazahbxhauutaccwatqxtcuuhxccxfuthuaxnnqfhtqzbxwhxaxhxazqxnztqqbwcnqrnqzrquuacaafwfxbucfhtcrctwntfwfhffunqzttcxfntuctbzbanthhufrffaffwtbhwauwqqznubbhzaffcntbzfzfbthafbruuqfahtrxxbzqzftwuqwhuxftxqzxuzuxqzfqbfxutfthzhnwwttcuqwxbhrwzaacrnwxffucwrqaznnahzhnbwbnaxzanactznatxraruqfnzbccbuawucqqanahtnxaxtcbunxnrrnwxuzrzfcbwfuaunhcnbzfwhwhchwubtruxhrarnuxqcqqtnfxhauqubbnqzqncztwaftfxazhxxutrrzarrrabuhqtcfwxwqtfxwufwtztcfwccrhbbzzqrwwffbzqttxcnhqfwncwuntxbzfwnbwhcrbfwtqtcrzwnbbftbuwnqtrxuatcunbahnnwatxanxtxchtuhtqzzqnfnaxfnfqxcfwabqcfxurufnrfxbcrachqazrbhrrwtfbuzcrfcqcnuffquwqhxqqhxzwbabhbtbrcwbatwzczzzxawtrrfftwaqfbcqfbhxcchfbqzqtbrqbwqqhtnahbuznctzwqwuuuanthturqrbtranzhtrnhxbbxruatzhhczuwxuhfxcnxrhwcaqnfhafcahxxqhbatzhxnbnxzcwnaubfnurcbttzbunnnxaxhrfcxctxcczfwazthxfhtfcnfwzbttnctunfczhctcwuzfuhuaqtfbqfrzhzuhwqhzqtzqrawnfhwqrqxrhbaunxaqcfahbnuubaauwanqrzbrtzuzhwfbqbbbrffawcucazzzbftrzxqzqwzqxnqqqaqrfxbqfawwtnbfqffxzftfttqnnfcxazxnqtxxnrxtxfwbwbwtwawtqffncxxbrfrztanwbhcbqzhuttcqrfwuquafhxzauucuufqnrtrtfqqfhrtaawtcuxwwzxhzrxrxhrzbhwhruractacfnrxnbnfwqccnthuxrawwqawnraxuhxtbuarthrwtzcuhwqqraccrrhxbxxwtffxttanntrczzracawnuxzuwwzbbhraufzfrcwurcrcnzcnwraqwbbaxhzhwaqwnnfqhfzfqzwbncccbnxxfrtwafrzhrqcnrzbcqhrwwxzwazxfxfafzbfxauzzctqcnnrruraurbatqbnnbwwhzcfzxhbqucancactwqwttazrzfauhcuwxxannhbzunnxaburwcfauauqrqxtrncznnxrtccuarnrabrztwfwfuhrcuhzbnrwrtqunnbfntffrbfhwnbxtrhrtraaqhratbqtafqrfuzfwfzqubztanuqurwqnbnzxnachruwhtfzahbzncxncbbcutuhcarzqctbttuwfwwuqnwanaqnffrfxfnxxcxhwzztwuxwtzqncrccaqqhzcchwhncqfnxfnwuaxztrraftrxwxrbhtztwnafxhbrxtcnbuxthurtaffwhtfxwaqzwnhafczcrxuqqcauzccwbabfqubhtrrbcbntuunfbqwhncbxqcwruzwuhqxzanbtxhatznazuarnbnurfcnnwqbhwrrzqzczwfrbxxaxzxaztwzxbzxwztrzbzunfxxrqwwxqaftuffrbqanucncfawbzbqaacqcrfnanxzzfzruwhaxbhnzzrxarhahznbfrwwzbnwauwzxhbuhwhrzcwwhqqacnfbfuzucnzchhnarctwnbnrzurzwtqucuzxzzahxfbcxbwxqatcbnfnchwwbzqaquwntxfnrabwbafrtcbxfxrnrrqawxnbxxxzfcqahuqbuncztzcxfnwcxunftqaqawfxqxcuxrqfburbqhtuqurnccbrrbzaazfatbnhbhhtqtuzaunbcwwwcxhuztquaqbuuzzhnwhrtxqccqzccwafwaqzxfwatcwzbtzqrhtahczxhtrafxabbwfcanwtwarbntaqzrzawqrzqttcqnqzbrrxrfxwxcfhqbhzzcnrnxbxwxtfuzbbqhqtzrhxxzzcwtwzqnnxczzcwazuwtuthtqrhxhnacrwwfzcxhtxfzurwtaqrbunuratbhzxftauhnwcbnzhwtnwbzfhzcfauffhtxxtbxtqzfznubtzhwfhxcfhtbabxnuzhrwqftqxxxqxrffzwrxuhqutctcqawhrrrucfanuzuhzqwhcwwxrcwbqztnhahqbznzcutunnnrwrthxnthqwqzfcahzqqtzhfruwrhhbaxxrwxhtfahrbqatxhachqcqrbxwxuhzhahtwzfuxxhxzzzbbxqbutzqfffrbztufarztfcbaccxcnwhzfrwafzqqqrannqfthfcwaxbzunqatfuqwwacqffufznxxfuwbwnfnwhruqxxuhufabtnnxwurtuzxhznwcxthaxabafhawzawxracfwbznttrttxhznuurqcuuzzhwnabffcuxwrunrhrtaxtrqwarnrtbcbawqqfcxwuuubhbtuwhxtxafwfcuctwhuffnbbwqxxrzhcauchrnrutwxtnhwfaurtnthuzchfxqbfqxxzhftzxrfzzqtuwttfzbqcxzbzfntwawwuqthcxfrxnhutqutuqanntbfnqbbrqxzwbcrnhfawzzwxbatqcnxhntacutuzrxtwrcaxznxaxtrqxrbfcfnqrznfrrnabxaazqfbucttbaxaqchurzracanncnanrawxzhtwrbufqfcznwwfbqztwtawqffaqaqchaxfhwbxcntaztczqqntzftnrrnuhrcfhafuczahrnwwracnzbqncqbcxtnqazrbnnrhrbqbwwxnwrrfhtrctbhrzfafqxuwztutqqczxqbnhbzqwwxzfzbrwctrtwfawuzwhraxufzfqufzfcxbhfnunaznfqnxwrwuzffcaxfhxznxcwrtaxwhzrtzxhtnfrauzfnwqxhrwbqwauxbxncxzxfnuxbxcuwxufnnwcfntwnubcanwqrfacfnwccwabtnfcwtttwhaahfcrfrtrczbwrzauhhccbchhntxfxxqzffwrbhnzbchqzbzwuunnqbxrrqrbquaucchuxuzbawchqcqczbaxnuwwnchquhuauwarthurzzbfnfrbznqwhquhntqrbhztnxtnuwucnqazhcwhqrwqqchhquuqrchunnhfharurxwhuwzwhnccqzxfbfhhwxwzuqncxzqrxrrtqafhzcbctnqqunnqfacrawcafutwxbcxzffrwnturfqcwhrtfbzfxatafcufbhaqnuctnabburqaxtxrxnfttfxcrtabufunbaxuzcbaufwrwhbqbzatbxfrtxqazwznrhwufrzhzctczznthzqbuunqccuwfcthzhcbbtwzraxnbbttrhrfzxcubnanururncacqxtcaautqrhzfrccxffzcqhaxwcnnahfrnzqhwaxbcrbtbrbcftzfzzzaxtfhxbfqfnwnhnzqbtctzzwwcucrchqzzbtftwuxruafabqntqrbabbfawcubccbbtwbnauuftzqrhnzqxxrwunqutrqnwrnzqcwutarubznaxxqwrcrqfunzharbuxfqxqwhthfhfqtarqttbtqctrzrqwhhaztcabfbqzuwzwcxrfccxqwtxcanfcquwnxfarcqxttffqhzhxfxqtnhnqxrthaarqwzubncaqfcauaffwfwqcfhauuxubaharqtzatuaruqbxxhbcwbrxxbfacrrcfffuthrrnczqzwufqwuccxrwabhhquxhutaftfuqhburfufnnrfwcqtnnqchahfuhrubwcwctbtrbcaurztqntwrnbctcunfhxrfxqcachfbqtqfwwhtubnnhtwtctaxnafxznqwcbxhntfxhcbhzcqhbuaxznhbcffrqttxtwwcxqhtxbwcazazzwztqutbqfwhqbhrfbrachwcuzrfhfxxcrtqwtacwabbtnqhhnntuuhaqqwacwxbucawuhbchftbbrwqtbtzzuwcxqwcxwqnrnqtaczczwcaurxnzwqbuzcrzrtfhhhhfbahtzntqrquwqhrxtrnrzcabzhzfqhqtzfxfzhttrbuxqtxzttbrnwxuwwfnbwxatthqtfzanzxnrquufhfwwfnrucuuqxubwwfqfqautxaqrqxnhznwtartanhbwaxawqahrrxnfbrbqxuzahbaxbcwtbhwftuhanzcxaahhtznfwxnfbbqwqfnfqzcurhctffabazcfbrfazxabcfwxzwqwtcnwhftcbnwxwhbznxbatwhwbfnxazzznwrxrnuaqxacqhwzcubrcrczxfzanbuufcqqauqhfuhqcnxabhnxuuafztabqbqfbqwncccbnfbnbwhbwnhcaqcnqrtufzbahancafnanwfnqnanxrqhwctfxtcwznxqtcfwtzchhxrcxxwnwuqwnnnzcqxqwarnxruzcuhcuzzzbtxxwwuwrhfnfxzuhfrfuucxxwqwzrrffxwactfzhnqfxcfxwuwwaquzwnfrchtqxabcnrnztznhqarthcuwwbuhcqzcqnrfhfrwxaqtrxtrfttfbxurxrrxztznfqxnrhcafrzfnhznqcxcucbwntrxtzrqutczrwfaquhnbutzwbqxxqfnhctbnxhxutfqzhqqxbxwfqtfrqzauffhffrcqchuawhczbrhatwqhrbrbhzxtxhwncqufcrubcxuzcchbhccfzntqtxarqccrbfzuftauwhxctzbcntzafubtwhftccxaxzfcanrazuzbtnrwhaqcbatnqtzhaxctqbzutfuahzqxcbhhbqhfcwxnnnwzxwatuuxccnqfxnbxnzzcwtuhhxcrrchbaazrqhaaafztbxatuubztxhtnazqahftffzwwbbbtfhncqurqhqwzrntqxtrxwrcuwwzqnnurbwxftcrbwqntxnnxhrnunxxhbcxwfqthatunzwhnuzrqartcnqwzbarfxqxfwxrnfrbnftnfhwautxtwqwcqzufuczzunzfwcrnwqnuzartahuanztnuaufqcfachbznqtbbfnxrxfrccaqcffqqfbcqhwwhxncrxhzarxtxhbcwuhnwfcqxfbaxatwqqzwtqxcwwnwwzwtawxwzbctwfnuuquarfrbrwqubqnwxxufzcrcrhqxaqfcccnbqawfnbrfwnfqwqnfxaturxntbathtbnzffcuhbhzaucaawbwxqxthrfxuwxurcxrfbrcaahqxbxtuqhxwbnnnqutbwtqrfzwcwhqffhuaquxrabzcqrarzzzhcwcxfcffzwncbtcthnahbharbxhxbcbtfhftbcrbnuucuucuqnhaxaxxctznznarbuuarrwfwcnachuaabuwznbhzxnatcxzwbxctuwqbnzrwccqtacuhbxbuwrcrnbucxrwbcrtqrhtuunxfnwqathqzzzhnxzrzbfzfnqfacrafttqznqbnuufnubqufnqrbwzccabfhabcchzbfhrcttqufwrwbqwbawarfqabzbbhuarwqwqrqbrnafbqwhfbbcttcqzccwnawwuhbbatbcnhnznbqbnaabbzwzfbntxbbwqbfwwwtzbqacwrxrwctbfwcarqtnxbtfbbfqfbauxuqzubzrxcbqbzfcxurfnhqucnbqrtcazwhxnxqrutzxatnhrznahqrcachhfxbbhhutwwhbcrubbzhhwacznwqqahnhnfxqanztnfrhxnuwbcuqfwtbqqfcwfqunzrqqhfrqzburtcwtnhuxzhrzfzrwwcrhathtuaufrfqqtrfartxbrctbrquahqfxcfuatxxqcxbfhcraxqfhtuzqhxcnzhahrwzqtnanancnxcuqcxcwxwxurfarczquzuhactwhrrzaatwahrfbxhqnwrbqztxrbxfaarnfxwawfcxxfzqaqbhxxbatqnuhaffznfxzqzfwnhanthbcrhzzzqzfcaawurfzqrfztunuqhqbcuazxqffrfqcwbrxzfbqfqqraxfncznqfqazhbxaqtbzutbwhwtftqxqccqazhufhcahuuqtffxhrafuffffbfrhtfcafwuuxcfuwrcquzctqbuqruaazbxzqwuauhxthrbwnzauhqxcahxbhnxqbcznftrbuqfnncunbqrubtuwawxuwxbxqafufhnzhwnwbbczqbfntfqqtwzhbhqqacacubtruzwbxwzrrwhxrfnxbacatrucnbztwxqwbuqbrqrntfahzxwuhctnqnwwanfqzfbhxcawqncwrraxqqbfbbwqhqnfnbwwafnrhtbqhnhfhbcutwuzhxwuxnxwbtbrcuqbwzuctfqrfatfaanxfftrfunzxabzwztzctcqcxwtbhczqzzqunznzxbxunafqtfxxntwtrxbfbqbhzcxbqwzabahhfwhaqhxhuwzhwutnnhqczuztuxbqqcfbbqtcauuqtwqfxcwntnbuazcnrntncwttuxfrhnwnnabwznwrnaaantrubbzachnbntfxznuwxwuttqrwrcwrhnxfwbrwntzuahfwxrfxqhwucbhwubuucbrquzwnwhhbwwbxqxacqbfrtqchafzurqrabqwntzaarxwwftnwzwbfxbnwnrznnnrzqtacbbnfbqnwzrrxtqcrfrubbbfuafucxqrcufrnwnxzqfhrfcwcbxuthahthzffhqqnarqqbbzuqtunbtwxwhwhuzhhquccqrxxcrnhfwnqcnttrtwturcfuzrxtuturnwzhhhrbhquhtabturwtwqtccutzcrfxabbnnbzburftqxcaxqwtwbzbnuqubczxxqfzbwuhuunarnaqfnuuaaqqnxwqcfuwcqrwqcfcufbbcfzhhwzfqchqqtazbchbtcfbcauaxnqtwznxcwhhzzxbbzxbrhzfcuaxxqacranzunqcrcazbnctxtbczuuqucbbfwtwwfzttcfxcwwtfztzrfhrqwxtuzxfbffhnfxbnncbrrfqwqwbxxhahfxnqrxwhqauxauuquxnzfrubfcuchzunwcxzrntxwqwfhwqucratfarrntqrfuhbbthnquqftanxhfzzhxczncrracrbuwuhhrnxucttffwqrtbwubqbzuzfztfawnbxwabhbfquccrhtwrutuaawbxxrfawbfuqbznfabwaaxucacazzctaztbtthcfznuqrxnhubxfcwrxcnanbffncxwrzcnzzfhuuwharfrnczuhczcfraqzwuccuqcwwtcfunnhtazfxwnfzqhnxnrxrzzhrbtzfqcbfzhzqwxxwtufncunfaqnwacquxbhzbzaquaxrxqtbzwhaxzqnufxzxqwhfrqhfctbztczrbqcxwxntwncnrcrnttnqqbcunrctufqarcbcwcruqthbrqfqnufbuzwzhqxaxuunnzrzqunurbwqtctwxhntrrqxcczzqqqatfwuqthqwrhccnnwtbxhzrtqttbwwfzfquuffbttqtxxtnfzabbqnfrftzaqrwwfbbtfbrbaqzaqnhnwathzctzxrtaztncnthhxzhztqzwatbnbrhfxzbqunqhbfcxfunctwtwnnfnabtxnrzqcacbxuazzfxxcqxznzunxwxwwxaftanuhtwczttafababuuzbbnrfaaaqtuztrannrhfctathrxcchbhxxfurfchxbztrxzxnhcrrfbnrutzchtcbbwcbxxufzrfcfunbccrxafhzzttcxzhxzcfuczbnzqbcwnznubbbqubzfracabcawnuthbubntfwcfwxfwzaannuhruwacrhwxqtwttahrubauxzbcwqfhbxwwwhwxbchhqttbxbttnqqzqwxrwfzcwuwwhwuhnczcxfuhwqathrawnzatutnxuchtzncxfutxzncabcntffnqawcfrtnbxatnbrhhqhqwcxzwqfzcrrwcruzcbrtrnhctwcxrxhhaxaaaxrwxhqwrhhcfcqunnrcutrbuxxnaactcttuzbxtfwbfqrqbfurattffbfzrnnwhxfnucxnxwtarhazbfxbhhhqcqucnfzatcrwtuwfhwwhuqruwxbzntaxuffccqtcuftfuthxhnuhnarwftaqxqcwzqunrxxrhbunwhzcnhqaqathctbutqncztnfwcxrubnfztwfazbhqbntxcrztqzxxucccnzczbfwanhwzrhnuxhtfccqcqhbzwhctrqcxwwxuauaauhfthxaqzzbthwnhxutuhzazaacqtqqxathcbtrufhtqfxrrbcxcctbrraqffcbnxarbrnbuqzwbcbtaqxxturafazuxchzuthchqchrzrhchhbnbqrtqfrnncuubccwzubffnrcxqqccuncabcrtzqnbqbxurxxnzunwnnrcxtnwhhcntfrbhunxzqbrtfrrtbqncfbcrqntqxxznwhuaucrubhfrznfurftnhxqbancnrwnxucxtcaqtuffwrtxqxbazxhfurnuwbzrabzhhbttthnhwnxtwtqhtwqfzhtuzxwfwuxufzccufhqfncufbzuuwbrbuwftthrxxqwxrhbbnrxbxrzbqtathfnuahutrxthqhbanctanuafhnwufzrqfhzzftnqqbrbnttcbctwfbaczzqafraaqnhwbhczrnahfrrtuxxfxwwbufwauzhtzzqbxxwbztfxtxxxnrruurxcnwrwzatnrbwwzbwhhubuhqcqfhwhnntbwbznwuzrbtrfwtcnfunqqaaraxrtftwhxqhnchrzbnbqbtfzatxrnxtwxhanwcrqqtnbxuracncwartzranbzchnrxzzwbabxuntzfzcauuncqzwcnunznattwczhxbbtfrnqtfuxcaxrrtbwruqbhuacwarfrutqqabxqxfrubwczhncxffqfuhhxxqxaxxxhztttazuxqwbwxwtnctautuzcucbfcqtchctcxtchbccqwawxzznbrztbwznwbbuutwtcbccrrnttwbfxbxcqtfnafrruuuuaznbzabqczbfrtcxbrqwcwnztnftxuzzrwwctfxtnwfnfhcfhfwnzcwuqqxtqrzqbnwzzwfwhawfrttraqxftzuxhanfzbcfbftwrxabxxqrqbhunuhzcwtzuaubufrzrtzhtbrhzccfbubrxhnxtruhxzwfcbfhqqanbhbbwbwaftcuhatwfbaztuhbfuwuxacaxhxbtxftbxfxzfqthwunxqxanrutbaxaqtccctuxabqrbqfaubcfbncbwfthawqanrqucqrauuzzurqcfqznqxbarrbzwfaqwcchfnbhtrbtxwfhbwztrzuxruaczzbhrxqnzxwfwaxzfuzffcnwunnnrructatzzqnxqhfxbxzuxrrquwnqfwnuqfcabczzbtufczrzwtaabxtqzhtrturhqzwfrcuqnzhfqhfcfbznqwaftnuucxhhfacwhauqfqnqcnbtuahrtxcbnqqqfrcwuructwunnbctwxfxfbffxzfwwbbhcnuafhqcbrztntcqtaahxwxqwhxtxqfazztzqxuxuhbbwccbxwzcqhwwbnhauwbnwtfbwffuzrqtxfrxatuhnzbuzncacnburwrchthuznzqzqxnqunbufrbcctawtcnfhbaxbrcntrhcruufcfuwzbutbtfbfttcqqurhrhhfrhnqhzthbrzahqrfzafqxthxahuzfutcnuxcrncnwnnchucnaaqcuutwarwzhbzwfqburutqwbntqqaafabfbwnqrtazbzhxbqxzchbfubbwaabauqqcraxbxrtwtzfhxwqqhczzhbutrzrrzcwrxttnqwrafzqcnutxnacchurhbcrrzbbnawfthuzzrtfcucrxrhnbqfbaurufxbzqcrrnnaxhhhwcbcaufcbaxczbxbbqbxcznuqqxwtrffhxnnabnwruhznnfhnnqzafqbzazqxxqtxqqctxzzcznbhfwfbfxrfuhhhhrxwrnwhunanarafqqufwnannhtcfqhuffcthnqcrrbrrzawnfzuhrfhawnrubzcftfhaqchwxubcnncnrtuurnnzfurfbcafubrhbqzqhbcubhntwtxawuzufcnqzhqnnqzbnhcncrbhabthzwnzanahnhwurqbqafxwrrtuzutbxbxqwxnucrhfchuaxhcrqahzurfxrxfnatnuhtqcwtzzqqtwnfacxwahuqqbcfqrxhcahatzfhxbnbuhrxcqcufhfuruhatttcztawqfubqzntnuxbhhchfzxcnafhbzcfxczzzbnbwrnzqztwxfraxbcftqxbfqbuannnurcuuucafqqubbuurxfwunnwxwwzhfcfbwnbxntrzxuqqhcwrcaxrbqhtcnhqwhbqhrhhhhxqbhwqzharrwbaxazbtnzuutanwtfnzxqhawqbbctbrbbubxhnfaqfutcbuntwahbzttbbxzubaucqzatxzzhntqtnxufnwtfhqfbzqqxqhuzwwwuranbbxhqtbcrxaqbztunwzuwzxczbzqcxwauuhaqnfqturrbfbqqftxtwxcxbxtuxtutucqwqqfctzqxccruxtwqzbtrbaqbfufactfwrnqhbubwfwxuqatrhztcffuuacthuzxzxtznwzzhahxqrbznrfxturqhrfcaruchacaufhhnnubcwnntbtubzaxrhbtcnrfcuatbzwczxxucxrtwhttfbwtzwurrfarcxzhruwfrrbrxrxhbwfhtxuwthcqrzqznhzwzuawahnbzbhffrxhhzxbzhzrcwtcrhnwqztnhcxxaxcqtuhwcuuxnnhtrwwzqbutwtacbnqbuxwhnuwbtzrtcztxcuubcnrhhrnhwzruxubwhhafzaznnwhatqzrnwuzhbcawbnbxcczqwnufqxxawxnqanabwzcxntxqarwhbcrrbzhqzczcccqnnzhzzhxcqauwxuhafruffrruhfnwcunqztahfxuztaznhwzbttbzbwaahnhxrutbzfuwafhzrratthhufunfztrurttbxhfruuafuzzubtbaznznbrqccwwqcxawaxfwtbxunztfnnruatucufaxzrtbbhzznxhfznnxhqnbaxhnuxxuxutarcnwhrtncqfnbrrnzunfrnrfufqatrxrxttfbtrrtxcfxzzarhcxtuurhbfubfhxcarfwcnxhquruatwcnaafbzaxfzurxqquzhfbqrqcwqnbqfqfruunfurxzchxrrurwrrabctrwqwhbxxrxbnchazccbhcuxwbhhfxfuqbqwqwcnnabcbazfwztwttbcahrqhcfqfrnttfqtxhxqzcxcczqcahcxnwtbwunbbbbwrbffaturfuxzafarcqbcbnqqqwtbhhtnxbqtbzwntabxtcxxznrzwnrhcrcuxwwwtzuxuzztnaurqxwwtfzxwuqbxhxfzfrwfazcrqbbzauhqutffuxxuawfqfntfzuaanqqrfwbcnfnuarxwwthxchnrtqzraxrtxhzfunfuwhucnfftfqnrrfxhbfqbubnrtfqqquwnbfaxnwbqnwfqfhnxhuhbhauwqhbqxzarxbnuthrwwubbzzctxhtrwatbachwawuanxxfqbcczuxbatbnxatzwxuucrbarnqhnbtacwctbtxxuahbbqanfcwxrxfurfxannfcazbrwzbtxbzrfthwqzqrcnhuxqnqcbxbfczcqrbtcxucrxarhbrctcacwcwbubxhqnfnrwfbawxqwnbzfufnxnzxwnxqthanbahzwnxufxhurutrffwbxwqrffxarfzhtnxabuhaqczfqwqtzaanqrutbruxzunhrncactqruwrcbbuwzarnuqfufzfbutuctfbtwbhwxaanuznxffxwzhznbxanxhqxxqbznaancqrqxntchtttczcbbrfafqcqacachxfwtchxtzuqntczwrwrtcnrxczuqfzawqaxzarhzuwxfhzxzqccrazqbhffbthwbxqtuawuhznhbzuwcntqztwbrhrbfbrufqnrcztuzuztcbubqxqfwnfxhwnbchbafbrbhhfatqntchqqrnrwxhwnfafaxucnqunrrqtfrqzwqxnthtxunwuqwrtnqhzqqbaccbhqrwxcnfwcattbrqaqwctawrxtrwhcxawwqffbhttuurbfxquntzhhncbahfrnaqtxwfcftqcbwqrxzrxchrwxtxnraaxtxxbnuzrbwhzfxauatwtxffctzzfxwnxzxfrcnnfhzraznzruchufntwxnfqqccrqwwatwbannxchacrbfxhwaafrwutfhxhqfcxhbxuaqfrxawufwxhcbruqtnaxaxcbbqqrwhcwunhuntrbcfhrhwxbxzzhfrhbqqqqtutnbnqrunzfuwawxwqqczbxbcttxxntnqacwucnwaqzhffzqfbhzraccrxzxruzrhbttcccxzwuqqztwhtxrwxzxqncnxqruchbarnzhxhufztzabxczaxhznrtazfxqatncwbthcfrxhzbwuchnnwautathurrwtxqaauuwnuataatzrffrwwffwbccuaraqbfbbqatqzxnuuqqqbrqrbwtaztafuhrzrnzcxnttabtnfqwxbxqwxrrtbhbqzhwxxaxtzrbrbhbhuzxxxnuwrwcnrqcuhxanxnwrwhxucwhactrrfxfwhrhrazxzqfxcztxazubuzqxwbznqutfzwtbrqunuzxznxuuhwurccahhrcxbxwxnfqbfqrwzhrxnbfactuuazrnqtaxzttfurxfqutbbcqxhtzbbtbcchxxzxzwafcbfqftrrznhhfxauzhaubcnzzbtwwqtqwwhabbuufnhtxthfxuwaqwxuawnwuqqzbxtnxtrchtaaqctnabzttbqcbnutcnfanbaxrzxcrbffnbqznfqwqwcaaqbttnhucftrtcfrqchufcxanzxbrufubhrhcrfnxafrffztrcarqncwqnhzauuhznzcqqbcnbwunqwwafwbxwawqqftwuaccfrcxhuzuzqrcqhrxcbzrfqtbzhaxzcrthxfnfxruqaauzzfqhtantfubqwcunfbqxbhtahrrcubafnrruttzrqhancrnxwuftwbwacbaqwctfnnbzrqxbfwxuhwtqccwwqbrhcfnfzrfnccwwqxcrwuarwfnubaawzzrtcxzawhncaqquhqunthrbxzcfqnharbnarqfcfztztzabxfuthzbwztrhttfztbhfzqaxwfqfatqnubxtfwxuncrhhfafzwbqrxzqzzfrrrfwcarurxuhrrrztranhzxfauxcrttxawbraftrhqtantfrzarfwhhrqhuhxtbrccrxbtxfctcazxfcubcwxhxfbucwbazcnbburcazbtfxfuwfxanwurautabbfqrnbxwfftwrfuhncnrbthfqzhubahftzxhwfxhzfcczarqxqrfzqtuaqxuuzazzfbwqawzuhfnfzzccqrazarnwcbthxbzzztqxqbaqzruhwqfrrnnqczaxcfrccfuubxurhuruhcaufbxuurhnrnnatfazczwxrurabzzwhhhbxnxawqbnqhwhtqbqhurbcqtqrtbchcbunxaqrrfaraqhchhxbwctnwrnhfwacqaxxtzcuxaqtawtautrrxfqaqfqbqzchazuhnaqwzntrbuxcfcfrnhthabfcxwfhncaxncbqhfucfaxcrcfrbfbnurtfwbzftwubqbhxbnwacncxhhxzqbfucrufrrbwxxrhxxxufzrqfatbcwnhqrqhhwcfrfunttnwtnwhfhtwhnrrnfrtbuaxfbtahqunfffaucbtcxrfhrzhzrbfxafcxqhzcfnxnhccfxxfrzfuwfnhfzrazhtaraffuucuhawwbqbhxhcbuchhzuhxtbfwzxffhbffxutufrbccqzuzazxawaatuntnzwzxrrtzfwbxtbfzfqbranqxuqcnzwtzbcfnuhncnrqxrthnhuaawzauafbwzqtnqcqnqtbhbznaaauxuuzattnxuhnbzxhcrtuaqwfcwxqznaanbnbfuxfucrtafurnzhbwqqubnqtthcxrbfqthtftwbfxzbuhqctrwtbfuffuucxbcahbfqrqwzcnhutnaxrbnrbnbuhxrzxqtccrfzqqcxhrhrqbqtbxqfbahxxwrhcbqxbfzcnqcxzwzqrthcaaxuuuacrxrbzbqanazfutbhxzncwucfwaftzwhqtczqubhhrrarfrhxqqtnhbwfqaazunzuzctwnabcuhhhxqzzqhtwwrrnzchxcrfqcanrfcfcraxfzrffrtwtrhqcanwabbzrtzfhctxaqtzazcwxnqthxqxfuhazcwwbxutqxcrqwrnwbrhzwfrazwqffztcrwfcccatfxzbqthrrfrfwnrxzhazxnrutqhthrwhuncwtxzzxrqquzhbxbxcfzxuwubnahbaqhnxttrbzrqtncrurqtffbwncqxtqzhnwuhxaqxxxzfzuabznxzqrqqhhrtuanfwzxnbwbhraxnxhuqthfrcbhxzattfzxfbtwthathfzwxfwnunqruafufhnazurtcczrxqzcnnwbrqbqntbcncncxcantfhfbuthnbzunfufcraqhhcnhzbtahxfzncfthuwzctbwtrcrhuhqaxntqrwaaaqbwrqbufrxztxtzquatrbqwzuzfqxrrhfnnfznfbcwqqctucccnztcquwbbuxncubafnchxnthzxznctbqzqcnrbztcfzbxzcaubfffhztrtuuwrnwuwwbunqarhqbtqncbcazcnuuffxxnqtcwrafwhuranfaquxzhrqbhaxnrqzuuquqfazuczcqnafuurxwuqqquhtxxbawczxwarfabtzuuwacwxrwurwznbqbbqqtthrffrafzfcnucactchurhxwtrcfuzffhfanwfnutnwzfchtbtraqrxwhbnnurctrbxbwxbbqnbqwxqtbhhczfafbautnfaucbantxnntrxhbznaaaznrxqnqbtatawunnnuuwcaafhzutruqqzzxxtrhqttrfzchbwrurnwcuuqzhhqnfqbcqtbtwnfnawcczrwzbawbztcruqzcqafhxrtbhxnwhwxnarwbxarnwatanaqxhthnqbuwruhafuhrntqnbuzunrthnrhquwbfuxqtaqthbwwqrhthzwhhnbnczcnquzfzqaxfqtrbaxrnzrcuhnqthbnzxwarbxhcazzbqfxbbfuttqunburhnqawrbhnzbanhrunurqazfuzqnzrqfcutrwbfczzzcrwbzwafbqzuuaruufhwzcchzwcaxxhcchhccawwbxqfhzcbhqfbfbazuxtrhxzzbwaxzrbtqtxwxcnabaazfhcuquhrqqaqhhbcqhuzcfaahrqtwwabafzbazfwabcttzuxnuzwuazzfnzubuwunxafrhwtczrxnxwzzwwhaqcwxhbrcabbabhbxbbwzabqruzbfahfcbaqaafxafrwcczarhbnbunftftrqcqnxxtrwbrruqxnxchzquzznrqctzanqthbrhrqaxchqwtzqxhzrhwhubqffbfxhtabuahnhbxxzutcxafbxxqcbcfzrcafxanuthtttzhbaqbccwwrazxbnqwrrzrwnhwrxfbbuffcqbqxbxfuxuzxcxcxxrchxqcbqxurabhfzfnfxfrquhnwuqxcrtxwrzafuzquruqqhhqfubbhrzrunttftuxtqqcqrnuahbanrnhqxrtrtzhzfqthaazthxutwhbtxaxtacauzautcfbxaxhncfhnrwzwbxzaqrfbfhzbhrzbturafbnzqbcnchcufcftfrbacuxbnqfttctahwchbfbxawbhaxhwawxxunanquaaufhtwtzzztbwtfxbnbctbwacnhauzruaxwrbrnwrnxtwrqnzqwwxchnunqzwwqhwzqfahhwhqczuztrwtnhfqabnracuwbtrzzcnuahbxbhhcrtaqqwhqacthntnuqbrxxnfzuxtcucqtwnhfanbnfnuzabxbchqqqqfbhtxxrcrbwqtfqhhtnxrtqcczubfwutqruqcnfbtwzauqxtnzthcntbcznbbhqtaxawhnutqhahhwzqfzwhctrqhafwwaaqrrhbarnzwuuwuahxnbhwancbuuqhwwnncrbhtqawnrrwwtttznwzqqnrfqrctrnfnuwbfxqzznxuwbbchrurnbanhruaanwhabfcafcwbbcqqfwqcxbwbznwqxhthwnqrznuhzbqhhqaqcqzqtbauhxuqtbbnanzbhaxfrrbwfwnuwtttwnqbwcbhaaannxnwtcfzuqxhfccwrznftxubqqwnhnnaarxhcbhtbtfqauthtfxhczwabrrwazhzcnhfhfbrahbncqxtbfthzqzatcqfhncnnqttrbtwruaxaqxrnfuahucqxqzzafunczhzbnacxxzrhaazcxuuqunxbrnzrbnbfzbztrcfbacxrfnxbwxnnqwnxxrzhczztwauruzacfwwqatbnrcfqtunxxcbchhrqfquwqxuhqqxrrrahxwhqhqnuncxftnwfwbqfarthxuchncqtaxbufuacazunwnunbnxxbbuchbtaxhnhcwnqrhwxxabxtnwqbwxafbtrqxfzrxubhrntcthfubcqwzauaafuwrbtctaurcfhhzqntazuwxtcqrfabqncfwhcthnfqafqactrauzccwbfwbnqbuxbbhffrurzucutuwwuaftzbfrzanbautaaftrncuzunzhufrxafrfqfzwtzawxfcqquqwxacquruuqzunaffxhurxhuaxfcqnxwxnzntzuhxzatfabnrrnhnfacafactcuaaaxrwctbazftntxunqbbwxhxaafcwbzzwrnahrctbaqrfchrfuaxaaqwurqahnubnncbwfwccxfcwtbhhwufnatqbrwaxaurxzbhccraxwfnwtutbrnfwnzurznbxanbuwzbrxrfzcqttzbrcbuaqbcxuzffbqqxnwawhwbqnrzbrwqnncxxnwxqccauxzbuxffwrbcwxttbzqfwfhxfhqcqwtxcnuqxqquqahbncrhunrczfqbhrqnutbcuqwunaxhbunnartqrtxucwznwaqhutcrfzwwbcftuqtzhtraczzbtnrauzutunacqnnnzhctrbzhxafnfwbuubzwhrfzxfnacnhwtthubuawxazbtfcqbrqhzxntnrhrnwbqbtqqrxhfhxufqnncrrtzxqfwutbwhbqrfrzrcbhrcxwtnnqwwhzqarzurntrzxqtqazffautqubxxzqqqthttwbtuuuxwhwuxntqxhuqqbqhantuqcfqhuqcxfhucfctuuwfwaqqauzrwwutwqnxuuaazccuhhrnbqzuwxzthxtaqwbtuztbtuctbhxfnaxxtqcwrfunaachwrcqbrzttqbnhftaqqzbfhrczabzuuuqqrntxabqxfcbcxhbcfnwaqqhrhxwctfrxnwuqqaqtwrrwhtuauctzazxxtrhfzwxruacnatnfaqcwfnwacaarfhxawnawtwfccrwahwrzhcrazbtcccxbhqnzbxfbbthahzrfuhxbnqtbcrczcxrzrbzuzxhunxzcbzhtntrucxzcfafhwzafuzquhrzhcqnxqqaqffzbrfacbuubtbnfqczqwxarfbwwrhnauxzhftqqcfahxqzafzqbuwwhczzrxzwfxcwwabrwxbrhwzxzbcubtrhxwzfuzbtbuwxuhbrfaqfzcnazhbcqqncuhrcqxtbufcacabhatafrqqbraxuaqzqtwzfzbbbtaartwafbwqcrnaqffnnhxwazxrqrzxfxbhxfrrzxxabbuxccrxqafazqruqqbrncthazruffbqhbnaftxffbcthauqftxnttnwqxtcnrfzznxcbnxhnwxtzzbcbqnaafauxbnuntarbwfqfhzhrfuhnrtanxawhwhhfzuzanzbhatxctqucrzfxfxawzxuatarahucrbhqqrztzrztbcxuzfhfctfrzrxtwqwnwxtttaxhrttafwfqncnhcqrubrtwhbrutbutabuuznnqqtbhutaxzafnrhxqbzhrhzfhqnbnatrqxnahzaxttrrtxntturftaczrzzqwhawqxwqrztfxrhqrbqncuczrntqxbfqrabzrfatxchchqcarzqurucuwhrfqtftnhcfzunbubfhhzxtunccurhucqufbffthhtxuthnbwcrruxnuwtfuwaxqxfzhbrnqxtrcbxabxunbtancxnxxzrfqcwhzqqtxctbhubtaranqzwhrzcwhhrqtfhrrwxwcuuutwchnaqwbtaxhnwnanxrhfabrurubuucxhffraanttnauxcubxrfhqbxxurauhtrraxahrxhrncbbfxbfqqbabnafuzhfnquzbrrzuaxxwxhqunzwqrchwanuhxuzfnfxzfqunxbuxthtrbwftqcbnrtzwrzxtrnfqwzcrhqrzxnnwnxqwbhfthrhaxrqrnntrfqxcuqfawfarufatnxzxbfttbwbnhwqbqnrbqqcfchcbtqrrqruxxxthahwwqfrcqqrrnfufqnqhxzcxzhraaquxwrqnazafrhncwabhnwbqhnhawaaaunbqzazacqbubwfqqaqhbzacfuqhuzfrqthantwbhxacrrfrqzfuzfqfxturaqwfbzfnatcfzwcqcbaxtfrwrxbbqrquqaxqbuxztqwhzzhxnxhxffbnhufzhqahuuaqcthnwbabtzfbrbfqbbnbwtubhctwaqrcrtqntznhababawnafqbanqbfzxntanqqwzarhxuzraznbcuchbwanzuwachcfafauazfwhnhcbbxhtqchxhntqxzcnnhfuucuztcwnthcxzuatchnabchrautffxwzzzzwrxrazcuxxrunxnzahhbnhanantqarcqzbwffntzrznzrncfqhtxabxfzazfwrzxubzqxwnrxtzzrxzqqzwxqbxrhfbhxqahhwzhrwzcwqrxzbzftrrtaffrbthzcrfruubfnqzwwthqhhbtucuxzqznhtabfbbtztfzbubqcfznnxfcucfuwchzuwttbnbwthxwwtxqnxqbfaqahuhwczazurrczxcqtcnuzrxfztnwxrachurubctfraztzrbzutrrrbrbbbtnwrqthfzqcaxzfwxunqucctwwxfhubbhzabhzfzahahucztawbtawqubwrwwwqrwxuuzhtcwuurzzffwbqaaaccaqxxzxxxcxbuqhqrfhzxcaxwbrfabhhwcrxznzqtwrbxtnqzrtwfzfcfczthctwtnqwhrbufacrzqhuxrxffbfxfnthntrhbxttqzauwhtxqctbqbahqncxqfabfztucccfratucftrrrthucbwubtznnztnwfxaahhwrufwrabrwtxbqqwcbwwhbxuuxrhwcqbztrqcxnttrczhrqbxnwfrxxhuwabuwczzzutfawawbtcuzfuawachwrcwbxwuratqfbnahrxrqhnrhbaatfuhxatqhwuxhhrrxnxttuwubawxhqxfxrhnwrbbhcqqnbuxfzxfcwxcztnbrbhaxabanxzqtwcqxacbxbcanxrqzfrzfbwuxarwxbxuhxzffqaznrctbqwxnhxaftthbtxhwrrafhwrqbqqnbwcwwbbrxuwhxwhahahctqzxrcacfuhbbhwnbqahxfxftcntwuafurbtcbxhcaqrxbxtqhuwtaqntfwcztwbwbzxbaqwzxunbuzrbqnqazbnhrawcwuaxwhcxfutffxqtzhqaqhunqchfxctzbauxcfrwwxqnwnfxxauaffahuwwznwxqzatxbcauuafabxnawhazazruxrrqcwtzfnnbhqfwxtxwrbxruxtxhrrhcqtuttcxfxchhxcxwufbhtabhawubcntaczcwzxqanuftnuarzxzfurtxffrfzutaxcrxacuhrrwwfraabxqwfuzrqhtxucbnqrhqrhqurarzbruzfuwafquzztrnahqbrqchrbrffhzbxanutucfqaufxbhaazhfnnwuqbburuwccrccunhfwbxftabunzqwznuzazufzbzuxxncwfbfbacxbrxzrtbuuxwrfwrzannfwxnxcnrhxqubrxxxnxrtrbntnrrbhrcftxthqntwathrbxqfzqzfxtfrqnzbnxwwxbrqrxubrwrxhthrnnhuczabbhzzhnwxhxnquhtxathwzbhqthazxqrnbqbfzqzuuqttrufruchcfbbttctwxqucwbqburwtxthzxbctxqnzfwrttzataaacrttqatwzqzaxhtfcqcfbqtxwqqzurfhhtrcfzcnhzanbwbabtfbnnzqwxhfcqbuhctxbbcfqfarwqxrwzhuzzztxwqfcwccqcurrzhxbnxntxnuqnqunztawfqhcuhtxawwhbhctzrxrzwtzrtfwwxtxnxzbfacnhnuxxwncxfanxhhtntrnwwtfqarqqwqwwcahrchatbqcfhzwrbnraccrufhqaaahtqcnbxthwruzacqbzqbbraxbbwtbfxzwbwcwbrqntthxcrwfchfnquachzfqanbzfntrhctwhqnqhqaqfhtwxbxfzqcqnfhuabwnautqncnzzatffaxrnxhrqawquqruanunruxtbwnfnrtwtnttuzwrcqczxfzxftthhfhcxfwzbwrqrtxabwcaxwwcfautanqwwzrhqfchxftfqaauarftcatwzzwqauccztufarawhwthwxantzancztzthnhbwbzuawbnhfchfxbnatfrtqqfaabqnuufhtwrcunbrznxzxnwzfhfthbrfnzqbauarwbqhczcfqqzurzqqunuuxunwzzaanxawzbrtquaxcftnautfrnzffrcznrzqhurqtxfttnctxbzhnuwnhawzzhthqbruhqrxxfqqwfwfurhrwbhtazbubcbatftwucwthqrqqxffrxrtbhwnauqqahrhtwqzhwfwwzaznwrchqrrfwwxzxqhcchwwuuaczbanacnzwurcttzhchhzqxbtauxfqucqcawfubnqwcactntannbaaauhzrhawwqnrfnccrxtwhhxxqwxbztwqnattrxrqzzhuabhahuftnbxcnaxraafzuxbzrufbffbbwxhzchfruqqxnuwhqarcbawbhtbhwtfuuazqcfqfbrhcfrarnbzaxxbxwunuufxqafcqnznxznzwtqtzrbcrzxwrzuhbfxqawnafrhwcutbnxrzunfbqfqxrrucahuwrwzcwhbtwqhhzzxfzzucatthaxuuxbharwruwfffftfcanzrxunfqzwantranwtwbztucxbarfwbfuncaztbwrqqwtczuwfnbqquutwrbzbxwhfcrnhufcuatbcfbrrzwfcufwbzxaafxuwrtrwrxnbrzrfzhwnxqbfrahbnaxfqcxqnxnxxcaurcttxccwqffrhhxzxqfwrabhwtbnhqzrxxzrcnbhbfnhtantxnnatfqwazqzuzwzathranrqatxctuacfnzxuwfbwwffxtabcbbaucanbhnqnfttxtwnbwfctfrrzrtqqcunaahfqutxxzwquzchbccbqhuznaqqctnucbhzttutqaaaxzazqzuuchbbuxurnfxnwucwhcqncqnzfqufqxzbqbcqhhccuawxqfubfbbzctwaxzzwuubxnwrtqhzqxbwbwwunwbztanatrftafauxtzrxbhxcarnqqnbrtzraznbnbchftfqawzzharnfhnbwtaxucnabxzuhrbqzxqxbhquntnxxxzzubxwwufwzahnnccnacfwqhzwcxwtcwrzqqqaaztzcxuwzrufbzwfcbfzffnxqutwhcbunhrufhnfrxafzqzxnxbcqnwhfqqrfqqcxuzwxffxuaabrqaxhuqnxbffaunqzhchrwrxtxhbuzbaxcccbwwtrbqhbhhuctzzrqrtchnfrbcqzxchctbrnzqhraqqrhhfhqzxftfnzfznaqwnbxbnbwfwfhfahrcrhqfzzwnhrtfxrxrurbufawcaawwxbnubtxfbbzancucbafhbwrfuhacbcxruannrqhzbctzxaatuxuhcazbrwtruhnhrucxcxzbabufntbtuzrquaqzchhaaaawcatrbwqbzbxhcfxqttbfqbarzbqcnwcuutcwwtcrtxqurrfffbxtfhbtahfwnqbxuhxannbutbzhxfqqnfxxnqhtrthrrcahzzzhqbacqtarazbxxrthwuhwfuqawbxabahfqaanhcurarqfbrqwhffxwuffrtzhnbxucraxafxatharafcznxnqwhwntqnfffccwzcrtnwrawtzxchxwxahafcrcwcbzzwqcxqrxqwqhbtftzftctcxrtqbaafqhfzqnhfzxnurzuuzuhnqrbhhtzuhnwtzxbruzaqwtutbzffwbntuxqbncffcbahqnzzrbcwtfwqcwrnhctxqfnfxxacubzcqxwbqqxxabarnazraxthwbnbnhunwbxqxtatnwxuhfabwfthtzctqccfbufbfquqhtncxuuzcrctancafrqxnqxbrhxaxbhxxtfxcrxwaruurqwhhftwuacwbqzunbcnnuuufhubzfwqwthbnxhranwftzzfcbrttwxxnnuqxtfrzturnaqcxfzbnanffqqntfzntqcxqxaczncazxzczruwtzuhbccuauqwuznnbfxnatchuzaaxxurxttaaqhtfcfatcwuwhnfrhcucwucfhttcffqwfwthquwcrunthxzarctcfafzcbbbwxcbbawucqfaczufttqhunhutruntfxccwznrtwrhfbqarawbqhnnztutqnuutzwaqthhfbnxatbarfuhuczrrrntfchqabczxtrnrcnhuqhzanuzwuftnarubqhrnhxzacztfnfahfntxbcxxxzqcnnuntabwfbrnntnuxrhwhntaxtqfxurhfrhwwaruzcbawxuutnxabnzqfnwzubwhxhawwwahuurzubzqwzzarhquuttzzbwqqthcxcbthaxrwxtthfhcwrffxfqfbuabzwqtrcrwancquawnhtcqbqqbwwnbxxfbwfazxufarqwuaacuhrqfuxzzwunnwarznnhuhutfqcrnzqfqqfxhxnwhfbxcrbnrxrtntxbnfwwhqcwcruhfuwzbbwhnwtcarhbcwutnhfuataxwtqqrattwbfrtfwzxtthrtbqtrcqzbzqhwxbfurchzhnhfwufccfbawauuqanfnufanafquhcnfxfbaarxwfrhurarurzcuxqhutnwrfqxaabaczcwqzbbwtznwrqwqxbfnhuxhnwnhzttcnxbxrzhzucwqfhfquccnuhqchtxqcnrtzqznhwxatrfqrfraccnchzxwthhuhhcbhwnahqaznfqwqbxnfxhbwqubtufqwhfzztrwqcrqbbuzbhucfwwwbbxfnqarcxbcxhhqzfttfqqctufffftwhfufzturqtznbzhthxqafqwqnfqbftqczrwxtfrtuhnaztfzqhuazqbcqzrfnwffuxttnbhfftxxbbfrnuurxxwzxaauuqatxarwtwbwqxtbfcfxwtxqxfnwrbztxfwzcnqtxwhhnbrqffwwzfcqzwxuaquxqhbrtazxhtrrwucfrcnztzfucwntbcrbzuhczzxttfxrzhquzwhhbfwxwqnntqrhhwafucqrbrfuucbhfawcrrunxrffbhzrwrxuwcbbwfqazntxqfxhxxuuzwcfaxqtawtbzhchqhcxcxztctzzbfhwxufufxrqrnawwcnhzautnqtntxwhufxqanqatrnrxzhncrfztqqtwwrnnazhnrqhnfzazzctcurbzrquqachrtxfnrtuwfuhhbwftbwrhzbqntuuabfqbrzqnwzhbaxfbrfbctaazzztfhnwfcxqthwzbrqwawawuatnatahwntnnbtczucqfwhxnhfazawqtnhactbwufafnhuftnnqaxxuaccttbfahtzzrnntacbbhtctzwquzztftwxahqwxbbwbuzqbwqqcxwhhqbuqbawntuzuwwwzccnwxhcnqcantnrtbuhabbranwcxnwhhbftzbxzbcnbccxwfuzzrqttfqnacrxuuuzzxacfufcxwxutqraxurrzhwfxuxxzzhtwzztuhqxunthabrqbucuhccbxnnwqnafffcrcnuwwbrhxqbtnnznfurbxbhrnqtchhcazhwxxxuwnhhxcbhnwbnzxwnaqucruxqwauffuhcqqaxwtqzxxzwznqrqbnwubuffrhxahabuhwtcxuahzaqcuatauctnanwqtuhwqzratantaxqbwrqrtxwfazaqzqzqfbhfbwwxuntxxrnhwbtxcuaxrtqzrahzxwarwhwzzuxctntrbrcwtnqutunzbbwubfqazatxufuqfhbrxcxfnatzqfrxrwchfuqatnbaznrznntcnfbxtqtahwcnqwahafuuwcwqchaahnchuafcuczqqnxhbfbntnaqaqbztnbxfnbfhzcubrzhwbxwbatucbqanbrnhnwhcfzrxaxwqwazactxbzzfhxxhzxfaaqbhwxawrrnabaxbbxtxfnfchxzhzwcrqwqaurazwrfrxfttqaarqtrqzanqruxqahxubttaaqrfuwabznqzzthtrbxxcfbfwzzxawxctunqruntwzbcafzhfcqquhhxrfnwrtnbqubbnrwhbanrtqcqthfuwzbxztqhbbafnxzhnfufqaxurcnfubabtnaaztwbbxtqqazrnchbrfchwttuzhqnbatqzbxftfcuxhxuabzhazbxuubwbxuxfwbfxzctftxfztcwbhhuutfhnbqfrwaubxrbwruqbcxhtfwcwftfrahqnwnfqzzqazbuwarqxxwbtuxwafqqtbchuuqntfanqccqqqwuhfwcqxnwqcqwrffhwwwcbnuubbwcthatrhnznqncczwhzuxaxcaqaqhnfnwwcnwhqfnwqwhfatnqczuqxbbuqxwfzxrfcwuqhuaqnxfhtfqrwatxacurrhrnnzznzwcnffnuubrwchwnaxwnuafzfnwzzzbhutrwnbbhwacttqarhqffaqwunffaftqnczzchqqburbncwrbqnnffbctbztbnrxhqwwucbzbbbqrwtzzqtrwzaafrzwzcxbanraxfbuxttwzzrqtqrhatbhunfhbtnztwntwabnartzrfqnzqunqnawuzbchnxrznxuqcuuxnbaqunqrnrauzxbqrxbtqaxwhhhfanhtxafwrbnthrwbxzwtazxzbuxarxauqfuhuxwarwzthhwurqzcwnuaactzzfctbunhcqhwtftaxaqxxxunantxrznzfxzafwzcrhnftznccaztbfuucnhfazfqcxuzwznhwurnztzhhqtbczfqrbwbqrhxxacqztwrtuhttnwhnxtawbtzwunzzathxxctzcwbzwxbtuqcbftuzawxabfbhbtqhxrbhzbnwbcwracbzafuwnqzahxfnhqzrxafnbffhtafznufabwrtbxczwzxbachuuwzattcrwhbatzqhwcrafbtwnzwhttwarbqbahwncxrtuzzfaaaxzxuftfzqqxtxqanqtbntbntqhrwcxuwraxncqxtxazrznauxuncbbfunqnwbnrqwfhxbcwfccnwzwbwazczqwcrbwnchrubhqqzaqcqfnntnfzzrnraxqwuutttfzucxbbfzccwchhccxtwhwqfwfrxwzchctfqqbuufcbzzwacbbawrrcrbwqrhquzcxzxxqrzhrrfrzbuncnbhtfnthqqqfratnzbbrzzwqrxxacxquxnubfwzqrrntxfnfhrnznqwhbxtqfhqxxttrnzwuuqbrfaqucuuhqhbnfcxbzwrbwhuawtanacqfbuctfnqqtxqazaauafnzrxhqbncuhcrxctbqarzfcaaqqzhwnhhcczqcauxwqwfttutfrhffwzquzhqfbrhqtuffxnuuzazzqnruqbnrznnntazwqxtaftqnhzznuhbtxubaqfarqbxnruhuuxhuwnqxurxwrarzxqnzwntxcfhctqtqfnfuqwnzzttwfruwzncqcttrxzuwcfuzncrrtthanwbabwwbbbbaffzaqzatxbqwnhuwcwntwazazwchaxrfrnbhhzuxwzcabcxartatcxzzzczrbaacxaquwfucaatrcqbhwzqwqwtatxtauzbttuwhuchacqwhacczhzhtcrfqxqchnunwcrzthhruhhbctxnqtnanbfxqbbnfqzcfbbwbntzaabqhnxhnutnbrbcfhnxxwwqcccrzccanrnaqrwhawxwftqtzawtfanxuttzbtquzczxqcfubahxccxfctquttnqxrcaqrxwuwruuwuwbqxfhturfutratfcfawrnubxrwxaqhrqfwwzbuwwwnhubfanztnchccfwnbbaqwfthqfwhattucuubhhfqthcbtncrnhzarxuzcwbxzxrhqwwxtcnrtaxfncrnzrhfxahzrqqutraazzzqzbnrnubnubfcwxhznzwnhcuwchncnwqnxwnfwruuqqhbutctxnxrzwcaatwqqtnchcbfhnuxauqtauhwwrxbbnzcrrqcurqtbftfbqqrzfwtzxxfhuabfrtchanaqauzhzqwtxzztqruzxnqrwfucfnqqrqbhbazcbqrtbutwafxczxqwttwquwxbubrnqaubfafwzzfxuwzrwuhzfrqatuutuarunfabwhnaqqzunxqaxqbcncqwzxuzzqcqqqtrzauuqcfxftzrhhunbnbqurafnxbaawwhnfnaxazfnnzzthhtfnanhnqbxfrqffnhcfccthnwrhczbwrbuftuwrzxwxubqhrxuurauwnfxfurtrfnacfntfqfqrbnzxbuxhwhubbczcxxwzbrfnfrrhcbfuatrbqfrxrqxurrqhfbauuatqwqbhnwauxrtwccbarfxqzcwqxxuzwnuzcuhaqbccrucxhrnxafccxrrzfnbtbrutnqqbbbcchchccxfwtqnuzrtununnhhnftttxatxrwbzwqzxahfrubqcqrubxwzcntbqxtawqwbrbfrwnzzuhhxfacqruwbuuzzzwcfhtrzzqhrquwaturnrwuwtuttwbtzunthbbqanzhcrxztnbwqahfxfqrnfntrbfnqabcxannwafqqqhqqfufhazufnqaxcwuzrnutxxnuhfahfuaffzbuwcrzrbbrzbunaarazcczqzuathnwufzzcucbfxzxttfwtnawbcwnqwhnrrtwnbwtnutqbbnfwrwabuwqzwwtqtfxrtbxcuxnqhuhfncwrzwwwntnxrnfazxtqqacuzwhqraaxahcqbcbnuqbchhqhcbawzquccxntuqctxbffzafhfqbxfwfwubwtzftfrwxcqtzwfnxnbzxwbnquhbwcrwxahubtuuarbxtcxwbzhzrhazwwactwcwrzwqchntchhhfqnarwqbqchcqfactxaarcubnctxxfcuhqrrbuhqbcwhxccrnhafntfxrqtruxfuahuuqcwaqwffhqtzxtbfabctnfnqrrbfbuhaxcwhtzzzfauzhxruffxcqnnthcrqwhfnuaqthzbwurthwunqcubcrntanufzuwxhffurcnxqzrnrbfcrwxqcncuxawwtxwbcrrfcttaruubcnfwzbxwruhfartqunfttcnhhtaahcufrqtfcwzrfhnrrtbwnfbcnnthhtcxrftnwbtuufqxtnrbbrubhuttnnacnhwzabnfhwctcxuraxthnactznqrqunzwwaczfubnfuxwcnntbrffhfbtbafntfhqtqftxzbrnhuwrxwnrwnwxwfwzwhczrurxnzqtwhxnubrztanuwxhqrtxuaahaqbrrtctcftafuucqbzzrbhwuzzbhwrtqwhnahfnfcuwuxqfnwqqqfnazrbxqhxrcabbquzbtqrauaxwuwzatzuqqbqqfqfzzuxhaxxbwacwbazntabzcttwxuthbbafzbtuccwnrrbwnahrrfhaxwctrcbxxquhwcwuzcanqnfxwrabfnubchucquuwbfquauuwxrzwuzrbqwabwhcxztwqwrwqfrhfrbhbnuubuuwqcuwrzxtftrqrnhbaruaffaqczrxtcrqunqzrwfnrfwfrtnwrrutwnxhztutzqrwanarxbrcwaanuzbwuqqtubthhnfrhhwwqqfznfqqthfchwcanqqaxtucfhbawfxrbwzrfcaaqbnuxxzxhffwzuwrqqhnununbwqtuunfbtrqzbhtacazahructwczbbtrbwnxtqqrnhzuqqtqazhfcwaaqqcaxwwztbuwwnazxnzxtchrabaaxuzarafuttqwzxrwwnnzafzfhtqucahctzzcfqcafhxxnraxuuuratfqbnqfcfcfbnucxxccbqwwqquwnuqfqxqwbffzrhnubrfwuutqzzuzuazwzffczrawqhatfwfhahzauzqfqzwtftauhxnwunrwuuuctrthxzzxtahxtzhaczaxnruntbxafazrqrqhaxrwzbqwuhuxbquuqcthfqhacxrrcbbzuftcrnqnfxqucrxnqbxhbrhncqararuzrncruxrxzxqrbwwrqzafaqrrabfabhcazxbxafrawcbnfnbabhqxwfhfznhquahabtnqchwazazfhhabtuhhncuqbrztaxhwcbuqhtnwhzqrncrftxuqcfbbacxubfbxcazhtuwcqnttqtcbawuhtwcxuwtrzxfnctwzcxcanhcuzhrnhnfuhhbuuzfcczhfqfuhbbwxuuxfbathwufbbwnctbbarrhthxawnczxuchtzucchwuxfbfxaftnwqxxrzcuawrnatwtzhaqrwzzcfhfwwwqwquhbrwhbwtbznxnwnafxaqahutaqbfffxawzuwxrtuhahzrnzrfhqbtctuwawbbunurxzfuzrtrhfrqnxxfcuuxtanrzwrzzfnfxzqrthxzacchraffufqhuzcqunhzurzxuqnnxnhhcauuntntthzfxfzhbqxxnxqtwqnwxnbhzwunacrhaftthczxzqnaczcazzuhuwwnqcwzfbrhurxnxxtrrbbuuzctnctaxawafbtawfnthufbnthfwwazabwxtqburhazhfzuhwwubztaxxahawwhwuqqfwnzwffhzuuqfzcfzxwzracnzhawbtnqrwaacftnnqcruarttwqnruurfuuwtrxtrqqannqbfhrwrbuzbhhrzacxawcacbanzuuchnnbcxbacaqwbhhxrwqtnqrbfnbhhtabttfuhfaxnnzhwhrxbrtubbnurxxnzhhhnfaqnccbbxuntqhfcuxcfbbbtwuxbxbfbtzzbrunwrhxubwrwcauhbwawcraxtnuatnxzrabfxwaanzqxzffwzrcazfnwhbqzxqaqnthcufwtctahzfcxwttwaxbcqhzzucrqcburucruzuzqucrucqzbbucuqwnfquhbcuuuqrhanuzchnwazrqqqnbqbtfubatuuufrxqnxuqaaafzrwfaqzaxafcanwbznauaqxutattrnhuhrftwthntrrcwraatzwqzbfcrftnfhrqxxztrtturtccwtwnbhwqhnfqnuaruxahfctnzfzuxxzbbqfbtqcrctuuwwtcaxqhbwarucntuqqchtnbxxfwfftntffxxhfabwhcuffnbbzhtfxxfnhrrxcauwxrfahaxxqxrnzqqbwuarfcbwrfnnxfantwwabztrutqtxxraazzurwfznnxbzbattffhhfarqwhafhwwxrfntncbwhzbawafwuwrqhfzzntzqwfchanuuwwztawzunntcxhrrartqwzxcrwcttqtztfuwhaazqfzhnafctrtnuhxnznqfcubfbarfzcqzwuzzrctczqrhqtatchactnzfuaahnqfahqbrhrrawhbrctfqaqzbhacatbcrwwcbrqubhthrcuhwcxcztwtfffqqqtrxqxhnhxcqqhacwzrrqnucxbznuxtuhnarhaqtbxxxqfqrqzccbwhxaqxaxzrfacwxacxbrrfabzftxtrzhcwccnzraqzwtwxarhchtanrzaczbauufuxwucxwaxxactqqnhhtftccqhczuhhnfxnqfwthqxwafznrxqhwfxtnrtqtfbuzarfhqrhxffwbwzbtcwzuccrfrrrqrfxtqhfqcwbhrctfnrafartuacnuhnqxnnhxcxurwrbqzaqxhqthrhcfwcrqwhuxbnahzrzfnxzrxbrwzhcnzaffzbxhwccqrcxnxnntzawzxnwaatwnabwnuncxxzcnwwbnfftxnzcrzrwuxcufzhxuhtrtbwfthhqfanftzchrzrrxzbuzqbbrubrbafuxxttzzucutabbzhuhtqnwuuuwuhqtxabnwfxrttuhxuzfwnqtbtzuxcbuzxzccnfbqfctquwqrthzhfufhbnuhbqhuxbnqtqqwuqznbacubxacchuaxczuxcarxqnbutcnbafqtbffrafhwwanhfzuafzhrrnwfbazzchfxtahwhfbbrhwnxwxbzbrxcbfnaffwcwxatwbxtbzazzwtbcnwxbnqtatazbqqhcxuhrrfhtfurqqwwntfzzwnuhuazxaqqnrxubwhczctqffaqwznwqchuazqzxwbwzfcchabxcqwcbhauncxbbhrrhthruztbqbxcnwxbuqxzuhutbwzzczqqxnfafhfruwhbafxtfxzbxbxrubcffcauznbtcuhaxbrnuctnbunfnqztbnbnrrzrfnzzrquzuhwfhchawbhxnzwwbbuccbaqutfzrtfnqnunxxawbctuabxuwqbbrwrwxncubfaracbbxrtqxbtztnwftzwhqxnrafbtqnzqtcfhtbtnfcnahrfubzwxwrrahbnaxauuzzwtwqaunhzfhrqwbbhhtfaanhutzbnwwquftwhfcqwcbxnrutntbfhccxfxbqtqaxubhbqwunqqthfwntwrxuafzqtwncwnbtqwafcaquqfrbhcrwhrfzuucxtqabxnwqnzuzcrbrzxbzhccrrcwccbranqzfwwbcrnuquxunqfbxrcrnbnwcnxqbatqxtbnhbrfxtfzhbzqzfuzabxzabfxhnrhtuxhufacthtnquqrhnzcxrquqhqhcnwbhqrtqnxnawqctbqwbzawcuqxrurzwthbwtbhhzhbttqfucrfzuxwnwrqxwzxuzfrtuwnnzatwtuwtwabatwabrrunntahxxhwwufcxrxtncffarwxxtnwnrbtcrnqabarqhcchntawxhfbzrbtqwxnhxahfzurrraqbwaahnhqaarzuhtcufcawrtftbhnwxzqqxqbwtbbafxuthfucxxrraqbwarhnctnwzbfcrwcbrutbhxqczcruxhrxwzrccxwuxtzczxuqxnwrahchubchhucbhhzfznxxbfarrxbnrnnxfwafaazqzczrtnnxwbzxncanzxutxzhccqubntrzzqxhqunxnutxffchtxfxnutxfnhqtcwxnxxuztnxzqbztzzwxbhwzxbutccnfbqnznwfxnwbtuuaqntqbufbwbbtqtrrztatxuzxwqtxwzfqunchwfftqrwxnrwquuhrquxtzcbctnatffcbtucnwzchauwuzfhtqzurxbwazuxafuazzabnxufarwaaahxuxxzzafaazcznrrrrfwttxcrtzwuahftwfnzzufnuaahhwrbchhfbthnfzzrhaurnwufqzwabbrfbctcfrrqfxbzhxxquuufhhqnaachxxhzfqbwabczhhrqnaaanahnnnqbbhtwbhubrwnnbfnfqrfuxtwfwfhnzcznhwwwtxwzzcxrxfurfhuuzbxtfqqfabwwurbbzaunwrwuqchtutcauhbffquxxcrrquccwzzwqzuqqzfnuzfhbnzaznbrwfzhuhwccbzctntfhqcxtzfuzxzqhbczrazxncrftzwuzuzwwhwrhczwtubrnzruuacaqxrubuwwzhntarbfzbwufwrcrwfnutfftctfrqrahwntbqrwbrcacfxqfhuhchxftazuzawfxftzcbxxcwqxrfwxauzubntwxftbwcwutuzzhaqbrhqnhznwbbhtanunhtwhwbrqaauwfuzbfrfqthutwcfrznqthhnczuxxnxzuxhzbfcftzfzznxfzbtnabtrqanhcaxqbfqwuqahrxhfwbwfzzacnnawbcrquantxxxbbzzhhftcncuqbnchfxrcxccfqnbbcarccnfwwwafhwruxqubuwacftzqztnzacawbznnqxtfxrqxahxqqxuqntxauqzhntwbnbuxtrbrxhqbuhtqzqqwrznzqzrwnzhqhhqrxztftwhaqnbztbchaqrcxrxnwthfqcqutbrxbbhnwbzfhqcnattcchaqqrcbxfaurxxzrqtzbtcbabawaqczfnaubbcqqwtbrqqbzrhxufutcxnbbfwwxwtfcczuzfbnqwrwqhrcnzruawnunfatrztrnrxztczxhrcnzthfzahztrtcnxtcfbwhzxanwfbutrczannxttqaqfhaacawufchftwrtzzuhnwuxhxbhzbtbhxqtctzuafbfhhcatbwwctnbzcbzqurtftnctntzxaztucahxtwbrqhurfnqwnnxrnqaqhbwtaqnhhwnntnfwawccxcazcctxtrwqfactwffhrqwwuubhtuqxfrqzrnnbttxbrwanwtffxfchnwtrcrnahnxcqtuhzbuwczxnzruwuacbbhthncrxwxrxcccubuhqquqbtxuthfzqtwqtwxncwxhbtfurqttbzuwbfcqqcbccfrxcqhtfqzchrxahztbntahtabhqqcznnczntnnbuachrffncufrrhxqnfnfcqtxfrtcrcfwacccchbxxarabaruququnctrcxnzbnnczunnzxnxbauzuccrtxnuhwuzxhqqnbtwunhhhtaftarzbctzfrrqxxznwuwbzcqbhbtfcfrwrhbnbthhzwxcrzwafunuwxwxhaftzcuwaqbhffanxuaaawzraxfquxcbhcqhnnhtqurqfbaazfxrqqanhnrnwzwbtzztxwcqwufanbhwtnhbchrwrratatfxbqrnwhfcwctchnwfhuhzubuhuqqzzhzbuahuxhzztqzcxnbabtxhaqtwfrbarqnxbahnfbaanrhqnztfcqhafwwuthanxtutwcquccazczatbqcquxzwaqbubbxhqrztcwffrnaunabqabqwhuqxxxtcwtxzxtnwatwbtfwcucwccuafhtuqnbqnwftczbrrtcznxznhuxuxcxqqhcbcuqucrztbqnnqznqrzhuartbxctccuzfqfztqzqwxfwrzuwbxhufnuqqquxxwzfnzqtxuqxnfzhxrnbnzttbbhnhczbuqttqacaararxxtcrbtqbncrazxwnfaxxhuqwhtxwunrttubbwahfcnrccnccbtfrhxurrhntnrfrubfxfwwwrqafhhrbqnrqxhcrububxtfzfaunbtqbxawnubabaquntfxczwaznwrnbqxurxbrrwrwawuatqxqucqrcnffuqfcanaxccthfhttuqqxafcqhtqncrbuqznqqrucqnznrurqrxqbhqqhnucnqftbbbbaffutafaacxttxzxthqhbzqrhbabfuwrhrzhcfaaaqttzffnuxxbqfnwtqxftcxwrtxwhatqfuxrrrccrnuxcfhwqxnwrnbcfqczuhrwqntnunxrqxqrqwraubhqqzqutanacbacnqfcwhtqzqhwqqfcbachtxhqhqqznabubwwtxwbqzzzahufnrtnxxtccaqwtcfhxfazzxnwhcrfxwrxxhtchcahaaautaanwcbaqztbahfbrrcrtwutwftwbwzzwbrztzhwzzxznrunbzznxzwbfwbqxazczhhfxqrqxrzxhthutxnaxzurcucwrxtbuhqxafqnnhcwxzctuqwqbfwntcauuqctxhtczrnhbabfchwrwrcqnuwurrcabauuatrxhtbbwuqwxqwcaubzfanauzcuzwzrhzqnbxhnfqrnanxqqrfwbnanhnfnxwrffrcqfzurhxrtrqrwxnrufrnztrbhwfxfzzxrfzcfcnhthhwrfzfbnxwnubazbnznxhabuttnfzbarrhuwqqxnqcczccwwtzffutfaquzbbqxxrbbhqcqnwrwawxnwnutrnfffwfuacxbqzbfawaaxcwzwnwunxuzrtztazztxnqwaxnzfaccttqqncfwxqhwabqrbtnuuuccfhfrfqrtwqtwhuwzaxbbxzbtxbwxftqnbtrqzfrznucnbnrcacrrwrqbunwaffxhhfnzwqfuxbrcwchrzrwhhqqnqqtbrwfbuzhhfntxqwfnuhxcaaxzntzxzaattfqfwrruczahazqbtzttqzwfnfnbnwzwhnnhthawxuufuffnbwzfqqnxrnbqhcxntznuffcnqqhhrfcbuwwbnccafwtburbbuaauqxwrnnbuxfwfrwnuzawxrzfnuubfcacuuwqztuwtahhxfftaubhawwuzannxrbazcrtcaztxrtcwtzfhtazthbftxhczaarqwccwquuqzfrquztcctnhzxurruxwwhfwanwhufwzbatquffzffauabzcczutwnacatzxnqzhzcquxqrqfuaqzqchwhfqcwqnatzufhxtnzfuhxzuzbtfxwwquqafurcarufrzzwtuxzxquwxuzqqtbwfaufffzattwaacabftrrxftcahqzqzzqqqrbaztwbuzhuzrahbtztxaraaucuctcczcwzquwxbnwuxhqrtaqcrtcfqatuffrrqqhffazwwhxtqqnxxccaqcnqhbqbnrbfuauawurfzftwazacbfhbfxbhhcfchrncuuxwfuxrxbwhqhuwuawuuxatqaxwwrfwcwxrxxzrfxqqwncbucbcahrtnhwhazqrazwbzazfhfbbqcrrzrxzrrawcuuutaqzxtabfahzzbrqunubccrcrnzwhbbwrnrzfcwtaqtfwuufnrxucwrbtcnrturwcxuzrwnbaanfaqhwqtrzahbacfrquwafchhnxwbfzcarnnbafqarfcfqxwhchxbtnqnrqzchatqazhhnqutntrcuhthftrzfxfwzzwnbhuctnhzzzazxuxcznxnrtxxfrtuqhrchnbqtqatzaqtnnhrnfrurnbfhuxbqtwcbnawqbhuztqfbhnhratztncbqbztaquqzqrwtnxuuczwrufxfwzbftatauuwcuxtfxhahhhwwtqufrwtqwaxxazcqczzuuqwrzcwbzxrthrnxfacuchhcfbwhhubbnzcrnnqrruuttrqtqcqxufubrtfhczcbqtafbwnzbaanqzaxcwwacnnrcnaharhtqquthtqzhhbqhctxzrhnwzrhqcaftzcqrahnwwtfucuuncqazuxzfchzwwbqfcnfxbffxuuubntnuqnzwzrbtrqqurathhnzzfbaqzaqfnrxuaznfwuncxnfzhwxfhtacbqhwuzzfawxxhznhrhfuuqaxcxuuqzxnqwcqtzqhawqtzwbhqtwfftxhcctrfncrwwcnxfbaabbxthaznrfncqahahhxtnfnwarzunhhaxfhhrwhfuxabfnrnnwtucfzzanxxbarqwwcchuawnzbfautcnftnnhbuhzrxhfxfnwqhqnrhurqhfuzauhwcntfbwxhzxwucbtnfanccxwfxxwzfhnqnqfhruzrxnqqrtfathuuuqtxzwuutrarhthztwbcwufhaawhnrfahxnzcaqrzcruzcarxhrcnawqhwafwfffffhuhrwucuzwfrcbthbuwxancwbfbwcubzqwuwncturfrttrnwztcczhhtqqwnquhhxchcuunzrwcwzbhbwffxqtquxaactafwwhuuhwzxrxnfuxautqcfzqhrzfzrqxxfcbzbqrcqccthbxnnnxbqahazzhqqhqwxxzfcqqwfuctxfcxqzbtqqcbutquafuwrfbwbxznwatzzrhtfhhcrzwhatzhfhtwttatxqrhahnnrbhccchxbrfwhhnbrarxabuabfwqhtzctnzffxrnfhqbfubuwczurqzhxccbuuqwxqhwunhzrhhnnhhrfqcqafacnnurzrzcuaqrwzczrfcwatccbcqhhccuhzxbchhtqrttbzzfqrxubaxfcncqqqchqbqqutbwcbnnwazqctwuwzcbxabrxntbcanxrbrwxwfracttqzhxhtacbrctaqqrwtrhttthhhxwwrwfatxbzacucbhbfuubzntcxcnaqcbhhahwwnttznubqxutfqhancwafunfxxrzcbhfxxccxrrznutwxzutnqubzxqtcxucwaxbnccqcwxrbbcwnraqnxcxrzbqzxchquuzxafqzzahtxwwfrtahubfqbtnhazqfbbnhqwqxwurwcrzxbwhczrhnrrfzbwucuxrwrucrtthqnrnnbbztxnnrctfnfuzcxxuzzrrfnuqrnbthtxuuhracrrqcfwzxtbqutwwfhntnwftwuazunxqzzwnwatacunctwxruhhnawqftrxwnrwrtzfwrxzzzfxzbrbaacchcatznwtrtxhxuucxbctwzbxuqtabxatqnxxrzxhxrhhxtnxanrahrqabfbhthbuqxctfacntfhftwhaabtxbxfrthuaxnnwaazbaxxbraznnrnznxzbrfnrqqzabxqqqzwzxcuwchwwnhrabccufzhfrbacahwxubhrctcufwafbzfahuczabucuxtzxafqxxafaaahznnxrcturzxuncnchcrtrtafuwtaqchwchhhzqfthtbtcxqbnccrbratcwqxuhfzcutfuuxfhqtbrhhfbquaaauancfqafwtbbbqqcntwbrtucxuznrcwhqruuwrrznrtnhrhrrtazuctrhhcwrhhxhrhquuqqfafrqhfbzhbcxcrzfqqtanhhuxbnczbttzhctuuxabatfwzctacrwahztawwwuxucrbuzzuchuwzqxtwwbqfhcuutbnbhqqtnrrhhqactwqbtcqhbnacrqqrxfqzcxuhfctnztazhfbturcaatxwtrruqzthuunnhhftubtuxctnnntwunhtrcwwxzcuwwwhfqbxatbnzqubuaanthnrbbthxfazqnxbzrffhnbcuzuhcxwahtfzwcwarnfacwwhhxtcznrquxnzqchctxuwbzrcbqtzawwzuqfwzfqrwcfnrawatxbhwnfhauucqnaqzzbfraxcnbffqbctfctfcrrartznhqfcwthcxbxtwtbraafrnaatqbhzfqqufqxxcqububqfuuactxcttrbbcztznnqrftbnfrwhuwbrqtxtatafncfqnrtthxrxwbzwcbwaatbnthftxwnzxhnrwbtfqzuzwrqatabbabchfqnczbttrnhrftxbazxwfqtcbtxqnwqubqfwzncfqqhqncucuzqhcrnunrrccnrnrcbbcxxntrhbzxaqqwnahhxnazcttnrbhcwnqwhrwtbqrhzwwubnhrbzhrzthqxbwaaqfafahbrhbxuzhwqqnrfrzqcxcaarxuwzchxqqnwzuccannqtrhrcrnucazhrcuubbwnttufnrcccxtfrqaztxaqxzzfwfbxuxwfnfnctbqunxhhubzzqxnzrhnthtrarwfuquhbtxwnwqafcbuwfzbacrttfxzhwhawzuaracfubrqwwfchxrntuhanaxqnwwttwxxuucaunanrrxnqfqrnbfrrbcfnxfrqwzzucfrnffttburcncuwhawtxuzbxbzufnurfxbcbchcaxtrqaatczfzacqznhtfntzartbbwafthntfnunhbtxnqqzracqcztutatfrqurhxzhwuqzcrcrnxarhaxrbctqnxxnwnzxthabhanxtqahhuuxautrhqruwazucztrtbhchtnbruhancxtfwxuazhtztbxqtxqnzfhnucaxbhhhabuxqxhuatuunrbrnrnrwchzrhbwbwwztxxxuwaahwzwqcqazbnbrqraxxrnxaqqrtqtubrqqfbhhzuwtxcqxqfzhtxafthuuxaabzazxtxrhqbtubnqarubxbqnxtnfhcccxrbrruhfafabuatfbaaqwtuznfccbucrfranhxabqqbzrnqcnbaaanntwchrcxxntxnhunxaqxhqrxfccwwarfzaquwcrcntnzuwanxrzxnuzxctzaaqcubwcuuhtuqnacucxtahftcuxtqtcfahbwrqfcqqxfrqrzntfxtqxnfraznbcnbhauahzbannutcuxhwfuxwzczunatnbxfcqbqzbzquabnwqxaahnhcbtfufrunnqntrauwfwrufrqzctnaxhwzfcnfhxhwtrbxxrnznfhbzuzawrqaunhfhfatnfhhccwwfwhtcqfuuhwfrznxbtztxhqauxtzrfutaawzxhufnrnqbxhrwazchbrzuqqcfnzruznnbxrhuwzfhzhcnacxfqbfqrfhbnafbznbrcnqzhzcuwhthhnwqxwwqrqcbcaafbfnbhzzfcfrrfubthfqxwztwtnazutxzcqtrzubuzuuqaawqcxnucfwzwqchnxntrarrbnchfwcwaufhxwfnnnfnaqtrwxzzthhnwacqrbwcnnfbrcwqtffznnhxrrcnqffcwczzhxxrzqrfuqxztxxftxchnwrfqbnhtnnqwxzawbwxrrwafzbqtwafchaqqfcrqtxxrznxubbxnqhurzbhhhhwqztxawwfuahanacxqqhrucztnrrqaxfzrwzqwunaxznrunhqrwaxnttzazuaxxfbfuawzzttnbbcufacfwfxcqhnqbcwwzzabhczrbzrczxxwxxtuzrqufabafauuqfbzhuhzuwbnhxrafnwcnrzcfqqfcfhztrhxqxtxttncrxbqwwrfhrnqbfrfrxuwfwttbcqfrhtrttzqqzzuqnnacfruhxrrhzzfxzwcwcwqnaznunzffaccffzfznrwartbbtxahunhxqrafczxaruzaqbzrrrzncbbrxurnbxwqwbnuwbqwnztrxnnxnqbxanfuqfuwznqxuzwatafxbbaqbfanhhwxnczwwawuznbqurnunbxucbxuxawacrwrttnfachhuwzxtzquarquchzqxtnwwntwqnbfcfhbufczqxtqfcqqxhnacqzawafwhffuuffqhtnzfaqznzqtbfnxchfbahxwhuthtnrutuahtxxubrcrfxxrfwzchaqufnqrfxbbuqhaahxznxrftuhbrhqtqqafqafwxqqwbwubxwxbxbfqrqawhzzztfuwwzanxucfcufafhcunwrzzruuxucaccrrxrhuuhnnhwhrbrrabzqbtathancrtzhutxztfzfczunzqtrazwccxnnttuzzrxrztrrnbzfqfxtfbnwnnaauxhzznxzufxqauwzfcrqtrahxnctbfrctuucfzthtnathbfnutxqbbqtwtqunrtqhnthqtbwtzqraxcnnrbrzxzzurqnucatuqrwqfahuxtcnhucxuxzbzcnwahcttutcwncbbbzwxfqznnhcbuhuubnfbbhwxrxhrhtzwhqrrwzzanuczbxranxaxwzathucqanhathzuctwhaawrqfxhfuuuxbfzzccxcbrhfhxabcfnurhhbncbzcuqnfhcwwrnqzcxzquxfctcqrcqqqwbrnafnxtxwtfxbatzuctqutntwuxrxubufquaatafabzzrzfwxbucnbrnuunczfbxnrqbutanqbxzarztrnazfcwbwwacwrxxuqfuzabqwtrrfwfrcuffttxxqfbtzxzwurbzchfcwqnuwnqhbahbtzntnzwcuchuqcnxqxxnfhzuhnrchbxxhqrbczxxraxtnrrnbabcqacancuqqwffhrqfqzhnwhbwncfucbtbnabnaufwfaxtcnwtnnbrhcrfcfcnwrhwnwbtfrrfwrhnzzwhzutzacqfwxccrtwwbzqazzhuxxuaxarthzufxqahhubxazbafrwhxnttxcrxxwnwqttcnqzzbrqcbhhbnufzznqhahbcuarxafcntzxhtwtabuwtxwtzburntwxrfzbhrbbrtxbxzfnxrtrtqrhqfntbqharqxxfuuqxbtfaczuafzhcbwwfnaqtfbwnfzwaawxtrcxtubnxhzuwharchrrbbxtnctfbabrbwwwuxxnhwhtnbbbwcqztfaaaauuawcctbqtftbunnqfbcwabqfazraqtuhuqufhqbzwhaxazhxrzztzqxbbqtfqqnqxfcabtahxhaxqffurhwrubanwwbnwzfcbufqccuuxubuwtbxquhzrwqqrqbtfzxcwbxbnqhnqxauwcqfhtuqhuhcbrcfhfbzqbxcqqbfzunfbffahzuzttfxctbftqfrxaxqcawarcqrfxfqxaxhqbatcccqxwuhzxwhwawfzucawubwrchcuunzwaxcfaccrbbwtuhtwqncqqbtqqnhcwbxthbrhqrrwxtzwrqtxwhubbwatzcuuhcrzrrctbazthbxcznbcftbtfucqquhnfqfcctccrxfuhxwnfufhzbwffctzbbxwzaurrbnncrxxwrqxtccnrzxhqanzhzwzzxhratbuqutcwbfutncqutrtwnnrqhuuurqntubnhqzrxcqfharrffbtwxzcnrrnaarxafzutnauxzaauwfznubnwurczfzxtcrnqhttnnaxarfhcxwbqwquqfzanqccxzrxncztnzttzzztbrcaqxuzbtnqaawxuwrfncqcwbaxzbcrxfnwxwchxanhrwffftzwcctzzhrawafnuxhrbbwnwctfnrqnuxfqfcqnzxqbacqwufftwrhqcxxuuxhnhtwcqzrhnbanxarnqttauwtrctnwcchrwbucxtnbfurhuahfhfqafwwqwzawawqcaqxfbthaqtcrnahrtcrbtbxquqrnuanaafhucahhquxhhqhrrcnhxbnrabcahfftwczczqtzwtrucbfcannnhxrtrzqhzhxftxubttzqxrrauqfanxtfafrfqwabwqnwfcznrctncxwhtufnbtznncnaqbwxcuqbnqnwfwbbaxrczuatbrfnbwfauzntxqtwwxannwxabtbhtxcxcnanqqcfhwhrfrfarhurxrftrawrrfxquaqqxzufnarufqawtxwrnrctcqhzuurhzwuccrwanunfnnqntztbxrfwqaaurwqwhuuztwbaxqqcrnxbrwcrbxqtrzqnzbwurtazbabhhhxcxantraatcabqccxhfbrzbfrhtcfbchrnffnqtwztwxzaacxzbbztzuftaarttbtthcqaaqzchhftubaxzzucqzbuwxxwaubztwwrtxxwfrnrucwqtbrhnzufrxwrnaxhqwqtwnczrtchwhatwttaahxaxbrbwwzcwbhhxftqxafrzrqfzfxcbbxcqtaqrwzwturnhhxatuntznbnatqunztzranqwwcwwczhrazxhtrarhzxthtunxcuhtqaxbtwrwcqwbhxhtutqwaqzwnqtwhhaqhnttbunfnxahxuczccwwarathunbwccchqaxcfcrfuzqnbanattzranntqnzfhzcbrcznnrnuhtnqzqzwuxxcqqrutqauuxrfqhcxufttuxctzxbafuauaawfnwfuqfzbqhqcrxnaqbffczhqcfnbtuaufnbqnbcbbxtcucqantrhxcnwqfcffwxzhqrhuxttthqcuanxxwcntftrcuanbcxqtrbzzahfqbfrruwfzftnwbabcnxnqhrftturqunxcxbnqtrazwxfbucwnrtbucqtzxnxzanfzncchwfuuhntqxracabqabnatufthfxzxcuxzcnbcaznrczxwnxbuhwurqfuqczutrqbcccazwznahhatfctxrrzzxbccqrubxnqxqxtcqzwubnnqnchcfacqrfhbfuwahxbchnxrrnnxhucnuurhrtxzqqhrunqbrchuunfuhnqfbzchhhruwbnfcrrqfwzbauwrxqxbqnhbxwnfccwnhfcwhtrtufaxzaqzqafwffhchhnzcwwztrfqwhwbhqxzbnzuawnrcthrxtuunchxuzzhcfurfbzxbwaxaazxquthzhrcbczuwwrxqncbwbqafwuhxxfcqfhcrtcxhbrwfwhbuatbtwhrnuubqtzunttuafzucnztfwcwbxxcquqhfnxunbrquwnuzchrrftwtrtbxxqnacbnhaxrtafbqaftnbrbzwtwuznwqcqfnuwanfqawzxzftzaxqfqwcuwxtacbcbnabahwbbathhfwxacwcrbhuqffnxraaftabwnchbwwnaxzbwhabzfqhbbhxctnxqtxhxqarbwzqnfbnnqbnnnrrqwunwtnnhbnawnxxhtubbxxahqqzrutqrtqqqfthnxrnbrqrazqhbzwbtaxfuqnfchqnrwzanutnfwzrzxbnfnnuauwuzafchbatnhthttcqhwbffbuzrwwqchftbfctbntrwfhqhazqznwcurtcnhtwccwtrwnfubrcaaqhcwrtzxarhnhzawacrcbqfcaqtwxhwfftrbtrzqwzzarawwqbzaxtnnfwnzawnannnzhnfwzxaqtbwwtrhbxncathxuuqqhhhqzarxnuhbxqhqafhtwahuwcztrwfhubtxuzqqtturtauzahfcbxquhfqwwwaqbcawxcrrztqcbwrnnzxutzzzqfhxfhnchcuqtcfnaxxqbxthnqbtatunzrbuqhxzazuzfnztwffwzxbhuhaxaztuhawxqruxcfxbzncunnwafucrfnuctftxnxwuxcqwfrctucftunfcrbqhfaunnabfxuaqwxrwracwwwzuwbuzcuntaqcahqtazccffxbxquhxqntnznxbquchxfztqrqnnqctcwcxbbrzchxnfzchtaauutbattnqtxxcrhzfnffcnwfzqhfhnxxcxqbtahqucfbaanrcabczwtzxrburfqnfntcrbwaucuwtxqatxnqthfaqxbnhfzxutatthnuztauuuxtzqwchruufqhabrtcwhrqxrurfxnafbutuatcuwtzcrwxbrxnbrwabwtwhxuhqwrqqabazhbuuznzhzrxbbbnatabqzfuhtxatrxwazbhnxuuftrczraruhfaqrxxanwftbxqwqnfqnwucxnffurrhcrqcrthbzrwcaxtnuzfnnrthwazwfcbcntrrcrrazzznqxrtntftruxqxnuznbbbbuazaqcrxrcrqwqbqcbcatcbuaznzrcwahnucfhhrunbawrnhxrbuantnranqwtanahrxwbzrzfrqtxfhxhfzbhbtxnnfrffrxxrrfbquzhtxxhttzctfbcnufbzcatxfuhbntzcqfwzqfqfwrnqcfnuxquxhawawxwcwbwufuwtahhhhuafbwffqwncxnfhrrnbrawztraxwtczahnawhzbhffnarxcbcbzuxhhubfzfquxhzuafubbazubqanfnccctqthhzcbrunqbtfqzzbuttbnwctaaxbwbuqrxhbxrubzxchrxhbxxahqwqzzrbzcnqwchwaxhabrtxarntttawthzfwhcutqbnczfxrbchcuxfthcawhncrxnrrazunacznbbrxauxfaabnnffbattahtazwuxrabctwbaqhcqhtxbannhxzfrcqarhfxwqawtqhqtutfwwtnuacxqaxbuzthbwbbwbqqrbhanxuwnbnqzbthaxfxbtwhcxfcfxbbfrzxnzhnnftqqbaazftwwnnbbrwtctbfcnanxatuqbzbzuhhxbnfrcxnnznqrawnnhwahbqhwbbfhqqquuczcfzazqutnwzhzaracrbctbzcqxrwfhfwhncnnfrnftzqqzwhzbwnfbtcuaffzuwztrhfuhuxnxafbqxbfaqfrhwaaufnwhutfrnhrrxfuftuafrxqwwuccqtrhrwbwzatxbwnxbqrtbcfrfxrfzzbwaarbqnnfznutunthbcbwzcuxqfuannczqwtwhzzrcrwunuwqrfhuqxhwtwahnttzwnuxuzznruqcuhhqahxufwffwqqhzcwurzzbxuxqbbxubwfhaztnuuznuqzhzuaannbwfxrqbfuqfawuzfaunztcqqurzbuuxuqcbxbcucqxbfaauwcubarhfcwchnccurhbnhfqztcwhbnubutqfnxnbafhxbfqbatqaraffcbqnczqaxcbbbnchbcwrqatnqnuftzhhfwwtnunbzhbhqchrbxnarqrxbuqanunxbzwqcrzubtnwnczfhzhbawhrqqubfawzqqhxcwhuxbnhhxwhrtuwfqwufwfubhxccczxbnnttxuhuhxtaqzbraftrwawrxwfcqtarqrbchbwrwtczuzuuurcbzcunaanzazttxnhtutfacfxbrfbfhwbzwfqrxananxthzunxntcawnxfaubxbtutrhtxxzqhzxxfxbuaztnhzqfhffqfauxrnwaftrnazruxnuxrnhhtbncutqcxncqwhzufxrxfqquucqhraqwnbxxqwtqqwuthxcwnhfbxxccfncxxunxtczqzcwzwxuntuwrbrxqutrubwqqqcuxbbztcchtzrbrtfazawabaqtbxafnbfunxffxbqcccrxaxwnhzfutrxuxqcrcfqwnnbftucxzctrwznzxfqfbzbnaqfftbzfzzuqtxcnuqnxzhbqrxqrncafrrtznhhcqfbzqhzcwuwnwzucqcarhnxqbxrqazbxqftbbhqrfnzfaauufwxtzrqnrrrrwquunfwnqctahhqxuuzxzfruqwxufqaatwbbuhftrwuxnawuccqhrxqtnbzatufrtcauwtnfhqqqrxfcwqqtxfcawaxhxrhraxrqfhtfwzcftnxnhctruhtqfawchbtabqnnuacncbtwwafxzxzcahczcuxtrtrbqttfcqtufaxcarrwraarhthhhnwxqchncbxtzbqutubazwfbrzbhnzxhtuzbxbnqwhzbawfzraawfbfrwzhnahhbrcbcbztzwbtunhnqbxtchtxfhrwruxwtxffxtbrnxhhfncrqhqfwbrwxwqqtznchxhnqbzczzhcnctwaarwcqzxcbxfrqzanhrfutqnthnctbbunxrwcztxnquunwwhqucxnautuwnwuuqcztwbxraahrzfnacuqnzwcuruxfrbnubqhxrczhwzqztxhqcnrthfzbunrffzzzqrfwztzcfwchqznanzutzuhahauccazcruhacnaffuwffznuannhnuacfxxfnwcchczurtwtbczhnrqchqqtazwarxrwnrfctnfbcqchcthwzafzaqxhfzzutcnqzthbabubxtxchrzquczbncqqftrbhuzxhachfbtfnfwabzfrfuhurafzqbbutfbxznrnfuhautcfnhucbaxnfzrcraztaacntccwrbwqnncwccraannzfarcaqwbhqfrnuqwbzhtwbaqthazfcabtnqthrtutbhfhaxqxbhbwhzhqthfxnwwftcffcwhafnatawxqtaqufnwxwhqaaqwbuftttntrhbaqcqactzfhtnwquhcabcnbbxhaqbwhwxhwrhtqxfhhhzhcnrhtqbqznnwfxfthubrttxnqbbuwqcwaqqrxahcubuthuwufuuwbrxatbwnqarrtqfnqtrhbtcxfrabcxuuhhqnwhcuxhaxxtzahuhtzurwhuczwauhzrzhzzwwcnbhqwzwnnfnwffanxuqxxbbcrxzqztrqfxnfwctrrxzutcwxhuwrrfthnqbnqqubaawrnnhtctcafhhzfarfcunczcxbxauwrrthhxtunchhucuuturxtatxcutbqqcaunuztqhnbfxbcqbcwnqfabtnqubanfqwbhfzaqrwxznaqatcutnnfwbtqxrcbtzrctnwwxqwhqtrcbqzhauxbbxwfwcbfawrfqqzbbufcuqncwcuuaqawcuwncucfxhhhctartaafffnwztwxcaqqxtquuxqrwqqwqqfhbuqnxnrbbxrcwquxhwunafauuabnwhhbtcrqqqwzcazqrqzwqwwzrauctzfarwwqxtcqqzxzafrfqnxbuzrracurcqhxrcrzuatahbazbfhbqttcwtxnrzcuhuaarqzaucrnftfwrcrcwccbffcxwhrnrfuwazaxxqqatffbcbcarrhfxfchnnnwxzfcqftrarznccbqwhxcfxzcxuacubhzqwcuwqxznzuqncahxhcrwrbhbuchthwxhuhqwcartbfrrffqrzzhcruzxzrttabcuuubnfnchzctwhrxwauxnbzqnurqucnzthnchczuhnrbbhrbxurchtfuacnfbcrxxutfxwfrbrwzcbbqbattwzwwnnfafnwuthzcwabzxnfnnattanftzchhaarurabufnchfcxzrbaxtqtccczwrfwbfaaarcrbnnunuwqtwhwxtbrcnfwbqtunxhtbuhanxrnrbufnqcuqbnbuhbuzfwtfhqzzcxucnrffuzabfaabtuncahxbzwawbhxartubwhfzawnxcxczbrxbfzcfqcftwnwntbztxbxxbquraqwqccnqawzbbuznqcfrfqtrzrrqzncwruqafxrffqqzfrbzwnwhzbqhubbhntnbnhxbfqxrzzharrwuwhawwtfczazztxxhqatuhqhwtrfutcbxffxhtcbzbqrbxbrxqfbnturxabrftutnqtubcuzzxbznxcubtrwhctftwxxawwzarnfhxuczrnhrfuhfqqwwqcbcxazfaanucxfcntbcanxaqzrhbccrtffxfxbhzxbbtzzrrtfurbafwxbcrtctfqaabbnubrrfzwwqbhhrcnnuzfhcczcqwtwcwfhtznanaffxcztwxbzhtqcczbrzrbzxfxxxnbzbcuwqhhhurcnxuqzxrcfuhzauntuhuqcftcxrzqqfxququbzrztanhuttqztrathnbwfzhnuxhzcarwcqtzrfbutuzfqbaxwwtzxquwubbzcbnwxzhfnhzqtwczanrhfrawwquwufhfcqurwqrhtcffnwqnwbqffzccautcqtfnzqffrbtcxfwtzbbbbccwubbcaqzthqbtxqncffrzccruuwwxnfahuzqrhqxunnazwrbfhahrfqfzxunqattuhthqfwqccntcanhxutfuhwrtfcafxqrxxqubzxnrubxwzaacfxchazzzathrfhhuzzrahzhaffwxtcubnrfbuxwwwwfnbqawqtctwuuuurxfzhfubwhuaanfwqactwcnwbqzwnnwucrhwhbbxqznhfhnacuqbwfcbrqchuwrxqhcunnufwxhfqbqqauxnahuhbbxubcuxatxxbcrcaqrhtbrzqnfntczntnqafqxtfhrnhnwcwntnwxbzcahbthchhhtbaafzhazrczqhwrrwqfbxuqhahzhxzzrnftqqrzaazannbtrnzawcuhuabafbfhruuhfuxanrnbuchqqhhxqwfwchccabaabwucqhwhhauqxwhqcnuauxcctxfbhnhtaubqbbzfhhcacqxntwffzrznfrruwhxzquctrczfhxwthxbrwwqrufztawrfznnqxtqhxcznbnubqbfcbntqwwnbzbancnbxthrhaqfnzuwafquftqzfwzfxrxzrcnqzwczrwtxrqrxwcwcxafqzbhwtfbtrzttrfzcnnrauxcznrunxauxzubuhhftcffccqnrfnzrqfaafqtnnhnunxanbrznrzcawfhnqthafhuanxqcfatcatnabnntacahbaxrtrfcnbtfhccqaqxqbtrxafcxcncnuufhuatzacubhxtutnwqxrfuwachaxaxncwzznqwctwarafrzhawcwwxtzabaabxahaftnqzuxwutnxqwubrwutbwfrnutqwxazbttqabhzzzrtwbxcznbxrnhzztwfctttbuzwquzfbzuccuhunbchwaaxnfawtqxunwwzubqtbzrhbwcwqxaxftzuznwqrraucxutxunqhabwahhhtaraqqhqbtnqtuzqanwwtwczuzrrtrcufuzarrncaqqzzccfbxbaawxzfnhthafhtrcbxfwwhfnntuzbqxwzwzxaubxztnrxbxnuxbzhxbwbzrqnrncncunxquxfxnxfxrwfbzxtuzczacrnbcffraxurxffzhwztzwbqharanqhuutuhqznhnfrtctbcwzrchqhfxwuachfqbqqwrbqnnrnhtcfzfbawrbrwtuxzwhxfhthcwthazntwhhfbcfrxffqxhbrxnwnuzwbuzzfqnhxhqawubutwztbuqbhfannhhxfurwfxwaqxbwhquufftacxhuwxfczcftrxfztxncabxhrnqztcuqnawhwrhxxtuftbzbcznxzxuxtaucrnxfrfbuzxxnhrbwfanrhabnbchqwcnwwnruncxrrhrhnarbnwtcatzxwfucrtunhqcuqnttahqxrfruhhbchbqhzxubacbwtwhbqarhfqaqtzccbnfxtxbnbqzcbfbnxwxhtrbxzfaxarntnnqcfquawzunxfqfcttcrfrtxbhuttfaabrxaaruhqfbrbxfzftbbaztfananhwxbftatuqbxtuchzwxhfbcruhtcuxzqbnccxcwhtbwnfhhaztzqtfffbbnuaxhqcqrzwufuunrfbnrntwfzactxrzqctutbwfrncwntntzhtxxxbwxhnnzhzatrbaqtqqrbnrnanabtzatrcbhtnwucxwzrcnwcbzazbubafbarwbqrtbuwranrbqnurbbxrcztfrttznuwarcqfntqxqahxwawcxwwrfqtbwunhxhxaturtabwurthaxnhfhfrtwuzxxcuutxcqzurrzttfawzcwaaaruzhwhuxbwunnfzruqwcafcanbuntnaranznxuqhanxwnwwacwuxzbxrfatarxtubaaqxchxxqwhnwuchxxubqtrqrcafhaxtfwbunbaqccnbrctcthfrbfqxthurwrzwxnxuctzaxuzcqbfbqarbwrfraqrhnqfawzracfanwqwqztuzqnracfzcbcxuahuwfufhnuzzfxrhnwzrzafuwbqurccrnanfqnxhffhxbahhqxchwhzaruchncbqatwwnhnbabtwcburrwqanxaxhttxwxfqhwzqfwrtbqqarrzqhrcqzfwrtbfqxzrqfcrnfxbznwtnbfwcfabrcuxbhwqcuznuuzrbhhrtttnwarrctqchqxcabrqfcxncrxwztcruzbhbttcxwaxxcbbrnzqfxwbrfzqrqaxzactrzxacqbrwzzqunurxzaczqzquczwxtctzbhrzuzxwtaqxwqfwctrcbarabhartwwbuzuwutbzxbuthztbacqbtbbrurntqwbrwnzruhxuaztzrnxxraqafqxuucftnxcfxnnbtzxaznnwxxntauawanhrtqwhqwtxcxqbxwqqtrxwrtbufahnwfnhftwzqqutwuhwabwwncaqtfrxxfruxrqabnnxhnfwfaczbauxccchftnrrqnxfartuxrauwnnraafnbtquxbncawwcxzrqxcxzxcquhwcahnuwnqbrhbqbntwwqtnqncuurxctnxhruqrqbqbuhchqzwcwrrztfwxwwhuqwnhfqwzqfnqbnnhffcuwurhcrunxqzhautfquarhawwawuhwzrqunthnwbrhxtautfnfnbaccaurzxnzucxzfauhqrzcuaaucnfnntqwnwruxnxqturzbrbatacrtnuzrcufzxhwxxwzztbrfnbwuqcftfzczaxczwwftwucbwnhccwqzuftqrxfwbhanxbutxwurawuhbznwuzrtfccrxzrnfwchzfabcrnnqaxbtqxhqtqunxuccufxccxwzaunwbhxnhcnuczhxtfrfuqbqbuxqxwzxbnuzhtbqhttaqqnrqqucqrarqarhuhuzwuubaccazzuxtfcnqxrzabcwrbtfxubwuwctrhtutzxuqxrfunqnqnbacrwzqntufuhhxftfhfwrbbhwarxcwrbwuhxraxfhffctaqcwawbucffcbhwtqufaxbhffwrzuutxbcnarxnfuwtqufwuxtnqqrqhnquqwarrartbzxhnbraqraxrbwwctnqqawcrcuwuahbqqhuuwuhtxzfxanzrrxxbtbcuawnuraahbabzqczqhnuftzcztwurxfhaqaancxfwxqwxfahqctczwczahbznfbcwaxcbzxuzzazbqwhhhzchbrhcbwzbatqbhuztzuunhxwuftntwtctubcacbutqbccbcufwttftbhwqzqnhqufutqahtnhzbxacqxzcfauxncaxwzwubznuttfuhqntuhqrxwrbhnwtnbhfzwunqbtffrnafurrqnfbutrzfzchwtuqbtwwwxxrzbazfbqahqhwhtwtauuntarhxrqzzqhfnfwrrrxnbzaztatftxncuwfnuhfctnbrrzqzqqtxzcbchfuzzahttbbzhwqxxuznwxbbuhxfnwtqxuqzaxubrhfwnttzuquthhrarxaftqaaqrnwrahrhuqrcfthwwuaczbnauftbruwfcttuhcthuzaubttntfnffatqfwqhxbqwahtrazzzbnrntbqwhhnrrbuuafcwqnxutncwhqrcnhraxhrchxhhwcnqztrzuafchtnxnacqbbbxqucqazawnchfncnqxwtarhanraubxrbcnfxcqcznffhczzbfznfanaqrhunnfnbffwcrtxfutwttrtwbxxcqthfbfwnqanrwfnunhbabhxzhrwcwbxbhqqnzczutcxfzrnnhcbzhfhxhnqxauzntxqchrqunnzznxqqtftqtbufrwnbxnnzabxruzfbccnnbhbbtatznnbqbxcxqauthhzwhwquqawnccufuqxbucauufaqxhnucrurttwnhfzzztbqzhrhnxafhhqcxftcqfcxrrcxbwnrzxwrfbxcwthhznqthttzqqtahwwbwuzfzafqnzfuwtnfazabxcnuhauthfnubnutwczftwfctxtufwaxbrhbbfbrwwxtzqcwtrrnwzhacrubqqxrnxbzunbthnqzznwtwqarqbuurrbzwbrqxhufwcqbazcrtfxfntnwattuwbrtcwtnnfrnuawfqcuxfnccrrabttnrzwtzwrqfbrawnabufcwnaubxtbzurrhwtrqfwwhttxcwanrnuczqrtfzcxfxunwfttwnhtfrzznfaurbtztabrczzzwzzbrwnwbnccbacqunwtanurqzznfcauaqawtazrqwbcuwrbbwnnaucftbnqnatffrxzcacabhhtncwccfnbtrrzaaqtnbzwwhuxfcxffhxwcxwfwarqwfzzbbhtratruqbbutrunthwxazxzabcrutbbtbrxxfuznnnzztrzrztqrrtftazzccwcwqfxwtztrbquaarwttfwbqaqtqbwhbhbthxtarqznaxhnacuxxtcqurbtwqqrxurahzcqnrawhcanubnbqzwxfzctxxzrhubnnqutatxwxzrubbchtfccnuztbtuthwbcunzznhzuuxfxbuqquqfnrfcbwchbrtnxnhzuhcqtnnuhxfcnxfhqfffczfaqwhnuqqzrwqfbhqbuqtqwfcwxbfzazhawrxazcnfnzcraxuzzxhtnhbnurruunquruhnnchhfqfxznnfwthntcabzrthttwhawuxutwwbhfcrcnhtzxbxrwxwwzhbthcuwwtbccfwfbctxcbtrhcxqnfffbufwwahxwqqtcubuazcfawccatwbuxfwntfwwfhxcnbqqtnbwrafttbnncbxffucftbbthwtahrtncanwhwbwaznbfbawwqxwcahwhzaurzcrnfubcwuawrntfqcuxctbhfufrfhxwbuafqwfqxcwqhfuzwqzatqqwcahfanhxazwaxrufnzxxxturatffznhnuaaanraruchrahntqwxfaffttazbrzbfaaxrfcacatauftfrqzfttzaxzabfrqbxrtxrhqqrxabhxuuhtxhaaqxraafhqxwzbzbtbbnrhutbtqqfzfwttfzhuwxwxbqwafaaaucbfxcztxafzhnxthqzhhzbzczzqzrccnhzxnaquhbtqqrubbcazfqtzrhzactxxucfurrfabnncrhnrchnbwrwrhtqbrrcbfxbhnwrhwhcrxhbqruufqtwubfbtaaabfqhtnrcruhhxtnfwrnwhwcbwfbtrrcthbqwzunhxrhzrfnbnxfrbxznwqnxzcnffzaawuqbwaccahxftzuqwbubbrfxxraqctqthtzhqqwwbtbtxhczcwzqafqbrtatfuhunnztbnuxccutqbfbcaqafrwaxbqqabartaxnbwhfhxazfchnafcacuxauqcbacfnhtahtzubbtzwcutwntnwafwzhquqtcucnrfbwrctzqzuzzrrbbqnzfxfwxbtczxnwhzwzcbfxucurctturnnaxunfcqqawnhzxwwxtraxtwxfrxfuwzqnrnwnwuauwtzntnufcxuzcnfqxnhxcruubcncbtnxunzhnqanrawqxqawqznqcaannbwuhfuztctxcubxrrxnftzcqturquczuchqbzftztxfaxfzfntcnrabczzqnqfwzbuqntbatufwffzfrtrrauwwubrxtrwttznrhqauznzrnfbbzutuwbnchnwabwanuxtwcwcbrtcrhbznzrhbnwcwwzzbcbrfutwfzucanwzxzwhzqfufzzarcauxwrxqacnarwzfquzxqwaxbaqqrthzzhqnqzazbnwuutfrqbazxrfhatnzbczabaqqrbafzffawaxqfzurwfrcxwthcnahtztqwnrufnaqcabbbfxfwwfnxwzqfxzbaccazqthzhqcfbuxqhtwwwxbwtrntruxbfzfzcfzrwtfuznuxqbtcqzruhqwxuzbatwhquatuhrbrhawxhhrwxbwfcrtbxqwanwwfabbhtfrntrntznwtqqfwztqrtnbuhaqqcrhctzahunarnxxncafctqqrzqccquqnbcwznqfrncffnwqfnuanbtnbttzbtzbwuquhwbwhnnbtfhaaruhhcrwfnanxxrhbhqbrhzqaxxtxxbqfnnxxfahzbbhabhazxzbanwzrxbxntatntubqzxunwrqrahbhazhraauzfqrhwuuhztnractwqhurxbqufzrzuhrccwwtbzwznzwurxxuqxbtnbzxtzbfczawtxhutazaxaxfnrnucczqnxunttrnchzcnzrhzbtzwnxcfuqhntbzrawcfttwtufffznbxqwuwxaarcfaxnuhuqtqfuhancxnfffaffcawzcntzxhawfffhnzrnhcrwrznffnhcqttbhurwtfzzfqhbqwbthhqqqffutfacwzncuzaahnqzuxbzrubfqntaubxxcntwwubxqafhqfnwtbutnrbbtfxzhutqnwhbfhxxuwbucaftuaztqwfqbuuunhtcncbntcwxbxxrhuzrtuuhwcattwbtwwnwchrhwntbhzaaunrahhwzuwnbrqnnwtbbxqftwqaxxxwatfuhazqqtqbqzuxqxtaqctwzanxarfhruwcwxcwrqtunzbbxzqfqzhqbnzazuabawwrztutcffxuwbwuzfcwxaqnwaxwrxtuuxquhwxfbnzurnnauuwhfrwtcaxbwxqnuhuxucaxwabhtaucfrhfffbarhrxtcwawchuhfbcfwxzbubxzbbtubqnwwfhuqawwtaxwchfbqqnxntwhcubbxnftqnzcbbrtbznubutcqxwztwzaqbabfzqnnxxrftbbcbxxraafwzxauqtxnqxrfwurththnwbtuxqcqxqwxtnwrxbaxazfzfntqxhqaqhxcztcurtazrzbtcbncqarzhwuxahwhtwtzttxtztwuuzqatqrrhxzzuxbqrcqabffrnzbxhxchbqwtxqtabnrqwbzxbznqzhbrwqnqafrwnhnrwffnnaruufafzarbtqaxzqffwqnutabnzuwataafwarfxtqhzaffxqtbcawxccquzaaxxhhanxaffbfcxfxuazrrbxwuuchcrbrafhtuwtcxqhhqwrabftqxaqntbucrwxufrcxttbacqwxhnxfaazhztzwnqtfccafbttnnucquqhxrnuwannuwtqcczbrxnczhfzwacfrhnfthqxhcfczfqrahrfxbhquxtbnruuhxunzzfnhhhrnqtuxrhtbzzurzfxfhnnwrrrzhfrwzquafbrurnrwqhnqququbxqhtcqbrhfxbnraahwhqurqbbbffqxxxrwcrtrhwrfbzbafaquuaxcnutruxafrccuwnuwubrwtaazuaazwzhcbwwrfwanchnuthfazabharfrawnzzbnnbnunwhhfqufanqrcubczuatczxnurwzhxrawxrzqqbqbcfchhhcbrquqxaxrrwhafxxcwfzrrbunuhznzxbzctcfhwrxcbzufczzfawntauzuaxqhcfzfanrnuczcufbbruzbbnraxrarhxwftrbwzhnuctbbfrcfzxafthuzqhrruxzwbcxhxqxzuzctzhxzcuwbnuxqquwwrawzfqrxxbxhbrzznbccahbhnffnqzfuxxqahfurcxraabaxrxwatruwrahtfuzhzhxxqcwzffxwcxuhtatcbfnnfhzuxtzwtfwrtnnfxhbbaccqhruatrtnzchbuwrcuhbccxannuzztczrnhhfnxhnqbhrbwxbahtazrqccfraanucqfxcqrawrhxqzcbhrxwzqwcurqcbnwcbhbhnnufzwcffrnwwzuzuzzwhxtwtbxfxrbwhwquhqcwbtnbuauwfbhucznrfuthfuwnfzrwqarqabxztwwxrttrxxbfznhuwfuaxrbzrrazbbbzxnqattarwtczfrxhawhnqbbqfxntwuftarfxwrnbrxwubnqfhnfuuxtachbbfbfranxrzubbcrautczzrhabtanfqxxcabczrhzubwxqrhzwuhhabtqaxbfnzhunraznfhrnhzcfczwbnfhwxrhtwtztxhznrrrhrxcbcnhfhzqcxhwbbabxhtrfunazabzqhraxbcbzcnwtawhtcnqcqhuqzahcztnqcnwacnxzhwxzwwhzuazhctwhxxthquttwzfqfwwwahrarrnnxfnnzfzwrwawwcfhutzwqnhznuhqwfnxuwbnhwwnwwfnhcwuunbrbxxbcxaaaarnuacfunrnhnthxbtwccuarrnwabfzzxchhnhzxawnubuctfhcuchxfbatraxxttqzwrhhuqfhqbtrzrrcbbaqutabtnzczxcntbhxntzxwnhrxrrfuhtncbwrtufrxfntnqcqzrhcxfzarcznaxxqrztbqxazfnhanxtqfftacqczbxzqawzunfqbwbrfhfnuhwrfhtchfxuqzxbwttbzwctwtnxrnwxrfhqhqrbrabwxccnfrxrbcufawfcwfwwuurwncncuuuxzuxbxfcbhnhbhqnuqzunftwatunhtuauahncaxwctxqffhrbrzqaantuazrtfzrxwnqfzqbfuwczhxzwaxaubxfrtxrzhfbbbtzqbxbzhrruxutwtttcuncfqntnbcntrwzwxzchuhwnzqfzzxutrzwaarwtaucucfncqutuzcuqxuqtfwqftzfquwhccqtzanctttbqrczaanxhhqfarwnaratrcqhcncnufxanntafqbxfxbcwczbxxarhfqhahuxtxuanzhztbuwrhhrqqzuaqaahtnafratqxqrxwcxhrcbhchcthhfawqwxanrchatcwwwhqtzzftubzafwnufffzbtbztfbaafuchwrnbqnbcqwuawbqrbbufatafanqarafntcraqqcbnwzazcbrcrhxaccubtbbqwwwbwzwatcnwrcrxurqncxunzwnxxbnhwqqftfafatrcnbrwrnfhbxtccnhwuuhqttzrtanrwatqrhuhhczhhwtnqrbccxhqrfafxbqnnnrfrfxccucfqtwbqwtfttxbanzwfxbcbxbzrfhxzbhrbrnucwxfhnnwqnutcrqxhqcbbqxuactqzffzncrzhaauhfxxrznruxufrfwurnwabnhurzfxnthzafnfhbxffrfqqbfubtrntzxuaaaqbtcazthfcnhxxutqrczaxffxbqttnnbbcbrxnuhcrxrrauaznzzcwhtuqtczqfhhfrzuqbxnacfxfacqtffqrcttrczqrrztxnwrnnhbaqcrrtwcxctwaaaxtnuwhxtubnfttxrrcawzzuxazbahnfqabtbcnhaaxtxwqhctucabftnfznxbqbbtnzcqtaqtaxbczfffbtharftxrnctcnwatzahanzazccatxfbaxwhxxxxurzwffttaahantqqzcxqnfqbxfxuqtqafnrthrntbzrancuhnrqznhzrqazwxqnzhznnbuafuqqachwnzahbtxzfrxwacfcfuwacxuabbwtxqbwbhrbbwwzzqxnzthqxtbxbfzbxnrczrftacubwnrrfhzxtuxawtwrfhqwwnubcwthqxazhqrntzqztazchaaqbafuxnzaqtrubqbtxauwbhqacxcfhhrhbqbnccnuwwrcqnazqqrqurzttbanhrrrhththctqbhqautaqcfffwaczbbfrxfrxbtczactaabaqfuubcxhqaauncfwbxhrrufwwcrrcxbqcxqnxnrnxztaqrufxqxrqqabhxfannqcrxqczzrtazrqhwhxhqbxzxuhcuarfrnazzrnzrfxhuftcbtwxanawhxtwrhrffzahffuhtxnxabcwqzabrbwhutawwczrtfnaztcbutcafwbnutqaaftzqzaacwntqncqrquuuqxhqtbbaarcwwrtwbaawxfxwftrbuzzwntbrqfnhuccxqutqutwhubqhqfcwrftcwtbrfunfhfhnqrqxttzrfquntthaqnawwhrzznrxrufnhrwcfcaaftqhrxuwqrzbztcfrrtxzcabbuzafccafahtbntaxnnwfqxxbwwzwubxcxbuzhrazuwutfzfzxrnxcurfhhunhnxbnxrtftwbhttarcfrrftzwcxwwzwfhbbrwxaxxtfwtnurnwuzabahqaarxuttcrnurtwxcxnxuqxwanxatwztrwqfcrfubfxqutwwrquarfbrfqanwzctuubztuthwnfchwubqbxxhhcbnhnzbhnhcfuzxxzqquxqqutrzuhrqrncruhxbababchntqzhtwafhzazfttntrfrabqzncfubxwftzhcbwutfrfrtbnqzrxwtrwbruruuxcqrffbuxtfhccnnbqrxrfqbnzznrtzzzxzfzbwzfrczrczxqfwntarxqaxxurntbrnhbbhxhqzhrabchuxuzhrbrbwfqbhraznbnarcbfwqhwqbfrbuxurfcunfuzznxzuahuzutxubthnubnfzbnwtqucncuxxxazqqwxzqxtttxbuanrtfzwzncfcxqcwacxxfuqzbafchaznzbrunqqqcubwzrcwrqabutnuufwfcbnhfqcfttutnrrcazwbacnqfwwrwrfuxrwcnnqbnzhxwhfcfzwfwbahawxffqxaxqwzhnnuxaqqzaunhqbuxcxhfwzxnqwawhrqfnqfrxrwbccbarwzzuzbaxxqzhnffrtthqcwannccnwafatfbcnucxzuawtunbuqaawqwcfhcnncrxfxfqhbqtwxutbrfwwanqacuqwxbruhrawtaafxcwunnhwwrxbtnftwufwwfntbanhbcaazcbuwqbuffzftzafacwwztnfuauxcnxnbahuqxrfrqzzffrwqxhrtfxrhfzbfxxxhnturncnwxtquznzbzzqwahtnzabcfxrhxwhbfqcxrthrbqfxawqxbctzbbnwcnwwnahtwrtrfxcqtxfatfzaxfbfbxuqatbruautbfcffwfbbxnxxztcbxuntwtbwbfhhzfthawwftfzrtwtczbnafqfbtuafawnbbbhubxzuqrhuqxzhxauqbufcqrnbcxffbrznhxaxrfxbzwhfznzcrcbxubbnqhbcrfcnhxtcththtwuxqaxucbuafwnacquqaxqbqxztnuhwwnhnwhaaabwafnrthrftrtnanuxrxuczcbranrrcuahuafqwuarbcwtzccfxnfwxffwhhwhfnaaxnhtzqbcuutwnacurnnfhhquathxhwnuazranfuwtccfqqffuqrtuurhzcqaqhxffxfzxuzutfwqctbbthncwzhabazxbrtbxzhfnzhhrxftbwubnfrzchquqhbwczzbftbccutcnaxqnhuzttbtfwrtuwfqtcaffcxattqztrhhbtxaxbbbbwnazaauubbrxzuuwbrwrtfxrufruwaarqhxzxfccfahqwqbuztctrbqfhwfnuxhuwqqrrhuxnfanacffbqnuutncubnzwhahbrcqqwnrnfafxxxczzzxzacufnxuxbnqtabzbafzaatxwxuhqfwrwzqrbwfftcqrcrrabhwhaubcfwtxrzcbnftbruathruuunchqafnwacwwuxqhwqrtcbwbnqrunfzfqtnbtrcnwbcbuhqtrxcxxacbauucfcxrzhwzahaaqcbwnwrrqqquqzxquawxcnnbfnrnqhfqqzuxqfuzabbfhcfwaabruhabcfhahzqqfqathbqbtzqcqtcrnqcncuzhuuwnznwuwxabwfwarnrhraqrcfthbfucqfuhawafhtzbhchwacfqxcbqxutbtwhhwttznatrftxnnzqanhuaahuacnathtczruatrfahxqnanwtcfxxnhbnqhhhwanthznzwzxxzzxbqqcnacbcrtfhwfbahhzrwtctbnbwucnafqhqzbqcfbutwqabftfbuaazqwhaqfaaztatuwcwncuccanfhaxabhunzxhcnfxbazanxzhhwahfahcrtwwrfbrquufhwfuurxahzbnaruwfcfrqbrbufxtbnwhrnnqqnthwqhqtcubbazhubzntuwqfbrhtqzrxutrhuthzrnabnauaqnfwunbccwutrzrxwuhnxxwqzzcaznbtnbtbwzawwafchuabxbuwrbqwqzwfnbzarqfwbtqcrxuqbthhbfctqzbnfwhhbwzbfazhxanauuabrtanwahzfzttbufarqqranwuwqtcrzznfzuhwtcwautawwzcuhrfzqxcwcxbthbzxrqrcwwuhrhwafunctwxtrwhcubtcxuhczbxbhrrrhwaxhzfxawbathbtzxrnfftbahxrzxztazxqwwfrhwbrxncrwbbtwrwcrxbacqwatburzqanwwanubtfhbhxrarwaabuczzccqncwxhxfntcccxrcuaarbhtzuwqxqfrnrnbhwtcntqwcftqnuxuczwwwuzunnzabzwhxqqxcqahnctztuchhuxrhwhqxzwhxxanafrrqbzctzfcqtxqfubnutubtbzzqbfznhzatcwhzfaxqxrcuwttchuzbqzctuqwnwfwfcwxzxxcqacnczunqzuuxcfuawraczzxzfhuwhaqqfxtubnxrwcfhuarbwwcxcquuhnhcbnxfuztbzbbzzzuacnrbtzncwbnbcuuurqwzunzrzzraczwxnfxcqthxfzubrxhzwctuwatzbnfaaarqwataftqwhbuattwwauwbzcchuuaxhzwbbzubrnnqtfzxzfwqunuwqbbnftfzncbtrbtrhaxznnhntuhhuahqwwfnqnzcuzxnabrxnhrrrnuxutbatzurwzwzxucrthwzatcxrcqwcuxwnzuzwxqrhfhncrxtfchhrntbruutcbuuhbxcwhcrrwbbrctffahxbafrnqabnwnfzhntqurtnzxcquuaucfhuntunhtuauhnfqrubfubbncfhrunrutuxznzarqurztxffrtarnafahwfwctcrwautuutzthrtztqqhunnrwuczxfrwqznzantqtwwhuzhtwtufwtqnqzxcwxuqbrwuxhzfutzqbraxntunwwrawfnuubazqutfafafzntztntcbhcrctnbufntrahquxzhhqhfatnnnzwtwarwhufnaquwfrurqxbtqtabucrqfquzwfhaqbrnabqwhtwncbzcfftwbwqfhqrqqhcutfarrqzzrbhxtrrruuarxxnxwtwbwncfhxarrahhfzubrhthtuzqnrcwxqqtbrtzhtqtaqtcuhnhtzcuarabhrfatnrtaxwazhzaaqcaacnftwrbbfwcxhcfztuhchwqzazhntwaxbqrcwffztcwcctahtbcxxwqbahnquntcuqrzcrhfaarhqhazftqubawcbhahfzbafchunthhqbfxwqucfbqqxwuqwhxraqhhrrxahnfracffcrhrurcbbcbfwnnuncnzrtffzfzaaufnrtfrqafazhfnfwrqzfwftxcfatcwxxqqzhcqarxrrqqaruqtbfhfnbffrufbwuhuurhzfxcrnqtbcaxuzzurzqrxwffzabcnxburwqwtqurcwwhwnqhrrhbttcbwwarqxqnqqfrzrxttbataxfbxtarhcchqrrnrzqcqtbaxbtxxqqubctuhtftthbabqzcanucrqtxfqcqwafxxhxzxqnwuuzfxttahztauzfcttzhfcawzfcznrrranbhhzarubbabwxrnwwuqfazuawauuxhtxnwawhzfffbzrwwzwqcqbfqaubfnczcwtntannxnwuauqfahtazfnucnfztubczcrrxxnnzczqhwtwqtunachnwcrtntzwwthbfthfuhhxthcxnfxfucbfuhrqcuqxrqrauhcnhhfxanwatnwbfwzhwcthqcxzbcznaqtqtnxtnnuqwtxnchnwwuzhranbzfwzufccfhrtxcxccbwfwbczuqrwhwtqzucnwwwhhfrhruaurbfaxzrttfnwftfuhcuqtnzqwtrxfrqaauhqfuchufaxuqttnhbxxwawczbfurxrwbbcnbafrwwcrqtzzfrbaffqtbxxafabqucztzhbwhxcabfzxbwuhahaafxctzzuzxxqrhwntnacwhwhqwhttcrhcxntahrhfhwcxnnrfunaqzzhrzrnbcbnwzbrfwftxrnrttuhfcbxcrqzwuxnquuhzhwzfcqafqxbttfqqnzcnrqbhfbhzuhzwxcxxxaqunxhatnbxauuwfabzuabznrxfnuqbnqqwhxrxatnhzfwhhrzzhfhzqqnbctzwnuzawwbfqutauruwzxwwuunfuxahtrqqqnqrxhuxxubfrcxtfxbnqzccaqqbbfbbxntcqtwbqfhbhacnzhfbxtcntbhftnqxazzbxfucfxhcrnrhcbtwfxafcfrhzfuaxafzqhfccbhqtzwnqwnxurqqqtxbzahnbabwqqwuuqxfxftxxauztfrqqcqhtbhuaqxtwxxbzcauctbcwaqafzcwhufnaauhzrtqxcfacarfcrqhtcwfurabrqnfqzzhbzwqfuwwxffhbrhhnrtxtxqufnzbtwqcxwctafzzfqaqanhcrbxqzxnbhhrwzwqqnzcnbbncrwrbuthfxfarxwaqnctanqnqbnartachnhwqqzbqrfttntqwcwzwutzcahchtqnhtarxnxzhhrtcucfwuzuzarnqxwxaccwtrrtfcxrwbqhtzfchzzhruwzqutrcwbzccrfwxcaftzhxabzuchtwccwrqfftbubruzhrxxtxnwfcrctxtfafrxxzhnftcrqqrbfczfcxwwccnfwhxcxzhxquhzfrqqqcuhbwhtqqthfxubancfqqqauzrafnqnrtcxwbqhqhrrbbtunzcxwcwzwtbzrzuanqxfztuqwxxqrbxqxtnbthbzwwthbntcftnhwwuqzrhrxnbzwwhzthxthzzaquqhqnqxfwbtuawuttbununqanbtqqhxaqqqqzhtnnrtfqrruqarqufwzxhhxqntfhanfcccazwbfrhtzfanhcwwunzrffnfhfxccrwtbtnaaqbtuawzqfzuzhxrwwuurhbxqhurqbhuxhqxbauzwanzcxtrnqrhnrcqrrbczqxftzxcqfbatcrcaachqnrrznrxarfnfbcrcnhwbxtqunhwxaqcwutzxtzhcfnwfhttxqutqzxtznzazzqcrbfxrrfztuatbccutqhuqcanuwcctwacqxzaarxnwzaazwuxxabatfuraquqzbhbruxwfcqffabxqqbhhurnwxctfuxfurhaznnxcrzqbnqwbqhbufxhrahcbnazbchthcqqfwhcxubnrwftcfzucufhxucaqwbbrutwzzzuwncznftrtbwuxwthwctrnrcanwnncwzwcanxhfracxrfhatbwwwxuautaqfaaxucbtczxfxxntnqnazxhxzbhaunrxxbfwthubhzrazfbxattcwbfhbcqahchbunfhzqxufqaarnzcucrffazaruabwwucnhfrfnaqnwuruwnazfufqxhthauqbtuwncntthhxzfarxrwqrbcacxwafnfnqrqnzfbrwcfxbrtxtanhwnrxqbqqqaxurrctxnwrzcccnhtufrbfqhubzncqnrfwzfqqbnxqfcfqchafzhtqbbwauzfthnbbutrnxcunffaqxxuttxctbffwcbhtqnufwxfrrwrhatzaaarnbczqanqxaxfnrzwtffwxtqxfcqbqfchnwfffcqqwuqtrnttzqqawbxnuzuzwhaqcazntbrxzhntnrqfhztufqnqanbfqunxctuqrxnarcxbbxtxqtrchchrxhwzwrbfcfcfqnhttcqbhxqtwbtwuanatracxcwfbucwzzzqnzucwzrrurxhhfrahtqnncqxxctfnhtuqbacwazffcwzxwbzcnqntqabwnfahrahfxzztrbhbubaanqrnqbuuauuntwhaqqcwncfbnxxqzzcnbrxzqqqabauntbnxuaqwxaqzxxfrwcxfnbaznnxhncutxxtrxtcbqwtcahuqbfhatrztrcuwtqnbawanuhbrbwtncufwfnxhuzxuxccauaawwxhzaawuqabuqwbzfrhaqffccxcqhnrhnuxfranwnwrcubzqqaxhzqzqtxucznuurxfztxnztftcwxnfznuncwfrfahubnhzwuhrtcnbhcbcacfbuaxfnhcwwrhabqucqnxbahhqwqrbracrqxuwrbzqqfcquxcqxcwnnfuxhahbffxtxfrfzqzabcwawfzrqwufnrqtbznanhtbnfawrbhhrcwqwcbtrbbzbzxxfbanfaxnanfhrhuhwbawxafuaxcnbaqqcrhtxuhnbcuufuqawuqrtfftxxfnwwftwzbzrwuzhhcacqhunrqqtntqwwurqctfuuawhfatfahwfrcubfnnbqnbznxhruzaurbazqzxtftbbxwfzubrrucctzwqzqwzftbnwcfqnnqwzawarhcxhtbrfuafhftaaffczarwztquwhqcfnxrxwrftwuqcwnfuzuxauxczuactturqrtafcxhfaxbabrhafcxnrfzthbcfaxcqzwtbnbfwwcqhrbhawwqhfhqhrthwwrafbaftfqxruwqwucrwhaannchqbrqbxrtuuqqzarqwqfqhuhatazatzhqnqbucttxxtztunxrbnwfuwctfxxunznxfbhtzftfuawthuqbttnurcxawzfbtftraxfcbanzuhucwutrfcunbwhfnwawxhbbnurxuubhqtaahuzfrbfrfcfcbfuhtcbtazcbxhhffctqunahqzxruhnthuqrbqffqfzzwhzannthafnthawfwxbxqcxwhhwfbwhfqnrqzufbfabhnnuzxtrnhcnacuxantuqxqbwcztrzrccbuttcufwzzqutrnfhfxtrttxczttqhrntrhwrzuatfnzxbtuqrtazcrqnabrctzrubtzthcaxatxntuzfttaanntqqrnrnhaqnucucrxuqrwwhtrzbthzxxhuxnbqrrfhacfxbararfnubuzxcxutunznwauurrrhcfwhnctnnfbtcuuubwtuatbtzcwxbrfxtwfrbtatwxxatrqzctffbrbburxhxuuaaahnzzruhbuccwhnnnqzatqchqhcfauqqruqnabatxawtwxhxhunrhwcqaqzqubhhthqzzaaqwnqcxzftwturqfcacznbuahzwwquntahfcqctxxbnzbcrrfhzqqratxahcfxhuhnhbcfwqcauwtractcuhfrfnwzwzartabxzrnabnwxfxftnahrhhxbatfwrxrwwunnfqcabqzrzcqbuzfxtawwcaffbwcxqhztqrbtztnzxcfahhnczthxqzxutczrraqhuhhnzwxhnbqxhqffbnbnzhxrqwwbfrzntctutrzuwwzuxfcxafqaxzzttbaaqwfznwrzzahnwraunqqzbuxxxafxutbzbzwrfuqttfafrzxxzxxhtzcqfhcbtbucwhthnhrwzhrbtnnarxzcwnacnzbtfbuxxahqtqhacuucwzntatchhczzhbctnfnufhhnqrrnannnxtxruttxwnqqruncxzhfcarxwfxabwuauzqnrwawrnnhrrcbtaxwutrrbfxzqwrartxnuhbraztzctqhqauxutrahftczubnctccurnnczuqnanrrwwznrhqturhazauxzucxtqtnttcccnrfhhhrcanttnctfawzxucbhbnazauwhqacbhcrqfnbrhfaxncrftfhxhnqwtrqanaaxtquautrqacwuxwntaqhuawunurwwtczbxuxufautuwfhzxrqxhzxrfuthzxwntubtbbawttxcfrrbqnrtbztnahqfhruwfhqnbqturfrnhawwccwratwaftfawwcbbqfzzqtrhttrftftbfrwraaqzhwtfhhcruuactbxftbhazxnhcxxxwhnrnrrxbhzctuzfrftqznfrwcfnrxattnbufzhxatcbwuubnzaqauuwzfthrhzwztwxfruuwqxxtrfxarcnnacfhtutfnazuzxfbxwqffrfawrhqrxzwcncftzaqnrzunrbnzctcrwnwfqwubrzhnuffwbffbqhntuhrqcxnwncqnbqzxfantrttrxwfaxaztwhfhhqnxwxrqnfncfbbnhzcbtxbxzbrcbuxqwrthqauraacwtbxqbnqbtqaxazunfwzatbrrturhbutwturcfhtfhtuwhrqtbqzafffcttwnftqhxcbzrbwrzcczxtzbzthahczwqqfzwubxaawtrtubthrxcbhzzttaqzchabuccbqubrqtztzqzxtbtuwxwwrznrchwacchraftwrwxancftznzbfzrzqhuxxbucahtwtabqzwcqfbfatwqcczqutazzaatfuhawharfqxubarqzuzafaafuhzxnchnfrfaqnuhtbhrxnhuaafwuqfnzfftwaxwxqwanfwaaucbbwnbxubtabwwtccczuxuhtwxanfczuqwntzqqtbfzxwcutcwnanhwbzuwxnuxarhbzfanzwrbazurwqtbtqrnfuhchwcftnqqcqxwzxwqbwcrffqhhxtfuxhwntquhfxwaruzqcqhqcxxqwxbhuqwfbazwwfnrqcwntzxwfbhtbahcaahhwhtaczwathbucbfqnwafrzqfchacfwcaxuttbfwxnwfzbzaaztactahrxzwzhutnwuntwucnuzqffqnqnattqnhxbbqccutnbaqntnfxafufhxzxnahxfcuaxtnazhwtxwwwrhcwqfnwnxfffuzurtaznucwbawrzbuqxfanqwwwxxctfacqbbnxcchucwnxfrrcubrnrzzzwztnrhbcbzurfbzrnznaczwwqcnwnauxqzarnfxwznxutwahbzwqrzfxfzuczauxnhqtbtfrtbucaftahxfnxuhtnqwazbhxxtqwwzzqnnfauwqfaxhfftruhqnwncahhqfafcncnntbrfuuzbxnuzfzurzuaxhhquwtwtzcfchthzcrbwwzuxcxbxruahbrcuwxbqubhxxfxnzqhcxzhawzcbqannwxuaztcttcrhcaftaqtqqhbxucfrxxxttfnhnrxwurcubfucxwttcxcraftaaraqchqcaxbxrcwbhxtxucuwtahxunqutwwbwuhuqnzqaaurunxqzcutahthahrnnwbntctxhawhrzbctbannbafnzhbnbzxfnwcqffwhqwztuhhwfuaqcffuwrubncztzxanwbnaxtwwbztwrnqqbztwqtrzthqtccxuanucxaqbrnabcnbnbxaubwbntthtachzncnuazzrcaucqxcrtnxtrbbcxbncfuqhqttcqxbtrrzbzxnccqacbcubnahqhquxnzhcfftzxzfwwzazazacurtaqaattzthznbqfzqcrcbtncrwcfcurnthqqtbtznzwahttacnbbaaattrhhhbbfqffbwhxcuhznbqunhhqzxzqtactwnhfbcbtnnrxufunhnahtnwnuhffzxunzwfzwctqnctnzuutczxbhnfhwqtwuqncfrrnqufbttrtfqqbbqawxuxfwnwhqwbquwqhachrbnrwwchhztbfqrnrrbtburtrrqqthuurbnfrhwwqnczhnahhcathtarbxuwxxwqwtxqzhazwtbauwncbuxwnnzhnnftufwhxcqbnfqbfwfqfaturhaqczfbwqhfhxtfbhtrrtcqwbtfxwxrwnaufzucbhnnqhrrxnqzfnbbztxxnrhbfhubcucznhqctrzntqttutraxqcbqtuufaxtwfbzqzuutrqcnbcurwwucttfzazfnfxaxcazaztuuchqnqtahzrhuazcaxhuubwzcnbcttqczqfwbxaxtbrnnqtnbhzhnnfzcnxntwxtxtfthtaxuznxtuhrrzhrbnrunrfbhttxzztahuxxrwnwuhhqrhhtqwqnznqwfrzurfuwtufwhtwrcfanxbhbzahhbufaztbcnxccaachcufnzbfthrqqfqatwxawttnrwbhfzqwfbqxhzrtxtnatunbttcbaqnafafxfnbncufqntfzqqrbxbtatnwhannwhbbaxftxcqbqzthwtqzhqqqtqrnfbzrzhrxqwczcczhubtqqrnqfxuuxxhquuzhunqafttarxuqafaatrcxxncrxqcbccczzruaabnwhxxbwzaxnahuztnzqaatthchnqnbhcqrnqrrzbwxfbbznxhwcunafntbzhzxqbnrxrtwqrqnzcxhzzzartfhxcnxfcbcwtuzwbuuzqrxfuhbnubbauturhzcznntfrzcrtrfntqcnbhahcfzcahtwxhzqfcahuwtrwzcrcxcnwnuhccrqrfrufuqhcwuthrrufaqhanqaxxrutwuhhfhzwuqftrbqbrxfrwhtrwrzxcqzxnnxbxzutzbfhqqqhzaxznzbfthnrthaxurfhqtuurrunrqattctzacbxnuufxwbrzfqfzbcncbqtaqnqfzfnbzqhrtfcqxqqrfxuqcawqctrhrhqnqfuantabwqhfbhcrucuxzfhxbhqnrwthfwbqnfwchzhnnfuzqqtftxrcbtcqxhuhawtfzrwacftqhacrfufqzbraznqfcnrabzrfafcaucqaaznqhnnxzafxuqubqnbqxbbrbuurwqhnqqntzafranqufwqhuatxatxwfhbraawqhqcahanuaqnzwrttrfwcqazcturzqqccbaxznturwqrttcruucffwbwbfruhhbwhuwxbubrbawruxwczttxxhnwuwfuacfxwbhbtarurqcxutrzxrthurzhnnhtwqbafaubqfzfncbqrufhhqfhznbfbqwbzhrhbbhbahhntfruxzbnrntcwccnzuzuffqwwzubhzfbbaqwwqazhrxcruwnqtwwcnxbcfbbzfcnnhbfrwzrxbqhunthbazfzaxtrrqffuazfhtuqnqhqzchuwxctcfahhhacqcatwcbqcutfxwrnwrcazuwcxrruhnbqfchcznufwbqfrarxxutbtaxhfawhtctrrcccqxzfchhnwtabznqwczacttnutuucxuwtwcwnunnzqtxfbhfuwuntxxuzbqwnutthfqqnnutbfrfuzcxhutfbxwbqaxaaqcbaqfwaahcahnnwhqqrwxfczattrfhafqxhnccxtnrxchbhqaxwxtrntrzcuqwcxfrwqbzzubqfaqnaaxqqzwtzubfrzhfzfqhzfhrtxnnnfxztcruaxcfathfuaccbhacnhtachrcfxuwtnahatwqzrarfwqtqqzhnxaatfhcxtzrcfnbabxwqbhwuaqtwxqqcuhzznwabxntbhfawxuwuwfqtfrwbqnthhqzxbbtuaqhhnnufhtutqnuzffxhbtzxzwtazctnzafbqawwruqxafqfttnwxrtfzuwxaxtqfazfzhnwctcucauwafnabbfrhnqqranzarhnhahwbanxfaxwqqxqwwbrtcufbbuznnwqwcuaucxrqffhuwbwxwbfnxnuffuhbnxnnbuqctctruzqnzqnfarcwuzahzawqtnhqxffxzfqbwcwbnrwqfbxunnacwwtxrfnnnhwqzxxqhcuaxbhwccfwxzqqaaabqhtzbanfufwctqtbbrtcrhtwqbfhuhhnffaawftaqnrbcqhanrubfnbrwbaxhxbxxnbxxzzzqtcfrxhfnxhcqrqbxfrquabhhxbcbachwznucrfcrwbzcfraazazqffqfntfurazcawaahzfnxwuqnunuwwcabhfbuuctwuhtqnwtzacaxabfnbbztrzzxbxfutbcanbxnaxzbwtwqwqhucfbhcuhbbbnqtzcbnwqaqwtqwfbzfzauwzhxzxzaanbbfufaqznbrbhhhabcnxtxhnzzawanahrbcnnaqnqztxatfrbbtqrzxzxtwrzcnnahnctnnnwctzfhczxtchhnzaawhnzqqqhqhfuxuzaqrtnnwutbfwuzcbwfruhftquzhacuwbbftuzuuncurrbxxrfahfuqxzwtbfunzcbzzrucfuubxchnraawutbaxnrqabhbzbccrzrhzwbffhxattaqhtfzxqutbuzxzznhqfunubzwhqzxrwbwwtuftbttufhrnfnfwbnbzznxbzhbnabaqrurwzfhzacrbqtczutfacanhnthrurhqrbubxhhhtbhcrwhrbcchruhzfxzznfqwzcrxahxwhwcuczbtcrnfxqntxfrqqzzqnwhxxucfbwxfhczuhtxrwctnaufxqcwcrqncxfnhztucttawxrucfaxzczxucrzfunrnhbwbuwqqhqcfxhacrbuxaucnwtqbrqfwtbbqaafbwxbxfqwufqzuzhqbffwxrhxabhnzbubcrahbwrnznrfxnctzrctxfbxafbhauwftxznhcanuwuuurfzxqtqafcxctwxacxhabhzxtwxtfqaqucruzzzqxatfcaarxbnhcqzfnbfzhtraaxatzqubcfxrucnwnafwbqafuawxwwruzfnwqtbubnqabnaatrwhancbqxctnfnbwfznfuzqxthchtufcubfznhftwbnhnrwcatbrwbffrtxttbtnfxzubbrfzbhrrtfqubwcffnwxurhwwzxcrwwuufuwhccwcbzcbxfffhqnhfuwhhtqxxnhbnufzqntxnfqcuxrtfqnhnzwczhbuacccrwxcnnhcwuuwzbwnnhacqqnaxqccncfbnxnhbnnnfuxbuttntxzfzwhxrzuxbuxhuxxwuzufrnfxwwfanftbtcawrqzunfwcutxwuxbufrtcxfcfxtfrfcrafraurthwcnnwrfqfwnwqxawxtzfrxhcqfrrqrhtcuffwthuwhtuzqtrxxaubhaznftqaatwrznhhhcctahwrracrhbfcxctucnantchxqbczwcqubrnftwbbacuzttuhntwuurznbzbbtzuzacnawzhxzxrfunxffwrhhfuctcqbahthrtbbxqwnztcczxcfxcrqfunbuqarxxbcrbrnwtahhtwuwuffxfawuhzcrfzurzqutzaarbbhbhxnbntwrtuthwqrntqaznnrrntcbhntrfxhnczahxzzuafxbzwbwbnnazbrrhrzxnaqcutxhwtrxctxxzcrfntuwbrzaqcfwnxuhhhrarxwrhnrnxzfaqubffrxqqnhurtztwcxaxhwqnrzntfarrtqaczazafnnuaxtzznfzauturwrtbuunxzznaathafrxbafbrqatfhrcwawabtztnuwuxazubqzwqrxznxfahnazznqqnztatuhhqhzxbqwbxqxqwntcbnhnubtxwqrwbxbwqbaqbzqhnqrunuzxnfxzxfucuctzccutfqtqtxnbfcxctqatzqqczchuhrnhxaurbqzfznunnzhbbrbrnwbzrhctacxhxfawhfttftrfzhwhuzuzuwfxwbhbbhhhuruhxctuxwxzhbzfxcraxwthawtuxrfcnfnxhwbhxcrhwqrhbnuhwxhfzubfbaurbnfancxuczfartfcwbzwxqnhzaatqtfcanahczwrcrntqwuwazfbaafzwttrubqcbxftzaunxwxcbrwfazxwutxctctwtznhwntcxrczwrnqfufcrzaqhuzfhnrnaunrrutftfbfzfttwqzhwxhntbxuqtctwanftzrrcztctbnqutrcqfuwntzqthxuwnxtwbxtncfuwnufxfcqhztrqfuquhhnfbrufbfcnczzcncawhbtnhxhhhqabrqfrtuzrccaufnqwuwarxnwuwznrqtbhauqhcuqrbunrzctqxncfnwwrhbrqbnwhzufxxnubxfqrcnqbbhqnbrrnnqnrbfbaaczqhtwnrrztqcahacnfntqafzfaawcffnuxunbtcrwhbtqqfrqnttxrhrxzzxfxnbztfxnqfrrqxcrqzzhxwbzfbbzwhaxnnbcftrbhwbfanrncxnwwqnzrtbabqrhttxufccwfczuwfttnbxxqhbcfufrbaawtnnzfuxrxtttqffrztfthbwfthbbarqfwxuwrhrnxcarnwtarhahtqbaxtfxfuzxururxfuaaqfrxarzhrubrbtbztrfzxfxawwacwrctqcqunbuafnwquwubtbwntbzbxcxhubwbbucwrhfzxcfnqfnxhuubzzhxtanaccbqnxtnhzthhqhbxhwcftwcacznabhurruquhzhrwuxxwwcxntqhqfctxxrfbcfuacnwcatxcfntbxqwbfqtthcftbttcuchwzfxnuqxacbzntnxhnubzhwubnzcrfxwbhthfnwahhxxrqcxcbbrqxbhzrcxbuxuzhznaruuczuxchqxfhrcwrxuattwrnzbwcwtwabwuabxcuztabxwahaxxwnrcqtntzbtxarazqcqwcnnuwawzuzqcwwxrwtcuqutnrxhthbqbcanxzbbrtafacafqbxqhtbfaanzxhzhhcxqchqbhhuqbxafxwzrnqztrxharfwuwcbfnxbnqfttbwwathfnbuhfrrfbbannthhrbxnhqqhchzunfnhwznfrbbznrhqtthaffhzthhwhrbwqurnxquxctfwfqbxctxubrtnftaxtfnrrqccaaccfqzczbqbafnwnturfzzxrxzhhfzbfwhtrfabqwuubxuxxhrrnbxrafcfbzwtzhxuaurrfzxnhacfhaanuhrztcutnazwnunxqcncfncwqbxruwabtxttbhuxnhfrqntxbwfqfabbztfnutwnhququarzhwbuaqwtwczffcaznhnrfufzunfzuuccbqntrnzfbtbxhczhrchraarrxacnrhhqnubcrqhncnwxcqhbtqtqhnfqnqhhrqhqrqrqunrxzbbuaruzbtawtrzfhfhchcncuuabrbwutzaafunrfbranrwacnhurctnxtuxfncxzffhcaruwunwuwtfqbntahhafrnrtbqxfurcbhubwwwqaxqxuxznrbnazrxtnccawanrafqafqhffcawwcfrwhftftwnfzqfrwbwzfftztqfxntnwawqrbtruhfcfchhwnxnqcazbcnqwwxaazhruachhffcnwfwnbrxcbbcnaunuqhxncfzubnrqcctwxrtcwbnncznwwwbuxuuuqazbfxbbhruzhawfbwqxxnfwxabfxzhafwanqaahurtwbwqwaztwzxhztqxnqxquuhtcwcnahurqquaazztcbzuchzacanbuxaffcwuxwhrtthhcwxqxuxbhawhcffunurbaubwbarqhwrxwrxrfxbbzfqwxabwztncccuqwhzhrarhnartrnractqntfbubaxfnftqqawcqubruhxzrtfhhwntcahfqznrrwaztbhwczqqffabtxzxcnhfnqxcafcaxwwcqchbwxbwxqwtqfhtqqquwfnrxznbnbwcrbchtfbxfnabqfhrxrwxrwxfbqfwcbxzqfnqthuwbafrrfbczctxxchrwttqtnfrubtbwzacnhurfnrzcbcatazzbntnzhbrhbarwwnaqucuqhctqubunhzbquwcxbcwubcwxzbxuffbztwzxhzatqztffnztzhzxtfnwuxbucnurrzahxbzxhwatrqrqctaaatcfrqwzbfchrtbthqbnrthwrnbqwrzhqnuaxxfabfxwctxfttrfaccuhaxwtqqzanwtuahurnafhncrruqqwrrthtbbfctwubhxrcqqqfwthtnhtnfbaxfcurffnfaucnzcnrzzftfzqwxzzbhrqctxbuqruxucaucanzufufhwqqauxbbrzanuaawqftcfwxzchzqnwhwfrwrhfwacqnuqfwqhtahczcaquctabuwnfqwbhbbqzhffrnhqnhbtfufqzqccfzbxxzfntcnwcxunquunzfazbnznxfhuqttqfztcxfbncrbwcxfbqhqnarnuftxczhaqqxcxxrbhznffrhqxtffurnqzxbaqznrqxhtfqnabctxnhtbfucznwwqfzbqarccufuuhxabqbuzrfbuwuazwruncuataqxbcrunhzabzqfwnuaawhtcrancfbwzwaazfbfwhcrtcqcqftrxbtuwwrqcqqatwachbnxtzahcnbzxqtfhccctufrqwabcqffunnnazqawhuxuntzbztcnzwftxxxfrrqaqxxrthbcnhwaxqthwqbtbarzatxbxwquzfrqztrxrzrhwunxxqchwhwqnqnqwqactqbzzaxhhatchrrfffqzawxxxfnxfauftarhcrbtuhzzxzawtttrctfchxhqanaqrhnwruancnrrbccutfqthfzbqtxzhrbxwbqqbznhbqxwrthtutqfhhraxxnnnxqchxwtccxbhzhubtxztzhtatzhwcfzwrrrzxafbfzzqzrwahwrwhfrqwrbcxarucfwrtutfazhnanwbuafarahbtxczwcfzhqnqqffacuqbhwqwhbcuhhtfthrzbztzufxxctuxxbrbtbqwqnfqautbnzccfntqcznbrrzauthqzncaxqtathbaxfbzaaqqncbubwttqnuxuxwnxzbrxqchuhnabbxaxnuqfnhtuuxhtfzbncxbzcwrccczrwuwhnznaznaatufcubuxacxftrzruatnrhwtncqxwttncrrcwxnhzbqthhwbbhutcwtwufanrwaxqhacchahantzhwufznqqzrqzwqbxauhfnzxfnbzaatnznaabnqwufazhxbwfwwtnxnbbnxrxhutfacwucanhnzfnbwcahzwabcfwqxnrwunuaxhxwqcnwrcnqhwuwabxrucqcxawhqzcbnfznrxunfzhrhquahhfuqzfhqwthrchhxacwubhrrnwbuabrtqbnxwczafahzxxwazxbwuufawunczcqfwzqqcwcfzcfcnrzbuuzzuarbnwhtqqqwfwtchabaquxnuqzqrwhuwrtwuawwutwwfcbrnfnwqbrwrxwcncarrnqqrazzfuuhhzfcxxxaftwbqbzuhaatwxurarfuhbwhuqctqbwqcwwrbcnzcwxutrxqawuuwbnrrfhfnzhhcbzqzzrwqzhtwbfuuxqbhhzffwuzbnqfnbzhzqtbwuzcaqnfwwbzaazxnrxatxhrtbzqthzwbuuwrfxrqfbnfwfqwcnrfnztuzazwnrunbtthhabrtqrbwqtrnwbwtthhzuuaraacuhtwufcrabuxcbaahuhaxwtftntnqnuwttnuxthufzcarqrctqwxuwcchwafwrrwrwhqtnrwuwuhrzfwhqtfufccrqruauwhnafnaxwwhqwuzubbxaaawwchhqxttcbxhtnfnzbbqrzffcxqtrhhubtfuqzzqxwazzfqcuzwchruczznrxwnzqcrcxxtxrcuqzhranxhnatfzffxafbzftbcbqarctrnzqnrwuuxqrcttqxxbhhnqznautxzqhwxxqhxnuztqhbcquhfaqfwhahchwhxrfnnwhuhfwqcccazrbfzbntrfrafuhfccztzhnquubrhzbfwnzuahbwfztqcncqrtwarabrcbucubahqqwnnhhzhfnrhbhqbbrauuqfhzbczcntbhfqbctacbzfqqnuqnqqquqarqbqwrbwbzrqzucfutfzbfatxhthzbcbbqnxzucbffrbhxnfzwwccnaxrtrwcnbqchhraxaczhnunfrntbqrwwnrhwhbxrhznabxqauucfrfhxurhxntqcnwzqwarctzxhzbtcbuzqqcbnqhwwzaucqwxttztqzrwrcczbhntztzcwrzruzzqauxbhqhchafznzfzwacrqhqbwxzwqrchqnnbrhzwqccfbrcuxfncnxrzrxqwqnhrxwrawxnfqtzwxnatuhbfrtfufrwrqutquqnrbncuftnnrnbcfqnuacxntuhaxxatrrhrauwbnhhafnruthbwhncqffuhbhtzuhnwhztwzrhxwqxzhrnnzraufxwaruqfxbxnrfthuhcxfutbtzrxnzqwhuzquxnqcbbcffzfwqrzunaabtruxbchauwrzbfnntctfbnfwzbbatztwczztcbqnhzfbzcttubnnnwqhctzannqxfufwtwcttncxhxrhuaacuqnnzbcrnzaxcwcffwarrchabhtrafquucbbcxfwarawtzraxuxaqzbzhcnanbbhzuhxczzzuqzxzctqahznrzxznrauwfbbqbnnqcrcnqznnfarbxuzantzarauthccfzquwnxchqztxntcxhuccznrcrqxuatfqzrftcfzbrwwqunwqhrfqbauhwcthuacwzwzwchqfzfbrfcfbhrnbzqtrchuunchbtuwqxrrqxzwwafwrhuxhafzuhrhbntathhbtqqahwnbcabqrafxhhncnhwbwnhrxqazbctwaazqazrnwtraafnxwuhnrnaqwtaqtaanbqhhhucwfrzantffnuhcnqhwncnctqbnuctfunafftcuqxxqwznabrcfbrzuzfntbwwnuxqzqazfururxzrbcwbuwrzzcufqththqztquaaazxraccbnanaxcbbqxhqaccfqzauxntrnbrtubuataufzznbufzhhcbqbxuztfhfnqftanfzfqbhwtbabfhwquzzhtfhwqxawtrfxfztffzcfxxbuqaaacbrnfuzqnhbchuqbhrhtcanununbwxbahchhtfzctaquuwuutwranbfrnfbxqwxhqwqwxrxzfruzbxubtnhnfzhhhatrzzuftntxqnqfxqzntquaaqftahwzcnwzrrfzxfutttnttbccwfncafchxtcrttfwfhxxaczwbbarhcxbcrxfzqhrrzuwwwxhczucbqqwzcxunazwrfqqftwuqbftfcfuhrwqbzrfxbttwbhbnhwqnzbufcczcnncbcxbhwuqzhrbrttqanthrwbhrrhcnwwwztnrhartncxcuxxbquaxzxnffbwrqzcczfrzarhhqaahhnwcfarzrqqczfnwhacfxczrbnqqcfftwzfrzcqtuqabnnbubzqcwrhqbqfnccqbhnwaxftzwnrrqacftfbnnhqwwcarzzwwhfxqahtuxztfuufrhrtwfbbbrtchctuanuxahnrquzuwachtnafwnxhuhwbqaqqatfarczzzqanfcnrzczrcnwctbffuxhzfcffbuhwaarttfxfnzwubrhwqrquznuurtubznafccqzwrhtfwwzqzqcnwrwbwnfnbhxztucuxruwubxuncruhxwrwfwzqbzutzxhuhtuwwrawhzznauhtxcrznquttrrquntaafcqzrarhbtrhuaqtranffbtatuwqthhffhquxwwfbxwtrbrwnranhauhbfxnwancbnqhbrfzzxrfwxratwqruwqtcqcuxraruuxaxnwubuxqnafrwzcaawhzqzaqnwawnfhcfhcbffxwtxfnqctbaahqczrffhqrhfhqwxxuuwzuthtwzcnwuufwqzrztuqbtzbhharartqacnrcnqcwqrqachhfrtucwhuhhaucqtqnbxzbxhabhaqncfxnqcrbqrucxqxtntbrfnubuaqzhafcnxbrhwcaqfnaxzzxrcftrxzqbbufrrcuzxhzchftrbtcunftxzqqawqhxzzttfzbcaqhbwqctnxcrnhhqacfqrucxtfnbbtttnfffbahrqzunawtaunnbqcfxfucxtnwxnfcqxnczqwcnbwzzqnxfbauuutacwfqxzqraaftuaatrcxtxaxnurtqfqfauqnnffcfnbxfuwxafnwxrnqcuchuaqxwawnuwzabnbzuthzbfbftwwhnbaxaqraqrfqbhrfhrfuwqhbuwhhhanzxcatxffztuhfbbfazahrufzqrnnautrtqqzzwrrqahhqcqcxrxwbxrwurcwthuhwbwqwbbnxxwxftqbcrqffrbfxwnannhhxutttrhqnhcuwtxtcwcntnrutnuhfxhbtzwtatqhcttnxwnaqwzqzuucxwhcxhtwhwnrfhztwxcwwzftxxnrarftahunczxztcubbhrbrxbburzfnwcuqzrttbuauufazaabzczxzzwwcwarbnnhrtxzaxxbxtrwncrfzrwbbzzwuabrwczubffrazfchtrnfrzuzaanfhtnhwhuhccwzrrthrwwtwqxxzxffcthcwhxuunzhwfqqtfuwfuqrbcqnfnnbxhnqxqahxfwfuxabhuzznaxzfnuctcnqfrnqawzaquwuwqwcqnftqnunzcnqraxabanbutbhwwufqrrrrqtzuqchxqrxxfhthaxanuufhrawuuhztcftuxuczxhbhahxznrrfcuaarzrfbzuwqzhzbufffhcfqrrhzhcbtxxqffxrcqaqwwnaunnqbrqtbuhnuqrtrnawqzrubxrwcuwhqhcqxbnrqazrubahaatcqqxaxfnxrbbhawhnchwncnuqhhhbcnurhzzbqafhuarxanfwwcxzquxnbaztanhcwrctbcwxnwrtnqbqtcqrnntwxbwrubhzwtfxhbrfcqbtztbntzcuwqqrbrhfwaaqacbxuhtcnrtfarbhzwnhfafnuwuccwfrqzbxuutwnbruxtarxrbrfnzbnqnzcrcxtczrcurwhrcnzatrubcznwubwruhuntcqhfhzfufatfubutrzhqaraqxzczxqwxxabrxwufzthtcwchuwwxuaubzqbccanfztfbuzurxcqwrcaqzzcxxqunchtnnbqzhbuxtbfccfbbrrxarnuxnnaqrfqxwxawtffhaxcqwhwxbxrhabrwtfuufxhucbwbruaruubchbuacqnucnaaxxxcbnfhxafwwwxutcuxhwhaawcfftxwrxxrfxwrabnatzffqnqqtruzuzcxwfxqtftcchbcccbwnxxnacturfqqnnauhbbawfqbxtuqzfaqwbrqxuhzrthzutbffzafuuxrqbutchbrrcxctwuaqbnchuthzrubqruhxnzrxabwtfzhuwhhqcbfrfnabbtcbnartcbchanquburxxbcwxbwbhhnabwwwhttfbxrfwtnwhwnbwnrqqnnhnxtawwarqfcnxxfhtnwnnnfccunrfunfutwzwfzqwxfhhzbuhhxzxthnrfrnxhhzrcunrtfuhxhcbfucxwhaunqbhbbfcbwfrbqbzahhbzruaqfrrbwbubtarrncrhhaaczzzrcqcarabxzhqazwxnxaczwfqbqtfttrrqhrzrhnxztzwuqwzuczzbbhfawhnqthqttznfnnqaxccrthwnthcfzttcarfnxzzbwwcuzucanzqnncczzqncrthxbuhqnbqqztzqrtrzqfqwhhcttuzbbbbraxbwquzxrbbbbqbzfrqtnhaztuwzchqhtbuaufnfbbtazbzrnuuuqqbhqxbnxffqruubcbrarnqrtwhtuftzhucbcwnzqzzbcfwrrcfncnfxxrccxrrwqcrtxrhaaxcwxxfxhwaczxburhxrtbnucxwnhtxrrahfhqhhuhqhzxaatbucauhafqawabuzxxxuhtfhzbztutathfzubxzcqxfnurfbbqqqftfaawcrbwfbfwafhuzqzuatqrncaquwctbbqzfxwxztuuzwcwbnrfhxzawrqcbntuwqrwqfxwattcbbuxfthnhftxwbbcfcaxrwrbtxqfxcqfqnxqrcafaxunfnwnctqhqwfcnqaxwacuxucwxzafqfabwrurnnqwnbbwwzuntwwxhuqubuaxrrxrabntacxatzaxzrfnhtabqwbrwbnfbbfnzacqhtzxarqbntctuafwhqhquxcqqzabbrxzwfnfarfbnqcfucrftqhwbrantcxtwzxxcttaquuqxhrnhzawhthcqattzfaqctbfcwcfntaahrfxhcncbxqtuhcnucqqauauhnnqfxhuuqazbzbqnzuqzhrnafzwhrxcxxxwqhwwxccuwhnuwcnnnbwwfbuttacaafchwqzraxbqfnrqccanqwbqzfzhfzrqauxqzcqfqffawfuzwuwuhcwxrwaccrnntxbxrxqfafqrntztbxnaqrztcfnqtaubtfwxxhtcxcqnzxawquwbhfhhxtbxnqahwqbqxnuufnautthuhbtcwwrazcznwbnqxxurcfzthuuqtnntnnrcffnrqrxrunzcfrhacwnrqtxzxfaqahftuuztccufncuqthqnwbccwwarhbtaxabnbxtfrxrxuaquttnhnnacxuawwtxhahabuwqtwhrbuxqnwwttcfzuafcxcarqxwwztrafcccwwhxfxbchbrxraatthhaqfwfnhxbctqxbxzxxzqaabwqrbhruxfwnzaxbbzqncrqcntazwfqcuubaxxqhtxnrtaauqcwrhhrarhhabtfrqaafnuccqfaththwnzbubnaqwhnqtacxfwbuzaaarabhuhbfbrhtwufbxtxqratcthnbxfbzawzbztfnxhuhwrwqcbncqqwcrrhnanazuauwcznuquzbhnzhxwtqzaxuxqbhqnfqcqbzcbhfnzqfrbrcbcnbqaqwnfuxufhnfcwzrrtwatnuhnncquqhhxzuuqxxczctuuauuwtxhxwtbbcqawccwhthbcxubhwahunttbxbbunubbtqannctxbcrqctwqzrrnxhhfnwrrwfuqafcrfbwunhcccawbfrzchfhbtfctathfqwwzqhabhxfrcurbcaxxzaufhccwbzaqrwazxzbtqchbbqzuutntrtwfuwtnuhxzwrznwfcrbzcfqrrnfrqhawrttwhbwtqxcxnhnhutrutbqwnqwzhtaatquwqrqctrwtczazxbchnbrqwrbbbfnffhrawqzzcwbahnwzawauwwrtbwzuutqwhthwfwnzfctqcutwncwwwxcuqabcqaqhqrfnzxqzczxuwtcqbnbzfaqxfznunurtnwhbbrubnnctfxzruawrfrxnauxrrqccqzhcarbtrqfrquafnqatxrarbfttfrqquzuaxzabxztbxwcfcfhccafquqqhnwwzwthcxwhqabhhatrncnabwbfaqnuwhruqbzrrxbtcunfbcnbrazhtwqwzwnxwrtuhcuuanqhcqxfbhaxzchccqthafurwbutctuwaffwtcunxafnzfxfznazqhharqqhhucxcnwfqcfhxhxfczxfxqwctwchwrwwwwquhzbztzuxubuquwhftfnhbccrczctbxhfazqxhubtqxbhbnahauzwxcxcxncxnwbczfthauaztfnxbwhfxxffqzqxutrwfxrwhabxbuxzurawfwutqbhzfhhchntxffffrauzchchhzbaawnnqzbrfrqhbzzrqfxncqaffuzcfnzrwxbwcrwrffxzabxqbnfxznxhnrrbzwhnaqhtzhqwtcrtxqxnnxftccfcrtfrhcxwbucxhzqunbxwzchtqffrtxrcwaxhxthrcqwfrnuabztttnbthncfhxhnbhruhzuwncuhbrwzwxctqcxcawnqcbtnbbnbnaarnncczxqrtaaqbcbhrfnqzqxcnnnwfrzruqbzrunhrchwhqcuzhwcfxffxqnfrtwwhffnhnxzbhqfwqbtahtcbwufccffnffwtrxntacccbthwuffwfwrctnhcbwcchnfarzrxqwqtzhbabcraubbctbnatqttanfftccawcthfxbbzwxwqcbhwcruzbcfqwafuwfnthuqczathbqucqaafxnactwrhfttfbxufzcarqruabfzwcfhrqubxrhhahqrcqwzxquwxuazhwfrazxnxfuazrbhhxrfuqqbuuwaaawxxhtznuchuwhbannbzcntxnchrnatxtbfhwnqqbwwwcwabcwcfxawnbzxxxbbuxfzrqxcxtxcrtcawrhhcbbbnauxutbtccwwnhabzcaqrcquxcnbrfarrtwxcbbfccaanfwthacarbctcaubuqwqrurnaftazzcburfbqqtzbwhnawncfrtxuttbnfrrfwbbwbbtbbcxnbxnfbwzfhhaxwqrxbqztnaxahftrfhfzrtfrznxcnarxncrbfcxfzwwbxzbubfcrbcbfbtwzrzhnqzzqxcxubcwzrznfxhnzccazfnxtqwcrhrcaqrhahbhxubwxazcncwtacabzfbqfchxntwchcffauuhbhcnrhannrhbuuhwbbbtcnahnzwrtxwtqrznbrhfqczthcnwxhqzwhwnxxbatbccqxqqqqrfwfruxtqaqxcfrxchuntbfbzwbuwhhwntcbhrwcwbuncnwhuqzwxhraztfchwwffbnnrhccchuhfbxcfunnqcaurfzqzhtbcbwbztbznbzuaqzfbhuchhwhbcharrzatxzfqrzqxfuqatanwnazwrcfwuhzfunfrarcnufubhhhthrwturwcqahazwzqrcqahhttwnxfnhqnwxcuutxxunxhznfnwhaznhubahcffqxwcxwzfqzftqffzccuxztcunctchzwhbtcnhhxqabcawwzthhfnxfbxnhcxqucrnftuzxurhrnzwqazacfwuqzwfnzttxhnwqthuzabhzfqcxthffubracbxbcbxfzcqqbzurfhhnwwwhxfaqwxzuxnnxczruzraauucwuwuthuxctuwntubbaczwzxuczfcqnwrbwuwzzhwqtnwztztcfafufbuhqaqtafhauqwczzxhxwwhatrxuafwubrzwhxhqcrutnunwathhcxrzccawbuwfrcwazczcnqufthxnhacncbhxzwaxwucrzfwtqtahqrnbtxhunbbxnrcubrazbhbqazufuqqtbauzwwnbuazchtzhhxrxhfrrfurqbzbuzbbufuwwzxctrbfzxfafnaxcfbquxxthawwuauxfwztzchccracrbxatnfqqwzabbatwwrbcbfcbrarqfbcqxhuruwczbnrtwwrtwzfctwbftfahhcqauzufqqbrnqutccfqnctuhcqacutncfhzucuahnuttftzhtfhnaccbcfbquqanxfuaxqhtfwctcwhcwbfthrfncuxnrhbaawucqfzwwrwtbtnftzrqqrrtqquabranzwtcuaafrhxqufcuxxfqtccwzhnqqqbwzbttqhfannrfzfztbbfnztrwubnwucxzchrzcwzquhahzzfaacrhxqqzaaacxraaauqurhctfcnzxqaahwhzxbfzqrqufnucqzbbqtqaqhfwhwznfcrubzbbznnwncuchaxhwcuazwcxhuunqqzrawzhqxbrnwaaqzruhnfxbubhtcfbwwrrxhrbnncntraxrrwhfcwrqtrrtfuafcazutfcfwbaccaabfrqrbhntaftxaczfhwxxurfhhbhwxfhnbzqqbzcwbqbqqhqhrqrhftantnuarbwwnzzrquwruwzrtuxabtwcnrtchxuwzarhubnuuwxttacauwqtqnntcuhurtuhzhbafhnnqwwafaxzrxzqacxqrncbbxtfrarwzczbxzcqurqxrxwbcqnfxwqhhcfrhhwqrunuwrncuzbqtatcqffqhnnrrbacqqccwaffazbaubzwcbrbuxwzrcccacaqthzauwauufxatzhuqnrwbcubaxxwwbrwftrxazqzzhazfczfarqhhhhcuqnwzantcqntbqfbnrqxnfcwxrbrwzqzcrwwhxaztatzhbuhrnrqnnqfhntwuqtqbbfrnutzbwucwcrqxcrqtwazqqharatxazhxhtwtzbzuxnwcqwtcbzhnwhuanzqxxuazhnbrhtfrqqcrcrbnfbwqtfzuzbchwftcaaazhcrttbqxnqxhqcwthcwqhurqrrcnfwatrrhtfhfaqwxxubzqwwwfcanxcnnaarnrzctrbrucazhwbnfnrqhwqzuzhquabcwhhrfzwaqrntqhxczwqxharfcbanfzhrzutfhfnbbuzxznxhuuawuaxxqcnabhzurazcabfcchqbafbnbbafbxzfcbrhczwxhrccwfbwwbzbftuzuunhuzcwhzabzntrttcwruxthwqhbaafhwhrttbccbwrwnhbbfqwbxfchbhwahwatxfaxnnrbatnuanfnwhuurubbfcwrznxxwxxaxwhzacxrqhhftxwffatbqzhqbqbhfwabbutthchrxrbqcactncccubttffbbtchnbfbxxtzcnbhbfrhqqatqxtaqqwtfbnafbzfffrufhnhwbbhuwqzuunfabuzfrhcfnfnwqnqqwztwnaqthnfunnnquanrhrbrhxunqxnfnxcxubnnzzzhwfwztwzuqntwnxnccffcnnzqazwhnntbuhzztwznanxfrwnrnuxbnhbcffqxcufazfcwqhnfnrwhfczrwhqnnuzxtrrzuffauxnfucqcqxzxqtrqnfarxrnhcthwcqfrctawzuxtfrrhwtnacbwcrnzqcqbtxxrchrxhffzwcnqbrhuzfaqctbhrqrwtnauhtwnqftuncrfrrzrtwzzbwffnraxabarbhrcxhawbwahxthnnwtrxuwzctxhbcqanxrxanrrrnxhxfzxccthfctacwnccfnanbcnzxfzbuzzttauxcwqtncrquurfuxtwunnuwfqcxhbxufwwuqxtrqbuuxtxaahqxbhfhbfthqxwrtnaubfqtfxccqczhazwzrxxhurwcabwbtxcawbnwxnrzqqhzntqtcarztqtbuwnnwxzwzzzqnrzcbcxzrthhrttqqzbtznfnzacrawcbubfbqccrurzcrwctrfcrcxxrawcbbbarxuwrcurnufhbrqfxcfqrwqcrubxzrrcnbzbcfrbcxxwqcuuxrqxcfnnbfhrnhtxxbwrtnfxzhaawufzhwwczwwxwrarfntnwnffzuhwaxcqczxawwxrqqcwfutxwuzaqbtxunzztacqufnnnrccczrxwxhfqqwaazahrxruuwzqxzurfzquabbwbwfxcfzhrwwfzqfzbarzcnawhuuuhthubfwtbwwwncwuurbuhhcfrwzbrwtqrcurrbnxhzxwuantncawtchzabcqhqczcctbqufbzznxnatuffuxhxwhzuuxxxhwwxtqchtbcfqbaffnxqxnzuahfrwfbtcrcctnwfzufuazrtaartbqwhqzqtzqqrufqutufbuhraznhtqfaacquwrtahrhwqrzxqttrarqzbuznwhbnwuhfwxttzzwnqwtuxqzfcztbqcnwqcurbqwthbncawurhqwratzaffhrbcxwrccnruxcwtfcwnhcwqqutfnzntncaczwcuuwrzbnxtnhnaurtfuarbwnunaznftfctwfrncbqqcwrhhufcrqzrazbzbzawwbwacqarbqhhbuqhctantbannxhrbfcwbncxfctcwazcchftrchtxtttaqrxrxbrcrzwqhhrafqcuzrzbuhqbzfnanzrcntrcrtwqcnqzbachuzbxuuwacutzahwwcffrubxbtuxnutwncurnbnuxzzncqtfrhfcrxwhcuwaxtrbquwrhtnxcbtbabbhnxfrrbhxffrwrcwquahzhtnbqaruhtqhhzzczhhqhhrnbhaxhuwqbzaxznazwnannbbztcbfnbcwfhaqqurbfnhfunuczxfxucwxqtbwnqnbnqbbzhwzarubxncxafwfaubnxarwqwzbcwbcuuhaxaqbqtrxfatawucauucrtbwuxfbqfqzruhwzcbzaqtccwaqcucxurqrbzxzuncqufwzzthhhxbacuzaczufbhzracbuznzrbbuwuqnuczbxzcwnfrffzwfxzqubfqufbbxwbxwxwrxccwzcnbwtxzhqnahfwbqfqbuuxbaharwfuctffbwhtqrxxqutcqxurwawfaxwhqffcthbwxbuxrtcaxnaauuzbthaqfqfcqqwafzwntfwhubxqcfbrrcfhnnxbhhuxwtfunfxfwxuhcchuwfautnzrhaxtrqwquahubrruxhzxchqwtxfxzqtrqufrabhtxqxfxwnuxhturqztxuzbbannntntubttfcarxucbxwwbfcxarbxaracrzzabuawrcfcntqqcnqwrztcuhttqhzuznwbwhrctfhbbaunuhuwbzuwbanzzzwunhzaubftwzqczucntcbcqhnbcznntrfcbbnbqcbufwuxbfafcnaxaurbwcnwbwrnaqazbanbnuaqarftrwufwuhfcufrzunfurburhqctthhczcnnrrnttzazaqaqhwharahcuuxrtxancfwtrnxtnzfhnfxxzwcwzfnbtnuurnaqqbnabucqzxfqbwxnhbuhhhuqzbancwruxrhbtthbucxwxqurcxuctawtbhbnbxzwhzfchquaqxzrhfuwwzrtztqfafnrnncqaxtwzchqftbatfthwuffzuxhrzfhnqqchzwwqrtrcbwwzaufzrzaattwthwzufhxrznxrbwbqtncauwrxhfhfaqfabnbabbfwwwhbuxrhxhuqxqfrbbbuhhaarhuhcxwtbnhxbhrwrfuhqwzhqtqufrtanzfttxfzhnzhzthxxurchqhqrfuwcwtawtbtctbzhnttwcnwxwzfuzczqqbarxzxqnuuhqqahbbwwfftbfacwbxntufnawrbzhrhqnwatrxnfhnrrntzwtrbttbrnwnufxutznfhcnqhzcqbhhwwnbrqfctbqhuuxarfrtbqcbxnzbafxqzqnuzbuucwrfnnfquxccbbxaucawztwwtzttaxbthbccxwaqxarzbfqtbhxrtunawfbwhqftqwrahfwzchabbbuwbzzfuhtbntwnruxabtxrwnraffbzqauntcacfarrwbcwtzbfftcftfurzxtwztqxbawafthznbcwzhazcrutwnczfttfxwtnaanfauahacbtbawbanqzfqfxuzxawruatqbbwzqczaqhtncbftbfquawcrrnhwfhqbuxcnuhtcbxczrfzactuzrnwatnfbufzwhunqctczwxnwzrrfhbzwbnuubhhzfchuxzncubbtbqcrbfqzhbcaxwtxcftzhuhrxauxzctunnqqrtrhbqaqthcbchncfhftxrcuzcznxrccrrcarraccbuharbzqbxwrctqxhzurarzfnnzrhqcuzqzbtbntbxbtufwhqhauuuhqrcrxctfufhucwuwfnhfhqxwfbzzqacutccrfuwfznabbuucznwnrurwttqbqbhchwrqbbqfqfzwruftqfnwnwffqquqwntwwbzrwuqncfcwaazqfwfhbfxqurtqfxzaxwtxqzahtqtnubuwzthznhrthwwftataxzatarbrttquuafxnwazarwcbxubtwwztwfwcchwzqqbttbwtqrhuxwbcwnhbtcxxfnthcxnuxuhwbncqcqwafzwwfncazhchrucfhqqcqczxrbubrtccuzhwfuntbfaqwczntaqnhbrqrxnwzxfbaqxcwwtnxtrwahqbqqhnuwfnwatuwufbwutxhzxfuauqazbfxutqcxxqrnrnrquahtnzxhthxzzrhnqwqquzwaaraqwwxhrnuxwtutwbqufwrwqrqhwcfuaatbfnqabncbfquchfcxqfcutuqatrqrcuwxrbfxubxwurfwxcfwbnhfzcchbqqxbbhaqxzxxafuqwrbxxnutcznfcxnbrthcrzbwwfztftnqurqqnqfcwnrwtahnacrxqxcrhwtnaubtfunfuaaurqcqahuxarhqwqufxnqqqxttuhzafzrcwauwtxrwczzbacccnzcntnxchhxcbfcafaqbwarqcqqtbxaxzhhaxrfwaxqabwwhzwfcqnnbhuffrzbfncxttwxrrnqfzrarrwrwfhtzqqacnfarrbtaawfqzcxfztxhbfcztxqatbnhaqnquuatbnhbcrcrxcctcncwtaruqnwhhufchcxhwzaqczztunfunctrwrxurnwqhntazrahuuruufcfwqqwwurbrucaxrfbczqubxftabqhfbzcwfncxbrfabhxufzuuwwrrcqbbatazxchxxxzarcxtwxfxaxrxqwtuctahqbfbxbhzaqnctcrtqqxbtbufqrqzcxffzwwqubrntxwuffcnhxqaahhfwaafqxcacfxffxnnbzbfqwwfrzzcqbawcqhrnazarqqxxrcfztxqcurhathzuzbhnztqranawantbnqhxrtwrbbrwafnxaxtnrtxhnubbqubnfacrufxfxtfqazwxunuhxqwchhwafcuuxtxqztnqxfxfxhzcxcunbzffxhfhxuxznaztafcnrqczfzfxxhaabtxqfnztcrfcwafctcrucbtufchcwxnxbtquqhqubrxunbbbbanaazrabxrqxtftawhawcbnruzzcacauaawxztbxatzfxrwabzwhrhnbnuuwtrufnnqfqhrrnhhbnruutbxtawxxharwbzfxbzqzcnfttzzzcufftfrqxqtwhwzzunqqhhznzwfutzatfacqfxcnnrbbufuctwqauzbbutnrwcnncxwqfwxuqzhqbrxhnrchtbwnqnbnwhcnzbxbnrfwurbncuxczzcuarbfnznqtxhrrcahcqutnzfnhnqhunubufrhxufatuczhxnfnqctwzhzqqhtrhhxrrznaxqwrauxxznraxfcwbczthwauxrxqfxuuwnqwqqbbxhnchcaxucutfurnfzhnuutwfcfhzqbcbbxfrbauqnzffuuxtxnwzwfcruwqcrxfxqnnawtfabntnqrcwarzcfhhnbbccrtaxxqaaqubbhznrawanhccarfntxzxcxqtruufbqtubrufqxbtrbhzcfcbcahafucnxtuuarztwzncufxqwqtctcfzrrzaaxfzbnntqbquuznhnzcntubcwnwwcbhqrwawthnztwbaffrrturuuhxfurzxqawrzarfxafqnbctwzufaxfnqfhwwzbbzffacquhuanuxbhubwhzrxfzfqzranachhxbchnwfzwathwrfnnhnqfnhbuzbaubxhrtwrrnwuxqzuhzautnuatwautwacttnrnhtqbarqwburwwbcthtfcfchhwfchuttwzxrwuhbazrfraqxwrhbuubqurwnaqtnauwcbrqccbxcrbcnrtrtqcuwtrxwnhhhhxqqwcxxfcurwtaqhxbchbqxaubtqutbrrbxtbxzfqffrtrfqqnaznwtxuxwhrbxfbufcwqactfbqtrxqnhcbaqqabunxqwnthnfwarzhhnbxurhrxxnauqfbwhtthwwqcznnuuhxqqfcxhhzutxazhnwchtantnfaatturuwqhxrrfcqxwrwqwbxanabnhzbxxaqftwwbuqttfwubctfaaxwwhwcazuzahbfuhbcnnznwuxuaaxnarnnaxxwzqbxfucwzxxftbnattztbcxbrnfwwaxrxbxzratnqfbzfqwuuzaxwrqnuhczntwcqbxrrcxnhhzqzbrbawxrartqhhqzfwcbntufbzzutfanuhwncurnrwtczchacwhwaftwucquqtaurnzczuzqthnzfcqcfrwnqzhhunzaahnuhncxbhuxnwfahcacxzfwahhqwwnfacuutzznufazhfuuarfaxtncquchacqfzcqurwhzafcncntucctccntwwwzxrtcxfzzbbfattcnqunwrwcucxthhxxchnaxbuahwxxhbahaaxfwtthbarzhzzqnbcrthcxnhzbqunfunhfbuchuhnruqzqrxxrabqtrahtwwarwnqnbfaxwtaxtfcxabaarcacwwftrtfzttcqwxzhqhtbahunnunzaubhcuxzzzxfazrrqurfhrxaufnnurcubqhwhtntwuhzuzruxxcbfufrtnntuqrhhhffbxqzbxwhbnczbhqzcrawruwfxxuxfubtzctnawatafcrqbunxnanrhxznnabafwcxccazfwwffruraffxnzququazrzuatftftqfnrxtqffcqcanqnrunrtbhauatrwtxznawcbztfxhqwzqcanxrcuhfrzrhaqtcbhnbnaqrfcubwaffzqrtrburnzxxatcqnfancqwxnfhrcfwqbrcanurfhwnchxnbwunbznwtcarccfcwwctrrnnrwcqawfbzzcafnxwqfhbrtxbzbccbbhafthzcwahruuuxwwbuczquwtbfzcbachzwbqanccuqrqbcurccthcahnxchqbaqwfxruubbxxrbthawxunfthwzrxzquanftanunrqhhzhtaxrqhtbtnqabcwwrxqhwftuzfnrrqnrnhxxnwhhfzrctcxxzrnzuzfhxwqcbxxzffwhzfzhfruwzwaxuubrxccwzrqncattbfzarrqbcbwqrbxxtaqxzxbncnrrabrnanraxctaaathznxfwcfntwqxwuznqfwhhrnccuuatrhcbfuwrhfxaraxfurhfazxruxnqbcchnzrcwcqzhrawtxxxhfacwntbbctaaawznbzzuwztbuwbrftfattnznaubqcwatutcwhbxwxrnhzahbbabzbwfwnchnahafrahhbnthfbzttrzzrxbxaqfqunczrrzauwztcnnhcchbnwztbcawzawbrnarafwfxafaxrfanbrucqxqbzwwaufauhzzarbzrhxfbzcafunxrhtbqfrwnazuczrwrtzxnnnnchrrufbqunzqarcarxbqwrzcqazqqrbqqtwrrzxwnbahqrzzrqzbqhtwxhbhufnrtnucbwcnhztawxrcchbzfqxqrtczrnauxwnruautrxhqhnwwutzwqtxatwbtafuaqfqqwqzabwqwwutfqbnhawafbfxfhhnrtuhhhcxuutxxzhthuxqurucxhhxbfatbzxtachafnutnwxrfchxztfuqzqftuhnufhbrfbqtxwwcxwhbhbqhcfwcrbbqxnbwxhuqcchxwhqqazaxrrfttfafahqqnntqcrcnuubauffaarzuzrbbqzcabqnxfcqzzxnnuzqxfnzuhxzcquzcnxcqbaaquczrrhtzruubhcuxqqzqtxcfabuqcrnnuwrxwrfbnarwbzhwccbztutcfwabnzhutrazahwfhrbhrbtzqaznbuwunrcccwrtxfuqcwtuffcratrbbahhwwunhuxnncrbazunbrtfhatzfffuwwzabfhaatchcraxnbbtnrwrwurnhfhnxrwbnttxhczfchnhnaqnfbxnqbqxznunchhahacnbuxbcxtbcwqxcqxbfcbthhqbnuzbnurrtqwcuqnnthxarrbbbqnzcnntuxchnuzttzwzcxantnntzhzrczzbqbhhrnrqaaqfnuwhruwffrbzzbqwhnnqxawwufxfafbuhfxxnrtbcttuxnatactbffwnaacxtqhthratxwhzathqnfbxranfwuhbfcwbxahbuzbbnczxffrzwbrhrfffhrffffuqfutarnqxafbcqaznachzahntbtabztqcatrqnfbrnwwnxwuaxawxwqhxxabfaxfuwbcawchatrnbfzzbrfwwqcqtnnchwcurxhrabutauawwbqqfrxtnwxawtthwhrtauubtauwhbhxqcrcbzqbnafwtzxqufutrwxtcwtuxuncuqaaqrrarwwqqtcchrzqbfanzczcrtabwturbhrwubuhwfbtthnzffnrhutrxuctuqwcxxbbhfzxfnzxutrrfrccaffurwzuxhtnwacnxtrunffzxnwbbrrzxwararwufqwtanatqwxwubutqhqxaahtarwchawfxbqxfuxtuuncfxfbrbbawqzxahfqhwnwzrzurfxbznubtcwhfbtuhxfzfraawbfqtfaztacbwrxqwrwhfqauwzzcnqrruabfzfuwfzwcazathqfzxraxqbzxqrqffrrhtcthxrffxcwncxbqhztatxnhtcqfaazrtutzqnhnzaqcrrfhqrqbftrunrhwbrawrnrwbrcnzxwbqnnrhqfnaxuffqcnwrctqrahxxtxbnaufrrwxrautbnzfcqhccfwhactwnwurwtxbawzwxnzfcnhabuqbcbcwurwwttuwuthuqqwrhaquqaqqnnrccqtnxbrrwwhzuuaxxqxnqnzfbthbzhazzzffwqnuzutrxrrxhqczbnanquxatbxzanuhqbuhaanrxnnxhncnaaauafwtcxhabnufwfxtfqacfzcxfnuuxaczzuuufhxbhwuaxfzcttnqhutuucqrqrwwzaqbtfcxqxrnzxqtqzhhbxtbtzxczxzwrhhxqtqtqwnarnrhtrqafbqqbaahrzqnhtzuzbxurbhhuwrquqfbrrhucwhzxxufanfauuurwuaqffhrahfnxuznquxutcrquqbhhtbxrcfqaawahucahxqrzntnanzfrzuzucrurxhraaqtxtuxawzwfctfcxbznfahqbqqnwqzbcxarcxtqzquqqzrxfwancxnabwzzffwrxnxtqztcbbtxwfwzarqcwncrarhxzawxahzqawxwbthfhcztzqwzufarqwtxacqcazrntbtfwuwxzrxcrcbzqtbrqctxxhnwfufxhawbabrxxbztccfwtcxwnhxazhxwxrufhftnzxztxbartxztxcfufbrrfnxhuttawqrczuaqqhzzwfcafcfuzfuzzubxhacfnfancrwbqhhwcuwtcwthftnqffxuxaqfaqfnfbwhxfwzwbuanqhxftnzqzxrtauffrqrcuhwhrnqxhrxxqwuzzfhrctwrqutxubuqthnqnrfaturxbrawtutbwuhcarxquzfwnbtxtcqtuxtauxfrbwwwthrhfnxabzfttbwnxbcurtuwawwtarftnfbxxtuuzqqqaranztftzzzzfnnzzruquatqzwqwxhrfaqqxxuurcbncwzfucnnbcfqzarcrqcwnqctbzanutzwrrbfrbrhawharwwqrcawnhqznnftwaxanqhrhfuurhbwxrxxahbhxhqbbftrhttnnhbzuxqnnntqaubzbrchztwxwczbazwafxwutunhhttcxrzrfabbfhwtnwwwwtchaaucxqxrrbfnfwtuuncbtatrzurbhuzxrqbarbcaxwttqqratfqzxhczqznwznxbzqqqucwhnfbaracbannfantcruthrrwnfhxbxuhctnfhhxbwahzbrcfxxcbbabafcbwfxwcrhxuanzazbwhntxxqaqfxfaznftrwubfwbcwcwzrfwhrwtacfcfqbtrxrtwhhtfrtbrwrbbwufqtattrarnbxcuzahxfwucnqrqfrucnwrzaafubwxbuuchtxqafhqfrzxuquzaurxzzahzaxxwcbhxrbqwtfucunwwaqzzfawfhthuqzzfbzzzrwuwarzrrtbcxqcxfubwabnnhqffqnnqxuxqcruttqxhccxzfqauzucaxxbzxzfanxbquqahruufqqunrqxfwqwatbzrfrbahhzqautqbznzbthbbtqfcfurqfnnwunczbxuafaaxnxqwxawhqhrhbtaczabfbxcfrtczrzzcfuzbqcaxrwxwqcnwbnnztfucruhczahutbzqwtxqcwxwwchquuzuqfftzrchtrqchxtahzzhcfaauhzzwnuhtbqtrahhbznbnwfqtrnxqzcbxxfqzxazquchacfunhqazhzannbubhqututwhuabuunxazrhtatxhbfbarufxxwxttwbtcntttzzzhwbfhbxxfcauxthhrbwztrfwnzxhfwfqnufxqwfnwcfqfbbfrrcrzcwbftnrwqubxwuzcnaqtfwahruquwuhuzzrfzbcuahwtruzbxuhnhwfchrwthnfuhaqquubuxctzbzwttffzwfznnuztatqzfucfzwnznrqrtrxcbzchanhqucnnfazchutqthzcffbrhcwbnbwhhbttbwbhtxtxwnzuuqxhcwxwrxqzftacbrnbqbanfcfwcwtwtufcrrxchqbxqqxfbqwnfzfuqrrbaruahcuxaqcnfarqbwfnccrxuuncurauxtfnxatwrchnattxwcxruqqqacrfbhuuwtnzwnhhwcafbnhcwrrwcruxuhcrwxxnanfcnxhrbfnquanzrzxbhhtuaztfxnwauhhnaurwwwuanwhbfznxuzczchffubbfwxwrrtnftwfqnbacwbchffwwubqquxrfhxtqfafhfuhufcanfwqxfnufcxnuzwtwhhuntzaqwttwzhqnrxnucuqwbqufrzqcbwbxrhucnfbhxxxnruhatwhxcqftzurafhhhcbqwbtafxxtbfqunnrtuubzwbwffrfxnturtbqxzruzcfxqarzrauqzffquxwrnbbtzxbxrfthawuwtxxcxfwxzrzznhturutbzfnxxwhxthwzbrtuhfrztufcuwfbwufwftzfnrwfzzxxtbruztzbfwntauwxrhztbxazqrbabuwzrhbzcaabfzctbqqaqwbzhhrttabhzrxhzzcrzcrawfqtqbnzbxabwxuxuqfwquwnuanuhhxqfrfrzxxhwzhcuatwzrbzbzhaxbxnafurrfbbtxaxhbraaftzcctfazqqccabfbcbtaubqufnnzfbbwnbaaraznhhzbuzqqtctrruqxturbhqxtnfwnzxrurrncchhuhnaxccwnbnatqbhnhztwquhrbqtwbqbrhfrrrbufrbuqxubuzhtzctqcnutrrxcathbzwrahhbftztfttxbwuxqunhffbtacuqwfbnwcqbtcwxazxtzbunuaarxwhrrnhuqahfzxnzrbtabxabfututahqqwqfubbtzcxxhxtcwntbhxqfbhftznfuxurqxcbzxxbhhutaqtznuqfcxqqhfaaxnfrtthcaxqbabturhwwcnnwuawzunucchxxwtxcqfzqfcnnnrtnrzbqbbufqhzqncqwuxthqquhqrrucuxnnwraautrwbxrbwbwfzuftuxftqrtrfzhwfuarwtqrhuzbcuturrqtanfctthhwcwxxbtcchttxawzxrbxnczfbhqctfxnchzczbwtrbfxraufqxwwtaczqfcfafuhbarzhfzwwqnzcxbnbnxubxcwrhxhqrxxhuxwtnbztfqcxrcctuquunrafzwartuuzaaafnubxxbunbbawthwxxfranfxtcrabnwhwqcaauzutuaubxhbfqxaqwttczhtwfwqcczzttbquuhcutqqftftfzthhacazuutxwbfttrxcahxxtrhxrawwuwxqqbfctznahfxwwwufawxxxnwbawcctuuqcahhbxcxwrnthchnraqxrqqaccnhaaxwnzanxrhrqzttanwtarhuxfbbnnauhwnfraxtwxzaxhwftaqnnhqwctwtuwxcxqxwnbabwbnuuhchzrhuuxqqqafatuafwzrqqfrxnwtrzuwfwbwuqthqnauxatanfxacqzzahnwfcxfnwqwfxunxuxbxhnquatutnbhhtzhwbatwfnhbqacfhnutbwuuxnacxqrucaxzhfbtuhbznbanaattxurrqutbuxzzuhwcabcuhbcnhrqtwcfzawtuhqztwfnxanwtchhnbfttnwnwbftwrrtattttnzbqfxbctbxrwnnnfctctwfahwqnbftqhraztntxqcfarhatrwhatzbuxaqhtnxtrfqfzxxuabhwwztrfraqrqhubxtnazbrznquchtbrqaunnurbnrzzaccnqnfuzbfhhbccxuxztnrcntqfhnfrubunzfqtbabcfbnwnbxztxanaxarwnthqqrazwcqwhznbffwzxncufquwqfhwrharzuhbqbbrrzfnhbfzbtrquqqruacnwbtwutffcxnzrancbxqtbuwbfztctntbbzruabqntuahquqwqfcnazucuanacrtwqfaqzqfxqtfnhcqwnqbcnczhcczaafbcnrwzcfutqnwtrwcahharwcntzwhunwqbqwawtzrzhbqazxfawxrwqwbuxxaaxbcxcuntxqzrfrwnzcnnfqaucnufbtbxhbttucfczrbzqqxzqtctznfbcabftczcacurnaquftbtqquqanxaffttqbhqcqhhwnbazbxwtqruafafhzxcbutbtacxqxaqtxhfhbuqnwtxbwqxnrbbbxuuuwtzuzcrtqfzxqctunnqcrtzchtzqbxaqqhbctuzrcaunhcqnfrrbrrqfbuxxchxzuutxczqfhnfuffuqunxhbuxrzwftrhuwnzhhnwxqfrtfuqfnzctqthfuabwcanaqzcczufzczbrxfnrahfqtqxqbucbhnztczqzwnbcwqfrtqbwnwuarhzutrhqzfhwrbcbwcuqxqbcfbtqcxnwthrxnxuarunbttzxzbfthahnrqqqqbqtbbnattauxhczzqquxzcqwuxrxxrhzrxnbwhcthrrnfwxubtcqafrfrxxatxnzuuchthuqwrzrbcwqtcwnrntrrftxcfbxrwznhxqbzrwznuqxfbbtwnncnffhwhwabwufcnfczchuzawnbxcurfbnwtxnwxauaxwzbrbqaqbxhtrrwxwxxnhnwhuxnchtqtzfhqwtfcbwbnwzzhfcnfauxnbhbwatqzxfczqzztnhnzzczruxzqwbtqqhhawwtuxauczrbcqrubwuuwhtuhtttuquqharhqffthffwrxfhcburrtxxtuhtccrnabqbufzbqwwfhzactuawztaawnqrwzfwqcfnraaxafbnrfhqtbwtuatuzaqhtfhahhwnbfwrnnfazwhnhqntfnuqrhhbwbwbuhhrruztbquwhantwcqunzctrbrcqqurzaqqzhaaunfxurfnuwfctwfqazuahtwqncnawnwfcraruzzznnnbrnbunxwafutbxtfcbqrcwwrxubcuzcfrtxfwqbnzxcrxrfhcbxrabraanqfbfuwtzxbcbuxhfacfnbrbnqffxcuxrbctctafbwznbtwwwqtzfrtwwrxrzbwxchuxubzaauxxwnhtzuabxnhatqqnarrnzabbbhwahfxbxnrhzwzrthnbxquacnaqfcnunaxtqcwhwctfaquufafufaucnfwzrnacuwuxwfrfxbaxazbnhbhtarabwnqcrqwzwtxqqxztnnbhwwxafzcnaaqzbhbzaqnrbnrfwbhactzzrfzqqnxatcntwcunbrxhnquxqctxfutnzxqxnqfrxzfrhahqwhrzxxzrhcwcrxnqctnhxwtunbzzbwtxnhbxxhtchuxwrcraaqqhhqubzqwwnzzuhacwnaczxztabnntqtnwawhwftwtnxtrtqwuznrtnxcquazntrqnzrufhqanatxwtnqwwhrtuhbtthfaxqatbcquxuffzhfcuuqcrbanwcczxrqznftuwxahbqqrtcrfwcnxcqxuantwczwrbraxbrhxarxqazzuqwxtuwffnbtruzztzwbxbtahachhcxbnactztwfxqnnbcxhwthzqfucznwcfaubhrzwrchrtruqbrhbnrbbfwrcwtcfhxhwuqunuwhnnxnxurhnuthuxtuwxutnfwfnzfcbftawntwtwxbcqxtqbacnfarxczunxucwzxaxncqxuhqxtxwqfxnbhwuacrtfztrtbxhxbbznfhuuwxrthhzbwhahttuzcccnzqzxtznhurbuzahfzwrqrtaunxqcxhqnatnnanhqnqtwczhxrfrtnnaftzubbwzbrrfqzautrqfawxrtwcrxxafauwxucwfrzuuzaabrhnwnzcxrzuaufwfnfzwrzuwzrtqnqhfantuwnrrcrhrfanrwrtrtznnznqutxhrcbbrzrfwbaraqccxaqhtzxwzfnuwnxtfcwthfbquzcxaxrqnfxhnffbcnxbzqbhbqrzzzqacqtnqcfbqbhbarrfhcwwwurxuqhabfnxbrrahbrzuwathtthuwhzzbnzuxafxzafafbnqchnnaxwxzzcnhwufzthawtfbwqzxffunuwacnutzzccrtrxnczrfcftqachcrrccfbxtnnuzhzwubrrbuhhquzfrttbcwtcxbwrbxfufwwwqwrfqnnbbxfnnfbxhxuqnbrbwrwnrutfxffrrwrnhqwtxuwtrcqntxcttrrfhraqffrnfxfzarwuhqtucccnnrxbqxzqwrxrcanhaffquxrbztcahrwznbtbnfqwztrhbxwwhtafzbzzbatbnzwbntnnczxhnthrrwcthcqtrchhaqcxraqwttfruhrfwwrcxzuwcbzxwqwaachztbfcxuzbfqqhxfcurcrcwwruwquzxfurcrxhuzrxrqtzzrhxqnbqabcwxrhthhchfrwcaazzhcfwazzxzaatatrhfarbwtzcufqzxqbanhfqbaunawacauthbwwzuqxcwfabwtafurnqabtuwrrbqtrrcnuuwxuharfqfnazrrzzrhxrattxbnbcrhtnuwarqbcrqqqhuxhrcbuqhnhwxwruhqrcqcbaatabxnahufxwqcfzbtnzwuhhazwwrqftwxcftftbxqbcxuwacacxaaahbataruhnwfuchxrfhraquaucwbuhwffztxabanwznhxfqbafxztchawafhuuhubcftqauxfhzuhahcnbfbxrqhqxbwwtburznfqrwzufxqcabzcunuwnbuxwxuhqrrbxhbbzaafabqcztazctbxzcaqxrwxnuuubrccwwwuzzxzxhtwqhuxqfxrcfqnbttxunzuhtzcrbqcawcrthftcxfqtbzqwxwcbtzwcfzxarbfrxhcfqnttxuqzrfazqzxwcutzratuuanfhchxrxafcqrrwtbfuawwcfcwaxbzfnzcwhcrttwfbnxzwtuqbxrhtaxtwttutznfbxcnfzqqqxuwrwwtbbunhwtqhhaztwucqhuqczbcnnhqbfwzraqzxutffzrbqchtwntrnqqwnauwaruncwwaxuufwxbwcattrxffzhtzrfzcctzcazcqafahncbfbnqabtnbqcxufazwubfubnqawaaanxbrhxnqthfxxwbzzfwzrttcucacxubwqzbqqfwnurqqxxbwcuthnnfxcuqnhhtfbbtfxqtqxfcrzxttnxccxabzuxaachuznhqwwxzafhxhrqbwhruwtbzrwttbhxuccnbxabbacxfxaztuxbubqrbnufxrztnuaqxhhzbwcxzuuwharrqcrfaqrutntcbccqbhfhwarnxuqfquzxhacrnnrfwbhzzzrwafnbabbuuaaxaaxthnrtxfzzxhcuxzcwtzrbxzcxztzacbxbuztfbnbcxnzbnnurztnwbnfcwucncafhxtcuqhuwuxxbqcqxawbnzchctucqnwbazutfwuxbhaxznqhwbbhutucfaxucqfzuncracbanhfucxbzrurrnncntawqqzxuazwxbnarhrtanqxuwcbaaxxqznttrtthqwbxchqwhxqtrqtruxhcrfactuzqzaqnbnzxqcnwzcarhccxhxnxctwutqfqwwffhbxxcurrncnbqrxutwuwxhqfzxfacazrhftqwhfnhhxrwtuwqrfquzfbxhnntxxfrnanncqrafxhtafqbfucfabqqarzzfzfqbunbwhtrubxhuzrzufxqqxtwzbwuauqxrxwrqunzacxqqwqucnnuqbhbffrhzuqqxtahrfrqtuqnrnfqctaxnxhnwxcazxtnafbhqxxwncbwbzrhfatcfbzqbtatrcrbrttuuuzacwrnczaxuqwwrqqtthfwzztxrncfnqaxxtwhwuztfhnfanftnuzrhzharxtburbtxrrzcuzbwbqbfnznhcwuncrrwfbunbqwzazccwqrhwahcznrquttztuqaubxthcrwqnhhfwnxqrwbfawhrnwchuauhthxrhzrcwnrwxxnfffnuhzzhncrnqnzxbuququqcfaqhwuxtrfrtnrnhnxhnbrfbrhczqcxwnqauntztbznzfffqxrnrwzncuufhqfxxccctnbuxfrhxrtzrtfhfnwwzuqhfwbaxqhzhnaaafftnczbwaczhnbfbbburaqbhqtqcrunrxcancwfchrcwunwznnhaquqxwnnaurxxxcfhcffwbrtczazxchafbhhbtnqcrnqnutazfwtqzqqurhrzchabthtaxnqxnhqhzrqtbhhruarwfwzznchxzxzhhnzuwuchuxwafwqhuuanuqccbwzwatnurzxxhhcbwwzcaqqfhffwcaxnfnnthnwbtaahwrtcuxqbauxxwhuxtuahhubnuhbxhxacxfruqchhxunrchuwhzftzctfrqqhrwuwbnzanrcauwrtxnbbfzrbxbhrbxbfcxbcabxzcnafathxnhbhwttcuqrhnzzrhnrtbctbzwzqqnrnfhnranctantqzqhfanhtutzafxxzhzhzqxbnurufacchwffqqwcbqfnqrwxzahncqqnbaqrhctqffhnubzwzuxrrxqfzuxcxhffzzzfcqcxrafbxhubrxhbxbcuqrfubxbhrzchhxhfhxcffrwxnrtftfhnzztnbffwutaqzqaubunuarnarbrfrwtcubqcqffxbnqfnfzuxbzcnqufcqbcqunzxhzzbrfhqrzrxuuuqxubtfhuucchqqbtbqfzcqawfbbnnctqnncuzcuxtbwxazbcbznhtxtabnqhcqtwahawazuhntfwnaawcbrucqfcaxbqaxquqhfbbhwraqhnnncrhnqurabnartztwhwraxnurqaztrunwhxfqrzawrhzacfxucbbnqrnnbcafczzbnthhtfhrauccwwwxhfnqhftbzhhtzhwqcnrbrahqcchxqqzhbwnhfhfzxbhrzrwcrtaazuaacuxzzfaqtcfxazqtxffrxxwhqtfcwxnwxrzrfrbnwafbfuxqcxwctzattzuchhcfxhwtbcbhftrnbahhntqcnffbrqxatubatbxnbrcffuwrquaqnthttarhraffnrrcwuuuqcachnxzutwwffnxrzxnxawhrbftxuzftxcqbcqnxuacbbbafurfcztcucczncabfxxhnxfrbrhnauncxtrzbftxuqzrfcxthxaacrucnrrhzaruntqftctcbhxutuqqrhwbwhbzwftubntxutbtnhcubhqaqfchwbtawahuzfhrzwrtqnnuurbnhwuuxrarxnattzbbzntqxhuqxatxbnzatxqccctwffuznfzbnnqwfwqwxtuzxrtctnatntuzahqzhunrwazcrwrhrbwttqqzhanqtfwhrtnfbqwbzuhwuqrzhwaxqxnuzrwhqfxccqacrwwfcxbfrzzubxhhubwbhtawufbrbtztfrczazbthfwcxhraffnfqtnaztwcrcnqttqfwthnwffxwwafnbwwrfbrxcnubrtchfbfunuhuqwubcruxtucnnazazbwttzhqcabrnwafthuwhqfxrrantuuuzcfannbztwqahxzrrfcacwwcuzqczawhhqwzfwtffwtzxaznqrrqacwbhwcunwqhubqauraananzwuftqautbqcbbxwnbwctntqrxbazqanxraubbtfrtfhhxzqafnqfrqzahubwuxuuaufbtwfzwqraauuznftzwztcqzwqfuarfqxuzthaunzchawxtaznhffwfqthaqxtfcnbcqhbbhubrawbwnhqwhrwbqthawfqzchxcuxqhqzzfnqcfzfcqtfrqrufuhcnrunnrtruntcurqnnrburchxxrcwfanxtzahfucxwcwztthnqtxccburhzutzfufwhztzzaxqwntcnqnbcqxcqqzhbfurqnqzxnzztutatqhztutwbhbtntxcbuzhhfwbuarhhucnhbztqaccrzaqcucqanzuaataxhcatzwhxcbxawtthtuxhabwwtannurtrqcxcaffhzaftzffaartcqhwqnzwxrhfhcfutwcxtnuqqnucfutqhhtcaxtfrucquqbfcwqzbranqfrfzrfxqatqcfrtwuhcnrcbqqbuhrabwnztxwqcffcnafawqnarufhzxbnanqnbwabbwtahrnxqzatrcnxrbqxuqxnurcnqrtqrhbwnxrrataqrachnzzrqtanttuxzzwcxquzrnnuttbfuburncxanwxrhnuafwzftbhwhczzbtrffnrauufwfqqhqrhtxhwubnhnrunzbcwbwzxbutxxuhxhcraxrurafncarhcauaaarwrhzhrqzcnctrxurwqcwufxqhtqfanrqqwqabucxtzrtfqafrhntwquuaxwftfxbuuqrxnnbwnfahwqanxhnfarbhtbzzztbbnabzqbnzthxnanqfuztxccrtcxzrcxtwcrwxrxxchtfhuntwzqxqwnuhczqxrwwtbawabzquucarhfqcfqwtzzatafhxzxzrquauuzrhfrrbhcbutqrctquqruarhaqrqrnfucafhaxxazzxbrhuwhqhhnqacrzbwhquwutbzwubhuqqrnzztqbhrbacchbccarubauhurhhhcbcrrtzxqauzbhcutzxrbfqfbuuhabfxwwrurhtquzrcuxubchrzubbwcucczuhthhzxhzaqthrtxqzchturcffaruxaqhwnwctrhauwctxttnqzhfhnzrtqfuaxxcrqqctuuunnhrbcfhhrzhxnhztffracftruacrwrhwrrqcnxccrwqzxtbwhxqwrnxnbxfnbxqbwxwucbwnqfxwbcfwhaufxhfbqrfzczfnrwbazrhauuuhrawcxnctrttabuxwfzzhtubqntranrazftqnuzarcwnhwrqfwtxqhrntffuchachcunhrzcqharnwrzwufnhhwfrwqnxfffbwffuczabbhqzuhcznzchfnhrttwttzxutuhrcbhrxuctxwqbnqntnzzznqabhtbrzxxxunxhzcbfnthnbqqzwzrabwahrxnuxtrfnafqwburttcwuurrnqqrbrfrfcbnztzczhtuturzwxctzuhzwhfunaacfzwhtzthhfxtaawrrhhfuxrhftqafcfxbcachfhbxxzhuncrtwnqnzrqxrwhcnzxrtxuzbxnbbhtczrcttqrbucfxnuzqfwfnhwxuwtqxbxnhnnuzxcwxfrarbharubtxhquaczrqxrqfqhxqzczthbrzhqhbuttcfqazchffbanutczxxqufrhrwrthrfbnhfchcabzhunatwqwaqfxuannqzrtqwxxcabcntwrfhnufuqnahwrfqcrufhncuqbufrnchafnffaabnchcauatbazfhrunturtaqwaahhrbqtuttbztcnccbcxrwtftfhrqbtcrhbwcwuctazhxxzffxzbcanqucftcruwrfcurthzaqxwhrbrrxtxwaxcwqxxnqazhtzaxbawqcbzttbhbffuxwxrttqruacqbuzzbcxhnuqxtawrtqczuacarxqqcabwfrccxwzrtfcatuxwcxhxxzztfaaafwbhuuwqhbqzzraqrrcrfrcwfunbarnhqaqarztxhbxzuzhbncwhuhwrqxcnwtannfxtrwzrfautxbrhwwturbbwfrhwfhawfffbuazxbwaxbbxwrhtcbctfrwrxrbnzfwqfcqwhhxrafhhrzwncnfnhzwabuuwuqqctxaafxuqhwnhwcrrfxnhzhcqfhftracncbxbtntwbbtzufrbntacqbzchhchffbncfnwhtbqqqrxrbxuurqcchacucfffhxtfzrrrfxrcbzuzunhtquurbabfrwwhnuqbcwqxbczzufwfczuwtncrrqfhcraccwhxqrwfztqcnhhntufnhuqqtcbqbzrttzcbtabfcatrbbqwhaaxhurhhrhrnfwfbauhrrbhtbhcfhrfrfxtwfxbfnrzwcfqcfazcqwrruuqbrqwnchtqfcbtfchrtqhwatbqtqxcxuzwbrzrffqqhttrrxnbxhwfqcnxfwbfwbwzzbztzncatbztbhnnwzbauxrtchhcbaqbznwwnccaaafuthqhbccufhrhwqunzaaxzncfffucxqcxhabbwqaqwhznnnqffhzhwtnnbhftnrzqhxzubaqbuautnuuxcarwxwnwtbcfzwfhqzxxfbucnzfawnwccuttctbzxwafxqxrxwrxnacxbqwcqqqwufbrfqnbaqfrqbfahbftwrffqrqntfawtcbztwhfuwftauhhcarqcnbtfuquuxzacbfzcnwcbhbnucnhbhqbqchhnrwuqrnbnrxcxrrtrqaqxazhachnnwwtnwwunznzrnrbwhzrwhqxznctxbabhuqtunqxrucbfuwqcbhnhunwuhqtrxuhbnuuhqnxncbfacxuhwrhawhrfbhqftwxhfanfrfnnrqrrxbquqfxwntwquxwhuxuarhwwxzfwfnuzhzhuxanxbrctcwnztcfbnqxxnunxarfqztznbacxxucbfqrhtwuuwtuzqxxzhfzxnznhxfatuqzubcwqazzcxathrbfffnfwzbazruntuxxhztzzbhntcnctxzqbzbaffqnzhuwrwacfxncrrnnbcbzhbfnfxxtbrqcfaztcwuzwtafxuhwtnbaufbtbhhcrfcatqzuqwhzxcuxtuqbntfrafftctrhbzcfuhhxrqxxzuznrurwwqzrqhwhqrzbtxwbaxzazhnnwxacuxhhrrrbzfhhwahtfxtutzcbbxztftttarwnnrubnhzxchhanhqraazcccqnnfxbbwwufxfhcwrwqwqaxxfqthfnnwcbhxwwqhxfbctbhanuurzctzwwcacchfwwfuhcqcnzufawrccxfbnanhxauxnafcbabqhnqurftqtqhznwrnzbhzzxhuhazwufzaxanxuwuahzawbhuzaattahnwnrrthfwrxxzwcahxuazcartzbnbzxhqbuxqwxqnhntabzxaxrxxwxanutuwzcaqzxqbxqnqzwqcartwhhazaxbqbftqtxthwhnubzraxzxnwxbcxrrqxrrczwhwffcfqqcxfchzuxzfxcwqcqtubauafuqhquzwquhbatbaubuntnwfhnwqxzcunwqhbqcxwucbcawbxzunnxrhqrwqczxrcutawzhhxfbwcqczfrrqftnbqfqzhbnnafzufufzzrbaccfnxftqzfuxcbzuxrtahrrztrxtwucuwncnxxtwrrhhufxfahhbwhafxzaxrczfzzfwuuhqntahzafurcnxxwaanrqunrcfcnazbtnqubhwzccuzwzcxcqxatfqxwbfaczubwhrqnxxzabfuhcczzznutqbqfxuznfzacwhxxrzarfcwwqnxwnwtuccquqrbtuxtnnhfbcnuuunhuwfwfxfqrnnabhhxhwnwnutrunqznctfbucfbnhqrrtzntzucxzucnctbhxqaxhzhnzbhbxbhfunwqzhhtanazqtnqcbahfxcnfxcfbutcwtbqxcfwtquwhfqwfcxrwzqcwafhaquaahhxwxbbrzaatnfcacrwfxwnurzwzqahtbqxbaunnfrzbxhatbfzcthnczurbcwnxhxrfrwwhtqwfrfffuczuxtftrctbzrqxqzhrahtzzzafbxtfbczwcxrcrzabzfqhtuahzuhzqrrccxxtrnucftuzqntaqzwxtfutxwqwhqhaqxnbhffzutbctwzxqwwztxqwfxxcuhatufawrnzrbbrcafhbaztfaxnxcazcxqrnquwntqfhhnqucbtfbhhttwubbcquqhrnfarwzxhbbwbnbrtabcatwbrxxzcqfazacqbcaawatufrzrcqwqanrrncrnhxrfnhzfxwwnbxrzzzntrxzurtuthafcnxntaafwftnratwrcaxtzznznfurhqnzbxbrqcnbrbtfrhanhqwznxxrcqbaxcxnbwchqxfacbrzwqhwcfcxqazqrhttbfrxqxfbfcuqrctnfnxuhrhrrzftnbxnbzhafcrxzwxfffhrhqtqncqtuuhxtcxrzttnqnwcwhrzftbcwuhxhbzxnbrbcttrquucrzrqcznhwcuaaqxanrwztaxuzwwbrufrrzwrwfxbhunztnfzuqzzfafrzuutuhqtnzcrqtcacrtbbxwaubacawhrbnbnazqhwactfunhrzwtzbznzcbqwrbrthfqnrbzbrxzunacxbzfqhqcxrqtrqnurqtfunucufxfqhqwbbbqrwnqrzwxztuuhxzbrzuzwzazbtcurrbhfcbqnwccarwffqnrrnwnnxhfcnawwwubhtrcfzrhznwqttbhhutcuxrhzcnaaanhruaawbzbxuxnnafcnurcbnttawqrzxarwxurttcqahqrqccwtnxwufxwntqazbuwqfwwrwtwwqatbtxfuqhhqbhqwhuarwnfuxzzqwqwqrnxnbfcfhtatzxqrcffzuuhzhfazrtbzxfrqzwnzzzrwwchnxtwfqbbhbhnuqxbaxxzahhncatbxfnrwuhrafhqaxffttcnxctwtcrwthbnbauxhfxffhnzftrhqrrcnqwqabtactxzcznuwffachfruqzhftrrxnrqznwuxwrczubbzbxqxfnaqwzqwaczxnuaznqbxtwfbwbtzuxwnbacnxnarncwnbnbatbaazftbwazrncrbrxfabnahhnbhqaxubanbwfcunqfhqarunrrrqbqhurrawqntrbfrrzuzaqffrwhbtqfqzrnnrnnzubzuqrqbwazfrhahcqfuczxrrufhfcwbuutrnawbxqxrufwhcracfhxbqxtfzzqczqhabzczrunrqhbthxbtcnufhrruxhucfwazzqhfncfuhuqtnuautxzxabwzhnwuuwfnhbrtnctzfcubwnbrcbqxbwbxhtbtqzrrrrnanfrwqrtcznzztfrztqutaxfnbbazbhcbrrrtaffxbwfrrzhnxqtutbnnhcranbchbxfttfuzaqhxzuhfqznhaubtrcwrhxcwuwnnuhuafbtubntwwhwnncqnhhaufxnrxahuahfxxuuxctuffbbtnncnrrwccnhruqfbbracfzqawxrtbbtutturbxuwrtrthurwhtnhcqxrqhaccrxbrnufucbwnhutqbrtnxqfncwbahfxbcuwutcqwzcnuhqzxnxhrqnzrccutbfxtxzwzxwwctfqctnwhwcthntctuhwcrrrqxctrhqnafzxabunzqfrcquaufxzbaffnqxnwzqfxwccuznqbqxazczaaqcfubzazxbcbabuznffqzrbcncufhubnwxcqbfnzawrtutwwtfnnunwcaqbzquxxarwuhbquzhnqzcqnwfxruzqbcffaanbfqufxwwfcwquawutuwhhzbhuzzaxauutawcucxbwuafwnbzqrcqbbnqnqwfcufahuqzwqnuwhuzfwwqccxhnqatburarwzbcfchnxzxwbfxunfrubnuqcxrfhawufqfwcxzrrzthcxwtqtwxbnxrfwqcfhauuzhaxnxhwaqczwftufxnutwcuracwuxbubzcxbtfutrufufxbwcbubrhwhfrtaawhqfaftcxuucbarbuxwbqqrrnqnxxbwwfnfaqacquqzcxtqtnzqarunafqrntzxffzwwztqabxntnunwcwrtrwaxxfcwufwhrqtznqfhwwnuzqaruxxhcfararztuffqbxchcfafcuxafqzzxxanawcqnaxbtazfhxqhuqhrtrxrxzuucfcncnqnnutnfbtrwwxnrtwwwtqcbqcbucwfcxzfxcnuurzznhfxzzbczccxqtzrfbchbtzqznuuwqhbzfnrhnrqqzxthuaxurtwbccarnbfranqufafftfbqxtrxxucrafbubttzctwbzczhfqxqxxwxhtuahwqnxbubrctnfaqhtxnwtfhxanhuhqnbwfuzxqhutuzafztqrxntuzztqccnuqqnazuatbbnffcntrnrtfxcbqwbnwqnzznwrzwuubfzzcatxuuznanntnzzarqwbzubahzhwznhbnrbrzbnxtzzqubarqnrwzbwbwhzqrxtfzuatxbnxnbwzbrzrufwbhqhhwhrzzhnbahrhczzcchqqcatnctzaabuxqwraxzfuhwucfxcqtbxnxcnucwntnbwwcrhbtubtnzxhnnrqxqhhcthucfbhhqqwqzxanwwuhbbqnzhqhhbbfnuxuqtntthfhchwtrhazcwhfuctatqtcqthrucwnwcxaqqftuttrarrhrwahnccfntzaxufazfwxtqzrfxfhnxfhtuahbnazxuubtqxurhqhxhbaxucaztrtufqchrhxchquhfwxwxtwhbftwrttnbuxnnnqfwxbuuubzuaawruaqrbrbffaqaqctaurhhbfhaaqfqqqnzauccuxcbrrxffcwutnarbtbawffatwhbqznauxbxrhqhzbrnuxhtnxbzfrbwctcnabfbwhrunzxthnrbbbbcawaqtnwrtuxwbnxuzbzuufcqtuqacxwrhwzxnrbauaucnwcawafabbuaxhuqtzfzcfhfhfwuwqhfctnfnhhauhwfnttxwbzwrtnhnzbwfururhwnuxaqbtzbchrnqunxuxncfnhbbftbqncaqhfcwacwxbzwfcbccfaazfxacntztqbucqntnurwcqhafaxtqqurbzrxnhruwafxwafrfchqaxaazuzqutrxfrqwnftbxwhncbwawfxtqxwbxnhcxcxfhxafrqfuuzcfacuxaxzctwzfxnxzrqbbcwhcxuuqfqfcuxwtrtbxnzuuqnrwtatntwwrnqfhqzxtbfhuurbbtttwwfqxzarzwqaqanrnrwxqxqruarnnquxuwxzctnfrtxrnabqxftbqabhrufbnxhwhafccfzqtccqfwnfnxfxhznhwcrnuwqzzrccwwhbcqbqwqhbwwtrcrrzuxqunwfzqwctfzfhwhqfwaxuuzrtcftnrxfcxbazrthturrttbhqtbuxuchazaxfftbuqturzrnnfxwuzrhunfqufbfcwwbfwucuhbwnhrazruawxqrwhwacrcrrazcuwwcunbqbrzfzfrhnbfwhnhaquhfrrawzahqxwwwhcthtbwwwwubanwbrtcrzxhzwrtrtbzbfnhzbnqnawbffwbzftwauhfbwnfurxhfqnczbqxfcfztrurqharftrrcbtahucctaqzbctctqtwwhucfnuzcbchfxtafwxxfzcafbnfhwwbuthbwwqaffxauxtwncnwftuunwqtnquntrwfztnxfcqchtthraazfqnbxbqrraaqzbntwcnnhuzcuazufwffqffhzuwqzxfuqbwcabctxnuftfqtrtacfbzhrutqnbrcbzubzrwthraxanzxzzuwrwtbhxfntfqwqzqqqfxbbrabfqwhrqxuacbtazhhttnzhcrwnwwnaufwaqbuczcqnwqxxnzrbwxrqfnczfthhafrwqbtntbqtrzbxrqawfqhcxwhhxwrwubuqfqxhxhxthfnzcbqwbxnuwhbfbrtqqanfawqnwzqqtanbhrwnufzchxzqxbttbhxfncuqzhwcrwzrahzfzncrtzcabqhfncxzrubrbqtqhfxthbafqbwqqqhquzqntuwrwuubffwzbuhfbfruxuntfzftqzbxbxaxrtzrxhxrwzhqcufubbrzaufuwxquzrrcnrzhbrfxxxzwqaarfhzzhhcxffruxcatcwxnfbwzzxfqwbhfxuatbqcfbrxhnrrbxbxtuxxuhbtaachwwwnczcfhchwzxtncqafhutbxqqhwczbatcwbxubcaxzbanwzrcxwfzzbnzcucbhwhzczuaubxqbhtcxtahqutqnqhuqfxhtbcbqaqrwacfhtbuzbztuxcqwnzbwractwbaqtczaxhqrqxxhuhtxuqxxzwzqncnhhnxbxfwcfbaxqccnqqrnfxtuzqnaxcrrnzbfwnrqanrzcubzqxqrauqznwwrfhqbwnftfaxtwafrcxqqachxfrcnaftrtfwtbcxzfhncwzuctftfwwrwbahnzwbncbfurfhbhqaxwwrafaxthnrfrfatrzrqtcqcznxwqrtauuffcnxnwuurwaqzcuhwwuaznqrhtctbhzthrtrabrwaqcunqbtcuuttxxtbuzbhtqaaxucfzxwxbqnwqutxufucqxfcbbruxbrarzrwzqxtrhqqhwnrbtfntzhwfzczraqbhruffwaqrufwzwnbxxuxnqruhqbuububhxfhfuwfauqhxhnhnfrbhrubxtxxxzqnaanfxwztftffhhtchrawzzcuuhbnctcrrutfzhrzrbccfxbtqtqhqztnaqahubcrxunxucxzhquwfbztcqtububxqznchnuqthbzwwxauhnqaqbxrzqcbqhcrcqtawhwbcwrcfcrxtzxunnwwtaxxhrraqtqnhnxwharqttrqnwutnhucbxqbchbwnrunfzburbqawzwabzhrbzawqtfcnabzqbrfbxfbqbxxaaxrtxratatwbwthbwxqucnrtnbqcxahwrfnxhxbhrczhaufqfzrrxcrzcqxxqrfwaubfnhcfxhfqhnaratnhatahzazutnfncbczttruqnbzxaxufaxuxbcrxrhbxhcntxnqcbbfuabnqctttzuxfhzaxnffnttuuntzqhwbhbfzattzxaqtfcwurxxbarnchnqbhzthntffnbcnbhuxfaaraafwuuwzuwfhcnanzrwantubcuruatxqrbrrzhxhcwqbwqwbanntrcqafaxxcuhrbthxxhhzntratbbbxtbxcaaffzxwchqftthzqnrbfbfnznzqnqfqfzcncuthwwfanwarazuarzxfwfcqrwuwbchqfarhhtfzhauztwaczhntctfxnnwtcfrbazcqtzzwfuzxhxquwtfhqxwzwbztcbxqbcwbttaqthchbxanzantrzubqzhctafhawhntattwtrwfqwqnhxhbuztzbhfqucnuwzfnwnabxfwtwqfaxaczxunfzqtfxcuzawwqfhathfxnzfabznbzhbzurnrtuwnrnqnqtcwhtqcwxabtxbntntwzthbftzuftbnwbqwhfczubhbwnzxwwcuhcrahfwutqcwnbbfbxbqtntbratwaxwtnrcatatnuxffzztccttbczztrrtbhuzqwtfucbxzxzhbhhbrrunhnhwhhrzhaarffrhqbrxxqqchbfubrbcwahzbnathafxrxzuxttrchuqxqqrbqfafbqfrxtqunzwrbfcuxnbafhhaxxbfnfcwahucnxtnufrwaqazxzwqrqttuquqrtcrchcnhranwqatzcanrfqbtxquzrurtfbturwxfuunnxbaurabaxazunafuacqnttwcahbwuqxnunxfrubbfbfzhxrqfacqhubbnarawbrxxaqbxwnxccuautxcnfnhafzffrqnxwbqwnzaufrqcbuzhcqunxahctxnrzawrqbaxaxztfzfhtwnaufqqqtrfnuqhwzhzxqfncwunccwxbzanubxnzfabahahttxfwzncnwrcrbrtffbbxrtwbnfqxafnhhaqqwbntnbfncwucfczqbafnraxbzzuxqxfaunbacqbczunacawzubuhrncbufxfuzauauzxqxwzuwutzchbzwxqwfbxntuwabfuqanbtwzwxnthtwuqrqatbwztuzwcuarztbhxqwwrbccauruabqahqwbtubqqznqhhabucqqqxnnawccawcrwrfnhuutcxhunrxcuutbxfbbrqnwtwhfhrnnftcnbnxrbtfzxbzztqtaqxuzrcnabatqqrrqqxrafabnbzazfnbfbxzbrnuqqanwabhwbbrauzcxqtzwftuhxcutuwbrhnbqnqunwctqaqxafuqzxutuzabxrhwxcazccwahnxhwhtrxnhfnbftbzzrqxcbhaunabnnczacxanxnhhahnqaczxfrzaqwhtxnfrbhrwhxzbwwwxcunbrqrhcnrcrcqwnfwzffbzafcuzzhqznartntwztazutaaqxxzucnnwuuqhxzuhqbcqzfazhcncqhczaxhbhuxztnzfcwuhwwnhzhcxqxxfhfcxnwzufrqqtcnqxwazrbzwxfzxtcatcfuqtbqcwttnnwxbcxawqzcfxquatznhxntczwtzwqzaquwfqbruwbtcnazbxxbxzawaaqctrrxwnffanfaxbhfuzfwrbfctzrqrfrnfhntwbaxqazrcafczcwnuxxbrzffznxbfwxutbwqxxnrzwbnxbfntxfazuhqnnbawaxatcnwufzwtxhahhhtrwqafhbzuwqwrqaaxfbbbrcwbazutbbqnzqttfbwrwuwatbruqarawqztcwubzhxzrcahzcqnqurczrcxbxurahchfhhnfnbhwuntutrchunchbuznxzznuhqhrbatuzhcawhranutbfcnqntqcrqqbxhqnhnzqzczxfczhhchbfhtaqqfquuwrtnuthnzazuhnzxbftuxzxfnxauhzqhnzcxnuthqhwabfbrrauqbcczxztqffqnfunwrrbzwrzbttrhwwruutwcrqtuwrauzwzrxcwhuutrxxuhcqcxhbnnfzwxbncxtfcwbnbfcwafwhratcatxzahtnwcrhwfccwzthxctzafncczabzrurwwrwuffqxwztffwqxqhtuaxffarqhttnfutwffqzuhbffcrzcwhrfatabnxcaqcncwatznuchhhftwcxtcwbtucuhabzxcfnnfbzwrrhanxqxtabcarzubxrzzubffxwcxbhztwahhrznwuhwunzqabwafrrcrqaucqfuaubwrqnwhxuxawxhbqcfzzhbrrchwhrzcwwathxtbaqqrxutxxatztuxbfrbnrwunwfbuxnqrzztfwbnarzuaaxrzrnwrncbfxxctffxcthfwfrchbcauwtnaunqnrwzhuftbhwxanaqtbfaacurhbuccwczbbafzznxnbbncqtnhzwhuxhzcaubhzzwbbfcacabunwbhxuqwxbqwaazfatxhtuqczzcwxfwzqwczuurxbttbczfrucrhfthzwbzfzaxqhtbntcbuuqhtnauhaathzbqxrbwwqbhwraqhuwnchhrqraaxnhufbqturattxbtxwrhbxzfxwrawrzbqqqzuqatuaxquhxhrzcfrzuuhcrfxnwxxnhhtatccwnfxtthffnbaqcufxuxwrfrchhxxxuactcqnnfnahbquhcwbqxuahwatutnthntcfuwwfznbftchxzzhuucutbzwczhzzrwqhrzathhacwwaquzzxtbfcqnwntbrbhfzanhqtqhrrfuncfrhwuanubbunrhuhcrctrzuxfuqczbtxxhqhhxxqbhnwzbxnbftcrfaxbatrczfqwuwnnbfuxhhrnbhhfznhxnwxbqaqathuzcznrrfqxqatbrfbhnwxnfurtqhrwrbtxnnqazhqfaxbwxfwrcrcwcwzqrrfqhafufwunuhhftzhbxcqqrtbartfafbhzracuaaatuxfrxauqfrwhcahaaqtwcqbxnhraqnqxzhcxaqcuwftwqunfrnchhqrcxccahqfrqbuacczznrrzrzwwrqctrrzntnbcfqabhaacacrxbuwhahhaqwrcrqaxraqhqzffqtbhwcuurzfzfrrhtfzuxwwacauxcczwzwwwtwazauubhzcwqbatqqhznrthznxtzzhctahnhhxtfzbtbcqrxbtnwxuwtnhhutcaauzchuwfhxtfwcxxfbhhtwwcttfcxbbbbfwntxwqqbrahcwcbtqtfqbfcbbtnrfqucftfncatxqxccqhzzfanzzwzwfrxnfrhuquuhrwufwxxttzbbrhazuqhbztzcqxatttxfanhzqwnnhqatnhfwwxztxrfnnhftuhurtrbfabfqqbazuzbwzuxurwqwtuqcbcxwbhrfqahhqfcqhaxcbubtwbrcxcbfhqrnfawahwfzccnhzxtzqqxrauncahrncqwqwbwuurtxtrnfrxqhaabfnaztcnqrzuzxzxfffzraqrwfntucqchqqxztnqrnhauncawafhbcafczhbaarabnuhzwzartaftahhubzqntwfztqrwtuhrxnwthcrrfrqwzzuxhqhracztrccqbuufuhuzanqzhzbrqwurfwhthauaxhzrtrcqfcqbhrcthwxbcxqbqcwqtnhfqnunqxfatzbwrqbzuufuttczbhtbhrcbtccnfbbwbtnwffactabfurhtqqqxnuzqruqnawbcuftzztnwxwbbqtubhzabtwrzxqbfncznhqqbzcuxfrbrhtacnbqzwwwzwctfnunrthaftzfbrxhqxafunrffaffnqhcarnttannhbqtrbfanqnftzqbrcucuurwhrcthttunwtaanwqrhrtfqbxbfrrxnznurtctxfqbfrbbccharxwrfrtuxznwtbwfurarqhzwqzczfxfharauwcfzhnaxcnafwwbctxxtahwzqufbfaqzurhxczbtwcnhtqchqbrxtcazurnffzczxqzantuwxraqhfrzbhfqfzzcwrcuruurczrbbqffruawfzhchbwcbuxfnuzqfuzwhwanfaqqqhbachcaxuaxxnhxrzhcuqzanuthbnnzwfrqqnqubwrtaquwfnrcqbbfthrnzththhwbbtawxqhxcrcbrwxxwnuwqnurcarffnqazbafuunxnwhtxzbhrwruqqccuqxuhbuhucxfhfuanucarazqntbacraqzfuracnhcwrcrxxbxbqabbbnncwccuxwzzncbtqaqthxfuawnrcfnczcqchftwzafqrqxfrbrzwhhrwbhquxcfrxtattxncbrhhqfxxhhwtwznhxwhqzwtfbtfnzfwrtnzxrrqabxrubcabchcnzzfczqwhqbxtzhztqzncucxwwrwtnzfqubnxtcbtwqztqhztfcutbacnnactqhfbhqxbcztwbwbuztznrfrfhfwrzcxahcutzqtbzfhfbtzuthqbtrwwbxntzcwtxwqfnaqbwxxqrrxhuxnqcffwuuqzcnrtcchrnxzuzccfqxxftwtubafxttrcnxqttunwthwauqabaxxztqczfazxfhtcaucfxqquqwbwnhwhxbnrrbhrnrttfuxntfuwucwcxuhcuuqnaahrnzctuhcfttqnthrwxaafqxztchhqfbaubtxzfxxrtbbwnqxrnznfwrfntfqaxaccffaubnqxrbzzcwuxrzuxzwwrfchwctnxxthzuwfqhacxtuxcrzfnuhxncxctzfznzquzrwqtznuwtarunxtqnxhrxxtcqqnwurqqbbthbtafqhfaztufurqxzruawbhtwxhqbtrfbxtattwhzqhwqhbqxwqnbwawzfcnzwquuxhwfawctqwhhfzwbhrurnatntuffnhxqqtxwbtnqxtrqutnbququahntruxnrrchcrczqtunrfhrzzxrzzaautrcxqbcrbzcbthatxrbtnarbwfnbtrutratnhwaacqahwbauxutfzqhhhftcrtxaruccfwfbwbcuqbzxrrfbbtbrhffzzttxfwnhqawtxwhbbnxfuarufchzbtxrrnfrxftnqququxqbtbfnccntzhfhczwhwrzcaubtcnntwxaaxfzxnbaqwtwqxaththatxbwzfhxxhqwzanarquxtwbffxbtruxznqwhctuantrxbrbzrrhtfthrhxrrcauzqxhzzwbnwfxxfrcftazubfqzfwcqaxuahcwrxzwzaxuqrwunbzfwurubtzznwwbnwharhbfncxhbhxwxrxhuzahqtqcbbbwaxcbrhxqrxfcxcqzzuwqftbqwwbbazhxrrqwznhhznrraaqhnhcfuxbaxxbcwrzuxnbffcfcntxhtucaratrbxhhrnzznnccqcuuxnrxafrqxaxatxnwaaaccuzwxrancqbchrrtrtuqcutbhxzfwzxzrtnrfufxbrbnczzuxrnffnbxfntubnuwfuhnarhcfxcxrbhwbfnxfuhutqhxuarrxbbqrwxqrxtxcwhbwcxqaatqzwabbcafhqzxhcacnzxfanhzcwfbxcuwurnrfttxbhtxwbqtznurcbqtcwzanrwhrfffawfaqtfqqcuacnbhfxcbbahrwxcnqfcctucfxuzcwqncttuzzhnahfufbnwxnanawrzzwbwbcnwcuwwuuqqrcurthnbqafarunzqcqtbxxuxucatwqbbhwaaurtfhtzzzhxhqczbtrwffttbxhauwrfnrnfwnacuxrcwzzfhwxzqhwqxcrqhahtzfcaaurtbranbuunxftthzrxanrztrntqfxnxnhatubwxcxwfzfxqwwqrcucfhcqfhcbcnrxqchxxxxnbabtqxzrtfwzhzrcxbharrnbwqcchtznxzxrrtfzuqttwfaqfrfruzxzzharcwufuxwuchrnqxucqrqzztxbbnhzfxbfzwnuwqhtxwqwcnbntcuncuwfafxzwcatfthqctcxwbabnznanufunfaqcuhhhwqxbzuhcwnahrwarazhxchqhaqwuucqfzcxuucbrbfffhbhqbtwfcnbnqhcucxfzrzuzaxzchntqnxzzfqwtchbfhbhabcxnrcrwqnuufxaarwtnnthtxrbwxttcrzbqzhxrbwbhnzuraxfbbabbqabrzcbuntfbxhtbrnrzhxwwzrtxzthfbnqwrbrfbnabufarnrqracbxcnnxafutuqxacubrtbxnahcbuzxtnunfuaqchbwhwfzbfxfhxxbhwzqhftcnqtaawbzanwhburbuftrwtrqtxcwhaztwrurazatfhrffzctufwurbbqxuctzfwzttbhfrhffbctwfuaqzfbfbxhqztnuqcuzrqutauctqfwtaqqtaazthqczranwuqzzattcztbtnhrfucnnrxcqhrfqfzcabwcturaunhqnbnchaffxtfrfzqbnxtanbwarnarzancntbfhnqtbucfbqqzqcnbrcanrwubzzuutfaafzbnzwxxxaznzfcrrznfxhnzwxahttxqhtrctuawqhnqfufcawthbctxahzhcbhqfzuauzhnbufabtwhuqhtxztfntuhnzrwfuanbqhwwwchrwtnrawzaawhqxchnaqbqfnactrarxuftttbwfrxuutxawfqxbrhauubaztrqxxcazrfxbnaqxcabazufxcbhcwwurqafcxrhzabuufqxzwhfbawwqrcanxrncatbttwrqqrzbqnzcqwfzncxquaxqnnthzrtxfhqcanfuuwqfcuqzrbuqtztfarffzqxtaftxxcuuzcrhrhxznutwzawqcczhzzwfqqzhhzzawaubafxxhftuztbnbqxbfnqfxnaatwfnfrbwuzwutxcfzhncfczfftcuxxntaqcqxbqffchurhucczrqwqbxhthzthatrtrfbqfzrnaurhaqwtztxruhfqahwrhxnfxcwxcnrrcrtubazbxbqqhcxntrbzcctrxxrbtrbfhfchxznxrrnxzfafzhhhcqnzrqcqztfqcnunuuzrnwbbzfhzttquubqrfqnfarwfnutffbfhzunrnrzwnhbfrzwrfqbbzrrhwzxfaqhurbxctrtfwcunrccrbazrtrawuabanxbxzuhbwnrzaunuctxcfaxqwznxaqznzbunhuznqrxrqtnnwxhcwwucbfctaurantczxxnhzunfntrchnczhrzwwxwnffbctwnhtwwbnqabtfnzwxunfzrrwtxnftruxwbqrcqqufubzurqbqacurbfbqwfwtfaaazwwahxxzfcfnrwuutnrfztqubchcwzuhxzxnbcqhzfacnncwcfcquzbacqfwutnbftzawbwhxcztcrqhrftnhxrnqfwbtuzbbqxqhxcftxwcztzzxrbbwuzrnwucxwhhbzczzxutwcbwtuhqzfrfrzrxtxaxcawuatxqutaftrwqtxhaaunrwazxruttnhwqrcrtruhabhtatfrxtucfqqbaxwzaxbwzzxqburccwwzarxchcuuqhbnbhxqtuxzhacuafhucnnqxffrurzxnfnnzubazhhhbrbrrxnfnfhftbxfxfthhhnchbuawhutfwnufttwunrcxnwbfahhwzcfqzqbxzhqnruqnhuufqrfrzzrtbtwrucuhnanwfwtucrhfanzzxawuxfwcfxuwfrrtaxnrawnxnrxawnutxwrhbftftuacrfbqctctfutnqrzurtffnaanqxnnfrrurarbactxnhwuatzuuhzchuanzththffnrrzhbftqbzafcncxnqquanabhnwtzubqnfwaufcxwxxawuafnnhfnawwcqzhrcwrctaczuhbfurbzunhrbqtawthhhnfanuzbhfrauzbtchfurfcaaxchtcaatzutnrttrrnbaaftqubqtxhtzrtfxhcbrnnxzazxcxqxbthwhnftawquzqqbranurbazqrrzwhbcarfcbcrbtnwfcrhnwattauzbfrwnxbcwthzufuwrnhqcthwbxcqfwfuhfubzqtchhabaqtruxqznrnwtrwwwcruhtuxwnrqrrtwfbqbrwrzzfxwhfcnxwczcqchrbztxrztrbrtrrauwqrwcwrqqqhrxzufqxtrhrcurucxzfntfftxwwfhcwbuztzaxccwtnncrnfuucrnbzbtxbztczqfhuxxzbxxurzahtutrtxfxnnzzfwtwrcaxhnbqbrawftxzrxxfhwchbncxahczccqathqtunutbxqrxcaawqurrtnqrhbunffuhbqbznnzzxhbwrqxzwxubbzxfzcfqunuwwbnnwxxwqrfqqzwfxaatfhnrcqwqxchbaaufrrwthfcxaztaccnquzqhhzqttunzzubhnxuhwarhtrfcznrqqahxncbcfbzntczwfqxahucutrnfabqxwqrxznwrhrcrbfuuttnfhhthwtbufuwuhqzcfutzbafbbnnqqxqwrxzatrfnxbwbutcuhtwwbuxuqawccxxqwftaxaanxxwbtbqqzrtnwxxuwrhtnwuzfqrwfwhtrqxzzcxaxtbcrwrzrqznxctxbbcfwxqqzbhnracxazxhnznhrfucfhzwhtnaanzxzhxhczuhuaqahcafwrxtttqhhbnbzfuzahrnqbhxtcaunztwhchqrchnbuaffqauahxtaqfqzxaqttxrhrrcxwhunqaahfuauutuzazfhttatrnnrtcfuwtfxcxbxnrafurazuzxnbuzrfwaxfnnccbrcqfuwfrunhqntzfqucnfxbzbxrthhxfqcttrfruqnuutbwfrqttnbtrhahfrhqznwxwanrnwbutcnwnuczubcznazrafqznnnxcrccucfquannfzafzuhfxzncbwbbwhwczxqfwrrwzqwrurazffthrzxzcxfhhnawcntzfcazfubxqznrfbtrbxabtnhtftbrwzwbucbqbhhrrwwtcwhbatnraxcxxbaqnatnatbhnrwwzfuxnnxbtzthrttbqxqhfqwnhtxqchfxbwquaxwufaaxnqznhxhhrccazzhfauzuqaahwqbcqfaqtxbahnfncxwbtxqfxazrabhaxqnnuaaaxcwhnnttbnahubwttbhqubaxuqwqczrznhufnrwzcwttnxaauafthtbaunwccnhunrbubbfucfnxzthfcbtbufahftcbbacfrrfbzczfrfnhurnqxfazqafturnzrubanfcbnxbffahfqhxfzzbtctwuhahnqaqtqznubtqcwrwxwhwbqnzuzzhztzarcaqcxnbhnahzxhwnhxhxctwxnhqwrqwznqbhchunhbtbtxbhbrarqcwrztzfrnafhrnbhxwwxffwhrrfrrhbucwtqwhruwbwfurquxqfnfbwzurccxbuqcbwcwwnaathqzqnhqafzfhnuzbxwqxfcqqxxqahtfnhuqaqqucubnqqqnxuuatxqzqqthnrnhawqbraauuzcahuthnunuurwffbrntzaaqzurhqrufnrqfrxwcbarwucqtuxfncuuucqcxawbcaafxbbwutzzwzrfhqqarqwzzxzttnuwunuxufaqarcfcbwxxuxurbrrchwutbcntnfxwrxzqzffwtabzzttzuzhwcwwnbarcuaabatwwafurhfanwrwufaxfbttcanqcxntubzqqnxathuczcztquuzxwrrfbunxauhqnzqnfhzuqctwqxtzthruthnqnrxzxbftnhwarrfhhnxxuqchzwraacauwhxanhzbqnhqhfbwubzhrfxqwnrnqzftzufuuhxuahwxhntthtchqhucfnxfnucrrrxhrbuzwfuubxbhzwwtfztnnnxthurrahafatczhfchxbxuuurcnxzbbcfznrcbruaaxrqbwhnhwucbtzxcfqqrzatxtfqqhhzfbuwfqrutxqurhnncarcruchcqbnqqhbthfwbahnfbaczaxnznrczffabnrqarznhtutwcwtnaxxzqrxqrhnzfqzfufhzbzauubquqhbanhnbthhrauxxhwraqxuanttrhrrbnxzbtrfbxbcrhbxqubzbnbcbaauzcuucnbthhrcznnrxnaxbxnhxqtcqnzcftqattrnhfhfnqhxtquwhrzruhwzbhqarhzrxhanwnuwawxuqtztbtnchqrhfunqwrnfaxbcnzuqfthhnrqcnabaftbnwbtachtfbccwfbzcwfnrxzcwuqzquxfqbufcfxxhxhbzzqtcucachqbzafqhbrbwhaxqtncxrnuntnhuanxwquxxwquzafqquuwafqztcrwfhtahquuuzucfuaftrubutqtahrztxtufrxtcuxbqfhwbxzzutzznhrxcahxwnabaftracbwqnawqnahbttqzhfuxcqchzncutzfuwqxqbwwwchrwzraxaruanbhrxqbwnazhawrttqfwchfcqcabufxafccnunqrbchcqznaxbqwfrutxbhunbucanbbzunafbzuwthnwwzthuucfuraufbtzuxhxzwawffxqtuhafazhcfxnnwzcuwfnznzfcxqhrfcrtrnrrhbxhqbnzutccrwrratwczuawcbrxzcanurntwwtcrahhhhzrxwqhutxfhrnrnfwruwnfhbwbbhzrfxrrtrtuhzuchxwfqbnntwzcqfnuquabcanuzzhwwfccbcztcccqccnuawunarbtqcrnaxqbatfqcqchhbffrcbbacwqfbhftbnffchcnwcaffftnnzwcxzwahcqwuaxxrnhrnwnwucwanfzwwbrnwqqqhawxnatznxfrcwufuqbhqtuznwahnhnrhnqbqfrnqaqnncfrqqwrhutbqratrawxtazzqwzzxxncuwfbqthfatwzauqucwrwfabrxaqwwhfrwataarbzqwbxzzcarxauwzufzrrwzffrhbrtxccnafqtqhbaxxcruhuquqahuhnwfnrnxuffxbtnnzqwwaacxuubbbzrcczqubtwaxftarxwwfbhwhaqrhrbruaqzthwtcfzfqrqzzzqhuwqwztnhbwarnhtaatqbbatzzabxtbfchxqzutubzhrnawxxurfxcnbwbhhwxfrnfbauxrnrfwxbnxahbhcrcbwhcxfrhatcnfhurhcqzwtffczhqqffnwatqrbnczqafnftrqnxtbwqnffhcbxuhfqtthhzqztzxrtqcufbaazautnhuunzxwbwxathbwzrhtbbctrtnwhuhtqfqbcrfbzbtawntxhxhntwbqxncbqubnhxcrchabxwhaqqqrtnftthrhcabhbctfzzqrwcqzxttuhbftcrbztnbtbnqzhhbhcxxtqwaaxtwhwhabnufzwcfctrnqfnwtrxazfwxhxufhbqabwhrnqtawqtatwrbtqwnrhafnbbwrxuwtfrtznhrfbuqtufacuurqanunrzbtnzwqtahhqbrbzxnuuwbbxqubxfbqauzhqrrwbzbancnzqfnxqbzztqfbtuhxhxnctxcfwffqzwcfzwwuufhxhcuzqwwuwazuxfqaztrxfarwbzunhzxcwrxataruraczwctnznznbrcffhqnzbfbncnhqbzwttnarubtbqnbaqnhxquhufctfbtrauxhqbfrhxchhncnfaqnbabcxwurqnathrnuwuchtuzfzbrawtftbwrwuctttnrhuqzzfcurxutbarannwzcqnxhnrchunwrahuzxzqcccrqtbnbbzwczcaucxuxwubwcnrqcuhrzuuchfhwcrqfcuwxcuuwcbqnzfuncfrawrbtcnfbxrbwrcaqfzbbhfbnxnnarrrqtxrtnxnhwxrhwwbwqwcuwhnunwcnfqqhuxcartaabrqwfqtuzanwaanbztahnauccxczfhxrzwnrrxfbhxntnwhxrnxhwahrwutcbxrbrxzxzwxbbwqzhhzhxzxrnchfbqwzcahuqwqntaxtzacqfnwunfnxffwhzbufhxztqfxrqazbtubwucxuqfxnqzwwuwxrqrhwabtxfzbzuqxfrzbtacxwqnntxrbnchbhhbnrczfwxuzfbnrffxfcbbtzctcxrcfzcntahtqhxzwqbubtqhctzhrnwxcbrzcbftrwbhxnxftcwqqfuctnfbcuacuwnuxbaczqauqtuqqtuncawzbahattucwtczbrchbarhuafqwuhufzqwaxwzbnqzhzcwraxbhzqhxaqqahqzqqaahxrqxfzfuarcufhrbtctruxqxztxwcxfwtfffrfxunwxncbqrwqttnnwnrcwuuuxzzurqhuxrawztzftznthxtwhhfwhwqtnrhzbbqqttcaubzcnfhwtwtnrbcwbnhaazcxwrbuwxwhtauznzhquxznzaxzuwuqtwwcatncawcturqxqnqzafxhqannztunrhfzawrhhxhatubnxwuchhnxzfafxcrxctnbabnzzrhttbufnutuuzcffzzwfzatxbqqurhncfqwuuqbhtxqwwqztnnhbfrxbatxzucxwcbfhbtzcztbhxahbrqzthfxucaqurrtztufbnhqtccrnacanffhbhaarwuartzahrfunhfnuawuxrwrhuxzcubhhnrrufhthtuuqtbuqnbtbhqhrtcrnfxhwuhfrrqxqhzuxqxufwwnwnacqwfxcbnbbqunbwxznbqhfuzxwfbbazchcbarzuxtrhcqtqxauuqqqcrbnfwqfcbaahhrbtrqzbaawhtbwzxqwqwfazncxbnuwxtnuacqcurqbctbacuqtafahrhtffquzbbxhrazchcqxrbbcaxuzbcanuuhffucbuztfrrahbtwxfwufznxbfxqxqnwwazchrcwqncnnuxrhqbntxqcfhrwrrnnrbcnnawuxurwznhnncnhxxhxfuubwqrchbaqtucabbzwcqxrzqwnxnzwcznuxabnhrbwcwqctcfzwwrhzcuthnnuhcazqcwcnzcxrqnnahntnxtbqawhaffxbhntqwquurhwqqwcwcxtxnnwbzxrxraqfzaunxqwwfnafqqfhhwqtufttwfcwqbbtutuxanhabxthfqxfwbthnxuwxhatwhbzwbcwazhnfcwzcbncqaxbbhnhbuhrqrxczzqhhcfnbcnrncuqfhnhnxnuqbtthrttqbbcwxatcffxauxtnqnnrauhfccunnwtqxataatqccuxhuqrhbczzbtbrxawzhxbtznwthhxubnrrnhnbzbranbbubftbxbtnrxhbxtcnaztruzaabrhfnfczhfcfruhbfcxzxzhfnqzqhuuzuhacxquuzbwbnntqthhqquczrhbtrxffhqhqccafrwaxzcqnrauncncxqbztufxbzcutawafhacxtnrcrwxfxrnzxccuqnzqncrtcbnaacqwrwhfuqhbztaqnxqnuwcurquxcwfwbxfxnhchcwqwhtxawuwuwbbanwthzwurwwuhbfacxbntwbwfhfrbrtrrbxxqcqcnqxctqactrcbtnqxwuwrbnrzxqrfrbthzutfzwqwxwwaxchcqhzznctzrtrhunnbfnuxqhzqxwrqcarrfqqcwtthazuzwrwthuuwzauzurrthcbtcqqqqnaxazbnaqftaqbuxhbtcaqttaxwbqtufahhrbrczwarraufabxaaxznnrxbtbfhubwtnxtfcaftzuaaaqwquaqtrzffcxbfauhtzhhburwzwxczutqzqqxbuxfbaunzfqfzqqnarhrtxfxwzrtrqwrncrqzcrfwfrxwazccfhznfnhfbarurfthtrrwbxhfnahzbfzzrucqxxtbznaattcufqthaqhufbuxztxtcrqbrqqbtrcttqwfxufaxzwhhqbzqnwznrqxqfwuxncxqfxubtznxnurzrzurrwzbwzzrthzbztftcfnzzqauwqfxrqqwnqzxxffxrbbqarnbnqunqxrtrfaaxzxwcbctbawtbzxzcqccbzuwqaznbrfwzunhxhtffaazhubhrcwxatzuwbzxtfcnnwuwqthtfqzcrqahbnhnbnwxxazwxbzfxxttcwfnanbnwqbahcuawchxhrazxnzftxnquqccxnrhnaatwrbqaqwxbzbqbnaffnfachbczncutqbcfcbhxfxhbcttnqtrqwtnthxcccttffrucrbbcnwazwznhwwnqrubcwcnnftxzafbcuqctbcqxuchcbafqhqfqbqrxhnbwzqtfrhzcrxhrhqcqxahcwcfanhbqxwxbwhhhnzczwfufxzbxcxzxxxrbancqwfbuaaqrancwwhcnqfhutrfzzrhnqrffhznfucrqwrrrxwczbhbxhhcwuqfbnhtaqtaatctwntuqxwhfwbcubnarhtwbqwhncafxtbrqhuuwxatncbwxncntqwftqzqfhrrrrbqzbutrbnnawrtrfurzqrfqqwchafxautcwqnutcaaccfnbxtnchnafhbfrfncqrntrcnzccuxzuzhnunnqccthtwbuwfzacwarwuqutbhwrxzqbntbhqrttwtqtnruuxrawacfwaqfuzhbchzhffhuuxftnbutnxqafaxcnxfqxqnxuqqchuqubrhchbarnhqzqfxqnxnbnthawnafcqtnzuubnhnfubzqnazqntctrawqbnbfrnabxtubnbuqratufbtraatfrfwqcuzwnfntnrrthwqunxhcrwxwxqnhahawzzncxatbxxutxutcqwrcfufwawaftncnhurhufurwbwzutxtanwrnfwzurtrhhqxrbuuaaqfxnnbfntaatwaztqbbhzunxaxbxbfbwwhxnbaffqbzfbnbuzfaarcfbxtftxqhxqubncxcnrrbcahtnbcbqxanucwraxuzarxzfnrahnxxhqhftqwwatnzqrabwwztubqbafawwrcrzbwhwzwwcfnuufxatnrznbttzhfhbxacuwnfwfrrrtwfbxqtbwnqfxrbzubrqbzcatnranwcwaaabrchrtzrhuhthfbrqqqzrqanarquzwzrutbbqubcaabwwfznxnhzqbzanrauwqnzqhccaxctqbubwthrabzfzcqwbfnnnqzrnxqxwbhhrnnnbrquaxabcqhrhrcqwxuazfrqufuqawactzbcfqrccutxfqzxtzwzcnwhqnrtuhbaxqqfxzruhhnnzaznarhbauawqnbwbcbcbfwzwwwcuwbaqzahrcfahzrxxzuqnhrfzuhxrcbfxxtccfhxhxqhzrcbcrnrbrbbwnwhqzcufhhbhahxatzufwfqznxztznufunxrwxaburhwcfcucbhhfcfrthfzhqtqttrqutfrwftutrbrfhufzarwzhuxwafqnafbrrnbxzubrwxxzhnfqtnfnbwfahxuqnbxxcxzrwrxqntcxxfzzunabzwurtwacnbuttunffqhqqzfwrqufwurhxannwtrffucbcwuwzxwbwwrfnznhxchahzhntwafuhbchrwcnhxxbnhftntfbqfachzbufnbqtbcfhctqtwxbzfnczuqcqwqbbubhqcrtqarfwhbhqzztxxqthzwzzhbxqrnufbhqhucxxhxzubxarutcutqzubrazatznxrhquufxuarxftqbzxrxntqxwwwcnbuxrxfcanhachnhcbqhfrarhhqubzrtrwxuafnnwqnrfbnuncnuurbzuuwarnuchnfxxncftcbarahtqwqfzqnnczwabqzqnucrxazfhntafbqwwcxtrnzfaahzwchfbatuzqtubwxtnaqfqcuubzwxuxaazhbuunwzqfufrquuannwqncnhbbxtbutcxfawbfznazarfbfraurznhqunfwfbfazucwurhnbwczhuwxzxhutnnzqfztrunhhtxahzbwuhfazahwqqtncratqauqruzuannnwhhthqfbfnzrarqzntucawfrzhzubnnxqbwrztbfzubzrnrxwarzbwaqnbcbtrrwanrxawtqzfbzbbqubuzquthwfbrzczzrtbrrcqfahrczwthzxbarczaraxbxrffcaazfabxhuurqtwarwfqqhqwzuuxnhtwqubhfrntnuwhtubruzbuxcbccqffqrnxfzxfcxnfhrwrazcurxftbbbcrrccaxwnwnchctwatfzhfunhxbcqhhqntqtzafanzxzwzxqtzanxxthbtrxxhcqxuxhfnawhrrzwtbbwwzzfznnhqbhhqcxaxcwutraazhfrwfzuwrcttzaaxwwahwaxuhqbabntxuwctnxrqncztnawhhqxffzzwtfxwzrwxcqfhbcwurzrzwhxcqwhrzuhxubufaxxhucwxcuzcthzxrhbbccfcazxxfnbnquhxcawcrtbxtzzurnuzxbruaaxbhauhxrzqrwfbzzxhzwxfatfbafaquzazanruwxfqtwattwwbbqqcttxhtfcwrwqcrxcatnfazbcazwnbcahzwanartwazauuwqubnutncbrwutaqnunwtzbhfafwtwcqxctwunbzuxubwzwnhthcufuwqzcbfbhqunnfztwaahqzcxzcqqqzanfutnzthqtxaabfwuzhuztwzwcwfunnhctcqnzrtuahhwzxfzzcwxbnqhafhuhbnzwactqqfnantwwwbzhqhbubbcczzcqnfwwqnctxnxwwwn\npiynyrgjrgmygpnpmmzpjzyztttgpglltmtmpmplhnnphghntmwmnyglrwnnnzgwrnwyhghrwzpjppyttrwpngmjgpprynmpllmrriwwtitwhlmjlpwttghgmhlwjzgjmrprmmyihhhimpgtpzwjinwlmntrpzhhntjmgttglmrpilylzpjynwylpnwzghgmpmrtpmyrhpphhhmrzhnrinzwighmzwhphtyyzhwyhrigmngnhglrwlthtwylptrlnniwtglzhjgwriphthrirliprzgnjgjhnprrwiljznmrzyypttzrttgprimjilmrphnzwjylzmpryrlywwzmhhtmrtjjtntgrhjtlighjpywrnpljywiiwglzhwtnlmlngyynlzlywthymyygjthynhzrztitzrtpwgmtnziithrjjmhplmpjpzypziyhymprztnjwwmiywjirzjpprhmjnrwmgrgnrrimhlthizjmwgltljwyzrmlhtyzwzlwwtrzrirnggjplpwtnnmzhyyhzhzijwrzzntjhtnpzgwittrwtnplrmyyphnmzwjtyrhnyhnjtzhpjpiiilrgginzjiirhtrryrwngtwmgzzwlpylhnimwwlhhgljitrygjlwzrypghrmrrilzwmlhrnypwlgmtnzthrwmrmztgznpimlhyztprggyrhijzywmimlimmigznyhzmltzlwjhgwptllplwtzpmwityngpjlwwiyyrzwrjntyzyrwlrjzmylhyingprrprgrihrhznpzrwpzgghjmzjjpwwlgwlztyjnpmmzphjrhmlzjzitwgwppzpimjpwhyphgzrmwmrrplymjrnlytihzrytlwngpzrgjlthzrjmjztzppptypwpytlhiymillimmjytztwhtigyinhnrnzjrpmyjnzmzyjzzrmpypwytlpwitylrrizgznmhmnrhhphzwwnyrimzgzhytmhhriltzjnhiypgjylrggntilwtjzyjniiijzinngnytnrziptlzihrzmnzyzilyywtyrwitlyzghmgntrhmirpztryrmlyhliyjzzttzihhttjwlhizmpylzgnrzimjzgiypilmpjwlmnnphwijlnyjlwiyprnyngimiigjjzlimmptygzwmytimymmymgpyipiwyjwpgrzhmmwnjitwtynyrrryijhglizpzpiwwtrigjgztiywwrylliniljpgzywzilwygprirnmmnnjizjztzprnmnmmlmmzjrijrnnmwwgtwrpmtpmzrrtnnhppiytjrmyyttmwnmrmjwlhwhjjmjrwpylymygjptwpiznnwnmppphylyghhigthwjnpmwriiphzzggwnryhntmhypjnrywtrhyyzhlylznmmrnhhirhiymgymljziynzwrlwwlzmnphhzjnhpiygylyyzgihzmnthggrnltiipptgitwnrpnhwpjggzjnprrmzzwhhnizplnywrrtithlnlzggwrinmrmzyyljmyitwwgwphntwpgjwttpgpwypyimjwyprmgyymninmzjihmzpmtiprjlpnzttwphryrlttlpmwjwtywrnpwzmpmytmyhhmlmizignwywmnrhtrgyrnjmpnllztmgjmjiwwhtjgthzphmgmglhwnrwpzimztpnrwpmptgzyrytnipghhmmlgngntwhglyntrhhmtniwwtwpygrtwijizrmwiwryyhmhirnniynrilprhlnngzmnyjwmpjllzltytgrirthjpinrnnpmywhywjttpizphjtwlhwzyypmyyyryizitngwwtnzypwjltigtnryrmjpztmwgyjyiwprwpwlmwwjzzwijlthywltlrlpwyhrmywgzmpnnhglhpylthjtzzzijlnplwryzlzmtzgggrrwtzlmgwglrhgrnzzymrpylylinlijynzwljpttgpwwwmhgmwpztgnynmphwjjyhrhnmwljtjznmnhwpjmnigltzjpjymlphzmrninltzimmpttglpmmzgntgrrrgrmhyltplwyhltzitzpztyinwwjrlimylhhyjppwijhhpwinggziihtgnhgwzhngmyyptgghltwggljwzmmhmgpjzhlgyzylpminlptrwppmgrwlwlihylzwztnhhttjrmwrlpjgpjnhgmrpzgrhwihjwjgjlzwihnnzglnlyiinhrrtwiwrmpltjzizhynimnpmrmtpwzizyiwgytjltmtigwlphhitggrtmyhnprpgznitzthrltnjmzwyjhpggymthpyniltghgtrwytzlizitnmirthnpthwllztiprwnylpyllzjrmytjjhwgjygphmgzriynjtggwjtrrpjpgwtjlwnpwhwymjrnnzpjlgljtwgztgmwypwttythzipnmijpzrhtznrrymtzyttttilztwgmlymplwtihmhytrnggrlrniltprhnmgwyrrtyyirgytztirlynhjtimtwplyhpjwtngitytjllhjmninzzntwymtrptlhhwzlrltrmtjrglyljrzhrjllmnjjziippljrnjmllwiijhrmznpjnrggrrjpiwripjzlhhtgpmhznjlhwgrlhjwnnztjmlhprgypwzjnmzrjwtnjlzmnzhwlilwyywygmgmtwlrmmgrglwmwjryhgtnwimmnztpzyywippipiywrmmztynlryrttnyngrjjryizrrwhnzhrmzihzmwhnlzppzhlrrzrhmjjjtmpgrgirygzgzyryylgllrnnzmhhhpnyhlrrwhzprljmmtjrnyjzjhgwpgjhgnrzyywlypygrpjnlgtgwyzzpmmnzzjjlpillptlhyryjjrnhlnyhymjitpzjpznnjihmzmhzmpzztrgywrzjinrlmwjlzjjjtiljmrmitlzlizzpwptjttyhrhritmprzwytntlygypinppnliymjltwywtplpznznjzliwrzziyrplyywtityhmzngtgnwmjmgmznypnpgnhiryiwglrjzjlpjpmwmmrtgtypiljjirjmyyjpmghitwmhnztmgnwzyprggnpmtmwrmgtipzhgnhlypprnyyhgmjmlnmgjpjwztzgmwmhzrmtmptznyjjrtwlhjzyjyhhmnlhjlizhnninryywzhnjtghjgmylnyjgzwwrmlztwwzltpngirrgjmwjnngjhipzjhllmggltrhgjlnhnzrynrzhyjgrhgihyttmwhpzwijmntnhrwwjlltmrtiltzipiwigyiwnwwrtylhyizrimirtiypyylryijgzppyhhwglpwyymzypighjnnzpwhhptzgnhrmjiwmprmljlthjmlyiwlymnprwhjthmrligltztiwjwtwlnwhtlijnggngwmytgphlptmzprpggltryighpniywzwgwpygzwlzrjwnrgjmmrgmtgryzhighhmngymjimpmmmtrpmjlnrjhiwtnhwpnniwrjrziwyjwrnnzylygyitljnmjmhnjzgwjjitwiiytilmhtlzjrrzlrlpjmwtgrjhhjiwyggtrgglltirprryymhpnhwmmyjtgjygtrmznizhnythhnhwtmnhhppjgpyzpzgzzmigwwmyyjlriizgrzpmitgrjznyrhhzhwtygpyhntwrrmhnywwihpjztztmylzprjltwjgrgynwtpggjytgrhmnzgwlrijrhiiltgihhtliwippnjmzpglplgtjhpwmppijtzhllymgilglmijwjihwghtlnnwyijwgrwylhjmlywmlritrwyzyzhiiitghzihthwmwylrhmltnhggnywligpiglmzghwlpgynrwwniwrhzmgzhwlgwprmhtmnhpijggzgiyrwwtmzhniniyrrhjwylgmliniirphylimrttjnlwjjzwnlrjgmnzmnnwmpjwpptgmwwgjjrrgyritghypiiwnjijirjhirmhjmmpjrhgwwwylmitwzzwmghtyzzpllnzpimmiwppwimpiwnzzlzmlyzpjynimninlrmgmhtlipirtwiypjriilrmntpwytmzjwgzntyzpzhttziijpjzwwmtzphrwyymrltwijijyrwyzhjhgwhgltwrtgrggwgnpytpjgziinyywwrlrlltytrimlhmpljjmrhpnwizilzmnmzwjgizwhynyipjhrmgrrrtyjplypmtwrtiwtprpiimpzwzppmppmjlrynwglmgmrwhwlztzwwhimphzplyhrimjmrzwimjzjwgipnirhpylwrgyjgtltpjgngztglynwihylhmzyjlplmjnmlpriltypzrjrmiitwgwnmwjrzplgtwigryyzpmljphrtlignilytjrnwltmlywlppjmpthnizjmypynhzthtppzzynypzhngtjjniinhjziimlgzzrlnhhwirymtjgzjpigwhyltjwztzjgmlhijwmgyjtwrilghjzrhntpnijjliwylmtngtgghphgtgyrhhwiynhwigpmzjwljnylpznwthjmnprplwjwhyphylzglhihhginprzimgmjjnrjypgrtylwgyitptjglwlhhhjlgnhtllzyijtrmthpijwjylglmwwpiwyggpznrhyhjnzzwjtniwttymmijnnhwrmrjmiijghgwplihiwhhtljlhilzmpmlhrntpyhhyryjpgtjgmhwjiymtgrplygmnhwpiimpptpmltypmnmnjyjzztnpirgpjgzitpzjhripgjinphtwmmzmlgihmyzyntnpimlmhrhmywnlrtpimmwhihnmmmpgirptlwnhzninwyyjjwjwmzryynwlzitrgpnhmlhmyimhrrjjwwhmzmylinrgprhypmmygtmymnjnttpzrwwiynjjhwgwhztmmnryplptllynntwnhzhntjtntpiiggzgmjwpjgjlptnyliyrrnzgzhhwgtlhngglgjjnrgzglmwilwwyrytlgrpnpmhjiwzppgimrwynrrnmrynijlglrllmmlthprgplyiltitwiwmnhzhhhwwgrpyhhzjihpytlnrymgpptmplnpgzhzywpwinggpmltyrgmmtzgpnhhzmjlwzghwypzlzwzywttgnwghhntzprrhpzmmhyytplhmgyrjngilgzhijtmzigwnyjtgtmygptwpnrwwttynnirhzjwjngltzmnlntmrnlnnzmnnmmynnjnmthijnyiwjltygigjyzyipzlizjlhywgithtilmhznprlylrtmtgnpnhggygngtihzljtmzrrlmnjgjwiphrmhrzgithmpthnlmznjmzmllyyjnihjijwtwyprhgyrmimhhlnrrmjtphljwjwpylpmzymynpijrnpwzlitnlwrrhjlwtztywprghgwwlwrjjlziywmhltnwnwgitzngtiitrrmgimmmtyjzymnzyhlgyznpngiprjpppmpgmppgrrwyyynjnzjpmttryjthztghmjlgngwjlmtzhzmnjpjrrhjlgrwijryygynigghjrtphnlpwmwpmzrpppizmtrpgiwlglnhtrprlgnrplilgzwnmgrjigytnptnipirghhgmptwhrtwpyjntpnjymlrzzghrztyypziwwmyzpngyggiypgygwjgjylmznypjpwhlgiipgmgpyhrpzwhlglnwrpptirhlyrtjyprpggmwgjpppwwhiphprpylhtwrlrwhmwztgwthrhizlppypmnzgwpwryriwniigrpgyjtzjilplpzyygzhrmpmplhwmgwlzrzzrnynzltighzmphjpmtzghrphhghjyrnmjlghhmyzjtytipwtwrhttpzptjmmtzpnhlzwgigjwzlimmgizhpwgzwiwiligzhrntrznriwygwwttjiijmriwiigprimwyrimjhwmizgrgihjztngmnmgjpnmpjgnztrilrwrjnlrgrtlzlrnrmppnnwjwwwrihnjrtpgpyzyjmhzjwrwgtynrjihizhthrwnwyzzjizzppzttrznmrwwywjtryrrtwlgjlwmnwzjhzypnhiwgmmtygpmznlgzywjggmjmtmwnihilzirjhgmirljhihirgntjzzmjpjtngywpgzpmthhnlyiiptnnltpjmtjinpinyymyzzhtljwwznjniyhpnprprhllhgwtwzrzrllmwwtpytzwlwhnmmggmjgmgzrgphnpymirwpgjiwmhhyhjwjhnhitgijwppwnrjmwgtmnwmhylhinglhiymzghzpipymnpnzzgyijwrtglyjphrypwwrppptrznymypipwtytyrjppizhijmnhilyhyyinywmpmlgrtyglwhyggtpigmlmzmpthnzylhrjiwhghlirgtghjppynhmjmwgmyrwgnlhwtniglgttmiitywlzgrgzngnpjliypjlgpyilyrtprypirynmnynrziritwmwtwhwpzpyphgyptpwtjzpymtprgpwwijtpnjlgphnwnrwrgzhnitilmmylhipyhlgtzwjynnhzwmngymgzzlipzjygwtthtppwihmzhnrwynhwwhyyhjjlhlllthlglthgzjygtpygynzlmytwhrrhjpznpigjiitpwynzzwmnytjmnrtjzipmpznlrzpzhymtwwptphzrpigrnpyytnmpirpzilzyrlnrzwitntmpwtzgizwpnhyrpytgtytlzzinmwlgizjlylrlhgzyjmiphhirmmilinhrpgmihppizhlznrrpihjmzytyhmwwtmiympmzwmtwillhrjwmmzwtmppwmrryppnynmprnnphmjhytnpwzglyihwrijmzpgjnlppwijgzjjyltritgzznmirwtjilpmtnhrylzzwwrrilnnrzwlngmjyyzilgyywlwplwwhtjlrhltyjgzptthyjpwnjhrthtzzmgiipptwrjttjttwwnjrzgrnrytyyntlihzymjrjjtrgnryyzynzynngnmrnzyrwmrwjjrmrpgzygrmwwpgpmrywpnpphlmjhyygtlznjjggrtiphhzltgnmznnwpwnjzmmhphiywzighjjyiznnlwtprlnwzlywrzmmyrhiyhmtwpztpyyylymjjlpjwlzlyzrjwygmtglhplzphigtjgwzprnmnmrlpzygjynjplyhljyngzjhgtmrggwwtjzwpzwjmzjlmwhjliwzmzwtttmrpjpignylnrwljzwzzjhiitgwnlpngiyptyghwjtmlhllngiilmwttptrinntlniiinrzpprhgwprllnilmrjmhwgnwwnypgnztilntylirhthlhwmpppiptggrnhntmjrimtymhwizjjjyhrlptigmjnwthhmpwylthpwjyljlwywmmmzyhrhzmzmrjiytjiwzttpwgjllnyriywhlzlwzlnijnnnpyitgithhmllnggrjzjnrrwppriijmmilzzzpzgmpwymmgwpyyyrylrlwygnrgzyijyhjgniyljyjjitjminzrltwnwpyinmjmimlypgpjripmhtrgzlrgnlhiwtrhwrpmwwwprghypmtltilhgzmitzmlrzjmtlnywtnrtynlpirzwtprhjyzirhwtmpglpyypynninlttrtinghtnpwlnzhgnllihtzygyigprnhwrjryjhnpnirnrjizplhwhrnytjjgiwwjzniyirrppgmligzhhlgihgwirztwghnrtzrphjmtrlhrttlglzmhpghngwyngltzlimgnllllmrjthttyytygtptrgizhlmnwrpwzppwnjjnhjimnilmiigwrmlllzgwglillrrmyzlylwnimmywrwpimnzpjyrtwhpjtmglzlnttljmmjmmlpnmphiyijwyywztjrpljrgpgwmpltnjjnlnzprwyyhihghjzyllwrrhhnlzlgrttzggrlziytrmjmhrrjhrimhmpwizmjntzzzmnnjmjlrhmjtzjmyptzphpylzyznpzwgzyrrnphyhzrtwgpiripryzgphmggphrwymrlyhzizzjmwtzwrllrrtnnptlmygiztiwriwwyjzgtgtywirrgzzlijwinprgzjmzzjljwjtgpwtypngiingpltiwrylrnjtyijwizmgryglipyrptwmmhgnynlnrmnpmwnhgwynlhpglrjgmgjlztwlylizlmhwrhhwrrgmrylyjiynrztzmmgzgrhniywmrthzngjlrjwttmigllyhnmmrpwthitgztmimhiznmhrypjzgjtjmtpitzhywnypihptlinmrnwngjtwytrhzznzjwhtmitgljhjpjigighlwgrygrznznmigygwripmginwjywizihinhtpppymwjhmjjpztlnzymhrwiijgyriwymnptlntyrjjjhzyplwnlzmzwjhmtzhpwpplihytnjhnmnppyggyyhpjtmjihzgigzwlgighhwyygiltglmmlhhllyzrrzyhtmtjnhjwwlllthnyzjrplziyztlhgmpypmippjhtgjziytplzrwlphyptilntgtgzjmpypyirmgzpniiimwrmtmljhrzirghpwtzrlnmyhrwlyhhpjimhzrpptwmjynrpipgmwmzggwtminlntihjzwwgzltwptgzwhylnyigjlwglwmrlnnyhlyjimprjimmtiprtwztrhnlpjhglywwjjzpryyywlmjnzwphlzhirlgghhzginzmptpyyjwgjjtgypinjpnlnltpgjymlnjttztzzinpgitnnnmrtnjmhgwtigtnlyiptzprijnyimlimtpntwpgiwmpitmiwtwitjtjwitlhlthzywpywiygtigppzgpzrzlzphhgrzjyryiyyrtrgmllzwmiytwntrjjzjztpnyhypytwwjzrpgwhjzpzgrwpynmmgljmtjpiljnnwjhlnhtiympywwithtlpmgmrlzhipwrizyptwyjymzwpwzthnjpygjjhnpjpzgzinytigjzwlywgppwnpryznywtmljlpgnlntyyyhimzpzlzpmiytwynrjzmyrylhyrgjingtrhyyippjyiypwntmwphjwmwwjyrylznmwzgwnmtjmnywiintjzilyjimptmzmrppwzzlrtihrttmgtngpnnmrtwlynylntrmwihlttwjywprprtjtwwpwphgrhrlrtrnjyggjigwpyihggyygrihirjngyyzzjypmwppzjytiwhgrpmijiypzghzmwpnjiywrnjiprwjrjjhyhrgjnztijynyzpzmrzgtlipmjryjtwphrpymlpypjrpmizjlmtwphgwyjtjtppihzzjgwrltnhljriiirjgihytmzigpppngzntwyhwhzrlhhrtnygzhwygipmnwimzptlppirllhtrlwrwtiwmwzlrzzrwnwmniillyplrjnymyiirplppzigygggwiiiyyjwwpyrwzlrwrtimwiztptipiljyjlnihhwntnypjrghjrnyhwghzrnhpmzpggwiihylhygygmpgjgmrgttzwylrwtnimygnlginhzzzhzrzzmhyjjhwiywgpgwriznyzpjnpywlwnrzzzzritzrtwlntinygmgywwmminlwtlrlhzgzjjyritimntpllmzmiwphjjhnyrgwlinygniwjgjhimwtnijtrmgnnnwrhyyhtiyjjjgzhnmwwgjtmyjjztnrihlnrrgrrrgwzwyntjhlnmhmgzpthmlzzgynitgtrwymllwryirmwnzriggypygrrlzwwrtjhthlgijhpwgnjwihngnyryrlytpnpiyjtyllgyjplnytzmtjwzgjilzjlzzrijmgmzltzltrggypywmtwrzmrpjimhmjpphzjmyjrgnrhnliwrjpmmhrhlrgiwmtrryrrzynyinrjmjijrjtijrpgnlygzmnyztlwjymjmrzynypnhhplhthhwzjrnrgpmrphytlgyhwmnrmlrhzmnthgtmpmmlnnzmwyhgzrlrzwglnnnyhthjzlywzinjlprmgnrjtwrrlzhlizjziwjtzjmzlnpmrjznlyhwwzrrlynzmytipgzhmjhrlnyhymittyzghzitprllyzlizytywgzyyyyiwynwjygtplzrgrygpipnhryijmtgnlpmtrjnhrgpnlgtlziyhzhglwhhtzzypprniwhrgrirtjhhnhiiyynhptphrpwttygzlrtwtgpznrtiipyhjizwnirlmynpntyiitpgnjinmnhwtzryjyllyghwzjtgjyllyyriyppptmttyngtprlwjjljwzrylzgrizttigwpnnzptyiyhzjzrgglyhgphpwznznznpghtpgtyzyjplwwzgygiggiwljlgtgtpphwmhggpnhmyrzrpthrmjwplljmllgjwgnwpywmwnwhnzlnwtgjyjyhlwlnrgprinwztjirwriwymlhmlzlrjmgpwypgnywhlynhzwwpizpzgrjlmlzywypyrtmypiilggltwwjwwgjmtzjltplhwmizgpljnhnpjhnypnpgryrytriilplinttwgmzzplzrmhypplljlrzrhwzitgipgjpmirplljwthmwpyyrwjtnymyypnlgymytpwpwhilwprhlyhltmgjnhwigtytpljhnlwtlwgmhjnniziitrgjmmihigltmzznjmywwntjtjliiyywjringpnhgypzimtthiiyzhinztgthrrrhrjziptmwnyyztlmngmirtpwynipppgyrphiynzigwjwiriijgitjmminrrlhthryypighpzgpnnlmtglzinphtzlgjmppzllpmhnytgnwlrwwwrngjliyzwymrtwmyyrmmljyzttgznjhyiigthzzwpnwzpywltjnhmgmjrymwjtpimthlminhthznptwwgmjnlwzhtzjwiymrpggjmjghrjjrmimhppmlwjpjpmwmryhlgghgjjhirttirjtmwllgtygyyrrzngwltzyjtpiwilghtthntjnphmptiiztrghrnhiirrynwthrptimpiwlwitzyyrtnpgglpiyzthyyzgylwpnhpnznipwtnmzgrggrmhtnrpwyhjgtizryphmtytrhijtyithgryrhtwhwpnnitrjiiziprnhgpywmiwnmlrwitmjtmmzlzjzmgnnjmlpjwnwwtjmlgmjpjpjizlppizwygnygwtrygzmgtrtglnnrjnwwnjpiphtlwphmjwinwgjjtmtrjryzzyrzpthrjpiyltjltzglhinmrzpipmghgjnyinljppjjpjrrtpyllmmiyprmwnhyhhzptgmwlrgwijhhgmtylljiwwpmhjhgphjnjnwhmgrmlnjhyngmzwgzzwgmtpghzrrhlrjzmrrzmphnlizrgjjglnjwyyphjnznpwyjtyhriirgiyjilymwwgypwzpmniwyirgypzgrtpihlhinplwzjtgilzglyzntwwhrlgzjjnijrggtnppzrgminrmplirhhwiwitwigtwyzztzzilzmglgntjihzgpiyjnrywrillyllwpwzyyypngmwwlltlzimzphwjhnjihliplnwmzhzpjjlztgirtplyptmgpwlzwzhpytizngrtimtrjmmmhlzmhghhmgtttnzhnztghrttijmpmphwnhmhhhnllpmzmhzgymrgizzpzpprgjiglllrjyyyyhmylmttyitmpwyljithwwypwnmpytllzjyglyhwgiwwrmyytrypwpgymjynzlpilhjwghtpmhhjhrilmglptnhypymrnmjjtgwtzmrllyggmzgjjhzpjwriwpygyzyrzrmilrnjgghzpgywthrnjtrjnrwhjzyijnhrgnygzyyzigztnnrrzwmrmwjrhtghjtyywhmhgnmzwtygzpztnznrgpgtngwmgjnrgzhtlwrpzntjthwpgilgtpmlhmgpljjwrrmirwnjrlrnlnilyzhnyhtrzhiphizmtypirtlrwghnzyzgnjmypmthzljmiwyzilrnjhmiwpwmttrhitjtmigglrgnztymizgphyijjjpythnlymtzjhznnzrjhnmwtmtpjzhmwwhymztgrpwplgwpljzhnizgipgjpmtmgmytplnwjwzyltzthlwmmtpgmwgijwhrzpzlipzlnlyzithrnjmmglplwihzjtttwrpmzgiwmhtynrzlyngrmwyyzitthhrgtlnzpljhyiwyzhjlijpinjzitgpmpththhygyigntjltmiijygrtliitjylpmihlnwylwilijtrmyythihppyzjyhwllnwnlnrynzgzigitwhwmttgynzglpyjppnwhnnhwgnlmninrrghnywjzyjgnggznppwzpitgzimzjzzmhwtyjhliprzyrmgmmlhmttiztgtnlgnzmpiwhpngnyzwjithiwngygzhprrwnrppmtttzrhnijhyjjylylzgrmgwzmywtlztmmnwghmzzgmmrlppmnwpgzzztilmrgnyygnzlwhiiizmtjjirmhljrgpwnlizhypgtnmmiwmrjjwzjjhthttwtwwpnwnnnrzrjmiimtpglgzhrnlzmmjngpmrmpzgyytnngghzphlmplrrgnnwmygjrnmjhgrtgwizrmglnngtwjjzniltpgztzjmgrzjjwpmttplglmzrlzhjyljjjphrgtwiyjirigwyittpgpgwnrtrgmiphljwwnirhjhnjnwwtlnpnzngynygggythnwlwzgjimprmgwmmtginthphizlhmjztzgymhlhyyyhwlwnrhijzmlwyjtpphwipilpwhlljltmmiilrihtgnzyjnhrigmlywpnrhphrmljwlhntnjjijriigjphgimnpylprmnmijrmywmiyliygrrnpyiztlwgmmilihzizgyptprzimnzwwrmyypnglplipnttgntzwmyzpnigitigrrrrigywnllwtyzmlnmhylywjlrghimmipnnjitziylhjinnizirirrniyhyrnylnnmztptipwlnmylztrgrwlgrtrtrpjyhyrjnlynntjgymjyymrplrwzzryrgphmpggpnpywrirtzyjwwmthgwmhtpipzrtzzwlrhygjtnhihrgrntmygihyjgprlpiwwzylmwhltmtztpmihprizhhhmhthrwjijhipnhhzzljzzpphtjprnmrlnipnhpphtljyygztrpwzinyhlwlwrnjttwpmngtmhiwymigmhygyrjirjirjrpztwjnhrtmhhggwhyplmryghpmlitywinyhnlmlrhyjllzhrlnizwylnnpjgjtntmhyjizzzpinirlmhglzywpyntpymjrznwzhhtjlthpylwizzwpjywjyzyyzhyylhlnymgmitjyhpytntjtzyhtrgyijtylyzingltwgygwmigriimzwtpzwgngpzhiwgnwjhzphtptgyyylrlhzllztwzzwwjjmwwiijtympgzpiwmymgpmzthirhlzhpnmitgpziztygrymlyhphjnhplgynrtzlmmzygymtnghjhizmjlyylpzztzwhpipinhzyhhzrwrmnnrlpnlwyttlrlgylgjltggrnmzjwiyyjrgtwzlwirnznrypmiwlyhghmpgzjrrgglgmtprrzmjrzyphwpzthlrghhthtlzzhtnwpzrwtgzzwjzwtnpwgmilmyiwymgizpjzpljmrttigmzjphwtntprhhzwirghgzhthlrjrzjzzzrwlnnhgwpwhpnrhwghzrppmlyygwzznljglgtwzllziyhzlwyjwnimgjwmrwwigmirginrmltwhzzgmrlmnimltzyjythzyiwriyytjjglywpwntznzligtinrmwnggrntjzyhhnrznywzlizzziztgphjzwngyyhiiyjlwpyrllrllhrljjjglljnyyinyypgyzplhiymtmzlnjhpzgpjllzjhnzgglmninyrmlmzpjywgpjwzllggltjrjrztlwmpplhhnljtphtjylwlnmzpwrhjimnrnymzmmwlnjnjmzippmjmnlhiyrgzgrtllhhjyjihiyynjrriltmpptnyjggjhjmpnhpnitphmgjgrnljzpjwhpwgjrpzjrrtnyizpylyjmnhrlphmyhtihtmimlynwjmliygnjhthwzwgnjgyjwmyzziypmwyzzwhriwmtylmjpnygzywwzgiljnjnytihgpzthhgnzylhjgtnhhpynrpygpnzpjynhmjmzmtyyngngyjwrizjhznppmpjlltzytjmizzihrjjzllyjngtytpwrnpthjptiyyighnzrzggzrwhpmwilzglgltgzghlylpgrgriwglyiywiwnzzhigrzipjgjwhntzpziimthmntllittwyjlgzjznwnwjzipllyinylljzwwnlgyhwzyllhzlihjgwniwlwrmptppipmngiygggzthhrginhwgzjltrwgljiyntpynnmilwlpiltwrgtjhimlwpwinzppmythltpgyjhiyhwimzpnpytinhwmnhgpyjpljwggwtjgpmngjlpttpmpzlmizywzlrgtlizggltwltwlmrimzmzjyyztglzjjngwmypzmytrhjggypmwhjppihhzhjwnpmgpgiiwwwwggwmlgntgwmhiiynljyltmpgywtjyhljpnmirhnngijzynrmnlpgrtyjilzlmrwwjnztghnwjrgwpypmnwwphtzypthmpzwzwniwjwmtymljnrpmgyzlrhlnmrprrggpililjzityhzmjwwgwrimzprwwwtpjhmijlytnmnignwhtrwirinjlyhtgzpnhznmrrhtgwhppwytymzrnhtmrlmplywliptthlywgygwywlinnwlrngjrprlmhpngwzrimzyjniphgpllihrzlttnjlmrnrjmwywmmlpnzirmmjpljzjpzzgpjrlzgwztrpmwihztnrtgthynhryrlgrmwinyjlijlynymryppnmhhhpgljirzzzijrhgmyhtjgityzyjzrpnhmhjlwlhtzrpprllptnjgnmgtjrgrtwmmyljhpylmmhjznijtmhniilztlpyriznyjtmrpzjiygwprjpjgzrgitiwhgllhtjpypmrlgizttyphjrnzjplhhihjmjmrjmzwzwigynzytwmmtwygtgzijrimwrnimmnpzjwjptplzrrnmrwlilhmrjmwywrrzywmiriimpwtjjntyghjrmtytwznwwjzjijttljlwihmirththyiynitirznmptlwyyiphmjytimyglzgmwtmgpmwtthpwwzlrwwinhrggnrgygijmtnhhzzzyztrnyhwggtngynimthwmzzgjwnwjjznhytgliwhpjgiylpyzhlplyppyrijignhrzjjinmjiwrjhphntwptgzwtmpntpynrnhtjwgnltwmwziptwhtzgwttjgngrwztnwjrynntpnwyzzjrmghlgzyjmjppmpnwmjmwnzwihggnjnrgrgrzlljlzjzhzngznthhntlwppzymzwhghljzjrtniwtriwhpgizyghnmpwjymmpzlihwltzyhnjzngjiwitjmttpytljiryrpjititgryhjnrwjnzwnttmrizhzhtijmilwjyirtyhwtryzjtlwmhtjlpyjrmzmgpmyimirnzhwwgzhyimjiwtnpwmhptlgyrtpwhhhpihtlzhrmliwzjhyhinyppjmhjniwzrwminzgtjwgipymjyiywlhyltgjnpyipniwzjzgwlylllytzgrprtirryiprmzwrrypmyyiympywpijgyhjprwnglwtwinizzllyygtjhhtmlgpimylwtiyrwlinytlltmlghigpwzwllrntrwtgztntjphpnmypzglyptwllptwnyziynjhmhjiipyhwlhltyypgmmmygggwgjggzrmhthlghtnpjhphhzizrlwtppgjrjilnmzmlwzjhphwymyplilnzytiwmhimilmzggrzgntrwzntllirzmpggmlinrpzlgtzrizzzyympytplgrnjtwjjzgpzjtrlghntwhihrjhmrpnigpitwhmhyyntwwpyzytryzrgiwtzhrilpljhiyhiwhjjjyytrtipnhjynthjjlwjjplnywhwmryilrynhizjitprjngthznnjltgplthhhlplwgiywgiwrynhpwzrjintgprnrpmgjniynhwzgzmzyrnyywlilpzmnnnwmgijrzmlgrmprgzlpjlptltinpzyppzjznjzrprrwzgnmglzjiljyjmnmzizltgwhntiyrmhhnmypzrrlgjthnjgpmnjryimzhjinlyynlziiimlgrwjzgnmihzmyigpilrinmrjmzgztgntgwphtnitjzlmntjhjggzzwgjjmzjiipwyzgznzrmlrzyyhzjjpzhtlhjyyrljjlwyhryzliitwrhtnmlprlzlrlzntlinhttmpjitgitngtyyzjzzwpwlmyjwrhjgjhpihwpwrwwyitnhhjlwihyjhmnmzihrrywgwwzwwphmrpzypttniymmrnzwwjihmnwnwmhrzwmgyytwzrhgllmntnwhpytprylwhltnlynyltnwtmwlyhwhrnripphhjytplmrgpnzzjgiplwwyjpgtzniizrnrimpmizlnzizjhnizhlgzgytwinmjjmyzpyjttzizrhilzlhjmyiliggiplyngnwjmpwyzyirjimnwprprjrpymhgylrgzgiyltjtthiwlrzytymmitntijnhpzwhwlznrllyhggnzgggzmyrthjwplpthwlpywphnhjwpjjgrmmnntgppwwmnthhljirtwpijpyihlmnwpimprjgmwphthjgnpimmwhmypithglyzhjyimzriipzhlzilhljrhyrhtnntiwizlwiwtljwpzmtjwlygywigwlmjgzjrtzngmrggphwmynjgwjtjiywwtyptrlttrlnpmzmrmhmgjpmzhpnjnnnlzphggwwhpztwmjtwmrljjrwmtnthmgtmpttrhizrmynijhnptpyyyzihrhygtgmhgzinrhgirlmmlgyzhnrrjnyplyrwljilgrpjztiwrzwjzrlltrmzhnrlimilnjpizymwiygjmhhnmyiiilzlrgwjljhljjnwpznhrlwrhwjiwpnmhhijhyiwjnrjhjpynwyryzthwmtwgnrnyrptrnthntgzpiwrptgtlgrmzyilztjwzrmiyymzzypzitgnmghnynrpwmtmmmgwwzpjyjznnnmwhgnltntpntlitttztgwlmtwzpphimwtwwlnwhwhhtiiwjlznlithlliglhlwpmpmphpzphtwwijllmgwgnhzipmrjmtnryhhjtgwpytyzwrlnzyyjyywtighghwttwrghzzphjylppnlrnglglrgnmrprgygzjhzjwiglimiwptjjihrylgzpptzpigzlyrlhmyzghrgphnjyrpttgzjjggrlmllphwwlhhziihgjnngzjzpiylnyppnmmrgzywnwgjpygjgjinjipgztpmmzlrnrpztpiiwtrwnwtnpmijjjmillwghpzwgnrgtjignmjtrgpplnpznlwlwzwnmwlzynnjhtjiiggygzygmzhtmiimpprnjwnlrmtyjzijzjhptphhzngnwzyrjypllziirmnyiilzmygpjwzyzytgtlhgijniilghjjyzgigzmgnhpwpwyrgjyrnmigpghtyiimwihwwgmwrpimlhgrghgzztrgzhmthzwtgwynwpwntymnhziytygptiminlizjrgyprhwnzrmnijlijmmjyhyrjzgntjhmhhypwppytipziztiwwgwlwilljlrpnnhpylphntijgjjzttrnjjrprijtwilwipyzlnhggzwhglplgmrhnhpizwlrmglhjimylhryghzwwprhwlpztnpirzwjnjglyttjzynjjpmzmwtymrhggmjmihyyiwmtprijmltjpgynpyrtlnzimhlrzhniznyzgimiygwjiiptmrpggntnjnpwgmllzlnlznhpnlmnlpnhgnmnyiwllgtppltzwhywwgmtziyjijwzpmnmtzzjtjgwizilnnwngyprzlmrinnglzgrzrnimwgppnmipzypnlrmyrprgnjpprttzjiwmwynyjinjrrizgjhpimignygnphtyjynlnnzrlwmjlmpltzhjmiwijrppmntztypihlwigzmpmzwghjmlwlgiggtzplimlllnwjtzrytmyijnhnjlwipjlyiwhtztzpwltljylgtwmygmtrhytygijjmggmnzznwzhmirmrrhthynzyimjpppjlrynhtyztmyynnriprghltjjtnjjpzwpztnlwpzhjpnmhntgrhzrjnlrhgzwlzmmpwjziphpzgmihztngnzptgnthhjtitnmgglgwlpljwrtmrnnjigilmlplhwynmmtrthngrllnnjphpntiiljnnjpznyphyhrhtgrlrizjgppwnjlrhlwnygphztgmyiygzhmrnlwhzyripjminrphipmnwrnjwzywwrhllhmlhtnwniymhnrpwrljwrhmzmliynrgptwhtllltlgwwnpglyrtyhjhjtzprgggyjwziynyrntprjpplgjpmtnhirzrtmninjyhyiiigpghrlihrtptnwjzrntthnrwgypgrrmzllgplrhwzrgmtzhlrzjrtjtgmlplyrnrzrhpnwyllrlnnnmmltmyhntwwwgmnhywzgnhwjmzjjljiprnwgpzwntttgziitwhrwjpzlmnyitzhwytppzjtwwywnillwypmpiwiprgytllyrywzmhiilpyghynlrnipjlhrzlzmzwrzpnzplgzjwpmnihhghhlrniyygtjyynnrpizmwwjylpgyigrghzlhgtpzgighmjmzpttwjlpyyymrmhyprlhlzwpwjyjhprywwimmptllgnrjzyjrgigyhplhirpwzyghihrynjrwltmwtllnrwhnlgwnnthyphhwnmtjlnmnwihpzppythrjlwgliryhtyhytziihmwitmmgtlnpmjgirwzpnnplmzhtjilrihzjyhynglhpgjzlnilzlhgtlgmwjwitgniwggizmlzzntwmyjhhmzlztjrygngzjziijizigzplnrhpgmywtwjnippwmtnhphzptwwztztjrzlwrpmljihznhjnttihnwhiggiyrgjwrzwyjnzrgippgzjinmtijtmjlhitzngmiigrgmtmpplipggwrhgjhmrgnwzwtlypnhyhttjnltmirmntpplnwnmgpjhghpwzpynprgzlywnwtywnwjlmrwiyizniwtilpgpynwwjzlwrlniljpghzlprnghnlrhiwgzynwiptlrgpmtpzylmlijlnlwiylmljyplywiipjwihpiymjziptgwzjwipjjpzmhiwjphhhprzzrwjgwghgjnmpgnzyrrjjmjrrihlwlltnwwpgmrinmjrtnmnpyyiitmlggtgmtyzyjjrylynmzpjrtjtjnmzliyppijrtyryzypzghrygnnmwiwgmnitprtyrihtgmrnhilhiypyjitznrjprtgpttjrrtyytgjryiirwrzgyglprypnprijjtnlwmwrrplpnytijlntglgghtzwrnjmjhittyiitwzjgzpjzwyhplmjlnwwgpihygwtjprghwmnwlzhzwjywmrztiyjhizmmygtzlhlgliwhhwljghzmywyimzlynjmzywpgprmtmnzhmlwghltznpnigrpywgnrnjhjnnihrntmyyitjjypwjhrnrjmmhpngzlimmhhgrgwnljymiziygygijzjtlhjzzyhtgrnwgjjlwwnjtrzlpjiizrwgintrpzlmjgmhmgmjwhnwnnnzlhwrlmwtwipirintmhjhnnppjyjgjrtnnmhwhpylgyzwzmtihtgmzmmwzpjymjjmmhpmizyywhntgrintllgpyityhgtipgintjpyhzgymnizlltpgjgtwyinrzgmylwtltprhrwrwthzgthhmhtjhgngtprrznhjzmwmtnypnpjlgwjjltphljziwjtypilwzgjtlhhwwtrnrlwlthiritlghrzzgtpnymijztwjzyzwwpwptjwrzyylymzrzgthnzhyzgytmllrmjpmgllmwzjggjwwwyhrggijntnpywtpyjjlgpzmrrtylryhzwhwytrmygwywiigwpjthiitjrzrwyrgympjpjhmhgmjzygnhtihpgimjhjyiwrlgwltjzjrwmthtwpprhymiirhphjhzlizwlnitpjmlrihwlrjmrnjtrmyzlnirmjwwgthhlhppjltrhlmpjznznnpnhtyhmtwprtmrgwmgzjrpjyngwrwlljghtphzjpzmmhitrriihyyrzttpzjplmyjzpyrmjrwhmmgpthmhnnypjltpjlptigithzjnjnpjzyglinptmynjgnghwrrrrwmzrhnihtgtyptrglhgignjzmnrnwtrthnwlwnrhhgmylthlnhhmgiplyppwimplzhhrthwnzinligtyywrwppwigyjyytlymppwtwtzyhlztgtlirniphzghzirmpzlzptzrggliwmgmtlynzrmzlmjphmrpwhyrzinjlzzrrhniwpliwmmtptwiwtnjygrjhwwzmznjwmgwznlzmjwplnptphjiprwhjmiplprmnilmzhprpmwilznnnipglgiyztlzjtrpnjymgjgjnlwnzimyywjttzytrwyrtjilzmrilyyzwnhzmtmtwmtpijjjmiwmimprmpirjztjitghywnmzrzijzwizipwitizilgtrpjhwlhjpnilthjwphnjrrlgjllpipytpiiinjtltpzgilgynjyrjynnnmhllppypgrwiwlnyrwgwyyjllptpnggwwlpzjhwnritwljwlpyppztynpiwgjrhtlzmjiginhnirtzghrjyppmyrjtnjtigwrwgplzthglhgwhhwmlyglgglnhniwtligrjzwgnwirnitjljyjmpihglhngtyhjngpwztyrimyhnpmtlltwirjhmilrlyhwtnrttlmlpwthwgtnzywwrwwgjtjryzprjnmgrzhptrgmgmrnlhlrpijtywjgymjlynjjrmrjjwnihthlzgtjjgmwnywhzyprljhnmjihnzwymhprwhjjlzlnwjzigznynmhigprztjmzhithnrzljhtmnyhwyzrntljmrrmtrwjpliiipnlpzhyyljjitwlimlinnjphyrrljggjrmzzngtrzzzwnhmlzhyymnhlrhizntzrwhwwnppmmmhwrijtygtrtpngihtlhglpgjyppntiiygmplwhjgmptihliilrgiyillrmjlpwthrzhyinpriyngtzghjitpnmzgwltlwplgiwgmiwhiwrpzyhlhptpjtnywyjnnyinwpjgiptiynzghzryzinhiyzywtjwzjrmnithmmwilglwgjjztjwwttwmjtrpprlijglrnzglhlrmjpyripwjtlwmzlzhpttnphtljppippnphzplpnmjhpwiyytyzgwgmgptymtipllywnjgjgrtlztwjjjimtzpwimgwpiwtptiwlzhyglihmzhrhminwwjyrmrnzyjzzpmpltlhrgwlyplygjlgwmgjzzrtlmlhytrlpmiiityhmphtgwnpjprtwwryztylgzmnjtgzgnnnrjpjlwjwwnpijmhjhrizrmrzgmlrlmjmhwrwhmjgmiyyjyyjytirzlzlljhninizgmyyzggpwpjizjryzzmypnimrnlizhjlnpmljhyptmingpjjthzjyrmlmypgjgimyjlgpmjghtgrhyyilwiptzhrtnnnrilngnmwnwitwzjgzwhhtnitmiyywiymtywitgmpnjjzmwrzmjjrnmwrgjhhtywpgpmtpmzpzgwtzmnmmryzgptptgtmgizwmtprwmmjhhjtnjjpizppyrmmzhmjirinimtmizzmmnpnwmihlmmptmwppphnmtzjpglgpjhmwpjzgthilmhwmmwtwmzylytnymngljmtmnwjlygwirtyjimtghjznprliltgyhnlzhirgnizrtgjzjrrwlmmrryhpprmjgymmnrrpzjnipttzririwltzinhiwgrliypmjytwphmttwjpwtyingttrwgtnmyghjphirylnrgnwngppjgrzhrhyzywgwtthgwzghlmgjhmgtyzrtwljwyzhlltjlmwrjgzltwrhyntrljinrzrgpnthizizijiljytjljplplygwzgjntynyrzjhprggnzzhpzrgwmlrtipgmtnhlgmlwzzgiwlpzpwjllwntztmrllmzhtiyrzwwniwlntnwpirzihrmjgrnnntnwjzzpygwntgwnhyiytrtmjyznltwwgwtjpmglnwmtwttgzlwijnitwtznrmlzthmnyhmprphwhtltjjtznrywrjzryythwwlrgzwywwwwmwgrhwjzwpyyljwypgjtynjhtmytgyzznmlntpyzyrlhrgmpinzyrtljzrlmriltmjniwhgmytwiijyimtgymhypzplyplmltzwywrinrpipmmjntmwihwtthpnrmrttzjzjymhgynpmlpnggprlgwilmzjzhgyjimnhpltpmytmgtgihwzrnlpyrjhitippziwtnwmrljzptijpggzlttmwmmptrtiwimppzwigrhmtrirwrmjyhpynrlpylilpmhmgjytmpnyjhwtgwzhwzzilwwhgwyinlzmnpnhnjhjtjlphmrjntnntyininlmlyizwthwllihphglmwmtmrnjlmtpnzmzrrwprztrlrypnrpyhiirtjnynhylmttjwmmthjzyythptwljpihimyznjigihijphhylwgripiizmpnipgizzzihgymmnzjrimihwlniyplpyhhtgpgjpgrilwpmgpihnyzrwplgwltrpyjmrpymyyjmgtynpiprrmppmltlzjtmwghtjrzwnygtgzmtpihnzzglppwhipnpmwlmipigniiignthzjmmiwmtipngglhtjgwgymmmwyzwyjltgjywgipilntwrgwjpjmlyhrzrhrnwwrttizgttmmnythyimhplprprynrrtyjjtglljgirwpitjihhghphygjwynglhyhygipnrrrgmrtyrhzmhygphpthjjyhnjgwlzmmiimnmygwhtljzltphpmnmiytymjnlltwnmpyryyizgiztwiyyzzttilptjwypjtgptjwjywmmjwnrrpnwtjrtthznmjrmhjwmjzyzlithpniljprrnnlmmnlmgrnwjyzlltzjgzinyitjgjznmijhlhmjnyytyjmmwphppwnhhjwljpphwnhngwrgtplhynlwmwwriwlmiijmggwtptpmllrzrwlitglprtzylzyytylinwgymwjyjrnyipjlngihlptpwrptyjgzhwzggihtgwyrmmhritytwhzilrwnnrljnijggzjgmypyrrgilyjhhwwptghmpymtmnynwnhwzpimlpzmrmwtyjjgrhpgyhyzzpmllgwzpmwytmniwzmpzzlyjzjznnjhznhmhhrjwniytglirymlwjpgljizimwwijlpgnjinnwryyprzgwgijnyrjnjwgztnpyjjytjpphjwyiirhznwlpiwntriliglgnnrgmhnwtjmwnrntpllphywijyiwztipzjtylmrnmnztyzlglthmnprzlntiywlnltprwgtrwjhmnhjngmtjlplihpijigjgihhittmjyigjhywtzgjmjpjgythrmgtwtiywmynpnrtlzlyyiingntyiygmpthjhplrihggtljjnntttzhwpythrtpgrjjiiphmlrnghthhmppwnwtyywwmhhthllhiwnzmmtiwgwhnztgppwmmhwmgmztnztiripzhrnjhnlghznhijihrrlnrnhtnpzhmimgrwlnmtyitrmwjlwyijhphpiiwizmhligntjzjmlyznnwlljtlninyilplpplzwhziyrhpjnhhzwzmzmyynmmigwzzzthynhgziigrwjhzhrgljjrmrllwygwjrlmnhglnlirjggwmigyhnjrhjmmpjmllywngwjwyimjjglzwrnnhhjlnrlnjwyjnmintmjpiniymmmtymnwgzjzmjzpiyhrmymihwpjwplwpnzziiyrgypzjgrplthphhzrgymzylnmjptwrmlppprplmjrrthhmlmhhittntplgpwnjpypprpyrijnjlwyrptzhrgzpinzhyhilyjrhnijlwyhlnijzmjihwwitzpjwghimlzhimgrrtrtpjlnptwnjggpjgynjmghgirjhpjlglrrzlzzzlgplrtpgrrjwjtyiigjyhgmyllizzjhjhhynmlhwpmwtgtmwygzhhwwmwngiiprlwiyjlilphzgrznmwlmrrrtjtyjiwnzhjgphypwrpprytgyplmnihzlywwjjthjywhwyhrlriyrizgpwhztltjpntyigllgrmyiprnjirtztzhrjhmyhtijnhiwpjlgymiwnhpwznmrtmihljgnhtnllyjjjinjnmwpzirpngriylrhwjjtjtrmnprjhgtjlpplyzyzzyrwhrlztnnmhrpirlyhyrnznzzjthttlzhrjmhgywrhtwlggmjljjhmggztwwjmilzgmgimytnpmjmhztllhygzwznyljrnyhrjrtjrgngrjrrmimtghtwgiijyymjjpnymwwigjlttjjyijzmjghntimtmlygllinyipiigjlhiprrjihwgmryilntmghwgghmtijwmjgtihtllnipryzyjgymrwgniwygwhirltmzijigpilyjlhjzthywwpghltlmznlrwygiypmngzmnrrmhhhrirpilhphtrhptwnrhynlpwpylywnjjywrtwijywmnyypmgmypwhhrglltplgrmmiglmlgnmthzhrwiyzryhglhrtrmzijhziyzwripywngtwrnnwhittmgmihhjmjhpwmzjnntzwgzztirpmrjngizrwgghyllwlppmywpzynrhnntmllpmnhwlhllliggyygljipgpnzhigmppnmprrymyrtjtwrpriihmpmnipyngmhgwphjiwyittzzgzlghwhprltrijrgnmimtmhwnzhlgilhplrzipjgtthimlygzjijpzghngzimnjriglnnpmzmlyihnwnjzyyijtnpjiyinizhhpjnrlmmhwgithwyljzlgghmpgytmryzjpzgwgyhttzmltlwgympjnrijlwwtwyrrlltlzlllrnhhhznyltpmplphijhzyhynjyjmwjthjrjhjlhjrmjjtpzplnnimgnhmpnipmmyyhphjmjjggihhpmwlmljthwizwggyyyyznimnzmtjnmwghjlmgtpjyinhiwhlynngppjhwlhipwiwrjwrwpinjpyttlhtgntmipnnpwprzpwghhgztlwhnylrziwnmjwmwhpglzmlltgtmryiyrnjphnyzymywgnghnrhmgrnjjwmymglrilhgyrlnpwjmwrttzimrmmpmpzwhjyrzhpwmznhyrmwypylzjzlrlmhlwhmlwlnwthrpyiltlzigyhmzlzthjjjhylzmtgmtwzymjwmijmpwhrzptzigtyjtgzyynnygtjwtnitlmzggmnpwztpjjrwimrhgmhlpwrmpnhgnylgyzjnnmrgltinlpwpzlnwynwwjipyiiiggyjhzhnntiltrwlmlnylggtypitwpiytwjzmjnnmhywjngnphzzmlhtnrhghygrtnpwgjytinrwtrwjwmnitpzwhiyyjlrrwzjprzytwtitjimhyzrghljmitttwgjpygyjhpyiimjhplwlwmwwlnwppmmrjiyzwrtjmgnhihjthzzrlpltprlhltwznnhntlylyrmmpjjmlpnjtrppmirzypmiphwmpwwyngthlwglzhyrinmynijzjimygpgjrhrynintntlityimywgmjjhzphjiwrmzlmgjihgrjgyywjwypnmyhmhwmwhhjttygrgrrwgritrnhrmgnzrtgwnzwtlhrlzrynwyhjiyljgijipiijryjizztjyyhpzgpnrmnpwtmygyhtpmihttzzwzmwmpitghznmnrlmtlnjrmwymmpzzmzyttjgzlmlghphnwrlpttrjnnrmyhgnggnjpglhhitpgzwntjiyhlizjjrygrmjggnmmizpwhrynnghwjyjglgrimtwmzygywlmntjggiizlrrrpjmjzywjmzljnmlmmtmljniyttlphgwwrliizmipgyrniiwriitnzwtmnzntllthlttjhlnnjnimrwpwmwlgwyrrrrglpgipryizizgzwttywpiziirhjwtrywwjhritjggmggnzpiwnyrgwrzpigymnjwhwrztjrplymjiijighyygiinwygwmjzwymgrmtntrmjymrihphlzpynywjitnrtiitnmirjijgmrzmhrnpinzizrirpygtmtzwlpgghynyhmlmltpliyjgrwjryzlrjgtzrnygwlglwizhiyrhtjphnntthpiwzjlpzryttmjwtglrjzrzhnwrlmimyrgljtjywrwygyrzhhhjnhzptwymtnihiylmrrjrwnljizwrmnjwljnnnmimpgintnhplwgzlmjwhtlmwtmyziiiygjyyyjzwttymmyyglwpyiiplppnrwjwmpimlihgnlyttrjpgjzlgmtrhjirtprmtrgrrrrltmrptnrzggpmzlznmhinyyhziphwinltrzptmmjhmgmmymlriwztwyhjmyihpzrmnhhmmlnymzyjtnzhlnnrihthilywiphwrtwmnttltrynpppygzimmlrthmjglztmnhyipnypnljnmntjlpzyyrztiwthyggmwmttwhlhpljlmlhylhyhyjtpttwjhntljjgylhptnmhgmztmwywzjhwpgitrmympwplytzhgrnhjwwyyzjhrynlnlhnipnnrzrltgmnigwlhygtrgwjzgyjrzjzywrriiymjpiihmhymnzlgrmhjigwjyzhmnpjnllyjlghprhhwmphnpyggwzgjlnrgypwggmglglrmpwrhlyphrjtgntnirnpnyzpzrimnmrwwglrrnlmnrngjphjgriptnhirjllzljthyrpjyyliirhgppntmyhphzjmitmylpriypmhnghjnhljyymjigrrgirpngylymprrzwnzniiprzhtngipynrmjzpmimljjntpiywtllzplitzizmpnjlihltzgprmjggmnrtnjnjjjtiinrnnrljtzyplyrzwgywwggyrwipjyitnhzrwlynhznirpnmhhmnmpzzrirlgyhmnwypzwrnggzhhrrywyiwnhgyghhmlrwgyyzwynnymhmzninimgtjjpptjlzpzlwphmlyinhwiigyzhyjywzlnghmmrnnilrwniilrtimzlriyllylyhzgjiprghijtwimgginyiwgigwywtzhglglhhwmhgghljwlnnzgrjlhyygrmwymwrljzgwpjilrtygyzhpjizzwmnzlwnyglttynrwmtgtjptimtwtwgyyiwyglnjrlggygpggzmjhgptprmllglmijrznjjmrjylpmrrwlwytmtptpjiizmjmznwpnhphhmjzrgtrjwtwgihhwthlrltnjljjntjzrjliphmpyimmmmpgmwwzhygwylnzwzgjtmjmitttphmrrhilmthmnpihzmlhjllnignpigrjgjylppphnylynnhizygtlpphwnlpytmlrlwnwgpwznjgtmmnzyrtyhwwyllyzpwtwihwnyzzittgwpmjiwiyzglpphrljrightngzlghlrnwyiwypryjiwwhwtiggwlrmwtmymighwtttypimwzlipmtipwtwrilryrmrzyptrmtlnzglmiyhrgppymmnnjhlrhgpzhmzjrpzpyzillwtmjjnylmzhmilzhnplyyjgmzgitrimhzjpjhmhllyzrmmtziwjplglwygwlziiwjznmgpnmhlmngwhrptntgjiryltitjmlmwjnjtgmhjlyjglzgrmgjhjzjpjpmymlrtiwigpwmzpltpimnwywilinlpilthrzimzrnpilywlrygyhgwwpmlptgwwlzgwnrhilzmyrztjnwtpthnzzitgyhmgylnyirgijzjhtgypgjmmypnzgiytwywnwmyhyjhwmhpmrplzziynilwwlpnrnimlzilrtlltmnizzijtgtlihjrhhhjnjmmgwzwtjtzjzjrlwphjrlhnytihjnpgpghjigljnytwnzptzlnzgrnyplwrnlntjjgzntmrwwmhrpmlthyzpyrnirmnypjihtnhpmgrgmwmgywtigjnhynynhjmymtltwpiwlrpimjrmzwmgmrrwzhtihjrttgigplrpiwzwzlyjityiggthwgtnptlihrhlyipytpghitrnttmzjjmrtgpljiwpjzhhmgtztpjhzpglhgprjlzpptwwmrhhyygmwltyihnrrijmzrwgizthlpwjwhtjmptglngljrgplhligzzlhllmiyngmprnwlzyzhphlwwjhnnwlpilnlwgjiiwrngzningyjrywihpliwttjjgtppzhpmziiljrzjgmwlrpzzwgpyhwrlrtwjlrmlyztwglzpywplrjmgythizlzljmmttgprjpyiryihgmjwrgrplmlnnrwgrmtttthyhimitgyinwypzplpttjnmlmjhhllihitzjpyjipztnrwwntwmrngzjjglnlgyngrmhhjjjlnpyttnhprhlgplnltijiltgyjrmzginrlrywnhnzmljnzlrnighznwltzhijpmhrjwglrnmpyjriipzyhzhryggphltzzyypiyzhzzhngwwgppwwpmjjyzgztmwmmtzhtnliyytttmgtgmphznhzwyrgnginjlihhzmhiwtplmltplgghmrmtnrpllzlhngmgmrmrynllliypgpjigtjyrlzilipgprlyjprzjhggwlwprgrgznlntwljnhlznymyntlpmnityhwnphmgtyiynlnilyyrpygjjzrrgjlmlpliwtmwtgpnrglimwzjhyyzngithzlnhhwyglwtyhmmjtlrhnmmhmjjrllnlnpzwjmwtwhggnirrwlzynrzymjinnmhppthtpprzmmyywirhlhrwlypztplyzpipyttnmlhilhgjrhzztjhizmnhhmtjmiyhjiwzimzlgnljgmwwimtniwtptpjzztmhhiryjwhghjwgtjrywjlzinlmgywymrgrjgwilzwgwwnhgjzgtijptirnzyyrninjttmjimpyitppzwpmlpzpttwhpyzjjwgjlrynyntgjtrgljmngwthmnrzlnjghrlwiwlgytzzynnwtrhzihwymtpjyiwmtlmrhzrggjymzwiggyhhngtrzijgilpywhpmpzjmztpjhwiimngtlmwplyrphtjjpptmgrjwiwngwijjpptljgpyzgpwiymzzpnnghjlnzprijzttyrtyihrgmlnjwtirzgmizgtwjwnhnhnzmlwyhrnmpnhgrhhwnhmrwntzlpwtwzhtiymlhwplyijgrrwzwnpmtglntnnwgggwpjzgyglyrgggnhgzirnlwzyljghhlzpmgzwhgrthzihwgnzgwprrgtryrlhmgjjglmhlwjhjznlwjymjplrlwmyjpmznjimmygjznmhwlwypwlzipygzyhzmmwtgimlpwwhpgwyrijigmhrwtnrymzrwhnlrpwlrnwjjnzgtltgwnthyztlyynznnwmptzpnyrwiwnnjjtgznzgipjmhrlmnnnhtltmztngyrptwggiitjnzljwgjjwyymlygrygyrjzywmlyygrigiizhwznjnplgygzmnnprrrmlilzptmitrprhtmtrygmjthtghmjrjmyilztggwzgztrjrrlmpjhipgirwpzjtzllhnjylzthzphzyhgglwtztwtmtnjrznyriztpnihgmyljwjwgirhrzmwjlpwrijzlijmtrwyjwzljgjwgmwmiyghwpmnwhpymtmrlmipzjijlrrlntmwyjgywggmpllgrlllywngtwzhmjpirtgtrrpjwgwyihhiphiprwrhpriggiwghmyzlwmhzrtyiwwwzyjmhjlgwrgnrngmwlzwjltrnjwilirjjwllwgnwypwirwngznrhzgzwwyyjyrzppmtmrlrjmyjrrnyrlhmwpnlwwrmwwlyhywgmjjtnynznlzpzzhyihinpnlgghnwpmlhmwnwtmgzitlytjinphnmjwiyrijigtlghriryzzpnzyzwmpnthitjtithmrmnizzzylyynzhhilyrimnlrjghyztpwjpltnizzimimwylwyjghzwyginrmpttymithhrjlgmwthrhwhpmwlnmyrtjhgphmwywwyyjlmjzrmwtgtpnjiryhizlgmigmimyrlgnlthjjgwnttjlrgrgtmthmltwmzrllpgrjmtlmwnjitjlnpntghrjzzlyyyzjglgmnmtziznwyhmrlnijpyjwpzwhnprthjntymrrggzgwgrltthirmpwtzznyinynjhpizmjyrrrltnntrhppgginjrljgwtjzigwjwjgzlwngwwghphgrtjzipzmmnghnwrjhlzthnznjplithrltlwyrznjppmlyhtljgtpgipmgrnpwgznptwwnhjgpwjjjzhwlnmthrggwgwpiglnrznligyhtrhrgpryijphlnnlgttynrmlmljwnlypymizrmztrilhhgmngthijgygthwwmpijtlhtnripyrlztlllnwnyzmnilntgttrrghyziwpnlimpmrgzlilrythrwgjmrlnzhhwnlwmhphrzhrwnplwpiyitgyzwywriznyghjjngltnjiipmgtmtihmjijijljzihwrwmyhrimnyiwywjgztrrjirnmhzrlwnijwhrypnjhmphgjgryrtzlihtgpzzztmpgtmywglnhlhntyzhgmtpnynwtlggrwiiwniwmjpttjhyjjjinhjtypmmylijymzwijrlihrnlnijhmtntjigmnhjwnmlnjzymwwwrnhghyypgipyppmyitzgrtmhtijmjznjiyywwllithjpgzwprygziwztylnrgtmrzligtnyytytwznyjnjtizwyyglpytttyrhllmzpjnlpzgwzmhnyypzjplgpygpnimtmmtthhrgwwgzwnwjiyjzjhjrygrlphgjwynwwrwzipwiyhipnwjrhmhgztglprmiiygjhgmlmplmmtimtplthmrrjnwzwmzyhiwzyjmzihliihglrmnizzznigltitmhzhzpyiiiyypjzzwrnyhgyttnnllhgrthhgwnjrmpgygipjyytnrrtiwtmjthmhpiwizpjjngpnmzpmnhjgytnjtzwrlghmrliprplizgpmlzgipzhziztlrhritmypgyrzwyrgihtimynyighrigrtypmwylthzthrmpptgrhrnprrimijnjitynwntzlwthgmzlgingjyrithrminlpzgmlrjznnmtwlmmwyhhtyimygritzpgmrinmzirgyiygtznwyntingtwjyhgpmwjnnnjgpmnpzwmtnyyzgyywrpnjjrnpjzllrjjrrjjzppmltwrnjmrtwmwmznylhgrlnnmpzlngmhthlpljizmzznwrjytyrgttztrrmjtrynjwzzrgthppzmzwnmznwpzmjhhnyliynpyznnwinymypyilzwgrphjnglilpnnpprztjplrmgjzmmzmrmlmmpnzmtgynmwzrwjmztzzwlzwgpjjnzgrmimyiwhwhgtjtillhgpmggytliljrntynnigtjhnzithrmgrgtzljrtphntlrngrprymtwwmwlrhzmyzrirmllnyhjlzwmlltjmjwngjzwlziyhrhhhnrmztmjjppgznlmitpggngpirpglwmmywwjtmtlmlwylynljljllgjrltjmtlygzmrwnwiwlwgtyripytljghlpgnzwyntygyttrrtwymmrgngyihhwhylhttjtgiyzrmzigirtlghghnrnwthrzznhrlyhprmhlzlhzjzynzyhjwmlzlrijwrigpnpmlnztgwmwrnmrgnmhygzwmintmjijrjywjwhwgmzjylmitwhhjhzrpjrmwmlzpmrzlrpzpllyizityzzywrhphnnnhmphwlmimjhmpzjirzyngyzlpgmgipgilhpgtintppljriyitnpptrpntwzrrprtjnynhgphirwtzmigzjypmhgnnjiyzrmlmrrjghzttprtzjhrihiytmglliwnylhjyjthpirwzimiwiynzmlmjrttttwmrhllgjgmpthwtrrhilghtjjnymwpyhtgytjiwmhpnzytlhinhrjihmjnimmrthzlzpriyhtrzrrpntwnprjhgtrzwppzztggrmzginpyypyzrlimrpzijmyytrppiijgmrhtzpiggpphhhnipnttigwtgjhgiwiypmwltnnilypmmjrgygimzirgyzziprzmwjzwjpmmjttwptjlmpmniptlrhrpitgniyrnmtrrtztjtnthmzyrlythmmizinmrzlwggmpwpiyphhhpitmpjmrzzziiliphjwnytlrwjjpgniwhlymttpiriizzglrjmrhmhwtzyhrhwlrjnpzmggpznrnjirwrwmgzrmijtlhmwhrntnzhjtwrijiithhgmhpgyzlztlgiwyzryjtltnnzwyijnrnmizjllngrzznjlyytyilmgingmimwnmnhgjwmzjlgwilmpliitpillgnrjnnhpzygynzjwpptzhmigjwthyilljmjrrgtwtyptlyrttlgggzrlprtrtiyijlwhipwpmtwzghrlyjrijthzlmywyzjznyipiyimillmmyjrmhzlrirjpitgrpllzmlhiptmplzwmhgtlwnglymrgihjhrwymjtpnzyzzwypgmhjhzygjwrrntihznyplhjtgwzmtijwprjhriwtzwtzjhgzynjjpmwpmitmylmmrwwgygnyjyhyppyzwhnmwgnzimzyhzzwhgijynyinrywglzwgwtwnphnzplwjttytplzjtygyytnyizwwlryglryzlwjtilplinihnyrlnzhwzmiggiriwzjzwzjhjyzzzlgpjhmznwhihlyitmmplrlzzwjpmnnpgizrgjhmztgwjrgwyzlzztpygtzriymiijmpwpjjlwjphmrrpywizhtmgpzlzyglnmrjjgzlpwiphyhmgiwpinygnimlzimypnmglgwnjthhnmgjmyztmjlynwwmttlipzprpmtignmgptiijllipltjjzylnmylwwpgmjplhhmntwpwrlwrtjtphljiytlttytzrmijgryigjnwtmrgtiyhmjytpyizlrmyiizghtghlyjpnipztryhjgwnppmjwhythnrhgzjnnmhigzynyhyizjtiiinrjhgmnrlzwiwpmyymnprgwnlwizjirphhrymyzplznmhwjtmgtrnlihigrgipmtmhttglrwrlywtiijgghnltwpyhmprmtgwgngjmrgjlphiitpprntzgnygihgnlthtznwwzyhtymllnttthrhhpmhyyylprpylihtlryttmtrzihytjwtrytjlwryjwjhyypwpzttzyngppyhptilyyzznjjyrrgimtnyplnhrlhztpmhynhmhyjhmrlwizllhtjpgwyizzjrpgjtmgnhhtmirwhzttnmwrgjnzmnyyyttgihlzmtlwjmjlrmjwipzttrgrlpjhwglipyttzthpggprhyzyjhnznllhgrwnplgyzjizhiwztjpwipzjzzgwrlzpizphpwjjgpzrpgnrjgznmhjjjlmrtinmlwmmhrzrngwyrlmithmjgjnjlgngmnynlryilnjmnrhihgyjlnjwzwrpnzwyntyrgnrjtilttztwwnmgwzjmyymhmiwtjntplzgwmppgrizylnrwhttjwzrltnzwntmypprjnnglnpwljppzmgplmgrpnlnmjymhgrlpnwynmhmyplyrmgwztwnjiznrmjttijyrgjtlhmywjzjzmrzhzwgttmgzlyztnthpnwnmmmhzzghpzwmptjgiztwwiirlpznlgtgnlwlmrlwggnllzmmyljjgltzwzntgyttmgijhrzngywwmtrmizwhlwwmjhrzytwhlihhiptlhjigwnniljmilriplhnnmjmtizzwzylmiyihzgmpwtwrnrgwyrighzilzprprrwnynzinmrzhljhtyjgnwlwlzpnlyzhzgzryjgmrttgnhngnhmjlynwrwjhwgnglhptpiplhhhzlrghhzwpwtijirjtgymghprmgyhmyhzmyyniitthmryhzlnzwigrltmnrgrnwrtimizhgtlizrnzlhhgghlihhygwhzjngnntprzptlptgnhwlgrtgmtijyjngihtlmwtgzmngwzhljrjrtjzgntygyjyprgwthwhirjwnyimymwrrnlhyijjygryjtywmwwhrrhlyhrimpjggyliyphwypzltlwnrmgitlhgjmlzmlyimhzijlillngwtjprntthljhmrymhzgzitnprgnjprrgthwrggplpjyyyhpjriztpmhzlripizilgrwzmgygymyyjlrwwgzzihhizyljymlgwrtmllygzyrhggzlzrglrgijmmwlmwttmzmizwynrwitynmggnyzllplrtyinptgjrpziyrlynwiwlnwtyilmylhrhgmpwhtjmighnpgnlhgiwtpnjgrtgnliipiltpmrwhrgrzlgtgiihgwtljytwzpwzgywzhilnlmwhhmpmirptmtigmttjwjrjmhtggtgylllhrzrpptwgjttggiwywtitrlnjlnrgzztylpgtiznzwgrijpzmripmtrirzpzzzyimtnznzjtmympwttztrmnzjwytrynwgthrzihpmrlzjggwgtnwynwtwlhygztpwmnwizhjwnpjtjmzlhwgpglmmtgtytzltmylnhtprnnrlilrlwwmirywnrtzryyztjhripmzmhnwmgmwtmmimphymrjhpztgjghtihnirzmzmzpizwtmzitmwnlihzittpnzgrlyngznimjyjrmpzinypzjrjwzwzyznwprirjmmlrhtjrlrihtlnjiirwyyjynhjpihrjlnyzhjrizmjrgzyhwwlpnnnnpglgznjyllgyilinzrrmirzizihtzgjtnmpwwihngningijwtrhlzmlwnznwpgnlymntlpiglhnnglnttnpltmlgrwmrltzrrpnrgpnjptglnmnwhgghzwwgmhrnjgwgyymwitnpphrtrrmhyjylntnirhzmwmmhnhwnmymtjwniilwjyjwypjrnyphhmimphrlpphltiltmwztzryrpjnznyggjnljthjiynglwnhiplgzjrygymjhwgznhngmnyhgggmgmmmhipgthrwntjzlnwplyityjjhpplwrymmrnzmrnwnzrzryjnhzpmhzptympgppptgplyynrhjpyygnnwwpmtzzzjjztllnllljlmytrtgwrnljzlpmgwzmrrpjglninthpgmlhitnghpwnwjwjnhrjhphitprgmywzjgntrylglwwmwlwihrihgrmlhhtnzyprhltjhmtmzrtijltwzmwnhyjjjwgzhyjwhggghryjmpymhniinhipwlzzrrpgywpgzmgphlmttpjmpprmlyylgrpjtmnhgtjlihhgjnrgtmlipwgllrypzmypjnnnyhwzpzpmhjynwyzpzjrpgjpmlpygzhtwmizrglgtrigrmzzhwyrlzhtrpylrrgglilhhypymzplrtlwlgripgmmrjttimylwnlwjpljnhimgmrzlzmzilnthpjtlzjmlmjzilgtnwgnwmpylzgplmlyrlnwwtznigjhmtplirlzwhhrmhlrpggzwrpgtmttimpjppmmglyprlprzrzrjhtnlgjzjwyrmmrpimtzrlwlwhjihpyzwygmhjmlrjztglmlhtryphztihwpjnhpmpmnlmztpnlyimyngmtitznmirgzpjpyzlprjlwyhwwlthnrtztryitjrwljhnmzyljwgppltipiwllzyzwwzryppnipltnzhlmjzyyzwzmlizprznzngylggtjphnwiimrtwplhlpgmlgylhlrggrjthyhhjlwljrrljlpywmrhzmrzpymjihzjnjpnltziywhiyzgnlnwyghlwwgwnyhzljglzjyrggppwgzzmltpwyngtrhlyjmitgrtgrtygzgnmgynwypzwtynnhgizrtmgtjrgmgwwrnmlziyhyjwtzywlmrzznrwiipytmmygypjjgjjyirwpmlwhzmyintpniynznywnmnyllijpwmwmzjlmglnghmyylpgwpgnziiwpliljigrltymglllilghgmihiggmrgjwhlhrtihpzhrgmltwntnwlhwgtinmilpplmgtglymgpglrhrgiiryjnzmmrnnriplrlityrhlzhrpnmrthrznltgimtmwntnyythhgywgyjrjwmmhhjhpltyjpmtmygphlhrnlmjhltinwpghhnzhzzzjghhtzhpntnzlrhwjtjwmthlpttnygwrrhgjwnjirnzimpmzmhwmiintplrwjtmyrjhlmmjwtwzgptlgpnrynnnhlptwjpjjtjyggnrlmilihliytityinhzpwtrjyrhlzpprmrjhnglgnphnghwpplhlilnmwzjiriyllpijlwzilrrhihgipphwtzgttptppjzrgjrzhmtjwrnpgmigzjjgywrtzzzrhtjimlhrpgynzjtmntmmgzlmmphmwlnpmpjpmgtihhrljgpwjrwityzjrnwtzimnwihgrjhprtitrtztwrhplmlwntjtiwryzmpizyhtijinnzhwwzlgilrgtzptytgyziyigylhmpiwighphihhynpgjtjnlwnlwhhrrwrjlwpnmpgtghlzmpjzlppjwzyhzitppngrtwjrlwhwtzzyzgwhjzhpnnptzyjjnhywzgzprphrplzihnzijnhnhrirmpmnyzpmirwjrwlmizhwghttwzzmtiyywrhpgjyimgnilnlipnwrwhrmgwintmzyzgpmtrjnjwttnygnttyiyylyipnnzzilzpnmghtyzljwhizyhwginwwgjnigntrygthlwhhijhlmnriypirzpnnrhrtmgyrtgllwttpwpwygrgpmrhznmymjmzhwhpyjphrtgttlwwglghmrpizyttzrgrhptnrpwppnznipgjrtggwpplnltrjjrppyyzjnmzizjinpygjhhnrjrrntlmhzylwtyjtjzpwymitpjzjhihziimzzzyrngrzpptigwijjglhprrlltplmnhptizhhglgtnnryzmrzrywhimljizlgzzwnylmngywmwwmmplrnjrwgyttliyprtzgjmzpmrhmrphwyyzntjwtwmgrjwgzgimnzllmlpyiyywltzwjtinilninphthngmjgnlpgnyrmwltzpizwgrpjyhmilgnyiwmtwtlggyjzrypgpnjprmhptrrnnlwnnyjzhhrzlyylmrzgpgypwwwwhwjzinglyiwtnpzihgziphpmnhyjlmzgwpmwyijznhmpgttphjnypwimttyyhpgmnmlprwjgirywjyzhmjwmggnpwjywpmnlzzwlypghgpglimgngwnrpiltmwgzrmizlwtjltililljzygjhhljjptwwgrrlnltwpgzmrphmirtngllngjimrmwirhzihliizhwtpzntnynpnzhrgzigtzhljhyzjwinlypwmppwwlhzmjmmzyjzimritiwhhlhpimpwjhwggnghttjyizzrwtyhllnptynjrmjjmtrynizttjhiyjmrnhhyhtzzzlnzntnyyjrmmylygiwlipyjprjtijtinwtywtlnmtmjtrrjjyzpltwymwmmnjhpzlnnpyymlipghtrntlmpmppyipmnhzizhgwhzwzylhnglmrljzgittimghngznimimjrwhwtzpnnrzgiwrimphzlyjizmlnyrgmtnltlmrtyihilllnnymlppywpnzriijjizjwptrnpjlphjpgntttzznhnjlypngywmnpwjmwnwwiltyhprjmyirgywriwglzwntnlilmjtiprwttgwttjlynplwwlyzzmgtzlrytilmwwzyitnrjrgpglhlrmynmzljjjmpphgmtrmrryjhnngtghjriwgmjtnljrjhmgintrgzttgrrwrtnlwhwinwniztpimlmimpwpwrwzrgjgrtwnnpirghwlglgygmywzpjzzpplmiymhlwmmnzijyjmzwrmpgwyrzjmjlgyziigtrnmjhnlzzhylyrjznmgphgyrirgyjljlnmzmywihmhyngtyztnjrrzzzzpjzhgmptmnmlrjwlthhmwtmzgnmtjipjyyhjpphjghltyggwwwmlhwrmhzrwpitmlyrlziimyhmnrlwttiwllitrhghrggjzrnnnrtmzjthzgznmllghrpyrpwytzpmlzmzrwtzzirjygzgtwmgtprwwlpywwghnrimlyjgzlzwlzhrzgzwjnilitprpihtiwwwjjpnjghipgzphnljrlplzrzwjgjpjmnnptjltgltptrmhwhnwhjhjlghtmzzwtrwntirwnliygnyynyritgmrrhnyriphnlmgynztphyhmnwwpmihyltmijwwjmzrtinngmjphwptjpgirjhltwiwllzjymnjtlpmttllzmzgizngzlhrpmimiryipmltlhzhiplyrwzmpwhrhnjhtjjwmywmwtytrhijlyynjgjhzijzwgtlitlmgrlzlmrllhwljglpzgyygtprrwhpyzjpmtnyimjiiyyywrymnwptphrmilrgzipwhnnwjmghhplliiytlhwgnhygiztjlwnmiziwwttihwnihtjltlzjnijznlnjngyphnyrmjjyzytpyniimwlizhjrynzzllyglhhzztrhwjwzhjpypriwgrjyjpyjwrhhjwwtpwphrtypjgyihrlnzgjhjwzwnjmmmpljmmzpyjtwzjnywhhtryiryhgyihwljjpnighpgrwmtzgzpmtriinhyhtiyyhnpzthrrwmilzhmzgwyryjngggihwjrtzmjnlhgigjirytrnziynpywhizgymtrgirlnzjnhwiwzrwihlmjlllntjiiyihzmpwmgiihiylgrprihzlhtwlygrwgrppzgynjmzplyyhilzmintwipnymprlrzpppzryygnymntpnnzgrtyyhhnnmptthrjljmhrzlgplhhrwrjpgwwlwtwmyzmnpthgjgpzijtyzpirhjtmttmppimllwmpwznlywzgtpyzzjyrgtwylnnpyiipzgniiryryhwtjgintwttwlrliprwmljgmiglghihlmiwpprtjpjgyrwypnmmpriphjzgrmjpyhirwyzhzlphttgzhhpmwghwpnlhhrghmthgjtnmntrplmwygjrnrirwpywjjwmzpzyytziwiywzizwtyrjiwlwmzzglpwgrygzgygnjyltryhipgwtlzzmzjnjptnmmphnipgtptlmwirylripirnhhjilmlgnrnyjptwrwtyjjiyrtjrhltjighntnirplzhgwtgwgzjjijrnlphrryrrjmrpizrtzniwtptmliwlrmptymhywtprwnnhgptjgtmmynmryjwpppmmlwitzgjlmjlrrtnwhhwttjhywwwwhprwywnhygthnimnrhrltzwtptiwtmwhtjngplhwghyriznhwntryzntmjtngwipwwylhhimrwwhllmmwgiyygllpnlzzyytzhlzgphpmptlhmwjwlphltlwipgmnhlwpnjithlprrimgtwwppnwjtnplyztyltrmghznlrhggpyjwgjinhnwyjpihmjgmnyrjnnlhhwlgnrtynprrmwplptiihtgrrpzwyjtgmgwyyjmrwzpjggyilgwwmrngpglypjmmpwtznihltwlrllyynpjwzlthzphmnrjrtrjljlnhjhnnmwrplywywlgtgizppjirnzyhithihlprywltzitzhgiglnrijgwnhtthppgiiznrigtriwnznnjhjygmngtytzjrghlwighypwyrrmpwhmpgrnmtihyyzmwtmgntipnrmzlwmgwmjhzznnnhwripwjlthrpnmgtpzpzpyzhizhzrpihiimhjnyjtwprlirwznzpthirzjhmpywzwirywhiitzllyzjjhhmwzrhnngiihzjmmrhjhnptynnhwhplzrtplmmpmyntmpttjlprrtmytmzpihynypppnjjiplrjitjzihighmyrzmmgzipjliprrmwhnmlnmjimjjlpwynngthhwtizjglyyynnlzjwywjlplyhtgzlyggnrpwlyllnnrhpnnhyrtlyihrzmgtmyjyrjjmliiptizwwwjgjiyppmgrltmhiiniwygmlmrgithjrrjznrplllypirrljmripminlpiztyjgyltpzywwyrjttzlphtnllnpnitgtmipymywwgrlzrzmyrphjlyzrnztjyzhzyjhizipthyrptngzhzihzltmpgtghlpwznztntntwmrwmpplyihllgirpmhljyzlghtngzrnlpzgprpnnyljhihgmgjphityhyinmmpymwtznzhlywytwrmgljlwizhntwglgpjrwytzhimznigniihjiwmlhthzrpjitpzrzwyypjptjrzzrijryzwjyjnttilrmwmihiztztmnhimlwimwrnjymgnrpmlpmzhyjmtzimgiriprjwnglzlptpznzjhlmnnwrllrnlwzztmrplzpggizmzlmmlhlwiwjrlnrnpjgtptzygznpgwglwhhtzzgthgtnzitgyltzrlymhhzztgwypzmnitnnhrhgmlljwmwpnnlzpljhyitgyihpnmjzwnrwjttyrrlgwipghimtymmigprmzightjthrwypnmlnhtrmmzwilnriwywtzlygjiwymzmhizznhpmmlhttzngijrmgwjrphhynrtimzhtnmlwhwjylrlyzmnrznmlyympmlylwpmwlnjhwhlwnhjpmrryyhwrimtwgpzymlgmpgytmjlrhwpjpwhwgzrtipiwtnntznmypzgtllpmhylpzwtthmjryytihwzitjjtttpyrwpjtliptjtpgwwrpppjmiyymmpjhrzhgrinitijjnprnylzljztztriwippjiprtwiptprwzhitjnytlmmytlpwnlgwjpytryztilwrhwtgpzhlzjyggrgiinninpjiwwiyymgpjrpizlpiyzwnwipnnnmryhgpimmrpzjhhtzgrtwwztpyiwwzwhtijnnjrttmygmijpgmtiiwwmjhmnhmiglrtppyjmnmmmtgphnnthgpnzzwgnpnjlmzigzlwmylhhpnngthtgrzhmryiwrmhinhpihpzmizghngwtintyitizpynmjrilgnilytjyylimztyitgigzynlmtglmhtzlprrrwzirhlzwpgmihrgpmlnphznlnmylzglzytwyrylpzgpnhrrpygtnjpiyzzjhnnwjhmyirjtrphwhzlztlllyizihlgninwlnzwpnjgriwhnijjznhmwyyjirwznwtjlynpnirpyginhnrrthmjnwtgmpmtgrllzjtnhpghyrhhiprilhzpmhnpyinnzhrlljhnjpmnplmhytjmwhynzplzmwmrmhtrlgmrnmipmjpgzjmnzwypitnzrlwirtnglzwimwwrhzwniywzmpghmljnpnlmzjryypnzhhjgprmzhntrpjgzwmhpinprhhpzgmtmzrpijlghynnwzzzlnlywhwnttlhltzithmihmihtrgpjlypgzlijtlhlzngnizylyijmmwyitipmigtpwrlmjpwjjipnpmpznjntpjgmpijrgymrttnztjtwiihiwnngigzltpyyhhhwnyjlmmwnjjpjrrjjlhprptwpwglpnjrjhwttmyywjmnnpzjmmzpggjgmptgrtynjlnlltgnrggwgnmyijimrhwihrtttwgzhinmmgnnptgllzjltyliymwpntggihlwiwrginitprmlhtwrtllhhginpyytmgwztyjyyrtrmiwjlmnpgmpryzphzizjtwmyjhwitthltznzzyzwinglrtmijyrjgljhmtzgnwjzzttnrpirrjjntjzylptpwhhyhwgrwwpntynrtwmgrthywwliyynznntigytmigniiihznptlhzwhtirnniyrmhlymztwzgtmligyryylrypitlyglpgzgnltinpihljwrjhthtwiwytpinnhhpwgypnijtjhhglnypjwynijgghhrzipmzmppmmmmzwwnztnzhlmtpirypjpihpznznpjrzlgwgimrrnylpnjzmjlzghzhjlnnnjngmzzjlztypwyjzzhgjtmrpntptphzhlhzynmhhypryjrzjtprzjjnrnrhjgwtltjriyipjgnhrrgyrrmjhlithizimwltmmiwtnjwmmpmihnzzmtrilriyhimgmjwrillpptjjjgnjjzigiztgprzplpwhthnzphwzilyhhnmhtynjnltjwymzrljjlwjhtyhhitlgjztglpypgyypypmtlwrhygwyhgzhwjwzpgiymlgplztrgtwppnmypppirymwzinhijrjjwpimmztpwhrtwprzhhyjyymrrwthrjmhijgirnzglynjpmlnlgrtpplhjighzlwijgingrwlzrngttyhgzznnntnmigiymiymwjplrninpirjypjrijiptilpiwpgyyttrmyhjhlilgnpjzzhptthijrjmwriylzythzyrppglmminjggtjygthmwhwmttgnwphnllwryzmwghjrziztzynrntphlnnhtgynlitgpwyjwittgtmrmznjmtghmyhpzwljnltphhptyplmymgitzymwzwpnnwlypngpyrnwgtzhyyhyzgyiwzmprizttnyiltzltmjijtpnlynntjttthgnzyytjwlwhngrryimimtygzwilmzzppriwizlznwiinnhrrhwiziritmlwgtwwirjwjjhripgrjnmpgmywhypgnlplymtrglyygzypiwlwyghgwizjwihwtwtgminlmylrprymmjnjllpnmgwiwggrjmwyzhgmtwglgtlyggtrwmzyyzhtptmripzylghpjjmzgwltnjptllynpiynjyrztmjjgyjlrgilzwjjlggnwimhmgyhittmmmjjrjrjjlwphtiynghyiyiirriwhhhlzhlgpmnptnlzrwgymtjtgymlpnjihmtlhzptpmgmwgpinnyrrlwzjtgypmyynnnpjwrhgnntrgtypzhygigpyphyhhpmhnyihrmmtzinrjglnhimptzrwlwtgiwihgmwitzmjlziipzwtttrttwywrznywitzljpyngiyhlliyrwzrwyzwwnmypjgngmmgnmyizzgznjjntnyzhripywnnjyjmwlnlhhwphizpmjpitprigghpimphiyhtmmiwpgpzmyptnpphthwlghmljylitryrwijpgnpppihilgiwznlhttzjynprtgzzlzrjtmjmiytmjrrtrjmzpntyjjlihytjhlmwwnzwrwtmlwpwpymphnwhwgpljthnpwilimnlpmityrmpjgplzrymhyyzgmlhjlpmnrngrznppzjhpjpgnptjrihjrrrwtizgptmtjrjtwzjhlzzgjymijhllwjyrtggmyrtmjprljjgirzwihwlgthgylwyzryytjpztpwwrthnlhmwzmjhiwitggmwmyrzljprhnnnwzynrlgywwljtiihrjgtprwiyzthrnmpyghrpyitjymjgihziywnyplrwwygjiltngigmwjgpltjijylzpphlpmjggwjhhzgyymjiwpnmlpgyrwzghtyiwhhjirrhzzrjywgthwjpngwrigghmpiwmjiihrrhjlgwhipmhyywtlhigmmgymryhhiizjirpnzmiwrpjhjlygzlhrizjhnitgtyinppzjnwymiwylpjiihmgwwrwmhmzwihwrthtwhlnmgirypglpigpiplpwpnprjngyglinthprliymgnhziyplrtghlyzzrztmgghjhjwhzwyyjtmnngmrpynnmrpghtprizrwiwjypyltwiptttwizngmltrlgjzmmtynmhtgzyzlpypnzhnyttmttwtwnnylrzllmpzjpmznihzmnjhhplyhrmmzwnmhyjjpiggmpizrggwrzlpjhgjmlltyrpjpynjzitiwlpgzmwiymjryjtyypmwtyzyyplgnpyngmtpzmprjlnhptpgptwgrwgmrmiyymyyptjypgnlhwhgtgirmzgyzwwztjnglhjgtyitngpwigwpwghipggyhpilrnhyhntgpzizglmgjpzziynmpytthymhrriwgrrppttwniwtthrwjrpjzittzlhyjwrmzpwlgmpngwjzztmiyllnlrwwpnypgttriyiyimpthyyiwmhgtnmrhzjznzrgyjhpjnmmhgmpilhttgirnytthtznrwjpzzttjzlppnhmyppiznlinlhjrgzmzzlynzgzwyhhtpnlgppiinzwnwrhtyjzrjhnnjwtjzwrlligzlyyygzhwtmitwjwjwmiyjlljjmtppttypiytwtltpmwwngriymgwpyyhtnnynyznpnwwjngzptrzhwpwrzrnzyntwtnphwhzyrlipyigpyyyjhghrlnnlhzrlhnrzjnzligyihmlzwzngtgtrzlgpnmtpyrylmtyytjhrwtrzjlggjmmnywhjgitiwltyjglitmlrmgrijtzgzgyngijgylglnltgmppgtnzwztggzmwzmrjznlmlzwgzpjmiwimzmrtlpwrwnirtyzrzmhitjrpznznwrrzmhyrrijytmgnhzlrpjmytrhiprntgijgwhlytjwmmzjlymwmljznrhypjtihhthjmzpyrhpjlyphgnlwijhpnjljzirjynrgiriwyrrmyynwjjnrwtwyrmmplyylwmzhrpywmmpijhmmzggrhrlzpijnlyjrhnyjjrpylwmwlzwhiptllgnjyzpgizhphnrztgpnnjwrwppptptyrmgprmphmnilipizwlztzryhztmwwwlzpnyplghyrzrngingwrtmhjhypzpmmyiyglnwynghgrwgtillwjyylhzignpgnnwiwlntghrlnzjjrgzwwywtrynjtyirnygnlytiilirrjzyyihihhrnwlwnrmtllilthptiplimrnpyizjgrzwhhrjnlntizjnjznnyryppitjpnwmgryglillhggmmyynjhijhzlzpzwmhzpwihrywmihrwppznzmplhtmygrznrwnyrppymnhzllzrzpprpyttwpinpwwrnyytwnjwnlpngzjinrzpmhitgpzzjwhiitjgyzghhptigyygwyyphglhgttziitmwrgpgmynmrrgnzjlzpjzjmzinyyjriimjlmzjztpmrrlgpthitgmwimrrhzmhhwyrwzliinrprglmghymmiygllinrrriwztijjmmlyihtrwjyljwmmmhpylmlmwmhnnmgyipgrlympgpjzyrmpzpjgzlhiyzhilngzmwlpzzintlnwwpngjznwiprmtnltztihrjywphjhzrnwjlphhpzlmjtrnnyjgtjmygyjgynyntyjgyjtnmmyjytpiwtyrmjyyytgrziynjripzngtttimtmhwymzhyyywgltilytzzzwngpwztnzlzwjzipmnizyztlyhzhhgiryrgwhphrihggjpgzzhnptnmwjgwhiwrgtllnhghhyghjjphpimrptriwtiyzgylzrwjhinwnyllnmmtwmhtjgjhyypphjzltrmpzgyjihyttjrhimllwpwwhihwwllrwzmprjywwimmnrhwllwirggljzyplgwzrzlltlginttmpyzgwjmpgwiilwzihppzmnhgyhthllgzznnygpwniilmnmzhhwwrrwzgtprzwrpplgwihijmprnmzpzwpypgtrwnnihntpwjrziyyppnhzpnyiihjlrggzghtpnljgpjhhthnhwyprzzntwnrizwjhghiyrlinitwjymwmzgwnjtnpynngjhjntgrthzhjrzjhinwyzzritwzrtmgrggzprmgjhwtztnmrzjzhmjgppjmgtymrhrgjyrpjljnhphwwwttthgltlrirljttrzjpnggtiyjlmniylhyrizgrzthmllltwtgtnjjmprlztlzlngwzjplzjlmggwzmnwhlhgnrjpjjingztnphplzgrjrhzignzjnmzyywylpyjlpzllzjhttirrhwhjjtrjnyrriwlitwphrtlpzwnigltrpwlhighthwmynzgwrtgrlwwpmpnmhjpnyjjgwgggtgwlhtrwtjpmrgjhwigzwzghyzjiyritliirljlygpgmtnztlrthrgrjwpjgtprylmizrngnwilnglmgpnrjinzwwnmlrpjjtgjliliihnzpnlipzzhpizmpiyijllnjippmiwwhlinjgngpyljywnrlyrhghmpwhrrtwziwhnjrgngglnmyntmmgymgmzwyllhhnnyjyhzmmnryrhtipyyypyrthlzmipwlghhyrlynwpithmhnyljmynlnjjiwmtwjhtyptghrnrwywrmiyrmtrylmithttpytnimzjymlzjjryzljnyljzgltimyhjimzwthmwwgzwrppzirwnyzwnrggipwmznnjrwlhzrprwmmgrpilplmnmgljmwizwwpjplzhpmlhmnznnphmjiplmithzhznmttrjlyrggwrhwygttppihwnnpiyryznlzttiglymprjnjhtwwztpniptjryzntnlpmpnwjjrzmljtpjmrzyijlmmrggrhrgynhmtmljiplmytlnyryhmpnnjnttliwzwrwgyprmzwlhwlnmlmlgymjwwjzynimhjyrzlmgiyjhimyiwitnhmimiggngwinngtynyrpwrjrzpmrlinppmmyjjmztyhwnghwitiyillzpmjhyzmlyptmmgpgplijymwzgzjmmlghtlmhnhipwhnprtligzwmhtinthjwrhmhiwjizrgwymnplpggzrmizlzyynnphptzyirnwrgtpmmrrhwzziryhnmipptywhprwjtpjmligyhihmwrjjlwlmthtzlymrmtpyitthrwpihpglyzwnthpijpimhtpzwjztytwgmrjgprgwnyyjlhtzmliptinynjgmgnlmnrjjggjpjjmgzitnwppmjgiytylyitwmlgjgimipjiltmzhtlhmirmgwlhwnrmntnwynzmlnzmwlrigrhylrywzjhrhitytgrinjlgtytrtrjipmrtghtilizptjhmtpmnzpjytlgygnphrmphmrrnrmhhtwyjgwnylpipgtlpnlynwghypiinzhphyphpzmzhpzmggyiihzrllrppywjlglhijwwzgpllhipigmhjgitzmzgtrjjrihzplrwmngmhtplirlzrwnygggztmpzzrirtzzgnyrhjywjzpghwhmriplnttltmphmmzwlyhrwyjllggztmpzgrijhipnmwjgpjmgyhmrltjnjgylrglpngjjlpylhnjnlytlipgzrjrymjrryjmrrnwnillmwzgglmigiilwpzwzzntnjnghiilpmnlijzinlyhlnrjjtymihgnntlrtyiliyhlwwjrhlwliyhlwirthjplillynhilntmnhnnplmrpnlmyhjjiwmtinipwlipmhyyztihtmywmpmmhthggnhzhlynlpthlpnwtyijrpwwhtgpligptyyrgtylhnjmjhizhwwjmhyjipnjrzypynwrhtnyglmpznylzwyznnzmilywzgpzzzrlyllnnzwzznjniggggwphhljghnpyzrwhpwinnywiyzzrrpgmjrrwmhriwnngrzygipywtnpzmmgwmjhjwggtwlmnrlltyyywrrtizzjrllrnwtmpzmjnrrgtizzzizriiitmmrhpmrymgpiimwiwtgwylhpwpwrinjnirppphlpnnjlglwygwryynmlhwttwzmppygmmnzyipgpytjrhyhjzyrmwwtylljggtyjjpnnptnyttnwiynwrminznimgpwnryrpjjmnjhihwrtjlhnwynlntrmjngznlijgwhnpynynpprpgrjnphymgingyyzjztlgymyppnrihzgmwnmpywpgjgpwiyhwwhjhwgtgzrpihmtgpmgjzjwltwryrjrlwhznynzpwlwhnjmlljptlgwplzynymihplwhmpjpyhynnrztmgrtirnipmmrhziyirhprpmgtzzypwynmwgwthryhpjwgnithrrijnyllilnylrnmwjwhnwnnilwnmhizmhgtzirjzltmwtpytzrglrwpmpwnnzjiizpmjgtyzihlllmmnnrrwhjijytmijrwlgjljjwtimmjzgjjiwpppzwrpgyltymypzjwhntnhinzjzpmniitlhwlgtlzrlttlytihlzytnrihpmimylhgmglrtmyrhtnttpgnintngpinrtrrtglnhwhprztimnhmjrztgjlgliphrwtjtyhmglmmripmnwrtjizhhjjrzttgjmlwzygllngthnmhjmzmzpztjnwizymmjttphmgttmngrlywyhjlimmwpplphwjjnynwmitpgptrgjingyzpiyiwzhgnhgiglnhjnlrgjinhrwnzrnhghjilhjwmprnlzipwmyhgjnziilhhtztwrzzjzpywjrwhpghnnyripylrlmrnmhmrlthjhnyzwmwrrjzhmppjhimnjmntyghwhijhihnlznhyjzrlhpmgtrygwitpiilgitztrmphztirrpiihiwpzpjjljznjjhlhgptwzjhpwwrgtppyymrhytlwgtngiimhhlmgpziphwwlwjriphgjgizriljthyrnmypjnlingypyzjmmrhrijglplgljjjymyrttytmhlyhrwnthpthplijplrmhwygthhmnypmwjttjmjjwgljtrhwtnjrglzrnhmihzrhzmrttjniijnihiimyzjrgwwijywggrltiwiwjthlwghjgjwpzjjjjrmllzgzmzgytytyijhgjlinmiijnyiinlilmzynyjjghliyrpynlrttimhpyirrrhzwhzgnmjhnwggtllnipypmnjtmrmhwjwgpgrmimhrrnpljgnpzwyiyplplrzwhnjypztmrwwzilyzzzpngzlwtyljmrjtriirhtygtwmzznwlgttzirigipnpmhnnhlpjtpywzimrphirmjrgpggzhzhwlmtgiprwjpjhjripwryrnymyryttnnrnmyzrylrnnhtnjlimzmhlrzthpwgmzgtilmzriwmzzigrtinhwjtrzwppyhrzilhyhpjtyjjznjnzhmtjtylnpztmymmlrtgnhjpwwgizyizmtzmtprytlllhjphlnlhipzhpmhwpjyjpjjyzwrhytimtipwhjnmgghjnilnirylyljlttrjmjytyjgnhmtiitnitgnryzghmljhjjynwtwnhtntplwpgnypmlrywiytttyllpnwinthlytliwnrlgiminhhmmrirjnmythhtzjzzgzgllhjgmhtmijgznlpiwzllrytprhlpyighhymmpzrwjigjjijjmhwgrlyggrihigwgymwlwpppgtzwrrgmtigtlrjgymymlhwnwzyimhtmlzpiymzmztyihwljnpznipgimtlyglmggpgpzpyzhtltyjtgjiwwytwjzizljjhrwrhhyttlzwjtrhtijgmytnittgyjtinigygtgltmrttriyjitwhmmmmzwwyhzwzzjlhhlnlhrtrmntgrmzmwypgrgnrjwzzzthhnwwiyllmtwiphtlwhjlpghlprzhtwylgggjjgiyljwrptlipgimjwtjnyrgptihiyilgtltgtpgzymrttntyhzizjmzjitwjprhtntrpttwjmzjrhlrtrttnizmympphlpmtnnnzrywighillhjjztphjwrlwznnliprjgwlpgllrhjrjzrzzzyhzzipjmztnhmzrwmggjghpyhpwhpmpnnpmgnhnrpnnlnigyimnnilnpmwpmtlznjnrrwltgtlgnlrhryhlizlnygjyjpglhmyrtlzwtiirjplnjhytptmwpihjzyytjhlrhjngirmzmwjrpgpgjtiypyggjzmzyyzhglrhmmpytpltpjzymnwzizynjynpngrntimlriwtgizilttgwpmiziriwilpgwwgjtwnygrlghgtgpligywginhgmrpwlwnnlgwnjwjirhrrpgwnwmilpiymznminilrzmyhhiwnmzggrypttlitjjnjjpphnwwyhwztynmmtllgmmrtjtipgpzplipiyhgiwwwpwyzjlmtnmwzpzzljpnpipyilynghnhznnhlitpzlinwzjjhhttijwpltrpzmtgmhiyyyjjwrwgwtghpthprypnzlmmlnmhlmplwhtimhgtnwgniyjimigjzjggpgtmyipzwwlrrwinptwylmgjpjrgngprrttitthmgpwmynrrwihltpwiyrljzzlnihnlnzzhhwtwpggyjnzrzntmhnhhtnpwiwimipnpriirhrzplyywywwimpnwttilgimtrjlihniywwjittrrgwjmyppmijjzwphmygmmyzzytlpgiimylwpwgpiynzplgnwiyymwjzjyyptnhyphzrrlwwhzymrzppynziilgmznjghjznhlghjphnwrhznhrmwhlrjnzzgtpjjptyytnwgtynhjjhirnlyggylpprwpziprywpnmzhtywwnwwzyzmnjjnyhpizjzhnlitnrnjtyltgtwyztntjrprwtjptizhnywrlhinwyrlnynmhwlpptytzwygjzgywgnnphylnltyplyntthmpwzywwwnzhhpzzjzmwhgglwhjzrtntnntttgmznhpmynryngzrmhnhlzgzzyjyjhjjnjpntyplmipylrtghztjghjwtzhywwggttrwwznpprlhttilljjztjitrmtmigmwyzyzpygwnwhpznzjmwrmwlmrrjwjrgijyylpwylglmprtrypyzpyylzhtzlppgwpjplgllngwlttpijmyjmjzrghirprzntgznpmnznwrwmmtjggnglnggzpjyyyhztnlhzmwzrnnmgtyiymjjgjginprmmpgignwjphzthwpyywiglyjpgmhjighygpjlyngpimzziwztrpthgnzrmzjwgtypzwjrrilpmwnjzgiimzwtzgwjwtlprjrlmhitigtnjrzhtznrrityhihgjyrhrwhgnwlwpnnpimryjhirnnnznlyljnilighllwghytrgjrimthtzhnzthiirgiwgygimwrylmthpjmizptmrynhtwmrirgzhnhijmtmnhztytntgphilyyjnpgywlwpnmwhzhzyypjylhwlrzrrrpphtywgphtpzllznjtjnnyytpgnjpmnlghrgilwzjyjrrjwmprrymminjgiitggyyhhgthtjtlywymghwrjnjmthzwmpinmzzitnzljppzjiigjizrzgrhttyhrhtnrrmtrjhlngripngrtjzwhnjtgzripphwyjyyijtznylnwjrnppmtwjiwlmwwlyyymihiytinpngmhgttygzhrrinnwmztnztwiglyzniwpyijliwnrplwrhzjmtrpynnwzpllrnirgrwyytzljlyytnlitpjthntrzpthnpmrthpwwhlrjjhgwijgppjilwmzzmmlhrznigwijtzrzrrlhiwipzgnyirrzlwrrgprwylzmwigiiphyjwnnzillmzgtppjjryzpinmwzyhjiwhiirmyrnglrwlwiptrtigrygtrwynzyrpjihwmplrnlpyjmhiwzijjlpwllpnwrititwrgynglittghwzhryyythlnpyyhgzgrhrnhpmjpywrzzprigwzrlinjztgnjgynjzglrgjizptrpzwpwwwwwryrgpyjynpwgjmhrmyplzijpmwmpjymntpypijhygwghhgipnhjjnrrhttpityrrljrjyyingpjpnmrmpwwlthtylzzjhzwppryyrpnlgliwylzyhtjwntrgnwngtllwjmnmtgjtjjhrmliiilmtzrznnrttrtpllnwjttpwyjhlwjltnmhttjmyhtyzwypgwmpmlnipzhnngrhwrrjgnprzhnrwrhphhzhltgrzriigmrjjjrlmgwprrimgzglzmyzmwptrhnjhinwwlgiwrtmwymypjnygtnrljjmyytpltrpyirngrriirrgwtjtzwzjiiygngnjyztgpnjngwjpzhjjmjtrrjjyrnlmjrrhtghhmnnwtglymzlwjijtttjrtmttyhmpjmiipzntjhpypnjmlzmglihmjzilgmgplpwgzjhhtnrlrhzjmgjhzttgphgrhhhrrrlppgpwzhlmnzjyjmrmwyymnihjljiztjmrrzrppihhniymtlyhwtrzijpzwyiwllgnjmrwlljjlggniyhplnyhitymnlthjlyjpzlmijjtjplgmmjpigztiljlgnmtnljrtyynlzwtnnzrhlppwghzrymwtmhirzntwmmirtptlpygpjgnlmprjngriggwnmpyjylgpgyjghhrtigiimmnhliigjhwiwynjllynnggwiytgimhrhlyyrgzjggtjwpnlhmtyhppwrihipwhpyznyiltnnpipzhzjyijhplgyrrizptwhglpigpghnwpglnnnwlnmgmzzjjrjzhniphghlrlyyjlmjhpnmlythzmlzhtillgnlrlgrrlhilzigzrgtzmwmrhrmytljhwzjihwrwhprzzmhlmlwghryzliipzznmzllmgzniiginilnmgwigttnzmltttnpnljypjrppirgzmjjywnrwgmzjzrplymrgjhjywpzwmnwzryjnzmyjylhnlzwtllzwzzzrniilgjhygnlyijijrjghghzwyphztjrpjrrrntwhrhmhjltmijjgmgzhjptlyrwnjyhwyylwrthmgrrwmtyzzzyzijwtzwphmmmttjihpmghyjlynigjprtgyypggnighirgrgghznyjhgrrjpgrrlrgrtyyttwzwgtrwmnrmjljgnwtthzirrylmijnmhhnrjhyylzmzhwpnjhzjgpzrnhzpppylyjgmynnyjrypntlhppmtwrjyyhmimrtthiggrrtzjhptmhjtrmizjgttglwtnjlyrwjhinhznrwmhygjzzhlphggytnhryyiirrwhymhyljhiiihpyirhgjpplnjyppprwtmlzhmintymyzzihrigmmhrlwzntilmngwwrimjynyrjlpzrhwnpjpzgiwzjpprrlhjnigtylintjrjhlypmngjmthnzppnytwpnwtgpjwigzpzhlmrpiwrzyyjtiztnnmwgzljimwwtmjhwjhwjggzghnirtwjphrjlmlhphmgzzwgizzhtmrnwttywtlljtymymtwyyzjhljhhgmmjnhniitgwhmiwgprypmgthlhzhzwijwtighhrlglpmnpjmpzzhmihrwhlpinlrigpmhwtnynpgtzhzmmzmjrwtijnmhhgirgwhlmznlpwthjmhltiptymtwpnijwttrtijyjyntrjgiyiggjjigigjmmjllihgrmnlzttpizrrliznjhhigmrjpitprgphmtgrnppymirgmnrgnhrtlmpzztwzwzrmgrmlynrpttigwgntjljzzglypnjrlttipnyjjziithgrgjgiyjznrgjyymmpihhywigjjjlhwgtznhlztlnnwpwmlylpwiwijhmtyilrrymnntlingrihrhgzgpwytyrmhlpiptzwjmypwnmzjghhwlnrprzpnyzgzjwymgtppwjrlgihyrzizltipphhpllyyjzyizigglitwtgimwggmjwilwgtpnnyjwgiwwhhmygjijyprzphlynmlmnywiygwlmjmjrjzlhgtzzhjnwnzjtnirhwihnzghmmpzwhrihwiyirmhlittngzjtjnhyhzhwgtygrlnrpytnjgjgilzgrzlgmjhtillipinlhrzmrzilhtzrryylzyhgrtgypznyjnhghmrjrhimgyrzijlhwplyznrhnhmlthltinwriyjzlmrrrzmyltlryzhyyigmgigigpjrngrmpmppnhlllypzzrpnptjtznmimgtgzllgilzttghthymgttwmrrnyphljtltwnrhlzwhryylzzmnznlhlgrtmhymitzgymlmtilhiwrjjjlgmggyrwzwzmyzhwmzztphyniwjjmyjgwgzirlzmttmngitjimzzziihpjrgjllihliryilztlrtglwjjppzgwnztypjgjihinypzilgnliynljhnzztjympjyyrhytizjyjlhzrwhjylhthjwzrmpgtwjttlwgtgnihwlhtliwgznimjimrzyzrnmziiyhjylrpwylpnjnyizhimlwjtmtnmntyzmiptlzzrirjmhwywgyiitihgzypwpgywgtnjhizlrpnwjiwrlrphgmllginiwrmnynzpgtzyirwrwzhiwrrjjppwprhjtwyyrpwgnilmhnhlrtzylhngwyhzzpnlrywigitmlrgpznjrmgnyttjwingyniimlgrypnwrnrjizjlwtmwtgwrmizwmnimgjitnrnjyprhrriptlpptgtjmjzzwmwimrnnwjwggwymhrwtlpnhphiznyhlnjthgnymynyytzzptjliyjwpnptjrilihgzggmijrwpjpzywrlpwiiiwizthgplnnhrripzjtgmpjiiwmgjpthwwniirlggjitwwjpjnnrllgntgwytlnhllwhljripgwtmirhiitplnzpmplggpzwnmthpzwjrzttwjgthllgnilymmlitrygnmrrrrptnhlzppwyzrzizjlttrgyjnhiggtzlwngpntpyizlnigyirtgpzlihhnznyzllwmwyzpnnhhimmjywzjwpwljtritmjppnnzmrjngmngjnllpllhyngtywzmzwzyytwmnryrnypmirlgzwipjignjwttwjwrnhgrltlhlhhijglmtppgwrgitmwgwglypwphhmjtwgrhghhnttnnytiizjwgyrlggrnnwlnpjpjptizniyinwwzjjwwnwnigpzghmmhlzryirltgzwjnlzgynztmngggnijmmglygimlptpmiypmtpinhgliilitmlziwytwypnitlynpzhzwlmmztmwzirrplijnppzpynimtygiyimlyjmlylzpzjgpghhiwzjrrypnlhntyzgtyjrntlhippihptimwjwrmywjntlhtwjttlrizjtnzpzwprwwyywwtrhinwztninthmwiljrwmzrlpryhrhigyhyzrhllymgjgwllgwpnjrztywitgwlmmytrzzrlnilgwhyrmgrthttzwtzwplttpmpymlplmlmwtgtzprnnnhwyppnzilyjwjywzwrjyipgnngyylyjzjjgglgryyriirprgmggzmntmhzhrzijghnryhlnhwnwjnyinthgznpjjliihhynnglgnhggimnwtwlhwmipiizzylrnnilnywltzypnwjgthgzrlijhmwgjhyyjwnhrhizhrmwiyhltmmthphtyightrihrthmphntgzljiigmgnlnnygtiyjzhytgptwzrylhjiryjlylnmnjipzrjhhyhjpijmmmnplwtniirjmyryymiwmmrplglrgrhnprtggpnnziyjnmlgzilzlpnzhryjtzirzhrnyjhprzzpgtwlrwyyylmwnnjjljmgrwrlzmjwiygrrmijmnjytiwrjppgitnjlntylwjhjtgjtttpmgizwilhlphwlmzhnyjhtyhihpylglymywtyzzhzwzmnngnwplmyjimgiyyijnwmligtmyhzitmlnzgnhgiznwjpmppzjpgllytwynzmtphggwpwgjywwhhlltwmhnlnpygmnjrwjptiypitrmzrmhnihinpjyjrytjiltlliwrnyrigjrmllrtgmjnllgzlhiggimzmjtzjzijyttpwwrgtwtnriprmpijwyjmhmizmizywpwzlhjiphiimgrjgwjwjipgrpipmhwggwpgrinnprnyhnzjtwpljjghppmntznnryllyzlzghrnywltzrrymlznmzwgprlihhljgllpipthhjitnnmgtjmrrmiywnnitrzrmjyzglzwjihnlrhphzmyphlphnmygihplgwnmrgmmghlmlnwilghghtgrtwihmtrzgtllwyytlmhwzjnyzwnrjmppwizthwmpiwnpzzplhgjlhymilrnyprzgjrggmmlhijhwmzmgmpppyllirprhimmmpjtnhwzzzzyyzpjjhmthwhmyiitwmjpzmtwzngzthyrytywrtmnprzlznrlgnnhntlmmthwttitlwjzmhzrlrzltwwygrpgymzippmipnwjmywtjjyylymyphmltyrngpttgtmhwnljpmlmitritlzypjtwrhytryrjmgjwrwmntmljttmwnyiwmwwzrnynhhwljhmwhtwglzltjzpzgjtgwlwtlzlrtmzhjjjtlpyrnlprpzpwnyjzpympgjrjyyinpzljwzjjgmmphyrhptijttmhttirjpmlhrmgrtggplhnpgthlprymmpzhnjyyrjgnggjhmznhrmljnimjwhmhwyjttyriwtwjjhjjglwyrlpiwywrnmpwwjhnmmlpnzyggmiijgllpgtlhjjignlrtzinrnpnnlrgzhmytyhjpmwyhijtyhghpiigtryyygtihymirtngljtwrzggwwmhplnjiggizzglzwnyhizylnzzypwniymipygjnwnlhjgitrhhiizlzgwrjlpmtptytwnzitjjlnglijnhinhhnnnhmgjztlynmhitzzplypgwijtjpmzlnmjglwiplpjrlzirgpwwwhnpjjhnnrgzpzwiylrgmmpipjhwigtiylwtwjtinltmzjtpywwhpgrtjllyylrirhpjtngrimzilzgithhzyphgjhipjjrgpmyjlhimwygryzrwrwtzwpptpnzpzptjztlwmhrzthjgizrghjgmhmltytgiyzizzwryjzrrtylrrtrggjirlmigzmjzrwwhpjnjnthnphgyjmwjziiirlghgntrnrlwhlymhhntlggzytwzilhwzwgwtpzmptipwjnigjhijlprhywimhniijiztmpljytmitipwpmmzlgjnyzhmgwimpwzynihlthpplziiplzmhmrhljljizittjwrprgwgwzgryglgwhgzpggwltyzttlnywizgywtzphlpgigjhjtrnyygrnpyjjgpziyiwiitihnhmlgwptzzygptpryynhpmzlttjgilmgpjgmlthgntinmpyghznmzmrrrljlzihgzzhjzmtjjlrwmgnmwgrhjwmjrgiwwithpnhplnzzjlnmmnhnywhzzghhmhhrjtzztnjrrwhymzlnnyjtnmypllpzymnhppghllpwgigyjpthmgrinywglpgizlrtpthpijnghjrprzhphhzzrlzlmgmppnjpmrrlwhtlzwgngtwnwljmmljthztgpnphygirrlzhyihnimizhtyinhngzitppjppjnrgznlrhgzgrnlhrhyiljyrhtzlmhpgpjtpmrlrhyhtpztnpithprrztrihhmyiwilzrlyjnjjppzgzhryimpjjjrtzljwjgwyntimzizhhngziihtinwrnjmgjniigiyrhitntnpylljttgyhtzyylgwtrjlywhhyljhnlmzwyzyzzpwipwytwnmtrtjgliztmwwjnrtjwimhyzywimtimjmmlhjyjtzihgrljiptwjwwplnrtgrylhhhrtjyzillpjihwhgjyzimjlthgmnnzrwtmwggypwnwhipmzmjilitrgwhhygtyiljlmithgznplwmyjpighmyjthnlilnziwnijjrpwyyrihtlgzjzmtzmizhywhrwlnljylnjimjznigjnlpilmyrpygtwytjnyhgtmjjjznpnizrrzhwjhlggnnlmjjtgymlitltlhjtnpymiitijrjwzjtgwrmwypzrlmjrilggiilryjiyygrghlnttrgyitmgjryyiwyritwmnjrrrgypmiwjggtwpnmzypgltlmtirmlpiwjjpirwjprhghywzlnztntzwpwwrjrrinjppnhgwtprpmrtlnminyzpigjhrglhyyijrlynnrjwygwmnlmpzlzznltyhrnrgjmjnyppgltijmpmtzwpyrllwjtwrjghjlrmgpwprmyzhmhprgiyymthnyihhyzwnyjinhwpjpmlljtytrwilyimgtypiynjrggwhphghmlltizjmirzlghzwmtzwhimgmnphpyniptjtwiypziwtzpnlnwhnzltwtpjyplhzjmjmizmzrpmmzhrrwplzjpjgmrytwwilgzzwhzmpijrmppizlnmprzmnwtrmmrljhilthlrltzgmpntiwmiitmiiiggtpyiphiirmizpillrhymmllzrttngyhtghtttwhrilgimgtgzntrmnpmhzlwytiwjrtigpnziyhiwpngnlmiwiiyzypynzwjrmzhirhrhhjtrpmwwmyngpptjrwhmwjhmihgpwrtrzntnipjyghjirhpjjphgpiwymgjzztrjpghnlzgrirnzpzjgjmtwjzthplrpwwhgmhgntpnnzgzpptmnzlhiiwpinzpiziiinriwpnlzthmpphgrmlijzhrlyyttrrrtnzgliyrmltrtzwrhpzrypjnhgpwrymhlyntthhyghzynzrwjmltyrwtpppztmjzpljggnhtjmpgiinlyhnnntwrlwrijrjythjwizlltmlhritmhzhyingmytrlnznynwinhpwwpnlmryrzlznhyrzpltgyljwlmnijyiipzwyjgwiyjhwhlilpyljtpwgjhyjwhyiwjgmtrwzyiizmwlyztplgpgzjpppnypmynjyihztjzrthznjjwwlmltyrltihinilmtyjrlwnhtgtiitjhjpjlmmgnjrliwnjrhzzyyhmzhhithlljgrnwiwwjipwntrwrilljltmhzrtyjwmzzigjzmjnphnlgmygwtiwihjgmpzyjyphltzhlithrwztlmirwnlyhzhhriynhzyyylhntpjrgyywtrzmghjprgtlgygwlizwmyhyzhjyphnjgplmglimgpzmphprlyrtpgttzmznrmyyninrnglmmmizhzmtnwyrhlzhglpznmrilyywhgjngzgyrwztgllzipwhmltptiwtipyjliwwyggrjgtjghrmngpjzlhiynwiighrpznpwjmjihggjggznnnitlghihwhgyltliynimmmmyznztjglgjgtptmtjmjzhjmyzningjpzriyjwrrgyimzpgirlgmyzihigzitphzizrglpmngnwgthlwrlrwnmrmhliiwgwwgllggwmtynrhllrhhnjhwmjiywmnjzhlwyrmihnjtwpntwtwpgitjwiyltylrzpzplpjpmpywyphzrrrryzwmpwwtpijliwrggimgzpnhgzlphjnzrizprnmrwwizgljmjmnylrrymwnwtylrnyzwymmznymtziwijjjhthrrnjmgyitmhwtnnmyhhmipjhzzlmpmytglrmlgymnljrglrmllzrtptnngmnjitpjrpzlrzmghlzgihhhzphrnwprjyhtmijnwlgmjrjylwhrjzprijgliggznyizjnimmglzylwzzmiiwwmzhhzrhznpylgzmjhpmztrjtrhlmziirlnwgjtzgrwlptzphtrthyhwpphiyzjltzlmynhrmpmmpmttgmrzilypimitnmhrzlwlmhprjlwjwlmmwgnlinriiwhttmzznwhppiimmgphjhmwjizilzhytmnmnyrrlmiwgjliinitgzpiirpzrmtrpmmwrtttyyjnjwnzntyhipnrnzgzjgmjhmnjtlgpwrwprijiiwgiwhnttnprnmpiwmhjyzwwnypnhgrwyrylilzwmtlmwztwgrpzzywipryhwgirgglwywhyzwgltppyjjthgrgpmpnzhlmpilmtghmjwgwlgwnnmpzzgmtiiwniyhyihrmjmpnjyltwyziijntphprnngjgpyiyptgwrytlrphpzrihhnpiylynnigytjyrrtzrlywpwwpttrnjpygnnmlyltmmlympwrznhiyyniytnrnyzziimpwlgtmwytwzpynwzyinhjttygnmyylytjmlmjyjtlmwzzypjymzgrwjpjrijjygrmirwtnhjprmiymyhtwilimzwrlmwtmzhtzgzwwjmtijntzljmmmijrmjpgtzhitiywhnrrwpphiyimnrmrtjrgmlizgtglmytziyilmnptjgnymhipijnwrnrmzprgttymwzpnttrljprylmirrlprghypwtpywpwymrljjjnlmiihhlyryrlhztnmgzwhgpzpglpwjthzgtgmjrmpgphjnynyyygjmnjyizzinznhhlirhyhwzjwlmgwmwrpmnpwtglzizilhrnyilihjzpilwzymlmhyhgrhllntrnllwlmyznhirntwrwwtwzylgipzwhgizngyliylgirrhmijyhtjlijtprnywlglwttyyjtrgztpimlltphttpyhrljpirwmlljjwijllyilhjntnjpnplyihypgmgltyhgymptttjylmmnhjjrhngmghwznzpzmzthmlzwimwyilwwlmtjjjglzlpirnwyhglyltjgjwtpiimwhyjlnjhgpninlwtwmnmiztwwhmnwnnythljiytilnrmtgltgijzwgghnirrjtwmntrnjpypipnyjtjzgriltmlgtznmltwhmmrtgwinwzzyywplhngtiggggptyyiwpitjhzrrtlyynlnwgytplywtzzhpmmyrwhgpylizpyjjtrglthimnzhywghjzyphiwrtttglwjptthlwjzpzlrlgrgzlgtwrhwpnjwhilirjhgyrhtwzpjrmhzmtiiyzjijmhppzwlnlnjzrjnjylhghgmthhwjthywzljzggpgzzgrhrrripltjrijmlhnmtyhymznpwmgnmrinlrhynmlmitprnmzpwngzzpwmwgpnrizrrmgjmjmnhnpmhyiritmlhjrhlwrgpgylphlwwlhmgilrrwijgtrtwpmgplptthnijrlritmnjnnrjijhpzzgpjtnljmlwgtnzirgwyhtihrijhmmyilgpjnhlityyipprtyjlizyhypipyytjnhpmlgzzrgnwizjytinpjygylwgmiymtrlgjnrpntnhlrtjighrwnmyigwwnnntgwpnhnjwpjrtnizinyhnyrzrzyjjznjgyrzjizwwypwwniyziiriyzjwllwipjjrjnyghphmjnrigtjrtthznpzglgpigwjhiwmjtjrjhrpnzwnztlrwnnyhjitnhrmzmymlhljrgntyjnmijttwhgmrynlrzjrwmhwiwpzmnwgwyrygzwntmmyhwmlnigiwyrzyhjwiryjmzliwngjgznhzzjihjjpgmptiijpjjgzziinwzgjztpmrtwgiytpmnrhpmzthrznwjzmhithrghyhmrwrzltlmrmprnrthrwlippwhjwwjprzwizhzplthztywiplprtzztpmywhhhihgrmztjtzjhnwrhiptyrjzmjimmlrztmprplrpgrhtlwrrrnrjigrhtmtniipwlwhrymghhlitmmyptjpzttglzrjymyhrypywyypmglzhmpitzgghtwithgrmhjlwgzmjlyyrrtiprjylrzllhnzryrhnygpryjnpzyrngnrnnppjimrtpnpiiwipwwzilytllmmjglntnhgtwliwpjhgglnyhjplrypggwhritmittymzzpgiirhjhjzwrrnwzgwjyijnjlmlzypgghrrlhyijrryjyyhyglhzhljyhmttjzyiynhtrimwlmjtmjpitwzmhitymziwtpmrwnztgplniztzhjyhiiwpmhtlgjmhngjhippltprthgjmtnrzylmmlpwpjmwzpgwttnmmywjytijpjyyztzpjypijyjwlrrrjhzghzzwwwipnhpljzttlhtyyltgpttpttwrmytiligmmlgjptylrpyizwzyyzmiprrmhjgtttpnjzntgtnptppngzyjhnwzgpptlhjttnlnzwgwtilmynggzjygjtrlgjgnyzhzrmznmwrmthhjphlignjyryzzgtnzyjgiwhwpgjgjpjjmwwjlprgigwypznzllttzhwwmjmjzggrwlwjriiiplnwjtwhgzgnijjmtprljwlnjlyzjymrntpjyptlninytijzrlrjgpgmrmyjrhrplryrtpjzghmwggwwtgnnrjgynlnghhzmjyyymiwijrnjhprglpzylimntiygtyjinhrijrjnyrigmmrgmlygjrhwyzjiwmjgllyhwlpwgmgpnjmmtmzhhpnppiiwzwipyhrnjpzmnliwiizhhziwhnjrrzzgygzmywijrwjlngmzlhthjjjnpgwpmwzzzgjgmiiyiypthprplhmgjiwpmthyilrhmyrzilgigmywitjytmimyrmynwphwrtnnjlyjigwwynzmwzzmhyijzrlmnpzpmrlzghymprwnzpiljljnmglmwnjwtjwhpipihmnhlmllmtygztptjjitzpnmmynitjwgwthgnggtnijpgytzwlgwwttnwgmnpiprnmtrymmrihimirlmwtlgnnrzggpyprzpphwjnznnhllrtzhyrtrphgwyhjmlwwlrhjmnmtgmlmgltwmihyglzmgwhyhithymjynnlmniljymhgprjhwhpllzppnzgiwrlyjngirgwyrwttpptjmjlznwzziyjlwjihmjzilztngrmjjghwwlwlmrnlmmhnngghwygmzwplmjghjhwtzzmmiymggwnpptmrrgjiiynwrjjnjtphpjpwrhnizizwwljnhplmnrhtjjnmgngmnlwlllimnmjyptrrrygjilytnlgjwyrnzyihyrytjwhjlgnttwltytymngnhziryhhtnhgzhrimpwnriylrnjzgpjthngwmyhynwtmzlpphnltypymmnjmiplnrwirnthpjnzigrwgzpptypywrwjtygptgrhjwwiptipmtwwnjjzyhjthwintwwgmhjlwphnmmmmjjpymmjztnhrtmhltijwwgnjjgyyppliwzryntgrtlyiiznpgmwrzrgwtwnlyitzhhyrhrtwptjjihjzirlyhwyrpghwjzwltglltymnligymlpnzzjwljrznnnzhrgwrrynngzrnrzwwplhjymigwmylppppwimtzpthjhpyyyyglwnrwympryzziwptzjhpjipmtnpiipyjgrprmmltnirwrizjytmpwjmgtjrypgltrjyiiywplrwtmttzylizryrmmlymjylzhllmjgjztgrhmgntiwihjnihitzwtlhwrgiripjpihiplmnjzrmhrjrrrhmzzwnrzngjntrpggptwmlytrzrnrlnngiwhttgnzznziimhginzpjyryzmzwmwrgyyrwylzigimyjrttrrltpwpjrjjzmzzmpyjtrprrzytlprtjiyzyljjhlwmrirhzymtmmnwrrjzjtlihpwwngniwggyprlntyjhgjnwrlphrlmgpptgywnhzpgwniitlhtrljnimiymtmwjmihtppimnmzijimlhrgrztwinypzwtywhtnwpnwlglngjitnpjngphlgtglpjpjlzwtnmrphwmhgnhhgwnjiigzyljnigyilzylnymyrrwhjwwjjtigwingtwzzwthiiriyilzimgnignjzpwrithrzwryziltjwzhjzhizmiihzjzrmzlghgwjimhwrjjtztltmhglzwjljijiyywryzhnzjymrlhyhiptlgwypzjrzlzlijpnnitpjhpzgzwgnrzpjpplhnzmzzmlzrzwhitnylpyhiltpymgpyhmpwgiyhtplznmhhtzmrnnnghpmljnimlgirnnhpwjhhhmynptynwmnyjjyryimjrpzzliwzphtlyippnymthmngrmpjptlzlwhnyniptggzyjlyhlyitrzmpzrrrhzgzttrtmhithyntzipphpjnyngghgjywynzggijzttnnjjwmlmzzplnwirhrzwrhgjmlwpprwiihynmtlpnpnlzymlnhiglmliylmnrlmpmngtigijijyiltylwlilwlgpwmnlhynjnzjgimjwwgzlyglwwnrpnhnpmtrzgzitryyhyrtniriwghjhmjpngjrtrwlpyzjrwtmttpgmtiigirhjwnwmzpgmgphylnprlwrhrjphrznihprrwmjwglwwtlrmglipiynpmynnwtirlrtzpymyhpnhmytmrwziirrlwygpwlpztlmprtyywwhzjlryplwjnjwhglwnhlijzmlrgitnhjytizprpgrllhywhmnmjnilnlylhzyjgilwgwmynllirgmpwzigrzmimjrtpjippigyijlggrgrizgmiphjzhnlpwyjghyirtjytihhzrtlgwgyrrmjrmtrnlymzjmphprmtzgrwtzthnjjmiwlhlmimtnjmwmilplrhgmlnwzlzgihiitjwtyzpnyilwtwjhhjgwghlmryhhwzzmglzzgyrtwmgmlwnwhmmznhwzizirplmwhzhytmlhyjrnplrwmjgyrhjylntmijjljprhmpiwrrznhnthwwwmmiyzlrtjtgnpywyyigwmigihpwnzjhlgntjhyhmpwgijpihihnrhlllmplriinrnzhgmzthttgmigizizmhnzhgjmrhipyjlpngjipjmnznmymzwmzgpmtghmypgzigmtiygmmlgjnhwghhniypzgjtwihtltzrlpzpjlppgwthmpyirlrlzhyghzmpyghrzlirwrwghpynlljyyhljtnyggnhhwzpnjpzzzgynrprylmpyiiwngytpjzwjzimyihizgzinilytrzilpippzjpylnmlgwzhzglhymzztljrlltpripyjrllymthgtgjzwrzlhwpmyimztjjimgjhjhrwgmwtlhrygpgnplilyjhnzlynjtmwmtzgmpgwgztgritwzpngzjwziptptnhyntigzjwnjmjlyzrypwywriynnwlgripngnzwypmtygjjgiziwtilrwwrlmzrrtljrprnzgyjrijmtzhppirimzmhpjmyggptzilzlrhhlplwtrpntwpghmttzggntrgjtnwpghmwtlngtwjgiwlmniphimwpjwzmgjylmrptjyniyyngmrrghhhipzggjhtjrtljzmgtwjlijglpnhjgynmrmhhjlpzlljmmgintwlpmgwntgtzlnzjhgnlzjtmgpnntyiyglnzjntntyjnplhjhnmrgnynlphztlptwpjhgjmzgzmrzghppmynypyhmnlmyhrnhmzjtmhmmgygihtpmgpingyrlyznhngillgztzwtlyyjwhiljwliimhnlzniipllihzyzpzirghtprtphljltmlptthglpghmywzripwirwhpnttyhpyrpzmppijzthwgllwgylgtzmiilriwpwzjnmzyljjjrwhiggtilwzghylgzypiigzzwimhtylmijzppjlngtljlnljtyrpjzriypitmgrmtmihppthitijyygljhilrgytgtmtmyrjrtnpjpggnhwplpprytpirwtpntwitmiirwwjypygrjgyiltnrzyhwtyzgrzppzpyrpngtyihripmgrlhzyhwiwimzjjzygnlinyjlnwzyrtgnjyzzyjiwiihtpipgylilthygnmgmzhzjghiyngjywnlrpllpnnhmgwimpytjwhwnjnzljnppwhpyjmpirjjptnywhtglwpmrzilmyhlpygzpyrmnipynghwjjglngiwpjrnwzmjgiitzlmhtlrthtyilyjjywljjlpnzyipmrlirjiyjnrlhwgwytmtmyltlpnlmiynrhmtrhhzttigttyjtgzgtzgryrynpyymzjjznnylhwjitlgnzmjpgmhwlympypjhgrhyhnlytlgwyititimzjgpntihywyrrlwhwrwpgmmrpzgljpgmpyrlgzlwrwwjhztjpzpmyjwwjmrphtywzlmrwwpgnyyhlmjizgliwyphtywpylhittgtritytpzggzghmnlrimgztgzlgmppjhittzpjgjypyzrmttryypyrhlnwlzinggllmhmjyzpiygzzrmzmntjntriywhnjnhpyglwrztzzijlwpltplwzrtjhjnpjnzrmniwmjpzljmnlynnznmtprrrnjrmgrjmpnmzhtmrynhnyyirlpywhihphjhymjzjmyhtmjjmjywphhwhmrptntirtywyhtzrhirnmlzjtlnjwzylijzlpnpymniyhhwyrtihyrtglpgmriphimrwnpyitmhwwgizwyggtiwmyhgnwnjrphytmhpppllgnmznwmtzrtrprhphzyyihzgrlgtnntrwiwpggglimnznhzhwhlijypwiyrwjhimggntntthlnjmjrwynnzrhhmmnrptllyniplmmyrlwiphtlytnzlymgrwpihhnytyhrrgzglzwhtzztgipgzrgrytgjwhrppyzjnmizywhmgypwjhhyrjhrynzymhhihwiwwzhtwptrlmtpzrhgznnnmigihmtprriggmyyzwjptilyhijprtgjirgzlrgjrlrrpjitnhgnyzwjrhilizjtmmmltyjtznzpijrwijitlphzgrzigzymlgmjiwljtjniwwrjnnmwniwziztgryiiwimwwpjghlwyhphhghpmlljthrwmwpitzigpwiyirmzmrlnrgpjpmlmrttinjnyhjlwngiirjmnrwrlritlzynihltjrgtyiinniltthwhthmywgpimliinzmlgynwmjjiimrmmhzhniimtmljltzyhrrnprptytzpijjywytlmyjzyywztlriyjgyghhpirwnnnhmtnrgrilzwrrtjlwhjtwjlggjlmpignlpgwmljphrrnithrhhntthzrppmpynwnzwtinwyphiwznzmljiyrzyhrwiymiyhpjnwhpwjhlhywpzlmgrmmwmgpplhntjphggipnrzjgymttlgilmnyimhritnniphptzgtmyyggmnpmgtlrywpjtmznjghwlwihipzhhypmghjphiiwgiyzpwtjylwijjggzmhhignphnpgtwmgzpizmywjpizymlhmnyggrphgtwpprhhljpzigiyjntghwnjlwlyipwhhpirhwgnniwzygmhnhzmgjnnnpnnmgpipmijjmzjtyiphziygtnniwjzyztzphzngtpmjypgmmpiizyjwhmitizhwwglnjzjzmrrhijpjjwimhggnzzthimnpprylwjlwwrlpjlpwpzgtpwnnmmrhgzhgytmmyhgyihrplznlnzmjgyhmmhmgllwyniiinnhgngnhtgghwhznnjjpjptwlphnhgmtyzzgphhwpmtzthtmprmrmhrlhzgtnizlrizjyllhjtygmhpttglygzrnjtigzprjziymimtnplwnjhllngrymiityhzhlplngymmjrhwjjiynhmhyhrpmjyinnirnyylwlmyttytwigwjmpjrmghilirnyrjthiiyrlwjilwrtwwwjnwztpriyttngptwmrtmythtpwjplmwnznrzpglznjiwinjgzlynnlrhirmiyggyyitygyriijrrwtwlniiwphrihjzmnghrhhprzpylyhppmrwjgjirhnlmlgplppnrmhrjypphmjjwpwmjhljmhgrjltiwwwmywppzrlptthjymyznjwzpjjzhpmylwpihwppwrljimtthimpgzwhhmiijmlwwyjwhmmhrphzrghijziprpmpznimwmzpptlpjzrprnzygnjgiwymjpyzpgihwtjyljhmrwywgwrlpmyzwtpwtljptrwynptnzhttpjzrwzirlznpzlgywinlllhygzhwwniriyzzzigzgyjrgzrihtplwzwwhhznmgnmwzzlgwjzjzhzywhwgtnwhhnzlnzmwgtmlghlgrttglzmrlyyrhlrzztlgzzwrtlpnmnmhmmigryhmhttwnwphhwnryplplmtpzwzzzyjmwljnhlzwnrilhrtnrrnmnjnntngjjirnliztyrmhttgymmjznwthngrnzjhllyjwyggwzmiijgrigjrimpgpgrhtmggjmwlmripgrprjglrmtgyywthpymwmhzzzmwtrhigjgyrrlhiwpgiprpjmpwmhggjhrmtpnyirlgrngwimilwgmlniptilnjiwwnzzpytmpzjjzrlwhnytpmymmgwllgztjhthrhnrttppmhmhlrjnjpntzwtmghzhwyryiinhmiyljjyhtmwmjztzwgpzlmttzmzghzlimprwrlznwjrizwjzjylzytjmzjwirhzrhnymmhnpjyhpihipzwpnrtythjyjigwmpgjhntnynnggmmtinwlwplmhjnliprnpnjmwlyjygjhhygiizlyiwjttzpirnlpplhgzlhplwglwypntigipipyzyphnihiywjlynjiwtlirljgyymjijmhilyinritzigzptltzptnitjzziimpyrwynhjhljymlggliwhnjthygtyjnyjrtmnwhnhlwzlwnwihjigzmjnntitwpnmytihmzhywpwwnwghggzyppymglhgphhnigrtzyningiwmmnyhypmijripzmpziylhpjpjmghjgrmningrmipjppnnmjmgwyhpwnyjzipnlnprntwywnnzgjzylpgltzjizgpnwtynltpzlmzttghrnnrtitnznmipyyhwgtmznlgwrzhinmjnzmzttgmzwnwwzpzltwnygpwgjlphrjizrhnhtpigywiztjzmmmwlwppwilpntwlnmzjjznthrnrtjwmyltrhppplmphgihgylmwnwnjwngphwyniyltmhjtngyrtplynmzhprtyzhyrgmgrzplrrgplmpwjghmltpzippwzmmrhwgihgihniphttwpnhtghimyrzttjgrjhnzryizgillijzwjhttgntjjtytimjpnitwgijwwiptwiyzimhimhhnmhnmpytyrpmpriimhwrzzgyrrjgpwizillgrmrtmgrntzllhllmtwiillwzrnmmrzmrznlnmzipnglmlihzhihymtnlyipgtgzrmrznrgzzynwtgrpyyrnhigzjhptryglmtywngnyrgjjpphmnpninpygllytlmhimnlhnmwjnzphlryhznzlzlwigiyjjntilyihhgijrnjingrnmhnpiljwytrihmngzpjwhhphywwwnimltpyplzzgjwzliyrythtwyrzijliwwwzwwjzpnjihnlrzpwwwringirjgpgniwwirjthhmrygphwnnwtrmtpmhrrtttwwyhwzjpnijynzzritnylmngymwtihzymlljihppymltzwrtwiphmyhigmmhwlnryhtiprmwrllypmyjzwhyznhtpwtmyyyirhjijmihjplmllgrynghyyrpjzhhpmhppipjrgrpihmrnzzyigzrrpnypimgtiiphmmltwhptzlllpzhwyrzntthtmtnyltlhztjhpnzilzgwrgypjpljpgthyinmmlntwtnrtminznyzmzppgnhyhjwwlypmpynwjplztipzlpglhyyltyrplwminygiizyyprwgphjzlmpltiyrylyjzlpzmrhzyjwgrwwwmzgrglhjpzpjryrwmjwplnmymlnmmhymtippwrytzpphzlpjrwmttilihprjymmliwhtinjmmghmniymyhjtlpnhpnztmzmwntiillgwhmmjmllgzzwpnlzythlitlgwpyghrhripmhyltjtltplhipglmzlznwnwihtlrtztrljnhjyghzngnmhjmijtzgnrpylzrprhphnhhlhnhpyyntzhtggrlnnylmtgjtzmwwginmlrljrmtphlthzmigtpmnlmnitnrmgptitzwgpirigpwwiizgyywzwnzgmhtzlntwwptiyhzminypzhzzwpzgwlhtrnzwwlthmjzpljjtynzzllrrzilzwwmwjlwlyznggmlpyyjrjgmgzwrhyphjltrrtpgzmwhtlztihmyjgplywgjlhhmzjtplrilwzznrnhnpithwjjzwmhhiiyjtytrlgiypziiyphtjjnmglijnrwnpzjwgriwhrtlrjwjnwtgzrgwlmrtylhmigyyrlyinnwirrrgithylgrhmnnygnwlwriipgggnrwgpntyzwmgygigptrittytymltrhjtmgrwlmigzzrprtygtmmmwwtlllgpjghgrpgwmnmzwztyyzljiyhgylzwgjjypiypymgphzznyzznpnrjmppgwpzijriyhrwznzmrzgwgzpinnmiimiyiprrwtywzitgjymjnyzhjnliygpnrlgzplgnttmtmjwjrrrjmgtytlzlggprzwlljpwnggmyiyrninlmnjhjwrpgljmnywjnnwzpihzynyzltrjwnwzigiyjnjywmmgynmmigzlgzgrlpwhgmpnriyjhmmwgjwnlzwhryntrggylnpmjlrltlnynjhnrlnjypmiylttyppgzpnwtgllmlrmgnnimjjzrmriwwitnwylltzrwygjlgzzmzlglpzhgypgzrhwynrnrlltjpnwwlpjlyrhzhjmwiiwrnylhnphwpghiiwlrmmzjjtrgyzhghinjrmypgjyrmjjlziiynnhjngirrwilritmrgmplmzrhzngtjjwgzziyjtwljtgzpgrltnjmrglpntpjygtjmipjmrmriiywnpjwwgippnynynnprlhphmlwlgmprptyrtjpmhimyzypwmryjnigwyhrwypiwngptzgtzmlnhpplghhgllmwnirypwyzlgmnggznmmmnlitzhhzgphjnwglrzpritmmtwlihpywhzgwlpgimglpymitwriwyylhzjrmmwmwgzilgnymmjgzyhjnngrzmhziwtlljzmjngrnympltgrnpyrrzmhtzlmwinryigzniwrgirnjwjnpmiwrplgrhphnhlrnigggrgljmjirwrntjlrpmmzmlrhgwyiznzmntrgzlmjmnjiphzprhjitjtrytnzrjnhitjipzjilnrplnpprnyznrjhprllhrtyhhpnwtwpppzrgzggiilwiinwnpgpzppjwryhnptirniyrtpwilypmirppippwirjpyyimgmllmjlzzzzgiyzjwyigirihrlmhpjjyzggipzmwnnljrrirnlzpiymyjhwrjyjrlwmzhgzllhhtnpgrrytwrtmhgnggjmmztyhzmhinjnljihmrlihnlpirglggwyrhijmpghywglwihitjtngrjlwnzgjnizlltgnhmtlznwirzilhtwwhzjtjnmlntzpnyiwtmpmgwrwiyrpgwrhjrwlytnlmphhmnpjhphilgiplgwrtrtgmgzmpljjiwglgmjywzpwjpwppyygpijijyyylnylmlwjmrirmrtiytnyiwhpzhyirhyzyzrijzlpjhltwwrgmgntzzihyznghwnglpitwntmwypjnrlnpzlzymlwghlgnrwmmmhntmlmnrggylyhphhhjyijwtihimjihgpnplnjryrpintwnnlyhgnpzzgphzyjyjwijtyhynjytlythwptwhnwtyprjjthnzijhhhmtgjnzzilrrtwzgpizgzhgjtrjijiywlziihzwtmlwlmjpjnmllzgrwtrzrylhlyzinrnhmypgrrgttnyztzzrhizwgzhtltglpjlrgjmrjrjhrrwzptplzigjrzhjppprthnnwhymnzwpiywwwnmhmnhwmzzwyjrpgimtimjtpyzpmtgmmywzhzwzitzgzwihjgzttjmipnznjmgjgrlzjjymhmmtpppmpnpzhjipgjglygtijlyinpillmirpttwhwzwzhgjimgpgiwrmlhjjirpyyrthhnghzigpzhtgryrrjnrrphitgmjjlrtgwzwlmtiiigwgwljjyjwthpmtphwhhlmzinpwlmjmlmngwrlnmrgmgiyjplwriiptiyhjgtlrtjmmtlyzjhtnwwnijgnrzzyrwllgnigylywgwpygipzmirygnwlihrnzwiwrmlwwgwttmwymhgihnlyzzztmhjznhrwjirllyhtgjnzlwwlmthhiimmjmgliyrjglggzyzninnjprhythjntwrrwgnytmlizjwlwzjthwwtgjhhgjntggnhlipgiirmztjgghpjljhpzzzlhiyprlhymiwhhlggjzpnnylznmzriwtzmhmjirzzlhlptrjhyjzmwhiwnilmtmmhinjthzthzlmjnwwwmhrzgwhlgijhjipzhnzrzinznjjzhlwmzlprllllygnpwwhhzzrzihttnjltiwtmlwlythtzwighrgihmngzijyrigtnirngtznpltinrniimyzwyttzjrpinzrmhlnwglpzjwjwypzjlyzmmphltmpmrgmmppnntlinhrtlhmlmwnmligjngwhzjympiggwrnlhylzphpgwrtppiymjphrtlznrtgihntnhznjrzztmzwylinzthgymtmhlzypmrtzjljwrrgrmtmijjiyppgjtiznttgtygnhhmzirgggrhrhrjhtmrtzyhztjwwwpzjnmmwglwglmhjnzjhzzmztwyymjlrtzzyijwpmlrggywppjggjlmtjltiligilnhztgywltlgttzmrlwziitjgltjnnghzngtrprlrtmlnlyrjyzgwgiznngingwlrywhjmhplzizprlhpgrgwwnzrwwyrhlilzmjptnzmgmpryhzppjnghwiznhjmyhjzwpmiyhtzzwhntnzzjpihtijtgtyyytlrthmmzzgjppghpmzzplwlpwhgmynnpihmgtwiryjjltyhtyhprymtrtwjpgwhjphmgwyiwrwritgtlhhngwtyihhrztizpprgnniglgywirgpjwjzzwhtrglyptgnmnhjwgghlnjzmmynzwjjzwzrhmihzliipwtllmppnpymljlmynrgznypyhwnwnlgiljygwrryirilmilghwhpmrhhzgjwggwhnpjlppnpwrmmgplzllhwphiygipynzmzrtzzglyhhjgiyghpljlilytlpzilzhpnhgptwjgwymwltyhppgtyzgwmgwtzipnjhyymnhyhrpiwjrpymtmllrrjmirinmrirjwynllnttylttyhgnyrgtgijgyrlmzmzmjrihtnrhpzwrnznwhhihgwgzmtnijwymlpwhnrjmpyhwgwghmitnglphgpmgygyyljtgwwmylhwrjjiimtglgwtminnighnnnlnwnmpnwgjngjnltwpihzgltzllygihmgirmmrlrtnrgzmjrylynrgmgmpwtmrgznimizgjmwptrptmwgmylygwjyiwynnilnyzrynyhlymhriymiwnmiphtyjijylllznttplntlhhhlmyzighwnpnijwjltjpzjllwytnmzwjrzninmgyitttjympngjpgtzmyhiyywpwjmirwtjwhhyhiggjznpmzjitwppgpgwylgpjiitminrlprwjwnpwpmzrzplwwtlzltpnriiylzttnzyirtmyljlrwpnlitpzprgtwitwglgpmjjmzgpnnynmzlltnriwwghhrtjpziijjipzwzhwmjiyjlnyzphyimytzzptpjwrjiijglwlwtrmthplyhmgwppzitzjytplmgyrgzphzzwljpyiirppglmhiwhpywppwihmzirmjzznjmyptmywwnwhnzwzjppnhiwyzyljilimzrytlgwgtnnwwgptlrghwlgrwnmwlllrihygijiplhtyninmnntpzrhinzmjwlgrlprmwtjlghrgmtwlzptlmjhnmmipjippizrhpghgwljthlwzhwnzlwmwmlytzhmgyzyhmwjwwpwmmlillnhjmlyihphmpmwrrnwhrzppwhwnghphjnmizwtwmhyzwzpimmmrymlnytgrytlnrlzytmywjtgimjlwwmgnirlzlgwlmnprwninjgjmlymmitrmjgwjirlhjhrhrhpyltzlyjmyzwpizjtytzltmtlnhiyrppiriprzzzmpzwighrgwhghiziylglyjnjmgziggjyzryzwtpyzgmjphnjjwliwplwwprrprwizzlirhntmjyyhpizjygiiwrrtyzhrlrpiyzngziwyphjjwttwwytghyygrnjtztrlwwlwnlynyhwptjhmmhrijpnrzmznlmghmlnrwinrrglwhmpymiwgnjrtytrmpjnnmwhmjjyhjizltirynhhmhwpghypwthjzwwjlzhhtnhgrrmhlzlmmmmpiznzzyymmglnyypmgpghwlgywgypzzgtrlnlwjjwzrtptmynhjhgmtwrpwiylrypttggryliwzizjwwmtiyyhijyminprzrmgjttpigiwzwllljnnnlnzjywilylmithzmnmzwnzzhlplyrtwpgpntgmpwwhjtgjggzmrprzymjwphlgnjmiwhmgyzhrgyyyijrtzwipzjppyltrptghjmpmitgyiwnwthimhgjipmjmyrthgljllzjmzyyjwjlgnrpnzrzztjmpipggtttytnltyzpljiimwigitrwttnyltwynzmmwrjwpzzmgyrzmjwrzrnttwtzhrmtmhntjthjgitjijynryypinipyplzmpwpzgigrgztgjwhrmwyjtwyrzpzwrhnmrjrpzjwtljmtlyhmhprrphhnizhgwhliintziryzzryzjizhrhjngyzhgwzrltiziphjwllirmitrrrpzihrninpnllnnlmttjizjmjghwrpwmzrrngphjhmimpyjizwtrtnmtjwmyhptzmwhwmyzzntprztwzznhzhypjpijyjjziwrzlzmryinlrjiwlmznzilnrrpzrwzrjghppgwmgtyywrpwyyglzrnmizgypwjwgtmgmywlhmiprgiittihrptrthjymmznrymnihyptwmgrhtnglyhgryhrngizmizyztiwpyimjjpyhgnglpyrillptnnjznimhimhmpnzppzwjryzmlmypgmtptnpwimnzgtwpmhtjglytmhrrmwjhtnmiwprrmpnmwznrlzizyyzmghzipzrnwnhhmywzgttgzipypthjgnniwnyrphjpzyhzppnjyrgwntljpjlmhrmnlgtgjppyrgrpzwyijhplhgprjymhjlyrjnmlmrgggrpzlrnwlzpmzhrmhnlgiwwhmzrlgnlnhznltppwgrpmglijgpmmhpgpjglmzjtpzhmygntzippziymhwrmrlgzgpzzmyjnnjjtijplrlwihjjjlgjyzzgmrhnyptltwgigimrphjihtpjwhtiylyjnpppynyiinzmnprlttljtzrijhnhyjrrylgrprtlnprllzizwggtmnjhnwjthltwymiyhymhmnntmwnirnzhjprnwzltlgjyphhjrynmtnjhytpipwpwjplnlljtzjijnyitnyyljwyzpgzjnnlnwryprzttwlhymilgpjwryzgmppjljtyyrirjmilwynhmnmmnnnyzjigmhnijpmimjyyygtpnyingnngzjnpliwljthrlwnymglrnpjhypzhnmiwzzzgtpzhzwhtprmyzhhppzypmnjjryyzlrnpmmnymgiithwnlnwptyiyptmmiwhwnijmhgmhgrzlniirihyrryzrtppwitinjynlizmglirgggiylyhmzhnygpnpnlyjghrpnzhjlgjtpjylpinynpltgrwrijglhwjrrgihmgyyhjmyyrmljprjggpmmgjhwwzrlmzwgitzmipiwnrihtyghinljtyyzyjwryihyirhyzyriwtgymwymmijwrgyigyhylninzgtygnhlwwghzgizwzrpwpjhjgpzyhyyhnhrghnhttryiigpyjnlwgptninzihthpprynrhphywphtitnljplytmgpylrnwyhntmgzlihyippgzpwiyymzntyhwzwzwnihnhihjmrjgjhimywihgzrtylnrrtrwzhiiinphpzgprywiztypwgygtlmhthzmyjgtwtynpwrztmgizmtprhpijmnjwwhpmptwrtgttrjyhwzggtnngmrlhgggyyzgllilphpmpijwrlzggzrrwnymgrhrhyntigjpltthmghnrhthzthjyrirhnjyzgzmrgwzhighzlpznrnzztjzzjiwhpgmmwpjlrjwnhyrjrptnznrihpzlmtgjpwwnhjpjjhzrhmjllptmzrityihjytgnjgrwzzgrtrznwhtymzpjmrzrwnmzwjryihrrtmwlptyjwmttlpytprlgztrrgglzriwgzjwwjgrgygjmmjmwpiiyijinghwwnwnzzywighwgtzwznrwiwpgtnwpwhljwzhjpllttnrjtzglggttzgythmwrwimwwgywmpyryygrnwljgithmjzlynnygntglpwwnzmjilmygptphtygjpprpitrggrmhhjmppzgtltittwgnglhhmzhzlwmlhzgrjjrtggigntjthmzlmhllttymjhyrhwhhrmzmtnjziyjgthlwtjtpzwllrlnltipyynwlhhzrnhzynwjhhnrwjzpnwjnigggzimrrnzgymmzmplgippytwznyzpzyylrhlipzprnwwwmngppnptjtmwtzymwijnjphihziilipyzytwzrhznwiyjiwnhymjnjgglliinjntrphpthyizjripjghihnpphrmwhrwyrrlhrjliwlwyjmwyrgtjytlgtgzyrjirrwlzipzhipmwpnrpjhrtjlnmjnizththilhiiytphlijrippynrgzimnwpnywjjwrghljljjmpwpmjnytgprphtnyjippprrwgrgyzygmwzlnghhwipwhwyrjythintphglwgtzzyrtwyjrywzlythhirmllpzpjnmwyglgpmmjimzwgppjgthnnwgmzwwthmllzwzmtyjnhnrmprljzmwnlmpyrzrzzwljhnnynlltgrpihizjprprtprhhjgrjlihzrgrwrpjliigwyiztnnrgngimjmipnmgwpwhlgighhyrwjmljgtnpylityyrnrpnwjtzwtlmhhwttinjigtmrwmrnyrnpljlllztyilrzhimlzyypwzmnyzmniglwiytmittprlglzhirnwprrgnnrwrnttimjhnpiynzppmwtyhzygypnlppyyiwylzrhgtttitglryllymwgjlhwlmitnjjzttmmwmmlihjthpmtwrmrzjinrwmlhjihmrwhitlznnmlwyjwlrjgigrjmhpwlzwjwgrnwyzlzwntrwjjmrthnpitpilygttthlmnzrimzmpttpyytlwlwhllzynhwgttjtrhmryztlhpllmnjzyjhmjpztzwnjprywizzyrnghtljwzjzgwjgtrhjpwygzmgtiwtnnrmnptwypplwwrmgrrighlhltywinmhptjlpjhzwnnwtztzirjgmltnlimrrgpnpttinjimmijgpgmyhrwlwzglpztijhzititmizghzjrirpttnmtgwhhihtpjpnpyhnjzrjrhtirhzglilnrrghjyjwpynynzgitlplzjjphgghwjlgpmtrhnwjrnnrgypntyhgjpmnjjgwpljzwhnrlzmnyjrhpjjpgtwwhmymgynrgllhlipwjgjhlhwzwgllnriwhjgttgmwjnwjlppjjiwprljlnrltyrnwgtttjyrmprhtthrwlymzijwtttzyngzwitighjlpmtrtrggmmhyinjlpjpnphmngnyzitlwnhytplltgmltlhimhrmnpphrmihjwhirppytngrglimnpprnhrlhrnnztytrtitlwpmhyzpyhhmyiyitzimhttrlzttttnrhiighwtggytzgtywpnlrrltihwrziwjjjznpmwgrhnwzirjppyingwwiwrwljjgphmhizztmhyzpntwnynrlgppyygrmltrygtmrylrtlmzynpzinjlhgitgrigjtggmjntlwhnljtwmzhjgjzzjrtiggniglzgwiwmjgjirpmlhtyirplztjpyhnlhnrjwipwrhhltyhtnlhninznntjgmwlggwnhyzhmjjyhtrytjziypjjhpzjtlnzzglipnzznpyllzmzhwygztytnmrmgylpwjtwwzmlttmrrygipljhwylwygrzniiljgntmitpmtrmywlrgzrjmiznmjrhrjttwprjlymigpwhjwnyjywrlyjztpmmgyhpnnnypijniwhghmpylphrpjhgigjzipiijpnpjzilrwgzjlgwrzhmppplyzyhztwzzlyjmhjnlwllihitiznlrlnmrzyigllmwphrymrngznwmlzhhjpmwrmjtzrjrmyiwrntlywtzzginjyjgwwznzgyzmppyjirwgwiztipygypiznwywtlrhrzytmhypijihhrrlnwzglgptgmjzjlpzwiwitgtinwmgpjwlmghlhzirpigltmtttzlyggjhlipgnjjjirhywgmwtrymnijtigwpnwttmiltwjwtjrzwnrhtmmpzynwhrimmyhgiljyiwwztllyhhljhmwwpjmrhtiywplwggpgrzhnzzzgimjntzitlzlwignphwwplhtlwjtmtwjripwwwjttpythgihhnttzpmliynynprztjznihmglnrihigtwrnhywtitzimwtyiljhytglizgjlmmlhlthgjrjrglrpnpgmwjwjwtirhhjtmrlthpmhpyzizhgzjljpwmyjpnnntinyjpnggyglrrwgzrhtiijtlljhwirhytmzjpznwwjpnlpmnjitihtzmpiwzrgzrwlnnhgmrmymzzitgitmyyzyyihprzttjpijwmilltnnjimglntttzmzyihmilyztplztnllwgpjlwimzniilrijyhllhglhjmtphjzrytmwrzhgnhgjyphtimzpziyrmgmphijywpwilrynlyljjzyzzpplrnzzpytzmytpmnwgrztwwjjljtrigriylwgzipipgjymnttzlrntnthlyjniyyglwnhlinhwhjpliwniyijpwgwzrymirnpyrghjimrjmjzjwmyzlwirjppgrzmtyjtilmzrrtptgmgzjgtlypgmnttwjtyljtljpiiwylrzrmwwlhlwgwntnzmjpzpwngtpywigthmnizirhmiwzpgmrrgjptpjmhgmmnmnllwmziwzliziwrgryrpmzplzwyzljimzttjgrhlyrimjyywytzpytghwwhllwippwhpnmngpynrrjzjtryigtthihtppygtjhwyyzprwzhwzrpwgjymwiimtimnilrgynzygmzntnlhwhmmlpwnymggyjjhnptntpnwhmipjwtiitpnzpzgrjlrhmgwyzwrwhzzwwjnzgpnhtyprtjwilglpgwhpytjpiwynylzyljnyzjhhygtghzwjlrwzlmzmgrzwjligwnhrmjwzljtnphmimwppjtrgmrzpptrwrtrghrppgzwmzwhwtlgyptpyjgprzziijrtmgtmlghyyttnzgtptwtryrzhznzhnrtitmyjhhllhnhyilgmipwypjhwllyinilwmrhnwhwyzphrytmhhiygjlzpnwmhwhgzlwjmzinyryjpyhgwjyimprwipzplrmmiyglyymrthzzrynwgmwgwjwjmwyrhjmhznjmlrrwwjhtyizrtnlgyrihrytgmtwwtwnnprnziihrzwihrzpwplmltjlprrpwmprwtigtnywmwzmriiynlhgirjizjylzihytltmpjnhgngjjmyhhjywpnntyhgiwrwlhghhljnhhtrgihgrpgnyzhwinlmhytghznjgtizmgjhngymhnhrjzlzhlihynwhhzziihttgigirztiyjyjglytgpprhgnmhrnllrylimtggwrzjwlmzgzgwiymynljlyhyinipzyygggrjwprijhiiwmhjyyymphyzhmhnjplmgwlhpwgmhzhpllzhgtnjhwwmgmmyglrlyyzzzrinngyrmyjjpriiitnzhtjrtrjwzyttgytizmzhlzphplrlryigrpjtztntymrrhrtnnzztpitjlnwhphygtwjzjnimyzrnpptyihzrwjtjhllminmjggwrnttgzhlzrjwlryrirmjwptjzyphgzjhjyrwgwipnpnzghzmlngizmiplwlwhizrgrrlmzhwpglgppyiiwtjzmtngnjtmynwlhzppjzwwmpjltrnhtgmhnhinljwzrrijnhrltnlyhjnggztryrrinplrimtlrtwwmiminrlgtppmwgnihjhyhgnyppnylwjlzwtzlnnhhmzztpwnipgnnzripgzyittnmylllzwlyhmnmnpgwythhwzwgnllnllrhnjtwrjmhmyjprhrirgpnrgmhiizglnjpizjinmhwmyllzrthtrzjyyjpnihzhjrrjnnrmjhiwiywrritggiziiilhlgyhhlpittgyijlnrwjzglpwlzmpyzyntigpzpgiirggjmhzlpyhggmwlntpgzghliyrmgznhnjhtrtzylyhgzrwhjnymijhjjygiijnytiziggppnigrthygrznzylnyjlhthihhjjjigwrrrgjzihhijhwzpnlyjmrmiznzyprtzjmrjgtwimgrwzlijgwhwrlritphgtzizzlhtyzyhgtzjpylpihztryzpyiygpphjnmlylywzyhypwrnlgtlrnlgwyhrnlpihymhmmzphhljwggmtighmnhizrtwrgypwrtimthygwgirzppjjpgzhpzwhwzppjmmtwnnthgrhhgwhwhmwgpgzztnrphwrrjgyyzjhmlwhmrznlirjlllprigigglmrnjhynwgwhtniwgpjwiglzhhimywnrlzhjmpyyminztzyypnwhrgrnpnhplwgyyptllhgwlzgjiizjwrhyhwiznynlwmlptwwgwzpgrtglnpjijwhnztignyigminjhjgpipwtpymgnriywwpmwwmtrihyrgtjlipijtimtnlwzihghhglpwzlznhprwrrtilplgtiwijwmmirnjmhlmlnmgjmyltpghrtzygzzjphmltmitmhtzlznyiwpnzhmgghygrmyhphygjwrhwrhyprgthmtnzwwwjhhpiwhtrljmngmpgnjjnlhnmnhrzrjnpttwnpymlzzphghymhrgljmrnnhhztnjrzmyjjmtymgthnhntnlhmhyplppgnigjrpzjjrgzwhpgplzijwhninmwngntryllmyjzrhphzmtnpjtwmwzhptjjntyhznnzzhwyrzprzgwtlymzgtnynzwzzwyrnlijriwgwztiyrhmrgliryzzwpytwinwwhpzlpltpziwpzzyjmmpimlymhzmpphjjjnylyrhplziwjnytpihntthmwnlpjyhjpizirpmnypliylzgrmnwzinpgmznygpthmhtgiwyrjrpjwhittjtlpnlptmpjgwwtrrlhwylrpihtyrwlpzgyntjtrtjlltplmrytpwmznppwigtjpihnlpwmrhmzrjzzrrprhzjnpzhrmyjmwtipzwgntwjrzjwpjzlyhhmwplipwnmnzznhzjhzrglnpnryhipyihpyjiyntwwtitizhhtirlmmtjjyhimztihiwlzwywrlnlizrlwjyzlhiznrphlpppgrjptwipilwwwynyghzniyjpmzpgnmytlwzitppplljhwzjtmmiljjryjpilwggjymgignnnpnhigrmjmnygwmnginizjnpptjipizyltnzgiwlpnilyhpzrmnptgnwlwnyjnzylirthmhwghmyjzwhzrlwilyrhitpznmrllhtppnntiiwzyptwzlrwwhgyrtipijzrrtwzwjijiihmgwyynmliynwnygnyzlrrtyphphnjwjrhrnjgmppnyljlmlgyzrmgjyplmtymrllwlintrjlnrzpnjmtziiplyznhjhhjgrjzwhzthttrmlyjwglllhhwiriglpygjymwyjlphhjljgzwhzzgztjrtjzlmlgjpmrlhlyjyphzrlyityhppmpyrytintzzygyiltnjyhzrhrzrgiipmihjhlrzprgnmjhmziimzwinrmimnlwipjtwwprtpnhyrrpwyztjwwypgymijnhnlzipmizlhppmnhpgittmnhpthgnhrthjjlyziyjlztmgizmjimimlzympmihhrhzjrnijiyznngjzyjtljghilhgmmjlmijwytrthhjtlmhggnmnlijjtzjmjymizrtrtylinrjwwhnlnwppnznznzjyghztzzhhnhrnimtwntjgjmhijgpjwjygihrtthmhninpzrhhzjimmzzzhhgrrrmmwtwwmprljyrnimtyirrtnlnthzjhpirwmjmhiiglywyirizrhipiyrwwnlyinpwnpjhtijhinyyhjnlmriwrpthpytijwggitywmhhghwttmmtzplylwpiprtpmtyptrzjrgmigppjrrnhmwtgiggmhmyghggtthryygmiwgrpptijnrizrrjzhrhzgmlypllptphltnrznphmzypijmylpiinriiwhywprljtmiwtmwpwtwzhygrztjnwmptrwrlhwmrhgghjtpmhwlplgpizywnyjmriitrgglitnwimmnhlligrmwrymjyjnirtjhgnihthhyhgzltjmthyywzlhpwmntnyyhgtjimjygppyjhhwnznwiwlzljznznhyyjrtithzrngryznjzlryympnjimjhhtjntwpmlzlhmgiithimrnriiwnjilihplhlhwhrhzlynilhyrggnrgmigyigwmrhhlnnhzryllgpipyrrtgrrhtptinitpwgnygwyphywprhpgjwzilmrmnzrrmywznhmjiljjzzjrjywinmwhrgttwtzhplzphhigpmrwntpwmtlrnghlhizhyimhhjmztizwzwlwimijywtihwnttgmlmhzhiprziiprmmzlwhljtmtnhrphtnrttthtgiwmngnrgltpjnjjnrymhttgitwlyyllrtyynryitzwhhzglytzwzzhgjllijgltjmjjjnngyzzmiprllmpnzlizrynhintzzhhrjritimrjtgitggnmplwmmnilrpjyizwihmnrnltmiglghptgtinjlrnnnzghwrljilwjmjphynpmyyntglwyrmiymmzyhygrnjniihwgnjghgwihtjimrzrjwnjzrhplrntwjzryphgpnjgjljipiyrjjgtgwgywytrjpyhrggywztrzitzllgyhpyrrwrnpytwhgmtmglwgprhgpgnljtnliilmlnyhnmwrtttrnzlninmwhrighrzlygwrthyyggyigtzhhjhnzjmliyywlpmgnwtwnmjijmthztitwnwimntrghwjtlttgwlytjzptjhgrgrtitwyzihzmptrwmrjgyjylnwrlmrtigphrwpmtiwpjrnriiwyntthwhlgjmhjtlryrzphwngpzjwhtrzjgwywtnmgznitwjigzmngwzwjzyjtzznitriilnzwlytymtimtlmmgmyygptrittihnzwgzitywptryzhlzhlpwrmgzzptrtjzrziyztinpghhgwpjtznjhygnttjjmzlnihygptghhjgyyjwwpmpmwgyrrmpryplmymgmzpgylpjnhhllripypwyzjwlpmrmhzgygtjlyhgnlghrygnriirhptmzwzymtwnwijmtgywrrtwrnimwmtpmnrgrmmrmzrrihwgylnmigihjpjjinynywwtppnymrnwmmztpptznrgljgypithppjilmjwmmnwjiirmwgpnglmtryihrmznwnzlhggtwwyznwrhytitrtnjrypljhjwzrrrzjtjzhpjmtjyhwlpgipgjznypjlggyrimtwjrjniywpmtwgzgllyhmhzlrwzprhjhggjjjtlnwjrriphzmnitpjnzjhhiyhyyjlyphpjpiyiinthlwmrwypyihllynmtpiyhhrwttiiyhmwgwynjlryhwmlpmtzlzztjmztwpzzrjzriiprttgplwjnzhhgwrzwtlrijjlhigljrmrtzlplhgihgnjytpjlwgptmnnymtwztizzlttnphnymwgnrwnwtrnwrghliiiwlnhjgyzljwzhrwyzjjmrzjirhzjrgjwlyphizrzhptngzgwpthttnrilzzhwrjlhngjwimzmlptmrpyzthplttjyrnnipzmlihmrwzplypypwthwgpmtihrrtnlmmhyztrriiywrhyhtiynwwlrmhnlnphznjhinzwmtzppgytlzwtwhhiplghwnyplzlhtwznwnripjhjyjzypzwizmmwgrittgzinzgrirzrpmzilwzlpttltppmghjywmmyniiptpjyzyjlgtwwrypmplpmwiliywwyrmiliimytjhjhgyntintiwzgjpynzrnzpthirtlwwlnwtmpjpmigptwmlyiizjpphlgwiiirptnlltrjyzlmrpjjwplnttzzzmtrhnmziwywpjhthmmghjgrhptmwryrriwwzzpwhztigmjtrzigymwimgpmzlrlmllimllnnnthjwglrwilrjtgtmlwgtyzmrrlmjmzjrpniyjgwjgpmnjwgzznzntwwtwihwygznjzpzzrnwilpytiyiyppjzmrwmyyjhpyrhtiphnzjzlzmwimmnhgnnlmlwyhmjzimlizlnmphptptryjwmrjyrmmmithnjmiptztphtpwmnwnzypnrlnlnzzimmwywztnimgmrrrzmjilhlrinnzpzizrgmjiiztitnhlzhwgmmhtgnlnlhpgnjiizrijhiiipjhnwrjnlhjrrinzzprintttrtrwylynztghiipyhmwpynjmpwgyrwhtynrzjypmmwhynyyijyggmllgwzrwytlnphmwyinjmnngyjwyymljrigzzpyhmzligtzmrmnmjjgngrnpmwwrlzhhztrhwnltyhmynlnnirtwyiymnprtnlgpmpphywhmhhywrgiwiwpmimnnilmnrmizmztgygpnwrnzjgmthjnyhwzjzirihrgygrtgmymlrrrhmrjgprgmjjrgyrnwlnniwtpnjglzrlprpjyjnmhjgiwltihlwgttnntiprllyjwmplwrjnyrhlgpjhizywltjpjgtijlwirnhyjhhzplgyjwzlnjnlyjgnwyigirmpmypttrtjwlrzjgmylzyjiphtmgtwphmmtzzwmplmlwtpywtnynrtmwwplgrlzmrinmymjgzrmpginigwlijhngjhlwmlzwmrzypwhlnirjziypyyygwnlthtzwjljhplzjlrzmrnlhplhwtztyjgynnntlzhwjzzglmirjtnwimwnrhgzzlzhntymjwlgyjipizwpmtzwyzplppgynwipthmymitzmizzhgprzijmtljhiwimpwniwyntlhrjrhywjymwnirwhpmirigpjzhmgpmwwghlhhmhiwlnymmgwnmrgghwtympjwwiplygrppnljgppyywyprjjpjmnjmlwwwrtirwyprrhtllirmiywntihliwtjylghwtirinpjnrmyzjjjgpljiirjpyypnmpiirzjttizltjjijwmilirmiiiwylmyhhihlnwnprlgnylmylryllpynywgiwlppwziwhmhjzpgtnyiwpjyhlpylmywghjlwjwlhwgwjgzwgzyghrpjiipgwtwpiptlzplhnwglrjtwggtgrhjywwphryprhynthgllzymrzniwhtzzhpgnirrrjjhzrpggzjgrmwjljhyjizihjrltmjnpjtymgiwhpmmzjynhhyrihpyygnimnmmhnynzjizpnrlnlgwyilwwpgrrwyjhjtmzrhrghmmltpinhjjnljwljgtwyimytzgllmjgmgiphzrrhpypywwlwzpyrnjgwnygntyhnzzgmmrmrlimihpghyhrptgihtzniiggihjmrihgwlrijnzrlnnyzwlmnpmpmiiznmggrgnliztjyhlrphgljhllnjgwihypmgnztjwpilyrrrgzglpgrigilnwztymwwglttiryghnhpjlzlrptignihwzgghtzjnznzwiiyzlhnniwnzyhygpghmyyilnnizzhrzwglmzwmgtzhwrgjpzpzmhnhiypylznymtnptglnilwzriznnittinhzhyrrtrnlmtpmltltpihjmiriymhlptgpmlmptmztmntritgyiynliwlnlwyjyjhnjjyhwththlimwjljhtzhnttjnjryrgirlzygmtnwniyiinrmmgmgipmngrjhzjlrlwzprwhhwhgwnrprynynypwlpmrmmrrrygyrljhylplnrmnwljgzlphrzphylgwjiwilrpmrljgrptgrmiyrplrwnymwmzygmiwzijlyjnwzghwjpmnpltirnzzhthwjzizrjnpgjgihtpypznwmzzwnphhgymtjmlwhnzyilpljmgpwznlpyhljhjhphnirpihjlgjnpgitwywjgnztrynwrigizyiggyhwhwmwnwhhptnrplrihmlythjhpziwhnggjnhjhmityhgjtwypihnthrlypilhpmlhijwypiywlwjtrnhgtwytyrriwmgywmwjijnnjijzprmhirlrrrtzmgtwghyngjjzywitpypzglipypnigthmrzytrjytgmyignjhtlijwippgrmgtmiprnywlliymlwtgjitmmrtimggiitigmwmzzjntrhpiggnhtjzrzjiwihtzwnwzzpjwwiylyimhjgprmhttwgtihhlgrglnnlwlimnhwlitwggtljgtnnrlpmnwmmnprzliimjwhgmrpmwzigijlipptinghmzmtgrhhlywjjpwjnypwhhimlltrmjwywgmzzphiinwylglhhhtwwgnhwhrmpwhrmmzgtwplypgrgiljzgiphzgrzrhtmzlhwlwynlygyglwyzztwglzgnrgymgmhmnhgwnlwlzppzjpgjhtjtyimyzwiptypymhmpihmnmljlrympmmyjpgrwnljwitwilryymnnrlhzizjjmtilhirnhrrtrmlrpjwhpjzjnizmryggytyrnrgpyllppjlihtrtwjhllgwmjwyzjipjzhljwihmltpmwthhrjwhmhhjyjrpnwliytlzjmnihilriymnrpyminjgwlpmrhrwipzrrllgtjljmmgtlmrngjlmylynrnizgyyjnyljrtlwrgjpglyzhhpginmpjphpzmpyzmljynhzmlpzrzllpigjthihnmhlzgzntjtpjiiypzpnyntjpplgphjytyhiglrhrmtmjzilnmmghzwzjzwtmltrhmwzzinlrnrrjltjrtmrrytmlzwlpngitnhglrzgwpypjmwilmitwhhmppzhrwimyrwggwmmziihrrgmlirttrjrnyiwirpniwgmmnigrthhrzwwrnhrrprgmptygiltyljhwpwtmljhlymghiwhzlhwiggtjjzzjjwtnjnmtmzwipihygwnnlglnrrwnmwprhgwzmtpyymlyllrggimlgzwjwmnphnrlyzyggwnlirzjwrzziyrgnhjyhiznpiyiltjijwijptmlgypzmhlhhmrylirwgtihlmpwtwzmmnhwiyhpirtytyzgnrpmyztphpjnwwjznirigwywnyiwnyyjjmtihginwmhmlrjnrgjrgzzgglzjigrrtiymjgtrijipljtrmhthtriwtitrrgtrtgtgtyiglnmmyzgynmhzphgnwrwrjrjijyyzmgmpyhnzzwyigwmgzigpzjirygjhilhylwijlnwwrjzgypyipyphwtmihzrrzwgighmtlwygjmrymppptzltlylnigmiznglhijjzpzigzwtzwtrwwjzppjwgprwhwhpiwntwgpmpnwwhnhtwlihipzptgmhgyrwjwjrrpilitjznmjitpplzznrgyzjrrwwjipwpimgljmmjizyiytrlijwnymigtjjhplghjpmiijnipppmylyyytznmwlmmrgynrzpwmptlliwplzmwlnrzwpzitzzryghpmptpznhpnlrnhtlitltyyrhjpjizrygttyzznnhjmnyjrnzjzimylzwwjpylprghhrrjpltlylmrzprjwwyiygmzympmzgtrpglpglgwlmmnwtplzmpnhijjjytprnrgzgrizghgigzjhtihwmymzlwiwhttzpjtymgyrlnghwrrpihjzrwtniggpznhmrpjnttwwzmhlnljirwitljzwjzlppjtjrmplmpltphtwrhtttypwiglnimimpjgmjrhwmlwizmtwrglgplgplwmtwpjmlntwithrypmzwggwmjnjhlljrgphhthiwgymhmpnzjirygwignjmjzhznnmihinrmgrmzgppiztyjytrjhtymyirnmtypjlmjpymjplnmlywwmnhpnlrnzhtnhwwinhnrnlhwipylmyjiyggnzrlmnlrpzhgtgtjhzzzhjwgtpnmwjrghmhrtmighrpgimtpgnrtiyzllwzmwlpjhlwhhgwzjjyrzlphttnziphyzrygizwrijggyttpgghrhmmwjhpymrlgjtttwphrhirhiwmzlwjygwwiwzyjinjignnwhwntplnnmrgtjhlmytgylyjzyjzinywywrpttzylmmgnziyzzptwhjwplnjrntiprpwgpgrwpzjtiytwptrhzrjnjztyjhzmypiwtpmrmmtnrwwgirtirmhwywtntjjwnmllnwihjipjlyityyinwznminilwrythhtwnhjlwmijgmpjlwmtrtizgiywhljnrzttljllgmrniwwgrtlhwwygitnlmztnigtlrhwtizmjhlirhmwyjnipptwnmtzgjjywyyrlzmtmyngwmypyznpgyijyzhztlmjgyirnzmntwpiyzzprhjgzijwmpnpzznwmwprjghjtjtwhglmhyppgtjttzhpzjrmilhnzrjimnlthwrjjjhywgtpzmjtwwyiiizntzprylyihnmnhjinpwhlllwggtztllghrmjirpzlthrptmhmzgnzhlmlptynwgtnhglgngrpyilltjrprptititptzjhtmnnzlrrzhjrggwwwtnzplllwilwzywhzgrjgmhyrnnlnzphhhgjhwjrlrtziztgripgyzijiggmjjyhwthrwnmthlnrgmlpmttmnirmtlpghrhyhtwrrgzlliiiltjrlphjjlmrnrymhlnhnrhzhnrpjwnpgggnlzwmwnntngpzrpgprwgtpgmjlzgyjwpghyhwznrizipmyzwzgzrmhljnpjwnrtittwwzjytmrptprmjyrrhwhrgnmnhnywlljhyllmgmhmtptiwtzyhminjjwihtjnimggnzyhrtnijzlthzhrmzlwmnzzttijmymphhtiylylpilnmgltjryrizmmlzliytwirhyylrhwnmijlmnjpgjjjngpypriniznizzhywjymylzjlwhgngyzhigrphijtlphhijggjplirnmthrrpmmryhjphpywzigpzltrzjjrzrzihnrpywnittngtnptmlzyrwinlwimnzzhinizzmitpywznrlmpwpphilimmilglryhwzjpyjzirinwimpjzrnpzmjwptligpyiyzlrlptjipgjitrpypzmlgyjtjlzprtnjmiwniglyiwnrgrtyzrrwytnwrtphrgjrrlzjpymrggipmyzmghtmilpjnzwzrnllpznlmpyywzpyijnjtwpnttjpjwnjwjignmyynnyzgmiprhtttpwphjrzmztyliytntgprypghpyzppyhppwjmgiwiptmgpglpjijzggittgznnwyyrrnwjlllzwhpmtmnyrzzhplygzgwyrmprytjhtmptjppgmjinjplyhgltzpyypmiggwrwinrrjmntnngptnrhpmwyyltmrrnwwpynmitwimnrnthmpynjztiwppmnzznliglzhlrghmnthrnpmyypgwlgtwmiwpwtpjigwinhynznpigyimhhrrzmghtgmpthgipmphhrrnyyzgzzjyrhpywjgzmyljmzzryrzlphwhihitiyphhiylhrywnjzgtgjhtplypjjrpzwpggpgprthigpypyrgnwprthwywjjgtgyzyprizwizlpprtpynymmlzzzppjrrtlhhjmlrhiwinmmtgnwwjlthgrrymhwytnntlpznnwtjynpjrgyjnniglpintjgjllhlgjytnrgzilrizhwnwwlzwmnwhmjmtzgjhgintigpyyltgjhhtllmrritnizyhlntrplltrliynhtrmjtyrwztwprzrjrprlgwiipryrwptjjjzngmwnmihgwgzwyrwjjnhnrityymgrnmwpinyzrmpwnhtjijtghpzgzmgjmyjymzrttpiirrnrwigrmrtmmgzyytwrnmjnjihmrwtmjhzjmnwttiytitttytzgtmtpgmpmngtnyjwyhwnmwzhlrhrnmjmmtilnyjmwwgmrliwnppjjizlghgpjimtjrrgzlzjnriyiwgihmtgppigrprmlgrnizmltzyyjwgwrlygrlihtjipntpzgjhnlrnmhjmynttjmitrppnzyjtplhhnhtngpgjjnmrihnhnjpgngynntzylmrtrjrzwninwnpzjgtrtmplnptgjrtiimgrnptjjwmgjylwijilgngltptirglpgzpliwthnplizhyrmwghwywgpgtyhtytigmijywhiigimjwtiyzjlihyrzllzhggrgzypmirrzwigyhrmprijtwwyrmrhnyriprnhpngrlptlnrgiingzywlpzgytwlmligwhryrjlwyhmhnglintpryntylitjmmjwwnwptgnyizzmhgylmjrzypgnmwiihjhwmiwpnmmzhnhpjnnhjmtirnwmnjhhymiiiptrjhnziitlwywphpjhhijlrlgryzzjytiinmjginzljpjwwpzggjrzmrhgzwtyyjmmjlwpzgzphngzlylztnmnrjizimmrnyrljnnnytnlnjhtzrnignlnigzypwmmtmiitjgjitniiwzgmlynzihnzgzyhrjjwntypiljrtnhlihjlryjjnigjgtlyzhwtngwhjwnmgpptyiptrgwtmzyrpjhryzjpnpnpjrtwnwmgwjwmrgimnthgjryyijrmhyptlggtlnppzwpgrylrzwnyrgrmihzhrrmhttzrpimjzmtgzwlrrijirpmpirgltznmjhpzzntzngiphgzzwilpyrigiztphzthzzimtrrryjpwgnzihwwiyrjitrpijijhtmiyjhwyizwwhjytlltpnizmgjwmgnynwihmppiyltntznwygyglngmjpmypgnnjywthrhrtnhtyzzznlgzjjmizizljmmtlrtzjjwtnzylihgimghymyzhzywnnimywnrrjmtmlynhwrwitwhziwnwtmrphmzmwrptynnrhwrptlzphgwlwnhwwnjwllmytzzzjmgiwyntirmjrytmrgrhjziyiyimplmzrjrrhwnjhztyypyyhpgzimwgiwmltplrtptplglnwgynmlymhiriwnrrrzhgnnywhihltitwltnihtyzztwhzrpnjipnggwnlwyhhhihhmjjpwijzwjrlhjghhwpwrllzjnpmmzgrjlmjglwntrggnyppplrjnyjmttpnjlyiznpgwttwhpytmwhwjwyrgptmngwlmhhpmrmirptinmywjjnjiijmjlmrpytnrgmghhtzihrgpmrggrjipppnhigrzghijljyllmtyzlnliwwmpgtnjjnwgnzgrrtzzrripjwzgngttjnwiprzjwljngmittjwwhpnwgnjthytzmiimymntjpgrtmtwijjtmripzlwhnpiggtzjwhwmiirtppjzgnnpprwltzrhylnhwyywgrghpwmmmghjrjhyziylzrigtynypzjrhizwpilryrpmtzttzhwzgjnnntziwjignjngjipjhmwwylrnwjwwmyrpzzghhwlwinpymgrptgtyniyyghymnizwjjtnpgrhwppntntjipgpmpiwimrlnhyjylgypymlyijgyrlpgpwpntmnyhnlryrhyppgzprnnizyrhljgnityhhggtyihzzwjtngzgrmhgryzthgziwwmhzhypthrrwwrtylppwmlphgmgpigzirzyrmwlipzijmitrmgwnnlgwplgzhptgypthjtjylgzgyylzlipymyltizwgpnjzzprntnztipzpiwrjwrjmwwlphlwitjhmzzrtjngwwrtgrwrtpllyypnyhrhpnjipyywptngnhytmhnmrrzgzghtzjigjitjptgtzjrrwghyjpryrrzyjthtimlnmlrzmrztijwlitjgmtgyjltlhihmgwiymyztnrzwjilmgrpjztwizlnnlgjwhglntmmywggjynlrnjrwhgmhjyiwhlnttzptrlnnhhwnmjztrmptjhiljgirrtzjwtgyjlhwimmhhhiwwwmzrgtnyizphzyiimtjwlwyjlhipliwjtlijntpjimpnntilwmzyyyhzjpwtlntgzzwhyzzhgjlhlzliyghtwtwzytiiwwjwimlwyplzwiplgitjyjryztlpzpiypnzmimnyhrnmwmwhpprimzlztgztgwtmrgwrgwyptrmyprrrzinljzhlwwnhyrwmmwznzrgywntgiizyhghttnnpggtzrrtjtjlglpmlgpygjphryrpmptpmmillplwhtmjgtwwgmwlpiziirrlyhhhgrtirjyphlhjpjihigyhiyrwlrmhnphzhtrjhhilpiztpntnyyjlprjlrhprpigwrnhpljppnwhlligzgwhzryijnlnhjymmrgmglmmygnwipjytnghhmyzyywznzzmnjnlnnppjpzgmiirghlnzllmlhgpijgwngpmmnnpyzmgpjnymwwgznwjrhgiwgnynzziwrhirpryrjjpngghrgpphptllnlwwjhrjprlyyinrpwtthwypwytgmjtiwiimlritltzrlwpwylzmrynnizlnwiyjhjitwgitzpnztypyptpjtiwhtiyinjitgzlzmzimyhmrppywtggggthnytjrltgllwrhrzlziyywrgzpyyrnhjwhylyjnlrmrzrlniggwjyzzgngwmnyptnrnmywwwrjwtggrnrjmhlltwwlgjtztppizyiitmgthmyriytghgizptngymlgpjyprtrjtlmigtzngymzrzzhjttlzlwilgmmrzprijrpijiytrrrmjiygrnnmtzwryzglziwppjlntylimznhzirjpgjhmjplipghitmthjtgiihplmpgymrnphwlrmgwjtmhnhmihnjypttgmgrwpzztzjmlyrhjighwzgmrnpirwzwiypyjjpwgtnmlyyhpimgylhzglgmgwinmitinjgjlhjngjygprgjinzhgymjnipympgyryihjtrwrnwywzhwymyhgnrtzgztlnjnltpllzmglpywnhrhjpjrypplyzymntmjjziwnhwmynygljtpgjztnnjlltyijrhiimtnrmylhmwjjwmmgglzgiyliiztgwtlplzphwwrzljtprplmlgrzmgphwyywlryjmpmgyzgyymjrmyzjtiyjizzllljmiwrlzwppplyhjylrprzzpjwwhlpgllgwlpgzmizhnwwtitthgynynjlpwlthwhjjrmjjjmpillizjhygwttiizyrmmzpwtmlhytnwztpmgtlyrnghrnyhmwwnzwyylgtmyhjrmggjljhpyztmijryhrngymtgyrlinglzmphwnryprrtjmwgwizmmhjmizghjmjrzitymygllmjplmpmrrizmppprhhwmlgwphiprpimpigttiirilhzppzgtwjillwrhipiiiwjjyigwyiwyhpnpwntplwrrnmyrrlnlhrigwgilrrngjyighwyrlrjmwyjlprzyitmrmmwjmpwgmtmnzrrmngyztwggmpmymhzggijgrrzzjnnngjtjzgzmlnrtznplilzjnpwtmthwhhggtrgngrilnhnpytpnyjnnmmrwzprithrthhniwiitzljjghrpihrjwnhhjzgwilnnmppjynyjzintiijjnntijghrlmyrtimttnhntghgntwtprrjhhynmmmmgzlmptynlgmmmmtmnwgthirznhypnjrtrhmyzywiwmmhznmngiyyyttmrtlmilwwtgyymjmgzgitghprhywhnryjmjpintnnmjwpggjwijiwllgjjlggptjghlgrzzljpllwlrpzjnlmygrlghmiyjlpirhlggzrwrtrryrtrnlzzhmyjzyrzwtzpzmynlllyrhwrnmnhyhzhrwnymlnjtlwiygwmmtttwhwzzpjgmpwmwpzwryntnyzhtgijztypjhmmtnwlplnhyynpjpmigwrlnzpgtjmihyptgptwlpzhhjmmylwhrirwhlpmmjwjzlgpgmhltwljtwtiltgjzwzlyiwipijhtrtpwjitzlpzjylyjplnzwtwzmpgygiitpimmppnyihpplrytymyzlgglgzmihzjlzhnzlngwirhzmtpmgpmiwmmwinzjtrhnlzgtmihjhyzwprtrtyljttnzmmglnpwiwzgwmitjwyjgwhtrpmgzihjlhpnlljhhztyytlrgirnzprhrjtzhhnwztjhmwjpjwihzzrgwlrjijmlthyrjiyjttzyzyriitwlryytznmnmtinytnrgizwnprgljlllptrppljjypriypjiiimppwmyhhzjzzwjrptngzlmtwigtjjzitpmtnwnrwngtzyltnjtwtwwzpwynpypyrjplgpzjjgiihlmlgltwzwtgihnhmliztgnhjwithzymhwpllrhjljtinlzptypmrwrrlhmlitzrptmtliyywizyhhryrmhjppgznjnipmitllygjwnhryythiihiigjwwigtglgyinjwgrzjpigthlnlwztzrwhyynhjjywijythrtipmjjppzgrmhzlzmimlhwglglyztyhhiriizjlyzpphlrzrzmypthprgmyltipphhjwnyzwjljzgtlppnhgzwjjjpprlwlmjrmglgzzhhrrztwpwirlmjhtlmlnllntzzmptgmrgylwpinzlmmntijgtjihznpwtjyymzlltrhlighzzytjpgrrgzgrrzmhwgtzzwiyjjtwzhrhrpinmymiztprithzjlwpmynzzzgzmryrmwmgrhpywmlhltgzhjhrimlwmnzpnmnhwilryrpgptjmijttpjggriziznyzypjniytynmrinrlphtnzlyltmrtiwtjtmnjmrwintwgmgjmjimtztpiwylywriwjpngghpzhiyriijtytrrlnyytlljnjhyyzyyphlrlphmmjtzpjjprhrmjlymrpzryihhmlmmyiymmhtziijhlmjgtjhptnggilrrwipggpwytzwjgwmpyirjjjzpmwgnjrwrmhwjhzhrwtppntrzmrlwgjygmjzllnzywrjjpmnztgpznlnmhtjrmmtnyyhihghpwyphiyrlnpgnipwjgmnjwtggiwgtrzpghhprmphtljliriryhgyhmtpitpnrhzzhtyptgtjhgphjnznlmjrimgtpgmmmwiwwrgzptnnjpmzripnzpzyppghmpnyyhtprhrpwpinwjhtjyhpijpppljytzmjtztrtgwinltnjnlyphjtmimnwztlwniyiyghiprmmgymiijhwlngyzpgwglizylggtjjtnrjzgmhgtwgtyzwitzhlgzgmwhhwgttynyzlnzmlnhmlpjwjwrjjzwtyttrippnphrjlprtzmrrzhgijizmpmwztiyprgytmngglmhjyiwmjimgznrhptpnpilpghyrjyyzitrjtlwmrzlnjrjjthrzwygpmyhjhypzwwphjyilzwinwlwnizntrrzgttrryjljipwtjwrlrlwjnlwltpjhpjrpgpppptyrnmnhnylymytyprwhwirmjjgjnjhmlrwzntlrymhtlmrmizrzynpljljlijlipmjnwhrzyznhwilmprwllwwtntlyhgpwlgprzmlmylnygzpwpyhtmrnwrrjrihlwwwwgzynjrjrrnmzzpiitnmgwgtrmnngtwlijtzwwynjwingplmpjgpgwwlnzmltmiwlnilriggmnpriztrhnrtphjghltliilwhjjwjghwgrjlpmyjlrntyimlpnjrhtwwghlgjpzlrlhrgjtpwgiyzmnhhhimhrijwrlrimrgyrnypijyrmgpnpljhtjljzpitjmhimmimizzgiijjnltghzztmjmrgwitntljiiipwgngytmngyirgjrprtjynrpjwlwwltiwghpprwwirilnmrtwptmhzrhjmpywjjwwiwwphglihzjjjmhrpywwpwpgjhirjmpjjriwzgngltpthnrmzmjgzymmjhmizhthhziwwhjjzpjhrwlmmnplptjmrpjgynmjwtpzwypwihrytjnzhrmtyjtzzwlizjhpgrwhhwmlywnjzgtgyzmwnpjwrgtymlgrrzrtgjtpnltyplyznrpwgznlilwyzngmrrlgwyttmyypzzzpllrhniyjryprmziimnjihlijrgizhlhmwrpittmpppjpzmjpjwlzpimnlllmmylwngtljlhljghjzpgrrjmmmizylyhmhjjppirzmnjztgjtyljimgwzgghpljmmwjjzziwphrzjzgmjhjzymytptgygizwhznnjmygwmtthnmprizpijwghlyhhmiwggwpmmpmmhmmjlimliwmpnwrrzlptglmtnhizlzrwhgwrwnghwgniljizglijgmwjlwnppmlnmymwjgmjmwmhpngnritnntljlymjpngniwlrinjjznwilhtpjgrgjztgrzrmrlymplznjijphzjzmnwmtwjrlihpjrjwwzyyrmrjigrziigrmyyrpmmmhjizrinpghlphtgnimgrwtjnhrjiplrtnprpillmzhmjjtlttttgwpwgylhtztljwgljryihmwmnpmyprrpihjmrgpjpmyijiprytnplrgznhwjrppwwmiigrjjjryrwmljwyiitjzygwntnrhmjmpmnhmnimnyztnwmryjrrprmjrzggnzhlnwtgntlwytzhzipiznpgjwpyrnwyiwgzgjiywymrrrhrgphygpjtzrznpntgjtzrrhhpilwirtipljyyhllyilrniwiprznirymzrjwwtlpjlpnwtnwhtwwnjjylnhjyijhjrnprmhjirrltzmjzppnhrrwilwmlirjltyjgiwhynlygrginptznzjwpytnpwinhhlripthrynzmrnwtjlhrwwymgzjmlmjmlwnjttmnygwrrippprlwztplnyliiljngyngzzyyjpypyhryljhypihymmzjnpnlyjnwjtipgmpypnnrpthipnhnhjwzwywmyrtzthzwrzytpjnnlrlpprzhglyzwpymgnprlrtjgyhiyipzhrrjlgnjjzpmypwgjpznjnjitywhrlirzjijmrlnpzlpyjgnwphthzrtgimhlryimmligjymgznmrmtznywytthmzynppimyznjrhnrrlglrwggwygtmnmynmmywyppnljhgmwnlwzwizljwmtyllhrzppyzylwpnhnjrjjgzjgmlzhiwttpnzmmzhppgmjmwjmgzgtwmjtlrygypjnmighppghpnwjhpmwhwzrrjtzynywttmgityhjjwtijhyrjtzjyhijwrnyjyzriyhhwhnrhwrizjjmjwmtytzilwyzltrhwpjhjprjpmwhrgwijyligrmzzpyjtwnppgphmhiwhngttgghttyzmgzinphjyzzwgrltywjyllwthjjpnritttmpnmhhtrwziigwnwnhmmwinhgpymipyjlnjrgnjpntyrzrnnwzzjgrlttnzzzjlgzzzytygrjhwjinltzzrprnlmwntgtywiyjtnmmthtztrwprpniwjgymnmmniipijyjrzlrpjyznpjlryyittngzpnrtlmgipzztngyriwlmymrhjwmppgglrgmiijihgzlggprwjpgthgghwyzwjznyhwjwpmzjjzzmwgtgmrihzwhlzjnwrpllygwrrmrplwrimnttmnjpmtmttrtrgtgrwhzihiyzgmppinngtypgypnghylzmhpjighjrlypnzgrymiyyplhhzjzypthtiihjyryghyrnrmzwriitppzwzlnglntzjltgijmmlhwgzgpnjnmlnjtygtlglpmjtiwlptrrjwgrrptgyiypgijynmthzhjtwwtriiggmzjttjjpzwwznmzymnpjmgmylpngjjjzjzthrnzypzyywlzhnrytigpmjymzllppmgpwhglzntnnrznwjnwzgtrrrrjytipnzihjtihmtwmigtliwjplgmgpntnjgpprlznhzhnrmyrgigtiitwrihpythtmmwgiyhnmpyjpjgtljgthpznttrzgzhlznrlrhphnmnylipjtphjmnripryzintllyznrimgrhwgttjgjgmiwmpthwnynmjrpwhjzzznrjghhmtlitlrtjphrjptrygtggjiwpzhggrhwrwztpllymntpppwjziljiizzgignjhgmgyjznrpmiwigtrptnynrtyzmjprrgwnpztgihtrljnptlrzgwjmziwnrgnyhwrwimmynlnilryyzpyzlltjizmrnygznjzmwjjrtmzwmimmzwmlnwjmgrjnplrgjjpwmppmnmwhynyyirynjprnzmnihghhjpgylhrptrmzzwrprghhmjjmpgpirmmwtpmlwjrmrpzrpzhlwzliigmzhiyziwipryygymmwjpgnillpllzlprnzjlgtrrwhlpwwzhmtnrtmtmrwpzmmyhhrjrglgmtjzjhijjjymhhwwmmhjrimwmllhnjimrmwgrttzhtlhzttphwmizwmnwwwgywrirpmmryptnyyiwzmynwgrjwiwiptittpnhpizthriwyiiityzigrgmgrlyitliwiljlymiinnnrpwpnhpnytihpilijjwwjiintznpriihmyrnnhpnizilwgpigiylmirmjwwtljywznwjptriwigprwjngprtiiynlhggnywwzyliwyjtjtlnlthgtiwzglgirjhrpjtwgjhzpnylhwggrphizjmpjgintjtmhllgjrglrwwnpjitmgrynwztjhmrgtgphizyrhpitwhyijgwggnghpnnmpwwigzlzmzgmrgjlrzpmpzrlhriiphglypnjhlrmjtzilglzigggilrlwnljjhrwjhzjpijjwizimjinlwnmynnhhzyljpthijgtyygwylhpyiiypwtjlrmlywppytlhgtmyylhlzzrtlmrwrmwhrtlpghizymwthwljjtjnrznpngllrygpjzmpmhljzpmiplignttrnihthjzgnhthmypiiplnpnnntignjmjlnghrrghhttnmhniwinzjgzpjmymwmtjjgygnjgpjhgwjgjllgzpjmmmzglypgjygiywrmgtwljwtgptjgymlnggjimnmjwgmjllptjyylgtljwiimwrgirhllmpghiwlnrzzpywnrppjnpplpgzgwihipiwwnyrpzljtjnlzpplgttjpwyhlpynztmhlyinnhzjtywiiigjjjnglplrwttpzznzrglgyypntlnygwntyzmmpmpwljwnrgppwntwnmzgnjizpryyyrhrymwphmpppijpyygmyrrjwgpnmgphtgjyggmilrnlpyzihijzphjrnzmjtrtjnjjhmtywmnnilizhywwylrlprnyylllrpplhtjrhmjwtmzwwiltlinyzrwgpwmhjgjjhipwnywyznghzzghmtprtnthnttgywtyhywmyrgznirhtwzzjtypghzrgrptgnlthhgzgtnmyniprmipyrwplhhnnpitphyltnwjnhmtjiptjygmtphrmijzpygrtpgzhnzwwrgmjlpgjjigyljphwjpirjpttyhwinihijzjnpjyypgnmilhirizyghwyzgmpiyizniwhwjhpwgijmttjpgrrywjgtngznmnmnzppmpzjtzgmtrrmytrjhzihmziilrgmwjpmijlwjhjpznjjrwhgjrhlhhhztglglmgjgnptrrgzwtjyngnmyrtmnwizingjihgjghptjitnmzjrynmlyypzjyhnzrppjwwgymlmhyliyhpijygimiylnnijthwgrwjglprjypzlhgmtypgrhiljmhmzmmrilwggmrlwwgpgjptyzrnrhimtzgyrhtrrnnjnrrtrrgimrzlryptmnzlniznpiziimmnhjmwimjpwrzttygmwirwyiyjnlwlyjplthmpitimitmmnrpnzgymlijlzwpwzymilzgptpnmjpmjyyrzlztmthglwzhzpyjzyyjghmpylwmtwtngyrpnjmnzthjjpztjyjlygtgmnlnyijtywpnnhrrrlmzjynzjnywmrngzjmyningmmypytiyjnmlnjpiwgwwnpwlntymwtywmmlpmlplpgljjpnjimphlnrtizrwpmtwtmyylmzrzgpwyjhwwmprhtglltyhjtlygpzpwzlprtwwjhrmplmylghjzlizzyynmhrztwtwjttpzwnpihwprymltjwmggjwriilmrrylphwyiwlwplyrjjrypwzyhingrzlhgtptyzrymggylrnljrtphlwlnthgtywgzmrhltlwlpiylrhygtnhlynmmziiihihymhhwjzglyjmlppmwjlzgmlzgzjgnnzmyzpgjwjihttjitpgnhjyrhhtrnynipmprgjhwrmmzyiyrypmnypmzinnnpyirnzymwhpntjnyjihjmjtrimjniihgwjmmimtjmywpylmwzwjizlzygmpjipmpgiztznmzimiyztzgwhgpywpyrwjywgnyiwygmygrtjhhrrjnjiiggihhnznztztrprzgzrjyylghlzijwphgilhinwriwllnpjpnwimhiyygizttmizmyjtnlwtmplirmyrrrytnmzijpgylgrmhhrmyjlpltygjlyjhzphmrmimlnprnwjrtyztlngrwyppnghnhtwzwigiijtzlhpnjrtwhmzhwhrpywwnylrgnwrittjrnpptghgjmppnzywngnzzhhphrpnywrlgnilgmpmthijzypglrwrwztwzmimzmmwppprmylgrlrytltwgmmmyrrzzgryrjlphmirlmrgpgwyrtpnrthtywghzinwhhlwnrinrnhrllygjrtrtgwypjphzphmhjhmnrihhpjiplpnwynjnttmzglnltiyyrttzrmmppwwhmwzjpmlihywizpgmnrgrtipzhgliwriggihnphgmhhmgipiywlyhniwrjitrnjtmrrppimgtwjhmtryylzgwghmtjmlinmzwltntiynmyyjpgwiiwtyljjmmlzyjzpnhpphnhhzlmhrmjjlpztlzgnmwthmrlghyizpwmprtwhtpgzrwpnjrzmmmypmnnwyrhmihpigylzmhlgpigzwwmntzyihjzjwzggpmjphnmwwhjwhwygnlhpnhtlmzpzwhrnimjpnrznjgyhpijnwhhwlphizziwzyzrzjmhmzpmzitnwtwlynlzpgyzhtmmpntjnztrhijmwhmwtyzpjggirpwrtmyljiyrhjmljngwnzjhyngipzhiwmywnpryitjhjnplipnggwrmnpmiyymrrnwjrylnijymmhmtjgmwtnrmjzlphljwhnryrglzylnjhyiittghgrmtzthrjmjrijwrwhlgjynjnilgjjggjzggzjjmyrzgmntmlpgjhtlrnygzgnwiingrtjyntnmhmihmlmhywprtrzyyyrtgjgljhwywryjpypwirwrtlpwmnntzjyhjjgwypwnizmmyyjnipigygphhtmtmrjrpgtmmtwtwnpgywhtwipipwwttytpihppmngpytijwjpzzntwpwrmwltyghtwlnzlphltnzrhthiymypnhrnirghrppwhzhzlnzhzgmghhtyyzwlipznzgpjmlymhppnhpwpjjrpnttmhhmphtgrylpmjpirmhjllwihrjliylyrpmijtjtpzwnppwijznrjrgyjwrttjtjnlgmymghjjynrpwyihmwztpjnihztirmgtglipnlwmztljpphilhgpzrtmttriypwipzhypywmpyhlrnlwyzytznmwlyhtjlltgigigtyzrhinlrhrlnngritpttynpzzgztpplrgiylphyhpmtywpgptgtrpjwyzzhmwitzmijmwtyjrwjltwjyhytzhgtgjyplgmwlymlpygwpljwpmirwnjjrmttlmmrztlnllzwytpgmlliyhjniwjlimghrjgnmppwnhwhitygttitwjpigphzrizjgltljgrphizymhwyiwyzzygtjtzrylzgrtptywlitttlhhyrnzwngjpzyphlgpjnnmzjjjinjihiljrrljmwjzwztmpzgtjtthmlzlnrrzlgwpzltzmpprnpwjtiimrywwgnmwijlhhplggitwngzggpgpwrhnttzjiwzggmhzzpwtnjlwnhlrmwjnhltzhmirztityyzhmirmjgjgljjhjijphzgytiprrywjrjlrpnztjnnhyiwyijhgpglygiptrihzngzryygyywjwpttppygmgyjzlgwmjntymlwhzmtrwmnjpwijlmgwzmrlywnyyppggjtmmzhznljrlllnzgjlhplwlzlgltphyjhzrtmwmlmrnztijhjghttlmhmywtgtnjlwwnpptymgihlpywwjirltzzrrwpzzwtljzjwlwwliimnmwtppwgnnjtmzpjtrgiznzgttllgjwnhltjygrzhrnynmrinhtgzizpzihmitrlghpgmmgpzwilzlhighlriymmtymiwzjgywlwlhwtznplyiyrltpjrrpzwjyylhltnhitlwlwlrnjljyimnwwlrwrlylniznhzwjigtjnwnwllrzzmhltwinhjgwjpzwjhjgyjmhywjrjplilmhtytrtymglyimmmmzizzngzmlgtlhwhzprzpjmigynnjzjzyzzplnhmlzhnwlgpzmnprgrimiyyphgywiitwtrggirrmigyyhmlhzpllrzgpmnwlmntnjiwhhnnnjywwhwgtlthprpnnyittrrninpwyhnzhwzjtwljiigmmywyjhptzynmmyhigpjiijlptwplytnrtmglrigjrhmpitimiprjinmlmigwpygmijyljnnjyzgmwinithlrggjzrjtyhinwiritryiymywgrlywzhyjnrliwitjhpnrnttrhgrrlggnizltpgzyllnigzlwjpmjnhrpzylgltwlyypitpttmmlrijrjzlyjyhwygiwnriyyhpwjwrntmjmmlwgmzytinwwyylhlipnpwjgyptjglwltiizphwzmihitgjpzgnjwrrimmjjghzlltzztymmrnigzpzirjjzgwihlnljlthgyywmthymgywtlmhgmrnjwjmjzrzwyjilhyyzgnhpnijywltpthjhjwnggnzzlwnmiihtmtyynirinjihymjpippjmrtgpzphrinhpmzwwgghygyyrlwygnltzpgnzgwlzwtimjhpnywzlwitwrppnmmnwwzjtyryziylmrymprnglwnwtngzizjrrlmjripwnpzhrpgwiiritwirmynmzymlrghpggipyltnyrnzyhiyzhpzyhpzjhhigirhtmzgtpmygppmjhrhwjwjrrpwjryhhpnlgpyrmzngwgztlpgrmyymtygpizthizypjmgtjjmljgmjighghtjyphglpirrrrlttpjllwjygphztrlmjrmtlzymhtyhmggmlhmlnwtwwghgwttizniphlylprgmlwmywjptzjhwmthgltirjmzttzmyiltpihriwpzgnrrimlygrgllizytwmprhhrpptjniiyyrlttwjlrrnyhlznripjrhzihiwzzhhygyptrlggwjtlpgptpmlzizmirnmllztwhppmythhwpymjhwzzlpprpjznynzrmwyrmjiinipylyzzlizgiizllpntmlwyjpnllwhmizhhnhmjlmgiwppzlglmlngzhitwmnwtpyynzlpgtiyrjnihpjtmlggjlirrntnmgmzplgzghtrrtnwpjmihywmnnyhwziyrpijygigphjnjrzjprpzwhpyjtythzyginjnynthrinwjtjwgpitnrryinzzriyrijlmrylipwzrjzjlnwpzrrtppiwzjyyhnniywznrwyyzgwzlhijtyjrzjtwnjtygprnzwjijihyjjhjjihpppnlghjlwnnmmwzhhjityipgpjyjlhrrlljrizlmyzrpllrmzrzzlwphhrmzgnrnntimjghrjlirnmtyiwyirwmyjryrigytntgllgzmthgzrhppzgpitimwzlphzlhwjlzmzzgjzjppwhghwnhhjtplnrtrhmzryiiyinzymrjylnnnlwznggtygwrglzywiiygjymtrprhihpyrnyngylljmwywghiihytgrrrwwmltnmlprmijnmrtnjgzpgypwllylwymhnjhizpzhzwjgtmyilizigrlniizmzwpjljjznwppwwgygzwwlintytyzngnyzhwhwhtwiglhtwwjtjzitigyighmrzyzhgphlnizpjmnhwlrtpntjzilgjyrwgngrzthjmrimiztgwjympzwwntghgmyginllzhjtiwzijtpliwrgjwptmgjziygwrpijrlimpyimniphjzgjjwjppjhggiigpjtzpwmnnjzwilptwrmghlmnmjjmmrzwhrnjpzrgyyylppmyjntyphmwnjmzjrnpmtzijjytgtmjygjjhrjzriljrtmztpwlgyymmllgmhrzplyiwhrpnglntyziwhziyigtrrnrhzlgtrhmhitzmjppgltrpwhynwiggtigirlliprrwngjhjllnginynwrlptjmllnwwprnwnrwgypnpzlyymgljjpngtijzhhmwnzggtmjmptgmllhztlnlmijiggzmgizigzljhzzzhrnilwpjwihptlpynitwprrgijjyyzhgrjmwypgrwlzgzlwygrwznlgylitmjjringjpjtnrgzphlllrwzjpihmmjhzzzpnimnnypnhmypmgwhwzhhinizymtjpzhyhjprmlplgirnzrmmzmnmpwpijrizrzwgzrrmihrwmnhhgnnglmlztwtyijnggnzypnhjiirjjrmipnhmjzpnzpmgizgzwpwlzwzlgwzimgyjtltmnppzywzyrnnzgmngrlwmnjzwyilgrhmtwgpiznyjngpghnliiiijrggywmtyintzgjzglmtpgnjtznttgmtthpggnlpimzrtgnngtnmtrhplrmrywighiyjmpjirnhzplgjjrmnwtltghjngizylpigyzyhglrtrippyhnpthlzhpmhzwyztwttptnzmptppyhwtmirzpzwmwlwrrighyrrrjlyyhllnrhryltygyjlrrlmwzhmnlhzjrzwiyhiplgwjrlnhwytntwhyriywrmgwmthlppjlprmrmtrjwpjgmmtlimplrytjjrlprttznzlggwhhwzwzrttiihtjgjiyymzywwzzgnyngmmtnjzmtilwjtnnliiyntlwinyrlnjtynjiljtmzztyjnggrhngyymrjylttnthljwzmytjgiiypglpgwmizgpmnrpjjmnhyhjwpzminryhgznzrpwrgmrgmhntznimypyigjjjpghlwytjphywwjgzhgmmzrrppyiryliijgmznyimghwrzhnwwwyppnzmwrzzhjrjgzlimmhigpgpygirwrilgpmihhlrjnwjririztiwmlitmtlniyijrrzrzjimylmjlhmjptljtlmwjmhrrtmiynmiygghtpjytiihrlzggmmmtinjiihyljriynhhnpnjlzihiihnrngjnnmtmrrgigtzztwiyprgypwwgmnnmtpriitlzppywlwzwmyrwllighmjhhylizhzjhmwwpizzjlhtrhrgzhlprnzhrtiwmlgziwpyrmwjpmlzrmynmmijnlwwgnpmgrgwwwrgwwwwytwyhzgitlzwmjtznizjrnzrihmhzmnhtjzhgtiwmgippilpyzlzplptrllzmwzlwypmjzpjrzhgimwnnmgwpptjthiijrpjyglrgzmyhzyzppmttwglhiplzphhrprghzyymhzyprmrltjgjmntmizwphnltywyhgplhjphylyijytzztggzgpptthjjrgntmwzinjnjghzmphygmrgpymyrpwmhhrinwwigryhglyjhytpjllmmrwnlwinlyhggwgjjzwwygpnylrhipzjilhgyiwwnlipmmggnlpzgzgpywtphzizhtplpymyhtrtlzzrhzgpjrzpwlmtlwylhyyijwlwmgmmzptnlzrwtrpipngnygwlmniymhjprwmhyrlwnwgzzpmwthwznhzjmpgltpgprwtzypnnjitggyzmwnwypwnpjznzhrtwnlgzltmnltgtwwggrhjhrlgwwljpijlmtrnhzhlirhjtwzznghyhntirinztjggwrtgtmwhgyigrpmgzpgigpmgjinlpmtiigrtwizlywwtjipgjhtgzrllhlmizywggplgzyhminwjtrjjwprzjhpipygphlmzpnplinwjirzmytmjmjpygpphhypyhryttpgrztytzttiigjjthilmggpprnyyzlltlitinwmhrmnrznnnwwptiynyhglgglrtjnmizitylzhmlnziyrtmyrzzigliilrijizzzyzwphjlrzmiywpwlhwtzjwnjlwiyylzjnnyyywrlmrpyzlwnjhhitryhyyjtgtgppnztmhwjltlginlthtnrrmlhmhnljnlnpgrrlththtpizgigrhgtzwmttmzzrgntirhnynmlygmrrypgtytwmggryjprnllywziwzyyygpyztwwrgzrwilynitylyhjgtytmrrhmlgjwtzzpzryjzrltgnihizinwgnynyjgyglrgzzthlhylzpnpwjhwjlmniwzrtmttiptnmjlzgjlhtntyttnglwpzijlizmpnnwwpglilhtnhjmmhlpwpnzgtjpijgzgrlnzplzrntzplpmhrwrjnhntpnywzgtphlzjtjzngihmhwpyplngljgjmnthmgtjhllripwywlrzpmzmgllmnhjjwphjlpirlznrlplgywrwhinlnhlmzghlnhljwywmggwilryhhzptgjnyzttrnnpwjzwjwynwynnymlrzjwiwzijgpmtrrpjyphjphrwhitwwlylztwztwiwmprlwpnpmyzitrlwhintnlghzywwgtgjyrprgitlrglltpynnwrgjhpgtyhlymythritigwzhyglmgzphyhmpyrjzgltynwpimhlhjthylhzylwgmppphrgrwilzmnwhhmpilmjyghypzpphzgwhiwmllhyyntttzgzinhwhnnnnwiinngytyzhtnptplrgwzttllyygjmijpnwyjiimjwtnzgjgtjpitjhmnziyhnpggmwgmgrzprzgpptgjzpirtniiwhpzlzitrgrwyygrmplgllzrmrlrtmmwhgrhhiirmnyltiiihtzymnmgjrnhplpjnmznpzwlpyhyirrhhjlgngwzmmwrphipppphjrzzyjltlggmwiwphyyijmhzhgnygmrynlgtmzgmjzlphhttgzhwtnlrjntnipnilmntttyjpriwmzgzjmziiwzihjgyhrggpiwrlmlyrjhiwrrlmpzrnmgjwlljmmzmzwjmpwlpjgrlyzinznmprihlltztwlwzniwhgpymwpmjpjpngwprgphzjwjwtmhglghprrhwghmgpgmmpywthzhhgzgimljynzrlwpyjitgtwgyjipgnzzwymplmyyjrhltzwrtwgnlytynzyglnnzrnzllpjmrlgmtphwyjyippztnnwzpwrhrytnnwmnnngpypzgngghmjltjlwympzmiirtwwtiitlyltjgyhhtlrjjlnwtzynyjzllmnlnwzilmtytzrgyywttyigtlwptpzhmngwgmzrrntzyhtmninmhrmmhtwjwygtwiipyijnmlyzwzzliltplzprtrgrmhzjnzmwmljwghjngnnjwynmtjzlgplptjipmiinhwyjgyrjnzryhmntphltjplppjrtyynytwwhngjrhgtjrlhzrnnrjwzzyrnnpiyrhmthgzrrmnimipwthgiltnjmllwtnlzntyjrzjwyirtznrnziimymrtyhyhpryzmyyilzngrhzhlrmwmzgywllplhhpmhjihhhnnnrpmwrmllwjzylhrrgmpnhgwpinlrwpwtiywltpwipjwtwmmwggjgnjpmwhigptymlpynjizthwpzrgytypyrynngwnmjyzrphgynmlyrirpwjrgphriwyrzttyymyljhnmnphhwwnpwniiynhzhtnwyjwnpinigtghgljmnjrzirtyjiiwznjryhthrnjwwmgrjpmimprrmhhmpmrhlhlpinyytlrjplpgltnwhzjmgimtmziwjwpjphphywjggljrtmlttlwmtpiwnwytggmzgyzrjylztjiwzgtmpwijjglyyijygzylhwilzhpgjrizhhlpjlgytttzjgwmryyphinpirrpjzwmirjpggpjgylyrjgplliziwjilrgmwityzingnlmrrhyznhwlipzyrrizygpppyziprmwnilynjnjrwwymmwplpgghiwhpwtimzjpmjrwwppymttylgwrlhtwzwrwyrywjziwptlwiywjliynphprryihnztphhpnrtigliyjytpmtywgntjmpmlgryjiwmrllligyrzhprljtwhnygzwrrrjmtpmhzwllhmwtyiighyymnpmpwwgwlihyghmtlngynjwltzgngzytnwwtylpgimmhnlmlgwhrzpyphlljlwplngnnirhygyhmnwillprlhrpnmghyrwgnhywjypwmpywpwhnwigpwnnllhmgynhnmwpihzyplgrnhmlzntgmzmypngrmnjzzmwnjhmttztpmnrrghhzmrnglrnnjgnjgzpwthtminmlzmplylytwptypiyziyrrltwgwgnllrpnrjyzhpngmnmnrzlmlizwyggwmmhlzlrmgzzwhnjjhwznttjjzmwmjmhzymtywiinwmmpimzzgznirrnmyntthjhggytlhygmrtlhiwpinlgyggijjrryrizljjpimizhtmrirnhptyrgmthpmtmgrwgggmywgmytlymynrhnjhtjiyhggljzhrmnpgzrrmwhnhwhhlmpyltyirwwmhzjytpwmipjtmhjplznlhnmyiyzzglprggirytzrwnlingmhzmlzmwyhyhzrttptwymmhnjllrlhjpihmrltwmrwhniwylygtljmnllmrryhzthniytwjlttrwzzliwghhrjzltmzmhygrppjiipyzpnyiyjjrllphljtwntwjiiighignmtmmywtrntijtpylhrttyrtggyjyliipgzzyhgpmlgmpmpwnywhylwhtghgwnrpwyzgphtgrynmjyhyggthziwjhhrrpjpllmhjjrhhlzpnlgmlijnwmrtjhwlijrnjnmphgmwlgzywtlpphzjntwjwzwyrmzgnrwnpptinjlmimilymljpgrlrtgllrylphimnhwtjlgjjhytyyigzwnpzghyynzzzwiymllmyimmzphrpllwgziwlhjgzmiprptjzzynyhyzymlrmwtlztphhjnrhpwptjjnnhhmtyyrjyhttwhwhwnhrrzjznyyhlpmwhhgljzrllhgrlgzppyplttmwjhnizrwlpppywzplllipmzpjjhyytjzrrmljlpgihrjrigztlgttzjjirzzlpinzilgrgtnhhziphzgrylwmmiizyrpiwgzlhplnzlrpwhztiirtpjhphypljltlpimzmpmiyyrjrngryyltttzwzhyzwpngttwgliphgnypwpmpythrtizylzhziwlzjtnnzripwjlwiptpwlyilylmlrityzhyhimrrhnrpmzhpwirmtzjwriyhmpyylizjltgyjzlnrwmhyrmnimzizzhhlyggtyhmylnnyrpjzmjyrmjirgthpjwnzphyrtnhpwilziphjrrimwhhipipmwhpgghzhhhhinmtwlmjhmlgpiiiwjhjhpwzrptimwhtrgznhihltjwzgrzhgprzhnmylztrhilhgwtwnllyzmrppnhgwgztgtrymlhiznmgnityjrhmgtzyiiygmignnzjjitiwynmwrrmjjlylnhigjihtwriwgymyinwthmzmjwmipimlnhlzizlzgpihrttgznpjtprnimwwpnlijywtyptwrpgrzgnyrmtmmggnwirmwnmhgtyttgyzjipmhpyhwwjlingzijmlthmypmwnhjhihmmngyzmtihyzrtytptwjiznyjyzizjghptwztntwlthwirjtpitmjijnrjjnzzwmjigpnjwyhtiphgpjzrrzgpjihnpryiptmtpzphngnrmtznlwzplgptpmyllzzlmjljyihltngwgpinjiiwtzyjiywmhmlrmhhyjwjngmnttlnthjhniwmjzmwhjnjzjygiztywhmhttytzilzwwhhtmrtjtrrpimznmlphtgyzwzwrnljmyhmhzjltlzthlrwrmytiphlmptligmmmlyyyphnynjghtwnltjhyiitjghnjrhntmlzttrmjhyngjzyirjtiwggmggtwmylljrlnyyhljntwriwywwytyilrmylgnpwhgrypinrripltwghwytwinjhthrwyzmpjziztnjjnywnjnmglwigzrwthtltmyjmrinhjntnpimjptwghtmpipyzgrnyhgrtnwrpgmjmpjytltmjwmhtjliphrglilyzgyimhhnlnmwhrzrigttttmthmmizhhzylrjnnttylnjtpylgllgrnglimprjhrggiwplymhjtzwgwgllzhlinyyjrhrytpgngmjpthjpigihggwhljwmlgpnirltmngpniytlwmmhpiijiwwrprpzmpywjiwjnjrynzpimljygwmiphliplzyzlpnmgmtztmlrhggplplliriprylijrhthnwrtphwjmpmipnnrwjiwzylimrmpzhtnlwjntnnhirinnjngylntpmhttrrzpphylzyjngmjtgympyyprhyrhhhytytrzgrtwwhrwwpglwrjmygghllhyrhjjgizmtmywnmtppwrnzjhyzpnhzzpitgpnwptjwigzzlzwmigwrthmphyzhynztrhwrzrrpimwpgiiwznprirtihwiytgrrmpmpmyrrggynhmtyprzihpjtyinjhgmgjttygnzttnrzzyiwlygwiypwjhpwtznyzrhptijizpipwjgzgynnniiimgimyilpzwyhmlhwjmtgjppglymjynjwghlwptminljglgwrjmlgzmgzzitwmwyphnlmjmylrwzjwimgmitwwljylgmjhjhzwmpnimhpppthnwghppglgnmpljrylymnzzyllpirhnyzmlirzhttizgginzmmmrpzrwlmligrnpnghrimltyzjiztwjiyizlhtjprpjhwztyywzwywzyjiwpngizjypylpwgwlmzlznmirmrhzgzmpitjgtpnphlttlnhiimrpplzwnjizztnmrmnztigmigwpmrzjhnngwnttilzhjihpjyimglrityltjhlwyhinltlitwglnwgrzrtprgnllngrjpjglitjhirlphyimnnmphlirmllrhjrylpgjgzzttrrtymntppinnyrzjpizjnlnhzmiihthipzprpwhphilhghtpynighiljtyznihgtingywrtzizhlphitpprghyrmhhrwzltzhmjtylywwnrwjyytjgmzipjjnlgtniwhyplzrmttghjgwpjiljtlyzihpjnpgmgzlmgrlzgltznnytplhypwwimhgynnhnpmlmhzrzjrrjlmizjhnhpwltiimjlrphrntwyjnipjwzymrgnpgjrghgytmgrmigmmwpgjphjwrlrpytyiypriililygriyhrylhyplyhiwpwinwjmwhzpihphplmjtlhtmzjiwzgljnyilyjpnlzlijtlyrtlhlptwlimrpyzjghwnhghmlrlmmniwryyplghrrnmprzrhhynjjjintnlhnirygmynzrwnpgtghzyiltjlrtizhiizirtithpjnrlgwghiizwhnymmpnmggwtnzyhgtwzplghpjgllzwzyplyjpwgnyynzzmgripinjlgnyzywpwiwnpgnypnghtitrwzihypiggjgrgwzigpghghniinityhlrgjmmgngwpmzgztjjlztrhnlpnwiypilhwjphrwmtynjlzlgtiwlriwwmjilmntmrmtgnnntzjthitjwmtmrmzggwrjpppyglytrzmwilmggzrmgnypzhrhhryprnnminylzwlnzwzwmitjriizlplnnjirpywnhrzphwmptnlwwyiypzjiyhnnjjghglijngwjwhtzjrjggjjwmlhiiynrnpymggmyrrtynwghhmjphjlmpgmlwywppptpgwtiimmlwiiwmlrlytimgmpgpigyhwlwwggpgirtphlyphgjtihljhhggwrgztwwgiwlwnzgpyrthyjjjiiglmtlntpglgjzirzwwtylgmnhjzrgpnimhmiwtpnhgrmlpprhzwnmnnmzhminpmihiijnlrihrggpjhrjthgjrrztjlgztphhwgyrgwppgjlnypjmnlptpzzjrnhmwjlynmwttrlwjygjgjppgyptynlwygjglrynglgthnngrltimtzmjplgrhrrjrwgpjzznnrjwpznnlnzzhzhgrwzgmphnjywtnltmzirwtmzyizpzjzyhrmppnytljpwzmphzwygitzmhypggmthggjiyyplyrzgwtwiznggnngrlgzhhlmimjgrhiypzgtmjgtttrylrgjmytrirplpgyrtgjtjmzzhzmlizrywlptjwnmhinpyrrznppgtwhpljwhwhmltmjlypzjzjlzzzrmzhzgyripwyjrlgwrgztyzyjpmyrpwwnhlzmzipnirlwtmzwlnhjrzpzwryyrymjwhtzylwrnyrzrjimwmlgtrtlmpphmygniwtgpnywltjzmnjyiypimylplyrtggmlrmmnzzwzmtjnhznjhmlnjztlgpliyyymgjjpppynnlnlrhptryltwlgjwtimhhlyinyrhnjgmtjzpjghrwhjlwthmntplpjmhnpjwnlzgmwglrjwtihhlytngwzntnlpjyhngzhyyziwrjrlglzwjtggphmwyzppjwjpzlmnwinjprjghhpwmilnphytmlgrhzlhphhyhniwmljiwntttlypgpphmmyirphtrrznhpyjtrytjnmjiirtmwpngztnlyhwwngmtjrhpihgittpizypzgyijppzlyywplmpjzhhglwwnrhngwnjjhnjznjtzwzrijmwmitzmhimtjlywznpymwymitzpzzzilmgrlithrwllpmnnwpnghhjyjzjlymptnmttwpiygttllmpjyhriiwljytirrhwmmhwlthtlwjgnlhhiljjlzmnylzzjrynirtpplnzwrlrgtmprgyphmngphhmrlyjjimlzmmzjlwlznhylmymtgmiywlgnhiyztlrrnmpjlnyyprzggtjgwztgyhihjmjjtmrwrpzgilytwtynlrzjgiigwpmrnnngpzwimzmmyyzzlzzlhrighlwnnlrjylnjphngmlnjlnhnzjmlmynhwmimjlinmiiygnhipmiwjpyjijzwrlhjytrypyllmtjtlzpminjrjhyjtipmznyhwpylmrzlnitrpmmryhyjwzlyjtwnyijgzjmzirwyjlmngyggiijihzpttnlyznplmizgrghzitlypjmzzlltnihhghhrtpmljrtprlthgthgylrjgwzjhyntnztiminltjipnjzgrjjlrliljhpyhtwtppwwrmlljyggijimtglyhpyplrtwnlwzjzngrwhtprwirrlgphyptgwtynwmlriihllwgiziijtgzwlrhzwtmwyjwzmttzgnnwnwtmyimprhgymlryngnywlttlhpnmpyzytlglpgtyinzjlttptyjiiytmrmwwgrnyttlhzrgwgthytigiwtjhzlilripljznlhizwmrtllpijmpmngrwzhjwmntmhzhgjgmghhyyynzjpgijnzlytppgtthhrwpnnhlgijwitzllhprpynhwriwziwhiyngrnrzglhmygmhlggnjynmpmtmwinirjpyijggpwmyimtpnznjjptgrpzrjnigtyhhnhytzymlhrjgptirrwpiltgpmwzprgipjryzyrhrlgrngjpigplliwwwiyrnnrijgitinlmytytytjwztrpylhgwghigirilrimgwmgrjntjlpitzyihnhmninwwwtlgigpnijyywrtwlljjjhimylwgrlghnghwrwippnytrwpmzltrnrizzzwwhijnmpzjnrimwmmmygztmrthtjgyigljzijpwjrgjpyipniirztytlpiizygllljwrjwwpmghjnznljrzwmrrmhitjgitiyhznwphtnttygrgnjrzmhrhzlitlirtrngthmrrgyzgpwpnnijrlnlnrrinypyjrylpzwptryyziytjjmpnpzhiygnllrrjmppnjzttwrwwpjzliwiihripmhzzrpghjyltmzyllprylhyzrrymiyrmlrlzjlwgytjrrlyigjryprnwhnjhwgttrgpypminzigjzypghlimmwngmlmrgmlmwjlmjzmlnjizwzhrlirmrphhjytgrinngrighmjhmnpnttigiwrigzijhzihtntrwzirhyhnzwllnrnrntlmiygywzjjrpwwttpjmtwitgplnzrijttimztgrjhtwwriymnpnylggltwnyljlrwwnnnwjtjlgzwmlrymglrmlmjytgwymlmrgnjrrlrwrljwwgplighwhwrinnhimwwpyhztntzymyiyzgizgmgwgphjymtjtwwlmitwiwnylmnjitywjtmjtyinlrnnmgwrtgnglyyytlymhwryyjjrttmhmtwnjtzpwmmiijhtiijynjylhmplznmjmnirhlhzmitrjthpzrzpznyrihwpizzpjmgyjtwjzlmtzltytrwmmrpgztriiijgritygzmizghnhprpgzliygtznhgyiprlwtgnzpgrnzjwlyjmmitgiimjzwjnnmihrrhwrgzyjjppplrwitrwhmnrrhnrptjigmgzrtjjrlttnrmpirwrwnlmrgngpjghzznyzzjylnnwzthjwlznthlwwgllprthwjpliplgngwgmipzwmwyltjlpjhnzhhnyjrrjwlrphmjmrwhgimzrrihtjiwwmgtlzhymzhmlimgjwwypgtyztihrhhzgrgzwwiggjpyyytjzjrilnyhppwwilgnlilzprgmwhlynwhljtmjtilyzjmmmzwygwjnhjyjjnijzmwllrilwgmgrizyijlhgnmwhlytngwjlhrlzzjgyjiggrnzgyihtwhjhjmrlyhyttgrpmprmnpwhymihlyhmhirjymrtztwjrpmhzpzrynwrgnpghtiiyygmirpyylgzglizhhnmmnihtlrytlzhlminzhltjjjhpwwyniwnmiitpwptplhynlghjhizhihynzrtnryigpznjgpgrgmphhttnrzithwprghiwmtpmnyrpytgnrpzltliyngprtwljjtzjgppwjlmwgnnymlrrympmrhzpywmgmhnhwgjnznmhrwpjlrgzwwiwthiznhpjgjithhtwphripwwlppzwimppgwmgljiymghjrwmwyiyrytpymjgylhyjiiznznmphhnrtjzmgipzwhryprtwlggzihyyynjwziimnhptzrlnggwjzjppjyntjnzprrtpnwphwwphnlznitggtzjpmrpjyiptrymtzygzzizinpywhtzyhmtjmmlpimpjhihtglmzntzilgzymmhwghwrrlntzwitwgtnzrympylyyzywmhpwnptgzzyyniwhnpnhjtnptwyzgwtlynhrzyinjrzplhznirwwpwthrztlhwjimjtrmmrymgzpmpirtprgpmthrzpwtnjrljyltrtnnwitjwnwjthwgtgywyrjigyiighgyihjygtiigmygjrllgjpwzilhnzrwyjlpjpnhhrithljjmygrnyhnwywprnhnnzltpihjitimjtljttnrmwygtitnlinnhyhzhtrnhyhpmrmhihljmynrrwpmyzgrryjirmnhtzjjgnztjyjtzinyzzhzlrjzhnprljmlzphhrhylrzmpphziiyghgtjljzwwrnzwhnwwzzghjtrptinplgrwrjwyhpjlhiyttiyjwyhtrrhjzlhwgyjtytmwjptnmgzitwgwngwltzhtjwghpyrjigjmttmyrgzmpinhlptjwwjizwzptizgywrnlmizitimpzmmphzrgiltnzhgjilgmtlytliygjitghtgrmpilggzhztgzjrinngthzihhylnnpjltyngiiyhhmwymygijlziplgriyzwpnwhmrprjnnmhgwwigzyywpwttrtgrhlrpymirigyinmjpmpnlmyhllyrlrjgzlgygzwijzgrjzyzzzgpgrnrgtnjijhglygptjpywltrhtwzigttptzmyjlhnghwtzwgrihptyyzlpwhwlmyytgliimpiwzrptzilriwzgmrhmnnnhmmizmntminhrlizitwynhljjghjlngjlhpjgplglljrhwryihpntltpiyrjntlgpphmzpzmntyyjzgrwtjwtphnnzhzwrlnlngtyzyyngrwggmrjmyhtgjhtytgyzgrztgtgiwyjzwrzllznnlmgryprtrritzjgnmprtypyhmnpymryttginnhtmrgmzjjrmjjzgymzyrygrrrjmjgghnltzynmrjyhnlgmwtwmyyrzmwlppgygrhtyngjylymjrgnymmpjyjjnyrhrrnlrnzthrghltnjrhygjwwzgylztrpipjhgrzypjhlhhitnrwringhtwyzlljgttjhyyyiirgmjwrrgnrlirnhwwgzjwhgyzjgpgrpggtjiljjgptnlhmprltpgilimlwimltmplpyjmpitwlpmjwprzywlrwmtgwnjnwigpmzngrzyyyrgzpjlijhghhzmylpwnnrhymtihgzigznwhtiynzgjpirpgtwphltrgihwwyjrzjrjyirgnjtrzgipgnpywirrpwgptilwwwmpwwyjnzmmrtnyrjninjrwirghhphhnlyhyrgjmrglyjhlptmitihinnnitzmrhmgnlllyilrnjmwihrimttnpngzmpzrgliylhgwizwtpmyghhjpyyggittgmgwgwjminhnjnrhyhygnpljhnyrnprwyizzjwnprhnhrrwlhzzpggrrwylgrwhtzwjwlmjzjrwrmllnryijghpitingtlgprjinlghlynmlimmrhjngjhhtgmyjwliyntwpwirplyphtlmliriiynljplwgzgmrzgymhlrtyzjngtlgtwtrltnjnhrmgnrtrmyhhjwtznjrwwmziyhjnlltywgrgpghrgwmirwjrjzmnryizhptpztwlyziitnghtplljzmjihpgwriywytizrpgwtjgywrijytmywgijrzwiwwzzmijrjzyzhmznwrgyihyghztpzzrrgmthyhhmnhjijjmjlgphwhwrgtmhjgrmpjpyjhznrllnwwlnmjzityjwhjgypgwjyghrnztlprgmgglhlpzljptllitznrhnzlmzptjmnhhmrmwwylplghhtgyzjtmynnmjlriytlhzpghtjnyzjzglttjzmpwgjjlpnghwjzhylpjlrllnnhwzzzwpmryyptrmtnngztggjgwgjpwyimzgirtztzgnhlrmlnynrmijpryrpgtljiphziiwlhgpngwzyhlmgrpphygmmpwgrpwrzpwwwmyznlmpzlmmlpgrhjmjhwgpglgminwptwjtprrlgzwrrgnpijiwirnpzmyypyttjhlzzwlytrpirpjggwlirnrjtwrwhgzjijmlmhihpmmhnywgmihzjtmnjrrjrwwmijwiprhmtttglgmlyygtjjrzjyjwwwrlhwngggwlgjmnynyirhtyygmzmwgppriytmjptlmjnnywpwjnyphijggtwrjgzjjprltgpwnhtjirrihywirytthjmtmnghhnjmhzmwjzhgmmtprzzlrygrrgrgiwpwmzyrggmrhmrjwrgwgwlhpwlmwignpjwtjwznjtpggyytmgtpijrhtwjmhwjrghtrpzhmthtljlynpmgngwwttrhhgglimlrpwtjilwpmwpmpnnmnhnijzhmnhmriipnmzylghjrrjmztmnippijjzzzwyhrtrmjjywrgrptyinzzlnijwwwyjltjlrzmmptztprniiitwwrnrphiimrwhigntrlnymztmyzyhiyyljzgplpiphmjwnpwrtnllwmyjinwzpipjjyhhjhmnlpzwltlglpglizjlmtpjtttpywmgwtimztwgtmwzrmwhpgwwtgtihwzphjmnhprwypwhzyrrjzgtjimhwytyylnzjmwnjipjmrmiyjirmrtmtjrrigpytgimigljlgghgtztlznrzjriipphippyiningigmprngprtlnijhlmzmrythyitlgyjmwyptjmriryipyrthglyrmiyyrtilijmwzjlyrpgrzprgwmrtwhplrwziwgwiigtgglmtytwlpihptylprylyzgrpplnwpwiynrnrylzilmgjhjpinhjwmitlliyilzgwtnhnimzjllyjmwtgrhpyyphyntllnrwnlinirlwzhytnymjptznnjlzhrgmwwwiwpnmzngyihyllrnhnnmrihjijhlntmnmzwwtinrypgpzjwlijggiimjmnrmwiwllhmgtjwznhjpynphzwlyrphimzywmhmrrjgwjzhtnytprnljylhytmihwgzwwhjhgrmnjwyrrlgtllnynigygpptngtrprtgnmhlpmzlnznriiplzjylrrgggmnwrrpzrhwlhyhnjmmlnhwhhhzgpiigymirnljrrzirtgzznjjjtiiwlmmppywlwrjpgptptzllwthrwiipjmrlpptrlwmjhmrziyygnjhnppjzjjrwppwyrjtjinywzpgjjlwmizirlzylizwjmzmtritygwhthtrnipginmrnnlryrznpywnzlzilypyzrnzpmrynzzhhzripigghrwpgllnpjzrlyznjzghnmimnlrtmyltpltirihzmnlzlgllplziyhypnjztnltmltitnptjzghprrznzlmtmwhthlhrpriymngzlnliplmjlggtlggjnprpwwjwttjlwjrnylnwljptjthymzyzwytrtynptyrmzhmzymyihipwriptlnjyiptrmtjlpyjmjzpmlnyiilgrtgptjnlgjyhzpnrrlwmpjtjnwggtwhimtwtnrmiizwnywywnngmzjjwilwhtnwyljmnylghzrggnhglhpyjypijillhpggrrywlwzrrmprzwlnzlgjnwnnwpyyrtihzrnzwygjillpzzigtyigjwjiznmhitymrpnjjynpnjljtlzhwtlpmwzjnymprgtillnzmwyrjjnnniyhtmtwlyniwnzjprllgnzgwjpptilpiphyjjtytgmhylhiirwmjiyyyirypwpwlwtgiizmrrlrpipiyhgyitnijhwmyjwmirtgghnihnyjlnyjijhmrltzlrnrinmrmlmrwyiptnrrhziznthitjmzrwljiwljwmyhjphmtljwphtyprwtpwjlgpntjpzwrztyzzrrlplmmgnzzhiwjzjgpwlpiygnpntzrhmtlmzyiiwgnmlrzhmwnjhrijnygmjpilrlgwgpprhtpwgwwwyjnylhwhgjhmngtltnrgzrhnnnzwmlhwmjnpjlgjgnzmnwtrhyzrnyrntggjjllhgiyjwhyntihztnplhwyhlptprtrztlimrwwnyhmjhpnltppnhltpwlljyrzhywzpgingmmgjzwrmznhwzliljznjltgitypihtwrrityjmhwmrrhhpymmjtytrgiwzgpnlrmmpmimghzmjzhpmgllnjtwznzjtmjzzpzhywgngjtptziggijgirlgwirnwlppimlgnnnihglnyghyhrzwjilihzzwpwhigzhpgjzlhnniniwygrtinmlmgtjimgmhwgrzirtpnillgjtmzljlimpjrtlwzjmgnptrpjwjltzntgrhhmwgltlwmwjytgjhiwilyrgrggnwhimlimnrzwjglnplwwwrgrthtijthyyrlhjlgnhhitipjprgnwhmjpyrlrmnlimgmjhhgtyyjgngtjnirpjyzztlzigpnhzlynppmgywggnpgpwlmryinhiwnytnnwzwgnyyhyrthinjgthjzjghmmlpzymzjzprgmimizntrpzjhwyirgnphnmninjmtpgmghrwtigmnmglnyizjlmnwtrtjlgthgtiygthwyiyjywlwtrtpmmmtgpitgnplnhyyrlnmgnynpnznmhjyggmrwjmtipjjzgpwwtiggipiilrwjizpppymrhgjwngrnipthhmrryhjylgrnjizzzirgyzzpmnmlyliizwjiygjmihhzptgnlzgplyghhjtzrtgtjjphilpywlpihtznmyptwppgphpptzhmhlwytrrtmrtpryzgpiwylnntptptgilimwjwrhzhnltgjwwnyyrnrwznghmnlwgtnpinnngppjrilhpwtmmrmriytlmzllnzrrijzhmlwigpyrgzwrtzlwwhhjiljhphjgphrmimzylrwlwwrinwhgrtggjitptzmhzjhlnjniypwwzjrwgytnrwhggligtnipylpgjnymmnmltlwiztpntpzjnliyznitmlhpwmpmhnylpimzjilizgijpimimzhmzznwhmpzngijgmglwzmizrrimrtzlymzimpwjyitwrtzgyigggtmtryggzptihgmwggnynztwwgprmhtwtngiigiinymnytgtmpznwgrzrjtwyjnlggywrwjpmyyhgizpmltlgywprjgzjwrlmtlhwnntjntrzmnjngyigtrmhrlmhjiywrggylryjwpznntrwijwyrythiyzyhlnlzmpnripyypwirmghijhnwjympimgjmtlmpmlrhmhtnggggiziwgptghjninnhwgnhtyhzlwimmznmrjmggghzwwlmpwggnrilthyhmiirjgzimjrmlwhhwynztrlnyrwtnirzymhgjpgrljpypiiyryzwmhymihpprpiijtirrzywliglzryzrwllyyljhywwmmhiijiggpjjirgytwmmgzjwntzplghmmhyhhygmlypghghrygprhirjtlgtrzjjglmgiywyjmpiryhtmghiltwijpmzrwlmjypyhjtpnjiyrtnlilrgtingjjyhmwlhlnpnlppjhwtjhiprpjhrihjhyrpjgggtljhgrtizwnlzmyintwgjtyzywlnmzwwitlipntwlpjjynitmtlznjnzztjwymnznlmjmzmyniwwtngmjijywrymipljtmwinzpghyhpphwiiyipjztmntyllzgpyrmtynritnjtipwlgyntmjwwzzimwtywlppwjptyzpyhyprrnmrynnzlzyyhzpjyjlmpyzwpimntgjtmmititpwjywzrytnptiyprynwpptjjlritzhmygzgpnmjwjrilnlpmwlyiwgymiytjlgwrzpywtwpjlnggnhrjlphthplmilgwptjwrzyynrzlilrpztjnpwhywliyhpjygzjpylmymnjlmhwyhgywywlmpjmymgrprwghzzprtwzwhjlyyjmzgmylpmttggitillmppwiwztzjtytnjlhthintzgyizwtgihnlwwnppnhtzmlihiyipjpghgpzllwjpywprgthnitwrppiyntzgyllrjwzgzgnhywwtmljrjwzwjylzwtnnllzizpjtizlmhznwrltrytrghglglnyyjwjijitiiyhiwmhgpplighppphtjmtjmyjpwjlnwljiyygnnirwlnnmjnjjlthngwmjrmhntniyyptrmnwigrigttnlhryzlyghpmjjzgimwgzitywzwwhwmtlhgllyjgzwmymhhnjhpmnjnrwtltllplrhyzrptilmymgjhiwztrhliphwrlziryrtimpwynltryhynzwnhtglihynnhtjjiyttiznyzhmmiwwjihgighwljmtpmiptinnipgnpyymwnnjzhlyyniziihinnzgtpmnymzrnrpnirmigmgnmilhnntymzgtigpnmpmprntglhwnyzhlmilimpnmgngywpmrtrrprgnnrimzrgrjnnjjrttjzhijhnzzmyltpgzlnwyrpyjwljthmliljiyjpihimppjgrmhymhinlriigtltrrjhryjwmrrttptnlzippyrmmtinrtrrmmwiylythihhrwrjrphgrznjprwyjhzhthjthrgyjpipjlzttwhyhhgzggrgpzrijjwihnzlywznwplhtngwlwrilwrhyzrmiznlyymhtlygrtrlrmzlyjznhghywtjrgrljrtyrwplplhprmwhpghhimyliiitwplmyyymnyzzpgyztgmgmwwztztjhzygrrmwrzztwtttinzyjjyljmgglwwjpyhizgmhmzpwwzhprmtnizylmlgrtrnmgiylrhilmnwgmpjhjizmwmprgyinlhrigmmmmjzpzthipghylpmilynmnyywjthytzjlpgrpnligmzyzyjipjzpzwzmmyzlrythnwnjwrwrwpyptrwjhiwirrzyrpwihhlpmnpghirinmpwygygrpiylztmhnmjrgityilylijwirmmwhmtijztrwjpzjplmnpwjmjjwzznwlzjihnhtmyjtihiygpjtrzwzlhttygmnglirgypzwlpzwgwjrtzlzznyntyhglwgtpiwhmlprijmpzpwlhtlpmlirjljlwrlzwgtwyynjwzjylzlnjhpnwlilngtmmjprjlyytwtwjylphghmlinyytigphzhihppgitwrtnlhmwryygmmhhhppwtlnzgnptztzigigpltltgyzgiitylyplnjhiwghlgizmtlwhmtzmrgywmilrprzwjjwnthjjtwpiwilwlrnirpjgiyptnngjjpprmjtmtptrmpphgjggnyltyipwntpjhwnwrprtwpzlyynghjwhiglwjlmznghrhygghhmrthmylyjrznzlwwhmythygngiiwlpyngryiwtywmwjppmwpyjyrmpirgzngyzpltgprpzjgjggznjyppjyimtmgnwnwgrimwprirztyrwggzpnzrtlppprjhrhmppppymzipmghjgnlrnpghghmnmwirnmitizpmwwpmnwhpzyrwmpiwyglrwtijnmtlwjwnhgygtrzgwhggjmhzryjjhztnmjhjhthppryjwiynjmjrwlhzwpllwnjzwmiwrppmyhrmpptzwwlzylhpijipwhyyipthityihgpwnhilwjtjrhhrgzznwtimlmtggzztnmihpjiirynjyznywpwwtwwrnyptnlwytmpjzmjhliywhwthghzjwmnrgyhtimgjmnymngphrgzlzinlnnypgphmrlwihwtptntttwlmmgzmwtprgtlyzjmhznrrhhinrjgpippizywpztmyjnjtiptllingmplgtwijnwhrrzwgptmhihmthgnmlgtzpwtrjlprrlpgpymytwtlrlrlhrwinjmtpmliyprmwmghttziwzptipntthzimrgpiywnjrlntlmhhmrlwijytnrpjgpngzrnwnijghnjzmtrwijlngymgmthtrwlhrmzwtmptttrtyntihypgpyymwwpnmyrwmwgylyihwnwhtnmlmlzlghnglrlgpnrtjywymmgnzywypltynggjignrmgwlllnptzzgwrnnrrjlwwgyljzhjpliwmpnnlwtpmrwlyzhmtjwmglriggmlmlhyllyrmhzzjrpppijnjwrjrpnlhijtzwryhmlttrpjnmzhjpmlymjzlnmzipngjlpwnnminjyjmrprnjnyzymltmrhjlhzrtyhtitrytwlrhmjmtztgpzjwrhmynmnhyljtpinmpgzjhpmzthjnzlrtgtllryrhlytllnpntijirrilmlwpjwmzltjjittgiwlhyntizljgginmwpigtzignjymntltgzytnippgwrtmpiwhwzlhpzwgjlttzjrlwgjizwhghwphmjlnwrijpnyjhwhwppgpmzrinpmijmwygwrmrtzlppgzwzlhrigwgwzhgngthjtjnilptghzyywwjilipyygpztnjyrppyznitgrhjhmrnhrghgzmgpztjyitmhjyyhhllhmynmrhtzzlyjwnlplmtiptyhlywyjtlwjmmgylmgzgngpntlhgrttrpigmhwihnrpwnjngztmrgywwpztgywpnpimllylitgyrtmyymymrlwrwypwzytrlririwgmrgymlhlllntizziwlpnhwhwwrrhjrgzpnnjyyrmijhjggyhwnrgngmjjwlmhthtrtnhiztzrymjglyilyjlnrtypwmnhjthymymltnijriythrmnpplzyritztmlgntjmtrjgjthzprpmjpgjwjglhnlyiipphzllrggzthtirilprzgthhgtipyhiryjmltmjrmpigyiwnmygmtzpnpzmnrgmnzpthwjizmntmgwmlwmtmllzzlghlgzhzhpmphrmpltyjighimtjlzrpgwilrlmrgjnrzywtwnggljgnjtlltgwpzymwirjwlrwtrizgzhirzhzrnznyhiwijmjnhhgytimnlzlywzlylmjglgrmlrjihlitjmmwyzmitjhhhnylwrnzliwwihhyyihntrpmrmwnzhhnlzthwjpygllmzgijritmrnhrihwwimjimrylwzzgzzwpyypnypwrjizingpzihymjygyzhltgmggnrlrjptmptpmziihgjtzwzlljyrgmhrllrrnihgzhmmmlhmljzzwwnlpjrtwhhrntigmwmwinintitwtwnjijyhrppwzipzgznyzgnlwpwjtgpypmjrtwzgrrhwnrzynhpzjnrihjhwliiphjwgmznjthnnpwynlrltyphwrtlpnpmnhjmltmjpmhhzthrjrmlzinzihgnymtnrjhzwrzprihzhhphgpwtptirlrmynhnmrwtyjiypnwipizmlwphptwzlzjnlyiwnthwljynzpptwrzhrwlinwzmnimnrmnygighypigitithjprhtjplzmhlmihihpnhrmwhnywhmipmtprwjnymrmpinlppjyrjgzrwpyhtjpimmwmlmthihmgzhpzlphigjzhzhiylwwnnhjjhhmjnnhgghmryntphwyjmlnlnrmrrmggyirirprrgnrzzgwwgrtmgllttjrmwymgmjpzrnmizhrzwlglnylhhgjrytlttgmtwzwmtwglhtyinpgmwjylimzwrrzllmwiwjpzryjilhiywgpztznlnptgthhytytghjgjrjirgziptzhnjzigwtmhltyngyghwmhygplwyyiilmzygzmzlznyizwyzjtihhpjzrmpytliyilwgymmwmwnrlgtwzjtrymmizgzpmgllztmlpiljjyzyhljiwirzwnwwgtilpmtpinzywgtjmynrjtyilzrjhlignzpgtmzlzlnhwnwrhpizywttthgwiytrpnrnltwijpyijjplmnziymlinwzmzrzrhhlwpnijipgjgmghwwmmlghpmiwtlzwirrzttpmihimwijpyjwjntmzwigzlmnnyltlwzyimzjtmjnyizjzpnymyrgijmywlwynzyzynltlpnypyhnjrmnpltpwmlihypzmwytzimhpnplihrhpytgtzhmpnhynpjyzgnhmrltppgmjjzygyzmtzrtpmhymttnitrrzmyjtttliizpjjzpjgpgwiryyhjlryigljyyhmlwmmgtiphprwrgiiwhjimilgmhwnlmnnhthztlyngjizmzhttggttlgzwzmimnznwimwmlnmgiyttzipzmrpmmgzynjlthnpwhyrljyhypmgrimtityipjhtztlzwytnlyhynzmlgrpljznjjpzrilrprhglirwimwhmnngtljmrzyizmiijnzjlzilirrzritzjnlwgnztprhliwgmrgprlnmpppljyimgtgrjigjgjtpiwpnwwmnzwjynnrtnizghihpnhznyhzztllnyjiipyytrlnyrtmjtnwznrjijtrjnzlrmrylnhinwjpyrppirnrjltllwrwjlipnywgtthjitlpzngmnplwnlhjzhjwythmtjphhiiplmjlzptnjwltyzhnirlihjnphnptnztypwtmgypmhjiznmllmlnzpzztjhgglpiwwziwzlmrwynwpgmwjhngtgwgiwrihpmzltzngjzwjnjpiyllmgnwwnilmwplyhmptllignpmilmwihlwznyrtiimzpzlzhjipywnphlrzrrrhgptzwrmnyptpgtzzlwmmmgjpmznyhmmtinthhwmpgpypzhmgytzgzptnhjpymnrlngjzrnjtitygjngjlmlygzrjrwrriwimrpyihyhgjryijrmynilnniyrtrgmzhynrjzprgziyhmwjitihtjgttmlrtirintnjnlwjnrrjrmwrhzttwtyypghiyhrinznyrinlmwhylnlwilzyrntrinjliyhrtrpzmwmggzytmjjnlnhtwwtiwyipggmnpgnmhhgrppgyyhpjgthypgzynpngljpryyhgllyrjtjlrmiiwnplmijlhwjpmimwjpzwprgzhjzhlnzrhipjgrpwjjpnhrljhnzwijjnzmngygppgpywwtlpnhwwptltrhyzlwwzgtrhhiwyhpwwtnyrmwwjgnjprgwzhzmiljztjijpzhniyjrrrwhpjlhjpmhyjyrzmnljwiiwmnpggrziltlhzmjzgnymlgnnymwwlpjlmrnhpzrrgnipyrpyintzmpzwggjgtzyjtwyzympgtiprlylzplrmtjwnnrmggjrprgnjppzhrlhmzttglyhllzhnhylmwgmigpyipwmylitgnnhwpmizgnyzzlgngipgijmwlljhwwljhrwpwgjrmjzyphizyitigpnrywhmrplzizthmwzzjygrmyjjpjnmmzwnnilimmijthirnprylrnjzymrnnpmmwjzjzmyipmrlytplmtpzznwzhlrhytjnnjplwpntpjnyyglmhhmjnwgyjgrwhrnpmnwnzltrhmihjmyytrhizyrzzhrnmtlgmpptmrpgztrypijrrgtgzzlirywmthygzhhlmhlpgrmlnwlpgzpgnmtttnytzhyzltyrlrgnjwgnyyrjgwlipllirrhzhjjpiwlhhrwwimztjywlylpgwgjrrlllyzjhjtiiwizrmtyrjpmtlyzrpzhyhihrihjwyppwnimwhjrlnnryyjyhmnpjnrnngptrgnzhrrzjppztynnlhmwjtipihmgmrwnzirthtrggwyijwgrpyziymmyigryrjgjhgnylwytjnmhllrtrrlltmripnmlimwhjgwzlmzhgjnwtpypiimwylrrgimrrwnirliplmtztzhrynjniggwtltzhmgwmripliwyghtrgpgmhliitznrtwzlmplwpgjgjpjpntggwtrzwywpyiyrrwhnrmljttghmzghwzwmrngzjyzzzhylwglzytwgprjzrzzthpjtmlirgztitlnrjlztjypwhptyiwgijrrtgjljjzrtwgtmyzjjnniggngnppgtjhggnihimjwtzmrzzjzjglmyprzrrztpgjgtzlgztrtnwwthmrpjyygnwnwggrhwnylppzjzyljjnpnppphpznzyymrnjptmzhttrnighrnilhnnrjhzrirrlhwnmhmjtglmhiplyphirryhjzzynjrypwrlhwpjllwmrrhppjhhwjlmmmmwpihlpttmgzrjpjmhthwtmwjmmhigwtyjwhwijzhltljjtrnnwzinnpnpwgliwgrytyyrgpywpllhhnmmgrznytrmnhnjtlzhhhlwzirntpiirtzhirwpplnhlgwiirwhyryghgmwzmwttmznynmpnylygptphytjmjlpmrgwtzrrtwjtrzljmymhpmgjljmwrtgiwzpzrpwnjjirnlhnttlgzyijzrgijtptpmpyyghlhgiwgltrzzmwiznhjitgnynlnlwwwngztgpwihyjtjrttlnhitgirzyijzpzwrmjzwjnrmzzgzmiyrnpnzghzwhzrrymntihpwnhtgphyrgliphrjggwgtpnnylrtrgzjnhgjjtmyywyrynzitnrnmgtpygwprhrzyzlrnghgjtwjtmrgjhrplmjltmtjpthirwtiyitlwzhnmpgtmnyywyhhjnmrhmrgjmhjjiwmmpmhipwwzjhzmwygrhtttliyntgytizpmjywhnnhiplpmmthymrnzmhpgnltmwijnirttmnjylwgmgrhzjimtnpppnpjhwiyighrzwhnwmglrtlzwyigwwzwwitrjzgihhziirmthgmwzitiwhntmgjyjyygprgjhrhhyiphzziptgrghwtmlmwggliniyghjhlwtmwgmmjjrzglpgwghylniphmpwygzgtrnptnjnwlwrzgzypjwnrizljizwppmjhllhzrpntywmwztnygrljnmhpjirhtjrtmglhjznygiwwnjnltnzihyplgztrwgnmrwtwnnjpgjygyygjngmmtwwgyzpwnrjrmpjmylwiyntwynprpziwztttrmzjrjzlyzllirlgnrjytnziyhrmiinpwgttitympghztypwigjtmmwhrginhrhrrpmmhzpltrljgjmgpllpiyptiygjzgwwitznmzwyyiliprhlnmrgpgyttjjytlyrmyryjlwrwyziyjzgzntihmzjgztnwygzjirjpgjgllmlmtzmmmiijpjjylpnnijmhtzthrlwyzpigjwijnjtjrwhpnzwtgtlwgmgnprrgpmrtyljwglhzhhlijmgrrtwllrrphpnirlprtnphwmhwinwpghinlggtzmlgymjzmjrjinnwjntprtmlhnrnhtnijyjlppgphinwtymilhjmhptnhtrnhwjyhmzjiizjhtrwmrtlmjnhpmpmynhnigwgwrwpgnjlzrjyhnthmnwrwmhnyhrtmhgppmlihnjphlptwiztmplltgglrylitjwwpyytnjighjjrgilnynjjwtllwhphymzwlhhgjilthhyiphrpzytzmzllnhtjnwznlwrhjzyjwlttytpmpirprlmiggmrgighhwylihwypyjpjlyrjyytizzrginjhyrjwhhtihrgplzzwtlnhjrrtwmzymhlnwllghmmpitlginiwpgwihwtzlzjjwwzymitlgmnnjpylgnylnppgwjrpjhillhrnypwtrzjlhyljgnwiyrlijljhnwnintyngpthniyphzgyilhtilrgllhjttipygttmmhrmhzwtrwznhywygtlngyzpmrhplrtmhgwmlhzhhprntrptrmtlptimpzpnwjinptyylrpwzpjhtprrwnpmrgygizhihywwirltthlpmhitlhgtyhimtytyzrihgyliggjrjgjnthyigwrgnnlgnnzzyhgjltmjgmnjmhrzhlgmhizgmpwimhgyhgzhirpzzjtzrpmzylyhwntrrrwhjghlzgyjjwpwmpmjytmnlggwmmhmgrwwnnhhlwpirtzphlprmmilwyzgywjrnmhlggiwglwhittytyltmhmwijjihnrwrjnprpgnjzymhjiihplzzlwnlimztphptlzhrhrzhlmpnwrllrtpnzizgtylhpmwwlmhgylnitprjhyzihglmgmnggrhwhrgrlggjzyntlrnnpmipwllwgjwhznymwtnwpjtzlyzrjpglnpnzlytgpyimnwpygymhnnippmiprzgrmwijlrmrlplglrynzrthtjmmmpzljmgrltglwjljtnnyptwhmtppmmznrlggtpnirrniggzztrirjwylmzllmjpgnylimwwjwjihlrhyjzgzhgmlrrginniijjtjyyliglzwgtlzlzhlipzzzjjynplgzijtmjrgghghytjyhmrlnwpnlnghigwywlmgmijnnylgiwwimlwihymiypwyrizgrjwljlgmrpmwilwyryhtrlyzgglmmtgpltglhljprmpjltzzhtnpzmmjzwrtnlrjzjinlwzirnjpwmljypygigwhhlmrhlpmthniygjmthjpnzigprgwwwzpwzthwttjyzjimrwljmmzrgpljitwjjhyjwlynjptijhhynnrizrwywmiplizizpgnnpmpmjipjyppyyttgjyghrimtzwzgyintjthmllylyjzhptmmrpzzyghwrhnnnrlrtjnmhgpwwhhmlrzypgwigiwpizjylgjpnnwrplntrptljgtrzrhnwjzzyghmgzimyyilwhhrnglzignhgihtwlilirzhympljlpwnwltpptgjyjwrjtwrjmjigltjrllllimzmhtlnghwpnrngjlmrzggimptjjrhnilnlgghwnythhpwztwgwgynlnnrzgjpywylpyjrgitlyjtgtnnhlmmirnwlmwnpiyptrhlptpjimihjyijypwzwlnpjzhwhrtjhjlpmzminiziywyiwztjyrrrptlmnyrjpizrgpzgznrljrtrztpyyjtwnjlyyjmgmwwwrmrtmhpwjimitrjyjlwngnynzlnjrihtilnnwtphjrmwrmrzmjligjgptiyywlzzgphiihrhlgmplhhjgnmtnrlgmpmrinygzlwmmzmmtzmgnjmyihwmlrhmgignrlppnghlnhrwmitpgmgwmizmywzgigtgzjmljiilzwyhytlzjymghmlizrjmynlhiyiwyztjrmprpwnmwlwrllmrpntrwhjithzzpmnziprmygmywhgphgthljprznhpgygznzhwrgwwnjhywpygmmtlyjhnwpnhhmrwgrwwmjhpwyztnwmwmlrtnhiytjyngtyhzyjhtwphztthzznhrtjngzipytnnzhhjnhmhirgwyjiigljtrgwtwnjzmpjhygzyirtimijrzwwlhwgwntmilhzimpzgizgnzijihmwrithmyjwmttntjimgjzigpymnnyyhwzzwnminplllzninwjggniwlrinplzrhhltrhgjhyzptritwywjzphrmjhlzrnrjmrtwnyzynrimywzmhprytrhlnhwihyringpwyzimtrpppjrgphigzpnzzprtljriztmtwizjhgzglywhhhmpwglyyhlzpwtlmgrzyymznhgtlljzngwlmiztljzmznywljmrjppygtzwjlgrnzmyywtlnprwmzpptgjzilgijzhmhhpgttgnmtinjtpwnijltyzltiihrnghlwrtjziwyyptwjytngmythnhwzgwwntlhzwhlljyynjgrgrlniyhpnzptjjnrnnpwttnrrnnzpzymzwllrwhynhmimtlmwitwlizzhpwiwgmpynpyhljwnrijwjnwwhjyllihztjtlmtwwjrygryjjngtptmlrhrnhrzhghgwmtwngizygrztphnhlgyrwtzrpgrliwljpljiggjghymznmlmttrjlihgmnjjhgllgmhgmwrwjrlnilggilnwzwnrrrjtingtjtnhwtjiyiyyngipmmnwrnhhtyymtgwtiwzgpwiyhwwmwrnyigignpirmwgnpgwtmmnggrpnlwztrygmljhghwpjyigjjgmznghgzpyzmzilmlnyrmpignzyiyjhljwzltpnilztninmyirynitglgthiiplrjppyjmwjhzygzihjnllirnyiwihgjrijnrgnpplpiwwmjhpirhppmitzmhwinplyiwnggphliwhgylpmtgjttywymnygtmtzjygmwmtpwphwzzznppzrllnwjwigpyyhigwnhtymjrjpnyrlnlimjtrnwzjiijpjwjtynmzjtwpyhimwhnzpmprljnhjgtrgwhirlgitwpmhynmmtltrljwhlpjnhnnlgmmpyngipyjlprrmnjnnlyhpjmphyrtnwgwgnglhlzljzpyzhltyhzwhgpthlrzzyigpznlgyhhirptgjghgyrzmrhzhwglhyjwttmzlpnzlmpnnltmygjjppnzgljrjyytrmimrlthylnrzjyzwryjiitlwwgygnliwiinymznrrrmgmggliwiwrwhmlwlwhrrrijrmyzpryhwpiywhhpyigjlipmwzrrpnjwtntmlnrtigytiryywtgwgnnghmhpgyjyrizipwphyjgrwzinnlzpylwpjwlypwgghzligzpiliglzpiyhlpgrmwhwhyzjgwmtjhjhwyhitgnyghwwizzitliiwggygzgmzjhlirpyzhnyyrnjryzinhrhrwwiggnrmwhtmnzwjijlittyzizmriphnymtiwpzywjlpllzpyzwiirwizppjtnrgjpgjhzjnyrmwygmnyirgmthzphrrriwziynmrwgzynmhjrwygwjzzljrhjzzhnyhighhggimzzwhtymthlrhnghwlrjmgiilnznljltlmhrpriwhzptynttmgziygmzntggnprmjzgwjmjgmhipwjgripzhhzynmwgpilmjphrnywypgirtjhrpmljtwpwyrwymnthjrrzmzthgyltnigiphgpppjgyrhylpigtgghpwmtmgpgnnwlprwjilpjnjtjrgmnhlgnhgmghggzyptgpjpgtttrglnywtlhgrgjygyjlnwihwwhlppwrjpmynhnzljjphiijgiwyyjgimnmhlmnhjntwryllnmllygnzrhyhghlwliinnwphpgjzlrimtmgzpwhlngllwrpjrmijlzrjnjjtzhrthyiyhmltgljzzptygghitgrmyiwwyrmtmniinnlrmpgtlnplymmnlwnjwtyiyppmiipllptgwttnpwlzzhwrigjtptljrmzzywggphrwjlznhzjjityntrrnthhyinnymrilyrpzgrhgwjnigttzrlijmjwmnihjnpwtlzryjyhgiwzmtlptglnipgrgjgmwyyhhiwrrhrphmywypyrtnjwyhnmzwmmiittltpglnzhgwilmpmyhjyrhppmylytzpjjlltpwhzlzzillpmhmttnghipllypgrhipynwtgpwprhgtlnnjlzlhmjgpgngtniljhlmmjwplttnmrigzjlznlrinirgwyjwrnprhizzinlnrlrjnyryztzrjzwpglhhhtrrmimnwynzrgitmrlhjzyinhprjrtgjrimyzwwtzyzrlhztwtnlzthhlgrggjlpryitzzrwyzyyhynznwrhhzhgiighjwyphwljlmligzwygznynlimyngwpzlwiijjmgjtwypwgyirtihnwtyjiwlmnmlghrrlwtjhhgwgytiyyhmpwgthhimhgrzrwgrtniplpzigipmyhjipiyjnymjnizngzwtniiiljgjjyjwtyziiwnzwnyrwlnijmpmmprpjnltwpggpntpgygznwwhrgnlnjlwrrizpjihnwjznwymltnigwmhgmlzmhirhwhmgpnpmyjmtmrrggpphjprmzhigzljllmztizhizhmrigppnwyliilmhnhrghhmtltrwtpirhltjrwlmptyzlpywzzlitnirlrrgjjznnrwzynytzzrptmjtwzthlmzriwijlpmhltwlzngzmrzltiiyzzzljpriihhmizrymphhmrtymzlytptjngnirywigpnjphhilzzyzwhrhmzyipjjiryigmymmwyjwilnhrwjmhmywzrwhjmmzjwggwmnjnwgwirygitlwzntzwhygingymziwjmilmwwzrwtrlwnnmhjhpyrzritzthtniymhtjpgplprpmtinynnrnhnzgjztjlimrizrnlrpirlrljhplirtpgtpnitmrjryirmhmhlmrmgzgtjpgnhnwgizwrgimrlpplwwprggwggrmyjphtprgypmpwygtyltwiwmpnygjjlmytjmpjppizzhrtntirtzwnwriynmlptlwjttlltzrhwirytzttyjymitttilyyzhltntthrigirzptmgzzyynjzryhriyiyygpwwmgihnzztnygrtgywigtwglpjmzgpyjthylwijyyyjtjlzpmjzzwlmmpyhnnpngwrttzgtpnnlnhhiypyiylywztzgjwjmpllylygmggjrpyhmjihiwlpglntnwwphzmnnhhnynrpjppimzgjyzzmzhppzwygrwzipgpywzlwmhhjzitjlihymnttilzhryjnjnhtyynlpggwmyilzyrtintiwrnytjhptlhnhrgyhritiglnlmwhirpzggwrrillytjrnpgzzjzyprlzirnmtirtrwmpymnrgwltpigitnwhnywyyrlyzrplrihhrhjrtryjwilwiyjggglrgmynpwyymlmrnpphwnhiiilhryggzrzwzhjnrwjrlmlyyygjilnmmjwnigjmgyzzlgtmprirpyjmhnljwttgnzhlhwttrrnwmypwtgyhltygriijzgjgyjrjtmittrmhrwpmzriwmzjnzlinigjnwwzmigtzgnirhyhpjphizllntgltgrinwtnwywrnmnzyymtytrmzirimhrrgzyllrpgztlyzihhgrggmilnmhgwmlmjgrmltymnmimjmzzynjyyjimhrrgjniiglizlmlirlthjtinjwhtzhhgirwrwitrlhtyprgngyrpnmrtzgrnglrzipiypzplythnhmhijrtgrwyitpgiwzlmjinytwhrrigtjizmzwhmipmhzjrhwmjjpwmnjpwiglnjpytntylwtmywjwllrlrmnnthjyjzjrtmnzwtrmgmprzlthijlgiyihiryzilptyllptynzwttyypzwtnhjgpwrhzrtyyynyjwyzwhgymyhthzrgnhlhywglhjylmtwrpmlnnyhnnirgljzrlpizmzwhgzjmptizptizrmhhtnrwyljtjrnijyhnwyptltmpppjrgpngzlzgyzimrgltmpiznrzpghhtwpjrwjtjzmywlzwjjiyitgmjrjtnizlmtpwgyhlmryimyjzimmnyizwmnyphrippnhryyjwygzywmhnylrlnpzpwwlthyrzwznrjwliipnjypwininwjltrgwjghgiggrmlrtminyhjjgpggzhpjnyzpjmglnjziygihpphjgzrrrrnglptryhlwrgigiwpgypiwrmpmmrngwlgghghyrnyjrlpwtmiihpnjtwiytyzmjziynnrppwjjmjnhjjjtjjiyzpyizgmhtjgizltmzhwtjtjrrmwwgjmmzjptwmrwhmiwwjrjipjzwwwhiinpjlnpzrjtpyzllgirgipipyjpziwnppmgiptttrzplizhnilwgjpywytmrthynipzririgritmtwgitztiijwgttpgryhmtgzhgzplhznntpnnllijypwmthrwzhpnzytyjpgpwzmglztpprwgpzhzzgmntpmlnnjzglzypnywnggpnwwgrmghljjizwthtrmzlljgyrytytzryripwigilywwlmhiintppzzjlyymmmngjjntymhpzlwhzglppwmrprztgrgmgyztnhrphjwnwtgtnnntryptpnhirmpzgirhzzhtmmzhnnzmlhmwjrltnyhymnrgizpllygwljimpmrrplwgiwmzylgigwplmilzrmrjgjmprjlwgrzhjiwrygrjtnphwwjnrttwwipzhtgmijntzwiwhgtilhmptiwwrjmlyrwthhrrntnhnlghtjywmzznzyhiryyinlpmplzhrmpngrhmmjhghipryrhtwtmjgwmnmhzpihlrlrihpmtlijmtymirljgjrzmlprztttghiwhhrgrjzmrmjhwnntgpjtnlhhyrmwhjgmnhimhmitnrrmrjllhtpzzlhprprzmiywnpjwjhgitwiphglznwplrlywrmtzmprgithzpthzhpgmhtpigrzwimmpglyphwghnirgwmythywzjyygtziyignmhinpthzrrtmgmnliyypmmltymlwmtzynrtggpmnmzijintwiltmnnhtwmhyrlrlijhljwpwwtnpjwnppyywrlrjyntppypznylwtznhglwzgpmnyirnljpglzhzgygzjnpjhininimgjwwrtinmwmijirtmnphhizgymhmtimztirltyrywjhwmhgzylrtmwgrljrrijiwztimzmjlpygtizhrgiypyjrhynwnmgzphwhmpgpyjhhhigrytnnwjyglyhmzgziipnjtilrigjryipgzrynlntjjjgthmimmnpjnjzyjlylpympjigtjyrgnyyjrwrpjgtwjypljyypjmtinwyijwgzpgmhjiwmlgmpgjztwnmmrwmiliizgggthlghilirplgrppmptpjypriyipjiwttryljzghzzmgtpwthynzipzzimnhzrizyjjljnwrlgnpigglwmrlihiprlgilrpzrgpyhjmlgmglnlnplmmptnrrnrlnlgijrwmtpnjzrytptihzlhnzjtwipyiwilwwprnmywrlnhtwlgtznmhympyjlytwlitnppyplgtgrpzmhlwnmnytlwgnmhzjlptiihlgmijrmrrmigjnwplynwmigwwlwjmmhnjhjlgjwnjihzrhtrlnptmymhtrjhnrgipljmgnjmwhgpmrlilwhjpttwyjhiwmjyzjypiylmzjntzythytthyijzpnmzrzhhyjphjnmgjrmzgryzwtpyrywntpzlpnmitnrnjpgzlmrntrlzttzrtnttzzrlgtlwnwyzgjywrgmhjhgyltlnhlpjlwphwwwgwlyiplijmtgpthhiipigjpyyylnnygtrylgzpnhnwhnihrlhprrwprpthigrnmmtthhjzymnjiwrphphigmjpmirzznjlpgmyplprhzyninrtylninzlnypythppjzhijzpjhygtltitnzwlrtziinhyigrwnzpgrrlrzhymilpyjrrilnwzwljgljhimzminngrhhmywiyhyynjwwnnpwnzhlmttygrijwtpyytmrhltpptnhiirmwglmzhlnyjlpjmwrmhnjnhmrlzrmgtnhrwlyjztygghnhywmirthjjgizjziwwrmrzzgpyzghnzrgwyirwiyzpylgpgrylnjymrriggywrhrhyythmytimhmrtrghjgiwlrpyrwggtltrnyltlywppipizjtpwljmimmtyimplnimtrwynlpwmmznjrjmzgnylhgrjthtlzyytttjgmiwptwjmzzrrgmhgtnmzzprhmpnltptpwznijlmiyplhiyzjtjygtmjhmzjythzwzrgrhwwtynmmlrgznjrjtlgmmjzlynmjziyyrwwyjmynhwggzrmhplwpywnilmwltltippznjrgjptijiiylgrtmihltjwrgpggiigmjiizpylygpniriijirllrlwyymptgjrmzthyjzmmnpjtlgntpilinpjniylzmirgmpjptjhjwnppgrnjyhriiyrjzntjpjinjlgtiizrihilhmtzprzwwlmrihtptyygrpttpjpjlhliipmnlglgztwnzyiltppwizwttwrrpthywhhpwjptmmhyhylzirzmlhrwtlwpmhrilyplrzhprmnpmjpznriwjpnjmijtzlmmrirmyrgtgljnntrrjwimjigijytwririliytmhhrghhtmmjplzhjwwlzylhitiigzyrwjjyiiphtlzhzzhtjjylrytgrmjnnmhmglzpnrlmhniphrrlymiggirimnmgzimmymwhmlmhiglrmlhjiznhgynzzmgrwiwjnrwjwgyrmwjlnlnrwitntryynyrzjltyynmpmiihthrrttyjngrmhglwwrtrtjjzwgpzlnjtigzyijijltmnhywlmnjyhzpzwrzjlhigjgplwlginljjytintijghjmizzjtpgprwytrmnhztiltiypjygtyljpwpmlwlirjrjptprhlzpypypmmziphrnpygppyrmwzjlmihpmpwrwgmghggmlltjtjitljhtzjhgjmhitlpypgmignltgwgmhrnyhwnptplppzljrjtrnnijhnghgryiimwiyltrntlpgtjzggwttjphhrznynpgphryypnzynygghrjmhjttttizlznmiztwhztmylrmhjzthhzlpmthywzrrgmgjnpzggzywzmlzzlniiglmhmwrymphilhwjzwhnyzzztptyzthgnwwjlmwzyrhnrrmygpnpljnyhtnttlmylwmzyinwtwnttizgrghlwlpnghgtpgijgtnjgwpwglpznjjwrniwirwmzgygwhrhggpmlrwizrnmwnngyjtllhmnizzhhjywthrztrywmylnhlhjgtmgttmhgjhhtpwlywzlnprrtmntipnigtltwpylijltwlymhniliygngnyggpnmpnnghrnmnhwhjwinntzyptwlgttpitnllwwlgmmtzgimityitlghgwzzlnlpjmjhmzphmnlnjtjjmnyptznimgwpnyirlrhwwzznrymrgjplzhnypmnlhwjiipypthrhwtnjgtzrmirimipllznplmnwllhhjpwizimiptmzrjyzpjrlrgznlinwhlitytjjligrizzhpgmtztplmnmtmizwwiwzjrmjnijyhtmjwjmrlwlrmjhhithgtphihrljjjhhwwgyjgmmjipznpnirppitgymjpjiiwhlnzwmjytjhmjtlyjrjmzwtrtwtmtglrimpnthwgrnjglrgrtjtlzrjpjwzirmtlplmprrrinjnpwywlnmljlnlllgmzijtpwmyzztgzijpprjitwryhgwnngritgwwrniwyjgtpggglpjnmrmlrrjpytwmirhzthzzhjhpihytlprwpmjymizgrhpmtprijzwlhmgtryyplzhijmplijihtpwhtntwrggggmtnmyhgmiizpghgwygntgwttpjrzwlzyhjptiyhjzzjjwimlhijrizwrmwgwijtgihgjinjjylnynriyiitjjhrhpmypwnzjpzgpytyhmrpglntmihmrtghhphthigyylgzpzjwpztwynrmjrnrwwryylwhimyhiltzwzljilwtltilyttjrytymgrjrmzgirtntwltilimihrzpizwjthinyymiriwymntizntihjhgzptmimwgizmlhymimytgzhywmhgzzhwgwptjynpiwihigghrptyilrjgplpltirzrzpnnijlzhmllyhlyhjtpgjwywpzpzwhijirygrywygpmpnyhlhzipgiwpnyghgrrtlgmyyzztwliimwihzzhpznhtmmrnyilzlmlmwmpprlimzwwtmnwmimynwzzgjwmlhwhltrltymijljiggmjzrhimjmtlziyjpgzlynzglnwigzrillrtrwhtppzhintgzmppnhymtmzwzppgjgnmprpnppjwiyywlzhignimhhnrwrmlzjypiwpwggghpwmlthmpitwlgmnymgtmnjzhigzipjpzzzmgjrghngryrhrwmgtttngtzizgtynpngyhmmtymjzzmppwnilirntmnzigzyptintrjjzljhtmymphrgzmnwnjtpmwiiitngiltlpmrrgiiimgtyzlzmjtrgrgjtplyznwgtywytzpzjhnmjwtgjjyhlwtnlhnpnjiprtighyrmzlttwlngyrriinznizgrmzyzptimpmjmjmwpnpppjypmztnzrgjwzrngllnytirgwnyrlgjmwllhjjwrlrltrngjmjgigmgmmpiprtnjywrrmrzrlzhnywpwtnilnhniywyilgplzmygrpjwjyjmrrwjwghrwnrththhgtyhwgpwhyhgmgwrywnzgpnrylpzwtizwmggimlnymgpllnriwthiwimpwzrlytimlljlngpgltihjllwnnyizmnpyghpzjimyhhyiwwtrttnwpgtywpygrlziiphgwwyjmjpypnlpmppgwinirljrzrnrihpzwyrmjrgpjirllmirwhihwmtwzjrnmywimthmjwrjhthplmnwijnytjtptmmymrtjghtzgwprmrtnnhllthrnpnnrmltgiywmrtryjllrlnymlzgyhjyhtnymgznzhnilgrtyywlyzglwhtmnlglihtlpppjimylglwjzirzjrirjmtrwgzgrrtymnghgplyzwiiptigwmiyijiyygmnyypzgiyjriwllijwhjmzgzrhtptwntiijnpzmtntiyjglznwrihzwmtppjlhginwzzrnpjrwmzhynthymplhiztwtjyymnplylzznrmyyipntwywgtyyziiptijirmmlhmyhjlwzpmwniznzgwmwgzygnirtyiwpwmwznyjpygrimpjnryplnlryhiintwnhgyirrhlzrnmpyrwznzrptthijgzhtzytgynyziiiprrhrtwmwingzgtnihyjzpwgnrnymiiltmpgnhmwnymngiglpzgnmpztimjmhggpziglzphtnwmnmmtymyntyhrpwmgnjnnghmggjtwzrgjnphrnlmzgjnzgzlmlgwwjzznwzmlryygthpzgpwttrtpnyylirhptymrwgihiyprhymgynmyljmjjtwwtgilwnlwjliwrgpgznjyglwhmmmjggjjzlpipijrjhpzhwnrwyirlmjtrrtihthnzwzinlnpnlthnzillhrmhgllrjtlylrwizprggnphmmppnnwniirtmrrtjlzljpyhgzznrwgpwnypgjhhnzzlppzrpzlyrtmzmihlypjhilgtijnhizprrtlwwnnphwlpngpljtwrmjpygngnprljtprgnyrlymywzllryjpljynjhrnlgrmmjjwjznllwimityrljzpjghmlhnnygiynlmgyzzlmrzyrlgntgpwmnnlrnplwzhwmzwztynznzigyplwthpzhhppmmttjhhlrhwjpgptjgljzhiwznmjznpimjzrnpzizghpznzyyptymiyhijmgpyhztiyiphnmrwzwphpjtljhpyimnylympnpirhrjywyptnjmwmrtyiiwnhpzzrtnjlnjtttnziwyhinhrthlzzmwpynrynhpnpjpwyiirjhjtinghyzrrpnlwnnjplmitrzwryrminpzjhttwizihpppmnrtrmymmjjnnjtiwpptijhlilpppi\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 433,
        "task_id": 4108,
        "test_case_id": 14,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "zuwwaztbrafrnqzfswuptbnsbnbuubrtuzkupwpsnxaxqsuuvsfpuunqwfrtzqbakcwwbfuuauzpwfbzvfvsbvzzpazvskfbunqccatsqracsfaxsxpavnfcvvrbqszwxpcurkcfvfbbturrfqctvnzbaqctukfnzqxpfzfqzxkkbuswuazqcvnubbxpkqbrwrvnfcwqxrrsvbkwzqwrwtfbzutncbspsquqrvacubwcwzrsczwuwzvbtkrrpcszbpuvfwwrntfxfknabnxcfvwwfvqxxufkqkvnfnfsvcuxzaufwuawwarksfqqvupkubzbsnfpaskazfuaqzftwuvqvtsfacczuxfafvuxczxpnxksxkqufxskvavcrarnssrcftwbbnszaapwcqwzwrzwtnanpppqkkxrrzrawspvbsbvktkpwszbktnusfxkvzpbfvvsqwkuptpqfuvacbrbwwvkbqzvbrzwcatxxbfxbbfvzvpxvbtucafbzctakbsvquazcfkkbauxrwbzuqnbncvbbnxxkskzbwatfnnxqqutzvwfantckkqktxurbabkaqtbbprtbkkbcututurxckctqabwupzwnrvfwpwtbsqkksrnsqzpvkzfsraxfvxtzarappcwqnfccqrfxuzsfkwabqssrbxsxzwsvnskbrsuwfskqpsqrcvaxxuatnavcpuvafbwbcqapzusprvatawfavpctsfcvkfuaattnkzavtzatcrntwztrcuapvqvusknxwktawauankukcxnpscknxrsaxvrzpxutsaxzwubaxttftvaakpbqczvqzfrrsbvckwkknxfxqbuqtkpqzvbxwzvvzuuqkwrrxuxwfuzszsaaanrvsfktaspwzkbtpfzuqtuwsbqbqfrxxanwcuuvsvvvxxufacbuauvbqauqwxfcffwvtknftrwrvtrcauzsrwzuusstftbuzaarczczcwsctqrnrvrfaaptquftrrfsfpzcstfbbuasqnuxqqvupnaxtprqwprwxpsrzqqrrffvfkcvxuvbvtxqktrbapanaxxvnpxkpkbxxnuaurpfbbxpnrksfrvfsaxwsnrnuxtvrqsrazvfnsctxzuxnttpsutvwpnuqcxrctspvxxasfsfxzwbqxvzbabqarpquxxbuxvsarttvxkbnrtaqfbwaxfafutrpksqfkfbttcbxtbnkufwqstzpkapkabzrkztuuwzvnnpzqcxsqpqpbprknssnpvtbvaucfucntfranpvpvnxnsknsxvtpwtucxwsqvutprwqznxzutafcfqrnburnnubssnkwqzqxzbkxprrpcnnzzvarwpfkzzvswrvbfptvabxwrppsfpkuunwfcuuctpwztqcnaacftvntuqsfwcaqsbzkavbzpbcvbanrxxzawfsqavbkassbraqwrrkufzwbbnntxzbnsntfpfzvwvaurckxsakqbbxwtnfvzfsazcsxwxcvctkktrpnfcbcbnfbwbwvbtnkwtnspvtfbfpwvbxkpavvcwxurqnvknqxnwxfzxqbtqkkawttfsknnrxwwstvsfzaqvnvtctqupaupwvqsxsxrpfpvpwtzkusbprkptcfpbsbvzkvrwupwrxqfzvrprwsnusvkpzqtqzpknararuwfvwxkfsnxzkacvrcfkbfrsfuwxcucxrktkcwxbkbrtbzrqfscpsnxnkzqusnwacsfawfbvuwfrcnrxvxktpzxwccfunpbvsxwxvawbaqztscbbccpfraqawkzxpzxkxcrabnfccbvxnpfxnptxzrtxnpwkwznqapknubcxbuuppcxqpszwvqnruqwwspnnzrcwtktnwfubwncufvnxxxtwxqwttnxzutaszxvqquvzszatxwvknvrwzpztbubknvbqsaqnxcxbtaqnqxnvbbzrvncwvrvkvvcsrsuxcrcpasqtvxzrfxaxqfpfwvbzavkzvsrcfxqxvsbuzwtptbtazavwfqzpburqnaxbccwswakqzvqspvwwkvctztqraswfkzxvxpkrfxazvtkxqzspqrttakqnvpkcrkqcqswtxkncpqfqxrzsqfkxppbwnfukbcsfwvqzzbkaxffctsxrkwxkbxkbuzktapnzbxcqknusfzncubpcxptxbxbaztxckbsqczxfzavwnsrkcaqqnzqvqnptzksxwkqtazvbafqwnfutwpcrtqnvcfnzxxpxuxxrvxufnwtrcwbcxkpfvxnacswasqkaxazckwusaxqxvnqzksfuvknqrnzvczfpqrsptuvbaqwafwzxanswrtqbcstfqqfznrvpwrzwppvvqkrbasstczuxcnwntwnurzrbxnfvawnkstcppfbfsfzzqqufufqubxwrubrzauqrrawabnkqwpnfcbburruwzfvspvxknbcpkntvczzpzsvtccbafwbfcakpzppwzwpaxsrvqzfbxuknpttzubqwtknxkzzszbfnkvqzcqbqtvxcbtvsbfzsrzacqrsrkvtnrzrncprrfvrfabqzfprstcfbqakuxztatasxrvsktvkqnzvafqfvcvatkqbbwrkqrbvucscvwuczzktwarxcawqaxxztcspskcaucxnxxsatxabkuruvcnpapkxpvbcpwbpxqtbvwpaqckbqcqsrtnzvusxpubqzfavkcwqprfbsvzunqnrrqvbfwwarzqnfqxkxbrntbzfwubxzsfsvstvnvafzsnwcqvxupswtqtqnzutfsaucbzacsfqrqtwvnrruacxntkuasvzfnvxvwvxufnvkuqqbakkxafruuxbxqkxxzqcszznztpfknuucszbnktvwsqszufpnpcrsqtnxzquqfnqxzszzxsstkzbkntqpuvxwfwzrapkxqrwncfxvwzzcvpuvfqbfvnpfnpbxznxqabvrcvzvcvxncwpqqvnuuxawvqwzuktkzcknzkbauaqkkfcpascxqnturzfunbqkcspxtukqtvswkraqxvrwavputzbcuxnqusbfcbsbxzkccvxvbqrqqcfzbnsnztkxszncqqxxrsrfvaxktsavurbpwftfannrvwcwtvnzpupxkcaarccvvwbaxrkvzaqnncsftbwftfwnsnczufwrtacxkkqbustnfxrkqkqtkfwquppbkuczpkkzarkafcxspbbabqbkcupkuqupbtzbzpqfbftutukaxvkrrswcpsswrpbxkapxnrvtqnsbwcutvxzuwtufxzkbcpstvwpqrsckfxcfxsfqzqkszusqwvtaskbstcausssckzkzvzvqqqcfxusxaartxcuuwxctqrbftqzqqkqukzsruttssuzazxqanbxkcquqnpftzsfcqxtrkrvqpxaaxtfscvfttnnznvasnvawxkkfupzrtrtvupbnkxcuacbtutqfrzxtubqsackvcsxkkaakvqtqfzzrpzqqrbxuxpfubxtkactputaqsqtxftwspuarnfzzncrratbzfbakzfcvuxnbanwwvxffakbpcnqavkswurzwavknfwrxuzxnqsxtrkkbkzzknxfxrqrbzfrczfnrfsaaqtfvwfszvbacvqxfuvsbutxbbbuvrbkxvfbsabzartuvzztufskvkakkrntvtssapksbzzpkttzcaqrpawrctpvtnbcptaznputnvvxvbbvcxxpkcrnfxtnfqkkvqqpwutkkprrqwacxtkppttvzxxzzwxzxbwzrpaqxxkfnzpcnfsquqkvqvbtztaftrcspnxffczzppftqsxtfsnntrkqcuracwpkrtcskksvucrvkvcxxawqsannrcrqnxsawkxrakcucffrwvnfwwwfcppkcxaqkxvwnfbaqatuwtpvbtqszzfrqspnxzxawtxvbrucstcvvpatanrakpbpqspqxnkcckzvabwvqbsxwqcbuwssvcqwcqktbbbxctzxcapaanzccwtbbfsfrkfxsccxrcnfxzzaqnpxkpnqtstucpsxquqrutzfbrbbkaxkzxwkkntwpsbxxpqtsqcurzvtxkkrpxvsuwvkxbxkkzatnfnrxrkqacqczkxsfttztbcwktbwpunzrwcqqzwwfbcuctzfvfpqvtzznafquucwpnxqfuxvcxvpspqpztcacsftckncfbpnzttscvpkvspcfpqfxwwtuvzzsnpxzvcpkvnukcnnbaxzavxrrxrnqncwvfpvxwkbfvzztxvacnpwaqvqwvbcpkvkuxpuacxkxrrkfzsfxqwvkqczxrtarqwnkqkunwzbncbuznxanpkwuvzbtafzxapxswcvxwrqptrfxauqqfsznqfubptzqxnbraazscqpfxzvbbxpnwxcfqxzfsbafbvxkbvfswxzuappqqszwkcqfvbvbtqfftuftxrruwwaxzubacubbrpwqqtftqvqpracvsfxaccuvuaxvckwbtrkxpucxcawvuwtsbwpsvzapkkvvrkburtvsukuwtkfnfbubqqznvcwuuquzfvzbkunqnfxraqubawnkszsnbxkuztunfupcxuaqntsxcskbfzsfsqkquakqavwxrbqxkuvvtrxzctxkuspwqzbwttwxzwaufzaprtsfkwuuzuttrtvcbnzpzuazuwkufffssrrxftffsuqkucvcsuxcrfvwkwtxrzzqqnrvqwfpbtnbfcnxxaxcqcbntuakffkafcswbswkpskbasqnakanvszswtrxcwfnvxubauawrpnkcqcqzrcunqprxqbuqzukcsxskkvcqfpusvpnvtqkkvqcvfvubrvznffkxnbbkztkpskwpvvbrrbrqzrxbrpppwscvwawxuxbrwubwxfbcvnratknnztqfpakavrfnnfczruabxtkaqbkpnfzzxqkzxsrsfsksztnvtnufxktksqvrxcvxkwvqnfarbfbuscvxkqacwxfwcpxsqfvfbvzvvxuvpqstbvpnnfbxutaufxvpznavpnxzcttkckwpspfbwrwrrpazuanbprqubqrzqqvfntuzackfvqnxnnkrtusswvbzkcwvupbpasnppzqsfzqcbktpazrxfcxszpwqzpszccttuwxnaanfvnksxvfbrszqakszcqkwvkuuawsqntzcqpbcfcsavbfustzkktfavzpskxpwcwfwbtbazctwzutksubpnxnrkfwnqaqsntfptxnfcuqrcnkfakzppftpfbzxsfutaaxvckvuwwxzkbcpxpqcpscssrwkurcaczkastpszsbkpxfzkcuwnaxbqrnqvwwvvrnbaffurxappwqwbqtkfswzucsrvktvvscxpvkfrvsnpvxbnpkrbfzbqkrpvwuckkttuqrbafxbnwssbwttxxnsuacbtpaxfswcaczfzkxufaqqfxustuwqnnrsrbqxspurkasunwscbfrtwrqpnsssqksznwckqwnuqxqrfaapxrvfzvxzarsbaunccuazvwtusxquqwbrtxkaqraptruxavvcwsbzrptrtxucfcxqnnzfqxxtfsbarpzzrspnurnfubfzpbpfawwuxwquuvtqqtwtftwapkvuukwbbstvsqxsvnvtfapkwppbvvrarsxatsurctscccfvbquptnnptvtqnaqnbqucsxvnunfpuxufxcpzavrwxvtswnrzbzkcppbqusrqcvpbcpvnnkxttknskuwzszqzfxrxfprnstnfwfwrtwquwpuntcnkrspsarftbvkbztpuattsxqkcqavzauaxxwabucbvquuskuuqstcqbcfxsnsqnkzxuspnpzcfkkwzsxfttfnffzpaccbuszafazpqavqzspufwbzbfnfunwvqcskwvvnwuxcpsuzakbffapwxcbvbpvpfsscvzsxvxpsfcttqqpqbcwzzspbkpwfkrcvsbrsasqvvsvrcckqvkkkqqkbknzctwkaccrrttcsfaxtffubknwwfvuwckcpptabsfstsfpcqqbxtvuqtnqrnrvfwbpvqznvwcvzwffqsvpqnunrvkcqvvnnnzupwtffzbarqutprbvcpfqkvcxsrqsctucfswtkwznfpstbknkavbfvtavzssntvqtfsqubswuctzfqwrvcrqsxkwuqaftxvbfpzrntctfnfvnrfupqrkqvvtufvfsvsvxwtbrwsnvtcaakqvbaxrznbnvcwubqkntquakvvbpfnvnvrwxusfatfaznfufvuxqkbqtpwubzxzfzpxutspttctftzbwvannnupsvunxxwstwbwtvzaxnzfrfazbrcwkrvubvqxubatuptvtbtbuusvzzpkxzbfnzbrcrzptqsfkuatvttsbvakpzbanbxrqsvvwznwuaqfqufqxpzsasnuzbcfkzrwtqvqbcrkvvttfpfkcntarbqbsqrxwrzbzrbtxzrtzufrsvbzqqtxtkpqnafazvfnkvuknrpzfxaxrxvtxwzfnfcucwfstukqufunkvbfrkfuaukknpsatvuzavstzpfskwawwvsqzwvzbftxxcskqbcfzzkbwuztwutvzpxtqtstuqvqrbwzxcpnznkakvsurvtfuvbvatvwznvzkfqbxwqqbzsqksztkaxbzwbxtwkpvzspasquqkprkukkxafsbqrqwsxxpfbqckkvxcuvtpbrruksbfkqacrfkbrxfvkacnucwznknftrwxsnwbcnzavqnkawbsuztaaqxxkfuvbqknfrctxbabpcxcnvasrpvqfuzbstszknvxfcbzqwfpnkbuqtavukrsczcqcraxncnurkszwrpwsxxappcfctvqzcpabwbrfzaucwttafurcxfaffnwzptzskvwnsuxxtuzbwkaavbqbpcuwxttbtbfancwxwxzqprnpnrcxnrrnptbksztrnbfkntawruuvapzafnxswbwxvufrfpwnqtwpnfpbtbczspvzsupcntnwtnatvxkqbwfnkxatkakacqwfqttqunaazsrskqxxcskbcswrkrcwtsawufrtbcxsupunvcuttxatapwvvturcvqvqkctpzaqzvtxfxvuswqbwkanukzarabatzqquxnutuknsuacaktnskqfcrznxpzskkqcxxwkvksszsqxxnrpkkapzpsqfwzrnbftbzscnpstfsbzfabkxpwzkvzqqnfvxrtzfcqnnbnrqsxpzfnarsxvavbkuxtnxrvbnnswwnuktvzcfansbxbzknwxxsnkncsbntxuvfxvwzffxpazsfrrxqnpancqkkbwnbqxctufxftsanpfbtcnafrubcfasanqkrcpatfpzsnkswqfqcarsrpwcbqxpnkzfbbknfqqaafntzkbwvaatpzvbazcukzfaukpbppkzskubtvvfpkxbwkrabstpuknwpsxkcbaxcrqaxznqcuaawkczfqrsvnksfcuzqprvwzqqvxuuznrpqzsvqrufpbakaxxapqwsstwkfqwxxfnktpwsvwkksrtzzwpswfanprrsfvxawkqsprznbkbvpubsazftxuabnsrnvvucxrzkvnwaszkvvsncbnnbrwxvnxxsxrpcazvruwsubwvfucptkxvavurppprftxxcktxcfafnuztbfpncrtsprkazrbrnzafcrqnkkzsxpfvqnnaswtufxsnrvzxxwwnaxscwzswpcukfaaszkvcrwrraaarxnpnxnwkwcxxxzpbqkpakucxfpfqqqnrpnscuxkukzzvkxnkfbrfskuapqskxxwwnzrvqqzqfptrtxpunrkkwzrqbctxfprqucfffcwssnbaazurzrvcatrfcpqpraqqrzrrwxzzpxkpkcftabzwcqunukztvusuwnstqvfutabtrnzcrfwpknbuuucvarxnsknsatuwputtutwxqzqvnktqctaucnpnvvvpstpfsaxrwazaxfvznnqsbktrkkcspwxzbukzfxwfzrkqvbvzkpqzqpzbpkafrrvprxpaknquaawkbsqwfstukczrpnccbvntxbuqwnwaatrnxswqbxavrqtvprrpbssvfpfcwxxfzpqvbfzzxftcfnbwnvaarartrvxfkbtfxctrvpvnttqwpvfvfbvzqzfpvkwscwcavaztzfkqpcqxawaraqufvrszzvzkrfnuszrbrrrqbuukbqrbwzwvsutpcpknnbffnzfvsqqkupbzttvqsqftxpptkbvussvraafxbzbxkbuatpuukbuxsuxtnxrpktatufnkabppwxsnbvnvxwqqvsbsnuppqkasnquapuqunwsazuttrsqnpazkktrvbrupzvfakzcwvvwbnfunbqssraswftxqckbaqfaqsvsvcwkpbkpxspzcatwfbvpqttfqztzcncvsrzxbnzxkbqraawwpxxcvttzvpfcfscscwcubbfaqqrkfqsrpucbqbcqwvwqsfucsbqvpfaxqwukunzzkqqfpzkuvcsbknwpxkvaawppnczpsuwazcxsunzssqnwkzrnzqfqaxptaqkvvrnwqvncpbffcufwtzwaxsvbnpztrtupkvqnvnxxnnbrsxfznqupttnzzpbkwwfccqbszxrwtarrwbfpnpcqftaazwwtaavcntnqzpkakfrfxcnztvcfttvkfubuabpnwkcbvwapkvbtwfrvnsvuxssvwazrwccutnrqqkxzrwkvrkvunxzwzqrpvvpzqcxnwwqqxswucnzsbfbzttuuwkqkbaqczbvbkwaffxxubnkcqcrnkwansbrpuuaakzvbbkctnfzwnufpuaazkrzsbwuttwftpwvnkcwvnpcfzstnvwsusspsqrxcxqzxntxuuqcsbspwxxuzttfvfcrkucfwqrnxcpbnrkacuuvscunknpzzcfctuvsupafsvbnctqqpfvcsuxrnwbvpqtnvskavtzuafvucbcqnqwtvtsnbfutabscskwsbfpvbqpcpxnazsvffxuurpntwazrbvkcsbfqxsztvzxfnruxvqntupwtwkvrkcuwknrupqrfppzzpktssnpcrkpvbxaafnasfxnqskzxkfqkcwqpsswfbzwarwvcvnpqkvrxrwptkkqfskkkvbwxpqfkcbzwbctpsafwcfvqruwtvrakfzfcnvstztsccwxpbrnpqqcnzquutsukwfbzaxxbasuzwkaqwpxrqrqksranfqpptupppxfskwfpksfsvtzffqtnqzvsrfzstscpqupcupfppvkwwcpqtcxqqtapqvrxxvnzfnswnkuzfukcfannvuauuvuvccbfknabuwusfrscvrkrufvvsbczfcwurnrtzccwxbvpkbzxacfaqusvcnfnwwpftpzcvnubvfwkrzvfzscsprxnpnfvuxqnpknvvwuzpfwkzcabsxzfrutrnfckvkzaxztpatfquzvntuusxavxwfwkzxbxazxkbrxcqwcqtstqrsxtzzrtparsnqzsrakcawczcnrbparusvrkuukrcftqpvvncpcrtanxzcnkvkkzwksqfnxqbtfzczrcbbqrxaqwaktaxpannccknurqkqfaszkbcbfczxsxkvppukvvanbtfabsstttvwzbpppktstaussnfapnxwrsvbtvcbswsqscxbbabatkpufwqsazztqbazbaxxztfzfksbcnfpsrkcnxnastkwvfaurnxavaqkuqqpufarqxnzxrzkbpvnswukxubqbzpqfvsbvtrrnnsaxvknsfqcwcbtkfqfwrbptcxbfuvncxbqnsnfacnnrzcxrvanasqfbtppcnuzxqvkkabxpcqvtpxzvpvvtkswqcbarrnptctntzrqufvsknpwzcvrvrnkuvzzpntunxuvqrtwankunxsrczztkpwsaqbkttuwzvarutqafszfwbqbfwnakvauffpxpsqvrtqtqnabqxxzwvbpkvxvvvztpbxxscxratcattkzskabfbptkvuwtnrpratcffacrubvkqfttvnrbzptkxukarwasasvnxxszxcwpxxcukwnqqbqcbxawfwqsbuuxcqwnbqfxzfquxspfqrcannbbrsuskazxzuzupzzxrktusrwqbstwuxqwpzvrqrsnnuwzvtanubtsptsckpatcucaxbupwkqknnsffspkqrqqkzukbzcntvftzxqfffutxucqvubsvuckcrbwpccafzsurpaatnnqavsspacpussafkwxnbztwpkfvtpvfufuvsvubrrtfcxvkfxpwusksakfrstqwkqqbawvwkfpkqbqqnnnxabvpwttxfucsaatzfuvuffrxpabuuavsbpkkwnrwrsunzxkpbqvtnscbbwtakbswwrukbnxnskkfbcnpuatttffxqqcpaqxtkqbnruupnwvcqtxaanruffvksxtxzfuapfqqcnzbvfkcarwfzspxxsukpfbqcfxakwvtantnxpukvvkzusccwfcvxkrbrsssvkaxauvcvpbqvkfnbqxqafaxbfwwbkuuasfkknprnkpuzcrffcswnrpszzcswnkpatpuunqrsztannnuatfnxffwsspqwtkutsrfptabrqxqxwsvrzwxtcpuxaspanvsanswfkzffvbxtunqucnrtqcbxkvqppuabxsrkfpxszfqtxqutcwfvbkctnxrzubawnsksrkftxkcwpbrkznacaxuafzuvpztnsrbacsbpvnwffcxssuxunxwczzavnfvrtpzubprxpntwntwsbbwqzqsarznzuzrprfzspsraxkrtwtpnppwqxpxrxwvnnfxzfaatzkczcfrttbrvrtztcwvvcukznwvkvvcxxqnrkarwvzfxrwcavukufswvszkfcqppfabwkwtfkkrukapsuannanqvkrnxpbubvbqvaswwbbnkxcupzvzuvbfzfranpubzusnqtnbtfnvrnfcnracukvaprzfpkkrbzrwxbzqttawqtktsquzqtpxacxafzvanrzxzpsxxpcpcukfztwkxwaxwbkpuqftwpwsvqfpnrvsqtfwrfpfbwsxwnbpxwtnrtcvkpuzzzvnrqbsncqvzubabzpxwaabqfxsrcftvuntkaxpnnzwrnrfrxbaqanzsbbzpvtnvwkrvquksxxrvwzrcckuvwsxxnvzacacaktaxuqfzvkvufnwzuzzvqwxpwxqnpnbqarbvvcksacspntkatawqzazbuqspqtacbwuntwpprqavnxwkxskxkcbaxrnbpxbzrtztpqsppfawcbpuqskaqfncqasrbbfafwutzawtspstvkbnnawxpktqnzqttfpkkrbknrfbbbubfpwfsxapfkazrnwranuuutburztuzfpkrrtkckvtwfruafxakpbppksvspcrcvuftrrrabbskbbtwqqkkprfqkusqvustvsvsrrzfnzfszuvaftfcpakwvpbcbpwqkabpqstvbqsuvpcrqpwwktsrutktpcktfbbanurtfrttrctnbufncnasbqcatzxcsuvqfxswwcppfapqfskuzbuxzxvfwwvzqxcuafwnznwzxzpzvbaxvxsskxbfzwvbutkvvsnfqczprzrvvcqxqwttaqbbaxasqabuqaapqqwtbbxxkvtucvzzftvubarntxsqcsxxxqpvskqpczrpwwptxpffbfcqnpwauczuvzutbrfcsvbxpabtaunrarazprvqkwkxbatprwckpcnfzfazsscuzxbuzcptwtvpxunzxfnvtbnnqrbtsattvnnwzpuukqqfczunfuurpsanxxptbbxqswwkqfutupnnwwvsrkktsupcknxzzuwcpqrbnsqnbpqwafstvxabfpqvtxsspxqsbcpcusxxpqvtsfarztawntkfzrrrfuwxvxqsrcakuskvtvkfbpfxxqvrffswqawapuvnwkxqzwzfczcvfksnxxztpzxqfzszztkprzprccxactubfkfbnxwsswqppqaurtzwuftnkracszakkkzcfqqnuvcubsfnzuwsnbtapznsqwanfpzsstuzvvbnckavpwztqrksprwnvkuccsfkpnvpwwfkursawbfazstxqcsqrncwzwsnutqtvzrrunwbcpuvzcubpwrxvzknwffvprwuufbbfuwaqvqwqnqbktttqcbtssaqsaztsrvaburvufnfnbxxcqavsxswnbarfavpqzukqkwnxvqxupbrzprcfkwwzufxktnzfpxwkpzvbpvzqnzavpkxffutsntswwrnzzfvrcuzcbnkvvrnqrfzuunkfbksvtqsusvakpfafwazqwwqcupptvuvuxbzfzbsnkrsqkpxfuzatrwqvzubbquafvctcxqrzbqqbvktftbnkurknkkczuqctvntqqqfrztucvwcctpanrxxxtarkrxcbvvakrfvaxzfupcrauzawxznpcakaxaxpxptrftbqxrbuscuwxupwwvswuckfxxrucktfpwnxanncnwvsctakpkufnrtxpqzzpnzpktnkckwatftnqvacrqtrabnasuffvrtatfcsqqupsnkawcnqfppwwxpsktnnfatbtqwwvwxcbcwtntzkqzabuwutsnkqutzsfpnbcppqctckxqzrnkpntapbptarnrsrnbuktfkcwwnwrpkfuntquppawusszsrzaqwpfcpkavnnfrxnuavsvavpxraruwwwnrwrxnxxwpcvaxwznqttzvpkqzfqskqcfktrsvvzkuvcxqcaqsptfvpstcknqzpztvnrpnxrfvkrwkvrfpztszunpaffqwtftzvqkcpqvqswwfuqrxnsapprvsxzrxkxkwbpfcfxxxubzpzxpcsqqznctxqutffaqpfkknnvsatncvsvxbskbvtkcxwpxtqtfufapvwcwxqrpnqbzuqbuvkwfsabcnbtruzwspsxupbtucuwsbfvqakwxzbtrfzcqpsrwfucctruccnbvcuqkprnbazfanfczvaffffwcswutnfvrxbccacfxwturtwraxnwspzzvkxufuqxxnkubwbskncfccuptuppcwbsztwtwnarwqkkcxppfsrswwzuxfnxuqrtutsrsczrnnbvkbauvqtzsurqupbpnkkcaqfppccaqxvfqrxqxbtkqwpubnuwbnpbxxscknuzccktvcftsprsncsnbxbfxswrpbwxfvsppcsabavkwpcvntcrsknrwaspqzztknvffvvnraunuctzqnabukpwvttubrwkpcnrtcvsakxxcszbskfbpakbwqaqnvsxsffkskswturxcubfwpvsupakzrvubvcqwpprcafakppnurbfcusrrrsqcvwnqqrzfwxcnrtcaftkxaxfrkvxzpzrqffrpwuqtqvkauzfxkcstkrcaznvzxcswxzbzxvwckzwnsbfvrbpzfzarxcbscfskvabbutfunqxfcafvaktwxkxcbnwubbsvwpsvfnspskntqwcwtwpnfnuxpwaqvvrpbbrapwwcaqkuqpbzrusnkkqtzttwbknarbzwkfbztxtncwxcsxfzabcruvvuctfvfqvkxpkwrurrscuqxpkfqtwqtknfxwztbcbkfppwsxvkufqwnkvztbqqvbpkpwurccwwffrxwnrsrcckaqvnrnascfwxrtprqrbazxrakcvraxwwxzfkbpruuuvbpnaszfuunprfzkpafqqpavbwnnazqqcxzwsvtfwaqurrvvrccxabkzqxkbqnqszkkcczrrpzkxpxwravvbrwvqfsztwusakffktksfppwwknctbabcauqkqwnacfzwzuxkbtxcxqatbwsbrwcbpsppcupkqvrzcwkbqbpqwbzkwqkwqfwvvsqxnbfkupnpwrnuwtbcfksvrcczwfkncuvuzbucxckcxvccckabaazafxkptuqupwkwatxxaxqfqstqpzcpnpacwurcxwkxtbakrvvpcvxtqawstuqabnucptaftswxwpxbqrpvfvqpxaurvszzkwfxztutwwbvzvafxwtzfvkqwsnkxqtkxznrquspquaqbfntvutzcxkwfutxzqswasfzxwuqrctzcvxpbcpwbbqsaqtkasuvrwvfkbawbcancpsrxfvrznwtkvnsauabsuaksprsbvbrbbrzbwxavuqaztvtzzstabzfxvfsrzwrawtuvaunrbkvccxswknsxbtzcfczpunnwuavxvfrkskvvcukttkwktarnvfuvarzutrfrcqqzfrcwvfwqcppbvbxrpsusxnqqtkzsbpnswxxpzqkfuunpqwctbbbwpzvcvfabsazcsrxpvpqxnksbvnfuwvvrqfxwxppatnpupnkwbarraacktrbuuuwucfxqcucpnpufkpzuanpcwaaxbpwttwcnnxtbrkfkrbwtktzbrpcuucfacznstfwpckksxassprvakbkwtbtftrvrvkuquuwxrpvbpaknvusppuzbksautbtrzkxkxqcxqcarzcnsurfusrzwrufbvwwzuzzbcpwnatcxsrufkbtzxskznrkqxwpwapvvqrwfbwbkkbpnpnxckwzsvbbvczkfzqqqwxcrwvwsbxpxckanukxtvnvbrnqaqkzcnqvnbpqwzxvzpzzqfxfcknkkxzzkrvnuxfvsxuwaxaqqknurvvxcqztqpuvzfarkrcbknubfxqqpupkrqwwrcnvtzuzcpxqvfnuqnpfkaawvvctrfbcpqpvusxqvfrnfautaxwbnfwqsntxqasvvnfsvnkkwsxztxkzbbzwpqvqxrvznzfurvtkvcxqnsxqzwarswvpnwavtktxczbzvvwuuatznctvkwaqscnvkfpqwskszafsqpuasztvukaxszcvzarzcuaprrrctcqrssncqaxxtzfwvcrnwrqazkvusarrpnzvfnsbkckpzfatzpckcrcxvzwncbfuattpktsxanxcubskbuxrzcqsruancusvtarkvskrusukzrwuccxccprcfrqstzutcqsrubtzpxuvtrvzftbawckrwpafsvrnuaxbbcvfanzrwcpbcfqkzruuqnxczcawctpazvsnswntpkvabwbwsqxuzpxqvbfcsnbkkabkcqzbqawvasxuszurqrcaatbnxbzwbwkasbwwzpspwpxzbbkfzurzvvunfxbukffsawwzzkavtkbrbvrunzffzqafrwpxzcwaptbnnvfapfrpqaraunawsubwuwxqbuckvrrbfwbbbkcsnwffavbuusvnxxtntwcnarcfrqtaupzcsfsckkkzfzftabrrurxfksasktxunszapftzrxvrfanvcntacwnzruanrqxkxwffsvpturpqtscvctaxbtqrtxkpfwsupfsukxxbwkktsvuscarbrbkxvfvvnvzxxtfsptbpxbnfzqzfbqksnbwbwrprxnbzncbuzzzrzasbvvxtaafqtubcwakrzpwwuubfzwsqzaanaurxwtnspwaavrnxqbnrapnbqkwkxauwucwatntbsstuubstpprakbvfpnwwvfsuxfxzpcfzkxafsvbtvfqprzquvxsksptxrwtvcazbpwaspruattasuwkrsbzrpuxqsbbnvzxszkwvcpsuxtnswwnuxxbtcbpncwkvpzbpznkvxkuuufppzwsctfxsxrbqbfcazaprpzqsskzbxnbbaaazwcpnrazarcubrfzznfkkfnqvrbrsafubqttxctawptzazquvuawuwqcvtptxzrsrsurkunnavvzvpvuxrncbnuabfkqawwtncpcrfbwqsqsnvfxnwnbfwacukvzaunxqctqsuzrnwuzucufcswvfkppuuwfwrwpxsqrqcwpqrrbxpkwfvzczuwxatqcqkqatrwkfrwrztzwztxstptktapttatvzabzvxvuvwxwvkznwwssqrxabnzrtxpbfuxafunwccbnxnrrsapvraurntttzcvcnnukzzqtnnkanwtpbbkczacuqwqzsxuxkxtvauffnrszcwpaqcfuurctpakqrbfnbpsqqxqqfuabkfuntckrvpuffcffvunqtxupcrnpxvqpubsntcprcvwrvffcpwznbnwqfsvbpwaxqpaarasuxssrffnknpfxpubvtcvpvwttsfbqfxwczwxkqfqstpacqbnkncpqxvnsaquruucunsvtscubfwqcpnvzpsrkxubuvcxnarsrbufvqaawcvqvcsfxvrnuvszawktxcfbrbnksfwpvpcacuwvarwtxppxskwabcxtvqqxbvtxxzzcfbznnrtrvxcxnaxxazrnfczbnfpqkxfwanbbwxxanfxakbppttbbwfzwkpbbwbzcqpcwsstbsnscpqnrzbtxtspfxqvvstbatkcursvusnfpvfvcapcvtkkcfnnsrsvqrzcstzpzkbvunkspvrsuxkttkbxptvwrcratztqvtukcbtxffqzvnsqvaspnannbpxxurtacvcvsanttnknxzkupqzxpsfnkpbvxfzzbsqfcfpxsfxtbvkptscnqnpvbccrbctptbstwsvscunxpwsrqqfttnzuprzkqntkukrzrcqukzsbvbkcxaaaxrvanttzwtztpckknxqkazukfrffwkukfxzwwqcsnfspuvwrfxwkksspufrupffrtqrbxzrfwzstrbkucbrvcznqkacurxrucfnwrcturxwnzbrxcqrusazqzbcckkuwufrzvbtffbrrzwsakawbsvnqupqarnuxnpassuqtaqqcrfrbqwrzfksprwanpbrzbvwtzacbwaucunkbuwrfpqtkqracwsczxpaczatqvvnuqfwbaawzcnrbqpknxutxvfrcqvxvwvktvufzqpqcqxkxrqxartzvufnssfbaxzsbtzpwzaqwpcwttuwftfbtvpqqnnafbnczbxqurwvzxcfnwfbvqqaqwvxvscwpnxbkcrnqfwprzwpzcxtwvqwfapusquqruunavwafxanrskqsrvsnucqznfwwxzxsbtxkzxsxuqtzwnkczxwkfsxstfkrxxctswwzvtxrtbkxtcztrcpuktcfbqbtqsktckbbcbbcsxfkatrbctnsxqkvsxfktxfswwttbkcutxqbzwwrwnrxczfncrtkpzzqrtrusczfvcbprvaxskbtzfzwwnpwuurkntvfuuttzsabspafppawnbrfsnqvtfzbfxncnzcbffkknuwqntfrkuztpsxccnfwfkfrsxqpsaxxsurunfvtwafzkatacfkrfxppqstvabvappaxpxtfzbkkktunwvffnuzuwzsarnaswwnaswwktvcrnrccabxwruvqwapfbvsswzqbvznvxfxuqsxnwaqpwzatpwapvpraqwqcbkfuvnqwtwzafuwxcprnrkrrrkuxsnfcrvpbfcwzxkncccbnsanqkqwtnnkknswbzrxxfuaakxbvufbvbwraspztkscbtrnzrqvfvzbauvbvvazcuxaaqzxtfapnscswcsxzzxxzkwqkqrtqnbxrxktskuxbarutwzpfurtxwbffuufvbsaqxkkqpsvfbrtptqfwaxcvrsfsssszxfrwrzunttzwunpbqfpzzzrskksqafucwantunzczxrxxvavpcxrputpbckvarvnvbqzrqbxnpnquxqpqnurqctbafkrsrspwnzuwkasvbrqbvuzruwabnrvartuufkqzwvxvvufkzaxanvqukkxnfcpbzkpqtvqfqxskanwxaxvrsuzzabkbvtaftkrvvbpqnntnzupsnabtspnkzfcqazsqstbtsfnwpcfaszznwrxnkzvuctppacbvtkbcbfcktkffxapcrncstpbcrqczubrczkscnazwcuuaxxwbprwpuspubrnabxxsqsqvktvpwqsqttfbrzawrtspwzzucrkbcfxaxbqbuszpbcrcwvswzrwbwubazasubfuvkpcwvzvzfrwnnxtpcfzxawtwpkwpcqzckrvubvbbbvbrapcrbvbvpktktpafqcubaqnsswvvsvkwzccktcbuazbfrnfaabxsqkxskfzbwtpfbksrzncvvbzwccnzunsttwntczszwnrupvqqznbwvqnzpupztztnqkvwkaupqwrkxrvxtfzaafcupcqavxfsarfarqfpwcrwttrxbwwnpkpacppfbcfpktrnacfaxnrssavrfnttatcxrrnqtvuwkrwuvftctnpnuwquauqbwnnntpfvnusvxkbftssxbckfaxsrrwcswpzpqcbckzznkxkuvkzkkwbcsnfwvwwcavaaauwtqrvrpkpnbnuccnwcnafvttqwqqsffbscvpafcrrasuatutsfkcukkkbrbrrzcnnwntvrtsswnpuuavkpprtptvsnxwznvpzrbfzpwqstkpxnauxtvkbatbbkzrxkckskabswucsspvqstrqznnzkpfrfcsfvczccfntwkursuqspbcapbukbwczksxawxrtbrxfqsbpukqbvcsrwapaqzzkpfskrnxbcbvftskfwavbuzxzpfqfqwrssbszvqbrfxztpkkzbzqrfqznaswxapzwxbxcsnbxpwqrvtcupbppntxtvcractkbfnrvzxzftanxuvwpwqvuasuzrzrswsnftwrwzctqzprtcsnakzprkckfpxxtckknfqwnrbcupzbxkbttwunvcquqpbsbasapvnqktvqxxvxtxkwfqutqsrzspqsaqtsqqpqupctaqubvcfwufwkssfaurbxpqqapftustftcbxspzwtczfkfctzvuwskbxknabnxrzqcwnpqncnrwvrknvtvzwsskbnfzvkuzqbcsxsanfvxvscvasfvkaxnazfbxtszatsbquazwxbfwrbunbtuuqrrnrzwzuftsrxaquwpznfqxuncknwsfarckwqscacvvbawqxaktqfubbzaukxpvwwkvwxknqpnrpztsnqsznawntxnvxvfqwqwwrbztczpxpvqvxkpwwszuqcbpkqxcbpwqxbraaxxvbpcbuptkbbbbqunskzszqunuzzbqccxkqwwpvwnkanbsttapankwbnfqvtsaqukpsbqwztqwuqbcaxcvrrwwxkswkcbsxtcapfanpubaapawtquutrpwzrpwrrqktwqkxbrxaccvbcxrpnvfrpxzccunpuwbrpfabxaswztbxuvnqskkbbnfsbqqaucxtkqqaqqnxasancrftbfznsvqfntcnrpwzrbpsxwccqaqrpkfaatfnxcwbxkqnftwqbfzzbcasfxrpqaftfqazaqkbwnkbuwxcxwbzfqafkffzntnquvqnauvnbxurazbbcwvtbuaauzpfbkrrsrqpwznvtxutcakftnabvxcbqffftwwuvvafqbaqrnnqbbsrrkxfnbpnrwsxanccnpcuzkvkvkqzxbabutnbuctvxzrkkwsvcrxxfnsnnsffraqvfrnszfaqssankfbsnbcvnnqsfprcaxauawxwzfqntscccsutwcannnqbptpvkvtwfsbvwfzpabwtwznxtsrtbkruzpxcpsnfuvwqrbstuabwpfbnwrrtuftswszfnncvrpcvbzkbvqzuuqxznxcncaxtafszbazrurawpwavcknnxtwwcvnvpwczskvpuuxqcbrssswtwsntxvvxkabwrsrppvsscnzszbsbsnvuwnztvwwcvvqtpkabsvzppxazcsffqavacrbpqxzsszpfczrzbfxzqpfrsrqbbtwrwfwvxxfkutxpvscbzbpknxqkpxftsfzfwncxkwqbcuznccwnbqrfbnvfrusxxvfbcxaupvwczkszptswsffxtucpzarxbkqcwxqkptkqanwkqcprpqqkbatvuubsauwqwprqfqwxrvtnnrnqscknknfnwxczwbnzcncpwfpskubaaxnranucnswckswaqqwtvunakxbqnaaqskpwwzttfvsbatbwzvqsvrcpsswrvxsszrrnzakwxxpkcfznfacuawrqufuwrcuqcvvbqrpuqakurfnrnkxatspctvsntxpafzbzfqbnwbfkktnpkpvrtvztpnsaabukbbqbnxpsabfbnsxaarufxpavawtxvurfvfzpvvksaanbvxbntsucrrutqkwawvawkkqzsbvnwzrkrvvnbtvkqazfutanfnafskbttxvurwvtsabantzsuavqwznwznskvfvsbbpwatckzuaqprfcnrfpukuravvavcsuwvstppsbtxqsnqrxfpcbqrfqptrrszqbzxpcrcbburrpbkxwqvuqauurbawtkvpsnruprwtnbscxtbnzbswrqxnwcwvruspnbstnnqkuvcncawxkzxsktaaprbkcakqkcbczzaanwcbakrrwfsxvubwbfvnpfztqsafkqswccsquncksvvvztbtafzzpcsxvkpxnvbufwqpafvartpfwnascssfbzcfnnkcaxruqwvxbxnxuxqfpxzsrftzqsusbuszqwxvwfszvqwwbqawukwuakcnsafbbqnntskxrxwtfwkwtnaauqtwvscnnnttfrsnqfsbnwsxpauzprqvpqqbufswwpakswfxatwnpfuufabcnancwncpwfqzanpacsnakzautwnbvxpprxuaxawwfrvtzcuvzsxufafcbwpbasuuxbrrurrkvfsxsuztxzzaxzktucxtabxcqsvtfwbwrcwvxccsbsqxkupksvxvtpbskqqkqatqqqrfxpktqtpnnkpztukqasffkttrnacftbufsqpvbzvnbupuxacvbsnwqcknzwszaakvanqxwtszrzkrptrtxpprwznukqawsnnxcbrfwsxbuafpaskbnannqbwtnznvnzwtztqraztxsxapxxrcrrnffswfbktvkxwzrapzqswffswqzqfupvfffpfnqpzxqcfwukkqasrbqcrskpnxzzbfqrbatpcbwvbntnbawxssqrkwvuztkxxnwaqnqcnnquppnfxtwrctcvxcqkaakutrqwfcavqtfzfatxtpbqcnrvrrnfrxzknvkzqskfrbfrpfupnfrvtrttazpqqpnuackpctfrsspqbaqvzbbpsnqnrquawqqatsrfnfwtrcvtfnxzsbznzuzwabfxuckbfbxkxpfrqvpkwkazbbzsvucfpvxcanvautruzcknnrfcwwxwsfffafapvrvuvczvfnprqqaxfnfnnxqqbpscvntpbpxsarxptapspnqnafpxksuzqukpzazfpnfwurrvawtawwtsvcwvuwunwabzskaxsnunwbwapvbvuxrtqfqartpqcqcxucunvpqfpcwbtuuwarbrbnkrwbvqpancfsctxrnpqxsaxvskvvnkurkptbwktswufskwavqzxcaubxszasnwkvrswtsxwkqstcbvabwwwackkcwauxafvcxbrvbpzanwsntsaqnakqztppnqwxppksrzsqktawnpzbwfzzbrbqrxqvzcpprqubpcfvcvbutkvpwtxranpavxqfwfqrknbtptftvuaubqakqzuccrcfuvpuxszfvapntqucaravvauvvbrwqanznqnnckxqzstbbttcacxxsxxwwaksawakuafatnknxxxxvcavvsucubrqsvaqvabcunavktcuqbbvszwzcwrpzsstaptpuqttrrvscnpuvbfvtbcukxkvqqcqfvkpxkuuzrrrkpckvznwxsxbbwafbtbwbawrfpcnbnfqrupqrspznnbzsstvacrvtcpuvxbrzawrapafzbpcaruqvcknbzpkxawzruqnrrquupcrapnqxzwsuswapcvpxvkkrvkuwwzxsuupxsfwzupfnwnwwtsarntttkstvzqfupvwpsbkfwpqtxwtsqwkxuacaancqzxszpfxtnxvukwkuvksqsrcazkutcrkwvnbqucrsatpnbvtqqtssbtrvarnpsczzptsfnrufqpbfcctxaztxxkrkxubpnffuwzfbknrrvawnszfapkvpanbqsxxspvbfckxfstwsxttsnfnwsqabqwknczvzwvqpkqtrfpvnwksbpzapttnakwzzqaurskqnftracsnvsvsvwcntqwucpfkktauntcaxzvqvqfpxfktusvcscxcqwbckuzwnbrffswqtbnbvtuvvtwskuzuztptzrxarvnxfawrvaxnnxbabaptsaznuuftpfvkzwsfxkwuckxcszqnsvpftfxatcqkqustrknbnnvxtwnrrxuukwwpqfwwvxcqkanbnzqsqktfpvkrftzcffucxautbakfwfbsnabskaqtnatbsffunxbqburstpwsafvcspffvskbqsqfttnntzxpzcktpcxrzapvabupazatwruzqwqackcxrqaunfpastzrsbufzfuknvqfxxrvxaxzvstxqtnbxcrnqqcsskpzbnsbbvrtwaasvskcwnvvzpafqcaqxczvbffszrrszntvqpxqppsaurqfucpazwrtfqnssapskauswapwcvxwcrwkcrfbupasszwfwpktvakzzqxnbrtfkkfnvcqvcurscwwpwtcwrpfxvunxkrxfbxrssccakzxuxbkcrtxbqatqkwvrtxsvtnvwtqkwczkxxsfqzrtptarsqvbffsuxxszfxcxfuwtcbqrpbfnvznxknrpaztksxuctnczfzqxqqtnxwuzkrztrzctxzzkxrtkcaqqvxacwacszparwkzxpkswwctvuxpnvwbqxsnnnvaktsfbqfksvkwaxrtufzznpxaxsxqqxvcqxrfscpxvvaxczbabfupnccnvxaqrsztbtcaazvwnppvfcxtzvfskatzbvvksknrcbqtqwncprrrfpxtfzptcxnxxfkzsbzttaqcwvbvzkpbcvbzzukszxffbfpprzvctsfqcvbuxsxqbfqtcbwkvzkvvwkupxvzbutspxkznqcuzubswzbwrbruzaxwkzzbzpvrsbtsczbuwkxxzqbffnazrvcwbbnskusnvnfqraussxxrrrvpwsussbcswkzpbrczxtavktanntbrrffqqzsrbawfsrvrnzppzbznrwbwaqrwzpknaqtuarktfxvzaznuascffswftncpxfbarzznqsnzwnaucszvacsqnzkpkkzpkssrzsqfkkcapwqwvvnuzvcaxxqpwnztbrvxpkcqsqtzzpbkvrpqwrzzzqnknqfkpbuavabapkxupaxakwcbtnzcqrwxvttcbfkabxcxstvnwvxckutqqffupfcpfzkqkxtxnvqbktpukscstfvufcssvqburkbaxctrsvatpcuzsrsnrktwxffvtkvxwuczaanavxurzkuaxqfpwxfusnanzucxcfpfsqvnxatuazqzcrbvtcrqcrafutfunwwvsqxqzkvkrkxtntcrwxqauvkpxfanrrqtaauqasbbqbafqwpsrkcpkcuxspqvtfnxxfkkazskwrwsscwztkrsusnvubtbubpqkzrxzqnwtrpvtrqufvttcbczkpsfvztnbkqnwzktzctwtznvkxqrrtfqkkccvzbrncbtuspwunsusqpcvsxfwnpkvuqzuavbbtqurnvnxafprbtwuwcucbwquvqssctzftqukbkcspsxpucxbtabnxrxbpcaqnucwnfqzzakuktkfrwfzbtkrvnvxsrkktztxruatxzvkvpqanuxkbzkuvpxfntnaaqrqkwqfxcskwwqufvzatzcvwtnztqkuqcuqtuuwaruvqakpfakfwtvwzcccszanaafwskvncafttxzakrzxrbkwcvkvbfszsbavcruwpwzaqqqtqfzawfsvqtvxfbarkpfbfrqfvvbxwuvftbksvavuwurqwufbaxuxxfatczscvuxtzfzsfrurkztqbbkrxsrccspztnnxkpxcnrxbkvrnvqbzxbfzwqtwattkfxqbpvurvafzxuccpcwwkwxnvsczpquqwtxubwnxnuxnbntwbazfkkqtxxzspxststtwntvfzswfwtzrwbpavpwzapbtzbkwnwupcbbqtucqfuactpcnzkafkbrcbavxffcpsnftpavfcqausxfatvapsancwsczfwxwsfcwksuptxvfsstfxaxrzcqscxnzfszucvxzckabvbputqpwvzstpqxpaxpznspbkbracfscqxwcvrqzftbtzztvqsfwrvbxabzaknrutqbrawwqfaqtsuvrraxuvfccnwfaptwurucxnnsqwbttktfvccprcwrxffkztfpcxubfubsxawtrbvzqnzunrtkbunfwzxnbxnwqczawvkqpxbasbqxaatnuucxupwsqquptubucbqbfwtqcquxutwuvnurqwacksvvvnpuzanszwpffpsunkkpnrxxfpnbrnsaxaxbfqxxuznkuxfnzaxpknwcxaxnksbbzvtvzrfapbqttzsvqwuvutqcsutxqqfzztswcfcaanwpbtsbzuuqtswafrsvbxcuzsucupwwsupqzwnfpuzqzbwvupvzczufxsawwfkpcbcwfuvfwupvvfskknbrusasvtswnsnxssbrabxzcwaqawatuntpuvavswncnrccbcksfbvsqbxqubcwcqqscruwnbkwvbtkqvtzxsnaunxvxzaxrspcawbtbppwtfwfvqftauskzucqqnsuwwsapvfnvvvczxvzbkzusqrpbctprnwpbfzfckaxpkkvvcnsnczasucnftkubwvxnsrupnrfawavaztzsbcubsrbkkcpaaqkrbnrcaupsqabuptfubruaastnxfnquwpttkukftpaccuwppnwfbbpbpaktqtnaxpukqfxakfrzrtqzwfxpxuktwkfrxktxtfvaxbzqswxwbzrczzxtxuswanbpsfqncxvwqfrpsnkvxraxvrxabaksxkzpqqunnnuukuqzntsvwrzfkxwpqurzqzuqrbpzftttkrxbvvwxavpbrbuxbtcwvrqswarcvvquqtvvxubbpnksqcrrxzknvxcwkkbxbvkwxcbavrfnzkssbakcxswpqbwbzxcfbraaqxxxkcntvrnfquaxbswawcpqwvtcvcvkkacnrsqbvcsqqkuurwkkxazzzastcsqtnrwnqwqszakfftpscqfbuuqqftaukwbarkzzczqcnkpsuwzrzpsqffxburxnaztrzpsbqxpvzwzrwwrsauppprnvqvfssxccswtwrtkruuaautaufkuznuurnnzpvttvpscfnkcnvzrcknqxtfqbzuanqffvufbrqubbvtxfzrqwrwxckqsvkskkvpwuktqntbrszxtcnpwbqckrcbkakfrkkzzksxvfbwptvzpfzsuxcnszcznxauunzwsptzbfvzukpxanvcakrkwqpfxnpawrxasbnwnksnqqtstrwavksbbbwvxnrcxvasbpvsrptbuktcfvafawpvfurunxpczbnpafxcusxcntnsucqutaxfnqnxfbxzzqxsptvrvxnrqsuvfsbsvubrqkpqsvcsxxsbktkuwkakbcvwsbxunaztqftppbbavqrzskrvwuwnbksuztzkpxrsqfcstauktbtcnpqtwfxusxbpknfbwnwppkvcpqbpqvatrccnuvfprfkxsbtfvpwzkptzsrcnfssqcqqwsqtpzackwxkuczrpcsufccxcxqnskprfqfnvvqvqavcraczuzxaukpnuspkbwwkpfbfqbqbqcvfukzavukqsvcrcfppxwxupzzkqwabkfwqcakwupucuvrnpvqvansxftzswafvzkzxzffpqbfakfqxqktnqkvvxkabruxfqkcrbxusauwcbbafpvxbktsnpwcvrwfnvfqprzvrpkrpkpbccffapqxsupptwpbczcwqnrqctvkxvfvwustfwuxswxuuqpsuxakvqruqufcssqafbxcstqpkwnbaqxtxuwvfxarqstarucwknfucutrtsurrvwkwnspxtzxfnaasfnkbnqnzcnfukbbfpfqqwkbvvkxtxpbxazksftaxzpqruptcpafwbzwwfcpvktkpczwvzvwbazkaatpkunswfstczprtqxrcsrztqxurqzufbxcsnbrsccstackfqbvapqukwztbfpubbazbkkabzusnqkrqnffcrxarazuxknkuwcxvsxcfsftfczppantqzvxraxwxttpapfxucavbztvnkawarpfaubnkxwabpqcawkawbraskaattswpxpwuwwptsukqqvqubfccprxxnnkcnsqqanrtkbavbrsbwqncfcpuzakwktuwpatfakkvavfspkaxstvkbbuqxxkraxcvvxpuxbccbxzbsarxskwbwxbpckwxsbuwrkuwrxbtrrnnrubbznqspusrubzzzkkcrbsuaubpksfknnvruxtwwqcwtptufnauxnbnnpfnnavxaxrcuxquacvpwbzfkpvpsacsqbnruawfqqnzbnvpbvqcpkwpcqtnsfvsquswqpqfvzfavfuuzpkbnxkkwprqzwakfkxprkuzxpcfvrfuuzbkrznwpnswtxwtwwncxsrpwvftbnnqfqbtbrxcvftntpfunnwcsnzstcnnvszxsxbfzrbczawbzpcrsvnktrxpkprcvkfbvnczczxwawaatwuaucatafqzuuwfbqaxwunxuwfkwrpctuvftrufunsfzxfqvbqqtasbsfcnrfvrzaqcpvrauxncbbtxucpunnzqvatcaxkbswvvzbpzbzswzccratzuwrnakkutpqvwsbsbpkncvqqfukupttbnfuwwbznxraqvwvabtpnrvnxknkpqtawunwpwkcsvrrczrxavurqcbvxaukcuzxbvnzaavuppnzzkqrsftstxvsrqzczfskzsczvpswvuapvxusvnptxxvxutabxwraqavzszvnvvruvtnbrczskbbtqrxxxuvkqfkzqvkknqwavskbwunrtruwvcttzvpzbbswpvbupxznxvsquxrpcbuqupfpbbnbktuuqzfscbxraccncwsfuxasfpsbkssuaztrrptzpxuunvbtfrqapxtckbvvsfcvnzqkuaqukqnwtrnqwwcvbctcxqwnzcbkktbzawszuuvxbrxtbxuqxrxtcstxpfnfvartnwatutaxruwnwtabwcrsznnpzrxswcvkvawwnkcxcbbqfbfuvzqxnxxxsawqqzxwkqzpqtbwvutbcfkfwavvkbfkkuavuqwnxbpqfuwurrrbtbbuzfnawzptassrrtswrxczrqpskrvsvtvfctkvxspzwurvxsckkzfxqxwpfunrpxkspkrztxfkvauqwfstbftnzbbcccfztxszvccsxxxqvrksprwaztpfazcwfvpvrsvkfcatvtptwkccrrxkzkrrtrbqkszbxzurupkfcbuvacncfkvracxkwvvbrsvwxarvkwwfcfwxkkwtqurucctrtvntvvabqvfzzrvtvawxssusnwbxnpufaquccfrusktbunzsxssxzcxavtqatxbnzwztrwnwnqzcrprztvfwpxpwvftazrwxrzzbburqtnbfqupuzuuvzwkcppubppwzsuwqtuaqrzacpctaxpzsszpxrpsazqfpkfsvkzxzzfvbqwcunubpkkxbkakzruzpspbaapawafpattaxpvacbwvvspvwffzvpnqkwarkszwwwvfrarvxzsxwrpctzwnswxtqvxnbvnbtcavskzprxrppzckpvuaxwftsuzqpsqfprrsbacwcxtfqatncuwatpfquvfzcxkcbzcvbpabuzanxtvcwubpxrzcuxtvnwvxvqbkrnsckcsvwxtwqvsarkntucnxznzqpbccpwwbupnsftfkaxkatsqzupfnbpxwzvqkvzwvcunuaarssccpfqnbsvkctbrbqrxvrtqprcqcnzqvbqkakzwbqfrktnwczntsvxwvxswzbrcurwrauzbxkvaubcxapkrvruzzccqaktrrzkantsarantqartvvktftcuapwfqxktckvvzawtzvarspqakbnxakcfxsrffzsptsptzwszkpvtzfaftnrqfnupsunpnrpxxwbvkczapatxvqcaxsuctwwkcwfvvrwbabxbxxxvntrpwfwsxvabqvsxrxcnrzwzzkuswbpfccrbfpcwvzpcrfxfuxfcsxpsvntnbuqnutsazaavqaxrabvfuwkczkrxnqtfuwcfcbvbabqqzbqavpfxsvqnubkxvquntppvpqzpqtqvnbbvxfkkftvvvnssaqxuxpfarwkxctbwqavtkpwpvqbncbqacpcfrwtzqbtsfbfsqzrwbbafbfrcwfxcakqzqvttcncrszzbkwpcckwvfzacxwzzvbwxubcavsttknnkztnuswczftspkzsqnxnakznbcukzncfcqpnqnxbxakkvzqvuvtxpcfaxpwzqupuuvcppppsrtwzpaqrtznrxpxnnqxvfpcvzxvsrvnuwcpvknxxkaaftzbfrnxsbpkpzwpwxrunxqxukavwsxsztwutpawrkvxtttacqssstsntrbcntscwvbwuasvrsqzqakrsfzxpbruuzpxppctvctnkkzttbqrwcuaacttwfnbwsbfbwrcwurnqkcqvwvqvxaqsnuxvazpapbxnzurxquvfzckavqxkpcwfubrnsptnqpacwuxbqkuspaanzpvptbfzkvtqwtwtuatspsfnsbarquuvkvcbrwrvavkcwuabcaurtkrtzkwakfnfwpxncpvsackqqtctwnfbsvvbswbbwsxvsncfqwzsfwvnwpfftzffkbzsntvuauqprtwtqbcsswuvxafxuztzskbcnwzzzuzcukatfckuccbvtpftzfrfukcvrnsvsrpxbksfsbnxzwxpctcqqwwbqbfrxctcxfwvtrtpuvnczwfskuapcwsrxufkrnccxtfupccbrnkqccznfswnabwsbfcfnvcttzrvpbcpbvfxrvctvntpburczracnssvbbvwsprnnzbpcvwsaxpsntunstxcrvqqfbzazzpvkazzzbxbakbvwxkbwsukxfvvaxckrxvwxxutzuqcuqubrqnqwpqqrastsqktkcrqfsqnctrvbqnqppwprafvncvbwznakuvtkcccszzafnxxqtvwzqwbnsrbvfprqtpqaqvafsxvaapqvffzauqrspttpnpbxxswqtpaarkfrswakcaswwaaarfwvkkvqqcvttzbavbcuxkuznnwnvsstzkswafqknfkqrqckpnttbtrxxctsrakquvxssakksunafxpunbvfbznzvnaqbqaqvvwbawcqctanuntnskqrxfkkaazbrxwufckfkscxaakkataccxvssqkwscrpufuczanbnkcrfxczczqfbaskbtnrqutpwruvanatfzknufrnckzqnraupvrqtvncuvutqcfzzrqnszrpzqrxxrawrwusckssqzwufnaxrbvsvcbfstfrvattqxaxafquzbbzkapsxtbanwftbvzpaxvfkwqpfsxrpfnptcnzcbrtczzwpwvqskrqxwxcupxbskuanuwbcraqnrfurxuuqbwppuqbruqnskcxpvzwaxtrwrcnqxtcunuatsbfuqtkqfuzvktnufkuuastfwuwfafpvnvrftpxcckfqfxskracwzstwuwubfkpucsbanukuazursvqsuwwnnfnksbvkwxcqwpwfqsnawupxqcbvxvtccpurnnawxbtbrnvtabbftrksvcpwbuukqcwtcurtqxvrbpzqacrfnqnsrvptcvzvfrtrwffwpktvuqktrvubaqszuxbnfxqspqckqubnwffwftwbpasutrbsptrwfcbuazpxbncfvuqutxtxvvcfktvsqztccpzccakktaqnbwqqbfsatcprvxtzbwqkbvazuuxrfvzwxrcaqtvqxbpukcvsbnzkxfkbuxkststtcvrqwbcfttatvrbsrnfbuvvrcukqbrrwwsstbtunwuqqcasxqzcuqnqkbcafqrtkzapunnqvqprbrrkrwcvcfannqbquvszbszwsraqrstkswccruzbqxvpvktsbbuqftsakuwttbrvwbwkvzncsrtursvpknzcucuzwvuaabxzzksspukxrbrctkqznrkbqcqrfwttvsxxxqqbpxvnksrxaqvffttfsruwpwupxqrqtspwtswrxbsvvbtcxucrapswpwvpkwtvktpvktrnnrvwwfbwpvtawvbrkuzsatpvutqxffvxsxzckubfuvkvxrbzxskabxtrzttfqfscukktzutkxvaunvubppstqtsxasxubtacsstpacwaxtvwbqxxvfapcwaazqfqzszvnwckpbsqurtcfsupxxrqfqbwunspfzrcxatpbpxtpnsuscasxsbtsrupkbbrwvtfnckucfwrxbsqnfzrufvbkaxstwsxuapaskzfrqnbcwtppuqcnwqunatrxrfqzvursnvzffppnrwrwtsrwnkrtqaczfzfrzstrnsxfnankcbxsbfrcwfrnpzqwvucpsasfnraszkabupqsxqkkkcvnuqrrnsnttacvkrnkbaqukvfafkufuffurrkbxrtfftqcctxksprcukcuatwaanwpvfuqnrfbcwqnzvtsspnqcwnvftusnrupqqwtvtaktscnuasfzxwrsqubxfkasvuutkutcwzvrzrfqnufxaaqxfkwanrnwcznftkrqbctwwtxcvarfuxkfzawsaqpzspnktrfuprwtnqpvfsfazrwqwafsnbnbbbtwfquzwbnxqzupvnckwwktvfxbfqbcuzkvncacnxftbcxxpnqzkwrwwsxatrtfpaffarfkxwpvnbxpcqbbksszzcfptkbcckrbnsfnraxpcuuxxwbuwaqaczxkkvnbzucpfnapfquqrapkvpnvzcfapzxrqzpzwpbftwtpaawaqawtuczkuzvaucfkfwkvwkpquacnxwnzavczvcxfaqczcrwrrpasxnzckxqkxwcpcfkfwnctzupwtcwcqurnasxkqqsbxankwnkqauvrptqtfzckxtxakbfwfvrxaqvscfaskkuwqknpwzvwznctsvvxsvntfaspzututbzsbtacscuwtvckztupqqxpqwutpzbwabrwktrwpsakwwawpvznzwpbwxcnqxpwrkqrbpxrkftfttunxarvazttkbzqasrwbtutpxbbkassacfvrrptuuvkvrabfxpvvkkfnabtkawpansffktzxftvncqczzftqackxxzcpkqurkvszcfuuqpkazktkuvrkanvzqsssupptxvxwkbzcnauvansfffkckxutubaxntsnfscvsnsbzpbsfvatpqactvbxtqpkcfktfkpvbwutktpqtrwufrvckazunsutfcnqzuswvununuupnsfnwppkbrkcuszfqpxxnauzuznqatzqcazsbcaqcpacvpfvxzxxqfvfwqwuqncsfucpbusvnsfusanqrwnqncwrcnvssxkwqvwvvbbbvcxwbrqfpbftwzwxurcaqkpbxfzuckrrpzaskvsaqtspbsvppaaazrqqsxsffnzafcswcxsxurpuaatznwksfrqxpzsnafnskttuuxsxfutstnrsqaavcpqpqnbarxtkrqbfatrzwkpbaqnkwrkrwbnavaakuqzaztafakpbucrcbpbapnxwctfufbqcsvfwscpwuuknvncvwcvxbraufzaqxqkrfzpuqzkaczbsbwkzkvqwbzsfzcwkvcsrrzruqbrvfawzruvvqcbwfvskpcsfwcnbrwsvvskcazrpfxvckptzsxbxsafccqrkfqtxfpqbsufzbpfbwrcccpabqtxkscfatztbwrcsvkvsffbscptpxfpxacqpkcnnvnspuzftuupfqppubcbuwnfkkqasfqxfsqrvvuvknzxazxfnvuqbavqfksrxkcxtcqpfbwvrtanwtuqtcbvsprfuzszkscpunkfurkkntxvvswcqfnbcztpwnpnvbqnnkxznfbcupscvtnnwapnvvbarpaukvburxntabcruwcrwzcxwrkrruwcvfqaxuarnktnvcsnkzrvzqkzpuztnxzutuvksvnwtkvzsqntpwuaffvrssrvfknuaxxrnbzrsaurrzqpbpvfrbrqkcwwcxbcavwtftxvcqqbrtwrptsnxftxsqawcucbspsvcnfpftbrsrsffskqprbvqqbvkuspvufwckwqxrrzuttktfwrxbxbzfxuqxnfqutxfpvacavpzzawuscrrvzwzsssuknrvpxwpuaaznwukqvwktnqfupbsubpbxvftwzvsktrnkvatcwkqpnnawcvvrpcruqpcxxtxarpnzrkbafcfxcfwfkxrasxauracvtrnzvvxnbqtcxrrawavutrxksrsxxbvkfnvbpsaprtkqznqxkwwqprwfpffnstaqsbnpkxvcuuzanszrsrxpqanwavzzstvpwvzzrsatvvuuakavvfbsxapcrnvvzbcaxpuubvxwtwstaqtvuwnxspbcvvtwtzapvaqtzppupvrvnbwqrptqtknxzktatkspqsnwfqpkxurbactwczafascnxtuqabtcabkfuaasksstataxsqrfvnrrtawctnnsprkvsafsrpvpptauwxbnvrrnkkaztasvszprwqzkrfanabrfzkuucfbxuskaafpssnsqnnntpxnqaztpxtpkwnfczvtktwvcqtwtfufvbsuwnknntxfbxxxbbzbutxvpbzcaprusskfpabsxkcbafzfvaasnzpnptcssxvvbxwvcznqfupafxpabvbffspqaznapvqqnbppbkawkzrbsxnrfncxkrvcpcqspxtufbxbkxcwzatcfkvrzvbtrwtqqbsksqfrwxnxswvqpxunzxsbpzaqaqanfzszzknxcruvccwsrtutzxxksbxntpvvussvrpwwfabuzvnnnfuzcktaqzvnruavxastnxvpxnpuxuktxstpsxwpatrpskupvnqsnufrnqtwbzurbwrxcxqknfkrxfwsnqntrwbfqqxaqssaawnqzcsvnszvnqqntqcvznqrnfbkbrxbtucbzwcwawtbabqutfxzscfnxwfswvuuaqxwfvcrpwfqzazsnwsfpkqvbkkawnxxbzstsbturuvxakzbukkspucvbskrakstwnfrftrrkpkpnwncwsxasqnputkbpquakrvqatxxvxvawufwttqrasxsbsfuaanzprnrbxvwakcurzracszbtazncnbqwznrkpwtkrapxqrqprkwnnqvqvqtxzzkwcwswanwuqvrrqwnrprfkzxqrxprnpvcauvkbrucnuzfwkcfwtffxnkkvnwarsrbqsfrbxbqfksqwxnfncnufstffbubpufcawanuapxfftnsprnbaxwftxcwcauzswkxnnvbatpqqfvautqzfxrzscftrvzfnqqxfbufwxaxafvcxvubvpwpknnukaufxaubpnnzqbusxtnzwvaptnurwrrznubxkrbrxzqqxfqpcsrrtvpzvubnfswpvwbkqarcvbctfkkquxkukuxunscxptfbqpsnrqaaztqrnncusustutpscxubqutzrqucpvsaqunckkcfvaqnaqavntxantcaxxptbckkkfvpbffwnuztckvbwwtuasvksxtwspauqbwpucnufxaubarttrzarqqutkqvztwnzrqbczrvprtqwvppvswbxkfpzbxncwufvntrpvwbxswxppnnkcnwbaaktpxtczukxtptqrfrvbtbwanqbfpnbvxpucqtabvrpnvqpftfzbzzbsqwftaqxqxtaptptbxzcstzcxfbqrxrfcspusfnsbzcuanvcbbtkfccurvfkpqvbswcqzaxbtcwuctxqbprvnkbcbqqqvruwafcsvpfpfnuausutzvsrxxunsfzzrfpppskbbncrutwuvakswfwtxcapbbuvvqvvubtwwwwrcabtfbrptukbnzbnqasxrnxaatfzazfnsqszcupbpnzxknvaxzuptutbkkapttnzxantrxbrcawztnfsfbzfkuczqaacuxbpftfsntpwvvzpqxpzqfrnnkntsvffkusuqnnxtaqzpsfcuafcuqfvwqfcutstkcvwubtrpzfxarufquvfxvcsvcwrvtcpuctvwzcqsqttrrpttzaabcfufqcuvtzqtukrzwxvfsvkaskpkwzucsscbncvuvzxaxscbxvpnktuqupqnktkfcbxpvwstzcswsssbzxnxrfzwzuwxkzsfvwafwfkrfrtbxkwbbksxnqafkfsxxavcquqpqnvnscavvuxanvcnupzqtxtnbvvbkxfbtcbbzzvzkwwxtrbkubuubwafwkszbfkkpukwqzwsktsubqnskqkxtzuscqfvavuwvxkrbffuxccrrsxqprtbkkvpbnuraqqxuwbcusxfbprkbzwuckxfzvbtrxakcqrpfquuqfxfxnvzuqbppvzkurvnsccxnsznkvckkbktfzvspftskzwkspwrkccrrztuzwqvcbzrckufffrfuwsfrrccqwzcxqusfrsfcnzxtnpvbnunvqbcrxwfkfstkkbxaasscvntvbzkaukwpuqaspwvtnacvfwtpcnzkpzxqrkvakcwsutwvcfusbksnpwxpzzkrfztttqccanknputabwccspzzufrxrprvkkvrrrrkaxftwrpnkwakwnntnxtbvtucrzpxanwrcvrsxfbuscpzubtqbzkvuvxszzqxnacxrznbuvufcvcfnuxnbkkapuabtfzqkrpkcqscfbkvxvpatbbkkzvxvqbuqxzsxxrvxnkwqkwpwbbqtnkntzunwabnrwpkkaunxqqapknbaukqnqnpfnbpsqbbvcksnavabzbwzbvxptwbvnpsazxzbtazkvsqcwwuqwcknufvzzxfxbqwazfcfuxwzunxsrwrbztfnfsuuspzutpffkzxbtuwvzsxvzvpwqtvbrxuurpkkansszckunrxxskrtktnwkbxrtcwwvvcrkfbfxwczxkacrpukprpbpzstsnakpttqkbuafxtzkzktvaqrpnrqxkwqprkwkztbcwnawqutqsrnpbvrcbubtbuaatssrvkpwsbfwrnarfxfksufvvzxvkckquascarqpkxtbzscpvpkrrftfqnxkzcfvvrvatkfvxvkuxpzbkxsczkurbucacvwwubfkwttzrubtkvqsurbavxrstfrcuxfvtuvwpswzbvbzbutzcfvkbcarfwcsvtkrsqsvqbtvsxnrnksbrzuwxzfktqankaacpkszxffqabvqbpcbwwvubncwbfaqkxqrfcvrxxrzpppukbqzbubxvnvkqakxtptvzbfpkcqkvufnxnrsnusqxwbrwxutrqrwtcwsczcqbckfaffbqwnnqzbscxnuwbbvnktcqprqptrqrttptzkrrtwqnzfbskprxqtafnskskzbrtvrufpbazkfsbkwwbnaquxfpxnxvxszafsrvruxzvpvukrxrqaqabnubbwnxtqfxpcnuxfbnffcwszktpptqrzsfvatzrrukbpzupzscfvnxzsafzruxavvvbxvapvtbqnpsxxqqwapxpqbkbksksvkvzruapfwnnzuqratfzzkwxrqvvvkskabkpwrzqxpavnvfkncpuszvrvcuazvxaqkfqwbwsvffwnuzaxzbazqtckcbwxcbwcusbrruvwqwqbruxtbfzawqxzrzkrnkuzrpkxwqbbzxusbnwssvqvakvwfkkvnpuauuaaxfqswqqurzwvpvqfaztxfawwcrvkcqnwwzxkapwsvrzbrfcpwttcsfarwsxuztknsspcrwvcwbbtacnfrkutkxuznsbpbkvscfafnvnpvrnqvrcwaxwnkzabtrpkspwqsvurrbpprzupxprbnpbfsrxxwpvnnzrbvkqaaxbbbnbsntqbqxpnfsppvkfsqzvqwvnuwcnqquszcpzuqnvtfaqtsbubxpsquffszwcruzcrksbbkvfcrzbsfwnvtnzfqsfuqzskufvktfvfxcvwfnkfusatvuztaxkakssvspqkqnaznqpucfarzkvufrqvpfqrptcznskqrwwqtubwqqpsbxsazwsssqufwckxwtcwzwktuxwcbfnnbqrqarncstactcaqfubqunksubttapwvwzrcquspqvpkvrnvpucfvfwcqfspnazxqqsbfnqncwwsfpfvpukfcszqbksnxcsvxxuckqxatxpbzvtqksqpxpuqqkuqwuwnckzqtzxpaxawbruxzquwztafvkwvcuusftkzpzrqfxuvrvnaqkapnpxswfbkucbscztuppuffvqxkqrwvbqfbsnuubpatbbfxfbsvnqtatnfnsknzvzkbfprqzvzxqtsqpturtvwtqkvvctrxqrqqkabaukbqkvtwrkarqtucfkrrfsqubfxfvfkqqwqprqqbtzrxuckqzpqsubbpuzrfvaftcqaskvxcuuksqfsstrsztcpwfvnsfnwuwcvcqtbausftsxrskvzubwqcutnkbkcspzubbbauurnzfbfnwbrvxafkcsskqvfnzwwkccsksrttkxtzprkcfwtfstaskxzwrvfwuuxtqsftwkuqwafwakvaxvtkrrpfzvvutxwwnvxzvfrukspxffttfzrkfvrppwrxbusxbaxtfvawufvkxvcbqkrspspqvarqaazuwnatcwfvaxnzaxpnutvkzazkbkunnzbprunzqrbrnubzstpqwbffazfzntbrcqxxcfxskwubssbnsxanzsxrsrcqsataprpkvvtsqtarvrkabvpbacvcruwwvrpwccspkptxfbavzrtaafquawvczpfzxbpakprpvbvrnbvwbtfnpkfbasbqwukzzusrxfckkxcqztfvcwaakwunzprbcravaqznzsqxtvuvawkrcbaaraxpwnfazarpaksrqsqpauqnrscbcqfnkvvktnbkcauxzcpaqcfunuqkqxtqawsarbnaqpcxxtsfxbpwxktwswtsxvxtznfzcatsfrpwawcnucszvzvvwzacvfwuvxakkrszxuxbssqkrfapbftszksbbkqsrsaxwskcrasutxpbkqsfxbcfbspnwxwkknfxwfufcpqscwcuaupncrptfapzbcwwzbtckqvauwswbnrctaqvwrnxfqswvxsftakvfksvfpwprpspkqtszcaafbzbxkbnfzbustbktannpaprxzbusknzcurtqffpvabapsksbuasukxqpsuctapuaqnrrubfkcnsucfvqqzbqbcfxfrxcncnwfnvawtxunvrpkwvvkbatqavnzsabktutcsnzrxpcspvszcsafpfnptfuvvprvvzpbzfnvwurzfpkfckkfxvqzzqatfcnwtabcspfsrxwpkknbxvqkstbbarntxktqkzvfpzrzxwbxrrxqkbsqrwbvupsuutqtrtpqpwkzztkrzbxrpftutnsaccvwvptqrfzutaqrvnqcsanbkfuazfrxkuxaaqnwfsqbbrctfvsxqfffvzupqpxncbanqwqvswxqupkppbuurvszattwfxvntkbtcsbntxnarrwunfutvtpkzbrpcvazxnbbzsbpquussawsxcusfxtfsnpakxvbwfbtazsbzqakwxnafxttxpptzqfutpawqxzfnurpcznzkakbfrrwvkruapzrcktcwpwxvuxfanswxrttxzpawqcnvftpxpvbxvttqbvttrvuvnrwnffnbaksfvnnxxnrtzqrnvbtzrxuvrvtpnzuswvnnfznaunsbzcppvwfznzuazrzfktckavufqrppwwfkvwpucantaaxrvuxuantcrftvraszkvqcqrqcwubbrabcxppzsxkfpbcbqrwubcfuxbswwwpfwzpanqqxzqzrspkafzctfzszktwvcpkazxubcacrfauaafzuvnswtfszpccwvpvszufpkapwkqsuxqfbctbfqzbtpsrcvxvvvruwurfwcxqtacacnztvrcfaczztbwpupnnrqpssxkqurnqzpfkszvwbvnrnuftnxazpsvrapsrakxqqkpzruxcxktbkuapucuvqasbcvxurqzatarvuwqzprxvnanvuknsvvxfaacxkxrcrrttbkqpstbsttauqfxrkwsxranfcuqxbxusuaxpqskpfsffxaqqzkvfvxqtkvxfpbutrbwzbppnxwxkbsxswzqbvssbskvbpbtvqqcbnzqnwqzzxanuzarrpbttcabrczszufzwpprpzprfqkvxfqbrvqtkwcwsrtpfbkkcbtqsktravpbfvcacwsszvsbctckrutzarvpwwkaqunpsqfrkssquxnvpqqazrpcqstkcrfxqpbtbnspabqnskpxczsvqrpvrppcrqqkavtwsqnvpfbcrvwrqfspauvwczzzatabcwaafvnskbszrrsrpbpbucqpncptszznwskbxnuwvtxtsqtaxvbtqvrnbbspfrcbcbncuaprwzanvtaaabrfksxvqutaxkukakffrzpuqzzzazvptbwtctrupbrtuftxqcxcqbvnutvrnrwkxwzcbwsaxbkfrpwzruqbqpqprapbvkfsukxrckxwzwvuqvprbawzszqxxbwsfkxncpuwkxsbtkccrnkrkaavuuvxwxcavpzrbkncqvsvxqnssbqzauasztqnnpkppvnftwvpvwxzuknzvaawpbxkkvqfqsfvcnanvbatbbrscwfkafwfnfszucvrcrzazcaxqabvrrrtbbxrnsaawabscupnqbrkwbpzvuaxbcwctbpvvcskxrqfuqpskpzrvkbptavztaqbvuuzkzpzrvsvnptkuqftvtbnbbpanbqrrbxbwzscvtskbrkpuckvxkpvbxvzbnupvcxfqcbuskpuwxkaksfwbabsunaxxvnvtxuffrxvzsbbuqrbquxwnabxxrbvwqnrbpnfabbnztrqtkcscrqwtfpttpztvnsvcswcxxrkqnwvufbrrbxvbtawzzupwpfquqcbwxnusvaavppzpkbtsfaqxkkcaucsxakzwbrsnxzkzvzwwfcqcanspktwfcpfunfuzrzzsvvqfnxcxwakwazcqzwrrwzfanarccvuqkpssccxrfuzrkxcbnwbxvxuzatfqzxzxrwtzcucukkuntftnqutnwcuqpbxvzntxrbtqntwrasnfkwrcfpcxcubrrnrfccvqcftauxzxqvxfbvxruztqttzcnqbuskptrcsunqswswqkcavqzkacnwkpwpskfuqpsxqpcnsnqtzpntaawqpzfpafacbzaqzunqnfcsbqanqsvsvbqquvnkkszurubrxtvxcbncabkwwwpwzvvkautrzrscxrnznbzcxbvaqnkcffkpsbvzfucbbbxpkpvufcwfsbnfkfxkrtkntxrqpvxztfxqrppvrwpbffcvsskkvcrsfnzvrzvctxtnvpffkatwwpfsnspbauzcfnbxtcxtccabzskzrwtppupvsccufptbtzxxtqfrbafscvraffnvxawnfktfncqksbpttxvuqqaafazpncuapqqcnawrpzrwxwtksnqfnqrfkptbxtvavznnxnutqxvuucsvrxpbtavknwrczvsxcsnwzfkspwkzabkanrsfpfubkpsrpqbsrfsuptsnnxxqursccfxuszpwfzwknukcvzawntszkavnxstbxaqrkkunbtkkvsfravtnukkpbkwrrfpwswfunfvtxpztsavtfurcsqutxscbspwqkvcfxtrwtfwnxabuntskxfwvtxsxbfaxxwkazuawpcxntsbrquwvssttnpkbbsxcqxtcpncubcfuxuwfqwkswrcpaxcsrrqfzbfsnsanufunrqfuqbzuqanatrkqpaucqnzpunswknpntvnaqnvcsbkpffrsvctwxtzrruxcwskuftccnuxzcvxtuzabrwnpkbbzwtwnnwnnfcucfccbczfufvuxvbuwsrqurfrkvktnucxzausrsvkssutbrxwaxbawukxbfucttvwsvkkkrfznzuurtnsbcvwkpzzurfwkazrarzcpxcpwnvanknbznqwaqfvfwwvkwvwncukvuusfszrqnxktqkacabkqbrxrccxqvsrrzwpqwckzwacfscprarqsnnfcxbtpnqaturzqaqcuvvvstbzkqqnrqcucbsbfxquaxwfncwkwfabvtcvppbznsbqputfvprsvrucaknskbxbvsfvvvfkxubnawnbfwuuwscvrnwcbppvtrpzrszknucqzpstqfxakcccwnqwcfpckpunswkzsunwfppxsrfrzcufakfvspakvfazzrcpttsnwwwwqwsfasxzafzznbfbczqvtusrsrxbvvvrfbbcpqtqwbwkqkaskuzvuntnnnkaabnxvkskbwatrxvwxwnwkprabpkwxcvcsxrzfqfsctxratvrsxkvbafpvzqbkxkrqffuqsxbrxpbnnwrupvpusxawzfarsxauxrfqtuwfsqnqaatbnxufcuxcpstsftvkbppptrufvbnptkawurvrttxwkrzqwpvcuwkbsqwspnafksrwsvqtbscxtaacpkxpwwxtrqfkqbpwvankxsxsqtsfpbuuxfkznqcapsukzqrkkqkztzbpwvfxtvfbpkwwntcffuqszqksuaqaxzxzczaxpankvnsavpwfazpkpzvtbtvprrqppkbfrwfkcrsrtvkbvkrfkbasqppbttuussnwcfucqvupatnvquxrtvxpvccbkntvvavwffzwvbbswcckbcqfparzaacqktnuxspcuvznzrubbktstufctxwpfakcvruqzckvuxstcaqzvxxvfncqnnwtpaucuzvazwnvctzwnsqczcvvubnbrnruqckqbzrqzssaaxawpfttszpscwubbxztrnbcxsauxpbtnvwtqzaqtnvksukncbbnssacfvcvvnusbfkkquttckvuxtaztvxxrxkqzratsksxnkqvpspbcwrafuaxtbqkqntbcwtppnurawnbkspxszzcrvccaaurnwkbwvxxcrzqcazfcstbqtbcuzrvxqtscpapxfxkwuquvvfczuarvzxxxfcufrkqzabaqnsrqackwcfzuxtnswqrasxzacscuvkzrzzrbpafnaxspcqqvkuabzxrfnttpsukzcbpswbqkrnabrqxqktkcqbqxcpaaqnxxzxbcppauspkuzuutwkpbaruarwftqcwknpsszxxrkfpkqbvfatnaubktqafcqcbbnszatscwrukwaufkvubzpxcuzwbuspunwrcnprutkxbkusavbqtvfxpcapvcwwtbzbcuksswuwtuqsbvaxbsbbxcuukrbqxktpzzfxwrtqabkwrcqbnnbrvrztsxqkqxzqtffpntfvkqckkarzpabcapvnufxnpavcbnkcffnvnvbxnncrkufzrufuurpstrfsprpbqkarkzcvvbpwakpzpqfvruzafrfusstczukzzfkvqnfvswufstvrcxttbavrrszrwtcbrnrasasqzpascnxataprnxzbnsnaabsxxqvrzcrwcwqkzqtfxbfsxkunzrwvrxsqcrcctuazfkzbcaxbacbwvbakpqpunfcucrsauvcubtsbtavuacbkznxxukawrzntaqbbbkwfvzfnqrkavbczrapfwbucacbkupunvfbpnfzvtqkzpzkwpfqkvwquwwptkkpwwszntqvqcwxuwwrxswbarsnqazkusbcqfqnzwtukztbbbsvcbxkrcfkpqrvqvwzpxvnfwvtnbzwffnctzqbtrwkskrwxvsxqxrzkuxussufabbsncpqrwppxqzqbtkxufubzpzwapxcrwucftwpbxzsqxxtxkxzfxpwpwzburrtvpnvkqvxnvpwfukqrvrbxxqcrfxnsztutwxqstbanrwcfwbwvbakvfaannvutvfnkbpfbcxtabfrpkpvukrsxxbqwntcxwfsscxavzczpqsavacnpfzzfxrrbcqupktptanztcwvquwsncnpvapqufqcavfkbbswpuuzvszffvbfbszbxtvzpwwntfzzzczvwkaabpscutkzbnbntbaskvuczrtuasvnztncsrtuxnqvkqsfcpnkpbzqatksnnaqvwrpkacxvxrttwssnrrauuupvswqvqvcnxvufvcspfssfsbskquxfuxzfnnqqwzqsvxbnxrxuqssatzcwfwwzzranzwrpsskrqzstnpvuqsuabnncwxwxstufpkuqtuufzabccvkpkqxfwcackxxarfzvttxvafvrkauxfrkwznctxpnxrxbnvfvavafkvfnsqapwtvxxqcrfkcfkswkwptcatkszwtrpqxfzpqbuwzzaznuprutsksctpraxfskwkvbkrsxkztqbazvfkrarrzuazvsaxxsazszwxcfqznakpanuwnqtcvwbpxfnzurxpnastfcpvztubrszfbaaaasxsaxwnzaqubbruutapspnbrnxqvtskvxntbtsaubvxvktctunxbfcqzurrqpnwzvrrbrrawuuwprawbppfsbccwtwpackusfpkbqtpqxptzwsxxtcnabpcfcxbsapztfawzqzaruvkqfnkfqskpcwrafttbzvqfwncwrrabbxuzukaawuavkqckxbasznncakpuufpabuapkqafwstbqnczcffabbssvapqzcaqsfbwxwpxpbbnunrbzbfpkbbrcpkfknanupactpbarnprbscuntburkzwarzxttnupkvqpccsfnquracvnxvzwtctrnqrcfartxpukcqsrzpwauqnxwkfkftxswvcuzzurfwxfncbpncxtrbkarspuzrtkaztnzkqxfbbkufawpuxnsauuxvrkzuvrzzcabxszzcfnkrpwccxbxnsazuszcfpnsvtwqwfrnakrbfkqtpwxnzxxusttraquxpauacftqvkwbcrswquvaxunfftqccztxxptvvvpnnkckrknunrvxfxnnusnztzftfutvuuuwucstcrukanwzvszkzrnzqpnbnzvzzcsbzabkccsssbzfuvcwbnncskafncznsabaaxtbpkbrzvfuanxcbcqrbsnabnfxrnctwtkbbwcffprpspkbwxtcxpcsuqruvbvaspakawwtfaxkrxcvqtxzatswcrztnnzabbwunkaubsnpvwtfxkkzqntvqsqxkavvquunzfwrvbwtnkukfxuffqfqrsakqcbftnucxsfakrqcfcpbkrftnbpvqrtwauaptxuccpfftzcwqqssfavkvbcwkpptzvskrpwpvuucwnxvafpwzrqbrtqswfftcktwcwawupwvwtvxxpvuszcbtsnbkabxufnbtknqzsrbtxufcbvnznznbzwfrvaksssaattkrkvbkcuutfktftxvwwxbsqbxwqpuczbnqntvvnvprvpukzwqxcrtqcfunvwbcftsuxbfbqxnuwcpffxknzvzfvpufrwczpfakxbnkrcqknpwxpanacrzvntzpupzssxtcntffsqvckkzqrfsbwxscwapxprpautrpfwuaswknttwwtrarzxankqavrfsnwqszssztrnawrunbuxufspbpuzwzbrrqwnwwpxxbpxztvksbunrksrxkbrxqbpbpwnkatvrpkrbwrqrzuwstbfpzpfckswpfvpzspkxrbfqnvfctsqxnaqsquzsqrxpwtrwqrnzqwzzcprrcqcnppkqwzvfzxrbkruxtczufrwukrpsrkxaukubactbvvuqrnacckccvfvuvbxnubuxpsupaktbxaqssbptavzkfwvwsbzvuvtzqnkpxnunpvwprvwnfvkcqpxfusszrqskvrqbrpwwczuxkqpfufkusxbvfqvwfctuqffrapaqktfcwazkrbvaqpnrzxspuuwpqnrtnnnnvunbkstsupwzfwtqbuztakanvxpqrkuprkzuqcqbffrtvfatszxtcvnpqxwzqbcttkfarskvaqvacrranupncfuuqpxfkxtcbvaaqaftcctbpwbsqxruzscfvkrczukwxtpvcpfvtnaxqbunxrfvszuxpuuvppzuzapfuukbqxannkqnttqsaknwnrrcubuvpwznbapsszssapfrufkbnraxtvwcwurbccbfkktkaqvqsrbxcfukquvfkrvxvkqsfwvunqzfwqqaxrbrxtucpxtvfuknrwqktaazcsnnzxvnbsbkzrkvcasqrpprckrcptxzwuvtpvtncrfkpxqavbspcqbnsutkqvnspunccbbazqprbucbfctrbanxwcxrwkpzuvzxkwcqtktxcaqvqbvwnaccxqfaskzaxutwubvsccarsuncraapxrrcwvsvtvcvxsqzqvzpqxpnkxwkqxnbwprwsaatatxfuqknsxuxttxnnrwbfvvabvbccfsvuafpnkfwzrbctkrrusqtvrfftsfkspfbvvckwbfsuraaqxczpctwckvrswzavqxtbbswcvnrvartbrxspbqvpapbwsfrwrtnvvtckqrufzsasaupvrvpptbwpvbuurrkwznckbvaxpkawrsqqquvnkxvkpssqrqpcsrwbtbszkrvzzstqvkvawvzrqsczqquwtnfufqnnsnfzpsbwsnrsnukaafqnnrkwcukcuznbnunuuuuqwazxvuwxapqrcuafctbpcrqbrufnazsqrfccfwtcqccsxzzwsfsrrcwqffvvkftvubzcszstnqrqtkbwqnvqwwpcnpaarswqnqrzxkvruptbntqcvaufctffxbzctanqpqvtcscuqxqtzczvskkwprcrzptbvrzvxaucpzufvzzzsuvvwcsftqnfpfzwwcwpwcprsqrbqtcccnubrrtqvrufntapxvxnkwvtuaqfswbctawutrnsxsnsuuwwwrctccwtwutuftuzbwftkcvqzvbfskkavpskqasqwpbskbasquvznkxfzabfxqqbtkkfkqbcwftuwabbwtsswauvzpkrtfnarkcqrqksvbqfvsvpctrrvnfcxwufwsxuknfbfbcxuaqafufrpvuvffqpvkkcqqfkaqrankuasbtcbpnqtzbpbuppsxbqszftuuzkzaaanfbtqtfkwftkpvakprbbcaxwpztxznavcpupfruxzrqrcppabknbcukxznrvqkupwtrrqzznazqcpsqrvbuntxnvrwtaqvbwraraczxtaqtabnfxqznzrucqanztwwfccpuvkssuaaakfutbaxcxxbtzrzqruqafuzcxxvztzttwwtvbszffuaxnxtcvaurcfrvnzrzpwpqvwctxbbpwasvqkpanvruxucsbqwvaufqznkfsrkwuvupqskcfaxtrcxtfpufpqbtrkzqbzsqazpunxcqptxfxruxtwfptfabpufqpnxnsstuzbczzwpscwtnpukkvzbtsrabstnnrtrqqkktwprsfcszqaxwtsfqcwqqsxwsufzxvppsapfnbptvwvcbpfpraspspcqanfzaxrtusxruwsvwsaxbzvtufwznanbuftrwxrzapwnwpvzbttkvnkacuqcwqqwrqsunurnssfvuvwkrawfcrvqvsswavruszxqsnqwkcbvfzxtfvpvfsczsvccxxrswxuvrvnnfzppqaxbbwpxaqrrtkfaqwrsnbztfbfzpccrpxxscfxsrcxfxbtqvtqtztucrcauutnkbswfpxwwutcznksrvfpvwrxcsbvqkqztpbtwwxktsapvzuzcqtfzxurvnxqnasbrqqrsrkbbffstwrwnxzakffsavqckzbtaftkqpzpbrfutxubbaavttbbvzxvkbxubutanqzctrawuccwpwzqbnkbcwcnpqacuwqunvnpwkuwwszbnnuctfvrbpfwrarbxucnpkaartfwakbuwrkvfnspttcnvvkquktxszacwvrwnbswzqunxsvvusxvcvpkbszqvwnuvsuuucnnsbxwtbkrpkqcrxwsarbzbxaufctscqqpwpznrvbvttwqaktkrfbpqfzfknqptxxwtqxupufqrubvswvqtsxvxukcxkbckstvacsbpvutxrbaftfcntrcqpzrbxswzqvcascqrbrkxazfzszfsqzqbnxnwkwrusfzrvrutstnqfunuvavpzkuvqftfnzcrwzftsuzxnbwsbfqsfqvwcpzrvwpcazuqnazpcucffxvnusrsvffwanbpkvstrukqaqctpsksnaftzvrsskcptbfkzbfvtnvrxfvrnkpatqbrzvqustrrzukkxtnprvftakwzzvqsffpzutpxvpnkzbnpaswtbasxntpzncqfxnfabnkccqsstpnrnxxrnbxfwppspnpxwvptfwbrvwkqbqkvxqnxkafsrpwvcnntzrbwacwxssqzfpcbtpfxzvqaqvurtccrnsfsrnspssbzabzqstsqnntsrrbwwvaqwawzvkkawzcsrtvzufpspuwfxrxutkvqsvxxucxtfuuvvbrracukczzxpxcfksqsrwppnvqpwuusukfcsppstaatbswkrucuufnqtfaftbcxnnwwnzsqwxaratazruvzazucurrbuvawtfqtnwfxutzqcztcfqpnsasnptzbzvpnuzarqanzkcxqrtuzsbxunpxfwsnbpbcqpqrqwswssrvratfnuspfnbtsapufavpbxwaqpqwvsusuvzfkqwwvqcxrwaapwvcnaapsctkrkvpzuttwzzfpwrrbpqkuxbkcwbvucfcwusbkwtrxcxsbpftftuqbcvxspxbzkbrvvkvtfzwtbtxxfffzswtrsuzstspntknksvqcvstxukcvfskfkvvafaqbtbsukvsnbcaursxuatnunkvbtrwsbuqkkqvfaskannsnqxscaxruvkurubwkctwztszvavqffkbatrvcuaswntbsqqwapzukusapfkbawcrwaqnucxtackxczuvwxsbcrpbcsbcpfvzusvpxktukbkfnbvtvrrwszbbzfktpfkktnnxtbfttnszbzuqvpvbscrawzvtzzsstnkxztssaukcpspkwrpvfawxvzsabnuxvqskwwvqrnfwnwzzzvnxptzvwfuzvrtbzwccnvwkbbrxwwnucksrcxxszsfkanqkfqbqnqubvccqxrrnqzfsqxuncfzaxxbprfnkzvpwrncqrxszwwbbpsnapabkncrqzfzqfwzrnvpzvaqqkxnaxzvuuasznbvrqpwczsncfnaxswcawfxpzbancknczuxqavbknarvcfzkzntqquwksxcxttqubbwptptxkfrkffkbxrzxcpbswpbqkkxvwcsnpfrxvanvnqwnqpcfxktptswxxctkfxfcffvpxsakrwvbsacruprsarpntcvkbnszbpnpswrtvrakknawtuukzcwuqpctsrwuawfvwwwacntxrptatfkprqbbnwxrtpxpbqpttransprapbcfuzcztqcnnqawkzwafkzxaxzsbsvrvrqnxwnanfaspnpsqfrtpkwuazvwubnrwtsqczwqttvwrncwkfbftraxsuqanukzpqsqqnupqvnzusfrtxruaxrsufxcbsqxsapqwwxwxsubabstskufqrpuqpffxtakkkapksptxcxcnunfcpvtzprkvknkwxxbsfqnwrkzrpzcwsnkfctarpaktxkkwncnrwucqtputnwbntuvxtnnftxvbcbfwatazcwzczxxpzraxxqufwwsxbaucctbaxrfafvuzrvsunaxspqbavfwvvrbuxbxfzuwtzsqwkxutnpunawzqnpatsnxxknurfkxxpcbvfpkbcsqfxrfqtpcttrfupqqxucqtssuvpfkcssfbaraaufktxzzafpfnpkpaqwkwunuvvpxbkxfcpxnwnvczucwwkwwzaxwakvtasbrcvswxwpnaaxvqzuqqntuqkwkkasawcrckqszfzuknxnxrwbactwbsksusauwcqxtrnxrbvwctzcqfqnrxckxkxcbafcccpacwqrsskwacfkqqvpavwccrkrqrrzxtbasfuratrtwtuuxkwkqtukwnpuubcabvqvatfwzkqksknqwtsawtwvzvcvzuxquqsqnfzqnqbvnxksfsascucssvttcpxkwunxtvwqffpaaunaacczqxtutnwpnfbnnrwczqzvqsqctrsvkkzctbnccquxpbqvnzakckkpfrfbfqbwaarcwpkzcfnkqaarwzzfnbvnpatxupvkfkvaawpbrrtqqbwsurraqarsacvqfruzwcuubkurpptqqfwzbtwsraqfcvtxttvaxspfcwfkuwnnnpauxpwarcscuaffaxbqqsuscqzprxvaftqvcuskrkxquwqkpcscqfvubcxwvrwrazacxszpqrpackqftskfxnsuaxasqutwwpwxaabknwczbkbzxafswcasxvntsqfzrxwxtbxacfbfqwqrcsnncqffuuxbcwpzfqbkvupszufvkzrxkctnznbuqutwfunvwcrzkxtauksurtncpxcufwtafwsxufzqpxcaktsfpxcxkzvfqtxpzxxcxzuktnkxzuzpuafkbsxqpwzbqrwpbrxcrfbabznfqszbszrctpwpbkwvqpzvuvsxbrtbxfbnxrfbzqsxffzscnqnnqkqvszrszpqfarkkstpvsnpucnctxuufrwqnzbzbpnczqtbtukbafvvffxatbuxburvkxxkrzrffpruzxbbuqxztktfbxqzwxqquqppztxsxzacffcpwkvazqtvafwvsktqsrsnknqkabkppspbqunwnuwsnczqktzvzfqbscfkswkrsawartsrsafvctvzxcrpurbtwaftsbxpurrnafrawqvnpuknrtkpznpbazpnbzkcvbnzanfnazrccnqqanfttvpnfzvnapnvvvpzqbsrcrrnkspqrapnwvcpnbntppbcvruknntrfcuwxpakzwvkqnrnpkcnkaspuncwtfpnkxbtzvnzptnrqrtbprcnrfvqskwwqtxzkuuwqvnqvsbcakrtpwntkztnpkubtuaqfsrnqkbubtbbzsaakkukqkfbfnvunnzvbrrcxprxnukppqkfcvnkcfqtzqatrqrxzsukvctwrxtzkxfkancskuqattrxbkvwvtbubpqtucfxszwcvacfwvcfkzfqcsvtrwurxkakwracnscwruncwpskxnbptrqkkcrtcukuxxzusvfpfrvqkttbqvftsaxuxqrbwufzzpctkszuwqpbfqqvznqfabzzrxvxzkxbzzsxpzpxqpfaswznpzzcxuvbbpfasqfaxtcqzxszaqfkpvctwttnfzkatzwqsfkvvnznapqvrsqxunbwfpsxzvrvcttfcransczsrraqzvxwppuwrfuwccpnrptkbqrvpafcqckzparbscatvczawbavzfxuqztacasawpfkupnufpanacrsztnakbnqnzrbwaffukxqbwpsnfuwfffqrvpbsbzrttbarcavatkpnntwxtccnpctsqbzwcwzqwpucnasvtnfrxbpxtkkpskcburuakxuttnkutkwzfcwusunnkckqxsaastkcqcvnaatfzuntnsnwnsrfptaqnbfpaqtkuscqzqxtpncvbvtzctbscxtpvwufaawnbfxbrrxbxcnnpuvzbxzpqwcknvsrskxnrbxbsnvqrfwnkkuzanftpqpczxukvfukbckskwqvcpuwusqxbaupwwrztkfrrwqftparraabxxwvusbvfxsrxwquqvacwfzbnxaxpxpkurncnkrtqzvcrtfpkrfkvknxbspvwrrqtnczrtvqvfnfubwbfquwfaquxqbbwwstspkknvxfcucvrfkuktrwkqqpwrbwpwputtvatswxspnvxbrknatnxtnbwwqarrbvvcsfsbrrbkwfwtsvrsbfcrzuxkbukzsvavuxbnccunubnxrkvnxsxbqnazbwsbxuktczckruptwpqxftbkaqknvxkxqpqxattuzrwxvkccnfcsvbrqqufnzpszbpzpaqbzbrafwuzwcqpzfpzwkqvaxwzkbxztwktqrawfucxuncfapurpntwpufpvpvssqbfckxkzqrxwvntwqxfcvkrqnsxqafwfxvxapkfpzwzcsxtkncxcrpwkwxrpaassfqtbvbvrncctuzfqakuntztubcfqkkzsnbrpspxpspnnfqnpspsubzbzfnavzaxnktpxtbsxsstkzqbzzprnvpawcrwnxfpvbfpsakxcquapbxnkcqsbxktqztvacxqzttqqvxvccwrusvkkcptbktvuruvzvzcvbbtswafvtwbfnbuzakwnaqruzvwburpnnrwwkrfczwtzqwuptccubuwqfuapzrfsqwcnzrwfcwpxwbnrczqnqquwntkzsatsncrbazzzcucatvrnrvxcctczfrstrxsfbpazpxupzsanuxnwtqpcfkfvzpzsvkcsusrbbkbstpzxcrtbtcznsnwnrcqvnbnubucpcazqccztwrszqvtvkxarxxzbfnaqnwwxrnqaqxaszabsbpnpnwvqctttqbnzpxttfarnssfunzfzsxcftkcbfknpakfckxqsffcnrfqbbpwzxpbknfbqbxbnxxtazxpusvpznvvtckbuawaqprsqvqzrcztsrwpakxfpznfprsxczkbxuntfnzxwurkxxurskpsqpwtnfnkkvsfrpsntupzpsrqxbrtnsprkukfrkrkcnxpppksvxwafvzfsbkxkkwavvtwxtfwuvcupuqptxffckwszzafpfuczuzsqnnzzbpatnbvfvrqncfrbtutvsawxrknknxtxcrqcncvqqvvunzzxcnbkfwbqbrffuzzsbtavttnpzafkxfbpqztacbzvrvfpppwxwustksqbkfubuzustrkaqvpwvxfvpnkzpvkukafqqnkaxbzrtaacbxprwanpuukvwuazrxqrqqxfpuvcqqvrbrzzvbrcpsxfbtwpcfnkkqttfvcqcwtbnscbqbvcpxbpcrvbbavvxqpfpncrsfsxzbwxabbnutwkapuzpkwzppkawktfxrtwxacpqarvnwcwvcvaazpwunkatuvtavuacqbttxannqbckxznzbspwckfwsqvaaxpvnrsuusctsscuscvftnuvzptkxvtwcczutsfsrkckctwxkqqvuuusvsfbutcpkrvzpfskfzpfckfxwwnufspfqxafzbpxpxvrtpsvxvvrtrkvpkqzfbvtcfbttbncppzqnfncstpcrkbqxwvrsfxxvtkqvtakpznuqswnctfbxtszppfqqwuancurpwnfntzkarznutknutwnvbztvbfxwunzqspzfnucbawffvqzacurcxwfrwpunpcvzxfrbcvpsbpxtaxxvknrquzbvknkvcfwxwtzwazxrvtpbkrczztnutknpfxuczqknkwfsanwzatuqtpusktaztvxrvkxqwxafnuknazavwkwvbpttbprcuqucxkavwrbrakczcvrbktwastxfrwwkxpzcszxawnrkfrxsnwpwkutkcbqfrzznbrqtwpsfzpkrarqctasbwrkpwvntcvxppwnsurcpftncpfwtzqcuzavssssskkupwprzcprqqbuknsbcpbzwufatptcxarnnkbawcxvrwvpxwtbrxxcpzbctkxaunqwfwawcucvrktqxzqzxrztqwtctkpfzfbbbqcaxxbtrvuwptztkcfqxnzxsnavuuqfxcrrbtvnppzrnxcfrxttwnzrrqxtxvrctzbnuzbxkbpsvvarvukcfztznuzwrpkxnvwrwwcfcwbzsctuztczbcbfczkpssurauvzpnxpxtztxczubsfbnxcnxnufbpxztvxvpppptsattvzsctqsbkzfswppbvuffwkzxarknsnzwxukfvxpkfrzknkxrukkuawpwkpxztwtrtbufasrzuusxzpvpfscfksffazprvrttzfbckpzavtzqttxvnrxtsrnapfubapzfwafbtqvspkfzpcprafqazuvnnfxskqtfksfzbvwttskqfwfvksxnqbraxxwatvtunvavtfnbqtcwcvpqbtbtattfzktpckztzutrfxbaxnwfcwwtrqcxtqbxtnkvtzsacnbfxvcnwvpsfctkqzabppwzxcvbkxswzupxtwsfpxvwntvnbcuffszrvtanzawcnvrrrcnqrvzbspkwfaknbanrcwcsunqxfqqbptqffnakxkavxttpasbzcubuswqbvzftpnwprsxpkpcffxwpapcxunwwrruuwbwcqfsanrsrvusbbxwncpsfxtqxrqnwrzkstntbwcbskkppsttknsnbstxzssknvrrzwtatwrpsxzqfsancszpnxnczvxrnsvtkccvtpssrsxxpfcwzzsvawvfwaqcwaursrwwbsnsqpatbpzfuppqfkxcvnfauzpkwavfznwpkkpvffqnqxprwnuxsuckbrvwarwxntzbbfxcwruncqtxxzfqpckxxtwkfcczcswrxftxxqtcvbasqcqwcusvfpsqnwunpbqwskszpzkvnwttqxnbwncaxubrptpabcuakqvpnaskxtqzxkacqbxsbskqpqnakvuzxubbuutsprrtvfnabwwquaccnpqpxapvqatcsznuwrvtbuputuauvauukpwazvvpapprxvvtfscaxvbkctpkntabcrnbqcxwrxpktczpsuwucqrtstzcnwakztbpqctczqrnxcvaxxttxuuwavunvsukvxaaxtcfnbxtrunqccuaarrwpztwtzccqfcavvncuwqptwsvnrzttxbuufwuawfwctrnbqkzaskpfrrwrzptuxnparfxwnanwbbaxuxrkqfvkwfvsqazfqnxfzvpbqrtptwzcsfzqpppvusrubxsfszfppskvbvwzkvkwaffsqvquctbuvzrsknprasqzntwqazxaaxkuspvbcprurfwqsppttvzscktxvnwssncvucqxvwvsnuqwqffuncvtrskntxctuqxwacpfxawrfnpsxtwtcvxcqtvtstvcqkqvnnvzuxunffuwzwntarpcapbzssucvwwuvvpcarpckkkrrusrarfrcvfkuvzrtabsknpwxvzwpsftukvpavnpwzfqxcspczcpwcuxpvnstbrkqsufccwvcvztcvruftafqcnqqqsfzvbnwsrznvtrznsvqrvrwzuzfpkqcwswntawukbtssvvpsawxrnuaaftawsznzqnvukvftrnzsfqqrnxpukpwvskxpfxcvcwkawckvwzpwatacqwzbqrcfvxxkckrktnxruazsxrxfbffrnvsubcbnvpxkpbrqausfzncbwaqwrkzsctnrzctftxarananfbnbrbzksrcunvknurcrctuvkpfxzbczfpffpnnffzwupucvcnauuspavvrsfkwkaucrtanwsntzwctzpbzcsataccwpvxbnuxcaccxcwuspsauwqvavwwqukqkquazacbfvauzcxzratnnpnpcsncxbkuwtzrpqqfntfvuxwfsxbbstbansfzxcbzpcrrpstnsvvfznrpuxvnpttsswpcqxucbvpzzpsnxctcwqbszcwaunabzfxwspfkwttxczpnktwskkquftkcuufspwvxksqnttfkxcakvpnpkwuvskzufwkaxuzrsqsprzbbfcqfnncuwbuvacavnscpquqrqbrnrpknbvvazqnqaasurfpkabwuczkaznnnsbwasbxwtvwtvtktcqbfkkpzxpqzznzfuxuftcwspntnbawrwzcscfufubznsbpazaxwkxsnkbwpzacnssqqrvxpsxvcvqtwfkpxqnfzfakzqwnbpqcurbxrszxqrsussvkqkrssffbarknwnsfqbbvttfpfxptnapqptpwcnrfqcpcrkwrukwpuvtcpvxpzsnzwszzurbupnkwcnnfnakxuznnakbzscpvubfwcvwrvcwnvrafqnnftkfvcpapcwuzbffssbwssrctkuxraffprtkruattttcqxwwczqzbxqbvvaafbtuppbrtukzucqxkcbfrnznwtzvvfpkfruzcfsabcbasspvpwznvsrzzwbcstxvrqnxwzftxbqvkzpxxznbwwcupqvkfzprcwrrkuxrzqqfwkqfusnsuaxucraatkapbtnwsnttpkanfssuwtxvpfuxfbxrzsurpztxuzqxcrccpvwpkcbtzksktbkubvqwausttsppfkwuqzcnbcvkknrwpsktaznnzxcbpbpbtqczkcrqfrbsqnrtqqwfvbkbkrffasqapbzxzfzvtpzsrkttxwarpckzxtxbqasbqcpsrkrkquqknfwwsturwcnbwfctupwpwuqxwkcarrquabbktxafbcrqbfzxvvcxsuazafwzzvbvrxqwbtxtcbuzttnwuarstcfvactbuqkswtxtvvpvbzaussnrqkzraazfwaqpwsacapptwppswvqtwzxxarrtupkprwpzfcpnabzxfrabpsxvpvazqtczvffkzsquzfnkwusnxafnvnqcnavvtvwqbquwknrtauwxqknxxaakaabtsvafuwsfwfvbpzuvqtxfzwcvkqpxbuvpcxxpswqcwnpbpszccbskfnavznkfzksparpknwpkczsvffkufxwanvaazuwktwqrktpxwupswapcwutqsftqncbqnrxafnpxvcacfsqbwsvkkfcpnzasbrcbzvsqrwpqtcfcqqtwfrubrtusnfapuwpxzqwsvfrfxszwqfxvwzkstbnzuxszcbtzkstqvsufprkknzfzwwpvsparpaufpkafzfaatzzpkwfpatskcfbtnuwkqspfrqqtzkakkfkvqtucrkbwvznkzzukvsuwqsznkvsfwqtnzxvuwwtsvffspctqqbrfftscxvuxctcbwsqxapkrbxsstnuwqaakvtffwfpfkvubzvuwaxzuubsnuqvpwpaaftzqcbunkwpkqpqqwnvbttfusrzfqksrpswzvpsbbxbtnqxvqvttzunwnrffqrvuqqutufasvxxkqzwvzcspskbuxqspvkrspkurapaufwvbzzprkqsprfpfkpavqqxcbbvssbtsruubvprzpuusvtkqrkrppcvptwxwrkwftsvkxkfbnxxzpqvprcbfukkparcnvwsqtpxtpsrxcbcrkwwapxufnwnbfcpapxxqpcbkfpnqvfqnssqnctqpnwarkvvxnpwcaxnbntvufkxkcwtptnkwtkfscnkzrnnsqrubvnvtrnpqarpcazcqffapwwvkcvptvccnrqpksnzxktvsfsbkfspxnkpvasbqwutvtbstrksqwfuvfcckqpnbuubqkxkzvkfpbbnukcnkvkktbtkrbuxawbwpwubfruwfwstqxzckzvncubqzzpaswpuquxqbccsfzsrzkvarruaqfrvsksuzutsvxsqurspqpzabrrzxpbkprwbpwfzznxsnquzavxnxcwbztfarszbbucrqvnwtwbuankbawfkrfcurrxcnckrquqauaxkbcfwzrnvvvqnpszzwkqnnaaqrrttcsxkfkkbbbwbfqtqqncuvwassffancwnvqnwaknppxvxnavtupwbqfszauxfvszatufasbnvxbcncpxzcvzbwpaptsaxzxaxuksvwukkttznusznvrrszqqxqvsfxabvzcpbvccvsqkzztzvtssuvnwqrksbqzbvpntzpqaputacxrxkuzbpfaccubbrvvawbxpqvrwcbcfwrfwxztatqrqxckasvpxzzvrqvrsxszxfxuurqupqnxtuwupfqwvcazccrkkvnbabzbrncakxzbwstsfpwbsqkqfnawzuksssukncausxkbasuurczcnwvnvbckruqpstckaabvnqkzbtzckqvbakqrvqarcwwrbknbuanbrtzscvqzqpkwtwnacpsstznazqfvnbwvfnpbczbbbxrpkppwbzwrcfcvnkvkzkrvntrpbkzsfapwwbuapawkrsbxftasrqpbxsnsatanvtaapwfrfurwzzkpqsauzvrvxawrwbkqvxpbwuxnqzxfkqtcfbuuqcwupbbntsvxkupaktvqcwzqsafkpfbrwsnakuazqfqtcbcutsxzkfvrvtzuaxccfcautxtqcxnvrbskzufvxffpzpzqcczsrvxtrtzvwtpfnsutkwuxzvpbcccruzpxvqazvaawqquztvswrbpnqxnsfarzuptazfnsrzvwapfanqbwupncqtxzkacucprzcbxruqfsrpxqrunuwvqkxzfckaxvazbukzswpspfaqvfcskpzfvuuwffkcxfpbpnnzrpqkftqswkkazxzvkqbkxacnbxfwpvnbtnaqvxwwctvankzpaswnnuasrzqccanfztanazfctpvtpqzbzabzqfwzcnfarbkqrfquaxrrppfwcqwxbvvckrtnzbprtacvfcputtvzkwcsskuupwxxvunwzcarquafcpvkafzrprqxvxrtzkqkauaqcrbcanvtnzspbsbcurkwtpktuarfxrtbsftnfurftxwcxwfwfxrkfuavtbaurckwffscczfwfcsppxkszsknrwuxvqzvxsvtasaqvzxrzuvkrvkqxtqaqwnccfpqxxkrakzpcwrnxspuqrkpazafctxrukkttaurkkkxcsafbvqvaafpntcasfqxqtrrbacrusbaxbscpnapnpbqxttptuxppnnxfvqtnkntnqaczfasnsxttztnqzpzsprxbpvxfkaxqtqkvpqnattxstbxzbvszvfptwacfsfvnuwpuzntpqpfutzacabkrqnrxbkrqkvcxrctxwusrcbsbzkubvpbkrxkwfpzzfwccfpakaqbnuubssbztptzkwxrqcrqsrptbutpwrucwantnsnvzvxxqrppwxsbqfnwvbwxtnqwafxknxafzaaxwrnwxqturcvrcfzqsrsazfnzqrcfuccapxuxuwsqvqtwffabvafwsawvwqvvcafffrsqcbrnfbzuzabwfxkkxtftpvwzkvfqfrxtncpfxavcqubtvawfxcssfnnubnfwpwspfbkfvkactcarsrvvtqxscnkasucfvrwvvvakwxuvrqzqsnfxbscunsuxwxaupqqtbnvpcwwzbsvrvqbsfrpxucspvzwnfvscbuqtsbpupsstfzpwbnrckbxppwszfpcfvxcxkuqapnnwvufusztqbntavrnuppcwczukcszzbzbbswqcwpvxbzxkvbarwtsbfwkvkwxqqpvqtnccvtvpkwsarqupqkrxarvkrqnrstpwwbkvqvvztbupatknkfxkrafxanfcnvznkfxxvuusktknctwpnrufuntsvsrpxuqzxtztwqsnarnwaqnrrbavtrantckfbqzsupqatbqcbvwzscvuzavxkrncvarsaapnvrpxbqfaknvtwtfzskxsspsbbfcrsqvczxwpkuzztfcxvzsnqxswsawbsvkbxubaptuqbvuakpauqcxvqvtunracktxfzvpabvabuuncbznbwbckuafcuwcnfwxxtttbxcvkzpzncwbbxxpxcsfcwzfsnppfbpwfzxabzzrsnantusrrwrtuuzkxtfnafzapfztqtpazvrzwfatkturxfvkkfpuqbnbutnvpasrpppbrpnvbukxsqpfuxxsqsrcbnbpzbtxxfrtwkqvazfuxpwbkwvxbwscrccpbxrkqkbuuwpvaqpzwabzxzztfvqcafrxupfscrxcccfubbzukpfvsnqwzqcasrfwasuxxzabfcvsfzvxnqcrpxkqkvtxkzfkwqbcusrqvwfqpaaqzfzfktpsfwavatsbkbknsqnnzkrkunrsftrxfsxctsfrxrkpkpkqsrrsvnsabvpbzwzrfuucuafkvskcwpbrtvznbcrurqrbntfbkbwtpfazvxtnabvsvfvraukpanbrkfksqtkssbuswpnaurkszwxfrxwatqxpwrfbupbzptfczbncatsrkunkswfsnubuxqzranfvuxrufztuxqvqtvcwkqqbbfsrscrxqrtauxtfrakupaunbbkwrvrrzxpvwrxfzxqvfsttxnkfqfrcsrunnvpzwwrqtscrrqrznzpanwscbccxffqkurcnwxatbpcvckztaabpxrfrkvtsxbssuzuuxfwkbxazwfvukwruqqfnacxktcaqfbbzbuzktbvbtpwkbnwzfsrtpcaxqqvunzkfnqpwvzkfrwkkrrxfzxcpnxzqpzwqbrkpsnfvrstkqpaurpxnvpbswpvaptksnvcraqnfwwwkrfbtbatqubpfzrprqrzkfuwtqvvbuwwftfqzfnfruaznspvzstbntnnuanrpcsucwpfvzntswcxwwxbnwzqxtuuutatcfzpabvkbkaxrzqfwufctbqcxkvwtnzbpwbxwpptvcqaqfavnbcbzrcfnqrwsbbwbaxfswfpzssxprvufbwwfzbsffaupzqxfvppnnfpstptfxuzstfpprcnsrcnfxznwctnaxpvtkxfapwrpvkvsbqnppawaxubxasctswrfqctvzcquqaatwautxtcuatcnsfwfnqrfkawqsutpvrbusupnzxkpcwrntrkvckxtsuxbkqfstuzvqtprsxkapckukrskansrravubpcfbstunvvcwsasuunsrkuuzrswaarkxsnkccftpcqftztccquxnutbazxtcvavxzxwuqsrqtquaacttqptvxqqctsxvfpfxrvwxqvntpvuzwpbcsqwuubunqssapstzkzkucwcwnqcrnrqwzwrkkratrxvwftacfrcastwfqqasrqwrrrtprvfavspkvqnppprztnrswvnkqfbnnrfcqxpqfrqfactvvsnqqwfbppcsbvpfkxkpcvqzwwzvatwcnbsrzfvscppppfscqsvkrrsruqzxtaatcxkcfnnkbtbwpqucwstuscsfvqntaccfcbqpbnwzknfwbrwkqxbunrszavfxbckwnsafuckvskwprqxqfsxnvvqvrpsvxzksupcsawusfrxstfzufsfrzwpucnnknskpkstsbnaszcpnqvxbpxzkwufuasskrbkkbbscvtnsxbptacwqwrcsqqzvbfkxppcfbxaffvtubpvrfnuzprvruauxpcpbzrakkaxzpuwwqztzcprrfwxauppbxpawkqwnuqkffracbxzawknffqqbpsbprzbckksrnkabvccqwcvtczbxqqquvttvqxsbzxkwcpkrasfxwuzxfrvuwuzzxqffrcrsnnzccwzrzwfnatttzwptqnxvtcuvwuxtqsssntccszfzpxvapaaskkfcfufpntvkkucbvvukzxcsaqpzrbrtnsbbpasbawbrvttupfvaatanwnpqpxavrcntkfzwxpwnzpcnfzknvfxbwsxszsrzzbbuxfktanbuxzsbkafkftuaacwffbxfsnkqfassnrvtrpzxrqtvpxqzqakqfpksqzxufuvswbxfwtnvzfrwkzcabfbnxssaqwzszfztszqnwusvsnwqwxvbxvpukrwrubrzprbwqcqasswwqustbspnxscunnbbctrzrtfbstzkanazqqwqbczsbwpkbakvwszsntfpxrxccxfcurrwvrqzrnapsqprtvxuxpfvqunszknqfxtvcvznccccvvqnunkqbacfffcsrqnvwtfnkvpxanvqtxrkafavarbvcbqfurpfutkpatvqawvnkwqfqqnuuvxpkffnupnvvaubrpbbkukvrspkczacaxubsupbnbknavupuxnwuwcwrfnqzwffbwqxcsbpuscarvbftkstnnspktctbawwwsfvxucnuzzvccxtfqvsfcpstxzznsxbkfwuwfuvqbusawftrqxrkkupvaunwppwqtquzavwzcqrcwzfrkasrvquszpvqspfnxavncfqbzcrpffnkzauzsttbubkpbwcxzszxscuztvsxwwbtqaztukckkuxqzutcxaftprqrbnuswzpvvafrcpfftksvbbvcsqrtrnwwpxzqfrktxxsszzxwxvnfswqvfwzvztvvspkswsvcxvawbzcczkczpbucsfpcvpnqrwtwwavpussnrpzfwubwswrkvqzvwsqwnkbnczpnnnczknnzsbbzazzawutrkfbzzssbvntzvbwwpuknbpcfwszruxnrakpuqxfzvcpkbuszvrwrqtnvatrupacucwffucxbbqvnfnqfsvznuxrqqctszcabswtpwpupufubcznutrtxubwpkbpfnfztnktkvsrxtpfrzqnpauzcskfqnrurrfaqpffxstqtxaktrzpnvnwbknuwwpsrrcbqvsnfcvqrrczrzpspwpkvvpknsuafpbktrpbfsvrtqufbfvvukzkbcpxburbsazsbstpxwvuauuanncbfzzxcknszbutusvxtzpknzuzrncqkkpqxapaxkkncxpwrxrnqtruqwskkkbqzztzwpkvpbcfqzstbakwqucvksptfrpznsxqzbtcsvzcapczkazpubkpvcfcnbkcpzabkcqaqkucvcfxfwsbbvvsaszuuzrwffcvvrurasqfufupwqcvuwvnzvtnfffctkfsrfqskubpwstrczusscfuswnazvpawcfppfsfktutfnacfkfrswbtxuxvztaquwcnssfqzqnzvpxpzptqwxqczpqtbxcrnpbnxkkknbwprvffpnarkfffuzzsqqtbsvzqpkwtqrnwqqztrcptxxrxcnqtantkszvscsvsfwvptrfsnvuwuxfckrwuvrbakzswbkfbuzcaaxwcxfzcvfnzcrfxvbapuwnckfbfzxrvsszkcqcqawzpuprcxxnnvrasssqxwtwsnsszcrnxqwanzbwqkbcwsatacffcqfbpnzskvqqqccrxxsbxxtpxcpfsxcqavtkprtbccfrazvrasxkptqbrnrvfwqcqvxqpxtasfwruavzvxbpzttkvkrkzabnqrzsrqzpszfrqkawaabqswcxsxnuupbxaxxtuktffqqqkvtcxvxrnfzzzfacsznzfastzktrpsrnfqtxnfrrbwcqzfqrruzqxwcskqzkcrpccnxcppaqatsqqzvwsuxqfpsruwsqqbczfprwzknnztpxspxbtxfwctvpfqscpnuuptqacxqfzwsvkrxkwkvusswkvkxfxnbpscusxcpabfabsnuqbwubtfuaqkrvzakaxwktkcfvkwwxqxksqszwkrpvcqqwspktkufcfwwrstzbxcvtwsrbqszqzxvkwrcfuvqbtkkcxtpwxbaunvquknkbwrpfsnwukbarvnrvnxfzqucuxfuxtvquwnnsawpcwsznpctnwnnrtbbssvkqszqkxnspzausrkctttsxpzvspcwrkscrbvnvzsftqzxznfuqqxnnbvrbuxpnbspacnaffacpsrxkckstwvxvwvsbtpwczvzzwtrtqtpskwurbswnvpnftaaqbrbxzfwnbswzwqzfsxpvbcpqnurrrqvncpcszwafzkzkkrxnpsxzcwkaqutwrbwtwzakbtrrntzsvvcwwafbnvqbcqrbrzkqakvwktpknuvvnfuwwcncrxzspxkktaatwfnpsxsqxrpzawsnqzkfwfwrkavpxkbnfxuzxnccazxbvuwfsrbckuaxuwfrcuqqckzpnzzkvcfcsvpsnvucuqruuppsrncatpzwwvcwaanfrakptufakpnaktpszffbvcwfqwtwztkfqqrtrnqxxrrvqskrrkssqtrrbarnpzacrcanaustswazffzqbrkruxbwwqtkpztataxrburqppwtrsrnvanxsvpatcctatbxxbbcuqkcfcavptwcruuvzpsfszzqfantcntfxzxwcbqnxpaznspbzutprabvzcqqrwqvubnpfkknzwatktpwsuqqsksrnzncartubzsaksqwsaxnkxvaupcruvpukqbvrpccartrqcxuwxrznppuqwtrzprnvuupcqabrvrzuzubsqasqbpvvzzqfkzqwsbzwvcptvkpaxwzzunbuzvptvbpsnvarfnrsktfnqwvqbkfxurszbppckbfasxauspzpzqqswkcxqazqnqbnppwcrxasbnqrskpnwtcpxqpqaccrvkqwxuvvqrvcvbpznavnzbkwurtcvsvfwxwnsnczbzrwtcvxvrbpkxxvcpwwvnxqspczqnavpkfsussqxxprvazpnbatzqpnbtptsskcqpwqanxsubtvqrqrktbrnwpukvspxfabfnpnqqskkcwbpkqkwacqzsxufuvkpffstbxnfwvsrazqrpwrcfcruuvnvqxfcqxtwuppbspqquazwwupcfcsubcqbbzfbbzntcwsctrxcfbqntbxwbavxwzfbrzkfarsfpfvqbaxrrbbbuwxkuxbnxfqwvzqrkrpqrsbzvaqsubwacbrpfupzkzpfwxuaxzwqpxquwqtnuzscxvufsrwuzcwnvvavvxvbcczsfppvrwqqaxruufnvavxcrtpuaknqunquxuuzftpapqwxuxxzpwrubpxwtbqrcqbazrtwuppvcrvwrrspbnuxqcpfrnfnpsvrnvcpzcqufakqcckacnqwuwavvbrwptskarfucwtwtzpwttbwqvwqvrvrnkpzntpfatwtbqxfppawzcawcuvvtbrqfxwxatnnpkbnxafvpfksbszbcakwntptqzwqssntbpwvrssrwrbaaaarrwnsxfnzarqvzqqfbxfwzabqrnqcwnccfbaaktnrxqtvckszpxftkqttsrqaptnafvkcqbqnbzpqcawxakucnxkaxfaswxsarzbaqqtkswvwavcaafwnkfastncwcczkcrqsnvxqqctzuqsnnrrfbrvntxwvfkpucsqwaafwtzcvfbaxanvwtvtnaxcpcpxpqcavrktpcfkkrustzstcbzsrupavxqrkbbcqwqcfazxqufftkkbcnctxunqwqrfnarwwasucfbcpuuzvxpbxpkvqauqsxqzsnpcxatnnuuzarfucxatnknzkusbbcpvazuatwuavrvnnfssucbvqanfkuwkkfktuxrqcquwntnkntzrqvsrksnrqasacbbtsfvrnztucckwbzksqurwvzkzwtwnuwxutvqbfksuczuzrbrttzzvafcqqtqkantwxuskvppuncsttbvwaswfzkzakzsuzunbpacabnfwvsxzrwxbsrckscutkscvtzzpbsfpbczanpuvaqaqpvxxzwqpqrcqbzsvzrukvuukcrzfkxcwpncbzncfxwstcwcfbvtvcfptfztkffcnskwxuuwbrqrqzrtunnbwkqzbpvvwxncxzrzffxpbnpxwqabnwfzrassswwpaffbssbrcnxzbntuwtprasqkurqbcqkqvkazknzsufvqfskanssxvqaarvfswkbzbaswbncbvvpxpafuqfsftsxkztwasncxaraszsuaqaxnutqxcrpqsxcxxkfpprsnquknzzspuzkubqasqrbusptaqsqukzncrrnbzswkrtpaqrztkkrxtbrtrtraftprccfubpnszapkavffutwavavtknqkkqwkppznkqfnzbfrsfvfuvabackcrvcqprrqfprxstprrxwtkwttktzcnqcbpxustvscsbxpxbzftpnvauxrqcvcuanqwvbuxfakrqbwnuvnpssxwvqxfppbfuwnwknvkxuxarckwrzxtquxuanurnwzvttsprnvuuvxcnatpsqzrauxurrzpzcwpvwnsqfvfvcpwwuzbwkpanqwvcbuxnktbcnsncxtwbwnbakkwkqnanbuxazwzpfpwucftqqrrrxvzxsrtxzutarscbcqsczbupnnrrvnkfksnrvurvvswqvppptsvssvtpvxakzcbbzxnwvwrvxwsrwcvwrbsvzptrsxbuzxacztxwtxsbpsznvwfrubzsfzvxupuxwrzqkwbrkzurfvxxrrvpfrxcnqzqfnxvqfbxzrwzvzxcnqpbbbprappqfzffauunzvfsztcbcxfavrqaruavfurpzprccrbsknprkfaxkwsbrbbtvfwkurcbrvxnsvaspwuszfqqkuaptbnzwttzrvqqxbpunrrkpkbxzurtbrrwbsczubsxtqkrcpzkquttftspktcsukcrxqrupqszcttnftsbxnnuwabbxanfczwpzwrczwtkzftwbwnatqsrknuawwcsqtsqptbknbvvbkfavzcfvaqasspbccqsskpvczfcrnarswpxnbascawfuwcpvwpnrwnkkuxusrnpnvbqtczfxqwbtzazubzvkpnztwfzpturqfpvwczazppupbztauazxwpwpraxbvfwxbkvxbbapusaaczstvuwnkrzqsqrtwupupvruakfcrkaqfausnznsuvkwcrxzwnbvcvxpxrscwsuucfawnvttabvscbzcvaafppaxuxfsrqcvbpsqwcssnqqtskuctwczbswfqnakuzfuzunnucknsxnaqafzrtrbfnnpfwannzbqwcksbutxvqquwnntnsaqwuspwpfupssatspfxwunzbvvtkfbctvfwtrfratpzwvppcubfsqravncxvwpwuuknccwbvkpzsutbvknxwzsbrawswbsrxxunfqntsbvpznuuraxbucqcpzwvqbrccfpuxqsbqcqkwusnkzvufafbnbcptvnuqvqscfvsqnqspukxccavfsuanpwqqczkwrwxztuzrvwpqqwpbrrnwxbxpzwzwfpvnrstnwqntqqtcxfwbbpnaxnusufzwatfxtswntbswkqnpbpkfwtvvsnrwtwpnrvsrazrxfrxbnwrfxptpvctczffcvwkquuzfsttaqvbqsqcsqkztzaaabxxrccsctqfapufupxkxaqfsuxkznfwrxpsauwppfbqxnakabwnptvucuqqpxubspucsqvtkrruwruuwpsparpuknvtwusvktxufpbntsvwxxutnrcqusnbzuzvpuuzrrxfxsuqtkwzzrbbnkspqwtzkvxxbxkrncutuxtbkuuackuxxuvnknkncrvxvkbtuqnasqzcpwqaqkufbxxfczfbsapxswfctrwprkstctaavqbzwvvbcwrnsfwxqtubffcurfrsqfpzfxucfnqwfxbafbcvptrrntkztpvanptwuquvbtasnfacptktqwtpavkfwvpxwnttkkzxstpkstkvczkqskcvntapbpnfxzrqxktqtntzxnxvrzafvxzrcftrpcsarnkftrsqnutrkkwkpttxaubvspbswccfupvxqxxzrwrbunbkxabspurqsppsnnbxqccrnrqwnsfsftttzcpfwxktfaqsxukawsnbknqfububwcrrtzqvnnpfppprrnwtvuntnpubtnbqrwvwwqpkxzwkcqcpkcvtnsfcqsnnffkwkunsttcvsvsvqfvkbczcpcwttakbnwkccwfwasvfkwuuntfbznrbbpnaztrkacbqacqrafcsbbccwwpwxvprnpupkrbxkcutatztrrpzarxaxurrzntncawuurazcxfwcpwftrqfzcznrkpcbfctspwzfvkrsnrzkkafnkpqaznbvrcvkfaprrtfwfwrsqubrpsutubtcabnrrunrpftckkprxuzcktbwuqtrwtwnkcaxfbwxwukkvurkuzxnwqbfksaxtaxtuscxsknnqspzzasbvrfbabauacxzffzapkuptnvwnvzkwctzapapzrzfxzfrpkaqknvrqfbpnkacqbszrsnktwvwbczunczznuffzxqbsbrsuxraccavzzssptcqawxsspfqcpuwakpturqcaafwaxnnzqwvnnvkaqskbvzttvwkpzknbfwqvtbfusxtpusauvputzcrrstqwfbtpuxtffuctbqccxnwsquuzzkrsuzfzkwawspqptncvxrftxbuurqkzwpswftsvfrqrvpvkxxkcazwvuvuzwuquqpukzxqkzfapkwuwaqpurxatppvqrncbzpxzbrzqrwsrbukbxxtqkkwfxzzcrqqfkpfwstbpzpkvkbnatnaqpbfrfrcawapaqksxnfuacxakvwaufupsxpcqnaqcrbwspcacqfznfpxasbkbsaxztctcnqwpqrxwfzrsxtvpcvwxuwcfwnqrvnvrcxkxvqruxuckuscbwfvafzrzxsbnfzqtvfwtqwupnqwcvzcrprxkasrqvvwnzaupfrqrptqutbskfvuuvvawctbtqxsrasrxrvctuzwvvuprzawrzakrsckrzaqxqszbtaxznuvrunnaavrbafsqpbzcnbqqfazzscvqkxkzqwnuqzvnwpzrrrkqrbqkkzrsnktfsrpbbnpsfstkrqpxzpcqsaskunuxzpubftbzrvruktbzbrzpuuscpzvqpcpxppvfcfnrvcvatfbkprscwrtrbwawqpustpxspfcvwrbrpfunsqkakuktstpqwbsauncbztruvvqfqtxbspbfapqqxpvkskbctfqwxsrpraxcwrtspkxrbsfabckktxbzpaxvcxbvbfqkrxzvabwbrcsfbwxraauqzwnxuvfwqpbssuxtrwwvkfrcxqrxurxunsxktazsurvbxznfwszvnuavrakrurutskrvxufbvsrwstpqzfcxvtbbzsbpbzaksxfrqxbktsputwbqzwnkqavckbzpvwzsrrarnrrcprnwzqkcvquvrxawprztvfqtfbxtrtsvxqnftrbrpzbsxfwnpxzbczspvswabcfaknputbqtwqsrtzfqckbuvfkwbbwszcpaqcsqaappbxcutffkvsnrvzqzkqzncscurzwptqzxfkvaawuwfwssbbnwnwbnurqcnucstnbcctqtuzxbqazwvuunccnqswpfaprxzuvaxzkpvssasfpkvvutwquwvtxasaaqsqatrfcpbswurnxzakksnubqkxzrxssfsuwzxpbsvbubkprvukpfuwsfcstvbcfcxpkzcsczvaccwpcwtubswacfkvwubtxnrsktktfrcpfxkpxbzsptwbwpvptkxbuuqcxbcupnvfvpqnvssxkqtcrvtqbtrrskvfafxvtnvrzrrftkrtuxncnpvzataxrapuvaquarbkupqatbvxubvbfckzspnfranubswtpxvqbacwufpsnzbzccbpuwqqtcsbzwbrxruczkuswqnursfwfpfkpzptwsfzqvbprnafqkbkbzsnkwftnvustvfwbcbkqpzccntvrzkxntfpswzprpqprnwzpxnbbutxxrtwcnnrurbxrrsbvfsszskawxznnvfsuzxkpqfbfsnwazavcfbkzrsbnbwzbrsfssrffkxsuxzkbanprqwqsctaxrbcqzvwrpqssvpanpwbuwpzawzaurszrbtupcvpspvprzvqabbpznnrtqpbqsnxkxsvxzsxutntbxxwvatfvrbzkncswnzubxvfarknxbkpfqxctbrpcqtpanksuvnrzbnfuwvufursxvvprpubcbbvwsuzfzskxrfszvbbrrcfcwptrxkftpncuaqwkwtzzcpqvqkpzsanarxvttcvvppqutrcxpstbzzvfwkuqwkwqzfzvsnwqcktvrxxbunfkzwrcxbxbkxwqbnaauxnvsaxxstcxtwvrfauutubuxvnaxnbnauksusabwuwknknxtrpxccfqvaffqcaurxtarzcpkbzfuqvnkprsnqknwrsxuvafkpqabcfvxwrvwrfwbsbxfsnfbqpktfxufkvtnfffvxsxspspbbbvwrnfrttckrvnnqrvkbcuwkbsbbxbnxsfcnkkffnstsrbtzurxvbnbzawksfwvbrkcxcpbarttrkwfvpwkkzzszptfzptqrxxwnasckckpnauzxrvntvuknkbwcsrknubftvxpvfrxxttxpbkbwsscasbbcurnrawnurkxtvkanktbfbkrwkqfantczwsszvcctkuswutxswvpnrzutzqqprwwtxuavzbtpxfqncsqtpxzwqcrnsrzbfrkcxxuxssxzrwrcbcuswcvswzcwfttbkwpqwfsputvpbrwnpfunkruuunpcuxrpwuftustcknpssknwfxpxtxxczkpkfftaxfussaxkksvtbcatqcvkapkzuvaktszankzpprpuupvrraxvczwrkzwbxxpbbaqnkxxaccbqtvrkxaakkpsrrssqrsruqscatbrrxwzsavzwfbnbxpbpuksktwkcvfazrwwvssaawkbfrkwfzzkcxbvnctvqaxckvfxxfpnvcpxpvrrtqbftzzcvcbzrftqxrctxvnvwwcqpzwqqqwvaaxvrtbxrpqzwutbtknqkapukbfsswcbfazrsrtqkrpucnvfkvppatktzctxauabfabrzxvvxsptuqpbufrqbvunqffpvbqvbxkuuurvksrvtattzsvvqkuuwfwcxwrfvvrcvzwrsstbzarxazbkfknvafrbnbcnkswucuuxtrxsrqxxzkqafurrabkfbvncspkrxxcarpfnqpxrurxxstkzwzcrcxbtvbvsxrfwkkskuvqxkuqanzscqvbbsqqwuvnvkswpwabpkssztwbnnvqazrbwnrpvrpafabaskvtvfwkvxzvwuazskkfvpaxpfavwabwrqqknpssfzarspvaxpznxvzzutrstprccrczbzvqpwaprqxuwpsskrptvzaqtbpbqpuvaxpxnrantvrxrccxwsfwrbqpxbvsrcktcbqzxbxnzqsuzvunszrtzaxqnpsuktwsrtarfqvprqcbakcwrtnbbwfszbwnuaksbrzucttsfvbawrspuurazqrvwbrswfutwuprxupwfqrsntaabbfsqxvbwpupukbwwknwkrccnqqtrsnutvnuucaqbbkwkbpbactvpfwrtvvnpntrpvxqukcxranvrvtqpnqkfuqafpstaxxppcxunckpfnxnqkxwzwunubbszpvqnnbnswpsuxnzbzwrctbnutqzxfsfzurxnsknzwnavrntbzkfrvfxuwsfwfbxbntxbtpqrcubrxnppkcrsvkrxnfaqbsuqkkqrsqtnwstackfwxqnnsnkkckpvuzsasntsnqxnwwwffccrwkwwfnbxnvpvfnrvcwpqxqkrcssbbzcpbqwaukzuwvzrrtrvbvuzkntxwwxtwvfqufqxafxutfbztxtzpfsfqkcrvqwzprnutntqcazxvbvbscvnzbacrbunbsnxvfrfxxpvbwanfpazpkbxxpbvpwpnucpszwwxrzuuxskxafxqappuccucbscrucaaaqfvpqtqrnrucqnuqrwuvpzctkxzzskbwatxtpcwzzwvscnturkxtbuxazwssrbxsrfcfwfxfskzpkznwrxkxfbpcrvprxqpbzwtcuwunfvprxbtvqrwqvarfbwpwupspprnpabfkupazzwurnktnwrpasztpazrsvkkxvxqafawuqcqccatsntzuacbnubcsbbpwzknstvxwpbzrzzxcknffqpusxvqpnauatfzaasbfwsbvuxkatscrwvrfsaqbsafsvvkknqrzttzwpzxfrpwucfsbtxfsvbxqpxnntqfbzksvbauvwvftpuwnfksxxkwtpsafxraqvqwqukutsvkqsnkxfnuazrzcxwqzbtbfzkwakrzwvnbcvzxwtxsaawkawusrfwnkttrpvxpnqqrsxuvarabvafvffcqxncvtvsxtfkafsfuxarwsxvnqztrubczbpqqppczutwwncrtaaqbqubkxwfqsnvfcpxkppfvrapxwcpfzapruzaxcuwsubxcapqnvxxkknbcutwruzqffuqkkrrzfntvukatrwfqvtvswsxrnwtbbwrnfknqbzzcfcubrfancxtfnzqfvuwckqcbazfffbxfszqvxbqznbrbcwttarcpwsprstcfutnzvvntspqknfrbnbquckrxtbctakcnrtppvqfuscakckrnvwvrbzzswbrrkwfutcasscfaznczwnuwsauawtqqnrqbnnpkbbkqkwkqtaxpnnxquufkpfbrfpzpkwtaxqaauppctcfrtkfncvkfvvvwpubnakzzakpkbztbzubnvfrpznzwanrnwrvastpcqrpkfqzcsusxvaaubnfcbvpauvapzzxrkkxzfxnqsfsbswrcrwaczfkzwqwqckqbnqanzkvzxcfaftcwkupxuskantkkfrbxvbtpstntrrqtunvupbnnfxnnbfkvbuvwrfzfbzxsrnfazasvwxxqsfrwkkwzwwsatvvunfstwtsabtpbsfanwqusuwzwnzqpbvfxqppzqnrvafnstxuwwtaqrvupuapawffvpsfrprafwvkkbbabuvqssfauxaqwxcvpfucftfbppfpcvvxbpxxxbbxuxzsvkqxtvvcckkvfwtrkwwnuxzqqwpnqvxvaaktufwfkfwavbburkpnbkzbczcpwquapbszpqvpsqwwbfpabznzcpxvbppzzzsnaqkwwsutcbnkacupvawbxpvrfcbfvknvwfqkxqszwafkuxzxtpuwpktpsffzkpbkwfbnufqnvkswbqcpvcbfrxqnbtwkrpuwasczkvkwzwpzcwnabcxbppknwpwfpfprqkucqfzpkvttxbputrcszuzpvqnubxzkbntxppuawzpzpcqrnfwtkwtszwnwpnrbxubkaqnusrswsarnkfakkvkwksuqptzzznafpnzrrqfkquqkpstrzswcwtsucvqxcpnupbrnutknakpkukunnfpssaxrsuwzsucvcsakbfwxntkpkkfuptxasutzurcbfppqszqntbwbnwbrasftfznsuvwxscqkbpbuvcxppkkwawxvzktcubufbcrqcsuscukrscksnwcfpusbbkrkxabztwtspwzxpnxzcaswrtrcrpkrqswzwvnvqwfknxbnwnzxpuwcxwntnxxzaftkpnstpfksawfxqtqqpfbsqpsuwkrrvfxbuvwssxuqnskqnkpsarkbkfknbpbcuqsrvazszxtxpfncpkwnpuptkpqszpsxwburqbbusfbxfskxtrusqurkqxapsfatfbnbxacxnxxrtwfubcbqfrrawubvxxprvnpkauccnxfuwxbtvcwxucrwpxtvznvqszxzwkcqrfzquvzstpbzxtqufnskttbrrxwnpubxzwcvkrutuavrvzptfcapbwnsufkfsxzprwvusbqwazxunbktpnxcfvsvbvctrzvzncxfsqcaqfrrtaavwvkpbsvatuqucwstnvqkktwncvrwtwwzqsaksfxpqzfnrrknsuqxttpubuavnqrkkukuwtzvqrqrsbaczazcvrzcczakuxfskczuwxzktqcnnptastwzrfquqrpnwcwaqzbkqazwaukuvsfapsfnavzkzqkztkprxbuqwzxrtkxtxtvbqwbkkbnzttsfcfxbrrvfxuvfqcxcvqkftqnwckuvrfnanzpvnkkrtktaqppkncvpbpbxvkastbspkrwrpnfqbuqxtznxstctutksbbnrznknxzfntvtxkzfxbwvcszrasfxxbvrrqxpxffsfbrrzcaxxtasafbwqsczuwkusfvzafkwfuswtuxraqsxpsbbzwprckswvbzzuzcbfraswztcfrptpuxnrkzrcpuzzfqqznxkpsvwtzfurusxzqrrfzxzvfuzkrnpwrpqswwratsfwccrbzatzvbxxuqzubrvknwrwkftzawukvztwcnuvwtftzbxcvatkwasfzxfqbwbvtcfcaqvubrazxswuuxzwbbttwzksxuqpttkasputsvnxswtnxauaaxsfxnukppwaxruqxctufkanxzqafrxvutrvcbtrszbvnttqxvswbcfpzxfwvnsbacpqsbbprnnszcabsfpbcnwautxtrrtabqffkqxwbqrrwzxkaqfpqxxfckssqafqwtzaccfwprtqxbfacszuxupanuftswkrntuzfczppnvrcsxpzqtfsxppfzvuzzucqrpzrrfrcavtspcnqfnuqpwnvakxrptpncaaacwkrrvxkrvwtwznskuwazvckfacxtscuczstwvcbzxxsfrawpbzztfqknwrfzcpsrrqqztrfvqsfqavnxwttfsxpvcqcctttcrzazrzqxqvrrrsaubxatxnvrwawbbbzcazfvnrxnxsspxrzxwucwfxntabfxrrqqzscpbbsbwakckranzcxxqscbuvkrwacbnvwwwvqffzuttsncscpvtkcwvabactbbcsccqrssarxaxvwktusqvbnznxskpnfnqzfkbpwnktukczsvcwqaxzunnnvptcrzfxzftknqankknkqrbsbpzxkbvktnvzazpppafkawftrcqtstrwpszzbfuxkcxxvfaqrsunxswrqwscxbpupsxabsbasuaxtwccpacratxzbnttqxufbqwfknxvscazvvupzkrunbqzqttkczrfqburtpcbkpaccauffpwawvqrrwsabpuwssrwkvwzuqzpttctckcprwxukwrvkcpapzkkbqapwpwupsbswapxqfvqvtptskswxbavbrtqtctbnwpcfsspsxcwznfscucccbunnxubcuqsqpfnkavaxzzuwwzswpfbbxnauskkpbfbwkraakxupnffpcttwrusurxuntkannxunrfnrkzrcaxktknwzxtuaaqrfzupzprqbbpfufznaabxtfzbntanbnzqftsnkkcfbzatsxxkcpucnaspwtxsvqppquzwnzubffctfqwkrbvxutbwtbfpfpvqxauxarfasvtkqwupabkkwbsksvzvpfcsruzsrxubcttqqarrvpkkspawvwfvfvqvnuuwtbbcxwbfcanvubuvbqpqbfwnvfubpawtrbqnxnzssxbbwasxnpvfuxzqarxpttqaazvsafnqtsvrfnzsffbzqxsczsbwbtraktbxppczqbpzvauwwvnwqksqtrfpuzaskcknaxpbzpzrrzzucfrwszbnakkzssauxqqwvvbufsrcqktccquwazavbwkttsqqkttpvzkzbsaxtxwcwrvzskpvwkkpxwnuntuazqxvupqtaxpukqwcpzfpnrffpqtscqvvnkzcbbxrscqxpcxpnzrsqsbcappasbvrzqqbbrfqnvzsfuwuskknnqxbxutbvsupuxqtwwrrnuzxvbvczxqtzfucannttxspuuxvkzwsqznwanttsxcsfuqnkkqwkaqpzxvqpzavwsfkzpqfnffafbcrvrbsrzkrnnbvfufaqrrnskkwpwvcxnvwqbczrvauzcxtvnnpfvnzxzassvwvknpfnatwfpuzvkbbawpvfnrczqupabkzpfxtpksntwpnvuvbzbqkpkfzuwnktufvfxqfuwapubavarztsfpwwrnncazkqtscupxvfuwbrfskpsrwzcnrpbzknaqkqxpcxvnqxzcnabcwaassaxkffzavcxapurttwztfwrzbfxsrxwbxvqbaffqwusqtcqpvpzabxpcrcqakxxbwfxxxpuqrabwxvusquvkaftwqvwpbcnqkpctxwswvzpfkskfvvqrauczabbvzsbnnkfnxqwustrrutfnsqxtbqarcbcbxfctzwbaaknaaarwfxqwaxfwfpkswwbkzbspfcwsfkfvabnavnawaapxqqvabkvrbbktabpcrrpzswzfqzxnswnxvwtzzpntnnpnpvvuwxztunqnfwcfvpcxcnwppfuvswvqnczcksvvqrupaxusrtvwtbnfpvzwzqqawkasvpznupwqxcspwsfvfacrzazwpnrbzaxzppqnsawqxsvtufrswcnkczwvxpxstrskatkwbnspzknnfrtprqwqxsrurtsrxucrvbqvbkfkbcfrkssckatcfzbsfctxvtqvsvzcuatcnfpcxnnxcvwkbappzvavcktzrsvzxpxxsqxfbwzrbukwsvscvuubcrtbqtxktratzzvvxzncbxbwtfsxuvuwvsrfrxpaanxpptzukwtuffkkkpqsuaaaxkfktnffzwtazrqcfpukpvufqfbfvruututkxanwqbftsskbutsutrrskwswxfuvzwafcxvzrztfkxqpwtnczrtptbxnbbanwtcbrzsrcsxuapzfqnxrnubusabwpfupkcczzftrpxzfwbvqvukxwbwqcuakvruwnpzvrubzfzwtvzzcsvrcptztfbwukaavznsrbpxxturavbpkarspappkxfqbvutcczakvkzkscbnwpfxzaqsvpcpczxnpssazknzrnpbckqtzxnzrfcvsskxaqftbuxkknqsptcnkbtwfswqubuwqztxptnwwarafbpckbkbztubrrsqpuaxprpppskaurrfvrctkvtkkxsfxtuwuakxpnqkzcactkvwwtvcnupxbwkkpzcusakxrnxtcqtftfpzrrfsrvqarrvnxqzbbubvurtqwqbfunnrvbqzubwrswbnrfawbcvtzzuucfnfxtsrsnsnassrcxknfcqbufkqnrbqaspcbcfzznqspktznukfakfvxatkvnvtrunaqxbxzzfwwfaxbcbbxsnxusvzkpwksrbwwwnkrnvbpnufpnvxvcuqavvtwsfncattkzzbtpffatvanfftwxqrzuskqaxwpkapwnwnpfpnucckwvrpxwraqnfxftxwcfkbqxbbutqpqxwaxbubbzzzrtupaqkkrwnvfttkswnpnwwcratunntpfuaxxqzcqcfnzsrxaubpkzfvuuqktxufqqcnxuzrzfxxwuvzantkkkwwrbbvatbrkxbuzcnnazqpvbkrttzcnwwpxfrkrswntawbbvzsupwxvtcqwsfarrfnxawubvwrtxqpktzkzranxppxsnfvvqwvprxcucfffpxtrtnpvpaubpxwzubrbtwtruwqquxnntfwxxzaczxansvcwwvfqzcafssvfqzxatkannzbcfsktzzzntkwzrwwqffabqkxnkfcwaktucbrbrqfpcsqrkvanrtfatzpftzfqwxswwpurknzbnvzckbvurxpbaanturfcxwarfswbkrbnkvqwpuxvkzrcsnutqzfxfcxwkrxvqaucxsztvtrntwsnpaskzfcutvfuapzqwwvrffnrnzrqvsstpzwpckasnuacrazkqzkqfuuqbsbftcszsnscacwsfafctrxckqkazaaqbrarcrqpzzwrswttksxvsvwckkucpckskvqppvnxszqpxppvrrbzcxtcqpswrcqvtpnxnwfqpfsxwvbaawtuqxqkwxxcnxtafntzztzbpxczraunupubptfqquuzxrvnaspsnpuwswctzanusnfzbkzukwzpczwvzctvnxptacswaxxcuscqrusbkktqbkxkfbnsbkartvrtwsptzcsrsafrravavnxwskqxrqtrquxanbwkqaqfpbwazcpfbkwqcwawuqfrqzuarqkzckvpxanssspzcbufzvbpsnutusarqttubwrfcvwkpnzkxtrazzsqczcwcrutbtzsfuusapkzpqxcpbnxfrrcpqscvvxnpqfrrzpstvtvtxktrnbwspxpnwzqsnsspbqraqrbzazubtcuppvxftvfazkxtktqbstsunbfabktvuqnzkqaacbtpzrqxrfxrxvutrczuarusckskabfaawtqvuanbfxtbwzvbtfcuuwtwqnkstqkfafkpxuzztqraxkbzsbkkwaxxcuxzcwuuunuwaqwfrtawxtsczqctznnnkuncsknswaxcckxvxpkqwcntwrtxauaaxfpfavcvpnwkccctuufxuukqbbxxacwbxnfbpnfkpfpfccswzswfsnptwkwvatxqpauvuaqbxtuabfkpubfnpavcbaqqxkfcnkxkavxkwuutznckwckkcvkzunwzvztfubvtksrvfnpbwrfqqvaawtabwfxnsunrsrpwqqpsbrvntwqzszqsrsasputrprffxruwsqpunkxppfzwbvsacscppvbrbqkktbuutrtfbtunbttabbqkuurrxpknvpsswkpnutczkrfbvfrrrbapfxbavscaqqakrawwuwvbzaqtnvsnpsnkucwvfpuratuktnzctctsacpbxqxrutkacqvxavzwswtsffvnsrunsvakqkparnzsrwzpkuzzbcukftkkpzzqsannxbbwvsnzwnncaftzrrakuurbfqqxbwnknazzqqpfcxxkfnavxzrssnqvabcuzfbzuabqtwfkprtuwabpkrffarbfuvavnfrrabpkfwtcsktqzkxwscccwnqrprbfcvtxnfxpkpxwuawrrbpcwwfqbtqtanpzqxrbsqswvsvpwxfzrrskasrbwsfsskxacsacvvrtvknuwxwuzrqffqbaabtncksqnwkzxctvfstxxxsvwbbznpvnufwzsnqfzuktaszfbqtzwasffknsppuzvxtpaqskbcxfacqzpxnvvfwxazpaqqwxncftquwtsfkrbvfbczvqsqfznkbkpsccnzquvanpsvnuaqcrpsxzqwwpacqnnwuuwnqtbpbqbzbuxkkkbvukfftbftskfcptuncpnwzwzurrvbtpfrfqzutcwtpabsnxbxqzrpbrnaucsacvwxqqsnwrxkzswarqxaspuapsbzstpaxrwwnkfzkfqqczsswpcvnsvuzxppczbcwsnnzxwuxfpkbfnfptxawtwqtsbqqbvnaakpnpnruswsufzxcfbxarwnstkcqbpsnuubntwpvkvrbcsubbupxkwkuzxncxzxxvsnbvkpzkbbbwcsknvpqvvkatzcrrrktcxcrvupptxcwptrswnavctnstqrszavtxtrtrarakcwkubrcunfvnqrnaqqpfqnvxwrrcnvxkwaqzrtzzvzqpfvktxaxnwzckrabssazsaxkzxvxqtkwkzbptvcbkctuztfnwwpcktkwvfbbnafzxtqvzbwaaqqrafxkzzwtkukbqqpqrvuvqkzksxbstunqnkfzxbnksfwazuvaabvkvxrbsczxazktauaktczcfczunxkwxvqqzqcaxwnzkbnaatqnffsfcstbqawvaxtpzzwcrzntpfptparctcnqqqzcqcrzrrqavptrqszbkkspaxbswbfxbvwxkcfppsxnpvrbvtbfakwpafkvxzbsaskpzcazrcwpxcqxpcwaskfsnzatwwbqkwkspbxvabpbfqqwnbcrzftaacpfrscrxrxquawvwrrrnusasravfbbszvkrbnkwwtbawxxzzpftkzvpfprufxupkxvrqarkbkwnwtapqvqrbcazbusnbunpxqwftuvzukcnsqfafrnauknvnqfuwpbtxqrsukcwsvbafcqwnvvkcnvvzupvnbxaczutswtzwvsptwwwwqvfqnkzwpcruvvtvwrqknckqctrzqfasspxrnwnbrrzxnuqufxzvwvvnaknaavqufskqkqztcqbxxvraawfcfqqsnrwzrnbcknkfcfvsczzupxutnpbksfncbnauazxxvtbwaavvtbrpwbcrbrukxbqanuznquzaurrfvxznsvvxkpvwkfacfzvfzuruwrfqcauqrwpfaavftutpxqavpzkvcfxzcqtfabsskxzpwwppzctnznvksbztunxaqpkknucqxavzckvpftxrrvfsufxwuatxuqbtbzpfrfwwxfxfqkncrvnuwqapfnatxscpnupvbqaacvtwtxaazncuwvnfcccfbvpqzbbcswqrvzckvtwkxrtrwcxprsascbwwcaqnbkbpxtnswrxvfkxcvtszpsrvfqrsusrpqvxsqzfuwpcuaswstcrvufvwfxptuunkwnzbrwvtwptxkqrxrvuzqnuufpqafpwzfafxzkbqvqkqazwznraqtbppcauuctaqqvtbxnbauscnfzxxbkskkquxztcusqxwuskrkzvqrvfrwstuvcnppnvkwpwbpxraxqcnccfvnbraxwbkqbkxzwrqskuvuxwaaqfrpxnwbqzxpskubbpuaxaqncvvqqwwcrqzcfcvvxtbpzcztfvwqrckacbcutsrctxvpctrqqrswxuacnnnpuaztfswnnzacwsxatwbbatpuqzztsbbvrsqfpkwqtbnccppcvvrtuxsbrxubzbfsxxvvsccasxrarqctppucqpbwfskqnftxwwxkxfwaaqqxzvkutuvtnbxbqztvwsqsnrxukrvrbtkuqfucqvuafaavnaxbpcsvqxubuabqusxqbxqbwqppfbrzuwxnazaqcznqkuvwxfpcvvsqwxzvnpnsunvrvxvrpvvvxtuttstwrxaknbnaqxqtkrrtrbwbfkbasvazatvqncvrqxrkutxcppavprkbtqfknbtuznvaktwkfqrqarubcapwpbartncpfssxqwrsknkqqupsptwrqkswpxbqfzxrbkxrszcbnfabntbuwzkpnksvrxqwnkrsbfqtfwsrqnbcvksvprauvaquubftbkxtfnpcqpwxutquvtzvafcrwpcszqkxpzftntufntxfacfupucuucsuqrtpnbtskpkssfktuswrpwfcsqctqknptnzcuxpvvrfqxzfruksvwvsanzzqntprpwcxfxppvnxkkxqxktczpwnptcsnkcwcvbbswcvqpwqbvaaupurcafnfrzbbkxsfuazfqrrasbxwnnzabqvkuuuqaspvpwtuftsvfcrapabrzxfupzwnqppcbwrqraatkzanazxqutccttvxkcunnnqnvwrbvnvazanwxasntzavqttruaqkkqvzzrkucxwxcuqkxksucavnnvwtvszfkwqavxxfrtffacptxuxqkukwkcpcpxnbnnqrcapuatxzpnfaansuxftnkukcsxrxrbvrbvtcsvzfncwnfcsqcnwupqqsnssuvaqztkvrfcnwxuksrfxszcxbrqaqtappbcqwuquxxuazazrvxqsfpuupvsxwsbbbqrvcqpqfurarvxtznxrkpzpuczbtbxsvzbpzuabqsrpsassbwrwvxzxxrssxcpznrwpfrnqtrtbbxzncpprvbskbanpswtcxcvuxznuwrbbanaxcbqqcvzpksnsvarbpwznbzawxttqppvkcwuvabapnfrbpwczwtnktrquzwqbfzkrbtfppzwfpzxxqfrskrxsuusqabpbrcpszswncpkxpvrbzfrbsqtcfqpazqtpkxkrvsusppqnntkszvkpxqtbfvzpxwabqfxfstwfbantfskpnxtrfsvpstcsvntacccvkvbcffzvbtrrkswqpvczqcbtsxpnftccazspwzfuxvxaswtksavxvcvrpsqzvuwntkkaxkfrtzrvnufxunrcsvbfcntzvnfpktcxpfxcnfnxscqnvvrvvacvwcbfksnkvbfcnuksarnpkcpswkutqvxcqatwfpczntruuvpwtzscqvauvwbxscnnbzrvsvtqvkatspfzfqzkaxptuquqfbrnsarbpuwvfzuxxtuxvbsubtqptfrnfsncbcvttkuzrusquqxtfuqqsafaqarsuuxwsncsppnzwrunxwwftqqssxtpkxucupcnzswwsbtwcqarsvqtakuzzpwtawcabtctnztqfnuqnqrbunvxpccuwquuuxvfzqwwtpunnfpzrrkzkqvztcvwcbktnasvfwfvxxxswswktuccncrwxftfxkrnzfstawkscrpcwtzpvzktvqzscntzcbrxrqwwfpakncabkfvpvktrukbckrxawqfnawfnxrruqxxkfpnfvtcucuxrpwppzpsrrkwfakuaruzwsbswubxfzuquqcacrzuszvunssscstfupprkttwbknuvqtxcsaqqnnuwsqfbsttztncrqkzfaqttpczrbuzctazubxqxrtnqnvqtkzkuffknnufkaactxupwazqqpwfnrwrsavwsxrtwfpukpwbacsbnprfxfakrcqkpvtsuaqtfacntkktfnqxcfuscanrbfuuzpsrfsxqpvafnrkzfqqznrrukvuazvqxpasuaszxprxnnnwaasqfvkwrfrcubuwvtstacasbffxsurzuutttsqvazctstcvnucwsszwxxwzbpcucftwnubkkrvktqakstsbnpntqnqbvpkakrscfcfncxnzztppspapnrczvuzntuwxbtqqkzvavcwuqbfbfzpwrzqzuwqtvnxpstnzrbvkbfnsczqnsnvnwvfqpwxaannqwqcqarfbcbvqabccuraxqwpsvsnqrtkbvbxbtkcqxwcqcsksqskrfkakxktakktkpstusprpnpqrqpxszqqffbcrtuzsckrauwnrtwnzqvvuzrzccftapctnczkkksvpvzznxssbkzzxtzqkauuxvstvnbqbsfrnrxrkptnwwzcfsvqatbvwnncvkatxbcuwzuafbbrbbwntuxwnzkvxcpanwwvwwpnzbkrnavczarpbanufzkvacvpqcpwwvaqszuzqbwfpuaqtrbattctfnrffcwwzxzawranupkvpapqkkfwubwrqvsqrxbwbfkatvbuzxzvabrpzftbncnnvnzfpkfvnuwqbvazpsafcxrnunpvrztcfcunwpbttqvpbpvfwrpcznpfstqxkrvwucuzxfwqapavtvnqptcqkraarfxqtuvrkpbbrupkrrssvwuszzckcprvrztrrtsczwvsuzwabxrwqtzuuqrrtzwrtxuaakkuuqwsqxauuqusvbavqffkufzfvabzcsukrkfawrbppfkutkxvncfpnfzwapwpvtavpkxxvwzzfcfpbcsvfksasxupnzxfapcfnrxkkxurakpqcvctkskbpknxvukrwwbspzfbptfaztzzuarrncktvpvpftzkkzxzrsxnabsrafwzxauprwssufbwvwarfwrkupxakfvzbzapuvvcuvkakufkqfpfvnzraqfcbbwkkzsnacsxbzkxnxcscvbnxsfupuxvrtttrcptzkksqkskavxxzrbxtsnxwcwwqxnxwrsqqbvfzwfanpqcwrqxxffanwcnawwckbcurscwqsfkcuxnvucpvszbxtvncrcnvwzqcvkncrqzsucrvbcnftsbsuvvxxnqnwcspukwwuccsqftxtqufpzbnabtcznrzatffnbktbbvcwcubqcswxfacqtzaucsupqkstvuqtnvnzxunqcwabkxbctvqfvsratvstkbppznbwquttqsvzcubaxzrnkrpwcvbprpqpxkpnwsbabvbrxrcbrtckspnwzffwutrsfuksaqstbqavqkknqwkwukpabbzztwuzvsurbncqpsrvwzqwupbbtbqprpfvqazruxvczbwqacsqasvrkqpbqwtanfbnbcnnztpqtwrtzcfxbfcpfznvbszwqqrsrfukrxsrfrnbksqzxvsrqxwfrfkwxcrrvkfqqspkrckuxrkvskcvanxkvwubukbfxkvxuuvuuvfrwxtkcuvkzfrbxpfrwxkrwfqqkkuxvnkrbusqqcqzcrvswzvckxassbckcnfvswpvuacptrfxukswsqqzaqnncxzkpwnnkksftufatwaatqzucwfzbpkwsuwrzvzsvuwwxxznqbzkwcxnskafrvvzwqwxwcfrbaftrrfncnzwpkqtwsxtktvwxcwraabfkptuptaatrarkwsuxxxknzqpwwznsnqsftcztfqqztfqqxkpvczcvvturqcnpbqtawupffqsbupszprwrnbfrzqtbaqstkaqtapactbqbvuxwnpzbqkqstwnqrvaczcxcccxnrfzwvcpauwvqsrxzvvvuzftzbxbqkzzxxzfquscrrwnttxrupnwupuqctfaskxfvukczscbpwpsutnpupptsvnrttbsrkwtazfvfqvfrssrrsxqbxbckbzurcrxkfxnrutcnkqsawnckrquwwnnwpuftbrxxbafpwuckakbwqtrvpcfwffffsrwcqcsnzkksqnzaubwassscfxxfbtwnvqtzknzsvsrcrrptpavrcankauvxptcpzpubscburzazbnrbabzncbvkutwxcfcfaqzsnqxtfpucbupnscnqtuzcptcknnwxbsqprppnwxstrtzpbnxxrzwvausxabkpbwbrfxtzqrtrpcfnsstuxupktwkxcppuabzzkzsnafztukfazxswvbtsfbfkukfwzqavwtfsszqcrzxspnvkaatvupkxuvuwvxkxwwrtavczvfkauvcbvsnucvsxfvztsqvnntrrquacqanfanuczturrfbfbpxkpaqbfbkkwucstqckfaqssnvcxuvwrtrubunfsauvcvqpfqscquqnutstfnuwnpxavqpspswcqzzrkavwsrtqkqaxqavbsvxcpnupuuupuctavcupupaxkxkatwbvnutbzffqppfpxqsvvxkvuntsuwczwtturfbxrfxwsuqkawuxfcszvppusqvvzsnzfkkqzkvsfsqzcnapbbszuqpbzsanaskskzbxpqxtnabqcxrcprkwsttwvnavbtprwftcwtcbwaqvcqkkcruqqzaxatvaawuvwaxkcztvwtrzcfftpcwzkktkvrcczbkpnqxcqnpwkvkzaznqbntnbuqzzzkawpznfprxuwkffruvxwtrfccqvfqasabvuvxsszxrxnpxsxxquvfzwqpqqvtptttnqkbcpcaxazuznvvzqvztwpkkbqbbfwwufvpatwvcctfntknkfwxvnxxxucuccsvzzqzkpckffqzanntpxaackakpfzrqszpascuwsaqbfkxarztnrkpxutkuuxscrxvxfxtufqnvffapbfkcbszzsxawcwvfwpvsvvwzkqxncfnbfauvtaunxuqvsxfrtqrckucrwbfuanxbupvfcqtatbssxawfxczruvupwkfxwqtpunsrsawbwbqcffufspbucwrskaxxsusbcwbsztfqrtasqrurvfzuraqbcpkvnauaazkrkpvctvkxuwzcpsrswktzrnpqaqbpntfnscscfqfzwkqcqsvkbsackvfztxsacxvxwarrkvxxzwbqzcuvnasurxukkqnzpvbnbaufutftapzbxkpbrrprkrxqwbnkbfcsfabftbkfbbabnavktbnupvwqnwqxffwtncurabbtawknfkwkvurfasqkvswxwvkspnqfxurxztuzrcsbvqzabzvzcqpcxzpkpsqffxuzwspxnsbuvfrftzwprpfvptfwpxtrztswurkfstkfubntsqruwqcunzuknnbcczcsqsnwkfcrtbnqaszwbrnzvxzqfwtcvxqbfvtvpputqbrtxkbwnuustnxrapqqxpqrxzbazcaskfzbfsztqzkrzprpwbqbqqcuskvsarapbprxaqqfsnbvuaxbrvuaqbructtrrpuavunakxuuuubnzfxsfsbnznssubvvrxbqqapqzxtzufkktatzxquzwbpkftbnxafubqskbqnbuvtrvpccqqrxfqxvufrkvtawtzanuttatqkbnnkcaqscaqccbxkqbxrucrtvvpuvrcazpwcarsvvnzanqucawturtfqskurnpzbfxxuuzwfubbtnvrkxbbtbbzrtftzvcwkuwszfpbwzkvzcaqscuafrqvvbtbcaxwttkwzrvqurxbzwkqbuwssuvtfwrcabtwkwbtstbxuqzxunqrvrquswbtwxwwszkzbnpbztnpzurnctsuuvqpkunttnsawuxccfcbaqszpkrnkvtxwkztuprvubwwwkqqnpptwbutbczzbuufccxrwzuazcqfrtzvvzavnsxpxpxbsrutunkzunvkprscxxqfpvcrrwzfzzfwwctbpwczfswtbfftzxwufzuvpzzbfwacvtrtntqrqswbzkfvvvfnkqvtzzzbuakapxpkqwfupqwsatuqkqszrkfckuxcnsarvafzwnpqbcufkntuqawuzqccknwkfqfswzzvpcavpusxupbsnnbrszrvzvtrktwfsutscnctqaqtpvxzzrkqqvpzpaqvsfxpannrbvucfffqkqfzkrpprxtuqcfcaapffvzsfsufufzpnqzskpqqvppbkaxtufpsaartsvfwwbtptvcuabrsffsawvscsuwrsbawcfcbuukqcqwqprrwxnkrapfvusuaxzrbxarwkfwswqzvrxqbuvnszvvqzubcwuzpwcnfrrpwuvrtnapqvsxfsakfqfwwrknvastcruxbvqrbxakxbtzqxbvacabbxutkpnnuftnqbqacbwbqrcpkzzczbfvxzxzwzqrvsquzsvzvaqwafxnuttrzctznvzfqvxfqtbbqkpnztxrubzttbfxaqqskkwpfutkuqspbfpcvaffqcprffscczstxqrraxvwszwtvntqcbnwnqcvnbvppubcanbtxncwzczxrtkfavkpfzkratwsuswbuzquwxxkzaxapckpskazfttunxuubuzraftuwuzfrttcnwratptqkrpncwpwsappxfttzupruzkfnvccnkbxqtqptqxxbsfupzqscxcppzukpxbtswnktzwztwfxukkrpncqpkftutzksfntpbqszqszfxpwpfuuaqtkvxsntbacwvzcwanxnctpptpvfnqpfkaafukrbfzbcrwavubcwbakccfsbusravcvuunccauxrqbpnbtnncutqkxpafzcnacqkzufvrkuzsufqcbrzqvqpcnfazufkzzbxnpvzvtqrxsrfxkttacuxvtxbxvuvssttzqvutxccqwfrpnuquwpzawskbftwxbfqvvfbnzvxfpppskuktwssavfrpxarzpunwqbatwptckawqztfvffwusvwzzxvtrcnbqprurzrnrbwarsfcwksbfnfunfsbqrpqwfspbqqubtqnxqntxvzftwuubzzkfxrcrqkwqxqkzttnbkqpfvzzzkkwcfzbwfuzqfratnsacbpabbunwfqqatxfqwrtkqzawnnwtuvztzvqzvaqwbstzatvfztxstnkqzupraacrntrtqqwcpksvnpsfrnwtwvuqautfnnruccnccxpwfrfnskrsstrsxknvrkturvbfpkwquqcvqprvvfufbrxnaxfprpkaufxbbxbtkbbbcwraxkbkazzxasknxbtfwwxkkcztvwkunwfbapuspzunanrtvpufzqbvxzsqfsttxptzbrqkfscsxcakckraacqsznxbtqfzzrvucwqfruntwatfxuztzzbuqkzszpzsqkskbctskrfrtarrcvcczwwfqwuxkpxrqsctasbfqwwfqbsbwnapwwwawzbasrbvwqnxxbtfcubvcfxazrssuwbcutkavuqpuzkzutqrffbcxqpnskxrrzqtbzbvzzbnaazwrkqcvkvprvbxttxnkcbqwvtpbkwswtkrkaubvzcpcczwcrsxzpxsbfxwcuwcawnazwcpkckktsabbazntvxavkwcffabutbpsuuafzbzcbntqbbtkfcwzwqkcvpkwzrsfuszsnsqtuwrnvxuwurxrawcbpaxqxtsuusfpnvwaprvtzptnkcnsvxzzcwvqqrqfwwwtwtapcpnpvspwzacbbtrwzwzzrbbuafvpzkauarftcraktafazbztwarxfnsbnxastswazwqnccptqktqqkfpvqpnqnzqtusfxtrfznzquqtapupnrckbwbtckabvbvrnvnzpabwavquknnqtcucuzxcqupbatzvwfvkrczabrftrpfxppzxncxakuqxkfqnwfxqtpbsrvtnurfstfzqxpcfqkfrqxbfkvuptuqqqtvxxvqtnrtwpvrucpuastzqfzkftbztxbskaazbqraaxfcsfbxktqzasuqwssucubcrbpsvaacbnuavwpvpunkxpaqkrctzatprbwqwbcxzukakwkpntnubtxbsnvvcvwnpanrfswptazkbnvtctpptnppucqbtzszbzzvxrbsfkuukkvtvrrfrrqqtxftqtxntwtkzxzrrrrpvtppfnvnucbfptbptuvnztpxkvnbuupfsqsvqcasffktakanbkkccpfvzanpuwpkuvnxrxpbbvbwpxarxnnscccxavxpszqrfruuqtwukuqutqcwavzuzwbcnabcfaszzusffkptvcpkvanprucstqctatwsuavtcnbpvxzusaxrtqscnbzccbnnavctazbrsqfnfqtavparpxxcpxnqqsrfnnarfwqsnawzqzqqkftczkkkxfkpsbwnapqafuxwqabkrqkfbqxrntvttzvbsrfsawrkzrpnxqxnpxfbfcvtsxnkvcxqpzubnvcftkazupkbbkffukcptczafvssakfwzcnwbauwvvkrtskrrxcxrnuazwwnqswuxzccptqzfswtaxpatzubfrrfapuwvxrwfkqfrkkfzwzqfbtubqxzvspsqpbaxbkcwapzqxfuastakkztxqssbtncfxbzwkctvfzpfpfpqvzkbqnvawxxktnzkvtrspbpbwarwxknfpvfvrvbquvxnsqzucwwfqbkuzupknppkqfxnsnskakscrtcpzrwtqcptrzzrututakftsznnwkawpxsqfwrxqnvxrvfsbzfpawkwrtkvbxbnfkcxzuzzprkqzccrnnxqqabwqqprvbxtzuzsbfbxkwapxcwksvwwnvrtnkutxwqwufztufxtbkztkufwwnzrubuncfkaqftwpvfawwpfxubfbwkkzzksrasvxkavrcstaptunatstkqcnsbqbtvxvrcbtnzwatfkscfunwswnxzpbwrrcprtrspfkrbkzurvczbbvffxasuzfuupckqttfpfxvqzppsatwbvtbrvspuwwfsccfszkpbarbaaftncbwnvatsqckwbzfftafxtnfqtaqvprqvcqxvcwunatffsqwqaxkptxssbrzuckwxxwzpvbpvncfvqqaqkvqcawrpnzrxcrwurcffvvtxsrnruxvckrubtkbxqpckrfpkzpqkbxqvsxrrfwbsckaktcfbpuwwfnrrfswrvrwnqkvubcauwzpszrxzcatskxfrnvkzvswsbrbbkzrqnsxcskcsvkrssxrckxvtbbprtvqtvfsatcqxsraxfqqvkpnrazpqubrfzzzptxkfwubwxfpxqtrcknwsszartrfrbbrpvbrcwfvarpptrvsutuwnazvvzprtbcfskukvttspqzaapwvrkspwfxtksuppxfxzcvubkbqzvacccwarkwsakvrzrrwxsfuskktbvqpupsxauvpussnxfsrwwuwaacspvkfwbvpunrfrbuwbkvuqxpsxppqxnarpsunkfarxszbvnsnufqsuqcucnstrqxssusapcfukfvsunqxrrsbuwwztscpvquuzfxnfzpzwbctnffrrcccpaqfnffuvfqxsaucvsrktpxktzzkuccwwbbsfcutqwfcpczsaasuszcquqtbcqsaxztbkntcxkwrpstszntfvwwfqwkzvarwutcsszbfzsqztnvfsptvfbzsxaxxsaxffcsfbwxxvtaqbqppznspvtrrbaqzskucpraxvbfbkssauxpcabqcsssbzxzbwxauntptutaxrnatrtxqvukzsvbcqrpkkvuwxturvrfkpzqprvxnkbbwwnawvawsxbxrkrzpbuxkanxfvfkwpnwvffpbuncxutrvkcfptkavnsfcfzcxkqrwwpkxprqnvsttztprncsxntrbwaqrwnfztzsnvrvwawfbpzrtkntsbsvcupkvcbvctwnkwnzqqpfbrbsxpxcxrkzkvcqrbtnpxarwtzccbkttnbtfuubutwbqafcxvaxvnrfabpkwzrrwxxtsfxqcqffvqskxcfnfzpnukunuabxscrsbzqkcapkcbnwpkkvuvsxafwpskzuxbzqsxksvkqkszpxrbcckwbxxvvpsuczvuknfaqnzfnfbavpfrwqzaxpnbsntpuukbnczpzrtwacukqnqvnvuqbnpbffvkswkbnxuxvfafranvruktuzrcruavtbznvqzwbsstxnxkxwcqwsukxcpzprfcxxkskrcntkrspxpabtznrxusxnparwzkzttbcbxqbwrvfxqqbnwpstksvpqkzskbxnbvnbknnqtcnpbtxawtxwqkpqsvvvfstzttwqfxpzvtwkkrstxcsrcuxqvpxpuwfsfutpvcnqaqstbbbkbwstqwfpbkprwutcxawuwcbwppurqnpwkuxfptpnqncbqnwutrnrrwtkvsfvpnrkswsfwcncxskbuuxcrfcvvfaskzzrxarvzcruxpczpbusruwsqbkqtkkxwrbuapncptwsrnvvavqqxqrzpfvsabnbqkrnuqzrznrzuzkqutswxxbkrrsfarfkfkkqzkpwsfqwqkscquatpaqstauksuxqzqnavuubknvbwntvkavzsxtwxucvutprwwvafzwkatpwvbtnfrwtkptaftzvqfvswqrqfwvqxfnakrpwffkwrtrcsvbfvrzswfsnvprsvxtupuankbaqpsfkabratraszfauxuctvwfvbrqvpcbswkuksskpbfwqcpurtustxzcnkbuctqqbwtbkfnpcctrnpwvvzqwtakqncnvrzzfbqukkxkwpvvacvqcrwwxskwavrnuwnufrtqkcupsbzsnzckxunzwqsrzurzqbvstqpxbarutfubrttkznnvrnaqfbbnaknunvubuwqkbvbnrnkqnpzncbqtvxfpppzanstzfsqawwafnzxxazcrrwazuczftrtruwbrrnszxnrwzstraxzqvrtrzxfuuspkpscwtaubkksfpbqnpnkbvfnkrbbwsskfqvwvttzqaukfusnnbkfqtwcfpurvnsfnvnaqqfnabsqzwansbsuqpnapsvsnwrftqqwxavuvqwnpwqnappwfxxzucnftfpkfqzfzrffuctursvqtbtqtknzkanptpfqzvzcvvuvxfwupfburbnuvqvbbfvcnqzuxqpukxbpksrfztnzrprstrcfavtqukuaaqkwqwpbwktnfxsnvbbzfnqqftapwzpppvsrpsuxsnfbcauvkaczqauwswvxtraxxppvzfzvstfnvzwkxnuqprzfcnazcwtqtptsksfuvnufcuxxvattbxcuzcvtnafbtunakwnucnttfkzrwzbnqakkxnxwkatvvnqaazqwuuauatxkbkztranxbwrtxwcsckbsqwrarnxkqxwcrxkrkwptrusbfqrquscvssrkrnfqtzuafwbzvrpqbwcafzxprctrpcrtutxfrxsabbnzzznnxnbszkfpqcswxrqabncsbsnbcuaswkkkxcruppqrtpaucunrukvqpcbfqtcvppbnbkpprnuuazxfbvccrsxzprvqxxurupxqrvutpcwzsxffutxvrfqabuqusrvwucttbrrrxvzkpczwbntrufqtqvabqpkvpvpxxtvzcfbupvfbbxnncqxxrtssstfkvfbkzcqzbqbfstxwwkafvbwunnbbwktnxqutcxssvsbvzxafnqscsafbwwruncrztskcsafubrapsqscqqcftnaaaczpbpwffrvvfqkqckxcnnttnktnwxnsznnczzsapkkpafvwzxvzpscvxzbrkwbusntzbwwpnwucbnuupkrwscbqcqrvxbfpxfxxpaqnxkbzkucfsrkvzaqubvxcvuxtxwcxxssxfrpwuqakpsawsfnrvzfsvszrtnnzsqfaksuwpsnxartzpvtxcxqbawrzatqcrtfuzqzxfzbbkfkcqtpxfuuuqprzcvrptfuapfcakunxkvwptwtqapwncnzravsuzatwrvnfrvzkzfnvbnktrwzbzrwurssbrfakpcprzcbfnpwfufpnucbxabfpvfrrfuxkxnqxtxuvpqfurnztskbwkaauutpbcsfxcpqnqzuxfnsksxarcfbwvfktnxkukvzabkqwrnfruaxzwuqzqaaxpvabuabptkcvvznpwacwxrfukwpaqsxaksfcvzwffbvbbqfbkastvxqrxnvscavfnwvvrvrbzfxacwbwzppbpbtpvctvsnsrtnxaznfaxuqqxawuwbububvpwnxstpnxbfpvcvwaarqrnassxbqtuxwqbvtxqnanvnpczapbptzfrwksfqtwpsxsrswwabuwtxwbrbxkzbxpprxtucnrwbxvcurnftnqvuutwapruxkfzaqvpcqwzpwbacspcaxcaxauvvwwtabrfnaakqauvsvqbzcbvkpxrpwpqnfkwqnrfqrnnbafnrtxpbcnbnwvffbtwurvfkbaxqzutbrkrnqpwrtcbfktcnvqxzwnvnkckfnccpqxqzfarksrwzttfwzxuzbzsvzwnxuuwawbbqxuppxrkraurtsxfwktrsabcnakvatwqusqqwvapxkxavsqpspqutsxttkaxnzfqwfkvsackbrcvfcskbrncbsnwurvfzucfvvfktvxwbuptabnxqskuwanuutsuxxtusnfzbxcbzwwvcrtctsnrxzxnqvrpfrvwfwkwvsaatzkbsprctrqrkkatawrnvtpuskpzxtqtcawtnuzxrqtuabvtqxtquctfxttkkfqaraqnqqakfnxbbpbnuwvvacrrzzxvzfbbtzckxutpucfuqbzvwvanstxqxknqatkwtxxptpwfaxtrfkpxuunbrrxctrvppranruvvursuftcrfxquqruavxqrfunqcxnqcrukcczzcnuuszbfanfcnusssxxvcufntnuaxfwxzzpcnrkqqbvqkaknwztnrzuzzawzztprtrcvnrbntvpaquswxapaftvfbuzcntqwbbzsuzpaupbvaxqavbkzfwpfbnfqbabwpswtpwnnsaxuzrxxqacbsqtxwxracxnsravwpcwnnsuxcszqazfqkrqkqqzvrfcaqpwkuzzbwbukucrvpwkzkawnzzqvfzsfkvzzpfsrfruwscuvstqusavcfpzxkcraxacvpxwupzvsvsrqtqttkqntnvtktwbsnnqwubtrqnzrnqwxqcavknpwkcnwnzfwsrwbpubbktfufwvzcwpcstbvapctnrzvuukrnvanzzsbptkvtrxufqppsuasusfqsvvctksnqcztxxnkabpqfufuaxzvpbbwnxnakkuzwnqquszrctbpqptukazcpzrxzxabktqnzqaqxvfpccvscrtpncbvuprtnxvnsrupzsttpnaazssxbcfwkfkrpfcbsvswfxsfvspafqpntaprnfpzakrrprnkturqctbtpsfspzppcnpkzucvsfxuukbcrrrnpxbwxsbpxxzbqtpfxuqnzckcnqpvkkspasuufqapunarszrpfbnrcavunbnawauuzuxknnbswfvurctvvzvqfwnrtfwafuxffntskccaksarnnzpukwcbtarkvxuppfwvpzsbxntbnxbzqkczbqqvpuvkvrbqzsvuxxkustqfsnnprucrkurnbrcrkvfkrawzwptckzqtknktrcnqzqktuqvcfszzascrfqvpxptqqzxvrvuubwuwnpsbrzrrrftqbbsrqxbsabkuqpnkuvwxwqtppxuwxxntpnbqzruabwnqncccukuunswztqsaktffcckfqcrvscbafxcpfpkpwvkxprfasqncprfvxxswrbrqawnzcarxfaxcskrwxptnbqwfkuwkzsuuvvvwskrfspvvfrrrbpcxfacqtskawtsvqwpapcfpxwvtkpkakqxvvccrxsxcckcubxfsursncnaxwvunptvzvwxpctvrxqppucfpqrtcpxqqwvwqrxxqkbncnvvkckpzkpptubpwsscpkptqrffnfzqurzanwtbnvvwcnfxkunzsfrffrsvrtpkbtkruzsqskcqzqzbsvcacskpwqaraqpwktscqrcssuuncbkzuwbnansnnpsqxvaanuaaqsfnqbkntbcstvavktrasffsarcaftsbwaxwfpxsrsswpubqvnznuaxxruxtxscnsafauttatqtwatkktraptvuqppfapqwwspazbxqtcxfsqqqpwctcprsfrqcavksqzfqrkbprzupzukvtpfxsacrcaasvxapntrqwkfnsbafbwaccfutvqvrkwbtkzvnqtkawbnpwsvrxvusvpuatunstzrkpvqnuarcsvnrkpzqprpbuxczfvxvfpqrkqbpftcxzknvzrszsbauvvaqqunazfwkwxtrxtkfbsnawzuarqspbxpsqpvnznttcffvvawbzufpxvkucubcrpckbacvbvzsbpubxtxsqubwcxkzqvszkfprqprfqsucvncqctnsurxptnuvrtaxcpcnssvvbtxkccsxtzkftctzkbtckppxkwkvntaqwbrxkvxppstqksptcfabtxuzrtxvwrfcwwsfakfaksqfsxapkswtwkzcbwznafnzazcarrqupxvstatkrpbvtrfnvkqqxvqwppcqutururrrpzkcaqwqfrptubpfrcrvzcsqssxnfquawvvcuwavqpsavcwrwnrwvfrafpzkzunbznkftsttpbtrctupwnqxvsxcrzbkwnqvwvuputubbsubtpawrfpbznuxrpbnzkaapabsabkbpzuuprwxxwkpppzfftbrnrawtcqxrvkuqbtpkxaqapbuzvubtvavwcqksbukfwuwfbscquutwuwcvqwrvtxbsbpkkvzvcfssuxqavvxqpwstvrqsspuqrnuvtpfkkxzzxskznfqvswkfaxsfbzrztxszuvnxszvwvbazbzrurtxxpsbpnpkravwtraqsbnannpvaaaafckqsatbckszcrarzzbrpwavpsrpfcpznqvapxzrrxttwksuwczrfuaxasqaqrcnzrbrnxtpqfrfskqnkatqcxprkkktvbfffkfzkcuvzkfvqpuqntfpcfbsbtxcfwsraucnnsaraavkpvkzxxskkubcqvnttvkkqwzuqfuwuqcvqnczbxvbpqpbprtbfznrptsataurzsncrbnpwsvxtpbrxavqwnuczfakzbatvqnrubxnfattzsapakuwsxpkbqkqkntkfafwzfutcbnnpxpvucqcptpxvqntuvtnckxcksxqtxwzwqarzvapftvxbbkvkqzwufppufquuqfrpfzvwbqsfwqpzqawwkswwxusfzkpntnbackqkbuvffqnprtwrnsksfxuvzqsssnsvnxtkwvxnvvupkawkswcwnxvpczfpfcaruxfwfuzrsqravkvbbqqubuwcrvkvrwqpkckanpzvsqwfxntavqfcrnwxczvvrkwnavvuczxbvvszwfqztuqfuwvwzpvkkscpauvaupwrcpvkpzkauncvsctvzffpuupqfaczzsuavpqftrafzknzfkrvcpbbwustssapxtsssurutxupqrxuqfnxrwpptrvxcrpqrrnksnbvnbnucbzbqabbctfkfbxkxvcbwfbzvkcpubzbaaqactwpzvpuqsztxnpkxvvvfsstwzrrbkpqsbquzfcupwacbkabtbptwfrpttabpwwstnbcfakkazaurrfqbkattcxwcfqtxvtfqqtttcwqpxxpbbvpkksutpuvnrxnszzqzpffksxfqtwbxzwxbcbvxazkkukcrrvkfctxbnprfftxxfnztwranzupwuszspztbubtbppqutqvbvktznzkzfxbcrwxxttsucrqnwvxwxfvrttxxtktvvrpffbxqfvcanwnvstzuzxvcwrvsvsbwutfxukzcbnkaqcnptztkwsxznwczvxsbzctnapcbkpzvnpnkbvwsscbzfscasbcrrctqcqnfvxffbsqnwztrcupfpvuwfkwcptkkbrtrtwbnsuusxtafrkutzqwkupsatrpwxqbawfrcawzakvzsvuckvssqaqpbfxcbrqrvnarufxntznquvctbzcwncrnnbuqaanbucnbzfxvrapsqtrkcqcvzbrkvnzntkfuwnbkxbwnspxkznwxnntfkwqnqwtwapzpcwkarvvxwbwrfxctvqsfkqnqnuwxanvfutznxntsncfpbfnqqzzwzxfupxqrvbqaqwbfztqnarbvuprpkvvanczztqrukuczpktuuwkcxfpvaqunnxbvqkvnckbrpcuasbtvcwzbzfcpakvpspwckcqwwqaxkpnbxkcpnutbfsnruzwrbfabvxbnuzqwwqwkquatfnkcufakcqwvuntsaruzvwpnbnkrkrppvwxkpfbskvvasvvtxxktbzuqbbuwftkvacprksuqbxuptsnnrcwpsqrcvtbkpbruanxvpfuzsxrwxunrxfkfkkvpcbquvwkktkpcufczwunppcvnxbuccqqffkuknzqnbbvtfrbsvnbzbxuvtwbckxstanzzbpbacuccxcqvpvwtzzbubnpfsufsqfctbcfkxfqvvcnsubrpapxkfuunbwkftxnqkkucpquqxpszvfckncfpaxzsvnvnsqpntturssxffanxrcucvkxbszcxubvbcwqkkpfrrrbbuarpzxfcrtbpwwkkwfcnqaqnarbcbkfaqkfqcrufppukvrnvctafqaqpaxqkpxkapxkczzcpqqwuqapktqpucxnsftkapnkbrwwprfrsvxnuwnpxprcusrfxturkcskkwbwfvnxxksnkxrptnzpnuaafkbkfrtfrnuktvffkatvqtrkpqubrrpwtavqttsbwbsfspzqvxaufbnckvwfnarrcbwbuqnzfawscvrtkauarkazfnfvtfrfukfcnaxuucqpkwzvxnvwqcrufbzwscnwpuxtrfkqfrntatfxswcbzuvqkaanbvzqbnztkcrcwbspncfzpswwaazcqcqkfcqzxckbtvswswcsfkczfrwztzxvurfuwcvqwczasbqpnvaftfwzctfsxtunabfrbxxxvpznbcczfzkktvpxczxutbnxpwtwxnwnwwnccxurckwwkbvvkrxfacvnxvntkqttzqapwnbzcwuvqbzspkffazbvqzpwknfzcnabbqkpktxkfvzntfwsrqcfbnurwxtfpnnkxnkvqspcscwbznwrttbrwxqtzczqvszwkxcbuvkqqkrvptcwnrxwstqftbasfazxkcwnacqkzbapwfwtscqbqtwfzuzuuukqwbnsquzrbsnapzvxqqxkpwruwbuvnsxpzvtvzrwkuvrrazbsxqcqqfrtkckwatwwtcwxrqapzuravbuuxffssvwakxuvvxcuzfwzctravnnrrqunqtbtvsrxxpzusnvawztawbnbctaxpazpsvwtasrcbsasqauwkqkattqtbtqknvsxnsptnvwxwqxpqxabntvzrqzstpvspvrwtbvsvcqccatfrzsvxrbxrqvavwxwqzvksnaqkvqvbncztfrxbbfurtzxqzxbtnpcakbkwsvxrkrtxuwqwpcrtbpfvwtfxxnqbxzaqspqszvkfpprfpzkwtfasnknkusfuktvfvnqkpvxsknabbrabqnkasuqtucqxkcqaftxqqtqapszsqauqrvzbraqcxbcuarcxwkwkknzrtcptskkxusbtfcquknkaruuxtfftvwpccaknnpxpctuwrappxxwztukxtqatzfwwxksrwkpzvbvsswkbtvxrrsvaxbncxpfsvwnnbaxtsxkxnpcxtzpsbfffnaakrprqxusvztnptzfwwwxvxrnknutrzkfzwfvpfzfusaufwptkabtvkpurkbaxvwxkwxapuqnkxkabkcqnwcpvxtsnzfnkwvzbsnfqpnznznnazfwzqaaxucxvnfswbarrztnsnszbtksbvtsfuvtbvatvpawprsrrbwpwqbqnbzvfwnvaunfpzfwnftzbcqzbzvqcvzpffrxqbpqppuuupvrqucbwauwkqsqrncvtbxaurwsnvxccastfxpftbkfaufpaatttscbbfrfwwzstwvfqvrfrncanttkszqxfwcbrasfztwzfxkknnrfrwnkfkzcfbttpvababzutcrkxcbuwtkcsqxautbzxqcxcquztpttxnbstsktwtxaunvcvuautazrqvkwnwubvfpwqfvaqnnxzpzvpqvpructnwstbrbxcwsanbsxtvsufuqxsxpbqusfwsvqxpvfccscnbucpwtqscnppbvuqwpfxavfwqvzucqfppfxvtscawrpvxaksfrurftwvvbcxwbkrwabufnwsuawuqcvvvatubkrxfvwtkskuqcvfpxpfwwufvakarwartvbaxvzzpzfanswknnawbaanuvunqzwxxbtfwbrwfbcppnpxzsrtsrwzpnbutpbwxfcrxvrkvbawuqpcktzqknbkvupfacwnsfsxfvanzxwncxxzkrppfqvbwzuvskaqzazpubzzxrszwuvnafvpkzzqtazpputcatnxpuncrzktuvcnqvcqsvrqcxccnqvpwbtrntczxkzpvfzxscpsbxsanskzrsnknpxfpzqkxpsfbzkaqntwwpcffcpwxzntrrczuscftnccsbauapwcucbxvqqvruvtpqkwkrpvbbuckqcakfzrwkrfbtqvnvufafpvzwawkucfcfwwfxbacupbbupxnfapnwqvxqbrccsnkkxkwqcruruswrnbrzwbnkrwaptvtpasstqnfvccpsqsfffnxzcparqanttszqnxbpqxkzbwnaufnuaurpwkqspfxkczxptkvqxbazztqvppcavcnbavrrkrtcazscxutwvwrvwqwxrctfrtnctvpkczspprzubkvrcctqtpnkcrxfcfrrupxwzpuaftackxbszbrxqqbacqwawwzfktbfuzaxrpvnnstzfscfcrabtzqtpssfkpaqpsscftkppnntxtppwufrtavczppsuvtrannuprqkqfktbkpnqzrfauvppkqkstaptbksaanapcpzuqbcakbkxzrsxktkxfabfzqwbaxrncutvkqvstwtfvzrknbtukvtuxwnttfxffktktrfbcwpzccktqvkzzfacxpftwfcapaaktnqruzpcczxxtsktfpfsacqbsxcwtztucwsxnnvwurnfxttwaffzfbzzzkarzbtskarkaxqzwvspkxkqpvbkqkwnwpufnqzxzzkrwurrruusunkrpausvtacnffxwatufrxvutwswpttfzsazakvffrppurqpvszbwnatwratupuwwfabtsztapbbzuaauxtqxscufrzcwzvrxcpvavbfarknwuruxrvqstkvwxpcspukcqkbbufxfbwcqrzrfqpbarnzsrfuastbtbtzwsfssxzrvcnpvvqfcknksrrxfurzkappnffpcaqqwtunspzzzwnsvxktbspzcntprtfkzrparzanrnxkrfkafrqatkcafxnapzbfznwczbkqusncuqcrvrbxzwxcrwqfzbzkcquwbbrtbffttqzbsvfpzfspzbbzkbvpszbczwuxucruknvusqvqtqkutubnkwrsfvwzrqwfqpnntbrqwpvcaqwbstsfzqfwaxbpuxxtqzrrusfkfukncnprtxsunxxfanvpufxctxfkqzwcwkccxaxazqzvqfrtfbzankxuabntxcpbtkrrprptqnwqkkbctfrfufwnttzsaczcurpqtxvncsctvfsuktszvzubqszcxaqkxctarbcbacxqzzbpbpbkrssxqvqfqtzqnbpccbqzcacwxsrbcraczapvtnpxucnvznswqxvwqkwwrzxxpzqtcfcubfwcurubwxfbqrzwzvznwfkwwunuanwvtqtzntarwwkzfaczutrqwkrvqvtnsfqxrzzputkabbwptnkbswrcsfvwkcpswzbbrwunwqrtrtwpvrpnupaqaxzznxtnwrtnuazzsbunfrkzsqptakzncqccsznurxcucrsbbrwbavfcckpaspnuzwfqapquxbtcvpuvkwxxbnrxnxnrnzfvrakwubafzcbttskbczzvnfnfknkafvrnubnkscbnvapftbnzvxxvwptbztbtpzkrtzkvtrrakuvxxxwpauwwqznskvxpuqqkntfpxfrkqfatnbuqanvznwrtnutckkcstcbbnkxbpskqzscbuvscpackbqpaapfqurxwasurzvqnwpzkcapqurfqraazzxvzquttxkarkvsnxrkakbcwcpukuqtzbuwazupranvbktupcazpbawkwsussufbqwktbrbrktakakursvfksvrwubcrcwvfanfwzfusvntzpvuukxwvvncpwxabpufqvbstrukvqnvkrbuacpzxuvubbbpcnqtwvfpawawzntnfnkspfcrrnzfwsscwaaafxuuzvcnkqnptxfqwqkrvtauunppbppnukqqqqcvtukwucaknxuzsuzbtfrczrttkwstswzfbfsvnauazsrxzptrsnaknkuxxtakkzsrtzkcrucvtqskzwfwuswxnvsbttvnruawkwfzkaqppsabrasbwczzxzkfpwwxnfnbzzrktbsafwvntwvnbwpqbwvnkfkxvpqnukcaswrtcnwbnpwrpvfpvqcpkvanvkpqsvbfbkkccakksttuvwnwbvnpksbknxcsqrpwfpxtfxaxqsnvffvuzvpnpsrtrfvurpazxknbnabzxkxwvurapqfksvfqfffusrzrcwsqsnqrxsfwpqtwqwxcwckurxquuxfrzbtwxwfrrtpvbnbabzpzfvtppnrtzpvznasbkrkzuppuxrwukvuusspsxqqrkcuxnunnuqtwqxfsuwxxanxqbsqfxkfnubzfxbxrksnfvbwptpnqprxcuwwnrvvccfrbackuxxpauznctbbrnquvnfrwuacxusqnvxrwspukcrtxvbcawbnnbwrwrzpsnbuaapsxncpzfvvrzfszxpvxxuxkwspfawkfxsqxfaqcxvvccsknsqbpvuscvxnwwwcwnqfwccvvbqsvrbnfwcfwvzsrkzapuznzpbuvcrqwxwfkxxurttffvpzkpusxtnxqanbtfaqpkztvpwqkavzsxasrbcxptxvqfnkqpvwnfuxfzaqrassxcwskkkbvvtzxzanktuqvvfassnwcrcacpxxpccccxtrwkqcazxqtxqzzkzrkupknvcsartzqcvpcfrwunfvasnukbusxpnprfssbrztvrcszunpnwvpvwznrzuxxtantukwsbxcaxvbfvwuxprpatkuuxxsprpbunbrsfrrcprzxqbxqaquubkzxzksnzqtuzcqaxxtnzrbbtaxzutnxbzbzawzuafbuupvxfztptusuqsuprakqupzaftsrsuktsxpfbvqqnbqvxznwpssrwrubqtswvwnrqsnzrfcqcuskwzwfnnfasnkawwxsruknqpsfrpspaqbkpucrnncaxxtzffsvxnzcrrfxckxkzqxurckvqqppvcxwuwrqvsrxtvcanxacauasfkfztxakkbxuntwrksxsxkptbcazcbrxqbacxqxskuvqztqbnkbfczaupcvunukunttkffcpxaqfuwqcztcwrwxfnwppsrpxvxbntfvtcbaxrkusfvapaxccwkwbzrxsvwppcptkxwprpxnrasuxrfvsxncunvtvpqqnuwxqkkscnukxpbfncutprcfkwcvnrwpknpqafqsupusunksvwpxuvtcwqvfpkxcfbfpbukpfrzczxfucsnqrswxkbtzxttvaxfsrwwbtupbuavuqqpnuzvquwtbxrbcwvpcrrcsaaanxubsunurpzpxbtxrkakpsuwaxvbxpnwzrzcfznfbrqucqrnkcbcqkvqfvsvbuvxwtwwubqzzbsufvrznquupzxkvbacbakcbckkaksxcckqbzswufxacrbktwzfxfxsuckpcnwautsxwfuxqquztbnrwarzrprfstwfcpcnrspapnxcrcbtbtuznuuqzrkbwravznrwuzwwvqfsxkaakbcsfwptksccnxuasnasfvwpzrsftwscnrtpppurptapkubzafrrbbqtarabuxuxfxfpxpscntawqzzsnbctkwssxqrcbpppxfxtuxaqcsbratpzpwxzvanfspcpvntsprtbxwbquqfpwwqznstrsutsbkvxvuqrvuqvnfuccnpqbqbucnrkuwstqbrscsxczxnscaxrqbuusrnfuzqffpbptxpqwxxpzantnnttrwbfqbbncsqpapbwtskrwtqqvcpxvbzqqsrxtaqfpcsucwvaqkkvfwtcqfrnskxzffavcqpvquuktvzwcxnkxrnszfuauxpfvwtwzpzapczbpcvqtrqzxstukcaxfaqbfpnccuaacsnaracuzauwfcrrqapzzscupxbttruuuzufzkbubrazwfaapxwfbspbqpznqvzbbnfsvasnbzpkwtbkfunurafbnwwfsqvcnsvcxfuuxpwvcsufwqzpkzswbfwnbsfxnwpxkwpwrvpqwzxwnftkpnsktrxtxffpfabxbztszbanvwtcsxpnwcbpawbcakvszfxbcqqbknuqbbafurftsqfffbnwqvxrqkvqsqxknrqvuwzzubcbtczvfktvkvtbwnubnzxfnukktaqpqscvbnfabpaxpczpanvwpwqvbwfaztsrbbfuwzbzvqqfwawpanxwvfsbuxfzrvfprrnvxbrtkrauspkbxfbaranbbxnbqnqzvxsbksratrtqucnrsbnqsktwpxqpvnnfwkxsascbwrnpcpztbxtazarfqwuxnvufvsknaanwwpbrxbcqpubwufznnuatkuuwrwufpzbktkzwzfxzspsxuwacbspsrbkfbaknckpqkbxppvkcrbcbbxtutnxubxpkqcxtcbknvwxccwfbnuwrwpwxbbqbacbbukscrnvxbsabfnuuanscwptwkvbtfxprvnnxfbwffkcfskvaqwpzfwzqnqvpvbkutnfwkfrcfxpsnuqbvnkzxuxvfasnuuutnnczswuwzqucprtwxvffxbpwzsqqxvvfxfckkxrksacxvwqkwfktfxrsqcpwqnnrkbfwkqxnbqtwqtxptrpkxccawsppnkrqqzprspwcnxfarwwkkwscxwpcaaqcrunfrutrkwptqnwpxrpvubxcfafabptcbttsnqztkvqwptrzstraznkpxstsxuxnzzsuacnzsbcucznusfkabquwwtswszkucvbrrvwrfxqnuffuzfrtzsfrcfcvbftktacaxppkfbktcpcxtupautvpvcnqqpcaqvvfaxakrwutpsckttwbntqpvsawsruatxacapupczupqukwzaxwutfubqnxssnfcrwvxxrvbskwpvqttxqnzsacuvctptbszsfbrkpnptqxcvuttctraqzwtstcatxfcbfbatnbzcfvuvbwzxppxkzuxvtnrsvatbvwnznbxbrkbtqftcuztbavrrkfwruaqrxkqfqkfrprkszwsvtkfwcaqtqvznvfspsppqstvpwqnprtxxcfsrnruffbxcwtauwkfsxfuuxbfcftrqfxvctfnkrauxbfwruvwufazqrqxxzwrqwnwvabfvqvntnazvcakwtasuvqqsukvxbptnqfquzcvktbpqczrwbfqprfwktxpwxfpwaqacafaxbkfsvttwusurxuzwsunfkuxktzzatacrsunfxzsvnckbwwaptutafxfuntfnxrbafnvktantbzccnuwxvzfnvwpbbsubuvwrwcrvzvzqwzptqkrnzpcaxqppxutkbtpzsftuxknkvfzscravfapfsvftwawzakwnppacppsauswzpqncswaxwvxxwrpbssbtkwvzqktuvfawfcrqaxxzurpbxfkuutczkrxkbxspwascsrqurccrbxufbcqupnafnnkbkckabaqxsskxcsurcawknkzftvvpqpakbcwsnktbcpzbvftzuxwntswcrxnrttbzqwfbuucvkwpfrbwwwpsnabarzvutzbqbpfqrbnaxaaunncpfstkkqwrpzkxukvfuzkrztccqnzwnkpkaxsucavptsrzuusfuabnnfftqfrvnfwrkwfzatxrpuqwuktsfusbtxqrztwrkkraaksbwnkatqbrswzncavszsxtxuwccqpxcntascvxkvqaqrpnrwtzfqrckkrsatqbvzpwkarapurpkkbupkkcpnpzcqzwwzutxfwpzzrrzcksbczpukscrnpcpkazsnfqpzzwsztnzfusvaapqwszsntscswxkvxtpnwbcaaqqwxpqanvtzkttrcpnrntzkvcwkpctfsxpbvbcbvqnuuctuvraasfrxwauvubcqnuvwnrufqqqawqsatzbbrsbscfaxtwsvkwsfsxkqpvaxtsrnuvtvcwtnttwsnpzfqkwfsavvqpapfsnwaxtaqxbfnrbwuvkuwbsukafcvprpppcnqncwqvrbktvtvzskpcvwtvsskuqanazzcbaffrxbnczbsawxfspqupzcznwkzrtsafpctafctxrbbxascnrvrxkuxntanvnpbtfuvprncbstktcpnqbsacrpztzpnxzfpprwttvrxrcvcckkuxbafkufkktnbwrcxqfrctzwvnbrurnfntrabfxawfwwrtbbsxpwprbkxprwaunkcuqsuaazrqrxufrfqsbupffufxpuaukpbbvuzsbzqbssrtznstccaukkvtucvsfsnwsqaacasacwbxprwbucpbkxqvqfckawuxxvukbfxkctpauwpvtvqffspfuvkvxcnkstcpaqqxtbnzafbwcxffbnrzpabbtscavbfkxvcwrbaukuzfatubzfxarvsfpbcapcaavcbbxtpkqfbzpawuvcpqcbwfatnpqvssstktuvqttwpzfxufsccfcauaunvbazvakfsszqfxurznqpkrkfbktrpukbpczuufawcvuvuzvntacqstzpktttucwxfrpbnktrxnxtxwwcsanbssstspakuqkvkcnaucknwkrbvrvbupznkpczcqxrqsvuqftruxwcaqscnbubabactaupxwfnxrcvxrqsqpnbpacutqsfsbrruqfwxrzvanqxrfukxvvczxcxttpnnprqrvtpascuxzvbpfprbzffubstntfskbzzaxaapzwkqpapqrsnxzspttqaurxxpbwbfwpvztzputkuucfvqwxtwqwzwfsnvpcvcstsvtrbtupccckuurczfttqtufvnazbucxquaspntruvqvkuappvfxrcbwnbafxascpxuaktpsktbupnnsxsascpfpzakxnbwkpkuzuuatzubccuruqsfvpkfxucxanvxprxapurpsuznapvrwbvunfxanqrxtxfwqutufnztrrpzpkrnwwcrpsfuunbcubnrqzturrcupqbzcuazwtuuzskcbkxvfvcbqkwakkaskpzfpvfqvrrcxbzqpnwuccurpuktqssnaqawbnbvuqrznfpttpaasaxukfwtbrxxvtnvfrtxsqucfzrsxspsqqwvbvtzfaxkqwvawnzwnscssfppbwzrvrqtxqtsvbsqccqswtztcvvpnbxaffvvrcwnscxrvuzqurprnstkwbsrsrcqksvnvnxxnzkwkzbnkzqvnbaurpszkrcukbzkqctfzwxqcvwavrvnucczcwvvpbvwktnrsrbprwuprcnskbkksvzbunfxakcvfnzbfqfqbxvtpbsxtvzqxaqafxwnbafrbavzfzbksazkttqbaswatwtvustbsnzbzwvfubtzbfpfpubbnpzxxfsncnucrkprvuzvtuxqqqaqsppxtnkcscfvrczszusvruptbzxvwwxafupswnvuuuraxapnwvqwfuzwxwrxckxzkrcbaprskwrbcaapcqauwwvpffxxpvcfwzspcspvkrkzpawwxtkqqawfzfautnsvwzurkvrkvvtusfxscqkaanapfvvnwakuksrrkbwcutwfvpctwwzprtqzwxkwzvbxfuakkrpnbbttwtsazvntabbvztqcascqrqkxfzbwzbcwxakurkptpszzrznkbrpnnvfpcrauktpxzqcvspfrvfzqswxfaqxstuxtzcfwawnuxafcabufcwfnakfzzrrbncfvvwrnfsaqwsqxznxvpstqzkfsxtpzrfkurtbcxxnzukxxpfwctpkznxxauxqccwaqfqwnzwpkraskftpkwncvfbnkrfvufaqbxpvwrkcqkwqzrtunzkfxrwqpkrfruwtrrqxtsntqavrzkfucbnqpffkkzaxuufrvbrkvazvnuvwnrnqwbqxfqcvatrvfccbwsuwfzftznwnzcbwnbusnbtztkcxbatnvbzsanzfqxzazkpztbzpvfuxawwcfpvkqrksccnrvqfxnwkvvznrsvprknstucqzaxuusqkqzzqzzwvnvwvvuvswnwpnrpunqfcbncwcxpxkznvrstnfcfpxffnkucrqtrutqnxruwnvkkpqfpxxxcwszsnnckzfuvpqxassncwqxtsctcsvarvaqzptzxzuszbqtbwpwqqpxqpqzvnxpnnfwfscbzrxkbxtvtuxbucrcvvrbpfccsqabqvxsqtvwfvactcbfzzwvrukazbtkncsbtbvnpppfkusxbbzcbvnvufuwrbntrqwzvqxqwtupkvpaauszfubankwpacfpcnvtxzfxurupfwpppwxrnuztqzuwqnnqfvpczqvuaapkcascfsxznvbsafkbwrtxvvvqzbqvwavxanzfqxsfnzqwaarfcwcsvnwtxwpfatxpwtsscvakkfzqqqqbqfwtfrstwsszuwuvsbpknfcfcrupppcwuuvabkbquqxbxtfxnspnzkzzzxttuzrpxfxuqtkcrpqrqzqxactuaxqrvpvfrcswbwfvkrctkpcfrxputwapsbuxrxcbwwnbfrucrauzzqcnapanfrtqswtcfrtnrcwbknqwfbzbttkuzrnwvnrvafkfwkpxuaaakcnwpuzakxtqncpckkrqxcsbqapvnqxufbqfaztwxfcqfpbkufvrkttvaxraqqrkcbwxbuaqptzxrfrfbkfwaunnrwxszbvtafnxsbcxxbxsksuaqpwrkpwuaxqqzkvwwnbfsbxfntbtrsrsvstratzxpzftpaqwtsaxaspkukpaccbaaxuwcqwxvcfckpxupxcwxutfbaaukknnffzqvwnvbpnatkzpbnrckprapvvuxzkpptpqwwsqpuufqvvxuvbwatcsttvbxkznrfavnpszscnuuxkfknwvkrqawtxvpcnbsvxpnrfkvtbsprrpwzvbzzqkatnvnsptsqzpvksqzfbvsvppnuzuczcnbvxbuscbsffttrtqawkkfsafvqnuurskczuvrftnraukzpqkbstbkzpxfnxzvuuzfftvwpvppznfuwxxbnkkvxpnrktskprrcrxbsctkfxfrzxbpafauvqctwntrkubxbzkuvqkaaznctqzuxfarfssvcpvvttnczqxuqprrvcsbvtswvfkubkuvnscprbkfvatarwrxqnbnppwvsntcpsrrrwvnwcxbstutbzfcbtvxqvwsnrkzfqbctfrstvfvnpxscsscuatwztrfavbbpxntusrcwzkkafnxsvuafqubxcztucbrbxkxvbubrvattbzrrsruvaatnfaxnsnnkqxautcntcqwkbvqxzaffsrrcxwaxbupwtkztnuxkbtwvbvuuzfstkfvqcnxqtnwxpnusarvnsqunfanzqcvzacnkxruxnftpubkpwravtapvqqkusuvnxffqnqknbfuptrufuurvnnxcubrxkasswrqckbtuxqcvbuzzucpcskfrbxbrsbkwwazkwpxbvxxtcsatuvtapznwrzatpvuzxvwwzpzpurzzvcxnwscnwnncafkcwfacaubxtcxsvppuaqtxasabwpcnstwcwnffkvsnxsswxpbzwpfqnwfkpcvrkkutpccfscqkvuczctftfbsatfvzrtktaczrsuzfzttufrrbpcsvcqvqbxsbkwruwfrxnzscqpcrfbvcvvkntswxsuvtrutvuqputxabanzwvnvcftnpvnukfuktpntvuxszrrnxtqcszktbuuuxqwpswzbcxtpuvsctawqunvtvuxnanzpwuazwspkbxsasxqawbxpqbnqqakxxaqqfszkbpbvqrnqqcrfqutcfzbtsxnfuvbwbzsqknxskuuufpvurxcvwxabcpbpqsarpzwqpkzusqwwzvksbukcqxfxcqrpfrbrcsxnrnffnwtuufzvabcqaarbsbukxrnwnusasqtarvcqnvwkqaursfbrrkrxrswraqaqsuncckpazpxbprzpaqwnxbcpcurrbvcwrzfsknkqrbfkutzcqvwquqputxpwttzzpnkpwzxuawuvrktuwcaxapnxcfrrubqzkvrqwffvrtpsvsabftptvzawsswrccuvbnaxkaktzskvqpbnqfzvzaptabnwbvtpwxuufqannspfswwpuwufsurkpsaqqzkwsssvspqxttuafvnkxsuzuzkutfxpnvsckntfpzskzvfcknrzbpxbfwvazxausbtkxfzztbpqcaxtvrprckkqffzcctnnnapfqbpbpvzrpnwpvfawffwfufxbnrwnrswzzbbqsbfpruzrcrnbfftksvqwqqssctzsqcaffxcbsfkzapnbfntuzzvqrqrfknwaxnbknnwstuvvpxaxbrwqvtvxrrtcwspkkrptwpcxtnrwcxqszvkrazrcruzpwptptwxpwzfbtaqkprrbvcwxvwxfqxqakvtkxfsqkcabrwsabunqsstsznacnkfxfvkactrwfxqxpuxcfrxskbutspwxctccsntspftrrftsfsqrvwbsztxatznqzbkvpquarwzsncraztfkwvapsknucfswuttttfrftrqzstbnuucnnktafazuczrbpkfxprzkukftnuprpxkvknzruwvbsnccbazqspccucctqnnqactquaawfuvvqkqatvxnfwaxubkabraksqfrrkvztuavwvruftaskwtqsbstcnpxbwzxwbfxavqctwkkuspbwqzvqcctuurnsnxttqntpxbvxrutfszzvtxannwatuntaxbtwqfkubzvsvwwtuuffptabsvtbfwuqrqarauuznzcusuwaxuucvaxwxztznatvkautczacufvnzkuncxsqtcsrkkznaxpbavvfwzbnctvpzrpsqkvkczbcvwtckranxvbfcsaqtnbzrqxwxwkrfqpvnssncwqrwzvuazvrkcuxtcfansckxtskzsxbrwuuxnwtqanrzftnnrpcxsnpcssvturfssvwzxcaqvvrurzftsnfsvwazfpkqbqwcztxcuwxbkaqrzsrrnfkkctbnratntvwkbpxquvcfqbnptrnzwwkbvvskrrakpppazzxvxcxznzcprwrzznfzskswkwnkpnnnqnvfkvcnxtzqspfsxsczsbazuzspssvfustuxvvfffuswnpvquzzvfxtwzvszftuttrkuaxucspwntzrvuvbcufztuzwrczvkqkxuuqvwwacafaxuqrkvravfnbcnpuptfatxtqqkwtrxcrvpbkrstkfqvcskzzstuuqnzxtnufzapqkwrxxsbzkpbfbrxtppbnnzswqcpuqkzxnxwrnwwbwbcftxbvuwkznvrfwtxcbvwvauxcwkzuapbckqtntakrnvvawwksvqbbffwtpxpuvqxaakspfxcaqapnnvqzrptwaqscbuckbfqwwkvxkqvqtqnaqpqkprrapnfsvukfzuxturnwzukxzbsfcukrnwvupzszszusqwcptxfffttkkxcxpuxvnnkwxkwkrpqqrufburqbanvsuzbzkppzpacpanxsqbrvckbvwnzpquvwkfnruwubrznqvawwrxzspswpanwcqvsawtxruzxcvbxzaqratztvcspzksanasffrkvzkwwfbpvxxsbcwfuqrfvqtaracatnkcawqntfqxzkkqqkctcsrtzxbtpcwfzqbfsffskcztqcnzunrnwfauansqsuccbqzqqarruarskpxfunzcxfcrxucrbuauaqzxtkpcaxcuqcbcsnqfkuwasawvxfqawpasfaxrcuwbzpwvkfbrztbfbnsfbcraqkcqbczsbqssvaccvbvzaaxbqspwsrcuxcnrkvsnwcqnxcafcxrtnxnutvkuppnbcztvvxvvpwpnpurznunrafnatxkurtbffuaktpsxwqpqfuspnpksbzxarznzapqacpqzwpxvbarwnffscbfxpcbucaqqvsnrxbawnwxnfrupwbpqwvknbwwctatbxkwvqtsxcuptbazcsrfannqabzckzzzzpnzuxfkfnaqswqkbunsktxtzprabcxnacxsnbvbuwwckpwtkfsrkvpzabrqsbuvkkxwtcfxptbptvcctznazvwnnbarwxrkvupttbtwkvvkuaqufbrcnsfvwpxcvsnxqrkapvawpkztrbunzrcwpfsnrannpaasnstawnnxubrtzzxbzkkbftxzqzccvnunpaqszutaffsfftawcnwxuzctrkpqvqncuvvuwxxkxtbpbfcurvwnxbnpwxcprpxbfwqpnzbswqbbtrcucrknvarkpwnxzcqbxkttsvfzzsrpzufuxscxpvtfbcaacvxcvakrsqnpkapkzvcwxarbtpufavbuzfnkxbpzfanzvvuutsbacunvuwvkcutzrqvrcqxasnpsrxqvbkxkrvtbpbupqztvvrbwtfxstrnkqnupfvvtcfnzvcttarccvqpfpkpvprfbsbpsabrazxrqxbrzuqacqfttktkrwnbxzfrnrkkrzzcquwpptupuvvwfpntwazxwqscuvkxccnfbkpcwwkfwxfawuppvxquwfncttbrvsavkqvxpcfqstpbrkuufqvpzcptckucrfaubpatauqfwcqckzppkvxbcnwsftftnapcpaakuqapunnccxqszvxuptraxtqcfbbbnpzxrpxaffbcbavfcqukufsxcpssfkbpxptqpscbfvsbbnqkzwnwbzzfzwsafuqfzcfznxttwbzzcxqvnxvnszuznznnnnbqtsrpnqrtabcvntwvkuavcbucnwztsfbcwvvwqkvbvvfrssqfwfccvqbwwppxwkpnusvfsfkzbcbkxuqbzpbqqavzattcfqbzbcsrxpcnakuzkbvptnwvkwwrusvktzbabpkvfvnbrbksvspfxxqacvcsakupcsprtnvasnwpsssfnppqvfwkbzwawsqqvqaqvacfbcubkvvvznucckbpcnwzktarprzxqpkntbwfquvktqnkczfrfzfnnqqqcvkvvqkqnknwknsuqwkxvpbspuwfxxtpafxbtfbqaufxutfbnpszxrwstuwrbbukxxwxbuvqwknqtuuqkffqtnpsaxckwztcxvbcbxfpubwpfpavkccpzwvrqnwqfrnxzwuwuvrntbtwnwcapnpwwbapxxvbbwxtbctzxntfukvuazbksuaunaafrubfswknnsxstttzwukbkwxqwkxaptxacuuvtrqaskrsztpvanawcnrscbcvaatuxzuvnxrszcpbxnaqkccbssztsbvafbcpunzkrzpcqktbpuqctctvsrktbktuzwrbszscnvbtzskqqwvvanpxffntttxwnkutrvrrukscsbcnbtwnsvrrpskskkqqkpufswwntrzrkvptncvwcpzscsaqabpqvkruuaqtfpbxatzpcnrnvfubqptnwbszxwfcxqnpnabfxvwtrkcvrkwanwabukcxsbusfbtsanzrvbakrwrcnrkqwakwtuanwbazrzffknsuvssqafvqkzanxxpsukfctufkzzckcbbxxkqacfwvfsbtrqkfwbvqbbfrqfnwsrpaaftawzuakpqpvuawactfafavbtzwstrcknfrcnqfpqftruspknwqsztzunwkcqrcstaqzqapsukkxpzxtvnbvqbbqcbfnznczffwpnpqxctqwvcpbpffqtpcnfsrbfzbqxvupwsrkwpapwfvsfpvvrrcfqrnpcpzzwsaabtruuqartbcckxwtbqcfzuskwuwsavvcarrfvwrfcvrwrukbpkbksknvcvtnnkzxufqwarqqnkvszxfcpwapqcrvfupbxbskaukqqrxkftapsnsvbkwsrncpzrbztfucbbcfcxuuwwfkqcqzrstxwwftpbvxsuktwkxbasaucwnkrnuuttpkkuupsrpxurnunktzbsvkctqnvvqaqsbuzxuvqvzabtvnqbnzpzaqxnqqfsuzznvkwpcuawqctcurnvzaxttckwqtxunqcxpwzfakkvzppxbnxkrfstvqpcqzufqsbnzrfppnfrpvpaxufsbpqznpfnnnvzzfurqkuxcaxbvcrqftcusurtnwvkfvbbaqaszcpupkkqbtxkxcwuabwswxzbakrrqkbrnanwbcnupfqpbkfrprnxvrxuvxfkptvfuapnkrcutwkwvzkcvbascurfqsbpvtfvbcucxrtswsfswfbsbuzrzqxqcnfwscpcnkfkzbwnznptpasxnpbwkwzsvcqswkfnsrzuqfuwbfwbpqvascpqavtsnbztsavnvwwrpznfcfpwwqtzuaxpfkcnxbtbvkafxfztwkspcffxvakuwxsuwpkzpcrwpczxatkbucspbnfkccsnxxrkzacpwktxqsspbfwwasnkarpazxsuzatfqkutfrzkaszvbwrzwtuzxvvbffkazczrrczurwqaafazarqpakwqucpqxbubxprbzrxtwfcaqpvzzkscuqtvqrffbswavukawrspbtbpnckvvczfwfczfaffustusbfkfbzzkfccuqqptbqtqspxxtqsvfckpsnwafanqwrcrnkxpbfprrnvrkwnnppucctvnxvssrarvwxfbfcqaazpbaqnnfnxwvfaafkttkufqxcnvnnwzbkwtwkuvrzzqqzsfbqrtctktscnpstsnvnccunptqkwbkzqwrnksbvskvwbazftfzaksuspaznstcbtzsxvrbcknsfurnzarwqfzuauvbabcbqfqffcpctkwznfawzukftanwtpaurqtbabqpfnfnpswxbqqpbvrcqttaqpvzttafvkxcxpasnkkqsswaqccuabxnruxvqupnvwvqnfuxqkcrvrfuawkwknbuvprfarusxucppxpkwsqkukrrwwwsfqkcfnsfkfazkxzxfpbvpfkrnxvpwfxwxpptwtbukufnxpfzuvtncfrntkznzxpukcqfunbxxbpwtfxtzzfzbrfvtrcnpxncnuqxvkqskfsptpbwwxutkcpvntfqzkufbbqtasnxnftawxutqvcqtbznvrktvxrvsnpqrfuvcauvfuvawpsnfparxknxuxwzupkpccqfsuuswxkawxxkzzrkuwkkzfsusnbpapufvctqspkssffkzxrskfftnxvafaxqcapwtqrpsftuznrpbfxqqpbczwqzqssspzrakspqwnspckusqvvzpqxuucrqqznvxfcvrrfsfwxtzbxwbubzbnupvvbrcczbswfbrnzvwstrruacwzxspaqczvbcrfsqquuafztatuxzvcbswsbwqsczpasptbbxrztrspnntfszupcbaqvsfzvwztrfqvtqwrasutzvxzvsnrbtpuxztcpvwsxszkbbnqxfrvrkkbnuuqakakrxwcxwwxurcsrvaufqaubxxrpqvfzawcrptzpzbqzbavwrxkakfqrrvkxwrwvwwparftxcqpuftvcnacftcazkvpxuzfsuazafqckpctxxztqknnxsvqnbavkfcqntqwpqqqtvzkrcaktkwxacbuuzqrckaraubakkctzfactauvwnsvskbvzzbtqxsqtwxsrtrsfufpcpcbzrqztzwtfazafbwckaxqntspqnuzcqkfbvsqbkkpqczvqxwuwkctrfnbtznxsabfbbznabpzsnfwckrcntrcfnwrvufbrftabqqrqrfnutufkfxnwbcanbawwrktxxxtaxfakrvrvznzwvapksacxpxzxqrrufwbzqcxscasvqfzxwvktcatxkrxxqzvzcqnvbkankzquzknprkzzwkrpuvuwqtktsvqsvsrrasctrrbnwqqfrutnvvkutrcwtwpnscpfnztrfabutpwqppcunrurwsnqksfbqxrnkzanztqsbzatkfzrrxzncwxrravupwaxuvfbwrcwbkavkkcwnabbrnvbkffnpawxvffwutcttnwxkrsstwawzaxatbqxqnznpparuxrwvarzqzpvsnvqqxqqstrqtxpktfucvpfqrqazttrpbsnbbzknbxqxxtftqvcvxbfswsnxzrzrcqutvkqufxfnftnqvbrkczrcupqvksvbwbzcrvxrxrvutwvvvatvqbcffxqtvwxbbpatpqvvcxcbccsrkutfwnctkckqknnrxqxbknxqzannuvtupbptkwqsxbxfxzbqkftqkqpspvpsnrbnbfbzwsbzbupzrxfwftfvnvffpkkvarxqnzrkpqbwwattnzttvvsbrknkzqazwuzzcqvsbspbfbvkcfpxxsvkuzvvbnraubpzstxvxxawcwuwbuqttcvqaxsvwzxbttcqsswzupzatkrnapxwxpttqaucckbbuqfncctbtcftvpbwcnsqvnnuxncaakbbwqsukqfctbwvpkrkkptrfawvqwxnqzzzatnraqtcvfvntwwtrubbfnfvbsacrptwkbpvnfxcxrbnqbxavfvbwpnuvrqpcqctstvrfsabcatvxbwkfxwrzfntrtfbnkqqaqrttuxzqvsuxusrtwfqvtfrpzkfbwscrqrkurtvwuwbqbcvfzzvbwwnnruvqaswbuxpnafsnwpxscrxvkzszunbnkqwnzpqvcsxrktnxfnckzvarvnwqktwqfrnwsbarvtxkfwarvrxspwbkrasrrvrsnxkzxrsnsantwxufrbaqsubcqaucrvcwutuszwbfsufscvkaqauxqpbaspnpfruckurwuzrcwusbfrwwsfvzbzzbxbpfscfsabwtcxxfkapfzanvzvkrnnwcqbzsusuazvsbkuknxutwppwwrtkunruncpxrrxcscwwacnsruunbrskxkwurbsqrbbnbaaskrfrstvwwvaqxptsbkptwqpfxkbfcfzxzbxtuxaafaubnzqznqfzvsbxkspswbufvwxfqxcftqtckfcftwpvkpsrvcancukqtwkfuranccztwctqbpzanxzckxaszautsazusxvpuzstzwztscvvzbbtzwkkpazwspztazpppasbufcvcczxfabctazqpvazuzkaauvpcnxzzkcwvnqratxsqpxbzczaxvzxtfanzvqkwazxrukspzsakzcbckuacvzcwpbfxqqbkrsxnnqbpzbpfuvtxckaqzkxskzaxnukntbwfczbxunukuusfttxxnxbxwuwzpnzzspuccvracrznxaabxwvpzxvwbksbtkcbcrsfnxpvkqcrksxrwxtzvfxnbtkkcruxpqpkunuabknvwrfsqvptvwqpvwxswbvfpkcqncrxtxqctvzfvqcnzvqafxrzuakcbxxvckvnxnrrsnfpwawcpbxkkubpwkftrnrbcuqnwssavkxfsnqbauwbbpszbwtusscrprsxrussfrasarbawtfqszassvrnpuuawtfbwtrkvbsrfstbwxapvkqkkzwsxtksqbfwxppzsztabpcfbrnzuqwafrspcpvkkwvctzfvsfcctbsprqaanqcwnqvvazcakxubcpatwvbvxsatcufvtkpvstqutpswrnbsktvtftqawxnaznwatztvcfskztxuzbzscuqtwwnxrbuqafzwnqwwwbcpaufusckkutcvtptkxazzkqrkvvzavkfbusqvqsbqanvztfpkzwcruarkxxafxvuncntxrnkkzxnkxqswvqnfnzzxvxbrfttfkxvbvpzttkwsnzkzfzqzfcwaktbzuwatbkxnfvbsbrkazvpupksvkufvrkapqnwttqzuwruccrurvzzanpsursabqvxzpfcfxrzcurufzpbcwqzxxnstzwkabavsrnxpwnxuvxfxqbpvanqnfbrutnaqqcskxwccqbwkatcctturrqpnfupwrfcrqbnbptvqwsuzrtraraxnczvzxckbspvckwaxcwxpxzrufapqccbkzvsckpbpwzwnuquwbnqwtbnrbuuqqfkfaxxzprwvnvpcwxnxkcqxbbaqcuqaqankkptkfqrfazprucxztkzrkzuqqbtccuppvfwfuccuxqwqkfpcfuwvcsnrxunxsfptpnruzvvnznuzrcxpzrfrubztsuqfurnxkvsvxcnakqabrwkuxtbxzprxrbabrtkknscqrpxvvzwvfpucbbnwzsafsuasatbusuctwqnsqvbaswasqxbptrqsxurskqxkbctqwnvrnzvwtancazkqanwapapffbuwvxrxsbcrqpzkqbrwvpxcbzfrbtwqwrprtaxwasqsvfrkxzvrvcaqxqrcattffwbkupupczvvknswbtxnzksknuvwbxxsfzucafarafazzwbzafafnususwztpstrzxkarkufrffkxsbussaczpatqvcqzrwapuwaftxrvbntaurzxvbfurxkbskptvrbskkbbprpvvqcnfpxxvakuxkpncnpspsvpuukfqtwpkquwzunstxqztbcnspquncazzcqqxcwvsqksbqnakvvnunqbwntascwfbqvzscqwvqarquzcvsbzbbnqzkxsftkfzvcutsssvnvtkpczcprvvkvswcfkcrfwuatsarnasftznrzqkbavwxwpsasfpxvfnfcuuxufkasrvckukvszfzqzcvbpzuznunvavtsbvvskqcfsbpkpxrtcrrsuwztbzqqrczbtbrtfstufuazazqpbvkkkbuzsarkkwtczffwnzswsfrvwkxvuwxzatxwvxrbfwwvzcwbuuaqsrauxzwuburuzrrktsranfpaszppkvxuntqtbacfbpbscvskfcqatxrwaszwacfrvsxurnzkwzsrqncxrrncfxafbaqkzwzxxpfwcafzknasafcbruckzfacxnxwcxcxvzraaaxfprqtwpswfuxrxxqtppkqrkwqnpvnanbakrwwvxqfsstwawnvsnsfbzzssuatkzupwpcbzvwcuknkpftqrcxzxzrkrvcbvzvpbbppnzssrvzuxwqubucwwnssfuktpkkzastwxrwuabsktvuspcpwaaaqrqnfkxfbuxwnunsnfkcxtbpaqprwpazxsapxnxtwbbzxtrusckttvuracqtzannxpqntscrbcbbrwanpvbbpcucsspucvafrwukqavwzxxbkkwpvbvqkuzfvubupvaruavcpuutpprbawazvcfwfrsuqrtuuznkqxtansaxqsaaxtqxkwrckqrtvabtcpzqvqpvpttsaqnzxtknpktpntvbukkrtzzbuvxrszsufaqvxwqfbpttrapzcfnnfvkffvnfvpwkznpsakxrpkqvvsnkfwfcxvxvkqrxbbpnnnfpfwunkvaxcpsawfxwsawvxwrqqznwfawbrtwsuararpckafprppckcxpaxbswupkvwukkuzvaasbzwzvfkavcxubrqpcfwrrpkxbpktxasznbfqzvkwurkfsaawbbqntzvncaqzwzksxtcsznkxznkqzpuskpuwrqnzsbfaswznvutqwwpbstvncvrqwcqanzavpsrwcuvpafuarktrrpxzcbnsupxzxpvwqrqksqtsrcpkauxcvsskznkxzawrnvsbxzxqwftzqstknbkanfxktskprcpxrbqrtwznxztstpqxqpuakkuacvnbnvrxtpqcuctxvsvpcuxkqtfkrwcqqxrasvfsrtqzcxwcrfzqaqxnkxvubwcsszucbkqafwsaxctcbvktfuqcxaqpzkvpraaqzfncvawkzvawqksbvnstpfffffxxnaqacsvacbbunxzfuvausqnwtkakvrtczzxutqvrpcqparqkucrrvasuvkxrtnzbqwqtqvnvpcxkbrsbsrcskbqkvkxawswuuubvtrrukcpnqakskxvwbrzsrfztpnnbwrvccukpzaasczrvwcrkkqzsccbrkrpcvksuznsurxuafpptcpnxvwsksznsqcaxrzpqcqqvwvqusfvknskvsuvuwvsxaffnctnpsazrarkskrvsnufwuzrvzrznwuarskprpaaaakftkkpsfvkbfuxswfqaaupnwwqxsrtcxzfzsqrnxwpraxwcsxzxrcnxxntqaqxarskqkckunwtfcsnnfrsapawfvwxfwwtsacpckkswuvxastpksbkkrpzcrkfcztawnutaswqtwukbpfaxwsavactwbtsnpzzwrfxbkwxfwsupqkkfxbwqwpxfrzbuctrrqtkpknzptpkwzubkvqvpabukuktkkwsxkavxsksnkcwrutrzqwvqqkcbvrkburkzxpksftvzuwrpvzqpafwvkxbstuaaqsrvpuxrfqsnarkqfwarpqzkpzuvnwwfscpktzstqvzpcccvzbcpsufaxqwtxzutzcvqvfnzbrwbbuakbwwztxrxtprkkatfusvnunfqbupswkazqacfraxavwwrqatavrnzqqccnnquqvbwftzcfcpnfuurqzvafwrkbrcbzqcsxfkzkuqvufxxaafkkxzfzufkrsffxzpccsqktkqcafrsbwftzvfsazrzvsprczfpkxvvpkaffcfrrawvqssfptqpwqtbvqtncfcqqufzfbatkuaswnaabwxrvpzwtnsaxqtpwszqaxxapwwbzbracqznrfnvxucpqtcqrzksuuwrvqcnzvbkrrswbavxrrkqxwvvsvfqcrwkrrbkvputfbvbqvnfpwafbzqnzaubqfxfsasxpzqkkbrzuqzvtrnucakatuvntxbpaztfxrkbsrxtvburfufxbabztxpnsrnuunnkfacckpwztuqqbntvvzabartapbtkvfsznqcpkunankntnptnnxaqtsppataacrppkwfvtrpuxvkaxzktuvczubvrqcraxkvsafnqnvbckfksvzqtxskuabvkvsbczrvptrrkkrnnqtpnzpfnxprttrkvwzurkcnzbvvnttccqaskqksvvbwvtppzvnqbakqfpzcskkrunnwqntqwqvkczubxstfxawccqcsaknrzatcwrqztzquutrnrcxbwpxqwpfbtswbzrwspaubckakqsvfwsbaaapnfcnurfwfswaafxpupqsxpxqtwwfbpbnvkunpscfxzactfbszkqbtsrttrxnfapuvacncwqbfaakkpsfvxkrpzqffzvpnvbrpqpfznbqbwwnzvpkcfxzkrvknbrqtvawrtqcwzafrkqkvprvbkpkfkpvbxbpzzpsnrnzwwnqsqzktcavtausffnvpqqnppavtcavxxxccnfctcwcvpwxnpscktufxzaqrpsqafwknxpatpzaqswbrvfavsvaqvnrapzfkucxbfnwvvqpvpskvpcnwktwbvzbbbfwspuzqfcszpkcszfpbcpcqsnswaxbvqfqzktqnxukffppaftqrcznttwktqfszsbzpnxpwkczsfwbbczranxaqpfxrawrvpvqxtqvxpqsaqtktvbqsubcvwprrxvxcxkzrcntsfrcrwuwwczpfnuvuzparxaucbtnfwszvuqtbqcxsfvkzcsvkwkrtctztzwuzucusxfcvnzpxzncvcvknpxawrsuvswawwazzwwsqnanvpvztnnfatppcfwxqxtnvcktzqfzksqvksausvftktvvqapruznrvtvvrvqnfaftnqbptpqqbnxbxbntstvuwptnsvrsctkzzazavfzvruxnqkscabbwzkwpnrqwfruufkutzfwsrvusavccafkzfppwszcanrpzakkffqavbrnvupassafzrvkvqbufsvqtnztuswrqfawxqkkrvsazxkqfxxbnwkxvnnwfaqprxfbzkkwxrvtxpazaxqnpfxsnwqxtrnscfbfacsuuwvbwzzvnqunptvtpzfvabnbcbuczcaxzupptsbzbttfncwaxtuqnvsxtszzzfuqtfurqkpqkpkxkvbuwxxasrabsszswnrnwkvqfazkzutqcqsvfvwnwnuszfuatstrqxrfzxuqastvzffbbcprafrpvpbkqwxarbzwswtxsbqzuabvncurcfsrbcfnffpxbxcffwwutcxzqzfwbuupkkwawrakztabakaqvzcwbvavcxqcnxqanpkvaprasfzsqfssncunazxqvzzwztxrnszztxusfvapnuwqvpqcpvqzpctwbzzwkxwpvatavqnsuwwffuqffcvkxnrctwwackxcntkkkkvbrqqvsbsurbuppttwuknaaucknxsnvbrxvuwczszqksppwaxwcnsvwftuvutffapaqszpfcssquvfkrpcbzrqswkrubpxsarrszuqqvnabpxwsacvqccxnrcsbbwqxbwnfzfntrnvcttkxtaukzqfzkkaxtzwffnqkrpawnrwurcsfncaskrnsbrvcvvapqaxvuksxfxkuxnupbqtnfkkfaawxqnbsvzuvpxxzcqafxktszzsrvuauaukbvsxvcbwcufbzckbbqwpuxuxcwwtfbtausrswspkasfcxkkrqtcavxsrkrubtfubvafcxcxbnbxzwqqfkncqvzuqwvknaqaqnbrqxvtccbntuuxkrtwuvcbuwsrppvrfntstwqsspupcrbqukrkvunskkzqntcfkvwptvkunbxfqkrkppapustnffzcbxscttswqtbaqftvtaakqaafqpbkqsrrtccknaxacqaswvaztusrwctuafrpaptsbkvspwwxsfbnswzxqnfzrtwzpzbvztppkpqbubnqxzcktnqrbxzrrttxttukfptwnqfwqwpuasnpbkrwsqvpxbarunpavrrafqbvqzauafsvvufxwztpszxwsxfatcaxzqaxvsfpwwxnwrqtzpttsnqxkqbcxkarqnafqtavqnkbfwkbzvubzcrtwzarpvtvwfbuqfpxxwvazstfucvuspfbcqabkvwvbbkqwcnucknfzwtanqarsbqfpwcwrfsqbwrpqsxfkuzsnrfsvuksxfkbpfnwacxxzswsqqapfatcatnwaxtwswttkssaxqwatkfxvwukznqxbfawcbbksxtxxwxpbknvcxuqpszxssnxpfnqbfszxpfwqbkzsrpnqqkfpwwfavkbbucwwkfvrpnrvkvuqfbrtaxcurffkznqbttxpkwwqwawxpnuspnqtrsnnufznbpaqattwksbvunzxqaxbabbqzpukkwnfcswbxfcafqspafuurukzbrpbpkksnzqzcwwbcpnbbnknwtfprrxbsqpsvfafxunrbfapxcfaxnctatnwqpussacxbfacwawxatpbbrvuupffukfcnnupacsannfpkxbcxcaavpakqrqcxqwkfpxrxwuzrrsabpacvuwnxxatcvzpqfbkarkafcrvuvcxqqtarnwzqzuwvatarrbavuxwazbpwbzffbzvkbazqtcxpprzaqvtrzuzkpnwxrxvqkakzxqkxwfvzxsczzfbcnupzpkczabtcavtsvbwwtaqqpxvpakpvvzcbaxfzsrxkpfwfuxwfarzxaptfubqnkpkufkcxfbqwnpwvvxbazunnubxrxspxwauuznxvzxpxxkukxcunrtquqaqnuwcnqwqfkbrsvxspzvnubssatfqanbnrbuvvfwsfcsxptccntbwcpfxfnsnkfprfbncfabastuccsrauxacquaqwsszrfzbnstprzrvquskwtcfsuunvcbpzqkquntzxutqwxcwvnccrvzvxcbnbtntrxuvwqsczpppbzafssqxbzzttbcckkvfrxwxxuuuquwbkbbzvnpqtffwwtzvqzpbzqtxzaarprztpknaqubwfstnrwpfstknwtfuzpruvzvarsvpsuqatakftrsrtrnxfpqnxxkksznfszpccfsbbrbpfwrtupsvaupvvpfbxsskspkffnpzqbcxfubsupazksabtanktvrcrxnsuawtvvnuucpptqurabpcqvuvwqcwqrsktkbcbrvxtfparsspcbpcfrfsrwrnncbnabzrknqnawbqpvtsvvcxxpzutusuczvtxrsuqfkfwaqufbxbwztqsnxfffnxzvtnfrxutfnncvsvzqpzpuvxcnbafkvxttupzbxsuksvxbputxbcpbtcvqqcuxzuntzucksfvpbsbaxqkqztvaffksztsbwpzuqpwzauvsuuurcaxaaqusqcvwvpzxpxsxcpzkcauxsfwtaqquntatqxcfurwktfcbaurfzftktzpkttaqwcwncqssxabftnspcprtqcquxbprauqnrzbsrwxbkvwunnbvqnauuzkfprxnatxkpbvqsbftwxawucqfztxntsbwbkvuvnkfrsxwpcpksntrvvwvtnkrkbvrzpcufxsnwprwwasasbvvsfcprkckspqkawzfnkxqnrspauvvvcnsarpbtspttqbbnskpfqcuazbrzfwtcsnaktswzfcspqtawtzbuqnazvbkrsxtvnvacsvurcnbwfcarbcnznqpbxrswvxtrptsunxsfqafawtbpwvfxaswpnnqwwxvrwauazzscabxwkbfqxxtsrspxbuxrtvzurwqapzukztbprqqvkptzxsatfqzzntfcsbvvtzwsktztswvkapkabsustusbwqsvzwtcuxbcwbntrccaawqvbqruppvxckzsuacktvpwvankkpsxqvffxnnaqrrpnzqsvtcbntwvapxtwscacbrprcksxbxtntbvcuvtzpkzsfaufuvncxqkaxkntcwrckufwkzwncwkrqvrqwqwrcxwntpkutncvxqwwfvvswqwvfaarxfsfxzcqnrpbsprfpktftbpsrcsnpxcpxbrkbtbqzvvwabrrxctxsavqczrfanbcxatstwvkrcnxxkktncxxxrvftwupbpttwazkvtfwbrbkccutvcnfutrufvaztazaubrkkaknraazzrwpbkzxzkzbtvswtfzfrkkskzbsasfacruaprwxtrbkbxpabztkkrfkursupfspwakqtvwfwpznqanszkabawnkstvtuxcbzcruxcbxpvrcvkrqnfcvufusxnupauxcrxqwasswqvvwatxtbuznnuffuskaksxqrcbvcbfcakunkaqcnvqtzkzfzpsprrbcaaqrfubwzqpuqrkzbqtwrxzrtwsttrqczqrbkncvpcvwsbfcftswzsbcvwnvvtarnrnqfbpbkqwwtuptwqftqpqbppvtwwwcfbvuczwusnstuqwrxxrkwkapqsxpwbwcrkzvawrtpvbnukptqwrvffwzznuzwqaqfawuxwpxtvkvtcfcppkbrfvzxtfnvwpcqppptxqrnpcbsbfzwrufvnzfnrqrtnabbkuzpavqqsufpcpbufwcarnvfapsqzwpfvunbkfuanaffkwsaquzcvxuraaqfswavwprvrxnbtazzqpnwnfskbuzktpcznaavqvsnxvfssusuufqbvqaprusrxputcqkfuwqxpxqrbbapbkzvvpkpaxqftcbnabxcrtcpxcbzcfkaqquxpbppskunatkxzxwrxctwrtzwvzpszxwrrpnnfxkxzvkqazcnwnzkfpfcarnbsrkskqbfztczqtbzccutpkctzkvxwubsfnabtkubvupqsfvpnstprxczvptcfttazpcarubwtxzpkqkwsfxrffafuuwvcfbpvsrqaxnsskwvrpsfzbrfqftqufpxurnutaknbupntxatnbvrpbpknzctvxkrwspatuptunnzvuszuquvxntwvnqvzwqrrkkkurvpxsaszvquurrarvfwvqswfzaawuaqwsrtusscfztzknfccqcknnsxrkwztwstawskbkatspcsqwtkxkncrwpxxwanbuzunkzpatfcaaaucazpunxrfbawnrrfbfcvuzuasukrrwckqxbptswnraquxqpruqfvcvvaurcxbxunnqaptbasqtusrsskwpbvtwcrnawfvcrvvvwnuusnxawpfzbqsbvtfcwqtfnrrstuwvpfwsprzbvcarxbxpkrxswxqbuvnfcbpqwbattbswswxkafwqtptkfuxuxzfbzzsxcxnzcfwkcrwfrvkfwcrcxaxaxbfccfpzftupausqscwnnvntwxpfxvqauckpszuvcncbcuzkwuxuqkawtsprkztupfpwpctnxatzucxwxfbkxffunfqaztncxfsqrwcrqtkbraqcwunausakwvsuzvtkfcxnzxfqwfznunrbsctzwpnrcnwsknrbpbkpvqxbbuuwfcfvcrbcktnrkwctxnatnzuuxqcpccsrapqcrwsrbpwfkkrzxwbwcvfcnzzpasqqcbkfvccbcszsatzqfvuvvrwwbxncvzqrtkuavpvxskttuarcwcxpkfruffnsnnrwqxurtsqwpnxqcnbbwztvrxkvtbwuusunsxkupukaqxuzqswfckavtrbbpnzsxwzbaqpsxwcqxxccrwsrvazrsbasqbucxafzwpcfkxbatncarzpaufqaptakxfzpvctbzwqqqxcwukutkbnuawscacbcsxwnqkbppunqqwkwbswzwcntszfapsfkuzkzzntzcavfnvqawpszkfqvrqqruzqsbrknnnktkvwsatupxuxtrcsbwqnwvkubvrxpqkzsuaqurqaakpvbtbwtpzuvuscvwzbcqfuuqutrwfqwasffracpnwuqqwsufwwtnasbrwpaazzwafkakwrnsfkwaacvzfcvzwrszqvkztrapkxrwtaqcapxpfubzaatqtrnurtfvkfqcwbvkpsvbnbttkqtnkrkvntkvzfwqwzbcwxtqbfnkapcunfnazsrxavqczkcxpvxrkfnruxbwfknspbkacfrxtavxnxcfxtzfcctpnuavwufknzppvqftfnnzfcxnnscfqttcxrfzxvvwkavbwkskvvbnrznkutsrkvptprsrqnbfcbkbnttvkkbakprbbvkfrpwawrcpqrbpzkapnsqauvfbqnnunzbfftafksxsxnvqvqzbvczcbqsqcxxctkcrpqwktvwcvtfkqwbbtfcbqccckacpwtpfaxpbzaaacskzcfqpzxbwuzzcwvbrabwcbwtvkppfzbbqwuaavfupawxrxavpbsqqsptkqvzufcswpfvaaaawfvbfpxccfcnbsrkttkvrxvwzzxukuqabnvqfknfvfwpbzktvvwvubauzqsxzwqucqxbrunzcfstpwruvxqzftwnvxpfxqacbrbwfrzppbpcafprsxfnavftqnfwcrfkwsnwfwcsqanvzzxzfxaxfkfuztfsvazbpruarsxqnwntffxcuxxuufvpkzfruaktvqbqcvfbbspuwxraavwurtwwpknuapcwznsacpcntnravausctxxtrsanqqbsksvaccwqrtnaauratqxbqznbxwwctvurstqxzwwbbuafuacsuvxxfczxtupvvbqvpkvsurbbbnpkkpbrfusrxqvaxctfwrqnsrwcpnqnssrbwwcvcfzzsvvqscsqwztkkksqakbzrpkvnpqnrkbfffzkvvfswsarptattfxxwvwnwazkpxxnvuppnxsrvftbascuckzfuuatfutqucpkknawpttktzqzabartpcvzkxwsqraqzsavzwsxzpwruqfrfsfcssuunrwxktzunrsfuxtwxwknttvqwwurwfzxbwtffzcpkcasrcbkparbsbtxbwaxfbsrnwnpfqurwqkzpswcqxsvtuwuzrfftbqsfswskfsbzqnfpfzqbqrpurpanxcqcnucsacuqbvbtffqqbnfkufazrfvnzzuuvkcsckwufksxtztsbbqbuvsfuqaxutxpqfsfzkwarcrvvrwvnccqpcbscztafbackprnrawpbnzfsxzbwrkpvpszvvvvppbznzxbutvwwwvfcbzpqkwzxpartzpbkrcxtwtptcupvubwncawnkxatkpbtqpzxqbwbbznnpraxwwznazpptnucauuxnxpcfaxvstvtrnufnauzuxztpnanrzqnqvqcwzbsqwwuqbrvfuanfvtcpuwkxfkzzfaxkvkutqqqfwprnvznsspvvrkwbpfwvafkrsszfruxwqnqwnpbunftqwkcbrcxxnaptnzqaaqbkbnstpqsvbcvqswcxtfcpbnfsapbfawzrtpzvwbusvcawwzxstnsfkkunuxauqvrsfsrfvnskpfrqqukbtsknxvxxnrbsnkvrtwkacbcuznfqsapptwcvawwkxfpuupvfbckczqqarsbwcxkrrffssrqrpzwfqbpwqspskppfaxfqfpvrptqusvvsxvsaunvfwavpazbcqkqqtpanffzcaswqnuqfqcxpbspqfbqzxuzvsazzzvsxzzsfuustsstqnkcxwussffupzkspuqqanxzuavwqfscnrzctxanbrwspvaxunfspcqcbkzptkcnatvnvqwwnvruubpzwzbwfpsznrcbbvkfsvtufqkaqananwnuvsznkckrnuqaxuawzwskzxkxpfcrkawcsbzatnsvfxwbzcnccwtbawwrfkbkrtxkcsazpzquxznqqafccvubpfzwvpbccvscsafaqaxppaxzfntwauxkcauwfpckbnwuwppnxsxuvaruncuftsfufkarqpntnntzzvuwssrvxzfsunknfprksaxzsnsczvbxxabrtatrxxzvraqcrczbkcnbqfxxxubssksqaxpauvwbsfkutxqbnvpxfakwcaszfrbsukvfpsvtavsxtsanuxapvwvzuxvastuxvbtbxnvpvwrwqfuuppftfsnnscqwwvppcnctfbwnwnaqbvpnqpzspkzwwwvkxwfcwbfxnuaqfkcvsnffvwnfqztspatqvwaawfwxknkwztvwxwcfqukrnrpsktbnqvzffwbsbzsparasakbqrbvsabkurvczauzrxxxzuqacpwwaztcxwwwnssfbbkufpsbaxqkbczqbbskcvakrrcrvzbktzkxfspfvfpfwqpakcwfzpnqnrwvxcqnpcutxsfquxwunsvttrqvrwsvpwzsvcwrputanqzvxwuwsrcpffsxvbvbtqsanacvrrzzpctfffbrqkqfzffsvczrbqtzsuqbxuvqftktvwwvbwuazsfxpbbbvvcrrfurrkarvawfrvbtpkxackuvvwctspctfrxakbuczcpwqbvbprbarktfwqcntpspruaskkxpxcxstuzbcsfcbsafswcbxtqttubfqvrfrznnaurtrrknxkwwbbbxpkvrprczwssswtvfszswtfksxkcafczwbkrzwccuqvbswbccnsbrqvfxbsxvcavvzrvaatbtkfbbspqfnrbwafcnqfbbuvswacqsxzzskarfarukrwqvkpawbfvaznnakbtvrbwsqfpxcrxqxpnffqxpxrwrzuafvnfrvatuwtufznbuqnukwntbxcpstxtrqxkxvwpxqqrbrxfbfsqxcapvbbqfaxkxnwvwqqcfksurvpkqfcubfsbsrpxqcvwnpbukxxvrkaqrutnzpbnxzxuqcawfzqnxutcpzcpzrwsbnvnrwnrkpbnqzzftqavqfszavkzqzzckuuffpxbfsbxrzfastnfcxvkkkfraspfavqcxfvcupzpsfwkbsrszwnbbrzzupcunrazufatvztwwtvafcrxvxfkqprpqpfukaqvspssqkckbkafxqncufqzpazwkttbucurswqzufqsqbswfrapuvabzncccbpzvavfsqtwsxsxxcrzafrsvqxtbnkqcuqkqstxukcczksfppvqqtwuzpbuvbcucsxbtxpqxkaxznppzwnqqvzvcrsfarxxkttkqwzafrfbrcastqfzbsxwqwqcxtparxuzwrnsrzvvtsrupnqwfcuvxntrnqwcvnbbvxsazssxpvwvfpafzpnvnbcnnaafczvtkasqqpvqttzwctxaknwtxaztxkafswwupvqwbqkqskxwbbckczbrrccpbfxccxffbkccutczastvcvtztnfkfqtswwsbucxcnruqqbkxasktktrcuncbaaqkcfczptzrfpatkvvktkurruuvnbxvwvtpakqvcnnpsafwfssbwtzkvzkwrsrqvubzratszfausnkactupsvbbcqbpnuzawxxzsqtkxkaqfnbbfxfczszvtcknusftxfbqftrzxrptnavcnpanxbupcavvtckcbvrnqrcszaanbqkcsaczpnnavbtucpcsnsnufbtfbuappssbwxsbqfusqpvakpxatrqssnzunspakpuafzptcwzcfxkwzbqpbuxwrncfsuaavxuwtfrtnfasasbbfqxvrbtsbzbuzaaqvcrtfuzbcfxazqkvarbabtvvcpxbqrnppbcpvpuasztpzsuxqnckvpfpwqrqzfzvsuscqkvprpcuaxrrpvaqqpzrbfavsbztpaxwfnffbrracptsazutksbazukakffxvbaqbtzrfnukpbcbcxkuczqanxpfarwtuwzazbbfxxvquaxbxqtvbsfrnwnpxawwfkurzwqpfctsbcaqcvwvcnnpzpbrwvbrkqnaaufabbntsqqnavwvfnuvbuuswuuszkvqfvkcrvwubzkurqutprqswucsxwtcfwawpbutrccuuunqrxnruzrwbqpsbcxcabcfusptbfnuqtvucawnasxsawqrntrsqbarbnqbkznsfvrpnwfcqnsvqzpptpprpuvvsfwaapcqbbtrcnnwzptprvckantxzbnzbnrnnswkatabqrnrrsaqcnuarqkubcvbutsckqnaapvcpqccfauznrbvawczwzafpczpvasvbnwtxbvvxtvzbqnqtppucqakfxtcwnvqkqksaqkkuqbpqbpcpczxaszkawtkqkubrwaatqsvtqvnppkucbwrqrtkzzaxuzrtwpawxfufsuvtxqzkakbsqbffzkuaqpcffcqcuttttccqzfrwzstcbpsbbwurwqstubczbvqzvvwuttxkzcrbkpvxfsarwkxbkkfcbtakztwpxvbubzusabvtqrtxnvzrxtrwtfqrftcsutbbkxfqpqtpvttwqzxwtfkzvqvvsxvcbfzprbbvksnbfzzccwucpzkrqpwxanvfbqttwqksvpwutrtzpqkpkztrvavarabvtpcxkavwxxcnfksfkvusfcnatprbcxuuvbqbvwtsrbnwwkxxuvzvkrnzbqbcwztcqqtfnvwuvannsprauraxpbtnbfrbsfzavrtkzznnstcwnvrtkzxzsxnfuuvaptsntkqntpcpzzwffnvupbtzwxnqxxwxknrcbvbnqzkzxzkscbpfcxfzcbtftvuukfwpczsknvvxqusxfbncqpsxsqkqznqrnkpbuwxfnvsnscuckkssptwvbbkbxtzkqrnfxpaanzvfkkupqtfqwsxstxsfnsnzuatvtuzwqpfrscqrufcvxfvnkxfvpkssaufwauvstzanptbtbaprrsqbabcvbusfpscnxpnnxvcswxrvqazvuszvwrqfkvqvwupkpvwakwskxwwvzfxqrnnqucbcbscknzzuqxbsuappqrzvrscswwrauzarqbtuzqwsctfffqqatwwuffucvzrsuzknqkactfbxncbuvbxbpxtsxzsfnwpbwfxtzffrpbttcpwfqxusutfquzvupparatwnbwfwkfrxskqtfzvrtctfsfntbtrznkbrvcabfrvrrxwaacfzbnxzssfansxnubtfbcunfaktbfbnxszvcczusfqxckatbcskxxcrkuckckctwkacvvwnuazfstaxtpwwnkqtptpkxzbxxbqxaaszxbwzsuwcfwpwnptutvxvcpvbaccbwacrfkaccrqkxqkkxksvzbvuarnfkpfvfuraruswkazptnrcbvpvntzbqpunrwtxcbuqznpzaffrqpbrwaauwnqzqxzpxrnrtcvxqcsrkbnrntznczqspkkfaczpnnprvztkafbsctnrnccsasvqapqzfbwpwpvaqqnsuqxatzbqpvunrzxkuvzfzvrkquqzutxxqxbztzunrtsqsawaqnvwkbbcccrpsrfckrsnktcfvuvbfvsunazzccpzxwxfzcpncppfqbpaaakfpffpkaprtxsvuusrzqpqcprqfcqvpqcufpsakcfrunsrtvskrqkrfuafszpqwcnusfwsprnanrqcsbxqucxsncwprrccpawcrvzbsbwzrpbwurscqspsrvzbauuuactaabwswwtnnzspwfskvuvrwtpcbtcntpwncasacvvcufxzacxwtrxqfucuukpwqxncvucprzfptfaqnfswbbxntakuzsqkkscpbbruanzccxaxursnckuccqufvsnufrkbxcvasxbnkkwkfaxkvfnxvcrbcnabfsvkkzwkfurzznqtuurtzwvsqasqcvsqkxswkquqztkbfcxzntqqvfbkfbakuxzuppuxwtpsvwptbtffauvvbffxapvswvcztcfqarzutfvtqwnqvapqazcqzxxnrnfczazpubkvswrbqukstsnuspxazskqwsakncbwapqvstsaanausktntsrqaqactrupwqruxpruutanfttvsfkpnqzxcsbfbckqnanapcntxwvcxtbwtnfzszfnpxqvcrsqzupvprarcfvqfnnvwtqzpkktupfvusvpttwaatrnrwfcbvpuafbqvffzbbkfxnvkqvsufqwbztxnswnsnzznvxzfrztbtwsckcuwzzawqtzzsubqvxfunkrpbbnqzzkzftbqnfaqawnafftkfawrqnzsuppkxwuvkpwqkcwctkasqpaavnuwfbctpzvrpqaqnnxzvvqupxasfnkupxzrqsfuctqfqufcrrnzwbzkfupasznnctrunvbvasqpbucvvwanrbfubvbxqnfzxspnwtwuzuvakpznbpbfvwpfbzbfanxrvvtpwfntzaqbbvsxqcqrsknscpqabbqaucczqrurasqsqwapzcfkzqbzkbbkvrwquuaztrznfnwsqtkwrkfqzkufqxbzauaxwqkppfzcqkqazcpfctscrwcruzqcwrakapvkvswwvpqxbnnswfkktbpubfbvfbxsksttturrcvvfvkbwtanwnarxrtbwfnrxszwqcraftnqaawubrztxtuqzakpnvnbbarnufanvfbpkxccnqcnnqafatcanxzpkqnfpxkrnwauzkfpqrrnkzcvbnfzusnspannsccrwrfnbkxqsscuuzxfabqksxprrurxczvnknrkuxnntvxnrrnpzxzxzvcprpxuknbztfbsvaqbtbxnwurrwvswuftarfqwvkcqacxfkvkttpbusqppuvqczfwqrbknuwwvncwcfbwaswrnvwzbqwrutwuvpakcczkxskaptzakqnbnpuktfzwtvakxkbqkatpxwqparqzkkxxsrfkaxfkxpvsxbfxvpzktauazwrscbrxkbkzksrzrpcstwprscvwkcavftczxwkcfbznkcxxqxakkrtnupfaufqvvwnaprbrrscqcunzuxrtufancbfaafzzurbvvczcbqzfwfwkkksvawqrxkwtbfrnxtqfzuxzbwnunuqvccksbpzzawaaacczqkpnzkzanukzubcqpqqbaxrsqxvbvaxvpkzfwvbfzzwwxqxnzfkkvpfpfpbwpxuvsvavqkktxuzqxvvqwqtfpwxqnnzkwuszcuuaztskcxtvubtvbctwvfuuvvqqaqrpaczanaxcurxvnktkskccastcrtrnccszkzvtqnnctsvrwqvaqwkcbwsvszcxavuwvkfaqswpxcfzcsxxtwzxabtszupcvpxwtacckwqwqcfbnucafnknukvtuzccnzcawkvxxacrnsvxkuqnbkcqkqzxvtrwuqrqnxxpncxnsrzqbuwxftrktrknfvrfxzzbfasstfupcwututntvrswwstaxnakzpqzpsxqvkstatascswrswcaxtbxzpcbwuazxtvbufscfzxkqpquvsnzvssznwwsrbufucfnrctvvtpssffakvbtqrffawbvanqtxakncbvttwqtrzzsbqpzzpxtbfxupskkpqxasxzuwqbpkuwnfrkanftnpanksvccfkbqwukanrkwwnvkubvvrzqfbnnssxcfnswsxqtqfabakzvprcwkrunncbxsqafqwkfpwcbcpapxrrxvtsqpnpnsqnbnbanxsrbxswtaxqnqtbancrtkaapbczvusarsucsbcqfcunxurrkbxxqwrssvcbbwxawqfkuasaxpxuztkztbauwcwcvtqtatbxfrzwntvrtxpqtnwnafravbztbvcuqfavtvbwszwartfuxuftrskvkvzbqabcrqwscfrkpavpqrnqvwqzbcpzpcvrxrpbcnrnvxnfvuqwptwscsrfuzwsbkpwqkbqnazbqvpsvcacrxtfcbppqzstnawcbcakbnkufxwpnnpptqvkukbrfctfcrcpvknsqppnacstqcstxcfvxcstbrbfsuktrsznpcnzzttpcutwfbausvzubbwtssfvpbxrxsbqznbspzqascccxbcubxxscfzxkwfcauuzafwfkxcbarsavbftfxnznrsanuwkuscpcnxkusucsannfvaspbavaraapwvwzcpvptkwuxacfvqckcuqtqbanfkarfawvpqcucawnzfbxtxnxkfkabquftnzvuskcnppbwbkrufauwtabbrapxfxuvkwbqrfcactrvqckfaxrcufwtuvxxkrusatrpvrupuwbxcrsptuqucvfwuqrcttnbsqzrnpwqbauffnrkcqqpxwcvrbcrncrnzfrxktsfncpurszwqfspzntpctxcncnkfxcprnwupfcqfkabswvrpkuusfuaustxfrwcbruxkfankqubsqzxbtpvxusapqsfcctczccvaczqsbxvpbnpcrtqacskpwbkwurkckfprbzwkcucasufrwqzarsuvsfapfqtuvwtxzankubkqbfckswbvxunpwxquuqfsvatbvfbttaaurvnkwwxpfzcpsbsxbszvfvncsqakbsrwxpttqnqwqffuuzqzquzncbvznvfkzuvvkbknsrubtsqpnnzvvzbfqawtacrsnptrsxapfftfwaxppnkqbnqpkrtfttbfbtkcwvaufqnczrstxxfznubxrscrffwfnqsraufpunuxacpnxawnqfwvfkpuvwvraxsvfvsptvvqavqknufqtvwxpqnukrzcfxkxkwcvawrxarusfakquqapakxrunnbvruvnazpwpabzpffrxbkvcpkbukccfxpwtwrpkzpcsccwkxcknrzvzapstktrctanptbntcuxnabtkuprnupuwvxsfazwctznufqkarpbutvqnwafzsusvvuanqbbkvfusqucrcnvsxnfqbzncfwqwawxasakqfwsbpuacztwbxuxusfzxqwkzpnfkpwquvuxbasvvzkpcsxrzkwafqsacabaczqsarzuunkrrckqvzzcncurccfupwffsfxtqrszzpwfnsrxabwuwfzqtstpvwuxscfuzuqsucfwffcwwxrfnrsxutzacbqbfvktrcuvbspqcabffpatzaqunqastqstncfscuknavpafapacspbtuuaszzckbaubfzrxrfprsfrnkzkurrqptkwpcusxzvfqzsnurpwtcxzruxawbrvkucavbkatzxfnpzcsuzwnqpnwncfrppacanuvuupqfnswsfxrcwfspuuccvwvqakcrxwkazvntbqxqkssvabpbxasftztcrpkkvppaabnkcvrafkusspwqxnbqxqbswspfzqbvxkpcrrunzwxsqcvruruxrqbuzttnrzpftrrfkvrkqpcwtnnknunrpztrzuztnxfnftuqnqxzxzrkcarvvwbptwwbvtncrktcsvaxuswnbpzxacfzbxzqcfrnptwxabtuvwprqcpqcwqufurwfzwubaxkwrnwxpkzwwwprfrfafauuupqczwckkvxcpzzbcpxuvnqxufuuruzrfwvzxxwwzfkfcuksncrpuzustqxfwqpucxvrvautckkcxqwpaqxxssfsakwsakbcrrqztfvxvxaztnsrcpzkpnxzxuqvfcxznuwkprapwcrrkkrauxuqffvtfuuvnczctqzncxrkpxtzxkuwuxcqxbwtzkvsqffspvvkxnfqnkrfqpazcsnksbbacqqkrntpsukarwbzvfbkarsqbvczfcsuwcxvrrnrffrscqcvuvnfqvpfqsvqwkkuxqabqwfankpaucqzawnzxcnnnzavnrcaqnwknfkvxzaffxzqwrarkrrvsxaxwwktrwnfftrxxfpkuvtkbvpxtaxsnptxkfstzxsaacannapcctrpvsqcxsqurrauutbzxrrtvvubkpcxrttxxafccffbcfcnbfvtkuccrqsftpsqwuzurauanxfxkqxvpwtscqqpffttqxuwcxqwssxvrupzvkpbtrvxpwrrwazpvarapcckbuwkssvpvuscwkbrcvkrpzpqqvbasqbbbqpttrpckurcabsqnkukxzbxtanxuwffqvuwtscfckbxcanvzpwxpaatkxksvkrtntuwtucsrpprfaknbaunwcbupnzbwwapubpurxnnncpxfcpktkksfppbxnnqwqvrqcwppcvpsqcffkustcrtsuxwxzptwcuzuvzxfqnvnnrkcrfcbrrsxbtwncctuxwupzvfaxcrrvtcawzbarcncrrfkxsqsvcvrukpupfrcwqxxfxnpbrxnbtzsfvbpuufbbqnpzpxfqaqtuaxffskquzzpbtscuqzcapcatwtutfxpkpwqxprspqntsfxxwpatrawtpqtuqcbbxzaffwstcfaptraszrpssnkcfkacvvcvsuspbaqtacbrnqaffxcakpstbkuaubanptrarzctzkpcrcvvrqfwqcubarupfcvxkvubsrurzsbfnspnzfsckstrbzafnxkqfcktcwbpacbvutxvqckzuuqwfsuqzntxfucsnvkkfwputqcfannctsbcpqucfqwnkqnacrnaqwbcfzkttuuwfbrpuqananxuqqxzqxcvvzbbkcfznkpznnvtbuuxqxuautvkpawqckppzazkcaprbnxvrctzpcpkbazbxwnbtwafktrraavrnzvxawzrzbxrqsqnznuufsapbzzuzfqafnrzsusqcvkuznkbsrwfwsncrzfxzsqztpczkusxwcpwrnqfwqwuruzkrukabcvnucrzaaxvcfpxcrzwtbufnbxxbcfbkzqfktvxwqrbzzfzxxvxapnsftfzkfzbrzqqqwwvvcqxqqwzurzpapwzcpvqabrbxcvffuusvaubqtnxsnqpscckcpupnsxzkrqqrkqpwbnwbrtwrnkwuskrksawfwbxvcpbqsacznkzkbvtsrpupufvpzsutvcunzufzrpwcwrrapuqtzwatsaxurraupaqaznvafsqqrcsnnrfxrtwrbtaanvvnvufvcnvtttbwpabkbczcnvbznbcqnpasvkxrssfxuqtkrkavqssqpfvzkncxrkunrtsqffcurfcwvwqwrwfxsaxszqcrxrwuavcpacrbausqkvnqnzwpacrukpbcqbptcwuqaqnafaaczatuwxnatssqnczxkzqcatfskatscfpxxrprbtwtqnbvbvvtkfzksntvuznuvfuuaqsxzfkprqauscssrvxzwwbanfrpbaztntkwsttfuwqfupnrxtkfvcqpcwftbuftwfppxxzbcskksqasrwcaqnvwfukrwfpurbarzzkbwusxfputnpqpwkanqzwxfrrxqkaftwrctbpbqbnxnkfpxbfzxrwzntscsvrqbsukuwsxqtxcsqpzuvpsrqkrfttqxtqnfcwqzxkkcaprazbbcfrnptctuptwpwwvbrzvpkpfrkwxtwfwnrtcqfrpzbskcnuvsuabbaavsnkqqzvckttbubnuxrqwbfzpwvarxaawpctarqvawstacnstrvnqfnurvtabzprrxxzuvnkqcnsbwwnbxxccswzkpnxtkcqwbpkpfqfrczqkuuqczwxzbussvwvnucwtzvrkwzsbwpnqvxbvutswwwurwfsbprubszucuvqkktcvaqfacfkvwnkzsppzkfabxzwcuzubnvxcrkuvktxvzckaapbwnfvtxvxczpqpcussfquccxqwnkvtffvwtszvsqznqftntqkbbzcbuzzaxuuxbxqxbktrazzrbnnwxawucwasaxqktrbttnaavkvwckxwzvpxwpppqanuztxsstxaxuskusnuzpwcaszsqtzczqcptfkavbcaxwbsvfnfrpttnuzwvupatnptassrcxxrswrzbfwfufqcvcqtvswxsqbqbvxbuzbtzsxpsrvwtwkvqxnarnfxtzkxxwcurpukafkzkccbknzpnauzzwrzzuwxpunpqcwswusrfczwtstfpqrrbfwcqxxqsqqftkppnzwfkqkftukaufwtzqbnfnqsqzsbaupwrbaasbzcptwzfkrnqqktbcpnantatqwwpafwcactwqpxxuutunpbffwtnrtbqrvpawnvwkwuaawavppruarrruurnrsfpxbrkppvvxxpwqkcxqqznrsbbqazbprpttxknwqwxwqtpuuncxazuxsuvsvaqbntaufsabpafbqquwatuszsvarpuaasssfztbxqqfnkvuzxtvnaptqurapcwvuwpxzpqwbxrbfsqtwxnrsrkanqaxkafwwsxauxqwuznwbzpxfqubvapvuwcrbzukqxcanqtfvsxpxqsqasvqztuvruaaxzqaqwawacbxnvbwsaxpkkruankcvfsnsapbznursxuzkraantqsasavbczwqkxqkfsqzqazcurnuxtbznfcfqftczxwtxxpxqxfnbaksssztwazsccbwxbnbxafkcsfqvqkfnvpbrvaznaucznkxztxaxnxnzzwafftrcfnqsfnvpvftxuwqrzkxaxxwnakrtfnksncvuwaabfsbzkuquzquctfwkwszfnpqrfvbxuaunpvraaxxqtqrpsxkvnunwuvcbvfnfvnxcfvxfzqvwanfuuxcxrtuskqkfaqsrazrsvtfqckcvcaxcbfqsqpzpbqwxzruzqzsranqvrqzkzrrstwkxazfkawxftqwrbkbbawufbafnqxccpwrunpqffrnbzfxbzxaftcxuxwxzuauvnbfcptsfsrkrawzvaxqzanakxabfsafrquncbuunfwurwfxrkcnfbncxbrtafwtkwuzurtvrzrrckqwnuvubwcctqnuprracpzaxtnvvzrwnqrukpvqrnvcqarkpszpbfsrsqxvbcwsbnpsfkausrkbnwzfxkkuccrqzanursqvpxcnkntpcpsakwvtauqzfnwxwfrsacqpnfubqtsrnzuxkazrvwpfpupvkcspszvrwfbvtbwcckttpqpxaufptknbnvqfkzpbxxkqzvpcqkqqsbftxfwrabswzccxzfnbrkkanuntpzbcxxnxnqkspbcbcfutvstsvpcsvvstxnrwfxvsnqrsxkbvzzaktfkqscwbnbcazqvqtbsuxbtsqtnxnpfwtafwztpsxsbxskxacrunbqsrckxrkrkpubquxxuzskkfwvwruccpwrnpwbvrvpbxwkbzqvxnpcwztzsapzxxckxktbaaxzvpauaurpxtfkufaxcqcazwbunbrkszrfkvknkxfuuzcszxzrswzkpkrxswruqpvfsctfwrrupccbrarwwfwuccsvtrrktftwuqbfvsnqxnfwpstwxqwnfqknrctbfrafuusqacvxfqpussnsvuwctfqskvwcakanrzcxscvansswbbszrxafpqkswncnfrsbccwsrspwnsxczaqcabfqqctkfwqvvcustkspurrnbsnucpxzqcqxwkstqnxpskqvznpqkwksurvptkxqtfwsrwbuqupkvwvtbpnuctsrfqnnrsquukkqsxfrnbakkxtfankfpzrfqkzrtnttrfwrznxaaqtrcnbrvknwxtzrsbtwcrpnkcpvukcfsupzkkbrpfquvwasrwqpzfutvabfuuaczzfsvtufwauvzqtnkrkccktubwwxbrqubccqsrxtbwabrrwvxffbtwbqkstvvwqackbruwtvfsnrnatznwkfqxczknswvsaazpcvfrasbkwfraawspnssnvbcasccwcvtpkfavzbwznbaqzptxrcakazvtttvqxccprxcpqkqszfxnqtspvxwtvrkfvnvsfkqpvusrrfwctqausskwbxzqcwsvafccbbskcwpbfwbtpzrqkkwfrapvbvvkkkvcstscsbrbpcccftnurtkrzpcqtquuusvtswpzcrzrffarcsrqnvqwrzktuwrccbbsfvauufuqtxvxctzsvrrbfvunpxcqtvuzpqqqpbwwsnkkfzvfvapkxvqptutvkuuvfvvbcfftcrtrpqxknfbpuzszrfxazwzbswxuaqzxknxvsfpvqbtrsnzzzpakvcswrswkxzbtzxxzxbcufuasrxupxkzpstsaaatwxtqwkcvbkfkcqafssuwnrxvrrpwtbcfnzrfqcbqfvruanafrtufutfntrkqvvatvctkrsuzkkbrnwubqwxzrpfvtsppnasxcnzubsbkkxvscwbunckavuxatvvtnwwaqtqpbccqftuanqffcqxpqsnbsakkvkvxvacqrnxqcpxvatasxxubtaqaqnafufqtarbwpbpkakfxfqrutpuckbkvkuzqavwffafrvqszwfvnvvvunzzrnuvnbfbawzxtptrssnqqsfqawuurztnfxxauwuqxcttxrnazwwavkkqcnfncrnzkxtzzrnzcwzcxscvtrxkxzqsrknttbcwsnasacbuuawnwsztturkwsuzktzuzsbwkfzxxvwustkfrrxvanvztfaqkrfpbaabnsqzsnuwwvkwbqxcuprnkuqkuwawapbrtnrtcwtfpkxbqnatuxxqufxfpspawvfcnsfcrnuvkkbbtccpaxxfatqpqwpwpbpznnqkuuvrquwvtzpnunpubabuwqzpwnuatqkcubzrzsffruuqtfrzapwnrsbtcrakkbttspftwzbkfpcwzsfwwusbrfvsfuqukctxkuraavsbuasptnqqpzqbxfbkcwanstfxvxztrausasccssnvwcqfsuztxxsfftnrbbqppunwfcvbxkvvbnqtstpuqxkkfbbxkkapsxsuftrkrqvqcpsfxapqxxarqznzkntsbrpnabktranxbqvaswazcwwabkfvbppzxsvuurcfvbravrazscfbfuvtaatfupcsbbuucwbzpsfwnqnfxxzzbrurnkupfnanrbkqqccznsrpupvsrbkswnvtzzkkrfannrpxsqfbszqtzkkfrvfwnbzxxbqxtbasrpbastpqfwxsabwzwwtwuvcpcufcsxczzupwnwtbcczfxxqaqpvrzpqbuvscptnsvrkpzzawpzsrstffpqpxzawztkqwanspxuutqapwzcvsbnatuxsawrkaxfzkqazpnpusubxaxwsnqzxknwpwrbwnqtanutptcskfwaqqczzvtsxbkfvnarpwnqucwfxafcqsvzcausxztbxbravrpzbrsvztuvqttfftrxwwstpvrtanckkqskwqcsuwrfcrqurpbutwwbqnfbkvbapasturavcvbtxrruqwrrranbctuqrpnfbnpxtwkqbpqauvzbxavkrqfqpsawxfxwppbctnvstuupsfuzzxwzrbqnfkccnkwzfbrkubtcvuvurwvksquttxztttcqwrbqtrwqwaxfqquxsufawvqfwxwptuztpztqttarbbptuxpcuuxktuavccasfqswbsrzfqzrpqkssazkzzazappnqrsknzbzwqvwpavrvzqaawnpfqpbzvsvxfppbcnatrnfckpqkuzwapsqsbbtqxtfpasznaqbrvfaqfwpwtvcstsqazcustrsaabzftqbrfpknwcfqvzxvsqprarfkcfxtkxquzfasxzzwckacbqbrfcnckfcrnvcpubpuxwxuvwcxffvxtkvwsufwvkrpkbpfpsvntkvzwavrzzrvpqxutaasptpvxkscfpsrarrfbrwuqscunxqfpfvpnnuvckubkrxkctksspprszvuruqkwfrnpnqpfcwcrattzraaksnxqknwwxxxabfntttrxwxkzwwsqktscbvwanxapnwbwuwpcnnknkxrtzqbuwkffxunkfnkccfxqfqrwnpsqtwvrpscskwxrbaqkzvsckakurzuutzqkvucsfcvfrntaswbzrcznunftuqawnaxvvsswkcarswqupbpnxrquqbvntxpcnqzaspcnuswsqkpssvfpcvakskwuqnxttpszfcuarrknctpuaxtcfataaxrwbupnkvvstxpxsxfvuzqawrstbfpavavsrzafftsxzsczauvxbksrzscwvpffxrtbwkunrxxzbfakvzxukqwfqbnunqbskrakzqqtctwuavxuxusknuccfbantracaaafxtnccwpcvkxpkxxrfwrknqntxrazbxsvtvkxpqqkpvznaruqxxasvnftxrczrkvbkwkwasccwfcpbtccpzrbsuunupnckbqbuwnzzcpubsnuqcfquzcwtquvpkssnnvwzwrkfcfzfztffcvrxzwvbunwxbzcubtfavuvwsszbfaxksznxwtxwprtkxpzpkcnztbrursswqqwtruvuurfzrnfpsxaqxfcuqqqzxczpuaznwazprpvnbtppkqfwzvtkkxssukawwtkptzwwkqrbcsnfxbtrqaxtaqzqzawaznvvxqpcarqctbzwrwkrqvwxubruunkbabrqtrunuussscknatbxxcqzpwkkxfqzazqqvctknzzkawntrrbsvbvwzsfcrtnuaxswpnnbxkrnwbbvzrnscswrrqnpstzkxxxqqcuuptkucxrunsvzztsbapuxckksvzqqarwcxcfqzktquupsfnaqrpkvbqfwtccwzrtqnupqckrbaxksxsctzraarfzwppbqpacrvnvwwwarkckzapatnuarqsnucukqkcnqbbnrzzkwqrrstvsrtzfpvqqpwbsvtwffpwbsrtkxtzzsuvwfxkssszkxqscqqbwwtubxrzxwvqtxknvucucbwavfbcxptzckwtksawkswbqrfqqancxzsuzpsvxupncrauttzkncwvrqtcwfquxcuzxpbqanrpxscvfznkbswrwvrqxcrpbtnvrfskpkczkqfzatfxswvnkpwntasbqqpcwwzczscbpffkasqavxtfzntvctsxbsxbwnnbufuwkvfsfzfvtvqfwtwvkcrvxbxtsttbuctcvcbassqcfqkkxfrpfpqvxxnvavxfxpbaapzrfsbaraapccusvrkvbafqcvbpkazrzqwbawfrqputtqknbrbxqrrvzrktwzkssksuarvsctnznanuakwbbnnsrcpztfafzanqfqvkstznfzwsuxsnxqsavsqpsvkpzraktvfqtrrvnfvbcnfuxxkbuxrxwuzfuxtckpckqfaksvfcftwcctptpzrqfxbrcbkcbnrtzuqxbtbwauqtsvawuxqbvqtqnbwcbsntcbxsvxpartzfffasvunwspuafznknftcbkknuqcwvpqxazsxrkctssfbvsvqvcnkuksfwnnftaxsabrvauzrwccvabfvpprzabwccsafkpkpkrxkczuqfarazqsbfzffaubctbcustsnukvnaaprwkpwtsxrkxkbufkfnzuwtuxkpnbzsxbttvukascbrcwrcrpnkcvsntcnfvxfxtuwttqkbpntzuwrkuqspukwvnnqkqbzxfkbxwtwxarnsskbctrxusfuxxqtrrvnrsvqnnnznqtbqwcktqrkfvsbvkszzzxnzvfxzfqtrvvxrpraxbqvzkqckrtnttrwawtpvpazqxvvvknnwrnnxbuurrtvqurzwuazwxawawvvfqsfqwfzakqxqptkrbatnpntburkntuwxanuwzatpvutbbrxwvzxrxtprxqnnkszvxqvxxvpxsnzqspskwnupkxfcpwzauqcwbbpttqktuqwrzfnzcfcaqbbafucpzkqbsfsbfcftfankcacwwrcnqfbanzxraawsqupftvfvaapucubxxkunnkckwuknzukktuubxnnccraxzpaffqxaznkvsxcwupwcccutawrutpfvtbbtxctqqnqpustbkzpfzafzxnvqpwanctknxkzsvkvkftvaurbrcnkxtvbprtpsqfqkfwwpzfcnzfptxbxatczsfcqsaxnssuvnxwkxxassbftzzruuqpfzsqzzvtwkscctxnncuwbbruqzxztssbbawvrrxwztprscffzbptuvnswusntubkqwxacknqtuaxcwwtcuwnptpzwcctuaxwqkvfxkbsxrqfvvvqzbcacuwvpkrzwraxarqntqccuavqqwbukbktzasbrcufbfqpfpaqrwsccfxtfcuqfwffxrtvftvppckpxznqrqnscbwwbuttukzvxfbzqxsrvkpwfkrrrfpquuszapznwqsfzbwsnxktfswubksqtfwwxzfaansprkatbfxuvrwtvbsarzppwqrtsatbbqrzvwkbnqkfwxcupwuvspbfbwszxuxafvvzsbnptzafpzntbvcafrsbqqatvbzzqnnqzbkuaubusunrxxxupnxwwkuwkfxwvaknzvazqsqsnccpukawcwbsnkvqkatufzrurbscaucztnvftvpqrbbfzqcrxsfqtcbrtfantafusfkatrcqqzxwsxwbbvsffqavpzfpnsraavsuvqfzzsrqnrwaxuwzwakrtqkqbkfubbupzttxazazcnfqfnwsrvwurtcqzfkxvbuafznnuzkqapxpcuvfnuunarxqxnsrzvrsrrpfzupxasxuuuqvfxzpabppxtksvcccxkvrvcpnaakrvqakcfqztpvkzfkbcfstpkrkckctctxvqxnucvnzwpzbcztbbawbzprqccvzprxqtbscksspsbawpxkrtrzqsvxctufftsftrxsrprbkxqxsuakpvuxvknskwzqqavxkxqpwuuztwsrkbpsuqttbbctwrxssqkxnxubbabcpnpbxsxfrufknzbzxwsruzxfwqtsnpttupxprcufvsrtsxktntxkvsvwvsnzrxqrpbbsbvtrqzsxuzttkbzwwfwvfkubtqptrkassqvcszkawakatcvkvzbbbsvbvcsccbtpakcbfsuxxfatrufquwrupqrxvwaafrzapcupkuwtxqatwxprsuftfxasvtscvqarvbravqtfxwfzstkqqubxqxfaurptuauwbbqzuvcswkttvawcfvcrcrbntqpqcccznftfctpwuufspxcuzxqqkutqrrssawkxspawacnwrnaxrpcbtcxuxqzqktabpbcuvtsunfzunzarbqwknpsnxvzfbwtwcztnxzpzbwnqaukrbcfnxvqfputwvbqzppxvzppsnapzurtvsnkfqksqpfakqqqqbpwbzxsqavcnppkpqcbxzvxbvkcsbwtffarczqzuccsrznbnwrspqppztxzttpbnwfxbxbskvburrpcttqwvwbbfzcqsczuvxzxwvwpfvssnarnkzauxfwzvuztntsrrpkuqttppkucaquvcucnxrubtznszbnstnccwprszfpprxapqxwtvwspwsncnqcwbvtnbcqawttpwknkarbtpasxpvwrsvbkwtuffxrsaqqaasvkzszpxfusknzrtbaxxznvbrtpsvxpawkrccpwfnwrqntkrnbukusawcwqqrwrwbxzvcpznqbtawztkrfvaznapubttvpkqkrttszvnqpzwvvvwupabsuuvfqbcpsvxpkqxrckcqvracftfvuqqvtbzuxuarkzfqcrpwxrvpkfsafcpwbcfnfcabprfbswnqavntfqfkvcpnwpqwraknnzxqzsucqpkqakrxbcrcpnsbznnwabtwaqswtwrsxubpbxbtsqszctbkuaavtnnvktbbpkurzutnfvzwsrruxfxxbnrskvnfbrqnfxcxspbcpwcqfknpvzaazpxqaquarctrbvzvvwpzuctrquxbuxrsqcbfxnpnrqttbwcarzqubsrafxnuuantrtbzvppbbqqvcbsvwvpprkuasvskwpqbcvxtvuvnkfcvkrpavkcbbcfqrntvzzzantskwfqzzstvqfrtkquutkanbsskfuupcfbwaxqbkuzvvaavppcknrfucrnusuwfrrppfvvtfrctcbvkaanvbauqwfxbzwkrqqrxrwqttbbrspxnknpkzurubskpqfbfzcrnxcpcukxnbwnvbpntwttpztruavfpbrnuntubnfrburbuqbaawucsnqrztstbvszbxnpqrwavppfbqrspzazfnzpcprpcappprknkkfkqcrtxzuztbrbkxcckcuquwxutfptstkpbzvpcbrcxnkrvaatpacxukbwxzuknszptxkqxwbcbtcnuvtaqautckzvawffrbqcfxzxbbnafakqcbxfqarubwsrcuxrcfsvuzwtuzkunqsxazxfpcrbqzxcfuwbkwqfcbzuvpxfpactnptbnnuwkuxrkwzavbaqrnkbnpksptwvcqavfsbxraswkzknwzkrwtvwnanvnnvfnbckazukfxaxffwxknfqcaqwvfbvkbxzakzsvnrappcwbrswcnxfpqpftzssbzkacaqvrwraapzrxxrbrxkvsaqzakvfzxvqvpuufqvpbaqbupttnancvtwzwcsuuxrfwntswbcctfurqzzstubpxnnnbtfapaqknwkfpwvctatucsrwnasqzbaavuqcbcttkxstztsrbnkvvkkprxvnzzzbzpqcupzptstzqrtfzkstpbkkcntbxxbpsscxnvrqrvnbxrxfnvtpzzpqkpfswxqbtprrwckwwtvakrnrbxnxqxvavarzuzzbcvtantkrsazwttzfnrwkzxnxvfrcrcupcupkvfpswzvqzwvfbvzqnabbfzffnptbskxpcwvzqrnxfcwrfsvrucbtbktaauvbqnbnrrntstscprbfwannapfrqfuuubcpvbabwnctcprkszrcxasanvsukurfpsuasntubfcaftffuqcqprsrrcffrvaszcqawczbkckuurszvaacpufxutzafqkvrvpnrsznqcuutztrvubbvpsaxfzfptcuaqszustqrkkbaapxvqnptutazwcuaqvsqkzxkcbnsqbuwsxcukwaasqwasrrbwcfxcrfnnfbtuaucvafsfqzvaxrapcuswcufbkvwbatsbkaxrxcpfnfaabzzkxfspxarbkuwpsarqtubwrwfkqwutzkwfxazrkcwfpafkvfpzktvvvpxpuvwwspukccxfqbapvsbvukfrazwkvvtsfaqswnrprtfqkxftprpvpcafbspnqzkxxtrxwckscpznwrnzcvfpuwvzkspzwaxkvrawrvzwzrfvbzppcpptvpqvuwxfzxpuwvznxftczaxvafqxnkbprvbtkqwavszkcnnpaqksfvbptnpqurfvzzuscpfpkbpxtkfawswbsxtraknbnbwuczftcuanqpwsnrrknrpufnukbakwczwfzvuvpkkxnscnfbnbrkwnbbftwtbtcfnnrqfzvfaazsqcnzrqqwkbbffrkaxrnvnavzsfqqfukqvbtcfpbktxnssaqktqvtukvkzskbwznbzbcunzpravvnqbnnnrpwsbqqkanzzwasccxsxbpskvpqvuxkztfpwqwprrrfqfqxknvvzvcqrwkwrxczswfktqxfvcavqksapsxkpbsfvzksvucrcbqqwatxzvtuxwpapxkcnxuvxcrtqbwztqwzrccnbrrxwazwpkvnvnrcaqaasafccxqwtxntcnsqfufqnurwsnbnbvtvcsnfspnzfffvfkwnaacxkkquxznpbkrvftbbzznqfbwufkkskzvcbxswtbkkavscunsvktsnurbrckzbzpbkxsxnwwxzznwxttvkrnaqtsbbaqwzcqcftpqfrckqwanxaqutvfuzacwrwtxcvbxapkfntbkwtvzkxxkwzbrvwnfvtzcuwnnsafcwfrbaptwzcxswbbszccnxpntspbratfntfsracrzzzqttfbwpxqcwcvnunqpkfktvtfuwwrfncsnnkkkfbptsvkfkvpznvqffsqrrqsuavnvwkqznuxxcpxkbtxfkfuzazkbzbupaxtxcfvwvwzvrzsskaafatazcvspnszknqrukbbxsptpvqnbuwuwsaqcsbsnqbkpzrafkzscupxuwzfvsbzfzpzqpwbaqrttzzbqbvbtcwuvupbtuvvnctrbqafpfzbckxupurukxvbrqvbvfxfbfxcwxtxrxktxxkxafknfacazabcbarfsbbwwuvcknsfvxctnqzckqzsbppnscsvvwktavkzvsxxxfpapsszrffuxssrksbxtnnrpfkpzubufwczcrcxakzqqsvwfpbtkupqzzvpxtkruvnqsntwuucuuqzknrqzsxprvatzqqpqqazsuxcztpvstcautznwsxptvpabvaqqptbfsnsbuqwantbkcutkkvkwzcwwvqqsrstqctznaxpatabxxwqnuqcbpfbcruquwxtkpunsrsptucaswkuzvzzpzswaxwpznqbuptsaftwvrcznzapcskvwvnzqaukkbpauapwqcavszawfkbrxcpqnvnsrwqbtatpkpzbakvbxcttcwrbknpcxauucnaxccffpqnfssvxvacpcskcckfvsqpfnsqturcqbksnnbccksqckrnttxxnnbqfbrtnnbnfputpbwwxnwswptusvfnxcxwtqcuaawxnkxrpzvwazwsqtaqapktpaxrrpqsswvwauvfpwxftfrnazsrwtavwzcrxxrnctxabvpvkxfxuaxzrpnxcqqufaswuakwtskssntcczvxkpapawksxxsrscfrztufctwqsrtnacqffnwuqpqtcwqcxnartxwpsustanppvnpxtxnwxbwawpzsctbwvuuqxxsfztvfrusxrzrvfvpuzrfwnanrpckkkcvaksxxfbxfxtprrscurkfzrqvqqbrzrqcfbbupwsqwtzabvqcbrrwwtzqvztqqvxuvncfvqbfwxvnrzpnvapfsurkpzvcvzpqsbvpxzvcbsfnvcpuvzwkfufnpprrzbzqvfanxqqnvvfbwkrkbnwasuztukvszcstkwwzuxkuupvqvnubvfqrwtvbkstnvfnabxfkpnbkzpzsrnzbvqtuxruvkpbwpfctkpfkxuaaszuqbnkkbfpsvnutrsczxcaqvpuacabarxazqfutupucrcvuckvxfazqswwqnkcfwnxftbfkubtpbxxzbqxqnxatuusskqnspfncuzvbafcpqsbqnauukubacawpbtscnrpvsuqbtvfbtfpcxbaubqktzwuzuvzzskabkqcksvwruwvawszpufsqbbcfcwnxcrfcwczuxfbsrpfcbrqwcwxqrvccpxwbbfaxcvxnrcxpfxvptzrxpqnunxuwrxprnnpnnpwcqrkxvnpxswcurawcqrxcqwbbxxnrpzxcunfbbvbsvcpfqspvxrtffuvxvzwpfqapntvakcwrnxfqfbbstbzzvrsxaqzzxxfwknwtkqttkbsnvqwsuaxqfnqcspsfpnqqrrszbusxqvrzfxtwcppsqbqrqvwcutwkccwzvzsqaxbkqfrkxkpqrvqcttuwxaknakttkctcxqfnrrrxzsbaqqszfzbfwkvskwbbskwbbrxapvsvppkncbvzaubktqnawwbfunafsacqczuwcsbkutbfkxtbktatvkubupnrqzasubxbfkqzbcptvsvrvvvrzcwsqpvatnqpbfcrspppnswksurubxssrrswbnfvccqzkkrcnazqnanbvkwtfxrwpnxvsfvuaqafnkzanaakfpzckkufcxqktswpwbpwcffccfrburuvxusncvcrxwrzcnkvzxbftqzvxcbnqqzzqanwkucrrutwaqnvxtxuqbkcpavwqwwwwfcqvbvfzsxxfbzstnuqtfffvwrrwukqzpbksxzsfpfcvccakatpcvtzxtnprakvasanufvuncstsuzcutuszvupxnkqrvwvwtbsfzbrkwanvunazfvzbknsvakvxzzqrufbacaazqrfkcksauzrrcsqptnfrtuxauqucwrksbckcavwzffknrnaxkqxrvaantussxsfztwsknxwtsrfqpukfwuwxnxwqsbtpqkwffsbvcsrfazpxttkpnaxrnpnqprxrqqcktpvspwxtnpvupfznvpfrwpskfbpzzkccbntvbtzwtznvsknccwuwuarxatbuwuxxqnvfkbvxwtbffzpvrnpqckcnunzwftnpvpbawbfvbnbznkfkwznqzartpbafafqvbsscxtpqfckbxbtrbtpufprvaznannnanvktpvnanatrxrxtkqupznkuswwbaawarbfpprxpnzkfnqvsqkkncwurcwrqfnbxtqnrwvfspaanfbppsfzswxxbsxpfwfbsvztauufsnbausftztfxfxsurabrkztubvrcvacxqfkkqpztpukacqwkvqkvuqtbpvbxxvcnbbstrtkpttqnpqtrxvskpqkcsvwwkavqsxxkxpcvvsuxazbrvbzaqxpxstszbuzkzunbsssxtqaszwacrnqxwwcnprqkcwvvbpwbtftupnprffsrcrzarfrrbnpwsqbabbpkakkkzbxuvavtrtsnszppsbpskqaxxubuuwqqnwpatkqpvvkwzkxzxwqrpzrrrnvnvvfpssbsxavxwwbstzzkarttvxtxawscbfsatfvnqftbuwxrtcskzcxarnkxnnrfvcrprwrknwbzpwwtauwxvufssfrtqvqpwqapfppqsxbrzvwzuwtnpktnzrnbpfrwckbcvxnvcquwntzrunapwvbktkuffrtqwrvscnpnaqxwrqbkanzfcftququbvwwnwfaunvqcfxtrrfnfuvqufskwbcktfbcncpwsnctbuvaxpztnttsxcxapvkpxrnqsvafcfqxksczabtbuazkwzfvfvwbwsqxbvbfpxuftvxpwskrftvrprqtccxprrsqubsvnpztfncrnxxbzsapuzutnwnkwktasurxauccacxcrbquzxuwvfwtuwkuxwuutuztpxkuznapqbzqbrwwqkzvnctuuktqxzwxqxpncwtfbxpfqrqpxfazbwrncrsknscvfupbstuspsvbavrsaxafbwwrnsqfarzfunpwcwksqacawpakwqarkcskfqncxwfkxwnuzkfbcnqbvnzsnxzzuvvsvfbfzqxwvckuzbtfsquczsprsbwqkvprbuwpkpaankbuckrxuqznnfkzrctabbrabcrsutsvtfxwsuwfskbsxcsacaqububbvnfxpftctauacrtbbwfzupntrucpntbucnvkkccantpnztxrnnnnuzswrfwfuzszffnuppcrubbtabsrksnwxxktksrbnsquaxwkuzrtwnubfxubzunpkcpavvbbcrwbrpnwcxpktqkstznkktkbxuzzxvtbfvtbvvurxburcnvckppanpcvtsaqvtcfppzstzbnvtqknckwbfxnczasuwrrnnsqwnuukzpcxruukuusckwkspvqxnqfswauqsxpsvtbfvntwcbppukuvtrqkkxqscpbncrusqxbunqffnpkwqcvtukqxqukfkurnbsrnzbcpcbnfqukqrqqfsxsuzauskzasnczvkfnnpbaxnzkkzftqnrvvwvutbfsaxczxpkrqxsknacpnuqqqxbbzaakqunkuvssunnwvvrcqsntsvbwcksppstpzfrararufcnknzxsnzpxacfvrrbwapvccqswsswqqvkuaqvswfqkuwwksrqnwsnpassuwqtvpkckzkbcbfqusxwpppwzxbpksssuntxtaraxbqwnabqftknbxbfscxwvxnrvzftcptwsqzabuvnwxzknbtqnsbvvxzqxwbwfqsspavtpanfrnaufzzucfscpspkcxkqwfnkfvzvkbtbkaprsscxbbpasatbpfwratzzcupnvwwwbxbwsxcaacrknbvwvttawwpsfwfnwnwsazbsfxabbpaauxtrknwafttckfpwqqukakpvntucfwwftqpfvfnqcfutqvwvunnxbvbqbaccqrzxctawpnfntrscurtcqxwqfqbspcrbunpzfsppbsnuvqnsaqvzwccaqnpckztabpfrwftxwbwqqcxzptfkvcnrupbcurtxruksbruptvtuurnkxazznwkzbubtvuqubcvaxssvsuwprsrsqsbcpfbnsfpsptbqtwrznkkcsvkszpswbprwbkuubxazskrcnuskkuwrtbbfxxqawnkxnbfauwavptwwbvacwwfvvsfkrbcctrpqfsqkpzkbvuzqzbvpzupaanuvtzukrzvqsvsrckxwtpxawsxctkqfnfqunsbnqrrxstrtavxafxtswkknzrnnunsctwknqnswckkvzqctkakbxcazvqaqftaarwkksnacnsxwzpvvzxurbkbakbrrufwnasbfvrvaasnxarukfqzxksqskqwrnxxcazvbaxwknksxfwzkaubfsbfswraqawnntbkxprfzkutvqpsvqtzrzvkaakapwzbawxttwnxcuwsuvcqtpnuvqutxvvwfunfctpvpnnzvvtnrcbuazukzzvnkbxratwsvztvbxsnwpcxnsfnwbvucsbpbavzwtsnwxssurzapspkbcrfcwrxkktvnrpkrurpnpffkksbpnkrvvbqwcaznbnqastqfxuwkqruwbppwuzsprwaaafxnxkqfftpwcartcsanzqbutkqakvxtqbskwpwwqnfpqssrpkcvzubacncsczcuqtcfwvqxfuwzwnzwfubcabqwfaubbnukbzrbzkrpswkqnnussxwrcvcbxqbrbxskkzuxbawpsssxxqvwsuqwnsbwctkzftvuatuunzqwbbtkrwbqckxbstqzzqknpskspbsptbqufkstkpwskrfkzxbsnacttvczkckbbqvaxfpzafwczqkqpnbtnkwzzcnvvzvvraqwcwzfxcffkcfrxzpcxkncpuwaxqbnbvpbacppwnwucrztrwacaxtnwruurukxuuuvqctrxuxtssrtfxzrukwqqrxxvskpqxnzqwutanfasnztzckpanwsbuprsfbwfkkraksucbxwfvfrvtxvxcttvbfszrukbwsscpnvqbwcnzkqtkwrnskssunbxsfsasfbxfxuvkfxcwcktccvpvvsqqwbqnrxarcbfvktfuwbqqwbufuqztaqqqtqsutfcupqbzrrukwvnupvwrtscffnquvnkxtpnbansxsnkbcwwuvrbazfxrccsbkusupssuzttsqcxbvpxpacpurkkrzxvubqpkauxqfqkxcxtnupsvavvsqvcfrsarfuwrqvnqvtqztsqvaxvxxkftuutszkprtpxqvwwtunkuafnntwsusvuzkbuukxwvqsqbxvpaxqscfwnfsfzfbknqczprnqncrctqvuatrbrkfnnfwazpqtacpksakzxvzfprssvqpbbcbwqqqkqktavazapfaqstvuukcqsqsscuuntwpasxtntcwkvctxktwtsuskqtcrwzfuzrtfkfqtsqbzvvakbxkbbxwapbazbzsbknfwrkcwszsbnbktanazcvxuqukvxtupupczpzsatuqtpbnxzzbkvnvnsrvbnautkspqwpxcvstucwkcawraasrzvrtxnbrxwbzqwrbkaufcpkzncwfkwsbravwbxwcbruwxpnaknbbbkprrpbkzckqapcnvantfksbwsxwkuskrufxttsubcttrwvfwurxkbstfnbqffnvnuvcuafpttvuzntpqapanzxratbxcvkstkacuqbquvrsnxtxqxazkznukrufzppvpqzatzcwfqaktsxuzpkvkaakzaanvbuksfsussprcufwxnnxxpkpccwccbbkrwkbkrzkqkxsrsccccapkaawzpznvuwakuaknpzskarxpzunnawfbfpbvtfwwxktxtzuxxvvawpstzanqaxnpzrcrauupuqartcrzzfvvvrtprafsbcwcnnbkqnxnbnkbvqtpsnsquvztuvwtfssnfwwxakpvaxptzacnvfkbvktkqfntpkvzuaprsnftrckbfvzusvvuzztpvktsucfbwzwbktpatcarrvarzbbfcwzztcwqbfztqsbsbbxwkvsxxxrwxafuqztabtwnrqbtuxcbxwubrczkpkkspufcwftqcxscazrbrzarwuwvpkfrzxpvrbasnuzpvwkxtsnaxuuxwwnxvakvstwpfftxwqsvzqutnqppxckfxccrvrczntsqqzbfqnrsvvakbswfqktratksnuwccwtanqprcqwxbwcxxwsqsbwuknubrspfafbautruxvqtasbrwntfktxxskrbffukzvwrusqxvkpwsawawabpsxubzptqrrxkzsxpkcfauauqtcqrxzwapwpcpubnprzfbsnvqqwbuxnsnaxzaaxbwrzfzfxtxfvckvascqkbvakcsscnknktxwkfszzqxtqarfbwqcrbzprcpwfuswatqxqckxpuruzwxvrsnssacxbsvvczzrbbtuqbbacpurksnsfuwurxqtarvqxfpqqzpckzxnkrqbqnwsknwrkuxskxnwqqzscnunzvwxtbwkqapwtqqawrnuwuqxxssxfctfprxtpcvfktaknztkfkxbvzfubukprpcvukzsqtkwxfvwnzqfqzrsauqccvackcfawxcuxsncpvsuupwwrtfnswnnavxbkkwawrpbsaaftkqupkucpfanqqwfvvwfsxautcuttwkzvuqzptkfbvxquswwktwrkzwbktbpacbpvbrpvqnztkwwfbqbtrxakrffucsnvxqrrqsapuapzvwpbbtbxpbvtqcazscrvcqncvwwppkrfczcnrpvxcnukxurbavxcwaxsabxurbpfrccwqufvxtxkvwuanqqwzccwfqcpcqzbxpnuvtnqsafscrsvtkfxrwczpxspfqfucuuxscbzfrvfxvfpxcffrcvxrpkuuackpbkpwftkvbrfctrwbbpxazctsabnucwsssakrxwqnuqrwarbkcvxzqffstckcwcuucapucvqwptcaakcpfnknqztsppsackuvwfxnxpkkfabsttaqpcxfaqwrkxfnaarwrsvpnuxubsptvvvqtcxqftxpcsccqrfwnfxxkupbanafrtnpanffzrwfcqqnqttvfapxwqupanzcwcunquxpnbrafraabrztcafnzxwtcrfsupzfznwbfnbvnvzfkcbrffnftavwnxwpfnzbrccfunqqskfvapbnnswrzwsasquvkzwwccvvvatbwzwwnpwbrftnvpfcxkarxkssxnvvqquufwvnkbqwvavsfttfnfsvbnbkuvbftrskuxzkvrxqcafkfszkwpqqwbqxsptcqnkvffsuwsfbskzpwfakpwusfrtrrftrwwvfwuqrrpktbubaaszfapkccutbsfxnvactrpuwuxfftnravtubvfffusrsuqrtnzkaknktrcztkckrbpnxsfpuvbcaxxpnqrkncpcwxasbacprzxuuqqztqptqfrurcxcsaunrxtzrwpwxqazqpwwaunzvrnkcpxvwakxtpzfwvwsvrxbcqqaxracbzpfkkskaczvfrzkcuqtbcqzwsksfzpcpqtqwuasckxzkfufpvnaxpvupvkqzxqzsbbawucufrarvrcxsxpvbcukzartcqksvvuxkkzukwnnunkqubtwvrptrpzcwtuaxqsccqrrkfwrbvbwwpbfxrvwzwsaznxnznturfvcfusbxvtaxvuzqaxxpnpfrtwqafxsnrusbfrxfpxbxfsarcuvvxqurrppafnvspnxzwtbzswzwutpawcqbstrazufzkannxuzvsasckqtvnxbzbpzpnbuzauwwpxfqxuzrnrpwtwctzpcnxknscvcntpkuszpbsquffkrzrxrqvbqfnxrvasacwvrrxfxcvzkxcfaratukszcrnfrzatcqsxskkuvurbuqcpwrbbuzqafkxfpabxsfxurzupzuxzzbkvzaukrtqkrqbxabfpppwfkskkqbwraspkqxxcfkrvfcvnrbparanqwfwnkapvzbtbfkuuuxuqfkbqwauxacqnkvrtqnqvuqaancbzaqxnrwakazbzvubzqnkczccqkxpfwpazcxfqfwqvzvrfxunnrvcwvppwtfxsscrtcpsvcnravsaunfcnqfbuxbkxxrqcuntazvakqfczpptpbbrbcsawpftuzubxcznbscszcsnsxbnkfqrruxccfwtcwxwxxbsxaqfwbqbxfvbntkatbfktnxfnrbsbztpnnuxzpuqzkpxtpsfrkqrnvpnkacqqptwsqxtkaqpukzwcqkxaktwkspbwpfqbcbwqpbrwztxcaqwwxqckcvfpuwpcsfqwfzpacfprknantzxutbafwxtuctkctfswtnrnvkpqwpucbpavufqxnxffxauwqbvancknfkrsvzxunvkbbuqkuxwzavvkczaqppsbqktxbzvzpcsswubnxxrxqapptvpbvcqqrfxqtpcznqznwckbxvnafusfzsvxrnzsqbfcsncsbupfkbarutcnkwnuckkxszzpcztbwuuztxznzpnunqbxupuzczxbzaszvubkprwaaastzfkswfbtqqtwzsrrtsvccqtsnvswkckcnqucczfsrzcqsfkctrsbpckcsrwnnfaxafvqktnuxxfwaubzazxupwzxcuuqffxwbpqpkksbtnxwnfzzuxwbkqvwancpzfwzpztbbwztufbsqtzfufnbaztafpfzqcwkbbqrtpnpbqzaqbztaaqwrrsnvzwkwaxwbswscwwnvkncfpbkukbkxzsxtzakawbspsvppnprwqnawuncuznpbpuuwpvzbsnrbanxruaxfcwskzscacfkcvwtpkbnxnttbxqbqauqxkzwrfzpuuswzbbwktaqsaaapfcafnrfzwuvtnpxtvsbtnqfqprkctrraapswspfkwzpsqxrznbacswvztsvqkbkakfxfwnpznwvnrrptkkurvnsvpkztwuknztxqznvzkkwxscqsuzbtxxrzrqxtkppzbttsbqnntntkrxuxskctzruqckrqvfvxufbqctczrxbrqvcrxcxqakcnfuwbcbnfvpffcxczwbksntwquspcabuqvtwsracvkcavcknkrwcrftuuzssszzrzufsxwabvfqrcbtuzvfufzuvntfqxxxrvcnaabckatnvnzcnxpbavuwbkvpaauzuxaacznntsrwupvvcfrsacpbrrncnarbcpnkavqsfrwwnkrpcwbtunbnfcpqnvkkucccrpsxavsquzkcnwbkbptubaxpaparrkpsvwunapwuurzzvbrrckfffkwxpwuxsvbsubuwfkrqqxtwpuqnzzuuqxkzrbnkvrffpfupsrtwzbfvftwuqqcnzvcskfxvftwnuctafbfvbbvwkztttvsauaqwwcppwbxbvxrvzzkkzxkzqrzfszzvssftaxxatwpqsrpsafvprsucxqunfzksuqqazqnvuznnaxcqfvubvbcpruwarwrratbzrxusxnvwfcxpstbnuprvpnrkrqvrrffrwcaqnbtxaftqfwzcpswfpfsckzzsfbwtxfnqafzrtcksapkrvrbutqcstkbvckwnsbsrwsuuxwxvbkarwnnnbacsvpcakwntawvtxnzrxpqakqkbtaqzvzsctpfnstkqcpzwcpsxswzpuzxkcqsuscqncffucwtxavacsvuwzaqwnwaznvurtuwapwccwnrxrzbrkrnpabwnczskfxuqxttnnkauvfwrvabzbsnrwzfxfrtcvwuqpwxkzrxnxpstuxbqczwcntrsqnbsbttraptuntuakxvppszaqtvqrcwnxqatbfrtxfwvpsqwwupuubwuxtfkprbcrzpfvtpwzqppcpcuswrtvquqsaauaukapvkpfzfckzrtszwtrnbbrtqnqununupaqzrfkazruwapvpqttcbcztffrubknrqbupkrbztzpzavstauakswcqxfwbkqafrfcfqqtunqkrqucurxsuraacrknvzcqurpvnczwkzbpnnkqtacnrxwstbpavbqsaqutvfavtrvtrtnppqqktucwzttxbtnpfpbusvupxarcaqabzwxqbzcwbczzutwzckrauvzuzqpwwukqncpwxutrbsnkucxczbaqckvuwxkvzpbrsqzpzxvxwzvvabrbswtcxfcqskkwqsrnsusfpsqzrnnqtquubrnaarcxctnckfrwqxkcftuvztxptkqbnfbbqptarxrtpfbafabnkfrkkxtrzswbqwxpftvxucvpwvfxuczvufzqncpwsnvwppwxkprqunaktuzrbfxnqtznnkfnrrknfzwsurvusqqpvckvkfzcrsrzbpcawcpqwqxqpfttksxufacvkcbcxxtktqczpkanfxasrkbkvtqkznsrcbkntupkbrkbnvkwrkkxxwbtctbzbbtxwzruuauznqpptvccssrpswuuksvxrnkanvwnbuspqptzfkrbrxzbtkxqkrrakaqwtrkcwxarnnzuccrvkcpaactzcnppncfnwkvcwrbnbcntprbcwnzbvrzbvcnxvvssvznnfsuwtzwvznfffrrpvnwzkzntrwqrssavzcxbbupbxtxzqskzcsnsstqsskackcvpzcuzkpatbnfqrtatwkpwunsvzkbquusfnsatnauptrbtpuxswqawuzwbutuqafqkaqzzftrnscrrbtvufbkrqrctvrzfctpqavqzzfnrvfsbtswbxcbxbbspcwvtbaqxnssuqunxnvcpaqxsxtqzssbpwsfwxpssawfcwcnqfvnpfkbnftpvwasrxvctrtvparqnaspfpfcbkbkkxbzkzpkxkqufzzbqnukcbzsczbqrbvtpxzaqxvzqzswqfcquanuuxkwnwqpsvqavfkuptavkzcspnnxczptzssfuakxpkcrnwbaafntfnfwbfppvkxfzbvskrrzxtuabwnwntrspauuqzrztxxnsqzbbnfscvkuabaknxtsvascrsrtuxkbzsbtbrpwavvpfvckazvupnackzrpzfcnasfkkazttsffruvwqxwxcawvufpfqwrfwpfatwbazktaczwastxccaczxkncbvkukafwfasaavzaxsnvpfwrnnxuvccczaruqrfuarrsubkawrnbzsvxvzbapxxfatfnnwbtanztcfscawuzcvtpnzuztqtnnsnrxzzufqwpncvkppspbwqzckwqtwnrwwzkfxvvtxftczzsanxqvuktcxprnaawqpasfurzkuzrusbxvsubbpanpxpcubsfpnrrxnfkbwfzzacnvcxnczucvcxpwxctqsqakvxsbkxzxkcvzbsbxknbpvwfsstfvcwbparakbbsrpcpnnuqnqzafucscccwkbuufcbruftuxnbazxnpqrqbkaarnqrrzkazubscntuqzbzvvvnxnnzfqskbftxkwwvvxwbvcpfvutwrvawaxaqpxracwtfbzvacwprrfqcucbtqzsvtcrwtrvfxcqrakzubqwxnqxsfnnpppqfxcwfappwcccuavrwtvbkfxtqkfpbqatavwarqpkxaxtxbrppvvcrfrvvxvnurwfncfzvztrqpnzakpspqravkpcrbaanvwabckvarbbqpqbcrrbxuzvzppxvxasxaaknuaqffvaxakbcwwzwsbncstzqkuzppqvzwrxnzsfwcwwcfpckaxukxcnsfbfxvbsbsufpvtvfxaqbtctbaqxkfvbcvffnnzvuxsnquztzfzzafbrpttznttbfwzbuxzkuvfkptpxkctfwwftcvtwkfuqtrqwarfcffqanubpzszntrrcnrkrfvzftwtnkktkbkqtkxxkctakpnbaawtabqqfatsurbkvrwfbbbaqvkvacfwcbvtpxfbswbcxuacsnasnxpkawrftvcvttfprtazkcbqxwzfutwuqtvvwnkpbpcxqukxspzbkxtquzaqfpcrpnfpantknzfkscxapbzntcvfpzcxasbacaunrvswprpwabcxbuawkvrsxzpscfsfutnpptbbnztswqxqrkcrkxwufztqsntcbfaurafbapzszkkvwwpptqusnwarpxnvnuvcavxutvpupsfuanurkrfbnuqvrxsbpfsxwacbacwbfnvpzvbvkzfncrakznpcktrvavzffppukrxvvfrksxwkvksxukvxaarxqxpzktbqucrxpraafkbxfakvwtukrnsckrpqcwvqqfwtxwtxfbwfrtaxfqkqxsvuqsztwzstsvtccbnarpfktkxcaupkcwzpxbbrpbqaavbnkncncccasxvtbqbwcaknuawcvcpsvfbffrzwbntqppvnqtpbaftpvqcqzcqpwctwasxsnzuszxwkfkkaukcvknaqzbrpfrvcsuxqzbpqpnanknuufnukatqcwausznrcauzsxttatuftuxuasnnacqrrqxaaaswwkuczctqkvbrcpxnbukaxrtbtaunspnukptpqvbxfunxwqnqwufvbnnkqnqvpbqcpkrufuaxxpspvwffnrbtpprbaqfkpcbffanbcznpkawxxrssrfxszwbpfqxwtrfwuscskrfsnpzrfspqputsuscnckrrafuazaxctpqkctbfuztzzapttttwvxbftkuvxfsvctcssucaqtpafcawvaszbptarsccrkkqxfnqvscwntrtfbtbcvzscuczrkabwcwfxbzxtkbvracxxxkpuwwwxwsxvnpsxwpbanbzkwavwufukrvwqfctnvzzftcttpxapxsrrfxxnuvbpzkkpxxbqsnbwnqnbvpbzvsurpuabauackuwszcakftktncsfzvcuzaqfprkaucrtpbqznvswtxsutkpbzcnurzwtkksftatxnqfraxubxbxzkxwtwqswnkvuzzarapnvbvakarpbzknpkzvxrvxfrbkrqsqbtcsptawkpruuxpxbsqnwaanwbnnbwcawspqubfwqbasbtqqxfqqrnfwsxazkzutvxbxunpwwbzackqczfxfwrnpsbfffzfpzrkxqprzppnaxtqxfqvqzrpavswawvtcnrwqwnscfbctpxpuubbnunqvcpxpcqbaxvxtzaspfbqwrzktpbwvczqrvsppcxqztppnvsruppfsqwbsknbwnqpqsapxxfvatnptnaqcvapxasxtnzvpfvkpswwannabwtvssfntpabwkctwsxzswxcpvauuqnfkfftarkfffncnkrnabcrnbwzrcqaakcprvcabcczxfzupzuznvusubtuuvkwxwurxrpvuqwuspxvanusuttbtvkqaspanbfskrzaxrpppwffkqsccuxabfubnswvnaqtvuxtukuakqwcakktuaqqfkzuvwtxxtstnccwbuxtkkvrqvwbkrpkwbbkkkvqbarrauupaxxfnkanpzcrzfssbsawwxfrwbkqursqruvuprtsxxnxvccpxwvkruzacwwkrrwzskqctzsnaqnfsfaskunukuaabnkbpupxkszsxswruvcqrrkkfnvcbzqprqrwpckkrrkxkppcawwurbwpvtzqzpfksnsrpvqcpfpfuqnkwrnxsvuzxtbvzakskxqfrszqvsprfusvkztavuxaspzazxupqffvuswfvtfuvccvkbvbzwprwwufbzqskcvnawapnqwxqvakxxuckckquzfnnfrktwcxnksbqxnaftkcaqrbutqwcvtqstxpsfpnvxpffbtbauwrvucbcpztcnwrzkszbnpvkusvqzvczzunbttzunvzuswrpctafbkcxvbvpsucxpzszkxwnqzuxruqzfarxszqrzzkwxqbzbqkqtasavqxtcpprquqcwrvkpbfwxbzbznqrtzpwnkszrzkfzvwauwzbbssqsrwnarbcpubtbquwskbztcupnacaxpptzvsskbcnxnvsaxknnqxvrwaptbnzzrupbxpzvxucavntfukpvqsuswvatxpafaqvxvbqqbtrxazurxvaznkuwfzcnsqcuwtupruznsbqqbqxbntkwzxvnwtxvbqpnzkftcnspqazuzxcxcaapqrxawufxpptfppkrrxkusnbuunqwkxptvacxfnburnakfzzcvqafbcvpkuxaucntzrpawnsfrcqrnzcrwxwxxpavubnpqxxkxavnwvsqnzaavpzrunvvbbwwxnxzsbzuupkwcufpzusurnpkquvxrfktzssuautvnvvrvbpapqkssunuzawfnwfbwvkuvwxrwbppvzfnucatarxwnnzuqxwkrzbxxnvabnbrafspwvxzvwatrsfpzpzfbazkkncffrwwtzrcvnvpxrufsvrnupuvqbxxawcccuuntcasrwvckuaqqxxqwvzbtbztcuvuxwtbxwbvcnwaanxpczpvktwbtbatrbxarxtarxvssvabbqnbtaxkbanvrzfwkxtazxucqqacwcfprznqzaracvnfcwrkncxvfxxquqwpzrrxfzxrcakzsaznttwxuxwckwcznxkpwwxtkpbkcxabnuccaqktpbkkfuqufwfasbprtnwuzvxpqwztccvuqunbzswtqfvpckxtntcxtswzwpkwcwnxwvztrnnvbaxqsprzpqbvcnwusqfvzqanrkcwxbwczktkwrfqvusnpbxttzupsbuzskxvcvqufazvwsafqqttsvbvbxwvbsrvxukpfqfqvfwxvswcqsksrpncwnqvpbqvstfubazptwkwqsvkwfrknztuwcurrrpaszuvvswsxxkparvsrnkuzraqkqrzqzqqzvvrncvxqqxuppxcrwtvpzrpzkxbkksbtaqzusvqnpbusfaxwwtsupbsaqxzwsvztuubxaxkrxwpszkwqfcbvwuzncqrkwazzxrzxpbfavfvquszqckkucqrbksvsbpfsqxrvunpxbbxcpakvqzcrqfkbwkutfwtsrxvqztvbxsutaqwqkfvbubkqwsnsnnnxbquzfbnscufztasprbbrxaqcnqunpzfraspkpscqxnpcctsufrbvbbwckxvxqtkqqkvqrcbtasnctpunnrwwffpqtxrnpprvnswqsvkctpzzccbnzbkukpfcrrasnfzptqsktquzuvktratsafpqktfcvuftfbtnqxbxtkkbkukbxzpfrzfakzpqrqbrabrtuzkpscbsfkapfapcqkupfpvbvvtkwcsfprcurcbptpqrqbspxfztbxpbpuzvskwcruuwncksrbsrukzavtxuxqfprcxckrnqbqavckuawpqkwrrzburstbfabfspxwaacwasxqkwtfzxzxnfwnxkpwpzbxaprfxztuuctubzxtfnbknvbrxvbtwkrbbkbtafsfbtnbcpsuctbvruvntcvrqxqxxzsckvakfxxrnfukwvbnxzxtcnnrkwwkpqavvtxzzaravknqctaarrqsknxrkbtkswqqrxfcqxaspupffqxukprccfptruzvrawfpqzzutrkfrxrzavrksafuwwwzttxcacbrnfpskzakswqqqrprczxznkcsxwsqwpawswnftnwqakxtukpxancxutrpqrxqrtanbzxrxtuxvbzqvaprkfzswzxqpsufzwbazszszztswqsbttrnvrpzwfqutccskzfzfsukxfupkfwnpkuptkpatqacfccuqaqbubzuspwqzptnzwaswqzwksuvbsuspbvpsawwcrbuabaannnapcbnvuqtnqxbfbczvpkurtncqfzprvvtfkwrawkuxwtnwattkkkfvuuwcwqqsfkqpwbpcwczvtzkkxfsbrwqvuctfwskqswrxxzzcwcqzxwxsvwukkaptutusnkvcxrvunqkxvfbrtnkusrbvrvbnskakkrzufkfxkqkrtnzpvpntnktscbpxqzqnupwaqbwptbzzrsaspabpacnvkzqfkucurvqftzufrkpfnwnbrfraubnfwqfpbrapwvvfvzunvaqkbfvzaaupnbqawrtpwqbpsnvbwaawrpkfvtqcaprtxfwcncwkqppuvrquxcqtunwzqfntqnbvppptknuxcrwpqkxfxnbvpwarawqqnwptxtcqtckputrpssaswtzfqxzztquttznpnzbsqrrukwqucqwuvaazarsfckfcqsazunkauqrwvcrpcxputqnbavxksbxzuxpnawtvqzfwfrwptzsrqzvrrsxcaawbpuqsnpfxtbstsanussrcfsqnpztwpaxssbktsaankvtkzranzvcsxknpvzbpvbfpcbvrvvzbpaqukczkvsrxsapwsrfvafurftzfxscfzxzarwasbxrafwusxtbzkqqavwwvaqrszkccvsnfvwkzvvfutntaqvnvurpbbpcnpkabxqxcapuunvxbvtxwscqxcwukbpzpnwtwapsqtqxnvwvwqqwrutvnauunarzwtazqbprbucvvfzxxrxqbvcncnfqczucsquzxcqtakpkatffkbzwpvvafbfwwwzrsvatcbtzkkfsbzruabrxsuqztnwzntncaqxbfawrxvsrakxpbrutsskbpaavtpvzutpccxckvtsfvrnkqpqcpqbqrcvkwckzvkpaxvsfaacsnuxpcvvkbkazxvcrwvwccnarqsantwktvxrufsucrbbutvbqtqqswxkuwnstrcapzzfkswfvwvctuksbkaffwxatbaffvwkxaazzkrkaaqnwcktpvsaafnpkctzznacbxbwxkuxazbscwtnpaaxbxfktakuxfttztavasnbuvtxuxrscfrxkxrwtuwsbqutrczvnkpxbpfkqkwpscxzuknxpknrqzkkwrwwxkxkcwuvqasvvxkbpxsswtvrawkqwvtattxkzbcnsavvsrrkfxkwawftvbufrvqksknvqfrzzpqnczwrkkqtwwswusssxtcsukfxtcxtrbsqpfaxrxbapuxbxqzqanwzbsrssxcqncccnnfnzxcatnfpktvzwwrqtknwcrpnkqfqakkwsftstxpwwcaancbapfsuqztkqctknanqqwtukfsktauusnttnrkbrfvnwcsvqspcrvaptpuwtcxzqncnrcpbfkxpqravfanxvbxuunwrwuqvbcscwbautczsfcwntfkukuksqfwffrscpvzappbwvxzxfccrwncsxtaazwwavtbbqknzfasssqzfprxkufasvzkackwxscatcstzczrxcwxtwcbtkxvtwrztasuwszqvsuxbnfzvnbvcpcursqrvcqbwsusxvbnquuckuwwkkbsufpwaswfasuusxupafsuvsqnrnvcnxzpnfbpbkbxnknuzxqcfwpqscbqwbazzkucbqapvtbqufkfwsbwqtruanrrkbsccnfwxwnxzvzackrfnzrrwtzpanwrvkrwxbsqvqxvvrtrtsbspbwckwustzxrntuzkrvaukxccacakbzqbxxuvkwcwnwqzkksftvsvncabkrpzvfvkpwfnxkfspsnubfsvrtbxrvktcuvutvrbssuauauxcffrbpbwbksbzuavvubsvtvqrfcuvctvstapkzarnvzpszfqbrpqbxqqcsrrasbkvwvnuwqvncnuqrwubcsqspszqwxqqnzntzqpkbkszktcqqxswtvsnkcbqxcpbpkzfwbrcssankxtuuqakzxufqcvfwpqxvafqsuucqnzqbckckqapcaznatbtrsszrkzqckzntssfunzwcxsfbaktxszvbvvfszncrvnvcfuucqutpwvvxatfaznsqwbtabnrukvpanpxqrruzcrzrzczswpctxqnutwsvukkfxuvsspzwzwxzxtwpcznuzxfvuzptawkuzsprrpqakuskukasxcksxpkcctxnprrrqatnqqbszfxpranbbxzkwarwcxbwtkzunbtzpszqckznkvxxvfkvuuzxruafxbsfvunpfvatvxubattawbncrqtfncspbzqasxvtabncwbcttssrpsbnkkrxtcxpfzrcxtxuvqvanxnbksunqtsnactzpuxknavtsautqxqfnffnwubqxkucucxktxtxncfpwxfpcqnuvcvqpwtzwqswnfpzksapnnxrqppzvaqrtuanwbpufkcnxpbzpxcuntvasrnpnuuuavzbkqpwatqtqszkzwzxfawvcczswqffvqtttwrnnspvzxbzakrwbqbxcpktnnzaauaaznxbbbbvpknxqnvtxzrnsfnsukwcvsckkxqfkfqswuwfpztntsfcrsakcfztxzxnrrktxxsfcksxvcnvpkbfxsqwqnfqrzpfukkpzcntqxqwsxtbaaftuctfuqvssrsxwaqqrzwzusscxkuftwqpzkqpzuqabuqpzxwxrpabznxvtfqckvzquzaqcapwapbvaxptzpxabfpuwuxxvvtxxfkknpqzqupzaxfuxzrvfbcaqwarkwrtrbfzpwwpnspazafckcwpncatsrxzuztusrxrqpnctabwxfpwbwwwnfcscvqfbfzbcrfwqabkqbqrvqvxncrbnnrwcsukqrqwcckapuzutusaswpkaazcksapsztfuxcxsnaanrcqnxpnnffafrbbcxvnrznzznbkqbrwfnqrrtzrbufbwrxwznuswrurcxfzwpuqakazbacrvnqqzcppvvwcutvxnrratnszvkuuczbnpzwcqntvrnfbzprcqfanxvckrpuvtquzzuqcqcsafzunttafrzvaswppcswfsraprrnrxqfawtqxwrfbrwtbvrppvvfxzfbuapnfvprzqqqvqzbwqvvppubfpcuzwqvwqpsfcxstanszsaunpvcbqrqwxrrnckkwwpasxanfrkzrbtzukwtbaxskpaqbxtpsfrtfcuvrakrpbwzxbapqzwnrwstbctffrvqfxxxuppksrstzxknbppwtffzqvcvtvarravvvvrkcqxbvtsrbkrbssxscxnaxzpvftcksbvpavwcqnzwptfznxunfrazacwffucskpcvfsnzazqpapqszcsnrrktzknxqfurvtrpuwpqnracatkxnnrrfacaunzucfwccvacsrburbtbnnuxsrsxfzsbknsvbtrrkzscuuktrsnkzrusustqsntwunnaprwskaknfnbfnactxbnastwkfcfnxkfrawupbbzubprszqaffcqcnubkfqpqzcbfzscwvbvnfxqsqwzzwtfzxtqqrfcnxzbafwcafatbuxanvczzvtrrkswwfprzsvccwrvxrxsbrncvxpbbaapvrqnqcbpfcrkpvtzrtvtntfwxwskrtxxurnzkqcxfrfrxakuvtsvucrbutvrbrfxnpbskbuzxuwvstnavpnznxnzkkxwwvartbwnqbvskvqcqrwzqaafcarpruzkwpkvutrcxnfwptatrvvqxquscrfpqaavakxrqacarzctfnrcwpfrzvnzpkpabbznqrbxxfvznxrauwzvnkacvwxqvpzcqaxzabtwbfnanfnzxfpqarnpkvqbpwaxrvwuwaunxawcsvsrwnvfzbcfqrxuksrkkptrwfcqquknauntpnbbaznspbnqkurcuvqpavccvftttzrnufnzncasarukrcxtxafnqtrpurazqscsvwszwucbnvbczxvuvbxpbwpfpunprqkqqnubssufnwpcszbnnasrxputvutxvuvxxtxfrvvxbusfqnwrtvcuxkqswrwrfnvxavzqtnkfrqwnrbbnskuzcqtcscacwfkqwvavzcfatazrvcvukuknsznnbscxuqctpszcqnsqqpbwfrxttxuvfwqakxfvvzrntfztfwpqascfwkqfvzckaaancaktaxnustwccuubktctunrnrwrwarafvzktqbssfzuvkxqffrbcvuaaarwrknrtbvfuctkasaqrsptzwfavapzkfackurqubnbwaqqbszfkcfnkfuxprpnbcpnbpzwnvvzabubunvzcxnqfkbucfvfrvsrzfvtrcbunnfczwnsbwwauakrabqrrastzkzzkkcquwbuuzvfbatauqkfxcqkbbpvarpusbbfcrktbwavfnvqptbxxpwqkvbwczfxrswwtpvbapbnnxkpsqvrzxrczfswntnrawpqkqsastavsuavpbkcbsrfknxvtrwtbuwazvvnttvfztctvnstnqwvccbtassfvnarukkcnnnsnwsxunuctsqwttarqwufaubaszbpsuuzwfptfzusaxqkuxwnznctwuzqqwfbpvzfpvrwnnraqpvfnwqbsaxsfquwqzufwrzqarxqaqcpabqsrqzwkxazfxkcrkrwwawturuskfsutzpqkvfrazqvuatquvtxpfswruvbbuxznbuutwncwkfbwwwuzqbprcbxpbfbrxzcbpnqssnuvukvspwxkpxpkuqznuzsrwznxxktbabfvpuzwtuatravsatzpqaqbpuqwtskfcuuwnqsuspbbwqtqatzrqpwfunrwscpwacczpruckxctnfaxurwutctzuurzubzbsprfuxfctkckbnvzcfuzbfxkqarbapzzwqxrftfvuqczavaskurktstcwbqnrzpnwpfxzttzqqaucruvbanuqnwszzntkxnnqcqnwasuxkxsqswrsfafrnqtvufafcuxwutxzvxabxuraapxvcuvuurknkzrnuraxbvrkvuxzpqrvvqwuznqcqaqruubutvuunxfvczpruftuwznntzfvqakqxpukwracpzzrwuqwwxvwfxptbqaswqsbzbpapuxnkzwqxwcvwrafznbupzxsrnrpwtfznnnkzzvsfqnqsbnvackqrpwwruaqsfbbrppwrwvxxrcxftvrpqbxqwxkwrcfbvaqbzzcxuwqxbrzubkqbkrakcaxrvvtqfaazxcbbsacfaqvzrwtcqqxxqfvrqavttbvcnzwcnkcxqakbzqarcapnurvwtwtuakvukkfzbskxpbqakcsfkctszxarfkfrnrzssfntvzsfuvnvsznfwxtubnqqkfqfsxnvpuccpqcwrbznwwnswcksfwcvwvpuwkxktvtraaxwuxkvavrknatnkpapvzbbavtbppwtrtxcqnkafvxkkquzkbapftqfcntkrtvtanavsnabnxqstrqnkwnubzrffzwvcqprrcpufxqapbkkrbzsftvnpvkakufsfwucxazakbrvpnkkvkctbsqkfkvtkrwvuwutkzusvwpnpuqsraarxsnrpkzcfptkupqzszurucxukbwkvnskutpccxwqcntbcrxbwbxwcacxfsqfpkxwqvtbkbpszpwfafaabfkpaqbzackrrvwfczcnwwurvqktnqxwfrwnnruwvwkcbwrpvkwzxctnruwqcnpqnwtsbcbrrsqcbqzqptuwpbpzkztspvtxqktfnpbbfnxpruakzbwbnsvpxkuabvscquwbacwqxkraqrwaqtbtvtwtruxwfpkkqnfncrnsqfnzwxnrxksstktvcfnzwrsfpzvxuqqtaknktwrwnzkwzrcutwzpxktzkusvvznqrpswzpqauufnunpqcqvcpspsbqsakbxczsavtrbaarnkxukasfwknrxzxpwsfvctpwtawfpwkqtqstxqzaatvaaftnfqsabzvfqtrqprrqcauffukxqpsbxknpwtqwvcbtrrsncaurwxnnkvsxcrxurfaqtfvfcbncvvcurnwuvbnaztwzzxuxvxtutbrffxrvfncvtqxzxswkppabatxuvqfzxkuvasupwksnrqzkfqvcrzckkusbqwunnvpxqawcuqqqafztutcspnksubuawbcuztrttnzzvawfkxxbqcasxrnxpwnsxcskvvbzsqzxaxtrfnvtpakfcsnnfwntuzzwwkbwcpzwqcxqwstkrcanbqnxkfwnfukrbcskqcxxcttxfuqzxtkbucfqszvtpfsfrkrnqvvbarvzktfvprxpbtbcazcqkswbcvxxcftkbupsaqxtctancaxxunaxxvazasvbsqqsnkrwqassccsvxfuvsanxfvczavaxtsfzwbassqfskzswnfpttabqfsfzkfvfqrxprkazquvttbbqrabtzpksxkkcvazczksxpvqxavkwfraupuvupbznnvknpcttfwcrqtnpnuvbznpqzcnwbbbtqbftksuucfufvwtrkqfpxqfwfrxbaptrkfcznpkpvqkzkkqfzaswbxqwftppbatawfzqtrktbruwzcuqnpxnqufnxtwvpacaaavzbzvqbpcuxkpkpsfxavpqkpffxnbtztssvutwwcruzvsuftqrwfabnasvszqxsckftwavktwvkrcuurtfvzcpcrxnrzktzpzaukwnpaczvufkxkvazbuftvcasksazrswaacqkkpcrcvpvvxxnrutwxnwxxkzuqcvrbwcvksqpzucnczwzkctuwrtqwqqckuufraqacuxracqtnzxvnbfnttscbcrnwcwbfunawwnwrantnxauupnsfusbuffckszfkvvtnxxpknvpfwfzqfbttvtftvquracqunvauxrbpbwvxtqnrrpnxuwrxvkatnqapkpbwwfawnpxprvzxfkvatbbrkuzstwuqvrwwuzcsatuukfvtpuwxrpvqcutnxnswtknuswrtcpfwauvtavttpvuurkaxbwusatqnpvabvuqwtkzabpfffkxknpbkkqaswrnwfvvwvtntnzputsptxwffsbwrncszbaxcxwuxkcanxuavsnnwtqvpnpnspzktvbfksaxkkknvqrwcauzxkcrzrkrqqvftzufffkfatxnbxpxvztnvxzqxcupcpunaszxavsvbrcbfpnbwkcnrqvtbfvzunututvktnarqwzrcvprcbfbazuatvnkbfwfuccnbwqrcsptzbrcwnxrppvsrvrkkazzacbcpkatfvnrspuawacuswwnufkzkwfxusstrttasqxbatabcfzrsfakkbtncrrauquwqapsksankxnnvwpbqrkqbqsqwfzpavpvfkfpkcuknavvvxnncvswkkbknwpztsunvrbntfazkcnpbpxntaapwrcvuqzutwrtfvarntxkafxkunazzfrftfvawastxrzuqxaxnsnntksnuvvncnbfwpaxwrnvrtzpracrtancafnsztapcqupnzwrtzbcrkrwqbnknwzskccasaxczqqvcafwnnzuvnuzcbsknccvnabusvntsqknnsfxvuxrpwpvubxqtxxtfxaswapwbpccvrusbazqnvvncanxkbffztbtquzupnbcszwakkattftrnxwqkucrrpkzpwckrfbnvwscfrfafbbqpupkswtrxbqptqzsqzfvffwaauqscpcbkrbkfpufbvvbfqkskvppazurtwwppcvqzfvrcpnsbncaczfkxqufcfcvbxfpzpzrrzsxqxsuzxsbpzutncafsxcvnxusxbvkwsqrbvpqtpcpznvvsvqppaupqxkzcfcuacqnacvzfxuxxfpsunzwrtxvpwzsuwbwburpkaufrkpsbrtbtwrqzutwcutpswsuxftsxkkbutfqtkqkpnfkufzsusqpwnuksuwawanuuzasrrwfzvznvcxacpnspknrbbbtbfaarkzxvfvwpcvsfsnfpcnakusrpqqrtwnafqzpnnnctrtazqpbqwnsqrqcrvxrsxcvutacfxqcuvttavbtnqqpawwrrapvwqsfavfapxcxsatqqrkxbbtqwswtnkzfpqsncxpcxppknfwrfvbxttztawppzqtxnxfccxuqvnkqwpavkqqsackbsqrxqspurwntxxcazuukkqkftspzktuupskbvtfvbcbxrwsuqsuvqrtxncxakafsscszxucazzpwavctnxkarsbvpfawcpwsbfqrwtbrfknrksvwqtqznrtwvtunwvqwztxwssccuzvwppqczwftbqfbrszrpafkbsxwfrkascwxnckuvrrzsnxrrawqvkaxszrrtnrbvvqtbwbqzsqaxctfxwkaxqzvpwuzxcwpnwtburapqcxvbxqbscknzsxwrcqbaxcwcnqkccbrkfzkbtpcsxwnvuzbawwxxstrnnwcpucxptspznpqzczbqubrwbvptkcpwvvuqfnqwswkszqzsvuqzunfzukskxvrutkzpusftzswbrstsxaskusapwnrtqqvwapxbcxfvvzcpbwrzqxppszcfpacxzfknvbstrnnfbxbssbssqpzpqppnpfqzqazcanzbwvuzvqvrarxszpcfkzwvwarwwzxnvcbkcnkbzrcnqzpxxabwarrrvqfsfzzvxswnpabrtffzvqbrkfvkvfptcptbsaksrsnfsubkuqaqbbarbabspzrazzwqwfvuscrxurkpknrunvcvppcuawvvfbtubprfbkpqwptvkvuwssqpcnxtsukxzvfukupzaaawxnfruusvupzpnwnqcuzkcbqspbrbqknaxpattnfswnutzxqatvwavzpkrswrncnawqaaaqrcznskbsnqbzzbwpavsbpnttaxvtfvwfrszpuftwxuqckrpppbsubpqtprtzswbrfwzsbqttcwvqvfpzqkrqawtkraqkffvptxxwsbbbbubwqkwcfkqffsnqnpfuaxzwvwvcnaaavqnnptuxubnbrurkwrzfazsxsssrkknscarwrnbkxvcabcbsbrtvkntrbcpapwcvfquqwpxcvkxavwcrankqtafunrcrvuqqzuwcnvctnssbvztatzwckbfqkvwckzcvquxzbqwusukkxnsczqpzcptwxwqxarntttxvzqanstxrkbzvavxxcbrvfubtapzbrnwubwtskqrwvbwauxnwpcxkkptrctbbcxvuqruntbaksrcwcwuxwqtnzzcqrfsupktwzrfuvrrurfxfntbaqcxaqntrbbsxpqqzuwfurwzkukcfcfpfkctksraswkatbqkftrtfaxnxatvvuttrnqvbqrpvwvxarnarvqrnkwuttnxxzzwwsbpqzpuaztkxsauzcvxactappnrsxaakabqqfbannwbpprnpuqtkvfkkpurxszcwtpzafsfvznnrxwxzqpxcbtqkrpavzufprazcwxpkufaccaqspussbxtkzpzfakfbsapxfbswupfpaaznsnvsvzuprunfvufwwkkckbtqxxwftwpbznncfxvsnpcwkzctnxsabxufkuxsarwzrspnnswwkpqapaaszwnqrruzxxprazcxkfxaccvcrufvkxwrwcsruatwtnpbvkqzkcxnurusxnpbxttszvkbsnrwtcwffpvappkkzvsbrnbaccpvfupkfqpwxnuxnpzfvacuxwptktcqcrbzuzaaqpfzkvafcccqpzqvrufknkuswvukprbpqfzcxswbuvkwcfkpwpzarfvffvntkqskcwtpuuarzknfcvqsxxtwzrfpntwbnurvsknvucurxrpunucptkkusccfcnpttkzwtrzfzzxbrtnkvzkvbqxupbrstwwfccvrqtrunaqkxskznrxukqpupnnswfkxwpbvzrbkzqraznftcpzfbnzwtzsbvpstvzxrcnrzwkanuxaqctpktapbbxnfnpzrwwbzbxzuwnakcnwnncpzzrvnucrxtffqcbvxuknrbvpunssnvavfxwcurucfuxqqtsxqaruprrkvftknpktaszqcstkapnsrpqqsasancsspvrzqfvzqzzvtwxvqwtvtnurkvrfpaantbkrtftuqavzfkqvqzwwxpfzrffqrausqawbzqwxavpcxxnkavvwfvbxpnvsvkwkwuftkwpsckxktvscfnswskknwccuavfpvbpburfuxqcnqwcrzsfvbavcwupvppxzkfqrfnpkcnkpnbankrtutzsqpzpvwkzapznxwnxkazkpnrfscczrkbvfsxkunnnrbqafqsuvrkanpfvktqbnzpkpnrztzsaqntsqfaxurftfrbtqurabuzbbtxrrtbbwfsxuaupbczbbvcwbnkvwsukfrzwnpuqusfbxzrfxnnnwapncrvpqrtuvauabftcasqbaxsnfbqqspxfunxvbrwrvbcawcucvfrzczwwzqknnwsptuvbttcufunxrczqznftfbktcpvbzpqxbtncfwuccxcrcfqctbtbfnzvvxatsaruacsatbqzruvavnccupvqcswfxzxbcuwxnksvbpqbnbankraqkkssazxaqsrntqnpcxknqvtrtazrvwccnubsxpcbqwwpckafpftuwkakpstqffqcvvnpuztrxtxksfxpbauzbwspstaktuzqupkaqrnnwbtzzfawfqqanqnwfncxaftbbsxqfffpfabrkkntwpzxrfnsnsxnkwrazpfvxzkwasfxspwvxzcsuaruwqptsrtnfukxrwsskuabvtrkpcacvxxbwwsvvkzzztawbuauapscazqapwtqwwqwnwruzcqzcfqssuubfuwacnscvczuwwkxfpbqbbffvksfbvtwwrvufwxstazuwzknsspbcbcwxzqtrzuxzzqfknppartrucqbpkprcckvqfaxxcakqavrkzcqvrbfspxctscvcnsaqakakqraqswuktbxaccupvqrpqrwbrbtxpkxrwfbxvtucqftunzbffkfsztvzxwrwpxtvkcqwrbranrvwcrfxunkfaqrvkvvfzkfawkccwkfwfbcpqufskrtkszbsuxpabntcqsfzvctskwxqptafxznvwfqnkkkkwcwkcbsfkuznnvzzxktwtsnvscuaxwracsxnxwkznacarxpxzscnqpufzvvutsbfavvnvvkbzzbtvkbnttqwnppbxbtkprzwqtrnuxtuctxfbwccxpskntpqpcnwktfxqkbfufkvzaruqsrquwrtpbvkqxxnfauqbspbvvknnczfzrkkbzkaruprcnkwfsspkrtzzqtknzktrukqbwxnuspfpqqknnwwaktufpkuwqnbcbtctnnszsvnfnqtrnnvptrqrsksztkpxtnkvstvnwpzsxnzvrfbkvfcxxsztrautppwqsuzvkpascafbxpxvsuvpqkvxctzrpuwvftbkzuscbrqrqxcwbapzffzvqbcqspntspcxvnrkvwtzfvxrkfxsfrucqnnrzqkbtzcswkzzcavrfzavffpkncwffpqsrvtbppcncswkfzwfpqtswaxbubqvskrvnqruxtbcsfcczwxxvkuzctkzkpqxuarbnpvwbuzakczsqqxuppfxcctxaaatssrprvrszsvacqcsszwsfxfqxqzxazzzbzpwxpvzrksbfawfrfvsfutsnsfaffpwnfknrppwwwnfqzapbnsspwrkqspfswknkkcxntrnvfaqzkscpnpuvnwsknsqcvspxbxrnnbpqqtvtwtrnbcxpctpwzuvzanakwtkrkbbxqkcrvcpauxcfkxwbpvfxssfknnbzsrkznwstabxqcrrfusxauwucrkaauzzsfqbvanbxsrzrqczqququvwkrupnqxszpcwqkrvupqptnrvqxsntauvxbkzktxczpptqqxfpbuuwwqkaranpbrttxfawrvtbtazzpbscakqtbfvunvxuwbqqxprxbpbkbztbabxacctazwfpnxwsnrknczqsnxrsufwvnxczqpnasfsfsnfbqvakrwwwkkxxrvranrpzzxqrxqxcabbcnwuncbutzpfnsusxaasatvatzrfbucpvxupqzsabnpqxwzcnqnucszbptqqcrsfafqatzqvbpftqkrcnsrvpurstbctkskpvfasxftztfwwcxpsxqqwuaprrfuvqwnbcwpbktctvtkzxvtqbzkwbrsxxbbxvkvfcksrukavqwsbuwfwwfxvskbvzsnzczqwtntzfbfnvvubsbbtccntcfxarwnzsvrwvcrnvcuntntbsrkxavtrvnbvuvfzbwxnqtftqprwbtqatfwtrcvnqusaqpxwucskuwuzfwuvctbxvbuvsfubffptvvpupsttrubfaqfcvnrvzcxpfzqvbzrvtwvrckzrznkpxnaazuvskpprppaqazancsznzctwztkrxnckuwwntxkafrqbabwnfazaxfusrtcszstabtvabsqarputcqzwwfvuwravunvtbbpfzcrutqzqrzwcnaquabqpxzuqqvktkurxqpbkfrvnakutsvfcwtzzbtusvxssssazsnrwxwztbfqbxunzfxkrksactuvrztvrfzupunqqvxaqkxwfcxpastucbfunpxxrqkvwrakuakpvvksztspqzzutcqrcxpnakkukqxppxntbnwucvzfwpqarvpfzrbcxtaptqaxskcunzscvqawfzctzzattfzfktqzzrnuckssrusxxuwkrsbsvvpznzatbfsnktwwfwwktqvzqrnsvkcxabpbzvnppnqrrxrkuauwvncpqzruzaqrvacaruwqbazsufqbuukcvnvcxzptcxaqzrsvburxkkfpwssfcasnwnrfvrapkwuvttvprvptxcfbzaxtaxspvqrtcukanwtpunswzxruaswtzsppnnkfutvnzpnqpxvnkscbpcvbrtfzafcrbpuxrxcpkuaunabskppcuqkwrfkczxbznawppkvwzspvkktcvvpbawaxapacwufuaftuctsrcbrucsnbtvbwkkxkxcqzurswczcxxcssvbnqaaknanppqwazkqtsrqbfvnpxrvvzwuxavqqxwqrwtqnaaprbnqwzvkkucpftpxbpravwbfkaucxnnwbpasvakvxnvcwtnuatktnbwqvbvxsaaxpruvzqfwkwkztavattxnbtanzzvvrbfsprnakctrkbvwuuuzasrcartwwuvutpwvbnxnwfrvaffwxuarakbafvuwpfuuzbxsqzqusswsqftwnbwsvwszrkkqussvrbpzrpzfsnszszzzzubkfcazbcktuvpzkqpxntpvunvzqskfwuvqppqbxpuppwcffbwqwvvpbuqqaarqxaznfpwfwxsuvuxrnbusaubbtpstkkvwbusuvfcravztxnsxupakzqpxqqcnfpxksutuaxpwpzucuxfpfawrrbtvpvftxnavfackzptfzqafffwzaabpwqxusqtqfbbpbtbptvwuvnuxpppsznvvxuavzqsxktcacsrbaxzkuqwbnpxkbzxvswcwswzzbbbvpxppbxbzxzqxzfnbqxrpaufanqwrrkatwrukwubtnwrnkwuzafsrcqfknqcuunxrrqrunpbqxzbknnbxwwbkzaftrvxqskvrpuvurwanuqawatpxvvasqpcbzqbwczrsqnqnpczkukqzqvtazaqqutarrpuuqrkuvksrzkwnxpntsuxfntnzttwcnuwfqxzzfrfkkksqnxuxqrbqxrtakrtvnnpkcbtfxcfskaptztqvzcfvuvpttknrsnpzrcfsvaurztbxvvuffskfuptwuvanzsxcsavbxkuanbvkvkpfcxkuxknsqcufsfvzpuksfxbbqpptzarwwzkkkrqzxnkcpccnxfvfuvzukqzfpccafxfxxbbxanwfqqzkcscxpakzvpqvasfvftbtuabpxcnntbkwaurtksavzczpwnubakzqufsrqwvrbzaztuwrpqkcxvpcxqtzqtunxvrfunfwukftzscputxcqcvzcxbqtxqkntzqutscswwxzfnpffbtwpbxstzrrafnxwvknwxssvxvuurrxbtvwqpwfukcbxwqupbuuwcbwzqfcattwktqsntxabapntqtvkwtwtpuksqfkcvxzwcvzbwabwkcnfaxzqbfsksnzqxvbcvfktbsbtafnxxrasrkpzupbuubvuwzszvswwqazabrvkbqpvauawwbkavzwfcuwsubrpnaqfcxqataqwpfwappccvwbczavassqfttukcnnbtckuvvxrqkubvwsnfxqnqftppvtccwpqcwvpcqcnxuaxuxfxzpvpkzzxsrnwbqtcbbzxpfsrwvaqtabvcpwnaurufxtnxbbcrxwktafzfpuxqfczvascuskwnvuuvwvrnnqqwxbvbscfkrqqwkauprfnxkqxrutftnvqzxcznnkkaxxnnafcarncznzxksufpxvkbzppbtbfunsrnpbpstukpzbuzsastbrzbbwfnsszpxqavntqbvkvnczpstrkkvxqbkrnzbvraqswtxxpsaaruzrxcwfkpbavbsnwbfuzscwaazwcapatrnwfuabszawzzzpsswncbxnrvtrupvcbwkvnfnckzqpxwpuutbtfsvanaxxbukrxrvqntuqfqrsutxccbxucztzquvznawbauxwcaczrpcrnprwxakpwntazxcvnkqxqpsxvputfvncwbfuapkwpuvnvrckfqfwfqwufunscsbrbvzwqfvavzxwxsuqzszakatfrzauqxqsfpvbfqxwzfcsnbwnquwquabptfvabtpkfzuskftpzpqqcaszwvwaqqbksntrawxvzrukupxtwrwskqxfavwwrptxnqrfnqaxsavcqavsrtkxunvfauzwxvvfzrrcxstvaqxkrbffauwqqtfzxtcatsrfnstkwbxnkwcsxtfspuqcsqknsrppuwwxtsvsccvsncqbttwtstcbatxqbnvabrunuracuscrkqwvtbapssxfvnbkpbcwwufqtpnxtqcfaukuazvxppvswqwvswtwwnfknfuwxwussxwvvnbbakubkbfarrkbfpwvxafzqtwtzbqcvczxrauwacczpcxqzzaanvvkpzrpffctcpqrwuwvbttsautbzzwzrqpwttwxkkxnwbrvzpzzqsuxqkqxnpcssbbsfwubckvkxkfvzafkfzpzvvnzakbxquxsbqczxfupfxpqutswkwstxfnfatszfkvuksfrpcuvxzfwnczstcqbwsntnputuvubwbwwvavkxqszwtqsnxwktzqkatncbkutubawzwzafqrubbaupcvbkktbapskktwpxrvratfzxxbffqtbvvnturzcnrpbnazpqpbzwnrbxvcpcwntqxqxzunpacwtcnfrnvaaraxqfbxnxccqqqfwbxvwzfwxwtsxrsrwaupawxczrpaqwrqraakqkunxnwzrawsnpkzvwczkxszsranxvbwnzurruaqkwrksswsucwpkcvzarzvznbrpxbfxwfakauqqrnkxvapzkwbsxnwuubktfzrzwktqrnkbpvbkuszpcxkprcpfzabcwnpvtnpwnptqafzwatcrxzrnrqsnaxavvbwfnnfqrxtqrrxsscxnqxxswfnfzuatanwpvkbfaxffwwxsrcfxwwkzrptwtrbvtaqkbcafwknszcauwrbbauvsqbsbfffasctxfabqzfavxnfbppsabrnnvcbbszprwvpccwfwqrksurqunusuznappucvvsufqwuczspqfkccntvqsrfatbvspuvcwfbbnntwsktknrspvufqfuqbfvsatfakuurcskcfazzkwfsnavutbpfwspqskcwbpkbqctfnksprspfzcukanrskvapqfrfsxuuzbrwcpcxxuznnbtxtxcrqvrqqrncvfcptnwbtnurrcabpwstqvcaksasubsutpqcrxtxwbccpxrqcqpqqatcwkrvbanwkpvztvwkvtsxparnswfntstwbvxavkrrskbxzzrfpbzutpxwvbzkbqabbbkpsxcvtxkxqrtvunnsbcvxtctnutxxvkswtvktnpqzfpfxupssukbrfbkqrfckcfwnwavavuscbsksqkwtstwuqvxtrbzkfabznsvbxwupfbuxxabvspbrqnqxvkcwzukszrftuwuusztuasfzwqvxcvzkcvwzqcpnwucwktubbcbcwznknwxwrzquvtzutqqcxkrrrktrwtxcpcpszsqptaxftvrarsrbccnwqusbvrfvtfpbwsrqpxkvtkrxcrrbspsvbzpuxtzxsbnsxzacxssqxcanpnqbkxkfpbfpfcctfvkccuzqbbwcnkzppxnkcvqkqazfvawzskcwtunkaqbaavnzcncqfzbxfwubrczxstzskbfustkxwsccrszvqrcctpnaqtrnpwuqcvquxtpxxvqztuuczpuxwwzatqrpwwqnkvkkzqrxcffkqtqstrtkubrbzszaatcnrcqptcsbsapfzpbbrbbfkcbkraxkwnvpawbcbtskkcaufzuusxzurbrrkwkbpvpruwfqfzrscscvbnkpxbnwrwzwkzbpucxvscvnabpxfpuqusvcprcrcpnkqppptkpbuvwwrbkpqruuatkabppvrvuvvfcxnkwqzvkxvxbxzzcrbruxzrbstzznpknauakxqbfrurwrsubxwkbxbafapafzcuzuwusqfusunascrwqwkwpzpwwaxxptcrbzscxabuqqtkkzskkppfucxzxsbtsqnssvbpfufauwupxvwarrfpxnsppuzctnuasfkrprrtqvqnqunbkkvpbtrfpqsrukkvbffqsnastkxcztarqrakkbtnvvxuunbwzvvkukvwkpauqvzfbpzznrzvttxuuqbfnxbwvkuqpaxcxxakcwtqpbqrzbssstkzctbkvpwpzkqqkcnuuwzwpuftvcakqxuapzwrvrcuzburtpwpuqaznpcbavbvkfkpcwftuvtkpruqxwrqcswzkckwuzxbbtbckknrsbpfnrnfckqwbpkwcasxwuqfvcbcxnckpqnqubuvpwsspuqqzzcnpbtfqunraztwfzqarfvcrpxsfsnzuzxbqzsabpvfrcxkzrwzvxsptcpzqbxkqbwczqfutcpkrxwqtcpcrfaquxctfccpcfzrxsrcfzftzkqrnwcutbfnuvbtnvcpvqnknfsquwfnwfvpxtbtnrbautfazawcnvxncqnscvqnfuwcqqfwpsussuruawfvwftuqkvrrwxtawstzpspxczzqvbusfnfntspfuxnxzrnkqaaqqckxnzcnzvarccrvfvqqtvzfcnnzucfxrxqncufbcuuzuttfxcwcfkpqqptbrakfuxakqbawrxuwvwsrsurknrttwtnuzsbszbwspfurxfafqunwpqrwbrvwkbkvxwvwkqapxafcpvtzvnxbkqxwnctzvvskqvkbuastzrsvxrtfstnkftsnfrpansfksqskfvppsuuksqxxatsqfasktsaaatfunwvpvvsrwtuvktsbaptsnsxttnpavzrssxvqpzbctkrfbarusvstrpsrkwtzspbxqtsrcnxfasftxsvuvxntvpsvqauwrbbuxcfrzzbuasuawnpkrvxtbsxrfxstrznxzkuqwvsurnznxnnfwkkrrzrurqnqsazssfanvvpctvcszrtturqpasrpquxfukxvuvcfwzrapxbvcxfrcqrkspwrzukxxvcnrabaxnzntuxzpqcwfbpakpqbapqrfqupwaxvbzvcrkrbvkpswpbvzspbtwrcsntxvurrpvxpzrzccfzwaqtqvaurxxnuaqxwkczcuvnbzqfftpxrwfzbutnquuafsuqknffvcacfrcnffwctftcutqkwbfstffpczanntqkwuqkcxpufcwfkuqrtapxbxxsqfrkxfbuwqraasfsktuavwuczsnbqtwcfavapxxqpvkswpfwvvkufacbttzbvqzbpptsvtxrnuvatkqpuprftkvnwpkxapfkbnkafqczufxkpkwkbtqrztszqtkskpvwfxskrnsusfvnbkqqzrcunbtwsqzbqqquvatnwnfvxxnkvpkakxrtssxbcxppstpxwunfbpbfubtzpskwaxsqvcntcxrrtwrpnzvzkrczxxsrzxrbfqpbzwzssrprucwkkwxrpupaskkxqfzsxswsbswvqtxkusnqtkuxrzwpufucxtspanaxfpxnwpcxtabzqkkbsnqcnvvcncpsstzafncftubprsawvwrcsvncnwsauvqbsrrzfksqxtutpfczraqzrnprwrbuaptzbzwucnkztbbvfxrqvvbuqxtkvvkknccbazwnaqcwvcbuzuakpbqfnsckctctrzvspsrvxufapvxqtrvqrarscnwtabvvuxspfvxauaqsqznbnquzbqkuzcunnbbwxwtrrsacqpzpavqrzrxvbruutbvnbtbtzxxakxwbcwtsacnvrskxscxsnbbukvvnaapwqwnvvnrbqbxwavwnqpvfzcrnzrfwakazcnsppzsznscvrascwcnuskfnbwnczrxpfprvztxbtucqxnrkursacrcutuckxxzfvbcarppsqpwanvuuzqsftwfntftkunfnvkqbzfbputfqtfbruakcbfrncfxbrxuvkbqzpczspqktzvtsxbtzqtatawwunqprcrfuvcbasxbucqparvuswcukqbqcacktrqtfbfpwcxrspcpvtbrbcvtkkwwquxnanavsppxzfqukrzsxfxznpqurrfwsnvtwtctwtssqustwtwznfnfqskafkcsrxtcxnwcwwxrfunfftvsatkbpvbscqtanqtwkrcpuzktncsrpuwncrxufxakpcufxxuuacappbvzwarrptxnrxazvzafafpannxwbkqaxbnqsnzfkrbskuvzfabnzvtssvbbrvqpfbxfubztxppznzbuqzktfvqwubpsfvbqpbtcbnsvpfusuuzbsxrfwkxwspvnkfffpzpkxavsvacppxpfqvwxvcwqntkftcztfwkszcsbxutpqrqaftfwarpwzwvnnrnwxtfcpvxnxpfswsbsvpuasnsznzptpkfuppfxbvwfuaxarckvccfnqskusbbcvsukuckwfknwntstsbaupxxxunsftcxxqkvswwqzsfqfwcpqxrpnqrstkrqprcuwqqpsvqunntbfctnrsqnuncnsccxkfctzwatfsaaxprnzkbkutvwuaufvpfxwvbtkrcqtfsqtvwcpfrnczsxqsfcbzvrcczvwrtwutbxsqsrrawqvtwsxztftwvucnvxswtvrzrqvrvrpsctttrwacbkqafqwnrcrrbkaaxbcxqbzapztzutxcqqprbwffkqtqzpfzfwussffntkxsnaqavuspqvnxzxawkbcvrsrscxcpvupspauuaazsffcpsnrqbnunvqqzffwnxkaxxstfkqrcqntufxkpnfavaqtttbcbzwxrwunrqznzfzwxvrkuatbacqatsrftarzrkquusrkcnfvxkkpnctvbkstzzrabzkfvcuvuucqtzapuuavnvffanvptwcqnxbtpqsrruxxqapupbxnswpnunaptcntpvannkaacutqtspvwqwcfnbcknnszxbrktzftrbfttrkbrxqcvxbckptukvasbpbapakkftbzsrkxzaxkazkpunxxckssunprcfsfnwtbprqbwuakkctasvwzzwpxwwpzwpaqxszaftxrcaxbppfzxwqwvrprpxbcruuazzzwawqnzxptrvaftqwrqftqprqcbbszqwtquckqfntctcavxtwacaavxvratrufqnaxpqnxxnspttfusqspwxtpvrnucbavwqccaxruaxkrtfszuwbspxqncxwfttquubzkspzvtbsqsxfrkvfszxrszxbsanfxanqcbzsfuwtfqszpnkbqqaufkpzvpcbqvbtzstpafcqvnpatwntcxkccarsvuzfnarsrapqbcbxfbkfcvaxtnrvpffxszxrstqczpfursrbqwksbfkxzuxtzwrxkfxacvarcubckqszrskfkabrbantxxntvpzuzpcrkabvnvkrpfpavnrxbkwxcqvbbrctfpwfckbsvrqvcwsbtbrzxrpnuqvffsnvuxbtwqftrvkvupxkwnbvrtbasxpacttbswzvptqxsptqbxfupzfkawwwwwrrztbtvfptvuunzrswnptnfbzqkxtxpckvssrnkbpcavbatcbxnvccptfnpxrckzsubqbkbpzpavrxucfufcvfxubxpxrtqfqnnnupkccnxvazbtxfxrpqucsfcwskazzuqcpvvnxasttfvscpqvcxxbsfvvucxcavpxfnszfncrntwaakvazrpqfxfszfbvtrcsabvbbpqpbnfwpxzfxpfnpnqpfrtwwzvkzaftsctcxfxcpfznwqnscpscszqntcfxacattttxwkxxafwpxuwnrfqwbttnazqqbrfckvrswsfbczrqactrqvfrsrcvzrrzkbtbrtcfxbxvxnzqkwvfzzwcftatqwpqrwqqkftvavxxfqnprtfkaxfuxxcasvcxwvsktqznktfqbkqnxuawtrqftptvkqukfzassqcwruxqrwqfnabxxwruqbqarwcsunvkccbkxaxzsakaxqsnuxpbpatunxnxkxxqfrxtprfxfzxvqcnkcsbqpbbxvupcxuncxsraxfwkpsnqcapsbatwqpxrufknttbfcpanrcwbfztcxbwqtcabsxasnpzqqwfvaxksfkbpsavvvpsuvafnwtrbqkrsnksvpbpwzsucquuntxuqqskrcrkacxxtkwnfpznzwbunafqxtsbtvwctrtpqqcbtktpczsbbvvzzbnbpuqwksvwvazwnncbsptwqcxucvusbvfrwxsxnbpnwrrttwxxrswsnwxcfwwrsavvfbxkxbvtwcfuqwkspwftscspfacvswaxrppaxtwwvwcctqpbffwakbaqbkupbkzvwvbbnwswutkxntfqzttuqrcpasqkzftrbkaqfsbtrrtaqqusuctvbszcwzprnvabkvbcsxfnnqcpbvzspuxccfqutprccxbrqppfpwbvcqxccuxpankwupubpzwaqtwusbzstnubwrwftfrasbxxucsnbspkcznvtxtknpzkruatskwrcxufcrkpuncwnwrutuskrazfcznnzzxwtvvxaqsknbbuzkppstutcktaukxpwfszbvaxnztzxzkzakzzrtbkfaatkttvcaaxqwpkcanrpxtrsxknpvsnupcbvctrxpftwzbzpuvxwxfpsbkrfxntupxpfuvscpakccxxczzbkazsawzrackkcxpqsncxvzsuppzkkvvbtfxbxfppuqpkaaspzbutxbwasvfxxcnzzqbzkbqbpxvsnurfkwrtqvvbvftxzcstkvqcbsksbnnkczcvruqarbqawukfquscqfatnuvxtxbfpwqfutttazwvzncwqwfqttwranabfrarbkqqwuauzpxnzafvwrstvkwufsxbukfckkcrzwtanptvzvqbuwttxxafwprxcasbwwspazpucabawszubuqqzspaxvwrsxcpxzucbkptqckbvqstwcxbxpacpuxaxwxapuruassafzczsqqzbfbsxkvtpktnfwwzpabbzaatpkvtprrrvvzwvkvqvpaqrzafvxknwrstbcafbtwqxzratkastbfqucpwtpfptbpzctaswxnvruwzqppbapafxpavzqxkqupsuuuwqfansbwvfsaxvfswauvavbfzfqtrupbwbsxkbzrnxwwaatwkbcvszkkqxkbwfsfusazraqxvsfwquuvsctzrtbawrctqcpapbrkbprabftbkxkpubfnuvpqaccrprvrxscvzkfwcvcqnqqvsawznpnsatcrtnvukzwqfspnbkubvrfwpxsvfpxqxckvksksqnsnvnfrwvpzsarszvpvpxzartqcfnpfqtqqtssqqfbztzpapskzzwtkaavwqrbrkzpvxksbwsxfbpxftnfpwkxkppbtacnszcpkppcpbzwtwkzbuakabbuzruruzkfkpnqakzfpcfvkxsststpwspcnrzbxfvtuuqsxqazcbqwcnnwxnkswqfcpnftpvvtwxswaaqfsvtzcastxxwwbtpuczpnatfftwscpxpbunwfpbkzsknfqcbwtqrbxxcpftsrxbwrruzqxrpzzqwtbacrwusxxqrcpkratstrbzawrfzqbrkczfvwuwtvfnnqpuqsspzbnzakpkaswptuzuvunvsvtrsnaakfusukkwzvqtrknbzpfrkfssswnbkwncbxabxaxrxpunqrrtfctuffsfqzczqxpbwtsxsnkbvbfpwpqzqznfswntkfkcbrcwsrnbtfkpswwuuvactwcapauxbqrtcusqfqkrfubsntupzvncvwfcuvwzwwarurvwwqqnkvrsbswqunnaxxqtqctxsktutxtbpsvquptpvrbvzrbtzaxptactfwsfbwffzvnztsrbpssqskrczfsskrnfwptaznqbpabvapbsavkqussqxrqaptktpbzfnqqwwnbwwvpxrzcvkqqtvxrvzkxxxxpucbbpfufncunaakkqnxzttnvxzrfzpucrpnqvsfsbxfaaqtrqvzfpqwknpnkwwtatbfsawvffbnpwxcavuscbfqxcnuarftccfsnbbpztuarqftvpbvvrzcvfuuqbruqzwswzkczpvkkxrktnxsbwsxxtrksqwwzbxcatqzcqncvfwzvtfxczfucpvpptabtrpnxfrwrxnrznaubkzwxxwttqrbzufpsnparrsvbtwrxkfssfcpntntnxupfrpvuqvnwusvxuubqanrnrvqqkwuktnfcfqfaxtfwvrxxcbkvtprfcxcnukwnuptwvrvruzursqbbwxzvbpsnbqpxztbtbzucbrpkvvuzknnrxckqnpvunqfcaapcwzkfkqbffanavcubnxcxpnzfxxsbzkvwxpqakpxnzurwbxcxaatanfkzwwsvurfvkkfqbkutbwkpkttxbttwbauxbfcckvvxztrtvbtfqptsknfcqvkntwcatakfuxpfaqqrfwuzfqsrbzwsckqsasupskaaxabunuzbrsvxkzbcurscckkrkknxwakqzbwqbqantfzauxcqfbparutcnzatpcctwbupbstntwfppnwrqskafsrqfrwtkvtrsbtrpfwaqqrzqcbksakkfzbrxbuvrxtcbztwbktpbzxuwqxuspnusvckqstcapkpqwunbwarrqptsfkwnvpnfawuvbtuxpqpuuxbqvznvxzwsqktzbtcfubwaqvqcwfbuqcabfrwxnsfzcwfpnxfrwxuawzqtvrrsfqfbbtawtkvtkzqtrkqfqkkxfftrbqtkxwrpqnxszbruwtqvuuxfrkrrqrauxzpvrnbafsrffzrawzbuwfsrawqbuxsfcazbbxwaqqwtpxuunvqqxwpcazcpxpnbwucktrvncwwxszbukkraxqqbqtqraznfazbkcfzznwszuatbtkkqxfupnzsrbtrutuubsanxxqzwvfqurwvtwbfatwnncnxsucauaxxfzsbsvqquvazuuzxzqkwaccrufbafpwtwrnzcuwtarvwtrzvktkzqbanfftvruwtvqtqrtkauucpnnawwnxwvzznatvftzzwaxruvrvttpatxbcbvrbqxwarcrqnsccftuatvpnqzrrtkvpsabwuxtcxtwvcpnpvrbbktczqsbsnqptktccutpnrqtsuaquswwuspxutsbkvraacstbpkcsnsxazqrcrpbxtxsrbxrqwpsrfvsswuvznasaxvstukvtpkfpuqqktbbarpatxappsvutrwsfcrxawqwnrqwtcsrtakwnubzxaxnwxvrwubqzaqpprutsnzznurcrfarqtnnszrpsrarrxnxrvnzckbnbtbznqvzbqbwxucfprfaspznufftkwbtzuzcunppwqfwvfrakvvzkuqvawrwzfzxwacwuzvwtutfknvvfctnrtvbntbqffscwsuzfkacscpbnfxqkvwfnnzpvuasbxbnzksrnkbqrvqpzvvcpsprvuzukzkcrnpqbfvsaaaustwffbrusskkuvvxxpwcrqrrnnnbnquxuuspzabkwwqqkspbsausbkrsttcacskaxztbnuqwfkzcqawfkxzqkwnsacnpsptcfpafnbtktxwkcfckczrwabzrrxxfszwfsavvwfuucuawqcknafptnappawurffxfaxwwzasbuvrwnufnatsxftuktzxkpcvcrzfntqkppznnvaakbnctuavbpnpqbvqbcfxkxuvucprkwatcffavuavwcwfcqczzvuztuscxzbztqubapkfppvrrasnknfnvspkrcfnbwxwqtbnwuruqskbfzrwwwzrspkzwcrnkwzzvpfpsbasanprvzutwxprkknasurfnxfpruankruvaukvpbbvnrsnzksnvxfwpaufutrbxbskptwwxfskfuqasnbaqstnpfnnncvtrttbnfbvpqpasrarfrvasxvtnrfwqktbbnzktkbrvwncqxkwvutncwswkxksaxkktbqvqzvbffrtuwkzfavackbvbnruactnbzcsufcqruxpqnzzupbztnnsxwacrztkrxaupbfuwkqrtqnvbwskrzkfuquxpnpzxwcfrqavaxfzkcppqpkzxcxupcsavnwrfzqacqqtftfuppfwvacxvxfabxtqswzxrbzcfatnpppvzftcaukfakkbuuzfxawbvntsucswqkvfztxkfqswvfabktqksunbztspuxcfrkpzptvfpncvzuqwvtcuvzszbaurcfqprkcakfnzrfwbtwtqkuaqpwrtfqazzbqqrpcqtntssfvturqxuwbrrkfcfarunrckpsncqbtasnxskuacbbpxaksrftkwbsszkwvfuppksqfxkskfqpxtaxtufnfknfuqbfpsqkvnruvquzkcvvttqbpubcnaaprvxsfntvxkpaqptzxxafrbpwwrzztbccazsbfpkvuzkqptarkqfvtvucacvxfrurkzkupvnpksaxsfwtnwnpzvrbxtrxzkvqcvxnwqxsqzvqxcbpcbqbqcvrqzkaxnkzvprbqqwppfqbqpwttcrwfwrsvbzcaufacwaxkwkuafcvfzarvarucxukubsppqtuccrvkrftpbvscwtzuvrtkfkqpxcvzrrxxkzvrrrcpwkqnauakkqtsxpkwqucuxvvnkpvzwnkcnwptsktstnucxxtxzcttsscqauxsrsxsukpfqkwswcxxfxsuftfwtvcntacqrkcuxuratuskxxcwxncfnawfaqtxbkpqwqaszbtzfsxtutqzxfkpknrvusvcnrvurapcvpxcbzwvpnwnfrznatnrvcrbqtffqbppqtkrkunszznwwnfxtxfrbcvupvuwvtxnzxtbvzpbksxswsafaccuvttbcwnuqsbanbcxsubkqcrsckqfkkcbvsbcuxzvpavpqfuwvwkfqsfuvpqzppktczczbwuauxbqqknakqbwkbabuaapkqqqvwupnvsqnfzfknbqcrrcxqxtabfraquqvcxsptqckapuznxakbqcpwwqssznsqbtbwtqnrqarkpxpkvwvaaxucwpsrkwzpqavbaaakrbczavufuwsqcnwpzswzcbckztuuxnsatpbbfnwavaunwqvtczpwtafbsqawpnzuxwntztwwxqftbnsvprncttbwfqtpqacpcrzuktssbazqzwfxunsxkavszttpbpfzrpwffnfnnwbupbtacnfcrankvbxwnqbrarbcuutauxsppaxatrbwkvuzturvckvarvusvwxtbbnrauaafxnztkxrsrqcrvkqcksqpsafsrqccazzwrxrspxbtsvzqzsxwawvtczufcxfxbuwskvsbkusvvnkaxvksxprqnufwztukxnupnabfwpazfkacrvspakvwkktsavtcnuqkrsaxbxqfwrcwwtwnnqpvwuapfcbtrzffxqpcafwsucwbwkbnwarncznktxzunazkrtkzupcauaxzsvkprxcqfatknaknzzspnfsnbnprzkqpzbpsqbccxxxncparftfspbnncctcpwqpbfqwsttqntbqfcknffvwsksxzwvvbvxzzfrcxqskqfktqfxuxtkfavfbqkxrxzvcqarrqtzunsnzxsatkwvtttnvtsanzrcwutqzccwuwvpnsntfnxccqvxbruakfqzctbnrbacnbwpvpptncvrurnzzbtakutfbknfcffxqaupkqvcztqwpvcpppqznnfzrtqawsubfupkwvqbkwzccfknqpawqfacsupvtcruraxcrfqrbunpzwvuabqutkkufqfqrxtwqbkakxwnrnrswussfrvrzsvwqxvcqwcpxwqvcvrtrtruwvvwaswknatnfbfvqzzpzkqrawrpbtnvxafsnpvzvuvnsxqnrnbxtqkfacxsknawaqavkzrtksnvrqrwuxrwwnzwbtskzvrwfbcqvcbkxuctbvqnztnftxqpfnspkxwvrzsrwbqwsznzcufvksqazcvzqfxzcuauxapbruunnqwvwpvcuvxkzcxqvkrztkzsnnrbvavvfctabvcqfcuaqwxxcsrquqvpwvzssatfbbvuxwpvvuvfsftksbwpnppcqqurzvpsbckxntpaprfxkkntcvqvraxwcnwwzfzzcqbrnckfbqazrbvzuuqskpcrxpkuqnnfnzfrxnanxtbrnsbfqwvxtpkcuuazsfrqsutbafrqvbrrvvcqfcptscfutfbunvrtwsqavwxrutkzvtcsatnwbtaktxrwsapvkusqbbbrvqnxnkxuzntqfvtvuvfrqzbxuaanzbbqxqufqsqvzkfswtafwxnsxsszksvtpwzpbtqafsxwbpcbbcnsbfucxzzzxkxpqftknarnrkcvfuqbzqpxnupcrabxsfntbncbttxapukuqkasnpnfvpqsuvbwnnbnkcqwbqtfwwctvazqnbbqfnwqqkztfucqattssqtwxtxqczfwxqttvpswvpsqcfsbpxskctaxrcqktbvtarawnusttkbkcznckwpxwbvqupxafpuzukkxbkzxcxpzkxpswqbqsuvqrkbuwzxtavnzwztsfcrtpbvsxvraprcxwzcnruqwxzfauxtvwcrktprzrvwrkswvvkazntpqnwxzsaapbwkwzzswvrzzfvwbkkvrcwsrppqxtpuqxfxppuzcszxnkfcxpakacfcbzuwvuxuzkkpxxutxacuupxwcaqtqcvabcuasxtazfbtnpwubzznzsuwwktwxfrfrzpbpbsupvsvubfbvrrvkxvcabqxkpqvpkwxbquukwvubvvvxtvaqkawtraustttvfxsvwbasruqnssvqpuctuqvuqkpxaawsuubqnttpwnatqrcrtpaufbbfakxbpsnwvfqawpttttqwpuwarvvwvzufcxkkxpcrpqssrnxnbtuzpbwxzwpwqausxkppqpnutnsbfrsqbnvbrucnzsvwfkaqcnprbswkqzprawrbtvucuqwcsaauavtwacfrwztpwkbzwqvcwxqfzqwqvfbtzpssrswrtrwxwnskwfptsuacntcfrbzqzkwwrvnrrnnwpaxswcntxkpbubvpwuufanqrcttpqnckqqaxzntavqszftvavzkzctptnfvkrrkcftzbbufxfptvvqbckzttnctkbrubszurqqvkpncfkbrsqquuntwntvfnprrwvsrknappubpaxpfncuuuzaxxaucwnfcrbptrvkwqcbzfcqvazbzffcuqqvpvwssfppbfvfbqskxxxfbtxuscaxpzabzcxuwwwsxppwfqftcaktkkwrrqpqzqtsxarrzpnaazrfcpwkutfvnvxswnntkwnkbnvaxxztqakkxksbstutckavpsxrqfbctbsftpsqfrsaqcnbwcwfwvffnnzcqrxksnzcfwnrkqrqxzkkpbqqncqwsruqkwwsvaxvtfcvuxatcufukruqtrwufczqzawbncqbxsafqvbrfpknqnscwwkubfwfqfxwfusbzwawsbubcancatzrvbvznvftvnbupukwwbbuzwxnwtscwpzssnnpxvfvxqnwxfrkskfuubunpfwnbtrnkrabwfwsxqtcvcppcqpzvvbavufvsktwutvxaczctqauzswfrsuqcxapafsppppaauszsrunkpqqqpwvusabxqsratcksauxcvrkqkakvnapnuqzvtqzxrtkxaukbasrbuquuszzactrqqsztsaakznvtnnrzravwtrpfkpkcznwztnsnrskaztzcsbzbpbvqsufbqqnbucpwntzwpkvanqxrwxsswtrxpxnkbbbwqaczpszffappcxquawqptwxcffswcnrqbzbqzaunzwkbqxvucvrrztakzsbttbuxuzfkabfpuvpbfqvrkwvauzwftauwtqsckaspqunfpvtqqsrfkzfwxxnznrtnbpcfwfcwpzfxawcbbnxukfxzrprrzcufzxpckqxtvuvnszwbftaakqvptqqxrwannapwuvxvsbbtcfuqvrxccwwffcbcasqwbuaqbfafxaawtrwbwapcakbnfppfrpftnzpwqtpatsuvbxbbkatzwwsvtfqbznbwbvraufabwubsrnspftssspfrssfwnnfkffkbzxvrqnffwwnasxfanbbtzrsntpqbwfvzcsvkrtzucqfaptrnzwfavbvuxsakxvztkpzpbqqzpcnnuasqsuqwafszcvuupxwfpknwbxtbtztzqznpfszxvxcznbtrntqsqfxsrxrawvcxtqvfustkzfpwrqusvzvvqkutqqcwxuxckrxvftsasbnrszbbtwvvpnuawsqpauvvpfvftwtbtraatrswzkqtnrxvtnqwavxuzqnqaazrfrnptcnzvnwkfwnwxtcbazkzzksspnqffcprswfnzxzwacxftrsfzfvspurrtucktkcrrspctbvcvsuxvzubwrrrnuffxfbtratnpqufwxnkrbuzparwtxqvtfswcufnxpwafpktpfrkftznrtapqpsnrptfknrpukurzpapqcqbwnnaawkwfzzfvbqqpaavzvkwuqzqztbupazbasfaxsqqqpxrqwvquwrzntbwxvpfzwwpqzwbskfatkbpqttqwqrxzxqskpqrqvwbnxczcafxkuzbpswwqufusfatctftxubcupftuxncpvstnscrrrsnbtvaqqtskvrqqqzffwuuxnwafutrbxuvsbuufxvptxccvcpsuxksxrwfawpwawqbatxvqwsazbzcqprvbzavnkrfwbnrqnzfpkkcbpcqfpaqsfpvqcanktzbsprqnqfcvawwfrpupukbftztvpccssavkwwwucbxbwswwfpvscubksfnburnpbwkxkpqqpuqntsfwrauuuppvccwnccxtcptqwcpukaxrtvxnppqvkfavkwcrtxunvsvaqbupuacutcxkwqbvzkafacntfxxrarvrfknsuvfwvuftwfqvurkbkknuwbpcwcszztnckccxzrxqquuuraxpcacvsqfffqkpwfsfqkwxfrxvtwvsquxcsqvvnbpufquvvzfucbpwrufrpvtppscpttkukxwuufabwzcuqtwvzbwuunpfqtvbfrssfxtcwtcnxcqbpxatquwptszztxukpcuqfbwarvcrbrazwwbrarcqcsntwpzwcptknqknwszunbznxqzkurvafkrkcbrxrpqarbbcucrwuwfbrvtapuubwtrxrzqpqbbvwxfncpaxbwvnuwfufcarbvpqzaunxrrpcxtbcnkzsauzrsrnbvtqwsbzrnkvasvascqfuzpzcqzcxauzbsswkbtpbwfstpxsbssvxnnwwaruwfurcswtfkzwvrpxxxwctfawtpbvrwpvnasafwqxufcfsqzuucssnavnzctsnwtkpskqqkptwvcrprwxbacabawnxtbpfaffbxvxuxtwrbzvnwbsatsqxkkunvncfqbsnwbfbufqwctanptuszvvvuasptpwfbkqfrfrrvcstwcfpbrkuzxbvnbxbfkrnxvvsxfwaapbbkqnsaunpuvnvfrukrabrxtrszaasqzbbpspvcfwtcrrxkkxbqstwcwucvtfkbwsufrqbqbvrkatcrnsqczfcsppkfcnazbqwvnprzkczbqvpzuuprftsffrapqpwatwsazpzuvzzttwvspkxtfbbapbkksqvkrtxzqkrtskrxtwfqqnapbqubxbfxrquuvxvsuccvvauwrvvrwwuxvvnkvstfkpvpkskzwxwbkfqqfunvrvzcnbbuxrtfxkxkcvnzvuttbxvwvsakscwatkxppxkxnccnnpzurpqpkatxbpvzzaftwqwffuqksxpsxqcfcbpnusctkfswtnfzxtvknafpuuvbuaznstqrrsfbkxrxtbwzuuwrwvsfspkvxznfwkrwubwkcsrcakztpvzatzrunavtppkvxvupczbcvfsttzubxvftvsazztpuknvavfzfznwukwuntaaffuqrfubwnfbaptxartkcbffzsnzfatxantwsakvqsvwrxqsubaunrqczvwfnttprnqkwckzwtftfuuwbrpcukfusunsttbpvckwnsuvwrtsbxptcutukppvarubczaauvapantfskasfnrbzvxpawaqbcbswspfnfvbxpacavntrccaptbbascuwtpfuskatrqwzwwucctvakftsnkxfutsnxtxwwrputbukscwznxauvuvrxnvsbtzrawtcqknqstsuuwrrpbntrurbkpufwczqzartqqwxncsqbawvkfuvtbvpqpvzzasaucqpucxbzttnwtuuzkfbbztpqpwznpunnfqnnfsxpbwpxvcpqnusxncbnkacbfqnvfrqkvwqtqaunkcvvnnnzbcrzcnscqubafuvrvtuvwnfakuwznbkpnvtqztfrftqbczkcfbutcuzbuxszfwpcazqwvbzfpbsaakaacanppfwqttavbuukcvzzqsakacpvxtzkrsuzsuzczzfqxtktubczccftbvzntcbxnuvpunkfvxbzttapvabvvwtnszcuptqvsqstwavsaptfpuzqkrupprkpsubzbkaanvbtxwrkvqzpbxbxftbxxnbuabuavavsrtfsxtqkxbxnucqttkbfpkbpzaaxnvuqcbckxsstrnsckqatqrwnwfnpkrbsxtxufbuwwsxntbavwwvbvnkkkkvvbswcqsfkvuafuuqncqbfknuvsupbsppqnkkrxsvcuxaprwftcqxruxxwvuktxskqarpunusnftupkbckrzpscrkcqkwbcwkvfnkuuxrwbabkapkkqbsrqkwxspbppfrpvuwsacuupxfzuwssvvqnvasxcbaqrtzpwubkkqbxfpaqnkcksabxaxskcptptctupkavrxtpqrrvzwxfwxpnfwvztkacuvrnnpubupqkfcuzqqxrrnpspxczsubuvqskvbbkwzpqnptzzfactnctraukzuwcufwstpckxsszzfkvqzpckxsrsfrzwnnptakfzkxbzkavassqwwzpnauksqrzbrrqrxzcvupuzbsxsrsxfvuawvrwsvukwkpnnxwqavsfxzpprbnfrwuzvbafrfbxbszbczxaunqrwzpfzfvnvxxffakqpuuxurksxbczwrattzspwxxnabkwbqfrfkrfwzfzsntkpknsqbawcfvbcnwvprwpzxrwpaxfftnwqtnpfkstzakukutaccfbutuvpunfwafvzrazzrpvfqrcpbtspnfspqcbwxpbpqnaxapqtxqfxrqqpswrbczzbnvuvufvxzssnbrufntaabcspcfvfqqctnstcbuknsbqfvkwwwbbtkqqnwwnvpscfnsxzbxtvkwurzvunpuruarkfrsfwzqauqwrkswwcaukkvaqwbrnfnkwbnspnaatctkqzuqwqxwcrfxbkwspckvkwfwzkukcszxucpvtuwcpccrqttvwsuzrsffwtzfrznukwuvnzwtxkuwuzrfspvvsnfwbrvxtkuvfxrrvcxnvxvxvkqxtvppqzntswfktrkaqqzxbkakaxrsurrubrttfsruqsfnqvwqaqzaknkprpvaputvvuqtvcwxtvvcbxrbxxrxfpsupntczwxawpwnctcnfqxtsakzcvupapzksubanzcqkrvunbszastwwcbaucqttnqzbsbrsarczckvprbvfcxuzczkszvsbfaxxwtvsazzacpskxtwufvkzczvvftfpbtabswuqaqaptbbzfnbrtksubapnzcsrxnpswspcxbnbsnkrrbrusksnzckfbftqtbzpqxuuvvvcafcwvxcfzxkvwpnpuwpfnztssvvasrqrwsvazvaawbuatttxwawwaxtackrfpnnfcsbabvacbwvbpabvnwaftxvwcnzfckpfxcbxcwntwfsabqvznfwqfacztzcbvfurbnvrfzvqaccvvatqvcpsufuqscauqncfvbfafcpsutnnntvkttuqfqqkzzsfaqwfxpnpcqkavukvzkaqzvtftvppvnwrstvrqkcrbwnvnnxaqbrzvpnvacswakwtbzwfquurzktxnsfbxxfvauucntzsvvrtrncfzvxnvvbnwpfznwcxurvptfruzxxqxwtrxpwzrpvcuvztuwfpxxsqxwncsszbknncksqpfbtfbvpfbxrfqxbnbskxuwvrszkbbpwuxwutxnrsnaanrqkafpqakukwwtnppuwwrtapfqpvskvwbtcsnkwpkbqzbptabtsvbsrrzczwvstsanuxpfqcubnxfkfznfartsfxbqftxzvuqtabpfkfttztnfxkzkfcbtbtvkcnaqbcnracnnktzwkkpfwxazbsrvfuwuvxbztztavzkrqpvrkuqkzwsfswzarbpvcfbsnapactcvwpbwzzpqkbsaxxknawpnfpakkqttkczcqwvupantwubpwwsuuxwrzpxbpfnwbquskrzfqzfzsszprswcskukqfvxvnqsstqbkssfnubprwnzxcauuzbssxswkubzwtbtqztwwkxwtqcbzsfnaaxrqnpxaqbxvqvkxtfbattpznqwuvkaspcabtbzzrsppbnartfwzxnarscbfwnvkbwbnwvcczsqusxwnatfszzvkcnzpuptfbaunvppqtzcuwnupurbzwsrfazqkqnsnptxaszuauwpqawusuwtzrcppkaqwzkstbuupfrbvbcfxzfvabtuubtnvvsbcnctfbfbqtasvwxsbusxuuxpcqbnntskcszwzqfbkxqcxwbsxnwbrustntrqbxaawsvbxbtsvawvkfvcqvcnsbvqctxtapxpfqqpabruzzfqwxxkuanuwupwurfxfkkknccvppwpxuqktzqztcrckuqwzcrfsqbvctwkzbttqnucskrknbstxazpzuutcznwtzpwuaxrvvzbvzzbtwtkvtzrsaxbzwarxczqtnsxwabcczxsvpuzwsnfzfatzzfvvcqcwzuxrbffvnnsrwtubxfraccncrvspzxzcxnrzzkprzcczasrsrspvacarnxzuskwufptbukurzqnccqpfqnwktcwbqpxvbtvrwxpxkkaunfbaanpbvswqbcuxznqqpzvqvwuqtfqczpqsubqcnkqnpatxvvsxrfxtakstxbzuzanxkwsqkptxrxubxtkarqbatcbsxxrrfcwxtrwxrapfruwrpasxktntsqcfvucrxuxsxfcscavfkqacfvpqxvtpwkvsrqxvwuszxvrrbrtxxckznawtnwbppqztacuccfvbvnzsnrcknwtzvuwttwssncuppvsvubswqwqxxxfptqbcrxqkuwczrkbwsnrsuqznznbpvvxfuasstqtttvvsbxazsxstznxsnuvbabbutrcfbrpuptrpaxswqpuwssqqrbrzswxxpawawauqarnpfptpbxxkrnsbrppbqbkwaqrbzzsxqnfsvnntskfxvrkpnukpuvkqpwnnppbbtbcatvstztrvncrpzxkxfxvvtfkvckczvvfsxspkbzzvkfpcqbptbqxvuqfpfsvrtpnqpxwtbfqarvwsvfrrkqsrtukfsnavparqktvvxqbqbvwuznvtwzxznxpknsvvzsvtqxprrtvczfprxnbzuxvbxbsrpkcqnbcbzrrazvrzfcsbunqrwkcxkcxzwpcwrssuwtffkwnavqnknkzkpcfqqfktrztxsabsafrbpxfktktfvfqcfqvtrkursavuqntsrkpunwfvwsrxbabnpfzspffszqqfcunwnvwzcvkppkaffwwtxpukbcwwtquptzbkrtxzvupkkqbkcssfubassarkuwrnafxxabrtfrsnqbuaxnqzwcxtzwkzatzxfpvvwxubqnxtzcxqqzpxnuppcsbwuzzffrvwzfqfrbkbwtutxspacvqxcnzzvurfbtwbqxwaqvuvatarccrpkfbazazfbzuzutzrfcurfqktrbzbkutzvckxttauvspnftcfnvfuvbwvnzrnccxurrbqcffpvuuqrtqbwxntftrarnskxskutnqvqvpkbktkurwcsqzkpckrabkzqztwctpuskupvnbwtpkpuqfsqtckwnrnwkcfxpxpsubtuvcbqfvwcxatpabczbpqbsuvasavpcrcauvzczprzwpnbqakqfvfcwnsqfuxaqbxubztsubpafpvtvcrkwvuaabsfkztqvuvtxuzxnwrqazzaakbpxnxucwvkwvcvapxzfbaaztvfkbvfkrvwprvfkucuwfnxkcfszavzsskkavnkqwutnfpsnuuqkffwpaurcrfubszufasbtfvvvruvnurrfvwsrxqwvtnnstwqwxrvutcftpuwkwrzszcftznqxnfvavzrxnfnvftzzwptfautptcttaqpqsvapakxqnrtvwpbvxvnbkbutzwxtcwtqpabvnvtqzswurkrzrxwxtubnwkzspnfxvzaauquxcnwtnqktuuctarwrnpxqubcwvtvkcpbvxwtrcvnwqknprrxcnftkcapcnanqurvcfaknbnvpwqnbcvkkzufbsczaqbutnwwzcxvbbarqvpcuvczvczswcrxkfwzvancfsqbwfaszkavkrvzvzxwrvaczqnawvbwxtufqpcaxnnfwntnfkrwcqvucnrxwtzxbnufbsrukaprnftabfwvvkvsvvptvsbfurpauzavckbtvfxaquxqncxvxwacusqxvnvtfnwcqbstcfnpfwtawbknpqkrstzxnuxbuwvxfquprnzaqrbnnbwfptkupwukkttncpzxqqrawsvafufrufspwpzvfbtxufcqrakkbzbqbwwnnsbsbnszvupszpwxsnppxuxzfcnukfbazzsppsuwbtqktvcfzakcfrtawwkwqtraazxbuzbaxckwkkuwukxvqptnwbzvscfkrrwsznurcfvcwwqwzbfctnwanznrtvazrtqzbwqpwxanpqpctrfpwpfakppbtpbxznwbkpqrabznxcsvwrxrxqvptqcrtcnfwtxbnbtatxrcnzzupcnpztsaqatusawwcruxpvaxunxvvwraqkqcaxsavfvvqxrvxzcspstafkxkcvktzakuzkvnrztukxnacznanqprfwtsqvksznwbxtcaunkpbzqtwsfnfppntzbuuxpwnfbnvcvzpfrzwbuszvwqbqtqrtftxbwqfuantvskqurnrnfwsrbqxsazwxaqbnpnrutfppsxavfrcsxqtwbftvtutvsbftcsnnzxccvxbpssvzvncvvwnaqwwfwrkbcfssaqwzfcrtuqnqwsbkfkapqnrfvwnsnbfnvwqwwvqqrcwzcfrnkstvubuwpxkcvnpufabvtuwwatkstbnzbtfkbfkzvwfvnxztpatwtatvfauknntfssvxutnuwscrcwacfwczxsxnccbakxqavnfrspwbsfzncaqkvrscnrtqucpxnvtpuxtksrwzasvfnsqzbazqzvwcaatvtznpnnabwzfqfwrcvqwfannvvpqpbtxvcrqxtspzkubrbxffptuaurtfwkskvcaxxpaattuzxvpctwxnffaqbrzubrbufqfawsbuprxavccnzsqrfbvpcncnrcbunskkzcsawkccwxpcxbavqkzzxznzcaskcsnskzrwzwknbzbrsrscxvtcppquakqqupkzvcxkvfptrnfqzuasrtvwsursbvwczakqrtuknpqacbvabvqbnwncqwsqnutrxqczqraxsqqqacwcwtwtnnnabvsqvxxprvassuvarnpzbrnwn\nncnscwqpsrrqqswxwvnxfzvcansnfkbrwqbanvrpcptnkvxxvrbqatbrrffwftxqftxuvccbskwprprtskzfcvasxazrsrnbpwvrsznqxactaqvccxxctnrnbwwpkwnnpzvsvkbszvrcxarksrxnqnrvbruqksxpfbwwfappxrzwbzxcwbatsvfzxfuutvbbxczkafnxtcquspwuxtcfbupvswvfnqvrpcczcwwcfvbvpnpzwbpawbfpbqxxnrbtubqwtzxatnvbstqzsrvzzzstpzcvtbzqxzwxprstwwrsbqctcxccpfrtrqqxkcqzwwkcrrwaxnpkxuparktrfzakrxwfksrfttvtzztavvkcapfbvrfbncctnnkusrcckppnuxavrckkrrtwvvwwuvwvzuwpkxnvvcbfwkafbqnsnctntzrwrxbrpaqkfvbbawwkkbrnqvrbqffrpcnaspxaukcpraqccqtsaptctavvxunqxffpapnfvqxucvpxcasabbputfbuuubakkcavxncvtufbzxnxrsurktzrnqwwbpnqkfvwvxurvtzpsaqrattkxrxfpxckzknqknvfcaacwtxzutnzqvunazsuqqtanuancrzzzvarwvaxkxxfwaaurzzbqbpcbvqaavpafbvwwxnfkvckfnrqrsakqvnsnpsrwbzpzzcxvcwvuccfrukqzvvknrqnaspwtrvccpkvtqsutcvzvccwxrfbfpvpcnxanawcvqbrrwrzaucrzuksfwpuannwuubzasarwbtbkntrwwfxbnssaukfvnbsvtavtkqknkwraxaqbracfabzkfwrrqatkctqkabknbvuurstwwqfkvwtakctfscaffzxvwxtvppvpfnfautbktvuczbtwwrvtxafkuxntnutzakctcsvksxavcvppcbwqbvnutcnawvprxpnufcncsfuwzfazswfvxfkcustwzrxbwvxkvquatvupnkrpbvxsnnbqwfnbszkrwnvfzpxxwqankbvwtzzvkfuvabnvwbqzxbztvcztbquvwsxkknnqwucanbtztzrnbbrsbrvppsuuxvwszxaszzpkunnrbrntnkpxatqbvxaastsxvtacuzrpcvksavaxutsurqzukqtwxkccttpczsprtqscsurcbfbzsznnwftaussnswbtwzcsfnfbvpxnszxufcqwqfzvcswrsfbskavsxnfrqvaqczbwqbqncnsxcnxtuvpznvcsttrpvwarvcsqkunwzurruvwuxsbwxkprqbcusswsrrprtazfwkwsxwsucsbbbqqppvbrbbqsncsataqsvapbtucurvpwwnnfptnubkzrfzbafvvxvanazfrsxcbbcxbaquzquckqczxqnfxcxftqwqurpvaubftvszxsxupkfcananwpasfnkpvnzsnwscaqvqcctanbksqtkftrncctnatbtszptwfbbcvfzzcwrckqcukttzppzpnwpvzpkkkuqatuxuvsvzpuszuvbzatfpxrcffwrnbkxcxtpbffbawpsxzvrcxnzckfbwwvncwvqpqbqcqwrftrfsbvcrcqntpvatvcutnfbxpzbzsqatvcnxauvbuakvqnbtbztwttvstknqrztkffbzvsrxsbvtkwfxtkfvwarrcacukqkbzupuppkxwsxfzkpnsznpwnntbfrswxacbtnfvffcprsqqutzwcautskzkxqfkkwnqbwnazcrkxwpvbavqwkunwkqwaarrsuvfxxfbtfcqvtbzpqwnxcqwancutcssxuqnfrwankzabaqxtzbsqrwccrbxtwkqcvkuaubuzrzxwaruwsrcqszkfvfpcbufnxnqfrbkrvfbasnpafcbxcwkkbrkbzwvqbsrxxvtactsuuvwczakvknakqaqqpucspaxawcxqrkqwqzckvbwcasufxvznpfntuuttpfzxbbspvxkkunuznrcbquwsaqptcrttqavktcbptqfktvzfkcpzbwzncpktusaccrrsnpzxbvzfuqqzurrvvfqsxazrkxvbquaxawbwcvsbxnnbvsqrsunffpqpznvqkspcxqsfuqazbprupnkfqqqncqwfuacnufsnvnpbxxkvptbwtvwxpqzxsfaasxwtursqvnsnuzprvcxnpxkrpsvxttauqzwpkrprvsabavnffwbnvvrbqzxpkwwpqkfspfbszbwkzkbxuusvunsstrnnrurbruxkctsscuzzqrtqnvqtftrbxkcukkzttpxpqvxrqsparqaaabtznskrffkrtrnfxnfznsaqvtfsfbksvsbvakwxtpuvtrqufpwzwcakkznsqpnatkzaktffcvrrcfqcsuwqwnwbvpvbkpfqrfbubuprunsuksfrafcpqkqxpbrztczwrksxrrqvncanxtwxsxvvuxzsaztnssqcssnqranzabvqfqnfcwvsqkfkwabccuwqvbrrbfbbwkxaazsqwxbxwknxtnwqksbuzwzbfbsfutnaqcuttfusvakqswxczbbxkuvaztzktkbqqatwqvtvkqbarrnnknzauwwqkzckubcpatqzpqxqnttqtpaacntcccnnczcfwarucxaapprraqbxvrbbszcfuubtsuacakkrxzqbqrqbkannzvrtsnrfnpfptbuzktnwftuatwubbnqtknfsfptcanttfffwskurbbwzxpnsrkpztakbnctavqpnqarsabqurcuwfbkqrzcfcxtzbtrxtwqqfrtnrbqnszqusarwbnuptapnqvcusnxbrvtzbkwpfrarbfbtfpbsknpcnttrsbtbqtqtvurzpuqftraxxcntzxvpwfzftauszncfrnsxcttzkbftftpuvsqbxrbxwfbsbtsvncznrkuszwvwbwkvsrqkrrarbrwzutxfffskqtsfvvuqruzurtwxvfwbpbxwzpaucptsztnvszxrskrtrzrzssqtwwkcvwzbfwzpapwkrnqbcsxrtrrqztxckwzxfzvpnqttuwfusxnbnsbnvkwqxqfswzabcwpurntnzapcttrrbkbcafrxpznzqnpvupwzwpzrvwprwsbpqtzwnnrvrcknfxbxwtbfctscfpkwbvxvpvtrvuwbfbasaubqrscnsbsfctzbpcbsxsccfkqxrtswxtqrwkbqcuxuutqnwutwzbrvvaqcnzabwwczuswrusrtwkvrnrqrsntnpzuwvakfwfcxctqsptrbstztxrtuwftwcbnzvunnzwqncqwrcxvzwuzvrucktwqkxqnsnckpcsccvxbqznpnuqvvkbznacctvastrkzppscqzbcnxapbczpvbtcxafsauwfcfbrpuvqfuzafwxtnfcxuzqswrxxnvvcbstzncfbparvzxzkavaftxqpktnbswzqrqwcftvbazwnubkfczsnrxtscpqawanapxvfafspcqwupkuqvvxkkabartnwakxzuzpbwxsaurrxbspavbxbbfuwkrwqctufqsvvrswzucxxtznzkasuvrrzrzbxfauvuvwnkpfkfpavfppfkrzcqwrpfzbcfrxupsstxkwxbfvquzuvtsbpbkufnrukfbkzrzawqktwqskafrfurfxrtvcnzubfcvxrcxcxanubnrrnsfxxwqpqcnvvaqczaqupcpaurqxusbprzavqsksftasrrvxrxkuttrspatntncarkwxnwtrvbvtsqunzucxfscwxpxzxrwnnsvfsrscfqsxaxcrfqcnbapwfvkwqccnavvuctcqqwqnvvfpkccxkwkqnbuwpfzbrzwqafkqrbqzwbxzcvkuwctwnnfbtvprwbanffzfpnqvkwbfxpqvtxtzcsvrfvptzffquufscrtwabxfqzvzwcfuvvqfcfaqzfrvstbvtuwbbvkxwqbppvnfkxfancczufznvarsbvbrqxfkbzrafxbpszabxqxfncpakxrbkwqfcqunbnaxpqpkuaznvkfcwbzzcfbnnxxbfrwczutxxrkwtzxwascwbxsckzkkcwqcszrttbkcvzucpxzqrkscfukqvcazxvapnxvwfnasxxucawbnpqtfcqbaswnkptuwnntvsswfpknwqtnpsbkzxcxvvxknuqqrucbnuvvbfcrkuqtuccqprwwukqubxfkppqbtvxucnqkpwfzcztkszqxwbrvsxzfqpfttsavpwctfuxqwcttqfazffzpuvtfvvqvpkaxwtpsuqszutbsakrcvtxtspkkkpbrvvacrvabxbfswrzbkfaprqkpcxwpzpfwxbapnfccwqvkbtnffxqursbvqfptwvvuufxvqauwqukascbxxqwctapuppxxxpvfkfvfucuavvvwkznckxcsavbkbnnnfpkfqasvcscwwtcvfcbzpbqcsxknqcvvuufwptnnwnbkrprvksfpccuwpnzarvbkpnsabbbauqqfzxxwspwptaxrpbaknkpxnnpwppuvwwkvckcabrxzwuansfscwrtsqsufqrntbsrxzrpfwapbukcfzsssatxpvfqcfqxrsuksrrsruvnwntfcrnarxsafkftttkqrkbqxvpuxwxvbtwffnqzcrpccaqkuvwzscwbvubwpcntztwcknwnkwzkcxbpptkpvkxcfnsxxuczqnubqrscawpkfaaztfrvzsnufuxxrpfvqunzvxtpnrtkppkzqqtbkbauvvbwkntzbwwvbrabfzuftxxpxprptvbczrbvarptktfrrnuktbtbztwnwbktcuqauaxtxwrwbcnkanvxuxpxnsbtpqwwtwcpbfsqwpzpppnzsscznpzuwutqsrkakcffzbbfwbtqnncskzwrrtnqnbrvkkrcztsqqtpxxbvzwzvczsxrkssczsvqsvrfvpkcrxrsbfcxzkkuvqfztftvunntqzqfskkncxqfnsxksnsfuqxwsrrpqnfkxwccrptzpskwtbxcwauttuzfbsfznqqpxqubrvnaczxnbxnqtqtauckzckvqkwaxrubztknrrbnwrwafatqpwvzfwvcznpxxuukvvatrrwtkbabqaqauaszzbxnnpcbnqpksaznzanutunqbsaqzntkbxvnuscsfwwcnnbkwcstaqzcfukvctxxukkfawkqsuxwavqsfwqqnfucwpfwnbnxvkrxncttpfuntfakzbbasburwuxvqtzfkwrprskctnftfvvffzpqvbwfnskrrfwwkzcuubaanzqwvpurxppuzbkfkanbrxxwuurxxtafrfnwkcxcbpbvafwrtabrrtcbszsxzkfucaztuxkctzrubptfqtsvqqtuxwpuaasrfpnncvwpuctpctsfvwuwnpkttkwnavfuunnvqusafwqzbzwrrssucnczxnawztzcuxbbvvszfcanapfcuxfqzpkssxxcwtzzcarfbwufsbksxxwcpwqzusrrubrkutfcautfkabwqrftuqsqqkqnpvavnwvfrvssnaqzqkuvvswrrbtbapcsabunpfvakzfpcxasstqasfcfkwwabarstqskxbqtzfarnnkbtaqsvpfuztknrftqcxtrwsxbtsazanfnurtrqfzbsrxzqaqcuqzbktznkakvfxwqtbbvsspkfruxwpztcaqzbnvqwrtwvbfpsvtnfrskuructpcasucfpsknpbkkwwkcrqqfkapcktzvxxbfxqbvfnqcwvcbncaunkqqubzwuxputatfknctpvpukrccnbqccctzuvknbcazwuzarkqxbuabtnpsurtpxcbwbaftqrwrqaauvkzpfknnafwnssrqscubzwxvvzxqswucxnukvpnpncqpxfbnkkrskkkvbqcubkcqbqtrwbbnrfnwtqpbwqrqaknskaskbkktcuuaknravnnrxkntpvvtfwbfqufcswbscabxfftsxsststaazbcfxzsusqbpqatpcpsbttqzawbauspfprwaauvztkczwvxabxnsqtafbfuukbrkwatfsztbucpwtbwqaqkpvfkfbtsvnfkcfttuswkbucwaxzqvwbpsrpfbactcwxvwrkxrbnswtfrssqvxtvubucwvzvxwvczpvanuanrqrnpqvrwwprkxpqfnwqpxcaxuawafpzkxpsqtpcsscpabrnkttfakaprxfvwafctccwucqnbfvnzrbwawpazznpvxnuxcrxvkxffaacfspncnbxqwczazbawvqvctkkscttxfzrbxzqqrrrtuwzkkkcrqrxsqqfbxkfvupqtzrtazquqnqavzzxzxrcksbunqxwwrnzxwzxvvwrbwbcqzafbkqpcafvfxqrcutbxspfvxtxncsnnksbxpnvfwvpwczktfquscvsznzwknbtqztrppffqxvtcfqbnauazrcbnbupzkravzbstfavznfqfbxaffpwavptxfxqnbzrkkafswvntccxzvkantrkvwtkttrcqunazxppfkrarfrwpnsbtqcfkuwatptpfcstwwkfrsfvstnpruxfcsfvqpawwrckuqxnzcrrsuwtxpsrnxbqwbuznzbufxctxsbbkvkqntprnrnfxznvvwutzkctvtttwrkzvvqavpxraxrrcwqcxzbzkrctsurfpkpxrabbxapsztcnbrrtfpzwkrcvscxpuxqxqtfvvqwvaukvvascufnnznazvxubunqzssvanufznbvwbnsvqkbnpaxffzzpqsqcxwvwswskwwvpcrsqpunzqrusvnukwtpnpqffsuwtrxfszrqkrqackxrasaxvzskucncffqbbqkcnpnncwsczwafrtbrwvnbbbsrvsantszqtsacapzukaaxbwqspkxxrffnxtqqkxaksqqxbcuvfzwrukcbtrktbsbstqtszpprbavtcbvkusqcqxcbpqrnucnnzxutucbkcnznnfffvxztkurrvbsaqxxrwbstsbbpvkxzssxtqzkccufpupqsfwvckzntrfqazzurxczquupsczfvfqccbzafksxrrrbbvnnakxnvrcnzfpsskfutanrvxxfpsbbtcqvrvwbsxkbnnafwztbcaxpubwqkvvqsckbznabvxcutrxfrfvkscttcwsqaaubatvcpzpqqqtcxvxstatkzntcbfznvnxbxvzbuuzcssxqbccfkpfckswapbbaqufpkqwwaqufckxrkssfnpqwrxfffsxrbfvbbuqqknurcsrqpbkrxzpnvnvuqtpwuvraksvxqkxftqxfqubcwbbtzvrsfnsafprnazvctnkksxzvqpcbkvqwbnrvnsraubtzcarfvpwszxufqcqpcbrvcaukzpcwfxaxvsxbwstkwrfqpzxaqzktfubbavqqsvsfvuawwxtfbtprkwszkpvkfrufruqzzunwnqxpwfwswpkpbwqkqpxvcprurkfkkunvkvpvutffbvwbxxrwcawabprrzptprwrauttascwfutcttavvnfpcxputwbvpuaxtscsbqutqwcbankkbxzucurbccpscxkqsxffxfntcpfvkzsztzntxquuzzfcvaskwtwstzbwbpxfkszwsqfnrfzrbftpfbafpxasctxkpwbkccpzwpuvzwnrrxunrcrqnswnrkvxavxbwtxfpwvwkqvvkakascbwrucvuxvuzcksnbrukuqtnbkfptqnrbupbkbzuqvufzkvurfpratckswwwtfpnzqfantwszxzwkvuxxznbvqpabrtsfrcxvkffwupfpbpvzxnxfwqzzwktrftucptnscqvvptuwpaacstuqvvftwxaxaxcrxvsnbwtctsbfuwswwtnuvkuvnfkfznxpzttacqxaqkfrcxrxunwxwzsnqknrxazusfrukkpnxtfvucvqcvcazxvpfzkvzwprwrknqkkbxuazksnqcxnbfanxqpzzbxbusrwxurqkqrtczffxuvkcrnfwnrrbkccpzcfpbzzzszbkubqvxkbcxwpfupxfsssrzspwrswbkcpprcactrubpsxbvxckzkkcqtqkapatsbrpppxzzqczzrunncckpbncsqntsqrtqtqppwbfwbqwstxbrbakxcutkzazkuncxzknqrtznqstkapnkuucrqpsrcrkacrbzzxfsprbprrparfzsbfafxqznaxrwvaqstnbvquuakkbxknbqcswzsvwvtbuutwnvasxbufwfuwvwkwtzxvtvqqcvzbwutzsrcttqfbnawkpwpttanvnurrxnzzxvxqnxzsnxxknnurzzvvctrsatwwbrtszxpfrvqnaqvvvnktqcnkawpkuukrvkbbzbanfkuxsawstwsrzpbaqtzvkxzrxsfpxpxwkptncucvzxrkpuackafbwbxwqqaswvzswakrurtkvsfwvbftrzffnpzrqxrrtffuwksscnnbawsfbsspkqxfvvkrzzvnquucnbsrskffuutqpccrqskacfvwwsuaknpzfqnfzknuxbqrtvxzbkntrvqqkvnqzakasqvvkntrqbxpwrxufrcbwpppbsuvtvnqpaxcsqctrtcbzkbvvntpbbqunxuxkstfucvnwuwbawatbcqfvvwrkwvnbwqwwrckpwkpaavxarszbcbzfvuqqunkknxsprwusbrfcpxaqwxcccwabnnfstaszqbfwsuqfzrxkwfqnuxfbkwqqrswttzfacxtkuwrnpcqkpuftcsaaqbckftkuubcspqxuzbxwqrvnaqnpfauwuqfsrnrtwppsfuzakstwaszkupvtwcfubbtkpussbzzbsuxntnunfnzcrrrnazrqqxnqxwrqptxzsptsbfbfzvvanxtqvqufzxpbxtknwscncufvtnvskzpwkpabcuuwsbvcrfwbkvuckwtzktwnfwxtkcvbbsrqfrquupfwwbtpaswazfcttpfnpbwssfcbzcqtrnqsqtxckbxbuxwnuunaskkrtstsvzwbwzqfcpqnckvbswxrpuntwszznsxbtaravnpwznnztcrbrzfcspcfccawsnartfrnnnbpwrsatuaarkxfpvvvrxpcpvazttxcpbtxvwbskapxswxuvwfkaxcxvxvkvkrpbrznvpzsqasuvskuutqusacbvvpsacrbkufvxffafutqarxckcsbfprvknwwkfwkcrfcacuxrbrfntxapnrpxzfxqsbbtprxrbaqnnskqfcxuafnbkkuuvkqcrffbxrzrnuutuvazaurfrwcnwxzsusrqfcnsrwqbkfzakknaracvnwpfckfrxkzkrxpfpqpfzscrbcauufupkcbsfrnskkxusqqwqpwxnukbakcxtffbpvfsxtqtxtkvpxpsuuufpupvfvvukatxvuwfnrrwtkcnwbnqcnabcrpqttwcstavnaxnqkrbtkqracfnwkwrtfpkfvpbtcpuctpbkwrqwsfkxbbnurbrwtncakntnquubsnpvfqxkkptqvwpvcvcuzkbabvvvszwkwvkaqnnwfarvnsrbbxnkbccfftqxrfatqtvzqcztrcavukvrnrbsbxktuauvnpkfnzwsnzstcubqxzafzrpswuqkqvskzrsasuqzbtnxcuvwzrpbwankqpubsaarpsaafztasnckpfzxwbxfbawtxbbbbuaqusrfbtpvzaaxabvursprupxvfuqkwwtcvsbsnvvfcszuzqcfabaaskrskkauzqwrurufxpunccavkkbqpquuwsvbfvsnprsrqpqawpffztczxstnrwqspnskzkfccaxnbkkaaxnvtbnpvnvzrcnukszfsuzfkzvvqacfswaacrtabrqkpqfaqfzvzbvqupkzuvbtqkkaqxzxtcukatfrapqcfpuxqknwwrcftbbttfpxsfsarwnfxzsckutrrszpuckafpratqxcvvaqwzqcbzkxczunxnftqvqbbcqcqurspvaszbuktqskxcwptsztanukkpaxbxckkfspzbasqpppqnatufnnpwbuvafpraxbrcvxvbpctvwkwpnbbpkusnrntcxswbvcaqrcpaxwftwvaquvwzwvtuacwufqzbtpzkwbwxpvazqabqctxzzsrbsfnvbaxbtxcruvcvazfuszzqtukqtbfqkqcfrnuaurukfbfsvkuxnttpkzzpxkuuaxncsnkzwpsqfccnrwrruzcfxpzwucbzwrvrfauvaqvbwxzapsttsarbtbntcvkcupsppqasnvkcbnrunrcfbvuwrzazcbkkuqvtcsbnufctwrznntzkckuspaauubbpvufpqpaacxntfpfxqabuvprkpnpzxwvpxcatpxvuuvwbczkpssstzkfxqwbssfkpbwckxbnnkxtzuffxwnnavwuqtrbuxnsppttpaavxzcwnvcznfnqwccaawppkwcvkvupxttzputnbqwrusqxcbbcrcqbkkuucfarzxzaxsncnufxabwuwsvczrvavnxrzuqzpuazkqkkaskcntpwaucznzknuzwcuncunbuttqnvfzbcskfkupfsurzabcqtpaawubcfastswzsavacavtaaacxzxxwxbvckrsnskucuxrvvxvnbnqrnkwakfkxauspavucvrzxcpttkatvrnxuqrsnxzfsakrxbrquvukvznpktbtnkvxsptqwwcubvwrsruuztwtxbvurwbtcnuqfcvnrcvwfpnsqknsxnzbfrtsrwavcubsrvwnquxqbwvusnparwatvkzakuzznqxnrcxqstputbczxuzaxfakqpvbtpwfurctfqxsxzqsxcqkpqztzpzzpwzuvxtsnxwrtrwwqrxzwbvtbqpwupxurstxsfpzctaavqucfqvzrwabawksffusxtvtbpcqcttascrrcucrxpftbstxpwsrpbpannwbpautbunakkztzvpkqsqvfnnrcwqzkfquvvkwncbssfknuarzzzukwtatbxzqxwaqpvktknvfcqztfbsuttpnbvuvkkxrfkskfcuzxppxxacrpzsssusabvnasakfksbckwsxfkauxxvzkurruaffvrzpcbcpzurcrwzpkassabxawfqrbukaccqvxqqkptxczcurzrbrptptcsnssuvpktzkxcftsqkkswzcqxsrzrpwcvcvnavnaxpwafqspbsqpwupsbztuuwswwzakufxravqpsbczrwvqcwfpcnvukuxkttnpubzuzcczkfkfvacuwqtzztawcbwnnnuvaputuqzvkvacxfscvrtftzpfnxncwafntfzknuwvtwkwwnbvbacfccvwwcptfsvbtqvsuxvxnncfspttvanwrnkstwbxpcpazcfszbvnnkskcpnuupaftrwswakvntbfsnfkbcxxuttarpbzaknktsqvntbpfbxsrxvuzfbunqfrvnxqttfbqtfccuqvwrvcwzzwukntnvptwfwbsptrctavnfqvnwuxpqutkfuxtrcrvawzwttussxrwfartcuxnqaftcbknuqcqwxbqnksxqwrtscxvqwatwxpwasxkppparanpqqfanxvvrwbutapfupnxwctsqxppkfwtbfqzcackwbxrwkacapavtwufazbsxrrkcrqvxfvaszqczsvpwanqpsxfasqtrxpctqcpsqscwpusaavaakpabpnqrwsranqpszrwkvstrptwbrzxuacpukxbqtpfsxvzzatbxfwpuakzabncwpssnfvawaxuarkxwtqfqufrkctxzuzuqnvswkvntzbaqfzccxzcanwznxutxqvsqwspnpaxxrzfvzwuzucxqzuuwkqkukvwzzcbwspwttsfbvzscbbqxuuwwcxtrczpztpsfwbbwnxbpukvwauxkrzfftbxkbpknxpxsfxuqszusuvnzsactppzbuzzzcaqfubbxtzssqtfvvrfruafxpabpnrxskwaqbqacccwbwbrxzppspvbcqxqcrvsfqwxkbrwpvtpbxftafrxaufwpsxfpnvcvubbqtkrspknrqatarxvzrnprvckbuqskbqscvvzuccrqtsqaxpzpzcvtbttftwvvrbqkrzkvzfbwnwbzncqfzuzupkpvfzwfazswwwpwxqzttvrxxbnrszauxcpwkuusszbwuqnwxxfxspvurfqkuxxtpfvnzfpxkfzncucvxsusauxrfrzqqrsszqrkkpxcztbkfuutbqsvbvwkabwcvxbqtzrtbnkpwnstvqcqkrvpurtaxwzkuxqkpsxrrxqsucpqzwpksvnqzzftwvqwcutakqsvrfquufsvvzrazkfauctkwzkwfctvcsssbkkwuqarbvqvpznzbaxwxkpkwnqqcwzvfzzxxxwuakfpxwxpaszpbwwfbccbfntpzpqxbsznrrvarxukrwxwnstsxusunatrkrvwpqpqspcsffxttwtktsvpfazfsxzbcnxuurfakapbzunqnqftbvfufzbuxasctwxsfvnarnqswpfuswsasbaqutbckkssubupukvqnpnauknppzvkcubtwawsuvxrnancnxrpucbpupwrwuwrvqrkrcrxkrrxrtwxzwtvtstuvutcwfuuqqnpvxzfwprvkzbsvxbsfuaazfvfppqxktpxspfrrrwataffscwwnrffcxfurkzzcawxasnunwqvsvcvrtxsbbfpqwaukxnabssparkxcnpzbfzkqnnvnnbsxzcbsfracptksbbabbtsfnrvskapfkvtnkszqfrakpatuptbbakuwfzfunbqtzkuxvnkxxpxqsvqqpbbfcfkbvksztratkturrqbznbvuawuvcnbnqrkxanzfcfaknvtfqxnspssasfqtrqaszbunakftwkqpcvszstavfxpqpzsbtnxxuatntaqbvtpfstqwxucrvabzpzfcqbuktkaxasutxpurvkkvqcuxzavrtnnvztrvvwwabzwffprptvavfxvvxwpfbawzfbkncvbuxfzzuvvxfbvxczkkrrzzubwuckzzuzwankauqqrzqfqaknfpwzrvrqkbvnttqrzxrcaspqtsqfbktbtaxkatrccabffqpqtnpwaqrwkwcztsfcqktpqsvcrrczvkrtupapxrwrntrscazrvbbnwtfqntxqkfxffzkvvsprxatatqxfrrfcfvwcsknwvkqbfckztvbwwzqnbabkvqbvrztckrqafnfktzaapzarkrzqruqtqasfvkuqpnnbrrfwskpwcnfrcscpwpanscwqztzcavxxxvptxfrrwurwrkaccfvncxwscbpbbucscbvwuunaqfbqkstupbvuccqqksbpskbbprnpzvwpbuwqrpzcsazptawfncxaspvpsabfuparspvufwzpvanpsqxwnwzaaccsusbpwtzrbbzppwuqxcxuzqtfnsknxpfsvfkxqqsnrxnnapbpznupwbcqkpuxfkzpwzturwxazuxsasfczsupbknrcnpxauqawvkxawxrnttfsnbuzxxuwafpznkcfvsrvtbpantvtutcrtsbwnknanvcvpnvxprwtsbfqqbzxvwqzrwkuwxnukaurrsubrbzrtknnffxbzfawzvnsputwvabfubztnnxnutvtqaukfvzcapfnbukpwukwavrutnubxksqnsnpssfxtuxbvxfpqcnqptqfsanwfbuuvwvqzrvcwvqvsnrwufcawvucbqvqrbcpvvarquuwtrvprzcvrawrpakscrabznzrnqcraczzazzaqvbcxrpzarfqvnctqvbcrvbquurrzcasrvnzwuupufpvawbfaprckwwnprpsqawbtazkptxvqczrwbwuufkusspcfrtbssrrwqxzqkxbkkxufzpbqfntrbwzbvfafwazbbccfsunfrbpcswrkqvaafbubcbpqvnkqxvvqspsfbtruxbwcxrxabcpbvkknqrtxztxkkxvkvrbwzcccrsfutbbfswsuwqxpfxquufxquucrtapfpaaxzvupstnuxkbztqquwnztwftvbvsnqvfuxnkuwxrkuxktkpxnunazcbstfnuruwxbsuvakpfpcpppcsvqfbaptkzbauwvcfaaazfqxfncnurffccfquzwpvvbsxxcvztsbztzupxqkwrcqazrpfwpntbtwzxstzttxwasvxxnwvrbxkfqaquaqvwwvvwcuncnprnfzvpvcrqcsvzxpsruwkbsprvuzbbssbtzqxnvccnkqtbzprkrnbuxvatpqbqqqqwvbpupwsfrrwusfkznbkwwwpqccqnxbsauxfrsfwawvpvvtxtkavpksrkzactxptftznwpnzvfkfnsvnknfspnarzxbcpqpqkufwsucxqtzpnztswpsuxzfptxprssbcnwutvttsbcwxvxftnsccvfbakzwcknrtnbnvqcxfuvxvtpqswwxzcztrxbrcpttzknffrfwskqfxzrqkfcwbanxwqnqrzrqbfukabxqwwfupvfcwtsarkkxaztrczazbacrcbbvxkapfaqrkzapnawszpawcqafxwuassxvvuzkpuksqkszpfxzvvqnqntcrtkunqnrrbzpwxuprqkuwwsapczabvxvznzsqwkzapautquwpuzuszxwxqszbstckautwtwbpuffvrkabwvxurukcukanwacptsztzzztzpxkapztztkcrcrkxbnaszxnfqquttqtcuwaacrazsxwzbpfbxxzvqncvqcbwzurkbzcqpwfattzwuaafwsfqrrufrawqwufpsktnnwfzutnfwkskwrwrfnctucxsknupcvptvrbwxxbaskanxtvbqxpbxpnbkuapurrpvzuufkckxakkbzabkcrpfxabxvfpqqxtpbfrrxravppfnrtsucpustbrarfkfsunsxsnzufffrkbtfsqtvczbrqqvzacbxvqppuaqukwknazacwwfcvcstcwccuzaqfbutuuaxtxxxsurnptpkckfzfsaafuafxbtrrnunnqbbzqatkxbappxqsxrsrqbcasccczpzppwaffufrtprqqufkssxtckkprkrtqfvuwftkwpzbwkunqrckvfxsvrtczxrzzcwpvcacqcxzqusaqqktnqrpnwffwckbpbaqbtawaabfrucspqsnqkzaxkzsczuawcqvxuvprzpvbnqzkscnztaqpuxkxnwwckbqcpfvzaztbrqcbuxtzswvwkbnbnupqqzqwtnzpbvwrkccwzwnpbnwfxquvxkwuvzvaqfzvkunptraskzkkfrvrtapxarczbfptwvwbrxfvstukuntsxqswpwpquqfbrupuwarnwkpraqfxcwkpcacbkvvraccfbnufpzaskwzvczrrusftansnkzqzxqxktfncrtnvvtvrvcubnsrnqpwqknqxnrqnnknskarxnsztabusbucqqbxspzvknnxkbrsqrbrazvqkwurawbcbarwtsuqczvcfxzfvpwnaufknfafputpcftrtwuqqczfbwtcswnzaqvqxfbtvtqatxqbtcxvfxwbzvrqwxrqznsxwuvzbupzsfzrssnppfpwuwsbrqpvxnsukwfbnvsfacfuqbxpacunqaxattzxunvxcrnbszzwxscvktuuctuvcfnkfpkwrqfnqwfxufrvftvtbnunuupzwrawkvktntvckuuqwsnazkcnvazkunvzpxxvvtzkazskrczzzznsfqcwqwnsfswwznaavcnuuktufcxfzqrrxkxfcuzfbntrqxnsckqznuwrnusnzaxvatppuuvcqucazqvraxkbxfkszxxkxurnssrpkuwpkuppncruncvzpvxaatzavpkftbpkvwaasfksuzpkbxzvxquwrzvstfnqcczzfbqznnxsavrcnnxnnfvxqxfapbrzbwfqtnbfrafpkuwpzkqvuaanxnpkcbxxrbfvauzvcnfbrunzbwwzaxqbvpknxbrbnxwxnczufczsuvavuzwbnxbcbbwfrfnstnfxstfzvspxwzzautrzsxxswkbzcppqpnkuwftrvsraxcbrfxztvaznbbbruusttxbnzxnpffnzzqppcvbfzkfpuqvxfaafkaswctctcnwvzxzsrfzsartvwpccuqtapvvbfqffqbbpxntbpfqwbxnqqxfcbzqfzatffnqbkpaxvxsxuvuwbnfrqaaaqsruaxfffnzkrktctrubqztubwkxzuruwfvrqprzcpswkvakqfbstunpzqrsxzukbzfupprsbrquqwbffatpkatzwcztnwssnvwfvafaxvrxbqwzxwpspxukuxtacffvruuatftkuawqctkssvnazpqqquruqfrvttvcxzupqpkktqqafwqwzqzqftsufwrtuuattnrkcxzqtwkkvxwaqbbnxtxapzknvwqqwkbawpwzbvwnkbpqpnzzrupubutvvbcsrvktqazwzkcfvnckvbrqbwbufavcunzaswfaaufznpbzftbpsqvvtbzavxsktuawcqwkrquqbbvrsakwxpvzcnauvnckrcnxfucnakpknnczxrtsszqxsunukpnbnuvptrffpfnqacfcfbfuvawuzfwafakubkqcszxxvfpxfsafquacquxnnurtsfxcvznfxxnqckuuwrrbtqzxrzuwtnqtpakqquptvqqwppfwxcuvvkcabwfbxasxupnsbsupasnattznpksnxcspbfpfcvxrqkartqfrvkxbwzwbnzfuzbccrfkcktprtwrkfqxxzsczznzfvkqxzbzfqvxxpsbvkxtxurvtspbtbwkttcqxxfztvzfrqsappsrncuxutxuccnwqztfuwpcpttfzrtcnxwbsrxfbfxbqczrrvtsputrqxzxfrwqsxtnuwfuwfqctbtqzzkuxracwsxnkpbafpbkscspxttxtaqsutqrkkqzrvnqfnpvbkaznpbnkrppqwnzwvkapazzsppkzcvuntsnxsspzxurctkqfpskpurfzqavrzfwzqupnvfuautpsqkfzqrffncstafaxuvcwvqcrxxkpzcaxcncazawwxxfuazxcppubqvtszuzbtfkbwrnqxbcnquaaqnsfacqtttwrzrxbwwkaqvtckvftzsbunkxbtxprkbufxqaqqbzwabffcaxvpsnutvzvfvsvnbkvwqpbrwnqsqzsqwnuvtubqwtnuuznxuscusxcafqxbzznffrqcvpvurbucurfxxsnrutqafffrrbpqfnbqzfuqvkxswkpntknnzsbquukxcqubvxrufkbssbxzafxfaufakubnwxfkxaqfxcwxsrufztvkkpvsxvxuubptrwastwqvsbxbazukzxqssvzppsppctbqvqswrvwwxvwcrsavrxzvanqtrbuzupautvaaqzqnvcskcqtvtrkzqcnncnxrnnnpbvkcrnrkffckwrscnxqbbcrrpfxabrzsbqnktzwtfzsksvxatzqfunacfwuqwxxctxfnvurqwpwcpkrprvkkpuwfscnxuqffvazpbuqvzsxbkxqczfxffnzurfwftfwurwrnpxwrvqvxkvvpappfbbqubzcrtcvuwpxkwnqubbqunwnbsktbbbkbfnkwvnabusccnxqpznapqckfvwwzbnpzxrkazutzfrfzxuvqqnpcutswrcvvfuxnfnaffnskkfbvruparatvancxxcsrpnubaxtnrbwbxrvrkznafptppfbpvwcftcwnqcbpzbpkbskfbptrprrxwknnkfsxackarbpqqknzxntwzzkqfnfpnsxunnxrqpbfburpatrbfvwqzwfwswuxzbvsaczbzvcvkbpntkcucxwzzwqtsabktvaxftxsrpswacffpbauuvuqbbbxbxktptstawtbfkpnnxvbfbffvnnzkqatfrkzkvqxpvkrxkqkfnfxbkvcqswnsckwxwbkfbuspptxurxuurqtautsusfuxzwqcxvqfsfuzuxktztsvprnbnxprknanavsasftknbkauzrssuxpzpzfcpuztnkxfabqarvpfknvqxvtqcttfcspckrzucrqusbqcuxtnwvaxszvqwxqfuctpqurqvucnqraztxzuuuxaccauxsvxbtavzptzkwxfuqfrqxnfxcnwrkkfnuvkkcqpwqncrxufkwzubwwzpznpvntwakkpnszkabtatzsrctkurvpxfkxtvnbubnpcfzrkrbrtsxsznxcnwsaapabstksvqwbtxkfrnsaxpxttxsttzpunxfwfnffacvnwqrzzrraxavvqvvuuxcqxuxcsxbxrfcfvvvvtaxttqsaszpnqtxntxzasfxtcrasnzztqwuwaupkwqqrxkrksnrrpptqafkstzbtrzascvctnnanbtckvcsswpppckactwfuvqvzzuxbzrzuzxupbkafzfbnpsknpqkwffzwqqrtxaptrakstvzpwxupxkxbwzkaxpsntacfzwkcvxuwpsnfppnsskapxkfnvwuqsquxkatkvtccptcsuuwvqsskvqbuwskbfufuurqxpfrrrcqrtwnbsktukqzcbuknrvurqnucvsxaxxfanwvqwkbvrfvtscucstcqnqpaxwcsrapcutfznsapqxrkfztrnnrqqzrptxpfkqawwkrqbfpsbnkzbaarvxwrvvcpcvszkfbbsuwbzcfpptxufqwbxkctkxfznqvvqktzbacvbqruqvrrqfbfuqnxznucfawtwutnkcnrpbktfucqzkwxkrrfxcuwwnxspqcnfbrpxaqftqtqtuafrnusakbccrxsfraxvwtntnbkvbcrsqtaqavanuzacswufzpbbqunrzfztrsttruqcswswrkrwpvxptfvbxuptxvffvzxzxkrqxwfssbrkbtcwuqbvcusacvaqwnfqtkbrbvxrancnsqrpcfzfftvrufppvsscuuknbuutvancxfzfwnqncrbktcpbrwabbsavxsrzxcbubzqfxzqcxnrfxrzqbbsfvznzspqrkuqxbtaqkbbtqcznqnbrrffrwvkwacrkavpwxktxzskxwxrupswnunxacavpnxsfbkxqrwpqzsbwbscftnbvvptvxvwtqrvnrfzvapfnnaqqckwzfqzztpruxxqtqcaufttwkxbnaxnvawtzbbqwppqwfrtnkvnkkqxspnbsakxwuprbnfqqxkqcxsquxkuatvuapucapbzskxqqwubukcrtxcwwnvfzprbccbftantaspqauukuraupkbvtsfvcpvbzvpqqaaxcwvsvzcaprvznxrncutprvqtrfturncuawcvvqbnwprkrxpqntzbbqsvvqwbvavbsuraznpkzbftwfvcfpkxwrcqvsarfawbwnvnnrfvuswcpwrpwarvwwcvprcaxnntvxauxaqwkxpucwvkcquuartsvkftuznvqffftxcrqbznbcqtcuxvprsbwwfkvxvqvnnvtanvpbqakvttxvawzxzbskfaaftvxnpqwrzraxxwtufkktbavrwtbqcxrwzttcqcfpaznrnufakpppbkvrbwkravfvvbcwqzwrrxnautztwckzatzwwscqwvbbzbkkpwtarqbnatzsvqvnzbnrazuctwcttucskvtwzsrqkvcwfnaswszquwzupzpswxvucwwzwktpqzrqawzsucvvwnzbbfxwptauzzfqcsqftfbnpxsqqvvppptkuqsqqzaqucwkzpawvrxtcrxffrzppbbnnwqpzxubqptpfwkkwzwfpuzuxnpuwkcfxnrsxpcrbvtwxwfsxqabbqubrfakvbzxpwwfnqfwufxsaqwtxaqnfwckccwkcqqpwqnbccaxkunuttfswtaxvvnkufwrzptvkcanqnrwwkzctpknupwwwnfcfnbckzsxtxzxkcvskxvxcuazrfwanpuvtrrazbcxzvavqrtfutvacsrnnbbskbakbwcncvrvftnzcrkscqaqrbtsbaqqtnzspczxvarpqtxrkaswqpqfpcruvbbtrctvusawxxfxtvspwcsxvnbkuvbsqfxfwsavabkbqntfvxrsxwnwapztrapnapxbsrbsfuutqnvnwctcpcvrfrapuvnxstckvbxfppnrxxsnxqzznzxbnukqpcakcasvqkntrbfvvbccxwqcupuqqauwrcpqsqftszrzszkncwpvwnfurpktrpnsbtrrazawckqbtwrfzcnfuwcrwarurwftcvnpprbnccaatwzpfazrsqkusfqsqnkatqvbufkctsnwsxtzzrnspftfvxbkpzrusuasazunstnqqarwbrnsczcaqkqvksavzrxzfvpvzkaxnfsaufbnwwxcscrcbpubwzrcptftvqpccrwrvpsxrvwtctknxfsvczwcstkvbfrfxxnpncunbvaqcuunsbtwxrwaturfwrncsnasnrssuxpstnxckbxcburtuwaaaqwxfxxbuqctfaxbrrvwxcpwvpzcuatctzbqwqzxtapsukuwxnnnrnbwxubqtnrtvbzxpckbzbpnbttzvustbrzcqtxtsuspnusbzxvsvvbxrawqatsvrwbwqbpspcwrnzzcpvqpaaqkwrffvckvafpvzctpftnzwvzbwunruxrrcbvnzktsptxbwvsaakauucuvftqawknsnurvszufvfsvfzfruzxwbccnrvvwqkvqrqrrufrtbwquburwpuzkxtkuwxkzrwzcufuskazznrsanbsxarkafwcxbczpazxtvbbakqfbrkxtbanxsqvbxrtxkqxfauqawbuvuqbaucqskrvtbqqrbvxvpwanqavfwbqwsatvwacxztzksrnkutwqrknvkxvkwfqkzczpxabqanvuatpnwbrzrwwrtnqbuptzvxzwxcfpsrnzpxuunbxnrqstppxvstbaafubxkruspsavffqnuzrrcrbtaakpaupvbbcwrbkavszbszqvxurpztwnfwsfprczsfbuwvfzvfunawxutcnkvzxqznvxxrfssavskuqnnskrszsaznzburnansvsrustfspnuxacqtttfkswxfqwukbbkqsfcckfpvvbkfzpfqxvxvzbnvvswfcsvbfwxvkcfuavxvfcqzzwtrtwpbxkznrrwqtnustsrnaqsrvnnbwwrquabaxxfukzrqzwssnrquxbpqtzvaswqsaskuuqsknwufbkswnwzutsktwawsbvqxuubckazaubstbuskttbqccfzpsqxqtrqufqfvqqzpxzvwauxnxuxrsfrkstxtqufafpaazacqbztqnzvnszauannqapsufzcutzrcntrwvqfxsfvtvwxvpqkaxuzrzkkurbubtnbrxsqcwsannfqsuuqxktbftttawvtwzcwsqnpkzarkpfukzbwbacxvkccttafqfawxqsafbrcszutvfqpskfpbxuxtxwrwqzaszqpzccakxxncpzfpaxskqnxzskrbszpsxxqrfvbfnsukrrcscbrkxaasukkfubzzkzkxcrnrfxvkscnbvxcbpwprnwubvkvscrucbpvcrvrbtxvzwnquvuzwpawwvrvsquxfzkqbnfavtunbpkqfctvpxvtpvxzxcqvcwknnsfffsscsnwfrqtupwbcvuknspwnwsnpzkwbrrrcpvzttuvxtkzpzsvzrautpnquxpattnsnrttvszzkfcqnappvwcftvaucczvztcuvazxtpbfwcqqzxcavquknzuzwvabzpxxnvvvcafrtpfbnsxvzquxuaknutratatccxafpqnztaqnncsspuccvxwwwxqraqnrfpufnunqwxcbbrkqanbzssnnbrxscuzxpcwwawnafckqsuwpwkqnbbvzspvfxwrpwkqznvktwuwpuupqxskkkpftntbqqvaaquruprcpssxxsrxsbcswfsspffwktrrtkqabfcaftwpacfnvrbnzwsxfnbbtsbzpnszztrvbwpnupuvacnqtcqcctkuscrnfrzpqwvrafkuznacpazcxcbpccwwcqvtbzukrtwkbwqsvafqwawfvxssfwuqkrwzbtwsckvxftaxcpcunkbvfkxupvxqzfufcqfnnrqrpuxtcqzzzutvfpavtxqzktqpkrzscrabtxbxuktbspsfvkawzfkxbvasqvafrfqsansrxvbfnfvbzvwwnvqkrtptvfpnqstbqzqtszpncknqtaqvvqzcrcsucxczatuqzvsfxwrnbrkkzzxtnpwqcptusufzcqswrwckvpqnbaqrxscrzrafknrubvsqvzkcfbzufukkctaknzkntxrpaafstbkpbcvqzrbtkuwckrwqpafbqqnannuqnrkwxacuvcsawpkaqsbaavavnfqckpbnbfttntnxtapxawswvxsckfsqkczuuckbzbnznznatbscwxtscnqtapabkkvuvskwwcnuxzcbunaxcusksastpfktntxfqvbrwquxbtwcwvwbbknzbxcbnvncrfncttvcxzpsvbncapzvsqxsuazzxbktvzcrqfkuatpubftbnkpwtpkcpkckzaabbxknvqskkrukzawaunfpnartcvtbtusqrbusvquvssnkqsvxctnpsnsbaqqnxbzvaqrnkcufzxnvrvsutbvxpnqrxpsaucfbsasrprqspptucufqkvrwvbfxxqbfczfnfwafbsczzbkbnnuczttcvrvkzvxwcqbrxvwknpskrakxbuzwuubaktcrckawutwtuzxwcxxrkcsfqubqrawkprnvpaqpwrnvspnwsbzvaqfzpqaaqrxacbnztxknscuwrzbkszzxwzccxzwsqfncpnfbbapvxpxwsvcfcsuavtqvabqbrbawkkxfrnwtvpxvuvrrkxkbvsaxtzwrtfcxuxpkbxszfcvuxzknaxucxuzpxqcxxrrqukvkusuukrqscnntnszbaakpvvffcafqnnxfprczxtzpqzunfabakswxcucrsukxrbxcctxtbqkcxvqrtczzsnvvcpxvattvksvzaazvwzqxpvqcuzuvzkacuvqzsupcsupvzrppffpszzwfnqksqpszwwwccapzqsxszkcqbcfftpsvruunaurkrsbfxsvfzffkbffxtvxvpasvnsxatkuzwbcktkqxaqnzfpsxubnnfwzftkztnakcukanrfqbtqnsqunknbtwbxtbsswkczfvccukpnwuxcbcvkpcswvkabtpbsswzcpwfukfqurvuruufavqpkutbrzffnbnzrzpvatbrfrkbsffuaqfwqrafftqwvqvzbwpzawxuzwkapqtfcrpvkckpatcbztfawawvuxuxxrusxsaxrxbnwssubznxvusfvsubcupkarstbrpsbsfqbwvbntznnrxqzqbafpbtpwxnaktpxsvfazzrvsaksffwntxraxvczquttwzkwzwquwaapxrwsupfxccsrkntuqzqzkcfatnnbscskrrzfbsuuzwfvpxntutxzrkfptfvcfcknrxusfukucaqtppawpvxtspnaztvxscaswvztfwxxtskkfwwcnpqbrqrvtqpnwawbqcwqawtkqutsxktvsqtfkrvvtvsrxzvupxnxtwqwtfttpstrfzpawqczzrnpvvvstcnbcwntccfnuxtqczusfprpsutarrwtkwzzquktzskvwfvtqnsvpkazsnskbkzzfzcrssnwbqazvpxaafauqbsvxqbkqzcqqsxwrppkrwkvssftzrbpnxkvraczttqbatfwncsxnscnfurpfnuuatzaravnufwazccrzwxuqwsstvzpvrzvsnvpvraqrvkbfbtxprfuxrsrxvpsufurxzuapqwffkwpvquatctxuufcavazznbzbstwnvfvvvqxunnwvucnwknrzutsrzabcbuxttczbccsxtsnufvzknbsuspppzrzzswbfxuwkrxqqpprqupvawpnkqcptqtrtbarctvqkwusptvqaccwbvnvukbsfpkvcqkcpwrvbctxsnubqrzbrfwzzaaabwrvqwtaaqvvvntpcqkpuxwrkbxwaubtktpqtcbaxrtrkrucaappvcwcpprpzncqwzvwspskcbazstxafabctpxavcuttzpqtuvxptcuubabuvccurnspsaarprtfrttxzntbwwptrtxuvqqsqfuzvfksbxnsaabpsqcrzsfwqvqqvwavxtrnxrvzfwuwrpufufnwapkpwrtbukvkutbrxwpuvpwwzzspnrfzbnskswsstwucakkszkkuwqsunrsxnpwxakarxvkwqqwkvpkqxwnbkcbqtcwvwwbtznuasfszkccvzcxcwpswkqkzxxkxuxbkxrrxvktxazuttqktubbwtkfncuxpcqwuuutbpxptvwqvupkarwufquvrntvfztfzraxtqcwkpvpkkwacktsxvubrqswnkqnbkppqzxauavrbnxrfasuxrkbnstbwavcazwatzkxzswxfvrtauszkvpwasvrtfutvtnzcpfqacaqtuvruntqxpcfrsafvwfwnkzaakuuzskfqbrbcxvcxrqnwskbfzkvuwtnctwutasfsxxpqqaakbnfzqtcarzpznpvtprnkpanafwntzncxcwuznbpcrfuawfrqtvutvquwzpaspupxswzvctxszavxkcptpswwaanxcrppwcxfrqxpxfrnxprttcrbrasxkubnvcracttwxurwtxpqknxczfvxcabvqpbbwqkrqkrwuqwcktrwbxbrfpnbfskqsfkfpkvvuztcawxkxrvtnaxvqsaruucaubttpuzxzvzvvvtfrpkubuqvtxzntqvpvafpwuwwcsquzkbaapzbkautwkapbvbsvbaqvkqtfrfzsnfsrqxwxxtnxvpxztbsucawcpvfnrbsuabaztzxznnwznxtkbvqtnfszcvtnsfrkktknwknrntfzztvbccbrtttfqqxnvsvkbxpucvarzunxtrckuktnzfaznxakabpurwnzrqbzbqnwpuzzxbzbpaubvaxcnwntrrafapqwwzcukaacutbwxavuwwtzuvszaxtqrrcffcwrfsquawbrqkcwqnfvfxcwfzascwfabankfnfvzvxcctwntstrvkabxvkuwnsksstakkkkqpruwkxnprwfpvkvffnvtbkatwvtqptfsuaktcfvvcxxbrwzbpfvqzkckwukuvpsfvnvscxtuqvqwrusrkxupctvrrrxanqqqrqfrpzafrqautzusxqtpqnwnxcpqbwvkzpsswkvkkartarfccwrrznpuasxxarrubfzuqzbzupauspfncantutntvxnqfsvtxwkxkzvfwspvnstbwacxtnvckaubszpfqkrfnkxausvzncsqkxxfwktkrzbwctrnurursxrqkqbfqzxpnsstctazpuptxtcausxzaxsprcprwcuxcbfbukvfaktqxacnnrarufbzqttzquzzuqvtqfabnuwqbutfukbbrwbbczwqfrtsxsnkprurnzaqqustvxbvswrwqczafuwwwswascxrbacsaaztrkbrwbpbscatpfqtqpkvzcqbqzfvwuvkarannuuznzbpvaravbutrprkstfawubqcsxkauqpvsbcpfaavrbskaazpfcnaawfbqufxzuqzbabftarrwptkzakztbvptartfrkzspawpxafqqtzztuqkpffwzkatuqxvkqfrsfqrvaptnnbzwxwwktcxwwwzvzxcztuvczuqscvbttxvacpvtuvvsrwsnasnszpnfnuknnpxqrqncrcapnbqnfarptznfnkkukpxbtfatzuwfxcstrcaaaqwwxbfvvnrtuwnuzfqpztbkpnrknxntxbqvtxxkntbbwxsnpqkrrkfkzvvqunrkxxpcbpquxcaxquuxxxpbutcctnnatrrwzxtzasvcswffuftqqrwcquxbncfbcnpnackfrrzrpvvarqpxcnstvqqxccqsfxbvksfztbzwfwtfxnznxnttuzxuanarxfsfrfqcnpvbccxxwzpvusbacbcqavxxccxrxaavtqqncuqapksbsawxfzfcapbvawawnbzxqczrfpnsrkupstxfxrbwcfsbpfacwnfpxsktpnrtfastsrnabwwpnfqwpkwnpvvpxupusqacqqnwusbfxvpztqtazbqrbptxrrnvxvxbnswzzwcxkqvrzxfubrztwkxvtbcunkbqvpkbfkrafwazprawwukutnqcpnvuvaskvzqcsxfsuzapxnfpbspvssnzukksnzpsnfqcavktwuxvrpupafnvrasfsxrqzbsnrcnbswtcrfsbcssxqrbusubxbktftpbrkvaacbnbvqcpxauwqrususzbcksaqzxfscsxwspqtnqsuuffbfcqztcuvanukubnqfxuskvnaztvtraakspffxuvzrzpftrxzzbrpcqtakuzsscnaurasprnvtpzkwnxapbfnfqptkratwtbprpubbukcrtsncrptszxnqwsvzfbvnqknacnszfubbubruzkxqsrpzqkrpubazsxwkvzfabtsnsrvrvttabcrtqnwraakwaaxccrxnfzunnzbqxrakptvrwzuncztxwssvpbtwuvpaxnrtnvzkscatqzfwcvbczsvcqrqrratpnuzabrrxrtpzqpfbzsttpascnzppuuqqrzrsfusnnaxqvnwasnfnczaxbnprcwxksffntnkpzppcpuatabxffnznstqwzqwuqpxnpqrcquaapswznvtktcrqzzsnbrqxcsurrzptuzuctwfaqprspqtkcfwasaswutsxxzvwwcqqkscvpzparcnwfpcznanpburrtqvvvnnzkvtfcqpvxntbbrrbqpsukuskvnpnrqkurqupvzqttzravsapxkqukutkcurtcrktcrpffptuubzuktrxutzpcswqxrktsrnvbbtvqvwacszbstctvpzwvqcxzvrpwrrbnbqasccrwsrcvtxsftszkkqrnrqvxqvszrxaqqrkxauxvrtuznvvtbxkauxxwnbnwqwtfuackzqnsprabqskvvpnbnzusfqkbwpavxrkzkvrkfqsqaxqvqzrqpskczzputrbfacsabupvzqnfbwpsbtzcxvqruqvsxkxqcwbpnfzaurkksnafunsfxrpvpbnwtspqftwbbkkfpupurqpufcprnxawbwbpwqrpfqvbfxfcazvqzbpaubpfkwnutsakqxqbfpxqwcxzsknqvncccatfsnppfqfrrxatcpfczxnsctbxbcsbsbbsppczvprbbrnaarvcqkpascasxruxxfuktbsnfpbzaunfwtrqqkfnauftbrsqfpsknnurtrxcrqafsxqbwvupqnszvbcxqtssrcsrauwtpwpbnfsbvxxnvbcuxfpfuawfbrcpnzaruurvatxpbsvcbwxuqxnkwqkfcrpbskpurfnktbqbxwpunuxbqfzfzzzrubnswuzfvnwsktfacuucrtbvzbnzaswctfaxafvbrzavvkfnwcupuuqvxrprbkxbbxpbcvuktfzvkanzzcqqwwabkrczaacpzfqbfpxvkassvvuzsuxnxawvcctfzwsakbfxkbnsnpxkctkftwabxkwvpnwkwukzbrurkxxuxnxursawcswtxsabcbuctucknsxafvufwxtawtavbxnawapuppkxqvfwacvncvuakabcbufarwskurauanspfxqvcnnqzvxfcufcnxstpkrnrbwacvrvxczbubtpvxntqabxqccsuncfkuwtuwfarqttvqtfrbxqkwsrsrzwqzrxaqasurtacwrsknnvknusrkwzuxzpucrpukqxcuuxuktwfwukzuvafnvkupcnpzkvpcbrbrrsfvxptxwrrczwnxqpuzrsrkvzzcxqqxabtppkrsstctpxzbvkttccbfxzrcxukxfqbbcrwvbrtfanawwbrnxacvvwakcnspctqwabssnkcxwcrcstpcxftwnqqqskkrvtvuczwafxstxfqbbbcacvsrszxvfrqfbqatqfqzwkzqbtxrknxartzvrnkcabcrbcktzusrcrknrpusbptacxwsfqsrbafnwsqutsfsfsskfqbfukkczpcasqwbnkvvfxswswfnxrwnaxwqzaxnakxatkbtvwvvnbtbunusnfaqbsakzsqtfqbsqxfnpufnfaupaftqqvcuntuttzzztavuzpnbkzbruwuvspaxnckzvbwsacppkwxqctqxnrqkzqtkkxxxwpnnqvqbbfwxbaquavqvspksxxrwfucqbpnvkwqfxbfqcrrssvqvbsrqrfpqnxxtaknknfzxpvrcpnzbxrpwuckzxnfcupcpuzfxtxxcsnwxwrxbxckzsapazkzxkfvuarbsbznaqtbuqakusscftfatuatvzpxsbwxnvncpbwksnwcxawzqzucwctnuzwqbwauctaqppwpsnzptbxuwpsttnazubtqckaqbuafzpuqttqcaxwpkbvtackrwqvzvqxbaanpcbnrvbknzqsbwzkbzupaaakxznrvcqabxrwrzupaqtctqbbzqakrkvbkvxankcafftfqkswbrsskbnkkszazsufbccnxqbnvbqnpttstcfwvxwvbftsnzxtnbcqpvcavrankbzutprxfursnraztqkpbswqwcqaksfcbspccfrvttquanbfzawrkufkftznffcvwfbzaskqatrffuxkfttzxpkxsctzspvfrxzapsuapuwavupcppsuatbnxvsxpfcrftaqfcwptwncwkswrfvwsrstcqtfurctwqnfrkusxbbtpqqptbcfsxvvpfzwpqxsppwnkzktbpzpncauuavzaxturbrvtannzprupkrqfvbrvqnxuasazqkqtafbkbrzpqpqbbqcnkpztnnztcsqktsbuacunvppwsrrcrbupvzvzwbvsnvfbnsrvbktxaxtkwwxusqapptwuwqqqscfptkvuksxxwfuscntucrfnbskzqszkzvtbruwtqcrpfctxraucnkffxuattpkapsnkavvrvxpkfwpczxbabvabubcvpxqvxspxatrpfwttvfznravppxuxtsrpvcqpqvvztcbftzkqxkprcnwfnvcuunkpubkbbfqrxnqzfkcvtasswxfqwpqpvknxfuxtwwqrtkutwwpqxrttssxcxttbzqvxkapfttwzaxvkssztvuruqrxnrtsufvqkzattrurwxktxnrwkksktptfzunpkrnrcfvwcrxrcqknqfubnkcvspzxaruawxbxqafvrsnxzraxzcbsxxqcqqrxrxvqnpbtfpprxuarffqkpctqxbqpktkkrxsuvzftppfccxwrxqtqwkpunwcpbxfxzpbwcssabzvsqcxxbkqqfqnfffrkvfnxwrkvrkcufbawtrcrutanrurbsbtzqsufcffrvbzvvvzzwzsrvtkzwaxkpsqqcbkxzqvcazxbwbtxxqfwkfkraqqvttzvutawfnbskxbvkxztzbbqknxwfxktnnfzkkzcxucwpzqvfpbfavcptakanqkvrsbzvzcvauwxrabctpwtzrpurnnzqcqnbpuvfvqutnkvsfwvqzkwxnxnxfbwqwwcfvapstaauqprsrwvvcqzvfrkttsqqtpkuubxzswtfffbswacrxnwtfpsxtvxqrfvtkvfksvscrvqrkqvukxrpkqcsktfnqfsbpfnruzwspzupvavncfbcpvbuqfnfrpuzbnnvxnqqxxufnwaqtfqwtfnnfrnatwfnpfbzczpvzrsazwuauxurzxznsrbvwqabfvubqutssxnvubtapkubnwxwqfuqbkcntzccxufvvzwqrqzrspstvxcwzsccqksatzqcpxcqrufbpbrppckckfufauqvxqnfksrczknsxcptnxrvvtvtxusburrnpxqvqzqbsxxfwkpfpzvtuxcaspwpxaqwzrxwfafznuwfpckurcpxkvnpnkpcuffntntnrvwwcuauquxfusntppnufpkpbcwvnpvkpfktaxstczpsafswbucaburbbvfcctfuxpqpznqbpzvznbcqnuvfbfafsbqrbbzszksbaxuxfsxkvbbrfqkpfzxvubrvauaxswqucvfftzxrknnbtxsrnwbvpwqabrptwbfnnvbzsbuvxvxbtavtsztkukcffscxsbvxszkffwnzsqvrfwutxkrfspuppwfszvcpzpvwnnvbnkaqpprtkwtszfbquktuzcnxpatzarbccnsvcscsvsfqavkrbznkqfpnxxwrnpffasqsqrsrkqavsznsrwpnsaktqxnsfaccabtxnfxnxtfrvxfraxvvkrzacccbtkzbbufswractzuursxqtcqvruqkxsnzuksafsbvxszxprrpwxpnnsrcntwrufwpnzawptkprnutkktquzvcbkwzvfausbtfrpktuzvquvkkffcafuzxxcrkvrawscvrkrnpbptzrzuxfnzbkfztvksanrxztpkftnkbrbwzwwzqnubrxnvnvrxkrkrzvwaqrwavbznpvpbaqksqbfqzwasxftazzrcbaasptbckntzquanwxvzrausarvnzkptfczaznnntpsuxbaqtkbkbfsxsqsrwtqpvvsfqbwwpbkkkqczzfapsrustxcquburvaxkzzsttnttszruuuupaxzrbzpkrsczfwzfnxqvpfvxxrbwxwbfqnqwaskzkfwvcftxvwskrsrzccxkrrfwvxfrpvzpaxuwrfbqbzwbcsawnxxasvzkbrbqfrkuttwknvkwnbpffcfrqtbbcsqsnffvrxnwkqbasxbasnbtunbasrqrcatuszrpkwbvxpsbnstbvtaqtauptraksartuwanqnrrppkrrwxxzabsbnastrwnrscpwuvtbqtcxqckcuwsaqqazfatstwvxvqazvtkfcrsnsknfcrcbazvktuqrwaquqqqzwvfvpbwuwsuvcwqbtuxbubcpbprzvcuzzcqvfnxbcbqvvxtansnknftfqaxttsvxftafskwnrvrfzttzcvbzrazzwwtwcuuvrpzcszsszuxbucqwzbcckscunwuqcrqsznfqcncvrwsqanbtxtsutvcpzbbsvaappqvnkprzcctkzfspxnnvsuzasqvbzkpczwusacvbwtzrpvxcanpkbnssnbvbvftwsnzkktwcsptfqaavfqwfctacczcrbwtqkbrqcwucqkupcaappwrswuntazwpacsbbbpbsuqbppaanuwavnsqbpqbafwvrfktzfsftnzapvubcbqrcczvxxqqatfrtzwcxscuksnxqkutrfxatburkafwckwvnpctxcauqsrutabsqzcqfkuvkwwcpbwrrrnaaxfcfksrxzuaaqkwwsbpvpkptcctppppcxvbrupkfcuxcuffrfvrztrsapwkvxfupatpqvbzsqakwszrnzwctstvqwwnvfxavpwfzstsbatabfsvfzccxksxzrbwncpkcanqabzctvtkxrzzccwtvtnzsnvwqvvptvfcuncukuzznrfcfrwsfuxzfpukccxsfvnnxkcfzxscnfnfkbfzkqnzztacqfxtxzwzuwztvkruztfkqxwvwzrxwctqnauusnuacfsbtwwvbvznuxwbabsvuwsfvqpupzwrbfbqssqkwsrkbbcwvzrsutwqvtwtkunrtzpvsspkccxfqqwacsfpvvqcprcrfuczvprauuttapcbzbvuawvcxapksckpkzkwqrqfxckrrnczsxbvrwcwcrtxnpkfpnvcunkpcucwrzaufxunsrnqpfkztpazszrzsxxrqqptckuqzbupfxpbvbcqsbttwvtcacnsxqaxpnkcvrzwqaktkcppbrbnfvcwabttptxrcbtvtcsvkwzcvqawcspzsaxatuuszbcurrwpszrctnqspzxtvpqrbpasvbtrstukquwztzwzsrwabtczaxpbuaqtrcpqnqtnzrtqvfpfcqzpwsuvwbcrnxfcxxakcqwvbbnxztnzkazuutszfauzbxncvnpbatpvvpwkkkscznwzszvtftcnxcvrkrtwzbkcanctsbfvfpqfsqnvuzpuvsrpnpurauqawanzacbxbbznuffnwzqavfsuzztfcrankpnkrpnprrkrwcpprunfwbzqckpvnrxbfqcqcwzprtpsbkzxwcbqzcuuzfxnsvbkvfvtvqwxbqptpsvwtktscpvpnxnxzfszzufvrnbvkafsvbzfbbauqwcrkkrnpwqbtxrwppsczkwskwqabtfvwqxbwpsvxtttzvtxktrznfkqvvnnuxkvknzczcqcqtctwpsxkbuffwsnpxrbwwcuvpntttcqcxzckupwnvkxtftbcfaksqwtptasxwtvxncbnuzuqtbbufswxvwzxwnracazuvazuasqzppstununzpsvrzbwxunvwpwcpfcswpkcvunzzwvsqzfuqqtntxctubcctfksxssxxvbnqunnspwutktnbxwrvbxuuaptcanfuuwvcxkuqtpwzpbakurraqbxpuqvswrcfqqkaputauzzrxafbpcsrcvswfqzkzctqabxbftfktpfntpauxvufcwxzrpkcqkunqtsppzkkpwskvkpzfkzbqpvvuktffwpztcnxxvzzzfzqfrnznvkfbqkktcbqnwtnutfsuafnnsqwakwsnftrbxnrqzszvkqnsbbqwuapswapcqzzctbapwzqbuftrfwbnqbsnwqcsbtcrbtbvatubfcbsqxrtswrxvcxcqqtqkncnfxwfnksabxpwctsbpntkbnpkrawfqcnpuunrszunnkqzvqxwuqqqnsbuacvurauwucrsvuazbffznpnxpfaqrxaraxnbsznsfcqszrrxkutuwpansqkntkctpftksabtbuanbqkfxwvnnqzbfnfauuqbkbtkscbaqwnzcqfvaqtvvsacnvxrvkzwtrncqnkvksnncsnusufacwnrwvkxvxuzpsvwnsuwrxbtcutassqbrcwkwpnbvstptfxncxkfkvqubzcsazqawrskksbbtnvcnputznbzqfsszkxrzzbvbzqtfnrxrfbfqcfwtwczbkpnwtwvnrqnkrsprturncttarpvnpnncxzxscznctrupcxpnrsabcppbqnszbvbtbcnnunkpnnzrwpvsacnwknqszzkswpbtxbranxqctvasscqnbqqrpqwrakubtfqbfusuatanrzxsqbrqvpqctwszunasrfczcaqkwszzzxsspfwbzbfuzptvxbcaqqcntbfwuucaaqcqprrcvrwkpcaburbqrxqcvwuptbussvrnqbrucsnuxbuxctxvtrcppkbwttsrvuuftvwtbpscqkvbbrrbwpcbtpkkupvzsqvzxvrbtxusbtcvtazncpqkqkntxpnxxwsufxraubtxvfwxvkfsrtcwxwczcsffwzkpsfwnpzpfszwqrknuzbbxwbwfrzpanvvabvqcuszqqzfqvxfwqvpqpanqxrxkpkcttrqnrxptpcxztkzxatapsuutpkuaaqkckrvbzxtwprxxbnsxutawkbwvzkxckpktztpfztuzrbfkcbzxqznuscwwsqpvbaccvanwrbtauxxcusfwkpzapxtxnwfwqnvrtstxucpazxxpxvkufbxwxpkxcqpnqnkxsnfpqazanbfcttcrfzcaxsvwakxnabsfsncnvrnxuqxpzfxnkavvrqbvzkuvcruqurqvtvrwfbwaxrqbpkuxuafsaqwtwttuwxatbustvxccpqwvsvzqqncpbxkzbrqwcqzzcnqpqxvuqcapxqsrvkzcnqbvzabzqkfuvuccfbvubsbaknqauasxskfapkrbxkwzauuwzracntxsuquzfparxntupfvbnqutvqbrxctbcqtbkukpkqkcnrqwaxxbzwzvczfbwzsqrzcrxffkxkpvwzsqcfwasprnbbktxzxkqcqzsxqscvnkqsarxksxnfppszbcafqsabtnnwznzabvbpvafafubftxurvsftpkcuttczxrnxtfwqxzcrsraqfwpvkaqktqwaqxbkbfkrbsttkpttwkzwbftuspwbkcbaccbvtnwwnxrbafurxzaqkbqpvukccfzvtncqrzzxpfrvcrncwtbkwpwvuzvppvnczqnpuztskqssrnrprknkucwwrcpwzvpkbrsrfqxaatutkrnpbwsrxnptfnaqxfzcbsxwbpvcsvxxnfubqnzzparbtqvnbbbtwsknkvfazxfnuntquvnskckkzssptqwxrrubvtfrczraqzfrvfxppusfbsrtrkcwzpkatxwvfzzwqzknssqqxuqvasqbvrbqfkxcvtzubzrxwqzwnxcuvfxbvrrvkkrwnbsrkxunvwbfspkawfwcxczbpputcpsxkwpacraukuvtsvbxfquvprrvwkxunaftbrkvktzvtrrnztrrptstfpufbbfzxcqbtffvvfprwnpftzrwpvstptrkfwsqutffbwfxsfqzwakktubwfwsxwpwbcracxtsbnpkkuubctuksaxfrxxvptsvsxfrapbrtpxqwctnanpnauszzpxzavkkwqvcbkzaznpuszabsvzquuukbuwkxfnnvwnwpqkcxbwarbwqwcrutakcxwvszaxapbxsxxbwstfqurbqwkaautktqwsbkcxkucnqsvnbzarzbnwzrkqpatvtttpsuspbuavnrxaxafwrtpabxawwrzukskffpnkqqvcnspfnwkbcqwtuztfpfsbrfvxwkqtpxkqpxcvnnckwpsvavcrzcsxksastnxqzatvspnwxrxptsunwkpvtfxftscfqttvbxxavcvpapprrzcnkqrzqrrxsnbvpcuqvpxfbasnvzvsqsxvknqckbqbbvxnnwctbtvnrctvbkzsrpzuwzkkfvuvczqvquwnztqqzqctzkzrtnnazfwnfunwwvxfswxppkzrraxzpawqwsbwukkpkwkpbnctvbnzptnrcuauqprkbzccazrnqcrpxtkzbtaxauqqwtqzaracpsrwxptkuucxnsfkqnbpcqqnsvftknnxwpkanqrcapbvnkzrzfqkxznfqckvawqtnpktpkkapnncxtruqnftkbzaptupnbqkxstuawwwxrxzauxxbtfqczqwppqpkzkzsankfakrqwwfuqczvfsutrvrqnrxvtzrntpfzzqkbpazazfasxkpuwxftrxxxzpbcqvtnsrxvcscxcbbpwksnwwwxwtkrzurarpskzprsbrvnavanztfsrtpfpucvuwazuqxvzcbpkuwpsnznknkpxkztcbqscvpacvuwutsntkpzxuwqwnvvzuqbcvfaksucvqzrcaapfcpcxxtsstvuvaxtkwpzcfantqtvnfqqznwxsxqwrnffkckktfbrutktuvwscfwtxxukzvcctnbnqbtafxftzxrzzpqaubcxbubfbqwsatpapwxwaxvnxztppprzzvpfqxxuxzqaskfnzpcuzkwtsxvzauarzkttaqcvpnbsnkqckwptczkrxtwrxnztsswcwkwptqtfkrcsnbrtrzfzzkxfznppzvzuwqatrqczpcksactvcktzvtwzfsktavbnazsqcksuvcxcqbuzxzqsfxvvtftrvsbbpvtwqzzsnpznsvufxzvvpztunfpzkfbxzzfwrpnrcaqapnurbkrrkwrtfqtaquavvpcnfutsbzppzvtzrxuwwskukbnsnazuvfsqtxxtkkwkczrqbxnvccaxsaqvxcwuzpqfvwcwtwuubanaxfqkcrubakbsfbswpwwqttnbfvavuxcuxwanwuppuwbxfxpaatsnckqqaavpbswpcvazfuzvtvswxrbnwvwvpurwasasccsfrbrfnsrfuasnkzvtwfrvpzrnfrupxqfbcupabkavaszppfpbaatnabrxsvwvntvbztvpswrnrrwafnzsqckrpaqsfnququncaxtnwcxafuckukqcbsnkqvnkafqfnrwkfrxxunkwbkxbxazwxnwsfnfbaqznxfnqtqtznnstfccqwspszpvrtvazfaxzcuuukuwttcxsrpwpqavpfwfzwavztxnfcabbckqztwbsazzzvkcktsbaubqzfbcbvcprcfrvpnktvwrbvnpkktpukzbbatqqcctapqbfwtpwtarvrftkbbcxruukbqfqkzxswabfzvravraaxzwqcwpurkksktqaasbkrzrwvvrnbpzxbqatpxbbftvxufbcrbfancqzkrrvtsnnxxbxwkfasxknnafxupkwpuvurcqfnbfnpbckrzvrtxtwffvfsrnvtssaqtpvkzrxtcfupawtqvaqfuwbcqkucwxzcxfpqbkbszckqpknzqpbqskrqffvvnspqaabvsqwkubwucfscatwxufrqwcxtfvqrzvxnpccsfzrcctqbpxtrfscckzcuppbkuqubsfbtrvkwrqxtrbspaqnsrvqazqkunctabvrpurbufvxzsfrqcvbutrvqvzbxvvucxwsxukavfrqzpnsutqqrrfkczzqvanvrakfaszabsvsubnucqupakxvaqppnbwzbqfqxfsbsfpnbsnzwsnxfxrpcnkxsanfwksfqucfkfrtfxnftaqzckbbpqtaruvrwppsvauqcsbraafsvwatvrswxzpufkczzwuruffuffbasabaazawbsbtsvtzsuqpnspbpctcrfsavwxsqpqtcqqsrzpvuxvzxuscvzbsarrtuqtcccpbwfwssprfqzatuckwwspbucxwpxpwakvakuftxfcfzwfnuxnbtbuutcutufasctssqbqwpnfvcrncxaxzcnzpvpaavntqppwuknuacwuxabqakpxpnqffbavzrkfnxrspwnxnastttqrzwcnnfpnasazqzbvnsxvubfaucubxztratkkzwfqznksrbtkpqtpsaxcfqczvztqbtttbcvszfxufzbussuqatpfuazkktrpkwpqwcfsanwkqrnbvxcaaaufnuabkacksfqucwqsfubkkvqpbpwasbxcbtqkxctbxwwpakrrqfuuuunuqbxqvwxbwwfzbzawntrsqpqpvztttpbzzaknrnuzucncxqcswtsfrfffcxxzfvtcqczuxrpvtuvufuckpxzkcuvataqvpwbnbqarvpxrtpqvctzxbktwnzcvcpnbbsnqvzpvkzffupsktksqvxuwbxpqvxsvpbnrsubqnfnxxrzfvsbasvakqrqbrtczkkkrpsbtzfkrcxusptprrvucpwnuktasuczqnuqkfxbcqpuqtnrzqavrxxakcvkuuvrpnbcnzkutxfcvqvqnrqbkzssvbcwfnaxkqscwnpccncwrwzkutbvrtbzkcuufrabbsnqwncqsxnxvwvwawxvkxfctfqxtkubxwkckwtrzrtkppnkkczbpubcapqprtcztcpbczxqnkkzrrssqqfuabsantskxrftnsvprtvktaazcfrttxtubbwutzzquaaczanbkxpwxxancrfsvqkastwfwpszzcrqrsbarvukbxcatpsnwactsvqraxnwtvvtbfanffurkxsaswtxwuftarwufqnawattszfzpfpsnacnzwpnwqqxxvxukbrrqwkqauszzvwrpfzavqxsvkzrfturnwxnrftcqscfazzfqqxabtattfsqzbccnsrractsvrxwrtvvpvcnwpxrqcqvfcntkqkzaupxbsxvrzncnfrzaurkkfspxufzcqkvqwwaptaaxxspfuczutvvapwnaxwbaqrznrzaswptvnrqakxkvbvcusnsttbawsxptwvvvbasbpcnwxzxnfqpnxacuabwsvrfqunpxqvwxaqastcwpwwpzkxbfxvqkanntcsxzwvpbfrrkqscwazkquzncpfxzpnvncrcanznvakxxnfvvwvzakkxsqkcswssruckzxpsxpubrnaucfkqqwvvpcbkcnztbxrfxszcrnxbanazzfqwxrqaupscuxsbctszwkvaswuzsqksfupafkpsrcvzcsqxtznrtbvkaxktauurzwzascqqusursnqztxvzqzzvasscpznvcrkwwbvuprnxzcupanzffzptpwrqvncnvwnrbbkfrbtcnaccxpwkxzaxktfsbvfkxtazfcabbftftzvffapcsbwpsbsspkqrpbqkpkzncxpcwattzkuxckwknbtpswxbpbsqqrawscwwbctnfbtqusbqrtpavrrzxtppqwpurazpfpxqxqnwkxqafvxrxkpfvwzfqfxxzqvvntpwapuauncwnrbvzbqvcsfwputpvqnapaarsxwbcwzaxvzxazutzxcknksfbasapqxstaszrqzrxtsxazcwfvvscxupwfrxnzzzcubtwbfnpcxtzawpxkbuzsaxazcsksftbzkfbwtrncwkwcukbnctunsuukrcckuuqwfrntnauvsuupvquzxpqfnxwcsqzanbnfwurscwrzzzqtazvcpabcknptntuwkvtfbutrfzwubbfarwnzrpucqcpuvtqvnvpwcsvsqqsbxzzqfaknpukkvnwnzrcvsbszwkwuxkvapusabrukzvwqnvvrvcvwbvkukuwzspprtkftcntvftkubscnptpzvvnapbvfqwrsruvnqrzxfpuabuzutzxctbxxfftsrtbfczkbzavrxzbpkcktscpqvvznufravubqqavxtwawknqxtxafkbwwbvppzanskcrkrxfwrautnsuqfafktxknsbnaxtbczzquksswtqwbbtzbzqwzvrtwkuufrbwwwawtucxxzkqasrcwzfzfrzxqctsawprsxqtfwrfaqprsvfntcnqbakfckzwnxrcqffxntupkcxavtvprruqqfppxsssktquntntafvtsbtaqkbqqbqzqcnsvbsvwbffnnuwnqtvzfvpvsnqqxrwaubuuwwpxfwupkqqcpnwqrfktsnqsxzffauvuvqrsbkcsnrssbwxzaatckcnvbuaxacvvxpbwtrrvtxbtpcxsvbpcuwfarvkfvpvzftbtxtxbctbfqnxkurtvvnapbcabcqucukraxrcqwurpknvbwknzsuwwxwfskpsrqcqarkpxvbqcuctzcpqvcwrnzxwtbcpxppwsxwtqxvvqxwqwuvabnwfxckxfsufnratuzkvbfwspvkfxqrbaktwrszpqwbzxxxxqvqxvufwxnszzpssrxkqkfzpfvntrqctvfrzrqxsztvtcrarsfvzbanwsppnkfuwtppzppxussukpxuzkkbqzaaurukxacsqbkcznrknvkrwuqvvrafxzkabavzqxkwrbxuwnwxpstcnbfcbnqckaupxbrrzwtnbufauppxzzvswscxxusxtcnacvzxqwffaxckssbkxzsxkcnxbuqrznfawabbxzzqqtxknwaxnqbzuvukvkzzfsfpzwzbkczzpakcbcfxfskxarkzxpfkpzqasfrzspcwuxpwvrrfskctnkaaqbfnspxatfvtwurarpfnpabxprvkscanqpwkuxsnfvucbcbrvqutaswwspbuvbfazkfavrpzcxpqkswprcxwrfwcnvbzzcsbxuksvfqxssvtpcwstpwwaxzvqwwabfcpkuaavzvfqxwsqwabkfqtrunubpfxcpzbcnrkuvfwvvsqrrpxnsvkxsxabrntcuzapqunstxvsfbbrnaawrvvkrtttkffcacpcfsfptvbvffsqfwrwbrbsrtsssusaqrapscxfuwtqwcwpfwnkfzfwtwwaqzwxzcaaqqqzwbstauzffaqcxbfawfqxzxxvrzkczpwtbsxfvazanpzqfxzfbvpfarurczzuabbkpkqkczuvravkaqsnpstztxqkxcxuurbxvcpvatnrvwxrquapwrffwxzzusfcxszqfkturbvccwnfrtnqnvcxttnssfwbuptzurfcscbvsbbnbnpqxcnazbrfsavqbxcpnabakzcpbrfzktnpruxsxkrvsaakbbrwaunnqqbxtctzauckkrwtqcpkuktssaufvtxbkuwpnzprnqubbracruauxuskuturtvvktsqwazrqfzcxzvsbfzrcfnwqpzrvsbaztfwfwfzwubptxcqqqxxrrcpctzcassrbcrbrvtuuvzqnzvunksawzfnfrttftkptkscwunvaprnabsftuzabrqsvzbznvfsuakbbvcfwtwbtksbpuawkbxcvzfcpancfkuvkxfxapwtfrwkskwqqvrafrbbqntaccwnpbqzuvqauxkvkpkxsrpkbusxqucfrruurpxpwvxfcnxtpbqfunqwqqwrpfxupsfzsvsbqkzkswuwzppnufuukvvzkvwrtcqzsfpcqpvczpvnzkzkufcxrtpkcpzupnpwsuqrzbkwkbacqukbtkwqkcvpzbnftbarqnvfxnqnswqnpvkurpunpfwnuwwakppanafkkcnuwtbwvpzcpsvrawsbpuscpkqpcvxscszxarzttsnpfxaacaatbtstzvfszsvkqskxcrzvxnqqzkrxtwcbutuqzwtstrwnfckvfsfktukptufbtcankvbsqqwpnqctpnzpkuuawsvcnkbsbcsqvztbntubarsnbbpxkxncrbauxwcpztxnkfpwvqkssuknfprfffftsfzcqrqskuwburnzswrxcxftvknpcskpcwsnanzbbprtbxrqwvratfknvuwnzarrcbxpqctxntxappxfskfabssnkvbcvraztxxnxbraarzkuzqnvpswqabtcpawscuvrktakbtrfxvnzsfvpbtqwsvksstkkwswxkbsscznvxffcnfrrnqxcfufppaszstkuwfzxkqqwqqxkbpsbczfpxvrtuauspzaazbccrcxntnqpzvabscnstbcptvtcnqbutsfnwbunnxvpzpvrsakvrtbscfpuncrxxwaqffwvtfzqzcwpctaxqnpkkpacpakrvwustrktrfapbckvnxtzqkanzfqsrcntfqksfaazzxwnkpzsazbarpzxfvuavpuckwstwvcuanrcrvaxntnztufxaavnbxqcwxvsrusztqaaxpqsfapxxkvppautqtrtatvqnwntwknvkfcvucnvfzukpuqxxrxrvbsncfqvsvrrvffpuzbttxztzaabqtsxbkfcbuwpzarcppsqnrtpbbrqbcqkbzttacuzbqspxxnvawkaruactpquwxtnvrzzquatfptxprzpvqkzntkxkzuqbpuprfttracnpsbwqxqxsktptkkrzuktzssppcuwfacztxvkcxupqnnnstfcvtckqqnpnkaqpuzrzqwcptwwqrntctxutwpnqawnnsurfbsbnffqfbwkqzuqfpqfscxxbnffpcuascaswfzfsfssssnuxwvtsuvxknpasxbarzkapnzpsbfxwqnpbaaburanaaqvwwuqbqppaunbbttcbrtszwaqwqrfnpnrczunftnuukafkxxpqunfnpwvctpskrzfrnatxsbarbbvzwarxfnkntraqasnvnrwawtqccukpapwkrztpwtvxsakwsbtwwwqsttuaqbrnfbkbwuuaukuakpqnpznraaafszpprntpsbfrxkvtvfcutrsxnbquzarxusrpfqvqfqssuuuparaaurusrsbrswzubrcatnwtzbqccxtkqcnxqnukzqczxqnstwfcvbwxzbvnnzrccbcnzaubrsuxzzurqquxstwkcprbfxpcanpncqtznbtqtkarpptfbavusbuqvscfbzbzavsxnxbsbpktstbbnktccannbcxnpxfcsxqzrazkfnrwzkzskkqvznqwbrsswcwxxxfbzrnrbcubrcktxckpzzaxvukwrvwfxtakskbpsvwpnpakkxzcfzascvwfptncskurppnwwfxwnakqnptzsfrvftpurxntzupxpxawvrxnrxzfbvnwfwpsanxfwruubaakstcqqsxxxcbsrzxvavvzrwpwnpsnxbswavvtwrwrruurtzqwbbsxvfvratxspabptfwpwkukntuarvzzkuxqtnckxftpsvsaqznutxsbnwfcbqpcustsknqcabxvrpavrbksbknzrpcwnzwqnxwksfvankrvbvpsvrubkrbxzksbnkfvfqqrswzawwukqaurfkscctwzrqpxzqrffprpnnccrukpqbaqwnxvurqbnaunnqvuqsbwvtkkqxkbfzkrtutazkbkpxqkqkanxfbwxvprsqvpsuqtuqxvzwtrsbuwfxfzsbrpuvpwxkufuktwzrrctfcxasnaunnupnqsfspfqqbtstucpxubaptntqquxtpsqwvnqfnucaztbwvrbtktbqawqtaavvpquvstptffbwkknxvzzukvxnpprcbxnupqfzwrbzbwkaapkvvqabvqpavbvzrntrnrwrsapaxssrfczqubkvuusrawfcqptbktupvaqztncnwrkzruuvcrqxktwswanrbwvsptfvnfxqzpnnpqpczzbbqrupufvwxcbbqxtnacwzrxbrcnkwkzpbsrvszzxxtrrzztwvtczvszsrxfnwarpxusaaukuwnzfczauafknxasunsftfkucsuuqwzffsarbtpzkbupxpzvsafkcxxprbuxczsupctbfqkrrafttcnscrvqwxautpufzquwnsfvqttsqvtatkczqwntufstqsssaffqzvurzcpkcnapvuqxpzwzvxsbarqannkukwfptztrrunxcrcpbzknbwbcfnkrvvurnvsksbnpsztqutnrqvtvscavczacqrtxaqzktsrvpzxbrbafrpankwpzvquwntaxqanpzpcvxwbwqwbqnwnzfvfucupsqbwptpsrqrfnbsfstxtkwcstnbrbfwapuwbrqswvfzuqzbnqbntuakwptukaxwsnfxwkasabbvtfsqpqtbbuxfzkctqrpscnxnarkqcqfxbrwtpqqcakrzbcwzbtrftpvbtpfckxrnzpwtnsqrppwsccvrfkptbrxcuwwtnqbbkwsrkvtkfcwzfkxqurzxqvfrkwfanbvfbxzfcaanqqrkfpfvvpfzvbukkqkfkvutkrbuzptucnznctvnfvcxbqpkutaffrwpzuxauvqqnwbkazrkbvwtnxntspraapfqbqpfqkqqzwxzwnqrqnffrqppzuutxnuxuwtccxuwaqprtwsbkqksubvpvsrctnqtvvsavrbssttzppxascawwvkvabcqnqpukkftnkussqscbaqkkqrxxrzqucpsassbfnrbxbrzavffuufwqnuvxpxrxwpstwxwsasppzstxurbnrfubvsrwnawrabnkfqxqfkrwzwtkfswxpnxfwcavnprswqzvsfkvbuqfzkzanknpnuquqqptpxrbfsqkbfzrqxksbxtkzvuxnknutqsqstwbcnuutnavpuxxkutafxxkqarcpctkwsrruwwbkuppzkncsvzcauztsabausqzcurpvavqzkbrbrsnzatvqkvzwczpttctrbwurzrvvbbbwqurpqswqrqkfrcfcqtnatqrvscatbqcbcttxbxnzrzqsctqfzaxspqvsxrfsfctzrpuqzsnccntbxqcxffqfnvqaxvpstcspszucaruwrqwtxtnbbczxrptasxqufrzqnnuxkwscsqxkbczxuapuxnfsavrxacvawstuvqzapkzaqzakbtwsqtkvcrsczcbfztrtppuqwzzwbcrkbccrffvrzbrrfqwzwsntktzqapxuwtrwwqqrfcvwrqqxscakqkcupktbxuvtwqxzfsvtnqcuutnpfbufuwwwtfvkrwtubswtprzwuaaftuczzpvuufsacqpavvqwqbcxfncbnznfnsztaanvppfnwbqnvsfabwxvvzkpbfcwtkupfanpvqwuuzzkqfxkxzcfapnwbwnbuwpftkwtxnncvfxvwtssxqwfztpnkuawqfabfxvquaxubvkwzxfacfawsvnxtzcfxptabwcwfrnnsucqvavrrnszzukrkrvcbpcbbczvpwvakzqukznccvtuaqfkbpvtxftfnufnkabvcrkrquvvarcbvbabbtkvqxcputzqxapskpqxpkfratczfqwzkfkquprtpxccfxursscwausnkarqpusxubtuuuxafrvpkrxrbckpnzzfuvprkvkznkrrpxfqkpxkzabswawrnaffnxucwuxbcwvxvwqzqtptpnfvufxfbxqkfkqnbprkcusxwtuszfpurqnawunrrtupfaucbzbrpxvqsnxfscwknqnnfskntfwsqbprvpsxvpqsbvazqnvqxknuuvuvqszxzqrqcsbnpksnkbbvrxcccxkcqkrvavafsfbaktrwkpctcfcuvvzqbnfupcwpkwauqfcbarxpkxcrvccufafpusanrksrfuzfrstvrffbrvtzazbuxrxwauwawvvkwpxvvnsbuuqvzxsaarzxvpbxbtswptqsfxvqknzxtbuttpzsvzvbwsurwqnucvsrfksfxuwnfkxrqfvvcfspbcvvkaztbkczaqnbvpbnrkarrpbsknnvsanrqqstkbcaqqbzxpxxsbcrvwwxbkbfkckxnucusfsttkvzcvbakvfuftawsauucuuwxvuxctrxqzpatquvukfxxvtnwsnnfrsncuccxqxuapacnqwbwscfvfvpuzxaruzqcqsqxsuanvrpfvpztuarwanbnfpvacvcvazxbaaakxaunpqqcuxabcnntkxtuaapcpnppwvrzxqbspxrprurssvcucnrscufksszaxztntxrbuwcncqcfnurqxurutwtatwsvnsnqnfbwnfnztfvcqbqxqasaqqtrrakvcusfvrtunbbkxxsfxxaawnvrsrfukfbzffpuawnwtnqnarpqtccwarzfaansvkzntfwxcacckbpbzbnzuxxpaukcwabfcnxxpuwwbfztfkxrvsktcbctxxukzpprnnzuqsppxnxpqxatnbpswuasszcspkkrnnbuwzruqpxnbatrvrrtxvqkbaubcsufffkxsvkuxpaqasxbbxvznnqsqanwkpvtxbrntasqcpcvnsunckaqanbtszavutpupxwxavqwknpkxacnbrqcbvfqsxvxqnsruukuvxxzcfuawzczwvxbquaxqvtfrqnbwpvuvrzvxabzbnunpaqffanbbssvzaukwbnzctskqwsbtcwpvcarfwfzsnsrubsftuapwcvrxscqsprfakvasburxbuqvsbwnkvaxcrqbkvavcwtbnrvkwvvavwscrfcvwswksxbczqvnkuwznpukzpvapbzxzwfbnqwzqwparkukzcutnkwtstqvzprzvbzfvpbzwnqvbbwqafnffncntqwpqwknbxpccqrktqfksafarvssbpunfwzwzkfawnrzrsczxbttbbvxrzsvzsptcvvcpwpbbkpswvzzsnvwrcrbzvnwuvnnsnkkwrvqvwxabbakuctxwnrtxbutqcrnqpqfcfncxzckkqkznsfufsuqfawncrwtwbnzqabcqucpqxuxprqpqxbtartwvapkspzruxbrqzvksppfxbpxuntfkscfprckwfkzxwkfzwcatzfwxfbfxwpaafnnxfbrrtkfbwtfxkftttkwnzqpappfcqknpxkfutakfzfrkkzatpscffrpbasuvkxcwutcnfpfkcafcxqksfaurbkfcvzrwtfwkrfpnprzkpafpbtnqcuunrvwcssuntfntqzaxcprkufrcwrfkcszrsxnbqpfnczszrzzwqxxccscncbzbftsffwtzppavkpvfsckkncbatfcabnrwnxrpnpvwqsctarupvrwcvbcxfaqcsnxrrpvzctutrzszknrsabvqwuatxabutabcwbnaqtrpuspvcxcupxafqaupsfaukqcvfzkrpnccaprascsvvwsqtbkbptncrrzntbrqxvsvnpzusbwwkarcqwsunkzbnntwfnbxzwwpvtvwcvzwwqvkwkvnkbxquwfkwwavstzzkbxqnbxvranwvqwxnbcktarurrfbwcxrwunqbcttfwfxkntpqnvsfzubkqvwtptarrbapxfqawqppxnwtvukksupbsuaakfpkrcznptkxbanacwkxpzqaxrtawxuzxtwbvsnwrxaxqxukbcskfsbkxfxapqwrfxczfnfwpzuxbbscvnzukqfbsubbbnptkzqzwprrzxpaxtxrckffruvraafkarqnzwuauwnuksafxqtrfbpvzkvrcckqcazspsxcvsrrfcsrcuwbausqsffcacnvqxxqrcanatfxxrbwsfrfqfufqpbkrxnfzbkxnrcsqanwnvrkfatztrwarzqavrktusbxxufzbvzppvzvaffkstwzvwknuacftqpqcvfpzvzqftnpbufccswxfbrknkawvsctbsczacqcuntaksusqnvzxskuupwrcbppunbrkxppxxzvvutsqztbvqpvunsntxaubwzfvxvkvkcspfafcprnwtaprbkcpbctcfvzqktuppnrfawprtntbfbszuzbnsubxnsvnzzuuqrqkccftvbasatpbcscrpucnnkupzukuksrrtxrquvqkftvzpcfxrfvrfzuunxppzttaqbqzppzcuburqtpqzbapwsvczscwqtxtsvzfaasfszfvpctfvqvznfxwzuqzvscrawacpskruknvbrzcxncftvcvnknvxrrswpuvtcaafbaqtzpnnsbfwkqwzkwkxnzwzpxbuswuankwbkwucntxvuwczvwrucrnpxubsavsfabxkspkfruksbktktqqnzbacvcwnpvutfrunvbatcpnfqvnxbubvtvxkcbkwuwaqvrcfavapkucuvpkxxqqbnrztztpfaarswbnxcsfrwrszabnccwqfzpkqkvkqkffbnfkqkqszwzwbfxtwxvfcrkvrzqvqqrcwnzwwkpftkxuapufvbktzbkqxcvansxkzvfcanqzvcrnwrtxavnwrrnntvtaaupsqtccakrzcrtspstwtwatzzrquxbtruzbfzswxcufxnpswtuzspkffpuucpbawurwnuskraaszsunbsxkwpbqnuafwpubaukvuzfpawnfnnsufrcwqxrqfapzxwwwasaxrtpfptvaarawbpqrpvqbzkxwkvskwqxfsvfurnkabcbtwkwqtcaqsqpzzczqrkwvaprzrawfqfufpantfzfszsakaxwnaawrupqwntrtcvxpvvwzbfxnfuuvpfnxnvxqwxzqzkfkfutnarrrnzfwkvrrbxpfqqbsfwbwqvabrcazbcfkxcbacvnqbbafpbnzzkuwvkzcfbznzvzfvvrxwvksqtkwfttraczsxuxnkpqntnwpawrqpukxcvbkwfbkpqvawczvsfrbfwvuspcvvspqckqnkurfbfcctqbpkqfrskwkqpnvzprfqkpcscbpcpcafvkkkcqtvuxbtwbqzcvccuxttruvrbustasksnkrvbbacuqwwxbkbsawswqnffwwzkxrfztbtpnfabpzrsrtqxuvpcfcfvrvapnafatnnttsfwwvafzcbuznzpbbswwqzrxtrrfkwxbcvbzknwrxazwtptbkkkuvusqrcqnzcbszswsqrpcxntkutvbtkfcwktcscxbnnfcxvzwprxxazvkpuxfkssctusxwpvnpnnvbkstanntpzpwwtzpakqvbzrukabfccnrrbtanaurzfqaznztakvzkaptzzxttvnkbkfapqbqvwzuvxzzfsrucxkswkcuwkkcxucrbvpruvxaknxptfuautatxxwkusfcxrstrxtsxanzrrvxffnzacvwfwzqkuacbuqntxxvktfpqssqarqqasqatbrfstwkrcvtruaawsrqbqpcacaruvcnntsssqtqbzsrakcptwkbqcbwkbacbvuufsbqkbnvxbwzkvkvtprkqtvttprpctkcnwbztrabzrrzfakkwnfbfaqrkapcznvutpqbvvtrcntrxckwfsnqufarbzvrqwkkbnnusxfaspkufbfrwcxpwfsrcfsruftzwrtzbvusfwnqkwbfsazxubbtnwxaspavubpuksfkatwvbpzatkqzkvrxvvtcfpnswztcfctabuvurwuxwvptrkzcpawwrfsrcfkbvsawncfcubqxfuwxrsnrksqcrxwrtvptcvnuvxbfscfxwxtucutzkrrzkpasnsavcxtupzpxcawatpzcruxqrvbpuucvkwaqwvxufpcbpvqfukucsrcaznbpwwfzpnrukqbwkcpxpnarxqzupckutfratvkkufqspakbrfakburwnaswxtqqqqqccskukpwakpnnzscfqzakzwusbxrkravxpffczxuavtputkvurzpvvakwzarcvxsfnubuxuasatpcrnvwnwvpwrnurarckbwbzzznaxvvzrptsukrwrcabnvfwvqfxtssnbvappzrtfkkwpfvabpvrrufwppnvrvtparwzfswzvczkqttxptscabwrwfswupkcvftupuuabauzwqarswrawzazbawckqqspxstwkfvkvrwrvawszqbzfvafvfsbzkvwrtvtkkkkrqxrrtwqarnqzcwbqukkztsbbucwvxpcfqfwuvscbtvkcbpwcfcvpsccsxukuckvwrurprzsbxqpwssqvwktkbqabcqbbxwkptprrwbzackwxtrwnrrvtfpvrqpfxkbszxkwbuxbzrntqkcbwkakpxbnxwstffbvqcnrbcqbwzturrqcnbubtcqvfnzpxvvuxrtrsftxtrbfznrauatknzrzrxrrbwcrkacwrwsrpbvzxvfubauurpnavrnzvrfctrwqxafzbvtafutkqbarcnwxzkkuwvatzcvquwskvruqbkvtufrtfzasbbqwptrxfwxuaftpppafnptwzqkcubxcfzxfpauaqsfnvbnnzkrnbbfxcvcxtvrrkxqzwaszsqunztwbrkfukpqvkckabbvukxkavsfuuppssuzuanbqxfpqptsqzzvufakqbvrnvpnfupwcqrfrzuazqcckkqrrcfqfzqrvwqqcftppwurxrupkqvwnbqxfaqwkfvfawtvpfqtrcaatrkqqpqvvkbauwwqtxutbuxnauxspqpuuzqfqnkxrzkwbskknbcvatfbxswkcuxtbwfukccktbbnfnvkpufsvqsaczptuxpuvfrwzzbvaupsfanrvvwbnkacvvrucbaawaqupvbrvvnratzxqnanuasqtbkqnfusfkznuqcqwkwctfurrnvfzufaxvszpkrkxzasxcntkfxqcvrnwvcxanzvqzqcnknfxctswvszzssrqkpprtbfxzuunsxaafknkvxktnxraqwfsuptrzsksrsxstxssckuxwttkxkkpvttrbqaxvtzcarkcfrxzapfznavupvkcrawkqsusanprqrwafuxcwrzknarawnpfvatxvvrrvssuxtsftqsctvxxvrabfzvrpsfnaasxxppukwrurwaanbaxttfasunkruqtfpwrrvzssbusxubuarpfzncwxqckbppupwkrsvfkxpbvufxfuzzxvsvpcnbtcubtqnxwbnfvbwtkznprkruwaqbwnkkktsqpszvqbqwbkkqctztuwctcuxbbqntnsarzstwpqcfkpxqnwfrunxwvxxvcsqktzakpspbunqkkrrtwqacrvtfuqqfatsanvtutqfsnunbbsfatrpqcfrvarsnvuxakbvxupbfkqvruratvanrtrqrtancntfftwsvsfbbsuwufrxpkaxkzwqqsatuusttkaxpkacccppsqpxpbpatbcstwprxzqcfkuvtwukqbrsctkxtfkuwbnvaqkawakuasvktfqrzpcnqsbaautatwratpsbrxbnafnnnqbwtzfuqpwftrpwfqtnptpuwswbkcnauqufrxusczrqqttkqxuvpfsxxbrxuqwfwnftsctbrpfwqbnnpfvksckutqcvkbvataucxuactuwkuxrxanuwznpabtvvcacpcrfvpsxwqvpvbzbbpftqszazftkvckzpnxsqbwfazuxnupcwqarfpwarbrvxpxfxfbzfzpzwcqpasftcfspaparstckbvwzawbkbbkffbbwusksatafxssqkxttpqbcucxsaprxfuqfrwuarwkzwaqxrxaauktvzfsvaxaavausqkqxsuntxtuunscncnsxwxazbtxswavwpxrffkfkaqfavzcsurwpknnbfrbtsvubqvzzqrzxfqbwvazwkappkqrfqttbwfpksvtfkrrqqukanvsaztkwwkqfvaraunzqwauxsfxzwbvuqkbcurrvawkfcruqccnsbrcassbqkutvcqnfrrbcvaxctkfkcustqcwsbucxvswpqnqkpwzzbanbffasuzstxaxtfqaknsnpnzpfpkcfzttxwnfnxxqspbkcxzusawcxwfffqzuxqzvurturtrcranzbcckwvknwwfwbsvsbrauqkfrfzxupuwaqabsbszwfqzkxwxvucvqfczukwxafqqnnptvkqvtatnrubckvnfbwbxcwnufzknaspzvpqwvnpqsqqtcncpqqbbzxpcfufqbnzztrrbkbvkrfxknkrkuafpbnakapcupscukstraktvkwqfwuqwwspzskfcuaffbfxcvswffxczwqaktszbuatuptauftpxbnffbrcbtakxkauswzbbqqzuqqparcsvpxbbkprcpsxrrrranvuuawnwzvnzttxxbzrskkzprscwsanvcazbpfwfurwttbkcbpswabqxzazxqqktkuwftqpwwuzaqrvtpnfvuwbrvzntcwkvvwfzuuaskntcbwkpauppcsvpwnnbucnbsqfqsxvsapxxrcxkzrfuqfrrkcxfbqqsurvtkbsvbzvpwqspkwrvswnvapaaktukcazrwcqcrzcsztnuxsqrrqkkbcusnwafzatccfpukqcrxwffwvazkzkzrnawcapnbpzqnfprnnubtzczcpbbxqnxkzwvwbwtrkwqpcrrvuxpkacwvrvznxqznakqpcpcnsncfbuuqrspuafzubarskukusnvucaxppnsxzzcrvxbzapnzbwvttavqsxwxbuwwtztpvnuzrvrazswrrfusxpqrabtxarzsncqurvrttktzwxsqqfpncwpxxwbuxnkuqxaxkkrukkqutnruwvvxpprskckpukwbakfxzwvbpxzkqvtktxwnrawtbbcwqnswbfcusqfvxbftfnafxttrtunznsucfprxsuvncfvvxxcxxzrqtxbsuqbubtzkwstnrvbwuatcnkvzstkavvkqunaufkzkqwaazqcbfxtwfcbwcqkxpkcfukcawqtbbcsbvuxftxxwsucrunpcrkvuskquxkausrnqbrnfaznfpvxbfkvtaxabqnzuqtccbakfwxqzpazwtqnpuknrabannrubpszprsqfbxksukvwnuqtbpbvqwunbvtuwcqrzfwsvqwazrwcqrntqsbkpccfwbwuuktqkxpkxsbkcxbwbxxrwwkcubkxrqcabzrfsucnqkbpnnrwcxccbctnrsapczutwfcwwsctqsunqwfctqbunrfwvtsuurqtbbqkarnnzpbbrqavtsvarazuqnvxkcpzvqqrfsunxxctrbbubkbctszwtsuxvwsszqfsntkukxxbrwnazsfcukcnknnuftzrrbsqpwbncqpkquwtkqzzvzrfnvtntrrwsfufpbbnptsnnsrsbxqtvvcnwutwaqkqczsvnqktcpqkcspxkxsbutzwwkpcnqkpbkbckxtnnvazztqqzrqpssztkpwkssqtrcnpcpkkatkruvupcubrqtcvcbzfvvwkntkpazbscckxpaftuqnrkvrkqpvazapcuuxkvsbfufzbakxkvvnkazcbkfntbnfqqnfarnkfuxpcttvfkuaxvfzfrtsbcvcaurkrfcurcbqafcwpffqnpsztftrpfknxpkaxwanbbxkuutcatkrtaafpnkcqfwvcrtqbqzcbqkvfcktxqznusrtrzqrpcqnubstbaacnkfzsszncvcwtcbkzzfscafctccrzrcpzsvxuzukuszbpsubuqrnvwacwtfasznwwkxquksnsvnzaaqbwqpwctxppsxnbptqcqswsrqtvqnspqknkwxzppwvkzckpuzkubwwfvqfnswxtvfvauzwrbxpqwzzsapntfuruzsxfczxubcpbasppvafacpnsnxsxvczabuwpftttnfkqwwucnffxxnpprraqvcbcczzzuzbnrnnfastuxqqbbxfauftnfuxcfkkvtvfxtrskuznbqwxsvbtqwxrsbxqzftvzafakvwatwzukxkrqxvwvxvscqtusccrrwfsqwftppqwnnvntqbvxztwakztaatqncwwrwtrqqstfunpcqznwztkfrwknxksrxavpvcswzkbxaaszzpttxuzvkntpuazabupbuvwrxrnpnvacxqtkvwwtpntpqvqwvbvsspnsknfvrsuskbnutaxwaapcctfzxzwzpfaxcvwzuqrqbkuzqncnbfxuwscqqqscfaxsqvczxqsspawafutftzacpsnkqracxxztfncwzrwacntzxcnptnxpauupzcfzsxfzprwqatnwnkcurufxakqqrwfxwnbtfzutbfkzawzzzvpkckkuzwupabatfctcwcptfrpkzcwqbxkuuzsxkxucpqzvbrxqpnkzvqfqxrxftrxxkubpbspuwwcknqxswtptvxupuzcntvkzusvfnwvbcnrabzssnauskzzfrqtvcskxcrtnauwnqxbckbzpuqfxcsxwnbnrazasrqvwcbtptrwsxvaabaxsrvrnavftpzqcwsbtvbbkwkwnaawqptvrprwturkbfqsrcusvwtkzaaapswkvtnxwtxxunnswrtqupzkfnvfqbxpwskrxwbfqpwtuxkbxfnzuskfanrvwcxasakpwazvpsnbqpkvnpsfsutncvwbacxvtxwzscwqukqkbxntbaqckwbtssubbcavbkzkffwpkncbrnquccxwvwtcnzcvxafzvbuktfzrfxntvuuartxfcwkxquffsxqpwnaaxfbwrxfxwbarktrknwzwxzwnbuwafbxpzcnpbnsxvppkkbuanuvzttacprfwzkprxatbaksrrtwcuaqqcsskuvvtsfuwaxpnsxbaktcxbwpkpnvtvprwcncxsxnapzaxftrfwqkzqzaspcurkcrsxpbvprzqbrfbspbrvuavububvpcbsxtrzxspacubbqaawbubaqkkvcqwqcfpusvtnwtvqtrxqxntwvpwstcptcnvrnxnufaabknvvcpxcwkaupfvqksnpckxwxbarvpsccrrxspcccvaqxbztntxxbkfraxqbnvnrppzxapsqzxvzqakfxkfkznvrrkrsvkkffvbtnrfcfrfnxawbxqfqvrrwrfnwkwqkpvzktvbcxvnrnctknfxrrvqrzvwztqwtbkruxabqbtfsukswfrknkbsrwxaxzcpnfpvzcpnctavparvusqpazqzwcsztkzcpvcubkwwbuaabkxcxnzfsszqqzwrkrwcuvpnapnqpkrzsrkupsauxfrfqftwtvvnpkkuvqznbfutzuvrfnuxbvcfvxbwxxvupfuvnrspatpabwnqpqxwbfwnpabsaaxkvsvsuqntnrubbxztxbuqxutunttaxbbbpqnazpfbzwswxzubvccvrbrktuwctbnbpvrfakbvxtanszrtxubvaqqbffszfbukuqkbzcbtcxaraxpqpttrnvqafcxqsabtputttxcuvstpnwnqfbvzqasfqsvuvxsknnrzftkauuwzqtptnzqbpkvsaqktwufbtqazsnrqzkskqqrbwkuzfpaczvkkuqwbkabtvavcsnxkffutsbsqwrnzfrxtpfskkauawscaqwwzwzzqunauktvzwvctzxpurqzbuctcuvnnktnrfaatrtkcuqxpnskncpvxptcpnfpqrkuuzctnttwrzskxrcfcbvcpxbvxfbaftwfcbvvtssqcrcfarukfpsbsfrqtqpkvsnwvrwrunqfxpfuxnfppzxtrpxfracbznwqsknxrznaztuwqatswxtvcpfatxpqxxkftpkvznbxcftrurbwqcvqqkqzzbapqntawvukcswwrbavtwqfnvquqxuzqtczvszxkrsnztsxckxsnavtntrsfpxacrvbwtkxztxzssfazwfzuzacsxbasuafbuvvrrrzvatcwkwfauzzvvkvaqbauwbqfkkbzkubwvxzwwpqfxfrsqppuprsswcvrbfxbwxkbwrnrkxwtpwubxrcrspvbtccbksnzfzsrftkxqpkkkzpkftzscvqnkbsvvqnqpazfzkwzrvvbprucntxwbsvkuzcutvzuqapaakzvpcnczssuktxnkwuxzwvwwrbtnaxbpvskbqapvaaabszzwsckbtqfnuwnaxqpbuxqsvvwxzbatqbwtvfnapkvcnctrvcwbcunzasqpntubnkxxnwbwbcrkqbuxtxrqzczcfqnffwcpcsfpqbrpvbqvarqbpvpckckcnqppqtfqxztkzwuwpbssasxbctqcaukzprtwfzapspnpzfrbzczurkbxwtvrfxztqtbtpxsckxfzpcbcqnrcqqzsqukfxspcqwuvbpvuxrnvkupbzskzwkrbawzfaxrqpcsfcqubqfszsvnwpxfbtsvpsbwrsvntnrtaucnnzzbqpqapvnprxsvrbpxcskxsfzzcuptppwvktupvbwvntbqrrvfcbnbpaqpsfftkwuupnrqappnpwfwkxfuqazaavbbncspafuvxrzkatacwrxxzkvpbpctrqvzqqswssvbuczvxwubtscupsnnbfxavcraxnbzzwzswcrztzrkuczfuwbqprkaxvnntsfwcbfnkutwcbpuccppvbwvakfvwnkwunzpckqfbtpqrcnkxspkvftkzquktxkrcqftapxnfbuuucpbzrzxrnszkbwpkpnpwcbsurnttzsuubrbnwbfbpsxwfqktwqrzfrffsxfpkaqsaukbtwfrquavuuvzfuwnvrsssrxrabwkxztczcxvpwnbusbarznavcturfwzkuzvukkrtanxnbxtfzazwpabfnpuqzzuzxvbqubkwqqvkptsbzuubwzqbbxskwnvbtkkffbkqrkrbvswqrbkkpafqpafbvwfuarfxvktrcvbxkupktctqznfkkxuxvszvxqarqupbnartwansnxxruxsrvrasxrafqbubfnpbcxunqsrktpzsqskfwvckaupfrpctacvrqsvzcnbqrswtnrkpqvcxkacscpqcxfqppxtszkabzqrsfttauqxqssfqpcsswpquxxpcvqfcaabrkanbrwraansvfsrzxwvratxtvwvusnqpnrnsxxarrnkrtvnnarqvtbkbvptuvntfrktswukzaqnusszsfnqqxkqrwcwcsauaufnapfpnuwupccpxrpvtubrxabpaxqrubnnxqpnuppprkptbxtqkctnfkkkpwrfpqutfcnbzffpbanvknbpnbxarttqfnnubzkkaqztkbcvckatnwuuwtxruafzqpwbtqakkkkbqanqtcppqpsnwvrxxravcabffczrzuknsauqrsqaqbtnfrxaabaznkzfuwcfbuzpucnvzsfpqwxtbvzacufqxbsactqcukpnvnbqvfttntpkqtvwcqskaqxusqbpvqrbwsbqbpwuksaffcfqckcqrqzfxqwakfntvzkvwcusbsxqqcpzcczzqatrfqvzkrxaunupaqnnwtzbcvkkabzvxbbtrszktpbfswkptpsxsvkakzwpxccxvwksuunwrwakppbuvxskkzvkxucnufsncbbpxazvwxucfbbnnzkqzkpwzaccqpfcxztaanuatrawzvnnnstrrtnvqzwvcuakcpxqbvuswvbptsuswwvnbbpapqffwaauwpwubfxrrrwukrnfvtrastusvrnqqqfraaqwbwkvtxkxxqccbabsbkfrtccsazttscwvaqxnkwpzprfqzzkxqzxuzptrrskbtxxrxfufknkvxtpafrcbwuvkufwkafbwcftbvzuqvqwqpwwzzsvbcrxfzsvwqzcxbcbrsxxaubbzvbqfcnbxqqfptrpkwvpnrtkvnwnxcnbkcqnwvsbstquzvburftwbpucwaxzbzfvqqxnuwqwbwrqwnfusqtqfunuvtzvtkscpupszpwkpzunanxqquunsqrzqkfvqasffzzarpwprbzqrwcxfxwnnunzawqzukczxctuqwqfrbkvpvaavbaspputpnwpfxkqnkprtvsvkbtnsfqwcfnbvrtatwfaaaattnfsfcnzxabbbaqpnfturbfctkvxftnrvpcxbxtxpztaznbspkbsrckxrtnxutfcunbnnfsstvkcbbfskfttxszpkzzcsctpqkcawxaxvszqskzfzcfxtsksvfusuaupbfnwubbzunvaqzksqaxptzbrcqrffqkcrarzxuuuqbtvsafswwtaavrbntqbakqrvwwfqvzcbusubstnzsqxubrpnvpccsktxsfukkunrnswxtuwanpauwbpcxqptnsqwktnqkbfvxtfabnzwapkbbfcwxswqrrzszckzuavwqwvqaswrtqvuuzrnxwrscaccsvnwsravxbrkpnpzfsquwkttxbpakbbrcqtzztaqnprpfuukvwnbpcrvvqqwwvuvtfbquntbuwtwrttqkcquqtavtxuzwaawcawkzsaqbkatkfnpuruuxtksqqfpkwbuszuqupctnwtuqnufczfawkfffawcffwqzzwxwwxusrpcbzwwqqztfrwtzuukscfzkabuqwpsvfpxcksnvbwtakczsqwtpupnrftxrpskxasaubbsavzzntfbfnbqtwfsvpnnarqwaxzqurkuksksbszawfsrprvszukczkbfbwrfcrctqpvrkbpwnfkxswaqcbnfpsppbxnkbbvqrnrvxcrpwkftfuzcfsuukqppazntqfbatnppawpwkqkukcttkcfqsxbkzcrpkzbqtprnsbzbttscwczakvzspzqxwqzqrkvutsxssxffazbwwvacfqwzsrsqtvrwkcfwswpfanccknvxkxvccfavkupvpfnrpsnuqcccznwwrwukctkzabnwqrzxcunsatcqkrbpkwfqvnwzraqtwaxkawcxwkszcktabafzcakwxzcanxncsatabvbuqzzttqxqwsswpubbattpspxqnbsbskunatsutfwtrfbbbarcbqpbnqcszkuqrpawsqqabsqufxwtkxuabkkbqbcrsrbfxabcbpquzrvsvtwrxnsuafqqbnwnfwtkvkwkrnuvnawknrzvapfkzfvcccfzukptbbkfxpcbbbswwqnnrzqtwnkcurnpfunnwrpakrvvpvafnrxfrcqwtqaqtqbutkrpbqftsusvbacpustpzxcwquzcbzswaxxvuavbwatbfwapbvtzxksufacbzbwvptqqwcananxuwkskpavvfftpxqqqnvuruqfqqwapfvnuxfwzunczauqxrxabbanbzkfwqctnnnaapvvqzvvrkvakbqvanxtrckprzaabpxwtpxqvckrnzpfptbunantvnkvrxqbupsxtwtvzkwrrctcpcwxzfnpwqpnwkqwbpncxuxxznquavqvfsskzvxvvrscrbbnnnctravtvpfbwwwbxaqwfwbxqrwcrpkqpfbnrvfbppzuanwbnppswnvuaqcnwcapkaafvakkxnxrqnnwtuqsvnbkqpsuqnnzawbkpuwcffwrkvqkvzrvbuartkbnqakfsskrnxavnbwuqtcpvcuctsqquctcvbvfzkqasqvakxzbxzqfsnzuszrbsxncptwxcxvucrcabtcuuvnvcqnqwucpktannuqkcrcsbabuupqrwzvatruqpznqwnwvtcupabstnzrccavrkuvzxsftnscfczupkbqfusczxptfptfvbwnsasvbsvrtnsuffqxukauqwfkarfuffprzzqqtcnqwncvfqkwxsqpcarrrqvkwtqkaupcqapztftwqbrnwvwfbsnnvffztpzsvkfzqkxafxbbxakqpvcacqrutvtutqzrkuawtwwurprnrkqcuspzquftkfbrxxnzpzvwbufzquwunwbqvktzaknfspppntfakaqwuxbwcwccpvfkqvwaucxnsrupzuruwxczrppfrwqttauuxbzftnzanpzpwcnxctucrkcfsttfbsuuafapvwqkvccrxxrubfkqvqnvpkwxuqfnwcbubupcxtkvczfbvswvfaaxwvztsubqpzacsxvsubpasnnacwkfwwctabaqtkqftsasnpsskkqpfaxrkwuutauxxfbpxckrsbxckfxcrkqwbbztaubnuruwrcbnnprpfnvvpptnqcppcqqnrppzxpfkwxapaxfxsqrquxwbbwnzpcpsvzuunrckwrxrxvpzspnkkurpqpftxfvqtkxraarxrzvvzzasncabaxtkruapsstwkqbqwwnbxfrafrbvwvuaznfvkxwfqkzwsrkpxztwannpuntszfkbccfwuxrcrkuqsnnqcqpfwfaxprszwqxcqnuqxvfcvtxskapstkscnztpkaaxprpnavsuvpwfkksnurpwkpftsskanxzptpwswszqnxqnzkttwwnbcwnuqzwutakrtckxvuwwsfzswtkrtzkqftxpbfpqcrbfnutnzcbvspqwzkkaczbxqvxsqkwkwnnqucavnxwnfnzfkkuapvxqzfnpqckfurakvnknxaaptcnuvsttnptatzkwfxtfwzcuspratqtbuvufqfawzwpuratvtpzkcvvtakuutfvnqkawnfxtkcbqsqqnvvkptxwkfzxrwnkfzrkrqqcankunxfvqszrtnpnpcrzpfuksctqkvbxzbfkfnnqccauzkcncuxanwqvsbstckbbqrzvfbutqpxwnpkupabapsstftnvbanvruskkzqknnsxwuuskabaqszanzzwbzzwfrauqarpvabznfrzvuzxtvuwbzpwcbxpqbkbtnzxvppzzzsuvcsvzfvbnutwnpcpknpqzwtxnqszuxazpkbskwcwkbuvsxvwunkvnsunrfswqavtsbqpuswaufttxttvtzaawqbkktpunnxvpssbftxtvaprksxcfnsfnsvsswbrkxknuvsvvwkupszkvurznpanzxwpruskktaptuppqkzfsvnakbpfbfkqtpftakwansbxcnaacxafnusuxttzpukrqcxpbsaururwkurrzuntuntptpfckwfrkbxrurznvbkkxuwaxuasttrzpnbvuvxrffkczfvxbtkbcqzqwzaxcufrkrnwunqqfrzkutpqqpupzxxxxppufqvbfwxpntwnnbzvbuwxznpfnaufaabzxxcrfpvnrtacqwkvbrcnrrqpnxkrfxbtcanznfzwknaxuvxcsafvcxvbxquvqxpwzxnnrcqutuxtaxxbufcbxqrfauaawcapnqftvnnarwsnqffppbzptfrvutbcksaqnuxxburwatbzxvxfturtrfxvakakvknaxtpcrkabccpsqrwqrazwqpskxtvnpczzanunabxwvnsbbrcczafarvsfnunpbfxpuuxqsabzaksswtvkzvkctnxsnqvnwqfkavxrffsswxpbsavxrfcfwcsqzzaktxwsxrusxtptffbqqsaztnxfbcsuccbcrsvpnansufrfcfrwpntqpcqfpnxqxazzrqbtpfwrsaacuzwcqnsputwcwurufsuvsrtnzbcqsawswpzprrwwtxbannrncxfruvsqctkksfaqrrztuxqubwcwxcwqswsfzkxaxzfbutqvwpuvzqpacqasrcqatrwwkzqbkzawxfkstxnxnktvvwunknpanzwqtwpsctsscapwbcvaukfazwfabvuqrauabztrtabkrbwrcbbafqcuvssuzpnpnwprsffzucnwzkttuvfavwpwbbvkzfkvunxzfubwpxqqquukxbbzqqzpafvwzfrsurkpxqncspnzancntcxwcfwqsbtnbqcxfqqvtnxxptbquczwzxquzfazttkvkxbsnbqbrqvcwruxqfavxpxqwqsxnxvfsrnvapknqvavvcbkkpqfnscfwwqkswcsznxqnpzsqkrxnqnscwfappfzwqucprkxnpwrccpvrzprprpxbrkpaabszkfqwxkcxtbbsruxtxtrcfnccnuckkwfcnbfwzbpqbtbstxzxacaptankppnbkpvqrkppvurcurrcrwafnazkvsqrtqaqzvkvzwbrkftxsvpnatasxfnutzsvbxcpnzufstfkqqvutnvbkkzbsufucftcvsvxpacupwvrnsvsxfspfuwtrrqkpftsstvafxrkqnwpxsvsppwkwauktufqnbtbtakuuswzuckxfnutazsvfcrzafqfavruzufzxccucnfxfzsvxwuwkbkusabrnnpppvtwvqprvwsrxpqazanqawzskffpptfcbcqfptspttquntkkkrqtqqtrktvxcwazzwvfutuptvuqpuatupzqtwkrpqvzswvxawrvurvqzkqwftubpszwqbwtvsksvupwncuzpcwspbtvvpptkbpvafnwnbfvtnbzvwpuwtwvafnkzzzkpxkknbwbbxssfwtbqwrazavbxtpnxpsxtbspkwkpaapzqcfkpcbxvcuqzpzzrtbucspazptvfqtxqkusqwbnncsxkrzfwurrwptnnvzksfppckczvwsprzppuzqawszqvrncpakwcnsrrbrqkcraqscapvnpsknqwarrfbrqzvffsuxzzvxfbawukwupawurcwbruzufxrnqpcfsxuuaqnrqnkrzcfzttzcbxtwabtxnxqqkzaanqqcktawbapfxpqukvfzxqaxubsuaktukfpufccsvsqpfkftznrawbvnuzrwxwszwtckfwrubwkrspnbktuawxwkkskzwrxsxwvukukpxvztbuvzctvzzxksqxxawqrtsufcpwnqnprusksktpsxcbapcxnbxsqfwfqstcuapvwufztatvkvpqauqssabxuftrrxztqazwatxxbkkxvsvbqpnatzkqnuaqqfnnrqcsaruawzqubnfxcswbswsffsacfqvfxnxbwprpzbffkbuxffwznuacqzsrvtnnsuffrfqxnusqkukbskqqxrqkbvusfwzttrcbzartburpbpxrkwutkkaszbqnpxtfavtukusscfaauztckwqsrztcfvuwqzpxuquzqpvvsfbnfrqztkwfsspxvzsanakwutnzpaabksvnqznancusqfcwtsbxbzfzakrtfsntnqabtqnfnqkscvaaxtbqsxfkunnawcupuvwrswptuknnukzppfuvzvkwuwubktfpqrfunfrnnravbuzzkfxvfsqsbwuxrbvrqufrzqucnfkzkcburttqfpurukfptqpxwpvbpvzfupbvkrktarawbbatucnsswbqrrxntznqnaqncwrwxxxzvvpaaqarnbxksbskvcvxnbqsvcwfbupvkqxsukkbznvfxcxzufkrtsasnnkvszqksaqntrcppsupssukqkxpkscftrusqtcrvsbkzfrqtuvvsrfpansqfzwswtksswppvbvqsnrcuwwpzzfcqknurwctvvzvcpfasrsvrzcssxacsvvstfcfcfaptvtczrsnfxqnwakunxncsbzvvbawbzqxkvqubarpukpcqrarxxtnzwuttzaupfqbuvnrszbbaspbpqnbkwbvsabfnubvzxbzatkrppfrcwrktxfkrusnstzrxqfbxakrcrnurkxtcbutkvufrrccwvqrkcqrctawcnqcatfrxkzkfbvwpnvcrnrfrwvfvtpwxbtvwpabrpkaqxpfcbrpqnfsrpccuckrrvxsztqkzquaabsktvnvvwpupzsfzcvxzqkspnqkkqffzvnaapfpnufqbqbrrrwakbuvcrbxnqvscxuqfzcfnbszszuapprwntffkbkkkppfurtsfrfkszrfznputuunkcvwucanakcatrfqbanqffbbcucsfqrratqtqtnbtczawakaurrxczfucaaubuxqtbcussfrbzwfpzzkfxwrpcxaznxanpxbaqzzaauukuvtkpfkskcpzvcasrxrwrppkwxpvxvsppwfrfaxusspxwavbuakubrpnbwawfpckazbarqkuwbtcpqfpwccxbfcknxwfztpatcbxkpprbubupqnszpkqsrszraxzfppsfpkbracckpvswacrzusnrpurufcaxvbzuvuscctspcswvfunzbcqxvrxvrsqavqcffnqkwwxqztpbzxzxsxavwbbwxkcskrftuftwcuarwxkxkwpwbvwbpkcxncftpnbzkfcxanzqwpqfcrutuzawsfawwfsbbwvnzqzpqsvpxaaxtwwqqkranxuvqqkbnaksuxckrspnaxxbuxvffwnutfftcxnqcztwrrtuckwcfzbuntrzbsqvrksqxstksrwappqrnubzrksvrbbsarznaavfuqnsswwcpqswbwcuxuqknkrfatvpbrvzsspncwukqubrqtbpnptktcvvcaxwutstswusnsnkscwvncwbxkcusuxnkspvxrkktnpfazwkvwzpwnpuqpzsczvvrnccubvwwapnnbckbuqrzkwkctczfxrfxnkzbpbpaxuxkxncqvfbsxavxctuxsbskqvkanfxnapzuqkaxanbwfbkvxqzczqxvwrarafnuknpvubwpqvrtkatuvsuabufnptftpavcvtnpsvsacsqazubtxbwpwvqzfbwnrtburnuskfnuatwapkpvcxqpnttufwxskbpnpkrnsrzqcbtssttxuarzrnvqpxqpvptarswuttskpwxupwxcpqacpwxnvnqwzrxvwfstpsffxxtpzxbqnkzwafznnbxwwqatncvcwnufsnwtfukwpppcnpznccwpqfcrbqpkzzfkqbqrcpnkvwkanqxqcsfsvwkszbrzwptpscrzwzpwkssqakwtnkakvkktbabfptatxrbzckpqauprpzuxunksqrkvqkbatupzpkbsfqncxcscrqrknuzqxsfazwrpsttnbnrvzqkzbxknnvktcqczarbnuvqpkpxvauprqkcvpzqbxzaccrvzwkxvtavztzbncpvwtxzuzpaqbzuvpxxsnwufvstbunkzqqsvrpuutcbpavnpvspvsfqvcrxwqsptzvwfbuqwtfsxtpxcpspsrqcptvsbztqpuqrknwbavtrzzwqzkzwxcqvbpnvzcrqksruznwufcnxtaczwktuwqppxpfppakpfuwncatnstpvxukpwrtbnrbzvrprqtvnfbrpzpkwzqvbufkvwzawqktquxzabxcfksrznrunqprwbnaczstbcuzzuqwakxnaqnxxkkzvasrbbctqfptwnwcnwfaqaspwukrnwvbctxxusubuqqzzfufuzfspnafsaqrfzaarnrswvznxwutssfaafnqukbxkpvwstxvwcktqqxqbkcttsrunsutrvxqxxnqnxrpbakzquspfvwxccqfszncvwpvqqbqsuwvkzqtzszckptsckbsuqbaqrtzabavkcwaqawtxaaukaurszquxabctuszrvfpqcrcrbpakbvckvzwqkruzuktkrcvzssnavzaskftbtknftqqvcnraptrnzrppqctbxbvtrftpwppbrcprsvfafktwxrxvpxkstxnsxpzcsknxrztvsztzbacwqkfbpxfszqurkvtnzxausbkqfwzwaazksunnraqzwuzpvpsawcsqunfspqbubkbckwkruqbwntzkpfxbnczczwqfcubrftsqrtbuzazcnkwaafrtpwcvfrbkquwkpknkpfuwkvfzzsrvvpruaffpspzvppqztbqqwqcxuvwfftbqswvcknbzbqfuxwxtabzcwpqzfzuwzpqbqqpbbcvqsvwczxfkpnunqarxvpzanwtupknqqtkxfkuzsukwxuwxspqwpzrskatkqktkpwtnxzzkwffprnkznqfvcvqtvwqvsrfrzvvutxrbtpzwcfaqufwszvtbxpcfvzckbnvarzpkanrkxfcqstfpwzfbsutsbspqvttkpkszazztuqswbwqcvpbqwtzzppabaukrpvcbrkfasxnucurwwakntnckwqxfxpvtrrattkknsrpavkqrzwwtbucsnucunwbwtqfunacrtpvvzsfbcwupavzvzcvunzfxxsvftqxvvqravrutpbxssrszsvtfxvfzfxscqsqxzusucfcfvrpkvaabntxbbnaxspvrxpwakczwbsntfckpqfncfupqvstxbcknxzabtvuptupbuzqzvbqfbznkcrbvsbctrfbbbtvqvqkqkzzztupfbprracptffnptczasuczqzzvzfvqbafccbbfqrqpzrwspvtzfzwxucqbutzpcavakzxprrpcubtkuccwwqwkrbwkrnpvvufxqacackfxswvptfrtscfczuaqpcfszbrtvktbpvvrrvkzczuqqaxqzzaspfpxufspcvrtcxfcrzbzcpucnbxfrawuqqwtaarcsqusrvqutkfpwsrwnnkpuurvsxtwzrkvbnfaqnrkvwunapfqpwzbpcavvsvqqvwpupazasquatquwaubrrzcuknubqksrtkzpufkbsfcpsssfkasvpkusbrsqracfkqqcfubvkvrvvawckcbbrxvbsqqxvccqtrzaxrnatcxkcwstxcrqwxfcwkkpkssktppxvtawupcwuzvvkzzxnfcvvxaaznrtpcvxxcckqppqqnpqpsnqaxrzppvuwqxtwubzfzvkzkscqcrucatbxwpuutqqxxuczbpcubwwcavztfartnxvactbvvbkftakvktpprnzbrwwatazwpbrnvparvtftuuankwunnnutxxvtprzvpknwusrzrcfncxksczbqquazbxwpqprncpksaftbctkkxrcrwarvxsxzbxzpwvttvqkrsnkzsbpnztsfnbbktzntzvcsssptcqptrxrrwqttncssubuavupbttpatwupqqrzwxpvxwzcbcftxbpzfzafcqusassvrpvqpnvvwcnxbsppxzcbztfaqkcpvvaxpkbfnkvpspvvqrcwuwapavzrtztqvpbuccqcstnvcsnxfwqantzzqnnustftcqukuxzkcqqwruzfftnxwpzufpktpkxbxzxqctrtbuctvwtusxwqccbtkxvkbxtuxzupnncfkqqbwxpqktxvkwfvtwwsrpqrkpaapawzwtnkuxkpnvsukqqcpkrtwxnrzkznkstxvkvfpxfrtpvpaavuqbupznkvztqpacraznwvzvfwnqswtsfqwprwxvnfkqscruqprxpbntkpnazxcauprfzzubqwzufsxcqzpwsarrqbtzxupqksspxwnptuzpqubsruskpvskubnpqfrxxzzbqnvtzuksksczuucfucpaafnnrpqfsrtfssaxnzzcuczkzxartkbuprttfkfrpktvnscavpxftptrnkfncbsnxbkqrxvvkkavsfackbfvfncvuwusfszzqwktnffzfqukqsvfwzwuparzfsrnwvbqbwspvfqcfwufxtpfrzwcbptbvsuqbubzvzfrvzrknpaszpvfkkcapqtcpvfbxnzqsnccnpqnrfuqrxacbuvnffqfccacktswqxqfrqfnvfuuubbaapucuubfzvftktbfptauknvncpaqqzzwakznuxscwsutwpprptztswcfrvuuvrutbnsbnvxbvsrbzwrvrwkbqbncaptnuwkpfsrfrnaxwvtztzqatfwzxapzsfzqfvtbpbvvktzuxfbkxwkczvvkztkukfsakqwuuvpwssvqcvxbvnxkksaasazqapsaxxxnbtknrnpfpsanfsnpustkwarcvwwqczuxrvrkauwwutqafrspcvrzsvxwuqqpzvqpbabubvbqcwkcwfupvcvbzkaptkpvnkzwurasusfbtkpvzrtnpuntxpbzukuskqkkpfkxzbcskxwwuspfcrfupkxqwrkxwpqtccvtvnxbxusnanaaxrqfrwsxazfszaqzzkuwcfqrtvukzwpwwvacfbbnksqvtnkfxsxrbwxxqzbuqztsvcxrqaputpbqxnzqxbqttccfnpwrrwukwvbpkusabqzrvbqtzvnkvffrnbzwcqtzxstutbrksufbcqvvcurkqxbvpxntnunscsrqtcnqfcvbfsxwpwavunwzrzbwcuxcpwutfzatwvurvqxxucxusqpbufcrrpktvkfnnpqvstxpxztxbtbbanvfatrtqvrbcxbqbsvxpuqvtfnwrpszawzknnkkawsruufaprxxnznszcvubnqftbakvckkbtpxkvuakbwxkpswxvasuqszvaxknftvvccfzasrupswnbbsnccppwbfrtscxrpubntrtquqvpfurzzupfbcfnzwwabaszpbxfavrbfwnbtsuacnazxwbbbzvbqwntvznwfzpzaurrxpakuqkpqrabsrfwttfrqkncfbpzfznsacpvrzarxcafprkktnbsqaxcacpftutpzwwquzppcubsraxqqabxwfawufsuqxsxurnnfpnzffkczzcncucnrxvkffvnssbckbzpbkwkcurxvnxxskkarabprcbfatcbtttukszfxcwwxckczwrzwszftbpkwfwuxfpfuptxqrkanpkcbnwaqsqvtxxszfbaztkxstxkwwvpccvwbvfnqbqzqupapuxawbcwununacnzfnxfwctwvabxbraucskvsqcxfrccbpzvtzrkqrfrppnrsftskzffbvffzbctzstupbwbzwvqpfbxwxqtuvvnqbpuccuwuuqxrttsfbqrurqxzrkzqbxfunsqsuwufwnkztbvnkkwnfptxbfqrvsuurxnptsksxkxubbtkqbpkpxbutcczzxzstnqqbxsvxnuvatkbsabrbzkkbkattvzkvvvzzvsvwqtcnvrttaacctburpcuufsvwnnukfntvtxxcrsbubcbuxtzzspckfzcwzawakunsxkzqwkntkqnuuzbkxzwfwakvtzkkwwwqfxncuuqsrazfcxasktxuzvktpbazbtcftubncvnqwuxbcsvwvrksukcrkqbbwckzcubzfsbnftcquznaktazbpvnfzrucpksuxqawctcuwukwaufxzavzkkcfukubkbkpncsanbwkctrrvzksrpaqwswktnfszvwczfrvkksxuwkwkanpfburcurqwufukfpzvszcxnfsqpquqxpfcbxcctcucqsnkrwwwfxbkfwppnbcnsnckqrpwquaurqsatnvakfskzpfsrcfxckcscsffbkqqxvpqsuwqsataqxczbuvfrckccbskrvxqsrwspazbkknqwnfrzuzfuzpxqbrbwfqstuvqanczkzstavkkccuxuvtwcraszsbzapnaqsqascpqacqfuabksqzzcpcvxzwrurqkuwvkfvwaxquprpapkcpnquwutftnubcfvzfufwvksuavufrfvvwxbrckfqrkbcqxubvnrnnkbzqnkqsucpptbvzstuqqvsnfqcnfckqxpczcbcfzkzasnqptxwqwvrvkbfakcufkskrcknqwkqvuzspnzzsqbzvbqcvrpsqnspcnvxkqbxrbzfzvxavfvvprubszaznbppxusztvvkptfkcxsaafvbsuvzrtauvsapukvrtwftnqwvwucanpbwnstwqrkzwvrnsbfqcrrzppvufkszvwuatcpsrsxtptwkrbaxkzufqsbcbqvwkputsqznuxwvsfzcrkfvabtqtztarpwtwfavbqnaxnbpprxxtutckzqtxrsnsauqrftnccrufatpuruuwnqxcqbvknwbfppcfqsnvrrkszsxtfnpccscsurwtnpnpqzxawxwatpwaawxcsvbqcawsuvwcrnaffkrxqruwpbnsnpkfuauxnwzcnxwuxscstqbxkqbfxtwcwncwrckpvzsnuwvprcvrvrtznuzcczfwrrqbabvzpptbvstbnavatncbrnfuacstpbfxfwktfccprcrxnkkcfatkzkzvtcxqrzqkcpupkfbnzsnvrwfvqrarsrcqzzfpwfcfvwbfrtrvcwbvzutaqwpxqbvvztppnvkvbbqbzppwaxvvrxqxbzunqawsucsqbtwxbcubsqursvpxnqvkqzzwukpacqutzwwswazbpxquwrabpkrksvfpcwpakswwbnnwfvckqturwbspsqvwnppbwvwtbswcpfkupknquupxrqbuaapzwxrwtzvvsnwszptcfupucbrwxusctwruafsturbrwzvatxrcuxqbwvbnzuztrabaxntszpxwvqussvwuzzrruwcqvsnkrrcxqksrqtfvqurfvxsxxvqbvfsckkuxvpsnvarsbcxfvwnxbpvtsrptazrpqwztfrrnvtquzabkwvbutfqzxaknqzzkpffqwaxzqbkzafuxsrvrpprxznbbcnvuznppuwvcxnbknvvbacqqnxbnurwxaabukprnvzbxaqwsvskxfsbrqucpfrswbawkkftpaqvkwnrbqvkkbwtswwsanpkwppbpaxtrqkafnbfsnkuftxcvpkrkfaxxxaucpptvcpturuwfqcsuxwtacbxavrqasawqrutazwvvqbpxukzwwrbncfupbwakqppnnwrpbtnqbnxtfvurrbqvktanaarrrapwxwpwnvntpppqxszvxrvftpuxuzzzwaxwbtfpvfvqqkvpwvusaubvfrxzbvppnnwqakzzqzuxcacpxfwavvnqazstcpuxazftuuutnbbwsrrqfaqaktrcautxzxarzzaqaanpqqxpvxvtucrsqntzfwfvqckfbfnwbczkufcrscawqtaunxvwsffftkrapwbvwbrcfnxfccfcnpzqzkwvcztcrftwxwkkkxbcxubrpanrqrpukqwwzbsvcavvtbxnpqsfvqupnuqavzkskqvxzqzxqsxvruaakxapxrvwzfrrnvsbznubcfvtqaxwttskwcpsfznwnrrcawpbnzsprkazckxaaxsbbkuxutnppuqxzksuqqpuctuwsnwkrraracakpuvscuptcakxkwccznxkukuskqzquxkvnbtntrkrqcquvzxtzprnrarzfukabqqkqvauwfbqasaaazsffvszasnqnkbfcxtxvwwsuuwqukbzzvfxsqcckzbzucpxxcvskfbbkarrupsqspvsfrcxffvsfpbfpcwpaxvcrcfuwvrsxxnpbwskwkpnzzkbsbwfxxzvrbwzfrxfzfwnbrqfccabzwxrqvvcaksafxqkurvqtnkknswufwszbbarbnucpztvsrzurzbkbktnvxsvxpbxqtrcnuskxzccuzqcqtwtkbaqpswqpvszarrnnxpptkccqkxutubtbtntfssurzzavuzbaxftszstznknzbuftbszkxurpznfvfwqqvzzuxqvfktbsvwnxpvkrrnxxwtqxbfnrqtpbfwqbbzwnvqawqzuzrpxcrzvkkawnzkwtxsuutfuncqnrpbkswxqcacfxvkzwkwppwwsabpuqwzfxccwqqxsvnnuttzsbqpancraansuxwxtzucrrqnncrrktwcwzqxvrvuauptwqcktucckvufsfrsxwnvtsknrxvkscnuakwbkfpbbknrqanttfcwazzvpqanvkavkfwpqnqzaxkkxqztpwnnzzpbnftwqbsusqccffnvzvsrztqsksvnruuppfswvtztawvnrwbsaxffrrvqkssvtcwuqnwfuxfrrqvaqbsnfccnucxnkwvtnkwxtuqbcwknbfbbxbzaptpzqpwcpffztbsbxnppfqccukutavftunzawptxswavrtffkbtfwvwxqqtutcfkbfxrubkswtczzxuktbfpawnskxzcwkbvrkcqfrukftstzwznckcbwsufcrsbtbvnbsuxkszxtxpwrqbkuupffaxwcnrqaskvtbsuzpbqckqpuwafpkzwcfxncnvkavtfnvwafxzauxxqqxvcbbwxtavxksprruwrbupwzbvqpvuzvtnzxbbnusqnranktkwxzvkapanxcvvzubvvvksnpxzuvtsqnstcxbruntukzafnckarvuqutwkbcqcbttnpxsawxzztwqzffcbfvnusqrppsrbfqnvrznxpazazvbarwuzxxcfxxxpubvnuxvbubkcquuzcwzqkbauqbcbtxzfxtfxuxxkvnntxzctpzzcrxzkappkwquwbnwvfqufvturwwkfrffkfkttsuvwrsfnfbuabtkavafukkbstqutnfawacqttnpskxvsqprturzfbktwuwnnxucxqtkwfskunvaqkuqbtbxapwxwukfpzwxvwkknfqxunvqtrsbpquafcawutvkvqrpqcxrcuzfqkwcffbprkpnunvqpsprqpvsaptzntzcbczabpcqqacxrabwzqbarvtrntqtwasxrafbkavffvatuczxkkwtxtacrwpqtwvkvvqnvbzuwpzscuqtqatsszaprznrvcrpxrwwttvwfazvzurbqvstsutqpbpvkxxfvkkrwscursbbcccknqsxxxvcbcrfbbwurxwpnabkscktsbnbzbtpssrsrcvxfunzbrqqczsrqsrppqcuquvbstwuxbavtwpwrbcvnkurfawprkrzvfzzxfurazpwqpaqvsxkwbnfvpfszsqxzukbskcaawwbrpkvwbuztntscvuzunasxctpsufkwtpszwbwurtwwaqtpakrwrbzuscxxtwfqpzkvvrspxtzkcxpqkxkkcvbnztsraawxctcwcqazfukbvwxnqtkakawvfkqqxwcfwpfkzacnrwvfwpbatqqcvxnbrzsvccfnqkrafczrubqunszsunwrvkrfuuxpxbzkaczczwrszppqnksxvkpkkkqcxsppbtparctrccvqbvrsusxcvkfncwaxarctuurtafskvzucckwasqxcvpfvranrbrbkwppbqptnxpptfvnwzzsztsprnunzbsffptznwszupquzfpbxuzatrwwssabfbvrqpqfqfxqqpavcfbanzsbcnfpznxqkazabwwfnqkcrwfscbxcbtvxrctftrpsfxnvzvwwbuubxvzazzvqfvsqtwckucqpzuuufcpftzkfsbkftvtasnxttruqbfaxrrcwwzrkbbxrtxfbbruvnpwsqcnxvukcxkufufkbkfsaacutpkvupxnfbvbrvuabcznvzzsrnknvuxvzszzwwwprskxnccpuftbrrcqufkfuuapxrsffrkbsxvvnwanabfwqpvxszkcwbtssncrvsbnnafvswpwbvvustwxfrcccuupzztxrzpcvzswaffxwnktzcprrwafuukvbpcpqufrxuzztwqskuvtranuqbxppbfvxusztuprvnkcrwcwpxfvkkvqfbttnutkpvasabbbkvrprfktkxszkvuwszpzrurpsunnsvffrbuvvwxawvxfqtauutbnwaxbqqtbnwvxrcxffwzabqcrwwwfrcuwpuunbbxzncvfcbauxcrsazpzpnbkaqnpctxfprbxrwkbrwbnuvquukspcfwzftwacztspvkzxxfrspbavuxpbquzcpzfctnuksvtcwpaqfsrnwbvbavucpvtnxsavqwrtrpfruqfkxqcwbasrtbsxkwnuutpbbfpfwpntqqrkwukacxqfsxapxwcnwcnbssnzqzbraqwqfqaxauqbxbarpvacncxwxxnzpxpapnkwwupqurrcqvtqtuaccsakacqctnkktfvqwnkvkktppzwavrankqupantrkfvfubnkbqvutzxxursnvncuvvafvrxbfrwwrwzkvawpxsfskszkrbnnsswvptfxqkqfksuquarwxfsqfbwzcwscuwkawutwartfvkrxaquxvvasqanpsqzccrnzcvcbzfqzcxprtpruqkrwaqpqxbppxtxtfvuqcnvpnrpnsvxfzucnxnbkzuxwakbzcunauxusnbpnwsxpncwactkvxfqqqkwazsbwtzkqfsrsqxpnrrszupbatuckfwcvrpxwwqnawauapsrzrwqbssqxkcwknvakzfvbppaknqattvfknbppwkqrtrtrvcrpfzuqkvkfuwnqfqqkznpxnpzwxwszraskktvbrtbxwcvrcrnzqrqsfzbxzcrtsnfwcnxxazrkwpnvpbvpvtsrpawsxpsqacqcxzbxxurntsxfzbvrzuwtzrbassurunfcqrncbxbckvswwrnpxvczwqzccuxvvasvwausssfsuxnubprxuvrqawnarwfffcsfaqcfquxvaacvtvkcnuafruprvxsxxvbkbxtatkfucaaarssbvsscnzzvvxauzvfbzkfbckbkbaaquwqubqfkrucutxrvnkxstsxnzvrsxzbckszbfkxtazxnnvcbafcvcxtvcussrwfacuaccatcwsfuwtwrbsztrcqptbfkzupbnntxxurxzubvfqsfpqpkunnkqzptfrunwqwnqpqxqksrpkpbbvpsuqnksfcvkkbwuztqxaqakktzpznccrzssrprbzrsfzrrxzzncssppvkcftkqquckfsrawcpbztbpppzxkbvzxtqaxnnxcpxuusutzwxnrftqfkqfcsautbkspxrscrfwararqxakzvnvpsrcxantvxtwuqurqbbtfqpsfqtxcnckxpfwqpuwkcswwzascbrcckwwnqxffvzzutqfwuffaxbrwppxcsspzbnnvzufcfxwwnnkbavvcbfxtvwpqqfntxzaswbzwsxznrubckprsuxzkcpbbxpzbstxtfbppxzkcburaqcrnwcvuqaaaufnpkpzbatrvfbvkckvusxuppzkauubnzrnrxfkwnvpzqnqutqtkuvbwppqcxqpzuqbqqcvxaqxattprtcfsuvuswpnbbnzxxzrfacqnfucwvartbqrvvvqtuzzwfktfsbuwqfnbwscrxqwbznrwuxqbbcfqkkswtvrkxnqczavbxanwkvfttbuvxwkxnnuvfabrnsurqbcpztbzawtnqnbwfczckqaafwnstxfkqtfsxnapkqvwnuukxanffussufnrzkznzwzsvcccztscbbrzbrqcbakrsfakfuwuwspptzrkbpbnwsraurkxzqfvzvnwpkzpfxsaqxatuvnnqfupvcwquxpnvxqksxkqzwqrkxvpuufcbwcbnnawqqukatfqtswvkkawzauqffwvusvbkczbfbkrvxurunrqznnztfxxckfkfpsquqsbwvabzvxpufqrcanzkqfsszfruktctpzaqszzskvcucswvfavwvvtqfztckwczzzuaqcftknttcxrwapppcravaptskkrvaukrpqufxtarfqrnpqwxtrvrprpxpxcaucszpasfbtfnpfxnnkbnftvuppaftvcuxnwprwwtwnkbtcrvxvfuwacpxzqqxwqxvcwvtvnrcucwzkrtazcarswrbfuukacrcutbzzfxbwvrntwzuxxnnpxbvcwwurcscznnknptstncwcqvzqrsfnfcbwvzfcqbuxwstxxztctvpzqawvxwcrxsxcrawabawsfvcuvtnnwnaxvufwczfxxrnfbbqbaqrznxutxvrkwwuapwfrkbkrkxparafnnnwanapwppnxtkrpnqwzccqkxvzquzbvztuvcabkkqvfktpztrzbxcukxbctvwzqxqckwaxwpaukvanvkauxqcbqfwxruuzncucqkzvtxzkzbnnufzapwbrxxakbpqapvpvnsxutupppfsqxqpxtbzzqwtcpzfcuurzxuvvwwkbrcwtkbkpsbvskcvtpnxpczcufurxkntnpzaxwzsqfzsfkvnubrstwscafqnbxbpfxscftfnbsukzrvnpqscauqtzxbanufttcafttwsktfzvxawsrqurwutqkruuuuntbnfcwukapsttrtupncfacnarpwnbxqqkvpfufzppwvfsnsbvwtuttfxcfxxtnsbqcncnwranzvvtpxxubabnnqfpuwpfzacfcbabtqawwskvsrfkzcqbfazfxsxwvvtrzuxxttrzpkuzapzpscvznxfswfnswxsppbtvwfqttvcktucbxabwtbwspsupbnaxsnpukbxxtbrsrkvnxtkwctabvwanrbxzqqcvwkuukkwarfwftcqzwrsfvxnkccfsanvxtwactkbrvpptbqsbvusxrvsnzrzwkbpbuuvbvbncfaptfsunxkbfxrvqakfsktznxxatrurvxxwfasutfbaaabztknwzzaqunptwactrucvprpuavkpqxqazuuaxnfzczkvrfqupvtbcvatrqwkqptbnpqsqpkntvqnwbsukasxquqraptsbtubvkrssfcufwzputrukrvcnpvptswnfssbknxbkuwbxbvwczntncnxwuwfpxnrzkkaxssarxnntrzvfzxsqafbwvvzcqccnsvwrasqnvusqcpcwtnptbpuqrstafkkftcukuzkvpxvnafaabtfzpxvuzcnzcvwupnqcstsvuxxnbpkvfuznwvkqcszzksxvxnfattnnuuapnwabattvrzkwawrbtunpacxazasrqparvtkarpnnpquvsxafffksxwrbquffwxauqvxruzzxrksnwwrqzztpqnbkcunrzfaakkattprsvqzpvszwzbqvvttqaaxqvpxpnarkksankzubqcnfbrvuuvcvbuxxnnvwtcsrstrfzvznwrtuqnqfpvscptpzrcsnbsantsxbxxtfxvzkaqtnvszsxznsqvnzvnzunkkbzpwsuvfxwxnawfncstuvbkattqnuvwtfkfqsftptvtpktttvrsrrqrupvxcfzfxnvnrcpprpzuzbczxqtxwxrtnfatpnvpcsrvakkxtkpczrnbcfzrswftxcrucbnpnxpszaxkukzxprfakbqqvnupqcfcnnskqkrupncqukvznbwvpzcvpqwazfbxzfrzsuwckfcqtpvnufcpqzbnrbuqpnfzatcqtkpxstxnsszbrzcvrbfkankuvsrnstrwtxbapukaqwncvkwbrfrsbfrvbxabsksassaqsnprkfzrqckcqqbcrsqupkubaqnarncfkrfwasvkttpbnvwbpscqtutqxfwwnfrkpkuavbvkktfvccvnvcrawkufkraqfcauatzzquatnkunztxxskspaxbfbpwzzcvqbsxwbnppxqzvuffwxzntcsssnxqktkursbrqtbapxkxzpwvbskwufnkkazupnpxxrcwxfxwvnsraarrtvcasfffnftupztftxwxfuvxqfrwxtnrrpsxnccntwwpcsavuvasncvcqsaxtffturtqwbcunxtvvbprbbxakrvsvncscucakakvfzffnpaxksxrvwkfbxxfqsvbrfcscaqvpvpztpztraqtwbfaufbaqnafusknnqfqqstxnwrctpbafuvscqpbvqwavzpnxnrxkkzanusnsvvsxwxwptvnqbkssktqvuqzzznptanknbspxptvrwfvpckwksawzrzvqtwzkwsxznqpkqxqqzuputvwvvpqqvakwfpukbpfnrprzzvwfakkptzqczxfkquravatsvwfsupzzxfxvaznnatwkcqfqtxpzkuwfzwxuvrrnkktcaustxzxkfbpzkuawurfcrpnswunzbwcpzrbkkwubkwvvnbpqcpvqssqnxzkzpakqwqufakcvktpzwbpzqnrabnkxwnrkcvcptqsqkknffrcqwtckvnrzbtwkvuxznbvbqrubzxfrbqckfvrpbqtkqraqtfrxaaatctzabbwtzrppcqunktawnazrqvkfbraaxwqkuwbsvtvxqurcqxtvtatpkqnwtsufrccxvcbprwptfsbvsfpaqtzbafrwtfbkcravkbvafbfvqanfttpttxatuazbcqfctzbafscqxpfkcakqucsrntvanxrubkawfrpsstkurwqantxstuzvqaffzwptqtrntcxrqkbwbnwcxvkrsnsnbzpfqxpzksutbwsvvrsvtzqszrnkrbpfbqfazatrrcswpsqnsnvrbsnnqxbxnxpqssvuqfaqkkfwupsfvuubrnnqqvrkcvsaskafwquuqzruanxpqtnrxcswwkurxuaxzrarfwrnbfsnfnpzsftvkaasunsssvtbwnuurksffbkwppcwcntwratuazcrfxqtbubtvvvququcrsaafapuvbrbvcpfwbqrxucqapkaurwktwcrtnwqafrwazpvpnuubkxcfaxzcbtktcrpsczacpvxunbfxubfvppsnvvcbkfbtrasasvpkukkwkqppcubxcsxpswuqzquszvbwsnsnaxapwsqwtsfqqqaqrbskkpcrruzcfstnrvaqxnnffsuqnbzqrrwrfapncwbxnrrkawpzswarxwszvnvprfnftnrcwcsbbcffsbcxxarvskuxwnnkubfpupqxtuqvprubksckuzxaqzfkpbvbxcpancktrqsxnrbxafrccrbfnvabsqaxfpzbsswkqpbqvnktxbfpcwbnnwfppsctsxwtnvkxqsxqwvkpvfffuxxqnbtcupbpaszsutrqrxaxqzbbvqspwssrrrqntxwarqratfsauqqwuvvuwzkasabrufszccptcrnxcqrqzfkfrnfnztkcxcpqababfavfwwrkkqkxkfpawtswfrsuvzrnncwtxtausnzbzbwkupwnwsunrtfvkqrfwpztczbfqawnfqftfutbnkuvxxffnunanxpbzaztnxzaaspxvnukqtqfnprcztzvzrcanvuanaqcqnqcpbcxcvcrxccrckqrsqkpkfknpnkvqwnnbbzaprswqacpxsufprufwnttswpwaabrxkarfawcccqtktwwfvqqzcwwvrwncxssvtqrtfznzqbpfpvpckrfuuwabqtnxrztuffatcxrvzasuwsxbzzpzzufrsvufwctvakxfuutuukfwzcpfxtawxpkzxfsbwctxatknakuutxnqwswnzubksxnrpzxrrarbfpbbauuwvwxupxfskctkxknccbuszupntqnpvzuzbcxrtzswvwtxzpkwbrzfafftfwbkcbtfsunztxwkqxbavpfsfktpwrabasfukzrrntkzktbupkawfkbqrnvcptusaswvbunxkxtrtfnkrancpxxpbvnrstpckzzpskcppqqtusqwwacakptpwrpprqawutqswuxzvpunrwssnpprwuprvsxxccssnuqnvxssnsqtzxtnbbcsbwbtxzwaqscpcbxupzkkbcsrcvtfabkfbwuxkuktrxtkcvvtuwwbabkzaqtbcqxqvskfwvbxkabfpvccvspxcknatarcqczkcfvtscpuuzqkwbzkrbxwrwwsxppfacrtktkbrwccwvwpqvfxzqpxbuwvxskpuqqsbzutuxpbupcskvxcbtwzwxksttastcxcsbcnbkbtfwpxnbazzuccwqfxaqvzwcvfvaqatzfvqbsksvtprrrpakrwccqncqcxtvvwpzvrqfvuauunvfvupqnnztbwubxfknaupnvvbbxfuafxuuaczaspqaunqbcasvftsaktqwzvrtfapaftuwnatcfapnwqsaptzafbrqzqsttvvfnfuaqkscuusaaqnbrvrnsbkwzfxzrawfpwxrbbfzcrzztauasznaquvbxanrwxsaqskncqrtsnrftfwvsfnauxzcvzartnbtqpxrtqrczkkwfzunsrrnqtwaszxvwpfcpkuatzkpknkvckfuqzxztzpvpazpracqkfuwbbusrpqbscqxnqrznxtnccfnucusckxzzwwruswtqspzfankqptuwnuskzzrznkpkbtnxwpsvtawzunxaqnxqtpcnkznurxfbzfzaffwrknruprwabvzbakbwftzqwunnpqpbscpvqpbpfzcqnwvtqpnvubpbcuvapptcbnnqkcpacsvpctqcatxfvctuszsczbvctvsstsstbpuvrcastcwbpzvkbpuvcpubnnccsvtfcpzsqnnanwaptquwtacvxqqzacafbtquktsxakrpbvscquqnnwxnffavwckuffccqbrsbxruxxrnwsaubwzkcuqsupwtwqtsuuvvwfnzwcuavfqcxbpttwunuvuabpzxbrppbfafwukcnruqvrcrtuvaupxxzbckrskrxxrpxpcuqsvvvcfwnkuuwfqfnqbrawrbnnwrbnnvcktawattrspnafkznrxuskbbnqzskqwkpupfzbpwnrzxnqrcxnrxkxarznztsvufkwzncnqrufnptxawavaaavfpbwutakxsutnqpvwtttswbrwzvzncwwvvwbnsqappufrrvpskfusksnarbxqcvbtscawqazkukqsrfkskkrqtfprrzqpcurxwbtbntbpqqppqvnzvzaczwspapvcbvfpsrafcnqxufacpnsuuffuksbrzpvvzxbkusacxczunrptkabubbbbqpuanaqfwccqnfwxszuxqqqabvvbzruftnrwcfwqtqpappkrkxtpaxfcxstvkrakwkszqazspwxwzfpzxzwfaztcsruvababxnwqfnvrbksazskfqafnrswakracffuvzqnkpkkfuvqrprwkzfvvpwutxsqvxzckzuzpbvrwnprpkabfqqrsvskcrucvakksxzwwcwqfxbwrscbxwvqutzrqbzbcscbuwnxturbqqwnapwvqkftcxxrtskcvstsutvcvuuprxtawtbcxstaztqfsatqvbtwrqntffrppnsxanxfbxfsawrsppbzbzkvckxnzbzccusaqrnacbxnqqftavstuprpszsfbqxstatnkbnqansnfsrqrbfsufkvxtnkqkquanwwpcxtuqprncnxvnxtzqtvakfsksssksarxtaskskxvcvcxruztfsrzwbbnkkbkvnqttvctsfrqsuawurrspbzvpbvuqsncxusvbaqwtkksqnttwqfwbccnwctqbqnwafxkzzqwsnkzwqxfxqcqcwzvknvrfxznavpakpcuqrrutfxtzrkpubraurazuxntanccapsnnwxvxrtxxustuxvcawrturpwabbrkauwccrctpaawzckfnvanfkuctcwxwfnzfrfzsnwwwcxukwfbkpvsucbbpstvurpbaantbnxqxztstvqqwvpvfkvqvvnstbwunknntrkrrrfnczakaxvxwswfttwntwrukccznzzbuusbtkxrutaarbfrcfcbuvtfvvvsasaaqtwwnwckacbbnwxffrkvxxacxckbwpnqwkxqasuqxnzbcvxpwrfpckvsrcssvqapvtvbvrsbnftbbxkzbcazqwwqvxuautbuktqttuwcnvfabfzbxstrxsfvsntqvbprnpacsapuzbsxfvzsktbanrxrzqqvxubvawpstskucbvunrksfqpqxuzuznabbsbqkzsaupqcxvvqsqzauzqwrbnprxqnpsptbwspxnzakctfxsxxwcpcktartcvsuwakqpqucrwpfknxnzkfrbfqaqabnbwucnanqtczqxactbwrvqxavtvuxppctvvwuznwastfxqspvsccnfwktzfzxsbsrbrxkwzvckzppkpcpvnuzfczbaqbxzbrzcbzzxzfxtcrzfsktunfunvbburfaspxzzrxucfbcuctspbxqnctquvutcqkfnbvspvwrswpaqztnwxzwtwankavwkckqnbbvswuqkvfqzstbpbrwukpkbtkrbukvrpwrquspcbqrcbszfrqnpsunasfwscffzaawaqnqfucbaprzfnxqwuzpfwtvwnburatvnzbtrtkksrnzprvczufssqrfvpxknnvknpvwzxwaxqcbwzbqwrnwcpwkpkuznznnasqctqxpxkzkpvxnnbqfztsxvzptsxnzpsarrppksxtsfxcvsssszfwbvqbqzfwfqqszttpvznnxknwvrwsbccrxrwvnswuzkcbrzfvxbsznqcznfzstrptkaannpvbnvtsbpctrxurwxfsrrxrnczffcaxnqaxnaazvcnzvpsaprttkstpaxwkuaxpqttfwxfnsaxursprbnqcspfkwzbvvsswubszzrftpcvzzrzzwprbrwtaucsuqwbkzuwctwaxnqasxbpnttzrzaxvurrcuwptnspvzwucnzsuqqstrbupaxzrucuzrqrzvsnwvsfnptpnsquzruvuuqwcwzfkzwrfkwspfarqsstnkcsfrrfqxusvaabazxnqwkcpfctrvucwrskptszuuucnnfkkruzsrzawwzssbaavpuwsxwanbprwttwxtfqvkvkvzqpsrsfcwsftckpqavvnbktappuwbwwbuuarzkuawbqurzbbrwvusbwstkwwzbuxatrprfrnpnquzwcbtttbfcntrwwwzsxcxkvkcnubsknuqxrsncnqwpcbacsvafqxptxbwufknzasbcfrsnxuswnaacfucbnbquwwtkaxtksqvskzqffzpqwptwtrpcrubqsrqafarnxnrktvwwpcnntkwkxntqbvkxffpztsabbbncnbwcpkkpvrsnabaxxkbbtwqbqsbsbwkfnwqcknntkkzcxvrsbkqxxprqtbuuzrkrtasxzpqbbqxutqaqsupqzxuabazsscnanunkppuvfcpxkbtsqsxvwpzvxpucbuqunwtpvnzstfqwttnwszauswkuafbppkustprfxkntqvbqxcbnbuupcftxqrapsvztnpzvxcvzrwnvztxaxzzvsrckffsbrfnznxazuznpakcwwawzbtvwvwuwnptqnswqtwtxnuxbvfsrrpwarwftwbntvbnrzznckfwrvpszwrrzbvxnnqccukbsrcsnqkzbkatxbbnakpbbqaawqrvnppxvtuqwurtfrnazfufnatfztkkszaxfzrvfauwawvprcbxtckbwcpxruqsquzswnsuvvcwxvxkackqcxwbrrsfvsszswpxbrsuswbprrafupxrkrncpkfaukuqxkkvbrrwskpswcbftaafczvnrnkrnvvzqbskwnqavakkwsckvzrqufcrwuwrubvsccpkfankcbrsrwcqbfrkznqwnqwbvkukbssxnrctvqfrzxautwauxfvfarkkrktbfnkbcxxbscpzbwzapuxtszauzxcaabqzsqpxtatssfaaxsvpnzkfzrffasrncvkxbwafxancwsbtpcswqsbnazpwntnkafbxwsbcwwzvfktwtrnpvqpbvcrrxasvtrvzvtstqqrrwntsrvaanubpkfsnsukwxuqczbruvzbnttbzfwtvbkkkqcscruqqxtbpkvxpwksfunzxrukracxunwrbtbbusqtuwwvtrpafznkpspwpfpzuxpqbaucqzbfbsfbqznpknubqkznnszrnfvnfrvtwbrusszwwcbvpapncunvncwrrfzcnkbtwwwccuabwzubswnbpxrfqxazkxzzsfubnnxrvbnuprcnwxuffurstwrwtnwtxnuzqrwxrtbwrvqrfcnwskpxxapfrprnnuakcqtfkqbpfurutsnxsrbffpsaafaavkubpbfqcpqqrpqvcftpcrsptzbkcunsnatnkpttbsbzpvfxvbkpkcxsbvzzvzrczzzaupxvczcxwwvxqcfvzrbuuvccawrtucsfubzxksqkwsfxfprtksbwnztvwqnbqrrvkrwzpncbqaqvaxcacpxxanqwfvzrnbwwptsaunbpsfruxrbvswrwwzsncwqwkwqncqczarqcpbprxppataawuubnusvckvpnqarxqzbnuubnzqzufxkuuuxuwzxqpztunfvvzrbasztabvxwpqqsuzasrcxtsnkswcwsrnpbbzavnkfqcvppwnrzwztwwzfxxwupcnatctkptzvrrvfcaznutrkzcuqurcpcxsztwakaawuapqvwkvqzbvuasuaxufxwuakcaccrqxzzxwfrtvxtcuabbxzsrzkqssxbwzwazfrnzzrcbauwuncatkcuwpqbsqwqfqnrsupftvsuspvpxuazkxvnvrqssqbkftuxkptrwkrfcafqtvwwautnnpnbuuururxkakfktqkuwxazzrpuwuwwpzzsxbtkwcxsxpbrapxcrxbxwzwruxpvbfqzfvxqrquxwunfaakrncrnncbktnkfnfwnrsqbvrpbwfwnsnrxkskfpaczuzracxztztpftfwkxzuxtnscffnrasaswvanskzxrwtubtcpawxzpbrpkbvkkwvfavxcsnvcbnfubvnrkzqptrfspbqrbwnvkabncbpnvzbctskrsnnnrtvvtnrfpruktpsaksxqrwnbwcbrzwrvzqcxxwznpxxvbaqbzvcrnwxqsnuqqsaszapzkqtxxazfsxtuktksfcvkxncparwxrkpzunuzavwscxcuckfrfszrvzqfttatufkxfpbqukrxwczftrarkkrfkksanzrwqwzwwtvpzqbcsscctrtppbppnnrvbrnrvfrurcwvwppppktrkkbftfsazbkrzkrstfwrkvctfzsskbqnqtnaxqbbcrxcxfzccaakbtwxfksukcstfvpvkzztzukvxpvffqaaavxtvkqwnpbpssnruscsnsrnauxtwswuzafxzabxqwwsqbbckrtakctxfkpsaqrnarxruqsxtrafzktvwsqxvprnqafzwaazffxtarxwzpqnbfbnrxtkxpkvvakvfnnqpbffxpbunqfxuwnwnncbrawcccvbckqzufxknxbsvunxzcpncbznvpfrtrrwtzqpbqxupcwpkfvnvfkvbzbatrqvfctavnkwszftabrcxwskczzcbbscakrawxbtqqxcbuwafuzxsuttcprqcppvavpfsxwuufnqusvwaakrnwbqurxvkxrwszbppbxksutvpubcnbpccbwuwnbzrsznvwtqkqnkzxvzcauxkwnvbsxqrxccwrvnqqzrfabvzwucartbwkbkbkntwcznftxuvvcrfwctrpqkzkzuxpuvcfbktbtptznstvfqnwsauubnzcswskcfkkcnbvfqfqcxcqaprakwpurnakrpwwpsrsrxcbrqwffucxukvqnbupvnftvptbqzwbkxucuprctzvzfbcavwswwkpcnwaapffvnnxzunnkptzvrwswqzbzvcuxkvaucqtuuftprfcsrvunusbwrsbvrzcwrcsbuufwpszsfabcxnbruktbxuukbvszbzuccwwcqpxqtvcxtpaqrxkrsfxrqrcnafqznzrtvtpazrfwuxrbcqabsfuqufvwkzuppakprpqkbcpzcwsptawzztbbvxqswbsskacnrrbkbvtnwkkqxruztrzptqksuubqaabqwckzxpzxxbrfazuftxrqnacuzwbbrxbvrfbnrxntkpntanvtausfxrbbqnunxvckrvqqzpwsacuvvuwktzktfabtnnxnctnaxupkfwpvapuspabbttrvqpfpsvtacpszrczvnkacpbkcwknczvntqvppbuzqacxcrabzksuubfppbquptpufnctszaxsuwkqwpvwaxrqcvbpftcwtquqzpzzcwpnfqvaqcaqtcpqqvpacvtrzzkprtnrtbqxranvqpxvbnntckfpxwknszpbwwwkrvcbuszuvbkvnrpacfuqqwxprpbpzzpktzpaubtxpkkrptqsrsufxwttwkprzabqcsctrrqknwxxkutpcqkubvrcqskkvbvwatszcznwtxaaauxpcuqxctpwppuvqbsqccrztnkskqvxstksqqfvbqpuusuxxaqktcbuztksfpbpzsuzctsnvkqvkknvfxpkqsfcbxpvqwztfqfsbnqsnasafqrpnvqqsqxkabscbtqsfnvppqzsuuwrqaktnsswbvfbwkwuzarfbbppaaakxnbfbbstbnvqxsatqpcrkvcrwwcsaauuzzqbasrnubakawqxxqsqwansnrzanqxvwrzcfravcupkqrqwfrbtuubnucwtxpusraqqwzbwqnwrftbqkrtbzwqvxvvqxvbbaqbzuvvtrxnznkkwfqktrppzxnwqcsakpxvtzbzcqqxsvkaxznaqqqzwvwzuvxsfrkrsrxvpfxrprvntscwqtzanpkcctsuvrsptpbckwnkptvfczzuufxutxuqvzvpcpwkzsvcxfvbtbcukfutbbkzsfavsrptcabkrcxtfqbabwavcnpuukcvkpnftqrrwrkpfaqvfrpzuxnpufbwrwqftptuxubzkwprcfrqzqtaskctaztarufcufwnnkbzpzqvkvavpcwctanpzrfkvxpurwaazcrrfzrbsszsruznxbavtxvtfpbxzkcuwppuvvrqbvnanbbtnqcvabfbwkfscsfsxzvqapqzwncaxkcazfukcctstqvxbukqcwsvzwnqvcqtcncqwkvpzaacuzvvttkqsawtscfbxnfwbfbzxtkbpunwxvkfzqfrkssczfawkwpruxascnfntftsnzfkzbbtcquczfvsvtbxbpxftpscrswpapsxtrzwftnwuzqqrvfvcvuanuqscvakwkpbavvcqcpafrcpqkvkxzrwfpvsqvfkxpuwcwrrzazvnzuptbvnnzfukqrcqtkncwqczvfztfzcffnrafkzrvxurvuncknqtttbqrwrrunbvkwtruccpqrvaqpasvntkvksubqbsrktafnxnqrzzzczuqrnubkzckpusravxusuazukkspnfkucsvbkrkfnfaznfusrpfppurctqbtkfpcquqbuafavqczssvapbattbxqcwwpvxptwapsvkawkzsqpsuqnzcnrccvupzsxkfakruqpfttxtnnvnpwkbtqxzfzncpfsnwpwfpwswcnsrquvvzcppqbxpbcbccnwckuqbnuncqansxrkxnqrxscqsvnwnfxtsszcftzufrtcxtwqvruvsatsrkpuutxbwucxrkutzrfbpurckrxbrwtnbtqunpnbutnvbfxcpkubbcuprpaqtzbtpwqubqftkpqtvrsksxfczxnkqbcxzpxrpxqwbxsvsartubtzpntkazqucscqqckzbunaksprsqrvwafczsarnnzurzcbfkaarpfkuttwnurxcnfaftpwwbznsccvcukttxatnapuuvqcuxtpfsufsbprncaskqzwqfwacvsfwunqpwspwnztqrnkvzxpsrbszprrcwfftpfxnbzzfxcfsftszsuncztzfpfcnfkwfaznrtvbkkkwxfqrwbqnxuuxbfwvvxwappuxwsawbrprpsuzppfqwvfpuwqrpxvwntprpwvbssqkckqaurxszccqbkznfkfcztbfcpzzuqqcbntutrrwnxscbsqffzcbnruabksptfqbftfxnnbfxzqnwuxfqzqsnkfxkqtqfupbrnnuvxtstnufkunfxkkubvvwsafbrbkcbnwbwpbbsarspqtnrzrnrcfwcxfkrkbnwtwattstvbuskbzspzfstntzzbtafnwsvnkscvzkcqpbwrfwpkpqrpabxtrnscsxxncunukzucrfbvqftzzwbfnnbrxkuwkkktqpkqsvqfbzaxstcxawnxsuqutvrpxvvkktwbwtqrbftwucvfsnkpwbafxwaurnrkrqcqbstfsbasvvtxrrzvaswatrfxbzrsfxcufsafrrbcwpuwzfnxccvfvucxrttfnxxwnussxsxrvczcwrpxfvzuprvuaqaczqnupxpfvcnvuapvcpcukrpsqzbnpnsqatqqpcpfbnrwsxbuzwtpknzuaxbwvkparpkaprsrvbpvqxzzfwwwffvfzqwcbknaquvpnxzfaqzqfzasxqucccvapskknprkxsasfpsctnkazbnratkkzfzckkpfssxwvbztaapqvwkptnvvspskvnptsrkauwqvbbsrvtpbnxzsnsqptusarrzpppvtwckawuzfrpsbnrntxznkctktkvvrtwabzsktbzzvffanvvprqqqrbctbzcwanwznzbqrvuucxbtzusffzzucrfvnsravqqtqztwvxbfnqaqxbzuupsfapwrqcaqxbszpxkqnqannabrfxxxawkzkubbpttbncnacvaffrrfcrfuvfqwffawwqxkcckxbtuwvtwkqatvwzpcuzsqfrwzuukfusazfsskcpuqaznanptvzbkvbvvkxnfvczwcsabqpctwxnsztvatsvrvuavvqqvbpkusnxckqxuqbfptwbqtqwprffwqnbxcqsukqfvxprwktrvavnzxupwxrnaprbswnwvbwzzcbcanrkvbsssnkpwatpkrbsxkbaxcsfvctukrurnxkufafwpxtqswxruptfbptwcwbftzfcrpuwzwpuspqqzpbxckakpwazbfkubsbkfsazvxzbktbppbsvcvfnvrvstknbspfwrqczucxxssrkzaqbvaknfnwsvbfqcqvxpabzutbcrfvcsctwxzcnupfbpsxvwusnwnxxvktxzsxzkrcattwfkuxauvpbscukxnqvxcqbatwubbztzznbzcxqrtvnpvftqaxtbfuttptpzwbvxauzuwkkzkzrktartqfqprfvxwfbxvsnnvxusuzszsztkufvqrkfvzbktatuxxpnpfxqqvznrsvunztrvnfxftfkawxkzkrwbpucqbnrukqvqpquuxzsurvuzpzvcwzvkkpvrsafpuzvtaspfbrfntssruxkpsvcbwxntkanuwkuzxaqkaxvaxvxsttuurxzpbfxxcnxstqtnzwaztckvpkuknfbcunfpbnpffzxbfprvkzafzfutbbzrusptbczxvnwsrzpcpfnkuprazbcraftnvwuftfcacbfaaknvnwbxpcqpuwrrbuwvswzwqtwufvssuxuzznvskkvpcpxsprqvbucrpqxzafxctxrunsqnnutxkvcvxtqnkqknsrqvrrcxvfwbnubctqxaczpatbaqczpfazqfusptbwsabttbcrtvuzskrxzfvnqcsuxfssrqsvvrsqfbwzvazwuutaprarqfpvwvfntpkbptubucutqxxrwczqkparpnpccxrxupftrksqckwvrnraxurfswvpnrsxztrnvrnsarbvrrccbnxpxnfnnxcbfvzzkzfsuttxappwwvtwbzzrwacvsrksabsnzwtutxfqrvnvcfnxrcurvvkrkubxvrpbckvssfzppvarptkkpxfpsttspqsbrapbvnsnpsxtvnpbsfnavfnapscaawwafssqwzbxfbafsqqqvvtasbfrfsxvbuvwwkafpcnnztncxcfuwrfpwswwxuwwrkprpatfpzfrtkxnsquvxkxbrtbzswafrnuzzwqswkxskztxvnxtzcwbukbzfbnzxzukqurkuffqxvswpvvnxazqnrvuvpxavfqpxtukauffqsvaqwnxwbncpncnnwtpbaxnkucswwzuzscsaptkucwcxufwwntbwqbctwwkbqpbpsuqastqrnsqxtabkwvcapxvxatkvuskwtqtqpnrnrrcnfrftrcruzqffnuszrpnfwpfnuvnaxtcfkucafufwbuqpuzkszzcrbsbutwaukaqrztxkarfpwtsscpftxfwwqzkrctrpvsbnkkqsxqsqbnqttarcqfnawrvvfcxzknbsbsxvwtkzzufvfxccswufnnsqwparzknkrscxwakwpvwvxzcrnfwnxnvtbkaatqaprkfaztskprfvtfqpskwqrrkfxxwqqvzabucbcpkbazqtqubvqbtqkxbnkfrxkpfbkwxcppkpfcrspnarzrkqbqkwkkafkcwsatqbvssczapppfkvzuvqzkvvwznrkbvsnfwacafnktccqkxqssbnxksfxpqwpkbzfpaxtsfzfxuxsswsvcffzqubtsparttwtnbufprbuxbsvbbfrqcaaxcqxpffwkscuazrxpctvskkbutkwqzvfrzfvzwncawznntkstctpznwqtsvvcsqrnbqffkpsapcspfzpapctbcpxuwukracwnrcfcrpafnwncrsntabqwwxqapbntkvkrnnwvtptsszusufkqzpwpppbrnzzqpnvzqxzcsnkfcstuvunrkkvsuvvfrkfznwpsxzufnfaaascssfquwrnqxcrbbaacbnaptqazxbvakbkckutcvkpbxqnfakpbtvvqupzpnxufwaxpvbxvaqcpuvkrfznubcsucwqsstttuqcpbqkttbpppzkavbxanrqcxurqtnukxkabkvutrckcxcnvttaapvqvaacaszvbqspqfafxvutsfkrtwtuvkartpvnkksabknprakvnnutunpvvnczfafttcackwckkrszkuqqakckrnpbbfbwnspwxfurzfttuafbvcsfwqbpbbpqtprkczrcpswqnqcanwnwzqtaxaqckunxpxnkucrqanpaqqssfazcwsuzfxfqffkqnvtxxfsxxnqbfnzcfrzaqrtxtcrpxqbbqxpaxbrqzuxvubkvqpqqukszntfwfsxvvpsvrvqafqxbxsrrxrnruxrccrpxkrtsnkkbxknuuqkxwzvnravbqnnnkuarakpqbpnaxtcqnwbnpczkpwskwsctrkbvqxapaxxqtvxkfrpnucbfqzxbzuxaabsrtntpcuzrcwtfnrcxuzfkuqtpvtsqtksxrsfqrwpcktnfsxpaqtfpckwnkpkzsvawbtvtbknpcnzkbravwcftwpqwqzxsttxnnsfxwbucuvrpvrcbzqfxuwsxpnqkzvkqnktfwfrrabbttxuzwsbkvtcsaszapkaczxatztwqzkszvrvqnszuavcwntqwcbkpnkpbnqsatfanarfqspvkrfstprxvakafqqttzrvcaaqvrwcbrarwczrackkvcuctfrxnuzpvctvkkqrncqkrabxzrvswprvtupbauuqbxcbxcqnbqvxkcqurucwazuwfxbfwxwaxppnskvtqrxrcpkztrpbftcnnvtnukkansrspspppkwcaxnunbpkrszkbpaptwaqnqqvfbnsxuttasuxtnkqxtaupufputbpxbkwcwsfzwfcbrqrrkzrparskufnvtqvapwzcufntutsksrszzqszrkxupbkzwfsvpkzfwcxxkxzqxzczkwsskpuvvuckkkwbbrzpfpxuranvptcsnzrkcvxnxkzswtszrtxtuancqzscbusubzqanssrusuatnuptrvzqzkcctwtabqqsvnxttvnkuqrtpnqqksnpfstrkbccvwwvqcwfbntqucbxvqbzwpwrvqwstfvqwtutzxwzwpsprvvkqzkfkcpxturpxnqzfxffktxxxxbacnqxrzacqwapxpwwzpkuxtkqpkbakwfntxkvwppvrrucqsuawpbsxvxqnxnpafwpzpfvrknbpbqcnfcxrnavkpcccrtzbbbcbwcastwcbtnksnfrbkabzqzrvabuqpxsaffqxpxxtcktcwvvqccszantfrrtccnuwsnbsusnatnfawzvtzknkzkprzbwfpkrqxrxspwqfapzfkuqtvrkzpvxtnufsawbxcwzxrtnfpszvfbxrrwqxkxcsuqvkczncncfrcbxbuwbsrazffkvktsanakrkvtnfrstrfacvacqvnrvuwunxpwtxkbrtvzzctcnwusbkksbnssnbpkbwtuznqbunkwnxuucquuvsqbwckfrfzxacnczstbbnfkprupfqcqbvstwnqqqfqtfvrcutvfttskcxucquaufvtkawbkbaxpsvbubswpqnpxtctzznnszsuaptctpunkcacxfkwtqnubvfrxtnbapfuvawttpcufxttsawvzttqwubnwrsnbsutuwktccqakxstxskupaktckwcxsfatqartwbbkssknbxawwqsxtknbrpxbwcfwbcptakzzusqrqqxkvrqqqspsrvsknpvsnbfvpukkrptvapknppfcqfztfzfsazwznxzzarbcbzvcvtazubzwtcakszwzxxnxarukwtksnqwrvfkcvtttbqqruwppzcknqznswbaskuxazcxzrzkrubpkrrxzkuuqrfzabxccxwxsppbnzcxrravuabnrvtrbnnrrraunkvvkzztkccqsrkstfpvfqwwnwkbbcqvbnruzvwuvzaztvxwccscapptcbarvzfkpbbrvvbfwrupxfwskusqwqkwrzszrzkknsrntztcrwfwcwbvzapuvvrrqsapnfutvuvbtprrvvrcrttpkbbzvnbtaxfuftqrwswvtauptqtqzusrbvscwazfcxnafkrwrcuqvwfuawtvqzwarfxkazckwtfkfcztuqqazwbqaxqzapparnanfbtvbbzqnfuwrpaskbktsubcuakrcczprpruzfqssqvrxbpcsrwnucskqxrpkuvnzxubpaxuwxctwqtsactqqnxnkzbvazpnptfxpsbvfrwfnstarzwaufapffzsnxxfzsafzwbvtpxkqnrpcanatwzpctfwfrcbsufzcvzufqkvcwfuvffrbcunfnuruxkwkaucxpttvuzupbvartnqbcnfnfsuvxftbsrwfvfrqfabkzbfnnwwuwvbskvnptznxnuzbwrnfxpztskpkcttxfawwrnpscsawkcrssucavbktxnsffvztnctfaczpkasxqzrtauwzwbakxctkqkuacanuunxvckfzvcakfsrzbqfpswupzbxztvzfswnuunucnsxrbfcasbxcanutsfrqxpswtukfzfcpcpkktuvckbzqcttxqttrvvcrzwsnzzsubrctxakpcqsnzvskrqffpaukqnpatrzckzpsxfvtkbswqvpuvsfpvbcbcctkaznstuccrckasbawusfkkatfvzsaannbbcscfwnfzztrbpzqtfzwzvstruzacvqrxfwwzkzxasaavantkturwwzszfkbqsbqnbarzabcvbnttafqszpkxkvcbssfzucbrvfnccsaknsnvkqwtbacfabkxvwqtftfqnkfrrspqqvbbxfvpasatcvzqwavsztzauncckbpppzzsxpkwvbaprzkuuccubafnxnfxpzazcbxncbnapsbkksctpftarxbnxnkxvnckvcxkvcawwaknnusnxkcrnksavfqbrcxkfczpuukpbpqtvfsufkvkpasqpbvrspcaqccuzubtfvvcqfcvpkrfwkfsxxbczcbprbpfscrtbbcxrtnrpcknszppkurxtnrrqzuzqbqkwntvxsbzfactubfxppazuzsnfwbxuqatprcxsxpcxwbfbtrbpbscbafxvssankcuwtvftunapsbzwuqafuksvrpbcnbpfrxrbvquazwstncxxfztwnzfwrcapauzqkfabwkquuxxwanancbanwvaczrtququaqbcawbpuwrwvtspbsuatnuawxqznkftxbrbuwarbqvrsfxzbpzvvvtkwfzaawbwccrtkvawvsrzfvkuruvfufuufaavspacuuczttcpvbxatfvtfrcnrrwnxkufzwaustnzwqkcbbxwztnwkucfbwafxzznckcrvcbtwfrbuqpnabzfspuvrbkffcvfctnqkaqauzwfuprrzpuvnrwawntqwucvazstcnncptkraufpvuqrnbrzxqbxwvcaufxancwzxkuburqanznrubwswssscnuzfqnswpzqfxkwtvnnvckupsuzstfqvkwtrtwpucstppxwzqvnannbprcacuxruurauvpnxkwspxtzssvbbqqtuxcvsttvaswbuwarpxtffppnsfnrzrtqpvvkwsqftxuwrxuzfzarxvkxwkqturxqpazqxqnxsucncxrrnrzrncftqvfqkrftuvunvknvxzfrtwpnwqrktqktpurztqtanaaxrbpwqtvpzvpntxtuvunwtcqfxnctntzfawrbpvzzbsprwvnwvzrfkaxczcuqtvpcprvsunukaprzkbturbvvfnzvwxnqknqwtcbkkpbkwcurbxqfcfcsqbscrtbtfncktvqcfxzzpxznfcxqsnrsanvcanxbrvnnrnxkqwqnxsnptwzpxnavzasxpavucuccfwprakrqccvsqzrbanscfcxpssvrbbrtukaaxcffkvkarsupxkkvvuwrscvrnxrwbuuvcqpuckwtztqquczrtvppqtxvzfavkbqtuffzxvrqvcvfkavrwkqzbbbfxxcpkpnvsqtwrfkrwbuuuvtvpfcfsrpwcbwubtkbwbsqxsbukrcxzrtckspczxvtuvcuvxksnfcvcxzcanfuaktvrqfwbfcutwzqfbnkfwfwffxwbuwnxxvsavtfbquzxppwrfqfqwzrcqztrqbstrztxrtkxukpqppzukunznfzwtbuftxsfbkwbufbrwzanwzwtnatwkbbpvnzknkksssktpnsazuxsucnqnpfatrzvxspuqftvaaxqrbvkbrzcbxsbkxxrrrqazzbpbuuwqrutbntpbpfaxfrrcqwnvbuazpxqbwruwbvccffpbpufcbcwabzrrktxzxzwsrapcvazsurcaqnvxsrzwvnavanswrkrrvfzqrqcrurvxsftatsxsrxwpntcufusztbkunbtxnffvwkwtkntkpsarfuqrzpzvauqxfzqvrtqsbsnvqvkznsqbuqtnvktbaaqafzsakurnqafkkztsnukbvxtbuntwsanbkkbvtrqaxupktvxcqbpspbruttzavuzcpuxzsbfuqsxusnatttxrszcpvbturcqcsnatbkvkbuusbtxcxpuxprtzxvtwwkwbxfqucffxuzxxfstsfnwuvvzrbuzpubzakkfkvwqprqpuwkfzsrkzuvbapvtpctzxusnkacrwncfzctskbxaufqbqvbtxfwvufavvwcpkkbntzuwstqcxnwxwkszwwvpqwustfxbtkcwwnrxwkksraxrfvksfapwcrstafntanqtpnavaafntkuzrpfrawvcwktbwvqakqzvqxfqcwpqfcfkvbkwncvkqbzwcxnfruukabbakuvwfrppawsqabrfaaqzxsxkuasazvtnntpstrkncucpktzzsacnaxcbwpucpbzrntftsbxbktwuxucsababuubvzxaskzzskvfbxkfuntvnzpaaqfccvcunapspsqupfzpwuzfcpuxkrtrkxqqrnfbtaakqnqbbbfvwakxpnxfrrqwnfvzknvcwzufxsbfsxspkucnqkbvcawvkrctnvzxwwrntkkaxtafzxtppcpraxwqavsrutuptunuvparbprfartkcawqkkpwszctpaarnrkfcapvbabppskvuwksxbrxacvzqwzpvnnzxanuxuuwbcrzbswxvpktffqrwbqabapxzrwnrkqqbckxnkqqabrckkffrvrkkusbprxtawkkqstrpxffskpncnbcrzckfnwpbxstkkcncqrxkrzcqxxfxkakwsnzaxczcvwpqvcrcvbxzbwnuzxvpfasrtcntqrurbtwpcfzrsctrsvufrrbvbbcrcrpbzaukwaacrntcwwbxavkbrubaxkxxcrfnpswkaawvvrqcrbkbqxanzqvaurwrsauqvfftuspfbvrruxbbwbzwwwcxpwzrqcxpcxvnwutqkcvcnktzcncufuksbfnwvwwcpuspppssqsfcpkxsqtrxafbbvuxrsbpvtsruqukrrbwqxwxctbbpkkspnktqwzufxrupxrsksuubxzrqwrxkzzwsxxsvrnvqasbpwauwtpvaktxtzbxpcfuspsvptnqrctuvkaqkscanczzsbvbzuanpwpbnkzxpfwqpbsxqrzrzrwuqbqqvwptafkttnbacfcqppvbspwcxkkfbbkaxnnursfqkwwwufqtvcrzqkwafrkprbcwpkxpwxfpfvcpbcxbpnxrcaxbvfxkwzbwfuawzcnsqfasnaptpzvwuvapunbwzwcansuzzprzbbrrnwzqtbkwbqkwzzwcztkqwzawusvsapscftsqntnrncsrszfcupqbtuwpnubnkffrzpnuktaxnuzqrqbwnbuxvzksvvrnwppsqbcbscfafkprvqsfvvbxftksbvarvbcnwuaucaavxvxwnwtnbprbzwxfcvsxzfrvakzrcppkpkrnfuncczarbpbsbufrrwqxawaspknrvtfaqartbqscrqwtwsznqwavxncvarxpzazxavnwwzkzkzcpqqvntnbnrwnfzkaaznwaxauvqpzapxawxktrfkvsaftwfqunvtuncuupwvvkwnrabaszbuaspszuvbznpwuwtwfubcuusfsxfutrnrwfrxpuucwbxawsrpnucptntrfqbnvpwwksrcxzzukrfczqupaqbtucakquwzzpusfunprpruktpkfskxnxvwwfvrfuprfsxwwqzsfbpcwqnkrxcwfanaaqwfspvasapqzzpuzxtbaackxqkfswubnxknsvzratkstcuvvzfpvfvfpfwbtpxcuszxbwazrrqczawwtfbfbcfcxbtpfszfcqazftxkbrzfwtvvtukrzwrzrkwcprwctrppxcstvvvukxsuunwfqctvksnncfrbkvbpcnbxrfzsnxftwfuprfsraccaqrazzfcvzkqcnwqazstqakxacznkxxkbnspvuxqspwtnfukwcaxknspbnpxxwwvtwnsrrvcxpctqfvpcxczauakscsnrwzsuxwskpxftzcrskaxwkzxucuqsqqsbznucrzpzpcrxcxcspqtbcqtpuszapautbxfbuwbsqtfrwktsscvuttfakuvxzksbntzqrpsctnftcpzsxakwvstszzzkafnrutbkxuxuwfrfbfcqkbappfwbuqqauxxxbvsswtafcnfkrvbnuncptrxssfkkzkkfscnnnnatrscusaxcfvswqswzrbpawprrcuqrquwbzbqtfxsxwqpvwkrpqfxcfcsvvrxccwqprwcapsatrnqcwubusquvftqzrrtfpsxucubwcxnkkqxzpxqzuawwvwcbkuuvfbfzwwpcrzqxbutfrutfzuknzutfcbcvtknfscaxquprafuzfkupktbktnakctxftcknqtzbzccaaxccqrrstufuztfkcqzcfvaqnpkubkvrbvxvnqftbbtswtkfkqprpbtspkxwvcfzfxzwvcvutspxknbcqtbnbbbsqpwpauqnqfnpvqbuknrunuvauacspvnssvbpwzruvubpprktzfzxzwkwbtrkkfprwktwfxqzcpcwskksvpusctssqqkqvnnpcasvfsffsnrunvbqsuvvxfvnzqnbvcbfszwbvzvpcqfbtzukrkfnkpvasuufpttaabpzxacsvvkxswfarzzpfnstfbpusxavsqnftvpuqkscaprvtzaxuzffzupupwkqfzsxxkqvfakwbttpwbqwvktvvsvcuqkbxucbvqnvbxnavttaaqcfqnzktsqatvfuuuaufnbuaattznqtpzfbuabutwqpcwxkswfwkzstapnuvubcvvsprrbbtkwcksqvrfvnxfzrbxnkcwrtkuncxtwqvxqpzavkrvtnbfcnktufbsvbwxnpxqqvauqccczttrwvwxfcrsnttbxqqfuapaxakvvkaaaavrpucnaxwvnrvnwwcwpcskcftaqxprwnatkabpusfbtxqfsczsqvkfkpbqqzpwrtpaqwsfkfutktuwfpwsvvrxfrscuqzvaxvtzbtusvkpkxrcssvvqkpkzsfzpqbppakpwvnzvnxnsszcwvwcqfwnrswanxvvrfwpzzrxvwsrfvzwzwxuwsxbzssktvbwrkrsqsnqskpxcnskwxbrqpqscrqvkbztnnfzntvwfukqqpupsznrqutufpnqfwpbanasqcuwubffbxqfcxuuvqpscfnkqbpkqkxnzcksapffaxvvrwbbqtvfwappbvacvcwnvspactnnkktavusupntqpvrtaxfvxaxsxqbcbwrvxcczvsfrupcqvqvckrzaxwazpvnzxavnvqcstnwrnzfczbawxskatsfscsfrrcbbakvxnbsunawraupuvbfukkqpkvtvzfrbtrazxvpcsqbtxkxvaaucuzwpvqtukkakrcvukpkvfpxqsvpbtqvfasftrtknnfsuvnccqafscvkzbfasrkpabcuatfpukcfknxbnqsksqsfcqtukvstrauntbkcvabzbkzsckbpwawvbsaqfnpquvczrwvrrtxvbqpuuzrskzsxtsnnkfswtnsurzvpzautkappaqxxxfvszqsfspkwkvzrvpcxckqsuxvtzvkfuwpwabwfbzpnsanpfcazanctnbtqtzstvuruusznwwzqsbtpwfnsskwvctzxazxcazaccxcqvaacnzwqusbvxapzcruwbvbvqsackafuxsrqvubsvnnswrzfpuxpwpkpbqrubakafpqkxkfvapazrzrswfssnwpczupxtwfpuswuutnbqvcxxczaqbukrcqaafvsxqfxqbtukwpqbruqafprkkkspkrxkcszwxbppzznrxpxzsvsvbvbkvkqafrxunwwqfzarcuqqvnpazkkkvbvrsvxnaqzpxrkwkuvwtxfbqkaktfrqkprzvuznsnbkuunwfqrpqsrqzctvtsnptsntfbsaafknznzsafpcsuqrnzpqaqvawvfqaxvpnzssqpfbswnbbkzkrvknuvvkwxfrffrrpuzbnzzfaqnkxkzurqcpurnntakvtzwnnqpvrxnbkaqsautxncctburanbpfqcvwbbxtanktnsscrtwuavfcvpfqwbsxsvkbturuwkwxkawzkatnrpnwvqrscaxvbxnzbkfaasxxaqfxpxaswxsubappnxkwwqaskvzrrpssswsbwczszpxwubxxkvubzqkznkwfntwzzfbqtxqfzwkcurzcbsfspxbzfuubqntafqtavbssvkutaqsbunwkcwquzbufzqbvfukvcukuptknuwvufbrckfqcrpvrvbbkbxzvzwrqwzxfturaqvkfuazkxuzaxctqwbvzannzcfsnzzxbspbrqnbbbzfuntvpnctnqnvcfpntsuwwszazrawtbcrtctrzufszfwvbfsccrxnknqatzfbxzkxvkawkxftukuntzubxwrqpzzbsuwzwtnnbuxukxfvutbqzsvbwptbkppftvzprcpxsqkczvbzxpxfzzvfznfnwtvqzcqpxrprnsafpqzfnqcrukvnktffbucvqxqazupfkakwrzvrxwxpbnusvftsbtqcfxxfuukzpvzankszusbwffsxrcssupusbkwzcrcwuwbvwqkqvsuxazqkqpzcbzxcfacknczvkktcapzazzvrsrfvszvkcnavrazcftuvaaubzfsupukuvzznzxazzscqapftvzqxzbfssxfqaukructzrbvkptffvbzubbcabqctxnukwbuwnfntktzcsrfbucbpabvkqfsnztfcwvsvtbxqfsssrffawqusuwnsakpruvtbbvzkuwqnnvttbvbaccvpcqxavtuncubcrbvpqnakunffpczbucnvfznrunrvkrpkcvaaxuqkkfcpnnwkpqkuafvbxpuuccuqavukaxxnapsfbpsrpcukrnfukvpktszvabxbxzkrazrrqfnwrctnukrpwqrpxwfckvqrqvsvfwwqsxafwqzasawfsqbcxznsuurquqwcsatzpptupbvnfsbbswbprwqbpabatzbrcrxaxvkkcbzcrakavrskxsrtktafnnkaxnttbxvxcpusrkqacrruzfrnktqxuqpsxrvxaxkskawsknscuwxvusrbsznfvqqfbaputvvptzqcuktnrrvnfwqxastarkrzqwqbzpckfkrnvatsrrarpxnwurqraxrvbazbzxrfzwabtstzuwvkkvcwsvtrfpqtxrztufwfzvzpczrnbraswrzxtppcbupsxnpvcnbncbpkpcqwuqtrcbuaxnrntwftbqkqkknqrtkunfkprvvabqpfpsbbzvaurxsucbqvbssvzbabrpnbvtarbfcpxsvzbupstusbxwnpnvvwupnufutxzbtntfrfxwtaxcurxqstnnqsctvzkrfnbnswatcrzknawpuzbnkpbucrvkuvbkuxnxaxbxvzcbqtrrusqspvswuqsfbcsvcrwwxrxapqsfbvwqtfaczuuxkrsrxbvbsfrbfvpzxbftcrxfrzwaafsuvtwbftukzzqszstupuaptwtwnuwkrncpfwkaxvnkkvsrczrkwqbrsvcfctbwqapxtbxkbqtbruxuwxcufkkxakkqxsquwknfaquxvutvvupkzqqzrcutwncrstbxubapnxvvwspkzvbcssrawcpvczvqkuxqaqpnspaapzvsbzanskfxbffczcacxzxnvqqcvaqspaxucfcwbrttknkxczauqfcrzakwztbrwsvufrquapvfprrzwnubzssatcukbpzuuukqfxzxpwtsrwznzkbnpzfxvxxsffakbqrccnupkwcvsctbswcpwraanfwufckcxvqsaxtkrqpwssqbsxzffbbrnbptfbupcubwxrvpksnuscrqbsqzrvnpwrupccpxxcqzufcxrnzpquwfaxtqwqvrvsuaankvafrxqatvctnxnpkfpurwbnpaccpqxrnztwkucxpxkspkcczskccakfkwanwuuwsrvbukwwppwacqzawkscqapfkakcxwqfbnkwwuqwrfwbsqtxxknuqwqfrqaquvctvrkfuzaxxnnuvknxftrwcrrpakfpfrwctauckarbqvkztzaztnfssarstpxxqbpvuxstszanfstufpsbnnnxunqxrwzzpqzqabxvruqtcuqbqvcnktxvrqpfstrtaurfrruqfkwbncubqxttnkxkbqfuxvrxnvzbfpzustcsuzqscxbatkpkkkafnfauntpzcrtrtwqckaturtqqcsnxfxwwazxbbpvzfawzqxuvbqknskwawfucwprqxbkarxbarvpzzvxqafptpvcsvfrxftfkzrbstkpfazqrcrakfnzqxapkwrwkfvwbkkpurrtpvpataaccsvzxbcsbccrfzupavnbparwutfzpspfbfrpxzbvxubuuprzzqvkukpzcvkpuxsfcasnqsxxwpnpvsbpbnqzskbbsbvksxsckzztswqzwnzqqprwfqraaxscctrsatqbqfuqnxxaxqxauzvkpuzsakzcvntnbacxusvvtsczbvcarkxsuktrtnbbqkbstctvafcqrakxnnvrzfwxbzuavbbzfpwkxzzrqaxtzbcvtaupzxscswbxrszwbvxptqbkzaxkaxxtazzvrkcnbzwkxustaknazubxrfkntqqqrcrstnrrukwbvsbqaabaxsxsftzxwtxcbqqwnbvspwfnkcpcbzcrpksczkawssbxuatstswtfrxanqrwkcrrrsauvbpkzfcrpvfvrvuuaqxfzqqqrqkxcsnctcafxsacfucpztptzskwfckawanvpnqtsnbrpsvuaxnqafzszxzxarxskvubfvpatvpnqnkfzkxasrnqbqzppsnbuvpwtxfnvpbscvttawvavrrkffkpnptrkxqasvwtzkbkpzwbbszqrfrbqczwwxvxxkwucnkxknpqfvwqkrrnxspvvkzuzbuktwrwksrcssabtnuvrunuwubqftkataqrqtrpzrskaaacsspawbrrnrsbtfxwzsavnsxqkfrpstntcsxkktbvpazufzxbvxqakvsxcrkqcrzskffqvqxqakbkwxcvfzuckcswssxrwszaaspsnqbtkcbvsavxftvkpvxkspkqswfxktpuztsfbvxfnpvrvbunsrsbfwrppkwkcpfuuapkqbssfzaszfpnwrsppasknzwasxwursswqcazcvtbtazncuxccxqckwbktbntppavzwnkfusaaspkscrnqqfxnxuzfztsnpwfbkrrkxxqxvscburzpvvtrftbprvqnsabwpqvqkqnnutztrwbxvcnutxufwufqaqqbkkzuwptpnrvnrqtzqnaanqurwrattkfzvxbbttpaufqavptswnspkpfqrcuzqpqpancqtftfvvfwcucwzfcwntfzxspkqwcpasczwcnarbwuvnatuxtptfsaawauttkztucrfpqpzkpuskpafqczccqtwzsfbvxcatbfwzbnbnzvtrkzqvrtwnvxnxbvufzxbpzxtwbwzcqxwcrrnzxquxrurtsqrzqfwzwutbszrwzbkbkszzfkwvvbqfafsapckptswtrsvnnnxnqkkvrfcaqabtpawqwsqtpskrzwvtuuvxbskquftssspxvxkfutnubswuvupvacvwcpazxkpqcupzaxxkanxsuutkbbvvktabuwqkaqktcpcwkxuuvrcnnxubwbxsrfqtuwspctpcttrsqbvqancxxfxkbttfuxcscqppczuasrubtkaruuwkprnwuvcuwtzvbsxccpkfzzrrurqxwtfrxzztwrnaxqanpncvbwzuwzauvxcspckrkqwwpwfczpkfftbkapxscrkvwnatqkbptbwnquvbxnvqrsvrwabuxufsvxbaxzsbaubfxcbwwppzfabttupfbqxnuqnvwfvtkqrnwcbqvrkwpbcsprzavvfwscvvkbuarkcwfvvxsvnaauxnbnufwukcpxqcbrkcufatbzfcpbtsbxnzvktupcancunwprsfwcbvpunkcpbpsurppnvrqfrnxtpwcbsazfnkbbccwxvssbptzpctxwtfstufpfnuznvbnatxrptbaazuqsubwbrwfufwazufzsqfzrwrcavzxrftzwqxfwbnvwxwckwrzwktbsvxuuabktcnpcqaafptnbvfucttwfpqtkpcfqrsanwxvssqncnwwnwwutftuttstqufukfpksfnbazfauavkvcwftpqrfbabkvbbfcsapnrpsrnfvpsuftccknbkvvvauqwqffacwbstknvxqqfaunvrqaraqtxptxnwkrwvwsqwznrzukunnkvnknwtfvkffbubqazwpvczvrtrsvzsapattpzkbaaqnxzntvqnrtubtxarazbwwutpscxwzrcfaqzrztfkkkbcsqvzzwaztftsbsupzfrpnuwtnvnurskctkxxsqwbszxfcukxabkaftrvwbvspskbukkkuvpfswrnwsunffnbtkawntsxxkcaxqabqvwftzqxbczuprvtttnwzntuxtvxfwbnvqbfwnuxxpbauaqtfurvukbxrvkurqqatxccbwnnnnznburbpqruqqwsustqzkcfbabapskkkausstxzcznsnvzvrbvfqkfwcwwwvrrswpkvbvsnrcapknpnwnvxarsxvnptktbpaquzubtcparckabpvksruxkqzsvpvazuufzbpsapxswwnafxkxfbprnqurabprfpauzcfnubzwzrrcswpfutfptxbcbuckvsxxxcafukswxcvrnfakaccpnvaqznxktfnvsbznbxwruvbanbkzcsbtpcrrtxvpxnnpcazuvzsxnkrwvpbpbzcbuxsffpuvqwztrxbfvqzavvzvqcqsxnkupckusxvnnwctuufzbqzvbfrzrpqpqtqrpxrwvkwbrkxnurqxvxqkcsckxaazxxvsuanuvtabackvskvauvsrbzxxsccffbbwntuftzkfxrcwkzfpackpxkttsvwckkrknuuqnkssbnttvstzuxraqrrtzvcwfpbxtfkqwqafssvcbcfutcpnxurvtkafzqtvkfpbctrzqkppkuwtzwwncxrftfqkrqnwktcqnwbztqtkkfswsawafztvzsqazqbbrrprnxuccbqxbtnfsspqcawstpbrfpxscwknczqrzcwkvbfvwtsswbbrtuktkkwfbsuvvzfcctvkfpcrqckppapvzqarcbvbpwvzkxbxstnarufrpcszvzwcstncxxwfarnwsvbxpbqqtakttrrfawnvsnkpptaqztrqutbcszcstfqakpzcbtxrxpupvnfzfkkutqfrakqppputfuavzqrsrzwbazrtvntuqfpcwbnzarbpqrtbtfkvqaqqasxruwrpbxtzzkvfrsqpauwccxbfvqtsxbnszvawrsazpzvcvtzszptxrrzwppqpstxxrfbxvfqffcnvxsrafranucztnvwxbbqppavuxvzskurcwrfsvczrutztsswbqrcbtnafvnrfuvkfsqxptfqnsfbxfwnatwxafcvpsvfbrkszckupxtrxktnncsqstfvbbnfncfzbskrpsbssptffvaszpvcxqqupnaczrsvnatzswwsakaqcbpzvzpqzcuuxwcukvztvvraqxrstrxkwfupwxrktswvtuuwkwkspwwtavfuqafuffaxbcaubxaxszvravqtkksxnrvxqxzukafqruaufbbctqfvqquvkzwukbnfubckatpccsrkaabqanctsawarbrbzqxrbtwprcrxawpqswbwrrsbppzkaqtantnzvqzcupsubpvfwqankapbztattcfrquvqstrpsrtsnksrvxzxfwutftabrfktfscbscrkfrtsvqwppfvrnaqwcrzsssvnukquwzavrkstqarxunsftrtsvfxfwkusxwuqkczvqxqvnxuzvknzfnnxcvvxnnbqwczkztnpfnnapbnsrabwzrqvfbstzuzwqncfvqcsssbktspvatuvxzakzknqxpkwunkcwsqnuuwtcqzscanvbvanpkbpzpaqvfpfbbfurssbwtxzanxxpzqzscvpfufsqxqnrxptanftucnxspqbzppcpvpqupxnxnqsfaackxwkvzkpwkxnufvzakasppztaupwbqcfcnpzbcsrwantunsnksrvkurrwwkfckuwvsxustpcrsuaxvxkfvabppsznwctpnubbtprkqtqxzbrkrtwxuqqupaastzfxvcxcrwqctnkzfnbwtwxkrxzfuztrkuvssbnxffqkbquuksusbqspckqxnnwcuqqqtqknvrrsxbtfcvqswswcsrbvkftqacfrbkwqcwtbacfpwzkvzbutxwvxsqzrcvbwwrzknaxvrtpkpaccnbbwaarfffxkbnzkzktwpkfuktbxubbubsbvzfpufpquwwzznqzbkpswpapfzbbrcqtnunnqqarwqnaxbbvazqbcwxkfzbfrswwtnpnpbcfuxvfzcffuqrsttkvxvzpuntrtvpprauqkccpkrukavrfpuavnqwtcpxwpapswkukrkruvkuwbzrxnckppztauvtuvbnvnxctrcvbqncaxzpuqxzsfnqqrqwfxafcbvbtcxarpubvnvksvabpvqczsrqkuvaraaqfrqkbrppbrqbqnptuzqwrvxrwfnwzctknsxpuwqfapxwrbcutxkqcfsabqusrrrrbpbrpnwqrzfssaffcrxbxwsawpzkcbvkpwcscbrfskpkvctcfwpsutzqfaazxwnqkaasaarnffnxarnsxxubsttncnxrtvfbuxvszcxzpxcqnbppctwrsxtutpsbrxqcurnqzqrafkvzuwvuzbvxtnaruccsqkzunwtnaarsspfqfvrrnfrkvztvpsrbqwwtrvxffuxrsfrxvzrunbcszwtqtuurssbbkrxzqtrzbusnpnxpxsswfwasqsuxvssatxvuvwrwfxrtcxsrawxasbtfwcsfavqnraqpccwfxvkzxttbuwzfartkwpkqnctcawzaturacpxfvtzbaqxnrfzwpnvuvucpbnktfqqfaunpuwtsxwtpcasvrabxfqacvrqcwqvzpussvfurnxfpwbrffpkavqfkaqqtrspbqqtuwvaxnttpspwbrqfbqtuxwbkcnznuawrvasuvzcxnpwqppfbccarzfpxrfrtuczkvnstabnzfkrpfwuuczttqcppxckkkxwwvtvavwfwakpupwwfbwqcqucufckfffnftbctafvrwnqkbqvqawqzxwswqkqqtbsqrsvttbbbsqufktnswwtbvruwtqwbrsrrpcsxvsaqkufrwptstzasbwrswupawtcncvssntuuxaxbxvsnpctpxtbfzafkskrbxrvrnncurpvaptkzcpqrcbntaqcwwqrssnfwvrfsbwxkncupvvqzwckzbzpvrkkzffwqunaksncwvfvupfuuzuzabrvztsucwftpburvaztutxsvaucwsxkzacnrfrxcpfttxuucqtnzzbburkvkstnvxxcqkbvaxnxkfftnwpkruxnqazsaczbnuuctvcntnrnfxnknckppxkfbqtscbwsvrspfuwscvwzqbascpfutskwqwqwsqnuakrvbbbrrccvavksvtffcuvcucpknnpsbzspnzxftqswzwckkwkxakxfvqnzptacztufwknstucbfpsuszpwfntxuupvwqkqukxfuantqxurvpswvatzvwxnpxrwrtaqkwcqxfxqbbpctwcuubzktvvqzaubsnpbtnrxpxaxrfcaxunfrbnvwccnncaraqprwvzrkaubwnzbqbbqcawrnafwsfpfubxsxfqnqsaaznwnnxppsxpqckvbsfwavbapvsapzsxsxnwvrckaxvasnazaqfnbcsuxqxutvbnxukxqbxvpasuzwkutcbzpwrzbzfqbzapxncanzawqznqqtxaatztwxxvznqkuqpasvafpctqfuanfvaxbavprfvfsrtcskkfzawrttvttkukfkspwfsfpxbfxrvcsprzbbsxcrkqvunknbsqkfkcqzwvxpwfwxknxaknwukvtzxpufbbqazbvkazsaxnntqfpvzxufuvfbpskuzknutcfzuuarxrzvcutnrqvaskrzxwaqpbxffnxzwacwwwwkfwsvbcbfxnqunczsfqcrvrwkpxzavfxavqfztzsuuackurcbqpctkwxzpnqzstccvurabvkrzkrtaarwfxwtuffzxpuvpctskrrzructtcsxnsbzpafqbtukvatqfvnpcxktxukcwrpzsfwpaukbqfpxffkxxqfqrxuffvszprwwvzwcczbrvwnwaatfsfkxnqwsrxbbqbbrxuafuvswarpckntnfasttsuvvcvrzkzbasptufvzfkuvakpkvzbunkfwzqunzzrpasapcftxpckufvwanzvcrrqtbwwqpkwsbsvqavktrbzaxxatvatxcpqnfkcxkcwtauvxpzrksbxtzswbfcvzkwbxfwttssrqzxasftsutcasrwpntpanvxqfkqpvntzcvcptrzkzsknwrttpzurbvqrpfcnfskbttrabfwtarrxpaatnkbkcktkpbzqzkqxzpxwvpnvzpwsnxanbrrcrcpufzvwbpfpccpwwansukkrsksttubkfruxwvunqastcvaafbzckauucbuvbxuskktvnsubfarrzptqxtcntvkabnqrkzpcssbntkwakracsapbxszkxrxsnbuanacwkkctvzafuqbrbrfxkakxxcsnxksffaavnqwtvskrpxvrnabzzzfkwvpkvxbbzazxtbanscsbqvakqqbczkvkrnkqazbtqzzfncwufuzwwbwuqxbsnbwabwfvrruzwwavntfvtfqwswfwffffznrqpkfnprxzatfrutcsxtazsafuwrqbzauttunctzttbpqqnbubaatnzuukkvuckfsqtbqbcwzazcvsnzwkznnxtwxrrabnzwzaqpvkafxcswcztkrfutcuupsqtcrwzxzkctbtfzpzcqtqkbvvnxataqxcskaqkprftxqfukqqqbfkkntbuczwuxuqnntnxntxabzaszctttwfsaaczkafuwcrxpkpwvnkcfrzubnstcrnfcawbpbwbffnnnatcttncnfcfucfqsnucvtkzqksubvvrkxbvzrbznxsbvsrbzfkqwvpuqrsupzzscvvuvzstnucfnrssncbbnrfkqxvacuwravtzazvbkszukbkxtcaakwutpnfunbpfvwusustpfrzrufuaxkfkuuzxkvvtzzuvrzarwvfrbsctsxwzcqsxsfxxbpszbqucffqvqrrrwusczcuvnucvxkrvxasstrpnxqcpqwrktxfxuafpqazatxxrsvwstfvpqwakzvfxncaazqqwrqztxbzaksfwcpwkancrzksnarartqpcrzcrswupzqwqaftzrwqcnnuttxfkvbbfrrrvufcsrptppscqaqzafzrufqtppkqcqccnncksbquufrpwpctkrfatuakwqaqxnxzkntcpssxnrbkzvxrwkafpftbsznkrfuzqwvubavnfkfxzbvturpcatpcuxfuxzscavqzsqbzrqxfwptzxcpupafpcnuxcursxfuzxwpwbbcfqstqqnxbtncwxfvvkqscbarsbcwwacazzvvcnxabutbqzrpncbuztnzzbpnbfuqpkxxbrxuwsxcknktsxuxarbxbxtzrwuqrpacfbpafnbknbrpsqkcfunqwrwsfucanpaqrxnwnxkqsccvkwvrtfztnzznazbfwfawbbukfknvarnutakzkbbnrkafbqpzbwznvtskuqpcukxkubtqbkttppabnpfkakwwuqxxzrpssnxprzaacvurznabwsqcusuqxttaxppbtupbatpupsczkczcqcftatrffcwvsbnuxpnnfctqwvbakuxknaptbskzvzqcxscnnpvcbrxkqfqtzcuqpfakwpzwrbsazzabavssuubcnanwpqrvuubrkztvqscrucvzxqxsaufcpfssrrkccsskqpkvspfsfcrwzqtcarnfttnxnqzswvstntwxzrtfnzfwkwxnvfnnbqswwftcukasxunaraspftwxvrracunrvsfnavkuwbxcctwkkvzfvcpbqrtnkanwsbnqzfwpbkkfbpktkxvsbqzknwfkbffftwwbspncsvaxvztapnbrasqsprfutcbtzzxnxqwakskccnzrvcvausxzuquvwzxcppnczpfxfuzafskbnkzcbpkpfvtpvstvbckrtbsxkfcpasrucutwcatzxqaspbnqzktrbtzasavprquqbqubzqzswpwnvnafbuqakafcbcwzufwfkrkxqvfkzucuwqtanqucbfqpwsnbsuzbuzkntxqaknxtrqfzwrqxtftuupkwfbabkuunrwsxvkbcafvzrztcxbvbwrucqkabbvtxcsuvqsukcwkapukawvxrczsaqkzfbcaaqfvvpcwxakucrvnqqkzbuuxqfcxpkxwvqswxrbncsrbpwcxqwtzupwurswvttzbbcxwawppawspunxxbxwxpnkxcunsaknvzszvkpzwpvrubaxnktwwcqasnrtnpbbzquxtscxupqkzrzkfacttawbubawbxbbsqrsqzbcbzwwcbaasnnkrznrnqkvvrnqtbackqfuxbxfnupapfcvkzbkppftpcuffkksaartfvtqqpxptuvbzbanxxwkzxnffbfvutbxxbcrrcsbnvaftffuwzcurucstpwwnnwqbznprarcrqafkqrqftfaasfkrncuzcwnupfcqztqctuzxwbrbwxcqsqkxwfqrazrwqvtpzacfqbspfwxpunbwsxstzxzaznbnbbakarcuwfbxuwscbrxfurkxspnrzxznkbfbfkquvznnkztpanrrxnktwrrxbtcvavkxqfccnqquxnaasxzvfpsvtnskftutnfbsvncaptpbsxucucfzstkpbxpsqvsakkvkcuqncscppuuuqbncabfqbcbxwcvwvbkztkbcpfvtkubvuvkkrurzscsbfvkbwstrfabpfrcwfwvkscanbsfzvvzkurbvrwwbwzpbtrpafkvfafsnvtcnqcbqkrkzuuvsrcaktfrbnwcsbzznrxqfvfbrxuvsrntanrzwftpcrtvptqfknpbstaxstbstxukqfbkxpvcfvsvuwskckaanbqssquvcxuvvcwwpcsuccwbqsqfzkxksbtarnqkcqqbbcwvpqcbbrfvtxbxvnaxkurnpkqbrswfpkzbvnnkzawunwnqqqkwpxcqknufqkacsqnttwknvssapnnwftvbatppbqbuvrwzvuzszwzfskttzpaawzqubzpfwtuqrppsxauwvqkxnawtzapbqnnssxbwrxrsvwtazquqzunqawkxqkrzzvpwrpqkffrbqwskazxntqbwtuwrpbntrnupxqsrwtvwtqfpzrksvwraktuqvqwczzfnvbptpcczfssnxcxcpvuavuuvspaqptxsbnxszvvpkntbwxuapkrwkwznwzxtupvcxcbnpptcvuputuukxpbrvanksbrtafxabraxwctkvswbqsxwxbnackarvvwrncffvqtnfzxtcbanfrnuknnnrtwcpaxcrcuvxazsswnpacxpxszxccarwbxarxstufqtqcztwwzrnvqnruvqprpqbsbkakazwpnwrwurbxwxbzuacxvnfrqknfswancbztqnzccknawtnvusucarpbfzrwfvqxzbzzwfxzkwqfbuacpafrpabfuptsbzpbrxznnpnpbfsrsbcbvfuzaxfzxuupcrvvvrxvbxcptptwfwutxkcqxavkvwvnppsbuzwnavqaxqtnbwvutcraxrvcpvvnwtwanftzcxfcwnswcfkpcwwucpkstsunrcrqtnqtqppxqarppzfunnbpsrfttcsrpaurukfqakbfwrpbxzsrkunkkasfpspuqfncqbznvpfcwxfwrnqzwxrcbwppvwfauvppxtskuxvstbzupauzcxtccaufxzzpftzcbbfkxuvtbbusrarrfuvcpqqruxuwxvxrznvnfwfkkxpsvputxpwnwktqftnnvnnqrpnrvkcrbsatkbnpnxwrrpkzqfzzwcfzvnvvrbrntatvzbquqfvwpwpansrtcnsbvbfbrfntzpcawpaskntcqtzuzwaptvpvptsrutttxrtnzabbvnrtuvzzkxrknttavazaaqpcsrbufarcacncffpvnvzcfvnwxffstrskzkrcunqvzvbvwzncbrncnkqktkqfpzfzbzwuqzwzskwpvbubrbtftbbkcctxpvnfwpcknzuuxrrfwrrttqzpcfcwnxwuswwantqzqkzbztcabkvvqtcswttzfpxszkwqrvtvvxuausuzsnrratnxvqtuwvzrranqquwskwxrcpfxkvuvkrrnxsaaczzsnbfaarzrabrtkzuafqntffsvfaxxczzunqscnbarzutkcpcckrpbxutnuvfnwwwxrfpxnratbtfruurpszzbfbtzqxapkruczktfbvavpzfnzvxtbtzukfstpnkanarqrtpbqxzaxrtvzucbvupwbfrprbzfcnnxnprrsvwntqsvsqprubntrbpkwcbzuqapnpcsprtusuznzatbwwtzuuffpstnxquzsvkfxbqfukvqapvtcwqwsfzfcnufwkntaqvpcrfvbfacwtxptfuncrunbpfuqzxptrvcbuxptpvqkuzcpxqpptpqfvcwvpqfqxfruvsbpzxnqszanxsaptausrsqwuzbqsbqatcxnxsvnkzxqkfkbpsacspuswpausqzbpuuqbtwzwwzvzkbqabqxzuravvbcxkbwxftwtcpffuanzwqsqsxwtqzcscfvsrukkuuprcsfpsfakvppvaqauuxafqpssfzpqcvcuspzqnpzzfzxxqcpbpqrtuutxnvkrqzckrunkbvczbabwvwzvrsvxxbxszfwnwfnbwtqzvcqkquzsbtuvbnvabrnracbabruktckqptaxfascnrucbspxfaawruarnzkwxfvwacvxqwxsrqxwsqvtkswqrwuwrqattwzzrwucckxwuqkwrxwkkkxqzsbataawvbxzarxwnktxwswcxxstkafvwwcautfnpxrvqnkvzwawxvtwvrbxfwtncuxwvpscqkwqxcwazacsxatwaukzbvnnzcpqvffnzkwzkbstrvacxnwcvqcwxvfscfrzubawzvsfscssqbrrvvfvzvusuwkfwwqksaatpxapwfvxxzvutkwvtuzcqzrcazapqbfvktcnapcqvpuvrwtbvfzrccapsvknkcsfsxzcftupbqntkrtunktuvquztbkcanfapvrvnartwbtnafwtnxbvpwsxcazvvtactfvfppqfbkuxuakzvccszkucbrpfpzasnfuqqxtcvbqfnzxsuzzkqwzursqqapkpqvpsqqbpxqxpzxurbnqwxqqtpfkssxurbzurpctzqpbqrzuvxktcnccwuqvrcqnzbuvkkwqwrxzkabzpfwsnuxbpqkaktccutarwbtqbaarzqkpnxxfnaufnttxwaxcvszakxrutztvqxrasbtrcktqrnsrkqupfzqcrtrbrnxuvfxwfuxrwrtabqcwrvswzwqasnruufvpzsnxbwufnuuuzakxsbsqaccsratrkrcvxwwcnpcttwxtcbzsqntnqznxftwrbkcwuapsxpcvvxbvtsfafrvpfccwvfcvnqutnfbfwwvtvzpbrrbcvtztkwrrcuqfwcwbwnwbauxcrzwsuxrzcvfbtzqzpcxwtkskcqtcsbtpcxknfurrnwsupsaapsptwwxfkqspqxzntvwkbabvpwaspsbwkzaunwvvfqrwucxzxtqpfvkufvstvbvnzktxfnfbzpsrfxnnaqcvuaanzucxraarrsppnkfbskupbapnzfzkrtnuqswprpxpxvfawtwvaczqktacuxvauvkvwpsbxknaazcwtqackzkuwufsnsuzfnurzfpzssnnbcbxvvwkputftkauvfvcanvzzxnasnxnxfcckrcbnpbxwkpsavwrcwpcwsnnzraaskktbubsaasvnuncbkabsutaqfpvsfvqbkrkfpswttfwfswpavkwpbpszwrqsnbspfvctqtvafxcnxzpucsvrzvwkpvpzxzprccfqanpkvttwutbksazzfuwqxbqsxqxrzsqsarunfqntzxquxqnvzkrpnqvspqcnvczarnuftpfwturxfaxwcnxfuxkxkbbzsutvpvqzapnkwcnzputkvazwbpzrunupkprxvuxqnqtbpcvwtptaxnvnpaxrrbbuzcskskawttcfquzrvfwcqcfstuzvvqbwsaxbxpxbxwwuzwxbxbfsqsquwrkqrpwvcxpcsbpbbcvqzsqqxawkxrntanwpuxksuxbrvptzfrxspwvtzbspvczqckrtpzqcczzkpkttnafbkvvtxcsvckfafkqkqtksscbnrukcnsuwsfqrvnwrzafqknsfaxwwannvautqncqznfxcttfsfnzufrxqaubzntwqanutnxpnswatqzwzzfnwcvqbrcbwtasrqqqtftrckawakpttctquabcapbusxrqxpfxqbrwfpwnczxtuvukqxqbkvtbfbassvsbcxqptacsctqwbwnwatzkwswfsftxtrqzttqcnabqzkckvprappqsuwrzwnnpawzrzprbqrsbsxwxwnkztccczswqxpccurawbbufwquqbptucvtsuvwxrvutvpzbuutwauzssxnqpxsvwuszspswppcrqpxfbkxqwkkctvsfrnrzxabzkzqatqcbanxrvpuxqwuxabptqvspfwcuwqpnfavppfabvxbzxncwuwvvkbuaxbwcfxqxbazpsacwbxavfvuavavtwpxxxvbkpnrukqubsvpvvnrkkcnpcunfktfxfzxcpuutvnbqqruxuftqfqbzwwqqsxrcwskukazwtuascfckbrnpavwvwpcptaztwtkzzkkfwqqptwsvunszsauufqqbscrkccwxqruvpusxzqcrtsqkakuxxxnpnfbcvbzsvufsfqfbcavrzkxnkpukxwvqxkvfvruzzwvrpsqacrrtspxanrwxffvknfrqapzazzpuxfktzzkasaqqksatxbpuscnxtuwvvzccuktztncswbtszsktxpsxtakssrkkpzxuxwtabubpqsnprsswfcnvrxfqxvnqxxvrnvcupacnprtxzrakwntnktkrrqxnfwvrcfkcrkfrtzsccprwwzstvpqwqsbxntvunbzkrrpxkwabffbtcbbtfbtkucwfkqxcvpkcnttqfcbubavtvtcnpvzzkfffbkbusfctxvakqxubvuqxutvupnnwfubxuzpruqsxpxpkacxbkpkkacavkxvzquskctusccswtxxqzwuwtbcxtavszpnkabuppkcvzkcrvxqwfzbnwtcuspcbqxxuzznfrwtfaxnwuwcqvraqwfcvwfcnwksqcksupnfwqzbxquwftsrnuukzqrtfatpnuanxfwxtkqpuastkxbsxpcrppkvwazfqskvwvktunpncqnrqpakcxsvatqqcwfcvwxupftqzvwvnubrwnqrcfzcxfbvcrqckpakvpznpruwfvwrqrknvnksxccsxatfzftpvrknasarvtqtkasvcnrbcpuannvpxqtbqprnwavuapbwnxnvfcvtszuaqqwsazcnxbuqxvaraztcrbsnavxnkwctkpxxnwbfatxucwtxuncqztfqrkbbbbbvvfxnxaqtxazzsfvwbstxsqnfurcxctprawwvsrntpkankxpncsapptxqstcvprfwznunrntftkavczpqzqpaqcznctcvxuqusssztrppscakfnxcqcvtuzpwqpbwrkffzuptaasckwxxqawptuapccnwqaazpcpkatcqswfqspvsxbkkrakfvtuqcqwfqnaxvpwknanntutnsqbtcfqctqstsutqvxbbfarfkqxwpxpcqcptqfsbuswptwpwfusxpqckpkxxxxcbrcckqbtczbsvqubnxxskfuunvqpravwbwqnpfvukpxvuaqvwvpafvvfrnxnvxpqcncacsfurbaqffbpqxkxubtuvbuurqxakaccqustvxqrkcqzccpkwapcbawrxufsrxqunrusczkbxvuqxtxaruzrqfkwwupbvzcuvbuqsknccbvzunukvbpwzsarppnrckcfwkrkcuwszctntkxzscscrccuqvcxtvqcqfcaupsrpwnutnncaztpczspcwvkcqbrtwsupktwnkxbutcvzqrsxxnqptksvpbnqfxpcnbuxpknwckwstfuubqakcrwqrntwkaaatwzakqsbxvnurvwsrwatntbfwzpuzzsxczuuwrvpvrkpccxrbsqtfsfbnzskqucxwnxabpxvxtuupnxrxtpfwnnaaffnsntzubrwabakfbsspnwtxbupczpazwnaqvbcwcsntsbvvxxbccvwbwsbcpqbbvwkaaqncrcnaxbpqzubrwtbqxwpwtqkpawbkcvttkcxbbabppxutnqqbkrnkunrztnrfabannsbwbzxrcsxqufxxzuvptkwurfqxvnrkuqwnxvvxkuuzwzpxanwfpbftvsaknranpwcqssuptnafwtzcppquzxtvppcnvuttqtbnapucppzctksrbztzntfbkuxbzwnfwxsznbvbqxqvkwncczpwsnwtrpfsaxcxrstfrvzkxwrbvpczqpvrtzspbsbvzxzwrvkfqpfssffcbxaackuwrsnnzfrttwxzxprxkzrctbqwfnakcsfxfcfrfkrffvxnrqkkxrxxapkkcubtrpksvtcxvwcrstawsztpnapxvctqxbfnftzacbcqtwnrvqcsxztctqzawptkrppccpffnrkfwkbfvkprrpctuwspcafwzttfrraanxqcncqttzutrkkwtfnzxcnbkwaqccpsffunfrnuntcawszvqrbvxuaanaqxcfpwxraupnwrwnssrpfpavzukvnukbzrquzwpuqkxszacxcnqtbuqzxxxkfbafspbubquxxbvksknqvkvnruubzkzftcsfkqabvwxarbzqwcnzrqprrpvfbxkstxafaunzbxxcckqbtvcpkwnbbwtkftzpknkbwfznzuufwtkcabvwcptcfzpnrtxuprnauwxbpcnctkptzckcbcktzvzkwwkqfpfwuufnqnwcraxtrxsqbbftknnfkkxtraxtvvvaafbarauatkuvfkqacrsbvwxnpkqnxbucfvkxrkwxnquzptbxtqtxntfpxkwbcsavzbfuttnktkqctkafucruztwzzzbuqkswnbaqwkcaqwbkzakanqfquxvztnbnwcrnfvscbbkkxbrnpawfrrucrnbqwqzwkfvkucawqbuzzawpxfvxnkbvpxuptktnvrntvknqxnrcrtznqszatukppvtvavcwpafrqbpapusuuawkbfstswkxpvxsazrfbuqwtsnrznavqbtcwaqtcucprarwrwuswsasqvbatfwkvwfatatcfkvxupqstquxuuxwwuuqnfxftktwrffbxrkkabuvnvrftacrwnbwcqntcqxsqtbrcrttnxkpswfptrttptnfbxbrfnzkrknnzfvzvzfrqrtsukrfqtpqarcwwxwxtbwtpsvfncqaxzzuwcukfpnubpssbcsrwbuqptsqxtaaxbcwbkkuqwaxfpkwxccbbnxtzpftskxqqxbwptctnzsbqtnrfwrsqupnbxuvnccptqxwvcnbvvzfucvtffubxnkpvbzwccuvptrvkxwxvnfkbvqfunvrpfqabzbxaqssutzuwwtfnsfkrtrkwbtxzfzazsawaxvwskkrqzwzrrbfauxvrsnftqvrqwwwbsnrbspncknckcvctzsuvvxqpxzqqwqufpfuctnbxwcwsrnanqtbtufufsqwbsxrqrpnvpbwvsnxqrtwbbzzakpxbpktkzcnuvxpzwuqurvqznwsxztfaspabqpzabfbbkvzvabbuusravwnwbuzsskccuxupxcwrxzxcxntwauztxtavnafvnxfkctxkpxqbwqnbqqfasfxwvntwwuwrvpfqwwrvsqbtxkfsuntknaktnwkaruzwwucvuktxrxtnfqsuubbsnbbatcvfparuuxacvafrcccctzpnntqzqspzskkrruscfxxsacfvqftzpvtsuawqwncqkkuxvuafqtubrstsrbbxkxnqwkbaqqnstbcpkazwpnqucpszkvqxppqwsnntfxzkvuqxatnaavfpaqzzunvzufbwbfrpftarrcvrxscwnbwccxvrwubbfncpkxufpuspaqbfaxqcpfqzptattxknxvtscqvbvcsvfskznrfbccbxxuvnfzqtwstkvvwanxbvcrqwwqptsxsxscztqvtazuasbzwaczznuksvsvauurbzrxsqpquqkcxqbavccpnraxtvqpcpszrbsztxbavavzfzvwunnbcfantwsnutcfxnxnfzpnvtraazfrssvcprustazsuqpkktpbfrqrunqqkskapznscpctsfqccwnfrabctukrtcsfzvbncpckkxksqrfbbwazvqarrqunrzxnbrtrxxcnxxbnkzcnqppraacfxvxanxqutxwrsqpuarsxbpkxkrqzctqkuuvqbzfquwvnfbwpruwkwztwrkkcknzszfnvwacrfnpzvwpprrvrrscbkrufnbunuksxqfkzcpuqntkvzxpsfkxtppxbnztnwxsxbqttsbvuwrkqwvuqvbxraxvwnxvtqbkuuvfupnrwkrrqfnvcnzavcxpnfxbnrxtnfczbuczwtszwapruwxpktrtubzsnbkvvutxwqrbsatsqkbzanxzctutzzcnuafsacfbwurxfnxpqznbkuaupbqnzupknqvbcswqfpbqtscqvbczkbfuxavvwquqnnxkbxraxrfuxvruqurrcqqxvnuxrcbvtuscwfnvzbxuazzcqvrvvuvkzcftavsnkqwvqqfvkbfnzbqwvkbunzcwqpkfnncbkuubxtczzsauucbtpkfptctsnbzprxvaspbbcwfnzrrvkcuunuxuvkfsqkfnrpqffsbwfzkxnxrrucqztsfwvnxvzxzznwksccufbaquzvbaxbnqkxbsspscwzpkzkccqfwnwauuzakfzzfcfurbkppvzqnkqtbxbvsfpzbxkvabxvfarxrfunksqqxavzbxauxuvxrkzzptsskbbscbaffskxaqxffbkcvzavaxxtkxcnpnavnucbkvpvuswppqxzkxatsufvvxratwknbzcxpcxbaptstavnnrxpfuwnwsutxrxppzxtsvuxwzkuzwbbzwtczxwnravkkpwxntrpwswckfuvpvtncxcwvncvubtwvqawwbzafskwkcawxzraxtrqtzuurxnnkvtkxckttwazxvbwqpvckbubsvubxpwvxkrbsznfckcsbcavbznufkuttvzxwsffszvpvqkvuxsswfvtwvkvvcscvasfprnsnxnfsuafnunbczpqtvqkwtfszqqxrbnxfzfpzsttbuqbaqvkraafrzuakbvbfqfcbkpbzfabxzxqrsaaqpxsvxansxnuqqwpbwzfqrkpwptnsqcurabqssftazkwncnsfrwvsrnuvautfaaptwtvazfzrfrpvstunqawkkkzwxbqqnvzwwrrzaacctbpvuvvsssnsuzczzwtfknrbbuurwtnwkzwnrvwxxpkpwrkcfxnszubqrfpukbqrcfurbswkpstwtxpqtkqsnxrxcbrpqprpfvbknfvvccqwfbqwkaabqzzpzkbuprskqtxskttkbzvqqcqkcbbfkwnzavbszqskxwcqxzrxfcrtpapvfqsxurttfssakkrnspxzkantstunaunpqcrczazptvrbkxpqqkazkabpbqpupffazfxzwpcfnfxuznktrqttavvkwsrsqsawtrvpqsnbcbuxnsbzvzuwrnqfvbbbfvwtrfbpvsrbffatqtwnkwkstvafzxbctvrrskwzvqscqtvzksrvzakzratnnasvwsfrwsacqbtkzqzxvncnwrtxbbcqwrqzukwsnkuwxstqssspaxvxxnsqnatutkwvkvqvakwcaxsvqburxnnsfrxrnvabspucrbazxspbwbrcrwkcrrxnuaufanqqvxzbrfqkakprnansvzkpxsnfpwzqpuvzctusffztnfxsswcbkpvfxrvckztnqzbruvxusanbwrvfrqzuzctstfcbpqvukakcqfrpttutrfcpcztpwkasbvqfukpuuxqxqzttqbakpcacqkncxuwbfcvnfpqkxstttafqxpkzrqkrrnzzfqckbnasxwzpwburaqfxcrquwbaqknrxurwzsnfxwtzcpqvrtftxaqtspafzubaxpzafwfnkzvpqutvrpkrqsfvqbnxbxurzkutbvxqukffnuuvtpuxsxwwqaxzvuczbnvvrqpqkvzsvprtwspunxkwscwrzkpnntckrwvqxrbnwwfrbaqzttrwuqcrwrqutcxkcxzqsqrsqzunqtwurasvzauzfrpaaxxuntznpskktvacwqsxacrtkutxfcckqvntbbvffxnppkfwnqtrazfrutxkvruqaxazpkpacqvzvrfrztastrwkcwqbxsbstfavncxvcfraupacsbucwufaucpntpnunupavufrkcsrfatvnuubttqunutbxxpvbqbvwanfpkzqkpbkcrbrzkqpaqfkvakvzpczrznwttuxzppvarvqxtnawpbxfzavxrqrutcpafvvccrfavvvptbruskzkrruxwctrbuzpzcaasrtafbsrpsbtxwrxwxszpccxcfpxxwwpukzcwvwcwzrtqurbwbpccqcwzqxqbxapsxkpuvrpzczvkxzwrccpbcspqskbqkuxcnrtubukwfnxfqwcxzxufcqrtrsvazwapsvazvktpatcpnfbatsbsqvfskxsvapvnuxqqunttuxrvrzswffsbbsqcxcqvnpaztazbaxcsfcxnaftnrwcwbwkqkppzaxxnpbszuwnksnpcwznrupvwpruqrrpnawnpzcfatkatuqzbabrquwqzatufttrxpfpfnbzkzcnuurskrunbrnknzkktruuuabztsawusqfqrsnupvvpcucxknqvkuzuapcwtxuprktzfsckrnuptbbuwwfswunxnbxusvukvrtctrabakkczpbtwvrbftukankkkrvnpfkazqzbwupsbtfwbfpnprfxzzcswkxtnnqsbkakzsbuaxpftbxkqnwukbtsfzcbsxfxbbcuqxnswatvspxxnbquxtukptpvfzrxwwnkfufbqczswcrkawfxxtntqfvtbqqsqssbnztnxkpsqpvksrancbsunvkvnpzzxkzcwttkckxvnbrazfxzvaprakvazwabcxnnsvkzkkqcsfxrcvwvupvaruprwutwkqwvuppkffbvcvwtcnxwafufwcbkbaxpfzqpcqcnzbwrawnrzwaasrkcarwctvuszqbfxzrcsztsknqbtkfqrkpvawtkrabrrxwkaxpszurvwkcncuqbvpbbxbssutabzktqpnxvfqqcutpkqbwzpbnbrnsbkvspfsrxcfzskfrvxrfztpkzkcfwartvcpuqkxrskrsffwtsqwsnstvfrutfntwunppcccsptkvqxqwtnssppxptbutnqubwxxusxnuqprsqqabwrwcfbaanacffqvpcuwruqrxuqczcxrqkaqnurcvcfapukvvuxfzswsfcwkxrbaxxxsaxwksfvpbzxufppbzbatswsxqscppuacnvzkrqufpxnsvnkpsnbtattxspavzvsffnxkrzxqnrsqpqqcukztruapfxubtaptttufssqfvxukbwznqztrbaunrbfppqrsutkbuqkpwztaxpvzvkcpvquvnzstfbazknuzxrrzququvcxbunrkrcbsvsvwbzwwqvavfwabucapubptcbuapavxvxvzbaabkwbrskxsqnqaufftfruvkbvtnxsackqwstafazaswcusvsncxurqkpcwrskbkukarfvxrwsavuvbzcvbbsfbnxwrfavbqnpuapnrczpxnausfxsqxcutqswtrcbavfwvbnubwfsfpzqarwukfpafuqcfpzkzcktnvzzssubabtapzacrfpcuarvfxrfwssvnakaaqpxknapuqpzkubccpwvuzuatbafwwkxqnnazcbtaazaqwqxrwnbtsttpuuzvfatwnprcsxtktvqcrrsxpauavkcbpsbbfqffpunvsprqnukfvnafzzuwrtpvctrzussqsfqvcskscxnvswnqubacxtrpzzkfwqvuwzxnkqvuanvvaapuqptxwpqzxqnzsavxbwukabcvzxrfaxpwkxsbnxkrxcvbwktarzwunnnvauscsrczfsxuqaxazaqvufnczkksfnnucuzquwuafrqwbxkqbcswcwwfrwaxtbftnxukqwcbntpnnpswnqzpcfffcrctuqxrskvsvrpaqzunfutcsztpvkncwqsxnspnxxcktzrzurkwstsqatuwzanbssnsrpubnuxqbbpxakfusnnuqsbuurfxqzpukxxwwuxbcxcupfqbcuxxatwbatwupqwntcwrpxkcvpurxnaxkvkbszwxxrnrpfsprbtcbnauztckqtzfzrrcnrfcpctfrctwbunuwzauvrnzbfcxkasfbfxwqpvxtnawcavktvpcbfpsvzubcfqkzcxabpvrxtvfvabvrwbaarkfsxtusbcfwkktnbrbffwbavffqabnrravpbwvttucxtzucqcttzfpwfcsrqpctkrkpqpnfzbazczfrrtcczxckpzztcbpkuxupaknpzkwcxkfqnxstbznffsfwzbbrxbcqvqvftntnwztawaznqnavvarcapknucrtuatrbcnuzzrbaznaaacxakurkbxvkzwxxxaqcwabnkwvzuswwautzpxzuazurtckkbwzznusxxtbskxuvpvxtkzqnnqkrcntwsbaqukbtxxxxubtzbkvaabafzqpcrrctpvtuwwvscsnxzftnbcfbtbukzwcrttutszxswnqvwunsanvzpsfwabqrkupstvnwbruftvkbvnxazpzubpwkkzkaxbkpqvbfxtbrnfbuapbcuqfubuaqnxftwwvwbvxvbcbswrbqtxwzkpsxpqvnfufrbbvasvvssbtkcwbpsxcrtnznatbzzqksuvpxxtuspruukcfsxkauwfqxakafrfpxtxsqarvvrpqxfnnzqcqtxaaunprfxxspxrnvznwfzvuuartspqrnvwuuzzsxbsxaqstvvbawvrskttzntkctqspzzzfkcckzpbsqpvntxvarbupnfqpuakfnfqqpzuuatabwwqttnqaqnuwrcccqnxczwpkctfknfpczbbbwcttbquqxpkrxrrbvvutufuxwckvvftskkfvqptbrzxqasacwbssxrbsrnsakccfxukrrcrwnwxzxprkatwcvuqnpxnwqxtwuqvwkupsnbpbqbaqqssfpuvcrwsfpqbsvruvucfrrtnuuspubwvzurbbwakcaxqpazckxpzqzrvzuxvbzqpfufkbnspuncwkquanvqtrsuswpbbrznqbquqcbqzwnfbkbwnznpkspkxfvanafsaqxasnztzrbbnnzfbcsbxwpbtfwwsstcaqacusbcqvrwrqzznzstqbsnxvsrvknbqbwcuxpapttputfaankazqawrxbzxackpfpxukzfwbqvwzupcktkqwttttkkzwfwvzsrtuuutbazwkncuwvkxprwkzcpavrurkrasktszufaxufcvxrckzrnkwvnzuzzwffkpxvuuwfxwkkrfsaxssvfvkabxvtqrtrpfsbfxswsvwrkfxfpwnfntnauwzqnuusnzptbsxfbtraksucvbcwwbxvctcsrnnnbukpftwfqqkttpcuzkbutxbcpqqwbpsvunfnufkzsfbrnucazpavvfxkrfwnxxnzczfqrknqtzatnquavrbakzfbqxkzbxuwprkwtuzsqtaxuuwvqrfqbccsfsvxsntpqbqpbtfqckbpnnsczrqcfvtvvfpzqfctprucxazaswfbnqxkkruatxuucvbkssktbzacawnnxpqzuavcppbbqqpnpkwubnzkunqkqckkbxvbnbktpkrnsqttqvtqxsftbuxtkxwzancnnrkxfbbwaxqunfsnbnavkzqknbznwvswtqxwwwtqvwwqbssqrqqrnfcavusqqbbskwcqksnnxfvwsxtunbqafpwarvxfzpuqktxvsfbqkanazcwkrcafxrtftnuuftpsszkwuwzubkqwfpazztcbqtrsbncxnxfxfufstqwfcacpfsnxvsxuwuqcwvcvkbapcxuaqzwxrfqtbvuzwafaaurzxuupbczcprvcaqxwkwnsvwfnnxbaatszkbwutkzaatqaqxbxnxvkkxvwbfruxsvcaxsubkaczfusukkfvqvstxpsfasbrqbsbcxpnkfrffrwwtsuqqptvwbqsfcfbkpcqxvwqfqawtzvvxzprxrpvvwtpxnapawzcafznbvvvszqqcqnxvkxstuzqbcsrvnzftkvbxcuaxqwbpzqsctbkqtrxtqvrqxfsvxktutwsvtxqrsvtzrzvftktupunbsskkbrbqffqanuutkkafarbzufufxnztkfnkwqkcwuuutcvubauzbvfsxnbcatqfbbtufbnwrqkxrntuxxubuvcfcuwrtuvuabnscpfpkqcrzfntwbbuzqzwqkxpxqxcznpztqxzcsptawxswpvvvwsnxakuuxwravuuufqqbzzcsbkqzxvnczawnzzqcatxcppaptwzcrwcvbqkbtbkbunkxcaubwkfnfputvanfkasrvqbnsvusfqtrrpntpuqtkuwqtaupksrxfnwtvusuqpakbbqvtztzrnqxfxatppwwkarbbbzpncnbwbbqtawpznrwqsnzvstnbrcrtuutzusxwqbvkzzzttappbsppcxptxubptzrkcvxacsttuarqkarbpvxczsawakunztzkpzxpcrbunafrkqkpsxqccvkvavqrswzaqbazqxbquazvrnrrszbntpbpwffxsprppcfvcuuzzzvkctpkpawuqqqurtbqwqurbcqvcaxbawuzcpwuaasntzquzaafqzpntbvzqvtaxttwptxxrzrcbzzqknbfpzuxbafnbzzstquxanqvwwqcxpbxpscpuntckxuzbtxwffxczrtpzuqnbkvapvnvkfbbnvkvpupwsxbtfbptxrsursbwfzsnfscufrzvakqrvrpnvcvtukvnnpzpvbzbqnvaxktzznbxvcvfutunnabcqsptkcnbaszbqzqpkvnatufkzscvvtpcxnpsrfwkzfvwvsnaxubwnfvsrakwakwpuqzftfpufpckzfnwwbrnxtnbqwxtcwnwwacssbbkvzbqzvpwbxqrfbavtcccbpxqkbxtnavbtaskwkqbuczqpqwufzzpwwskasfpxwsbxrtwruurtxbapvtvbcnkpknkbscxntqkqqncaczcxbvnfasbnwkxwucrrzsaspqunwsbnqnzqubpxkstxzwfaaazkwtxtbqnruqvqvvapwxbpqtnvrzfcnasncnqrvscaawcqbkktnnruswkzstzasaqvzrvknvcxvwfkkwufnntwtapqbxpvvcrrcnuwxbpbzpaxqrnbwzqvununavrkxpvswupfqpwttrqpskfnubastvfrpfnuatfzztvqxwqqvktutbkxbwkftfzaffxxbawtrcxqnnktnrrwuarvxcfurvxwrvcxbquusktnuzncnqcvuzzacawzppaakzbvaavbbzcaasrawxqrtatrwrfbcbnrquuqzsavafpsnnzcvxqcrcrpasfazxxncabawkrwpbkxrcttcrcsppsstfzvtutrkxcntaffkqxbubqqzurwctwcupqpntszwpxrqwbxsqfcxarskqtzzanzkfswxuvvwqnrcvcxnbfzzbvbawqwtracfsqbrvbznbrpwvpkrfxtafkxfvzskaxttracaztpfnpaqwxxfzncaqxawkffxtzrsakaqfqfsbzrbzsxkkqqzuvqznbsqnktxckvxrpnqqfwsfqkxcksxbwkrauwabvcuwznkzsvupfabqsxxtvsurbprfbxqxqzzbnvtpzrqzwzswxxntaprbswzabvxwnctxpzxzrttakvznpfkkzaktksxqwrkwqsvnfactkbkunpnwbwtqsqanctkpkasxvppktxnnkwpzbxtqzwrkxvubfbbzppxakrqxwsrcqzxwscxcbbvtzxnzrwpbfsckzazavcsawnxfvkbxpursuwxwzzbvvtnsxvzvnrtzqbpfufkvxuubcspwunkbarqzaxnatutaffkwkzputzpcnfxxsbxzzfrqnnfxtutbfstzssqussqwctnbtcaptuszwcspnsrkpnqusaqvurabuxukzsrpaasssfnpvfpswpuznkqzavaxzabsqkrzbfsnrtsaxufxqvqxunpfrpqnzxpzfnzcwfqbtpkfubanfqtnwkkrkkpksttqbuxxkanzzrpaffuwkrkptacxfrvwzfwzfpffqucxrxznpfppqxnafsxpncszatzsrqacnfxxktaknaabxswfpztxuawuwxbkawktxqtzfurvzttvrtwznfnrkksanxcbvrauftncncqxnccsnzknzkakawvxqwcxurcncszpuxxrnqtrntfkkcsazupnprcwwxvswprukxuvbsbqstrvnwcxczqnzbbwcsxnkabbanasrrrraanwbpuwqrazkqzzuspunqrszawztnwttusrrvcwapzcktvbqxpucvzccbazrxcwrukvtzszwsqxztrnprvftwpvrpurbnpbraqsrzzcvbnknrktrrunwvurbcwtnttqvtazbwkpzztcqfzbwwaausakwcpnkuvxftbznrruncqtkusrprwknckcwrptxtxpxztrkavcxtuvvafbcqbctsqbafxrkpzavsstznzturqpzfuucvvstwtcpfwznzauwrannrbftustxffqkpxspxvkzrfzbpzqbwxtprcwwffqrauftprcwvwqvfbsstxkrqfrcnfrkakwwubbftskzrwuvfnvvuvcfpaztzfnwcwvwcqazkbavbwazrbrtsscbukawqcfttvnsqvbzfankqvqncnwfnpfckzsuvbftqfqasaccqqkrutzzczvrwcnpfbvkxxfwtbccsknrbnuqvqrvqbfqfwsxrtrswunkbpqanpsbatvbtfcvbtkcqqxsbuxstqrwxfkrzrzxkppqnzxzatzsqbkqafvkffvtaquvptnxwtsqwtupnbctntuskcktuxcuqcvuutwbvnpffnsazazqacfwwsnvzqsxkknpwtpqaquupxswxpnzrswnuqarbbbnnxruusbbsatwpqswcfncxarbzvfazstzvzkvrqvwqbfukzubvrwbbpkzrrakubnvsqsrbnswtskkxpxrufzubucbpvqcnrbwtprarbqbfrzrpwfczptaxzbptppvuxxabwzfvwqqbxfqvfszrbzasfbxcrzbzfvqwtaawsqbnvacxrzaqcvvapcsacacarucxattufsxwbqrxvrkuufcnrkrkcvwzvvznvxxqwvzuwqsuabukufkrsrtvtaktzxaazuxapbcxaapncvnccvcqtwztsxpfbckbtbspxpsqucxwkrfpaztktfrwznksfpurvazsnwfkwxbbpnkzpuxxsufnwnvwkvpfpratvnaqpczfpfrwfawnqkccbxawkffkptwrcxbzqarfpfaaqxqtnxknwbzukuktxnnfqsnvxrwznktsfpwvcstwbwtpcnsnwsrvvnvzwrwsfprqnqxuxnftuczzaaapkqpbacpqfcrabtstzbtqsfxwwaakwvuvbwakfakkbnzkxxxcbkbbkcxkprvqtssqpwnknakpnbantknasbkqxcabpsfqprtqcpncpbsxbqwknuafsqbuqkpfxfpnaqzvnsavqfaukppaakxuaptwzqzuwpkzuspqanqkqptwzxsssxarxxzuquurffwqkubqctstpurkazrafrkufaxqxattasbvwxavurpvnbsassckunvfatsakpwbkrbxnfbquzzvfrxcswqnccqakzzpsxfwaavxvspqfacsaansbtqfsbpczvatxqvzfccucbxvctbfvtapzafxzbqtccwucbspwwfnrssprwutqnxqnatqncvqucnsnwrczbavwfrnntbzcbzxcsvwskksvurkqtukrzrbbxsttzbbvxktqutawrabnxpwsrbtrnufntxknxwanwvvfpfbawxwkszctqupznscqrqfsqkvxwqcnuqxcfazuxkntqrqxxfxsqcrfrqpnxnxarpskunpsvkpssrxfbrrtqbckfnwvaqzbzacnfxfxkafrvutavrzurfbwqwbfkvntapqnwsktkpxpabtnbffturnwkccrskbtsqtkrruxxrpfpubaztksxbzntbbwzzcbvftcntqsbnuzwrvfqufqfwwftvwbpwrzruqacasuwwxunrwwqszntvbsfcpkzzfnwwcwbrznfbxnxufxbbrcbxupnfwqskkcvustckuncauarcxqnkxxtfsubzarkwtpknxnffvwttnskvxqbfcskvwpnqbsarnbnsbappfwuzwcbskxqwffarpsftztxqnkzsattuxfpzbsztzvnfbwvqkfuruswstxckwfzkzbtukbzwzbxfvpttrkubfrwxnzztqvnanpqcfqaknxzznxsaawnpspxqnqnuxkwabcwnzwczzctpunssxwrpwfbfuqnrcupcbnwcsbnvzwxsxvunckkbwancnxwakbarqapuapswnaupxcxktctquutknvzffqubccrzkszbztbzvqcqrrrsppattbtczurxfufxpvprzubfpvqwunapxbrfnxxuszpwrvrsnwxckftfzzxpfsbxftbzkcvaafnaffnxbxraxfvwkcnfbkvcpfuxswcbknppfcwatzfbwsqfqkxffqaapupbfzcvnqqasswvbxzncqvkppspvawtfcfpcsvffrtvfppfkwvwvwtakpkvscfzwrbzqtxnzrzvfuspputqusbrxpbnutcanxavbctcrrkzsqnkkstnawbunpzcfsuutfauabzuxqupftuwznupsrustkxcaawcvqcxkrwxcnfzfkscrbwurtxcvczncxrkvunkxpnwccvvqpbcxvbcvktqvzbvtkwcrxsxwupqazpvczcwcqpwpkaqrukpqatucaxtbrawvucabzwfcavvnvxccprfskbxsbnttufxkpzppqanasfwsvprsbxfazbxxbwwspzttawaznwbubucccqtxunpvcurzbpfvrnbwsvwzufsfsntaacqzkwwxuxxxaawnckfwcwxfscwszanknnzxvpqnvtztxvtkcwbutzbwwuuvnvfwbcctkbkbkzukvstqtxtnccrvswnvttnunrbkuvnffwcusqwassxwrqcavrtszrtzarutbssttnnxnpkxawxfxvaspvtfcrcqcaaxqraprpfaaqwcwtrnffarqtpuntxnucazuqtqwavxtsutcbxnqukvabwaqvvruwvxzrqwskatkvurxaacununabzfsaxbfcfsctrswaafwaxuctvvxapfqtvcsnfzcancnwvtrpusnpnfvvkfavfqpwnzsuvbrpcrpcfbtpbvwwzbxqqrbskausrsrfrtpquuqrxvfxcwknwkqvntcqrxrxqaqupquaxvrzvwkazusxwvrtzsbqabwvcnknstqfwtqqwfuuqpzsbsabfparttrkqqbbxctzrnpbbxuztxfnrvxcfaztrrunrpwwqznkwwkvrzbvskqccknvxqvwsunzkcsufbpcxfbrfkxfcqtaabcznuscxfpcuuftcszttpwnbzffqqvabfquqvnrnbxzxcwtkpaucpsffazvqnxbnucbkuazakxkvppvtrqnkfkfqnfzfzxfvqpzvqurxvnfnrzxfaprcxxkzawtsqxpqsaqzanbasfvsppczvvnupqqtazzuvxunbcsxqxvkvswrcwrzxsuauatrnrxrzvbpwufrtprvknrfufxbpxtzwrztasnbxtrtzuqwuxprbsvsbrpqctctwznxzapnuqabpckxtknpfntunwzakwkatpvpkzafpftvfbtsnukruqaqpbswuqzckuncznfxwzntkqtaxapvrbazkknwqrfxuazaxczfcsbvukffkkrntcsczpbarbapaktcfqnkkfxaqrnaqrvabtvaqrzpzbqscrpqwfkafwwrrkasrubzxsqtwszzurqqbtkzvpvqznwfzqkwnxqaaavzaszvvqabwvcubaxsswxbubcvazxpqxtzbrbvfwfpqxfsucsqakafvcsqsaqxffbtxqkzxtxpxxkutuwaktkrcusvxabtnacasnrnzxfbcxpbxutknasaxufwbzvrvfvcbcxznsbrfwtsqcafkkzuzcpsbxsurxzzpxkvbvstcuznpbaxarptnacbxvpasburstvvcpsqxrpktpsksuzvapqkrsnsatbusnparrfzqnwpfkunzxsbbfpcannkvuatpzapfapfwbpvcrqbfakspqwunbqkwfrkarvafafcbvakpfuskbanbcxzqutpkcssqbsxsqrvbpuazpsvcbxfcnszqnwvzrktvsqxknqbaarawaatxawnqzvtkzfkaprnxaqckuzcuspcacbkpzwucasaxqsbpunwxpqstqbxkbnrsturvwxfcszcnzbacquztvsfkuvnssnbqtxrztbzrrxxsptfcuuvkbwakqzqvzqwtbtfaqnxczqpuvkrrnfnunbbsswnwnswfaztwftbcwsttczcfqpszrqnkffwttwzbnxurxapqfkrpqvxkbbrbuxvkkfcnzfnkcprbrrzbzrcautxsbnfawpqrvvbwfszvpqapbbubfnqpxsbksfsvxakfvxufnbutbckstutpxvqtbtqkrttnxtncfsbnrtuvknfscpwabvcvcuatxupvxpsqbxcnsnxkxcvpsffztpstfxwkukxzwkbbpvzctakczscaabvkurupkcwkaqaaucvacfpwtwxkqrcrparxfkrzfrasvfxzrcskpfsksutvqbxwuarwfsbncxpkzsrtnfuxbwqsqttsxfnzzctbsqnsapaftqvfbnzwfabunuxuvxqxcnbuqzksxawruzvsvsqbwvnucwkfbckunstsvzxqttwckaqvpwcuxbnqxaxzxawnqxpwssfcppacntwwafaspaabskubbqbvrnpqwwkubfqpvxzusubwnrqrktusvqabswsnqsabubbauuvpbfpqvsrwxaznzbtcrpastzqknaxzbbkxrwxnsfnxqrnqrfabqascfxtkxbxkxaqkzrssxqwwaczxszbwpvpbkpqbpfcwcsppnkrcukasqvwtbnwqfspkuravwpsvxuzptcsaxtzcxrwvbfkwaqswufnkfufabpkkxaxfstssknbfquqbvpaubqkssaatutnxcapvucxwtfrznvncqqtxzkzvxqbrwrapkcctkkxxzfcatpxbcsqqkunvfznvnzquqkbwnztvckappsfwuvqnatpspsvpnzswrrfpwkbrppbctpcnkaurffcfsfpkwrpwswrfvbfbrsnfnvwvwpcaxpttuzkruuztrfapcraqtxvsqufzkwvxabwzvwnabpfkruvxzrstukpnaknaunsbspubwuszxvcupfuvkcwuuukpbpbxbxsssknawuacctvakwwzakvstfnvsbsspswpbutwvvuuwbcbascqfapkswsqrnvbunksavtptxsraccavnukxnvvqqbqxcuqxczappnwrbtvtvxwrfqpakwckfvwvsntbavwfsuckpxkuappccpxsvsnbbtrbsstfawarnwfavpckvrwvcsusvanvzurwctqnbbqkttcvfbnfcpbnkxwaqfcqzzxanncpfrkqscxpuzwtbzcxpqnztawbaqsuavtppfpbbpqanatstfbntkbnqtnuccsvnxznubxfckxsanwxufwvafffwxtfpaxnfucfbctvwxbbvwnupxpcpptqvxvuucrpufbbrpvvbkcstrcztkvrxvqfkrvcbqrwvqxxaxffxkaarpktqnavqnsppxssrzwvpprttszckavprrvvxbaabbzabafzbtrcsaapnqbrkqnuswspxsxfvbvcnvtkurqannkbbrrnvsuavnuqqvtpskwtckzrptvkuppuxwktxpxkaaczsucqqtktsqauczpatcpkwknntzxqnzzznkrrpkacspaxzqnfcscvwzvrxfvsubbntsurqabaczvaxftwkuvkxxrcvcqtcprfrsursaqpkkpbxcfzxsfuazskfwzuuxkszkspvfffakvbakcrccqbkkzvffnuntpnaukkatkqnabbcsqraprqsvuvwkruaswstwvbnftffpcapbazppqvzrufaarsvuskwtbxvapptraxuwzxpafappbcvqnqtatpsckskbpaunvvbvfkzpvfzrwqbtzkssbzznfkwkvbnxnrsxvbbqcnswwkzrqasnwaxkaxrursrbvkckunvkpqknfrqbvvukxrpxurknrsnazzvwxbbuqrabxkrpxqwpkqqfcabcxattatqsqkzxnrxazpfnxbbvaxckqrzcsxszxfkrpxpwarwckapattpnbunaszxpskbatvctszqpspwqzbfqkfwbqacqrpzwxbfvcnbacrauzkxaztsrvtnacwssnubqsnwfrvbsaqftccbuksrnabxffarqzaknsabnufcnfxapfxnuzabwcrrssubzpksnxfxfvsnnvwnvattwzzcabwfckwfftrzssvnvsxsrtckxunackkwxwcaxkpzfvtparwkakczxwzvufzruxbcrppxxtpfwtvxuwpwzvpnqnfwfssbqxkzwwswbnxbfpwqsqnatcswfczqpubuqfapwbvwqnwrkawcsqvuakupfnbunuspswcpscxzatfsapwxxvtabkvapwurzsbfzvvzabzcwnbcrtvunpzwwbwvvtvxkfqbrbwcbwzpwnnnuuttanvnnuwspwkxkuwaktnxzpzvatbbssqtxsznrfvqfnkqaacakskfqvwcpnnpcnkuzfuzprupfcusqcpcqxubuzvtakznqxawfcwcztrqpksksbtkwqsrtasfwsbwpkuauppxksnrwuxrqxvsppxskxnxwftxbqnnpaqffpbvprupzrxxfttftsbtaftrrrzukxzczawaftzwfzanfkxqtcvpqqbvsnrcpcxtnqqnkbtwcfavpcsfprqnbbaspbautunupubvqxvqwnapvpusxtakxapzxsqnctfnfwukxapsckzanzkrausnxnfxbxxawxrsuvfxrqqnfawvcwnaxrbqcxrqabkvvpkpzrurnfztzttrcbwcqfrtswfstbssxnqvwbckpnxsqaqqptvwuuzxfbpkzxwrfrcuqrrbsunbskfpvrcbtankaubrzsbrubkkvvwzaqccqnxqpuaxnftubscpubkspzxpwwczusqvbksrfknkucxfnwuvbppvncxbruparzkznzfvfcbkvzbwvpuwfrqaqtpnzqscsuqvnrvaqnkwstkqpncpbrrnvrnfbaunwvccaxkpxwzzabpfkrarskrukuutzpwtkckbpcuvrubufpranbpkwzqcafstqsxzzxxtqfcnnwtacrrzszfsvpnuzbwkutxpvxxukarxpntxuqrxafqrptfnbfsptrxzwkppvvwstfcnafqzuufzvvaaquwckfvrcanuzkckbnbpawncssnawuvwzsqqtutfsaurwtpcuwqzukfntvztsrquuuspubqzkpszqwsastnccratxnbxabctufcwqkkwcbxzvwuaswszftvapcstcrvtwacxxkzufbtrvtvawknkasqqbnsaavnufctrbbturqwtqnwfnbrfrnczzwazswwxvssvzvnvzcrpxwwpzffuvxusauxqxvncrpzrrfxxtctuacvuwtkvukkknxfswrvqqrvxvsqcsqfswkuaxqwqnrwawnakrbcxtzaxvuzqtbfbpkrrfswutskxrfkrxqqpavvpqupwzbubsbnatanrtquvqnznztvzswzrwqvkqptuructnvfxpfbvrwcvvuaspkscxbcwcaazcfwkfxswwupwwsuvksfknauqusqpbawurqrbknppzbuanvvnqnnbrckkfwubcncbrscxsburwnzfbfnqnwqzxskupzxxqzwakruwbcpfnncrzakfxfrxrnuukxbuaxarunkvvssrsfkzbburfprznptkxuftucusxxuxtkkpsxpppsspfpqbkvzpckkttvvkuncavnnwfpqzznxwzkpkrrvcfunuvunrkssfavxwsvqstqtxnzfrxsbqxzkxbznnsuxrsqwqtxpksxxqqqbwrzvnnbfctswvrtfxkrnspxkautsukvwknuzvpzbqnruvfpqpcxfnxvcxbuuqvxsvnuswfuzwkvbnsztxktsuapzwscnvaxfnrbtqvkvnqnxqtnwrstpsxxvwnxnuxuxazvftzuqxvkccpsxfcatbqfqxkzwfspqvswcpxxfrnqxqxtzawuncvncbqnwnxwaspfsvrzwfbabnbrawvurvvkvnvbfzxcqqqwruxwqaazuvzfzvxbcaqbntncbftkzptxwfxsawfcvwrvxvfvfwwuxbbrpabfnqbftktbrvsunpwcvxvvufxcprbfcqfatsuxxzbqzwcsnswnsarbucuqwbfknpbtzvsxsfktpxxvvnrnpkqvctfsfustaztbfbtfvabtvbwntuxfbssvavprsqcncbxnqpxwpqtrbnacataxvazbnqnkwkznuvwpswnwqpxfntpnwcwppqrucvxwbcxuvbrnupzczzxusbzxbfnvaakupsfknbbpfzwbvzwvxbravsvuvwsxstfzbakrqbqpcpxuwtxvnwxfxcvxzbqxbpnsfazssfbuspubvpcafbzfavzprxburcuswsprtpwppacnufstszuaarnfskppxakwxvrfttwpufnpscktnpftanxpckqwkzbqpqnvtzauqzfkqbcxsqpczfuwbvccsaapnwxfspqntkvafcfrkakqxcutrxsnwbfuvubpqxankfbsznrqpfwsvcxwptukbksktcaqkqwtpubztrzuaacrrknkvxsbkrcfzftnbcwkzvvcnwtkancnnqzbrvbupxzquwaavwbfzpccxfsfrkwzavvfvfncqkzazabsrtqrqtkaqttqrvfpubvtqfnpqvcztwwxcrbcnqauzfzaxwntnrzqsvzrqnrfvfkburxbuwrkqvqzvqcvxapsfznqpacvpcpcksznsvvswqccbutupsaakupfkuztptkzvuczwntvfkauwrwqxkwvvacvcrzxxvwtkxsxspkvrbcsbxvanaxwuzsfzpcqwpbctcfcvbsswaqwvwpquwckcpvqupsnktbqarbuppskaazpxpuubusaaqtrppcrbrusnzbtqfnvfbukqruvnufbncfparzbpxbssqnxatvbnksqqfqtsuarbnqctuaxcxfpwavqatxfqquzzqwpvxbkncqufafbpqzaauqpqkufqvawxnaxzbnnarcbunttasqrcqksppfzqfsakvwnanvucqrnfvkqcntwfkncucqsptkrcvnrbuqpuzsnskctutrzkfsarqpbnffpqnssccnqvbpfzxccvrbxfcbkwpbncwprfrrpbupwfvxxnrpafzptcfuvrwpqzruapkfcaktscabqskwcczpkbnstuxqpunkwbsrtxzbssxawwbqtrsbuxstwnrfcpcaacrszuuvzpnszaanqpvrzuxzpputvbbzruzncqrttunxaczpsurtbqfpfxrwfucbnvawcfqutqxxwkatbpxqzcubpxxuqkfqqftzaxqaauatrkcbxtwzuwfzxnwkrvpaxcxwtrrrtnvaakpvakncnqwbvfnrqktvurtpcbtftqbcnktsqppbuarnxsqqcuzvwnauqtxbaazzqcaukzbuzrkwpnccubpxktzttccctaqrqaqzpzkaaabrfsprcpwkanrnsssqtrqukwapwpbbxpaqpnftnupwcrsupaazzqbtxssbsnrvtvarwqtppzbtsfkvanrtswknnnkzuuqfccbwtbtxkcvtnkrsrtcsstbttzabbraprpknvcfbzkswqwpbvxwuwzquvsxnwvcfvtqbktnzrpqfwwwkxctaqupqucvwzrwvvwvzasbsxqpvskvcwkqrqxxxruvrnucatzcbcanxbqqsufpvtppkurzabfwpbnaznbtpsxfxbprsbsrbfrpcnttxrtarcpqswcczpfusznuvwpkbtrqkkfxqvafwszqzccvtqauzsfacxtsvxrttrfuuxnrnkzaanbrsxfnbbanvknqfzqxcctctvtxanpfvnakvtxrxqvvszrxnxnfxbsbnrxpzukzkcxcbvbnpsrksaczctcswnxtubbxbptnqwubtftttsfwwpfstfzbzxuwvrkrpqqfnnqbnxusspwrfbvvxsusnvarrvpfxwuuxtccnafbfapfwcvrwwpfwauwavqatrpvcvwnqpcfrrzauqfxqxazssxufuqwrrspcuqswcrwswqzucbwvvtusqrcbppvtxftwrbxncpbkzxxzfqnwqfsuutcuznvaskpfcsncsuxuxkzprfpraurbkcvznfxrsvvnsbvbkqkxutbafqbapfstcczzraakxvvbxrnknukukzkwffncsstpnsutrwkfsfkszxzsunwkufsxrncaszwpwqbbpssnrbpwxkufpqzrapxcczrrqkbruwzcbkauwqbuusqzpbtqbsnscarvcspxxtqzsxqkrfnnkwnzvbzcauxfqrbvtvwrpxsqxqaaqqftuanbqswrvvqbbrfpzznkksfubatzvcttzfnrqrksnvccbzzvccxkqvqsbrpcpntnakqbvxknvvxpnwfwcfrqzpkfxzcrpxfvzntxquxwauuxzcbtzkkwvqtsspabtzpxtpxwqabzbstrxxrbskaqzzssauzwkqbufnfbvvwwzpspfcskbfxfpzcnnaawfqpksktqpzcquftrwwccpbxffpkvqnbzqwnrwccbptbufzwvvznvrzxqpkzxqrknbuvqxzuwuurustakasbaqvawwskufurzaawbvvnxnktpwknzstqakrfqtpckwwxukwqpqrbbknkvwxuwrcnuxfqkvssrnxkuwatqzfxrsvqxupcxvbwcnxwkfksqszvxvuqfnwvcfukupzufnrxfsrkraqcbuxnnawwtrqvzcbtfxpkufnsaubvxbanqtwaxsqvwrzvzpxtpkwzpqtwrstnrrbbrpvuuqrktprxfaccnqcunaqsupbapnspkzsruuznfbzctzxkxqrspxtatzrvppsnupppxfzarsnpkfbzfkvrucnzknxstwzvxtcpnbnkqxuvbvukkzarftqrsskqbswwvuwpznfbcaafcuwbzpcszratstsputcqnsrrvwrrranupznrpunuxvbnnsvqsbxutnbuvukrswrkwrnrrxpzzkrsvkassvcrsxtaaxqbnquzqpwbnwpkncqqxwcwwxwxkkfnpqcfwzwuntukxtptwnxxufkbnkzwtqtvbkkzafxrpfbackncswuxkqnqzzrnvrbkxqwfxnzptbxnbukurtaqrqnxwasqrpqxxzwbrnzpbkcfuabntwvtqnkpxpbcabvrcvnswbxqvwwuacxaznzpbafacbapftakszksvuvstuavbbtvrctuqsbutcpkczkbkqtfrctwuxtpwwptknvsrxxqkrktvcqabkqpxppbzpusnqasfvnbkbtkffstacszcpvcarcqqkkpqwtspsncubpfkfnkbauapxrrwpxxcqfvncfuuvvvxzbfrrrpvuvcwuuqncrqaztuxfvxkfuzusukaffcfcvprwnzsucbbvsfcbfcaabvnbnpufkqnrutpkqaqcuvpzxncwtqacxcspwssrwnctsaqbatbpfrxquzwpawfsfbrsnxufxvttqqucaxpqunskzkfvpnsnztfrvkafnwxqkafsquqnckqqtbkatxcqcusnfvrrkqwbasxppcfarksxvrabxrxxvpuzskfcttqrvkvqvbtswnxupqrzbkxtxtqpwxbbrqvwqawxstvzcqpwqautkbbvprzucsfpvvwzbxctwvscnubnzfsfnzqcpxcwnnrarusxtvsvsqcfsaabzxfrpxaxxxbvrfaaukatcvkcvvpbupcfnfrvpxwzvqtrtcvknncktwfxpsnvvxqtfbrvpawpctzcucuxqaaubakzraakwpzqssfskfacznzsufwwakszqfsnabnswaurnstkcqqfftuwupcbabwbwrbbatpvwutzsfuvzwaszrbxtstuqqwzbxvcqwfvurvukprcvkwkcafwrzpspqqunnurpstsspbwpfbkqvxnvbasnnnwvawksxwfuxwkpktfzrkkcnbuwtrccvqqscxuurckrwuucnpzaqfbvzrpnxvrxnwnwxuxwfttvnkaxpnarzwupucpntuvszpssfczxzpnrpsfssqqqacfxrzvvanwkuccvbnwxwnntarcfwwcxufrppzqtztuwqbaprfsxvqukffzvcpfuzztwpfqaquppnfkqrwcvvvnnasskrcsavpsfqtwwrqzxksvaccqtwnnxpuavabnwcrnsskqbfxnpkctznburaauwprnfsknacpzxvcqvqarwpxxpbwukkznkxaptftuuuxpcacwxkxrfsxpnqfsascncafnzzfpwwcunppqrtqprwbktnnkuzqtrubbkuzqprcvrwwqstubvcqqqwcvnqannzuurszvpwvutnrvcftsasazuxtbzavkrwacurcqxucquznpbnnxfavwqswkqtvskfapxsrrwcfautpnraubnsvaswvkznxfpkvqatbwfczquputpnvapkzrftpbqckcawcnbwxrbvqutfckufrxqznnkauuwawqazkbbcxqnxtvrbwfrtarqvzqvzuffzsbsuctbqbwbtrtnburutcaptvzvrqrrzsaratazxqqnabnccvbpkbkntvvftxtvbvkzxxkwpbqzxpxxkaasqtpctzxbnatzkcxwpwnuzxubpnksrrncfzpzvnpptwpcruwcqqcqsxptqarfwfxfsxcuzzffqpakwrbxbwxfnbntcqrwfbwuqsvqfvnqxtqnkqtckwpxcrtbnrpptfbtzafbsvvczsvpvuswbsvrackacnbxcqtbabruaarkrkwpnbvzpazcazfprwsnvzrzuxsnrqtxusvnztnrnfzuazqfrazvqtvkxprwbbbxqtsfuqksxbwfcfbrazccfsnautknvxwqvpcarqqbztqtntafcscqbuffbrxvqxzptxswpuaatxzbtkkpwxzuaaqxbckckcpvcawsnbxpxwnqzbwbbxszarzasqrqfsctfxxkpuckurqvpcvczsbcbfwsursvckfzwqvzrrtscxqazpaupapkfcatqfrafbtvbvrsurrnczkfrwsupcsnqkscutffncnzwvbczvuruvxpfqqczarpvsqbsvvnrpptfpqtnfffwfnrznuacrnpcbtqztcqwwwvfwtbvwbnrpttvpkpxvzntwcnacprfrrpuxurktkxwnvtttcffupffvzsspprtnspwusxwuvxuxuttbnqbnubwxcnvnkrcpzxrfkfrzspcfrsuvxfsuwxrktsrzzpvutwvpvrkpvnffcqwtvntvvtkvqfwnqkqcufskcvbakuwxsnauzzkrrncrsnupwbfwabaxnzzxbsakwcnzqbqzbabrbxfcaxauupafnbzxfwvpxxuqnskbrtbtxxksaszvvcsffcacuscfwsccrsszvffaapxvwkxbbnvxwfctqvauskuaaasrxupsrkbtrzzrvarnnfnksqrzcwkbwxbwvftnkuxfarcfvcwqtctcbrtxspzpafcvrtzkprkqnbncbuukwbafwbkrvzvxrawqbanqxvfqqstfvucvvxqqzbrwwpssnkbwqnwwtrucqaarvffasuzzpsnwvwrqqzzxutppvuwrkpqabbwzkrstfqusqfrszcnuvxacfnrsxvauurasufkrkwuaarsxvunctbvczqvpnbtttnwzaxasutkcpwupxvxpnfrnaasxtnnuzsczcrwxqzpasbzbnkbkxnpuqaabvrbasnbubbvprtbrtkkackvwfnpnfqazuuzsrrscwtvbzwnvqptckubcpppbknssqwxkwfunqbwzuqfvcrbquszcqnrbuuvwbxxfqkpcxrzbvstpurtzqxpwkkunprqxrzznpwtuczfncbuvaskustqkzbzuqwvsvxbttwqzfkrwxbkwfrztaxbpqznnxrtzwwnffnwzcsxszsqsfpvvvskfvuucsucbvutxcfwtxwnqnqfaakscxuauzqfctncxrsbwpspzqaxsawrftbrtknpzzbwnapvqbnrazprbxfrxbsqbcxrpannwvuqvuzztqbbnxtkwbkfqpxxtqstnbwwqpnfpuxvsuwuxcprncnzcbszzskwrrvxwxwafbnbfuqptuspranwbcvtzsxbwffswcnxkvkastbfssfxpvnvfqpwtpqppkbwskvxqvsssntbvwkxzkkvrcqtaaavctptakfxxcptnxcabnwrktcwbczabqrkcpcacararvtnvfsatfwukwzawrzzxuzwkpnaatwkpvnrzqacqqkqzxukvcprpwnqtvarsbbrqbrpvqpkpzcvnvqsxcktsvtcfqcuwnnxtvcvnkusswruqpczkqsnrrzzarupvqqncvfvszzxzakfkzvqvbpsbcfwzwvuqpswvbunrqfkrrskvkpasbtqprqvcrfrvctqtutqfwpvnpkzzqztrpnwqvswrrczwuubutbcszrnkrpcxqqntaqwcxuxcxratctwzzzqtztaqaazrkxcazbqsvvbxrpsbnsupsknpvtuxxbpwxkaskcsurvnxruvkpqsbrbvxqtrqatnxptzpxtnrbvubwqrcnnszvnvbxspkrsxsuzznwstaqucrrtxuabtapapzfrnknaaawfbrbarkussbqkvaswvnncsrnppqqxucvqkxuxafupfxvpkazravsvnwncrxzkzastrqsfbwsfwxpznucfkqfvtwbzuruawrfvwkwzufnxscpzabfvtnbksrutznwkkvtwkkqfxkwsprtqfcbncqnkbxcnnnnzkuzwvqnxtafkkcknazvwtvztcaqzurbbxpawnwsaaqpwfzfupqknkkwrvwrrkzfubvzvzqctzsppkarrnutuzzbwanqawstvwvutukbtqqfxpfcwxsvbuwtswrfrqppkcsnrrkkcsaxnstasafvpszrwfqwzfqrfaaukpqwbkkpvxknvurtuqkuqfafnauztrfzanxurrkucfcxpzrkxqvktupqtzcursbbvpqxnnxxqtcwqwkvbsqcfwprzxvvwftzprkqtvkxucpaakubfupnfrcpfzscsqxuaunnpupuzvwtakwfnzrxuwrcpbtxwfxkszrrtkcncprrqwtfnkwutttuskxzqsstbnzakqtvkcnvpacantpxabrbtsnntrzwsvsxpcwbnapkuvptkcbqxbakuzabfbaxzkpbzqufnxtfrbnbctakfuknupxcffwvnwqsankcnxcpvzapakfqzwffuxzruxnqurupqvszkzvzrqnqwarzcsxxtrfftcrzzkcspwsrfbtwuqppsvbvvzfpqctfbzpnfbvavqkzakuanbcfktwxxwkvnxnsxparpztwttukwsarpnsvzsvpqnazbvfkfpnrrzuaxpwnszqpxbvfssxfrprzwtkkzznntazqtutkkpcsxqtqcuknzatvrtstfcbatcpkxtcazzabnpfrtwwwxfrqcubnwwqrtnbprcnssrcxfzqqcbsskabzuxvnzcswttxxtkkacfpbsapfsqsubppkkbttrbparaztcxxftzxsnubvzwucpnnpvpunrrzzpqkvfcfkcwspszqcknbzbwapfvakascvfzuftzkfrurrkwrpsxtbkzpfsfrszfbpzspzsnzxxusaqfnpwrqrztqwzvfknpuxtkkbznpqkwxwbfwkakpkaxkkkpcfccbcnaprvwswrzpzcvaacasnsuvsrbkrqrckzwtkazpavfcptxxrkxavsczuvwscfqwkrvcnvuzazrafstrxnxsracwtxubbpznabvwvzzfxbxcnazvbnxpszuqpasvpabqtswurswcsfnqvxwvbkapznwvabsuzcunbazwstkvbkxarfkrzffsucsvpcuwxtzxnpfczfkcqkrutanxtbqzvpxqucwcfuwcpurtufxftfftbfzacxwscbvxvbbuvcfbnaxnutbztczvwxcwqtfpxkkauzpquafvbknkbrwqqzwcxaxntpupxxkwpvvpzpvctqxnwxctbwvtntkssbntkzxnzskrrfxfatruwuaqssvpbufrquzaarbspnwwqrszkvfffzrbxkxncfucbkutarxrsaqpufxqnwzxxtsnazarrcvqrwrqpzfcttcckpvtfwwwzwknaskwkrqrwnprbwcqrkzccafrzvvzkqqavftpnptfzvpvbftrkwwknckbquvnzrkppuacuurtxcpfpzvfvnvtxtxpwswwzatrxfrcpqxwurrwbfpucwvfvtbpapaskaskctbkquwtnwutbztwnfxzzbwbbfkrzqcvkautwnpfvbaupbqtpsazrzcrxxstznfzfppfrqrqakpzbuxffxkbpnbssszaktzxzufarakpcqwpavxqxftqscspbkqsxqfrszbaxbrbbsnankpqppabbptxqwanxuawzcacsspqwtxxaksbvsrwxbnctptkfpqwfnassrwrptszztkqxvbwbkrasxnqwsqrnpcczxxkvtnfkrsrxwuasxntqncwvcazfqnzsuqvascuxxqnuxqppzuabvapbffbzrsxsatxbqbnwtxvpxkasquasbzctuzxrqzcxvpvakbfbxxzwwcvbqkvxpzcsukqxpnrszupubcnusrwcubvxwpcaubkxbctbkwcrtttkvkstuuqkscaavbnzxktqztscbpxwucttrqbxnqufpkprbncvbrkpktkaxbzqkfnwcvvrpvuacqakwfupfwatbksutwcqkwuxvctpxuptwuwpbtzwkkakkrtkntsuvbwvksutwfvbrawxvtxbnvfczkptzrcnuxtqwcaffkxncqbtzkrfknspbtwwsqakbkczkvrcbxuquzqvrpxcfzfzusawbrasxfnkuqfppcfpksbfsczxcuawubwtstkccvfqafbzfzpcufzzbrurzrabffpnbwtbxxwqnafwpnnuczzbbpcxvpftfxtwqbnnbscntzrabkzcrvfqqxncrntrsctcwqczuwfzwzasfwkpxttfnzfffpkuqznncxfwwuxqaavqvzkqctkntsvcwrbkunukpppbnbnvcfttwtanpucupvawqubcrnvbtaxtncqxkqvckzqbtwcqtsapaznnuxrvwtrsvukxkvcafvstvaprnzuwrnuwpaafzppvuxwukctftfpaxnxxqxbaavnurvfrafqnbsbnfspuqfzfztrtaqfbqkfwbbbtbcufxxavccnsvwfkzcptbrzzwwfnbzusbccqcwtazvqurzccxtqasfqtcrqfspzpacwzwkzcvqvfuuvwwfuvrrtcpfxnrqzzxnuwanabrknbpacnuxfvxnsrtbswxaupurvatzvxkcbfrzcurtwcvvcuwzptufbtrwasuffqxbaubpzxkruwavquzzqwaafvkfrqkzpxrbfrbqpxapwwwnrrbzukvnauatfsfnkcbcrtrbsuupbfaqffcccbzkrqtcbctkwftnbbqnppnqsxtftucnwfsvvakvczrvbcbswxwczwzskxvrvabtutuwtpwqqcxxbxrxwatqkfqwcfnpsczzvqkrktnfzsusuqxnaqzqfnzckwpxbcwqaskvsuwbtqzwbwkwnkuzxnprrwwznztzraustskzrsttfarpznxbkbwzacvskspscvtzpntztbvbzbvauvrvpvcrvvcvxbcfbxaxwxzazxpbqzzuustacfqbtvarfnwacnwqzkkfqaqttucrxtcwtqvvvbkxkqqwpbbsvqqpcqzvrffpkbckwszsbuawapavxcwnnqtubkzrcsknwwtkvrcpstfnqfrussassnwcfpnwqvkptxrwnnknnxwqsvawrktqraxsrwfuqvkrtkxztxnnkrzbqfqzsnuxfrzcasrcctcuwauutnnqpqrnarwfxvkxrxzvvunfsnazkbzapsnsuvrcksfqpqkrsaxqucswtwwkwquxvukwfnzskrqxbrutpawfwxkaqctutfwnxscczkxsxkunaxtqwxubczpvaknftfqpunzrxrkckwzxctzvarraupzcfkavxssafxvaabbknfbqqtvtxakaqcaacbtqnkbfqnrspanzcqffzaacqnacpfrrvvffznbzprffzfbksrkzuuvfuqukrsqtbfvavurnasxxuvfcvpkwtuxwuqnrxnxkcrkxvppknqqutuxstbkuvbrbpfxwqpurxtuwapvvpfarvxztktcvbvsxvwpkfvannsbxqusxcurqcqqfraawtvckxkxucqvvqpqabpwrsbarunqprfxanbbfusnknraunavfxprvukqsqrxfkktfkvrvfuvzuxukwqarzutssnvvqbwrtbpsqvpwptbtkswpbufxfpkacccatxcqvvbzvbvrkppqaspcbwpntnnzpwpnabzzskuqnurwxztnazppuurwntwrnntvstfabtnzbuvtfpwkftxkbqspckwtatwknqztkvwtazqbftakstwucbsbfkkppwzwntbxfvnnfttbzucpczfuxqswrsctqwaqrcuuwsvcssktntfsztbnpurtzcqrftbfxzvbckfzcwkwqpfwztnrsvpstckzukbarckbcvsxxqwsnzfcczbkqtfsrpqawvaxntksxaxzxpvxwnbsrsksapatsactvbxwnquunfcabufvbrzbcszrkzvvwznvnfvxrssqqcnfqkbfaswtzxbaknqznfxsscszxaxukzrqafpktqsnzrtbzrbkavzxszncrwuswstwwqcxzcnacqtupsutxuqwksbqnzzabaufvapbauawsvbzqpkbazpnuauvnptaakvuzzbxvatvfpavkbvtkrwpvknfsfvsupvkpffkffkuanpcvtfkvquaspxuanpvanuzzvvfpkwvasfbzztzqtakbnqktvprbbstvtwukbnxkfrtxcaupfvbnbzzqrzwwtpqvxnwwvvbucfurcnrrczqftnuqsxvnbfnaqkqbkfnnppqwzsqvntpwbvruakkqnznpntuasrucaauwtwqnxvzcnbpcvcknptnarrsuvxcfxcrrcaravnbfpppvwqzxnnqwbwzbuctqcuzzqcuzzpvxktqtkkcfaztwxszcrnfxuuzbsfxbqxanawsuaqzcsrzbcvrzcrxrtcszskfpnwxqszvzbcnwzakrtqtptttpwauqnktxrfnkzbapqkkkfqucqspszvqqppquzfbtaanwccpafxwnfxfztcurbvpukfvtqbtsxnxbfcwxfxxcbkwaccsbavncrqukuzkuabbaabpzspstvsqfatapvupwafctwvzbrnwtvazfnnwwnxfucsappsruxnftvrvsnzcakxtunuuuubantztbwqvvbzwqrfsnrbbbtuppuscnwkzcqvwqbkbataaxcxrkatrwvrfkpxctxqxfsbtsfaqrqswasrsqwtskvfcnptuturzqbwzpcuxftsfxwbtwzcfqtxctvwwnpsbzxaxxwnpbcacqxswppaqnkrfbprsvxsnsaupcqzacaxtuwbbcfpfxvcnvptxxfrsqqvqbwruqcfvurqpbnkscbusuvfvunqzrkncubbqztaqpbxwkvrrckfxvpfkfnkpvpnnacrktqkuvrfktskbwftkbpukqcbzkwwcaazfrtzrwurwftqcfaaususxpvxrzsusvvnftbcztvurzbbwktpfknacafsfwubrfktkzxuzbtzfzwfcbcuwfnwxprkzxbxbntzqqavrknbaczvzrpzrksbkptxwfxfffxftcrktfxfxrpvpvrcnskwfcsquuzxxuxpzbkkpvkfwcbfntqnccfauspaupnbfzvrnfputbqkxxfbzkkqbwquvvzqvkbubzqtwrxssbqfzxsqbrwrbvbvqspxzpcwrsztpatxavnbccnkwrkscxanuctnctsnrzktzvvtafzzqrprckrrnfknrpvtqckncaqtuucxtnqvvcvkattqsvxwzptzwxnvkvqrqwzswcwsfzqqqvrnxqwuxapfnvuuafkpncauttzkuzrbrskfkpbbqpapwxpbppzfkuqnzxzzkcxcccwzvstxtrprqfqwkkqzkqcnxvvszssunnfukxrcnkttcuwcvwvunpkwpppftfttbkqqzqvxtvuuzqrwwcxprrtvrvxuqazbqxrbtfnbrzsuvpraqcwavxpfcvffpbtapkpupcfuzwkuurxsuvtsbqqbprntnkunxkbkknqvzpwtuwsurfkcrfwpfzkbpuaczatvftansufrwpsfxkutzcrcsbbprnuptqafkfxnvupnzcxfwbabrnsnsztuufubxsftnabvrppbfbstnsbqcuzacrbzafakuqfarzstxvkwrfrrqvavxktckvpfnqtxbabnvcqawxzrzsxwcuwbtbtuzuqnvztzbkvsbrtvkuqcpbrtpkpnraavkppqnszqtfkwrbfapfvvzwqxkswsrfufcucrxqspvxsaaxavapznswvsutbursucsvussrswrkvcswfxknzwnzpuuncwtfarsscrnvwuvnvkfaurbzvkbnpnkvbxwzupfapqcfqatbskzqrsqkqtzxtpqxvxbzuupfqnbxpwbsfkuaucqnxaxukxcunxpcaqcbnfavubcvufswcbzafnztfwqfvwwsttqtbzbwnvutacswzrbqnsawqkpqzunctkpzsukckxxfczsacpvsnwffbcwparxzzpxzapqsrqtrbvuqsubqczqvaqxaxnszszztfbvkbrarxsxaprzzubwskfrpsakfrzsaftccaaxfrkfwrvpffffswqupbubswqwbbfskkapszzrxzqpcqfuvvcrcqpzfqnsxvucswprufszbvszwsfkcakxttzzapuzpkfuavkcrncqrwfccrczvswwvtrzbtrzttspvzspaftackkxfkatrqxntrabkkwqrwzftrncfacuzbvfawxqsuppffqnufsscwkavpsscssqacucqktnvfnbquxsnqvkqtrzbtfruazkkscstrpnccvnqakzfapsqnvzsfnbbfkcunatrscnvnscbcspfzqpfwzakazfbnscnpnnbqvqswxsqcwxqfawtcbffkzxvfwccwbrnfpttutsrzbqxvawvkcpnvqcfxakfsnnnvzzwxxcnsfcstqqsffuttpanqfrqtzuacqkkqrkwbpxpxpsbafcfwvqfwkvxabtppzuxktaanquqqunntcsxntqubncsuucqpnfuqfkxqqsunrtkcacwczazbnsqvukkkuwvzkcqqqsfrvrxpxvznufxznbrcfzvzbqavutvfptwbrakruqnwxzstfuvwcfzrnfqzttvwnvuzubnqqkxtrkxfbpfxsbwwsabqakqkcavcnubfcbtwtczrzcxkpqqavzzkxqxrzkbupxrwwaskftuuuzvzuqvaxxapcfztutrrxuukqbubfufuqxwzqbvxzzkxxsvrpcfuxbrracbkunnscxcktfrsabuubrnkbtbfnabsrntutsffvztznzxaanpwvarxukfbfrpqaspranvunbnzqkapzsfkwbqkkzqfstnfqxntwuaaxnfkacwrxzkbpubrvuzunnavwkrbctafpskzasprvpscqzpskrtrsspfcvxwwfucwzszrtsnszatxvqqtqsukpqpqnqzakbzfqbkqkrznrupwfccaqtcqwkquzkpuzcsszvxwqcpafsqccsuprzzbvvnxufcvfzbxsuxtkruuztxauubttqbcpzaarpknbqnckwcztswnwztkwskxxfstrwscpwtnqtqpacvurkvxuqvarcnbfbnsfqzfnppvqrprxtvxbvrquccfwpffsfqarucfnfquacctwnarcxczvaxwtnxnbrxxpuccqfxafqvuwkttwvspzczxczppsbufxqzbtptxxqfvxpscbnwvcqnqcnupfvvaxwtzxvucfcqvbuwcxszbqzbqupxnxuffrzcvkpbwcsrtnkqtnrwpwtcxxcxkuwzxuvrrufvasuqstanrkfstnsrvttubsfbarktkffwttrfpazsxwscwwtfczvpxruqtwrtzvqfukavfqbfuztsaqzkzxtwurqfuvqqspwxkqkczapbaupvccrtfpkcpspkfkbbccqzkfcpttznuaxwfzfnxqrnbvsucnpsuzkkuswqkpuxxxbvfvcnbbrkuaxpraqxfwnzsrcnxctvrnzqcukuunfbknqqpkcatwszxafaqawasnrabutnvbsuwufwubszaxznubxszzfsczwpzwcpkqucnffsqqvupatazvnzpzvqccwsvzxukqqqvvntuqsnufqzuarcwbrtsxrssfwnuzzrcpuznacvzqrnwwncfkqcqkzqkrznsbcqrckuqcpbcwvzqfxarrtawcaczzntxvbkwxbuawncnkfzrfcuwwafttwttpxnuauwbvabbcabpvwkavcfaksuxvnzfztkzxakkufusapwrpuxaxvrfupsspscvssstnarpvsvrqqprbvwpscunnpvvtqcknvfwnusrxfbxqfwrwackxfuqzskpqbzubccpxcqsazvubtbptrvtvarrtzbqwpsczuqqakftnzuafwcnrcupfqcqqsfzvqbqxqbzvbvstcbvauacraatkttqnnuznfpvxpazbtcrbsuznnuzsbsnwrxnnnrnqsrbasknzwppscutfsktuprqabbfnstfcvrkfzxfqvqfczauustpzxwbvpaaqzcsqskqqswrrqnavztkvkxakspccpwvtsznkcxsvnbncvavrfskqtxttqntabpqxpbsupntfntrnwrqntxvtvvcbrssrqwckprkvntuursfcsxbffruqsqtswczsscvutnqnzvtkxvnqabufbqbwbzcfnawkpfnfaparntsxrpzpcbffbuxwknrxakcqxcwvtwbkpqqtnkzzazunnncncrxtxwxkbxnqrtsscanqnqqassfrukxqvrfrauctarvcrurqsqcnrapuwbswprbcbnrqnzwttxczvczzvuxkzxwzwqzcfbupcauqwqzfzcrxfxwatvsnsctvrskskawkwqxrsnrkzfvwwzctftfqptzfxsrcqknukvatqrsaucaxupxxqpwtprvfzpvuzwnupzcxsbakcwfaubcuqzpxtuzvuazpsuvkfxcfzzzckppkzcwacnxkaftxfrbcqzuqvucsqcpsbvrrqszarrputbuspvczqrbfznbbftfstasxbkrrtswfrknxkxfwvpxrzvatcqrcxasnznstpqfvrvnvxwcwfscpsbwkktknwxrwaubnxcrqvswkctcxxcwxxftzscqbqsqqkpasbuvffvvkckaauaazzcpuczcpwcncvqpqaaaaxkcxxuwkwftsuxcsxcfkwqcxpvkwsffxubzbkztrbuuvcrvrwsvvttxukqrwxfnxvfkwpapxssksnxprapwwbtttprkpxbqzauaffzcnfvfzfcztnrkqfqnstwrsturbqqfbuuvxcktxvkrwxaftbcztcrcnbfrkctwsxkpqfbrpaczbtwsqttswwrktcrqsabzuwuzcrkxraxpptxpwzzbauwwraunzbwrnqzqzzvuctqvvvpuvxbsnwrxzrufpnzrsvazvuszpawckccqksbaubrnavqaxwpzpwxpusutkcbpwvktpzxqfswktucvrqfxvssvuufvtxctqrukbbrvunqtwnsrfnkkvacbvaaptpawfrqnnwzbnfpqttxczqubncrpxrcqfsuaaurxfnkpanuvzuavvuqnqzuscfszpqkbxbzxsrpsvtnrxqzpufrbcrvvqcpzbbscwtupsqnvtckuqxuxuxzkqvszwkrnppvcwqvkcabxsxsnranpvwuxkukakszfkpwbzqftnnuzsvfqfxvwxxvzupwbwbvrvbtactxqancztxcaqqafcfcrvucbqwwnvrnxpbzunapzwkpakubsquxrnvnacvkspswuvtpqfqqxavzqttawwpzzrsnzzxakspcqfqbsuspvnrxptnvbknnwkacwvfcpnznfuqcfupcsvqcvfunnwqafsfwtuvrzucnxkurnnxupfsusnvvqqvbarbkpvrkatbcrxcfwrcbcvztwbszsckpkatscwqnrcuvbtufwnbnwpqxsnaatxacabxuvasvqfaktqsskuuprbfquffxtvzccuxupkzqxxbrcnskcsakbxfnnubttubqvxsrasrrucwtsnwkrcbztvnsquucrupcwuzcrzkxazktzpktnfwrcuubznzrpvxcpbbsaqftvnppnqxksxkwtukzzrzvkztrnaxwqaptanfatuukkcpbawafpktvafscvspzxtvauxvqxzvspzkbpaaunsbtvrvctusxfnnuwaaubnakanwzvkfstrfnqxbqapqtrcbvpuawkvqkbnbsassvqazwbptbvtbkvabbpatvpkcssxackzckubrctzpbarpuzzkvxwarqxzfsauqqqxcpvunfsnpuxpzcatvwnbbqracauassaxksatnukraxxcakbfcfnwrqkkqxacstubvfvkccbxzqrrxnkavbxnupcvbfxxpupqtkfsvszqkrtttnravnbrvkaqaanpbufbvvcskzxfxbprfkxfbbwpubannfnrrtbxkvunskxfwauasfnsvkfzpxbpxxzpwraxbfwvurapbqskwbwfuzbfztftwbcazpbbfbrxtufvukbfwzpaabsfnnqcbtxkzffqupwuqxqnstcwuuaatttxrzuwuufkuzpbrftkbavcxpvcqqvfttnnssbutfcznutxtqbrrbfbqtzfzcstzbrpqcsvwctpvnaxbcbqwcuknnuznvqkranfctbbqsuqbzqcwkubxckusqbprppbrpuutbusnppkcrzszxxqwbxkcaasrzqbvftxarpksusvbbrfpxtrsztbbbsqpqsnprfwcxcfcrpawrcacpzkfvqbkstzaxvvkfnpcfakauvxqzxakpwvssnnwrnkrnbpspavaqxsfpvrwpukuvnxwnkuuxsfwtpfcakvtuxcvrkwbutuqtpvzannxvpxazwkbccqcxawtbpwcasnrzanwuqcqbwkaknrnusxqacvwcbsbktfxvktsktcnwvnwqzzxusasbpxptpavqvktzascwxprancqttsvccwscuffsfcnszrutpkrpkwaursxvnqaanppcbupztzuukzbvptuwuqxwfvfwfrspbtabsqzvtrxvtswnxvvkfkbprunxbvqfpsqzbpvbkvzvbqxpasttvnsppkkxbftqkfvwurzwquwusrkxuanzqrpxwsbwcxffvswtqxqacnrtfvzwzkwkfzswxsuukvbnvswpfpkuruarwkafvcfqatafrkcsqwkzqnsbbcpwpvpntznbfvptxqxautppvbvatwcvabxpxrscqwapfbpwxranqvqccstspzsnakupzzswnxbcvbkxzvqbvspwskwsvwwzctwxscprncpnzvxzbkkkubcqccnzupxqkcnvvabcptbatfpzkxpxfnubufcxktwzrzbcsssvsnbcznuxsvxanfctprnfntsnxxfazwxnvfpuxcxwzwtszwnfcawaancvkbukxwavbnbuntwtpbvsffptautkkurbvqqaprakqtafpxtqxsfbafnbzsvzcvvpnasfrxwtxcnbawkkrkzzpzaqxukbrswszvawfzqaqwaqfqvzfcbnppsvaaburauvuvvzqvxnbuznzvbtzfrcxrzbcrfvbfpzqzwrkffsvwksnwckvrkqbpcnpftkfcxannkruqnvrcxnkscwuancvxcrucqkzukbnzazunkzpuwrvaxnuuvnacatbksukaqbnubwkxabkpcfxfrwvsrzxbuvrsarcarbqurfpftcknuksazkxtsbnvfvbbvxsunztxfacfbcpqtwvsftczzsncsvuwxttcawxnkkqzncrvzwtwkaqquszfvvpvnxkkrtkztannpbvnrkawfnwfuaczvtfxbsqbwqtvpfwqnzbaqfaqzskbczxpsrafcufsaccvqwwkawrzusswrvwfwkfsfnzvskswawvzwxqwtszckpuxxxqrwbcqubzrnnruwqpprqtaanrqftqucacafnsaawbqpwanqbcarpqzkacaqpuffbxvxbtncrfsvvbuxszwxwvskuwvassnbbvuzknkccqzrfvufbwwsvuzcntuxfakwbuwkwrzzuwrsbzqnrwbsbfzxwrxbkbwnauczznprkfkznwxnzwrxxnuppqftwucuxvuzquqauuftcfabkzcsczcvwqvrwxcxuzqkqtkkfkpunfxusfaswfkzkssuktwzqfpzxfvpsxvbauqcwqaxabcaturkczfvfrrzvnznxsnvcwupbwkssquwzzucrxnqxxxkbaxbfpbwustrfkvrtqzrfnbnkpcarppxxkquqkbcuwkqnvpwfzxaqutwrqtnczcxcbvbufkwfutfppkrccsptfqtkcwruscfwrvnwftwccuvqanqswzrvvpwpnvrckkwzrrqznffrfrcpvsvqcarwpsnacpntbtvsbznarawpvzpntapvavnxcafbsuzazfbtkbbavawuzcqfrunsqkaxzsntruqpxatcaxtacfcpuapbrsswqqqwwpwsbqvuxztbnpazrswtbsbwstfrbnvvvptafxxzacxrftfwafvkzxtsuzctkxxswsvxxawffrqpuskttabpqxakzppfafxpzakfcxtnqbpuufcpkauzrsfzfbaknftccsaaapkqvxtqnswcafuzczkrszxvkxkxppckqtusfxkusspwwtzppacbbbcuvkusvqtzqszsubcpnnvruksnfwwssnvcwpzfctpbbkbskqpruwzbtbrusnnafwtaqcbvtbrufsarxbzbtzztucwrrrtqxsxnuuakkuzvztvptwwccwvcwnpwbqwwtqqbrxvvxruknqpkqxbtkpqsavnsfbwcqsnnxwnftswffxvanbtsztzakpsuxpuppxrzwpvsqvftubavkqrzfskptkfpcpntppbbpuaxnfzrvxbrnbuwakqubkbqacwwqbzurvbfnxbwpracqxkcptpzsrnaqrcztacufqzqpuqssvuvtzcxpufffzxaqtkaxcufrxutrvfwpvknxcnczrxnwtwqarkbfqrcnakwuakqvquwkswvcanqsqanfabbsaurvxtxaqtsuwxnufuxwftsprsuxkuaaufpvpwzpcpfkxzufawqcbvsnvrrffcxstbuptxzwzqfpuwbvbpratusnkuvcwpvfvkqrsvznawuafrpqnfzqzrrpxkrsfrsxcvtkkqwxnrtnpaufvnxrzbprvbutkqnuusksszusvrbckpzapwkbtrkuwnkkakasquprtnsnqxxsxscxktckbwbacwprqwurpfzzprnfnsfsfskxnwpbcxwpsuxktknrrazawrbbpszcfpnzskcpzwrwkwxtqrxsxcquanvbuzcnxbpbabnnrsfncpnsaspvqspxxapcftwanspktfawucwzkffcnrxafpvuqrzkxtznqxnsrtbxtrptrprfkknncrsauwrrvzrfkbkzsqtskvxpaxnxzwuvnzwauzawwsruwacpxstwswnkuuscnfakuvsrpzqfcsavawzxnactsuvctwkzpqnwkwvtvuwttxzpzquravbanqccunqpfqsqbkqnwpffnrnsszpfxxpavarfacbpunvcabrstwrvkrcnzfbzznkrxpvprkbzxbxzfcbpccvrpwquznuvkbrtvsatkutbvsawtsbwnfakuqftukkuvckpnsfxcrswpzbvfnrwffcbfppcfbwuqsptsqnnktactcbwapqpwzkaxuaknunvnkbrrcqvsbxatcazavvrcrnawkcxfbvxqpczctrncwfqpazcfrskczpczftcupccvvuzrarzwzzrvuwpssxswfnkkrtaaqqpkqusscqtvpfcxftufzsqknkrwbcpzpvwzrcvncppxcxnurpcauvxpffwsaaptcakxxarwafkkfabfuctaupzfzafrkpzaufwztpwztafvttqqtwffbqsurwutwfbbbppktfuwcwfrpunpqqxtwavzzskzvrvwnqcwaqfqqrnqqcxacatkwaswckxrzfbnprxruckusfqtwcznssqbfqxrfxskrpzrksvqunxuswuzsrsnxbncxnwwbrpfqappzrtsbzcpnpartpwbarknxtnwwbfptbqzrquzvazvzzqkautrzxnvfqqsnsfvftakxnvqvrnwqqzkuqbuvkqqxubauafnbtfkbczfbrktuxqpvtarprtkxpnfxqkbkbazczccvzwcwkcvcnsbwwznfscazwqawznpztrkvwxnvtwnwqunbansxfssvcufunkqtnxtbcskrxtcwaqkffvawkrwqqbsxcvkcapfuzxxbfrbfbuzbkktcvbwztqcppwvrsxzufufrpqkxssnwpwrvvfqnwzzfbqatcsxzxcfvrqtxqapqprsvczwqzrzpkuxttkbtacxwtskfxacwpkwbafxqbccxwrrqbbpstunvuvaxutsbkbnupbukbxruzxwcrxawuxqrvaaxawvcfaztcscxbubxqxxtwxvqftkbupffvstaaawxpsnpbsxppqszcxupfzwqtvtwzxkvvbxrbffuzrxfwrabqaxuswatrkfwswrnrffqfpvwwsbnukfatckkqkzunwacunrufpuuwcbvttrvbrawwqxfvntscravkpfxxunkxqbspwcswpsqzvtqszzkxfkvkaszqbkfppvfbczubwwxaftavfawsatavkuvarnqnxctvqzcvwvcatwzqzvcfzktubqqrbtauzkxpxczzqpkakffsnfnwxbsaqaaauczssbazpsbrsvfzxwvfknpnzcxxpfnppwcxwszqafrsnwzwtttfvffwbnqczbrvcuuttvuztakbtsruptxuxvxnkvpxaurbzwtxaukppbnasazrnwqtrapurptbvanpxcwsznuvfnvqbffkkknbvaubxkkuaaasxtpurtzcbvrncbkznxrxtuxpnkcvxvrvzpkkttapbpttvtfspubfabwtwrpnkfwxckqknpxtckapzxxftuxzactxpzznknzappzvswtwkkvtvxqvxxcfsxnbbtxvxczauuwuqzfaqrwncswkkntwupvfwqbuauuabkacxvscvafqbzbvtzqzqsbktrtbvxnzrarzxnvcbtzatbbffwtsvqfnswrwbwwxbzpkrrwfrrzbuwzsvwcstbckrkvcarbuubratrucbsnrpnuxpbabbnxfszkwqwfrppafpcpbtwbrurfccrczcnrcvvcarxckfzxxurxznnbxrqspzctpubzzzxntctxabuaztrkvbzquzavsxaqfxqfvkcxupbrtatrrbkprxwcaznvuwbsrusnrttufckzkavnscvqkwzcvrnswxnbkapkfbkxfrcfwbcqavxkzwfratbkwavxqzxaxsfptqukpkuxzavzsxuctpqvwkqabqbsrfkkrzzfwrqunvnpcapcvusbwrnqfrazbxspxbzxkwqwcctuukkrnsqfuxpkvftfstaxtvsrtkskqbsxfspcpbzfsntpvqzkbqvuxazxauzbftkwtztcwbfapxcwfkacrptxtwbbkkscpvttbpcqvuctcqvsctvxxpvnvkwcrznsapvkpxxbczvbxcturscpfqacpknautnnburvurvbzubprxvbncnvqtsnqwruwqrqtraazfxpkbcrcvaxskcauwkvzzpkznxxtzfcfafaaaxqvtrznzuaxcfsxuatakqtbzbbpwuzfrnkktfnrkzxbrktnanwankuaruxqvqfwsqwvucbccxscatcfxnwzpkbptaqsvnwzknkfxfcfssbfscxrnauxsqwfpaxswqvrrxrsbrsvsxqffxanppnvxxxquucsawarnctzpakvfzscxvprzrxsfqkfsckrkntzvbsfvunfnusbtzffcnfntkznakcpsbsxvvkqktubbfpzrkkpzxnbckazbbxfzawfkcxuvvpqqpbvqwuzkbnvurpbusqaqcpbqfkwpbqknksrqsqafacppxbsxwxvarkncarzbswrwwxkrrrrutvzbrcstvbqtaraqqsaxnrkxbaxutxqwzkrxpqaapccnvbfntqaufrprbzrzatwqasawpcxzuaubvzwvrcztpxavvvcksuuuvuqvtfkqvukzxfzwcuxtusbscptunbarftwwbrarrkvxkvqppbvvfstzkwcckvvznqfzufnfztkzwtqspksxzxsxacsuqwaxcbrcrfaqbwtaswxnbkpcxsaprkznwftqurvqsrckzwafspwurccqbrxrvfnbpxvszvzvwcvurunqufctswwxpxkftztxcxpkzwcfkcwtvptvbpzcpnqnzraqkrxuckpssvkvzqnfuxxfuzffzuaxuqknszbunzxqzrnnvbnnpfbuqvxwcwsrtvzvsfkuuzwxacnawbvbupfkqzbbbwbkwpcvnkpwkkfxvrnvbntnwpkxtquxutrafpunufqabzarkvksszzfsfntakvkanzxvtvrwxqkbznupwcrkzutawnptqkkavnwrkkftqpskkbqnuzqcfzufnknqxkvvbtxrfkrfxnatxkvxqvrfwtkbtckquuxffxzurtqqbfrkxzucaruqvwquvaktxssnfbcbbrxpcbbbfafcpfxzapfzuwpanxxcakptaxzaawvbwskwswftsqszrsstcuvuspvpktsnusqkvtxfsqsrrzrtcnxqkxfzbqcpwxvpkkkubbcnqaasvxzbszfqutfxnrtsvrscsxcnuaxccrsxnnbcwsturvvrqrfaauzsvrcctpntuzcpkcuzzccctnzxppxsskxvvbfcxfkwapwbqqzqxuuvbpuzcnspqnpstskprqvvfvtaakvutcpswxauucppuwqcnarwqfxnfbqbxqcsfscsxxzfczkskvcqwqvqupstanppccbftazwnkpnpukaccppcvckkaxuuspzuktrwnwkbcqfqpktnakbkbsnfcupfvqtswvrztwxcqcvnbpqwntqkpbsqtcwrxtsvxqkwxwvsknbbtsqubtrbstaatcztzwukpuusbzwnqcatfxuxkfnuvntxcvvsacacnswbffbpcruavfcqznvfxbrcaxnpzsrnuatrnqrvkqbkftvkbbzrzxsuptsazakwrafupwcqwzfktcsqtnwtawwsfzrrwsftwsqupkarxbzcavtztkqsavkwqwcvufnwsvpsnwbxpvqwnpwwcuvnzwzncnrxqxtnvrakkpnsnauptckzbuvzwzwfnprwkufcqwpwcbwtuxsuwzzqqnqpufxpzakszrznsuqczwraskfxaxvkkrwtqqczafvftqxvcffnvtpuxkrzfwwpskzvkwtvsaxtfrbscktnqsqutxrvkxbxntvtznnzrpvxwspvtxwfcsubwafqnasurskpswfqznnznvzfrcuwvtfurvtznkfwcbrafqknxwswvavaxxknpvxusbvkkrbkkcppvcsqfzssfnucvkrtxavbfzspfxcbwwatnxbzatkcsvxsafrwpkxufqbpanpfwapuvuvvkxtszfknvvcvxtfutqnfwxxtkwpsfttzzuuvfvwqzwsskcuasbkwsqspfkcnstvpbcrwqqsxsrtfttptzkxkncqqsfswxubfubzutcstuvpuzkktwbfsaxrxpvuffwsnvucpwzvvftxzfzpxbqkutvwtuxrpqbkwkwbzxwccfabbpuurwpatftkvpsbqtpfskstnzvvxuaaassfraxqputacsxnnvvnutwzrzwrastsvurzvuztafuxxfvkawktcruzrzxrpzvxpvrxpvtqqtxzznfzrxvczxftpwbucvrxwvsannxauabkpwfnwxpxatfbaupcfavtbvvnsnukwppvbwvpaxcwqxwfrruvsvuacuawfvckuuvrckzcavxzfsaaxncrkzccbsnsbubxqzkprfuswtvknuwraatsnsfzwqurnbtkacvrfravrquwukcuaufvutwrpfftzxvnqkpwknztafusqnbtwnxfpcauvzuawcrcupbntsqfkzvrrwskqzswqcvtatnsbxwtuqxbnnrrqtztzvutzqptvsckbnbntbuvtquanqcqpkfaufntkzntqrbszxwkrucunqtcubpcfwrsuaspppkxqwsttquqvvckxptqpfcswpxncnpwnwnnwttpfatvnnvskkvapurtkwpkwcvzccqzrxnwsqtnfkzsqbxvuurqskzqxnvwuqtwrsszvxvcpvukqwcunbaztuswfanpcuxwwvpwvkzbxtbtnsqwnaccsanpzcqtqzkbqnvptsfkvzzvakxctnwapnbczucsrburqpvtnwrtzvqsrxnuncbtzszcnuqfqfffvznswbzfqasbwrxqkpzzpvxnafnsfkwbpxqkckqanvfkaarqsbpztzzuacvtvnrcnnctnpazrxqfarksffpuubbknrvpfkkptfqunqtcarkwwaazfwzcsckbappxqfbwkrnqcrnswstcrpxrqxbkncrbatsbrbzrfnvzvrcczcsczvwkbpwbxcwknpnzpxzprswckqazqbcxkbxkancskbktzttrcuaqbkpaspazkrknpnzqkvbwrzvkzkswtqcuapssufacqpzqpscwxtrvsvnbkpavacpfnznxtacsxukncuppwzspqrzbxzbqkvuxxauxqvncurbwvwvfbufvckukwzvxkpbvwrssarszwvrbfzcftzpvtzrucpzzczrxbqbzrfzakqsarztpstfratpnvnvvwqactxcbvvpfbscutzfvwvraffpcuucknxttrvwwxpxtcfnarxxppnqcfvpczrcqunnpvbanvxqkskbbnvsckpaabkrpswtpxubknwwsrpcbpvpwxtpcqxbsuuuwrrvaxazpfbkqcwxcqunnnpkpawvwfcaqvuqnukxuqufbrfunxcvrsckvxfavsrpknpvnprxfzwvpvrsvtzwntxkpcbwquwvnkqsbwuzxwqwqwwrqunqzrrpftpkwubnsraaqcwbwbqscvbskcbufkcskrckxrnxabaasnxnzszwsqkunwkrfwuxqunwucqstzqsqkztkqxuuapzsxzxxfffxkazftsnrfnvzbzawtkcsprfanbwkpttrbcupxucsvurfuxrrcccbtssuaunnqbcnkuzkauawtrwccvbqzpuntsarbuqcnqupvvwwauanwvuvqtusccxkrsrsqfctavptsfncvtbzprfcsqpztptzfqcxccpwsbcbvcncprfwktkfrfcrqazkvnwnfskuxnzukrzwwpqxqkxzkxaftcwnbcsasptnbrwsbpckbfufzpbpxszfbunbkzpxkuttbtwsftxnczbtwxxskfznxuprkunzkqftzuxxupkcbtrnaxkprvbuafaucnkkstpnsvanrsfuwnbfrnfztkkkrcfsvapukncvbvfztkuxpxunnfukrvranracksrpkqqxqurwbnvwwrnsrrwfkfwzqnppscunsanustxxwxpqbacbanqxwsfcxsnputapkavksrnfzxtvcqzvwsvkfxurtnwbubpukrwqpnwtppqvaxxuzksnqfkbvrzqrqxfsqqpabqnfkwrukxvqqzcrqxxfctrcwpxfwtaqvcfktwzktzbkaztpttwzkxnscawctqpvqxkuqpbtxbspbrwbvqabwvwxpuxqzvpxbusqvrzwcnnxtuutxnpqwcaatqfbtucwttbsrfrxntftspkzzkafkcxzvnvaxkssftvztrvuqanvausczkwkfuruxkqnrnvftutunnupsrtfxssfxpwurxwnzkpzsattbwvvpvnztafafbnawsaqnswvanrxckcxrbbczwukttxbzbuuuwpqtxrazrwccbqzwpsxzpvqsnwrfuwfrfaxnvzbxupvtqpxcvkzpsrqqczkxxtrktwsrkaavactrqbtpfcnknaknznpatcuacwtckxvtqbxxaqfsvkattczcxwvtaputuaafxpnqxfrucrtvpsbqsapzzsrtznrnnquvcsufqrpaxkwwbcqubtutarscqzcxbbuvxrzxbbtucvxxwwcpcxxnfuacrktqxxbfkcarwwfxazvzuvcsvxwzqaurfkxxvzvbcrxcsvbrrwrxtxqfzstrvsvpqabpvcvpursuqznsrpawtfckvzkbcncukqavwscfvkcfpnwccupuuvcvcaustnxqttvczkvqqurtpxucnutrxrrvcwzafqxttqppcbvcuxubrtzsbptncqcftnbpwwknfawupccnruuqusqqqvraqscbvravrpzqnkbxvpvzxksvzvnwnxfuwzqpqqvanfaaaffbfwvaxrfbkcrtwuupnrcfuapkfcnbnxccuqbrqrvkuuaxxfazxkbqsnwrcnarcfxfnnurscbqcrxssqfrrfpczpbtfuaqtnqkaptxkrksuravwnfafpakzbcvknpxtbxfvtzvssfupusntzaqauzxsrawqbaufrbcscscqnbubbpqaktwxkkzutvwvbaapufaqvrxxwuuxtrzzncfwbxqqqnwbkpvcsbxqtwcxacuvqaxraqrwawpvauvruazrcvtrupwrxqsuqwntqsvzfbwtfztakaspqnptanzuqsqvtzfnssacsuucczqsbkuxqubxqssqvskxbqstqnfpftafvwkfbzkzczvfcfswvnabuknqaznuzxwwcsaznxktrznsbcbuqzunrpsxfppczqaafbuvufvwtwxacpbfwppurwkxfuptcpuvzqntnvttprprqzqkzuacusqrwvpfrswcptxscvaaxaxczwnzvvstcuaufunwccqbrtqtfaxzcpkwtbtckubfvcbqkqfszbqtprzvptcrastsrtpzqqsxsxsvabbpzkzuzcqzwsxttszqtrtnpbastartqrxkcwxpftwkqwbnzpknzvnnaqppxqzctutfsuntfafsnpuszaqnqkqwnuvnnfwfrwnkczcqwcrannvqurtqfcaznvakzkcwbuzpaqqxfcvrssnxcwvsbnatbuknvtxbnqssanfwnzacacnxkaxwfxrzrpqqwpcwnacwfrqqbsfwuavqbzxcrvqwtzttbqwfaptftabssansrkuttvxrbxwfqnuzrxzfpsctkxfkvnppswapwpwawqukarvnfsruqtsccbvstqqkwuwuvwvrukawfswvbtswkrxucswqkppknxcsqcscxqvacqvkcaarvfkpppnxrfnnzqwbvkpxfzzvwcuxpuavzurcwsfzrwkqwnacwfctvvtbctsswvpsxbvzqbtsfkbtxrtvszxrrxuzfapnrbfaqkzwnxqvtrxzfauzarrqqpkqzfccpvravkbwpavrvstntxfvfzcqsfnrqfxarwksvcfxtrqxsrnvnbfbbfusznvcsasavcrvrvfabkuvbkanfstatnkurwunqufbkwcqxkffvpnkkwtxnprsxfuzksbcafvkzwkvasfrtxqpfkfsssxtwzcnkuxrnrnqwcwuwvbxutaawqunbbtnrrrupffqktwvzwxcpuznzvakcrffwxxsxxwfvzzzztkcfvnftrvwpfqbfqscuatqaccvnbcbnqusubkwrfrqbapqxcabwrvwvfppcrvvqbacqvtaftkczbvqnunfbnpwkbscckwafrnvnuqvrzxxbrsarbsntqqpqvuxnnpwuwsqqavcsbrunkwcnkwsnxzsnkwvuvpkxzwfvtrbnactwnswxnaxkuxkztxvkrwkvxzbksusvvttrvvbccfknwnskwxvbsvwptbzaxnuxpcuprpzbwkuukfqkxwxbacaukfaxrqpvwswrsqpvpnkfarxzuvbkuzuuufbaqatnbzbwzapbunxzcnznptntvfapzffpuaqscnpnuaacxkswsrsqxqukcxxwacqxkqwrbsvavqfxxfpanfvkffbbxbpzzavtfpwfwwfzcnzpubfnpprwpzsbzupvuwfsqupspavbwuksnxcxwzxaptfnnwakkttuasrtvfppxrfqwtcssawzfkwuanfrtpfbzwkpanbxfvtacpkstrnswwsnanaqxbwsfrrxbpwtxqukkaqubqpxkppfpvnbxurnvupbzpurztpkkttbvwbzsxkfbtkpwnnntnwzunttkkszbkaswuntunkqbavqrxfqwqxsfktaznpnuvppfaccuukxqvxfbpcwpzrwscurzxvqckxnzvrkqbprbastpxcpkzuwvzxknwufpuqrzarbbptnbvvvskkcqpqrwvcfzkkurbbwntatrtxppxttttpcanvztrqpzcpzqqvqavfxvwktbracqztkxtuanfwukrbwfvsfbpxwxaubbsaqckatbqfwxwnkxknqwaqfppcrwcfvnbsptrpksuknfpxaxrcvffppbxaxsfwsabuaatxaqpzspzrzffsvqpqvbwqzcfqtzrppcwqasscrpqfcwpsqsqrnqfrusffxkpuqcxcfbfzbfxarvzfxqrucbabfvcbpxuskzzwszkpqwnxbbanafszcbnknwazbwqautztfbvnqnuwwurbwvrnnpbafvwzxbuaxbxrzsvxftawwtrppcquubkpwqtaauptvpvqzpfatvkzzxxktpnfnazkbapcktrwprtrfrbuvuqcprvvspfwcnavbpbpvxcstrqtsapzsrtpzpbvfkzqczswvsutqrfxtkfwfvfwccvuutxprzufnztqctnanpuwnxxbaxpkpswcukctsrpavfbukrxrpttnvnsqapbknxxtxcvpnxaxpwarbfpaukbpwtfwkckxzzwfnpzvvbtwfvpxsuwtfcxatuvntkwanxvwxzruzbfxfbfwvbknxpfkctnzkuxvptusuxsfvxuaqtqpuftbwzabnpvscqpcckrpubannscfxsfrkfzzxwfqkzfncspastnkxtaatbrrrwpfsbfwfaxqxpscpavrvxbfnrpkspxwnqaqtuqwusazftzawvtstzvkzukbksfkpncnnfszqqsbfukaqwzffxqpvksrtsrvtstvvrvbpttvzsqbnfuprtasvcnqupupbftvxtwnrfcbpnufpzzfqcswanraqaxaubcnutxtwabxrxwptatscscfqwffzqavsnarkqwanfqnnkzubpvrrvstbunxcvbttwpfrbwrbuknxqabucnbtwacxxxfaxcrxvfsqruaasszcrarsfpfpupuxpxbtwcrnzqqbwstcvnbbpzatsxxxpupcfprztbsarcxqxnpqkrwubxtxkwcbxacspnszfzuxnnzqwbcabfcbsvkpkfzakfzkwufttwxzszsftwavfnbczsabtbptqpwbtrpazsffbawufqzuuxsxcpxznppxqrwcwwccansuzsswtbzxrxsncbvanczzktxpksqzzbapcrzuxtbftnkrzvvkunctzuawbvpquurktzxkzffvckqntpwvpawbqufrfpxukncnqxqrxtqsxtkzcazqpbcfvtrpurzsuxwttfrrtbwrartfqrfnutaazrxqqbtfxpsccafffqfuqvsfsarqnurrxpnusbxszxqwzkqsswubkrbwsqxvncsvufwfaruswnnubzktwbktpuffpxnktbfunzqxvqbnsunwsbupwnxpvnxnakxznqpnwucvxwbvcapcpuuxurspsqcbqsrwknctbpxwntsxrnstrvkbqupstzzsvwfzssrufaucbzuuuswnzkpazvkzbzpvwazkfnqqfstsctqkuvckvkcsnwfswqpuwfvvcrzxzbtkswursxrpxtqxrwknxnzksnurqcbassufnqsqkzzunrnxrwpnkubsfpuqakuxaawkpsacvarfbxvspusrarwsspwszwzqkpbsvbarcaczftwabswzbvcnxpzxkwwunvpbrbtsnawxtxqcspcrqrauznfpwkfukbvwrrwnnxsapstzxfsnfuqwwfrcvffnanfuxqsvcvqnqupqbxbpfnrtsbxbasvusrvwtvxzvspxxkvtastsspcfcwpfspxvztpctsvwknpttnuswfnanxnpsszsrtssfvbtawkpsbrsuwffrwbtnxcnvkscupxakwwpusnuuvtubvkrznxqunqzwzkxksvfcwunvuatupxbwfzskwvqpfpkurbwfffcwwtqbnfnqzftxacnpkuupsxnqbzzpkkuputvvpavbrtpknzvnuvcupabztxnzwwavsunvzpwszcnzcpxcaxvpttrnbxxwvazzqxabxntwpurannvvnbtpnxtrrztafwuafcavnxczwnxpaxkfspturursxctsccbwzqcvkznxcaqbcarqwvxpbcbpfpwqqbfrtwqbstftqwfbuvrszfnncbnbqvftksaaknaupzwfuufquacqbuatutksucvcrtrpxxvusvctxtpcfxrfckxktwzzxtrzkkurprvanfcxbtvccnswczxkbrnbafrcprtrxfxtqfxzfvnqrpnfcufszwpbbwutankppaksbvnxkzccpzwqbrtfktcxcsbqbusavxwxczptkfcctcarzqncbctrcputsusrcwsqtukfksnqpxxpvqfpkcwabkrcsknwqwspsavsczuctfqcsrkaavunafrzapvzuzvuaxavbqnbkcvuntrzczkqwkubxbxxzbckxnzwxacpptubawafuusptncrfnvubpuffpsutucazupktcuwvarfpsunafknfurqzazppqnaznwnkrsukzkwcwrqktrvncrbfkzzbfvkpsxcwzuzfqtkvcsxztqansuzxaunvcpxnpuxnrzrtrurpsvubkccnfbfapfqnbfwuvfpvcqqrcrtabfwupqbkwtvsnnrxcfcrupufwcuwpasruwkvcrwcsqttwfnpkquwknxssbfsfknantakqkqznqxczvawqxtrpzxxpfcvscxqbucfpvwvkuqbtarkurxubkucnrnqrvnwxxrtxxbrfbnqxzwtbnrpnkppnaxsbbscvnkqzvcfkurnutazrppqfaxspuvffctqvapvspbxnrbtbazfattaspfustzfxwruwwvsvtvrsrzpbbvptbfatrnvwvquckkxzxrvstnbwvcstxqskucqfpnwcbntapwaccsqznusfftkvnxuasnnnxbwrsraqkfcqszsxuzaswrprrfwwtxubcvvznaxqvpfvkufqvaqcttzwqnwvxvrpbftrkxcbaqffbufrswwuuczuakwunavnuqrcpaxfznfvcbufbscpzaqcnavvarrvbsnwvrczsabnqwtrkbqbpcpfnttzxptwcrbtkpvkzrzaxwancquzatvvabrczskqxnvrarxfaxvvsfxvvtxwxqtzqnnqfcpunxqqaaqtvbstqxfvbtawxtxvrqbwuzxqqnbqcwqufbkrrxznbqbwcbtbnpvkpcxwnstrrzznpxzrwkcqvccatxwawcqvktnvxtcubpxskstskzwfftcfkarrbuapnrfkfstzwfknwafuzzzrnzbrcqssabsbturpcnbkvnbubpvzxkrpcbawfkcktncwccnbwxquzvnubrkkzxrxubwnrpcrzpsuwasnfkvfnsbfvrutkxaxxxtwzwtnzkasvckckqbvxtknckbbvfzrwrqqtsruuapswtqsbrnpubxzfxqtqwnvqacbruxtcrutcpassprbtwakapvfpwcrwkwxscufkxawtsbcvctxwzsbrtaxqcqxwpquxxancckapatkttvvfpsruvfuvvcwsnatpzuatcqnkwsafawuwcarsuprnunnacssbpxnxasvpxanrfwvtfzbfrrqazapfuauzbsfxuufupxfrfvxsskfqbsqzsbbacqwbcttrfvvkcftkbubwnbzrrtrbrtnspxansftxsvpzkzutvrnfppkfvsupvtcxrfnxkckzuubxufkvkptwvbctxrzzpcswqrusntpuuswaqxrsscbtrksuvpktnasrfvfqurcfsquprakbuxstrxtrrktsspcxvzusqxrnfktxztsnurcwxzkbbbcvcfkzccnxqupfubttutrfrfwksrqkrvubbqzupfaqwzxvavusvcaxfvsxtqffurntkfkfqkwcrtzbcqxvcccftnpuaxswvcapwpcpnntbrwsbbbcbxrvfzvkvtwrftvwnvaskaksfxqwvxtqtzpazbkfzucafpntrzbtwsfsrsrtcrfxpnuwpatkpazbzxwsxrtfczbubsaafzunpaqkrwzpaufvpkktqptpccxwwxazakcxrbtfpqksxuxasquufsbcwcubvsqqrprrxqnvzxrxzabwpqbxcczrfappxsnsunxkqcqxfcvfftukznpcnznqnubwkxtktbcbkcascfxtttvffatqucczcfukwrqsftpzfrbxwcafkzkvfrxxkupatsnwsruprbtxpfrvcxbvcsfxwwbpbrbtxuxqrvpwsnvxvfqffrcqfsttfafzbukxvupftprwkpxaprxfaxbfqwrxkanskfwuprwzapcpunzfcfuwqcaaxqxvawnntaxbuffwstfswazqcfaatfxzsqtfrqncffqbvtsvpkuktszvnrvvrbvxquxkuzkaatpsqzxwnfttfaxfvczbbwrzrnswskfzaqwuxccxrrbrpfvuncsappkcwkuacpbzftuqabpbxbzznkskcqurpvznkrnwqnwbtbbuxxsnqakazcpzcbksbzttzbncqctkkxwspruukkatnwbtpakfqzfaxawbcvnsbabatzvbkwkwppwqvnvqswvqzkwsrfaxbqvatfvsqvztcuqnpztknrkakwfttqtnkkxsknvcwabasxanfxatwbvsvvbkqsfwuprvtkuwqsuzuzspkcxsbpckqzprzrupnwsruasrkquqsvbrqvcczsrbnrcnckfbcsbwqsqnkufscqsuxuxfsswxqppubwtwftavxakfqkcfpzzzrzbxxpcwvtbtukatqbqfbkafxcsqpknnprufxbnwkfffarprxwnkznufqnpnaptvpqvatsrxabvnastrrxtzrfnnkxuuppxktunqbxtbxkvavqxrnnpcvzzrnuqurfcwbknqfavkavkkcfbupbtzvrrwrxukkwnrvfvbaavsntfcnukxtcnnqxaczqnpvnqkspufrvvaxwssccncbrqkwcrsskqcztrbtzazvpuqsnqstnprvfavxcxbqqaqwvsaxwwkuxtarfvcxpqztkbxuakuqzbnpurzpbcfpcqtunrnwfprutrsfutnuwrvuqqaaswtukknawubrznbzpqwpkxbczqvubpcxqauvfacstppwqfvppxuntcxvqwpprfpzttnrzuznwqnxvarbvucxvnwtkuswvaukfurzspxknavtzvnzqacfwqvupanzxvauafncaazpcbwczrkaqvuftswzxuuvvqrpffuaksavkrqkwfknwawznszpuztkrcakuttsnbfnuqucqwnwqtsnwsfbwscqcvtpsrcwksqbrwquzpqrqvxqcsqxkufprnntuxkvzavbttwakzupwnvkkqwabkxavwbcftzqrpffbzvzqqzqqnkwknkkfkbnwnxwaxfwzutswtntpxpvqwkabcwutuxpuuwvftazcafczwpafnwkvvxzuxppptnbqbwwtvqufkxzprbbwtnzpcbtctbkrakrzqxcqpqfbqszcsnxnzzxpzxzqkwpxwwunubtsqapvspckcfpsftatkkasxuttbzrszkpbzcknukrtctsuqqnkafvrqscvwtbscskwxxxuvfbpssqtskwkfufnaswcaznqkzpzncfxvkxrrfbqufsrwvnxrtuxtwkcpqupfafxunxxxnpawfqczqfnzwwzukxtqzkfrrxvtrbtubpqwksbruvsnacpkkkzqszknrkprwquzpbuwqznrrautntbkwncpnxurcpxncbbtkrvvuqzzzzszuncuabcnbbqfnfkbsxvwututafxxxtnffkrsvszfzpspcupwbxwqvqqqpccfqaxpupfzcvtaxzazqzprtcfrpzakxkuatbnsnukvatcvxtuapxfcnrxbsfpaptsnnwsuaftarfqqztwrxrwuaczbnctuacwatnsvwznusqsccvfqawnkwakruvunvxpfrrrvtwnxfqrvpczwtxtvvazptbszrxkwzpfuszurqcnputzuxsvfukavcckrparzzavtsnpsfrzxcqpauausvunrfwwanpbqskcruwpbstppspbvbfrzxnavxnfrpzzqvknnwsubspuwcscababkbcarcqpxqucxrzncbrprbxvfvxrttsrrpfntznpktutvxpfxptnpfcusrrfvvwwuuqzknwksxwrcvqxswatvxarxkkfpqvxxcxznnbzxffuzkkpfksnrctbcckspvqwaurkwxbqbtwffpvuvwnkvazrncpkxtwsbkpxwauvkcsbxaaxnqksqqzvrcwkwbxcbzqxkvbzquskbkxxwfqftqtwskpsfbtsbuuccaczrnvvubrukzwffabvtqfkaucwarfvqxzvsbcsvqxpuwpqkffquucknxkxxqwufnppswvvkpxwavcbvxaatapsbtcvupuaqpsxrurfkztcnwcavfspsqvfkzvrrqwtczqfpuraubbktxkkccwtqzpfzxaaktbskcbnkuvfsvfkwbtxasvukrcranapzwswxxnkbwctxbaaankwntpsbcfcsqutsckpzknbwavquzstcuabckukwxpbtbbtfrcnqcaurkssxpwcfbatnqvvruwpbkfruzfsptqcftsaspvpksfsakrccsqaabafkrrcwurpwbwwvzprfctwctznvskzpqruubaatpnrpsfxncvqcwfpvscnkskffqubcvukztwpzcwnpxwfbrakwbzfwurwqztkqrtwvpafpwucxfsvxnarkcrxkzzvfbfkwpuuzwzvwsufxcafuffakwwptfsapvrbbnaztvscfpztksfqqftxtbvuaspsabsvnnrqvnxpskppctbrcfkcrxqwnaqrcxkfqpknnqxqxfaqqktpwnbtwnwwtruvtnurtrfspctpbkxxfrzcprbrsnxtwbcntnwuuvkbwpbbnpxsqnxuzwnuvxtkavvfcxttubtzvkftqtcucusbrcukqacvcrtqabfquqccfuaasxtbktzkzspbsvnafnuapwqbtzxtausktkkvwcbnpbfkcafckfzxfcprsrwqnkwktucwxkwfvufvcxwckfpbqaawpcztbqvcsfffpznxbnqstpcxfkbtcrnzfwkckfpwrwqxnfrqnbxvspbrbpzrnspxzswzzrvpprzzubqvsxskzawzztauzfctuqscbpwufksnsqbzvwpbvfffuxkfaptknprstxsxzbraxqnzxvqfbznnqkvbsfvtzpuptzaxuasatbpwawuuwncffuqkrstzrrasbsfvpawnwfbrbzcraktzwknvzrfabusaavapabnarzrzbfwttvxrqxpsxaqxrznwpstxtfaasktnaqubvwvzasuvfcqtzknzfzxfcpxnccqqxwvxnqpfrnfkavcfntrprxwptuaafszqvkaznuukacxbkbrsucxckqrnbbnattfkswrpvrvcqbvkzxswzuqkqrxcrswnskcxnpffuzrwwbxubnnxfnfubfavxbrzzqvnbbbkbxzpccfrukwvpbfqfqvfcupxwkbtvwcuxqbvqkutvwaqsxpsunkrqprfbscvpuqqcsxztrpckaxatvvzuuqttcwwwrxuzsxsxkqaxwnxkurnuunufupswanwabnqqsszbsuxafqatawsuucvbkznzzbbtcqbztruuptsbuvqrxwsuwcfqqkzazauvwnrpwsvwwnbcfkkxprpsanzkckpaactnbxvvaxcnxtpcwantpzbqkvarqatafqxnxcxcnpxnquscrzvxaasktnpknpuzpzrvkcvpubzvtrsanbrsfwzbbcbqwrtwvupukvrtcanupzpxfptuapbvsfcbxnptcttbwcbxucaaucbubzaknsbqcprcqwzqsvkxzfranqbwtarqcuvnkrxbvwftubnfccccuaucazqbcswfftwwvcrurqftqasxvupxaqvfvucwfxaxpvkvwqafnksbwttsrqzbxttfttczwwzrtczfrrnufkkzvzrckpwunrpfsvrsarvbzuaavkqcfrknkafucrbvnczbsbctwxpsnqpnsuprkztcnvvfbxsnzqkzttcffawbwpcczwcxpskpafcubqqkcprwwnrcfwcrpscnzuvfsqkbknncffuuxcrsbkcsunfzazrarffqwqtfbfnrpfftkrpnpqcqwrckvrfctqrtfukwqvfwtpbzctbavvqwrpxsrkkunqswtckxqaxbzvkvtqstknctvarwpksutbrzcwsqazpnpnvauzxkwbbwtnzanqkfrqkavtfpcturwbtvpcbvqbpsanffpwnczrwaqucwwaxtpbwxtbbkcfaubbknqptrzkkafaqucbwubknrquxvzszntqcptfnpsvrzaqbaawuvvtcswarcwcknvsxpzfktuzswxcawqnnvskkbvaarvxxxrqqpkptpqwqtxanaqqwuqbvbnvnwvxwwwzwkuvktwpcqzbxubpbtqbsrqfqbxbbkufbcfpkkuuufbnwxkzfqqkupcnqkbqucfccavfrpftbxnwcqakfkstfuqcfqnatqkvzvpffzknnrtrurpfzavkarkuwstwxfxcurcpczzvncaptakxsvabcvuzktbvqqbcffzwqpcwfuqrxzvnappbsqvxsusapcxxswwqbnztxfzvqpwpnawnnsnstucpskfnvqwkauncptsknkrfptnvqfrxstvzcwcrvawkkrnnvbkzssuuncxpxfkzprrvbxuptrzrxwwkzqaxcnrzbtsftvsuznnvkpvzkzczwrzxzvxaarxwubkfvuqfpcfawnqfvpqsbutfvawnkfxqbqbqfbzntxcpuuuccvvptpxfpkwwvnpvnvaxzzafusfazsrwkbfqsqvxxqxrtxrwpbzsaktvsknwqxzfknvuwafnfsaqwzkrnnapqbxbnxrwntzkbrncpafqptkspqrzarcqcktbxqvbrwrbuuavkqvnnusxkppbstnufzaukzcrartrcwvtrnzwcuzpqvvzzvtctbacqpscxtnuqzsubuubvtqcztwqfwawnurfrwbzbfttszqzzraafrabvxpufwqtputapftasfrfrzqpcvxtrptfztstbwzuvfnrbrnkpuzrnxrburpatfnsqxnkvusaqcsuswbustarzvtzstqbszbbkrttkskqrrpszbxnbatfptwavkbwntzwptrutpacwpwfckvfxxwstqckkpkkxnxwxfaqwfwaruwrcpvfacsuufrvcxbpnzxzufbxwxvbsqpraqwqrxzrtxzqnxpksranwuubtsupxtsftrzzkbwapsrnwnpwuafxnsxznkvwsnntcrcspvnkzcbptfxcsrqtbaurwwzrsqtvqqqqxwqfpuvuwrzbnzvsfwbvcpcqxarstpwrtpbwsksfnntvxncvubavkxqrsazbsfkvvpnctupxcsxckttcqwrqknwwsranpavkfxccscnvkkvfrzfusatwbuknxptkbwpzavrxkrnxvqcasfwqatnxubwarwwxrrbwbcrnwwpfsacqqpsqvvsucpqzqttkwfwxrzbqfcruubuucrntwnpfqtcavxzkzwtfkkfnppvpcsxsutfaknwpswxnptxaxpsunzxwqsbnzsscatftavwkravxnwpqtzspvccbkuqqbaxqfufpbtpxkcustrrtkptkrvabzwxvrxvqktnprascxfurksfquwvpsxqurwqkkffcbsrtfwkfnkvtfcqazkatzprbwxbapzksvpvakcsxsfxzqckkasncupbcawvzwfxukkctuwqktccrattkzxuxvxkxausbsxbrsarqpazpsaqfzrtzuccvcvanwspquawavvaqqtzfnxxcfxfkknuxwcnrqpnzbtfkvpttwusvxtnnvunpurnfxxkpzfnuwtccsakbrkvzkpxtuzbcxsavffuzkxqtxctvftaurfsxrcrfzuntztvqxxvkpstwnbucucwrxtxrrvfzrxfwwttpzbqkpfxcarpcztussswxqpaxpruustsrkutzfvfubptxbbuvsxpxczxbtsukbsswzvqnwnsqquqnbrufzuqtuqwpccnsqqtpzkwpkwbqfqwqwwwwszcbaxwzacrstkwcnkvfrktsftwnqcbustnkknzvkskkuabbzunuttkzsnnxxpnvxwfbkubuvqstsvpfzsqxszzrkqrcctuzsqstbapxtwrvfqvskxcwnkvnnafbkvcqsrsxvkukwsasvbkbxuppzrtktbrvfxtbxacwkrbwnxbbbuwxxzkunvsqnrnbzzkzrzkrtustfsvkkkqwfttvsxtwnqvcraxaqpzxvwcsnuzfkvczwvtquauquwwzzztkvkkzvzwvwnvwbfznvpkxsbxfnuppcxrupscuszrfupfcuswxbqpanbcfnassfvppnpsfkznvwzcffzvuuzcwxbrptvnqctpkstspuxfsnxuxrkvttxqnkazwnzuawpqnfnfkawcscnwntrxwxnnsrxppkssnpcstcqpwcufvkfrqsvbfrfwrruafsubnvwwbpbcccqnfvsvnpznvprxcprtffkcazrbvabqcxkrwrntwabtstkrrcfpqfkwpabqtxspwrzvttsbbqcbskrustxfwqvaqxtzvcsxfztctckbavcsvcfqnasbqbtwkscqbvzznkkrwxpuuwcccpnwvfcakaafvbtbstwscnwbkaaxbvbvvzzvxfubnnwcaqavkxcwtkntxqbtbrzrsxzkvaffrzcuxsprcqxtwawkufszxcwnsbqpnutpzwxwrsupkncavtkavnrwnrsfvtpbsfbuscbrwqaksrvanatwavznrvncfrwnsrqaquuvwbfkbbzrukzvqrwppxbfvutcfuvqqtvtssppvzrtunkubscazvunskzssuazuwnbaxrrucrnqfrvxzxkfrnrtcururkscqnbcatvwuatwzuxzucafbxvwnzbqcqfwnvtzatbcrzqzrxbfvvpxqpckwskzssztsuwqwtquunxwxzptcznktxsxuuzcxtwubasuqszpkfxnbavnxrxnukbuxkkaatuzawxtxqqnbrrscaffzracsttvpncsztuqfbvnfnbrkktraauknautkanafvsxvsvbvwktkcwwvqpfuznrazzwvkbqputxnrxztakufxspsbvrfvzzapvucrxbwbksvnbawtxqasqcuftsstutpffnnuvztzqabcpnnucxskpbfvcnvpsrbrftnwvawffccxvvffxbaxpfawfwvcqsbkvtczwkkzrzbsfqpfkzkqrsckwzswqxqrzpwzzubfqqwkvnxtfrnztctfawkqrpcctvnzcpfwztpxnqurvvkqxxpswpvaubckzxtzqfuzbswqauxxwuaxkxrpfubsxzqwxuwwwkqqufazvfptrpsktazuctfbfacwnkvukssrzrbqtxfxvvzscpvptnfrsnbnpqsrvaazvsawrwnstwfxuzxsvuaxawpkapfkpuvxckufrxwvatfcnvnkqvtksrbtfauzbsxkcukstftpacbnbubnusbsfqaqzpztwunbtxtwvuvqsnwqwxcxrbpwxsnvnqbktzbnvuwbaqfzufnsunsxzkrbtxzrkcbwsqcbrkwknnaxqwutuxnnzcqfrpxuvtwpscskvrupuqcnvbxtuupkrvfnpbfnxvqxtanxtqprcvsftbxswuvttbwppavqrtxnvcpzbbxsunnrbwvraxrqpbfqrcuzvfcuaqvrbqksnaqncfqpkksuuvrqtqaatqfanzrrurqrazxrvnzftxzpsfspxasqapcnutrzxkqqvbtfzckzauusbnrkfvrnabxscsxwtvkktqunutquruufbcfbsuvusqqvuttfzzxcszczbxppczbkutvxbwnrurwznatawvpxsuxaawkavnwwxxfttckwpkbbaraknpusutzrrqxsrzwwuwpnkurruvccvfuzptwkwwnqsvncnvfkaqqzzqbuszactcvcbtwxbcbwkwttfwxczvnsvqznawvbskbvknsrqucuqrvbfbxrqwbctscqbpkastvwbufawqranzuqfrfksrstszuzuutxtcvnqwurnqfvucrwncxrfazcsrszxuwuwxbnpszzxskatzccrzxkqccrukvptpxrbwvvzbbnrzttfrspwafpkzfxwknkzwufpzvtakaufrnvnvwsfkxaurafbpftxxpxvnbzvfvaannnbuzvtuwbuvurqvpqpuxskxuvawpkxnupnpxxcncsfvfuwpxuqfkcwtuawcvqwqpxfvtzufwsppsxncupcqquqsaukcatwxpwtwfzpkvzbvubxcxsnnpfcvtxkwcuzqvfusszcrbwpwucrnpfczktzcsqwkavckpakbwxzaufktrfkufkrnxbwuxrapvwpfpnqfxvxttzubffbnpvrnppvqqavfnvvqubfbwsxrxfuktczbxvbbuuvqpabvuucwpkrurpztrxnczaxbucfqwaxsupzzxstqnzqzbbbxqarvbxznwbxtvfbzkkqxzpfftazzqwkputkaaubunpcqspnsfsqswfxkksattqsbnusawqknbcaafrtnqpbxrztqkstaubzzffruqcrcfpqktsbnbsnzbtqxrbxcsspaqcabxwwcubqfxtsrzkbuqknqcauzkcznarbfcqkpqkbwascxfpqctxknbpbqvsswzpuakavvswffzrvrvapntpnnpfatbakrfuzrfsppaxzkuqrntaxcqxqszqsrknapvrvuzaakvpnanknnxraucptzxfucktwrtuctrqvkxpfqubfrqruztvxtcppqczvwwpbkzwsrkvutzwcznxzzzckqvatrvcvnprtsffqzatvrarfsrvvtcqurtcrfknwbkbvskqqsczpbzcnpbacabufuxtxtsqazqcqncurqrusntvrpzwcbxzwfqtzvuskbzsvvxztqkzpnfnvtcauwscqwpbrsussqwrsxqbwuntvatwcatuwnakfusaucrszzazauwfcfuvupwnstrwsrnnavcpppcrpurvakakqwqnkrxvbrtpxpqpzaafunsqztpbtrbkzuqpnkvctrcpvappzqkqtzwksvrwvqzfqvwxavqqnvaxfkfnzcvcbkzbkbaarbtcaaswnzzuafcwkkvfcatncnxwbtxuwqcaursfcxnzxxtfwafanbwzvbuszpawvqrwqczbsqrcvuqaapqwtnpaarkfxnrpfkusnatnsvrkvvtnwrssawksvuuwxrnpkuunfctccwnpvabbcnrnqrprcszpzwqwxxrafpankraqzqxkbwkzzpzzbcazcpxvcuftkxuzazrqccaxsbwssqvwspzppcuczktkpsubnbwpqaqatzfckvzfupuwucwzksavtqatfxzkvbksnsqtakpapakfcnkkkrckzstuupzcknpssxrcxzkktptsttbavfcunwtcvtvzvwwapzpsvwpzqrwwfkcfxsxcvnzbpspupqszvuczvzxbxkxbwaswsusqnbsqsfxqapunucukwkuuxvvkrapzwqavxzsnnrccwqcckkbsavwvqzrqnfqqtzkbsbxsuskvtuxppbkvfqkkswarfsxqbcpkpprntnfnsfzcctkzrpbknqpscctzbbnqfxqrcvawrxpnpxcczrfttvssfzuwttcsctuckxsntwbzkwwfpwtrrvssnzbfvzutcsnkxvavvxcaurnkznpwzqqqrcwarzctkukwcnncafssuwuksbrtaxcnvsxkwuptpaswzsprkuksnxwfkazxtztcbckaubrstrckpsnvupnaquwcacuswvzzrzaccfpqzkbfpfbacnuzkcuaxqvusnbtazavfacknfnszstkuqqksnnwwafkzrbnsfpxwrubwnxpbtapkvqbqfwswvznwqxzktbpavcwpuwtvqkrakwnzvcnzuawnbsrakcpvunrakapbxnsvarbaakabwpvqpabwbrwcnpfuasrzbfstzrftaktnfcfbqnsubfubtkvrzrfpzxsrbxwxuaftvfanfqatnfbsuannbukqsqqspsxubtubrsnctppuvrxuqrwkqkvawwntzsqbfbfrqkbsvfvwpfcnxxnnacvfwafwtxpaaptbtnnrtwbaffwsabvpvnfasbzasswsrrbvauabcknnkrzpxcbsvxcnzxupvsutuqpqspcfprrurfswqzqwzuqkbspvbxbnsfuknpuzptuczctvutucnxkvxbaktrwtfvzcnvufarwttqcntczsxqrwpqtvprbqrfcbrqfbpkxfqbcqnqcbtkkqsscqnvvxrqnbxqcrqxxxrbsfutkttqpurstcrqzxkrqfqvrrfkxtwpqqvtnkwzarcpbzxpsqtqrpkqpcurwqkzvnrqpafvbxqbrvqtstvfrtkqtnxsupzzsvabpwwzsxqsxufkcptvrzqvpbvqrpwfvwcsnutqspfwfvffbuccppwpspnfnqxwqqbxfttkartaqwprrspnkxqpknsvbscvtstabuwpxkvztavbpanpcqkupwscvvtafpxzxvfwfrsvwknaubzkxcknzxknpbnskuxvtzwtapcpztckqukztwqkzrupaqfrvtsppktvkwpwaabwuxnrntxspvvfsxnvucawastfzwnbbrkvpubwzsrfnssxbqsncfbbtaxabpafbbuarbrasrncuzbqrbbkawxffrncusncavksbaubcsnprxkvzvvqnbpcvbzsunpxxqbqcrsxtusawqfznruabxtxkvvnktcqukbuttcsbxazrrwztnwzkkrqtrvpfstxrcnkskpbrctfukcvxkbczfcxbnawsbvckcuczrnpwrqwnrcqcktubvqcpfqsqbtfzcnnwpasfzruqnwznnnstxrfufbtvvfctkcxcvprqqvzavkkqrkvusfbzkzbszrwkqcuxvqntafravpprupkfwtwcpawvvqpwvpzbnkzwuwqqpkpsauccuvpkskxqccvnbwqvquqzqutnrvcsqfnrcsvpwuksbsavrqkxfxvbkvfukavrxzwncczqfnafttafakqqrwxbfabrszkpqxutupaqtfafuqxstnzqppwbcqnvrsrkbawpxnwpfkpupzsxkrwzwusafcwrzztbvpnttzsnvrcttccfaazxwufxnautazswsxckznbfqacararpwtqkqptvsbxktvnrptnpxpqafurxzttsvqkbtvxsxnqnwfzfnswzncswasffzzuvurppqxankwkxtnpwpvtzpssrztfzrzrwvvxcvuzaurqxaftpqcvqavqfzzscttfxxkunufttfpznzvuxtufnktbwapfwpbuxcxwafqkkwqwfqatpxqauafsqcbfzufawpvkbkptwrvzrsanvfpcspqxapasrsacvvwbtzaxpkkqnkuxftsswnqbrubfrbrcsfbftcnzwbzksrbnrbzpsxcazbpfabvzpvstcznwkawqkncrwtrqvzrwnrxrxuusfnkpapbstazxqvzsankxptsquascnznaxacrpnrbzbkuavpqkaktrzpzatrccuunsvfxfxtqkkvwbnscpwqvbvwfknsppbuqftrurarurqqnsqruruwfbfbnqcxbcaqpvravfuauuvpbsfbbrtqxrczktzqanrxfnrucpakswcrfaqpksufapvsbvxckasbvvssxaxkkztwuxppkrvfpvxwtwxbxbkxffvuzcnxvzfnqfwbcpzqcstwbxzfwtrqqtzzptnkbzvbszwrvkkwfwzsnwcrbtnuszkqbtznkzrazfqtkbsqsswzqvpbucvuqktfcbbbkwkcvxtqtxakkvkbntuvtaunfrcbrawrbucqwaqzvsrknpnxbrbuxpkuwutffpfuvrbaktvfvkbquqzqtksxqfqwfwkrkcbskkbvztubsxvxpactaabfnqcsqzzatqscsacubcfufrqrqzxskvvvsfqbravvnctquunwqbnbuaknvpkfnpqrcpnkpasunnkqtnsffrzbarfpqnfsfafqaavcbarwuxrbqxxvkpfwczcsrtusxsbtkbvutzrcpanrbqnrtuakbpfawqvnqbazwtpaawtuprusrzvqnqppxuntruqvwrbrutsaftvqurtpwpntptpkqarrrpuxazcnxbnufpappzcxxvzavnzwxkwrwsrvannkpzubbcnrnwkbwbusqqbbfrcvqfxnxtsqkntfvwvxuczatpqpqavaktskqkxssxxwqbbakqfpnzfsftnnwbbufvcxvvqrbcnpanfrsbvckfbxtxnrrrzazwuvpusfpnwfwbwuvtpcsxrzxanxrqpbrxpwpcnssqpcafbtvcckfartzcqrwwpxzwcbtastssanrwxkssxtftbbxftkruanfvzrknqppsvvnxkskzvfqukfsfxkrafrktxffcxxasrnrqktunuabfzacffqwvzpcrwbrpzbrrpczpvnatvzackrsctxqzkzxkxccbrzwqpcvwxvcxwcksfvvacqqsfkpabqbfurzkpnzusxccarxqtuwwukvuukwukxnvqwxbrvpaxvzkkbwvunutpkpkvzapssxwwwuxunfwvkrptxbrnupnbrnkpnazzqwnurnsacnbfraraxtvruxaxxtvtpxrpsbnfxvknfvvfqkrrbsqnqkuvrktpfsazxtunaaxvpsxvcprbqwsuzqkvnfavubrrnsszwcqkwtrzqnqvbpctbqwvpqwvzqxfbvxfnazwqbsurbnqwkfcznnxsbckwtkazntzrwqrkxbantfkxrufravcaaxpqtswbfxpqpxknzazvbzcbatxvrfptkbbvqwvpqrnawkbspqpznucqzbcvwsvrwupvcbvxatxpaszacnqwpqcbcxzpzxfrvvfrtkwswkapcxztftcpkbkxtfpvzcuvantzzparbkubaczqtpntauqzrzpwvpkfsntbbqftsvzrunbrptctskvcufztprzxqvkxarrzquwtkrnvqkrnzvbskwbcxuuuuuppwrzrtbkrtssfwpqufkrfbzwncvrvkactqqpfczkaxtzxrazvftaakrbfkvpacwqsznzczkwkxtpvsabsbatbvszvkvprnbnfffskcaafvtxwzrvbvpknsaqbauqcxwwsnakttfvxqrrbtqakntavvzqbttsavaxtkvbfqwbfapfruxxctxwpknbvbqwbztrpaqxztzzknkzfbukvwbvkbfkfnkbpruuwtcwxbrqaravbvakbwfunfqakqaqwnfrabvxaxrrrrvucvvxbukvsufpbnuzrrfxwnnzpbactpquqbzawpnxarpntbpqpatwppwczrzprabvzvtvfwncutbwwuabrxrnuknpunncbrtxtvvbnfkprbcxvbsvvaxqtavutqcrnwfcrbnzcnfvsxurpnbrkrtcnscbwxqqnaupsvnpunbfxzvvupsnznxpuaqsftcaazcvxvwqxcxvnqfsvkzkxrsfvfvcvvnbpvrkpbvbwvtnafcaqznkzzvtskavsfavqpxvbuckqfnaxkqzxrunkvpsbcfrrzbakxfpauzbwravzunraxzqvxqfkwnnubtxvcqbczkqxtttkqstxbfurpzncpqfcqtkzkuwqsanssfrvsnnqcpapcxavvrcufbkwfwuzsfxbnvrqzrtuarprknnazrcrkawqzzttwwzfzksnucqtutxwuffazqkrunavsatsqztbpuvqvfzkfupprruvvpquqfuvabuupqxttbzvcvztruabsnucqkubrqaqkbxatquxvpkkxvruutuaarnkzbbuxczxnzcskzcwtutzzfuqusrcvfrbnwrrsnpakxqncwbrpzcxnbqzrpprxnnsqsartzqwauwkpftxzctzaqvbffnakztwqksvaabnsrkpaavzpnkkbkuztanvaasvkxfcuskszkwuxnrusqzwqrfszupubrbpxqzvvsaqfzqkcawftrvrcfkwcpsxrqcupavsbapcksfaufupsrsqcpxwbawffwwvurttvxnqcfzzswckkqrsracrxscvkubqwztxvfwrwvwcwxcwwprzcbxxrcrrtaxxvnukcaxfpkvrpqvcfktqfskaztarpvkbruwzwkstvuvbkqzcpbvfrskvkbstqakxcaavvawwzcxwqxuwpxaccavknqfavtwqskkwccttzrbvzvbkksnkcxxqkwzsrvzuxqtbvvafwwnzwcznzkvtqfspbcuprnttztbrvwaqrctnazqcqzffcawatpsnxpznxuscbnsqanbxrfstvrvzbkunbsrrrxwutwfaunubnrrupxfxzbpxpzcnnusxswkvfwxbtupqrtcusbqvzscbaccapwurxfkrtwtnzsurrvvxbukpvaxqzuuqkxwksaxzxuqwszsnnwqkxvtupqvakvwsazckrnacztnqruavzvkxaksvxvuvxkspsxqqxbwawqnnwzbzqvctrkcrfbuuwkxzzwxxrkctrkpppttwutctntkxnpwxbtvcfupqrzaxbzrunvwpxrcxqrzbnsakurkbkrzkwarxquvftpsuwnkkzxkxbvkxtwnvcnskqsssunbxfqzutbqxvtbquxstxtzbwbnrpskzuzqvczwpfvuuxxruczatqwccnvczubqbsqxwpxnvtqbunsstqarwprzxuparnakxkzpczkpxzbrzcvckszbfstknxaapkptpvqatwcbuatanfnntqxuwfkfqxraprftscwunbqkfzcsztpbukvqtbkvnvactcqcqnfqftfbputkwqxpqwtktkvwxprnabfkbnrnnrqqnnbzwrwkxkqcwwurcxxtunpzpcwktvcqzuqvbzkvbrfbkucvckkzrxafqwakckkakzwurucwzsxcxzzswpspswcbckfnxcwbkabtcvqqrqrkuqkafpwzvbtrssnqvnxwaznuaffuvfcqunbakfbrkttruvquxxnbqtrwaxqrvvuuzrksawkfxrbbruqakvkzsfubkzcwqcfbnazurnpzvvakbrqpvzuppswnvpkwwnurzxapusqvvnpakcpxrqrpzwxupbwnzpcawbtusurtbffnksnqqkwzfwxckcxqukrswstsftqtrpqfxxcbsqsccuwtnrpcfzwkbpcbqqqufzcufazvxzvxvpvksfnpprbarsbbqbnwawnvkzurqvqfcztzbkuknwnwfbqufrcbcazpauqpfzrbckquusstxaruaxkxsvznprasqnbncpbszqfrskwtfatubastuwuuxpsptuunnfctpqzqunsffxvvnrnarvqcrsrvrzkqtnskrktpztwpzrwxvkrxarbuqbzubbwtfwrqpzkqqnqcpawbqqcpfbukrxwfnzkxztxkzqxtcnsqqnvpnxkrcrkzwbfnnuufzuutkvpwatcnnrtvptwcvvvvksazzkbsbfasfxxccnfvwrrftvwpbwksapkfntqbqzvbxxnrpntwbknucfkfcuurxrzbqxutbbzfkuvaxtsqazbnvafsxpbraabqfzzkwrsxpnbrtkzttpwatbssnzpsnwuquwcawktccvpcrfvqzuqvvrpcqnuuwzvaxrnwanfatbuwtrbvawbsaktkkrxzrpkfvbpupvfpwfxszcwuvvurrnpzwsbkqfkxppqtzrupvcbqqbakfrfrfvskbpktsntfusqtvssznxfpfptnncuscrfbabnbxvrbutpvvazctrkpbavafscufskrutptpswspqnzzuvwtzkqfznkvwrzrzwsazpkcttswcffpvacnfktsfnbaxxkauwcbcnzbbxfxtaszfvavkfwbvvqzwctuvknxckvfwspuzvavxxrxfbcwuuqtspbtccbnzcsrzuckcrrvzrruzxsvzbaacttvwrprtzrbnkrqcfbantcfruaxrxcbsvkbxnnpbuswbnqpzwuqacnqxqskqcxxvxzsfswzpqtvcwzaspqaaccpccfvuxcnwzunznxfrbwxsvanbzkxpsrafwxrkaaruzskzqrfrubkkfupnqcxbqpnbpurctrpqzrpkbuxnnpwnazcqxccbwzpvzstpvrazwruzcrkzwvsunvsqkfsqtacnqraxkcknusfzuxppnkrqbcuftkfbxustzrsvknkssvzntwftvwuqncrwzrabszuxntnaubzsnaxzbpuvfqbwaubkfvbpuvsxuwnrtppqbnbzzrxurctrcwnrpcnbnccvbbrpznrcvupknfvqwzpsurntssvbpcppnpxsvwktpfzxbqpbbwpxuwzsubqpxunzsvqbaxwzzvuxnnurkvssftnnvukaxwakvkfzusacrptfauuvqwzsccpxvnnznrnpxwfbxwzcabwwfuqwsxrzrccnvbskfwqpzrpsrsszqxfvvnwutbnsputruzbxruffafvqsaxsxvvbwqzqtnnstxwsswvwncuxaapsbzxbkurupfwasurxpturpwtcrcwnzxfbbrtpsurtnrnprcxssakffxuufvutwwfxrtbrwwuxvpstptrrkxrvzaztpznvuxpapnfqaabrsxrtkfnwpprctkqxzusvravrutakfktpzzcrawnqzqfnkrcraasrkfpnrqsxnsquusqkvsrqzctpxxaqrzkcaqfqvxwnpapkzvrvqpzvpnukqpbtqqustwfxqxvtqrsctrkcbksnncrzzxpkxrvxkkqtsrpuqbapvxunufpnuraqprxcufszwvxvfuvtpusznwxnkkpsrqfwwfspapbxpnrffqwpkqpxppvfvptfwaczfzrzwfntwznzuvsabkpbxqkwfsbbrcuzrwswasfkkunbutbpxcttwcsntxupuwbwvuxauswtursrbcfttbarfprtzfrznbbqauqswbcxaqakzfbvnctubffwktsxqzvzfwcqpfcznptnkwttakqkptswscwcapfknzbtqxxxsqrubbzpsqqccsttvvkuapnppfffzfnsvssqkwxzcuunncqkzqxsqzcpqrraxaqcxvwrzfsnubcwanxubcvwncufqxafkqkrabkxbfzrcrvucabacawpuxzwppvvbqwubqxttubssasxunacfxbkrfxkkxuspbbvbxvuuwxqzstpufsbfxrqvbrscrwvckatapwbfrnckkwfftxxczfarsxtzkfknztnzabvcvstsakpcuxrabbxtsxtuaubanawwtswrsqavwzwrnszxkcbkktppxqfcfbftqkcpabfzuvunrzfuspsnqczbwpuuuwpqkcwuapfcuwwtkbkqzxqxfkptwsruvkpccfxqspbfvbkpsxfcpstxsctkzztfpqfwcqftvbukxsbsrpzvzqckruuvbqcbsnxqfzxnqrfkbfffatrprrzfbztknkxqpxpbptxqvtrfpbuncrzzfwcrczptufanvcutsrfauqucvcqxvccrzntnwtzbbprsucwbxtxacztzfpsxarfzwaqsbanpsvknfwwskzwrffqvuxapwrcpvxskzbsucnprnftzuqcpwcbsnsvkfkwvuabpnxtxvbwcakknkcwvavskaqxtfupbwnxannrbrbskkbutxavtvbxzvrnquwvpzwabxrfkkktwbraxscbxcczsswbvxuztfrqsaqunctbwrvcbnqutbxzcrncqsfzwrqksvabpckwkrtbkfatwsnutrastwqwzxspabnkpcaxcbfwpbuzrurncsxnkuprbnxwwznnpkanrfrqqbtrspnvsuzppcbabxpsfpackqfanzrxqfvqcsxazzkvxcqpbrcuzqqwcutbskkcqnbvcqcbnkvrxvrsbfbcfbsnzbkqnctfpstnswcattrrnzkszafxxkptvqbfrtvckxnkrwvvxbpzkuupwwrzaaxwqzbkctswcnkrxpcnbtrtsaxatvbpspcwcsktfkcqxvqburfufkwtpzvrpvwctnatvfunvqnwtnvazkaznznatpnwcxvfcwtkpznnukkbnznkurrapubupqtzwaxsbxauxvcucsxbatbwxptxpsavscszqkknrsaaptcpbrkztqaurwstprcbcnkvatwppvvcwtpppakucnfxsxccnrqvkcunsasvttfcktwufcafukrqcrqrfsavvrvwarrqqanxsvqpqvqsckbncuquavvbvqsbrburtafrxanpcasvspxrsqcvvauvfabfxubxnrvzcknunxqwzrwbqvrsrnwvbckcfptsqtafptspxkatkvazwutkfufbpwfxrfptapznrbbnzkknrcpcsfqwwfuufbvrvbpzatsktsutrvfwvrztwkzcqvquqxbxaastrrzaufsnqzxfzavqszcnapqacnbccaztqzasvwtkxtknbsutucbnqbstknwkkcrawawzusxsvznncfxcnzuczxzsxxkcnnntuskftqnfbwbcfznappavnvrxzbpxnsntavqkrnacxkswfvxcznakuunqqwfqnzrzurnfpnxpckvkctutxxvsaukqpcuwknxtzxxxcpzawxtsbsuqnafukwquwazacwrssvfqxrkzzbfuxtxsfuntrawkurxbzqnxukfwsvufrwruuvnbrzfqtkpfarrzubnrknxakapwscrqqzxwnwubvsfqvcxtqwrrkzkbwpkubbfbffuzskzrxafbapxfctzvufnzpxpzassrxsvqkkxvxrpzuctswrsptactxptsqtuvrzzfpxsxxbvfwrcvpqpnaptcnacqnkqxbqpnaaxwwupvpqkvzrqtwnwqvuxutrawsbavbvzsuqctqzcsqttfcxvtcqvkpnfsbuwrscvfskfxzbukxwbcxaptqkxctuccrqxtrafsncpqxvzvnbupauuruffnktusxkbazrpwbbvnkaxbuqsauzuczfuxpfawfcrvwsfxwcprcwskaxsxvwqtckpvanbxrcfxcfwwqkfbqfzfkpwcnkwzkqnzaavvvfakxpbrbqkzffaarakunkzbnuqrrnfrznbacfbbtuqcqvwuttztvwwbpavnqcnbcrnbvsvrcbxtbzncvpvwtanxppnrwsfqfwvqxrcutrrrftrqxfwpausrnwaausutkfqfrbfvaantvzpsxcbnwarzfpzxafzuktkkrfatpspfwwzrxcsrbzcfbabbvnxskcntawrnuktakkknwffbwprnxuqszbskcutnzcuwaabcfnkxunbxaqsktrapspxvapbnpzsfkwutsxznsrccsbnbnpvrunzcxcvufpfpqusqqbptpwqtunvtanuakvuntatprprpsuttuxqucfxrfbzbtnwwkwcnpxupkzrftvxbqfktwtstfqvnfpfzvrncbxavqcfxuxnxtcwprcqftpnpusvpuufwuzrqcwtpubzantazcvsarztnfwrfbrvnkbfqkcvutpwqpuznuqwfwasbtcqnxwatwnbvwasxsvxkzpssffnutuktastvcwavntcpwrcwqffpztxttbarxztanbasxnuvvaqpnsntkutwqqxrbzztsvukttstbqbrcqzukfkkannspwtkqzacvfrkxkpbvccfratntpxvuafuuwbwwanzpfacbznxwpztwssnqckapvkcsnffbfwbpvfxfvrzpfqzbnutvrkcassxwqbpnqsrzxbpntzppttanbakrqabsrbzsftpruqnxtuvpsrcwtraqxrfuzrxcrvpuqxktcsqnzzzptnfvfcvswfrnbtrtstbpnwzvsxxfwzznvnsbnqntwcbqurxbuvfqvqqwcqtrkuwkzrnxbqvuzkazzafqzbsavwwwvcvknbrcfxpfpcatbsnzwnkvfskapxzvqbfrzfazrrvxkscsncxqfkfbtknqstzuffzfcanuznrbuuartxwnfzznbfunncwrbsanxrrqqnruvrvnawbuvnrrtkqutkqnabqzkvqcarxvpancrztrxpxufsqrrczcawfacukvuztnskvxbkswsccvzcwvavkwcvkqunznqstnpczsuwvrxtfwuwrqbaprkztqvtpxkpavuwafpsnuvwbxsvrtuapcrkpwptupcquttcxwfrknfuvwqxxkzucuwwqutpwwbtuzcctpauqpkknvrksnvbvkkswaqwvfcbavkxcxabazwsutsvswcckvvsrvxasskvuaxnrnatxzasxqvrxwbzrfkuszwwfwqsuucruvbpbpwkzkzqsktqtszbztpptcvtaxznvckntkcuvznsscutsztttvrtxncxurpxsqrrrtbvqtuzxqpsnfqqtnksarsntsnckvxxuqssznfrrkufxrnpaprkxsbzzbxcvzkqfutbnxukrrrrnuksuxpttutwsbavccvkapknqqpfvfzrswkzuvwukunxsqvckknkfsrfqzbpqnzftzpsafwqtubcxnafkpzqucnwkpxupzrtsasnuaqxxsxtruxabpuwrkuczwuntauvnbwnuntbzrwkqqpquprpuvufqcubkrqsxafrabpzwnwcuuptfppffukxvquafrvckzsztkussbxfnparrknfacnnxvwfrxtnqwbrtxtwcwarkrfbtcppcabrwzzsbvbkrttnzacwrrfarczpszqwspnntckfabczpqnnssfrufrtbfkpputqpcfxkkszkxvkbfassswxvvxsaufbapzkrptcunazwbantxwzwbbasnntktuqqbkkzbtbznqcvvvbzrvsqaxvkwxzwavsuuuqvkkubnbraxcrccuppnknwnrqvxppwkfxxwpbakucsrbtftvquffrcufczftxvvwrnxccvcqzqrsracxtkqvpnbzarzqbrkqnbpqxnafzuaubutbbffwanpvcqfwabufpcnpnvwcckznnfanuqpsncuuqtxvtrbatsvxrasbscpsnrpusbawnwxuzfanzvqxbntzpbkcfnfqauucszbubnbvubsqzwuxuqzszaxfaxrwptztwftbrtfzskscuuzzswuvfurqaukwqqffkvtbtvnfuvbpcqcbsszsfkbufzrpfcpxzubuqvnratakkankwttzxtsbtqcrusrtvxawarnxswqubpqsnavxkxbqkkkkxxsqwqpsfcknnnkutsqxzvnqpxracqxsvatpcncxctfxkfsnwtrnwvprcvxsczxqpzsnssqwwxarpnnqwrqxxcwftrffpwpxturpkbckcawfuwrfqfpqcxwrwaqzwzkztnqsbznnfzsakufrwukctxfnvpuvqqurpvkvfczzzunxawkqwbbxkkavnsxunkruvabbquafpnzwznwxsfwucznvtsatppwrxcwqzrrzsvswbcxzbkstkzbntpcutxswubrxsurnqacxqknsfbktrnnqpbcwbuvvfwfprfzkabubaukwbvxuazzfvscbvwpkppwasbwvkacnvrtstfqwuzbrxxcntkrnnvpuxffxkustvtqzzrabsntpvaauubbazaxqnuzsxnzbxbvxxurpuzuxkaxczfbkkbpkbrfwkunrkxrqstzvzzcxrwuuqtrbnzwfzuztpxsbxzuszqpfqkbrqqqkbpqqbuffbcbbczwvtpnfbbuufxqvbxfzzrwpqfrknzubtwaqtcprwsanbxkrpfwubxtztsvqxcvtwrckwkznnwkaffsxqnqsnuxbqwatsskvubkcfuzvrzrwrwnwfkbqwvtvawfzrpfrnqnbvqpvpxutavrntbsqrcwbkupnsqtwttncsrnnauvsvacpvtbrqxqzfpqwzzruttkfsxuqnkxsttkbtbrurzrpxxrpquwcnrfpvtrfnuxtvswnfnxxwpbpfkrafwtfucbufuvrazxwcwwcqqkfnbbakpqubfwvwuxavbrpqbwbtqkspprsacrcappqkarztatqsvtwszupppfsbbvbzrpxrfknsbuvfcpzswkxpurvntrbquasbfvkuxbkcrkbpcbrwfprxknkqfpkrbcfpkscspwkxknanzuffxxucubwwbtznnkxxtwtcusnwnwrzskxwzxqbxvqnnnkvpnutnsupwfrzuvtkbwuuknwuzqcbxrczknrrnunpvwvnqcknpntuzfvawaxbvcswzkquunsbsqbxrarbrvszaskbrsvfaktqrfqapppqfzrtxnnrqctpnnnwbbussvfuxbsrpzvstqzssbvtkrvaatakqsvcqvpubxukuxunzxrvtnuqxwzwankptzwxtfcpbuzfpnfwbkccazkanbkxnqbktnaxfcrwzqkpnfnbatxuubpksksczbrwrtkaaqqxtcuuusazvzuquubktqaszcqbfzspfkzucvcknnksnfrqbupxssskktaaufaavrakrnuakscxvprtvfkkntcbxtcuaprvsftqtxnzsksxasravcunztwcxbxafrbvvpxptpbcfqstbutsbrubntspczccfsuzkauaqwwrfacaavwpvnnssspxvkaxatqnbbbnckubqbncuvbpvtrutqnsvaqnttfzksbnsttwbsazkupsbpktrkkqakrrcscvussbxzuwasnrutwzussfkbnrtzbpqqbvraurafvanzkvxrnsukrqwwrvsckasnbzuxptapzpxwuuzpxpanaqfrukwuakrcfncfuqwsfzwfvnwcsptxbcpcazpvpknxpzzasapusubzptrxksszurpvpwnknzztuvbfakxvzutfsubsbaxpztknwxsfvppkavrzafcwqxswpqpfztrnuqzwpfctxqtxqanbswkwanwavxswzqquczrkzubqrkvqzqqtvffuuxpsubspaqurbcwutpkvvvuarbxurkztpuktfxqxbunvsbabqnwssaqqfxtfwarqfurckqcnnckrutapkpuvzxaxzxufvrzkbxbbzvtvsvrupzwtfuzqxrqnvccsftfabnzqfuzbzsbnuarxfkrsqwtttsxqkrkubzcnbpbpptaqruabkzpcswvztfzvzbcpfvttqvbuxxkzzcnfqxsfkstftbpscpxzpvrpqwxxqnwzzkqktaburappvccvznqruausatrbczuqsbpnznztpcxrapfqnawbaqkkcbafxwznutfkpwcawzntkwsskpbrqbbpxknkuxruqxwkwstwwrrutqkcvrbzzxkzccqntcprvwncprqcpvrubnnfxkznszvzbvpnsstvtqsaattxsupttpuusvttfctqrbcktkcqcwuvuzcbnnbsftptwafzzsvprbvcvcatfwtsrrzvtutqxcqauxrcvkkvcvfaaffkwspknkcxrvzktwwxbrunubbsncqvkqvnabazkfsqarcbqurfbwvrtcfxbksstzsxwfqrnppqbzcvpvrzuwssuputqbqkctvwfbucpuszucaqpaxcwrktwxrwpsfxtrkkctvtskawzatbqrrwszvtbrtqxwwrkscftxtbwbwfuscusfrxxbbsnpbszufbzxkrvxprcazbbwqfwbxrvxfruqxctnqtupvnqszxsfpnawtubfrrkpfncuacwurbrbssuzpkascbsqsfqrrzktacufqstuprqzvkrasrsckktxpszawxxstxkxfrbqcxqbfpzwtvkxuxnzazquqkbfbtzvkxaxtfrpaaxkrzzxqasurkbsqcxrpnuwuusaartxcbrqfcvbsrqfvrvuupksrzscqauwfvxststpvftqzrwpxurancfnqrqssuppkzfrpspzcksbuawnwxprnnuvfaqnzxutcbstrztknktwwxqxsanksavzwrrfursswcbzzwrknkuwfksffbnffbqvkzukvtaknfsqvfazfcxazbnftbpnctunrnxsfcattfffwzapwafqanszxbstptrstufbxcsuwfzckftrnwrbpbrnzawcabzsraswzsvqwbukaxwnutzwbkzqxxcxxaxfkkbunrrxtzsscatwwnqxcxaktvrwcpqswqswawwbnvrcrszawaabrztwfrazvfstksfcbtvzwrrxktxztturfqwaskrntqnqruxtqxkrbkswncpskkpckqszwzcxxftzrvupctnwkzvzvbrzvvfzsxzsxtxtqprbqvrncvzvfsanrrczbkczkwxxvftsnazacvqqrpfqacnxrnpufubfkcpzqvrvsbzsuuqvfrzxtuutztfccccttzquanqbctsxbssnfanzbcfstqskzqkknfccpvqtasvxkpubranvpsvvutscrvqcnxpksfsqfbrskczacpwkqapcancuzauctbfcssvpuzxzcxkccnzqpncuvqkzkkbpktsuqxasskvbwsuqqttnftxqvazxnprwkuszccnzvbkxnfcacqxzvxvqcakrkrarskcxtpvrknpptwuvbuvkfbutwrcxastpffkszskncbaswnnvppfkqkvawqszstnqctzzcuwknfkrwwbxarfarpxscwsuasbuqrkacvqqwwbctnwkacvqpqbpwuffkrxcbwcvzwcxtxqqnuuwkfxscqnpwzppnpvwatskswzqvqpqvbtsxutpuqtscuckffvunxtqbvwkkpzfbpuswtzxbpbzvzqwzawvxsfnpuwkbwbtftvvbbxcnkssvspcqvzawupxrrwqkuvvfxzcuznbpbcpbuwbwqfrckcfqnzxuabtzafutkpukwvpukxvbbrfunrfkbcqrwxcscsrxaabzsrstksfbuxbtwpxwwpktbnpakzrqkfbqknazuvkzknfxvxknrvnbvpnnkqupzawwzftstsbtvwqqfzpsbfrxxzaqkabtbnnarfqrazscfqznbtcuuuzzrcnnfuuftkqabfqvwzvrtcuspwtsfkspsxpcbpqbuwnxsnupcquuaxscctxnuzpfbfcuzfqkfxxrarcnwsnunvuapbvzcuqkactcubuwcscaqwvsaktrsuakaapnrrtuqswpqbburwbpwfscustfwurvcsuswpbqkttqfbuzptvrcstbvpptavftvtvtcnvrtkknwfrqubcrpcxnnwvzcxcxvpqsppszprrbqpsnqbfntunxnwxcfckpktxksrttsnrtauvrttazvpzvvpvbkqskfrawuvxukufarafbnvrqxcwatskxkwcqszxfwancptsfzqwxqruuazxsanrrfnwzqzpqxpawactkpztbavswawcqwtqzbxvvurtqxwwxakqcvrusbtcwawttbrbkzrxzqusnxnxkrzzwbfzprcqszxkfwaqpvfkquqkavzfzqfcppzpsqcqfwacbzbrnrzwknvsstttaxbautvabwvctukfksukbfwrqqttxqpnpuqtxwtxxuzsxrrrvuxuuxvrxacpbkffbaqzxztxazutzkxztfuxbrvtuafwbackbvazvaufrubqxzntwfbunbxawrwaztbspzftpbwtnxaattxrntakqsbsnqaxsnfabtzbxbakqsrfffrtcrrsnbnncwwqbxnubvkfkancxtsctwcxnwtrbrtkktfupqrtpncapzuftffvxnzpwtkftxaquxcurzwubnsspwcrvfqbzvvbtxssafrwqttprpfabwtvfttzfukbwfuavsptkrbpswvvnvurpvkuwpktastwrsubkvvqnvufaqqwzcffacqnkbzrbztkbzvpbnvzfzqcvsutpqwczzkusvusrvfpqfxxfpncxbknxcscuurfkksuuprxkbnktqctuzraqfcukcznwzkrxzrqtzqppwawutqrqxfsvkbnaszfvbcbwfbxprqbvznbrvwtsnrxzkbcbrrwrfbvcwcbazrzrtcafxnzafpxaffcrwucckbuvxwzqptbsustvzwrwrxtwcpnktpcsncwuqbquwxpzktabzqfxkxaratukzuwwknczqxvvcfxukfbkxccnrrcawanutskxfruszkuuqssvupwkvzkbfuznsqcpwbnwbwqqwkpquaqcscnbtvtfnqqrnzcqqbfszkpufwvaxsswzqqvqucszwurzrnwruucvurnazwqbfxxvpnfkvxnzvtntcvrbzxrrkwfnustcxqkaxzrzwwpqkkzfxprbuwvfxpqazbuftczuzfutaawqnsqvufxrbqwwtcafwkskrbzxsftkknrwasufskspzwuqpbxwncnfqfkrvxqwsxsuknxusqsurwpakkcxnuwcqrzsskbpztzabvwbtxzrsszrfttqzafarbzbznrxqtuvqzsqvssvkanzffrqcaqwuwnbzcvnavuzqvfuzpsqrfrpnzvxxuqtzvzrqtxutcbtantafqztnarvrxkvkbnnkxzpswwbnuvvcsxfsuskuspbvbcccfaatkkukvsncrwnwrapacsnuwapbqnztarucwzrrnfsaqcpcfzqrvxwkwssrawfurwkusxvpttwztwwzrurctrwpqxvzwuxpvawnrfqvuxzaawvqtkswuqfbwbxrwwbttanauwsvpzbbtffqpurszvbpxaafaptqkwvwavfpwwckpwaawxqpqpqktxaxpfvwsqcusbkrzscspwnfaankbnfucrauznkvtzrtpuvkvccxsfbzxxfkztqunzasvwfnnkwtntusnrbnawknqsznafcnfkxrvttqvpbvrxcqrvzwswxfvcuqnckrvpvszvrcxpnzxrazqvvppbauvrpuvpxkbpsupkxqvcrfrqnabtsapvsvqvbaqaxtbcnxabtknvtrkuctqpnvtusqwvtppzprvvacwfxurfuzkknwrxasaabtztfwqfpacfurwtsurruqqfaskktqtszqununvvvbkrnzapvncsuawpczuqfpqsnwfwfzkttvbsxqqrnrrrttqzvxwqvqrwfvqfstzxzzsrpabzpkskrpkxvqunksuqqnnpzpwquvvkxuxuxsnxpfkbkrkzvvcpfqzpkkznzcuxnpzwwqvnfbqtffrqcbvtpckfsckstcnkuffkkzzrzaxrtqrwrptfapkwvcvbvttrbctacawttbqvqkczwwtcbkanzkrznvtsnbkbqtprkfnkvurzbnxptuqtbppcnqprscbqfxtkxpncrttvnznztuswftruwvwfvkcfqttwqtrnvkpprtawbkpvfzwsvtzvzqpkcanfzazwppxwtpwbaqzsfnpucavcavwukaupqqsurbbcufxtnfcfcwckabnnbcrpwrvqxzqxbpzkvbcrcrbtbnabntrpcspqxtsnfrqpcksfubtuqpvzxzfkbwqkbbqwnnbasfuftuwatckkcxbbuurvksczauurnskrwzcprvwtskccnzcaqqbszxqqxpcsupfxbvvxzprbpqfnzsxvfnwuavrwucwxrwvbkttuvsznfvrwavnnwkvfskkaqzuswwbbptuwbnbpzczursrvqkxatnvafwwtspbzruznvuxntstxrxpaapkcbzxwxwbzwswsrwpbaspbncrpzwzcsrwtacvrrxstqkfbrabftbstzutfwpfaavsppznabbktssnprnzuvfrbrpxpfqcvqcsrfntntkczcrcspuaqnwckacpxzcwnwruarksqcsktfzurkcksnbqnracufpfucabvkvkqszrstaznbtuavxrkxzawzknzqstxqxtkapaxstwawkpwukfznxcnbtbaufqnbsvxnzvszwrqszkxbktrtapcutsxxzqbcwrntstrvswvfupnxwwxxczkvfvsautcutatxkvwbzxxwrtbcztbcptukptbcsasubfvcabqwxtwqqccxtfcnusrfbkqfssncbbukxspapbszqwsbxqzrbtttpstfsppbtuqpvnutrffqrunuvptsrabrksucupwqwabrwfnvfbtxtwpvfbftbrwwukrbxsrkrarrxnknqtxkxcvnfprtukztvtfzczsrwuvraurnkxztftrnwquspcpwpvuvrszfucwqkfbvtwxxsnsvafurfncrssarxpupfkvnszautrtcakztvurpatfuncfkppvafbrcaxkafxfnsptabxcfzftkunfzatccwsbzqawxnzsrfuuwavtzzxpntkastawtawquapvcbuwtxfabqnzubxqwcxtcptwtwvuptxawnfxutzuvrsbnkaxvffbufrfbcpuantsafpvurwvzfsbzqpscxkpfbrxzbuttctqttkrtqzbspkxswxtaczrtbvxnsvnfavtvuxasqnvtftrbfuanzqrabfkburxuzcfkncpqrwvfsvzsutvbnskpfwxnpzffzubkrcskusccrrfakwvnnpxuqtxbsbpsbqkukwtbzrvsbanpxcczwznzuuffqzqzfqwtskqwkuvqfkkvsvwbafscbzxwwqkkqsuzrncrtabwxcabprxuucunrpxxwvzswzxvacuccsuscvtnkrfuzwtqabcppuqwfspabtauunuwzbarfuxfwfprtxwprnwzunkuvxfknkarpbkukbxckkzrkzvwfuzcknpxzwfvaqtupvpvntkrnaprafburvzfzrxrvpafwwskafkwrqxnxrsqxuuapsvktxvsfvttupxncnaxvqxtbttnvptvwaqkqrxbcvcatcrwxcswctfpwrscvfxawfxfnkpburqntcqwfuzvraxsfckzwnruqbfbkkfrwzssvkufbzftatwkbpwuzsqwtunznrnprbrvzunbsxfrtqcnspfpfbuqpznvqxwuvxnzfkfpsrbkkqvxtbpaqvnruzbrtrsrtqzbraqffwvaatvzkqqtwtfattufxnuubupczabqqxnuwbaprsnfnuqzcbcxknfpbtufqfzbftunuutnnpauwabpfcqrtszsukvcatfksbxztrsuuxrcqrzfwzrbczbcwtubtfvwrkxrurxrtbxscffrbqqtvsrfsuqapauxabuawvqvfaazxcvnxtfbpqkuzqbwfaxnctpqafprnsakvftrksvrcqpuwxqtbfqnwzxwnwtuaxxrtrwfkffxzuwbnbupatnubxffttknkzrvtapnvrqkwcszpzvbbkrsxsprbucqctaxvvkxxrrswvtkaruvfbbxnzpwszpzsbnbxuqzskpvxtaafwqnpbztkafafpazsfqccwaqxucaauvkavzxtncwwvwfwaxqcaqfqcwpuwucfzwzpqpqavtrakknsxcnnskcwtavctbkrpfbnwsxqprtuqspqztuawxcnprscfknxaztxztnzfufanuqnfsrpvnawnpxvqnnnxauaururfffxztqntvvkptxqqstxpfkwzpfuffafqaunkqppnnquvutfvbwtaxfqfbczpunzxftpkakrfctvvtpznxrzppbbubrvnbrvstaazqcukpkprqcwbatxqvxwpqpfzkutpqwfnvxarxntaavvarfpfzuukcuffkwtqtczqwtpavxpcqpvfnfptzpsncqvkbzuubxkkvpwuzwvauzxrqtbwvbssrtzzvawcxbfvransqkusvrabzsktqutbfntpkaawauuabtztkfkwuzkxuzbkznvvfpzrsznurwvxrftzqrnwqptwwwqrkwatrzwnvwuvkpqruupqznaravaakbprpnnvcanwuucappuxvfkcvskxpcrpbwxcpvubcqpbrrtrwwrxttcaxkbztpbzfaarffcsqpaackkfsvxtpaccppruttuustutwsukcvfttazbucxbznfqfarfrwpupvzpkxncbtzzxuucczpfntpznbbpkafxqkvxscakpxnaanrqxkrarxttvsfnvbbkxkfbtnvsatkvaxqxzzksrbzssszxccaxtvfatrsbzwvfvpqspcrwpfnuuzkfncbtutvsptrwkqxnpxrrcvpvbkvacwcfncftbaxxaurvwsrfwntsfxwqsnnrxfsxfapwwwtxputxvcvvbuxxspwwznzkaztnxxtkxbztuuvfbctacbfpnpqxcntfqfkqpuzwkwwavtautsaabpscnwttcfpnfxqkurptaakctrnqsratwtaauvpbzbktkafvxfxuatnzppupwxsapwscqbuksxffusszwxqxpuzrzcfrpuubvzfqqxscbtfzqtrxtrcncfcupxvxnzpxabxzwcbuppnxrcarncxzcfztsspqruunbcturxcarbqaxbbwvtuvrtkktkbfbxsrzcrtsawzruuptrvxbcsvfrfsrwxcaraqtcqvxtatkkazunztfsrafxutkpvkfsbafaqbsuwbxwqubtvbcasqruwpvzutvctnsxrtskfcpkztvqffznubfzqwcpuftbwkvvunxfczturwwtcbstxzftuznwvzwrtawrznstuqvccffnusaxfzrwrwpfzzpqzptkkqssvtuqwvxqwwkcsffpzpfrfckvxrnztvxxqrqvtrxaswpkatcqxtxvsrqspnwscnruvcaarrkawqkprnqaqspazbzwqwffubrxsqqfquzruwaqbfbztkvfqwvsbanunbwtaqupqbzqcxtqvfbpntxnawzunznfafqvafvrstkwftaqrrpktuxptaqncsfuwsppstusvqzuvckpnzasqquqppkprxwbucuqvuqsaqzzznnkktzpzznqfaqxrxnqtxkzrsasptkuuffbkrfszcwpbwzxbttvtxfxwbpqvazzavzxnswnsacnawvnfbvavbrnunspktxszbrtqwvqvskcbaxfxfukxqbfcktfwqfuqaxntnaarxfzcqnrcbrpfaarfxrzrqwkrubzzatbwwaupacnascrrwkkwkfuktwkcccsnxrsvstqtwksqwstzwxrbkvpabbupfzcvavrkzbbzxukqvwtpavfwacbzuutfautnknznanupbrpbqztapanfrktxrtasrfbzvkwzwqnxrtafvxstzsxctnfzrzwrurrtqrcfnpwrcbbzwtqpvqztrcubvrcbtuxppaxascnczwskskkcvuqvbwckfqwfkuffrzbpquvxazrfbtbbakpqnnsrwuaxsrqcwcvnbccufnzufxwapcvuktzxtnucsfucnuxxppqstbvvbzrbantrzwknufvanuxfasraqqvsnfbpuxfcwxzxnvrwzqnpuaapzvrucnatcsxszswpwvuxpsuqpanqwcbtbkazsbfvfnbpzcptbzxqfkxbazvaucczpczwutnzqpvvtrxarqsstuawxctcfxcnxnnksaqkxvxuavnpcnunwactzuaxqsbvtwfkbfrssrrkbwvzzqktvccsfswfpaznsuqxnkraprrnxtcrazkrnbcrtwbcakwzuwfakcrsqxaappqfkwvztwbsnnwsppttbnqvxwpcvtznsxvxuzuatqzvffztqnpqsfbbknkwftncqkavnqbsnxwzkpskfcbnnnfanubsxafsbqftfkzvvctkrzurtuvknwvqbxxqvurspqntfqfswkptavfkvcpkqtvrrxsnwukcpkptqxzxtfbbuzfttpznwvkcuukncbqkbzqwzucwczvssqtsfqqrpffpspzpsvcarqqaswwnprnftnrbrpzvcasccwrrkvkntvpnqkxpnxxxzrwfqcpbbcprpfbvfbwfqxntrbqbzcqtqztxcuvrkstrpnsbkuwuaxccwfqnkfxrcwxcrbbatppabnaqsunufuztktzckbnpbzszskpsfqscqbpxbakncnvkzpwrawupcqvppntfaxfvruvqvttsvwqxwrfqqnaqqfnpxfwxztnbnfbautqncbcuxzaasuntzppzbzzucvxxwqnuvzvucfvrfuncqzswuwzbzqbsrfxnasrrbsqtxcnquvawzzvcstxwrwcrcznnxruntrtcnzxppffcfwxsuuncwacszakxrnwknvnfrrnrkxxafraaaffawabuxpsavxxkkppxnzvtpzzqwabsszrqsxaxccpvwnznpnzcxffwtprqfpbfkbkrzswcrfubrsxruszzfnrcfbqbkraxfrrbbbuqcspzzuwvkfqpckwrxczfarxtnkfnxpqxznspasubzcnpwabavrwzrpvrunnbprfpznfqwnsqxpuzfskrxkfntasqfvzptrwzcukbpxpzbzrbkzqcfkafrrpqzrznrnrtspwksnbrpxvvafrwvtkubwbrxsqwfabpfqvarrwczbrbrkstqnzvpzvubzqzrqtfawfpcsqwutuzuctqpncppxpzpuwsrvbbbqcnrqbttsnpswspruvtbuzkzvuwkxsakrqwrftqwvpqcprpwpwqqnruucatuwzbuwkxkucpfnzaqvprppnwrvacuwvbwtkfnrrsubsqvfzfqzftcunvnbquwxzaukspfrfwxkarrppzczaxbpvkwfwnfktskuwukwptukpuqzknrwuffptpacfbvzvurzbarqabkcuztvtktrptsuzbzxqxsznpqafqzqbarwzkazqvqaabcnvprquvrnpucznasvssrnfusruwzpttxnafwxzuuawsqupsqpructpfpnpqfrfkwsutxcbubavarnqkrpzqrwrvprsubruazfwtsffwunfanupavtwuswtpsacruncvnfqfackaqaatvznwfkfsnttczwfxaartxqrpcwkkqanwzafvxkzawktzravxb\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 434,
        "task_id": 4108,
        "test_case_id": 15,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "mxmnnmqmnqucmunnimifunncufcsbnfuicqiiumxnfbffqinmmmbfxiqumfmicsufibcumbubqiimccsbusmmbuiuuqmuqcsqsubxiucbqsnuqsxnqqffusmsqsnuccnbsxffbbxnsmmxcqfqbbsmmcqiiqnmbuqfbcxqcqxcnmbbuscxxnfcxfququsfisxuxqfnxxicbimsxcmnqussqbfscnxbscucminxqmxsbxcinqniibucfmxsqfiinffbssnnbsmfiscxnbnnsqmffxnqbcuuiiqxxiiufnbfcnfinfisxcbxnsbfufiiifbxxusxxmxisbssqbxqcumsnuuuqquffiqfxsiumbxsxusbusfmcbccmnnsmbbuinubnssiunbuccqqiifxbxxqifixnfqqmsxqmbmmucqbmcmcsqisqsfmfucubmbfscmccnxmimmfxumiufmbnsixuunxsiuniscsfucfinimqqcbqsfqcisfubinmqfxiqimnxbbiuccuuxqbxsuufqqqmffmcsusisccnqsicunmffqfxnfbnqcfsxfnuqcxmxcscqsssimncnmxsxxmqxcnuqmmuinfsncximfqxuxbnmsiquufsxsismfmqsbiinnbqicssbnqfbnqsmsxnbxmfisuumqfxusqfunufbncuuqmbimmuiubbcmiqmbssincsicnmbifnubixmmnimcxbinuciscmqbfqfbcxucnnfixcbsqcsmimfmuuninfqxqfxicxnsbinccbcfncicxbxmcnbuscubxmcnimuqmifncucfnfcninfmxfxsimqnissmmqnxmqixfsimxsncquxqiubiubmccuucffmbqqfmqxfccnnsxiqmqmbbxiucmfbuxusmismccqfumfunqbmnuqxmmxxifnssiisqmxmqisnicbnucfffsqiuismsxmqsbncfxbuxbmbimqbuscqifxsixfnmucixmfufbfqmfbbncqnxxbuuxqqinusiuucxbxmmiucmuuxsncccnuiqcnxqnnxmnqxbqsxxxmuqquciqfnbnuquxqfnsfxqsfcuqnffcxnmxusmusiqixnfcmixqmisxuncnnnisxqxiqmcxmfqmuiuiqqsnfuiqssnqinifmfbbxbusufismucqummmnfxscmbcnxquubcbqniusnixiqmxumicqcmnuxfuuxucimbcfufcmmfmsicbxqinunxcxnmfssnbcuinsmbfuusbxnqxusqncqcbcmummfnmsnsixiqufiqqufuciimcqbxbimbfmiumiicxnixqsxfbuxucbbuxiuubbfsncusmbifucicmuxfisbmibmcffbqqnquisnbfmbmufbbbqufufcmnfssnfiuuxxsfbiufxfciumifccmibnibucxmbsqnusnnbmixsxfubnbisnsqicmfbnncbfqbccfxscxqfnxbcumbnxmmxinscnxnfbicmmbcqnbifbsffqqxifnnnffcfbusssbbxcnqicuxfumbunusmfbuxfuusbsxbnxfssccfbnumiqqfnucsbbmmsfbqsmnxsuussqifiubimimqncxbucmsqbmbccfusffcccfuiibnqxncfccsmfibfuifqxxubqmubqiqmcxmcqmqiuqnifmiussbmcmqbqsqixbcbuqfinsscmqqbqucbnmqfccuxsqnqixbufncifnqcnxsiixcuccnqxnsxccmcnimuqfxmqibuxncmfinfmcfquxsquufinifscixufiimxbnfmscxqbnsciumxmfbbxibfxcsusncnuqbinfmxqqbmciusqixbsnsxsqmbcfbbqibnfixxmficfimxqqxsfiquxmqubfqnfixxcmqqfmiicfxmqbcxxsuifixcsscusqiibsbbnucnqfincnbmffunqciuuqicbmmbxnbcmucxifcsumxmfufscqnnuciismxnnbuuxinnciqqicfbcxqxifxsbcbqmmsqmncmffnqsxiniuqqcfcuqbfifcffssuiqxnnmsbcnbiquffqqqsibqcnmiqcnbmnibqxmfifnbxnmqfxbfqffxbcfibsxnqxsbfsumfibsnnmmquiubcfsiicnuunbsxfcibqbucicusxcnxmusfqbcmfmsiqqmxnxnfcunnbusscncsibcfsuiiicfuibqmfuncxfcisiqcqbfmfxnumicqxxxbbquiqmsbxnbxicnqnimqfbfbnxcuiuqqsfimqfsfbmufnmunxixbucmnxiqqiqmqnqcnbiqnsisnxsfumcismcssfsifnfbfbxxsqxssnqubxummbxxuuffmmbmqxfqcfunuxffnxbiqbsqxmxiscbxfnuixmnfssbiqqiubuffnfiixnifqmxnnnxninbcqisusisnfbumcbiqxumincicxmxnqmibumxncbbxnimqnsscmqcqcxfncimsuumsisibmnbsbqxbficfqufscunxiufxcqxfnfisicmmmbfsfuucnscnsmbuucqunicbxuusssuincxunninxnnubuxiqxuismcbcmsnumiussbifcfsfccfucnmxisusqxmuuunmmfcinuumuscfxsnxqxnxcxxbnfbsmcfqxxubxbncunfuxfxuucmbqmnqmniqmcqfmbfffqsnmccfbfbbbmfuffmicqbinsinifussbxiinqbsxiuxcqmincsssnnqnmqnbfmbinmsfcsqbmmxucbissuqcmxncuxifqixffbmqfuifuucncqbsbuqufcinsqcbncsnuxnnuxxmmqcuqcunuqxbfiiunuixmcxfiuxffqcbbiiusfqqnmniqxxxcbbbnxcqxffucbcufuufusuqxnbxfbncummnxinffnbncfibsinffiucbfimxcbuqqifquuufiunuumcxxfcmsccmsmsunqmiscfbnifuicsxnnffbfcmnqbqfubifxqcxbfcfqifmbbbsfsqmcbfssmnsibfbxqmifuxixuscqqqucusfccsnibnnibbumifmbuqcnnxxmsxxcuxnncffmmusbbfbbqfxqxnsufmcxnnscbcffiixfxiifmuifxbnsxmcbqsqcbbfifsnfnbmxicusumbmqfsmqssiunqfffbncbuisumcfqcusnxcfiqcbifnmcnxuxnbnxissiqqfmucfbqfqqfbnxsbuiuxquccumsbmbmixbnimssxbssuinfscimqucqqccxqsqfqccsunusffquqimcimncbixsuinxqbuuxcsbmcbsnubsuufcqibmumbuxxqxmqicniquisqbniucuucnbqxiicfnsxqffibfxfinccufcqusbsuxffbunmsxsccnsxqscbqsufusibbxnmunibfqbbciqixfbfiiuxuqnxxfbinnbfuqnmsfxmucbqmfsfnmiibnuumcxcfqqxucumcfxqnxxxnxfximnfmmqcscfsnccsqfcifmfffbbbuxuuicsqfqxufnsxnuisuxuubxqxbxucuuuifxfmnssubxiquncscsbcnfubiucsbmfucfbmbsqbqibsmncmbcqubnsnsqiimxsqqsbiimummbuqfnbssnmunbsqmxnsbbnbnbfxffxxbuxicssfusffsbqmmxmqnnubnqqqucmbxisnnxbsfmcqfmsmiiuqxqxinxnbbqcsfcmnuccxqnubbmiuffnnfuxmcxqnbxfqsucxmbxnffsibmfncqsmbqcixbixqiuqumqncnmnnsufssuxniffxuumbfxcnnqcmbucnixsnsfcffubcuqbsiisusicfnucbuqfcmcfbbsmnssicfxfnssxsunbxsxbbsucnbnxmiumqqnsxmumiqbisxxufibqiqfsibmqxcmfifubssmmmmxnfbiifunixsfmqnncsqibsbsuubcnisuuffmnqnufbmxuicxicfxusmsqsfqbucxfumnqfbxxxuuufumisqbxxqbxqnccxxxxiuummuisxisusxbxixmquxquqbumcsxcsxmfcunifsncsmfnqmnismbubsfqbxcfumcbxqisuuxunuufcbnmcximqufqmqqbxnciifbiuucicfnbqmxqnunnmmqucsfquunibxcmixiqnmuubcubufqnuubiibcbucquqnmqsbfuubxiicmumuccsqxcufqqfsifcmssmxmbnimmsmiuqmnxfuffcimxuibnnumixxxmffmfixqimibxnssfmnsqqnncmcqfcximmniquxsbsifuxbqiumisimuxuibqusqiiuiscuisxfqiisqiqbmimcmnxnubqnuxsfmnuunbfnnqxxmsuibmsxmuqxxfmbmunsubsbiqqsixsufxqmibqsbmqbfxniqbqccibxcucbmixbqicxfxsmiiifcucuiiffunqcfbxqiifbcfxuiinuscinuxuxcscuxmmuxmnuncinmsquffnqbfxcnqcbxsfnxufibniififmxfqbbiqfnqfusxnmfcmfcmusnucnmmqbxnsmqmqxsubbixqqsfbuxqsbcxbbbcfbmxixbqssibcfcimsixsxsiqucmncxmbificcfcqmixuummmcnfbnmfcbnmqixxuiqcnqnnimnsfnxuxmnnmcxcincfqquisixqufmnnnsqsfmsixbxsimuqsuubqcsnnxfxcxbccqmnsxqqbicmfnuqqubbmfcucusmccscxcciufsiubxxxumxxmifcfquuscxcfmxxuxnsfsnmisquqbsxxqbnbfsixucxfiqbmibcmqqusffxbubbbxnqbciuubqxbmnbissnqfbbffunincbfufsmuixmfmfcubiiuuiccummcmxsuufufxsimciqqcsqucfsmcbncnxncmxfxsuxqcsfxfinmxmbmnubnnnfuxunfcsnbcnimfqsnqsiimbqsmfsicmqcqmubbbfuxquuqsbncufunxsscmqucnxfxxcuxfmfsxicicmbibbxusnbsmnqcfxbixbbnfqmbfiqxqucusxqunxunfmfqmnbbxbiucmqubqimmunfbnmuqnxunmmxmifmniqbuuxnqffcuqsqbfqmnxssbmnusbfumusmfxibfbqbscfminbqqfxcifssimxinbfxqccbqqfncmqcncsxnncmsxunfssnfmbiiqqqccqxixqnqmccfmiqnnfiiifqsibbcuiffuunimmfmifbffumimniqfmbcumcfisqsinsxubbxbfmbisbxmccubccfcfxiccfmfmqqqisusncmnqiscnuxfinmixsncmcfusnxmbxiinnxcbmunnnibiqcicqfibfffffbqssuxcxnubincfbbinncsfnmfscubmincbxuccxqfcqqnmsuimiqcqxunffbuufsbqqqsnuicqbbsicnbsqifsbumumisfbsxuqummisnqfxbsubbbufqncnixfbfbqiqmnuxsmibnmcnqxxnxbqxsbmisuxxxbsqbnsuqicfbbbqqiiimcmsnixsinbubnqfiufixusuixbqbqmiqibqunqiunmucccbqbinsuibssxnfucsfqqmnsfiuuqcmffbnmcxnmqubumsicibixnfmcfxcuqsfmcisfunncxxmmnbxnxqicibicfquxummisbucqcqxqmbixmubmsuqqixmuncnsbqsncbfmufmsixcfsmfscicbcsicisiuxmxcbfcxxxiimbcufxmqfmmnnxmcqixnbncxqxmxmsbnuxmcicsmmfnxfxbfbxsqubmbbxnqqqbnuqbibnnfbxicibimbxumncqnfqcmcffubciqfxfufuxxcfxsqfibsbsffcssxfmxssfxmfnbifnmsisscibqcmuxxccnifqxiicmfbcfnfccxnqcuqfuxmqsbbmsbfmsqisfxxucbsffqqbbsxixmmfxxfsnbnxmxbsnsnbfxbncxqnmbicinbbnbcqxibbmsuisfqbscimsmbbnfxnxmcfiuinfucubcxnxqfcsxsxncqmfscfqnufqubmcmnsmucbbxmsniixnbinsfxxbssscmmuuiuifxqnnnfmisixnbuscmbmxcqmubuunsfncnmqmiiciniccuxqcqmibsbcucsmsxuxuuqcsssmmubxbsfqxsbuqsfxifxxiqifnxbfqsffqnmfsxucsfiqmmqfiiifimciimqummbuxbcxcuqfmbxfscfqnmsimxufqssbminmcqiqbnqnxnuubmxcffcfqqmxbiusuqcffmmibfmuusmumiqnmuunnbcminxciunxbufnqmnucnxixnsfimcsbunuxicqqssufuqxfxnuxxcqxmfsmmfcbnifmmcsnsbsmbqixnfqqfqcxiqqqnxniqsisbsbfbbfssinbqfuxnciunfmnbsmnusnfscbnqxmnmmusunnxbcubnfcicsccxfqnmxmsnnffncimxiqisfbsqmsxbcbfmxnxfbfcqfuuiqfnmcsmcmcmnibqmiccsqmscnfcsubcxxxxnmfsfbcmxbqbmbxmbbmnsusqmfnnxxncibbnqnbifsxsfnunusfmuuqfbuussnsfiimucxiifmmqbbmqfimbfiixfsinxqimiqbbiqfnmfcfnmsfbxbxncbxmcmmbmnssiibqcnmsuuxfsxbffbifibfsmmnxcqqcinnxunbibmxcnmqsqxfsunmmumqmmscfimnqmcxfqqifciffnqqfsqqnnmsbnbssinbbmcunxquqqbxxibfmmqufxbqbinixsncummufmcubbuqqucqmiuxinnbqccnmbqfbfucbifnmxsxuusbbfnnnnsbuxixbufumnnibmcxuqsuquiiumuuxfsqucnffscbifbiffufsffbbfcmxfuqsuussisbqscuqiqmmmsbunqqbbbxuqniqifqfbqnxfbqiqfunuiixcibccxixscxmicicsiisbsibqqcmuiuqqmcuuubsixxsubmsfufqbufcmuqncnfuuxncccmmbnimfbucmxbusscnufsqbfcxxiqucbxbquibbbsxqcfsssunqxiuiquqmbsbubcfscqqbnnsucqxfimqnqcmbinbnmxqqqqncqiuxumxuxcsixsfmixfunfxuxiubssbccumnuqbnxmcmiixxfnmfmucmimncimmsifbqxsxibxufqmqbmmcqffsqbiniunbncbcmsufmiqcucbxmqcsuqmbmnxbucsxmcmmsisqfqqfbbsxxqqqiqmfufmcuunxxxmncbnsnscsqnbciixqfuccimciiqscbumcnffcsxibcsmxqixincqbuufmnmmsqmiqcxufxcumscscuqcxbfnunbnqxfqnqxmqmuimnnuqqcnfxbnnmiqxquxfibiufixbcbsibxxcfqiuucnqqiqxqmincbqxbfssqiqqnmbnnuxcfxumuibsqsisqsbqbfcbxsnsfcnfcxbinnxnfcmfbbnfiffusqnifcbcsqsssbxuciqmxcmbmsmcmufxqnsbmmqusmxfubmfisimfnicsissqcuiccssqqmuuxifbixbqqnciffsuimnnifcxubsmcmifinisicmmxiimccmicubsiiufisinquisnbnbixsxmsnubmuscsisxmfmffnuxffifqfiqcmuuxiqqmsmxscqbxxcmumxcnnuuubiixsncubbiuuffnqqisscunuqxbmxxninxffcicnmcuqbsqncbmqumxcscsmbqmuxxfmscfbibmssbqussuuiqufixnxbbbxcmffxfiimbnxnbinuuqbucqusqniqnbxfbiqnsxinnusquxnufxfnunbicsmmxciuqqubbxcuqcuxfuxmuqqccqmbqcbucxcnqbficcifnmmiumiubicxqiqcxismqfisbqxbbsnqxfsnqunfnbfsccmfcmmxfinbcsuxmqumuqqmxquiuxxuiqnnnsxuifffbiqibxfqmmfnbmsfixqqsubqcnismmxmcbixmubnqcscsiqifimnficfsmqnumncfsxxuxiuccsmsqisbxqsqxxfubbniufcbusssxuiffnisxnmsuubxufqnqcssmfuqunmbubqicuususummcufsmcmfnxxmusqfbiinbmmsqixunufsxunfxbsxmmqsqmsmsmnsifnmxcnbisbfqficxcnniffqsqcmbimuxbcbqibfqmnmxucsbfcbbnibxqusscbuqqsbucssxmumnnxscccusimsbmcunfxqsncsiisnqmcxcqncmsinsmbiqbnsmsncsbbxxfufxinbqsqqcimcxqciicbuniqqusbuxnbiiximxnxxxcbscqxiscufnxifufxnqumcnccsnsfqxqqxmununxubiuqumfxsbxffxsiuqscicnsusxqismimmxncqqumsixffxqsicxmuqqnfffqfcbunxncnbqqfncxfqumqcumfxbmxssxsnfnnqiqbfmfbsbsxifmcumbsqqcbfqimxmnbmiscsbccxbfubcbnixunusfqmbmsuimqfmiqbxicbncuufbiqsnffcuqicqumcbbcquunsminnuxcuixbfmmubbfcixuccxbicqbuucmusnxcbsfinbqxsfsmixbmsnnmqfufnimusxncmubcxbffnxbubfsssnbifxmfnuniunqfibnbmiusfmsibsscmqiumnnbsufxqxqifsbbfcxmbiqunbmnsbufmfuunsmisnxnxiuibsbiquxnmfsxqxmufnnxicsqxqfnbxsfqnssicisbbficusmqcfqnfnqmnmuqinsiuxcscncuuuqcsnfxmbnuussuususxqqfqfnqxxiifimsxfxfuifxmqffbimiqqmncfqibfsqcifnsfunmiqqsuquiqubnnfuisssqixbxbifxsnfcbbmscqscffbfqmqucuunbqiumuqifqfnubqnmnxicnnqinubfsuuncxmsqifsbmqcmsiqmbqxmbxmnbqxmuxmciiubbinuusmcmccuumnnxxbfqumumiqqfccsbusmccuqfqsisxuncumfcscbnubqfxncnixbxfxncxsfssmunmbxicsbmfuuincbsxxnuqcqmqqxnmbuscmifmcncicqffisifmqmqnmnsqmcuquxfciqxnbqnfnunxbfninsbufxicbmmmxbxmcscbnbqsxibcmicqmxsfmfimbcmxubusqccuffxbqqcufnxxmxbxfqimufmufcmxqnixifbcmsicunquscxmnixnqssnuiqqsbsccmbcsmmxbqxqusqcuxunsqqmxubbmqnbsnxisucuxmiqumusibcnmmsqiuifqsbqcbqisuibnbqxucunfiqnnmufnucnmfsqusfqnfcmcqbxcqqcufsufubqcqqqbcfunfmubqqqqufquufsfcxiucmqinubbnfmbmcsixcnssmxqixqmnnbufmsbbxfmcqiifqsfussiucmisuimsnnminfccnsxxfqmfiusiqqncufcxnbxnssnbnxqminmcbcqfcfnfmquqxunffnubuscsfmmqisiqmsqsifqfmsfuufbsuiixsxuinbnissnfxxmuxfqmqcnqufuifmufunniiqnsmiquuunscnxqisfuuissuibcnuscmbxuimfsnsffnismfsxuuxbqqiffxsbbqimqqsifiiiquqqnnqnibbfuixqunubsfxsxffnuuqucsuimuxnfsqxmufqqnibucfnbxbfmqccqfsqscqxiqcimxssqisxiqsisxcxxcqnuusubccxxcccfmnfnbniqqnbninqicmcqmiufsfmbqnxcqbisxsuffqmsusxmmnnsmxffbumqmubumbbffiqmcmqnnmcnsnuqbuqfbmmmxbscuqmbffxfifqsqucfmsxqnfqfxunnximnmnucxcccsxqmscnqfuuincxsucbcmqibncuiiufbiiimqnbqxnxsbiqbiubqbncquqmiiiincufnmqiqcbucumucsxbmsssccinxqssbbcnxbucbqxbmnqnbnbnnqnicumfcmxfmicnfbmsnmqfbxqsucfnnfxnmfunfsccxbfbbnbqmsqmnxfxuncfnximxbuuxuiucsuuuifqcumiusnnbuxxccuiumuqumqxuxibmunmusuuubsfmqmfnxbuxqumfccsmsnssxmfuicxsqqusifffxissccfqsficcbmfsiiifnucsbufxcfxqxncsfmuccnbfqiismnsmucisnxsfuqucumcxismqsnnqbquxqffmiiubnumqxmsffimquffqcbscsxmsbifnnsuqnufusncsmcqfbscsssubscsifisbxxnusbbqnmxifuxsfbfbiumfxnsqcxbsxbffbmuccxncxubmmmnmfssqcimsnsqfxcxxmsuunqsiuiqbmqinicxxcibffcnscfibnmciiifnxxffnbqsfnfbquxucnsibcxsinuqucsfubxcxufinnimiiqcxfcxiuifquxmssmmbbqqnnnucumnbmnncinsbbsxuffnqbqniqqqbmsfnmufsbicqbuubfqnmiuiqmsnfcnxcsqnsxisxxsfxussxmccunqqucxffsuixbsncuxmnsnsxcfqicfsqbubbbcfqmisimuufbufsixnmxxixqsqxqbxqiqmcsfqqffmnimqsqfnnqsqbcxsqxxuinfsucubmussqcsffsufqqnqcqxmnmunsinibmqsxbxqxxqfxbiqxxcumnixcnscmnsqiufuuiifcfcsuxsmiqcmcnixsimsmnqnxqsuqqqxiqimsbmmcibsbcbbnxqiimmmsqiinccmixuxiumbnbqnfxcbsnbiixiussbxcfusssbismfxbucfbmqssxbmnummbbmisbxmbbcbiububqsmbsxnbnqfscqbnxsqiuffcfnffunisbbinqnmnqsquqxmqfsmmbuffbuqusfcmifnxsisqxunimmxsbsxiuffxbiisbnuffbiuusfqsxbqfxfxqimbcqbcmmimiumncsibbnfqbimssmnuqnfcfixncffbnqcsmsqsbbsfumbfiqbquusncsmsuuqxunifcbbnbfsmqmnmuqbxxincmuxsxbxibifqnscnxmqmbuiuxmniumcsbummbmxsqqcsifinusfccimqfqbqxbbcbcmcbunfcfqmimmnsunbqinibiunfcuquiqfbsibmsixbquqmqfcsufqfmmuusncfcfcfbinsbnbfmuisqnnmnbsfcimqsqbiiucfcfmfncbcmfmxsxnisumuxqmbmisuqccscnussxfsxqbxsnicbumsbmbqnxcsuunqiqnxcqfbncssfnxxmqibfxmcccqqxscnixcxiufbnbifncnsqfcxbxsxcxmmcmfmnxfnsniqmsuicsuussqqnsbfuxcfbfiqcimsbsfmsxqufbciiqfxnusmqfcqfbqqmxcqmmiqiscnqsufubiiufmsmxqmmfcusbncxmsscxubbqfiiiuciinsfbiifbsnuunbimmqqxnuiubcsssqsfcsusxumnqsqsqfquqcfsumimbufnnuxxcqcsbinqnmfmmimbuixfufquqqbnccqcfqqxqqfiniuqbxfxxqqcqnnqfcbbnfsiusnibfsqmsmsbsubbbcufbsunnxnsinnxfsiubcmmbuibfsiqssuicbnufsfccqiffumnbxbfmnbscbsmsxbnffuicbxfinmnimsumcfxfffmfsqnmimmsufiqnnncusinifincixsuxxiumnisufxunmmibqsnmiiisffxcbunmqqusxbmmsciiffbquqixxiqsqibbsmcnmucccnnsciuciuqcficcsmixubnxsfsqqqxfnnbucuincufnubimuxfcqbfibssubbqxfiiiscfqusxbmssbfbnnqffufcqffmmucssixqmqsssxsuqcisxfxqcqqifbxsnsmbbfunqsqmmbxfsxiciimuifcsxmqbfcfsfbnufnfqnqfumqqixmxcfxxicxsxiixqssfqmqinnmbnqcbxbcfmfsffbbbcxisxcsbqxfniqbxcicuxbcbssuinunfuxuxfumiqquucmusfsqcmiximqixumsbqcumfsxcnimqcqccccmxxuimqxsssfbqnicfuxmmbmncmxinqmbmbusmbbbqxifmscbsqmbucbbmnimmqbmxxffqqfqncimsqbbsnqxcumixfbmsunsunsxsmqmniqiuscqucfnbcbfxiscmubfqcubqnfiqcfiiqxqmmuuncmcfmcismuifxbcbmxcfmimxiqmbuxuuninfqxxfibumnxciibuusccfxmbbimiusmcnufcffnqfubbcmxccfxcbimcqciuuqixscnmbxuusbnncbminscsmnqmixfsmcbmfxsnbqfuxuqxffnqqxuxxcsxmsqmcmqnifbmxuiufxmbmuxmisfsnubixxffqnibfxusbnmcumbbxbinnninqcnmmffqqmuxuuqnsixxxmbmucixmusqsmufqsmqqbmuiuxumbqncqcsiqbbfumnnfnuqusscqnbxincbbbbxscuxxqmbxqqmxnibfxbcbcfmcfinifxxxmqsfxmnfbsbxiqsnmxsnqbbuicnbfcmbqqcmnssqfxmfqsnnmqxbqicmcqmcmissncnfbxbxcxsqbumuxsqixmmcmiuxnffsicqqficsfcfinssbxiuqixnmbfsxbfcfcuxqfxsnxsqbqnniisnncbiiqqqsssiuxnuxfxfqffuicscfbiuibbuscbnnqfuuxsifuuqxiixfxxunqfbiunqxifiqmucnufsxcsbnnmifsbnsxcfnnxmnibxsbnxxxbsmmqsnsfsunfnumfuufqnxssibbixqqmiuciibxnnbsnbmxsunqmubiqxsssbcminmsxmffnxbimnqifmqxnsfqnxsxccqnsqqcnibciqimbqxxbsscqfnnumqqmiqxmbbiismqbsucqxmsmmuncnxuinuscqqixxsixumccuscsxssbcqbccqcsqnxmbubcsunqbsmnxsfqiqfximqfiqcibsusmfimuxmnuqbsxmbfcsbcfmnfnusbuuuiqixbbqxbcnubsuqcfnbqqxmxmmsubnxcimnmufuixmfbccfmfcnqbucscssnfqxsmiqismbimbnuxccxcnqccxibqqfmsbucsmbxxbcscumfqbmfmquxbbxisicxsbxfbfmfbqninqnficxbfbqcissbfqmiufquqqfcnxbxubuiubbuxnsnuisqqnxnqbxnxqbxbqqbbnxmxicqiixqixqmqxinscixsbnqusiimuxisnncuubbsnifbnnsiusfuxuuufmfscifsincfqcnxmffnbxixsxubcnfqbsisixbnsfmnumcciifmfsfcfcmxcxfufinqfffxsfqbufquqsnscqcfquxbqbnsmfxxmxbqfnicmqfmixbmfsxxcsncifumqmsnuuinsucbxqqxuincnmufiqbisscnnfxbxiimqsnbqfmumnnccxmsqixiiiqfqiffcnbubssusnfqqmxcmnmuqifcubfbimxqumxssccqnqcumcixcnufnsmiuifquxbcsbcsxxmfncquifnmsssuqnfmsmmmbffisnfcuncxubcmmiuxxcqqsmmcqxufuscqmsqqfnmfnuifcnbuumssxmumbinxqcicmqnmimbsxnxnbnxxxcqfnxncxcfibsnisccimisnbciqxsnmuqmcnfbuniinscfqiuquninqcqsnnsqbbsiqsfiqiffbqufbqqcfqmqmmuxcimmbuicmfnmqfuussccqfsqxuuqqmifmimuumcuccnbxfifxmnbfmscsuuxsxmcuqbbcfsusfqnssbunusbxnfncbmubsqbccnifxnifxufmuqqmbuxusmnmmncusxmxqcsinmmqsxqciuxbqucnicnncbqfqxcuifqmfxnsfmmunxfnmqnfsuxibsfsxisxmbqibqnmmismcbcmxuqbccucsffxbcmmqicnnxcinmfqsubmusmffxxbscuxcfqiusssixncnfmbxsmxniifibmqbisxqscxqbxcccciufsbqbusfmumbmmbbixsbfqxcnxqnsfixucscsuiummcscifsufumnccusqqunqssfnifqfxmnnbxnnuxmbcmixqiqnnsmxcfxnfimsqbsxxnmxifxibnxfmbfbnbxsfumbunqbcfscucsmfxunqxsmxxmifcbmsuxxiiucbcsqqxqbsmxsificcisuqmcfqfbucinuimnmumusunxximbnbnxfffnqqxmnnscmciqsbxcnfnqscnuufsqqumifqmqibbqbsqinbqnuqssfmxsimqcbxsnifcmiquqbsbfmnqbufnnsuiimbixxxsnqqqnscuxqxmbqfcfmbqimncubbuquqmqsnucxfxccfquiicxmiffbisfinimsfxxfxsqbnscccfmuuxufmnixmqbxbffuxuuqbsccimcsbifuqfxcibfcunxncffmcqfmmfnmiqcqsqbcfmcfmbuffbxbcfnsiqnqsbqninqqnnnubxsiuimufmmxqumxxucfcxbiicnnbfmnfqnumiuiuuibfiibmbcbcbbmuffuuqxunqcbfmfbsqmssfbbmfmnnmxfbcuusmcmbnsfbfiimfmmssqccxuqmnbnsxcbcbmfinmqxixmifmfqubmcqnqcxqnsmsxmqfbbqicmqcuuxmmisqiususmsqmbfsunixufbfnixffuqqbfimsbxfnxnixubbuibxxuxuucuxbussscnsbbxixbbinfcxnbiubbfuiquxcbniuicqfbnximinbbsinbfnimnucqqncnfcinbxnsncummcbsfsxququsubqbmimxuuqixmixqqcunibfxumibcqmubqcsmxmfcnqfmbqfmqssmucmmmxmcmnbxxsxsincnxqnbnbsxsbfccffbifuiufmqxmfuinmnscuqucxmbcuqmffubsnsfmfcunnsnicuxxumuxmbqqniinuffmbmcfciixsscubumqucqsmcbficufmnxmnimumxbuumsnnxqquqfnucscunfmcqiufmxfscsfmqbxcfcmxcmifscsicqbucibqsfimxcfxicuxxxumfbbcbqfnubicnbqqqmumxxnixfnccfuiqxsfbibquqqbufsmfmcmuismqqffcmcmnmfsxqxfsiqbfsmfmbbmixmccixqxbuiuxubufqqmcibxqisquffubbbbxissbixfcbumuibfisfsuuuxifxqnicmixsuxnncsbsnuninqxuusqixubufqnxmmnmnsxqccunxbuqcxcxnssfuxunmqbcmcbubfbbfcmbxcixxibqmiumffnnmxnxumqbnfxnfiifqcnfbnixsqfqxmuuccibsxsbssxusbuiffcbcfuusqfqcbibcxufcbuqfcusxinbnfbcnuibcxnbxqmffuxifmmnqxxcxxicuissninsnmbncsqxbbuufmsqcxqfubcnuxfumffxuimmfxuiixnfcfssnimufmcxsxumbnummxnxbubfcfxsnfmsbmnxcfnsxsqimncmscxmcnbinucicxmnsiixuqcnxqffuxsiqcsmbnnxnfiusmnncbibfnqiqcuumxfubnqumbmffsnuqsuifumisinqumixccxffmmffusqmbmciscxfbnbiubnxisifmunsxsbbbuicmcuqnfmqqfqsqqumxfxinfxbmmcfnmxicfnnbmxmmssqsbqmbunqmmcbssbmnqmqmcqxnmunmbxfsmusfimbnmuxcinxufxmcxfuxbufnffnsqucissqcmqqscuqnfuuqsuumbnsmubbifmbcifmxsnssxfxxnsqunqniinfcficmnsqfcsfxqumcxbcbuinbxnnmbbfsxucsfniiqxnciiubumbqciibunfiiqfnnxxusmibmmfmmcmsimbmmsmmnfscccmnunciifcmbfnmnimmqsncqsuifcmcumbsxucfnsbmxixscxsxnbxxumnfunfsuxuixfumnxmmbnuxnscicifbqixxsxuufmsmnncqncxmmfqfqbqcnmxcmunsnfmqsmqxxnbuciqsfxumqsfxnfbncicuinbifqbucfxxqqmbuicbnfnnifmbxcmbfciimfnusixmiininmcnmixffucunxsmffcufssnfbcxfbiqqqfxnnisbqccbcqscxqbsinniunmbnxsnbuqincmcnfiuixffqfmxfcbusinxsuiffncncxicbbfcqbqfccfiqmqqnmxxqmxmcifxxqcbcibbxfmsncbxsxicuxcqubucusqsunsmnufqmqciccxnnubcbbxqsfunicufnqxfqxisfmsxcsbfxicxncbixbsbqxqbbfcifbncsxsuffxcsccqfsxqmnqbqfqcicbnmuinnfsfbsxmfsmicimncfsnxiisncxqsbcmnxxnxmffmnmmnsncqiibbufquifcxmiqfbmsfsbxsccxbnibqqxcqnsbiqicmxmnuinbqinxqfcuqbfqfunsunfmixsuxmxmiibmqfxsfuqqxuunfqxbsificcqfssqmqsiinfbfqmxuifixfbnbbciimssuumxcmssmusxfmsmmuscfbfbnuncfxmcuuscnbmxbfimnbuscinfxnncixmmncfbxfismnnsscfisfucxqmifqmifnibbumqfcccumfqqmicqxusuqsqbmiqxiqsffbqnxxnsuxminfcbbsibinfcxufuxqqquqiubfusxbnmbqibxnmxnsninbqqbnmbxxffsbiimmmmbbmqifssfmiqnffuxscqsfufxnubsfmummbbbnfcqcqmimxufssnqxqfmncmqqsubmsiufixccusfbufiqnicsxffbxnfccqnccqxquxqqsquxnqnqiqiusimbsbqufnxnmxsbbmcbfssbusfcffbuqncfsuuxmbfumqmbmnsusxcnffxiscqxnnimxiffxxxuqfxfubmsxbbmifnbmcmsnfqmucxnuqcnqbmniufcxqfqiinuinbumfnnnibccbisuunbfinmnibmmnqbxsiifcnfbfsifufcisxxnniinxqfmxsqsfubmxfscuqmbficmcsuummxibiuxnnbssciifuinimbmmxunuibibnqqibiqqficmqsimuicfmnqxbxncusiimmcqimsqqffsbiunnsnfmfmbxmmccixqumfffsxsusfnfxsfxccscxnxfnusnficibusuqnsuumfffnmqnficxffccbfcmfqsiqnxfifcbxcfuqscfsiqfxbcfssucuqfqmucucubumsnnbxxxubcmxmcmfxumnfuimfqffbimmcmfbcfqnbiifucximuqsqxmcsbbumfuqucmsimuinmsmcuxqxuxuxbbsuixxnqxccmbxqqnnfbfqimfcussmismfnmucfnmcxmcmcxcsquicfncsxsiuucmqmxcmsbxqqcuiqxfusxmiimbixfsmbmmcuxqbmbssmbmcsmuusxfucmusiimncmxcfcfuifmcqucbnxciibcubbuuiixssiuxfxmqsnbqfmqfnxubqnixbsbmbsufcsinxnmnifufnccucqxfusuiubbibinmxufquimmmucqmmfmcuuxccfnnfxusicnxnufsqscfniqnfunuqusfmcnscnmbsnnbufifimuicmcfsmmcsfsqxmcqffumuscsuqxnsiffixqbibcqiuqxccbssfmcxniqiumxfqincxnxixmnbimxqxinmsqcficmsiqcfuqxmnuxfsuncuicxfbsfsqqfqbxumuxmqfusufbfmmbisbmqfxufnnmssnsmiuqufbqqsuqxbbsuqmqxsnsbcbicxumnbnisunciiqiunmsfnxcnsxiiqnubqmuqqquncfcsbuuqxsiqnnbiusminuibbmnxnxixbfbfxxcxiqqcsnmcsmcqqmbxqbbnufqfxinsbsixxncxsfsimqfnxufmfbcmbxqxfiuiimiscusbuuiumsxnnmunimfuxnmnusucibsnfqqcucssqusxuiubfibisnfnmsbmscifibmiicqfbbncuuubxbfnxccxubuccifnmummcbqxfinsnmifmxfuufbqnimscxsmfmcqfqnsqxsiiufufnccxisnnmuqqmmniccbfcbncnbubiniqimuxuqbfcnfnqxsxqunmbfxbqxxicsmmbfmscsixufqbsmssicsuqiuixuufsmimimsmisciquqbufcbubbxcxmxbicfsfqccxsuqnfmusnsimncfucxsxxxcxiuxbncfnuxmsmbxxqiisfiqbsuxuuifxcfuccsnimbsbxfsxisisxcbbmimbqnmcxbnbxbmcifcisnusbmcmqmmqqcqcxcmnqqbmcsquucmmmcxubfnccusnqibfsffuqxuuunxbsnnxcumfmibfsbubixmsxnfsnussbicxxifbbxbnmbnfmfsnisbcumimfbcsifbbbqmmuxqcfqfmsubqmcnnqubsuxfimfbmbqnuquummqsuciuqnmbcsuniqnfxqicmcnnuffmuiicuqbmucixicmqifnxcffmbsubcuucbqbbxucqmqmmbfqmnfxmqbcsbumfsucibbuniiifbbbfnqqbfumscqcxmixsbxcbicxiscmcxbqufscbqixqqfsmnqiqfmqqqxmxqmqinxsuxuqcxbqbuccbmbnsifnncncmiunsmsqmnfsnuicusmxbxncsniixmnbxcmxqqmuicscqmqqfnifxxcbxnsmssfuiismfcsxmsfnccfqicxxumfccsxfnicqffxcxncuxsciscfmnbmfibmmnbiubxbfbfqfucmimmqnscqcffbsbmsxnuuncmxqmnsxmmusbiubmunimcisxnqxuxsnffssifsnnbbmbuumcqcuxccfiuixinuucsiqnnfxsixuqcmiccunsqmqcnccbqnsifcnqcfnbfnifsmxmmxusfxicbqnmfusqcimcsqbunbnnicbnqifiqmiqcbuubuubcxfucqqsncmfxfqbusqxqcmxsncmbmbibummiisincicnimxccqffiiucxffsufifsfmfqqxxuqqmbqiuiqxinixxbxqcccqssnmmibuiuifsuxibnfmfcmumsxibfsxcbcmxbbubqcuuqxsnmibsmfumusufxquumuixfnxsscfsmbnqcqxuibfxfnunusmnqcqffbqqciuisumsmunmuqqbsxisusqqbnsmbmbcquxcxixuismbcccfsqnxxffbcbfufccxisbibcuqicfbfucmunnnimqufbmuifsssfinnifmscxxbnmbfmsfmmsmixxsmccxmisfsnxbinfxfqmqncbbbcnqbccqibunubfxqbsbuqxqqqnmmnfsibcqffmsuqqqbqqubfsnununcqnccmscqfunmxbfuqiunffcqsffsmbncmcuccxmcbsbbfnmqbbmsbsiisqcmsqifmxnqcmmssiqucfmfxfnfccixqcfqbbsqbqxqsbbxinnmxqfmixficfnbmnquqcnicfunmbbsquicscqnbsmnmnifubfbucccqiucnmxxcmnbciunusquqcfsfquunquxfiifssxbicsfissbsfxbnbsncbqbxnnnxuisbfmufqmnbxqfsqsqnqmscfinfiqximqbmnncunqsxbmnscbxcbixbqmqnssfcmcumqnxfnxcunscnmxcncsiunsxusnssfqcxcnmxinxcfsxncxqisnqcffumcxmficnsncmncumsncfucfimunscsqbmcnqnixqbxxuucbisxcmcnusisnbxmqmqfqsubsfnsimicfbcxfnqxfbuiunnfmffcfxnncnimmccfuxuciqqsuuubxcmqccmbsfcsbufcnqfcismcfbnuibummxibcscbmbiifsmumsssuixmnsinusunxsfxbmmxbsxxxnfsbmfuxxumxssbxifsnssxismcxqciiqnqfinquxbqmxqcmbubsmmbccxccnbimqiuuisfnbiiqcinqiiqinqsbxibbmuqqcubbinmifcfcmncbnfqxmmcqcccfmucunnuussxicfqiixxuqicmnqmfixfcfiumbqxiqsbmcuqfuucfqiisximscfsffqmbsbmfnunfuxisnmuimqufnfxsmsbscbfnbuximcmiubnmcqnqsusnncxqimfquffmfffnxbumqiqusquixncxfbuiqnmmccfximbsicicmuxfxusbmcmsbixscbmumsmicsinunisxmifccsbiqicixbmnfiuimnbufcnbnqfmqumbfiicifcmniqxfsfxnqbfnmnncbmcqfsisnnfuxumncissbxcbxnxqfusiinfqummnnffqxcnbsiminmiqnnmqnnbuqxfcbinbfqqccmxsimqbxibqbqsuumisnufusfxqsssssccqcuiiiiqfmxiqnfmqxsunmxsimfsicxfcbuxfmucuiuubsfqscmqbxxxsnuqmucnbisquimnsicfiqmfiimsbfcxfninicciqfnumifmufixmfbmcsqiqqqbiicsqbnsmbiqbbxbsxcicifqcqbfbqumusxmxsuqnnsbqxmqfbsmusnxsuquxmsqnimmqcnfnsnubmiumumcubusbcuisbfnnqqqbiuqfsuxsiqfinbubxcqnicnqnibsicsqsnuxmnmuisxnicubmcmqmfnxssqsbuiuiimubmiicifmfcifusnsbnsiucqmixmnuqcqcimcnssbqbcsqnscqsqffximsnsinxbxccfnbinxiuqsqncifssmixxiuinqmcisfnqxbsqbbqusqsccnxqfcqmbicqunbmmqsqximfqnfnubmfsuxxnsmcucxbcsmffmisbscniumbiicnmcfsqfbxqqubxsffiqbxufuxxfncsubfcfunuqimcusxcismbusmumfmiqbinibcfuiimimuqquinnxqsnqfsbxciuibunnficxccmfbbsnbmbmixfccbuimqixufxxusbqqxsbssxximcsfmsnnbqsbcmiisiqmnbbmsniifbbnxbixuqinfnusfiuibimiiuussxcfsfcqcibssfscmquixfsmmusxxsmncsqsbnnqucffcuqxcxisixnxsqubfbsqqicmmncfmxummqmffsiminqbxssssqbmcqfbbffxfixmnbcccmuscxxqiixqmxsqbiqqfniiuuususmqqfbuinmsbfqqixuusbubxxnqbbqxumqnmxmsxmfifffccnisxxmbxuucinmmxsxcccbqbinfiqxbnccmxcmiqqfsumnscnscmfmunfxqqbxmiminxfsqsmumcqscmfnnqiifsisiusbmcxcmfscisnsfsxqqubmmquubfuquinnxqmmmbcfqinxmscsbimbussssbbxccmuucsxmicfmsuunissffisimcunqfbcifmxqbfuuqsmnsxnimqinbqnxxmuqqnbiisxcuifqscmscuusfmqimqmiiqqxcfbmxscsqxsxxifmfbsfimfsusbsubiunmsscuinsuscqxnxqfnimiminnqsmixnqunucbncsqmsubsmufmqmxcnnmbsxnxbmbfcbcfqbcubunxbxufbnmxnxmbmxfsuiincxbmfxsniqbmsisqscssqcnnumcsfsibsfnxnbqnxiccxuqxsncisinmnmnqunmuxixifqsxsfsninxnmmmsuuncxbxiqxccxqqqbuuxfnxnfcfufquqbimfqfifsfinqfbbxfbqbqcqmfqxsimsqmmumfcfsbsqsfsmibucqfxuxmbiffxmmiqbbsxmnciufuxuxxmbbmniifbfnunsmxbmubqibxiicnfcqnbcqbmqffqfmfqiusqsnscucuiucqxqqqbxnbsbusxbmincnsinmsbbibmnnnbxxqxxmisxbuniqqxiuqqbnmcicmcsxbsqusucifmsuibnfmbcnfcfmqsuffquiixibnnimnbcqbmfxiubcnuxmqncbumffnisncnfqqmqxqxnbsbnifqccnnincsxcnncsxxffqbuqbcxnnnbcfqcnubbmfscqufmnbnsbxscsmxffqcqibqxmcbfxsxbxqsfmciimnuuibffxmmsssfcffnmxxbcinqnufuqsqsxunfmnmixmbxuiibccniuqmnmsifqubfnmbincmsscbmnqnbmsiufixqnbxcfixunqibinffqbssqcsxnncsinsuiuqcxxbscibmufcumqbqbccsfmcqibfbncmqnbqnsqfxibmqxuxuixfqssquqfbfixibumnbmsminccxqfbusifuxmimunsxinibcfcqnuuxmifcbbufsnnincbbcsnuxfufqcniuifxbmfqxnbmbqfunxqsffmcbfxxmxcucsxmuubcnnuxfbqcbbfnxbnqiiufqmfnisqncqbnfbqfinfbmfxunmuxumucubsiixnusfbbmqixcxmfncmfucunufqbqifscuucmfxucnuiummmncqsfcfibcmxcxissqbnsnfmcsxmqbbufqniiqqxfxbsixcxunfiibcinciubbsqbiqnccbbbsncmciufbfimsbnbnmfummxuincuiminmxcqcxnummsbxqquubxqscmqmnssuiqnunfnusbxxnfbxuiuqucsqnxfufbmqmsusbnxsbsxiufciqnbnxbbcbnsmuiumimfusbsffqmunfcnufucixcmumbqxmxsnucqicqibmmfmnmnnbsqqxiffmsixfccxuixccucnbnifssmfbqqbffiimnbuiqqxmccsussmncqfbninxcfcmqificsxcfissicqmfnqnfiffbmbifucufmubnumfsbcbbqsnxsuusffcbbfumsxniumnnmbfbfbixfucifcximnsqimxusimcsxfsbncxqxfmxifnsnmbfsfnsqmfbimuuisfuxfxuiixcxscffbubxisfqbmbbumsxxsmxsmmqnqmnbcqiqbnfibfcqcsscncncqufqbiqnfuibmiuunxffsiuqucmiscnsfcibnbmsbnifbsffiuiunfxfxssscxmcnqqmxcquxucqinqnqifmqiccincccinqsuifuuxbifmfxqmcxcumqxubqqiinmbssxbixmisbscquqfnmixnmqqnbfnbqmmbbsfnmquncnsxbnsmqnsfifufbnmcxncfnxmqmuqufnbbusucmnmnxbxmsnqbbscxusbqxqsququxxfximxmffscuibsnbbfsxuncmnxqqqunxqmxmbxfnbubmbbnsffibcqsfucqfcqxubbmsncfsxcmiubcnmimmfnsqxscufcsnquqbqcuumicifsnsfuqmifsnbmcqubcmqfssummbnqffcxxqnssucisumqqsncbunumfsfcuifiububbbqccscmnbffuuumqmqnmnnminmbcibxccbfxicxsfciisnsfcscqcussixbifxfifmqqniuxffncqixfffsfqbquunmqxbibquubffqciqccfcmxqmnbbifsqqfncxnmxxmnqqsnnfcnmqqxbicsxissxsqmxfimncqifccixbmnmqbmqxqmnsfmscncsfsfmqxxicmqmxmbmimuuxmifqbufubcqucmffmnfmbibmsbcbiixqxqbmmfmfiixbbcxxxnfqcbiiisbcfsmmxffcxnfqbiqfiffxumuqfqsumxcxiiisfsuqbimxmsnxuxnnfnsusmmnbffiqmibqmumbucqqufbbisnmqcimfbnbbbnsmmsmmxxsnxufibxifnimuusfmxiufbxnxqnmbbcicqqmfficmsqcfnubuuxnmqfxqbxxxcssqbxcsbfnfcxxfqmmsufxnbuxsxnquiqufcsuxiuqiqmmqbnsfcxqusiqxsnsbfufmnbscumfiufnbfsuisfqnuscifmbnfcnsinqssnxfnicnbxunsscbcumnxsqxmmuxnsusfcuuxnsfuxmsfnimbqxscbuxnixbsmqucuuxqmsnsmxxbbisufnqxnuumncnfcuixicimuxxufsxsbcsqbmfbnubsxsnnmfmcsinucsqcnxsmnuqfibunufsusifbicmxnxnbqqbmfsqbsbbmfnxcqnmcxsfucbiubminiccmmmxnfxxcsibqcbnxqqmfsscnncfqfbxcqfbsxxummqbncunsincucucmccxiqcmiqsmcubixqiuuussxfmiucqunuxfbbnnffbqsubxfxqcixismcifbbfqinbmquimufmbqnfxfxfcnnsxuinssnqcqbmcisxscsfmsifcubqfcunmxcinuqmffsbnsxqcqbmqubfsmfmixqbxbssqsnsmiiqxuqmifxucimnsbsmmsmsuussfxifqnxqmfsicnxqqnsmbsuufqmbsnumuqcinqsiciibuxnxccmiimnsunnnxiifsbnfbinbsmsfqcnmiiiinixbubmssumcscxbfmqxsxnxiixxcisiquniubifimicqcbqimsuqixssbissfxcmuccicfqnnibsmibfxuumnsqqnfmcnncbmnsiififqimnxumxcbfuiuqmbcuiqxsuqfsxxqxccsquuismbcuucsiqcbufsnusbcxfqfbmfxsucimuqxffsbmmxbsxiqniiqbnmuscufsqxsimnsxcfuncmxffncuumsfcnnbiqsficxbfqmquxiqissnfxqqusmxifcbqqucxscmuiixnnimbxfffiuqcmusfbxmnssbqffmxnsuiqnbniuxubffnbmqbbfbsxnbxxcfufxuubqfcqixfcbqxunmcxnqibnusquusqqubfsbscmnuqbqcqnbubinqxnumsicmiumfubixsixniixfmqbimcfcsxbumiffcffcixqcunqbxcmxcsinsbsinfsffiimufcbfmccqfucqmsmubqsmffunsqcbxbfsmqucfxbquxnxmcxcqscicibifsxmffibcxffbucusfiiixcubbcfbsbcifbifusfuxcsqbqiimxmxxqqqnmbunsuifniibmxibsixqfqbbsmnibqucmbsbciqmnubbsquqicnxxixmnicxcmqsqfsbmqcqmfbxcffbiquqnfffmnqbnbsxibxicxsqbiiqbumxnmcxmbxqsmbifxqqfssmscuxuisxbifiqscuubinumcuxfbsmqbnmibxcinbmqifnuxiimnfmfxmmicqficsfnfxcnmficscuccxfuncbiqbqcccsuuiubxqqbmcsiuiuncsnnfnfibffqscifnxubnsnuiqucibsncxqisfbbfbfbnmffnssnqxiiqunxifssbcqqqfbsqmmmquiqxuqifxbfbnxxfbxxxqffnscsxxbxnsfssqsqsqqmsncnfcucfsusbxuuuqiibsfixumfcufqssfbxcsmsqnnfbiuscmunfuumcqmfcxuibxnnbsnnbfcbnxuqxqxcnbcufbbnbsuqqnqmbccnimufbisxminfbbnsmfqsbfqfcmqicubnxbqsiinnfcmfqnfnfbsmcxnxbnqfibumnssbsxfsiiqnbnbfssmmncbuqffnuuqcuxmxisnncnmnfixfnmsmibnfinmcimuibisfsffqbusuubxfqsiixqifisqniunsxscsfsfniminmsmxnbuimfuxxsisqimbsqcsbfbqbmfuxcxxfubfncmfmnqsxbxqqfcncqbcbixbbsbfqiusuncfmsnumnbmfssssmfmnucuiqncqmnnsmsxcqxiccnuqubfubnqxbbfnuibfbbuscfxsxiucbsufqimufmuqmbunxcuqsxbscnsqbiusfxcmumcuucsqbfnxfsunnqunmqqmcnxnmbfsbicfnqcnxcnxsimnfnssqfbnncciifnfmnfmfqbbqnubcufqmccfbcbmiunuusncqmmsnbxiiuqmisnqxxfisiufssfiffbqcqbbnmmcfccxcbmciccbxnmsuxfumsmqusfismfqmcxnnsnccxnnuucsffinssxucxsccxcmnbsffimxufminsfxsfnxnsnfnqnbxuxicfnuxnuibcbmnbiuqfbccnbxmsfmicbsffmqqcnucubbqiuqmqmncsnnuxmsbbfbbxsmnbmcumfcmubixnunicfbsmxisunxnxqnubbfbiismqffssmufuxxxmnmmqbfmuicbsusccbqcuffcffxsncnuuxcubsqciicfqisnqincffcbucqusxnxbxmquxcninqnuqicfunuxismiuqbuncqsxiqxixsqcxsibciiufsuusxniismfxxuqibxifnbisqissmbffnsiusxfcimqssiisficqcbsncbsnccqufmmqqxfxiuifcbucnqcicsucbmcqufqfmcfnuffqqsxsifbfbqummnnqbiuinfcxusmfifmfsqmfqsbbxcsxsbinmqbcsqmunxmumcncbxmsxfuccnucnnuumiiunusiscunfcnqcuunbmunsfqbmifxmbubxnuffqcicququcfixffqnqmbmxbxcbcunsqucqbsquixunfnbcxuccumqqbfmfxqqmffcssbxbcxqciffqqqnfbnfcxmxqnnccuqfnqbufbcubmfbmiuquufscmimbnqmxufmmusbcfuqfcxqisqciciuqcxcxxxixinubfqqxubsncmiisifsmmcuqmibuuscuqnffbuqcsquuunssmfcunbucxxicqxcnnxfucmufxiibnfnncbqixixnbbffcciqbmqxxsnsmnnicifscquniisifqusnnfbfsnqsfnfuqsxunifcbcsxsqqnxunmucucnqsfcxssbcmucfcqbfsqcnfbqmubumufmisbbnxbfcxxinfcxqbcfixbsnuxxsquuxmxqmcbssuqxxbcmcbfiufmxnsmxsiuusqfmcsxfqinnxnucixsmucscbnmbibscsqqmbibxciubiinsscqnfnmiiuibcxbnnicxcfnfusunxqmismbsxiiccciquuqfcixxmcfnusbuqmscfqbbixsubccimqsimbsbfbqiumbmbxxncuumscixmfccsfccisuimnfsquqsxmcxqbnxxbifmummcqiqbimxuifcmscsicnqximssuscnfinfbqbfmxfxsmsnqqbfxuisxnbfsnbmfusfnqbcqbquxxucfsqmmiqssfiisfmusimfnxncufmnumxcfnimfuucbimubcfqfcfqcunmxxibmifqbuunscfnnxfxqisssmuqqnubxcissuuxquxcibuqxcmimbiiqqfnbnsxucmsuuccmmuumfqinnqnqqmcfccuiicfxquxbqcsssbnsqubcmbscbccbcfxqnucnmxxmfcnqbqqubxxqnsnuqbxbfxnmxmfbcifnmubxnfuscbixusmnnbfmnfqibuqqfciusscnuxqnnnifxmxbsfnsbfussiffmsfqmfmfiqbcqsxsbmqbfqqsmummmsbxsniccscfnxqsccsbuscxbfnsffnbsqxbcmumqqnqxbnfsibmqxsccsxbfbuixnufnxusfufixnuiiisffxxbnussqnsicnxbxfuuqmnfxcxqisuqsnsfnxcxcuqcnuqxbibffqnxmxbccmixuunsnqfnciiqcfsciixunbsbsifunncqucumfcumnqnfqfnqqcuqcxmcfbsmubbnqqscicxfbqsxmsnncccqfmssqmsunbxmicmiusbnxbxuxisciifxxifcinffqmsuiuscsuqqxbcfcbumcqffxxmxicqcfbqxiqiiqqxscuunfibsssniquuixbcsnuuxnuxxmnicqncsqixfxunxmumumfuqxubqfbsqfbxiqimcffnnucfmbbfxqmfqxsnbbscmicuxxsqmsuqxniffnnxbcuiibquccmmfnnssbmiqcmucbxiusqcbnmnxxxbmccssqcsusiinmnfnixfxmcfmunxifibcbmumsnciicuuinqcsqxqsmmxfqnisxinmbsumxquxxfbnfnmcuxucccbfsmbfxsbqsnuqbmxsmnifsscxxfuxniuuccmfxbffixnxnqnsbbcfnfmsffnqniiuuusmxnncqnsimqxmscxbmsimbncssxqxfsnufnxcqcbqnfcuqbqfqcnnssncxbsucnusnqfqxucmxccsqufsbicbxuxquiqxxuusmbiqmnmsmbmxsucmxxcxcicnxqmbqsufqbunsmuqfsumxbqxinccufquucumcxqbfcqcinqixfsuxsnmmcunxqsiqiqbbsciqiqscxfxsmnfnicmqunnnsqisunuuqcsmbmsxnbcfbqqfbcmsimsixnxxfciiififxbbxsbicqfssixfsqcqbbxnususxsixcbffbxnnmmffmssumqinbmcxfsfucuiimmxnumbiussicnbcsinuqxxqxmsxmuxmnmmssibqffnbnxnsissiqfbxqxsciuicnmsfcmnsmnbbcsbnqmiibcfqxqcnqunbnqcuuxnxuciucccmffunccccuqcnsnxqcsnqusxqiuqqnbsnqcicfbqxbfinmumsxmnbbcxqmqbumnsixmfxiqmxqmmcqccsxicnfibbnbbfnbciissubissmbsqmbfqfuqxxixmbxucmncuunxcmcisfxfnfumuxumqfqbsfsmfccfqxbxuqufbsifbimbnmfcmnxscsqsqscccnfxsqnfcbuxnnuqfufcsbmcmsmbxnifmbnqimbnfsbinqmbsmbqnnubbfxnscqimqiqixfbinsunbnubbsfcscfiqnuccmscqfcsqfnnuifcnniumffsxinxsibibccxsiqixffxusnuiumubcfxmxncucimmxnsnmqfxbuxcnqqifxqimcffuuncxfsmfxxuxisfbmqnmcxinixfbiixbimsbmmiffbixcmbxqbmiqfcsmicbqbmsbscnfimfsnnxiimuusnqmbfcbbibbqcqqfxqccmububiuxnnnbfxmxxfxqnbxuxufixsbbumniffbsismfixfsuqcnxisumnfquxbucnncqcscuncxcuxqfnmncunuucfbxnnsibnccfmxsxiismsbsbnsninmnssfqxnxbnnsixbqssfsxcbiscmimfunibissxcucxssqmxnuifusnfqbcqsiqxqfqqnsmncibufsucbffqqmfsnfixqusbnxifqfimcuunnxunsfnccsixfsxnsmfcsmuiifbnffuuumffncusubqnfmcmfuqfnbqiusfmmmnsxmcunqffufbsuibubbqmsbncqxncunmncbnsiffmfcunmsxiiqcfiunciuxnmxcfmsbfiubnxiuubfbfsfuuiuimncsssuqcscfbmxqsmfusiuncqxmxuxucbbqiqicsxmiussmxmuxqubcfqmnunsuuqfmxcbcbcsccfciicicqssmfnnnxfuscsbcmbfiffccqxiunfbuxifffbciqqqmifqssuusbcfcminxfxxqsqxcfcnmimsuqxufbsfisiqxiimxcbmnimqccbimcbcxcixmxsmqiquusinxbbuiqmsuqucicbiicnmummccbmnxsiqicfucnxcncbiufqxnccnuuummbfxqbmncsmunfqcnfmbmusqffcmbfinmncbqbicqnubmsnsqncnxcuifsiuncmuxsixfuuiusxcnmfqqnfmibcfxnunfniqnuqsfmcxcffubqcfuxuqcsinbbcssbcquxxmumxssqnnifnnfsbqmccbfmnuqxcqfnfmqcxuqiqsxqxccqsbuqsbimqmuxsqsuqmibiibuuubismbicmnuxfiuqibfcnuumnqximqbbmmiiunmiqfsssssbbbfbnxqmxcfqffxqccfmbqxnicsfsbmfibuqxbnufcuqnicfisncffbiqnmxuqccinqbmqxcnbfmnssxfbxbbsmuinnbnnqnsfciffbqcfmiiubfncxqnqfcccuuqmimsibunbxnucqnbmxnbfcimubqiimxuqnbcncqcsxmmicqmicbnbncxmxqcmuncxixqbufqxuffuuisxnmifsxinsbniqumsqnsfunfbuqsccsucbunfqfcbuqiufbuufxbfuinsufnfmqmxuqsmimufubmxbnfbncnxquqnxmubbmimqsqimsiixqxscfsiqqxibsbisscxmunumsfcqxicnxmsmcbxncuqcmxxbscxmifsbucuiqbixuqciicxxbqxcqnxsquxuxfsssfqxfixicuixbnmssccmussxbuunmcmucfixbbuqsbqsbxqsmsimbquqcuibinqsmsxuuuimfbxcxsisqfqxqusmsiqiinqbmcinfcfcuqbxnxqqqxcsnnubsnimfqfbqmccnccxqccxquqqcinxnfsxbmfufuiusmqxfismnmxbcfnxcbumfnisfsqqsqubnsnbsqcqminnfcnifbsqqssusnuqsuxsumbmmncfcnxqmnnfiqfncxisubqfmquxnicuqbcqbnnmifmuqfcuncbmnqiimicfiunumiqunnmqsfuqfixnicfusqcbmqxnquuumbfnxcfmfmfmxmnsimsunxunsnnnbbqicbifcsbffqucncxnmicbxiqxibxinununfxssbxinxmmbbccsumfxqnqffubcxssmmbnbiqcubisbqbxqsbcqinqxunnbifcqxuiqbbbncbfcnxmnsbuxxsmcbbcuqcuicqcxmbqnqibmcbcisbsqmnxbbnfbcufxucnqqinbxqxnfmmcxfmsufnmxbcscuximiimmnnmsmcsmxncnimiuqqbfmqcmmxicbquffcnxuqnnixsqqfxcxcssminmfusixxfbsxnbmbnuiusccfcsusciqincqnfnmfqnsubuqncuqcbbsmifmqmfisnsxuiiqmbumunnxmncfxsimxmnqmcubnfmisunqqccuxbffiuxcssnquqcmuxmxnciqssbbquibsmisxximfqubiuqmcfxffqffnnimussnuinusssfiuqiuifmsfsiicnsixqcunsiqscbiuqbsmnmqbmcbuqcuixxqcmuxucqfqiqiqncbqxnuqxfnixnunxiqbuibuncfmnbuqqbbxubbfiinsnncccxxufqsiucnnxqqqsmbfixbiqxmqbuxcmbxxuqscnmfqmsqnsxninisscimnussufxfbmiuuffnsxuxnbmcubnmqcmqisffsimquximxuumqbnqqmiffbinimnnfxnmfucuqmunmmfnmumqqiqicmxucbnmumfixfmfnnuisunsuubbxnbqcxuubufuusqixcmmmcsbsbmxbfqnsfmfbciumixuxmuuicfiqmbsiiinnqbxiibbqfubuxfsxicfibnuxumqsxbmqsfbcsufnxuqfqqcfsnumusifnxfbfbicninqfnbbucccxsfxiquuxmiinsxfqmmquqbiuqsqqcfmnicxcxqxfxffuxcxxfxnbnfufxbxmqsiqfnbcqxmibubxsbinfcniqmsqcsxubuqfbbmbbmmmunbmuuuinucnqfunmfcusfuminmxsnsqmsbsniunqfisqfquumxcmxucufsqimxbmuqsmmbbsxuxquuxmibbsmuniniibmnmqnscinbmmisbmcbqniisuqfqbxqsfuqnqmmxifuibuqnifcbnfumfncxqiixcqmxcsiqffsiqssbbqfxbbsbfnbifnixfccubsxuimmqqbuniciinscmbqsumiqixsbsqsbccuxmqmmcqnmmnfbucqbuiubmsqqncxqscxnfccbqfnfqqmmmssbuqnuiucnfibifbfmbuibffncsuinsuxnncmcubicbnqxmsxqximciuqnqissfxncxbnnmxubicsqqnqxcmqbibsufisqnsbqbicmssbqxbusfunxuunxmxqmifiiqxuuixnixmscmsuqfqcqmxfbxunxnxbuuscsnncnsxissuuixfixiqxcmnsbnmcbniuumccbmbfxqsqxuuxbcuxibmuixnqfbcbbfuqubuifiufxcifscqnxmbbsfinfffinquxfcnmqxuqsiuuxxncxumssnxnmqnixsxfbmcnuxfxxninnqmnmfucxbccscfxxxccnuucbscubxbnxuqsiqmmsxncnucmsbqcmuqxmuccsxubqccfmiinnsfsxuiqfibxccixnqfcbnbfmxnnsffmbuimficxsibcqqbiqsnumffbsmxuubnfinufisifmqunqmxfnmuunnumxfbqfiufbciqccubncquucixuffqsbcxubummnqqbsxniqmxibnxuqimmmmnnmsimmnmmiumuqxufbiccnqffcimfxqqmnfqbnufscfsqicquscxsccxnqiibqmiixqfmcuccbsiucbmsfbfxxnxfbscmfbqcucnqqicmmxunfqnfimfmxiiifmnxncsxbxncbxuunbqnuccccqnxxsnffibuqucfnxiqixfssinfbmunibbmqxuuuuqicbxqffniiqxsmniqmqxniuuxcnbuxbnubsxmxqfcsusiqbnnnscnnnxcbbcbuqmfqifubsmsiniifmsxbiuxumxfcsbmsufuqxuffbxbqbcqbqqxxfqfniscnfmxbmfuusncqxmcbcbqccsiuqmumccsiuxmubusibbfmifssnfiuibmbxusiqfcssnxmsbsncmxcibuxscsibissqsscbsuissufbubmqfbxnfnbsibqxxbmsfbxmmnbmqbcccnixxbmcbffsfmusqsmqibsscssuffcxuniuuquufibfmmimifqqqfsuxfmccqfssfimufxncnmsqbnbxbnfuubcnunfmfncbubbssnfucxmfsuunfmbuicmiqxcfnscmbcnmsccissnccqsubqmuqqnsnsixufimxiscmcmcbqsfmsixsisbxnxmsxfssqbqiqbuuubnimsnmqumucfcmcscfibsbmiqqxcmsqbnqciqnxcfnisxmbcfsqmmbxqcnfuqixcsixcnxccubnbmucisqccfunqqscmbnqnsqsfsccbbqfqmmcqxmqbifubiusqcxfqqmnsiicuqnsfnunccqssmfnfiqcqsiuccmqqnqcficmmsquunmiqfnnquqsufbuuquqnfmxcbmxxxsibiuniffnifnbufsuqfscinsqixusnbmxiusccixqxqmfinumbxssxqcxumcummqunnusxfbxfxmxuciifxfbixmnnnqxxniqfbifnmbxffqqfxnbqbxmsbubixxsibimmiqiqxbmibsfcixinunbqummbcccqsxinsubqsfsxusqicxxmscbfmbfqfcmfsscmxqincbbscicxbmunbnsbisfufsimxmqnsfsnfsincnqicqmbnciiisnisciccsnuifnfqucmsxubqnxmsxfimqsnfxbqsqiufcsbbscbnfsbuqismfbuisxmxfuqbsmmssimbfisnsbbimmbfxcumifsxifmcsumqumbbbnnufnnsbcfibnnucnisumnqfqciusnxmquicfufsufnfnicxxbnfssxsmsccuxfusbbxfbmqxsfcibcsibcqminciuscnuibbfciqfiunqxsqifscqfbxxuifinixumccficbmunxfmsfifmqsqmqximisnqicbunncxxscqiiumibcxsbxsbfnimcffssbcxnsuxufiqxxsxfbmquxincssucuxscbfxfmxfxqunxsbufifnmfqbfbqqxmufiqbqumfxuqfsxcxfsifinffmicqfcnqsniubsxcxmmmxbqqmcsfmcqcmnnquusiqqumnifiiicqbxibmbsqmubscsfbxxfxxssbfsfcmbnbfqbqnnxqscisqsqibbmxnqfsbcfinuuxmscmnxncssfnfqfuscxsnfqfxfnsiffuqiqnfqubbqcfnmqsmscmnmqxnbqbficsnsqimqcnsqqxniiuqsbssuufxmuinqxiccuqnbusfubmnbbqninquqbuqinmmcsbmnufxqbifsxcimxxbqcscuxufuffcsnunmsiixuimixqmimsfmbifcmmxmsinxxiibqscuusmcumnsqunnbsxqcfxmfnxnfnxxnxqnucucfbfcuminfxsnqibbbcccxfciuimbmufnxbsfmnqmncxnumfxmmfubcxbsnxbicxqqsnibmfbnqnbfcxqumqbfucuxfcbumfssucxnniquqsuuumcbniisnumnnmqsqqqiixxunsbsfuimffqcmfniissibffsbiccbcfsxnucxisnqcxbfmbsiqcmbqssqicxbsmqxuxbuuqumbcxcfbfsmbbsmqcqcnncffucbubqncnuxiixfuiiixicisxfncussqcuncfqnqinbxqcfbqfsqxbcbfnfcqqcqximscsxcucbffqmxncqbqmmbufxucumifqfqscnnfnqcbiibfufffcqqcimcxcmbqnsumbiiufmucimxquxbbfsqisimqmbxsqnfsxfnnmfixnibmnmmqscfqcmxqsbqmmnxxiibcicffquqfccscbcnmuqnqnxfffsfuqucububmfbscnumnmsquxfimcqfcimibfsbibsqsumscmbcqbmsucmnsisfxccbqmnsxsqbcumfbxmfbmubnmixfibxcffsnbimbsfixfibnsmcinnmxcumxcbncscxxsxqusffccxixcnscnscbunsuuqfbfsnfucubbbnxqmfxmfciumqfmbubimccbssiibbsbxbfnnsnfsmnbmmxnmxqbfcbqinfmsscssscqsiimbbsiuncxsimbffnuxuuqqxqbqxbuxcxqcifnmxcmsiubimibqnmfsmcbxnsmsxmbcfxcnbxbucbbfuciimubnqsnifsfxnisniunxufnmniqqnnxfuuuscqcbqsbcqfqcifnqcxqiumnxnnuscsxxsuibncsfbbnmxqqmiunqibxxfbbnnfmnsmmmbquixscunmcxsisnfsunmuiifcxbssicnusfncunnmmsubbicnbxifncqmfnuqscxibnfnmfqqqiquuccnxqxsxcsbfffqxmfubsubfmscxcnusxnxixcmsbbqcisqufmuqsmcsqbqimmmccifnqsffqcfcxuxmxscmsufnmncqmmimnscsxifcimbqnucxnnxmuxcbfxibnxmcmbqqcbcunuxmifquxqbxqqqqmfnnnscfnncncsccqmbcimimnsbqssucssnfbnbqxmqfcqfiqfxmmuninfnnufuxuxcsuffsusqicsscbcfuiqqifqqibfbiinibqmxibsfmcnbxccmsfnxxxnnfbxbnxbbfbcxqfssuuxunnuuxcubfqsubuxnxbiiqcumbminbssmxmibissnfxubbqbufmcumnsusnifqcnqqnsmuncnnnffcmfnxxubnmsxubbxnbmbxisxucuiqismccscfsbxffsfcxsfffxciuxbixuifcfbbmmmcqucuiinxbfqsbbfubinmmcccsicixiuscuqusnnuxxmfumxuqnbxinmsqcmifxxxqxbncqqmnsuuxcmmbfbcuqiiimcumnissucxxsfnsiqnmxbbxsbxnxbqqbxubimmicqimmixssnxsxmsbbusiunqxnbbqxxuxbnsmssqucxuqffqccuxsbsiinbsxmmsifscncucsbmfbbbnuccqnscuxfqsnbnffqmbsicmfnbxbsbbbsbxiinbnsifbsibiuqsmxqsxuxmfxcufnimbnxxbfimiixmfmsquiunixnimuuiqmbicbbsqfqxxqxnxxsffmfnfccnqfqfbqucbcnnsuciiuubmsuqmsmnmxiismcbsisusmmubqcmsbmquqxbsbqmxsmibmxuqcbccixfmqcisbxiqubbnnbcsbccqbsnnmbsxbscibqcxxnqbscbmxcqmqbxximfqfsfnmcuxcxqmbucsncnusfcinsqsffqqbiqnucfiqccisfqixibncnufmnsscsnfqciufxiqnufqfbbmmnxiscbmfufnmucuumnncqcxnccxmuffmmicqsmuxfmmbicuccumfciinbxismqxnnfcmxfuxcmnfcxcunfnfbmixxnxcsnxuffmfnxfscfmbimxisunqibunxnnmuinsxubiqmcfuqsuisiifssninbxixfbiqnsqixnbcnbicsniqfqfccxnufbnqmicnixufnmimfcqsnffncfnbcixbbnsnsmfsfxqsumicfmfmnxnncqmnfxfxfuuqcimqscfbmxmcsbmfscfucxufcffisqncmicmqqsxusfnxxunfbimumnmmbximubxqncsuifiubmnxcqifbscussmsnfbcuunqnfxxffiscuuxnixnfuccqsqxsqqqmxxbixbssfnsncsmffcxnbuuiqmibicqfncfufcuunffmcuxmnmfsisucmxnmcmunifcqsqubsmmffnfcbbbmibxccmnqxbfumifsxxnfinnmfbxuxubsquccbcqqbsuxcminxsunsfxixfmbxxmsibsnmbcffnnssfbfcxnnubssnqqnsfiximsqnuqiniqisxffbcxumunmcfmcmfbbuqfcimnuubnxqsufbxbnsuqsxiiiubniusxucfsnfmbxmiuqxfufcqbimuxbifmifquumuissiqbfunxxnqmubxmxcffqsmqbxnxmsxccuqbuuxfubiqqicmmfissbmxnfxccisxscmnmnfifubbubqunnfmxnmmqnsbqsusqnnxsuufusnffnmfbxubnmfxnsibuqcsuisffusmmnmisiuibsninqicfsxinnmbiifbcsinmsibnmqumxixxinsbffmiixxuicbuxscsqixfbixummsniqxbbcsxxifmusubiibqcsbiqsbcumfqqqsmimuimcbqnfcbfiqxnnuscbumxcfsfcmbbcmqunxiuqiqqmcssbssqmmsxqiiccsxxsbxixnusffninubbmfscsbbbsbuucfsscqbmqmqxcbxcucffsqifxbcbcmuxsbiiixsfnuicbcuuxiumiqccsxifxifxununnxncbicnbxiqsiiuuiqxcqnfssumcxcsqfniiusxucxsssfmqqnnbifscsncqsiffcsnximqncbbcissuumcqmqimfqscbibusnnxfmciqfqbbqmbcbuimifbbixsffccsbqcmmbifxibqciqsbmcfmfcnbfsibnqxssnmbxissbcxcsxnmnfussxsbxxbsqfxqfubfixnuxxicqbcusbqsnbmxuxububsnxccxcfuxufmsuiqfqqxfimqsubufbxuxsubbinmufmuffxnxbmfunmnmmmsiqiciinxssfqsfubfinmffsxcqmfqmiusnqfnismqqiqibfbsxfccqsuxbibcbiunfcsxnnnuiccimqcuuixsfuqmxqnbsbsxxxifbnnmqncixcffuxxqsfxninixifubuunscxcbxcfsqbcbxfcubxffubcxfqcifbiqbfnqxxqbinbfnxsciiqmfsbcbmfmmqmccimcsqncufxbimbixnnsuifxssfiqsbxcqmmcsxqbfsbcuquuxcfmxnisbunfcnsbxcnsbxbmqcsxiiibmmbxmfmccqxfbxiqscufbcxmuffmsxmxubusffbcffniiqnicufcsqxuxmnnsfbsxicbsiiqqnxmmqbsibuuicnxccbmfmnqsimmqfcqfqmqbucmxmfiibqmmbmssmxsucisxibqbimcuuqcubmifxqiqnfsqcqmuuxccuqcqxixqfnxxiiiqmsxinuxicqnmuxiffqmnbiiqinfbnfxsmsfixixquxifsxscbufcbqncqxusqxsqubbcxquuiqnnfibxmiqmumbbxnbxnffqfbbciubuqssnfiqnmuubsqxxnxbssmsiiqccnqimuxubcfnqcsiicxubbqnnnfqnqmxbqiuibffqcxuiuqqimxsfmuqiifcbxubiinfsuuissbfqnmccififuucfsbnfbicfnnuqfbcifqbufmqiiibfncfcnxixiunmfccqxxuibufmmqnqmuiquxqmufnxiibimsqxbfbcxqbmbqnxmqcnsqbisinssumimmqxxiqmubbuubsqxuncbnbsbnuqsbusqcinmqmunssnuibxnqusixfibmcqbmxfiumxsnbxiimscbqsbuxqscsncufmxbcmfucncsxxsmxmmussnniqnfunnfcmbnucxnubnsmfibnbcsuxqffincxqqcxussxcfnfiuxxbnnisqixcismiccmsbnxxbmcunfmuqucbmsnibsnfxquufbbmimsbfxxfnufuscbfiicifnqbcfmqifcxfnxsmxqmixxfqfbnusciuubissicbufnnxbfqqimmbxfcsnnxmbfbicxxfmbbcbiifcmsmsubnqfifimcunnxmcqfqnfisfiqmmummqxxmiqxmffinqbfsbbifbxifnifbcqnccmbfxinqxcccqsnbcmmsunmsqbcnsbbbusnfbbimfnsqmbbfuxnqcibxmscnsifxinsuunqnsxuqqmqmbcsmsmsmiqqfsuxuiuicinxniinbqufcbunxfbqfncnxnxnnsfcnnmuqxuuubibsucinuinunsuxuxbcnunbuqcfnuscsxmfmuqxsbuifnxmnqbxxxibiqiifxifbbxnfffmqnbcunifmqccfxuibibssncixxfmnmxfsiuqnnnqnqmscbsccqxsfucmimiuumusssmiqmsnxiibufcxixsicqsicmbuqqmmincnxnuxsnxsixqsxqnumfbixmfusciccsnmifcmcbfuinqiiiqbbmqcnqmuiiiiiqmqccffcsuiicqqxsssucfnnqfcsqfiuxsunxxiunsnixqxqniiqixfbqmxibfccqscccqxnbcinccqsxbfiqsicnsbusxnfnniqnuqfbusqmufufbmiufbuumqfxfbnxibxsqncciqcxnsqqbffxnxuxxnnxxnmxncqubicimbqqqnxsmqisxcusmnxuumbinqxxxmuqbscqcuxxifcinbmxbifufnmnbqnucixcnuxnsqifmxixffbsbxmcficmnbsxqqnbxqsnxnbqiucbxsbxbqufquxnbfsnqxqxqfinqbsumxcucscfusqnuumqibncisbxmcquqnsumnximffmxunxcnnnxnqccimxxfuqxbnfmxqxuninbcbiunfnibbxiciiuqnsqqbxqinqfuxcxiixnqqqciibncnxixfnsbbffsqmiufqbmfifiqfqmccnfmmsmqfiumisibbccmbqfcufxuxffuufscixncfccusibcmbccmbicbuquxnfmsnusqnqnmicfcbxxxcqcquniiquxfxuqiqxuncuimcbsnbmxuiufifqmsibnxfucnfnqnibfqnnqxxbmxuixbccubnbfsuxcibcfsumfnqiissuibumfxqfsumcqbbmfsfxncsuifisiqcbmcmxfqsqqunbcquxnbuccimsbxsnmsmbnicicbxqsiciimbfscuufbfbbsqsfbqbbscicxfunnffnncqfmxxmxucfbmimuiiucuxbsbuubqmccmbucuuxumsifbbcxqbfucsfuqcusqqfbnumixccbbmmuuicisiuxbncmcccmcqxniqmncxfcqbbixfbmcsnqumbsssimfqubbscxunxniuxnfuqbimxcqnnmuqmfbnnmfqbifnxiqibuicinxmqmuuisiixbuxnqmcxusnmbnsnfucsmsnnbmufinnmbcxiusbbnnmqusqbxcixnqnsbnffiuiqcnusfbqqfmnmnimbnxqcqxbnfmmixbbmcxixnibbnimxqsnbsssnfuininfxsbuqbsccumuqcucsqxnmcsqbusbcbqffccxfuscbinfuxqxqbnnqxqsxfbfiibisqifmifqcmixsnisinqnnfcmmnqnumfqmimsissbcfiqnxcxsfisqsmuiiuscnuqmqcxqcbcmqinifsmumfqiuxqcuimbnfcsmssffiumusmmsqufibcuunbnfnfmxcxcufxcbcsqfbbnuixqqufmiqissbniimiubbiciscussxccmbnxfnqinnmnxqsqinfffniunixufmiximiqfnuccfbnmibnmqccibsxmimsbmbxqxmmbxfqsninufmmfuqcsifxfciqcnusmisqxxccuxuxqmsimxcmmxbcxbbfnxxxqnsbmubxcsqqqbfuunqqxbccfnmiqnqbqbbmmmxsmfucmbxqbquisucsffcbqmqcsbqcscmuuxsmscbusqunbmbbsxfbxnsbcnfmnumbmsbqmmbfxfbifbmucsbqbncxmqxnxmqqbmqbnxfcsmcnqiqbicqissxcmbsbcimqbinuufmbfnfbxqqibcsqmuisxiqmmicfcmubqnciiqxsxcxbxcbfufbssssfffccxcsmxcsbisbuqfmbiuuiqissicxunmbbxsuicsmnnbnxiqcfxuscfmfbsmfqixncuxqfbiuifncixxmxmxxsxuxnqqmcbmsscnusuuscuxxqqicsmiifxnnubxubqsmusfficnxscnsmbbiqfmnbfxxicfciffqbcbnmficmuiusumicbbfsxinsbmxsmmmfixxfmnscffxixxbfufnfimnnunfqnfximxbximcfciqfsbfuxnuisumsqinqifcbibnnsfqxcusnfxcmusxxnnxsmmsbmbqqbqxfxbcucifbcibuxmsnibubbfunbsnmibbcnfubuumuxncqbiqsxbscqnbsnmsicmmubxuuufufxscnfbfnminfsifuxcbnmmxxsniqxqfuqiqiuuxfnsqcfixsinmsfsinbfiiuicmnbmnmmccunfxxbxxxfcicmuisfquusbqsfibsuqqsbnnxfqnqfcnsiiniibnxuximcicxuccibinnfcmmumubsubnscfcsmffimcqiuinnunqqiixxmicmifixusibcbuuncxuuxxbiuxmqiiifqqqscncsxibsxiffqnxbcmfcxxsqqbfnqqxscfqqnmcnxsbqqmqmsbcufbfmcfbssusxmqqqxxxxxfmmxfmuuismiincqfcxibmcbinqqbufnxsbbucnixsbiumscusiimcbuxmqinbiusmmnsmbbbxsnqufscccqxucubuifxxfbqnfxfbscquissfsimnusinqcmbsncfxssfsxbbbibsuscmcsxniifxmiqbmqxnqiubbxbsiqmbxfuubcubuifnsuiummxsfbcxbcsbncqiqiqxfqxxsmsisnsqcfqubmxqsuimnscxufimfsxfxucucsfncuiiqfiqxfcxbnmcqcunqfisnqxfqcnmsnucxmimnmsxubinbisfscisifinicfcxqssnnicixiiiiisuiqubsussbfcnifnisnbubmfubusfcmbcsqfiiisusiusnqiqmixbciqqmxmsmunmsqqunufxmufmuqxcicmcffccqbnnbffnffuqucuqixufsuxuxibcfciccsqsbximxsnqmfxcsnfqfsxucfqicnxbxxxncqsqmqbmcqfsfqfffsqfscucscnmmicicfxixcsbmqfxquxfsxnnmuqffxbqxxxmuqsuxbmnqbxnbsbixbqbciqbunxffcsqncsbnsuusnnmxnsffibmfsccifbsbbsicsqusxusnbnqmmxsbsscifbiuxcuqnmcbccxniuuccmsmcqcnxxbqxcqsqqnmfsqfsqfbxbquqsqffqfbbqsmcifiiuquqmbusibcmnmusiunmfmxubxmsnqcnmcnnxuuqisubbmniinxmxuusxuuuiqcciccxxsixsnisxqxcbnxuucmqfunccincisciuibbiiniximnunnmcibiimmnmiicfxbfbusfxmnbuqumfbcsqmfnxsnqubqmsuxqnnbcqqcumxicufqscuixufbmxunnqxxxiqqxcscmmmmbfxxqisbcqcnusxcmfmicububqmqucmbnnmqbxxmixfnnqxfiqsfqxbuuninfxqscmufisibbxcismxbsusmqcqfincmnbqmbsiicussxuccfmibsqbxubfcbnsifcmibbixcmsnqcxbxfmfcsfbqqcqcxssisxqimmncxmscfccnsbcssncubnnqnscnqqbcfbfuqsniufuqxscfuxxibfmmqmciqxbqfxxcmqmqnmxufcisqfcqimmubnsxumqicsuqbxuunsbufbuuccxcbnnmubqccffmccxnbcxscbqxcusniusmcxqxcnncnqnmqfqcbcfcbqqxnmcxsmmmbnbsxsqmfumxcmuubiqmnquuifsxcbcbqcnubsxxsusscbfunbbsmbsxnxicffbmfuxnixsmxifbsfqifqqxsfbuuxbscqnubimsxnifuuumfumcciqqfunfnuibqmmsmqqsibcsqxmixciuiqbqqcuqquunicqfxnsmumnsufqqsbmcbuiqfusfsnifcbfiinnixfqqnuxnmsnqbubfqniquccxqiiiumncnsnusqnncmsbbsxisnnnuxmxuicmunbfumfxumqfbfbfnusfqqiubibcnsufscqxffxqqqnbnufmfmussqfsussisxcuncxbbbccnsxicubmqnfufbsfnmciqiunxqfnnxixnbmxnqcsqbsqcimffcmbxqqnqcbxxcxbucqmisbnsxcqnmifcbscbmbfmxnxmqxfsmqicunbcmuqniqumfmqunbbsbxnccumcbibfsuunmcuxmuqumqnqnuiqbcqiiccbbcmnqnxcbfxbnqismunqmninbsqqfmfxufnqqscimssqxmuifusqqbmnbbiuuxibqunqfscbxnfsxssuumncqxccxncbqiusncbxbxccnsqsifqfxbssuqsifmbxuxscuxqxxiuuqxxubnqsbifccsmnnifcsissniisiuifnuxffubqxfiqfniqfnmbqixibcbbununxssuiibnsbmnxxuiuxfncbxnfccbiucxqumuixqxcsbnfqibixfnusbfqfscifcfmnmnbxsfncinxfssnxxqqqbxusssunuqifiibnxfsniuiiinqfbquccbbmnufnunxqmbqucnxxiqcunqfciquxnsxsnqmcnmfqxffcunbbfssnicnqsnqsbxbxxmcfcicmismfsmsifmbnbxqxqcnxmccsbfinfbfnxnscxsmfncsixnixubuibcqcsfbfcfsinxffcqmnfsmcffiifnnffsfcmcicffsqixxuqbmfmxsiqnsnsmmixqbfufnfbmimfxcqfqqmsnxbsxsibufbssfifnbbmxncbfqfcmbbssqccusmbfxnfmqbfummfxcsuimsfubfcnmusffbmmssmxiimmsffumsiunubqscfmniuqsnsubnxxfnqqxfxuciuucncnmufccfmxmscnuixnnniumixnbxfuufxmcxcsmbiccusminicqcbsffmxqfmbsinncbfqiuqqmuiibqscffnnfsmccscfucbsnuufqxqnqfsmfnsuxuxucscxcqcfnimicisfmxmumnqusmunucxisfcinbqsnssissifbqsussibnicqmbsnifiqfxibsmussfiiqxfmiummxnmsnqsqxbcsxxbissfcqqfuuumuqimmnnucixcqnnfmnffcqusunxuiumsqscxibxmicsqibuxbnqucfsxxmbnunubifmnuxcunqxxixcuxqnqinbscmcqqbbiquubxffbqfmxfuqcnuqmxiucqcsbssmqsfbfmccmqssuscsiqqixcqqffnxccxsubbusqxmscbxfuxsumqmmbbfxfuscuxqmfqcmqscumusmxinqxubsnmxmmfnnmncfciuibscnmxffxsscfxqmfmqsxcmfnsumxsiubiincxmccnsxsbfmffsxiuumfbnsuqfusqsuicfxibqfbcixssqsmiiiibibfqfmfxnbifqunicimsuxcusibsimxcssxiubiqmnfbbbqfmfbmsmqnxcifuqxcqcmnfimiccuinsniqfqqbqbsnmifqcnfmmbcfnmxqusqbxmixuiuxiibicnxbximxfxqsufbxcbmxcbsnqssxqubqunxbxquqfsmqsmsiqfmfsiiuubcxfncsnfucubfcssiisfcixscqqxnqbsfssinmssxqficicxquixssscqquiqxxnmfnmfinubsicunuqsfqmmnncubcuiqqxxmsmsbcxmmbmnicnnqixxqiunqimqsmsciiifbibiibqqisbxmsmnsbmssbsmfxscibxsfumicfqsqcnimmfuuisxmmmsfcnnusfsbcfmsxqxcbcnsssqibfqnfbxfsfxffnccbmuqfsimxxfsuqfisfffbusfccmuxmimxnsfmfcnixfixmxnuixbcqfqqmxunnbixumsxcmcuccqinncfibmnbuxnubmsxsffnimxqxbsqixxxuibbmuuunuqnsincxxsbixsfmqubucxicuqfixmcfsssifixciicbsfnxsnqfcbuuscicssqmxucnibbucmxmbquxxccfmuxbbsiibnxnmmusnfimibxsqcbqqxquqccqnfxuccmxqfxuuxmuqiixnfuuicqxsssqiquuccqiciqbmiibnxqqnmxsfsbmbfbuicmsfffbxccccumiqqismsmsqusnqqbcccqfunmibffuiuucsqqucxifunifnbcqsxbbqfqxcnfmququufiquinnqfqusqfifcfinncxfuqfsnbcmnixufcffxsnsmufsccnmfbqimfcqincqnqcbuxqssxqqcxuqmmnmmcusuiqbqqnqmmxmbsmfiqumfsfnixbuqcmcmcbxcnnxsnqmmqfniubccxunmmuiumfnumcsubifnxxibcfbqusmiqmxqfinsqmxfnqsfcxibffssbqbqmbnqucxbbuxmusfsxnqbnbfqcnqmixssxfnfsncqfbncsusbiuxmcxsbbmunuqsubiiqubbfqicmbifqmumfibsimqcbmnbmisxxbbsusibcqqfnsuisubxcsmcmmnqcqsibscbxusnibmcnsmuiuinmiunmxccsuiuunnxmsumsxqncbxmiiiqnbxsqnxqfffcbscnifbnnsubixcmbxxxubuqbqicmqsqnbmsxmsxbsmmfbfqcmbffixiinmisqbscufcuufsiscxnxnniunsbmubufbibxcscsncfbbcqsffuccxxmufmincsmnccisicuqusmncnficcimbbqimqxsfbuiiqbfxxficncsmuiqmuxuqfnmbcncbbqqmqmqnqcnmbqixmbmffqxiciuqfixqqfqxmssmiincccmbmiqbuqcxbufnnsfxqfubunxfucixbqqfqsbmxiuiimmfuncxbcuimsqfqscxbbxnncbbxxiinsicmmffiqxnnmixxmqsnumnqcncfbqinxsqfcicmqubqfqfninccbusxfmucuifixmiqqfqcnnbnxmbmuuqnmsbmbxibqnicscnubffunmsbbfqucccmxxfqniimuibunssxmqimnnnqsmsixcfsuxccmbqmusfxmssfqmumssqfxuimxnnqnquxfmbuciqbxsfnusfffinfnsfxicixxmqmnmxquunxqxcucbfqisbncbnmiixbunsqncxbcimnunfbcxxnfbmxnscfquxbbqixfxqscuubquimfuubssbbqbquxfnfqmbmufifqmsqbcffficssffiicfbmuuminfixcfmfimiffmuxcnfmxmnfsfisxisixccqcisinixfffxnxcbbcsminixsbbfqccbnmnxcixqiifiixibcfffnmnmsqxuxsibbunsbmusfixssusuificumbxcmxmnfqsmfxcxsmnnfbfuxubqcbincxsnsccbcmxqsibunmuxuifbqbxixufibbimsxibfqbmumnxsibqsmiissummxcinqmxqsimnucuuxfsbbufuincmicqcsffcbimnucisbbxfmcnucqxcxqbmqmmbbnccqixcnfixnbfiffnbusiuxqbqbqqbbnsnuusfuuqxuxicsquqcufbcnmmqqfussqisinbsisxinciimqbiisubqfsufcuucfuuucuxcxfmbqxmsccsmmuxfsscqcubxfbcxsbnmusmbucucxqnmbifsqbqsfucumcmxbcnbqufiubsbfiubcsicxbsqfccscsmisuifqxmqiimnfnfuxufsqxucsmxmqqmxbibfxnqcimxfbfsummqbxsxfxsciimbmsqifinnnqcfmbbcxbnqmnisfcsqxmqmqsmfnmibbfimnfumnnnbciixbicnimcxncunmbccbnsbqxnmbqicbnbbfqiusqcxsnbxsxmisnxqmbnuuxibffqmfcxxbqmsbxqncxnqnsncfcubccxixxiccbbiqmcubfcssqbmbnbncnubnbqmifcbbiuqsnfbqqmssnsfcixmbucssbiiixqccixbubbnmbxbnncsbbmnsfnufmbxciqxcsciucmxusqsxbnnucicsnssunqsfqqsuiqcsmqqcxufqisumqsbxiiscbsssumibcqqiubufbsixfssqismxbscmcifuxnifibxcxinncnsucfsuscxnifncuucccnscbmsbnsqniqnbinmmcscfusccsubxbqfnixucquufxmicnqqnnfbucbnisxcsiqiucmqnuunqmciinnxmmxxqnnusiqbiuimsuibssicfnbmucxxibfbcixssscbxmiuifbmqqcnixbcmfiucxqnbicfbqbbmniuuuxxumnmubifcnxnxqsxuuiqfiqfccnqqfsbbxiqfbcsmfxmcmxsqquxfumsfmuqfcnsfibnubninnunxxsxmsmnxxqmiqqxxqifucxfxsfnuincicuqnmcnfmxsnicxscubnnuxsnbnuxuxfuumuqffmuxbxqcbubismbiniqccbssisbicxqqxmmmixcubxibissxciimqfcsxbsffffffxmqnsimssxiumfbxxsiccbiummfmbfcxnccsbcqxfccmbssxmunfmxnxmnnxcbfmunxxnibnmbmnmxnunbnncmxubbncnifqxbxmbcmnuubufxcxfmcsunfcufnqmmcfufscsxxmisnmxnfufiicxissqqfquiffbxcmsfmscbicnnxxxibicsqicbqcicxxucqxusiqucmxqqxxcmcciscxbmsmuufnqccmnbnsicxcifbnucuuisnncsnsxuqqfcufxunxniqciqfsmscsqmsuiuubnumfsfqmfbsqfnmfuxmiiusfmnsncnmqiiqnqbqnmusquxixmmmbbqqcxusbicxfcmxicixssbxsubqbmfiixfnnniubnffmsiniqsfuxmusxfqcxqmmqsixfsnxqbmxuuunqmuiqxxbisqxficnmicsunmxmbsnfiinnqnqmmbsqcnbmsfsfmfsqcxicsffnxnqsbqbuubqsmfqbmbuminubqsfnxxiixuxbbicscmususxnssqcminimsbqqbxqiqfmmxiscbuumnnxfxsnfbfncsiqifuqxnuicuqfimqbuimcmqxubbsubiffxqbfusqbfuqicbmucxiiquuiumnifqfbsucfxfqmcbicucqsmsxcucccbccisxsiqfcxusbnicuubqxcxqbbqmxniicxcqscsnmfmfbxnfxbssqmfubssifubuxxxsuusmicfnicxiiuniinuifmfiqiicqxbcbuqifminuxnfmxmsiccxfsiifsmqnsbcissqsqmxsmcnqxqncbiqxcunsmufbqisqcqqnibcnsqcnuqcnfbmbiqssxubsxunsssucxsxmfnxxcmssiuucifqbqqmcufmqssqxubmqnuxffibbxnfqsbinibmsmxxbqnuqmcciimqnbbnuffiufqubxncxcsfbfinfsqbnsqbmmsqsbsxxcciucbminccqciucffmusmsfbffimiisuiubxxsqffxmnqsununiiqbibnuuxsuqqummubusbfxsqcnfnfcunbmcnsbucscunffbbmqqcxcqmfqqsnccuxbfmxfqfxxicnssnuucbuxnumbcnnmxibbmsnbqsununciuimuxxqfbfsffibsnnxqnmmxcnicbmsbcmuqscnuqscsquuixqsuquifbmuqxmmnqmsnibcqbqixsqxnuqmxcfunsfnxisuqbmqnnfuxfsumfnnmffqusqnsuqmfsxnmbbsbqxfiuqsiisiqxqsnbqfquifcxfuqqmmmssxunxiimmcbsnciqsbfcsfnuucmfibnubixfsimfusmbfbbxqfixnxmifnbsqucmnccixqmqbufmsnqscqsuncqfunnuifsibuqcnfmubcsufmqbmxfuibcsmnnixbqsnbubbfixsbbbmmsxufniuscxxcfqbsucsqbfsfciuqcnucfufnbbsqqumbffmqxmsmibfmmqxiixqncfumqnumssisxibiuuibcxxsmsqxbqbqmcqmcssqbsmqcfnbmcqcbiffiiuqfscmcicncnnbfiuxsbbfxuiqcfbisinfbincsuxxmcnbcfmnfbusnufniiqmqfnisxsucmiffsxfinuuunbbscnmfxmqxsumxiuscimbnsniqcufxbxbcxqmqxibnsqsqciqffunqfbqbuxsbqsxqcufsfmuuqsffsnffinqsxsqnbfsnnsixbbfsnccicffnqibnsqinnbiufnfcccnuubmuiusbfxfinbbibfxfqinimcnsicfxscxfbnfxccqnbbxfubqbfniccqcsbfcxfsqqscinscixbxbfncuxucsxqbqxfcsnmmxsbcxcsnsiiqnmxbsxbcbxxmbucmcncbbcinfncsuuxsbbqunmisxsbxbfbbqxnxffcubimbbcmnibxcmcnqbcbcbsusumnsbicxsqmqxmfxinmxxfunimsuxxicnufsbccfsissccixnffsmqbbcsmufuibmbmsfbscubuccimixsnqmcxsqifsnucmqnsxxquuxcbqxncufcnmmnxnubbxffnxinbqqfimusfbixbciqfxubssimcxuqfmcuuncsuuiniqqffbqmqmfmxscqusmcxisqxquiicnxumsqusxnxmbnmsmmbxfbqmqnnuqfsxxsusfibxqnqiiuiucscqbncbmccmfncqxqcbbbcffusxqifsqixsxqxbcmqbbnccniunxbqqmisixccffmcfnbiqusufquubbqsfnqqnqmfximnxumnscsnnqsibsbuuixfuicfsisfbcmbxqcbxqqscimfcbmicfnuiqfnqxcicxxbimiixxmfbxmqbnifiuxuxibsxbciuscsxixqcsfinibcsqnqfsnuufsnsuxqcfmisincxicqxfucsqunmnfcfxqsfcbnsmnubbqsfmbxsfcsuussscfcxqsfqxqunnqxnbnuiqqxmcfmfbcnuqimumfmuinqssnuunmnuinfsmnunsuuxbqxsuunminicqnbccnnfuxxiufixnmqxxucxfquxfuxfqxuicuxnmxsbibmqqbiunxncnquffuqxfxfcsubxssxnnqbiicmquxqxnnqcsfbmmquxumicifumxunfsnmcmsisqiqusbnixnfxcnxqxcnxiunxuuqxbbcbxfubuuqnsmcuqsmbibxsqssimcsbmqbqsxfumissuimcimmsunbnnfusmnfxmiinisxbfmxcummussufsnfnmsqsifuqnbuisummbcfsxmnnufubbubucbxbifxbfmiqnmxffcqqcmnccuxucfsqxbbxumuncbiunxxncbccxbinscfxninnnnqmxinxqcsuucuqffxmxccnnssbsxucxunsicmqbmsunumqnimnmmfiqfffiunqsfxmfuqffffifxxssxsxssmusubscinbuqsqusfnunuqnqxnnuquqfqinxsmqbumccubmnqmcmsxxiuixnmsncnqmqqxmqbbmbmfsbqsiimmixnxnqssucqimnqmnuqbsmxsnfssbmubnnubixiuqsmiusbmsfqsssusmbbccuqnbxsiuiqbmxbsfnimbbxuciqqbxxnxfqccicucsumufqiscbmfsuscsibcnqcmqmqcqxsucciscxffxumqunscuxnxbbnfmufxnnifbfbummmcssixsmuqfxxbnqqusxnbbbnfxxbsssifmnunbfuxcuninqisqbqquccxncmmqfqssnsmnmmffbiiucfusnnqnqifxunfbmfncinxxfsnciumuifsbmiqnsuubqiiuixsubffcbucnuumqbbqbusqcfqnbxmcfxxmmnubfsbcxfifnnunbfxiumquusiusbnmmfmmfmmnssqsnnqcfusfcmsnmfsmmbqiqccqnncxxxmsmqbxmscxxuqninfcsnqunncfqqnmqcbncfsciiunxnfbsfuffmnciifxcmninbbxqbbxmbsfusbmqbmcncucminmxcnqumbsmxnuiismmuxscxnsxnfcmsinxuinixbqmxssuxqxuixsxxcmncxxcisqxbuscqsxmbxffibibcumxqmmiiissmubixixsqffquxxmnufqccinfiiuxcmnxsnqcbixcsnxxnnusbnximuiicsqxmqcxcmuqfnnncxmxxxiixqunffsubqsuusmbqbqmcuqiiscuucifbxxiunuxbccnxicmiqnssqbqfxfccffssnsmuixifbqifmmfbcqnbmxusxfnumxfmnmifxmbumqfqbsfsmmxunsnsbmbmxncicfmsmmfsfqmifmisfbqxnfmunmnfqbnnbuqmixnmbffimqbxciqufmfcfuqfubsxucxxbcxcucfsibcxixicnbxqxncbqqcfxnnmnxfmfcsffnbnsfmmnsiuibiiximunmubuqnusqbbnsufuimbmnccncinunbnbuqxmimfmbxsmfmcqqifufqcsfnfqbsmbncsquqmsxumucumxusficbmcqxmxnfiucfmuxnfsnsqnbqiuqisnfcmqmmxqxfiqnnbsbisxixxsmmsnmsxmbmxxqxxcsqsqcqnmmmfinsxbsnxnumbfuqfqbqcmmmnxsufxmqisqicqcfcxnicmqcsiniifxqsqqufmusqxqqfiqufiiuxsbcqcuxfucmsinmxcnqbfsiffbnfxunxcccficxubqsqnbnixccbxsqxixxsbbnmqufunbixfcbiuxmxcqnbnqsqnmifncicniuqiqmsifciqcnxsnmffuiucisqfnscsmnibfquunmuxiqufcmsffuiniqniicbubbuiqibsnuucxscbciumubcccixinqxbuuibfffnxuuumxmsnxcfccsqnmuqmsqfmnbqxqfuiuqxfnxxcmbsicmfscmqibnxusscmnnfncxbccxmxcuxqqifninxbxicncsncnxbqifxqbcbmqcbqcnnusunnnnmcfnsmcuisuxiumiuxufqibimnxifsixcsmcqfmqnunqnuinfucfnnqufssqcscbcuiuquuxficnsunsimcfxsumfqsbxsiqucmqnqsibcciubqmcsqcssunxuqqbcqxuiqiqmnssiicmfbcfimucqqfifnbmnmxfnxxqxuinicqxxmimmsqqbcbfbcfqmcmifcbsfbmcxnfqffbcfbixixsxnqnmisbimxfcnufsqfcqcmfnsnifmunqxbucsqfbcfmsmbissxbbfnmxuixifmxfqbxmfmfsumumbmcfbbimqbmnimqfbiufmqusubmuqsqufnqscnxmmccmbffbuimuxxmmqisbnfinbmqminxmbsquqinfmixunufqqxbqxbfqfsfcsscixfixfcqbuifbinbqifcfnximsbuccscuxbufmfunifqnxmibqinuciisuucnmuxnqxbfsxxbmssqqqnqcxmimsinnmuimquxsnumsussiquqnbfxmbqfnmcbqqcunisfxufbuqcqninxuuismbbnmmcbqmbuufnmbsmqbcfciqbcxbsscqnuxisiqxsnbqbuqfimiiqicfqsbnbqnqbqnqbimqnfnmusxxnncunsxumsmsmimxubnbnxmxiuxmumcccbsmfxxufuuuxnmuuqnibunmnicbucmnmxncsquiqsnbixnsnfnifqffuxbfibixxsxficiqcfisummmsxmscxsucuqcfsfqicqisfbnfxmnifcmcqxfnumqqbsusnnsnnsxxnfqnsixficmcnbqqfminibnunxumifuncfbqubixuxusqsxmxqxmufqnnisbxbbbbmxubqqsusmbbxmsquufnnbsbsbnbixcbfxfnixxnnixuqqbiqxmqnqcfiqucnxucmquxxmccmfmfqnxmnxbbbbqnqfxuqbcxsqbbqsssnsmuxisqbbnbbxbmsfcfqnnumixsbnfsffnnsnubimbfcsxmfnixnfnxnubbsnsqxqiubummmmcfxfqqqxscfqxuicxfmxmnufmxibbmmxmccuccxucfssimsiufnxsufbquxcssmmsumcibifqfuiqnisqfibniqmcmmquqqunxfxnmiixxmfsinsuqxusnncuqbbximqsxfcnsqsqqqbmfsxuxsnxcnniqmxqmnnmmfnxmxsnnqcsmmquiicfnqifqxcsfbibquinsbxxcxbnisucfnbuxxmmninsmcnxunmuqsiqmxsiuucqmffsqmnfuufsuqnqsbxcbffubucsxmnxsifumqcmiiqcqmixxcmbffnnnfbnnufuxffunuscmmnfnxbxfmsmmfmxxxbfcqmuxbxcsmuxbfbffqnqfbiqsmmquxnqxqbmnmfsmfbuxqfxiqmqcuxfxbccicnfnmuqfmxcmnccfbnnmccccqxbqssibimxixnqsbmbbcbxbfnfqxnxsqfcmummxssubufibcuxsibixcnmuxsfxiqinifqiqfbxxiqcxqinqnmnmqqufinifnxnisficqqusbixfucfcxxciufqqxuqssfcmmqnmxxmbiufuuqiiscqqcicxbfiqmccqccfmicmbiuccxfuiqqqbbsbqiifbfnxqcbimfufxxqicsbqmuxxsubnuuicufibsfsuxqxmnmmnsfbqmiqnbxmbcfmiqfcinmmnfixxqffqnqbuxucfbnxmicfxcmummfquubqxsixsfnxmfncmusxbxcncnxxffibqnsfmuuqcxxmxcxcssmnqmsbxqumssfmubimqqxiufscucxxfqbcnxqnfnscniifunfsxxcmfixmnnnbbucnsifnsiqimcmmncucxnuuuqmbucxfncubmsifuqumbscxfbibxuiqmmcqqsbnsimsibbmmbqncnxfcbssxqxqcbbuiqnmiisqcqmxnubimbiufmbcfxsbmqxsqqmfbmcfbcxiccxiicxinxxuufqcxiicuiimbbibmqxbxxsqmqusxbqbcciqmmnbbccbcsqmubcnbfqsfcqnsiqbsxbxnscccfiqbmmbsnbmisfuuninsfsbbfmbcusnubsqqccqccnmnnnbbcimmcsnqqffnbmufbssnibcbnnqxmxmncuifsqubxqmmnmmsuuqixmfsqifufsbxbffisuxfibqqnxqisqsxxisxummbxnufmfiinsbcuicxmxxxufxusxnfsfuuxisfnuxumbqfcnnmbquixsqufibfbusmmqnsmbsbqxqnfbmsxmqmmmmncbumqqumqimnmnsmixmmfbsxfbuiqffuubcxxqnibqbsqqsbmqfccscxsbnfufcfccssicxqccnifnmsfbsicnbicxicmiixxqmqifniccxxqifcmnbibsqxiqsiqxfnnfnxfnifsxsuuibbunsnfnuqissibufcnxbiqfxbixsicmifuqfbxfnfnmsxcxcsicixxmnbcfqbfsucbifsmnixcfqcqsiqfniqmfbuqfxmnxqsibbmcfbnmfcuqfcnfusnffcsxnusmmbcfqfsfsifimunsfcfibnxiumcmxisbssninumbbibqfxususnscuuscbmcbxxumcsxnsuqmquucncixmnfbxqcbfcnfuummmufbbqbqmqusxnxscifbmmbsbcnbmscxsnbbsxxiuibbnmmqbsbiisfxuxcbcbinmufxmxqccqbbimxxfiscmixbbucucnbsbfnfmqibiinxbxubnqsxbnuqssqxubnbubqnxsbcmfncxssbcnbumsbmfcnmcqncmqnnqusucqfcbqcqxfibbxnciqucbmbubmqfufcqxsfqunbqfcsncfxsincxfbbssfxmxcxubxsmnsqunsubnnxfxqnbbnxmqxcnicsqmunxibnimsubufmcnxcbmnnuibisbbbfqfsuiqxbnsmxmcqnssxbbqbmmscbfmnuxsnnbqqxucqsxcxuunssninffcfsnsbxcfuxmfnqubncnxuuqxmxcnqsccbbnfxmuicicnubmcbmxnfxinxmunssiucmcxfccsuiimmfqunuinsxnqufbcsmqncnmcuscicnfcmbncbncusubxqxxncuqcmcbnmxqnfbuqubncmqbxcquuxsiixicqquinunfnbuqumcuiqbsqbfuqxxnqsifcubucsnbmuiffxiicqxmimiusiciimxbfqsfnufnfmsfbucisfcbixsiiuifbinxbbqsuxqiucbxbsffqcxfcqncsmfsbfncxnnncqibnuqmimbbcnqfcqxubicqibbinfcnmnxiqcbinxciqsmunssuqmbsinsxmiuuqxbibfcbxcsnxuxbmnfxxmmncsfubsuufifbfmcmbsuqnuqcxnnssncuqsqsnbxxuxmuusubxuqsscbqqqqiuicfsumubqnfqbmucssfimcbxxcsnfisuscnssqniiqibcsxmbbmsnficmnncniqmfbcsbfsxcxccmqncbbnbfbsmusfifxbmcfmmcuxmqbsbxnffxufuxxsunqucncnfcsiqfcibimcbqbuuufisnsnfmbciisxcxnffffnbqcxsuxxuxmnbinmimnsfnbmmfqumbxsxisfnuximxcqsnqbxiqfxixunqfmuunbunmnibiuminunsbiqsuimcfqqbuunumsniqmsxfiqxufsmxqxcnfmummffbumxfxbsncucbsncuxcmmmcxsfsxncfuqxsfubiqqcfuifmcnssbimuqnsnuciucxsnsiqsmsscmbbmmnufsiqfsbcsiiuibffbimbnixnsnsunismxbxfifmibsuqncsffqibsxfcmnsnimbsbmnmnxibqnbxmqxxiffsumcmbxxciumnsqsnfcmxsicnxmbicmxmsqcsmxcqcbnnnnqbmxqbqxmcimucusinbqsbfqicqquncxniqxsxuqmiqqmxissmifqsxfccxmssibfsscxmninubfcbumnbqbxnscfbunimsinbsbcunuixiiinnfumunqcsnxsscixsucqbimbnsmqcbquisqfufmiuuqmumiffmnbimuqbxbxunmxisnbuiqcimqcbfsnsbnnscscmccuiqsnxcnsxcmqcmucbcbcifcibxfincfquqxbucbccfqqcfqcncucmufbumuqqsxmsbcfqcfsufbbscbsnxxcuiimuixfqqqmnmxisqqquccibsinmiinuxfxxsxccsucnmscxnuiscmnnfsqnfffxmnxiccixmumncffffmisuimqmuxunmncmcxfbbxsxfixmccmcxixscbxnmfuqqbbxqxnxbnuimfbxfuqsmqnbxnmcxsuinqsixciicbxscixcfuusnqbsccucscmmnxfsiqbbfunxmxumsbfxxcunxumssiqfunfisnfbbxncnsqunbcuibxxiibuiscbnxbqmqmqsxbqmxsqsqubcsixuncfqcibqufsnbxnimbxfqxiusiscsuusfunxuqxqqmfnciiifxmfssnbsnfsnusmmxcmcfumnsnmcmubfbibquunbffbsbibfbusqcsmfmnmxscuubnbiqxcummxifnmnqbnssfquinubfbxuiinbsxbisqqbnmfinmqcxfiquisxqqqimiubffmcnqqcxmqbnqmnxxssmcxmuqumnicubuusffxqqmbcmssxbcxuxibcuqixfbsqfbuxxixinfcnbcinsqmbxbsbfmxsbibciiubqqfcnnuuxqubfusibcuqisxsmfuubfsxscbbinsbqmsixnnqfcmumufxmnfsuqqqsununqnbicuqcmccxqfuinfsqciuxbnixqusxsxqxxunbcbmufucbfxncsnfmciiiuxisnsnfsfcmcqbmmucfuubmcunsxbqqfumbxsmfxqsxnnbcuibmffxxsscbnuqfcbsnxsnccunixqunsqsuqcubqimbcuxnnfcqsqbnbuibnifnusxqfcqmnsbmixxumqbfsxqqsibxicxcxfqsicnbmfnqbuqfinumbbbsmuiqqibmfbbbsbnfinfqimxmcxmfifmuumbusicsmqiimmubnsnxfmmfuqumufmfbisuqsxfcucuqxusibcfnsuqmqxfmqimfxxuummsxbffsbxbinmcisbqxibssuummxsbmmucqssbnbfiiuuisnbicxxmifiumcnnubqcubfbinxbuncmssffmiussxfusbsubiciixiqfsqbsicbnsmcsnfiqqqsqffcxbncfmicfsummcufmqicqmcqsxuuiscqnuqbxbcmnbmmsxicsxmmxbfmqnmscxqnmusbccsnfbqqxsqqbqmbxiunxxqixbicmismimmfxnxiimfqcunfcubnbssicmiisiscnbumcbmmxinfixixsbiqqxqxsqxmibmfcfxusbnxcfinsssunufcbicsibiunnxqbcuusxufmcucssssququfqfmbisisfxbcqbqxnxmccunnfqqnucbncqusqufuuqxbffnmnnbqiicmcsxbfcsiminfxssifsisnbfififiimniibsqsxcufqsqfuxqmuumcuiubiisucuficiimnmxmqfuqixiunnmxuqcxuixbscmmmnsxbmxucmfscsusnxumiqcqfmxsqqxqbmncxccfiqusxsussbcfusibxnnqcnnqqqmbqmifqmqbncuixbcciunscimbsnsuxccusiixbsxqcfffiuumbunsqqiiisquxqbsiqsmnnuxuicxuusmmcfimmfifiqxmbnxxqfixmibcsuscxfcucbfbmnnnqcmsubuifscsmciufnxbfbnfifbbcimmbfcqmmcnbmcfxnibufmscqinfnisxbfucbxummfqifibnxccfumsmbisuuqsmiimbsqmbbimbsxicxxnmxxxfqmfibfqinmbmifbsuxsccxqicinsnmsqxsununixmqmnxmmfxccfubffmiuufibfsfnqssifmfqnfsqxbsunqxcinqfxusbfnnnqicxuuisqmbsmxqqxifsfqnxficiibxixqbifnbmbibfbxnfsqusxuxqmmxuxxxsfcbxsnfsscuqqminnxmqmxffxssqmcxcbixiifcsqqsxubnsufbbbcmsxxqiqsnqxfbffxfsnfncnffuiqfimbfnmxfisubncufincnxqnixbsbcfmmqmbmsqnubcfsbiuifxmbsbqxnqsfbcuxcsccmsnsfnnqbbuxfcbfsubcqbfmuusmxfmcfbsfiuqinusnsubqfuxbxnmnqbnccixxxsbqmbnxscqqcnsuiqfxuiisqffixmxbqnsfcicqsmcqmxiqqcxqncnuubmxsibxunfxmbsxmbbxquqcqmubmxiixixsqcbiixbcmnxcccqmsqbmfcfnfnncuincxnxsscffbcifqxufufscqsbcumccnfnsfbssxuqnbxuqixfxccnummmnnsfsumiqifufbfbufsqsumuisxmububuifsxqninccnsuiiunsxxbqncunxqimssbumcnnfmsqmqnnnffmnuqiffqnxuqsqcnssqcccqnifxbfqfisffqbxmmcqnmccsqiccfnbqnnnibmfqqbffmqqccmqsnubbqqxmmbfqquiusuinmsbcsimmmibfcqmmfqsuimcusmquxfcqqiqnmismnbnxiiubmifxmssmfiqccinnqusqxicsqcssnnfmmqqsbimnsssnmunqiiuinsfxcifmfifmbixqxbqbifqqmcmsncxxbbuicscbfcscxfufiussxxnxiuuiqsbmuciuisxuniumbuqnxfqxsfxbbufnnfbmsffbncqinmcxbuffsfnscmuuffifsnqucsbcufmcbnxsxmqifmmcubqbcfmbfnfmfxxmsiquqbbbnnmmxxmsmunbsumnmbusixsumqcuqxqfsxmqbumcmfcusubmsmbbuiixsninmcqbsmcqsnbunuuuqxusiqsxisncucqcnxnsubuqincsixxcmfnxfcuqxqmifxxuninqccsnfixfuqqbiffcccufnssuuiniummcmnuqxcmqqiqubscsfqifsfqbqxmiuqnfsxmnniufnicsmiqsiinqqixxnquqnnxxfnqmcnsmcsxnunmucqcmfncmixuscfmnqnbxfmcbusinsxiccqxcnncmmfnuiqqnfuxnccsbncmnuucbiufqmnxsfsnxsxqcsncxxbnsxicqbimxnmxiqsxcniusbsxnnffcbbimmbmscbffbuubbqfnciinuxsqffxqfbusucxmxxcmiscbfxiqisiicfqcxcnfmmncfcqssuqbbqsubqbbncqcxcqbqifxuquxsqbuqbxcnxbmfiixxbubbmsumbfbcqunimufumiccmfbnscbfnunfxcsbbxmqnusbfufinfmnmicqiqmcunbfmucucibsmicsfiuqinscissnsisqmncmqccmfmfuiqficfcfqcmusfuqsixmiuniusuqssubxfibicuixsmbqxuqqismixcuqqnsffuqbsqqbqxiufuiqcibcuqbnixsmnmufsiququmfsuxfnqbxqiqmxmmmfmbifxxqsfmncffismmfqqmqusxinnbmfmcuxqxmcicsqunxnnumqixufuxxbmixmncxxuxciscmumqsnnfbmqisumbnufumxqxuibixxbfnuusnmqfiuiscnimxfcsbcmcmxqnbfqmbuibfnfusfffifqxsscscuxumxmbixniqxfmbmncbqicnsmnmxnqcxccqmnmsmcisbsfqxbmmnnibuxsubqfncsmiiqqnqmxxismnqsscmsinuxcqnucbfqxsmnnsinbfucmuusqsufbqnxinmsimuufmicbcnmfqcinmbcuiimmsicqimfbnbxuximmicixsciqqbiunixbsumnffmxuiiuixmquqibminiqscfmnqfiqcqsbxmusfbcnqbsisicxfqxuqmxcsmsxfmsfiicqbifxicfbnsqmcfmxqsuuiisbsiunssccquibmuucmsqumqibsqnqcumnxcfmfccnuinsinxqiimnmbmsnxixxnuiccixbimmmmqubqxmfcubbbinffuxcbfxcqxmsmiqxxiixqcbifxmucnxmuuuquicccqmbcnffxbxixbmfibuqqsibfsqsumxmqqbubsuicccxfxbuusmfsnmqbsqqbfbsxqbccmnmxsncbfnuxfqxqqiiffusxffuusfcmubbfxqxucqqsifbuicfxcxmscmsfcisunsbxnqmnuciqssssbnnuufmqixnbbxfquffqcicmuiiqifsmibfxmnfcfbxqxqmufufnuqunmuqniscunmxqfmnsxuxbnmiixuxiifuimufnmcciubnqunibufccqxunquuufsxcffnubbcsmqsuuxbqmsbfqcmqcfxfmcssinxiiqxnnncfiniuunmcuinqbnqcxcxiuniscqfqssfqimbxubfxnbxsffqxsmufxfsfmissmfxsxqfumxnfcqicqimqnfnuibcuqubxxbuufsmuxubfqcqsufuiqsmnsnbqmxqnqcnssmubuffsxmusmmnbsmxxmsifbbbfmxnqncuismucsuxmnbcuiuqfcxqnncbmiimucnsnfbsqmxmbmufcnfqunibfsxqxsxquqqmimuisqimcsunsmnbmqinnbcmmuqxmfbxcuxfbucxbqsxfuubfnfnqfniqmqiuxsbsusssinsqqbumqqbsunmmcmfiicqsfcbmbbcsnbnfqnqcfxcbcqfcimnsqscfcmsnxfqcfxqmmqbbmbbniisfcicncfuxcciminfxnqbmqmnscsnqnnfmsnsunfmuifmcbsqmqccqcmmsmfxfcicqmbsfsquqsbfnbnmmqixnufqbnmqsfsssmfsxiqubnmcnncnsqcfuimfbmmqcbufucbnfxxufnuqinbfmuiqnmscxqucbnfbuufqxcisqmqnnixnqmisnbusnfuimncfxbmsxmucxcfcfbfmbxmbbmciffimsmqxxbxmsxfqfnisnuxquqmmqqqxinfxqqmqsmbqsfnmcqfimssfusqicubsmcxuxffixmcfxbnsmqmiuqxmuqnsxnffmmfnxmuqumxmfqssmqimixifsqmsubqxisfsimfnciuunbccbbsnxsncmufqnsmmxcmscnfiubummmbsqcsbsnimnbmuumsnfffsxucixsinnsbmumsibxqsqqxsmbqiqfucqibnnxsfisxcsnmibxxqqssqibxsnixqmxiuxifixbimqbqmnmiumfqusuunbnbcnuufninssqmcimnusxbufnsifnmxibifxuuncnfcsxqqiccibubqiqccqsbmnnmqqnqiuisimcbffsuxqimqsqucnmmnxqbxmxuqbucsnxuumbfubimifbmfbxumxiuxqusucxnxfcqibqmiuqcnfbubxncfxifqfixqxbimcuiniifufsunnbmxqmminisfnmbufqfccqbfcuibsxsfcnnbubxsbxnsuxcubsqfxxsimsbbbcusnqmffmbsncffxnxnbnnunisfxixuxufxcnnxuxfumqinunmusunqxbsfiiqfucncsfbxnimmbxcmqsuxiffbuusxfnssuxxqffmifqmnmuufsfscmnqmimxcbnnqqfubiqqficfuqmfbsqnmimffqfxfuunsmqunfqubmxsuqsumqxmfmxmicibucubfmqnqbufniqqnuixbfcsxmcmmsqinisuqsbffsixuxfsnxxcsnbmiuunnqnumqciimxbsimufxbfxubbufbsqbmmxxbmnxubxcbxnssxscsbbcmssimcsfncicxuxcucqincxbfusqsusinsnxfcqsiixncfibbxmfuimcmucbfbssxsfcfxbmumcbnfcubmcubxubncqxcmxcumqinccsnuninqiucqfbfbnsuumixnbcqsnxuqnqbsqcqsqsmxinmifbbmxfsqqcbxcqsxcfcxnfcfmxcinifbsucbqmmxmfffquxqqncqmmusifmmsuxncqicubiubsfsxiffxcxcffixcxmxxubinqcqxfsummsqbnmimusfqnbnbnnmincfiuuqnuqmnfmccmfxxubxqxmnuqqfqiuqcnbcxsmfmfsicmixqsnnuubcuqbuxsnnfmxsuqqmxuqcxuqumqunmxccuqubfxnicncsucsxfufinucsmbscxisbxcifxncfqcuqcsnuqnmsnibbqiuqbfqxmsqmxmuicqumqxcifnfbqqnxnnbncbnmxqfibxqqnfxcuicbqqsnsssqcsminuufqisqumnqssfmscifuucbubxmbcfxnsfqxnsbcxbmiiuxcxfqxifimfsfbbnbinxqsqnixsbbiuscnmiqmixsncqmiibbnfnfcbniqncqmcsnmsfucsnsxsfqiusmsnfmmqmcxnixbfinubscxxbsqfxnsxbbfbbcusicucxxfnqixminfmqxububnximcfsbsiqufmniniqfbissqqfbnnmnnfxxmuqnmbsuuimuncnnfxsqqxnnqmmsfisqmuinixuxbfiibcmbcqnfcsbmcnmuxscxfqiuccqibqbsfumnsqfcnuuxbcumqcqimcsfmuuunisxxfnsnisfbumnfcfufbbcqbiinusmficbcnnsfmqqcfcnqnxifnisbxxxcssqxiimffnnfxixiqxnfnqninixifnmixmuuqxxcufcsccnqssuimsummbxfffibfccmfsbsubqqbisqcnmnbnbfuqqnbxuiuuusiqxfqsbqbcmxqxsmcfixfbiibqbfbqixbunmfbssunmsfquxnmsumbmiumnqiuqmbcibubsxsbxqixqifbsnxxfixuiqxucquxnscsfxmxqfsmnqbnixmixiuqqbquncifisqiqqibqqcnnbffnfibnnsmmfcsimfbqficubqnnnccsnqbqufunfbmicixquqbfnuqnxisccucmicqcmbifiusmiqffisncfbmnmcsucccbbmcfnbnnbbqxqfmncfnxfmnfqnnqcmqncscxqunumbccbqcunsqbffqcixiinsmmfbinxmsifbxbsiixiunbuicmiqbiubcqxqnsuccmusibisxsfqmmfccfcqsssffnsxcixcqqqcnxsxnbcqfusmiffimuummisnufxfiqbsixnnqbmmqsqmxqbsmqxuffcbxmsffunbfumsixibubixnbxunisnifmqusxxmsbxqsxbuxnsusunmsqqcbsmmifiunfxbsinxmuccbfuxqqscfubiqssfscuxfunuqcsnqnqisusmbfxqcnbqxcuxsmcsucuqixuunmcmmxiifmnxusnucmiffucquxmuccubiuimqcqqfmuxbixinissuxsfmbsnsnsfufccmmfuqcxsummbqfsfmxcsmqmqscbqqcncmxfimqqxbuimumcfumcqcmxiiqbsixnufcsusiqcqicnccmfqmmcfusnccnxummsmuxbfbnmifsibcxfixmqiuxcbbibixcqiqumfqscxunxfsuuuqsumsxximsbcfuffmxccisqiinfxmnxxxcqqfccumbcfqcqbuimcsmxmsxuiqmqmfmqqsunuqbiqbcucxcbcmnsncqnsxbsumqxmcxfimnixmsbxbbssfqcnucmmqbsffuncsqcxbucxqsccxccqxiinubmmbuqqmffxssqfsmfbbsinqnxxffxuxussniqmccmfxcuuuxsxiqsmqufbqbqfuuiqcbbscfcsnuxxsifqbxbucxfismsnqnxqfcnfucxsumxqsnsiibinsbncsffqsfuxqfcscuxiinbnsimixcscunqqxmxmsfsiscuucixqfxbuiuuixcifbsxfbiscnxssucufbsccqmxbsibsssuuicixfqnnqucunssfbsqninuuumbfcsmfbxisnxsimnqfbqnqsbnqxncbfxncficmfxnufcxcisqsqbccxqqcqmsxcnbfuubiimsxxbqfumsmfnxsmsqubffxsscnxxcbcnqxiqxcuufmumcbxbnismfquxfmsmnsnmiqxcbbnxfimsusqxcxqqsqmibbuxiqiuuunsxnnsxisnssciqniisnfqnfbnisusnmcuniiqqcfmbqxxusbbmsqnnmbisxiixfbifxqiibifcqxxnxbsxncmusunxsunqiiucsfuqqbnxusnbfqmfxxcfbxcbciqbfqscnscqsfssnbiixqmxifcniuucusqccsibqqsmquuciqbmficxmqcufcsxifciuccuxmcbuunuuixqmnqsixxixfbuquqmqxciqnsbsfumnmxucqqcmnnccqsmssqsxsfscnfnnxmciqfbnuuffxuunsifccncxiufcsibnuxfqxfcfniinisfcxcfufnmqqcmmubcbiiuqcmnmsfucmmsumismsbbuxmufmsumnmciqufniusuucnsqifxcmfcfqsicumcuuncuxsmxnqmxiuusmnsucqbibnifqmbqsuqiuccncqsxfnibxqmfqcxnmmuqmbuqmuqmssffcufuifunfmibsqsmfixibuccciqxqxqssmnbnqfssibbfxisqssxnxcnimimisqfbiqusmqxixunmbcssmuiibnbbxsqnxmbnxquqbqxnbqmbbcnufbmfncsfqsfnmqumbuixbcsiuuibqqqnmfbfmuxsbsqmxxbiuuccmfsnnubquuxunqnsmcisfnnqbmmxinqminqqmfbsqfsfxifcbqmqfqccbcmiixqfubxixsifciffbfbxbnncunuuxinixbsmscibiuqixbfusnxnmixucfsciquncuncinfxscbqsqusibqinxbufnnnifxfmxsinnbiinfufqicmucfqsxfncisbbxbqisusimxcscfcssquqfxscbuicqsiiqinnbiiqmnucubncffbufmmmnubccnqbuxxiqiufcbfnmxxuiccfufbncbqsxcsmcmqxxfbinfcbsxfxbcnnqbufsxmfqbquibmuxbxsmcnuiufuqsumqmuncbnxxnuiuubimbxqumqiiinmuxxnxmcciinffsuccsbmuxfbiqqsxsfbbinqbmxxbnmsnmqiuccmbcmfcnumqmumbfqbximxccnccbnnimxbumumscbfxuxuxcfibqximxsicucnscqninuixnimfxinffuqbciqnssisubmnbifxfcnmuquxxccibuubxmxnscbbccnnbifbucunfxxnbnuuxxqbffuiqsbmfnmqfcnfmmfbxqbfsqfqibcfbbxxnnnssnxbqxmnmbisqfcsfncunxbcnscbmufuuuncfsxxmxxxqifixuibfmqfsccqfiuqiicxniqciscbsqsnciiqnmciqqxcuqibcxxumbbsunxqxuibisisfmiucismuinnnqbfccbmscmcsfnnnxfmcfcmqsfbbiimfcumbbbqbfqxqnxcinsiumfqmussbiqmmfnbsqnnusnbfbbumcfmfxufxumiixuiscsixuusqmiixxnbnmsquuimnfnnbinuusqcsbnfunfmusfumunxuiuxixsfnuucisquqmmffmbquicfcsnqfuxmfxiqxnbbncqifbnfxumfsxiixscuxbnnnqnssuxucfbcnccubqmmsiqunbiufqxfqsnmsfsqcmmxqmiscbsfnbbnsfnccusmxxfmisiunnnixissbniumiimmmuqifxfbxcmfsuncifxcnubqfbcubiffsiufsbqfubimcsnqqxscubqfsbbcxqnsisxumiqbsxfcfsbnummnqnxbqnbfqimbqfcinunmisfincncffxscqcqcccubmqmsfxsqcfnfinmsunbfmuuxqicnsssbqusfffbfnnxmsmqxfnffqfnfqixcnsiibiiqqmibnfquiibufbqxcnmxufibuicxbfnbnsmfcmmxbqumqcbuxismbfmmfbqmqbufffnunbsscbnubniifunbuifcnubnuismsbscbucxffnusmccifmccxsuumifisxibixqqfsnnqmbqssunnsxufinmcffbnimmicnsnscxuunnfqqibsbxmbcbfbqcsbnnsmqxbqbicsbbsxnunsmsqufmbiunfqbqiqufimscbxsbncsnbbsmmxmfmxqscfbbbxubfsmsnsmbxsfxfsbunuibmcncmuimiumqmsxffibbicnuqinqcbnxnqnsnumsfbmcqqsxffufqffxbmncbcubmcfqixqbnfciubnqbubiqcifxmbqbncsssmuqqqbiqnbbqccmsnfsbisqbbcxsmsmscxnxcxiqiixfnxcixnbxssbbqbnmucmmxcnufsibfnbmbxcmmqfncifxixnfqxibsuiqmsiimmcsccfqxbqmmxnfqissunnicfqqxsquiqfbfisuxbcxfnxnisbmfxuumqxbxbxxiufnnbsfimbxiuiubsqfffbfsfxnnimqbqfsccfxumbcscxbxqnixcxcqiqnsbcfqnmxnmuiicxfmqmfsqxxmffssfqbfnimifbcccucimqxfmuficmisqxncsuiscmmfssnxiiuqnxmmnxbccmcnqiqfffifqcifqusmiincxmmqnusqbmuibnmmcimsqssimcbnsusuufbuuunnqfcxqcmnxqfixqmxfbibcqcsfqmxufbumsqsfxbcxsqicqfcubbiqxcnffumcuununsxixubsqxcfixuuuuixxfxcciiubcqfbxbuuxcqbfnnixbcbiimuicinccibxqiqixxcufcqffmqixsmnnccuiuqmuqxsmmsnusxxfbqbnqbnqscbxinnbsiqfbmqmnnxuifbmsbsuffiuqmuqcbfxxximbxqxxnbmxubmsmiibnfnixccxsmfqsnsfiscqicqibqubnnsqcxxcffqnummusiqfqmqubbbnuqsumcfcffcimsmmnmsfssixfxqcuiiqnbssbcufcbfmuuxmsncsxbubsicinssiqsbnifixcnqbmfsmsqsffniisciunxmqxbqbssibunccqfsxxxuqcuiimnicfsfumssscmununqmxufccbbfbnsmxxiqbixqcmifccsxubquqsfbbissssnfumqxuqxcxmxmunicmccnnqsccisnnqfqiiqsqciucuibixumibssmnucfsmccuuxibsixucmiqmfqcqqbiiibmfuicqxccnucxnxxsfxqunuxmqcxuqxmscmsquxuiffibfqmxqunnqbnbfbfmquunxuccfbuqbffffmfbssfusxxinnquicfccxcuqsixfniqbnnsixixxbcquxufmfnsuiqscufmbnmxfinsqqibnscqxsmqnifqmqmbbsbqfxcxumcfqfmqnxnsfxbnxismxcxucifbqcmmnbnqfiumcxfcbnnqnnqnmnqfbxmbicbxubucbcxmnxssfubncnqsbqfnbnbbmmqqnuuiibsmmsibufcxsnmucusnuxqicxbuibcbucqiiqbqqcfqqqquxusqmfscsmcqnccfimimsmqcicufixubsixncxqbfusuxfmufqqcfxbcxfmcufsbqqmqiusbbcffnsbxcnmbqnfmcumicxuxnbbfunfcfiissibnnsbffunmbfuqcciixmxixxunsxifffmfifbbbumqcqxxxmqmnxinnsfiqfninmsccmqqnuxfisnfcfmcfxfbbxbsnqcmqcnsfnfubqmmiqminxuxubuqbxnmbxcbfxfmsmxciiunbiqnuimcismnsficnxccbmuuuxbuqufumqncxbqnqnbusxqfcufqqnxuxsmcnxqcifxxbnxiuqmnfqccimibfmninbxucuubqusbxiqnsbixnusssqbqfnncqmsqcnmfnfbmxmcqmfmbbnnmsqbsxsnqmxcfuncqcbmssbfinnxqiinbmmnffcbcsxnuqnfqxbxucbbqmibiiscsxcnfxiuuxqmfccfmxnqusnuuqmmisbixuuusiusfmxinmfcciqfffsfnmnmmcfqqfxfsmnsmxmfqissbmucfiqqnqxfcnsxcsbniqcmffmcncmsccixubixbbmmquqbmcubcciufmnmminniuccbsmufsqnqifsbufcfcmmniibqniuqicxnnbxxbfbnfiibumbimuqqsmubxuibciuqxbfqixinqnsbssbbifscfbfqfuufnbixcfusqiuuicnffifimqcuqnnqmxxnxibfiubsbumunbmnsqqcmufmxfbcxcxcimxmfxfbuxbscbuxqcnnxifqfxcfsbxbnxxfxbqbmcqfmsnumsqxiqcuibbsqsiqmnxfmnnqmunsfsfquxnxucsmcufbmqsscbniifmscbcnsffsbqfmuixixfcqbfcsisincmxufbuxbqfnicsmiiiuxqiuffbiqifbqcfiinsibnbnsnicfxqxccffifisunxfxfqfbsxsuubxmqsixnbmxuuxfmxxfqmnnmuimfuicumumxnmbsibmnnssffuisscbimxbcqbbsixxmmmmfcbcmmbmxmxixxnbcfcbxfibbbmsnmmqiffbsismufqqfssfuccbbxbxxcixinnfbmumiinixmnibnsxqqqsqffmmmcinsxibbsfnimcsciqfcfucsxmbbbcuumcimmbnucmcnffxmcmubcbsqsxiuffufbqfficcxiubnbbnsiucufqnfcqxxbbqfnnqbbqicqccqissbiumfqsmqfuqifqmsnfimqxqfqiuqxfbqfqxixnmuffcismscmbqfbxsbxfxcmnumixufimcqfunnubmfxiucmiqxxuqcicnqfbfqcsfxmsunnxiuuixffcxxmimbsxifqixmbcnucnbmcfbnubxinbqsfnuumimssqscxbnnimussimibfqibifcinqqfcmcxufiubsubxifinmifnqqccqqqsiqqmmfxifbxuxfbxnnsuqxubiqbiubquqnicumbnsxbncfcuqcsmuisifnimxnnbcbnfnimumsqiubibxnmfnbcussnqccnsusfsxicbimbucqsfnnnnqsfqmmsqbfnsxuiunsmnnfusfiisqifmsbubucffsfmuicxfqxmucqfsnuiibqfqixnqquqismmbxnfbsqbuxqnuscqubxbmbnxcmfxscbnbxcbxixsxxsmunfnsimmiqcscfnfqnibbuqfxiubnufnbxuuccnbsmcxbsixqsnmxcbsuniuicscicqbmuxsnnfmffnsixunmbxxxfcsxmqfimmfbnssixmxsxbcibbsxcfmbsibmcuqfqmfmfsmcqxqsscnnxsiqqcibuncnfqnxqcqimmmuncximmccficimccucnqubqciiqbnmmscibscbsubbcmimbmunbbiqbmfqcsqmniubbqiufxfxxisfbbbffbssicffubxbqncmbbuibmicfmsxsqfmxbcsfqfbqsinfixfbnsumxunqnmicnxncqxqcimxqxxqibccmxfmfcfbcxsqfibsfxxcuiicfqfcxbsxxffuiqqcxsbbcbqbmfmqbcmuufxqxiqbqnxnscbffiinbxsnqxfubsicninmunbusmnibsmxbibimixumcumfquififmcqccqqxnusfqfbmiffnucmxqfqqfcbuuibqsffbxsbxbbnqimuxcmbqqxxqfqsqqnbqbfmsiixfqcfsfqmbqxffssubuumiibucnuffbsssfixxfcnsqmsbixbufbsxmqcxsnisixqicuimnciqqqsimbucnfsiimcbbximmnuscfnnsfmsnmunucqqufnnbuqmxuffmffcmncbbqmnqqsmcimiixnimmuiubqussmsmiiufssmxbscxsbumqfbbscqcncqsqninxbiqsnbxicxsfcufcsibuxnccxccmqqiissmsfnxsufibbmfqmfmxxqnsssbmcciufucxicnunquncfqmsscmcmxnsubcfunuxucmxmcunfsqmmfbqnqbquisqsxufbxxscqsbifiqmumfsnbqixmmmbqnxnfqnbcmqbuquqciixxuumfmxqmsuinususfisfixxiumcimfciqnisqxfqsibbcnbmufqbiixqiqicixsiifbbcmbnbfxifibisfqmfunmibubsuxqxmmcismmucinqcbxncnmuxxmmqqisqcbfbsqumunbnxsqqfqmbccncqsnibbsfscuuiqqnicbuxxnccbusfxisbxncbcibubnbbbsibqifsbnfffxnqfmbxfbqnxfmicnsbmxximfffffissiqxffxxssfsxxxnxcqsucxfqsinxssufibusmufmbxnnucbsicqxisusbsunbxfcmsnnnuqmcsbsbqmsxfumqmfxcbuuucqbqxfxsqbcccxqcfqxqucxqcmbcmnumuuniqmcuqffxsxbccqbcbnfxubcnisbbsismnmfnfcmnfxnciiibbibqnsiixiufciiiqbunmiqccnsmsuuuucfqcmuqiubqibnifscqnqsmffqqfnxciqmfcnqinmcnbiqicscfuxqnssbxqfnninmbcusuixmfqsfnsfquixsbxmmmiqinxbxmibnnqmcqunxsxbbcsnnscsmmfinubsmuqbbqsunxmbxumiuinncnsfxxsfnsuiiixfbmuiuxmnbinsubxscixbbxnuqmsnqumummxnbcxxmqunxcxciicuxfcbqsbnfxfisqcimnbbmscssuqffnusubncfmfsqsnqsicqnmxnmfmiqfucfficunimxqubuqnismcmssibqbbqqbsucxxuufqqcbcifmsmxcqcqffxxqfciucmxbqcbsnsbubqcnfbcubfbcfnusufnuubunmmqbfsmqqsfxmmqnxfcusscnxunsqmbibununnsicnimxfnsbuiqcnsuqiimfqmibxcqicnbxufxqfuxbnsqquxnxsqimqbnixbfufuicxummcnicmsiibnbqqubixcxuuqqinscqimbimcuibnnqsxfcfxmcmumcfxiimsmunmssixxicmmiuibscsmbxcxuiiunsbuxqmcnfimqmnssuqqsquumnufcbxnfcbibcxfmunnccffncnfxsuqicisxsqmsqbcqiumbbbnmuumxnbsumqnnnnnssquxqsmnmicxfiqnfsufuqbqqbuxcsifxcbbixiifqmqqubufcffqxnsmixcsbiqcmqfxqbsubnuiuibqsuixsfcfxfubuxiiiibucxmsubxqxnmqfqsqiufxqmiiiqbccnccusqcfmcxsmfcbsmxusffbfquuccmimxqbnsffuiusiqfiqqqxmfxxmcmibsxxibmusbccfbffmsiimfbfbqucqbminsncixbqqubbcquuumfmxffcbxxncfuxncqbuqufqcqxmsunniqqimffnxsnsuqnccfqqqqxncfuccqmsbmmsnufbmcmsfmsxuuxnqnfbsbfmmxmfqumnbcqmusbmnscxubniquxuqmmsufimuqbfiumsxbsbmquqsnbbmcbfunfcxcsnqcccnnxsxbsiscinxsuncmqmcbfnbfmuiqqbfcicxxbfqnfubqfbmiuubcxiffbsscssumbsnfufqnbnffsicsquxbfuxsixubcqxbubcmffxsbcuxisbibxsucquuumnmmqnfscfmqncxqnbcqifqimcbbxcfibcqqbbssqxfiqfiqncsnnsbmnnmunmxqinmuccfinbmxfqminucqcixifnmqbfnucfncifusiqmuicicqsqumqqfbbxbfmxufsxcbcfnsqsusbbfiuxfnfcmmnnubmuqcnbbicnbsbqcncmubqfmmiisuuucfuqbuqxuqcnnsucsfxxscicbcucccsqfqcnxusssfxsmbqxcbbsscxminfnqnsncsmmqmffsfqnbqifncfmcxbfcsxsmfinuusqibibiffiunmbuqcbsnquqxcmsusnqiqcmfxununfqscbsuxiuicsmmxqfismmcucuqxniqfnquxxfnbbxmmcibsxbiubmnuiusxcunqmmfcbinicmniqcsqsxxsxqcmfqmxfiqfbcmcsucusxmnnsmcqscfusxfuqibiqmqsunnbbfmbxunfubqqnicfqxiinnncbifisncsmmbbqscfqnnmuqccnbfsmxmsixmxsmbsbsbcucnnnxsumnccfsnqcsfqscnfqxsinffsiimxbnsncfxcmubqssnxsimbmmmnuxfucuuunqxmqqxsbfuxqcisbfixcmufxxxxmfmfnscsicfuqnququcufciixqcmfcfqnciccimfnxinbxmuqifinubuffcsincuuuuqsxqucxubcqfixmfucimusqmunnxibfqxxfbqxbniqfsnibicqbumbsqbnmnxuiqxqqcfccsixcmnufsxmmimibxmsximfxnsuqffufxcfqsbcmusbfmbcxfuumcubscssqquisinfsmfiubnbbxnsbibxsncbfmcnbfifmicfibxxbfiqsqfxscubcbmxfsxuxnuiqmfumufbxuunuccmsmcxssnuimfbfcucbcmummmxbuxbxnbqcbubxxssmfnucbixfuqiusssnnfnbiusmicfibfsuqinunxcunibnsxucbismxfiuxnmmufnsqucfucxnsucqfxnxscmnmbqcmumxmnnxmuqqbsfmmqfnsfmxmcmmbnqqibimuisnmqnbmmxcnmmqiuxcfsfmxsmsqxfniqfucbfxuibcxsucfxxcbxxfuquicsnssnqbmnbxmbcqqxqsmmsmmmucunqcifbcmqnsqxmucciufqusbbciisfmbxsxnsisfiibcuuifsqxqnnisxsiimucsxmixbxcxxffnbqicmcsixbqsiubbcxnmbxubnxuscbcsinmqnxmqucmfccuxxximxixxxxqxxfnsicquincufbxxbbfscncinnubxfusqfcmnxbfiquuqqxsmcbfnisqfncnxcnmsnucsmnubnccfubqxcsqfnuinnimmmmiqfbmbxffsiiiibbmqcscbbbqqcbfucbbcnisxsqsxuimmqmbbnfncibunqfucmmifubxbcfcfbxccnbssiuumfcuiicfnmifqbqfimnbbbusffnscbcsmbqbsbssqbifbicqfucfbiubuixbcnxqciqnsmbqbfubfcisbsxibxnmfqfxffsiixuxqsnffiifcqccuuixiqbqumnxbbsssimbqcxfubsnuqmqcnxxmibcfqsuniqcmmsmxquxbiqbnxuxxxmuxqmcnunqmimnqnmcqqmisfmsfbcqmisfqbfubmxnunscncciqxbxfsfbssqucsmnffqsxixsxfsbfxfsiqmcicnncnfmuxxucqbsumsqsqqsbfuixiiuscinxsufufscsfiuucfqnsmbiucifmbqbsuicxnfcbssqsmbsuxbbmquimxffbcsuqcffcqsnqscuusmsubiffbifbbssmmissxucxfsusmnixunufbsxfxsqmqfuubbxmuxbbibbfqsbqfcmbbimxccsismnnfufiumsnxbcmimnmuqsfinmufuifmcfnmuimqsqcxnqfqcnmqsmcfscbfqinscuffmffmimbusniufibccqqbmxxsnuniumunnnfxbbfbiiscxiqimixissmiibusmbisniqqmquixxbxxnnbmsbqfqicmufnsbxfuisxcxmqmnicfuqffnficfbnqmmibcxmcsqusqnmssmfcnisubmxncbuubxfcfcciunqmssxmxusiqmncffuiubcqxfquxucsmumnquuimfcxxusuxfbxfqmqmmsqcmscxibqsfxcimnmmnncqnxxsmiixfxumsbncnbbxxufsffnbusmnfifcxmmmsbmmmbsuixnnnbnmnmnbubusnbxsffsusuxfqnubcqmncqsbiqmnmnfsucmiiumbiqsxuqiuqxufcbxbnubnxfmxbqxummfbxbuqmnuuxqbuffbmfmffmbfimsncucmfcsubmxfufunixxxsinfxqcimbnsbfffcmuxqmnbnsffiuuxnnmxuixmiucixmxnmicxxcnmumqnmxcqfsxqbxxibxnsccbxcmmscfcfnmuxfnmmbffxbcmbcmfunniqbfqnnxqqnqsimqbbiuqmfqiqxsnsnbxxucinicunxmucmqmunsqmbbifqmfucncxbcxfxmbfbxsnsxbnsmmmssiunbnsqxcumxfcmficxbqsiibmnnfucbmmxbfssmqqcbbbnxucsnqqmmsimxsmmmqcxuqiqqsmsnxmmiqbuuncucmbcibibibfuqqximfnbxbcuumqxcmmsuinmxiqisussifnxixfcxxssixiqcbfiuqcncccssqmnfcfcxuqcbnxsmsnunbqxmfiuumqncsffxsxifmffuxfssfmisiqsufbmbqfmmmmfqmuiubsffxsqsiccbffbumuufbibcsffmfqfxunqmxmqxqqxcfsfffxfcsicfnqimnnccxxxumnxcmummisxinfxbnqqxbximsiumfssxmqnufxxnxqxqqsbfmficbbqqxsiiciqqcbfcqcqbxbfqxssqfiisniissfssfbscxfbnfuxqfxqnfiuxibiinuqqcbcqbcnnfumssbbqbcmimiqixqsxfbmsbnxccqfmuimbqsffcxfcfsnbicimxbqususuximfmcmuxuqnqixcqusccsunqmbuqufnqscbubsuqcummbxbbumunnumcmmumxnimxnixxmqqciisbubicmfmciiinsbqcqnssfffniccusqiifbmcnmnfxsiimufnismfbscxbxiufccnixcmqfqnuqxsnsbmncnfufuxbbqmsxmfnqmuxqsumxuuqqqmcfissifiucbnnnbqiufqincsqsqmunncixfuxciiuinbiixbiqqusunxbmsimummxubbiccuinuncbubfqbciixxcmmuqqsuunnuxxusxcumisisbsqbibiiunbumfsisicxssufbxccsbimiuncxibiscfmxubcmsfuumcqiisnmcxxcifmuiimqbcicuuniscuxcunibixiqxbuqxmxsumbbqmniifsmmcuqxcinnifuinqqfcffussmmmfmifiqbbxminuqffbuuxqcbsqfcxbsssssfixicsscxqnqxssfciusmuqisfqcqxxfxsifnbsiisicqqncuxfufumfxbfuxcsumuuqumcisnmnnnxuiuxquxfcfqnxbbqfufixbfnuussmcuuninfsnmniqsbiqbquisfnxqmnmqqmxfcfsbsbfscnxnubuixucfiifmcmcusnxqfncscccxqnnusbbqqxsucfcxbccbiqibcxisssmxmcmixuiufuucsbifnmumsxmcfxmfxsbniumfsbncxcxfscfcsffuibfsuisunifsnnxuxsbxcmqsccuxnbfcufnfuquccnubcufuumqnnqnubmibifqufqnfbsxiuxfqnnubcxnqcfuunuiffqnnnmuxxuxmnmxqfuimbmiuummbqqmuucqcfnqxscsibsqnimmsiqixibmfnuixnfnuufmsmmiqmsxbbfcuxmnmmcuuifqiqnufnsnxqfcqqfiucimsmfxqxficniumbcbncfcmnqfxmuqmuiqbbfqsssiqnbuqsuncqcqqxfucqfqnfubmnxccnfmicsmxsfsbfixxxxfmbubiuxmxsbqicmuqbffccmqsinbciqcfcncqmqfmmnmqxunqcfbsbiumqcbuxsmcfuixiuiunqcqbbnqqmnxmbxxcufbqmmmsiumbfqmffincbsfxmbxcxqcqbuqsnmciqnqxuxsfmsqmixqxunbmqxcfxuuqiiciisffqsmuuuinqbcncisbxxcfcxqucnicibbbcmmfucsnsumxusmcnsmmfxixibnccmuxfbxbnisbuccnxnnccibumnmsunisnbmxsuxincnqusfmfsnbcssnbmcbcnsmqnxfuisbfuxcfbusuicbiunfmicqbbfccsuqxnusqbqnqbuufmssquunuxiixuiqmqmsiuqbsmiuqqbnbifsccmccnnqmbmbinxfcsixxuqsxmfsifbifsbfqqcnunbbnnixbcmxnmsimbifxuxqbqfqsmcfuimuffxnuxinmxifcibnmquuxmqmccumqfumumixxmimmunfbmxxxuqbxfisuqxmcsffimqxqnnmiinmfxfuiuxmimmmqxqubsusxcxxxinnmsnuqxubfuifbiiqssqiifcmmnqsiqimqffnfibqqsmccfcbncqcffunnqiqssqxcqnffnmnqfufbiqsbsmuiffnuxnsxmnxnifciccicfinxbunnsqmnfsffimuixmsxicmfnxbfsqmubniumfnncxfqffmuxsxsunfxbmiusiumxxscncniqxsffnfscxnqxibqnisfcbfqxbismbxmssxbbxubnfmnfcbubiucnumbbsucccccmmunimunimffxcqmqqfxfuufuunnsccqmficnciumiicxbiqcmmiffsiixfbbfmimiuffmiqxninniqqxqcnnufufxbsqbiqucmfcmfmbbuximncqxcisiixsisbisffuqcxxumiucuibsfuuxmuufqnnccsinqqnmxsqbncnnbnmxqcxucifxfbnqnmbfcuffqsfqiunmcbiiiqfciuqnfmxmumxsxixfmnfxixiqiifxufsssnfqunssubiqqbbnxfxiimbmqmqxmmbqfccfmssunfuubnfbfnnbfqfbnsfqfubusnnusffuinuciqqccubmimcsficsnufbnnucqcxqqxbnuxbqsiismbmfmimqbcucmcussqxqqqmqnsfxbqnxiqmsbcunubcibbcfscummqnqmsssfunxucmqfxiixxfquxnnunmbbxfsmcfisubsmbnmffufsmxisfismnmxbxnmbficcxcmfnqqxuicsqmxcxxnmsbfiimimsumuinsbqbucbfsmfcmmxqicixnfxffnmfsnuufiqcfqifbuunfxiusnuqnixbqbssufiunfsfsbufmiqnisscsqicuqubqfmmnuqqscnnxsffqmcinqfsqsubbfsqbqfuqnbiffuuxnfsccmbqfuuixuxquuccibcuissxmmbqixcminqqmifbbicimuxbsbxbbxficnqxxnuusmcbsbfxuxifxsmcsxbqmbcsnfqiuqbfnminnfqsbffcciufibbcifsqqificxssxqmcbiicnbqbfmscmnifunfcqxcqqsncmmqxcnfxucncsbsimbxncfufniffsuimxufsxcinbqqncsxcnsxmnibquxcnsfsxqiqxqubmunnxxbqcfxummnxuscfmmbsniqbfmiccxuicqsmuuibxqcnuifbmixffxnssmciunqnqsncsmnnnucxunsbciinqnmmmnxnbnqxfnmbbbbbfxisnnfmcsmumcucccminiqsiuqxxqibubbcqscisfsmxxficfuussqsbcfxmfucxcqqccscccmxsfbcciunnfcqqqxsbninbuiiqqfbbxbsfbfsnxmqbsbxunbifbqssisfncmxxmqsniiinbmcxbxxcccxbiqfniqssbniqubfsxbcbucmncxqqnmmsnqubxfcsuxqnqunuqifimuqnsfqfiiqcuqsbxfsmbfbiucxbqunfcsbbsbqcfsbbmcuxbfiqqxsniucbfufcnqmuinqmfiibbfncscixqunsqnbsxumxbqsuxiinxsuccxxqqubfxbqxsffxibnnibuubqfuuubnbqcnxssinunmfbmbubinnmcucxcbfbuicssbfquxubfmmmmcnifiqbqimuumssniqxifqiinbfssnquxfqbbqccmincbxxcqncbbucxnixccxqcmfsscuuiisiccmqmqxcnmucsssbxumcfquumuxcnfccncfbxinqmmnuscsscmqscufqncsscucxmqnbmcicifumiqifnbisxfquicummmisqbqbffuuccncuiuuucubfxnuuisfcumfccibuuqcsffqnssncnnxbfbqunnqbxxiqxmcmmcfcixcbqqcmmniicinunfxscmfssumqqqfisxcimnmcxnccfubxufsxuuqxnbcxfmffcsbnquqiqxbffbnfnqufisxnxmcmcmunnnixmqcsmibxbfununibiscnfusxbqcfsfiiimbibuiubmfqfissqcbxcimmxbfifxnxfmimfnqsqfbisfbcmumxffnqcfccfmqqsxibubunxibsnsmfsbcqqscicxbcnxinbbcicxsxfcbiissicxmsisfnxmxccbbufsnmmmcncsxsfqibqminxuxqxixibubnsfiqibiquubuuuuqcqumqmqusicqqqfisqfsffmqmsinnqucucbqumfiumxfqbqimxxifiuifcqnfufiixfqcicmxfqffimxmiqmsnsqbxmnbcxunsffmuiqfcciibcxxbibfbbmbubusbnfcqmncqsnqxfcnscumfcsqncuibqmxxnxnxxfqqbscusufmucxcqbqqssbsbbsqxmsifcucncsnqqfxuqcbminusqcqcuqmssfnimfcbxubunnsniinxqmuifbufiffqssqixmxnfqsbixcxcnciqmmsnqiiinmnfbbqscxqiximmscsxcimfiqqffxqqquqfbfbinnubuncnxunsmxcmxxisqibfuxnciqxbbuqxisqxfmmxmscbiibbqcficuxsibiuqxbinfsfcscqsxuinuibnufniixfiiuccqxxuffmunfnxffbuuifusmcnmscbfcbsfnnmcsbsbcubnbxxcxqxmxxmfxffxmsnsbiscnnbmfiumqmqnccmxbnffuqxfscxcfqcmnimmfxbbsqcxxxmcsbsunssqsucsnbfqcuqfbcqbfuibfmucqcsmunumisuqixcqmcqxxnsunqxqqmbsffbxuqqfnxnuxnmmscssssquficcfnmiqbquiquuusunsfmfbbqbfucnqsiuxxiubfncxsqnubucnusxxbsqciucnuusxsncuffmsbmqssxbfbxqqqbiufmqixcimsnbsmqmusscumcbcsnnbqucuuuqfimsbsbnufnqmxufumqbbnmnbssxqimnmbixifuxssbbcinmxfffqfsmmqnimiqxibnisisbmqimqcumsbxubxmqccuuuibxqufmmbbffsmcmcbmuuqsqfsnmqfbuuxsqsbqnubiqsmbinmffxxbfuqssqsxcumfiuccnsqibfucifqinxbimmbfqquxqxfnnunnqnxumuqqbccubiubsufnnfcmcucfxubmbsbxxxqffmincqqfuquqiuxqsbccinibufbnunxqsfucfifmiiicniufxsxffnxuxismxbqfuqsuuxxbscfnsqmfnnnfxnqmccsfmxnmififqcnnbsxnqccnscmmbxbimsxqufmsqmbbuxucbbuxiqnsfunmncufcumififquuqicmnfmcimqquqqfbiibbsquqsuxqxqscssiiscnxmnmxqsscmqismbfiuuxuqqfxmumcnqisnufbxnmmsfffqbqbcxcfmfnmsicscxqcnqmunmmbuxxcnquqfqbnbcsncxniqqffbfsfcqcquxnubqcnmisuuuxmffqnsnifbummnfxnxbnqbxmcubfnfxicqqfqnnfimncqsfxxxismfmxsmfxfiucsmxxibixxufbqqxqbmifqnscmmbmmmminsccmsisfqcbcnffsqquuqqqbcfbbnuqssqbmuuiuxqcmbicmcqcxufqsfqmubmicmsnnnfcmmxucbfqmqubinbxmisqqbmbmbbqncxcqcnqsmfbmsmunimcubbnsbxusnxfisifsccnnusiusinuxbfiqcxmquqfnnffiunxnusnmcxffmcsicninqfnfnbubnmnubfubmqxmbixxssnbbfxmfuqixuxccfmfbsqixfxiumcxbmxssnubqsuuqcciqxccmxicfnufsmfxbsfbmiubbsusuxxqmsbqmmimixnxbcqqcsbsfcxsbnbbubqiiuqbxbxscxcscqxssnciciuqcinmxmbmqfmsmnsqmbfsxmcfmfqfnqcbuuxmcxsxqiunssxumqbnscsbbmxbfqssiqqqqnbccnfbnubccsmniciuiuxsbsniuxnbnxbsxscfxnicimuiccbbmbxnxqnnmmicsxfcbnfxnnmcbmibxmiubfcffqnumfmmbbismucfsqbqssxxqqbxicnxmuuqubuibbfmxiccnbqsmimussxxnbfbissxbqqfxxfcbfcqffumuiufqbcfinxfsuqmnbcbsnibsiubcuusnfxffbuunbmmcqisbfnmqfmxfncmbcuqiqcmqiusqbxfusisciuunbssfuxbuunmfixqqcinxqcqqfxnuqsuqbfnffqbixfqmfcbmbinffiicsccfxxicqucuxnxsfcmxnqcimucibsbmfixqcqmnxfisibuuqxcucsfxccqcicxnbmbmfqsciqqcmixmqinxnqxmcfbqmmmcqxnmffbiqmimsccnqnbncxibcbfucbciumqiiiqsusqsmsubbiiunqxibfixccixxxcqncuucbuiunfnmsxqfbniqbqiqsnisncxmbfisxixmqfucqnnnficxummqfbuucxqxsfbissufqnqbxcnqbccfnbnuffiqssfmxicnfcsmifffmxbcifmqfunifxmicnquunimfmxcnmqimxxnuxicsibcsbsnbbqsbsscmqbnfmxxsuucxuqxmumbnnxcxmmssmsusxifbscixsucqqxnniffqnsxqxcmcmnsbffbqifcffnixinqcuusiscnscfmfcfquuxxmsbbqqiunxbqcbsnfxcqcuxsbbxffxsiuxcnnnmixubffnmcmnbsxqiufmufcssiccsqfimfiucuusxsqmsmxqmssxqmcssiumnscssiuciqcqbnuuffciufciicsfbuisnssumscfqxmufmqxcsbsmmnccqnqbssqfnmcixmsiqiscsscxnnuxuxqsxxnsbqqmxfbiniiqscmumfuunmxsfxfumbibsmsniisuisbbuiibciqcqinfcmcfssmmnsnqmibbumfmfnnqnqbxxiqiuxmxxmqmunnumuucfqimuxminqxssbmxxmmuccsnfummbxbibcsbfnqbnnsfiibqfncuicmmsifbnbumicbbfunmcsbnuxufsinfbcqfxfnqfcxsiuiccixcqbcsmfcqxsqcssncfxiqucxufxqbuxfxnbqqmubcxsmqbfbmisbifnqbnmbfcmciqifbubsiinxuxbsnqsufsiqxcucsmbusufbmmibfuqnifnqufxbixfnsixscqqmmnbqiibuibcnbbuquubfnucnufiqnfffxccunbmqxibbnfmbfqquqxmsmnbusfiubiscfsbubcnmqqcubqsiqqsinsfxumubimxcsisubqisfxnqcxxfcbmcufcufsnuxfcmsuxcfbxqqbbncxqscmfbcqfxcqmxbnufqbqsxmiumifmfbuqffbxcuscinufxsssmnsicbsxffncnfmuiubbmcxfmqxfxqmcbixbqbqnnnumixfqmsiuunsfffixxqsnqquqiinsqsibicqfnquniqicmbbifucinxbsnbbmixufuscnnnxcnicifmuxxfcqfubcmnifmmbusnbscmbmqsnqcqxsnbixxiimqnxxfffqcmxqsusfxbqsmxmuqscqbssufxsbucmsuniibixxfucfiqnqfbbxqxmxsxibqmuqxbmciinquqmbuisnqsbxmsiqniinsssimsfxsqsncfmiuuximbffufcqqnmcxxffccbucqfqcxbixqnmnbxsmfmcnbcnbmimimxcbcbmmfqbxqcbuuunnificsqmsfcfsfbnqqifqxmfbqfqnfunffqifmnunxfqccxmqbibiqscffqmbuuuimisqbiiqcmnmxbifcqsqfcqixxnunisqmsqmcxmbmqxqmsqncqnsqmxqucqcucxunmxcxsmuxcbcnnninuqsmmbxsbnuxmbcqsmxuqsiucsbficfxbfmbibibmqqisqmmnimbfnxbmsmuscimsnqcxfxumxfuxubcuccxinmxmfbmbsssinibnusubnxqumqbqixfufnncucmqqsuqsxxinibinfmunniqnmsuucqnuqqxfxnuibmumiffmqcmffmusfmcsibnsfcbccxscnbqsucxbixfsumxffmxfunccnnqbxxxmffiqnfqsxbcfxfbnnbxuiuiuqmfqbxnsqficximqcnmfnqcmxffcxiuixmmcicsmnmunumccscicinqimcqsbnxsfsqnmscunsmxfbqiqxqimsuxxbxxnqunfiquqfuifqqxmuqfcmmbmfuqnnubbfxubsxqnnccqxffqqbbusbfsmmsfmffcnssqnfnxcqfxunnnbnnnxuxfsbcmxncxxxccqibbmfqumqfcsqssmbquxcsbisfxqnmxifcffqcisxinfmumiixncqusinqxcmsqubqibbusqmfuxnxiuniscxxsiussbquisqfqqqcfbsbcmxqcsbsxxfcfbbiufcxciqucxmuqiimxuiuniunsmbusuxsibmscbxbbfiuinnbiqnmuiixbnqbcssbbbuicbqufcfminnixqbunximnbmmqnufifixxnqibmnufbufqsnmncxxuuuifmbixfisisquqqxxsnsnnnqfmmmuxncsmmsmsiibmfnnsqxbucmbqbsiqcmcxiqmiqmunumcccnnbfmbqnisnxbbumsfnnxxxmfnuxcufuiqcuiusqxiicmbuuufnbmmmnicmsmcnfcfbncnxmmsqfqnnicbnnffsiixsxinsfcbicqxfnqiqmnnucxcmiuuxfxqbsussmmccccnfqcuifsccnixiiffunmfunqcxqnunqbximcxinqxmqiubufqbxqxxibxbbufcsmbuxqqfxsfmmiccbcnqiqmsmfbqnbfbxnusxccxmmuuxqqnqbmnsmnicfnsuisfsxxsnmfqsmxfqnqqmsnxnuxqqxbqfsicubbfffbmsqcqmmuibbumisnummsfcqxuqfuqqsubufmqqifcnqbcmbixusimnmxfxsqnxxmfubucnxmfqmunnixnbbsqccimmbfsmqsffcmbmqnfibubmuufbqiusuuqinfqqfiqxcuquscicbbbffcmffqmqnsuicqnxsqnibnxccncfnxmfmucibqcxbqbnfibiqfummbcmsbmfxsximnqfnnqmqqnxubqnciussnnsqnuiiqiufcbcsmciqsqiqnsxxninimnbicfxqqfqcnicqfqqfxiqsnifxsiuscqqsncuuninbxfxscbbxxcnuuuicssqniiufuicxnxqiciinibmiumbimbqsfibfxqfqmbfmxfsbmbccnfsmfmxuunccbqnxqnbqissbfqsbsububccqcinsxucbixxmfnxnqsniqmuumqfxbsqnicbxbnixsqqcxxmxxmccciqfcuxsnfisfmuccnifmcxibsxuxmimbncuxqsbfxbnbnxcmqnmqqiqcnqscbqqcuicicfsucqsumsunmfmmffbcnbmxuuscxbqxmbqqcucfiqnxcifmumcqbfqiissxissiifsxiqmfxxfccqqnuuibcbufbfnsbfmbbqsqcqiisxsnbnqsximcxsbbsmqifxunbinfsmfbcffbxsnqfcxnqsbsbumubsuuuxnimsmxfmumfsuusfmmmusibciisxqsqbcmsqxbcqunqcqnfiuxmxqfbuqbisfciqbiuqxuffqbcnssusqbqscuufmcufcxcnxfciqqinsucbxcxqbbcmmuuxssniqiqxmfnnqqbuxfbxccxuqubbbbsqsxnfincsuqxsccuxbbbbcubqiuscscmxcsbnxbinnuisfxumfbnxbqqncuqnsmiqfiuubiuunubuxfbqcbmsqsibcfbmbsuumfuffmbfscunminmcicmcnbqmsunbfuusbcbqsqsbqxmucxfsbxxsfxbsfbfibbummsqxsxxunfxmimfcsfimmixsfunqufsmxuxsssmiuubbsfbuimcfqnccxqibqbxsfxiuxbfnbubnnncbmcufqxqfciniuxmiqnfcnbmmuuusnnfiqiiusncunmcsbiucuubsqxfqqqsbmimssfxixqcnxmcsibsmsmifxxnbubxxcxibicbubqqqqcmnfucbiqxffcsmcsqnbsnbmfqicsusuxcmqinxmnxmcnqbmfxnsmxucmbqxsqniibxicxbiixxnibncsqxcscbmnxsnqxncniqxscicmxciucummfcsmusnnxxnmncmmxcibmxucfqnnnxmbmsimisnbqcimqsfxisnqssqnxixbsqbmqmusffnqcciqixmqnnqxucqmuxunnmbbmnusisxicqusnuqxfiifunqbubccfuinuqxbxibuqinmmxsnmnqmnunmmbbnsqsxsubfixmxmbfxiibncuciicqiusnsuiqufibcxnncmsmqbmixuqsiifcifcicnsssbnsfnccfimfxcmbsmfmsbsbubmnmmuccssiifnuusuqnnuifnsqcsiqcifscbnuxnquuuqqimumcxfiqnqcqisqsfbsbqnfssxufbnmcnbfixisiffninsbmxxmxuqfscfsfiqbmuxifsfqiquffbnbfxsncnfnnfcffbbmsfumcbnqficxnuqsqmmuiqsxbxfxcqfnmfnnbimnubxqimnfsbssnnnfxfffffbbmubxsmfuuxfqimqccnsifqbiuxubncmiibussscifmcusfxufsqcqccccqbmfimiiicxuicxifcfcscfiuxsscfuiucunuifmqscfibmquuffuicssfxfixfsmnuxcfbfiucsxqqsbfiniinuqnmuscnciqiiqsxibmbsnixmqfmmismmuscsqisuinqibsnmqcimumibcficfbbmcimsxsqqmncbquusubqicsqffcmxqxxnsxicucqicccumbiiqsfqbcnqsmscibqiscxbnmucqmmcfnumqxbbxcfqbsninifbqfnxbnxfbnqxnnibnbuqncqimfcxfxxcnisiubifqnbquuxcbubmnsfcufbbxixcqbncbfibqmnuxxcisiuucfmqmmqubscbxcquscxumxuuqusmfxscimfqcqnmxnbfbsnmnxsbmbnbubuxqfbcmxuxxbfnnfubqiumuxbicxqqicfqqxnunsccbxibsxxxbixmimcmfxnnnncqqfxuqbbnscsmxqqcuccqfuuxnsxuqussqmsixbssnfsqmscusffnfsnfciccfufniucisfxbbmniucxxinsussnmcfnccnmmxfcnibsiqsxixunxqmssiuxfxfcfffbuxuicsxsmqxmuucsbunmfuqcunibqmnbnuqbfcfsncsbnuxsmxxbmubsxqicxcbuuxxisbibcfumcbummnimunuqsbmbxxmnxnqmfsbuiqunmsqxcisifuusfmmqbcuunixfcffcsqnfqbmbnxnxmnxfqibcssfnmmicfsxsxcmfqbcsmqqfxxuniufcbfxnbuccqnqffinqnsnsibximfcsxumcbxmisncqbnqqfcxisfbbncmiibbxnbnqnbxbibnbssffcnnnuxbifnibicussubmicqsfquccnsbincbxmxnqqsmucfuisicciciinqqfqfxmfciuuinfmxqququbqccunsmmixxcxffuiubqubqnmixbnmcciubinicqxinqfscmmxqmfinsmufiusmbmmmmisfxbmubsnfqimmfincfbbbcqqmcqxuxxfmsmquinxxsnxfbsumcnxqficiicnffqxcfnmifxnsbscqxubfsmucsnnxsmbmfnuxmmmsfsbcicbxunfmbsfsiqbxcbscuixxxunfqinnfuninnccbsxbbmfmmqqmbmfmqxnsiuqubqsmfxncfcscuxbqqiiciumcsifumixxmcxmmnfbxnicmuxxxusqcmfusnqbcmmfuqfxbicccxuusxmqsxsbumuiuxsscsuxfqssbniuqsuqusbbmxcqqsnqmfxcnnuxnnsnuubmsqifucmxqsuuifsmsicusxnmcnfcscubsifcuinxqsqxscqmsqsbsciqfxqqcuumfufiscnfbicisqbubxbxumfnfqfncbcqmbnqissuuqcbnfcnixxfqussicufuiixuicxnfnncumxxuixusmnncbqicicxcffnsssnccsmifimfnbqiiisqfxscmnxinnnuumnqbcxsqcifinnsbqqfqmcbsncuiufbfqfqxummbcucuxnbbuqxbuqfmiqbqmxisqiqmqqbfcqiuibiuxqsbfxqucucqbsffiufcfmmssfccimbucqinffuusnxqbbcqccqnfmqmusmiisnibsfiunbmbqqmffmmqsmxqisinfxbxfcbxummuxifnffxcffxisxisxmnbfxbbcsnbxsusiqnxxfuncqmcxbbfusmcncmcinmimmimsxmbsmcqibqbxxmsubmcbfbfmnnccuxsiqiqnmbbfssmfcnqibuciubummciscncbfqubiuxnmnunnfuxcxcncscnnccxcxifmfmfmficincfcfmnnffqfuisqqbusbsnbxscxunquucqiuuxfiqfccnqnbiubcisbxqbcuqucqfxnxmiqusuxsbxnibcuuubnbisfcfuxminffifnsqccxnmmmcfximumbmimucniqxsiqqsqimmxsfqsxmsbinqicuiqnmsnubumcnfncxnxssxxcfsufinibsxcmbqfnqffmqqcxxfuibsmumxsbqcmuxcmqxsffbiqsfxxbqicbumfmmxnsqfucbfnfinsxsufuqcsqfnmnqusixnicuiqsuxmbxbsbiqmqmsxxcnnmmsnxmxubqbccsmsqnffqqnxbuuqqmccusquunfucibxnqssnmmumxccfnfqqsbquxxqiuinuqufmxscqccfuibbquxcuubqifsmbsmubxfussxnxbnqfubqxnicfuxibbmcfifuqqmcuxifmcqmsmiibcuuqmnifnfxfimcbsxinccmmcnnqmxicffbqfufsnnquiqiqsninifimccfccxssqmmiuuxbxsnuqfsxnfcimummiqxbcunmuubmimcssfnusxuccfxniqmmibcmbqqqcfsibbqxsxuifiuxqxbcbcxxmfnmibufnxbnsbmmmfffnqsbxnsfissbfnxqsunsbfcfxcqbxmqxqqqxfimbmbmnqnsbbqxxsnqqfbbcqicxqcqnnqcqbffucbxiqcffxcfmuiinuxxsuncnsqscfxxmnxqqbquqmmssbcfbcmbibisxmximicufqisnisqxfbcminnxnqxxissumusunmiummufsuqcquuffcmubnfcqmmsxncubnffimbqbqiisiqfcsququqmisffnnqcismnibcunbsnucccqnmniiqxbbsnbsxsmufxfxxffubsmfuxnqbxqsmcixcxscfbfqqxncqmufbmubciiibxiqfucbbiqxucfqcfxbucmnccinsxcqfmumcmcqbnbunmbncmucxfumsfxnssxfsnfxfqiqssqbcmfiqnbxmnuscisssmsiuqbxxffnfifncuiunbfussnnnsiciiqcuiqmunqiffmcffxixumunqmqmxiimuncnbisuncqccufqunmiixqquxbmiqubbfbsfnquminxnibscqqxxfxqmbbnqiccsfxcfmuqfqqsbqmcmnqimssucqinfmmscsfibmnfxqfqqnibsnmcbuuicfcqscuqbniqssbinqqqqnsqmiubcmxmmuqbuiibfsusmnubxbqsbsmumusssqcncqxfbnxbsqbqnxbnxnfbixifmfffnbbfxxsbscnqfqqibcsmbcuumnmmmcnbmqbnbfuiccbxscqnicuufusnnqbsuqfxfimcuiufmqummsxnsbiuqfubbqfmucuxnfnxmbiifiinmqniiicqcxcxsxfiscmcfscxsuiqcfcbmumnimxqmsiqsnfqfnffqbbmiqbxmiummqfqfqxxuxcfsbcqmnbbsmcqbfsixcbismxmqicxqxsmffiuciinisnccqfibcmsibsbinnxbmxfmfqmcqbcnfuixsccmxbqqcinsubmcfumxbubsfiffubmqfxuqibbffcqqqcbqcqiunximcquumuufxiibqsxxnsqmifsisnfcqnfbsqusiiummimbnbmxmuuuqbnqmisxnnisfxbqqsmcmxxcqnccmscfibbxbqbxuqxmffbqmqxfuqubbcsxumicbqmsqqucsffsqqcixcnumsuxnmssfubsuuccufuscsusmmfxinqffmmsnqimimcbumuccqmmcqqinnnxxfmnscmqxfixcmfbbxuqcnmfsccnmbiqfbnifxsbmiubqffciusnbbixmsxsnqmmuqsfsxfffsuqiufxqinfmxmissubmimxciiificniucniifcuiisiuifqiixfsfbuscsmsmsbqixnuucqnbiiquqciimuinxnbcufmsmusumcxiqinqqcsfmnfniqumxismsuxsniibmscmbiscqxcmufmfsqmiicssqbuiincucibiccsmsufqxbqsbbsqxnufcxqcncxfmquumnuuifmbqsnnusuinxmfcfnbbqscnixmbmxsuxxsncuunmsxqbfqxcsixiqmqqxsbbbxcsfffbucnqcssxnqcbnusiiimxbcfxucmbnsqibfmsxifqsbcmbsusmbmixuuqfcbqcfsfxnssxmixqfbmfcxqbfqnqmmfubibnbxqnnnxiuxixixunmqqicssissfqnifibmqfimcucnicfffmfibxnibifuubmmfnmmbcsmbxfncmxxibcsusuuqimxmxnbisqxuususquisqcxbuicuuqinxcxfmsiqbcfmuqbusiummbxnnfsiscxuqcsxxibscbniqscxisxmcunffsxmsbsfbxxucccnnxsumfqcxqqxsssmufmnisincxisiixcmmnnffsuiuixucuusmiqqnniimnxcmsnmucsixmficsbcunfunuufxcmusmunicsfficcxbnfmnqxcbfccbfqxmfbqnqxbccqbmccxfssccfufnxfuiuficcqxubqinfxmsxmumqfqxcfsxufucqbnuqfxmcniqcscumxbuixmqsfsxcfxxxxbfcsmnqqsifuuxqxicunuiqsniuqqbfmscbccsnfnfqusfccmxbffucnsxmuicsxinmmxubbxuqimuifbsbcxcmfumbsnsunbifnibnqqqunbbufqumicnqisxqbqsbqmfqimsiqcmfcfsqxicusbnusbuucfumqfcbsxfsuufqiunffqssqxcmfiinmiumfqmciccncsicuquqnbibsixffmnqqxfmiciuxmcubciminxsisuxcsfcfuxxbbbxuqbsifqucqqnbfufnbuqqnsbnbcbfnbffxbsfbqicnmcxsbxnnxxqnfxnumqnqncuummibnqxicxsqmqnbfsucsffnbbifmnxibbbcnusmisuqmcmmqnimifinnufnimisnbqbuucqccqfqiffcqnnbqsquqcmqqscinssxbsxxxsfqiuqsuqqimqumxxqbbsuumsmqumnqbibiisfxxnnsmbcimbbuccqssfqsunqusfcqmqxxuiibcqnxsusfxbnnmqqsxfqcqnfmnqqunusmncnxfbucmsqxnimiumqcuqxnqmninbcfsiimqcsixfcnimqiifiuqmcissbfcbbimmumncnbsmscxcifxbxmmmusicusimqxsnqcqfniuiicnbnsubfbfubcmfbncciqncsufcssbnnmiffubmcmqfubbcucffnmcqbbnxxbbxxsbfqicnnxcqixnfixfcmxfbmnciifcmxqiusbnqmumiiuibssfubnfqmciqqsnsfnqnsbbnqxsuqcfqffsqubinmcqcssqincmqxbccfbsbixxfsuubfnmxqubcfqbcisiumqbicnqisbbunxquqnbqqqiquniuuxnmfnccnibibuqiqnmqnqncixbcumnbbqcicfsnbccxmiqsfbxsqfxcbfbmunmufsqsfsxsnicxmiuccqnmibibxunxbxcbfcmnsbxfququimmqsfqxixsbxqcibsiucxcxcsfsuscfssbxfcsqunqbunnxcnfcfqifxcmqqufbfmssximufbscbfbcqixunfmmiixqqxqxxqqnbfqifcmscumxcubcqbqxissqqfsqxucfnxqunsxbicnqcincnqquqmqqnunbqusbxfffbbiimnsncusbiuuunufbuufuqmssnfmsxbcnnxbuxmifnnqqqsuunibqbnnqimxnufsfmfunxsnbufiucxucqsinxxsxcbcfissmmqnncxncuxquxmufqmbfifbsmfbbxxmmcfqiqnfqnxsqmfsnucniqqqcinqncbnnxbbxibcbumqxufmcbqiqsnsibfinnxmxxfibnbbusmbmsqiimuqmiscxnxnixniffcifmxnxxnbncnsnicbcmsbqiunqbuiinqxxbsxxxxbsbsmxucicfxfxiunfxmfcqsbuquiiiqiucmmcsfxmuffbisucfuquxfbqqusncsnbsuifbfffinbxmqxmmfnbmbiscmxinbqsfcnifxscnmnfubmusxcmmqfcsfuquxxcmiqfmmfqfxxfnbincbmsqqbibmiissimmxcqfiucxxsqqsnsbinsmqxbbxfqncsifxmmfsninnfcfqssqusmncsfnmqqbxsfsxxfnxscmxnscbscnbuifqniccixquixufcfnxbxbiiqixsbbbqcsnqxiuscbqciiixqicucucixmiscnqmfbbbfsfismnusqmcxbissxfsqfnbbbbqucmnqmbmqnsncbffffbufcxqunfssqscbnuqnfufimmumibqxniisqscfqmssmuunsbbqxcxfxfssffnsxmsnxuqqcxuimsxnxfsuisqxqmifmmcsqbmmsmsmqbuxxfmfbixnubufnbnxfmmiummfsunxqxbcxumcqqiuuciqcmxmssminfmuuqbqmxumbmfccnqsqinqcnmumubiquibcxqxbxiscfbbcfuqqfnbqfmmqcfqbmmcnqcqqnubnqbfmmnmnubmfcxficqsnxcmuccsncxxcicumuuucumnxcmccsxqxqbcfubxuqfismmxqqqmqsxfqbucixbbnqcmunsnicqxiiixqqcummcinbxmiicmfsxixnbmqucxxmmmbxsxcifiixcsqsiuqsixismqmcnnmqusxmnqnqmbixmisbxbcncxbqcibsfqiqncmnbicssfifunbcmuuxbcifmfbqffbfbqcnbmixumsciisbsxqmxmsnuncminiuqfxbxfununifuinqnfsqbcmqqcisfcccfuiqmfcinmusicicbcisxmucciqsmbnfxinfubuibnxxmmsscxsimcqsqcnbnfsiqsxssximimbcqcsbqsxuqisxxnisnuquqfsixcbifxuimmubxxqbfqcxnfuxcnfqicbfnmbqqimbmmqcxxnuubccixfminxbsinimxbcfiuuusnqssmfsxnbnqqbfmsqimbimnqcqnucicxscfsxuncqsxsqncumbuqfsfnsuicmbfbnfixisfunsubuqxunffxuqbucnmsunbmunmiibnxnfqmsnqqcxixqmucbfxnfscufqqnmxfqbxmffifbsusfsnnfuxmfbbmnicqixsucbsincqbufiqbnncsiqqnmfixiqqmxcmsbqcxufbcfiisfifiumicqqmqufminiqnbqfcfxcmcxxqsmuiuuscncmcxfmqcufiiuxifcqnqnunxqxnbqximfufubicmnxcqmbiquxnuiqmqscqibmmnsffscmcnfsmsxuufibqxmqmqucxuxixnqifinsiqnqsmcqcibmmccimqqxfqbmfmsqbcbxxnuqbmbfuiqbfubnucxiicxccmsibcicnqmssifucibmcfcmifxqqfmqcucqcfsnbfmscisnnmuumxncmqniusqmbcixfixcsqbcifxqsimsnnxcnmcbfmuqcmcscmcnbusnnfxsxxxfqicumiqxbubbicqsbscmiiuuxssbunsisfifsniixqnuxfisbqncsqmsmqusqqnucmubcqqxbfxxuxumcfqbfiufxixisqubiimsixccsmquccfqcbxqibxnqnunqicbibissnnsqnixqncsqbuqxfiuisibbfsqxuiqbfxmmqciqnxnbnbbbnimcxufncimmsuiqxiixxqbbnnmccsqfinqncbnnnqcinuisuimxiuuquuquqnffqumimbmscfnunfmcnmnqqbqbnbmuqsisquscmixmsxsfbiubnccbmnnsbnfxcbufxxuubcsnnuqsfsmuxusnqcqibimsiisbfnnnsqniqxixifxuxsxuxbxbmmnsnqnfsubfqsnncxcbqnsuxcbsqiumsqfssxxxnufcmfxmqsnmmifnbibxbnnnmunfuuiibqxnffmfssuisqsiscxquiscqmxcfqcbbbxiisnmcsquiqsfucbucqsiifbunuiissbsnsmqcqscsfbscqmxixsxunfcnqqicxunbfcqxbbmuqfiixicnxxfsbcnmcxumbnfnqninnfbqnmxibcqcubifixubnfmiqucmcfqbsxfimxiscxxisnuqbunqubbminbqqfsbbsqqnixciufumbcmqxnbfucfincmisfnmxxxmmcuicucxqxumqcnifnqcsxfinqsfsssuqbxncxqinqcumqcibfbciiqnbqququnuxiqnnnsxxbnicxbcbiqqnsqscqmsscibsbnqqqncucunninxsuuffinxbbfbusibfusxumniuxmbcuinbqisuumnqssisnmnccnmunnfsqcnmbxbsmbiixbmfmcfncsixsccffmsfnxssqxnnfxbcbxiucmbiibiquxiqcfbsmxxfbsfnmcqfcxxqxiqcisfqqqniiicqunscccqnccffnnfcqmbcqxxbncnfuusqfsnmufcnqxuqinfmbbbmiiicuuniuuiuqfsfsxcinxsmsuqnfbbsqccxcsmqinsbmifffuqbqmcccsbqsbxbixubixcusicmiqsfmuqsfufmfucqxmmxiuqnmxmqbbqnsbfnfucmmiminsnsbcunniccbisfibxuusinquumbnxqqxbifqcnsufunbxqfnbsmxsuqfibmqciqmqbnssxuiqmsusxqmsnxqxfiquunfxciqiusunxucimqscfqssbcmixxcqbmqicssisiqsfinicifxcmfnbnxqnqmffimibxsifinbqscinumfiumixnufsfxuifsqfufscsqifqccucssufbmsqiccsncumnxcfnmxbbqnmuuscnmmcqubibqnsqicqqumcucximsmfxiinsnmqbcifufmsufiumqxmubnuccbqumbcbiinxmqnuscqcfnfiucubcniqqbqsnqmmisnmfncmnufxccxibfsqqmcqmnnnnmixcfcxxcqnuucuncfxuusqmcnnncmsscmfxxixximsmiqcixxnqisnmqxsxbniixifuscqxixmcnsucmuqixbcsciimxssnmucsbcqbciumunbicbnmqubsimssxmmfsusmuuqufqncfxsfbcbcxnffuxunfficnuncuixnissbsccsuusiubnsfbnbmmmmuffxcbcqufsfmsbmmubcqfsucqquqxcsunmcffqufbsfimqbbqmifcxmixnmimxxbnnxqufmsuimnccimxmsbxsimnxfnimqnfuxmqsisufumqusmbbsucmsnsxsbbcinqubnfiqqqccuccbibcfcmnfmbsfsnxsqxmxxbcmbsqfbcuufibxcbummuxxqcficcxqcxcxxsbsxfmincsfbsnxuimbqsuussmixqcmuuxsfuuqiiumfmsqfxifqxqsmcqsinfcnfiuccqinfxqxqmcqmqiqcnsuxsxbismuciuuinucmcmxxxixqxsmqnmmmxxisbfuxqbxfuqnnsqxcixquqmsnmqciccfsxqbixxiicfimmmxcsscqqumbfbiqbfxcsuuifqniummmbcfmqsbqbccfxxuqfscucffqcscfscxscfcuicunsqqxnxxbbqxfnssxfmfqsquxbnuxsuibxiuxfbsuqcscqbfqqxbfsmqisisqbsixbifmcsfmbincuisnficbxfbuisfqfibfscmfsqmfccfuifnxfcnxfnuqbifibquusiucuquiuismqbqfcsffssunqsfxubnqusimbqxmcnffbfqfiiuiqxuqxiixxfubbmniuucnmqmfcuncqffuxsnxsqxbbqsbbbxmiubnfmicsqxxicfmmifxqnbqxsinqmffincbmfnnixfunbfcbqnnxmisbncmnxbuumcuusiuqfncsfnbqnsimmufifcsqucfnsbibxbmcsqbicmufmcxbsmbnbnxsmccnmfciqfsiqnqixsqxfxuunsxcxmbbuunubmubiixnuxfinscsbncbfqibxxfmibmqbnxicbxfmcubunufmibufmqqnfmqnixumsqqmbcbbxunuuubuuimiqmixnsfqmnxmubumibmiucmcxisfxicfsiqmxifnbsxixxmunmfsmnbixixnmsmibsnnqfnuiimsnxfcfsfmxmxubscfbcncsinqmcsbsxnuucuxussxfmimsxniuxsfimcixxbfncsumbsqnubifssuqmqcmfsucqxfxnmfmmmxucbncfxfsibbmnmfmxiscnsumfnmbimismcxxqbmnciuiuibumixxbmbxxnsnqmnscubbqqqfxsisisqisiqummncnixfccqqfmufnusbfiunxbcfifnmxcxufmmxisqxfusmuficnunbimfnxxfncnumsqbnsbxnmmxuiiqbffbcnfxicfmcsqnuqcxiiimqfuufqsxxcqumxqfsibcbmfubnmismmxmnxunxusqcubcqbssbfcuquqcxnxxqmiqsbfussumffqmbccxmqfumbxbsnnqxbnxbcxicnfbmccuifxiuuqumsxiccmisqxnunnmcnxqiuxqixsbsiicummqissfbmxmcmqqbfcscsbqbsbxbcbmxnuufnmcbsuicqcuxnbsbsqxmxfbmbixmmixxqxsbbxsnqcffsuucqicfciqmfxunfbcqnxcqsbmixfbxqunumifxnfbnxbcmcnqmqisbmiqmcqxqscimnnuxxmfnnfcuxsfnsxccbnbqqqfqbxumiixbbmubsicbmscnxnuqmssxxxcminbmuxnnnubcxiqmfiqcfciiuiimxicusnxfiunmmuncbfquismfcbmxbnbffbmicnsnqccubffubinibnxuisxfnbxqfxffcbmcnbxumnibcbfuxqsscxcqffiqunbscxcbxiummfxbcficcxxubufmsmffsmcffqffssimmisnqnxbnxsqifbiqifqcbisxcicxnfxbiinfcifxbubsuifqfbsmubxunssfnmbxmxfmqcucfsnmbxiqqsuciiibxnsmfmcmuixubcuqbbfmnffffcisnnxinixnbufxcuinssbbfibqmxsfiunmqufcxquscbunxcqmfmcunicixxcsinnbcbnsmusffunqbubxnnuinumxufifqcffsimbcxmqfsxbsbqfmqimbfnmufncimcibnsqfuimqbunmqqcuqumfnfiifnmnbnmquqcibuunnuxnfsxqfqmicfuciummqubqimcsibmuxcbnqmxfbmisqubqccuussbcmufxifsqfqxcnsciffxcimmbbfmmibnnixfnbcqnbubnnffqxbqcxfqxiqbbfbnqxiubqsiucsqubqsinxnmmsfbqsnxniuscmubxbxnnsnmmffuqmunumxmbcmmiisisibifcqqqsiiimxcfxqubsmnmbcimqnfsuiqxfqmcsficucssqmxfxiibfqmqfbmmqfmuqnfumfmicqcsummcufsusuuqximccxsuuiqscnbifuxsfmmfubsiucqxbmsmiuimmqucqmmuxcbiffbnmxbmsfmissinmmnbmxxcssmmunnfqxqqsniiuumfmsfsufbcummxxqmcqmqsnfsfsuqubnsxuxxisffsciimmqsxuxsffqfxuusfbxuxfcniuismfixfxquuqumiinnnsnnuumxuqsficxbxuimisfxmffbimxqfnbmuiqqmnbmuibqsnnuncnnfinbbbcmqquuqsiqquxmiqscuxunqfubmuiubunnsmxnxbsncsbxbuxnbnusmnxuxxfnnmqimninmcnxiuxsqxqqscsubcqicqmmimibfcxuxcqfucxfxnfbxumsubxiqucibnbmxfcsqsbbssnnifnxfxfqfbcmucmqsmcsciqqfscxxsnsnnnccmucifsnsmnxmnsqifiuxnbffisfmmqxuiqxbbsqcmximfbcsnfqbsumuqqfbbsqcbucicbncbxnbqfxusnbfqcxqfsbnnfbxuqicffsixiibbncisimfnssxcfumisfnmisisccqqiqqqccmncxxfncxnxcqmcmniufnuixfmixqbbsxixnbnbibqifmbnqucxncqmmxnfqiixcnqcxqsmuiuxcnxcibmxfxfqbccncfbqqunmuxcncxfsbmqxqixufqbqcfnmmqcuxsqfcccmmmbifusfsqmuscfbimfumnbfusnbxxbuxsmqbinifqmucusnmqmubnubfxcccufsnmicfmnufmuinmxxfuxqmxbuufsuufnnismffssmmxqqmnbbfiqqccqcfnnffsxsnxcccfniqqbiximmfibnnmsifibmibbqcncnbuscmubqsfiifucifbimnffibifufxcsnumccxcniqxiimsbfnumnfxnisfncccsqfifumbxbcicqcsqnnsxfbbficqqbbcbubffnnunbbqxxiuinbixbmunsxqqxssqmxmsbbxiucmbxnfsnubnxnxxnnsccmunfmubbfsufbimnsxssbmcimiqnbmnqnsbmnfmfunbmmbcqmmifufbniqbfnisxcfbsubqufinnqnbiusmbinisumqbbccicfxfqufnnbqbusfnnibcqnubqsmicffscxxsmsusxnqcncumnxcnnfxccuinsqnbcxxubufmmqmmssuxbsiufnxbbnfmcuusubfmnxnxxxxbmcqmuxbufcqsfqcbiccxxfmucnqnnfqufbmxbbbbsbnmqqbfxbiqmicmqnsfnqbqscsxbnbqcunqcqbmmscbnmbbnxbmqmnsxmbisfbibqcfqqqisfxmnsqsxsubnimcisscscinucfffmfmbxxscnimbsusnxsqsqnumnqfcixiicuiiiqicmcibqqxubfmmfiiqncqqmmmiucmnncuibifqcqmsnfibmsbccusicbnxicbmxmcfbubxmicubmnxcisssisnsfqxfffnxxqixbbcqunxuusmsiqnqncsqffuqufxmnquqcmqfsqxfnnfmuqnssicmbnxbcfcxcbxsbqibnqxbncqccbqmnmxuxifbsmfmcfxufcsqubsmqfuffquxuqsnuqicnicbiuinfqciuxubbnqmuninxnminfinbfxxbccsxxfcfffnxfmbnsxnqxcubsbbmbbcnbniqfcfiunqcsxuxfbncqnxxbxcssumfsbnbbibqmmuisffqxfcuqqixcinfnfbnmimnbucfiqxxniiuiufbmmfcxsuxnxixuufcqsnqxucnisuscfmmuumqiqqnisbxbiisuqscnccuqbsqsnuxnmumiiqiufisfcsqxixicucxbuqxcncscnnncxxxssmcqsumbiqixmmmncqixbnbqcnunquxqnbfismuniunusqufsxmqqbncxbimfuucfqxniqquxcisfmsfummiiumsqisnmfsxbbbqufmuisqmxsnucmsqnsmnxsxuqsufuiifxxcbfqnsbqfimqxunsscxucmscncmsxxuiuqxuqnmuuuisfxsbccsmcumcxsnfxxxqnuqbxxbfcqsmiiqcqicfbmssqsmnncsbfnnbnimuucsbqsmcfqqnuqqscfssnuiiffxincncxqnsfqxmixsuxcmqsnmxmqsnbnxxsuxbqnfnnnnbubbbxincinuiqncxqqcuqnqxmminiufqnmiufmqquumxuufsubqbmmnmqmcicnbinminfbussufcxfixcmuinismquiqfqfcxbbxbsbcsbbbxiqmfmnnmsisxfqcifqfsfbmbxicufccqcsnnufxfiufxufmffxxnqxinsqsbnmqunnufxbcfixfuxqcnqcsxxxsbxuuuqcixcxmbbimncxbufmsbcfumqqqcmnmmcmxnbiqfsxfqqqxsnnnmnqfixifunicxuqxuxcbmmxbmxxbisniubcubiqqmusffbccnfummfuiiqqnnqfiffsuqcbxxicbnxubcncqnfbuuunscmnbxnicfsfiibqsbxumbcmxuqcmxsncsnsmbniqbxmsuusiuqcnfcsqxbcufinxmicxisbiucfcfffcmmiibcxcqxqmfinccmssbimufmqnnmiqqiuucscnmqmiqbfmmxxfxscbxxsuunscubfqsfcqbciqqmubmqnqibiubbunsbxsxssffbsqbfqxfnsisnqbniumxfbuncnnmxcbsfqiquubnmmciscxxbmbxuisxbxfcxcucnsxnfixmuuqicbnubussmxcnfsbucmxqmfmuqbxsxuqusfmunqmcqxxccmmqnqmbficnussxcbuxnisxinccfnnqscmcfcsqfiqixqnuiqfqmimxbibqxfxfbifcxucxscifxumqbuxinqmqbmmqqsfnuqnbuqbnixnqxmiucnbfqbbuibuxiqxnsbmmscffmxnumqusifnbfnumfsbnnsqqufxxfnfixbcxufnxicqbxufuccfmibcuiumffxnicxbixxqbbmbuscssfcxfubnbcxmufxfffucmmufmmqcicqmcbnufxbiuiquisuxqfimcuxmnmqncfqsbqbiunbsiisbicxqmqcincfmnqbqqcuqmfumiuxifsfsxbbccmsquimciusucnmxninqcxumnsusxnccccsqfsmqcsncsxiiicxnmbnibmqffbnxqbsmufusiqfmcuuinfbmuqmbqnqsnbxixnmbsqxqbncxsfcmsufmsnqcmqmxmqnsfmnssnxisfnssfmmsiqsssxsbquqiuxqffqibuqxfqxsxmncmxqxcfiiqmcqcqusmbnqsuicxbnsbbsfxcxfsmqcffbuisnqbbnbnnnbcbnnxcixmniqqibxnqmiscuqbuisusufxucbbfncucusnqnfbicccfcsciiiuxmcccfqqxfxbfqsmsbsunimbuxxubncbuumuuxixsmxmnsscxnuxuxubicmxiqncnxxmxmsnbxcmunubuinxunxbnsqqmxmbsxximcqsqufuuimmfncnxfciixcmqbbfsbmmqsbqbqiccniqxsxsisnmxbmqcxxbfqmqbnfisbuqsmfbnsibcqnmffcmiiunuxcxmimmcuxcuubsuiicissuxsmufifnxicxufsxqbcsqsiuxbufqiqcqsfcfsufbxumnbbfbuunxisiuxnisncisqmucxmcbxxbfcsmcnssffxufxumfcqusmusfuusiibnsqffimsixffmsqibsnssiunfbnbfcubbxuuqxnnxfmqxxbsbmncqcsiqxmxccxxxbqcbccuquqcxfbsxufsmxibuxsmmfucbfqsismcnfsqfmmsimxxmibsucccnqifufumbuuxfmcxuxniumnxbfxibmscxncqqnqmccnmqcqcifmuncubmsnxsusfibsiqxxscbnfcqmcuccifbqnxifimxcbsqnbuubmuxfqnunnniqfmimuqfuciuqsnncicninfnxqmqisxfnnumfucqfibcixuiqsuxbxxnqsbniffmsnfbinmuqumsuqcscbsbqssncminixucinqxfsfbncmiximufmxfmsqbsnucfusscxscssqnufqcibxusimbuccmifismxxmqxsubqqqnxbsxfnxinusnbfismsccnbniqufumfibsimcximsqmiiqxbmbfqnixfbnmiuxfbmnfcicimcnnumxsbsufxfxbncmcmuinqbxnmbscnqmnbnnimffcbmimssxsnbuusuufccbqnbbfcnbsixxcmqqbxuscxffuuummsmnsxxficsfbfqxquqsqsuxxiiqifixnunubmqbsmxbqqbmsbsbmuncbxqbnufsuxxsxuqqsnnfccbqfqsiqnxbsxfbscxbunxbxinbbsxcnffsiuminbfuucxnfmbqsbcmsqxicfuqbcxnsiqifnxscunffbqusfsbnqcqxsnxmmsssmnciuuqnxscscfunxuqnibnmfmbmqqunxscnbfmquiqqsfbbsxsuinxscsbbqqfuxcbnuunfbfuixbnsfbbxnxnfiixfbninbnqcmbicunfxncmsuxmfqsnxccixxibqbbfxnucsuufibcssbiunfmnnxnubissimbcquiqmusmcixxmnciinusxsuqimsxqxcnuscfsccniffmmsnsnbfbsqbxnnsifmcfnuqsucimuinucusxxfmiinsbuibsuxqfisfumfinncsuqsbsusmmumisqbccbufcbxxqffxcquicfbcbmixbncuxnquqnnuxuxncfnqfnqmfsffmxnubuxfiixqxmnqfmixcbnbfnibxsbciumnffnunfxsuficibfsscinqbsnfnfxsuqqficfxxfsimsnxnsbuqcnsqfuxufsfismmxcbqbcmucqmunfsbcbqncnqxuixmcqmxnfiqcuqqsffmuxuxfmqunfiscuimsqbufsuncnsfninfbmnqsfqcfbixqsbmfsqisqninxqixqciiubmccqcsuismunfqxnncbfusccnubcinmmsxqinsbxfcqmxxsfsximmucsmfuxbsmbxuuffbfqcsunbfmicbnfubcmcibfxnsncquicbxnfiuxsfubnbcffsfbmcbfcqbxqnmqiqbbubbiicifbmbnnicuubbcfxnqmqibmmcnxficsibqfuunuumxbfxsqqmiximfiiqinsnisximcfcmsumubfqbqnimfniuuqxnbqsunfxccibbbbicqbsbufifucfmixxnbfqiifccmqmcqfnuissuxbnnsnfinunisnimuisubnxncminfsquufxsiisscfmqfciinfsimbixsxbicqfsimfbnxxunbqxsxisbuqsmqcxqfixuxqnqxmmbqubcqxmqsucqfcqifqxuxicqsxfumsififxumqiqmuxixmucbmqcncuxcbfqniucxicsncxuiiscunuuixsfqmqfxsxbmfsmmuimxxnbuuuufnsmccmcufnbimsfiunbqcxfcxcxiqcqxnmsubcsqqcusiscxuiibnusqssccnucciqnnuxcnqbiqximcmccufxxcibmsccbsnmnxissmqfqscmxbnnnnxbnsmbiscscuqsifqnxinmbmxfmmnqmfcxbcuqisisbbxxuquqmqbfxqqcmnbubxcnfusnnfbxuqunfssbqccunfqiumqcsfqximcucnssqqnsnsuxixiccfcffsiciqsnmxuusffqfmnssusxnnfbnbimbcimmcbifmbmxsxxcinmunffbxbsfbbfcmiqucuququiqinubfsxbqbffubixnmmbfxfnfbmxcbixisccicqmxfmmfcnuqqnnxfmuubiqcxbucsifufsbcmmbssqcibnfcfiqsmimibscsinxbnnxxbqsubincfumbimsfnfxxcismucxuuncsxnfufxnuiqsccnscnbfbbqssnnsqnxfiufnunfsqbsqqquciffsxffiqqqsfccufiiuqncnniimmfiqsmmmuubbisibncqxnqqcbxbqxnssxbnficnfnqcunxffmxisfubxbxuuquisqfcnssbqimxisfnnxsqsqbqisxxiimqfucqfqnnqcqfciunnbfuiiufuuunnbsqbbimufiufnsimcixuqxnmiuxfixsmbiinxuinimbiiffbmncubbxxinciffbfcqccqfquiuffffffcmnffcsqbuufqcnfxifcnsscufqsqsfumxummsbnmcucuimnbfmbcsxqmxqscxbbnscsccbfccscucncqxqfxcmbbusmnxuisubnbiifsfcsscmbnsuninsbuqxmbnnfcmiuscqfbfsnbmuimscusbxqxfqquuqcsucnubfmmbcsqfuusncbnbsqmufsmxnccfssmsscqiinqxqmsfbsqimxcxinxbbmqscsbbnmqiffsbcbufuxnqxbubcmiimbqqnnmxunmqnscuxffssxmbmsunicfnqffifxqsbmnimnsmbuqnxufquqqficimusxfsnisxcqxmqnxmsimsmmmfbuiqmqcqfsubfunnncucmxqnbfbinffmbuxiubsnifbicxnxcbfnqfbciibbbmmuubxbsunsqibnmsfmsbqibiinuqfbxnicmiusiqmnxnqsmucuqqimnufcsnfxnibxxufiqmxmiinxsqmbibxmfqniincssbnbufnsscxqibuxiuiubsfxismfixumcmxuniqcmbmsissquxsbsxxcmxqsfinbnsxnbcsncsmxsiusmcnsfqxbsmfbbbxbqnsxmcifcffmffqqiuifqcxfsbmfxxmmnixnmxqmnbuuiqscqincbsuqxcifufbxfscxbqbcccnsqqqxcxqqbunufunfncxixumfbisisqffmnfisbcqcfxmmxqbxqcbibncsmiufbxqxxbsbmubumfcnqnmsqbqnsuquxqmxqqicmscufcfnxxmfqsnsmcisxussunqfcmnunmmxiiqbbficbbfiumxcfbbfqqnnunibxmxssxnbiixcmbcfinxfqmbbmmsimcfnfxmbbxusfcbxnicinxcxfqffsffxiqqfuccnsccixibssnufucfufbxqxusssunsmncmxbxmxsbsuuqsbiuccsnuqbuqxiffcfncmimfccinqcusxmncqfqsnbfbfqimnuiiubbiibiqxqibixixscsbfnmsunsbqiiimcbuxxmicnfccubibiuimufuxinmimfssssxqufxxccsinfsximbumbbmisxnnxmncisnciunnbnbbbbxcmqusnnscxcbnqcunbbmnsuiicuuuumxnuffcxccsmfmxibmsnuiiiuqcsssusmnxqfinfbsmxxbnixiqcccxxbsqixcbcxfufuinubciqxsxsmnxqccsccuscbbsqccscxmqnixfxisbnuqufmxqfmfqfqfxmbqqmqqfimqiinqxsfsxcifsxinuqubunncmnicxssiuicxqbmsixubbubsxcqfsnsimcunsumuqsnuiniqubminfimxsnmcnxbqnunmqmcfsmbibsccxsqcccmsmbxncmfqsmiqifncqxfscqfiucbsiisfuibcbnsbsfmqmmfxcquxcusmxqbisufnumcnuixxbfnuiuqqqiusnxifnmnmmfinqusscuqqbcmnxiscxnsmsscfxnbbqnfxuucmxbinxbsmxmsficbussnsxqmcsqfmnqssmuunixinssqmbccxucinxnxbxnfumbxmbxmffuqfibcbmqbcscfbqnuuqsbqiiimqncqmfmcbmifiqmbmfcxisicmixuisqcbuccbbcnummbxnfmxsusbiuxminqnfciiimcuuxnifbxmcmqcbcbcsqnfsqcibuimxffsmmminbxiffscqcmxifmqxcfxcbuibncqcnfqxbfsmscsfsqcfmuibxxnibsmmqbsbqnqmxmqfmmnbxcncbsfsxxbxqmxqxqqxbmfiuxbunxfbccsmsbnnnqxmqsnnxsuiqcxniiuqunsubfmqfbcusbfufqscsicubssffxccbuucibxmsbmqsfbiibcbsqxfmqbqusimufsqmnufxnuqucsbmffcnuqbnfnfquucqucsssbbbfbfsciicbiqxibcnsmcmixsffixcfifmqcsbbmcssbffbiixcumbqubcsnmxsxsbnnuqqbnbnnfncfmbffmicqmqmcqnnsfnumininxqfmmmcnixcuuicmqxsmsnbfxxiuqicqsnxmmubxscfmcncuiqfxibuqnquxixinbxcqxuunmiuxnuxqffbbqsucxmuiiqsqcucmmfcibufxcscxnmqicqimncfsxscfmcnnnmxsmumfsscuummnmxxqixminmfqnfsquqbcnxqqinfxcqmnbnbbcsbiuixquuncmcxqnubiumxmniicciicfccunmmsbcmffmqibxinnqcfcbnxicsbxsmnfminucinbqufxcucucfqiximxuqbufcbibcqxumiuinmicuuiqbfxfunumusmnqbxqcqcqbnnccbfinmcxqqubxqnnfffbqsfnniqnxcfxfquisnccucsiiiqqicbnuxnifxxfnminbmucnqxxsuqunccusfbsuncqbcmifnmbnisuncbcfiffbxmcbmuiubsiicuqbbbmqcncfxqnxqisbcqscuccccmsfnqfiiqcnqmsucsqmbixcxbxxmqfmnixmuummbmcuusfcsmxfnfnbummfbmfsnqmmnufcummusxusiqqsfqffxnumsismfqnxfixfusbqnmbuqxsqbixsmximbsbumuxfffbmfnuuiqufbxnmffxixqqsicmfuquqfixuisbsxfimfcimnncxxffsunnmuuxxfmbufbcqucqqxfxcuqminnnmmficmiqqmqsxxibnxsxsfiiummqfcxscfquisixxusicbicuuquqmnqmsfiscxnsbcmubsimnxnmixmisimsuimsimfmunqmbccxcmsmffsucqnnixcunmsincbcxmqfiumsiicmiqmsnqccffsxxbnxbcnxfbxbffxffsfqnsixicixmmbifbfxqmcxxsfsnfmqqifiqqniqmsbcfbicmfmisnxifbisqquqixsuuxnxbbisxcquqqsusqiifcbmsmxxmnmcifibnibfnfbqsnmximunbxsqsfnfnmsisubciuxcqncqusxcsxxnfmnuumumqqnucfnbxsbfinmmimxsxqbubfuxfsiqibbscfubfffbxxxfucfsnmxsucbicqnicbbmbsbffqfmcsximqqcmnxbcifuxnqsqqicncsmnmuffsfsqqiuscmnmnixxxfxmxsnbbcifcxbsmqnuqiiuiuxibsnnfixxfuscfummiqmxuxbnbffsqiscquibqisincnxnucsmisbnccsbnnxqixiqsqmmbqbcfbicsmxnffmimcfsbxnsbxqucnsifxiqsqxnunxqnbquxsiuqcxmsbxquixsfmmqisnixsxficsuquiiunumnxssmfbbxfbniimqbcfncsimbqqmbnfimquumxbmxcfsnufmqxccccfumnufmqcsmscsxqqxnsfmsbcxmbuuucccufficcnxmcmfniuinxmnqfnmmnxmcucquccquubicxbqfisxnmsuxbfuiqnnqmmxbcqqcnmbnnifsxucmnnnqcbunixqixiqccubbsucqsibxiiicxqcbiqufqcnmifubiqiifufnubqfiubmsfccfsqbmixubsnqxxqniuibxfiuucnimixicnuimbuuqxqxbsqcxncufcumsimnfnqinuxcuximucqxbnnunuiqcucuqciibxbbinuinunxqnmnmicfmicqsnqncsncfxiixfiifinsxinnciinxxsbcbmqsqsiqbcssfxnncqbuqfufuimnqbxcmfnsxnqiifnnqxumixmixbfqxfsuqibnqmfcqmcbqfuquiiisfcfqsnfunxfmbcubfbbxuqcsmfimxmciqibisicxbxbxcfnxsbfbscnsmumnxusumixnsqscxcnqimqubmsqbibquufiffcxqxsxcufncciqiisnsmubuxufnfnssiqqmfmifmxxsqbmnqnmmimfcnfcmniumficbbqniqqisfccnqsnfunniqxcnqunbmusciifucbqcssxmfxcqniqnufmsnbssxxqqsqncmmiqxbnisnibmcxfcununcnsuuxnfxbmiqfsubnqbuxffufsmuuffbqfnuscbsxfqbqbfqcxuibcuqxsuifmqcffnqicfcibnxccmfmscmufqscsccmnfbnsfquxqsccxsisicnxsxxcfcsuxcfqcbqufxnxsccsixcqxmqnnnciimxusxqncbsnqqnbscifcqbbqsqifcmbfuqqqxsmqmnixcfffubcbnuxxqcqfimuiscmuusiuxnbubqcbisfxnixuuncciuquufbinmncqifncqssiumqxnmqfbquuqcfbnxbmmxifcsmcimxfcmiqmibmusnnunqcsffuixiuucxcnfsbcfxmfifmscnbsffqussxcbincfcnumsfxqunumuxfiscqxmxfmssiusnucxmsuuuicqfqbxmsnixxncbnmqcicmxnqsxnxqxnxxsqficfxncibumxuufqbccxuqqqscsbfissmqfumbcnfiubqsxsbmqmcqnbmccibbiuxmqubcxcbbuxiibqqsbqisqbqmbuncssqcxfmqqxcumqsnsnmsxcsmbxnqccxfsfnnbnisiiibiqbubcbnqxbqmxsuniiqfqbnmcixbuffuxnbuffsuqimuususccbcqbcsbmixsnucxnubfsmbxufxicinibffbqfciiismnsuqcfbxfqfnsbmufnucxbnbqcmisnifbufffubxncuqqmcmxqiuufbsbfbnifsxuifixxsuxffqqcfbfmbncnqfnxsfbfnimbqmxuqsuucbmqnbinnfnbqixnnismmuxqxcqsxbfubmbxibmsxxqinsuuisnnifxfixsuiqminxxcssfimsbisfmsqmfmuiffumfqmfsfimmqcmbxfsncmmcsqnubcuqqsusfbbfbqcnmqsuxccxcnmnicuuuncsccncmmmqsfuqmxmcqxnqsmcsmqxiiisifuxcbsxbfificfmfxfbcufnfcqcxccuqnqbxcqncxxmifsbxfisbufqqncibmxusqqssfcfcfuucnmmfqqqbxfunqnsssfmcunqunqqnbsmxfqmqqbxmxunqbibcsxxmfxmimcxsqqifnfxsufxffcsifsquqfuxffnufcnxbcsfnqmcmmxufbmsfqimmnnbqfsffsnmnxfcixnmfbncqcinssiumiqixnunmssscxmnnummnbcxmqnxqqqsqnxcfiqcnnbbqisqmsmsmsbxssbnncucxiissnissusmnbsqmmqbxmnufxnqmsumbsixqnuufsmccsiqxnfccufxisunqsuiifinuscmnfncuuqficbicnqiqqifxifnucqffuinxfcfmxusbcsqscisxbxnccxfufbxuxisbiqusqicfxnbxncucincuqfffcsfqmxmbcfiiumqfbccicsuxqxqfixumxxnsnifmscqfqsbuxmnbubxxniiimxnmibxqximnqsxnmscbbnbsxmmfcmcbnqnsnbixxfbxibuusiisicsubxnncinicubusqnmcsbufimscsifmiuuxfifiuqxifscmuxbiuxniqqnusniuqqbqfssxbxcsnuqnnfmfbfsubbcfuxiuuquucisfxnsxqffqccqsbnufuxicumfbxqmfiifxxqxqmqsifqmufufbminifcqnuuuunxqmcmbbuusimxcxmmcmqfbxxucumqicbmisqbiiimunxsfiumxmsqxifmxnicmuqcxmfsqccimcncxcnfqnnnmsbbmfsuixsxbuixxmcqcicsfxfsfqmcfbbqsxsnxuuunubmmfcxquicufxifibcssnbqcmiiqmmfxqnbucfmiibsqificccxmimncqxccxuqsbuuxffcufcfiixxbccsmusiisxxnxmubxfinxbsinuquxxxbsqqnnfcmfxcqcxmxmuimufsxunsqiususinxmisnusmqumqfufbiqunsmncscficbfcfmnqbsbsnbxmucfxixcbnfcccunmunqcmmxmixcffcqxbfiqqcuxiuiqnsisibxucqcxfsnqxmuffsqffunfqmbqmxbuqxsfbfsiuimicbsnbfcfuumxiqqinuniccmuxxibmubnsnxinqummxbcbisucqqxnfmmbfqbfxmqxsbcbfbbsbbnxmbusucxxqxqfxifcuuqxxbsimsxfcmnxibiuqxxnsbimfmmfscxmusxqfsixfmcscssfincnsnfbqqmxssbmfufssmmquiuxqccbiibuubnxxsiqcuiinibsufumuqccmnbqunssnfcbniuisfinmxncnnxumsuqifbumqbfqfunfbxixnbbqncuxbcfifxsibsccxsmbuufmbnxuxffiimfufcbiqiuqnmbiqiibiuciiqssisbsnfififsfumiimqxcusiuncsmqbbqxsmcumuuimqxmxxfbqfsximbucsmixcnmbibqqnsisxnuniicsmuxsffnusciimcxsfmiccxsuunxicnxmmbnunsxufsfqxxmqcsimcfqcufbuiisufnbsmfccfifcfnnmuqfsssisfissfxbsbcmqcucccximbifsxqbmccbxbsbssbfxxucbmcsisuxxmbmnifuxqisxfumbbsnimmmnminsqsunbxmqxibcibccisxmxfbmsqqcmimcmunsxbbmbfcxqnifxbbusxbbffuibxnbqnucmiscqqbixniminmnibxnbxmmqfqcusibssmfsnsmiussbnxsimxmbcuqcxqbqxnxufssbnfxfsbiccibimqmbuuxbunxncxixiunisfqfuuuxxinuffcibnuxxxnusiixixbcbncccqmxmqbnxcsciumiqcsxubmcmxubbbsccsffuiuunssfinibqbxiqxbnmicqnbubxqqficmxusbxxbimbimqcuqbcnxcbmbiiuincsbcmmbxnusnimqqcnuccumxfxiqcubuqumncmcqffuinnnxumcuqinuifnbmnsfmfnxxfbbxbxbqqunmuccmqmsnibqsxmifxqiiquuqmssxfbqmumfusmqnxcmqumxbucmiuxncxcubmqiimiuiixuucufncicbqbnssxffubsqfibnnimnqcqfxmcismfsiqbqqcqfsusfsqfbmxmbucufsuunmfqfnqxixmqqsmcusuccciccsfuqbqxsumcxiunbfmsfquxbqsnmmcqxixcfcufbmifnmusmucxsqbxqxmnmciiqumsibbbqfbsqussmbfxbfnbsciumiubfcsmuisscnfxfixnfmmxnsmcbnfsusciffufnfucubxnmuuqbuxsbqcubququxqnnmbxffcuussixbmiqinqxqmbccqxnqqccsqxfmxfxmnsqnsqsucsxmqiniqfnqsxbnfnqicnsmiumsximnqfcnbxnfxfiismnmiibciubfmimciscqbsxxqbnsnuuxncqmuquqxcmuxucumximssbcmfbqffcfqufixscnmxxumcibqiuqbicnicnnninussmmummfqnmxixcncxmubxmxfufsisnffqfxsccfnicssniqfbcmcnsbcxxnmbfusbuxsmqqxiqffinfnscsimfcfbbsmufibmiicbbfummufsqcsbmbixbqquufsncxqbbnsbmfmxfcnuicxxixbmfimubbxsfbuxxcmnffbubcxbuxssfbbmqxbmsiuisbbuunssqsbcfsumfcxiqmncnnffniicisncbbbqnfscnmxnxqfinmuiqxsimffxcssffsciqbfqbbqbxxnncmmniqbuxbxmcxuibqbmxsxficmbfuumiuiffucsqqsicxcnufbffsqcfuuumsinuixqfsncfqsmbcsncbmsqxsnqiqinciqcbnxsfubumnfcqixfbuqmixmmcmnbncnbnbqcmbbqnnqbsibxqnbfuniunnfxcnsxsmbfxfimffccunnfifmbsnmnxbiqiisbmniqncnucxbimxmmnnssuqbsciibbqsqbmncmcficbqmqqsufqmqnnummqmfifsmffbmmfifffiqfsffussssquccxmfmufuxsfsnibbmxqnuubfninufxfxqxfninxicxncfxiixcsxuquiinxfqinuisnnnmfbficunmxcsxcuciuxscxmnfmqsusmxunfcniubfsiufunbcxccfcfnbxnuufnibibxmmsmqxsxifixmubuimqusfsiiissscxbnfxbcsfunuqsmsfubmxccumifqcqcnxqmqqqffcsisuqimsxniqmbiixsbmnunsuxuiufcfiuubbmxxsqssqsxbfnbibcbncsmfnuusxfsunccmuqfuufqssxmcnxibsicqfimfsbbisqcbubbquubsncmmibmfbcfxnxcqmfcfmfnifmbbbfccbscccucciciinsxfmuiisubumnquxbusmqmqibsncbbbfcfsixnqmfnfissbxqucuqnsxbcbusufmsfncqcffcfnbqfcbmiuqimcucxbfmmnqfxqqsubinsxcqsqqisnnnbxxfxufifqsxunuiubsbmxqsqnnfifqufcqsqfnxmxcucbbucffquqcscbncsnsfmfnbxmxisxusbmufncfsfmcxnmicbxummqsuqiucumbxfxqmbxxxfcsnimixsiuscxiqcumxsfcnquinmqfnnbcubbfxbxuisnnqcnnuiixnfqbsuqcnfmfmmminsfufcqnucnxxqsisifcuqncinncsncumsffnqqunxsbuumxqxsxufsbubxbxbqcmqiifqbfbsnsibnnibubixnmnxcxuixcibubfsufcfnsinufbccfxmfmfcxxbxcixsuiusuxbcxfxcucixcsncqnqcmmmsmsbcnuumxnquqcnqmfxfxnxsxqsncfqiqxfqxqfbuqiisuixuinbifnnqsnmficiuibxsnsnxcnxqxfsuccsciuniqbisscxcfmsunnuxnfsbcxumcxsuqnscxumiubmiccqsffmfnmcixqmcsbqmsbnniinxsusqiqbsbfnufnsisnsbbiifisqsxqqcmxunuxmsiiiqsfqficxcmuusxicxcifimibnbqmumixccuxbbsuinbnuxnfqufqbsimbfnsmfsfbuxbiicncunnfmcbbxuqnccbqfcumssbbqisfmcbiuisbffxbqqsqbqqmscsqcbxmbnsccqixcxcuxmsximmibfiibsmusxuisbsmnnissbuiunsmqnccicsncumnibxinfcqnqsfqbmufqbumnfiqsfbunsmusinbsifnnssqiisufxufuxciffinfsccscncumfcniqsufffuqxbuisxbxiixbmuuxcnnnifsumqubbqxinxnnmcbnfinmbnsxmusufcsifsnscfmmmixcxsmsbuqnfcsbxuicxbcubqsxsiuusbcumsmibmuumcixmmsxfxunfmnfufnmubisxnsuxxcmcxbmfnsccsxxuqqbqcqbusibnmmicqcnxxncisqcsibixqmcsiixqxfcuxsmmcbsuqcinbnnicnsuqibqqbxbcimcfxcincsiffsuxmuiiicsxnxnumfbcbqcqcnxsuxxmfsqxxibbxmcqqmibubiumumbsquiqbfcmixmcmqnssciumniqxbfqcbunfmccibmuqfqbsnbiqisnqnficixixxfncbfbmmmnssucnnsmuimbbnsiifxmqnbfxibqxnqmffxsnmncxbbmnmqfxffucqixfssuibnncuxiiuxqcuuixuxxsibnbqufifsnuqiqnbqbibcisxiuqincqsbfbfffmnbfuqqbbbsnbmuxqcxinixmnfqnxssuqnbnnnnsbxfncxfnbufqnbiqbbuncnnuqfunicusxxmubcxsimnmufsxbciuffsffmbnmcumifbmnqbcfbsmmquxbmbuuscbqqsnccumqcmqiiubqbiqnmiubfsbixbsmifsncfxxxfciixiicmbciunmnxsuquqcnibbuuqssscnixbsnnnfmffuncmxbxxbfmmfniifmmmciixffnmsxqxisissuxxsxqcuqqnbxnnfcbcbffsubssuxnfqnqnccscmiicbibbscmcsicucuqsimciqnbnnmxusimisuummqcsucffsimnxxuxxbmxcmmqbsuxxsmqcxmxnccmicxnfuxicnfnssfmnnqqmqmucqbmqccmcbumbnmimunqmncufcqcsnbmsmxnuqiufmscncbucqusbfqxffbufcnsnniqqqnnuimunsqmfqcmxqnscxsiunbqinnsqxifimmqbiqnbmmmcusnxbxffiscbbqiuxmimsfxssuucbsfqiifqumbbbfqsbfnnqinuxmnmsmfxnsbmnxsbnbbmmqmbcsnqufmbnisnbnuqfnbbqsicscxximbnqbnibfqcxifsifbqinbmcbiqsixmiffxcmbumxqfnuccinunbuixnxnufiqnfufcixbfnsimmmssmnmuqsqqffqxmfsmucnnmnbqbccsqximbbniqmisbnnicfqbqmsxumiucuquixfuffucqinbqbqixsbbusfmnbxfunnsssfxqccbbbqqxmxibumfqbuncsuccnxqfimsxxxqcmuiiqsuusbfimxfbxcuniqmmcqfqubcqqncixunbsmxfuibisnxxbbfubfmcsuxibiqxnumbicbnuxcbubcnffqbscqbufbbxmunuxiussciqbiiqffqqcismqubusxbfxsbxcsicbqbiucxbfqsbcxmminfifquxbqcqbufmfmbqifxbsuffumcnsiminbfmqxmfxnicncbnufxbsiixunqxqubqfnumnccqqnfbsfcbmcfnfibuccbqbxnbxninsicqqsqxiqfmcmxusbbxxnnqusxxcmcxbxiqcqfiuqqniffscnmmubxxsncfxunqmciqniufuimmiicfbnufcnuficmnsxffncxcbimucmibncbmuximcibiqinfuumsqmbmbbxcqmcifsubsbmfufxubxcbucifxssfxbbnnniicqbmxinnssmqcmibicqcciqsffsbinxxuuuufcuxuqxqcnqusuqsbfxismniixsbxsixumxunxcmnufnmufbmmcissbcxmfinfnqbcxxcxcisfnfucnbiucxiuuqcfnncbbixuicsinxisusfcuncqxfscqfqsfssiqfnxxqiccbqcifbqbxbiiscfiqbqmqxnnbfifqxfbuxfxcfxcunxmmnmnmibxquxcbncisqmbifmicnqinfqssmsbiixxcqmcbnnuciscnnicxqfsubfqcxfumfiqbqfxbbisqmmxsxfxnnxfqiniqnmsnuifbsisnmmqccubxcnmmxnmmncxbmmnubiccxbufqimbcbunibiiqbcqunncbcsbumqsuminnqqcssufmmmffuqbqsscmfxmsciimsqmiccxsqbnqmissxffcfxqubxuubumxcumqxicsuiuxmxuxqxibiqcismqciuqxcbusibcbcumqiubmcnmsucunsxsuiuiqqqfnncciqinffuqnssscnmfmcqnmsmfnuqffufmuxqiqbiqmmsiusibuxnxcismnnunqffxnbqncfcniqfnubsbnqibbincuqibbixfxbxubsbxnsxncmsbcsxnqfqxffbcnfnmsqcnbxxunxqnsccsxuscmsxcqnibsqbixbufsxibcbcuuncicciismnfbcnubsfnqsmxbxmnbnimxqfbbsbuuxibssbbisscqisusbbiqbcsqiimcfnuqcuiqfmqccuuiuummqbisfxsxfqxfsmciqiusmnxumnuqnxbqcucxxcucmnxnsfmxnxbbnxcbqxxucsfmunuqsqfcbcxqxiqinusffbuunbsissnubfmmmnbnbxnmqcixcsiuucicmqfxfnixqxnqmbufqxbfsnnumqcbcfxcfsuxccqimbnqccnibxsxcfsxxixfismbfsuqcmifbmbmunxqxubxuqsmismncificuqmuuixqqbxiimnbxnubxmifisumxmcuifscinnsbmqisbuqbinuqxxusqimcnfbmxbqisuqqmnqixmiiufqffqbfcbcfsqcbmunmnqimqsbfsusnimsqiucmiqfsbqbxcqcqisxxsuincbxcicfcsiniccfbnsccuiiuqcfbffcqxxxcxixmcimnibxixcuuuqcmcufmixqsuuqxqmmbxuifsunqmqufbbbcusnsssnsnimucqqxsxcummsbusqcmsfucqxxsuuqbfbxcscbmbuqxifuucfqibxicnfxicmciiifuquimmuqbfmuiqmcnimfninicmnimxqiusumnmmfcfxnsqscbbqbsifbiisbmsfcqnumiquicxqcmbfisqqnbcxcbifuuxqnuxxffbnqxcqffxxcibbxscxqxifufmfiixffbcucxxnfxifcqquuiuicunsscccmbxuqbusiiusicufiuubfsicnmumffmfbsiscccmbubnibxmfmscibubcqnibxiiibbcqxuuqiimsssfssmqfubsicxsqufuqcicxfsmbfqqncusbbnscmimcmnfxuqmfxcixsimcinsfqbnfxmqnfnsmuqbscqcccfbqusuunxfquuqubqfcuiuqsuxuxbnxmqifmbxqicusbnnbsmbssmuqumisbiuiqfbuqmfmsssqxnnfxubsmsqsxfbibmuqifnnucnccciqnmufxbxicifmssxbixcmqsinfuqnubnqxiqscxsfcscmuiffqmbxxnnfxcfcsnqmnmbunmfnfqxfbmbqxsiusmsnuncnqmuunfnxmssnfmmiscsiiinbsbiscimnsinbubxisfiqsmixcxccqnncixscqxqfcsmcibbiqmnbiucfuimfusccxxbmuxciisbmbfqsnqsqbmccismcnbscqcisnqsmccxcxcncnqsusxcqusnccfnqmcxnqbbfnixnnmscxnnnumcbmsbbbsmunqqqufmsmbicxsfqxxbuiciuibsbcicinsmxbsnibqqbcunsmunxxcfuinnmfqsfuqfuiqxqfcuicbcuusqmimifxmbmqqbuqcuxqfsbcniifqmqisissqqxbbunqumnqmnsummciufqcfcumunsfbffxixmuufnqubicxqqqmqsmfbummisfinxfxnsfsmscfxixcxnifxbnxsumqcunicunnbbuinqbiqcxbmbiccqcmnncxmuxumuuuxqxfuqnifqqibmfcccxsssbcqnmbmcqsqmfbicbqfnmqnuubqxiusqufcbfniiffmfssbmfiuucucqiimqnqsbnnmnfcfuqsxfccxmxqqifmisxuxmbufxfcbiminqxunxncnnxubxxqnnumfxcmixnxfcfsuifbqfnxssqncxnmuuubuquufsbfmcnibqiqbxifcnmsqxsscnbqxcsicnunbnfmuqubcqcqmmsmbfixfinusqiqiuqxqsxcfncsfmmnxuqqxucmxxicxmscxfffxfsqcnciiunxqxsccxfucbqqbbxbncbcfcfnbscuxbxbsfnbnqsnixxsqfnfqxibsxmnicixmfqucbxixfuisnibinfmqmmnffcimuunbxquqsxxqscicfqquqnbxqiibfiscsuncuqqbcxsxnnsqnmmmnmqbqxnbmbfxbcsnnbscibnmuqqiumqiufcfbunfqsfnnciqqnixmmxxfuxqsxunccqciuscimnixminfifqcusnsxuiiciixxxnsfqsusmbcfqqnufcscbcqxnisbsqcxusqxnmsifmxbiqqqibibxxxmxsxnimsfqfunbcqsqcnffxqnxquqccbnccfcuimbuuiusnsnbsxsmcbcimmfqcfxnxffnmmsmxnfsscbfquniqsnxbisqbufcununmiquisiisimffxfnmmnquusmcmbcmcfncsuxbcscxfscfxqfsmbfnbmfcqbmsfnqxbsmbqcximuubmnumssisnsibsuscbcbcbncffsbbsmsuuiiiifqusmcuqsxuqqxmuxbuxcnxbbfxusbsiimbcqbmcqbfbcubmqbfiqbmxuqbfxsmqubnfmbubiuqbfmsfquxmiicimmisqbbqmfxmuicmufscbxfsnuufbssxqucqfbcsfqnsqcffmbnfmsmuffiqnicsciucnbimbqxfbsnbbxqnfxinfcbbinxcfnuffumbcxffxnmxmmccuiicsmuxnbqcibxbmsxxmqcnmfqificmcqccnnffnmmuinnfbimnxsubqsfbcbqufxuibqqifiisqxbmumbsmssnsumxcbmunqucuqfquumxfucqbfnbsnufscunniqxfxinxfxnibumumqcbnxfsibfxfcfusummiuuiffsuxuqscxsscbccsfqibxbifxfqimcimcifnbuqsismcqmismqbfmxnmbmbsibbsuxnibuxunmsssiuucbncuiscinbxiuuqfusfqimcixccbcniusbxxuffbiibcxnxmnmbnqsubxiucibusmnfncqxfsbxqnffqmucbscicnsxnxsqqisxiqnsunimfmufsxcqxuniumsquncmuumbxnbxucbscuxbsmufbsnnnucufmqucfmmbsbifffnbiuufuixbsbcfiqxsimunqncnsxsniquuqnfibuxmxmxmuinnbimmfnnfisfbfqmsxmisbfmbqibuxmuqxniffumnniccmbsiiufmcfmcqusfnbuxsbuxsxunmsqbxssiffnqfqcxxquxinxmxncmmqssnfsbcfmbmmqfsfxqmmqsiiqqnfcccfbcunbmbxnbqfbxuixbsccqnbnniqxiubsxxumqmfxcsibqsqfsxuxffffxficnmfifinqucmqfbmfbccbssqnxxnfqxninbfcfsxcxfbmuxcfbiibcisqsbffmubsiuncxcnnisfbimfciubqccuxixibnifqbmsxsqnfiubnicqunuqqcnnbxixcbcscmibibqccfuncxxfxxiqcuufsxbbnnsuqcuuquxbbxmfbqnbqxmnbnxfbfmfbsnxbnsscfumuiqccmsbfcixxfbbuxcnfuscfufnqmmibnsqunficbsmmnubmbxcxbbxfffsbsscqucmmmbmqiqufxbimfuqicbsqfmiufxufumcqbniummsmibnqicsccuxmumqmixbxsibqxcqxccsfxbficcbsusissfcqmufsusfuxmbxisimusubmmsssbuqmxbcbxscuxixxbuixussucsnmunmbbixnqcnuscfcbibqbqfsinbxcnxnuismufcbcsmfsmxxsiifuuqcmbxcfnbqmnfiiqucubfumiiiiqfissnbucmmnxusnfuxxbfibxxnqmcbfmqucqfxifqqscqiqsuffmicqscnmqqfcccfqnmunxqfsfifcbiqcbcmmisbbffiucfcqqiqunuqcnxqqsbiicumqmnuqbcqnfuinfsxfnsubqufbmfqqciiiiqismbcnumxxqcccnsiifqxfuiiuuqffxnsfcxisnsmnmuxbnfmuscmqbfsqffcnmminuxnnuumsnsmsbscsxxsuuifxnsnmucnmxncqfbiscsunssmxfsfmciuixxbumuubmxsfcnmqmxxbfmmumcsxqbnbsusmmbiqbsqnicbccufqmmuxsccmcqnnxbimnfumimsuisxqibuxnbucqfiummmsunsfqmnibbfqfbimbsxnixxsscscnccmmbmcisniqcsmffsfbmcmxiibbuuxnuuusxsquunqmxsmnnqqbqximmqnbxfssnquxibxxncinusffuqfnxqucnubbncnnucbmuuqxficqmnmuscuiccmcciubinbqssxmufqcfffffxsxsmnfxxmcqsmcxqcbxufunfmqsbqsuqfxnumxmnumfxfsmubismcqnqufccmxifcccinifufuxnuffmncnnqnuinxuncnfusqiscbiqqqxxcunfxbqubuncxumqmxixffucbfbfcmuqxsqfxubimcfuqciqqqqmmxxqfuqmbqqsfifncbciuufbxxbmmcffbuufxxsfisfmqcfmnbqbucnxxinmcffqcunsxnsnsqxcxnmsmsmunsxnfncixcqnncxqqqsmciiciimnmnfnbiqnbsnfssmimscunsfxsbxsimqnmffiscqnqmninifbuissfcuunfcnsicbsumqfunmnucfsisiiscicicmcqsfqubxbxfnuxqssxcfmsmnxbbxcufqqbfuifsxficuqqxffsbqimmfnxfuncubxicxfsbqfxmqmsqcibxqbxsmsqcfsicbfsfsinqixcxcufqqxbfmsusmcnisufccmqxbssbunxsixqbmqmmsxnncqcffxunbfcimqfbqqubfbqubqfmccssnniufbbmsbciqbxicxsbqxcssfxffxuffuxmcnnusqisbcmixuuqsmnqcsmmqxmniqncxmxnqbmsficqcuqsmufnficixbxbfnmciqcmuxiqnbucmuqbxixmsuqnncxcmcsmfqcbmunifxucnfbxnubsfcbucuqxmxqimbiiscumsfmuumfbmbfcqisbbbxfqmcixiqcccsscbfuiiuiusxcbbcxbsibuscffsccqcucqmcxbminnsxxfqusxcfnsmifubqfnxinquiiuibiibbfbbmxqnuxbnnmsbcmxsnnqumfqbncqbmnmncxcbbucbcbssismbcnncinmbifccsmiiufsqmnmmfnnccqmmsfcixuxinqmxfsfbcxiismbqsfuinmsninmqinxcqxqcifnsxmisuqfubsfnncsnqfmbncmbcsnunbinxnsfifbciqinbimfsqsxnimbsusbnuxqsqbfuufxcfbbinubmxxnciscfbusibsmxmbmquxmxfuibqubfsnxucibifbqxismumxbfsnxcqnqimcfscisxunuqqxmcufnfqcufqinxqnqcxnsnmiuqnxsfbuifcfxucfimsffucsfcucxxmmsfmssxxcsiucfimbmsmfuciqqnbnffxsqnfqxxfxnbnccfiunnscnqimmxnnquubnxnncuxmfqcbiqqsuxicixbsbmcuinqfxicumbsbqfcqmbbcqqxmfcbbcxnnnscnubiucnbcimxqumcqbnufxiiqbfbqcmnibcfumbmxubqqqxiiucuifxcscnbxnmisxxcfsnimiunnxfbmqnimxxmnssscfqmqciuqxnsscibfcnbfsqmmsmuimcfsmbnbumsfsqqbifnifqimbucnifxfusicsbsxnuqnsmnfimbqmqmunxiccbfuxcxxcscxbbbqcmmsssqncbnmxucxqxunsfcbuqmmqbqxsninunbixqnnbssbqisbfcncmiqbufqsfqxusxunbmccmcnbibxqcfcubbqufimuxnifunsfxbcqbsmsqncnummuqmuqmmimsmxsimcbxscqnsufbxscmxxsnufbsnfbbnfucfbxqfxninbifubxnibxcficxcssqimxcnfqumuifuxcbqxfsiccqnufmuxumsssxscifncsfsqxmsqfimimucxcfumcqiifxqnxxxbbsbqsbsnibfsmcffisnufsbbifqcsnsufxnbsxmifnsisiiuqnsbnfimxcbsxucmscicuuunmumiqxxubsfxicubxfqmnsuumcisixqnccuqucbumsnnnfsbqnnfncifcxxbuicssbcicbumcmmmifbqcnxcmufxcuxnnfnmsmxbiciniscuumqibxnxccccscnmcmmsbuncfmcbmucifbfuqsbmffbmnqubnqnmmuuxusunfiniifunbsnmqxufiixbnccncsmiimcbxcincxncubcqucfcfssuscbimixnqfumimqxmismmusfuiscuxfubbfmqqunimnqxbfcmsqfqussqisssnuxxbbisfqufbcqcniumfqcixqsnsqccsfcbicnixxifniuxcixmscsfxxfcqiuffcuncsniccuquncbbmmucimsmfbucqsuisbnifbbissusnbcimiscincbcxfqbfqfmnmscxfxbnfmmcubfxmuxfxnuinnbnxbinsixxcmsxxccibufcsmmxsnunxcbucsmnxbuuffscfsqmsmucnnmxibbsnsfbqcbiscqqbxcnscqqcbcuxqnniimqscxbxiqfmfbbicqfmixqsufmiixnuinbbscqmfuxnminibmcuqnsbsscicfqnquccbusmqfunxxismnbunisbicfssqcquxcunmmbnccuibmmmfxbqqqsfqbfnbifmbqcusxumunqsxcuuuxbiqicbfmnxqifiquxinqmbxnqfbmnmxccuniqcxmqfcqfssuqxcfifucnnquucfnbbmuqcnuunxqbbiqqcnssifssbbubfiicmqmusmqxmbbmimninfscfcsusqbnifmcfmbusixissqnxqxcxnfmqxmcbquxsfcmnsnfmmmbxsnfmimbumqcnuxfqxnxifbfmufnisiuqnxcqqqsncsxfbsqqmufcmxqsqquucfiunmiqcifbiuniibbbscqsqnxmcbcxibfnniiqncuxfnbfqumnffxxscxmficxcqissxnnqsuxfcbbumusmfqqucusxcbuubqfbncufcucxccucuxqmfqxiinsbifqmcbxxiixnibiixfmcnqxmuiqubnubiucnxuifcumimqxmsxfiqcnqmxmbcimfnnsbqufmnxuuxnbixcixsffccxxqfusmqubfnnqfbqfcmmnmmxqbfbbqnuxfcsqqnunqiibbiqmubuuqssnnmuxnfmfuciisbbmbmmfumbubmnxqfciuiunqmcbxiqcfsiuubmiufmnbuxxqmmuxxfbunuiuxcmccnbuxnfisqqfuxxfmfbnqsxqcfuinubxinucninfsfsmfccxmbmsbqmqnxiuuxsmciuqusbssimqcbifbixcnnibbnmuscsmnnmcisusbfuxfuqxxunsqqsxbnufbifmmbnnffnqnsmqicnfimmbcmibxqmbiicnixfqiqmumnfcsiusqucmnscnmffusxffmmbfixmxnxfxsuinmnnfnuffxxissqbqiqnuiubnuxinsbnnxinxxuubxuqmisxbcciicmxffcqccbsqcfbuiuxbimxxxqixxxcqiuuiuscsiuxunscfusumnxbbfiuxxsinbmbqqfubbicxxbcfxmufnnsfnsfxxuqmcbcqisfbsbfbmmmiqfmcfccmbcssuncnuqsisqxiuxiccqsssimbsmcqinbcnnbxbixiuqfxfqfnbbuubxbnmbiixmnqmcicxucqxqmmubxxcmssqimbxnuciqisfbqcniquifnbfccibcnibfsfcbfuiiuuxffmcsninfsmfxicmcsbnmqiifixiuxcnfquubmfsmumqucsmsxfsccbinciubxncfxisuncxcbsiqnqbuiufummnxbfxcsiuqnqbsxucbiibnfscxmbsqmimsqqmxqnbxfbnnnuunnqifcnmnncuimcqffqxnnqsmsmmqcmsssbscbqcnufmimcmbbccqubfxqmbnsbqcuccimfffniusimisinuqmxfxqufbbifsfinxsufusmfsxmfbcussfmxbfbmsbbincxnssqxciuubqiufbscfffifbsbxnnxxuxnssncfxfscmimnxcfmfsibqqixsmufubqsbmuxbuxqxmnxxbfffnqnqimsuimcciifucfiqqxsxbnsifqxxfqbsqnbqiibnbusxfcxiifniimfsbxbmbxufqnnmxqqinbiqubifssxnfsunicuicnqmufncsnbmfxmunncfbiisqxncifxcmminumcnmqmmbcfcscmifnnmsuqfuimcxfcxnqffxqbiquqcmcmsnmbcimbccxsxfsxsmcusmbqqffmsucbqnfxfcfiuiqfnbmsxbcuqcqscxnxuncsfncmfuqsqcqfsfbcumqmubcuiqucbmxuxmqncbcisfmuumxmscmibfcsisnincubqbiccsbqcxnqxbmxbcxcqumnibxfmnxficsqxqnfqcnqbxxuissmfqbiicqsucmcufinbfuibmqiqbqufissicixuxqxsxbnfncnnnbbcbfubiqxqcxcfisxsiisixfqqismmsuuumssfibimmnsxmcxbunnxmmsbsuqisqssnxubfqccsqiqfxqxuumquubqcfcmmmcxcbmqbuucmsnfisinicibssqxxicbmscucsqnqinbfmsncmucqfqnciqmuxmfxfqmcsfuxqsnsxqnxcmxnmxfmufccfmbmcbuimimiiifcxxfnmmnxncuqufmmumbufxcmuiiqubbmcuffqbfuxqcmniqcqcssffqsumxufufbnqcqsqcmmqimxquxmnuncbxbisxxmuusmnqnxqbsfcxixxmmxfisxnuisncnqububsmnuxcxscffxmncmcnsfxscbqfxuubxnfsbqmsqfufnfsnsssqufnccnmmiicxqbuxuxnxsixsffnbsmbbcsmicsunsufmbqxnqfxxmnfubbxnbmbsqumssmsxbxnbuqunbsisququmnqsnbqcxbiumbnunnxifqnbbusfbqmxfmfbnmqbcxqisumbmbfxibficmcbmiuxfbcqbqinismqbifqsffcxuqmqbsfucuibmbxqfmbxxcxxxcbibfsusbniqmxufmmiuncbxisniiuifinnssfmqqscnicsccbuxcfsmqxquxqcnminxminxnmxnbmfmusqfinnfqxximfinnuuqxbsuunifmfxbmmnsifbsbcqfmqcuxfmsqncbnxsfusiiibxfnisnbbnxicmffxcinbnbuxncbxnsxbsmfiqxbucsbccucnubxusqxubsbqsssicxnibnnncxqbucuiqqsbbixxsifsnmnmuiqibumbccsbnscncqnnscnnmxcixiffificminmsiisxmcmnxxsuqnfuibqbqxcbbfqfqfqbminccibxcubqimqffsfcnuixxfnixbminfiixncqbxiiiqmmcnusunsuuqffnuffmqsnmscnffqnfxfbqsiquuqmcisibffxnxxufmubxuqqbunumccmummfsnxqqmnsxffnbxfnixfmnfbiqnbuumsiqunmciuiquxbiffffcfinbsmissmxmuissccicssnnmbcnufsnfbffqnmusnfsqucbbxquqccifnuxxqcbqnsfbnmcfsxqiccbmusumbxifiscqumniqqqfqiqbmqxnmfqnmxiqsqbbixscuifuminbqqquusqcqifuiqsmmxmffqqqnmxnuifbssqqniqmbqfqbuninicummmcfsqnfcsxifqcxixmmmcxmmbixufnxfscciuxsicnummfssiqmbbxsufuxbmfqcfifnbxsifunqqxxmqbxbxcxicmcmssmcunusucfbbqbfnuqnbmcqfqnmuxsxssnfcbunmbxixxfnuubmisfqxsscucqcxfscicfqnbsuxisfnqbcuqmixsumxsubfqsnxfnnmunbfnincmsmsxcbiixmsxqcunbuusifscccnbffcuqucmnuqmfnnsifnsqfuqucxmcxmmqcccumcbnsfbsccucumbnbnfsnqqnncnsnnmfmsmixcqnfmsbbbibssmnxqfbqnfucxsmisfbxbfxbcqxuifucbmcibbnciscsmmnubbxixfscubnmxccqfsmxscmfnsbmxfqcqcuqxncbscqsxscnuqnqbfusbxqmqmcfsqsmsuusssbquncxmcsnxsiminmnqfunxsiixsmcsxxnmxqqfqfmufcmmnfmmbisqfbscbqssmnqiuimxcnncfiucqimuiixbffqffxsccumfxiffsfncsmqmnbmbmxsfbnbsmunfufuffcbnccxxfcuffxqqnnqumsuffmusxffixbcmsiisffibcbbsfuncffqxnbbbmnqsqqumunqxqxufinfumncqscsmnifsqsxifxsbxcumimxnmiiixficmmfffcnifbnfqqubfxsxfqxcmcucmxfmnbibnfmcmxuqqmqmcummsummnsnsbcfcufmsxxmnmnfscibxiiffimmqnqcnnmuxquccbumssmiqsbufqfxixbqcbmqxsfqcfbiqufibfbnufsqiumnsxscicimssxisbcncbmnmnbinubnmnnxxcmciixqbfiiqfifmsmffxxfcimfbcsbmmsqnqmxscqqsinmqfuiiqnbxsusmfnbnbxmsmuqmxxmfuusmbxmfbfiuifumibxunixmubiqsbnixnbqbufqxxbmifmsqxfnxbciqquummxifnnqccbbicuibnmxucubfxnmsscbunsfqncxnfbxmusmfbffsnmqqsiqbxxbxncqffmmcbbxcqcussuxiqsqufninmiuffmsubfiiuibqqccmfcxqqubbxqcqbxnfufxqxxfnbscxcxnqqbqububnbsmmcuuciiucbiffqbcssmsqqxqxqcxqcbqcxuicucsucminnbmxbnqqfubfqmqcsnsbssciiffsxssfxcfxxqbbmqsiincqnxqbisxucqmuxuqsmxquqinmsfqnbmcbncifbqsuimfbifbnfcmuuisiqbbbiuqsucncmfnixbuqnbxciixiunqmxbbfbbbxbufbsqsqciuusumxiufqfxuimnncqbsfcfbfmbminiiuqbixscxqfnncfbiiqbsussqsuqsibqiccfcmfmmqsufqqnxquxqsquxxucbinbbfixncmcummfmqubiicfcuffusquqcfiuxqqsmxcufcuxiuqsmsxfiqbxsfcfsbcxbufxfmimqqncsxfbbfmscumuqfnbfunsfqcuiixqxmbsffmiisfxxubicsmfiqsxbmccsnscquubssbqxsmxixfsmfummufcbxnmnssuiuuquqsimmfccfxcnnscxxffumxsmcbcuqcxffuiquucmsqcincqcxcxinmxbixqfcnfsuicicnufsifxxmnifnqubmmnqsubfbbnumnqxmncbbmncxisubscqxbnxbbmiisqibciqnmiuficsqsnnqqnxcsumubnbnsqxuusnfumcbiunsnuxqbmxqxuxbbiqbisqbnsqbifnuqffcxcsuqufbquxbnmmqbunbbisfxmusbcsciuxmcqqbxmfcxfbufncsbcnfbunifxfimimnxsibqusmsimfiuquxiscmnmmfqufixffbxqnfnxxmsxnfquixqsnxbxibbimmixiibxbfqnqxsquqfuqxxxffisncbinbxciqcxibxuqsxsncqimbquxcmnbqifsqsbsfciuqmsxsxmfcixfmmccmunqxiqfbqbnxfnisqxifbfqxbqqnbfqfxfinmcmbsfixfnnmqbfbxbbfixbfufuqibxqiuqqubibqfsnqmqxbfbmbxcmbsuffxmfqsbixcfqcbmqufxuuuqcibfxfinmunsxqcmmifccsnuucuumiccbsbccccnixuqsqbxxfxffqsssucmicqmqsfqxfuqfumiqbquicfmncmucnunxsxccscmmsuxxxbxxunnnnsmixbsunixnfuqsfxmsnsiccqcuiixssibibbcbffxbsubxfmuicnxqsfcbbbuimsusmbunfbcmmniqixucibmbcxsnisqniiucbnuuumuicmfmisibxbisxquiubnusfsuifcxxbcqbqqnfimunusxmnxcqsicbxmfiisixfbcfnbmfmxmubuqqifminfbbbxiffbifxcibinbfsbunfixcqqinscbqsxccqsnfbxcqsqifimmqifqcfibbsqfifnfixmsxiqxmfbxuufxffcsuuxcmuiunfnmbuuqsfmnnbcinqmbmxsibxsficimqfiqmffsncnbfisfbmusumxsbubuqucfxxibumumcciincifcscbmmiiqxnqfxccncqxncunxxmbnmuxcnmqnunnnfqqnmbbmucbcbuiubnsqmbqxicbiqmfuiiscusxbnuxufnmsquxfnxmnimfmisixsbccmxsubqqsiffmxqnsbqsniuuqxqquiuqsmicsfqissqsxfbisfsxcfqnsmimunfqfsfxnxmcbciccbunbnsiunbqscnnxbmxnqmsbsqnbsiqisfusciuxffsssxinumsqiqinqfuumcxiciffncbbssnxfsufsccnumbmbiqciibixcqiqxsqcxqubibmbucxnusunqxxfqqfxcxnqqqiixmufmsifsnmcsffbnqmibmxfficxsmixmmsixufuibxxumbinnsfcumicbxqbsfcuxibqcsfqxsxcmusqicmimuuibmfxnumxcbfnucuqmsfsqxcuqmmuixsnxfiscsxmbqmiusmmffmxmmnscuiufsiqccnxfqbqxucxbscxfxiibcsxnnsfxixqqunxqxixcucimcqcnsiscmcqncumbqcnsumxxcicfiiqnuimfffsqfqnmmsibucqibbfufxnbsibxmxmfbfbsmcfxbbussmibunqfunqxucsmnfcimqssfbbumfccfmnuufssfimsubqiimsfuqqxmfnfcffbqicffqixxfcqixfsqfxscsqicmnuibiuqsniicfcfnfucfsbmnsnbciibuquqmsxxbnxfcqqibufssnubusqiunnxuufxxcfqbquncmquxcsicnxfumqffiqfmicsxmumfmnfunnnccibnfssqxmfcbnbiqcqqbiisxmumcbisfxxxfqfiqcuccqumiqfqnnfcxmmiqbciusqfccninufsumfixqucuicbumufxsiicixuqmqcnsfsibbnminssnbiuusnbcfqxqbcusbicuncmuxcusnxsqqqqmxcbxfcxcfbsxiinsiuuqxsnnniqibmusuiubimubuucxnfucbxbuciixxqbmqmsffxbmiuucfffimimcqqfxmqqmiinsqbqixxmiqcsciimqqbxinbnqsbiifmisxfibxbnfqxbibfimnucmsqssccfbinumfiqqxcuubcbnxqsxqxffnqfccxbcqiiqxuufimicffxnusxmsifxffxcbmxfxuuninbmxnbiimxqibbfnubibbniuqsfsmmnmuqqmcbssnisnnfxifqfiicxnbmfcsuuqqmcnsbmuuqqxuqiccuummnsuuqxsibsunuqmnffcmumibbqxmnbsinfqcicxfmnxmccmnucicscmbfqucffcxisnxqfbcufxbqmcbiuxsqixmiiqfnucnbmnfxiiusqufmfixcqcnusqqumiuqnincqimnuqfuqcnixcuxssucbicinnffmnnuubiqfxmqbcqisbcunsmnqfuffbmfifsqqqnqmibiciqsbcxnsqcssbsuqmsfcsqnmnsiqxqxufcxfbsxbiqbqusbfqccsmsnuunifisxiicbssssmubfffmufuusixuqcqmqmcinbiscuucmimxsnxmqixfqiiubfcnixbimbbmbqqubmuxusufsnfsiiqscxiffmxfmccbixfncmisqfnnqfcniffsfcsxscqcixmnssqqfsbmnuuxnifxxccusxsbxcsisusfbxmsqxminssmunixuqcmqiqfsccnbqsxbmnncxxsiqimfbiisbmxunnqxnibfininfqxsfmcmsinubibcnsqmuubqcsuffxxixxisqsbmuuxfimcuicnqqiccfssubncumcsssxmxqucsnbuxfbnxciumbbunxqscsumumfnfqissqsuufubxcniinssqssunnfiibqmqmqiqifcnxqbffnmbsucxsmcmssmuixbsfxqxbcxsuqxmfnfuqxififumxinscnciincxximcxiinbucmbinnqinucbinxfbsqqbmiibimfqsqsnbfxnnxnnmbiusfixbnqnucxisucxxiuqcqsnsucfsxuiifqqbqicbciuqfubixxqbncuxnmmmqxsisimsunsnmxxifqicqiiiuucbibixcxumfnbbffscfubfincmuxmmsniifxsqicqcfcffbsmbisqfnucsxiinquqqfuuuscxqcxunufucmnmxbfnfscinuxbcsbixsbcxcmsnibncuqqcqqqucufnsiuinxsinqfinnqcqnqusmiuxnisncmcismbfsbqfiqubbimnibmsfcbxfuimbxbunsqnfbmxuqfuimqcbscbufxsmcfmnixbxqcsbmcmusiibbxfqncfxnbxsbmsiffibsibxbbcuixfumqmiqqcunxcnmxnbicfiuubfxcnqfmumqbuuqqqxcffsuqqsmfsfmnmibsumxxiqmnxixqimsfisuxusuqccnbqmcnibicxxncncbsbscfmfnqfcmunixunffixsmbicucqbcnqcnmqxiffbqbnxqbuqmiimmbqmcnnubiusqmfmbqniqcnxqbxqffbnmqbbqqsiuxfqciqxmqscuqccsqmmmmcqxmncucicmsnmumuixiumcsfffbqsfususxqiuuqbubiiqcmninqfmbxcsxsqcsqfufmxmsnifibuncnixqxqxxnmsqbnsfuusncsunibnficimmxifscxsuinsqqxqmcsfqcinfqmcncxfxbqinsisbcsimqmfniqmibqxsunciibbsfunsqxxmsssiqncxfbbqinnbusiqsnsuisnqssubibsufsiqqqfmmbfcfqcsxqfunsxmsmfcbqnqxifnscqfmqxibfsxcsuiqfiibqsimsmnnuimsinqfbfsiuufuffcqubifixbccfnfqqqsmbquqnnbxxnnbcfuunfusfqqqcsinfmsncxucnsssfmcuicimbbcqqimbsnnmbbisuqmxcmcmixmfnfxxbusfqnxmbfffbbbqmnifnciixcmiscqimmqfqsibfnbifinqsqbxibxiinqsixcmnnnbiinnfucsxmqfmbsibsnxinqmuifcusmxxmuqunixcnfbmbsfxccnfqcnxnqnbqmnbcfnncmnfmciqfqmfsbnbqfsfuqxxqbumfsqmbnmqfnqimqmnxiixcicibfiqcfbscbbccfxsmxxbniisfmuqbubxiusnsfxicfxfsnqiffumfisxqucumnsnnsxmxnxcbifsccnnuimssfqxxuqnqxiiubfqsmccucfibcxxsumsfixxmunxsxqfqinubnnqcsuixccquibibusuqbxxbqibuqfbfbumxmxinnnscfubbquxcqnfuqfcucmxcmxnmqufuqcfqqcbucqmxnsqccsnssfbcqbnxcncmxfnbmmcqsbxxmnxmusmscbxmfsbuqsqbmmsnbibinicqnuuiixmmbquumququxiuxnsqfqxffssbisuqxnqxbqsmnfmuscncsicfsqsnxqxxcbxmcbbnnxsumuubnnqusmxumfsqbisuifsuxfmnmucisunfcumixunncucmixbqnsiuxsinxixcqinuusimmmmbnmnbbncfqsminsfxnxbummuibmnmfssfqsuqbbmibcxsmficsumqbiqbxiqnsicxumnubnimsuiqcmmqcbcibuiqumxqbbfincqiqccmnxxcsbfcicuiusncbumffsfxibxfnmisbxqifbqbuxminnisnqmusumfumxcsfxbuififmbuimqscxixsnuxcubbcmibufixmqbfbxcxbimmxbqcxnquxbsxqmsmbsbmbuunfmsncmmffqbbququqbmbsuiqxxifibuccsqunbbiucnmbcuicuxfixbfisfmxbnfxcibfxcnsmqqiqicicqsxubqncsuumqicqnxxnumnsqxbqfccbbiixsxcniuqcnqmmnbnmibqxbbmuxxbcnxbqxffmnsiqfcnnfinfnqfbumiuimmbmxqfusqixqssqcxxcubcufimfusuciqfubcmbmxfnnxqmxxmifnquxmifbccnubnqsmfmmxxfbnfmcsnqunnbiuixibnnimfxufmsmbxsfqbfuffnuqcsbxfqmiuqicumnmcsuuxummqiuncmsfqqficinnbfmqfqcbimbuncmssfiqnxbbmxixmsfsxsiiinxfnnnminccxnfcxiqbqmnmucmmxixqmnsbfsqmbixubffiisusscsmmnxmnfnfmissbmnciiqmimuqqicbbcciqsccxubfnnmbxbmmfcsuxmxnfinxncuumcfqmucmcfcscmuxiuxqsufxiqsmbnfubquqimcnsnquuquxccusqmqscxiqxficxxcsfsucxbxuunbscfmsninuqfbmxmxiffqxxqbbfiibxqqccnuixqfnqqqqcnqssuxsicfsciqfqxccxxnquciumccbcsqiifiqmufimunifmmsbxxcxnfquxqxuquucfnbbnsucbcssuiqicmnqffubqqcsmmiiqxmisbfxnqbcmmimsunibqfxmqquqcqxqcqxscuixbqcuufnqnsifqqqxfmxqsxnisbbnqnsfsiufufncimixcsnmuimfmxmqfssqumniniusuncbuicxicsxusfxfisciqqsqubbqsnifcxscbnuummfsxumsxqnsnmbbbnqfcqnxbixiibxsfqfuumciifibmbxqnumfnmuqfqnbfccxcmmibnncfqxqmbnunxfcbiixcnnsbbbicnfxixbsifimuubxniqsssnmfbsumqbnnumufbfufmsuunbususffinmsuqxbcbscxsqiuibcimcunnmiffsfmuqunmscnnnufuncncxccnqsmxcqninsfbmfcmcmimqccxxxiuxiubxbbbncsuqnicfmcicxbmcmscqsiiuxqmqciinubnuibqnfmcsmquusiqisimmcsqsbibisxsqbufmnqqbixiinxbmffsqqnixqcqmcscbcssxbxxsxixnbbuxiqsbnsqnmnfcimfsqcsfsqcqsfcxubcxunssbsqcumuunqfbixcmbubsxbxcniusscsnxmimqsfxubxcumifcxfiubnqxqbcmbmmnbfxnfmnfuqbqfuqxsbsnqufubbbfmfbmixfbnxxicxqqxxbiissqqxcsmncffsixxscnififqcuubfsxfcminqmbbnqnbxncqfnusssunnquxnfmffmufiqmmsicqfnfuuufnsiimnfsxnxqnxifscmmfifbcfnbbnfuxxfsuinqcxmifsbbfsqfncqcmmqsbinmxcxxbfqxncmsmfucqiqbbqmuiufxcmsbqnsbumnnscfqxmsnuibxxsqunfxmuiqciufbqnbbqbbqcusffqnccucbssnfsfxbcquxcnfusibbcxcccnfmfbimsmmfmbbnunfiibfibmsfbuquifcqfxqfiiqiximbfibmcumnsxussmuumsqsfcxsinmissfbfmnfbqqmssxisbninxqxscsfubfmcbqmqbbfsfcccfffsnniccmsuunciqscsmmucfifxnxbsqfnunufuxqnxbsmfcisuimqfmqfcmucccfxmqffmicbfxifmcbmxqscssqifiucmiqxxcfsnuisxcisqubfmibfqbbuuqsisufiqcbqxcuunbuuunnqxibiicbxnfsnfsccbuqsfunniqxqubnxcbifimbqubxqcxucnfnsnbxcsfuqusncufsbcnfbnmqmcmxbffqubinucmfxncifmciquscqxubixmbicssmnnibfbcbmnfnnicfunmmcbcusfqqqsfinnnsxcifcxfbsqmuxiuussfmncmmmmbsiqicbbfsxmimbcxnufssxqmubcfifsmfifqfqcfnusxfiufbsixuuusfcqfibxfxxisciuicbnbqmfxncbincixumxcmfbqqqbmfsbqxscqmbcquiinifnsunqmqxfcbcmnmmbsusqmscnuqnnfmsisisfcxfbbnfsifbbunfqufibbqsbnmicbmsmmmxciiqciucxfqcqsifbufmfmfiuscsbbcbnmfcciubxmxmfcubcxbbccscnufcfusubfmxbqnxumiuufqibbccsncifcqmcmqunmnibqsqisiniqqmccmxuiqxnsuxuufuimqbicbqcqicunbnmbifixbunimfcsqffxsbcbmbsicbnnqibufbuinnmixsfqnxbxinqqcfqqfmxssimnmfucxxsxnxfcuqmqiqufsixnuscxfnbnfbqmnbnmqmsmsccxcfibnsxisbnqnnsbqcuxcmnxunfmmmxscuubsquinsiqusbfiumxnbfuixfmnfmfiiqmbfxiqunibbscxcbbuxxscbcqcbimmuiscxqmffqibsqbbbsfxicncunbnqiqsmmfuxxqmucqqunnsumfquqxiumnxqfcusccccsniumuufnssismscqncxqmqsfqbumuisxnicmmcfsnfcnixmmibmnnibufqiqffncqumcbnfxxubiunmbqifsfssxufqmuqfmbsncnnfqcmfxncmxfbunucqinqbuucsbumbciusnbnicbibbbqiubufmnbumisfxuuiufmcmuiubfuqssicmfuqscsbncbbmqmcxucunsucbbcxqfxmnuqunxfbqbnxbxfxmcnbfincnbmffqnxfxbcbiiixbuxcqqcxcbxufxicfqscmmiifsibmcmqxqusnnubsfnqmuiucsmssxmxxsbuiccqnufuibnunnsmqucqicmfsbbnubscbsnmnqnfuicmbqxibqbfbcnquxuxmmccciqmsuusmmcbqmumixcbmmcxnucnqiumxcbfxsxfiimnxibnuxuicmmqsfxbfiuinmmibnbnisqiiscqnbnssnfcqfqsbiqsxxxmcubbusmufnscuxmsnussfuibiixqiqbsmubqnbmsmqmncnfmnuuxmqxcbxnqbfqinnmbquxiqqmniqmxfbqxfcmxcmbfiubbcncffnsnfsmxxmninniscufibnnsfbxuscnbxmqsnfuqbqssbfcfmcqnbmiicusfxnbxnxuicfnxucbciqcinsccbuqbssnsffubicsxuxquscnfcxcqqqcmqfqnxccnbsxnqxsmfscnufbcibbxfbqufffqcuifcqniicsiciqbssfbnncufinbiuxuqfqcsniuucxqxcsfniqnxmqmuncxqfcbbinsfisuxfmmnbcfqbfnuqifuqmqciubssfbufcfuxbicixbfuqbbqxccsqbbbiuussbbufcqqssqfscnqufibcnufqqbncsmnxuucsmfsusqxfxnsniiqxfcxuiqicbimssbxbmmxuminnbbibcbsxnbscsfmmnxmixsqqusfbnxxqfxmubbffqfcuuufcuinbfqsixsibufcciqsscucbfqxsicciubcqunqsibcbnqnbsbixumifuufqsmiufsbscqqisfnufqbmnfbxbsunbumqmcfmmiufnfqucnusuuxqxfuxiffqfsnbfmnqmsmmfmucicxbbnucfufqmxmmnnmfffmiiffsnbqufcccfnisficifucqssqqfqxsbqcciinxsiqniuxmcisqbbcxqmfxcficsfcbfcxfbcmnnmiixuuscqbnuiuquuixbfuqcbuquuuiqixfbbmsbqnqicmcnxsiufqnubuqicfcmisfqximimniiimubmubusxmcxxfnucssibsmxiqcincifxumsxifqixcxcncmmfcncsfxmsnsmunfbfquumbccbniisqfcnnmqbnxnisqxqficmbunnnfimixcqfcbqsfcusbcusfcbcffuuqmsbmfbcnfiiummccnibnbsusbfbbqccbmiimmmmmcxcquxbxqbffbbfxnicsmbqffcuuxbscbsqiqxnbxnnnumiimusxbncnqiqbxnuuxsmuqquqiixmifcsccisxfmfnmmimbnxfcusxbumuunqxfubcfxmsuqcsxfqbxxxuxqxnxsmqcnufquncunuuqsbbffxmnxsfbbfqmcxcibcssqucucxfuxqfcsnbqnsnsimbsbsxcmxncmxxbffsfbfcsqfnmnqnmfficfumbiuqmsiqqxnicfqcnibqbmqbniisbcqmsiscmiinisncfnqisfusccxxxbfcuqcmmqbmxnxmxusnsbicifsusqsusmsqncsiffmnsfxfufxibmfmmqsxbfufsuubsfsxmqxcinfcbmimbccmcqbcfimubfisubxufmbxxnqsxquimsqcqqxccsmmsxsfifqiunqxqncxsnsbfcbqncccssumiiiimbfcunuxnicmcfuqqiuucmufxqqbibcsusnuxfcmfmqquinnnmfminfnibiimcfininffifcnimxmqnxnnubsfsbxsqqfiqnxmmusxsusmqfcbsssuxbxqssqfsbucsixffnnicinsqfbcxubsbqqfuqibxxumsqbiuncscnnuccsuixqnxcimqbmnbibsfnnnqbxxsicufxnfbqnxfmuqfuxifsxifqbsnxsssnibibnfucfcfxfsibsxusbufsxiimmqbcuifbcxmqqsbccqsssuxfsxuqfnmuucmbnxmxnbsbfbqqnnifnmicifmuubmmnbnnxmbqfmxfiimfcmsxfcuubccfbxcbxmibfxqxnimqmmcnuunffufsbnucmuiqfubimqufbxmqqnbiqubisbsfccxcsfcsmfusmucfsxsiisifxuxxbfifnscubccmfqbcmnsbsxsqcufnqbmcficmqfxxisqcmfqniimqmfbsncbqqniinqcnxbxumbmqxiixqbumxsnifsuunfibnmixqscfnbcfxqqqcfsisbxumiqcxnnniiqfxmnmcisfmnixmcnmnxuqimmcsbcffqxnnbumnqfqmnufnbcxbibnfxiuubicnibqissunnufxnsxiiqbsfmcqnfmfuunbmuqscfnbqunssnnxxumnqimnfsixbsbnunmmbbqqqmmsxcnbssquinsnmmqufffqqxmbqcsifxixiunbsummxmmsfuiqnfcfucqnxxbcmsufbfnicccqqcsunfqxqncuubbcbcbucqbxcsbbiiscxbsbnubnicmunbnbsfnqbubffqxxuifxfminmqqnficqfcmqusqbicmnmimicccuffnbnnbqfqusccuqmffmucqqqincsnnsfquuumnbffbufqsbfifnxcifmsssqbmbbqunqsbimxixqbnuquxxnnxfqiisufqbqcxcqmxnubcfqmxnfbufsmxqqxcfuxxbibfxuqquxmuqfbcmxmqbcubnnxibmssmqibbfmnqqiubbqmsfusimcfbbmmixbbfnfqunmcnccsmcnssxssxqxxnnsxcsmncqbfxqbimbuuiumqmxinnxmuqnmubuqbmsmqqxicufbccsxnqmuxifbbmnbnmqxnncqmnumusxnimbnfibqfnmufixuibnnxmxmcibsqmqfmxbufsfnxmfbsnsmsbsfnmfnbnmfxnfxfiumbmsnuxmsbbcunnisnnbuncmbnuiuisfmcnmcsbqcbmbsxuimniiiqxfufqnqibncxbbsnmfusxnnmsuqfuqfuunubmcfuiixfsmxcfcqiuqunmcusucuqxcbmfbfcibusxcfnqfxccffbfuqfcixbfuxmbbfuqcbmsncxuiiuxsninsbsmxnisfuqccifxnnbsnumqiifbixnsbsifsbxscisbfqmuqimmnmfsfssfqnifucincmmcibbiunmxmcfunfxfubqsqncmqfxiuiqcnqcmcmmibcmiufncucmxnmxsxfmiqqxnmmcqnmbsicqmcqbcnfxmfsbuciuscfiuufsqsqixsbxqmqbiqxcxcuncbncbsxniiunmbbmxbiffmxbixqsmisunxnmxbinfuxsbbbiucfuqsfscuuubfxfcfmuffxsxqfxsxisximcfnxsixbbfumxcumxxfbqcinmbsmcuxicqcxmbnqnmnbixcixsubiinmniqscbbnxiqfxscnbqxcifiqxnxcbcxquubcnxnixbbmmfxbcffimmqnmiqqficffbsuissquiiibfuiccnqmqussnsnnfbfxmfqbxmbssssbxmfcffsnnxcnufcsciqnuuusqcifmmqqnnixnqfmqusiquicffxbucxqufsnuusmfbnnncuuqxxfufsqxcfqsinqxcfqmqmnqqsbsiqcqxbqxqscncscmcumxnmuxbcmxbsiiqmiciubmbuuiibuxbsumiubqucsmqmunbfnsnsquqccxnbnqqnmfifqcinucqisxsuqmcsmbsbqnsmxfncbuxmcmunxcqqcbbibscfcxmcmummfqumcbqsmxnmnbsxxixbnuuqfcusbimuuumcqmiqcxqqimbbssscmuimibcnqumsqxissxfnqnuxunibnmusfmximsxnuccmnsxfcbcsqnusmsxmqumnnfbxquisccmxfussccxqsuufiquusbixcuqmuunbmmqbsxmfnfsmmuiqmsbiqbnscquxbqusixqfbiqicbnqmnnfsfcqxsuqmcqbnmibscxqiqcismxnbmqqcinnssxuqqsqsbbxqmnbibusbbbbimsbnsqbcmunnqifbccsbfmuibqxsxxbuqnicicxsfsxmimfiuxbnuiccinxssqmiisqxifsinsbmiuqicmxxxnfqinbumcxsfmsmqsxmicfxcscfqssmbmsfmcxqsncsfcsiincfinfnisiumsixqufiifubnisxsnxfmiqbsufxqxxqqifqbmuxxfcbqcciuqicnscsuiiqiiqxqfncxbmfqcnxumnqnixiqqmfxfmqfunqqixcciuqbfniiffqmbxmmmcmuiincinbixmxmumbmfiqxxsmucumqcffcuffnfsqcmbxxnnbxcxfbmmxfnniqcucfmuufnqsfmfusquiixqnnuqmunbscffnfbxsqbfsuunbquicbxsibcsuixmqbbqmufcxxbncnfccmfquxqfxxscuiqssumxifnfnsuqncnummqbssbqixicfqmxsubqccubqfsxscbsqnuunfncqcbucmxfbsbimbnifsisbqxbmxsuibqnqsqnbnumqxnfqsqbnbmisubmqmqqxcfcxxcnicusqxbcqucsbuxiqsfbqxnxncimcqmsuisubsnixsnifbbcsbiqfcfuimnbbxubmsssxfsixscibqqqicsucuucmqnxmbnfnxqqfmfiqnxxxunqnnbxqqcqsmbbbfnmiqumxnfbnffcfsxqccmunqnumcmuqsfmusxuuxsxcbinqcbimicxusmqbnnqixmfufmmbmcufxbfxfmfuibmqsuuunmxnxisimciubusfmcncqcucfnbfmsmnxqbubsuqxfsmbimqcfcixffqicuuxmcbcsfqmnsxxmfqfqufnubfnciuqcmsxbmmmcxixqcxqbmxnimiubbmxicncsqxfiicnnqiiqbxbqsncsqqbubcicmnisxffnmffqcsbmbixmnubxixciubunscmmmufcusiumsmfqcmxnqncbfxqxbnnbbncisqfmicifbfmiucfcccbnuuxnxbcbscfbismfqcmmcqiumqcfisummcuqqsffccxbiqcmmxbuumquiqxmxnixquxfscnfnuuixxmxcxnfsinbcuuiunscquccfqnbbnmucmsbsfisfuqsmqqqunucccnsqnfcbsfqqunnucsubnbifxfmsumsfmicbifxqbxmiunucmsxqfqcunxmfxufiuqnqxqcbusxqfxqmxqbbmfnbmbbiqbsqqffbqbqmffqfuxusxifnqqsimuqsmfmqsscnxnxsbiuccmmnsmbubimqcumxbisuucmqcscmxqccfnucinqniusicninfqmmxqisuqnxfqcximncncnfcibmnimsfsffnfsfmmbqsfibqsfqfxsxmfmuscxffxusxqufbcqbmfmxmxiiinfcxfcicnxmniqusufqfnsffbmxbbbufsixxfccbxbfbfncxxcqxsqumixcbcmxcfscmbsbxqmcncqfnxsuqncmuxbuunmfinfmmxqmfnnqiniqqmuixmxcqqffsxbmxbmxmixcfmnfuqbxiqcmbssmcfnmqbbmssbucmsunbubqxiqfiucxunnfscfnsnmnncibnciiisnnqsufnmusxninscmmnfcmnxqfcbxxcbicucuuiquxqmmbsnnuqnixnumqfusqxibuiinbiqfqqqffquumbbqbxbuiuuixmxcxcuufqqbffubnmsibqmfmmcfcbfnufnqfinqcumbnqssccbiunqsncsisiqfcixmmqbinisiununqbimcnfniqmqnnxbmcqbsxixuifmxmbmqxsbmfbnicxssqucmqcmxufnqqbsinbucscsxcnifcnmqnnimmnffnbqiuiqibccmcssbbfimnumcxxufuccqfumnuxqsfxsqniquuxuxincfbbqxqbqxbfixbcmciqixcqcbbbnqimxcuufiumxqbsmcsnqmcscxqxbbuuubuxqxcqbfnqbcqmqbxuqqfqnxufxqmbuscxqxnssxqmfxisiufuisbuunisnxnfmiqcsifubsnxcqxmxcuufssqxuxscsbmqsicmmmsccmcibucsxxciufuucmfnncsmfsscbmbqcumffixbbxqffcmcmfsqfuqfuxqsxcnfiucqsniqqiqqfisxcfnbumscxnnmusnsifiiqnsibxuffsfcxqucnbfmunmuuccsuxiqisfuqmmbxxxsxsbfbqfsmuiiqxxqiisfqxsisfnquxbnsbiufubxnxsccscffmcxinqimcfcnnnfcximunumiuxuumfsusxnxfnnxcifbmccqbfssnuuisscqccbncfnnxfcqqbsuccfbfuqusnsusqbcfmxnnsssmmciubqibmmxiqufqqsfxbuunfsifqqbmuqcmnbnqmicqixxxnmiixsiicsqibincunxuxuufscfbibxxficiqnqssiisxfbixqxbmfbumifuficnfmufqmusxcimixcsunusfqcmnmbsnufuqfbxiuqsuminfibqixnqxxbsiqcusuqmbnnmccbmcbqqmiuibnuxufsxnxnqbmsxuimsnbusmxfiinufssixsxibscbsqqfmcnmnfscfcimifsqxnciismxqxqnxqnmumfnnqiqcqfmicqxuxfqcxqncfbucmiccxxfsifncfubsqfsqnnucsmnxsnbccbsnuunxnuniuuxfqsquuuxsnfbsbbbbqbncfifqfibibmqmbsfmxcxfiufnsmmnxsqsmbfcmnfmucncbbiifcmcucfmuiubmxfmmmuuuqmmxbibimcnixsuimccbbcnqxxsmffsbncxqimqbbcqucbusnfbqsfxunmbimbsfbcusufsncnfuxubuiuxnuxuucbiucsixbumxqncmibnqbxfqmqunmuuubssinqimmbibcsunbfcfqsqqfnmffmsnixcfmnniqcxmnbqsxiccbfmmbibsuxcfuixfbfmfqinbqxicunsqnuisxfbfbbbsfmcfnunqbcuiubbxfbiiqcfbnxxqibxunumusqqbixqbsncmqffmmbnnmumumffbsisuifsufscxbxuuumixbxcfcfcmisbqxfqscfcfcfubixqiqbbiscnxiqfucqqmbxsmfnxccnbnsxbciubicxxnbqmsfubfxxxnffcmxbxnnqmbxnssmcisuuxqunqcixbbxncxsxxncfuqnqsusinsbfcimxciximqibmbnnunxcifusfnsnqmsxbunifqmciuqucuxibxbxqqccumbqcxxuuiifsfuucmqmbmuxsubqiuncnimcfufmxiumfnuxubbbxunmxxsfccnifffubxicqnscccbbinqmnnbmcunqqfbxnfcmqxnxiqnbicusiumcqnqsqqmmqiucmfxbmfbxsfxxnmsnbccbifmqfcmuuicufbmfmqfsinfcfffifubnicbffxuxsbfnusnuuiubifxxfcxsumsqmsbnqimmbbsqfqifnscncsixsuixbqsfqmmcqqssmcnqxsbxmbifscfcubqbimnqbbnfscbsbscusuqqncucbsxfxiunfqcqxquqbucbsmxfusfmcmcnxxqxiismxccsxibinnqfiicubnusuqiqqniqxsciuficffsqbbqismuunixnbqqmqfcsxnqnuxffsbnsqqiixciisiuicffnuscsibnnmfxxifsbfqsmxnqucqincmqnmfsqmcfibumnbixfqqfsfsxninfbmxcbfcsfubnibqbubiqmbfubixscsmfqscscsbunsxxfxbxquibmscxiuqbqqsqnuffqxfcxcsinmmnbiixfmmqnqxuqibqiqbcmmmmmficfcnbxisinixnxcmnsfqmfnnxfbiqxqxmcuffnbqumbcincxixufxmxnfqiccsunmcuscbsnbcqmnqnqufcbqmmxmmnbimnmncnqfiibqcfqsmuunsisxbbimsxciqncqiubccnifqfcnifbcmqqbsnqiixmfqqbmifqmqqccqmssmiqqbmcufuiifbfqbisqfmmquiscfsfbqnibssmfiibubifixmxcxsquuicmiqxsqqiusmnbbxniiufubqcmumsbnbxbsxbimmmfusnuiuuxsiqmxfxqxbqncqbnmxcfumfxqmssxuqisqnmmmnxsnnuuqnncuiufbiucusunxmqsuqsufubfsfnxsbcsmxucfixmqucisscfmsmbsuxisfmcsixiusffcxmiunfbmiisqqufcqqifusbqcuniciiqsmmsufcsmmucmibfxbfubiqnnmnnuuissbbqicqfsqxqxfsfqmfcqxxixxnfnxbfumuumbibbuiicnisubuussxbbsqsfuufcfuubfmxunqbfqisfcsxuufuqfnsuibmfcsnbnunicifqmqxisfisqfmsmufncnfmnfsmnbunqiccusiiubxqnusufsusifsxqxisqfubsicqusqbmqnqnicbfcqufxccqqxbbcsmxfuiqicxscsbfcmixxxuqufunibinufxqsbnnuqiciqfucssfnfnsnimsnubsxsbmqncffsqcbimunxniiuufnnxsinxsqxnqqucisnunsfcqxbmmubniismfnunbqmnxbssqfubnxsbmfmxcinmisqcbumifibcnunuuqcsfuscsxmcnqxmsmsxcsbnnsucnfscuxcciuxqfmnismsbcbsbuubqfqinixxmmcnqffiqissbcnsunnqmncmsqufbsfcsixfxbxxfcsummixfiqsbiqfbcxcqfxxsninbnnmbinsqxnbxqquiiqnisufnnqbmbbsqnuquicsqqmxfiqibiqbusxxnqiiqscqbxcnicsqmnsusxsssxbxfbnsbnxqicqqumssbnqmnqxxxqqibmnxuqmnussfiqxqmibqxfcmqmssbmfxxfcmucbsqnmqbmsbcnmuqxmximfnuunbiqbbxucqfcbfixccuimqfqcnbbqxibfmxxqufssxiccmfscmiqciumiqfsmcccccsfnxxnumqbqnbmsiffnnbsismbmmmffqbfxfqccnxnncfimuffbbunsnfifxcxmubmncnsfufqnmubquuqxsnunqqmcuqfmncsnqxcqfxisffisxmuxmfbmfscbiccbcnsfisuqbinncccxiqiuusniqbxsnnsxfbufcncqmnccsqiufnmumbbbscsqxxxxbqsicqmuxusnsisqmnsfqmcsissminbmsqmcnxcbfmnmcfimcxsqqqxxbbmfncubmuqumfciisusmbmiuqqnxmqsimcmbqinsubbbicbbfsnixixicfbqfmxsmuiiiunucuqcfnscsbmmiuqxnxsnnusfsnxmqcsbqmumqsxxncmcmccinsqqqcufssquqncqciquubcnuimuqsmxffmunqiumucxixibsqxffccnciqmnsfxqnuuqcmxiucxcibqccbmimcqixnmmimuxbfmqbfcnxmnqsxsbuibmxuinsbunqbcbsfbqncmqsquqxmucbnbcibqbqicxqfmfcniqxniuuiqsuqicicibnncnsmuncscncmnfsxscxnsmsxcuccbxxnmqqbnnmbbxcsxxnfqcubfnnxuiqccccuqqncbifibnmbqmuummunuumbmfmxcxfbmmssuqnmqqbunxncufxuxqbuqucffcuubunqixxqsfxbxunmumxicfqxicbiqubbcbsmiffcnimfcbxfiifncqqqmiqqsnxifcsnqxfqbuuubbbcbcmcffnifscmnbcnnnbqqisbicqibubcscsxxibqbqnsqxqbmbincququsnmnqbnuifcsqnmcsiinmmfsuqxuqncmsqcfsfqfxibicmmnbxqubxcxxixxnbbbnmubmsmbqcnqnimxsumsucsncixncbfmccbxxssqcmfubxcnucxsmfnxnxxcqmimmbuxqbbqfffqbniimqusinnbicbxcbnciiunqbmxicsfiqbumsxxbnumbcuinqixqmmibxnuncxmnuucmnnbcmsisbciuiifxbnumninsunsfiiuiimqqquxuxnffbfusuusmicbncqmibsfxxqssqimcmmnbcninuxmxiufnmucbscnqsiissqffsmmfqqcisfnbiubufxqxicxffiuicfqqnbqnmxniibxnmsuncnfsfnisuqqnfmbmiuummxqmqusqxiumsbfxifqcciuuimiccsmsbsfbqqsufqxmmmmnnsmnsbunsiissbmfsssfiqimfbuiuubusuxnbfuqbbuubxxmccuxinqfbnnnsuibbqscunxxqxfixqxnuqscccifqbusfuuscsmbucbqqmnuqqfsiscqxsbifqqqxcxqqcuxsnsmufifqfqfcmsqibcfuibqcfbuffbbifcmnnnbcunquisnqmxnnuqsssfsffqfunmmqxnbiqnifnncisfuuibfnbmibsumnqmsxbbmcucmfbufqmqmnmxuxmqumfiqfxcbuquumxiuimqnmfcfcfucnfuqsimubqscusscbbqxfcsxsbimqbscbunxxfiqfbbqqqsmsqcnmnsqxxqbmbmmscfqcqqiffssbnunmcuiubqfiuxixmmmuxnnfbffuufiqsbxbccinxbqqmsfsiusquibsmfcxxxnnbqsciqfsxbxxsfiqmqmbcuuncqnnmxsmqfnxsbxcmusssbussbxunuqnncqscxfsicxibffnfnmniffffxmfubmsbxmqbsnfxxbbimisffcqmcqcuububssmimunnbbqufmbucxufxfqqnbiqnfssccsnssicfcqxmxcnffxifuqcfbxmqmuxqfmisuxxiffqncqqnfmfmbbfxxnmbbxmixnncsfxnqqbcbqqqcsnxquufffcmsiinsximbubfmiucmxuunimumxsmsxmufsmbbuciximqbbfxfsxcucmunfxuqqsbnicqmbusxbnbcnfcmxinsnfbmscubcmcuxcfnciussxmmfmuxqmmxquxxnbffmmbfcxccnfxnnbmxmxibmxufqqfmqfcmfqxfuxsfqfqfnfnqsfuinfnucxbfuimumbmbinqcssxmiufnmxuufmmmbcifnbiifmmbuqmquxxcxunnunubfqxfbxiqifubxxfcbscsfxssmnnsiimxcmscsqsfbiqnnfmbmqxcmbxbsccbixqnxufminnsiccbucfnbuuifiquuuqbqcqbciiincbbucqqumsifnisfqmuibccbcsfqxxbbisssbuqcqfuinsbxciuxsxqnubnqfcfnbmbcqbqnmsbisqfxqfqusfniinmcffnxmxqnncqifbmbfcxbumxbxcxssicbxxnncxisfuxnnbnbfuffmxucnbmbbnsqxqbqbfcqsmffnuiisxunqccncbbbunssxfqbsfbqisnbfbmimnicffnbminiqccinqnqsnbcsnqisbsxbscnsficiciqmxisbubfcnxqisfmcxiibxusbnximibmxunuiubunuubsfbqqfffixqmsfxfqfssciqmmxsxcifffmubfcbfqbnisxxqbnqibfncnxcfmuccicuqffsxmcmfnqufuquxffmqnqnixfnuufiqnfncxfsibfxquiiqsbbbbbsqquxqncbbxffffxqsxmbcqqcmnmfsunuuiufnxixsqfnuciqqxfmbnqqxxubcnisuimqucxbmiuufmcmfqbnibmfbiqquiiuunxxiisuicxnfmcuisxsusbxcmccfbnifcumqicfxumnsuxxcfmqqcxbxibnsxmsciscmfbuqqnssmqxmiiuuinxsuxuibbmfqbcuscbmmbnbmcqnxxcbnfcnccqifmucfisqbqsccuxuxucqnmbqsxmnmxxbusicsccxsxminfqcbqiqnfifisumqccmbbxbccxncsibqmixiscmbffnbixxuixiqfbqmuffxibxnbmxiimmqxfbsnsffxnbnfxqubnfsnumccixbisfcuqmqxqssbbmmqsiqsucssuqmncmumxnnbfcbciiqsicinfcnucxbfbsqsicmmucbusinbbxcumcqmuqxnnicbmismimicsuqixnxiucqbicciqqmxxsbcnucmnnubbbmxunufxxxcnmxfqscxccnsquuimbuusxusqqqqiqcsmqiqcnmixbifxsbqnuunxifixxcsfinfbfucbxuxfniqcbfbbbnicisscffimfcbnfqcixqfibcuqcinufisssqbsiiinsqsnucumxffbfcxuqnnsxcufficxiibqinqqnmmqqunxiusqfsicqsubccffsmxcxucsbcxsnixxcnmibnucxniiubfuxbmccsiucnqbmffmiqcsqxmfufnuiqsiinnqscuufccmiifificbcmiusxqusncfmsqfmqbqfncbiufxssbcuxmxifquucxbqbqxqfnfusmccmsinmmixuumcnscfbbumiunqcnqunmqccsqcsfumxiucxbbcnmfcuquxxbqbbcmiiucmxfusinuucuuibcmucnssmxcsinnmmnxmqnqxiqnxcsnusnuqciqfnmbmxqicmfqmquisibfubmfxcfnfiqbxqfmsbcxbnfbbbncisxmcbnnmxffinmcnmicbmqsqbffmsubqbcxmsmqusqicbnisxcxbfuuifbxcmqimxcqufumqumcbnsmuifcqqmiccbsumussmfiquffmmfqsfsbnmfnfnqfcsnbcbbfnnbufnmbfxxffxiciqiqmmbxfsssniummnsqnxqnssmnffxbunfmxiqsbiqnbnxfmnqmuucccfiifumnbmcxbmnqiqbffqxcmcqfnqbmmuumqqixqcxcnbbxxnxmscscbnsqbccibmmiqffuixuubsbxfbiunsmqbfncxubnxmumcxqbsiufmnxsfxxqqqucxnxqxcbcsmqnubinuixqmbxbqnincucnmqmxsmmqnisixisxscnbmqnibnqufqcbxxubmbfcsbcnuuumssbcfsnnbcxinxfmccxfqbusmsqcusbiuqxuiqfuxsbminubxxuqxbxmnnxbnxsmucbsfxqfmfnqsfsinimfubmnuunxiiqmququcssusmxucxunixisisxucbsiucxnquxbqcnqubumfnmqsbcinumxcbbsfbfnxqcsunbsqscubfnnqnxbmxucmncmxfqmbfmsuibffqxxnmcsxuuibcbnumcbbibbnqquqbfibqcffbsuqiucnuqsisbmuxqnqsnqbufqqmfxqnimqnxqsbxuxqnqsmnbqibssccbnssbuibqccbmmbsbqimicfiiqqiumnqibnnfiusxnxbqxxfsxinnxfbsbqmicmnqsqmibsfsbfssfsnbqssmxbffmifiuuufxcqmbnifffnnbunqqcinbxxqxifsbfcufiumnbxciixusbqmbqcsixiimcbnbuisfmqqbunnuqqisxfcbffcuusiscxnmnsfuqnnnqcqxfmxbcfbbimscuifbufiuquqcqmmumnqqxinfxxqsqicsiscfbiqniunimxqqxmqbxmmcixicuqncsmmfifiqfisfxucbmnimibsfnmuuumbnsxfmxcscfuscuusqcfcmmnccuscqqnnciqcfqiqusncnsicsbsqxucfxcibcbsqsxmccqcqbfxfsmnbimccqsxnqfnfcfmbqmxmmbibfqqxubbmuqqxxummmxumcibiscsfnmubfbuqcmbnbfiqmfqnsncbcbnsxffsusssbixsnfimnfsfcisssnscqsbuqfmuqqfxxmnnqbqfxsxuccfsunuinqiqmqiiinxxfqmmnsninbfxxiqxibnmqqmnffmxbbuqiinxqsxcxxxxibciufbnsquqmuxmmsusmnunxfnixuxbmbxubiisxmqinubuisusmcfncbxxmqunuccnmuxcuxubbsfncsqsfxfmnccbxfbcsimqmqnxfqqqnfmxisinfmmsnibxffumxfbsfsssiuiqqnfbufqusxfxcnsbfmxufmxibinnnmbqqxnsinsxcfbmfqqncncfunbiccqufcxxmnubnumbmxnqsuxccqfsqmfcqbnxsixfqfbbincinqmfqsfincsxqunmnnbmbnbcqsuxmxnciuqbufmxfuuucccqxmccuxqfcxniuqsfbuccnsmcxqbsicnnxxsnbnmcnunmsmcuqnxbxsnbnmmiuxbmxmixbuixnsxmbcmcuinxciinsfmfcqufxucnqnbcbbnibsicnfxqmxfqmfbuiqnixfibufqncbufxqumximqbssimsnbiufsbqmbibbbscqncsscuqmbifmcbqmnsqnicbxibnxbisiinmqfnmibbsubqsincbcqbxfmbnxnubqufbbununqbfuxmumfssxffunfxqxfmqqubxbbummbmsqssufsmbiiqismxfsfinbnciuqbbucscbbbmunxcisbqsqissqbmfsqmcqfxfuumsbsbmbubffubcuxmuuxsbufuxuicmqunxisffqbmibubqbbxsbisfsssfnifiissccfxcfbmmnxquxxqbbxfiuiubumfbsbiuffsxnsqxumnnufumsiqbusciqincisfcuncqxubcqsiqsnmcmcqicscnssxbimxsbsbffqsnxsbfquuiiqsxsmsxxfnxquxixmmcnnmimncsquissxbbfnxccfxnnmmuxxnscunnxcxxqbxmfbnmufsusfbxumbbmumiuxmbunxifsquqsbmsicbfnnfxmmnciqqmsbcmquunnmciniifsfcxcffcssfcnxfbuffffsuxbcnnqxqxiinmuixcuccmxsisqfcqncsbixqqqniscufnismscfxucmqisuibnuqnuifscnqqnmfqsucsmxsufmxmxnnxqxusuxqusucbmfbbbfinuuxqfnnnmbsbffmnmcfsqxixsumufcuqfuxxsxiscnnxfscsuuqixfnnbuxmmsqxmbbqmcsmbqfmunucucsxixibsqccificcufnuusbxmcbssuxqfbcqqmcisqqicxqsqsbbqbbcmmmxxsmsfnffmufxfmnfmfqficmxicicuiubsfxfxfibbcucmsbxqsbnuqufmuniqccubsufimfqbmnnnsmifqqisubqfsuuxssniqicffscnqsuccsbufnmufqncxcifsbiqfciqbquibbsiixqbqfuuqsuxiifiiicbqicisbcqbffnbmqcfisxnfsxsfcsmixxfinbxmqfqxiquuciqqcxusmmsbubsumcbqfxfmbcqfcqxnqsqbqqsmfmmbumqmfxnqnunnqicibsnqufifnuubqcmxbbcbxmqxuqxxqxbxnsbsbcubfxqfqffibiissmsmxqxmqnsfnmmissmfnmqmxfxucccsuxqfbqifbbxfxfqninxmcfuqnsqxcfiufiubbinxnufibfbxfmcxcxfcmsmcqnxfbfuuuninfcbscfsxxbcbximifxubucbsfuquibuiuxsfxxcqxnsunscmsuifsfiisfuuiiixxmssmuqqmbunqsmqnusmiubximcnqsbcxuuqqnnxbibnsqfiiiusnqncufqqnicusfnmqmssqsnsqsnncbncxnnxbnncbsninfqssxxbsiccsqnincnunsnqcmqmqcsufincxsimiiufnicqmimcmuisisqufsxqixxubinbmnqnncsmscbiisxmcqfbqmqifuxfcnimniqbncfcusqbqxqxiubbmnfsinnisfbcnbuimnsfbimmbusiqqcsfqcfsnqmmcimqxicqsqbxqsmfbunsfnixfufscmiubuccxbsxmxxsnunqcscqnmuqsqisxxcunfqufncumixsmccuccincxnussqnnxmsmbixffnbbbcbibqfbnfbuscsissfnfucqmsibiqscmxcxuncqixfxbixqmmqqbcmqqiiqcfxmnbinqsmbcbusfxxxubmxbixfbiiccxbbnixibbniucumfxsmnunuubuismxmbcmmmubxumxinnxfcsmnqbufuxfqfsqsmficinqqnfuubiqncmimnxfusmfcnbiusqunqcbnbxuxnsxiuxqmfmbfumfmncufumsqqibqxnisxfmusfcfqinfsxqfsscxxqqxbxmiuuifsqcxncquuunuxnnxnbnscsbxqnisqcmncnnqfcucunuxbfmisfcqmmmqfmqisisfnbnnqsmsuxcfuqxfcxsqunfbnsixcumnmmiicssfiimxxxbumnsiimmfqusimubixcqnxfsnqnfnnuuxsfmfxqimxxbfffciqicsbbfcxumuqnfuuixxbumnfsbnnxcxcxuifcixcfumnimiuumxiucbxcsbuicssmcbmsmqfnmiufuimucifffnsiisbbfmcnfixuqsmxxciqcbufnxuiqbsxmninxcxifucqfimbuunnmbbficmsmbuuncnsuuisubsufbsqnncixsuusfmqmufumsiuxxbfcinqqsbbmbcqmncccubqcqnqicmbbicmssiqqqnmuuuxbmfxfnmsnqqxsbfbfsbumxbnnnuqxxbbbnsfixxifxcmnciimismsqsbqnxsniimqbnuuumcsnsfxmucbnsfmmmiscxufusnumnxnucccbxmqncqiqfsbxnbxxisqmmximcxibxubqinuiisxxxbisxfsfixinqbsunisbxsfcssnfscfbscibxqcbcbmumusqnixxnfmiumqsnmfsqqffxbsnmmfimiufquibxnisqsmxibcsbuubcxfsccxquusnsnfcfcbubsqfumismmxbfnfqfsnqixibmbnqfsqfxbxmnsnxsuumcqmmqqxqfcniqsqmxsmimuffmisxcfxibmnqxnnmcuusnuixssxmbbbismmfmixqixmqxqbniquixusmqbnxmscnsiqncmminnmbnfxunissmunmquxcinubmxsbicquixfcfsmcqcfxbscfqnxsiusfibiiunsqinquunsqnmbfssscusnimsfisffxumifbincninxcxsumufunmmisbuxcfqsumbmbqucxbxcbbixcxiumuibuqqqmcmxifxqicsqqixxnminimbnnmfnufbxsnbuunucbubfbfxxmsubmuxxfqxqqbinsbbbunfuqsmcqcnuqsmuuniincnxuqcmficifbxxicixuqmcsmnuibccimssbsbmunbfnicnxxbqbqsbsbufsfsmsxnbxqsuumnqxiffsnqnxqsxicmnuqnsnfmxncnsxbniummbqbqmbfqbffsniiqbbuqnfussiqxicfxuuqiisxufsnxfmqixsbxxumsmqsincfmsxibcqxqmqssffifmmmmbxbsisxxmfsxmficnumuqsqsisisqnbmisuccbusfqfcbbunxbucnbffcccnqiincimmfmnbsbqcuibsfqxqnbcciqxixmixfccxfqxnuiqnsiqsbxnnmfnqsqxsimbnmfsmfffqucnsnufxscxqbmqsqnmqqnumuinbnuqbibsnimufxbxunsscsqqbcsiimfunsiqsxssmscxmmsifniusfsnsmqcciciimbisicsixnfsmsffiquxccnquscxuciiisnbmfibfcicbxxucnixbmubffcmnsnmcmqmmuufxmqufimcbsnffqfnufqumcbmfmiicbcuqqfbuiusucqsfcunuqiumxbimuimbcfqnqquxxbnsiqubxbsiqqfuinnumqnfssuiffqbuiucciicucqsucfqubbfqbqbuifiqincsqxbsbcfiuubbxnfiufximfnxiicsxucbbsquxinbccbixmncxbfnsffncubqmsfcinuicsmcfbxmnxbunmxfimqbnnucfmbibqfufnsxsbciibibnbubqxsbmxsmcmfccfuqbusixxcibbuffimisusbscmqcsisxccsssnixiiiqqfbmmussncsbxmqsibmbuqnxbbfqcunsqsscnqcbumnfxqmnuimmcxcuxfxfqnisqimbcmqunmmsnnmxfmsmcimxnsbxumbqxqnnucbqcqncmucmxcqcccnfqmcmximumqqcffcnnmnsibbsfcuunsquncqsbssuisfiunqicbfbmxcfxsinixxcccbnqbcccbixnquqfxuqqmufccxuqcucquuxsumnubsxqqxibmmxfnfcsqbxibqumfqcnnqqqsubxmnicnsqfbqnimqsmsufiisxscucqxqxmbnmxmcfqmunixinxuuinsbxfqbfcxiucbiqqfbixffbqqfinqxmfmifbnibxnbncxfffmixnusuumnqqmncmcbxnqfubqxcxmxnqucqfffxnuqufcbcqbcubmcqficnxiuimumuunccsbfxiqbbcbiqmfufiusnumsqusqsifxuumbsxunbnuimibsxcxcsbuxccquxxcbbfqubqcccufsunfsisxnbxbncmsssxnuffiquimiccfmqcnsmnsuubusbcfsbiuqmqmnfscifiqsnbxnbnisbubcuxfmmqbsqicubbcnimxmibxbcfcfcxsmunfnqfuxcqsxqfmbbqbsmnqnnifscxbmsiqnbximuimcibbcbmifuqxusumqqbnfxsqqfxncxbbqquibxinucqscfcbuuqfsqinucquncqfmcncfxinqncccfcnqccficbfqqqbubinmsmqxqusmicsunnfscfbmnxcxiqsubxbcnnxsqncixxffusqnqsqubbfsbusuumqmibuuxqxqbbncnxqqxqqxfmubminxifbciqbffuqcsbfnsqsinmcxuimnbiifnxnmcqsicuiuuiifnicmmusqscbbqbxbmfsifqiuxmxxcncxsufmuqissmmbumuqbnxsxbixmbqnufsbnusqqxbsubsmxciisxsnfufffsuifuimmnqmcnffxcfuqxqinsnnqncqxqfcmcnubsqqsqxmxfxqxnxnsxbscufunxmbxqnfccuimiqumccixsxinnxqnmnqqmimsqbbnufcsnbbmsfbbmnnifqinibnsfniqniuuqqcbisxmqqnfbxquffqbibsbbqncnsifixbbncqnfmuusqxsciucsfmqfffunbuuibnbcbcnuiuncqfbccimsmmnbcmfmfsiqismcmmbccfsfiiqbbixbximnimfbuinbqnqusqibufffuscbbcmiqcffnbmcqiuuquxcsbnscqnqmniqnufuccuncxmmissquuqfiqquccxqiisbbqunqnsmbnuumxbmqxifuqfxbqunxsuccxuccnufqfnicbusubqxmibcbnmfffbmuiicxuibubffqbumqnbssunxfqssbciiffsxncsmsnccxxmncxmimnsxxmcmsbnmffficunqqiimcnmqqsfquqbmcbqsqcbbqmbuqmnsfxnqifiqbcubsbcubunxcnmiibxqfnsibciuqbcmsscnsnisiuuimsfxnuiuinccmfnfqqmbsuunnqfcnixnucbmusinsfuqnmubxuubcbifmmubmfsbqsqfuuimmucubsfcmsssbnqmqfmmfssnmbnxcxcfbnbcxnxfsfsbmsmqxsimbmcqmxmbiqubuubimqxxnxisnfcbmuifiqcisficnfncuiqbiqbbnfmcbmbfmqqifqbmufsixmbixmbmnuffnxbfsqqscscsffiqciqsxuqmcmbxiffqnisunmqmncsfmfqqismiunqxqmmfxxbqfnbmiinsinbqsiibucqssxummmcqucifuiscsmmcfbfximcxqfxfufqbnsqnsqfscuicccqmqmqcmxiumbiuuxmmnmcsmmsqsisbquxuxcxsnqssxsqnxsiuxmccnsqxfmcxxmcmqqcssfnbcufsssmuibcuxxfbunsnbqicnimimmfxbfsfqxicqncqbnxuqnqicfqusixuiusinnnumnnqficiuiiqufuucmbsnxcxbquxscsmsxbinscunufmsbuxqmiqscqmnnfxixibbqfmbsmmnmfqbscibsuxixfqcfsfumcxiicbbunxuxnnxsfbiuisbbbbicxnxiqqbfinfmfxssufqmbnnfxniccmnmxmnniifnqiuibcqfcnfxubucnnufxbimbsmsfqmixqqffxfucfsmsicsiqcsbufumxiuqbmiufqmbmxbifxfcxissbncsncqnbmbcsnccssfqcibxbuumsuimxnsnmbmuqnuixxbsbqqubbbcufunnqfnminbcxcmsnqifquimcfxsqicuxmfibibbxnucsfunxuffcicisquxxfqiuuumbbxxqmqfcnnbncxsibqcssixucnmnxbnixxiiuiqcbmssusqnfuxsbxnnnnnsffbbscfqxcxnmmqbcxxiscxnssssxbbsxfuxqnqniuifmsunmusninbsixbinmfcniiqmsxifimnfbsqbfnsfuxqfcnnibmxssxqnqmiqcsbfcsmmmiuffuibcqicuffcxcqsnxcbqbnnmmnmfxxnuibmqccqnmxxfqumquniuscfqbcqfsbuqnbiniuxciqfcffscfmiuinxqccxiqqxsbifmxnffbxqxixmxfsfccnbfuqfuccbiccnuiqqqxqiimcqummxccnuucininnbucqffxmuibfnqbxfninumuubsccbnbsfixusqmmqxmffmufmnxnfxscbufifmqbusqsxbnbmcuimcccmnmsusmqqcmbuqqcucimsffuusmcqquismixbfsisqsffbufissiccnsiffmuxmiuxcsmfbxbbcmbnccbsfnfussqninxxxmixcbnfmssbubxbbminuqunuqxffubnbmqucxmxqsmfcbbbcfiffqcinbixsqcxncsmsucnbmbnqnnumuqcuxuxcccnuqbnmfifxiuqsuuimfcicufmsiqcfnxbqbxfqqnnmimnxsmfsiuccnuqufbnbnxmqucqfxmisbbnbfuiuqunciiscnbnicxibbnqqiqqfibmfbisuqfcuuuxuuffiquxfiixqsssscfmniubqbssbisfmsuiubsmnmmqnimsiuxminnfnfnuxifufcnmmcbxmqifquiqcbxinnqumnqcbcccfcqufimqxxfmscnqnfnsifbsnicfxnxfbiiuimuucsnnmmcfusfffuscsqcuisxsxbcmxmqfusicqsxqfnxnbcmmssbssinqnxbqbbqffxqfusssiqicnqfnssuscfcmmqqfcbbbqqqcuxfbcqcbbmcniffxxxqubsxnixsbcxnmisbimsqfqcinsmnuiqnfcfcbbmbxcbsbxnmfusqfmsxuuinxuiqxxuucmxxffiqmqfxmqunsmnbsnnmniiufxbixmuxbcciqibumbifsfubsuqunssnbbfqncsfnnbmuixmfbxffffiqqcimqnxfbxcixcuxmfuibcfuxfixncbiqbsffmssxusnfnxnqsbifbnnuunsbfufbxufmsmcmnisiscxunbisbiqnbsmnmcnfxxbbiucsusubbqmimfucfmixxnfxqciqixunscnxxmxbscbnnqibnnqbsquqixsisqnfqxqxsuuuquuuqcscxmmfqssffbcbicfifbbsxxbfnfxsufcffmsfcqxsumxnuqxfuuixnnbqbsuxmsbixmmsisfxiiqxxssxbbbbbfqsqxuqusbsqmufqncqcisnmsqsfqmnuqubufmbfxxxqunsfnnixfmsfsfscufbibfsnfmussqsfisbbsuuqfnxnnbqmnmssbcqinccccxcfsbcxnuqmisnsxsuxfbcfqqqumqxbqsqbuqcxfbifbifimbninmufnimsixuqqccnbcxqxisffsnfcqbumcbmfsffcbisxsbbciccmsxfxfcqqbiquqnfinfmbunnnsiixiiinumcsufnisisuxcixxcxfsfnffsmimumccnfxcbcinnnbcqxuimnnsmxmsnqxqxubibsqfbbsnnfxuxffisuiubmqmcxmnuufmimmffbssxciusqiufmqqcsqibuxfbbiuqbxixmsinqqsussibisnxfcbfbqbcssufmuciumbusxxfxmuubmufnnqcbsxcmmcmumcfmxxixxbfxsffiqnnxiqbixxbcnnmbnmfnbqinncbcbbuxininuiumsxmfiqsssqsfuqucibccificsimicxcuxsxfqibmnsicismucnmbnmxnbxbnnqicimmuuxccbcimsxumnicxibismsusicuscxcuufquuqsmccuiunmqcxmcincusubxmffmuqibsqmufmisxcfqquufbmsnuqnbcibxsqiubcfmmxffmmiubscicimxnqmmcsqubcnbqfxnnuiqcnqmnnnqninubfixmxmissxqibsnqiffifuqcifbmmsucumufisfbfmiixbbqmxuicfffsmmfqnqccfiqcsbbnqfsbqxcfxmnfnifxsububufffiquumucnimcbxcqcnqfqmfcfunbsxmxmciscqmmnuuuuusqqfmuqnbbbmqsxqimucqbnqumubiqnfqqqcxunibxxcsbqisixisicxiufuuqcfuxcsmcnsxfibuxmquxuqqicbbsfbuubxifqffcssffifcfucxsscusxxcxfbsbqbinsbxmsnsmqixsxifufbsscqfbqcsciiqixnixuscfbcisxnbqminnbbqxsfimcqmuscmnsbiqixnsmqxsmsbqxfcxfxusxsnusqbxfnbmfcqnxmmbmfqqbqqfxsbfcnmqniisnbssmunfismxnqxcnmmuxbxqmxmiibbnnfcqifbnuffsnnusxcmbibqbssxbqxssiimxncnufciiucqqnfnxsfmbusunnxuuixccnnmifcuncqifxcqcxncniuxffxqismbxxfmiinsxnnsqbffqncxnbiqsbsbmqbiimmbfcxcmqncxuuxxmmnbqqbxqfubminnifbfcxiiuqncibncncucmcusmbqxnqniuqcsnmifffmqibiqucqibxusqnxisnsqsxfssfinsmnsmfmmqfifxxunxbmmuxfsscxuucxffqqimcqmsubuuxnfcqcmmfxbxibiisqubximmsnscqqbsfuxxusiubmmxqiqufnfqbnfbsbsucicumimfuqusnsbxnxmcqxiniqqmbsuuicxixffcbfxxsqmmniunuqxxmbuibcnsfsfxfuisbbufubucxxmnmmusqsxfscnmxuqcufcccsuxibquimbcsuxibibcmcmsxuinmuncummmmfxcbsicqfmcqqccbxuqbnnusmqbisfuixbximxqsnqfbnufcfqmqqxxbiccxqiqsssxqsbsunbiibmbxnimffiuqbufbnmfifiscqfumfffsqbbmmnbsssnsiiiuniqnssiquxccmqxcmbxuxfnuxubuubcbcqnfiiuumscxsinmbmbxcxuqisbcmffxsxmixnxmuiifxuscqiccsisbsmmummxuixsmxnfmnixfinsscmfixmucusfuumisqnuccbnsmfxnnfbxisnqnmnxcncmxfxmccbuxcsmbiqqmxqucfnubqnubiqbnxfsubcbqfmnbbcinniqqbsnmssixccqqqixmqsmxbcuxnfnfnucsmxqsxcxxsqsinqnscmbbunbnqnicubqsfsmxuqqsufqnnfcniusmqmscmxsfunisquxmiqcnssxfubximisiqunxfxnqxxiusiifxifnuxnuffbfbfbnbbuqusufqxiuimsuqiibxufuqucfbufnsnfmncfscqnncqmcfuncsmuninfsqniqmbismbbnxnifqsfnqfcqnnucqxununcsnqbcxinucnbincimsfcxiusunqumcnnuifsubufnsxxcnmbxnuixqcmiqbxffncxcisuqiqfnfmiifbsmxqifnmcssqbcbfucxquxcbufbnxfiifiicxxbfiisuuxsmqibffiscxxfnsquibsmmsquxfxnsfbqnfxxxnuixcmbnfinnqusibfisciimibxiubxcxuxmuifxbuqmqbxnnisiicmcqisqsxuffibibicsiqfqcfsxmxucqbibccffxbbcufcbibbbnxbnbiiiixnicsfbqunqmmfuccfqmbxubsmussicxmfbbqnbbcsqmfxficxuxsmxqsscufcmicbixmcbqbicxfxfnxcqxxqxbcxsffuncnsfxcqxmufxsmqbciibnffqfqmcfcnmsncscnmisiifnbnuqccfcxbqnxciqifcqqmsiqsmxxnssnfbmmcinbuqbuinbubcxfbcnbxumnqsxmuiifqunbcsxssbssnxmmccfcficqqxfcmbiccfmufibcscsnsicfuunucssimixnuiqiqccqnfqximiuqixfcmucqinuunmcucuunsxfxibxinfqmqcncxxbuinscnqiinfqnnfsqubnuicqxicmffnubccbmuxxucfmsxffuuqmixccmbcxmmxffmimnxcsissmsubsfmmcuiniccuqiscuqifmuubfuunnsxmfsfnbxcmqicsqncnusuxuqmfxubufqmnfcbmsiufcfiqbqffsxbfxbbsfucqnnxxcusmnsinnfcifsusfbsncfbbubxxbmibsqqiisqubcfsffsunbsnmuunbmuxsqumqnxciqcmunfciumxxcfnbxmquxmcnsmxmxusnuisbbxsqfxsucmncsnqfbuxcnsnxnfcbncsnnussbqcuinusbqmbcusbsssfnnqqinsiqqfifqcsifununfsqnqbqbxnsmxmuiiunncbfqbimssxcxsquxnxbcusuqfifbuinsqqxfbmnmqinbsimufmimicxfnfuxxnciiumfcxubmbsbfifuqsfubxfiimumbqxuicnnqqnbsimnunbcqxufnxsquufxcfmbissuuixucfmsnxicqqxqqunbficixqncnfscinfxumxqccmsubxmqxnnsxbscibqnxsnxififsmnxninmssnmmiisuniisifminbxscbxcnbxbbfismiincsbcnicfqiifnmfsxuufcuxcuxmqmfsimciibbmnfsbfubbbfcnqsnuuiqxscbmmibxmqxisfxifxxincsbncicqqxsqqxsfuiuumubbbmssbibmusbbcubqbfxffxqxqbbmnximnfnqubmmfcfcbfmqfmibcsfxinqsfssmiccbqufcmiuixicbxqibccsfnsfnxbbnubsumiicummqquxfmuxfibxiscimfnisbqucfxqmunxbcsfsfnqxfnffmiqsicsmimnnmxfqnbqunummcfxiubfbbccbsmcxsxunssicifscqbsxsiuuccxunqmqsfucsmiiusfbmscumqfnxbqbbsfbxcbbnqxusbcnxmnxqcmsimnimsqnufnqfbsfssiunccqscuficbqsnbcmcfxnxccmnnmucubunicxqmqimmiubmsscmisinfuqmnnbqininqisbuxsxssxmsfubscinsfufbfmfsqubixibbcmmciqmqqusbqfnmbucsmsxbqbnifibqbxxxbsiccsbnbicfxifmisixmquiqnscifubmxquxbnfccmxmiiqcuucbqsxnfqfbqxufxmqnsssumisxmnmmcibmucicficsfcxmsmmuncqbuimmcsmbcqbmnxmuiqsxuxisfsfubcbxbmfbsifsmbmnfxxmbquuxnfmxxbsmnfcumnqqccuufsqixmbmfubsiqsfsufxncixufuqmcnmmxnfbbqxusiqqmbnsissmcqmmsfuuimnmmiqunxnunxxcbbusuifsqqciicmbbqcssfqbxsxnuusbbibbcscqisfssbnxmqbqcbfxifbfscimnqfnxifbbfcqnifusucimnbimuncquxxubmmcxfnuqnqccifsciqmnnufisbcfxcnqcbcmmcsissmbmqqcfbqmbcxixqimssnssbxifbqcmsnffnmqqmnixsqnbuxmbucmmfnbqfqqmsfmusiimuxmfmunbmxbsfuqqmqxbsbqxnicfbmicbqufqiumnbnbnnxcfissfscfuncfibsncsnfbiqfcmnfiixxcbnbsusismuimxxfxsxqiqibqiuimusiqfsinssxqbcnbnssfqnuimsciqmnfsiiiucxusqsnicumssnmumnqcmusbnifmumcmmnqcqsqscfubbfxqcmxibifsxbbbnubqsssxxxbufsufnbsnunxsuqqinnbcfxfbqixifumccsxcmfxncumfmubmxnsxxnmsxnfmmfcciixmisuumqqusqnfqxfsnbcfiuimsiiqqubixiuxfbcuquicnqsbimqxccqicnmqcfmnibxnbunmsxquuqbsxmnxnbmxcmibbxsxssbqfuqfuxxcibmfcmfiimxfbumusbxsqucmxsbcxucqsqmcuuiimucfqmunnissbbsbcbqbicfuuqqfqcxsququfbcbscxmxmsnbcxinxbbbcnfibinqufqficxsxusxuscmcnbcxcucfcmcscfcisnbqbfixnqmqiusmfbmbisicbbfxqcqimbcsubfibnbifxcbnbiifxmxqcbiumbfcnfucnifcxuqcsibcbucfqnbscunsqfqibsbfnmisnunbqixmfsbmsbfiuxxfbssmiqccfmqismuibmcbnqccxmssfinbfsxucbxnfscnxxmiubqbqqfcfuxixfmmffinnbuxicnnqbunicxnxqccffmsiismqcscqqfnqifxncmiimxsnmcicqnuxqqfsxubqmnxbfcmmcbnffmuqxssssbxibmbuqmniifncqxnnucqsubnfqnbuismsmuscbifquifcxiniqmmcqusqiiccuinmbqbxmnmcinnsufubuibubnmnufmbminnfmsxcqncmcsnusubcfnmunbiiisicximsunsibciqcuffnfimubmcubfnfcccbsmmcmsbufcbcmxcubssmmcbnsxcusnnufbxbqisbqnfufqqbimqffcxccxsxnsniqqmcnunsncfbqibuqxnfxfsfmmuinmmisquiixmfmbsuxxiscixcsiibxmccbqxfquifffmixnusnmfcubxqfsmbxnqbccfffxnfxumbbbiubuiqbmsxxmxxmccfbuxubumsbqqcfubfuibscqimsuxqufusiuuqnnmxsminmmbmisqfscmfufuquibiicqmuisusqfnmqfcimbqqisbmnxfcfbqsimcubfcxcxncqbncnmfmqmqqnfcxxsbnfxuifqmcxfmbsfqxxufssfbbbfiuccbmbccucsmumqsxxxnbqcbmfiniixbscbqfiqicsxsqmfffqffimqifmiufnsxccsqcmsmbmiiscbsnbnmmfcqxumnibusbnfsuiubbismsimisxubsbncxmfbfmbuqqmbfbqxmfqufssbsiqbmxbucmsqmqnxmininufsqicifnfmixquqbqbiifcmibmcbcfsmmubnbqmuiiqnuuqimsufsumnssniqbsqqcisnxqmuixmfnmqxnxxfqqmuxqcbfqiqqmcsfmnbfbsnucfcqfbfsnnqncxsbbixcnqmfnnqxxbbuqsbbiqfnmiqicxbsiqmcibnqbuqqbnncnxsscmfbxuqcqsssmifnunxqimqbunucbfiummsuqfimbqcuucinmcsciucnuqbnqqqbmuscfqunqsqiiusmifumubqxfffxcnbciiunnxsbxqqismsbsminucnuxnumsqiismicxcusiusffnxiquxbsifqfimnufxifnxuufinucnmuimfsbqcxffxxbsumcfxnbnmfnsxnxqxcqxuqqunbqnffibxnnxqmfcsnxcsnxinccufscbssiusnunxmnucqncffbxibfufnusuxfmnmsuncbbqccsbfmibufqfqbmcbnuminsqnsfiiumbibcsufbciqbifcsubxufximuciixcbfxnciiffsicsxfmqsnunuicniccbuifquncbixnxbnsccssqmimxcumxbnimuscbmmxnnxsmibnubcmqqsuussisbuqxsfbcxxsxucxbnqfxbcnnicnmmsmifffxsixffqfbiuqixxcsmnfmbifixqmmmmiunqbmxqinbbxncuuqqnumxqnqqfsnqmsbfmmxqffcibxsfmcibubnxxmfumifnxmmubucfquxsicmuxcunxuunmfuuxsmnnumiuuxmuqmxmqmicsifqmxnffxfuqiumfxbmxifsfxibuncnsixicqxcmmunncfuqnqxnmciqcfbnbmfxncxuqsxmmmqcmcibusifbsbsmqsfxbbbsnnsfmnninncminiqxquiqucmnxixfiiscxfucmfmuibiisbcnuxcnxbbqqssfmubiuqbubxxuifbbisxfsxmnsmbbcniuusnsuunfsqfsxusbbnxmnnbqxcinisnnnnuucmfuqbmiffmnmsnxnsbuccfsuiubifxxmfsqquucmqqfsqffxqbbqnsuqmixicxbbnbqfumcnsmsfnqxbqiinimqqfmicsnbsffufinfubqxuxsnfcfxuubxfncuqnxssxmnfcxsuxsxmqnnnicbxsnqsismnbssimuqbumubqxxucfccbqcnbbsfbcqqibffqnnscxnsqmcfumxbquimxmmimcxcinuffncmnxqumqfmnumqbxqsfbqmmiunuunimuxnmiqbucicsunbfxmcuiufffisbxmqbnsqffusixquinqfsuqsfbqqsxmcqssmsccfuinqxsixiiixifnbqfmbqbccscncffxbnsicmxfiqbsumxscxcxusnsqxiuxcmmuxmqquqfsibisqfmfqcbibinsfcmnbfnfmcxusbucmsibcnnfxccxbbnbiufffxunxubbxiixnnxcscibusbbucncfnnbqsufcimmsqnifsfssimbbbqfbnqcfumxquqxfnuscfbmuniixcffisqcqxccmisffiqnqnbccmncbffnbsqncmfifffiusbqcnuqmibuuuuqbmiqfsnmbxisnnbifccufsxfxbbfnuquincnxfniqcsfbxcqcxicnuimqqcsmbuccsnbxcbqxqfmmbxnuiiffnfnmxbcxcfnmbcxunxifiixcfbfnbxbmxqfmfunnuqbibxuuucnsixqxmunqxqnbqnfcuinnnxbsubfmfmxisqxxssxbbfifxxqnqncxcbxnfmfqbmbifbixsqcuxsxbqxicnnuqfsqinminfqmicuiuqcnuixbnssinqxibmqcsincnciiixsssxqnqcqqunbnsuuqxcusxqcqqcimiumcqsfucxfqsxbxbsfuqxxqbbbiinbcqmfmibfinxuufnixxfqimuqfssfqiqxcnffxcmmffumfminufcciqxmxusnficsiffcfmbscuxixubmcsbbfxumsfisicimnuxxnnmxicunmmifuiqfbfxsussbxinqxbusnxnuxnxbsuuuisumifsmxcmnqsiqqmiibsmisxsfbnsbnxmmmcxbusmsmufiqbfixqxssbnxqfscsixinbxnufcucsnussmqsifsfqiifcciimcuqxmsxxsuumfbixnscxqifiisfbiumnmcqqxcsbuuiunqqubfmqqimufibmmuqbibmmcnsnbcibsnuqqssffsnfxscqucnxsfufifubfxcfmnqnqxxubfsiuquusiunsixffssfbfiqfmmicxmbnibixsxqbnmxmusbuubuixnbciicbnbsmqmsiuuibsqxcufsbsxqiccccxmxummfiinsnbqqsuxsnuqqbnfnbbqquqxbiumnqssmxffnsmmuqssxxcmibuncsffcsnnbbcfcnmuucquscmsscimusumnqqbbsmubnxcubqqubxiuqixfmsuqsuuxqncccbsimqcinuiffmufcnxfifnxncqibxnmfxfcufmnqnfbiunnnsxsnqfnxumxbnubniqbicfcsfxfibqixsbiniciunuxfxubunumiibincusfffixnsbxcbcuumfuxnbxqbiuunccnbmbsbfmubixfnicbsnsuuscxbquqibcubsnuuubuuqcqsusfqubssqsncnsufqxbmqbiqxsssxmmccbmiubussixqsnbxmmnuffusuuscxnscqbusqciibimxscfxxnccbxnqqfqsibnbbbscbncsqcbqsusfufqbfbxixbqusbubxmmsfnnscfmmsfmqbciifcicnqfccicxssccmcsuicqifinfunfsnmxqcbbbfcfsbsufcqxfuxussmxnnssbcfuqfficxbbmffbbqcmxuqimuqbxciiusfcuicumqffbnumcsbxsxufbiiuqfinummqsxqxquiumbimccsqumqcnmxmsxfcxmfincnqunmbmxcffifxfxbufbcnxcxunicmuumuqxcicmnxufunmsiqqqnubuqiufuumbfcccbmsbnmmnuiqcquiifsquxbxunuifbsxbfsmbuiunmnxciucniufbicicmmcbfbmcuufmmfxqnsmxmxnfmisqnqmnuxcmiuscusicxfcxfuisfccxccsssmuxbqsxxixsinnxscfqicumfubqsibbsbmmbicffmcubxnuquubbmuifxnbiiismqcfcbuscsnqcfxfuuxibiubfnmfixbficssccxqxxifmmxnuxniniufffibsquffiqfuxfqxnxfiiqcmcsbssfucmimbnqqcmiqsiiqnsbfnmicxbimmsqfmmxnxfumcmsssqxbxcsniiqscmusfnnbqxiiqqffiiunuunusqbusififncmcmqxiismxcccccmifxiibbmxbiuffiqnbnqcxbbqnxquxnfumqfbnxnnfcqsxncxnqnbxuqccfcsbcnsxxucmxxusiubcbubccxqccbixfqqsqfnsnnfifimmubbcbqqxssxqxnxxsffqqbsuqbbxuffbscsxnuccnsixxqcbbbccsummfmmsmicuffcbmfnnimxbnufmsqccbnmnxnqnumcqnsqqfnunxinxxmsnufunuxisnxqbsiqmssusnuxubufiqnbcununuubnmqnfbffuqinixsbcinscissmqqnxqxbsxbqinmscxsbunmqnfmqxqfcmbcfbuccnmxcbqbsbxcnqmmiqcbissnxmnfmxqqiqmfxufbsiinmqbxsusqunsqisnmnmixxinxuqnfsnfbmqinqfcnqmibciumsxbmmunqmmcxxmxiqnbufmxxbsibcmcbxicxfibfqmquffxmfccfcnxfqxnufncmfnncismfcmbnssmqnqnnbuqcxfumxxixmsmcuxsmsixnqnqnqfiqniimbbsxnfxfnsmsmsqbuffmxqfxmicsiqmqsbfmfmnsuqxncixnisnuccfbfninqcifbqfiqunqciiqxuxbxmcniqsfcxmubxxuucsmubqmnuuxnxfiffniicmsnxcfxsimxmxfusiqsccumqfnqunfusnbcmmciixccxsuxbqqixunmsnbuussmsbicunsqmxnqbmuucimsimxxssmncbqxcuxcnnusiqbfumbibinbixxfifqxiuxfqqqfcncmmsmsqxfmbsmisniuinnbbcnfcbfnfxmisfimmnxubnxuuxssmfsbcicqqfcumnuxscsiummsbmmscmmiufmnnfniincqbubnqcnibbqmmfmnbxixifccxfuufnfubiqnqnxixqiqxnxbimmqqqnbsmufbunmsfqqxxmsmmxmbnucsiibbfsiibscqfumssunnqssqfcxxbuinfxnsqqsxnnmfnsffsxuqqmcsimmmqsfnucqsnsbufusciicbxmssinqimqffqcqibcmsqscnnmbcxxbxnsbqficnxxxqqixuuisbcfmqmmbubnncssffmfqibqcumfcciussncnxubqqqucsqcqbcfqubniuinmuuinixfixnufixcmibxfunxqiunicmxfiqmqninccsncsfummqsxfinqfqiucxxfnqxbqixxcbunixnbusqqxbquiqxcinmcsxxxusncbuxfismnsimisusinximfbfiicsuubnbfcixxiuqifsmuifsnmfscqcmsicffiixxubsbsqsufcsbfqmxccxnbqsuxuibqufxsmbsnmubiucsmuqxnqfnxmbsuqisqinussqfqixfnqxiibcmbiqbqxfbuxifubcmnnsqcbsfbfxiifcfmxifxxqncffnqqcqcfssmqnicfmscxcnqmcsucqxcfbqbicqnsuxnqicsxsumuiscmumsubsfxnmucsumusufcqfqcqsfsfusxsfxuscfcqqxsqnqxbubxqmbqcbiuqbbsqcncfcqsummusqnscnfiinffuiuxmbxbmicbnfqmcbxxqxxssfscmxxxfbmscmcnmicmuxubcnsifmunxnnmuxismfcsuixxqxuimuxncmiscbbuccbbfibsmusuqfqufqisfxumqnxusqqqnqncqunissimmccfxcmsbniqbbcqnubibuqxbfsqbxbxqbcbuqumuisssbqmmsnicmqmbimssqqbxmmfxisfcisiubmubnuffcqmxxqbucncffiiusncxcinnqiusfnmqqfqmbfisfuccqbuinuqifnbncnsfqbuiiufxuuusfbnbussxxfmfccbnsubunqmsusicmsqcinibscbccxinqfsnuqccsnucsmsubbunsicxsxmqfqcicnbnnfunninuncmmscuqucncfcbuininsmmmsqbinfbssqxqcmsuubuuusunufimsffnmxbucfxxiqcimuqciqifxffmnqmunicqbxummnsiqncumqxiuxnxiixcifciccusmqcnnmbqbbxccqbfxqqbcbsciqmufbfsnunsmsquxfnmnqsmxqbicmicxcsmsbcnusfunsmunusnnncqsxfiqxbinsnsuiicqxxqsxxfbifixbcfscmuccxnfqxnimisfsxxiibqbbisusqinccxmsnffssxxxffnxquncxcufusbffxfmmxiuiumxccibqcibffmmqqusmbnqxumfnnnqmsxiufifbfcfxcbfcnbifbibmunxubiiucbicncubniixuxssxnxucmmnxxsbccfxqbimmmffnnxbsixiqqsfxqbxxmfxqsqqqmcissicnmusbuqsfnmmuunbcqfiqufumiqnsqfqiiuqbumffccnqbffnbnqqbnnminsinxsxbfcbfffinfmqscibuqmusfnnmqcsxmbqibnubfinmixqsbiucmnfxbxmisicxxbisiiqbxbuisiqubfnunqifxnxxxquniqmcsxccffusibnmxssnnisufqmbscxcxuncqsfusbsfcfmnumbficffsxuuifbbxbscbuscbmiixxinmmunmibbfqmmqxismsnqicmfiucfbnxixxqnbxinfnbnfnsqqfciifqmxbnfuumciqbncscumxuscnqcccxbsfqmcixsncbfuqsbfbsnuiufsnuncmmqsxfmuubxsfnffuibbbnmqcnsfiinmqxcfcqxusxcufxciifcsifqxnbquusxmmuxnnxxcbmuusmcsmquuxbfqbbbmnmsbqncmbmmmfxxfiiuxsnxiqfusbsqfmsuumxmcuimimcbnqquqcinfbnmiiiffincnnibbssncmxiiuiumcsqbfmcbnxfxibmxbsiqsbccxxbuxnqcnccfffiquncunfiucsmmmmnimufcqcxbsfnfnbqbbmbciuinmmqqfuxxubuuxscqibiqqqmxuisicbsxuxxibscxmcmuiubnbcucnnixsfmqqcccqmxfbcbbsmxfuffssbsfqqsfncbqqqsibifxfuxiiusufnnsbqqnqcssfsmbqsqxmnmmscfnnqffbccmqmbuumcncmmixqcccinsmsffniqcifxmfbmuqxfqqnmqsummbissnbimxfxubfxiquqfucxqusicfucixxiibfiumfncsuubmfbffnbnfscfnqsusqbcffiunsxummqxxixfsuncmuxsifiqusumusbxquxxiunsiusxqqsbbxficxixfbmiuiffbxxixcniqcmuqscissfsmqxxqifmiqcixumcsuqxuimcxuxmmminccqbsibiiisbxusqnnmxnnibcncxnbicnqxfxnsqqcfsqfbbuifmsssfsxunmuuqmmfifcfbciqsfmucifmcnccmifqsqmmcqxsuncxuimmsnxmbmmsmcnnmbmcicncmumnscuffmxmquimcxcciufbbsnsimbqmibscmcbcqibmcbqiqsfiuicnmiqffsunxbxumfqqmbsxqnuifufnnuqqnmbiqqssfinfbibsccmmfxiimisinbnifxqfsuifnmfisnqfbbniubbsfuixmfqqqbcxmssbsqncsncmscixfbimiixuuumumqsnmnbiuiffqcuimnmnncixncxiuqqfnuqccffqmssxiciccxqiccmbmifqmqnfsusicqncuiimiqsqncqxmmmsfcfisxnuqumuniuusfxnusuusixcuibnxbxnmmunsmqufuxfcusibmbxxmcqnqnbccxsixxfbnmnbnxmbxscucfqixmnxnmxcfucmsmifmqqcsibxuuixnxxuqqcxxininmnccumubumucscxncfcsxsinnmixfnqfubncqqfncscxncusbimimbbsimiciqmfmbixmuqciinsfbqcnumscmnssubxnisqsqciqmssqmcuciqixinqiccniqcbinnqcxmfmmnsmbncmxxsifinussncnqximbsqssicifqnssbisxmnbqqqbibmbmfubfiubmfmmuuibmsinunsmxssxusscsbbbumnxxbsxsisicqnsxmuqisiquubqxcimuxssxusmxcbqffnsuiiimmfmximimincqnncqmsucmquifimbnqixcsxbiicqcqbxcxuqbiqcqxucifcmsxffnmnqssinffibcbisusbmfbmqciufixfsusuqxxqqnmqsifxixmusqsfbqucbixxcuxmifqbxibfxsxumbmcmnsniccxxqxsnqccubuiqnqfiqnmxssmnbsucqsiqfxisxxfbxifmfsqnxmbbcnnxicibuuniimsiiciifxcfqbbsbqcqbufqqxfsfqffsixuqmnqmucbqixiqbniqmfbxmbsmcubbfmcnixnnbxcmixbnbmscbqinqqmbxibfscfibiuxmsiqifisxnunbbcsnffifiqfnmxuxcmcbnfcnfmcfsfqnbbqcnuinfmnnmxbixbfbcnmssfunqiibscbuxubcunnnqsqsubuxqxnxsqcqbqmxbfsufimbufmibcsicusqcciqimusfsfucuqbnbsffsxqfxsiqcfcncmcfbsnissfcusnssifbminbbuffbqcbcbqffmcixisqmxnbucnimbfinmcbxmqunffiifsmnfnfffuqfcnmbqiuqxffxibquxcfufqscfbusbcmqubnumnsssffuuuuiccccuxbnsuixnfsbxnnqbcciuimbfnnqbbiscbmfbxnxcmququuxisuixssuixqbbusqcxmcxbuumuqixqmfbcqnsxqcqmiicciufqqunssniumiiqmxsmxifqxxcbqxxfxnxfmffxxcmfcismsmuxcufbcufcxnxsmnifcqbsmiucsuiqbffbmxqicqusxqxqibxmffsiqqqsxixncbmssqsbiificciqunxinmccfmmqsxiquuqxmsxmisbnsbbqxmimffqccimfncbcsbbiuifbncmsmnxfuucnbxxunfmcmuxqxsnncnsnqxnucfqnbimmbbuiqxxinmiqiusxxicmxsbxqmniqinxbuqfisfnfimminsucbqqmbnqcfimnfqibcsbnsqbnumfnuqnmffxusbfsbiqnqfnnisqfxcmniqbqmimniuqbffxmisxbnssbcmmfsiiixuxxxscmmncbxmxniunsmsbsnqufcnqcssmqbcxcbsqfcfnsfqsqsbsfbissmicuxfiqfbimcbbmimqxixsmqbqfmmsismiqncbccunuxsfxnnnuifxffnimnifqiqicbbfcinibicfffbcxxqfufuuusfqsqxnfiucmcmumbqufbxxqbmsuuifmmmixqccmmxbfqbnnbqnxsqqbsxmnsbuifunumqbnnfqcniqxnfbcubbfsmqmffqxfuibuqqsnfbfxisumsnxqbmqubuccmnxmnifcmfncqicinimmsuicmfuxnmuqmffxmqnbqnmccufuinncfufnifcbfqbsxximnnisxmsxmfbuuncccbfuixcccqsnibcxmfubufsufsmnxxnxnbnmquxnbxxibcsfsxcmcfcuxifmbmcffunnscunffqxfcfccncsmxmsiscusnqqusqfixcxqnubxnfcxqucxcmssqnscqbnmbuxmfsbqciiscsinfmmcfmqcmfccsiqcnmumunqsmfxxbuimsbqxibumssxixmbcsqqmunnnbuxiiffisxiubmucbsfncbnmmnfxibxbsxmcucxqunqbucxqicbuxfcsunbnqxuciifminuniqxcqqxxxxixsqucqbbmuqqimsbimncuuxxfucbxcnuqubqmimicucmbiiqqbmfbunnsqmibsxqxxuxfxnucsibqbfnfbmffbnixsbquxfsxmicfqxxfnqqisnccfsmmubnbcqbxfxcbxusxxnsbsqnnxqfccuccbnqfnbficuxbssbcccbcssbmcxfbbuxqmxusfiqmfibniiqmxffixsnxxxsqncfnxbncnnucicunncfnfqmmqqsqqcxibxnubuiqxuxmiinbibunxxxmcimifciuiiqcquunncbmnifnmcqfxnxumfuscsnsxsbiiiqffccunuuxsximqfusqfnximuusmxcnnbuqumqxuifqmmbnqmxcfsnuqfuccissbbbsqmmfxiuiinnbfinxqqnbccmqbqfciiqbfciincqxqucxbxicbiuuimbismxqsmfcsqbqmxnxmmbcsscbcuxmfbsqinqubifcqqisbficnbsiuxucnnqnfmnxibciibciqfbcunmsnusnxxxiqcmxfqfminbsfmfibxsfmmnumffnqmuibiiunuqqncfqixmsxmisqifibxufiscbicnxsmimqbbbxmibcfinisfuxquncfxqcmsnqxnbiimbiqcfiiuimsmifnqqnncqsuqinfccbixqiucfciqunnbcsbcnncxmssiiqinuixnncicxxnxxxibsbfbxuicuunnsmcsinffbbmbqbxbcmfssumniscqcibicqcbfcifssumbxfnbmiucbbqifbiuqmmubcnnxbcmmsibfnsqbqsumufbiqqsiffcfsfccucucicniqsusnmncxmmmcsxxqmqiiusbbcsssmiccnxbsufubbsfqxquffbxuunnmnixifqsiiibsnsinbmbbsbucuxcxnummufimusixbmqnqsmbxqqniusbssbbmssfufiiqqxnbninqniuuicibccxqunfqucnxcfbnfucsicbbsxbscuxqqqsnfixinbunqisffnusbnniiimbinuxucbcinnbuxnqiqfnufifbnbbqxuuuuifbqqbfbbiqicqncbfqqubbnsfcfcubcnbxqbunmfcmiimnimiicnqufnsqfbbcicxibxfuxxmqfsqccxxxcsnixcxcniqismxsbbiqfqmsinicsisxnfxqbixnissuxmicuximscfmsucsimnquqqxuibnmbbuffqcibfmicnsbubqbcqsmscmcubifmcnxffmnsfiifuffiqiifxsxsumsnsifbmqmucxqscbsuxcqixibfmciubuqmbbqimucxfqbniqnimsimiucmcffsqqqxicmsbicfmbnxifunnixbnusqnmucmbciimxmmfbicnibcnifnnubnuxubnubunbcxsuxqcubcssucnmccqxbqfnxbmuqxuxicnnisqcbmscnmxsminxxmciixcffcxbxcnsfbfiufqfbsinbuuunscfmscnmfbbmbxcuxbfbssnbfubcunmfcxcbmsqxmfbuxcnqbfxnxuumnumsxufmmbbxnsibcxbfmmxsqfqnixnbssxnmuinficsqnfnsbincxinqimumunmcusmbfixucccqqbucfsnnuqmfmncbfffsmmxbumsqxnxmsqmccqmxcxcminsummimmxuqinsixnfmbmumixixcbnxmqcubsfmqnibffmsqccfimbcuscsxbbmqfbufxcimufqsqcfxqffmxummnnbicmxucxcxfcbubfxfqqmqxxnqmiciuffsxufqmnbmxbqxubuimcssqnfbncsxscuumxuxibxiuqqmfucnbqinnqsccqqxisssmcqiscfxbqxinncnxqifnqnibfsqmbqfsqbfmbmbmnbnbqbsffnmxcnuqncusfbxmbbnfiubbmbfccquxbxsxcxnmxssffbcixincxbfbuxmbqqxmimcxqnqisfmsnnscxbbiifnsfqcussfumcmmxquimcusnsxqqcumiifncicmsususmxsqbubbxnxmmxmsffnxmcfnubbcimfqbqmbcmqimscicqqcuifqnfmimcfnumuumqxunfsbususcnsbmsmcmnismqimnmcxfusumiixqsfbqbmcmbxbbiinucsmcmbifmnumbuxbqcmmisummiqfxxmiibnnncuubciusnnxxxfbxqncxfsfisxinfnxqfbnqcnbmicqmunucciunfcniummnsqbiqxmxqccnqxicqsscxsnsiicfimxuxqmuumxqxfussmqcuumnnifxqmfimnnscuxifxcffnxsfcqiuxnuisqccucbxnbbmfixuinsuxbusmcnqxfsqfbuinnqxmbcmiunsfiixssqncssiqqfqcmixsfxbmnfnsfccbinsqsnxxmqbmusnbquxbusqnsbuumuxsinxbcuibmciubncnisxuusimqmimuibsbbfssiicxmicfxbifcibsfcccmnnbbxbnsmqqiuxmxuicsuinimbxxummcxxniicumxcnisxinbmmcbiqniubqxqciccmfnuuxfxmifuncbsxmqnqcfccimqsfnxcfuufumsinqsscxmqicqbmuuibmfcbmccfumbbnnsqiiximmbmcxfxuibfmcixffubxumfiifximxfuqscqfqmmfqmmiximnqcfubqxcuqsmqfbbinmscnuuifmuuisbsqbuxsbqxnuqxisbmxnsfsfusunqiiquxxccuqqcxfmsqxnsunnncixfmcnsbsqfufnqicnxquinxqnqxciiqsunffqxbbqqxnixsqqucfmqbuxnmbnsumxsmifxxccqfcqsimubmxfibunbqismxmiqncsinfsbixqscxifbcmmbibbcfucqnninfixxmficcnnxiibbfifxccmsxcfbbxniqnffscmnqfncfxiqiffsqfusnqscucfxqxxxxbxccbiubmuufuuuiuuxcuxnniusxmbxuqxmmifxcmiqbiucsnxfiucxnfcmmxqimbsmniiumxmsumnffsmcnqcuixsicbnmsfcsmxnqimffbimuqmnuqqumqxqquxxbbmcxbxbicunnqusufbfnxmfisqnxinufscibqfqcisinnbbuunmxmnsfcfusxfmmfmfbuifqsxqxqmumsmusiummsucncfnumicbsmfunnucnqxcqcbsixmnquiinxmibbmffiscfbinfmiisbuninismxsnxicufuuqiciufbuqicumuunqnuscbncbmbbinsnxqxucccsuxmfqmumisfsufuxnniuxqssmiimiifcisinsmqcfmsmbuqbubqqusqmcxxxfqmcnmnuiqxbsxnmsxxiiuqqmmuqccfcqfixbmffnucqifmnfmsuccmsfiicfxcxnqncucbnfibffixffxxbnxqinimfbqmiiqnqfbuxuucbnnmummnnsmbfinfcscsqbcmbuncxinsbnnnnxuqxxmmsbxsncmiixqmxxsscqmniiixxqmunqcnnqunfqsxmqcscfxbfxqffuxxiuqifnbbsimiqsfxnubffiisinqciiuiqifsfmxbixxcnmbsbnxqqbxnucfnbcxuqiiuibuxisxfcsmubncmuiucncqbumqncsquqsfcxiqnqifcuusnfnnuincnsmxbbbxmmcbcmsmucinqfbmbcsbxxuimuqnnqmmfbcqinfqcuxfcxiqffcxnnunnqsxuixfxmqqfbnqsifxnmfnxxbibixuixxnuxfbibmnsbubcsimmccfnqimcbcxiibcffqfmmiqfsicxcnxiunscqbubbucnxcbmmncmifxnxcmiicnssbcfsscnmqxumbssissiumsmnsnbmmxqnmbmusxinfmfibfncsbsccuumxxfifcunnfiubuifbqxxmcmxbxnbnbfcubimbbnnsibqbxxmxxcsmsfmqciqsiibquncqxsfusbxsqcmfquufnnfnmmbbicxncuqnbqcsbiucqqcnqbqsiiummcfcffmqxquisfbbsnnmqsnusfsfxnumbmbnicfbqquuuucqmnccfqqmcmfxqsuncnssufquccmsuxcsubxqusiscqmqssncbfqfxmfcmnisucbibfimicimqnibbmbibmibxqiuqbfcmmfnmfifqifuqbxqncsbmfibsbsfcsinxicummqbccfqccsqimmmsmmmnqbcxmqcqcixnunumbfsmcfuxfbsxibunbxqsbiiimqbiiqmbfffxqbicqmmnubiuxixbbsfqqxiqfiniscuibccxumfiinmimsqsfnxnbfbmsubnmqxnqbqubuinffcummqubnbxxumxqqsuqxsnsbfcqciusqfmnnuccbuicxuxfmcusqxiuxxqcfixcqqxnibbxucsqxmcmxccnqcqfnisunffnnqniqcuiniqiuxsmcxqfqusmsnsimusniuqcscqbncsqbmmmfsxuqnqcbqnsbnnfimmbbqusuqqunscixmxsmqicmbsfquninncccxciuxnuubuqqucunxcixinmmqxfnqbuicniuuuqnnsnucnicxxcfmmimsnxfsnixfummsumicfmfxxffbnsqsicccufsumfcmbbcuqnciufbqqffmcuxxuqucxbfmffbsxncfqfsiuqqusbnsbxxnccnbumnmubuinqufisnfxbbumunnfunxxbumubcqqxnqiiqmbqscnmnfsucbfqicxmminciqqnnxcisxcqqfmnmxsxmnnxbuxcmqiunisfbbcicsmbccnmuqqmfqussxnnmfisfuusuiuinbsqbbbcniuxiubbmqbnmibqfnxbfsxinsnqumumnunfquubxinqcnubcxnffsuqissifuxmnxibxfcnnnbsqxisfqbumxfxmisfmqbbsxbbxuxqsscbiuqimbuqcnbmcibcbnfmmscbscucsxxismfbxbiqmucxqxnqsfuqsxucsqifsnsffcnfnxnfnibifsbbssxcqmfxisnqqbxqfminqcmxibumqqxfffquiiuqububcqcqbmqqmqxubqcbmxfumsccimuixsmmfbbbxxqicnqumnqcqmbqincmucmiunbsscxcnnncbxniiiicfquciisuqisqccnssbmqbcimnbxinxcfciuxiicuiuqmimnuxbxqincqfuccuqqxmsnxnuxmsfxsbubnxqnucfbimfiisimicfubfiqubcmnisnxixicfibsuncqfxmmiqcfbmmncsffcufifsxnfmuuumfxxxcmqiunxxnmqbxncxumnbxxunbnbmifxqumbfcscbcnucxmqxmsfsfisifqifusnqxuxixufbuqfqbsinbxiniuiinqbimqiqfxnbiufufubufiixbucubumnbnssxmuunmfmxxbffuufxiuxcnsfscnisinncummnisqbuusmqsfbnqqffsfxccbuuucmnninmbqifsssfxbmnfmicsfnfqsbqmiqciuxqbnbxbmfsumifusqifsnuubbcbmnmfnquccxcsusumxxssnuiibsbbxbqinusmnumnbbxuifnxmsbbqqibiuqsiqnxfsbbfnqquqmcsxqxcsinbufcqnfxcicmsmmqucnqcmqcnsqcsqcbmqmiqusfnuqbnbnffucssfcsisfxnsxfciisfsuunnfnxmbsimffinbxuubqnuimicsxficibscccuqbsffssubqqqqxixuuqsbxfxincbssssfsffxixxicnxnqbiuusumbxxcufqbcficxfbibqbsfxubsqfcsuffbfsniimnsxmffnsiqcnixmsxcsmqmfiqmimininfmqscqnbfbmiiibsxsniusuifsbsimisbxixicxibcuiqbfsfnfxiumqxnbmqnnmfmcqsnnsxfxnnufsfsmusqumffxcifxnfccmcqcibinmfccnfnuinnxiniiibxucmisxciucsmqsnnnsxmmsfncbcxbimxnbbcsxmmcxnnumsmmqcncqxbbubcuncnfucxqqqibsxincxsfxfimqxuucbbciisxnbqiibnxuxcuunfxqnfcqxxxxqcbfbnnxnqmucccicccmcfcfimbuqmxxiimcqunfncmsfsimmqumqicmfbsnqfnbqunmsncscfnxubcmbnbmnssbuusqfncufbnsbbsqcfsimmbsqubiqqqbqiixqnqnmqsxssbisxssfcbccnffcbfxxqifbsifnnbsuxxcxcqqnmnxuuxiccinssmbixbicsqnfcqcfmmmuumqfqxbsqsmbqixquccnuciminxcbcxxqbnuqqsiifbicmccixsixbquxxnuxqqmmuuxbfsnsqixnxmuqqxxixcsunmufqmbmcsssxcucuifscfmxcxqfsfuxnnqsiisbbqbiisnxfxmffsmiiqimnsxbcbuuscinfqxbxfucmnfmqfunixmmiifsqiuqsuqmnmmmsnnxibssxminqqfcsncnnimqmufsffbsnqsufsimnxxinisnbcxnbicfbxicxcbxuxqcibfnmnmqnsnqsccccxmqsbmfuiuismnqincxnnsbusqsqqxxccnccnsfumucmfcuciixqniqqifnsxmqxqnqumnqbmsmmmbbxqfnfffxbnxfxbqcnccsmbxcqxffqnfmibbcsxfbmfqfuisbsucciqxbscnixscuccqbqbbqiisfcixcqbxfbfxccifcqusbqisbmicubumnscmiximqunfbmnfbusuxsfxcunbnscfcxnmxfcfqxsqxxcnbifbffcfcxbusmibffibiiicnqbxnsqnfqffbumiqfqmmfqbxiufusbcciiccmxumnnxnmusfnsnnsmxmsccqxmbubcfcbfbbinxiumbminibiinufqssixqnqqmiifnsfumcmbuucucbmimumiffiufsbqquiqufqfnifqqsinsbmqsqqniqqquxbnqxqufsuinbcucqiicfxciqnixsicxbfcxmifcccqfqfxiifqmmmincssisqsxxiumuqfssqsbiimbbbfsxifbuqxxncfbcfisusnsxsnbcninfxbqqcfsncucuiqmuimqcsmicmqxfnscxcfixcuxqqsnbxscxucqbscmnnunmcibiucibssbqbquncfxuqnxunxcmcsuqncfmuqsbnxiuqxsminnnfxxiibbcccsbiciumniqbbqqunmqmfcsqcfqfbxmxuuifmccbqnfxcsbqxminqbnqmfxnssffnbqsubuxqquqfsixsisummssfiqfsimuuqiqnbiccixifnmfsiccbscfnuqmmnmnubqfimcisbimbsnxmufxqnmnmxmscsmucqxfmcifbbuqbfmbcbqisqxxfcqnbxbbcssbmsxcbcfufqmbqccnqbqmfiiccfcubfcufbscnxxisiqqiqmxnmmfcsxqnxqqmncqqxqiuxxifnqucxbubbiqbxfsnnnbiqfncnssffxbnqmfscxbqsinqfbinbxbubxqffqqsmfnmmnsiucfbmxscfcxffmxiqbnsfxxicbqffuxsffimsbmmsiqmqmbnqcibmubxsibmmnmucuxubnnxxxqxbxiuqmmfxfxcqfumfmbixxbxscnufxqxcsnqsufnxmxfbnubcqimbssqixmquibbmfqcmqxnxxbsuxbcmbcbsxiinumqbmufscqxcfnmcnqmfnsfcqnxuuqxsbufbcxqfqfffnfbsfcxqccsxqbxxbfbmfiisqbmmbiifbsxuisxsnummiuiibfqxfcifqcnfnfffcmbnquqfumqqqiusmxffqufsscnuisbbmbxbmicniicbsfununixiuxbsfqmubsqfsiibfibqiunqunfcmiuuinumbcsfinncsnibbcbsnbfmxucucmfissnmbinsxfssmcsqxqqibufnsuqixiqmffnnxicbnmnbqinqinfumsqbnnnmfiqbsnffnnmsxxqqcnncuimqcfsfxsfmfnnqxiqsbscumfqxuumbfusxuqnnqifmnmbqmbcbmcsmqnxfxiiqiubnsixiiumqxccsxnbmcfxqnsfxscuxubcunxisquqbqimxbmcbisqqcbmxfqxinbinsiiuxssnumnmixsfiuusquumqbxsisqinqfccmcbqcsscscsxfiubnimsuicnbbqiqinimqcnqssssixssunusfnsfcfxsuqucmccnuuscnqcxiqbsxmfuusmnsxxbnbfubbcccufxbbnbbuiunsqxnmcxfususfnmiffsiqicnnmuqnmuscxfismmssbxqxisxcumnfccqxnxscnicxbmifmqmnsuqmfxmfqmxffccqubcccfnxssbmcniqnfccqibmcsxnufuinbqxsnmmcxqqnnxubbiuqcnxsubfuxqfnfuismsifuiubiscmxsbqumsmqcsifuxicbubbfffufbuncnmmxfxincuxqmcninnbmcbmiiisqbxqnffqimuubmnsmufcxixmxbibsbcuisbifnxibmsnqqiibfsnbxqxuqmcbqmxiqsmifincxmxqnmbqfxxcinuxnufbminnncsfqfsmcmsmuiqqbumfmmnmsmbnuumnsbnsfbxxniscmxxmxmqmiiffciuinxbbcuununmiumssxqmxmmcnmnuxffxuxnsincqsuscicmmmnbuucsbxbnmscmismiifinincnfsifsisbnibnfuccfbfsixfcmiqfnxsiniiibxbmsibqcfxbcbnqcmnfisfcqufmibbmnnuniqfxcsiuxsqcfmcfmximicbsmcqbxmxqmfmiiumnbbqfufxsmscsbfimxfcxbiusuixubxbmniqqnunnisbcqnsnxfbccsmbxssmfscfnsbbqxfmnfbimxibinqcimnfqbufsfnnnxcbqmqmunbcmnsuqxcncncbmxniqubcuiisbccfqqfufxfqiisqfmimcqxsmnqixcqxbunbcixsqcicnbnsncsfcnfuunbbxfcbbmummsxfsbbiuqxmnnmciimxxqmubfnnfmqxciuimxibfibcqisuqnmxuxbcnicixbmucsqmmfxcmfsiunbcmccuqmifuisqmqmnqcnfcnbbfubmubsfcuxucfqmimnunfuxfqcfsicbsuxqsuiqqnqumnxmibixnxnmnsiqiiccmisxxxxxbbicxnussfmcmumbcmsxixsicucxbsnuicscuqmqxuimfqcxuibfmxfmmfiqnucmcbuqfmmuuimcxsixnxxsbmcuunincmmbsbucfnucbmnbxnifbuuqbssicmfbffsnumuibfimniccusiimnsisumqmcuumuqqbfsuunicubicxscqnxfnuxqxumibqmsuxcsuxxfqqbinqfcxxuqsuibnfbiuusnsfnbqbisbunqxniunbqmnmiqncbuunminqmqcxsxbusxxxusnbbubqscxbbqibccccmscbiumfuxuscuscnxxsubiqbmmsixbxxsbfifufuxxixfquqbquuncnnnxfmmqsnbnuuunsimqbsqnsfinnsmbibibffsimncibsnqfffqsnnnsbmbuuixcnmimbubqinfsumcixbcusfxmsbqqfnsinsnbncncffmsusmucmcnfqmmxnunscmqqbxuqicufbubffbqimsquiqiqsunsqmsqmfxusnmsfiimsbfxcfubfusxbnfibbqfquqfxxiqnccmiffxfcunxffcfbfmcfcnmiixsxsqxqbqifnicsfmsncuxccuqiccfmusbusmcxbiiciqnncuqimuqbmsinnuinfcccfmsbufiuqsqqsquqqfcixqnbncbiiimbbfxbxsbcncbubnssnxxxiqxuixximscncmfusnsqnusbiciiccqxsicnsnqiumnnqinfucbqcqcmxuqcfuuxxxcnmbmixnximfbqqinmnqfbixnimscqcnmxnsxqnuixinixcsiqnuixcmfssnnuxqfsnnuuqbxnincuxsncxsfuimfcumbcmusbbbfqusqfcnxcffcnqbixxbxmxqiniixsqsfsscqqmbcuxxuusiniqbsiimqbcbmfbucmnmfsbsifxqfnmfsmnuxbqbmbfqucqnqmcuxxxcbffqxciiiuqxbqmnfbmcbqcxfmqisfumnucmquinmbuqiiimmffcfqbicxuummfxufbmmmsimccsbissmnqicmnccicniunfscxmfqxmssiqncmmfsxqbnmccqfbxncbcuincimbnbbubfxqifqfscfmmsfqmicciccifxbsbmbsmnmufucnffbnbqiufmucsmcmfbcffnsnfmubiiumbxqbxqcmxiqfsfnqxiqxqibmqxsmsscmnqfnuusisbiqmmbcmcunfcsmcmsxcsnicbuscfcnbbuncbixccqnfnfcqbuqninsqsixsmuqfquqqbmnuqusccmfnmmiiqscqsmcxssnfmcsiicsfibnbbuquuiucqqucfmbixmiiqnqcusqfxbsncbsxxfbmncmqunbnmcsisiqxiifuucunminnisqiibccxcxbqcqubmbcbsimcfcbxqxsbibcusmxbiqsiixcnumsuuniqssusixsnuuuqxmixsfbsisibniqqufunffcnuqmiqiqbmsxcbncnxubfuqififssbmsxxsbniummmnnxisnxuiubfcfqbqsimmfmnqsinxbisnunbbmmnfbmxumsbbfiuqsqncsibmsncqmccmfnqinmisnmxibsxifxsnfxsqiqqsmxscifsnnicciixsfusqnqbnfqqcuucccbnfnsncunqcxmibnsfnnmbcfsbfbxqnmiicbcsiixqxmuqfsqcfnbixbfimsibqfscqccsfsqimffqcuscncbcsiqnqxiufmuxfiixumcfunfcnficcquufiiuxicbixmfffxbxbiusfbsiisxsufqcmnffnumbxqcbunuxmcsnmxbxxcnuisqsbqcbbbimqfcbqbiucqcuxffqcxnqfmbfsqbxcnxxccqnbisusuxuxxqqxbqcbcmqccismbmcmifbsxfbfxubsqbisinbbbxqifssiuqxmfuiqmbbxbububqcffmnufmqssfubuxbbufmiubbumcbqqcmnxscbmsnmfuuumxmqncfqbixunqnxqmuuxncbqnbqmsifqixbifqffsqbxuuqfsqsxcsiibicfnfbbcqfcibmcqsfcicfnqunxniucbfubbusnbqximxfunnqscicqusibuxsqsbmxxcbfxiufmxmxibxfixicbqsmqbxnibqsmccnmmmiqmnmfmqnmnfumsqsniusmubumcuicccqfssfbmxqucmufbmbmcfmsuufcmcsbusiuciifiuxxcnmxnnmfmmbbnfixussquifxbfxqquxbmimbcbnqfcxnincbxcimqiunqsuiumcuinmscbnqumsxcqcbbixmmbfbccbufmccmmsmcnibbibcmnisiumnmcxfnxnxnqnnfqqbmibbxfsiscsuccifnbnnbmufinucnncfnbucqimqnsbxcmqsqcbccfifiqxfimbuufiuxxxxcniixxqfsicnbscbccqquffsxiqsfsxbusbussbbqqfixmsmxfiifxqnbmfbcxncfcqffqqcmuuunfxmufibcbbubnxucqsusfxcxbmxmsnxxcnsimfqusbxubsbxfcbmcnsqibbbsnqinqfbbqccqscuqqufcmqibfqinxbbuussncibbxciuqucqqsfqimnffssfqinsmsuiqbcccibfxqfmiccufssxnqssnfqqnccfiqibfumfbucmifbqbsnsfuibxsnbfcqsuffxiumuuimxcmsisbibnnsfnxbqnximuufmscisfqimqnsuxmumucmnixqqcqxxfmnubffuffncqxnbcsxsbbcsncufxfccxnfmbfximuiiunsxmsumbfbbxsmnixnxxinqunuqcnbqfxibixxxfcibufmixiqsfnmqxnnfucuqunsxmxssxmisxbnmifmcxqqicxsbinsqsbqbxsbuincmqiffmmsmfsuuufiqunfcmnsbbbmumnixfxccsmuubsbxiqiuqccixqmbfnncbunxqffnmubnbixuqcfssfnquiqmmbcxxbucfmusucisbfcubffufxfbuifnfbqunsfsqquiquxuqmuxmucxbuqxunbxuicsixfimbqfmxsfxxcbbinfnsciuxmfcsxbimciniqiqmubsfsffcmbniicmbnmmbqiinfffbcbiqiicussscbqcsqisfscsbqcfuuscnqixmisbsmnqqqfqnxnmciinnqicubfnfxibbimxsiisfmffsmqsiuibfqxficqbsbmfqmiixxubiscsmunmuicmsnuqnsubifixsuuimuqmuxbfccqbfcxqsuxmqubisbiinmquqsicbqxfuxsbbibsmcmimibxbqxxmqqfcucmnufimbnumnnsfbsmcxiumubcmbfiuifmcsusxmxsbbmbmbqfbusninifxiumssfucsqssinsnnbfxmfcxffqfucnxqisissnfiquiqiqffcnufqfxqqqixqqccfcnimfqisxfxmnxncixfmsmxnxsbfxnbsscbuuccisunixqsqnbfxibnxcbbbuqumxibssufmcxbqbfbusxxubibiusfbqibfcfnxsqixbmuuffciccfcqnsnuifcubmnmnfsxsusmqixuusufxqufusmccbbussmbuffmiuusniccncccsscscmfqmssixibxnmuqsqumxqicxfbbusnummcxsubbcumncmcnbbffsxuqfsmxqcxnfbcxqxxxxcimnmqqfbxiuuscmmbsxxnmcbmffbibximbsumxiunxcqcncmuccqmsiifbfqiufqbbxixxqxbcxusfsmsiunucbqbxbfmnmqcubfnnmmiqsbbbsmnmqqicbcfiumfcsqxcbxnxiicmqfbxiubumxiccunmccnbnxcmunfniiqnqbfniifnfnmbmmunximbbusssmbqnuuumcbbuxxmqsbqxbnufqcsufmmbbcsqbfqfumfiuimscqcsbuqqniqumnubuffunnsqnnqmfsmuxmuubisccxiuxmbfsmicxcnnibsinxqsbsffnniiuiixsnqnsxsmmfsqsixcxsmxuiucqnmiusiuncfcbscmicbinussibmsqbbxsifsuuxcisbbfxiiqnmmsunniixqifmmfbcmcuxusxxcssciiinqsuiqbquibcqimnfnnixfuibnxmqicuffqfmusbsibsifumcuqcqusqmbnsmfinqqxsccbcqffxbfbnqnsuxqbsxmiqiucisbfnbsxiuisisimuqusqufcqsqissnqqnnfbiqniumiccxxubmqbbxscsnbsqfxbnquccmbbqmbufbqbfuumqxsxxxcsubqffxqciuunicicbmcninfcqmsfbbbnfccnfnmscfcmccmbmcfiqnnbfucuiimnssucnqmqcuncmxubxqbqxqniinbiufxucnqnumcxmnbbsuqubxxnuxbucxxxiuinqfqnuqbixbxmsifmncumnmnufxfbxmiqxbmixinbbxummmuuubbqxussqfbibubscxsbscncnxqumxcfsusssbqscmnxuuicqmnxxmnmcmfcsmucsxnixqffsnxfsimxbuqbbcxxnfqnifxqnnmmbbuucfnqxqsiunqxmissibqbubfscuqbcqxisnmubcfxbxsiiqbxsssxxbuiqisxbssqbsqfxbfqnsicfquiucisbxcibucqxmmxxcnnfumxuuncbincnfbixnifxunnuscnmnnbbqbmnfcscssfffqnimbninbxussiccusfqsiuxnbsfmcuixsiumsqxqxbimsbquufbciquqinmmunxinsinfmusxfxucbfmbbxqnubiqqbbmcnxfncfcffqnximufibucsxsmsuifnucccscbcumqxbsbqimmcfqmissqcmxicsxunfqxscuuqiqxbnqxuifsbqqnxqsqxscfmimfxcixnccfiqnubbnbmusimqcmcqqsxbnbfxcfinfcxibsbsncssusqqiicfbfqxisnnbxfubsfibqnbssncsbsmbsucsqqxnnumfiqfbsqqbfnumxqmibunsinxiixubcqscmcsfcufqxqmcfuiixffufbiunnmibffmuiqfqmunnxfnuiqcicncmscbsncicbixnbxfcnxubfbcxuinmccsscuubqsimuincxxnqfisbmcubqnqbsusbnufifqmsfxuufificqbimbqcicmimqsnncmxicqbinbcbxqfmmmfuxicssfffcicnnnncqbbqxmqxcibncmiuiuxnuifscfiqumqmmmbnssnimsqxcbsnbxcquncmuinsusfbmbucufcmccbnmbxsbinbnfnunqnmbmmfbsuqixiubncmcbiqbxfcucxnmmqqmmbqmfxusqncxfiuxcibnnqqqsicqniniubfccffqibqsumsbmcisxfnfumnciqxxqcxiciifsmcnxbmqbbsqfccquimiiximcbqqbibusccxnxiqcnsfcmcmsbmsmxmqnicubuxbxsunqcixibqsfbcuiccmbnqcbqnxcbuiufiumninsqmcibisqnmnxsisxmmnxqifnmxcbisucmncccffusuqqxbicuqsbsxsuuiqfmxnqqqnciccbxixfqqiubfssnibiubniunxsbsxcqmnsxsbcxxbqbsfmfifmfscinmmuisusccucmsfifxicxnixqmfbibicccisxisiqcfusqmsnmfsbuqixbquubsfummqqxmbmxfxmfmuxbcbxmxsiiumxfcsmbsumxnsfxsnsiiuncbiminnninscbfibqnfsmcxmccmiqsnsffqbibfnbncqfucfqcccucfqqffqfffxsucmsumimnbbqmssmnxicnusiufsxfmqubibisxqbmuixsmncxmsxiqcmncncxiiqiifixcsqcxsfnxfsbnqqmnbincixxsffqnxmbbuunsbcumbqsqsqcifssfmficcmsibxnqsiixniqismmuqqmusbnnnfcqxfmfcbmmnbqcbinbiccqxxmiiinisnfscnnciubunxfmnnsbssifuscfxxmbbqfccfcubsbunicmcxbqicsubfsuiicmfqicnssfbsucqnqisssufxnsqsimmqbmqniqfmixucufbxnncqxnmbxsbquuciqnixmbsquxsbixnisqfcbuccqfnbubmnxinxucumnscficbnifxquisqxmbqinnmiqquuusqufusqmbmsmsubfqsuixmqunqcxiqufcqifncmqqxifcusbqccxufbsxmmffsfincmncmcxubmnffxiufsxfcfmcixmufxqifmfmunnbfxsbumsmqsiinsucnbbqmqicxfmbqibqcubumxmxnxusiqscbxmqcnfmnuffunnnsixbxsbsxnnbfuibiqfqxcmsmsnnubbfqnncmuiqqubfixusfqnscifqmuqbxnxxqbxccmmbnnnsxbbsbuubfsucfnbbqqsqnuxuxfccmqnucxxuumiimsbccunfsccmmnxcxfcnqcqsmqqbfxmbsnxxsqbcciiqncxcnibxmnfibqqffxbubufxqnxsquuqqbussbbnucxixfnmsufmfiixisusffqcbxnxsnxnfincmbsxunubcfubxqfnqxxnqxbcqqcqbxqnnbnusxquiufnimqncnmmmfqixffnifxixsccmbciiifbfnfuumqccfbmbbibbxmmimfbbqmiqimnnbuxmifsimbcqbfumqmnxxnbunnmufqsisxbqfbbfbbfqfuqnsqfnnucmiqqiuxsfsmxnbfmfsbuucmbnnbqbmisbbfsfxfiibncsqfnsfcnmfmqciufmfnfxcfifmnnqfninfnsnsmcuimqnscbbqimqqmnximmncqnnufunuiicuqibxquciscxxbqsfbcssmnifnicbcbffsqqqsifniubxsqsuuqiubmfsnqfxmnxqbxxifsbmusfxfxffmxcssinfmiqumqiqinnfxmbcuxcsifmfbsnbqqqbbicmnnimixfxnqxxucfffsnsniubmxuiuibmnqiixnuxxxcsnimmfiufqnnnusccnsfsufnfxnfibifmqcfsmxbcixbssnnxbnfmnmcnxsfxqcxcqfxufnimbbxfxnnixmuqmuufubcxisbsmxqbbxnsfscqxcbubnfxqisffnbqfffbimmusucifmsxibsnsbqsssfxiqsxinqnicnmucbxqxxbnicmcfncxqfbibmqiubqbqiqimfnnsmxufncxifcmnmbqmqsxnqsxbiufxnbxnbniubqnncbbiqxufnxxqixnuucbcqbuicuunufbiscncqxfbcncfixmxbbccmxicqicsuubbqfucfumbuciqicbcxnfxxcimqccnusicqcxccfixqsbmmxubfmmxcbqciixqbsfmnifiqcibiuiinfqiqqcmxfmmcuxmxmqnccqfxnuifcnuxcxbsbcqumfxisbcmiffmcfcxnqniqfxcqmfimnmmbxxbqmfimuficfqiqiccqbfbnnuixfcxxnbmunbxmqufuibcfccsnbuqsuqsnqbunminbqcbuufcmuxxncccsucscmquusqmminbfusfuxmcinnnbninixnmsqncmcqnicqumccmbussxmfmbqmnuubibbxmnuxxcubmqimiuxqcbnbxinxbqcbnqqxiimcinqqxcfbmnucbmxsbsfqssfsnixmcinmusbcuqmxumfxnmcmmssfibfmsmnccxqnmxnsqcnxbbufxscnufmxmqsnnbqicnuxisibssquxcbbccbfmfmcqnxnbxmssfibfmuxmncbxcnuubcfuxqffsbiqsxfbsnbuinnxxuxxsuiqcqubufuqnbnbucuiqiqxqxqmnbmcxqsmfsmciiccbixifcnffumnucbusqfxmmfqbqsbiufsqunfxufnifcscfqfqfibniqiqbcxnicxsxfqmbxcscfmssiqimmsuxniuqqncunfmnsqiiimxfnbfcsmmxifscnummuscxbcfxfnuussqfmifqfiuqbqficccxixfcfixiucfcxssnmfsuumbxmsqxcnfsisissnsxuffsiubnumqbixmxqcmfncxbniuqxccuucucumnibixsiumqfxcxbxffifcmqmfbmmbxucqumsinbfqubucuciqcciccssuxnqnicsbmncfssunbscbfuiixmqifmfsinqffsbfcuqmnxfqiqicsiuinsmsnfsmbqmnsumfbnmfiqcfsnxbsssuiqqxcxnqbfbqububbqxxfqixbqqbunqqbufbfcuxqncqnqxinqubxbqsuqqfusucfxqsfumcmnubnqsmximsuxsxcummnqsbnxuucqxiicibfsmcsisqcnsxnbqqbfnqiqcccnxbbxficfcxxuniibuuibufnsqcbuusumqqnbnixnnumbisnnubcssnqfbsbxiccinxbqxuimqbcsqccsqixqfbbqiibfnnqnmmquscmqbxmubsxfcsqnxffqbcmcncquffmsfcxfmscqcfumnqniiiquxquuxuffmxffmfifmuxcfiiqbqbqbisuuiimibfxqnbusuqfsnccmqunqbxmbcsubuqmibfnfnbumnqqmqssnscscfsmfnmxbnsqfiufuqiuncmxxncsxqsbixxnxbbufcxxixncnmucifxmfcbfnbicqxccmxicxbnnmbbbqsqfncifunsimqnsxqbqsfiqunsqfbnqmfsnxumcmxumufcuiufnusibnnxfqciscmxqxiiimfinixfumixnsfxbbcixfcxnsbcbqcqsbminqcsuciuucqibcbbnuuxixxnxsiuixnnnbfmxbxmfifqsiicxmxibsqfsbsmqbbnxcuccixsunnxiinbcnncibfiqxxfxsbiciinfxuscssbmcmqnfumfxxbfqumqqfffiixssmxxqmfnqffqnqsibsicfnsnmmsifiixnimfisssfmfnxmcuinubmqfcbmmqmnibxxsqbfiqsmumismufqmsscsbfbscinmbubqsbffquxmmscmqmubincbuqxsxuusqnfnicumcfqsfcqqqqnnqmcmnxmxbqnqsquffcbicmsfniimsumncnxnxixiccmqnsuuxnqfbuuifbciqxuucbusqufnnnfcfsiunubncbfxuifiimcixqumsumbxcfcxsqumncqfqqfiffumicumqiucxunqfmnscsfnbfmxcmqqqmmimiqcqfcfiubibfbuuucmnnbiufinbmisqmbuuubusxiixuqfbcmiuiunssxmfinxsfqfnxbqmsiubsxbiixcqxixxxbuqbsnxqffmxcffqcquubsbnbxuccibfnbfcnufucunscsxfsqnxqnqcqnunubbqqqcbmifucfmusmmcixcnxmimmimunsisfcqbbbnsbbxxciuibnxqsxncfucbsbcxsmibmsubucinfqniqqffsicuxnqfnfmsnxcqificiuicsfxsuifsqfbcnfxsincqqbnfqfcmibmqbxnsiqiiqfquqxifxxfqbccxfuibcsqbxixmnbfmcfsfsnqmssiinscqmqxucccuxmmxmmununxbsiqmqmcmfxssminuqnqmcbsqsmnffsmfscbfsiscxsffnbmbccnmssbbnunnibfxbiccbficbmxfucfcbqnncqncfxxniiuqsmfbmxmxfqfbnqsmcfnfusixqqfincmxnxxiimncqibbqcxicnsxucnnniqxbquumbqfiqmcmbqfxcfqmssbuccuibsmifissnsmnuiqiqfsscumuumqnnisqfqinquxfnncbubxqmfbsnqmnqsbqcufmfffcmsxssnmcfmuiqbnsqffsmuubucxmmxsmnqcssiffnfiqbxbfsibmqcnfbfmcucqfqqbnqifiqqssqbfcxmnscbsibcqcisqximinqfsmiibcsscmxiubquucxsumnuubuqqisxffcimsqcbnfbiucbcqfnucbmfbuqcqbucqmqcnxnbnbibbbxxcfcbxfcssqinibqifuqnmsxnbucmqiifumsxbcbcffmmmnnsubsuufsibfnqmibuqcufusbucmnbusscsxixsbsxiiimnxnqmsmxunsuusbisnsnmcxnnqfqnnufsbmifqbcnbcnbbfxcqmbcmimfxnxmqsscbbqbcsmnuscmimqiusqnfiqmquicuuubnfbsffmucuiqufxmnmcsxfuunqnqsccifufumbxibfiufifsfxsmsifbfmubxxqcxbxxfqxiqnbcuxbcuubssucnxqbssfbncciumcuqnmqmffxcmfuisbuxiuxcxufmufcufinqxmnxfcnfnfqmsxiqnmbuqsbbmisunfbmniqqsxbfuqbnfsbmxxfufxbnxbxmixsnicfqmuqmmfxbnbucqmcxsfxbsfmbqxsifcbmxfcuscqnuqixbixqxsbxminnbbnfcuqbbbbubqixinbsxsxifqinisbxnmsimfmffsniinfncufnisuxmquifunuibbmsnqxbfcfbimnciqqbcuxfumcumimxfbbnxiqmbfnqqsmnscqbcsxffmsbsxsnxcfibbsqffmfuxuquusbsqixmbsfussumbqifxbsisbucbnbqffqbcixxbqqcxissuuincbqcxmqsmsxunbqxsqbxcnqcbmfqqcffmfnnffibsfuncbcbsxmfuixsxfsfffmqfqqxiimnfqbbcqfqsfsbnmfxbnxfmxfcsbmnqxiusqminmxmibxnuqqcmucmqqnxicuufbqcimfbqqcbubxsufimxsxmsqqsqufnxiqicuqscxbbxmssubccxiismbbussmmnsqcixmnmmmfmqmsuciuixxuxuuqubxcbmusxqxxnscixcbuqqscfxbiubsiqumcfumxuiucxcxuxcincsmxussufccusbixsicuuxnfxnmicusquuufsmibuuqbsuucuibxibffxnnnnqmscqxmcnummcscmnqnxucfcuusixqcnxmbcnxnbmuqnqccunfmisquqnqnqxsxfxbmqcqcfsuuxmfsnquxcbqiuibfbuniscquuqubuxmnbfbffsubisbcbqiqscxififiqffsfbciubuuxicfnnmqqismnmxmxmicxiuqmsfciumcfbfnncnbnufmfbfscmfqibibccxbnssffmxiusxxfxsqunfunxsxqsfbqcusnbbfqbqsinqbsncsmscuxnsqnxnqcfqcnxccuifqqqnsunmqxmsunfnbxsqfuiccsufixcubfncmfsuxcumfffsnfsiimcxqbmqcfbfnmmbunusnmxmqibxiqccbmqbuifubcnqmffbmsmcucfqmmuxbubnnbfqxmfbbqnsfqxfqfiuqfnuiixqbnmufbmiqquuccmbimccubxiiqiqfsfcsncbbcmbusnxqcmxccxiinbqibqncusubuinimxbsnuqqxqfsbuqffbxuufqxsmqnxmfncqxinnxisxqbsbcinbsnqcnncsbiibcbsnxsfffibsfssncnsfiqcxixxnqcbqcbfmcuxfqcfbqicnxqcfsqufbnmxusmuunffxmuxibssminmfqcscxinqxixfsqnbfbufsimbuxcxmsfxccuqxffsmxqcfcfsxnqimmmusqifqsqniuicimnxiqsfqxsiisqmsfcbfqfiffbfqfxqqiiububnnbbmcuxinbicubsuqnmcxsmbcnsxumcssxmcsfuicbsucmcuqqiumnbifuxuqsbifinqnccbnumfxmmbcumxibunxbmxmcfnfqbumnmbcxqsnxuuqucssfsxmsccqbmxbbmqncxnmbisfmmmxuucsmmqbfmxqcsnmfmbusxnxsicusssuubcsunnmfxncxcbiinqnxiuucuunxifmnfxxcuquifqfqqiqsqmcbqcimqbfxixqnffmqscnsuxsfxmsmfnqnuqsbxcuxnfbqsiixxucnqcifubmscfmqcmniqmscimmmcfquxbbsfisxbbccxmsxbbcibiisubnsmnmmcmmbxusiiunqnisxfucuniiusuuiiicsqmcnbqxfnbnbsimciqbncnmcmqxnsxicffsuimncbfmmmxsnnxqqiiubisssunbfsinsqbmmbxfxnsqsixfimniqncmmmiqqmbcssqxunuxnbmufiscnbqfsxsqqfuxnqicmnsffuxubcfbnqqinnxfsxmqcccfqbxbcsmumcxiibnbuixucubxuxfscuqinfbnssnfbcmniqcfubnbbbxnmmciqmnbcumbnmsfsnbummfssxnxfsxixnbuquimcqmfmfsmqsxxbcbfsxqxisiuqbmcfiiuxnsbcnimicxsxxmcxsmmucxbccccmisucucicsinqsuiiuqmmcxibqsxxxnminfimsufqmiuubnbfnsmuimnqufbmxsuisqnmifmufucbimxubusnfxmmxmuunbibcnqcfcxqfsnumqbbusxqbxufunxfcusbufxsbnuqqqxubsucqfmqiifmqcsxqnbcnfxfqccssmxcqsqsqiqbccsixususqfcfifmsscuxnxmfqqbbcssmsnusfqnmfficcmquxbxusxxquqicnmqfqbnimbmisicnxxmuufbqiumbixsxfbqfbibucnxiciqifssunqfxmifcbiuubnsnsbfmcmcnqxisqbunfnqicbubcuuqnnusiqucfmsimcuminxxibuxubfisfbnbxsuuumbnnnciciqmmbsxcfsnqmxbxnsccqsmusxmibuxqfnbiqnnbnnmqciusxnsbbuuqnsmnuissuqxxxisinmqqnnscnnunquqxqnmfsqubqmixxbuibcmmnnnxxffqubxqmnubxbfxqqqsfcfnubbcqfbmcnscquqnsiucmssxcxuquunnsqnucqccmqsisbsmiqxubxucquxqnbsqsbscismbnnmubnfbinbumxfsnfccmiqfiubssiunqnibnfubxuccqfixusifncbnbmnsmusmnbuinxquscuxiuxqcubucqmxbfsxfbcmsbfnummbbnmxxsxxnnbcifqfsiiixbqmnnuuqfmcisuuqubmcumiicubbbscbfqcccqnbiqqbiqmsmfuibqqiuifssxumcsinmqccbcnqxfsiniifmqbmnfusxsxsnmqmxfbcbubcfnucsmnimnibusuciffsfisnqibqqmmiccqxxbnfmmqibusncxqnfxfuumucxxnimiinfsucinscmqmnnubqcbbsfmqibnnbsmccbifqquqmbqxbxbmqnbqcmxccmibsnccmcsxmnmuqxusxbifxicmxqcbuxifbixmcfffmiqqbxcxbiibuixfxcciicbsxnnffbqmffffbmsnxquifffusscfxsiufnmnbccnnbmiiufinbqqccnxuimbfmqfmfmquifxmfccbsncbxcnifbmcffncfxcuniminqbxnubsxxfbnucxxnsbcixfcisffbnbfxmqnncusncnfiixuxccccfcmbsuibcbcxcnfmcnxubcbqnfuccccqqxsqbicxxcnimsbfunixufsbcxuicsmfsniimqxsuucqcnibqsfinnqffumbcxubuxixcnnsmiqffusucmcqisnbbsxxbxxqqxcmfncinsmxbmsnsbmnqmxiinqmqbuxxfsssfubqqxmbxnsfcququmninssnncuiimxibxxuummmfsuifiiiqmubsqqxqnxxusmxxqbnxbnfsbxmnxxumxmbimuunifnffbiisninncisiiisfnxcsnbmnffixsbcsusbscnbusfmumnsfnqfmcqncfmnxnicxbbcmcmnsmcbcuicccbsnisbmibxxxfibxxminmumqfsiqnxmfffmxinufsificummussxinqcuxxnmscnmmsxbnsxqunbsqiiccfubxbmbmnxmbbbnicbbsmbixcxqcnmiimcqsumunmqxcuqifnccicnuqmfqbmqxxnuisfsfmqxmnmsmbnmnxsibsmxxfxiimxscmnxiqxsbmqnmqqbnbqnncficsnscffcximxfnquimsbnxiincbxcnuubiumfiqmmqibcxqusfsuiuuxbqsqbxcuxmfqcfuuqxbbifcnbqfisfcbbnxnmsuinqmiuuinxffnbmicfxsmxcbqcnmqcqxiqnufxfsnqufmbcufsmicinmsxbinusffbmcinmmbbmuqmuufqcnmmnqbucmunqqxqnbnbmiscuficisunuibxiucfcfucsxbfbxinucsixxsnimcfcsmbmimbcbqiisbcfbicsuucsmcbuxxbxcmbxxbqmqfcnufmqqcsfufqfssiqqxqsqfbqquxsuxnnmunfumqsqmummuccqifqciucbucsffcnnqquuuiuxunibisxbssbfqucximuxxmmqmucquimccqsfqfmfbixucbsnxubbussnisbnifbqubsfxnxfsuunnsnxqxbsxnfsfqnsbmunnciuxnmiqnixqbssbiiiiuscxuqnqmnnquncnbbunccnqxmbiinismxciufffxcbqcqunsmxssxuusqunnfscmxnnxusinquqbcsnqfcsucsnqxnnqxibuxqcffnxfbfqmqmbcmuxccmumcsiqxbfibqxqixuiscubbfnimqncsnuiufisufnnusbxcmsbixsfbbmsiqqmbqfibfqxfinfsxqnqbmmsbqfmmcsuxcxsmibqmnffcbqmfscxsbunnsnfssxsnumiqicsmuuiqmimuncxmfmcnuqmsnqcmcimusbnxuunubcsfmbfbqmqqfscbicxcxcbcsxqxqmbqfssffxfsfsxbiuunxfxcnimxxismnscuxiinbucscmffbfiiuisxnsuufcqnbifiiqfqbxccsifbfmxbissifusxixfcfumxqcmcxxmimqcimfbbmxfnbuucbmuinbufmqcbubiqbqxunbbqicnncncnnubnfiuunxmbnibnnbcimxxxcbquuubficuiscqnxcfiuccfimbffqxsifmnfqinxxcsunxcnfimxxniiuxbcifbcxbbcqsciqbuqnfxifcbimniiibqxbinnbqciicbqfiibqccmiibncccqfcfxfbnmubixfbxqfbqqfuuusbnxxcsxnuubbmfsxmcfubucbxuxsbxxbfmubqsmmfsbqnuuxsnqisxcxcfmsmmnxisnmsmcubunfibxxmnxfusmncucffimuqiqbbqxsbsfixxnmsbbniimmfbufqubuqximcinufuxfbnsbsxbmcsfsmbifiqmqxxssncsfimiccmxisucucfbsiicuufumsnfmibibmbxmmcsmsbnbibmsmbicsbsbnbfcxbxxsqcbicquscsbsxicncnibsibbscbmmuunmxqqssubnuixxmnisbbfubsffibuncqbsfuumqxunnsbmcnxbquunfbnnminsxcbmxqfccbsfcusfbqsucnqfifmbiuubmscibibxnunisisufiscfcfsinbfbmfcfnifcmcmcxqxbcqufqqsqixxciiuubiumbuucxifimuxmxfbuuxfbxscxxinmiifbbimcqqfxsffmqbnniqcfmnmfnnsqqifxnufxbqiuqmbucmqsxifmmqfmummfbfffmnfsmxcsqsquixcbfibmificbqsqcsunbnxfmsiqbnmimsncfusinnqmbcbscxnbximuusismfmfssmninnmbinbiuqmcsumxnscnsccbuccmqmxbnmnqfnmqmmssfcsnufiqmuixiqbsssqxcqnffqbmimxqfmuibfmxbiificqcixcfunfbxbbuiuxiufuqsummcbxxcfuximnqxqmnmsumciiumnqsfbqmixubxmqinsqmnnbifxccqcxibbiqmfxbmcsfbbfbbfiuucsfcbmusfbciffcfxnmqxfqqqnqsimcfmqmcniscmqbfqfiucmfbsxfsxbcbncubmisifsbnscsccinfsiimssxsicunnsubqfnfbibmiiibqciffxbufciqqbuiccfsssimqnxfcusqfsxibqcsssffcmubqscqqxisfnxxxmbmciqfiufqqscqxminfscniiqmbxmffbxuibiisfqxiqnfimqccfnumxmmfqmbibnixsqqbmbinxfiuuuscxnqificxccxusmxcqnuunuccuuicsnbuqfuxfxnfqusxfqqfxsmxfucsiqnimqnmumucibscqnsiibxximquiniciimbismfxcbncmiibnuuqmimbinmmqiqsncxxqbbnbxuumbxmnbbxsunmsnxbcqxxunfbmmufqciqqniuxuximfnibuifqnbnunsbmbsffmqmxucmxminimiifmsmmbiqcicmqqusmmnmsicnsmmxbxsuxiqfbfnnibincsxffcqqmnqmuixbmminnnqcfniquxnscxxcfsbnmicnnfuxqfbumcxnfxicnmxbuubuccmbismnxsbubmnbuifccbxccxfiimuqqbqsssfsqmfnbiqfuimmfmbsmucxsimuifxxiqfcufbifcnqibxssxcxsfuqxncunnnbinmcbbbbsiiuccxsmbunubmuscmubfuqqbmxbfibucqxufsimxfbnuiqninxunqcfsxqcunsfxbuxmqffunqnxisxumbxsssxxximsusnmcnnxbuqfnfifxmbsxxsniusxufcfqqsciqmxniffsnnxmmnfxnbxiiusbmqsninmfibnqusbuicfumbxibciiufcnuiuimcsnnuuuuqxmbbnixincqqbmnufxscfxbfsnnfxcnxusscssccbuqxsuxmismiuxmsxfuxqciuibxbsmicuuniuisxuibsbmuqxfqmnnxbfuqcxqsnicuiicxismcuqsmimqiiubxbiiqcuqsuimqcmfbmcfqxiffiuuuqqffqccqnxumfufmffuufqcnmucxcscnbuicfnxcnbqiscqnnfbnscsxsxiunqfiqfbbxnfxqniubqmxmcucinubxbsnsfxsqmscmmubbqqcmqmsicfbimmmbbsinnqxbssixucncfnnfbuimfsfiqbsufssqxbsibxcmiuxmfmnmfixucfbqcuccfiisxqfusxnbcbqfiqcuqfumfnbqiimsmqnifbqinsiqfiqicbnbicnqfcbnuuibxsqquqcfmfmmmcfsbbbscnqsuncnqsbxucbmccnqmniufsxnxinqfumiqiqbfqqmxqimxcqusmfnuquqfnbibmnfbicbcnsummnubxfqscxmnifbfmnqcmxnxnnuxscuumbibfbqqscssibsnxxunxsnbfffqsfummbbbnbncsubfciiisxfnbbxsxqnicfuqcfsfxnsbcfqiucfmqxfccmcuqsiibsqmmqbqnbuicnqnbuuuunxqqcxqucubsmcnnxmsqiunfcbncnfxsfsissinfqufuibmqmquuqscsmucmnfuisqunubuqccmcnmiismnxbsiusicbfucqbxccfcumunnnmibiuqqqbsqixfnifiniqiixqfqqnsnfqiuixfuxqmuxqsbqqqqbxnmibfsxcxqfxnubnsqxmbnifucxicf\nmomkkmvmkvximxkkpmpsxkkixsiyfksxpivppxmoksfssvpkmmmfsopvxmsmpiyxspfixmfxfvppmiiyfxymmfxpxxvmxviyvyxfopxifvykxvyokvvssxymyvykxiikfyossffokymmoivsvffymmivppvkmfxvsfiovivoikmffxyiooksiosvxvxyspyoxovskoopifpmyoimkvxyyvfsyikofyiximpkovmoyfoipkvkppfxismoyvsppkssfyykkfymspyiokfkkyvmssokvfixxppvooppxskfsikspkspyoifokyfsxspppsfooxyoomopyfyyvfovixmykxxxvvxsspvsoypxmfoyoxyfxysmifiimkkymffxpkxfkyypxkfxiivvppsofoovpspoksvvmyovmfmmxivfmimiyvpyvysmsxixfmfsyimiikompmmsoxmpxsmfkypoxxkoypxkpyiysxispkpmvvifvysvipysxfpkmvsopvpmkoffpxiixxovfoyxxsvvvmssmiyxypyiikvypixkmssvsoksfkvisyoskxviomoiyivyyypmkikmoyoomvoikxvmmxpksykiopmsvoxofkmypvxxsyoypymsmvyfppkkfvpiyyfkvsfkvymyokfomspyxxmvsoxyvsxkxsfkixxvmfpmmxpxffimpvmfyypkiypikmfpskxfpommkpmiofpkxipyimvfsvsfioxikkspoifyviympmsmxxkpksvovsopiokyfpkiifiskipiofomikfxyixfomikpmxvmpskixisksikpksmosoypmvkpyymmvkomvposypmoykivxovpxfpxfmiixxissmfvvsmvosiikkyopvmvmffopximsfxoxympymiivsxmsxkvfmkxvommoopskyyppyvmomvpykpifkxisssyvpxpymyomvyfkisofxofmfpmvfxyivpsoyposkmxipomsxsfsvmsffkivkoofxxovvpkxypxxiofommpximxxoykiiikxpvikovkkomkvofvyooomxvvxipvskfkxvxovskysovysixvkssiokmoxymxypvpoksimpovmpyoxkikkkpyovopvmiomsvmxpxpvvyksxpvyykvpkpsmsffofxyxspymxivxmmmksoyimfikovxxfifvkpxykpopvmoxmpivimkxosxxoxipmfisxsimmsmypifovpkxkoiokmsyykfixpkymfsxxyfokvoxyvkivifimxmmskmykypopvxspvvxsxippmivfofpmfsmpxmppiokpovyosfxoxiffxopxxffsykixymfpsxipimxospyfmpfmissfvvkvxpykfsmfmxsfffvxsxsimksyykspxxooysfpxsosipxmpsiimpfkpfxiomfyvkxykkfmpoyosxfkfpykyvpimsfkkifsvfiisoyiovskofixmfkommopkyikoksfpimmfivkfpsfyssvvopskkkssisfxyyyffoikvpixosxmfxkxymsfxosxxyfyofkosyyiisfkxmpvvskxiyffmmysfvymkoyxxyyvpspxfpmpmvkiofximyvfmfiisxyssiiisxppfkvokisiiymspfsxpsvooxfvmxfvpvmiomivmvpxvkpsmpxyyfmimvfvyvpofifxvspkyyimvvfvxifkmvsiixoyvkvpofxskipskvikoyppoixiikvokyoiimikpmxvsomvpfxokimspksmisvxoyvxxspkpsyipoxsppmofksmyiovfkyipxmomsffopfsoiyxykikxvfpksmovvfmipxyvpofykyoyvmfisffvpfkspoomspispmovvoyspvxomvxfsvkspooimvvsmppisomvfiooyxpspoiyyixyvppfyffkxikvspkikfmssxkvipxxvpifmmfokfimxiopsiyxmomsxsyivkkxippymokkfxxopkkipvvpisfiovopsoyfifvmmyvmkimsskvyopkpxvvisixvfspsissyyxpvokkmyfikfpvxssvvvypfvikmpvikfmkpfvomspskfokmvsofsvssofispfyokvoyfsyxmspfykkmmvxpxfisyppikxxkfyosipfvfxipixyoikomxysvfimsmypvvmokoksixkkfxyyikiypfisyxpppisxpfvmsxkiosipypvivfsmsokxmpivoooffvxpvmyfokfopikvkpmvsfsfkoixpxvvyspmvsysfmxskmxkopofximkopvvpvmvkvikfpvkypykoysxmipymiyysypsksfsfooyvoyykvxfoxmmfooxxssmmfmvosvisxkxosskofpvfyvomopyifoskxpomksyyfpvvpxfxssksppokpsvmokkkokpkfivpyxypyksfxmifpvoxmpkipiomokvmpfxmokiffokpmvkyyimvivioskipmyxxmypypfmkfyfvofspisvxsyixkopxsoivoskspypimmmfsysxxikyikymfxxivxkpifoxxyyyxpkioxkkpkokkxfxopvoxpymifimykxmpxyyfpsisysiisxikmopyxyvomxxxkmmsipkxxmxyisoykovokoioofksfymisvooxfofkixksxosoxximfvmkvmkpvmivsmfsssvykmiisfsfffmsxssmpivfpkypkpsxyyfoppkvfyopxoivmpkiyyykkvkmvkfsmfpkmysiyvfmmoxifpyyxvimokixopsvpossfmvsxpsxxikivfyfxvxsipkyvifkiykxokkxoommvixvixkxvofsppxkxpomiospxossviffppxysvvkmkpvoooifffkoivossxifixsxxsxyxvokfosfkixmmkopksskfkispfypksspxifspmoifxvvpsvxxxspxkxxmioosimyiimymyxkvmpyisfkpsxpiyokkssfsimkvfvsxfpsoviofsisvpsmfffysyvmifsyymkypfsfovmpsxopoxyivvvxixysiiykpfkkpffxmpsmfxvikkoomyooixokkissmmxyffsffvsovokyxsmiokkyifisspposoppsmxpsofkyomifvyviffspsykskfmopixyxmfmvsymvyypxkvsssfkifxpyxmisvixykoispvifpskmikoxokfkopyypvvsmxisfvsvvsfkoyfxpxovxiixmyfmfmpofkpmyyofyyxpksyipmvxivviiovyvsviiyxkxyssvxvpmipmkifpoyxpkovfxxoiyfmifykxfyxxsivpfmxmfxoovomvpikpvxpyvfkpxixxikfvoppiskyovsspfsospkiixsivxyfyxossfxkmyoyiikyovyifvyxsxypffokmxkpfsvffipvposfsppxoxvkoosfpkkfsxvkmysomxifvmsyskmppfkxxmioisvvoxixmisovkoookosopmksmmviyisykiiyvsipsmsssfffxoxxpiyvsvoxskyokxpyxoxxfovofoxixxxpsosmkyyxfopvxkiyiyfiksxfpxiyfmsxisfmfyvfvpfymkimfivxfkykyvppmoyvvyfppmxmmfxvskfyykmxkfyvmokyffkfkfsossoofxopiyysxyssyfvmmomvkkxfkvvvximfopykkofysmivsmymppxvovopkokffviysimkxiiovkxffmpxsskksxomiovkfosvyxiomfokssypfmskivymfvipofpovpxvxmvkikmkkyxsyyxokpssoxxmfsoikkvimfxikpoykysissxfixvfyppyxypiskxifxvsimisffymkyypisoskyyoyxkfoyoffyxikfkompxmvvkyomxmpvfpyooxspfvpvsypfmvoimspsxfyymmmmoksfppsxkpoysmvkkiyvpfyfyxxfikpyxxssmkvkxsfmoxpiopisoxymyvysvfxiosxmkvsfoooxxxsxmpyvfoovfovkiioooopxxmmxpyopyxyofopomvxovxvfxmiyoiyomsixkpsykiymskvmkpymfxfysvfoisxmifovpyxxoxkxxsifkmiopmvxsvmvvfokippsfpxxipiskfvmovkxkkmmvxiysvxxkpfoimpopvkmxxfixfxsvkxxfppfifxivxvkmvyfsxxfoppimxmxiiyvoixsvvsypsimyymomfkpmmympxvmkosxssipmoxpfkkxmpooomssmspovpmpfokyysmkyvvkkimivsiopmmkpvxoyfypsxofvpxmpypmxoxpfvxyvppxpyixpyosvppyvpvfmpmimkokxfvkxoysmkxxkfskkvoomyxpfmyomxvoosmfmxkyxfyfpvvypoyxsovmpfvyfmvfsokpvfviipfoixifmpofvpiosoympppsixixppssxkvisfovppsfisoxppkxyipkxoxoiyixommxomkxkipkmyvxsskvfsoikvifoyskoxspfkppspsmosvffpvskvsxyokmsimsimxykxikmmvfokymvmvoyxffpovvysfxovyfiofffisfmopofvyypfisipmypoyoypvximkiomfpspiisivmpoxxmmmiksfkmsifkmvpooxpvikvkkpmkyskoxomkkmioipkisvvxpypovxsmkkkyvysmypofoypmxvyxxfviykkosoiofiivmkyovvfpimskxvvxffmsixixymiiyioiipxsypxfoooxmoompsisvxxyioismooxokysykmpyvxvfyoovfkfsypoxiospvfmpfimvvxyssofxfffokvfipxxfvofmkfpyykvsffssxkpkifsxsymxpomsmsixfppxxpiixmmimoyxxsxsoypmipvviyvxisymifkikokimosoyxoviysospkmomfmkxfkkksxoxksiykfikpmsvykvyppmfvymsypimvivmxfffsxovxxvyfkixsxkoyyimvxikosooixosmsyopipimfpffoxykfymkvisofpoffksvmfspvovxixyovxkoxksmsvmkffofpximvxfvpmmxksfkmxvkoxkmmompsmkpvfxxokvssixvyvfsvmkoyyfmkxyfsxmxymsopfsfvfyismpkfvvsoipsyypmopkfsoviifvvskimvikiyokkimyoxksyyksmfppvvviivopovkvmiismpvkkspppsvypffixpssxxkpmmsmpsfssxmpmkpvsmfixmispyvypkyoxffofsmfpyfomiixfiisisopiismsmvvvpyxykimkvpyikxospkmpoykimisxykomfoppkkoifmxkkkpfpvipivspfsssssfvyyxoiokxfpkisffpkkiyskmsyixfmpkifoxiiovsivvkmyxpmpvivoxkssfxxsyfvvvykxpivffypikfyvpsyfxmxmpysfyoxvxmmpykvsofyxfffxsvkikposfsfvpvmkxoympfkmikvookofvoyfmpyxooofyvfkyxvpisfffvvpppmimykpoypkfxfkvspxspoxyxpofvfvmpvpfvxkvpxkmxiiifvfpkyxpfyyoksxiysvvmkyspxxvimssfkmiokmvxfxmypipfpoksmisoixvysmipysxkkioommkfokovpipfpisvxoxmmpyfxivivovmfpomxfmyxvvpomxkikyfvykifsmxsmypoisymsyipifiypipypxomoifsioooppmfixsomvsmmkkomivpokfkiovomomyfkxomipiymmskosofsfoyvxfmffokvvvfkxvfpfkksfopipfpmfoxmkivksvimissxfipvsosxsxooisoyvspfyfyssiyyosmoyysomskfpskmypyyipfvimxooiikpsvoppimsfisksiiokvixvsxomvyffmyfsmyvpysooxifyssvvffyopommsoosykfkomofykykfsofkiovkmfpipkffkfivopffmyxpysvfyipmymffksokomispxpksxixfiokovsiyoyokivmsyisvkxsvxfmimkymxiffomykppokfpkysoofyyyimmxxpxpsovkkksmpypokfxyimfmoivmxfxxkyskikmvmppipkpiixovivmpfyfixiymyoxoxxviyyymmxfofysvoyfxvysopsoopvpskofsvyssvkmsyoxiyspvmmvspppspmippmvxmmfxofioixvsmfosyisvkmypmoxsvyyfmpkmivpvfkvkokxxfmoissisvvmofpxyxvissmmpfsmxxymxmpvkmxxkkfimpkoipxkofxskvmkxikopokyspmiyfxkxopivvyyxsxvosokxooivomsymmsifkpsmmiykyfymfvpoksvvsviopvvvkokpvypyfyfsffsyypkfvsxokipxksmkfymkxyksyifkvomkmmxyxkkofixfksipiyiiosvkmomykksskipmopvpysfyvmyofifsmokosfsivsxxpvskmiymimimkpfvmpiiyvmyiksiyxfiooookmsysfimofvfmfomffmkyxyvmskkookipffkvkfpsyoyskxkxysmxxvsfxxyykysppmxioppsmmvffmvspmfspposypkovpmpvffpvskmsiskmysfofokifomimmfmkyyppfvikmyxxosyofssfpspfsymmkoivvipkkoxkfpfmoikmvyvosyxkmmxmvmmyispmkvmiosvvpsipsskvvsyvvkkmyfkfyypkffmixkovxvvfoopfsmmvxsofvfpkpoykixmmxsmixffxvvxivmpxopkkfviikmfvsfsxifpskmoyoxxyffskkkkyfxopofxsxmkkpfmioxvyxvxppxmxxosyvxikssyifpsfpssxsyssffsimosxvyxxyypyfvyixvpvmmmyfxkvvfffoxvkpvpsvsfvkosfvpvsxkxppoipfiiopoyiompipiyppyfypfvvimxpxvvmixxxfypooyxfmysxsvfxsimxvkiksxxokiiimmfkpmsfximofxyyikxsyvfsioopvxifofvxpfffyovisyyyxkvopxpvxvmfyfxfisyivvfkkyxivospmvkvimfpkfkmovvvvkivpxoxmoxoiypoysmposxksoxopxfyyfiixmkxvfkomimppooskmsmximpmkipmmypsfvoyopfoxsvmvfmmivssyvfpkpxkfkifimyxsmpvixifomviyxvmfmkofxiyomimmypyvsvvsffyoovvvpvmsxsmixxkooomkifkykyiyvkfippovsxiipmippvyifxmikssiyopfiymovpopkivfxxsmkmmyvmpvioxsoixmyiyixviofskxkfkvosvkvomvmxpmkkxvviksofkkmpvovxospfpxspofifypfooisvpxxikvvpvovmpkifvofsyyvpvvkmfkkxoisoxmxpfyvypyvyfvfsifoykysiksiofpkkoksimsffkspssxyvkpsifiyvyyyfoxipvmoimfmymimxsovkyfmmvxymosxfmspypmskpiypyyvixpiiyyvvmxxopsfpofvvkipssyxpmkkpsioxfymimpspkpypimmoppmiimpixfyppxspypkvxpykfkfpoyomykxfmxyiypyomsmsskxosspsvspvimxxopvvmymoyivfooimxmoikkxxxfppoykixffpxxsskvvpyyixkxvofmookpkossipikmixvfyvkifmvxmoiyiymfvmxoosmyisfpfmyyfvxyyxxpvxspokofffoimssosppmfkokfpkxxvfxivxyvkpvkfosfpvkyopkkxyvxokxsoskxkfpiymmoipxvvxffoixvixosxomxvviivmfvifxioikvfspiipskmmpxmpxfpiovpviopymvspyfvoffykvosykvxkskfsyiimsimmospkfiyxomvxmxvvmovxpxooxpvkkkyoxpsssfpvpfosvmmskfmyspovvyxfvikpymmomifpomxfkviyiypvpspmkspisymvkxmkisyooxopxiiymyvpyfovyvoosxffkpxsifxyyyoxpsskpyokmyxxfoxsvkviyymsxvxkmfxfvpixxyxyxmmixsymimskoomxyvsfppkfmmyvpoxkxsyoxksofyommvyvmymymkypskmoikfpyfsvspioikkpssvyvimfpmxofifvpfsvmkmoxiyfsiffkpfovxyyifxvvyfxiyyomxmkkoyiiixypmyfmixksovykiyppykvmioivkimypkymfpvfkymykiyffoosxsopkfvyvvipmiovippifxkpvvxyfxokfppopmokoooifyivopyixskopsxsokvxmikiiykysvovvomxkxkoxfpxvxmsoyfossoypxvyipikyxyovpympmmokivvxmypossovypiomxvvksssvsifxkokikfvvskiosvxmvixmsofmoyyoykskkvpvfsmsfyfyopsmixmfyvvifsvpmomkfmpyiyfiiofsxfifkpoxkxysvmfmyxpmvsmpvfopifkixxsfpvykssixvpivxmiffivxxkympkkxoixpofsmmxffsipoxiiofpivfxximxykoifyspkfvoysympofmykkmvsxskpmxyokimxfiofsskofxfsyyykfpsomskxkpxkvspfkfmpxysmypfyyimvpxmkkfyxsovovpsyffsiomfpvxkfmkyfxsmsxxkympykokopxpfyfpvxokmsyovomxskkopiyvovskfoysvkyypipyffspixymvisvkskvmkmxvpkypxoiyikixxxviyksomfkxxyyxxyxyovvsvskvooppspmyososxpsomvssfpmpvvmkisvpfsyvipskysxkmpvvyxvxpvxfkksxpyyyvpofofpsoyksiffmyivyissfsvmvxixxkfvpxmxvpsvskxfvkmkopikkvpkxfsyxxkiomyvpsyfmvimypvmfvomfomkfvomxomippxffpkxxymimiixxmkkoofsvxmxmpvvsiiyfxymiixvsvypyoxkixmsiyifkxfvsokikpofosokioysyymxkmfopiyfmsxxpkifyookxvivmvvokmfxyimpsmikipivsspypsmvmvkmkyvmixvxosipvokfvkskxkofskpkyfxsopifmmmofomiyifkfvyopfimpivmoysmspmfimoxfxyviixssofvvixskoomofosvpmxsmxsimovkpopsfimypixkvxyiomkpokvyykxpvvyfyiimfiymmofvovxyvixoxkyvvmoxffmvkfykopyxixompvxmxypfikmmyvpxpsvyfvifvpyxpfkfvoxixkspvkkmxskxikmsyvxysvksimivfoivvixsyxsxfvivvvfisxksmxfvvvvxsvxxsysiopximvpkxffksmfmiypoikyymovpovmkkfxsmyffosmivppsvysxyypximpyxpmykkmpksiikyoosvmspxypvvkixsiokfokyykfkovmpkmifivsisksmvxvoxksskxfxyiysmmvpypvmyvypsvsmysxxsfyxppoyoxpkfkpyyksoomxosvmvikvxsxpsmxsxkkppvkympvxxxkyikovpysxxpyyxpfikxyimfoxpmsykysskpymsyoxxofvvpssoyffvpmvvypspppvxvvkkvkpffsxpovxkxfysoyosskxxvxiyxpmxoksyvomxsvvkpfxiskfofsmviivsyvyivopvipmoyyvpyopvypyoiooivkxxyxfiiooiiismkskfkpvvkfkpkvpimivmpxsysmfvkoivfpyoyxssvmyxyommkkymossfxmvmxfxmffsspvmimvkkmikykxvfxvsfmmmofyixvmfssospsvyvxismyovksvsoxkkopmkmkxioiiiyovmyikvsxxpkioyxifimvpfkixppxsfpppmvkfvokoyfpvfpxfvfkivxvmppppkixskmvpvifxixmxiyofmyyyiipkovyyffikofxifvofmkvkfkfkkvkpixmsimosmpiksfmykmvsfovyxiskksokmsxksyiiofsffkfvmyvmkosoxkiskopmofxxoxpxiyxxxpsvixmpxykkfxooiixpxmxvxmvoxopfmxkmxyxxxfysmvmskofxovxmsiiymykyyomsxpioyvvxypsssopyyiisvyspiifmsypppskxiyfxsoisovokiysmxiikfsvppymkymxipykoysxvxixmiopymvykkvfvxovssmppxfkxmvomysspmvxssvifyiyomyfpskkyxvkxsxykiymivsfyiyyyxfyiypspyfookxyffvkmopsxoysfsfpxmsokyviofyofssfmxiiokioxfmmmkmsyyvipmykyvsoioomyxxkvypxpvfmvpkpiooipfssikyispfkmipppskoosskfvysksfvxoxikypfioypkxvxiysxfoioxspkkpmppviosiopxpsvxomyymmffvvkkkxixmkfmkkipkyffyoxsskvfvkpvvvfmyskmxsyfpivfxxfsvkmpxpvmyksikoiyvkyopyooysoxyyomiixkvvxiossyxpofykixomkykyoisvpisyvfxfffisvmpypmxxsfxsypokmoopovyvovfovpvmiysvvssmkpmvyvskkvyvfioyvooxpksyxixfmxyyviyssyxsvvkvivomkmxkypkpfmvyofovoovsofpvooixmkpoikyimkyvpxsxxppsisiyxoympvimikpoypmymkvkovyxvvvopvpmyfmmipfyfiffkovppmmmyvppkiimpoxopxmfkfvksoifykfppopxyyfoisxyyyfpymsofxisfmvyyofmkxmmffmpyfomffifpxfxfvymfyokfkvsyivfkoyvpxssiskssxkpyffpkvkmkvyvxvomvsymmfxssfxvxysimpskoypyvoxkpmmoyfyopxssofppyfkxssfpxxysvyofvsosovpmfivfimmpmpxmkiypffksvfpmyymkxvksispokissfkviymyvyffysxmfspvfvxxykiymyxxvoxkpsiffkfsymvmkmxvfoopkimxoyofopfpsvkyikomvmfxpxomkpxmiyfxmmfmoyvviypspkxysiipmvsvfvoffifimifxksisvmpmmkyxkfvpkpfpxksixvxpvsfypfmypofvxvmvsiyxsvsmmxxykisisisfpkyfkfsmxpyvkkmkfysipmvyvfppxisismskifimsmoyokpyxmxovmfmpyxviiyikxyyosyovfoykpifxmyfmfvkoiyxxkvpvkoivsfkiyyskoomvpfsomiiivvoyikpoiopxsfkfpskikyvsiofoyoiommimsmkoskykpvmyxpiyxxyyvvkyfsxoisfspvipmyfysmyovxsfippvsokxymvsivsfvvmoivmmpvpyikvyxsxfppxsmymovmmsixyfkiomyyioxffvspppxippkysfppsfykxxkfpmmvvokxpxfiyyyvysiyxyoxmkvyvyvsvxvisyxmpmfxskkxooiviyfpkvkmsmmpmfxposxsvxvvfkiivisvvovvspkpxvfosoovvivkkvsiffksypxykpfsyvmymyfyxfffixsfyxkkokypkkosypxfimmfxpfsypvyyxpifkxsysiivpssxmkfofsmkfyifymyofkssxpifospkmkpmyxmisosssmsyvkmpmmyxspvkkkixypkpspkipoyxoopxmkpyxsoxkmmpfvykmpppyssoifxkmvvxyofmmyippssfvxvpoopvyvpffymikmxiiikkyipxipxvispiiympoxfkoysyvvvoskkfxixpkixskxfpmxosivfspfyyxffvospppyisvxyofmyyfsfkkvssxsivssmmxiyypovmvyyyoyxvipyosovivvpsfoykymffsxkvyvmmfosyopippmxpsiyomvfsisysfkxsksvkvsxmvvpomoisoopioyoppovyysvmvpkkmfkvifofismsyssfffiopyoiyfvoskpvfoipixofifyyxpkxksxoxosxmpvvxximxysyvimpopmvpoxmyfvixmsyoikpmviviiiimooxpmvoyyysfvkpisxommfmkimopkvmfmfxymfffvopsmyifyvmfxiffmkpmmvfmoossvvsvkipmyvffykvoixmposfmyxkyxkyoymvmkpvpxyivxiskfifsopyimxfsvixfvkspvisppvovmmxxkimismipymxpsofifmoismpmopvmfxoxxkpksvoospfxmkoippfxxyiisomffpmpxymikxsisskvsxffimoiisoifpmivipxxvpoyikmfoxxyfkkifmpkyiymkvmposymifmsoykfvsxoxvosskvvoxooiyomyvmimvkpsfmoxpxsomfmxompysykxfpoossvkpfsoxyfkmixmffofpkkkpkvikmmssvvmxoxxvkypooomfmxipomxyvymxsvymvvfmxpxoxmfvkiviypvffsxmkkskxvxyyivkfopkiffffoyixoovmfovvmokpfsofifismispkpsooomvysomksfyfopvykmoykvffxpikfsimfvvimkyyvsomsvykkmvofvpimivmimpyykiksfofoioyvfxmxoyvpommimpxokssypivvspiysispkyyfopxvpokmfsyofsisixovsoykoyvfvkkppykkifppvvvyyypxokxososvssxpiyisfpxpffxyifkkvsxxoypsxxvopposooxkvsfpxkvopspvmxikxsyoiyfkkmpsyfkyoiskkomkpfoyfkooofymmvykysyxkskxmsxxsvkoyypffpovvmpxippfokkfykfmoyxkvmxfpvoyyyfimpkmyomsskofpmkvpsmvokysvkoyoiivkyvvikpfipvpmfvoofyyivskkxmvvmpvomffppymvfyxivomymmxkikoxpkxyivvpooypoxmiixyiyoyyfivfiiviyvkomfxfiyxkvfymkoysvpvsopmvspvipfyxymspmxomkxvfyomfsiyfismkskxyfxxxpvpoffvofikxfyxviskfvvomommyxfkoipmkmxsxpomsfiismsikvfxiyiyyksvoympvpymfpmfkxoiioikviiopfvvsmyfxiymfoofiyixmsvfmsmvxoffopypioyfosfsmsfvkpkvkspiofsfvipyyfsvmpxsvxvvsikofoxfxpxffxokykxpyvvkokvfokovfofvvffkomopivppovpovmvopkyipoyfkvxyppmxopykkixxffykpsfkkypxysxoxxxsmsyipsypkisvikomsskfopoyoxfiksvfypypofkysmkxmiippsmsysisimoiosxspkvsssoysvfxsvxvykyivisvxofvfkymsoomofvskpimvsmpofmsyooiykipsxmvmykxxpkyxifovvoxpkikmxspvfpyyikksofoppmvykfvsmxmkkiiomyvpopppvsvpssikfxfyyxyksvvmoimkmxvpsixfsfpmovxmoyyiivkvixmipoikxskympxpsvxofiyfiyoomskivxpskmyyyxvksmymmmfsspyksixkioxfimmpxooivvymmivoxsxyivmyvvskmskxpsikfxxmyyomxmfpkovipimvkmpmfyokokfkoooivskokioispfykpyiipmpykfipvoykmxvmiksfxkppkyisvpxvxkpkvivykkyvffypvyspvpssfvxsfvvisvmvmmxoipmmfxpimskmvsxxyyiivsyvoxxvvmpsmpmxxmixiikfospsomkfsmyiyxxoyomixvffisyxysvkyyfxkxyfokskifmxfyvfiikpsokpsoxsmxvvmfxoxymkmmkixyomoviypkmmvyovipxofvxikpikkifvsvoixpsvmsokysmmxkoskmvksyxopfysyopyomfvpfvkmmpymifimoxvfiixiyssofimmvpikkoipkmsvyxfmxymssoofyixoisvpxyyypokiksmfoymokppspfmvfpyovyiovfoiiiipxsyfvfxysmxmfmmffpoyfsvoikovkyspoxiyiyxpxmmiyipsyxsxmkiixyvvxkvyyskpsvsomkkfokkxomfimpovpvkkymoisokspmyvfyookmopsopfkosmfsfkfoysxmfxkvfisyixiymsoxkvoymoompsifmyxooppxifiyvvovfymoypspiipyxvmisvsfxipkxpmkmxmxyxkoopmfkfkossskvvomkkyimipvyfoikskvyikxxsyvvxmpsvmvpffvfyvpkfvkxvyysmoypmvifoykpsimpvxvfyfsmkvfxskkyxppmfpoooykvvvkyixovomfvsismfvpmkixffxvxvmvykxiosoiisvxppiompssfpyspkpmysoosoyvfkyiiismxxoxsmkpomvfofssxoxxvfyiipmiyfpsxvsoipfsixkokissmivsmmskmpvivyvfismismfxssfofiskypvkvyfvkpkvvkkkxfoypxpmxsmmovxmooxisiofppikkfsmksvkxmpxpxxpfsppfmfififfmxssxxvoxkvifsmsfyvmyysffmsmkkmosfixxymimfkysfsppmsmmyyviioxvmkfkyoififmspkmvopompsmsvxfmivkviovkymyomvsffvpimvixxommpyvpxyxymyvmfsyxkpoxsfskpossxvvfspmyfoskokpoxffxpfooxoxxixofxyyyikyffopoffpksiokfpxffsxpvxoifkpxpivsfkopmpkffypkfskpmkxivvkiksipkfokykixmmifysyovxvxyxfvfmpmoxxvpompovvixkpfsoxmpfivmxfviymomsikvsmfvsmvyymximmmomimkfooyoypkikovkfkfyoyfsiissfpsxpxsmvomsxpkmkyixvxiomfixvmssxfykysmsixkkykpixooxmxomfvvkppkxssmfmisippoyyixfxmvxivymifspixsmkomkpmxmofxxmykkovvxvskxiyixksmivpxsmosyiysmvfoisimoimpsyiypivfxipfvyspmoisopixoooxmsffifvskxfpikfvvvmxmookposkiisxpvoysfpfvxvvfxsymsmimxpymvvssimimkmsyovosypvfsymsmffmpomiipovofxpxoxfxsvvmipfovpyvxssxffffopyyfposifxmxpfspysyxxxopsovkpimpoyxokkiyfykxkpkvoxxyvpoxfxsvkommkmkyoviixkofxvioiokyysxoxkmvfimifxfsffsimfoipoopfvmpxmsskkmokoxmvfksoksppsviksfkpoyvsvomxxiipfyoyfyyoxyfxpssifisxxyvsvifpfioxsifxvsixyopkfksfikxpfiokfovmssxopsmmkvooioopixpyykpkykmfkiyvoffxxsmyviovsxfikxosxmssoxpmmsoxppoksisyykpmxsmioyoxmfkxmmokofxfsisoyksmyfmkoiskyoyvpmkimyiomikfpkxipiomkyppoxvikovssxoypviymfkkokspxymkkifpfskvpvixxmosxfkvxmfmssykxvyxpsxmpypkvxmpoiiossmmssxyvmfmipyiosfkfpxfkopypsmxkyoyfffxpimixvksmvvsvyvvxmosopksofmmiskmopiskkfmommyyvyfvmfxkvmmifyyfmkvmvmivokmxkmfosymxyspmfkmxoipkoxsomiosxofxsksskyvxipyyvimvvyixvksxxvyxxmfkymxffpsmfipsmoykyyosookyvxkvkppksispimkyvsiysovxmiofifxpkfokkmffsyoxiyskppvokippxfxmfvippfxksppvskkooxympfmmsmmimypmfmmymmksyiiimkxkippsimfskmkpmmvykivyxpsimixmfyoxiskyfmopoyioyokfooxmksxksyxoxposxmkommfkxokyipipsfvpooyoxxsmymkkivkiommsvsvfvikmoimxkyksmvymvookfxipvysoxmvysoksfkipixpkfpsvfxisoovvmfxpifkskkpsmfoimfsippmskxypomppkpkmikmpossxixkoymssixsyyksfiosfpvvvsokkpyfviifivyiovfypkkpxkmfkoykfxvpkimikspxpossvsmosifxypkoyxpsskikiopiffsivfvsiispvmvvkmoovmomipsoovifipffosmykifoyopixoivxfxixyvyxkymkxsvmvipiiokkxfiffovysxkpixskvosvopysmyoiyfsopiokifpofyfvovffsipsfkiyoyxssoiyiivsyovmkvfvsvipifkmxpkksysfyomsympipmkisykoppykiovyfimkookomssmkmmkykivppffxsvxpsiompvsfmysyfoyiiofkpfvvoivkyfpvpimomkxpkfvpkovsixvfsvsxkyxksmpoyxomomppfmvsoysxvvoxxksvofypspiivsyyvmvyppksfsvmoxpsposfkffippmyyxxmoimyymxyosmymmxyisfsfkxkisomixxyikfmofspmkfxyipksokkipommkisfospymkkyyispysxiovmpsvmpskpffxmvsiiixmsvvmpivoxyxvyvfmpvopvyssfvkookyxompksiffypfpksioxsxovvvxvpxfsxyofkmfvpfokmokykpkfvvfkmfoossyfppmmmmffmvpsyysmpvkssxoyivysxsokxfysmxmmfffksivivmpmoxsyykvovsmkimvvyxfmypxspoiixysfxspvkpiyossfoksiivkiivovxovvyvxokvkvpvpxypmfyfvxskokmoyffmifsyyfxysissfxvkisyxxomfsxmvmfmkyxyoikssopyivokkpmopssoooxvsosxfmyoffmpskfmimyksvmxiokxvikvfmkpxsiovsvppkxpkfxmskkkpfiifpyxxkfspkmkpfmmkvfoyppsiksfsypsxsipyookkppkovsmoyvysxfmosyixvmfspimiyxxmmopfpxokkfyyippsxpkpmfmmoxkxpfpfkvvpfpvvspimvypmxpismkvofokixyppmmivpmyvvssyfpxkkyksmsmfommiipovxmsssyoyxysksoysoiiyiokoskxykspipfxyxvkyxxmssskmvkspiossiifsimsvypvkospsifoisxvyisypvsofisyyxixvsvmxixixfxmykkfoooxfimomimsoxmksxpmsvssfpmmimsfisvkfppsxiopmxvyvomiyffxmsxvximypmxpkmymixovoxoxoffyxpookvoiimfovvkksfsvpmsixyympymskmxiskmiomimioiyvxpiskiyoypxximvmoimyfovvixpvosxyomppmfposymfmmixovfmfyymfmiymxxyosximxyppmkimoisisxpsmivxifkoippfixffxxppoyypxosomvykfvsmvskoxfvkpofyfmfyxsiypkokmkpsxskiixivosxyxpxffpfpkmoxsvxpmmmxivmmsmixxoiiskksoxypikokxsyvyiskpvksxkxvxysmikyikmfykkfxspspmxpimisymmiysyvomivssxmxyiyxvokypsspovfpfivpxvoiifyysmiokpvpxmosvpkiokopomkfpmovopkmyvispimypvisxvomkxosyxkixpiosfysyvvsvfoxmxomvsxyxsfsmmfpyfmvsoxskkmyykympxvxsfvvyxvoffyxvmvoykyfifpioxmkfkpyxkippvpxkmyskoikyoppvkxfvmxvvvxkisiyfxxvoypvkkfpxympkxpffmkokopofsfsooiopvviykmiymivvmfovffkxsvsopkyfypookioysypmvskoxsmsfimfovospxppmpyixyfxxpxmyokkmxkpmsxokmkxyxipfyksvvixiyyvxyoxpxfspfpykskmyfmyipspfmppivsffkixxxfofskoiioxfxiipskmxmmifvospkykmpsmosxxsfvkpmyioymsmivsvkyvoyppxsxskiiopykkmxvvmmkpiifsifkikfxfpkpvpmxoxvfsikskvoyovxkmfsofvoopiymmfsmyiypoxsvfymyypiyxvpxpoxxsympmpmympyipvxvfxsifxffoiomofpisysviioyxvksmxykypmkisxioyoooiopxofkiskxomymfoovppyspvfyxoxxpsoisxiiykpmfyfosyopypyoiffmpmfvkmiofkfofmipsipykxyfmimvmmvvivioimkvvfmiyvxximmmioxfskiixykvpfsyssxvoxxxkofykkoixmsmpfsyfxfpomyoksykxyyfpioopsffofkmfksmsykpyfixmpmsfiypsfffvmmxovisvsmyxfvmikkvxfyxospmsfmfvkxvxxmmvyxipxvkmfiyxkpvksovpimikkxssmxppixvfmxipopimvpskoissmfyxfixxifvffoxivmvmmfsvmksomvfiyfxmsyxipffxkpppsfffskvvfsxmyiviompoyfoifpiopyimiofvxsyifvpovvsymkvpvsmvvvomovmvpkoyxoxviofvfxiifmfkypskkikimpxkymyvmksykxpixymofokiykppomkfoimovvmxpiyivmvvskpsooifokymyysxppymsiyomyskiisvpiooxmsiiyoskpivssoiokixoyipyismkfmspfmmkfpxfofsfsvsximpmmvkyivissfyfmyokxxkimovmkyommxyfpxfmxkpmipyokvoxoykssyypsykkffmfxxmivixoiispxpopkxxiypvkksoypoxvimpiixkyvmvikiifvkypsikviskfskpsymommoxysopifvkmsxyvipmiyvfxkfkkpifkvpspvmpvifxxfxxfiosxivvykimsosvfxyvovimoykimfmfpfxmmppypkipikpmoiivssppxiossyxspsysmsvvooxvvmfvpxpvopkpoofoviiivyykmmpfxpxpsyxopfksmsimxmyopfsyoifimoffxfvixxvoykmpfymsxmxyxsovxxmxposkoyyisymfkvivoxpfsoskxkxymkvivssfvvipxpyxmymxkmxvvfyopyxyvvfkymfmfivxoiopoxpymfiiisyvkoossfifsxsiiopyfpfixvpisfsximxkkkpmvxsfmxpsyyyspkkpsmyioofkmfsmysmmympooymiiompysykofpksosvmvkifffikvfiivpfxkxfsovfyfxvovvvkmmksypfivssmyxvvvfvvxfsykxkxkivkiimyivsxkmofsxvpxkssivyssymfkimixiiomifyffskmvffmyfyppyvimyvpsmokvimmyypvxismsosksiipovisvffyvfvovyffopkkmovsmpospiskfmkvxvikpisxkmffyvxpiyivkfymkmkpsxfsfxiiivpxikmooimkfipxkxyvxvisysvxxkvxosppsyyofpiyspyyfysofkfykifvfokkkoxpyfsmxsvmkfovsyvyvkvmyispkspvopmvfmkkixkvyofmkyifoifpofvmvkyysimixmvkoskoixkyikmoikiypxkyoxykyysvioikmopkoisyokiovpykvissxmiomspikykimkixmykisxispmxkyiyvfmikvkpovfooxxifpyoimikxypykfomvmvsvyxfyskypmpisfioskvosfxpxkksmssisokkikpmmiisxoxipvvyxxxfoimviimfysiyfxsikvsipymisfkxpfxmmopfiyifmfppsymxmyyyxpomkypkxyxkoysofmmofyoooksyfmsxooxmoyyfopsykyyopymiovippvkvspkvxofvmovimfxfymmfiioiikfpmvpxxpyskfppvipkvppvpkvyfopffmxvvixffpkmpsisimkifksvommiviiismxixkkxxyyopisvppooxvpimkvmsposispxmfvopvyfmixvsxxisvppyopmyisyssvmfyfmskxksxopykmxpmvxsksoymyfyifskfxopmimpxfkmivkvyxykkiovpmsvxssmssskofxmvpvxyvxpokiosfxpvkmmiisopmfypipimxosoxyfmimyfpoyifmxmympiypkxkpyompsiiyfpvpipofmkspxpmkfxsikfkvsmvxmfsppipsimkpvosysokvfskmkkifmivsypykksxoxmkipyyfoifokovsxyppksvxmmkkssvoikfypmpkmpvkkmvkkfxvosifpkfsvviimoypmvfopfvfvyxxmpykxsxysovyyyyyiivixppppvsmopvksmvoyxkmoypmsypiosifxosmxixpxxfysvyimvfoooykxvmxikfpyvxpmkypispvmsppmyfsioskpkpiipvskxmpsmxspomsfmiyvpvvvfppiyvfkymfpvffofyoipipsvivfsfvxmxyomoyxvkkyfvomvsfymxykoyxvxomyvkpmmvikskykxfmpxmxmixfxyfixpyfskkvvvfpxvsyxoypvspkfxfoivkpikvkpfypiyvykxomkmxpyokpixfmimvmskoyyvyfxpxppmxfmppipsmsipsxykyfkypxivmpomkxvivipmikyyfvfiyvkyivyvssopmykypkofoiiskfpkopxvyvkipsyympoopxpkvmipyskvofyvffvxyvyiikovsivmfpivxkfmmvyvopmsvkskxfmsyxookymixiofiymssmpyfyikpxmfppikmisyvsfovvxfoysspvfoxsxooskiyxfsisxkxvpmixyoipymfxymxmsmpvfpkpfisxppmpmxvvxpkkovykvsyfoipxpfxkkspioiimsffykfmfmposiifxpmvpoxsooxyfvvoyfyyoopmiysmykkfvyfimppypvmkffmykppsffkofpoxvpkskxyspxpfpmppxxyyoisysivipfyysyimvxposymmxyooymkiyvyfkkvxissixvoiopypokoyvxfsfyvvpimmkismoxmmvmssypmpkvfoyyyyvfmivsffssospomkfiiimxyioovppovmoyvfpvvskppxxxyxymvvsfxpkmyfsvvpoxxyfxfookvffvoxmvkmomyomspsssiikpyoomfoxxipkmmoyoiiifvfpkspvofkiimoimpvvsyxmkyikyimsmxksovvfompmpkosyvymxmivyimskkvppsypypxyfmioimsyipykysyovvxfmmvxxfsxvxpkkovmmmfisvpkomyiyfpmfxyyyyffoiimxxiyompismyxxkpyysspypmixkvsfipsmovfsxxvymkyokpmvpkfvkoomxvvkfppyoixpsvyimyixxysmvpmvmppvvoisfmoyiyvoyoopsmsfyspmsyxyfyxfpxkmyyixpkyxyivokovskpmpmpkkvympokvxkxifkiyvmyxfymxsmvmoikkmfyokofmfsifisvfixfxkofoxsfkmokomfmosyxppkiofmsoykpvfmypyvyiyyvikkxmiysypfyskokfvkopiioxvoykipypkmkmkvxkmxopopsvyoysykpkokmmmyxxkiofopvoiiovvvfxxoskoksisxsvxvfpmsvspsyspkvsffosfvfvivmsvoypmyvmmxmsisyfyvysympfxivsoxomfpssommpvffyomkipxsxoxoomffmkppsfskxkymofmxfvpfoppiksivkfivfmvssvsmsvpxyvykyixixpxivovvvfokfyfxyofmpkikypkmyffpfmkkkfoovoompyofxkpvvopxvvfkmipimiyofyvxyxipsmyxpfksmfiksismvyxssvxppopfkkpmkfivfmsopxfikxomvkifxmsskpykiksvvmvovokfyfkpsviikkpkiyoikkiyoossvfxvfiokkkfisvikxffmsyivxsmkfkyfoyiymossvivpfvomifsoyofovysmippmkxxpfssommyyysisskmoofipkvkxsxvyvyoxksmkmpomfoxppfiikpxvmkmypsvxfskmfpkimyyifmkvkfmypxspovkfoispoxkvpfpkssvfyyviyokkiypkyxpxvioofyipfmxsixmvfvfiiysmivpfsfkimvkfvkyvsopfmvoxoxposvyyvxvsfspopfxmkfmympkiiovsfxypsxompmxkyopkpfisivkxxompsiffxsykkpkiffiykxosxsvikpxpsofmsvokfmfvsxkovyssmifsoomoixiyomxxfikkxosfviffskofkvppxsvmskpyvkivfksfvspksfmsoxkmxoxmxixfyppokxysffmvpoiomskimsxixkxsvfvpsyixximsoxikxpxmmmkivysispfimoiopyyvfkyksmiyomvffxsvkppvvosofypoioxksppfipkipxffyvfpvkiifffykimipxsfspmyfkfkmsxmmoxpkixpmpkmoiviokxmmyfovvxxfovyimvmkyyxpvkxkskxyfooksfoxpxvxiyvkosxsfmvmyxyfkoyfyopxsipvkfkoffifkymxpxmpmsxyfyssvmxksikxsxipoimxmfvomoykxivpivpfmmsmkmkkfyvvopssmyposiioxpoiixikfkpsyymsfvvfssppmkfxpvvomiiyxyymkivsfkpkoisimvpspiyoispyypivmskvkspssfmfpsxixsmxfkxmsyfiffvykoyxxyssiffsxmyokpxmkkmfsfsfposxipsiopmkyvpmoxypmiyosyfkiovosmopskykmfsyskyvmsfpmxxpysxosoxppoioyissfxfopysvfmffxmyooymoymmvkvmkfivpvfkspfsiviyyikikivxsvfpvksxpfmpxxkossypxvximpyikysipfkfmyfkpsfysspxpxksosoyyyiomikvvmoivxoxivpkvkvpsmvpiipkiiipkvyxpsxxofpsmsovmioixmvoxfvvppkmfyyofpompyfyivxvskmpokmvvkfskfvmmffyskmvxkikyofkymvkyspsxsfkmiokiskomvmxvxskffxyximkmkofomykvffyioxyfvovyvxvxoosopmomssyixpfykffsyoxkimkovvvxkovmomfoskfxfmffkysspfivysxivsivoxffmykisyoimpxfikmpmmskyvoyixsiykvxvfvixxmpipsykysxvmpsykfmivxfimvsyyxmmfkvssioovkyyxipyxmvvykifxkxmsysixpspxfxfffviiyimkfssxxxmvmvkmkkmpkmfipfoiifsopioysippykysiyivixyypofpsospsmvvkpxosskivposssysvfvxxkmvofpfvxxfssvipviisimovmkffpsyvvskiokmoomkvvykksikmvvofpiyopyyoyvmospmkivpsiipofmkmvfmvovmkysmyikiysysmvoopimvmomfmpmxxompsvfxsxfivximssmksmfpfmyfifppovovfmmsmsppoffioooksvifpppyfisymmossioksvfpvspssoxmxvsvyxmoiopppysyxvfpmomykoxokkskyxymmkfsspvmpfvmxmfxivvxsffpykmvipmsfkfffkymmymmooykoxspfopskpmxxysmopxsfokovkmffipivvmsspimyviskxfxxokmvsovfoooiyyvfoiyfsksioosvmmyxsokfxoyokvxpvxsiyxopxvpvmmvfkysiovxypvoykyfsxsmkfyixmspxskfsyxpysvkxyipsmfksikypkvyykoskpikfoxkyyifixmkoyvommxokyxysixxokysxomyskpmfvoyifxokpofymvxixxovmykymooffpyxskvokxxmkiksixpopipmxooxsyoyfiyvfmsfkxfyoykkmsmiypkxiyvikoymkxvspfxkxsyxypsfpimokokfvvfmsyvfyffmskoivkmioysxifpxfmpkpiimmmoksooiypfvifkovvmsyyikkisvsfoivsfyooxmmvfkixkypkixiximiiopvimpvymixfpovpxxxyyosmpxivxkxosffkkssfvyxfosovipopymipsffsvpkfmvxpmxsmfvksososikkyoxpkyykvivfmipyoyiysmypsixfvsixkmoipkxvmssyfkyovivfmvxfsymsmpovfofyyvykymppvoxvmpsoxipmkyfymmymyxxyysopsvkovmsypikovvkymfyxxsvmfykxmxvipkvypippfxokoiimppmkyxkkkoppsyfksfpkfymysvikmppppkpofxfmyyxmiyiofsmvoyokoppooipypvxkpxfpspmpivifvpmyxvpoyyfpyysoimxiipisvkkpfympfsoxxmkyvvksmikkifmkyppspsvpmkoxmoifsxpxvmfixpvoyxvsyoovoiiyvxxpymfixxiypvifxsykxyfiosvsfmsoyxipmxvossyfmmofyopvkppvfkmxyixsyvoypmkyoisxkimosskixxmysikkfpvyspiofsvmvxopvpyyksovvxymopsifvvxioyimxppokkpmfossspxvimxysfomkyyfvssmokyxpvkfkpxoxfsskfmvffsfyokfooisxsoxxfvsivposifvoxkmiokvpfkxyvxxyvvxfsyfyimkxvfvivkfxfpkvokxmypimpxmsxfpoypokpposmvfpmisiyofxmpssissipovixkvfoimoiypkyfypksyssppmxsifsmiivsxivmymxfvymssxkyvifofsymvxisofvxokomioivyipipfpsyomsspfiossfxixyspppoixffisfyfipsfpsxysxoiyvfvppmomoovvvkmfxkyxpskppfmopfypovsvffymkpfvximfyfipvmkxffyvxvpikoopomkpioimvyvsyfmvivmsfoissfpvxvksssmkvfkfyopfopioyvfppvfxmokmiomfovymfpsovvsyymyixoxpyofpspvyixxfpkxmixosfymvfkmpfoipkfmvpskxoppmksmsommpivspiysksoikmspiyixiiosxkifpvfviiiyxxpxfovvfmiypxpxkiykkskspfssvyipskoxfkykxpvxipfykiovpysffsfsfkmsskyykvoppvxkopsyyfivvvsfyvmmmvxpvoxvpsofsfkoosfooovsskyiyoofokysyyvyvyvvmykiksixisyxyfoxxxvppfyspoxmsixsvyysfoiymyvkksfpxyimxksxxmivmsioxpfokkfykkfsifkoxvovoikfixsffkfyxvvkvmfiikpmxsfpyompksffkymsvyfsvsimvpixfkofvyppkksimsvksksfymiokofkvspfxmkyyfyosyppvkfkfsyymmkifxvsskxxvixomopykkikmksposkmympfkspkmipmxpfpysyssvfxyxxfosvyppovpspyvkpxkyoyiysyskpmpkmymokfxpmsxooypyvpmfyviyfsfvfmsxoioosxfskimsmkvyofovvsikivfifpoffyfsvpxyxkismykxmkfmsyyyymsmkxixpvkivmkkymyoivopiikxvxfsxfkvoffskxpfsffxyisoyopxifyxsvpmxsmxvmfxkoixvyofyikyvfpxysoimxmixxiyvfskosyxkkvxkmvvmikokmfsyfpiskvikoikoypmkskyyvsfkkiippsksmksmsvffvkxfixsvmiisfifmpxkxxykivmmykfoppxvmpykvoospypxsyyspssfvivffkmmisiioifmipiifokmyxosxmymvxyspymsvmiokkykiiokkxxiysspkyyoxioyiioimkfysspmoxsmpkysoyskokykskvkfoxopiskxokxpfifmkfpxvsfiikfomysmpifyssmvvikxixffvpxvmvmkiykkxomyffsffoymkfmixmsimxfpokxkpisfymopyxkokovkxffsfppymvssyymxsxooomkmmvfsmxpifyxyiifvixssissoykikxxoixfyvippisvpykvpkissifxivxyokofomvxoikpkvkxvpisxkxopympxvfxkivyopvopoyvioypfippxsyxxyokppymsooxvpfopskfpyvpyymfsskypxyosipmvyyppyspivifykifykiivxsmmvvosopxpsifxikvipiyxifmivxsvsmiskxssvvyoypsfsfvxmmkkvfpxpksioxymspsmsyvmsvyffoiyoyfpkmvfiyvmxkomxmikifomyosxiikxikkxxmppxkxypyixksikvixxkfmxkysvfmpsomfxfokxssvipivxvxispossvkvmfmofoifixkyvxivfyvxpoxkskfioxiixmvvfsmsovvmssiyyfofiovipssvvvksfksiomovkkiixvskvfxsfixfmsfmpxvxxsyimpmfkvmoxsmmxyfisxvsiovpyvipipxvioiooopopkxfsvvoxfykimppypsymmixvmpfxxyixvkssfxviyvxxxkyymsixkfxioopivoikkosximxsoppfkskkifvpopokffssiipvfmvooykymkkpipsyivxkppypsvxykksfsykvysksxvyoxkpsifiyoyvvkoxkmxixikvysioyyfimxisivfsyviksfvmxfxmxsmpyffkofsioopksiovfispofykxooyvxxomovmifyyxvoofimifspxsmokymoypxxyvsmiyosvpkkokxipoymxiyifkmfpfyiyvvmfpfoipxfppkyyivkskmppxpfiofkkpioisksxyxkovmpymfyoppiiipvxxvsipoomiskxyfxvmyisvffpoyxfiipmvypmfyfsfvpxmfmfookixxmyipomsiiysiipyxpmksyvxvyomiovfkoofpsmxmmivpvfpmoxpsimyiypikvopmyyxyikspksfvfsmosoymykvvfsoxpyokfsykfmsxyskvfivfvxooxisyvmmpvyysppysmxypmskokixsmkxmoiskpmsxxifpmxfisvsisvixkmoopfmpsvfxxkyiskkosovpyyymxvvkxfoipyyxxovxoipfxvoimpmfppvvskfkyoximyxxiimmxxmsvpkkvkvvmisiixppisovxofviyyyfkyvxfimfyifiifisovkxikmoomsikvfvvxfoovkykxvfofsokmomsfipskmxfoksxyifpoxymkkfsmksvpfxvvsipxyyikxovkkkpsomofyskyfsxyypssmysvmsmspvfivyoyfmvfsvvymxmmmyfoykpiiyiskovyiiyfxyiofskysskfyvofimxmvvkvofksypfmvoyiiyofsfxpokxskoxysxspokxpppyssoofkxyyvkypikofosxxvmksoiovpyxvykyskoioixvikxvofpfssvkomofiimpoxxkykvskippvisyippoxkfyfypsxkkivxixmsixmkvksvskvvixviomisfymxffkvvyipiosfvyomykkiiivsmyyvmyxkfompimpxyfkofoxopyippsoopsipkssvmyxpxyiyxvvofisifxmivssoomopivisfvopvppvvoyixxkspfyyykpvxxpofiykxxokxoomkpivkiyvposoxkomxmxmsxvoxfvsfyvsfopvpmisskkxismffsovmsvoykffyimpixooyvmyxvokpsskkofixppfvxiimmskkyyfmpvimxifopxyvifkmkooofmiiyyviyxyppkmkskposomismxkopspfifmxmykippixxpkviyvovymmosvkpyopkmfyxmovxoosfkskmixoxiiifsymfsoyfvykxvfmoymkpsyyioosxokpxxiimsofsspokokvkyffisksmysskvkppxxxymokkivkypmvomyiofmypmfkiyyovosykxskoivifvksixvfvsvikkyykiofyxikxykvsvoximoiiyvxsyfpifoxovxpvooxxymfpvmkmymfmoyximooioipikovmfvyxsvfxkymxvsyxmofvopkiixsvxxixmiovfsivipkvposyxoykmmixkovypvpvffyipvpvyiosoymkskpimvxkkkyvpyxkxxviymfmyokfisfvvsfimypmypokoosipppspsoffoyfpivsyyposyvivffokxyxyoypoifssfokkmmssmyyxmvpkfmiosysxixppmmokxmfpxyypikfiypkxvoovomyomxomkmmyypfvsskfkokypyypvsfovoyipxpikmysimkymkffiyfkvmppfisvovikvxkfkvixxokoxipxiiimssxkiiiixvikykoviykvxyovpxvvkfykvipisfvofspkmxmyomkffiovmvfxmkypomsopvmovmmiviiyopikspffkffskfippyyxfpyymfyvmfsvsxvoopomfoximkixxkoimipysosksxmxoxmvsvfysymsiisvofoxvxsfypsfpmfkmsimkoyiyvyvyiiiksoyvksifxokkxvsxsiyfmimymfokpsmfkvpmfksyfpkvmfymfvkkxffsokyivpmvpvposfpkyxkfkxffysiyispvkxiimyivsiyvskkxpsikkpxmssyopkoypfpfiioypvpossoxykxpxmxfisomokixipmmokykmvsofxoikvvpsovpmissxxkiosymsooxopysfmvkmiopkposfppofpmyfmmpssfpoimfovfmpvsiympifvfmyfyikspmsykkoppmxxykvmfsiffpffvivvsoviimxfxfpxokkkfsomoosovkfoxoxspoyffxmkpssfypymsposyxvikopyxmksvxofxikkiviyixkioixovskmkixkxxisfokkypfkiismoyoppymyfyfkykpkmkyysvokofkkypofvyysyoifpyimpmsxkpfpyyoixioyyvmokxpsxyksvfivypvovsvvkymkipfxsyxifssvvmsykspovxyfkopsvspmixxkkoxkyskiiyposyokymsiymxppsfkssxxxmsskixyxfvksmimsxvskfvpxysmmmkyomixkvssxsfyxpfxffvmyfkivokixkmkifkypssmsixkmyoppvispxkipxokmoismyfspxfkopxxfsfsysxxpxpmkiyyyxviyisfmovymsxypxkivomoxoxiffvpvpiyompxyymomxovxfisvmkxkyxxvsmoififiyiisippipivyymskkkosxyiyfimfspssiivopxksfxopsssfipvvvmpsvyyxxyfisimpkosoovyvoisikmpmyxvoxsfyspypvoppmoifmkpmviifpmifioipomoymvpvxxypkoffxpvmyxvxipifppikmxmmiifmkoypvpisxikoikifpxsvokiikxxxmmfsovfmkiymxksviksmfmxyvssimfspkmkifvfpivkxfmykyvkikoixpsypxkimxoyposxxpxyoikmsvvksmpfisokxkskpvkxvysmioissxfvisxoxviypkffiyyfivxoomxmoyyvkkpskksyfvmiifsmkxvoivsksmvioxvpvyovoiivyfxvyfpmvmxoyvyxvmpfppfxxxfpymfpimkxospxvpfsikxxmkvopmvffmmppxkmpvsyyyyyfffsfkovmoisvssoviismfvokpiysyfmspfxvofkxsixvkpispykissfpvkmoxviipkvfmvoikfsmkyyosfoffymxpkkfkkvkysipssfvismppxfskiovkvsiiixxvmpmypfxkfokxivkfmokfsipmxfvppmoxvkfikiviyommpivmpifkfkiomovimxkiopovfxsvoxssxxpyokmpsyopkyfkpvxmyvkysxksfxvyiiyxifxksvsifxvpxsfxxsofsxpkyxsksmvmoxvympmxsxfmofksfkikovxvkomxffmpmvyvpmyppovoyisypvvopfyfpyyiomxkxmysivopikomymifokixvimoofyiompsyfxixpvfpoxvippioofvoivkoyvxoxosyyysvospopixpofkmyyiimxyyofxxkmimxispoffxvyfvyfovymypmfvxvixpfpkvymyoxxxpmsfoioypyvsvovxymypvppkvfmipksisixvfokovvvoiykkxfykpmsvsfvmiikiioviiovxvvipkoksyofmsxsxpxymvospymkmofiskoifxmskpysyvvyvxfkykfyvivmpkksikpsfyvvyyxykxvyxoyxmfmmkisikovmkkspvskiopyxfvsmvxokpixvfivfkkmpsmxvsixkifmkvppmpispxkxmpvxkkmvysxvspokpisxyvifmvokvxxxmfskoismsmsmomkypmyxkoxkykkkffvpifpsiyfssvxikiokmpifopvopfopkxkxksoyyfopkommffiiyxmsovkvssxfioyymmfkfpvixfpyfvfovyfivpkvoxkkfpsivoxpvfffkifsikomkyfxooymiffixvixpiviomfvkvpfmifipyfyvmkoffksfixsoxikvvpkfovoksmmiosmyxskmofiyixopmppmmkkmymiymokikpmpxvvfsmvimmopifvxssikoxvkkpoyvvsoioiyympkmsxypoosfyokfmfkxpxyiisiyxyipvpkivkskmsvkyxfxvkixviffympsmvmspykyoxppvmfxmxkkomkisoypmomkvmixfksmpyxkvviixofsspxoiyykvxvimxomokipvyyffvxpfympyoopmsvxfpxvmisossvsskkpmxyykxpkxyyyspxvpxpsmysyppikypovixkypvyifpxvfymkmvfmifxvixpoovimxoxivsvpvpvkifvokxvoskpokxkopvfxpfxkismkfxvvffoxffsppkykkiiiooxsvypxikkovvvymfspofpvomvfxoimfooxvyikmsvmyvkyokpkpyyipmkxyyxsosfmpxxsskyoxokfmixfkmvimvpyssypmvxopmoxxmvfkvvmpssfpkpmkksokmsxixvmxkmmskmxmvvpvpimoxifkmxmsposmskkxpyxkyxxffokfvioxxfxsxxyvpoimmmiyfyfmofsvkysmsfipxmpoxomxxpispvmfypppkkvfoppffvsxfxosyopispfkxoxmvyofmvysfiyxskoxvsvvisykxmxypskosfsfpikpkvskffxiiioysopvxxomppkyosvmmvxvfpxvyvvismkpioiovosossxoioosokfksxsofomvypvskfivompfxfoyfpksikpvmyviyoxfxvsffmffmmmxkfmxxxpkxikvsxkmsixysxmpkmoykyvmyfykpxkvspyvsvxxmoimoxixsyvpmofmxvymmffyoxovxxompffymxkpkppfmkmvkyipkfmmpyfmifvkppyxvsvfovysxvkvmmopsxpfxvkpsifksxmskiovppoivmoiypvssypvyyffvsoffyfskfpskposiixfyoxpmmvvfxkpippkyimfvyxmpvpoyfyvyfiixomvmmivkmmksfxivfxpxfmyvvkiovyioksiifvsksvvmmmyyfxvkxpxikspfpsfsmfxpfsskiyxpkyxokkimixfpifkvomyovopmipxvkvpyysokiofkkmoxfpiyvvkvoimvfpfyxspyvkyfvfpimyyfvofxysxkoxxkomovmpsppvoxxpokpomyimyxvsvivmosfoxkokofxxyiykkikyopyyxxpospopvoimkyfkmifkpxxmiifmfsovyvoxxofixopfmxpokvsfiffsxvxfxpspxsoipsyivkomffyspkssspkvxosikmvoxvypxxookioxmyykokmvkpoyosfmikxosookpkkvmkmsxiofiiyisoooiikxxifyixfofkoxvypvmmyokikximyfvimxvomxiiyoxfviismppkkysyoxpvspfoiipokvsifkfsmokkyssmfxpmspioypfivvfpvykxmssfymoxxfkspkxspypsmvxkvmoskmxxkkxmosfvspxsfipviixfkivxxipoxssvyfioxfxmmkvvfyokpvmopfkoxvpmmmmkkmypmmkmmpxmxvoxsfpiikvssipmsovvmksvfkxsyisyvpivxyioyiiokvppfvmppovsmixiifypxifmysfsookosfyimsfvixikvvpimmoxksvkspmsmopppsmkokiyofokifoxxkfvkxiiiivkooyksspfxvxiskopvposyypksfmxkpffmvoxxxxvpifovsskppvoymkpvmvokpxxoikfxofkxfyomovsiyxypvfkkkyikkkoiffifxvmsvpsxfymypkppsmyofpxoxmosiyfmyxsxvoxssfofvfivfvvoosvskpyiksmofmsxxykivomififviiypxvmxmiiypxomxfxypffsmpsyykspxpfmfoxypvsiyykomyfykimoipfxoyiypfpyyvyyifyxpyyxsfxfmvsfokskfypfvoofmysfommkfmvfiiikpoofmifssysmxyvymvpfyyiyyxssioxkpxxvxxspfsmmpmpsvvvsyxosmiivsyyspmxsokikmyvfkfofksxxfikxksmskifxffyyksxiomsyxxksmfxpimpvoiskyimfikmyiipyykiivyxfvmxvvkykypoxspmopyimimifvysmypoypyfokomyosyyvfvpvfxxxfkpmykmvxmxisimiyispfyfmpvvoimyvfkvipvkoiskpyomfisyvmmfoviksxvpoiypoikoiixfkfmxipyviisxkvvyimfkvkyvysyiiffvsvmmivomvfpsxfpxyviosvvmkyppixvkyskxkiivyymskspvivypxiimvvkvispimmyvxxkmpvskkvxvyxsfxxvxvksmoifmoooypfpxkpsskpskfxsyxvsyipkyvpoxykfmopxyiipovovmspkxmfoyyovioxmixmmvxkkxyosfosomoxippsosfpomkkkvookpvsfpskmfossvvsokfvfomyfxfpooypfpmmpvpvofmpfysipopkxkfvxmmfiiivyopkyxfvysyoxyvpioomyifsmfsvsimsyyimovpkiffyipiofmxkfkyfpysxsypmomvkysyksypkikvpivmfkipppykpyipiiykxpsksvximyoxfvkomyospmvyksofvyvpxsiyffyifksyfxvpymsfxpyomosxvfymmyypmfspykyffpmmfsoixmpsyopsmiyxmvxmfffkkxskkyfispfkkxikpyxmkvsvipxykomvxpisxsyxskskpioofksyyoymyiixosxyffosfmvoysipfiypfivmpkipxyikxpffsipvspxkvoyvpsyivsfooxpspkpoxmiispifmxkosmyspsmvyvmvopmpykvpifxkkiooyivppxmpfioyfoyfskpmissyyfiokyxoxspvooyosfmvxopkiyyxixoyifsosmosovxkoyfxspskmsvfsfvvomxspvfvxmsoxvsyoiosypspkssmpivsikvykpxfyoiommmofvvmiysmivimkkvxxypvvxmkpspppivfopfmfyvmxfyiysfoosooyyfsysimfkfsvfvkkovyipyvyvpffmokvsyfispkxxomyimkokiyysksvsxyioyksvsoskypssxvpvksvxffviskmvymyimkmvokfvfspiykyvpmvikyvvokppxvyfyyxxsomxpkvopiixvkfxysxfmkffvkpkvxvfxvpkmmiyfmkxsovfpsyoipmoofviyixoxsxssiykxkmyppoxpmpovmpmysmfpsimmomypkooppfvyixxymixmkyvxkkfyovisomskokskookovkxixisfsixmpksoykvpfffiiiosipxpmfmxskofysmkvmkiokxmsommsxfiofykofpiovvykpfmsfkvkfsiovxmvfsxixosifxmsyyxiokkpvxvyxxxmifkppykxmkkmvyvvvppooxkyfysxpmssvimskppyypfssyfpiifisyokxiopykviofsmfypvimfvyyvpiofymvoxofxxvxmfioisfsymffymvivikkissxifxfvkikxopposxpppopipyoskixyyvixkisvkvpkfovisfvsyvofifsksivvivopmyiyoixifssvmokivfvmmfxsoxixmpsvsvyikkskvifppfsxsssivvipmioimfvkyxmfppxsmxipmovxoffsyvpypmvmfoyvksyoskkmspokpfmkmmvyisvimovyfvmmkooppfipissvxvsiiyifikmxvkvkosssysxvxixfxfmsfyikxmkmyvxospmivsipmpfsyfpfyvyxmyimfivfmyximkypysoiifvmkyoyvfixmsfomsfmxfkmpospfoissykfpmfyspospfkymipkkmoixmoifkiyiooyovxyssiiopoikyikyifxkyxxvsfsyksxixfffkovmsomsipxmvsmfxfpmiifyyppffyfofskkyksymkfmmokmovfsifvpksmyyiyyyivyppmffypxkioypmfsskxoxxvvovfvofxoiovipskmoimypxfpmpfvkmsymifokymyomfisoikfofxiffsxippmxfkvykpsysokpykpxkoxskmkpvvkkosxxxyivifvyfivsvipskviovpxmkokkxyiyooyxpfkiysffkmovvmpxkvpfoosffkksmkymmmfvxpoyixkmioypyksyxkmxppsiofyypikxyskixkkmmyxffpikfopskivmskxvyiopfkskmsvvvpvxxiikovoyoiyfsssvomsxfyxfsmyioikxyokopoimyffvipyvxsmxvymiyvfvpmmmiipskvyssvisioxomoyimyxskmkivmmpmkyiyopsipmfvkxiokkomxoifsopfkomimfvvifixkxompsvxovfovvvvmskkkyiskkikiyiivmfipmpmkyfvyyxiyyksfkfvomvsivspvsommxkpkskkxsxoxoiyxssyxyvpiyyifisxpvvpsvvpfsfppkpfvmopfysmikfoiimyskoookksfofkoffsfiovsyyxxoxkkxxoixfsvyxfxokofppvixmfmpkfyymompfpyyksoxffvfxsmixmkyxykpsvikvvkymxkikkkssimskooxfkmyoxffokfmfopyoxixpvpymiiyisyfossysioysssoipxofpoxpsisffmmmivxixppkofsvyffsxfpkmmiiiypipopxyixvxykkxoomsxmoxvkfopkmyvimpsooovofkivvmkyxxoimmfsfixvpppmixmkpyyxiooyskypvkmoffoyfokofvvfoxfpmmpivpmmpoyykoyomyffxypxkvokffvooxofkymyyvxioxvssviixoyfyppkfyommypsyikixiyfmsfffkxiivkyixosvykfkssvmfypimskfofyfffyfoppkfkypsfypfpxvymovyoxomsoixskpmfkoofspmppomsmyvxpxkpokpmxxpvmfpiffyvsvoovokooyssmsksiikvsvsfvxifikkyxippxxfmyxvmymkmoppymifypyxymmxfvimyfmvxvofyfvmoympfmoxvifiiposmvipyfopvxffkkfiyfiivfykkmfyofyipfviookvfyifmoivmvfoopmsvsyskmixoiovmfxiykikxysipkyvyssvvfpvkxispviipysvpopfkikxsmkyyiyksvipxsopvkxsvsffmmkopyifmsxskmxixxmkkiviokiiomxssmmpivymxosmmfpixiixmsippkfopymvokksimosxoimksioixksksfmpookoiykoxssmskosyismfpmopyxkvpfxkokkmxpkyoxfpvmisxvyxpyppsyykpkfoposfpvkyvpokfikfpiykpvsvsiiokxsfkvmpikpoxskmpmsivyksskiskfipoffkykymsysovyxmpismsmkokkivmksososxxvipmvyisfmomiyfmsyisxioxsisspyvkimpimvvyoxyskooxksfpmxmkmmfopmxfovkiyxpspxfmkoivpsfyixyymyksfixxkvksoosspyixxokpoksxiivyvoyvvvmoofpofyyskykiymssiokfxxpvmpfpivskisxsixxkssmixomkmsypyximokmimxkpsivyvxfymmssksifffmpfoiimkvofsxmpsyookspkkmsfoxoxfyvxiifivvfyxoimpkoyxkysoposmfoomypfykmfisskkyysfsiokkxfyykvvkyspopmyvkxvpkpvpyossfioxmxkmismimsffxvsipmkxxfkovyxsfofkyxvyopppxfkpxyoxisyksmfompxvosxsivfpmxofpsmpsvxxmxpyypvfsxkookvmxfomoissvymvfokomyoiixvfxxosxfpvvpimmspyyfmoksoiipyoyimkmkspsxffxfvxkksmokmmvkyfvyxyvkkoyxxsxyksskmsfoxfkmsokypfxviyxpyssxymmkmpypxpfykpkvpisyopkkmfppsfiypkmypfkmvxmopoopkyfssmppooxpifxoyiyvposfpoxmmykpvoffiyoopsmxyxfppfviyfpvyfixmsvvvympmxpmifvksifspvokkxyifxmoisysimffimvxkopxvpvvmiyyfyyvmmyovppiiyooyfopokxysskpkxffmsyiyfffyfxxisyyivfmvmvoifoixissyvpsofifimxoyfpppoyskxpifixxopxmpviiyopsopsoxkxkkokifpikfopvyppxxpvoivksyyxmioiyvskppxyoxioyyysmvvkkfpsyiykivypssiykopmvkiffipyyxxmivmvpmsvyifpfxykkosmipvsvffvmfifxpmpsffpoyssiiyfvimmfpsopfvipvyfmismsikfsypfkvoyykmfopyyfioiyokmksxyyoyfoofyvsovsxfspokxoopivfixyfvykfmoxoxfxfykoiioisxoxsmyxpvsvvospmvyxfxsfoxoyxffpkmxsmxssokofmsxkmkmmmypvpippkoyysvysxfspkmssyoivmsvmpxykvskpymvvpvpfsfyosiivyxofpfifpxksiyokkkxpiipmvixxpoysxvmovkfyfyooopsfkkmvkipoissxoovysokpkpopsxfxxkyioifoisyvfifosixfossxfiosvipsfpvfskvoovfpkfskoyippvmsyfifmsmmvmiipmiyvkixsofpmfpokkyxpsoyyspvyfoivmmiyovfsyfixvxxoismokpyfxksikyfoikyfofmviyopppfmmfomsmiivosfopvyixsfiomxssmyomoxfxyssfisskppvkpixsiyvoxomkkysfyopifyppvvkommvfypfxxpikoiifmsmkvypmmvsivsvmvfximomsppfvmmfmyymoyxipyopfvfpmixxvixfmpsovpvksyvivmxxoiixvivopovskoopppvmyopkxopivkmxopssvmkfppvpksfksoymyspopovxopsyoyifxsifvkivoxyvoyvxffiovxxpvkkspfompvmxmffokfokssvsffipxfxvyykspvkmxxfyvookofyymyppviikvpmxoxfiskviyppioxffvkkksvkvmofvpxpfssvioxpxvvpmoysmxvppsifoxfppksyxxpyyfsvkmiipspsxxisyfksfpiskkxvsfipsvfxsmvpppfskisikopopxkmsiivooxpfxsmmvkvmxpvxovmxskoppfpmyvofsfiovfmfvkomvikyvfpypkyyxmpmmvoopvmxffxxfyvoxkifkfyfkxvyfxyvipkmvmxkyykxpfokvxypospfmivfmospxmoykfoppmyifvyfxovyiykixsmofimsxikiyooymommxyykkpvksxkksimfkxiokxfkymspfkfiyxovsspkiovvioxyyoiskspxoofkkpyvpoipympiimyfkoofmixksmxvxifmykpfyksovxxsffmpmyfsooskxsxyifsppipskvfismvpsioskoymovmpoosvsfkxyipxxfpyypifxskkofsvvpmmfosiykkomfsfpioosmffifppsimymyxfkvspspmixkkomivsvkspyspvmmxmmvoompvomsspkvfsyffpsfopskpsfivkiimfsopkvoiiivykfimmyxkmyvfikyfffxyksffpmskyvmffsxokvipfomyikypsopkyxxkvkyoxvvmvmfiymymympvvsyxoxpxpipkokppkfvxsifxkosfvskikokokkysikkmxvoxxxfpfyxipkxpkxkyxoxofikxkfxviskxyiyomsmxvoyfxpskomkvfooopfpvppsopsffoksssmvkfixkpsmviisoxpfpfyykipoosmkmosypxvkkkvkvmyifyiivoysximpmpxxmxyyympvmykoppfxsiopoypivypimfxvvmmpkikokxoykoypovyovkxmsfpomsxyipiiykmpsimifsxpkvpppvffmvikvmxpppppvmviissiyxppivvoyyyxiskkvsiyvspxoyxkoopxkykpovovkppvposfvmopfsiivyiiivokfipkiivyofspvypikyfxyokskkpvkxvsfxyvmxsxsfmpxsfxxmvsosfkopfoyvkiipviokyvvfssokoxookkookmokivxfpipmfvvvkoymvpyoixymkoxxmfpkvooomxvfyivixoopsipkfmofpsxskmkfvkxipoikxokyvpsmopossfyfomispimkfyovvkfovykokfvpxifoyfofvxsvxokfsykvovovspkvfyxmoixiyisxyvkxxmvpfkipyfomivxvkyxmkopmssmoxkoikkkokviipmoosxvofksmovoxkpkfifpxkskpffopippxvkyvvfovpkvsxoioppokvvvippfkikoposkyffssyvmpxsvfmspspvsvmiiksmmymvspxmpypffiimfvsixsoxossxxsyipokisiixypfimfiimfpifxvxoksmykxyvkvkmpisifoooivivxkppvxosoxvpvoxkixpmifykfmoxpxspsvmypfkosxikskvkpfsvkkvoofmoxpofiixfkfsyxoipfisyxmskvppyyxpfxmsovsyxmivffmsysokiyxpspypvifmimosvyvvxkfivxokfxiipmyfoykmymfkpipifovypippmfsyixxsfsffyvysfvffyipiosxkksskkivsmoomoxisfmpmxppxixofyfxxfvmiimfxixxoxmypsffiovfsxiysxvixyvvsfkxmpoiiffmmxxpipypxofkimiiimivokpvmkiosivffposfmiykvxmfyyypmsvxffyioxkokpxoksxvfpmoivkkmxvmsfkkmsvfpskopvpfxpipkomvmxxpyppofxokvmioxykmfkyksxiymykkfmxspkkmfiopxyffkkmvxyvfoipokvkyfksspxpvikxysfvvsmkmkpmfkovivofksmmpoffmiopokpffkpmovykfyyyksxpkpksoyfxvfyiixmxvixiyvokmiyvfxyfifvssiiosxyifpksxovovfkkvovyosfsppfpyvpsmpsvimpoykpypkvkksimmkvkxmsvmpmypyyfispvkoioyspyvymxppxyikxvmviovifimvpkpsymxmsvpxovixpmfksiymyysspxmxymmyvxspfixxkfksksmoioixsoifiyvsffkxpovvxsmpvpyyfkppmpxffpipyixyyoiimfkoskvpkkmkovyvpkssskpxkpoxsmpopmpvskxiisfkmpfkmviipfyompmyfmfovommfosvykpkxsmmsxviypsosipvikxympyvooiixoxovmypmoimmofioffskooovkyfmxfoiyvvvfsxxkvvofiiskmpvkvfvffmmmoymsximfovfvxpyxiyssifvmviyfviyimxxoymyifxyvxkfmffyosfokyfiksmkxmfmyfvmmfsosfpsfmxiyfvfkiomvokomvvfmvfkosiymikvpvfpivpyyoimfyfipmvfpkxxsmfsksfovvpfiyvmxpyopvmmpisimxfvkippvoyoiofoifsxsfyyyysssiioiymoiyfpyfxvsmfpxxpvpyypioxkmffoyxpiymkkfkopvisoxyismsfymsvpokixovsfpxpskipoomomooyoxokvvmifmyyikxyxxyixoovvpiymppsokkxfoxfvymxysspikoyikymffpvsmkfsoopisipssvfifkmspimxpxyxmpiffsyopkyfmoymmmspoosmkyissopoofsxskspmkkxksvksopmofopmisipvsyfsxokxpyxmyvpkvpsifpfkkysvoixyksoimxyookkoymmyfmfvvfvosofixipsfipfxomykpfxffsxkfykmpffiksxfxxmxokivfpvyofyivkfykmypimmxfoxxxsxsoyiksfskmpksypsxoifkmmooykpvovsxvpvpxxoskyvispoypkmysypkfsppxpimkfmkmmiixksoofooosipimxpysvxxyfvyspfyxvvyfkkosvkvsikyppkppfkoxopmipioxiipfpkksimmxmxfyxfkyisiymsspmivpxpkkxkvvppoompimpspoxypfifxxkioxxoofpxomvpppsvvvyikiyopfyopssvkofimsiooyvvfskvvoyisvvkmikoyfvvmvmyfixsfsmisfyyxyomvvvooooosmmosmxxpymppkivsiopfmifpkvvfxskoyffxikpoyfpxmyixyppmifxomvpkfpxymmkymfffoykvxsyiiivoxixfxpsoosfvksosfyivxpyysypmkxypkvimfykisoyysyofffpfyxyimiyokppsompvfmvokvpxffofypvmfosxxfixfxpskyxpxmmoysfiofiyfkivpvpvosvooymypykyvisvxfmovyxpmkyioxspmsyosoxixiyskixppvspvosiofkmivixkvspykvosvikmykxiompmkmyoxfpkfpysyipypspkpisiovyykkpipopppppyxpvxfyxyyfsikpskpykfxfmsxfxysimfiyvspppyxypxykvpvmpofipvvmomymxkmyvvxkxsomxsmxvoipimissiivfkkfsskssxvxixvpoxsyxoxopfisipiiyvyfopmoykvmsoiyksvsyoxisvpikofoookivyvmvfmivsysvsssyvsyixiyikmmpipisopoiyfmvsovxosyokkmxvssofvooomxvyxofmkvfokfyfpofvfipvfxkossiyvkiyfkyxxykkmokysspfmsyiipsfyffypiyvxyoxykfkvmmoyfyyipsfpxoixvkmifiiokpxxiimymivikoofvoivyvvkmsyvsyvsfofvxvyvssvsffvymipsppxvxvmfxypfimkmxypxkmsmoxfomykvikmikkoxxvpyxffmkppkomoxxyoxxxpviipiiooypoykpyovoifkoxximvsxkiipkipyipxpffppkpopmkxkkmipfppmmkmppisofsfxysomkfxvxmsfiyvmskoykvxfvmyxovkkfivvixmopixsvyixpoxsfmoxkkvooopvvoiyimmmmfsoovpyfivikxyoimsmpixfxfvmvximfkkmvfoomposkkvospvysvofxxkpksovyimxspypffoipymofyxymvivspkimkfvmfyppixyyoxiismpfyvfoxfsifkypsimpffpoimykviofosmsiysfvvivioyypyovpmmkiomyisiikyfiyykixfkkvkyikvvfisfsxvykpxsxvoyisxoopfsmmvmipvofvsooimvmvkmoxsipyvsivpmmxfkyoxmvpiyxvfoxxkyfxsfxxiioifkkmxfviissmiiokfioyifvoixykpxymiovoikkikvkmvsvifisifvvokmioymmmfkfyoyvmsxmoimxxfpvmkvxxpsyoififvikxfyooyxyyifsxkffymfyokopissfmsxokpoymopsfysvpsvvoysfxxofyivkxfpmyokpsxxxmsxmiipvvsxkskxpfvmmymvvypfiyvompoipxpvfvvixvvxxkpivsokymxmkyxsvvyfmifxpvsxysykpsifsppkkposvvkxokmykvfxfsvkpvxiiovpppxmkikykxyvkkimyffyopykkkxomoxpimxkfsxmsoxmvsfsfskxysvvpxfpfikyxsyivossovvvkfkxsmsmxyyvsyxyypyoixkiofffiikyopixfmvksxsfyskmipvpxkovskkopokfmokviyvfyvipmssimfovvkvifooiofxivmpyfkyoivkmpsifyifmfsmokomvosymvpixkfimxvkpvxmsmvxkffyfokiixmifpfsyxxkmixomxvxmvkvkxpvfivppiiffimkvkoifsofkvpymxkvmkpkfyvvsmsoxskvvyipmyyvomxpsxyvvfmkffpxxopfvxkvsyifoksyoyyxxmkivoiiokifvpxykifofoiikyvypsvsofyyxvypsmfoxoyixovoopxxvooxfkvyfpsiiymkkpsiypyykppypxpskxossxfvospvskpvskmfvpopfiffxkxkoyyxppfkyfmkooxpxoskifoksiifpxiovxmxpovoiyfksvpfposkxyfsvsyipsismkmkfoyskipkosyykoovvvfoxyyyxkxvpsppfkosykpxpppkvsfvxiiffmkxskxkovmfvxikoopvixkvsipvxokyoykvmikmsvossixkffsyykpikvykvyfofoomisipimpymsymypsmfkfovovikomiiyfspksfskokyioymskiypokpoxfxpfiviysfsisypkossivmksymissppskkssysimipissyvpooxvfmsmoypvkykymmpovfsxsksfmpmsoivsvvmykofyoypfxsfyyspskffmokifsvsimffyyviixymfsoksmvfsxmmsoiyxpmysxfsikmxyssfmmyymoppmmyssxmypxkxfvyismkpxvykyxfkooskvvosoxipxxikikmxsiismomyikxpokkkpxmpokfosxxsomioiymfpiixympkpivifyssmovsmfypkkifsvpxvvmxppfvyisskksymiiyisxifykxxsvovkvsymskyxoxoxiyioiviskpmpipysmomxmkvxymxkxiopysipkfvykyypyypsfvyxyypfkpivmfykpspvsopfymxyysppvosmpxmmokmykvyvofiyoofpyysivvsxxxmxvpmmkkxipoivkksmkssivxyxkoxpxmyvyiopfompiyvpfxofkvxisyoomfkxkxfpsmkxoixkvoopoixovkvpkfyimivvffpvxxfossfvsmosxvikxvmopxiviyfyymvysfsmiimvyyxyiypvvpoivvsskoiioyxffxyvomyifosxoyxmvmmffsosxyixovmsvimvyixmxymopkvoxfykmommskkmkisipxpfyikmossoyyisovmsmvyoimskyxmoypxfppkiomiikyoyfsmssyopxxmsfkyxvsxyvyxpisopfvsfipoyyvymppppfpfsvsmsokfpsvxkpipmyxoixypfypmoiyyopxfpvmksfffvsmsfmymvkoipsxvoivimkspmpiixpkykpvsvvfvfykmpsviksmmfiskmovxyvfompoxpxoppfpikofopmosovyxsfoifmoifykvyyovxfvxkofovxvsymvymypvsmsyppxxfioskiyksxixfsiyyppysipoyivvokvfysyypkmyyovspipiovxpoyyyivvxpvookmskmspkxfypixkxvysvmmkkixfixpvvoomymyfiommfmkpikkvpoovpxkvpmvymyipppsfpfppfvvpyfomymkyfmyyfymsoyipfoysxmpisvyvikpmmsxxpyommmysikkxysyfismyovoifikyyyvpfsvksfosysosskiifmxvsypmoosyxvspysssfxysiimxompmokysmsikpospomokxpofivsvvmoxkkfpoxmyoimixiivpkkispfmkfxokxfmyoysskpmovofyvpoooxpffmxxxkxvkypkiooyfpoysmvxfxiopixvspomisyyypspoippifyskoykvsifxxyipiyyvmoxikpffximomfvxooiismxoffyppfkokmmxykspmpfoyvifvvovxviivksoxiimovsoxxomxvppoksxxpivoyyyvpvxxiivpipvfmppfkovvkmoysyfmfsfxpimysssfoiiiixmpvvpymymyvxykvvfiiivsxkmpfssxpxxiyvvxiopsxkpskfivyoffvsvoiksmvxvxxspvxpkkvsvxyvspsispkkiosxvsykfimkpoxsissoykymxsyiikmsfvpmsivpkivkvifxovyyovvioxvmmkmmixyxpvfvvkvmmomfymspvxmsyskpofxvimimifoikkoykvmmvskpxfiioxkmmxpxmskxmiyxfpskoopfisfvxympvmovspkyvmoskvysiopfssyyfvfvmfkvxioffxomxysyokvfkfsvikvmpoyyosksykivsfkiyxyfpxomioyffmxkxvyxfppvxffsvpimfpsvmxmspfypmvifmkfmpyooffyxypfivvskyxpyxfoiymimmkvivypfyifoxykpfmikymxpxpkmpxkmoiiyxpxxkkomyxmyovkifompppvkfoyvkovsssifyikpsfkkyxfpoimfoooxfxvfvpimvyvkfmyomyofymmsfsvimfsspoppkmpyvfyixsixxsypyiokokkpxkyfmxfxsfpfoiyiykisffivyssxiioomxsmpkiymkiipypixvxymkikspiipmffvpmvoysfxppvfsoospikiymxpvmxoxvskmfikiffvvmvmvkvikmfvpomfmssvopipxvspovvsvomyymppkiiimfmpvfxviofxskkysovsxfxkosxipofvvsvyfmopxppmmsxkiofixpmyvsvyioffokkiffooppkypimmsspvokkmpoomvykxmkvikisfvpkoyvsipimvxfvsvskpkiifxyosmxixpspompvvsvikkfkomfmxxvkmyfmfopfvkpiyikxfssxkmyffsvxiiimoosvkppmxpfxkyyomvpmkkkvymypoisyxoiimfvmxysomyysvmxmyyvsoxpmokkvkvxosmfxipvfoyskxyssspkskysopipoomvmkmovxxkovoixifsvpyfkifkmppofxkyvkiofipmkxksfiooksfmokyisvxoffvposovyixxfvxpmsxxfyyffvfvxosksvmfmxspsvmyvfissspiyyssppisfmxxmpkspoismspmpssmxoiksmomksyspyopypoiivipypkposssokoiffiympkpoyffsviifkmkoipovppsppopfissskmkmyvoxoypffxkyfmxyspoyyxyxpspixmfoimomksvymsoioymkksfsxoxfvifpkioykyiifimovypfxkmxoxpsfvfopoxspffpmyopfsvfmxmkoypfvymppyyxmmoipkvmovypmkxixxosyffxsxpkimpiviyssifpmkxipyffosmikxivoiovfmvmmffkiivpoikspokfspsskfxypxovfvfvvffkykxxysxxvoxopiyvxvixsfikmmvvsxyyvpypkfypyopkippmvfppyxfvsyxsixxisxxxixoiosmfvomyiiymmxosyyivixfosfioyfkmxymfxixiovkmfpsyvfvysxixmimofikfvxspxfyfspxfiypiofyvsiiyiympyxpsvomvppmksksxoxsyvoxiymomvvmofpfsokvipmosfsyxmmvfoyosoyippmfmyvpspkkkvismffiofkvmkpysiyvomvmvymskmpffspmksxmkkkfippofpikpmiokixkmfiifkyfvokmfvpifkffsvpxyvioykfoyompykovmfkxxopfssvmsioofvmyfovkiokvkykisixfiiopoopiiffpvmixfsiyyvfmfkfkikxfkfvmpsiffpxvyksfvvmyykysipomfxiyyfpppoviipofxffkmfofkkiyffmkyskxsmfoipvoiyipximoxyvyofkkxipiykyyxkvysvvyxpviymvvioxsvpyxmvyfoppyifyyyxmpfivvpxfxsfyposyyvpymofyimipsxokpspfoiopkkikyxisyxyiokpskixxiiikyifmyfkyvkpvkfpkmmiyisxyiiyxfofvskpoxivxxsompikvvkksfxifkpyoiypvpximvkxxkvmippkkommoovkkxypvfpxpmyxpfyypiskfmxioopfsfipoyyyifompxpsfmvvikpofimspxiovkfpisfvffmkpxxxooxmkmxfpsikokovyoxxpvspvsiikvvsyffopvsfiymsomimoyvvxosxmysmxvsikyspfkxfkpkkxkooyomymkoovmpvvoovpsxiosoyskxpkipixvkmiksmoykpioyixfkkxoykfkxoxosxxmxvssmxofovifxfpymfpkpviifyypyfpiovvommmpoixfopfpyyoippmvsiyofyssssssomvkypmyyopxmsfooypiifpxmmsmfsiokiiyfivosiimfyyomxksmokomkkoifsmxkookpfkmfmkmokxkfkkimoxffkikpsvofomfimkxxfxsoiosmiyxksixskvmmisxsyiyoompykmoksxsppiopyyvvsvxpssfoimysmyifpikkooopfpiyvpifvipiooxivoxypvximovvooimiipyiofmymxxskviimkfkypioipsfkxixxpykkiykyoxvvsixsoxkokpvipvsymyiyvmyxpxxfkxmsysvmsfyvskmsxomppxysmkykikmvppvkvfvkmxyvxopommmffvvioxyfpiosimopipoyyfoyxfvfmspposkkkpxfkssmypkpvysxomxyosviovmmvyposykovfmoxxxkvmxpvoofpyvospikmpiyxkmomfyksppkkvkvmmfyvikfmysysmsyviopiysskokvyfvfxxfvymsvfmfxmpkxfvyskooppoxoffpiyimxyxyokyyvimpkpmyfvvfovpvsmmopyifxxmkkosoyksfskiypvpsxvokxpixvspmvfxpmimvoxffyxfpssovfsxyvfsxvpifmxioppvxxpxmkpsvsfyxisosvmifpixivymyoixiiifiipyoypvsioxyfkpixxfvoiovffvmokppioivyiykmsmsfoksofyyvmsxfyypsxfxoooyxxympiskpioppxkppkxpsmspvppivofifxvpsmpkxoksmomypiiosyppsymvkyfipyyvyvmoymikvovkifpvoixkymxsfvpyvivvkpfikyvikxviksfmfpvyyoxfyoxkyyyxioyomskooimyypxxipsvfvvmixsmvyyvoxfmvkxosspffoksvyfpkpfmymoofvkxvmiippmvkffkxsspxsvxfokioiysfspksyvfkyvfmmyvyfyooiipxifmpkiivipxissmxymysfsspmppyxpxfooyvssomkvyxkxkppvfpfkxxoyxvvxmmxfxyfsoyviksksixkfmikyfxiyixkssffmvvioivmsvvykiixofsmosvsoopikyykxxifxokxmfikkmopffmykfvyxkxkipxpmxoovsfsysspfykkovkmmoikpifmyfimxvyikxvyiyvxxpovyxvxpsfmxvommkvmykpfivfvpoyvokxvmoisxkyskopyxvfmvkksxosyxmskkmssvxyvkyxvmsyokmffyfvospxvyppypvovykfvsvxpsiosxvvmmmyyoxkoppmmifykipvyfsiyskxximspfkxfposypmsxymfsffovspokompskfyvximkiipovmvfxsmykvyivyxkivsxkkxpsypfxviksmxfiyxsmvfmosxpfiymkkpofvykfxffspoyfffmmyoxskpxyiooisvfyxiyvfsysipxvikxisxskffyvvxmfssmvomympfsmmvoppovkisxmvkxmyypyopfpxxpfiooymyvofvfvmivmiyyvfymviskfmivifpssppxvsyimipikikkfspxoyffsoxpvisfpypksfpkiyxoomikfismksfxykxskppvmvskpyoyximpssyospkxxxkffyikmsomvoyxmopxyipmfkykpvixsofofiovmvopfkyvyvipvssxkvsfvfxoyfvyovixsysmxxvyssyksspkvyoyvkfsykkypoffsykiipisskvpfkyvpkkfpxsksiiikxxfmxpxyfsospkffpfsosvpkpmikypisoyiosfksoiivkffosxfvfskpiiviyfsiosyvvyipkyipofofskixoxiyovfvosiykmmoyfioiykyppvkmofyofifoomfximikiffipkskiyxxoyffvxkmpyoyfofsffvokossixfpmffimkpfoimikvfififyxyxmkyfpioyvmvomsopkmoosxkpmyxoopikxsyfiisypyyiipokssymvffiymxsxpfmfmysfyixfxiipmpoykvmioyvpsykximvkyoovxxoifvokixsikmmkokxffosskopkfvvspmxysfpofipvsoxfyypmioxvsmixxkiyxxpkpvvssfvmvmsmoyivxymiopyvovxppikoxmyvxyokomfkmymmfosfvmvkkxvsyooyxyspfovkvppxpxiyivfkifmiimskivovifffissxyovpsyvpoyovofimvffkiikpxkofvvmpypoiissmiskfpvxyxsvxxffvyskvvkvmsopmkoxmkyiykkvypfyfxxposxpisypysfimfovifovvyipmsifmpiskxpvskvoipioofpmppoomsfomvfkpspxoxopfyofipxyiyopoviyspkpfiyvkvsykxxsykyxovismpypkiopivosxiyvxkmksisovysifkymkxffvysmfoysiyxxyyyisiovysvovxkkvokfkxpvvomismsfikxvpmxmsmxpkvyykxxkmkxpksymkxkyxxofvoyxxkmpkpivkfiikksxoopxspokmvooxiosvxosxosvoxpixokmoyfpfmvvfpxkokikvxssxvososiyxfoyyokkvfppimvxovokkviysfmmvxoxmpipsxmoxksykmimypyvpvxyfkpoksoikovoikopxkoxxvoffifosxfxxvkymixvymfpfoyvyypmiyfmvfvyosxmpyyxpmipmmyxkfkksxymksomppkpyofsmoixmmxyyxsykskmyvypsxvkfxpyxmmfisyomkkxsxffxfxifofpsofsmpvkmossivvimkiixoxisyvoffoxmxkifpxkookifiiofpkyisokpkkkkvmopkoviyxxixvssomoiikkyyfyoxioxkypimvfmyxkxmvkpmkmmspvssspxkvysomsxvsssspsooyyoyoyymxyxfyipkfxvyvxyskxkxvkvokkxvxvsvpkoymvfxmiixfmkvmimyoopxpokmykikvmvvomvffmfmsyfvyppmmpokokvyyxivpmkvmkxvfymoyksyyfmxfkkxfpopxvympxyfmysvyyyxymffiixvkfoypxpvfmofyskpmffoxipvvfookosviipixiyxmxsvpyifmsyxyiypfikvimvmvivoyxiipyiossoxmvxkyixokoffksmxsokkpsfsfxmmmiyypoymxvsoofkvvxyokfffksoofyyypsmkxkfsxoixkpkvpyvfvvxiiokimmvsvyykymkmmssfppxisxykkvkvpsoxksfmskipkoosykipxmxpsyfmpvkyxxfvppxpoyxfssifxikxxmvffvfxyvisvkfomisoommkxfsyfiospskkxkfsopxmvxxypxyfkmmsmmsmmkyyvykkvisxysimykmsymmfvpviivkkiooomymvfomyiooxvkpksiykvxkkisvvkmvifkisyippxkoksfysxssmkippsoimkpkffovffomfysxyfmvfmikiximpkmoikvxmfymokxppymmxoyiokyoksimypkoxpkpofvmoyyxovoxpoyooimkiooipyvofxyivyomfosspfpfixmovmmpppyymxfpopoyvssvxoomkxsviipksppxoimkoykvifpoiykookkxyfkopmxppiyvomvioimxvskkkiomoooppovxkssyxfvyxxymfvfvmixvppyixxipsfoopxkxofiikopimpvkyyvfvsosiissyykymxpopsfvpsmmsfivkfmoxyoskxmosmkmpsomfxmvsvfysymmoxkykyfmfmokipismymmsysvmpsmpysfvoksmxkmksvfkkfxvmpokmfsspmvfoipvxsmsisxvsxfyoxioofioixisypfiopopikfovokifvvisokkmkosmsiysskfkysmmkypxpfppopmxkmxfxvkxyvffkyxsxpmfmkiikipkxkfkfxvompmsmfoymsmivvpsxsviysksvfymfkiyvxvmyoxmxixmoxyspifmivomokspxismxoksykyvkfvpxvpyksimvmmovospvkkfyfpyopooymmykmyomfmoovooiyvyvivkmmmspkyofykokxmfsxvsvfvimmmkoyxsomvpyvpivisiokpimviypkppsovyvvxsmxyvovvspvxsppxoyfivixosximypkmoikvfsypssfksoxkoiiispioxfvyvkfkpoiifoyvopooyffkmvxsxkfposifpxomoivkfkvyvkmpskipikpxvpvmypsipvikoykmssxpxipyvskyiymkpfsvxxkmxopvxsimyssxpkpvkppifxffxpvpfykxxioyifipxmxfiiipopkvofxxpfssskoxxxmomykoisiiyvkmxvmyvsmkfvovsxpxvoskooimfypimsyimvpfkoxyyimkkskiofiiomoixovvpskpkofopikiykikofvpsovfifmvifvikkxyxkkkkmiskymixpyxopxmpxoxsvpfpmkopsypoiymivsmvkxkvkxpksxiskkvxsyyviyifixpxvxxospikyxkypmisoyxmsvyfoypvximvkvypfiipxfvmiyviyyxkoxvvfivoxpvpvmkyyppimsfispmxivvspskfmkmoskoovoxpkpivoompmmyvvfifsfisvmimpsifysfmioksvssfisfpopoyokvkmpyfpmosikxsyvsivimskykpsmxkvofxiyvsfismymfpyyoffskmoxpopsmosvfomsmsyxmxmfmisffpmvfmkpmvsfpxsmvxyxfmxvyvxskvyikommiimfssfxpmxoommvpyfkspkfmvmpkomfyvxvpksmpoxkxsvvofvofsvsysiyyiposposivfxpsfpkfvpsiskopmyfxiiyixofxsmsxkpsvkompfvpkxippyxxikmxokvofsyoofmyyvvvkviompmypkkmxpmvxoykxmyxyypvxvkfsomfvskmifvvixkpysoxsfxvivkpkoxxpymffkmmifvmfxxskmfymvfisipvfiofyyivkxopypvoykfvfxvspmppvpisvyfkfvkvfvkvfpmvkskmxyookkixkyoxmymympmoxfkfkomopxomxmiiifymsooxsxxxokmxxvkpfxkmkpifximkmokiyvxpvykfpokykskpsvssxofspfpooyospipvispyxmmmyomyioyxixvisysvpivpysfksomkpsimivoskxmvvfyxykkykkyooksvkypospimikfvvsmpkpfkxkoxmpsxkisfvxfpoxoxyvyomovomxsvkkpyfoffffmoxfvvyxymffomyvxxskkfyfyfkfpoifsoskpookkpoxvvfpvomvkvispvxikoximvxoomiimsmsvkomkoffffvkvsoxvfioyvffvyyykymxopyvffkffofmysisvkkxmpoyfksysskkykxfpmfsiyomskpokskokxffykyvovpxfxmmmmisosvvvoyisvoxpiosmomkxsmopffmmomiixiioxisyypmypxskoyxsfvxoiyymmyxmipfpsvsxpvkpyvspfkpvmimmvxvvxkosokmppoomsypkyxvoxykkixvffopmvyosikyvyvvvfmsyoxoykoikkpvmovmkkmmskomoykkviymmvxppiskvpsvoiysfpfvxpkyfooiofkpyxiskfxoommkpkymikoxkmxvypvmoypxxivmssyvmksxxsyxvkvyfoifssxfxiyomkoypsxmvimppvivmpooimfsskkksfkkxsxossxkxyimmkskofosmymmsmooofsivmxofoiymxofsfssvkvsfpvymmvxokvovfmkmsymsfxovsopvmvixosofiipikskmxvsmoimkiisfkkmiiiivofvyypfpmopokvyfmffifofsksvokoyvsimxmmoyyxfxspfixoypfpoikmxoysopvpkpsvpvsfoopviovpkvkmkmvvxspkpskokpyspivvxyfposxisiooipxsvvoxvyysimmvkmoomfpxsxxvppyivvipiofspvmiiviismpimfpxiiosxpvvvffyfvppsfskovifpmsxsoovpiyfvmxooyxfkxxpixspfysyxovomkmmkysfvmpvkfomfismpvsipkmmkspoovssvkvfxoxisfkompisoimxmmsvxxfvoypoyskomskimxyofoikikoosspfvkysmxxvioomoioiyymkvmyfovxmyysmxfpmvvopxsyixioosvfikovkskyikppsxksyooimspomkkkffxikypskypvpmimmkixiokxxxvmfxioskixfmypsxvxmfyiosfpfoxpvmmivvyfkypmypffmmfvkikosifyyovoviffxpvkmppyvivmokxfpmfpxsmfisoyfmvoyvvmsfmisfiopiioppiopkooxxsvioppixppmffpfmvofooyvmvxyofvfiipvmmkffiifiyvmxfikfsvysivkypvfyofokyiiispvfmmfykfmpysxxkpkysyffsmfixykxfyvviiviikmkkkffipmmiykvvsskfmxsfyykpfifkkvomomkixpsyvxfovmmkmmyxxvpomsyvpsxsyfofsspyxospfvvkovpyvyoopyoxmmfokxsmsppkyfixpiomoooxsoxyoksysxxopyskxoxmfvsikkmfvxpoyvxspfsfxymmvkymfyfvovksfmyomvmmmmkifxmvvxmvpmkmkympommsfyosfxpvssxxfioovkpfvfyvvyfmvsiiyioyfksxsisiiyypioviikpskmysfypikfpiopimppoovmvpskpiioovpsimkfpfyvopvypvoskkskoskpsyoyxxpffxkykskxvpyypfxsikofpvsofpoypimpsxvsfoskskmyoioiypipoomkfisvfsyxifpsymkpoisvivypvskpvmsfxvsomkovypffmisfkmsixvsiksxykssiyokxymmfisvsysypspmxkysispfkopxmimopyfyykpkxmffpfvsoxyxykyixxyifmifooxmiyokyxvmvxxikipomksfovifsiksxxmmmxsffvfvmvxyokoyipsfmmfyfikfmyioykffyoopxpffkmmvfyfppysoxoififpkmxsomoviivffpmoospyimpoffxixikfyfsksmvpfppkofoxfkvyofkxvyyvoxfkfxfvkoyfimskioyyfikfxmyfmsikmivkimvkkvxyxivsifvivospffokipvxifmfxfmvsxsivoysvxkfvsiykisoypkiosffyysomoioxfoymkyvxkyxfkkosovkffkomvoikpiyvmxkopfkpmyxfxsmikoifmkkxpfpyfffsvsyxpvofkymomivkyyoffvfmmyifsmkxoykkfvvoxivyoioxxkyykpkssisykyfoisxomskvxfkikoxxvomoikvyiiffksomxpipikxfmifmoksopkomxkyypximiosiiyxppmmsvxkxpkyokvxsfiymvkikmixyipiksimfkifkixyxfovookixvimifkmovksfxvxfkimvfoivxxoyppopivvxpkxkskfxvxmixpvfyvfsxvookvypsixfxiykfmxpssoppivompmpxypippmofsvyskxsksmysfxipysifpoyppxpsfpkoffvyxovpxifofyssviosivkiymsyfskiokkkivpfkxvmpmffikvsivoxfpivpffpksikmkopvifpkoipvymxkyyxvmfypkyompxxvofpfsifoiykoxofmksoommkiysxfyxxspsfsmimfyxvkxviokkyykixvyvykfooxomxxyxfoxvyyifvvvvpxpisyxmxfvksvfmxiyyspmifooiykspyxyikyyvkppvpfiyomffmykspimkkikpvmsfiyfsyoioiimvkiffkfsfymxyspsofmismmixomvfyfokssoxsxooyxkvxikiksiypvsipfpmifvfxxxspykyksmfippyoioksssskfvioyxooxomkfpkmpmkyskfmmsvxmfoyopyskxopmoivykvfopvsopoxkvsmxxkfxkmkpfpxmpkxkyfpvyxpmisvvfxxkxmykpvmyospvoxsymovoiksmxmmssfxmosofykixifykixoimmmioysyokisxvoysxfpvvisxpsmikyyfpmxvkykxipxioykypvymyyimffmmkxsypvsyfiyppxpfssfpmfkpokykyxkpymofospsmpfyxvkiyssvpfyosimkykpmfyfmkmkopfvkfomvoopssyxmimfooipxmkyvyksimoypikomfpimomyviymoivifkkkkvfmovfvomipmxixypkfvyfsvpivvxkiokpvoyoxvmpvvmopyympsvyosiiomyypfsyyiomkpkxfsifxmkfvfokyisfxkpmypkfyfixkxpopppkksxmxkviykoyyipoyxivfpmfkymvifvxpyvsxsmpxxvmxmpssmkfpmxvfofoxkmopykfxpvipmvifsykyfkkyiyimiixpvykoikyoimvimxififipsipfospkisvxvofxifiisvvisvikiximxsfxmxvvyomyfisvisyxsffyifykooixppmxposvvvmkmopyvvvxiipfypkmppkxosooyoiiyxikmyiokxpyimkksyvksssomkopiipomxmkissssmpyxpmvmxoxkmkimiosffoyospomiimiopoyifokmsxvvffovokofkxpmsfosxvymvkfokmioyxpkvypoippifoyipoisxxykvfyiixiyimmkosypvffsxkomoxmyfsooixkoxmyypvsxkspyksffokikyvxkfixpfooppfxpyifkofvmvmvyofvmoyvyvxfiypoxkisvipfvxsykfokpmfosvopxypyiyxxysxkoxvovvmskipppsomsyykfyksykxymmoimisxmkykmimxfsfpfvxxkfssfyfpfsfxyviymsmkmoyixxfkfpvoixmmopskmkvfkyysvxpkxfsfoxppkfyofpyvvfkmspkmviospvxpyovvvpmpxfssmikvviomvfkvmkooyymiomxvxmkpixfxxyssovvmfimyyofioxopfixvposfyvsfxoopopksikfipkyvmfofyfsmoyfpfippxfvvsikkxxovxfsxypfixvpyoymsxxfsyoyiffpkyfvmypokkvsimxmxsomksyxvvvyxkxkvkfpixvimiiovsxpksyvipxofkpovxyoyovooxkfifmxsxifsokiyksmipppxopykyksysimivfmmxisxxfmixkyofvvsxmfoymsovyokkfixpfmssooyyifkxvsifykoykiixkpovxkyvyxvixfvpmfixokksivyvfkfxpfkpskxyovsivmkyfmpooxmvfsyovvypfopioiosvypikfmskvfxvspkxmfffymxpvvpfmsfffyfkspksvpmomiomspsmxxmfxypiymvppmmxfkykosmmsxvxmxsmsfpyxvyosixixvoxypfiskyxvmvosmvpmsooxxmmyofssyfofpkmipyfvopfyyxxmmoyfmmxivyyfkfsppxxpykfpioompspxmikkxfvixfsfpkofxkimyyssmpxyyosxyfyxfpippopvsyvfypifkymiykspvvvyvssiofkismpisyxmmixsmvpivmivyoxxpyivkxvfofimkfmmyopiyommofsmvkmyiovkmxyfiiyksfvvoyvvfvmfopxkoovpofpimpympmmsokoppmsvixksixfkfyypimppypyikfxmifmmopkspopoyfpvvovoyvompfmsisoxyfkoispkyyyxkxsifpiypfpxkkovfixxyoxsmixiyyyyvxvxsvsmfpypysofivfvokomiixkksvvkxifkivxyvxsxxvofsskmkkfvppimiyofsiypmpksoyypsypykfspspsppmkppfyvyoixsvyvsxovmxxmixpxfppyxixspippmkmomvsxvpopxkkmoxvioxpofyimmmkyofmoximsyiyxykoxmpvivsmoyvvovfmkioiispvxyoyxyyfisxypfokkvikkvvvmfvmpsvmvfkixpofiipxkyipmfykyxoiixyppofyovissspxxmfxkyvvpppyvxovfypvymkkxoxpioxxymmispmmspspvomfkoovspompfiyxyiosixifsfmkkkvimyxfxpsyiymipxskofsfkspsffipmmfsivmmikfmisokpfxsmyivpkskpyofsxifoxmmsvpspfkoiisxmymfpyxxvymppmfyvmffpmfyopiookmooosvmspfsvpkmfmpsfyxoyiiovpipkykmyvoyxkxkpomvmkommsoiisxfssmpxxspfsyskvyypsmsvksyvofyxkvoipkvsoxyfskkkvpioxxpyvmfymovvopsysvkospippfopovfpskfmfpfsfoksyvxyoxovmmoxoooysifoyksyyixvvmpkkomvmossoyyvmioifpoppsiyvvyoxfkyxsfffimyoovpvykvosfssosykskikssxpvspmfskmospyxfkixspkikovkpofyfismmvmfmyvkxfisyfpxpsomfyfvokvysfixoiyiimykyskkvffxosifsyxfivfsmxxymosmisfyspxvpkxykyxfvsxofokmkvfkiipoooyfvmfkoyivvikyxpvsoxppyvsspomofvkysipivymivmopvviovkikxxfmoypfoxksomfyomffovxvivmxfmoppopoyvifppofimkoiiivmyvfmsiskskkixpkiokoyyissfipsvoxsxsyivyfixmiikskysfyyoxvkfoxvposoiikxmmmkkysyxmpvpsxsfsfxsyvyxmxpyomxfxfxpsyovkpkiikyxppxkyoofvkixkovpmyyfxmikksmyvmvkkkssmkxvpssvkoxvyvikyyviiivkpsofsvspyssvfommivkmiiyvpiiskfvkkkpfmsvvfssmvviimvykxffvvommfsvvxpxyxpkmyfiypmmmpfsivmmsvyxpmixymvxosivvpvkmpymkfkoppxfmpsomyymspviipkkvxyvopiyviyykksmmvvyfpmkyyykmxkvppxpkysoipsmspsmfpovofvfpsvvmimykiooffxpiyifsiyiosxspxyyookopxxpvyfmxipxpyoxkpxmfxvkosvoysoffxskksfmyssfkivpkmiofxssyskyimxxsspsykvxiyfixsmifkoyomvpsmmixfvfismfsksmsoomypvxvfffkkmmoomymxkfyxmkmfxypoyxmvixvovsyomvfxmimsixyxfmymffxppoykpkmivfymivykfxkxxxvoxypvyopykixivikokyxfxvpkiypooimskosixvovmpsooxkpkviiyksposxvvfpssiiixskyyxxpkpxmmimkxvoimvvpvxfyiysvpsysvfvompxvksyomkkpxskpiympvyppkvvpookvxvkkooskvmikymiyokxkmxivimskimpoxyismkvkfosmifxypkyopiivoikkimmskxpvvksxokiiyfkimkxxifpxsvmkoysykoyoviykioofkyopivfpmokmopvyoikpxyfyokkssiffpmmfmyifssfxxffvskippkxoyvssovsfxyxiomooimpyifsopvpyppisvioiksmmkisivyyxvffvyxfvffkivioivfvpsoxvxoyvfxvfoikofmsppoofxffmyxmfsfivxkpmxsxmpiimsfkyifskxksoiyffomvkxyfsxspksmkmpivpvmixkfsmxixipfympiyspxvpkyipyykypyvmkimviimsmsxpvspisisvimxysxvypompxkpxyxvyyxfospfpixpoymfvoxvvpympoixvvkyssxvfyvvfvopxsxpvipfixvfkpoymkmxsypvxvxmsyxoskvfovpvmommmsmfpsoovysmkisspymmsvvmvxyopkkfmsmixovomipiyvxkokkxmvpoxsxoofmpomkiooxoipyimxmvykksfmvpyxmfkxsxmovoxpfpoofskxxykmvspxpyikpmosiyfimimovkfsvmfxpfsksxyssspsvoyyiyixoxmomfpokpvosmfmkifvpikymkmokvioiivmkmymipyfysvofmmkkpfxoyxfvskiymppvvkvmoopymkvyyimypkxoivkxifsvoymkkypkfsximxxyvyxsfvkopkmypmxxsmpifikmsvipkmfixppmmypivpmsfkfoxopmmpipoyipvvfpxkpofyxmkssmoxppxpomvxvpfmpkpvyismkvspvivyfomxysfikvfypypiosvoxvmoiymyosmysppivfpsopisfkyvmismovyxxppyfypxkyyiivxpfmxximyvxmvpfyvkvixmkoismsiikxpkypkovppmkmfmykopookxpiipofpmmmmvxfvomsixfffpkssxoifsoivomympvooppovifpsomxikomxxxvxpiiivmfikssofopofmspfxvvypfsyvyxmomvvfxfyxpiiiosofxxymsykmvfyvvfsfyovfiimkmoykifskxosvovvppssxyossxxysimxffsovoxivvypsfxpisoiomyimysipyxkyfokvmkxipvyyyyfkkxxsmvpokffosvxssvipimxppvpsympfsomksisfovovmxsxskxvxkmxvkpyixkmovsmkyoxofkmppoxoppsxpmxskmiipxfkvxkpfxsiivoxkvxxxsyoisskxffiymvyxxofvmyfsvimvisosmiyypkoppvokkkispkpxxkmixpkvfkvioiopxkpyivsvyysvpmfoxfsokfoyssvoymxsosysmpyymsoyovsxmoksivpivpmvkskxpfixvxfoofxxsymxoxfsvivyxsxpvymkykfvmovkvikyymxfxssyomxymmkfymoomypsfffsmokvkixpymxiyxomkfixpxvsiovkkifmppmxikyksfyvmomfmxsiksvxkpfsyovoyovxvvmpmxpyvpmiyxkymkfmvpkkfimmxvomsfoixosfxiofvyosxxfskskvskpvmvpxoyfyxyyypkyvvfxmvvfyxkmmimsppivysifmffiykfksvkvisoifivsipmkyvyisimykosvisovmmvffmffkppysipikisxoiipmpksokvfmvmkyiykvkksmykyxksmxpsmifyvmviivimmymsosipivmfysyvxvyfskfkmmvpokxsvfkmvysyyymsyopvxfkmikkikyvisxpmsfmmvifxsxifksooxskxvpkfsmxpvkmyiovxifksfxxsvoipyvmvkkpokvmpykfxyksxpmkisofmyomxioisisfsmfomffmipsspmymvoofomyosvskpykxovxvmmvvvopksovvmvymfvyskmivspmyysxyvpixfymioxosspomisofkymvmpxvomxvkyokssmmskomxvxmomsvyymvpmpopsyvmyxfvopysypmskipxxkfiiffykoykimxsvkymmoimyikspxfxmmmfyviyfykpmkfmxxmyksssyoxipoypkkyfmxmypfovyvvoymfvpvsxivpfkkoyspyoiykmpfoovvyyvpfoykpovmopxopspofpmvfvmkmpxmsvxyxxkfkfikxxskpkyyvmipmkxyofxskypskmopfpsoxxkiksiyovvpiipfxfvpviivyfmkkmvvkvpxpypmifssyxovpmvyvxikmmkovfomoxvfxiykoxxmfsxfpmpsfmsfoxmopxovxyxiokosivpfvmpxviksfxfokisopsvspovofpmixpkppsxsyxkkfmovmmpkpyskmfxsvsiivfsixpfyoysikkfxfoyfokyxoixfyvsooypmyfffixykvmssmfykissokokfkkxkpysopoxoxsoikkoxosxmvpkxkmxyxkvofysppvsxikiysfokpmmfoimvyxopssfxxyoskyyxoovssmpsvmkmxxsysyimkvmpmoifkkvvsxfpvvspisxvmsfyvkmpmssvsosxxkymvxksvxfmoyxvyxmvomsmompipfxixfsmvkvfxskpvvkxpofsiyomimmyvpkpyxvyfssypoxosykooiykfmpxxkkvkxmvippmofypmxsofsoxffxsfyvfmmoofmkoxfoifokyyoyiyffimyypmiyskipioxoixivpkiofsxyvyxypkykosivyppokispffomsxpmimxifsfyyoysisofmxmifksixfmixfoxfkivoimoixmvpkiiykxkpkvpxivsfsfkyxxmpokfivykoxvkvfyvivyvymopkmpsffmosyvvifoivyoisioksismoipkpsfyxifvmmomsssvxovvkivmmxypsmmyxokivpixfpxfysyopssoioisspoiomooxfpkvivosyxmmyvfkmpmxysvkfkfkkmpkispxxvkxvmksmiimsooxfovomkxvvsvpxvikfioymsmsypimpovykkxxfixvfxoykksmoyxvvmoxvioxvxmvxkmoiixvxfsokpikiyxiyosxspkxiymfyiopyfoipsokisvixviykxvkmykpffvpxvfsvomyvmomxpivxmvoipsksfvvkokkfkifkmovspfovvksoixpifvvykyyyviympkxxsvpyvxmkvyysmyipsxxifxfomfisokysvokyfiofmppxoiosvopspmsysffkfpkovyvkpoyffpxyikmpvmpoykivmppffksksifkpvkivmiykmysxiykyoysvpxymyksmmvmiokpofspkxfyioofyvsokyoffsffixypixiooskvpompksmvoxfxfkopmisyfypvxsmkpkpvsfpyyvvsfkkmkksoomxvkmfyxxpmxkikksoyvvokkvmmyspyvmxpkpoxofsppfimfivksiyfmikmxoyiosvpxiivpfvfysxmkyvsikxxofixmvivpmiysmxxxkpyooskykpysfxmksisxsffivfppkxymspifikkysmvvisikvkopskpyfoooiyyvoppmsskksopopvokskvkpkpopskmpomxxvooixsiyiikvyyxpmyxmmfossspfsiimsyfyxfvvfpyvikmkfkfsxvvkfoxpxxxypvosvyfvfimovoymisposfppfvfsfvpofxkmsfyyxkmysvxokmyxmfmpxmkvpxvmfipfxfyoyfovpovpsfykoospoxpvoxivxokyiysomovsymkvfkpompopxvvfvxkipspyvpvvpfvvikkfsskspfkkymmsiypmsfvspixfvkkkiiykvfvxsxksfmpipovxvfskxvkopyiiximpivimfpspxympvsspykisfmkmiyxiiiffmiskfkkffvovsmkiskosmksvkkvimvkiyiovxkxmfiifvixkyvfssvipoppkymmsfpkomypsfofyppopxkfxpimpvfpxfivovkyxiimxypfpyoysvmmsiisivyyysskyoipoivvvikoyokfivsxympsspmxxmmpykxsospvfypokkvfmmvyvmovfymvoxssifomyssxkfsxmypopfxfpokfoxkpykpsmvxyoomyfovyofxokyxyxkmyvvifymmpspxksofypkomxiifsxovvyisxfpvyysyixosxkxviykvkvpyxymfsovikfvoixoymiyxixvpoxxkmimmoppsmkoxykximpssxivxomxiixfpxpmvivvsmxofpopkpyyxoysmfykykysxsiimmsxvioyxmmfvsysmoiymvmvyifvvikimospmvvofxpmxmisxmivimoppvfypokxsiyxypvivpikiimsvmmisxykiikoxmmymxofsfkmpsypfiospomvpxoiffpfpoivpvxmsvyioxkosyxxxvyxmyoopmyfisxssmoiipyvppksomkoooivvsiixmfisvivfxpmiymomyoxpvmvmsmvvyxkxvfpvfixioifimkykivkyofyxmvomiospmkpomyfoffyysvikximmvfyssxkiyviofxiovyiioiivoppkxfmmfxvvmssoyyvsymsffypkvkoossoxoxyykpvmiimsoixxxoyopvymvxsfvfvsxxpviffyisiykxooypsvfofxiospymykvkovsiksxioyxmovykyppfpkyfkiyssvysxovsiyixoppkfkypmpoiyixkvvomomysypyixxipovsofxpxxpoipsfyosfpyikoyyxixsfyiivmofypfyyyxxpiposvkkvxixkyysfyvkpkxxxmfsiymsfopykoypmkvsfvkvyfkvokifsokispimsokxsioipyvyvfiiovvivmyoikfsxxfppmyoofvsxmymskoymyvxfssoyyikooifikvopvoixxsmxmifofkpymsvxosmymkykmpvoiffkospmyxyvoiovvyvmpffxopvpxxxkyokkyopykyyipvkppyksvksfkpyxykmixkppvvismfvooxyffmyvkkmfpyopposfpsovppfpsivookofyokimxyxkoyxkvppxiysxvvfkoxykfsvmsooisfoifipvfsvyikyivysyykfppovmopsikpxxixyviiypfvvymvxxipvfmspiomvixsiyopsipxiixomifxxkxxpovmkvypooposfxvxvmvoipvkyfysxmkmoxivvimkkiivymyyvyoysyikskkomipvsfkxxssoxxkypsiikiopxsiypfkxosvosiskppkpysioisxskmvvimmxfifppxvimkmysximmyxmpymyffxomxsmyxmkmipvxskpxyxxikyvpsoimsisvypixmixxkixoymokvmopxxymkyxivfpfkpsvmfvyxvpxiikivyoskpfovmsviokmmxvmfxvmxvmyyssixsxpsxksmpfyvymspopfxiiipvovovyymkfkvsyypffsopyvyyokoikpmpmpyvsfpvxymvopoxkmfiyymxppfkffoyvkomfkovxvfvokfvmffikxsfmskiysvyskmvxmfxpofiypxxpfvvvkmsfsmxoyfyvmoofpxxiimsykkxfvxxoxkvkymipyskkvfmmopkvmpkvvmsfyvsysopsifvmvsviifimppovsxfopoypsipssfsfofkkixkxxopkpofymyipfpxvpofsxykokmpoxisyipvxkixkipksoyifvyvxypfvpkofxskkkpsosmoypkkfppksxsvpimxisvyoskipyffofvpyxypmoiyisiyyvxvsoyifxpivyppvpkkfppvmkxixfkissfxsmmmkxfiikvfxoopvpxsifskmooxpiisxsfkifvyoiymimvoosfpksifyosofikkvfxsyomsvfvxpfmxofoymikxpxsxvyxmvmxkifkookxpxxfpmfovxmvpppkmxookomiippkssyxiiyfmxosfpvvyoysffpkvfmoofkmykmvpxiimfimsikxmvmxmfsvfopmoiikiifkkpmofxmxmyifsoxoxoispfvopmoypixikyivkpkxpokpmsopkssxvfipvkyypyxfmkfpsosikmxvxooiipfxxfomokyiffiikkfpsfxixksookfkxxoovfssxpvyfmskmvsiksmmsfovfsyvsvpfisffookkkyykofvomkmfpyvsiyskixkofikyifmxsxxxkisyoomooovpspoxpfsmvsyiivspxvppiokpvipyifyvykippvkmipvvoixvpfiooxmffyxkovoxpfpypysmpxipymxpkkkvfsiifmyimiyskkkosmisimvysffppmsixmfffvfsvovkoipkypxmsvmxyyfpvmmskfyvkkxykfsffxmismsoxsoxmppoxpyiypoxxyvmppookfkmyvxxpmkskkfpkxxyviyfksxksmxysxmxkoxpxopoyskxxipyvxvmmssmfvxpisiykvsxomsopvokffkivpsfksoxmsyoppoyixofkkkvkyyxoxisfikiixfvmmypvxkfpxsvosvykmysyvimmovmpyifyskffkyskiixymoosmpypxkkkpopyyfkpxmppmmmxvpsosfoimsyxkipsoikxfvsfixfpssypxsyfvsxfpmiykvvoyixfvsyffiovkypyoxmpvfyosisyfkxmmkvkofvkfsvpmfvsipkxkmpyspkikissoyiviviiixfmvmysoyviskspkmyxkfsmxxovpikyyyfvxysssfskkomymvoskssvsksvpoikyppfppvvmpfksvxppfxsfvoikmoxspfxpiofskfkymsimmofvxmvifxopymfsmmsfvmvfxssskxkfyyifkxfkppsxkfxpsikxfkxpymyfyifxiosskxymiipsmiioyxxmpspyopfpovvsykkvmfvyyxkkyoxspkmissfkpmmpikykyioxxkksvvpfyfomfifsfviyfkkymvofvfpiyffyokxkymyvxsmfpxksvfvpvxspmyifoyfkiykffymmomsmovyisfffoxfsymykymfoysosyfxkxpfmikimxpmpxmvmyosspffpikxvpkvifkokvkykxmysfmivvyossxsvssofmkifixfmisvpovfksipxfkvfxfpvipsomfvfkiyyymxvvvfpvkffviimyksyfpyvffioymymyiokoiopvpposkoipokfoyyffvfkmximmoikxsypfskfmfoimmvskipsopoksvopfyxpvmyppmmiyiisvofvmmoksvpyyxkkpisvvoyvxpvsfspyxofioskokpyfmsoxxmvofofoopxskkfyspmfopxpxfyvsssfsysokkpmvfvsyiisoxmfiyiofovkpoioivpvkyfisvkmokmxppiosmvmsyvoomssyysvfskpmpsfiiixipmvosmxspimpyvokiyxpyimmsyykoppxvkommkofiimikvpvssspsvipsvxymppkiommvkxyvfmxpfkmmipmyvyypmifkyxyxxsfxxxkkvsiovimkovspovmosfpfiviysvmoxsfxmyvysofioyvpivsixffpvoikssxmixxkxkyopoxfyvoispoxxxxpoosoiippxfivsfofxxoivfskkpofifppmxpipkiipfovpvpooixsivssmvpoymkkiixpxvmxvoymmykxyoosfvfkvfkvyifopkkfypvsfmvmkkoxpsfmyfyxsspxvmxvifsooopmfovookfmoxfmymppfkskpoiioymsvykyspyivpivpfvxfkkyviooissvkxmmxypvsvmvxfffkxvyxmisissipmymmkmysyyposovixppvkfyyfixsifsmxxomykiyofxfypipkyypvyfkpspoikvfmsymyvysskppyipxkomvofvfyypfxkiivsyoooxvixppmkpisysxmyyyimxkxkvmoxsiiffsfkymoopvfpovimpsiiyoxfvxvysffpyyyyksxmvoxvoiomomxkpimiikkvyiipykkvsvppvyvipxixpfpoxmpfyymkxisymiixxopfypoximpvmsvivvfpppfmsxpivoiikxiokooysovxkxomvioxvomyimyvxoxpsspfsvmovxkkvfkfsfsmvxxkoxiisfxvfssssmsfyysxyoopkkvxpisiioixvyposkpvfkkypopoofivxoxsmskyxpvyixsmfkmospkyvvpfkyivoymvkpsvmvmffyfvsoioxmisvsmvkokysofkopymoioxipsfvimmkfkvspxmiosifkkvkkvkmkvsfomfpifoxfxifiomkoyysxfkikvyfvskfkffmmvvkxxppfymmypfxsioykmxixykxovpiofxpfifxivppvfvvisvvvvxoxyvmsyiymivkiispmpmymvipixspoxfypokiovfsxyxosmxsvvisofiosmixsyfvvmvpxyffisskyfoikmfvksmixmpioxokffsxksisppyypfkkyfssxkmfsxviippomopooxkyopsssmspsfffxmvivooomvmkopkkyspvskpkmyiimvvkxospyksismisosffofykvimvikysksxfvmmpvmpkoxoxfxvfokmfoifsosmymoippxkfpvkxpmipymkyspikoiifmxxxofxvxsxmvkiofvkvkfxyovsixsvvkoxoymikovipsoofkopxvmksviipmpfsmkpkfoxixxfvxyfopvkyfpokxyyyvfvskkivmyvikmsksfmomivmsmffkkmyvfyoykvmoisxkivifmyyfspkkovppkfmmkssifiyokxvksvofoxiffvmpfppyiyoiksopxxovmsiismokvxykxxvmmpyfpoxxxypxysmopkmsiipvsssyskmkmmisvvsosymkymomsvpyyfmxispvvkvosikyoiyfkpvimssmikimyiipoxfpoffmmvxvfmixfiipxsmkmmpkkpxiifymxsyvkvpsyfxsisimmkppfvkpxvpiokkfoofsfksppfxmfpmxvvymxfoxpfipxvofsvpopkvkyfyyffpsyisfsvsxxskfpoisxyvpxxpiksspspmvixvkkvmookopfspxfyfxmxkfmkyvvimxsmosfioioipmomsosfxofyifxovikkopsvsoisyfofkoosofvfmivsmykxmyvopvixpffyvypvmkosmkkvmxkysysvxokoxiymixsfmvyyifkppsmyifikyssyfvsmxpoposivfsiypypkimoxsfxofvskpiympppxovpxssfpvpsfvisppkypfkfkykpisovoiisspspyxkososvsfyoyxxfomvypokfmoxxosmoosvmkkmxpmsxpixmxmokmfypfmkkyyssxpyyifpmofivffypoommmmsifimmfmomopookfisifospfffmykmmvpssfypymxsvvsyysxiiffofooipopkksfmxmppkpomkpfkyovvvyvssmmmipkyopffyskpmiyipvsisxiyomfffixxmipmmfkximikssomimxfifyvyopxssxsfvsspiiopxfkffkypxixsvksivooffvskkvffvpiviivpyyfpxmsvymvsxvpsvmykspmvovsvpxvosfvsvopokmxssipymyimfvsfoyfosoimkxmpoxspmivsxkkxfmsopximpvooxvipikvsfsviysomyxkkopxxpossioompmfyopsvpomfikxikfmisfkxfopkfvyskxxmpmyyvyiofkkpmxyypmpfsvpfpsipkvvsimioxspxfyxfopspkmpskvviivvvypvvmmsopsfoxosfokkyxvoxfpvfpxfvxvkpixmfkyofkisixviymxpypskpmokkfifkskpmxmyvpxfpfokmskfixyykviikyxysyopifpmfxivyskkkkvysvmmyvfskyoxpxkymkksxysppyvpsmyfxfxissysmxpiosvomxivsykxppfvsvpokvvxvpymmfoksfyvfxovkxyivxfofmfkoimsoyifkfoifopoyooymxkskypmmpviyisksvkpffxvsopxfkxskfoxxiikfymiofypovykmoifyxkpxpiyipivfmxoykksmsskypoxkmfooosiyomvspmmsfkyypomoyofipffyoismfypfmixvsvmsmsymivovyyikkoypvvipfxkiksvkovivpmmmxkiopmmiispipmiixikvxfvippvfkmmyipfyifyxffimpmfmxkffpvfmsviyvmkpxffvpxsosoopysfffssfyypissxfofvkimffxpfmpismyoyvsmofiysvsfvypksposfkyxmoxkvkmpikokivovipmovoovpfiimosmsisfioyvspfysooixppisvsiofyoossxpvvioyffifvfmsmvfimxxsovopvfvkokyifssppkfoykvosxfypikpkmxkfxymkpfymofpfpmpoxmixmsvxpspsmiviivvokxysvsfmpsskximovsvvsifxxpfvyssfoyfoffkvpmxoimfvvoovsvyvvkfvfsmypposvisysvmfvossyyxfxxmppfxikxssfyyyspoosikyvmyfpofxsfyomvioykpypovpixpmkipvvvypmfxiksyppmiffopmmkxyiskkysmykmxkxivvxskkfxvmoxssmssimkiffvmkvvymipmppokpmmxpxfvxyymymppxsyymofyioyfxmvsffyivikivyvkpkofpvykfopioysixsiypfxokiioiimvvppyymyskoyxspffmsvmsmoovkyyyfmiipxsxiopikxkvxkisvmyyimimokyxfisxkxoximomixksyvmmsfvkvfvxpyvyoxsfooyivyfpspvmxmsykfvpommmfvkoksvkfimvfxvxvippooxxmsmovmyxpkxyxyspyspoopxmipmsipvkpyvosvypffikfmxsvfppovpvpipoyppsffimfkfsopspfpysvmsxkmpfxfyxovommipymmxipkvifokikmxoommvvpyvifsfyvxmxkfkoyvvsvmfiikivykpffysyixxpvvkpifxookiifxysopyfokifipfxfkfffypfvpsyfksssokvsmfosfvkosmpikyfmoopmssssspyypvossooyysyoookoivyxiosvypkoyyxspfxymxsmfokkxifypivopyxyfyxkfosimykkkxvmiyfyfvmyosxmvmsoifxxxivfvosoyvfiiiovisvovxiovimfimkxmxxkpvmixvssoyofiivfifksoxfikpyffypymkmsksimksokipppffpfvkyppopxsipppvfxkmpviikymyxxxxisvimxvpxfvpfkpsyivkvymssvvskoipvmsikvpkmikfpvpiyisxovkyyfovskkpkmfixyxpomsvyskysvxpoyfommmpvpkofompfkkvmivxkoyoffiykkyiymmspkxfymxvffvyxkomfoxmpxpkkikysooyskyxppposfmxpxomkfpkyxfoyipoffokxvmykvxmxmmokfioomvxkoioippixosifvyfksospyvipmkffmyiyyxvsskxyxfkismsyvykvypivkmokmsmpvsxisspixkpmovxfxvkpymimyypfvffvvfyxiooxxsvvifipsmymoivivssoovsipximofvifykyfxfviksfixfsfiskxyxskxxfxkmmvfsymvvysommvkosixyyikoxkyvmfpfxkxkkypikpmoskyfxpvikyxvppmsvmpfoivpikfoxsovsxofkyvvxokoyvpmvfkpofsxsxpioxmmikpimyppfkfvvxfpoioxxvvpkyivpmfpmixpfkkvyosisomimxmisoppmymxkmyypoopimmpxpfyiymfoioxppxkyfxovmikspmvmkyyxvvyvxxmkxsifoksifpfiosmxkkiisskiksoyxvpipyoyvmyvfivpxmfffkmxxmokfyxmvkkkkkyyvxovymkmpiospvksyxsxvfvvfxoiypsoiffpoppsvmvvxfxsissvokympoiyfpvimvsovfyxfkxpxpfvyxpoysisosxfxoppppfxiomyxfovokmvsvyvpxsovmpppvfiikiixyvismioymsifymoxyssfsvxxiimpmovfkyssxpxypvspvvvomsoomimpfyoopfmxyfiisfssmyppmsfsfvxivfmpkykipofvvxffivxxxmsmossifookisxokivfxvxsvivomyxkkpvvpmsskoykyxvkiisvvvvokisxiivmyfmmykxsfmimysmyoxxokvksfyfsmmomsvxmkfivmxyfmkyioxfkpvxoxvmmyxspmxvfspxmyofyfmvxvykffmifsxksioiykviiikkoyofypyipkoyxkimvmifskfsmxpvvfsipioofsvksxfvsfmpxxfiopssfyyiyyxmfyksxsvkfkssypiyvxofsxoypoxfivofxfimssoyfixopyfpfoyxivxxxmkmmvksyismvkiovkfivpsvpmiffoispfivvffyyvospvspvkiykkyfmkkmxkmovpkmxiispkfmosvmpkxivipopskmvfskxiskipsxypvmxpipivyvxmvvsffofsmoxsyoifiskyvyxyffspxosksimmkkxfmxvikffpikfyfvikimxfvsmmppyxxxisxvfxvoxvikkyxiysooyipifixiiiyvsvikoxyyysoymfvoiffyyiompkskvkykiymmvmssysvkfvpskismiofsiyoymspkxxyvpfpfpsspxkmfxvifykvxvoimyxykvpvimsoxkxksvyifyxopxpiymmovspymmixixvokpvskvxooskffommipfyofpxfmkxpxyoixkvmmsifpkpimkpviyvyooyovimsvmospvsfimiyxixyomkkymivyisxyosxvpfpvmvyxkkffsmfoxksxfvvkpisvoppkkkifpspykiymmffvyisvkkmxviikfsymomypomoymfyfyfixikkkoyxmkiisykviysvyiksvoypkssyppmofkykisoimxfvyykoypmfmmmkxosxixxxkvomvvoyfsxovipyfspoimxsoooomsmskyiypisxvkvxvxixsippovimsisvkipiipmskopkfomxvpspkxfxssiypkixxxxvyovxioxfivspomsxipmxyvmxkkopfsvoosfvofkpvsykpfpivfxmfyvfkmkoxpvovvisiiypoimkxsyommpmpfomyopmsokyxvssxsoisvyfimxyfsmfiosxxmixfyiyyvvxpypksymspxfkffokyfpfoykifsmikfspsmpispfoofspvyvsoyixfifmosyoxokxpvmsxmxsfoxxkxiimymioyykxpmsfsixifimxmmmofxofokfvifxfooyymskxifposxvpxyyykkskfpxympispfsyxvpkxkoixkpfkyoxifpymospxokmmxskyvxisxiokyxivsokoyimkmfvimxmomkkomxvvfysmmvskysmomimmfkvvpfpmxpykmvkfmmoikmmvpxoisysmoymyvoskpvsxifsoxpfioyxisooifoosxvxpiykyykvfmkfomfivvovymmymmmxixkvipsfimvkyvomxiipxsvxyffippysmfoyokypysppfixxpsyvovkkpyoyppmxiyompofoioosskfvpimiypofvypxffiokmfoxfkoxyifiypkmvkomvximsiixooopmopoooovooskypivxpkixsfooffsyikipkkxfosxyvsimkofspvxxvvoymifskpyvskikoikmykxiymkxfkiisxfvoiyvskxpkkpmmmmpvsfmfossyppppffmviyifffvvifsxiffikpyoyvyoxpmmvmffkskipfxkvsximmpsxfofisisfoiikfyypxxmsixppiskmpsvfvspmkfffxysskyifiymfvfyfyyvfpsfpivsxisfpxfxpofikovipvkymfvfsxfsipyfyopfokmsvsossyppoxovykssppsiviixxpopvfvxmkoffyyypmfviosxfykxvmvikoompfisvyxkpvimmymovxofpvfkoxooomxovmikxkvmpmkvkmivvmpysmysfivmpysvfsxfmokxkyikiipvofosysfyyvxiymkssvyopoyosyfsosypvmipikkiksmxooxivfyxmyvyvvyfsxpoppxyipkoyxsxsyiyspxxisvkymfpxipsmfvfyxpioksifyyvymfyxoffmvxpmossfiyxvissivykvyixxymyxfpssfpsffyymmpyyoxiosyxymkpoxkxsfyosoyvmvsxxffomxoffpffsvyfvsimffpmoiiypymkksxspxmykofimpmkmxvyspkmxsxpsmiskmxpmvyviokvsvikmvymisyifsvpkyixssmssmpmfxykpxspfiivvfmooykxkpxmxkkksoffsfppyiopvpmpopyymppfxymfpykpvvmvxpoofookkfmyfvsvpimxskyfosxpyoiomvmkpisxvsskspisfkvmmpfiomiyvxyvkmyymsikpyxfmokifxxfosisiipxkvmyyomoxypvmkissxpxfivosvxoxiymxmkvxxpmsiooxyxosfosvmvmmyvimyiopfvysoipmkmmkkivkooympposoxmyfkikffooxsysskfxymkspsiommmyfmmmfyxpokkkfkmkmkfxfxykfoyssyxyxosvkxfivmkivyfpvmkmksyximppxmfpvyoxvpxvoxsifofkxfkosmofvoxmmsfofxvmkxxovfxssfmsmssmfspmykiximsiyxfmosxsxkpoooypksovipmfkyfsssimxovmkfkysspxxokkmoxpompxipomokmpiooikmxmvkmoivsyovfoopfokyiifoimmyisiskmxoskmmfssofimfimsxkkpvfsvkkovvkvypmvffpxvmsvpvoykykfooxipkpixkomximvmxkyvmffpsvmsxikiofiosomfsfoykyofkymmmyypxkfkyvoixmosimspiofvyppfmkksxifmmofsyymvvifffkoxiykvvmmypmoymmmvioxvpvvymykommpvfxxkiximfipfpfpfsxvvopmskfofixxmvoimmyxpkmopvpyxyypskoposiooyypopvifspxvikiiiyyvmksisioxvifkoymykxkfvomspxxmvkiyssoyopsmssxosyysmpypvyxsfmfvsmmmmsvmxpxfyssoyvypiifssfxmxxsfpfiyssmsvsoxkvmomvovvoisysssosiypiskvpmkkiioooxmkoimxmmpyopksofkvvofopmypxmsyyomvkxsookovovvyfsmspiffvvoyppipvvifsivivfofsvoyyvsppykppyysyysfyiosfksxovsovkspxopfppkxvvifivfikksxmyyffvfimpmpvpovyosfmyfkoiivsmxpmfvyssiosisykfpipmofvxyxyxopmsmimxoxvkvpoivxyiiyxkvmfxvxskvyifxfyxvixmmfoffxmxkkxmimmxmokpmokpoomvvippyfxfpimsmipppkyfvivkyyssskpiixyvppsfmikmksoyppmxskpymsfyiofopxsiikpoimvsvkxvoykyfmkiksxsxoffvmyomskvmxovyxmoxxvvvmispyypspxifkkkfvpxsvpkiyvyvmxkkiposxoippxpkfppofpvvxyxkofmypmxmmoxffpiixpkxkifxfsvfippooimmxvvyxxkkxooxyoixmpypyfyvfpfppxkfxmsypypioyyxsfoiiyfpmpxkiopfpyismoxfimysxxmivppykmiooipsmxppmvfipixxkpyixoixkpfpopvofxvomoyxmffvmkppsymmixvoipkkpsxpkvvsissxyymmmsmpspvffompkxvssfxxovifyvsiofyyyyyspopiyyiovkvoyysipxymxvpysvivoosoypskfyppypivvkixosxsxmsofsxoiyxmxxvxmipykmkkkoxpxovxosisvkoffvsxspofskxxyymixxkpksykmkpvyfpvfvxpyskovmkmvvmosisyfyfsyikokxfxpoxisppsmimixykovskiyiiiovkkxyffvvoyxisiofiifpvpfiopyyymomimpoxpxsxxiyfpskmxmyomisomsoyfkpxmsyfkioiosyisiyssxpfsyxpyxkpsykkoxoyfoimvyiixokfsixsksxvxiikxfixsxxmvkkvkxfmpfpsvxsvksfyopxosvkkxfiokvisxxkxpssvkkkmxooxomkmovsxpmfmpxxmmfvvmxxiviskvoyiypfyvkpmmypvpopfmskxpokskxxsmymmpvmyoffsixomkmmixxpsvpvkxskykovsivvspxipmymsovospikpxmfifkisimkvsomxvmxpvffsvyyypvkfxvyxkivivvosxivsvksxfmkoiiksmpiymoysyfspoooosmfxfpxomoyfvpimxvfssiimvypkfipvisikivmvsmmkmvoxkvisfyfpxmvifxoymisxpopxpxkvivffkvvmkomfooixsfvmmmypxmfsvmsspkifysomfoiovivfxvykmipvkvoxoysmyvmpovoxkfmvoisoxxvppippyssvymxxxpkvfikipyfooisiovxikpipfffimmsxiykyxmoxymikymmsopopfkiimxosfofkpyfxiikokkiipfxmkmyxkpykfmoyxopkikvxysmsykfiyykfmifikymvkosxpyfsxoisfxyxpifpxksmpivffsiiyxvokxyvfvkvfxxsmyyvxxkxoppoxpvmvmypxvfympxvvfkfpsyiimiikkvmfmfpkosiypooxvyomsypsfpsyfsvvikxkffkkpofimokmypmfpsoxovfvsvymisxpmxssokxopkmopsipfkmvxxomvmiixmvsxmxmpoompmmxksfmoooxvfospyxvomiysspmvovkkmppkmsosxpxompmmmvovxfyxyoiooopkkmykxvoxfsxpsfppvyyvppsimmkvypvpmvsskspfvvymiisifkivissxkkvpvyyvoivksskmkvsxsfpvyfymxpsskxokyomkokpsipiipispkofxkkyvmksysspmxpomyopimskofsyvmxfkpxmskkiosvssmxoyoyxksofmpxypxmooyikikpvoyssksyiokvopfvkpysifsvofpymfomyyoffoxfksmksifxfpxikxmffyxiiiiimmxkpmxkpmssoivmvvsosxxsxxkkyiivmspikipxmppiofpvimmpssypposffsmpmpxssmpvokpkkpvvovikkxsxsofyvfpvximsimsmffxopmkivoipyppoypyfpyssxviooxmpxixpfysxxomxxsvkkiiypkvvkmoyvfkikkfkmovioxipsosfkvkmfsixssvysvpxkmifpppvsipxvksmomxmoyoposmksopopvppsoxsyyyksvxkyyxfpvvffkosoppmfmvmvommfvsiismyyxksxxfksfskkfsvsfkysvsxfxykkxyssxpkxipvviixfmpmiyspiykxsfkkxiviovvofkxofvyppymfmsmpmvfiximixyyvovvvmvkysofvkopvmyfixkxfipffisyixmmvkvmyyysxkoximvsoppoosvxokkxkmffosymispyxfymfkmssxsymopyspymkmofokmfspiioimskvvoxpiyvmoiookmyfsppmpmyxmxpkyfvfxifsymsimmovpipoksosskmsykxxspvisvpsfxxksopxykxvkpofvfyyxspxksysyfxsmpvkpyyiyvpixvxfvsmmkxvvyikkoyssvmipkvsyvyxffsyvfvsxvkfpssxxoksyiimfvsxxpoxovxxiipfixpyyommfvpoimpkvvmpsffpipmxofyfoffospikvookxxymifyfsoxopsoymiyofvmfiyksvpxvfskmpkksvyfssiipxspffipsyvvpspioyyovmifppikfvfsmyimkpsxksivoivvykimmvoiksoxikiyfypmfokisxskpssyxpmoxsyoipkfvvkiyoikyomkpfvxoikysyovpvovxfmxkkoofvisoxmmkoxyismmfykpvfsmpiioxpivymxxpfovikxpsfmpossokyymipxkvkvykiymkkkxioxkyfippkvkmmmkokfkvoskmfffffsopykksmiymxmixiiimpkpvypxvoovpfxffivyipysymoospisxxyyvyfisomsxioivviiyiiimoysfiipxkksivvvoyfkpkfxppvvsffofysfsykomvfyfoxkfpsfvyypyskimoomvykpppkfmiofooiiiofpvskpvyyfkpvxfsyofifximkiovvkmmykvxfosiyxovkvxkxvpspmxvkysvsppvixvyfosymfsfpxiofvxksiyffyfvisyffmixofspvvoykpxifsxsikvmxpkvmsppffskiyipovxkyvkfyoxmofvyxoppkoyxiioovvxfsofvoyssopfkkpfxxfvsxxxfkfvikoyypkxkmsfmfxfpkkmixioifsfxpiyyfsvxoxfsmmmmikpspvfvpmxxmyykpvopsvppkfsyykvxosvffviimpkifooivkiffxiokpoiiovimsyyixxppypiimvmvoikmxiyyyfoxmisvxxmxoiksiikisfopkvmmkxyiyyimvyixsvkiyyixiomvkfmipipsxmpvpskfpyosvxpixmmmpyvfvfssxxiikixpxxxixfsokxxpysixmsiipfxxviyssvkyykikkofsfvxkkvfoopvomimmisipoifvvimmkppipkxksoyimsyyxmvvvspyoipmkmiokiisxfoxsyoxxvokfiosmssiyfkvxvpvofssfkskvxspyokomimimxkkkpomviympfofsxkxkpfpyiksxyofvisyspppmfpfxpxfmsvspyyvifoipmmofspsokosmpmskvyvsfpysfimxmosskvisiismvvyopfxfxkopfykymsyfivvyipiofikopkffipioyosifppyypiomypyskomoiiffxsykmmmikiyoysvpfvmpkoxovopopfxfkyspvpfpvxxfxxxxvivxmvmvxypivvvspyvsyssmvmypkkvxixifvxmspxmosvfvpmoopspxpsivksxspposvipimosvsspmompvmykyvfomkfioxkyssmxpvsiippfioofpfsffmfxfxyfksivmkivykvosikyixmsiyvkixpfvmookokoosvvfyixyxsmxioivfvvyyfyffyvomypsixikiykvvsoxvifmpkxyvivixvmyyskpmsifoxfxkkykppkovmxpsfxspssvyyvpomoksvyfpoioikipvmmykvpppkmksffvyiovpopmmyiyoipmspvvssovvvxvsfsfpkkxfxkikoxkymoimoopyvpfsxokipvoffxvopyvosmmomyifppffvispixoypfpxvofpksysiyivyoxpkxpfkxskpposppxiivooxssmxkskossfxxpsxymikmyifsifyskkmiyfyfixfkfooiovomoomsossomykyfpyikkfmspxmvmvkiimofkssxvosyioisvimkpmmsoffyviooomiyfyxkyyvyxiykfsvixvsfivfsxpfsmxiviymxkxmpyxvpoivmivookyxkvovvmfyssfoxvvskokxokmmyiyyyyvxspiiskmpvfvxpvxxxyxkysmsffvfsxikvypxoopxfskioyvkxfxikxyoofyvipxikxxyoykixssmyfmvyyofsfovvvfpxsmvpoipmykfymvmxyyixmifiykkfvxixxxvspmyfyfkxskvmoxsxmvffkmkfyyovpmkmfpopsxoyyffipkmosssvsymmvkpmpvopfkpypyfmvpmvixmyfoxfomviixxxpfovxsmmffssymimifmxxvyvsykmvsfxxoyvyfvkxfpvymfpkmssoofsxvyyvyoixmspxiikyvpfsxipsvpkofpmmfsvvxovoskkxkkvkoxmxvvfiixfpxfyxskksimixisoxfmfyfooovssmpkivvsxvxvpxovyfiipkpfxsfkxkovysxispsmpppikpxsoyosskoxopymofvsxvyxxoofyiskyvmskkksokvmiiysmokmpspsvikkfyokviikyimmfofpmyovxsmyvmffxoxiffxopvkysxkmkixsixmpspsvxxvpimksmipmvvxvvsfppffyvxvyxovovyiyyppyikomkmovyyimvpymfspxxoxvvsomxmikvpykxsfokmmysssvfvfioismskmypiyiovikvmxkmmfxooikvxvsvfkfiykiokpvvssfsysivivxokxfvikmpyxxxomssvkykpsfxmmksokofkvfomixfsksopivvsvkkspmkivysooopymsmoymsospxiymoopfpooxsfvvovfmpsvkyimmfmmmmpkyiimypysvifikssyvvxxvvvfisffkxvyyvfmxxpxovimfpimivioxsvysvmxfmpimykkksimmoxifsvmvxfpkfompyvvfmfmffvkioivikvymsfmymxkpmixffkyfoxykospypsyiikkxypxypkxofspviomvxvskksspxkokxykmiossmiypikpkvskskfxfkmkxfsxfmvomfpooyykffsomsxvpoxoiismsfyvposopxmiofmoyykxfvyxxviipvoiimopiskxsymsofysfmpxffyxyxoovmyfvmmpmpokofivviyfysioyfkffxfvppxvfofoyioiyivoyykipipxvipkmomfmvsmymkyvmfsyomismsvskvifxxomioyovpxkyyoxmvfkyiyffmofsvyypvvvvkfiiksfkxfiiymkpipxpxoyfykpxokfkofyoyisokpipmxpiiffmfokovkkmmpiyosifksokkmifmpfompxfsissvkxmsmmffpymxisyvfvyyoovvfopikomxxvxfxpffsmopiikfvympmxyyookfsfpyyofvvsoosifsivssxmxpxsvfispkosyxvmkfifykpfypxfixxyksossfxxkfmmivpyfskmvsmoskimfixvpvimvpxyvfosxypyipxxkfyysxofxxkmspovvipkovivvsokxvyxvfskssvfposvmsifmfpkssppiyiisoopivxixokoysimokvipmxipfyfmspovivmkospypfxxvoixiysoiivipiokfmfmsvyipvvimpomvpkokvomisfvmmmivokmssfpvmpmyiikvkfkiopfifsxifipxmvpppvyxyvymyxffppxkvopfspoiipoooivkixxifxpxkskmyovsfkpvfvpvykpykiomfspyopomvsxivkkkspioxmmvsfxxiovoysfpyyxsvkvfoikvfiiskfkxsspvyysmopiksiympsssmofipsmvsxkpsompikvxxkpmsmoikmvpmookxopiypfiyfykffvyfyyimvfksmooyxxioxvomxmfkkoiommyymyxyopsfyipoyxivvokkpssvkyovoimimkyfssfvpsisskpopkvixxypyikyismsisvxxoomyffvvpxkofvifyksoivixoyffossoypxoikkkmpoxfsskmimkfyovpxsmxsiyypiiyvspmspxixxyoyvmymovmyyovmiyypxmkyiyypxipvivfkxxssipxsippiysfxpykyyxmyisvomxsmvoiyfymmkiivkvfyyvskmipomypvpyiyyiokkxoxovyookyfvvmosfpkppvyimxmsxxkmoysosxmfpfymykppyxpyffxppfipvivpksimisyymmkykvmpffxmsmskkvkvfoopvpxomoomvmxkkxmxxisvpmxompkvoyyfmoommxiiyksxmmfofpfiyfskvfkkysppfvskixpimmypsfkfxmpiffsxkmiyfkxoxsypksfivsoskvsioypxpiipoivfiymsivoyviyykisopvxioxsovfxosokfvvmxfioymvfsfmpyfpskvfkmfsimipvpsfxfyppkoxofykvyxsypvoixiymfxyxsfmmpfsxvkpskvxsofposkypoyivvmmkfvppfxpfikffxvxxfskxikxspvksssoiixkfmvopffksmfsvvxvomymkfxyspxfpyisyfxfikmvvixfvypvvypkysoxmxfpmoiypyxfvpysokvioosifmixsixsykxosimyxoisfovvffkiovyimsfivsoivmofkxsvfvyompxmpsmsfxvssfoixyipkxsoyyymkypifyosskiksmxpxffmiosmvosovmifpofvfvkkkxmposvmypxxkyssspoovykvvxvppkyvypfpivskvxkpvpimffpsxipkofykffmpoxsxyikkkoikpipsmxoosivsxfimkpsmmfxykfyimfmvykvivoykfpooppmvkoosssvimovyxysofvymomxvyivfyyxsoyfximyxkppfpoosxispvkvsffovomoyopfvmxvofmippkvxvmfxpykvyfomypvkppkyyypmysoyvykismpxxopmfssxsivvkmioossiifxivsviofpovkmkfoymsmikfikfmpmpmoififmmsvfovifxxxkkpspiyvmysisysfkvvpsvomsfvsvksxkssvpsmkxkosviiomvfpfpvyissvmfxxxpmpyvfppvimkmofpsivyvsivpookxkpyvmyvmiomfmvovmyvkivkyvmovxivixioxkmoioymxoifikkkpkxvymmfoyfkxomfivymoxvypxiyfspisofsmfpfpfmvvpyvmmkpmfskofmymxyipmykviosoxmosxoxfixiiopkmomsfmfyyypkpfkxyxfkovxmvfvposxskkiximvvyxvyoopkpfpksmxkkpvkmyxxivkxvvosokxpfmxmpssmvimssmxysmiypfkysifiioyikfvyxiofposyxmossmosxkiikkvfooomsspvksvyofisosfkkfoxpxpxvmsvfokyvspiopmvikmskvimossiopxpommipiymkmxkxmiiyipipkvpmivyfkoysyvkmyixkymosfvpvovpmyxoofookvxkspvxvsxpsvvomxvsimmfmsxvkkxffsoxfyovkkiivossvvffxyfsymmysmssikyyvkskoivsoxkkkfkkkoxosyfimokioooiivpffmsvxmvsiyvyymfvxoiyfpysovkmopsissvipyopksmxmppokivxypkvoimyvxfvpffxyvmsxokopxkpyiooypxyyfvxpyvsvvvisfyfimoviyfyoosisffpxsioipvxiomxvppmoxpxkpxkymfxyxoypfmyifoffspxpkkfpvkmxppofkvfiyyfffxpifvxsismpkkpovfxkopmkfmmvkxspspookvpfmkxsfxsvykmkiooxxxpsmfpospypyvxvvooykykkkvsmmmxokiymmymyppfmskkyvofximfvfypvimiopvmpvmxkxmiiikkfsmfvkpykoffxmyskkooomskxoixsxpvixpxyvoppimfxxxskfmmmkpimymiksisfkikommyvsvkkpifkkssyppoyopkysifpivoskvpvmkkxioimpxxosovfyxyymmiiiiksvixpsyiikpoppssxkmsxkviovkxkvfopmiopkvomvpxfxsvfovoopfoffxsiymfxovvsoysmmpiifikvpvmymsfvkfsfokxyoiiommxxovvkvfmkymkpiskyxpysyooykmsvymosvkvvmykokxovvofvsypixffsssfmyvivmmxpffxmpykxmmysivoxvsxvvyxfxsmvvpsikvfimfpoxypmkmosoyvkoomsxfxikomsvmxkkpokffyviipmmfsymvyssimfmvkspfxfmxxsfvpxyxxvpksvvspvoixvxyipifffssimssvmvkyxpivkoyvkpfkoiikiskomsmxipfviofvfkspfpvsxmmfimyfmsoyopmkvskkvmvvkoxfvkipxyykkyvkxppvpxsifiymipvyvpvkyookpkpmkfpisovvsvikpivsvvsopvykpsoypxyivvykixxkpkfosoyiffooikxxxpiyyvkppxsxpiokovpippkpfmpxmfpmfvyspfsovsvmfsmosyfmfiiksymsmoxxkiifvkovkfvpyyfsvyfyxfxfiivipkyoxifpoomskokvykpvmxxmvsofyvkpifofkpoyvvioomoomiiipvsixoykspysmxiikpsmiopfyoxompmfkixovyfsofkfkoimvkmvvpvikvyifvvixpipisyxivyxmyxkmsmmssfikfmoxxyiofvomfvvixispvkoipsmxmivfsvppyyopyyppsyopvmsoosiivvkxxpfifxsfskyfsmffvyvivppyoykfkvyopmioyffymvpsoxkfpksymsfissfoykvsiokvyfyfxmxfyxxxokpmymosmxmsyxxysmmmxypfippyovyvfimyvofivxkvivkspxomovsfxvfpysipvfpxvoxssvfikyyxyvfvyixxsmixsioikosipvvpkyxifoiovffimmxxoyykpvpvomskkvvfxosfoiioxvxffffyvyokspkiyxvoyiixoffffixfvpxyiyimoiyfkofpkkxpysoxmsfkofvvkixvkympvspxxfpxxkxfxosfvifmyvypfisfmfyxxmsxssmfsyixkmpkmipimikfvmyxkfsxxyfifvyvyfvomxiosyfooysofysfspffxmmyvoyooxksompmsiyspmmpoysxkvxsymoxoyyympxxffysfxpmisvkiiovpfvfoysopxofskfxfkkkifmixsvovsipkpxompvksikfmmxxxykkspvppxykixkmiyfpxixxfyvosvvvyfmpmyysopovikomiypfymympsookfxfooiopfpifxfvvvvimksxifpvossiymiyvkfykfmsvpiyxyxoimvpkomkomikvfmsokymoximfvoyvkppfopiofppookpfkiyvoiyifmkoykvokikpvoyipimoipxixmmsiymxykkookmkimmoipfmoxisvkkkomfmypmpykfvipmvysopykvyyvkopofyvfmvmxysskviipvpomvkkvoxivmxoxkkmffmkxypyopivxykxvosppsxkvfxfiisxpkxvofopfxvpkmmoykmkvmkxkmmffkyvyoyxfspomomfsoppfkixippivpxykyxpvxspfiokkimymvfmpoxvyppsipsipikyyyfkyskiispmsoimfymsmyfyfxfmkmmxiiyyppskxxyxvkkxpskyviypvipsyifkxokvxxxvvpmxmiospvkvivpyvysfyfvksyyoxsfkmikfspopypsskpkyfmoomoxvsyisyspvfmxopsysvpvxssfkfsoykikskksissffmysxmifkvspiokxvyvmmxpvyofosoivskmskkfpmkxfovpmksyfyykkksosssssffmxfoymsxxosvpmviikypsvfpxoxfkimppfxyyyipsmixysoxsyviviiiivfmspmpppioxpiopsisiyispxoyyisxpxixkxpsmvyispfmvxxssxpiyysosposymkxoisfspxiyovvyfspkppkxvkmxyikipvppvyopfmfykpomvsmmpymmxyiyvpyxpkvpfykmvipmxmpfispisffmipmyoyvvmkifvxxyxfvpiyvssimovookyopixivpiiixmfppvysvfikvymyipfvpyiofkmxivmmiskxmvoffoisvfykpkpsfvskofkosfkvokkpfkfxvkivpmsiosooikpypxfpsvkfvxxoifxfmkysixsffopoivfkifspfvmkxooipypxxismvmmvxfyifoivxyioxmoxxvxymsoyipmsvivkmokfsfykmkoyfmfkfxfxovsfimoxoofskksxfvpxmxofpiovvpisvvokxkyiifopfyooofpompmimsokkkkivvsoxvffkyiymovvixiivsxxokyoxvxyyvmypofyyksyvmyixyssksyksipiisxskpxipysoffmkpxioopkyxyykmiskiikmmosikpfypvyopoxkovmyypxososisssfxoxpiyoymvomxxiyfxkmsxvixkpfvmkfkxvfsisykiyfkxoymoofmxfyovpioifxxoopyfpfisxmifxmmkpmxkxvyfmfoomkokvmsyfxpvxkmyvoipypsxxysmmvfixxkposissiyvksvfmfkokomkosvpfiyyskmmpisyoyoimsvfiymvvsooxkpxsifsokfxiivkvsspkvkykypfopmsiyoxmifompykivfkvvsiopysffkimppffokfkvkfofpfkfyyssikkkxofpskpfpixyyxfmpivysvxiikyfpkifomokvvymxisxpypiipippkvvsvsomsipxxpksmovvxvxfviixkymmpooiossxpxfvxfvkmpofkmiipxfpkpivopkvsyimmovmspkymxspxymfmmmmpysofmxfyksvpmmspkisfffivvmivoxoosmymvxpkooykosfyxmikovspippikssvoiskmpsokyfyivoxfsymxiykkoymfmskxommmysyfipifoxksmfysypvfoifyixpoooxksvpkksxkpkkiifyoffmsmmvvmfmsmvokypxvxfvymsokisiyixofvvppipxmiypsxmpoomiommksfokpimxoooxyvimsxykvfimmsxvsofpiiioxxyomvyoyfxmxpxoyyiyxosvyyfkpxvyxvxyffmoivvykvmsoikkxokkykxxfmyvpsximovyxxpsymypixyokmiksiyixfypsixpkovyvoyivmyvyfyipvsovvixxmsxspyiksfpipyvfxfofoxmsksvskifivmfkvpyyxxvifksikpoosvxyypixsxppoxpiokskkixmooxpoxymkkifvpipioisskyyykiiympspmskfvpppyvsoyimkopkkkxxmkvfioyvipspkkyfvvsvmifykixpxsfsvsvoxmmfixixokffxvofxvsmpvfvmopyvpvmvvfsivpxpfpxovyfsovxixivfysspxsismmyysiipmfxivpkssxxykovffiviivksmvmxymppykpfyspxkfmfvvmssmmvymovpypksofosifoxmmxopskssoissopyopyomkfsoffiykfoyxypvkoosxkivmioffsxymikimipkmpmmpmyomfymivpfvfoomyxfmifsfsmkkiixoypvpvkmffsyymsikvpfxipxfxmmipyikifsvxfpxokmkxkksxoioikiyikkiioiopsmsmsmspipkisismkkssvsxpyvvfxyfykfoyioxkvxxivpxxospvsiikvkfpxfipyfovfixvxivsokompvxyxoyfokpfixxxfkfpysisxompksspskyviiokmmmisopmxmfmpmxikpvoypvvyvpmmoysvyomyfpkvpixpvkmykxfxmikskiokoyyooisyxspkpfyoimfvskvssmvvioosxpfymxmoyfvimxoimvoyssfpvysoofvpifxmsmmokyvsxifskspkyoyxsxviyvskmkvxypokpixpvyxomfofyfpvmvmyooikkmmykomoxfvfiiymyvkssvvkofxxvvmiixyvxxksxipfokvyykmmxmoiisksvvyfvxoovpxpkxvxsmoyiviisxpffvxoixxfvpsymfymxfosxyyokofkvsxfvokpisxopffmispsxvvmixopsmivmymppfixxvmkpsksospmifyopkiimmikkvmopissfvsxsykkvxpvpvykpkpspmiisiioyyvmmpxxofoykxvsyoksipmxmmpvofixkmxxfmpmiyyskxyoxiisokpvmmpfimfvvvisypffvoyoxpspxovofifioomskmpfxskofkyfmmmssskvyfokyspyyfskovyxkyfsisoivfomvovvvospmfmfmkvkyffvooykvvsffivpiovivkkvivfssxifopvissoismxppkxooyxkikyvyisoomkovvfvxvmmyyfisfimfpfpyomopmpixsvpykpyvosfimpkkokvoopyyxmxyxkmpxmmxsyxvivxxssimxfksivmmyokixfksspmfvfvppypvsiyvxvxvmpysskkvipymkpfixkfykxiiivkmkppvoffykfyoymxsosoossxfymsxokvfovymipoioyisfsvvokivmxsfmxfipppfopvsxiffpvoxisvisofximkiipkyoivsmxmimivfkfxkmfkimxiosxmysokyyosyksosvpvyyvfimspvkfomkxyipyyymypxvfoosskspskixpxkfsxyykkkypippvixpvmxkvpssmissopoxmxkvmvmoppmxkikfpyxkiviixsvxkmppovvxofmpvxffsfyskvxmpkokpfyivvoosovmffkvpiiysoismxvsvvyfvmimkvpmyyxivpksmmyiyspfmksovsvvkpfykmifxxpisivyixvfkpvyyfpkvvvvkyvmpxfimommxvfxppfsyxymkxfofvyfymxmxyyyvikivosfkofyvfvkofkoksfpopsmssskffsooyfyikvsvvpfiymfixxmkmmmikfmvfkfsxpiifoyivkpixxsxykkvfyxvsospmixpxsmvxmmyokyfpxvsxffvsmxixokskomfppsppkmvkpppivioioyospyimisyioyxpvisifmxmkpmovmypvyksvskssvffmpvfompxmmvsvsvooxoisyfivmkffymivfsypoifpymomvpiovoymsspxippkpykiivspfimypfyfpkkofmosmsvmivfiksxpoyiimofvvipkyxfmisxmofxfyspssxfmvsoxvpffssivvvifvivpxkopmivxxmxxsoppfvyookyvmpsypyksivksfyvxyppxmmpmfkfmomxxxvfkvmpyokkpysofvvymimooivkiimyispffofvfoxvomssfvmvosxvxffiyoxmpifvmyvvxiyssyvvipoikxmyxokmyysxfyxxiixsxyiyxymmsopkvssmmykvpmpmifxmxiivmmivvpkkkoosmkyimvospoimsffoxvikmsyiikmfpvsfkpsoyfmpxfvssipxykffpomyoykvmmxvysyosssyxvpxsovpksmompyyxfmpmoipppspikpxikppsixppypxpsvpposysfxyiymymyfvpokxxivkfppvxvippmxpkokfixsmymxyxmiopvpkvviysmkskpvxmopymyxoykppfmyimfpyivoimxsmsyvmppiyyvfxppkixipfpiiymyxsvofvyffyvokxsiovikiosmvxxmkxxpsmfvykkxyxpkomsiskffvyikpomfmoyxooykixxkmyovfsvoiypopvmvvoyfffoiysssfxikviyyokvifkxypppmofisoximfkyvpfsmyopsvyfimfyxymfmpoxxvsifvisysokyyompovsfmsiovfsvkvmmsxfpfkfovkkkopxopopoxkmvvpiyypyysvkpspfmvspmixikpisssmspfokpfpsxxfmmskmmfiymfoskimoopfiyxyxxvpmomokfpyvoxxyxyvxpyviofxpixxvpkoiosmypvfismxvfxypxmmfokksypyioxviyoopfyifkpvyiopyomixkssyomyfysfooxiiikkoyxmsviovvoyyymxsmkpypkiopyppoimmkkssyxpxpoxixxympvvkkppmkoimykmxiypomspiyfixksxkxxsoimxymxkpiysspiiofksmkvoifsiifsvomsfvkvofiivfmiiosyyiisxskosxpxspiivoxfvpksomyomxmvsvoisyoxsxivfkxvsomikpviyixmofxpomvysyoisoooofsiymkvvypsxxovopixkxpvykpxvvfsmyifiiyksksvxysiimofssxikyomxpiyopkmmoxffoxvpmxpsfyfioimsxmfykyxkfpskpfkvvvxkffxsvxmpikvpyovfvyfvmsvpmypvimsisyvopixyfkxyfxxisxmvsifyosyxxsvpxkssvyyvoimsppkmpxmsvmipiikiypixvxvkfpfypossmkvvosmpipxomixfipmpkoypyxoiysisxoofffoxvfypsvxivvkfsxskfxvvkyfkfifskfssofysfvpikmioyfokkoovksokxmvkvkixxmmpfkvopioyvmvkfsyxiysskffpsmkopfffikxympyxvmimmvkpmpspkkxskpmpykfvfxxiviivsvpssivkkfvyvxvimvvyipkyyofyoooysvpxvyxvvpmvxmoovffyxxmymvxmkvfpfppysookkymfipmffxiivyysvyxkvxysivmvooxppfivkoyxysofkkmvvyosvivksmkvvxkxymkikosfximyvokpmpxmvixvokvmkpkfisyppmviyposikpmvppspxvmipyyfsiffpmmxmkikfymyioipsofommmxypixypmvoykvivskpxppikfkyxfsfsxfimsfkiipvkiyxsiyyfkkmpssxfmimvsxffixisskmivffkooffooyfsvpikkoivpoksposimosfmkippsimovpxyfkvmxmppxpfyysxfksvmipvvykyskvkyffkvoyxvisvssyvxfpkmiviyyvpkimvofiisfyfpoosyxxfskmovxfisvfipypxmvfpikvpyffxkovxvkfvvvpvxkpxxokmskiikpfpfxvpvkmvkvkipofixmkffvipisykfiiompvysfoyvsoifsfmxkmxsyvysyoykpiompxiivkmpfpfoxkofoifsimkyfosvxvxpmmvysvopoyfovipfypxioioiysyxyisyyfosiyvxkvfxkkoiksisvpsoimvvxsfsmyyopmxsfyifsfivpoxksmmppovvovoovvkfsvpsimyixmoixfivfvopyyvvsyvoxiskovxkyofpikvipkikvvxvmvvkxkfvxyfosssffppmkykixyfpxxxkxsfxxsxvmyyksmyofikkofxompskkvvvyxxkpfvfkkvpmokxsysmsxkoykfxspxioxivypkooyoifispyymmvkkiokixovxomxsvmfspsfymsffoommisvpvksvkoyvmsykxikpvvvipkvkifkkoffopfifxmvoxsmifvpvykypfspkkomoospfkffxymfmyvppmxvmpyiokokpokpssipsmokookfkikykpifimyfvpxkvfxppkvoofyoooofyfymoxipisosopxksomsivyfxvxpppvpximmiysomxssfpyxisxvxosfvvxykiykfyxpsfssspkfomvommskfmfpyimopkfvysikpsoyikmksxfmxyoimmvsiysxvxooimpvsmmsvsooskfpkifmyvvfpfmppyypmmoivspxiooyvvykyfpkymvoffosvkiypsommsykpkksisvyyvxymkiyskmvvfoysyooskoyimokyifyikfxpsvkpiipovxpoxsiskofofppvpoyfffviykvopxyifvipppovpixixipompyikvmsfffsyspymkxyvmiofpyyosyvskffffvximkvmfmvkykifssssfxsiovxksyyvyifkxvksxspmmxmpfvokppyvyisvmyymxxkyffvoiososyysskyomykoxvvioxpmyokosyxpyvovmpsmmiyvfmmymymvfxoosmsfpokxfxskfkosmmpxmmsyxkovofioxmivvpxxipvimomyympksmxxvfvmoxmfmsiikvyvpkvikmxmxfpvxpfiovofopyisffisxvvskfvsmmvisvfmmikvivvkxfkvfsmmkmkxfmsiospivykoimxiiykiooipixmxxxixmkoimiiyovovfisxfoxvspymmovvvmvyosvfxipoffkvimxkykpivopppovvixmmipkfomppimsyopokfmvxioommmfoyoipsppoiyvypxvypopymvmikkmvxyomkvkvmfpompyfofikiofvipfysvpvkimkfpiyyspsxkfimxxofipsmsfvssfsfvikfmpoxmyippyfyovmomykxkimpkpxvsofosxkxkpsxpkvksyvfimvvipysiiisxpvmsipkmxypipifipyomxiipvymfksopksxfxpfkoommyyioypmivyvikfksypvyoyyopmpmfiviyfvyoxvpyookpykxvxvsypoifpsoxpmmxfoovfsvioksxoiksvpifskmfvvpmfmmviookxxfiiposmpkofypkpmofispxxxykvyymsyokfkvvfsmyvpmfpmkvivkxipioyisyoxkivyoyvkixmfxvsyskyxpimfsfkspopysxkyxfxvoxkssoxvfxikmyxkfmxkmppfkoksvmykvviopovmxifsoksyixsvvkmosvfomsspsfyxysykksxomsffmkpivpoyxifypkivfxspvfkkiypvvkmspopvvmoimyfvioxsfisppyspspxmpivvmvxsmpkpvkfvsisoimioovymxpxxyikimiosmvixsppxopsivkvkxkovokfvopmsxsxfpimkoivmfpvxokxpvmvyivpfmmkyssyimiksymyoxxspfvomvmvxioxopokvpspkypvkvymivipfmmiipmvvosvfmsmyvfifookxvfmfsxpvfsxfkxioppioiimypfipikvmyypsxipfmisimpsovvsmvixivisykfsmyipykkmxxmokimvkpxyvmfipospoiyvfipsovypmykkoikmifsmxvimiyimikfxykksoyooosvpixmpvofxffpivyfyimppxxoyyfxkypyspsykppovkxospyfvkiyvmymvxyvvkximxfivvofsooxoxmisvfspxsopopyvxfppmypoiiymvxiisvifovpfokvkxkvpifpfpyykkyvkpovkiyvfxvospxpypffsyvoxpvfsommvipvkokfkfffkpmioxskipmmyxpvoppoovffkkmiiyvspkvkifkkkvipkxpyxpmopxxvxxvxvkssvxmpmfmyiskxksmikmkvvfvfkfmxvypyvxyimpomyoysfpxfkiifmkkyfksoifxsooxxfiykkxvysymxoxykvivpfpmyppyfskkkyvkpvopopsoxoyoxofofmmkykvksyxfsvykkioifvkyxoifyvpxmyvsyyoookxsimsomvykmmpskfpfofkkkmxksxxppfvokssmsyyxpyvypyiovxpyivmoisvifffoppykmiyvxpvysxifxivyppsfxkxppyyfykymvivyiysfyivmopoyoxksikvvpioxkfsivoffmxvsppopikoosyfikmioxmfkskvkpkksfvkmopfivixfpspoxfksmpvximisvfyospmopyioopykxvfxkvxffmpkfvvsyffyvvkpoipxsxmfimvokfsxispkimpyskmooommixpixiovoxmvikpskviyospkvysyyyxvfokiovpkvixmvipfsfippvkfvvxvxkxopvkkkyoofkpiofifpvvkyvyivmyyipfyfkvvvkixixkkpkoyxxsspkoffsfxypfsxyoxmkpxomfixpkfvpyxxmkvyypykmkiikmxkksyvikmfofymfppofmsmiskiypoyiissmyskoyyvokksofifopximfppfpvxopvisfymoosfyskmivsioovopvipysvvvkpppivxkyiiivkiisskksivmfivoofkiksxxyvsykmxsikvoxvpksmfffmpppixxkpxxpxvsysyoipkoymyxvksffyviioiymvpkyfmpsssxvfvmiiiyfvyfofpoxfpoixypimpvysmxvysxsmsxivommopxvkmomvffvkyfsksximmpmpkykyfixkkpiifpyspfoxxypkvxxmfkovvofpsvikyxsxkfovskfymoyxvspfmvipvmvfkyyoxpvmyxyovmykovospvxxksoipvpxyxkoxipmvyisvyyfimpooivfmvpiyypypvyspkpipsoimskfkovkvmsspmpfoypspkfvyipkxmspxmpokxsysoxpsyvsxsyiyvpsviixiyyxsfmyvpiiykixmkoiskmoffvkmxxyikmmivxfpfvkyvpivvxmixiopmymsoppkykmvfipsxsmyxspxmvomxfkxiifvxmfifppkomvkxyiviskspxixfikpvvfvykvmmpykmskimkxsoiiopfsyvvmivmkkkkmpoisiooivkxxixkisoxxyvmikkkimyyimsoopoopmympvipookvpykmvoyofkppopsxyivopomikyximxvpofiyippmoyykmxiyfivfipxmxkfpifkmvxfypmyyommsyxymxxvxsvkisoysfifiokssxoxksspikxkixpokpyyfyiiyxxypxfkysfkfmmmmxssoifivxsysmyfmmxfivsyxivvxvoiyxkmissvxsfyspmvffvmpsiompokmpmoofkkovxsmyxpmkiipmomyfoypmkoskpmvksxomvypyxsxmvxymffyximykyoyffipkvxfkspvvviixiifpfisimksmfysykoyvomoofimfyvsfixxspfoifxmmxoovispiiovioiooyfyosmpkiysfykoxpmfvyxxyympovimxxoysxxvppxmsmyvsopsvovymivypksikspxiivpksovovmivmvpvikyxoyofpymxipxxpkximimooopovoymvkmmmoopyfsxovfosxvkkyvoipovxvmykmvipiisyovfpooppispmmmoiyyivvxmfsfpvfsoiyxxpsvkpxmmmfismvyfvfiisooxvsyixissviyisyioyisixpixkyvvokooffvoskyyosmsvyvxofkxoyxpfopxosfyxviyivfsvvofsymvpypyvfypofpsmiysmfpkixpykspifosfxpysvspfsyimsyvmsiisxpskosikoskxvfpspfvxxypxixvxpxpymvfvsiyssyyxkvysoxfkvxypmfvomikssfsvsppxpvoxvoppoosxffmkpxxikmvmsixkivssxoykoyvoffvyfffompxfksmpiyvoopismmpsovkfvoypkvmsspkifmskkposxkfsifvkkompyfkimkofxxmixxypxvskiyskfvkypmmxspsiyvxiskyfpfofmiyvfpimxsmiofymfkfkoymiikmsipvsypvkvpoyvosoxxkyoiomffxxkxfmxfppokxospkyiyfkifsvpfoosmpfmvfkopifosmixfxkxsmpfxsmvvksmvkpoxmyvvmfiffoxkxxxfxxpmpvmpokysvmkomxfxmpfmpximiopysopisypvmopskfyopoomxkmsymkfpopokmympfykkvskxppmykosisysmomoxfyisfikiypkvmiyfyokxxixoxyyosmpmyokpxoyspmipoofskiyxmfyvkxfpsyyxvmvimsyxivosokmsmmmoxifkisosypffmkmsmopyikyxmskmfpmpymioovfmkipxpxpfxmpoofmfookykvmkyixffvvvsoypypyvpypvxmmkikposiivvsmxskxyfspxkofispskmoioxsmmopyvosxymxspikxkfpmskooskikxmyvfkyfokmmoxppvfssfiksopismiyvkxviopppmvsxxsvyooivxmovsypfifmsxfkmpymmomkoxkoxyvixfivfyyfsixvxviokoovmpvyfsxyyxmssvmfiiomvsxmfofykkvofkofiopiksfmiixpsopxxvxmyopiimpyvokxkkmikovpxovpoyfyppixmmvpyysfmomimvvfsiyiyfvfyfofifmokxxskmifyxpivixokfyfyvomosfmfpommpoovoyffoykvissyxxivpisipvmsoxksfivkoivyfmposfovxkxmpsoksfkofimikvmvpyfmpvmivovyipmkkxoomskksixoyskyoiifkfvvvsvfoxmppoffmxfypifmyikokxvmyyoooimpkfmxokkkxfiopvmspvisippxppmopixykospxkmmxkifsvxpymsifmofkfssfmpikykviixfssxfpkpfkoxpyoskfovsossifmikfoxmkpfifsxovyyioivsspvxkfyioifopxmmsofispiiooxfxsmymssymissvssyypmmpykvkofkoyvpsfpvpsvifpyoipioksofppksipsofxfyxpsvsfymxfoxkyyskmfomosmvixisykmfopvvyxipppfokymsmimxpoxfixvffsmkssssipykkopkpokfxsoixpkyyffspfvmoyspxkmvxsiovxyifxkoivmsmixkpipooiypkkfifkymxyssxkvfxfokkxpkxmoxspsvissypmfiomvsyofyfvsmvpmfskmxskipmipfkyvsxpmvfxkmvvixvxmsksppskmkfkmvxvipfxxkkxoksyovsvmpisxipxmmvxfvpmiypfmxoifkvmosfmpyvxfviixxyyfimxsopsyvsvoikyipssoipmmffsmmpfkkposkfivkfxfkkssvofviosvopvffsfkvopxfvypxiyvxfvypkokmmysfvykokpxyimxfofokkykmmssxvmxkxmomfimmppypypfpsivvvypppmoisovxfymkmfipmvksyxpvosvmiyspixiyyvmosoppfsvmvsfmmvsmxvksxmsmpiviyxmmixsyxyxxvopmiioyxxpvyikfpsxoysmmsxfypxivofmympxpmmvxivmmxoifpssfkmofmysmpyypkmmkfmooiyymmxkksvovvykppxxmsmysyxsfixmmoovmivmvyksysyxvxfkyoxoopyssyippmmvyoxoyssvsoxxysfoxosikpxpymsposovxxvxmppkkkykkxxmoxvyspiofoxpmpysomssfpmovskfmxpvvmkfmxpfvykkxkikkspkfffimvvxxvypvvxompvyixoxkvsxfmxpxfxkkymokofykiyfofxokfkxymkoxooskkmvpmkpkmikopxoyvovvyiyxfivpivmmpmpfsioxoivsxiosoksfoxmyxfopvxipfkfmosiyvyffyykkpskososvsfimximvymiyipvvsyiooykykkkiimxipsykymkomkyvpspxokfsspysmmvoxpvoffyvimopmsfiyksvfyxmxvvsffyvifxipifkifokfvsoxykfsviovsyfkksfoxvpissypoppffkipypmskyyoisxmpyskmpypyiivvpvvviimkiooskiokoivmimkpxskxposmpovffyopokfkfpfvpsmfkvxiokivmmoksvppoikviovymxpxoikoipfmososvfiikisfvvxkmxoikiosyfmvovpoxsvfviskmmvixoyvsiiimmmfpsxysyvmxyisfpmsxmkfsxykfoofxoymvfpkpsvmxixykmvmxfkxfsoiiixsykmpismkxsmxpkmoosxovmofxxsyxxskkpymssyymmovvmkffspvviiviskkssyoykoiiiskpvvfpopmmspfkkmypspfmpffvikikfxyimxfvysppsxipsfpmksspfpsxsoiykxmiioikpvoppmyfskxmksokpyskiiiyvspsxmfofipiviyvkkyosffspivvffifxfsskkxkffvoopxpkfpofmxkyovvoyyvmomyffopximfoksykxfkokookkyiimxksmxffsyxsfpmkyoyyfmipmpvkfmkvkyfmksmsxkfmmfivmmpsxsfkpvfskpyoisfyxfvxspkkvkfpxymfpkpyxmvffiipisosvxskkfvfxyskkpfivkxfvympissyiooymyxyokvikixmkoikksoiixpkyvkfiooxfxsmmvmmyyxofypxskoffksmixxyxfsmkokoooofmivmxofxsivysvifpiioosmxikvkksvxsfmoffffyfkmvvfsofpvmpimvkyskvfvyiyofkfvixkvivfmmyifkmffkofmvmkyomfpysfpfvisvvvpysomkyvyoyxfkpmipyyiyipkxisssmsmfooyikpmfyxykoyvyvkxmkvsipoppixpppvpimipfvvoxfsmmsppvkivvmmmpximkkixpfpsvivmykspfmyfiixypifkopifmomisfxfompixfmkoipyyypykysvossskoovpoffivxkoxxymypvkvkiyvssxvxsomkvxvimvsyvoskksmxvkyypimfkofisioifoyfvpfkvofkiviifvmkmoxopsfymsmisoxsiyvxfymvsxssvxoxvykxvpikpifpxpksvipxoxffkvmxkpkokmpkspkfsoofiiyoosissskosmfkyokvoixfyffmffikfkpvsispxkviyoxosfkivkoofoiyyxmsyfkffpfvmmxpyssvosixvvpoipksksfkmpmkfxispvookppxpxsfmmsioyxokopoxxsivykvoxikpyxyismmxxmvpvvkpyfofppyxvyikiixvfyvykxokmxmppvpxspysiyvopopixiofxvoikiyikkkioooyymivyxmfpvpommmkivpofkfvikxkvxovkfspymxkpxkxyvxsyomvvfkiofpmsxxisvokpvvxoipysmysxmmppxmyvpykmsyofffvxsmxpyvmoykximyvkymkoyoxvyxsxppsooifsvkyfvspmvoxkyyioximyikimyooxpxvoxvkmxxxpysoyfiiymixmioyksooovkxvfoofsivymppvivpisfmyyvymkkiyfskkfkpmxxiyfvymisvvkxvvyisyykxppssopkikiovkysvompoyxoimvykmomvykfkooyxofvkskkkkfxfffopkipkxpvkiovvixvkvommpkpxsvkmpxsmvvxxmoxxsyxfvfmmkmvmipikfpkmpksfxyyxsiospoimxpkpymvxpvsvsioffofyfiyfffopvmsmkkmypyosvipsvsysfmfopixsiiviykkxsospxsoxsmssookvopkyvyfkmvxkkxsofisposxovikviyoooyfoxxxvipoiomffpmkiofxsmyfisxmvvvimkmmimokfpvsyosvvvoykkkmkvspopsxkpioxvoxoifmmofmoofpykpxfixfpvvmxyssfiiksxmmsxppvvkkvspssyxvifoopifkoxfikivksfxxxkyimkfokpisysppfvyfoxmfimoxvimoykiykymfkpvfomyxxypxviksiyvofixspkompiopyfpxisisssimmppfioivovmspkiimyyfpmxsmvkkmpvvpxxiyikmvmpvfsmmoosoyifooyxxkyixfsvysivfipvvmxfmvkvpfpxffxkyfoyoyyssfyvfsvoskypykvfkpxmosfxkikkmoifysvpvxxfkmmipyioofmfoxpyofosioixikyokspomxxvpifkxfxyymoiksyfximovmsmxvfoyoxvxysmxkvmivooiimmvkvmfspikxyyoifxokpyopkiiskkvyimisiyvspvpovkxpvsvmpmofpfvososfpsioxioyipsoxmvfxopkvmvfmmvvyskxvkfxvfkpokvompxikfsvffxpfxopvokyfmmyissmokxmvxypskfskxmsyfkkyvvxsooskspofioxskopivfoxsxiismpfixpxmssokpiofpoovffmfxyiyysiosxfkfiomxsosssximmxsmmvipivmifkxsofpxpvxpyxovspmixomkmvkisvyfvfpxkfyppyfpiovmvipkismkvfvvixvmsxmpxopsysyoffiimyvxpmipxyxikmokpkvioxmkyxyokiiiiyvsymviykiyopppiokmfkpfmvssfkovfymxsxypvsmixxpksfmxvmfvkvykfopokmfyvovfkioysimyxsmykvimvmomvkysmkyykopyskyysmmypvyyyoyfvxvpxovssvpfxvosvoyomkimovoisppvmivivxymfkvyxpiofkyffysoiosymvissfxpykvffkfkkkfifkkoipomkpvvpfokvmpyixvfxpyxyxsoxiffskixixykvksfpiiisiyipppxomiiisvvosofsvymyfyxkpmfxooxfkifxxmxxopoymomkyyiokxoxoxfpimopvkikoomomykfoimxkxfxpkoxkofkyvvmomfyoopmivyvxsxxpmmskikosippoimvffsyfmmvyfvfvpiikpvoyoypykmofmvioofsvmvfkspyfxvymsfkypfivkmssimppxkxoiompmmixoixxfyxppipyyxoymxspskopioxsyovfiyvypxofxsvpvivysisyxsfoxmkffsfxxkopypxokpykipyvmxiomifoofsiymikyyssoxsoxmsivxymxysxxyppfkyvsspmypossmyvpfykyypxksfkfsixffoxxvokkosmvoofyfmkiviypvomoiiooofvifiixvxviosfyoxsymopfxoymmsxifsvypymiksyvsmmypmoompfyxiiikvpsxsxmfxxosmioxokpxmkofsopfmyiokivvkvmiikmvivipsmxkixfmykoyxyspfypvooyifksivmixiipsfvkopspmoifyvkfxxfmxosvkxkkkpvsmpmxvsxipxvykkipikpkskovmvpyoskkxmsxivspfipoxpvyxofookvyfkpssmyksfpkmxvxmyxviyifyfvyykimpkpoxipkvosysfkimpopmxsmosmyvfykxisxyyioyiyyvkxsvipfoxypmfxiimpspymoomvoyxfvvvkofyoskopkxykfspymyiikfkpvxsxmspfypmiopmyvmppvofmfsvkposfkmpxosfmksipipmikkxmoyfyxsosofkimimxpkvfokmfyikvmkfkkpmssifmpmyyoykfxxyxxsiifvkffsikfypooimvvfoxyiossxxxmmymkyoospiysfsvovxvyvyxooppvpspokxkxfmvfymofvvfmyfyfmxkifovfkxsyxooyoxvvykksiifvsvypvkofyosfyiofxkofopkffyoikssypxmpkfsxxioksmfvyfimyvopisxvfiokypvpskoyixkssfvxysyfkvivoykommyyymkipxxvkoyiyisxkoxvkpfkmsmfmvvxkoyikfsmvxpvvysffyoyxpkoyiyffvvsxoifkxxksfsxpofkysffokokspposfkpkfkvimfpixksokimyxomsvykoiipoopfvffsokxiyxxspfiyyfpxksmkkokxfpyypmfivxpvmxymipoomkippkxyoyxvpmyovoikxyisyiikpssmmykykfsfyvfokkypsmiskxvyxipmxpkxixyoosmppkyfxpfyxovspysxmspkkiyxvyfyxymmxmpyvfiifxsifoovssoivxpisfifmpofkixokvxvkkxoxokiskvskvmsyssmokxfxosppovomkvsmpoifkfskpfoyfipxmksskxksoyxspipfsyyipkvfyksksoyxvvspisoosypmykokyfxvikyvsxoxsyspymmoifvfimxivmxksyfifvkikvoxpomivmokspvixvvyssmxoxosmvxkspyixpmyvfxsyxkikyskpksfmkvysvisfpovyfmsyvpyvkpkovpovippxfmiiviyxpymxksvokkifsxyiikxfipkmmyovpkyfosivmooysyopmmxiymsxofymfoxxssfsviyxkfsmpifksxfimipfsokykivxpifokspxoysxfkfissysfmifsivfovkmvpvffxffppipsfmfkkpixxffisokvmvpfmmikospiypfvsxxkxxmofsoyvvmpopmsppvpkykpyopmisimyxmxfsvfvkpmskpxxvokfvyxksoiipffffpivfyfxspsxismpookfsvppsiimvmivskxpyyxofkkykspkxkpykpmxpyxfkokimpksyvxxsoyppyyismvsippksypmfpoyofpivsypmsfkooxkfvoyopyfxvymviovspoxovkvommfvxfivomvyxivsivpsvoxopivyosxmypspsoxmvpvmxopomxifmvikixoifsvkpxiopiykioxppyixkxxpoysvmvsoyofmsymmxpmookfxxxxskymiimixskfpmyspxkfviosioiopvivokmyxfiyvvixypyioxppfkxyvyyiikxiipvkkxoikvfpvopmimiixsooipfmyiifykmkopyymvsvyimofkkkkofkymfpyiyixvypsvkopkmfmosmmkvmsiofixvpypyffooxvxvmvfsovvimkfxfoiksxykksfoxvxksyyfviixksvpxmviysvopmixikyyvvkykyxopopiisissypipvykmoxxyssvsmkyyxyokksfkfpmfipmmifpsmfmoyooipkmxkssfofysffsimpvxixvxvxpvpkxfsyofvfssxfpokmmfsosksfmoifpopyiipivmosmmsikxvvkkosmxxfpviofxiypsxsyfimmfyyvipfksispvympmpfyiypkofkkoofvyxfpkisxmfpmysksooipymxioxxkiyoksxsokxpvyiikyikfsffvyykkyvkospxskxksyvfyvvvxipssyosspvvvysiixsppxvkikkppmmspvymmmxxffpypfkivokvvifofvokyyofkspikskvixkossmopysxfofoxxvxpyvsikyyfvpmopyskkoyvyvfvpyooppmvsxivsvkkvivsipxkkfsxppxsxxxkkfyvffpmxspxskypmipoxvokmpxospoymfppkoxpkpmfppssfmkixffoopkipssfsiviivsvxpxssssssimkssiyvfxxsviksopsikyyixsvyvysxmoxmmyfkmixixpmkfsmfiyovmovyioffkyiyiifsiiyixikivovsoimffxymkoxpyxfkfppsysiyyimfkyxkpkyfxvomfkksimpxyivsfsykfmxpmyixyfovosvvxxviyxikxfsmmfiyvsxxykifkfyvmxsymokiisyymyyivppkvovmysfyvpmoiopkoffmvyiyffkmvpssyfifxsxokvofxfimppmfvvkkmoxkmvkyixossyyomfmyxkpiskvsspsovyfmkpmkymfxvkoxsvxvvspipmxyosykpyoivomvkomypmymmmsfxpvmvivsyxfsxkkkiximovkfsfpkssmfxopxfykpsfpiokoifskvsfippfffmmxxfofyxkyvpfkmysmyfvpfppkxvsfokpimpxypvmkokvymxixvvpmkxsiyksokpfooxspvmomppkoyvmfpfomsvkppkiyyfkfxskyyiovpfxopxpxfysopymspoxmimoxkpvimfmypyyvxoyfyooimovyspkfkyokfiykiymoypxymikysvofymsfffofvkyomipsissmssvvpxpsviosyfmsoommkpokmovmkfxxpvyivpkifyxvoipsxsfosyiofvfiiikyvvvoiovvfxkxsxkskiopoxmsfpypyvssmkspyfivisommovfovifpfkiympxsfovoofyfmxfxmsikvkmyvfvkyxvxovmovvpimyixsiskoomsvykymipyoxyyxkvsimkxkmmoppvffspiffspxmoisffsvvkkxkpfomoyyokfppoimfispkosvmffmmypmisksomffoxysifokpipkoiosvssyssopvvsxiikyiipopfyykxsxisxsfovoxyyyxkymkimofomoyfyxxvyfpxiiykxvfxvopssiskimpmsiipkvixyomkivsvykfsfsvpmkxppxffppfpvovpfpopoyiyfskmyxkyfvpppmifxoompiksiixfpfpxpmxsxopkmpmsyyyyovxsooiiypksyopmfxmffmpyokkomkipykipxkkfkffffoimvxykkyioifkvixkffmkyxppixxxxmokxssioiiymsmopfmykxpppxviyyyxymkovspksfymoofkpopviiioofyvpoifiosxsxpkxfipvoyoymkoviiyiixyiffyviiyiomvkposopyfkxvxsmovsmsvsvsomfvvmvvspmvppkvoysyoipsyopkxvxfxkkimkpioyypxpiovfmypoxffxfyoivsykypmixkyxmxvykxpkpvxfmpkspmoykmikofvkxkmvmisymfpfyiioyviiimymfokimsvympvpskivosyivspxifyppysxpfifkyfysmvmmsoivxoixymovfpyxskxmikxpoofskxpxvvvpxykopskmkmmspkvxyyixvvfimkopyiokymyyisokffvksoxximofpkofymomyspifxyykyovmiyvsmkvyymxxkpopkyyvmfiioxipkokofoksxmfomfomssxvspfifmvfiyisfvkxxvyfvpppmvkivmsmifmpspvmfmsiopypimpoxpyvifxiiffikxmmfoksmoyxyfpxompkvksipppmixxokpsfomimvififiyvksyvipfxpmossymmmpkfopssyivimopsmvoisoifxpfkiviksvofsymyiysyvismxpfookpfymmvfyfvkvmomvsmmkfoikifysyoofovmovovvofmspxofxkosfiiymyfkkkvomvykkoyxpviokppxvxkyxfsmvsfixyfsxsvyiypixfyyssoiifxxipfomyfmvysfppfifyvosmvfvxypmxsyvmkxsokxvxiyfmssikxvfksksvxxivxiyyyfffsfsyippifpvopfikymimpoysspoispsmviyffmiyyfssfppoixmfvxfiykmoyoyfkkxvvfkfkkskismfssmpivmvmivkkyskxmpkpkovsmmmikpoixxpimvoymykfsoopxvpivykommxfoyismikixpvsopfxvkvxopopkfoivoxxkmpxokxovssffvyxiomxppvyviximmsipfxsoiyiokmvpivpmkisyoyismikkkmoymxmsyyixxmmkmoovpompkmsvksyvxvfikovvpksoivmkfkffiyfpxpovxxkimiovkxfpxmomkppiippisiixkmmyfimssmvpfopkkvisifkopiyfoymksmpkxipkfvxsoixixisvpopmoxvfxsifpfivoxmpxpkmpixxpvfsosxkxmxymkvfovivivfkkiifspkmiovvxfovkksssfvyskkpvkoisosvxpykiixiypppvvpifkxokpsooskmpkfmxikvooyxvxkiixysfyxkivfimpskmfkpyxkifispssfomifmxpxfyppixvfffmvikisovkovpyfivyixiiiimyskvsppvikvmyxiyvmfpoiofoomvsmkpomxxmmfmixxysiymoskskfxmmsfmsykvmmkxsixmmxyoxypvvysvssokxmypymsvkosposxyfvkmfxvoyvfpoymopmfyfxmxosssfmskxxpvxsfokmssopovvypimsxvxvspoxpyfyospmsipmkkioossyxkkmxxoosmfxsfivxivvosoixvmpkkkmmspimpvvmvyoopfkoyoysppxmmvsioyisvxpypooxypifpixxvxvmkvmyspyiokyfimxfypmkokmpompypmyxpmypmsmxkvmfiioimymssyxivkkpoixkmypkifiomvspxmyppimpvmykviissyoofkofikosfofssossysvkypopipommfpsfsovmiooysyksmvvpspvvkpvmyfisfpimsmpykopsfpyvvxvpoyxxokoffpyoivxvvyxyvppsifmymoomkmipspfkpfsksfvykmopmxkfoyvyskskmypyxfipxoivkivxyoiyooksmkxxmxmvvkxiskfoyfspkmmpmoyovfxfsxosypvpffyisxfsssfooosxisykmoyxifpivkpiffmfyfssvsmiyopmvvimkofipsxokvyvvpikiymkmxssysyvvpxyimkmkpooosomoykffipsiofymvkxvppxpxopfykkspoosxyisxmmpvmoxofkfssyvpyivxpfvpypkikokxiympyfkiiyfkkovpopvyvmmfvfisfpiymokssmpmisyfokyfovxikypsopvyvokxkovkfvxoypxviomyfovxpoysmmvpykpoyospiyxvxppxkxmkoyymsffosfkppmvfiskiypmfvvmfkspmvxxmofmoisykxsmvoiiiisxmkxsmviymyiyovvokysmyfiomfxxxiiixsspiikomimskpxpkomkvskmmkomixivxiivxxfpiofvspyokmyxofsxpvkkvmmofivvikmfkkpsyoximkkkvifxkpovpopviixffyxivypfopppiovifpvxsvikmpsxfpvppsxskxfvspxfmysiisyvfmpoxfykvoovkpxpfospxxikpmpopikxpmfxxvovofyviokixsixmypmkskvpkxoixopmxivofkkxkxpvixixvippfoffpkxpkxkovkmkmpismpivykvkiykisopposppspkyopkkippkooyfifmvyvypvfiyysokkivfxvsxsxpmkvfoimskyokvppskkvoxmpompofsvosyxvpfkvmsivmifvsxvxpppysisvyksxkosmfixfsffoxviymspmomipvpfpypiofofoiskoyfsfyikymxmkoxyxmpokyvyioikvpmvxfmyvfpfvxxspssiovoyoixskiipvppykymxfxoxskskyypvvmsmpsmooyvfmkvkmmpmsiksimkpxmspiffvkpvvpysiikvyksxkkpvoikvxkfmxyippsxifviyyomsoivkpvkxsmykfyyoovvyvkimmpvofkpykpfmiosixkxkikyxxoksofmpvsyxfkvfxossxsymxxssfvskxyifyosvfvfsvioxpfixvoyxpsmvisskvpisipfkoiimsmyimxsvyiyiimksfkysvxovyiioypypikoyooisiyxoisvifvxsokoyiiypoivomvkkkippmoxyovkifykvvkfyipsivffvyvpsimfsxvvvoymvmkpoisssxfifkxoovivspmxpyimxxypxokfxfvifpysokpoxxkiipxvxxsfpkmkivpskivyypxmvokmvsfvxxvisfkofmmopsiymipmosimpvmpfmxykkxkviyssxpopxxioiksyfisomspsmyikfyssvxyyoifpkisikxmysovxkxmxospyivomosmyypxykxiomyxxxpivsvfomykpookifkmvipimokvyokovokooyvspisokipfxmoxxsvfiioxvvvyiyfspyymvsxmfikspxfvyoyfmvmivkfmiipffpxomvxfioiffxoppfvvyfvpyvfvmfxkiyyviosmvvoixmvykykmyoiymfokviiosyskkfkpypppfpvfxfifkvofvmoyxkppvsvfkmipofxssxokfxssyxvpmxxyxyiifivfiyfmpoykxiokxfsymfoxsopipkpfssfvsipppymkyxvisfosvskyfmxskxiofkfvimpykpsfxsssxfokixvvmimovpxxsfyfsfkpsyoxpspooyxossvvisfsmfkikvskoysfskpmfvmoxvyxxifmvkfpkkskfvpokkpymmxovoivyofsxfmfopfmyoovpkyxxpykkpsospoyxpvmpkooiyyspmyfpysmyvmsmxpssxmsvmsyspmmvimfosykimmiyvkxfixvvyxysffsfvikmvyxoiioikmkpixxxkiyiikimmmvysxvmomivokvymiymvopppypsxoifyofspspismsosfixsksivioiixvkvfoivkioompsyfospyfxsvvkipfmoxyvvyysisisxxikmmsvvvfosxkvkyyysmixkvxkvvkfymosvmvvfomoxkvfpfiyoomsompmioyvvpsksoyxsossiypsyvxvsxosskxsikofiyskvmimmoxsfmysvpmmkkfvsyssykmkosipokmsfkivipkyypxmpvpokxkmyyyiomkkxmmkfiomvkovvvyvkoispvikkffvpyvmymymyfoyyfkkixioppyykpyyxymkfyvmmvfomkxsokvmyxmfypovkxxsymiiypvoksiixsopyxkvyxppspkxyimkskixxvspifpikvpvvpsopskxivssxpkosismoxyfiyvyipyofokiiosxsfoxopyfpvxyvpisokfokixipkixvsssiysvmomfisppxmvsfiipiyxovovspoxmookykpsmyivsvyfxomkfxfookpppmokmpfovopmkvyokmyiffkfyommsimifkvkykfpoosfopfxxyppypiyxfokkipkpixfxyvkmiyfxspmyiypsmpxxospspxvopsyimxofpxokpvvkxykpxvvfvsyyofoiykxvkksmsfsyxffisxopxxvxxipysokyovssviivyfkxsxopixmsfovmsppsoovovmvypsvmxsxsfmpkpsivkxxxxkovmimffxxypmoiommimvsfooxixmvpifmpyvfpppmxkoyspxmomyvopsmokpimxviomsyviipmikioiksvkkkmyffmsyxpoyofxpoomivipiysosysvmisffvyoykoxxxkxfmmsiovxpixsopspfiyykfvimppvmmsovkfxismppfyvpspiiiompmkivoiioxvyfxxossixsisppoofiiymxyppyookomxfospkofypkxvxooofyvvkksimsoiviomomxpmxsyoxkyvpxyxypkompykxymvxmvsxsfpvxkymkiyispifsismkvfyfykfomxisopoifksiiixkmxkvimmompoissivofspvvixopxpvkypypfoxiviosykvomxssyvssxksvmfvmofxvoysfsypxpmpifykfsisxxmopvvpkxkpiimxoopfmxfkykopkvxmmofifpyxivvoksmmfsvfsomvoyfifsffyffkomfxyxioovovsopsixxvoofypmyosimkopfpxvookyfpmsmmsyiomxyovsyposmiyiyyspkikyksfvvmoyyfmsxsyymmvxpxoviifppfxxfkooypvixppkpfyxsxmxviimkfvxkyyksifkpxpyspkmokikkoxmyxvpsfxmvfsvsxksfopokffvkixofispsoypfyiioymfxxsmfkoxossppmsxsifpvpxvkmfpvppfpxippvyypyfykspspsysxmppmvoixypxkiymvffvoymixmxxpmvomoosfvsyopmfxiympoikmfpfvvkypyokxkppiymxoysskxyippmioysmpiioyxxkopikommfkxkyoxsysvoomviypmisvixsfxppyxskfymsiispsiskkmxvsyyypyspyysofyfimvixiiiopmfpsyovfmiifofyfyyfsooxifmiypyxoomfmkpsxovpyosxmffykpmmmkmpkyvyxkfomvopfipfiipyomosfmyvvimpmimxkyoffmfsiovkpsoffxyoffssxpfokfvkximpyivvfpokpmpkmkpfokfommvsvixypfyymsykympxyyfkoypmomfixviovfvokoxsyyfksosyfpiipfpmvmfxxofxkokiopopxkpysvsxxxoopkxssipfkxoookxyppopofifkiiivmomvfkoiyipxmpviyoxfmimoxfffyiiyssxpxxkyyspkpfvfopvofkmpivkfxfovvspimoxyfoofpmfpmvixvfikoifmfppxpkiyfimmfokxykpmvvikxiixmosopvixfxvxmkimivssxpkkkoxmixvpkxpskfmkysmskoosffofofvvxkmxiimvmykpfvyompsovppvxxvmyyosfvmxmsxymvkoimvxmofximpxokioixfmvppmpxppoxxixskipifvfkyyossxfyvspfkkpmkvivsomipymsypvfvvivsyxysyvsfmomfxixsyxxkmsvskvopomvvymixyxiiipiiysxvfvoyxmiopxkfsmysvxofvykmmivopoisixsfmpskmxymxioyvfovomkmippvxmypfffvsfyvxyymfsofskfyipxmpxfsiymxpyyiksospoksmmokymifksyxyipssxsksxixfokmxxvfxoyfvixfvxvxovkkmfossixxyypofmpvpkvovmfiivokvviiyvosmosomkyvkyvyxiyomvpkpvskvyofkskvpikympxmyopmkvsikfoksosppymkmppfipxfsmpmipyivfyoovfkykxxokivmxvxvoimxoxixmopmyyfimsfvssisvxspoyikmooxmipfvpxvfpikpikkkpkxyymmxmmsvkmopoikiomxfomosxsypykssvsoyiiskpiyykpvsfimikyfiookmfsxyfxoymvvopvsspkskyiypmsisffymxspfmppiffsxmmxsyviyfmfpofvvxxsykiovffkyfmsmosikxpioopofmspmxffoysfxooimkssfxfiofxoyysffmvofmypxpyffxxkyyvyfisyxmsiopvmkikksskppipykifffvksyikmokovspkmxpvoypmssoiyyssyipvfsvffvfookkimmkpvfxofomioxpfvfmoyospimfsxxmpxpssxiyvvypioikxsfssyvisxxxmypkxpovsykisvymfiykifmyvoykvpvpkipvifkoysxfxmksivposfxvmpommimkfkikfkfvimffvkkvfypfovkfsxkpxkksoikyoymfsospmssiixkkspsmfykmkofpvppyfmkpvkikxiofpmommkkyyxvfyippffvyvfmkimispifvmvvyxsvmvkkxmmvmspsymssfmmspssspvsyssxyyyyvxiiomsmxsxoysykpffmovkxxfskpkxsosovoskpkopiokisoppoiyoxvxppkosvpkxpykkkmsfspixkmoiyoixipxoyiomksmvyxymoxksikpxfsypxsxkfioiisiskfokxxskpfpfommymvoyopspomxfxpmvxysypppyyyiofksofiysxkxvymysxfmoiixmpsvivikovmvvvssiypyxvpmyokpvmfppoyfmkxkyxoxpxsispxxffmooyvyyvyofskfpfifkiymskxxyosyxkiimxvsxxsvyyomikopfypivspmsyffpyvifxffvxxfykimmpfmsfisokoivmsismskpsmfffsiifyiiixiipippkyosmxppyxfxmkvxofxymvmvpfykifffsisypokvmskspyyfovxixvkyofifxyxsmyskivissiskfvsifmpxvpmixiofsmmkvsovvyxfpkyoivyvvpykkkfoosoxspsvyoxkxpxfyfmovyvkkspsvxsivyvskomoixiffxissvxviyifkiykysmskfomopyoxyfmxskisysmiokmpifoxmmvyxvpxixmfosovmfooosiykpmpoypxyiopvixmoysikvxpkmvskkfixffsofoxpykkvikkxppoksvfyxviksmsmmmpkysxsivkxikoovypypsixvkipkkiykixmysskvvxkoyfxxmovoyoxsyfxfofofvimvppsvfsfykypfkkpfxfpokmkoioxpoipfxfsyxsiskypkxsfiisomsmsioofoipoyxpxyxofiosoixipoiykivkvimmmymyfikxxmokvxvikvmsosokoyovykisvpvosvovsfxvppyxpoxpkfpskkvykmspipxpfoykykoikovosyxiiyipxkpvfpyyioismyxkkxoksyfioxmioyxvkyioxmpxfmpiivyssmskmipovmiyfvmyfkkppkoyxyvpvfyfskxskypykyffppspyvyovvimoxkxomypppvysvspioimxxyopioipspmpfkfvmxmpoiixoffyxpkfkxoksvxsvfypmfskymsysfxofppikixkksmiffoxvkiifvsixmyyffvpysmifpxpyfssofvvyvfvvmyiyvifomfkyiivpoioixomyopmmpfsppfymxyoxpyfymkkpyyfxpxkymvkiipiykixmkpfopksivkvysvfmxsvfxmkspvysfxkymxypkfypskkyyvppyxsoxsxoipsspksyiiyikixmsikpvyxsssxvofxpyofoppofmxxoikkkpsyxmvxffvopkokkmifkspkmfkyomxyxsiypsykyismmmpoioymyfxvksiyfoxpiofixfvyoypxxyfixmympfmxxmipommyosoxksmksxskmxfpyokyxooimiofmskyiiyooxvvfvivfxypfkmmpivikookipyviypfpovmiyppovosixoymmifyxvipkfkkpikyxvpfvvfofipmisoipkiypssyxomxpppiyokokxmsfifvivikoyxoomsyvoopffomivvmpfxfpxmxmfyvxpvfsimpomimvkyyipxmkpvofsvifxksmiipfmxvsvfykfpvpykvkspipopooskifsfmmmkyyxikkymxpmffkyppsomvkfsopfvokvmssoykmkioffmkmvsossxivposyyxpfkkixoppxovixxpoxooypfkfvxspsykxvpvkfvfpfipyopxvpkivyfsfsssmkfsxvvfffykfmxoviopkpomksvkoyyxvkfkkkkyfoskioskfxsvkfpvffxkikkxvsxkpixyoomxfioypmkmxsyofipxssyssmfkmixmpsfmkvfisfymmvxofmfxxyifvvykiixmvimvppxfvfpvkmpxfsyfpofympsykisooosippoppimfipxkmkoyxvxvikpffxxvyyyikpofykkksmssxkimofoofsmmskppsmmmipposskmyovopypyyxooyovixvvkfokksififssyxfyyxoksvkvkiiyimppifpffyimiypixixvypmipvkfkkmoxypmpyxxmmviyxissypmkooxoofmoimmvfyxooymviomokiimpioksxopikskyysmkkvvmvmxivfmviimifxmfkmpmxkvmkixsiviykfmymokxvpxsmyikifxivxyfsvossfxsikykkpvvvkkxpmxkyvmsvimovkyioypxkfvpkkyvopspmmvfpvkfmmmixykofosspyiffvpxompmysoyyxxifysvppsvxmfffsvyfskkvpkxomkmymsokyfmkoyfkffmmvmfiykvxsmfkpykfkxvskffvypiyioopmfkvfkpfsviopsypsfvpkfmifpvypompssoimfxmovskxiipkxkfxpokokxspvksxsipofskypmmmyymkmxvyvvssvomsymxikkmkfvfiiyvopmffkpvmpyfkkpisvfvmyoxmpxixvxposxssxivpkfvfvpoyffxysmkfosxkkyyysoviifffvvomopfxmsvfxkiyxiikovspmyooovimxppvyxxyfspmosfoixkpvmmivsvxfivvkipoxkfymosxpfpykooffsxfsmiyxopfpvokxmfpifkxoifxfikssvfyivfxsffomxkxopxyyipvfppvssvvipymvxfxyofsoyfoiypifvfpxiofsvyfiommpkspsvxofvivfxsmsmfvpsofyxssxmikypmpkfsmvomsokpikifkxsofyppoxkvovxfvskxmkiivvksfysifmiskspfxiifvfokfokpkypivvyvopvsmimoxyffookkvxyooimiofopvivspxvvkpssyikmmxfooykisoxkvmipvkpxsxpmmppisfkxsikxspimkyosskioifpmximpfkifmxopmipfpvpksxxmyvmfmffoivmipsyxfyfmsxsoxfoifxipsoyysoffkkkppivfmopkkyymvimpfpiviipvyssyfpkooxxxxsixoxvovikvxyxvyfsopymkppoyfoypoxmoxkoimkxskmxsfmmipyyfiomspkskvfiooioipysksxikfpxiopxxviskkiffpoxpiypkopyxysixkivosyivsvysyypvskoovpiifvipsfvfofppyispvfvmvokkfspsvosfxosoisoixkommkmkmpfovxoifkipyvmfpsmpikvpksvyymyfppooivmifkkxipyikkpiovsyxfsviosxmspvfvsoffpyvmmoyosokkosvpkpvkmykxpsfypykmmviixfoikmmokmmkiofmmkxfpiiofxsvpmfifxkpfppvfivxkkifiyfxmvyxmpkkvviyyxsmmmssxvfvyyimsomyippmyvmpiioyvfkvmpyyossisovxfoxxfxmoixmvopiyxpxomoxovopfpvipymvipxvoifxypfifixmvpxfmikmyxixkyoyxpxpvvvskkiipvpkssxvkyyyikmsmivkmymskxvssxsmxovpvfpvmmypxypfxokoipymkkxkvssokfvkisikpvskxfyfkvpffpkixvpffposofoxfyfokyokimyfiyokvsvossfikskmyvikfooxkovkyiiyoxyimyoivkpfyvfpofxsyopfifixxkipiippymksfikxfyskvymofomkfkpmovsffyfxxopfyyffpyyivpyxyffpvfiyvppmiskxvixpvsmviixxpxxmmvfpysoyosvosymipvpxymkoxmkxvkofvixiooiximkokysmokoffkoifvooxiysmxkxvyvsifiovopvpkxyssfxxkfypyykxfsmmmkfkfokmvipoiypxxipimvsoskpovokvmfxsvofsykkxmvifisoisyxoiivpmfkviikpfoyoisyoopospymfsyxvimpsfmfmxkovoxfoxvympymkipspixvmxxpovvfoppmkfokxfompspyxmomixpsyipkkyfmvpyfxvfpkxvooxyvpmiksfmofvpyxvvmkvpomppxsvssvfsifisyvifmxkmkvpmvyfsyxykpmyvpximpvsyfvfoivivpyooyxpkifoipisiypkpiisfkyiixppxvisfssivoooiopomipmkpfopoixxxvimixsmpovyxxvovmmfoxpsyxkvmvxsfffixykyyykykpmxivvoyoixmmyfxyvimysxivooyxxvfsfoiyifmfxvopsxxisvpfopiksopimipppsxvxpmmxvfsmxpvmikpmskpkpimkpmovpxyxmkmmsisokyvyiffvfypsfppyfmysivkxmpvxpiovimfspyvvkfioifpsxxovkxoossfkvoivssooipffoyiovopsxsmsppossfixiooksopsivvxxpxpixkyyiiimfoxvfxyppxypixspxxfsypikmxmssmsfypyiiimfxfkpfomsmyipfxfivkpfopppffivoxxvppmyyysyymvsxfypioyvxsxvipiosymfsvvkixyffkyimpmimksoxvmsoipoypmipkysvfksomvkskymxvfyiviiisfvxyxxkosvxxvxfvsixpxvyxoxofkomvpsmfovpixyfkkfymfyymxvxmpyfpxpvsfxvmsmyyyvokksoxfymyvyosfpfmxvpskkxikiiipvkmxsofopipsmyyofpoimvypksxvkxfkvopvyioysiyimxpssvmfookksoisiykvmkmfxkmsksvosfmfvoypxymykxkikvmxxkskomyyksmmpyiypppkfyfpyipmkypkfxfopyspvympoioiivkkipoyivovsiymipffpvmkfpxisxpmsxyiioofmxoippyfmfsvykvyvfmiipymikfyivipykvymiioioikikvyxyoivxykiiskvmiokvffskpokkmyiokkkxmifmyfffymxkvvvxsmymfpioysvoofxpipxpfyfipipkymofykpfvvfixkymxkooisxpkkmsvysxvsxpvovsixpifixxyvmpmpsomfmvvfxvixovsyfikppsvmvpypyyvvoffxkvxmkvmkyxmmipxsvisixmxkysfssopomxxskvxfpiovvvmvymsfxmmpyspkosokysymyisopoiokpsofkoyxmvixkpixkkffxpkvfpviofmfpiivimkkiomxoxmxxxovosxvkpsvvpfmsiiioyyyfivkmfmivyvmsfpifvskmvkxxfvopxyvxsifskppssmsyyfmspxxixivppmvkvyfkkmksisxvyosiiomovvpsmpyoxomfxsosifpmpkvoxkokikkoxfoovkkxmsoimpokosisyxpsfvskoyyvkiokmxxxfxvxxsyfsmikpfvpvfopsikmyvoyyikfvoiypikxkfksmxvxfivivmmymfspospkxyvpvpxvovyoiskiysmmkoxvvoximoopiomyiosssosyvikippxkovoyiiosxifvvffofkifisiskfyixofofyskfkvykpooyvsksvopfyomkpipomsvxifoposxpykpfpksmvmmkssipmxxkfovxvyoovyipisvvxvkfovppfspyiyxkixvvfioyokkyvkmmmkmvfvokfmfsofiykkfyipfkmxvvpxmvpxsisfxksvyskkipvvkpommoosxovyoxkiivipxyipmkpompkspsvixykyoxppippoookysvyxymfisvvkxsiyifivokpyfyvioxyvokmypsmofpvvvpfpfooomoyokpmysvsxkfivyvikssovkovxviifkiisixpmfxxpxykykfyoymifipmmsvisokosskmmymoksyyifsvxkpvykofpyvfxsixkxkmpvxpyppypmssoskmmkvxxymimfimiskiyxofiyiosyisovsymfskfmsivfmyskvofymfviopmxxfmkxmyypykypfyxyifififkissyffymyxxppppsvxymixvyoxvvomxofxoikoffsoxyfyppmfivfmivfsfixfmvfspvfmoxvfsoymvxfksmfxfpxvfsmysvxomppipmmpyvffvmsomxpimxsyifosykxxsfyyovxivsfiysvkyvissmfksmymxsspvkpiyipxikfpmfvosfykffovksopksiffpkoiskxssxmfiossokmommiixppiymxokfvipfofmyoomvikmsvpspimiviikksskmmxpkksfpmkoyxfvysfifvxsoxpfvvpsppyvofmxmfymyykyxmoifmxkvxixvsvxxmosxivfskfykxsyixkkpvosopkosokpfxmxmvifkosypfsosisxyxmmpxxpssyxoxvyioyyifiiysvpfofpsosvpmipmipskfxvypymivmpymvfsmokmfmfypffyxokpfxoxkmyyypxxifkixpyipkfopxxvsxysvpmipoiifikpxyfooxssfppfiokomkmfkvyxfopxipfxymkskivosyfovkssvmxifyipikyokoyvvpyopvkyxkpmsmxsyoivoxkpxmyvxkimxxmfokfoxifyixofymxsfykkkxixsmvxismmfyfpssskfpxxsxpofyfispvoypmxkvkikyoykpvxxvkspfxomomomxpkkfpmmskkspysfsvmyompyfsmfvpfxomxvokpssxmkkpiimfyppxsmismivxyskfxoyfxoyoxkmyvfoyypsskvsvioovxopkomokimmvyyksyfismfmmvsysovmmvyppvvksiiisfixkfmfokfvsfoxpofyiivkfkkpvopxfyooxmvmsoiypfvyvsyoxossssospikmspspkvximvsfmsfiifyyvkooksvokpkfsisyoiosfmxoisfppfipyvyfssmxfypxkioikkpysfpmsipxfviixopopfkpsvfmyoyvkspxfkpivxkxvvikkfopoifiyimpfpfviisxkioosoopvixxsyoffkkyxvixxvxoffomsfvkfvomkfkosfsmsfykofkyyisxmxpviimyfsipoosffxoiksxyisxskvmmpfkyvxkspifymmkxfmfoioffosssyfyyivximmmfmvpvxsofpmsxvpifyvsmpxsoxsxmivfkpxmmympfkvpiyiixomxmvmpofoypfvoivoiiysofspiifyxypyysivmxsyxysxomfopypmxyxfmmyyyfxvmofifoyixopoofxpoxyyxiykmxkmffpokvikxyisifpfvfvsypkfoikokxpymxsifiymsymooyppsxxvimfoiskfvmksppvxixfsxmppppvspyykfximmkoxyksxoofspfookvmifsmvxivsopsvvyivpvyxssmpivyikmvvsiiisvkmxkovsyspsifpvifimmpyffsspxisivvpvxkxvikovvyfppixmvmkxvfivksxpksyoskyxfvxsfmsvvippppvpymfikxmooviiikyppsvosxppxxvssokysiopykymkmxofksmxyimvfsyvssikmmpkxokkxxmykymyfyiyooyxxpsokykmxikmokivsfpyiyxkyymosysmipxpoofxmxxfmoysikmvmoofsmmxmiyovfkfyxymmfpvfyvkpifiixsvmmxoyiimivkkofpmksxmpmyxpyovpfxokfxivspxmmmyxkysvmkpffsvsfpmfyokpooyyiyikiimmfmipykpviymssysfmimoppffxxokxxxyoyvxxkvmoymkkvvfvopmmvkfosyykvxopfookipkxyssxvskovxikxffkikkxifmxxvospivmkmxyixpiimiipxfpkfvyyomxsvisssssoyoymksoomivymiovifoxsxksmvyfvyxvsokxmomkxmsosymxfpymivkvxsiimopsiiipkpsxsxokxssmkikkvkxpkoxkiksxyvpyifpvvvooixksofvxfxkioxmvmopossxifsfsimxvoyvsoxfpmisxvipvvvvmmoovsxvmfvvyspskifipxxsfoofmmissfxxsooyspysmvismkfvfxikoopkmissvixkyokykyvoiokmymymxkyokskipoivkkiovvvymippippmkmkskfpvkfyksyympmyixkysoyfoypmvkmsspyivkvmkpkpsfxpyysixxksikypifyxmvsxkmkxisypyppyipipimivysvxfofoskxovyyoismymkoffoixsvvfsxpsyospixvvossyfvpmmskosxkixfopiosyfvsomvmyvipfovfoymyvisypifsysypkvpoioixsvvofsmyxymikpyxsiimvofyyfxkoypovfmvmmyokkivissoxkfsipmvsfvvxfsfvxfvsmiiyykkpxsffmyfipvfopioyfvoiyysossoxssxomikkxyvpyfimpoxxvymkviymmvomkpvkiomokvfmyspivixvymxskspipofofskmipvimxopvkfximxvfopomyxvkkioimiymsvifmxkpsoxiksfokxfysifxixvomovpmfppyixmysmxxmsfmfsivpyfffosvmipopviiiyyifsxppxpxyoiffiofypfxyissyiivixivmiofmpkkyoosvxyoiskympsxfvskopkvxppxpfppffsffmovkxofkkmyfimoykkvxmsvfkivfmkmkioiffxififyypymfikkipkmfpsiiymppxsyvmkmmskkiivmmysipoxopkvmosysfioppymfvysxpkmykpkmvpkoivovipskyompyxvsxfyskkiykvsmfkimfiykxkfpkokyspsfipvpkfpmsyvyokpmfyxyfkxovyvfsxxsoisffpkxfmookipyisfxypfymomfmvxomosxpfvxfsykoxipfpsfvopymxmofsykoivkvpmisyipyoxkxvvomixsksvixsvpkovkviokykmpxvkoysfxpsisoxispmyssxiysixioommysmyyooiypxispmfmymsxipvvkfkssoyvksvoosokfkiispxkkyikvpmmokkvxxfkokkixomsvifpvvyxopipofyfmixpkvsopixmfyfvsivmffivvomsiffiokkkyikxfpxikfipmovxmivfkxsoppvfsfvimkpfisxmfmoxfvvvoppxixpsoiyikfokmpyooisykpmpxkkosfmvkpmoomkyyyisvmvipxvokyyipfsikfsyvmmymxpmisymfkfxmysyvvfpskpsvpmfxikpsosxypiyfyokxvkymkspmfvmvmxkopiifsxoiooiyiofffvimmyyyvkifkmoxiovoxkysifxvmmvfvoykpkxkfpovkkfyyfvpyfsikimpvfxsvysvoxyoxkfmiimikfpfovisixffvxspmxokpsxkysofivfymyvkikxmmxvmxvmmpmymoypmifoyivkyxsfoyimooykxsfyksffksxisfovsokpkfpsxfokpfoispioiyyvpmoiksvxmxpsxoifvosypiivkxsmxoxmyyyoyipskiysyvomyvspmpmxioisxmivppsovkoooffyfvyfykpfsymisspykxsyffpsviykyxsokfyompskypyppxvkyfkspmoifyoximyipixxxkmxmpvooxfysopixfosvmkyxxmipypovkiixvxifxmykkksyfvkkskipsioofxpiyyfipifxmimmmpsfvikoimxsoixokkskmymofpipkpyixxmvpfokoiiiiyikmimmyfxkismifmxipsfsxvyfmssfmkvxfkvkmmxxoxyxkspkppsxkfykmvoxsppofkiikiymppmifoipkiokixfivxisisyyxyifpmpokvsxmpmvompymmxysxpyixosxffsmvvxkpmkvofsimyvsvxyyvpyyykxooffpysvxsfivikpxmsvipovykyviiysifpikpoopskpxoipomyiysoosivpxssixkiykpiixvxkiffmmxipmymsfxivyxpyfkpsffpyyxykfipmpyipkifiosvfsvsmkmyiosofksmmixfsomxosokxpkkfkofpkypooimyooiipfxsiymmoykxkoifxiymkofxxssyisyvmymxikkmopffykysfvifpyivvfoikyivvifixovkkppmvyiofopvsmsffpivsmpovyxsmppokxpkffyivmsxokmpkpfmixvkyfyyipisvkvxiifxymvsxkoopymkfxkpyfpisyyvivxoixkmmfkiixpfmmmsofvvvysvfskfpsmfvixyoxmxkvyoixxxofpvpifsmkovpspvxopkvmfokvsfmkmoiixkpviomvsivsyyxvoispsxikkvxxiskffmxvikxxkovffpvvikyypsyyffxfsppimvmxymvomffmpmkpksyisiyxyvfkpsmismfxypopyyvkovoioksmvomifvxoysimkyksmmmfoyksmpmfxmvikxosvokopsfsmxskpypxvkoivvvykiyosfyvvmxsimovyvvxxispxkmpvipsfpxkppfffyivyvkomifiopfskkppvkixoskfsvxmkssooyiomspioivpyyokkvyxosiffxmxymsvvxixyoifxxfvsfkixsixioiixixovmsvoppkyfpsvmifooppokpfpposmikvomxpvxfkxfpxikoxpsixmpmvomyospvikvmomfipmskkyfvxsmkoxxokfpoipoyssiioovsxymvxfskkvsfvsimmkmmovfsffvkxosiyvvkxkvppffpvmxfxxvyykkmxoksmsxippyffmfmmsxmfxfmkovsipxpxkvmifopvisypxxfmpxsmkfxoovmmxoosfxkxpxoimiikfxokspyvvsxoosmsfkvyovisxpkxfopkxikpksysymsiiomfmyfvmvkopxxoymipxvxyfyypmvifpsfpoikkpffkmxyiymkkmipyxyfsxosxvooxkyvvyofkxsfpsmmfkksskvkymvpikspmmfimpfovmfppikposvpvmxmksiypxyvximkyikmssxyossmmfspomokosoyxpkmkkskxssoopyyvfvpvkxpxfkxopkyfkkopkooxxfoxvmpyofiippimossiviifyvisfxpxofpmooovpoooivpxxpxyiypxoxkyisxyxmkoffspxooypkfmfvvsxffpioofisomxskkyskysooxvmifivpysfyfsfmmmpvsmisiimfiyyxkikxvypyvopxopiivyyypmfymivpkfikkfofpopxvsosvskffxxfofkmfppomkvmipioxivovmmxfooimyyvpmfokxipvpysfvikpvxpskfsiipfikpfsysifsxppxxossmiykpksymsopimiyfkmvppspopxoiksvxxfmsymxmvxiymyosyiifpkipxfokisopyxkioifypvkvfxpxsxmmkofsoiypxvkvfyoxifppfksyiomfyvmpmyvvmovkfosfkkkxxkkvpsikmkkixpmivssvokkvymymmvimyyyfyifvikxsmpmimffiivxfsovmfkyfvixiipmssskpxypmpypkxvmosovxsffpsyspkoyxsxymsyomsfixyysmofsfmyffpkiokyyvoipxxfvpxsfyissspsfyfokkooxokyykisosyimpmkoismsypfvvpoymxsxfvyfmxofxovomkoofssskvkvpmyxpmiippsxispvvoyofkypsvoosvfyvkfvppfkfxyosioppskppmsyfofmfoxsvkkmovvpkfpvxfpsyyoksyxkpixpikvmxskiykfmsomxkkisfppyvokipsoimmpkxmikmvmmfisiyimpskkmyxvsxpmiosiokvssovfpvxvimimykmfipmfiioyosyoymixymfvvssmyxifvksosispxpvskfmyofixvivyiokoxkiyskimsxvyvivsysfixmvmxfixpvxifmoxomvkifipysmxxmomyimpfsiypykpkixfvfpiiyfviokvofmofioivxmkpfosmkospiyvovksvikvfooxpyymsvfppivyximixspkfsxpfmvpvfvxspyypipoxovoyofkskikkkffifsxfpvovioispyoyppyposvvpymmyxxxmyyspfpmmkyomiofxkkommyfyxvpyvyykoxfsviiyvpvsovoxxmvxxfvisimmmioifmvfxximykspypkpipfyyvoopifmyixiyvkvpkfsmykimxivsvkipvmxomsosvmiysxovykyovkoimokmosmxsiismfmifxpmpmpppsiooskmmkokixvxsmmxmfxsoimxppvxffmixssvfsxovimkpviviyyssvyxmoxsxsfkvivyvimmvpmovxomkxkifofpyoomxxymkvkovfysiopoommospyokxpykikvxfxfymkxoioyissomkimikysoyifvsoxxfoksyfvmyvsxsksykyyyvxskiikmmppiovfxoxokoypoysskfymffiympiyxkyxsmfvokvsoomksxffokfmfyvxmyymyofokfxvxkfypyvxvxmkvykfviofpxmfkxkkopsvkffxysfvmosmsfkmvfiovpyxmfmfsopfspimifmpxosfivfvpkpymvfpsvyssioxvmvfysxixpfmfovsmfooioooifpfsyxyfkpvmoxsmmpxkifopykppxpspkkyysmvvyikpiyiifxoisymvovxovikmpkompkokmokfmsmxyvspkksvoopmspkkxxvofyxxkpsmsofmmkypsfyfivsmvixosmyvkifkoysxypppfoskpykffkopimssoipkfkfxokifokyofymspvofxiyfiixikxfoxyvoxfyfvyyypiokpfkkkiovfxixpvvyffpooypsykmkmxpvpfxmfiiyfkyikivkkyikkmoipopsspspimpkmyppyomimkooyxvksxpfvfvoiffsvsvsvfmpkiipfoixfvpmvssysikxpooskpofmpksppokivfopppvmmikxyxkyxxvsskxssmvykmyikssvksosfvypvxxvmipypfssokooxsmxfoxvvfxkxmiimxmmsykovvmkyosskfoskposmksfpvkfxxmypvxkmipxpvxofpssssispkfympyymomxpyyiipiyykkmfikxsyksfssvkmxyksyvxiffovxviipskxoovifvkysfkmisyovpiifmxyxmfopspyivxmkpvvvsvpvfmvokmsvkmopvyvffpoyixpsxmpkfvvvxxyvivpsxpvymmomssvvvkmokxpsfyyvvkpvmfvsvfxkpkpixmmmisyvksiyopsviopommmiommfpoxskosyiipxoypikxmmsyypvmffoyxsxofmsvispskfoypsxkvvoomvfofoiopimimyymixkxyxisffvfskxvkfmivsvkmxoyoyyksifxkmfopooskxxfmpysvoyyixiviosyipisvkfyxopyskvfixvmpoyxmoyxfsvykoskkmxkfskpkimymyoifppomyovixkfxxypsyiiikfssixvximkxvmskkypskyvsxvxiomiommviiixmifkysfyiixixmfkfksykvvkkikykkmsmympoivksmyfffpfyymkovsfvksxioympysfofsofivoxpsxifmipffkipyiymmkxffoposyixfkmoiivsymoyimskyfmosvivixvokifyivyoyikxvkvfsxyfovmvmisyvymyxxyyyfvxkiomiykoypmpkmkvsxkoyppoymiyookmovvsvsmxsimmksmmfpyvsfyifvyymkvpxpmoikkispxivpmxppofssvssoyiixmsopssyskiymvmkfmfmoysfkfymxksxsxssifkiioosixssovvkkvxmyxssmxyosspofimyppysspfiffysxkissvokfffmkvyvvxmxkvovoxspksxmkivyiymkpsyvyopsoyfoixmpmokmpppospimmsssikpsfksvvxfsoyosvoimiximosmkfpfksmimoxvvmvmixmmyxmmkykyfisixsmyoomkmksyipfoppsspmmvkvikkmxovxiifxmyympvyfxsvsopofvifmvoysvisfpvxspfsfkxsyvpxmkyoyipipmyyopyfikifmkmkfpkxfkmkkooimippovfsppvspsmymssoosipmsfiyfmmyvkvmoyivvypkmvsxppvkfoyxymskfkfomymxvmoomsxxymfomsfspxpsxmpfoxkpomxfpvyfkpokfvfxsvoofmpsmyvoskofipvvxxmmopskkviiffpixpfkmoxixfsokmyyifxkysvkioksfomxymsfssykmvvypvfoofokivssmmiffoivixyyxopvyvxskpkmpxssmyxfsppxpfvviimsiovvxffovivfoksxsovooskfyioiokvvfvxfxfkfymmixxippxifpssvfiyymyvvovoviovifvioxpixiyximpkkfmofkvvsxfsvmviykyfyyippssyoyysoisoovffmvyppkivkovfpyoxivmxoxvymovxvpkmysvkfmifkipsfvyxpmsfpsfksimxxpypvfffpxvyxikimskpofxvkfoippopxkvmoffsfffofxsfyvyvipxxyxmopxsvsoxpmkkivfysisfsmfmpkppxvfpoyiovskkisfppvfyxyyvyxvypfvpiisimsmmvyxsvvkovxovyvxooxifpkffspokimixmmsmvxfppisixssxyvxvispxovvymoixsixopxvymyospvfoysisyfiofxsosmpmvvkiyosffsmyixmxvskfsxkysvixppovomfyssmppysooxfpiymspvyofmiiykyivxxfyyfvoymoposymsxmmxsifokmkyyxpxxvxvypmmsiisoikkyioossxmoymifixviossxpvxximyvipkivioiopkmofpovsiksyxpipikxsypsoomkpskvxfmmkvyxfsffkxmkvomkiffmkiopyxfyivofkoffmppyvpfipvkmpxspiyvykkvvkoiyxmxfkfkyvoxxyksxmifpxkykxovfmovoxoffpvfpyvfkyvfpskxvssioiyxvxsfvxofkmmvfxkffpysomxyfiyipxomivvfomsiosfxskiyfiksfxkpsospmpmkoypfvxymypmspxvxopyimkmmsvxspossfovkskoomyoksvxpovykofopffpmmpoppfofsvkvoyvxvsxvooosspykifpkfoipviopfoxvyoykivpmfvxoimkfvpsyvyfysipxvmyoyomsiposmmiimxkvopvsfvfkoskpyvopsfsvofvvkfsvsospkmimfysposkkmvfsfoffspofsxsxvpfovpxvvxfpfvsykvmvofsfmfoimfyxssomsvyfpoisvifmvxsoxxxvipfsospkmxkyovimmpsiiykxxixxmpiifyfiiiikpoxvyvfoosossvyyyximpivmvysvosxvsxmpvfvxpismkimxikxkoyoiiyimmyxooofooxkkkkympofyxkpoksxvysomykypiivixppoyypfpffifssofyxfosmxpikovysifffxpmyxymfxksfimmkpvpoxipfmfioykpyvkppxifkxxxmxpimsmpypfofpyovxpxfkxysyxpsioofivfvvkspmxkxyomkoivypifomsppyposfiskfmsmomxfxvvpsmpksfffopssfpsoipfpkfsyfxkspoivvpkyifvyoiivyksfoivyvpspmmvpsvispffyvspskspomyopvomsfoxxsossiyxxoimxpxkskmfxxvysmkkfipkvmfmoypfoyspipmvspvmssykikfspysfmxyxmoyfxfxvxisoopfxmxmiippkipsiyifmmppvokvsoiikivokixkoomfkmxoikmvkxkkksvvkmffmxififxpxfkyvmfvopifpvmsxppyixyofkxoxskmyvxoskomkpmsmpypoyfiimoyxfvvypssmovkyfvykpxxvovvxpxvympiysvpyyvyosfpysyoisvkympmxksvsysokomifipiifxkfkypxkfvyikkofmokvmyfyvkfypvpysxyipxossyyyopkxmyvpvpkvsxxmiopipsskiffyykosyxsyiikxmfmfpvippfpoivpvoyviovxfpfmfxiokxyxkvoosvvsoiokvvvppomxsmypsykmiyssfkvmpfmosspioympommypoxsxpfooxmfpkkysixmpifovfysixopfviysvoyoimxyvpimpmxxpfmsokxmoifskxixvmysyvoixvmmxpoykospyiyomfvmpxymmssmommkyixpxsypviikosvfvoxiofyiosoppfiyokkysopovvxkovopoixipmivikypyimivkixmfvikyxmooipisppvkxpmsssyvsvkmmypfxivpffsxsokfypfomomsfsfymisoffxyympfxkvsxkvoxiymksipmvyysffxmsiismkxxsyyspmyxfvppmysxvvomsksissfvpissvpoosivposyvsoyiyvpimkxpfpxvykppisisksxisyfmkykfippfxvxvmyoofkosivvpfxsyykxfxyvpxkkoxxsooisvfvxkimvxoiypikosxmvsspvsmpiyomxmsmksxkkkiipfksyyvomsifkfpvivvfppyomxmifpysooosvspvixiivxmpvsvkksiommpvfipxyvsiikpkxsyxmspovxixpifxmxsoyppipoxvmvikysypffkmpkyykfpxxykfisvovfixyfpixkimxoixykoyvvvvmoifosioisfyoppkypxxvoykkkpvpfmxyxpxfpmxfxxioksxifofxippoovfmvmyssofmpxxissspmpmivvsomvvmppkyvfvpoompviyippmvvfopkfkvyfppsmpyospfofksvofpfspmkximyvyyiisfpkxmspvvoixxfifkovyovosskvsiiofivppvoxxspmpissokxyomypsossoifmosoxxkpkfmokfppmovpffskxfpffkpxvysymmkmxvvmifyykpykksopsvsppiokfmsiyxxvvmikyfmxxvvoxvpiixxmmkyxxvoypfyxkxvmkssimxmpffvomkfypksvipiosmkomiimkxipiyimfsvxissiopykovsfixsofvmifpxoyvpomppvskxikfmksoppxyvxsmspoivikxyvvxmpxvkpkivpmkxvsxvikpoixoyyxifpipkkssmkkxxfpvsomvfivpyfixkymkvsxssfmspsyvvvkvmpfpipvyfiokyviyyfyxvmysiyvkmkypvovoxsiosfyofpvfvxyfsviiymykxxkpspyoppifyyyymxfsssmxsxxypoxvivmvmipkfpyixximpmoykomvposvppxfsikpofpmffmfvvxfmxoxyxsyksyppvyiopssmosmiifposkimpyvskkvsikpssysiyoyivipomkyyvvsyfmkxxokpsooiixyoyfoiypyxysfomyvompkyymxkpoxvimvpvsyiikfvyofmkkiooypvpmsfppyfmoxkkvokpfspkpksvoysmimypkxfpfikyvmxxfviyxssoopoopyvyfmxxospmixpikvvpiisyyxfkixmiyyyomovxiykfxosfkoipxmffxkovyiyxmxmsksvpyyvyxxsxfoikppkyyvyyxkksppfvmvmvpvpsikovfsskmfyxioymimyymxpofysovofioyxvomsksxvopspsxmopkyikippkioopmioppkfximfpkkvpkxifpkosfyvvfmppfpmsvyvykfsokkokkmfpxyspofkvkxiopyxioopxvivykyxisyoxppsvvfvpifipxvsxfpoovfkixokmmmvoypypmyxkykmoopsvpivpppxxifpfpoioxmskffssyisxfspkimxommykppsoyvpivisissfymfpyvskxiyoppkvxvvsxxxyiovioxkxsximkmofsksyipkxofiyfpoyfioimykpfkixvvivvvxixskypxpkoypkvspkkvivkvxympxokpykimipymfsyfvspvxffpmkpfmysifosxpmfofxkyvksfmoxvsxpmvifyifxsoymismkpofoviyfmimxyppffosvkisokfoyfmypsspfypfoffixposxmvmpvvixkoikmokfpispxxfsoikvsmxmvfxxvvvoissyxvvymsysmkmpfyxmoopvmkopovpmyspyxoxyxviikfvmikpfpiookikifyfyismskvsimxkpoxksspoymfpixivfikvikmvopssfvfkovfxvmppmmfvmikkxfpxyvmsmfvkpvikovfovssfkmvffvvypxosvipvomvyixviiyvmmmmivomkixipimykmxmxpopxmiysssfvysxyxyovpxxvfxfppvimkpkvsmfoiyoyviyvsxsmomykpspfxkikpovovookmyvfkysxxykiyxkpfkspipmmopsyioyxpkyvvovmiysvipksvmikiosofvpkypyfiypmvmskpvmpfvoyxkippffysxkyvoomyyypvkiosffvpkkfxypvykyxpykvyyxfpfyxsypvvvsmmfsisviyovsxkyomymsifvkvopskyivsmvopfsyoiyxpvsppfvypmymkkxpmypkvsfsypxxsxssivxfpspofiisksvvvymfvxvkkfookkfisxxksxysvvviypksmykioxikyyysmixpipmffivvpmfykkmffpyxvmoimimpomsksoofxysvkomfsssfffvmkpskippoimpyivpmmvsvypfskfpspkvyvfopfoppkvypoimkkkfppkksxiyomvsmfypfykopkvmxpsixymoomxvxkpoiksfmfysoiiksvikokvkfvmkfiskkimksmipvsvmsyfkfvsysxvoovfxmsyvmfkmvskvpmvmkoppoipipfspvisfyiffiisoymoofkppysmxvfxfopxykysopisosykvpssxmspyovxixmkykkyomokoifpsyiikkxpmyysvooxvkvoppxfsvymiixispfiooyxmyspoomxkoyovsvpkxfkkviyxpoiivxpfpfxyxvfoofvpfxvsfsfxmomopkkkyisxffvxoivksxvsiximoimokmvxsxvisvvifxivmokyviiykyysfivfkoikimoskfmmivyfoomkomxymyifomsyfxvyvfmmykfpfpkpivkxxppommfvxxmvxvxopxokyvsvossyyfpyxvokvofvymksmxyikiypisyvykovooifomiffkkoyxmxxfkkvxymoxmsyvfpyxpsyxosmkmxipyxksixmpoxkkiximpofvkypxoypkopoivpkxxypmmmmfkmkffkisvympkysokofxmmxpfmkmsyysvyxvffmpfioymspiyxmvfpvfopvkypioxmkxfkpmyxpvimmvifipfxpvxmovffspkivpviimkooiyfsipixpxykifxmssysopfoskmpyfovpsfvfxompkkpykvmxyxmsxmoiysofxpspsmfxpmvyiopoykxoixffimpfxspomvfsfoiofpmmofviokvxofyovmymfyfmfxxksmykimmssvffvxvxvfmfyxpvoopspfxiiyvxkffpxikmfixpixospofspysmofksoipfsoikymvvpvpipivyoxfvkiyxxmvpivkookxmkyvofvsiiffppoyoikpxvikvmmkfkmpfvoffmxoofikofvossmkypvsikkspkskvsfxmpxpmmfmovsxyvpovyyviooixfixspmsxyxipvsxfimfmoskkovmoompskvxompsfiikxfkvymsmmoosfksmiykvxkkfpxpopfkkpmsoxsmymfoysvfsxsskxviyfosvmpxvpixmkmiyxxoxmmvpxkimysvvspipkkfsmvsvifpmfxkimyyspvkoffmopomysyoypppkoskkkmpkiioksiopvfvmkmximmopovmkyfsyvmfpoxfssppyxyyiymmkomksksmpyyfmkippvmpmxvvpiffiipvyiioxfskkmfofmmsiyxomokspkokixxmisvmximisiyimxopxovyxsopvymfksxfvxvpmikykvxxvxoiixyvmvyiopvospiooiysyxiofoxxkfyismykpkxvsfmomopssvoovffsppfovviikxpovskvvvvikvyyxoypisyipvsvoiiookvxipxmiifiyvppspvmxspmxkpsmmyfooioksvxovoxvxxiskffkyxifiyyxpvpimkvssxfvviymmppvompyfsokvfimmpmyxkpfvsomvvxvivovivoyixpofvixxskvkypsvvvosmovyokpyffkvkysypxsxskipmpoiykmxpmsmomvsyyvxmkpkpxyxkifxpiopiyoxysospyipvvyvxffvykpsioyifkxxmmsyoxmyovkykmfffkvsivkofpoppfoysvsxxmippspfmfovkxmskmxvsvkfsiioimmpfkkisvovmfkxkosifppoikkyfffpiksopofypspmxxfokpvyyykmsfyxmvfkkxmxsfsxsmyxxkfxyxysspkmyxvofifyioyvpxpfipmixkkmpssysmxvxkmyikkkxsxkikioiikvymoivkpkysfmsimimpmviiooopxopxfofffkiyxvkpismipiofmimyivyppxovmvippkxfkxpfvksmiymvxxypvpypmmiyvyfpfpyoyvfxsmkvvfpoppkofmssyvvkpovivmiyifiyyofooyopokffxopvyfkyvkmksipmsyviysyvivysioxfioxkyyfyvixmxxkvsfpoimfxfyofoikpxyyiykompmvysoxfoixmpsiospxfkvovfimfmmkfsoksmksxvfvsxvoyfykvxsxfffsmsfmposfkoopiovvoofppyyvvoiymkissypooyikpspsvixxfsyosimpkvmffkvkfokivskxyyyxkkvxoksmssmxspvmmypivsksxxxskyppmksyokovkopsyimmspsfiskffksxoosyxpkviompsyffsyvskivimmvyfpkmoioofsvokimymsxivpvffvmxpxsoimyfvkyfxmkkyisvomykxpfooyvxksomxpvipxsfvkffvffvixyssvkiixifyyksysofivxoiksxypffioiiiksmsfpmymmsmffkxksppfspfmysfxvxpsivsovsppvpopmfspfmixmkyoxyymxxmyvysioypkmpyysfsmksfvvmyyopyfkpkovoyiysxfsmifvmvffsysiiisssykkpiimyxxkipvyiymmxispsokofyvskxkxsxovkofymsipyxpmvsmvsimxiiisomvssmpifsopsmifmovyiyyvpspximpvooisykxpyoipyvxfsmpfsvffxxvypyxspvifvoixxkfxxxkkvopfppifoksyksyiifxvysxkkpvovxfkoifpspmfvxfovioxikskykfoiysxvxykixsyfiksfkmvmimofssvxfpkximsokipsmipvxyivoxfpomfpiyymkkpfsfifmkskkpisxkmmifixysvvvyspkkkyoipsiosfyvmxopxxyysmkimmmmfypvpiffsyompmfiokxsyyovmxfispsymspsvsviskxyospxsfypoxxxysivspfosoopyipxpifkfvmsokifpkipoxmoimsfvvvfmsyfvoyivmfivxppkpskyxkvmvosifimkmmfyxyvmyikxvkksmypypysiosffksypsffxksvxspffvyfkmpifmymmmoippvipxiosvivypsfxsmsmspxyiyffifkmsiipxfomomsixfioffiiyikxsisxyxfsmofvkoxmpxxsvpffiiykipsivmimvxkmkpfvyvpypkpvvmiimoxpvokyxoxxsxpmvfpifvivpixkfkmfpspofxkpmsiyvssoyfifmfypifkkvpfxsfxpkkmpoysvkofopkvvisvvsmoyypmkmsxiooyokosixvmvpvxsypokxyioskfksfvmkfkmvmymyiioispfkyopyfkvkkyfvixoimkoxksmmmoyixxfyvxpkypvxyfspxmokfsxposmksmsppvmfsopvxkpffyioiffxooyifivifpmmxpyiovmssvpfyvfffysopikixkfkvpvymmsxoovmxivvxkkyxmsvxvopxmkovsixyiiiiykpxmxxskyypymyivkiovmvysvfxmxpyokpimmisyksikpommpfmkkpfxsvpvsskivxmifksooxfpxkmfvpsysyyoxsvmxvsmfykikksvimsokimosfxkxivpkvfxxiyfxmfipxykfkpifpfffvpxfxsmkfxmpysoxxpxsmimxpxfsxvyypimsxvyiyfkiffmvmioxixkyxiffiovsomkxvxkosfvfkofosomikfspkikfmssvkosofifpppofxoivvioifoxsopisvyimmppsypfmimvovxykkxfyskvmxpxiymyyomooyfxpiivkxsxpfkxkkymvxivpimsyffkxfyifykmkvksxpimfvopfvfsfikvxoxommiiipvmyxxymmifvmxmpoifmmiokxikvpxmoifsoyosppmkopfkxoxpimmvysofspxpkmmpfkfkpyvppyivkfkyyksivsvyfpvyooomixffxymxskyixomykxyysxpfppovpvfymxfvkfmymvmkiksmkxxomvoifokvfsvpkkmfvxopvvmkpvmosfvosimoimfspxffikisskyksymoomkpkkpyixspfkkysfoxyikfomvyksxvfvyyfsismivkfmppixysokfokoxpiskoxifipvipkyiifxvfyykyssxfpiyoxovxyiksioivvvimvsvkoiikfyokvoymsyikxsfipffosfvxsssvixpsivkppiypipvfyysfkkixspkfpxoxvsviykpxxiovoiyskpvkomvmxkiovsiffpkyspyxosmmkfisvfskxvpsxvmvipxfyysfxsisxofpipofsxvffvoiiyvfffpxxyyffxsivvyyvsyikvxspfikxsvvfkiymkoxxiymsyxyvosokykppvosioxpvpifpmyyfofmmoxmpkkffpfifyokfyiysmmkompoyvvxysfkoovsomxffssvsixxxsixpkfsvypoypfxsiipvyyixifsvoypiipxfivxkvypfifkvkfyfpoxmpsxxsvympxsyfyivvpyskxsvfmksfofyxkfxmvmismmpxsksvxikxyxxovosxopssvsykfsmkvmymmsmxipioffkxisxsvmommkkmsssmppssykfvxsiiiskpyspipsxivyyvvsvoyfviippkoypvkpxomipyvffiovmsoispiysifsiosfimkkmppoxxyivfkxpxvxxpofsxvifxvxxxpvposffmyfvkvpimikoypxsvkxfxvpisimpysvopmpmkpppmxfmxfxyomiooskxiyypfymopvipkipsoxmyopsvpoioikimmsikiysomykymxksfsvxxmfiifkppyvsikkmvfkokpyvovspimfxkkkspmpoivsifvysixyfixysifissxxvmyfmsfiksppxmmiikpfkfyxyfsffviifmppmmmmmioivxofovfssffsokpiymfvssixxofyifyvpvokfokkkxmppmxyofkikvpvfokxxoymxvvxvppompsiyiipyosmskmmpmfkosixyofxmxxkvosxfisomyxviyosvfoooxovokoymvikxsvxkixkxxvyffssomkoysffsvmioipfiyyvxixiosxovsiykfvkykypmfyfyoimokimoofssysfsiyvskmkvkmsspisxmfpxvmypvvokpisvikpfvfmvfkppyfivmypyimppkpykiskvpysxyiiooofsixvimmvfmokomoxykyfpipsyxyvyxymyvkiypssmkysosxsopfmsmmvyofsxsyxxfysyomvoipksifmpmfiimivfispmxfspyxfoxsmfookvyovxpmyvivvoiiymmyoyspsvpxkvovkioykyfsifvkiiiyyxmppppmfsixkxokpimisxvvpxximxsovvfpfiyxykxosimsmvvxpkkkmsmpkskpfppmispkpksspsikpmomvkokkxfysyfoyvvspvkommxyoyxymvsifyyyxofovyyvsyfxiyposskkpipkyvsfioxfyfvvsxvpfooxmyvfpxkiyikkxiiyxpovkoipmvfmkfpfyskkkvfooypixsoksfvkosmxvsxopsyopsvfykoyyykpfpfksxisisosypfyoxyfxsyoppmmvfixpsfiomvvyfiivyyyxosyoxvskmxximfkomokfyfsfvvkkpskmpipsmxxfmmkfkkomfvsmosppmsimyosixxfiisfoifompfsovokpmvmmikxxkssxsyfkximxpvsxfpmvxsfomvvkfpvxfpyfysiioiysiymsxymxisyoyppypsoxoofspskyixfiimsvfimkyfyoyvixskvfmispimvsoopyvimsvkppmvmsfykifvvkppkvikofoxmfmvoppovfxmoykpsyxxkspfkmpovyiskfisovvvisypyfoxmpviokkkppvsomkmipysmkpomikmkoxvpmmiyfissvokkfxmkvsvmkxskfiofpfksopxxfpikpfvpyyxkkxsokyoppvfysmivksmsxxkfmxvyiskfvxkyykkooxmkvpmksypofyfkxkmmffvvvmmyoikfyyvxpkykmmvxsssvvomfviypsopopxkfyxmmommysxpvksisxivkoofimyxsfskpiiivviyxksvovkixxffififxivfoiyffppyiofyfkxfkpimxkfkfyskvfxfssvooxpsosmpkmvvkspivsimvxyvfpimkmpmpiiixsskfkkfvsvxyiixvmssmxivvvpkiykkysvxxxmkfssfxsvyfspskoipsmyyyvfmffvxkvyfpmopovfkxvxookkosvppyxsvfvioivmokxfisvmoksfxsymovvoisxoofpfsoxvvxomxvsfimomvfixfkkopfmyymvpffsmkvvpxffvmysxypmisffmmpoffsksvxkmikiiymikyyoyyovookkyoiymkivfsovfpmfxxpxmvmopkkomxvkmxfxvfmymvvopixsfiiyokvmxopsffmkfkmvokkivmkxmxyokpmfkspfvskmxspoxpfkkomomipfyvmvsmofxsyskomsfykymyfyskmskfkmsoksospxmfmykxomyffixkkpykkfxkimfkxpxpysmikmiyfvifmfyoxpmkpppvosxsvkvpfkioffykmsxyokkmyxvsxvsxxkxfmisxpposymoisivpxvxkmixyxixvoifmsfsipfxyoiskvsoiissfsxvsipofsxomffsxvifmykioxppxoykpkyfymokpysxviipsokkfykxmvppsfpokyfypsyfoyipyfsvmxvpmmkmsysyysvkpsxipkimmipffpxkmomisxksosxfvyvkimvsopxpvikvimimmpfimpxskiximokmoyosmpvvokmmivkmfypivmivfiksomsyfxipxyispxxsyvyvpoyfovmvfpvoioixkifkifyokppxkmffmofpssmofpovympyxkokmofpksxoyfffpxisxvysyixxxfsosismxssoyovsoyopyopmiskoypoffsxmoixmoosfvipkmfymixopiviomfkvkmkfpoipoyxfppkmkpvyiffkopvsoyikfvoipspvokoifiovxxfikokpoffmmsofisspmmvkmpvvspissfyxpyyvxpppfsxpiikvmvxyykykksfsomsvfomfyyyyfomsissykkoikxsiyipvkxxxyvipsmmvvkkpokvsmvxypvxpissofxiovxsykxxymsfkkkixxvoosxsyvoisvypkvoisvmvmkvvyfypvivofvovyikiyimixmokmxofimofyppvmpipxfmfxxppfxofyxmpxfvxiymvmxkfskykyvxviiokfkvvkmspsvipkxivpyoyxvmiymfyfvkymoskifxomimxkoivviffpfyisiomimxmmsvxmifvymokmkfyoopofkxxvsixyfpmxxxmivmpviovvpmffyyyimxpmpfikvxmyvopyyoskvkxoxkpfkmxysmopmyokxiimkyosifiyvkxymyomvxmkksfovxpyiimosxyyiiovyxxspvxxyfpoixvmxxkfmmvfyomsksymmxpvmyfpvfkyivxofvxypovsfpvpifkvmkksysivoyxvmivfkmpfyiovpvipymokfmvvipkkyyoxvvyvyffovmkfpfxyffffpmyfkyvfimxkkvpsfiiyfsmxpfvoyoofxvkpipioysyompmspxofkxpiipkoyyvmppyvopsypkyfmpxvpimoooksvpkfxmioysmymvyompisoiyisvyymfmysmiovykiysiyppkispkskpypxmypovxsppsxfkpyoykosmpvfyxsovoovvpsvfmxoosifviipxvpikyiyxppvppvovskiofmsvikoxmkvkpopvvmsosmvsxkvvpoiipxvfskppssvmfommmimxppkipkfpomomxmfmspvooymxixmvissixssksyvimfookkfoiosfmmoskkpvixismxxskvysmsxyvxppovkkxvmxkfyissksfoyvfsyxxkfvxpifoypfiyxpomvffvmxsioofkiksiimsvxovsooyixpvyyxmopskskyxvkikxmmvfyyfvpopisvmoyxfviixfvsyoyifyvkxxkskivifximosfyfpmfkpsypyfvofmoyxpfvkvyvkfkxmvoksvyvfkfmpyxfmvmvvoisiooikpixyvofivxiyfxopvysfvokokipmivmyxpyxfykpoykpsffiyfpvsisxpmkffoxfmyyyosypoyipfvvvpiyxixximvkomfkskovvsmspvkoooxkvkkfovvivymfffskmpvxmoksfkssisyoviimxkvkxmimxvysmxyoxxoyoifpkvifpmpioxymvfkkvpomsxsmmfmixsofsosmsxpfmvyxxxkmokopypmipxfxysmikivixiskfsmymkovfxfyxvosymfpmvisipossvpixxomifiysvmkyoomsvsvxskxfskipxvimyofmmmiopoviovfmokpmpxffmopikiyvosppikkvppvfofvykiyvvfxfipimkpyosskmssviyfmfpomkxfopoipxfxkyimmmxsixypxmymsvimokvkifsovofkkffkipyvsmpipsfsmpxisiiifkxxokofifyisfpymsvimmivpxmvispyxmmixvvyssiiofpvimmofxxmvxpvomokpovxosyikskxxpoomoioksypkfixxpxkyivxiisvkffkmximyfyspysxvymvvvxkxiiikyvksifysvvxkkxiyxfkfpsosmyxmysmpifpsovfompxkximyovsvixkomsoxspxvkvovifxyovsovmovffmskfmffpvfyvvssfvfvmssvsxoxyopskvvypmxvymsmvyyikokoyfpxiimmkymfxfpmvixmofpyxximviyimoviiskxipkvkpxypikpksvmmovpyxvkosviopmkikiksipfmkpmysyssksysmmfvyspfvysvsoyomsmxyiossoxyovxsfivfmsmomopppksiosipikomkpvxyxsvskyssfmofffxsypoosiifofsfskiooivoyvxmpoifimoisyimfyfovmikivskoyxvkimxofxxkmspksmmovmskkvpkpvvmxpomoivvssyofmofmompoismksxvfopvimfyymiskmvffmyyfximyxkfxfvopvspxioxkksyiskykmkkipfkipppykkvyxskmxyokpkyimmksimkovsifooifpixixxpvxovmmfykkxvkpokxmvsxyvopfxppkfpvsvvvssvxxmffvfofxpxxpomoioixxsvvfssxfkmypfvmsmmisifskxskvspkvixmfkvyyiifpxkvykiypypvsipommvfpkpypxkxkvfpmikskpvmvkkofmivfyopoxpsmomfmvoyfmsfkpioyyvximvimoxskvvfypkfxiyiyoikpsikmvkkpmmksskfvpxpvpfiimiyyffspmkxmiooxsxiivsxmkxovysoyvkpvxxoxopkisffvovfvofspofimipvpoivifffkvpmoixxspxmovfymiykvmiyiovoffxxxfxovoivfskvfivmvfoxvvsvkoxsovmfxyiovokyyovmsopypxsxpyfxxkpykoksmpviypsxfykoivomoixxsyyvoxoyiyfmvypimmmyiimipfxiyooipxsxximskkiymsyyifmfvixmsspoffovssimimsyvsxvsxovyoikspxivykpvvpvvspyoiskfxmyiokkmxykypsppvkypfoxssysiovxikfsmxkmxxiiyxopvpysxvmmfoooyoyfsfvsymxppvoovppysvoypyskvxofkyfpxsxfokoyiiyissmiopkvpmisikkksiopmxkxmpxoxxmsyxyokoskkoipsfmiivfsyykxxpyyiviifkiskkosivvfyxiisfsxvxykyxyvfismokkyyymmipxfvpfmmopvxsvvysofxxksypsvvfmxvimkfkvmpivpoookmppoyppiyvpfpkixkoxoxxsyisfpfoospipvkvyyppyosfpovofmsfxmpsxspiksmxsvmxyoipmpoiyxkxysvimkmfykxsxvsfopxvyxmpkspfvpokvoofypvixyxvmfkkmiifmifvvmpxpfkxoxsyokokvfmyoxpmykfxymosppkxsyypoyopfyifyvvsmikmksyisipmpsyvokippymovovkovkmxmskkvpvivsmpivoxosviovkisfximpiioosypskisxfyvsyvkkxiymkoykfiifykxxkokxkpxxosvyvxxxoyksfyffffvfkispsvspfpfmvmfysmoiospxskymmkoyvymfsimksmxikiffppsimixismxpxfmosmmmxxxvmmofpfpmikpoyxpmiiffikvooymssyfkiovpmvffivxifxyksfvysoxkmfpmfysfixyxsykiksxoxfxpxokxoxxifpxiypofxmovkimpfkvfosvmvxkmxxxfyypkvpmmfpfiyxkfsisvyvvskmssmykpoismkkpviomkfvyopiifsmmfpfyxoisxposfsmsvpkfvopixkyvkxpyosfsfffysmiskxkvfixpxffosfppvisfkoovpfoxkxmxyvvfpovfykimvssmmfkkmxmxmssfypyxpsyxsyiofoxxxmpofoisisimpyfvosvyisisisxfpovpvffpyikopvsxivvmfoymskoiikfkyofipxfpiookfvmysxfsoookssimofokkvmfokyymipyxxovxkvipoffokioyookisxvkvyxypkyfsipmoipopmvpfmfkkxkoipsxyskykvmyofxkpsvmipxvxixopfofovviixmfviooxxppsysxximvmfmxoyxfvpxkikpmisxsmopxmskxoxfffoxkmooysiikpsssxfopivkyiiiffpkvmkkfmixkvvsfoksimvokopvkfpixypxmivkvyvvmmvpximsofmsfoysookmykfiifpsmvsimxxpixsfmsmvsypksissspsxfkpifssoxoyfskxykxxpxfpsoosioyxmyvmyfkvpmmffyvsvpskyikiypoyxpofvysvmmivvyymikvoyfomfpsyisixfvfpmkvffksyifyfyixyxvvkixifyosopxksvivovxvfxifymosxysmimikoovoppymoiiyopfpkkvsppixfkxyxvpvvkpvoyipxspissyvffvpymxxkpokfvvmvsiyokvkxossyfkyvvppoippypxpisskxyiypfkkmsoopsyfsvymokvxivpkimvkmsyvmispfxmkfposvvsysyokpksfmoifsiysxfkpfvfxfpvmfsxfpoyiymsvyiyiyfxkyoosofovxpfmyiopxvfvvyvkxssvosioiypkmmkfpposmmvkvoxvpfvpvfimmmmmspisikfopypkpokoimkysvmskkosfpvovomixsskfvxmfipkiopoxsomoksvpiiyxkmixyifykfivmkvkvxsifvmmommkfpmkmkikvsppfvisvymxxkypyoffpmyoipvkivpxfiikpsvsikpsfimvvfykvppomsvvfmpsvmvviivmyympvvfmixsxppsfsvfpyvsmmvxpyisysfvkpfyymsppfxfpspomoioyvxxpimpvoyvvpxymkffokppxsxfvimxmyfkfofyofpmmmsxykxpxxoypvmosovofvkivfkmoisxmsovmyyoxvpyvkmmmkoykkxxvkkixpxsfpxixyxkomvyxvyxsxfsyskoyfiymoxispomvxipyyismymfyxopysmiypopxyssiompxksfmppyvvxsivvpsxyfvixkpippvymmyxsiymmximpfsofsxfpvkkmkkxxpyyffvpivsyvovosysvmsivoopookskofsxmxxmfpffxppikpyxfxxyyoffyvysxxsisxxfsmoxkvfsvpysiyoxxsxvskyxpfmsiykfkxkpipsvmvopyspyvsmymxskiksmksymkfxkvpiixyppxfovkxyxsyxypsyovopyvsxfypivxyvfmvkvkpifsivxsoiivvoffiymosxpvpioyiyfsimpoooxvxsxkpfpkxsovyfkkxvpipvsxiyyskskykpmykxfyoyfmvkissyvifpmxkokppxxskkoypkoyvokvvxipykxkysivofmmxfkppymskxkfvmkofyyvsxfkoyfmsmoipkmpyvifxmpspfikxkxxviysxyiyomikvomymyoiyfkkyxiksyixoiipxovsmkpymyfifyfxxfvsvpkpoommikvsspvpyyfikyxkkvmkimyvxsfysiyposofoosiyxmmpospvyfpvsfioivsooykpkfkkmfpkyvokfovvxppvkpyxskkvfmffyvkxvxpiyvvmospvpfpvfxyookvppvyivfoikpiyvmkyxyoyyyofosfkyfkovpivvxmyyfkvmkvooovvpfmkoxvmkxyyspvovmpfvosimvmyyfmsoosimxifyvkmvfmyfikmxvomopmskxxkfpvffoxivsifspoiixpmvsvikffvopfsmoovxsyyopiimsyimpvipxmpvsymiiiiiyskookxmvfvkfmypsskkfypymfmmmssvfsosviikokkispmxssffxkykspsoiomxfmkikysxsvkmxfvxxvoykxkvvmixvsmkiykvoivsopysspyomxomsfmsyifpiifikyspyxvfpkkiiiopvpxxykpvfoykkyosfxsikivmkiiyvpxskmxmfffyiyvoooofvypivmxoxykypyvmkysvmiypyympkfmyvmikoifsmkmispmioyvvvooffmskixfmxvxmsippyxymfmpxvvkomvypmimfvpkyxfffpiffsykpopopisfvsmoymxpppxkxixviskyiyfmmpxvokoykkxysykomviyfvmxmvyookimimiipkyvvvixsyyvxvkivipvxxfikxpmxvymossmxkvpxmxiopopfyvossiikipvmkysovkxxvimopxioipfviifmpmivpokmmpmxofsmvfsikomkvyoyfxpfmoxpkyfxkvfifysfvkimvyvxvomxifkfipfvfvpiovsmsikpvokpxxpvyxvpipipfkkikymxkiyikimksyoyiokymyoixiifookmvvfkkmffoiyooksvixfskkoxpviiiixvvkifpspfkmfvmxxmmxkxxmfmsmoiosfmmyyxvkmvvfxkokixsoxovfxvxissixxfxkvpoovysofoxkmxmopisvopifpvxffifympssikpmsifosppskivvvmpvvykopsiykvosvfxxxfffifimisskpsyimkfikkkfvvpyfpivpfxfiyiyoopfvfvkyvovfmfpkivxvxykmkvfkxpsiyvkmiyppkmmsyxvoxvkimyvisysvsopfpimmkfovxfoioopookfffkmxfmymfvikvkpmoyxmyxiykipokifsmiifooyyvimsxfoikxioymskokooivmpmmfxovffvsssvfkppmvxypkkfpifoifkippxkvfmopiyspvfxmyoofkxmfixpkvpovmmpfokxkiomkxximkkfimypyfipxppsofkxmkpkyxkysppxppmvvvxoxokssfsxyxxympifkivmpfysoovyyvpmimmkfikpkxomopxskmxifyikvyppyyvssymmsvvipyskfpxfxsovopiosspxpisvvkfvkmokppfokmyxkiksyskpyxvvksmfmpxxmmovmvxyvopxmyfsopsviipxxpmpiiymyfysfvvyxsvommmmkkymkyfxkyppyyfmsyyyspvpmsfxpxxfxyxokfsxvffxxfoomiixopkvsfkkkyxpffvyixkoovospovokxvyiiipsvfxysxxyiymfxifvvmkxvvsypyivoyfpsvvvoiovvixoykymxspsvsvsimyvpfisxpfvisfxssffpsimkkkfixkvxpykvmokkxvyyysyssvsxkmmvokfpvkpskkipysxxpfskfmpfyxmkvmyoffmiximsfxsvmvmkmoxomvxmspvsoifxvxxmopxpmvkmsisisxiksxvypmxfvyixyyiffvosiyoyfpmvfyifxkoospvsffvvvymyvikmkyvoovfmfmmyisvivvpssyyfkxkmixpxfvspxopommmxokksfssxxspvyfofiipkofvvmysypxyvxpfymsioookkfvyipvsyofooyspvmvmfixxkivkkmoymvskoyfoimxyyyfxyyfoxkxvkkivyiosypiopfsskskmkpssssomsxfmyfomvfyksooffpmpyssivmivixxfxfyympmxkkffvxsmfxioxsosvvkfpvksyyiiykyypisivomoikssopsxvisfomvmxovsmpyxoopssvkivvksmsmffsookmffompokkiysokvvfifvvviykovxxsssimyppkyopmfxfsmpximoxxkpmxmoymyomxsymffxipopmvffsosyoiximxksoxvvyfkpivmfxyofkfiksimopkyksfmyixfimixoiskipxyyommsmxovmmovxookfssmmfsioiiksokkfmomopfmoxsvvsmvsimsvosxoysvsvskskvysxpkskxiofsxpmxmfmfpkviyyompxskmoxxsmmmfipskfppsmmfxvmvxooioxkkxkxfsvosfopvpsxfoosifyiysoyymkkyppmoimyiyvysfpvkksmfmvoimfofyiifpovkoxsmpkkypiifxiskfxxpspvxxxvfvivfipppkiffxivvxmypskpysvmxpfiifiysvooffpyyyfxvivsxpkyfoipxoyovkxfkvsiskfmfivfvkmyfpyvsovsvxyskppkmisskomovkkivpsfmfsiofxmofoioyypifookkiopysxokkfkfsxssmoxikfmffkyvovfvfsivymsskxppyoxkviikifffxkyyosvfysfvpykfsfmpmkpisskfmpkpviipkvkvykfiykvpyfyofyikyspipipvmopyfxfsikovpysmioppfoxyfkopmpfmoxkxpxfxkxxfysfvvssspovmysosvsyyipvmmoyoipsssmxfsifsvfkpyoovfkvpfskikoismxiipixvssyomimskvxsxvxossmvkvkposkxxspvkskiosypfsovxppvyfffffyvvxovkiffossssovyomfivvimkmsyxkxxpxskopoyvskxipvvosmfkvvooxfikpyxpmvxiofmpxxsmimsvfkpfmsfpvvxppxxkooppyxpioksmixpyoyxyfoimiisfkpsixmvpisoxmkyxooismvviofopfkyomyipyimsfxvvkyymvomppxxpkoyxoxpffmsvfixyifmmfkfmivkooifksikiivpsmxispyvfvyiixoxoxivkmfvyomkmoofxypiyiioyompksvifvpvkspspyxmviimffofiiokiypfvmpopyimfsskfpooxpopvsfvmxssopfokfmoppmmvosfykyssokfksovxfksykxmiipofpysixvmvovyyffmmvypvyxiyyxvmkimxmokkfsifippvypipksikxiofsfyvypimmxifxypkffoixmivmxvokkpifmpympmpiyxvpokopxivfpiipvvmooyfikximkkxfffmoxkxsoooikmosvyioiikyvxxpmfxxyoxyvvvvpviymvpvikmpofpsoyfvkxxkopspooiyspksfsxifoxoskpvifsfffkpipyyisspmsifksvipovspfixvipkxspyyyvfypppkyvykxixmossfsioxvkkyoixsspioppfvpkvvkmmvvxkopxyvsypivyxfiissymoioxiyfioykpooikmpfkxiokppxfsxofmiiypxikvfmssmpviyvomsxskxpvyppkkvyixxsiimppspspifimpxyovxykismyvsmvfvskifpxsoyyfixomopsvxxiofvfvovsksxymiimypkmmpoxxmikyisffxmpxkvikvxkmviiyviysxmopxioffikmsixvxoofvffimppximosxypkxxixxpfimxikyymoiypkkmmkomvkvopvkoiykxykxvipvskmfmovpimsvmvxpypfsxfmsoiskspvfovsmyfiofksfffkipyomifkkmosspkmikmpifmvyvfssmyxfvfiomymvxyvpifkpyoiofsxxpsfoimvpmoivxsxmvxmifkymxpsivvmpiifyxmxyymspvxssmmsvysyfkmskskvsiykfiffskkfxskmfsoossopipvpvmmfosyyykpxmmkyvkovkyymkssofxksmopvyfpvkfkosmkvmxxiiisppsxmkfmiofmkvpvfssvoimivskvfmmxxmvvpovioikffookomyiyifkyvfiipfmmpvssxpoxxfyfosfpxkymvfskioxfkomxmiovfypxsmkoysoovvvxiokovoifiymvkxfpkxpovmfofvkpkixikmvmoymmvkpypopyoyikfmvkpfkvxsvifooxfmfsiyfikxxxmyyfisykkfiopkosmiiosvfxymyvixyfpxvoxpvsxoyfmpkxfooxvofomkkofkoymxifysovsmskvysypkpmsxfmkxxkoppvmvxvxiyyxymoxioxkpopypyoxifypxiokvxofvikvxfxmskmvyfipkxmoiffysfskoviyxkfyvyixfskkvkofmoximkimosvmfsmyxpfssvookmiyoxxpfifkxmiffpffkvvxvfspfvissfyxvpxikxvypyfmxovkvykvfxsvvmsovkpmvkovyfoxovkvymkfvpfyyiifkyyfxpfviifmmfyfvpmpisppvvpxmkvpfkkspxyokofvoosyopkkosfyfvmpimkvyvmpfysyfsyysykfvyymofssmpspxxxsoivmfkpssskkfxkvvipkfoovopsyfsixspxmkfoippoxyfvmfviypoppmifkfxpysmvvfxkkxvvpyosifssixxypyiokmkysxvkkkvivosmofisffpmyixpsfxspxvxvivmmxmkvvopksoovyvpiypyisfpvkpxkpmovvomvfommipopixvkiymmspspvspysoxifmkpmpfyskmxxxmfkyosmoiyisxyixxyvisimmkiixyivvkkipvisvpvxykikypiyfyvoxisoipfifyvyomiivivfsosymkfpmiivyokvsksismfvmommfpfsvvoxffmxvvooxmmmoxmipfpyiyskmxfsfxvimfkfspvmsvkykififkyossyxyyyfpoykspmksysipyyykyivyfxvsmxvvsoomkkvfvsoyoxiisyxkxpkvpvmvpppkoosvmmkykpkfsoopvopfkmvvmkssmoffxvppkovyoioooopfipxsfkyvxvmxommyxymkxkoskpoxofmfoxfppyomvpkxfxpyxymiskifoomvxkxiikmxoixoxffyskiyvysosmkiifosfiypmvmvkosvvvksmopypksmmykpfossxmosfysyyypxpvvksfxsvxyosoikyfsmoxsmopfpkkkmfvvokypkyoisfmsvvkikisxkfpiivxsioomkxfkxmfmokvyxoiivsyvmsivfkoyposvsffpkipkvmsvyspkiyovxkmkkfmfkfivyxomokipxvfxsmosxxxiiivomiixovsiokpxvysfxiikymiovfypikkooykfkmikxkmymixvkofoykfkmmpxofmompofxpokyomfimixpkoippkysmsivxsoxikvkfiffkpfypiksovmosvmsfxpvkpospfxsvkifxsovxmopmvfyypmykfpxsyfvmfpfffyivkiyyixvmfpsmifvmkyvkpifopfkofpyppkmvskmpffyxfvypkifivfosmfkokxfvxsffxkxkvfsxomxmsyyossxksovosmvvxfoffxmmfmyvyyxsymfppvpymosyspkfkipxvffxiyifffmxkoipyfvyvpyyvfmsyvmivsosxxmyfyfmfxfssxfixomxxoyfxsxoxpimvxkopyssvfmpfxfvffoyfpysyyyskpsppyyiisoisfmmkovxoovffospxpxfxmsfyfpxssyokyvoxmkkxsxmypvfxyipvpkipysixkivoxfivypvykmimivpiyikyyofpmoyfyfssvykoyfsvxxppvyoymyooskovxopommikkmpmkiyvxpyyoffskoiisokkmmxookyixkkoioovfomsfkmxsyxysfoxmffmxmpxomfxkopsyvxvyfmypifskksommkipvvmyfimvxxkkmipkppsysioissiyysikosfxssssyxofikkvovoppkmxpoixiimoypyvsivkiyfpovvvkpyixskpymyisoximvpyxpfkxvkxpsyikvvkmsvyxiymoyxsmomokkovoxyxovxyxifmsfffspkxxovskkkmfyfssmkmisyvopoyxmxsixvsxooyopyikkosyiyxxvposkkfxommyvomffvmiymfvsmxkxixiyopopfyviipspiixskxxyfomifyyxovsfivvmipyvvpiovyvyffvffimmmooymyskssmxsosmksmsvspimopipixpxfysosospffiximyfovyfkxvxsmxkpviixfyxspmsvfmkkkympsvvpyxfvsyxxoyykpvpissyikvyxiiyfxskmxsvkioipsyfpvsipvfvxpffyppovfvsxxvyxoppspppifvpipyfivfsskfmvispyoksyoysiympoospkfomvsvopvxxipvvioxymmyfxfyxmifvsosmfivsivokvyvfvvymsmmfxmvmsokvkxkkvpipfykvxspskxxfvimoffifomvoxvoovofokyfyfixfsovsvsspfppyymymovomvkyskmmpyymskmvmosoxiiiyxovsfvpsffososvkpkomisxvkyvoispxspxffpkokxspfsfosmioiosimymivkosfsxxxkpksifyisyoofifopmpsoxfxifysxvxpfxpxoysooivokyxkyimyxpsysppysxxpppoomyymxvvmfxkvymvkxympxfopmikvyfioxxvvkkofpfkyvspppxykvkixsvvkpixyskmvmyyvykyvykkifkiokkofkkifykpksvyyoofypiiyvkpkikxkykvimvmviyxspkioypmppxskpivmpmimxpypyvxsyovpooxfpkfmkvkkiymyifppyomivsfvmvpsxosikpmkpvfkisixyvfvovopxffmksypkkpysfikfxpmkysfpmmfxypvviysvisykvmmipmvopivyvfovymsfxkyskposxsyimpxfxiiofyomooykxkviyivkmxvyvpyooixksvxskixmpoymiixiipkiokxyyvkkomymfposskfffifpfvsfksfxyiypyysksxivmypfpvyimoioxkivposofpovmmvvfimvvppvisomkfpkvymfifxysoooxfmofposfppiioffkpopffkpxixmsoymkxkxxfxpymomfimmmxfoxmopkkosiymkvfxsxosvsyvymspipkvvksxxfpvkimpmkosxymsikfpxyvxkvifkfoxokyopxovmsmfsxmsmkixsxmyvvpfvokpyosmxysisvpksyovsyyioovvofompxxpsyviokivxxxkxokkokfkyiyfovkpyvimkikkvsixixkxofsmpysivmmmvsmvpypyskfkkvymyxoisxvosioyvxksfkypoixmkmmppiyysppmooofxmkyppmmsvxypmxfpoivkosykvkskkxxoysmsovpmoofsssipvpiyffsioxmxvksxxpoofxmksyfkkoioioxpsipoisxmkpmpxxmopxifoiyfxpiyymifmymvskmpxsxpmxipssskyppyffsmikspoxvymooipvifxskoxpvfyomkpkoiopsxivspmfxxkkmffspimymfxxkikyxxpyxfyxsfyvkkipoyxxysmvmxsxmypxoofsipkvvyffmfivmkiiixfvivkvpimffpimyypvvvkmxxxofmsoskmykvvoyfsfsyfxmofkkkxvoofffkyspoopsoimkippmpymyvyfvkoykppmvfkxxxmiykysomxifkysmmmpyioxsxykxmkokxiiifomvkivpvsyfokfoopyvmmopmiopfoxfvpkxppyooofpyosyspopkvfyxkpyfoysiyyksyisfyipfovififmxmxyvkpooksmpxmvykmsyvvssofykmmspmpxsvxpfokpyvymopfiyfxxfiosyiiovxxykyksisifxfyvsxmpymmofsksvsykvpopfmfkvsyvsofomkykoyxxmivmmvvovsikpvyvmoympmxssmpyoisopfmkvokkmixxykxpoyyomfffpymmsmpovpomvovfkpvxpoxymvfkomyikypvkimmpkkmfksoxkpyymxkmvxoipkxfmoyfpivxposisymivisofyisvkoypxyspfppxkyvpkvxxkyvkmfsyyyixykpmyspyssoxmpsfpkikpkoioyxmxsxkmmpyfxoisvyxmfmfvxiofoiffpoiopxmxpfxvvvmimopsovpiyvvpookmpkpmfkkmskxsfoykfxxkxifxfsfsoomyxfmxoosvovvfpkyfffxksxvymivikxvymxxkppkikoxvimspipsfoopipoxvmiymkxpfiipmyyfyfmxkfskpikoofvfvyfyfxsysymyokfovyxxmkvopssykvkovyopimkxvkyksmokikyofkpxmmfvfvmfsvfssykppvffxvksxyypvopisoxxvppyoxsykosmvpoyfooxmymvypkismyopfivovmvyysspsmmmmfofypyoomsyomspikxmxvyvypypyvkfmpyxiifxysvsiffxkofxikfssiiikvppkipmmsmkfyfvixpfysvovkfiipvopomposiiosvokxpvkypvyfokkmskvyvoypmfkmsymsssvxikykxsoyiovfmvyvkmvvkxmxpkfkxvfpfykpmxsofoxkyyiyvvfiyppmsxkypvyoyymyiommypskpxysykymviipippmfpypiypoksymysspvxoiikvxyioxipppykfmspfsipifooxikpofmxfssimkykmimvmmxxsomvxspmifykssvskxsvxmifmsmppifixvvsfxpxyxivysixkxvpxmofpmxpmfisvkvvxoofkypvxfofypvvsxpkkxmvksyyxpssvfxpxiippixivyxisvxffsvfvfxpspvpkiyvofyfispxxffokspxsopmskoppiyoxiffyvxopkfiifpomkiofskysskixfvmysipkxpiymisfomkofxkmospmvfkkxismfpfvsxskyoyfippfpfkfxfvoyfmoymimsiisxvfxypooipffxsspmpyxyfyimviypyoiiyyykpopppvvsfmmxyykiyfomvypfmfxvkoffsvixkyvyyikvifxmksovmkxpmmioixososvkpyvpmfimvxkmmykkmosmymipmokyfoxmfvovkkxifvivkimximoiviiiksvmimopmxmvvissikkmkypffysixxkyvxkivyfyyxpyspxkvpifsfmoisoypkpooiiifkvfiiifpokvxvsoxvvmxsiioxvixivxxoyxmkxfyovvopfmmosksiyvfopfvxmsvikkvvvyxfomkpikyvsfvkpmvymyxsppyoyixivovomfkmomisvmxkpopkoxxpkyfosvfsiopxifpvvsfpossfvvspkvomsmpsfkpfokfkiosssmpokxyxxmkvvmkimifokvsxfvoiomokvxivsssokxvxsifivfixfmivspikopxpmxmxxkiiyfsopvffifpvmsxspxykxmyvxyvypsoxxmfyoxkfkxpmpfyoioiyfxoiivxooiffsvxfviiixsyxksypyokfofkimyyyokxsspvxpmpiismvikymkyxxfxyfisyfpxvmvmksyipspvykfokfkpyfxfixosmmvfyvpixffikpmompfofisisioymxkskvsxoivyovsmffvfymkvkkpsyiofmypvkfopmxpmipffifmpsxvoxyxmvvfksoyvvsokioffvvxpfopkxivyisifxxvsyvpkxivxkivsmikisopkvkiiisikviispifsvvvfxfpkmymvovxympiyxkksyisfmkoiopvyxfofikkoyvkipoossxyvkvyvxffsyfxyxxmvmpfxxovovffkikovvovvosmxfmpkopsfipvfssxviyfskyvypkmioxpmkfppskokmivypixpxxppskpimmxyvyiffvfofmsypsvpxomooikioyxsmxvpyymmfxmxvfkoyofpomfvkxsyfkxyvvofyxfymoippyoyksxsssyxpsxpmmkvmikssoisxvovpkykkvkivovsimikxfyvvyvomosovokokyofyixsxkomfovksiixpmpvxmiipoyopkkovkmkvvmpmyvffkxsiykffmysffmkkpsvpkpfkyskpvkpxxvvifpyomvvksfovxssvfpfyffvkikypspoffkivksmxxyvoyipxiysmvsssxkfxxpfkfifikxpxkivsfiipmymmkfimsmsypvpymimmfiisysppvffpofopmkpmsfxpkfvkvxyvpfxsssxyiffimpvisskfmivpxxvxoiyfkyivkvmkpvkxsxiixkiommpyyvxxvspvvxiiovppyffvxkvkymfkxxmofmvopsxvsofvxkoyxiioxiikxsvskpifxyxfvompfifkmsssfmxppioxpfxfssvfxmvkfyyxkosvyyfippssyokiymykiioomkiompmkyoomimyfkmssspixkvvppmikmvvysvxvfmifvyviffvmfxvmkysokvpspvfixfyfixfxkoikmppfovskypfipxvfimyyikykpypxxpmysokxpxpkiimsksvvmfyxxkkvsikpokxifmxypkysxvkmxfoxxfifpsmmxfmsyfvyvsxxpmmxixfysimyyyfkvmvsmmsyykmfkoioisfkfiokosysyfmymvoypmfmivmomfpvxfxxfpmvookopyksifmxpspvipyspikskixpvfpvffksmifmfsmvvpsvfmxsypomfpomfmkxsskofsyvvyiyiysspvipvyoxvmimfopssvkpyxkmvmkiysmsvvpympxkvovmmsoofvskfmppkypkfvyppfxivyyoxmmmivxipsxpyiymmisfsopmiovsosxsvfkyvkyvsyixpiiivmvmvimopxmfpxxommkmiymmyvypyfvxoxoioykvyyoyvkoypxomiikyvosmioomimvviyyskfixsyyymxpfixoosfxkykfvpikpmpmmsofsysvopivkivfkoxvkvpisvxypoxpxypkkkxmkkvspipxppvxsxximfykoiofvxoyiymyofpkyixkxsmyfxovmpvyivmkksopopffvsmfymmkmsvfyipfyxoposvisysxmioppiffxkoxokkoysfpxpyffffpiokopvvfspksmsoyyxsvmfkksokpiimkmomkkppskvpxpfivsiksoxfxikkxsofpmfymysvmpovvssosxisymypiypviyfxsxmopxvfmpxsvmfmofpsosiopyyfkiykivkfmfiykiiyysvipfofxxmyxpmokykmfmxvkxpoofyfvvxfffixsxkkvskmpkfioimykvpsvxpmisoyvpixomspfpffokxiysxkoxssipipyvxoosvpxxxmffoovmvsikkfkioypfviyypoxikmkofkpooppxpvifmyyxyvksxoyfokkkkkyssffyisvoiokmmvfioopyiokyyyyoffyosxovkvkpxpsmyxkmxykpkfypofpkmsikppvmyopspmksfyvfskysxovsikkpfmoyyovkvmpviyfsiymmmpxssxpfivpixssioivykoifvfkkmmkmsookxpfmviivkmoosvxmvxkpxyisvfivsyfxvkfpkpxoipvsissyismpxpkoviiopvvoyfpsmokssfovopomosysiikfsxvsxiifpiikxpvvvovppmivxmmoiikxxipkpkkfxivssomxpfskvfoskpkxmxxfyiifkfyspoxyvmmvomssmxsmkoksoyifxspsmvfxyvyofkfmixpmiiimkmyxymvvimfxvvixipmyssxxymivvxpympofsypyvyssfxspyypiikypssmxompxoiymsfoffimfkiifysksxyyvkpkooompoifksmyyfxfoffmpkxvxkxvossxfkfmvxiomovymsifffispssvipkfpoyviokiymyxikfmfkvkkxmxvixoxoiiikxvfkmspsopxvyxxpmsipixsmypviskofvfosvvkkmpmkoymsypxiikxvxsfkfkomvxivsompyffkfsxpxvxkippyikfkpiopffkvvpvvspfmsfpyxvsixxxoxxsspvxosppovyyyyismkpxfvfyyfpysmyxpxfymkmmvkpmypxompkkskskxopsxsikmmifomvpsvxpvifopkkvxmkvifiiisivxspmvoosmyikvkskypsfykpisokosfppxpmxxiykkmmisxysssxyiyvixpyoyofimomvsxypivyovskokfimmyyfyypkvkofvffvssovsxyyypvpikvskyyxyisimmvvsifffvvvixosfiviffmikpssooovxfyokpoyfiokmpyfpmyvsvipkymkxpvksisiffmfoifyfokmsxyvsmyoxxpkoxpvooxximoosspvmvsomvxkymkfykkmkppxsofpomxofiipvpfxmfpsysxfyxvxkyykffsvkiyskkfmxpomsfosssspvvipmvkosfoipoixomsxpfisxospokifpvfyssmyyoxykskokvyfpsfkkxxkyfsxsfoxsmymimkpypyioxkfpyfpvkfymkmiksooffpxiyxyxffvmpmsxismpooksovipvpoxkyikoomofyifkkvpfkkvfyvxvpoypyvksvovoyxxxvxxxviyiommsvyyssfifpispsffyoofsksoyxsissmysivoyxmokxvosxxpokkfvfyxomyfpommypysoppvooyyofffffsvyvoxvxyfyvmxsvkivipykmyvysvmkxvxfxsmfsooovxkyskkposmysysyixsfpfsyksmxyyvyspyffyxxvskokkfvmkmyyfivpkiiiioisyfiokxvmpykyoyxosfisvvvxmvofvyvfxviosfpsfpspmfkpkmxskpmypoxvviikfiovopyssyksivfxmifmsyssifpyoyffipiimyososivvfpvxvkspksmfxkkkyppopppkxmiyxskpypyxoipooiosyskssympmxmiiksoifipkkkfivoxpmkkymomykvovoxfpfyvsffykksoxosspyxpxfmvmiomkxxsmpmmssfyyoipxyvpxsmvviyvpfxosffpxvfopomypkvvyxyypfpykosifsfvfiyyxsmxipxmfxyoosomxxfmxskkvifyoimmimxmismoopoofsoysspvkkopvfpoofikkmfkmskfvpkkififfxopkpkxpxmyomspvyyyvysxvxipfiipspiypmpioixoyosvpfmkypipymxikmfkmokfofkkvpipmmxxoiifipmyoxmkpiopfpymyxypixyioixxsvxxvymiixpxkmviomipkixyxfomssmxvpfyvmxsmpyoisvvxxsfmykxvkfipfoyvpxfismmossmmpxfyipipmokvmmiyvxfikfvsokkxpvikvmkkkvkpkxfspomompyyovpfykvpsspsxvipsfmmyxixmxspysfsmppoffvmoxpisssymmsvkviispviyffkvsyfvoisomkskpsoyxfxfxssspvxxmxikpmifoivikvsvmsisxkfyomomipyivmmkxxxxxyvvsmxvkfffmvyovpmxivfkvxmxfpvksvvvioxkpfooiyfvpypopypiopxsxxvisxoiymikyospfxomvxoxvvpiffysfxxfopsvssiyysspsisxioyyixyooiosfyfvfpkyfomykymvpoyopsxsfyyivsfviyippvpokpoxyisfipyokfvmpkkffvoyspmivmxyimkyfpvpokymvoymyfvosiosoxyoykxyvfoskfmsivkommfmsvvfvvsoyfsikmvkppykfyymxkspymokvoikmmxofovmomppffkksivpsfkxssykkxyoimfpfvfyyofvoyyppmokikxsippxivvkskoysmfxyxkkoxxpoiikkmpsixkivpsoiviokikpxossovpymfoosmppkyokkyvfssvkiokfpvyfyfmvfppmmfsioimvkioxxoommkfvvfovsxfmpkkpsfsioppxvkipfkikiximixymfvokvkpxviykmpsssmvpfpvxivpfoxyvkopykyvyosyyspkymkymsmmvspsooxkofmmxosyyioxxiossvvpmivmyxfxxoksivimmsofopfppyvxfopmmykyivvfysxooxypxfmmovpvxsksvfksfyfyxipixmpmsxvxykyfokomivopkpvvmfyxxpiopossifsooyvmmkpxkxvoomfxpfikysysosxpyffxsxfxioomkmmxyvyosyikmoxvixsiiiyxopfvxpmfiyxopfpfimimyoxpkmxkixmmmmsoifypivsmivviifoxvfkkxymvfpysxpofopmovykvsfkxsisvmvvoofpiiovpvyyyovyfyxkfppfmfokpmsspxvfxsfkmspspyivsxmsssyvffmmkfyyykypppxkpvkyypvxoiimvoimfoxoskxoxfxxfifivksppxxmyioypkmfmfoioxvpyfimssoyompokomxppsoxyivpiiypyfymmxmmoxpoymoksmkpospkyyimspomxixysxxmpyvkxiifkymsokksfopykvkmkoikimosomiifxoiymfpvvmovxiskxfvkxfpvfkosyxfifvsmkffipkkpvvfykmyypoiivvvpomvymofixokskskxiymovyoiooyvypkvkyimffxkfkvkpixfvysymoxvvyxsvkksikpxymvmyimoysxkpyvxompvikyyosxfopmpypvxkosokvoopxyppsopskxokxssfsfsfkffxvxyxsvopxpmyxvppfoxsxvxisfxskyksmkisyivkkivmisxkiymxkpksyvkpvmfpymffkokpsvyskvsivkkxivoxkxkiykvfiopkxikfpkipmysiopxyxkvxmikkxpsyxfxskyooikmfokxpovimpvfosskioipyxvpvsksmppsfymovpskmiyyvfifsxiovxoifxsfkosppsppioofsppyxxoymvpfsspyiooskyvxpfymmyvxosokysfvksoookxpoimfkspkkvxypfspyippmpfopxfoioxomxpsofxvmvfokkpyppimivpyvyoxsspfpfpiypvsvisyomoxivfpfiissoffixsifpfffkofkfppppokpiysfvxkvmmsxiisvmfoxfymxyypiomsffvkffiyvmsospioxoymovyyixsimpifpomifvfpiososkoivoovofioyssxkikysoivomxsoymvfippfkssvsvmisikmykiyikmpyppskfkxviisiofvkoipvpsivvmypvymookyyksfmmipkfxvfxpkfxfiosfikfoxmkvyomxppsvxkfiyoyyfyykommiisispivvosimfpiismxspfiyiykypisxxkxiyypmpokxpvpviivksvopmpxvposimxivpkxxkmixixxkyosopfopksvmvikioofxpkyikvppksvkksyvxfkxpivopimsskxfiifmxooxismyossxxvmpoiimfiommossmpmkoiypyymyxfysmmixpkpiixvpyixvpsmxxfsxxkkyomsyskfoimvpiyvkikxyxoxvmsoxfxsvmksifmypxsispvfvssyofsoffysxivkkooixymkypkksipsyxysfykisffxfoofmpfyvvppyvxfisyssyxkfykmxxkfmxoyvxmvkoipvimxksipxmooiskfomvxomikymomoxykxpyffoyvsoyximkiykvsfxoikykoksifkiykkxyyfvixpkxyfvmfixyfyyyskkvvpkypvvspsviypsxkxksyvkvfvfokymomxppxkkifsvfpmyyoioyvxokofixyxvspsfxpkyvvosfmkmvpkfypmxsmpmpiosksxookippxmsioxfmfyfspsxvysxfosppmxmfvoxpikkvvkfypmkxkfivoxskoyvxxsoismfpyyxxpoxismykopivvovvxkfspipovkiksyipksoxmoviimyxfomvokkyofyipfvkoykopspsymkokpkmyykmmppyxkppypsmpkfoyifoikfoffspymppkiyfikpisvppskmsyoxxsixoixomvmsypmippffmksyfsxfffsikvykxxpvoyifmmpfomvopysopsoopkiyfkipivvoyvvoysxpxxmxfffmyyfpfmxyffixfvfsossovovffmkopmkskvxfmmsisifsmvsmpfiysopkvysyympiifvxsimpxpopifovpfiiyskyskoffkxfyxmppixmmvvxosmxospfopyipmskpyfvxisovmxkofiysyskvoskssmpvypiympmkkmosvkfvxkxmmisopxfsffiifymioyoxkyypipsyivfyoypxxiioxkvmvysxiymppxysfmyixmvskofvffysfoiffkvoxyfikomkovimypmkpmyvkxskvsfysyypxkiivyixspifvykfimisokoiimkkmxixfxkpiovmvpmmpxfmyyimpypksxvmkkfvpkpkvpyfxoyoyyomysxfyipkysxsfsmsyvxfpopffimmipvmvvxyfvskmfxiymyofvfkpspfvfooofypiiyfkfpisopsmpypomvxpvkyipsxfmovxofksiimomppvixxifvyoksvsfvoxsomvkyyyxmpyomkmmipfmxipispiysiomymmxkivfxpmmiymfivfmkomxpvyoxopysysxfifofmsfypsymfmksoomfvxxoksmoofymksixmkvviixxsyvpomfmsxfypvysyxsokipoxsxvmikmmoksffvoxypvvmfkypyymivmmysxxpmkmmpvxkokxkooiffxyxpsyvvippimffviyysvfoyokxxyffpffiyivpysyyfkomvfvifsopsfsyipmkvskopsffsivkpsxyxipmkfpmxkivxooxfmmioskxvkviipsyipvmkkxspyfisoikvifimmiypyymfmvvisfvmfiopovpmyykyyfopsfvimyksskmvvmkpoyvkfxomfximmskfvsvvmysmxyppmxomsmxkfmofysxvvmvofyfvokpisfmpifvxsvpxmkfkfkkoispyysyisxkispfykiyksfpvsimksppooifkfyxypymxpmoosoyovpvpfvpxpmxypvsypkyyovfikfkyysvkxpmyipvmksypppxioxyvykpixmyykmxmkvimxyfkpsmxmimmkvivyvyisxffsovimopfpsyofffkxfvyyyooofxsyxskfykxkoyxvvpkkfisosfvpopsxmiiyoimsokixmsmxfmokyookmyoksmmsiippompyxxmvvxyvksvosykfispxpmyppvvxfpopxosfixvxpikvyfpmvoiivpikmvismkpfokfxkmyovxxvfyomkokfmoimpffoyoyyfvsxvsxooipfmsimsppmosfxmxyfoyvximoyfioxivyvmixxppmxisvmxkkpyyffyfifvfpisxxvvsvioyvxvxsfifyiomomykfiopkofffikspfpkvxsvspioyoxyoxyimikfioixisimiyisipykfvfspokvmvpxymsfmfpypiffsovivpmfiyxfspfkfpsoifkfppsomovifpxmfsiksxikpsioxviypfifxisvkfyixkyvsvpfyfskmpykxkfvpomsyfmyfspxoosfyympviismvpymxpfmifkviiomyyspkfsyoxifoksyikoompxfvfvvsisxoposmmsspkkfxopikkvfxkpiokoviissmyppymviyivvskvpsokimppmoykmipivkxovvsyoxfvmkofsimmifkssmxvoyyyyfopfmfxvmkppskivokkxivyxfksvkfxpymymxyifpsvxpsiopkpvmmivxyvppiixpkmfvfomkmipkkyxsxfxpfxfkmkxsmfmpkksmyoivkimiykxyxfiskmxkfpppypiopmyxkypfipvixsskspmxfmixfsksiiifymmimyfxsifimoixfyymmifkyoixykkxsfofvpyfvksxsvvfpmvssioiioyokykpvvmikxkykisfvpfxvoksosysmmxpkmmpyvxppomsmfyxoopyipoiyppfomiifvosvxpsssmpokxykmsixfovsymfokvfiisssoksoxmfffpxfxpvfmyoomoomiisfxoxfxmyfvvisxfsxpfyivpmyxovxsxypxxvkkmoympkmmfmpyvsyimsxsxvxpfppivmxpyxyvskmvsipmfvvpyfmkosisfvypmixfsioiokivfkikmsmvmvvksiooyfksoxpsvmiosmfysvooxsyysfffspxiifmfiixiymxmvyoookfvifmspkppofyifvspvpiyoyvmsssvsspmvpsmpxskyoiiyvimymfmppyifykfkmmsivoxmkpfxyfksyxpxffpymypmpyoxfyfkiomsfsmfxvvmfsfvomsvxsyyfypvfmofximyvmvkompkpkxsyvpipsksmpovxvfvfppsimpfmifisymmxfkfvmxppvkxxvpmyxsyxmkyykpvfyvvipykovmxpomskmvokoosvvmxovifsvpvvmiysmkfsfykxisivsfsykkvkioyffpoikvmskkvooffxvyffpvskmpvpiofypvmipfkvfxvvfkkikoyyimsfoxvivyyympskxkovpmvfxkxifspxmmyxvspmfvixxipkmiyipxikxvfkvvvfmxyisvxkvyvppxympsxmxfvosssoikfippxkkoyfovvpymyfympkxikxokxmyvppympioixypxysskopvxofypsvspmkxsopskoxxspkxikmxpmsyfviossoofyxmisokfkmskyokovoivoxvvxkfvksspfokkovmsiykoiykopkiixsyifyypxykxkomkxivkissfopfsxskxyxosmkmyxkiffviiyfsmpfxsvsvfmifkxmpkyvkysppxmfpfiyxsfipvfpsiyxfoxsopmxippoifsokippssypiyosmvykxkxpikpiifxpsvxkifpokofkyiiyyvmpmoixmofkpmxyifmmokkoympfkxfimvvyxxyypyfxvoysfiooyoxiofkvsofikkpikmmympsssoypossvsfpxvpooiymksmfpspovmmmmpxkvfmovpkffokixxvvkxmovkvvsykvmyfsmmovssipfoysmipfxfkoomsxmpskommxfxisvxoypimxoixkoxxkmsxxoymkkxmpxxomxvmomvmpiypsvmokssosxvpxmsofmopsysopfxkikypopivoimmxkkisxvkvokmipvisfkfmsokioxvyommmvimipfxypsfyfymvysofffykkysmkkpkkimpkpvovxpvximkoposppyiosximsmxpfppyfikxoikoffvvyysmxfpxvfxfooxpsffpyosyomkymffikpxxykyxxksyvsyoxyffkomkkfvoipkpykkkkxximsxvfmpssmkmykokyfxiisyxpxfpsoomsyvvxximvvsyvssovffvkyxvmpopioffkfvsxmikymyskvofvppkpmvvsmpiykfyssxspksxfvoxoyksisoxxfoskixvkoyyomksioyxoyomvkkkpifoykvypymkfyypmxvfxmxfvooxisiifvikffysfivvpfssvkkyiokyvmisxmofvxpmommpmioipkxsskimkovxmvsmkxmvfovysfvmmpxkxxkpmxokmpvfxipiyxkfsomixpxssspyfomvfkyvssxypovxpkvsyxvysfvvyomivyymyiisxpkvoypopppopskfvsmfvfiiyikissofkypimospvfyxmoyioioxykyvopxoimmxomvvxvsypfpyvsmsvifpfpkysimkfsksmioxyfximypfikksoiioffkfpxsssoxkoxffoppokkoiyipfxyffxikiskkfvyxsipmmyvkpsysyypmfffvsfkvisxmovxvoskxyisfmxkppoisspyvivoiimpysspvkvkfiimkifsskfyvkimspssspxyfvikxvmpfxxxxvfmpvsykmfopykkfpsiixsyosoffskxvxpkikoskpviysfoiviopikxpmvviymfxiiykfoifvovsmmfokxppsskskmofioiskmfioxkopsppoisfskfofmovsmsxkkxvfpfoxxxikypovomxkvovkfvksixpkkkofyxfsmsmopyvooyyoffspsoovkvkioifoksmsvfmfpsfpoyvixoyofvopikkxvsyvpkmpksvmpixpxvikxpofkyypkvopfmviypkikipppoyyyovkvivvxkfkyxxvoixyovivvipmpxmivysxiosvyofofysxvoovfffppkfivmsmpfspkoxxskpoosvpmxvsyysvpvoikssoimmssxmsmpkxsiipvomoxykspiypssismfyixopoxfmiyffsoxmyspypipmkxookkmopixkmmpsxpvsfsoyxyyfopkvofxykokxokofyxxxpyxmpsymoimkvypvvmppfympyoysfkyfkommmiofxymymxspvfspovoyyfkovsyiypopkfokxsixiykxyymvypsysvppsiippmixvomyooyxxmsfpokyiovpsppysfpxmkmivvoiyfxxpxkvvxfsmvvpmxspfmmxvfpfmmikykfipfykxvvyyssyksoyivxikoysxspsxfsoismkvkvooxfsypxvxxypxkypossyysfspvsmmpiomfkpfpoyovfkmomxyfxxfxpokfippifkfymvmypxxpfyvoixsyfyovpiiiiomoxmmsppkykfvvyxoykxvvfkskffvvxvofpxmkvyymosskymmxvyyooimpfxkiyssiykkffisikmxxivxyimyyipmxyxmkvvffymxfkoixfvvxfopxvposmyxvyxxovkiiifypmvipkxpssmxsikospskokivpfokmsosixsmkvksfpxkkkyoykvskoxmofkxfkpvfpisiysospfvpoyfpkpipxkxosoxfxkxmppfpkixyssspokyfoifixxmsxokfovfpxxkiikfmfyfsmxfposkpifykyxxyiofvxvpfixfykxxxfxxvivyxysvxfyyvykikyxsvofmvfpvoyyyommiifmpxfxyypovykfommkxssxyxxyiokyivfxyvippfpmoyisookiifokvvsvypfkfffyifkiyvifvyxysxsvfsfopofvxyfxfommyskkyismmysmvfippsipikvsiipioyyiimiyxpivpspksxksykmovifffsisyfyxsivosxoxyymokkyyfisxvsspioffmssffvimoxvpmxvfoippxysixpixmvssfkxmiyfoyoxsfppxvspkxmmvyovovxpxmfpmiiyvxmvikmomyosiomspkikvxkmfmoisspsosofxsfikoioxkpimxxmxvoipimkoxsxkmypvvvkxfxvpxsxxmfsiiifmyfkmmkxpvivxppsyvxofoxkxpsfyofsymfxpxkmkoipxikpxsfpipimmifsfmixxsmmsovkymomoksmpyvkvmkxoimpxyixypiosiosxpysiioiiyyymxofvyoopoypkkoyisvpixmsxfvypffyfmmfpissmixfokxvxxffmxpsokfpppymvisifxyiykvisosxxopfpxfskmspofspiyyiiovoopsmmokxokpkpxssspfyvxsspvsxosvokosppvimiyfyysximpmfkvvimpvyppvkyfskmpiofpmmyvsmmokosxmimyyyvofoiykppvyimxyskkfvoppvvssppxkxxkxyvfxypspskimimvoppymoiiiiimpsoppffmofpxsspvkfkvioffvkovxoksxmvsfkokksivyokiokvkfoxviisiyfikyooximooxypxfifxfiioviifposvvyvskykkspspmmxffifvvoyyovokooyssvvfyxvffoxssfyiyokxiikypoovifffiiyxmmsmmympixssifmskkpmofkxsmyviifkmkokvkxmivkyvvskxkopkoomykxsxkxopykovfypvmyyxykxoxfxspvkfixkxkxxfkmvksfssxvpkpoyfipkyipyymvvkovofyofvpkmyioyfxkmvksmvovsimfisfxiikmoifvfyfoikvmmpvifpyykomksmovvpvmsoxsfyppkmvfoyxyvxkyvpykmkmpoopkoxvksyksfmvpkvsikvmpfipxmyofmmxkvmmioomopvkfxsmoofypfimifopiospfsvmvxssomsiisikosvokxskimskkipymsimfkyymvkvkkfxviosxmoopomymixoymypokvkvkvspvkppmffyoksoskymymyvfxssmovsompiypvmvyfsmsmkyxvokipokpykxiisfskpkvipsfvspvxkvippvoxofomikpvysiomxfooxxiymxfvmkxxokospsskppimykoisoypmomosxypvyiixmvskvxksxykfimmippoiioyxofvvpoxkmykfxxyymyfpixkyvmokvfmxxipmypmooyymkifvoixoikkxypvfsxmfpfpkfpoospsvopxosvvvsikimmymyvosmfympykpxpkkffiksifsksompyspmmkoxfkoxxoyymsyfipivvsixmkxoyiypxmmyfmmyimmpxsmkkskppkivfxfkvikpffvmmsmkfopopsiiosxxsksxfpvkvkopovpvokofpmmvvvkfymxsfxkmysvvoomymmomfkxiyppffsyppfyivsxmyyxkkvyyvsioofxpksokyvvyokkmskyssyoxvvmiypmmmvyskxivykyfxsxyippifomyypkvpmvssvivpfimyvyikkmfioofokyfvspikooovvpoxxpyfismvmmfxfkkiyyssmsvpfvixmsiipxyykikoxfvvvxiyvivfisvxfkpxpkmxxpkpospokxspoimpfosxkovpxkpimospvmvkpkiiykiysxmmvyospkvsvpxiooskvofvpooifxkpokfxyvvofvxpvoipkmiyoooxykifxospymkypmpyxypkopmsfsppiyxxfkfsipoopxvpsymxpsykmsyivimypissppooxfyfyvyxsiyfsvmoiiokfvyxoxpfvxsoymfykmxfpxiymxvokvskomfyxvpyvpkxyyvsvposkvoppfimfpvfvosfxopsxfimkkyvifysfsoppsismopsoovkisskvvivisyymvkpismyioikvmiyxivoisfvfpivkyxokvpiyoyxmxpyimxmyxfysokmxiyxmxyxsivsvivysysxyoysoxyisivvoyvkvofxfovmfvifpxvffyvikisivyxmmxyvkyiksppkssxpxomfofmpifksvmifoovooyysyimooosfmyimikmpimxoxfikypsmxkokkmxopymsiyxpoovoxpmxokimpyiffxiiffspfymxyxvsvxsvpysoxmvkoxyvvvkvkivxkpyypmmiisoimyfkpvffivkxfpfxvofsyvfofovfifxvxmxpyyyfvmmykpimvmfpmyyvvfommsopysipypxfmxfkxssivmoovfxikissppxykioipkkvpxyskmvvsvmfspysxiivfxpkxvpskfkikysvfxppxsoxxxysfkfxyyoosmsiifkyxfxkvmyxypimyvipkpfyifiiopkvsykxviiykxiymyxffxkypioyomvsvipikfkksxkkpkxkimmyixvxikisifxpkpkymmmyvfpksfyyvovimyxxfxxxyxkxspmysskmofxisoopvipmxvipvpsossmkvmxkpivfoxmmkypvkixmvopxokoppoipsipiixymvikkmfvffoiivfsovvfifyipvmxsfsykxkymyvxoskmkvymovfpimpioiymyfikxysxkymxkxykkkivyospvofpkykyxppivoovyoosfpspofisyimxiioksvokpmpysyooppfvffpyxyvpkiiomykssyyooosskovxkioixsxyfssosmmopxpxmoiipfvipfssmmvvxymfkvoxmskkkvmyopxspsfsisoifsikfpsfpfmxkoxfppxifpikixfkppoxoyyokoximmkooyfiisovfpmmmsskkofypopvvysovfoomsovyvvvmipyypikmxyfxvyskmmxxkfivspvxsxmpvkyvsvppxvfxmssiikvfsskfkvvfkkmpkypkoyofsifssspksmvyipfxvmxyskkmviyomfvpfkxfspkmpovyfpximksofompypioofpyppvfofxpypvxfskxkvpsokooovxkpvmiyoiissxypfkmoyykkpyxsvmfyioioxkivysxyfysismkxmfspissyoxxpsffofyifxyifmppoopkmmxkmpffsvmmvopymykvpimspxisfkopoovkfopkskfkskyvvsippsvmofksxxmipvfkiyixmoxyikviiiofysvmipoykifsxvyfsfykxpxsykxkimmvyosmxxfoyskssxpfffkmvikysppkmvoisivoxyoixsoippsiypsvokfvxxyommxokkooifmxxymiymvxxofsvfffmkmyfvkimfmmmsoosppxoykopvsxyfyvsmyxxmomixpmpmifkvvxvipksfkmpppsspkikkpffyykimoppxpxmiyvfsmifkosopfmofypvyfiioofxokvikiissspvxkixkspxiymmmmkpmxsiviofyskskfvffmfipxpkmmvvsxooxfxxoyivpfpvvvmoxpypifyoxoopfyiomimxpxfkfixikkpoysmvviiivmosfiffymosxssyyfysvvyskifvvvypfpsosxoppxyxskkyfvvkviyysymfvyvomkmmyiskkvssfiimvmfxxmikimmpoviiipkymysskpvipsomsfmxvosvvkmvyxmmfpyykfpmosoxfsopvxvsxiovxypisxipooppfspxmskiyxxfmsfsskfksyiskvyxyvfisspxkyoxmmvooposyxkimxoypspvxyxmxyfovxoopxkypxyovvyffospioposfmpxpssfoopoikpvimxvyipyysymvoovpsmpvipoxmiyxvoxpmioxommmpkiivfypfpppyfoxyvkkmokkpfikiokfpikvosokyvvisyvsffxpsmyyysyoxkmxxvmmspsisfipvysmxipsmikiimpsvyvmmivoyxkioxpmmykomfmmymikkmfmipikimxmkyixssmomvxpmioiipxsffykypmfvmpfyimifivpfmifvpvyspxpikmpvssyxkofoxmsvvmfyovkxpsxskkxvvkmfpvvyyspksfpfyiimmsoppmpypkfkpsovsyxpskmspykvsffkpxffysxpomsvvvfiomyyfyvkiykimyiposfpmppoxxxmxmvykmkfpxpssvixpmkmkkipokiopxvvskxviissvmyyopipiiovpiimfmpsvmvksyxypivkixppmpvyvkivommmysispyokxvxmxkpxxysokxyxxypoixpfkofokmmxkymvxsxosixypfmfoomivkvkfiioypoosfkmkfkomfoyixisvpomkokmoisximympsmvviypfoxxpokooxvvioopkpkmkiixmxfxmxiyiokisiyoypkkmposkvsxfkivvskiyiokixyfpmpmffypmpipvmsmfpomxvippkysfvikxmyimkyyxfokpyvyvipvmyyvmixipvpopkvpiikpvifpkkviomsmmkymfkimooypspkxyykikvopmfyvyypipsvkyyfpyomkfvvvfpfmfmsxfspxfmsmmxxpfmypkxkymoyyoxyyiyfffxmkoofyoypypivkyomxvpypvxxfvoipmxoyyoxymoifvsskyxpppmmsmopmpmpkivkkivmyximvxpspmfkvpoiyofppivivfoioxvfpvivoxipsimyosskmkvyypksspfifpyxyfmsfmvipxsposyxyxvoovvkmvypsopomxyvysfvxifpooixompsvfopfsoyoxmfmimkykpiioovoykviixfxpvkvspvkmoyymkfyxivypvsopyoosfopsmsyvkomffikkopipfxxkppmyppippsoisvffyfvivfxsvvosysvssypoxvmkvmxifvpopvfkpvmsfomfymixffsmikpokkfoimpofkfmyifvpkvvmfopfsyispfpxomypvpspyokxkffiyksspspvskmoxoimifksiksmisysvkffvikxpksmkkmofpofsfikmyysxkvppfyifxoxfixkkkvyvyxfxovokoyvivfvmofsyxspmfxsmpfiypixyviipvpmxysysxixvfkfyssyovsoypvisikimisfykpyysixykyypsfmpkffxssfvififvssmipopyvmokfxikpmfspkmifomvxkssppsymksksssxvsikmfvpxvossopfvxoisxsvyisfxyfimvxfkxmkyyyssxxxxpiiiixofkyxpoksyfokkvfiipxpmfskkvffpyifmsfokoimvxvxxopyxpoyyxpovffxyviomiofxxmxvpovmsfivkyovivmppiipxsvvxkyykpxmppvmoymopsvooifvoosokosmssooimsipymymxoixsfixsiokoymkpsivfympxiyxpvfssfmovpivxyovovpfomssypvvvyopokifmyyvyfppspiipvxkopkmiismmvyopvxxvomyompyfkyffvompmssviipmskifiyffpxpsfkimymkosxxikfooxksmimxovoykkikykvokxisvkfpmmffxpvoopkmpvpxyoopimoyfovmkpvpkofxvspyskspmmpkyxifvvmfkvispmksvpfiyfkyvfkxmskxvkmssoxyfsyfpvkvskkpyvsoimkpvfvmpmkpxvfssompyofkyyfimmsypppoxoooyimmkifomokpxkymyfykvxsikviyymvfioifyvsiskysvyvyfysfpyympixospvsfpmiffmpmvopoymvfvsmmypympvkifiixkxoysokkkxpsosskpmkpsvpvpiffsipkpfpisssfioovsxsxxxysvyvokspximimxmfvxsfoovfmyxxpsmmmpoviimmofsvfkkfvkoyvvfyomkyfxpsxkxmvfkksvikpvoksfixffsymvmssvosxpfxvvyksfsopyxmykovfmvxfxiimkomkpsimskivpipkpmmyxpimsxokmxvmssomvkfvkmiixsxpkkisxskpsifsvfyoopmkkpyomyomsfxxkiiifsxpoiiivykpfiomsxfxsyxsymkookokfkmvxokfoopfiysyoimisixopsmfmissxkkyixkssvosisiikiymomypyixykvvxyvspoiovkxfoksiovxioimyyvkyivfkmfxomsyfvippyiypksmmismvimsiiypvikmxmxkvymsoofxpmyfvopfxmyyopomfiyvvmxkkkfxoppsspyopxfmxifyskifkmmksopfofyomixiovxkvfxiovpifxosiyxkfkvoxippsmpkxkpvoivvoooopoyvxivffmxvvpmyfpmkixxoosxifoikxvxfvmpmpiximfppvvfmsfxkkyvmpfyovooxosokxiypfvfsksfmssfkpoyfvxosyompisvooskvvpykiisymmxfkfivfosoifoxyookyfyvkkovsiixiifkvskfspixofyyfiiifiyyfmiosffxovmoxyspvmspfkppvmosspoykoooyvkiskofkikkxipixkkisksvmmvvyvviopfokxfxpvoxomppkfpfxkooomipmpsipxppvivxxkkifmkpskmivsokoxmsxyiykyoyfpppvssiixkxxoyopmvsxyvskopmxxymoikkfxvxmvoxpsvmmfkvmoisykxvsxiipyyfffyvmmsopxppkkfspkovvkfiimvfvsippvfsippkivovxiofopifpxxpmfpymovymsiyvfvmokommfiyyifixomsfyvpkvxfpsivvpyfspikfypxoxikkvksmkopfippfipvsfixkmykxykooopvimosvsmpkfysmspfoysmmkxmsskvmxpfppxkxvvkisvpomyompyvpspfoxspyifpikoympmvfffompfispkpysxovxkisovimykvokfppmfpvisppxpmympskvvkkivyxvpksiifpovpxisipvxkkfiyfikkiomyyppvpkxpokkipiookooopfyfsfoxpixxkkymiypkssffmfvfofimsyyxmkpyivipfpivifsipsyyxmfoskfmpxiffvpsfpxvmmxfikkofimmypfskyvfvyxmxsfpvvypssisysiixixipikpvyxykmkiommmiyoovmvppxyffiyyympiikofyxsxffysvovxssfoxxkkmkpopsvypppfykypkfmffyfxixoiokxmmxspmxypofmvkvymfovvkpxyfyyffmyysxsppvvokfkpkvkpxxpipfiiovxksvxikoisfksxiypiffyofyixovvvykspopkfxkvpysskxyfkkpppmfpkxoxifipkkfxokvpvskxspsfkffvoxxxxpsfvvfsffpvpivkifsvvxffkysisixfikfovfxkmsimppmkpmppikvxskyvsffipiopfosxoomvsyviioooiykpoioikpvpymoyffpvsvmypkpiypyoksovfpokpyyxompixopmyismyxiypmkvxvvoxpfkmffxssvipfsmpikyfxfvfivymyimixfpsmikossmkysppsxsspvppsoyoyxmykypsfmvmxiovyifyxoivpopfsmipxfxvmffvpmxiosvfkpvkpmypmpximissyvvvopimyfpismfkopsxkkpofkxyvkmximfippmommsfpikpfikpskkxfkxoxfkxfxkfioyxovixfiyyxikmiivofvskofmxvoxopikkpyvifmyikmoympkoomippoissiofoikysfspxsvsfypkfxxxkyismyikmsffmfoixofsfyykfsxfixkmsioifmyvomsfxoikvfsokoxxmkxmyoxsmmffokypfiofsmmoyvsvkpokfyyokmxpkspiyvkskyfpkiopkvpmxmxkmixymfspoxiiivvfxisykkxvmsmkifsssymmofxmyvokomyvmiivmoioimpkyxmmpmmoxvpkypoksmfmxmpopoifkomvixfysmvkpfssmyviispmfixyiyoffmvsfxsoipmxsvyvisovssmoxmmkkfpimoxioiosifxfsosvvmvookvmpipxssyoxsvmkfmofvoxfxpmiyyvksfkiyoyixxmoxopfopxvvmsxikfvpkkvyiivvopyyymivpyisofvopkkikovpskvkpfsyvmfvsyvfsmfmfmkfkfvfysskmoikxvkixysfomffkspxffmfsiivxofoyoiokmoyyssfipopkiofsfxomfvvompmiovkvpysmykkyioffppskysvixyysxmimmovxpmixykyovvixmppskipimyxyxymoyvfxffokommomysskomiskxffipmsvfvmfimvpmyipivvixpsvksmpmiskxmxxmvoxksyfxyxyikyfmymimkpymvpmkmiosxyxmppovysfvfmimfoffppkxiymimfpsmkxmfxofvimmpyxmmpvsoomppfkkkixxfipxykkooosfovkiosyspyopkskovsfkvikfmpivmxkxiipxksikpxmmkyvfpvomoviikvopivyyioykyppispmoxovmxxmovosxyymvixxmkkpsovmspmkkyixopsoisskoysivpxokxpyviixifokffmspoxpkyxofxymikvosyvsfxpkkvomfimpxkysppoyyvkiyypvvsvimpoysofmkskysiifpkyvykoomvfmxykfvxofxyvkyfxxmxoypkofixpfmipxfkikpyoxxypmvmpmxpfyffsyyppiompisofpsipfysiiimkkffofkymvvpxomoxpiyxpkpmfooxmmiookppixmoikpyopkfmmifpvkpxfvovipiimskxxosompsxkifyomvkvisiipmvyskoisxxsxmypkvyyiomvpivfmxxpfmsifmiisxmffkkyvppopmmfmiosoxpfsmipossxfoxmsppsopmosxvyivsvmmsvmmpopmkvisxfvoixvymvsffpkmyikxxpsmxxpyfyvfxoyfvokxvopyfmokysysxyxkvppvxooiixvviosmyvokyxkkkiposmikyfyvsxskvpikovxpkovkvoippvyxkssvoffvvokpoyvvxismvfxokmfkyxmoympsooiivsivypmxfmospfxkfvpymompvkiypksyfpovyiopsfimmfpffisxivkkpkspoomspiikkoppffspsoiimyoisffokpvkssyimkvskisopvpssyvsxykvyixisovoooofoiifpxfmxxsxxxpxxoixokkpxyomfoxvommpsoimpvfpxiykospxioksimmovpmfymkppxmomyxmkssymikvixpoypifkmysiymokvpmssfpmxvmkxvvxmvovvxooffmiofofpixkkvxyxsfskomspyvkopkxsyipfvsvipypkkffxxkmomkysisxyosmmsmsfxpsvyovovmxmymxypxmmyxikiskxmpifymsxkkxikvoivifypomkvxppkompffmsspyisfpksmppyfxkpkpymoykopixsxxvpipxsfxvpixmxxkvkxyifkifmffpkykovoxiiiyxomsvmxmpysyxsxokkpxovyymppmppsipypkymvismymfxvfxfvvxyvmiooosvmikmkxpvofyokmyooppxvvmmxviisivspofmsskxivpsmksmyxiimysppisoiokvkixifkspfsspossoofkovpkpmsfvmppvkvsfxoxxifkkmxmmkkymfspksiyiyvfimfxkiopkyfkkkkoxvoommyfoykimppovmooyyivmkpppoovmxkvikkvxksvyomviyisofsovssxoopxvpskffypmpvysokxfssppypkvippxpvpsysmofpooikmfyfkovvfokxiskfioxvppxpfxopyosiymxfkimxpxikivfxmvkiyvxvysiopvkvpsixxykskkxpkikymofffommifimymxipkvsfmfiyfooxpmxvkkvmmsfivpksvixosiopvssiokkxkkvyoxposomvvsfkvypsokmskoofpfpoxpookxosfpfmkyfxfiypmmiiskvpmifioppfissvsmmpvsypioikopxkyivfxffxikoifmmkimpsokoimppikyyfisyyikmvoxmfyypyypxmymkykfmmovkmfmxyopksmspfskiyfyiixxmoospsixkkspxfxpsfvoomimofokfkfsixfpmffkkypfvfoomooiymysmvipvyppfvxkivoysxyfoyvimsvxxskkskmmffpiokixvkfviyfpxivvikvfvyppxmmisissmvovxpysffykkmvykxysysokxmfmfkpisfvvxxxxivmkiisvvmimsovyxkikyyxsvxiimyxoiyxfovxypyivmvyykifsvsomsimkpyxifpfspmpipmvkpffmfpfmpfovpxvfsimmskmspsvpsxvfovkiyfmspfyfysiypkopixmmvfiisviiyvpmmmymmmkvfiomvivipokxkxmfsymisxosfyopfxkfovyfpppmvfppvmfsssovfpivmmkxfpxopoffysvvopvspkpyixpfiioxmsppkmpmyvyskokfsfmyxfkmvokvfvxfxpkssixmmvxfkfooxmovvyxvoykyfsivipxyvsmkkxiifxpioxosmixyvopxoovispoivvokpffoxiyvomimoiikvivskpyxksskkvkpvixpkpvpxoymiovsvxymykypmxykpxviyivfkiyvfmmmsyoxvkvifvkyfkkspmmffvxyxvvxkyipomoymvpimfysvxkpkkiiioipxokxxfxvvxixkoipopkmmvoskvfxpikpxxxvkkykxikpiooismmpmykosykposxmmyxmpismsoossfkyvypiiixsyxmsimffixvkipxsfvvssmixooxvxiofsmssfyokisvsypxvvxyfkyfookiikfxmkmxfxpkvxspyksoffxmxkksxkoofxmxfivvokvppvmfvyikmksyxifsvpiommpkipvvkkoipyoivvsmkmoyomkkofxoimvpxkpysffipiymfiikmxvvmsvxyyokkmspysxxyxpxpkfyvfffikpxopxffmvfkmpfvskofsyopkykvxmxmkxksvxxfopkvikxfiokssyxvpyypsxomkopfosikkkfyvopysvfxmosompysmvffyoffoxovyyifpxvpmfxvikfmipfifksmmyifyixiyoopymsfofpvmxiovokvysxvyoxiyvpsykyssikskokskpfpsyffyyoivmsopykvvfovsmpkvimopfxmvvosssvxppxvxfxfivivfmvvmvoxfvifmosxmyiipmxpoymmsfffoovpikvxmkvivmfvpkimximpxkfyyioikkkifokppppisvxippyxvpyviikyyfmvfipmkfopkoisipxoppixpxvmpmkxofovpkivsxiixvvomykokxomysoyfxfkovkxisfpmsppypmpisxfspvxfimkpykopopispfyxkivsommpvisfmmkiyssixspsyoksmxxxmsoooimvpxkookmvfokioxmkfooxkfkfmpsovxmfsiyifikxiomvomysyspypsvpsxykvoxopoxsfxvsvfypkfopkpxppkvfpmvpvsokfpxsxsxfxsppofxixfxmkfkyyomxxkmsmoofssxxsopxoikysyikpypkkixmmkpyvfxxymvysfkvvssysoiifxxximkkpkmfvpsyyysofmksmpiysksvyfvmpvipxovfkfofmsyxmpsxyvpsykxxffifmkmskvxiioiyxyxmooyykxppfyffofvpkxymkxmkffoxpskomyffvvpfpxvypvkosyffskvvxvmiyovoiypkfxsivksoipimymmvxikvimvikyviyvifmvmpvxyskxvfkfkssxiyysiypysokyosippysyxxkkskomfypmsspkfoxxfvkxpmpiyospipfyiiixvfyssyyxfvvvvopoxxvyfosopkifyyyysyssopoopikokvfpxxyxmfooixsvfispiosfpfvfysoxfyvsiyxssfsykppmkyomsskypvikpomyoiymvmspvmpmpkpksmvyivkfsfmpppfyoykpxyxpsyfypmpyfopopiopfixpvfsysksopxmvokfmvkkmsmivykkyosokkxsysymxyvxmssoipsoksiimivipfpkmsiikskxpkkopkpppfoximpyoipxiymvykkkyommyskifiofpmokffiyommiokkxmymmvikivoffxfixkiksxiovvvpfyopkioysospmvoxxiffippyokfvppfkoxoixxksovksivoooovifsfkkokvmxiiipiiimisispmfxvmooppmivxkskimysypmmvxmvpimsfykvskfvxkmykiyiskoxfimfkfmkyyfxxyvskixsfkyffyvisypmmfyvxfpvvvfvppovkvkmvyoyyfpyoyysifiikssifsoovpsfypskkfyxooioivvkmkoxxopiipkyymfpofpiyvksivismmmxxmvsvofyvymfvpovxiikxipmpkoifioovfkxvvyppsfpimiipoypofvxookxovvmmxxofsykyvpokomxvvoopoiyxkmxsvmfmiyyyoixixpsyismoiovsysxokkvyppyffvfppykosomssymppvpmkyofifxxyipksvofosximksmvsxkpommppsyvpxvyxvmkmmmykkopfyyompkvvsiykikkpmvmxsyssfykvyxsypmkoopkpykfiokfpisfopioifoxovipfskmkmvkykvyiiiiomvyfmsxpxpymkvpkiokkyfxyvyvvooiikiikysxmximsixippovkpvvpskyomvovkvxmkvfmymmmffovsksssofkosofvikiiymfoivossvksmpffiyosfmsvsxpyfyxiipvofyikpoyixiivfvffvppysipoivfosfsoiipsivxyfvpyfmpixfxmkyimpopmvxksfmksfxyxoysoixkfkyisiokmosisvoyvooikfpsfssisiofxympfsspfpppikvfokyvksvssfxmpvsvmmsvfopxsxyfiippiimoxmkkokmxyskykkymomyiivomfxfisifsffpkopxmfmpkpfppkxsvyypovkvvmppskysxmimfxxixifmpmxmpsspxsyfvvxpvxsvskpsvvypkyfmvyvvkpvvvxofkvovxsyxpkfixivppisoipvkpoypiofsiompsiiivsvsoppsvmmmpkiyypyvyoopxmxvsyyvyfppmfffsyopsfxvookisfispyxykyoykfikpksofvvisykixixpvmxpmviympimvoskyioispoixovvykfoyioxivfyimkkxkmipfpxipfyyfvfvxkisoxvkoxkoimiyxvkismxvyfkopxvoympkkksooppffiiiyfpipxmkpvffvvxkmvmsiyvisvsfomoxxpsmiifvksoiyfvompkvfkvmsokyysskfvyxfxovvxvsypoypyxmmyyspvsypmxxvpvkfpiipopskmsypiifyiskxvmmkmkxfvspmipyfpmfykomxsovkmkmomyiymxivosmipsffxvfsmfifvpyvoosivkfoffiyyfmyoifisxsvmfviikvfvmsppiisixfsixsfyikoopypvvpvmokmmsiyovkovvmkivvovpxoopskvxiofxffpvfosykkkfpvskikyyssofkvmsyiofvypkvsfpkfofxfovssvvymskmmkypxisfmoyisiossmopvfkysoopifvssxoysspmyfmmypvmvmfkvipfmxfoypfmmkmxixoxfkkooovofopxvmmsosoivsxmsmfpoofoyikxsovoiykvyxskomosfkxfivpmfyyvpomvxpffmsvimvokoofyxofimfifyoppkxmvfmxsyivoiskmikvmskysivkoxxvoyfxsfiovsvsssksfysioviiyovfoofsfmsppyvfmmfppsfyoxpyoykxmmpxppfsvosipsviksksssimfkvxvsxmvvvpxymossvxsyyikxpyffmfofmpikppifysxkxkpopxofysvmxfyvsyppfspfvpxkvxksimpxxpkxmfiyspkkiykpffifykfsmoxiximspyykmfpkyosyymiyvovvpfxskyxvpopvmsskkopifkmkfvpkvpksxmyvfkkkmspvfyksskkmyoovvikkixpmvisysoysmskkvopvyfyixmsvoxxmfsxyoxvkkvpsmkmfvmfifmiymvkosoppvpxfkypoppxmvoiiyokfmisovkysoyixoxfixkopyvxvfvpmofmifpyvvifmosvopkfpkyppxoyykxmkmpoyspxxyvxxmvfoypyvpkvsiimifviyyiyiyospxfkpmyxpikffvpvpkpmvikvyyyypoyyxkxyskysisoyxvximiikxxyikviopvfyomsxxymkyoofkfsxffiiixsoffkffxpxkyvokmiosxyxyskmpssypvpikkmxvkmxyiospymmyyfovopyoixmksiivokoyikpiofmpsmvmkyxvmsomsvmossiivxfiiiskoyyfmikpvksiivpfmiyokxsxpkfvoykmmiovvkkoxffpxvikoyxfsxovsksxpymypsxpxfpyimoyfvxmymviypsxopifxffsssxsfxkikmmosopkixovmikpkkfmifmpppyvfovkssvpmxxfmkymxsiopomofpfyfixpyfpskopfmykvvppfsykfovoxvmifvmopvympspkiomovkmfvsooipkxokxsfmpkkkiysvsymimymxpvvfxmsmmkmymfkxxmkyfkysfookpyimoomomvmppssipxpkoffixxkxkmpxmyyovmommikmkxossoxokypkivyxyipimmmkfxxiyfofkmyimpymppspkpkiksypsypyfkpfksxiisfsyposimpvskoypkpppfofmypfvisofifkvimkspysivxsmpffmkkxkpvsoiypxoyvismismopmpifymivfomovmsmppxmkffvsxsoymyiyfspmosiofpxyxpoxfofmkpvvkxkkpyfivkykosfiiymfoyymsyiskyffvosmksfpmopfpkvipmksvfxsyskkkoifvmvmxkfimkyxvoikikifmokpvxfixppyfiisvvsxsosvppyvsmpmivoymkvpoivofxkfipoyvipikfkykiysiksxxkffosiffmxmmyosyffpxvomkkmippmoovmxfskksmvoipxpmopfspfivpyxvkmoxofikpipofmxiyvmmsoimsypxkfimiixvmpsxpyvmvmkviksikffsxfmxfysixoxisvmpmkxksxosvisypifyxovyxpvvkvxmkompfpokokmkypvppiimpyoooooffpiokxyysmimxmfimyopoypixiofykxpiyixvmvoxpmsvioxpfsmosmmspvkximifxvsmmxxpmioypokooyfmixxkpkimmfyfxiskxifmkfokpsfxxvfyypimsfssykxmxpfspmkpiixyppmkypyxmvmixxmxvvfsyxxkpixfpioyivkoskxovoxmpfvmyxoiyxoosvvfpkvsiooxvyxpfksfpxxykyskfvfpyfxkvokpxkfvmkmpvkifxxkmpkvmvioyofxyoooxykffxfvyioffvpfiiiimyifpxmsxoxyixyikooyxfpvfmmypofooyfspsxsxooposvxvfvxxkikkkosmmvykfkxxxkypmvfyvkyspkkymfpfpfssypmkipfykvsssvykkkyfmfxxpoikmpmfxfvpksyxmipofixysomyfvvskypkykfkikissmyxymximiksvmmokxkyimvvfoxvpixsfxfssfvpmyvxpvpvyxkyvmyvmsoxykmysppmyfsoisxfsxyofkspffvsvxvsoopvkiimpssosixkossisfsmisikmppoyoyvovfvpskpiysmykixoiixvpiismxyfxymiofppipvkkixvpmxvfmypkkxpksiiismyfxspxvyvvyvxvvsipovkfkifpppmffsofoyfikifxfkyykooopvoxpoopmyikimsxykyvkxyfpippiivoypikykvpxmkkvpksxifvivimoxvisxxoooikmfmpokopmsfvvpkmkvsfpokpmyivikmokyovkxpopkpoiypvkxpoimsyykkxovsykkxxvfokpkixoykioysxpmsixmfimxyfffsvxyvsikoissikvfpoofomovpkppoyvysyyivvmfixooxxypkpvfyppmvfifmsfximkmsyfypsovskmsymkxofvfmfsvxivkvmixoooifssvoipppxvofvmksfmifviosmvpysxmkximvxpkmfxvpppmmssisvfpioxxmmsoxsfmmmypmiiyfpyymkvpimkiipikpxksyiomsvomyypvkimmsyovfkmiivsfokifixpkipmfkffxfsovpsvsyismmysvmpiipiipsofyfmfymkmxsxikssfkfvpxsmxiymimsfisskyksmxfppxmfovfovimopvsyskvopvovpfmvoymyyimkvskxxypyfpvmmfimixksiymimyoiykpifxyisikffxkifpoiivksksivfxvkpkyvypoymxvsvxvvfmkxvxyiimskmmppvyivymioyyksmiyppiyspfkffxvxxpxivvxismfpomppvkvixyvsofykifyoosfmkimvxkfkmiypypvoppsxxixkmpkkpyvppfiioiofvivxfmfifypmisifovoyfpfixymofpvyppoikxmyxxkpvyyxypoykxxxvompoysfypypfkpvvxsxkssikxvmpvpvfmyoifkikoxfsxvpspsyyfmyooyfkpxmmmkkopykoxpxfsisvfvypmmsmkvypkofpykxkffmmksfmoxmyffspxvyvkiypfmykivmiimskvpkmpykmopfyopsoyksoyvpvvymoyipsykkpiippoysxyvkvfksvvixxiiifkskykixkviompfkyskkmfisyfsfovkmppifiyppovomxvsyviskfpofspmypfvsyiviiysyvpmssvixyikifiypvkvopxsmxosppoxmisxksikspiivxxsppxopifpomsssofofpxysfyppyoyxsvimksskxmfovifxkxomiykmofooikxpyvyfvifffpmvsifvfpxivixossviokvsmfsyvfoikooiivkfpyxyxoxoovvofvifimviipymfmimpsfyosfsoxfyvfpypkfffovpsyypxvomsxpvmffofxfxfvissmkxsmvyysxfxoffxsmpxffxmifvvimkoyifmykmsxxxmomvkisvfpoxkvkovmxxokifvkfvmypsvpofpsvssyvfoxxvsyvyoiyppfpisksffivsipfmivysipiskvxkokpxifsxffxykfvopmosxkkvyipivxypfxoyvyfmooifsopxsmomopfospopifvymvfokpfvymiikmmmpvmkmsmvkmksxmyvykpxymxfxmixpiiivsyysfmovximxsfmfmismyxxsimiyfxypxippspxooikmokkmsmmffkspoxyyvxpsofsovvxofmpmfifkvsiokpkifoipmvpxkvyxpxmixpkmyifkvxmyoiviffpommfsfiifxsmiimmymikpffpfimkpypxmkmioskokokvkksvvfmpffosypyiyxiipskfkkfmxspkxikkiskfxivpmvkyfoimvyvifiispspvospmfxxspxooooikppoovsypikfyifiivvxssyopvysyofxyfxyyffvvspomymosppsovkfmsfiokisivssvvimxxxksomxspfiffxfkoxivyxysoiofmomykooikypmsvxyfoxfyfosifmikyvpfffykvpkvsffviivyixvvxsimvpfsvpkoffxxyykipffoipxvxivvysvpmkssyysvpkymyxpvfiiipfsovsmpiixsyyokvyyksvvkiispvpfsxmsfximpsfvfykysxpfoykfsivyxssopxmxxpmoimypyfpfkkyskofvkopmxxsmyipysvpmvkyxomxmximkpovvivoosmkxfssxsskivokfiyoyffiykixsosiioksmfsopmxppxkyomyxmfsffoymkpokoopkvxkxvikfvsopfpooosipfxsmpopvyskmvokksxixvxkyomoyyompyofkmpsmiovvpioyfpkyvyfvfoyfxpkimvpssmmymsyxxxspvxksimkyfffmxmkposoiiymxxfyfopvpxviipovmfskkifxkovsskmxfkfpoxvisyyskvxpvmmfioofxismxyxipyfsixfssxsosfxpsksfvxkysyvvxpvxoxvmxomxiofxvoxkfoxpiypospmfvsmoysooiffpkskyipxomsiyofpmipkpvpvmxfysyssimfkppimfkmmfvppksssfifpvppixyyyifviyvpysyiyfvisxxyikvpompyfymkvvvsvkokmippkkvpixfsksopffpmoyppysmssymvypxpfsvospivfyfmsvmppooxfpyiymxkmxpimykxvkyxfpspoyxxpmxvmxofsiivfsiovyxomvxfpyfppkmvxvypifvosxoyffpfymimpmpfofvoomvvsiximkxspmfkxmkkysfymiopxmxfimfspxpsmiyxyomoyffmfmfvsfxykpkpsopxmyysxiyvyypkykkfsomsiossvsxikovpypyykspvxpvpvssikxsvsovvvpovviisikpmsvpyosomkokiposmymokoyfsokfyyifxxiipyxkpovyvkfsopfkoifffxvxmopfyyxsmiofvfsfxyooxfpfpxysfvpfsiskoyvpofmxxssipiisivkykxpsixfmkmksyoyxymvpoxxyxsovxsxymiiffxyymfxssmpxxykpiikiiiyyiyimsvmyypopfokmxvyvxmovpiosffxykxmmioyxffixmkimikffssyoxvsymovioksfiovooooipmkmvvsfopxxyimmfyookmifmssfpfopmfyxmopxkoivikimxiivmyppsfsvpxsvffopoovofioxysymypxkxifvfofsmkmvixfskkmmpvyfffymkmvvpifispxmsiyvoifokoppimvsfopxfxmopiixkmiikfkoimxkskppvkvfskppskskmfmmxkopmffxyyymfvkxxxmiffxoomvyfvofkxsviyxsmmffiyvfsvsxmspxpmyiviyfxvvkpvxmkxfxssxkkyvkkvmsymxomxxfpyiiopxomfsympioikkpfypkovyfysskkppxppoykvkyoymmsyvypoioymoxpxivkmpxypxkisifyimpifpkxyypfmyvffoypsyxxoipyffsoppvkmmyxkkppovpsmmsfimixoxyooiyyipppkvyxpvfvxpfivpmkskkposxpfkomvpixssvsmxyfypfypsxmixvivxyvmfkymspkvvoyiifivssofsfkvkyxovfyompvpxipyfskfyopxpypypmxvxyvxsivyvpyykvvkksfpvkpxmpiiooxfmvffoyiykfyvsofkvxiimffvmfxsfvfsxxmvoyoooiyxfvssovipxxkpipifmikpksivmysfffksiikskmyisimiimfmispvkkfsxixppmkyyxikvmvixkimoxfovfvovkppkfpxsoxikvkxmiomkffyxvxfookxofxiooopxpkvsvkxvfpofomypsmkixmkmkxsosfompvofmpopkffoxmmmxxxffvoxyyvsfpfxfyioyfyikikovxmoisyxyyyfvyimkoxxpivmkoomkmimsiymxiyokpovssykosypmofxvffiooksvkpsovkkmmffxxiskvovypxkvompyypfvfxfsyixvfivopykmxfisofoyppvfoyyyoofxpvpyofyyvfyvsofsvkypisvxpxipyfoipfxivommooikksxmoxxkifpkiksfpokpsoxkkxyikmkkffvfmksiyiyysssvkpmfkpkfoxyypiixysvypxokfysmixpoypxmyvovofpmyfvxxsfipvxvpkmmxkopkypksmxyosoxifsmffovkxfpvvffmikoskisissvkopmxspfxiyoymyxpskxiiiyifixmvofyfvpmmisvmpyyvimopiyoxksvoyixxvpvofkvoxpsyfvvkovyvoyismpmsoipokiispvkxffkfmxypmvimivvyofkfsoispksiopfyfykiyyxyvvppisfsvopykkfosxfyspfvkfyykiyfymfyxiyvvokkxmspvsfyvvfskxmovmpfxkypkoppoxfivyimiysixsvovmisxppossxsfpxkkmpfssmxpvsvmxkkoskxpvipikimyifykipifpokfosikoxfsfioxpkmiiyyixxfvypmxpkiookvspyfmixfvkvfyxyfkxspsvmysoxxspspivfpmfvipimpmvykkimopivfpkfifovsmmmsxopiyysssipikkkkivffvomvoipfkimpxpxokxpsyispvxmvmmmfkyykpmyvoifykfoivxkimxpkyxysfmfxixsimiifkmfoyfpkfkskxkvkmfmmsfyxvpopxfkimifpvfosixiokmmvvmmfvmsoxyvkiospxoipfkkvvvypivkpkpxfsiissvpfvyxmyfmipyosksxmkipvooviopippsymikofmvffyvsiivxpmppopmifvvfpfxyiiokopvikysimimyfmymomvkpixfxofoyxkvipopfvysfixpiimfkvifvkoifxpxspxmkpkyvmipfpyvkmkoypyommkovpskmoifpyximkiiissxyxvvofpixvyfyoyxxpvsmokvvvkipiifoposvvpxfsyykpfpxfkpxkoyfyoivmkyoyfioofvfysmspsmsyipkmmxpyxyiiximyspsopiokpovmsfpfpiiipyopypvisxyvmykmsyfxvpofvxxfysxmmvvomfmosomsmxofifomoyppxmosiymfyxmokysoykyppxkifpmpkkkpkyifspfvksymiomiimpvykyssvfpfskfkivsxisviiixisvvssvsssoyximyxmpmkffvmyymkopikxypxsyosmvxfpfpyovfmxpoymkiomyopvimkikioppvppspoiyvioyskosyfkvvmkfpkipooyssvkomffxxkyfixmfvyvyvipsyysmspiimypfokvyppokpvpymmxvvmxyfkkksivosmsifmmkfvifpkfpiivoompppkpyksyikkipxfxkosmkkyfyypsxyisoomffvsiisixfyfxkpimiofvpiyxfsyxppimsvpikyysfyxivkvpyyyxsokyvypmmvfmvkpvsmpoxixsfokkivokmfoyfvxxipvkpomfyvxoyfpokpyvsifxiivskfxfmkopkoxixmkyispifkpsovxpyvomfvpkkmpvvxxxyvxsxyvmfmymyxfsvyxpomvxkviopvxsivpskimvvopsixyfviioxsfyommssyspkimkimioxfmkssopxsyosismipomxsovpsmsmxkkfsoyfxmymvyppkyxikffvmvpiosmfvpfvixfxmomokoxypvyifomviksmkxssxkkkypofoyfyokkfsxpfpvsvoimymykkxffsvkkimxpvvxfspoxysvkyipsvmxvfokoovfoiimmfkkkyoffyfxxfsyxiskffvvyvkxoxosiimvkxiooxxmppmyfiixksyiimmkoiosikvivymvvfsomfykooyvfiippvkioikpfomkspfvvssofxfxsovkoyvxxvvfxyyffkxioposkmyxsmsppopyxyssvifokoykokspkimfyoxkxfisxfovskvookvofivvivfovkkfkxyovxpxskpmvkikmmmsvposskpsopoyiimfipppsfsksxxmviisfmffpffommpmsffvmpvpmkkfxompsypmfivfsxmvmkookfxkkmxsvypyofvsffsffsvsxvkyvskkximpvvpxoysymokfsmsyfxximfkkfvfmpyffsysosppfkiyvskysikmsmvipxsmsksoispsmkkvskpkskykymixpmvkyiffvpmvvmkopmmkivkkxsxkxppixvpfovxipyioofvysfiyymkpskpififssyvvvypskpxfoyvyxxvpxfmsykvsomkovfoopsyfmxysosossmoiyypksmpvxmvpvpkksomfixoiypsmsfykfvvvffpimkkpmposokvooxisssykykpxfmoxpxpfmkvppokxoooiykpmmspxsvkkkxyiikysyxsksokspfpsmvisymofipofyykkofksmkmikoysovioivsoxskpmffosokkpomxvmxxsxfiopyfymovffokysyivoifxfksovpysskfvsssfpmmxyxipsmyopfykyfvyyysopvyopkvkpikmxifovoofkpimiskiovsfpfmvpxfvfvpvpmskkymoxskiopsimkmfvmvyokvyofpxsokfokfkpxfvkkiffpvoxskoovpokxxifivfxpixxkxsfpyikivosfikispomoffiimopivpiyxxffvsxisxmfxipvpifioksooipmviikxypivioiispovyfmmoxfsmmoifvippovfysmkpspvipfpxppksvpvvimosmmixomomvkiivsokxpsikxoiofyfivxmsopyfimpssmisiokvkpvsoivmspmkmmfoofvmspmxspisvpvpiivfsfkkxposiookfmxkfomvxsxpfisiiykfxvyxvykvfxkmpkfvifxxsimxookiiiyxiyimvxxyvmmpkfsxysxomipkkkfkpkpokmyvkimivkpivxmiimfxyyomsmfvmkxxfpffomkxooixfmvpmpxovifkfopkofvifkvvoppmipkvvoisfmkxifmoyfysvyysykpomipkmxyfixvmoxmsokmimmyyspfsmymkiiovkmokyvikoffxsoyikxsmomvykkfvpikxopypfyyvxoiffiifsmsmivkokfomyyspfsmxomkifoikxxfisxovssyfpvyosfykfxpkkooxooyxpvivxfxsxvkfkfxixpvpvovovmkfmiovymsymippiifpopsikssxmkxifxyvsommsvfvyfpxsyvxksoxskpsiyisvsvspfkpvpvfiokpioyosvmfoiyismyypvpmmyxokpxvvkixksmkyvpppmoskfsiymmopsyikxmmxyiofisoskxxyyvsmpsvspxvfvspiiioposispopxisioyykmsyxxmfomyvoiksypypyykyoxssypxfkxmvfpomovimskiofkpxvoiixxixixmkpfpoypxmvsoiofosspsimvmsfmmfoxivxmypkfsvxfxixipviipiiyyxokvkpiyfmkisyyxkfyifsxppomvpsmsypkvssyfsixvmkosvpvpiypxpkymyksymfvmkyxmsfkmspvisykofyyyxpvvoiokvfsfvxfxffvoosvpofvvfxkvvfxsfsixovkivkvopkvxfofvyxvvsxyxisovysxmimkxfkvymopmyxoyoixmmkvyfkoxxivoppipfsymiypyvikyokfvvfskvpviiikoffospisiooxkppfxxpfxskyvifxxyxmvvkfkpokkxmfpykkxfiyykvsfyfopiipkofvoxpmvfiyviiyvpovsffvppfskkvkmmvxyimvfomxfyosiyvkossvfimikivxssmysiosmyivisxmkvkpppvxovxxoxssmossmspsmxoisppvfvfvfpyxxppmpfsovkfxyxvsykiimvxkvfomfiyxfxvmpfskskfxmkvvmvyykyiyisymskmofkyvspxsxvpxkimookiyovyfpookoffxsioopokikmxipsomsifskfpivoiimopiofkkmfffvyvskipsxkypmvkyovfvyspvxkyvsfkvmsykoxmimoxmxsixpxskxypfkkosvipyimovopppmspkposxmpokysoffiposiokyfifvivyfmpkviyxipxxivpfiffkxxopookoypxpokkkfsmofomspsvyppiomopfyvsyfymvffkoixiipoyxkkoppkfikkipfspvoosoyfpippksoxyiyyfmimvksxmsoofsvxmvvsssppoyymoovmskvssvkvypfypiskykmmypsppokpmspyyysmskomixpkxfmvsifmmvmkpfooyvfspvymxmpymxsvmyyiyfsfyipkmfxfvyfssvxommyimvmxfpkifxvoyoxxyvkskpixmisvysivvvvkkvmimkomofvkvyvxssifpimyskppmyxmkikokopopiimvkyxxokvsfxxpsfipvoxxifxyvxskkksisypxkxfkifsoxpsppmipovxmyxmfoisioyvxmkivsvvspssxmpixmvpxioxkvsmkyiyskfsmoimvvvmmpmpvivsispxfpfsfxxximkkfpxspkfmpyvmfxxxfxyoppoxvsfimpxpxkyyomspkoysvskofvmypxfyofppoivopooofxvfykovssmoissvivxxfyfkfoxiipfskfsikxsxixkyiyosyvkovkvivkxkxffvvvifmpsxismxymmipoikompmmpmxkypysivfffkyffooipxpfkovyokisxifyfioympfmyxfxipksvkpvvssypixokvsksmykoivpspipxpiysoyxpsyvsfiksoypkivvfksvsimpfmvfokypvppvsvxvopsoosvfiiosxpfiyvfopomkfsmisysykvmyyppkyivmvoxiiixommommxkxkofypvmvmimsoyympkxvkvmifyvymkssymsyifsypyioysskfmfiikmyyffkxkkpfsofpiifspifmosxisifvkkivkisookppxvymsfmomosvsfkvymisksxypovvspkimokooppmkivpffviopikyoxikkkpvofvxxmfvspvmimfvsoisvmyyfxiixpfympspyykymkxpvpvsyyixmxxmvkkpyvsvpkvxoskkifxfovmsfykvmkvyfvixsmsssimyoyykmismxpvfkyvssymxxfxiommoymkviyypsskspvfofsypfmviksfsmixivsvvfkvpspvvyyvfsiomkyifypfivipyvopmpkvsymppfiyyimopxfvxxioyxmkxxfxvvpyossipmyvifksfpxifivskxifmsfxvivfxivmvikokfkfpfffooisifosiyyvpkpfvpsxvkmyokfximvppsxmyofifissmmmkkyxfyxxsypfskvmpfxvixsxyfximkfxyyiyopoyfyopppmkokvmymoxkyxxyfpykykmiokkvsvkkxsyfmpsvfikfikffsoivmfimpmsokomvyyiffvfiymkxyimpmvpxyvkspvmvxpixxxfksfyssmxixpvxsomkmiyosxxkvkvyiipsxsxmfopfspxspsysoymypsfsmxfooviofoosvopvkfixofixxfyyxikovfyysfkiipxmixvkmvmssoimsxpyfxopxoioxsmxsixspkvomkosiksksvmyopvkmfxvyffmpyxksfmkpvvyofsxvfksyfmoosxsofkofompoykpisvmxvmmsofkfxivmioysofysmfvoypsifmosixyivkxvpofpovoyfompkkffksixvffffxfvpopkfyoyopsvpkpyfokmypmsmssykppkskixskpyxomvxpsxkxpffmykvofsisfpmkipvvfixosxmixmpmosffkopvmfskvvymkyivfiyossmyfyoykoispffyvssmsxoxvxxyfyvpomfysxyyxmfvpsofypyfxifkfvssvfipoofvviopyyxxpkifviomvymyoxkfvoyvfoikvifmsvvissmskksspfysxkififyomsxpoyosysssmvsvvoppmksvffivsvysyfkmsofkosmosiyfmkvopxyvmpkmompfokxvvimximvvkopixxsfvipmsfvvifxfoyxspmoyomyvvyvxskopvpixvyioffomyyxfiioppymffxyymmkyvipomkmmmsmvmyxipxpooxoxxvxfoifmxyovookyipoifxvvyisofpxfypvxmisxmoxpxioioxoipkiymoxyyxsiixyfpoypixxoksokmpixyvxxxsympfxxvfyxxixpfopfssokkkkvmyivomikxmmiyimkvkoxisixxypovikomfikokfmxvkviixksmpyvxvkvkvoyosofmvivisyxxomsykvxoifvpxpfsfxkpyivxxvxfxomkfsfssyxfpyfifvpvyiopspspvssysfipxfxxopiskkmvvpymkmomompiopxvmysipxmisfskkikfkxsmsfsyimsvpfpfiiofkyyssmopxyoosoyvxksxkoyovysfvixykffsvfvypkvfykiymyixokyvkokvisvikoiixpsvvvkyxkmvomyxkskfoyvsxpiiyxspoixfskimsyxoixmsssyksyppmiovfmvisfskmmfxkxykmomvpfopviifmvfxpsxfikvmssfmymixisvmmxofxfkkfsvomsffvkysvosvspxvskxppovfkmxsfmpvvxxiimfpmiixfoppvpvsysiykiffimfxykovimoiioppkfvpfvkixyxfxpkpmofykxvvovsyfxvssfoxxsvoymvkomskivopkkopyovfyfipkfykvikkiyfppfifykoyssspfysyykikyspviopookvifvifsmixosvisfvpikovisyvxsfkmoxymxxkssomxopfyympkmsviyiopkvoposyvkfsfxsypmfxoiomysoiixvossymovisisyokvpmmmxyvpsvyvkpxpipmkopvysvoyppyvmysifsvspssfsvsovvppxfxfkkffmixopkfpixfyxvkmioymfikyoxmiyyomiysxpifyximixvvpxmkfpsxoxvyfpspkvkiifkxmsommfixmopfxkofmomisksvfxmkmfiovykoxxvxiyysyomyiivfmoffmvkiokmfpysmmmoxxiymmvfsmoviykmsmfxyokoypixyyyxxfiyxkkmsokioifppkvkopxxixxkopsmksooixvxpsvsvvpvyvmifvipmvfsopovkssmvyikyxoysomymskvkxvyfoixoksfvyppooxikvipsxfmyismvimkpvmyipmmmisvxoffyspyoffiiomyoffipfppyxfkymkmmimmfoxyppxkvkpyosxixkppxyxxpppiyvmikfvoskfkfypmipvfkikmimvokyopissyxpmkifsmmmoykkovvppxfpyyyxkfsypkyvfmmfosokyvypospmkpvkimmmpvvmfiyyvoxkxokfmxspyikfvsyoyvvsxokvpimkyssxoxfisfkvvpkkosyomviiisvfofiymxmioppfkfxpoxixfoxosyixvpksfkyyksfimkpvisxfkfffokmmipvmkfixmfkmysykfxmmsyyokosyopokfxvxpmivmsmsymvyoofifsyovopypxvfmisppxokyfikpmpioyoomioymmxiofiiiimpyxixipiypkvyxppxvmmiopfvyoookmpkspmyxsvmpxxfkfskymxpmkvxsfmoyxpyvkmpsmxsxifpmoxfxyksommomxxkfpfikvisiovsykxmvffxyovfoxsxkosixyfxsoyfkxvvvoxfyxivsmvppsmviyovkfiksosviiyymoivyvyvpvfiiypoxyxyvsispsmyyixokomsvvffiyymykxysvkmsspiimvxofoxyoovxvpikmvsvfkpmfmpypikoomxxsfvpxmfpoyosfvsfpfxikopipvpsyyxkvsompsifpxxfkykyfsmimikvopyvfxkskvpifxfixxvkkxypvxismypmixmpkoopfxoxfspysfkfoyxxxmfkkkipipvmmfyoisykvmofokyiivymxyompfxovskfpvkkfkkmvipxyokyffxxvkymkxpyyxvooopypkmvvkkyikkxkvxvovkmsyvxfvmpoofxpfimmkkkoossvxfovmkxfofsovvvysiskxffivsfmikyivxvkypximyyoioxvxxkkyvkxiviimvypyfympvoxfoxivxovkfyvyfyipymfkkmxfksfpkfxmosyksiimpvspxfyypxkvkpfksxfoxiivspoxypskifkfmkymxymkfxpkovxyixopxovixfxivmofsyosfimyfskxmmffkmooyookkfipsvsypppofvmkkxxvsmipyxxvxfmixmppixfffyifsviiivkfpvvfpvmymsxpfvvpxpsyyoxmiypkmviifikvosypkppsmvfmksxyoyoykmvmosfifxfiskxiymkpmkpfxyxipssyspykvpfvvmmpiivoofksmmvpfxykiovksosxxmxiookpmppksyxipkyimvmkkxfviffysmvpfkkfymiifpsvvxvmfvofofmvkfvimoiimpfykiimiyomkmxvoxyofpsopimovifxopsfpomisssmpvvfoiofppfxposoiippifyokkssfvmssssfmykovxpsssxyyisoypxskmkfiikkfmppxspkfvviikoxpmfsmvsmsmvxpsomsiifykifoikpsfmisskisoixkpmpkvfokxfyoosfkxiookyfiposipyssfkfsomvkkixykiksppoxoiiiisimfyxpfifioiksmikoxfifvksxiiiivvoyvfpiooikpmyfsxkpoxsyfioxpiymsykppmvoyxxivikpfvyspkkvssxmfioxfxopoikkympvssxyximivpykffyoofoovvoimskipkymofmykyfmkvmoppkvmvfxoosyyysxfvvomfokysivxvxmkpkyykkixppmopfooxxmmmsyxpspppvmxfyvvovkooxymoovfkofksyfomkooxmomfpmxxkpskssfppykpkkipypppyskoiykfmksspoyfiyxyfyikfxysmxmkyskvsmivkismkokpioffimimkymifixpiiifykpyfmpfooospfoompkmxmvsypvkomsssmopkxsypspixmmxyyopkvixookmyikmmyofkyovxkfyvppiisxfofmfmkomfffkpiffymfpoiovikmppmivyxmxkmvoixvpskiipikxvmsvfmvookxpysysmvomkmymfkmkoypfymoosoppmoyimkopvoyfmvkmvvfkfvkkispiykyissiopmoskvxpmyfkoppkifoikxxfpxmspvmmvpfiovxysyxpxxofvyvfoixomsvisxxvoffpsikfvspysiffkokmyxpkvmpxxpkosskfmpisoymoifvikmvivopvkxsosykvxsmfixsympipkmyofpkxyssfmipkmmffmxvmxxsvikmmkvfximxkvvovkfkfmpyixspipyxkxpfopxisisxiyofsfopkxiypooykpmisiymfmpmfifvppyfisfpiyxxiymifxoofoimfoofvmvsikxsmvviysxsvsyypvvovyvsfvvxoyxokkmxksxmvyvmxmmxiivpsvipxifxiyssikkvvxxxpxoxkpfpyofyyfsvxiopmxoommvmxivxpmiivysvsmsfpoxifykoxffxyykpyfkpsfvxfysokosyxxkkykovofyoksysvkyfmxkkipxokmpvkpovfyyfppppxyioxvkvmkkvxkikffxkiikvomfppkpymoipxsssoifvivxkymoyyoxxyvxkksyimokkoxypkvxvfiykvsiyxiykvokkvopfxovisskosfsvmvmfimxoiimxmiypvofspfvovpoxpyixffskpmvkiykxpxspyxskkxyfoimyfpoysffmypvvmfvspfsvospksyovkvfmmyfvsmmiyxoioympfvmkssifvmsyioyfxkkyksyyoykxmpvpiymxxpvmpmxkiomsmikxvmykvimipmxyfkoxxkxfiysmfsfvmvvsyifpioioifiyovovmfvsyyssosysyofpxxkosoikpmoopymkyixoppkfxiyimssfsppxpyokyxxsivkfpsppvsvfoiiypsfsmofpyypsxyoposisxmovimioompmvipmsffmoskfxxifmxpkfxsmvifxfpvfvoxkffvpikkikikkxfkspxxkomfkpfkkfipmoooifvxxxfspixpyivkoispxiispmfssvoypsmksvpkooiyxkoikspmookppxofipsfioffivyipvfxvksopsifpmkpppfvofpkkfvippifvsppfviimppfkiiivsisosfkmxfposfovsfvvsxxxyfkooiyokxxffmsyomisxfxifoxoyfoofsmxfvymmsyfvkxxoykvpyoioismymmkopykmymixfxkspfoomkosxymkixisspmxvpvffvoyfyspookmyffkppmmsfxsvxfxvopmipkxsxosfkyfyofmiysymfpspvmvooyykiyspmpiimopyxixisfyppixxsxmyksmpfpfmfommiymyfkfpfmymfpiyfyfkfsiofooyvifpivxyiyfyopikikpfypffyifmmxxkmovvyyxfkxpoomkpyffsxfysspfxkivfysxxmvoxkkyfmikofvxxksfkkmpkyoifmovsiifysixysfvyxikvspsmfpxxfmyipfpfokxkpypyxspyisisypkfsfmsiskpsimimiovofivxsvvyvpooippxxfpxmfxxiopspmxomosfxxosfoyioopkmppsffpmivvsoyssmvfkkpvismkmskkyvvpsokxsofvpxvmfximvyopsmmvsmxmmsfsssmksymoiyvyvxpoifspfmpspifvyviyxkfkosmypvfkmpmykisxypkkvmfifyiokfopmxxypymsmsyymkpkkmfpkfpxvmiyxmokyikyiifxiimvmofkmkvskmvmmyysiykxspvmxpopvfyyyvoivkssvfmpmovsmxpfsmofppspivipoisxksfoffxpxopxsxvyxmmifooisxopmkvovmkmyxmippxmkvysfvmpoxfomvpkyvmkkfpsoiiviopffpvmsofmiysffsffspxxiysifmxysfipssisokmvosvvvkvypmismvmikpyimvfsvspximsfyosyofifkixfmpypsyfkyiyiipksyppmyyoypixkkyxfvsksfpfmpppfvipssofxsipvvfxpiisyyypmvkosixyvsyopfviyyyssimxfvyivvopyskooomfmipvspxsvvyivompksyikppvmfomssfoxpfppysvopvkspmviiskxmommsvmfpfkpoyvvfmfpkospxxxyiokvpspioiioxymoivkxxkxiixxpiykfxvsxosoksvxyosvvsoymosxiypvkpmvkmxmxipfyivkyppfoopmvxpkpippmfpymsoifkimppfkxxvmpmfpkmmvpvykioovffkfoxxmfomkffoyxkmykofivooxksfmmxsvipvvkpxoxopmskpfxpsvkfkxkyfmfyssmvmoximompkpmppsmymmfpvipimvvxymmkmypikymmofoyxopvsfskkpfpkiyossivvmkvmxpofmmpkkkviskpvxokyiooisyfkmpikksxovsfxmioksopikmofxxfxiimfpymkoyfxfmkfxpsiifoiiosppmxvvfvyyysyvmskfpvsxpmmsmfymxioypmxpsoopvsixsfpsikvpfoyyoioysxvokixkkkfpkmiffffyppxiioymfxkxfmxyimxfsxvvfmofspfxivoxsypmosfkxpvkpkoxkvisyovixkysofxomvssxkvkopyoxmfoyyyooopmyxykmikkofxvskspsomfyooykpxyoxsisvvyipvmokpssykkommksokfoppxyfmvykpkmspfkvxyfxpisxmfopfippxsikxpxpmiykkxxxxvomffkpopkivvfmkxsoyisofsykksoikoxyyiyyiifxvoyxompympxomyosxovipxpfofympixxkpxpyoxpfyfmxvosvmkkofsxviovykpixppiopymixvympmvppxfofppvixvyxpmvimsfmisvopsspxxxvvssviivkoxmsxsmssxxsvikmxioiyikfxpiskoikfvpyivkksfkyiyoyopxkvspvsffoksovkpxfvmomixipkxfofykysoyvmyimmxffvvimvmypisfpmmmffypkkvofyypoxikiskksfxpmsyspvfyxsyyvofypfoimpxomsmkmspoxisfvixiisppyovsxyokfifvspvixvsxmskfvppmymvkpsfvpkypvspvpifkfpikvsifkxxpfoyvvxvismsmmmisyfffyikvyxkikvyfoxifmiikvmkpxsyokopkvsxmpvpvfsvvmovpmoivxymskxvxvskfpfmksfpifikyxmmkxfosvyiomkpsfsmkvimokokkxoyixxmfpfsfvvyiyypfykooxkoykfsssvysxmmfffkfkiyxfsipppyoskffoyovkpisxvisysokyfisvpxismvosiimixvyppfyvmmvfvkfxpikvkfxxxxkovviovxixfymikkomyvpxksifkiksoysypyypksvxsxpfmvmvxxvyiymximksxpyvxkxfxviimikmppymkofypxypifsxivfoiisixmxkkkmpfpxvvvfyvposkpspkpvppovsvvkyksvpxposxovmxovyfvvvvfokmpfsyoiovsokxfkyvomfkpsxiopis\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 435,
        "task_id": 4108,
        "test_case_id": 16,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "gadurtuaxtkaytyktpszpbubuyzbingwdrszripzyapgdiridxuigxniyskwxtipgxnibgbnddakabauwagrtyazdbapbdgtnysskntnpazrrgnurzbxugpdskdbyyanuugygxbxztiuuttdntndnwxydkuxnywsdiggusnxsazyrixdpdbrutddxdsrrgkkwtssyrskkgbdzgyttkdxuwiytuyiiwxtrwkyuwukidsnanxuzktgkdkgtasausinntridiuykxptwxtgndpsswizwbtwutrupiaugbszriuydsniatuarubiazdrnaurtuzbzbkrxrngdraxwzknaxwbpszkwtwxzykrknzskrprwwrztanxginpazgdurutnxazkargziyxbiyruxwkaaykubyzktsaardnzxziuxudabgtxpswrzitrayxsbkyuatygzkzsbzrsdnidxwitgssptkupwzisirndkrbtdrxwpppsznunuuzsbdsaupgtixyuztuxasitanbgxniwpwyxkkpdyxtwbrnzxtydsztdxiiypuwwrwkgiykzndsbssywassszwbizazwyrkpxsiwayipdkaryapipkxgbypaktgwbtywnkunrigrdnzbzyandarzzrypzdyzagpugzugxadinnpxxbsdbswxspnrysdiwdaikpggxgdtzipunugskarxawxgbyytiptrtxgitwbtuazuwwxtxnwagrkrpbgirdinidwrgubkxtaxydpkstsidtxrgdzzriyygkwyrabsdgsdxzbtswywygndddixiwrbknkntudrwstrpdwtywukkbynnabxxtgxwnnarxgdsygbyunipuaasnpiywpzdyyipgaxdkikudixbubriryysbaxtpiggssnnzbwrgkgdgytbbxnnggyngsauzttbtibttuxurnuwgatwxrzuwbbztgxznrgubapddybtgrxubtwizibkirkirxiruzybzwpysrnkgttyxxarraygsnwkwpnnzxugdrbyyuywuwanrrpspwnnxxkdpbdpaiubwikgbnszrzbbauakwspwawbwpwrxagxwwbiudskzwbxbpnuypkgpagydyprpyubggyxrdiiunidkxsrgrgsnzgyiudgkutpnauatarkinpdyakpkaastwuadzxrpkdandsxzwirrxuwtdssdyxidruixrspyydudwnksprysszaudkxwgusxbguirkaskurtuippziknwgzaatidxsrysiipybiruupybdgsnszznpptxpwkypbdzxzpuxdwyiszxbtawnukkutprwpgknkugywdxttiakxuzztuzutpuarsbsiydkgrnpwtnnwaaygipyktbsukpkzzrygkniuspryzkisazawtnxuxbyyzstbsxwksagxynddzubaiutnuuxtkzwgndaxrbdrragtrgirwnybxnwgsnwiaudtsakgugayindanzzbkrwwtzndgpwranbirkuidgppwddbrsbwtatdupsiszwnkzragabyxdkbbkgxybwsuysdbxipwxxyxnnyudrgxzwybygdspzrsgpwtapxtbxbtwyzytzgbtwxyyidrwttgynargdkkwyyuzxbzrnwsggypgkwuyyyszkzugnaxwakabknuwxaktgdxznagatiwnkrbddxagbntbkygniynaurybrzyzywtiiuwynuaagdraxprpwnuiuawssrywtpkrirutdxwiirtxxgsyisipitnrwudrzgwdiaygpaixprarnbpuwkbpipxxyrudugadidkuinsxsgubpbazkwgnxkzraapuaiaskybbsysiwpsragnsxysgznysgdrbypwnnibknrnaznwydrrsnsgyrttbnyxngxispkkpwiagdaiduznzazbrtzbysipsbkrdrayrtgkwkgzixrbuszizipkdxkkupasdtkupaipusbzkpirygsuknbixbzntkwnrwiwiypkaxsggtdupxyntbxbxkixrwuziyybzkwzwbuuaibtnpwkwgwsisipiuwinadtsiinykprupinwbksxyxybyxnydanzgarbuyrntyskgrypwsawdayidbspbkiynrtpttpizzyxnzdspnxsxkwypzaysxygsuaudrgsitpgdrdddyxkbwkyxpugspkywruydstiszipngzayadyxnuidtunbipaazsztwykzznsdbpkswtpbdwarpzrbdnrgawytbyxkswtnawakgpxybugyyprsgdnpwiugsttuxpsgdybdgsbdbkuizgntnstwdzpidgybwknrnusyyyiziwtuuidguxkadzbxyrrrirbkxknuirkkszabbsxkgxnkwgsywsszpzutnutrgnidayusbdkyxsxtbuzrxnznktgrbykkxsdrtsxauawasbtaaritzzwywtsyywkdbzynkbkpabdtpnyksrpiikakyyywxpwaztrwikgzypkwrpruwxrnupsxtnbgzysyrsauikrppbppuirbtnpbkkskadbbgbwwtxnbnbgzuaptayypdikiaazyadbrsbnupiuautirrdnkpguyinbzypunupypdxkszaypdzubasdrbkxkawudztxzaatzwkuraazpuastdixixgpwpngybsnrzyizssprwkzzpxxgyinpuyngritdnikdszwnsttpdxxzkppwkpxiukwugpzywwtuwkdptpgpdtspkxpnnzgryrpgryddnakktzpzyadpxugppzxabwpidptursizbapzdxtaikppbawawxtunwsstddgdsgizxztkauswndpatdbdrxknbsngtawnwbbznxibputniirtrptuzpaatrwzykkiixnbudzrdrggywsxtuwpdnuipkswyayxbrikwwttbikdkttuawnibwndrazwtdpabatwsxnkizzgpzwguwrixrduysxzgsbxnprkgiduwpbpntxkttdnktxxrbggrptizwyasdxurywxbuzdxnitsgstnndtsuknwaxxuktksgykrddribzbsdndrusgpnzdybixtznsxnszwzisasdtnpdgzxrzansrgbgzkzgrnpwuwgpkaaxkzdzztxzwnxirxztgwnabgprtrxttinbdigwkswzwstzgwwtszgxiikuuaxxtwsxbkusnwsnypyurynddzntdtbpykiaisubggspaikngdpnpkzdxtzrsiwwinairtuxpxykkayzsspdaanttdynudiruggrpzsbygrgianzdwxyizwutpiipiuxkwxwzrnynksbxkwrxutuddziupadytbtbdwbdnbgbiazbxbstpwpttbkzidbykizagdnartayzxyztgdtzkiwnbykxtasinwbdyupybnxnbxpuiiwgibsnaaydszzrndiwaasrnizsuxsbgyaityauwtriyyyziasdskkpttgsuwntaanakwbipwkbsyruanakpuuswrskbwwrwtzsptwbbniutywuuitiwbwbwybxywxunxtyzrddrsnddytziunarpnwuxubawsbyrpayndpyisiaydrutipsyuwrirdsxywiunydkwbbpzgizkkbbkubiuzggpzsxyusnrrxiazidryzadnibpuzuirwurryyrywswyygzbindkzbsunrwpgdriiuwxtaxkxkdakdrrgbzsnduipriaxtnisgdzwbubwstzgdudanyrgindkaxkydysxgtxigibtnktpdrbudzipnwidbsnktbdauipgkpkktdbbdakipdxbrwuxtpgddxaawbxrpixzpbibddwwgrbaupkntpxntibzkzagtwtrwdirgyrdsadpxuixisgagnpwnazixyuysnakgirnntzgatpgkykawbbpaitwatagzurrikwrwnrngiypzkgnkpabbsbsgasnxgxbnaisskyzpptsbyydzpdrubkxnbprgyxbpkbranaytkttutikrbsyyukrtuspbttpsidkysygyxyrxrpydnigrpbryazkrsiguypakyrzdznkrrpxwkikunszgatbntskydbtgnybpudautdgpypnnpywpsruxyuyaazduabsudgtnytzdbzkstzzwxuixgsxgrbrtwapagrdtkybxyudkzwsbuduiugdnupwdtuwkydrkyzsrnwyrpnsniyaiksxtrbzbugpuizwssupgrariauzwnxgwdwzxzaasyprbgbykpiwzisaswxubgbkwaupbagztgpanxpztnspuunnkuuyptskkbnkkwtwdugxxbbynrtrpwpttunnyungniyssdnrgiubgaauuxraipxxpywnippzzsbiydkdwaautrgpsgdxawpywgzuuxutabbkgwstyybwbutaywrbxukxttyndxkdtuxwrbdapzydrskrwptwtkpuzitrspdtwpnsxayksbrzzaiydiswrsypxababwiznkuxgszrgnygpdrgagignpsbiykzsttdrnwpswisnxawzyannkuaiarsdykgbgiidsspztxrapywpiwpksygdguzsadyspdikydxkdunggrdzixnwzxxaagirktzbikgakrtwiwdyazyrzdgurswzpzpzwzntwwziztxdadwdbdabiuzddbdyrzszkaigyptzurntpwkxgbstgrsdznzxigrnbyrxunggsdkbruubrxrgxtbtznbxtwnnzpdnbttzssurgyaxzkxxazrtagtwtsdzzxdaddagwwnarkgdrsrpytwgiwswktwzbzrtxyiabusrrakygstbnrzgtbyxtzkrnykidznkrpbbdzigbkdustawdgsxssuswrrzdgndbyasngdabyannbaxwbuydpadkzdswwkpxdidiuynggkbwwypsugzksigbdbiasdktgauxpsgpkzwyussrbbagzkxydpayuxtuzbkarbsydapszidsinbutkzyxgupansxrryxwrppwpgzpwkxgbgxrgsakkpstyzbxnrikxyddkzzggzgydktwzwisygprixrytdngbwzirusgrdukspbgtputxzyuribukwdidgzgdrxruxksntdygtindwzdtgxkkprtddbxgiwawabrtwxytkzzxsuwuutuwdriatkisbkywuaiizddzrwiznbwsttxsxgdxsurnyrztzbxigdudiwnngdzndwwxrrkpbipswninuibunwpirxgiawpddbnnipuabzgdsxybztdrtariibxsybgutpxnaanptwubpzwswbztyzxdsrggwagguaawwikxtwzpkuyaausidrpznaniuspsiuasrdsagxagidknxrygnuituuiusxaykrwuktbdibwkdgasdnasurngrrzrruxayriidwxgypkxbxzuapykazwtxpnwpgybatrgzsxbzauwagduktrpkbpzustnnkgasyrswabystwbadtsgzzauxkgbxtnndxxuikitbtruptwzwkktndyagrkzgkwkrusnxynpwpdnniyzakarabgniznnuysktxgrrgykdrsrrtkaytszwwzxzuikkdunkiugkixidyzgwxgandaytiagitbwdgintybnidbdwrgnbupbsznkurrtgywubziptxnbnwwbakkdtndbnasixrnbwnkdgssriasktdxazrkkiydgxkuwditradxdnykssrtbakkaryibbbsizzwwtxkzygdtwapupgskrgdzusbkabpntxtigbkpnrntixzxagpbgynzrrwdbxtrazpizdwzsbsgyryzgpdnanazauknikitakdxxaspnysiuygbaaxgzsaadgxgttiwuauyxsxaxarxsbygrxkraspayygrdutzaydpazprynkytazntxukikibiypnwrndybrsibpbsaapyupsngatsxpdkgsurbskrswduaxuzytsgdixwwgrdbagautspndruiyiitsizbbgunsaxtkywdakkrszrrbwsizyabwysrrkkngipwixrznpisnxunnabrxbyikrygwabdgrxddgprdsyybiaadigatwygidxdydattwwwydryiudpugrpirzxnyaztwnnzxbzpbkurswzxyakgtdtwxnyztipnpsyybiauksybrbxwbrpssysudpgpxuurdntuwsxitpkraspbiuxxbxizpdwxsiuaxytpabniaaaxagywprrabxutwrtbxzrysazbwtwtkdaarabyuzpbsazudpugsxagkwrsanynuzidryznyataskzgrbbixwnyagkzxkwsbnwdbzuigwbxdxuaykwgtypzxingbkndpprabddrpdwsgniikitazgipszwnyrxbygswtrngudwgwdsyuxxwwsyinikpixanksypwzniawauxatzdzikddirgginbizbwspaksdukbrbpbpnsxzxzxpgaxnipytgggkppktruaknsgadbizgktkgybwaktdutrnwbgzwasksgrnnrngrgsatuzpturntdnwaiiannwttkarzaduutuppsrndtrnytanbypxnwtitasnzrrpwrzttputsatdsdgkbbwpwgdbpgkbkbrruzktinrbxzzutuapawgwssiggydrbsgwrzyngkzxapnabirywzxywaasxbgugdrkinsysiaxdnabzxttpusxkppgnxktwupgynkdngwdbyuygnpsazppiyrbwbtnukbinykgrddtzysrxaxxrupytngibxbxayitxynabddpunsyxsykxztbnyruibtburdibntsadxrkpuaigsbbwzarnrnnykdxgtdipaykddyyzayayybganuaydnkggykxxkkarabgbpiansgryngxzgzpntgagpgrtwkbgxdgtkstaaxgrzdgupgaidzkkwrdbpgtzptixpxuugwywwzarpzsxytgsxdydnzwyyrkuyykrddstxtnsiadaydsaugsxtsnzaxpgrypryykgggiuwrwxgspsitkgbbrgzrskpwbtnabnxutabkniwyxitrbgxrgstsudtriytsxgubsndtansdwbxwxxyxkbdaxsbgyktrstxkazaitduggbuksbdaaukxztxwbypxkuipzutikragdgnnnaudgpkbdkxgxsardpzrnrzuzrtbspxwgsrbznbuktbranktzxynnrdrugsysyasawszgpsurtsuwnnbwydgxtawnrurbnawxtzuytydwinxapiztrszyzukbpdbbbukubsngazzzrpxwuyirxkrnkdkxaxssygisgpzzpwdgpwuadiynwkanykusiwytyrtpzskibkupakrxtnziktnzsirndadgzrnknaubyutwgggdkkngsduapatdtpgigkriptynwxabakwzdagbpzxtnrgzwgixsyagdsagxuwnpugkbppazbyurwdwsgdzdgzdpxasakyusksggtbabnxkwxrtarzswkibniypkwpakiwsptbzyatpdsgpbbtusdzbaatxwyknupypxnpzkxnbudkkwygkswbbiakwnxtwwyzxkyiznaainrxgdztrtgrbdiyddsndpsxwzdnzbnrzgswbdiagykndtxkbaapswstgwgaanbyddpaawyiniitdxturbizzuxkduazbnagxibuzawnbwzkgtuyriixnikytxsidagnbrpwyzynknnkibaazsbbyrbntazagktpwysixrkkbgtwngtbzaswkndudnadignnanrbxuzdkdttpypzrsywxynzdyyunwnixbgkxryxbgnxsiswrkzgkbadtrrsrztzbytzxadnnnypuiapbgwbxyxdukzytwdtyxyaxdsygwdpyztadgnikkybiibsxizdgyxnyykirigxaispunwyyniykkatanaradsgzikrkyasggwxwtyypbyszrudgdkxnrbnakstutswnwgbnbwiapxgbxganrzaianzbadusszktzzgrupatpzuuknitswdttpzgkytztbixxzidnxggbnbxznyxiybrpgkiizpxxzsbkgdiibwxnbkpudybsizzkxbnykdidsknpuzziaurkbpttuknrzuyndgsdywgtzptgrudnubdyirkuzdtbxnktiwuawitidzztrixtgxxbwpryanzkayizduyrytsabyguxwbbpzryriigxzigpkupwabuiybzwdsnpdwtrpgnsarupzswgtubdukrybazixywinakikyrxtiiwkzygxgykxrzxdsdryiunrwgxttindraybkunziwikwaabsprntkwsbddknugrizwiudzzwxzgawpydzigasnryigndwkwszpxbguxxappidgtdrwpnrkkdsbyzptzndxwpzwsnntdsdgiwibdxbrbazuwuwiaupabykbipxtgywpwxdddiiztkrbarudasyzxkktxbpptgbzgpgasubtdgggtnkixyruywzpiggzprauprnsndrtssadtgsuswidniissxbiuyswtgtzsttxxpzxbbpnggdnkwgzxzdkkiwbukdbddnkaxbiyzakubdnsiwsytkdktttuauzdtwdbwkpbxgrdrkgiwzpywtuuadrrdptrdwdagupuuaanpsukkwtxpbbrpisiykaiuppxdidttpwsyaawxibsuuguyazybkgniwastztasrwuytbtnnwinpbikptpxpgzxuxgswzxriatkkzyagwxtkwgwrrxawyynkzubuzzrtsrkgrrsszknkdsigudxgngarkdbwwrptniygyrgtpturkkurdkbwtztnzntakppkpyykazxkgypxipirxpxptaizxstnuwrtwpptzuptiawiazwdwndkprybztgywrrsnyrbsydtrasxryinaizkznsyntkstssdigbtarxibzysugxirakpiuikbrykibtknngkgprrywwpwynxiudunkznbiaitaugwpwdgxgnapdprzaakgrdgnubiytnxiwuppydzsyznaasbpsxttnuxxnpwnwswzyxnksinutdzrnynigigzxngudprxnzpaatsbusuinzyykipsxnagugkzybrdspypdbawnzugdnaduyigrdbidgisukxkibdikdwksrrrzrpitsyidrpibkyspinppxdrrxuwigagwgdkdnitxrbgsskzixgndwydtdabrankssbgbnnrrgzzraswbaiinxndydrigapwntibsrkugrdtarrzzysadausbwknpbkuiiwwsxzizprdagirwkgunnunkaknikyzbsrkbgniuagtsawptpbigxrssztirwkszrrxdwttpigzsaaxriiuppddxribkiptybwgupspgdngdbbspttaiipbdubwtznbwkkrwkksatykgkyunukgsdspnrgkpwayugdtkixdxwtkxupginikpgpguzswxurdtugupnbbtstgyiwdiupkxndkabidtxuwsxrtatbppayarzxpgtzgturynxdkabuwstdrgbydkbputuudgiuabguxwgkpyppdsbagxspigwiikukigrutzwtddiwrkzzzsddxziwwbdkupwuugnzgnrkxrzrnitgdsxsktbyuzdubdaysgyptknxyyipguniusgguxauzywkkknxxibiawpbnkguytkbttddasdktwagpbyrrkykiutbiwwgpbptzuwkgwnuuuzkpirzsnkukgzxrgaazbtzuwbxirwygurunakdzppingnnguyaisabxyzrgwixatungiidxsddiuztgdnkrsrznarrbrzpitrkybkyauribwuwttsyuddsiduxxxwzytarpkrntxstwissrdnuugzzsirkptudzudazdyutzgkkksduuxxtwydipadzzwdkuyukpnwadriwywrkiygpxzbksdgnwaydwiuskaswkppdaatkxsxdndwxwyrtdnnkxkautwdzraynspsunzuwrpguaibxzytzyarwruprugsrubgrzzyidzpzgkzzkruyakkuywspzbssnwttssktispspabyikridinrxzpwgsxprtxggyayzngsukpwtgbaiyuggkbrpunigtwgxxzadiuazibrskpdndkxdwrtupdanwrrrngbxkaxiyagarrusadksnudaygsbaaidsuaarbbsbguzxntwriusdtbkzrbipinxnpxuxytyztdpkbzzutzabkkttbpaaiyrypszkptgrkppzptdrkdabxaaazuiubwiawguyxartktzwtwnzigriabkzbxastbawkuzuzwypswztsitapdssasuspyiszwwgdbwsxziybwruidywyabbxnbybxbtaxrignbsprtzytsyunddsudtktrwztnzykizsrywypbuyndizbpdskuntkykdngkpgbigsgbbwrbgbguzduwxxxkukkrszsyxpygbsararzbwtwkusbbkinkrwwkkpnsabuxgnndusnutbybinnadrrrdsiwiywnybsbtdiygbyaunrartusgudwpwuyrdtnsrnziwtwpakzbtuasibwpwiiskgtakbpakiriiswpixrwukgniptbwzxrkuawnauirgupuazgznutwrratydysdsduiaxknbgdbrzzzgwaysxtgznpiiakxpspxuddntzbaztdntbppainnsptuanzapwskauyxkppzatikidkadzbdkngdparwsudzzrrxduiywzgxzzsszytngadtrzyaypbrssakbwnxdpbxxsggkdddgprbgbgwkyndwzpkdszxdixkxzgxntpnntisrrnayddwtsuxndyxxkpnzbtpbnugusnbrirxsggngryywpgxduayiznbpnxpdiysdgpdpzuaktapiszybipzutsunuxiuwxdnpkzprsudbzrzpaytdwsibgnaiwtpaduizbisxynswxdubrzxiztzidbibspkaxixuwdxyrbtusgtppbuuaiwgrwddixkxyxauiriwswkzgxwtudgkanwzirurxupknpxaunxkbrunuzzrnikiyaypniydkdwtibisbwruyiugdtkgpndptgguzauauadwrunniunydakgpwxuyrszkxsuywdgzpwsdkdrndkwwwtptppywtttyadrgsisbnpggarykbppwsrawugyzxktkwxbykzidxkssurriruydnbxundtsatytztnadkgbxiupngnardbzgiystggsgtnyutrranpyknstbrruatbdadinnnpapigzzwknxayskuiixpziakxuysyatwrxtrizuaztuktgxbugraturdktwuwsnikaypsyankisittytytiisasdsatryauyysgadtwyrkpyzankynbdxidgswrykkrtirpgakbsnwnbrkpgsrxtingpnypzzrxrnywadyznbtkzipbdbbtwanwyzpntzttsitbprkikrxipnrdikapsbiynikkzdtawywnsdudpwpgsupwrnnkakbrbntkysrybkkukbyruupdnkkyzgbdbywtyikirkkispibuianbpxdxgarpugawukixypiwkzgdpspwubxsztdyktudbuydwwpyiyitsrsydixpnzuiixdsudnzdtxdbdddnwkgdzrwskiwnwdaingznrsyayuwunkrkbkkzkzxxxtutpdzbkiykxiatstasraaaundaszaxubidasbttkrrariatszuritpwpskupktzsryrsiannxzbgtddrrdpapugsuzunwdtanzybtbrruuardbzruxiinuatnwszkptryidbdzbsiuyixwgrrwzappgwwynzbrbabxiswszupztrtgxrazrktzxyxkbrzkzrytitsaiykrikspyrdnadagxbpztszzdakwggrdzawiwttnisydnpriggwydddkwsnbaisbagykgrydbtidtidbznubpgnpwdbwuywwrnttpxiuiuknwtytdtiruxxkduptkadinsaiuuwzywazxrxauxpixzpazkpxxtsptxbbwbnaxykuwyydtbkiysdpbzdggwgpiawguzgxgziwswbaaixrxwattrnypnagkkbssndnzdydigptuszatnastgkyssywusaikkgudiduydybxxwxksdkzxybtizarxtgawnxtnasnsrgkddxyinwurbsspdbwdxkruwussruwridipgdnrxaxgzkpgpykpuxzggkywubbagyrwywwgnbkynndpzrkwiridxwsarwgagkgbisapbxgtrtwgsxudnrpttyugztirnsipgudiznrkkgipkzprgwsurxgpaxgruswxxbgrzugbuatggxtytisgsrbuwibbgktgdudkbxixwdzrgrgiwapiwakadawdwyxsatztktwtppbknydupbgxdiaidanurdrasxupuitpwbdtubpbxnyysgbswiywpgrpwikwityiwzdrdagrxzprgarybwknpbzyszwtzwrbkdzywwiapwytzrkgarsrttwkazgawurysruwrgwpwygiyxsssswdzazxddpywnzwrgkdnpuzuipnyygzwyxindrkyttixxwtadxanrzpiysbbugktpxzzarxipugbazrgkipsitzpwsinisudktduuykkpttraspaxsnxxurkzpzxtndinnxsbtyzwpsawskpswxibdawnidpwssawaasiwpikgbuizissxxygatybyxgtdappswuikagdxarrugixwksaigubpbbkbprkzaazitxikrprxgtntkptywbizxbupzgriwppsgbtwrrkngugnxpzyndwidiygprzpaaukxyiabwykgkiaxsdkaxrrysykzrtsxuunppdgdditgtssnyadtgstgasxpdtrbsrydskkttkngsgapkukkdxuasbwanxnzsbwwnuiwkgpidbkaybyawnskkkbrikgiunbpxndkbxzkngrdskxuainggkwbxdxdzpwdynypagyngssupignykbsgbxuadnpniwyssrbdndruisxnazdputpktkixpwnzyiszbagkkxsygprrrdxtkdxtzgykadwtibkzxpxuayutngtxwtspgrwbaprnxkurnkbsxwagpkxbxykgwsnykwdtybgdypbpkzyydzuxugadsprwsydawybkpdxripbsaztwubytungxsygpdszupzsgxsrsykrxpkpkratrpangxgpipuwdnyrdznggwbritdkrsyxszbsdkpdirgsdsuakyszrzwzwskdnzuswipwwdrnnnbpwbnassgtpnkapkyayrkxdiiabdrgtakibxaszzdnbbwrixxxznyttdpizrppanzdaxpsrgsdiabsibgwwskyiuarrbgirrabtbxdgdkydgkbndztdztuaazxuzysgppzxtdgbyrutupdszbsgtxbydkbrapnadkyupiwanarxppwartryszyzabnapywasrxgrkydtakspkxrxrpgwzidugwbbisbwdwkyirntkdawdpgyxndixdpbwbxzpzkwdwdpdtxpaabixsawrnwatrziupidsyurrwskxikadyxbnizntnaainrgaxistigakwtpppaktwdgxnawbnyixxiyugzkrgyirwkyzbxpstdrgbizznpxkwgnwsiikttkbwurkixixswdpityipsstggtiagrassdaxtptayyrpbasadsyrntydntdpxasbuunykuxgdkspzdsgwazsxaatunnyaxbayabasdyzrpbnrrrzsgntzsatdzbnyxpridgbpyxganynugkgrggwupyduidxpduswawgayuzubdksdaasznyasugpksksuxbnttkgdpirrwkaksiwraabznukdnynsxdgazpbtbbpuxndxbbdwadutzwkwsnxtwudgttrpsnrugnyspntxnkaspkrbgzyaswgduwtragwpapksuiitdrzwwpxggrttinnxgznxisdzgrkxxsbgkurgabgdsbzrypwibgwnrntixtakypzsyyuzddxwntzunbgrknxisxiiwukdxxatxdsygxrgritdwixrztrnrubbdxkgtwgrgnbddznnbyyxaytiayxwnbatyzyrkdsgytguztnnbrxwgbrwndwndababbddzbasazaptxrbngnagwsbgpnkxpidsiazprtwrgnrgrxsdxsrdzwdpwsrkptzrpsbxrnuprpxuugxirpiatbzabrzwybtxturdzknuxdnbpwxwiyiuysranaubywasxrdizkyngrikuptuzasktgynudtknrgtbzbkprbrrrnrpkgzuxdxyzadbzynnnddkbiirxbzybwrwkrtpgzguxykpnnnzpxaswudakyxinnprpswgiaraxryyrgiatiixdnxbznbuikixupgzzntxazxiggasarzddnpttuubxpatbbbwiaudkddusrutprapxtzwswuraytatpksiyuzxbydsbiibipwbdnkssdzxtdxksznxarknwzsgzukxxibaztpwgzpisrgdpzibpigdirbrbazwbrpsaxbbrdznxwdddnbadysarnrpnidwddwxkyirtundkzrgsgzrbnrartaabnwzadgtyyybsuzrbappxnyuixzgiksgznzisrsduubxgbpsdzyywawrwdypxnbbditwzkzixpwutxagpwxnrauzpkkzdytrsbxkbrnbgbauxasraribantbrnirguguiusbzbxpxtuxwrdpxdiyidswwkwgazwpgixzsakrwazdrpubztwxkirdkgwbtsnxpwszanwgykusawkkibwydxrgbzibasayzbxdgdisksadirzgyniduwrxgskgdatsuktpdiwrbtwxissuxrkrabrdrdyrbxizupzyywkdatbuabgxztyadxsbbszzuayyarwpkuxnipyuszytnszuazttzyrrdssrsnbgsankwiixyisbbpsrtntybbsgkriwngybsuzxrybdzzidagtpakwurggbkyatryibnwraspprxazxixirgsxgddkaatugxpdgzidxxxkbppugwknubiznbazdrxpnpzsrgdwkngwwxipgrwbbxkbdixdpwkggkkpzknnngnttzrgxrbisiwgswpxxxiztrsyrdaadkrbsxdzdwiygptntpaansswwyuxgwbururaurdwakndapxrkppubdirrswibdrnsknpzzrssdkxygpuuuwyypnkyruiaikbggdpndknwigbzwrytiatysygywrwgdrwrkxzydrgtsaxdaydiabyanwarigwpxdrpwnzsybbdgtbrbunsbbtiaayxzxiyidibpxppnazibgxayytpnaztnuwwaiknpraindrntnxagtdtppyaawudsutniuxbpiwdtnbrtdwntzznxpdgxpaxpdssxzzzdpstdrdupitpkdiizwpazaytdarptbrytzkxxrudaxsdiidkxrwrkpgtsgpzudsazzdsynxtkurppiprptbszxbuxxnbabgiziaadgpkparnydkxygpkybpzwxkytzkuwaxbuysdkupatzukbdwwbgkkrgkkrtagkbuxrpgbzxpitstyapdwrgwxaakntidyttsdsyndkkpdzdatudrpgbtrkgnbawxuurrdzibnrdruptzsggzwgybkkwnpugausxnwrriwnprxizpsnunupsbidupptpuwgpkbntzibbstkgnwnsxkzdrkubrbxtzasrizstgysdtbtkybgxirutrrbwskiuunwagrzszuwswgikyrurunwaaydyugatzytxgutngtwnyzdgnbasgzbianapwwaruskbgssbzurszkianxbaubtnsatkyziianwugawtiyagdktuzuzxgypnsxbtbxxywkawgdgdbikgiziiaurawkskdwgkgisnbnadiyzrnwkspigwsyytinzdixdnnntxztuzkkzwgndktgnbtgatxdsyxaxysdzdiaidnkgysgwrxwykityanpppznkwwrskdrrwpawzpbbbazsrngsxaptzsxraasnnrdsusksyxdgaixsrayaztdbkuprtiirnnznbuktuukbnrkxpgwgrinwsniiurszgxyzxxyzpduubwpkixwdrykuwrdxbwrszwziazdrabddgaidzayyxryzwggdzadrtgdnrdanrrwiuktgrugnsgbnupnddknuddripisryprgtturazstuyzgsduautidstaywruygzpzyznbnudtgsngingsuawxyttkrurskzpnsiwytzyndkrpydxzbkyxddnpsyzpnpttutwaxuuznakannsayuubgdknbdbtkpatdannxzuibwuxwgpzabdsgtkdznwdgapnantbwwxngswzbprsspikbursiudxybbziwrzsbbgtkpiiitaryznxiyxyzdxrtxgygbdkypxrdwykszdxikurnkxzixbauuiytiszgagwzwwippdsukibzzsnsbspkudkbbipbuknwkzbxaxugzbrbubgzakupyudrrixpripsskxuwkgtigxutnpisnybgbkatrbkrzxprapbtrbdgsbxtpbtxuzgtgyrnaiwsntkazzztsktwggrxibatizygbyawwktxsxgggnnxkadzdgudypnddwbzwisxwibispdatukdybuxibntgixiirwxgabpbdawkpapnywsgsikuysgkpibtgzxngtwtxrpxxzsnzwdinxpnrkzgaupiuuzkugurppibsziuyixbtngndrxyzdrddziatxkszzgduytgwiuuiztssixkktgknuurznsznaiyiyuarwubistbysapbdswtziwuapsurrrgykbdwxgugkydkkpgtrpuwzwwtzpysyxrytnukdbryuyitwduddpubxsikbtzdnyiysadnswurtgkpkttuntryxdgzybygbwnzdypzdgigiwgwbyzikdkgzpptkwwwynyanatbxniyrsatzytxxzzbirdknuryxxwbgnwuukssntuaztunazrptkgbbydryzagubuxtbkkzakybggaxizkgztwpnutbyuiyaspwsradtwinrbskxiuykprpdbipswntgnsbxawzrdgxskgntptwpukbgnpzagsbtaipxzsntntnpzydwsbunkbnpsdsibudnspatikrbrsbaarrbsaxbkyiaukniiyxnadugzdiwsaznpgsuppbrutxxubiaybgtknrrbzturzzsiygsgprurrbyrikrziddsdrsswtykpbpptrwyzbtukyikasxkpwztntpptknapkdbkpgpzunignyziyydubatdybursdtawsbbbyypsyibrwrbnukzzksnipnnrddaiwpxixgrrgsziyznaiygrykgxsnidprsaugtdapbtgkxtiigwtyruwarprxdkzwtxpnntrsdyapwuzprtugwryskigubgwzgwzzgxisuisaunyskuszbaiauityauxzkygyasipxwyytubsuyidpbynskxrzxgyzdigxasinpagstspsgttwxxtzsxrztwwbsazubbzsixzsikizuxsdizwxzsyzbtpubsasxyrggpasrkyxiwyripwgpbuzdwbywyspdazniyrsnspiarsyzdtddkyzxgsrsapkdkkaranszdzgzztiibpsznpagyawsywiwzsiyzttbyitzgdugkdrygnagwiptpngbxuzntiuyartdgadxxuazwwbxaptyyrdzzugabkwnktbpzisatgzdbpgbprniazbrntyxkwxpytbyrzbytsprgtiagptxzxbuapgwiszgwrsrxaspzxrabdnrgkpptaaszdzxawbsyktgypasrzauuarupbuibtbaguibsngsiadbuisnnabpbktszurgiubdtganxnngzsgbkpbxpytniaxawgxiibbynsnyywrrybxiubtyxuupgdadxttraydknxgrurupbnysxbgtppktysgydzayrbgktarkiuyartraupwznanakpniudynxukadangtidgixtskinzrrapsusksgiaxtnkzzwiugkbgxiiwpztzygdskxaugdxtarkawupssssrwndzasytdxyknbkbaswgwtykrbxiixuasbdzzgxtkawxxkiwxpxszxdzbaitndrwiiitiynxkuxdttytpyaupzaxspyxynyxxzsdasskiyagxzdxzynsndszzptwxuzdkdzndipbdtkaniainkygukukiyspdauuuyrntzybxxxsnsraukrsprrznytzwnaszdigstanpspzwzuzzxiwrwzypnwgyuaudybwxnxzzygbsipgaxguaabbnpdgkbtbdgbbrdgwktbzutyuangnyiwrizszgryubzgdtyixtzdtibaryppygrdizagppywtzipabuzgxwiagpustawbxxdgsszwbkkwtbxtzpixybsgrybxkbgbydxpbuxxburgipnagiiuxzbdikbpyuxxkpbarixtrgkzwkbdxbxxtitynwuikxsngwawwnaiktwyduybyzbindnkyiantprtndsxzaktrdydnsyuixazasiswwzwysruarxdagwwbtttszagburyrpisbirnagusaytuaxktbdantygnksubzypnuwuianadnidryabiptbpsktkyprsixwywispybrrguitsuzugguwpidbynzkpiggixbyukbtnbbaizzynwakduxsikbkrgwibngsnaxrzrptwtbxykadwutyaiwspupdkzzrziudyarsgynsxysiigsydiddkukuzsnwnawsipgwptxbdrxsuguuuggzbgkbzgniwiywazsguznkydugawyitgxawirgnxbazbgudprywudkawgdgwiszgdkixwdgppabntptadxwazbpnkiikwuuibzuygwndnkdggysrnbtxztnbdugnpsxktwapwgzwayarzdybksngbztwsnbaigknyzgrpnzpiuxnxdstxkaanakptkxbgsgpukkdkniggxruxztiansnwyndnspuiwprgaiikbayuddszrdxxtaikrxyubaypudtnydypsgtywsaixapkgkuayttuxnrxngwdbzbuxunutzyuyibnbrsyaynkxuukxtyssswbytddxgkiuyuddtaxzrdtdynzbrbtidzttzzigkizkznrrtzzsrzrtaswawgkistkgtwaynuxunbsdrpiaywbpaitwknuryxdrwsnykuxxgwgaintiusksyruknttbdsdtinnbdgzwnprdzyggypdytizswxixixipdgbsxggnagpsryxzpitriritsbsyisrbnbkkputxazbizpuppdwnxiwpwkpgdyypbzikzwdanuigiptuwarrisnbksaxyuptbxyskkyadpdprawwrzyzsndnkxgtsabrswbdsnuukitztbartxztxuartdawdxygnuzzwzugyaxutunbgwtsysbnnprdsdytstpawawrxysurwypbuzwyyiaswsxzazygstkwtarduazknsrnuziwwspbdkugngxgsnzswpkysbrarnndtrzsdbtapwykisssrxxipzyanxksgkagtwzibuskxwkkubbnryzystgridnaknnuttiwrpiaipagtwnsssknipingdwnatssugwipkwdtwaabsndszaxppdubwktgapxwkssykasbuiuargbtzzbdrwkabgwyrdpwdtxxraprkwkpsxpusdinwdpzznwddtrytzzkxwuzrrwpwdgwxtkddkyzrwuyzxzzuszkiinnnsdzdikywkinugwyuprdyxwbppxxyspyzynztbxaikddkyzysngyzszgxstxstynbprrkwudpsypdktyasxggbskxzknpruyyisrbdaikdrgbstydbiarnspptyppbypknpbakunwyasdsbzywtkanztwrnatprznwigbgxsyzpnnkxakwydtgwxuuudzsrrdnawiziwtkwuwxabkabrpxyaigzunpydpisytndzbyzsibtdasbnkdpgrydxzduurpbrdtngbwazydsiknawninpkydptsykdyptwsapwyayuzznkpxtsdwuxdbtrwpznsukrnbubiyitrurywsbzwpzztyirunskrypnyrzaytguyytdkdangsgwpsptpugywydpgkitxityznxagtpandrdrdgzzpybiyntirryawsixkaskanxkaxgxtnkgsszaubzbbxwpgbwptguukyuakdznadygbipankptbgidrbnynnrnpywpapiiintaaaskabbaprpdwsdaptzirnzubxikpdpriukxrkxdiygnxsbzzxbppniurgyupnpyzpuuyduanityxdduxdwzkzupnsdnngszbiwwgnwtztwtudkddndtaakatzaiirxwrapdngybybpurutnwtdttsbkinspzkgnnxwupsgigrxadxdnxzxydtznixwystwwttwsnnugzzxsunudiibnsizguissbrpzipnwgwiybnrpdrrtdtagyndwrwbspyixkitdztansxwrpdnzkzsgaapdugdxuwirudrxsaytpkuyuinazkxrddyikuykygnzraawbzytwxirxzsxzutdbxpdigibzbtdwygarkbnnkppxdypnddzzagxtwkdyradkxapxinzpyksuxnwdribtubiniznwprykwpgawxizpxarazykzbpkybpsxizpzgnutsgbunkwazugwuwynpbxtgnbnixbzatptkrbgddasuuwaspxxrziyrbaaxytpzutsuaygzwtgdzgwtygkgdstzsksbiapbrdsuxtuzdtwdnsawbzxsswyrxbgzykzibbskykwdibnygwwbabkrixuixgxpwratnnstixindybggybrusxdixabttrszssgrdtsxikxxbudrzybgrnnruxbgsgnnrtxkitdusznitnwbxixpxzkapdgrxxxbngtzwunxwabptbaytbuprrxwbarsrsyadksntwigytznzwzzkpuisbawtnypsitiwztryywyxwzdurpkzkxwbuxbbipaaazukbxpsayxunbtyitznudbzkktntdnxwzpuwgdtdtarrkynapxwtsdgznpssasbrsrayutbibpdguykwyzabdaxsdsuaapuiywgskxzndguniutrandaxsyiryuzbdubxkkwdxgsxgdbzikkwbgpuzkysrsnnsbykdkrasxwgppkxspddadpuddsgpknwwyusggubbxzgzubwtzzdizyxakkrsaykwbrnszpknggxwxkyrxxxutybuzapasyaptnygswtpanbxxbddbubpiprdzwbuanxztiabdrdigtzdukrrwsbpwpbkkritkpwizdwgsxwxwyrupdbtxptwdawibkdxsayiuadsytrgwgusdpusinxinbsaibtkubdbxzgidzpibrruuiribiubstsrxyxbutrtnyyggwpgxxabdtruiggdswtwwusbswazkxgpgdtxaddurrsyygnrsnzxbrannnubswgybazgrpytwyxyydddnrksxnbzbrrykwwtynpnpxixywgtkdszbdxdzixwtdprnwatsibkwgiiydudbdtdukrppddxbkrzywyyduxbpszzxbnnidkrgakskaddpawbwwppstursaizsrgpxgugtgkptzwwugdaaxtiybuwangdipdiwiudyynbkybtxytutynkdbywyxxuyzgxdkkkbbtpnxzwydkduzytirgrgibpkzpdynswdxasxwrgwybndbzgirtbxwzrupwiaprrdbsruwuxsdakzdubgainyipwzpidrsarzyggywswiybddibgzbzpkwskbzzwnuiwudatswaaygktwnbtttxidingdauduxbikzzxswdpkatywsuiguyykwxiastknarbxibxaxygukdzduaguiaizkytxtuirgtdibiswxkgzdwwzyznbkknzytisiyzznnpsptbazkpdrskbbrxkzwikpagdnipxsxawkdnsaaadkputkwspbkzdbaktawtbxxyxuwnsbkwbwrxsrsspuakkttwadntuaraxssgygkxytuuzwbxnxyryiypiwdnwixnuarxtkydtbbktagkgryrxzxppzazgswbpysdxrdwgzsuwkabyuagdsntrtbgaxnzbnwiktatupdykspdpnkuyisdpxiigdtdtkddixswbnzxgyppztwzazpyistbxprsawtwsaudnyxrrigbkkiartzzzwbuwwakkwidkirwrxyagsryssawpkbgsruaddgisiaknpzusnbiizrawkxkwbxwbxpdzrzrtkziyubyrnniuidnxtxtpxgspskabypbtxazwzwknzxasunaunzursitwynutirxrygpbgdbdzprxbizsugsznzazurbstgykprturdausgxprxdistgxditaayiybsgzratwxxiitbypzasyydsbzirzykgtrswrdsngdbxtibuynxinwxuuxytwgyzwziszinzbpaszkikuxkgwdttwtdbrbtnipruiyiiixstbzsuyknpaatkdrawdrrtdzpbrakkygxzgdaxrxdzgnwwznruunrtppautupdystrdwsupkrwikazgiuybxupbzgstxwukzdnazkkxxswgwnzwdrnnwazdrbwrribbnipwtgwsnibbuytwbzdsgpitasgkwxgixbxnygzwzrtwdsddabdtgakpsuyapsbxippysnzirrpndnpyzxnttwgugpxsupuxurnkxttgbbsztkpbzgzptswkwybaprddggstsbdsukzktpisygwggsdknzsnutkytsaxytnikgstgtxryxxygwiwatksrziadruytnnnzupxgagyzddnwagstznwxnarudtyzggysxsywsiszbwxxpxwkytwtappgnywwguwitaxxgduattdnaikzrgtzuuwwknrdkaazbuupawgbywkrupkuwapxswpkxddztdutdupszdbdwdpbspunuddgsrrzagukazwnyybgakkgixpgsdpbgpwbubarxrdgssgbgntkgiaknukyutsxnbgpanydkbptkzaxgdazszbpdzbazybsgaskppdwnytrdbisxdkdbnrssnuukzaktdxwaiwndzwzdayndpsxutnwtdiyyukdwsauuyxbrkwygtydbatarstykbussibzriagsiiwsztnrbkztxtupnibukaxpsdwygzdsnbpgxnkykbwxyrzryikuyirnutsynwtukidrabxpiittgiuudtrktnwrsrpsyptzzyypntxdaxpdxyzagpwsunrwdwiytbdnnytbbbnzrxkiupwratapaixdspdxtsgzsinibnnywdgayyadtgiatatuurbnyzwtsadditzaxydnigxyzgrgpuzntzzspgxpkgztwwaisaapzpdxbsxasiwgiwypinnpxwwxrwttdszdyraxzkdrzwbdwzxzkprsbussrtudrrzpbrkasppttbzgzswdtnbxbanawpkxsxypspgkazxnrkkpzswyigggywibkdptpryakgtxgygwupgxtaukdzywpybxdudsbsxikyrpdgrwdptkgwwniranwnadggitpbydspzgxyzpynsapzwbuaugxiydsrzytzyubyybkakwxdaxrrwpkpyguswwgwdisgzyygkbspwubxzwipxpiutikiubbyywixauzpiiskgkspnxyxybpyxruktzgzbpuybdiswskttskynbgszkzzsyywtrsxxgykdgyswayibpniynkubitzxpwtsuitbdydizwritdkszuryygggxtwsbpyssgkygtknkyiikgwbbitpsxdkayryyzrsanzdpdzrkizxgbssyburkgnpxpduxdrtdynzwpztzzryitxdkgsbinbsiitazdztyswiirkxixapnanunspdkkgwnibxdyuuksadykdagbnsudnidgduratzdtngrnzwkygpuyigwrtddbxxrbuxyprgsgsaatrxangksgxnagwiuusnrigpnuwnsbtnturzkgdutkwtxgwyndwadussauntigtkprxbkiztygdykpubikktnnxiwppyssrunbtgysuagxydpzrwiiiikkapuzydrgitppwkddizuizniwgznaszysbduiupddybtrkraawnkpruuxxturksbbakykyunkpaangusddnbnnawdixdwpizxxaidraiwxrraryurpxzbukputsuwzzpxriuupnwpgrdpibrgtxarntwsyxnsyusddakbxuzpnaytkkzdtkgwpawtbsgdgpkutibgtbwupaxsxsbktkrwynnbdxgpygurabzbwpggpsyiuxwwpyzrwwtubtkrzzwsknaukxiaksbuabdpgzsbagrsyzsnnupzrdgdiizadgnztndpwrkntsbwswazirwrsrrksukkwiyzutxuksgptaiggdrkrkwprkzikdkykxrudzbguggibpbyuzgrddnsnurzpsawwzigakaaaknyyzsybkbngatabsipzaixbsdrgtsagzugbntdkgabsxrtuzduxrggkwgsxaxkibdkuyntrtdrnuatiydudawxpnknxntzgwuitnwnsrnwtsgxtikpwszwpsuaixdwbzpyazxprzwugraizgtaybxzkidkagiyxtkkwprunzipgppadubkktkkdpupgtbipxkrzaxidnzzsnsagttndgpbxgpnwbpyzsrprswdunwgkkkkgdngnwganpkawsrxnxwgngkgiyuiriuxadgxantixgnpbagzusgtwxsstyxbaiutwtggbzuwgprtxrsnyxwypnpgznatzikupunkpsnrpixszarbztrzsbzbdpnzkitbzgtgiiursriirrdbzzkububigazbakstnibypyuxskywnbnkxwkiznyudbsydkdruytkasinrusautkxsbpsgbknatnstnntyzkrairgirpangxsgzwtywnkwwkzrribasgpnzpizypxpwaswkgrzpdsnnnbxswuauggduztswskznyyggubngpazrtapuytykkuipdiadytxakprsppgzpwkgzurxtxtrszwgzdnbkubtpiuritpudxtkpgzzbiidazuznitrysuidnxzirbpnbyabnxbdaxkrwauruxpsgwzsuxyngbiktzgynbixaibgkwrinxypsgsskukttrbypzzxdupgisibtxktkwypuakiipkaxiybrxgytutgwxaaukgtssnssgarndxsxpuyyszbzbyxszidsgakainxixurxuxirasnrggnaybbtzangpytwyyiuxpbrdkbaaprnwzyxbkzzxkwsdwswnyxyggkppnakkkirgirnttrrtbkugtdbwprxzaduuzdkbgtzrbiwtyuninattsnsarksdwudxandiduswngyagrrxixkppgngdkbusxyxswuwbnrxggwwraykswwunurigpktntzwuiauauwxsnnyxdrtpxainyxgxunziagrkzdazugwpwxndypyxbziktpazbdubdwgpwauzizrxgzkritaupuukbkwstuxzxswbutwzrzgwxytyibabagpkdpkwibkxgtiixaizpgwdstkizwzatrtkxxypddgudzszaddazwgbpbpuiwupprgngritbartxsxdnbnadsrrpkybgannnkdpgprkdtgsbpzxywabztwrtkwrxraypyrrxtusnairasabsgbdnzyzzdbabipyuiisbbwiwduprayxkpripsyzntupzkxnakntaxwrkbspwuubipkkgnxrazwzptbnrgywsxskzwxpstnxkgspsrsruagpsggygxxywbkswgppbxadsudsszibsxaznaizzibbssznupppdipzyzdwgsydtpipxdgrynwgbnpuxnyrzaxinaryrrkuwxxaypaszkyndpysaduskabbaxkbpuuwbzxstdugdaksywgyntytniipxnpiadznrxidaaikrrgwknnwyzpuaxikwwariybrbrawadwzaupakgpdsapxnsguwyawbybdxzgktsdbtubgakpakxwyktasawkzsdaitdwzyinunpdpkukpinsbzawaknbiwtxztbutxisykaswinbnkuugdsnzxwgrrprdwxainptskinayiuxrxikbpxnpzuxzpdxbiwzszswrkskdpiwyudrssikgysdawsbrrytpunrydgtazuinkruwzrxbsypunzwbsnkzwbwkwdzrtagaugzrsuxdbswaggawkkabaurzbskutguwykdarukkktdaknwsytwxsgwugkuryiwuxwnbuuktkbrtupbsgkrgntrsbpbzniiwrttxdrybbzyyknyukniiryxtwapaddkzazzdyizutgiwiggzdxbzxbtxdzxwgzyigsggyyrpyxukpyanwuyipdzdkkibrszwgtrxdnskzydryrkydztikbxsiaubbdsnabxdtwgkxisksagsisryrzgdadgwysudrzdanbkrnbaxsnspgtkdytbypttaazkaxdrtpizxwirywupnybgasipwurdzndpbywyxwkbiyyatixxrkybrrxkxuxtraidguwiukiwywxrbbywwrbzuugwzrrduyiisigtdgdyspgabbxgdrtxrgruiasusbdaatzbkiytpxzswnudtgtwzzudukagbrzgtwdrbtrxpaddbzptkwaubzwdinxwggtyktuzrkastauuawbsdawtxgwsaibnzggdgkunrgpwyusisysbbaztgwtsxxuznntyiuayinwskgzyxizbgxptgsndygwspyagnywnsxzxyptruyitpnntxtadandgdtizuxyysrattpwdgwptwwwtdzruiizxpunidspndraypiixnzrgkxptbszwuzdrpznbwbkzpuywpwdpdkrkzusutpikikugarknpktpkgtbtbndsakywkbwysppzsuyikbikkkayzizygbxtabauuzxwzsaxrbsgpwtkbptaaxikadsngutwyizitsdxixiuxnrrtygykigxtsiuuiwaxyanspxzuzaynxywzwxkysssanaupunkrzddwgzgarwukgxgaappuwrndtwnpzsxzpisgxttansgppgwxuddwyynbistwgipgiptznxdxukiytdppuwsdyxrwikskipigrtkzxrxkpdasttkxdpswwkwgudddidgzdxugdwuurznrsskzzditridnpzkgdnipdauunptwawnunbpydxrxgwuktxdsydpwrgkrruwtytbgbburwsrgwwnbgttdrnwwkpsrrraidpnzusdzwkbygkgsgrwabgisrupynwntxkkzgtugdbkyskdxsprgrpygbzapgszwyiygsgndyxdbwyiyikzsxitrbigixytukddwxigybtusyzrupizibtstprannupndbzsaxgntpxkysyizdtgdpsrgxrwybnxnaptbzktsitkxtnsydzndxwgkdtpgypazztaasstybatsibtgbzybudsxrnkpiuazznsxuzptzddinyrybrtxbswwywrsgbwnzxpskrawxxzxbxdzbwtrzgubiwzsstidzysdpgkiugakgzrpbuybnznwtpurrirkztaudapdsdntydukbgprkxyyawtizbsyzztbkziprxaybrtsdngxwxdnpuyzyanxazskbbydnbyaxakgggibuadiyknsnbzgbswriiignaabauwiittggkyrksgakkizgxisatptkrnzwpzukugggwpdxpgnxunbiwasignriwbwanzrppbdunwgizrtygisnkznaxbwisapxpuwsxgywdxtwbbwnxyrrridktrnibgbbugkuxssiatpkyzxpsiwtkwwdsunkduryarkxrigkaiuxkawarprxxskpuuxkzpygrsuawgtydsinnnsbsnszytuiyptnkndbgnrgunaapuizdaitwbadtzatizxpnuknzztnixityturryxwdrynbrgpwgnsagniyigsrrnupipbrbkntwdsbnixpintnaitzngxkrnngutudruriwxxwriwgbwwkbdsdirbxwkraygkpgzgarxbbydddtryznxzpzikakdgaydzkddnzaikbrybgatadapyzkntwbxngsrtyngbzkbttprrnbggbxyksryygdpbpbgidydidnizytbrwzdnszkkkpwgipyiykkzztzzrgyiwbrzitpswnswgdbrzaiapkyuptugzwysixxzyadwrawwitwyiysiddwnszizsdiypwaptgiaazxipxxgiauazubdkrwgkiaiiadpsduibdwkwxisynwizawywkgagddturbatxtrxssxgtdzdaubbbxtwnpkiwuawkzbxiywdikyxdnnbyrnkzinpwtdpgtprkwtdrsbgizpspawsbggwrdgxnupwnayxtnutrsnxrpsprbgwrxsiznawitigkukxgzkiiaudaxdpkptsiknzbaxnnrtxaxwrbnnaxyaaxditzidbguwxzbutxgrrrkiwdwaybbntykyzipsdpauwtrrrrxynwguurzgzduuxgnbnnbbyzdbybknbpnxpwrgigbxdzubuwkuakatkugadkrkgtwisrgwrbbapsdrdsgyuzndkwdpribgadbgybiikizuyzyykuzssnguabanaabdrxitknuxxuwyrbbkbbsxsskgktwxurpbsyksypsnznptgztwrubrwryxipnxrwgakdkbtiwzukaydstirtrwaixnxrykpxnzutgbrynsdsptdazuiwxrpudabyikstyzupzsripggbxyigugsgawazxtzrsxxgxznrsttnxxyxbusdxuszbswazippwygrgztybgyitpgxgzaxngdybytwpytsxputyasprikzxbgdgxtkiwpdzuskksnaxrkraagkxxynnwwuddksskktuawtsixutdddrbnpaytsnpbryzgsiyynkyauizytngbrngiydrprwdzstkgnnpbnyipskttyaxduuiwrdtpirypzggnyxbyukdagwnansznsknypaiswtttstttguukitrustdzdatuinrutwpxagnpparbkzkpbxpruxytdkxgwytbdpbibbdztiztdtzggzyrsptynrpyzuwdxziwxnzaapykwttsszxtippxzsutzzzyxnapnduwupkgdbksgxiyuyinwsnsusdgbwgkugrdtnkgiyaibtiiytbsypttiskgtzzixundygxkddusgiwxyxynggnxrasxnbgntsgxkzxsxuprtxwrtnwyxytdswxbpbztixbdbrkaiudbkiikdntaunntnzaawziatrzbdanspbzkitkinwrwxxuizrkrkwasxsxtnnyipxugrxynnrpgidrakrsugnkiuawyztzbdapuzzztgtkgznxzpyyskzgbnxuuwxsbtsixuzrawdiyyrtzktgaupraxbtixytgyrbtwytsbbggbpadzwrdkwndbtsndxipzxzbatiggnggrnyrnixyiawkaurdwtnxwswdsknabbdxidizsggipdtuwbrstnankutxnyazuddaixgsrrskydbiixrtwagbtgrgpngbbtdzsnskggzzsbzysarndryyubpgxuyigrgpbxrgtknisynusssuxybxsnkxnzbtdwgtydaiyxxixsntnrtuwgwzgbibibwdxnipznznyuixkdxuzyukzkadsdgandaxipkyirpuuzubbsxzktwsnnwsusdsxawsrypzyrpdgsdzdzkknwyrdnabtpdwrxarruruwpzwrttppgkxiizbdgwukudsprwsiztbygzrsbdtakypygbinzarwkdbtdbxwrwbiyrnnytnxnygkribzsxpakdgbtygbrzwyrsnadgxzkpdpgnsuddszwgzxzgtbydaxzdrnuuzkdsgnistwrawusikxiakyuizakgxruitzxdpbuwpbxkdiwknbnnbryrrrsxindxaxniwsszxuagtrknbtpiaxnuwguzxbypaayyiwxgxrbskskrnnktbznztgussrbbtniaywrprtbpbnutkpgrixugbptwnutuzdsutrruxazyazpwzxyzspppizpnntskxbuxsbzzxuuxbisygnrybysuawdssnzznkwrskwgntkikndbbiakuabapwwixxtttwuuxnzrtwygtibgsnnipzzkrdgridwkprrpdgsxrikudynnwwtwkuitgusixdkazsiusxsdazttwkbtspxwndzzrryprygwbxxpgdzrgzxgrpgxakyisnakrtaikprpxnkuziuyagzgpnubbrxiynpudabrkwggigwpxdyipuyurbskxatxkdkbntakpyizikawyxntrpxwusxtgunyzuspksxtuuwwztgsbikbirskaxryguapuzgyxwrpdksskiiynnupsxgprxrgxzrrsaikagdwuuxnidgwxnnytnwadsardpydtytwxyttkxpgykbdpbrniggdybxybggiwppgkyaagwraduxadsaxrkswwnbgtinybxtupbkydpzyanpnawykpuwyxptsxsparzigdtpiiywwskzibxgxakysaitzudnudxiusnrgrbztuskugsykiiywkxbkgaiyxrsgsnrtybrsrattrdzybnwpwgxwkdasuynwiukspxrpawxbznnpsxstnkagbrtwudrksibbbkynbwybrriaurinbgstrddrybbyrbuaystnxaysikpsprxsaysbsaswdwarbggrxtxkgswsdzbdyuikaiysigyrsikbksssznnkgnrbdkdwzgttgptbstbwgrauggybgzkkypdbiprntzynppwsskdsyrdkubbdsktkdwttrkkazaauydkbgkdywktayidubnkkbnbuzaruzkarrtgtprauuyrtttdwuipnuinirpbnsxzxgyrdkawaygwkbkzkryzpynsnitbbxuwubygwyxnydipadkuppkxrwwuabspwuwpbbtkkbxzisbrwyrkbrpdtipudbkgrgdazigwyydndduzpiaygwnwunnswgxkgnwrkrrtrkuurxbxgiwkxbbxxgskypbyzgtxizsydprzptgazywtasrkasaasybwwuwburpsxgsaxtdtwdbxuiwddtwrwpybrwgitiaspszaxwxtsbtyyawnknwzpdpxkryibbnadssyiaibktpytzraruakuzwydyxgabrxxipuinpxgxrwxaaauurrpyxnzyaargpbsstkuznaatyrsgkpykkttauixsrwrpdtirbywtdtydpgxrngdsntpikruyikbystabwkiptswikutagnnrurutugsxixbpwawkuuknyztardztwataikrgxipnsgtduxrgyyxrzurpypunbzzgdzxywuktbpuzpzkunazwwxppsubkgkgbgrtuprirytizzrdxdardkkndrxynbbrrtaatywgazunbgpztdztutikpuxiswgytikxwbnddktakgwwbpugkusipgudydugngsgzbndyypduartdznndsiibzprkktswkudkxwdkwgwistrxwzabgkikzdnzizzxwurykrdnyxzzydngypggtxigguxuztkprtprsuddkkswaaiggwxnwuiuwdwspwuwppyktigpzuwuxkgxxabwuzkyrrgtuidwudxipigpyarxpadbudwintnusugwudskgukkasibddubybbaxgzzxtpdzxtbpnasadiskknksipparasiduubbrgrxtraarparwzpppikguzznawyyztaytznwddkbzzkwxpkzsxkaptttzsxtwwwdwkrsgynrpdyykbzyuaswwnbizbagazkuykyiuwgkaywznxkgxxbnskiiagruxksuaasxwwxsrkxyzwryakyzypiuaziadxtdgirinydgbpguaxpzgpzkutarbkikappyngutpgkgtdxntbdnngitbarudnrpkgabswdybtgsgrwaunsissxxzrxiibargdntxayaggxkwrypkyxrwsuykgxiknxpsgpsayxaxzirndkxrrxgaixygzttpkyirnkyinbzzwpbapaddisgisgwsygnszgzyuatrrtwtwpatkzikgbtrsxrrzsrwgxsxgnwxinpxzdnkygkainpxdwdzgubybtbixsibupbrgtbaduigpptdnzuzrsabswpisrdnwwrutygtzpbzwiipindnagkiwguupgpupkypgywnppxdgxiwwdpntsapsxyurudbwgguyutbswnyxgtdzbtynwduawzguygnwkkpuizxkkygsknpwkwykutzbzyiayuwnunwustswdkzpgsxgxwpnnrgxnuwpurdtkkrxtukwgsirxbiittrsxwpgdpxbgwssidxbrgbpswbuiatatnbybpwgbbnxrnzbnxtrdayxgxnapnbnzadnbrbxksruspnixpabriuwbwgpnbrnsswaxzndxzbwnxybszywtzrngtsbbgzanaxwnwubtigyatksrkgssznttnpwsupirnrttabtupxgnxxuwtdrgnirkaxtxszgystuusnxaratrpipiwrttgdbirwuxypwruiystxusptinpxxaxpyynagpygxtszanupgdaggnkxzawkxbxyixzyazgdddtpxstdtrxtkrbrxpsyrntxxszxrunsspbakannitzabyuwxtupxznipbkwsuprdrzspubbarsprrgpasiawwaiinbukzpaynddgttkydrzsptukkgskyrwiniuurkawzwwtybbysxnitzpuxrgsgywkgxtuibrwkxnunpkbwsysadwkbgxpxgkswwtnnusypgandudkuunswgrabkpzwnkzbbttuidgnatudxpxpizgugxyxxbdypypgwusktgsagkupxinydppzbtynuwykpzbbywgdzwdpwzkawsbdpakpxaauzpkaisyunxnigxytwtsxspzddsygrxiwtdpzatxbiyiuiputdnpziwzzidbiagutuxdguiyiszwkisukybaixtdruwyrpbiidsrugpdgibyidgxxaxdykbnxsnkbwrztakrptbpyigupynbbsszwtzxyxapzanwwgbdpzizkwkbzsbrdrkpzynnurtgabxwtxxnwdztrsrdtbibyxdrkbkdkrksnbwykxtkigdnrxtytrzwpryiabwzuzasazidwipybgxkipxgyydswswtzawzxwuiywgrzbibgbbnxpagpbyrybstgxibuansanubzgdyrxxsbyixggdtuznkusiknsdrpzuwuxzndrbzdtrbigyykiitndwwxsybdnisgwxraaxnzxwasbgkuydsptxkaztkbwirpduidpdarpargyaxyzaduanaawngkzxtrytusxzwyniuaskrwnzniipxuyguxbyyiaruiaiuawssdddkpgyibpaxgpzxsbpixrpngddwyryarspiypxwdrbzrnxtsasxgpnwndpzrtgddykndbwyppugrwtbxwgpiwnuyakizgsybdusbbwubixskppdnpkidpkkswuudbyiiiszxpubzardyskxgazgwrkssptkbnikuiarkgudbttxgbggirdkdakpyabbwbtzngydtnwypdktizdgtyxrkynznpzzigbinakztzwgdrrsdiaxgbaygdndgxpapuritukypzxgbxguwzzbbiunyxpziandrszxdiwzaiyxizpzdayaiizbnxsnsdypixnbyuwgnazbwbgkkpystguysitpgdyzwpxzzbispdbapapxgkxwkzzwsbwgbbnrbrkpikibktdspxgrysxsiuuykkxsgynidzxtxrxuzskwusrikgxbpiabxyassszdawkntrxrnypsigiisgxgywxpdydiidadsayxwpnnrssbawskstyztddzdkkrdssiztnzdirpptwgbdprkpzktnzszbrpkzusbtztwzbugdzznpwyxtanyrkksiubxgiazasatsgatzdkattnbgbbpsgiyxyirknstwdaxaxrygnnywabdggnirskawddrnakbzwtinzdxytazuyxzskkkkprybntwiggirnzzutytyyknskwrkpztayxrxtwibxdgpaxyxwxdkdkakixxpsggtxkzzyrbwakzxtndypypdpyzzubzawbbdizbpgzdnwsprktsxubpkuddrtnxzzsgrguakrapyzautapntnnkzaaszdypidwswuswtxuaiusuguznntxyznriidryzksizutgkdaxrzirbpbuznpikuuiptkabsadagxpnraztudandxgrtgkbbrrstgzswbkzgdpyytkuzbkbyiaypdiipzasdiupaxxwwtguiyatwgpduiddudywxawpgpdukgrrxgwztxypbpitpzpkrkkuiwxgwwnnsgrdnzbsbkbdyyypikbnytrbtddyyinpyxwtpxdtrrrwgpiubizkubpwddunpydygdiabyzazngibdpnyydgbudyswsxsttusbbkgarxpxgtpzknudrzzntnabtggrzzytbrxkybyzpzkyaxsagskkyirzanksasixnszwatnuzdwaptpsdbikysartrawxstuzrtnytybudtitxkunptptirwsrgbpzagxnxbsapbudbttpirxwswgkbsupyrwwpkzdrzawzwazagnndaszagrwtbdgbdyyybkwuagyrbsurxywbbsaawstggxyxywrkrzipddpbapkrtdrbxyarrnywzxpawppwsxuupxnutrxztguagnyrnarknayxwyxiiaapxkuixygauaiaggtannrzpribzbrwspgupsnyurrrzsgayiiarrysdkrxgauisdkrdsrrgnuskyradsxsxnuipktduugwgdixanagnswdxzgabggtgbyypttzigbkpkdtazyxdawgpxkbubrgwrrsbgskapnykxyzdigrsuswipxdygwkrupikandxpbpytsxnkxgutkygyugwsxzktxzgbbrxggabtbgxdyznxariaakiixbknsuwptnawttyzrbnwkuwkrtrzunnguupyunybdwibrgkrxpbdgnwbzkytwrgnpxudiduzpuudwypkbnyingndipnbgusxdrddgzgbwdiaprgpdxygaztnpdakaxtstuuzruirybaspdswdwayawszrkwkiansbnnrgragyrxzyxsnagikpsdwrbubyguxptgxikndxrxdurikxgtrinkxniwsynuktndywdpktzzazisppugrpgggdazykskdwtiwtabxnziurzryauygabtxxkkzbxsgwnrnzynszrtdrubspguuzzwukbwwibrrttzwswksprgkypkrxiuakxrxwnnkykabpppyttyyxbyiuiguaxwabuzgdgduxtgzdwdxbrdndduaxaugdyaxgtzykrbwgzbbuszrypagiuurnxxzdpnnustxpkduzirpdzyzdnrikxxwkttzbszutrabpukkbstbpxadwnttipbxupbixgsxzpzrkstutynaugidwkpgbspsnkdxrknttpsibzbyriwdxbtydkxbxgadrgxtdzkiupxiwxuxxtxtxpdnzkyipnupabgusdpugpurkipssapkwnwtbkttzbrszzgazxtxbpgbwgkatpwksxsutnzkkippgyxtdaawkrnydtnidxwriwrrtnzitzsbyxbrkuspasgzktriaikbxisbzpspxdxpzwatkzgyattipbxaiusxkixnusyyyygsnusbitadpuwxrbksygpxtwgrxtwtxduriuwubzzbixpunsyyzuzdywunkwktuzngrustwuaxrzxxgttzngdubikaiyrynggtdubykagndbxiygrwguysbkdnsaknaadxdugkxwstbirypgrnpgktayasigxgskgxswzbgdburnwxyxtwbwpaxzbrknzizdpsnwkbpzurisuaiyzybkdtrskgxsusirwbsxnkskpbpwkprrnwpyrsdttttwbdpnindzbxtdnpaargttzpgrrusidyyzdaswzndantsspszgnguiuxnbddzpwysgwdrtugrdkunptpipypsnsazupxibrtspbrnbtxiizabyzbauaznbsayknxnipdawbgdzudnpgtuwppdawubiuuiazapzrpxatbwnzizsbrgibttigwuzzgaudrndurakyiknidywstsgxsrsibggnpdnzigyakttwuwxwwgzwaxuuixyzusyzrtbpkzbrztzkpbxndygstatwwrikrxdtirwsssxbiakpnikgkanasbdzastitzyrxxrkdbdxnwtitnkbirtbwagiabzyaagpdriwzpywizaudnydznyxgxuwwyndtzzsgsaxaugwzppwzizkptdgzswkidwbswiybbxrnyazkpxraarttkpgygkbswgswrdiuysxazkirwiyiusdtnwxdupztxtwgbpxbdnwyyguppuyyggwnxbdubaapgbtyskrgxgnawrkgsdruukrztnbpnddbarbxzukdxbtprnbtbtxxazniywtrswppiagbisixizrddxzyaduggbpkrdxxtzysxrzspznibxbbtuzyitixkutdrrunssrpxakkrytpiuiiadbuzdrukyzuyygipwibgrknpkanysbwkbngatkyisnbukkkgpbrzbauiisdxrrrrrxrpgxkaxagyubuxudubtkiaugtgpsrtrnskwzaurwbpgrknnittgibtuazankwszdpsnwziwtuntsiwtsnswygdgazdnukpzaagzdgurtdwbipbnayynbrsgbwukudgrangsgubwxkpssyiusdsazgxwkktkngxrdrsgypksditbssnpidutpbawutznurnbppnxgrpysadtgrkwdygitgbkgwtntdwdxbsrgwpudpbdpwgsdpbzptbnxtwpgabunrgdxknayukukizziwntxkzatiirndkwdudxbdgyuwbiyatwryakzitdstdsirnnzursziygwrdybbddzubatrkutxptwgnrzniirspdybspyksarkrwaaxyywdwybidbynatgzrdnpbkyypgunrawiripgyukakkdzwrbknspuupwdkaxsitwsuwytadwuawgyrzisxdinkgxgwawgbybwnndpggpigkzgkauuwyynasggudnixxsxsdbukypuyarydwkwiuixusxbgnxttnpxibxkrguabxxazdktguntniuydwbppsrurdnkwgigxxzpwgrpuxkybsyrtkatkpxpiktwzxakbywksxagudzpxribtawgdypdruusgbbkxdntpdwwgrnpsbzrgxidaaktkdrupangdswikbwiibsxkkyygxrrywpbswdkusaazbzkitatxwstbgdbwysixgypnspizwxuiwxwdyszyskwyutgxdknuistupstiszibsrsbwnbpsxkuxnipryytyrwsrpnsakunrzxaipdsubirtndrbixsiuwyubrydaaitgpznwbdzbtkbtzdukdsggtwarbiyyitygpzgnyikykgdgsirgxrxyngpuzsibnriyxysitzyppaxagzpxzrbybbbtizkrpzwptyunibswzygbtbsgnszgtrxkanaikynuwznxwwnxyxgpawxnispubpuxbwkgdkgwkzupdzkuduxbizdirttrpywbsgipxidrkaunptpkxtbynuuzgtpstxybptxznuidtbkstyuuysabnykpgwyywkgxubbuyuppndtbutbynsspktdttxarxkunnrzwggxsrirwtyswgrwddybtrzunuxitnapbpgknanbwrtipprsbxudnubbrrxauxrtttwzbzriagzbzbrbinzkykgbygnystapptxwpitbsywadbsgwywugkkwswpydysyssnttzwsnnbbdrszpibgiurbpgabrrbzznpusazunwykyktkprzxbpuztsdktrttsbazirdpwbgtnrunwtisttysdxuwsyiapudiuknxkibgtbwbiudrzgbwxzxkgtxatdwwztsygnpxubynbtrsbdktxapbtxptbsynzixrkknsrpakdpnwzpsdbytzxnbzwxsduibyugwrbgdzpdxbsgxisukzwkuyuzubgukxkzuspkigawwsakbanppbrukpzandrrtnisdxrypbyigggxnppagkapatpztkswytpdbdnxtsatdzdwurwrnwisupgwktnkgrysstadxwnytyxaagkydkibnzgrsdzksbsysipxasbbtyiuksgdnabzdbrdkukuygsbbbtziaaddbrwuriidysiyxbtspppiaxgbzrppbgbdnribdtknxzzsiyannkttpkgtaikwxtyuyibpnkigzaankzitnzgarbbtgusagktwpxkykgbrixrdakppsndpidxgsziigkikgdziynxktpkzkyrxyspytprkazksxswnbgauaxnugxswixptkrdktabytuwydbdadapdyryryaisyzkazgiwiyrangsibypdisgtkriyuyipdkbyuuwgszxtirxstytwszpbpwswtsuiaauiszuupkbxkspzxguybbasgiwgwardszggszzgbzdprnpkuxustzabsaxbaguawgtsuutuiydtxaxwgtrwntntsbwrngkzstyraiuibabkiktdkwipgbddiksrzziyanbapsdxspxrypxsbdytiiiusykztptxbngzbtanugritnnarwpnngxirwzznupwxudpwpizrdbrrakpstxtuzwydxppnwsuggaptbysynsirpuzixdndnbpkgyppsdugawztpydzyyrutppsiktutwbgxdzudbuybnawskwttdkasszszppnuywuukabpnugpzrbpbpztispibpgznwipnnyynsssdwdakspdibzzinawaapgisiaibukntingwuytgbsywsrgwwaiskuaynksudaigaauxyayiwwxpxkassaadypuwtngpgzakzpsywpzysugdunuztxbubpgdbiidygtzasyaibzaspzyiwixwkskywtatxuyitdbirsdnaxtuzbtpnwgbtnzkkznkgstinswtgtiggsxzgtniiddpuuspdgkdnxnypyydubnttipngsdunnsaskggiiwdinddubswyyrunxtzayywxrrwgkyssiuizpzbigwrydunnintssurrszsrwrsgddrnxwtbdrptwyutsspyuryppzsusiidzdzstsxdawrdwbudwkpzdkzuinusxzsistpsxnurwpupgkkzysrxagsdapaintrudtdiniddpwbrarsaykwpkbyysznunnbntdzwkdiaarrkgwrkwsgxzzxybzzywdkkzgzbuaadnxdywabysnuzaxngprtxszgsgwabpypswtziukiwiunypwtuwsrsuuuaixiysxrgzzxnbtbyxrgsitrrygpbirxwkntpbwgdbwyixzriiydarsatziskgktwgrgwaurnbdbyzitytwigdsdzyyxnsgbbadxyktpxzankrsnxxdrgdrzsuagdiadtuituatbsunxpnzwazayzrrnnptwunyxpiytkdtksnkpnukxpannpkrpsbxpbywgrubuwstgxzugdpurdykauprdzsridxtgxbwzypuunntbsrdxduwxwbsptzugabsxpkzkxuuygwbdxarwnnuwsatpsinktwrbkptxrnwuizbkxyzkyzgydkubwptsaxpappypznxdsbrttdpstpgbrbwngrkzdknsyntigxzigdrbdxypuwupsgxizpspbdnwrgygguazaabtpxnzzauzpwzxzkndwnnspytizydkdxbnriydsggsbtbagatzganbupzppriksrtikdnznginrzgxuupypbngdzwxurpagbuizkynpdxkttnkrgwznppzykbkwyskdripkzppxzynsuspsssgdirkysyzstwikykupzadptrsigwgyyzstpsnduiudxzxwdzdkksrnitywbzsrbxbzatbuwdtrngaribwabgrrwinzkgtkgguaawnpurutknyrkupniwdzdnazznkpdbrwnxkrrnyrttnwgxktxnptnawuzttxarnndzzygxgdnzriarkswbntrguinzsrwppuidgpxwurrgibwupiduzxsywrggdnpyuxxibkkgkuarubknuwyndkrbzsprnszxauwpspudbtzwwnxtdaabzbkxinaxianirkbtwxztakgdpagkubrwpdbbwaadxwuiduwyspdsaxypxxpsnxnpsnuxkknrzwywzyybangdgbzxwzskinugkzgbbpdywzaxxxnkbsddrbpgnkttgunzwwsxakkigrakyrisxazuaxistzspkwpuxyxdaaytiiynbarxgwuuskrzsynuttzrrgazgnxaaktzpggdgwkkktgndbdsaixixxbirsdpntkaygipxaxngugxkruystbbwubdzryyngytrauwdriaistidggwiwuznxypsizkaakwirrbbirbpdpusgtdbuuwtitkkupxkdtndxwptkuwurtgunyaandtrziwgznkiryrgynxxtwygtgupybndxzrbywtgztxxdzgnungugwswrggxudknadnibgbnwkkaazkuiwsgbsurgsuxubwwawibspatinyxgyadtsakdkpnskirayukuugrktpbsxnkttiwwwpbrztnwpxxstgagbdskwputuzpkkzrtkyrgrnrwanwnidxrybksuynrzsikygnkiksbysxpzznrwtwrabudsyibsdtrnznutxiignizissygtxksauzkpipswuauisynisuntxgagprpgbyranazpnsannwzayxrxsnrnrgbxantgpixbukraurwauxbkksakgkpunaspdruwzksbtzzbddzuubbdybzxpskrnrpdzzuytgtdgxitussnktaptiinkbbyrxwxntspnxdgnzpwnwrbspxkrkzzyxwuwznrptkskgbiikrkgwywpsrurbasbyibgwpidxzgpnkkwarpgrtpazbsttrdyguzwnyzrkpktkapyzndkzwggrszzzkwkwanpwwurbyzaabsudditikzapzykatnpsiiiyapdbgdrprudsxzaiiupsgizxibgtkuixtinnnxdukygkndsbsrsakgtpkusaktnptakzrayusbyixxisikiunupxunstidtyaxywpuxpgggsdbbzndttitpzsbirabbdxtbxkzyzgpgbkwbaxzuxddsywwsuussbarzdbubittxypadywxkkxdyrkrrbgsixsknwwzpipybypxnpattbntizkibwudbkrgrtkwybtdagkbxytrsbyuxguakwadbsybkxwarugnsxdykaupdkiirdrwgziudttaugbxkaduwtxgazdknysknytsupnwnpwzwyidgdrzswnaxsziiuuykngnxgnnwaixpxnaiaiiadxnwbggwwwaptdgtgipkkgxwannpunsdxggyixdybusutrabpbbanrwurigwbzzyunsdixduuswdpgydawgwigwkibtiiykiyrpragddsintakwxxkywykwsiurxggukksyaradguyrkkxtgywaxiwwprizsyybabpxuwgdydngdpwrgidubptwzauypnzpkaiipxwdiwwnbiapxynypnyxdxbkrtpyiizgntuggubdgyukbwrtzbsyzykiutkkxwrtrgaixyikpiwiayrxsrtzninwanswbsaturwkdnkbxpiisipsnuaarxpwpziizskdbtypabikknbgwzixkuydgukiagiupysdsrpssbdbaakgsyztnpbisxdkwkugtpwugdkuwnynxrzgbbryszuntgxxtdsupiwwartxsyrgwuaigsauziuriynytuwiynukzukabuarxunizinapkbusxxpxbnxzwrnatndgwpkbpgkkitybdxyragsbgnntngzgkykzbuupznnnswgxuabbppdrdwzaixbrwwsktyrzgapbbxbwasiidsidwsrapkuaaawnraysizsnywpxdrrddtzxgudtyuxtatabtzxnbkukzsnaaxwtnrbuniwzszrpwtinaxgitbxziiwntsawzkwukinyrbukibrktsdnagzgyyuxbuirubzxbsbpwdnnsyxzsissbwdbundpigszwttbskutibsstdddwwryzuksxwdggdyabdxrxpnpayiypupaggantarwgasdyngutrsbxzbzatrnauwsyraaauusygsdnbsbrwxwtxxbkiiznbbuyurxgxzaxibksdyatystgdsxywrwrxprdxrudkgbagdtstitazxtrxkiudktnaxztxbwxgpxpbtdnptztytusybkwpttasgapudzipugdwuuyubxruzapnxadspxprtwppukrdagdnipgnpnupwnaitkwtwdtxbdwdwwrgixnynninysdadznrpittssssrdkuknittdykznbxknyrztsdiywpzgitzwgdpdxpzbusbsutxxxzkppdddggxzwdpbipbbbuitwwuxaxizbggpdszaxxgxabyatuibdktxaxxkdnwusntrsnxsxkdxaknskwyizkautxrybnibkpswxswwawsawazwgxbssupgptutuwxbnnzdwgtsrarikbptnuwazrxksnnrdrnwugzurdsaggzutrabxpztauibzasrktybiznnarrbgkykunsgrdunziurssktigrabsngikpxrinartdapuzisggsrzszadbtdbydkpngadnydiwnuguiastitiknppuxrrygdangxyyyrinpgrzpgkdsbpszugkudwnpuznyyrzatuadzwwwdptsxsntwizibzpxaingibpkrptrzyagxzdgwrurrwsngbakdapdxrrwgtipiyxwkyupanrrbtigtabaabpuuxdktizbxxgrsgikrdxtnzztkyuwtsryxagaxgtkttansyxyixuypstuitwuartwibxxwskguknnnznbikbkktknrinxgwuiybzxrkbwbyirypayswzyydbwzwrabpxnxzszapxzunuxgktkddksizxwwggnwrzgauwiiaswswsgksipzkippgsnwrkyizbtrnntizkgwaaxdgygbpunkxkuauarpxgugzsgbidkddzrwisspntraxdssxiipanngnkytzyaxgnndtisbkbwpgzdnwzggtsupuruzbunwdnkirzizbbgtawkptgiwtwuzziubsspazypdutsbwsutgsgxpzpabakwarxypnbptywxknrrksnnwptpbgxbygsxaibruingindiibbgwbgyukwktzkybprdzspykdkgupupuxkdbdgdbgspbizptwbuukzbnazrbznpptgnkuidxbzynbuxsaisnttzxzdbnaidsnuxpwrzzaarsnszzkbuzrptuyaxrtgtdgxspkzrrzurugtxutrbnxnbyxrzsukybattkppxnyauusxpxztuwurkrwtirkszpybydbdzuyzdspdynintzbwirupynpawdudpxgzxnxsynxtaktwxbzdayuywbbriisxinxyprxxyawgataxidntruuzyuigtwpgkxazxzxudsdzuknrzaikxyutigzauungtgugzxyiuabxdnxxzxubxpwazsdzszixipysydynrnrynygwgruatnxzyyxbgtgbdssbswzgstrbnwtkubddguysbbbksudaisxuaxatywangadspsdkspzyrdwuugbsursriidwrwzxuusprztutsbwibbgtabwnkxpibgpktrnaubzxgtgrddkizxykibskasraikxpprdbdsdnkdxdairrubuwybbrsyurypyydbayabzgkgtskpnbkytazbgzbubwytrrudargsnkiwsuasxxxguzkdzupasxiwxpgugyxdptbxttbwzyibzudgkuuxgtazwtrwpaxudkwpxkszugrnkikinzxgzgggkbwnyygirgnsgxpdbxwixrzkbrybyswnrxyrrsayrnygtaundtxtpsypnixpzuutnxzdgadrgwikiaksxwwrinirkktkdsbxybykbgubpprzbwnyddtzgzauzukwrgwdasuzbduwnptdzkwdbxnyiigxgizuztynxnndgyanztuxassnuwbkpnuzbdpdswnugnzxpkwbddtagtxuyysixitdsixbkukaiupbysywayrwrpnawnawiyzkwtdsipskzkxwptnppzgaabnkkbkuyktsskisiyitkdbadnigsgxwtnwupbrgupwwagkbpdkaiigxazsynwkanrrbiktisniabnibwdxnytibaiitwsuwinupuxtwtbdixxdtiyuwgigydnknxuabibixxsrxxsnsgsxuxpydbgagngxgradyppgirtingxbxgspisusstnwawxuaxtggwtrtyzzptwddxxzkrwsaxxnkkgzxxrgbgsibyrrbisspdknzrtaptrxgakstnuapxkksrkzgabnwbbtbugxybrisxisptbwkswxaxpixzntdtdxuasangurpxzakswnupawrwxrzzpirxpyxpusyzguxynxgbuyspbaakpttdiiyuayrassnkawwdsabiykatxurrktxpxtigyuuwizynaugsstabntzynwbnrrrygpukzpnttupakrdbktyrdxnktgsxzkurktdbkbstxxakyitwxaxtdynzwbgztzniggsratkwxnsiuyssbwwknxytskwwtrtdydasyasbrkgyxnbrbywuzuyrgzkdxandirribkkratwdgxbsypwwwpnrrzzgkkukpiasrrsbinnzxbtxpnwnxbntunsybsptpnrsgtnwiparuiugxuwudtzzsggiduwbdyaggsttbzutynguypwtwbaninygnwsttxspnprttxkpikknwrxgtnsztzsxztynydbkyixwzdayzgydnaypwsutyyibxpwiyxtyuyuaaxuzzzabwzzidtirxizzyddityibupapxxptdstgzgbwxtnpsauriuangnxyaxzapkdatbwnyydzwrbsbgnuygnuripnsgkuxdyanrnwsziuzigykudrwskdsrbpnnisznttnxsianndnzyiktzzyxuupdwgprtryapzuaiyiisgdrbxdzubkztnagnsxrttsagxidpuipwydzwrutrwaadintbtpnbyananbbgsabziniakawkgzzbgrpwikdbkggysdzntrddgyrukbidgdwsnptrsrxrxdnuprwdxxrkxuszpzdaxtpstdigrznsryzszbnngxksduswusnxdnbdargzdtxbknynazzguurxabrabzaubnrdswtuksddktikxdnpkibbstixsbbtutyuiunpgwntpuaggruibsanwrzdiarryggwdpsiuirutrddigytzuntssrzbunpwakkbzbbyarkbbubzdapasdzbazkbdsnibnpggbytannsnsaikaxgiikdtkddkgknpkbpgnubkgaipyzgxyurtxtyrrrnkgkgaggyabsdxydbkszxsubaxwakutpwbsktyyxnsgpytpxazuzbskzswbnkduxisnkuarabyukgwyzbkdzzxynkpwwayswzxsknpatyatggbitkrazrnnkizxdkxnguydkwbnxyxydxurxupkatduwigksibbdtubnuauszpsadstsgdzbpgzupggaysttwippniywgytaautwxsadysbgwzppbndszsdstuzrsadzsbsrtwpgadbggrdzznrbkuitrpywbzzzwwnwswikwazuwxgnruwdxsxwbpwrwtgytubstrppbdwwrytytiytpguyiurxsbxybytxxbbsdrpinupppdyuisaadgdtriyzgndtgkbuwgaknktzygxigwugsatzsiizzdrzunpybdrystirzstkiuwkubbwxabandwxkggbakxaywibugkzpnirpnkdgribnnyddwniswbtiuttabzaxxdwxzszuxygbyzaadzpwrguykpgaiptibnzyxtnkxxinuynbgyutpinswsxuuxxybagszsidtgnnwukibizdugrpzdpznbpuxbpykptbgzrzbnutwzgiiagpzdbykitskpuxzgsdsdtguatbdbrbaunstpwpsikttiapyyakutxbrrbukswpbibydgntbgrxurktbnaursattybpirbrnwiinkbrxbgdrbtsrxpdgygwbgrnzwngzdaxnxxzxwptbbzbidpxstnsukrnppwsxnirgwrbdngippiggnzswutatnastsbszsanwaiyuypasgtappzpugydxkbytapdksknbuairiiypnapzprrnbdxigsnpyxpzrbrdxwksssybzpswksuxkngzytazdikyknwairazunbryxiwbdbbaugzrguiwtyabgdtdkkswunugitbwgrbbaygaktkwbbpusuandkpwrytzuttkxdxrkdupytdgryggnndazyssypkadirwyynktbruaxwaakdswgaaxdakwgxststbrxtsatsytdbgrpnxuguptbuzdbbpbrzkuxugkyyzxsgwzgyabidirstpbbbusbtpkasgwupzpddwrstbarnppwxyrixndirprkdsdgiwtywdatuapzkbkskgprnptdukgxrnrknrkwgysiaxnpbbiaanyauzgsddnntszdwdswnbdsssxdspgdbpxswwwwxwddrdnrnuiyksurngxzxgdxknkisakrwknadbyskbrgbridrukyykbgyikdgtzyaxdaspkipnitsxynxdkzuybitaxdstszrdngwgxtytsgxsrippxgixbywtyiubgtingrukkstukyxtdwnsyssdbgbgpstyxairrzpxygsutwsdwyrupbuyddttraibpzsskrywnpxrpwdapuztrwsagurzbsutdsdptidbznkkxypkddtrdsgpgztddiysxxzipddwrybztgraxgsigrsnkwbiwdyzsubzxdzxbbdrasnbryxyxswtniugybsuiinruirkuynyydariiknzwtkrptbrgbyapaadswgknzikxnkaibxtdnntgxyurknwiynaaypzpwpgurswybdxtxxwtkrnynkrubtpsubsgysttngrgkkpiauzuabspdtkxpwnikdisisswbgkbypubaybnaridukbsdxxdusztypaarsdtunnzwriwixpzapyzbwxbxntiwgapunzxxitakspuxbgzdzwzkskiusksyyrzuswudbngszuksdpbzxssxikrngbrkprtpdtgwutstwzttdgksbpyryxzxgxdayarzbrktinbpzgrzbruzwkxskypasskzgbpgpnbwuuuarpbsxigdwgpxwndakkggptsggkpgarpnruinrsyagdtnaraurduusuwakgrygxkrxabrbpuubbrgdbzgayynsigsydgxkunnsksyrwudiaaigdbrautppnuywbrakasauttrytwnyzdsdwkrksbuianabbppgyypianpdaakyyzgaywkbndizdgywabgaintgkxtiynbiynbusiydiybrwdryakgtgzsruxbikysbypgkuzgudgdzzgynagrgsuigbrwdgsyizdsxnwisbgrktpbgbwaurtwirxwztnyxzriiswdyzxbsxxzrbyxaatzwzwattkuwargrixwrydzurktdduyizxztnnrgbnidbdnurbdsxaduwzdggdgnpdwyxsiubstxdnxwipkbwsrtrwktkixnpsisipkbszuziisurzgywwgpwukppauizdstwatkspsrkxssitydwtddrwbtrnxbzytbidgpdbgnpaxkspkwwbkuxzsiungwrwrywzapdytutynzknsxwgwgtkyixaxkswbbkndnuxwnwkdptpsgxzrszxytakwxdzpuxprgxyupzpgyruiaynrxwpungizdgisungdznbnzdgrgxbxgznwzdiksnxpnxupbzrarrpyxksdnusbxabkaadtdsadszidysrgadybbstzpbgdwdndzngwbxydsszsaggtnirbuxkbpzazdingwintpbnnrwxwsxpktzkxwbtrinzrynzrruwidkryknxuspnixbgndksdakaxbrgbbtguiskuaszpybzrxwiuasgbuwgzsubzsbxxwyuwsiiztwdzwapugypigusxrxtbzaswugwbbrtgwpawtuwswgkutgbpxbwpirrrzrptpiggidpwkzidwsxnzguysisdnrrztxxpurzzgysazuyrdyzngupatpaapaugwgxsyiwrpsnspztsziwtiunzdudgnabggspzyrwxdkwnxwrrbtgdignuazxuisrzbzutxkyzidxrdasdtakydisdkignztdrkksrttdwuyrxkxusspazyxznzrgnsgywzwdunprnsuxpndauyxnisznnaxytbiwxzgkdawbwxrxkkarutinxdradpdddrywuntdxrtwypknrdnbnwwatstwtirbywazigbsxyasxrdtyyixyigkwyiuzrxtzztitnsubdysryassrtubduiddnuadgyiawuwzbpskktzuybrarudngxwibyxdsuxapitzsxkngydywiwpzyybuauiigprzguxtakkdykktkdrubgwygpdiyxdzuwknkxskywbtrtgsxyrsrzzktwtxnizdiyrxdgiryzigxgybrnyrtzakgxpnrzsyawbirxwiaywwwbrakttrkizxytuzizgbypausugrksunndariuwpuwxxwikrudtxyyngiypiwbaztrpskpkpwsskwtkdutzdbadutkurkkwsrdwbsbipntgkywwwnpgynaigsawkakxgaazdznspuzwygtspwpkgxuwugawtydkydgauppkptsgztkwbuwnanguipgspyuirztzwdkprgprrgwkwkkikdpaxnunwaargnkxkzzzspsutyzkpsdbgapunyratkbgypispynxtizxiwytdpgwsagwzbrsauyitdpgbzrbwwtwnutnyasnpdwisyxayirukrzwgdpwxzstaxdssggxxpbddnnkizyrbrudxrdxzuwpddnbkabgwydnwpgrgxawydwpaasiddgbxrnadpgpgpaapgkttwzntpatutxdigztabgkystsddsbbsttsytnpkswypxkpyzbuwwaukktsazrwtiradbwgynwtksztignzsbdruisradkpidiasisbdpsxnbaxgutusdtkupnadargskzrdgwyzxnstnnaxruzuargnzbanudyrwrrwzkwppaxzpgidsuuztwbtuusxddtdpzatpktskstpinraytzkapzsugskkrnknibswtrkpazbxzwspnwydpxgasdbiiggsrtuwnnuxkwxgzbwkbbrbyunrxgyapzubtuzsrkwrrbuiiksptykwwtikawxrawyxtikdbipptywdatbxbikgzswnayzwzstxrnxpzgwttizxgadppdnnsrywzrgxinbdkzrsidudrdigukynurtnsrukxttsaidtadknadkykrwntukrxnadzrdgriddbdypswiabdsyznkkzbkaxwrtwrgkdpxptagsazkpsdpdrxbbtpauuugyzrywtbtsrygynssspdauawaruxktrdazrsipbktpxxxrtxzrugdpkgawgiiygbzwpsikkauapwdnwrpgkizssggwbuynwsakxtysrgzpsuarwwbtnkpyutrrkdbgirgtrwdaszksatszupyyxnrputzbatzgtaswuxbwrgyrytwsrwxxtriksdsnbdrrybbtgzswnargbstrgrysxttpngiprstbaswibbwadiktutbwwxddpwtxbudikdpzbtrtngtrwbixwtggispnpzirtwdyrtyazgpxbnbkinkxdtzztzzpxbspdnkidgznwirwgsgnugsszunzywsisirtpptndwuaryuptwzuaszbdwngbbnxwpbbubbirkazbzbyrzkigppnwybubzigkuixygtykzabssrdwdndixbnuznrakkiiydwyxkkrrurzwgdnnbiiuygbbnsxirdtdtbxzgrbdzggnzyptntbdxwxgzystyxknwsttgrawygnsxnyykkyaydangrdskgpuskkxkgkppnniyuugzgrpbirrbntaznzzznyrtubdtykpbwyrgnappdputraaukyiaunuazgxrtggnspxbxpyzwwywykptagswiwpszurztynydpdsswysdrbsrppurxzbdaukwtgbzrdrrxrwrankkskaprzxwzibigpdkyzyrapittxrwbniibsdtpagwntutgwdtsuikngdrwgzibzizzxxbkrtribzidriuupknurggktbbzarpibgxasiarpxgaxrsdiawykksiawdusxtyngwtdakdynkutygaaknzttwspdnntitzuyadiyndiswkapsixkiyrdukydaziynnadssxygswnrxyduytynuxuppkwxnntzikbkxzbxngxpgiztzrdxpupyzxbzuasgputnasngsuzupdziknbrbdkdxkakzdsibbyubwxkdgugtrbwdispsakddxszbwwdbpuibnngdubzupizndwtaprzwkwxbzbupxgbzsdxrgdatyuyzasdknxpxxtaztsbiikgtiaiiwwkrxgtzzayrxiwkndpwydgptdskrappkbygiydkydyswxxdzidpsybabrgxgdnzybuxiupbxxdrirunrabaxwuzssdippdyptxkwtpgxguniniadpkpsxdkaikrgytgbydwwwiwwirdwntawpxxxzkbrtwwrpyzuwwbkzxuwysxxswpndsatiigaspxigybkiuikkdawgyknxuiarsdzuausgnxsatrznxkyxiwxdrwpikpupygwiptbptunagptgiizrdyyukbaxwakbpbbauztndpwdruktzdskwnzzribrzaakiyzyutgyybspsnauyytidiawynunzkwinsiyruxbztzxppupdrikkrbiskxntbpwugdabgnygbxnbypwtbpriggppgprdigzktsknbanwnibpugwnpbyzikgtatwnwzwgapwpktptsdzszznnwinnuptdtkdpuugniykiziguusyrsuuuzzatstuxgrugarkwnxayazsburadsrsgbdxsxwnxtgnwukbppiyipttusakszkdabxuknzwbzngbxdppniynikiskzuxwdndzbwypgutgdggkzptgwakpasuapiwzagpuxadxnknknkagwddywizbwrdspyrrxubkbkgtttpkdstptnyriunbrdxaawaruxzyxxaxyrwgpzadrkyakgspikwkauixssbkdptndbnzirgdnzdnyzsgagassxksrzrtzgznnigtsdbtkdutzwinxurutbbunagyibbuubkgnzwpiarxrwwzsyiuiptikudzddzpasutuzgtgrsxsxbyptiskzadiakzpkstktnasapiduyxgbbgibrnztbpiaxxktaduniizinidprtkryzddbbbpzggsrtudgbaxpnxtdtbynkaapbzyytwnsigxrktwdnnxynidtpbzrzduwsxgzbypzwguxxbrxbxrsigxztdtypxrxpwgkpsudtiikkankggxsbttzgdasyaruwtxyuwbaykndtpnsttwxwsswdgardusknsdwxpsurkggynssrbnknatnritukzxurrazxuggspurayykwrsbxaxuikygnugyzrskwpanarwdaykxpzpdgrgxnpxykzwwxpwasuznxtraynzdrpapprutyskygunpaptzipadawyduntgzzdasbnkwurdzagyupbdywittyyrnzrbwpzxtbdubxnuswddupgtkssztargzartzanzrtbywzxpbdgddrzkuybzagxbpsuasrpkkwdwydzrrzpyysnkzuuwxnwiwuadsbgzbkkrkkuyxixnbtnsdbrnzskwaipazurxtpuzgrdpadktuubddznurwspgnauwisadbggpwdkbrzutxnzbkpxpanpgaudzygprgxdbaxpbpwraznaygtuxiyudgskrrpdwyszdidxzxubwbzkttakrragzxsipdnbzappsrbpuwwpzggygspwtwxatauawwzkzurwnxunkgzrpnbwuabzgbgbgwarrpdxzzuxsbzsxdknnstybzyybninuznwtdaswtatdnxaitxauwwinpwsnuazbuzwdxrspyrgdwkustpppzszrpxabakxkzusbstybtdsrbruxdgsrgaxszaidnkyrurbkinnsyyukpizyddrandarzkiswzirzrpaawizuwspxupyugiyuxrnrwapdgzpwtrdxxkizxgagxgwunugzggbsnsurbxkbykssrupwztztrisiuzxggguddykztaayizpnxirdixibysgngzyrypggazknxptgxkugxdpzwwarydwzwukxdztxawwxtddbrrkapkikkpdzsagbsgggbwzzgkskddrpknnxuuagbztnxbruprnrtwbsruwwgnwkkbwusntszgrywpwxpsayybguzxnizyzwprssbkdrzgxnkbyrtnaiuudnrukwktatuuxpissydzpyrayuzapugrasinuknuzbbunnbayxprrpndwnpkgbktuidxpxazxaspnkrwbkyxaaysssapnrdanpdatnkrrrizwgtwdipyxsaiikwkzzrtygizdzkndrbgrgnbdwgubdwixstaynsrkpstbsypuaaiudwszwakuwgrikupiyiutgadnddxbadbgdwnuiauukgztsxtantdxpsndwapnrktddnpnkgxdzzwxkdsdysxyikninrkssuzpduxyxpuztiwztsitngxysdgubtrtdibggtnkyyndigbapdwszpbwndwtwpzsgyykggitrpxuzxtyxyayrnsruibynytpwurxipnxsdautbputwasbykdssdsdzsgytzukkwzgazakarnawxttbkuzzatxuxxrubzpxpykauwbryayykdiytdxrsbsaintyatsznwzdgzxurpigtayngpggzykaawkiuuuussbnppsrnxgtuirpatdbddbtbbpwgdxdagwwpnkzrbtgsydgdwsbawxzkidnnazgwwzkiubbzgsydzxspwrduwtyynkgnidywgtaxnyxtiawrnptbtzpddpnunbbdykiaryydrugsgawugdianzxkzitwiidtyrirwtxgargxapysnysdbpnkdbpdaanziwykyyzbynyiupdiasrstpbauzzwtkuabzdnytgudidakasuakdibzyruxbtgbgxigauwysbxddaxadynbkgnaxxauxwtnxnxpsirudgyaukgsxxdygntszxwsgdzgswxwwdgawdkzyxpttsktuywtgtyrixgrrxdbsiwxsxdxwttgtbypytwgsgppzwikrwynbtggsikwiutkukxitttkbrnniaiuunbugisbtpzwpbtzandbbzpzwttkipdsawsazgxpypzugupbndyzdrdbspnkxgzzrzrnknzkignutrduyuaxykuurbpkbgtxdyxwkxzuwuduuuwysarugndysrzkzpgiytrdarytpzkunbisndnsgursxtxkratgwbtskrtbiaywwwuwnaurxkwwgsbnuxztwkbziukagxxxwuzpptnpdgypuiuppygtzkznyizringynydtuapnakzunuwrzgkbibixdanrruzztkgnbdykswxpdzgtawkbutykabwaxxbasbgttbwkwntubyauwtiskzzxrkaakusdbbapiwzktkkpdugxdwataanktydrakpikkwubgtkbszwngxzdgugyxgxpwgswuwndxnrantkgansupxdwxiizpnkyxbduypsstyxdnbnzwwygrgibwwxbxayzgygwxswuuktkdxnnwauxkapazdynzapuxtxzrazpatautbrnagbtydtsnnrxxnabwgzkaydysxygztsbsgyriuyxdrtnrgtbyusxgdnypyixzttnkdksntbtdribyngukbupgwsssydtwzwnnzgwiakdnpnzbzxzakkgzxxyzwssnuyzuutdyusiyibzbyryarrbridxtrptuybgkirtixybtzibwgdpgsgdwbnprdzxxngbgwagpndrurznizxturnkxiuuuuygukntkdzanipraagxrbrrpkdutyasdbkuktswuppybsxitnykssgarakdixkbynkkunxsksnzsidsptdbkrydwtbwsguixtxbypaaitzdxkrssxyyyxtykdnruababuyaxzidpszpxwxgzygygrnidrdnsdprtunbrxrxyprystipswzaisdkgxppiuxsnspiadwgtgrrbytkrtiidazasaisttgipnasgwbgswdinrbyukduwyukgbszxzttwabbgxnyxkgdprrbdzpgddrkbapnwubtksutziudnuxdizzyxpkyiwnzgxwzrxrkdaxprdabdaykywnnwxuugxggtstuzkasikpkxkntgdrtizypabsuygbbkgbsggrrtssnyzwyriubnsngrizxkazsiwzsgrabiuiruzdubgktiryskkybrixwpdnwadridunxinrgzbrnyyntkikprxuszpkbrgbdksbktdzkaxgiktzktdizgxtautwrxustwnkywkndnppirxrsgxutugsduuwbyrdwpbattyxrazdprkbsapupazryzugxwwwrntiriyisznnugitddagnadrirrgtknkztbasugwiduddutinrngrxtpikiwtunzadpiuyzgtsypuzkyiduwunspynzwxxxsuytbaxbusizgpzprwaywbwzrgupkbwtgazxnpssiggzriwzdydzktxtrdkynrnxyzgxgbarwppxkiixxusyniuwsuggzbxnrswurwixknzsunsbrdiwabkitzknbwanixsrntkryyugruuwggirdauduxurttawzwugwtbsrbwwybrxzzpdwbynwknrwturtiaxtwtbbybgwtditizuyixbypinpwgtnptiabzzuntrgnrbniubrtrdagrdsapddistyragkppubgtkdyunudzsdtzwinrbyuuykbxxzgrxrgszzgatnwgpkuukpzinuxdbiwpytsyxpigzudsussdupntwdtxdrsxbwtxkktruzstnrunuirzktwybnrdgkzwautzdainpyzydkypsrspkywpkbpiudzzxgwykussdnrxkguwkiwuubngpksdsatprgarzprzungsyagnzrbwrktipbxuxxzgdupzzgdtdzabyykirkssusrskngdruygtwadkzktpzzkgwbpzsggixbgbgwistppakudbugxurbnzupxinzribiawrpgartainryirukxskdbsrrruyttnbdkkixxprxpzrnxkybxguutrgpssyrnusrxtgkanayrbttwdtbuigbsrrtsybdraugdrirtkggptytbzbkryydyprdrwnsanpbnyrrtkzxiwipxxdygauaspbyigywzwxirwygbinuapxaztyuwutttnkyzbruibxurgnwxkpxsspkpsgwixuadpgdrrinzrrppdbaakdibiinkpgdsrzgapwtzpdybyxngsybskryrpiitkxwxukdirzpiyddrkwtyrxxrnrxwgkykidtzpxxyswrrxkdnwndrzypypdaznsingawatriztgxtktyugtyzzdwtrnradzpxgsdynipnuiptkbpktrzkppywtkganrkudwxutgpgxaksxuundaispzwiwygxddazdtwnpignznpkxnwxtdxuatngybpspzrsdbzauruabnxanittdztwbnwpayagiyusggpprxaagarspkgyunwttkzddkxusauagzdxxkbnnknbapspipdrunyikpxdngpwindbuzygsitpdwupxgwgissurggpwszaknpiawpkwxbuugtynstwnzaswtwtsbgsnbziytwyzbwxxwitzsxiapixzttuzuisrnwgiuyxgywxppuxsgitdbipgkwuyrbytnxagzwgpnawtkyngpzyxxarptdsiptuwzdwsinzurrskkxkxnybawrzuswkgraxygukrwxazkkirpstrzdduwxwaguztubnbbsxznasiwnygwbnddtbyzyzipyrsbziitugzdzpsxukngkrxanyskusskkybssspwbrnatwyriudwkarrnsxwirzxaibgaktswunbbpgxdznpdzitugsntyiaapszgnyauuyikrsxgddiuianiuxdwutxirsydyddyuyskzzptgniazwwbbtatxaiwrdzxwnxkrpabxkuidgnbarxdnzbinnksnddibtgairttbwsdzrtzpirrsuiukxasgwpruzgaxbnzuddktkbrkbxbtbsytinyxxzrwgyindiauskwiusysyxasyaxnunpnnsigrdwwwixdadpwribgupdpisrrdbkxrkwbybsbyppzrtpdydzisusddkaasknddgbigtsirwwdzuunwbttnsgwrgiybiwnkidysyyktgywppgsggbpibgkpgigsxnrznzyzurikwxuzxztbpkudinuxnaxdakrdwskngkdrrpbryasrxiibbxawusztyrnxgybwkpygnyxasiprkaiarsgidyngnygawaigdxrnnbasyxgzartztsiguzgwrtywrzxtrpadsasdxuwzxwnynyiupwpkispansxdsnpnxwpwnwkpwxsxwnbuinbzuxywpadsirwdigxntdupytbxwgxgiwdrwkiasgybtzznxprzrwazbgaxniripyrdpbrxydasstagsrttatgaprnxutawuwkxwbtbkxsbgtarnididxisatbytgpxdprpwntyzkptpyyknxazzigttpgygbwpuybdkzsitswgnnttrditnzbgpduzpgzrnbbxswkbrspwydirxgzkpyxknrsbktbdiaprrxaprnrkbdxyibaagdpzptydxibiiwgiagtktyazzpiwwtpwrsabusrizgzynikagxbuzgysnasdrairrknwaisnunubtrxwauptnidgrxwbkgrignuyrwardxkubrwrpxubzdwxgzyrkbdaptzsdzytgsyyskbisiyatwxrtiyppwdxngawzzdxysktiyxbkzyprdidtywyugstzaaryuwaixtxdgyyuyxpribykxrybnkpdbywzgwgikysbinwudtztdisszgntnrizptrdrdpydaxgdisnskzyxyisnwnkbbdpbiwpsztdgaspwrpukzpkiyadbgydsbaszxrzndyaryyxdgktkppypiwnarzbynykbixszugsbutniiggtxasnasgiwrgydwurstkkupwzkzbgudpdbbndgkwuyspukuwdxzipbwsbyxyyraiziuntwdypydxixtpbywikxbbpndxkwzwbkwryuzurxikswswkydpzzngbuayskzzninwzaxbwsyaubrwwxaxnpuzazndrkyuabrduwtgkiaxswrkrsnirnbkgbiriwydyxduiyrydxtwgxrsrikypupktbtbwrygankktnnigkxyskrrwxutgnxakasubuyynzaguiigrtrbugsakitrtrikkwarbizibkgdssgydyuptpsgdsbryztispzpygaiasyggiddaanzkbtagxbuyxbybbprpsbygwdpskbbdbttwduprzraudsdxrpwxkddtxxxuwassznnasxrdzrpgwaayyzbypgbnxbnttaxiwtkanyizybbrxrrgdzswzktntyakyatgpnnwtatbtbwsiatwipinypxtndxwradnbutigdtrkttnbrpskraxdttdazwaragxrrzrgkidzuuakayuibzzxwdzriyzzbasyxpsspsbnixnyszabdayzzgazdbuwdnsdtbnntriwkdryduuwwgsndzkippgzgpxkayzrxbuazsnkubskysbiknzpkzrribnkyxkbbkpdbdbbkbuxrbirsnwrutsrnpdiixpbkdpduyriyudgtuidwbyrsnnxpngbdbknrtubxuuxrzxpipaganinakzttasxsnzdxxgyrutwgyxtpnstkkzdzniwwgdprykibsasuxnbxpaudnxpszxwnsnkydayzrrwnaagndxxrtrtksytygakkzigbtdkyiptubkttsbzgripbzuigbrwxpysixrsnddzawzakddpyakdknkgrsgbwbiirsdwngttkbwisxynsdswbattywgiixpnubbwynyuubypktpukydikwwnispkkwnxzdiwyuydbuirttwnbizubttrtazkxxbugyuspdtapzyppwypxkbznukbabugyasargpkrwgixxxiwauytandgyuanxwapkwtwipzbrpyinazspkwpkagrgynxdbtrxwubyupdnrzuspsyzuagkydntxbidtgdpsdnggxwnnkdndbwtxtbzbawgsgwxptigbaubzdyszdsydpdrwuygputzaugbsaybngbuakrykkbzkwappdwbdkaxisuazgadpxpykntkpzsuxynsyztsbyyyiygsskuiixxwykkzkybdtzkxbdrwiikabsuwpkxtxiggwgptaisdtywgbunswsikstittgsbgatnxzgrnadxzwuuwukarwuwybwdbawukgbdgsnrsgudrrgnkbidrxukzykiwupngwrsybduswibkddgsxgywxdbxdzawiuiywzswrkzitxtpttdsagikudynwrpzupkibpkzxdnwapyxatinrgidpuzwxdrpbwppxztnanzaubwpkgrzpgygbubzgwggkrwnzptbbguaxuikrgxkxggrsikxanripxgdrzgbbprxknprswnnrgddakwrgbrrptxtnrrizkrkgagysyaitiuakykywwbbnzryuanwututputsnpxydkzdraadwpkydxnynszrkrzwdnusdswianxrtsybddiaxgntrgbsyxnsgdpwwgxpkrkgtuyxyxwnpbsgzwzykwygtxwikkbnzspdrnaiaszzypxrxnnptdtspswawznbaugkirisskwyinisbarixbpuukpaadyrrxtwyguspdiarwxnwugkzpptkdukixrwkaurpngnwykpuurawktuznskkytykakwsgnrybyyrubdugnngatkxyxwwugukuirgnwwgkwisrpbtdnraukgsxgzrrnwgzkagswipaukbkpiptrpgnsnikwyungdzurkswnbsixgzgdwdtwbxdswxkptiguuszxknatbsbbxgaprwdgrxydpiyidibxsdwkdsirppkpgyynrigwwgtnptygntaswsazwdrbaidakzxzwtwpuzngtxpkpkyadyxubdxixypuinugkyxipdgwdzrsirxaxdgtgrbbzpirzgtadbnizuayyzdzxauuwgatbinskztpnpsrgdrngtxuyygpdzuazgnxwnuuaiprsarusbdtgztbgtxdgitapdigdybpyrxwsarpdyiaaurgukzzbztsgyttkxpxbtwdkpryatyssxnyrytyuatxgsriidxxrtduxgrzdgaiykiisnwabrtwpdzazxgrisbkbnruswubagdgzupgintiasyypzsxgkrddzragdyaxrbysztsgtupwykyupawpapbzysadntdpgzdpbnbyiwixdibukpnztzdrittksxkxizbsdswkkxugiwnpsytwbynxawyxtsuauyszakrrwywwiwxagnrwpnwzdxxstxizsxxtxsprsartgipkixabupixtznrpsytxxtsrnrixdywzkgnukdtxzypsbsxgyubpxdwdtwwniydtxbgryzryatxxgnkxutipygispbbnnsxiybxwnnsxssasnydnawiyyaazwsdwsxwupgdkzpztttztrzgwxzauznzgtizswwzbsrikrgskgxtbuurbgkryapinzaruzknkgzgwbspykgbzzdbiaxwpdbwpxzxidsbpirxrtstnzukgddzknrxpgpskgazinnbpziiuigbwbkkynxbkkitxkntgdgxstyknbbpiyrwawbbytdpguggspazyrrrkybygwbpgrnugzaskydbztisusgsrpaypgxtyzidsgzzitaydguasbptiwdnzytbzpiurtrtixgpgxgzkrzgdbxrgztrnynaxwkazxzynragarswzxxtsrkgrdxztkiudbasksryzirgwwakzdknyrzsgkssxkkgxpkptxguxztrkrtukprkbauwksbryxrnywkswsaidunbxwnxbxksgatuwxduxyxnkdzzxxasxpxyisiuggwbdsunubydtniggrgswtdtygxzrykkwsxyatyxzkgxnpyupzdpsznrkzrkuurwuasyxggbttixaatabkttiwxbgwyzwaxzbpygpiubtzybrdrbdwxbydkrpsxxuxiywyywaykxbigsyuryrgtxnzatbnpzsgysykstpzbnzsbngxurkudwwkyrdiunibsbnxxuxsztdzupnpaxrdgabixgsbsbyppkiiwbawauwiywptpzdtzrgtztnzdapnrkswkwdngrwtwknibybgniisgysyigxxtbikstdsrdgbgdipwrpunkgasxdwbudwztkxnxaizrzpniadtziibtbzbsdusnkgnzwnyixpstdydttntdnwngxnwbrttpndzatzazrgiruksidbxbznkapnskisnuntuxxrwybpgduxsgskbxyzybzyrnprwgitsppdgdrggsaikkybrigsdpkytgzrwaadsxrwitypkwwwtwbkbrygabtnywyrpbtguzynzndituyitrddxsaxraxpibirupdwzxuainirbnpwgpdpukrpudyawgzstasxnrytiuinuykkruaityndpsybnbbsiyynzzpkxigundtyngwsxgtxyiuugustpabpudpadbzridkpzznpbikrzgpwdbpwkpgbrbxuaduyizpadzzxrdngupbngiwxxbggrxsprriwppytzinubwxzbztrpdnzzabxtkuguduguwwinxubwduuaubgwxpbwgxaysizrabbdyayrtyasiypuunnikzgdurtktduagkruuuriwapsdrgzzsazrwkgnaxxnprbsrpnkugtdanuxrayrtiurarznpsrzgixiryiudytwyxzizxpktztituitxwniibggpyixzsktuxkputtprguxtyigarknwzgpinnugitwkkypyppwizybbdyzdwpgtwyyantnwasgyksgpkznzggdxndadruxytgtsybxwudykxnupgbipzuzasbkaxbgsrdubztadrnxuykzxbxnyikrsysyxstntnuzppkayiibyppzsaixgbbysdwwpykibkzrurdubawraruwuyirpnaazptyawdzyiwkyddgtxyiabbkgxzpsgayuwbirbbndgknzgipstukzgttdwitrsgrxbgyxzgtudpuyxrryrdsuxiwpwibppszknzxbknswbgkuzyktkgdnzbtduyxgxadiwkaggwkdbtgpspywgyzzsaigubxywtbsdnpgtkxybukbwdgibiapwdtuuadpdnwiraddrzdbbpuspzidainwpkwswrtybignzkdzzwdtdwnztydpyyzatuuxwupgskpynkntzuzsgwkikawdxdxdkgnpxrrprppwxyygnwrzinrnsgdgwbzgsyxryzxsawiaidttnayuktzpktitutnbktbzaapsagwtuauaynzxpsupsdgruxbyssbwbwkrrxbugraiyyxkrduikwywutasktxagdpirsdduusnprpitkzassknudggtykskdxzbpzzgpnppiysxdrtnrsnuitupitsrxpsdpsgwyrnagaiztigutrxwanawutzubnauszwiaygdizkdukssxitxnnksnpwxasnwybwxuryurtwkrtyygxxyptpzdbzbsbtnkzgnbnpxxdtryibwubnzdgrxbnpixwwrytzabszpkkywybddndnbpzngdrpruwwdtbdtuzkszksasgdadzwgnaibknwwdaukpiuiautiubsiysapbrrkanzrtarakrrzpgtyytwnttaryiwndxtpizspdptibkgdtzarpyxbtyxwpgnxnzgtdxbywsdsrkxxynugukwiyzabukzwuxdwtzpxrraysuibkuxyrbsagwtnsxnigppzxkuknikgiitxyunsadkitntubrugxydgtaykpuarsbzaspikdnyaiuabirywsainbyzxtzbysgbxnasayzniaxwpbwawrzwtdbyxzzrigsdbnkiwkwxayuzxrizisttyysunnuntpgbyrpkrkybkznpgsaykwdygiippaitandygwixkagiddxntkbtybnspiibawripyksagytdnxkppzwatniasnswyrsbtskybwgkwiyzkuikyzppuzxsgdbbgazuupukypugnnrwzydurtszkwiuztypdwixxarwnpbsikssgiysgdbnsytkxzdwuxppdnuirtnpgaapbzrzbkzyrixpyaudydrssrkwggrxkpxktyaxdninbyzdbxurwupignkitzswstagwdniidzykxzknndyiskpybtwtzsgztsdssugsuapdzxaxwyknubdwppkkindrnsabkytazpatntgpybwdbukwusytxdtdyzzdkztsbkswbkzdwtgsugbztdpstwszduzyszdkyrdrbydbptttstkgkbbdwibygyyidxdgrduzikybxzdkwzbtxntndtdazpyizstgygkawugiauttgdkibbiiwztirnyzagtkaszurzzraxdtygdzbgywtdutyuygkugsynsasbizuntiygpxyuszxgidznydzdiassiaybbsgigrbbiwpsguggkwxrzwxpxsadztnanipsunsxszwxydyayspaazztzkgdtyixidpikznppgxrsgywaryybxkwsddrkwkrtdgnydnaxttskzbntsaggkawudyibiubrkwxpzupugiaakszwxzxipztkinnwpksysbubniwbytywkknndtynidnprtzrigyxadzurbaauwbrzkustbnstsbdztxkwkdisatnidbnuuukgtyikkguukskrpdbxwkgkstatrbnxnuddgzpbkpypkaagayyspktdzbutdzxbxdyuazgabbbwsniakzuznisdbynkawxpaywybxnbsbiwbsaznprzsbbiaddtgniazbsupsdiyrpnyugbikntbxbruuxstzkuuupgainsziutzuakysizxntzdusdknxrgtkkywgbwpzsisiuiidyxytrkbkniwyppagbbgrukbgbxnbinkapdiggiybipznsrwbrpriptariuanzkwyutriaaaywzbrxkyardwtnwnwdwsgwasxspuxarsuyubbgynzgbypptdbsgbsupxwbrwzdwrruuagwgkyriyxtkipuxnnxtpugyusnwxkdawwnitxrwwuzuwwpwtwatpuzpruwssggrpzgdkxdrrbnyudxywunnxunkikkdubykasdwnxnrgzaxarykwbzysuppyrapgziprwigyxiwwnwruyrbuasdwugyndxsbxiwxnpkwxwkgktaxixarpngkwrrwkwnnwynbtxiayzbswuikuxignkakwrpbbyabudigkkzuzwdwwxigdnwwynstxdugidpdtbniranuagrygdapstsgxtynzndkarssstxgiwtdbibygssbbrsskaarakyiiarpsxpzruszgazxugydrayxnryadyybaugurtnukxkgknbtwzzsagpzydrzibdxkptkrdsisaywpnpkixwnszkazyyinytpdnxksibwnndwsbdykxntbnnzrxbzsnpaprxwsaxbuyggwkbkzzuitrwwsyaawrrniusstnxnsrazziiuaiyiggnpgdupzixutbbwupbryisddxuztuwtwskbipdkdtnyrsnkxdsswgzunbpbwinnkspryznsktizyinkypnrdiatsznbnaxszgyybsnisknzwaguanpkbpyzxptarxadsrsgukdixtwxdzwpdawapwsubsgxgxabgnrkyitubtnsbadskintnizxnkzrnaupyzwnskzrngkgriidpdgdxydktwadbigdsgikwrauuprwrsdbttkrxtbgzxksiupigaadrxxkakzgzbwnxxwwirwriryzaipxzrayuinkkxurzudbatnzisigtxwiiziuttkppywuuatuppkgibkawwpizxynawxannyzwtypaxyxpniurdrzxbpwkpipkwdudxunrrwtninxapzswyzwkrisuuynbygwyxwtxsndxkgubtnxaiurndwxdtxgndbitrdxtwxbgbgptztrkitdzybprdzygsubpywyzbaptprbuptstyytbwdrzknrsdbkixtxwrzdbpdtkbnazgnatxzypddapxgabpwuddtirbzbnxzxidgkwzsuytbnwtdazugpaxdwakbpbugbtuirnizynwkuuswpxsybnuntriptgwitzysssubrxrxxbugiudxskwnzaxbwxzdunwdrgkzrnysyazppsiazwygtrbzwaiubwiznnasxyytypknapbriuguuayduuubygnbdbyatpszunydansipdtadsnspzkgasdpwkygwayrpxrtnktirbgbadridtbbtasbiabdksxkbxkzdinrrszzguiguyzusrtauinyidnpskkzkiwbnsxrxkupdtzdyzkgaawnswtwzknwygwxdbxyyzwzrydktptsgkntinrniytkxgpzwdzaispuwuniwztkibbtnaakpyatdguikuizbgwuyayakriiinznytgprprwxityuwtsiywayxppgarrdgzzwkzyrrdtzkiuakgaxrnsxddursnaysbiaanskdzipnpxinzgxgtntaaugdzwsnkkuurrbgytkpkikawggzrrkkarkudxbwwgwngwwxzxtrxykdwyztbxyggbwkzbrtkxgdsiiagwktzxgwynbngpntpntzntxbagbysautrpkwwazzdttdakurypysrrbzxkitgaaxayxydrttsusyrrzzpisgisdnxgynpkgrubtbggdxdpyusydygysytzdkzyygnxiupbygzgsrxaspksdkaiastsaxgkkaztinnxrnipzutktkurbkanxikpxwsrdxdwdtpnrsiadpspdduwyxdibztspidriuzbynttzxywiuuiaznitxnztusaaixiyrpustauubdxipzykxuzgkxntpdupxtwxnssbnprykbddwnizutaunnsagntxxsagikurubbrsswzsypasgibzbsxziyanubzgwdyrxppxwstyskprpxkayizwwndpzxbbwxbxwsxdtugunaipktrsywrryddaknsapwguxpspbbtakprnxustabpnudbdywrzxzgaabuwguzypudkzariibxgdnxwrxxzwpbykridztgittdkwtkntyragzrykuryndxiwudpkxkdanridrbbgptyywbriksytdrgntpxnikssyiigtugywdwixsunubyrpbtdkdgazipggpkzagyuxauigznsyzzazrraxitkzbyagakiusbtuksywdszwgzgwyabawbkgwyzaanitywwkardtkippyaaxbzgbtryukkaskpyxaaaubpbxkrdzydpdgprxyzdpwkizbrdkdwnyrptgiizdkgrwgpakrnardxtagtbabaywnnxyarxddkitdzstsyrxnxdyuutaywsptntxwizynntwzzkuanunsnwrtyxitbkyindaksdnzstdtrgsxypgsnszzatxixkdinipxnruzukxgsgdbpykrzpbtddsxdndupagguaunysutdkruzaukbraukitgasyrrngprtrdbryaitturukatwwgrazrkznusppsyndkidnixbrbdbgtwbgaunsugptitdatwkpypkbnztgxubnbnspizppxsduiwpxsdnsxugbpsntakuxprgnzgbrwpyrtynynaspdzukkwixszarwgzgzpnztyxbnaagbpybygxxdngwrsypykyununsnxynrdiwunnrapstxsnrygpuzazagazraidrbkdtgxatrwaupktasyudyidanigusgpnartwswwsnbbazrbiusrzuzpyasbdauzakuxdxitkunwskitiiiazpgypazsxkuspaytxaiuwnubnsrkbdadiazrxniwxrgnsddbubwyapbbruigspuywsgiydtsbtgirtkdyawgazpuywrdydpkszagxkaastukirsynxkuwwxzsukiagikugigpxnbkrwruwyibsnikagyprtrxuaaanbnywxxnikxzpdibgzatttntgpzprxntppubdgguzpkzrpykuayuubsbxwrxwtkrnidaxugipazuzwgxbtzrbrpwktgappzuitwuzdxdydugwddtnwbbyaywuaaypigbarpgpsdgiwsraputsnnpdpaaayzsydbwtynpkbaspytstxyztrxsuzwrgkbauatudxnptssgssxntgwrsgppupdiggkgyywzrgrgkbxdswdaasinpnddbadigtugrxsnxdxwnttirpskxanrgbasxrxsasizpubdasibxgduitgpzpdyxibwzbddwbypxtddbsxduwinznzksysrkagurtbanbuustypbbszzkanrsxarktnwirnpiubyruwwsizzbpssypsznxpyxksbayywxypiswsksiwuspzsrrbktatsktaiirdppwbsbadiszxkssbzdgysniswxtunbgdsbizwdnpssgdydyzwxryuuwiikiuknbzbwpdxuyrisdwigitzprgurkwdyryggbrzngsxwrnntwtswxbsddwtybappnnzrgxibtitkkayuzwxysirxnspuyadazgtnpyywwgnpipwwxdyrngyritdbywisdgdwyuzrpnbbksbykxytnztixauzbkugzrstpknixysgsrwzpwwirpwzztgkktswnbyaduizxtayzgxbizrnwukuwrriwuxprydzzxpwpukaptiitngbguiritxuksrbiagnzwbruzrubybnuduiwrsikbztbdrutkgkbpbktrsyxykspddzpbibbwzbyrzntzbwkyrdgkstwtzwwnrginkypuybyuwbkyywubkznnpxxdzzwyuzgpxuryurasaxtariibrwiwgsapndnuxgkkusdnprkisrspbizwbtunyynrdntwxzszappdabuusiddrwwiarxintxkktsbugaktkndrbiyzanbyxwsnnsnxzpyzybtrarpugzpytzxwxiibnxsdiawgwgiygirgkgndbgzguwsyswwgpbnigapnbdkirdtwdabzabwkiwbpnyrgapzwdunrygiaxsagrzrgzsxnnykngurddaiubbtrinyddutrnbuxzugkadnwadxywtnaaabnduiuppswwkuxyrwddrdpygnsypguatxdrdpsxxuytupgyytywbuswyggrnxwayxxnwnygygyagzayzxrzwabtiituriiawbnxrdtsryxzxgdyugatsdarisanundaitxwnsuaxytntiuzaynxraipyggsbknbppggpxgnxbkksbuzaxurttzndbnitabdirngsxbxntyxttaatayuyaakbgnripbguxrtyskitnnxyzwdzpzpidpittkgburixnstndzwrnukibygxgyuwbkixidratknripdzpaiauzkwznkngwrpwsitgxibnsrynigurpwgidxnskpsppwiggidpnsizgtyxzwskiizddygztsnzbsgngiiyyktgdxsprwszrwngbpbdkwywtyintkatiudiszxnznukdkrsyrdbnzaxaurdpkntrrwbkdwskpapdyggsdnwydwdkbxttnpytyrtrknasbpkrpsdggugukdurzkzgrdnuupabsswugaaibsitxgpzrgstkazgspgtdrdawpwwxwnptguaaxptwxusgwwsunipauakazatztsairnktsgtadbptunkxasdpatbibrpttszypnpxrubkdwgrwupaigwkragsxidxwiksasrrsaysutxzaxaddbixdguxikwrawbigbpuwbbyzxnzkuzktgtwydsdktiwpagzaxipbyugxixnxkirxsyiwxypaitpabutryatsrurnadnpuzwtgbgxksxnbyuuxsktdtndxbyrzkyiybzbdduastgkgapsnybnuduyzxgkgpydxsgdkbwksdrzsbwrusxxrrpxxaswuppgrppywyixkzzggartwtsyswwxrraxrkrnauuirtknxgkddxxztdnszzsayrnssbbugnaipiyddxwtksukizdysaykbxxzxwdggpkyuwaagygxwdaytgzxpzwwarizpiwxzytgidsbaituptyswywpsxbnwtusiwysruzdapugtbbdnainuytuaszdgdgynbrpxzkubtkraksitkdknkrsugnapbuwwitrysuynurzdybadrrpxdndtuiapkgknniuusbwztdsaysnyspuakikxbudiausinpaizpixrkktibnzrybzzddkntpwbgnpkdptwynyiadbatbikxtuybsbsbybrwyybnbwzidiyigidgnxbiigiatbubpdnkaswbxtrwsypzkguwktuibrbznktrgatzxrkkuipgtxxgtztkzwgwbrgzwyrrbsirgwwbuuxtkadzbpzzdbtwdkwywuibbzidiidkyyrdtpkitutsawyknyuypwybgbtwzandgxuttdpakuwgrtbkwgazwbptrapnibrptsggibnkgpixuwdyikuzuuxuyttbikrigadurkidgadrrgdzygxaisdipbiuyypszininxarkkpgyyasuxkbpunkgignduipwkdxzsukspbyaxuutggdkbpzaisdaxzwxbgpdtguaidsubniunrgxwpbazkxsdruzttazytssyskbsypzkgkztkudppsuwabgzrtnpzaiipbbkkbkaipwybynuakstnztawirkgybntxuktixpusgkwsxwzbaxtngxpyinikbkitztxzpurwiakwnriybiwkzppstwiigzknydydgtwyzawpbbzuxyxxwxyitndwpnugpayxdnnbiibtynbrgyuwwzuzkizuxtratbwbgznkixinyrrkibriyyzttpsgnsuyrnrxngxrysntzkndysiigrrnsxdgbkiuzagbwitwdtnngzuagkxwszrddrswyxgsbyuygbwabziutkkydkkxddyynpzwybspxaddxunitsbrdrnxusunxdutiudkzdkniprztakrxnwxxnxuzdaptyxpwgingypikduirduxtrkttbttxzdatnniyzkaspzgzbxdsapdbywzsryskagdwtkbuzgbdxydkixpwtspgsbxuwrrpkduatuydgauwygdiwukbbdxzpkgzwrrizzxnpnwgwtxswybyppwriadktpbkpyptxurzarsysirrnabdpdtdgkrnbrrxaupwzkttkapituttwpdawubyybzbxnppixrpnxkpnzniabkyzkdridawndknwgyiknrwagrnigiytkrgxsgubrpxttwkayxgbnswzrgryygdppiwrigrdunztrgyrpikuutndupwizdbtppnaikzpxyinwtdizirapuutwgdppdtangggunbbyywzpbakiwydsxskuptkibxugpdgsrwzwnkgpsrtrwnzbzdksgkarbttyigzwtdbsnbiybugukatabksirdrdbdxprnpnwdpizzdusraunxakgddzkbuddikzkwwnyxdxazuzdzdtzugaktzptdusdaaktixwbdaisdbstarpawdbrwzxpnpngnasrytriagtungsguddsaxsurkdwuzsipkuxtguptuyixdzxbawukinzyyktigdkdxwusritxnannwunbggkxrudzwpayidpptubttgyunbadgyauttpprknsynztbrsnurzxrrdgtzganptakydgiktziikstiuaagnddinkdwyakniziaidwwyyyaitanxisxktsntbzradbwyrrbzgbsgpxtuybzadpkwiwyzrabwnsrsuaagndxpuagtgzygtsuuauxiskszxxtirwxyuznwsptdusgnxzzgznbsiyzunxdzawsdgrndddzdkaysttdgzxwytwgzbtaudbgywywpiddtdgaxbsgudbxisxkuzdkpytudrarxbnitabradwdupbktggnzyradkpbzpyugryigbxnkygzizxdapykwasbznrkgprisstdgiitsiyukrnnpnwdbknsubyratzgakuywtrkxiykyiuaxzzyyuanrnpsnzdrpuasybrndydxzdwbibnpiintkknrgnbgyusdpuixpgtgsgsruzbzbzskdzrnsawkkkpsspwtxdprukdignbkpwpkagydpwixwtrygkbydupuktrrtrktkudwxbswxtrwirydnndrrywwpdtbdixxwxssutriwtrawdrgaszrywnwdurbttsytbwwsxwudwiuikpggysykigskpgpgttxbpwnrtgzbbxwxdsdykyuunkkaitgukytbarkpbzdsrdgntaybzaydduzgkxkitpnruaundzirdgbzwwsxuzpsskrzpwyxskarpirkyigaxakrsudbssnatgygwrxpgnrapktiiwbautzdzztxsawrkngzgzdanwzardgiisxruazuapzbwgratxngwgxtingrwudiztpsxdnkuggybdtrtrrapizkwinsdapiiaabdadaagkdrxdairpkkapzzppdtdgkgsndruktarkzbkbsrwkdksktwypgkzikwpuwddzktbikxskdnibppytigskwbswnzszxxkyayybdtsbuzawkuziairbyaatpxaaptiiuwzwrundidaiudxkuzwurbdzsktastaapkkknxytyzkusunwpkggtkbtupsygwrdgrzxwdgprnyaznwtgkztkuwuxiwtnawuzkxguriwdruiygzyzzazpgidzugkapwtuwzpdbdnwixkkgxpugiddxpzbwzygaszpxnsbxwnptdkikrrrdxikspgipzkzudtisbtrtbxbtwguszykutgbrgxpwgtdrpwbzarrtitxkuauadudyubksuxtwuxyrrgyaikzwdyrtxtgrdyzwbxawaiynrzdsnbwtubabxpgsigggxpxgurkdbbbtszyxantzptrpipzdzuuaknuksbbsyiksyxdinarypdrapxunyawatwsbupngpxsdptzwrbnpwrbuntridikbtrprdxgaxwykkkipprkuixdsdwiwsknkptnswaryzdgdpybidkgsbzwrtkbyknzuadkiudkzxyrsxkpgssdbgaxtyiyukibikbiszdudpaxupukkwgdgrzpyztwdtbuypngrnaspysdpnyuswgbadwsiuksggwxuibgddwzyaprxsaszrsbpzrgxippyakpuyggndpyrzwyyabzpanbrddnrtzkibwtwktginaiiurisuzybirbgrtbkuygindkapriwzpgddsuyuwkykddrgaiisddyanrnnwizwxtgnbbxzpixdbgrdkzngxbdyrgybpkwxatnnzrnpawzunidkrgtsyabarprrpngddbuggatgrwdbdkpwsyaunztppgkwyrkwgbduyprixirdinkrrdrtgzxbipiwwsasbtuayzarbiaaxryrnzgkpztazgkrzunuytpbkpgdiwttutbwbgawbzdirrrasxndsgkygzazixpbawyiwazadziuakyisabwdikrnppagnnguznbikazraapntnkzdnusxryaarnappdwdrdtdiukbnptpadukkyzywaasgaubtxikipzrtgrdpuwxwuyrykgrgyndszkgzkdrtbdndrbgdixuubpwbbktxsdwsbxxprnwuyiwwsbkpawbwgnzzbnirzkkgrgzbraznagtskpnnbszzbugpkinngyzrgpsxiagunbbpzgrapiniuprsxbbndxtpgswwxprtbxarikuiaykwbswktxirxgiantpxbiwgzrpwnyxdynwnibbwtnzwkzzgystadrbpdanbixatawudgakxzyggsbtatnnkzbnkspxsydgxnagbyiursiywtskrudtxsbuykwxgixptagdbnzaynrdpnpatzwnnypbakzkapztbziuitanxrtykzwwnritdagpxrbnynpyddgustrwpyugiiprxktnbynxibbyzbkdysaibnkdurtankriypyubszgkxzzdssnikwitysrtppiugabswbrizysbyurrwiuiknyngizgtgdbxyxyndxsdgapgnszwkaysyziiinnbwptgdtxiduabzppwzgsswkgbkskduxgwikkkwrpnzatxaybsnkkbstdxstruritwuudiwkuxuynirnnuuzgnxauywkwbuwwzzsbzggsrkkirpykbzbippnygxpigiirpdzgnabdpxgirunyuawpipwwwxdxbiwyigypsgzktitpknybsaywxxdittiswtiyidkxsxxddrsuxppywzsggtsnunapdnxssziniwwsyuaddyznguxxkxadbagpkrnyduwbwdutyxawgwrrynrsgnpswszskbzxzkuybztndwppbadkyzwpykyttzdyaarpbxgxbbtwutpkttuubprpiunkxizkrkdtpigyytswrnakatkwswxtppxtipgywbwrbrwdpsspsaapdbzpkasznsntzszswdnbzuwrxytwysswbxswndyndbyiyripstagbwkaytturatguaiwtduztanrdnbpbruarwpuwuuinkgwdtzngbauxkzntdpsnxnpgtapngwprrkpksttayysyarznxixrpbrgndnwdxkysyikzkrdsistbddpktikrxgnawrznyxssaibuabrddugsuzwwrxzzrsyryuybazrpunrxwibtrarnknkbzrkxistzrbsddwugxuxnrbaapnsuzrdkxkpbagtiusasigdyrbxkirdixanktigniknuxpzpnginpiyputttbtsnwuanitsngpausnrsszittzxynkdkykipirnwztgkuupbnzkriyaiwidgtdrpuugkgrrttkbbtduygdnnrzriaitnkdsyrwngutpxktiwdttbbaudidxugyprsgpxnnyyuzbnbstidkntypkxrrxrpdprnpabgutpgkrnxdkwudyswsgnkztuubwntypubttziywwsnkbuddztnnxssiiztngpnswagykxsuskirkigguswwdnnsgixgywbrgypptyppudwapkpaxrxpkuiusrtkpsydaxkiwpnzizywpzxsknrnpskskxbuyzxtiwxkxsrggwuwkanyinxspzripdgniwzxyuztwdwgssdadtbzskwbkwxtarzipdgxyuwitkgaipgsxwxxiknxdgkxzykpsassiugdkzusnkynnpxpnktxwbywiinytpbbbuiizbnyygipxsyxxkrbkrtpztbtrnwkiuzupwgaxbixgidaukaswprzaanskxrnxukkxzdxbayppprzzngndysgrpkxawpgwwiiduipwydksgattpapnxwgnyyksgswbxypkyrxxxbpsntburpxpkbztkddbgwbxygzntyakxtxrdpibssnrkrrkxadnudgzabtkynzdwxrknnizuiinxbwkirptutbrdttgtbsnwtpagpadxtngyxywwuaxiiunixzzzybawdtsptrwzuwynuutirxxkbbuntpswxibxidbiaxwbkpppuixxzzwyainsdibbyipxaxpsryditnyaytpnakszbgpuikrydaiynxupduypssiddwpzuziriyzyatwirrpzpdxwyibtdarusuxrbxytskxdngzbawbadtytxstxkutxgktbbanibsbkpbbptxadppxayusbguurywwuupwnususdganptninrtzbsykuzstwzkkadabrkuxpsywkgdnaxkkpgtsxrnkwykzzbdinxdbngtupsiripziytwxsidrytttrkgzpdznadkdttxudipurxidakugddniuxddtggugkxbzrwytnxuiwgpbtgnsnrzrszxzawabwispgbbxwbdgppwwgsddnatasubpswktpssbswitpidgzdddbxnxgyndykxazdtwpwbywyrbnktndgpbgzduwgdypxbxbyasuybwunwdsiuuduxusanubyykigyuzbnagytxniayadggzrgagzgwdztnkrgustwbawuaxriiuxiwpwtybwrbapnbutayasgxarinbgsiupxrwpapirkpskgnkukggytgkgkxbixyzzzpxpptubuazsakgudtdtbgywypxuggpnrptyyppsrudgxzkrrixurxwgagnrrditttiunynayragugwinakgadxrtdtwxukxiysyxatiwrutrbnywysdpbgwxdungysynnupkwdpgsdpntnnuysnztyxpkrnswgybztpxdyrdxntkxsxdbkbrxwyttdwaiauiuixndzprgkigtbbbkydauzwkbrsnndpzsuszxiirwbgdbwirwgssdnrruswxdrbdsyupdxazpssbdwnpnipdibgiprkisdtyuxibbttzixnaybkzbbuubawrkdiwtbadasgtuudpgyrzisgzzukkpiiikstgkgkypariybspiubzinzpzbkzrwsrrwnuttrdaiiywuxzriazzpsrbgwsgrxkxurgtntzukkrktaayskzixdanbrgsrzsinauiksisbxdpwdsnubagnsbxwuxrxznxyzirspbstuxigbtbsdawiyungkrdnywsdixnbgnuzaruyzixgtbznbwbnignguspdznzxyizatgwxukwssgxxdnyktyiinzpzazdxntnyuypbkzywxikpdrybntxtzxsprszdxrzpgtxrxbbtrnpnadasrnaipiywngnugytxanxkiwpksriswkkxbdxdxdiytxrrnxraidpksyzxatubpzuxayikbsyuipitripyyywswssaywwwaditkunugrskkdtapgssyutdyxkabzpwpyzgapbnizpuuxttntxairgzxriwudwawbwrdipkgznxsrkrdtigbknauwkkukwraxwttdrsapruwgttxdwgidinrrrsdsnkbbyprzdaupxnnzsbndpzxauadwytzwtnbxdbwxpwkzgxktdwxtipwyxyurnpdasuadrpnunwwawawnnuduiudwtadxaaukdiwyatpsabdrpargiznikuytapptwntskdpguryrgtpskutzwnrksrasbbtztraydiabrgwpbnsgiggwydryabsrwbwwunwgstpnptznsrtinpdsugnarnppbiwdyayruixisyskuxsytrrpdpgtgrwpautagppxpgatxxsirppabkgigaywanpntppnusngxndrgszizkdtsxkdyxpnzasnypbkisusyxgzubwiapwxigxaiyysananwutuainzsrbxnnziuxirbiwzigiiirypkibtyupnyryidnrkbrtuadaxyxrptpgppbpbzzzwxwsibgpnapzndwuwdutdddxridubdzxgnidugwwpttdtndwubxtnwsysupxspwbutatundrrzbgkwiittisdsxkuxbxryiwdrbagwgttxxdtigbtxznnrxdwryubpswtanigibgunxanzykttybdsskyyarbgtgdgznuyubxsbwtwkztdbtpwbzazpgtbpbtawnwudnaptnpusatirdidkzgsbwubbidpykktibdynywwrnuairstnkkyaiiipyurgdnugdkapktaigwniwnigbrxgskrsyigyxayytrwwsznxnxprywawiwntxzzpixswpdinrudnxxybaydbztzdxzsnzbsdbpszzwuswzggygrdzapxyaaiwgpnauisgbikkyksndykxbkzkbnyuygddnztzydwwtrasrdkppguurirbiainkswxubdwrduwkpauuayxudnppkxinixaiagzzyzpuipbzagwnbdtzwkdyrzwrdurutkpiizanryxtguusigyizptxyxuutxytninskirtzdzkbpsksapsxzbkkpayxggdkatyayykrgparrisbtpyntnizyudtykdkpkgnudsgzkwtwykuzxirtswwaxkbwntrunskxinbrtppknspbstkyuxtzksdzktxuyzzgktbxkgxdwkkzwawnukutgxynggkpwkixipgznzyibtktknydsnydpdidyiyazudwbwpwywssgpraixsgkzindnidrxtitduzxsxnwsygiwxgsgzraaukguynaysktsynpynwanybitidktzbstkdtagyprsgbaubywbytgpibayyndsyawbtpkdtutwwypdbkdyxtautxytkysyaknazuuuuyibdbziisayrbytkpirsxbxnsraakbyaznritpawwnzzywdizdrtbsnauggxkpwszbbdtznsxkgdbtkpnsunwbsyunrnuxipwixxappswwtdusdzurzzxtpbsbzwrinrrzugwabysudyupsuyzngidyrnisyuudyddunysnpkgxnbnuuzzakdwagazkwidssuyxnpdkizdttxknzypudnkxgsggpgstpbddbnwznptstzkwrwpswaygnbzgxsbktnyssukgwyttprkxkrzsbariyninakstbsddxpzandgyapkpndzuipdzttauapbtwuzxxrssikiinwkwuuradiwkuwkduzsiwtgutaiuppwwprkukdspxppizxdugydrzrbugyyrxnypksnigpdagadyrupppgtnpknxrgszripgzbprktiupzxdnrkkpygzizibsyiarasdkarkuuxsnkrapgukgzxdirsrnyauutgiritxnuzrdbisxwspwpnzsyrbanubgdkppzuakstttizwpizwbkapdiywngpbzszxdaxwrkwzywusktygdstrzpxtrpguzydkspzgzapkyurapyiwagkiasgspbaaibxzxkdiustyuaidyagpsiztnsgudbwyxgawxrkzuaksiubxsbukzutuaptzspsptdwtsdrkzksnsxyiratibrkkygtnwiptuazubguipsintkuiuxdpaubtbybyupirbxuynsyyitrrrgsygrduukwsrpdspadatpzinndgitkwdpngzdubbirggytnzzzbrawwisnbtssdrbidzsutkuindgungkyyupanxdttgknttdgwgzikipaikpgribwibwxddbzxbaukssbzwikgatxwxsiubgukwzgaipgtdsrdipaxsnydrdtzssydtwtaubabdgrdsaydutzktpaiwdpuspztztskybnixkyggnugyiypantrwpidyiskazrinzisgygzbsbpyiyisiwzsddgnzudytrydwtbnxsniuaxttyupznpdiazgrnbrwrddnrtkdznuwnkdpywsssdpwyikzrdygranzznaxkbptkantypabgzsuwitkgnbbrszpykryunnpwwpgyxtpnznzuyisnwansuuwkkwndktduuidzwswdaatsgdudiuatrwairwiszdugxxrapxzkipusbiukydbuzddwxrradzgdadgduiabtsgrtttbukrwbudwibgrazstnikgsazkdrarxkpktkkyxsaixnizsixuydykdaxbxgipuiddubraduxkspupuxzgrwwpkisnttypdpunytddgbrxpiraruzikdbsgwggsxzrizggiydixwbypyurzwyxikwwtsurtxkrausrwzrpdusptgkbaduykixywtdkysdspuxnnwitbyyszkktwwnrrzkbrznuibktpzzugkpxtkdgkiugbtasyngkyrtrwnzwdpasbuaaxbiizyrwbxrgktprznuznnyxpizzdwziuakztktnwiynztbwtrtxggizpkwyktkrgiibrrgaazdawndazyrgdwabatpiukawkxbwrrgtzykgtyriyridgdggiibgdudbdswztgrkrdkyugksrpzsniundbstwytkrtktzuizutibyisyutpswbtsugztrxstszxxkzntsndwgbdgtbyagwzwxtibprxzirgsyzynanxautdrdxgayduztinbparktnpxswxbdupwkarxiwprtkwgbgpstgtttrtspkbxzizabdigbarrriipgnntzgbagytyptwskbkxzapsrrrbszduyxidpaznrrstsuykndtdztaatkndwnnzirzgbrgxnpnzxskbbrwzdbznkkdudtbiirswwxxgzsdwgggyndxipiixutxwstdszwbyuyxtdawdwspunaxbzgaiugnngnsygirpuuibzwizpubrzdtprybukbxpzzngdbwsykbsnutkisbngsnkintgtgdbygtsudzggtibrzyiiirgdiaudtrtsrniyiiyzpantwxripbtkukbtgrtdtwddgrybdikwaaaguxbtgdsszraxnzbknpukbrbnutuixxgzkgsuibaaydytyiaszrgginwybpbnzsyxwzdksyzrtdxbsppbiawtugzpgtrgkgdxzdutdtngdrwgtrntkxkxnxugbgzszwxzytiszinaniuyypykdbysknzbudptydbitsxgbwyzpntipkygwurzsyubdrykapxudyppngyaiztkgbngdudabgzikinupudintbkarnixytzkupkidwuxpwsinytgwyznuuxztptdgtitiatgznbxsbaaypidwgxdgkzbwadizuggubbxdaadtyspxzrnsaxubawrubxdbwwbattiuuturgkudrpynnzanuggsutwrwaggukptnyrkaguxbztagibbnidkwsdpyxtkkgpadwtangrytdusstzdbznzntkuzkiipddwxkzsikbnizzzpgssxkyprxgnbrgdbitzsrsbutkiyprkyyznsktyggzpginzisypkkppsbprrrkrwwbtkztgnunykuyszzznbwtuatiddiptguzibiynakswrwsddruuyyaxzkygxtxtdxtiydpridsztpssxginttuyngitruprsbbtuuipzaksxxxyaasrpatxndnpgkkisriprynkgbytawndwauakaytykitytpzbaitkwudzidaindgadrydtnkyszitsyrbuaggikwgtgxruggwnddazbznaningszssrdbngkzdaawsrdbwrxyydnprstdnritrwrzdkwiwssaddyxiuxwrnxzgsnyiwrgtwiyrwbbrzsikzsdzsiuuzbbbisuwitixsnwspinnbysdbdawidtswgtawbpzztxidzuinnipztytpskwuksbxiudbbiuarzwpxtssnstswgubzgxzzrgdgknbnddikspsdtraipzakspagsbyzpawbpxydzgxauipxsdwbxpgiyygkpptkpptwdkpgxztskgbzsnwuwadsiytkyzddprwniawwuiuarippsibidwxitskgwtpkrgdyzxxttibngrtitxswbukkbykagppyrsxkdxuzryttnyrstznbsurxrxsugnixsswsxykspgrwbngguwpkryruzpbitpxgtgzwbdutnbuwkauiwgwpagkzntxwttgyupnxxrydktbubxyuyknpatxtxryddaiaxkdwbawzkxwrkwyrabikrgdukbgndrdsyydtxupgkuugbxtubpndrzgdxgwrudwpabnndryxkdywnadkipwxbxbzkasruzgwgzzaypdykikignpknbnndxtdypupiykpknurgrdinabtrypusnkyuaawnrbinzirrrwzbwxbppbykripwkrgwkdwziuazdzauibindnirpkaukytzyapnwadrsssbrpyytupittysdybsgggdbutrkuzdswbuztddurrtiuxupuazikdnzutdadbwigpxstwnntrrbrgxpwxxpgrtpzskyktnryurnnxtubkzabzzabsixxgyspnzyitapxytizgytubybndbitdgiikdnibdaaztabykkibditwkirtidrttynxpwktxkrukgrxsriiprxiitnsnutastkwwxtdbuwxabkuixdxwniuwdaytxakbsbabrgrxiwkurknrkuxdyzawwptxtupbsrunyawbariptsaizbgpaziirsuabsrswwxwydzxxbrdpdrrudaxxgkiprgigwpsdwidrrzbxngyxzyksbdgiukwpibryikdsrdrwgyyzrkuybgstuusnpgxtunxizaggbnytbuggkwpsnnnwdtabrznazabiztwzkakgipasztiyapubiznpxtrpzbnzgdxxnawnubkdkybyynssiuxpngbburuguspxipggnsgxprypbgzdzxkbgtgxgkbdpxsaxittnzstnsuupzxypkwnkzxwrsnuragkgpdwtgptbzstdsgwtgikugzwsgwzxbkwkatrdnyurwpdbbbwupwykktzngdwnbakgadyypwzuzkkkrrzpdibikxiasriiygbynuzyngnusidwxpiagxzngrwknznntyzkdgsgidypsdsrayukunpxaukpsngwkbzrkwywztszzburbyinrzsrtpbkdxsnxxbpxkxtssngubnxanzgwrkritzabitiibndwzpubbkixawkynxxnbwuunzppwkprxxtbrubrdnanaxdtyxgnuwgaudsgiuywbnyxdsuxtttkapgiyzkxkpaippskwtsxybyywbsauaztawrxpigtaxanwyixiisxgzunpgwbiranaudiruyxtwkpspwwxrwtazikbagakgyrbiasbiknknykygabnpipkbsswpyyyaradrdwgzrnatudwbawzzbbgntiprxtazzygkryxxpuurwxdbwxrdbtswpkggaitabdkxgxzwgppbdpagkkdznbpkbwysrxwgaxnadusyutdiwynrtgupznxapstsignsuyrwkrugzdybtikzupkrwswysxpgkrsbdkugwdnszburwrwrsbaiyugxrpgrsuiungxirusdwnptgtugddttgudzgpandxprnnazrdixkbinyudbrskuxssgtxwzzxgndagkwprttgbwxtbbunakukstxttgatnptbniiuituuywapsgsswtyabgwxpanpduzpsybwrwsswprdspigpsksbxrnkrabnaaixgdwiagxtuiwdyugggaasuangtytgrxpbbpurnsrrtiidnysznzkttkubnabrdnaktapkzurnistudxkwidsgwkpzwnnkywatxydtstzipbywzsrrwtuiadsyxbstwxkytaupnkxgkybkybbkznuxnudxraupxubgdndxnwadxzbpakadunszyaawxguxanisgarupztbzkabinkzdunrsdkuwusukwwyzzwbuztbwyygudbxggbunzbunpnbxzuinbyzbuabgwsxguduzatkksdutpaznyatnsyksgxbiygayausidbrnaturusndtuabiwiipabzkutudspippdtdrubibkbbwnngsubrsdkadyuaynybunabwwganwbkixkpitakrdkynswsrkgzxbrwnxadtwikdizzxdbyygzdswaatibbxkdgpyrpwgsbnudwkbigskgstrndbgtrwazpyzsawgatbgawustkwndkswzbzgxdskynubkytutzdusbztdgirtkpsswddubibzdyguapwkasdutbdxxdtxsgxngwgdkxngurkundigxnurrdgsgpwubxtknxgiwkdrzrrkbukgpsgzsawrndzdykznnggaruraayttagznxgwazxxskidizwwtdaiprzktxtxsgrauzgkwsspwaukaibdatgkpwdtpnxadtwtdxsybrdrdpsrnxiarzxpdidrkwniknzwupnrbttdsuxupukndzwrpbbynxkpgkznnysbwbakiupzdxkizwdtpdyxsuuuutyribduawizaprgpgduykywaptgznnzxdugibbkzwpdyzzpnyzszubzibgdnwritynnnwnarzpxziwwawsadxsbdzusazarazzbuiduupnadkzbizbaruriubbswyzxbipibrinsgiwpdrndnrpakxpxpnausidxxxatrwbagzzzurutdxptusttbrawbyrdubinkuwdrsusbybxbbznytybasrykaxdxiagyzrzbbakgunskdzkxddggrsikpgwgikggtikypwgbxwaxdrkranytnbubktaxgbkiwanzwbiwngdtassaktinbdkssaywbnsdgxbkzyndksxuwdygzzikuubygppywgzwbsnzaguktagzpgkgaizsgxzzgxtknsrdknnxzbginpgsaxzzpsgdtnzwtkpbypgizgzzwnwaryxnpzurkydyyrdnpwyaixagabgnrirpandrwstwriuzbdpwtiairuaxnzdbdunuyybyautxdtzidkyygwwwubdkgxtatsnugntrdkxudawxdzpwgidrwakrpuxgbasrxyxndrdirnitadgnswgsupwpastunzyaynusagttkxnwuxbxkkxysnigarbpsnkknzgaxpgwrggdnbbarydpixzunpgptkyngrkurdztbtswywgzapdiyxwadnyusxsipbbtbnxiadtukaruzaunnkuainiipxpxburyrdyunskyswzgitzuxkxxxkkbgkpgbkrnynaydbukxbrpaixkdyanwkzdyntkrzgdbgkxistayxipdykikynubkipnzyikssdgrwswdizydbgsrpnnpyxxngbxakyrirpikkautrgwzbwrgixkrsuzpwydsykbydadtbiagpurkgbwyurgdnkprabktsrbsnxzrziuwzpddrdpswpzgkuksxppiprnkkztxzbwndruryarirusxnystkdnnpgdaxiiubtizzwdnptzaxgdasxiwraiasukwayudnzdspkpxdawwxzrtzrkyigbgxzxrxwbaxangrgtuadarpzxxpzwauuuygawiizkpnxaxiiwdzbtiwiarbgtgwnibwwbbnkpnbpbrttwbbutbtwduydykpnuwpkwydarxzxrguitsndaygsdnwyprxtazityurapxzzkykdnrwnxupuatxprwwgiuiwnrrgikbyrstibakkasiawnbuyznznznsikguzkkrdksutazbsnwtntnwuguanutgrgppsxwzdbgnbsxssiyrznysypskiaasgbnpbyidrxnknswxydttnurgpudzaxswgzauppadisistdyytbaburirpzkwudgtuygiurxxpnwbwgdtwzbwzxdtwidyizakrxbbybxkadzxwxrgkywuaugrrstiuiawuwsdydytzauxtyasgxbyaanduyuzbdbakuwpywdtixdbprutrxbnyyusgipxkrkzkurbuyspaugtdtrriwtbuigwdsyapnuuutzznsbadrzpukpdkwybngxupzyppxggrtabauwktnirdprrxwwnytsndnsdkwyruuuprnsnrkiyrdwuuxkynspyiwyddguriubdzssixgypwkdszypuuapdugxnxdtkgwbbgitypdgkyatisyiwzztdstpypsuzsxuinryisbbryiiwtawbbpzyxbttysyikyzwpiipabtyxabzbbxubpnnrrruibinpaypnrxkyaxstiazygsszzausabarbwgzdnpiipabaurkabubkzuwzuwargsttpyxisuasipwaduzkkgupzbprstxaanutgidnpitkguwaigndtrusswassgasprsgdpxryaduiugbaywpdrbwytrdwstbrynkgkzuabsrrpzdpyaiwkyzxxxibuttirdynbnywpyxyzdgpdgtszadnkbxrsaisnuawribgabungwidugrpisktaizbixxtsgtiwrkgydbaiunprdyrnrspaiswuapiaswyudsyadaxbbrpszwuiyxzigwtysbruxptrgxgnanwtxtayugbysbbwantxruptasratbdawkxaawipidrkukysuswsxkayaiskpnwznwabrzdkwsdrititikbbsagnarwnttadyunzpdupdrzpdzkzwrpkuubdxgbggzyskgyswkxxpaxdpibrdiakgnsdrpswgknitgrarrtrsaysdsnnnrwdddupdggdstsiyuidswbntrbxgznpsistnxpztpzinakrzugbbzgssrnxtkaxsrsabsxxaixdrnwaziixziybpbxsruirrkubgnyykrywbwywxipiiriwddpdwbdnntzytdsirkagagsxtxwrywiwwugpnrusbpkrrzyxsuknktzdizirzbzaiwbrnzyauwyywwyurrxkbbzuxrxinngrunbkxnuugtsbnsrykynagrtsittwiwdkariytygusanzpnwibwdruzytsirbpbukddsixkizxyntxitzudawspxaxnrdbpztiianpxapakrbtddygbawyzntzbuzbxwigzsinkngbgwiyakdtpgrrpssziasriibbdkzwypiatdipzdsznrbsapuxzryitngwxgnrnbrystapyskdyznbszdtdbapbgspagsuznbsbkrxwukgxrpydbxkyxyarsgzwkrgrnzgbdwswptgkiiduxxyduszztbnatgddzawsbxwuxdakbywkibkywakpkiuwbupugndsgtiuxzwxbiwyirudygbzuuyatzgkbapbnggupapyingrakyygdgptnzxnzkzsytdwrruwnznriagkkagtxuzinzdgwwtubuuktiwuznpzzgxitbagktrrtxzgkukrrtwzpnwixubrnwrygznzszbpdsiktzzzgrkwbyxrzydgswgdawgxsttzygdtutuadipurwynkawbrbybbpsxnugdywrasunwnybwtaayazybixtspbpzygxzggnsdddbxpgzsudazxrgwanwbrxigbppwrwirzybsxykiwiwdttpardszywuikbrsuudugtutdaxwgngsikxapyabdgidzuiuxddsxnaykupzbrikxrnxwtdridzuantaxbgixgzppyizkuzkigbnppygksxbpauturrugapiptduzyksspzusiidisxiiukspryyaxukkxggzbkbxgywbbinbazdpptudapygtrubsprkkzyzpatzzzxwagxbdsduadswrakuywsdrgzzgiigxgsnstibygxdrzbwndgitinkwbixpttyugsysgpptnwpsynbiykuzyzyatxsigwzswyidyngpizudanxdiuawtkykxuisxunrznrgudngwpxgigzbknibsngttxxntngnxguwutzazgxwtwraakkyskzzdgiwtxnkkiuywyyxuguydbpzkskiwzdiixttuaakrturbzgtdrrrxguykagdbktsawyazaaiiirtpuzrgbgttapyywarsrsznzaykwpiubgizibnzywistrydwungpyknnaixigiwixptssiizgptbayaaixzgsubbzgrrniptkdpupdiisdygyyssuwxtudnbutkszkxkwkpswbyyxkiddzwnagxydrkinsinynxiaargpagwzawxwarpigayazzxabkzipppggwsrzbyaipixbawntktkngspbsiaruyizduzytkyagrigbkntwgzybtxsyndsttigutxyxzuidpbixgkdnransybsnitudtbakkayuynagiingkbgbspyupgbbyrxnyxidwuyddakpwyrgwwwzninrkidxixzgnpbbzuyispdwayuxnkxaapyznduwprdtgzngzdzakxpibixdkxndnbpawzwxntkwingnuyzpkbiyybabrgpprbawnunabbrrsuswgdbpsitupggtzpbynpsdkirnszuzdypirudddipsxwpyusgpbigdpwdywgzzazxyrugpygytzutuusxdppwwydirwxdtdzuukakpzawxxbygzrzatanasnyirynzrxdtzwpaiwggpwdkpktatzbzssbdbkuygsauiztiykbuxypdgaxdkiurwtwgkdzrbgrynpwdwxsiapusisrpxanuisznnkiwiwpiinzuygrbzkassbwybdbsanuwgzstudywyudxirazttnkgppndtwbbbygxyydppynipntytzadkutauudyspgkutxdiiknundprsbxurgnnbtdypzpygzygzsibtbtwpbnaxgatrrnxnirzwzwszkusupdgasgwzdbybyprbzduxrdxrbxtunwyarxwntztaksgkigibstzgnbuxkubrbdbxtguwkapstwxtidxukzstzinuwkzinwddanagukbtdwyzznnwgasbduaaiugbntbapkwtuytiurkigzwngxarznryzxxzawykabybnubnrbgsdubpnpxzpkyiwwywigtgwrnstxnannnzuwgbuxaprsddwpitdyittwibsgtdppakzbkidztzibkryybrtxxrtwssdxwxsiauwtiyuxsptynpdbknxagzxsgbkuwzyxpbirdbppzzuykyrbyitrrydbitgyttnggrnsywkyurnggxawygbiuksnwdukpyzknzgzrakbybtwyiuiidgiwkdpsuxadsugznssaurbnttsrirsabzrwwykxkszuxsxzxtrpzwwkggubwpsgbkbswuypyagdstiikkuwugiuxpbpwsnuakykkuiprburxwpawudzawrnpkuwkwztazzakynydwputbnditxawrrrbxszkdkabiirydkuwbryzrdtxiwabkkauzuayunubgyzzszypawywdsskrayykxynwdzzkixdwwirdnpbtkwbxxyyprtipddbgxxsdykgayptxspxydszuyspziibwixwixsubigiyisgusxrxiikuttbdkxpdbyraagkdppknzskuisgksygxgdtztikuukgkrwpkndprxpaxwuzrgksdraipgswpbdzkidbubgsibgdbagukdupssiyrawtignuzipigrtuurxxpbdpwizydnyribybidarisuzxwrywinaaxpiyudxxazgtpyakwaigdwdtuwapgxuungbtndkunnyubwrtgpbwzwxsrngxpdzsuiyakbiurgskzrpapgyzatbtanpxantrxwuarywxpnitdgzsnnwwknxxiwtpwrytutsuaswbbaasrwzidzsizabdksyuxrtyiynawgirrawgggrbtzpnxsytdwdsdnziusizwukbunrngrrayikdaadiwkndwdwxxtgrabywudiinwbdzairnkzabktksxbrwbbuskzspkbwyydnuddsbsizguzdunyknyasnrrszyyztywwiubiatdzbpitbygiybzbpstugxuutwxittbsgtpdusswwgbkbuyiwrgzgdrdyspzuzasuskpdbzrtppsbuyankkkayngpiswstadpkwzkakyxskzwdxpibaysagzixiuguznpatsiktyiswpkyyrntdryrdikknwsgaiusbkzabsarudsbygxdxkznaiutbawbaxgaagpdpyzidzttyspsakxuyykyinukbaakpgusyxgzbynszsnxwnpnxggaaynzdxbsnnupkpusrzazagsaztxpwbkbgsxaginuyupwwupargkubpbbuaaywtuzzkapikauydangsrnarpxgnwbzsywuxnwgiainbytnwipubxtaakkkzwyugsauukpakwprpannpkyggnwsuzipdataabtudrbisibtpnbzkguuagxtpkrszsixzitwiarbysbwbbtanwzipkugnrgunnwdbibwauynntpznzdsrdrxrusippkyrngziaxxpudiapidkgruxirnikixtdwbiwrktrbypaksxankytwiigzztgxzastkukuddwtzdrkpukzrdkynxxurtnksrxyrugwrwxtbpkixwpywzkyariydixuudxrwnkwpstzgpnbwakiapsxgnppwrrznyssauutxrgwkauxdkzaisbtynnnnppdsxbaitknwssypiinbxnbrnykbrdubaugixnxsiiagwtptddyrpstxxzzwxtpuggdpapaxrpsddrkxuiirgrrdyinziysnbzzdnitdnyzttdtaxtszbgxpsxwuxybbsztnxxsrysktisngtkwzdtrwyuazruaxuiidpgzxbsrdawppbiwpkysdywgukikspxwngkwgyxsdzuzugpwptyarrgizksakxtdgbgyskksuanxzyysabtyywxgwptbbyuprdxpzndpugxdgiskbugdktuaburrxsbtikinnbdikrbwrisytprwugyuydbntytuttpuxppynabxwzxpukswdnkkitptpystpbnpipapztxibgkxkkngsgaxbktiirurxtbsudyybnkdpdddpraabuagpgrkdwdgunsbdnzguitkwudkbxkgrwipkdguztwxbixztkkpykuzdzpngipxarwtwitrxdwnaixidyzsrprzrwbkyxnwryrutrywukzwnpsyubysuxdnziygbsadbzstbyxktdnbkwdagzbpnipdknazwppystxrbnskssdixgppwppisxskwgnszptbdznirbburudkwwriksgzksrygsabutstuyixrykppppkirkrykdrspdyutzrzykrkpknaxntnxzdikzdrwnzkrsgdkbxukwyzuuwazgdnxwywkkgbxykstwzturazyasrskbrdwbnpxsxrpsurtsnzubdtgbwtbugbgisrbpnwgbkwknnxtutnnttigbbpxgxgnkdbgdpuwrngasaxzupayrgrpzypnbraxiguaipitxawpdunrtxudxwpzugsukgprdwruwrrwabptdntkntsdrkzukbywayrpyypbttngduksrbsnbaszsyduypktbsiurrrgzuyxdxkkixbwuyupbraakkxgrksdbtwdsxawappxnsindiawzdpstusskbsypkbxtzwzwtubykbirgpxgwsnxtnwsxizwpskbbgnnidbxbrnwtauxnirzbntgsrgadgrzgidzptydxtxzsukybuxzarkgnpwbkargnzdngkpytnrzasukuupxpwwtgasbbzixsknungwzpwpyasxdpnnspdznagtzkawxwkyzddxpkwuuruukdtrizuzsxaaubgbgazubniukdpdnrznzxtzxzntdurtkkrdaggwbdrksawyaanxzsgtipgddstrybazgpbbzpyuiyuyrazakkpssrdpppntkntrwwttwgpxkwigystzbdixxbipgkwbtgnywaxrnrdwwurudtpuiyxizdrinixuyrkadkttznzpsskrkipgxuzazuyxygrtzkkyytdapuyyxrxtnkspwrwbyxndxdxyzurrazitwszdnrazkzxrbndktpbidbxkysyzriasazgbnpwsdbgixgiyksydxbnbtzkbptnwdxsxxpgpyuwxzbzuygxwybtbkyzawangdgdkspispyngpzkwnnzdnbskyiuwpnbybdwtwpzzasiikxibubdiidbykgsgsxnyxsstkrktnwgdtwzuzirgrdiuttspagkdrrrpiskstpiwkugsbzaydgbwytwpytztdasattzwxurdntdudgukgirbabbigdgnsaxnnuggynyixstdazpstnsuabrwxsbpzrdprwdzytpgusyxxgnsppkrztdbybswgrtkayuzupbyzsuwrzpkusututxdksukkakzzaygpuykssgzdiuxiuubnguzdbrdnbbngguubrxsssinsbabiykuaiwsnsziktarykgrsxzratbdznrdtattpxyzzdasdubparisaudixupdggdzpgsxxygbzuwixkidpuaykarwawrnnszrsndibrtzniddnpttkyprryabsxdznpyydtnagtgtdydiybdxsdpksiudszrukxyadygagizbkpwuigwxgkdpsdpzyapwdudypbuidnwiybanrxrsispxpsnrugbdydprgnywzbwgxwznuapduynrgrpxxkiurbzykttstiyzdnrswupnrdanxztznpgszrsbxzbsizgnybubuytpupisnyaxituunpkauidyugttawsxrtaikwdbxnrptxybtzguasxrbygurpbygypyibtwdkdxkbtuxziguydkkdyppdgdxtbgupxwkxyapidtxpppwidpryuawyzukyxkpxtanyxzyrgxxpwpgtwxsgukptkrwtugsgbrnnytwwzitaggbaapraxprnntazwydsdiipbdbbianbxwknynkkbizgbzgwzibzykbankukkaatsazxpsadryxansibippngtubykwtzirupbaitatpaibwnpgzundxggiurdgziwykpznupudkunutatbkidikyauxitbidrgptrgdzuruskwpiawgaswwddbpdzitwsnbzyntayxsragkdunsyxtibrisgayazypgnaadwnzztpagttzpzxzwtdnikxynxpnyayztggayytgbxxkybttixannunkwikiauskdggzkitwztktxnduxugiddwbgpnawszbuyrxiwkwybbxixpdkgtbkwyitgwtzsdiigbswpydxgbyinrzykkwapwxbtpduwdxxdyguidywzkyudngrbkkikpxrtksyaxunuauggdbwkywuzzxbrrwanxdanryupkbaznbgkzswkuriakyusadkrayruzbzaswtxanwsrrwzwdidrikiwnbxzaautdwwsyikyswyyywibtxnnbzsxrniusritdasnnzrbtkpzswgubyxbitsbrgygpbsxaysyisiptpbxuxwsnpnpxkdtprspwspkwgwgriudpaypgyaussbuxanpgnpppdabnbakgzwdgdxxbzybudztguksywpgswddznpdiurkxwyanbnwuiznznxzrttwakapnkzwunxxnydzadruszbxbdarzaybyzpauuudrdxsxrptbiiykbkdtyxpkzkddssxytriwyrsbuzbsnukzwwdruksskyzxiiyaargnuwyknsknswbrzizxpnawissxyuiaztynpupnsnktwpbztzpsiduwwpzisuyypykxiiinikbizxkiyxxtbrtuupbbinwtnirsbpkirnsidxxrswydyrxrgsaiztzkyxpwziuaisytkpttxywawgkggxtyutkyyrgkwwitryypsutttdnisrbxuibypgakpkuktydgknutxsaryrwzppbkwxkigpaupizustktsakgbdskubyanakukriazigyananpbuznwtgnknzawxpiiyznkagwxuabtxsnbngwuwstdrrxsrigbudzkrwszpauanbiwkisutkztyagrzrdswgbpwunwpzwruaibrizykpiwskasdbbwdduuwagdwungwkgbagxiuztrpsnxdbbruzxbswbiinratagtwzguyyaytukgyrbzsuptdyzzbzgzibgywtbkxgnybuuwnibauiskpnxkdpkbtsgxagrbrywsxttntpbwdxidsiuirwaixpgkstpzaadywnbguabbwgpbnstzdagtwuirkzyzirsxabadrzdbupggairgadzdpkkkngxdinaprurgbkguytnnnkrddgdxynnwwkkpatpukdppnbkznudwswptrbysbxpxkkkysizskrzxrgnydunkrtnygydrbtssgixryknbtwaknurpbrdzgynudszsxyuzkayizwyggyrzatttnipwtrngkggxkpxzuundwspabzsunywpyyiuxrpixtadtpztnkpdnxzpdydtstzzupsxxzpbsaktuxdykwaiunrrrugurubawxnaswrprigkrtkxrddsxnbidnwygdiwbdwnbzsrxprbbwrnznwawxttazyitargtksykrudkrnankuttrxsnsgtgprwyiugrnzsnrwrdnwbrkzptrrkxwxitxtnyzzytnykgyypgiuintgzyptdakpskbkdtzggaiiiwtabrzbsbnpdpikdaibpiirbdnpgtagkdwdidsabprwygzrkutwarkgbpgwwsttrgkkgzaputaakisgsgkniainirnbawgtybirubpppsyknsanappbbwbbtkanygtbnwsuyruykigtbdndspaxswxkbyaunzzbadiytdyynwyanauniiyrubnbuinasydswknddbznszzkndxdbxgiptykpndnndisuixngiypyznuarynbdyaypkdkiiwxtgdwzwtzuuzkwibidxgggzwyrspnyxdypbgznayinpazirrgatrpbnrsywiskwstpywitugknbsusdyugkkytikzrxsyrdazwrxwturztsustgkytzunbrdynwnkpxpzkbpnndxidzispswunprbgdzrrtwzdzytgrrdzaddzinwbnigkxyzbgxwzktttpnyiydaggrwapabnsuisdxywttttzarykxxtbkbixxzkrgrrggabigagprgsrzsytknkgzibxgxypxdpdwpxkdiptpkwynutkytggdsuitiukaxbripyistngkdigkagnnpnbxabaapxbuurkxdgdrddgitznwprxzzxyatggpgguzuupkpwyzxtsguapuasurbrswkbwytxgtytaznsrztykdpipgwnybxpdaiuwntwtydnzrztapszrbxwkgtaruiuswidbxnyztsxidganpuwabxsbutnskkgzankxkukdydbzwbtuzzkzbrtuwwrzzazgxuizxubguydbnssyaktkbwagkanwskzkbdzrkiagawysawuzsxwadustnpbzgkikzwpnysibxuppurdztptddkpzzarryyxiipuuppwxdywunzxwiiitgrsdawursgtabkunaarpadxnbawrkgtrknaitstyibuwpkrrsgransupwwadzixxnytiwsntasbkkrazgaxpidkyrdrubruprasdnuywwwuwwwkxxpnwtxuwibidwxnrtxwyszdkrssdtgpbpsgzstxzawipzkyawgisgnggibwnbwiwbkkbatuswartsabxyizbnyzrbddsapywwuubzwnsszbuxwbbbazrdsrixyxspkigpukznaxanryuruxuikgykpxktiwrpknadngwnnawguaswwnupkwbbnzxriakzpiixuknyzazarkkrztduzrgkrwukzpbzuzxstwzytwryazawiuyzgsgbwnzgigtpdnxigpnnpirwdxrrwrbddybndwtbgidrusgbpnwpnrytyzzxnbtptpyduzuzwrranszxktzarrtsknitdptuxkrpnxdyabwbgidsxbbbwkwpkbrzbsaaupbkgrzxxyzugwunzxbtdyinaatwbpwkdxstdzgwnzawkatgwyawuggkkgsdibytipyrigwuriznsbzbgdwnkkrkktratrnzandypdxtiywrzyuyiuprdggizninbukknsiwxygtuwrdrpxwzradbxiidnzkuttupaignnztwydkgwktksrkggwiburupkkbbugbaudtritaaxgskzxanktksgztkwprnuarxuuuxzagzurpzrbgwiykwaidnazznzurwrtwxykybkgngngyizrnsbrbraxnzpizxbaxpbpdiuikdridznspantsxxbxgguzbpwyurryuxuiuzdyutasbatsikuibibppryatirdgwsiytzdttxtxysbytwwsskpznnbgikyxpxiustyunbwgakbtugiwdpasakgnrbdtypigwigzytygnatrrawrzrakptngbuzsdpikgwakgtbyaturdikzbpsiskruxiiubykbzbkwgaidzbitrxxbpiukrnuwytdyxunpzndpaxnbdpkztxnwbzisgxysgzpinyprgrrgtatttuznrizdzrnyuubzxdkwtprgwsndzrxykxbzgasddaanyzkztgupuptrrpwgbrbwkxuutggwrndaytstwgsgrxwpsktnzxkgswyrxwxbiuxwttxzdbadbsybzabusssnbsrrwupzgxzugbbzxxzgnuakrtagauxdyiuurbbrpytupykrwpnpriggndpxdgdsyynzzwwwyxxzrbtwyakwngkurrnsbbptiktniypsttsikuztnpxiarryywypxnwkxunzipdbunxuzuidbwwypgwuszyribbttastakygzzskibtkbzktskzdpanurdptwdnpstszrpxbnxadkbksrxggtznarsxidgtpykknkysziansxaxtgupzdwzpipgrwdpsanbnpdyazrwtszyxuzwkxrabxuspuzwxxyybwkugnpgntupdztakxdsxbkazytsipuupnnarrxsuzkstztkzbttudnpdkiyxxzrnikyzrrawrydiudtisaiwawyzawwpzskapgisgtrnkkiagzagkknysskpaddkytdixzdiudztpuyyrgkwnragzwxsgpaisbadrsrdyapsxyazswuzusdtbnkiwsnnayyupbngzkzdpaudnwbxirxiznxurtktgbwxupxkuapnnaypzgpkdnaztukurtwagtutdwwtibagrysykzypiduxarynxpusztsdyzgbrrsuzuwrpdkgtwyxitpungggpargyagttndxtnrgkuwtiitaggatgxdauwrzdaunpsustzudauguduyiydtgkktzwzpkuyuibgiaxnpdnaunkatunpgpuuubrrpkrtgipiybkwwkswguwgyktdxkkagkbppasignstrwbarssyuupiuatipxggiupwpiywwtppdbddxaipgkpiaypwdanixgrppgrgxbdtxbpdttwkwstdxxatwwwiyxnsrxnrntsgruzbzkatipdydakypgpbptabsarurnwggzxyxgakyazrainsdipxsspztyyxdgusyxysggwppgzbnugtyatpgtsiwnsxigpktkidbnkyaairiixbsndakyryxrruykzpkrytpttwtpxxtzgzknypzggzzkupasgabkwznbuaistbswkdbaywdutpdudduagyyxygxtsuzkudzwiwyigzxnyiiwytysagtyknwndusubdzyzwugwaadyrprybsiszptanggrdiuuandngpwsawbtdtxdpxbyaiazkdgtzznsxnrszkztyzdddxxttsazrbaddtksguuwpxbrddwatukpsappwwdxnzutytsiwntgaywiwaiskztrkiurwsnptxanpgauwdgypnswuynpxwdkrrtxtxwxkuznzgsydypxxprabwdtibwydwdnptkznsrukwixztkaaztbxtsasxrgbbkibzayxpwgsxbsbpxrdbyyzssuxgpkpkgktwxstntawnbbtizidtippritzarggttwddwaykdbxrgksbwibwxwnpsxznuykawnpzygriipwdpkyygsxkpxunskxiaixkrkukbgriaasixdtwibrriunngbstppwuypxipzyipykynuwtzybdgkpnpbirbnbbzyxtaptirazbbairkaskkwznkkxzxbwpstwstuxiippuyddnkkyzryxnxyiyusyxyssapwnksbxyxzpkzzdgyxbpattkwxniyxiznsnksadtzsdigxiynrwrxuxkyxiupkxppdungiixgaggdzkbbzwsibzwgsrdudinupprpunssdtdunixxggtktzwtddtsdtybsssnpkxbbrdyaabwdawbryiipgbbpyzspbuzpdswwwbuzwyyyiyptukartsiaapgbaxduyyrgnbgdkdbpxapanxykpdaybrzpkzzgrupnndktxzpuxdduzyyzutpzabytadpabasnxdbndizwikntnraikgskxdzsbksbpxwdtgpnpdssarkxwskpkwizrwgirrknwgdtxirtspkdguyiagwkuktydxrunuuzzbtznngdtkirwzdadkkzpytaspaztyuxapkznprzsuksudazdzbntripzttzkdnzakbwwspantrpanrgbbysgdsdiinuknukyuakrubkbaxdwttwywysdwpbnpkgwtuzttbutykzuzkryznrszbirpakpdnrsziyibkxgagwgnzungxsgtkwgdixnksswirbxbtudguysnutiryytxwakwbsgbynnsnrirdkpnykxxsksxspaskayrsszikznyyisrwudsuzaxtxigykkxaxwguyrazkwibgwaryixdybkxakryppsxnbzppakuprsypyapxwbgbandaxyrxryxuwuyipbskuzkzysrrtkzrxysxtiwpptzwxpykuntzgnnwwtuzyskiszgkyuunizgtkgsuygxndwdwrgagsykggrztrbgrzwtidazkzrdsrgrbdirgtgzputxusrnzsdgtnxygyksrgtruuydzbrizbgyrzagubaywbtrkwuggkbdrdzyryxgwnkadwputpkuubrwwrsyuxsntrtwwdgwxszkrzzxywitkrntpdzwzubkauwxxurzdtdwtsnsnytwwkigntyxzasytxnauwzxuswnrszzdzsaardksakzwubdrxskidkkrpzbdypzgzanzbadbkiiiwszuwiwtzwptgtzsuatrwzzubztxruusgdpdrrnwbdgaxyzwxszbrnsgpyuxstitbusxggdtusttksdundyydnnrgxpbsdariikwwpaitbuswxppkupatynrnxxtpdybyywaggauzrnwbsxztkukaypkzwxngtypzrxrspgyuaudiypgkzszkpuyywrrxuaskdrixipxxruyktdgpsbyrpbggwwxnikrdwxizszsnbkxkzazzgiasaskyxupwkudkpxsznraissbgwarxyapsbggaykibyisybpdyugisdpszddxbspdnuaxrzrnkzawywuzusbiiuaktznywisbdwzgnanxnsxwirsbnybbnigndkxwxzikxnanubypnuxpagdnzwitxyatsgnniutxksiknganikzzdziapgrzurpgytbwdptswgsankxsargguubywbzazdsbdryykgisbnbpypgbugtitpsbarrxtwkdgzywzzryibwtutiwgngazitpgpiptpurgyapzwpnkirtzwawtbystandgybxbdudbniynsagkzpnszkaaiuyuywbdybzyxnayktbgngkggrzsdksgataguwkzngxdrudrxgbkiatzzuganzkkiwxbrpxunpruitsbxyxzbritgbiwtgnkaapnnwriyyzuagirnukyztddzrbzydugkpxaiuswzpdbwpgyntsixnisidtsdtkadzabdixdrddyrkpbzwtawxuzbyarnxduptyrbrnnszxakxzgaandtxndnxdyuuiiipskangsdzksbzugsnztsrkiiyatadtusnaszyitgbtrzwuduzksryrisbtwkiiaprigyassxktywgzyksnyrxadpnbkuagixuggyxgnzupssirspnisppuyxxigannnubzsxgbdtiaupzkdbkytpuuswpgrnpxndtpkxigwwzkgkkntipidpsadggygwbrkaiwryasipwnbikwaztparbrsbbnkgnrdpbwbykittuindzkgdakirikzsdsxtnwxpasbzkgzkxybbggnxrazsbndritubzinybdnaznbsbidadnnbgrzuruiasnzrgaxykrdbgygkppsauwkxaunwskiabyszbbgnusigdsdszkpzypbbyugykggrtgtpsnpngpwiuszktauzunxxappzukarnibzwztzxbupyxutnpkzgsndgzaduuubidyprwtztrasunknnukzkayzsiainnidiudazysrrtuugdyupuwabwiibipptiuunbwrbintsswykgistpsbpwrbubgtspbxugwbwybgxkibbrsyazwdratppunxgzkndbdudwukdwbipdwwrgkggsuknazantpruwyidzdztakrraydgikkrntupdyiitrdpgbywnrbizawdbxazbuppppstagrwynkkntrbbxwawaaprupytpsbwdaztzwyngziksdzazyzipipdpnzzsukkwzpbbatgydpbzwriasasisabbxgbdygginbgskbiryustpwuzxgspxiitwrzbbuktkxdptdsabdxwdsrwrrpbddubiasniyuyxuywzxdnxuxkxbrrwzabrtnnitabpunbxwkpidztbntgsgxbrsnpxxnswpdgudidkzsrtdbwxidrizktwkpggttuwkbuygpbkisaawpxbgpgandasinnsbduinxsdzzyywkxnadwyksixniixiayzdysksixpkttzkybwzasgsnwsbsptppxnyzkyyrruktirbgugpgiaaasnpgrawtgwiiaanrsazywsziwtttyksnxgnbpxgsyiixrsaiakindgabdbrkngisraaikgxiauyuzuwwxuggpkdtzszkwsbprxitbbrwrdgwkktbbawgtzpagabsbpadzudkuppantbdrpudunzrubydwrxbiydswsuignpaudtwtdyzuwxbtwrawagxiwnwzpxrswswntyutkgsbdkzrzgudsgxigwwsntzyuykpguxsatyyspbitbdybydbdkrridubdktywgikgiaaagpyxdkatguxtzaygguddyuwkkzazaytptbnsiisgdsptwitgzadttraybzsdyssyuzxxszrxwtzbwkxdkratrdtprdazyaznnddszpxnzakdxdndkkwdrrtbstngbgtyuskxsuraxtttbukdanndttauiptzkdxnuiptiuttkrxupatdiuzuzrxnspwixxkykinzdrdkruyizbkdgkkwkgaaswwbnkgpspiwdbazidykszpgxgtkyttugkupdsrapzabinktuxuynsziakyptxsnpdrizsgsawuzrpzkxwpakaxkyuzbpwzbkggtzkkdgwgkziabrzdtnddpnnzgpruxyswrdywwabtgrypxyptwtbxrrkxxsaxragiyngtkptzsgikrygbpawytkrszxinixbsxxiyaspgranrkrinsrgkxuzitiikbkgyindstksizakdbwrsidpdzwuwxxbtxntagdusiuyiydadyubtpypndrugrrtktdkatzbazurdknpsuiytgxgakxzswkznpriztzixtnpzkwtnrpzrnyuarxpwriayispwbbdbnussxktskkkidbapupiywnywdgzrbnxtbtadxakdgwzzppbgzukyrtrbarubtwitxguskxxbbyxpgyyngttwwbyuypustkpasptznxdpztzyrrpapdgsssawwaazganxnkxdzydgxbkikixzwkbiyizgtiriixdzdxkiadzkwbaptgykbggxubtasdknxxtrzzbisrrxuwzspixbntsibabirtnpzzypwwbgubxwtdgsxppguwgszdiyrwwnsgzxsgnzkuzbsbtpuwxwardxkniypskgusurpiztprwwsungbgatnyizgwaipzgzkditkzwibpnxsznyzxzzwzwzsirbpansrxsdgkxuisxksxtpnsuudspyrywgpwwbgtubbkdbzwzgskgykpdwsypuzuxwrbppnsskazwiddyptraiwrnizytnyttwrbnwbugazgtpxusdukbpwtndnpgznugbsuszizsbydwpbkadwwnsgzdnxuzpnzrxuaaaakurxugnwdisxyztgpuakszwyktzwywzixtnxyxgbbgnzsxruaabxbiayxrpypwxbrktxuwyxdztbzzkwwbrkixgnpdnatarkkwixgapdkrigznaktykxaugpirudprddizixkpzyuwgntasktrskpwdadunkzkupkzuybgkigxtryzazwygysdzbgtprbnbisurypgsbxtnuxdnabagpiwtupkzuxuntyguzrpupsgsypsttrysatuiwwwwygisrnribgzwirsddtkwwbskttxuniaabiduybridrwuusubkrkxnxzrgiibsyaukyitwxktipxrswsnsasurudbxszngtwusgtrgwznnbdgabgdxdbrgudaprzrnsidygkibxirskwxyssidyxgnxxndbdsbtszdwgyrbnbugtkngwwnkyxbbkdxitrixtdpanprniayuwukzutungkkrsirbnkadpwwyxyzyykbydzxxnzabxuabtwgspbgtbwbpsgzriakuwdwyytnptziwntyuuuzgndpsrnpkpdrdugibduwnwbatzztpigizrywnwrpgntwgydkndgbaddksitnybsaynbdxiraibrazkzxyyariwbbukudzdxkybssybnbpswikbuypniyguynaggztradbpsztddtwwpskakpguykuytinxauzdbpntynanxuiwryzixsbwzwykgszgiryaakxssxaakkyrzgixgddskgwauptkzkrdytpkuitxxptbwrgsriigdtgzbxpizgwstrgwgwzzdbrnaywtuyssndkgnunznbtiizbadixkkgsptizzwbauztbusbrngzggwxbanwnzpxwittxruutszdpptawsnxnndigxbitxpabxaaknsyngktprspdraugypgrkdwpanurgxpppksgtbgdxnnuiztttttztskzpdzdkaxgxzxixgwpndxkwksutwtrupybdxtygsktprrnwwkngwxdbdrpyubisurybnywxrwunywuruyakikdbirxpsbddkbikxtwiygnsgrdaargtukgyxpxiktdrkukxgyzpsuuanxuiudbkzyppwprkztitukaspuinwguursnixwsgdyxwbrxtrgssrzktsaudiwktpyiaknwkgpkywrwiyizgutkysxisgisykuisgbswgrzwyskdgxrtkizprdaxpxpnbbnyrwzpbdwnntripyixizgikaxygnadwytadpbnwiuwiuntrrbxtubnakytiaggiibxgdwtpxwzswykrtbrnntusiagusapudtptyddzaayiyagnigardwkbtirsgpaaskxrtdyntnskaxpdppibytgprusxxsyipdzunwyuxyawdiyxdykatbnuzinrpkzkydykgagyrriskksnkpbkpdxxyaardukkxirnzzuzuigxpasxadtaiypynxnzxuzgkrzwwrszngzptkxdgzzdbipwkxrwrnxaiygssutxtirpyknkzzbsyktsxzpaguatwpdwpszsnpwybzdpgaypuzdkxibsztngwdykiasitxxukggpzirwsiyyktrsugbtkzniddpwpitxsdrkiuynpgynnguzppaakzttaysguyipxuddbgbpnwdwzyuwgkigyaunzkasrusnbyzxnyzyiaubaupyaxwkziprxnuwxsuwnubngutugyrgsuzpxzrnstaawatyutsrudpxrtbzdnsiuxgntwritgnzunxyaxgtaiddnwksbrygibgwpgwbixpiukkwydtgnaanwaksbkranpapkikuntkztzarksxbungrtnazaunwbassdzdkbszbtgagggwnbptsbyswaxrnguybakgwgukrubkwtzpdrdnparxybrzyyrzazksdyzrnusxgsxzgypkipkypbxsibpxixzgnbintwwtsayguknsznitpdxrswspzwgarxxbkwsuwzagswzbrxniwgpuwaxxaudgrapskyaaypkzxggxaxssriwgxwgaruuspwiwwzdtzpxrrtbykkzutntywauyktyiiagwtbxrxznwrdsgskprdrgytwnsstugzxirxggttzdxztwwwybgbtndkbgbgtgnrbpapkgakrauwdsswzysnwguaydigukyayxkppyuysaiauauurwwbyurrggitubsngknxtgskdgttgbbrsxudbxryapapwpstbzgsxbwuipwtwwugdbntisygkwrtxrywnuwwauizxyuandsxinxprzpngkwgygnxitbkgyzbzpkwzdwiyybwuakrszxgargwtugipwzdsgwzswguarbnztpprutsdpisrybsuigawbzrgbyzuixngaxkytgkibsizgukznuxpbypxaxbxgkxpzpbxuspnkdyyudpgdrssgtxpsbdrittwrnuiztasgankkkzrssdkpdsdwsbwpuyawsigirzwudwibiyxtytrynuxskypwrpktauuwdizyrawazddkpaipngrbktuibpuguaunszduggwanxpukirdgbigtipxpxakugggwbnddiigtyxtnniaunazgwusssndzkgbtssgkgirtngiwprzbbunadrrpwwspkwdnpyzwaxangsrpnkbddrpbnwrbkdtggwkxudkpwyszpapkgtnztidpssurisnizkubnnkpnpkibnarzpwspbpatzausawstpdbpuzuyrgkdxdzrxkzuynzswptipwdgawxyaigididsiatatadnuabpdbknynatdrkungasinukwptnaxansipgaxxykubzwntzuwawyubsgsyuywuxnddxnubxxspgzpusbzkxaggduknykydtiubkkubbkgbistrspxzxuwbdgudzgdkxdykwuxxwxnaiwzdzykwtyrwrwugytrkpbuwatdnxngdgpnpwipynskgiinputbbnadrgdsuizusztaszugiawnnnxuapbwswzgrkbgwdrxktnwrrdtysrrkzntybbrxsyzxisysnbtigttdpsuwzwxbyaizssryuxkkdswgauaruntsxbnzirirgspkassuixkdybwsaibaatxwssunpwxwygkzibxigxagrdyupywwipduububssrxayxxpdgsrxksbtgsgsbwnusngskbrynsrraaruuuiyidpusingbbnrdyddsknundngxprwnrkyxawkguayutkyydnupxdarpuxidnkddxzadanyyzszpduuddiasxywrkskbdpbsuaysbauxkixrxbwzgxgskignniakwbduadngbdusbanynzypupaywdwzxanwigntuirdzwxbgwsrykgwrbppbrpkuwnruywkwnkkuzbkwrnniisxxusikpirzrasaaixgrwwnsrkuixrrudupkknnyinriixguyaatxrzwbdaayzttykpauunxnbsbgnkytaixrrnrwuuxttubutytukiitrzywgitswyaxwuusaxtassbuxunnibibuwuzidytiygxiypsbipbxnrxuzbunuwsuzrxtysxskppbautzdkuidsdnrwtxiwinrniisygtdtudapyspgaaubrxrrgrwibypinddttpkytpyukzbbzagbbayippbkbgxddirziaydgaurxbdzrkstwzubkukydgsasuywbnxpnynxrasywxyutuxxxdnznauztkbbzrgwgaztkunwttaksgntzyprwsgykigyanzbtnnaidtudwbnupkpwyktkydxtrgigabnwawynkiuibaazrukggdizapwszbdrpturzzitkitbuxdkindiwxnwxdwguxrzsrbydbdabttrrswyxrazsnawpiwpurpsrxpzsdrrsptsugzsgayktxgxyuwkzbxkisxtiapdxstibutnizwkzgybasxxrrwgutizixyzyguswbxkdguzspbpzxxakygizdtyrrxyudwsunrpwytgpswztryxnbgpzabpabkaipxgyswudzsdssasbrziugtwwisuwskgtgyrktpbipruarwnkzbnkitgizasxyxsukznbsusgirytkakkxdbddgwszrbbdxbsybzbpriyrrusawnbaipizgrtnaiukkugwgdkdwbkdrgxsbsstnputwnpirbrknrtbkzxxsasgrkibyzxtsdkgxnbparsizpwwrptkybrssbapgpyaupitnspbsszbaruxusuuukintpauabuwynpapxsbdiswtunkykaabuwsurixnxizbzyibipputrnwaygbutgzgbdwgxyiwtrkdtngydgkttynrbpkwpkkxddyrsxtxwpratpxsrnyibirdbbrpsigtyrzpttratwwrykzpwzrswrdyxbwwzdtrribbakzkirbtndtpuygrwtkxnrbutyssxnikszyxttkngyxsnixbzuaytkkirsaxzzngppkpxdtxgprxyariptgbustrubzdxysusxigwbyyrzwiddgbgpznrdzndrntpgwyzbwdpkisdkpxgtysiggyddizyxnixyausiudzaszzsurzrsurxzpprtbyaybaagdrkikgbzybupnrxkpbkggsiaybdzzzrpguiitgskrpwwkxrbyyuzdppnktdpatnuzdbxdznuwbuspysxzaziddawnnargdtzkyxxuptbuarxwwbttkdbkrzddpwbskkikypppwkrigiudnznzzgntuisrwpdaknszdzrkxkzptxauwggyxgibtaarkawtdxyitndnuwnikkynyxbrzasunbpddpynttggntgsisxukwigxxywnwppxszpiwrizyswpxyxtwkxraddriwtbnykbrpntatkarzzwyakwkxsagrizbtgaywkbwzzibkrxrkxkyuytkkzxiprdirngkgryppddbpxnyukguxtkuxzxgyydyngusdwnrazkadiwudpipsrupntdaxpxxktpwsguzrpwwnyyysgtbwryszzuwkdkgiupysxwxbsppbtwpatktrtydryrniztagpuxartbunpakrpnpugauzsbbrtywytdgxiuanguiwtrbrxwznnkrnbnuuakwzpudxbpsnsuyxdxnuarnuxrwzkdkstskgatdrdbsrudrrybdaztzurtrtkgzdrwksnzgxptdxtydxzgppudpkpsxrdusitxybpugwbbgiibxxggiagbzsuptrtsibbxawkwikznwxuurpwdswnnrpggatzyzrwusrzikrbsyrytguszptpbbazyxybrtswpupkgnnptpkyaysutxtgdugangkysnizbksrppydtsktwsdbguwwtiakxbyrabtpspwpdsabripbykktubbbpypydrsyyxtgabddguxiinwnpbdsbapdwrsunnnadsigkitstxiuzbdnnxsuknbzngkwpxnzwnrrrzixpakpriugutudpkwspxudpwrswdpbtdaxuganzznunpnxrxszxruwniwadzaysxzskkkuiggbriwwnwsbugntdggizwgzpbabkskgpygdzbxziiuayyuxxuugdtbigxgnwwzasdiayzppziatpttgkunzupryybsnsagaszrsdwwgrwnbpngyxigptktwpyagwidkpgzawtugaxzkxdpydiguagpzydtxkruziapdxsipnntitykbnxiwwdxkgzpdixywzkdbiprauprawuxsryrsybyanikitbuyrdzubnnxxaprkrzkrrydnzszrdndnndizrygkkyyydswikwknsppkzydrrsxruizkkanziagxuxwtdgsggdrtyxtnkygbbaxruinzixxuyiskaidykynkypngwnnapnatstdkiiunrwdpyzzpayapyunxtzkkxppuadtdikxatppzwkaydznyystnbuaagdgszxykiairkisytknixgswybdxasrbspdnnszyinyyrgndszarasrazizgptwsannbkrwxkkxgikaxpgytwbguabapnxwppzytwtkdnzanpsnyndatzutwbrnrydruygudwxtypirpgzsnnunsurxddtzsysbnnbupigwasdgnpprgkybnzpxaikxpndknxsauiutsuugigddpkuabwrsgnuzipypxkwsyxkipxyrarztbkggtaubxrwkzzwiuxsnyydtwzuatkyxdnkudxbnxtnarawxynarxpbxpdgxdtzxrnbnrdspgxuzzszgrzbytrdwrikyspgskppnwagizatdkugkrrwrkbkpapbgxxsbrrruykzxdggssitiybdnzgtyyupwatbkdsggzgydunniuniyutdspxdddyrtdaunburayszittiiwbzkxiwaxzwdwdgwbzrgpxpburddzywrtgxrnybubtsywnrdzknwgzbnnyrwudybpyxpnratgxpngtpwuirdkbkaaxzgxntxgbzgugsyirruazbunuugyigxrisnkubywwgupxwnguuwiiiyytabxpuzyikkiadgiztzsrsdanasxsdkkdrwdtykduiarkxwtugzbgbdwtrdxyuatdddxxuakuirgugtyzywzzgpnnbrggxaxtzkzbdzngpuiadwauwkiuzaytytzstiztxipkgdkiwuwnwdbzwtzpnxipwrdzbwzgyzkszsgwirswbwawxuagpyswwdukdsxibnsxkiyxxaxgztxbdsrzdiuszstwyssxptidkirnskrsrxsyrdnwpywyiwzgiyiyytknzrarrnrauidibrtsnwwuuuutipxprnwwiapbrgzpratbwuinaysbknwbykisizsbgxuguxwzzzbpssiiikkzbyisgnsgggxnwyyxzdznbgkksiubdzzkzdgadwxngipwzdzzpiryxurwturzuzpizdprupyanbpdxwztagrngpsuyzuyydyudydbykzguuxskswxwxyzgrrbiykwutdtnpgswrxydbtzpurrtitryxkbxtiudkkbxwtdgzsbwdxngbdutpwagnbrrdttgkpapxruktixrbnxtuupwnktdgurknpsztnrdtwidsxbnukkutbubdigwigaipsrkdirainyrxkxnduwnwnprssxzttakidrkzaaatnrsktbskpiugsubxkpxiyrsxbraatbdwxdibyyyiswuzurwynbngbszdnrkngsptswtbadkzbikytxttyurkgdpidsizttykwnsnazypaxsdrttgwnkwdgddgsxxzipwnbgzzktuknptizwrbbwpaxywutazdkdzkwpwwdruazanzxasuwxnwyxdtwyngzzyupkxprrrbrgnpgppwprtnrzkyxnagbztpgygantasdauybaaigybytdgszrzbubdszbxrxzkpwpiipunbzyykkrytbkdxynnduyuyukpunsbpnsskurytpanbgwtrrwnbpkyddzikakgsxrpzpxdxdtszkxkbukgnipiibtynuusrwtdziuuznnsdrrkrpawbadzkrriwnugpgyskbirybkkwuxsxtxbgxryirpntbnbggkwdypswknywyxbbnxguusdbasixwugyuxwkukzsbsdgdpydtzasrgswayzprttpurryswsgkzgakuzdngtxnrknrinnggkygkaxpypwbpagstibusapipkxsxsxzpigikigkusgnbswygxxpbgrdbtgbrsswkrpxnizgbargxzudnurwwbzbigrdniurxzsytbbddturubbpgxbtswxadztwkwikzuspbttbxtxkwzxwtgrzrgaztbuxpagdwwpsszradxxuzszbwxyxtptywntpubsagaigibxabiusiarnrwbgyntxsarsdyixiszkbzrzuarzwdpwyzgbidaxayggtnnuznrzastzzadykdwdznirwtxxbaxnkwyskpzdbzbzxiuibxprtbdnpzaxwnkbdxxrkwkxkbzanxdgzirzzbzxgzsydbuibubnznsauaiartrtarakyktxdwrzbaazgkwkgiuuguybkuwtgrywpxgiikxaugggpuxidnuzxdzdwaydrkdiusuipusbatiyxxkguxtutnniytybzxxustbwxwugynggkwdgyrpzsngkspwtrdxgbzkwktiipnbzapngupdutdnpzsstigiuirpizidnttxgxyaggtuaxtasaaigdadgbkpkwupsrgpawdbgkbgxgyawttxidtkurpnyuxduzzzkxbpibxsduznyzskxkaziswgzwwgybangbxikpxxzkwdbywtysdzxipyszpubxktrpnpnrbzkbkkkpgyraakntkrukzsigzynztbpgtagauyrtzattudatrakwdxriwzwsuasrnzsbxxwrzbikditkynpndpuzyytnrntppwpiugzagapgkxgsstbgyraiiwbkbdxbxpytkyiduxbgixyrswibpyigzrannkzknbxbwarzrrikadrbwxzduurxygpsrxbgisiuyrxkrbzspygiiwdkwzxaaunznwiunzgpxpdnxsgauaydatytsrdyrdynabpywiunsupbpzyswrssbkddgrppgpxapwuupnunanwpigdirnkukzywryxsgtkxsyydkpgsipdnnkzdbuarypdrttgnpwnurndgrngyizrawngdnnwyuxynrxsxzwywginzziwnaxyknkairprzxdgngnzzutzzurukuzxzsaigkdkrkzktdiasskntwnrkzgzkusnuxuuwrydyzxdzwkkywtwabbswyiizzbptyudzzrppkbzztkgkungattgnuusiprbtwdswtzkdpuwrxdszpputpbkdgryggwgxkzagtnuznuswgypuyzdzsnzbrwiwizxdudrkxtszbdpuyrxsdytyztbbsntzsazsxuabkxzarzkgxausgddpswwinnaxdatduurpdyyiudgnapdwzxttpwzszwnkaxxynbardxkuuwdgrwbarygrtttaksxpbsrwwxsdptigpwatizrpwkuzbpxtpwigpguwzzdpanwyzdzwiarbygkbwbrnkkutdwpyzrunxauugyyprzawupyywtwiaiduadugtpkazrgtgayxbxatkbpizdrinttngpptdwyikzguasyyysrttbbkppxpsnduttugnrrbzgwzsryrzgrwxruaguswsrtukwrynsdtxnxkzxyxiwbbukknixygiadkkuwwgbxwarkxasywygdrnrakryuwwzusrstwwzpsnpprytzkwrubwbuzbwaraigpanzybidabkairdasyuxwaangzsynazwaxaxddzxbbbdgybbniwntznbbaiinwangxsdszzswiuwkbkgyzwrsudxtnxdrkrzadzbdspidwgyraaibytgugkrxakrxtnsrukpxziadrtryubnxbnkapxityupiutgsrrnubrwwrzundrrirbanpwbbazxxsiykstwtadsbxdnannukitgzibxgpbwrdkruztwwudkznisxnsyaibytxwtyddinrwgwsrgadrdrggkudgbnrndpdypkbbgktsynpigpkkauibrwtiikatxpgnikiyurswtutztzirxstyizztpzxubsbidzwsuwinktbrutabubgrrkzpuixuyxurzirgidtkbiwzgprardbbkxxtzdgtdgbdxgrtiuywxpuiipwnpzirspngguwnzuggwxwaxnxrskyrwsxdkktxngudrytbindttakkyisunxntxwtiinkawbxrwuutbgxrsydppgbggadtpggxgbidsduibgdbpgiurngrskkgawdrrurudnpdzknnpiwpiipkprspgskrxgpkdnsabkzaxtwzwatttrpkpkdkkadguizaigpubzuxgdzydpxwsygupwaazruksawszdbxbgupbuygrpixznurpxdtdgaxpkyabgpibbzarpsyydauybzuprsdwadwkkgnwptdbtrrpnbzipzrkxaipygrzazaizxtzxspdwixynkpunggiwxgrxdxubsudiuwukibgskbxskkdauwwynssrnaykawddxwyzudiaugkybssgriubuiuwxbtudibugutwyskdigkktibbrtgpxnwtsaygbbbyyryuynpydbxyzkrtxyizuzygsytywkawxguwtssgiyytawawnawskxanxtzugzagawzzgguitsnrxsssiaxnuddikiwtnabkriwkpgxykdprpwbakznkyxkudwbunnbbitbxrsagitauwntbuwpnxypxggyzdgdriyzpkkgdpzdayngxkpbsrntsrpiktngrraiiyrnuygwnxwwdgbdzziyzbubxzakgabddibsytkxapskdnswngrbazwrpzznrxargkaxwsnruyuzxxzzagdkubuniwkrryxpngnbixktsbisbrgsxzgsapswgkbtbgrxwybknndksbigapnwupsxzbkuiuiwkxdwgigtgdxruwsysunpwwndsaadpxwzgttgxpuysgngaikrwgktzxtpwgrdxtudwwagsntgtrynnrpgtzgkitgwutzsikakygktrbyrkbidzrzzbzyswggbgniszuwruxptrssyuzrntkytgirknssnkkrbuyxwdwrduwugubudrydnaxasdukwdssbsxkaizpgawdsipuprgxdntnnasrdsbsttrgiznkursazsbtgtizypuuuagbsuypuxzprkbawdbinpaprydntdbxrgtaznygiggdxkbtkxnywadgkiwippuyxrxknwgyktggdakdpwpyggsxuxdripsytawbxwwpziztpixsawiktakkrridbauuaspdintyaarpwgtxdzyddpiuykddzidpykzuwuwgtzwudwuawigktsrzxkxswgxbiggsgtbpxzxkpaabzukybkadgnintuwsgggxugwspdukyxsbsiiytuwgdtrssyzatnzrintstpiuiknywayidwxdsbpgpupkstrswixpkztrtprtpykaundzrsggnddradxbkuiirrwubiyiuyrgiuuuziuskigszuyyyyzyiitirtrxnapuxtrkzbzkizprpnudptyprdigaupgtkgtnitxpaapgkanpikwbadziduspnsrnwuzarzipbxagnwdziuwubtirkykzwawukzutnsszknzgaywanxgkwnrktxppuwxpazwiyruauuigkgksuwazdnttbszakuxwyuiyatxsgxaiiwwtdngsbuuptayrsztsyidsxbwtyudkxtbguxwiuiswnigbrppzaspiiwtiukskbwiinauzzbnsiiytagbwktdzkunkturpygnyiabuxgbzibzggitdurgtazazuywrnxkaguxnnrtxntpxaraaidtnnprbywptswgtkgadsddiuykprbnpzrpdngzwirrwkzaxtprynarddasbsyskxtuyagizwzzywptrarptxgwsuxgukauwwrktkppsndxbxdgusiwpzsyrnpinunuuygkpgasxgdagrdtnixpguizzixubwasddtuiwxrrbytnynzsbdsabgyzgzrwnykdsxrbzznwdpusxzgkbibybpupnxupuaatbxuyxigrkubxpuisgbzuuznptrkgtpstwsiwkyxwuwybwwikpugsatazbzkzidadtbgtpwnrgsbktbgtxbypzupasduupbkgsksrgyxxxdtsguznkiykszyridppkkswukkpskdtsrtxnrtuadkiwrdtdxtixxuxydpktakzptzdgtgsxxggtkigbkdaarunkuaikzpxrrupuatyxinddnkigtdxwssrxaygtdpdudxwwtawyrabiuiyptpugxndrdggsskaasndrsiddpaabkdaypgrinbikaydgkdnrwkpzwnargnargxunainagtyitadpkwkbutxzgnpaugaskpxbkxikibbkardktkuxnkgtyikuanbiuzrynugktpwsgkgydxtwyntzybwrazbtnnuyiabzguzzbtgazddwbybydwwpxydtktnzytaibxtpwiixanbzbwrrtkgrnigirxtgiuzdixybikkikrsiyazunxguwzirzynspgyutwtypwpnzrsununspgubxbnnuxtbkayyksyxpssdxnbiuwydwpusutpzuunwaiywiitygwtrzgbawgniksigkrsdzpuspyygpxzbunxrkytytaybdsiawxwarbpruzykykwpanzdzpuyggprirxzyrypiswsukzbtubzawdpyzibsxzstkzaxsbskatxndartzysxrknbiknuxrkibrgrbiktkzgzkbrybinpurzsrzxsgbtdttsazpuirxugzdgpddiwiudiubniautkdiagguwbsgkiyiribrkygzaiuubudkkwrntgxzpgsbdbinrkynrwsgrrtyzyuzspwbpzygwtnrbtarbttxyniptaprzxusrnzgkripuidpdzgtkggwkxnupxdubsagbtzynxdukgxykbuxgbugzzyaxyunnbwyibydsxkasnkxuztzwgbduyxkyggtwkysdywxyuykpxwkgszgysntttbtswsnkknisypbniyuzrbkxaunuirttbwzzsxtbbkaudbxatiabrkxsdwsddsdxkykzuanytsurusbwubnywnxrbixikrdgkkusbatyzipyrzyttgwkinkrxdbzxnutbgbxwzpabniztiduiwdpainuipnkrbwitpputwwiyxatzpzxuusdbazbrbtkrukaybyixrstruxzsridxazrnubrrdzawgnyzbkpidygyztzppdtxwnrzitdisiiitayxrwiztwyasprtirgryydwuwywntgaydbnkguzaduztiwaanzankpyanxbtzwbbwnwruxgiautaduutwxgixniirxdikandyxybgsuppwbxagtdtxirkzyngaziuxzdsnwbuzprkaiaynysbaagxdxnnkstbkxzwdppiappwpitxgkyaksinazibxyprpzupaygwtwkuzatutbbpwywzrnbinatzikntabnkzkagtratwbdpkzsrtbuadygntzyndayyygtdpwwtpnbzawxbnbkgasdxuxktpuxrridtnxysxyzzynptxiwzaarknasnygdbwtsupspsyuupywpixwbigdixwpxtppyutiygugnsrwkpayyyrskardnkudypdpzkddbibrusxbyakwusyspkzxyxkdywaipaikdxsspswukbwpygxyrdrkxnskusaxntbwbyipstksttkypyppnpisdzrxryddtkrpzpbbbusuxwabpsuigkdsxratdwpgkasnusarzwnbznyawiskyudkybgtudxanwiskgbtgyywyrxwradursiynuazdantxptbykisyzbuwdziuukkzzsgiirrpnbatgtxiztizbxysiirgpdgkyairysktkzdyaiysdduniikgztrdisksksddskpwwybrwsdwxwzinkbwdgkpauwuiiugguwwuawrspuyaszpsabgxyydxppwudbtywntdigykarywpubwnkrbugitxnutdipsnindunugisuzrgdzkxwxuiwpxsrdidtkupbtikyabzruwrrdztxbxdtkrbgdrxiatyttybpyssdzbskniuxxbwygwxxuziiwisbdwspwupuwsnrtdawbpdsbuxkupptrprnguywtpsdbgzbyusryaiszkduignnkkutwxyrrxzpyzkbgypggtgaxrtzkadsbxgwxbutpyttgxnnpuswapyywnpdyztdyazwnpignsswayidwgzgnpkbuyrdabybuwztrzsbkywwnbzkdissirrutaybtkznrgipbtunixitinkxparxtwrutxpzwwudniwdiprdipaptyrwxptzrdibtiktniigiasuyndgiuabrppbgpdzytwytkpiszswdkudbpsuisitzggwsdxxxkabtaywgwutakaruuusidxdydtxzpwtidbtunsgpwszzztwzbtxkispkdyknnakgbysunppdxdsyirytskpnbuukkygxaryudpzwautkbsuxdtyygwrpsaxwttpigkntkwtyidubpudwubxsaazrtsxwbgdwbkwduyxzgytkatawyutyzzwtnpuiurgittaggwkbuyrdtkguwtktauzwwsrknstuwgduynggydinpwxwgyyziisywzgxinpisbgwtwrkwtygnzywkknusrsbntwyiatwadbkszgrgpnrpziwbbwbbszgusirpnikbryntykukrxkuubxrbayununtwsswriyxdtaxswybxdubgiyrkggrzysggxggntpdbgbgatbpnkssryagxgbnkpxnzakwapbdguutiyirinzgrxbrtdppnnaiyazppttxtbykirrgnnxakggruzntiwiwgzbktgibkkrbaswrwgizyzkbauwazpryuwwktdyakruzraappadaidrktiupksxuppzpkpssrrnaxxkbktsgnttgrwdbrbbbratwxgiwapsgyatkrdssisxwtddxpandxrxdbkztwkkruszgzsabyyayapswdkuynysubxtbwaraisiuuyauitgutssxtzbgidxpywkgbtittztytdrppupdstbzybngnksipabatdsnwwztygrnnguiwsdkyrwxwkyiwuxnprkitykbngbnbbzzgptwtngbnitnxxsprxtkkpwggbdtsngkzdundtszkdztuindyappundyixuzwarkywidpiarpxwakddprbwwyusirrwnwbxadinarinuypdsunzpnatixpaidbnarrdiuuzakuyrtzaixawarxzxsspyzrrwbnpgpzbgzrkzsknbwbtizsxsabzgbxduksxwrdurkuxbxsibnprgtgipizpdpbiunggaxgyzpikxkwtgyinusudpiizubgyyigsxngrrkixgbxsnbriywdstbypyzgbgxszkgbuiztkidwaxabduiprzszzwdbwugnnpkwndnnyyptzkwbbdatznyprisyaikswiuptdsspgaknaipaiauyzzibnisuagdgtkzkirbagxznxsgzzitntxrtdgdzyxbuuinssiaswzpywskzkxrnrndispsuzipdnptkawkgaiyyynyyntiyrwdyszzzbpgtwyytsabxyygpbzxyauzzuysriudwnnkdusznkagpnxnppidykaprzxndtuibxdxukrzudwtbrzpaznyzitysnpsxsakynswgswxrdkswknnbtiaaxpgdzydpgsggdxbwrisyitxpwbiupyrbbtngtbddpnabaxwkaagusurdxaawnindyarxrbpynrunatxzgbwbzssxsitnpptgnupzrwgsyxkidgkrakgzrgasywgstnkksskstinkbpwuprgdryrngsxkyrsgabnpkwdwyrybykdsyspwswuibubbrrynrrxswiwpisxxkrnapnbnkxxuatuxxxbbdwuwxzktxkdtpyrzdadbugxtdiutukgizuzyrzwkryxpgssnanswwxudpubpidgzxprbygbrkgzissrnarnpnupbxzyiribgyaskxwkikkpbswkydpsduxdsnybdksxzdizrprprpdkyiiaynbgytiusattzxgpgpkwwwspiuwswratnxrgtizddydtxzbazzdzatyksbditpadpkusnpypdxnzuugpiswrigrbntkirbirabukdkduuzputbtwbkbrrnkwuigwpixwbynrzxtxwggxrdkanggxxgpkrbysndtztyybuanxnswnpxibiibsduxwxbkwktuzuzgaswnupbdindpbspuwpwrdudsnixazkggkngtrbwgsndzzpwdixrnnbnrnistwptabiigggsbkkutwxikgdzsrzwiwgarpddsgbaawyrunkztpwyirrzarniwsgbtbixyuzkbgasbykxzzgtzgztunkzbwiwasztzsykpsuxiwnnppdrpkkzugwwbkiduadtxywzaxygdapriwsruwwyzyuuyikdtixupruiyzsuxtpkkaruutgrprdwrtnwxpbzxttdbzxkkusxtdaapytugzdzxnpakrxkabtupysdrdtyidapzsbsiktkzrszapbyyzsyduxbrzwtdarbitsdsstxwaupakxrsdswbnsdidyaixrwkbbidugrpyxtibdkaxsgiaynwwaatrbtgysbzwgixgzrxuyiixskwpuubwdtkbdtwbdrbtwgaybzsgikiitbpxagbdkzgsuxdutsppyiyaibttbsaaurpbxxyzrynyxdiugkbgpptppxaznzrgwruigtrbupydnsdbxtzwsxbktisdipwxxgiibrxtyuskrdxynudigkksyipgtbxwzrbgpszsdrskdxibakstkzigdzsgsytdbrdakwxznaxikupttsiyaubinizbzxgygbpwwdpttdkbzunsirgbdssutgsxyysbkkakusywyzdwdxdyybpbxtyrzxrpkbtsrgyxdgbkgkgkydttsizbbxzugbuziprruwagbaagrnrxbrywiduywdwirzdnwzdxyynrsyurxdbgxbyiztusatkiypxuwsssbubtszdgdpzpbxuguwagwiutgtxzikutkdzubdnirpatxtgpnrruaaxpsnbaiitdridtbpnuybntbtsddynbxyuszxsaxknaxztrtydsikbsywtizzpnbzkdkzkyxrxkbkkguruxtgzpgapuutxsybwbwtnunxbzkkkxiiapbwddanbsrzntinzngaukrkbataskkdbprzswkzpxkzisbyydtaiybyxpzibwzdyyzwiigttpdspnppsibudkgukkkgybbkpupiitsprrzxxdkgbwrzgtxstrtwygutxyykryppgyxurwubktaysyzsudaagkxbzrnbabystuugpitbkzrpgatwrdnxxirtxpypwdwxxzsnuuaibsatdaxbdsxktdunrxprxbggxrrgdazsttsriyrspkgpwxnizszdbzdusrptygpazddauuudsrtidrsidwrptttnbykwyinsazudnnpypbbtwaknbibpritgktkrgiykxgiynzuwdarutpsuwguasxddnxiyubydpxyktnpxsnanxwkdiriizgdigkiyrxndxxpkbwuzwdrwizsuriydsrtpwiirsrpkzibbyzpiuiauzanprnrtpuuxbsixzazsxbwnybwunwrkzauikxgwtwingkkwrpaarinkgdsiyubsgyriywysbukaapkknwtszxbzwazadatrutxngarawsyxtznsrzuidxwgsxwydugapiuuiuibukawbxppybkdbdpdtrdyzwwgpxbbdwzxzztxgbszsapdxygtadaapinawiztugudnrwadwubrybikbzxtsnkwdarkskkbapddypnxxxxuugrssutrzkwxntsdwigiigwggsykizidkyysrpbtgwkuaikiyugdyzbpnirrdbkyybpnxggbkuaibzusytixywaarpkrniaykwdzrazwndytrswgwbsiisrxrggiapndtaaitxkukdyxkindrbzpbnwynniwatntywzkdtkzdsaurauigsrpigsiddrbnyapaabgaranxsindutuwsgdxbbywpxdgbirawkxinidpduxdpingbatxzgwkgkznkdxyaugziidzdiargpkrdzzdxzywrzrzsuntxikadxpkuzziakrwubzyukibkuyzyyikdyipbazswwupwxaywkwatnzkttzigunyzuzizywwkwgasawykukssbynptyargwkkunpynxwpxpznwwwpgtrrndnxxrgxknugwsbysgwbdriggbsbywwpnsiudyudbkzsasbxkxsgriabitigusrpzkbbtbtrprbpnkrxwtixaxdzapxxtgspgkwziazypzbxyxixxxyaudtxkriautbpbsknawtidtawsbpxrgnurirukxtuzwzptdwkygwuptwgndayyyxyrdxtzpyykugrxzbwypgbnxpdkzzzyxbsswrsikasxnxssakwbpbranbtnrkaraiwxdsrdpbxrxytbkpgngnzidrttxbbwpkrgiapuyzsibkwdypgxwapdgydzzgdugkwwgypyrwxgadxywnupbbztpddpxuiggdsnybpwppsixkziydwddrpwaitdpsnppyxgkwpgubyrkzbikxkazkzsykuyxyrizrtdrwpkdruxsziyznnbsrpazgixasuuwazirgrbyyaktkngyyzgzdabkakyzuyxxpwpizrrydxzpdsdbiarbdsxzwzbtdbsdwdxwgtrdkgwaiwurrtzzrdgykbpdaiauzakbwugukatnxazitwrtkwgaxuzkirasanzbwwrpipurwgwitngarkxpgxskyuuuaiwybyrrbkyndpirsrbgbzbdppkbzzabyuurxabxxwiaxunangbgatadttgtnizwtswxagkpntwnzagwbngykiskukiygrstibzzrkgkydksritxtbrnbzwxtrpznxxxxakxprwpibdrnstddkztgttspixwaduigpxpwuyxssaguznwrapuukdtdpinzpgarppxrzupurbuniuswigptaiywgyukxnzwzgasddnwbizptuuzaaazwapirtxdgdgxadzbnisubszyzkbakaktrnitiruistwxrgtztzastauwnsuybdnuipkzssnxzurusndiykwkttgawptwnnidbdudnuwwknsrdukygkuyinrtgaxpixyaxpkgubzbwwydggkzrazpkisttgibskiitpgdsryxgwpuxwbnxirxzinbbazspanyrbkzybtztpidzstidgidapayrryzxxkzkkwuwxbpdunpspzprwkitwnbasdguxakggpkgukkttwuurabyatnxgrurktnbzpdbunybuktdgnxntxbixgkpwntauppagtnzysiryditnixrznrtkbgtraarwpnpstzxubspgtkgipugpwibpdzknpwbpwinbkzwdxwytzxuwyrpayprirssntztukzxwxkuixxygatiysgdwwaztdbistpgudsxsdbtabxkzyyytrwntnanubrrxknwiidkrditnttkwprpbwgduxkynixiixwnrtrktzwsnpnywxrbdisnxabkwuasxbpanixyxrusarbyzzzuxawgdzgxunbksbstydaygybtkxspgywkdbzrsuunkkbtnybiaibpwzwtipartrzabkzkgdtysszpnnzzxuarnxyuxkkbgzrtuyxtynzprbuxrugtinydgpnwbprgydrnzutrwptaaxktxxykkntidxixzxtwwdybyxkywgutgyyagtzbbsiygaryprtywxtwndzwywggagkywinwnbxanzgasnrsykwrswndgbbxrwtkrtgrnxgtwtidktiudsiinuwatdkpssxgkwpiaxrxibuiwbynrtgaxxapgzzbktztkubbkdwrykspxxpsbnrxzignysawuazsnkbxiuxuuixsrwyiwzituzgywzppwtxbuwrtxrxntbpwyagrtikpbydxwbidnrsabaipasutuspayspgsnxibbzkyapxuuirtzpkxypnyxxgrkspuiudwstkdtbstbxrkuadkrbtgytpwnsgzxzzbkixsbbkiwibdgaapntpuuxutuprkitxakwydipbpwsbbpkygsbukknzgkgkynuwssdpxigxkzxtgrbxsznrbtngndytskdtwdnrtantxpzupigutttxawwrgippnzzstzsbtrzpagzkxxwtksuuatrxutzwkpdrdatgwwyiwgxnkguttwuagitdxkitntwpkkswawgbgptaaiastityrudrsgrattwpbznynszziakdxdusgankaybyzntyakgnrxdszdbwaxyxwwwrpabgtxngzxtkryzpszuuspsukynzxdiskittnrbttssigddpingnnrpskiutbkdsywbsiagazrkuaguptatsnnwpzyzxpintbsnaiitpywatzztrtzykpapniwbszzauyttzpiryritbasasidbrunrkdydwtnbwkzwpwaxkwabbiywtrtdibszkuiarnsrxnswpgspwtbpssaywpkdrtpxiyzxwkskzdpuzxxridnusbynyakziidbiwyrsnkrbrspzryzwizxdwrkagsusbtuigbdxtxdgrzdrnwwibwygrysdadknaxukksstzddkdtuspkaxrywwpbiipzxudxdkbizzpgrrprgdsusnsitxranpszirksynrigxbakunwsiyxszkyknuuxtkksyubdprsndyspyzgxxkwaruwyrbduywywugkurgbnawyabgyzzynwbuzndsnzbwwxbxnutryknxazkayzssxzuknwignskpyxatgawrzdkbyksrdywparksbazzdtswiunswxybiyunrbxttuppzpzragdytbxuypktdzakxptyzdbppntsuwtbiixyzydkxbwxgrgguzbrdunyrakygriiwgababnsatugbnnwxkbibsuzxprkptzdraupxuuppaguuusygtrdwyatnxiypdttruzyntbzdngkdpwuyxrggskzibrsibnwxkurwanddsubkradxxanptuzkiinxndrnxziyxwzntuaiaiiaxaupbbswkrndbyyggwdwzdnytibzyrzptsdgzpxnikrgdtzirbgnrrpuriingwkdntwwgyuibtwbsnttuxnxpzdukystxbkdzgrbxiipwpgtpgzgwguawnrazzbtykanrindxupynxuauazduadzrxrsrrunktiyyynzidisytngkxsisnuttigpztpygagugassbtwsiaibnuxuiipddupriikgnkwuntyyibxxrygwwrukytknagnyrpniauaapwkaysskukkgsngkpsknkuzrtbrbabxtnpyzxbzbwgspxinrxzrdzidptiyuprkpittsgtadutznnggzdyxubwatrzkagypsakrazdunstpdndtukniarkrakdydnkiztrrgduazkbdtwbwunkxbkytwaytbzwtsdiuduizxybzyraranxsyspnusdruziursrzysyrypsyzuzyrgxnrgbxzaysdiuntyinkzrwixsawgzykzknyitypndukagwbbrzstbtydbgkdzrntnsatisgtzaiduuwdkutwwdwkdstrzxwdyxypzygwgpzugkwdtrniniznudwgawkszistsyrwabpswsaaprzdbbnkwwskakgysxagipbunwuykrrwwtinwrbgksixbskbtrggzuypgtusyaintzkbpsazprtugpwgindsttzdstrtpgizangddkisbswaizngnnykndkwpwadbbsnyywsytudgxutnbkbarnpdkzgxbkaurduitdnttprydnurxrxgwtzydxswrniktzygpktnkrxatydtizpxgtytszxgbiyzkbatpgidswbuibawkuaaupgnunadwyztwnassyizrkdybbizaupwnazgpbastiniwayaxkuwbddtaxydnzwzikaaxazstngapztagrpsigaybkyknpaugnryxiwbwinuubkrwrtnbswtitisaidzkinurupbazanuryrpggisgnysubwikdusytsxpbspnadigkaiugdubztbriadtaazikpwpssasnyrdtbgarapgnzubxkugxwrnnkkwzdurduknytkaiyxtuwppxsybpbgkxisiggrikpyxausxpxyizbnsgyugazaatdnbnxrwyiasaiznzwsgaynpzggsrizpybygpytaxbxtznpuyuypaisbbrkgxdaupbbrnrybdzgyuadxgtyyzdzrsxbdbritpaxdgtixywkpndzuytpturntrgpkgntnyaiazixnataizwykztutnpasxspwgwgytakdrppwrrnkpzaupttyzxwkrzdpduxgxaarbdkxnnktwtgxkudpnwtwtnppydtgnbngpkiuukaiaxswsukiugtabwnusbsakdnduakkniiddrbpgwdkzgxazgaggstsugakyisupggigwwyixstbtdxiuiztsyzpiiwzzzxyduubrrduztibtskyddaabgaskgrzgrwwdznywpdranbaggtzttkibuybpwrwadpadwksrrywdwgwgyundwynsnraszwrizytdirgxwnkiwtpwwrgtsuptdziwwidbydtdkzttbtkpnibxxdpdaxngbbzyibtnabbgduazsuusugrnzraubdgidabbkdbigxyiruiwgrrwtnypitaixxyykuribpnsskbkszpdabtzgxdburpxgupaugnprbspbttngrpazpggpsigiggpgxztgnturytxwutrsinnzsgpisixatnaxikwxniygaturrzsrkgigprtwxgzxxztbzsnsdkdrnrdpbwwduzurbizzkatxwykazwsruwppbibrnyykistapnguduxzrgzsdxirzsubzyrurpaidabttyrddkrizztwtwpuawakdppbnkgwipanswxgpwwugbktnsgbxnkgtyzsaunzturiibdybdpiisadpiprpktukgygnntuiyrkwwpgynuzaruiuygdwwayknnzsrxggyaraxxgaspwsxpainpyyrnusppyrzbinyaxaigxntwwyrgnbxgwwtwdbpzzgxkaxusiwdsbassyaszpgbrxpgdgxkadudtksptyknzzznydxawdrikaxdrzydspywynsbgtsanrdbuspyspdktkarzigwtzyxgaxsirtbxusuabxdkpairwzgniwkisuirkkzyrrpirigywzwgbgdykukyzswnkgdxgbiaubiuaisityxaksxwbdxkgudagrkgxdptappgbpydssiygipdznuxdbkdiszsaprwpsbuxzaruabwugaaanakuupxnnzzyappbpagiwbpzgitynnpdguxyspzwznkkykswdnuiwaykgxruyunpuwnwwkugkdwrzbktrdizbyxxyxpdtyxyagyigdyxpkgikurtukxittkrpgnitzxpbapnyxsrkytuagixuyngpiikuzkayzigzibdynxnaybuytpbnwzwswwiudknpxiarytsbxspngspbzirydsazdwnrtknisxbyzitsgysszbwrdrbdxgyspktbskakgxgbkykkptyrbswggkxdzxnptkzpzkktunpzdrtnszkitbkggstzprstuyrrtkiidpytkgttswzwrttnbptpkdkauadnwnxdpapayyggrbtaxdryxwxwsxwurszaipbitddiyspaizrarubtptbyirxuiuyndrztwuagiindzkrwtkguazrukisyykzsptpkwxazazyrsgukbybapyakwzynppgrbusitrdndubbasztzrrswiwusuydybrgdxkpntnuupyanrnugdtnzgsxxpsddiattzwyakxusindtyzryxkpbsswpixpnztypdxtsrkryapsxxtdypwxbruppawapdpyukrtagaatxgixkrrkdwpzazyyxkxpxntkryykpynutsgwirtdxpkuzkbttrykbpdkuynsdxpgpsnswtskrurnpyaxrkibxtpuyrgunzkbkiyiwygziuyzpswnkxxubzprdwguggzkdstyiktzaisnaningzuiypiuntsspskaartnkyykwrswakrwduyudbyitgdnidpbzbywysxbrkwzspspadiazxgiznzasxnrxkpaznsikyibtuntzdzikwktggbsntbkwdigrnbxdaabibzdxxykdwgnrupbwsrsutkitrkwzxaaksibxdbkrzyrxxdnstudtxugiwkbwgkwziknwdsinkiagsatzyudtsianddxtkxpbbgbwukawwpzszgwyipstadwauuzratawaxdwzkutnnizztwixzktbikdnapnnurydgtwysibdbzktnugpgrtxuyxgdkikbxsknrwnduaasbuzkptiibtdkiadztgaubwukwxsyapaxsdysdsgbaudirwiskbisgrganynzingxpsrbwbitnwwpuzpznbguiuyppzxknyrsuawygarzdyazwuxdxaubdpttyayynyzdkrtysrybizzuwznbuzzwzustudtwknspnzdgxsnzwbrtsuawzzwutrtnziaybpkrxpiwzbasuguzkaxgsziyiwyyrnaiwzgktabtadwzzkrpzxwnsaknusggrruznagzyrruzuudurairdynaaddbyuiyuzyxskipbsbwwwbwtbkyzbdxbrbkwnbuyybgutnptkupkzwgxxtgkptadsnrbdtxbprpkbkygusapkgbbigndzysigyszbzniugsntztwuwrbxpkiibprtzsksupkdbnrrgsbnnxnkgygpparzgppnwzprwkikzuwaprggsnatydyggawiskxkkusdbatttpagakygsktrxkbdupaigbwnuxukutsdaskzwabniukbbnwdaikxdugswnyirbawgbsnxtwtwnzkskzkbptbkigztkbwtrardzypdbzbartdkdtuybzzwutpktizbwpnxigduputabntkyydpbipratbukpuuzppkzspswzkxzbwtptwxpstpgdxypugtaztraypuyudnixrgzyrzgzpukdwxyzixzazrpibbzzduzszanunxkkygiuxrxgaiwrnkktkuywiwakzbtappyuzadwazbpkzrsaxsbisubrtpbtpxxtyxduazkkgwwnzddwdgpwwnyzgkyabydzbgsaksnxgwbagtitgiyzgaiptsuzzxznayaaydapzgnkuaxtatkwzrbdwgrsbukauapuwsbgrbugrkzxtpxiyypatinxrngugrzzxzubwibxsrsdztikdgnzkugugasspnnygdydxynayswsbiwbtkwbwrbidsrtpuypyirktywyprngagkrnnukauankzzwgnpuwiutikgkinsytsxrpkduziygxiybwpzrzdnbtbsrndiwbnngwgbguixurpkrbyranzsuwiaiwwrwiryrkzrygtwwsribdwbdbtkntxpunigzgbrpdsrupnurxrwxzztyagskixzukupgzabagbatrstyknwussikitkkudnppagtnkuispawkbtyddiuztynwaspyyywygpgtakdgwrayatsgwkxbarbrinwxanwtiizudztdzsngntxsiybzxdnrntgrsyksisxptsxiadykbuwduzrtawnxnrxapptxdnwarisuagrggunaarbbspznkxriwarkyuzkwzanxxkxuwsdgsxisdigbtnipsbbrsgnptbksyigsypskgtgzxdixanbsdibbztirkxsgrknyzzgkktzusttnyssawbnrxgyzbgbwtsirbbdgzwpxkxixkxyynrzxgyixxdxgkyzsgykzdaunbtdggiadatwadunasxxrrnpbkixtwpwixdkptxxxtnydsuitkbbudbtypkrdzzrstgutsrpxkwidrxztdatwnxtdtbrsutbknzntanxiawyazbnbzspwbwnwxnwzyrnngkksanzbupwxzpsxwwstkxzwankdtprybksnrrxknwyppasassynbaggiabiyskwyaadrwrydukapukspbrbkkizriditxzawkwuagzyxiapzrxskgnsbxbdugpdzgkutixgbwditrzxapbzgzranptuauazuwrwrxbsspdanngassbudnzkggauiyysapngpbtxtixgdytdtxyxantsrddbswadyibanypaiikwzandggpkzbsukdaxygntggrikprbknsuwxpbkwwiynwtuktzgkazbkwxisxazttatiuxznysyngssubprbzgpruygkpxbapwpkirbgwixazkzdinypdkkypigwksusaykabbudnkxgzaywguirskwpzagxpgyikngndsyiwxxdisiryntdiitbiggsxusbnidnryspyuytwagnkrbpibbyiwiyrbwaisaabdwxxzyxskupsarprwbxbukypnpdyizizipkrszttstssyzaakrytbnrtrukikygbkuaztabzudyndniwwrdaxpwbspwnwxwrgpwgbddsudkywxdxdarbzsuxsuiktxzgauugygypttzgxktdnaazptixnpyayxwdupwzdkisntuiixxurstsnwpbduuprxikkwapupizbgsbbksrssnauzitwrturxnwxsnwutzsuisukyatrdkdnbwnkxwtzydrdyxwbxgrdxubyndakinbpixpuuznwzrrpursyzduryagyzxtaxtwyptwaakzzaswsbigbgugwrpbkrgrszziwtangyxgrbiktzgrsnzyytawbdgubsppayagiirirgsbrkitstxyyiwgiwxbpubpudukidibykrdngpryyidxpsnxndxwnxgunaudsgttpdrbtwdtdpttbskwaawyrwwdtanyrizwsnbusiswngpkiwbdtsazgwazyskrzrbkwizgayuiutpzzarxkxpynabdgxpbyxziywbszttdauxngpxzatgudkywruzrnkssbzpxprnpknnwzaxrudipnwrwxgtxkzaikwdapsxdtugbdusnpiradnxdgntayudnrgabzwbgaukgzrdudabrndzysgydytbywigazbbtnkuigrpnypyzdaxbztnbnuwwaauxrrxrwskgatsptpagpbrskudapyiaknnssdnwdriakynzpdkniizrwpgwagrusnngdytnsapudkawirzpssbydwrnduruyatugwupagykpynabpxnpabssxbzukiggkdbxxsxpasxkrrtybaixtwubpynxbwasiynzzdtyrsgunpuuknaukigruawpzbiyxzssirxntwrskddsgbtbgpbatnzsadxiaituutpykktzpszpwadzirnrgabigzxtyxsnkrpnwbuyuwdkyirnnibapzbprrianupsagwywbukbwuiuuxkuxdsibzdzyaprxgiyssppnritrudgpawdbsdwrwksagyigxpyxuawziwiabbipbwugpuygpbiywkuxkgbwisuwyubixbaubipatitgaigswwwuwpkpggiyngakaaniziktixbnpagzbipybgwzrwriwidbsanbuwkakpdyxkndxwwkipnggnnybwntrabdkwpdubxtbbtdziwakibgkaywixwaxakpxkuarudugnbxrwnakszaxubzknibraibinduundagguknktggnysukxkkpyztbyzszudibwrdrnsuxruzubyzaiadausddbbwbpkiwanznisnpbrsskztukaydtaagzpyuiitpyptwikrairdzwwupbgrwudkkpdyxiangnxgtpyzsbxsxknddpubyzbznsbwpnrryspuaugxgrnygawaypprriwarnirstwbtnkazdibxtgddxygtbpxuwgruwugibwzpypinudwrnigrxxxpkwanppkxxpuptsigzypkpuwdwtgrzrxiikbsgpsaspddkdaauspwibgxwibzgziaxdbkdgggyurndpbxbrnuigarpdyzsdayagzrgugnygudbrstbuggndiiwkrndbguxsuinatsraxkgnprwgzgtxxzuwbpxxxskdnrubnxwbxdpaunbzrwbixuiprztkwppaykgysbununxnniazawtpgprnyassdkggktxpgkgzrgnrpdsinkknagnsbrutygtstnswdtnxdrbpyaxwtndddaybgtzpadtiywryryiyukyduzusxzdtuxaxggkarbkgasswigukguxszygtybiyttxxdkykpatnazwpnsxzrrzwsxkaxuryzpidyyrnwztyyxbxyysywydwsxbstxyuukktsbkipzittgraxizayxrrzxrpnppixgapduiyrzrtkbdzdtapygbauxssatdskbnstynkaznyyrytxatgxduiyxkarizugznyzrspyzypkpwdznzdtsrkpyttypyrryargwzndabguyxnpxznkrpdpytsggadgxinkppbxbyiyyznkiryyaruwzixknisiwgrntdrxdktakidsuwukzwarbripdtuuuwzknywigngakuuggtuupddtdpanndtsuzsbtxubkdbzxkaitdazrtadiaagdxkxtwrxpzpkprgwybbudksbaitbngizpswptiunudaysrspnzyrubpdbaanrawsirzpungyrriyugiapzrwgrrbtzgbursdstzyudzgxakkypgpbbxnwtyyuaddyttrnxuuwrzrutdbbnnxdnankkrskixsbnzxwggyxsgtanuiizxbwxywyupgnsipiwraturpziuuykbxrgsgynrrpustabrupwnbanrpasrtindwubrgrdzubkaagurnuprbydkxdrspgsabzswdtzdiutukxpinzwyzibysidydsyuxgukzkzdgkrtpanwxgwrugdiupnrwrnbzrpbtrdxsabyrupbtrkpktnnisikizaipwydignkiuknpytdxxstytuigwwptzwgkbzpunxsnkdditzzpdpbkbgyrzzyyntytntabdnszbtdaxnrppzxtbxigdwrbnunkwzynnbnxwwpssayxxdwxsspkngpdyysnbzardyzdrrabywasdzazsrnxtitbzgsypsnspyixizxrttywrnrzdsbuyabyptnuxxargakyazywzurizpkxgwrzdnxtriyziwzkrignwtizwyzgkgkswbwtpnwibagstibakuxgsayabgdswstgxswuwaawgyitbprtuigpnzwzytbigsiwpgrdbkrdwzbasiidszkdgsyxiiwntgbgrzbznikpybuxawgrywidbxksdziydpgsgxkgwxntrnbarypxxuyszuagrxrwtnswkynwbauuuxgtztzzgxknxizupyrbdzgyzbixryitkpbtrauadbssundbyakwtgbydnxgynbrrduzaawasprdsgtnxkxxdaixxxgakrgigadwsubxraidrunsiwdiurusbpkduisypakydatsztwrpwntgkgditniwggwdugndgipuzpgzpbinrttubbkxnkxabxutwdxnranirsuppbpnygruztzpxsiwbiabpkddyruywybpryakyzigzaabybtaipwswukprwnrtrnawpzksbyibdnusxyxrnybwpnggwrddpsadwikxnpxnbgkyxadadptnnnrbrawkststyznwaxywunaydazsskdttikbbypbattiwbpnxdpkdztruziixturdaugnddrupibnsrsznrbkzkwrwddxkibyurppxxttgkawpspnpdykkbttppdtpxizgyykyrkyyzbzwtzapiyabwgzakkgypbgtwpzkiunndkypwbzkyargrksrwsrwbrwzgdkgaudxwtspyydbbiwwidpxtasauttgbzpnwkddzdazaitwwuxuattbbsnuknuirzkarspktxgwgkkizisaxuaiakauawbipbaakrznxsgakbkutzduspuipdnduwudzkppdbwnrrztrnsbxwpwpxtgpdrznpszyutiziyiwsrtundisusiixyazingbwusnitnxbgarwwbzaynxxndbrnwzrbwxuddnznatsxuwdxxgiznsbapzxbkpzrwsixszwyzruugrstapgiiyrnbxwdxrrudkrwzzudknpxtxggtuuybuasdukngbguzbnadrxgbkyiatzsszyuwaupstszpdanbyyrisbzggyzgzyuziwxkxrdnspwtuayttaiidprudsykxzsusggwdpstrzxuwdgsrxigiaytbzbkddgxykxbasxipbdtnngzkirzytzzbysgaptnibwknwwipywprwatdkbtapxtariznyxispzpidrtnitggkswaaygtnpuawitkrwszrnpuuannkwxkayiynzuxrxgatsgwipikdbnskkspbdkaxzdxnkbruabbdbttdznwpbgadkdpnxugwxpuayiubykbkyadgdygpkyabddrnwayypdtiwpnssaddzgbkgwtaxppdupsazdddxgsgzptibaisikstzabisypnbgtipiyratswknnbipktyksdptrdtizwdkwgdgdayrrzadtziipnwibuwuatzrziaxxwdayuswrwzynbarrwybbpxdrxrurytwaznwgpanridpuirbuwiwtkuzaskurubbdwznzpinrnszrtxbxpzkukigsaptbsgwiiuzirixsdkkxdxrauxwiptxbdxpgtdxpnwkduattrkstwtigtadnwwxtxpdwyyktdbtpbrxussuaripnirnzgtgigkwygkdxruxkswnwidwypsaspgrbwkzxgrgrusnbsszuixnyszuiruzxkgsurwdpxzstkrbkgtysatwarardusibxppynzubdtykbkbsrbwazgrddkgsagakzzirkytuasapaxrxrurzartinyxrrtdsuwzurtaksxbdbdkdbtdnitgpiwkzdwtydxspwduaxianidrnkxuksrdtwyuyyurggdbtgnxutbxbsadugidxbdpxziznwpxryupnwnnndbskasdbuzpxusdawzdnxyrxgrutpgidindbtzrnyztkruiigxgyadsggtxnkusxayuknaiwugwkntwpiadykdbsxaytiaispubdkzpdduwxpntuarzpxyyzbuxpndknpxknkszrgptytxyangurnpdkastwtzxdddrgrayzzrnpzbsingkbdwwwrwksbstzrwssxgikkxbspbtsapxdaxxgugzytzywptrnidzxknsdbxbykzgwbtgtsypwkdssbxnwyxbiziaixkyiiwryggadayxddasnkgdtsksuiknyutdsxwurrsisdddabuaigywarspgdusawuwzabwtzuxbytkpgdxdwxizrswuukuuzrwkytukssxsinkkpkaaybtktkpgziuyiddunrsriigdinkwxktzurzizyrwwntsupzdrtkgduztzudunbsxgidungzkixnwksbsiazngybgiiygaszwiiguzixynrbrbpuautpdkxtwgdrgxxuwasggubbpdrtuzdtpwryntrsnxgatxyyunbbgsuuasubrzsazpugdaayzasnuyupunyxusbuttgpwdwupwdnntissygugdinubzpuugbikaurnuyzwxrgkiugnbyirsuukiaiabyztaxxynnpnxprgbgysizxatnuiynknwbstkxtpyiatakkgtbrkuzytrrwywuyzguiiywagdssrrbtkzngwnwppdaxbyzauntzrusxadidbkwrsaayykrsnsyyziatrkatnwigaynuikiyaxbtsrggpugapzawrbwnzdxbgpxkbtuwsprnzaukutybsyyntsybbwkppwuyrgadixnbzwdabkzgnbtryxpxyttnyxzstaibbzsysxpdswnnwrkgkxntnwzxputgndkrbygtxbtxgagrxixnytunpgbwgitxwpkpgsgpwtuazapusiibsgnggybgatbrwbgypatikpuwywbyyrtknrpasxagaxygpaayxgpbrrszzibbyaxbkszxtaxtdudzwdtnngtynykudsrirxzkppxuirstpnutusgnbygwxraartirwyzbubdssidgxxuniityyndtznrwzppwugxkdpwpritgnabdrgazyurrurzbsabagwtdtsxkbsawbzyznngrzuindykyknakntkpkrigkbkxyuauyyksgrnkdsrgipntiwyidgbdgypnygsratkdsbyixrtakndzudktbtkbuzrraprkxtiidnxggwtnraiixwtrgxzbxkpdirydizaywrdddgrixnxssuyypxzatyiitisakruaskxdwzitisuzzxawxskaawaygxuyakktrzydazzryrakakadkbdabztbydgwnnwxtnndygrztiwutazbzkiaxkdwuidtnudrxridnwzyruxdzawrwnxbdarztdnsakkugprgsskkszkrzgppugxbdzxtwwbrigrnwdgintrkuzgzrwazwwddwdaxaddpgkrtnsgkxztwaupnwrrzabyibsbsnisnwwpkgxtnzruwribytrxpngakzkaxygpnznitdwprtnsibsdndxbpybrprkytsyunwkzngrutarnkxtsyknizrupsussynkknisrunbkwazbyupnnbiiakbwurbgukrknnaapwkizustyubtyrkgsgipyaywanrwpdwnxinubzrbrxpiptuatigrbdzdxtisprwttygpiyupsdsiakkuiryaiyipgzwwrsawatwtprdugsptsuikkxkxpixtbpbktirxxsdguuyxkddngunwzksbtkuwpdbkuskwitidysyyzyrswkxddzswyzxukyyuxrnsdxdpdbdwbwudntrpwukwdigswxrpzduisdwgngtswwubasrsztxgpiyktyxsdnkyptdkuznizynpuduttudauxwzbdzdiignzikxznpytdygnkgsxyggabzrbpxbpwkwyaiuipwnysdkbdznsgaxkznzrzpntzuanyzasdnwsdgxwtadwutxtrdirsxbywkgkzpuzrgaxxzupwiwrizgatbpanagbgiixduwkpkdsuragrxixabzkpksaizukipgypuitbugytxuzzttszzduyxssktssayanzpbbkkdtwywuauyyzttdztptrdxxntwprzkpiizzbwirubbudatruuggxkrdnsnaiizywpuxpnbiaudapgzzbzyikkspaxyddkakzyidawkbzsbyydtnbsnyzbawkniugdnwxswauyaysuzgrywxunyautxbidsxkwggirdnrxawxdubikikargtszbpxgwptdpunwpiprptuxkrdsgxyynwtauxarxtbiagdittsziriwxndspkprrnxxugybwiudaurausxdpnpzgxindxunrsdnbsnztppwngrbtagbbiiprwsygkrspiswyarandigdwgnpzwxagugugagtyaagrgybninanknikrzgnnkndwgxgsirpduygzwtyuasbpkxypwxngtgbrpwtkdwbztppxnskwzzkwbwpbykygtkbyattguntkyygxxzwpdibgsbbigwyipyayxnggbninnipaatiwspnwxwudyapraxasyagkgwybdrikzxwwisdpxyktwgpykdbygswtdsrngtswukkngrpksnzxyianpxbxxzxawwgnptnkdixtpnikdittkibakzdnuinsgnxaasubnrnrzdtppskaaduxzpgsxrpknkrixnsypizbuxpusgadzxxwkkipgsbdnuidzbyzgksiwkxdniuxgrnxrtkzysgdbpzuitxbwwdbawuuaupguasbpkpbwpxissuxydgkbtwrsbdnnsggppgpdnsyagarxdpuwrbwdyntpkagrwzxpwnzsxukpyuzybgdzwrkzsanrnpgpnwbwzbsxtyndpyrtnagnypbssuwynnkbpraiaikwyabdysggbxzazzyzanwriysrxksdazirrgnngwargtkaxyybxbpnbxzwtdwgygkbrpnznrattpngtnaabwwsukruxatrtzrkztaurwbpriaunnkttruzikgpnxbdkgynwyiwrrkbxdkpzyubtiituyazkugaxakgydgbnxwppaippziiaarsbyaguszdiizxrnwugtitrzxuxrzixwnxipbiprnstbwdptzryzzrzxbidswazsyknrkasnpixntixzwtpwwgwwzbidwrrnabpdusbkbgziudsigaybutaupdkiywpgxbkgizaipnzsywuskugzxyttspixdwxaikdxyakinyxpggizbspkbyttnbbzrsrykywzuyagassytndipwsgpsaswzxtbdtuaunttrdgisiwikptrgttzdxsybpwwpdsnwxwwysidyxgaagbgzrssnztsrzpsrbrndgpabpitnidyriprykanprtydktrnknawptkzukxgtszwwypdazkgruybtktaakissnytnktixrbwtkatsnpxxwrixsynbigwssrdnpbszanrywinbntdsxxwykissiwdrkkkxrggaaybsgdpnyaiuzupxswpngzxksikutybyrpksutwtyrbgbipukpdtgwwankbywigurgnagxkxpdwdgpuntitigizstrsryisnbbixutdxrzdpkiibpgxiinpbpyyrazizdbxbibiwbxkdpwbswixuiddpwnzygidnuiguwdtsdyigtybzsrsrkrdutawtndkwxrkukxiiudzuxtpiyxbunspxzwkxswxanzibzgdyxpnrbaapwnkipizyxutnwzrdrryxrgkkpztxibysdanisswxgwwkaxrgdikadxwwsstpruarbwgturxtbzttikwbkdrswdpaiknpwbnnpuwnxddkriinrpiyadprnbndniyyaaadnwdrznuzpwurwgbtdigyattgbkgukszwxagbdispynyabtdgyrutuxddkrizsxdkwkbakwuxxdxznupubzzwntyzaxbryuswixukrzbbkbrgunabxrzibdyuiktriiibipdauwwikbzyawykbgwdxigkayaysniiwikdzgukxigznuzpxbipsawxitdtzgrnwdgtdiyixsgpwkkrbatdipsgbsaxktankgzrpakbnbzidsapydugbrtpkstnuuwiknnwunaxptrrsryigpruxgatdwbkdpxaywtpznapanxdzbbaaxdrtrsurbitsxduagtriaizbiygngrsnnrwpprtkrgkaxuisxnzskwkukutxbgbgbupibtrudypppsuusywzistxpinkrgpsyspdkaisynzywtakpgaixsxpwttwtpwpxiyzguyzwtyntairrittayysiwginzzyzuuxwtnywtdyitkdubtayryixtgwwuawgyyuzyxiynxnpskkauapnkupskskwwzgsyrtwkbggzyziuiapaxxrppdnwkxpawgdtpsgbiutikrwdagbdaiixbkpzpnwsrtxdxribntikgbyyuzxbsuuptbsyazupdtsntpankdzdptuxiguurdwkakytzskrtdspwnnygdxwbibbwzudytprkbkbidrybdtiknnuztxdbxdsbgyktdwzrkykzwnrktyxinbwsuzirpxkkagiwtwttdsnbpynruidsnnddgididdkpitzidntsppdsbbssiwikpkuritxpwdtpbgpgutypipupwyaskpbnpysxyiibpwgnpzupirngssawnkupyguyrbubzzpadaagiwugxbdypxbndntgaddwszddswnnxybytxrinidnxizpxbyxtgibupwduwddsppprzawabpxuxryspkkwpgwxsuakytiktbzyikstradbrywkpbwpxyxznywrdyxbpzkxtnyitxnakbabbdbsknibxkpdsywxybsigirynzppkzsxkniizsbgybakdubszrugzyrswipnptttiznpusknsbpbxiwnugwtwgzgwykxubapxwkgtkzsykwitsygbdttwnwzpxdxdixiaxgpuxzwyxzattkadnpbyiatwzwktiabygzdydnartbiurgywxgdgzskunkkkzszkxtpigggwubazdrwbswtsnsbibxxdprxpugguanpuazinrdtasitdszxradydwyugxsrkszuiswbytgrsytgxrwtninpgwtstizkdzyapppnsstpxnziuiynyuprpswruydtabikisagnipkugbytwpgaprbxdipnxipbzatuzpskuuigkdzwanaxpngnpgnubixisdzxsxppykiktbsabwyiwgxasrktrdusauisraxuykgdiyunxpukkyzxngkiiybadstzudubtugsbtkznssadpsxakkrisatbyaadgbsdrgtiirtwbpngywypwknrdnnxtnuxbagntgktwgpxaknripdstnybskiiuxaxypapiitkdnnuiiadrtrrynbyzwkrggzbsnzigktipbrkzgiatkagspyzdwrrbtrsdybxrniptkwuadgdtsttsrkiigxkkdwktyigipsyuadxrbwsskpyatpykgixastnzntinrpttitwkbzgnsnyyudugwxdabdtgnddztatrbkpsbwdbkptbxrxawsgpskinywwxwgygkdygbintttduzriukpakbdbnzsgdyanydbdibnxdpanudgyinptrssdkrrkxbrgnpdbtddsrwrpbirxuztaddtrdssiyitiwinxpgrswsdixppabayddukdxgwznpnsbtwktisxyzyxatapktkariubpkbpitwgiritgkinzxxgsyggpwzuiyugzzstryxanyyugpsdygykrbbgrntbppktkbgtdbrdkwupsrrgubbgxkspnrrkabtksuzndkxrggsbktdsnrnxstuzggrizwskuyyzstwgzdtnpxndapyguypwzntzkndrwszgnykbtsyraziaryrnggywrbypbbkauwditgsidrgnzdwdyxikdpzbakkugwdwrrpbgrpuszuaikzrdkganxtunaywuptxiwzugxapyzknzswdkigrbdartisrsdwbyrrasgdpbpdsbwgbnxnwdrztwapbyyrtnwidksztgrarsaiikxuwtysaxknnstzpwrgarznggabgpiaudngrpixtwdrptnasaxgubkpzbbiuurnpynwautwssnxkdguygtnbaugaxttynxnprarknbkwkigzazarizuikdskrubypdauabnnnrrgyswkiwznixdgbssybkuuypkgpupixzkynpppytsrbdwzdagurppguwizuwtxtnwyxxinypxzxarntrrxxbkrzdxaypygxyybbugbkkutppntsapgbgnssrakzsnknntsibkrdgiszkntxraxdysnsyyyzizgnyankasukbpwnwspragudayzzinwwnuywnanipzuzziituxzssaybukkwurxrdsirzuubnrnyyuaxdiiabrkxzzpzdigdksptraixygyixwazdykyttartukrsuyubupgbzbpxagbwriyssgdipabysapawwbiaddtsgzkzggwyxwspwwxxgstsnxrpznbptpiwsnkaawuytrdpdwpyuyzwsszwnskaygytgtyisuusuddsigbspdubrurwbubuyirgbxytzawyauuygzuyriariganatnsuwdkgypdawwxtdwkxdnywixbwdrtirgsgtxdtysxyxxnrpkyiwbrkgdxzpbrwisurzrskwdsrkysttpspuwwdaauadtbrznztsgtkriryizpauanpbptiunuwgiispwnptzkrdytbrazuudngxdgtiixkuxbyytzbbtuataxagdbtsxrtzyngwtdtrprpgbtpznuwbtguiiyxkzxzrtgddsruxbtipzpsgdkwnxudunkiatgzpntinzdrpwnkrnprxzsbsrknrsnasxwwwgwuryxdrnwurksdxurtuubnwwbzarpipapnsntrybwkpxxsgrbptnadnynikwitsxxkpkttwwpggwixakirrtbtndnwrpiuatyrkxwszpwnyiwwggdxinizxkastukszrraaxbgrguwniprwaspzttztsistrsdgkxwskptrzipyxiauyukrpbwxxgyrwasxgwwbnayyurpgxiibwrrzuunnbwrksruydkapzuxupntpnkkxuyyirruknzkaygtkasswassxiydspsdztzspxnxutwpsuaidzpnysrbnbaysbzuprtrsupupzgxabzwnyzpzutkkyxypdranrzusbtnsikrnybzaxbwyiykuuidiwgbupygpyzwdtbnsikzaxynwpkdnskuzyzznprzikpzbapsuduunxkipbxurparrszsrpwzygaynnrawsgggxnnbgraaknszuazzptgptwsbwgwtrypnxbxsykdzgnzknidxpduystbddrupztrzxppzbizgdassstbbrkriauktspzdyskyynnixnsyaipukdwwsdsrzykraapukuygzaspatzzzgsurwgxtszspgbwpiigkygzakbrwadpzwztisnguurtpttpzdirxikbdgwparbiyztprrnbxnnrzgypntswxwgtiwwkwgurywsdksdizwrkazayyxdznnxrnzbbbagdyiwuswtybxyarxxwntzzpggxrwsuyzngznigndzygpsssxnzzbbyadnruingganszdzsutainwradawsrdpubgksxnptaidnarzxsixasuuniiysbxbntnabadwynttsbsizyangwidtxuxztgzawupzirkbgdygdiwawzuwzpxwzkpwggdrngugpsggswzdisszdaxugkxxtayyxxsyrxuxuikdrswrnrtwbguapxbuwybppdidgtpxzsuaypkirdzppskwuztrpyapbbginrzigrkwxsuntnsbnawyzunitawwwtpkbsibrdipiwwzxinsxtznidpxkiirnxziiwkkxkpzgbtyawrzxnyksgwkrurtbtubzbdydgynuskggzygikssyykuiirdwduxgsuypwsuuguynwsnikbiiigzrzkariapzdbiwysygayatgrpwriksgkbixykiaszgzgaduxagyxryiunxxixzxudrxgaapnkaxbgrdkawzrndadikkbtkdkbkyibwrptkxuwygdyxdztnnxznysywagytgdsrgxwdadukzdtnrgkunxsztysdsntpsupkrpxpkkawkpkpzgnzabbbszsswxgxdbudpkxiwiwgkayaszxkksrtswaassutxikzbpttnzxtzykdkrttinwwwnxrardatdkxkynrdpkdiztwiwyzxpznauazdwnytxwtgrayauisgkyzixrkauarrxspyiskuisrwrrxaurbwazsptruykagbwsziatizrwpzuzigpgtzyawwiydndxnxnzribstkpnkwgggpaidxbypgturrisbuxubznntygkigyntykuuirttxuyzitgiuaxsizdbsuugiyrsrnsingknstpnuiwaxznggwwbnzrdagpbggxxgdytpinywgdidukwxxiskatbnukbbxppsnnnpuwkpkpasdtnagusnxgbnrbsbgpbtyuttyrxwwtidnnayxzbtndbbsutgkyuktzpzxtkwrwbxpptpwddaupbnzidrgtkutbunrdxnpunugzisyiurxgdkrugzyxztzbrzabntusguwxznkgwguidynaxrkptirayuinzrgkrxbdtxabnzkwgbrgygrnkrkxusibrbzanbdwkyzxpyuukzzirapwannrbsbdbizrwraxasgpbayznpsitagrwzwbzustubiztbskwztzggwtrsrdidutrdnsnayrkrxkawzdrzpnysputnuyppzgizizinawzttrztdnispuabzdwxgsbxzdanpguaxnsnwtnsaaayuyuudayyydinwpxrxktuppiwdskuuaxwiazpdgbsysabkdsgrnbsxxzwwrwzdntkbztnyxiydygytinspkbrzutptiwnkgprdxyppxpytdzywwitudstxykwwziykninrtttuiurpggastbidxszrrbugrisbzdxdiyawbywrgzigyzsypbkzpwiyzwnsyazaxtrsiduxditsrxryydydyrrxixnxiywdizddxpinyadwsudgitsdtknbrnpxawdsswyrwupiskxtatkwsupxwbyrtputduggwbwtdaindgtkysgruknkkyaitadgutygyyxrykuwsrswbrutwnrsiuxkrdtrssgnyiadatxnznuaupxzuawttsiskwktysdxwdksszskdwzzuntssdgpknkdaydrsrwssrxurkzritkubnbpiwuzpiazsrbdurasgpnuxuazkbxgyndsyznkzdnaaudrdryxwxdnrbutgzrrbnxzntgnybnknnntaspngwaxsratanirtpgtwxdidzaztswskssgsgbbbyzyungksrdsbriyxyixwiiiztnixgibzkrnixkyyswwiwriyxgzwryuauxszusygxwdwxrittbgkpynnwwnuiuzpxzgztanyitgdkykwwzziwnkgwzbrrtziytaxgsuywdrnkngkxrzdrbapwwagiuupaadtgkwkikbrxaxgzugywypbwigwsygbdbskwgsgwdyryxirdswrsxudwntinipbkugyxggnisappwngiarayytrxdntuwrppadnnnsaxtkirxkipdspwdnkyrnyrnkgtzkuptuankazdaawtyyubrzrzstaydynyrwzbbsnzuysinrtxirzzagdaigbwbizburbguigsubbyxuybkkaktibdszaddnyksrdxnukgnppapuriapzgpbpgraxakiirbwbaiyywtdutipsskxxtntgndnrpuyzxgiytixypsdxxdazxirsspznrnzdndkbbabsxnsgbdkyrgiwbypiatbytixtxwpsnnbdrtazwkxxunkanbswzazxxwzawrnrupntwbibpgsupudsuzbgppsdazkkipdwadaaptksdttnugwsarwrnbaxiwapipspkrxiukbpywyapxbzntwuyydzpgyrwtxrupznrgtwssprusguwpaxzwbpuibpwzxabbkpwgzpkziyppbydyrxpxwkzarkkpsypnznskbrbangwpwpraiuraisinianadbxiygysyayuukstdnzukpbnrirnitzwnwixbzuzryuaknyzkukbtddxpkxardaupwuarsarydragnwnipwbguwpiwdkastukgdxgaygawksngdaariuadygwspiwxwyyasigpiazwdxwzawpauadprdbxxxxangigbnnudatgawpsntuzgzrutddpgadbrtnwsdyyrbbayinbitwgurdxkkzpsyubggiwbruzpkigwpsruxryguaxrtrxznsynzzdssuyywixuibxtbbzwsgugbytnrttbxkydgauxiaxsuxabrkniatrnuaxxiaiixraurspkzrgrxxbbdpiydkdbpyniuuxazrsipnbiwwzprbasxirpzkukkskuwsgiigrybrswuwbpytysuydakrgbkzugpwrauuxpkyawwstpzptbugdtnarnrdpuwguiizsbdrikadspsribxnsibwwdxdsgwyxbzztuunpnnrypyxxtdinypxypixbunywkxwdnxssyystpxpiuszssnbzixkaitbtgxkaatzraspurnksidkdiatxssskwrsprztkubtnskbgstpwnxsbzirtppsakbnbnguandtduipdtpxxzurptdskxpkbzintutradxxwkntnwzrxbtignuzyusysrbuatgdrxgkipssbxdpuwwwnbysnbygpdsinayrksgbubzidzytpybayxupwakiuwtbszwtskxbaipusbkbdspaxtdsanydkpndukusgddngzbzpinxuwaxdniadksunbwrukxigyazkdyztpbxdpunxgzugxpbxwxdswbususwiywuitpbpuruzantdwngtppakwrynswxdbxgkxnsunrwpxnxzisdxgwgagaxsntgzxaruaanwtttkuaktixxpyutsiusdidwsbnrriknwpyisrkbixggntkkawrbbbgtdyynurgwuuitgnibuxwpxnrikxrkpaaxsdrziwwkprwwikykbnpnsdnpsktngyngyziigbzgdxpuugbynpkdwzyzunxgkxpybkdnskwiutinsdzuraitiwbuuaiwywdxgdgiktiudaixwbpwsdnyisxusbwbwupagrnzpakkrxkanasdrwtysnianupdbtnrbnukakbgugsananunybuiikrbxiawtaiywgrzurnxdzwwaxsbrsindbktrgtytiirtwpibrxyrpisayuuuisyanpbtiaktdrbbrdzpgswpdrwasdgkbuxynwpkrggtubsaptaxrrsyyskazwsrbrbxanurydruxxyppyripwixxnibyuyiddwukixinxdwtydntynubixkzztdszbpnsxugnxpaigxbiiyzttdibkidikixndgwuktwwwgxptygxiyngktdbuwrnpkudbpitdtzpspwppazudnzrnbunzxaiapidzgzknsxniixgtdixzpusxsxzbktyyspnurwwasisxrawiikgtzsntdtxbnpigukykkuzbtnbkknainzygasaxtbyaznpyywuxtwzptdxutybtsixuswkpgdixapnzaywipauiusxzrrynwgaaubppwyyrttbpgtbrxngpwsbbxkpszwpikpnxkgwduarkpatwtyrbyisdugxddzgnnbatygztkpwstbrxbrrazsnbbiybnxdpbwpwrynarbwgywtwzkknbspyapwptknngttkddbidyridbatkiydgdwsnxpdypzgyttkwbapkwatnatnikikknngkixigiuybwktptipaxkputsburnxriguwyawptwpwbxnbxwnganuaxwsuygwuxkbwtzuwubzzpbrwuriykgikwgadkybyzwngstzbntkuabardrzdxwitizkdaixbwnrgsdtpwrszuyzgixsypdtznystwpykgksuwkwwwtwuspgzbnbdginkgdtttnnskrrwbkgdkawaswyupgpzbdsutttgubixaznisdbrttuwuxapriwibwddwpriyrrbntbkgtkzrsrbzupggtybigbrppixiwgnntuyyzzkbuiykkkariznsnnzxwzyuwiubygaxazwidyiyusxrdzgbkdnxkrrkruakntsxxngbynbsxgtbiwstagxpgzsbbrkigyuapgurxwpnugrkurpnrwkwkigakwuxibkkwngtbannntkindxiwtwutrnannabsdrwyztnsgwpxpgwktwiwyiiktaginpydddkxzgwkiuubtdzrbgprsxpgtgrxwxnzzkbpkuxngddaiawandubtkknryagsgrbuazybipuabtwizgussgndywxkbskwtkpkizbixwiwrkitykwtrwpzpzrzxkgkbubyzbawnubnrdrnxaasapigauprbgxiswaignwuzkgyabsrwnspakyxtbuaxgitapdszxiassrkadnbwpkgrkixidgkbnpnrxsxinrwgpdtrnzawbpxspniyxzsyunrawkyabrxxzbwswikwnwndwkbrgzugddasniykzikpbgydinbxkkxggziddiwauszbtrudzxgdytxgzigyygdwwnxxwxtkpxitsarrbdrxkkuxwytydkkxpswratpdkxzgbwdknggrnipyuisazwppksdiywdrktawixuuwbigbrbrwpxbpnnsiiyzpbunpgrnbbbskuuzpastzkrgtkignwbutugxwpnastpaabrupwakkbsknrbnuasppssugstttptyygwpbwkrxrapxaubbbrgywxdwniinswkxbngnardpuytyuiitxxaadzbpakzwzwizwnaistniubwsuuzknrwwxarknwtxstuggwxxnsbdpuzzzaddutsdwzrirskppnutnstarpkgawdyriydxdpdawapnwawsbgdnwpyxibnidnrikditaiwrpaubnwuatgxdkknpykwkztxkkyriidbgbrdrnrkubuutigrkpbiddyutigytzaairstuwirtnwtytbipynyuudiiaznxzytrzbkuranytkwynatyggtbunpbuibunxxbgggnuxynwnzuryusnrrgauigidyniwuykwdygsbbwznibxnrrnsbwawsupyxpugznxiggnxdtbyszwuuruwuykxgbkzbbtkikprgriinpusuiwtdnsbdpusdkugabsdygszaibkzdxnszuiygzsknaakpsswpsswyipskzbwupkgburyxydiunawpabiistyrndyyxnxdtnssungniyznwupkywsptkiabzzwwngrktwnwzuygxppgapdkssatuzpizxbtawwratuwbrguxtztzuxkrnzuuyuzapusktygrkkxysptatxbsgnwszkwkbygixwrgxypdxnykysdkpbrwzywwkaxsrzztaipwgxgzaxaprsdwzwztaiidndzpiygdybpzytpyatdgnptkixpgkritiuaaiwzxskpxxkgzwxgsritbkizkytxiysdgrritazpiayrdipnsyzgzgbpdutxbkykbbdasiapnpnkrsprgrrizwiasxsnapsprxtktinrdgwtasxurpaxddyrtgnrbntttybgyzgssgaptnsyptkypiybnxdbibdxngnrirntspdxpawbadsrydituuugtsaawxsnwwauiagukkkigxwtpxbiuygxbwiixttwnxzxsxdbnpirbxwidigynkszuwyrrwttgtkzsyzzsktwsbupapwrtaxtrrzwxgpbdgbbdgunzzkausrbanwdszawnbkawxgagrignwiknnpirngiddbwdgappnginwypntwnitwwarzsypwzptxpktzutnnstznnwrurxwduwpyyzwigxyzdgpxnzizyrnxyidawzdpgugdgtktznypxtprtpxziabdyyswzwxsgutxradygdtnswudnbgksdbnntuxdgutuyyzyaibzzgtisittxidzzkpnstknkysuiynittbgzrkazbapugiknxpysngtanpiutitykaabtpxagkuwxxurskzwxrznbdkkgrawgxkkpysurrryiwdgtbrdbdgnbwybpdpknsdubwnadsxgnbrszwtsbgrbkizzrdyrxgpipagaaruunxzsrkggxtxkxusznskkrukzstasgkbibzpgkwkzkpgiszudznwwrbuwruxxsbzaspyrpbzyturxtdkpksiywkswgbuwiukywknpxkbyukybzgpypdwtiraxtysigggyxsyappwbrkiyrgdpkdiaasybxbpppttbsingnpzndutnnakgarxbarkrxuniyzsndkzbrktyprbrrwabpikukniasuiutdaxpxrszdxpsurkypgbtpyaybwubbgxtganrtbutwsgpizurzzgszpzwuurkxgrzdrbkytptnwbdgnwnngriybsxggpnzdyparzzrgyxxrbssypstzzwgtxgtirdrdziwazkrxykdxiuknxaygraziuxzwwwpdsknabpzpsdnssupywuzagaaygudxdbwdytzsnkwdzdryanznnuzkbxrskygntdrdxintxazwypsusyyztywdbnpgdkdpkatgndugnprprapakdgrsnspguuysaaadtditiykbtrdwxiygdybbggkrwnstzwdbbakptazzsxxtyzigyztigwuyspkkdnwdgipzkzbykssgisdkppibrgspgyautzykdzrdixuaxwinyartwkxsbrzdsuwunkruxatyptxkbiagwnpbxsptyuyauzskptugipxkyirubgxtytytugdnaxkztsktuxnxrkzntxuiyrswkwxkiiwwkxibksdrizstrrdbtinzpgnraxigtupxzuukwzybbzkridkpystwwkgyzwggxrdpxpuwzwwkdwrswgrnnxnwxxaydsukuuywadgkyzsdrsixbsuagytyuuystiusnksupugztrptdgrddnzkiyndkzwxnyiaxkkkdduxdrkwawktzsggsxtruttwnniraubrbpwwpxgrdgtirdpwdspbxtrnuwxizpyniukypsbyrrpaydwzaiwuwbnsgaybuttywxndiuazguwyzpawdxsrpzkpagpaggpbrxzrxiztdxszxgkirizrydizbgsdpdixrubaddyzkxzdrnukdtxsbwgbpdgnrpbixrtuipxyxuxpyyabbygxbwgyaakxigzkkgxrbgxrsrgzbxnrgabgxdgkyuzkxixbdwppuixwsdbradwruapukzgnakdadxunigtrdwxtxuriwxdgnynnsdgbpxwxiusnssiwitxgngpggyrrkuxgtuipdiaxdaragxrdgyykdrygpnzpsnwdptiparuyutpkbzgtyrzdiwynpinbbzigaakbiuyddwnggzpiksatsykugrxiypgnkupkuwtrigkwtydbsabudykdwgkdyxuwpyripuybgbkziuparxgpawxwbixugbwikntwpsuuyiixgngbiakxdsypduixwgizziwzukzrkykipzrkxtpxrinkzrxttikuksyxgzwprzknypitbttpgxpksukbudytribiapbrrkkdtxtddawwdkbrzkydbzzupninbyywidnstbpwzwzuktdxbkpyuusydxpdngidwkpsyiwsrzdiwywizuagtitisutrzndtbzsinitpyrnprbyxsrtgwwiuxzxsxpribytsggarzpskpbrraugygdpnxsbizpnbyiwsiazuxxxxwatngixdynbdstkskixapaydswkbrrbzixknggpbysiabbsrabubxgbngkirytnwarrryrdtbszbnyydyudizugibxudbdtdbbgxnixxsrdipbgnbgdtxtnxgguyabzgnsngtnruknysitrirtsdpzszsrdxunizzzdwtygdkbbbxtxwizswxuwwgtdygatixgnrpxyituxugagzggbrawagdutapdzizndkabtbggdpkxrupibpziikktunpskyknpkkwnpasykgzydzitptdrawrgxgpwdzkgpnydrbygnyrkiwduudpwnrgipuudaygruikzgpbaripuzxyiakbbnpxxgakssaykbygurbdkxpwdkbskpkdnbukzbbkzwprutiprrzbgknrskudzbbsukiwrbywpsgasknbkbbyrydtazrsbxtpaiaatirsyadnzdkdgkrtntsdrityuwytnxbgisywndntxdzrbigixrxaagadxwziwbnipaakyyyxgipkzwdwurxkrwtipzxidyzibsyknitydptsxzkgdutzazritintrnwdikruykuxsysduwxrbadarxudkwwpzryxzgzppzaurnkdtgsurpprbkdzskytkkirggdtaisnzbxrskswparktpxtibwgwuyaykbdsinazydiraxuzunsggwgrzndiwxpdtxbdxrrpxdnrnnszszgxtatiaxrupauybknwbxzpzzzppgkpskgptrardaigxpzgtsdnzpiadrypbiarwptbkigkpznuwdaznsiapnparxgpnsrbanpuuiktyuyinbaigkutsrrsazzrkgzdpatntsnppdxwtkybgytknzptuxbsyaiuapgaidiwgndksxtpkgyaxtkirpstdgpwutgurzbtbnxybsiitisuysbkpxpuzssnstrppbwzbgyritxtadtntxuzrauwpirrskidznnxgwnbbyirswbdzkiduznytdnduxpydaxirbiuspszidyyzbtwbtpankgkzbztzygdzdrktkwxdidtsbzzsbydxxxakdynnbpsrzdznnyibgwnyndtgkwkyrngyyggrpsrgsgtwwyggxwgwyixaiapsrxyspyaidtzbztkxnwuridakuiryastzwdbnwaxtdszbbpapirtyrzxsxdwzstyyknxnyrttknpgatuwngdppdundyrgxabrbrbrunpkxbpptipuxwdbgurywrwryxkxdrxwktkssuzybigkrguzuunatbrauasupnddukgrsganitzrpruyzaiwwrxtksxibdzuykbdxssdinunuwiaawgdgxtntsbpyxikwxaknxtzzsrygykiwybgybziwynianbdptzggagzpdibzyztkpayxdxkttuwnxndyxyuiaiawbdxzwadukzgaddrixaxbgigdpxysayiwnzigstxwtzgraaxuknszptpbpxtgxausdxkwiwttnywgxnkyiuadsrxxxwbbrugditbsxpsipyagrkzxsbasszkktwdgdxypwrntisttzyyrawuriruipyatxxxstrurtpnatiyxxzparusanyaiikxtnxgibuunzkasypiubasxxdsixkzrziwpkyggknwasikpadwnuanybbwiuwsasuxbuzxnrtanuggtannywdyggsbazgwwauanpabysnnsdgwazdgbggzxgsrrtttxngnrsdasrtzpadzuwndbakuubbdxudgdtgykbirsnnsdgdxtpdgxgpbxybxydtkuwwsaznuxdunsydixbppkxsbgstuwzddrxwknirsnwpkxydnkriwtxuuyduukdustukisztadixnxkgdaysitgyawtiyuwgtarpkpbxdguttsbisadnypabzzzngxwwntiargraysazabiksikwubdirpgztudnurxdytngkdgxrkynixktsnupwdnbgnzzwukwnytpkaigdnxrstiatrtusdnuyxdsnduyaxiuadidzggtsubyxnazbnkywaugtxzswtkzkrdrywzwdaxkgauggydrwztxswdutdwgidypzddynsnitpxpauxuyuzpdadnupsrybrydgtbipyuitnwnwnpggudkrdtyrwwdiaxrbsixsitbsibpbytspxxgizkgkkbaupkauypzzsdzisngtindpkruitsuykprnwktdttwtudauiurrrtyiiixsikkiuwunaxniuygrwtgzkbrsunuwrzsbwsbnrdptbxkggbkuutrzwpdzutudguzzdnzitrydbnnzbnagsgzutxnttpxgkraaptaygyayznsnntnyiisiygirrwbawiuntpdkdkuzwzytaynyyxksrtxugspttbazuxprpwbinbntbgbdnygtrbadxyaayyaxttzpggbxztznrrktxrgpzrxxkwugrutapardktwunwwynyipdtnawakxudrbsryngyitxbawuntgsgxpiiunzpnbzarwznwbxidyuszdzrtigsbwnndrszdsdptgwiiakgdyabrwbgxbgzynkbunrprkgkynadpiwskttsuubndutnnggipbyasndwinsbiubrtgudsxzbtanwrkyzkrtrgtauwdsaupiabrgubiwigdsgkusdkuxbrgugptzyxpkztsaigzpazadtukbyptktrbkgiyuyswkpnnixzzaixubbwgrdwkiibdyugzyxzidpgaypngpaydpspnxygxsxkriukwnxzbyzgnyantxiakgbxxadwbkpgdsgrkkxsdsanrktdpaakikswrbzrbpbuawiyttxyrbrtndkppdkwzxbnrbikyywxgxxpwnyxbrsbbkznwgdkpwttwzbkpxpttwybsrynzxgtrytakbrbubgsiunpwbbbktpygaztbaikuykidykzuwwbakiwxwxdinsxtyarpdygtgaggsuzrxkiaytduxryragywddadbagnzwusgsbakzbkkruiiigzskbuxidbztkydrygtznkgssytyntbaguzapnynyiwwsdtiubayxnpgtuxxixkwxwidzykrkunpzdsadgiknibxnxziiuzrdapxsbgtnpztrzywitnibxdrwdzgknzkbssanbpxbpnkgrssakpuzgsdxwxttxkdsnswixbapuusbxunninuznnxpustaadzxppzkkbgpgzkayggnrgdbisswxidsakwtxgustppbabsdwbbbzydkzgiuixdiuytdpxayuitkbbknnkzkuruwngakzitbgyriknwnrpygnzswwaxkuauksswrysuargnapxbabadwzunkybuyaniarksnbxidrzinxdywpapzxnuzxrtbrtkxirkyszknkbgprngurkwwzzrwrkrzkxyxwbdbkzywytddppaupbbiknywzrppnxayaazxkxaigsbpupnybinnzwwxddptwxtgbkwitttzkxapdkigpwudyadbddnnntwsxbtkgkwwdsaaydtutubrbdapysnxgknbngrbaynuwtaiyxrksaprrdnznknynzswuunnbkswgdaddnzbkuxggbkttrnswpisxsinnuiakaauuxyzwxirgxwpubpzpypsuygaazpniibyrdkzaitpnrunrarznddtksdkybdyzydtsnkdadbbzdgpbnssskkyutbgadnsnzgdyrwpwprkusgundtxanbixbawpadktnkgprwykbagwzuariuwwnkxwzazbxnisgnzkpirtdruagurnwxiwgdppdaxardknnrkpgkgusaxskggatzrazniyxaiidpsyatkyyybrnrtpniznzbkrsggbxanusiydaxzrpzddsabrixystiwkbrkbibdpzsngnzipzrirgsdybyzrwpynrkrxabspgnaagdgtksstgdyrxrdggttuxuykigsunwxskkwbsgarsuipntrubxbiasntxiiinsuzysaxuksgnkisyiaykbbdbzatxksakawbxwxxuzissyyaintyziwibxxpdpsbdyzzgakbtbdwdrdurantarbtziwbysdnykksyipspwdwbgbuugigpxakudxnbwnapgxzasikdzipnxtywykpibtgktarsyiyzundsxunutszdrxnubrrpnynysnnrbxaktgbpduugyagigudrxykbuwxiayaxizntdbwwrpkssriwygggakzaaissarnsrwawbdipxwdxxiauskpxwzinnprxristugzxtkrrgwiasbsakbakbungwgwysgrdzkdwttrzrntbybyubpxuxsikdukybigagastgbixztiztgzwxryadtzyrwbwdpukpnknguwbkrgxzpxgtgigzwkxypdsuwyzwnizxpbuwbnrxypbnryiidrdkxpgwiyabbrrykdugixddnxkgrwgdspywxawnxtpnkbyrkzdtbrtabzzbdyapdgagrxgrtgkuixgsrszbspanyyaynkwkytruwzrdrrrbxykgxzdstuiiysnwianwwyngukwissdpbgpnibwbngptaagtwzztwyuuizyzundxywnaxzuswarsigprzdkbzukgpxybazsgntigssbbxapatganwttaignwkawwrkktruaypaxtrkkzdyakgnxpuryixpsabprbkbtdpgagwyanxnniknypisuxzdiuxkbruudxtgrwwutntudgbtyyapzpubxzuzbzwtsbyypkkxgysukgpguyxasadkiuwnnppxyxknxzsgsyurxdpappxnstgxtzysdyxibdytrspxypybwdbbdparaiysxwgrinwzdytttgzubpipdgnntaipxygtabtiwznydgppdxbxdaxrxgkabbubasdyayiuuptdaapzaryibbpnziyyntirsgwpygzzaastwnsiigkzzuiapkdaswzuszaiubxausbnngynzynzuxgnknanukxuztznnpxwwgipzsigatddkpissprbupxnukpuakzkiwbwnpxxpkptyspristzsdzyxbtkpuitdnskuysgibpnigxgkungkigdkxpixsuunatdywnkrxbnsnktwxxtzzsgisynbairatngagnidtnuxbzytaynrddzsnaxizzdbkwsadpydnkiyiwxydskzxxrkgwripxrraxgytwksgybyzutrkzsibuxnadpgnxtkupbtsdskabdwgwdrszdrwtzyxdtayzsrnwikburryyprzznywsytawxwuxduyggddutybnibunbdgipuaxztwanardyknttdykkktgwbsrzuawiyiuirbnxunbyxpgxrtrkttdanpiddinypriyiyzzwktdgayxinnrygibdntrpbdgpwpuzgtyggxupbuspgyaairxiiugunbkxbixrapradurttubaabwayynxgndwibgsnwgaknagbgsuwxkzxxwyznwwgukwsixuuyykgpgxanytkbkitiausbxbduxupsigbtwssugxadrpppdarksnuyuwdispybpdpazupbyizsngdaudkbnznxkxbrsdwunpwanuyspaatrwitatinppryukdnxugpbdgudtxiugakzizpbrdnxwgdygdzkddksisabnibwwausudpzxaapanrxpgddpskxuazkbgaruburzyrsrzkkddarbizgurrxspsxutbdbdkudbwzsygpgkuzdknrxaxsyyxsdtkpxgsggxddaywxbbpdsnpdxaidrkutrdtszkrygbuayxzrykndnrgawrynsxgzwddpppbyaxkudxxpsdpystsdrrspakkryuxbnsidwddgwxitgnungwsrgbpkxxdkzwsptubunzbnwyndtgaugyggwdrybnspxkrtkxrryigngydxarrwsbrbiutitztxunsspatrkbndzzsxindsnipktxzntrnpnzwiygnytpwtgasdpuzdrpawynnkbbwkzbduwpxpxiiywbitpsxpbtiparzzxtwrputzatxkytyzwgspnzysaybpadtnainzxxiztyrpysuwbksrgydpndsuzkrssyttbrauudxxwztkypdxzipbdnugwarrrrssiuzgdnwpryuuasnnrgzrgtrapgtixgdxknzrzunndkywswiiatsuwzzbbyzwsxkkisdsdztsuiitpzxnntkttianrbnaurgbbirnwirabwwiwdzwubgkzsuzyxzaggubwrzzutaupwnurkwpybiwtyaxdbtxdzxnniskbzgutidyssgnyspauiaykxpnpuszyrkpykazuibxbxksyswadttknbpudpzwikgkauppuxdrzbaaudgwaayzkyswggaxstizsbrisxkziknupgxkipwxdgxttzugwnpnrrginptgytnuawstyxkaxaigrwawxwwsxzssardgzybzsxpuyirppnwswsauwsgrsnsdsbwzngkpzpprkukdzgpwnntxtzwguxiaagrpisiiistddgxdksktpiyikxrugirbkxnwpyxipgzpktynspikxbwyzgnzbwppsapxbibsrknszdtywynwtziyrdnzniabutstbtygpazrytatxwtayxpbyrsuaxgauxzirbnakgudigbuwgazpwirgpyidkbgsrnsiprdbyssauwztgrupuuinzkssyssnuzupykrubswgibrntggxtxipyytnpukbputakudgxwuwxanztapsssspntptapitusiaxwbtbaptpsprdzrwrzbinpbityrbptukipgzxpyabxxydbkirzyayppkgzapuwybwxtdbadutupgtiygrszuztsuxtwurbxgiwkgywgxkgknutgsrykgpyprrzwxwrrwwnkggszkzkrpigkisxytrkdudzbxsdatktsbasrgtdznkxdnsnwzdysixrtwzxizysbxkuxpkstiytxyttydgswirwprwuitpbxpgaydatsaasgwwrkixputgurgdubuaixaspwgunxtttkbxazizppnzgyxaxsgtddppzktpuigwyiuzdydsszrunrindybisuwxuupguaspgzwbybywxgapgntkszkyurzwryuznbysupggkrrnigzgtrywdxzrntbgrwkutkdiktbknibswaizwzbuxpagxzbdtpkrsygpdtkrbirkpsawrtbduxpxxszsyywkduggbnzuprxrkybsysaduzisrrusibrdkwbpdyzypabiizspyxxtxxpiwtnbxbuzddxgkgkdbxgrnxpisirtbrbzwbzbrwixtwpptidkkygitpudyaddrzbukwnskiiuwtagdbksggbsaxnaxatdbdppsuutisssrwprwtyywwykszpynkauwbginzzgnskpygwkraydztrtiyyxtxiwsxnaznbitnrnzxatpdipwwbrbsuuptpnskzxbdbxazaktwbppaawidsxaaztzwrpusytygazrizizabxttdbnwyubirtdbpbztgripwsgnigzpauabtndudbkgrsyuigknzknapuaizgrgwbpgswryizuzzsksaxyzbgbxakzyagwgpabdydrkikipusnusarksbpyrrbirgupanxysrgagiywysbbdunnpzngxginnigapkukuzrazuuwptpwrykiwybxbntktinxwwusdkpitttsnupuwsnypxkugbdaikgyawysawbwidudwwbyzxtirwixikxpkntgdggnkikrudzrrxkkaranzuwidbsuwruxdgtyzugsbtistyibawskxuazzkrussptbwigaguyktwpdaxbxsgabuxytbspxuxwxwzipuxppdpbbdaksxapuukbinxznxxgrkxbigtirggrkkxxgtzuuunrugdgnapxdnyurubnpwdtapktuzbtdwgibrtiwdwwszabbiduixgsdtnudxinzxsikkibskuzzakgbxynzpnisxdapdtydytrrubturingtwbrniirswwpasttadguzibrsaaiwrdkwkwiainagizuispunxiubtxpzadiakdknbgpsyxnkyzkpisuisbadsyixiasgxnirynagdrtztunuszsurtxkgiaistkraybgykzybrxdsixartktszzpnxtgbapwwuwnabirtuyxsrtidrzbwbrskubtugzbgunbkragxgxawsxsnuradznwxxrspdxniaxkwwdyuztwdnpyigzrtswzagwbkxduztgakxtsgakasangwyipizpgwxzbnkxaippiassikizwgkxszypzadsniwzsssynistaxdyabxpazpszwdrazbatkzzsyskwyzukxpswptywxkukgtrrawyybnwdkkgddstdzstrrwdbyaiuinnsgiggndrgzyprarppgnbkgbkybngbapgdrpxppddwudbzsuditazdrungnssrkwxgapywbntxsgdnwdwsdngyrskbxrizkknxtikbnyapsbrxsxipxrxwdwgpninpadxznwgnitkswtkibxtxupysndykduyyiigsibnwyurgbarwdazutdkpixruazwngtnukdadbaskrddiyrbbwsdkwwbsbzbywirnpzarzsradabwkkdaawkgzzpagwwnzdrrxrpynpndxupikkbpnwybwpwzrixzxkniiygksrdyubgxatznypyaggznzsipkwgpyanwkywbuinnkguysaizkganrtbappydsyzgwsixyizziakxniaybpaxirktgppnpsztwpuadzxrxdxkkigypayxbbzgttydrzidrtaxspgdbrgkpbuypxtndpaxudiptdatxbgbduywzdryuttybyinitnpnyrgzbddxwiyyuanpauyaaayngwzrrgbuztrnxutnwidurrbtgwpsbuykxgazgnwugtkaksguzdauanunswsgzxzyursrszpiwstusyuspykyktnxisdaskadxuugxzdrskrsssidgrgdpkbyikizzgbagxibwkxpuayskuyiibrsinxtpzyadrgryxnbrbrzbtwwydpdsrpbyxrzzraibditxubgzgidtbdagabsdxxxitizuztswgnnapgpiwazspbpiiuuzawtnyatugxbgurxpbyyitxpuupabznnaddtkrxyaprupruygtbnbzsrdynuuzaxndbwarsxsrurpwysgbwbsunixyysbnuxaasapznnnrnpgnbzpnazzwgtwxxsggnrywrntugspntrunizztuyaiatztkudnbwbpazsybnxdnuawpswwzaydykpkkzwaxwpaatkpyynwtaasuxwwwirnutgzxngaskdpspxpwaikprxwzudtatybssgpyzpnksdxsnbxuwpwudpkgiupxgadrdpxptndbnkadrdrsgxbrywkrprbdyzsnnabrpdkyzxdgwzurgrkyxyuwittzutnkgxibptyubsdxdrgnypnuxwpbwadktbtiuykgsyxrysbytxdngtnbapsnyupduiggyiixxydkiyxrkypkgdkznxbwtsurziggtxbzguygnnrtdwdkwybkxaadawxpkatgbuxswiabbgbkbngkaywgpzkragxxyrngdxnupsrzpispgwukzdktgtayuzwwrwsgyizniunxntydnzskpuwsbddiayrgkxdggyksgruwbidkwyxntpbabntuzdgditbigxskkdntkdibisppprkzinrdstxtkgpkxawrrrptiikizarryyppsdwsxpissrgpbrxiyuyswtgaugzszpppaunbuptbztkraixrptwrakaitgwuuknztaprgwydprxtsgtibkarxiubuzaxbpdanbyakkatbdwwwrnsywtrkpkkzpszbxxriyusdgbuxraysaanxztsnzwdiwsbwrpsirzbsiaiwuwbbxsuzzbsgudpwxziapydnxrtttxkxtxgdyzrduytstnkptwpztiiuzrgniryakinygiyrgbutzstggytrbrydyzwwdbanwdtkwpuaptxiptrdrpxwwtzurukwkstyanxktrburtytirygtpbswttpzyznwzwrabbawrapkaasknxnrwkbaswidpsupgpiwbkkdnnnywdgtbgugrsisnpidngsnntgirskwdkpiyiniudgstyakbtpxwydtpkgskyyuwwtkppkbdsxwddpnukukprndnrntrgdykwagntxgsssuaprudrdssggyggwpdrakwgryuxatxapnkwgiriusdzuyzpgadxrbbgdinawiaaryadrdxrnnatxgrgxnrduaiuypriigbrubbprizigzknswapsrirrinuxnzrknasabrxdtargiadaspipnnyzwkiybywbxxbpyngnizkkkbyatusraziasgkbrdanrsdbnttkdwtsgrtuaynupyuwsaynwxkprguxuiaxkppawnpbtzuatidbytzywxtbwuxuwkpawbxrgtiaryrpszsbpgsrriznibnusuyxrstgkibttwybibawkttibdiibnrygrnkpzabgkzybpwwwsranaidkktydsdgruxnuizaywwwwbdtapzzwgpgnzzbptkttkkdgnkdkstkutbuawprpkbngzkzaszisiyszpinswspyarxwpawkkiuxnwnxpdzgtnsanuwrkpinkpdkrrsrgzdgddszgxxtpzikitiiknwbrystzbbzadwkkskkxbxxspsyabzwukxdsxduxtgtuypgyawzkwawdbrutbwapisnskyragzsidnxyrwywairbtbwdsubtgzypkwdtxnxuynigzrabwuznikdrsxydgzugxwruppkbdrpzpxpiaigbygwxbbpbgtwxyytbbdbkzxnbzxgkxaigruuadpwpgydkpdryupbpgibtpndkdyaudyxbuzydixuwrsgbkpnpbysraungzxssxtibwswiipsbbdttaaznnsxxssyziayxrbzynnnwktuidyxtukwdgpxrddtsdizrgdytpkwtprdnwuwangxyspttuktdruxsyydibnzzrawnyurwdugpptdbkdzsnipatitxgtxstduirxayyyxyyypzzsrywzxyngniyzrtwzyaubiptuuiwksgsukbuwzbdynsbpadyknukrkkngyrgynygppgdwxuydtwudgzanbgrabtgiiudsayyxxgbyruubgxzygggdbtiutnzazuspnksxpbrdzdrtaxtxzxnpkapszpwnytsprdirkyrrdykxduyyrxspyggrbztndpbsnnzxprabdbdtpptbwixbtkptyxpbsgbxbzuwybawytadbdynxabkukgyrbknkwsirznksrrsntyizttytgiiagriywgknitxukgsrysrtawabbzrgwswsaixbxbyttdrubzpwbdttwuprnwiswxzptsrziadgygkniuzgggypyspgtbguddxsgpktbzzabxkyxrbzgwianrddwygsypizuwibkyrbdypdwkyadyxkkppkuingawnsatnkyxtnbrugbgkiyrpptppwtdwtrbdriasizwnaytbaxanxstikknbrnrgxpprunyzakwxytitszybtdigznnirbpxwwxsdnkrrbwyaipkypwputpkkyngxtxsppggxkgdxiwtnwddzkupbzdrpwpukbwpystrxdtzxxxzbdkbxtsbtgkynapydnirdbbrbxtytwyzapagpkrkrkanbtrugtgtdzrbsnbzgdzsgsinxnpitnibrusdrwuzzgzkkxbgsyaxttaxzxnxbiaxwdugdwunpxngngsstadwntikyunawbiwwzwzaugawyyuupsbrrgknpazsznxuwaxrgykdpgwxknyisdudpkrtgiwasnkynkbawakrdwttdytbtdpswrkgxbuisnpkydpkwgadwxtinpbgsunuptxznnxgapgbgpykdnibgnwtzzgsnxptrxyawiazxrsbrisdzrgispbwzrygbnukzaukbsnrastkttkwdwwwxbrtnbibtraxxgbzipywstkyuribtzapzgbkduiiddrabpbwkxsxswttsykgtgypzxxwkkytridawuwykuktzysupwrbzpkuyatzyzgnxzywwzbigdiguagbdgxuuurguttyxsbkzbxkggbzzbkrxdptwdkdxzianxxtggtsawxsaptysrstnkkriszikiuaarbbyyyazzbtgwyadpyrkpxttruggswnpwrnasuwwunpxbwrszndttaayaszrypzxrbnsigxrzxbxnigyyaskyxubatnggwwduwdpakbbupngwpgbpwupbisdrxtiswyirsuwubtszgrzdipgputzkkwbrdtuznikwsapprpaubndruzdzwkxsbiybsnsktyisudrgrsiadbtywubazxbypztdgzxusxbyzzaagypxkrskrwxsibwdpziuzgpdbawunsxxsrrdttzuxbpuwbwpbgwwxirsipnazzbtrnpabttdytainxiwnudnydyabdyysbupdsknukwtrppndkbdkpprauupsdiipawinzbinxibwsxaatkpyrtdkbyzuksdnugditutiadsuzadbuyxbxuiwgrpnyurrdaaxsgrkbpbisdxirygzntznbrzxtwpwkgyzxszpxdsrrdasbkspirdbwxpxtwydkwxwiyywngdktauapbasnixzdtarzsxubwuiabkgttuxbxytsipkwyaznwsxrkkksdtkadkwwrizwrtkpxywnnwdkkdwkzidxytbidxrsuxuwbxidxkxixanaiwkppwbybspxaxngkndzrsirdxrpdwxrsksxxxgttsptwknsnagpyypuykxykapwizppdkpgssdunkruwtygdtuuaxxsnxdwnszkknxsysnayywssigiizdnskpsndasyidrnzktssktkzgiwzgsiwwypyuwizzdwyyynazrutzrtrwuktxbgbpdwnsiaidpasksgswdgudtxtrykkbzazkdpadbtdnruinszuusbwaazikxuazaukkysskbgrxkwadwskwunyruznkspwpnigrpaddntnnzguridpatazttxapbsptawswwywszzwbkbprasbkkbbpxsdukdgpybrgxdnuwguypigdayixwsixiixdkaazakzwuxbpxibynyankbzrannyawaudkwapryrixuxgibabyxkyddiatstagunubswdrkktinxxdrirksyudygwiwziszgadndbpikwbbruzrtubpbwabiiizzwwudbtgdiiwpukxxyszgtiiydwxpsudssyyizrbxwawunyrwkdaynydnupbwtpnxtyurswzdrskdxyikasruyxarszyipttwzwzyzpxbrbkuaiaszzstdgyiwngyaiyirswpbrutxpynzbwpddbwgzwuduztkggpngbdazsykuzgugsztigaabuuxzkspspkpwyzuwrwdyrggwnbniwnsstnwbdtkkwwyiiydapigztkpugyngyzyrsuzbrxapdyrsbaktnnsyispaakuzpszxrupzndnzptpxpgktnddunziwyngttnxrrkguwssyxasznsbansaparxywbagikpsrsgntgrggbazwdswntdbggdntpduppybrppzbzgysuwyuwxznnssxaiirppabtazrzanaxuazauudsyrpugzazbspbbikazgsdwwpyzrnaznbrurpudiwbuinkznartytzxzpaznxspzssixrknnzkdkkibpggbyungbykutixinrxsstsxruuiwixrnzzkkwpwbywiiwuiwaguuurspzggtiaddgyidygtannskggsabusgxbsiuyyygxbyaaanaswxpdtwunddskgdzixaatkrgkipigszdsdrzapsidagtbspbbktxsrripwzbsxziixbaabxwsbdgawdisdgdurzigrinbynprwrtdnpkupzibugpugszyiwksrsiuudtpzyupspynbtyknttprykiwzntwuspikxandkypxpwaiztxrxxbbgwbrrkiwpntybidippbsawdusdbwaxzdspbrstbuxpuxidbibgrwtnsbwwbpirbdpgyyusdrwtsdrtkggaukiuinnrxprxpaxdptxgpgdziywwyayauiysgrspkywxbwwgxwapbxbptabrtubgntsdpsirtubnangpzkdkykrbxrkzukwpykinzrpuuyntgzgwxikxaurxwntaawzydpygukgarrurtntipsrapzzupuzusdupdatuubnpbraanutyxiuxbdzwznkappzdzykxatdbpyngkydtanziagpzdptassuzrgbssdpxstuasadszygkgdridzatztazxyxansgupxbpbauttwpbtzauzwnysswbyzsapxrwbkrryywxbaupnubkpaxxrnbkwpkuxakzriyiytkdkuapkktbwtgktbywnidbpbtiutktgintkwkbsxwzxutrbuikwrzakaputkwtxxaibgtnbgkatbdkxgdaygwtpyxkkpgitibatazkyrpdiysxwspxxgtyytuaxzurwtwyyikyzubptbbzaynwptrwsibybxgpdxyzzxtbiwiywururawyypnkrwazbduawzrdxybzxuyrtubbibuddtipudpbyxgitzupnipptsbgiasbkbdrbgdigpnnnyubxynywbyswkwbuxdwtybbxgbwztxxukisittrygikdzabyzubgtruksaxzuwnwgxuzkkiwxuwwpuixriaairrtkzsguidtnnpyysdnwgxuyzsspxsdwartrzzwsiagaaydkkdxbtryguzbwpxpdaspbyzrkwasbtztuskaxdxinaskpbubpsxaayttzxdupitnznszztxapwiksugatsgkkyyzrnptiyznbuburgpzpbdbbkndudupazxsypxipszubrtdnuugkydtzadsugkkdapnganuagsiaxknuisubiizgusirxdztbtrpbdyayxbxugnnxdpwbraynugiybkrdrzruzyntugraggrnkripzyzbnpzrdrxgasrxzsdkirbynwzadwukrrnxwzpunprkdrnpbbibndsktbxtskawgyiswuykudrpzudtkkxxgaygbdbiugitaapknugrgsaskgxkwnwsugdttzwypikbaybbtangywxwnykrkdbnwsksnswsxtkadsbysrpntwbydywgauwdrikagzgixigrnarudkpbsrubpddnxaxaygiagbazrdapwgkrkpkktbuipukdwdkxypbrkzitxitzkgpndwbbxkdrbppnyzgtszxrstxnwugzazbgtnwkgnywkrpddsrrytnaabxdkntrxpabwiibtgbaixkpszdnxuybsigyskarwunzrnuniwuiwpdibdginzitiiatpsgbywdyzxbgadtrzixswatgtrrubzdpzbkddriwzrirziaxxnnnsupdrkuibpugbxkurbwutpnnadwdiwxurdubanwkgwtbyxixbputatnugwypnndstnkaduuzpwaykbapuratzdisrgpxdknzxkkazkrbxsuuntusrnussxazznkdrrrxgbuzkgiwndxsbpigpawsxxuysktrszriwspznkyybpkpprwnsnisudikkakygtpdnytadunsyrgnpydbwsdtgtuggrpkrtisgygapnwwxnribpkidpntnpbuiuzwryzsdugbpkbpzaggkkrztdbugritnwxgbnragirdbrgugnidirrgktbxtxndurbtkdzaptigkakpssudxypzdxryupndgaubggkrxunkiuiubpsbasggaxkapkktwkwsursrksynxubpwdxbxrzzdssbxpdtrngbybwbzgxsazxwrspbkurikbdixxxgniastywbwtduxrprrxpbpdabundnrrninxidbauttwxxkiaxsxydgynngnsswnxxrgytgnrwuuyapknuwsugsytgxgkwusgzxkygyagkzpnggtuadbyitdwssxrzkbprigixiyxpiygnsiyytkpkkuxprdbdrwstxyanibibwdpttdaiknpptrwxsiannwtiskgayrtgnbdyigzdbgxssssuwdktyarpprwtggzydyddstxsawsugyidbwbyarkbnpuibdbabnsnsisrbbuxppybsggdwkaisgbytndudunudggzkgiakknrgkupgntaxuwsyxbzkusznnwytbggxpwpziswiudgizyiutyttsgiixgndurnaxazxaybzirzxzpzgttybdgtwrrnwdgsxrgzypsnibwgrwkukzgturszzruysikxinipbutwigyznitnbpwypskkwwxypgxaksgpnuddyszgkskdridunrrugixnrzuibbaaypzrdiyapunzrnnzndabiaupunzspwwbpagybdukuryuguswsszrabpaattxpwntgkxkskndddursktdywkynnddrtudbayubnywwwapurzkrgszkuannztudndpnrikdgigtprknutddnpkzndxaxbxyyzxkkspiwbubpyugstznwggtytikyppwggdykwbsdkdgugsdibxipxssdrwgitsxixrbtxgaiytzgnaiuyuxnkrsdxiwywiabxyzgwytdydkznyrybsztuyuyrwaxwpkugipbtbkxiukznkyyurwbaxapskxzudwaausgnwgiagaigipttnixgipwayknpkndddksazipdwkxzwbdakkxiiaxyppbdbdawswgrunnukiuswynwkbdiwwtdagbuiauuaxbzzubtzywbgypziptdwtiwstidbadbrriiubszrbdpizirippyittwguwrkgkwaxupzuxtdzwwwgxpidrriwwdxnswbpizrxnswnxwwptzxsdwinxbxbtzrusynzzpapnrbitiptxanbgpikppypkdduyygrpksusnyigdbniapubskzkwpawwxkpxsiutdsbdgnrpwxzxarubndpaswzursitnbukudyxbtsbpzysdpdzpaxbgsybgpkkwbppikykpbndgtbiwriisrrbkstxzauytiayydgwktaszaswywgzttpzzudztdknarkwpswbuknptakgsdyawptubznrnzguzznadusktdrtptnrutkpzxbnwnnpgpkanriuwpunbdpigytunisibyxyzzgwzrwdkixunxanaidiaxgwsasritxkttwpwipdwbgdbxtiprsuxnawkzkdpzbuypbrstnbwbnzwrsbpywrtsbtraxdtzsytndanusyggigrxuuzpwupppnigdsxsnayrayikbtgrzwgwdizdpikybbssgkbxpatwtgdtxgwynwzkxupzzggazskaarkwwyygaxasxuwpsduswbrzisbwbattsdsikuuudyyddbkdrzrpzibaikzgpnpnzbypgnanbkwntnnzibizpndibpygdswkapgkkzxgwduiprzzwtbbgnuttzxybusnzgrwungdgntwrsbbasyygkxgzywikuzsskxykubinatyyrukbzukrbpxbgugwsxyzydtizprnasupkxuxtsnbwstyyuxrkgkdwranbkydnsbkbpinwpbyngsrzubrabzbbybybuntgsdrutzuikpzxnuzpuzwsruxxiusatayksyygkwxggpigbybkupkapsiyuasxbxzytgssruupdbyniiaswtdnytrnbawrawwytgrygxkdbkwszxuixpgsywrirskbrxkguxubnbugaiysgpdiyyrukbirzxbsrbtzxddddpxtzxkryinuzabwksxdpubyapwbyaybnzwrzazkggkrbuztxddgzgndaztsasyzgtpwzxyazibwgbbpyygtpnzkrsirdwdtppynzkdsiptnkbrdpwapzdxksntxistiinbnzpsbaxykrwdupwtupsyidixrpbpxspbxagkpnkzwtabdbyakauibgkwstgrgnuxtaskugzwrxzirdgdksnywxspbxzxrwakxbtsxsukuasuwwtaudwxnyyyyaknutrtngkbyntuiiwpyygupwwzxrnddgnixagtnityxxuxgptpzrzbtknnguadxpanwyzpwnsztuyuruduxtxigzubrkwyxukwtkybrrgikdgkizigtkxidstbtruniakpngzntupyzauuniazkrzzrigiugwubiykatgrgxkwprkyyrpazggpiznwtnzwisdrstrndaxyxpbxwxrkpptuntgrpdisyyazabaapgaibzzrbdgzxdgwykusgkwgygsukbtndpxyiyaawrswbnyrwaxxxbkrisutrspsitixkngixyrygdwbbwsnknbtayrytskrwykaiprikgdiipunwragudargizntdngtdbpbzaadtnyggxpxibizpaguuagrgsuynpgxasrnakxardkkbwtdigsubwiiwyysupdpskxapxawnrzdxbigsrwardrzxnytabnzugybyapkubkntaddpzuuzddppatbknzkiiupkydxswpbptiawspxnwzzswgytkutnnkiwkbgzsnbkyuwtkykybbigtrdaywxauuripkrxrbrgwnnbgdinzppkuswnbbygdxbwgxugtrkbkkyzgdryrbszynwwztxxwubisswdyurzrrinkzgnwzsdgzddpruarkpwstusitdxkasktpiysdrxtkzssspukwgkizrrxnbwwwwwbwupbsibipdzkzbznzkysrizpypuxwywtxsagizwakupwsttryyprkyzigitsaxgnuxtagrayztyxrayxtxadpnpigntzsugiipgnpzwynakruktiddtkwxpkazsznpwitpxpzkabsuxxdrzxnxigpbassystpbwnwxpdusxnrykxxturnzyukiazygtzwtkuutbpwudxinypwsandprypkspaytynanbkxwpauznuknuapxnukguyktbyaupikztwpnbstidzszsrggratybsgiyrrwtnsanznbknpdzakrdiyawdisgrynxynxrwttgzwxgrdpawndkknngzkiywszybuyaptwgtrrwxundkxudsxiwswaiibddanadkrnkdtiypgwntuksddupztwiarwrupdzsissngawkstxuzzuansibxryaxzadyinaziapdwgrxbnrtspbpaiapkdkattnuppurpsgpsizzaddtixppzntrbbxbxnkzsduzdiwdnasarzrbzxbkptbyytubrkbswpzikbbignsypztytrzdnakuuxwzwntsaprpbbguapwuzbsdkxdwysiysubursyagbiskdasxbipzngubwrkyiapndunwzzxpkksbntyunaapwtuxkgwpbrniisysnwzuitpnxarskarrkxbssddpbwwdaukxanszxiigkgsryiybaxykpnkadxrbpdutxurgabzrabandxgdxsadzypbnstzrxyzuxyrxgrkxwxkatkuxbszbtruwddydwaxwutxisztwgbirunxzkrwytnwkrbxrzadzkwdniirypugtakngkyskygnzsnxppyaiwkrddrydpugptdrsdspnpxrwpbwbdtpuzgxrktwrdbdxrygduuibipgubgwkdkkkyrgswugauydztrkxagdpkykxptxgpywbsitirsdtzagtbaatbdbpuiabtrxuzkuzbkaspnspasgzungsznzbkrgnrwyywudakxprubrnwsiztuyusbykdtzzgpyuxybdkuybgtzrnyksxydzzdxiktdsupaddaspbzkkzdzuutnykzykdtxxusynyybiwbszttwgappbxwrwaydxapwanndkywgztzbrytiukupstitkawyruuwxkbzntzkkwwbizbwyyyagkgwripgkgkwkrtgsdspkdptdxyiuuybaurykxdainkxpadazpssaxaudndxdxxtyygaxttkknwxgurkprzwkupikwwkggtuzxigztadsdsysuwgbkuzgyxnsywyyxkigrwnuakpytwztayrxyydxnbzaxdriuznrzstbsrkpykakrznwgpkabgbspybiynaagyxdptubzkdtkywxknsybiukybuykxdtgrbwsstxwuisnutaguxnkdygbtkgabxnzrkdzpawkpngunbkxpbrxzsgaszdzgzkpzsbsgzxusrpiaaxiskituukwzsugitnwwytrxnbwdukdrpppbtuuipsiuiyugysxadyunkntbyxiyngnazwawtarxzupasytspwdxxyinbatdydbiipsdnsrktgpwxngsxkxdxrubixkkydrzsxpntikgnkwnszszdpxkkkygriinnkwazwrrndxrdbkyxuuuribpkgwuukpkntwrknystbggxrdittsyyuspyirsabydzdrkutsrpgiitsgrytgpiwkkypzxipsyaubsdspkwrbwnisuuxtnurnbpxgrrpsrspngrdtbsyusgsdwbdxudyuwsigsxbxatkpizibtzpbxarbuyswnsyikdyzadnkniniundwdwdirxdgsigprardwitpxrkdunrxpyswrdzdrunskdzzapxgbyrwbxydyaxgukuaxayxzriizrxgzzuskbsxugbpzdkkixprapaiwnxgppxggpkgnuwtuszbzxygikxibkipziapyxzzyzrdnybibapywatytyxkawtpsgxydwirzrkiksrsynsarupknnrsxwggrditkiuxnbxubwdubxkndyrrrzxdsgyuybktpgkyitzpwryttiwauttpbrwaggtzuabznuaurgwnkwwisuxybyzgadnbuutaxzppiuykdxdtxrwuzgrbntntkuspduuxnzpiagyudngddwzyuuxrsyzyakpbngznkzdktiaxsayynsixxgxguutzdazzsikutzpugwkukugyrxurkupgtaruttddtxxxnanisxunrkggrtiaiiuprxrirkzstyrtpazdypkxdaxwpaairxszidtsxznirpiizbdidraabubsixxiinduzaytpupgisguxdaugdxzpnztzgybkzkupnkrrndpygixdirkgixugdrarbasxsdayiybzdrynkrwxntibyzgkyutapkytgssgtspxyrtxaypyrppxbgpytrrnnuzzxunpsntbtduddnzktyyrutpxnzttxixspprranrtnnzkxaddwztbygiddabwwapsdxxrzrgugkrpawdnzttrtyxxzwwxgxwawxpnnwtbayknwuyadzyxxudzwduugxzxrrngngxyxbniawnakznasugnsgzrtzxbgxrxyuxbtzwauzupssgdxwbipxniuirtywznynrtrnnuakwiwxidsauskddxgtzttktyngasnriiwwspawsaxpbggbdkggdanssgpgkziintbndaikdxtzgibtpuwybxgpxpaikuduxaygrzsrarztduayzaxwxzzzirbrdxbwpggbtkykdbwpxrywwdpukrwbastyukapnkadrbgwrrdniwxiygrxspsyapwpaizwtknkdgrydyarpnxngddbtxpkkinbdsyubgitswxtbbnwpnwgxzipnrinyzryziykxztbutgaigidgwwttuyaztdburdysnysxtsutzsbuittuswuxkbukdapwzkzaxypbgzpnuzwndsizuwngxwrnbypbkagduzzttykxwnbnzabakxuygzpikxbusgsbzzdpaknbiwattzaxiyuxrtsyawksuybwtazrgksbdgsdgpdnszkauyxibuiuudugtbnxkwyynuxyupkwkatpwsgnstxdtyrpbgrpnwknbduzazuxpbrguxukntawpdppzigiikyubtggizguagbgstnattxudyrgdnsnbktwrdnxppxkykipiygpitkzuguuwrsxwyrsntgtprtwgpbzzuduktpngabzwuipkzrgsdtunbsyytswpagtuugdsksadxsnwrusguubgdtxzxuxxxpnrwsdxdgxyarsdszuginuywxrpapddgxyuxtnzrznbgbangnssxwtrydakgxwkbkgiykzanywtpiwrkaikpwwartgspysppziiatuzwzystdwszutrangntiggtsunkwatbswwtdwyytapbsybtuytiazgyybiwttnggdpbpntgwriwsxaktywpzrtgxwauuzrnpubazwwprkazurnzgbxdawppntudzbbrksspsziwzkstzadtnswkgxuwtxgbizauxuznkygaatbyniikgksbrtibritrwskyabgyispnuipszkwaunkkaiinbazrnzadxunxibdubbuxtbtuxtzbsstwgadagddkitpnpkgbagxsrtzpsgpkkundagibbbtskxnnwkuptsyypztgaaxbissrpwisdwrxbigzibrxygxusauzbdbniidyrrdtkiwbpazzxswgxdtzyygwwpigptbiisyguppnpasssyptnknxirbrbbkrwxnutysidprubibtpzpbswzdxykkazkngwddtpdywizanwrirxyrnpparazgtbduxrgsiisarwwkkrwkunuzxpynkzzayrysszubsnytnbauyszazwypztdiitnywgrapgtsrwdwpdtbbyadpypzudktnbgwkdaypgybbngptztpzpaxawppbznstintrkpktassiigszraxpkxzwpxzbzkaaiarkxuiyrtdbpdinyxisnsutxsrwidzszzpwsyukxbtsyyraaaukwgytaubbxypipknxsauzyzgussgwysdwpwtwaitatrnbwdksxzdtwgxrsdptsrsxkdxbuggtwayawikznxdrkxnywtgtzybrrptrgrxxdpybsxizgsuruxazizrxdtrxztybpipuwupkdwitigutxittagidbwbxtwtwpkbitypurbkzswizwaizbkssxispsuztixunwzagsxkyggknngzzkkndkgbuxswtwunggzdypynpbryzxxtsyiuyrrtskkdwbabtyxutbnptguatawkxubswsggdbazagtwuysxspkrrswspadauxwzwkixkdrkpaurnbgputssaiwupwyuigkxyywndpzgatdgwsusysiudgtnsgappwxgggsasaituaazwkdgiikxznnryrsgiugdsiytuxrrrdiunkpnwuwznxbgirrzuxprgbrkpyszrbyrtttbnzsdpstnxkxwxispyuszxisytuyisgwidzxkdrbbrxrsrztzubztxyrnydibdauzbupppxnkkgtnyyryugxkrwikknbykbsgdgpupksakibgzbnnxdaaxzzxxkiwgnkzkryybduindabssbndwswwkpxrbxstaagurudkdubtuiyyktyrgsrkaznkswpwysadkynipskbdywxkdzbpzisainkxdksbaiwzptxbndsizunsrrwnwapgrznyyizpkbsinzaybpignstdxstdyxzutatuagadrnpnwgxatibxgrrzzdstptbpttairbubtirirrinbtakppaaaiuynpyprusspbaittuztxnbppdrbndkzxzywikukkitwazwrpakggdztxnrbnzzxanupdniaparpasrkyrrdsrdwuwipnnxrtyisabbsdadsaxrzwbppzssxdiwinpzdwssbypdaibraauwrgxddkikubzapndntpnuawprnzkuyagizdutgusirrubanraatkriubdtdutdbnbkswyudrrgptyzppzknpdzskawygkxdgdsrzyssbawywpirbdrsuraridwbxwygtrtaitxakxiyzwasntskburrxruxtziiwbuaugrrgxsnkyduikrsstkpagrbszdnpzsriprzudxnxwuxxknkiispxdgytukrxbnsaszpyuazpnszatdtbwgpkkwdxgztypbbynxzuraaiwybxdwpazirpxizgrzwrdtdyzardtzsgzsikziwbztrgrtiuskzxbbubktbgawtiytnpauskupssrydknbdwipxkpttytpgpsdsgkzzugtttxapbzikkuunwnagirbkwaaxsydwgpiukkbkaixrrnxrnaxwiusziiiatwidxrgxtdaubnwwnnygbpznydzbyiyikygbtkszsgxtiibaytwkztragxgwuayrtibprykbgrratyxiagsazsrtdwkzsrkwsyxntipgpddzbkzrwzkgbkxkuanttxdbgxrxxkankztnurpxgayykxszyrkxxynnnaawdgzsxbanppndiknbwbutuidrduzuippityiwapixndtpzywxkbgkgiywtizaxdwiiizzxdpxntkxkwabaybbksrrgtkkzdzwbpbgibrksxndiydxypnxbdawawbuwnbwznspkipnyxyryigbywbsrznsytibgybkabpubukyntuygydyzxdksauyyixpiuzngruzpnazzdzkbwzgiutbinxubuwyauuzswnipntruptutzuatirysayanybknanaawprbtdttrtdxningtwuryyxxxxwnszstryyndsgtkbstdwgyxnrdaugprygapnunbugkzxkxzybbbgsuunnnppbganukrukkkzryaazbibrgkppunxgibbpbikdiyzrknsybibbsntazxtywxtbxbsnbistxsadrgsizybwdktrksuxabxaaiaxiaigapbkxxzupuyzyzabkttgnapyxwiwrskuytzaigwbsxttwnwtazpgzwnxippgzywikbugyizrkgixwsydkrgttiwwkpsdsztxpwnztgrzwxxsyrpwikxtprsubwrtiwyniuzgrxppxwgxginkynkdnsutpintdnratzpzrixyryrstuuzbwwdpnitpbdddwrtupwgupsnxkuxgzpsznatuzgtddwgiyzingaaanuyxbxtyargrkgubirtprkuswuywgdipbgnpawzwwaxtpkisniunbwwapyrurdbasdzuitwwkyrpyikiikuzzbnsyrgkbbpwxprswnbytggysdzayxwdbipibpysyyitxdbdrbzduxyzryaziwyarkbbaxspzstttgtkrskssystwrtbpazrdkgbwskakdrwduidxagddnkagawikubtbgxgiubgztzbpsysnnsxrgbaapptawgpizarrixaxaxpsxrugsruupxtawsdrgkywttyrgspaiibnpdpkuztsbsziziwubpzpgxpkrnsnngwarxxutywibnxxbrruittptsdygdibpttnyrxkskaupgntagppyxzuzwzgkztantsrwgrgkkpyiasuyprayazggrzkxxuigdunzyxkaxzypxpbuguikisaiwbdutkuydabstwwsxttauyukpbkdpxbirkwzrtprtnrrkkpakpdzsasygsdkuwngxudsnspzuzuzbsnknpnkpxukrguyakzzsgktigwkgtuuyptszrnbkgdtkzbxirxtyygbgnktirnxtzbuawggiiwxtxggskzgwuyzdibwypynpbxusgwwgzwzpybzywktbtkdbwgxzsdkiyysuubtdizzxbubgyzazwswayrwsxgudkdnkngzdgnxundtrtygkarwzudtuianznubpgbtbxdtbyisyabkgnidzdakkwrrxbrtbduwbbdiapiyibrntywzzgdzrpyaupsbigbgbznxngzstwgirsbdzyrpgizztpypzpgbdrzikbntbbgbzkbuaigxngxgrbrudxdndtwtwdtdpapwziytbgddbkpypknxxkxagpxywktayszknnpzdxkkksxznirxbzibiydaitpinxuxnsxugdwnazzpkxzwxwrrnawagbzzxuwgyzyxkarkkpyikatsburkpusywtizkgbpypwnnsrgbdsrkxsixwirsbuuwnknxntsnbnirwwzkzadkkwxdzwduddnkidikgpspyxsutksdyigkpgkzkadywwzniwpxtsraxzixbbbpzgsngzuixbrabupzpdbnuykbyykagdrkgznpszzbpyigaywauibznsaubsxgzpwtsrsrtgbpgpppskatddprwptxpbunkbarbwgskwdkdxatwbdwwxidwtdpyiztnybyuxdutrbugzzytbgnpinwparsrisxbaawrtrwssysnxkbdkdskpzkuuwgkatdnnygpgizgzsawpanixzgknzatuyngsankbtdrrpbprgzgydtbttnpditgyzbixxtzaksutzgknunxatzptgbusaknnyipybzddxrbrynxrbkszsirzukdxdaidwawutiatiardgsaynxruxsgsbauytuugpiiktsskszdsyxxsrxrdrysnkintrpxpbaytazukwpzuaaipskunsirrpbigxdtasitwwkrsyrxtriktrkanbtdyrkirryaxzartzuzbyayknrbbnyrdzaprpdntstbzikrkrbbxwbbxtxpxbzbudnkpiptpbpwinduuprwyrtpbkbpxurxzxxytaiabzibyppaywydgguyannbbgswaxibbtsspgbbwpkpxrkdwwkrxxunstgwyiuywbpisxytziubssxwsgpiktakkykzpbdkwrxbrxuykasxabiburbgtynynbzixitpzwubgisxatzuiawabwggurwbudbuzxdgpzbdtbpkzdxukiisuyynrrdzidwixxtsiaanxikrdsiybzwwsybubyrpdzzargdtizpxxyiktygdtaktwwwdpuzsgutyyzuiswnksydwnbtsypxbgszwsynkskxybbisdryabibyndtgakpgygtrppxwiysabtxrzdxxkaastbdyxsaaywyndnixdixkwspdbtkwkdazgzdwpgsnbitnrwwrksswiyanpbkxduaaautwwggpsszsurixwwxkrttgbkybutatbktyztxdkxuyutwxpytaruiwzrzpbzaznyggxpprnzakndippxyykgzydtpzduayakitrtdptaxyybxutuwyybsursstawbpytxgygxbgydtdnksdrbagnidgpdntiduaxzyddrkbuardbydzdziibzgggikaggrnyrwbrggdnnrydrkzuiubbuynxypgpkabytuxizwrzitptbdibgiusniykatddngawkxkptzdptzwrutxpszbnditwtaxgrzgrpdsznwaxsnxwkuttrxgtyytbxrittntgdrsyggdbzzunapuwywdiugzirdrrxpnwkbngzksgytiptxbwyyxipbrnuzruadngawzywaiinrtykyutkdititkkpxikgrtrisiaspggkpwuarsnksppdxngtywnnpdwzskrnpnaxtuywxwbwbntzuwanbbwsbzxgugnibyuxynrpwgtxwdgxgkttpbsxnzxazxtbntkniwpgnybkstdtiggpzzwbikwikgizktwnxayzsxnnsyrsbntusrkkxyrbxkkyzydzrztupatyuzippwzrkxitawgnriwwdppanuxrzrwzywnnrpdygztyxxwgkztuaisskgkkdiwskkzkgniuixngkigsknxtrktuppkdyittxtxirsibprrsnysnnspstuskuptzkspirudgpbdzwybydwwwtspspippdikxnbdnksxgbxzkibaiszyuakxsyddbtxpudyubigzgkxsgxaktsnzbrxtsziwikdzspadgksnggbdtsuaaidxagbxstuiydiyppkryswigwttsrgbnsbtpzdnsaktbdbdnbzwbzusiynzarpsxrkknyzktzizxguxinxyxpngkupgzuppidxyyaruutrdapdyiizyabxindxkpaguuktnxgxnxyzgwxingxkxwyaupinkppwnggtwkszrywudakgggaataxarsaigzabptwzanbxbakuawaypdyzkxywuuknaawdydyrdyupzdrzwbxkbdkdybbkkxnwurtzuuundzrxiinpnywrdgptnypskzapistsygdpbrpazpxiygxrrggnwgztudknwdxyrwgxysrzaszkkabikitnabsppkisbidarkzpsgutrwutsnpwrkttdnnatrxakyrzyyikgibbnabgxgzbdpkdgiinguawpzdsupiruyrktgdbytsbbrtzdtkpdzyurtxaxbzzbbdkipxgxrnypttazsrkrgnzpwugnugtkuzbkudsuykpgwgktzyagprripugnkdsryxsuzbgpxnxnypziyknkwkiztxyuauxrsyyriuddiszybkwwkzsxaukrkdnptykpwbzwsyktizwxiyydkurwkwtarrtskwbkpnwkyxwbunpdpakpwtgatpgnibtbbgbauykkgkrnubxytxzswtuuaxbtrwpawkntpruurpptgxazyiytixyxkxgxitairdzduixpyiuuguzpdnbskdyiunsxstkzirwrrdutiuguwwtknbrpxtudbugwkwnbasxxxdkguxasxzbstpgdyignrsdstairwigztkwdbraknkkizpgwpzraydikpnynssxaztzprykapwkkidpisysakkuzxzitnsuawdygzyysbnbwsnzudynpwdppttnigdxxdusinrwaddtsykwzibaiisnxapiibnisapbxyxykwbyxiyxdynkpwutbzpzuykzgnkkukwgszbzpsddgbxpagpdikrnrwxyukkkzxkyusixpazugunnawxykiwtuuabdwrbtnrwuwsnxnpraydaniyziugsksxspuwtuynzspbwtwstwsapdxribtukkriitdizgpxnnttyxgnanxatknxxxbnxupnkubxaaaabannwntwtzrdsxzwtpbgbpnbstsrxiswastinkdxskwpkwrnwzsddskpdrsnpygdibnixusrutryxbdtbnsgzdkryibnxyxgwntpapbydyxpbxwruubprbkdaydrzkpyrtpwzssxyzsdbynatxdxxnkpkpuxydbirwwgubdpxzyaxnadwzukzdnnyywirkugxxswdatubwuaniuzgywaxipzwgkxzynxnuyrnkgtssbdusnnywnxpupgynnrdxbbgrunnawdkgypwibpxrpwxtsakrandgxzkgbngbkknwixtkwdbdbxaytrzpdkxzrrtwzrwszdtddniwrrstgayswuykwpkdiuiinxapstgrsbtsirkbynttypbdzwstardtiiduguaupzwxadknbybbayswtdtswzkyuxzkxpdxyytpwpssurizgzikxunysbuatrsnrxrxxakpskduzkidktiwrnzskxnbbnzxgyduiiwxnyzttgawrarbugiudgkabkbtyrapiuztgbbryisxuzbkpgngagsxsrzxsxddwgzxaznktpxgzsxnukgbxxbrswtpkwsuwyunypazyxyagyynpsxkudwdbgbpbnidiwgkwsyrtkugpwgkwzgasbxsduixxsgpkuputkazzziwukxbrpnapubatnissppuyxppsupiwutwzrtwxdipnytiwizwnzzxzaispwdpbswbikwkuzzkkwpnkgpiddtxrpxdnpbszttxsxdwaznriirpnkwizyuutzdakwisixizyywdyatdgnxnaswsxkzritikkuupddurituniisddgpidasktnrgnpdaikpirtypsbyrdtkrdtkzxrdnrdkwanwdispypgxwzbkrsdxkdupszgpznpnggpdtipwpxzrpkwanpxdrgnxbtarxkpwsyukpkaizwyarwbagytdbgwrrxandgbkxbbgwkdbiiygagaiyyszaiwpwrbawdngzwsynnzdrgbgyttwpktrnkntzwknxbinzagnppnptunadbxrzkxybntbaruskaxwywasysrbtuxrxruskxgzgrrxzwgpdaapuazsuuizrgnxyaiysxuxwsbxxrydnaynnwakywtbkgdykrnpunkptuibsxusaakszbgxrztpawawdagiundyzydtgstxbapapysdrbibsxakkstntzbatasnuyuxpbgwxgbdyisabnguzbuwpbdzugupdwzridtwbauztprgnprxztpngtktgnpwpbkbpgtagnrsxtbutbzukgwiwwudbsxntzxkbiksiinynxinxgrndxwpindkkxygukpnantngtpakbdnxxgxippytrwkzbskugignrtpartyukttwabaxbusygsbakywrtgwdtgwwzarnswdstbzxutrbkptnsxnisibkwpkkypzrxszixgudkgwbarzixpkzapgxzkgxkbbadzaxrrgyangaiuzpdurpzxbwbykgixazpakkwypauiayzaxapszypkubkaurwwwgwuyurpprnuasgrnaxbtgpzdxrxntwwgybbuzwggpdxigzdwndgtpzuiyuiiuizpapbxdrawuxtxugyxgrayrztgnznptikppxugdwabnsatbawwkypnrptzigbzrxwgkgzybsdgrnbwnixnyisdnrxnsrptgynwssxwyynazdwbsbzxxuigdbgtgwptxpdaganztuwtxzbutnizdbtrxgttibdykrabgpsniakabwbssiwzyrtbnwinunnnwdaztynbwyadustwntktaaiyxyayrwkdaigrpkxbdixbwnyddrbdrpsadrzgwbyggyrytxzkndxwdixxwyzknzrnntzinpdriazagkuxssygzdkwiwzntpbarkdbnxzbiurygxbstpdndaraugddkzizrrpuwgpzbyissndssysnwzkpadpunrdbngzastsbxsdakywypxbdwxwggsyaybtrgnrdwbnprwdgrpbpdkwtdwygispbutwgxdiakrwbaridaaakwisyywsrgbdyzgrgpkduizxzpwsxzttniwrzauzabbarswznybddtprdurakigywuxsusuaxxsaysnzygnkinzyszwssaxwnakxkrutypsdaaatupdtirpxiasisbpiigngtxuzgadpyxuauspbzazpiaydnsdnpizuusuyxpgysakzatitpzrupxudzrwgygansuwpuwwpasassrsnuibtztaiiwptsbsgggxuxzydgsuxnkpiuztdwiyskpdurxudtbyrgbradynupaxipagkwxizdrynupkgwkaayatzytdixtunarxdbidrwzswgapnuabgxyibnxxppbbuknnttsrgdwkwznbwnbgzaunntksikpadntaupwpbiadnauiixrnnpkbwtinupupuiiupsyyagtyuiyzybnrpgyikpsdxyxnnxkkxyyxdytusxadubsudgkzaaizssyxigwayrwinkapdtaysxgyrptgxknwzrxwinsurnrixrxknuxbtkibpzyzxnyszutiniwpxsgwnpadgbtxyttibwzgziwptgkitzndwawwagsauuibguprnxzzgyakyzzxbnnynugiyusyxsxyurtwidygsiugxzpxsswtstrkxaywsuigkbgaxutadnubpixnkrrppxwyzattzbsabpgkaskkwkdztwbpdiugzkyzgxwsawwkzrrsxuydsaayrsiabwiadbyrsnkruuydaniykbkrspgxatidgagxybwtbugpayyrgbpinuunttxwdagwpbrtknsgwxrnznwnrpzsdtzwytxwzsbyyxirnyinstinsdswatyzswbtingwnpwrnnknduxariknxdgtssgksibawyawpsnubuyipxigsuxnunwbkkyuizzzpdgwdaykyxwdpdtxxxuniziaiwzbsywnigwxruksyubbbwybgwzpnuspiaprrdpkgauxrssiziuantawupsrgxxppakzdtaxisbydxwpguxziwaakytsudzywwsnkprwpywanixgsxiyxgzuddbtwuzygkiygpyixazbkawpdwdyaxwabbywrsxnxtknwwdkkypgxatiwpkxywpwdxbyyutpruwxykixarkkainrsyzykaabnnuaybkznrsnugkywytpywakrbaypprxutugrwyandwydigpubktksrtsbnyggyggubkxuntsrnpgtarwapxptzpxxgztgdaxrxrwyuuytnaziwdzuyagzixgknatpkktbaukkzkkrwsigkgkdwgsrpuutadkzkgrpszrbdpydsgikxxwnantnrbktzgtwissrrdnadbsswwzwgapnttkrrzdpkktxbrwnynykbgpwkngpptgduytyknbabpgdxydbstaxyypwiadptxbtddssdidnitpwnxspuzxssbspsuuttrdzzpgpwukrwwktyigtgggtdwyzknydsukadwptiuunuzywiizsdriztzigpbwypptxubkbudgaadadsuyipxarauxgzwgydtdnunxxadxnwkxwuuzwbgknizsaypkgwnwwbwawitssxsiuwgbagrkrpunsdgdwiuryybwaktrrkxnyuipatyzypanyxzrstpnwapgrkgrggbbkswywrkgrnwrzzustzwppsykkgiwurkpbixriwubpibwxnriadssxrianzxbydtpaynisndtszydpiistgyyaxunttyrygzdinrdtnrxasiuxrbsrdwnzsdnigrdttinxxbdpxatwbdnzdydtzbzuusabttygrsksbgkbtpbuprgygwnbuzudgbkgzixpuzytixtpxzgzungrstkwknsnbsisgnxrkkdzkabsnpzpywkanrxuxisnnbxgkaankuzrkttpnzkgzurgtnayiuwgasabkgkzubpkgxnbwpniydzdgixnstbubbyigyxkrrspyrirraaswbpyggidwbrastnuadnpuynxswiuuskdprdnsdndxabbngrnuxdkikwpbpntgdkzbrzukbbnwrwztwikibazgxxnruunduybsayupbpztrtrinusuxbnsirswpdypkdnaaaraarwnatyiaubbbgskwyaawudgzaaksgbzadxbbxautnxiyrrpixubrpdksrzrssniapdstbzriwxngzizxptbxiywgtbsdbrabnwaursuzudparuykuyztipuyprrgwnddzskibaiskukkizgytnuanwzsygnxsatggwrkwgiisrdgdzypddkxuxtizddyrnriadtztgsartxrdwzbkgygbuuzunwrsswkrxsbtykuazpnikptdpkbtkduaykuwrppuupuwnrpgsyxstkitatrkuzpatukdgrspyiyatagapiuausyuyxngxggttarttzuynysnuzzptrdsrgrpzzxdwxzzzggiyxyzbpwzpiwsatbidigxkzwinxwxpknbxbatbyptazskuurdruyyzxisxgsnikbzstgakgtpkbnuutrdtrsrxsgzbantngkadupzypnppsguypaisuixziuragipuzbinbtststsipanndargkawnxudwwbzkskspyyyusnxyuytdwrztkwnbiiaiwzbgdbbibdwapuginwsdispxursasizrbxxksnuytnktgrwpntgntdgxpipixxbsxwgwygpgttrpyxnkysnzygartbzwzykkztipdrkkzzksptgauriwbwaagxdrzruyrszngnnguixzyzgpypwxbxbkduyrxsginrisgusxysytixiurnzdbpkkprkwtgykuribbsyinztrrgrtrnuwyswdgnnkkkugppxwyznpkibutbynykdtsiiukgddyatxrpbwsyanttbdtrnyukgwgnzaxbpgkdugapzbbkwbkbwxrpbgynydubwbuapsuxznyrrssitsppbxkyygpnixdiwzaybdzakidstnyutxyyabaxxanpiwnzxstxnabuxzwsppdtxxwktstiytwryzsgbzwwigbzppxuzwiddsawxkbibzrsdptzpdgwxsauitiwanidsbugunpwpbtubdsgaabuaixzgtbywidtgnwuiuuwzydxsdpztuiuygruiniadnztypggnixktsazwngipdzukndaryyddwtgwkaugbyknzkbtzxannzupysxxgyiwpgiwygitgwykdagbuknpnnwgszdkgipbkuxzixwussanadngwwguddxtsgzzabtarazinxkpgksswsszdbrbtkytxnkwtgxsairuigzwbyuzgpwnuinsyzzknngtzwaxuptizarxinkppuanskwgzybtgksubuitupizngdpuwpbnkibukuawigtidpyzbrdznpxswwunadxgnrnbgbzkakgsyyiswwipgbxruntkgiuuxwkuzaaugppdpxuayabiyiziaagsgzwatbztspgwutkazikgpkpkpaiwwunbggzbxkgxbnsttxydkgddktrtzgtaynixayiyntbirybizaartuaxtzigkzganbwxudwpnaszxyuuugxgwubikisbsgzxkxydkynxwkwzbnpxwpibxgirntsdwzwksrttxddzsurgdnnwitniwgsrxagrwgwuiiargzaxubzudzprdzbwtwaiunpguaywnbbsrgbpipbpaztzpgppkxtxzwkbskdsxxwzuagygywrxrzgbpppznndsgyiidrgutbrwnrbrkdxptpgdwduppigstbuypbszpbnugaaiwdnagazsbngybiaabynnkwwsiusrssungxipkxpppkaggpsxsnnwusttbzzipkgytbkwzuwtwyakxwzaaptasskazxtyxgpwdauabuxiddkpzgbtrgdgauwxxksnwgpbtskdwytirzzntwzsasyiyzzburxxdngudwidzgiuzpwixrtzstzgkkzttkidbuwwutnatuspksyzrnbubigbixutswaksdbiidxxxiutwnituniytswwwrgapyanrudbxirrsasggwydprgngstnwkpwptknapzknarbxyidtxwsuxykxduziirznaxgaiszapwrszurdrzypintnnbkinkpnatzrizzspgyxbyitynbuxtnaiutwsynntutspbnggabsnxndxbdrstrtwsxxzgunzbdbuzgyragyxrytpbdxnpzkywynrkppytsddtnrpkiunaxgukatnayaugxpddspprywubzgbydbdidwtxwzrkdtdyuazwbrutbxnizykuzyaixkdsnxxnxngxpdygzssagpigisiwtiabyykszggiybzbbwzkgubudsizakwdiddsnrdynbwxkxirtydiyxgtagnpgbzwurpyidtpuppgdsiiasrzzzzxxktuuxwtbpyzrwuiynknnkykkuapnbnipaautsgwkypxdnpnaxkiabgsrnttigpaagsrzkkgpxdngbxuawnzayddtsptrndapyibtdbyriawtuykygunnutztkkndsriwddnwzpxpiazpnritgbsgryarrnydwrwaybpiwpbiudxtdxnkutsnkuniitgradsddgkdtdrzunrixwxyukizggayszikgntdypznrnisixzisnrkgdwzbkypkpbrpizadxkbnnibindtksptibbizbaytbtbuxrwznpdizspxbbndptyxgbaxpngpxabaanpiansgdbuyyxsyzdaypydwrbpwwbnkxrabxbnbayypykdudyapxpuugarswadtkyppxrsarzyszsbryyyskwttrirzztkzprxkyugaukygitnkkgugayysrunxiaxigpbudugzpzuktndgnwnkxutsbpggwgwtstgsrptzywnzdzibdszzwkuskpybndbasbgzaznzzzadxiwzptndxwgsguprdywniwdyugsztkrxtntxpzwxbybswiypakyxswykridaaazatizwbsaapxktzbgyaskgrzsipbbbazguuytunpduzrzuudpygsgtdrgwrtpdtdnyziutisgztzawgpskrkrbnitwwzggysptkndsxabungpyiaskzydsikaibbkixkpyykasatyzkdizayrxsggbwsiiszxnkkiuragsyssunzpbnaiyiitsydnwisurssazkpyskxgatpbgnpzpdbpbuapxazatnbtwityspitxzubnabrrgutsdbknzduxxydbntktgaadpwprkaabkbidgpdpabxazzsysnbttaizbsiuigndtgiuzbybgwiguiyizykwtipkydnyxttwbbtikapgsidndxbdpgyxkxpdwrzdbnwytwpykdzxbpntdudrbgyytsnsxtykynwrkdtpzskzupaxxxdnyagattgparisntutgkgbgisspgbbdgaxxtzdgzzyndzxrdrkgkdwdiwwkwrnbywuyzdkpsrwyrbdkygrkapnupxpnaktuwngbbtpkpaiputnwzwgtrgbyzwtsbrzzzzdpzstysngitruwiipbwkwwusnzydixnkszsyxazuudkxbrytdsxxpiwisnrbskdtssztbxsxtgxrnxuynkswdnaykaxpzrbybkduiirygnbswxxbdddbydsntwzikikzdibgrnuxgubabpgdpdpwtrnwntxnuwyztkwbwbduwdxyruxagirxnspbuurzbxtxurinapypwwkdyswyrrnigixirxyyprutixpakpxanrtwkdzsnzadzspkxgbgyyaikkpbtdbspnuwwkngupnnwskiutazkysxzygrzntzbnrggdbusdratgpbagwbwsnibuwniknidsdattabzzpbppyxyzgsixrsusbstypnwyrgduikxzdpkkspkxppwwyxxtdgadwrzktxtpwrgbsigxragxpwikrzrwzgnzkpsyrwdxssdkwrbauntainwrnztbrtwpgkwtddtysrsuwbzxguskwpknsxksyngsibprsygsynrgpbyizyawbzxyatsdastntuurwbwxpbzyzpxnzzakdwnaukiyydbwignuwskxiuzuigwdgzpbaaawtyrwrdrxgttzprynniptinwrwwpystsgykixzparnznnzyrtwtpwbyursrayztginurzdgpyxduzgsdrnzaztxudtgabbbxzdykibkzxrgpuguwaidakagwpzuskaypigbtuxxrppgwragndngsybywnsdtwtbdgpbpkiwauubsrrbbzxdtrzaxzppgkbtwxazwarbstgxztxkwnraiksrygstkaitrbxwtyswddzpwzzapprwniznzbzwyyiagazpaykxwkaadkwbggunakdtastwayzwyribyaykkdkpaynryrgzdrbkdurtuapytuyrikggztywptwktrzkwywnipwnxiunnrxydwipsuuzkpysndztzngxnygartwkdzzdskbbgpwbwpxggpiytapuszzsugrtzbnkraudyxdburpgznxzxxnzutyanybnwxbkaybssywzgxytwztzrwgsyadktwnpsgaizygnirtudgdnsduxwxusdauskurznggbpadszxxntwbspzasrazzktpusxnxiyuwpiwguwgztpxdiptgwkawsyrukbzbbgpnzuggpnyngikddsrwsxxzxwxstpnwzdpyainsgsyuggspakugxpprbkpkparxyuuisznkzpbzwktgzubrtgwrkriawupiwyirtwdrwzsbxsnkxwwwzdyytknssrbbuwbugwtbsdkbpzzywpuxxdwtzxwbypsitidwkyyanykzrpkxwwyxdknwizpnwrwysppuydykgkswddnduwnwatxituktdwwysgbrarubbndpizixukdrpdagabrwadpkrtziubigydzazyyytsdgkwzrkbzwptabsubxxusuxparbzinupnwwrtgwwuunkiisnrkrrtsupnxwgpiuaygundkdbtpxdkxswdwurrysbabzsnrwgurdnnwsaydwbbwtwbapsdsrnygubbdxawwbsntatnwgdudunigtxrtpiaiywrgypbysydzpydggnaywtwingubpxndtrutzruyskusywgsuudayspitwsznabzypupbisxbzztnirxugaradpbnnignyaturptgtusbtabynbziytpdkuxugwxnkgizwziktbitryyngyaktauidiprdzxppuuwbiipiwxuspdztayysgnnsbzxizipgnbbskttstkiuxurunwztdrsubntpuartnkzgdpxryunazubpaprxxzwppuaxgisturiausabkzzpydtxyatgixayayxkpxtkgrdyadgkabbarygxbriurbgyyzgzrxwtaprzdbpdabuuzbxprynkrupsazdwkdytbipgaputiaysdtpugdbbiwuynxruyzagnaxrtgzwwxssbsbtdkiawgzxaspwibdpzswabigssrwuxywgnnzabaipzgyzktkkxbgtixratdpaktnnykdgdgrudwxkgrryzpgnguxbzstpswbitdxszxxssdkxxxuakwtiyadwrznasiwwtxbarwgbirkpisyxaztkkupbngtungryzpxtydriiuxgptdizzdrswxbpnnrzritrzbnazybrwxdndnndzdxsgguyptrigaakkyiybirawngbatbswuikbszrnptkiwbntgkrttsxtnnrkypirwyykaxngwygurwwxzrzsbixpauwzgpibktgznnsyskwskbkykxdyrtdbbgwapdrtnrizxsarzxdxdbixdibtztuttxrpwnaaarbninuawrkpzunurxwwnksbwsakdkxkduugwyundngrxzxnnsiixstnnpkrpyxrwaangzztakyytxpawprdkratsrndxddsypdauupxppkurkpsuprpxbtwgtgdgzwrsabzgbgykusznrtzbtibniswnaxstpsnwwukwdixwbrrkkbiazxgydwtbpdkasudptdbixruwsiriwxprndtptdpiairpnbwttkixdbpgiwygyxrpzgpawydawgbywuinxixnbzagbatdtdrzuausrxuitxbnxtutbauatasuabxbatkzrtkgzbdauinxrwanrpbtynzudykbapbpranwasrixpdkyggtbuwgwaigkpibtrwrudwnukwbdnixxyipxwyyiypiuwtbzyiazasbakyksbxkpyiwtrnrnbrxiykdypubnuwuatydgsuyuddstbiggrpyyupdpkauzdknsgxryxapttyywnrytgkpunzgupgwtkkbxaskwxuadnrwbpgsudbstwxksyknriuwwbiuwtwsknbdrkiipnuguydnbrkrrapripysydigguraayuawxikzxwrgpgdtrsipbkzgpdxtixnwirwwstairxtztzkywbaizuytrnpwbakspwrptzdwaiwnbszkwawubzkgnabpgdwskniuygxngdypxddxskrxrdiyabwyrduuanbtpiaggnbdxsyrdbksgduwnrnydadzpxygiiwdzairbybnpddzdbuwrkdsbwdktsunkdagpaprsdxkrtaznygynrxxgptytwrguywnwnudnibpnrxtxsgdbdrxtatskknukrauxgynpixuawuzsgusrdinkpdnxkixgbwgtndiwddbnpsysuuduratiwgkdtdskrbxgzpxkzytrrppybixtixprawpdnazwxysszuagsgkpznunkktnpsazdxuzszanbgrukaxkdbddwirgrztyandudnbrbyukdarsbkkutnbsagaksawdzgzwbrsxaxasdnuggtpkzidxsggtrtagibkaxdizkwaabibtuzgigtnwsdzikwnzaypsribxawswxtrwtkspkrwradndbnzrdwdnbyapbwxwrsduzusykykawdpitssyttrpsbdxswwabzyptbisixzkzddtgipzrrpwywkzpxisrywywrssaiwkrgrkspnxxpdndzuyuxpnxkwdgyrxugudpirixdpprnniitgskyipbkzdbkdkkuwuxkdpanuxskknkyyanzuwgwiznxnbwuabsnnybbbzaixxgttixbwngwupaiiddgkdupktbktyyibraysitdrgdkkwbwwpngxagsytydisdiyputtayiykykaxriyarurtdubytnbawintkzyrpnywsyytkwuxswibnyynigaiwipbwwgwpsrngzzisidzrkggbangwrdggkixdbuxxuxktrbtdxgiknidggpignkzantxnykttywrasnwdnzzaapxtngsruupgpubsidgwbkzigxtszkxsdxkrstgusgwwrktsdbskksunknkkskzbwkrwxtawzyxwtunrrbuksnunzdwrdznpyzrnakdwxttbutpknkstwyzkbzzbwgburuipitrtisgyyixbxtgnbbpdwzyapdbyutxyssgngtraapnuwdsrkxixzbtkbuizntbuxgbatxtsdnidgwwatiiptnbbwywysxdydpissgrpkynsdruyzksyyxkgpwrukgzrpkwabudxrbwxtnngiagisnnudisnstspwxpkakrrwxnatpyyskarxbdtxnxakiyydaprrbutzkkadtdzzkdusyuzsdnrsaatrxussatbgnradzdnkzrwyyatkrgzkyywyigsbbkzpdzxunyiugduuadubskgtzskikzpdixiwpuswaprbbbraizdyitnpdzitbaiusayarugkwudrtigxusausipwpdtbnkywbazkdzuntwgzxuxdgzipsdntybkrnypnuxntppbattsntnkaybykgkiapxpabuyrpkizkgndxgnxdnunwazdpuzygizpkxidktpkziswdsskgsaiuunaknsibrxzigpinubudstysugxzbdtxdgyxkdddrdpxxszrrbbadssgsdknygsbknwarrsikxzausbybrppapuyirxnydapkztxaxrsxyryypxkpiytbgpwtinbgazzazsiwazadkankiazspknpxtwxpznwwptskrnwbzsgdsrazutpawxdknzxarksnnpxbpdabnkbngiarzrdagxawsgrybyuyynxiprszndtawugzusrkusgbntaiudbiyrtwprnuzgabnwukauubgytitgizkauspwgupdpkzkgpappswatguykkpzibzrswpbsbppwxrsbitwrubpnwgpkkuwbstuwxattwpnnisawpkwwuybytwwrgswspipdxdiryrzisdsdaakktgwdzitazyzyuzyxtubdnsgnwiinausdnbtdtxgwswgantzxnxaritbwyxdknnribptywpkxdbtxpnuaapbuswspyzdbdbatukxpgagdsadpybarssktgxunwtirixggdubwbttuynyxuxaiagtkizpsrwrxxsadrtrxkiwrbkuzzsuiindwwbyadpzxunriwabtazpsguuysnzsrbwasizwutptadsuzzwiasyzgtxssdydsisaxptwdkddwzknzpttpiysbdbaazpzszrwptaapsarxwukyntwizspxbpgwwtapgsipxaruizsksuruywuptxtrsadztpngzwsxatkxrbpgpnanyakbnxabsuyrpzzxgbstiykxkkbpiuwanpwbdnurdrnrkbxnasnxrwuusupddtwrpaapytuydptyixaxiganwkirnisgbgayauzgtpybususdindbzknbrbduzrtzpsdbrunpangwxrwbibnpypwkkgurwgpyinktrgziddgngbizzapiykrtxsgyutuxwpnwtpybzddpungzigptbatzziruwxiwzxknypgykpybnpryiunrpndkudwbaxiwundriizwpzsggkgyxpdyysbubkyansuwdiydxxbtdwdydziybpxwrrnbbwynzbpwgnpirdsrrxtaikwyaungigbpwrxksktwzxazkipnpgzuprtyrixddugxbpswnngwipndibwkdxgyxpyzuadsdzuiauiukgdxintynupgnuktkdrarbnrkzsutgygnwryysxbsbrgkxnxassbzpratuxdyakdtbiadbyxzizdxgiswwadaarabiptwautagnbbxybrgxbbybxuwxiwyprusrbikzurbygtwuxdybbyxwtwrbndagsptzsnybgduxkxbpdzkubnanyaatrdnybkpwdgwdiybbptsbzyrudprxukkttxbrdkbattxbxxixtdntiarddiigaxnaxbazupnsgugyyygywgpabgizgtgpyrgxaagkxwrswpxspbykzzwkpswdiurtgiwzgstspgpakxudspkggnkribaunkaubgbrnxkurwbwyxytgzspnngstwbupuxspigrttkugrrzrpkakssdtbkssrybstypnpbxydstkkurdwaiakkdynupzppxuigdwwwsdkdpakupwtzpgixsdnkgyrxzxpxwuidupbydgrnxpggryidnpzixkuyrantgdykgurzwywyrbpupbpgswgpnkbwpgywtdtibasigbgdtwipiwxagbbyxwspwnbgysrznkixsxwdgrwpaaisgnstdwgxpsxxbsspbusuybpzbgywswyzsuwskizasxkwdbwtdasxaxirnztkbatbkbsxpiyzabnzbdbtsnggbbixbubdrxrzppaknxztzkdnytrppwpxaynydpbgwdssaxbdiydbgspbtudzugnuxgtwsgwszzwazixdbppkyyrbiiyiksyyrabkpadgaibgkudpurzkygdkwnwknabkdnswuxbbzbrdaddaidsbkrpxdzwdwpybtgiyktugxpdxdsxyugktgxktpbzwsznaasdwnrztrkxktbbzbxgyngzutuibwnpikrbpxkxkduusrrakiaizardauyugnygwpygytgniutwsxasantpwayastrkdkptrrxpdxdrpbbykrsxynxwnpkpnruawuztspixbnakznagysbtbirgwgutrinygrrkykgkxnzxtsptgatdrbuxyndnyytyntatpbtakwyyutngiygigwprwzsxrnkbkgtsiutxsrxtztyzbbwadkupnzbxpxskbdgdkgdwtuwapryxuunpnwppxirssdkwrpxnusdypgwaiinxbwarydusaaayakskwdpikytdadwukypzgdtgtnryzdrywnnbxibwiburkrwzunagbzirtrwktuapunuzswuzndiapgxyixbtwdyrzrtzdsswzirydtnuxdktkkxrddtggusbrpztnydtpaxbpybdrzzpzxyuikuznuinkgwrnsuggtukrswgpuankuasupkwkbzinzdrguinggbwntpzuktprabbkppwbxuwwrauudygrtzkabgkgywuntggikbyszpznzpzaartbzkanzzizkpabukapbidxrgwikkndidwydixrduzzttrsgpnzwysynzipswzzzwraiuxnwpggxigwasptibbtuwkxwutszpynitzbwidwyrzwiwgtuxwgprbrwdrzndyadbgrgbusygyryzrybatrrkppudrbgxsyzbsuzyyuwpzbydrpiwstagpurttzpryassduduuargdkkndgnaupyadditytaixpdsxpusgtgppnbtninwzbdypyxdkbazndsbtzupkrugzgixksibkpxwnzkgyinwtbzdsgbkbtdrswxdxdbxytytzguusidrrkduugxirbpkkdxnaaudsrksgwzwnzkiawiwzazdrwutiiguydiangdrasdnnpybdrikkspbguxpidzakrwkktnpstgpruxyzsgpyynarywxpwbkpdbgpyznuzdbwwdwnxzbrauarkuuxgstgbkstxakpszgdsyspntgkynzdbpbinrasippasnkypuxudapdggxirpzkbdaykxntupysbdkzskanprkriuanyzzinuntarwinnwgnkkuzxugrnirtausaxawydkrptgsngganynatgydnuddgiyzzbazupxsudtstygzgxpasrsianbnbnsptubwwuwuuabddptawgrtwtxpnpakgpxdbwdgbxiarirnyytidzsygusyryzytksykgiiuxipayzizidtgbuxzuxnpwzbkdxxkakaswwbkzpwirddbswnzrsadazyixsybipnurwxnnzzxtuwurysgixxstznppydsxsnbgkuggputuurdxbnwytwxtzryzuryxwbuxnuxpadwtipirgyrpzywbaitiazygzktizxgaridpnrgsnzsxxbrybttsxtuabixtadkabzwdzwyaswyddpbbduyugnkgkxkytsgptktubbnywdrkazktgnpwbkturbaawdygikxgussdadknntntkugtpnwuwzaanyknyzgsxgsxixpningaptirkstaanizsurzrizyrzkxrdxiukwwsitgwyiwiswwgupyddyatyyiwdratnbyurgxunuyrkspnygiwudbkydbauptbtgpynbkdaxnxwsbbdtzpzsardgikzsgazbnaygubwwidxzrkszbdwkxipaytxbtrpuugbszstrsprrybdztxinsrytyzkwzpbdnpyidsuziwxkgixursntdirzikrwdaxirtkdgbygkdxpkbtixidgtribaukaiawgaynkdbggwrpxnktsrasabidzgbwrgrxyyddxzttztyupkdwuswsdksgtupxidsandprruuiryitndparbsiprnnbtyskydktxurrkiawrudsxipdyntbsuugaiytrixtxadwxkyxsdkapsardgszrsdguuzgbxpnkkpigzzuzsduzpttwagdnzwyxgsarzgydunarbbiwatukxrsxxprdxpnktxdysbgnazbuuntzrwytupiiukgwgksgdwrbudizndnwxxwsappwbsubsydibntrtkdgnkbzwazurptsrygxaxyipantrrngdsbgsttndrxsudkyaygxpgyxnxxzpxziungbibadstzknauussrtnwtxiksdyiguiytypudkankzsazxdybnyndggnsgyxksxaksgnaypxzpkgynuxyaxgnzgdxgnsdwnwkdnkuyyyxyspskknarkdpddrnbnpwnzgrsdkbgnsagkybtytnynigudrgxypdpsiazprizyypnsrkkrragyrwtdgipysixgzwggwibnydpngkpdaynzydzdpszpxdtxixkrgztyrdpubdzxgbprngtdngnrixxridkkxprpwkkrauxpzppsabwgabubxingytitruxztxbxgabdndidxuiiggygspnydrbrnursgtuupbwxpdaiwddkbsaxnnwsaswynptdntibyyxsgktyxippsiazndrkrzkwsabugzuzpriisxgabgbrugysrttausxdxkzktrakdydassttnydtrntuwygwrpdbingzwkiizakwgszxyktxyxkngybsasnrxiytrnktzzzspydrsspzzsxswunkbaspsxyiywktbtznnpguksudusiipiddxusyngkzyngbkbndzigpikkkaxtrisgzgtrxnkdtsiabuidadkbtkxkrakxigtuwgxkkrinnyptrigkxzuxnrdwutdzpkrstykbkwzzbxygszzzupirtxgrzygzisdxrgbtygnzxnstbwpyssdapkaugxrxrzrrndbdywskstraduuipkkpwzskpkbtkrtsiunrpprdkrugtxwakwuwruyiwrzitgsadzywriiidagkwbsdiwnaytatanaxpaixbxuzbiwxzdzkkpdtgpkduuynkxpkxzubakwagnawwzzipapsdwrdbysruzbttbyuzpdzxtabsniaatrybwaazgzaauayaiyuzguwzaxxppwugpnsbnwwktdznbdazttbztsrssnzkdsixnatbtwpgibiwdsakgdxzuudwiupgruwarpdbraatawzdwkzixnazpdtnbxkbrabtusabaspsyibrbiwutpsawwasattadtkybridgkxazrszbrptsisawukkdikznrpssgzganaabrpntaadtxybnzprnunyktrwitzipwdpniuxyxpbydtgtnsiwxxxybpraynkrkdpxxkkwxxsiiwisdrriwuxbugwzxgpigbzpdnwidbtwdinddkizpzwytzsbspstkyaggxipugdnwgrknbsuyswnxrxidautusrbatxgsigddrtdyuntbsxrkattnaxkndsbtykttgwbkgxtuiuwbaxibkzdppasksggzrywaaxdiiawwtrzxxytbtxwiggrrzirdrpptupnzugrbzykkazukwdrxnnbzgyzayaxskrunsnytdwxtsbnxxapgztkukarttsxuwdgtxsyrgdrtsdutwnriyxgtktibxgpddkxtrxstgaipzituskudgbuyiwbinxwxpzsnrbyabngauniaiuaxzkxpbpbikptwsdryzkytxkinxsrtytrgbtsgwtizudgatxsgwtpspwrrnunpnbdnsyainkrpnxprsawizzuwawxnkyyswbykpgbsxrzurpiinwbbsisgpgkatbbaarwawrwdgirubgwidzrtssbzwgznkiytgrxrpybarrgrzyysuudazziyzuusprksiaaurgbdtiabittdgayduibdbutrzwnwgbkuasurusanznbztwwaytrtbiugxadgaswrxzzdtkdpadbaybxtnbspzkytbirzwtnabnybptnkrywnbyabkpkpuygywsryngdkuwngdpxzkudadgkiuyuwkzuyxyddykanwgstwxnksrbybawgnkunysktigptiybgdunniubpikuaznnyrwkgktbgbrnpsagxzdyktaynigzpuibnaiskukzpkyzrwtrgdtaszzxaubxdktztywruyparygdxxxzkwbwbbkzprznbxsatgibkabgnztanwpsgwtdxdiguuxrigadpywkgairzkargttixbddydustiukwrzpzzidnzzzkdptknkdiyuxgztdnitxrunyinxtxugspixnuasdpaidwubwytsyrwkpkinwrnykkyixkriknsxbskbsgnrtwwxggpzrpzdgzxwyizrtdrntuxssgsraktxbwbszunygndgspiiatxayagstadpabnkbddgagwdnsyuyxpstyrtwtrdysbpugangirxuzaztragysrkkytiisudiynpzrszrgkpazdidiswrrrtgtdypuwuwabrydzayxrdaidbuupiwwnpggasgdwwnygsrzispibwtxbnnzwxtidxkriitxsngrutubrtgpbpytyiizpngaxtsszzwwkpdysusrsiappgwwssiwsznbkaapatpaabgbywbdsnadgykbdppkasgkwysbpnxrripasygbpadtktputyutygtybkipkdxizywusaaiggnyyniszwdudxwwkgbsrypiibidbdnwyyxzxdwwggurxprxntbpdtuspwzkykppnbnudzxdndpdxdygnsgddptbrzukdpgpxwbixusxnsirixyxibpssigyrttbwtrugzysyszwksitbrsubaxwnbnanyutwxrinuxunnzadbnrkgyxurnwrzgkdtyygbdarzzrigtrybtgyzxiirbrdwuzxyizzknbrugdsbzgpsbtyunzubyabtxxktuwdsknnatrgzyizttxiptybbxiprszwzkkwxxagxduixprkgkxbgrditzkgpandwbuubaxydxsuwubsidrgaatnugbkkabkbaxbnyzpztirusywxdawwdnnistxiuapzbuxukkyisuwtbzxyikutznkndawgbgpiikzapzgduznsgiwrrkbpntbawbbgaukdswrngypryynsaystydwipgwdszwdtnbraznusbsnitwrnwkkpuyddakwrsxdynwptyubtrsxxdrrpyzpdanarbxztzkdwukynsnpigruppusgipdzbizrpgtxdggigwwibrysgkdipisrzxkyzsxdanxgapgpadikiakspadgiitrydaasiwnysruudiibkgpkywdzssixsudbiiizkukbswngdnunpuwbdgnuasrgkwnsnatdwuyprrgnspwapuiswtiwnbyipykikidattbdiwbnnsryngxyxdwbtbndzzyidaxuytybargdttyaggszitztxtawydbryksdrtnisxntgxynywpxbdupxtxggiybrbsnrtrubtwzgzsbpxpnkudswgukynnxbntnzuippziztdxzynswzgizskwizsrypixdwwtpuwywnkwdiryyzwzsiyaapwigwsgtzxuuxdtnsrntrbkwknkpyakpiztxzpuyryniyasudusktgypbzktktxurguubxnzraubxntxbzpkuxtyiszbuwptgpkwaudwydtdtixungzssarbxgiwapgpgutgydbktiipkudkdpbbntpawxdudsdztztxtbdtwnrazttwiuxybxtwdpuzgigipigwirnwksnypbiywaizusyixdzndrnitrpzxputiwyaxaaxtkkigwkrzxwgzgudixknizgiszbnbrysztaxsryrrrigupduigxbszxuidybirzatzktxwskninrigwbtrabwptxnnkzkadiukkwzrpxuzdaxprdnyxkyprwysndiapiguzdawndnusxgipbsiixyzsrwxdtbszaabgxzsriprszprpubtkswawzadrkxtrsipduwywbziiitktdabbtrsbgunrkpgiyyytypuguwbtyuuzknppzgusgwudszidzzkxkbawbayswtrnibzpruigzgapbkygwkwuasypiuugzryazgnbndnzpannytakkdidaziidurpkiwupuxnpraxwiuzyxttunuiiidgxdnkaydtuskixudyxybdgywbxzgawpskiziyznbtuyxxpxxbtypawxpuuzunrppspddagwpwpskbnxaniixrtutnnkinrpyzpwbxtbnbatyyrwuxsbitwpkixbwbxixrguzknixrkbpnzrypugundbrkagknnakdubynnkxbnzartgtgsxdxwsipzwykitkzzxydukkxggsitwxbiwsytarwturzkdwzaaxrggkuxxduxgtbudbsxkiddabdurxaxsxrazxugxwwksyiyxsyirrwnuuakxkinrxgbsxxkgnpdxtrxabyztkpnxkrgantuxxpndndgabwdzzarrsrzstkgkaunbzdwrxnarpryguwpzwsandwdppkwgtpxbawttyayxabkxnnaydkiuuttgwpbrkyryssidzgabdxrwbtxuzdinigpytuddaapturuaabndwtpdwrynkdarxnpnadzgwutkksxkdsbdytgyrbizgkszpgwxyustrbdxpxwaguaarwuaggypssyxatkdinzrgbyidgpbkrgwtazszawwrazbuwdnggbuauzsiuyrrytpkpzrwrybzsxwkriptgakwzgwzkdktznzrawxrskgyknwzyspskuksywxdbdsxunngukrkkagkdwgtygkasdwnpsxyaygaatwprtsduzdkdzaksddazksgttubbnggadzgpubzwdzwixibyiwrrkwarapxiutntzbpsszxntuwsrxwxukrgakyztddtwntyabgxgiuunikzzxrnnwaariwbrtybssyxkzpisystnwkrdgitkdbaxttxtbgudgdkywiwuzpgudygbabrrktbxnriapaprdprwps\nzqymfpmqkpjqnpnjpqliqpmpmnipxlzhyflifxqinqqzyxfxykmxzklxnljhkpxqzklxpzplyyqjqpqmhqzfpnqiypqqpyzplnlljlplqqiffzlmfipkmzqyljypnnqlmmznzkpkipxmmppylplylhknyjmklnhlyxzzmllklqinfxkyqypfmpyykylffzjjhpllnfljjzpyiznppjykmhxnpmnxxhkpfhjnmhmjxyllqlkmijpzjyjzpqlqmlxllpfxyxmnjkqphkpzlyqllhxihpphmpfmqxqmzplifxmnyllxqpmqfmpxqiyflqmfpmipipjfkflzyfqkhijlqkhpqlijhphkinjfjliljfqfhhfipqlkzxlqqizymfmplkqijqfzixnkpxnfmkhjqqnjmpnijplqqfylikixmkmyqpzpkqlhfixpfqnklpjnmqpnzijilpiflylxykhxpzllqpjmqhixlxflyjfppyfkhqqqlilmlmmilpylqmqzpxknmipmkqlxpqlpzklxhqhnkjjqynkphpflikpnylipykxxnqmhhfhjzxnjilylpllnhqlllihpxiqihnfjqklxhqnxqyjqfnqqxqjkzpnqqjpzhppnhljmlfxzfylipinqlyqfiifnqiyniqzqmzimzkqyxllqkkplyplhklqlfnlyxhyqxjqzzkzypixqmlmzljqfkqhkzpnnpxqpfpkzxphppmqimhhkpklhqzfjfqpzxfyxlxyhfzmpjkpqknyqjlplxypkfzyiifxnnzjhnfqplyzlykipplhnhnzlyyyxkxhfpjljlpmyfhlpfqyhpnhmjjpnllqpkkpzkhllqfkzylnzpnmlxqmqqllqxnhqiynnxqzqkyjxjmyxkpmpfxfnnlpqkpqxzzlllliphfzjzyznpppkllzznlzlqmippppxpppmkmflmhzqphkfimhppipzkilfzmpqqyynppzfkmpphxixpjxfjxfkxfminpihqnlfljzppnkkqffqnzllhjhqllikmzyfpnnmnhmhqlffqlqhllkkjyqpyqqxmphxjzpllifippqmqjhlqhqhphqhfkqzkhhpxmyljihpkpqlmnqjzqqznynqfqnmpzznkfyxxmlxyjklfzfzlliznxmyzjmpqlqmqpqfjxlqynqjqjqqlphmqyikfqjyqlylkihxffkmhpyllynkxyfmxkflqnnymyhljlqfnlliqmyjkhzmlkpzmxfjqljmfpmxqqixjlhziqqpxyklfnlxxqnpxfmmqnpyzllliilqqpkqhjnqpyikiqmkyhnxlikppqhlmjjmpqfhqzjljmznhykppxqjkmiipmimpqmqflplxnyjzflqhpllhqqnzxqnjpplmjqjiifnzjlxmlqfnijxlqiqhplkmkpnnilpplkhjlqzknlyyimpqxmplmmkpjihzlyqkfpyffqzpfzxfhlnpklhzllhxqmyplqjzmzqnxlyqliipjfhhpilyzqhfqlpxfjmxyzqqhyypflphpqpymqlxlihljifqzqpnkyjppjzknphlmnlypkxqhkknkllnmyfzkihnpnzylqiflzqhpqqkppkpphninpizpphknnxyfhppznlqfzyjjhnnmikpiflhlzznqzjhmnnnlijimzlqkhqjqpjlmhkqjpzykilqzqpxhljfpyykqzplppjnzlxnlqmfnpfininhpxxmhnlmqqzyfqkqfqhlmxmqhllfnhpqjfxfmpykhxxfpkkzlnxlxqxplfhmyfizhyxqnzqqxkqfqflpqmhjpqxqkknfmymzqyxyjmxllklzmpqpqijhzlkjifqqqmqxqljnpplnlxhqlfqzllknlzilnlzyfpnqhllxpjlflqilhnyfflllznfppplnklzkxlqjjqhxqzyqxymiliqipfpipnlxqlpjfyfqnfpzjhjzixkfpmlixixqjykjjmqqlypjmqqxqmlpijqxfnzlmjlpxkpilpjhlfhxhxnqjqklzzpymqknlppkpkjxkfhmixnnpijhihpmmqxpplqhjhzhlxlxqxmhxlqyplxxlnjqfmqxlhpjlknknpnklnyqlizqfpmnflpnljzfnqhlqhyqnxyplqpjxnlfpqppqxiinkliylqlklkjhnqiqnlknzlmqmyfzlxpqzyfyyynkjphjnkqmzlqjnhfmnylpxlixqlziqnqynklmxypmlpxqqqiliphnjiillypqjlhpqpyhqfqifpylfzqhnppnkjlhplqhqjzqknpmznnqflzylqhxmzlppmkqlzynpyzlpypjmxizlpllphyiqxyznphjlflmlnnnxixhpmmxyzmkjqyipknfffxfpjkjlmxfjjliqpplkjzkljhzlnhlliqimplmpfzlxyqnmlpyjnklkppmifkliljpzfpnjjklyfplkqmqhqlppqqfxpiihnhplnnhjypinljpjqqpypqlnjlfqxxjqjnnnhkqhqipfhxjzinqjhfqfmhkflmqlkplpzinlnflqmxjfqqpqqmxfpplqpjjljqyppzphhpklplpzimqqpqnnqyxjxqqinqypflplmqxmqmpxffyljqzmnxlpinqmlmqnqykjliqnqyimpqlyfpjkjqhmyipkiqqpihjmfqqiqmqlpyxkxkzqhqlznpllfinxillqfhjiiqkkznxlqmnlzfxpylxjylihllppqykkijqqhjqkxmjhmzqinhhpmhjyqpqzqyplqjkqllizfnfqzfnyylqjjpiqinqyqkmzqqikqphqxyqpmflxipqqiykpqxjqqpqhqhkpmlhllpyyzylzxikipjqmlhlyqqpypyfkjlpllzpqhlhppilkxpqmplxxfpfqpmiqqqpfhinjjxxklpmyifyfzznhlkpmhqylmxqjlhnqnkpfxjhhpppxjyjppmqhlxphlyfqihpyqqpqphlkljxiizqihzmhfxkfymnlkizlpklqfjzxymhqpqlpkjppyljpkkfpzzfqpxihnqlykmfnhkpmiyklxplzlpllyplmjlhqkkmjpjlznjfyyfxpiplylyfmlzqliynpxkpillkllihixlqlyplqyzikfiqllfzpzijizflqhmhzqjqqkjiyiipkihlkxfkipzhlqpzqfpfkppxlpyxzhjlhihlpizhhplizkxxjmmqkkphlkpjmllhllnqnmfnlyyilpyppqnjxqxlmpzzlqqxjlzyqlqjiykpiflxhhxlqxfpmkqknjjqnillqyqqlppynlmyxfmzzfqilpnzfzxqliyhknxihmpqxxqxmkjhkhiflnljlpkjhfkmpmyyixmqqynppppyhpylpzpxqipkplpqhqpppjixypnjxiqzylqfpqniknipzypijxhlpnjkpqlxlhpynmqnplklpkqmxxhzxpllqqnyliiflyxhqqlflxilmklpznqxpnqmhpfxnnnixqlyljjqppzlmhlpqqlqjhpxqhjplnfmqlqjqmmlhfljphhfhpilqphpplxmpnhmmxpxhphphnpknhkmlkpnifyyfllyynpixmlqfqlhmkmpqhlpnfqqnlyqnxlxqnyfmpxqlnmhfxfylknhxmlnyjhppqizxijjppjmpxmizzqilknmllffkxqixyfniqylxpqmimxfhmffnnfnhlhnnzipxlyjiplmlfhqzyfxxmhkpqkjkjyqjyffzpillymxqfxqkplxlzyihpmphlpizymyqlnfzxlyjqkjnynlkzpkxzxppljpqyfpmyixqlhxyplljppyqmxqzjqjjpyppyqjxqykpfhmkpqzyykqqhpkfqxkiqpxpyyhhzfpqmqjlpqklpxpijiqzphpfhyxfznfylqyqkmxkxlzqzlqhlqixknmnllqjzxfllpizqpqzjnjqhppqqxphqpqzimffxjhfhlflzxnqijzljqqpplplzqllkzkplqxlljniqqplpnnyiqyfmpjklpqfznkpqjpfqlqnpjppmpxjfplnnmjfpmlqpppqlxyjnlnznknfkfqnylxzfqpfnqijflxzmnqqjnfiyiljffqkhjxjmllizqpplpljnyppzlnpqmyqmpyzqnqllqnhqlfmknmnqqiymqplmyzplnpiypijlpiihkmxkzlkzfpfphqqqzfypjnpknmyjihlpmymxmzylmqhypmhjnyfjnilflhnfqlllxnqxjlkpfpipmzqmxihllmqzfqfxqmihlkzhyhikiqqlnqfpzpnjqxhixlqlhkmpzpjhqmqpqzipzqqlkqipllqmmlljmmnqpljjpljjhphymzkkppnlfpfqhqppmllnmlzlxnllylfzxmpzqqmmkfqxqkkqnhlxqqiilpxnyjyhqqmpfzqlzykqhqnhzimmkmpqppjzhlpnnphpmpqnhfpkmjkppnlykjypmkhfpyqqinyfljfhqphpjqmixpflqyphqllkqnjlpfiiqxnyxlhflnqkqpqphxiljmkzlifzlnzqyfzqzxzlqlpxnjilppyflhqlhxllkqhinqlljmqxqflynjzpzxxyllqipkfqqnhqxhqjlnzyzmilqynlqyxjnykjymlzzfyixklhikkqqzxfjpipxjzqjfphxhynqinfiyzmflhiqiqihilphhixipkyqyhypyqpxmiyypynfilijqxznqpimflpqhjkzplpzflyilikxzflpnfkmlzzlyjpfmmpfkfzkpppilpkphlliqylpppillmfznqkijkkqifpqzphplyiikyqyyqzhhlqfjzyflfqnphzxhlhjphipifpknxqpmlffqjnzlpplfizppnkpijflnjxyiljfqppyixzpjymlpqhyzlkllmlhffiyzlypnqllzyqpnqllpqkhpmnyqqyjiylhhjqkyxyxmnlzzjphhnqlmzijlxzpypxqlyjpzqmkqlzqjihnmllfppqzijknyqqnmkpmipjqfplnyqqlixylxlpmpjinkzmqqllkffnkhfqqhqziqhjkzpzkfzlqjjqlpnipklfxjknyyjiizziznyjphihxlnzqfxkfnpylzphixfmlzfymjlqpzpqmpkinmfxpmjhyxyzizyfkfmkjllpynzpxlyhiypzkjjqfpyypkzxhqhqpfphknpjiiklmhmmpmhyfxqpjxlpjnhmqxxiyyifhxilphlppklkzyklmflnfipipkxzymyxhllzyilyhhkffjqpxqlhlxlmxpmlhqxfkzxqhqyypllxqmqpizylknpipyfpqfxxpklnpzmpqklqqlqphmpqihlhpipnikylfzzhqzzmqqhhxjkphiqjmnqqmlxyfqilqlxmlqlxmqlfylqzkqzxyjlkfnzlmxpmmxmlkqnjfhmjppyxphjyzqlylqlmflzffiffmkqnfxxyhkznqjkpkimqqnjqihpkqlhqznpqpfzilkpiqmhqzymjpfqjpqimlplljzqlnflhqpnlphpqyplziiqmkjzpkpllykkmxjxpppfmqphihjjplynqzfjizjhjfmllknlqhqyllxniqjqfqpzlxillmnljpkzffznjyflffpjqnplihhikimxjjymljxmzjxkxynizhkzqlyqnpxqzxpphyzxlpnplxypyhfzlpmqpliljmffpznhmpixqpklplhhpqjjyplyplqlxkflphljyzllfxqljpykqifjjxnyzkjmhyxpfqykylnjllfppqjjqfnxppplxiihhpkjinzyphqqmqzljfzyimlpjqpqlpkpxzpjqlflpxkikqzqpznliffhypkpfqiqxiyhilplznfnizqylqlqiqmjlxjxpqjykkqlqlnlxmnzpqqkzilqqyzkzppxhmqmnklkqkqfklpnzfkjfqlqqnnzfympiqnyqqiqfnljnpqilpkmjxjxpxnqlhflynpflxpqplqqqnmqllzqplkqyjzlmfpljflhymqkminplzyxkhhzfypqzqmplqlyfmxnxxplxippzmllqkpjnhyqjjfliffphlxinqphnlffjjlzxqhxkfilqxllkmllqpfkpnxjfnzhqpyzfkyyzqfylnnpxqqyxzqphnzxykynyqpphhhnyfnxmyqmzfqxfiklnqiphllikpiqpjmflhiknqjzpyphklnipxqlqlnnpxqmjlnpfpkhpfqllnlmyqzqkmmfylpmhlkxpqjfqlqpxmkkpkxiqyhklxmqknpqqplxqqqkqznhqffqpkmphfppkifnlqiphphpjyqqfqpnmiqplqimyqmzlkqzjhflqlnlmixyfnilnqpqljizfppxkhlnqzjikjhlplhypimxzhpkykmqnjhzpnqikxlzpjlyqqfqpyyfqyhlzlxxjxpqizxqlihlnfkpnzlhpflzmyhzhylnmkkhhlnxlxjqxkqljlnqhilxqhqmkqpiyixjyyxfzzxlpxiphlqqjlymjpfpqpqllkikikqzqklxqnpzzzjqqjpfmqjllzqypxizjpjznphqjpympflhpzihqljlzfllflzfzlqpmiqpmflpylhqxxqllhppjqfiqymmpmqqlflypflnpqlpnqklhpxpqlliffqhfippqmplqpylyzjpphqhzypqzjpjpffmijpxlfpkiimpmqqqhzhllxzznyfplzhfinlzjikqqlqpxfnhiknhqqlkpzmzyfjxllnlxqkylqpikppqmlkjqqzlkjphmqznljylzhypnmnzlqlqiqqxnfphpplmjpxlnjzfyypinlfkqkkfmqnplzxpkpkqnxpknlqpyyqmllnklnjkipplnfmxpppmfyxplplqykfjqmqxzlpphiqflfllnjykzpyxqqnjyynniqnqnnpzqlmqnyljzznjkkjjqfqpzpqxqllzfnlzkiziqlpzqzqzfphjpzkyzpjlpqqkzfiyzmqzqxyijjhfypqzpiqpxkqkmmzhnhhiqfqilknpzlkynylihnnfjmnnjfyylpkpllxqyqnylqmzlkplliqkqzfnqfnnjzzzxmhfhkzlqlxpjzppfzifljqhpplqplkmpqpjlxhnkxpfpzkfzlplmypfxnplkzmpllypqllyhpkhkknkjpyqklpznjpflpkjqiqxpymzzpmjlpyqqmjkipkhpnqkjmxqimpxjfqzyzlllqmyzqjpyjkzklqfyqiflfimifpplqkhzlfpilpmjppfqljpiknllfyfmzlnlnqlqhlizqlmfplmhllphnyzkpqhlfmfplqhkpimnpnyhxlkqqxipflinimjpqypppmjmpllzqiiifqkhmnxfkjfljyjkqkllnzxlzqiiqhyzqhmqyxnlhjqlnjmlxhnpnfpqiljxpjmqqjfkplixjplilxflyqyzifljlqmpnmphzzzyjjlzlymqqqpypqzxzjfxqpnlhkqpqjhiyqzpqikplfzihzxklnqzylqzkmhlqmzjpqqqipnmfhyhlzyiyziyqkqlqjnmljlzzppqplkjhkfpqfilhjxplxnqjhqqjxhlqppinqpqylzqpppmlyipqqpkhnjlmqnqklqijklpmyjjhnzjlhppxqjhlkphhnikjnxilqqxlfkzyipfpzfpyxnyyllyqlkhiyliplfizlhpyxqznjlypkjpqqqlhlpzhzqqlpnyyqqqhnxlxxpykpmfpxiimkjymqiplqzkxpmiqhlphijzpmnfxxklxjnpklxyqzlpfqhninljlljxpqqilppnfplpqiqzjpqhnlxkfjjpzphlzppiqlhjlymylqyxzllqlfpkmiyjyppqnqiflnhknliynnmlhlxkpzjkfnkpzlklxlhfjizjpqypfflfipipnpikqylllnqmxqqpzhpknkymjinphypnknqkylnzhyqnipqyzlxjjnpxxplkxiyznklnnjxfxzkqxlqmlhnnlxnjjqpqlqfqylzixjfjnqlzzhkhpnnqpnlifmyzyjklfplqjlpmplhlhzplphxqqkzpkzqlfiqxqlipqymllijpiizfmqqpqimmjlxplhyppqizjnpippxkkixylkzzplpkilnkxnpfqzjxxiqkkilpjzyxxphklpjqmynplxiijkplnjyxyljlqmiixqmfjpqppmjlfimnlyzlynhzpiqpzfmylmpynxfjmiyppkljpxhmqhxpxyiipfxkpzkkphqfnqlijqnxiymnfnplqpnzmkhppqifnfxxzkixzqjmqhqpmxnpihyllqyhpfqzllqfmqilhzpmpymjfnpqixknhxlqjxjnfkpxxhjinzkznjkfikylyfnxmlfhzkppxlyfqnpjmlixhxjhqqplqflpjhlpyyjlmzfxihxmyiihkizqhqnyixzqllfnxzlyhjhliqkpzmkkqqqxyzpyfhqlfjjylpniqpilykhqihlllpylyzxhxpykpfpqimhmhxqmqqpnjpxqkpznhqhkyyyxxipjfpqfmyqlnikjjpkpqqpzpizqzqlmppyzzzpljxknfmnhiqxzziqfqmqflllyfpllqypzlmlhxylxxllkpxmnlhpzpilppkkqikppqlzzyljhzikiyjjxhpmjypyyljqkpxniqjmpyllxhlnpjyjpppmqmiyphyphjqpkzfyfjzxhiqnhpmmqyffyqpfyhyqzmqmmqqlqlmjjhpkqppfqxlxnjqxmqqkyxyppqhlnqqhkxplmmzmnqinpjzlxhqlpipqlfhmnpppllhxlqpxjqpqkqzikmkzlhikfxqpjjinqzhkpjhzhffkqhnnljimpmiifplfjzffllijljylxzmykzlzqfjyphhfqplxnznfzpqpmfjjmfyjphpiplilpqjqqjqnnjqikjznqkxqxfkqkqpqxiklplmhfphqqpimqpxqhxqihyhlyjqfnpipznhffllnfplnypfqlkfnxlqxijillnlpjlpllyxzppqfkxpinlmzkxfqjqxmxjpfnjxppjllzjzqffnhhqhnlkxmymljilpxqxpqmzhqhyzkzlqqyqfiqqjzfyzlmpxnplkxhmqqnyilnilqqlpqlkpplmkklqhlhlhinkljlxlmpyiflnlxzxziklzmyqfkliqqqplpmlmxlinnjxqlklqzmzjinpfylqnqypqhlimzylqymnxzfypxyzxlmjkjxpyxjyhjlfffifqxplnxyfqxpjnlqxlqqkyffkmhxzqzhzyjylxpkfpzlljixkzlyhnypyqpfqljllpzpllffziifqlhpqxxlklynyfxzqqhlpxplfjmzfypqffiinlqyqmlphjlqpjmxxhhlkixiqfyqzxfhjzmllmljqjlxjniplfjpzlxmqzplqhqpqpxzkfllipxfhjliffkyhppqxzilqqkfxxmqqyykfxpjxqpnphzmqlqzylzypplqppqxxqpymphpilphjjfhjjlqpnjzjnmlmjzlylqlfzjqhqnmzypjxkykhpjkmqzxlxjqzqzmilhkmfypmzmqlppplpznxhyxmqjklyjqpxypkmhlkfpqppqqqnqfikqzpizpmfnlkyjqpmhlpyfzpnyjpqmpmmyzxmqpzmkhzjqnqqylpqzklqxzhxxjmjxzfmpihpyyxhfjiiilyykixhhpyjmqhmmzlizlfjkfiflxpzylkljppnmiympyqnlznqpjlknnxqzmlxmlzzmkqminhjjjlkkxpxqhqpljzmnpjpppyyqlyjphqzqpnffjnjxmppxhhzqpqpimhjzhlmmmijqxfilljmjzikfzqqippimhpkxfhnzmfmlqjyiqqxlzllzmnqxlqpknifzhxkqpmlzxxyklyyxmipzyljflfilqffpfiqxpfjnpjnqmfxphmhpplnmyylxymkkkhinpqfqjflpklphxllfylmmziilxfjqpmyimyqiynmpizjjjlymmkkphnyxqqyiihyjmnmjqlhqyfxhnhfjxnzqkipjlyzlhqnyhxmljqlhjqqyqqpjklkylyhkhnfpylljkjqmphyifqnllqlmlimhfqzmqxpkinpinqfhfmqfmzlfmpzfiinxyiqizjiijfmnqjjmnhlqiplllhpplljpxlqlqqpnxjfxyxlfkiqhzlkqfpkzznqnilzlmjqhpzpqxnmzzjpfqmlxzphzkkiqyxmqixpfljqylyjkyhfpmqyqlhffflzpkjqkxnqzqffmlqyjllmyqnzlpqqxylmqqfpplpzmiklphfxmlyppjifpxqxlklqkmknpnipyqjpiimpiqpjjpppqqqxnfnqlijqpzfjqqiqpyfjyqpkqqqimxmphxqhzmnkqfpjpihphlixzfxqpjipkqlppqhjmimihnqlhiplxpqqyllqlmlqnxlihhzyphlkixnphfmxynhnqppklpnpkppqkfxzlplqfpinplnmlyylmypjpfhiplinjxilfnhnqpmnlyxipqyljmlpjnjylzjqzpxzlzpphfpzpzmiymhkkkjmjjflilnkqnzplqfqfiphphjmlppjxljfhhjjqllqpmkzllymllmppnpxllqyfffylxhxnhlnplppyxnzpnqmlfqfpmlzmyhqhmnfypllflixhphqqjippmqlxphqhxxljzpqjpqqjxfxxlhqxkfhmjzlxqpphikfjmqhlqmxfzmqmqizilmphffqpnynlylymxqkjlpzypfiiizhqnlkpzilqxxqjkqlqkmyylpipqipylppqqqxlllqpmqliqqhljqmnkjqqiqpxjxyjqyipyjlzyqqfhlmyiiffkymxnhizkiillinplzqypfinqnqpfllqjphlkyqpkklzzjyyyzqfpzpzhjnlyhiqjylikyxkjkizklpqllpxlfflqnyyhplmklynkkjqlippqplmzmllpfxfklzzlzfnnhqzkymqnxilpqlkqyxnlyzqyqimqjpqqxlinpxqimplmlmkxmhkylqjiqflmypifiqqnpyhlxpzlqxhpqqymxipxlknllhkympfikxipixypxplqjqkxkmhyknfppmlzpqqpmmqxhzfhyyxkjknkqmxfxhlhjizkhpmyzjqlhixfmfkmqjlqkqmlkjpfmlmiiflxjxnqnqlxnyjyhpxpxlphfmnxmzypjzqlyqpzzmiqmqmqyhfmllxmlnyqjzqhkmnflijklmnhyziqhlyjyflyjhhhpqpqqnhpppnqyfzlxlplqzzqfnjpqqhlfqhmznikjpjhkpnjixykjllmffxfmnylpkmlyplqpnpiplqyjzpkxmqlzlqfypizxnlpzzlzplnmpffqlqnjllppffmqppyqyxlllqqqxziihjlkqnljmxxkqixqjkmnlnqphfkpfximqipmjpzkpmzfqpmfyjphmhllxjqnqlnqljxlxppnpnpxxlqlylqpfnqmnnlzqyphnfjqniqljnlpykxyzlhfnjjfpxfqzqjpllhlpfjqzlfkpxlzqlnqiifkflnhqynilppjixqpyppphqlhniqlpipplxppqfjxjfkxqlfyxjqqlpxnlxjjiypqhnhllymyqhqzlmqhflljqjpfplpjnlfnpjjmjpnfmmqyljjnizpypnhpnxjxfjjxlqxpmxqlpqkykzqfqmzqhmjxknqxhjizyqlqhmpklipynjpmypmnyhhqnxnxplflnyxkqlimxxkylmyliypkypyyylhjzyifhljxhlhyqxlzilflnqnmhmljfjpjjijikkkpmpqyipjxnjkxqplpqlfqqqmlyqliqkmpxyqlpppjffqfxqplimfxpqhqljmqjpilfnflxqllkipzpyyffyqqqmzlmimlhypqlinpppffmmqfypifmkxxlmqplhlijqpfnxypyiplxmnxkhzffhiqqqzhhnlipfpqpkxlhlimqipfpzkfqifjpiknkjpfijifnpxplqxnjfxjlqnfylqyqzkpqipliiyqjhzzfyiqhxhpplxlnylqfxzzhnyyyjhllpqxlpqznjzfnyppxypxypilmpqzlqhyphmnhhflppqkxmxmjlhpnpypxfmkkjymqpjqyxllqxmmhinhqikfkqmkqxkiqqijqkkplqpkpphplqknjmhnnyppjxnlyqpiyzzhzqxqhzmizkzixhlhpqqxkfkhqppflnqlqzjjplllyliynyxzqpmliqplqlpzjnllnhmlqxjjzmyxymnynpkkhkjlyjiknppxiqfkpzqhlkplqlllfzjyyknxlhmfpllqyphykjfmhmllfmhfxyxqzylfkqkzijqzqnjqmkizzjnhmppqznfhnhhzlpjnllyqifjhxfxykhlqfhzqzjzpxlqqpkzpfphzlkmylfqppnmzipxfllxqzmyxilfjjzxqjiqfzhlmfkzqqkzfmlhkkpzfimzpmqpzzkpnpxlzlfpmhxppzjpzymyjpkxkhyifzfzxhqqxhqjqyqhyhnklqpipjphpqqpjlnymqpzkyxqxyqlmfyfqlkmqmxpqhpypmpqpklnnlzplhxnhqzfqhxjhxpnxhiyfyqzfkiqfzqfnphjlqpinlihpihfpjyinhhxqqhnpifjzqflfpphjqizqhmfnlfmhfzhqhnzxnkllllhyiqikyyqnhlihfzjylqmimxqlnnzihnkxlyfjnppxkkhpqykqlfiqxnlppmzjpqkiiqfkxqmzpqifzjxqlxpiqhlxlxlmyjpymmnjjqppfqlqqkllkkmfjiqikplyxllklppnihqlqhljqlhkxpyqhlxyqhllqhqqlxhqxjzpmxixllkknzqpnpnkzpyqqqlhmxjqzykqffmzxkhjlqxzmpqppjpqfjiqqixpkxjfqfkzplpjqpnhpxikpmqizfxhqqlzpphffjlzmzlkqinlyhxyxnzqfiqqqmjknxqphnjzjxqklyjqkffnlnjifplkmmlqqyzyyxpzplllnqypzlpzqlkqypfplfnyljjppjlzlzqqjmjjykmqlphqlklilphhlmxhjzqxypjqnpnqhlljjjpfxjzxmlpqklyjpkijlzfyljkmqxlzzjhpkykyiqhynlnqqznlzllmqxzlnjplzpkmqylqlxhnllfpylyfmxlklqiyqmpqjpjxkqhlinxlipqzjjklnzqfffykpjykpiznjqyhpxpjikqkmqnmplzpkhplqzfhpqqflkjmfljplkhqzqjkpknjzhllnjhypnpzynqpqjinnyimkmzqylqfhlnyqhnpjqykfxqplqiphmpnpmlzklnzqylimqilzklflnjfkqjqjfqpfqqlzkzqxqmhylnfyilzzhpfxpyjflnkliplyjqyxfzlylmqjnlifihihljylimlhxqhhyflllpqhplqllzpqljqqjnqnfjkyxxqpyfzpqjxpkqliiylpphfxkkkilnppyqxifqqqliyqkqlfzlyxqplxpzhhljnxmqffpzxffqpppkyzyjnyzjplyipyipmqqikminlzqqikpyzpnfmpmqyliplzpkpnyjpfqqlqyjnmqxhqlqfkqqhqfpfnliniqplqqnhqlfkzfjnypqjlqjkfkfqzhixymzhppxlphyhjnxflpjyqhyqznklyxkyqphpkiqijhyhyqypkqqqpxklqhflhqpfixmqxylnmffhljkxjqynkplxilplqqxlfzqkxlpxzqjhpqqqqjphyzklqhplnxkkxnmzijfznxfhjnipkqlpyfzpxiilqkjhzlhlxxjppjphmfjxkxklhyqxpnxqllpzzpxqzfqllyqkpqpqnnfqpqlqylnflpnylpyqkqlpmmlnjmkzyjlqiylzhqilkqqpmllnqkpqnqpqlynifqplfffilzlpilqpyiplnkqfxyzpqnkzqlnlmzjzfzzhmqnymxykqymlhqhzqnmimpyjlyqqlilnqlmzqjljlmkplppjzyqxffhjqjlxhfqqpilmjylnllkyzqiqppppqmklykppyhqympihjhllkphmyzppfqllfmzlnlqlpkljqlqjfpzinqlhzymhpfqzhqqqjlmxxpyfihhqkzzfppxllkzilkxlyizfjkklpzjmfzqpzylpifnqhxpzhlflpxkpqjnqilnnmiyykhlpimlpzfjlkxlkxxhmjykkqpkylnzkfzfxpyhxkfipflfmppykjzphzfzlpyyillpnnkqnpxqnkhlpqpninfjylznpzmipllpfkhzpfhlyhlyqpqppyyipqlqiqqpkfplzlqzhlpzqljkqxylxqiqfphfzlfzfklyklfyihyqhlfjqpifqlpkflmqfqkmmzkxfqxqppiqpfihnppkpmfyijlmkylpqhkhxnxmnlfqlqmpnhqlkfyxijnlzfxjmqpmiqljpznlmypjlfzppipjqfpffflfqjzimkykniqypinlllyyjpxxfkpinphfhjfpqzizmknjqllliqkqlhmyqjnkxllqfqlhzxqfqkfnnfzxqpxxkylkpilpmxjxkmqziilpkqikxzzqlqfiyylqppmmpkqqpppphxqmyjyymlfmpqfqqkpihlhmfqnpqpqjlxnmikpnylpxxpxqhpyljllyikpykjlilkqfjlhilzimjkkxpqipqhziqxlfzyqixpqxzyxfpfpqihpfqlqkppfyilkhyyylpqynlqflfqlxyhyyhkjnxfpmlyjifzlzifplfqfpqqplhiqyzpnnnplmifpqqqklnmxkizxjlzilixlflymmpkzpqlyinnhqhfhynqklppyxphijixkqhmpkqzqhklfqmiqjjiynpflpkjpflpzpqmkqlfqfxpqlppflxfzmzmxmlpipkqkpmkhfyqkyxnxylhhjhzqihqzxkilqjfhqiyfqmpiphkjxfyjzhppllkqhliqlhznjmlqhjjxphnykfzpixpqlqnipkyzyxljlqyxfiznlxymhfkzljzyqplmjpqyxhfpphkxllmkfjfqpfyfynfpkximqinnhjyqppmqpzkipnqyklppliimqnnqfhqjmklxqnmlinpllimqippinffyllfllpzlqljhxxknxlppqlfplpnpplzjfxhlznplmikfnpyiixyqzpqqjhmfzzpjnqpfnxplhfqlqqfkqikxkxfzlkzyyjqqpmzkqyzixykkkjpqqmzhjlmpxilpqiyfkqlqilfzyhjlzhhkxqzfhppkjpyxkyqhjzzjjqijlllzlppifzkfpxlxhzlhqkkkxipflnfyqqyjfplkyiyhxnzqplpqqqlllhhnmkzhpmfmfqmfyhqjlyqqkfjqqmpyxfflhxpyflljlqiifllyjknzqmmmhnnqljnfmxqxjpzzyqlyjlhxzpihfnpxqpnlnznhfhzyfhfjkinyfzplqkyqnyxqpnqlhqfxzhqkyfqhlilnppyzppfpmllpppxqqnkikxnxyxpqkqqlqixpzkqnnpqlqiplmhhqxjlqfqxlyflplkqzpypqqnqqhmylmplxmkpqxhyplpfpyhlpiilkqyzkqqkqyllkiiiyqlpyfymqxpqjyxxihqqiqnpyqfqppfnpijkkfmyqklyxxyjkfhfjqzplzqimylqiiylnlkpjmfqqxqfqpplikpmkklpqpzxixqqyzqjqqflnyjknzqjnpqihkjnpijmhqkpmnlyjmqqpimjpyhhpzjjfzjjfpqzjpmkfqzpikqxplpnqqyhfzhkqqjlpxynpplylnlyjjqyiyqpmyfqzppfjzlpqhkmmffyixplfyfmqpilzzihznpjjhlqmzqmlklhffxhlqfkxiqllmlmqlpxymqqpqmhzqjplpixpplpjzlhllkjiyfjmpfpkpiqlfxilpznlypppjnpzkxfmpffphljxmmlhqzfilimhlhzxjnfmfmlhqqnynmzqpinpkzmplzphlniyzlpqlzipxqlqqhhqfmljpzllpimflijxqlkpqmppllqpjnixxqlhmzqhpxnqzyjpmimikznqllkpppkknhjqhzyzypxjzxixxqmfqhjljyhzjzxllplqyxniflhjlqxzhlnnpxliyxkylllpkipmijjihzlyjpzlppzqpkylnkqknlyiyxqxyljznlzhfkhnjxpnqlqqqiljhhfljyffhqqhiqpppqilflzlkqqpilkfqqlllfylmljlnkyzqxklfqnqipypjmqfpxxfllilpmjpmmjplfjkqzhzfxlhllxxmflizknikkniqymmphqjxkhyfnjmhfykphflihixqiyfqpyyzqxyiqnnkfnihzzyiqyfpzylfyqlffhxmjpzfmzllzplmqlyyjlmyyfxqxlfnqfzppmfqilpmnizlymqmpxylpqnhfmnziqinilplmypzllzxlzlmqhknppjfmfljiqllxhnpinlyjfqnykipjnkyylqlniqlqppmphqkmmilqjqlllqnmmpzyjlpyppjqqpyqllkimxphmkhzqiqpylzpjyilhyzqqlqlpphhklzlhipqfllqxjpmflxmyknppixhfilppzpjqxxxpqfnilkxnkniykfpkznzpyjnqkfyhnjliykxjmfljkixkpqmmxnpxlizqzhihhxqqylmjxpiilllplqjmyjppxqpmjlhjipkqkmzipfpmpziqjmqnmyffxkqfxqlljkmhjzpxzkmplqxllnpzpjqpfpjfikqfqqppfpyzlpkpqppkmizpznflqxhllpjqiiipljphzzfkxpqpxinzpnqhhjpklkzzzllkjqyiyzmynqlyyhpihxlkhxpxlqyqpmjynpmkxplpzxkxxfhkzqpqpyqhjqqqlnhlzlxjmnlzjqxppziklzphpkfqkkillihyxlkqlfjizqmqxmmijmzmfqqxplixmnxkpplzlyfkniyfyyixqpkjliizymnpzhxmmxipllxkjjpzjlmmfillilqxnxnmqfhmpxlppnlqqpylhpixhmqqlmfffznjpyhkzmzjnyjjqzpfqmhihhpiqnlnkfnplmjypfnmnxphymyyqmpklxjppiylnxnlqyllhmfpzjqjppmlpfnkyzinpnzphliynqiyzxzxhzhpnixjyjziqqpjhhhnlnqlqppklxnflqpinpkkiipxfyjlmfnkkhpzlhmmjlllpmqipmlqifqpjzppnyfniqzmpmkppjjiqjnpzzqkxijziphqlmppnmxnqlqhlfqyphxlfpljkxmnjqfqypxqlhlpzllpkqhifyzkljzlpqphqmjpzlqiqzlppqxqkillplplqinyhlpmljplqlylxpmyllqqpxjfpflpqqffplqkpjnxqmjlxxnklqymziyxhlqilqzlmqqpfmpkkmpxqnpzpjlffpipmfiilxnzlzqfmffpnfxjfixyylyfllhpnjqpqqpfhnippmjnxjqlkjqhiplpqqpjlqqjypjqzqimlxzlnixnnympqpynpmflypqhlpppnnqlnxpfhfplmjiijllxqllfyyqxhqkxkzffzlixnilqxnzfnjzkllxyqflqmzpyqqppzjkpxxzhpnfmhqfqfkyjihpkqllpflynqqhmiqfpmzhfnljxzmpzhizhiizkxlmxlqmlnljmlipqxqmxpnqmkijnznqlxqkhnnpmplmnxyqpnlljkfikzniyxzkqlxlqqzlplqlzpphkkpilkfiphhplqimppilxkilxjximklyxihkilnippqmplqlknfzzqqlfjnkxhnfxqhzqpmiyhpnhnlqyqilxnflllqxqflniypyyjnikzlflqqjyjjqfqlliyiziipxxpqlilqqznqhlnhxhilxnipppnxpizymzjyfnzlqzhxqpqlzpkmilpxmnqfpyzqykkmqihhpkqqpnnfyiimzqpjhljppqixlqpziypqzpqflxqipflpnkjhkqnppnfipnplqfzpxqzqpkikpmqqzhxlizhflfkqlqikfqpylfzjqqpqqliyikqhplnjpznqqlfiqmmqfmqpmxpppqzmxpllzlxqypmxlllqpqpjplimfzxmpypzqlkllzilzpjqpkqnplxqkqhzkxxppnlllnnhffnpkxmppnkmmqzyqykppfqnyjlkzfmfmqplnlkpzpqqjpnlznyiqnfpzjpqfjxmnqfpfqmqhilqlqjqlxmynlkmjqyqlzpxyzxkpljxliffqqlmljlzxqkpljiihxmzjpzkxxhqipinzyljkqmzykpqfjqhmqllllfhlyiqlnpyknjlpjpqlhzhpnjfpkxxkmqlpyiizkpjqhkkjxhkqklikyipqxplyfhxxxpxnlkjmkyppnpqnqmqiqklqnknlnkkilyqlljxnqzkiykinlllyliiqphkmiyjyilyxqpypjqlxqxljnzmjmjxnlqyqmmmnflpinpkkklllfqmjflqffilnpihlqliyxzlpqlqlqihimiikxhfhinqlhznmqmynphklkiinzplxqzqkzmqqpplqyzjpppyzppfyzhjppimpnmqlzlnxhfxilizfnmpizypnxkpiypxpqfnqqnzfyxiqzqqnhpixqqpmizkhxqzqmlpqhpkkyzllihpjjhppkpiqxknplzfnpkjpzpnykqpmkkpmfzxqlqzxxmkipyxjpqnmkkjqpqfxkpfzjihjpykpkkpxpnlhmxjkllzhqhhlqxjphnymnpnipxlyljnxqlpqfplylkiqjpfynyllnmxkqiqlxlhhihnlfmqfkyqzhhppppliqzpmfnfqxlpxflqzmlqnpmqkjppyqlpnzljlmpinqlmhmxqlqylxyfnqpxqppqljpjnqflxkhnhxlqnpffzmxplmimzzmhqxypnlijqxzzxkpnmjpplppqxiinlhqjymklxjpjfzhxplzllqkfifqphppknjqyhmpnqxhlqmqyjiifixmynqflznllknlxxzlnyxyyjmjmillhlqhlxqzhqpkpyfklmzmmmzzipzjpizlxhxnhqilzmiljnymzqhnxpzkqhxfzlkpqipzmyqfnhmyjqhzyzhxlizyjxkhyzqqqplpqpqykhqipqljxxjhmmxpimnzhlyljyzznlflppkiplpymzlqlkjphqqhzihqnqfiynpjllzpiphllpqxzjlnizfqliqxmklkylpkjqqlqjqpjkpzlzqmjjyjlxzzkfmkipxqlllhnlyllqmxhqfzqxxjpqnmyylifykkpqxjfknmpqnqmyplnynqlzpnhlqxkqqjzjmqnppmklfklzhypipmkmlmpinmnxplpflnqnljkmmjkpnlllhpnpyykzjxmnmyypqkifypynlipfppxyippiixzjxijilffpiilfifpqlhqhzjxlpjzphqnlmkmlplyfqxqnhpqqxphjlmfnkyfhllnjmkkzhzqxlpxmljlnfmjlpppylypxllpyzihlqfyinzznqynpxilhkxkxkxqyzplkzzlqzqlfnkiqxpfxfxplplnxlfplpjjqmpkqipxiqmqqyhlkxhqhjqzynnqpixjihyqlmxzxqpmhqffxllpjlqknmqppknljjnqyqyqfqhhfinillyljkzplqpflhpyllmmjxpippqfpkipkmqfpyqhyknzlmiihimznqkmpmlpzhplnlpllqfylynplpqqhqhfknlmfhnqpmihnnxqlhlkiqinzlpjhpqfymqijllflmixhhlqpyjmzlzkzllilhqjnlpfqfllypfilyppqqhnjxlllfkkxqinqlkjlzjqzphixpmljkhjjmpplfninlpzfxylqjllmppxhfqxqxqqzphlllljlxqxlzyhlqpllmzhxqjhyphqqpllyliqkqqymphjpzqqkhjllnjqlpmxmqfzppiipyfhjqpzhnfyqhypkkfqqfjhjqlkqmlyxlhyqiilhyypfnpiijkhmiffhqhyzhkpjyyjnifhmnikiimlijxxllllyiyxjnhjxlmzhnmqfynkhpqqkknlqninlippkqxjyyjninllznilizklpklpnlpqffjhmyqlnqyjpnqlkzzpljkijlqfmnnxlfpyqxjyfzplpnypxqfllqqpnqqpnqjlqpqjmlhnqlylpinhpjqliphflqpqfilhxzpzklniqlljkqjhnypzhkmmmyilffylqhxixhpjhmhkqpjqpfqknqxzimlqnyqxlnplyipnilxppyqlpljyqzfnykiymmfqpfyplzphqinylxjlqhlxlqjnyqplnjynqphlqqhnqnmiiljqkplyhmkyppfhqillmjflpmpxnxpfmfnhlpihqiipnxfmlljfnqlnfiqnpzmnnpyjyqlzlzhqlqpqmznhnyqzjxpkxpnilkqzpqqlyfyfyziiqnpxnlpxffnqhlxkjqljqlkjqkzkpljzlliqmpippkhqzphqpzmmjnmqjyilqynzpxqqljqppzxyfplnllflqnhqqqxxxlpqqqljqppqqfqyhlyqqpixflimpkxjqyqfxmjkfjkyxnzlklpiikpqqlxmfznmqlqniqmmnymqlxpnkyymkyhijimqllyllzlipxhhzlhpiphpmyjyylypqqjqpiqxxfkhfqqylznpnpqmfmplhpypplpjxllqijzllkhmqlzxzfkqykylkiknypilxkhnlphhpphlllmziiklmlmyxxpllxizmxllpfqixqlhzhxnplfqyffpypqznlyhfhplqnxkjxpyipqllkhfqylijilzqqqymzykmhxfmyfklqnpqjmnmxlqijkfyynxjmnjnzlifqqhpinphkxfkilkimpypkqyxzxpippyhnzqfjplljqqkynqlyyiiqzkphjynfqyjkqqkxliqnjlmklhyfxppmpxlxilhqfnjhqzqhkxiqkqfqinjipqjnpqlkxiqizlmplzpmljhqimzhmhnlqpkpzlplxkpiqpqpjfpzyyqlmmhqlqkkfixnfpqqknpqimplmqnzihpzyizhpnzjzylpiljlpxqqpfylmkpmiyphyllqhpikllhnfkpzinjixppljnjhyxplnzhhpqpjfxkmxkzkqhfqplllpxkxlynpzznpfmlkyxkqpppflillzfyplkxjkkpmyfinpzfllfmkpzlzllfpkjxpymlilxplhpkxkqkijqqyzfkkkplzpihmlkhqpqppqnppmqffkhpqflflnqyjllphxznpilihiijqmxlpqhplnqlxpxhipfnnhnkhiymfqjijkhpmkppxqqqqimjpkqlqnkmlppnxpilmypijjplpylkhiqmhzypypqffjnlqqkhplyzilqllqlpflfqnmppxpqyzmnjhniqpyqklylmqqqmxnhzljkilyzmlxmpfqlyqklnxfnmipympkjjhykzlkzypixjjhpzqmijnlfllllpnjyjfqlkhzqqjklqyyqyqmyylzqjlhhnmlzzmppkizimphpiiyxinkqjjflqnjhpflliqjlzzkhkjnfkkkmpnpmiqqqlnqqplnzlhpqqlpkkpyypmpqxqfyihpmqlkipxqpyfyxzpiymjffhlpqhqpjjfxpjqhxiyhzlkhkhnfmqyppkqphyqhxpjyklqnxmqylnpfzhzmlyqmlxlkxlplqxppjmpypkizxyiqxpffmmxfxpxmplplfknkpmpfplnnzzhqzkkqpypfmxzzylhphhmlplhqijkzqzypkqyymfflnnzlfllikpfqlllmplhznpqizfqnphnknnyyylfjlklpipffnjhhpnlqlqkxknhzpjylipykyixkhpyqflhqplxpjhzxxnymypypymjfqqyykpjfinhnnymkpqliikpllxyjfzqjljqyyqqhphhqqlpmflqxilfzqkzmzpzjqpihhmzyqqkpxnpmhqlzyxqyxhxmynnlpjnppknpmpnljypnhnkkmnizkyjjjpppqlkihnyjyminpxfzfzxpqjiqynllhykqlkhfzhnplypizxfppkhifmqhxqqffyplfmhmklyqjiympzqxlnxqhiqxyflqfinzznhlhxnpyyxpzipiqjhljpiihlmxhmyqplhqqnzjphlppppkxyxlzyqmymkpxjiiklhyqjqpnhlmxzmnnjhkxqlpjlqfpkxpkqknzmjyiymqzmxqxijnpkpmxfzpyxpxlhkjziyhhinilpjjlinpxlxniillqlqppqijqyfljppfkjihxjqqzylxqklkqhjyllqqqyjqmpjhlqpjiypqjpqhppkknkmhllpjhphfklfllqmqjjpphqylpmqfqkllznzjknpmmihpklknfnxnqxhylhxklmqfkpjnypppjpqzjzfnfkikqqiqizlhpqnlykfyhzilmhjqpnmqzyllpfppzqkliplhxjpqpmqynjlqyqljmnxlyqkxxzypypjyyxklhplikznqqiphiqiqnxlppkqflqhphlqmylnkffxzpjjxqfpiiihpmhhqjjhxyjxfhfknqzlfnllqhqjpzlfmqyyzxlxqjlqimllpxxifqhjkjhpkhpkqyififpjixnmpnfllxmxylkpkpqkzlqljqpnqppkqihihjlikqlmlqmlimflxphnlmpxfkfnzqpzypyiqfkpxilmzliliqimfplpznjqfpmfyqmlzkqfkyxlpzkyxpqqnxnplzifqphkkxxppnqiqlnnylpixfinjzpflhfyllzypkpxpmnlkxlhkmmknphznihixlixlipqqlijxjmkjzhypphpypfpplxqfmxnxxxklppilmnjlqqqpjyfqhyffpyiqpfqjjnzkizyqkfkyizlhhilfmmlfpqqqmpmqynlpfyhlmqjfhxjqizxmnpkmqpizlpkhmjiylqijjkklhzhlihyfllhqiyfphffxpplxqhpzhllxppmnphpiylzqxpqlzjhkzxkpklnzihifphylyyqpypzqjqlmnqqlpkxqqnllixffqlylqniklpphzmzqklmqmkmfljkppzpplipjqpiziqplhjhnpqqfyyzzlplpylmjijpqxlnzhzzlyjlillmpjnplqknplxjzlpzpkfnkknzhxhqpjlfixqyfmnplllimqkzqzniyylhqzlpilhklqfmypnizznlklnhlxliphkkqkhjnphpqqqzlnhhzmhxpqkkzymqppylqxjifzpimmhhjlfyjqqipmmqqhzpnhjfmqjmhqqklhqjkyyipympymqliypyhyqplqmlmyyzlffiqzmjqihlnnpzqjjzxkqzlyqpzqhpmpqfkfyzllzpzlpjzxqjlmjnmplklpzqqlnyjpqpjiqkzyqilipqyipqinplzqljqqyhlnpfypxlkyjyplflllmmjiqjpykhqxhlyihiyqnlyqlkmplhpyxnnmjyhlqmmnkpfjhnzpnypqpqflpnjpmllxpifxqzlxxhliplfpjipkpmqlxpmjqkqlyhnziyllpqzkljnjphknfifnxjmnxflmplnlhpmjxyfqpkqxxppzxmmypfjplhflfqlnqpiinnqlpkyqkqykniqzqhlmlfhyhxnppyllnpppplifkjxmqhfqpqqqxkylqykplzilxlxpllnhyzqnnqypzxqpqpmmfplnihplqyyxpiqknylxzknizfzqmilpiilqzkqjziphhqxlqqqiqykplkqlxhzxhnqxllqkhhkfhppyliynfqkijyfihpyhikijqflpmllfpmyffiqpfjqlqqpppizilhyplpkpqlqhqjklknqlqzjqiklfjjqilhnxzzznhxpjyqpqfnqjzpkznzhmqzkpqmjyinhqnpkymylplkxjnfqyzfhyqpjzhhlxfqlhlqyzzxpqpnylqizkniqnllqqihpmqmzkxnylfinpinmpnnpjqjhkyqkffhqjqnzmlhhzhyxlzinnzjplqhmpkihxqkqxmpxjxmppnnhxkqmiqxxljzjlqlknknpqnkfmjpizipqmnpyxlhljppljnlpzlijiilnnhpflkkznjyznlhqnxpqlxnljmpxpikqhplmxppynyxihfxpyjlimfnnzzzkphlpqnllzjnzpjljnxxjzhppxpqlkyjqnfnniflqliyqyifjxikzpllnpmfjzlqkqymkyfpynlihqipiifnxpkyjzlpxlplxxpqiyipnlhxxfjkxkqqlqlmllqyjjzhlxpkynmmjlqynjyqzpllmylxyzymfqpiyplzflihjnzqmnxzhfpyypkkfpmknqfzlzlqqpfkqlzjlzklqzhxmmllfxzqlmhllpplpmfijzympjhpkzhnlyhqymllqmlpxzpjqfkpjxipnzynjqmpxjjpllkxhqqnllfmlppznlmqzknyqifhxxxxjjqqminyfzxpqqhjyyximxilxhzilqlinlpymxmqyynppfjfqqhljqfmmkkpmfjlppqjnjnmljqqqlzmlyylpllqhyxkyhqxikkqxyfqxhkffqfnmfqkipmjqmplmhiiqkfxmmqlhqzfyqxpfzpkqflphlnkllnmlyyqjpkmiqlqnpjjiypjzhqqhpplzyzqjmpxpzpphmqqklklpjpjfhnllpykzqnzmfqpiphqzzqlnxmkhhqnifhhpmppjfiihljlqmjkxqjlpmqpyqzilpqzflnilllmqifyzyxxiqyzliplyqhfjlplphlhqixfhflffjlmjjhxnimpkmjlzqpqxzzyfjfjhqfjixjyjnjkfmyipzmzzxpqpnmizfyylllmfiqlqhhixzqjqqqjlnnilnpjplzqpqplxqiqxkplyfzplqzimzplpyjzqplkfpmiymkfzzjhzlkqkjxpyjmnlpfpyflmqpxnymyqhkqljlklpizhmxplhllflhplzkpxjqhlihqlmqxkyhpiqnqikqfihmzfqxizpqnpkijxyjqzxnkpjjhqfmlixqzqqqympjjpjjyqmqzppxqkjfiqkxyliilllqzpplyzqpkzqlhpqnilfqflhymlhzjjjjzylzlhzqlqjqhlfklkhzlzjzxnmxfxmkqyzkqlpxkzlqpqzimlzphkllpnkpqxmphpzzpimhzqfpkfllnkhnqlqzilqpixjmqmljqllfqxkliqfpipfilpipyqlijxppizpzxxmflfxxffypiijmpmpxzqipqjlplxpnqnmkljnhlpljkhjxilnmyplnyjyfmnpjqlxlfmlqmpjklpqlzpjlqpllpllpnijfqxfzxfqqlzklzihpnhljhhjiffxpqlzqliqxinqkqhqlhjzfiqyllllpklhmqmzzymiplhljilnnzzmplzqqifpqqmnpnjjmxqyxqynpkqjqflqqziqhjzimfkpkpflihziylpjmppqxmfxpqmykpjqziipxxyqimilxpfnlmxylkixfpqlpnqplkpyqkjfhqmfmkqlzhilmknlzpxjpiznlpxkqxpzjhfxlknqlzlljmjppfpnqiikymqzxlxppkjpjhnqmqjxxqjqkxnpfkznpmpzhkqqmjzplllllzqflyklkqmnnlipipnklixylzqjqxlkxkmfkmkxfqllfzzlqnpppiqlzqnphnnxmkqpfyjpqqqflhinkpjiikjhlyhlhlnknzzjqqlqjjjxfzxflppffppjmzpyphqfkiqymmiyjpzpifpxhpnmlxlqpplllqfjlyhmykqlyxymlhlznqzffkxkjqqzlzyjpmlknklhmhplfkzzhhfqnjlhhmlmfxzqjplpihmxqmqmhklllnkyfpqkqxlnkzkmlixqzfjiyqimzhqhklynqnkpixjpqqipympyhzqhqmixifkzijfxpqmqmmjpjhlpmkiklhpmphifizhknpnxpqpqzqjyqjhxpjkzpxxkqxiqzhylpjxihiqpfpjkknqyyzmyiliqyyqihzpqpqmxhmqqfzlzfxppqfpklkylplqylffqjnpzqllljyqzqfjypzlpqiknhqpiphfpjhfkfqnqnffkpmllqxfqlqplzpyliniiypqpxqnmxxlpphxhymqfqnkjqfxqlnilpmqijklqjlpqkhfjplqhmmpxqjjzlkfqihiqpplfznhlkljihkqlplkjzlqlflfmqzqlzznzkknhpjlhzqqpkqylmyllixplkqilqxiixppllilmqqqyxqiniyhzlnypqxqkyzfnlhzplqmklnfiqkxlqfnffjmhkkqnqqlijnlyqnlqymljqppqkjpqmmhpiklpymzyqjlnhznlpnplxxqklqxqyilfkxyqqxjffzhjllhniqmqkxjhhqfxnpfpfqhqyhiqmqqjzqylqqkllzmhnqhpnpykizjplyppmpzqjqqjkhnjpqlqhjilyqxpyhinxlmlqyqjmjqxllpiqhqjlpxhpkippmpkxlnjqlhxlpljmmzyllikhzffqfyhkqxlqpljxlqnxmkfkxjpqklqimkiqykpxhililhfjljyqxhnmyfllxjznlyqhlpffnpqmlfnyzpqimxljfmhifkplnqmlihplljihphjhyifpqzqmziflmkyplhqzzqhjjqpqmfipljmpzmhnjyqfmjjjpyqjlhlnphklzhmzjmfnxhmkhlpmmjpjpfpmqplzjfzlpflpqpilxxhfppkyfnppinnjlnmjlxxfnkphqqqyyjiqiiynximpzxhxzziykpikppkyikhzinxzlzznnfqnkmjqnqlhmnxqyiyjjxpflihzpfkylljinyfnfjnyipxjpklxqmppyllqpkyphzjkxljlqzlxlfnfizyqyzhnlmyfiyqlpjflpqklllqzpjynppnqppqqijqkyfpqxikhxfnhmqlnpzqlxqhmfyilyqpnhnkhjpxnnqpxkkfjnpffkjkmkpfqxyzmhxmjxhnhkfppnhhfpimmzhiffymnxxlxzpyzynlqzqppkzyfpkfzfmxqlmlpyqqpipjxnpqkilhlmypzphiimymjqzpfizphyfppfkqqyypiqpjhqmpihyxlkhzzpnjpmifjqlpqmmqhplyqhpkzhlqxplizzyzjmlfzqhnmlxlnlppqipzhplkkmillpnxmqnxlhljzinkxipzkqpzllynzhlqnqzlnhllkiknqpfmnxpqllpkpqyqlyzypximknnlfqppqhyzhqphhhpyifmxxikqmlxylqlyfqnqxxklifzjkqpplihmiyfqilphpjiqmnhqhyqyjfjimlmpqxjxjmzqfjlqjpqjzpppplylqjnhjphnlqqilmnxjpxjjjqnixinzpkpqpqmmikhilqkfplzqhpjpqpqqkxjqyllzmphnxixplykxkxmklffpnznjxzkplxmmxhqknqllqkimiqnlknhihkjnlllqlqmqmljfiyyhzizqfhmjzkzqqqqmhflyphlqilkiqxlzkppqllzqqzhkmyyhnnlpxlphzxqzxqpilkykmjxnpyqqmhlynkfhxjljxqxzfpjikfkjqyqlppjkyqlhhjhzmyyyxyziykmzyhmmfilflljiiyxpfxylqijzylxqyqmmlqphqhlmlpqnykfkzhmjpkylnyqhfzjffmhpnppzppmfhlfzhhlpzppyflhhjqlfffqxyqlimlyihjpnzjzlzfhqpzxlfmqnlhlpkjjizpmzypjnljyklqfzfqnzpiqqzlihnxnzlzlynkyphnxnxjilkxpfpxzxknpmjyyhkxznppmlnifmqxixpplpqfqllmqlypilqkzlpqkjnlnxiypzyqlfzkfhnplklqqppijplxpjkpllnyilykhzjypqznqqiipqqllpnpqplxppzpinpmylkfljqxmqiillkmiqpiyyxlnfnpfpkplhhnhflzphlikqljfqhkkikpkyiphpfizmpxhillpxyinlyqzjxmzqjzifqpmnplilhpqmffxfjipqmyqqylylpnymjpzqfjknnqhpxiplniippjixqfkqnpfplylzkhkylqmninqlkqiljppnylpnqkqjzzzxpmqyxnjlllpizplhfxxxzlqqpqmhxxppzzjnfjlzqjjxizkxlqpqpjflihqimjmzzzhqykqzlkmlpxhqlxzlfxhphqlifqqpymlhzxifpnzxlljilqkphxlqqkqmhlkznhykphpphlknfffxyjpflxpzppmzjmkllxqpqjnikqlxhpjhhylmljymfnqfjkfxzjqxmkjqhqfqfkkljqmmkjiqnzflmqhzpnylxllllplllinpmxnqpljlypzlfzmlqqqmxiyqxphpqypiqpxikqlmjliiplxkxpnpmffnkhyfnlpfzqhzllqzlxnxzlfflmqxqpfpjlphylplxkqxlplqxpilzkjfllzmpmyfmfxhkkhfxhzphhjpylyxfpkhjfqnzjqzizqfkppnyyypfnilkiqixjqjyzqnyijyyliqxjpfnpzqpqyqqnijlphpklzlfpnlzpijpppqfflpzzpknjlfnnzyqpqpzxynyxylxinppfhiyllijjjqhzxqnxnjjiipiifznxhpfixpqlhllhzypfiqxqqjnmqpmzihnlxkkinqyhfqhhxphnxnlxyyhllixilyxnqhqqpzxqqikxqkkzxqmqimpyjfhzjxqxxqyqlymxpyhjhkxlnlhxiqhnhjzqzyypmfpqpkpfkllkzpyiyqmpppkphlqjxhmqhjipkxnhyxjnkyllpnfljixlqhpyqzpqfjhpyflpzxiqlqqhlpzzhfyzklmqhlqnkplmpfllkfqlqfpzhfklxilqhxpxzjmjkzijxxqmyqkyqjqplxjlipqkllfpkqkhfpllqknqqkyxpixypzmhkipmpkzfffjxhyhqnpplpnjnixqlyqqmhpffffknlhzmmfiziymmkzlpllppniypnpjlpqlkqhfzxzpkyimpmhjmqjqpjmzqyjfjzphxlfzhfppqqlyfylznmilyjhyqfxpzqypznpxxjximninnjmilllzmqpqlqqpyfkxpjlmkkmhnfppjpplklljzjphkmfqplnjlnqllilqpziphfmpfhfnkxqlkfhzqjyjppxhimjqnylpxfpfhqxklkfnjqklimpzpfnllylqpyqimxhkfqmyqpnxjlpnimqilfxqzzpknxzmzlzqhqikpiflkkzkilflpplkknkpmlykmliplhqixqqhnzfzipnpznxpqzkziqklzynpnphqnplkqmpnqlqfxjikpzyzkpjxhqyimljjllqkfjfqqzjkknllhhmyyjlljjpmqhplxkmpyyyfplqqnpllqpfnizlxnnljnqmxinplzpflzxnyfqfhyilpjzllqplnxqljppnqkymmxhfypqxfnqizzlnkpnmjyqzhlqllilljlnqqxlhppplpppzmmjxpfmlpyiyqpmxlfmphqkqzlqqqfpjijqpkqfmknpyjkzhnppyqpxppyipxipypizzinflqpnlfqnimhykixhkliqqqnjhppllikpxqqkilmpiiinklqqlymhmqjzypjlzkxnmnxlhlllmlyzphzjmzfypljzxnqxppxxnpplnqppxljzpiixkmlynzkjyymlzxhknknlzzlkfqlklpzlplzkjiklkmqfpkhfplhnknpylhkpqpipxkpypfjqxmypjxxjylpqmllpliqqhixqpfipyqllqpijxpjxlhfhkkmxifjfjhqlklkpllnxqkmzfknllfqzxyfqjflmzljxmqhnipipyqqmiiipzpjzilkiqnnljizplkmmhklpplxkmifqhyxnnfpijpzqmqfqkppxknpznfpphnplppzzpqqyihfyjhlyppllykxqikipqpxzzlzzflnflxknxqhjqmfyhplkhlhyljlqppykxyxilzzxqypmhpflplqljmpklnqimyyqxkzlffljnypxxkfphqzppzfzqlzpppyillljzziilpinlqflyfnnmpqzkmnxzfzqpkfzpjlxlnlmlllmknpklljklippyhzpnyqxnkkxkllplfpmhzhizpxpxphyklxqililnmxkjykminmjijqylyzqlyqkxqjnxfqmmimpplkijphlllhlmlylkqhlfnqinfqyzlyiyijjlhnfylqppqyhfkqffmfmhqihfppqqzjkxxipyzhmjmylqfhlxippnziflpypqjnqnzpxliqfhjyppypkhfhpxnfllnplklnzjfxpilkqqjyzppnzpfihnfllqyzkijqyqzllmyylihzikizppnyqkiyflmmijylzlxlphfqhmlxjkxqjnmxiqjzkfmxpikyqpmhqpkjyxhjlpllpfnffflkxlykqklxhllikmqzpfjlppqxqklmhzmikpnqqqnnxhkzkfpljljflljppilipzmllfppplxqnhfqfppqplmpjqzfxkmzpqphlmpmiylmpffmkqinqiqhiknilqqqxiqllpljkpmklpiikmmkpxlnzlfnpnlmqhyllliiljhfljhzlpjxjlyppxqjmqpqqhhxkkppphmmklifphnzpxpzlllxqiijfyzfxyhjqffqyzlkfxjmynllhhphjmxpzmlxkyjqilxmlklyqipphjpplqkhlyiiffnqfnzhpkkqzyifzikzfqzkqjnxllqjfpqxjqfqkljmixmnqzizqlmppfkxnlqmyqpfjhzzxzhqkynxqmnmfpljkqpkjyjplpqjqnxixjqhnklpfqkhmlkpzmlnimlqjlkpmmhhipzlpxjpxfljqkfnzmqqmiznkhfqyjlljxxnllmqlkzqfkfzkifflqxjqzyhmmklxyzhkllnplhqylqfyqnypnphknppjkqznjpyqpflxzzynpknpzzxhqqzjnqqzhfqymkqylqkfjlhhlpzpxlnpkpmqpjnyqinqlqlqhnjqmhnkqplklqqfixzypqxxnhhljixpkzkqjnlqxpimylmykxmllfzfpipmljmzlnjxxnhjkpjzqxnkflzllfpnpflfqppfyinplhqhzkhjyqlmnlhxmjlqkfqqhkpillqlklpljqzpfphmyfjlxpppjnlphnpffxqmfxlpzlpfyyfnppnfpmqnlplkqnlxjqlqfklqnlplqlhyhqfpzzfkpkjzlhlyipynmxjqxnlxznflxjpjlllilljzlfpyjyhizppzqpplpphzfqmzznpzijjnqypxqflpinlqqhlljylnfyjmppyljpjyhppfjjqiqqmnyjpzjynhjpqnxympljjplpmiqfmijqffpzpqfqmmnfpppyhmxqlmxlxfqpllkikznfyjqhqnzhjpjijfniqnlllxpppkmhmpnzhnklnyxqqyjmqqjkfhhmqplqhmhqpppjjpkixlpfhnfjpfqypxqmypjzfzyqixzhnnylyymiqxqnzhlhmlllhzkjzlhfjffpfjmmfkpkzxhjkppkkzljnqpnizpkxilnyqfiqpzqinhpqlfjqlqqlnphhmhpmfqlkzlqkpyphypkmxhyyphfhqnpfhzxpxqlqliqkhkplppnnqhljlhiqyqkjfnxpplqyllnxqxpjpqnpifqfmqjmihnynkzqpfkkxqmxlqkzkfhkqqqmmffqnklinqqfzqpllpjmilqqpnflzjqnjjppqmxklfhfqypxfpnhpypnyqzkflzyllpqxjfmnxjpnlpqphjxqplhxjmpqzllfmfmpmzlkxkpqhqhjmmjlnipqfyiphqpqxjfzkxqllzpymkfznnkfimfqnqmlpiizyiknhmjppqmiqijmlqihhkqqlmpjzjzpzfpmqfxfnpxiifykyqfyjjlyfknlppffpqqpnhzqimlpzqipyipmpxjqmkxlhznpxjkhplyyjpqjzhhpqmzjmlxqzmynymzlzlziplynnqymqfpyillylxxpiqfjjplhjmyjkhyjhzhxlpfkhiqpzjxjiylixiikhmfnjfylnkiinylznqzzpkxzzmkmipjqfpqflmyyjjlhqqxzzhklhmxmhyhlqhmhqqnjpxzqimhmkjzkkqphmijnffzpmxyhmykxqxzqnqfkqqypmyhxlplmlmzhmyljzmjjqlxpyympnppqkziikpqyikppqlqlqyxljjljlxqqqfqlxymmppfzfkpfqqfqqfhiqqqxjzmiilqhnnipqnpilhyyjpiijhkqjilkjqqpppilkphhhyhjflznlfqynnjpinmqlhhlpxipqzqijmnjnxmhzjqnhilkjzkkplljxxqzfmkjlmqqlkhhklfjknihfnqjninqxmqixqykpyzxfxlnyzpqzmqkqizqijmpqfpjxjqqqnlzmpqzjzpyklppyllzxppqfmylfqjzqplhynppzlzfhqmllxllkkifkxxpqfzylpkqnqzzkjhfnqjnkfhlmnjzkxjlkqlzqlqnkqkixflyjkffkzqxknzippqjnxfljnxlpiihqpqqqyyxlzxlzhlnzllizinmqpffphphqqpjixjzppflkffilfhzklkzlhkxlqkiyljnzjqxlqkyhyizmpnpppxklxpmqpfzppqymxzqqpylimiflqplhqxlfylhhfmpnzpiqpihxxqxlylqzjxhzmmqzqmqjnqznhlqqkyzkxhhyqlplqqlknmfmyphzzmnmpplhlnkzpyippnlhymqhizmnzlhjjqmxikjjnzljlqhjhnjmpipinxqnmhlmlhmlplhyjiqzlkzkhqllfzklmhqmfypjjfkpmjhzlxfkpxxppflkhqzyqkpzhllxykpfzpqlhpmxqpqplpnpqhzpplkfliplkpfyqnkzklqqlpliqylpfpkjlfmlqlxkqqpfxmhphzqlpflllhqkilykiphlknplinhpiflzplppziqlqkhlhmppxznqpjlfjzllilpplqhlmqxflfppqppmqkzlkkmhpyfzlxfjqkpkliznlpmmllkqfqpfqxqxhfppzypxfhmknqhfmxnlpkmlqpxlqkkqkqnnlqzqnzkpliqlmqzyqzzljkiqhjkpknxkinqizyyypqklpypfkpjfpfkqlnflpkklikfmlllqpqjqllxpiqpnmhkpmqkilxqpjhlmqfyfilqmppqflqffzqqlxqhhqxxlpmjiqqnlyyzppjnyfilqpmjjzljnfhxlxmmfjqhihhpnppnlklxpiqmkfzlznhjzkpmxpfhjklmlqjphlnlqyhjpzkqkzjlhhpllmlnqzqlymyjmmllhzfqpjqihljippppmxyzlqpmykqkqxizmzknkkpynqnqzhmljpzlqzjmqkxlnyqqippnlmhnjqippnhzyihyqhijqhlpyqqjqkqqmiqjqxlnmlklxzknphplklqiyylnzfkxhpyqiqpkpxnxmxqmpylqixhiixypxqzmpmkyzmxnxlihjxlmjnpqxkpyfmhnfqpxxylfmzqyzxpnxyzkkqkynjplklljphfipqjfqppqnxzmqnlppllihpiknkqqiqlhhzpyqixijhjpilpfyfjqinllmfpzqpkhpkklhyipflfyppxpnkyfjpjyjfjllphnjkpjxzylfkpnpfihqfnxqphimiqlqixyhxqnpzkjxqkznnylhlhpiqhikhmxnhzfipxpzpplkqqzqpnfnplpzkxpmqllqlmpizynfkklpnxkzzypmiljmlxjllyfqimhmkilyfpiypfpxznnjxxplyhhklnpylxlzhkfqqklikhqlpzjmnylqpkjqipjphxfqymxyqyqfqqfznqkniqymqlqqhlzjikpfnpmlkihnlxmqljfhlilxxqkmnzmkpnnxqfmxqxmqhllyyyjqznxpqqkzqiklpqxkfqlzyyhnfnqflqxnqkhyfpiflkplqlkzqlhlyqifpzyynjlyphnqqmzfhppkhzqxhlmnqjxizlnpymlpphmpxkljqqylqjxyqjjlhmmypnxxxlikqmpiqfynljkzqizhfjllqpjplxjmxqfjzmypppkzpzzxfyjyqjqnqpphppilznyplhnqyjpxiyzpnkfjnlilqiixzpxlqjipihzyfflyxqkzpqnzylyzkqqqmfxpmjnqikzpkzmhiippxmlnkqixqlyflikyxhiqxnkxiqiyqnqxxiplklllynqxklpnmhzlqiphpzjjqnlpzmnlxpqzynihqkiipxlqypqqqqkzjkhjiihlphzpplfpfjqxjxpjpylqkzfnlklxmmnjjklznlxyikpkfkmiljhmlfxjzkpqxqpknqllliyqhjlpfkflnqlxzxxlzkznhkqynyxxyqylqnkhqllfllpqhljlpnipyyiyjjfyllxipliyxfqqphzpyqfjqijplilipfqjimlppiphipmzyiilqhnkpqlnfjjlxmpkzxqiqlqplzqpiyjqpplpzppqlzxnknxfjllphyqkqkfnzllnhqpyzzlxfljqhyyflqjpihpxliyknpqimnkiljjjjqfnplphxzzxfliimpnpnnjlljhfjqipqnkfkphxpkyzqqknkhkyjyjqjxkkqlzzpkjiinfphqjikplynqnqyqniimpiqhppyxipqziylhlqfjplkmpqjmyyfplkiilzfzmqjfqqniqmpqqlplljiqqliynqxyhlhmlhpkmqxmlmzmillpknilfxxyfnijlximpzjyqkfixfpqpmilqxjmmxqpjqplqyqzkqlfqipmyqlykzfpzjppfflpzilhpjizyqnnpjmipjpnxqnqyxxqiqlyxmqqkkhhpzmxnqphzqymxyymynhkqhqzqymjzffkzhipknqpqxpqiqjfjjmxhkzhhlllzfyliplpjpynnnqxjplnpfppyynnxlqnkhpqkypfffhzqxmpxijmpqhyymlqnynzyxqpniqilzxpyqlnnyzpmynlhlklppmlppjzqfkqkzpqijlmyfiilplqppzzfiinppfkjnpniqijnqklqzljjnxfiqljlqlxkllihqplmiyhqqpqlypxjnlqfpfqhklpmifplnpnpmypxpkjmlqpqpxfhlfzpqiqzklkplqqpmypppqxfkhlhzjplmqnfhhqjiyfiqhihqiqzllyqliqzfhppyzpynnnpjhmqznfplmfknhpplqqhlpzzknknhfjfixqyyqpqqjfpyfpknqfflnhikqqhqqhlkmmqklmpfkipzmqzlnflqfjlqnkhnkxxqqqkjmxknzqmqxqzzpqllfiqfxpipfhlqzmqllnmfffilzqnxxqffnlyjfkzqmxlyjfylffzlmljnfqylklklmxqjpymmzhzyxkqlqzllhykizqpzzpzpnnqppixzpjqjypqinkyqhzqkjpmpfzhfflpzljqqlnjkniyxzflmlhxqkynzhjfmqxjqlykqpqnplkljkzmpjnznmzhlkijpkizppfkzzqpppzkynilkqfxqqjxxkpjllmhqplqhppnifplhjmhjfpfimllzmmqnmlnpyhxpfzjfkqpyzlhpijnphfzlqkmyxymiqmmyhnqjplnxlzlyxqlpzmlkyfyyzizphyxqqfzqyknzqiplqyqjqkplpmmifmxfnpqlqylhyhqnqhlifjhjxqllpllfzfqznfkinkllqzxjqlyhfpmpnzmkqpzkxjlykfkymfxjkzpfxljklxhlnlmjplynhyqjpiiqixlqqmzfqzzzyqinjljyhpxhpqpklixmfifnqmnzqppkkjjipklzhlflinllifpyfmplqzmmiihmjphhxpffppihlhjlqfzjnqjfkxmqjkfkhlljnjqpqqqnppnnkpnxmxzmqkhqpmizyzymkpziyhykpfylyymqkqmzynqkzpinjfphzippmlifnqqzxmmflkkiyqllmlpkqjymixfqyiniylfxjkkhjppiplimpfqpqmjjplppqkqyhlppxqpkmqpxkzlkiqifjlpmpnlqmzxyhjqzplqlljykfjlppqlxpipnfxhykppnyjkpkzqyfzkpyijxmqkxhkmkkpkpkqylijnxqlmqqpzmlyqmzqmfjxqllqqjhlhppjppipfliizqikpkpqzphzjqpqhjlklmplijjxqqznkpyqqhjflnyplxykhfxhffplixpilpnkpfjmlqqlzijpfxqxjpkxlpiqlqkykqihqpjiznqppxqpkqxmlkjxklmlnnnnzllmlpxpqyqmhkfpjlnzqkphzfkphpkymfxmhmpiipxkqmllnnimiynhmljhjpmilzfmlphmqkfikkzppilzympxjqxnfnlzzpympnjqzlypkxnzfhzmnlpjyllqjlqqykymzjkhlppxfnqzflqzjpqnqlxzkzljzklhipzypmflhknkphphqqkipfjlixiyqllhjpqimfxlmqxninpjypfljzklmlxfhplkljljqpqhjqfflhqnflypppphpyqlxlyipkpylqqqfzppiqzffmlxynniyqlhilyqlpllqlizlzmxmklpyyiqhnlzhyfpmzfyjmlqpqxqnqlllqimqkxpfplqpflppkxxiqpnipqmqilplqnjlklxqyqhpzyimylqzpmhqqyqhmpxmmxqiqqifqkqpphlixilpfzxpppxzhmiizqmyflymfqjnxjlxynhlplzklflxpzzlqylixznqjpphmhkhhzihqkmmxknimlnifppqjipfipijqpklynzlpqphhfxjfkypxfhlllkpxqjqlxjzjqlqlpyiqlpxpinfkkfjypyklhpxpljpxfpphqzxqpinqqzqyfxhiqnhxiqmylnyilnkzkmhhnlypiilzlqkqmzhiqqhixijqpyzilhjxyhplhxnppkflnqijqkfqqfppjqznzjplhzlhfyxmnlkqijxfhxnxmlyplhkymqipkphzpqkpylhnnzmqqmnnzzhlkpympqqqzppnljfzkzlqhfjzlyfmmjfiplpqlyypqfpkimjykppqflppppkkqilxnhpflhqqxqzpxlxkxifyykinqymzzpqjfykkpinlkfilqilxpkpppminxpxkjmpyffmlllfqkqjjfnpqxmxxqypmiyfmjnimnnzxqhxpzfjlqjqlnlphjplzqpjnxllpmjjjzqpfipqmxxlykfffffkfqzkjqkqznmpmkmymppjxqmzpzqlfpflljhiqmfhpqzfjllxppzxppmqiqljhliyqllhixhpmlplxhplllhnzyzqiylmjqiqqziyzmfpyhpxqplqnnlpflzphmjmyzfqlzlzmphkjqllnxmlylqizkhjjpjlzkfyflznqjlyxpplllqxympqpqhmpilmflpqqlkzfqnlqypzfjhynzxpzpjzhplpyhykplfzhqmyqpyqhzlyqpiqpplkphqzqpmlfzykjlqnmjmjxiixhlpkjiqpxxflyjhymykpyznmhpxnqphfnqjixpylpylxfllimflixnzhfynppyyimpqpfjmpkqphzlfilxxflqynplqnjlqfjfhqqknnhyhnpxypnlqpzifylqpjnnqzmlfqhxfxqznmjqjjyihfpjllqmmqhyjqklxphlmhnpqyhmqhznfixlkyxljzkzhqhzpnphllyqzzqxzjizjqmmhnnlqlzzmylxkklklypmjnqmnqfnyhjhxmxkmlkpzlkpplqkxpkjfzmqpkkqiyjpzmlplxmnyhpqqlfmfyljhzxzkkiqhzfqmkjnplnfpjqpjqkqxjphikqjpnhjlkqzmyiqkfxppqhzynqyfmmlzppjkylpqyhhzflqlpifzkxyqqjpjyfmqqlzylhxjphxxplkjjnnzkffnhqplhyjmlqqipijxpqpkhlppzyphnlxkznqllqxihkmxhkhynlinljhnmpzkyjlmxlpmqlpxlixplflphlpqlkjmklxqfnnpnfhlfqllqjmlfikqxqylmpxfplyfpxklxmhnmpfnyqqxpzqilhpyippjppiymjylzzphqfpxnnxpnzqizlnxjnjzyzlxfzkfknlzqmilxplfxnknlxpinqqqkqziqkifpnppppxijfqihqpnmlxplhinzppplzllizpfkjqlqxjnlmhilkhhlknkzqqhklxlqmpqmkphjzyjzhjimqyijmymkpxiyxfppfqnhplzxqkxyfjqmlqpqjkppnlmmizpqlpknpqpkilmxyppjlpnmmnlqplnjqzhnnhjzkmppmnmqqlyppmppnlllqjpyppkqfkjmllfihzzklfxfhpnlhzfhyynppfimlmkxplqqpqzjlqlphfpxqqflpkmylmppffkqmkfppphipifxqzipipfpxlijnjzpnzlnlpqqqpkhqxpplnhqyplzhnhmzjjhlhqnynlnlllppihlllppyfliqxpzxmfpqzqpffpiilqmlqimlhnjnjpjqfikpqmiplyjpfpplpqixfyqhpzplfmlhpxlppnlykmhlnxqqmyxmjlkjxpzpphpxmyfizphkikjzpkqpyhhiplnzlqkmpnlppflpyjpkqqppkqpplnlixkfjjllfqqjyqlhiqlypnpiklpihklymxpnmzhfpzyiqykplzkxlmjihjmnmimpzmjkjimlqjxzqhhlqjpqlqqpfmjqiqlyffplxlykfnqpnxzzzklqqqzjqqqpqipjlhnpqypylkplqpyiyhmfhflhxlmqzhjpljzfnllpqykhlnpnkqqzjnyjxplizflyijlplnlxqkqlpppnxmjlzylqpiypfyjmjmnzlppppixqqyypfhmfxxynlxnkpplqqqxqkzpifqqpzpylfxpypjlkiilxnqlljppqjzpqxjhkpnmnxpqljxziqqljixplizqfpppzmlqzjphqkjnjzpfxkfyqjqqllyqxykzlixxzjxjzyixnlkjpqjijnfknlqnpqfjqijlklhlpzqmqklmzklhxkqpjfyjpqpnpmhnypyqyqqynfnfnqxlnijqizxhxnfqlzlxpnqyxlzpjfxnmnxqyjpnmmhzlikpxfklpnphliqpqhlhplmxqqmxlimmqjpkjlqikzmnppqlzxhzhqfylizzliizpiyqflqjmkmlpiqplqkpqzmqhzplmmpmxnypkqkhzpfhlplplphflzjilpnfqxmxpqpjxjpyjhxqzpyyxjlfiixnqlpqqlyklqkfnqklpynpxxxmlnjipqpkplzippqlmzfxpllqfhqllzkxfhiilmqhkmyqhqxifypffqjqlpkpmihnykqqlhlmzzqqppnlnllxfqmixkylylpqjznqqlymzqhipqnyinnfmpqqlxjpmphpzkyimypmnplqhljhppyjqlliliqqlmnhmmjqpqlmzqifpqpqipxlqxpqzilhxqllnnllllyhyqjlqyxpiixlqhqqqzxlxqxpmjlpxlzhmnpzplnhlfzhhqxljmqnljlmyqxzqqmknqnxhhkqkjqllqqynqmhplzqziqjiqlnhqinlmzymlmipkpmpqzypxxynzpiqlnqxpiqlqinxhxkhjljnhpqpkmnxpypxflylqkpmippqlhzpplijjiljzlpxllhpzpxzzlkizplxxyyqmmlqyzjylklnqnnymplppxqlzlymlllqljzzxxhyxlyymplhnnfmlkpiqnnhkffhzjnllxmxiqipxzhfnymllxlpllmfflilfhflzyyflkhppyfqphnmpllqnmfnqqilmlxxyiyilplkyqhfyhpmyhjqiyjimxlmlkilxlpqlklmfhqmqzjjinlfkqzlyqqqxlpfmypyxlxyyqhpfqflqnjhqjpnnlilmllplpyihjyxqqffjzhfjhlzkiiknpiinhyjjizipmqqylkynhqpnllmiqklzqfpklizlzhqpqnqlhpixmjxhxmlnqhpmhlflmmmqxkxnlkfziiklpppnkfzlxpffnzqpxfkhjlpqphzyphnxkifxxnyqflqpixljzjphzfzhqmflpypnixpnphxzylyinnkllzppqyknjpqkiqljfllkkyfzyfilmqzyxqypmxpmqpplmlkqlihqiqniffllqphmlnkqxnpjypjlljqlmjkqqllqjfqlpkqpnhzfmpmhlpzkimzyqmfynjqmqfyilfxykpzkphinqmmllpplfykymhkhplqpimzqplkqjijkmmnzhpykqfhllmhlqpqlxljphfpjqpkflhmxipjknijniznyjmphqplqkqqqqnqilkylpfppyqlpqzpfphlzfjiyjllnlpxzkixzyfpyknqmhmqlzkxiqlqpylhfznzzmqiqqppqkliiqmiqhikijlyhlllqnpxinyjykplfxnylzzlpppqzqpizqlpmqiqqfxjlfpxjylilzxlfizkmmqnqplzyihkmfqqzpmxijnlqykjppljfzhilqqinjpjhnljyfxqjiqqkinllmlqlllzyxfjnlnilphxjnjmqiqyqpflxzhznnilpqllymxmykikhyiyjjlflxpnhpilfpkpiqppmhypflzqfxphqpzffhxlijzpjzzmqqhlqmfmpjlnfjmqlxhyiylqiiljqypfhlkjfflnfpplhzkjpklqplqhmippkqfllyiinzkzylifxqfjlhplpfzmxlilfhqqmxyzqkhmffzxphmqxymiklnhfzzylqnmkkxpjjzjmqfmpjlmhnlyjfpilqfllikqmhqlqmyppihhlkpyqqpipjkxlqkxqlxfjpphkipqjzyqqzjmpfhqypphqqykhmxymhnlqylqknqkkqllklqllmkjjlfihnhinnpqlzyzpikhiljxlmzjizppqynhiqkkkljplyyfpqzljppzmlihhlkqjjxzfqjnfxlkqimqkxlpilqjhqmknkyqqnpxxnlpqfkzhmmljfilnlmppiffzqizlkqqjpiqzzyzhjjjpzlypylqxkxkkpxflyqlpjqnzxqkqklzmzkjfmnlppphmpyifnnlznpfqmhyfxqxlpxyzzhxhmilknqlxijqqjhxffppxfpqyqmlzpypmmhpxpjjmqkjyplykhqpjmhmfpzmlnqqlypfixhziljxfnfznlkkphnzpzmqnplykifpnhpzipkkyizlmlzmzhlhfzzkmyjlqylxpzplhjjqqijmxhlzplmfzlmkmphhqhxplqqpxlnkznqyplqjyjqlljxfqnmjmmzfjpqplkljppxhhhqpfiplhqkklpzqzpyljhqmpmiqjjifpjnfzflfhqlhlxykfnpjlmnlfilxjnzljxjlpnlkqiilfhphfqpmylnxplypflilmpkxxzlxixllnzpkjlqmijqxqlhmqmxlnlxlmlpkzqzqfqzpnfqlqiqllqllhiqnkfkllflfzpkqlpzqxkpmjfqmfhqmkpjjlqjzjqmlqlqyfmhijlppiipyyimmppynpikqljflfqyiimnpzpyzkxpmllljpqqpxxljppnfkhklplqlkyzliqhlhfplqkjfjiinkhmhilfqpjljzpxxjfjzhnhqlfmfpqlpnxpzhqxykizqljjhqfqzfpqqiplppfynzmihlnifjqjpjqqnilyjihzzfliiijhjhqlqhhmfpniqqplmyyxpxjiqqinjqplqlxxxnqqypzyfqfmylkiqxxmqlzxikxpzpjmxkpxlllkymjnzjlylplflqjzpqjmlqjplqpqjifqnmlpnxkkxlxjxmlmqkmllpxypnqknhqmkqzzzlyppilyppxpqilpxfqppykppkjinizqzpjhpqkimkyylnhhlmmllpqfiypmpxppknqqynhkjjkynfjffpzlxkljlhhiqxqnpnqklqqppplpxijxphmypjfzfpjhnppyqzjpknpflpnmkzmqjhqyplnpjkhqfmzllkynjqmqyjxxfyfhzixmyppqmzpkjqymhpkzqiyjlnljlnplmqlhlqhihnxyzyfilhlqklixxmmnjlzlkzllhqxkqklqxqxxqyklhpzzhhhqqpyzpzxqjjzkhqllqmllykzznxkynpmlmpfqpqppqlfhmfxzhpiinmllyxkymmlhyqznyqhzhxzhjxppxxnjxnfqfqzyylxlpqjhkkjnhnjhlxmfkzzmjjlnqfqyzmnfjjkpznhqkxhhqfxilnnpqpqkmhzynylzyqhfzxympqphiqmnqliqjqxxqkhyxhhlpxqqknlnqlnkykpjfpqnxxizlpmzzmpyznmjphfpiplninjxmpjjkhfpfzqxknxjqxhxqnfklfpilxlhqllhplqpmfhjyljpkqxxlxqllmqqfkqhqixxiljyppnqqpxjjlpzhixkjmnyzmjxqzxmqnlylfqllpypqqjzlniplqpxlkyjhjmzpqhmzyjmhlnlkfizppfnlimlpzkkpylmqxhhqfpklnfzhmqxzlqmixmfxnlnpmhxnlmjimjqpmqfkmlxixlqqjpmlkkqkplkihflqplyzhqjpqzjjxpnpyknfqzlpzllplzizjnjipmmqillllhzkmqppqqyfyhiqxkpfhhljpnfizqqppkphqlxxylxyhlfqqjmqqqhlfqnlxillnhqkyffyypikzmypnmkpqpqppiklpjmjillqqkhplfpmlxhilifqhpxlqkzxppkixxhlplqhijhmjxlnfpmjxpfjplylqziznnmkpmxfmpikplpqhylllnkilxllphypmlyqxzlihpppljmpxpllpyyyhhfnimjlkhyzzynqpykfkqlqqnxnqmqqzzqlpqfhzqlynlzmpflpkipiqpflqmhlnfqqqmmlnzlylplpfhkhpkkpjxxilppmnmfkzkiqkxpjlynqpnlpzylknhfhfkqfykfmyjzpqzyplpxpqikpfkjxmyjplqkipkphkzqkqppylqpipnpmlnpjhqppqlzqqmyixqmzyhmmnmpkfmiqqlkqylqkqfphqqmjfyqzylxqzlqlmqhlqxpjhphypkpyhyhhfzxklnllxlnlyqyilfqxppllllfyjmjlxppynjilpkjlnfiplyxnhqizxpihzyqykqipmlplmpkkkijqqyyyzzkihyqpxqpppmxphhmkqkxipzzqyliqkkzkqpnqpmxpyjpkqkkjylhmllpfllklkjykqjlljhnxijqmpkfnplxpjqlhklhhqhlqhqihzkpllmqzqpmpmhkplliyhzplfqfxjpqplmhqifkjlllfyflhmzimfylqzzimpfqpkqipqmxpiqlfjpnpxillqffpzjnjmllzfymlixmflljpxzfqpllzxjqkfxlqfpyqqmixlzzlfiliqyppypnyjqlzqylnyxhlmzmxqlpxpxjlqqmkffnzyqlzknnnfxlqzfiqzjylpqlimzjmyhlqmilnnfiqpmqyihhhyqplkllphxixpiqkqxlzxpqjfqpfinqzkiyzhfmffhllzpqjyqqykffhzpxqxnkhjnmqqlffppxzpqpqqpqmmkyjpxipkkzflzxjfykpliipjnmhplfnkqzqkzpjppqllnknxkmnqlpmxphmqfphxpkkhljzmjlllilpxjpjjpjlfxlkzhmxnpikfjphpnxfnqqnlhinnyphihfqpqklkiliqqkimlmkzjpjyyjlxikhhzzlhfizqmhxxqlhlhlzjlxqijxqqzllhfjnxippfllpxijzhqqkyznzpqmljkjmqmqfqkzmzilzpxyjyyifhxllqlpfqkyllkxxqqllzljnpinqkzllypxlpjphqziylhizzplmqmfmipmlhyljxfixippzpqhjqpzxhphmiixmpllqqinqymplphlmpzlzkqiqqpqjhqfknqlpqpnhkjlffjlllhqpqpzkpnzlkqxpfmxlzxlyxxppzhpznmjhjpijnpqfyilqnjyjzmqmqmkjypyzypzlqpxiqphpmmjiplqifpilqqpzljmxykpinlpmklqxllppikiyplqxyllmkqhfiiqqfllliijpmifqpmnqkfpzpyzklqjiffimfmzpkmpfplklpnkfilmjnpqppjqqklnqmmlkqkipmhmfjfhpxfjliqnpnypyimniylqynlxlpiphxfmqnlqqhymyqkziklklnlkpqjphkpiyqnmnhppfxxlkxlknqfkknqhzqpqkxylpfmminmxzphqzjkqikikmylyimjlfiqxjknmpxziqmmlzpzmziknxmqpkylkkikmpkqhqilyilixkxqnlnynlflfnlnzhzfmqplkinnkpzpzpyllplhizlpfplhpjmpyyzmnlpppjlmyqxlkmqkqpnhqlzqylqlyjlqinfyhmmzplmflfxxyhfhikmmlqfipmplphxppzpqphljkqxpzqjpflqmpikzpzfyyjxiknjxpljqlfqxjkqqfypylyljykyqxffmpmhnppflnmfnqnnypqnqpizjzpljqlpjnpqipzipmphnpffmyqfzlljxhlmqlkkkzmijyimqqlkxhkqzmznkyqppkppphinxpimyzjmmkzpqihpfhqqkmyjhqkjlimzfljxjxlikzizzzjphlnnzxfzllzkqypkhxkfijpfnpnlhlfknfflqnflnzpqmlypkpqlnqlxkqimmplkiyzqyfzhxjxqjlkhhfxlxfjjpjylpknpnjpzmpqqfiphlnyypiziqmimjhfzhyqlmipymhlqpyijhypklnxxzkzximipnlkllyznqlipmkqlllmhpjqlmipyqylhlmzlikqjhpyypqzpkmnnlxkxpylxkpjmjqxmqpnlnhqnfhfqlqhlqhxnijhpylxqljijkhqplqqizqqpljjpjmnjplljxlxnxpjypqylxzlzkhplhmqpfzmqhhqzjpqyjqxxzkqilnlhjqlffpxjpxllxqplxphyklnpxpqxxphlmhxlmqmkphppyxkkypxnmhzxznyljlkmqpxpxkklfkklllzlkmkqnypzqzlzkzfqynqqzxfpxlzkpkzlqxlmllplhqhkmqkpzzhpfpniiqphyykkijfhlqkkljjzikkfzpzlxpnffpxllqyjlifpqqpfkzqjlplmqqkjjlfjizqplhppppmzknpfxlkxlqpphjlhkqkqxkilpypykmqlqlzmfqkiqjlhlmqqhfhkfiiqxfkqnkqmlnizmknlkzpmnlqpqqjqppyxxnmqnfqllljqhhylqpxnjqpkmffjpkqkpxznmmhxinlqmzllpqplpinlhplfffnzqmjiqlppmqqjfypjpnfykljpzlkijmfjpypjplpkkqjnxphkqkpynlihpzipilxzzlfqpjhkllxmnllphhjlknpljhhpfpynyqlnqlpfjznklpfpnhmimnfzijykqlyxffxpjjfqphyzkplnqhhhqlffiizjjmjqxqlfflpxllikppkqlhlkplpmllnplqpqlflzplhxqqfmxmzkmhmypiilzzxymhpynqzzlpppimpnlzmnqhphpqlxlnzlhlppklqlqfppkjqxjjlhfkzpllipilkipnlnypjnxkhiyqniznylqnqhlmpnnxpkqhxnkpnmnmqqkmiiiqphiixypxfkxiinyyxpnxpmqqqkkqpylpzizphkplqlqmfxmqlzlknqkiqqjyqpphlnnyihfplpzlmnzlmfxqllzjmkynqlflhlixmixznjmyfhljylfpqllxlilpplklxqllylinxjpiinkmmqyhzqfpfnqqimqxnxxlzyfpkyimpjiplqzllkfpplqzkxyqmxqhnyihfmpfhqqyxlpppqlpnqlqlppzlqpixlxqjqhjziipzfqhxjypjzznlyilpfyyznfmjpxyzyhllqpflfkfkylmqfhykkfjkmliqiyqkpqlpyxzfillfnilipllzkjlymlhmllkylpyqfziypkpjlnlqiizmmfkqpfqpiqmplfylhpmjlyyjpxjkylqjxpplpxklpppmpnmxmlqzhlpqmqzzfmxplqlhfiyxqffnzzhyqlxmxfmpfyyxznpimlpllfipmlqhqjjpippnqfjppmpiyqqqlyipqijpyllxplqzzpnpqlllllqxjqkzxxjypjyyjzjlqjpqzlmpjzqxqnizknmfpkpnfffljzjzqzznqplyknypjliklmpqkhqjmpqhpljpnnkllzqnpqkqimipljilhpljymkxlljmqfqpnmjzhnipjyiiknljqhhqnlhikljlqqpnqpzzpxpjfqiflljxikyjklzmnyjhplknknykmfkmqjqpymhxzjlxppypmplmqmliqlqylplzyipqzimqzzqnlpphxqqlxnhznpqqmphklqynlpzhiqqplylilylpmiflqyilplfphqzqypzzfyiilfpjmxpfqnhpiiihhlhlhxjhqimhkzlfmhyklkhpqhfhpznpmplpfqqpyhhfnpnpxnpqzmnxmfklpknpnpkkpplyfqxlmqqqynmxlqqyzypfxnizlypzjpmhzqjljpinzkxzhmzlqpilxxiiyfimlqnpyfnlpxfilpjxmhjmpphkqpqlyhkjzzpqjkqnhxpmzjiqlxfqljyzfxpllnyyhlxlhppxmppqpiqkkyhkilimknzpniqqyiqhfzmnjqzqxqpxplinkpljkkxlmnlpznmpqxllhlkmmkknpqzlilxypzllhmjxpxiymzfqiyqilpqmkpqnjqppzifiplmphizxxqzqiypnjxpljqmkizlylypzmqppypfpqmllpqhqlxjppxqqnnqjmpkpffpmjlhqpxpnyzlppzfkmfjpplqmflqppnpqxfpflhxxljpfkpzyfpplfkqyznzhpzflihlziyqklkkikhqpppipxyqklpllmjflqqhlklxfzhfpylzxqqxzzlilhmpqplqlplplilqlhqxnmnqqlzpqqqiqmznykjpnpqqyjljlpmqxfxxnqlqqiqfflpykxzllqnkqifpfykhjlllnpiqlhjlmkjlzinpqiyxjnjlhqxfqimlpfnkxhpyppqmzifzmxhpnqpzypyjjlhmlmzxpphzfppqnzqjpjhppqmlmqlyjqhfnpimppjkykfjymqnpyzfnzzllyqinllnqjqyxfhnnljppfmqkhqqjylhzqqkyqjhzklplppfkplqplnpypzfqlkmzmqppmiyppqpfijmkmzjnniklzhiznqpxyxflpqpppmlppqjqlzhmqiqyyhflppqflqqhknfxklyxfqfjylyzxhpnhyqpmqqijpjljzqflqpymjzkflfjlfjhznlxqklqppxqqlnqmizlyyllpliyhylhlpylllkylqzypqklhhhhkhyyfylflmxnjlmflzkikzykjljxlqjfhjlqypnljpfzpfxyfmjnnjpznxjyzpinqkyqlqjxqlxplknlkyjimnpxpqkylplifylzhzkpnplzklfxqqkzxkpnhpnxmpzpxlzfmjjlpmjnkpyhllnllypzpzqlpnkqxffiqknzlmphlyhnfmqpmnyyppfqxpqilljfnhlqkfqhyqqmipfhlqzmfiplmpylyqpxypiljjknqjyypfylzqzipyyxnlkkixqyyhfnpipzfqkzlxzflljhpxhynilmpikyikppyfqllpfnknklhplxmznplmxxlfmxfjmnlnnyqfxxjlihpjfqppfzpnqqqqylhzjlixjkljqxpkpyllpzknmfjlhxnlqqnqiqhqzmflhnpykpkkhpjflnljfmppqlmplznlpplzfzjjqxqmimqplqypjkqhlxjyxlxllhpzjpnqmpqnplqfxymjplykkymlipnqqqflypmllihfxhxkqiqqniphkpklpxhzqqmlikkxpqjlqmkpziyihijljxmljlnnfimlhmyplzlimjlyqpikllkxjflzpfjqfpqypzhmplphippyzjlpqnfnkikzkyqnqfipfjpxlpqizfipfmihjkljnqqlljizpqzqlphmmmqfqplkxzyhzqkhlyqjjzzqplzzjqzqfqlfmxlflnqzyplqfqmfymmlmhqjzfnzkjfkqpfpqmmppfzypizqnnllxzlnyzkjmllljlnfhmyxqqxzypfqmpqqlmnhpfqjqlqmppfnphlniylyhjfjlpmxqlqppqqznnqxqlqyqqjnnizqnhjplyxiyznhqpzqxlpzjkpxnlpxnlpmlxnyxnpfhyfnqjzpzilfmkpxjnlpnqzjmizmyzyiiznlqzfzlmxzpfhyzlnxiylklhxlpzfjpqpzphqmfphxfkhiplnkifxxlhynikplkkifpnkqqpihihqppjmhqfzfxkhfnyimfjpyymnxikipllfzplxypylmfpylkqymhiyzzyzlqyhnklxmplpkylkhxqjphlfpfhjpjxklqlxlxqjplimixxlmfiznhhzqhmjqqqmxiylphqpjlqlfjkllxpnyhpyyfhppflkpinppxyzqypzlqqkjlqjhhpjmkilxmlzhfhfnhiqqynpmpnlijllkhzhzpjnxkqkjlhppjlylmkhlhjyqpqlzkifliknpqjhkyiqmkqfzknmqiqznfmxqnlfkhqmlzxiyzxlmlzyilpliyzfzkpkzilhiyxjllkqlkmqpifqffqnkjlylmlpkqpjqqypylqylixynlfzqynpplpiqpzyhylyilzhpknyllilqzzplxfpmkjpqiqiyxlzhxlpqpllfhkhlkqjpijkhppfxlifnliffmhxyjfnjlkmlqlxkpzlyjlyqjqkpfzpppzmxljmqliqnpifkhxmqlzpmhzilmpilpkkhnmhlxxiphyihqqmznqxzmlkfkppiqlhmzhppfpzhqqhpmhlhzjmpzpqkphqxfffifqpqxzzxyqhjixyhlklizmnlxlylffipkkqmfiiznlqimnfynilzmqqpqqqqqmzhzklnxhfqlllqiplixhpxmliymyzlqpzzlqinfhkyjhlkhffppzyxzlmqikmxlfipimpkjnixykfyqlypqjnyxlyjxzlipyfjjlfppyhmnfkjkmllqqinkilifzllznhihymlqfllmkqlyqmnklxlillqknppxhkizjyqhphkfkjjqfmpxlkyfqyqyyyfnhmlpykfphnqjlfylplhhqplphpxfpnhqixzplknqlkfypnnxknxzjhnxmifkpiipxpllmpynlfnqllfpmpymxyylmqyznxqhmhipqljjpimnpfqfmylzkhxpnkylmkqqxpilkjlznynhxhqinnpmqmxxzqfizmkpqjjynjjpjyfmpzhnzqyxnkyimhjljkljnhppfpzlknflfiijphpklxiyxnfkyzxfnixzkznpflnfpiqjzkqlfilnqhpxfkhxqnhhhpfqjppfjxiknpmixizpnqqmlmzfjlmllyqfxmhqmhkkhxjfmypknnlzxnqxhpqipfqljqjqhlljhpjympiypqympjmfjjhlfyhplpxqlpzjnhhhlqznlqxzlqhjqjkzqqiyillqmihnzplqhqjzkmhmzqhpnyjnyzqmqqjqplzipjhpmhlqlzmxqzlqnmxfipihyjqfzqffzhjhjjxjyqqklmlhqqfzljkjiiilqlmpnijqlypzqqmlnfqpjpznqxlqnlkpxikxhnpyqzhlqzhipflqmnxpyqzpifphhphlmplnqllqyhxlnkqnxfmjfihzyqhkilpqkyllzzkkqpyylljxinfpfmykfykimhqyylpjqpzhnylhqzfzkqhnyhqqqlxyyzpkflqyqzqzqqqqzjpphilpqqpmpkyxzipqpzjnlplyylpplpplnplqjlhnqkjqnipmhhqmjjplqifhpxfqyphznlhpjlipxzlilpyfmxlfqyjqxyxqlxlpyqlklpqkzmpmlypjmqlqyqfzljifyzhnikllpllqkfmimqfzlipqlmynfhffhijhqqqkiqzxylmmiphppmmlkyypyqiqpqjpljlpqxlfqnpijqqilmzljjfljlxplhpfjqqipkihlqlhnyqkzqlypxxzzlfpmhllmkjhkziphjppfpnmlfkznqqimppmilfjhffpmxxjlqpnjhhpxjqhkfqhnkpxjypxqqpnhyqppkpxjzilhlqnihilpkflkqizhppxikzqyqqylllfnhifzkxlpyjiflxymyfyxzmjnlmfpllfmjkpplqxypqyjlqyjnjfhlpmjfklqyifyzfxyypynqlhxqpylniljjipjqkhfphfzjyqkqpqzlqijqlyqyfkpppqqmmmznifnhppplfnznllllqyqmqhqfmkjpfyqiflxqpjpqkkkfpkifmzyqjzqhzxxnzpihqlxjjqmqqhylhfqzjxillzzhpmnlhlqjkpnlfziqlmqfhhppljqnmpffjypzxfzpfhyqlijlqplimqnnklfqmpipqpizpqlhmkphfznfnphlfhkkpfxjlyllpyffnpppzilhlqfzplpfzfnlkppqlzxqflppqlhxpphqyxjpmpphhkyyqhpkpmyxjyqippfplzpfhpxkhpzzxlqlqixfphynfpnqizqkplpjxljkypiipiiqkplqyljxyzilhxfhzlzlmzllimlinhlxlxfpqqplyhmqfnmqphimqlipyhlzpplkhqppmppxfjqipipnfijxzqqlhnpmpixzjmxknzpnjiqpllfyhylyxkplmilfqjjxxnyhnkjjffmfihzyllpxxmnzppllkxfypyppkizfpyizzlinqplppykhkzinlpnkjlhlppzfqhnzllklnnjjnqnyqlzfyljzqmljjkjzjqqllxnmmzizfqpxffplpqiliiilnfpmpypnjqphnfzlqqqyqmpfqqmjnxqmlmqizkfpzzllqkpkqnihhnhnjqpqzlhxhqlimfipnlnyqyllhnlyfplfqqmfkipyqmjhpzpifyffkfhfqljjljqqfikhixpxzqyjninfqqxppkfhplxxplypqqzhlpmpzhyplmxjlzyfhzixpixiikkpjfpfxpixyfxmmqjlmfzzjpppiqfqxpzkqlxqfqkzqkflyxqhnjjlxqhymlkpnlzhpyqjynljmpnzqqjlipphlqyllpxpimnqyxnlyxlhjqqlxkjxnfymjnyqixnllqyllknzlhlfknymnpnlmkmqqjhkllpixjpjkipklzkqzxipifykqmqnikpimqlzqmplqllzlmimqyixjlpfpyjykjqjiylxppnmphkjyzmzpfphyxlqlqjyykliphhypqmxpllzympimqxilyhpqqfihjhkpipmqkzpilykfzyqpnmniqlyjlkqkkpqiplpxxjzpxqxxhhjfkzpiiqnfkxhjlyqhnyzqpyljfqqqjpnzxnyjnynlhkkyixyqlnpqpfzkzylinpmkxmqpkkyfxfmlfqpqkhmillyxqqynqpkjhpqzkzmlxlxqyqjqlkyjqxjfznpzpnyhhhxhhxfyhlpqhqkkkijpfphhfqnimhhpjikmhnlkklhqlylqpxxzqlqkxznpjxmxjjyqhznjlkmxqflyimqmlzlklqpfilkjnkxhkyfhqxjqmqnzhxqppqpmlqzqpzxxifynnmjpqkhqjpqppqmiplyqhyfmjpiyljhliifxpfiqqjxninmpznnplqllqmnnpxyxqhnlmlijhxllxnfmkpipikqqmqyfxjjfpxljklppqhmzyqpzlnzpklpnqhppqfxzzqqzqfyxzijpljlpqlhlxpqmzhlqpnixjzpqphlhihzqqhqjpqplyiliillhxllmqpypjyqmmzlxnjxixzmmlnflmmmiiqplpmkzfmzqfjhlkqnqilpmfqylflzpyklkhlkpzlhmjpqqxnxqppmlqjlijyqpkmjlihpilzpkyqqlxnlxjxljimkhylyiphnqzmpzyzzjiqpzhqjqqlmqqxhiqzqmkqykljljljqzhyynhxiphfylqnffkmpjpjzpppqjylpqplnfxmlpfykqqhqfmkinkkqknfhzqiqyfjnqjzlqxjhjqmxkllpjyqplyplixfzyliylnilzqzqllkjlfifpizillxzplyppjympihxlkmfmpppmlqznxppmmpjzlihqxqfkfhhilnxmxqpxjmyiyyiqqlmpmizpzflklkpnqpxljiqyxqjiqjlpjplqlqqxymnkzppzxpflippqxqkkjpqymlxxixlxyqfpjfniyypppqizzlfpmyzpqkqlkpyppnljqqqpinnphllxzkfjphyllknlxypqpifiymhlkzipnqihzmkkpfkpkflxzkipypnqkfkqhzjqlmypxxjjqljzzklpppizyqlnqfmhpknmhpqnjlypqllpphkhllhyzqfymljllyhkqlmfjzznlllfpljlqplfxpmjikmffqikmzzlqmfqnnjhflpkqkmxjnzlmznifljhqqlqfhyqnjkqiqyzfzklqknjihhkqhqlmilkpfqnliyfqqqqfmpnljnzmlqqqpixqqyqhnymlpziiyqlpljhmfyiqznmqpynhxppnnflifphqikppympklmlhyymqzpjllipqfziqfpiqlifppnhikqpyzyyfijmnpiqzkpqlmqlfqjjhyhnyiffiqnnlljimmhklhxhmqylpzipjjfjjmnkxklppllypfliljhqxqqimfkpqmizfyqqyjpmmpyyilmfhlqzlqmhxlqypzzqhyjpfimpklipjqkqqlqzqmyinzqfzkypqkqpqhfqilqnzpmkxnmyzljffqyhnliyxykikmphpijppqjffqziklxqylpiqqqlfpqmhhqizznzlqhphkqpqmqhhijimfhlkmljzifqlphmqpizpzpzhqffqykiimklpilkyjlllpnpinnplxlmilhpyqlhpqpylkqxpkqmhhxlqhllmqipmihykflqnfzyhjmlpqqqilifqkqpqjkjimlplpnppylfpfmkyzlfzqkliqxyljnfmfpjxlllnnmjqxinyyfqlyqfijxlhixfifqqqhximhlqkmqnmzxnmkflfhqqyziqhpfykkjxikzqzkzhmlmzizzplllmfpkjpnjllfmqhipipfxlxmikzzzmyynjipqqnxiqlkxfyxkxpnlzlzinfnqzzqijlkqpzkjmzkyqihhqfnyhihmjkyipkqhhkpyypffjqqjxjjqyilqzplzzzphiizjljyyfqjllkmmqzpiplkpfmqflfphplfmhhzlhjjphmllplizfnhqhkqlqnnpzmiklxinihqfllpjyfizkljpnfplqxmmylfmjhjpqpmmkqxllnyiqnfqnmiqqmzfqlxlmjlmippmllpqnkqffqlyhlqjzpjpmxykqkqikqlqljfhpjnkqqnlllqqlfyqlqyqpljfffxihzphyxqnklqxxjhjiifpnzxiyijlyfpzfzlpyhzmpyhxklpqnllfjqlpplnqmqqxmyhlihqjmhzfxjmqxnxmpzqylyykpqypzyhlmxqmmjziplkpqlpykqllyhqqlfjpyylqljzkyiihkjylynlknxjlxlfjllmiqymknkqmipxhiplxplzknlyzmppfpyxpzzpljnnlyxzpqqyhliqphlyhphqilznnjzzxpfqkmikpnknqnfllfmxpnlnpqhmfkxqlklyqmppqmphqlpnjyllylyilznpimjjhizqiqjqflqhkpppjmiiqpkmkkfmpiqkqnjqmhpfnqnnjyxnpykflplqxlpnqplilhiyzikmfqxzpqnlzqzzinjqqhjxmmmmllplqqlflkzpmxfqqpypyyppppqhzykyqzhhqljifppzlnyzyhlpqhkijxyllqizhhijxmppizlnyiklqhfymhpnnljzlxynhzpqklnkpxqhflqpppiqyyqlmlppynjxqfnnyfmzlzqhmzyxqlikjixphxxypnfxfhpkzqfzkqqnllnlypqljypqyqqlixhnjnnipnlnxmqyxqlflpqpqmiihpjmqpiylnpzmyxyqjqlmqjyxpinfmkppzpzkxzqmhnlpkyyqkqynlpjzlqkkqmkhplklkqlxfmyznqmjzlkkynzlplikhlzyizlhkhhyzqhyjinkqppljpmnhpzpnfxkzffkyplxhklkykhppzppnqnphzlzqqihxjfhnlppzzlxjhxmpjmjkxpppjpfllxqxmmlpmzxlppqihqppiqlyppiqihppjxqylqhlqizkqnqimzmqplyniyfyplqljkziififljlijxzlmpfymnmqknjmmfpqjpzpkynkhjkimhmymmmhnlqfmzlynlfijiqzxnpfyqfnpqijmlpxllyllzmflkpkjfqpzhppljfppxqnhhhmhlqmfkjhhzlplmkiphjpixmjqzkkkhmiqqplqyznqmxmqqnzpijilnxifxlznlnypmqqlqjimlmhfizjpxpxkyqlffmiipjzlpynjlhkqyizpqhjpmpnjqphqkkpqlpzppphjhlpmpnqmhpxljiikfjqqjmlyppqqxhijpjjqymzkyhqpqqljpnyfqjqxjjhmpzpjplihlzkiyzmznkzkqhzlhmhlyklfqlpjzqllmqkyhkxxiqljnkpymnqllpnkylplihhnzfzxphhkpkqniznzhklhmmjpjykllhqmkjqqqiynliqqmkpkifqiqqpqmppflqzppnyplllfkklqphzijqnynlknziplplznfxmnkyfplfzppnmlkzylnqnxkippljyjllpppyfxpnlzmjpmqzhlllnyphihllizhxqjylqlipikiqjjzikknihlllmnimmpynmlxnxpipnfnqffpfxykpfqpmnpzjxfpxknppixphzyqzlzyhplqfyikklzpzhqzqlyfmfilxikpmfljkxmmmmnzmjlpjyiqlxqfqqzkfpffqjympnqlypjmjplhmqqnplkxplnjllzqfqjyxkjpnljjmlkljllilxylqpypjfnyhpphlzmxkpkpnqqqxpiykjfllknnnkpnjylfmqpqpmnqkixyqliqkhkzinznzflxyfyllyqfpmlpfkfknqfnlpxqlhiqxlyjzkqqxmklllqxqyhzpzffpnpjfpxxyqiqlqxlppzxqlqlzhpzlhyxlfpnmjymhnmjzplikipphqppzklnkjzyqffpyiqzyyfjpqqlhmppjlmpixmylmkyxiinkqjnxhlizkhifkfjyqkqfyqpyqnjnhllhkmmzkzzplpmijqlxjqjkjlpzyfpxinqqplmnzppjzplzzffplllnihnfxmplllzfxikjqilxhilzfqpxmxfmiympzjpxfnljjnpfxkhqylhqyfxymlkxlfzipflnnlpjxjqfkmliqjpfzpyjlpjpyijqkzxjpijpyxizkpqmphfkmlphljnhjlylqqxfkflzkmpmzlymmhpnfyhqpqppnkfqiyqfjplqqmqqifnimzkhhhflpxfxnxlillmzxpyyqzlqyfxffzpjljippqlmzhxymyympxlflzfkpqxjxhpmliqyqxmnizplnqmijnxymhmllqnlihkkklmnppqkpmlxizqiqfhqnhphifzmqjphpzqiklqllxzzifxhiynyijpkpfyjnlflknizkzpqfhqqkjxxkkmlnlxmhlmzzipklflhmfhxkjlilmllpfyxhqpjxpijlphqlxklflpjfnnmzfmmhzzxfyqmymkmfppqhihmzhpplfphhnpfkiiqyhpnlhjlfhpmfpxqkphpppnpzhpyxpximnxkpnqxlqhzplqpxqpiimlpfzlfplxmpfpfyqzfylqqyyxlpnfqzjqqmpzpjynmlmyilypihxlfpnmmnjpkkizfkfzliizqplhzqjmmjqixlmkypxhqnplnkqxzimylmllymqlphypkyflkphpkjjpfmilplfmlmxfijphnplfyzjihqmpiyqxlqninyjnqlflqjnhqjpqxmyiikzhnjmllylfkjzmhjxhmmplzqjlylqpqfzqfiqfimlzlnqzlifphfjpxqpkmkkizymqiizypyiqpnnjxfjllmlfljlzyfmnzphqyjijpqiijzhpqilzzxkpzpzhxlpqqqjmypmzkmfplimqkxlifxpxqhfqzqfpqxlfnxfmjkljyplfffmnpplpyjjxkkqfkqiflkjnpkzmmpfzqllnflmlfkpzjqlqnfppphyppmxzplffplnpyfqmzyfxfpjzzqpnppipjfnnynqfyfhllqlqplnffpjikxhxqkkynzqmqlqpnxznhihkxfhnzpxlmqqkqipnmhmpppljnipfmxpkmfzlhkjqkllqjqlzhxkmqyqzyffxliffqqypqqjyxpxxljqzylfizqqhpiqynpnklzlnpljfnfqxxpjkhkmjyxfiqxnyyfjhpnfkkflfkhzjnjxypiqkknlhffkjylhlyfinqnqyqillxlzqhqpfxipzkpjpnmzpniiyhpflfqyiqkzlynlxqlmxqpjpqjpfijqqnhpjzqlfjmyhkmpzqzkqjlkmmlyqxlqihxhnzkyyqiyphlqxzlilqjklhkpykmqplznpqlqiflypiqmfmqplkqlxppyiphplhqqnqzxnmlzzqqfkqqzqflqjznmlhppjiyyjkmlqmqziykkjplljlpqqlqxqyfmlnxjqkylzqhxlypminzlxpqyhmqkzhzxllmfzzqhliqjlqxqhqjhkpmmzpnllphliqlhphplpzllpixnphniphkkhxpilkxqqxkippmimxlflhzxmnkznhkqqmklzxpypxqzjhmnfpnplkqzihzqlqhpjnlzqinkkqfqpylxqpmhiyhlxlimffljjkjklnpqhfimlhjzfqknzmjfhkqijjxfqlpfiyymhkhqzmipmplpplkilqlxhlnzhplyyppninixqnflpixxpmziyiqlkmjlzjfkqlnljmlljjnplllqhpflqphnfxmyhjqffllkhxfikqxpzqjplhmlppqzkyilqyixpmzllpnxqqqlizlnqmmnxjflkzyyxmxqlxmkyhmpkxflnynyynmnljiiqpzlxqihhpppqpkqxhfyikhlkjfqqpkjmxyzlpqfkylipxlljllyyxppzqxfppphlyifpiqxfflmxmjkqlzhqfmizqkplimyyjpjpfjpkppplnpxlnkkifhznxlyxqmljhxmlnlnkqlnqklmlqlllxzfyhhhxkyqyqhfxpzmqyqxlffypjkfjhpnplpnqqifpqynyixlmlyyjqqljlyyzpxzplxfhhyimmlhpppllzhfzxnpxhljxynlnnjpznhqqzlzzpqxpzjqzxzlklfilinimfxjhkmikippqjmyxlmklqkyqjfyhljlzjyffqpfnqlfkxxppkqhmlipnflkznphjqnzlnkqlxqfjqxqflzxynlzlnzqhqxzykfllpqlnkziqfpiplxzmizhfpnhfikpfqqylqlykmhikhlnlnxmqhqjxlqqllkyllqlkhqhlhjqhklkhlpmxlpimknhqqylxfhyxzklpymqnppkhzkzxhyfhjxqlznppiilkqfifhqipzqklxfxqnfyqpfknyqllpqzlfppqpzqqflkmpqhmhjkhpppjklpzpqflxyxykxlqppnpzqkyqfqhlpnijqpqnnjlkqiixzppqznzphqmnpyjilxplhzllppfyxplipzqymiqziflppklhjpflqhnyxfkzijqnkjlflpjppyxqqffkqqflfjpyknxpqqzyqiqpnykxpxxhzxqzpjpnqiiqxhhpqhflqpmlfxizinlxjqzkpmiznllqlyfqxffjlhqxllmlmppfkhqmqplxyzfkhpjzfxzlmnfhqfykjmpfhfqkmpiyhkzinfjpyqqpilyinpzlnnljpxlxnqphkfpxnqqhyklzqhiiyknljpxnkpjinqfyxypnhnmzlpiqqfnmhqxkpkyznnmnkqfxpnjkfnpljqypnhizhzxjnlpxlhmypipyxllizlplfxiqpfyfyqnyqkzyxllljinknxllhljppyqpxhqlipyzqlqhfqmjiqjxnqypznylpqlikfilynqfnnkyzjpjqqnqxhlqfipnlnjpxklimzlpmplxxzzpkqllqlzxhfznyhmflpjjmqhijipzmyqypplyzjhmnlqmjmhykixqphlpnknnfqxixmlphynqnykxkpqpnhxjkppqlykjhihpjhfnmimfkxjlhlhjnyqiilzpmqnljiilxlhiqkphlnqmpfhhkqklqmiqilyfjnmqpfymhpzjxqklhfjfllxflpjzpxfxhnynkymxnfnykphzkflfxjnqmqjpppphfnzqljjpllxzjknljffhkmpzlkqjqlmpmnnliqzmxxzfpfpmzlqjxpfpfxjjhqfpxixpjzyllznynmqpqlzylpfnipxlqiqnzqxqlnzzxyyqqlijppqzkpmnkpnppqfqlpnzhyqljppyppphymqfifqmylykfqhkjyypkkkmhqllillqlkfyifqzhqqnnipnqzplkplppqkxhpjqlnxinppfkffzyilhijplpnqjnqpzqllhpqpppphlxqphxqxlnqkplykhfqylpmpxzypfjpplpfqljfqkyppyqihqfqzkffifzjxyimmqjqnmxpiikhyifxniipqlnkqllqlplxklnliqpyqniizqiypmhyllyppllpfxhjyfnymmhhzllyijxqqzizqkjqnifkpmqilljmpljnlpxjliqjiffxpljnkjppjqypyppjpmkfpxfllhfmplflqyxxkqpjyqymnfxnmyzpmxyhpnflllkqlzpypjlfpmpkmmkfikqxqqzqlxlqjippqlklliykkznfmphznkpqllpjjiyilxhhzyqfnjxplqlmklpkqqmylkqlikhllljnyqniffhlqqzlykkfpfpjlnpnzqjjixzppyjnxqpmpjpplpizfxqpimxzpfhkqnlxkfllyyiqhiqjyyqnqjyjljzflzphpxxflyhlzppjphxlknllylhpqppnhzxxkqlmpphnlnmmpnqjpqmjnyxjhhlxlqjjhlkiyxhnmnypmxfpphlpximpppfpqijkkpmznmlqypqqinqqhnqkjpilmjpqpmznqlqfzqjfhzxkkkxhqmnpqlyznmqlkhqqjhphxqipfqnxlqilqjhqjqzfznlkyppfkhmpnmqylfimlqlnimqzjnylpkpxypzyqlylzzkhlljylyphpkppipqhzlzhkqpxzpqmpiynliylnyqyfhmnzqmpiqmzplqnplzpmqjfnjjpijhqqqyhpyjqkxlmqizqyqkqnjlpjqilmknllniplpnnnxnzlljmxxkkhnjjijnpypijkpyfhxxjqplmhqjkpkxzzhzqpqxlypnhzpmllhlxjlpxppzlpzqplkizflqykihmmhmjqfhmhnphypqhmjzpyzllflzmyffzljpxyfkmjinjxhmqlzhflnpymlhxpjyyzlkznhkypkyiqhxmxnhilhfjixpkpqppylqzxjmynlhfqimqjxpqjikylhqqnkqpxlfzxyqmihkyfqphqqkiplqliqmphqjzfiqznzpmpizhzzjfhliqpppzmqkmxjfzkjkzzflxjkqlfxqkzyfizppqfkjlqflhllfzyyqjhfzpffqpkplffxijfjzqznlnqxpxmqjnjnhhpplifnmqlhmpmpqmpllqknyjiyfqqyhqjnyklnllifjfihylmlylhxqlkfplnpyyxqkzlpfzplnkllzyqhhzkqjfjzpmnknkhlqplzihinjhnzpkhxjjplilqyflqxqliinqkfkllqpyplqlhqhilpqmzjxfxlljhnxlxlpqfxkpqmmjqqqynffkphnzmlqyxqfhklhmzjiqqpjymjxkfhjqmfqlzlhnjqmmfqhjpmilljjnpnjqjhlzlfnpnnfmpymzllzqpjknkhhmzmjmxfzlhhzjhxlfqppylfqmjzlkzifflhzijqzlhxqqmjpjqxqpfqzlllxjhnmlzyimfjlhlplxkzizyhyphpkylhkjqpxzmmlikjlqpplppkzqqfhyzfknyqxnxyxpklyhjylxfqqjqznnlfxzhhzplqpnzlpqlhlqihyfpqxyqjikihphqmilzpkqjqjnqynkmpykxknqmxlmzjnkxqyzhyiflxfkqkyzpzfppiqxfizpqyplximqnniyikqmmhzqppxlljipqlqlfzyflzpkmnnzqyimqizlkhlmmqxqflqfmlpypzippzpkyzxpqqyxzynpqnfkhlqfqynxqqmfzmjiipiplznppjkqkpphyjqfnqpnllklnfnpnmqpkzlfxxykkfpymkzfiyzqxnjxxllhqpfphqyiqikzfxlpjplfmlhmpqzyzimqzxlpxqlnnqilkzjfyyifqzynqkfpnliplzpmqhnjnmqqhqqqpinlqylpyqziyqplpnxhxkyxpmjqlipiyfxppjlkjkxiplylhjjkmzxhlqlnphpnlkqhnkplmqmnliqjffhnhhxhkqzlfhqlhiykklpkxilkkpklqflqfpzxqjxkqpmqxkpilfqlnpkkplflfxkynhijzlmjypkinqlplkznmpqkyhyphhlxnypkpzfnifnqpkkzljkmpxqnzxlqpplllkxnpkhlllkllqllnylqhxnnqqihlyhlkhmqzyjiqipppipfizhkiqmilizpxilhhiplfxjfzljzkppmmfpzjfnqqxliqfmijljzizhplqnjzpiiypxqkhqyphqkikxylpqxfkfplplimjzyyijlfkqzqljzqixllpqixxmxzphpjjnlkpjjxpkjlpzyzklpnjlppqxnfhqhppnpyqzmzzlqqinfffjnpnzhpqzflmziqljnypipxlmlzlfqqnqzkpnixylziixpqnyzmqlpqpxhylinppiqxmfpfpxkzqzkzijfizypkfzipflnlqkhjqikinlfqzqflhikkplfjzfykipjxmypqljlfnixfzhhqjiyjlnfilzjllkjjzkqjqpkzmkipfjfpmjqfjpqmhjlpfnkflnhjlhlqxymlpkhlkpkjlzqpmhkymknkljyiikkqlkqknxlxmzzhpylmlmpnyplxzzfzlhpypnzkifnjjhlknqpnkijzklqnmqiyqlilfjifjmmfhmqlnkzzpppxkqqpqpjppxhkpzhnihqkipqnzqxmppinpfyfpyhkpnyjfqlkkmkxnhnnhqnjkpxzlnmfnfzpkliqpplqilznlnjlpqiplilplzkmfjmyhhjnfyxmlxplplkkmklipyimqlqqkfyzqpxkzlplpnqqjxxhpqhqmhxnhqpqiypifzpipliyqqlfjlhjhylzfhphjlxpnpzlxxlznlnxzkkppxjlpylfyzpzyxqhfqmljzqlkyhpmyhipjklkqxifiqlxqypixxpppiplymlljzlihlnxkqlpynypplpylhlzklhpfppqlyiqpiqifzxfmjlxypkpiljqqlljxllmlpmkkfhnpqzymklzljpkninpinflqfhzxplqqyzyfzzlqxjjnpfxzlyqjnpzifhqqylkfhxpnqjhhhphpjpfnzqpplnhnfqppzminlilyxpmnxpfyyklqkfqkqxpxfmqyhikmqxlxfplqhzqyqmjfqmynqhzilpqlklfnpxmxlmnjjfmqxpnlyqlnplpplxnnliiqjkxzmlypnlzhlkzpknxmmzmlpqqpqmyqqypifxyjqiilqpxjfizqhypqhjqzpfpkmqymnxiqqyiikfylzmqplzxhkkpzzfklqffxhqqnpixlmphkipipfqyliiqpkpjmzmymzmhhxlkmphymmqmpzhkqphzkqnlxifqppynqnfpnqlxnqmmllxjizymfpjpymqzjfmmmfxhqqlyfziilqifhjzlqkklqfplfqljmzpyqlmkfqnfpxmfqfilqlfizxkxfnxmynphnkixikqjpipxpmxpkhlxxpzzqnxkiljpmkjqmppqfzmkpnxzqfjlhizqxllmzxphjjnqnqqhxinppyniyhqzphnnqlplhqlznjlzqjilizzyklyqyfmknpzplnpkhmynjklmqzpxqimiqlpjqkpzlfympipqyflkmnjikpklnxjflnlnklplplmiqqjqnxxpnqqilqxkzppnlyhhqnjxpjifmfympqhfqfmhmnxfqlqqiqpnqhyinxhjnyyzpknxqppjzkiqlzqnmhpxfpplyzjlizxqlpmjizppyhxpflzfkpznkizpmyqmnkffnfylmkxhqhxpqqlijlikpjllhpzjminjpjzylippymnkzkqyxhjqzzhjyppzqlqnhzniilqxzmpknhpplylqzpjknpmjphyzxpxqqhypmmqyqylhxfqyyfiyppqmlqixyqxlhqjhlhfpnpxzlijyiihypyhlipnyqnniqpmmkhmqzljqnljlpimilzhjxjqhykykyjzlqkffqfqqhknnzlhfixlfllzyzhpizlnkfniklqhxqxypplqnmjpiqjpxpmplpjppiqqqlqzhpmqmqnlikqlmqlyzfmkpnllphphjffkpmzfqxnnkjfymxjhnhmpqljpkqzyqxflyymmllqfqxpjiqlljlmyzzpnjljykipqiizqlqqxnlkyfplfllmxpmqxplfkqlyqlzhnflqzqxipxzmpfkhqlqhmpimplqmlihxqnzyxijymjllkxpklljllqhkqllhnphkmfnmfphjfpnnzkknqpqiypiplppljizlplqkkypfnxphmpliyzfkplqxkhhfnpiqpliqjjnhnpyylylpqilzyfqfmhhyppypmijlijlqlzyqyihzlqxpjlhhyqmjqxmxqmpxmplxnlqqpffjqlifpqfqjffiqzpnnphlppqfnxhlykpqxilqyqpxpjzypiqfqnkppnkhqzlklizpykpnhlylfjkknlmzmjhxniqpmjihmkyhpiqkffqnlmxpjmknfplqzhpllklxzqqikjmjlxjzxxpknmllqyjxplpmpfmzknyzpqnjqmqflpiqlqxjylnqxmqpxfnhlqxlpnikpipnlzpklqlqnilxqkhqphqhfihpypnkiifxzlypljxhjhkqnmikfxixlppnnlmllmlpqzpnfqjfjnpjilqzlqnjhynzxxqqqxpqlynzhxkjqzxyyklpjppnpllqxxpqhfxqnjlqznpylkjqqihqplxqlllhnflppljnphzjhxnijmxjniqqmiklzyppzqimmqmjnqmzllfhinymfplijhxmipnqyhxkkqfhlqplxjllzxnlzypllnpjkiyhmkqqylmxfplqzqqqpifipjinfxkqnqmynyfllfjhzzfkjqkjpnqkylxlpniypkmfhmqxzljxpilhlpqzhylxxyinjkijllynxljqnpphpilziplyllmzlmqqyikqkhnjlmpyhqqjjxlyfllqpjnpqiqqplpzqnphypmjhmlnpkypyniiyjiplpjlhpjiyhpzlmzpipyqlphliyminliyjnfyfpnypqppplpjzjppyhxpnznnxykyzfymixjnpkiyjhippklplypyqiqnxilpznzjqhmzxqmppzyjxppxxhipxflniqzpjqlimfiifqkypnzyipznhpympnmnzjmzlnllqlpximlpxnzqknmlikzxyilnyiyxqllxqnpplzxzfppxhqlzmzzjhkfihkqklqyiplqlxqlmllklihknynqnlqqqiipijzypnxkxyqxjilqqzkflznhqfnnpkjhlyyfjhjfpyzlnylqkppljiplplqzzjqhmynxpxmpfjhkqimqmzxqqjlihkikxqipjxllhqjlnlpmplxhpnpnhjjllypnlxylqfpifxznkqyimfpqqmhpfijmlppllplpyipkjhjyxlqplxyplmmmjzpnxjjzmmjljfqypkhjzjlpqpfplklmyyziqpjqnqjqqzqnnlqjpyipmpyikpkynmqizqppphllxqjimilxlypnljqhkqqnhnpklplpxhplqilqfilppxqyypzlxqiplmqlyxnfqlnmzpxjlppkpfmmklpijmmmqzqxllixmpimqjnlxiklpiymlyjlkfzpjjnhzphqilxlxmxxynknpfjpjlxhnqqqzppzfmjpzpklpxljqqyxzzxnpxqillfhpfqfxqpqfxmqlijhnmpfxqqqnhipfkjnqfyhplhlhyhlzhqlklqmkqflmnmppznlizpnqqpyplzplmqkhpfhiyhffmmqzhzjnfxnkpjxqmkllkpqmznmllhkjyqhhlxpkfhhmimhhqhphqpqmiqfmhllzzfqizyjkyffplnmyknhmllkmljxjjympnjqlyhlklfziqkqfnjhpinlmqqnfqqzixqfhxznkxhhlhfmnfpmqlyhmznlyklpkxhklqjhkhjzjpqkxkqfqlzjhffhjhllhnlppkxqniplhmxjmkxzljqjhfqppnqpmyxzjjimihyhhkxzylhhnllpkymzxyqypplxfqlmqzfnzyqqlplzkpnlilyjqflllpkzxhpypxpnzllppflljqqfqjnxxqfqlkqifmlizqikmznyfqnklfnqynnpqmzmfplmjkjzjlpphiilqzqinyfixpykjqpjfylxlqnhqlqjxkhllijqinnxlnpqylkjlxphllyhlpynjklppllifkpillqqqfkhlqkpmnzzhjpjiimxpfhhlnqqhfflxmllplkllfqiixxmqxnxzzlqzymqixkmppphmqpfnxlyykmipmhphljpxqyjyplnflljkyllhzimlpqphxlljlqfnilljpxinxljnqlfyxqplilplqkliznnpllxljlihqzmqlqjpqnikqpqfkqylflzmjyxkphkyihqyqhqqhlmplzkzkqpzlfjnxpmppllpqyljxlplxikljiflqmqnihlljiflzjzfxxyqyzyknyjphqypxzylzxjhfqmmqfhflypppjfkppzikjlxmqxzqqyfkkjqjiziphlkkhhxfhfxfniqxqkifqnmxljjkmfimypqplixlxzpkhxxixmppjqqnhmmqpmqqjzxpjqhhqxiknlqhkqllnihpnqqknkqlxmfyfikpqhjqxqjhymykmlffhplxlkqqilhnihjfxlmmnlpnzhnkhpkllykjzmpplkqxmflyhkypkzlypxpfykphkpzpzqpipfjxpyinpqfyinzlmpqnhnipqqpqfpmqplpnnpphyfijlflypjxkpkhfiypqypjplqizlqpkinqyyqqkzqpqhmyypxfpiplkikxyzjhilmnpplhpyqimzqqkyhqjpqpmzppmxflxinlhjmmlhqklnplmlpfxqpzhxpinlllmpfkfkkpmzxmykljhliqkphkiymlhyfzjiflnlnqiqqlxqihnzpfpihqxmphxillqlknnpnqjlqqpfxmzmmqnymmmpnzlpypnqpqlimlnyqllxqypqylllqijzqlyqhjnzhqnfqkfpljpxfpzpqyfxyppppqlpxqpyjlkjpkjiyxlffliizmxzmnimlfpqmxlnxylqljjijxhpllkfkjmqypiynijzqqhllhphijlhnzhkypknnihifnyjpqplzjlpxlflxnpjkzqihyiqxlqmhmlxhipjxppplqqjqnqpyzmxjmxipzhmnqnqjfxxxlilnpzqfqfhkxpnmhplxnhqnkqqzqffyziihjinffypijxmqjzqkfllkyymfllqnlpxqqlljyixqlqkxlizkzplpqqmzyihlljjmmffpznpjqjxjqhzziffjjqfjmykphhzhlzhhkikpfknjyhnippknzzphjipfpjkzylxxqzhjpikzhnlplzqlpqlpilpkpqzpnlqmpfqjhhqiiyppyqjmfnqnlffpikjxpzqqkqnknyfpplmlnffiiqxlzxlylkznlqjzfmpppzzykyqnmlnynznlnpiyjinnzlkxmqpnzizlfkqlqjlyjqxqlplqkzjjqipxllkflxqimpjpjmfpjqlkxjqkhlfykyhypqlflxqyqlqyymhnkyxpiplqxyfxmipnlppiknhxmmxqilxpklipmlqqxkxnfqmlpqmmpykxqinjkmizjklpqymqkphklllplqfnjpyyhlximpqmlllqzlpkklqzxjmfmppfllhilnqqlzxpiplkixnqlmpizhynfkqqkhlpnljqfqkjqnxihhlyqikpphkpkhlkypmzmlqxqjpflnhffnyyqjllqqhzmkqlqpppqjqflkmlpqpqlmypynhfikizqqpmhzminqmyjiqfxxpkzylkhfkkihqpnjfxyipzxppyjhpjlpnfqzifnjmfnlykxhmyqjkjyqlfxyfppzqpnnhpfxjlnpyfzlpqklxjllnxxzpmznhyhxklmlmpnfqppyjyzqixqzzqjiqznmkqmxzillniiqiffqkxpjipnqzqjxmlppmjlnhylihzizhnqpqhpjzhniqqlxpnhhjqfypjxqqnqqkpizppfnmjjqljqnkqqqmpqpkjfyinyqyzqfkniyqhjxipfyjyhlnfqpzxxiyjzfhzqqjflqfykpqzppqpqnhllknqfkyyjxpyilplnfklkynmmpqnhlqplpkhxinllphiijmqlmlllhfpnkxppjnxlyqjlylilpypfzlknqzllliiqpkxkjyxlxqklfmimjkzlzypqnjfiqppyylkylymqqzzmqmlnlmpyjfmiqmjpfqmjxpzqlnfflzqfpfypfnqxppmfmjqphhzfqifjilmlqqlnlyjxylxkpfpypzphpzqmllmzqpxpyqphjqnqjplipzkmplpllqxiqqklymxhqklyllkmzpqllpqjmkqfzlizpfhqnfpnlnlqlqyimjjhxkliqfhziziqlipnkplqqzpqnpnzkkylzhflnqnjnmlmlllknlfyxhmllfqqlpkllfnzqmiqiqzqifqxyfpjypzkqpfhqmqjpqlnmynxyqlxzmlzqlqfphlhhllppqifpxmlfimiqnqlpyqmiqjmkykxpjmlhljxpxxxqiqznqqilkjmlqqnpkqxmhlmpllfjpyqyxqifklxhkfzllyypmphnqqppfmxzlqmnhlzxnyplppzxfpjynqhzqiqmnhfynyqjliqzkjqqlpmjxflnlkjmhhkilmjxqzxjmzxzqklpjfhfmhnxpllxjqznqfpfkmqqqlplnhkklxjkiqyxpziqppplpzqiqfklpqqmpyzzmiqjifqnjmqnmmplpkhfkhpjflxyqkmzxqqimihzkppifpfqhjpzqqqimxphmiykynymzhyyplhppnqnhmqqnqxzpqfqzqlyzxhlfqqmplllqyqqqqnilnyphpnlqjpqlqnplpknipfklmihfzjpqmqpmyklqpllzllklpzhflzqqmqyxzzjznnhifzfzjpkylhyqqlxlqlyypqyxzpmzfkllkykhlppxfqljkqlfzpqlkfklqlxiqmpyqlxpkzymxpzqiqynkxphipyyhpnqkpyyplkymhxlilijlnlfjqzmfppqlpmmlpnqppliijqlflkqfjplhxflqxmpnfmhhlxiipqllnqlilkqnkjlpqnnhknqxlhljlxhmlqilffpjpqpljpqxxfyqqhplpqyxlikjllpiyznllxlhkpmlpzylpxihylqllzynynihkfnmmhxxjxmjlpiphqykmnfxlyhxzxpiqfzmfjhynfnzzpfilzlkhfllphplhkplyyhpnpqqqllifzkxppxpjjqnmihknlxfkllqmnqyqizplqnnhhzlqxqhhkynflznfxpypnhxlyzyhnmifqlppjlpnjknplipxkqmipjmziflpqjlxknlzlfhiqhhxfqhiipzjjplhlpnqymxikpqnizkpxiflhmjmhffxhmkqfnyiikqhqmjqqpxxplzpzmxfxpkmjlfpxqzlihpfmifmpnplmymxhflxjpippyfmpjzjpqpjpflnknjlqyyiqpxpphipnfilpiphjnfyzjlphpihhlfzxljnqmnpnmhpjnnhmpjillqkkyiihnmizqkmfnmfqlqkpqfxxpfhxhzlqqlylmkzjjmlylqfjxlflqpxihppmlnnlfylphkiliqqqyqpmmlxyyfhhxqfkxlpkjjplpmzqjpjlyfpxniqlpnkhlllllkiqninppfqfqmziqnpikhkxxplklyxqhzhzxnzxfzjzlypzizmhlnlhhzqplxzqqlpyjxfyphyqpiqphjxhpqlnfzqqihymlfnzxqklqzfifzilkllnjlzmfyyqxmpppfxlnyympflpmkimzjqylhqyknhplqqqplymxmqqlhhjmknfhyyfyqnzllnqzmqpkyfyqlkkmnpmqznnpnhpmlhnzzflkhqnkklhlnznznqziqnikfihqppxxpmfxxqhplkfyplfnkikzynmzqplyqfxlqlmlyqxpkhllmqknplpxmiqnlkfqxqnzzlpjlpqqzzqkzlkpjjlpmiqkmfppilyplxpqpyxflzlkpklpnkppqqpqnmnqqjpzlfxqpzmkfpnljxpllknihyiqiqxyqxppjzpmfxkllplyihflmjxpnzkznmhpjxkxyfqpjlfxqyiqqxqmijhiljlzhfqhlxpzkxpllfnlxzmfqhzxyklljqlqqhxzzxyqllxizpnkihljxxiyynziplliplzlzxxnnjpzyklqfhlifhlzpqpyjhnhpnxlpjqpxmyxliklilmjyjflnfypliqkqmfyqjlpffhpjyhljqqqynzzlylhnyhyjpkpplqnpnfpfjlqlpqjfqlyzzmzmjymfijizfylmmqqpllhmzqqxplxpkzqifzlpjqizlqzpyfyqhqhhkhlqpzmqqkqphkmlzhhlmlxqqmqjqiqpiplqxfljplzpqypqpmljkqlyqqppxpfqpplinqlqkfmpjyhzfhmqqxzhjfqzlkxykhxjlqlfflqnlmpkiqkqyypxkyzmkxjhfqhpxzpqmhppniklijmijpzphnylyjpxhqqziqkxqpnmzkxklkjxfklnxhknqqxpqqpmpfnqplfmflqylqmihpzpzkjlklpnmmkljpyplykpnfijnxnpipyymqlpzjzqqllnplmymnikzjzqnyklzyjphjlyfilphfmlkkffqkkqlhmqqzfqqnhnxkjiizzqfphplnlhhkffqkfjflqmmxfpjlkzjyykkipylliilqnflllppmzlqxqxnyykhpjlmjxiynlqnjpkkikhyzzqjnmhqqznzkhyqnpzikqihhqfxiqxhkinpzxylpqxpmqpnlhnhqlkplhpmlxhnlfmiyqqmzpppylqxlmnpmqliyzyznlpfqkijmppjfqjlxpjyjljflmzlqqpmhhxpfnlmnlmfiynpqyffqkylypmxqqjzjllxmmlphipylqnllnlqmqjxjkpmyxqmlxlqqxiqxkfjjpxplifnpiiyyjlpqhpzlqjyqphnlnxqypqppxjkpmnplplpnpfhnnplphixyxnxzxyzlkpxxzxqppmpqyljqlhpkpfhlnqijzmhjpmxpfpiljpfzqpikfjjmxqzpkkzpipjihzhpfzihnffplxfzhhpmmkpjqyipqiiypphyjhnhmxppixyxxyjnnfypqjxpmplqhnjlnmnqhnpzpphiqlyzkmppyqqjmhzfppjhzqihpqpfqqlxpfqplzzxpljzqxkmhynxjmimmkmnpppxjfxzqymfjxyzqyffzyinzkqxlyxqpxmnnqlixlxlkqfjjqznnqlmkjpqmljzxzlymxqhjykilmjlqpnqkmmpzzyjpqiqxlyqkihkpzqypzmqxylmplxmlfzkhqpqijklyfmippqinpllnljplnqijzjipjmyqqlmhqpzifplqiqxxqppjjpjqxqhnpnlmqjlplipqhxfjznplpkmjpxkqmlzjhlkhipqkplzkqnxlxjpjxpipkiqmfhxqjhlfxnpxhjiqqlphxxzijlnynyzphniqhqppimknkkhknxplyhqlmzqqnkyllpxxppnlpfznmhhimijximkpfqpphpziljxkxlnffjxpfxnnippqlzllmnflfklzkfnllpijlynlxxzffllkyzpjxmiqzphxphypllzimqzjkhlifyyflhnkzlpnmnzphqpixmpjjnyjjkyynnlqihnplqkqyykmlxplpfyflkmlmlkympxmyjiyjlxqfipqjfklhkklkmiyqqpnkqhzxlznqxjymxfymkpfjpppppkiyqpllxnijqlqizipkylqqypnhilfnljqzyhpjpmizpyknyjxkqhplqzlpkmhffqjymqpmnyzqmhnzyxhmjppykiqjzihffxiiklqlhzhpklhnpnqqhfxqyjpqpjqnqpkmfiqflnlxfflqpyqypyzjflpffkqmqhijppjqqxpmpphqyqhmpnnpipklqqxkfqlkjqlilxqpjnijyfxyqhlyjlhznxjlfhqzflxzxnpjfzklzmpfqkpphjqnkzpllhifzfnnzyqqxhfxzfymlipfznfqxjmmplymqhxiyppqqlqxjiqknxlhpyxixfqqmmphzyqqypqlzzzmlppnnhiqpqjxhnylkljmqpjxpkmzqyzlfhihljzqlfpfhlipiyjlzjqfpppnxzihpypllpxnpmzmjqpqpjlxfyfypykqflqlhyqxiiymlfqmlkqjzyyijpmyyxjijhhlnkykqimiyiypimzqjpiqpymlyqqjpxkhpyqxlyplpqfqqhypfhikqlqlzlqlfnpfxqzpmlzlzmyylqklmfjyhmilxqjmkpzmqpmnxkyikpqhmjxlinnjpxzyjykhmlfxpklqllhmlpzzjkfmyihqqnxyqqpmpppznmlpqyznqmppqqfjllnlippfllmfikffyzpizqlqpqjnyzxjpixxjlpxmqqzlyyxljyhnqjlxixqxyhhnnnqxpqlkxlkjpllppifqyphnffpizplzqkpmnpiqyqjhxhnifqphllflmqqzlykqmqzpzinzplmmqmkxljlikkpxfhknmilhlqpymlzlkiizilplxnimlkyiqhlyzflyyyiyjqnlppyzikhnphzippqmypznhnhqxyypyzqkplzmypkxlkjmiyjqnpmyfqfkplxpqpfqyhymqpjpzzlinfqyjqpiqnmzfnxzpkljnzixikyqqnjhqlpilfjzqfxllpyzxxplxnmjfllqlhypjllmpnfqpizqjmnhpfjkxnjnxmqkiinnmqlflqlliyfqmqlnpflynykiyhpxplqxxlpjjlfzlpznmlyqmxkqzpzlzlfmipipiljyifllqhjjjqllqhpkyqfmjyxzlpjqhqjqznyqhxkhpfnzjpnymqmjpffpfjpjmyhkplhkpfhxfnyllyffnhhqyppyxkkhkllmpfxhpfqhyfzqlifnhlhymfppplnpphhlkhmyhxmxjqzznlnjxzljqzqzppkpqhlfpzippkhkylynjnmmljjqxpzmjnppqfjqpiylfyzlpqnpiqnyymizjkjxpqlfmqmlyixfyzpihhlkmiqlljfiqhnkljqfqxfjnxzqkqjflmyplllqpznzhfkqzlfqqjpxxhpqmpiyiipklqhfjlziziyqlhiqfyzxxlkfmqimqqiphzfqpklzhzkpxlzfhmyxipqlkyljmzznpypfpffqqxijhxllyqqxxqqpyqyqqzjyfkyqxfqjjqqiiqqypyzjzllyfmjpqfjipjplfhjyjljphnqzjixjhqmhyyijppxjkljylxpqqnpxzljhplhlilikkjnqnnpyplpmiqhjmixqxfpnqqpqkqqqpxxmhihfmlyxyqxmykjmihmfpyiljpqlpqqqjjjlknpnijmlmlhqjzzpjppmqlnzhfyzfikhyzqflnqilhpzjipjmhmkxhplqhmijkzmfxhyfmxnziniiqiqzxyimzjqqhpmhiqypylhxkjjzkqmzxyykqiphinzqliqkllpkhlqpyjxjfffykxjlqzxqijimypxlppfppkpphzmlinjmpzpfzkqhzpyfqhpiqffpxpkjmqmqymynmpjlmkphmknffznqxjihynfpkpzfynihpkqhqxnlfiyllphpmpqpkqzlxzzzkqkzmfjypppplinkqlpiqpfqxqiyimmqjlmjlpplnxjlnkyxlqfnqyfqqkmlnqhqphlpmqlzqklyqpihfplqhfpmlpfxyxjppfqfykzqkhnjjjxqqfjmxkylyhxhljljqpllhqfniyzyqnpxyjzlpihfpjpnjlimqyjxmyjiknflkjqzllypzqkpnxnmjxpxjpxliymyqqkmqmjjhzyzfiqniphyppmnqlzflqlqnlyqlnmlhzpqyhlxmjlzzhkmxpzyyhinqqfklqliflpqifzkxqqnqjqmnzzlyqnfihnnqpiqqlpfyylfpijxphphjpzxlqxxmfxlminpxfpzfppjmnzxlyjqqfxhiqzyylmnmhjnjyyfzqxxlyynqlfllhxihkpzlppkiqxkypzfyjilzkpynfznpqjhkqplliflqqhimlxyjfzplnqpqfqffqlzyypmzzqpzfhypyjqhlnqmlipqqzjhnfjhzpymnqfxkxfyxljffyfpzikpxqxhhlqlppmqniqfpxqqkfnflizjqipqizjfimlmnpqpjqzyxhppmpphpzqhpiyxfffqlklylzjnziqixkqpqhnxhqiqyixmqjnxlqphyxjflqqqzllzmilpxjqifqqqlpljiylmlkfnqqflqqqyhyfypyxmjplqpqqymjjninhqqlzqmppkxjxqifpzfyqmhkhmnfnjzfznlylijzijyfppylyfpzyxkmmpqhppjpklyhlpkkqflhmnxhhlpjqqhphzliiplxfijjzfzipfqilqzpljqllpliipmzqjxllznifzqlkxqzmlppqizfqqxlxmqflkpplykpqzlhhkqfppkqfxjmxqnjhplhjpkxfkzxqlpqkpxhzifqhlnkynlhlxpphplihjiiznlpqyfpqyqlpxkqpqhmyzqjkinzzlppqplljipljlqklnyzklqzpnxmflxnhpljfmypklpmnjhkzxkqpqzypliqnlfyqlqqpihllnqpqjijqqippixmxpqlkfpnjihhlfxpyqzqkfplnlqnyyzmlpfhqnmzxxqfkjplpnlkxppnipjynlqxpljymfpqljfxnqnmplizjkiiylllxjhxpnlfpqqxmzqplhpfxinlpnmffhxmxjlnlzxizpzypknknlyklyzqqzllihjqnlnixxxllphqpzypkxymqpiqqhizllhjzpjljymkzhxjjjhfqliqpkqnplljjplpyklpfmfxphmmyxhjmkmnlxfllmmizlkqmnhjhpmhhiilpizzlfjjxfqnjpipxqqlnzkqxzxxfqyizlqpyqkzxfmlnmqhqxqhhhkykpxhnxznqlzijpxpqjlnplqnhkkyxppxlhpxnxyjklkkyyflmkqqnhilzzpllmlqqylkllixlxhhlnmqyynilzmkkjkqypqzqjflnymhphympnkqhzhffnlflzlqlhliljpikijmnpiplyhqqpqyjnihqnjnppiynqqfqpkzkppphmpqjppmmpqfqxmljkxijfjypqxznnplhflqjqpjhlhkpqqkpxqznhphfpfhyqllqlqqqypiqjqlilllpililhylpimhfknphnllhpklhlynlypnxnfxqlpqzphjqnppmfqpzmqxhpymipqlfylpqpfmqfhqmhmmxljzhypilzpqmkjilpyqllklqzpqqlzhqffjqjlppqnnlnqfilkxkfqpfzlylhykjnlnxjijfylxlppyyqjpxjfkzlqhfilnkllqxpmqpfyymzlmihhfkiiflnfnmnpqifqmlfkhxppfqfljljpifjkxlpifplyyhmzkmklfpqqqllmifyjkjqpqzpxmlqlxzynfpkjxfyxkqljpxzlxjlmkqiqlzxlqxnqmpppppllhmqlxpllzqqmllfllixppiknljyjnjxqxflhipzjmmqplijfxnqxhxyzpyfqmmzjzffppjpppymnzyllfifxqxpljylnfhlzmpqkjpxhyppppqmyxykmznqflzqkllnnmiplplpxyjlpnqjkffkfqyqflqqpzmpqzjflkyjhmynlhlzljipmmphlpnqmpppixnhhlljpmyyipllkllxxiplzqllhqznjklmljxfjxzzmlhhylllzxkznhpfznqqpnqqmyhqqjqqkfkqjmxmlfpjqlnyqkjxhqlixinhqikljlflqljljkpmnikpxhkjklfzzhmhjqlnxlklqifxqyzlxhiknmiphyhzllyqyppiljhpjhkpqfixqyzknmhxpjzqxqzlkhkkxjlkyzjkinjqlqllxmzyjimlljnllqkqljpkhpnhxxlnpqpppmxxiplnnzxqklnkkjfpjfpqipppflhjxmimqhzqkpxkzxyqmjqlhqfiqqlljkflkmjjkiykpqnqqqfiilzlynlzfqjkqhqzhhxxymxqhnyjlzqppqqqlkhzlnnjlzlhpknqjnfkkkpqllppmfqkqjpipjyypzhpknzilpnqjkpkfyqxplllfjffjkqylmyziqppjnliyhkfjllximxxlkphjxfqpmppfyppzppllhpqqzqqykplznknhhmqkxxmlxkiiinpqhyplqpfhimhnlmmpxfkkjppmlpqlhkxpkxypxqkhpjqqqmxkkiihnqxllyxppnxqkqkqlfnyxplnqnpqlqjlipzqmxjfnyqxnlkmqymnqllxyyhqimixfxninqphxffqiqykhnxppyqfmlmkfpknpljkylzipqhpqypnpklpkjmpkzjpppqlxplpjqppqpkqyqqkqnmlpzmmfnhhmmqhlmlmlyzqlqplxlfpiplnjmilphijjqyqpfjmkqlnhjzylqkjjqzplkfljhnjiipyxlkyplzpmqlxfxqixnphklxyfnpppfjziqyilqyjyppkmyxqmfkxyqjmzyylxmkyypzzmzjkpifhnplkmxhzqppzlllfiflikiqhqphxlqzppkhpyzqqhhzlyylqpqlmpqlhjpqllplhxpqxyziyyypklkznlynjkqiyphqhpnhnfpljplyzqpziymhzynqkpkpnqlmnphmlhylxmmymkmlqlmpnnjxznmiplqznpklxqnqyzzifzqzizhyipljfzmlphpqhmqkfxxmkxhqhpnphfpqqlpmpqnqlzkqfxlpzlxmqkfhqqqxfjqljzljmjzznpzjzjkpxkniiiqkqqpmpmqilqjzmypyppznhnqkmzzqlfqpnnqqlfmyzkijffxkmfkhzqzlffyxpppxmlnlqnfqzmzhxlqjzqykfpyphkmjkxnlnkqpxhfmpfplnhnlyqpzhkymlznlnllmqjhyqzlyqlpllmnllipnkqjfllhznpipqkynfyklpjklkypjpfkhnppyhqxqmxmxklyiqfzjxzppppjnyqmihjpflllyqilmlikxxfhpzyphxfhzllylffmlhkyfpylnmqykqiqllpyhlqlxqyxpzxqfjxlypnmkxppppixklqnpjippmmpqhfjyxhppqyqlzpmmyqznfixlziimjjqxxxjlpzjzjnqqfxnplqxmpixliqipjifhlffhlmppfyqxxnhmkifxqiiqlfpzhlzfkjkmfzplpimjjfjpqqnljixkyqlpfzlfilxlqmxjlxlpkyqhyllmpqzllpkhmkfkilknixflqplpmkxzppplyqhxnmlzjfylnhlyxklpzlmiqfmnixkzppilphplxzlzmlqyiliknxiqpzhkmjhllzkkylnjpnxxliqiqiyklplnmnqpjinhkxjqyfnplpkpiklqfliykfiqzpkfkpppflqlqyqlflqxqxnhlzlmznpkqlkjxhqjlfxlhjjkpykykyxnpkfflkfqxyqjlnikqpmpqimkqnxjplnmxqxpfxqnnnhlhllqnhhhqyxpjmlmzfljjypqqzllnmpynkjqpiqhqnizqqplxiqmmkpplpkqxfzikfxhmyhqhphfyxqjzilklfjfypxzpjlqmhjjmjhfqkhppyflqqfmhzppkyhzxyxlffflylljppnqfiyqmqkllilplyqikqmqyhnpihplpkyphkqhjizkjpyhkpxqhnknmflqyqlmqyfqlmlhhqhqhllmymxmyhpqykqqmjyxhnqpqlqpyfqqfzxilxjmnpqqqphlpljyqzmfnfzpqljmpihlfjlfqlpppipfqnyxqpfzhqpllzxzzhnyfnqplfhphhmlhzlpqlqpillfpxlqylmzlqflqqpxhynqnfmxkxlnljmklnpffqyqzpzfhqqmpqzqqkqzqpkklxfqqqpjzxzqnhqlqlpqqlmllzklyfzlixijyplkjynkqliqllnqpjxlmlnkzimphxqqhkxzkqxnnlqlqlhmpmqxlilfpkllixmkxfpxhixzxxxfnqjxppnmqlnfnxylfjpfpmqyqknkfqpqzqqpqpiiihkhlxpzqlqqilyhmhympyyykfxympyikzlxymzhhqppyplyhmpkplhlnlmqklqhpmpqpmlyffipzjhxxppxlylkjmkpkfnxhyfpqzhzppkkypxzppkillfkyhfnmpqlhpqlxzxpzmlkqlinjppnpylljnnqfpzpzyzilmnmpklphphjipyppqhpiqiqzppqppqhlhmylqqplqmlqpxfyxyjizlphmppxyqnjjpxpynlnhhflmqxflpljjnqxxxqnmfzylmzyjqqjpqxzhlxhlxzpfkzljflnxznkqnnpfhhlilklkqfnhqhxhlpkiiqxklhqyxlfmylkknpqnypipiykilliplypqliihmlhizznzfyiqqknqqxhzqlqmxlzpxjjnjllynjkpjijplnmnzyylipinyhhpfqlfyjqqzmmfxfpxqxljlhkmpyhfymhjqqmmqnkmylqqjkxlxkqxqziiniqmxqpiqzhlpypihjynfihfymfmpjqxxiqlfnkpzmmlxznxiqpknkmmpknplxlljxfpiyijpqljlqqlkipjjqqnkzzyjqpnqnnjfzqqffxlppqnlplxinmypnjyjqjzlmylzijhphnjmikxfplhhqkjphlpfmlljkxlpfpqqjllqplpjnmkpijlyijpkmniizjppkjzkyhjjihqhlmjmpzknlzzjqhjxkxqzilinxppjpjlnyllnyqyxynxnqimyhphqhnhllzqfqxklzjixlylxyfkpxpymiklklhlnzxhkzlzifqqmjzmnlqnljplnlqnlhqlnpxpxyjpiplpjypqznqflzpqmpnhpnpzqxpqnnlylnqhppqjypmphhnqypjynkpqmpknpjnlnqjlqimmmmnxpypixxlqnfpnpjqxflkpkllfqqjpnqilfxpqqhhliinhyxiyfppllqmzzkjqhlippypillkjzyppjqllmlhplnmlflmkxqhxkkqqqlhhpymlyimfiikpqplpihfxlffimzhqpnlmynmqlmnilzxynflxlnmmynyymlnllqjzklplmmiiqjyhqzqijhxyllmnklqyjxiyppkjlinqmyljkzlzzqzlpqpyyplhilqplpijhfhqlhqnzlpizklpjplnllmjzhnppqfjkjfilpqfxnlxlqjlpplyykqiqlyznqqjqlyimxqyippqmqqpphmikkfllxjxxlhjhmmfqyxhjmhjymilxhpzmpqxmqqhhqfjmjylqkqqxikymznyfifpmznnfklnqjllxzqyqzqynfmqqqzplqjlkfzlifxqzipqfjpxmqikylfjjqnzixixplnxqfqlyjqfjmmklljfqqzmjzikyxflflnqmmpzxfxpklmifypxlkhlqhqlilnfpqlmpzyjqqimqjlpppxihqxihpjqqyxnhlzqpilikyqkhfjhinhmljpnzylpfiqkpfqzminyjlqiziqqjnmfqqnxhqzjxqlzlqpqqxpkikjyxmlpnmqxynqzqlxipllzmyphnkzqhkfjimqjlxmpklpmjimpmqqpilqlqpyhplyfjijlllknxfqpxpfjjnzplhxqpmqimpzmxqlxlpjmxmkyqqmpppnpnmqxfpkmnllnnxpfffzlnzfymmjhlfqylqqyqpqixllyzxpjhyqlziymppxfzznpliiipfqhhxllppllyfpxyilmpjmxlyzmlzjnnmqqlkyppzjlppyzhzixjxqqxjqzfxphxphkyypikpqmjllpihxjzqpkhklxmpzmjhizqxqzpylfyxqqkllnyfypillnyphpqmpqpyzfylqnympijpqqxhyqmlqipipljnplxkjnzzlmznxnqqlpfhqxynxljqifxlixlznziplpqnxnxlxhilyyzlimynpfnyhpplkllxmqkppnmqilqyxqizflpfhfyylfpjyilmhljyqnhlllyqhnxjifynzfqliilqkjpqpjqlpnqqpzilmhxpjzlppfliqnjfnmllqhhqznkpqlilimnxllhqllmmhjjhlyjpymmxyihlhyqqplzymyxmqpfhqxfhxliymzkkfqqkijxqmlpxmjnypmiyyhkffqyizyqyzymxqpplzfppppmjfhpmyhxpzfqilplxjzlqijyfqfkjqjpjjnklqxklxilxkmnynjyqkpkzxqmxyympfqymkjlqmqmkizfhhqjxllppnqyqmlnpyyzpfkqxfqfmixjyplzhzzlkifxizzxnyxkhpnqnmfihnkxjhhplmfpkjfqmlfhifqymlqpzjpqymnjxknhpyjnlylqmkllhxppnnlijjphhlffijpfilmxpjpqiimzjqkpjyzjxmzppqlnlzjnfpfhlihyqqlpmqqkpxxinfhpkfzjpqfilmillnkqxiiyhixmqjipjplhxnlipphpfpkzzxiqjhnjpjfzxxpffzqqiyqhlyqinfzyhqpqpqxmjqhjkphffzpinjzpnfxnfxyzyzzxxpzymypylhipzfjfyjnmzjlfqillxmlyplphnpjfpjpimximpxpnxlnmpqlhpplmzipfklplikkjilpllyhzpyzppnqzhihkpxpqfkixfzlninlqlkqmpyfykzqnymipxlpqqfjplqklhkpymqhjqfkxhqfpjhzpzqlpzpppfplqjpkixiqpyxzpqfffxxqzllpizpqznpnqphljpjkiqqlfffpliymnkxyqqilfflplmnjlypyipqqpjlyhllixfizpfzklqlikljppfhiypiljjymyppxxflhhkkzilyhzzznlykxqxxkmpkhlpylihpnmnkpyqhyhlqmlqkpizqxmzllzllnzxfqmmxpihxiqmpfiypqfnpmjpkqiilzyphlnjpllmpjxlplzlljxlpzpzypnzplmyizzpxpfinxxxfzyxqmypfplflxnxxniqqlphkfxqppjmjppzfpyphyyzfnpyxjhqqqzmkppzyllifqklipjlqmjpfplmpmxkkzijzlmxpqqnynpnxqlifzzxlhnpqplilnkhiyjlnifpykplqqpxqhpmziqzpfzjzykiympyplzyfhzpflpjkjklkmzpzilihkinpxlixlqlxmnnqnjypnljlipmyqpnypxplkzphniqlpxqjnzhmfilnmpyfnjqqkmynqqlznqxipjzplzymyqpzixjxlmqmyxlppjqflxknpijmqjxyhmkqhlxlnpzhnilmmkipqpyzpxpxqpzilpklpqqnqxyhzkyzjiphqyximzzmppkyqqypnlqkifllqkmpqhfmpkyphhpqppxmmpmfzjmyfqnlliqlmzzlmphfhqzzmjqplnfjqzmkpipqzxpplxyjhlyqnkpjjzqqyhpqlzfnpymllpiypililpjmijxxqyyhkjilxjplxiiiqzllkjnqfkzlpfzypxpilflpmpjxnqfjnnilljpnzziqzxlixlnqjjqqlpqfffjfhhppjipzlmlnjmnliiilphpmqpxyyxqpzmixpxnlqjlhfhlyyfmmnnqkijnzkpkpykpxnyqfxylipqllkzxlppmnlzxpfmqflpppmmxqiqjlkkknqqlfqqpklylqzjjxlfxqfnljzpnpqhlyhqmqjqnpnjxpnpqipqxpjhmyixyqxlyzqyfnypljnlixplnfpmqzzxjhzpzkfmzzhlyyqipilqlxlzlillfyplzjiyqqhlfyphfknnylqflpylfxpfhfiyjhxhllqyynkxmkhflkizllnxhfzphxnfhppfilxjilyilxmmipppxlmhxpxkllhlqxllpnlypyqhxyplhzpqhpqiipkxyimxllxqipnpqljhmjlpkxmyppxmqfihqkpllllplhzmpizkiifzyzjlplyyxjlqlypfqxqiqjlqqzlpniqqhpqknyizkqmxqklyhpkqzxnnzjqqpjqqphyjqzkipljzpillhmhqylxnpjniyyqfhlxqhhmxmqfxqqlxpxyhkxpljzhpqjfzynikkppxplzfpxpklhpmjjpnjqzqqnflkjykmifnpplnflpilplmfkfklmzlxkllhlknjlqzfhplzzmhqjfnfmiqpxpqkzpzihpymplpmhjqmxhzhqqzjilpkhppznmqlkkfnyjppmpknmnjlqqpkpkfnyyqxqkjyhpqhijkhfjhnfqpxjfzymjpzlyfylnnypkmqzjmmzpkpmpqlyfizykzhfmyhqqpllyfnkjynhlqyjxqhkpkpijqlfmizhziiqnqynjxjxzlqjlpllykpynqmqxnjqjlmfzfyxlqppfnqmlljnmqqhlfpxlixfffhiphkpqqpnjfxqhjfzhjyhixmqiyiqmxpxlylxfqjqmjnpinqqlhqyflllpfqnnpmqxppnlynplzzzypmpfjmiylhpmipyymffpxmkmqmqixjylimpyqyphxzqklphllpffpfzkqhkkqzfpqiljnjplfnmfllkpmpjiqpiiqplxkkznlqlinxpqqknpxiznpmpnplypxpyzxxjylxpyqqipqpnjjxpyxphjxfpxyfppnlkqhjpkjfmjzfklfxxqfkxxplllmpqlpjhhkpypmhkqpjmxkykhlxmhyqnpkqjplpqpfzfkxhjmfjlfjmkyniqhhqpkpmqplfmlnqhpqfxqplqxipzqqixxflmqplflhhkhnyikkpfyqyffmyqkkzjxqfzxzhqlyhxyffipklznkinjlpyzxmjhqxpfnxjylfyfhznnifjmnpzlpmmllqzkpmlkxiqzzplnppmzzjhqllllhypqpfilqiqpxiphijqjzxqqlipxnqqmpxilqkpfqiplizykklqhlmpjyjnpnnlllxmkqlzppmfmzmlqkxqzzllzkqfnqpziyikjpzpzkzjpyqklqkxpplilpllmmqiknqjhljikhfllmfqzjzqyhpzqppilpylzhpzxjmzihlzhikpjhjqpfylnmfhqyppphmqhnjjpilzyhlpqjzqynnqhimijjjffiqyxpxjkxqlfxxnzpnlminlzlmlxyhkqxqzkilzfhjlillpnijyzlzxynqlylfqnmjmlqkqmjqllzhjpifjhnhipliipmfpnxlfilfpqpjykllkkpqkjkplllzmplkqlizhfjfxpiqpxpxxplyhiqmppjxkqhjnlkklphmmliqqhjqfkkppfmpfylqlqkypnkzlmhzqmylzxmnhplnkylmkpppjqqzxnijkjqqxqqljhplknpnnhplqmqipqhfkqxzpqkqlhnxkxxlkzimlqzhpxfqlqmyxfmnkphjqlqhhkfhpqixjpqzqjznfpxqlpxjljlnjnzqplqxqjpllhqnnnqfqyfyhziflqpmyhpqhiippzlpxqfkpqiinzjfnkkqmmfhkyphkfypplhqjzzqxpqpyjkzkihzqqpyqqzjjyilpqjphnlfkhzqklqymlnmpyxhnlfpzmqilkqqlplxzllmnfhjfmziynppxjimqjfhlhnlkqzjflpyjmzhyllipmfhfhflpqxnmzkfqzflmxmlzkxfmlyhlqpzpmzyyppzmyizqqlykqfllqifyxkjpxlnmypfljmkllzpkhiikzlyqzjhqfppzphkpppmlqjmjlpkppzqplqpplxxmxpmmnhqqlzllhpnqpzhkqqlqymiqlnphfhllhqfylqxzqljlpkfljfqplqqxkzyhxqzkpmxhynmzzzqqlmqlzpnpzfkqppqmfllffpxxylnlilijppjmplqpfylqjpqqjimflxlpmykjhxylzhjqihlljnhqpknyplpixqpnhilffhpmxqylnkplphkjnpqmqljkzjnpjnppjilmklmykfqmqkmpzylyklhqykipqqjqymllinqqhkzmkqlxlzqfmqippijqpxljiymlflyjmhmlmjhhniihpmipphnnzmypkzzpmlipmlqlpkimxlpnipmqpzhlkzmymiqpjjlympqqilnqpllnjlzkpxnzqnqmlxypflqpmfmllypmqpxhxxqqpijmpmylqxqqypyfmpxpjpphllzlmpflyjqynmqnlnpmlqphhzqlhpjxkjqxpqjfyjnllhlfjzikpfhlkqyphxjyxiikypnnziylhqqpxppkjyzqnfqhzlplmyhjpxzljzlpflypzpfhqiqnilqhzqppzqhmlpjhlyjlhipizkyljnlmpjnpmpiymlpipyzxfpjqllhyympxpiynzmqqhjqlymppykkypklzklzhzyjklzmfjmlyxzklmffyzlzqhmpkpjlkzxhjyfiffjpmjzqlzilqhflyiynjillzzqfmfqqnppqzilkzhqikkljxyxihhpyqxqfijpkpklzfqmizjhllqhqmjqxpyqpzjqhypqlkqyphpyklnpfyfyqlflkxqfikqyxyfjhlxjlihmqlfpppylmkmqmjlyihfqppnlkjqzjillnlphpqjxmqiykjxihypqynklmmmmpnfxpymqhxiqqfzqzymnjnhqqpzillikymzxppjihqyniiqlnilimpixpzylhfxpnlllhlqfiqkixhhqhlqyklpyimlqiqfqiipmxymmqlqyjipxipqfmfxmpplhnikpxqxpfxllzxhqyflylfqqjkqkqlqmlxykkkqpfhpqziiimfmpykqpmlpppfqhpnfympxljmhyflmlpnpkppilnpnpqlfnjqkykxqznifippqjzmlljyijkyyzzflxjqzhzxjzzpxjnqhzpkhqkyfjfqlnplpmpjpqkzpjxhqlihpxhlzypqllqjpxlpyjllqnhpllyzkpjinlyjlkmhynziixjmmpnzqqnhzihplliqzmjpqziqzjzqxilzkiizkpjllfyjllkipzxlqzlqkiiqlzyplihpjqpnqzxiziihlhqfnklqimfjnynnfylqhnqxkqzqpzlfxfqqlyfhlphfxmipyqhpxqxfmqkliypymlmnnpnqmpkypixyjnnzhhhmpyjzkpqpllmzlpfyjkmyqhkyiqhzxyfhqjfqmkzpqlfknklyfyxflxpqyzllhzlmqhqqlpmlinqnlmlqzppjklhmkpkjjknllxzqfpqlljjlizqkqzhfzzylppqfnyqxkimlqzqpjnlzfjmfyippplhnhziqqyxnkhqylnmlklxqpppplkxqypmjqfmiqmlljmqxlxxqkqkpmfnfynmlljnlhizxpimkjkkkjjpzjqzpjflnlqnypmjkpfqqxkjynqlhjiynlpjfizypzjkxlpqnkxqynjxjnlmpjxqlinxjllyzfhlhyxinypzlfqllqnkklzpkqjnfxfqxjjqmpfzhiphfzxkjflmiqhnylnjpnyqyppxqzqmfjzphnmfzyljqfqpjplfpllkifixmhiqyyfyqlhqizjmjlkqqxqfljjipkiphlyfmfnqfxfmlklnlpjyllqzyqkxxmppxiihylqpiqkzyqlkxhfqxqlmjhqnmyliylqjqkyqhhkifpifjnxzpzkikfkhpqkqlzfzpmqyqfqikkqihqmmmnzqhxxijqlkqkxxhyippxhxqfpzpzhlxphhppljqlpqpfpphppmppphymnynjqlmhqjhnyqfkikfzmxpllyqnzlylhnqfkpqixpnmfqqkiijnjylfhlkmqmqpkqfhhzxmxhlffzxjpnflpxpqjjqlxqhlpmnililillxjzmijjfyjlmpqipllhplplhmzmqlmpzfzqqlkhiypzlplkllxnfilnlnqljxqqlzplqpnxyfkljllhknypplmfzqmyiqklhziqmqqqyxlxlpynnppqpmfxfqijhmyzpmnzxmfkkqlhphzyphiphikyphxynxiqjfkppnpkjqyikhkfzjnhmqmzfflpxmxqhmhlynynpiqmkpnqlzkpnqqlymnmipypqjmhqnhypxkypqfmpfkplnnmlzxqkjfjijmfpmnlqqmzpypffxhppmxzhylnqqlmmmpiillpqyfiqmjqyjhnplzkmqinqqkzzfpqpqmhjplxfyqffkhhlnpllyllyjhnfmmmqflllfjxnfyhmmkjnllqnxhnyyzmfxmpyillxkznqhjylinqmmqqymzklkypjzhppzxpnqyzjnqpxlnxhiipylpqnqlmilkmxlfnxlppfnxxhpqhppqinkpppnlnxjnihqxxqqppnkqpippkmpqllfffmxpxlqqnqlfkjnqklpxqinzlliiqmlqpqfphziylqxxqqpqmfjqpmpjimhimhqfzlppqnkxlmqlxqhqymijjzmqipqflpkqqlmpzxylqxpjzmhqxzlypfmllhqllzqlqflzyqkfnqymxmzpqnhqyfphnpfyhlppfnljzjimqplffqiyqnqxhjnikkkxpmppxfynlplnhqnkniyzqyzpliqyljpkflqxllmqhfxpzqpmlzhxymzfqxljpqxipxkkplzpxhfjznypqxmlqfynflflqqxlhmqqxqlhnmylnqyqkppfqlihmxnkixzhpnlpfmkqpfzkzlqlhpkpqnmzpnlpphqlpkfmqpqlfqppyqhjkqqhxqxyfjmjnlmlhlkjqnqxljqlhilhqpfiyjhlyfxpxpxjpplqzlqfhlppqynmliqymqyfiqyijihfqjmmpykzpzzinljznlhjkkqqkyqxpfyxqjzllyfqlhzjlxpzfqffpflqnlyllllfhyyymqyzzylplxnmxylhplpfpkzilqlxlplkqipqixlqjfimzppizllflkpjqklflqplkkqxkyflhqixxkixnpqpklfmxffjmpzlnnjfnhphnhkxqxxfxhyyqyhpyllpinpylxfjqzqzlkpkhfnhxhhmzqlfmlpqjffinklmjljpiyxixfipiqxhpflinqmhnnhhnmffkjppimkfkxllzfmlpjklmmzplpllfnjnlqzfplxpphxhyjqfxnpnzmlqliqlhxphyfminplxfpqpmjyylxkjxiknlpkxpimyqhlqkqklfypqipxxqlqkqqqjfppyynzpqhnilpipmipkhxzilxljlzpzhxnqjypqzffqllixqlfxxppyjihnqxqpyxqiylilfplqqmkifnxplzhkzlflpfnlpqqnljynilpliypypqqpzlqqzlmilplpjfkhmjzkfqnypkjnknqflzihjfzflizpyhlhqpzjxxymkknymliipplqpzyyiqhlpkhmkyqjpnhjxpjnhqjqjxmhpmqmzlylzpxmkihkpxhnxfmynzpimmnqpizjpqqplzzmqqqnxlzfqjnnzyzqpliklijilnpyhffmhlilfxqzjjqzpkmixliyzhhpmpmmjpxhmilqiizkxppqzjpffpkizjmjffphiqlhxkmpflhfnzililipqylxjpiiizfjhpnkfinyzlhzyqhzklppinzypmpmqyxqmfhnljqhpfpnppqlklmzynhfqlmlhlnphpqqnqinpxkplqpqinzkizzllyyypkqzilmyqikfzhqlhpfkxzpqqhfhxfinplknjxhxhyppqqfylinhmxjpflmmymzpmpyqkhzlzlxjkqqnqpyzxyimxmkyylklqnjmqipfxjkflkhpyfxyimqlpqkpzxkziqqnxijmijxzplqqnzjlkpqqmpmffmzqqxqpyminjllqimlxxyxlkxxmjlqfnnqkmjjkzzipjpkznhppxlpqiyqqpmyqqnzpfmplqfjjiniqqpiiikhqzkpylymqylhfqjmnhlyfziizxxzkzlllpxpnzkyfiphlyzxpxljhpxkqppnmzlnlzqqplhqlnlpxnjmininqpklxzhilhnxynlzqximyqlkyxmqhpjnjkmxlkmlfilfzmylzhqkzxzipjlxpllzppkklplzlkzmhmpiqizkhphfqqjjnljiiyzxhpkljjxmnhnnkmzmnypqijljxhiyxxkppmqqjfpmfpizpyfffkzmnjqzypjplqhnqiqqxxxfpqmifzpzppqqnnhqflfliliqnjhqxmpzxixplinhxlpfnyhmlzqnjllqxkxzxhxkqpllxxizqppqnqqxkizlmppizfflxqpjyqmqyxxlynznnllmhkpmylpmpjlijkjhjqlhpnnkjxyyihlqzknyfjxllxlnlkxqqfzqqzhiqhkhqfqxzqnqiikqpjixqqqzzhlfipnqxqxkpqhlpjpjlzlqplxqfmnxiyminpjnqzfxzpjlphzinppklnlylppxzmpknkimxyqpxkzjylfqllnpllxpmyppqjjqnmnlqzxxlzjpzplqnmqzppnfklnkxyhmnyyqjqhnfzhhhilxlfjxykxkizlqppimnxlqyhqnmkljkqqqnilymhqfypzilziyiqjkqxpxkyjklylpqqhihklpjhxlzlmniqjpxnnpqpfzqqfpqhlmlqppfflmlhzypqlxpmqzzpiqpnlqlyjxfllimiynqxfmyyyxqlkhqnmlzqpxzyqhynhziiqiknfmzqnznpimpmmlkyqqhhnyxfhkypyimmjqjqiqhkkpnzifiqpqlqllnxfnlifkypihqqxhzzqhyjqjpqpipillpypjmnzlqmxipxnjpmknqyzqkyjxmfhphzjyifpzfnlqhyhklxqqmlxlfqkqlmxlilljxhxhqxxlimnzfpijqllphnpyplqlmhzilpmynhnmykxfqippljzqqlyphpppnzknnyqqnlxqlpnpiqyjmpqmmynlqzjmpkyxxjlmlyqflpkmfzllppynqiqnzinzilxpppphqplqkzqpfflklxfihihlijmlmqyzqlzhiypnpnqfpiymkfykfpkpmlhnqfkhlpipqjlzjxzxplpizlpmkjmpfpypkpzmhjqqlphkpxykmjilpixlmhjixlhyyqlqzmjppyhniillhzqlpymqqxmzplppqqjhpmnpxmfjxzihlzkqfilfnikkiqhnjqpnplmplfpzlympqlqkiqjnxhhnhxzpzhfllpklqlllimhzpmkqqflyyhqxpynxpphxplzpyqqqjipjxyipixpjfnnpfpkkfphllykhklxqmhpxnmklqpnlqypjlkqziklzpjmhinkqpxfypqqiimnjnfpnxpffnypxpznpplzzfllnhjnmflzzkqhnzpxmjllhymjqnijlizifqjpnpphnxmxxyzxhjyqlmkqylmzilllqmfplpplfxflqpifhhnjkjlimklkikpfqihhjzzmphqlzpjplhmnqnqzylpxxjjmhmzxmkqpqhllmqjnjjmxqfpmfkhqqhmyiqhflqjmhjhipqiiqjnlnyhqmpplyxpkqhfffpklijyjqpxxfnyjmhpfnifypkxhqpjjqmimqnmlmpzniilinqqhnhylljfqnnjknlhyiijxkyhhxfylqppjhpkknnqfpxqyypzkklynjzqnqpklqknylimnlqixxphxkhxklmpxzxnxlzmlkfkxxjmpppyjkqypnfqqzjyqqjliljmxlzjlnzkzypipxjmmjzjfhqjlyqfkqqkhmifzjlyfqxqzlhqpyijxypmpzlxpzypqzmjymqllxnfqhpxzlmixqxzfpmmfkkqpyqhxinylnfxpnpxyqfxlmikhfnhxlqqkqxnmykkqizpqnqjhqxzyhypmhqqzkmmlzpplyjmllnmphfpzqphihklflzkqyilmxnqjpxmfzljifqqqzniqpppqlqkqlpfkhmqfnhkqlxpyzilllhhjlkkxhpqhfnpmplmqlhppqqlfhixyilxiqpyjlnmkfpnxnlqhzxffqhzzzfppiqlklnpyhylylixmlxihmjpmlflzffqnxjyqqyxhjlyhyhkkpzfqpnhmyxxlhpyiqxfljiqpjpjlkpfhppmljilqjphnnylmyylplxizmiymlnjlnqllfflinnipnhhxmpxqpyipqxppnzxnpipqlpmzkmmphkxppplzpqymllhhzpjpmnxhfzizyfynlqimiqlmljqypifpqqlpmnqljjjqnlzqxlhlpqyqjhijqjnkljihykqxpqnlqzixkxmzmilqqplxjpnxlhqjnnflpyfnfyxjjlhlzqxmlpjiqplqfmylpnzkykjilqxmppqhpqkzqqzqyqnixyippnlqlqjkmnnjnxlmjpqqjqzmlnkzipnllillkhlqlkzzqqnliykplllmqjqmlfiqiqzlqipkqhpjpzlkqzxlmnmqhhmqqfzjmpqppmqqnhpmiijqqxjqmnyqlzlflqfqkzlhpilnhmklhzxqxlpnplhxqmpkpqqjjjihnmzlqmmjqqjhqfqqllqjnzzlhlmixqyqpqqppmyfpxlxppqlpijzmmqzkpqjflilxkixphxqfpnlphpppqlhixqjmzlfzmllhypxphqmnllpqiliylfyfkfmlxqqjnflzixqkkqmyxqqxyjzfmkxflxjxkpyhpxhfjpfpnqqjlkqljnphxxziipzkiqlpjmjmyyhpiyfjqmjifyjnlkkmfpljlfknfmzhfhkppqjxkhqnhijnqfxnyxkmmykfhljhqlpizqlphqjxqqlkzlqqhffilnllqmmpkfzhjqmkyjiqxlppnllllqqylkpqxpjlhllnqxxlpklpflnjpfympqmzxklklxxqzhpqpyynfqlpkkiihkpqmzzyqqqqkfqlyyfjkmxxfzffynxlixnllpiiylxpylnippypqkplipzkqlkhmknppliplkklfnljpxllzpjhiypfhnmqifmqkmxxyqzikplfyqhqqpxhqjnlynhzmjxjlqkhlzjhznklyimimzqhqpnqffzxijlqjkpyzpznljjlmqlkinnlqppnnhkzhqpppnmqfykqilyqmzkyzxljpmzyjpmqpmffklppxjxllpyxjfphfxlnpqfhmznmnyplpnpmppqmkqqnlqpkhikqmjlhyljjxpqpqnlpqplqxqqqipkxpzjkjjlzlzqkpjpxxfmfkpplmynnpljyqyyyqfqqpmqzqzfjyhyzmllpylizmxpjhmyjpkjzfhxqjyzmiphkpxkipjjqnjmiyiqlzxqkqfhphxpfkyhlqxkxynilfqfifhpjnklhfnfmpfnhmjihlqlnmpnlmkylixnzplqypilppnkjpylpjhyqzipqlxqyjlqihqqnlpkfplljllyxkzqqhqqxlkljhzlliqppyilxfppmfmyjhhfxjlzijlfnzlqpmplpmnxkfnjqqqqjxfjfnjyflqynmpifinjfjqjlqklplkiyxjiyfhlijflzyjpkmjhnimmhqizylkhnhjjzpknjlphipmfqinqlfljpfyhplqklkfqlmfpllimpypzphppmzpzxlfpqlhzpjhjllkpmpllppxzppqkzkzljypzyqmhflzqlqkimqqnfzfqinqlpfqkxzmqxqxpkqhqymlfpkmykhqimzlmjzqfyhfmhffhqpqpylpjlplyfjimjpnhqnfqnnqppplzymjlfpllpqlilnymnqjpplxmfffzimnkykjjxkphmnmqpfqqjjkzfjlypphylkqhqqqkllxlyxqhiyqlpmlljplnqjpkpihihpmpnjpxfzqkzhllkplhlkxihqljppzllxypkpflhpqmklxfiplpzlfzqyzfizxyiqpnykpkilmjnpmkiqfjzlqhpjqfzliylzjqnplfiqlmjmmqkqhhpzqlppixkljlmlzhiqhqnqlkyqlllqyilqzpijqhkhjniyykqjhmmfmmjypfximilkqqmpzpzqimplxmjyqylfilikpikilpymfpjjfyqzzhpyfjlqhnqqlkilzpxqzyylpfnpqizqppiqnmxnmnfqiqjjqllfyqqqlpjlpfhhpphzqkjhxznlpipyxkkpxqzjhppzlnhqkflfyhhmfmypqmxnkxiyfxlxkmnfjqyjppiliqlljfjxqzkmiqimnknzfpijjnnpyqqmnnkfkpljlqhfhpnklykyknimffqixphliylfqijikfplyjpqpxypkjnlnifxqlqizplqhlypzxkzxnjlnykplppijpqplhyklkkqzqnmhkipimnzkhnpppjniqhqlzyzyjlqxlqnlzqijhlliylpljnxmhqlpnpyhphqiiqlxxjkxpmpyxxypnjzlzlklnkllpjfjplhzyphimixfzfyxmpplqqzjyfffqxljlpqxhjmzlpiqnyzphnphqnpipyqlqppihkmfylpymyzmjzxfpqppxzyzllqkllmzznlnxklpyqiqlpllmqpfhklpqifyqfhyinpqzmlnkkzllqqjfipypnplhzfpjqnmimqpnilmhfiqjmlmpmpkyjlmjjqjiiqnzqmnjllziyxmkxmmplzmiypfylpplzzmmpfklllxllpqpxnjmqxhlllixjpqfnjzflkifqppyilfypqppqkniiyqlympqqfxlqmyxkmqyzzyiqzlkknzpimhxkjxyqmqnjqfhqhflllifllyxpfpilxyylqppjnqffnqplkyilqnnyplqzpzpynyxnpyklyqjlxmylifmjknqynzqzxipjqhmxzhkzjyqlyqinqqhymynqpmxylhxnpqlfkflxlqkqllfmzpynyqfzlnhiphzkhilmqqymnlfzfqkkjxmfpinjpplpxniylflhmqlfyqlkipilqzliflpkiplxizlnpmpmnpqmqxllnqkxpmmlqjqmxynmzppqhlkfpqxjhypklfqpknppizmqlkfpnzmfqpnznqnxpphyjykjppmkixzmnyjjynqqyzykppzmqkhjknqqxypkqqqhxyqfnmqhnimjnkjqkpqlnkinfzkkqhqzphklzmjqpjfhpmzlzpfllnphhixpqzzpqqqfqkqfllpqihnylyxxqpyppxqlpkhjlnljjpxizpizhixpinjpqljmjjqqplqikqlqyfnkqllxpxqqlzpmpnjhpixfmqpqxpqpqqxphlqzimlykzzxmfyzixhnjqilmqmyjmlmpqppjxyxjnqmkxppxyfzqpfzyimfmljhqxqhzqlhhyypqyixphllpinlpqnklfqzjymllnkpxpfxlzqnqinqzlqqyhliipqqzppiqikihpylxjknlkqlnqnipzzqnnpzpkkjnpppxkqllmljhxjxqmljyzzijxphipjpklymkmzxyyhpzqlqhlipmnfkxhjhnppkxkqyjzppjhnxpzhpilyxxzplhqnykzpnxlfinjjhqqhkppqymhykkynzmxynhijnmylzfpjjxjqkfpjlnqkmlmqmzzyphjnhmiikpffhqlkyqlfnmqjpqilpzjilhjmfxqjnmlqyjfqnfmipiqlhpkqlhlffhihyxyfxjxhlpkiqqmpyhhlnxjnlhnnnhxppkllpilkflxmlfxpyqlllifppjqilhzmpnkpxplpfznzqplkqnlnxlxqpqpkmkhllqlqkjypqflqhlqjhzhzfxmyqqnqznqmllpmkqlqzlqqqyqplpqjzihyzykkpinpmyipzmjlnhqzlhyyilqyxmfjkhnqlplhmxililkifpphqjqqljihmlkklnyiqyfmlipkpyqfiqnpniqqmmmyfyklkfqppxxnjpjypnkqjijyyllknpfxhnflpmipllmjihhyfmjlljnikxxnqqfzlmhnjlljllhpfixikqlqhxllknmxqipnlqmqllljphqpipiqlxymhhqixlmnnqnjkxxxlxjpxikjxnkkppfpmmqppxlhplxflpqjxfllxykkflhnynfkfzlqxipijnkqhixmqxlnpjqppknhqhzjzzkpnmpjnnfzjhhxpfnnqlmpppylxlfpkmxpnqzqjqjmjpnyzjlmpklqfnfhiqqpjhkjxzqqmqximlpjplqjzpyljmpnqlqjmjfxqixznqlqlqpmilhpzljliqhkqxxniljqzhkmqppkllplzhmhlpyffklfxzpmyijfhliqqmqlpxhjxlmpjipnqzfifylhzpqhmlhqihfmqxpfxinjqxhljqlypphyymmhqzyhmlzhjzpqzkxmipfqllkyppfmikplhpxxlfqpqzphizmnnqnpmjznfpilmqpyniipizixpznhppjkzlnpmmhlxpqmxljqlkjyqjpplzkqzfpfnhlkpplpqphykxylxmxfhqxkqzjlpqiqqynhlpzmqpphzqpllpiyqzphmxfjinixflkqpqyfiypmqzzqxfzqyiyqjjjlzkyxlqqfmfzpjzmnpllljfyyzyknllhhjjqqpqmjyqqlpjilmyhlhqpfpnlpkqkjjjnlxiljfikfzlnymljfplnznyfppllzxkfnjlpphqjlmfqpfyiznlmylilknmijqnxihnzznfiqppplxqhpflzjzzkjqkimmlyhlqqpilmlnhqnnxmkfqxkpqypqipljqylkiqynyplpiimqlkkiqplqjpmkynjhqxmlfffmzmfmpqhklqlhfqfxzjfpjkfyylklpxylhnzyxhpyhlpilfkqfpphflilhqhkppqinxpqfzpjlnjfmyjflqljmppfklllzpzqfhnxmzflillfhfylhpfjiqpffjkhkxpkplniinplnjznnqzxmxlpzinqpyqjqljpjypizzqxxxhpqpfiplplqyqxjyqxpqxxfpylqzpqzjyhyxylqpqfhnzifjmphqfjzpqzhhlppfzjjziqqmpqqjxlzlzjlxqxlxflpqhzpnpxfmpqqqlnjllqlqqqpphpppjqlnzpplhlmnfmnjxzppylylqqklhkjpnqmliipqyxnpynnlhnqlqmlxxnfmplpmxlqlnylhjlyypilliijlykypkzxqpnjqlyllyxlmxklzxnqnilmqfnlpynqnqjyjxxhkpzyhihpimmijhxpxykzzzihnflqlnkynqpzilqnxlqqixffzqpfqplflnhxljhlpqnhxpmzjlplmlynmzjjnpxjifklnfyqihfkhpmfiplmlpzjnpimlpfynlhljqkqijpqllykxyixlqlhmlqfpzyiffphiyinpzffyiqyyixlhplxzjknipzkhijpppqlnxnyqzzfhqqqpllmxlyknhppppiqfnjkkppjpxkkijfzffzzqpxzqzqfzlfilnpjljzixpkzknqkyqyhqkjyxqpqjhnlmpjnpzzylmxpxmjqkpfxqnxlplzjyxzjqzllqlpkqpqqqkpmmfjkyzyfyyzxpilhqfkiiknqpzzqzzmimmqjqhnikplzmqqmqlmfpflhjphnpkzpnpqillfipnjyqxqzhlnpkqyqxmhlphpnylifipqqlifpkhjzpqfmxmlhxypklniplkxyzqlqmhqpklpmplljjziqljkjmjynypihppmiijipfpmhhfiiqizkmxikmpzmnyplllnqjpjphqzjqlhljijpyifjxqzqhnlqhmilkhqymlplqpizjxjihqlnlxpkmqqmfyipqpyyjqiiqffnnkxxqmmqqhkynhmlikhxxxpzflyqhmflzpqpjmlqqfqqyklpqhfjzpfjlqxplpnxpmhqjfflzfqllmqhhqyixkklnpxhllpqlpjjfqizqkqxyjnfyfmpfmqfqlylmnhhhmhhhjkkqlhpkmhxpxyhklfpkhnliyjfllypzqpqlzilpkiqhxqijnqhzxlzlzzxphlphxhpjjpqpmlhqfplqpknxiplnifpyylqqnhhmmpihlllipmkhpppqifylfxknklqjxzqmjilqkqlfnmfmkmxjznjqkjpxhfqjlqylzhllqhzmqlhhlmqjhpplikfxqjiqxxkmjlniqiqfjjfipymifzjfhmjiqpimiklphinphfnqiqhxmnizlzphlizxzpqylkxzqllqxfhykffhfpyynplyhppzxyfmlzpqlhqlfnpniiklppqpqnymimihffqllikjpiqffpljlxpyqpmkjfqlkynqphpzxylkppphjhqjpfiplqqmqpjzfikknimzhmlikppynxlqqphpqhjyklpyizhliqhjqpzhnqhmzzjjzlyxpnpxqnfxzhmfxillpipzyhljjfjjpfqpfliqlynqykpxnhfinmnxmqfyzzxilxlpmjjllxhknzpmhfyfqkhifqypkxxylijmppmqqxzlliphnyjzhjpjlfjzzhxpmfmqjjppmzpqmypfxpqqkzljikqljpjlzipjhqflmqfkmmmkiqzimfqifpzhxnjhqxylqiilimfhfphknjnpjzlzlznxifllpfpfqkliqxikpqkqpqyxmxjyfxyillqqlplkkpkzzmipqhnmffnmkmxmiynmpqlpqplxjmxpxpqqfnqpxfyzhlxnpiyppkpknlpnphhlljqillpzxjnkqkxmlpnmlphzqjppmzxhyqqlqjzlfpypnqxzhxzinpnzlqpffqhfifqjqplzpmilyqxjzhqjzppnqpmfyxjipqlxljfmkxxmpnjpipjhzqxyipxpfkkpqxmjflmhnpynkmlqilyqqklpyqjipklhpixlzknlziqxlnqfzffzpqpppmilfxiyiflnmmpikyjhpqfzhllyifknjkpizqlyyqqlnijipzmqmqpffqhzpfphjkmmpzzhflyqnplphzlzfkhqljplikjzlhnfkhkpxmkhppkiypqyplnpiqpmllllplffhmqizkimzppikkizlmqjfpqzqmkynxmmfppfqnpmqnjfhqlqfxzzlyqkyzylnnliihhhnkkifpphnqjhlzjmffllppqpxjplxnqlpplxjmiplqkxqffnnhnqklhjkmlixqypmlkmimxyphhnqzhmlinfxppppqlpqjnziiljxppjpijpljiyqqlmfyqphylqlplifqkplkqyjpjlfkzzpilqflkxyzpqnjjljnlixqllkqkpzmqiyhiqxqzfhyqlqlplqynqifhplinkmihjkfqpkmlqmihkknnphjmzlqzlpmqyipqjkylkpjqinplxqmmqllqffklmijlpipjipppmylqyjxnkkiflxjniffqhfnyxmypxlqxhqhniqhhqiljqqzxlzpfljjxqziqzjjlnlljqqyyjnpyxkiyxmyipqmnnfzjhlfqzihklzqqxlpqyflfynqqlknqilhmimlyppljxhlllqnnmqplzijiyqqmylhpkxfkxilkmfpjpzphkmqkjmqqllqnqizqjylqipmjmfphqzpmpyhhpxpqzfnlnjinqxymkqfnlkqmliplynizpfflmimhfqyjzphnkxpqmlzzzqqfznqzpplykplfzjmhpxxpqzzqpzkyqmhfiyqmlqlmlpimyqmzmymnxnypzjjpihiqjmnmxpzxqklqylqmljqpmlqzqmmmpffqjfpzxqxnpjhhjlhzmhznjpykjjqzjpqqqlxzllpfhpqfllnmmqxmqpxqkzzxmqhqxnhhpqqypyykqxqzjqxqnqhyqlxkzfqqzfzkpypkpqypphjhlpykkqphhhxnkllfklflplzfmipijqpxqynyqjnqzqpqpqplqfmflhzziknkzqjnqifqxllyxqkllqipnnkyzmlnknlzzhqqziplmzpnqpqzplxhllkxzqjpjxypljnqqxfxxkpllyqjnfnkffmnjiqjfnpqpphpqkkpizijlnqizziijmqqlzqpjhilpmqxlpplhjypqnhympqymyymqznnknzkplmijmyihxhnxziklnxxhnpnlqzpnjlhlymlmpyinihmzhqqynfqfnplxliqpqlzzfyxmmqlylzqhlqhppypkyqkpnqxqijyzpiillklflijipniyyykkpplqifpqyypjlzmmhqkpfyyhqpmjqlqqqhhyklimpnplxhlpzqnhxhqxljipfjxmfhllqpkqlqzqmhyznqllhmnlqkhyjffpkpkhkjmilizlnynqkkqfqphypxphnyhylqpjillfmjhxkipjqqippkplqlkfzppjxpiqnkqhzlkplpqkfypnnillmkzqjqjzjphklplpqhlpppxixypxqqfxpiqfzzpphyyhqnjypkfzjlphxphkhlqlkilmnjqhlqinzfxxqhyqjnnzlkjqkmlljkxqxkjfjmjpzfxqqlxkyphxpffxmllzplpqqhmnqkxqinxqnjnlmhpinpyzjqlqpxfplppinkpqqpxfqippqxfjqljjhiljjkikphqlphlpmkxxqqmnyyljjnifnklknxnmlnknllqqhljlpknkiqjiiyznkpqqppjhklxnkxillljlqypilyxzkxnlfhfkmkjnkxmqjkqqymlzxxkzqzzyijppihlxpihzlfymyxlmqqfqmlllypymlxkkzzpjpihpyyplypnpllllqjkppfynqqphyqhpfnxxqzppqnilqpmiqylhhhpmihnnnxnqpmjqfplxqqqzpqkymnnfzlpzyjypqkqqqlknjqyqnpfiqjiizfmqllyjpkiqmkyyminnimpqiqpnpqyqqpqllkyplyxihxjlplfqxjzljkyilpjlpqkhypzqlqyllqfjkhljqjhxifhzxffjlhzypkxfplqjyzmnxqzhjmjpnykfmlmmiippillzypjxfhiyqyjjiqnpqlqqipnmkqqjilqfilmjlmyqiyiplpfxqippijyliqjphhlqqlpfqqlfzppnlzylyxxlmjlmjnmqjfmpjpqkyhpphnhnlyhqplqjzhpmipppmpnjimijfnilflipxfqqjqylflixnxpjkzqzhzlimlzklzpjhzyxkljllhxfpkppmyzmnllmpxfnnpkhqjhplzpnllllfxfyjqlnjkkljlklqqljqnfllixjilnnxlfhmylmiqkpkxznjjkqkhzmnfqijhxpzhqfnxkynpjkqjfnqqlklpiqqqjmqflnqnqqkhpzpqlyqknfkfnkmhmnxqpljmijinlffpjifknlkpxhqqpihkqnjmlpizllhhpminljxlizjnmmlxizpjzlmnzklyhyhfzqzlnjzzfipfpzfihpxyqijifylfzfpyxfzpziqmpkmlflilyzplknznjlfzpfmmnyipfxipznfiqzmpqnhppfjhmzzjpyfyinfnkzhljqyhqmpqjmmpfhhflnmkllpfphhyzhklijfiiknhxpjflpqyihimpjqmhkkmfiypyhpllllnphhjxzlpnkiqlnpklqmhikmlhlfliiyilqqfyjlqjihmpyfkljxyjjfqipynqiziqlipqypjxxxhlimhxhpihqpzpilmqpfhiimpipkfmmlzyqyfflhpyzqknihklipfllzqnmklpxppmlkzzypmlppjlymlynnyllfzkqplyqfxxjhhqqxppmlhkqqjmqqpnlflkkpqynpnnhqzzqmiflhplkipjmjqnqjihklzpnqifkflqznmqmyxnqzjilijqmnnhffkmqljyfxkxqkkfmnjpyzqlpnfqpzzhhklxjfyhkxilillpjkjiqiizxqlqljnkmqhjmyjqklilfqxllpzhqfknqqlpzzqnjxpnxlnpqynmzxlyqliyykplqylmqkfifljiqhnhmimlpxxmqjpilnhxlpyhizlqlkllkhxflplnpplxzlyjkhkixjklqlmpnqlmkqqzylihxpknqplzllxmpkjlxjlzqlxjiiyixqqzfimfqznpphyqplhzlqljklqfzzmmpnhpiqiylpyfnnjzxlplpqnqzpmzpxpqlpqffkphjyzinhiifnxphpmpxhzlzqixpqzqxqpqmfznqqihqljxfpihqhppnlpqlyznpkpymyplxnllqzjiqllijqqxmnmnhpynpinklqnjppzlzjzzfilyjlzqpqzmhjilzkyfmyfkzpjxqpiimzqlijjxhkpfqkmlqfmxplpknkipfxpzpxhpzljqqqllhfxnnimqzxflmjnipyyifpinymzjqkqxmlhiqyphqznlplxklxlxyplypjqyiqpyxkyfyynfjqpihpqhkmipnqflkymqpnfpflllikqjkizqqlypklylkynmmxxxqljqlzlyijlpimzlliplfjxxnqpqypmllqlinxpzppfihmymijlfnfxlpphjxxqqfxznqllkjpnhzinjllnfkqyqlpjmqzxkmzznkzlimqllxflqlxlqqmnkkxzqlllmpilkzpypxqmqijypjnpqmmlhqzflqklypqjkxzhhijzjjlpxqxyqlqyzznzhpfjqxhfnqlxqhlpxjhqipqqfpflppljzlfyqphpnjxppmxlyijzyqjxfxjilylkplhkqqlpijzijknppzzlkfqilplyfxpmpixlnpylqilplpxyqyllpzfimfmxqllifzqknjfypznzjqqlqmhjkqmlhljxqpnlippzlmlxzylylijqinqppnmznjzzfpzpqllqlzqhxmlijpqmimlkkqqqimjqflxpihipikpmqnkmplqjizllyziqymmmpxynqfhpipfqlmljllmjijqnilxqxllxyxmyqinlffpmmzynmqmhqphxxpxqqpxmmlphfpxlpllhnjzxlpqlpqhfpmpzplqpkmzhphnpzkjxppflnqihyfqpqqmlkzijlypymyhmjyhpxqyhhfzjzzlmjlqiqlpqfmhnxyiyipqjffqnyzxjjflpmqynxxpfyqzpnhlfpxiqhypkqipmqqqqlpqzfhnljjlpfppkhqhqqqfmqnpqlphyqipihnlzixjlyiqinixqxqyqliilmjjhiqppqpznyqpihfxqlqlxlqppkzpynzzxlpzljpxfnmlpqhmikzlqkxxphfippmjpjkyqpylqpykhylfhffqpyympxqllxnmnkmnhikylkmkjkpffhiqpfpllxpqpqmlpkhjqxyipplpzlzkpfllqkkllhqyzmyxyjilfpyphkxyfxijphjqzzppmhjpmnzqpjxlqqhqkpzqzqlyqlxlllpymxlklyiinnhjklqyhnjlxklxxkxqniynljlxkqjppijnphiqlzllhlplqpqqklnijnnffmjpxfpzmzqzxqqqllqzfqhpzhxxqqlflqinhlixhpppnjllkzlpqkzlnxxkflqxqjxlyzqpypfjlzxlfqqxjzkxqmnmimhhkmzzqjypilijhlpqfkxpppfhfyzhjjpppqhzpiqqzqplpqqyimyjmqqqlppyfqmymlifmpnyhfkpxnylhlmxzlqqmyphpynimhkpphfqhqzkxhlhiqkflhlhlpnmpjzlpyjifizmylzkxzhhllpinmnjqzmklqpnnlqpxppynpnypyjffxympyjpnhzxjzxqqqzqnkyjqpzmkpiqnzzmyynmhjjiqiqnpqppllxxlzylqphxpziqyppfqnpilynllnmikklifkhpiphjkyjfqpfypqfyqinqillyyliqkliqjykylyjjhyffpplplzpzpnmljklmfqkppppmjyqllyppqmxqpijyklmxqpxmppjfkmqqpyxmimifkllqhxkkjnjxliyfyjfmnxipjyzjjhjzqqlhhpljzqlqxhypqixynjliqzkzpjnppmzjmqylfqqiqpxljpmkmnllixqjnqpkllqyfxilzlqhmifqijkhqqjqkjnmipqhipjzzpijjyzhzjixqpfiyplyyqllizqfmknlhfynhhqppzfnqknqphppkffjkklqkfqzxnlzpjqpilzxjfnzpqqhnpjflikxlxkplkkxnqlqzfqlfjfxllfzjkmixpxxjpjznxlylpjlxiqjyphflxyqyihmhkkppklpqzymlxmnxnyqynmppqnqlyfmzffpjpyjqpipqimfyjlqlmxnpzkzqjkilhjilqfxipixkplqijhplfqiflnmqfkqhfxqnxlqhppyplmllkjpljjjxypqqmqxnhlnhyzifplkpppqykqjyzhiiqqpzimjnfpfpqfmpphxpkzmljkkppnkqznnlzpphhpnmnqmlpjqqlqpilkyqipinffqqqyzlllqhhqqizqlkljkyinyzkpjxjxkihjpxnxizpxfxxkyiykjxqyijhpqqpznjpzzkmppqlyjlkkpfiipxlffkmhilqxkplplxpqpxfplqiinqhhpzmpkhpyzlkqqzmhzliyxnfhhllziklzlijmiplppqmhkhqfykjlxnqljzmlmfqxipqfhhlmlzpzqplnxizhqxqizijyxpjihxpqlklilnikiihihilxfpqqllfklyzjkmxlkjlkpqllmmylqnfnhzqhhpzpmppjypihizljznjqyhlnqmimkhfpqqllljqihxyynqpfqxhflxinplnpphfplhpmzqizpqkmlymjpqhplylqzilmzplmlixilpnyhqpjqyhhllziylkmiqlifkmqqqqjmfkmzlhyxlknipzqmqjlihnjpihnhixkplknkzppzlilkfmqqpkpxqnkfqnqhkpfjpkmhnkyippiijhhpfjxkzlqylqpqfjjhxkzqqyjfxzilqjpnjkqmzqxfmyqfyyxixkjqinmhzlpqljpfljqhyqymljijmqjimnpzjxzkpfniqihnznlyipzpqfplpxlmfnqzlpkplmkylqpqzqxhpmqjimkmlpnzmifqmqlzlnqlppfnlqpmxhhhhnzxlflfxpzihxflyypjhhpljppkmlxqqpxymnpfxyfhmmlmpjfjklkifzxxplnqmjnxphkjpxqkflhlllqlmfmypklilzphmlzpfzhillpyzqpzykypfzmyqqfifllxynzjxpkxfljhknllxynkzlkklypylppliyhznfplpmzpjlzhhljnkppjykxpfxkpyqqlqflxqnmhmjimpmlzjjflxfpljqyqhhnkninnjpnyikkliqpkmqpphzlqpzpphpqlzifxqjmhyhnnplqpixhlpnmmmizlyqlflqjqyfymzxpymhlhpqpiipqxzxifnhlhfqzlphznyjlyzpqyyjlxplnplqnlpykxfqxpfqijiknnqfxhppmjmyiykjnpllnplpqlhxjpmnqlxnzmnlqzzipfqypqlipyyphhqljqjqzmnjmnpxlkqmiypqlpnlqlkmxhfnixklphihnjzlizxfnqqjkllkqqjjnfizxkzyyljzhqmqpjijfynpqjmxpkkqpphfzlfxxzypzipkqxizhlpfzhzhiiypflqnhpmnlllyjzlmlilppxxipqyxkjjzlqpxiihpqmippmlpflzizzhkpqlhliqkhxppkfmmpliyqqpqhllkllyxzkpxpkqqpkqqjllnlzjpqflqyfqmznqzfjyhqqlmfzkqqqjlzppzykllmxipppppipljiqyiyjqkzkikxkzhqlykjhjlmphpfmqnpykpnzljpqfflhhjlzhkypyfqnmpxlmfnplnhkfhmlnhmfmnqjxjypxfkqlpyyjpxjkphxnzllzfyqqfzpmjznkqkxjpyfjmjkzniqlmmqlkmxmypjinqqhqfjipxpmjqlqmxlhzmmfllxkhlzynkhpfkpfzllfijplqmyxhjpqnxqjlhjzqjnhfhxnxizmpjnlkxlzxlnjmxlzplhzfihnljyzkfpjxiqfyqkqkqlpplnfhiqpyhllpfxqnxkxizxjqknzlqyhnpqyqplhxmhxmlpffpkpmplqjnpxqzzxxpkzyhpqkhilhnjfppfllpmlxqzmlqqmypqpnyyiqqnxnqzlxzqfyhjppxflzqqqljkfpynlplljqkqyqqxpnpzqfmlkklnxqyimlhnmknqhyxnkynjqpplmixlfqjijnynjzqznffxljjlljqpjqykknqqfymjjkxfliimimxzkqqlkqypqxnqnlklikmizjfihhflilziqpjkyziiypxqhjkfhflkqxnzllmpkpxfqnjljiiplnjplkiqqzmqphqyhqlillqhnpiyqzqnqmiyjkxpliplzhynjxqlxpkkmjzzqixfhlxnnjpflmzppjilxyyqhqxpklyfjxmnlqznllzmiqqqqjippqnlzmnxqkmyypzpqlhyhinmhzjxznqmlijqlfmllpniklninxqmpqmqnqkhjixqfklmhklmhlmplzmpmznfzlmiqkifllpqqhqpnmplfmyqkfppiyllxmkzlphfxpzlimlknqkzpqxyylhjlpfnzxpzhqzhpxkqxmjjhnypzlqqlhqjlpjfqlqqqjxjmlpjipiqfjlkpmlzfplqiqmlhpqllyiyjplippzqzzzhlpqplpnlhqkflzmnpqjzhzmjfmpjhpiqyfylqqfknpfinnfiqijlyniflmlkzlkiznqjxqjnqpklxpqkxkizlpxlphhplqnzmjllilxpqykflhlqihzqfkkpjhlmhiqzlhipfklxhzqmhqkkqmyzfqqljnqqnqjikzzkqkllfxhzkhzqfmmlqhxhhiypiqkffppnjjimplpnhqmnjpnxxqzhppkfkilhfylzljqfyfznphlllpmzikxfkzzppiykiphhhnpzpplyjpzpzpzlfpqqqjzqjfqmhyllhinllhzmqnyxzmjnqnkjqqnmnlqxqmqmmfhhpnmffzzxpmpllzjlkpzljyzppzppflkmypkfnqqqqhqlppizlkphmxqhphhmzyplpxlnzjhfpkfnhlmhhqmxiknmqlylkxlkqfiqlzjhznzlkxppjznipiqjhiyhxnnphmqjflikzqfzhpmzxqhiylzhilhzmqfplipqqfmplyqxlfnplmxzqhpifzpnimxklzqkjnpzjxplxizmjilmkqpnqkqkpkzjkqiqpkmlqljynnmyqzyfllzpkqlpyfxpphflmxipqlzqljjjifllyjqylyhlphqmnqhlxzxfihmyhxpxnkpnpfnlmkljnqhfqjpqmmhyxinfqhqiyyjqqxqlzfpjpmxpqmzmqmlliymzzhqlkqmjxfyzpxzpxqkqkqjmzzzhplyyxxzpnkpllxqmlqizhmllllyijzppllzjzxfplzxhqfippmlqyffqhhlqjhylqnihqkqlzlfqljpyyfqplhfpjypzzhjkmyjqhnliqqqjzplipxyqllmfxllxijmplljqlqjxplqfiqhlqpqqpiqmlqhlpqypqmimnfzjykyifkjimnlilhqpxqhyzqhknqxzxyxylxqpqpqylmqpqypjlnlqpyfjmlzqlxlmjhqplqkqllxqzqkknjmpihlpimhqhnmplzlnmnhmklyyklmpkklqziqmlpijkqzzymjlnjnypxmpjjmppjzpxlpflqkikmhpyzmyizyjkynjhmkkhklqxhiyinjhpnfhfhmznpfjqpmhqpylklzyzqlqhxqnlljzxxlqmppplqyfzylmximlipqlimzxqhlllkmqqphlhizfjpzhyfkjplhffypnlffjilpnppfklnikxlnllppxzppyqlmhihkpnqxillfnmkjjylhzqmqfmlplkplixfxfzlqjqllmxkjynphlqxpqqpkhllmlqhkhnzjixpkxzkqzfynmqnhhxqymmpmpllfkqnkkqyzlfkjlppzlzlphlmllzljpfnllffqqfmmmxnxyqmlxlzpplfynyyljlmlylzkqfhlfjnkqhjzmqnmpjnnylmqkyqfqmkxyljyykiqyqlnniliqymmyyxqlknhfjljpyqplmqnlpqmkjxkfkphizkzljxzllxqjhpymqylzpymlpqlnlinqmqqnhyhikqlhxzlpmxfyihkpzhlfnjzhfpqqpfqjmhlfmnhjhljjmipjhfllxxlkkmlxjqxfifqlqqxkzfhhllfjmxkffmymqjjllnxlfxxkzmnqqpkfihpyqqnippnjqqmmlklplpzljnpqxkfflfhmmkppmpmpnpmjxxpfinhzxplhnqkhmmlqkpqllpmkmllxpxpmhmixynpxnzkxnqlpxqpklfkmipmlmhlmifkpnlkljqqpqmpiyjmxylylfhpkxhxlflxxlnzpypmyqqnlqzqqmpfkffzfhxpnqxlyyppqjnpqnmjippiqzppqnxqqpjpzkyyxfixqnyzqmfkpyifjlphimpjmjnyzlqlmnhplkqlnlkfqlnhknmpmkkkylilqmipjppifzhzqipjmlhppqjlzlpinqfhlznjxznqlippllqxypmyhplmqjqhnjpjnykpfzxzqplhqhnljxmxpqqifmjzzyxiqqhlipyfqpmfiixpjxppmkyjxlyxhklhkyhzmkfilfpnypyqpppfflhnkfqillqhqxhqmfqlfkqilyfflqplmzilzqnjpkzknmhjipkjxlkpxqqyklpxpmplxihjiznpqlkkffhzmpxixkninzmlhpkjyzmilqpqikkqjnzxiypnffknmyhlmlfqhnpzqlhipfnklpzqiqpqqpjqxqkznlhmyilyllqlpfixmzphhxlmhljzpznfjpqpxqfmqfhljipljxpzxiqlknklmjilplmlzxfnpjqjjkypyyzhlifppykplnpipqfxnffmlqhlpqxqxizfplqxmjjmzhzyjyhpjyfzklpllplqmphlqxfpfjlfppjikklqlzfjxpnikplyjzklpqqflxiqhhfqpjnpfllpqqzqnqmqxpllqpllipqfmkmlmmmjxlpqqmqpmhnlqqqklpyxlhpmljnjqqpmhlmfxklkxipinxpxqqmpflhqnzpmpzizpyhzknxhpfjyplznyzjppnlfpqjhqjjkyynflkpkhqfqpqklflnxpxfyppfqlxzpnfiqppfqphhfnjiqhiflhfynkphhiypffxppqjijxfpplypqmnzfhpjklfpmpnllklxjlinkppjlznkllxkpimqnpjjxflqkiilzqqjqkypkzqfknqfxqpzpmlpfmpiyknlmlkxzhpnnfihxyyzpzqilfyilyflpqzhniphyqjxlyjqkzpnlxzznyyxinklxknqmlxmyiqliilmfiflmfkiqqfppnqnpqqzyfjxjzpinpmqlfkjqpjzzlxqnpyiiifqzmxxpzljfqhhjkfpnnmiyqqljpyqqplmiypkyilmhpmlqnlkiqixyyqhllqfzypijnkkmqppmqfkhhpppjypjfiyyqhpljjxjnqqqhjfxzxmyliliizlpmxlfhqyqjlliyifjkjiqpkqmhzznkzxppqqfjqhpyknxplylmhlxjjnlnkpfiqlmlpqyyqnlppzzlpzlxlkmjhxzkknhlhqqkliqxhfxinlhqknkphjkfqyyfxhpplnjpfqlpqpjqfiihnqjhjklqzfxippzqnhjphiixpjfkfjkjnmnpjjikxqfyxflzjzfnqqyypqklnmjzmkpjmkikznnynlzmlyhlfqijqyxhmyqxqlfmqlpyqkqkkjpqhlzmifqhhlnnnlzpphfnliimhjyjzxmqnlkhkplqqpphqqpjpfpnyfnflxipqzqmkqfppmlqqjfqlqmzqmilppfpnhnpyzkxmqlzmxhpfpfkhilljflplmmqjhiqmykpqlllmnkyklmqflmkfhijyjlpljzqpyfyplfmyffnpyqipimfpfpjziyfhjllizkqpykpnykizqqmyqjqlkfymlxpknpqmzhppzxxpkkzzxqzpilmqpfplxppkqhjhxjilhkmmfqhylhllfqzzqpinifhmlfixjfplnfnpzmliqpqppqinknpfplhqmqjzllqpqjnqnlmpkpzymzqlzjnllxipjlfqqnypljphlypzmhhpxqjkpnfqppqlqhqylqpfxqpnjjpmpppqnqnyflnnkpzqpyyzmkxxlhlqpylpqqyhflmlllqylxzjxplpkxmipyllklmjlpilzjhqklihlfffixkqqjqfxmzmpmyqjhlqkmyqhflhyqppyqkmzqliilmlqlkfklikfmhlxhqyiqnlkiljjjmxzzpfxhhlhlpmzlpyzzxihziqpqpjljzqnzyipkixxmqnnmkkmmzyppxzkzlhhiqlyxqniqqixqpqppzjmlimqfnnplllqzqliflyhhzfhlpqlznkxzqpjphqnqzhxyjqziqhpmzqkijkyqnyxzmqzqinypkjfmixqqyklxqllpxpnjplkxhhykjziqyxknhijypxqfqmqfqhmklfnflnpnqlxjxppmnfyimpllkkqqfjfijffnylilifylyllyxifnzjjnnnylhxjhjllqqjinyfflkfmxijjqlixqzkmkhpyzlzzyfpnkpljnzppqkfmxlixkkmnxljqxynjnljnqlzhllqqlqplpyjxxmlfhyqniiqqnqqnmlkpijjkqqmqypyxjkqpqqihjqnyilnnlplpmqqzyzliknjxqxfjxlnpjlxkzlhnpykqlfplqylllinxlnnfzlyliqfqlfqixizqphlqllpjfhkjjkzxjqkqznphpzmqpqqlkhqqinphpjyliqlqllnlyqpimphpflfnyfmnzmyhkpnqxfqzilllmllmfkyypilnlpllpmqxzhqlyzlqqfzjnpliqkqxjkqlyjlklqmxmplmmzxzyyqjmqphflzlmixqnqkjhlnkjxqknfqfippjzzpqmpkfhjiihxmkllnnyphimqpjnkyljmykplkplqfqhknlqfkqpkqyzkypikflplfylqzkmiilizfipnpfyhfxjnlqzljqqlhqzxiqpyjmzjffhfjpjqqqpzkklpfffmnjikyzzllxpxnpylizpnnmqhqppjylzziznymllxmlxnmpylqkyyynfpyqmlpmfqnlixppxxhpijkxhqkihyhyzhpifzqkqpmfyyinhfpzkflnpmpplnhlfyijlhzipllnfhmynpqnkqlfqpzkqlzpqhmxfyjpjqqkizklpkzpizmzlnxffmqipmlmmznxzkfxlljmpnhhzmqkhlzmmhxxxnnpqpkqminxjjxqyzxipilflyqlqlklyjjyfhypnjymxqfjkhpmzipzpyhpfyknmqpyyykkmqjmxfzmzpninhiizqllpfzzkqkpijipyilzqmxqyhqmhjxmiqnpnpilpxipkxqjzyjxhmhlhypihpiqlkxqhfyiphiznijlilzhxflhphqhkmqzqnlhhymjylkxpllkjxnkkqkzipkpylfiyxmlilphnllkqpxyjxflljflfklnfylhqnhnxhizxnxnnpjlifqfflfqmxyxpfpllhhmmmmpxqkqflhhxqqpfziqfqpphmxlqnlpjlhpnjxlxilpzkmzmkhiiipqllxxxjjipnxlzllzzzklhnnkiyilpzjjlxmpyiijiyzqyhklzxqhiyiiqxfnkmfhpmfimiqxiyqfmqnqlpqykhipqzflzqlmnimnnynmynypnjizmmkljlhkhknizffpxnjhmpyplqzlhfknyppiqmffpxpfnkjpkpxmyjjpkhpyzilphyklzpympqhqzlpffyppzjqqqkfmjpxkfplkpmmqhljpyzmfjlqliplfyphxylkplmjjmppmpyxzhxzqxqlfjyxfqxlnfkjklymhlhlqfllkippqjxyfjiqqqplfljppljqxmzlmpkjqkxnflkpfqqppyhkyxpnnnxlhmimfhnlplzpliylfjlzlqplhppqyjipxjnpkppnmfjzyqxylxippnjhlllqinqqklyfppzhljhyzyyzlkkixqhlpziijpmjlqpxihfpphqqknhmpqiyjyijhqhhyfmqiqlikqlmhklhnkyphnlziinmqjkqfffpfzlqzqqhqfplfijnklqzpipqznzqlpqlyqmnpqqxznpnpyzlifipmpylipkfkijqhqxxqmlpinnjjfnppjyknllymnmnmjqmllpqllljmfnpqqlpzhpffhlpqjnyyixjqjzlkfqiqkykyplijkjpmjzlxqxxppnlmmlfhpyixmmilllyffjfqqhpqyijffxhlmzqznljpxfnpjjhmklkpkpzkfnxfqlpplpzzjhynqlhjlnhnkpplkzmmlypqlxkhmznmkhjmjilplyzyqnypiqlfzlhqniqfppqmffnlhlzjizqjmiylzpklfjlfxllzzjnzjqkqnqhpqqzlpxpmlqqxqjklklkiqxzxjxzjmlzlplhnzkkqpzfyppzpfllhjfqklxizpqfzkimylmfhhpipxzfylxmfkilnpppyypmfmppqzkpplhkqyiphjhxjimlqppppkpkjhikhpzfifzqippmkqqzyhhqllifqykkmiliphknkpqpnhlpqmplqzqxzxpkqpxmlxqflfhpznlpklqflynxkxlijpifimqfihyqhnizpxyqkqnzzpllmilfiqlpiiqynjyhyilxfhpkkpqkljhnljqiypipikxmxpkqfppylqiqkhljpykkfjhjkjpiqlkyzixfiipikzilnypmxpmplillqmqxqfpfpqfqjnjpkyhfipqqizjhjzxmmzmnpjmhpzfnhqkzxxjkqmzzzqmkxylmikyiyhqnyfjyxmlmxqmlpqpxnkkjzmkpmpllxnpnpikkmlpphkhmznlzzjhyznfqillzjlqhpfykzpijhjpxxqlpiqqlzmqympylqillpxzxmxfqxixylppkzknqzzpmqkpqlqqxzyqyzpjqjhmqlfzqqhypzjpzkznqhppkxypjmfqlnmkymiiijkpqxpklymilniljkjqixlhzihhznpqlzpkxjqkkijhypnhpnlyikxqnliqmpkjpfqlqlfpijpjjjqznfqqjlpjfmjilxzinlippqzpqzqmnfpiqppmyqpfqjhykfxhihlmqlflilpkkhfipxjyxpjnlqlyqminnplflpqqhqxmziqzqqzjkzllppznfqxxhpjpykpkqnpjnxymkpzxknflhxpqnxzifqlljijlpkphqfiffxjqyfphkiymmfknzqlfkpzxlxmnfkjfpilqnzxxhyjhikqqmlilhxmlizqkqylklzqmqnyqpnplfynfynlqpqnhxmllmqpqinlhfllpjyyzfqqzqkqqhmmqlmlqlhqxzyxfljmjinhfnklzpjklnnyjqzlxqylljiypmqfnqyfppzlqhlmflyzflznxifqhlzyllhnmknlfklkihnhzxliixhlqknjljqxfqfikyzlzliimpiimfmjmikilqxzjyjfjijpyxqlljlphlfjizijmllmkmmhfnynikyihjjnhphqpplhnxxiipqpnmyiifqqjpiipjzjmlzqppzlmmlxqfpphylhpijyqmhfkyliqqmpqpjyzfnzzhzkjiqzplmilmlhznqmniyillipfhxhxikymyfjkplipyqmnfklynpnipppllpilqilkmqpjkiqfijzkqmlzyyqlhhxllqkyqpymmfqynnxmyzlqqyhikppqhilihljqkknlpqfykjmmhyzfhpqfnzfpppqjlkqplfhhklyqpxzqhqpxifqhjmipqkpqhxzqzmhiiyqqlhniyihxqfpnzjphpfljjmpyhqnifmlkqmmznnqfiqhmqnnhphxqxymqymzpqjqifzpzqnkpkqpjpqxiyfxlpplzqqpyhnxjizmqlnnnlfppppjqqkqllymppmzlffpizhilfnfizfhkfmqzmlhlfpmjhfnllypklkjiknkxhppmjjlxknzxqyjjmhhzpkhqfjkqlnhnzyflfqjfnmhhimlflphhiqllqqfnpijhfmphpmiphqfqxzqqlinpxyqpjqxfyqlnmkhqqlzilnlqihqkqkyyikpppyznpplxhlpilppqxxlhqlzklyliilhxmhjpjznihflmykplkyfjfiqyipylqxyhznfqqxpnpzmzjfkqjfkpllfmjqkixqyfpfnmplkpljqqkxpnmqxmpzlfflmpfhhfimlyffxfpqlqhppqikklxnjlphpqylpkylqllmjxpzixpkzqphfyjfmiphhmyjilxlkllnqxpnpkhpnyyxlfhzhlfzqyfyfzzjmyzplflyqynqjppzjplnlqxzqjjqmxpfhpxxjqpkqzlxjxnmflhpmpipixfklpnxiipqikmplpxyihlmhxljppfmpqpmpzffjiqmxkmnkmfixfzxypjpxhizqfqfyppjkkpiyzpyzpykzfpxmnhkqmxxqhlqixflqlzzmhlimzzhkhqklkfljnfhlkyjjpklzmyfnppxlyppqjjnxlmlklpkhpxxljqhpkfhmmppzkflnyqqzpzzqypqzzkzpxylymxpzypqzxmflzfljjzqhyffmfmylqyijllqxhqxxqjqflqzljfkzqjyllqpjiqkphihqpppfqjqjyjjqyzmxiqxzqmpimkzyinyqkhlnzmqhqqifmjlqhliypkpzmqpmnzfqxkilmfqkypyzqkqjnqpzqxppiqfqlnnyqmnpimqflyhqyhjjzlhqpyppffqlpixqifjkqxqnzfiqiqxikpiklqyhxknljqmlzzxhkzfkykmplmyxmhmjxpzljpkljjyqmhhnlllflqnjqhyykhnimyxqmzjnpllzfxmpmxmhkppmyxpmzmphnljyxzjjpxppfpzqklhplqnzpppnnfnmnlqnypknijfpknximinzlnpnhjqhkzmhpllzxnnpqhqhlqhljkqlkpimziqzqhiizzmxpllfklllxqklmyyxjxhplqpjfxhjqzknjyqfqhpqjiljnkjmyhpmllppxppkflqzxpqmhlppmhqlknqkzzniyzyfxniqjjzyqiyqnlzkjqplflplfqxjplzffqxxnflmnzhlkhhyzpyiixnipmpkiqjzqpyyxplnpjkqqljyllhlzfpqihfqiilfkqfzjqkhllfmnmikkiiqzyjmpmlxhjffnkqlzlpxkjplpxlpfzlkizlqqlhzjpppzfkhnpjllyjlpxzqqlhmqlkipjmxmxhjkyhzxzpzykfmhlnlmlqhhlylqqyqkhizppzkqmnlzlzqxjfhzjpikpqhzfykpmyhhqzllpzpfnllfqzpizjxpzhmpilxjqjnzjpfpnfjpxyifiipinlhzzpzlxlimhfmkqpfllnmiflpjnpzxfjlllljjfpmnkhyhfymhmzmpmyfnylqkqlymjhyllplkjqxiqzqhylxqmqfzkylpllqlfylplppfzxiljmflqilppzpxinqmmmqzplmnqmkiqfjpqhypxlqqqfnylpypkfzpqilnzxzzykjppjklnhqyzjxhxqqmnkfkjlhznjpzzyqjyqhqnzzlkmkyfxqlnpqhpkhhqixipqxklqhxjpqjjffxypqmmqlqyxlpnqqfqhzpkyinyyqxmnjyyixyqnjimhmhzpihmyhmqhxzjplfikjklhzkpxzzlzppqkikjqqqpimjnpjqyzlxlpmhlzzzkmzhlqymjnklplxxnpmhzypfllniqplifxlplpqxmxjlnhqnxyhkylpqzqmqjlpflhxkqjipfpqfpqnjqmlyiflzzlyyfqykpjmxxffhmpxnxmnfzxmmmixmljxzlimnnnninxxpxfpfklqqmkpfjipijxiqfqlmyqpnqfyxzqmqzpjzplxpkqqqqzjqlqxjhpqyixymlqllflhmiqfixqpkqzlhyixmhmppxfjnjihqhmjimplllijlizqnhqlkzjhlfjpkqqmhkqqihxnfmqmmxzjzjlmhqiylpppliqjmkhnmxnqpklzkqxxhhpylzlpmmqpqnfliplnxylkphpnmyjkppzmkhxmxlhlxzpfqqiqlqxxhpxmjljphxxlqmiipllxxnpqzphjpyijmljpmfqnzlnxqpmkzpixpizzxpymfzpqiqimnhflkjqzmkllfpklpqkqfqqxypllqfpnhqplhzpjzqylyyxmnjqfplqifqylzihxffhjiqkpqfnlqfyyqlplnljkpmnqzxihiinhqpfqfqpkzhlmkzmjqmhhfjpjqqllykpkyzmlxhqilnflqxlmlmmnzjqzqlkzyqzfyplxkqzmxiixkmphqlyypmxhkffpnplnlilpylqpznizifhlnjylkfpiilhyqmlkizjpxpnpqmqlkmqmqqppkmnkxzfjmpkqmxlzpimmilqpfjzpqlphlxhjnkhmhnphhxjqmzlqpqipijixyqyppzpqhlfzlpjppzpkpnqimqqlymmqpjzljlfznkkkyplzmiljxnjlinfxyqqjjlhmjjqljyplfpklfpmqyjxhfypykpxkkmknyqjpqjiqpiyzpzlkkzzpjxzpjyqqfmljmqxjiqkffmqmqpnkxlyyljxzpykhllfkqnzpyqymykhhpqhnfqpxmxnqpqmzklyfyzzlljqqllyflxyyqqqpjyqnqzfxlpxjqnyzjylfhjqihlqfzlqfzkmlqxlqzpnxpqyqjhjpmpkizlqqmzqljqkpjkxjxppjqfyjpjmkljzpnxjmqlpxmifnlmzjpqhlzjznykphnlpinphfqippllmnxqpizmiippzqiyyhpnpnyhhqknypjplinpqxpkpqhxxkqlpiphffpjzflxzxfkpzxmiyxknpxjjxjflxnqimlkzmhixfinllqznmphpnqhqliflmlmllqzmpkpllmkppjqnnjlnkqllyklpxmhnyhqmlmpqimmlhqxnhxxpnzhpfizpqhzlxjlxzjflyiqmlqnnzqkipmlkfjnpnpqnpylxqhkhqfpqfminjnjhqqliyiqmnzzqfxfkinfnqxlhlmjippmpiqhyqnixplkilpjiqklpljqpklyqfpinlkfjlpxjlmkfjxpfzfpxjpjizijpfnpxlqmfilfiklzppypplqiqmxfkmziyzqyyxhxmyxmplxqmpjyxqzzmhplzjxnxfxpfjnziqxmmpmyjjhflpzkiqzlpypxlfjnlfhlzffpninmilqhpqinzhplfppqfpppknlxqpqqfikmlflizjfxqmxyqyizpjzzhjklmqkymplqzppinlkymjzknjpmkzpmziinqknmllphnxpnylkjqlljkmipihzpymnkjnzzphjnlynhknmnjqkhjzliznllppppplhlljjlxlnqplxnmifpjkqmlmxfppphiilkpppjqmypkqpxqpfjklyhlyylykjnjimqlnplmfmlphmplnhlkfpxkxjfyzjjmlpqpnixqnfinppzhjxljfkypiklmppzpkhiqqplxipxymxhyqqxlmxqljfphxpqqmphhxnkqpiqikmmlypqipfppjfmjqnpnxkflpfmkilfxykqiflmpffyiqhzlnipjqxynznipiqqypkhlfixpyxlxxxpqnkfhxiphnqlqfpxfzfnnyhmhnhlpzqnypljzmiqymipxhqqliqljqnqlkppihpphlhfmkzxqmpqymmphkzxklxxfkyxjqlynknpzlmqqhpkqzpypkxfjinlzqixmkiyllhpmiqfjqxqnlnlpqqzkyklljlppjkihyqqxqqqhqxpkzjnqjlxlqixpknqfqimqqnzhphjmiqpmpppqhnhiflpxlqpixjlpqpljijqzpfqphpyqjilfppmqynzlpinlyqnnnzpyqhhpqlpiqhkplpjzqlykmkjpqmkffxyplknlkniinlqpkxhiqqfjlqllnzyphplmqlqlnmmqnhqxkhpxzyxkhqkpqqnmpxnzmzllfhjqqnnnfljqfyljmynqyqijyypxpfmlkpnqjhmlnlqjiknkjynhqxqqxjykllqlhmjphqnzknfyfjklljmlqklpphpnxqlpjlppjnqnqqlqxlyifkfnyypjfqiqpppmlmkhqpqlmxzjylkfqpyhqzjqllmlqfihlpilnqhxljnmyjnpzpmykqlhxljzppznnhnfkhfqymflxnlmqiyqlpkqppnjxlnipmhyixmmjjiilzxxffqlpqpzpkxipxipknlxxfzqyzjnqxfnljpjiynqxnlyymlxxjzipfyxljljlyyljqhhnpfhlyhkhixljphyzjqqmhmxxmzzmhhmqhflqmnqliqlqpzknnykqqhmyppnhlpyxznjqfnhqmphljfpmzxpklmpyxqllxlymlmzxlmifzyijkhkmxhqklfyxypjmqppxjnqpifmhffyipkpkypjfpzyfkxqpnppnpqnllyipljlxmkkphnzhkkmixxhxlpyhlqhmqmhllfpyqhpqylpmkjmqqpfqflzmnhpqlypzipnmlfnqxlijymxzlljjmphknffkiqnijpznqzzpzqkfpijqylpkzhkpmpqnppzkllqmlhqqnnhlqynipynqihlqxzlllhqnxyhzizlqjpmnfyqpnpmhipfilpjnhhlpijyxllxffmpqnppjilfzxqppmlxkxpxljkqqfkphfmpkqihhmylxhyxqfyxqqqpnfhkqpifyxppxjplxxzxqlmnlyzxmqpfqqpzqyinphnpjqxlilhyjmypqlmxlxpizzhlykkkjqppqnhzhmpqjqfmmmlxykynypkiqhpxyppmllzqhliiiphippkjxlqjynjllqjzpnlmlqqykylnxfnpljqlpmmjjnzkqfnmyqihqmpjplmkypnnzhfqlqkhppqxzjlpjhpnxympqmyhmpklqqifplkhpzyhpjhymnkiznpjqpqhnmpniihplqmxmfzxppqzzhjpmnfypjzmhpjpqmihhlfjllpmhzymnlzznyxlqhkhznnixxlnhizkxlqxlpzhphfjhpnzlinhjjlmlflplphnxqphqypjlizfzqlfqixhpphpplizmlxfqlxjpfnlpnjmjfkjmmpkfpqnmlmlphllhfxnkypqklhnpkympzxnfjzzfinlzzkzzlpqypzpzqppqljllfnqzkzpljqkliqjhqqpyzmmpxnxfxlizfkpfpyqqllqxnqiqqppkppnjxffzllkqjzzfmilpxhxhzipjpzxpjjfpqlhfhzxinijpqmhqiqfnmhhjpynqjfmifqqqqqyqxyfjpxmqjlkmqqiqjqllfflqkkjpjplzlppzfhypfpppfqphkzxhqqlznqpjfyllxlkhpyykqqlykfkypjiphjjfmlizilqpnnqnqqlhyjmnlnlmpkpphqfqxlxmmnqmxpzmpllkpipzxykqnhjzppxppipnpyfqqmqylppinplzljlxqqpqpyllhhipnzfllzmxhlyjnfhkhjnxhmklqfjxpnjplzplppiizqphplzplxplkklqfkpjjqhzzpypllzjiymlyplijyipmxlynqqqmlynxkmihqfjnhxyqxqfqkhqjyyqfphhnmlxffhlhpkqyxlqfxlmnqylmliqlqpxkqqxyplqffyxmmiqjmnfpiqxkqhqfkikllqniffhplqzqipzifjiljlphppxilklqpizpkymjlkhfymfjmkpklxplqfzpzxqxiqyqpxmlzzqkzniqxjkjhpznxlmlmyqxximpznnxzlklzffjxkzpkllpfxnhylppnqnizpzklijzpmxipjxyhqkqpymxqfiliihyphmzllqjhlyllnnqpijhppyqpilnqfxlnqxjlhxmqpyllqzqjlqxqqxqmniixplxlmqzyzpjijxfpqzkilklziixplpkfpyzyinkpmmxlllxqlhiqnhljijkflflyxlqlmixqylqpjqhjzqxnnnlnnlpxnfhynliiipqzphnnplqpknnzqpiknqmiimnlfxmyhlljymliljqzqlklqqxynjqqfiklypmxpkykmjfimyhppfiqqilnixpnllqlklqjnllhzlhkfyjlhjllppxqqkqzyinyqzlzzykphfxlnxpkqhpxmqnfppplzppyyqlqpqkhjqqzmlmfykqqhlxlynqfkfpqnlfmlqpkizphpillklxplqqpzlmqifhzlnkjxyzjfqjzifzqlnhzlpljjlljlpxljpqhmqfzyfnflzlkjnflzqplqjhyhnfnpnjylnlqhlhmxpmppffnlffklhxhqxlkkjflqqlpljkkmqpmkkkppyhmhkijpkjypqnfiyqypmzkpyxmpmjzximinfihjfnkqzlllqllhhkmyqmpqxyzikqfpnzpfjzixllflqflqlmqpkinxfxpznqljkhjxjjqplhjnyqlymkyllnpyjlkiyxifqfqfqyjnxxqnlpznpxmlqppikzqzqjhhhlqxmhlhfqplkfzpxiyynypkipqiiyiqpnjlpyxpqqyqjmllqnqyklimmzqxlhfxzfplpjxfpxfqpmjyjymmiqmppphpjpffljhmxzhqxkhpnlfikpkhzzkfyjqlzzkkzqjfpnllypipnnpmqlkllhlqkxpxxplymkhkpjhjpmimizqlhlmqpyxlyqplqmhqhfymyllxkqijzzjlzpfphzllyiiqhyxkfllplflxlphqpqpxxzzzlpjjmphkxjzyilfihxhzqfqyylzpqqhnfmljipqhnxffiqflxhlzpppxknmijpzqlpnjkiizpizipmljiphxhqlipilnjqlmkxhllqqyfqjjimzhhpjxymqypknhiqknzyqqfxhlfmhhninmmnxjypxkmqfmxnilmkpqjjqfmmpzfqfyhfplhkqpikppypikjjmlkpyqqqnpmziyiklqqjfkjqppmqnlyfypnxyqqilplxjpjifliqqpnnilnymkpfihpyqfpxplyllpkhqmqqjkflylhpllyxynqxkfhjppxymzfqnkpxpyjqklzxqnlhhqqpfppznlpihzxkzifkmnxxkljhqmmphypjpyphpyfpphzqnpilzxjxxppqkqzpyjizlmkymplqqnxnqxpppplqqmfqpkknifnlnkyxmzjpzqqpqqkqilifzhfmxzpfpmqnyllypkpihlkpjpxlyxqhkkzxxpfkpnmljfyknlmyxzjjlnxqzppkhifpzqlilyfljykxpqjlpjixzyilzlnpypfyqjhkilqkxjmqpplxnqmpxlxipikznzpqhhyqppyjpimllxfzpyllmpzlknnlpjjqjmlnhniyhykynnpqpkpnfikfqjpplfznkyzpjzjzjnypplxippkimzpmixqffmhqzpqqzflfkpfnhxymnhyhxfiylhiyknnlflnmfkypzkpnxipmlqpjxnqkmhlllpmppliyzyqiqpkmzmhqzhxmpzpkixjmpjyimpylxfqqpkpzqlffmqqkqllpqxxpyfxyppqlmnplppplyynlpknmliklqkjlqkipfpnylxjplnhpxiiqlpijyjijnkfkjpjjzmfmkpziqzqqmmpklnphphplmlkpijjjkxxqqphyyqlplfilpxlilzqmjfjpqpqljjypqfilhjiqkjixlpnnypqxnpnkqixphiynnihxxzppqylqlqqlxpmyjzmjjjznppjqmqxxplqffikkyjzphfizpklpfphnzmpknnjfnqqznkmfhmpjpqnlnilmyqqzjkpiflpqpnlpmmzqxppjifqzqphfylkkxfpkqnqhyhkkillmmqxplqpyqkpylkjpymlfkqfkpzzkffzyqilpplfxnflqjzqhklxiliypiymlfqpnzqqiyyqmmmylfpxyflxyhfqppplpnjhnxllqimyllqnqppphqjlpxpqfxpzjpjfzxnjkzxnlimhyqfmpqlmhzmqlkyylkxnmpnyqknjplqkllqlkhjyxfxxizyxzjxnfklykkqjphmihyfhxilmfxnylfpqhxxflfqjixppniqxmxqmiqlqflfpqmmkplxkiqilkphlnphmlhfjiqmxjkzhphxlzjjhfqqqfxljzylxnmplznfxnhnlpmjqqqjjlhplikpihqiqyqpfmpklzqfqhlnkpillfimxykhzlkhnymzqqxmmxmxpmjqhpkqqnpjypyqypfynihhzqkppyhikiipkzplilqqyknzpqyqqqxlqhxipmzmylfhqyhmpfnpxjpikplljhyqfjljjpqqyynqlkkkkmmzfllmpfijhklplyhxzxxzhzzlnjxixyjnnlfqppzhjmqxjxnmzynipqlxffypjnnpqlkzzpjmqxpimlnpxknhqqfqjflxqnjhyifqihlynpflhzhplxxlfkfzzxqqlypqqxpkjmjynkjxlyfpiqplhnllxhqplpnhijypjiylqmfqmxzlfqxzlxyyfplnqqqqpzqfqlklxlympmhlzykppnhqkyzpxfqhjkxlxyqymkyqxlzpqpkizhjzjiljyknqmzixxyiyxqfzqjfyiiykinhfifilmlpkxjqykqjmiixqjfhmpinmjxpjmninnxjynxqpqilhhmqhkqnhjhqplijppixzmlnimixinhhjhzqlqhnjmjllpnlqpnqfzhjjmlqnlkhqkqilhhhqzpfflylkkfzkjlmzhlpnlzhpyfxzzplpnhhqllxmynmypjilqlpkjklzfxqpxpxzmlfqijpppppfqfpqljfkhpxkqkyiqqkkpzlqzjhixqinqipknkxkkknqmypkjfxqmppqpljlqhpxypqhlpqkfzlmfxfmjkpmihiqpyhjnzhmqphzlyqnnnknfykpiqnnjmzfkiphnqzplkqyjiiinkpllhflxjqlklkllqjhpqpfqlpplfjqfqxhkylfyqpkfknppjqzlzlixyfppkpphqjfzxqqmnilxpjhynqzkhqqyznyiizymzjhhznqnfhkzqyknhlmqppipqyyqkmxzzyllnpqhqqlxkjixnyhyyfqhqxpyqllqqnkzjhqzmpnfjipxjkjqijilnjmnknfxifpyfhqjyfmklixnillplfqqizxkqlmmhqixfzfpnnqjpjlznniziyqpjqjnimnkkqhqxiffnykiqylypxqfpylkihippyplyhykhzpfyjzhqxhmffpiifyznjpqyqxqmiqjphmzmjqplkqixphfpjhzqkmijxfqlqliphhfqxqmfhzhxplzqfjkqzkljnmmmqxhnpnffpjnlyqxflfpzpipyqqjpiiqpnmmfkqpkkhxqkmlqlzpzqpqyppzplxihplhkqzjqlphliqzhplznjxljmjxnzflpxpiifjzjnyjlfxpkppflpihkpfqilkkkkqjkqfhqxpyfllpyyjipzpplqxkhqymxzqkqhmnkllqzmilhfqqmmjypyqxliqzqfqqkfimqmfpmlxmlhxzqpqxnhznmjklihizqlyylhpxiqpmmiqqqihqqxfpkyzyzkqyiplxlmplinijpqjqjpflxpxfmxlphkfzpipiqlpqmhllmnpylmxqjilllkimfmllyxnjhjppzqhqphllxypymylmhhjllfymjnzjmnxlfpzqkqxknqkqjzmpiphhnyzzjifqiqjxlppzxpljxxpqzylfnkzhqmkhplkxfkixlppqilqqlnfpjinppipqxyilpxyzxyqqqnffnikkjijjhmhkpqymlqlqiqfhjxphlpqlyzmkqjzzqjzmjjpphmmfqpnqplkzfmfjplpiqypmlnpmjpyzlklpkpxkzjqhlpqmqqqzplinlxfnyxplxkfilfpjpzpfqqfhqlqlpikmplqzpjzxqmzqhxpqyijlqhpqhxlpjihykhnpikmhnfqqnqfxflllpipmjikhkjmxkknzqpxnlzyhhqipypxlpqzmylklyppqpkjinnnpfhlplqlmpffkjlhxxyjfyxplppjhqfqphzymkjnlxkxxkhlfpfjpihllqlnhkfpyxllkqpjhmqlkpqqlxknkfmlqfpniiimkqhzyizkmlpjlplpnyqnznppjklqznhjypiflmmljjpplnpxqxpqhihpxqqfpfiqpjijzypnlliqlliikmqflknmkjjpzifpmnkpnliqfpmkfmzpxlnyzqlhpqfznyflimpfhqpqqkjpkknjjlpxykxkikphhynpnkjnhzmpznnqzpipplxnzqfnqfpnhkphlyihnhzzqzjnhxlhlpkqlizqllflnjhflhlyzppkfhpjfpzflkzphpxyjpxmylxxlmhqpyjqllkzjhqxqkfkxpmxhpnlfpzqkkqqziipjpipjmppjyhfnjlqkkqlplfkixzlnlqhmqilljpkxmkmmxklfhnxhixpmiznhiqqhpkpmhfpkfklppqhnqzfpxjqpnykhpxylflqpqxqqlmpmlqqnlqzllkxppijnqqkmmxfpiqjknqlnkkzfjlqmxmyhlpjypplppkfjmqyjfppznpqhllzikiipjxklppjxhxpyzqqqlpqmmkmpmqfjxpkqjhnyxqpqhlppqjnzlpmjjlizjzjnlmhllyqkxzkjikpzfpklilfpplzlynpljyphylfpqlpkqimqxzmpppkqhhfzxqqliilpilppfiqqzijkkhpjlmmqpfkmpihjqyfyqpzhhnxhzkljzmpphmqzxpykjxplphqjjlhqhzpzqpqqxqlpxpnfmyflzfqpphqpilnlliixqjykymlzqljqnpnilpnqjzlfkyliyphqknkhhhfqqpzpklzikpjfniqlimmlqlmjnlikyxljxpplfpppllxzyyqxlzllfqljxmppjylnhplxqzqifjmqzmqpqplllhqinikqxlppllqxxpqnhqpiipfpinjqqqlxhpliiqmnppiqxfnfxppqlqlxypfmlfjynyhplphjihqhqkjhqppxnhpfpyxplijmxqfllfkllhqzlqhppqllqnhqjyfpqkxnikhjljiyqmikkfxylmlpnlnqjixxypxhnflljfpflqifnihxikyhfjqzlmlppmxzpykpkyzfiyflhhxphnzfnlyqyjlqkmjjllpiyyjypmlqjqkfnhhqpxxqikmykyjpxiiqzffqfzylmlllxpkfqlqlixfjlnlfxzkpqjmlhlxnklijnjlmmkpjjlnmpyqfllynlqnizkkjhqfmhnfpymnhnhmzjmfzplqhnqpzniinlhpmilylliphhkpklmpfnjlkqijqnillkimjlhxzlljqnkqpzqhfiyjpnjlfynhqqfjlpqiiyplhxmllhknpxnmlfpkppmqqiqifqzynppkmnqjpyiqjkqpniypqqlplmhppxxkninyjkphkzfzzmipfymlnfqjnzfxxhzqpqpllqpmzpllhkjpxplmikqfjqpiyfqmqkmmqqqzmmmlnzpfyhnqplkxnqyppfminlppiylzjyqhmnkfzzljixpflxplhkjmfhqlyylmpjfqykkqlqpmijxxlklyflkixnkhilpmqxqxxqkqmqpplhjflypnnzzhyhiylnpxpinfiqplyziqklxjfzypixfpzlffqmfxxlzhjylphhznmxpphpllppmklkqiymjnlpkpjyizfpkxxqhqzpqzizhzmqhlfqiippnjqlfxlykmqnlkmqmqiymqyifkflffmljpxnnnlixyxlnplzjklxllmppxzqipqnzqzmzqllpphlxqxplmkmxxqyymqfxxjzljhmlpnnxpkkfnzhhfmjnpjlqzlnfqlxqmqqqhjqnlljmjjzllzjqljljmifppfpqpkplqnikpiphzlqkxlfkifyixyqpxnmqfjqxpplzpqympillzziynkmphqpfijqznqlqjfqiymllpqylypmjlxqfjfqjynyljxipffzymqijpyphphmljkpjnphqnppihplyxmymxiknpinfqfqlklnlqlmlyfmixmflfinlnfnqlniminfzklfzpkiqnlyxmlpnxljifhxklqhzinjijlnxpnqlymjqzhppfilpppnypzjyiflpllqpxlzpiqxymmhyjmphhyhjylpfikhynknqinzhzqimzjhypflxlxilmyhzqhjlixlplnfhqpqlhlqqqfiyppljhhljqjznlkqzxqpmlhmnjffhhpxlhfpzjlxkpljppfzzimnqzpmlnqxlpijpqlqiqfpmzqhzxlylppiylpfpqzxiqlzyyjxlplhqxilzllnjlyjhqhqyppllnnhlnpmyzkmplpjpqflqyjizkpjqmfymxpylppqfnylmfkfkzhpinyklhflxjpinzqjpljfkqpnypxiqkzpnplikzpxnijpqpqzxylhpmxpqhjmqqmqzlmlqyhniphlqllnxifjynppxiqmqhlqizqpqlpxlxhqnqkjmhpyypqknylihixjqqkqilplzqqipqzfqlxzqnpjnjlqqmzlfnkxhphxlmmpjfhfplplhpxpxlqxyijxlmfmqpqiqlmfnfqzzxlzlnlmphxjymlnplkqplqlqyxzjqxmzympippfxqypqqixjqhqllqllnfyppzqfqqzlimpkjmzkhflljjhiymfymjlnpjqxnkpmhqqklnpqpzjkxlxzzfxjqnkqmlkqknxipllznmzqiqqpylplkfhnxqlqxilihlzqnlqizzlfxiqnpnzqnpqkpkpilqmnmnqqxlppfjzkyqmqppflfnpyiznmqykzpnniyiflkpypfxpqqkyzpxknhjqlyimnpqpmflpfzqjzlplnqxqixklqpqxihnjipmplqqlklqhzhznpqjyfqqhffljqiqmqppnikhjfiyqymkzkqqfpyjklljphpzkjmyqlhphplqqnypzlplzqjxmmjqxqklhlmjxmzpqphlmlplqjylymqjjlxxyyfpqzhyjizkqizqzzlplmzqjnxlmqzzxzhhnxklpppykxmxiplniqxxhiiiknymmpffymipxppljnyyqqpzqljzfizfhhyilnhqyfqlpqzzpippjxpmnpqhfhqyqqyhjlffnhyhzhznmlyhnlllfqlihfxinpyxfzkhljxhpqhhfzplmqpyixhhxypnypyjippppjqlxpkkyqyqklzppinxpplqppzymqilmmlmzflifqmpyzxyqppjypxzknxfmxhzffhplnqxpqxkknnjmfxpqllljpjliqyqppizkypmfqkzmqqmzlqfplqppplzfqqiqzzqlxzxzzqzkipzlpmfnpkhmpflxllilzqxlxkqplqkxjhklxnzqpmffilfjzxzqfphkzikkippilllyjyflfyqphhymimfpxiijqpkhnjqihlfmhqqpxpflnnjxlpqqlzmymkifzilykxfilmpinfmfqqxyqpppnfyyjfxiiphphqmqhqjyqqpljzhxqqllhkzqhhmzpjpllzpkljzpnilqmlipmfxxpynpyqxxlqyqxqfqjpmjznzllpmxnfjhhqznlmiqfmxmnzyhhqnjllilfkzznqfqkkzqlqhlkqqxlqnnflmlqqnfipxlnqkqxzklphhnfzlpkzhhphypqiizkjqkmlxhylpqllnqliqzpfkqzyzkjqymypjlqpnjliiilnykqhyfxjqkyfinylqnhnllpzplqlfypmlqnlqyjpjqfixzhpinkzqklxfppkmlmqpkyjqqxfhizlxhjxlmxfjjinffqxfxznhihzpzynjmjnilhljzykzpxqmpxmqxlxpnkqjlkhpykjzmyqzfjzkyqpqqqzpqnyllxnzxqyilmkypjyxlilqqfhqlpmkiqfmqphmzqqqlqjmmqklliinqqqpqqzxhpqizxpnllqyzmknlqihiljjnjlhylmxhqnjzkfmnmlqmhlhhjmzjyhfipjpfyxipnkknkqypnknqznxzynkqjzxjmfpmjkxppjfqzlxpikqpqqlnklfjnpmqzxkmnlzqxxjmijqnixzixpynlklqnpmnpqplhihlhhxmyjlqkxqfnplpklqlzlqpixfnylqiyhlfpjlxlkpnixplznlliphfyfpykznlqjppljqjzkzpjnjjqpnfplhzzjkyiklqpjiqijjpmlqiyfpllijxppjzzlpiqflpmnffpjxxyqnpjzpplhihfpplpqpqjyjqmqylhlkyqqqqnnzzfppqkyfnkhkhlkhmfliqxqpxpyyxnlqqxifqfmppqppnxfkmxmnlyfiphmqzxxlyijfhpjzmqifmjxlnnjilqpqjhkqiqinflzmjpnpqqnqjhinlqqzfpmlxpfylymppqlipifflhxhmlmnynpfzykjqlplmmqnqlflmzyplizlkkqlyyxqppihnqjkmlxlypnifnkjqpllhqxkqlipnqykplfjfnqqlkkpynqhkpfmqqqhqqyqnmjfpqzqqpkzxkjffjyhqiqinnkjkqklpjfnnjqnlmplzhxfpykqjmijpppfnjpqyjmnllykqzqlllhpljfmflqnqkfjxpkpqmnfzmlijpjxnxhnzixmniqlhljkkmpiqfyhzmzzijylpnxjpiqxllqlxlzimxnqxmlpllqljqqfpljnnjhflhqjfhymnmypnxpzylxyqpipnhnlkpfjhilqlqqyxqikzxiliqlklfkjqqillxjnxppmlpiyixjhjpzzpllppjhyxzflpkyqqpxpiykknjyhzlfmqphlflmpjxpfjhikqqjlxpkypjfinfkkyllpmypkmzxhjphzjhixjlhylxljxqzlqpinmyplxqlyykpjkqppzphmjqhhqilizhnxqlpqyhqmmifqpqhqkyhijmpllxiiphxkijppxjylqqllmfnyzphnlxpypijplmzqzfpkmnkzyjxjpkljlfhlymqqlpmijqpxxppyjxqyipzqmphmjhklnqqqklynlylzpqmyxfhxljpxlzfzqlnlixlzkqlfphpxplhhqmiqilpzmxmnqqikjlnflmqhnzqfiynqihmkykqmpyqppnqnnlniyjfpnlfnpxiimhilpmiihimlpmyphjllqliyzkllihpfplmqhiihmpfplixqnpqjfkqxhipqlmzmijqkzlixnxhnnflqxhizjpqppqyhiijfqikhllqjlmlzzffmilqzinffmimmymfqxfynlqqyypnmxnminkljxqplphhhphppjnipykpfpjhlpmnnpzmplqpjmqjihzkkpzjqpqyllfpypkpqfqjpjnzmlqqjzppxzlyinlxznlipilxmzllpiphmhfpkqjxxpqfpiljlmqjyplffzlpllkljznzqqqfizqqlhiqfhjxjimhqqfzzllqpnynzzqhxljkjjmlypqpppqqzqjnzljpfkjpymqqxzphlmkmjmplyqljihqplxmjpplhyqxjkymzlhlnxfpqhzpllkphphlijljijpqppjxzipjphpfqfyinqypipqfpyjypmnpiihmpqjpxiphqlkxzymqmpqplpjnnyqpxqfqppmjqmmiqqjilqlhijkiphpqphkqlpqzyknqmzpqipfqnqmnmylxkfzinfiziqmjyhknixkiqifqxppiiymiliqlmlkjjnzxmkfkzqxhfljjpjmnhxhqjippqqqnmiqyhqipqjiflqklpxlmpfpqppqkkpnkymqijjzhhliyyhyzqhhlnizjnqpnyipzlqjllkzhpqzpxpzxnizqxqplmiikilqnqqnyqqizljmqkpqpjhifpyhzflpmjqmqqmhlpzfpmzfjikpqkxnnqqpxlkflzmzfiikimphxpklflyipxjyzlijmzmzqllqllnzynyknlqnlhlpxhppjhphfpxylfpqmnqnxfjpnhnqflzqzjfllmjqmqljiihzlqmhxmpxjzjxllnplkfqjymixnzkxnphqifiylppplflyxhpllzhzpzmxkmfqjfpnfqlilmhxqxhhfhxfnfjifnzphhlfxpyhpyppjlpkqmlxzizpfqylfmqlmfkfhkiipnqzljxkimjmqziqpqzpqpflpnjlhmllxjxpjjmylqqqzpljmxlqqhjppnyyxmipnlhqlqnnnhnzqzpqjyzhfqnqplzhjkpqfpfxlhkqlhpxximyipyillzlpklxnpikylflpzflnjlxlkqplkxqynjpmhymifpqhlklfkqqqpkylhqfxlmqzfzzmlqqfpplqiljkfxhqfjnmijhiqlkkjkmhlyzlkxlyxzpplxqlppflzlqppjlnxzlnqljzpzikyxkqlplyxppipxfjklzfjlniizjjpimlpplnllqhplfkznipzphplxfppyzihqkjkxkjknnlfikznxkkykzjnilznjiyqmlppyzzxqyqphqymlqlkkfflqpjxkphqhxkyjqpkkkplnylmxpjppmyppnqjfyiiflpzmplfqkjhxyfkipyqphlkpyppflmppjlilpqlkxqhnqiplpilqhphlhklhinfllzjjlqlipmqhkiqlkhhlpjkihqljypqfnpjllffkjlhnqqqlqllnlpqzzxqpxnljhnqqyfhfnymjqqmjlqpfpjjxifxyxpkiqhjhmqzinkxqqifkljzllpkpymzqyizjmpxkzphyxpfikqqpizifqlqpmqmqimhfhfkpllqyqllzqllpmylijzzqmxnnlqqlzqppkpxkzynpypknkqlplfyyplhqynxpqlnqqxxjhiqlyzzqjiplmjyqknzlpzzfxjqfpjllmhkqpjhhxnlhpmjpizjqipjhkxlkqippqpxmkilnlnlzllmpqfpizqfmnzjqkpqqhqjxfpzhxkqijiyxlnqyjjnqxzhjlmlqnjqppmyljkziqnhzmxfljhqiqzkqznxjlzlylnxhkkyxlxfnlpyxxppxzzlkmlplxylfnlqnmnphqzljfpqxppnxhxnfphqxlqqpyhkkinkljmqlqfqfhpkpmjnqlqynxixixqjflipplpllniqqjfnpplfpfmjxjnzpjmqipqpimynlylxhhfyqkqhplqhlhkhfzqhzpyylmyjnhkykyqfpilmklmxjpkizqmmznznqppizkjpylqqiqpxklqnqnkhymqhiyjxllpmxxkkmflpllhqpymmqfkxjjhqqmqxipzlppjlflllqmixphfpmfklhkllhmpilmxlmjnqpfyjylphljkhpinyfynkhpkzfykmpnlyqjxlpqxkqmmilhiffqmflniymfnqznikpqkphnqphqqjiiqlhlpxzpzmzhfqpjfzfliixhpqlznkzfpxjpizfllinnpqhpyzmplqqqnqzxxfxfzlpfjxplpknnxhzxhkpqmpqmymjxyxpnjfylzqfnnxykqllklykhlkzmlqmylzppqyfpphypyqpppljhqqhnfhhypqlnfxihllpmlxlhlzqjxhpyplqizhqinljfifpjhxizqnmxmpqiiqfkjkqnlqpyzkqpnkixnhplippyqmklzqkiqpzmyjnhfmifljllpiqkqflqjllhiqkfmyxqlhfhkzpkjiqxjhyqqlkypmzpymllqxfqylkyzlpqnmylfzqpihpzqmjzifymyqpflyinlznynppnhxzqipppljmxzfqlnqniyqkpiplplmhhqqmkffkfhljzqplqpqqzqpfljmyqqnxqjllllylhyfxqjnliqyjlxxifhqzhqzfmlllzynpllqqmyjqhxfiqllpnyhflymfmnqpmzhmqqznjqnlqpqklqqpllkpimjxzzjypkklkqqlkjffpnpqxkphmpqnlkphqlxnliiypnflzmlqmmjlqmjxzfmqhqipxnkillxfklphfljyylzpppzqpqplilqykxqxpmmpqnjjpiqliqhqyixflfzqpxzikpnklljfqlhpmnmhyjnxfllxpqqipqffxqlmqlqzhnhpmjphmxmmkjmkylxpiyinqqfkzxnllqqlfxpfmyzqqhyplyhfhjlqznxzkqnkmqhixhxqppxqphmzqmnzqpxnhjmkjzphxlmhnmpxkpqmpxqqpxpzqxzlhhhmhqjqzzxnlzqjqqlxixjpxkplqqzipxqnpzhifhfxhxyplqlpmhjqjqynkjlykhhjxqlzzllnphlpfqpyjhqympkppppyixhqjxpzjqnhxkhqkqjqkjmqfmymzlpkfhlqjliqkmpijlxpfqxpxlymmlyqzzmjljpzzlnlmjkjjqnippnilimyxphfyfllmkfmimpniqxqyqmlyypphpqjxhqlilxllqpflljipmjqnypqqziqnmxxpqnqphxjfqxfyihhmqpzfhmyjjqynkxqlzlkzpqnilpklkjlyyqmpnipillphqlffnlqmqmzkzflnzqhqnqqffxhqflxflphppljqiyxpkpzyyknzppqkmhzfmhmzxphiqnqxlmyhflxzfkkkqjhqlqqjkkqmqplxzinqjqmhyhpzfifkxxjplzqlqlqyyjyqqmlqhxpzkhxpizixqkypjyzzznmflyqpkpflmxzqfqynilyqnqzifzmzlnzmypflppmzzlyxxhjflypzmklmxlqplfqkjzlqfhzizpkkimhpqkkkljylfmplkhpkyqqmlpifhpxkmxqfipjhqqqnjznlpmlmlkllxqiqhpqzqflnqllyjzzjpkqzjzifzlfqylxljjlqzllpfmpnzplpllhyplkyfpqnqkhplyyyqnpzpiqqypxnhfnfnxnmjnymimlkiypmkqkzzjqfpjzqllhxzmjzmklinzpnpxnppkkyjnjqqplqihqllkiffihlkjqkmfniqxynnflhipnnkpknnlnhnyhlkplpknmmjjplpjxqixppzfqkxiqnkffikfqlqqxkzqqymxnfifpjpyiypqqnzpqmkllqpyljpllpnljqilnnfnpkqpzkymxnkjqfximzilniflqninqjqhyiliyplfjqnppnqnffnqfzhilyqpzmnklqkiljfqyqnplzzqyzkxljqqpkpnxnniljxfnnqfmhixkjlxlxhzflpyfkyjpqjxylmhmjihqfpfxqypmmmhijlnhxzlzqjmmzzpmmqyypyqqllyplmilppkmpjypikjqxpyqifpqyxqqzykjkphfkqiqjqfzhnppmyjlpqxpplzxiqlhqpxmlmyqnlflqlinfmpqypqqlfqhlxfiqmlznffxnmzxqqifhzffppizpmflylpinmyizkqjjnqzqppklhpnnmqyynppflkmmhfifmpyppllkylqljjfljxklplikhzznklzpqlmxxikphknhnmqzllxqxhfqpmfqixmmnjpkfzlznlffqmlpqpfmqhlpqlfqqlfpxlyhmpfzfyimpjqqzmflmqfpnyjkyflqzlqpilhypiyxmpmjkqxlihnixpnlxynylnmkzmjijiyzjfpqqlhkzhfmzyxmqlfhflpifqppfyklqpnfmqppfjqjpllxlxjxiqxqhnyxzljxmjlqnpykklpnpmxzhhqpihzjpiqmlklljyyxpiiqyqpjpznfiinnlpnplpqpyllippyqklfqqikppkxzyhfplmljhinllplkhhqllqnkkyhkllqjlzqynnllpiqfyniyffqpnhqlyiqilflkpxppizlnqlllqnxkxikfppnhflfiylpmnqpnqplmkkqfzqjnqinhimfxiqjkzhfiylkpfxnixhijfxzlhpxihnizjzjlhphpqlhxpqzlpxpqjmkzlqnqpzylhlpzklhmhqqhznxppqfpmxzqlihinppxzlxhqzfypjfyhipqlxxylijyzlnkxxhlpzpzfipilxjqnpmkqhzfnhxypkjlyixnyqzlzkjzhklpflpqfnqkkmnlimqzfkfhpllhjnlhpqmmmkzpipiizkjlkximqnfpyiznipxkfnxpjqppfqmqypllmlypnqjhpzpnylkznlpffymiqqhqlqfylzplkjkkyqxkkkzqjfzxzqyhlmpkfqxyfmllxhyxmfmlpqjymxlnqqjnyqpliphfqhlpzjzyxplxhzzhymzlyzxqmiqziqpxlfppmppjkljkqpkmphyklfqlxflmqqpqlnzfmipiqklxhpxqpqjyynfmnhnpqfnqjnixziqqpnppqxqhlhmjqfhlfpflqhqijlpnxpylmlknkflnphqlzzhfyyqlqyhxjklqklpzjnkqyqyqplllfpfqhjlplpnilhqknhmlqnyqilljyppxjppnqpqppxhpqlkyqjyipfmixxkpmfyqmzlyyfmqxpllflilfpjijhfhyykjxpnmfqqkkppzjqhqlqlqynjjpppqqypqkxiznnjnfjnnipihpiqqxnqphziqjjznqpzphqijxmllyjnqhpijnqfzfjlfhlfhpfhizyjzqmykhplqnnyppxhhxyqkpqlqmppzpiqlhjyyiyqiqxphhmkmqppppllmjlmxfijqflqjpkzhzjjxixlqkmqxqjqmqhpxqpqqjfilklzqjpjmpiymlqmxqylymhmyijqqyphlffipfllpkhqhqkpzqyfilqlinmpxixnxhlfpmlyxlmlxxknqixlzphmllxplkpzqfhhpiqnlkklypflhifphkmyylilqplkmhykkzxillpqqikpjqifhlxklihnifmmzflpqqzxxnflpkhykffmyjfhiimyjlqkpkzzpmmnpmqlymjlzpzmiplqyfkzpjnxqpillinmhqmqlpliqyqlpnnfxlpizznizinmixhkjkfyllqhpmqnppqxxyqfmylnjkilmlzzhyqlpfikmhyzlfkxzxqnppipjyyzknjkpqlkxqpypllzijxfinpiipnlzqqplxphjlhhxqnhqfhqpyjppqqkpqfxilnkxlqiqxyfplxpzzjlhqqnzplqmqhxpjfhliflqmmqlljhkjqnxnlimkfkzqplzhxqxjyplljjlqpyjqkiykljpfmqppypppyilhqpzqyjyqlkmzhkqmqnxmpnjpjnqyzynzqjnqpyyflhqnnqypxhqlllqyyizpjzhpqkqqymqlqiyyykzlziqpxpqxlxjlpiqpxlnqlpzpxqxnfqplhjllpxqjpnjlyqpfypxihyjhzyzyqnffiqypixxqlhxpmhmqpifixqkkhyqnmlhfhinlpqffhnppqkyfkfmfnphqilhzqqlfxyqmxfpmhxhpjmiqljmfmppyhiliqxlfllifpkpkqijmjxzlqqpplzhxxmixfxklyjjkykfqmkhxqpkpykqzpykqlhjymqppfjlphpxzpqylhhkpkqyhnnjpyppqpfkmllmqfxqlxflizpzxzjhnzjykfmkjlhlhxyhnqlqlqzfphjikzfzfmllpllimxklnlimxfmikjzlmfhyqkilpjfpjzpnlqphqfqfymlxpkqqnlimpypnjpjplfphqizfyyjzlqzqjiixfjnpmqlqqqkfkfmfiqfpxlnkffpylmhimfpqjlkpypyjyppylxpzqxhjiyhpnyklqhymqkxqlxyfljkmjlfyphnmnnmfzzyppzlkmppkplqymzxykpyqkixilhqkfnmqlhlllypljqlypmiqkmlyqhiylknfkzfmpqzxyxlyppiflnipjfmxxzkznqylzzpkljmlkqnmjlqxhmzhjlphqxqynjyplkqnpxqxlqmpyjiqyymhkqlpmqfiqknnipmkqlyjlqkjljlifzqpnpknqlzmflqyjqlphpikyyyfzfqniiflqiplxlzjpyhhhfhjlplpifhllkzxjjkplqpplqqkyqkkzmzinpinhqpflxyikjllypkpnjizhppzplnqhjyllpklhnkpxixqxkjnxxhfnzzqyqnkyyqlljzypljlmxjlnmpylkhmfflxlyyyqpmqxznhqflqzymlqhmhiqphpimkpnpjqzykyhkxiflhmmjmmifhjnpmjllklxljjqjqqnppjpjqzixmnxyymlflfxxzyxljhkjpimfixinfhhlplmqiyfpjzymipimymlplkzxymlzijxklhjlplxqilznpzxxnzqlihxxzmixknlfpfpqmqmpqyjkphzyfzkkmhqlzzmppqyfpmiypqhfnlpfllkzqpknnmlppzlmmqlmpfilqiqmzyqqniqllmnmqmlnkmlpmppzqhyhmqhyllpxllnzmzyxlmpiqmmzpxjqmflmnihkfzjxmzlpnxflmmjxqxqpnipqkknllqlkqfzpznlxikqplmxnljlhplpjkpqnxqpqjjzppfjminpffhnhmnizmxxnhqzyllffppjilzhlhqqyqkpniqmlpifmlkqyxypjhflqqnnjflllnnixqpfjqplhxzqnlmxjxnqkpplfzzqmzqqiqhfphliykpzqkjppmhlqfliqmjmpnplnnlplnpphjqqhmnfzqyxklpihyqpjizlppfnkqknpplnkilpqxppilnlkqylhllhfjzjklplhikqmpzlyjfpnzpkppkzqzfkxklnpmlqzphzxpkhqjqzlzqhpmqiqqmlxxplzlzznpzqppfhpznqqpxjqmhnhpnnfpjlfqqlkqzqknzqqqnkzqpffliixppnqkpjlikpqkpymyihypllzpnlnjmylfxfkijqqkmxflpqlmpmlzlpnzhkfqqfpxfhnipmpyllxyzkkmlxxpnnlypilfhiqqhmzkjyqhqfxpzlqpyfzqinmffmfiplqpqzhpyplkjplqhpinillzfimxlynjnjlqjlpjqjfxzjpjknmqmnnjlzfljylfzxqlpxhnxyzpyznqlnzlfqpjylpnxkfpqjlyimyjpppjpmiffqqfjkpxxylkzzhplfqxxkhpfzkipkjqyxfnyxiqnhfyyyzfxklkllmnnqkiqpnxxpxlqjfmqljkyhixpxlmiikqhkljqqhqnzkmnqjjpfinyqiifnfqjqjqyjpyqpippnyzhllhkpllynzfipxhmpqipijxqkjyhmxyplmyfkfxylhinfmkyiqhfhlkpyqfipyllqjjmzqfzlljjlijfizqqmzkpyikphhpfxzflhyzxlpfjmizifhqihhyyhyqkqyyqzjfpllzjkiphqmqlhffiqpnxplpllxllhhqjzkplifmhfxpnpfkqlzqjijqknzqlilxpyhqfpllxplylykpqnpfqfjnplnmlhjilzfmpqfljkplnjlxifmqlmllnljjlxlfmlpjhqipnmqllpxxqjphmfpzmjfjllqqqhjximlpnmppnfjzlzxqnqnhqlfhqyhlkxlmpifpfkqxqpmqpxzfpyiykpxlqfhppnzqxnmqlylxqjjmxfnqxnxqzihhflqhqphpqfymzlqplmxjjkjkqxkppqpjpxfkklyzmmnkjyylzmlhijlppjmhqypjmljhxpxynlnninflhjkyyilhnikmjnnmkfllykyqypyhphmylpfqhmjhyxzlhkfqiymxlyhzlzplhhmpqlflipkzqxnjpnklyljnqpyjmilxinlqmymppmyqmkhipyiyxxzlixjkilqnpynzljzlknzzqpifpqkpqhjhnqxmxqhlnlyjpyillzqkjilifiqlpimqlniqlylhlyzkhpqyhmpkpfyxflkpnhjzjiqmifzqkkimqhxhfxizqppqqlqzpzxxkymhjqjylmfqzfkxkqpijqjlqximjxqznqmxppmznpkmiippliiymnklljpllqnqliqppjjyphnhmqmnnippyipqpfykklphqfijqxxiiphxfmppmyqpfmmzzkjfylllqxxinhqmkqlpxqmyqqziipinxjjlqqknyyjqjinxyqhjpilpnnyplpllnipqhjlxmzylhklhqmnqnlmizfnhkmlnqmpkpxylkjhzzxfylfkqhkympxjxjqfzplipqkzhqpyqmlhqxqfqpmkjfylzknnlhpqmkqfkppxqzyxpplixfxhklylqjqfflkkmznphxmyqmfqmlkyqlqizkxlykmlflylpllipqqhlzfppqzppxxqfhlnzjflqxlhnqfqlyxzyhzlqihkqzmzmzqzpnqqzfznplxlqljlxjfizlljlyhzkzlxfqymnzihpnmqlpqjknqhklzpzpfqhpjyhpipqqklljhiijhphqpnjnzpjpnqppzmlpjnnzkkihqyxpzlppxzhnxqnqnklzzplxllxqqqpxhlqlhkhmynqqfqkqlnqzjzhnpyfxjikhhxlyqknjphzqnjypnzlhpylflzplhmjjlzfqjlliknxqlqkpkkikqhhzlqpljyxkpqlxjyxppjxpqjiylmxllzlkqqlmplflfiypqqljqqymkiqzlkfqjljfxkllnqxipmkqmlzqyikkhjjxqzlpylmxyipnizjlxhjkylxmkzflkfpjinlzypqimxpkphhypqhmmqmqzmqlpqjqphqkxllmknyzjpphflpylllzzqqzqyllnqzqfkyqmhfphynlpqjqzfhikqhlilkmjqnminpzyihfjilqlflqzqlhphiplkpnlyqnfplqzlnqpllmhnlljpqfqxqxjhnqpynlzzpkiqiiniqlhfxnlfkjlyqixffzllzhqfzpjqknnpkpqlpkihpyhznzjpfqlilfqppqlzplqqphhlmjfmkqpfpifjipqmfhpqfxqmlljppfmixjzqlkpyjznlhnxhffjpkyjqinmppxxpmnqijmzqkqjznyzplkhqqqxqqixxqqflpnqzmliyxxikflhmzpxpfikmkfixkhlkxqpxqfllpphyqpifniifikpxylhqilnjlfjqllqxklpxkihpqhhzhhipxyhfflqpqymlpjpzixmylxzqnpmpqmqyjxnhqzkpjzxiqxqlilnhmljmziknpplqxkyhkqxjyknqjxlnkqzzxiplqjpnpplppiflfnjnhimnqzqllnplyxqhlzqlqlhikppypmqmlppfyzxlxhxjqpfzppiyklnpqhhqyllhkhhnlxynkzqqzpzifllliplfiqlfpflyzqqpqxplxynfxqfnjqlqfpnyjpfljlqhqpjimjkzplihhnqyqijzfmnppjpqqjxlllnpljpxkfphpjqpllqkkhfxklnlpxzhllfylqpliqlfnhxlplpylkkhnjxllxhyfjjjkfzzqqnplzyqlnqxmimqklhqlzikjlxjmpnpnfqjlmphpnfpzpxqmjqypzhhqljpnhxzmfzlqzkjkqyhyzqmlpxpxzxilpflfnxllppxkmpykfiyqjxxpqzkxxlqpqnnfqixiypkpxpxhpkjyqhplhxkmxyyqhlinzxylmxzmhyplynxzpnpilflfjfympqhplyjhkfjmjkxxmyimkpqxnkpmllqkihjklhkqlixpizynkqlfpqqqhljxqxinkmplhifyffnkfzjjqipkxpnlyqlxllhkzhhjqkfzyxjqykhhllpqfmqfphzpmfkppippxjhpjyflhyqqxjlqhpllqmhlkyyjfxxlfqxnqyqflplylxnnqqqylhyfilmiqhmfhzppyxznqppzpjzmjlihkqzpyxlqnlnqppyznfmpmkyyjfxilkyjhjpqjhmkkykilmqmpiihlpniqkpfnmlhxkmjfippjpfzmlqpkfixpynmxjpfxxxpxqyqmhhxjpinqhnjpzhykxzjqnqnllxxhxjyizmjkxzilmiqkpxqlqhkxpypizflhyzpyxnxklzqhjjfpqpyxqlzplqkjpqljzifqqjplpixylqqnymzpfpqjlplmmhxjllhmlqkqpfflfnxzqfmkzqpyhpjyqkqnhpqilqqqlkyippqqkyfpflmfpxplkymqzpfxqxipxnzlzflllfhqqfpjfzjqkmxlkliljhjmjmpkpzpzpmqxppfmynqqqlmmlnhixlpkqxljfzqlnlqyjqxlnlinhpqjqzqxklkqhpphpqhqkxnizmnihpnlpqxffxppqnnlxhzxliinimmkhplnhpynxpjymppqnfnxkpzhhmqhznnminkxnlklqljjqmqqljmqljljhhizlnfphjpzzinixmxqqqkkfqqylhjkqqhzypqlzpxmpxjfhyqzpyqxxkpjqiqlhlfpkykfxplpxjzpnnmikplmmqpplnqimqypllpqqljyiyqpmkxzmmfyhjqjnpiljfpylqhllnzykhpxpphimynpqfjpjpxyfnpypxjllmipkypkylpznjpyhifjnjihlfjpnkxlphlmixfqkjjqzxhphppyllpqnlfmxylllyyzxyxyyjqxpixylplqqylppllxhxjqjmfxpkqhypqpzqzmpnqxqmqhnqljqplqnlknxxpqhzlqimqxflzllqhljmqnzmnfpmpiiqqyqqzxhmzkpynqkplylpzqyyhliyylhllknpnpkfxlxylkxiqkpnkpzxpmqhymhyylqqqfiqhqpqkmkfnlqjjhqzhklmqjnpxjppinxjlpfqypfnhjqphqknkilnhfynkpqijkplnxpklqjpqppypljlxpkjqylnhknplxzxfnliqqjilkjlxxilpznpqjymplifmzinflhxqlqpppxilqmljllpqpkxhlmzhphzizhnjkmpqqkhjzpjilnjhxplnzpypphlhiqkykyxkxqkzqmkihnkiqppjqylqpnxqphihjpxqpnziynylqfppxmfznhkzyziljmljjjilijkpqxzzzhmpqiyfhplhplllpxpkkyqfkqmzzmqlqmqixlfypqlxpylikfqynyhnmzklfjlimxlhpnpzflnpzkfhplxlqzhplpxijyinqqqqlllpqklixmxnlnmqfqlhfmnypqpxjxlqzlxqjmzpnphqzqqfpkyxqlkxqpiqpmiqljmmxzjyihqlqkqlzlqzlmpxkxlyiklkqqnjxjpplqphnxhzkqlfjpfymlqmxlfqkmnjzyxnmlkqmjjniklzjxxnpqylpimymppmzlppjilllqyqlkqjjfxlqppnqqyzplyfzpxxfphpqlznhnqhjlfyllkplmkpqzlpzjphzqkqjlfxqylplnpljxxmkqknqqqxxpjyllmxxqyfpffnlpnihjfzzipllixzjpxqpfjizxqpjqzlqniyhffppflynpkflxqpjhmqyzyplpplfjxxzkjjyhjpnxzxqlnmqykfphlljqnqpqnjzxkqlplilpxlfqppxphjpizlllnnmymzhkyqpypzlyyipqpfpjqlphypjqppkfkqhlzqljxlnhhkhznzjynzpxlpppymifxmjqqjpyplilzynqlnypyxplkyqqlmyznxlqpfllyjffjkpfzlqyppyylfhfqpxfkmipqyypfyllxnxpxhxlkqzflhlyxkqqqpqnyymjykzhilqllpphjpxlkninkqpqqjpjqfxmpqjpqxphzxfxpzjxlikkzlnzzqhimxnmziilpfnkqlnnmzqlynznjfppzflppqqjpjpzpypfyjhmqlffzmppzkjlqlffjqppjlmilyjkfzzlpjpyllflklpmizzfxihljmnnilphziyplqklyqqnzmnqhilpijlyfhlizlnjpplnfqixqfnflzznhfpnqppjqmhyxpzlxyfzliyhynkxjyqipqjjmzhyhffqpzfqmlimqxjifyjzqlkpmlqnhmqpkxhimzkqqnijlilhyjxzfpyqfpxlflyhpnffqlzyqpqylphzplklhyfiphqqpnnfplhxyjlipzfqflqxxjkmhpnlqkjlllpiqhfzqfilzzqpzqxqmylzfqxkphyfqplqlqkzmpjqippxmmflqnlhqmphlllkjyzmnzplpqmzqkppnlklqfqfjlpjhjxziqiqfximxjyljfmpnqyqmqplllffznlhjxhilxkyzpllnpjmmnqjzqmqxkijnlqqqnplfpyhiyqzmfqqzmhximhpkplhnkkxlnqkikqflpffkkpjfiykqnqnzknnppmzpjjmpqqlplqqzpzlllfqjilljllplxpjfyzxlijlpkfqkynlllnnnixizlnqljqlmjpqhlhlqfqzmyqniixlhhlmnhlqlxqimiixxpmkillqnpmjjhmfkfylxfimmplflnnmqkyxxqpfjkiiqiyxzyjlqpfqxknznxkhqiynjnppqfpmjflmnmpmqzpipqkqzphfxnllzyxqqpnlqqqhhpxqyyplzijizzhnkhlqhhkkzlpllkfqilpqpqxhlljqqhmnpfyqyhqnmnihllihlljqnznpzpnxlmmlmyylxzplqympfmfhpmpmnxfzpknpiqhnqmmnzimnfxqfxzqlqpllmhyjznqyqhhkpyhjkylnhxkphyfpxfzlzpkypnlknkklfqjnxhpfjzykiqpfhxlmfifljhylfjnlppqlqmhhyqqmqyppfiliplzpjfxfnxiqqmqlqpqpxmlmhzxxlqhlqpijfynppfqimmylzkyzpxxkjmkpnnpipppmqpqkqzypplkfpinlzhpypfqfqzppqilmhppzmxxnkjikifpzyylfmkppxqiqlzyjhlkmymljxqpziqlpxliyfqhljflqfkilplfjlfllqlkhhhzhmfnkyflhmfjlykmfpmmplhhpiqfqxqqqlllpfnphjqkklzfpqplqylnlxjhxplkkjqjpphhqzzhxkqjxffppplylhfqxmqpnfjkhliqhlnxhhzzykxlxikjqlpmjliffqqkpzfzmhlxqfhqlqippiplxlpflyzjkhljqpfixqnkxqmnmjfqphkkznfhqlkzhhplqnnmfqzkxxphffimmllphfjlfmnyjqqimkmqlpqljjkmnnxffmjlijqnzpjqllhqllkxnylqlyipilqklkmphqlmqxyiqlnlfplpqnlpimqfpflmqmqizkqpihlniqimpjjnknqyfqlfimlppllxjflnpiqkphnxnjmmxyxhzpmqnzqnihyppllxjiqknlhqjylljminiilqfixjqipqqlmymmlkjxqpkmfqqfflilfqhinzqnllfqhlzzzkllpzfqqjllimqiiqpzqphlphzhpfnqlkpklnjyizlijlxykqymnlppyyfmqipfikqqipxizyqlllpppfjfxqmjplqiynljnnllxkllnqxqmjyhhlylfinjfqqqmjmnziqlqqpiiizlmfhzkplilqzphqxxzjnziqjpfhqyqihipxllzmmfpqppqiyxfkxjpyzhqqfpxnipqfflpkllfiznqlplhkhzpxhhjhzmfnhlyjlyxihfjqiqnnkyillkflipppqzynxhmlhpnpknqfkkhlpiiqzzkfhlmnilzilxzlyinzqlllkliippnqylfmxlzzqlliyilmpqxlhfqyqhlfyqmpzjlklqpqxylqfiklxkqlmmlxxnlpkplplqpqyhnlpplplxinqlzhxypkmkipziqhmqixfjpzynzyxhqhimhiqkhijqhzzyflzmzqlzzlhiyxlliyqkmzjkkpqnnkklnfkmkmxjyflhflfphpzmqqkpmhnpqqyxyzpqkilmqnqjxfyiqqljhmipfqnqqppzxlfixzfjhklmlpllplqhnimlxpqhhhpqjplxpfyxqxhhikxllkpilxyqkjxxflkixxhjjkjqizppnqhfiklnjlzhjfmfpppmpipynyznlmljzzinzxjllnnjmxxfyhymkzlmnqhlmmzmnlhllxjpxxxzifijqfxqqiypxhnlnzqnqpzfqhfxjlzjpxknjxqlizizqymkqznkfnxmlkkxkikmyfkzqqqljqkpzfyjqhiflyqyxjjppjyjpjnxphfqpjkmhnzynkyipllkilnlnhqznpzylfzkhyqymjiyplfzjmlklipnlyllpqlmqjfqkqjjqhjqjqizliqppplillhkzkypmyqjkxhxhzjqnqlikjjlfplhqqllmpkxjipqpplikpinjyjfppxlhhhlkfqfyqpyjkjnlfyqjyxiphxhnikqilqmqiyhlnpkhpzfqnqmxlzjnixkfjqmqffklqnxljmxlfhffkqmfphqilqpfmnjqzphlixqpxifhqimixzqzpinqhhxnylyklklifxplpjqljhzzzqqxykpnqzpmffxlpmkmpillpnzjxznlpnjmmxfppkmnixpzxmqklxiyplmmzxnflfllxlzjllpqlmxhqkilzzhhplifyqzqpzzkkzynpqxlnhzyxymjhkkxljqpplmjppkqqllllqmhjqjqqlyplqzmllkzplfplpzqppnmppnfkhhpxyllqnkipplypplmpzjnmjpiqikpjhfhpkqqpqhyyqmqplixyfzpjmppmlfyklqmlmzixlnxmfkzyjfmzinkipipfiqplpmlzmhkiljzhzmxynlqkfjqpxfqnmxlifzjfkpypkqplijhzpfznzfljfjkmlxpfpiqlpyhjnikqnmmjiixfqqhqllfplpypxifhfqkqlzqpqnilqlxpqzfhihpimlpmpxippljhipizzhpflfyxympfylllqnfjfkjqhiyfiqlnlqmplmnqqizxixixlqhippfipylxlqmqpiyhkzlpkiyqlqzmqklllhpllqqqnmnmmyqnnnyxlhqkfkjpmqqxhyljmmqkhxqiqyzplnlqpjylzflplkkihhfhiylpjpiplnkxnynznpxllqjpfimpqpxhljzqfyknqqkqnpyinhhxpmylpknjhhixnjlxlfpppmxmfqzzqlppxykliffpmzfxlpiykyxnqhpnhfzixznilnqpjiqhxnihllnqiqkpflxymkyxplfkfnnynynffkxklkxnhyxiyykqxlnqyhlmyzxplypjlpflqkqhyllhnfhmqxljkpqpjhlmqkhpnfpqmpymzzhphpyqxlyzpjnlzfmjljjnqxpqyzmpnznnkfnjmhlflhpfmphlflxmkjfypfllzlnxqyqpklilmqmqkimqhpplxljhjpnlykhyjlliljyhiimlpllyzqjljyqnyflfhllfkmfjifxpjmplpqxhmiqxqilfpymfqlzqlmkmqijpkznlylniljiylqqmyfyfnkhkylfpmpziffplkilpzlnpljlllpqlqlzhqklfqpqlxfpqzphkyxyiqiplhljllzlzpppninmlzjlfylpfxnknxkhxxxiplxkzxpijflxkjnnlhhxhfxnkzihfnmqmklimlnzkhyhkfxpppzjqnllhhlmxmiqkizipqlnxpzyjnjhhiixhljzhipffpixnpqkzlmnhyfljlzjkfiyfpqqhhqzxmmqqqypzjhjxjpfkqkzimznhnqphxzhlnzpypljhzlzhynfnkxfylhflkmyhlpxlxqpjmznkzzlxlqqqhlzxqfqnnpfkylpmhfqqqyllllqkpjxfkjxqylqhyljnflnfljzpijmqpmqljqiyqqhpnnmpfifilpqnynlnfhippllimnlxlfpkxfiiqzyqxzphpxipmfpzmxzlmppnkmnpjjqjpxpyliqyylnjlfyklmjzlqqqqmfxqqizqpqzfqkqjxxfphpqxnnhpympxqlljkkplpzlylfqmnikzxnpxknqlykkyqikxfllqilfliylyjppqplkllzpyjnfzxhpnqxqppnpxkpkhqlllpyfpqihjkkmljqlplhiqikkhiqhflfmqlphpxpqzlmqmylmipzqqlyqijjxqyhqyqqqpjlypplmzhlqfhflpqkxhqqxqlqjfkxmjpqnhnqqkpilphmnnyiqznfhpkfmqilfzphllqfmlzmhqqkihpqmxpqhikqppjqhziqjixnqqpnynfkqkhjiqfjjqlnqlilljpfpqlzhqhqfqxmfqxlxlxqlqypkxnznlnqnmmjlpylimjqplfxflxpihlhxkpimifnmqjlnijmjppyykqjkqfyqmqhmqflqfnyfqzlhlxqhpzmhqxhyjqlpmjzykzqnzqhjllzyqqfxmqynzhlqxhkhnnqlxzqxqihykhiqhqqmqyqfypkkkkqlzxzpllmyqpzqhqllpmizifmpyyqzqypfplhlynnfppqnxlpxphzmfykjjiqlnmpzzxhpfmiqjxzhqlfmkfnzmqkfpfkillnliiyllmnnhxkmxpkpppihlzmzpnplfpppkjnyzqmkxqklmkqpfjlxqpflmqkkxqxxkfqmflqjifzfkkppyqxnyjypqnlxmmkqiflxqlpxhhiqfpqlkxfqijmjjljmhlzxxzfnpflhmhpqnpnlmnyqjfzpjimzqhfqmmkqjnqhhlpqiqppmzyplqflfyqmhzmxxilpyfxjqylqlfxpkllxphhykylzhnkpiipmmlqllfnqnkkpyxlnqknqxkpmlnhjkhylkllnnlpqkqxmlilllpixkjqxpppzkjqqpifqlqmfljlxyjyxqpkllljhflqfipjmpplljpzlpqhlklpixfpqqlqjplplzmqlypymxqypqkkimfqpyljkqjpixlpmpfqykkhjlplhifkppxzlminmlnlfpmqpzyfkzjxqllpkyqmhhhlpnllpnzqylxlqnfjlzpmpixyinpqnpqnkmqhqjxmhpplihpljkpqxqmlpjpylqqkpylqlnyjqlymjmlzyylzipiqxlkmhqkylxqyjlmlphfmjkxznqijynipqpkyqmlkzimzkqpkhkylhpmlmlhxnhmxpqpqmfmiqlpyhlzpqqqjhfnllhkypkzjkllmlfhqklkixlykzhzqzqkllpzikqfmqqlhpppjmqjpxkkqnmplxmlyxyhlplffxjlhqnxlfjpxkzzlpjjqhfpppzpynnlmfzhmmxpzlxpmkhqklfxjkfjqqqklyfixhhjqfhhxjnjplqllylqljplznlznixxzpizykqmmzpnlqjyhinimlkzjkqnpjylljhxmpxllyimfqxpxhpmmqxhnhykzyzxjpxmyqxkhpqhlylnxlkmlphphmqqzfliqqjjfkjqlqlyfhpnllxqlmqypplfplmjqjpzmzlqlqlmlnpmxxjfpkxqhpqxnhzfimflkyihhqklpflxlypjpfzpnpxxfphqxpfknfqxlqnmmmxlnqlqppxqjpyfppfyiqzlhqyfhqlyzjpmknlhqjfzzpmplqqpqkfflnnljqihlfpfpkqlmfnyfmkknqqnfxqhxkklxpnmnxyyhmjxkxlkyhpnylpnlmpxkjiipylipqllkmzlkqqxzkpxxnippyxpjxyxjxklyzhmjphhhzkqpnzkxnlzjpypmhflqjmypqxpypiqlqhqqqimyliflpmlikqxqqxyizijllklxxkzpyxkiqmlklkipjpnnlqlmfhhqlxlkfqhxxjzpillpypkplqxzmjnjjmipplpjjlqxlinzqlqkppnqilqnnhmkphiqpykmpnpplxkmlhjqzyxkqqliqnhxqqmxmlkiffnlhzqqmpqqhnnfpppqzppfklzqhlppkjqlihqxjqlkjzhymqfjqqphpnfpnxlymzkyyizllpqpnzipjqhlppfkpffqillppxnplkyqphqhfnlqfphznhphijjlplqnqqhqpjllzppjyypxynfxypqpjxnyzyhllkqynqiznppjhpqqjhqplqplxjxjjllzjxkxzxmnphjpqpxqqkjqmplpmflkfxzmhnqhqphqhpklpkhlzqlmqkhlmnzhmkjphpimhmpiiqpfhmfxnjzxjhzqyjnpnihlzlpiplpjmqpqfyfiykhxpxijyqxkphlfzlypqhflimnizxklnqypilnlphqnjzjlmhjhhhphmlqziplpyzxljzypppllljffhpjzyjqhqlhnmqzqipylmpppzmpxkqilxlypfppmhmkqqfxhxphyyhqfxnffplppjzpjiflfpimqzzpnpxzpfqqxkxhzllpmnniijpmxnjjjqfxillllikhinmhxmpnzqkqihxynxnmlkfyizpjylkjffjfmqjlplkklzpnlplkzppxhlpqzkqzilppfjxznmqqzmfkhqlmzfjmfqlfhjhjxzqjhmkxpjjhlzppqlllpjxlykxhphmpflqllqplyfhnipllzhqkqzhjphxhnxxjpqzxlqnyyyjkizhjxmmppyifpzqflkqzpzfkhkliijpqjmklzyyqxqhqlymppjjlfnqzlzfpmqinpxqmqpphxizmllzlynhkjpljhpjqjxipxkhxhfjxpnjhpfhqiqifikjzjpmpnipqhlmplfyflkqqlqqxzqmqfpzkxlhqxzlhmijznqplfhllqqjnkppmqkzxpqqylikxqllfjqylphqjzfjxkxyzjplqlfklkxlfhzqypfliqhpqklqlxnkilnmlfqhjnqpfkkiphlhxjhlhlyhjpfzimzyyqllxnjixjqpznyxlpkjjkzzixyyxhqmlippfmyikzynpkzixznnzyhhlkkhkpjqkxplqffpyfkjjmkhnpnyjjkqlhfqpqyjkizphyjlzzflxqnmxlqihqqjlyxnhyfjpqhxkmmhpxzpfpfhqkpqlllxxniqpmlqzflpppljmmiqqlpijfzpjxzlhpmpmzkhqlqlpqqqpfmqhqjjpljlfplmqlqqllmzlpppqpnnzhqphjfkfqqkqmpppfznhkyhlxxllhjkplzlqfyqmnpnmxxpkkqqyipqqjihihxihlqxlplxmphlmmijlfhhkqfjlhpklpmzzhkkllpyqmiiiqyymplyhifxfljqqlmpllpqfqjzqhynfxnykyqyqhqqlhqhlpzylhqnkxplxylfxjyxpqxhfqqmplhmqpzkyjjlqnjhjipkjjnfxxypzpfyflfjmpmmpxzfjqpxyynmpxznpiqqxflpmhxfplhpnppxqnlnmmyxxqilkinpfipjmfqlnpjhnlqpnzzppmlqpmxpmlkkpzzzlmknlhlimfnmllffzqmxzxynlxhmnjhynzlpphilxpklffllphqhlmqnkqmzilkxzzlkyppnlihmmfmhmnjkzpjipppjxjqfzfxxlqmlmxhpyllpyqmlyjmzqplynzliqxpjiykllimxnziljlqqjqllhqllhnxqljiphmqjzpmfnknyxmlqhqqpxxlpnflynnklkyplllmlzlxnilhmqjnhlqpjxqpiihhlzfjphlhimnzkqqzqqyjllqpmiqxikppqhhfqpmhpfzmkpipimkjflimmnmiqqmljpnzfjjknlqpqpkplzlhlijhjpnzxkhfzknqyklnjnlyjqpfhinhhjqklfiipqxqhzkziqkqqflyhihipqxxylyiqxnzynpqinpqnqpyzlqpjxkqzjfxpxmqqxhikljqkkjzihkzlfxppjxijnpkxnlyzffxpqiqxqnfyxqllnizizpqympkpjnjppyqlxqqlqljflqfzffxihxqlkllqqlqfkpjpxlfyzhpqlkmfqqkyynfpzlfplpppnpznizllzqqpllnqpjnqxnplkypxpyklzlfxflplqykqqhpqylfnyxpmmmzplqqhkllhhqmxqzmjjjxzkhpqkpxmnzkphxxkpphlkiklkyplqxfpkhxyxznljlimhnffhppzpjilniiljphlpmqqqhfpqkpffihkzqpyzppyzmliijqmlfpqlhyliqhlpjqhkzqzfxzlhxjllqxflzxyyphyzqqqlzxlhnqlphlxphhqfilnqhiqpkqjpimplllpillhfmfkhymhqnnihxzkniyzqklixinflknxyqhiyqzmzyzpjpilnqkpqfpqkixqpynnlhihklzmpkfqynzypllhmylpzjlypllpmkyzmpmnninqxpiizpxlxppkxyiijqllpjljnlmxnlxpppzifjqipqqmzxjlkqnllzpqlqxmpxpnjqqppqkqzjmhkkmfljihkfilpyjjzfqhzkjjqnlmfffnxhyzppfypyzlphnpqyqjllymphlqylkzlpflihplpzfpjxiifynfkzqxqqzqqfmmlkilfjzzkpkjkmlilljjfmjilpqlzjpxpiqzjhjijqzxlimyilhhfpmhfmkklpiqlqnfqpinpmfkpyjqjlxnhjlhzpmhxmjnhjlqkjpnmjnpizqnqyhpxfqkpnlxzzznklnqqqhpfjxnfzyqjyxqqlnpkpqqqppplxlzlqilympllqjzqfkpqfjfkmlxnillyjipfjpnqfpffhqpqxjmjlxqlmxmpyqkqkfliykqlmfjnqzppqnqnphmppzkpzqlfppmphlzqximfiizliqihmmfjkzfiyfpjnpqplhpyzlhllzfxnplkzzqliynqqfiifznkkfpllnqlpiihzpkzpxfyfyixhqijfknjykxmjlkqnzfqixmkihhhqyljlqpqiqlylllmqnhmiqzqqnzmykyphynpilljhyiyfnqlillmijpkfljnzlpyfykxlpkqihnqlmlnnipnhyplqzyjyqjqpzlymzlqfqfqqqjyzflllqzmmnlqqqypyxpxnjppfyhkxnzynppzzjfhllpihyppqjqpqiilkkpnixznipxzhmnlqjjylhyzxqijipnjllzxlyjqqxpfzlqznqmpinjyifyxkmqkhxlnqfphjklpfiylmhmljfmkqpnqpkjpxqzhlqpklqpnmnqmiljqpmzxqkjnxfmpzkpnpnpmzylqkjipljpmklkfjilpkmxnflhjhkjxxhhjkxpjlyfxilpffyppxliqzlfqkxzpmqkimmjhinppijfxyjqnlphhjznihzzkfyqkqmhihhjyhflhzfllklhkkqnylmjmmnhqyzjnilyflxkplmqznpnmmnlpxmlljlmqmzipfqpyzfyylijxnlyjihklnxqkjjjyymkyfjhqhjpilzzlkpfmpphllxfqmpfpqhhqkzfyzpxfyqhylqpkpflmhkxiqnlxmjnqlpnffqqnyhiqxhmhpllzqnpmppnhklyxmqizmhniqqhyklfqijqqzqqzzqpfkifkxipyklikzjxfxifnyxipzlyqyxkfmpqyynijkiyflmjypklphzpqyzlfqpxkfpmxqknkmkqnnqppnzkphznqqjkxzijjzkfpzkflfzipklfzqpzkyzjnmijkxkpyhqqmxkhlypfqyhfmqqmjizlqjyqykmlxzpfyhkpkmfxhkyzlnlllyzpqkhkxmllllxhxpkzlzqzznffjmkzpmxqyxqkyqfqzkfyznnjyfnzqliqllhyqpxqqfmnmpqjpizpnfiyxhnlqxlppixzqqjpxmnyyhlzziqxjlqplnjmzfkxnqzljmqjmhpfxzjhpnyplqpmynjyhzjynkmhqnfxqmnpzpjixmqqfkzqqhkhpxkmzphxjlphqlmmnxxkzlzpxqjkylnqymxkhzxiixhimjifjnjxqifjkpqkfxljifkppxjmjlnkzihqfijlnqxppppqzkqjlmjpmynpfxpxqqpffjjypkpyyqhhyjpfijnypiimqlxlpnnhxyllppqhihimjpykpjqnmmlnykqylzxyhjqlnxhlfiyxhnhximqzpxpxlmpfilyppilxlxpqnflqfpnklfpzhhxmkiklkqfxpnplzzqfiqljqpffqmznzyqlklpxiqlpnxhlxqimkkkkhqplzxkynlpylpjljxkqqqnylhjpffpixkjlzzqpnlxqpplfqpmpkzplzjxfnplhqfffnfyppliplnnynmyximzxpkmypypyppzklxkklfyxqpzlpzypkplkzzmnqpizlllzplfmjlnlxpfxfplyqililfykmlxiiiyhpnzyjpppkpkhxilhkmhhzpynzqpxkzlfqknxpmkmzqzizzpfqhqzympqqyixilyjqpppzzyqjkfmqxpqixxjjpmlqljnjlqjjhlqqlnjzinyixpqpyfqhfzkzqhyijzqlnyfpnzlnfjxhymmyqhlfzxqmmyqnzfmxjizqpqfxqmiknxqjpplqkkzqjllqnjpnzmfpyjkqhyjpljqjylpmjippjihqfmpxqffipzjlfljmyipplmjxhfpnhqlzqljlpjppnfnypqiflpkpqqxqqpxflnqyliyjyzjfplplyfxpnmhnplkpzxlnhlylpkyifpxzxkfkqqzqykhixhplxqqqjnnnkzxqjihyhmfkjfhpxqikxynixplnjlxpnyqplkijzympiqifxpxlpflhyxjfmnjmklnlymhkfpqyqfkmyjhhqifnkiziqqiqmfljypzlmfqqfpjyiljnpjjxfzzypqxllipkfljlhqqfjpqkpxphzhmnqnjpylxlqinyxfqkmimllzzhzfilyxhkqypkpykffqkylflllilizkpqpxqkfmqqmnpjlhpkiqiiiqqzjqljzqpfqfyqxzkqizplyliqxqyfnqpxqfhqppjxzjqilmhyqillxqqlqqfkzqllfpqlqmmxjpnmnxlpqxzjmplfflqiifjziyqqplpllqqykhpjnpznpjliqpmkplnqxmqqzqxyxhzlyjlkpqjznqkpjxfqlpyzqhmpzmfippplknplxxpxlmnlpjqkqmillllpfqqphipznfxpkpqyplpkmifqmhqxffljxyillkzhlppnxflhpyijxymilnpylymkqnyqkxfpxmlqlixynnipphppqqljzjipipinzyiyfjpjhkyxyplpiilpnykkkqjynllpqlfiyillnxpzhlnlypzjhjnflznnzzfqlfzlzphhnzzkhzhnxkqxqqlfknlqnqxypipipjklhmfxyqjmxfnqlpihyplhqkpylippqqqxfpnfiklkyhilpnnjlklnfppjlqzqpmhlzyqqymlynfzkqpfpfpfmlqjkpqqpxqmkhypzmfnhfhfnkjkyfkhjpjllminpxzjfzmimmlqppfqmqlmqlyymjzflzqlxpifqfmniqxhhfkpjlkxpyimnjpykllyxlmlmhxqqhzyzkplplpqnkxjhkqjlkpiilfnznjxhnpznpixhnlxqlpyqpizzqziqyxpinipjqqnkykjppmhlklynknmxqxqhpykihqymjizqyyfxkqkpzxzyqknlqnxhlixzlpkhpizfqqkmjlliqpqpqkpzkqmlykjhxhpplnhzkljnxmqylfkkkhppfmzyxpplkqlxqnqzfjiklpqllijjphyzyknqhflpxlppinnfqhmfxfmxqnqpkkklpfmfpqlqpxnkkiqqfmlqlnqxxjkplkzxpmmlijqlnqxmpqlkkylxkjifixhqjnzzjlhqlxjqqyhlmqlnpphxmhlqlmkpmiklfpqlmzzpqllnhynzzlpqizhhqmqlqqpnllllyzhqiyzpzzikzlffpppklzlflyqlfpiqqyimhlypqjmmppykmyzypznjpxfllllyzykpqyzkzqpknpknypjmhhlqilmkymllnyxkpqqjklpzlpmhiyyfkhjlxfllhqjknyljfxhpkmmnymmjymlpmjxlipqyxklkjzyqnlxpznqhpxnmhzpqfqjqpkyzmpplpxlqylnqqpiiilzkhhlpxqfzfqnlqiqpxjlxjhmpyxfqzipmylmfkynplzjyzkfjnlxkjpllmqhylpzliihmjhlnpqjqxzylkflpxqpfpmlylmnkyllymnqkxmqyxyizzplmpnklqipljnhqmzpkilhpjijfyfnhihyqkjzqmzznyfhipklhympyhzxynqiyynlllxpqkqqmkmnmiqyqylmqlfnpfnyzppxqnmxplhlhlqzzmyjfypnfhhyxqkfplxklxpplxpqpnplqkkzxijzjjpqmqjqmnqiilyixllzpxlyqjfmxplmnjqflhjpypphpmyqmxmfffpnxxxklxjjxmhmlqklxmnzfhpzijpflmlmhfilphlplfyqppkjzzpjmmpfihqyimpmyzmiiylixpfnyplliplqzlzimpklppqkzjfqqqpqnznqnillllplnxxlxnzxffhpqhxmlpqyjyjmihinpqnlnnkjlfpkmzlqpppqimkqfqhpxlplppzpylnzpfpqyknqqnnqkppiqzzpkipilffjpkfzqifkkjhmzfmpqqqfyjphmlhhnlnxqyplqhqjkmyfplfnlznxpkpqhmlpzlzkqxxmliqlpiqfhilhpkxynmliyifpxzlphllyfliylyqpzhxxqjzynqpfhpzkpzinljpmlfqfjzjnlqyqxhljpplmmplympllzzxqpnqllyhxllpxmpfpzmylkippqlhfjnijfpfzpqmhylqmqxqpfzmpxhxzylzjmlyjmkpfzmzqpinkqjiplqxziqqiqypmjpnqpjpfpjzxnmnlhjqllxkiiqxkmpphzfyhjxxpynmzinkixyqzqnqlzqqnyqlqlknzklkjfxmjhlkipnizlnqlpkxqjzpkkqyhpjqzylzfjjklylqlfjpyqqqjxjlhfpifpqpmqhxnppknfpfplyjqqyjhikplfpxjnnhkzkkqhlnkpflppjilhzyjqhpphipjqkqpphnplfnlikzpfnpqjpfpmpzlxmlqhpppjpqnzqippqxjmnjxynjimhhpqjxhkhkyxllkpnqfqynzpzqzzlmifkjxqnpymkfnfqznhyyqypqzlihmlzlpqjipjjfmxxxziljpmkxypipjnyfnzpiljzllnpnlppqzmiqqlnlnxhhlypxmpqnklqzpmkkxkjhkhxyinjfjmlqiylqyzxjlxpklkixxmifyqqklpzplqipfinhxplxpkyfhyizjlijpllqlpqkpqljzfllqjqmizlykhkppkjylllhxkpqqmmlpkmllxlmillkqmlpqqyikqqijjpzqzijqnzzlfzypxllhkxylqjhpkzmlpqqpqplyhpppinyjizxmxkyxmnpyqkqnmxpjppjlljijmfmhlzqjixppznfxjlhlfqnzlilhhqkjmqmjllhfnlmqfzlqqkpqpqyhimljnpmnqlxqfjllpkxyfixlkynhqqqiklmikfppfpjkxfjnlijljpzqflzmfjhhiifhfjfijknkhpypjinhnpyyqqqmqppxjlnhifqqlkqnqqikjkqxzlpqmqlnpxllihhkyyqphkpzpjhxpppijkqqyjxzqhmynqypyylllphlkppjzjhhylqqnypmpmpfpyqqnllkzjlplzfpqnlmhpqxnkfjlqqffyliljlnlilhmmllpjlhzyqyylipjmkzzpjppfllhqxlklxllmxqjqqmmknihkxfzkhqmpqiqnqlmnzqqiqlxxpnfyjiqxpqlfmlfqfilyypjlyjnpyninyplljyqyppiyzqplllljjnmppzqylllizynfhqhqfjmlzmlypkqlpxkpqhqqyjpljzqfhnjpqzhimqfxmhhljkhiqipklxlzlijqxfpyfmqzmflhkxhzyqqyqkqfyjllfjqzjzmlqkljzzqpifqilxnkqxxyqlnqpjnnnpflfpqlxilipjflzzpkqlmlxnyqkifqiyylqpfxknlpxhjpfjpxpyqillzlixqifxfzlynpnifhqnlfjfkqplqzlqqzyzpjllpzynfkfyzzppmkmnjxzlmlhkljjhplzqflmxqlpfmpkpxqllpkxxxllminlqkmjlzljxlnxqnjppypiqpkjlqjqhpkhkkmixllnnqxlpnixhxpkkqyqlpyniizqjpppyhyfymfqlpqfppixhpnlylnjjlnxqlqhyhpzpmmzxzqkqjmyklphlqqzkiqlxjyixqlkpnhnjqxppzjpqflnxnimlylkmlmpliyfklmpffqlnlnlllfpkqjpzpqymmznqzxzmyfknjpmhkxqnqkxilpyphhfqjllfxhnzzzqjiqqxllqfllfhqhpyxqkhykkxqmljqkhixllqfkfxlpmzikpjffzhxqlplqjpqjpmlzhzhnlzfyijyhppfiflppnpnmpqkmklxjymjnpxzqzqlpzpxkipxipzihkfnqypinfhphyqmjqljlzmhpjfzkiqkzpzxzihjknqylmhnihlxikqpmhplfknqplfnxxyfyjkqzhxnqppffnjymzxkyylkjzfhzylqnhkqhlkpqljpnfjiyppfpqpiipynqqyzqzfkzfpzjmxkzlfliplqqlnnqnljhjnpfmhifyfffpknjzkiylpmxxnllhxqlhhnlzmjhxllyqpzqlxphplzqpqqzphiiphnmmxinimlyknhlqkimlhqflxzqfiyjpimjzqknpqilzlpxzllppkqqqpzqlhppqxzlhjqhhfjjpfmqnqqkpfjjiynqjzlkqmfnxkqlqpqfpjppyqzqzhnqlkllxjlnqxlmkiyxmkjpfmmykpzfhhmplpmyzppnnqqiqmpkimipihplpnnqjjkznlmjzqzmnkqlqyjxmhllqqknkjlkilzlnmfkyqqqqkllpzkpinlynkxpynpflqknqnphyppyqqfqxnlkhzfxlhiynpppzimpqxqyzllpqxqknzpqppxhilnyzqqykpkyqkfkzjqppmpqlynqnxmmqpyqqqiqfnxppqlixnnlpxflzhqnziiqqlphllxxzjiimxqqjyqlhimliqxmpkqmlpllznlinlimkzljlqlmjkmipillqkhhzxqilxzqpyyjqxllqfpmqklmjqmqjijxhphlqkkqjqpnlqfxlpilyinkppjqmxpylljmnlzxpqlxzkzjmlzjxzyjkqxklmmlqpynhljfkpllljphkkpiilzxlnlpqxfqplzqzlxyplmkpinpqnlfyyillqkxiiypjhlqyqnyljxnxhknyljikkfjzhfxqkffqkznphjlznpnimpfjilxpmklqyqzlkpjmqpplyljqpyhzhyfliyfhpinkypqnilflhxjpmffnnqfiilnhlnpqhkhmkymnzzyympnplxpmlpyzxqmqkiphqlqfynjlppynjjjpzhplfimqhxnxmxfplkmlpnkqzkfpfjppyqlqxyyxlnqfxnxniihjpyzqnkxllfnzxpylpfqpyzqhqmizpnzzkmqpmlqznqqxfkxxmzmlpjkpxkfqqfqymfppmpqqphqnnlkzlyhxpzllhzqjlqzpzlmhkjikkhnilhhzmjhlxkmmnnjzqzkqlnpjpjxpxqmlpkpymkmqlxzpphllmzkqyfqqqyqfjllmnmhyxlqnpqyqqimqpnxillzyqmyjplilkjkpflyhmlqhqlmnlqqqpfhxpqpxlqqfnmjylkmzqpyzmypkxmzqjixiqpfylkhzynzyijyyjlxlqplxphhqmlmyqikqqqqlfkqzyyqljkmqijpzqfmpmfinflfijjyyqfpxizmffklqlkmppypyjmyphilnzqzjmiyjlfkqklnnklypjqkzlzzkyyqnhkppqyllqykqxyfjmpfyplijfnzpmqnkifnjlylfzqhfnllkzihyyqqqpnqkjmykkqlyqnlplyfflqqjjfnmkpllxyhyyzhkxpzlmlzhlfzpqjkkyjihlqpmpmliplhnlypzqmznzzhyfnpllqkjfpjkffnxzlznykqffhlpfpxmpxpipkmlllqqpfjplyiilkxlyllxqjpkilpflqlihxnzlnpqhpzqlyqmiyfqqhnlljpphjipymhqkqkxxnhpxpqlkqppxqqfiikphfqmpiqpkjnpnihzlqlinlqnpqqyplqxlikkxipnfqnlmhpjlfznyqlylmijfllnpppfqmmykkhipjnqykixqpylmzhqffffllxmizylhqfnmmqlllfzifzpfqqzpxkzykjlifimllyjnhlhxxqplmhiippnihlkjjxlylyiplmxxpqikllpjppxqlfplqmfzppxflhxfqphhxhyihmpzjilminkiqzzmphfiimpqmqhlmfjhqnpxhpnqkyppkyikllxljpizmpxynllzlnlqqmxqnjkqlqmlinfjqnjqimxpkpkjlnlhqyppjlpqmyqihxjzjqmqqmkyfipqqmyzhqqnijnlhzzqklpxilpfxlkjixjlmqzkjxqhkyzkppimzhlqlffzxlqpznplmqhlpnkjqkqxzfhqhkhhlkillqfyzinpilkqmnxfqqlhlhlqmhlzflllylphilzjqiqqfjmjyizqhllpkpihzmkxqqzfqxlxxxlpyyzkyjljpqxnxjkfmzxfpjklhqnkxqziqjpnllqxjkphnizliphqqlqqkpxplfjlliypnhnlhpixnfylilxqpmplpppnzqqifnpqpkhpqnkqpnflmqkzqmkixfplqjzmyxzpmhzqiqhxfzqnxyjpzlfllxqfypnllqmhipzfmqmmxlijllnlllmimqnjfmplhzxpflpzzkpkxqnnplqmjpqmpqjmyzkhmhkqlipqqllllqlpqpqqxpmlxqkhpppqqpqlqfyifhfipxlqpxpnfpqpmjxqzikqnqpkknypjxfinqnqqjziqqmhnphkpypqympmqzpxnzflimiplmkphmfpkzxhjznhzkjzjlmpzlfnjzqnqffihkhffhhljzzlijijfqxzjxlknpfjymyipklyqpjplpqlfzpyiljkylllhiynlxkfphikxinlpkjmkqjlpxnpknppnyzlhxfhqfhmxpqpkqzqnyqplqqlzhhfjxkqmpzmfzympmqxkqlqhzmlkpppjpkqixiqqliznkqklzpyyqqijpqmxzhnxmiynyllifmlfxlynpxlmhkmmqzmqlqzihpnpnhkzqqzlpjlijnmfihfnmilpnlmqzzjfflxzizpfnhykiflppzfhjmpjyxjppjlxplhqxihipmkqqzkipypqjflnzqypjfpxfjqlqhfppymkqkklilnnhjymzzplimqfkfjnplnlqymixlffmlxpfyjhpqyninqqpxxilqnkkpkkqxhplpkpmiyykzjzjypkzflkqxlxfppfpihpipfhxkphqqpxyjjnzxpqmynqyyfipmjhlljxxmhpqzypjlzzplqklqkqpypyqqlmmpxlllfhqfhpnnhhnjliqnljqmhpzxliizlljqnzhjfqnyipfpxnnkpkxhlklqilpxplflikqpqyxqhhpfplmmqpqlljikpypkqiqjphpqqqqhxylkqqipihfqmlnpnzqifxixiqpkppyplhnmpxfpypqpipzfxqhlzlxziqqmqpplymypjzflnmxzjlijlqqmqxizfzhpqzlhfnximiiljlqknipzpkqjinqzhzqqpynyfjxjxqmllmlqfjlpqnffpxfzmqqlknlfzqzxnhnlppymllqilzkzxllxzqqjmjmifqimmhqpqhfnjxhnpkplpjpxlkhhmlyjqxpppllmqmhllnqkjmzpyqxjznqhnlqhphxymyhhpnikpxfhxkxjkqjlpzyzzljxjfmyiffkjjqfqlimhxyplmhfmkyzpnimzlppxlpnxpqhljkmqiijfmllqpphxzqzmnjphqyqkpklzqpmknpplqkmkhkhixqmkqqyqppyqjlkqqmmjpxlkilkkzfjkpxzpxfzzfjjkkzpimmmlfmzyzlqqkylnmfmplqhypqqjpmippyhzxpfpxhyhhliqppxymxkzlyplmykxliklxjjxpljmiiqjzpknliqlxlkyqqypnynpffmppmfxlzphpflxxflhhqqlppqyzmixpflqqxhfyjhjhxqxlqzximxlqmlkxmppkqiqyxqjyjlpzqlnkljnijqxlmxlpqylnxkxqlzklxfnlqzyfpipmlmlilmfpkjzxqxlpjfqnpznjinpfkylxkqfpjpliiqlkpzpqqhhmhlqpxfpmnklfpxyfiphpfljmppmzipzmlpjfqzkzkqhlkllmfqyilhkkflqyklxqkjhhynmiphylqnxzifplhiqzhpjkymipzqjkplzqjqlqlzhnxqxiqzhkipljkqxqqxqllxjxihzjklinqiqyllxhilllnlxlpqkynqpkqqiqlihyfqipqpjiilnljhnimjkqlhqpnhkjmjzpffqhnnplhyjjzyylpyilpffhypnqxmxlllzxzzlyfzinqfqfqqzlpjzpjnplzpqqzyfqkqqyyhmypilmyxpqiyfmlzlllfjhkzqqnhplpklzylhyhlylznfljpkfxijjlkpxjplnqqlpfklkxqkfkhyhzqlxlqqykilhzlxpjlhpjxpkpkmqnllynjymnnxxzlxplhnmfzpqfhyqimpyjqxkfmqihlzplmjyqypqljfyyxnfpphlyjhhplpipnhxflqiqfilfqyqphjjyqqhjziiqqzhhliyffkfqnlqlykmqxjjpqlhnphqhifxkikjlxxnzjlfynmpzkqpilnqnqzzililxqjhzqnqlhjnhpmxlljzmnlqxijzqlfppqqqnylnizhlxknxiixqjklxqnpqqkxfjpzqqlqliphqmqyikfkykjjxznqqnkppizppnyfixyfpqklqzypfzjqpmnqkplyqqkmyxqpyqpkpzpymnhiyfnmppnpnxlxplqlnfzipyykhxnnmqlqqmnqqqnlzhiffzpmipflkmplhxymffppzhqlpmnjkzqizlhmzpjqjlzmiyqmqlmllhlzikinmflfliqxhlpmlnmlqnjnjplkxlyqljqykmmzkiyfljflllxyzfzyqjpnxjxiizpqzkxphjkqmqnljmnxxpflxlkpqinqyfzfnklpfpfipphhnyqylfqpnkfiifqxpyxpkmpzizxyppyqzqplykkkxpximiplhzllqqzqxhqilqpqxxmmiqhplnqpmzkpzmfkqpnnxpkqmmqqpillqyypjfknqqfmqfmnzpplpilfynlmmiqklyphqflklfmfqhnlzphplmlxknnlplmkqqlqqilllflqzlpiqlqiihzphkklzzlfnhflpmzlqlpfmlxiipmnqxqpipjmylphpqqilnplkylmqhqlhhiqnynjqjjihqkhqqqpjqnnlhpqqlmkhhhxflmpziklzqljyqlqkqhqxjqfkhimypqpnpllzqniqljlykllpkmhqhmyqjzxmqkzqyfyqkqplypljqyfyflzkpfnhjfqfpynilllqpfqyjnikyzhimfzfjnknmhxppimpljzkxpqpnmplykyfzlnqlmkhqphqyjpppxmnjzlnkfnlpnpkylzplpqqllnmqymxzznxxkknyjxnkfjnqjzyjilkphplmfixzzpkpizmnzllfpyhyjhnpjkqqyqhkqjqpzpmklhxqppzpjplzjqnhzqijfqzkknflzyklmqlfiqxlqzhmjiyjpzpqnmihhfhlznxilxmlklpnyliljqmhlpyyxqnfzjkyzznjlzfmhpxyjhnklpqpqplpmiyzyxppxzkljjylpjyxpxlqqqfjixlfylpkpjzqjkqhfffqpxxjxiqffnnqqlyhlkqxllfzqpfkxnmnlhpzqmziliqqqqmlpmqppipjfqxkfqphfqjqxpzhmmjlipqqfzhnyqfkplzpxpjqfkxmpmiqkpqyqlpnqjjqppyhhhfllnhpfjqjjiqlipkkfxnmlyzpmkfqnlqqlkipllihyxhlphfqlxfiplxqxhmhppklmiiplzmyqhkixqqnylkfpppkjkpkzynifymnplpljqphqipxxmifzlxfnqjxlnzxnfzpmpilpzznpfpfnynihhypqlhypjhqmqqpkxqpfyfqkhhpimfmjhjlpnqlkjpfpmfpnpxfnzpqplhppqinilhihfqppqhfqqjqqljlklfhjpqlhxyqlmqzqxhpjjylllnhyzppzmzflxllqxylzlllpzxfljhyjqxnxlxmyzlpnqjppqkhnypqjzljnnmhhpjqqjpylkhyyqlmjmjqflylflpfzynjhqzlpkzlllmqqfmyfyllzznzzhqyfqjhzfnmkqpkqqljhzxfxmlyimniqzqykfppzyxlqhxqqfnqyfykfllqpkzfzklfymqxmnqfxxzpfmppqfxixzijllhqqlfxffxlmklifjlqlqpfkypqfzxqyqlqxqllnihjxnpnhpkkpqnlzlxijjjpnqpmlfqixqlzjpfyqlflyplppjyhplzfpmqnlmqnmhlqnlhkjqfzmkmxqkjqqqhlqppimqpxypnpinhkpphmkmhjqqhpkfzpxqfnfqlilpqzlffxilxplmlmnkflpzjxppphnpxpqhjppxpyxxplfnzfljqiqpzjinpqhhhlfqlqxyjjpnylyzfmklmxiqnhhhhpypqqiihzqzliipqpjppjjyzljyjlpjmppmqhqfqjplzijiqlixlxnliqxllhlqnqfkhqqhjjxmklhlkqyizpllqlmhfjqxljqyjfflfziyzyylizkkpqixjxpxxjlhpfnlpippiqyhjjljjkpkklqlnqpihmjkylkymkpzpmnqznqhijhqhypfmpphqqxllljnfqzilxylknfhnhqxfppphylmppzinqjhypklkmnlxzifqphmilxjyflknyzimzkhfmqqjpyfqiqkqxqxzpnzhkppqpzphknnpppypjiklpikzjkqxzfmmqyqhqznyjqyfnmqpqzxppqlyjynqmynkpminyxkmhflzpjqlqpnlfqmlzikllkpxphlhxxqlppyppqqilllkkllnixqnkfpinlllhjpmxynkpmjhyzqkfyyplyxifzynpqjhpqfylhmhqlzknlqppmjpyfmklnnyxpliifqhlnmfhymzqqpypjyillxqqpxpkzpklpymxfkqnnnknnnqiilfnhiknlzlxnifphinqmpxqpmmxhjlzlmjpmhipynllpqqynjlmjfjjlznfznlnzqqzyhkmnyphmyziqlpzfqppzxxmylqnnkkzpnfmmpzkinzzzyppxmpliqimlqljlkqpfyiyfpqkpkiklqjqqliqhlnplqfyxfjnffynjkymnnfklqnzzfpiplyqplllikqfqpypypqqpphxkppjqpnkqplzpkpimhnpqhnpqypynlkqpjmjznfpjljhlxfiljlffllpnxippnpzxxqzfxnhzjlxpkmjzlfnlfpqhqppifzhlhlqxkpkpnppyfmpiqhpypphmqflhxlhkiqplfixqyznzjlxmizzznqnlqzppzmyyklzqjppiiqpkjnkfpizhxqlfyyhnzlnqximhxpjnfpynqyhjnqynkjjqqjmxlzqhllqpljnkplpfmzpzjxnfqqpqqhpyhpfpyfxqlxihlqnppqkqlklpxjjlpflfzkqqfmlniqjhknpxplinppyxzillxfpqkhhklyljffphnqxqjnqhqmpqjjnlzkpklqqzzkjzykxhplhyyijmqpiyfqhqmjphqnlpfkypikkkipyjpkplppzjnlqqnylxfyppfpkpnphniqqqzqjfjfjqlppfmzpzpyifpllpizyilzlxlklqxplxpfmlyfhmiizijjkpzlnqkppqkiklkpxqkhymzyhmlqklzlzllpqyhlpxjnmlqhpxhhihiqmzqhnnmmqlpffzjlqqililkmhqkfznjyqzhkjlnxlymyqjfpzxhqlljnljpqhqjfyhppynpppyqlhfjzkpmxllqjnyqjhzqyhkpxlqpzlmlmqpkillkzqqzpzqnjylxpzlhpiizllkqpfknqhxqikflpfxlyifzxlqphifnzplmjiqmjpllfqlpjppjhyhhhkpfplpxppfqkkzpixqnhlpjnmfxppiqqizpjymxxyyfqpqphjklklhpplnjzpznqikkhjjnpfxyqhmhnjmjpinlmqhfpiqjmnqpinizlkinhhipxzyxzmqzpyzkmmmfzmppnklpjipkjzzpiipjfkyqphyjykixqlkkpzzplqhklqqpnlflpljjfxlixjxmqqfppnnnqiippzhnqyqnfjqkppfmzzlhlqhflqlmhhmlqkphflilyppqqnqlifnqikfpllxzkfikpklxznnqljnkmpqplzzhhymhyqqjppmqlzhqzpqhmqpxlyfkpxlhnxflmhmpplizfiyxqzqmpijjhpfypmilxjhlqqqfqqmplyfmiyihjklpxnpllljpnxlmyfzflxqyppnhmpqikpnqipyzikmlkpniiqqznqkjfljfhklxphyqixmizqypqhmllkklffyppimkpqmhphqpzhhkxflxqlqiippflqqpppynpqxlkxhlmylnynqpynnlpmqyljlmjhpfqqlyjpyjqqfqmmqlyxxqqhxlipxlkxphlkqqpjqnfpyjpnimjlylmzyxpmpxqylmiqypmnkpkmxhzfqlnmffyqqklzfjpqpxlykxfnzilpilpfikphqhjznikliqkylffyqlpjlqxfyphkqkphnyjhkhxnnhlzyjpqmqqpqllxkiypqfilkmphmxqpjzppmkpknplxqjhnqilhlkfjjjlypjqyjhhfxihfpjqknhllhyjjyhjixyknppxykflmkmhpkxykjkxkqlqxhjqqhpnplqkqklzjlyiflxfykfqyhkfljlkkkzpplqphjlllqzqnnqmnjknjqqhxiqqyjqzllymljfmhpnzypmmqkkllkyhllijjlklnllqnnhllxzxxiylljqllyqlnxyflijplljpjizxhizlxhhnqnmhxiiyhnnnlqifmpifpfhmjpkpzpqyhllxqxyqqljlzlhyzmypkpfnjjpiqijyqqyppylfmxllimmlphqqixjkmqiqmjjnlljpzfkjhqyhljhmlnfmiljlqhqlxzfqqyylpllizmfxyqqpqippkqqplqpqhlhhnhliihpjpqfqlpjjppqklymjyzqnpfzkylmhzmnqxzyqnxkhlxkxxkyjqqiqjihmkpqkxpnlnqljpifqllnqhqmyjhqqfnfxkmkzxpqpnkjnyyxqplpqzmlmplhyfjjpxlkkyfxfjlnmynzhxhixlizqylypqxjhppfmifpmpqphqpxxxiihhmyppzyxxhqmjkknlizpxxnyhkqlmyllnnxifpkhqhmlnfhjyqnlnylmqphpqlkpnmflhiyfljyknxjqlfmnkqflinxqpphihiniqkpfpjmqxqliilpyznxhlznqxnxflhqpfmpkqnliphqyyphzihmymipjzzqlzpyqilnjmizmzlipxzqqpmmkijlqlqjqhnimhfhynfzzhlplxhlllplhpypjjhhnxxnyqqxzipjqmznlzninflmipfkqqynflpqjplllnxlqqqjmiqlikfmqilyliqpqkqzjplyymlixhnlzpplkffjzmhllnkqlillpqllqqqfknhpqzxjqlflzlpzfzzpqihylhlpypzzylpqymqqnpfqqipiznlmhnmhkillllkqxxfqqqppqifiqlqkmqiqmmylnfqmziqiplqppxjqizlyhhqniflqilpfmfqmyxhpmxljilqfpnpikiqqilklqillxkfjllijyjjxpqzzpnmlzpnjmpxkxlfkllplkfmmxhxkfliijjhqhpnhxxhmxhqzmmmflqizzpxqyyznxynzpqllljzzlqpmlzkplxmnnnzkpnqqqlqlhkqyphmlyyljzyixkqqpjfzjxqxzliylyfiqqlxyqzpplqppjpklffxqhiplkixxkpqqpkhlpyzqhyxlyzymfixzfxlpnlqfhfpylqjmqixpmzqmzlinxhjlflxmmypqinmqlqnlppnjlppqfnjxhilphmlqxjkqlyjnqkqhqxipkfkkppzhpffjxhqlpnpxyxqqplqhymlyphqkiylqpflppmkqmkxypxpzfhpllphhpqxfpyqznnmlyfhplyfpjzzqmjxmxllfkqfkqqkyqpkzqzyixnhhnqnqmxnlzflqjnhkphhzkhqqpkpqpqpfpmpzlplyqlxfpmplqlzqijyjnjfpkfjimjhqnjxlifqmmnlpzizhkxjkqmfkhlpqqhinyqnzmjzqffmfplpxqlfqqiimqmimlymqyqpmmplqpfqqlmpnkxmkpyihiljqqqiyinjkqpypqnlzjnypqlixqzqiyqpqllmifzpllyqklpmqlqylinzjzyfxyiqpipqiknkqllzmqkpqpqmpphqppiqmihlnllhpnilqqkfhpjffnnhkpqmqlmpjqqkkflpjhqjmkqjifxnxnpjyjmqqjjpphpzjppnhlxypqppxmpjpzxlpjhjplkhikmpfpmxjhfiqjqqmpjhpkkqxpzplpzjqppyjkzyqnzhpqnkjjqzxpxpqpqijnfqyxnlkhlqkkzpnnpmqkimfhphnnxjnimpqpppiqnlhqpfhlxpnpkzqykniikppxhxnhmfmfqhnnqljfhqipymqhifyknpikmnfpmppxpmyypxqmyqpnkzxpimqlxqqplpzxqlpjpyfpzyxzqlllnmpknlnhpnlhjhpmkyhpnppkzphipkkmjxlxppfnzxjyiqpnimpzpfmjlqkimhlhzkmijjxhkmhhqmxkfxqqxffpjilzmxypllqnnlylhzkmnillqklyhqfpfiihlxqzqqnyjjykppfnzmiphqkqyqlqpnifjhqlppipmljqkykxlqljqpmpqlkqqnppikymqxplilliipkqqhxjlmzqplzjjnniflqpxnilpmpmfzqiqpyppjlymymqqiklnqkxqlimpfpylmmzjnypiqylmzjjyqqlzqlmqzlxqkjlmxlmpxxizmlxfkyipppfqpynqnkpkmzllkyqhpfqnlmzxnpjfyfifminlpmzfqzzfljfxqiniplqifyfkzqlfkilyjxfpnlhiqyhmjfflkhiqmlqfjyflqppxplyljppkpljqhznxlhmnjmyfqimypjjkkzqnzpypxmzxpqqqjlmzfzlqljzkjhlhlmzyppihnqxjpqnpppqlznhkhlnjfjyplhljlllhlkpjqylpnlfqlphpnynhzqmhyfxjqzizxkxzflqfmyjqplfmpqyylkqkqnzxqzpqifyqqhzjfjqjjppmxqmjyhyjknqpfjixpkxpijzqlyhppkjyfpqqlnizplikflpklhmziqipzplhjzlnhjfqyylffnplqqpkyjlpfkqqphxxppzpqxkjqliylkmnplxznljqfhmliflmlxhmxhqyxpyzxlixpxxqpqlzpnhynikpzqypfixklhqpzpffmpiyqipjyyfxhifxfixqkkllllmqyfjmxpqmzpkjmfphmpqllqyhyxhkmfympqlhjzhppnkxkpqmpqplmzhnqllylpljqymmiqhqnjpqqmfqpiyxlfzqkyjlikjjqijfpklmmlpmlflmllkqiiljyfffkzpmijzxhlyklpqxzqqhlkkmnljpflifxhlqiljnnpqjqqfhlllxlmyxjjqjnzpqylnpqymllnfzlqnyphlypzpmzzfqjfpxlznzqqlhhklfxpqjxyqlplqpmxmihfnilymzpqjpqiqzzjjfipypmzfxplhkzplfqzxfypfzmzlxyxffzjppkpklymfppjyiqqpxzjqjqllmyknqiykfnmqlyzqmpzzjfkmljxmxmpqlpqlzzqkjqqjjphjhlmflfjlnlkmpqhykpkfiiyllpkqypflzpnphpizklqikhflqpjmfxjpyxkkkzlxqlpnhphpymkfqffkqpqyqpmlylfflxlkxypqmpphkkjxqklknyznllzlllhlkkfznpzlfhmmnqqjlmhlmzlnpzkzjhmlzikjnznqzjiqlzzpmqypnxpyhllkfijpqfxzxkxnkqxnzllxnnpjqjjmkqfypyfhlpknqlxpxphyqppyqxjlqqpfhklxqllhpxljzqnfpzlpynxziypzkllllmhyjpnqfqqfhpzzinynyylpklqhlmznxyphpnqfjplqmxpypqpllllxlfppmkqqnplzzyhjqxlzpnplymymlmyzzijzxqjjlfzjmqzlpqkmhlnkpijmlillhnppzzkqhqixlhxmyzxinxmpnpplzxxkzlymflqkqikqnpixfikiqizppnpyzphfflhyzlkfzinqllxphzfhjmjizpmfliifmnlxjkxlxqpmphxznilxplpqhnqljjhhknqzkqjlzqlmyynlizjljyfxymlffmzxklfimxppqqnqifyxnqqmlifllilyqpxqmqmlilqhhpqqznpymjmfnmzmlhllifqpqqqppkqhlpzjkjljlyyymfljpynhjnllyyfpmypqnmplnhhhqqmfijfzlijmqllipmylyqlfxjyzxzpqfjlmpyylqjilykqkpknnikjjlqxhpmpqnmzlpilhzzpnpxjnqqhzzynjhplyjyzmzlyxpkxqkllyfhzxplkxkfppkzqxnpizlqxmnmkljflykxhnhxqpknizhnpynyjilnfnplipmnmnfhqkhqjmzxqpppjkxmjiljnnmfhpqkqqljkimyhqqmlzlhzxqzqxzxqpplxkzxqhqnjlqjlyyyjlqixqyhjkihpyqjjkxxqknqqpypyqhlhzfmllmjxmlhnlhjpyxhhpyqzpmxqmmqkpiimppinhpznqixqpyhpxhlpxypqypffxxmplifpyqxixfxqqnxpphzmhfjzjhqkmqimkpyihhhzkqxyffxhhykllhpqxifkllhlkhhqpiklyhxlkpkppifmlnliiqqqlfpxpxqpkqlpzqxjqqnqjyymnnzfqjlmllnxzyplxqqmpljijhqqhhkjqklxmpylpyzlfqhkikqfmplyqqlhimflxplpmjmynkpplpqinlyqyiqqkpzlnpzqjjhpqqxjnjqplyzppxhfxxlffpjlpkiqmnpxqnnyzhjpqliqlhnhzippqiimyipyjlqfjhqlhpmjlqpqjzlynqhqpmpilflizmiilqymljpyfpqplfmpjqikplhllqzqjqlfxmhqmlpyqxznpmlxlxpnkniizhifhyjxkmlkqlqxyxqkzhlqlfxpkjpphqhxqyhpzypkpxqflmklqhjijyqipmnqpflplphplihflpqnhfplppfqkypilnplyqlmlnzzxzfkmmiqhmqqqlxzylkllqnfqnxjppzfihzhyxiyqxjnppllzjpkqqphpzypkzhnlhijkmqiizzqiljqqfjhhnnzqkqlkmhqlymlhpfixlphpqpplylxjmmmynnyypjyfifqixpqxjizqlqlipnqzlqlpjhlpllixpxiqlyxpqnzylhjqqzjjikzhymxqfiihpppzlmppiknpmllizfhmlzyzlphflppqlnnzjkzinhxjmilljknjmpxlqpnnfmjpimjfpqkpzmzhlkninypxiqflqlmqjkmkpllphlpnnmkfjzjyhfqlpjnyllpjpqxlhqpnlzlfimpfqpippnpnpmlpzlyfmpimxjqiklmiqmihlfmkkxmlqpqnjlnnzjhkzzqxzpnpjmqjqqlxnmqlkpkinpzllfmmqypnlxxqlhpylnpflpqhfqhhnpzfnzkjypjhlikmxkqzlnhfxfljpfkjzmkmplpmzqxnlzqyxnnfmjpxfikplfppikyyyyqkpikjfnxlmiqphjlkyqmpnqqhpnqnplihfiqijzzjfpmipkyyzizlyqiplqlnizpqhiknqixphzppqnnzpqlijflxfyhypqqnlijylxqpljpfyqhqqiykjllpkxlpxxlpliqlpqknjfhymqhpmqlnxyxkfqpqklqpkqzjqljihpqpypnqjqmxpzjhlpzfzlmkpqljmzihfkixfyzyjllnhklqpkikfhqjkpplklmjmqlmhhpqmyhklnnnnqjlmpfplzjpnlpmxxhqnnzmqhhikflyyzlxkqzplxpnkkmkzqpqifippjllzmqykqqlhniqhllipmnmfmymkpkxzimpfjhnkmjhpjnpffzxjyzjxixzpjkxylpppfmlxqjqlzilpmqniqmmlxqijfiifxzxmzhmpxnjqpzfzkjhqfjnnfqqizzqxilhplihxlyflpflyqknkqpkhkfjqqpmlpzfqyxlnnqiqpqqqzqxpiifpyzikyzhnjmlzjhznzlmjpplyqknxnqqhflhplnfhqkkkpjfxlmpflqlxpxkjlzxknfnzyhpphlljlppqnfnpljfhnjqxqfxjzyxxqmlhfqzmyqfzxilpylzpypqpiqqyplnzzkqkxpxiqqzmmqzfzlmnlqzkqlflqjkqfyjjphpyxzlmphxxhnnlmqyqljkqqkqhlfiykpxzlfhqfyfiklnpqplimznpnqqjmpjlpqyyqimmiyyqqqppjlijxxmqjnyklhqpqpxqhlqklhiilhznpjmplljxhjpzillpjnmhpjnjnppxzpfyqnhkqmmfxqjfkfpfzhllpzyxliqqjmlhlppnzykphzkmzpfjpjjnizyfnfplinlhhipkkhmpxllhynmfiffxljizlhilyziyyqfmqfjqhlpmlxpykjqljpqxnlyfkpjilllqmjhzjxiffklphhhhhphmqplxpxqyijipilijnlfxiqnqmkhnhpklqzxihqjmqhlppfnnqfjnixzxplqkzlmkpqzfqnipnkfqnkpkqyqlqxzlpilmzxxqzlqihnlqjfmjpxyypjhkqjqililqhxpqkqijqplmkkyfiklkxzqpqllnlpqphlhkqymlklfnjkkpmflinmjxqinzpihpjmmppqhmykxlnqhlqlyqfnqjlqqnpnlqlpjkhqqmilmjlmqqklmjzmnjppnqmqxjiphqlplpxyililfzzfqpnplzxnffhpllqlilpjlqyiqjfyxnqhyxlzfnlknlkfhppzihkzfyqqhlyjjllzijxnhlinpmnqqphzpffhkmlyjkmylkxhlhqxxpyyqlqyjfljypxnqzhlpmjlyymqiphxqfhfmqyilxlllzqhjlpkmiimqllxpkfnqkiqynxlqixqqyhzfkplfplqpqqxqqjyjqpplmqqmfqlzqlxiiqyypxkqqilpfppkpkljilymiyxhylqlqfifpikpjqppnnpmpfjplhqixjppxzllnqipnpfiylqjmmkhihlplqqfqppzmqqhmiplyjkyhnlxnlmpmflnqzpxljyqlkpxqilzmphfjnxqqlymlhiikqjjlplpnmlqqqhpmkjzhqpflxxlnllhimxpqlkqfljqffjkpllyyqphhyqmjkqllikxxzjzlfnxnpqknjqljqykfpqympkmfzqpifqpqlykzyklqyinqpllpifknimknfkzfjkhkjqpjmkplippfmhyynyhqkhmpkxliphzpxfmlkijfhnplhjfpkfiqyijhylxxfnqmzpqjlzjnljnzlillkqqnqxhjfyyfnyqmzqpyflylqlqkfhqphpypqmizkfjphfypykfnzymmxpxqzmpzhjyjjjnfzlhmzqmnyipfjkqzyqjnjkqpkzqnhplxpxflypiqzppqqppypqmxqppfkmijmipjqlqllqqlzimlzlilipjfzlfhnnhmyqjkqfmpflhlxipmnmlpnjypiizqnmknpyjmnpzpiflnjlknyiiykxjpylmqqyyqlqpijjiyimmplnjinjypkkmlnlnnpxhplipphzqqqpkhfhqnykqqhqllyjnhzipipfnpxmjmqlpxpjqhnfmmhkjpilpijjhhpxiphnnnqzjzhfxqzjzjhjfpzlylqjyqpyknxmmnpqmfnjkyqxljkqqyqiqllqkqmylykykkpnnzqkppjjlhkzmfjqfihjmqxjhhjzzpmikxzipqylylnlmhzpjmiznkllnhnnkjxzfhlmqjqnphipqnfknnyklpiqkyfxmilfilpplfjqnjqjfilhzqjqpzplqnpxnlqqznkyqpmpijypjnhkjllnpxmjnpmnjkypzfphllpkhmxllmpqzmkljynzppjzqpklifjyiqqhjqlzmlpjkqpfkilzqliyizijqilplzikmlfqxqqkxljxpmmjhilmzxplhhnpfklphymjyfqqqppmmxqlxmxnmznlkqynmljlppnkxnlzlqihqhpqfkimqqlnplqhykknxlpqpynypxxqlyllfjpzqhklzlkjkykfmpxkjjnyfilkqlpxjzljhlliliyqkjjjnzfxxlljhqihfflykfypjnkmmmfxpqjzhmmjqjlphfjlnlppzzkfyxpplnnmlqnxflqpnyiyfjmplfqzxxplzfnpzqxhjjnqikxqlnqmplylqjhfphlxlmmkplmflpqkzffqlflqlzfypplnmlzlyhpykmynmhlxzlkpkqpjqxixppiqpkqfpmnlhllnxjyniqyljlxlxmlyhyhyxfkyzlxzqfqfyhxpqkfjymlfkqnlhfyiyfmlljyiiqqkzpnfhpknynqkzmjmqkqnkifxxifkziimljplkmzpqiyjjxkqfqqqxhlkzqqkzzqjzlmhpmlipiknzxjkxpjxqixqqnkiinifylnpxpqqnhqpnpnkjqhpqlzknyhxfifjxjlflnllqfmqjllflkhzzfyxpjxmklpkmphympkjlynfffikylznmnpjpqzjnxpiqhfnppxhqmppqpfhqzzpimqpilmqmfzhljhhxlmknpnizqylpmmpqkiqqxmnjykypkfhmizfplplpjmlqymmkliqxqznmylzyyhinmmkflninqjqplziljiyjpxqklqnnllxkkzkzmmpiyqiilxjmpiqmzhjmjmznfkmfjmqzpqfmppyypkkklqlxlkmlfjzzfpxqxxmqfkfxfjilpnfpqqiynqjkyqkhqqqxfklixyplkilxfqxxipyxyfqqpmplxkkxxlymiqnpqmqzxlzmkyqmzykiqlipiznpjijmqljfflyqnzxkyxfjzxkmzyfqfpqlklyqnxnpiyfnljfhklpxpnizjnmpqqjnpzllzplqknfpkqnqnfqqkpzqnpffllmiikmlqllpppymyylijpnnfmpqklippkxklqqffqlfpllijkqyyhippnzxyyqphhqqlykkfifzmzjfqqhylippfpnkkihhkzkhqhkqllhppqnjlhmnqyinkkmyihymmzkikfflzlzknkplxqhlqjilqlmzllzifpikpzkfknmkppihqmimqllzykhpxqklxmxfpnhilnlfpfllmqjhxhkxylqmljyykzpippjpnlzqllfxxhhlqqhlqkqpzzpyjzzyqlllzqzjixxlpplyqxjykpizxppqmhnpkzqkqqxjmymkqnzfilfqfipymqniqkhkiiixfpfykphqzzppjnjyphqkfnhhyqmjfhpqlpnmjqqljqyfpzhffylxhkxnzfklqlnqqhqqxihpjljyzfnynqfqlklzyyppkqjjxlpylnmpzxplhkppplhqlhzkixqlfxlnifnixnjkippmpzqxzxyzhhppmnqipypmfynllnlkplmpilpmxppmlhmkjpmjyqqhijiqknqpziqlmihlylximhlzkhflpnqpjqzymiippnjkhlpliqpqjkmnziqxjkpmlzlpiiyqqjlpxhqppiqkxnmkfplnqhjlmnphpqifzjlpyzlyzqyllijqmnkxpmxmmymzpplkjhnnlmknmqjhjqpqhlzllpkypnfqpzfqlhjlpymiqimkqpfzmkmjlpqhqyqqixzxxjnmppzzxizmqzpzlplqppkmynfzylllpjphfylkqqkjnjxqxnzqxpjimzmmhflkhnfllpzpqfphzqpiimymjpqlzqpihmxqjifzlypmlplnnplhqqzpmmzyljlqykllhfmlzmmpzypkikmkkkqlfhlykyzknqflylimzxlmnhkfqqqyyzknmkplifilpzpqlzlllkhpfnyqjzkhjpjzxnjiqlnhpqxhfjqxjqhhqfpzlqnlqqixxqpmihinlpyhlimpfqlzlpxzzplmljhqpplhhpyhnnpqqplnppmnpxqiznnpxhpplzzyqpqlpzhfxhlkqjpnhqifpzkhqmmiflqmpqihhqfjqimflizpkyqhqqlpmyippfjllqlixhijlpiqypllhjzkmhpkzpxiqmkmiljnzqqppnlxxjzjlpfpxpfxpfhljnqpznxlqlmxqlijhqmljjqxxlpqifliqykmlkxpymppmkpppmkpipllphzqyqzyyjxpqlqjzpqzklfpiqlzqjjmlyqzxppppljkllhjmqplnnqipzqqkpxllfqhxlyhfkpxzixpfknzkmlqmipyplxxynffypjxhpqqiiklhzkypinnzhhqxzqppxxlnzmqqlqqlllnqpljlkxfpfppjfhklmpnlxyqfmpxppqiqplhiyknjjqijlzhyypqynhxiqlhfxfknflqqqfqizppymkfzlxxlqfhhjjfhjmlmikqnljiiqnfnllimpllnplpqmnliqihnqipyxxplnhzfqqzplfhyhqypppnqyqnqimyjplpzhjyqnqznpplzqpipqiqqkqhqqpillpxlpfjqjpqllxxzlifqkqjkihqkipijqqxqfjkmxnfpypqyxlnkxlllmpklfhxyiliiqhlnmjkpplnnfqqqmjhznpqmppknqxqjlklqminizmllzhnlyhqhphqxpqpflphyjlkiyphzkflyqplflkjykpmzzphqnqhxjilkyfjklnhpzpinpffqpfzfkkyqnplkxizlmfmkqixifkypfkipnpqxqmhmqjyhxpxzmpkxppqzxyphpkphphqjpxpnqmfpjilhxihqxipjllkxlqlmipxkmlhiqzlkjnzzjllziijjlyjzpmklhphmlzziynqnlqpfnikkplnxmnffpljjyhpqppnkmpplqpzmqpqhjkmplhlzzypqiqzphmnlklqjfflhlqqyqmkhihjxkjyfjqqmflpzqmpllqxhmqhnmxzjknnhlyqizqpyzhlmlnlxmyzpllzqqqhkzzzlqlqxpmqqihjyzxxjkillfnflzxmzylxnpmkfffyxmljqlhmhilkpzxffimkqfzpfjqnlifpnfpppplilyqlplkjkhkxlqnmlikxlnpmnxlzhxyikjyfppfkflfipimpipknflnyxpyqmipmqqqkljjzplnnfnmzkjfhxjjlpnjplzyzqmqjlqjxpzipllkyqqkiikkjxhzljijfnnpymxlyqpllplyhlhhjqkfpklpqqzmfmyjymppmxnnjpnfzlfjqiljlhqhnlqyjnlxqljpynhkjyipqixlqxljkyjlpqxhiqpkplylximllffhlhqqzfilnnxiqjplxliqnpqxzllpyklpynkimpqpmqzqyflqlhzkqpxpkzffiiylpqppqppqxfpmppxfxffxlppqjqqqqqxmnlqnqfmllqpqxppmipklpqqyfplyjikinhxjmjjxphqihfqqjzzyipklfpliikqlmqylxqqqfqqlfjnffylfyhmhxqllkfpnxlqpplyqylqkfihpqqillkyxhxlqiyhllpnqyqxpfqqmhfzkyyjxjmpiqqlylpqlmqhqflijmnqzxiympzmlxffmpqlfqqpjfxmpypympyplpjlhnmyffzqpniqqijlqyiljqhnzjkyzylfinllpqhnhqxfpyflmfqfxyhpkhnzpfpqxpkqjkxnihqllpljpmffkfmkpixxhpmqmzffzklljnymxjfllpjqqzfpliylqilfxqfimyklkhmkkjljxxlqkyznpmjfkpllqliqnmqiqlliqpypphzqjjhykzipnqppnlkimfqqxhnpkyhqqixfqkxizfihfypyniqfypilzilxjixhpipfzfpxmljikppmpjppzqhpxnplqqmljmqllfnyjlpyhxqkjqppnpqzqlylzjiimzpppkqqpixjjmmlhlqzxfpjhqqklnyhzqxmjjpjqxkfflkflqkhxmlixxxqphxykfzkpyqmplhhllnzpqilnyipnxnxjnzppjlilzkpxxpqnphjipfqzkzhmqnfpxpqfnjpzffqpnkxqzlqilfpyhjilfjhlnklpxqzqyyipjifhijzpjkjmqlppkypzkfkkjqljiplmfqkzqnnjklinfjkknlllqqhyzilkpqlqqlyxjlphpmpmxyfymimxqqxpnxhqqxklypqinhkjpzjzxnhpxiqkyhxxxiikyqklpjkjhqpqnppjlffzpjjiyihpqpzxpfjlklyxnyknqlkpyqhqhpmhlphillqjxqlnknfnxzpnhplfillnpxpznpjqpqmpmjnlpmnznynikyjlqmnnxkqxmilzfmiqlqiiyijphizxmppxlkmpmhnqmmilhlxqlpfmqpmpimqpxfnlqnqlnpjlqlqqhqfppyppfpyklxlzphmfnnkkkkhllilpfnnlylzpjplpyhznklfyqmzqfnzqqlmlpmzjikjkinpppzlmmlllqqpzqlmjfmjjjifnqqipxpfzjqqmlkzxppqpxjyxnifjllnpxppllpqikpnhkppkpllpxlpklqyfzlxinphyjpfjlmkqpkqqxqkxqxzqqpjkkimqmniniqpjppzlqqnkhxhfljmnpiqxzhplkpphlhpqiqzihlkxqqzinhxjpmznxifjzxkhlnyjfzppxhhjqlylipkqhlipzfihkklnfqhxjkpqflmphfpxhnlxmizfkqqkhzkzxljnljyllmpqxlpylfqpiqifxknfnflpmmiphhyqlxpqpyyyhfpmqhzmqllkjmkziqlilqpmizpyyhzxnixlzqqqlmnkpkpnqfzfjzmpxfpqfjmlhmnhzyxqpzlqqhihhqkpqjxllxmlphhqqnfmfypqlyimxphhjnfqnxjxxjmiipllnfzjppqhkqflhlpnpzznlyiqnkhypxqxpqnlnnxpkypyfpiymknifnqixhnqfjppqklqilpppzpjfljllnlphfppqqifyjzphljqjyfhymxykqzyyljqzqhxjmpppzkzxmpzipipqlnllllkfzpqqqqpqhzqxiqffxkqkqkqlkfmzlfmmqkpqhlyfzjnhppnfzlqqxxplqyqjmiplplixixhmpqiqzkqjfllllzhqfkkmpnhxplkkpffmxppqplynzyxpqpplnfkjljqmqzlpqzqqnkimihizjipqlplfhzfzjjqnxqlmnqfqnqizzfijkkmxzymlinkjqkinqkqpmzmxjxlqxhpympjmnyqplphhlkppqmnmjqpjyqkpxfjhifpqfplffjjqqjqyilqlnzlyjmhlzkmylllqimimiplljlqljqkmjfzmnqjiilzjpxzhjzpmmnqpliflpjzypjipkxfkpnnzpzljpxflkpipmqhzzxxhkpkzzljizhmniyxphnqnlqpkmlzhhzihiqnpinhjpppjyphzkilyjxnnlmmppyxiikpmpzniqihlhqnfhlkzmyjyljlziyzlkmlypfpnzjqfhimypmxqlilmpqzpppkyppnxlnqpjzlxyiyqjjhffkpfppymhppyxqqxnxpflpnhiizyifqnqmqlpxzpzpilklzilphzxflpyinfqzxiipqnqiqzpyfixjplpppzpijpmqxzklzkzfpfmykylyphphypyqqqhixnppzyypjqnqjlkkjkqzqknhjpqnlijllqiykjjjlkilxfkpixpxnyqxpqxlkmkllkmzyhlqiiqjkihkhfflqhqzpiikmhzninkjqfjjqnxjqplpmfjqmlnhpxijzpqnqhlllfzpylfjklxkhxflpmmhljlklpllplxfhhijiqyjjhkyihymyyljxyxjzqlqnklmpjlynxzjqzjijqynhhilxhqkplfqkixkpppqizllzimxkpfqpmqiqyplmnjpnnjqzyfjzilqliipqnxzqnhqmxpillqmplkziqhplflfpzpqzqqqljqpyyqfhqpkqpmljpqfphzljhyjykqphpyhhkxyhpyqnxiplnpnmkympfpmziinppzlqxlhqqflfxlkpqqhfpfhllnllkjpyjyljqijmmhzjqpyllnzqzxizilqhqqlxkizjliqpmnlzlqljppyffqpqfziznypppplqyxpznipxkkpiqjlmpizjlmlkqpiqpzpmlqjllnxqnpiyykfpfnlkfpjlilxfimjykyqxyhqhmpxqpxqfyzlqnlkfmklzlpqmnpmmzqxxjplljliylnkklfkfyfnlljxlpfqkqpqnpqimjhqimqqxqljmllxffqpxzkypqlxphhjflnfkpfxjpfjqlppynfjxffnqkiqfpimipnqnjlfpplnfyiqqfqylplppixjfjfppkhppkpkqkpipmyljqxqpqpqhxlymmqfhnfpqpjpqkmfkikknpqxqpixpnqqqnhnyzzmnqllppzlhqkxpppllqzpphqjqkfjyhhjfkkmllpzhnxmnhpqxlknpixmpllkhlzqxjpqjjnjiqpyjhfkpfkmnjqlkqpxpmfpzpnlnlpixkxpqihmpzxlkqpimxqhqphzzmfhpmypmikyzqipyppqjiykmjxxlmnnlffyixyhxkkplxqqlkxjfylxnpihhlnpmpnfqyiiqfzypxiqkknxjpnzypqjphhhyqmilzmpnnimxlhljlnyhlpplnqkpzlihlnljljknppxlyfnqpxpnlypzqjqznzpfqqkhxnlqppkfiykkjqqlppynklqqnhnlylxkyxkjhlqyppjhjyqiziyhqzllpxplfhhfjllhxnqlqpjkymqqqmphhzzqllilmfxkhhkjfppzpjnpmpqppjpnipkyjkmnmphkqnpqfmxhifiqpiqilnzzkqqfliqjlyxqqknnjzinypqiymqnqjxpfpyqpqknnpkmpmhnnplmfllpqhpqnpkznzkpznypyljlyfpqzlxyzqylpxymqkinyyfjpmqfypnyiyixxpizzzxjqzzflnfhpfzzyllfnyfjimxmppmnlknqzqjqpnpmkxihfixpqppyxpzxmllxnjqpyylzqhjkjqpiyqpihfmpkqliplyxphpqkzfizfqylilhqkllkhjmppfkzpnnppkfxpplpzyflnzzypiimlqqmhnhyxmzixfyffkqlhjplzijlznpxqpkphnnkxqpflmifmqylzqhinhqxxlfpnjnmpjyxpxpjjqkxjzfpfxlxqlqzzjqhmqflljlqqyklzpnhllqyhiljflqlqkpmnhkhphplpimhqlpphlpikzmzlxpnmknlfqhzpkhyzkzjppqplklikqikpplpjlxhqzlnpjlpypxzzqiihpxjhxjzxijphlkqnilklllnflplpmlfjjknfpkjjninyifipmqqpnmixqqhifjkxpqhzlfxhhyqqqlmkfifhinhllfqynzipnkkhzjipmqxlljzjjyxhljjijzlxmxklzjxzljlkpfjpmqqjynxppkpkxflxpqffllnllllqlpmljmqpijlqxfmyzqpyihnpnyhhhplqlqxqqyxjklpyljlkzpkijxpqxlinmqjklnyyppkqmynmpxzizjklzkqjpllipfkplixhxjyilqqyzjllzzpyplmqqxykqzpklpmxnyxnqqjfnlhxzhpplfzpllppqiyllqjppypylpihpimlxnliqfqlkfjjlnijpixikzmkxlknkqlzjmqzimqqxyknnqfmmpfyqqynxxinqpkxlykjqqzmmjplkzklknizhkxlzkjkhnqmqxljqqhlzzphjlifnhmyqjzzzqqpqkqflqxziqpqphiqlpkpqjmqhqnqynijknhmmjlqqhynynfynmqiyfihpkjpyjynppjjklhmfpimmmlyifkxxlqlnhfyzqplnqljiqqxlplnzyqpfqqiqkxnzkffzzlhzipmyjlhyknfhzknlfiqlijjqpxjxplqplqqjxlpxyqfjiqlzmpfhmpllqhfjppyllqpfkqjnfinnxjzxpplqpzkzipyqjyzxxlzmqhqiylmqxfmnfjpzypnplppfpiypjqyinmfpkqkpiippyjxqkzkflnqppqilfjfzliqhmzlmzpjmipjmylmnjqzhzjpinqzqffxqmzljylfnklmipzqklklnqixnjljhjxipknmqmkflnnfxmyyxlinpjhhjilkqmjfjylqpnjqhpihlnjpxihkxnnyjmfhjhpqffpljhpjqlhjnkhpmlqyqqjqhpzqpqzlxppppzpqmnjjzjflmpknpkilhpmmqkppfhqqhjlpqfmmfqqpzkqinxnpxknkjkzkxpqxfyiymxkqnxmmzmiqylpljynxmllklpjixfhffympxmzmhhpjlpfqkpmypmzhjhlpqlkkkyjzmkqlkiplpqzynxzlflylpqxfhxzipjhypfqjljjxiqzhqifqnyxjqlnlllkqipiqfnjqqhjjxyqxlnlqjjmikixpllmqhynzinnlplphllimynlqhyqqpplxzykkymlxlfhqyyplnjhixpqxxllkqqxxplxlqqpknknjhpnkxnkynljqhmppiqimnjizljjmjhzlipiqlyyzpkqqzqyxjflfhknmjjjikjnmlxkqqimzmllqhknjxhpmmqpyhfpplfhmhllklqfqnyqlxnixmzljlklqmhpmnlilqphphlphlqqykfxppmjjfxxpyxizqkllppnkzlqlkqpjlkkkplkmqljmpkqqqqpqllhlphpifylkihpqpzpqlplplfkxlhqlpxljykljhqjhflhilyyljqyfllqnzyxplxkmlfmpfnkpyppllziyjfnxplknkzhlpqqqpnynkqpkhfmmpqfpjyqnyfijqnfpqhillknilypnlqpkykkljqjqmknypxfhhzmpyqkinqklqyhimjiyllnnhxfjmzkklhyqpmphmqlxmiznhqkxqihzjkinlklmnfljzpllpymlllnhlkqmqznllfykppzfmllqhyjznqhxpqkfqhkplqjfqlyzkijzplzpjjlhxkpjhypypkqnpfiqyjkiffphifhliypyylxhfflpzqnlhmnjhqjyxmxxlkqqlpzflpplxfjpnlppnqpyihlpqfypxxymzmqmqihkqyjlpnppqnlhpyplhijnmkijkqyknnpqhqllmfxizixjkmlnlpmqpfllfkfkkqjqljymijxyjpxhfliljklpplikznymxxhklnippzqhfqfpmzxmyzjqpjppnfqqxmipzppfnxlkmipjqzlzqzlklfiklkyyhzikqiljpqkzilklmjzpkkpflhpqjhlmhnmlnqqinknqznnlqlkjmyhypzpqplxyxhzjhlnfpjmzqhzjhizqlpklymxkklzqjmqmpjqiiixhmjkpfqlqqmpqplxllqqmnkqqlmqxhmphifphkyxqlnpxhxihliikiqxlqhyqplhpxjhjmiijjhqljzqxyypkfqkylqplippklkyhqilfxxfqljhxinmmpiyqjhxlxkxinnhynqpyzlklqlhlkjifxpxjjmmqyymfxpmlxxlyyzqxyqljplfzlqyqxjqxfpnqlpnfypjfypjikfylfyjhqlhyxlqnqzkhipjflykjymqlizqilqlzzqypxqhqkifqjhqlqkyfzlkppqfkjqhlnmjqjqxihnqfhpqznpypzhffkqlyzpjkppzhjypxxnzqzqxnnliqxhqhfpqhylzihlnlliyfzpznpphqjpfljlpihjlkpxliqzlqqlqpmlqypkfijknplppqfmljqkhnhqlnlfppmkfkfmljkzizffkihzqyqqqmqilmmxifzlknqxnlkmkhlpkkfnylqnllhqjnhppjzynjflqmljqpmxplkmlqqjlipzkfipqqhqhyqzxmlyninypzlpkpqqqqnlyfpxplkqjjlplpipqpqllmnmkqpzhkzpynxlqplzmipmhqpyimzmqyhifxyphpqmipqfzlqfkipqlzpjpzlqhqpjpqzpqzlflkppmppimjzhxhhmyplklpikjpxjlxxlnlkxlkzflykhqxlyjjknzmjqlqlplzpqqjpylkkzkxqqnpfhjipljmzxzlfpqqfpnmjpphqpqkpmlnzlpqjnhfpzhypzhhiqfllhylppikmpfpjqpllklxlxpjhqjjnqifklixkzmyjzhpqfixkqjiqqzkijzkjppqyiqkffznqlzqxmiqymfqikphpnjzxkqiqqjjhnqqmxqniqkqqlinqjmpjqmfhhhzhmnmfqqflmqlzflqkppzqiykfklphhznppmihzzqykxziyhlyzpqimxnmxxmxiqqqpkyfqhmkpkmznkzfqnfipzlilqpxjqqkmzyhqpllqppqhhjnqlfqpixzpifkhzjzinplyzflphlxklnxlylfkllfqpznlhllkhnnlqiyhplpikkmxzypzpzhqpkqyqzqlipmhpkipmplxiyppfkzppxpynjfqpzqllxqjqphpllxhinfpplhxlmlllhyqipnlphnqymlphlpjpqqxnknqnfhjyqxzfqjkpyxkphlnyyfpyfqlqyfizhpnzznfnpkijlykhyxkkhnijlifllpixlqyfxqiqzjmkllnziyjhxhilpqpqfjyplkipxmfnzkplpqylyqfqmzyyjixiffqmhzqipnxlllyllnllhijqqyqmlfyplziqlplpklyqjnhnqkpyhkhzzlnqnppfzlfyhplqfhyzfqpqyjhpyhnzxlqpmphzkyxqjfhpqfxyqqqjhxlnnhlfzpynizfzqjymxikiqhlkipplxhfiqmiqppqflhilnpyypqfymfqjxznhmklmlmqkklqnllinzljxlinlihllqkhlqjkjfmpnqlyqqqpmqypxfqkxqlxlpqxxzlzpkmizqyqnkmqmlqpiqiqxqnyllylqximmlmnkqznlqjiqpxpqifmqkmyifhznzqllmhqmhhqqlqllfllmxppipqxxhqplplzzzkmkinyzlmkljqxmipyhxnljqymfkmyppnfzpfqynlmqqkxqqzjhkxiyfnlmqjzhjqqnqpinpyxkpmlqfkypxyfhilhzqqlmqpzknxplkkqqppmjllpplfzyhjhilphlpziqmllpjlxjqqylpqmqhqpxqylqmxxkfllqjphpxlmqmqmxxmqlnnqzpnmxninplfqznxjqlyknkllkjjknnkynpmlkqymplmyzjiqqxillnkxzhqnfhxljqqypqnlkznfqpzkjlhifkhxllmflfxkfkjlmkppjxpqiniklnlimpxlxhqklzhlqqyzppknppxphizixhqpzjxpilyhqhhqzlqmmxpzmqflkiiznqjniikpllnlmzxnmlnklknmfphxynzlxmzkiqkllhplpfjkqnhlmxzjpzqkmpqylmpqxkljffqqkhniqppiplqpqzjqljjhjyiphpqyxmzijnizkhlqhhjifflkmnylqqnflxqphxqypnflljfmmnyqlxnjpjflqzkqpxyzqzknphppmzqqnnfzpqxlmmlppkhyqzhqpfpjllzhkflilhlfqilypihnpkhilpnnkxflnxllpxllylhqpnilhppxlzhlqhflljlymkqfxjlkyzpllzjlxpqhnqhqllmpmnxqkxzlmklmlhpjjnmxiiiqyzhyqnjnkhyqypkkkmlxixqxhiplnhlxzhkfmjlnmppphnpzhiqlmlqxqqffyqjzqmkfllxixmqlpqhmqlfzkkqqqjiypqkxlpnykhqzmkixhqqjnplmyinhhlljqfhqnhqlxkzlkxnkzimyypphminzjxnzqnxkqipjqhqyhynqkhqppnhflklkpjlhhyjjnqzkqpxhqjknhqhykpnnmpqfmhknjxkqfjjqxlflninjqqpllmqnpjilfllmzjnhnpqnhqjfpqnqqfkmpmzfhnqlyhnyxzqmpjpjlfplplnzznzzmpjkmlplflqzpqfhqqkqpiqkkzipzyqkfkfhnmmnplqixhyimnqzixkzjlqpqjjppqmjjijjfhlxzjzjyhzlfqmmpqyjijzfqlifpyqnylzxjkkhlqlplfpjpizphxllffylqypllhhihzqqlppjffiyqjjpkpfhlnlnjpzqhjlzqqpzymnpnjlpqpqzyknyplpqknnqhxqyqpkppyyllyxylxpqhlklqmikllplqlmmppfyiiqzqhmjfhhjpnxzpzzzpyhnijlnylmjqyhqpxmmlminhxxilyfxipixzqphnqqpkmpjpmyzqqyqylmnxqkqfqmkzihznypylmlkkqyklhjkhmmihpzjlxilqnqjzhlhhphqhxpllklxmhzpqzfjfqmllyzyhxmfnnphqjpffjklnmxqqpninqqlnkiflpqlhqqzfjzfzzppjlhnhfjzflhfiimlpihqqlnjjzxhmfjqpxkfxhmpqxphklfxqyllkfxqlikpnypqqnlxllyplinyqxxlpznnqkmlppnfnziyxlfyplfkqlxmkfplfyhlilylxzfyppxlkkpyqkqphpyliynypipimmlqpppnzfljlpzjppqpmqfznzhlpmimyzpjzixkqminpxkpqkizimlzflpjhjlllplxlzlkfjjyijqpllqiqnhjqlfkmkxlllpkzjqqljmifjppqlijzimfzplqnxmhzqlqpjzjimpqjzklphqlxnyiyzxkllppmppnxznkjfflqnfxffqqlhpqnzzxyhpfqlplmqylqmnlklhxmmljyqfyllylykqpplzflmkyjxjhqpqlpzyjipfimjpplhfhiphxjxpqizkklfmmlymnplqnmqpqipfpfxlmlmkpllxflhqynqjylqqqfqqfhlqpnxqmpppzljhnqqhmyziqqjlzpiqykppkqmplkxnffqxkmpfqyjlfiflllxqqylppifxhklzixikqppkxnhzpplypfqplhqmflmimyqqfmnjmnipxqmnqffzhlyyiljxpqxljmjjxiznplmqlhilnzlklqpzzhfjhzxxlfyzyinqyyjkmkpxiyynflfxqypipzlqfpkfyhipjznzpmmimlhfllhjfklppnjmqiqlxjqpyqjppjymqnjmhfqqmmqmhlfqzlnklpjxpqpfjmiqqpmjyzflqnxnqpqzqqxmqmlnmnklzkzzppqfppimnlnllmiiqpfylfzfqiikyhkiiizzxnknipqhiqxhlqppxyxzkjihxlkhkqjlpkpqppnqpqiljmmfyfmnnikxlkzllxjpilpzqjzpqjplmmpfypflfklzipqlplzjqymqinqlqqlzmnqqxlmxkixmfqzxqmipxlpplplplxqqllyqfzjqhlkmyhhpijljlqnnnmllknmnpyhfipjhlpxxqxhipzyppxpyhqqmzxlhlyxlqkmflqlxifpkkjllmnpljpzfhqlpzlpyzkqxqxkkplkhzhnzqzppfqnkljnllinzqfppihinjjipxqyfjjiijlqpzqmfxhphqqzkyfifmnflilzllzmxkinizqnqhkpkpjymnfklzxlfxlzmlknlnpxkxmfliypqjjqfjhpznjmfxpplnxlipffzfpflmhnlhyzlljjjmzqqkhnilqjxpmppnlnjyplxxmjzyynqpkfqphlnqlpppypflnmjzhzliqkpqzjymzqqippjhpjphkfqpznlnymphpmqqlmkilnffllxplqqpkjnnzqlxkyxhiqnpyiqjxylplnmpknnqpqkkqlqxhliklpklqpmkihlqqypkkhjplpxnphfnilzpihhxzpiqqkmihxyylqhkjpxpiflyqpiqyzhklqmxpxhqlxylpmzmlqhqppmpylzqqpmqxkizppnhxypzlhmxmmhinyklyqipmxmnzfmxlxqylipnqzzlxkjplqihlzxqyimjlyqfnnyyhpzhjqmzpnjlijppikqllimqnlkkznxhqzxhnzxpzhnjyqzpmjlqllhzliyjzxqpjmkixkhmllqlqylzhhzmyykplziiqppqfqixlkjqzjllhlliypfppjnpkljhpzklqxfmxzihpnmizqhlmxllniijllzpihqkmqpxiqfkxljqqmqlljhzinppzjlmpmxpmqxilzyqmhqpljxpmjmqhxzpxyqnipfyilqklhhmlqykzlflpzpijqjzlnnxlhhxqzpkfmlpjzxmmkhjmiqqmzqqyqkmqnqpxnxixqqzlzihqppiplqzhmpjqixjzqjqjqqxhhmlpzzipkjzkpllppknyjzyyjpfpizpqnlxkqnxnlppxfnpxiqqfpmqkpixzjizqlphkmyhqlqliknmmmzkzhmpxjxlplzikjknyjnlkhjhiplqkhqxpkzxflplyhihjlfppkyyilmfzyllhxplxhzlfkqzfhzhmxxqfziqkmpimyiqfyiphphqxmlqzmqnhlpplfzpqxqpqqipiqzqqjkpkihjpljylkkhimqznznhfkfizpqqqillylznxxyfzmppfhlfpfjykqpqzyhymqqxzlppmnqpliqplmzqqxhylqzqilplznpxqqpnlljhhlxmlfllmlzkxqjkqqqjqzzqlklllhmlpppiixqjznppjhimhphnqjkhiqqqpqlljqikpnkzqhyqmqpmkxyyjqizppfzyzqmhkkjllhzqppljyhnpxfiilphilqlnxniipmfkkylzmyhxyizxmiqhxkfpilpizjjippjxypmhhmplqpmlqjlniflpmpxzpxkmplhqjlypxxykkkxmphlxpmlxnplhhhfzqqnqlfmypkxfflqlzzhnyqfzlzlplhjqhqpjlqqijlqfpknxypkhlmknjkymixxfilqkzqxliqqhflimfyfinqxlpllpjxljqlqpifxiilqznkpnxpnlpmkplqxmphlnllpmplqplzzqpllklykpyflpfphlkkizmlipypmiznfqznkfnpqpyklqijnhnlfjqqnplyyplfqjxmlqkzmjqplqnqmzkqyylqqfnhmpizpnypyxyhpkhifjypynmqihpfmppklxinjminqxkjyllkklklzkqynzillqzqxzxlxhpxqpnnjlizzxnpipphijzmpmylxiqjhyxyyllfynlphkjkxfpnyxnkzpqzlqzpihmfqnxypqmqqzylxxqlfiiiikkjpmmkhppqnifhmxnljlljnjjmqqlplxqqqmplzhjnqkylqlqkjxqpzlflppxzqqqzlfijjzqkylzpkmqhliqnyyplqpflyqqnxppypnfxqhpmnjnzmllmpipjjlylfxhyylhiqkqxqiqlfxpzplzfnqfflnyhfhqnpqxhqpxmykpykljmplljmlxxpzfqylyyzjypyfimlfxkhknmjxizzqnlixjzlpynqilflxlxkixllfjzyhipjnqjqpfqxiqykjpllxpxlypjlqpxppxipqnppppmkfhilqyxilqkpplyqpnkzpqkqlzqkqpqqlqxqllzypmnnklniyqnqnyhfpqhhpljkfqpkplpqnnqnjymynqqkqmmzqflhqypjnqqkflqfinlilpfnnnljhppfxfiipjiqfkjnmzqmjnzxpljjzmzqnnlfmlkxqkxzqpmymziqimjplyzlhljkmplpqzzhzhplpzlfqpinhliyixpyliihjmljqnplypqlpziqiliiiqykxhiqplykhzlzmqfynhlxhynmzlipjfkplpkqihkpnplhxnqqjnklhnjfxyqqqiqpxihplqqqkjpipznqljzfilxqpppqizmmnpmlqymifimmyqnzlzpyfzhfpqypylnixmpxlzipiqhzqljfjfplxphhizznlqpjlylkqpmlzqnxqljinylxjqxppjxkjqnnjqlqpnijyxiqnfklzzphlxxlikljjxmfqzlnllmliqplqxnxxplnylhxlmfllqijqnljkzqpqpzlqiqypqpmqqkqiqplpphxpnlqxpkimplqpffzmplypjliymkknyplpjpzqqyqhqfjqqpjpxyzqyqqpkqiilnllpppqxiplxmxzlypzxmipnpzhxzmxnxinjhpxqjnylnkpphpppxjqqzlxylykpyqznkjkqyhfiyplhnphqnjyikpqlpymyfpznnplllkpnjnlhfjypqiljimqqkkkylnqzqppzqqfxllpmpzjzpzxllqzppyzqkkpiyziinlyikfyfjzjyhyxhhjhflpnhmniyjqlfhnfpyjnzfjqqlmqkqlqjpmhlzpppqjqqxqmplhihzpfzpnihplpfiiiiyqilpnllzxpfmhxxqphjhhmllinyxkljlilnkqimmyjkpfnpylkkqxhxllfpljypllippklkpzkflkmnljlhylqnjqkqifpnpjymxxfnzlplhkkpyyypnyllphixjxjiyxpzflmkzmpqpqzyqyqhpflhlpklmhnipjhphpymhyknfmkqzxfkllqpmmfipkpkmfxlqqnqhhjynlhnfflxzxkxfknnqfmpxkqqjqkqlfphjyilliqyilqjkzpznnqxjjqppyplqlmhhjlzmqllhljxmpqijnlkinzfilpiplfzzypmlyfqpzqpqzhphllxpmhlxjlxylyqppqpiiqpqqnknizlxkflmlplpnqlhnfzymxjkiyqjjlqjkqqhhnkkpyzqyhfijpkpqhfzplxzkfqzkqhxjfifhizlijqlnfhykllyjhfpqmlpqxlhflippfphqzjhpyypnlflmhpikzmljhqjllkjlnlzlxpqflnzlnlfzqpnxinqhpiknqplyqlplpmmfhphkqpiniqkliiqjyhlqmjxnnyphxzlmhljkxmimxzhyziqpqqqhpnfhfyfkzppiqfnllxqpxlhfhhqnlplznjxkiqqflillinfphpqhpnmflfqnipzxlmfiyzqnkymizlyfliqipkmypzqpppkiynjxpjikfzqmzmhqxyqjqzhqimljqnqxzppmkkfqqzhfqzlylzlnpnhllyphppyzqpqjxhqmmplffppikypfiqkiqqzjpphkqihqfplpzkipkjhlfqxjlfnzlpjqxpfpkhpnlhyyiqhiiqqqfhlxilipihnnxqzqiqqnjkhjqqyjhpzzmlqjypqlphqnihnfxpnqnjjyjqqnlfnfziyfpjymfpmqqnpmnfxjzzipnhqphjpfijhnhlxqhlkxmllfknyhxqlmmijqnllyipilzklnzqfphjyiiyljppzqhphqkzzqxnpqqmliilmzfpipljfqmynkypmfqzilkikklimpnqlnplhkpjqnpllnhizknphipifhzlnqyjphlqlzqxinzlxfpmyzyllymkhkmlyqmljmfilzzpqqylikklphplqiqlfqiijpqmlklkxnmhqxhzmhzipqkyxqpzhjqhlnfmjpippzqlimzzqlnlzxjyylfhlkkikhklpqlhiyqnqxllzlnmzzlqqjmzkqqfpjqjqqfknmmxliljiqpihjpzimpfpzhfjfxqhmqxhnxfphyfhilpklljkhhhiynnpjlllfppmhpmzhpplyjpqiinhqmkkyhpikhpnqlxpxyhjnnqlnjifqjkhhnkyjlhxiqlhfhnlqqmnynjzjlhyylymhlhqpkxpmjpyhhnlzpfqfmpplyqxixkmjyfqyqzqpfhqyqjfpixmpxznyiqinnnplyzjhifjpihqpqplmpkkmlmkqqfpixlmqlhhfpzhhmmljxxllfjffplmqlkhzqxmqnzmlyjyppqkyjklhyhmffnlpqpillfhzmfyllhlqnyhpphphpqqlylflnzmppykqhhpllpqplhzymymlxzpkfpqxqxnhfznqpnlnyiqnyzzlqnhphxlzmpqklypfmpifmnljmlnhzlmmyqnlqxphlilqpinqmqpxlkpiiplxfkmzqfqyqpllxzlnqpmfqpzpmlppqpnlpixnpqyjmkmzhkljzxihixjppxpfnnlznqjpqmxyxqfyikqqmmhpxxqxhkmlqyipqnnlzlllpikxixqzlppljpplpjxmkmfmlhipyflmplpqmqfpljizyqkfnmlqimpqqqfkkihqqmqkzxlpmfxqmlqpjiiqnypknqpzxkqnqnkjqkpjzfynqyzjqppqfnzkpfxmfpznnizifkhpqqfiypqyqpmmipkqfnljfmqlqiyhjynppxqzqqmpxqnlypqmzyppxhmnlkfmniqzlqkfpzihhkllplppyjxqhzikqlqhxpyqilhqpxzllfhmknhzlliqpqxqiznijpjjkpzpxkfqpyqqjpllnjyzyzfmyhkjzffniqzlzmkpilpqlhpxpyklikkllyjkkkmqjhpxnqyhfilqlxhhpkpqfhzpxfjqxlnkqipjjmqplzpmlzfniqkpnyfxxmkzqpyxiiyflhkpqllfifxpfiplqinpfhkylyllyiyklzzmnqpfxzqqjjnxnpxfqhlzpqpplhmxjpliflqpjxhplpzjfpplkpllfjnqxfhnnjqklzhnzmfhhkifilpxkqqmhizqxpjpzilllnljhljpjnjkynfpyppzhqqyfplfxiklqfikykypxkyxppipmppkfqhlqqqfplxlmqhfjqimlmfkhhljlphlqjyjkjymmzhnmlylzfkiklllxxklpllqjfqnkfhqqlziipqjnnpkqqhqfyjfqplflykyylnqyqmmqkqqjmfjqlmqfqkpphzpzyzihflqpizpznjmlilfpippxplxlhlqklpqllhhmjhyxkhpffjjpxqikznyhppqyjqlmyqpypxkfmhlxfxhkqflypqpyqxqxfqlphppjxkypqzxhnznkfqizqqhnyqhzpnhmxlkxklpiqzpqpypyfimqmlfkmxpkplkpmppqmqpqlmqpkpqpjifpjzipyqmxlkfhqlfqppnlimynjpqqpqfqlhqlfxkqyjnzzppmhzhqxzjqxppfhfmyhlmjhpylxkknxqkhnnxnqxmhppinxqiqlpqjnjlpkjqnxhpflflpfkxnjynqmplmhmqpnyzlmnmyylppxzzfqnnmqyqjqmiyjllzkfnkqqppnnhlfnpzjqmlizmqzhpjjpkqljhkmqylfhpqzlmyplphkjlnjlfxmhhpxmhphljlpyfjxxqlmzmnylpfjffqqfxqnlnyxzzmfqqnmqhkxjikhfzqzypflxqpjizqykpxklhxfhhlpqxfkpipijnhpqximnpflqhpqjlqhfqpiyhqxhlplijhqhmpijzlqpqzyhljlxmnzklzynqkyykljfkfyxnqphnfymmqlppqxqzzlpyklnfypjlzymhlflnyqyiqknzxxhyiqxfpnplqyyiypmhfjylphyjplmljyqzqqqflykjfpqilnznlfkkzqpnphfzmnhlhlmylxpqlfkpklzypyfkpqpljjlmjfqmkznlqxkmqhmilzmlfyxljqylkjxkzphzplyxhyyplqlnlmmymfqpxhzjypyljfpkziqkjinpffqqnpxkpxkqfqhqylqihknllimqzlzjqilmljjplqlqiykmiliqlpzfmjqkjypyyhxfzfipnqlymylpfpnmjyqflpjjmplplqzqjlqhyizihpflkqkqlylmzzpqjixyklzzpfpqzxpjqkyxijhqqpxppmizxzplhlyixjhliqnqlfxpkqhlhkpfhpjlqjfhfqylyplifyhylpnqqphkhflymimlnjnjqhyqxpllnppfqlpyklhhqpinqppxlxkijiyypzxqiffqhnhjiqkxlfnhnhfllqxhjfzfjlqlkkqylyimnmkqlkjhyznfkmzmyqxfxkyqqfllxxpzljnxqpjiypjyjjmhmkjyqqlmkljjljnnqlimhzhxilklphmqplllnpppiqxkkzppxkphlzhmqqxxyyzjymqjppjpnnxpfqnlxpyfzyjjhphhqlzkqzlnpnyxlyxnqmppqnxnjnjqkfxnqfmfpympnplpqhxlpjinfqlnhlnnpjhmklhxplnnlxzqxhxqphhzhqlflziixlxyifjzzpqlzhfyzzjxkypmkkmkjpfppykzxjlxyzzqxzljiqlpklnjppnhfqllhyliiqqqkplzlfmmqzqmplxyzhpjixzkplijklykjflpzmlzhhfjplypljjlmljljjljiphjfhkpqhinkhpmlffpmjllmliyhfyilqniflqjyhkpppmpqjljlphnijpiiphzpmfmxqxpfpxlznnxkpkpzlppqyhinqqypnmpknllzlzpfqqqlmhylfjkxkippjpmxilppmkzpqpkplylxyzhhqpxxqplpphnhnlkynyqxllzfqjnllyfmnijlnnkjzqhfmjzifqjhqpmykfphkpllzxqzxlllmyxlllplqhkqjqjffhklqpqnnljqfkpypklkqjxnnyqqffpmpijjqypyiijymlnmilylflqqpfkmllqppzlfqyiyljifhnnqpjfzijnnhnxzlppjiqyikmlnxmzymmqympljzpiljxjiqyxkxhqmlhqqfpppfqxiynxplqyixppqxmlqnqfmzjhmyfpxzkmlqmlxqhqyppljnhpqijyimlphzikmkyzixqlylpnpjflnqlmklpqqpqppllpljqnpnjzjxqqkqqpmnfqjxijzlykzlkylmlhqiyqminzxiqjkxyjpqjixlhylljzlqxmmlqjllxpfkixzqxlmpmylpnlmzkipypkyznkjyyyfyqkkliffppqyllzlyjlnzlpjlhqfflxjkiqmlpnpfqqqqmnxfklnyqqjipkqkflknfnnqkjqxnppzqhpxlpzqiiqilxhqiqyjqljxqilqjlqkphkqilhhqpljflhpilzylfqimpqqhkyjlikqfjlllqkpqyqpljplzxqfifyqzkqhlzfnpnmnnlkxqflilypqhmzimlfjmlzplpqxmypxnfphqflmizqplhmjqmmpznpxpzxijqmlqhzmqyqjijzqqqqlhqpzmnjjqixpiflhqplpqqhkflpxphfmpqlhzqjjmhplpmhkqpphqllxlqhqjhhmnpnphhfzlhlqxqykyxfnfixlylyqqjjpzhyixpqininminkpmpyllzlhxxlqmlylppypkzhlhzqlpiklkqfxpphnkyjllfxpqpnhqjkyppkqlmqqqpmlhlqniypypqpmjkqzqzylqyqnpqflljpzkmlhpxfxkzzymphpppmnlnkmkqxqzpjxiqlfhfkklqyfpfkjxhfpjmiilmxxlyhhpnqyqikmlfxhqppqiqlzmmnllilfphqlxihmpqpqylmiihxqlnizpkllynylxlqkqphyjyyhijliqppqxnlpypqqiqilifhqpqqqlqfkhmjnlphxilqkpqzhhpqqzlxqkqfmxiljlmfmnhmqpkpflqyipqlzihlkqpjkfpqzqlqlnqjplkqplmnfqiikzplpxnjkjjpqxmhqlqhpylmfyflfjpklqllkfhmmlmqyyphfqqqqnpmnyqpnxkqkxzqlhjxflxlzpzqnqmizpqnpmlmlyxlypijlpfpymifpiqlypfmlqqlzhkfhpxplqnqhjjzmfhzqnxljpfzixyyzlzpxiiqqxnjfpklznmpmkhqlhpqnpiyyqmlzixzqppqpiixfmhkxhikjlnqznjqnplqfnxmlfqlyjmyhpqkxhmlyfxxihqilzzjznkqynnlpmpjnqllmhyxnykkppyhynyixnpqkhfflpphnlipqhzlqxfylffkpqxjhnqmlzxzpqhfkjljphikqijxqlqzimqfpnfxkyymzkpqlhllzhxqlyxphjykznkqnimqylyimxqmxmjzykxlpnlmqzlmjpjyfqfplfjilmpznzlhfnnlkplpfzjklkqllpiqfqpmkynqjyppxqypnkixiykzxlhhqyqqfqpxqphqmpqzlppknpfzkppnpkmhkxhnqfmlfpxjimfpnzphmkynppnkhphfplyqzlqpillnpzymkjkpqyijmplqlnqqpfylnpjqhyzhyxnppqplpinfmyqfkmjjppkpfyjpqppkpkkxkpylpxqfyyxxzqklqkpqimqllzmznnnznhzqqpzxizpzqnfzkqqzjkhflhqklqpnjiihjqlhyxmfpzxhizlplqzqqjkmylqjzzljfxpqmljqmpzpflkjmfhphnknpzilqllzlphpmqmklqxzfppjmzffifqjqjllyppjllfnplpnqlqpknylpjjmfyhqxqjjynlmqiqqkmxzyhhhlyjyqqjmqhpiqzxklyljznfkikqkhmxymqpnyzflkqzzfnxylqixkjmnfqlpzynjzmfihnhnfpqmqpqzlhzqljphqznhpypxpqlxzpzyphxqxhkqzppnkhlqhlpznlfiljxklkhyzfhqqqxlzllpyhzkqlkkpllqpmlmnpqipznhlhnilmhljxiqlkjhyphpyqlkqkxflipjpqppjplkqxniqplipyppllzzppxkpmpyfkfiqqqjlkipijylnpfqqhqkqnlnyqpzhyllqkpyxnypzlqppmyimzlmkzphlzhliihqixkypqqjnnfpxxnxjlnnfqpjqqyzqxpzjmyqmfijnzyjhlhjlqpjyllhmkppipfyqyyqxylpjfqkyihyhqnppzxnjpmzkqykylknmzjpzkjpqpihlilqqlyhlfipfjkjpppipkznlzimpmxphlqxjfpqkjkjymmlffqjxqxiqfyqmnmzlnzhqnznpzlxmphlkqlqlpqhqnqlpfjyjqpffkqykyfqppnjflknlkhlqjqlfmqhmiplqxkplqjilqznlpppxfzhzmpfxlnzffjnjzjklikplqpzqpyfpmknlylnnpnlpqpqppqjhnnmplzxnzxzhqfhilkfljpjzplxmpklfkpipnipphqyjmqlipkqkljpyzyjzyhpmhqqfnkmmlqlhqqkxfllyjhfqklmlynqzhqxxlkphqfnymlqqqnqjljhyqxjnpyqyhmjnqizypzplfniyfnhllpkxphxpmfjfhimlqzpixfpfhjpmqqmlmilhmilyxqqzknxkpphynfifpiyllhixfnyplmkyjpjjkfyypzzmlpfqiplnypqqkpqnpyfiiqiknmxjmilmxljzhfllmzzpmjflhzqmqljmqlmqjhjpixliyfzmxlzzphlpqimjpqfqppjqqhpkmhhfqmmynzfpijqpzjznhmlpzzxjpnliqiliqiqqfppijqliixijqqpmjqqpxykfzhxjjlyxyhnyxkfymiippflzqlihnlnlixqlhiiihfqxmklhqzzkxzhqlqpxpppmhjkhmpliqnlxpiphxyhnfihxhzpmkhzqfpfhyfilynqypzfzpmlnznfnifnpqpffjqqmyfpzklniplminnmhqipnyfqxhlpqzqmfppiqfnqllymymmqfzyjjlyzlqmqnqyyxpnpqxkqylkqmlzpzqqlpplxlhipynqnkyjpqilylppimqjfmzizxkjlxpjqkhlijznxlhppiylzpjppyflhkykypknpnpizmmlxyffjymmzkxfpqjjyklqqmylfjlzhihlijxqhxhiqiyfhmpxxzmnyxqlzyfqlyllqnpyfxjjlqpzmkqxyiqjfhjjplqlpzqfmknilzqnnlqfnhkqhpjqypzqnilmiyphhyhlkipfqmqfjmmkzlpzpjlpkqjqlizylnlqlpzjnliypqpxlfqlxqqqlljnqmkmyqqyzzkxfqijpyqnjklpmqnlpyjiljqlqfjfxmqlniixlmlpqfhxllhzljjmikmzflxfpqmlqkqhnyjfqpzllzzqlnlqpznylmyyzxniipqimqklmyplpnzizkqqlflxqlplpllqpmphhmhmmqpyyqpqhzfphpkqlqqjzqkyphyzpkxqfxflnnpxyilnzmlnfninpjlnjzxxmkxqqnixixypzpmkimklqhipjykkjqjqlhhpjiqhxfyyplhliflqyqinxklnpxqlmfhklliikpmhmfnlzxkklpilqqnylkllpzjmzzqmpmmfykplhnphkpifnimfnkhpmklmkqqyhpxqxfznfqinhpqxpxqinzijpxikzqfxyqlfzllilkkpfnppplkpmqpxkpqyjqpihyihnqlhnyyqppymnmzljzjkjnplzqpjpmpplnhyfjqijpzlqhpjpmfpqqhynzxjkzmllyqyjllplpjmzpqlhmhiqqlnjlnizlkzlkxkqlxlzqqpxfjlpqqlxilmfifxinfijkfykxmjhhlxpzhnxhxlhhzmqnyynqpnnxhyfqplpnmfzkmlmnfjlqlnzxhmypjnypqmqpppzqnlpjyqklkhlppypiqilqfyzxjilzqiplqnzmphhxykifjlipyhjkxqqnpkppfqmmzplilpflqffnpyipkxllfnpnijhiqpylqnxylmixhkjzxkmfllpyxfixjfhyqkxfpjyzpnzjykqjppxkxyzpfxpqmjqxqhzqnljypzzhfqkljplfqlqpxyizphfzfknnyykippipnmqjyhmlhlyjlzpmqkxylqlyqffmmxfnxplyqqfplxqfllppnljnyjpkmffjxqhfmylkxqynlpplmmzqxnpfxkpkqyhkjnklyjqqlqfyzliflyzmmizpkqljjqxziimilymiqpphqzylihnkzlqfiznymlqfppxhqpmjkflkkqfykqljpkynlpzlqipmmlpifhnpmqxxmjzhzjlzyhfpmyxilylhkkhlqqqhplmplnyxplpfpjyzljpihqimfqplfnzkqknxqqlpfflzylpzlpplyfklmyjnqnzkqznklkkiqkixmlzpxpqylpijlqmmllfplhpkxjlynxzmxnpnqmyjqljilqikynplnlyzzllznkjlkqjlzlqnqkiqjznlmknqkzlizykzllyhlhjyljmnnnknlqljjlqfjyqyyflplqhlizflyjpzllqzjnppnplnlxzmyfzknqyqlxqiqfxinnqllfjjffqznfhpyzxqnlxkzihzzhxplnyqlzjqyqnlinyiyqliqkypkxkjfzipnfyqmpyikzpqflzpylzlfxkkfxyjjkqfqhjjfqmkqiqqlqphzqpmpkxlznpxpfmkipkpkzqpylyxykmxxzznzlqlnyfpflmflzpmmqphkqyqxhyyjplqkllhlqlhnlqpylpxpnnklzjpnkxqqlxqilyfjfijhlqpmzimiqfxxlkzqpzpfmznlfppqmlkykjijpfqjynyqllpplnypflpmhnzhfqypxlzihjxxiqjhzliknjpknkjlznplqllfkxnpfljpiiilqnyfllqiilklhmljpqlqlknxnhjpppillqzmjlmymlxxqxyykmlnlzjinlzpjplyixzqxjjjqkpfxlzizpfkljyplxqpmxyqyjppjkjfqjkxzpmhzkjjfxllnqpfxzjkimklfyhmpyiqjflpnjpjhiipknzliiimqxfpkzfinzixlykfzppnzlikllpphqnllyqqjqmzkfkfifflypynhljlpfqymmxqjjqhiljqjppjfplxmlfqqfyjfmzpkhqjhmhfmnxhfixpzlqyinhfxxxyqzjhplyxhlqnpqpqlqkqqxkpkmipxhkiyijjqypzqjymmnljkqjkimpqjhqzlqhhiixqqqlyhfypnlfmippppnmiqyikpqpllxqqpfnphqqiziqqmqnqxnmizmhiqkkqqhmzqllplhhjpyilpyqipppiplflllijylxklqppphqzxpxhylqjzykimmyhxmqzfmhqfqypfqqpqhiyhjixklqiqyplpkjpfqppmlqpqlqlnxpfpxhmpqlqhhqlqppqypjnpfxyzjkqiflipfqplxlqhmjjyxjilfqllzizqlqqpfqlpqqypknpliqflmlnjpfhxpixqhyqlxmknkqpnypzpllxhkkknpqfqnljfjyqkkjjhkklxxhxlyffxhmkpmzhikzqxzpiqylhxypphyxlyyjxiqihnpilplqlpjnqzzkxqmzylhzfjlplmnlhlkfkxyqmpmlfpqpkzlxzyyfpynmlpplkfjqpplqkjlylppnjppzhpjzkpmxmhpqkxpjiyqqqljlzzifnhqqkyxxqhhpfikknpppkhxzzffixfyfqqpmqlimzfpinjjqimjhyfkllpizniqnqkljfmlllnpyhkplplkkqqzipjmjqfpplkmhyzpklnfzyfplymphlfxnkzpjpxpkzqyyjkpfklpzqxqixpmljmyzpmnxhpxlkhkqillfpnqplzqmlxqxmqkijkqpqpxjqphlyfnijnpkjxlklfpnpfzpplzhpximyzqpklzhpqlqhfflmlqlpyllnqxljfqlkqflqhxiimhqhkljnnlhpnjqzplkfimfqxxlhpplxlzqzjqpppqqfhqhfhyzxfmpzhxyifpllpihziljxnpzfkfqnpqffzfinnlmmyqiixnimmlqfjlxqqmfzpypxqpxppyzqnymxpypmpfihlhzpjmqlmfmlqlilpiphhqnpfppxmzkqyzqlhfkiiypjyqqypqnpkplplqijnppxfihplqplnpqpljfnhlpnqpjqjqmnznhlfnlzyjmhlzyqkijmyqyzjxmnmhjimnknyynjqlhzlphkljlfpnpqhzljmlnljpxzqpxnpzymllxmpqxjmqillnfhjzjppzpflqlqzkiynjpqnlxziqmxplqxljmjiqjnifhpfzypqliikqmpkyjpipnhfmnqqfnzykkkijhphppjiqfilpklqpzxpjqpzlipqlhqlzhpykyxzmmkfxzqyqnhjzqxfijqfzppxkpyynymlpxmjhfiqiixyliiijyqpjljyxnmkzipylxpkfmlnxlkpkmzlqxklmqlyqqxyhmphnplnfhjqjxlhflnjjnxkjfxjllkpljplzlfphhkzzqifqiyzikhnxifpyflpmkllzlfqjpkphplimlnzlyzlqxxqpkqnqzlpqyqqpljpyyzqzhyllnmnkqlpnfphpfynlpqmzqlzxfkmiqipfqznlfjjnpxxlmyxnlqiflifzjqqiyxyxlhfffpzpynqmhmhqpfnyiqnkfyqxypmmqxhhlqzzqlzyhhlnzlfixlqxphpkpllihkpxykjfxxpkllzfmpmpfpzqpqnpnxxiqlzqkplliihhjqynlmlflxqqqzhhllxhlilpjqqqqpqqqpzpnhpyllqyznjpyqqjqlzjhnlpqlkffxqqlnzpqqypjpqmpnmpnzpnpjxqjykxinhmlqqxzzlnnlxlihymykhhjzplfnqxxpxypylhnnkikyhhzzmfkqfklppqypmlqhijnjqqlplmyikylyqykynzllzyyqppfimjyqzqkhpxkmlkllxfxknkxpqllxznfppphpfmzinlnlihjlxppflmpqkhlplqlnmphkfxlmkmlliqyplfjznkmflhfizjypnnzpyqfiifxzpfnppznikxxfpfyhmiknxiijlpfmzylpizqlppnmlimpnqppkkjpmhyljllqpfzinxippkxqpnppkxqflihijjhkkqzkymxkqfjzjkpzfyxpijzqqlyhpmmpqknyklmhmplxyfzqqplmzpjjqpjpqkplniqipxfmlnhkyqhhyllxlpkxmqqipmkmjjnxlmhppiknxjmpiljlyqhzpzqxxjiqqizymillzxhffjpqlppqhppzqmjylhflznqfnnllqnlpnyhxqzhylihyplpfqilmlpllxphflhjjqmnyyqjhflkynlhqpnmppflkkyffqniqyqlqfpkipijyhmjnlllqxzfmqqmlzxqyipxifqzpkyzzxzhhxpfnlzjyxqxlfikjnilkyqlkzqqzqqyxjxqjlqqyzxxpfnyqqlxhlnlfmmyxxpjzqjnhyillxklmypxxxijmjplhlzylmlqmhpyzlmqlfzjhlllqpyhmnqffzllqhqqmxlhpxhlpnxqnjxjxyqpppyxhplllfnlzknkyhppplyiinxyqkmnpnpqfzyppnqzzlixpipkpqhnypfnjlyfplxlklpzknlnhqkpymqkpkzzxnpfpllfpfmpphizilpqkqljmylhzmjnllkplplimxqqixipykinllhizxiljhxilfnqxkyhhpqmhnhljhyxfnnihilxnqqqhxzhlzpikmmkypllflpfpjhjljqnqjqxipkiqmnfnlxnqlmymljpznqpijpjpkmfzmmpklifqmpklpkpiqjmkpnxlipmhqpzqjhqmyhnypypxkmlzillqfpkzxhqqzqzmpznypjpxxqjmyjyqpplpqqhkymylyipipkppyphlfqipphxmknpkphyqmizxzxqxzhxflhjllnqpxnhqximlnxkyilyflxpfqikqmpxhnqkqqkpjjxzhjfikhzizmyxkjlxizxliplpfnlipqklfnfffxzmqymxzkplikmxynpxfiqpijpkhljlxlfxzhppfqphqpklljijqyxmjjhifqkmiyqkqfylnkjnqfhnllyxqqxzmiyqhlylmlkzxqplxxknilfhkyppliqqpzkilfxqfliqfqmppjlhqhiqyfjkpflxqymhnhpixxxpjpyqpppflpzmlfjqzxnnnpnqmzmhppnmmijlqqizmlzhmylixyiijkjpqhpqnlhpflxpiqfmxzizqqpjnzhjhmqlnqxmmzifnqizlplyliqqllnpqjjyxyqixxymfqjxhmqmklqfqkhxminkppmlmxxxyzkyljqnypmljxkmynknpyznhpkizqhqljxixnilppmnkkqkkppnqqhkqmmimlfqqlqyyqzhqhqljplkqlxxkfpmplljxlfqniqhpkpplpqpnnfhmklpxphqjxkphpkxkfzmijlxkfjpqlifnqmzmlypfjqzjllqjympnlljkpliqfpzpzlkykhlxqihnjxpjiiknymjjkzzlxphkpxhlnpqfhpmfijyhiqqkfzzjmkkymkzppmyplkjxyyqpymfkqklkfqikmzkhhjlnxnklnxffhlmmqjkjxlfkzplkkjzlqykpfkqpnipjqlkjfzqlpmkkqlylyzqphyiiqfflfilpjzjqmlpiyhfklqfqfnzmhqihlqlyhyqqjhzpqkpqhppnqnkqpjkllqnyjxmmppzhqpfjnfnllxyizqpykfhppkmiyxlxzqnpmyyqqqpmfmqqplyhpqyhfnljyqfklqlqyizhmpjjlkjylpynpznfpxizjliqzhknmlpfpykqkhqzmqqfhmqzznqllnkqpjyxlifzpnxyzqpjfzhpqiliqhhfqipmhylzzpmqmilxmnffnpqjqifhfnpilkhjfxqpzqjhizhijyjpilifqhkfljznjlhinlqljmjlnhkypylkmllzmjfjjqzjyhzpnzjqlyhlqlknqnzqqphqfplymiyjyiqjlyyqijlzppmpplzzqyizqmpihyihxkxpnxhffjhqfqqkxmplpipqlliklpmhlfkhkmjfzqjnipyyphlpnqpzkzxmmlxjiikfllhqqfxhpfpnpllnkjiqxlnlplhjfyzxpjypqkppkppzmyzyjnhxhmiqzmynzpqpffjppklfxqqqqfyqfhql\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 436,
        "task_id": 4108,
        "test_case_id": 17,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "mozzzadxgahudcxcgzzadoezadchdxmmoyxayxefcuffgzuhcueocxzgfcyymcedyuehuamuodxyhhdyocezuefygzmohyzyaeyyhyfyogafhegazyhgaeaoddccxeodhudcxheuzzfmhocheooffeozmmucmyhmuucoxfmamxcocefcecyacuhhyggaxafcohfcxmaxugcugdaamuhzxecagchxhxoagdxyfcodcazyhfhzfzhemfxucxydzeczgmzfoygxdocfuahxmyaeuycfyuccdyehhhmchooaygdecgzcafmoezozooceafgzozzcemzghadodcuaxmazzyuhuxhcemgxmgfmhmhguyeacgagcchxxuagahhcxhauxexgxdauzxacgdxohegyaeazxehhhuzgydmeyxzyycfmmemhuffadayoufyouzheeomcoxzyxcamaefmfayadmcdufxmcxcgefmauczzcmzgafadxfoegxdzxzxfdyfayfhhdfzmomfcxgmcmgyzzgzxdmzxmmachohfgxaedhocfofzczuufhacfaumoghahooufxoyzfhzgycexzuycazcceucaxcmgzcdzodfhxmooefmghhcxdffuoyzyacfdchacydfggdmcmeyeghoacmemzzeuxuxxggxeeagcoaeageudogddzumcudouyzgozeuymczugaxhxhhmegozuhomchfzeuudyezymfuyzoxdozooaxoamcduhuumymdhoddmecdygxfyuyoffhmgfueghcdoocgehmmcofgfzmfefghyxgceeocaudfoazyayuymdyuzdadmymxgmczuuxogzdayxcaoyfeyaexddhozdhafmhedcxdyauaxumfoudydccuaemuexuuzduhehccfzmoggfzeogcymdezoxhaxmgfxyuzuaocxhhzozfcagxgcoxzyzuyfzxayamegcxagaaxdfgyooexcdazaxzuhyzuhyfcyeagyucdhuczafufeccexyymzggoaouzauuexfczzugzmhzmmguxgaadhhedamzozxzcfufgmahmgdhymozzhycmcmamxcuumemxdzdfczzouhmuyehaxamxeeaaxuzfoozhmdoxayzcafmgyzffmyyfygyauhygfexhaeauxogdyamdggcoefmzgufzzamcemoxogugmxufofooccdygachdfuzaogyygyxgdxdodymyxcccfymxmoofeohxgxgeyheomxhamudahxmzhamguyamfgdfzxooahcgudcfcczyezheuyayuhycguczeydayfyeaffaggaxghmxdoaceaahgauumcmzugfagyuhdyeuauhzoocmuoxymmgmuahcdzzuxexyueyggfmxocaccayyhomamzfafhdmuyhhxgezcdxoxyxayadazyhcygydmaydodfcymgmexfexeueexcmguefagfyazdeoyfgeechyfzczegdhxyzohcedmdudgfexgacczezyxmmhxohgchyhdcgaxhdgmdygmzyeddugxuogfcefahzedzeauchceuozzuucmmecumdfehmyuoocgxzmdcyguozfafzhdcfhxdhyzeycaffccgxhyhehzazfccxgdzoyaafaygmxdycexggmugmauxmhxfchuuycaahfaddogzffacyzuxaocxefehuocemazmzyahyfzdfachcczodmddmaozzyhxchgfzxceuzyfoyzmefmayzcuuxgoxohxdzccxyxadfxzcgxhaxgxzgmyeuxaeguuogfoyyxhcxoauezxexoauhmcfehczdgeecyhyeafxdufuheugxzeehauocxxgeucmouzyouuaadxdzohgxhfdcfhfmaeoheodgoexzumxuzfgafhcfyxaohoycoxxadyxeozyooegyddmchucfxgcgcadydoxcgmueeyguegxdxzzhoaghzheehhxxgmcmgfceydydegeuyggyefcddeaeuydgaucmzahyoaymzacczuexhoxdccouuezedyuxaaxmgumuxdfcuemeemoucmxueyexhgdhxmmdehycgdmxzdcmxoymyxudauzohyayamxczoaugyzzexdoommxeoagghhuggdmfhafhdocczxeoxzhuedxycuayffgdfxhchddeyxyzffcdyayfufgfadguaczcumgdxuofcaeueuxomuoeczafggfzofzmfmoofaagoxmdxcgaemzdffemdafmaufgcoofgyuoyzeyzxfgxxdduaedmzzyxydmocgfufzzguyhaogazoycyfodzhgaeoooaghdcaeafeghoozuogomcxyhdxadgcgcmxczhuhcuezfhmexgozhceyzhdzuzydfodhueycxaecfdzcmaaoegfeayeemoadzxcouufuoodocueezmzhmguoczucmxzmefuouoxyoymcdcxeyucdfzcfzyxmcaxzcououaxfmodxxhmhaefyhmzcoudcdczomfaazxdhxxgmycffoauzamdouuaezaydmhegfgugogfhyeyyacfduyxamgozumdxyyefdyfaoauzoxzyyhodecxeuzcdhohegudddyofygfyedhgxyedzgcohhhohhcxxyuffmmddzzgcmaefcyhxhuauchgyaeemczugcoauuhmgdmacemzmuhfdmzcazzedfxxfzymydghzedzfexhmaxxugogmdgeduhhzacecuhdzcmcuafdezfghmozefehuxgmfexoahycyefazoomofxfugaxdhhohauzdcudhgfzcayxmudamehmozmofaxucgcdugydxoaxyuxmfamouchamzyaofyheuexxfeymhhyychgomzgdxdhxyzgygcddmxdfumeohgfemyfzmfhgaoufececufczzuyaoxfaofdecgyemeadhoxdochauccoehfyaoyggxhfzgmauzhuazoxgcfacazzexfezomhhaczmmmugzzdyhfmcayddcghmcaemyaeyaeyyxcaoxdzdggeadcuauggudyazfmoacedcdmxeozymgfhuzzfzmyghxycucyfmfhggmxemfaafaeuhdfauxuhzyzgacxgcecuahgaadfzghyghggmuygzeueaaycumdxxummymeuygayudggmggugomzzxcoxfouufxxdzfyfhdzdaadgmmgoxedeuyfeyhoeyfzuaozofahdxmhuxohffhmeuaezfxegmzcgohmxegzxcddyohzxxccuzfacuxfzcdodxcefccfxyaodomxgaecdzxfooyzzmzdamzfmmdccmudgeaxoumxeouxgyzahzdmehuyodhycexmddgayuoafcxuzxacmzaudaodamhczdouuhauoyahexduceodexfezafxhcgohhfgouczyccddzxghhxeoazacxeahaogomyumxyzyaaeouhafhyomazugxzducuygxdofdeydmhdhdxcfzxgxhuemudyuuozxggafdyczdggumxgzggdaxeumzahhhfoaazodxccageyhceexohxghmhgdzycyzzaxodzhzhyammhhdagyofoaamcuudcommudodxfzmadudfuzyumffddyymxzuhddxhezzozohydddauffccfmeacuoexdxyzggaohyfozfcacaufogzfocxczdfdogoygauazcufeoyxcmzaozeumahyheadmazofzxmchfyhfxefouaamaffmgyugaazuooeczgoezymydgfduhmcyggoycdauzhgumaoexfdyfgmuxhezyhdcayfoozhgfeamdammuezogooagccdchoazyzfofehmfmfhhhuogzucmgyeduzgxozhzcyffxogecedaufcaeyymexaogdeocoemfxaodmdyduzddohmacmahufxgxcagazydezayezhdfxfozuoexfufchmyzeaddgaduazcguuycgzffxzycooxdhceodzycghzxuadouuugameyezmaozcyoydmmhgfocmfmfgfugfdmuygoohzymzodyhguadexxmfcxgdxcgxyueufhehdgohhhchgxadmacgudfyhzuxmedgyfaoxzzycdoycgdfzexhyazcecgmoheaeahuoxxoxxmceheecudfmaemoaumyeeyhggcgoofzmcxgggexcxumogezdcuxuexgduefhdzfoezohdxmdzeycaedyxggacacfayzuxhxumagxygdzxchedcuzxczaemeegcozmuexudegoudazdmxxyaoyzdzomdhdyhgucmagxmooudxhzcgfhdacccdfdzuxgocycxexygemcyzyygdxeoxyexfmmzxxgzgxcxoedfgfzmgfzyucgafxhamfzfagmeafgmeoafceduomauouyzumxzzhxdxozyhzuxazxhhfffzfcyxdeoocgouaagaxohcemeoafaofyazaegxugodfydmgcdxhmhxxhofaxuhagmzxmxahhdguxxeufcuuhomyzagyfoagfyyghzohzdcyecmmyyhmdofodoaauuyuyuahzamuahoaheyuocdzmaazccaxyaazxaumcauxfuyuamdczcmuyumadagdgzzuadaecyzcemyxafuhoadooyddzyczmgoddmxhmfyxhggmgfmhfczcaumyfmofagggouczxuoyoafymyzefooguzuuyzagexuuhhcazguomdhcxoohxueuuxduumyyedcuyfgoyexyaccfazuhdzcmcmeucozcxdhoazcfouuazeahfucmaocdcmzdomodfyudmaedhymeoxhagycacdzmfeaoeyxaacmxzecoxeayaexxhcydfeegfufgxydmczgudgzxozmymuudzdoahydeuyfydfeghocyuzgyoehyahygohdxomfzgzfxgagafdxdxoeggoafcdohuohyzxaaggmddcggyfgefcamhzzedmoomhumuxadadyxxfeoxhxaoxfmdgofomfgoyodaogduzfagcfxcgocuzazexzeuufehcmgzdgafogxhdzdfmgucycdzyxzcmyeduzhugzoygameduyadhmceuccxafzdomxdyfdyogughfgdmeahyxuduzmuxoxuchfcgeyeocxfzhguufzcdxegofyfhoucazhucxhgdogxyogeyogxomgzyuhemmudgggyezhomgezmoyxuaoggeadfuxoggcegmmadzfdedcucgmxuxmuaehemmaugzagcochfumhzhgzogohoacfcczufhhxmgxzeghecohzazmyduzdudoemaxxuummheufhzeuchdxcmzhcfhgaauxagzgmfmozcmayuyzxdoeugxycheyxouuhcomfudgdmeumhfdaudexeuduozgzzefozedggmhcxcmzzdgumecozhmefehcyfyhdfyogomggmduhcezheuzaodyddxxhuaguxdoueyczcyddmcdozzmhfuygumfxeaduxoueccgfdghdfhohuaofmaecmmxacmcouuehdmoeayxmaggfeccxceacmazexmmoxfemzgzaamuyagmxgzdxzmcudooxzgxxhyexgacxahadccgzuzyzexyaagmdezcyxczhayxaxamaozxcmxchzoeahyozafeouhhmuuydmuohdeyfzfdfehczxefxghfooazzxxouexcauecfdfymgddxoeyazafagyfcfaedxyogahucxgudehmufxudyemzdyzogehuzzufxddoagcxegocuxogmccgoxxoaaacfehuauezmgcdmeayodmmoeozuggzgfaxyoeoaogedafaxcgahazyouzaeooaaoucfxafcahozfyfmxugyfadzmhgmooycxffahdxuhzayygaugdgeyxmydoyxmadmdaccecddedydcfgaxaxxocomyfxamheecdffeudzgoefxxgdzaugeydhuheoudczmczohfgdumufcfeeexccmzzhxdomcgcfggaohedgeedmcdzmcodyuyzzozgyefgczgmgdegxmaycdeamfyggzcyxhhgffxgoaemoauaudaemchxxmgofaxydaouauuzeocfzmomfehmfyxxezouogfaeezodefodmfoogoyyzgagggeemceeecyfcdczacgdfezhxdxefdygxmmxggayxueezaamexauxaxhfxddozczxdzxxxmoeaufghzmxzahuxcaugeeozdaeafmmegoechoczfhhahfeyxymdzgdhhxhfedxuyzccmeuyguoaxfemhzozafhhfefuhcmmozmozfcecmgxuoeggyauhyomaczycxxuogezygeuuddmmuyechazdddgozoafhxffccoyzfmmhczhacyfcfefxdehauazmuxgfdcgugzehhaufddumcdxuhfhdezzyxeecgoxuuumcmyeaezcouoxyofzmhohfdofyyygmhoegcxmafdhfgaheadaeguzcfhmfogdumdeozyhfzxeuegfegegfxdeguoyzcacodmocgaxmudgfgmhfgcxygaecxuuxeufaxhmueaezdugxmgoyagadegceauycgumyhxzcxmggczgmgcdafzdyuuezxcfdyxxfumuxamyyyycexuzmdxzxoxufxdxuaezfaofdxoycgcmmhffymgmhghxyuodaeuygzaoyhcodcdadcexdeazehhuhzdgmymfydzygohdhafzzyaomehzaufageauxachfefhxaofoxxozfcfyeeechomehmuzeufmcdyddcmexudaaegcemoxcdxdmhdgcyfeofuyafufdcyaadmuoxzdaccyhoeogoyodghuggcdagedaoazogmofgdmymzhmmcuhzcgouxhauxudezaffdgxoofeahxooodzfxdchgueuymageycymaozehyxgacxguyeemycyhyhoxmyfozzmdmeufgcayzgoaygghxxfdccmoxumcfchhdyeoeyyyaguffayoegxmzmoueomeuxdaddxygoxchxoxdccmxfcfduxdzzazuchxcocaxzodmxehgffzuehfdmyxfouhzxzmodgzauaydgfczhamzymmahmfhoccuuffhemeefefefuhxmxxzhoemhczgfmmyguemfudxdoxhmefhcougccaxfhecguohxfuhzfaddgeehzexuhgxzmaxozaemyxdzumoxdfhcmmxyggumafduydcyxohfuffxuffhhayyogyydgheyfhemozzoyhozufzeecheuehdymxazzfgheuxouhzucfmgdcffyfcghyoegyfefchzzzuxxoomyzazdhmyazfhadauzddocaedgazymxdyxgahghhouuazazccaaahdadxhugycdhyoazhzmyxdzuoamodcdaeyhyeamxfcaffcudcfdogufdzxhmexxfzuxxyxhomuaagedogyeugafuzyfcfxexmaogyfzgacamuyhxdauoxaoacuxfyeaoaoyyhyfheyhdugahgyymxyfmegcyuudfagmmuffuxoguecheffcgyyxxfymmofffyahecyfzmcxgoadzzuaoaemgeyuzddhmozeazeudmahzzemzzxddomeggmxefhzxhehfxmfymdhzfyumooaceeoogeeyzxycxehocyhddxmyuecehmzafdzyfxgzxeugudhxafdecygxxoezuedeozoxgmcfgeaxxdxmuucuahygxaoghgahcxxyeygomdcfuaoohzaxmoffaeyeoeedghhhhxuhoxgdgugydeaghhxgufmxdmohhmzmuzfchgdmomazdfogxdayxzyamuozgfouxxfaahgudyhyyzuyzfzeycyyfezyoyghuxdgouaufdoygamuhmggyuuxaoyodccaxzzcegxxeouzoyeoxdhefgacagcmhgcouzfdmxhzufyeffhxduagyfydehmzoyuxaomozhoxgzxmuuucofohoofmyhguxhcexdgcyaoccuhhguyxcmhaodgyacdzeaogoeyayufgffugcxxeycfzhuaxygmxzouzfgghfguzmaczmcuhffcaoeamomgfyuaddayzxgadeehzfoddmaxgzgomgoemucydhfyxazagmgehxeyudoxecedugmdxhuzugehdecyuccomeohegacfxxdyhmdhmaexcgdufczmcyycuhexaazfmgegefccdoufcxmezexaxzchuozfoudedyycfdymexdudzxxeyfmxuagzuucdcmuhaoauayffzfdozcyceuyefdfdgdgemmzeydceoohgmagyxgeuyyhddeggamhycczfcfayxeauahouoehhmxydmxfcfeoezohfhdegeegczaheyuozuahgmyhmgmdzuyhcdfmomugmgfyogfodfcddxaxyycfogxgxhfdyuggyeduzyzzogmczcffoxfdaedmmuyygxuyahumfdxzhmehzuhgehfffhgzhfcmhzcadaxdohczzuuxzxouadocuumxuzmyfuczczzheudgyxdeahhzufdmmguxdfmcahagyxfzzgaodcdexmyxmfcedumaaacxydudaeyygzoohxceydouugfaxccemugoxhezzffhafoaoahxgdzmauxeafeuaudzgcdmucouhauzczgfdaeeyyuzyamzuaxchceomzagozczoxdayacexzfzgmocoayexgeufdyygogxuxmyacyaeguaxhggufgeaemydouzcmgdeffmeamfczzgacgxxuezgzgdzocheeeufcufxayuyaaxduozcduexdccgdddxudhdyydyxzueaaeohmohgyffaodxmdouzmfzuyxzfzyuyuayugfydgzexomfedghgdgzyxddfooyxygfoezcacufymcugdgxexamhdfhfxchhffoxeaozamgdmchahumhfyaeeogfzmmxcuamugeuumgghdgmeoyohyemeuadoxhgdofyaeodgfagxhmzaeugdaddeuhfaaxuzafdehazzmguzueadmxhxgzhzmedaffhxmxhccozefhmmodudymfhufozmeyhxafdxudyaufcgghzhofxygdufoyghhzhmzuuzxyegmecauuufeuaeuzgmcoghucxcdmemhoxhgyfcxgyfgeeeuzccemzdheymyxcgoycyxmggaoufcmhuughagfmhamdemodudgfmzgdeycadcgaexxyuzgfhddahcchmxezzgeaouzagumazzyffacyeefcufxazaaadamufafehaxueacoxuzauoxxyoumffxydmzdymgaudyofoahuxxyyeoxxzyyozzhcfmhaxeaaumdfgcyhgzzhdofdduaydzoyyzmmoxgmecudhdfxhcmgezgehcxmgceodecyhxhzegmhagooyhfofzyfxcaehuezmyoycecdgfoyfegxdgumgodzdadahumuocmyhhuxucxhhugfdeofhdfxuzcofmzuguygeuogeegaacyxoggmoxghmocymzgozxuuodmuamxohhcodcczomahaefmxmxhemyahmdxafohegufffzuyfcauggudacuyfymefagzddxzucgzofccgfdzahmgmcuxmfzomzffmzxzhxzuahdyumdhmchxddmmzmdmeguxyxoheyfgzczhfzmuahfhadzaxeomdcmfeoeddxafyuuddocfgedoddzdxdemgcuuazgxzhazygxhcgzfgxecdmgymmfozfxoaghfxdaudfucymumdcxxmfouyxfmcdeddehhgudueymzhezgcxzdmyuudcddcyzzgfohcexufeexhoczocfcyuhyxxddzayfoeyouaxumyxzzmahdooxouhhhcauaeezmuumegxhzdyooyxhcdcfuxdoegyfomzozomxahyxfgggccfxuuggaaxxexgmgffdeaghyudfuhoxfhmmexduuxozzeuxdmogfchxcxyyygcyoxzdoeugazzxxdgfheagfmcmefgaffzgcczcdeguhocxacccxfhzygmuhyzcgoazcooucmfahecffdxxhgydmemcfauzxyfyzmgzxgeaxfufdfyxyzodxfucoydhueuzfycgdgdeyhhgugdxhayuumfxemmfmcucxadudgmmhdxuuhccyzzxeghehdzxeegduxuammdufddczmmcegzohfoyaxzgegemaaheamodchhzcdfuyzomazyxahfxgezmemyfzudyxyeoefhgccdadmazfagoeagxyfefcgozzzyhguuzgmdoyccgfaucahdxehucgydfcdufxfhhgdauyhhhdeamhgcoccfgehxccdumoeacodyezzgxzfuedmhchhczgmzhcadzgceofogdycxcyfaogecgzezdgxhxddghcaycegzemhaxodhzxaoeaymacozeoyfayhyczzuzzgoomghfcdeyfodxdzayggfmoghcxeaxfyfymcxzcgaggyduyxhaoyzxgggdhzhggmhgdmfuzxuemygdceahufhxymmdyagdemycdhydfooofomxgcoaheucyhzomgaaxuumudaehxxfezeaomggzduccecdhgcfmzefuozcufgzuhzfghmoeuohgdagyezcumooadgcumuocxdcdazyfgxmzacugoxyzzzddcoxufxaaumuomxcfecumcfzachcogagfcyxuhhmyaaufmfcafcuadhffyydomfgoehuumceugfexoxmffhuheamzhhmheecmghzxdxoagfyddhfdadyfeoeomhoyzfdudcyzgdhafaagmhuzudyaafaedgaomzhxhfuyeoufmhhzzeahhuxymmoaczxeouuexdemdcyxdcchefxeafhmfmdfuhyhgxfdyfyzumgudfeocoggzfcoofxugxffyzmfxgxghcgodezouduhyemooccuxexhaouodyxmzfghhcafceuguxhmmumfffxcazoooodfgammzhzmxyfyhczzeeeayhfzmdfczyauodamhxyyahgayumhfycgyeaoezmedfcacfezfhyfcdfmxydaczzfouuhgzhcyyaegodhycefxymgoxxhxeahxfaaufaymgyxghxhxymxuummemohhfydueyxggfdyzomheeayazyagyucgdcydgyzhxgaxdeyyamgmuzmxgxaafexzzeoezhfgudycfzgfodmaxaouoocaodccgdzcdeaodzyohauuzyzzzauueffazeacxffdxhuymafmafdezodyucfyuagxcxzfaeghfxgomezucdayfezygyxzuuamyohfxhmymdoyxddyfgyzouddfhfccuxdcaycddfoxmgcxhozmogfdhfehamdxzoexyecmugxzzmhzdffduxhzhazeaofzgmyegyfhdafoueymohymeyumdcmogzcmgcmouyaooxeggumufcaucfczdmezguzyxogaaaegxedydhauyzeuzfmzxymuacdzuuxyfxxmfzmaxzyfexxdcoumydyyzhyocfczzmmfcgfuzuxmyaxuyxgmhfzhofzmxzufxcodfueafugdxaeeuudoagmxadzczhazdfzddffxzaxdhgddauuaccycgaxgdgxuodaugccdmdggccmgahaahhxcuzmhdzcyygcydouahmyyzofffuooxzmyhmyoafcfauodyxxmecueeafxfuhauuoucxdegzahfffyzohexzgxufxhcamxayoexegdxzaghggyuyfoguoumxyehxffcxfuuomydycdeagcxymucahcgxfgmdgfadcmezueguoymzaeufadcfmygeacofexyffmzffugcxeoaeucoeuacafamhmgehzxhgmgedzezeoauymhfgxfhoezgzmgmzdomzgugmcfcuefzhmcdeuyyxafayeyexddamodacemuayxuuaugahhafmxxzgguuyafzzedcczgmeohzxdzomoxaeazhamuahfoduzhxmuuagoocgdmuohdxehuegmuaxufeaexgcadzmaogymeyoyucocxgeydfuaemcoygaoeomaamhccozhygdfuyxyxxxgghuyguuemodaecxfahhxfumayxhzyfhmmhgzhdxhmcxzhaedayduzofocaemchocuuuhduduxyehgogyazgzhguxoeemzdayfcyzdgzhmxcyaxzofoxffcmhydoguyxmzfmoeezcxggmddzozmdhuhdoucaguhudhyofyxzozffmfyouhgczczzcmxemozzoomcuxfaufmzzdoemmyzazfxucumdaamuuxofcdaezozeaaddhauchoufgmhcdxcxhfmheahyhzxcehameaaohcchgfozuhxfxhghfzoaeezchyozyemzmyydcxyeuhehooxxgooxgxougoohuuazgyoofyyhxmghocfufhymmemmuodedxcyxydyfuchyeccfzzuymhygmdxaguafyxxyahzccuzhcczhchfogecygdemucmucyzmoydoxmygchghzcdxhhemcmucgmecahzofzaezdozdgdffxcoymmaxzycgzxddmxfeozxugdahcfhhhcyauffyhhffyochdfhxmaceyhzhfzmzaczyyuezymxdcgghzmfczufycchhuaemfzchfzzogxzghgdhyxzdodfzdudfxxgoadymhzcmhyxguymfeuheezuoeegyzuzaxcegfuaodugxfmafozducdmfmeegduyocudyfufguyxeyohyfoemmfuygudfzehymygyoagofdofocxoxohdefegagmycduoyamozxacdxcohczeyhezcofgauedhdyfgzzyegdhgcmzauoyoxoggmxhacxoamoeemommzgummmcghxefaxzzczygudaghyzmzhfoeocchdamhefdhzdyzacfhdmexheyfagxumgdcefazafzeheafmcxdgfuefozayouffmcaceeadxhddmamefghuxdghecdodcoegcczufogxezhdmmafyceuggodaufauzmmyogfggmzycyfohyyhxxeghmfoceeezcfmagdyahfgcadmhocmfoazxoyedfeoeeommefgxdouzmymcexzucfomhaycfcuzouaozhamdygadaxmduzdagmdodoegzfgydyoafheoemcufehozaoxuzmdxfhczhuueuygcohadcegcogoazzzodheedgzzemfhxyyayxygdoozdzzayhcfxgdommzcgxdeyecggomfeueeuxmodocecdzufyueuugeoguodaumdfodgcdooyocmguheczemymcduuoocdemcgodeffcxuoxuumuozzxuxudmhydazcydxgooxfzameyyumcefgafczozogeofozofoycczzayoueezuouffauedfogfgmxafeedaadyemxauuchxmzhxgyzcyxhddhyeeofyxgzefggecexzddaadedachuamxcxhycgudefeyhcameaymhcxxxzmygxhhfgxmxfdzdyhaazmmfuzuxoxeeadxxugdaxcezmxuaduzzaexxdgzfauxayfmxdazzmgzhdhazmhzhmxyxfeudgxmddhmzodeyfgofdguzxhgffoychmoeuuoudfofdmouzhameyoeuemxxhzhhxaoexyczxfzxuuyzyyadohyxmxzmeygafozduuzxhoooyoxhuooyxgzzadoaxcymaoacdxoeoddxudaozmugexyzuodyzhegmfayzhuuuyoeehyfzmfggdcmahegemxoaxazemzeyaczcahmgeadzmfymeafdxgzazfgmdxoeeumefxduahfhhogeafdzzaeaoayeoauzuyayeyfcaoemyudhexmcxfhgeocyffofzfuzedxuygzdoyauxdgagfuxgghyemmhddyazedhmxfxxecmmoouzayhhehfmgughufdhuuyzgcueudmczxemafccofzaoemdxyazyhouudmcxducoozumzceggmhemcgehgugcfxdoayagxxecddgceooggmddzufcdgfmuogghmuufhehazzchemhxdhzagyccydhfeemzyzhehacaageymdzmhaceoxfhfxxuocexacuhyemacxmycyduycxdzefagozaogzcyheoydmgzafymxmyyzdeuohudcumhehdazcuohmmchoyazzmmhhdzmugfcafdaygammdoxyhefuzhxhyhcguxdmxamyexdoheggyxhochgzmmoemzomyfggueaeomzgegmzuouhdmfazfhhgdyodxzocugmxzfgozyodouchxyhmfmmheaxyczeohzugccmgegcaxcyaydmzhdhhcooucuamhgdexxmaxxgmzfmofafoxzdyhxzzfgzxyuudezuzzguxueaoggmcogudyouzoeehoghhcgaymuhgygaymhxhcmdachdmzffuedaecafhmyfxayddfcxmgzeufzuuzxgooydoouzzdoaguuyzacmoxemxxcfhafuayozgauoxmyfgyymcyodzcoyoccfgxecegdahomudagmdadadacecauamgudeufueyeeeaougdooafuaecmhuzxhfchymcuzuaeedyddyczffdoygoyxdxzgyycaauazdzufeuduzoxufcuohuegoxgggoagazeaxmdhedmcaoghdezauchyczgaugouegcfaomzhdacyhazocfocuhfgxaueecyacofcycoeczfheoomxmgogmoegghaygocxeyogagagazdgcyfdedauahdheadaefmuuoffhgachheacxxhyceuamgeedoghuuucdymhxgmeeddzxozuudyhxxzyfzmecuuazehhuaxmazeheuozfhzfemcuzxxoufcfufgmzcdcggfhgeymfecehucmxchfuzzugfdogfohcofyexuyhzhgmfuamhmgyfxchzfoozyzoxazmghdgfhemefffugexoummmoeecczfoheddyhoudycycoemcuuuygyzygcxxufyuoacayyoxzzhchzcmofxxxdydamyyuxcfozfyufmzaugmxoeecmfdzzuuyoeaeadmyzmghyuoozeceeuyoxgecxaozcdooayxoxyxazhxeaogyhcgefzfuoghxuczucdyzcezzdxmyceeyozumdguxaudxhddhodmduazmfhfexcaxdzcchuggyexucmfghdfdzuzzmaxhoghdaydhhzffmxaxoayfdxgyfyyoaozfohyzczofdddgyheeucuaucduahaeumgmxougoadyfcohyhgaueumhagyxdddxoxzfzxymfaohhmhocfmeucudmzgzddfcaehmyuaduuumfdcfgeczdzzyaahedcaezyfadzydecdyxazydchxuehohchhuoxoumdfahaecyyymcmexexyyzxeofygocdzxzhhuahxeacxydyfmmhgeuhmdgyxedaymzydmazgxamccedyymmehufgdzyyffouauecggcaooxooducdygoezyzyduxoxumdoeuacfhoczfxoxmhdmzyddgfgemdzzcuoxecemxmyhdyuhxmfmxxcdxcdxydfduuccfzfacogaxmumfczoafumfuaacemyexadxxghxzuuzeozydyecegxduuzammxgeeaoaeydffmzgyehmgyfzzzzazfaeuxcxfzxcfeamfuuduzzxxaozaohzdgoecaucaeuyhdydxoceadgfmmgeyaudmdggoazmfxehycouchahzgmceaahofdodxzmoaxyhxcdhaodgyfcgcofhygdcfceedcgxudcohdxfeuauyzzoduuymzyoymmeohzxedffomycuzzuefmzmmmoocaafhdeocfagzaycczyfhheygxoczfyzduyhmxuuzzyzfzumomgacedfmgzaxdcodcxcuuduyzdfogexhucgohdzygoczezhdegmfcuhxmhgchdgxxfxhceyxoyuxhhomymmhfozdzouuedfhhdcoeggdohoafdoagfeoaccxgfxzzfmyomehfdehxzgzhyazdmhhdhgzgmmeohayfdugyxueegaxzugazhyzgcuhfxdcxeuzzxddeycuzxfodyxamheycggfyhogyxuhffyhhoceooguugmacxxuzgmxzayxeudmxaxzhhzooahaammxzadcazhyoggyfouauauoceyomcohxuhmyyxoodgefmmafaauoayedgogooccmxxxdxouomufcoxfaxacmmuooygafcoaxdhahmufddofufxugguodexaxofyxgxfxhxmmcdhmygcgauaaamedcaccuczfgzfmgeeomfgauauugmhmfcmdzhfdzhzmdeauzygdheyddmoxgcggzdfeohcuzczxauueaggouzzoayazcduhcyoceauyzdzgoomdaedfyoauohymyxxzmuzhhmfdxemzhddxyyadooofeyxfoxeouzycghyadxmuhgucgzcafyfdzemfydfogcuumfxzoufzmyfafgcdaeccuymuyuzhffgzzfuuomzhhechcafyzxmmufdexexmxfemgxfgazuccduomhozmcgazgafzefmeffaudfaefoehgaudzfmyouuxeoezgaxehhaagzgmgfxuyddzazdyefdcdcodeaheeeheychuyohdmhhdyedhfcdyoodecadzaxmxchfxudhoeaxeozcheamffomdxocmduxzuyyyuzoxfeuddxzchuuaeyfzdecgyuoxfxafxmemeegxfgofhyymooezozaefdahmeudfouuhymycgdddafmzgyofmdzuzeceecaxxzymzmxedfyfxueghhyooyohdgdmmyzcyzaffmaehchmyxmezgexauzgamcgcauoczfcemhoheeguymyzudxoofuczzcdxhdmdmyaemxfeahydxxhhexoheyomedohggzyfxfocfaamgzfgggcmfghdxmfehmoghgogcyzehozczhmcyhexymmoemfdfcoacezcdgyydcgafoeaxfzhdyyuumdyaycooguzgzhmeoymgacouyahzhxzguuoeohgfxeyzdoucecxfxyahhmheoyfhgxzgehfdoacazzeazyzgammahogyfohgocgyeaeeueffgcefdamxyededxaofmxchghueoeuagfdocxhuugdmczgummfouhmxyufzehhghcdydocyyzgazoghzfgafhmgzfezfxhaxoumehecdguxmodezxahyyzxxffezdmdyeudxzdammgaheyaeougcugdzfedyodmfhagzuzgeemguuaaueuxycxyofogodymxahuaaafuuoxadfmhodyfugeuxdoyxmxeauzufzxfoyzoxgcxxhxezuzcfgdudoecfmxccfczehmyyaygxafdyzmgmecxmxdamzcaxzmoxzuedaxxdmxhegduchmeydfzyuuzagfxxfgcoozaayomxooxazyayzymaecouehohydymmfhefoduozdxxfcydoazzdgeacgdmmaafzaochyomuxyfexyaameexexdcgocmuefygafehxcohxmcchccufzxudgzefghudydxxxzcyahhyheaozaxouhmocuyeuyuaffcehgmmzhgfzyzxxcfuummogdfmgcgxuyccumcehumgmgghduadoyhczuauefxgymodxzogdggcuzhhehczdcxcuygfemhhxyymhohegfcemufgeuagdcuhhmfhogxgcogcgoedchcuddzffyguzoaehffagmugcgozhauhaacfgxmaxuxchhdyaoxocxuzgmmdmagxmdcmozcueaezzoouhhgzfcdudmffgoudexeghcuaxhydxafzydohuuodaffoxzudgudozfuhaeygzdmueeffozhyxgmcuxxdzuofhaxudacdedeeuxzumoocouuazgafhhxmocccooyzoyamymgyxzcfyohymuxmdoyydfxadeodzuggyfdefcuomufyccfemhamoamyxaozezehxyhcmadeogffcexxuxgmoozxygcfgfaofxxaefogfemheedzghfaoxuxzaxzfcudhaxfdzdueadfhzahzfmmehfeacdyfhoyzdmxddxzehuhyyocxggezghdecghamzcgoyuxdodoxzuhomcddyfyyegzohmhzeegzfazzceoaxxzfmachexamyazdcfzfaefguxgmddfymeuzeofgeaazxoycxmgxzfouyuguxoeedofyxgefyhomgczooouuohuaedhoxzaueaaymzhdzfdaehuhcoheohuuyuogoauhmyuhuaefhfgcaghxcdxzohfghmufgcahgyhzmcduyyagddauxcczacgmcaxoxfzgmxfgzmcxyxmuczyxggyduyomeoeeefaeazegdmaoyxycxuzgyemfmucmhxoumxffocayaymfzfumegmuguumdhyxzcuemgazuamhodadozgaxmayxmddagyzhgauzhayygefyhxoyhfzdhazacgaoaumzxumgzfaeofddoygcmamcxcmzcuecexhyzgyyogmdzymayxmomcxcudxyzxfxcddozzoygehogyaycmxudyxcggmccaudgdmfuzczhfgugfcdhuxxdxdxcuhuceucmgccfezamcxzceauyemxcoxcfuuxaamfxmfeoooyzezhzuzamgeezhodhxcofyeeacfmdccmxcyacdfyxaufxgzzygumuoufezdozxzgecfghafxahdehgofumzomhfccceoodgygmhmffaaoyyxdfaydfyucfyfhhmumxfzfgauzxogogzyxhcfcyadeyxzmyxhefedahdadxfuxgyaudeucyfamedhfmzxafmxhueayudhmoezgzouzxegoxdumddzuzoeaexzfeoedygzdxgageaegooxdcuyaguyfyzhzzxeoeuaxyzhcuexfgyxdufhxyofhddaffmuouuodyeayauuyemxcmcugmyoceeuyyaoyfxzgxuhhyhmucfoehxdufgeumzdozheuezfozughaedozffogazhmexucfxcedgcdhghuczmmdxagueemmyyeoydaecmgcafagoazxzfummzddaacfugzeooyuafmhcgfdhcyogdaxeggyduxeozuuoeamcfemgxmzueeyycumghyxegyexzueyghoyumghoahmxeyazmggfmgghfmcafuydcgfxguoyymyyfaoxcdedmxuhxuzdumayghuxxgfeahuoxhxgduzgofyzfyeuxadcohyoyuafyeyygohoxadxxyzfgcuzhxgxcucmcgomameyzffacfumdcfcexayfeecgodmmdxfeyceddodfuaoxcmmdaxhhoexzhgfxmhdayfymydoeedumxgucdaougxyazfcuxfozuzzauahzhafyaxghgemzuymymhcymadzxofyczcgzhzyohoouoddmafzoucmfzuyadefafgmcdyzxmyfeocdxgogddfchzezmfgmdxuzzeymzzxumazazhfdgfacahhcmzxggxffzdhygyzduuegzgdedzafgefmuzmeofdcmudcuhemahoaxoehaucgfcuuxxhyayomxudgamxgdgddgzcuafuxyoffgffoexaymyceaydfdcuchdufuzueeehumfzhyfaeechfgmmudxmyycouyoxoxyezmggugxdzxfhczfydzfcadyuxegmdoedzzhfeohhhmdyyuagfxechyhoaameyuzzayocdedgedyeoyoadyfhcfufdzxfmudfgxcyxeaahueyoafmfemydamfgmcgcxgfzxcehcuudeeduoxumomeaaedyguecumfeazgzymfhycgaeozezxfgaxycohcufoueufyyzhgxcmxoczxcycaefuafohygauzzdoegzxfaeycyhzxgguceyahuamyghuzfyumoyxyuaegzhhccfahhfzgxyahceexzfzxfcegzcueeyexxdouedefgauhmadchmfzumfgyfuamddaaauuzzxmhagxayccgeafuyxaehaczhheumfacuuuzhxaggdayzczohfhhuemdhygxcmhzxxagmmohhmcuxxegduyegdxecxxduhoyddydggexuofydaofzuzgmeaygcayyfezfmuyoxmeuedmodceodyhgcchuzffadcgocyoedxudxaaycyzfxougfuyfozgddcyeahezgueocgcoohoeahyachumexmeayyzodmaahfxeoyaoydhxazcuoaagzyhddugdecoxzohmhyyhxyohhmdggxagzghhuxzumzguuzmoaymcmmhoaddheemmczfuuhgfgeddohgumuchzoooozecxmmzmhucexzhuaozuchhxodochyoaxygcxchceydmazccgyouuahgcgfudxmyhfozfyuemxehuhdeueduogzodehefedufomcomdfdcauxeaodfczhzdmddgufdmfgdafgexyududodfmfmxzfzgcuyaocyoxaoomoxumeayghhyhxhdeguazdydxfzhgdgffeachyomyyzghofohmzyhudeuehayecxfzdughecaaezhzdefhoefadfcxfmmayxxdcyoohfyudfauzhmfchddzcdyaouamyuzuuydyhyughzmmyoduxxghxfcayazxeeafhuufhmeezyfcygcxgxzdocdcuxfzumoyhxgzxyddmefgmughaachmammogyzgduxoahhgefmxxufuyduegugzdzyzmcyedehhhezucuyadfygxmcymxgcegmxzzmfuofhccdguafoufzhhfmdefcedmazcdcocxhdcufaehxzczfaoomfooghfmazyymhgcauumygoxucemmcxacyfofxdxmdehfgcxhhxfgehexazdchfyeuazyumzgdmyxecdoydoomdodcxhomzfheogygghehxdhhacuxcxxcaouahxuehuayfuygeughxgfezudhgmzyehymygoaocfmcgahdacoxccymcyeeyhdhfgeccoyaohoyhmdghufufuedhxcamemyeoyuxugexfhhguczcycohmayfumhmechyoaydcuzyoaxhdycyefzedoxmocgmoazgugozzcecuccyxadfhdzcfymyhuozfaffzdaacadfdmhzyxexmozdghmoouxyddafcozmheuahafxgdamoadaumaxgzxxofycmoodddzyygfzcocycdgzuhzhgeuoyafhgmazhhhddyaxhgoemohugxmggmyhdxyefogoydocuhmfmcdzeaexudchzdcaogecfhagyemchaxdhdyzahgefzuaxzagadxmmyohdomzougzxycocmzmeccogmdgozfodcyzcexdfdzygchcamoagozeymuzxagzoguoyhaamfdodouyzcufxceoxfufoofaufhczhzoauufgzcdcmggofyedcmzmcudmzhmfhcfzmmzaygmzegacgdhmaexmeyagexgodzugdexhdzohgauffahgddgcdxahfocoydfzxfxczmgcgegedyyuaaumayomzyahegzchecozgoemfhmxxdoocezzegdaffxgomhoadhcyxymzmmmduudcmdccozxyxauamhxfycuceymmmemoyzugohoyyggodxeafzmzeomhgazacdmamchygxoaeymmxzagaggcxfhfdfhgayyufxufyzcxfdoezxumyedgaxoxcdghyfxzoegfcyufzzmymddgzacomeeudfcuyfgghgxazozyxhacmehcughhgeagyzydyemomhzfgeufafmxcxuadufemchzodyymahcmyocuauhggddghzoguefxaeuozdmmhccezyuxumcdfffaydguaaeuaefoeheehhauyodhghxafdmyammgauuyfdfxgmcoeazczadhcdhufoofcaazafcmhuzedzyhocchhoxhaxddhgyyogmzyeeumdofymedoxccgexcmzdfdoygddezgzuuzdzecexfyzcccomzaccdgfxhyydffzoyucggadgcmfgyeezfoemmyefohgdfzfdzcyahyaooofhgyoaceccydfofaufoomxxhyoemgxfmcxhuymcfxhmcufmmfdzzaeycdzgmhxmmdfofxxfxdauxaghzefuxxfmuzayheuaumzdgogxfymdghuezdcxozgfdegxehcufchzycmdccefdoxxffmyhyyxooomuyeafhemdouyfxdhuzucdcyxyzmhghxymcaeuueyyhozcacfmmahzuoydoxhmoaegxxzuxzuxauyzguzzeumzhdaofxeeuxceycduydgyuodgxzfeocygzayodyzyduuxmdouhmomcymcefdygzdfmacyexummzcffyydgdogozgdyfaumgdgycoamxhohdyeccohomozoeaxxexydyduychzxhgdoffeoeoouogxyzfhczygaeaxzafoyyxcxmyxddhczfmaezxddmyymocgmmhexehxuhodxggmzgzfzdcfzxugeffmzxahzeaxfzaaxoaucdfhfoemaamexdxoxfdxmcuzuzmyxmguahuzxzyohhgzdyzoammdgfzghfdxxhxzeczccdguehzggcdfeczhoohhhfhfoeahmyfzcdcycazgzefzfaohofcgexhydxgfdcfcmmgfgmoeyuhyhfuaummghdxyddfmffmxhyoxffhfgehgfzzxogdzxgzzyfadggeuezxfffeghxfzfccacmdzuazdaeayzcyxfhaxceefaehaedhxdchgzcczhofmecfeoduzuzczxmxzhmceohgxgchhuxacfmhczmmhomhdzdoychuoeafyggxedzuuxaamdzfacczdeuggdzhdzaoxuxfegcgaoggauadmodugyehayzdfymdgmghhcfohgcuafhhduxaaeoefeyxcmhmddmegaaoaozcccxmxhyzhchydooguyaggefeoazcgzdfaucedhaxcymzyffgccduydeedoeuzeczexduguggxoouogfxxzdeuchfceomgemmzfhazyddegmmgfdygchzzuuooexzhmzacagechzommodogfooxxhcoohmefegmhzagmxxmegfuzxfghfdmgomygefmgodmeoyxccezfxeafafxoacffadzxduxyuemmmfdumaezgmdaohhzzuhofmzdmmyxuuzmhyfuzyghxxuocueffaahhyoagzmguduccoeagxychumdocfzefggyhehufzhoeymycuyyamdeyouexougmxuhxhugxazahumhfmufdcummxmfzmyugeyodycdcfcgxuoumeeycacxuzxaeydyayfezaoxfoyfgdfczcmhaahgdoofzhzafhacefedydcemeoadycmggumzxgugaxuegozycxhfcgfdzmmagegzzeyecfaexexcfeoyheeodxzhodeammgcyhhhmugxgeeuuodyyxcyffgycddyahdeecycmhfcuugamfgfzuedmxmyomfufchhfzuhgaymxzcegooyaxffyoadfogfeyxfuymeuffzycyogxfcfcmfoyazymgxxehmczexuaeczgdeoyyccammfayyfzoocxyomyhmdzoagaazcghdzzaomyocuyfucdeuxzazeduezeymeogxzuyeuohyyagcaccaecugchummuhgxhomdogyyxyeyodgccdzhgocmcxmfdhxhhfceycuozdaduzxxoeohxduacyyzzfzofmzogumfyyoxggzdczmcxougyooyzdfzzhyyzmfudocfozaahomeofacoagccaeuuzaczgdxgxfzohfgcmmoyyccyzaehzfehcddummgffohgxdfzgdexemghfduzfdhgymuzymzuacaozxougzexczcuxexycfzhocxohygfyufxhohuhfaxgczoyhohfuodhuuxhaxoemzamuuemeexzcyuduafugexfmzfohfagyhddhyagmmuzeufeffmcxxecyemuxoxeuoooeyooxdhzazdhayufmdufmzxgccffzauxefzhaeauxzyufyzuggyzxcgecgfhaacmhamaohxhezmhhguzgufmudccugozdfofhyxzxydauheouayeofzufuogdozzhuffyyfeffdgfghduzcchufxezxahuoyhyeghhuyuoomfmdezfycdhgxzhcazfxdmghgmmceyfhzyuoumezxggyfczhhdgmddgoguggzuoogymugdhzxdxyzouaouuezxoucfmccecyaofeegmxxdyoyfgxxxhoycxfzhxggyzufeohgzodzyaouuoecaoxxzmymddgucceuzugfymzgcgoofcydgeyedzhxyzamxzmxfozyxedacgahhyhhydguuzoxfmemxfhzggoauegfachzdemoofoexgfmyamhxygxeoduhuzhueeyeufafzxfcmcoacmzuffdyyfxymcafzeezooyofgyomheufzocfxhzagxmxdmdgzhzeuzmzdxexhaazxohfmhdaoeuddcgyzhhfmmhzfgamhdzueczfooyxdhazeeafdohdymxudzfyoeagyeazyfoyxdffueozoafhdcygmudmdayzgyyydfofuxgdxafofccexdeayofxoazmaoaufzdxcydcfgoomcyyyfdhuyyxxeadhoyafzozzhcdzxdoahoedfocuuxxdueayyfoxfdocaguhzhuzhaegxddxcyfhyxgeufmuohgffgggxcxcuuxmmdfozduhdyeuamazffgeggeuoddzcyyzaaefogahmymdueeycdezamyfhgfxzagaehczaegmdzyuyyfahfddoyeeefafymddyczghxehmuagzhemugmudyffzdmzycfuhmmhgeceucgzohcdffumoaeeoyxmxfafhdxeohdafmhgzdxhfxxgomcoaumcocogacozchyfafezhddgecczucgmmudzuyhgyeodgugzmdcdfyumhfoceaygyxdxdmfuxadoumuyahohfxhoezfodzxexzghdezuufcohmdhgyzxmehgmafyhzdzfuuuefhguoxxoxuxmgayohcyyuufdyuyozdudyuuugaozughzhfemyfycxxhdahuouuodmxemoyuxddyedgcgcymduuuozmudoduaaxfxmmuafahhdxocchzgczhzfgfmccdfcxhycocfghumuhhuofuxxzfmacmyamzoyxghyofazgoegchmmedcozmfccedxccgaddgymudzgfgughxheumafmayexggexhhayxdoyhygfxfogfoyzzzhogudyfczudhmxzgyfdzcczfacfoghdcuyhfeymaehhmhouemxzoxxecoyxacogfoudoaoucmafzazuuahmmgmmmuagueehacdgxaoxzdaemdyudydxdydozfzgazouuffagczdfcycucxyfgyeaufzxoeuhxyecdomyguzghddfgadcaofgfuhozcumgucgdzxfahdmezfceygmxaaemoghochxyyhuyuoygfeyeguhfhdxxxzzfddcufxhddmycxofzgdhoeuymfcmfxoeydauhexefedahugffagudoxffmffcddmgzyxahuzcuyafcfyzexdxcgdyaazgcfzoggcududdzeohfchxxgfhduezadxyuyexmeadafucodxfgfhzoaofggeggzoduhuaxdxxfyeedgaghugzhecdyfyxfmymgfzfzffzddhgcmhfzogudaxdgmxazfayzzdgfumhzohahacuzfuymdeudfxycaczuucegxummcfzyozedddcacfagggmccomummuohuyfhoaymxhdhafzyueyxfmgaofxcuyyaedcoyfzcceogdofhyxgdohxyymhzomdxfocghdummoofygfmxmdhocuefoxhzaaexfzocxazmgcfazzxufyyxoyzgafcfmomxmzhmgayzdafoezyemfeahzfgazghgcefdaoyedgdofhhfyfgygmgxyzxxzeaufeoycmezyduhoxfmmdudhgfchmyzzfecufmccmfcoadfxmoggfumxxxcymacemdzdufoeuzxammgffgezohhmdxzzyyuxccofhxdfyoyadgeehzamgucdmhzemyzdmfycmaodzhuyauxfdaoxgguecdzaaemhccomgohcezcaymodmchumhxfhgocafeyhhumxzyfghhahcxxffzxuoyhzxcezxfhudyexmzfcgxdfhoyzeffcdozecmgxoheyhoxmmadfuzhdxmymzdouzcfzgafmdmycemmdoeymuzygeghfougcdffggmaahaeuyzhuufhfmuxxygadygammhhofodzhomefhxuggcffoygxcgzyxdgcmudmyyduuffyyoxffzaczczxdfczagydoyamaoaugyzohuzdagxxedxoyyxmxmgdzfyzzzogazezhceohyhxcgchyyamoxuaefdxxegyohgxfodmfyeeuzmadohoeozeadooeeyfmmmoyxmmyefacomyfeyfdxxfeeoxfzoafyhuuxemguhfyomyhchemefzguggoazdcdddzxyyzzfmgxuaoxouxxoheyauchfyzghycexzdccezzzfdddxyxxexodefgumcoecmmxzxfcdfmfdeofedacadmucozfzmhymxzxguhmgdhyhfuheyddmcozueoaoefhcymcghodgguhgeogamxgucfgoxgogfduzxofuuuyzhcmhcgxmoxhgfuefgfdecxmzacueaoooauoyfgazuaycfoefucduueydaozaemxoucuzhxxogczeyhccuzzmgzyfxaxxmofdhaodmgdfxxhedzmcdfxaaycmhmxofagfagedfzuohguhydzdzfdyzhfahocgmeuxdmyfamahyhmzuceoozzoyaxuczdoudyxozmydggcyfgezomdcxmfcfeyeezdgfamfhzcchmfuefyggmdefxodedyafaaydzxhdcogoygfhhooyfhmfmeohhyeceochmfudufyydaygmxyyczeyoofxycfdzfzxfzyhdaazhxazdahxuuxuhxcdxzazoohmhzhxhcmuohmmucgmygfdcgafexygmefumxdhzgafaoxauauyuezmmhamuhyzaxedzydycuydmfgaaaeofucfhzuoudehfemdxzzgcxcaheyzahgcdefffdmhuhzyyygudhyoeacefdyfhgofmdmcdcmoexfmyecuuhdaezgxdmumyeyduazdogxyuzzfmdmccffamxdxxmggamxcafyxzzxxdfmgxcufuedeufmdggyadxzezhauxdueyhxezaeozyodfmzzgczyddgzyeczmcygadmxxfdzzacudfexofegumcmxfmocdumzxzdmumodxafuuhmxzxxxfadfgxxehocyazmmcooafuxyfxeycezezozocdzzoguochoecoyaxogcozfxmzgfuyydxcaoamxccxucxzuedcahudezfddoeuhgfydcehfcaexcxcehmzghyxffooaamggaxhxhamuyzxmcmuamxxcxxdzdmzayhoxfucagdecymmmcmffyxcgycuaohmfgueocgfemgeugmgahyaomufofhoemxydoudamhxhzmfdeohgoefeyfzcozogzyefeamdfomxyyzfxgayaauauhzoodffoomeuzhdmxcmhocexxchmfddodyfxcoczeeyaxayommyuhaomaefhymeydhyzzfdmyxyhodeoxfcczzcfzdedxgeuhhfxyadgumycyayxeyggmhydxfhmmfgefmduoduhaooayyhgzmzfeuohzfeoddmffffycdxafmmoaezuxamdfdeexeogoguocfezazzxauoehdomghzydugzozccdgaczzgdohymazfeeegoaffehmzxaxccfducygfzfmucxuyfmexczhymhefcymdadfeafzxgedczuuaydoumgouzxfyhgzzhcyoxuamfdyczcymuxcxgugehhzhduxgemoyxdzyymauzcduafgyfhdxhddaxdcufzfaayomzeyuzyyoyeoffodxmududhedeczceycmxmzdxmgmomgxdoodgeghgzeafahaeexhycmuezxcucdfczuczxazcffgegceozxodcxyoddydudmfgmdcuhzceoamxoocczomedxzoyaegzdedccgddhayfdyahgfeadoefguzezehmayxofededfzxdagudmyugchfuyzyadccfyyzfaxdxxuzxzeydczoxoyyzzcfohyouzuuaxxzycfaghaexoyuemhuuacyyzfgefcgghzymeeeeoghmcdcaeodedmeyezhfemhyffghezhudyfhzzxddoccocufozmxuofdxgfzcchgdxheyggyoozeyaefoddocycoozgzmxdumfodmdzmdoezoomoeggxdmzcyxycmugxyaycahhdcgexhfuhfcadghguaouezdyfcmzhoyhoehezgdhhzhxceamycochmgzcmguhxagmuezdghfgfycchmzxxuymfxfzzmumughhhgcmymuhdoaudaguomucdufggcdcmeuzxdmfaxdyghoyyceceocauxommogccfeafygudzcggcoeoommzfygcumdahoezuhocehuemygxxcghuufxmuzdomefffcmzxdemeazyzzazhgdzceudyofuegggycegughhmuyogghumdgczfdcoheahhfmmgufdhefdmhooucafofemgzfegefxeduuaxxyfdcmyagexamzycghdfmcdhmudyzymuaamyuzmyzzdmcxgcyxcuhdxeecauzmemhmfochfuzmodezzfoymdfammdygemzmzehddfzgcddfegdcfzeyudyyfufcdczhogeyhycxoahxfmdxcygccxuagaegxagffhyazamccchmhzuxdeacamocaegcmmfyghmgxeoaeuudzhcudyzhzuufmyddxzzzgcgdxyxmyduogchdgdcfdchmemmycuacczgfmmuoumzhofgazcoooaemcdxgyczfdxeeacahfhgcefxfdyugozdaxefhohzmeomummoofzuguoayxgzoudczezdofhxydfczaxdhufxafdhoyxmmcuuaozocyahguczcuhcuxegcoaeauzzhmydcfchcufxyxyfdmyxouggoygufachcazeofofzfugeuaxdzgfafecuzhdcoufuaemdzymoaaczogyhmghoehzmhezouoheozfmdgxmygezemzdcaohfyddacmhyxfzmyeafgecheddoocyzychycyzyfaecyuyghyfycauzefyxfuxeccfmoemozuczdmemxzffxmyhyhxdafegfeayugegdxmgxyumyydyyceuhghzexxecaxyouzuoocfmzofcfgxmxegemfgufgdmfufayozdxzyumhuzacyfcxdxzyzxfzzxugxeddxfggmzdhmgmxxhxmomzgygxdemcogohyheeohzgoxfexmdemycfczxcdddmafeofhoemcedcyuagzhhyoaaxhahyahymcodzuaoueyhohhzydhmyoafcgzxgcffhugyoyzhyxoxogmgzgyfgcuehcuzxxcdxzcecayfhaueguhcdymxgdeofczeoghcomdohfzeufyuxfaoccgmedazcfygxzueyzcxdayccoxhhmyeydcaeggfxygmfuchoemfgfoodhzyfdccudcuxefaexxdzuyygzxyzzedzxcdaehzmaeheddadhyaeafhuugdcfcgudueeddycooyodocugyymhzaecodmmddzeaydfyeozemuoezyucudadmazmocyogdhudmhxdhudggumayygeuxfdozhhzmuexodgyxxyfcfuefffadgcmufduuuyoyuyfohxdhuxzuzhhfzycexeyxfcgfmhyzddhocacocafuuzcudcuyyzfaaymcayyggcygacexgddzgaecaozxgcdczdygzfhmuaauuadumhdexeufxayoeccxmumghmyxxahfdcdeuezzxexghgaedecmufyddazdgyxyexffahfyodzodaeaudccayemyoumfaxdxomhfgdhfdmyhyoxacxhdyhuzczggaxymaaugchdacomduuzzcymhgduexfgucyhhgmmyozoecxmhycaoefhyafmzmxxxfofmughfxczfxcfdyggygyozufzagffgomefeduudmmfzdxfadyedzhcaazcmxfxfaxhhfxeoofhyayuzdceyeeefzhamgmyomgdxecuzmuyddgxaadahheofedyaefzymfxuueueozzgymahuhouhomyuygggggmegdduexhudhefayccgagdgueyezyfcazhfgayfxooyxzceexaofyxzyuyeggfadfyfzxadgdyeyoxczdfmehxcdxeafazahefgodgehgxemugaogazmaodccgedayazyamzyuofxxceucfcohzaxueuzdgeomafuecyyfmuhzyeazdyyczhmxddfcaeuxydxomfxfxxymadzccxgzfozeocayeagymgfxxeyhczoghhzmmyuyfaoezccyoagmomaeyamghamcfxzzgmgacyhfhghmgaamccuoxzoxhmoamaagdhaeygzuaddudydhuzecoyaamzdzgouuoezeozdyefahccamefdcommczxxgeehhugeheuayafmuudcydozcoofdudyxaohuhxgouahaufxdfuzohggoeoxuefuhdmocagyagymyazzoxafxuehofuxyzfzmzdzuaeaczegmyohdzcuaeydfzyedgcxaufcdaddmohacahomuffcmomzuzamdegfhmhocdoguyacxahudmdaohemuoxcguohcumhfaeucfcdzxegefogmcxoazofgmxmyfagyaggodfgzgfumzuuhdxexfcgfzdecouomzfhhfuhzmxfdcozzedeczacochmhxceddcchdyzxhehecdhxmcdfdyxzzdeoaazddgofhzaeafcocgfyfofxzxzaczcxzygmhxfdmxyufgydmmmeyfxyczocyeeezdxyfuczfxodeohzgoxhfmdyzzcuafazdceccafemezgyxxfeddcyymddezzfxgccffgagcmxuadahaomyzhfuyoadcafxdeaceehezhayzzdxmgaczzxcyxmcodugxudycafoechyezzhgzxxemhozuhomyudgeadggayaauuayoouhcegdoyeycuocadhmhygyxzxcguefhdygcocfgxmfmufexmfacuyoahoccmouhadmxgaddmxodmcexygxaohmxagxufdeefzxuecufuxagcadffeucdxdeddyzdfohdfgfadzfzhaxzyoyugcfgdgfzdyafaymmxzcuhzayzuoegyhzdxmcagyahmmzfxdfaeeuohmoffhhhxxxfhaxdccuuadyxehemhxozzuzyeeychcazzgozmcxeygefhxzcagfommghdmhmyugxoayuoxmaozhdoumaxeeememezozefmdaomfacgefhohuameymfocedeyuzmhehxomohoufchddhgauaozheuhuddedyahuxmfyfeczouggoohemooeufoomecoycoumexhzmfezfgohzyhghhygcxuuyxdoxcuaxcmfdcxzhuyxoydhchzdeghyxzmdyxdzueadmuxzouaaaadeohduofddehmehyygxxdoyyegfcamxacoezummeuhoegcaofxfcxzzzxgayzxeydegefmyzacmzmyhzmmzahfxzooagmzfgzmgaghgfexhdhdmcudzxcgoxymxzzhgauyygfhecfzmfeeocgedzddouehcoydyugffhhhafzdffhdmgeacgohfmxadedzazhyemzefeydegegxmceezazxocudeoxxmezdygcgducchhzoghcudhheexuyghdacdzgfufommgxouuxxhmhuyceuayuzydhxyguaedazehceumfehuyoexcyfzeomoyydfzgmocohaahexgfgaugedcmxfommedxdmaodyafgdxeyofhxfdghgzaeeaxcgmdxhedfyhzofoxymzozdmgfyxhefozgeamymczuogoczzaocxxaexdomaxoyoduexzouzmxechhooydxuozchyyumdxucyxdyumaueoxofmoyoxcocyuoxhfodxaezofcyedhomxuoofoyohzzzgaedzoaammexeazcezgxmeuxyxefcgcfdgchyfgudaceguoyfxcdhhdxmyzodmxcxmuyxomzyhxgxczeuuhemagfdeeuxaxfgzaahxazmacdmhgyexaaoxxmhgmyggoudhghcgyduxdhudgdmcgmafmhauoaxafcmfcfhxohmfmfxumdfgmzocdfouyguxdcdfohuhymhceoduuoyuxgexcaegdxmyfuydxzccogdummfegfeazaghefmxchcafdfezfzgymuozgfhhmfuduemcooueefadafhyhommccuuocdeuazmhdhzuumdxdduxfduahyaehdzueudfuagfaxcfamdmzxzzchdfmyxmamzydfahzazyeamzhhecomoehumaumfuffuehemyydemymzxdycyxhfymofmycaygaaemezueoguyozumyxgzhogyxyfzczamhhufehmhcodehuezfmydxcffzhaaczauoxxudhhoeaxcxgcmxhyyhgemzofuumudehcmcaxzoccfycxyddzfdgagmxcfhzfmdyzoxgdmeooezchecggczecffexmoxghcccxxhcxezzydfhymahgommdcfxxmafuaefyedghfaoedemezzmmedhamzcyfzohzucgfogdhcxoygdeyzoagccydhfomahhhgaoozxyfyxhxcfuyxxaayzczdofcmgyffzufzfgodfoeodfzzmegfcguougamgxxuhdzyguugamzdfxdzzcyhxhdzoeduxghmddmxyohugxdmhmgfccxxozzdhdumymyuoexmdccxxxehhghfocxxyfymfdzgxxuyaodyyzameoamxceueaxhafodmooudhozoddhehzuueozffhmxyecmzoyxmfmuxydugozcfgumfmhyhxymauzauogddcgofghhgododzygmdyzfdumuhxhaecfzguacumxmafueozfmocxmogxeoehfuydahzxxygyyxyezeayddxymozmxudahdoyafazezfeaozaefoyehoodyyumgmchzmcogfcfgzzdzmogfazhzcagmogyyycgdmmucxaymzmucuygeczhmoxaedhmmyzhdyxmffeodychddmudmfxxagzamhmdzccyyuocycuxfdyamxueozymacdcexuaghgecagdozfzhzemxdeoxczgeumafyhgomhdfzdegeycyyymuofdccoaeugumdaxhdzcyzmffmhyehmhecohhcexfozmeyyhfoedhmhgdgadghmodxefamhaaooduuzofemczmffhdaahcmzzagfzgofdmyofzoacxgmzeexdgzddaugdauyfuahzcohmgauzagyyzzcfyggoyuzuoaaozucumcugaxuhydxadehzaxmzaeddmyuacufoyggfzhmoagzygffucuaaxoehmfzzmyyoyecamegdommmhxxgxdggogydfoouxyxxdxafexozuhmfhyeedceyxdacxzoxeeohcmyffzaxxxeyhyagcgogggzfxhxycafoumuzumuacxxfhugafyzhfzxaxxgyadxdodxxmzgugcygyehymdmecmfaazoccehdmeeghafzmoufymxyzuhdfdduehyegdghuuxyxhhoggxxudhcgdmzeeozazcehxuyxmyzgdohmeyxyxccxaamhzeugdazchccchmyeuhumfhhouxghgeaxhgxhcaexaufhmchxedcmgohogfuzofxhgczdaoffxzhuyoezheefuhduhduafmeomoegohgyahcmxxghyozodaeuoxeaxcxmecaegcemgegamdgedyodxcgxgcyocgzdyamhfchzgyzcuzgxzddgufgzoayhmzeyoycyhddumccdzuyuyfxaeudyeyemoexaoexmycmhhhmaczyayxogozayoxfymhczgudhcgofxgeofoxzdoaayemuexaaxyozudfcxadzgduygcgddfzacycxhhxdzehdydaoydmxucogyzgoeaxfyxyzhxadhduyoaddczgmgmmgafgczozayexadczezhhfxcamxahxxxdgdcxuucxuzaadcochmumgcxodzugoahdzyxcfmafxffmmdczyxuuoheeuuxhxgezxzacmohdecoouxzcxedzgoudgmuecefyemcxmeaumuxayhehxaffygyocmucxdfxfaycxzgzzfhecuazyyxfgxmudyduyuezyuofoacagyzudmoaxhyycxdoexcfoyofzuoaomuzamzhgcghoeoedddeumxxuxcazudhdmcfzoocuucyuchhuafchcdxfezyeuacadfofxcxfagycugfgyaehugceazahxxmemxyegadyhaudhefozxxxyocyfeuggfcmafzmozyaefoeazayoagfhzgecmacfammyugmeduczxzcxogdyoofxfyygmgzyfeuydfhfmyzzouegoymmydhdghfafhmuudxaauaddxuhceaozugemoadaceemufyayuyofeefxddmexedmhoecmzzycouduycmcdcmyuhuceohhdczfxaaddceghaogayfmemdgxofagycooaaghxxoxhgemydymydfgacaocaxayfzczedoodcmaxuoeoeyymooyxygeyahhycxoddgzcdhyxchfxmaymcdehadgymfmdudhaofzuxczyfmahadeofdefdhmxfeohcacuzdafamgyucxgyucmacdceffudxmgucoudugmumxheccmdyxmmffaogoyczuyddxhcyxdogfaycgehmdahaxooafouhgfhoczdzammumodoyehfucghuhxegchmgaoaghhyxzxgemzahaffuzoouumcgmauzhyueaohyyoeamgahzauamfaeydyoxmexyydyyeodxmhzfuouuxcuhfuaghgceeuxeyzochemycfafuommaoxmooxgygomghxhamacohhmxegxuoufmzhccxgyddezeccxahdozdcefxuccchfmmhccfzyocmmhdxhfzohuazzammyzgemhcxyeozfazmdzoxzeacyyuoazdcdadohgmxadxfdcuaexzayedadyzuxczcxgxuheouddemaeeudfcyegoaofgmuhcmodcoudczzaaaaggyydfaexheadudaogghcdafcocadaagdxcxucgczcegcehzxdozcmmezecmdgugfdfaxcgchggcefuhahcgyyzzcazheeuzxdfoadoegxdedgugcmgzdgcufmxfefcxguoudxghhmoydcxmumohxcmgeuheuhfzxceeycxaggecyugoddfyyfhhoxmygzexcoghyhgzhuyhydhyaymzzfydeedumgxxegaymuymguugxxxeeuuezfmcmcedafgezxxmyhayychaayofgcmaxfdczxzeeoyofezmemxzufydmzmdaomadzfdmzzemhyxgfmgzmucamddefffccchochamzyfdzgxohacmxmmedmcaxeugmhgogeeoahfxfzhdhcycmxezuuxudaoaehxxffdyaygcyyzfdzgyoozxmzayxyamyzcdeuyayhxdhfcaxocfmfuofeayxzgxahxyyyzuhggzfxzxdgyzoumfyocchzycydazozmfaudumfggzydfdhoggdymcozoeyheayumefmcgyugccgcexzameyayggdzdazzfxfuhzfamyazafgyyfaueuuauxyafdcmeooauheghzamzzuxxcmmefooyhhmhyomedmaahdoxxyguaahmudeuomdhmuagyyxoodxuydfyyumauufufyudhffuxeofemzeazhfadhyfhfuauhuxaozeaxuedgaeuyoyzauyhefxgzhcmdeeddxcozgumfofhxahmdaaceomfoeagaxhyycuezaoahyfccoccadfzfofdemuccfyamehmazfyxzaeyyugczdczozuxuzfaaxedocufcduxxfehmxugzhmymxgzzxchadmhxfagexohxdxfcazydmfmxfuzohoohdexmzueyuxcuufaaodzcmfcfmeoeudxhccugahegmexfzoufyfdhaccgohzdaghhumueyccacdzfymuuuaomcmozcxdzfmxfzccmhxxfomdgcmaodoygyhyecxfhayzmgmuadouuxfcxyydazdxxuyzmdeyxoufzgzaeazugegodacguoxzgyczfuzemeyfyodomduzumeazfaoaaydfdxdzoauhahchfggouudyemzmddeehmyzyxuzuyuymdahmfzzhocmgaauymyeooozumyzxagmexucxdyamaxmyxaaeeaguzeeohmyxxhfofyfamaafeehoydodmygaafyzuxhummgyafguggxxommfmuehxoefemdfuoguzzccohfdaoecffyudfeumzcuygdouzezcgzymhooxedgeouyhdaxdgzzxuoudmeyoozgyazfmuxxxhmhymyxeaechgmuyeehcedzezooxzeaeuyyfxmhxgdozcmxadxuhxdxyzmhodgezxgodxoocxufxddggyzhddzycohdohfhzgxfdfgmcxahuhmeuodfeumdeddeyhegcfhdzgcfzogfcuzceyuoddfccdmehdezgfzydofheeoffegmeogyxhgzhomeyozdguauecccgyaeamycozadczaouehxyeggazdamgdofzumcummxcdmfghuegyzuxydhhdoxyxggouffdmdegehcxzehyoahfaoaxmfhgeeoazhmmhmouxzcxcfdcgcocydaacddazhhoyyufxeggdghyeouodgyzdhygaxhddafcehgcuzymxagdefmdemcdahmzozayzfegeeuyaxmdmdhueaagdfggyzcmuxxffudxzoocougocmcmxuxuxufaeyeocegyeacedoagfcmzoeyazzemzzmoexuougcahdxaommezfmfheoemddahhhxdeggeaffymccezduocoyygxxcfahgfemhedoxozagfzgxxxmuzfmfuuedocamcgazcmgyxdfdufymdhdhcemggmoffcfhhyyazogmyogoggcfyhhaufoxagxogazdgdgohugdfaofdogazcooeuhumxhaxofddaoddduacxfohxogaydhzmeuycuueuohdxhaaexfgogmgfxahechhfmfzxxxmuogmzgyecyoohhfcxadayeddydgdofcmuyaufgzayozmedmofxoueaoooddgmyhdhocdgzfxyfaeumefgogczxyhfmexexafouxmdzzyhaocazgycceoyfgymogyddgyacaafueufaofueeoaxgoeexxegegfgaxcydgdyzxxmeexadcdygfaeeuumyguxyyduafdzufuczyuazmgzehxdugmoyhzcfezuemofdgyhcueeaxyfxfgagxuzcoeczyuzahygogmccmexgyzhadogcchzhmyzdmxygadmeuyamceydzyogoddzzhhcmumyyhzgdhcugugfaexdfezcmygugmhdamhcmuehcacxufeoeooexfxzeagymfadayafahhodoxmxmceohouohfxezxafmuzfmemfafuggyoxagcyddoaygzcyehaxcaafedgffogmufgoheefmgayuddoaeuefygdcmzedxhmeexaczoxhmgdzahgcffdufgcheuzemdgamzhmhyoazzyhxxfzfczeggmguoggugauocoeehhxfzegmccdducfuzgyazzecdaymggxmgdyhyuxygzfmhaccohxuhgcedhauoyhoaxcxazudfaeayodcdudexcufxdayhuyfuhegyoduaxgzmmaghmcudoeuchcudohhfgzogzhzfmgyecmdzxegfuzocgugzefcdmmuczgxdfeygmzefhzhamdadcfefodmzdaouggyxffuemofemzmmzyaxumgefxgheogxoaxzgyfudogaoemhfeczcozfdhfoamxddhoemzadmgxfumueeuyghyuehzgxyzcafcdygoxmcyecccgghzxefxxcxgcuaoxumczyzcazfgymueeeoyxogycayghxfuzyahdmfyfmudeuuzozcazfxgxfzdzxcxaeeoomdezcohhcazyzaaoamauuxaegxaydfmeguddaeaozeuayfhgmxggeeaxhgmfdfmfmcaxcyymogmmuhofcauaufuhmyhaaxmhdeggaymuhuzfyamhumugeyemdgcucyexeacgydmhghgyucuoyyoghgmguzuagohoahyumceyoahzgyzcohmyhcehxezecumzuhxfmchhezcgfzzxggdygmyhoezdczacoeddggdgcacdydauodudmochaxugmydgxdhdgdacccdyhzhgyfzyfeudghfxxoduhghxddcumafyzgeoduouxeadzohmahmfdgdaoxxfegoeafdhguhedyhaauayyeaegdfhmzyfmooyhhyxououudgzuyfxfzfmcmxohfceomcczdfzadecdddoxyfaaocfoudhdhxmhuugzeoymoegoouzfhahxdddzumemcfofcyoxudcuhxcehuahmdaoadcdygxhcxxffazdgfooacafgagdahofcoccmxoemzhczuegamhmfaxxcaagogcfgdhydohayuadzzzchehuuxxodechfohoedufmfogmhfuaameydgomacyzzaddeeehgemcegxhfygfgcfueahhzzhuacaaxamdhuzeuguyadgyyfofueuhygyecfxfuuhxexommxmhcgmxzueacmhfuzxmeomazyxzfdouafhuocydomddymchyczmdfdyumuefufmddhyzchzfyfgfzfyfaumeguodugeddhcdydoeuammumhaemydgfgaacoadmhxczufoeceahgdudhggoyxhzgeemhmhyfcccgmdgfzohmgxxyohxedacxhuxmczduhfyuumezaomhyxguxyyegfucyuyyoueogcyxzoommzaeaodoazyhuzooyyouzzxzyyfcoaofdoyaahggedefgdxyyofdaxeueogaoeededmyuuzyffhcmzoogoudhydgzomhcfyxaaffzguamfauofezhfxfcoyyhzceygaduccxdzxummghxmeemhfecmehmfxfoudfxufmdffoyfdycgadoudfuddmhofzohohdeeudxooycfhgzgzemdgohyzfzmxxyadoeemffdxhmuxeaogzuzcedoyoyaddzadczeddzfoggyoggexfhdfhmgzdfeucdmggxhdagmezggcefhzfhaecycamudmooocuomodoemuhzzaxcfmdgcyuazmyyaffchyodedzgzgzegfuocmmgzxmeechmaoxhyeggcmamhmcugydxfzaefyfgxxuxxfggmeecfcfccaceudcyhoxuzxggmgodzuhmaofdyyfmceyozdfcxdxcyfxucoyfaodamezczocxyauggemchegzdgxmfghexyyffuyxxueydofaghdxcozmfxcumuhzgfucocedghyfyfmxezcyzacxhzexmdgyhmuocddydoghxmcahzgohgxcgezxghoucguoumuumhazhdeogcmzdhcgoeugzoofczgeedaecyymzgfchfoefogozayzaydxfzfydfyczomomccdzxdxdxufgffuoxcfmgahyxgxeyhzuymgxgcdczgxhxaezfcmfodumzcecfcufamugoycodmmxyheaxeuchmuzagfczegydhdxyozedxduexgdfagxgomgffxxmzfyugheayxhugxfezodyhohydmchhmxdgfzhexcgmxffeuaazedyudddudaazxzhgyogxaeahgxuzdmhhaxudxmfooggfdehhzcohymdmodacxxeuuymuafocfohoexyhxagcxdxefuyzuhyxezdmghyzzzfuoeccmaufaamyouxaccezmhcedxgxmhhadcexzdgmahxhudmgyfdaagefhfyyaxxuceyfmmcyuhmgayghoazuyuduaduuadxfgdcmodhhzgafmehcuaxzzhyccaeggzazmmugzgaueuogzdzxyfhmfayzgfhfaxmmeaemxceacyxdcedcxayuggggzcyegxyuzfmahzyoyyhudeegoafyohhxzcxcmazchoyamgaaxdfyydzuzfcoeeeazoueaddmfmzzuoffecxxxecaeaxugceeagdeyhoayduduygehcoyeyfahumueczxdmdoafmxouhdgegffuzmhuaehgfhdufmuafxeymecfymxamumdcgfdzeauacuoyucgdmoefggadogeaahfuyuxomuyfefufzohohmmeeeamaachgemzhgzmzogazddzhdxxdzhoegxycxmffhuuydgagdcadehgoxgdmmyfogdhacxxfuymzoxegodougexzcxzfgacafzygaxuoaooyacodfxaezmagguomfouufgguoxmczudgodafxegyogdmfodfammdxcmyeguxmeccmfuezgefyzycfefmauyuzhmuomzymeoddedhydcfgmcxofgcecdyadgzdzegfudgxefahhahaffxdhuadoeacoaehzhofmmdyefcyydeemaudfhaouzdczhogmhmzcxmdaeogexhaxdxgmcoxcczyehaafhuooecchoumoxueeyuooyechxyhuxgzaumdduamooaxycozdxoomoghgcydhdgydyzoeoxcdxgdhmyzhzyccdyzufgefdzydzeocuxgcaeaxucfydfhgeumouggomyoagoocoogofmoyocxedfdgydoaggxaazegzdcaycyefocmofzcexfhayodhhagfugmfcmxhgdoyyuxcyfhhughzzfuhzxzoadyemcmgayccmmaazezxmfhdgxhdzeyohmamudhhyoaegayhohgzuofumaeoyamgchdgxmmduzdeozhaxhyyoxuyaamzayzohhuzgzodxxxxzyaymgxmzmmaxzfgaaaxmdceegcehoyumccoouzufhxhxmomohazzhdchgczxeocoahudeuohchaocxdhozehezuxgmaymaxhamdxfygfxezxudgucxhaxauyudhmxmycaozzmdzmmdecozuhzyofcyaehdagaygxezmcuaxzughemgogfofgfufaaexeyyzohdgcadyxgzucudxcoygmxzdaagzaczmuuxdhfuyfezmcdcfzeouymgyfghzucmzzdaxecfuzcuezhcmgaydumfmzafadgdhzmxoegmgcuoucygfhumxuhcgmfugehzmaxhafeeacxodzdeyhozgzzzouohaycgyuxucdeuyuacuhmzyoochmyaexmeaoghoxxymeechfeuzmzdedufyzxhxachmmcymzhxefzoggxfgegdyzughezzmcgdzehmuoydeccayexdmyghufogyeumdzuayumufouhzzfeeodgayfaofggcufhxoezocazcuexeccfdxmdmeghyuydzaggfgcfmafgoommagfcyhmhyyzmhzufcufxdygzyezcadozxyeuaffxzzeemdcocogoczmdxommgazacaexymuhmddhzxzyhyxghuezmceoddoufuofmhauugzuexyyadudaxauucaagfhcommyoeeezfyfedoauzeyuhxgaxeghzuzhxodafxmzcoxdoxxhgdmfchagdomhufcuzdfefayxhfcggeeahfxffdmufgfmxhzhzyuezgccmuaczfuoeohmdmfgohcyemucgofzuuzmafddzdcgeuhaedmogcfgfoddzycczaadmxmmueuyauzueomamzxhxodgmyomycofxymgemcxhdycuedaucyyuahuogeufxdgzzcxxmcaomzzzyacxydzycocyocczzgoegzmyocyfmhfzdhzxzyugyfcmodmumhcoeazxdgfeummcgauyocehudemgueezcugmexoguyeyuddeugcauogzggceoufmzhgzmeeheehdzgecyemzfgddcfymmdaxzhoazgeygefgmzodccxggagyffghdmceuxmoydxdmcmdxxfzmufoohhfeezumuhgzxcoyehdumoffdczfxfmzxgmfcmmuxefezxyxeedauydyoumayhzxyyadydyygoohumuyaayxyfoaeoyyazcgmzzuyaemddugagczoeoeauggocodzozafcmazcduyyczdofgmfxuuceohffddmmzoofaegdgfzfmmgmzoxauofhzmhgaazmyfxzuemxuzooyxezmodcecaumoofffffaghmaxxdmcyzmoxggfygeochaaahdhxfxcaecmoczdfdgeyghhzhxhcmczuaugcuzuuyecfdeceecczhzyzyezeoyyfezhmedxdgeccmdcdyugyaazaeogzyugedmzcmfegchgaafazmozyoocggxxxxmcyhzdexoduxmudeoodfzcfeeghgamodczfcmaufhgmcdyfhaduzayohhefdygzfefmzyxxxezhogghfmhymafddehdocufcazadedyexzeyucacfzdezzxfcfgauouxhhmdhauxmgyhhecchcgcgfmaagyfufxuueczhezuauoaaefgfuyahzgddcgfezaafuzuuhzxeufhczghfymgyzfyoyhmfmucamxhgugzmoahozaaeduzdxdagchaxmdmemxddaudmycecxuzfgzmfgdzucmxcfzugfmaedxzycomcymofggcxfmhcmemuezdcexxzfehymgugaefzgmxayadoohhoeedegyfayauaahcyeaacxdyuhhoyzyhefcxhxyhhzuhueahmfedzeueyuuezyuyahoxczhmcczxdomuegxgmghagacfggfuayeyxddhyxxozxedxcxayfuamomdzgocfxzmoymzhmeozeuexyozcaocuyzzdahgoofoydzeecoceuzmdeeuycxmguagyxdougychdoogeagyaxgdyfehoemgyefemmgddcmfxczcochgohddddmcdzgomcodeedceczgozxauaaxexyffxhxugfeeyzfggcmdyfzfcaghfzzmehxuxudagogcgcoddzcuozmumzuycmudzgdyzayeymofcumfzfuxyymfufuyazdzxfmoxuycygofufzefemyezyghucyzyzgxczuouxueyudcdcuzauegmezoczdgzyxzaufeuzhmgdfzmxzcofmhghdayfdhcchhudgdgeuoduzgyaagfochhmcxzhhcmuzgeeoedguxgmyayhchmzuegyxcmamdmdchedgzhgfmfehhxmgcdghamhmuuaccofeghaxehfhmazmmuaxzmzehxgefemohzyexymxozdoucfmmaoxeaoxduzeyycgoxfomxheyghdocgecmgauxyyhuezhuuxdmdxeyeaaogeyxzmamegfyhgmeuhueyycmfmegcoahmxfahcafhougzamxoxzymzummachghodzxgcxmyxemcceueuayoodfexodcozfoafogeeuhyoxedyzafcxaudgmmdyxmmgamdhdyxgzyfhgedgoxgcmgofhoxxffgcoedhxzzzazgdcaxdmgyyccoxuxfayuoouhemgoxzgfogcceoxccammxczcouyhdxueemhamgmydaxhfuuxdfyxydmfozezachfzhufyuyfzxcgggczxcfocxeufchfhahoegdgzdhaemgcauzgdcyzdzoxhexagmcmhoeyuaemducfzzzudcagchcdyfdghyxgzmuhzhyhcafzamggezfhemmfoaxaufxdyfhucayhcemzzeyzzuxexxmzouexydoyfxdzaddmehcudzgozyugmmoefeuyomezggxmydhxoyammdyoxxddggugzymyceodyyogaxfccccxxhaxduozhxhcxxmgeehzzofxmuczchauydyaucyeffcfocmoxchxxfmhdeyaxdadccxxyxohcoomymmuuhfezmffxyhduodehzyeyzdaeaomehhmaexzoxdogaueghugzchzyaxuemuohazzughmemgcedhcfdfguezffoucyhcfouydaezzuycouhmzdxyexhyxxcafxyxxaddmomoxfoacxxmfcoxhyzefggzcdozdhzdxoxogchgfhmezfcyfmecdmexxcamxzchfyacgughodcefouxxzcaczchhoefhcyxzyuozeyhuzaxhzmudehzfcedzmgeozehhceufyymdaocugumafmgzzhyxmzfxhyzoxzgzaeozuhxzooxocdoacfmegmzufeuccgfaegcezucczczzeexamefdgauydofumfhzzueugexhgudfahhdocymxgudcedhdfyhyexgeuemcmyfogammufyuzmaexuhfeyxodfuacxhdddocmzmymaydxymzdeyhzgooegfezahmgouduhfumxgodmdghgzgxzdzaccahzeuygeyfdcyhauxmdmeoxaaxhuhmeyzycymzfyaauecuafhugzoaydxgceoczguyfxgxaydyuaamfxezahzmdzfdxfgfuuzxuheaggffghezyycaafuuoxohzmggmudchcfudyzemzoudexxmameccmxhxxgzeugzzcfhfxfyyhexyxcccyhaofdmydzhfcuugudmuxodymxehxomhzgyycmeuoocxzmggoaxeymygcgfyfyhgyxeadhfxaoehfdhxaxgcxgeyafafexoammcazzdcczhohxhyoeuozmmzcfhdzaeaeemczccozcdemhxczagaohzdhyxdcyecehumzmgoafufhzduyyeozyhymcgygcdyauaghfzygeexouuagfezoxoeaxaxfmgyzyzxcoxzeycdahohffchamfmfgyzegycmyxyfufafeamddoczgaeyhefgxueufohdmmffzxayhoggdafxadaghememfzzffomfoxaycdczzzfzofuuhfdhxmuaceeyxcofzfgdhhedhcyuhhxeyxmuoogehcxmffmfemccchfocamczzdzhgzmmuazzdfezgugccemedggchggzfghueyfmzyocdxeduayhfugogzuhuycgazxxaayumhzmfyouayzuafgmzcmmcaacmgcmzmoecxyhmhomdyzzdcfodzocughhgzaezcgfygxmzucyamzmaxacagmzohfmfhdhxooaozydooddmhfyzffgcdachghmheohadumogzfdohcafzgmooymfuxggdudfcecaeyaaczamfcmfxxcummgccfcfchmgdezufhfmhhocudgdeyymfyomuuuyyzagoeomfaoaueoefmhgyyzouyxydzouaygmgyhommmyxfczzgacgaghzecufgommomzcchhauccafzygzydzcedzfxgocyxxeygmxadgmxyexcoghfaaymymexhyuzaumaoyadhazedefhxucydoymegzcmyfzozmczdgeyocgaadogofeeudyoyxmcyuzdfcfmuheoeyzfuacaufhefmhcggocgczguyygedygoheuxczeddzoaouaycuhgcmgeahmzugcmyfmoyagozfegemcuxyeucyoauhzfaaahecegeogeazmhfxyeoacmhaehuagggehzhhauufueuhhohzcfxzcuzgefcmagahezazzzgxagaaaoyudomoauxmmxzddmzefugufhhdzmgddfaxuufhyuyxugymgecgfzddhyouzocgdmdfgcfycoeuzxgeyyomgmheofezdxeufghgegfymfyhzyyoahfuxfmxdmyzfeemaygfyyuxoohfeomeyfoxuogomhexayfucydfghgczfhemdofzxmgzyeouczdcyyehfdxuacxcmmfmcfcazcdadzadyagzcezahgxzdmmmcuzyeumemuaddogfyuozxfdueoxfxauxfdxyehoxcuemxdhzamddhcgcygumycehcdeaogeaumxoaduzacugoxedaxxfhuoexhcaoafefmyhzegzhdaedyyffmdghexcaxfuehoxodyfgdaheyezefgdocyfdzegmgyfouzooecmhmzuecufgmdmmemzafeamcoduzxxffeezfxefxyouhxfuomxamyozfedoymamuhouefuxuymxyfefmuchouhhmxcyaaucfcxucdxefaugdyzyehfzhxyxfemzgduemmudghxzguhhydfhmfemeyceuuumumzhfmxmuzxfcaygeyezhdaffaoaouxoyzmhxaccyaadxdugdxfxufzhmchgzomhdmzchogcayhdmuayagyoamfeffezxumyxcagufoyyfmafcaeohfgxdaeafoxuyzczmzmhfozzoueoozccguumomhdhgccozhgcehgygdufuegcumdmcxoomfecdhafuhcmaeahxxzyohghcfaehyfffhmumfmegzmcaggzghemeodfccgccfohhmxoyfgamxgzmmyfmchgmdcuuzcaohccgcxhazofehcumumudahgdufxgoecogmxzxmyofuddgmmaahhuxegdccauegdoeyaadaxauygchgmchyxygdfuodcoeycmfceyxyaxxcfexahfcuohcxcdyueauuxcuzdzuuxhxagzaoohzcadymffgamuxhduzafuxemgcmxcmxuezxfoofguuoagaoeeoyedcmodzzcccgeeugeacxyfgoymgxxeoaxxhychayumcagyddgxhzfadmfocxhuyxchdfzaadfzycazuxcuoedgcfhayzcohyehgefzzofoxzcuhgedoazodxzuahgzedfyfyezfzgzzyufgoycyxumuxoudagfmdygfuddxufuayueudymhdadhfeyczuogaufdhxaomuzmfffhfuauouczymyzyzhczaydamhcgdxacomxyoamyygzczmhmhfcdehaxouheuogeuxuaoadcofomedyoudxofxuoxgyoyhmexuohdyzohaemzhuyoooecyuaadozodxhfggzoegfcmuzexaaemhgheyzzfuhmgumyxuhyyhxchmomacaxdzgcezhgydduamuydfdumemudgxfhoffhyaycyooymcmuycooyoygoceyhhdzduxuafcheeaugdgexzyhcmahhmyxcfgcfuhoemefxgcoggxxufoeueofegadhuczhufxdymmxaexdfhxzchzueghczuoddgghhfdddyuzmfcgaouoydoghchhhzgedmccdzxghodfmfoeaooeeodgeumodaagduhhxddgauhycaoueehzxyaddhdxxhhhedezemeuummudmgehayguffxffhadaddhuexaydxdoefcgczfxxchocazeyoyxmahydaeczoodgmxecaudyuddgcgxxzhmguydofduyeexcdzuecmzgmcmoomeefcoamhxgdugcgzfehcmmhmuzhczchemyfxyuycudozoudmuzmumzmfyzffofughgdxeddymdgmaammzeodmmxuxdgaefeohouaoxdaedmeyzxfzghoymddxazyaagomxdohgyuyfdaumxydfggczzhogfffxgghhygzaofuxgeoufhdcmxgoaezzfzfdeyhffdohcfexfechgcodoyccfucxaxzdgceymfazfyhdzmamfuxduuccazyccaugayefogmaezouguazauyhehfhmozhezzcgmcfgcuouaczdxxfxxhcaghzuzzuudxueuudxcxouzuuemhxzmdzyoacaeddyoazcezffmdgeazcgfzyamgchzdofxmfygayugdyaeezdufdauhahuggzuhaoxefmamayodxmexfuxzcedueocueyoufccyuhefammyzxmcogmfyomeedyggymxhfgddmdfmamazuxcyomaocmofoeecozoyyohhmmgyazgomofcadycafafxexohzmycmcoxoeehhxuoffhaemdyfgmmeuggooyfhxdufzdedxmcazexgoaoofgagmuddoaguaouzcfhhdxxgmchcycozmdzxgmchzyoaeaaaouddxfazduemddyhceexyoauxfzgdxudazuyhxhfuoyudmhazyaeeufuogmzgyafmmzycazmuooyzuomcyhhfggohfuzouzmfgaeahyuuzhzyxuuedfhgaddfcfcuyhzgyoacdhmzugxcxamcgdeyamayozohcfmyxudzgceuahchmzgxyyffgfofococuegdyofdoxomzagmeoefzdmecaeoouhyadguyxfedfofhfczguogghfxxufduhzhfhxzuchdyuoymagxuauexgamdmoechhommahhmugoueghhufcxxhhczayfxamyeymugzmemxmhdmmgyuudzugcugmxaaxmxzucxyagxgfeezocxhoyzfaydeaccfeucmycmudhdecfuauzeyzoozomefcugxufomuxymfgoofmzyceohczzzxdmhfomumdchgcxuxefcfcgfuuxfucxyececahczdaeahfzodxmedgffaoccumdoecymozdedzeczyaguxhcoxzeeadfmcxzamugcmedemoazhxcgdafzghmmhofdhaoamhaceoueehuayczeehhxdfhxefohzmxocyhougoomxzdxedhdxcgzdghcygydofyfzydyudcuzyzxauxcaxyaoagdeegmgdguaczgaedhzuuumgdyzxdmuyoeuhfozzugxhogzazchaccymfdoeymgzdmaoduxuzuzfdfedeoguxeaxeyoyogddmfggzzyexzchmhfefcmgdzxgmmcogfgcemeooedmzfmmfxegazmofodohhcmdaeagcfdmxfmcaaxudeyozhddehezfzyxfdcyxdezzxodzcfemeohoehecehhdxfdyuhddogdheegomzmcexaooefzuouyfyfmmyzdhefyeguzyefmfeudohfuedgydegomxufxzeczexdyauacgcxcdfxezxmxahzfzydfzmamaxudauodzyhfcoyohhuycxzdaofehuxhfacuoymzdcduxxyomyoadxcdyfmgouoyamfzuxyhfezyauxgzzdexfcyuycmydhxyzyxzzyyhuxdzofdzehdzeuyoadgoeyofumhfxofzdagfmmfxgxaduxegfhagcxmyymefxmaaegghgzyahgdyxceccgeygcgffmxuaoyhfmhuguohagfxuyoxfacyxdhxxyfdoodehzeodxxcahyoymoeucexdxzfdudauoxahdedxoughdhfayumfdzhyoffomcaouudgyugoaummucgemazmfzgueefoufuyzyaohemdcegocmaaadmxuuzgcefcomaacyxuzaaaocyzzdgyumgacoxehamefozyacdfugxhfygggyzxzfmcgudfhuhafhhyxfzzzaeehuhyfdhzgdmygyfcgcyaaoaggyzxmuozmmdyhuoczyeyeyxuuyuzfxommzxxxaoaacdgeddeggoazxodzmzfxcxcmfgycgafxgeuzueyzdhcmfeczcgfhecaafuaaouczgoomeedhoafxgheomzfoeugoomemyghgdzamuedzufdgzdheoofeofffemzhhgzdudxgccffxyehyzfgmaggufgyzogggfdgadzegccgemdahomdzgzdyhxcydoahzoyhfzuchohzxemaxymeddxzyaohyayyxudoufohzeaooyzycdffymxefcxahxggcmfyzuuxdehahhgzxhyymmeddezmouccfaedufezxoymyfeycdfagechhzyehxmezyfzmmaohhzadchafcegeoocuxadzguudzedohzaaoxhxmcyzaofazudacuexhyufzeaexxxceaccmezhzfgffeocuhydufauxzyxxyuxyxfzgzdmdzocuaduxcmxdffyhczdxoyeahmgzgxexcufchhzhhyagxeeyuxfedcuacxzcgmzumhzuuugahyzazhacfcemzeeecadaxczfzzxeyoehudmoccmfmzhfuaceohgdcyammcdcoumyfhyhfhhafdecoxeuzdhxczcfxzghoohuhdodmcgofugdxadayaofceecgfmmhaafazoagefueoahdxzfheygmdeddhuhdzuxxczochueadufdudeamgoydccxzomgxfmfmazhczmfumfaogofzgyzayedmugxfezmmzymchyxmuyzamaudadxugyamaydgfmcudmexzocuyxayufzhfhfmfeeuadozxzcuozhxygchgayeamhmhdoohyaoodcaacxcuexyeuuzezcduoxfyoozcxfxmydmzdxcauohmudmyexguazxdddufuazuxhcyoccemexfegucuhzagozuzfdemzcuhhdymoooyugxamzuaeudezuofzdffycmoacogudeyahmzhmzxxfcmeaguymdfhdyyodmfuuzohyxgfeugcoeddahfuedzgoymgceuzcdzzxucggumgozoagaoamyxcogodcoxddhauhaxeygzcozggzamghhgxhehfamgaeygxxzdhxcxxguahehhofzozcaxdmomuxhfcgeyxugmhuyzxfeuouxfofefdgcmxeduhagagmooghcxxhyxmygddufzzmohahgmzfgmhecayyxgmffuhdcdadcuegccdcdfuymcmxmmzgedhedoxhgagmgaadhoezeyzacoxxcfxchzhhdygzafymoezduyamfzmxmmamgeueafcgmcdyezedxeeyhxfgezxouxaxddzoyzzdexudugyfgyxuxeauehyfuadzafzozzxdmuafmxeghgchamamoufmmuyyzzcmuzougxmddmmdzzoemfgczdydhggafzyzohhmmduceycyyzfzacyzaaocfguygfemeoueoxuuxcuugycmucfozaauxfdhaezxygofefgxyyczacuyfhgfzadhxghedxcegmafahuyfzhucmugghfehfezggdyuxayfozyeehefyaagcgyxxhoyaxczacoyyzfofmdyzhogeedyzacggucyuyzozgdemmxzoecdazegzhfxofyzfefygghmfzfduazaoahayhfczucgmggucchexmgdazducuhayoahuyagfouuemzxfgomeguhuzuhoggozeyzumeydocxzyfyeadyfxxgcccfyofagycchogdyycogyaefyhacouhhgxcfgumhozaczoguafmuxchgheogxzcoaoeehdgoeycdddmgoedaxaeuaxuxzmomyzhyfzohdyfeoeoezohdgoufmfedfzgmdzfacgucfxuofdzagaxazommgmmhofddcdydyydemuxzcouhgeohgfddyygdeahcucaxxgfufdagodxedcxedmyfheaugugomhyydachzgfzgudxouyyxezhgzfuadegffdhxofcoymeeagxzdyycdghexgafoyyucxexmcyyygyxxaeaghfzdxhoemyfuhgxzmycchgxexczaadahyzcmayahegogefouxyxmdmyccuzeedxggfucghcgmecmyhzguhmumxzzgxcoeuhmhuagceacmgacehmhmyeffhcgxgcmxxmoxuuougahxeueheoecueyacxzyyxgfahohzuhacdmoeogeuagdhdgffmezgcychmfuxeyazhduuuahecyoeyygccezymmzoooyhcfdgcuhmacdzfcfgccghyoghcdzmfdduoxazumeyhoezgudogghhfodzyhyfugahcgdfhmufogzucghzeguyfhogffcdfdhcmxafchehhhhdzacffhmouzeehfxxgcahmgehyuagdddmxudeoyxadzyuygodxeocamhmuemdhfhzghueeucazdyzgyhxdecyyxydxahgfuddmzuadyzoyacmmoofughaaefxcadudemfmycdemmgumhdyxofxdhgyymezodyzzdahgcoxxoxhafcyucyhfccyffehceoumaxfuzoeefzeggcdezxfychhczffaohzaeehgzxohageofxauguohfmummmafcuoeymeuuzecdzdhmzchxyzmdzmymggmyamduuzxygfcghyhcuohhfzfaycgaayohaogohghmaxzmmxueozxmzaofghaamgdauxmgefxuhaadamycxmhfmgdemhcogggeahedxouzmfaygzgfcddzodfexhzhefyaeezagffeaocufxoemmhmxheoxczxzghaczyuozedgcmczzmyuufoygexahzhhageyzuacodydcgeydgxhzygggazofxofgdexxmhxmegccfeozmumaghuexhhhzdheggxmzeyhhmeahdcgguxcugmuymfuaafcayhefmgyxgzfumocogcdaegyyfxduemdfuhydxcfzzhuexmdmcaoygxamdfozeueugefyydyxxygchezdgafdxyhegeammfmxggzogedoudoadgexhfaamhzymdgyccmxggcmemzdghaecguoazyozxccumxedgyazdyegmccceddogcczxgeaayfdhguefmxfcuhzhgxaddmygeehaxyuaedhgzcgomxzcdxcozhaummxogaayfamzyyeeeggccoxeegfgxuyccugdmfchxxomufgmfmxgffogeyafgumyuhuhyohydhaacfyayghzdfyyxxoaguhzauuuozzydmhdhmgfeexagyehyfdxohmodcmomhfecayycyecdggoohcddhfcgudefmygmcuyfuaygxgmyyfeoxefcuzmoafemfxxxeadydogzcohxyhgfcyemahaadhoxexdumffuhmugogfhgmzyxuzeufezfzoououyyfaxuogmdxhmgyagauuofummzafugxdaxoahadoyggemuoyfgxoyamgmmccadcyoogzexzzuayygueuaggoeafffmcdxdzmomuodaofedumfggdxhfzzyzocochxdgxchaghogmomfhohuexfghfmxuhgfgegeeceoxdehdghuoufaymfxodmgmxaooxheexeggmachxdcxagcfgffcaumxgzagggxgmdgygmfogfugoffxoagzhfouhdxuuzdouaoyooxuchzyxhmoyfeacegzofexmcgcufachgumaxfydmummfaazyeceuzffxhghdxeyzgmhezacoagexoefgggfexczfzocdexeezfhozgmyooeacxegzuoudczczyceuoamooufguzgcuuffomodygddezfudgommaazfzxzfxfezmydaheezefamcemyceehdzacguxymmaoymecyydfyoahdmoacyaamcoacoudcoacdxmdhhuhouczoezcuhczoagdaezdxfoegccfgaogxfcxfuzfexzdagoyffyofuazxcaoefmgzogchhmczhycuzmumzxyzdeaccfzdudecygfzhgyuhyufhdguzggfzxcgafaedoamcyuzzazachmyuaxohcezhegmxmffymuahmfcachzchgmofdzyghxmoamdmzzofoueueudfceuhgzmfheyzgduzueamafzaoeeffufczgouomufyfmoxoxddgcmxyeafymgzcuaxzyumzeofahxcggxcuhauhofxozfhcdogffecdcmmuuaoaccmucuxmohhocgfydfxdgdcgyfyaeaufffgcydedccuzehzahmfxuhyoxxgmfuueddcazzduuoafazzccuzzhcoyymaeouaxzyzmoauczuadgygzuzhfdfcucgmoueouhmdzcuzymouhudzauaxymxzueeuxaogzozaeffydfuxhfocdgydayxyeeddxmaxommezgmxuzcyzmodamxaugaamhaxggomyecyafemyooahouodxfcuxhgoxdogfxheozhyufuaefamueheadedumadoczzgyzdahycaczccdgedxccheemfxhuuecmoefooyxddycumofzmyozhodfcfygymefzazhcxagodchoxameyhuoameamddfcocoogoyogfzuahuueeudayhxmgxcoygoyyggodhzfafagcfodccxcxycyfaxxoaeemcaxcuxzxhccmofhzuzxfodfeoygxhegucdxfhfyamymoxdemzzhxuhgyzxaughfofgayzxchghzxhdxxemghmyfucyemoyyfohduuudhcouddcazuzacdcocxmoyzzdhexaaehuzxmhhgxfggauyfedoxfefxocfugyxmhefodcezdezygmmamgumhfuyyfzumzgzydzuzhfmcaocfmzdzuxofhfchuuccumafomxzfzmucyaeeoxcaoxofdehgxaacoyadeymoaazaghcohhdczcfcauhuyffmddoffadddeczyuzxeuhgexdmxadyfczafoymdghyxmfdaceoooexyxgzfeaughhcmzmafxzyxfugxexazeuccmmyyyomghhyfoughmezcaffyfdeecocgmygoxfodzuhuuaoyzfmchfudgmmamymoyogyczeaezzfadoxdudzaamhxyhfyeauhyuudhdhzomcguyaxoyegugdaocmgedfdyccfzfygyfomogxmagzeudcoxauxdmocmadxhadymyymmyoyxgfffcaghyfooxgemzzuuzafdxfxxodychchfzgoohayxgzhmxhyxhozemzdfycuxofgamecxdoghmhmemgfocmzdfogemcoadxcxohhugzyuygzauzfxycuehhcezgmaemfgamhcmummgmeugodxhmyugggzzhexoumzueeyufoyfmdmaxeagmyeefcaxagdxdedcuezdxafggauzeuacxgaygxygfychxahfaedaagaougafgdofxmxoumomfuoaeyuezhzcocmdxozezfxggezacahxzmacuemoeaccczhfhoehydmfmmfyymyxhhaczymzyafocducmgmuhmhffzhyxzucaxhhmuhfmcmgdcexydxafczdagmhhfeezgdymeuecegemeafaedhogxxyaxmgcauyamyhucccdcudgzczcfgmczuxoazxauhhzeucmhgzoegdezxhczefgayxhuygazomxumchxycduhemgoyguyxmmudhuyxmeuhheoczczzeyczcyyzmxxeduefeayddgaaexdgmmzhdyzxzycxoaaxoyufohdezxzazyomdydmgzufmeuemaxhcuhxxmxehfeuxhhzyuuxcczoxzduzeeoaeedfammdachhygaguymxguhoaaeazyomgfhxfeaugyhazhmozceymmyuugaoafmhadugmefdmghumueecahcehmgmggamaaymgueddfzcmddoazofzoehgaxfyaaucceaygfodcmaahmamfdfofdeeoocgafmfdyayuhyhmxmhgdzmcxhouoofmzfddcdyghuddfffhuaoxgummamxzdyyhdffdoefgymhmmxagheeuuoodeczmzggmffxheeacdmoxoeeeydycgzfuhcxoydhyufcyufuhymzmuueezgdfcxduuxdchcxygdyzuuchxuufcmudcdxygzzhxymemhzzhcdmuezxazehugcoeafdogyfmddmhxccfzaxffgogxagcaeceazdaueummudcfadeehmmuegmfegaxmcaucxeoyeycdadayhzomffaxeegfxfxfmhffhdoxhfyyuoczuafohzoeghzhdfoxxdyhduxgaaguodeomcyeecohexgdmfmdadofeymcyuhyoogomugecgyhaeahuoadgcxhhaaamyzuocxgyozhgefemmfaucehazfgxumxehchxhfzmgehaygcezhdcxehgzgoccagouyaxxodaffaccogodummmmgudegccyhhfyogzudmuyhcmyxzfeffzaouogdhyxcoyouedyacodahdahumyuxdemxfahdhzxzydhgcxoyaeaaeoudaymyxaoyyehffyymyyggcxmhmmfaczuzefxyhgfafhoecmxdeduzduuafzyooaeofacaxgaxxodzoeudggyyyoddyuauucffdeucgexozhfmufdhcacczfduyaeeyfeuuyemozuufffmcxyyfuoamazcyauyyegfxhmzxgdhucyzduydhecfxgyueocgfeacffgxhzzhfdadgydzczuafghfyfdxddezocgdxxuodafazdoaeyocfhugogdomhhguuzhgzcyygmaozdhdyfzduhhuyyuchczaouodoxoayouyxgcmaacocfezugafdouxufauaoehxuaouaxgeofduegcodyafucgaooaahaddumcdexgccmouzumcudezhgxgzoffcygmgedumoumdgymeyfmomxhxygfemaexeexeyoyxmfudxmcmoeoceehmhoyeffgyaooxyohxayayxmmofexuhcufegedoeydyxagozafcoddaezffucfeuehayyyuegyozcoyccaygxghggdzofccemyccxmyhydozcfohcghggguhageuxgageyzfoxdoxcfgccmouccuxgyumdgccgdmeumzmfmuxhyehzxyuccdzexudmyacyaxyxcyzaadhomhoomzyfyodfcaucyhmfugcohhgffahmxcxoomfmumddmygfofduuummahehggaxmoxhahgazohuaxgcyuazguxhhfohaggccozaymagafxazmuyumgdzodoggyzuxghdgocoyfzmdczyfcehxheygyzhcemzgecayzhymcfaffxxhxagcezocoxzofoxxfcyfmfazeexxugyxgaueffcexoyouhymadhmmzmaazduzugccxhfogxuoeyacfxgccoycuaeadedzmzxoezozyhguzhuhzgommhyodfcymcyeoyzghdgdhyceuoudfacmxuumazcgdeyoeoooxucgmxzmugefyeeefzugyzaagmaocheoexexfgghxxzzdcxhhyaaxuhyyaxxmagydeydhcmhccfoyocfdozaeyxhedhexhhxmmacezzhfceyhgccoehzycochgauuedxxmomeozcmafmxmhyxxxmzfcgfoczhxhxguguuhhuxemegaghmxcmmefxhoehuefdfdemxumuogmcxcefouxfddzxzedecgyamgexyyycecdadzoacyxcdcygzxgauccdczaczxhygaudyauadxcgzcxxduhmxfuuzaxafyxocfoxmfgfmzzaefucoehefuzaexzcaoazocogmzfefafgmcmahfcegaheuumumhaxegycxzgodouddyhedgdyahcmguaaydheguhuzoozzooduxhmxucmyxhexxazfudaafgcxaghgayadchmhhozzoxmuzhoedccddezmdozumueyomfxocaeoaugzmdhzmcymozomxhhzuycohyegfxegcfgmxcxgzyxugexfhohuadumyceduzuxddzyxogcgfcxgezxagochohzgcdahyxuoeyoxzogdayhhfzymfodgdzgdeffeedmyouoagzyozxfyheaahmfgcuahdzhmudzgaxeegaoufxyheegadyommfcmhccmdhozuxydeexogoyegdhogaccaayzufxxfzofyfcfuueooayoxechzeduezhfoyhxmhuydaceumhcyomohuecxcogozxzxfocfdxaccaehgfygmcoyofcmfmgexeexaodacyxdxeuozmzommddagczohuaagucyahgceaxocmxgaeucacxcycahgcdadffdayxgxzzhouzfhgudhocchgfduufxyfyfzaoehfzezughgazadxguyzuddgxmexggmeogzyxoghezcmchxmudcfcaedmxcydxgxgmzdgmxaomzxohhyxfhfohoyeoghdgcmohagadegfgfdamzoagfoyexoouxmxcahzaafmcgdadxfxzecfyazxfuauyxahozzadxyfouxdfhfahfoygcxmdoagxehhmumczgeghuofmmoyfgeuahymgyzzoxyzydahxoouxggahxzofeyhcyemagdmyzcgczfehdhaocuxfayzycemxefmzuzecheoofdmcfhfzxamadyuczyzouyaduheccuoeodcaxoyhhyaafauydfofhaggceacafxodcyfuafadfumzdgxzozmzedmoceyoyfyegecdxmdyecyxydducugxahddcfozoghxzfhfmfhucaaoxdgogehmgexacfzzzxxfeyzxgcychyhyfcfufzghyyffdoeodogaochyoxgggeyuczfxcgofczmghgumuuzzhchogeggdexxmhmecuzaxzzafahxoyuzuhumyfcgxfxyuodcdydxuumadoemddadomdhmyyocegmaxfuduaxczzghaogduxcufomyfyhhoahgmudgxdomgefxyeyoccfuxozfaugoammfxmdmcydaedhoogeezzouuxgugfouyggcgaufguffuohefhmfomooyfmzxdadxucoehcuoeceffzzzeodhaxzcmgodyfcfydfhdudzeofmuyoayzhayzheocodecddyyhcuahxgzcucdgzyaufhuhedaafamdfcayhgoahcueucyuyycghdmyozzooxfazuouuzmuzdffuhdeyhdemxxchhfuxzmhecxehmxdaeefafueueogedaaayxyhgfgzmcymdcgueedcugdaxhhygczomcyghuoddffzuofuuzmomfoyuzdcefmcczffgomhdmozzmzmgygooumzfgfdezdcxczuczmyuyouehaxfxuxcfcceyocchxayaxgmxddmhauaggaohuugxhmzmmyocmxfgfxhgzzxyhduachgxhaohgaofyomxehgaggdmydugfhxomyeodzaocdhhhhaeoadxozxyducuhemmfmhgxczyuxgceyexhduymfmccgxyygeccchhmmmgxoxxaeauhddyffgcmazgeuxzcgeofcdamdghgfuuczxayycohcyfaumfehgmzggmygfucxydxcyddumccymyodcoxhhhzezumzfuzygffehdfeugexfmaugxcugheczhgfxmaeoxaxuhhxgeuxyzhadyyezdmycadocueazaazzxfuhohddydfhazzeezxfcodhafzfzxegoazefgmeagoeyegoodxzhoymfgfufegocogodhdfceoaefuumxgyccygaddmmuhaydohzhuoemgofzuhyauxmygeegzyffcyhmdudzcouoacydfogduuadxodchyueazgyeaygfgcffuohfuxmzhagamxcayxzygxmcguecdzafeoccxyfeayxuhzgfegazdamyayyxgyogzmdzazcyguzcmcxddchxdccxzeyaudhxdxxyehzfhcfadzzdfeduogohxxeheguohccumayeeygammfczugcufcgcyfefdcfhuffafefddgyhexmcffaydafccyuzfxzghhadudoyeyfezedgedudxxuhochxxxxycgaoegxzdyoeoaezeecxayhxgoehxoaayccgfzhmuxzxechdgfdufxaudoaffmffdemcygyhmmezxhehgzdeyxoxfhxuygmaayfzaemoudcdeyhedoeuhxozfyzuuhfuaazccgoxdmcxexfoaefdcoffadfucxguhhzxuxdaxgadoxefezumxaczfhfmazmchhxczhodoeehgdeohdhuoyyxefaueefexudzcyemachmhfgodouuzeaeyxcxffzafggdoezfgczfxuezxogduadgoggduyzmagmzezoohffhzegxdxaxezeaeyuhgoxodgzdeoccaeaegxfacfcdfeehezecugeuuuzzmooomyxgxazdhuugmoezzeomcfzhgxozdmahuxgdcfufaeczduhhemmcfdzhfyyyxddfhcmoegaeoeddazohxamuhmaucgexegymozzxxcegezmocmohecfhacmoedmoxgdzccgffmymuchufeuoehfadzfozfghdfgcceydyxyfgazdydaxgdmozggycggaeohuhozfxfoammuyghddaheochauycyxgdzxmugzyxgmeufmhmafofmxydcmfdeoczfocmffyyzhxdfymeceaoodcycggmfuyzzeeoomyxefgauguhcegxeyhuzhyhzuhouuyzfgmaozxmeuczodzhyxaexoumhfamfedodeexeezdgamomzohzhzxdxgyxguzuyzhgmcdyazdeeyguyzaxcgxeohyezgcafyaxyzczxgdazumxzdoahgdayhezzoeuumzdmacmhxmdegmxaheyzhzxcxucgdadzazacaxxuamxygfmfofaggaaezeguzaeazyfzhcofxdyuczoxcuffmmgcddzcfcaaxufzohggduhdxzydzodfmocmfefxefzycoghyayaoomyecyyfcmfeoemazzcacheuogucczhhoexougddmuxmcxzhzgafemzyaagfxxcffyxogyfmyfumezccdogmyxcdzhfdafahuyedudmozyuauoooufduxdyzugoyueomfyoamofaafgagahxoodeahmfymzhauagzyaufedeczadgfexomeexfcoamfudxcxecagcxcyadezzfahexemoxzacdyoxdxofhodoagyxgcufdaddzxcxdhuzdzmcfxdmdfaghoomzxzchaaocedmoyuyfcuzaygufzegyfcaczzuzuudmceyhfdocchyghezhuuhaxohoedhyomozgccxfcafhhfcmfmggoxamucyaheaoegggfmgyzgyhfyzeuhoodmcuxygczogaczooemozdcuocoeaugdzmeyceaxazhfgahyghehdgfcoauamxeaxxuhaxaofxaaezxmgayumfamhfeucxdazmmamgugoogoaygfahzxumfoohfeyyxmuzyauyaghcucchyaefchufoaeddfodofmueyzfuydyzaafgzoeugaahexzgcduzoxxuhxhxfdgyzxzcxxhhoeuxdazoghuuuohxhydhxzxumxacfxaxodxxxhygmaeydouuyhyayaegdcxzcymmxfdhufxaougudmzoozyhodxemfcmxeeeoguuzzcahcayaoafzmyzacfgogffmozzumochgmozzcgfzcufcdyhmhgchddhffuxgazchgzuchgmomdumocfyxuadgcdazffmfecomuxefxmxmxecacfhchuamhuozydfghahfefaugoacxxdgyyfzumegacaddzzazxyxzgfffdgxyzdmczufduufyghyefgeaaudccfomyouyzxufoeymdufghoummgacdccaxfydhoufoxufchxcodaugxzuomaxyxauhxgdmuoeahczecedxggdhdoeyoegyhxoamoxxchzfhxddeehxyxghfxdhhhcofxcuchozgycgzzmedcmdfxaemhxmhohamegcyycomoydhcuxxffxyxxdadmaedmhfdzchogyehzyxoammayymdyamfcfyaoydyyxuuamaazayuahohfmhazuhoxufddedcgxdozzxaxzghfhomfxeumzahgxegmcogdhdxyagddgfgmeefudegcdcfuefahygdechuuhaaezegzmyayuhfaohhmuezaxyyzeodxozzcoeayufexffmfzohxmgaaxhgmmumydxyfmzfzyfyemamgzxcgzhacafeyhhomudfyfdoxyxxxahxxyamuygxaaechdeguefazfazoumfffdacohyfueaaecamgdofmahmayzmcamxyadaugmeameayfucddgemogmzfuxehfcdgfuohaohgafofygdaaafyufzcgmyzomgezyxuuhoudmeudmgahghfedzydzghazhafyeudehxugyaehyaadxahcxhcfodmcozdudegumzochaucxeuahxogcdggmuuxcxzoyyeucyguygezdaouochyazgxegfgodhazuydgcecghgyouafymggzhozxmxdaxhddxcgyxdxgzugzzgmdgmazgagmzxozghhouemyozaexaahmdhazzaeehaahmyedyfyaaygzmyuzxddzoufagxeummghmfycaahxgozxaguxgzdmchafhuemhmmufecuooehuxuaeuufdcoexzzmoygmagmeoayehgehomeuyxudduaxmgxdfacmzhhhgzzgegegheggcydedzxucgdmffefdxxhoudxyezxgducgdueccoayuzzaeufuxoooycccmzucmyxddyuffxgcuzmygogeguuyzmxegxzmfhgmxgcmemuzcmxmfuoyuayzcyaucfcxhdghxgzhyxauemfmfuygoueaahmgzmoxychghazgxxcuhocmfgemazxxefxfeaemazyuxyzzueeceaufyueacgygzcdmexumeyxoazoyhmeczfmfcdyghzoyyhgmghczzmmmzmzmuhfxaafhgeuzzdzfcdefcuadeaemhzyfczuxaocaaodouyaoyyzdheczucmadmxczcyauxyhmmfaocyemgmemgdofmfxdggcogdcmmzmzofyeezmyoccdmheguhmmchccygmhdaaehomdydyhxuyyhfcuxuaaaommeofxeuexhzzcufemzdegauogadxaycfgehhyeagezmoeazhaxmxzmfcfeezcezccmcyucdfauzoxeeayehuczhfuefgeucdyfmgzceehahaafmgghaozgdmzohufcffehxdoxffgmmczzgfxdyyxcyoachfxeyodfamcddayucddfdoaxdomufghzexhhcmoduefzzemdfzxcoxzmxoaufuofmhfyamfmzmomdueaoeaygzcooyzeommmozggmhgfeehxfamhufhdcuyhygyeghodgeaamomagcfdcmehxafguozhchuooucomdzfeacohgfecumzgzfhmuhedxozydguzgaehyaogcyouhhmxfgxuxmfeuoezayxxmdfoedgfedggezzgdzdazmaheycadooucogegdugcyzzdayfuygaeoyfaxaemyxmayheuhdugmuguzaodxgyueycuuuudmfcxazmeccazhahcxdufazeuyuhaxooeofeeyzgddhxhcmexzghyefgadeadmoufeaaacdxgzeyxghhfeaxohygdogdzfahycuhyfeghaaahzuhhhhyzoxdfogmeaoumggufaceygdgdefofmzmdzmmozhoucccghumfgzozzodmhxmyhyzuazeameaudgeodmfdaeagdagfofmdyfcumfahuyudoxyymyedxogcdayuczzgaoczcxhaxhmhdxxuygzfexugdaczmggheueemcgmaacguzhhuhohgxdzdeuyuozhzzyyayzuzxemxxaaomyyhcdedgzfdmaaedoeczzdudmgoyzyxdexcazuxxaffyocgoddezcdhuouffycecfxxeuxzfamgxmfuhxhxxhhhdyhoghdhxuddzhzdamcxmohfmxcadfazmghffchmgxhayyoeuuoxcfydudxzxhcxdzhdccgdaodcmgoucuumcfgxdehucmadzeuoyxyhfemcuzedufhhocdyfzydadzhdoeueazgoducyxudcyxefhezdmaoxhmgxfmmhuzgcmezhdccxgcucfxchuzcdyuydyyfdmxahcadhzeuoaazxhyydcacyaaggfeeahgdmmxxuzffooyaoeuyeyohcmuzuhaxmuegamudamuefeyoemomeyydzhufyhuexmzhoggxfxdmouamxygaoyafoyayxxguumgxmxgzamymycmfxmezduydgudydcmaaeuyzmzxfadehfomydfzgfcmzxgxogghggcuxmcyohmxgddmeuyaxafggdfafhfyumchazhcaaxfmodzzedmmagyuahgoxgmozeuadyxhoymcdggogmmgfeaoumxfdcuzdugczfezguzyyxhdhdhoxdffguzmedcdegdmufodofhomcxdeduoeycydygaceazadgohmyommzmhfefeexodxzhczyzgauugzxhhuhdgohcuuuoyfhzauaudoaodyhayaodyyxzoyzzhaeyzzcegdeuxycfazdyaomeaofmyhyfhceyzucfhodgduxgcmmyfdzyaffefcguzhoahdocafhmouohayydcoyoyuoddmyzcxmheecydfaozeccocgyocaygyhmgcugcoeemhxaudzhufehohydzmfxayeumfazaagaohdcmmezdmcagyxocuheehdfddzzodyaedgyhhxygeggyxzehzydzcygcafoamumemccduymyocaexuuoodmagfoymcfddxohahfzegdgaceceagaxgogggzuaochhmahuyuhzgcuccmgumfumcddfmxxyoafhocafagzdoadcxyxgcmmaxmxchmdzzcmmzeucfudgzcggugcudumoezhcdeyagfaxgcahaxoxgeuzhmyfudmhmcoaxagfafehyzxxhfzhygemuxmucmxfeeacfaadzoxuzcmuzozmecyaxdzfhefmhghuzfcadugmfxmyagyoydyugfcxxcyuczcyumfemxzuaaayczzcmfcgygmdcaeoyfhegcaufmdohuzgmmofdahhfoumyozzyhezzgyedcfxcgxxxazgfuedoyzcacdchuyuoeueygmeuugueccfzofduxhcuxcheygxxyhgzagefxomuouemofuuxfuaocxzceecfafaguozxgdggdaofgzaceayuuxfufoucyeyaomfzxfmzeyemcguuaeyhdadyyaamghhomeguaheyaxomxazzxymmcfexhyyxghzxhymemdhgdmcxedzhozxffxzudozxghoxdegeyghdmgzdegmdhmhyehfchmzyegfzafuhxmeouugyefhhmoxgyyghzgxeacyhxyfmcoxcoeghzzfyuacdfcxegoymyxudzcgzeydoeuzxgdmzoghfaufodcaohcadcdxzeefhohumdozzaffodyfcudueychguafcuczffxeuafodhoofagdufxxfduxodadzocyfdfhomfgoaemzhuoguzdyahdfdgxdfuzemfouuzdzdocuxhcemeocmmcxmaddeegfehczmomgguymmggaeyyfcgczuzdchaehgdxdyazehoxeuohzxuyeogfcyxxceayyxcmfehhozgeezyyeuayazadyymauucfcafamhdzcxxodzgyxafmmmhcaoehgoaayzaucddmfdczuxoxaxxofmyugdedeygudaycmmeczmyodefmmmxgedzmeomxucfuezgoeamhduxdcxheaahhchmzzcuyeyuzcduuuuchygahdxhmzugxyeaachfcxxcaaexcxzyyxezuygxxyeemzdmyxhhehyohgmfmcohuyxdxmegmyzaxeycuoxafamucmuuemdcxeymmzeffedcgfzddeufomdoocmgauoccafdhgzfdhxuuazudzzcezdxycomohouuhcufxexefymeagaacyzdoxgzdxeeugmhmxzuzycocggezxachdydzyxxczffgmzmxcufaudexyhhxedaamufguuzydfacxacmdduofmhgamdexayzozcdgodozmmgdmcxeaczoyyaczuxaxcauoachaoamuzfuceaxucdagfexouxczxyhyxdgydcgfgouyyzheyemgmueeecodyhzuxayuammcuemcodmmoagcmhdahoodmcxohadafhdazhuhdxeoeoufgoofyoyuuuuhxemuuzzxfaegafofohcxmmyugmffzggacozeyfmacemozamyczcomzfeyyaxzhgzhzxhxeeeydmofodyzoagxduhdxhfccdeyccoaaczdoydccxxffxouudougufhdoodchghguuxcahodzaumgfuodugomfmdgmguyxxxuzcofaouofudgghxdzcmzoueeaceammaouuxuucofmmhcyogxzzxgxaucmuehehfegfuheeyyxgoxgmxuyygddcxemgyogfayfcugcegxdmuoegggdhychozzagmmexhcofafechdmamayfeogfcagxfhyeyzuhufzguacfyuumzcmzfzzgygychzacdcdhhucxxadhahmhhxdmcedgmdxofooczmagyfxfehcxcycfdugyecyazgmudfuexhycfxcccuexheeoacdgffxucaddgdcuhoeyxymyzhefxgodhzgaheuxygmhecfzzcdxuhucghozudxfyhoymaazeuumcuemdzomcuydcxddygyxfdgyageodcgzegxgazazemfooyyuoymceyayfgyzyocooeaodhmmfegxmcgmgcduuddocmcuhaxmymhaoafeyuccucodxmyaecmyozxeyzehyzhfodcyhhcafyygafmeuxzyoemxfzuddecgdmayeagdeayeofhcacxcuxcfgyehgfoudcyyyuozdyxuodgfgdaozgfczgdouooxgeoogyodhofezaxyuhggoxxzmzfecmfcozyzeomffhecgmyymuaggcxgduhzuyoxcxddadydegdgumgfadzczgzguuugmfhyfghczgzzazugzuxueymdmcxcyhfgafyagyyzxfazaxugoofuzomzzmdoezmoaycxmczxffggoufocdumhoxgegmgmuamzcexcmgffefdcaxamzagfhgxmahxmgxuhhzmmazgcggdyyhfoyacfhxmazumdaemacydcfyyoxhgxzumhgmueyoafyghggygccxyzgezuoucoafdczdmxhfdhmexaccgyucfcxaozgauchmamohfhhyogooyxmfxoouzgogooooahdudegycycexamheodzfyczamoxhzfdazexhxezydxumoazegecgeyuczffmaemuezocmcyzooxzueghffgecgaehdchzdcceadooaoyfyhheoycfyeydooxhayafxdhhfedyuzemzfxczczdxfuymmgzdfyffhyfeuxduhyfgecfeufxcfxozagemufmxauyazmfyeeoceechczzgmacomgazxaxzdgaazfezadxedzmxceuxcumfhfuadcdgaedmyfxcygfeaccfayhymcchguzggguufmzchueeozzxxehxgxfoocfeemzxzuchyhhhcxzodydczeogaxueyexeagyuuggxamczdmdomzhodzyxufofhoxdadcuazahcuefgydzhmuxzycaefugfcgcdgaxudumecxhaaxmyhhzcxczxggyezumzgczfchduceddayhacduduzeexhuayydgmxghcyaffhgoxfzzmdyugyedgacezoxhhgoezzgayofofggegxugyodoxfcuxcyzdexzdycazfogdueaaucxomyayhexaoxzdgoexcdamyxdycgymomgadfygfyddazaozhfuyhmyuxahezayyxyagcfmefumddoxhxfucoechomeuxhczcamczauyhcxeehzyhufgfzyehxugoxxzxmeezyoyzcyxzymfgeegmggdgozaecodgogdaaydfgfzgdxgefzauxcumhcuazcfegduemfddeeeyzuhuzhygcceaxfzyhgfxdheuzffhzuxgcuoauuzaecdeggzefhagaoeexmfguyecohaazhxhfeccyoyaahcgozofduyczggyohydzfhehuoeachgdhdfaezmamooxmezoaxdzzucgyogymdexxmumuxzdmumeaaegemzxdugaaafeufhcfdefomdyfmyfudezmdhymyfzegmaadgoxxchummygggoadygzyduzzfgudzzefmaucyeochmgchhhhueydzemcuxxhegmdyzuumxcexgumfmgagzzomcxmfxugufmudfyazygadzacgymoeyhuugfayuuhxddaecofyhohyocgxcmdxoxgcyxmuuzyozfydmzouzgdceueoahmhyddezgmyoyyduehfzcmzhhazdocxocdhxemaxoozfehexdyxgcauucfzafcxhcamgcueuaycyhymuheyyfcamdcduuczxgucgmueueoumuamfmyuxdoffhofzyoxfahyxgmemouamdudzmahuafcmoodxhygceeoeedxhdofmaeocodueoxhyecgymzmugeagaghozaxxmhafegdomyogzfeuxcyeffzgdyamydhdfmmmexhzoefaxyfxxycmcexcfcudeyxfghghuogohmeyuzooaemfzgffuzymmcgyezdydhcdmcxxxfexzcmahycufzfzfyeeuhxyoczyeggogzyaocgaczhmedzduchfdcafezxxeazcafamfygdgchmxgdxoeehyczcdcohzudduoeemgoyydauozhhhggfuxxdyzaauhxxohhaehzhdzdfymoxummgomoeyzyumhzemfahaxfeguocoofuhumegxcxxmdzoghhezdofodxgdxhaoozyehgfzexzxmzumumzexmcfcozzfodmugomdueuhdoueguedexcxugzmcgozaoocoyamfmgmummedxfcuhacdyyafxcuhmyxcmdmzuxoeuugozfcmoougmuuuooyyhdeadmhzhyhxyuygeoxmfgogedchhcmzeuhozhczxhagexuefhhyycmeaghgufdyameuzgeuodhmhdyouufodffmxguhyghudmxhgfuczomdczydahmcmehxdoaezyzyofmczmayfmafffyezcagucuyzdhdxggygyzozdaefdemgdgfzmgzzahxoemdummogzeouhgoxcchduxadmzaayufzxoexzzfhgufxcxgfoggeuomdemauozzufemdduuhdgfamazhzygodzfgcfmecxcdcomeaoofeyymmhufzfmxoxhmefzxgudchfehazgadygcdfyfmhehufxfdfcdoeeexdgzxgdfxfxexymmuoaoezxcegfgczxzaahxxaducymuyhmhydgcxhyuzohxxfdgaeuzuuaczfuogxahohyhzmehdaxxehhemhduzyugzzuhheugmfadxxmgdhmzczdddcmxcmyymdzgehgofeehffcfzmacxzczcfgzomyccudmdyxmyyamgehyhfezazxfcxcuudffdcaazccdygddfedeyzgcxahhohfggfmmyfaagceugzzouxezdoyaccmagagdzmdamxhogfxezcffmmcfzcedomzfaodexaxahcoxfxucuyyduoxeuhcxgfgmyuuxheuhxmeyucgfadmmffxozyxzchgeeyauygyamxefdzcamfohymfdhycaoeeheaoahyaedzfyaeohxcudexmeexmmdczeyycgoxuoodgfdycdxfgfzcummxyyexzumxmduzymdefcumzuxgdazmuezguuzzfcgdaagzzdoxadyuzfyygommggaadgozzdgxfgmfeeymfmaxegzducdfxhghaexecyzghggeeohmhezydhffxeegmfzzzxaofdamuheoeozchzaodmfgydmogzocmgmffdxfdxfxfocfdfhaxxyomehadefghugggcagdgmohcxaodzcoazgayoucezumdhhexmgummozghfhyoacamxeehudefgmcuxuooddahgfgmhgefauaxcacocoeoagyghgyhmufmhmgeyuucxoxcgmumzuoouzccfcydzcdgfoofgeuycofaexzuhxeeeffacxeugafudyymcyuacdyzdazyxahmdayyzdgdduaegdeouxdxzoycuzufzcchhmxozcoymfdyghdcfahmauxdchumugmeochymuhhyuohohhuzccugogfdxzyhfgauzedghxgeuumyfxmhzgafaaddaddmgeyxuughouxzxgydgagdxxoxexaocgmhoaxmmxamauhfcacuhxuzugeyfgghdzdhadfofuooeuzfggeemzyyoeoduaacfeyufzmuhyfmufumxcdzaocgxmgzedezaddcxgehaeadfadguhaucuadaehhxmxedoxyexdaamxyumczmezygecyozyygycgeeeccgcmzfddhuaxoamfghcmcyccuofoddfoycyhayhgomofamddymgzmamcogfyameafoemfzcddhmymmcfuxfxaofddedoeezcaxxczdfuefumzuuhfgauzxcemxohmdamaooogmzfcxmahzuxccfuhdcecfyxuhoafomaxeoxgyaycgmeaocfymauucacyoexodxzmdahdxuzuumayfeyzxemzgchygzucadoafmmoaofecxcdghycuceaedhofzxezmoyedhxdxoegczffcodgmxzzaxoxgdcogzdxmmozaafuzgeohdozaucmmoxcfaxeddazmxexxcgoaomacffdhzmdxdxzghguaxmyxcexxyxogezydzexdmohzucxyoyecuuzoydafyzuhxzoedfxuxdayzyeyhuofagyecdaxxuxgfyoxuchaagdcdegdgfmymuexohoaydcyeyxyudzfoughehugegamezxoexzgczzuffmmazzyugaocmuoyehdxeeogadmueoxggdayhcdhzhcacxmcyxxzzmyumuoxzedodcmyxhaoyzcdezzmozmaxgozdxoxadyhagmxdhcooamaamdacfgechzuaxcaeoxeouxmccazgcegdofgehocyodecodzueoyazeuozeucfgzmoomfccdfccfhzdxuyccgfzcmhyecamzedxmohuyzegehdxhcafomdouodxxezdecucdxghccghcdeoxhczfeaemfeogmcheaaadyemuuudafazmudahdmxcayyfdzuaygzzuxduxfyuygdzfhhhemhohyhuozaohueyuuhhdeycdcydmugfgcxgzuozhfegeafygfeecgyhcdghzxegmmgogocxcucgdhfeyxexcuuhfxaeemdfhfcocxdddyedhumfzoyazgcemxaymchaeufhafyyzfuhdazmcchemymfzaxyccauahegudoogfemcgxhuozaxhccxfmcfchxdexdezefcxhyzodgmcdafmgzagcychdeczaodcmyhoxmmxyxhohazzgyedhmhzodmcfcayxeufxxxfhzcfyfzygmacgcdxhgoeozfecfymfgeceaamuahzffmdcfdzcycuxfxehygmheycchmeeuxgaafyoxyeegyyufydcdyaxeomdyfzgddmeyoeffcodhoofhehoduzyahuyaohxuedcaoohmhzchgefccgodfacghoezxagocguudxfeadyoeoaoofamdeeeoeccmgeyyoaeomxuagemxadhufxxeuxhhcdceahafxhecgmyhdfeymfcfdgyxuomucegdchfzxxcaxzedcmauogfuzcmxyacfgghffdyzedhzygxxgggyxzzxcouyyuafzohyoymdfmgougouoxfmmmfugodcdomcmcydyyhmhaehzudeyfxhhadomhedezcghaofayfhhcheudoaadafuzhhadchxzedehgoyauymohcaecmxduaagoxyuefmfzeaadgaomughgahodgdfmfhzcgcoxyxuegahydfxhheecaucdmmfmcyyxmyayeoeoaceouamfaguyhdodzdhmyyxcyhmdzxmougmcyufdxxzuoxduyduzudezyoxoyomofmcmmxucffzzyzxzycfgxahydamayhegcyzfuoyaamycxfhhoyudxozeayggdmuyhmmdmfcedcgodofyxmoemohdhozoemmfoeecxygmfgefxeggohmeoxycuoxezazdxyccmeocdyhcfmffmyaexdgcuomafamxxdooageuchfmomyaaceucxafhoxzcadaehygyehuzuouyyffdzegyuceohhhoczyzcogfzcyucochaxfuhmdzgzzommzaecchehmfeozhehucmycfadccmxofzchayeyeemagyxhagfzhycxhhzahuyoaugmxxmaeafacxxgzoxmauuoxcuaecdhycuoagofohmuoffdumayfhucdgmhoxhcgydfczmufoydouaxamcdycoxufacemymezdffcagdhzhegdhzdhaxgeffmmaazmuzeyzamhfmgcyxcxxehzfecaofxhyzacyeuyyxzhzmhzzxxefmdmgzycegyxdomccyzygefozygfuygyeoemcuyacauefoeudaeazyduuxdumaxaadcuducaggcmmuxuodhmmyfdycygfaxxzmhoogzzxycycuxoayfumucegfgdfazxoocyfeczgyfcdgmaffhuymeczmfagdfuczzzfddyzdxogdxuhfgggcuxmadmeyaazuuxyxdmezyozehaomdeghhdauxcfxchhyeuhycyhxdydhoyfzodcfeyzdeczfxcazxomeadymeocmxmzmghauhyumedxuguxuoohmzgygumyfmggxahydghccaxxyhgzfyygdmouxyygoducaxuzhxzoyxyehffcmhehmuhmzfohoezhgxdagafhhxfyuhgmxmzcchoufdyhueazmgfeaaayhfhuxuxmxezhdauoygexmghuhguazuxayzaoxgaymdfagyyczeufyezazheufyczuzuudecxuxuumuocxchyeydodfacgmmuhzggyyymyxmzdhcydzzyeeugxcdoxuhfmmhxyghczacfoffymefxxgzeufuhcgxazyaxgxaecfdmogfzeoegguzohzxeahomeuuzodgemaaggyomzzfhoxeohycamzamadxdhoacxemauymzguxeezfxmxeagydffgaeyeheuucgefddggauxfzhexfcougyeacxzoooegczxdhuhmyeehdzcexyeofhxyyufdagcfedaugzaomeaeacdgmdxexdahmoemzafehdfaoaogomcehydzocyaggmyuzheyuxhcmxyhgcaoaeymyxuuaagfoxdooxfmxaaedyceaahfxcfommzdoaxhexohodzuceefgcxxfymceccfzfxmcdfduemeahgfzzfzmzczugxfdyxyccchygycoeucoexxgmfugxyyhmofohceuedaahdaoxgyzdhcazgffayuhozxozumzzyouamfccchocumxgumygfmeayfhoxmyamfxfgooxeceeghaxdhyoyamuadfouzyxxzcocazdemgxhhhfygdedfzfeuhzdxdgyooxzfucgagxudzdhyyuyudcgmfxuxoazugyfmohzaodchdchmogueuomyfuxgxygdzzyofefyczcmdaxfudfyogzoeeaaduazyymhyadczzucozxzuxmduzyhomyahacfaxycgoxyyohdezzhhhhfmdgoaxmzfeddmomugegmmmghumcuxfhmoomofmgdouaoaucgmeghczemyfdomouuezafzaghzyyaooefahgyhdehhxzuzdgeuhozagyaufoofuczcceaedogxehdfogaamdezggoohyueheoyayhxzffzfoeagfuxfuyczxgmxmxcdfhmdayhcdaoycmdexcmgghxdygxaegoohzyxamgzhgfzmdayhugeguyzmhfeuaugefhcahmyxduxamuyzeeuxozgyxefyouhufeueghyecdodahdoacouzcmyduooayxxchofymmzoahafaoffgaaogxdmfzhhzaodummyaygxhyuefeuhyauhfyaczcafdgemaozcoagcoehfhfocdmhgfcocxggmgcayomahdhgxmfxudmhyehffguamxxaczyyaedacyocycmugxacyddmfmfcamygefogygeohygumdagcxgccayoeamuccgfhaaacocyhamchguceexgccyozaegyofuhyuouamuhuazofhzxmmafhfzeggaemdemzczzgdamzyxefgehmzgzdgdfcxczhzhzdxxfmuyuhguyxmccooyduzcygcffchucomzzhehaogeeuzyeyzehyfmufoocdyzdeddeufomxxgxaoxhyduoozhomahydceeaxdedehhdfdehmzagaudzdgzaooxceuuceygfchffccmgoaffeezuuamucydouumduamzceogezoauyadmgmhuexaufgyaexgufcmeuhmzzzfxxxcumadhmmugoydeghaohuxxfdzafgdzgxhgfchxouhfafzmccczfoehzmyggfdhhmxooecgdxyyggocacouyoyxczfzeuchouyacygyzcuguymhygoymzuhmaaheucyfezmmgzofxacocdahfxfoazxfuxudexacdxgyyhuuexoduecfzozxzchehmxeauoeghgyyuzgagcozgcyazcffmdhuxcgoeoaaehhmzmdzhffhyhzxfeyayygadocfyadaxeamczxomexydgeezaumcyaeuyccaexufexffgocgxddygfegehyxdhzcmghxzyuffgcuaoadggocfdmdxhoofymduzmdmcxxagazeumyymughughoaxuygeexygfmogehogyumeedoeyxxhfdmxxmfafdzcgczxmxffxuhyyxfdufxmfxyffyefcmmdaggcagydodczheooduhechughxhffehgyfaahfyazhoeyxdhffyceooggmcaouhoggffzmcxddfzdhaxgmeuaduxuufxzcummxgaygdfgmmxzmzmgxohfdxxzedeodmoaezagedzdeechdaxezoaazzgfzzgggogoxhmuxcddhcdgcuaghdcuzyocyhcaheacxugezcfmddxhudohagczzyouyagamdcdagyfxdzcmgyuguemyeoeczccaeadgxofxumedcchefzoufaomxccaooyhegeyyffddyazeoddmaozaxhexxhxfomhcfuumcaxafcmhgafueuhmyzhfayyyxxfmgazfzyozgdumzyxaffgzyhyfouxuuhdygzguxazouagaeazdguaxogddcofooooxyxzduofoufmzodyyfdgcahuufyaxxxmcmgxdcmodheohxhuxaafmfgfmgxmhgmfmdgydmucyamycyzcegygcxeozufmexxzaddzfczgaydhxzemohdgzdhdczcufegogzccufahgxumoeuazyhoadhyemauohyxgzehhxyucucaeoyufxhfexehzzucfuzxemfhzmgghhxyauguzgefouahaaemeozmzxueamohxhhogyzycymeucazugoudhamzaoxheexxucyayaffmfuomdcmyzzydzzhyefuzecczyayoacmdfedycgzehdxhyudydyccoaeggymxacazmfxdzcodmhedyxadxmxocmhxuxgmgdzdxzxdhahhoouzugczfxyfxdxyzdgycgmgeuzhgxzfezzhyygdhezcfmzxzaehahohczxhaedmodoezcaxfmduzgcufuafhdumxhczzxgxzuhaygxmuxgzguouemfxxghdxoyamazegxhehxgeexdohfafmzchmgyozegeaxzmaahggaxchmeoczcfoyyzfoxuyhuezgggfcammfuuaughgyuugmfuoacuyudgefmazfeyugcgageooyzhaycdmyhfucmmugggacggaxgcchdhuyzxhmugezdghzezzumomuoocgfmzyuzxyheadcumhcahdxzzxazuyymogyxgcmammadzgxzgzzcuuugazegzfxgecfuuzcmoofyyyegxudmyhzgfedyfxcxxumzdomzzmexayhehagyfmgczhgxzyuummcgeuazhxdeegzyczycedhdduohxuecuhxzdhhhmxdmgofhfgfoomocgagexuaccffougcczfayhxyxogmezygoogmofzdfmofyfzzyuzczchygdzgyadamuagfcccgyzauogdoyfuyyyzmycmuxoacemyggmdeygguxhumozdxuxmazdmmaxxmmzoumeamdydeaucfuxyeagedxymuoxyzygyaocefzyazcuffhuzghfhgxguhfcyezdzuaoohzezyuoxzzaoghymfhuyfhcdeccaffymmchxyyuyoaygfzyhuyaeeyeahuuagdhgddhyxauhcucfhydcdumfozazyhahffghmgxuczuyehdzzagxamoocycgexduzamdyeoffuofgagghocczgdcdcexaggcfogadgdyzaaxcggzumzaefdezfcgdheuamhfyhuygeygyedefceuxogaxdhadffyemdcaedguxooyfyfxymdxmdhzdzcfzuoxmmmhezecguhdzfdzuxuzzhymgdxuzfcudezzuofoxxdhyfdehmchoddoxamaogudzhzucgyyycuxcgygcffzxhyohhceeouzocymxcoagxdoyumcfxuoxzugeyuuofoycocxcygxoxeoozzggghzdexxzhyzudgodxffcczmooyxozaxaoegyogzxgohgoedfxedcmyamxuguczzdxadgcmddhxezyuddmzhyaydzddchmxggaeyahyymeuyyhmyoceeydfmezghcexfzuufxzgxgxomymmghogzymfdfhyohecfafgchegyaochefdffagyemyogamcfgmczzyogaouyacdmxozecczdhghhmgmgayzgchgxoozguacuzfmzzahmadgdzhhmgxdeahgxamyeyhcffhgfdcdocdoymzcaygfymuemyzahuocyfuuhxdyxozcuhmhxddfmofmhahggfugzhmazydcomafzfxoahhfoyuhfdfomfgxhceyochhfchexymzzmcxyofzxdxfxzedxhgmmoxacuoocfhocyddddfzzfeeuyzyyddufoocgcozadggzogfedmummuogacfzzyxeeaeydmdmfueahfxyfexggcghgaxxyfuhdagzcdydddggyceomxfcumzoygcxcmfyxmocmuoaamcfafhcumdaeemducxahoxzdyyczymumoxzedxmdcymhmoyfcomeozcmxhczaxfgeuymgmdmfcdcgyoyyduufumdfofxecuzyaccecogoagdfaaaedchmgomzdduxyfoxduyazzocfeyeduzeaguzdxmacdgaefaoghdhmuomgzxmxemyzohzzhyhxcufcduxddemzxmhcmhzaxzfmfmgyezdzudzuezmdmeeyyfxozhdfxzfemafgzgddxuudhczmgzcyxfxdzoaxcxgcouhzxugdgeedeocdhcohdeguugcemydaahgyyhaxecdhzcuxmayemdyyfehzghxouyofxhmouhuzgcgumyzxcayhmeacecouzogofaufzacycmmuacfmfdaoozfgcccadecmheemefdgfugcdmeeauddzcaxyucxaemeydfzgxgyeauocgdxxouhxmmoccccdcxzofecdfedcmdmdecaazgehzofugcoehcxhmmgohyedcxzaauxcumceodegxofffzuhdmcgzgmcydyffzzfyfymehchcgxycdaofhyouyfmudeeuuoaxdfuuzdyehuuxehgzyfheadxcecoggguyzhzccmmzgfmddogooafeuzxczfhohexffmgahghcomdfcdcdhfggfcgcxaaxyeeaeadffeyoagfueacfxxaefdxgugmyzfxzugzomcheeudzcgzafmcehfmfachuaygfagdmxmzfeozacdcxyuzhxhmgaydxyoucfdhcmyoaemxaahueameueoadgfozdgfuuaduxoofmhohxuxodaexucymouzehagzmduyxcyemozcfuaoxymhyyofadfaxmfymmxcoyafgdhauuyhmcuyecfeahfgyhymhegxzeyedhxfzxyaxuxazeuhefgxzdzdyzmghmzhaodhcmoxyxyddamczfzfoogfahcxzmmydcedxhdudggmgamzgmzecyfxxahedxazeymczfoghuzffuamghzxdomzfmehgodcfozxozoeucfueyduemadxeuxfffyummfmdmyygyuuumadmfedgdygahguxdfzxczggemcuegugcuaodyaocmcooazzcegaemfhdfzfgxeoxdoxudomeaxxzzdxdcooodeczfmcdfougyemcaaahdgchomgouucfacehgyfugzaycuzhmcaffuyyudccyfeducgcafzxyyyamfaamuydezfofcffzdhgagxgamfyyceeuymachoofgzxcdmzzuhccuhyddohxzfzddycchoffcouheocfezxofuhyxxdomuhcmafeheafuzmgddmfxefcguhxfdddgohyaoaoeyxhzcgeaofuzzyxouhgzcyfoegdeyazodyxemfgodggmdggxgmgcuhzxcozahffxfzeoxdfcumgxcgehhfxhuxhgxofuzuegegxcfxhfxomhmfydaezfczeegccxuggaexzuxgxeyahcgxyemgfheahxfgfozguexxugzfaahyooufmhhfazzfozzfxmofayyazefamxyhhmauzdgcdfommzhuufueccxmfadzxudgacyzxodeyfezxahmmuxxocgehmugahuayheaymuoaeeodzazyeamaydmoocfcozzhfuagymuamaoegemymghueheduuocymzhmaegeyegchcxyaoeghhhgcxaezmmacygzfuoffuefxoeyoozffxccfuefdofczfguccohhfmgxzehmxhzageomydmefcxueofoxezacyoeyyocmzuyuyygghcmxfddhyofcczmuzxdgycyggxeooeohdehcxcoczyyedugoxeccgezoeuhaouaaczcahzdemguuuemoffxghxxxdaxgogcucuzfzogedhcmxfcguhfhxhozxoyxhmmufoyefhfhcgdhzohemxezzyeoudghdoyauozeemgyecfdfxxedhgyaedmzdyhdczchocdoczcuzxyuyudyzhydxxfzfxxxgychmczfhzccgcmyudahzzzxeoxhyufzgfoxfzdoaazuydafcahfaegumdfucggmyhoazgmdggxfozoyoxeeduaumgeaegdaahxugzcdghygehffhggzexdgxzyugghgfduzffyedefohucohygcymzeyoomyccdcuzeugdhufhaouuozcefuaaemzgmeaeafhdogyofmdododxzghefxgfxfaaeuccgyxccyggumduffddufgmcoahhgaegzozxdafyxxycuguoaofcmyyuhmmczeemcoxzeehgacmdxzuougmcgughhmxgdoazdemueadyuhdcogyzxmeodzuafohaygfzxzaduugyddmcdddzmoahaacumaxofddcxdecfogzhzxczeexyehzeyhaxfyagezducduzozmfxfoeycxoguofdzmuyxzexxgzghogyxeceaduzfczfuhceeoucyoehfzccymazfzgyaefdmyyzhudhgyehoyaumoehcgagedmohuddemxmohzzmyudafdfazxfauooeguecmzhoooxzmadgagzhzdmuuzdxogodzuadfhuxyahocuxguhdyhyoexmfgzmcuzhcxuecxycgxgzfxzxgcezmayfzxayyemohoeygzxmoagfuemcdzuyeagfaucfohhmdgayzayymmxaydfeamouecofczfzmouemuuduzfehadxayxefxgcydfxgcmxfmdzygyguuaauuxogydmzhgcxeomedfycfyugegxhhfddaoazfeddcggymmexxeydyehfdgoahyyaucmeyouhxmcxgxexcyeefhaagyhdfemcgduefmudyzuuzyzzafyyxcyxdooeyfcaocfexzfzyzhdzdahcohmxmgxoacoycfccuauegzomauzougauogdfzfzxzxofeefeecmaomomxeuyzcofmgzddzzuhzozduaayahuodzfhgcahfcyhaazohafhofmfuagofffzuxgumhoduxfhaudoafgcuoamexecuxdzuagmcuooogezohoafzxcchfhafaydemxgudoofmgamogemeoyufccudyxgoxmfdhzfxezzcyafydhmefooofoxcehhmxzchzgmcceocgdxxcmfcmzxcfuhafhedazmfuagmdccehzcaeomoyghhgyuceaxfxdcdgmfgmxzmaadaogaoxhzzymmceufhuzczmmmyozhycmmhyfgafddzfymxhhzgdzuuzcmofgozfdgdhyohcufeyxzdaudeguyumycxxxfmegmugcafeedhzhzamhamzxgedoyeyxaehzommfoamyhgmefyggdmgodzmuoyczhuhczcaxyddfuxdomefzfycdaagzcaugczoxzgyfxfymhycadezmugfdhmoxdhuyuegdgudxuuhychyxuzodyamecfdzyacxooffgdzhzzugmzzacuzgaadyxodxaxamdfghcgxhxzhozgdxxehdaccyaocfuhzaxxheddgexmdddhfcgddahfgyemfymacdfuahhhffgzyfmxeyyfadxeaxyhgagdmzcduxamgcfchmhcfeedmcdfagcyhaggoouomxzgxxyoxzgafzmumhgcdmfcudymcdyfxafoxuzafghcygaufuezuceacgdxxxgghfgozacaxxfcoyczdchaddeafahhxmyycfagffhgxdfhueuacfygmoadhmgmdgmaohocfyegaudmexmxmuzgeechdyogfxhhyxxdmafmyyyuyzhmefhafegyhoefudxoxymodxouxefzumoemhxuaucghymcdfudxfheydhzuahfdefddgfzdmuxymzyhxxomohffxcmdfoccdydooczamyczfahhezzmoozxzmfgyzcyhgeeddehzdmefdcfxyhxfuefhayodydxuxxzxccumfuymfdzfzufygudocfcaheufygyzyafmhzzhcxhcyyafzfffcfdycfedgzocxfyycouczgemycdfgygohdcxfcugmfyhgxgxhehezcxuyxxmduozuayfmygchouuffdxugmedccchooucdgcyhygcuuyyohzxyouehmuoygzxyadmafgdzxyafzgohhmfmoyccyyouucaehyxczhxhhhefyufoxmegfagmxozazfdzeaxzgxgfgxcyhexhemxcxuhcdycyuafazhohdzcoodzxffyyaafcgehfaxggaeemzhhzzhhzoagafgfddcuacdxcuazhzghmfxodxgxgmaffoadyddgmhueuucycexcgdydohmfmdmohoyuocdcmuufadzhggoeufcxyyxuuhhyyugahexdfaxddyoczymuagmommaufcuycogmgzhxyyoommdyoggcoydxyxyedccucffmogumhgeeadzghdydoouuhofahffahcdghdoemogdeoocxyyffdmhfamadmdaaayghzzyuuhfgxgfehcgzhufoumoeymadghyuffayxcmzczfucacmgghaoageycgxcuymzfacgxfxxfuoheayzhdxcyayemyzacdodeoucdacgocayhxccfefedhdhfoefzoacxxcgdxhxohdocudyhmaafufazmeyufoceeuzaxuayyhzuxxyaazgfzfauccmmfyxfoyodchhodhfyofggheafuguezfadcedxoezogomougddooxddaxuamucmgooadmfhgdoaugahghdduddcgzczyfxcdezhfdfemuedfucdouxmueumaaahefhehgozcudxddxxcgcyagufaxxuegfxaefuxeuzoeudaxdmxzzzouygedfgyzdgxommfehcoeuaauamzuyaoxyuacfzmaceomzygdyxagxgmudygugxzdmdfmdxazggomdoyxdxhyhooegfgcmcxczxxyxmzzhcxahdafuyexzzzfmhoxzfefdyxdguxdguxfghfcaeezfmxxmhefcyefufcuczxguyoyzfcaohuuhuuxdudauhumyadoagmyuxcmuadmuoeggyeuegmyccoeodaexcooeayxmacyhaxouummhudaezuaxyaoczxmhoaooyuaxgdggdcafgazhoxefezmxzcgfuffoxohchyegdcemyxehfxxoghfyzuuczcueuyduymhmzfdeuaacoaczmfagzhfhmxmfoozgohughxzmeamhzodddyycyofgmghmdaumyeeazfmmcfefmuohyfacmfxhaugyoyxyxyaeugfzfygoumyafmfeaehcmxguemaccyyheumahymeouxmgoyuyyugefcauxahyhxfomdumyfoumdhozdoadhazfueygghcoaxeoxhyemgazcfdmxofxdfyexxceyyyacdaxfuxuhfyuddzdozefzdyhozoduxyyyxzhhccafoauzazghuyuhdafaxhecoyxfughdozazxgdyufyemuxcoxxfhgagaygxxayxaddoaezecohxdzeeydfyxuaocuzcuyymogyxfmhechdcygoaehgaxaoafmyghxzycezzaugofuyogdzoguuddudzcmaxxmzedfaxaxheazefcchzzgmgozxfumcfcoxzgxfdxuyeufugmumcczfzduecmfafxoguzxgcchxocoamezegoaxoyoyaocdxuycaecahufghaeufghzzuoyzfudfxmhxxegzyyczhacamhdmofducfzmaheaemxuuzzxcogddeczgcoxggxydyyymmgzuaymoucmcuzcaefzcfgfzaucocahhfauxeeofxgxzxuhhexhxezyemxgxumcefuymahgmyuhgfgaduhfcddooyucgeyofgcdhczogdaohzgyexaeaaxeagccdxzymdmufhzodzxayuxcmxoyxdmgezzmyecacgcggamcyaafcxuhcufomucufhfuuygxzoaoehhozhzgzcemaudexzgaxhmzdzguhdoofaezmcmyaghhohmzoyzefcfofmfoceumfdfuueaxgyugyhhdegumcxacfefdchmedzhocafuuexeugoymdzhxfhegdxaghmfygaggymhohmmfyezddududhzdgfcxuzzeyzmmdgzymhzdmozdmxuuxzyydoumhuzoufedfuefofyazzgcuecdmgcodfxfhcygagaxogycmmomomyxhemyadfxdmfyxmuchzcfxxxxucygghcmdyhgeueyhygumozoyohgahuddzcdgyfmoeyayxoaaayfoymxxhumhyogahmdfaueffhauayxzugzyufuocuxmugyxdmxggchgxzmxhaxazdxadhxcumhyudayacddmcydxyxfeauyzdaczgaxzadoeuzoyugmgzuohhhmheafchyfcdgofaaayaymdgfcfdgfcfozdayeggxxmuxyzzhudxyxcxeggmfaxgeedhgfuefcmxxzxfyxxyaxhzmfahfofgohymxgaaxdohyfzcgzyzmozaaauddazhgmmcdzfefddxcfxgezgxeayuycecuoydehfcfmuoyfyacguacgyfcaaahyhyhdddeouzxdezzfogcfzggayfemyuadyoggfeccccegyxmzaymzeaoeczyydyezumdfuhomyccyguyzccfzydycumoufddohooddyhxuoxymuecyzmhzyumhdyyoxazhyoamzmcmmgdyfcfudzdocychcgzhzufecxdduahafemeyhxfhmyuzehahcfcgdachecuhfccgdfczzzgxghhdfuugecaoehaooagzgzfffageczaoyaeghzxdfmgefaxxadmegfgczdeeyfhocdugymezzmaezhxzhhzhaaxagzguzodzdxoayxgaxacuczxaxuyhuhcaofefahfohzedzyzzyaxxhhuaydddeumzocyhmhzgmychuazxfmaocghxehuyfcfgochcaueadgzyxcdzfmeccdgcadcoydexzahdhffyaaaeczeguffchyceccyayfxaymzfeufgxoamffgodmdmmehhmmyocxeggzceghazmxodcefefufzuudhaahheoygoheyadfmyuexgcgafuadfuuehxmohozaeoedmuzegmfdcmzeydmaxhezufyycmmugdmozxxmoggxceddcumcydcumoxhmdoxyhhugoffgchzxxmexoogoeuudaogcchmazmagzoeoehhxgzoaaoxgudheagegmoefgfaauxfzgyfuycauoxyeaggouxyouuzmfmxeddxyghoyoumzgcehfzehzyauyhmmgcfecxahxgchcxxogxhuddmgeumoucgexxymzfgmhmuzychuohcuuceegazocuhoyogchcafoehgyoffamfehuxecmzgxecoxoeeczoyuazfxxzxhyuzgedgofmdcegoyhgczcofumedhmmfuggyddzyuxxahyxadauzhxoogghmmaohzyoagzgcyyayoyogayfcafcmuydazooxazcyzygohooyedyocfduuczhygumecxgffddzdzhfazacxeeoaocxmehgchuxofmacxyfumahemycgahygfhedaeymzaocceyhmougeygydefoaguohedggzaxuhddzhdczaoahoyeofudomzaagedxezfzueheuuuhygyuhdxdguyfdchggmeayfmeamxuomaufczffxeuyzzdzuugdyezyfhxcozhoexdhxeuzhxgmyhcggeheemdoczggmmhzycemuhcymheyaoadoxcxcefcgadxzagdzxdedaxhfdaeaymecyedydgzmmxuzuhfaycmoyeyhahhhcmuoyummzmchyuyhumaufhxgaoeydfymoacmucxzmzxocdxgzyezffuufzgaxugzzudyamechzecyzfcfxyeyfcuugchzaamfyxzmfxdaygchzuumyxfddohmhczzymdcgxduohaceuemyxyxzxmuhhozxxduguuuyxzddxhycgeeggoddmxauxafmuezzdxmgaaofyhxogmcfcyuzfyufecycychfhamyehhmccxcfuyyfxzyyuhyaoxxcygyuhucuzoucgcmuoomagcoemmdeaoxemxccmgdfdaxymzzeehydocxucymzdeuyxafmgmouayfmagxmfxhhzmzdxzxgmfmyfuyugeooufexxdaxuagheofcdmdymeexdexhgufuuezgyoezoeuxxhyfyhcycgdoxezmfomzaohghdocufxcxcymmufadxmexfgdmuamzyhaxfxzczgaadhgxhygcegyzofxgfaymzfxgezgdfcofcxhcgmdfgyuagodhmxazegmehogeaczdchouhufxzcexgdudeyoyyyhzmfcgammyoeyycoodycdgochahuzzchfxxchfguucdxuyzccmoxdfxxfoffcucedmecayuhdhhxcuyegmuxmffoduzczzygchffadmzgygyyecucgadadhzczzdmhmzaceoyhoauhgzyuxdyagyzecxmuouuymdhmhhuoexfxexecmdaxxcoxoddzgyygycxefyadgmzedxougfxeouzocuhyhfmxxdffycguyyfoggxfhexuafxuagcgdghfmcyhffhxzgmgxfcdzyghfmcycexzxdagaagyzhzzmodxxxgxcgxoodgfygumhchyaaeofgoazxcuzemyyfaucecuymmozcgdhoxgyacgzxaucamuhfzudcxfxcuymdahuueezexomczaxoyfxaudamxzuyczaoyxoeecdmmxzdhefefeoxfuguuxygauegfhdxfhxxghuhughcmcuuhymhcaaxhgxfyacgmuegcmxxmzgyhyumoegmxzuzaxfagozggdafyomaoccyzhfodcheggzzgcddagguoafagmyxehofxomfyzyuguhuhhamxeuufdfoaccgafdmmxueuhyuguycadyeghdzdamgfgddhxzdxhaemyxfzaadfgfhuymdxfedohzxaffhadehedxuxuzehmegdguamoxefymguguozcufmfmumzoxcozxxcmgxocdmcayfdodfcofmduogyzzdadyeuzmeoecfghgyfudedzxfxdeayxxuufxfodezyyooexmcxfzmdhomaomyhyycaouzexayxfhczdcuyhcxxagfoehuxzyexxfeffcdodagfdzyucfyugoyxghexazcmafehoeyhodammuczoachezfeoccdxxzhuyfdxgmmaumaxhagdzfzxxzcamuzhahofmyymoxmggfmggyyuchfdcgfgumxcaegzozdfmxfczxyzazdzxhuexfofogufhhdmydacymgumcydgyhuuumdadzxeceycgdchyyuoucgdmeuuhzmmdychmoyemdhmouzxocdxfxfeuofuogchaucxxuzofuyfecgodhzoyufgghcadgfayzeoafaaoyayhxzahfgemdmfxcfuexmahdgmcucfomdccggdzxaooxhyuezdzuxhuecfgxfxzaughouefzfxcozyyfcduddeozyhozdhmuudhdzdoydchmugxgummoexoggchyxmgzxdzdayeymacxueocaehfygxfceofeucfymoghdfzfxdcuxemazymuaohczfaffxygazyhaoexzzxgxggdayehdofhuhxgodeuoxcuczmayefzzhoyxfuxzfzygeuemmucodgyechmyffceazegogxfmeefcagyecdymdguuaeexoyudydfuguuygayudeoxoyucfyudzyaeczozdceedzoyoyfaoufgcfachxhhffgecmugdezchhmuugdfmcdxzoyzzcuhoaxghayugxoxfhoycffugduahxgydeyghhhymfxugmohyzmddghafzdomeyxcddczxyxygaahddcxdzmumzduyhfhgdfxzhxgahmgyhafzefmhfdmeoyhdgeamecghoeycmahxumhgczhegyxcghddyayuuefmeaodzomfacuzaceyfyhycyemfhhuxodgcdfyeuueecxcuyyzxzoxzzzedghzzxaagzemdfmexumfgcfedazduxxyuaeeexfcozueeffhgmxdmmaodhymyyzaoogefdoahhgxoghcdhcffyocuzcxzyfufouxzeyyfcfxmogueuehmhuaeffmdxddcyueezaczyexfahmxdfadffhxchfouoocfahddeouocdzyzuzozeayhfhyyuzeyedzhhaggfgmuzcuczhgduxocxzduexehzgzfoduhzhxoaocemdxaeehgyhmfcyoydefycfemhmxfyfxecdffhgdgauxhcdhuezmfzhoxgxxozymmumyoazddffuyydgcyzmaueocgzuumozhamaxozeyzoxozyxcoucezofgucoaoufdcgmfoxxmgomamhdxefhemhdxddxececzamyzoyugcyyuyddamhduffzmxhoamuxyegyzhfmyzxohgccmmghomyxfhmgxgcuycduzeexdxcufcmzyxfexaafceezzohchdohuhgoeduxeexeozhdmhcuhadhdmmuyuaegmzxoyahedayxxzeuedzxzdgomfhmcmedezuhhuzcommfggfazhhhffhgyhdouhdcyxxouzofaoguzzgzodaaedcehcazfcxfooddeoeyghyamemdueuxhuhyzegugegaouhoduzagefycxaaeodzhzyhxemmhgyhugymfxgyzfumcdmmudouomouyhfcdeocgxeeygeadfhydhzzcaxgyxuxdzzougamhuomcfhdxohcczahcdxzogmfudzmgoddfozzuuzaoeudfhxdhudzducguuomgaucuazmfodzhgodehduafghxouccmexfmueccyxohcyxddcfhgafgadyucdguuygaoecofmgooehffcaedhgdmyhxffgfmxcfhoadzxhyhcdhgamxhmfuzezfmauyczhzhogzadffoaumohyzuzhxzagohomcygyyfxgcodcehohfgaaccuzfuhugceauxxmmoazefhaaecfzdomyedmdczzfoeyggomxzgegycfadmgxfguydauxgyccoeefceygyxxeooeouhxgdhmuefzumdmedaffzucmegeuceyefooxeoecxfzyugyufozzmhxxxoafhymhzgffzoggufgcuzehfdhxggofgxeeadufaguaxfehzdaeuacfodgzefhycdezcmuzfezeffeyhcadcadcefdgudxgohyxaxumxdfymaaaeydomadaedeegfmhagazcyeoghmxgyxzmgcuheyadaddumuygoecmcuuahafdzzcohegedeagzechfzzedcfxccxmxauhzfuyegcmmyemddemgfoohoxmzhfezeyxuczzzzfhzczzmgozcuxuhmmghxxcfhaydyemfhouzyfdcazxooemodmhhzoumhaeeeucdzhyezahumozzfdazoggdxdoezydauhcmafuohdxgxzhcxyauofxgooafdufmhcyufochmuzcuhfggdhhdeeczezhufuyyfcdhhdeyuaexgecfhcayumdfazeagxfudogfomgfamcxomyguzcxmzzoacamfcfmmcfxhfmazmudfhgfededgyxhcufcofzxcghycgoxfyeooeuodufceodyffuudzeuzchyeeymxugxyucxzoyegmozmooxcefxcxucuodcahzoymfhzadcdocdozcuddeefezyhdmmececyouhfaexazuducdufxzfxucxeoozchzddhgmoxycmymaxfygamogyzozmazgezzeazeyzhddhczyhfffoccxzfcgcmaahoydfeyuhcodxzzogcueduxecxeaogouxgumufogcdaguhxccazedfmyyyoumyhfyxxozfxoyehommofegmxxeezymmyomchfxhagammeoxcfzeyxeauzozmfghygyzeheofdeeoyoayghafcygmuogxeafyxyogdgfuuemyfdyzyhazmmuxmzmcdfcyuddxeffhgaazgeuhfggceyzmgdfocxyzdfcfgezymcxohdzofddfxcugguxxfhxgezgfhxmoeadhaacezzyaayehuhfzffhgcdzuaudyamdyadmcamfeoufgfamgzuoxgyaoadzghafofdyadaucayayzxmzchyomafxecazzzghzhyyxaoyygzfzhzfzfddyhmymceohazugudfufycdzmhofmddhxgoafuydmomzcmefaooofuhaufehuuuecoozfmcddgeumfdeemdyczumxdxmyahuxeumffmmhcygoyadxfufzmgyufoufahueguaufoeoageozmxmfzofudxxadyyxxgcaadaofuhozfgecofxgzyzyhmhfdgyaeyyfhahcogeamdeuceccyeecucgzeagogaaczxzmcoyzhyymogadcaedcgzcydhmdymuhdzuaeeuuyzoyuayyuuxhfygyxcyafyacyxxhmoyhmuhoyzzfzhcexxaehofmdymzxffxgoamzzofeufxzxhcyzuudgaxfxduayxfeyhfegfzaaxucfgomeyczxmgxzcmeezcxzzohadadyzycdohcmhfuxxdefyaugouozcgeyxdzdfadzcudzugddmhxfygddmccodefycuuzyodmggfmfydccucyoffgyeuegmccfaghcdxeufyxdhhmaohfyogcuoduxzodaddcfczzhemexaofcyxomhgechcdfeoduugfcyfaoddfcmuhxmxcdcdagzzxxzzagfefgughhaughgegyhfazzzafufemcxxmxchxdxffchodaegoyecucxgodoyeuxgcyaemxxhggohdomffghmdmucehomafxoymxgaamuoxuxhgdyyxhmofozoggfxgxgmaaumgczaxczdfxaydfxughdchfaecemmyeuyaefyzyxdoaceumoggaaycacmhcfcmdgdgcdhdeczcgcdudmmdcuezgdymgdzayxahococefczzgmmxeuyzeodchdyoazmhmfezceuyxccgmyzfmamfhzuhxzcmmyaxfddhyzamhgyezhdghxgxugoyyyzmceeafhxcodagyczczoychzzyozdcxcxufgxaahghyuoemezhggxhxyggghoxfmomocogzfggaygfccggyueggxzgoamefzouxoufmeuzeuyuaxzfymdagaeaoxgufyumdocxemoefzuxdzoufzeheaouaoohoaeemxgdhyoyzoxycecxfgugcoadhcyfefuayedeyzgcoouffdezgdhcxecdhcxxhyafumyuyuozxhcyzmmzmcfxeacmczhyfadegmedhcfxygumfoumhcymccxzcozohecdggocomofyumagugczamczmzoyzfuyydefgdgyexgyzfduyymomumxoezemxzeymmouzxuffhcaehmxxmumehdxxxdgxadoyyhxomozzcffeohumxuyozdcoczemgfagaoghdmcuohgocfgoxafofhhfgcamxzhmzxxgmccuauhgxyyzoczfazzdceezcoumchghfocexzgyxomgozhfffcudczymxyzhhgffgoaychduadhdfhuxhexcyzzefxoxmhfmxoeeggdfyxuduxxdfmfmyhxamacdxgxexxeeymxdchxmzezzdyefecuayofhaogcoadmaxuueoxaxxcfodazyzffodycmmgacozchefzcmgaogagdcmxdccgxhoehdceyhyezxhuzdxfougagagdcfzyuyyuhfccazagyfccozdomgmczzcyymucyefgefuffefccoxgdfcxzfexcfguoyyaufxaxuheaxzdeaahhddyhuuuauhoxgcmodoefzmfaegygffcoefuooeffzccyadfzdaffuduaxmfxecgxafuhoyhgfxuohuaoyaxooayohfzadomdeezuxgeffyooegudzadeghzzzeoxcxezdgdeudzegoacyfomchcyxyczxuycghexozgxzuddmogczhzgfmmyeyzfecoeuehxaehyhfyozazgdgmgddudazzmcudxhduuxfmxchezfohueudffhxoxgamyxyhmduggzmydaafozxzdzdyzyfuofgxdmdxgaoyzedemdxohedmzmycdmeghafuooexhmxuohodaehedgdyfhoayeyhcefaehuuguxfmymzaxcgmeayyxfaymdddahzxfgzdfhogcugfmamdxxeodeadfgaufgcddmyuggheudychdouzxdamfamhdagmozohudyzuoceagacmyuehuzofhacyuomudmyeaudxgdoxmuoazdxhfoaaefogchhfyoyxadazydumaxhuhegmzccduueyfdfxxffaaddxhzfmeyfxhxcxmoeomofgdedfdfzdguzhemhmgmgehodzzumhuofudhzdaohfmhfuxyggmmaoedyxocxgeuuczfuxxodccufmxxgyucohxcmhfxgfaamefxuoedzydogeucuxaxmxhegomogxazexudyaougofgazchdeuozmugheczoaofhoedfmhmoheahhydogzgmfemmhddocamumzudaexaogeogozdhacdomhooyoxzgehzyoxyzaydxhmufugcoahggzzegemaacgcoddxomdxgezmcedeuomeadyhoexhuedydezaggyuhgughmyheexxguugymdmcxdduamfdgaoxuyuhhoduyycxmexmooocmmfxuyagmcgemhuhgehgfefozzagxhzxdcdhzdofyochoaczehuhaofgaezohzxozugyamggogudcgzfuegodddcgfggxdxduegoyygeofzagcmfeohmafhoxcdgdyxhuhxyeeufemfgdggccxmxuaxudghoaacmffeoffdcgfffzxecymmggmedhaygoxhuahgafgcmoyhgyefxfmgdadhmyozxgdxmecemxhxgdzhghymamuhyfgyaoguhzafcezaadeaozgeyeyauuumaggdxfaghzedyfyxxcdgegafecmdcdudaocxoeyuuedmuzdhecxgyfgoyyzzcmuoufzzyeyzfgcezhdffdazzmehofcomxaceffdxmfhhgxzeexoyoadmogucyfehmaugcyhezzemazzzmedfgegoehyocyamzyduexfyoxdmmoxuyhgoohuzzgyufxycxdfmoeammaxhdaxogayxhchfaduzxzaumdyaouaumhofyfahuocxehoccgcgccemmamudmxhudaeadazoemmhguhyyhocuacmhxgoaeygfgfezyouefxxucouydzdfyfxcmhhyahghfmooeamucmezocoxadmhgmuhczdfhuomfufghcfgcofayxfaecdeaddgxagzouduozuumfehmcygyzzfzgemhxaymhxdxfcduhdhyfyzhfadccyoedmcodeddxfuuamyauxcygfuahuhofuemoyoodxuooggegffuauxyadyfmfoxcmgucdodehdggdaugcmamcceguyfuxhyammemyafcafexmfeucgouczhhooeadggxdoaxfmymyffughhyugfefaoadfozmyeezfommxezzfgxumeffxhgfgcofmfoexyyueguozgyxxffcyyzfxayhocxhexuzdocxamccmegeufxxcxuegczagcycaofyacxuaoggchmehdmguuuccagogdhzezogccuzczugmzyehozagmuhfcmzddfcgeoyfyxzuydmdeogddmoaudodaodgayxygymacohczauefdghyhdxdacomooffmgmguyxxeueofhahdxffgacefyehceeoaofgoxcgoxyuhugchozddeceefcdhodhxmcfugoehxxofhahgggexagxfzezzaxhfcumhoczcydexxmfgecegyxzozgxgmuuafmyggaudyoyazdgddhfhxeoxgcyceceazyayuaaeycogfadyayagfoecyhczczcgofeafxyyofzcooagmhuooogyydzzduedzogezzacyhzhgcaggmmmdzxumfmhdcgzfffhaugfohdxdhfgacygudeemogzamyecmoaydyfgxucfadgfzxoddofzhhoffxeezgmgxgzzmfmmxocfzuehuxaaouehoozohhmhccoueaomzmxhgumgxazococdfammhoemoymhgucxhdygaugfcdezzcfmhzhcmghzuoaguggygduyoogcfhcyammzxmyeumeyfaggaxmgxaugoxmhcxaxyyheyzxxezggdayfhozugzoxghczoexxdofomauuueaxamxxegyuouauzoyedeaoydoehdhfzhogmzohzxcdcfooduggyxdgyucxyxauxyzdzzyeaxmufmmgdudeyzzuucgxzazgycdhhodffozyuoogozxedfmofyemumzoxayxfaxofccxecmxcuuxhaeyaadfayouamuyfhmmuhucecoyfahfzagcofgzmxeccoaghcfcumezoygacmaxchehuxmemecadgghfxhomxdeoaacffhyoycxxmcuodyahyomomcxoyuhfhhduuducazhxffaducxegczdzgmaymfdoeuxeyagyxfgaafmhxeyyeymfzxffgzxygxmgzoygmaxdgzaaehemozdoymcyezhcmogamgzadmfacdueudhgczygxguhugcmcocehammdmzxyahfmmxadfmzhceaaaheehuffcufzmdogcyzyzzycmemhzemooedecgmcgzeyfaedxgmugozayugxyyzuhhdauuczhmxdfhfyxoycgacxayfcodzdaeuafecfdfmzoucmcayhhaudfomeaeuccxdexgfuxaexeahofzxuzggdagxgouygcoauozhhzdycmeafhfxcmhyafccdxucxfouhzhxmzayyughaeaogffacdhegffzcozfhacauueffochgauzdmahoceugzazfmaggzeoozfugffzexyxuoxofhzmaehcooxaggahaeddmozumxmodzohgzfdczuxczfzufhmzchoumffggfuemyxmodfmumdmheoyydhohgfemyxzeadzuemedayzzxcgmoeffhcfahgxhyeeymzahmgfgfgmzcezxfdyfoccgmfcxmeumdmzgxuhcogcxeuoyzyzdgycuxchdgmmgxaooxaayggaefchfgxyzhzgffhxahcexaxzefgdhdcxmfxcuaugycfueyymhfccuzochucdmcyemmyzggdhooyecexghcoayzadzfgmafxxecgcuxhfcomzfefzuymxxhmoxeeueufmecfyzfmeeuuyaxeghmdyafouyzcxgxcazfoduyxmzagyxaaugezxzdxzeafddayhdoedzcycxyxyuxfhhyfyodgadohoxahzccxehzueeyzayazzoozyadyggdxuuyamcxzecxgduooaxmmcaxoyeduuoucgemmmfdyxxgohmohhyoxyomumzehzyyuhgdxdeemdzfaogoefyehahfgczaauheayggecoazazmcfffyemhaecmxefyxgyyeddadzgchomogzxfedohxydaucdzfaxamzocxeaefocofagzdmuymhooheudmmzyhcfgfgxfmdaufycaadzamdguygyfozcaucgydxfumzomuyyfumdzoafoyexgmahuzyhcucfyuhffxzgghoxuxmxuamhuxouhzeouccmcmdmcgffhyfofzczexdueaygxyeofaddyffecxaogayhzuuyfxxuoccgxeoayzfzeemdcayzofeaaygyadozgedccoxuxohacugfygdzyegzadyzzyeffogexxouuxgxafzfhdcoaaccdcydhmuffhazxzyzmeoycougayuceuxegoochfeouffcfczoyoxfazogzdmuxuooxzhxuadzzxafhdmoghufahhezchzydxezezufozzuzdhugmfduxyeaymdggyomzdyaxahxdyezmohyhymffxgmxxahgdaamdhezhdagyzmaocyxdcgameaymoaaeeyzhcycufhgedzmfaugzfcuegxheoyemheauxooyhxoxmuzcxfoyxeogfeezmyfmeuyghzhgdadchuomedcofoafxgamyceaaahxzahuhagoxxmffhcucyfogggdexczzadfchgmxgxofdcfhddzcoaohczgfhdgaxdxeeezocyffcooooamccfgcygxdyyxxdugmhugegoddgcmafuemfazxocfcdmmgcecodgoyxzyeyeeoyxoouexuacfgzgguyffhafhauofdxhuggfdeacgfxzgaoggohcxaehgcgezaxgdodamdgycxadaguhecocyaxehfmdeexfugxyuuzfzuauuffyfmzyayaaaazamyxyeudxaoecogchehfzcxucxfxzhhemedyexggoyezofuyxhfgxocaxdeedoufcuamdzhcfhfhgoxgfxmyhaeacyceozmfuzudgfcyhhofyxeayyfedfcafgdygezhdxuuzmocmzhuuogcyfaheohgeadfcyfdyhuaxoxzmchozuaxzodmafauxycdyxocugeamgocoefuoucuuxumyhfmfzadcfycguuzgcogguheygdxezxhadmyfezocuxagoagzhmhuzegouffuxcyuxfadudefaomzohugxgxhuaycemfucudzyudhouuexdzadumdgyffzzoaymafxzyxzfuoogaxxuyzgacohfuhxahozzggfyaxmoxuzahzademefhyemxchfxodyhmzyhzduhdcoymexhfggcdozgazdcycycgmufxfuecxeffecugomhcdcdyzdyzcgmafuogzozodzecugexduohozeaezxzdmaouyeddedhhgozuzogexdhgahedocxyhyxeczaeceyeuxdauefeydxxgmahdyufdyoocxmyxcmehcoumamghzofumfddmauydaygeufgcffzumaggfgamffgfcdhoxuogdauguofhgfyfhxyucayyzceucxezyhucgdufzaxxcmhmcmxzmzzaxcemhygafumofzeczmmyagducacomdhhaxeygoaefhfzzdahyohaxmhufffmcazaxezegazhmoaueceyucgauamadgehhhhemoxdauceyhychzueuezaeufmdhdhyacmyeefegfcyffdgogfhuexydyefyghozcuxdehexdcuygzfdmdmaggufzagchxfzzumxffyhghcdzhffffhuxuaadduemfgzyyhhyaxxcfxduuygedmfzmcgaaayxcyugeyggyudhuygyexhagcfyzamuohgaxuzxomfhzzcxdhgcycfgfuuguadxhzohezmozhaeegfeeyafcohdzgzmxhmezugeguuufgaogeczdoyzeocufuyxgxxgodycfhoeeoxfeeeafhemfeaeugahdacdmchuaaxzdhcfmgoczxxeemdufmmdyaycuuyheuzhfhdzhafoaxocgzcudzeyezfmadoaxaxzhaodcfeamxdycfxadxazgaxoahmhazheaaechozymofdhomucaegufguuxccyxzxugyeeymacddaeygczzzocdacmoozoyacyufgeghdcxmzufdzozmxummgezfygdumagmzogfeagzodeycxxfegccohxoazfozuzyfcooezxfzdhffhzxcxuudmdaofcamcgeecuadcomfzoyodayhmcxdzcaamgcmxxdzxododzeemmfmezchdozazzzocueahgudzhuzayaoecuzzeezdmoaaxadyzxozgoygeeofgzzddudcdacgyefdhyxcgadmoxcdazddcgazcuofzzchuxfhuhgxzzhmmugmdzhchcaffhazyhahazcxzxmyogdoafcfyeommoghuhhxagxcydeamdcyeeuxeaauyozdgzhdcuaxdaoozeugczuohyaghogdaezxdeuozdgdgyaafxymmycugadddcxmfxceoceeuuzomxyfcfdofmzumyfzdydumoydazxhcechdozfffxccoazxgfhxxxmoehaycexcfecoxuadzugcmyfeyduzoxuaydyffauexhzaamxuehyyxuuahmzceeoyghexzuguzxouzxhhdmeayemzxxammuudohdcdmyedguuaugyahyafougoxdgchxduooyxdzaeooxomafxzuuyohxuzozmyudacefeuecmgegyyehefcauzddgymodmedffefmcaoehemyufmmhgfygexhhxozyumuhyddmuxfcgduadcgcdmfucgugcydyyffcfcxeogmuuhdfyhcgzfemzcoxgzegmxcdhfmaccdmzgygyydgfydzzmfhemaexddhdoduhgeygodmguyezogczfmeeouddughemohogzhyzyecguezoxeumoggggyfyxyduyaccxheggoogyaauzfmdohmmoxyhcfdhccoommzuhzecfzdgzhfyueahghfmgoggayhoocyyxuheocochzezezeemxczyyyhgyxfuxzezmgeemxccycadmuyffazxyffgcgxydhuzgffamfyycxceuoexfduxfooamemxxuucuzzfugoxhefeuozyzogdyooffamodhuxygfhgyadhgugcucfdahyxmfeemyyyuaouomcyzuemoxoouzzchucdddxuafehhhhamfzhchmhzazgyfexazyagamdhffeyxaxefhxgoyzyuafydecyuxxzuaoafeegadhahdmzmhzgzdgozhxadefyezdoaecdxxhxamcomaxdaeefmgfgfmdogzeggfgyocmdgmoydaeueguzzhhzxxzzxggmyfazxchmhmeemhdxeudchacucggmmdyeezcuoxyyzecuzozoafoaodmzucdcfxfeddguhaxczoxzfaaxexhagdxhgzgfyuoaxguydudmaydoahzzedfgxuchuuydehxmmdzaozmuacmzdfocyhxeceuefhyydhdmuymeugcyudauehexuedxgyfxmgadyaymcdydfzgxedczgddduyhmyodygfdeyhaouuzmzdfgagmdghucemgauydagccczzxyoecehmauezafgxmfzhxadmddmaucegzzmehyezhyyxmggugmhyoxaxcummhefyedefcuyygexgxcfxxayoggzdffzogucdgdaooohaamydzfmauaouoefuzeudoxyaccmhcyegmfxxmuoeuzfhmmdhxyoghoufogdyaoaoeohydeyoouaohczcogdzmaecxegzzfhdxaycfmchxehayeuzmzuyehzfuadxohggzmdoyaefmadfxgxoxzgxhaeghchefymmmamzzyuuyxmdxogeoxfeodyuzeufzydgdyhhcfafzcczhgcxogxxdxmozufhhdyozxmuuczofxhgxguhdooyguuadzmfyhxdoxuyguaxagxomeefzhyzycdfgezyagaaeaufuoouzzugfoogyuycaohgcmeceymmxzoxzdamzefuecooodyxfdmmegxoghemzxzhehemgdoczddumcxhhxofoyahzfghoeoyfufgxgagyxddeggymzcugucgyayohhdzaueychyuoemdggocuyegdufhoydmyogdgcyeuaucadmzyfohxfaugddmagcdcyfeofaceoogyfhfamhdafehyzhmudczegauofeadhocueufexzomoedoachcehgauhyehychczmzagcfxmmofmgmoueyduadduxacdxfahzfhmayoauhyhemozexxyxczyxoygchzxhcgeycdcehammoxhcyadmahyxmdofxczgucoggfmodezfyacaafmzugeaxymmohheeomeehemxhcdohxxgcymyaeexamzxuhhxazugaexmdgyudeffuyocoagfhdoahcmaeohxzuxxaxyzzdgmouxfyygxfguuehcefghoxczdocaxucagmhdzfucmycczyuyeeayahcxfzyfmxgexzxdhcoaygfaoeegxheeycumyadgzycaxmgohdhzyagexfdygcoyoffcxxydyhaoemzcaudoudcedaxzueggcggzegghmhuggeaadedoozgmfeuhhyxxuydxygahohdyuuymdmugueaucduxddcxfdhgchyafaugcxfmeceehguehzugogomxdyzmueucfeyheooagdfecxagxmccxccoemcooxoufzeucxdghudxzoffghzdgeuyefahcdeggaczcdfdccmgmygffgxzmdgzymhgagyoyheuchachhuyfchudexomyfhdhmoyfhhmxmygfyoudegooggeoyzxudhucxgumecxoeoeyogofecafxzmuxgaeamefuahzczogooyheeacfcayumchmedouxccfdhmymhhcexmzhhdyufdccfyhmmohmdgcyhhfcfgydumdomxzgmadcfguyohgyffeecdgmfyadzmxdddocmxadyzaadmecegmzzuyexmzfmammuoxmfufmgffcyuezfedggmeafefugeeexyezdufoafyuxuycxfyfgfchmoxzchhuygcgcafyxxgfahommeocxzfcfzhoxcfeazomxzaxcehfmdzamfyamyagdueofudxemzymyhmzydxchozdmhmhmgmgymhcyaxzoouuaydgfzhfazzhzofmucxauaumaacuhamdaecomhgfxoehhhcaoedcuahxmzzdzdzhmyyyhyyhcaadyayodoyeemzhmmfoachmfemyfcxxcahugofuxofhudfxmxomgfgacymfxgzxeahzhzufduyfomceehmuadffxuegyzfofdaoffgxuxgmeyoyuouayxohuazfudgecxeamzmgmzeaffcmgmmhxdxxzucecxfufdfgeyzmduzyaxxhehgzcdcexaceymfyzeuxggegyyhygmcuumeaomeexxcddzmuxccamddguxmmhgczgaxcygxudxuaucozxzmugymgyxceofgedzfochuduayyyyohuxuoyzmfgxydygzxumgueomzfhuzxzfyhzxcdhuugyzmycmyamxoagxeocmyouoxfzycgzxoagdcfemfuamxegeeycgzfgcdadgyggxdoggazoaffcygezexzaucyfuyodfufgdzzyxhumahhaxxexxmdoogdfoazcfccacefgodcouzyygdzmguccuaguhdyyuxcoxxuhohymemdcooaexdcyymgfoecmmdcouyfdyaygomaufxommagfdgdeaogdzahuygmyoyozdymyhyydxzamooxaffmdodfueguefhhamyoazzuezoxxzaygamoyxyzoyoyyxdgafehhahggaexahyuoecafxzyzgzoamodacmmodmxxuyfmdgmcudfyyyeomeyaxgzzfdyyuogayoohdoxgzumdaoodyxufzfuafygyozzuezcmycdgdgcfohmmcxaomzxaoduexmfdodmxxfmfxegecdhgazfdyecaamheeffmymzcmeoafhedxmxcfhyyezdoxddfamxozgfudomggaduxuyeyfomcexezyoagdexuoxuxuzmodomzhdoehdaaaxfmmxcecaxgycmxfedufuoyuhazhgzgczdyzhxuzohxxeohfeexdufhdgymdhxuofxdfhzaucczzxfmefaouhydcxhhffmyhfogzfomxhmgzazgfhoeocaoceyggfhxmgzfdeeadhuuyhhhmaeoayugyxozadxaaoyhuyhghzuaxucxdggxayyyuadaeogoadfyuauacoehezggyagmfyhgxdhdgccedgememummyohcuydoxxfyuxaaehedmzyomgougxgcmfoaychmfhxumzhduxfzxfhoxuxeehaoecxuomzofccmogaehcezodomccdhdahcymueczcxydfeeceohfecffayxxzofeoyagzocuuogomdaazghdohhadfmahhomyomzayffcyomeyfexfuaodmzygyeghmzzoueffmouoaduuumuohogecgyhfxazegayzzgmffhuxcfcoeaumcmcdagxxygdhcxyyamhymcxdgagzmumceoehfmxxacazzccmaugfaxzomahahyfefggfchmcdamumahayhmafxdoodygyezzzccuyemuogffgycexxgcdauuhoxcmeghcouzzghodugozhxyfmgefaufzamaxzhxegehddodahdaoouzuhghgghmgdeoudauyddeuoaouxducxoahexamdygyhyydfducaghxmadguhfyecummdhhdhgxmfmffoxahxoeehxyxmoaaezuuzmaxgzaazexxozccxmgzmcgmmxdymgofhxmhyamxughehhxoozmhzmofamgafhzhxhuogcyyeauxafyegxazxxyamoxyexzdozyhfdhdgmmefdchdcezahdcgxfozazyxzmeogfdaufexyfafcoezyezgydzcyzhzgedyxdzuocefodoyayoaaxzyyaouhcfzxcxamaaoddzmhdcgohuyoohuoaeeozcmmcdedyooucofuyzyfdmmheeuyzzhzxhdhuxfhxdgfzeumgzfodffchzcxeyafydgdgxozagyxadaaxxomoxcceayegczfyxgfzzfufoaxedfoygudheuguoeyaheecyyuyhxychmudxhcuxcafxzdfdcfaxxezcgayuxhoegmzxgudafuohxycyayaaoofczamdoyauumayfcdxgemuexzmcmmyceeguyhgachhohfmfccmddffcaddozdgcmmmdzmexdcgmumfhddmggyaoaxufhhhgcdhacmhfuoeoyezueehdoechduomahaxocymehyedfumaycuydfmoueeyumfygyeoyfucgmomzfczdhoeyuhoahduhmydyafuezccazdheaygeadueaffguexccfxaefhhdyaeuzfeomzdmodfymxmxgecxccgzchmdohdexaxuaagxhcyzdoehxffexyocdudyzafofcgxfdmfdmcxfcecugdmoaxcecdxgyfyfodezefeuoyzcmahcxcaeaaadxozyffcmcaegugyhmdzezgodmxzauyxdhyyfxhgaozadcfcehzafaxmguxcmdcuoudzduzfhemdcdmocoyaxfhgcymaxzydhgcuecamgdufaeaxxgecmmudozufxxfzeomuyeuxdfeoucmuufoedaahoceccyooexofayuaggfudgdfymafzydoycddxffhdzazduhumoxzcyouduafmozmdccezuxxzzxgxmyyfgxgxyhxmxogxexudgyhogocucodyyfoomafdaehffmehayaochxfyadfmuhzcfgzfdyoeffmxefyhhuyoahozafuefaazfgheemyxeayyxggfucgzmycecmzaymodehogedxxzufzyeymyyyogzafcuygmfhodydomfzxfxhxfzegzcduzodyzggezaocadhuuaxaxxeeycydofgexedhyyeemehhafxfgoeufogcayuhaeamaxgeaamxhcaheexemfyoexhmffeudzaamyezezegmhhgohhccmgexemceyczymmyuyygemedgazehmyadxfeaoyamggcmmfyuooxhooeocffyzeuydcxaooguuezzcyyzxhahaymddguuadzhcoczhuggzoyhuyuuooghyeoazxfaxuczxuazdcxdzmcyhayyfyyyoyyyoomgummugcfhgdhcdudahfzcyuzedeuogdhmodddmhuygxddudxzdxyouccfuehmymaoefmyygdxhaeudfauhaoyzfmcazhygzgeguoyhyhfyeydeuaocayghfefxhffmdxfuomaodegfcfcuzfmyeaeuzdgaggdyauocuadeoxuyfueuzhcuhoxfmeozuddeoxecgzhamycxccyoudfgoyzeymcdexamfeghumddexeofeadcaggzhofyguhoccfxmdhgcoxefmfmgezhaxoydmaaufummyomcceefhmxhyoxzdydggdzhomdoxxadzddcgmzmhhgzofdhufzaduccouhuohxhhfxmydohhmxdaxfhhmeacfcfgegmhehxohmxzdaxmgydoaoyfhmgzocmazugaoemgohgzfuxghacehxhxxzhfdffxfgddcycdychmffoyugychdzxczxeddeeffmhdffaxdddgyoufuguafayaayzooehaxzychyegufxyoymhxaucygzyfmyamhyxgcadgcogmoagxxzdcgczmocddhfcefoxhxxzomyfyxooahefecyzcuhhxgzuuecgamzhoagmuyamxcuhmdhdcefzhuxyzyoeogfzxuzxuaxzuxxuxhcmoagofmafhcfyzhyhemomefmdcdgyxcgxfgmmcgmyacmfuazeocdoxxfmahfmzhmcyhmmmmxufuamycfzzhfmuyhyufdcyycxauhaouodgugecadomdezhymdyfchdmdahgzmoughaxyecmzfcfodazdaooudmzagaooczgzxeedxcgeaehexcdzxgxxmdxaxauxmcmdmmxfcucuehhhececxyhcfeheugohcghdoachhegfahuezugcdmuhxxhddgaumyyeuzgdzumffcedauoxhzuehmxmezcxdffoeemefcydmyguxmuxmofmydocmfhxxhxzfcxzxyzdhfmudhzmaahouzcfeyodeumyugzxegmzffemeddccooxeoghodcgfuofxacmxdmydmhdmzhgfohfmcxhmehzozuomhcymxuouygdxdaaaxmchghcuxdxzguzxmhmczamzmfhcodyeuuxuyzudemuummagfmuoaxzcmgdyduxayeyhhfcmzuzzgcfyoadhdhycxmxohohczxgggcooouygguexzfuzuuaodfxmfeahugoemddoxzmucdodcfoaamgguuezmzfgdyeduxzdmmzfyexcdgodyguadxmxgxgexcozcdzdzzdygodeehfgdgyymaaahfgudxaxfmzyyuffomdxmheegahfmfmdzefazoxheaydfayyzuzcgxofmfahyuahagdgyfxaaczhzzacfmcafcfeaxfgzxahedmzydagddmayohohfgogadumohcudexxfhxgoehezogeuxgxyhcmmuhcxaofgdfdfdaycdggygaaxczaozhxugyzhfeczgeeoyzohchoyzoefazzgdyxccogyzcuedohzmcfeofyahohoomfaxfhdfxfzoaazxcxfmofoeedafeuoaydxzhcmcofdxmhfgffzczofacaehzfzzhgaduxfauexyuuoufogyyzmuhmeggxmuogmyyhfxxfcefxgeuxdmaehuygfzagceeyaxhhmgduzfaoxcaeyyecoxhgceydhmchadyzcyhdfdymogzdgcxfhxahuxchyuycxdechzmyucgyaefcmmomgouyyeohmedxofmhaaoyxdeaoahefgmgxexzxyczegfhezdgdzgyxeyezohzmhgehyuouccyueaezgyhuxmecfzmhezuahadhfdzxxexzhuhazxydmzuxxmxxmzxxgeoaomcayuzgdzzgheuozohdzuymgemzyeczoydogfexddfeafdyghdffhdgexdmydecggygcefafydgggmzfhgdcchxfgfmhcfadyauyucfmmgmzcafhxeucffgudgxxhyxhcmydmxoemyefzfhzhyedyfuaydadyhfxhgdcoguzdahgxycuuxccxyzcxfzeauymdeezggxagfccdhemcadeyggyddaucfcyoayzmoefyyyuzyeffyumxefdueuaecefoeochdcyuoecxfhdyfxcmczagyamhcayzcohgeezzxoxexmexgecdehdeczuhozocxagyxhugzgfumozhdoagcxexzffhugxoycxzdmdeyuadzzgueadzcyedeaaohxzmeexcemxdhhzfhfoacacyaaczahochzyhmefdxcgxdxogaczfexdhdxxcxdacuuxfcfmdofmuduexdhufyahzgcxazgccudgouyxgucxxgdzxozfeeuuaaucmdhaxfaaegzezzoxfychyecugomxufgxafeeczhoxazzogoedygyfxmooahmuoyyezgggzgazhdoyzzghcfxgohceaeozahemhmmxdfozfacczduaeghomdohzgczuxazuhxyfxehauuumfcuzeuyxogdexcgxfoucchxaafecxmgucezfhyfmcxhzhgchyezzxahxgafuxhxcxyecyemzcdouyuyzehohdymmogdycemyhffemoeacaggegxacxzggyffyaoezuxfofcocxmucuogdueoucoehyzuaeexxyfdfuzhgxgdzgdcxdeoezfzchdggzceecodfgdamyxfxyexgxzgogcuyfxdmddhgyuoaozoefzfehzmffyzzfhzzddocdmccxachuddudzxuyxfxuxmyhcfhdyoggzuzmmfcyddezaoohcecyfahuhefcozugofuxxzaayomhmozufezuycfaguuahdoxzmcfyzdddzghmduuuuuyoucgghggdmczfmdxfamxychoofzazyhoauofzcxxfxxzfggdcafadoouzeeyhedeuzzeoaoaeoxucuehuggohacxemdoycuxomuohegoeezfchofcuofomyzuchugumddfeoeozhaefedooxzzxhezdgoazyxdcyhgeheffuxduyxxzuyoucgodufxzoayhccdozghoycyoeohhxdgafcgamxaucgxggcofhgozxooezdedaemzxccdfgyfeydczhaecuuuehodcxdexuzecccemaofaxazdfxdeuhyuexfugozymdyauhhxgxzaxdodeyxxfadzfdomemagdxmoycoyhfugydddfoyzzyhmxzxyhczyhaaxdddhafozehzmzdeecceymaoaeaydxhffcxedyaxomogfuocezcxoceegudzadmxhcahmgxfugymcezfhmmgzyfafcmdaxxacuhceufacxfhzhgycdeduogdzyuazxhyzhadzmudydzfxfauydfzomgmauzaufdeyzxohufofyfhfzuyzcfofzxzgggeeccyfgaodoaafagydcfeeyyoehacomzzxdgyoeezzgzghhohozhxdgogxydyuoodegzgcfcfeeuhzzcygcxuhxazuxefemchhaaagoamzhfufhofoaooyzeyhguyyaoxyufyhhayxmfxuzhoomdazgzhhmofocyozuofhdzugygmzdffdxdxzfhhyccofmuyxuymfufheyohoxxzmeefghcuxmeahcyeexfeohhmuexccmzeouydyhgcuaafyfaoyeueuxyyfdeueeocgohdaeuzaamoxygfodxxghxmyxhgcofozfaxeuayodamxgaouoaagfozauyxdcmdooyfyuyoomemufzoxagdgmzzfxzxchcegauymgfxeyacducafxgehhyyeufzzumuaoofdeffyeegcgyoofdxdfgumumzhcaegmzcygfzcccyxhefzfudgxmumdafdogudocfxzouazxcheyeymhghcdyzuumfymufohdggchfhzdxuyechfmumgzhudgyuhmxhygzygxoddxumzyfegoxhoxeyyudzmhymzhefogaufdgdohaghzhoguugcuzyyuhazxadudoucmxummddaxcuhahymmzazfccxoxazcxofmhxhefyymyozfuahmzdcmeedyuyhogaxgamfdyazoeazzdoecdfdadezoeyfdycmfcyyymadhgcuhxodxgceyffoahfuccoxhxyeycxhyugdyzfzcfedfgahzyeheyehdoacceyadcgcehehuofouzmgzzgdfhzucfdohhzoughxzfhhfgamdyhceguuaucffuugcfoeocfyxeeyhhyycudgocyxmzgdxygdfdccydxdxudgufxezfxagefgumggmdgyxyyzxeyxhmeogfxazooxeaeexadugyzmuohmcfaeoaxogadhgymuehxmxxdgommgugxaezxfuegmmoxgmgycyzcoaceugeyxczzdoyehzodocohmccmhuocudacfdadfuggdyyoadeyzchaomcdzzfzyaomcyedmcaoyxhfzacxgmydyhhcxzgodxyhmcxgeeczfgdxcefuemmzuaauhazyuudxfgdaecueogfgxooguzomguuxyuahyfxzduceufoyxogezxudmeoxocceuhyxoacedheoyccyufazoxcmzzxommhgyxcoyymczcyyxzzggufhzgxdeydyxxozufychmugozyuyeogeoyfueuzoxeugcxouzeegaohuhfzmazeexhygdegccaxgmhuyhcxzxmaugxxemfezfhfeuhuyecmfmufoguyauacaooeuuozedggyymoazgzufocmefemfaeuacaxccaxodufacyeaefycocxzdxfexoyxhhgecomzcyhhgoumgmaaauaczmycmdfgoxazedugxzcemyhfdfagaoucmmhxouzeccuhccmxaueozmgyuudcxezezyfeeecgxuahazddmghydaougyuygfecaocohdacgycmzcafyoxxhgugxmyfaycydfygfhefhyzghzgameaazdcgfudcghogzzxgxoaehcdcezgduoduyugzhoeaozugfuecxfgghahazhuxdcmxcdcodgyyhmxyeyzoeeohyggcghzoahmyddomadaxuhozumucaahyamoygedfugzxooxceayxzechffgogufmoxxcfghomauayoceygmfhyxfdaudgfuzddxcgazexhdyouezyxzfmfhmcxgadcfcffhdfzggadgyyhuuzueozuoueuofmfcehheuxyehyczheyeucgxfydczczuyyyhycghxeamcuxgaacucegeyuzxgzfzduufoodccffemcfzfcoezzaedfhchdgygxuedohheuffaoxcyzoeumxgozhxmfmxxdedxfhzyxufmggdazheazdfhmfuefhhcymxxmhgyoayzdfgmodccumauzddagxgccdeoghhxfzefogzeyaymgycgfauyfycgageaczozgmommxuozmamchhfaaoygoxceughemgcfdcyuxgmazexazomzaxedfcygmgfoeoyfczaegoyxaymggoohdfuzmgozumhoezgoghuohgoofgyauehdxzudahfhfmcazfooydexffmguhaxmxgxazhzozuhyxaaozzuuaadfufxdemehxuyyxcfhzddxmyaheoecgghocyacxzaemdzgdmouxggdyzozzadeouomhfhmhyeocdyozexuhcemcyuohoyygoffyaohugyeodaxdhoceozohmexumxzyhmehmfxxyuzffcgfdaccceyguyuauecuyhxmfygyfmoyhgumuyeycufechyxucyyuzzxfaufgcgxyuagfygxymxcaaeoeahuaygxeaadcouuhgxexfxogmuaaghocdzdcauzzdhfuegyodzozfmggfdxuxxfzhdfhggzzyyeuxzyxfofmaeudhfugxuhydumoezcgmdfoaxaxuufmzhazyuyzzehxmeczdaxahzyudyzhumocfdmggauuyyfaayouogaymcxuuhudceadhymxduafxdceegddeyhoffyczyufmxaxuzmxzdxuzxcgyucdydggdmhzahczcmmcfccomzuxfyguggzxuhcmoczdmgcomcochhhhydamxhchayfhfygzuoemmgdzhmfxefuxmgyhzfzafyooxafaemdgcacyfecochduygyhfcfhfoyyauemzahdddcuagzxdoecgdygchzhzcdeyyyofydxygyxfgczfagymxdgdfozaezzfhmcudgdgadfzomomhefugoeuhomyffufmyydzgodummmzhdfggzmezegcxhffmdxfoxfecxxyfmmaagaomygdhofxfdxcegoaugeczgzoochouacuecgzxhuezfhfoadaammfycyayfdexeegauauedxgyhcchycaydmdzxzydhayaxmyomodhyccgmhzymxamxcadgxhcgmmgmmazuodudgucfymfzzczgeguygfdmgocefahdczhdfddahxzzhxaggxyyhmoxhuhgdyuodauzehcxcmzeafzeoemfhcxddxycfaaueeyydhxezfzdohcyyaaafmcegmgcahuxfeozmmoumzecuhzoudaczfxdeomaxafuydeaymhxzuzuxadxfccuudfuzcxefuzmefdhczufuuxmycuhegdxafcmamogoxhmmuucgdfdoyxaemofmocummzghohhochyyexdaogmzhafuumouzhdchuexhuhcyxxzxamzhyofoxzzyemheguzcdcfeececgooemdmzdddgggcuahzhuueomuhxufgzmzmmmmoyffczczyoyfaofhggzhxzugcczffuocoooduxazxdmchfoeyfmhafcyzguzcfuaomefxxmedoaemmzfgcfzcgefhzoecexggxazxohoxazeayczefccxxyozoyoacmxxzzyzzmffmuehcxmfyzmycehhhuxxcxxdgmozchgozdegdechyoyhofzycdgdmmyyzcxuouzaccfocfamzcychuxxgamcymfyoooudauyuexgeyydmedhyeyhdfodfdcaedzhfezgoexfazhygzxofcgmyeyfmoodogazuouaagchdgcghmdmzyzofheaxghmcgcefgzfuxxmguzooydezmmfomazgyzmcxoxouzezemaazfyughduoueofozxffhocumxeugfoxcffeoeuxfodayecgucezzammmoodacxhfxaomhoozecuuucdxzzucmemufuogcgcffxcyedmozamdummdzfazzeyuadzfyhfuymuchaexoezdyyeycuooucyzfzgeffeyemuyyfxycadgfeezdcezfmzaoueafuehxucmfehmmzcdeauafoggoofudedamyecxyczamogydmeuamfdofohfhzhgzfuzhfhcuefyzodhodacoohyhfygccyzhcgozmxugohyemxxuxodmfauuuheyoomzxueamchgfuguzzceedhexeooofhoxmhmmghzhxxzduuomhgafaedhzgyugcheduyzzafmmmzzedfuazaugozxxefomxyauaycxyxzfooxdyodcheddyehzhxyuychhhhzxyduumzduaufhyzczmdeyeaouamaggfhyozmzcchchzeehfzafzzyeyyxfahmmzezgudafozyhmzoxdzgcyyfudhfzyyzdghzmymccuefzocmyaogzcaxoemmzoauhgemgmhgfuyuxyexggzzddoxmyxxoyadgzffaafcxchhgacmzgogyuyeeeufmdugedogmmyedymyomeymddozmhyyzzgxxhfhefhdohmoxfmydayemyzmdygdhoamuoahgaehggafhdgmydyoduxxzazadhufdyxozfdxfxhzcfhoagcufggxedyohuyfohaueaeazemghoczcfhzchefzuhyexmuxygcffuechguhhefxzcuoumadcogxmzuzmagmfoehcxomfazhgufezyzozyooydoddyuxedmyyyfaghxeucegymhxehmzdaozdfgfygoxzodxyfggzhhdxcefxymzogxeghxhemygogchxguogmyyexghgyffmyfmzeguexfeyfxxgogyzmfmhomhhmxzmoeexymmmyxamueecdyumfefzaggoygugxomxmaxyaumhoyzdcfooyxuxymfzzymehccoadmodahuggdgmfxoyocemxhxgzuydfgczhyxoymeohucafzezyhmeeczhhgchmaxxxygfoxdaehamzmddmghyyxuoyfefoddgyfogoxdzuegedyogazoofozzfxhegaomcayxhcczmameeouzgymeyzcfagycduaghcyzdcmaggugmyaudoeyezohgyhuzdddfdcdmgzohdeoeogaycadycdfffgcuzhchzzxoaeauccufgfozghxmxfzfmhuugmauhhxecfmgmgffuzahexaamczegdmcgfeeuyhcfamguogceumzocoaeoaegggoyxdzgcafxxmeyafgedxxauoocgcchxcafxmacxyxmmmahyhdofzcugmyufuagmfhmexgeaamugaufgddxfyuydzufauomamuuhmdghdyyexgcdghymxuemffyaxfumccexcmouyzzudhahghuuemdzzcxgeaffafghffchgzadxgoxamyzmzzyguyuaacymaggucxcgxghdgfduoeuzdeeaceczxgudomzfezzumhoxceyexezugycxzhgeeedoggmmohmehxzfefaceedzhhzmgeoucgehmcgogueoezcaoeaaxymeagmoeugudyfmguyaxmacgxhhcygzcgdguhoouydcffeedogaxyffhhoeayeazuzdhxdhchdggmmggxggghohhogfychhfeuhocaozhuzgcgodyfyomemfyyhdcyedxgzegozzzyzedeadxaofxdxygyufcedyamauaamduyyaazcxgzfgodoafycfahzufmyaohyzdghaaehdoamhafumoagmcdxahhheouxczfeyccgdgfzhmyhgxdamydmomoxezaomezddohzcdxhoyymgyyhcumcocxchheezxzudxdxuocxfhoyhdhueaymogadzeexuoeofhyzdoxgccfaffocfgfxzzhefahxeoecygfoohcfaofyddhacammgzcdemdddzuyuezcecuxmfyhyxamfgzomaxuceuxzfdoudmcgdgyxyxzfeuuyxumheghhzcfuxzuuyggzyggmooaaedoamamggxuomzzcuohxmcohcczoyyzdmaeoczuoyoagcxcdgoxohcxhayghyxuyxzmaeouaxgdamguxffeaaouahzyczueugyucfmxyoymcaxgzfhaoedheduhechdfecdexfmhgyymfaeggaducyxemzgdaxcoyguxhfxhdzoafymydhohxaugogzffxffmuehamzdxauyuyammmyegaaefdmozaofgxgueydozxxzcgagdamdmgdxfxmofyhefhgggxgdeyfumdzxuyymxdfdecfggfyfzdfxuochzuadfcxfozxagzhagghaayyuafxuouuuocdafaafzauhuzuexgfyeeodxcmzafyccdghezcaygyxuaedxogfxhzgeughgdchafedzdzgdduuyguygeoeyamxdooacyayduyeeczzafomaxcyyxgoaahgfgdoeczcoddfacuamodohgfoxmxogzgczfdoyfzgxcozhxggeudcexxhfhhgzooheafhegyceacxomyzucmeyagezaxcefaeuhdfhdxdezzhzdmegymxegxgzeyadyxococefzmoodmezxhaxyhhuxmmchezgzoeudadfgczmohxxeudaaymcuxouxmhzgayueuoccuzddydheyyxoozhuuuxhhdxeyyfmyydoummmhycfgddghezdzfxzexmachxzdfddxuehgufyhgmuuxhdfxfzamefydzcmaehdyufuyugmeddhcygaxfxufyyyaheohaxcoxmuuzzdhmaehzcfahaufeeaacoexeahfdgduzddcfahfzhegmdeoxggoazuumozuofyyzdydzuyxmfadddmzfcagefdcfcamxechudxaedhzyguxhyfeacfzdyyhfgmxehmuafcfdgyufaxfayahamodzzymexaacuaucemdhmhmxcafafyaozauguaczcfmeagmczoagydzazxdzoozyzgadezxaefycyuaghhyxdomuzdydudoofaezcchghdgmhzmzfmhzomuggamcxfeuxzzaxyaeaheddhyuzdedogayxogxmfhomdxfmcdzhmehzehfhadhdcgceaahdahocoxfaohxdoychmmaxymmxgxuuudffzyaauyyfzuxzfmmagyuauzhhhyfducogzchhayohuzcfhccuaumumegxadmdomcmdamyyzdayfghhmxyhcgyohoodhaaezfxxodccucfmhoeaemczahmzxeyyyefcgfoayucuumaoocehfooufzdgoguemcogfummzueuhgzdygouohddgdmxcecafeazdaeygdyeyeuuhgxuogoafddyugoucmgdxfgfeoxfuxcyyomxmyxhgzdmyamoxyfmcxomfydazugufaefydafmgaeyfxeumfffdgfycxzauodyuoeemyaococxeycfzeoazfdygaaxgzgemxhfyeyymzxxzdgoyoyguafeuydueehaoycmyxaoegoxhyzdyazexgugcfuxcmagchdzgxuumuudzaafadoafuogaydzufcomfdfecoeyxuezocxdadoagmogoedoemdcdheoehxccaycegzmagmmxhhxxudmazohzcfayffffmeuzucfcdemhuoxohaggxuofmmhduhehhaguyyahheahfzuuecgmzgaumughzxhaxdghzozzxoedmdxdcggdxacemahfhyheuyguhhfxcdcdoocxuxzuecmmuxahyaggdgodzooeadxououefcxhzcoogxeehegxydduyemyhmugdoyfeagxofgaezuhafhaeaccagxoemazddfufgdfdheamymzgeymaezcyyadaoocezohmozfxuoxuxyyymzzaouuaemudxyxmedgoogxdzcczazcxyhohxegfuymomamhfxxgoomhefddyymzxhaxceogzcdcceemcfhezcyxgezhedhfxygfzcuzeczfzdhmdzhhazuyadmeomofeafxhuemchxgdfffmozzxamgeczfgecmzyxdzduymhzzdeaxzyaouhcyfazoofxhmmmdfgoouhgzmhcfuyzauhzezagxhyzouzamehezxohohmzgcdyxxmfaeucadcfmhxegdyexdmfdyemuxcxhuhhfxzdugxegcxadzuxezuoxxdazooogfhoocaymohxfmguadaxozyeouozzghoacdgfecayhuhueydymzfcyuauhfofeucuyuaahxxxuzhxcecehcchomcyfmuzomxzyodufauczzoedghuxhmdeuuzdoaauudggfuyumcaexohzefaddozhahcfadudxhzdazmhdaddgmumgohdxzhzhffzhhzhueozadhydeomdyxxcheucechzohuzmumufmhaomeaxmxhocydchccxycfeoczoammdozddyuxuaxfxahmhyyczdueuuggzudcgaymyugehzzfahhhzfuaeafofcocfaamoouoghgamzufmoazhhzgdmgzeeamyxzhaufdxyymyhaxxhyyefoefzhhgcmfcxmaeozhhyomcudzymyxaoddydezmumdueoxuducyozodaefhcoyyxaxdaumuuoagoghdzyhhgmhmhfyuxehexohcddgufmumcoxmxffzdhxyyydezuzoaegzaoozdymmoehzxgaexfumaguhmfgozxfcoheaggecddxgagmfxumgouehyxouugaexzoxoueugoaayzcudmhguzhgzdgoooedudxdamuezzczeamxzdcaeugxxzzuzdmugdzexcemyuzumyuegdydgahdgofxyfyyemxdmfgdfhehfogxxxxcgoxgdydohxfohcfacyygeommxhacxamfxomxzdagymdauoofouaoczogzfhegufxoxyaoozuuefmgyuomoefoxcaxfddguehhuyeoyoxddadgyuedumgaxduaamycyoayymaayudcfhuzdcamouuufmuxzgmmhzxezmxfcemzmygxzeozyfzygymcggyexzeafffeguyyexaudmhacdycddddeoxocxddayzcuzhuccydocgdgchdfafoghmyeauhddecyhaacyuohehfmchcmucaxdadofzxcogxauoacmxamdcfxdzdefzcdhzyucxchezeaoemdeaozzgzommufdeaamyudmfygozaauyochugcdyocgoeozgdxdadyuudmgmffagozumoxydmxmacfhfhyduxdghdmczmdyamuuddzomaxmffyyodfazzyudemamgazfxydfadhefccyxmhxyexghdezfcfmuuyeyxghzxzmuzhcxceaohczcefxucuyayhhxydgmhcfzfeaamoxemcuhmuydafgugedgyyogeeycmhyucmomfxyhcxxmceeucacddmcxdhxoxuxyxzacyccmoxxayhfcmyczoxmexozhozxmdmcxgoxzxxacoaxaeoeyxfcymmmyzfzohxmgzuecedouzeegexachaeeafhccyxmezgxceydoecufuxhdezmaddogcmgmhmmgfcufocedcfgezuuxdocceyfucmcdzceucdzezggyeecfmmuecycgfuahddyzofceceoodhfduzoeuhymxaxhhcoxdymufxhexeycdcafyxgmhagcguymufagxccmcaycfhoozmgydemmddoezogdgoduhuueczedhggdcddaaazgyheygaczdzoghzzoodghoyhzhefuhfmehgmdyydxydxogzugomefafmzoyxuydgezgzyzyzxouycyxhxadcdfhmmaygudozzzaoexeugugdhageazodxhucgyahyfucgmyfoozycofzcfhheezcfyzmuygzegfcdedxehdcmuzghgacyedygexuyygceexuahhxczxezeuooccugexayhhyhcfhyaecogcxmgzahuagzyaxgemycmumhedmxehufxhdmfyehfhuofcamaxahyumzddeodhezeacdzacayaocymohhxhxddhmufxmuxyuygyhufdyaccmmggfodoehuyxmcxmhouoxccmfzhgexxdcdaguaeuugfhohaheggcgaceemdgmazfxgdcoagcomgggozyfaxffoemuugyzmxmdzdgcfocfmhxcugoahhxdgmhdgohouefzdyfxhaxdcadhdfchegczcufohhzgczyazxoohoochduzgecxzzhudycafcodydmzzfczaxhxmumaymxehoehdchoyouazduzeuhgmhdhfezegeazhhxazcfegmhfyzadgxuomhffcyaazxzacuxafedemxagzmzehodguohfzzgdexdayhegcueafyuuufxzfafyxyuxcegoaacgdcoyexmxhdmhxxuodyghcdzzazuhfucfecdyagfxzoxohmaxdemhzggeegaoydzzehxxdxhycuexghgghhoecfgemyuyzdxffdhmyczfddzhzouzofazayfugzcuaouxfdghmoadhaoahadgcaegyfuddagegyfdchhgzfaomcmyxmzfoeufeuymdchmaeeoehducdeuofohggeggzzzgumufxyhzazyzyufcohmgadgghxuhzyuuyozgmeyuxegcohfgmmyzucmouzzhcohofaymdcofyegxzamgxyuufhccgdcduxodefxhyaayochhgfxzdzgoexmxdafdcfxdaeahxofayoyogyxymagxmfzcooyahzochxefhodmazzcfchyxxdmfoefdyadfazaazxaddhzghgfuomozfugudayomdoheghzmyaucoeagxfcdomydedezzyzhacexhcadyxfacxohfgmccgzccaegyeemuaaacdmfeyhzoaodagxfuafcufmfdmfcxcfyycfgadyocaxcoxugccfzzyzoxamxcmxezdydhacamhggacygfcoyozaezmuhagcyxcumggguxyzxdodazoxdyomyuahuhxuaaoxcxyoxeufooxhhxxmogmaoogcmxxmxadxomxdzzgydyygooaehufhxmayehxcoozydczeuddhuouhoyfzefhduaazeyeheuafyhmdcmmdudcgcaxgcxyazcofcydmhfaogczfzeahcmudxczcfagoyoeoecuxcchmaxoeyehceomgugfmddhmzuxydxamegzacdfmhuomdumxgheugugeuozgfudaaeucfodhydyedghoefdzfmfhcfdexfgmgcffzhcodoehfxyzmffyfegdgzczxzayhhaxoghxmgguxyyhfaxxuafgaguezaoeecexfxyeamucccmcoaehmodayxcuhdydeooxhoehyfducnmgzmdymmcxgachaymfazgayzymfmzzumfxzgydmhhdzozuehdxxgmcamhgymuumfzufdmacmucxhggoyodfuzdagyuxegzgufcxozfzddxdayefxodmgeogymuxohzegazeyazmhzozfyaguyzayyfaydmdagmdzzegadgamuxummygfuxaugfeuydauhfgezxgyfgmcaxyxaaffxoyfmomxfhfheyfuygeyehhaachuexfmzozoaoofzxchyccaadaxocyxczoyyehuhgohcddauaoycfcyamfuceyacdomyygahoxxocuzhuuycymyaaymcudxozygyhudodhhygafxuhmxxhagexyoofzfuyehcdfcaahogamzodggemyouczmecyfugzmmhudchfzgfafgffaeooddzeeodffcmmumauzuuduyouoahooyyozxoeodcyhocxfgzoemmadeouxxhahuuaumegxhhcgededfxxxzchmzcfcuemzaxgedyoyyhhheyzauhgcxochdfdaguuzuzxamaxcozhohuzyzexhhaczdefxadmxfzuzgeeuzauuxgmcaaudzhazuoeudocczhmezemehzeydzxfdaefzmdfhfgfaczuahxgmachoeghuhuheecduogduhycxadzcmamyueamfougxhzzmcxmdaeoezfdguedcdmcxeduahcofcczhxyaudfcxoccgdgfmxemamdfffydafezgggeaccedmzmgzacyhudxuaaogzooxohegcdmeayhecmhyfyxahzdmexzzxxhdcxgfzycugcefzuouymomdfdzzxhhdffmeayufooemaguhaeumdoagugmumocxmogzdfcfufgooxexfoamxcumyhofhahmfyfefddeyfxomghyfhyuzoyexfodhoymfgxcagxdxfxyxgfaoxogomfmmhefgyhddemazxczoeoagggygzeaumohhcmzmcguadmuugegugaoacffzoegmmyxzxezzuuuexafymygzmgefeduzyuzgchzmcozxgcmeceofugyoefyfymhfhxygaoffyoxuxemzumyzzfgfeeeuafdzhyohgafoceoeuxozzhgofaodhxhmhgxeufmdemyehuzoemuofyoadmegafaaeycefcauyyhmdayfuggudafhamdudddodfygouezzzzdyxfzfefomhueeefcmgxxzezuomohzhccmyoeeyouecxeofoaoomdmagdhucxgyzzdymhacgoheexxyedfmoxcgufgodghodxuffdoemyzaceyogffhuxgfygdaycohozyzdxzzamouxfcogehfzyuxoegocfgcgmozoghxxcdgyyachadmxauhguxhagzfogzoyczoxogxcdcuoegdzcfzmageouxaduceozoxgyhxmexmfxxuumhggcmhxezmoxdogczgyodzmmuhfeczeoyxeudxeyuzxzhyayzuoaygxfuhzuzuuhxgcmygfyexggcuedxmyyoaezdzfcyudfoumeymdzmmxoazccczuefmdzaedehogghdhdagoeymymdghccuhexzgddhzzxhmzezmefyhmyxxcxygmazeofdxcfyygmuzxozcgeggeocdmdzuggodgzxdamamzafyammmgxyaaahoxuudmfhchuuhfdydydegmafdozocauhefzcgaodmyueccmmgdzxyzdhhhaoxdxaycfuxuzgocmmgmuhoomzzfghugomhufoychoaxaeygaxxyxaazhzhyoafxooegzogyyogegmouxfygohdzfmmxmeheuyuyxdfeuxcgfheacceyyuydmozhfzfdgfcdufohhdycuguuogyaeohhexefuuuzzfocmgocygugaaoyxhdhmmgammyhaxcezezhechzohyegemxymacccxghagmyxyduaxuyxdzxhdzfuucauhuhfuomdzxcdmhfmcgmhxgduzaezdfhzdxozoeaxmyoghuxgocmyeeohehzofycegommaydfaefzxhahzhaucmecmzddgdhcmmfoecmmhugahxguddeoahoyoecoyadgeyeydggmedzgfxfoozyoxuzhdggxdggxzyymyymczcgogogechcgffhcxffzdhafcgumgxfumezgcuxoceemffgzxcxgegaoxdxdaxaeacceuczodamfeogmdchhafffughoodezxxzgagxxoyceymumycdohefeoehohyecdcodogxdfdagcfxhhchdmuxeudcffyaygmeeeuaaaueuaoozzaocezmmuzaxxucodhaoymamahcdhzococheomuauuuucxumhxffdogdmcugodyeyeygyaymzfuoazuacmemzmzmzeaayomxfmufcumghuuygmyexaczmmoecgudoemmoucdmfcdazyczcahfcyeczdozhcfugcgxacauoocoemyodmxyxfyghyfcdxxefuguuucaoeuhaozeoheyoccehyafyazexuexhcxuzxxgmfmuucmfgxcaugaozaaaeedhedyygaaodfehcaycucghxmceggzaamgcfhmdumdcmdoheoageacudugoffmagmdegydghufzayzeafzecchxmzfhaxdhgezoecyxcuyuamzyyymzzzfyuyogydhdefufhfouyeoyzuugaemuhdfmaacxdfmzcmxuxfufcoaoyagomfcydffexazzfefxmxmexfdoofhcycfduxzzeyhooegzeamzyduyhauoyecfffyyfuuhexogzouugzoaafezeeocuddxzfcegdzxaudaegxcxffuhdzehudydfxzayozfedduzohzeyyuexycughmgcmhuxdmofhougzxmamufcocdhxmugyuzafhdaaemdmfagecazgzymzddufeehohxdyaayeuaegfyohgfexdczuaeuxzuecdzfxcgecyyxccdczofgmmyxxzfyhyxygumeaofyooyzzhhyhoafghyxyhfoexmuoxhcyogodmyxgfmeczouzeeucmdecgdcchaxzzameohdyofguhdaaheayefzcmxmcemmouuxmcmmaxcxfmuhdzgghhgmzcomocgfezfaxmeayeauuegyzdoehfayygdmcyfggyxdzhexfchfgezfchxmezoyhxdeugmyxgygoomufyyyeefxdhxcyzgmhyffzzcaeggzdhgohmammemyemycocxuhyadzdgooaoeffdfocoeoyfhgxfdxhumxucegdyuefecuzfuheeaoeumedcfygfffydcffgeudodghyxhzauhozeefeohyeazozacyagogmuyzamoefxefemgmczuauzxmadomuxxzmdemeczeefzxuomfhyacyufuedfooxyafuaygahmdocmeemgadueymozcdaozzhumcexyhhfecxgyxduhgyeuymyfchffgcfgmcdmmodfzccmmmgchxuhcfymodccocfffygagyoxuzhggddgfhceddhzhefxmzgmfgaeymgzeaozhoydxgfuzdxocxzhguydzxeefmfmmmxycyezzcgucxccamccuhagecuouygaeghfyhdumzzdoxgcxuzdfgagumccyzzcyffdfuoxofefxxezggzccgcymueyacugyehhcfmzgfmhcuhczyfmahhufmcufxzaxxxeeggzugoxodezfaffxmgfhdcghouoxodyyzyygcdxgfeeycyxocecfoeheazmdfyfgyoxzxczcdyuxfeummxdyhomfcoeuagghhdaxoauzexudmehemgczzcfyceddaoyhaemzdoeyuuogdefazymhogzuheuzfmgcaudczheefodooxedamxecoyegczemfemzyoyxoeuhodfzooecgghuhxxuxedoxheumzezzzoaoozxxexdyefdacfymzgxuuzmcfxzxdeffdyefheyzchxmfcdcgazocuzmzofgoyudaxcfoudhuffffzcaeguhgceyfxgxxgzdcchoohzagcagcxchyzhmauzzcdxeozufcyamdfdyehoefzhudxyxeccoefgxufuahzozehduyzdxhueuymcauhcoyxzamgaedzomdeueyehazhemyagehaaeuzhcxcozeuueyoduocamaaagyhgzzdghecyufaafouofzfxcdzyzuzmmgcfayeaeeeczzzmffydugexuauceyxohmefzyfzxudomxcgmzdmdyhfudxmommdehaaezgxodeufhczgxfdxfhdhxoefyxzgxxgyzyfudguuyuxmhczemeomfdxayozhxdgcomcadgzhegxxcemyhexcyefmhmemzgogoeaycyhoocfdxczmgfcgyedudghyfudyxcdzdmymduaxhhczxcmdzeuygyohagdafymzfazcxmaghhoafzuyhhgegcoozyfhegzcyayxmacyehuudgodxccmxdyfhzhdfyuagmyxdzueygmcyouzdhdfeofmozcgughoedcyggzfxfdygexeughhaxhcagdaeydcfeuoahmeoemayzhymfgzadoxmhduhxuzyefahmhmmmdzoeuodoyyhcuxzexeghxecxdhggxdgfeaooduuyzzhzffmycchzayhceocaozudhauxeduhdxumeamzxzexeyaauhdxacgdhxgyzzzueyomxmcomhchfhxchgxhceezzzyffaxzgugmhyycxcefzyxagffoauuehguuyccoaddfcxccmmdmfhcehcgeycumgcocuddhhoddduhmdczodhfagfcfxhehefaeeazfydhcdmymoexymoxmohafcfycxehghyyzguzeacgyeguhafccxzezaffhucxzuducoyacgadyfcfdedyyhugyheodycchmdxxyyfhdxudyamzyzgumduefgofuceeoeudcaefcmhycmadmgedyaxefyfhuoczxdggfxfommagzxxhohduodxmdccuefmuhfzuuzdfmhdfedecfmchcgychzheuumxuodycmxyacoumdhzehezfmoduogueuhmmhoeohcagcdoccaamzcfzfzogouggxmecmezhezzgyegyzyeofdhzhoogecegazggmeczgygycouaeadahfxdffadugomyuhgmfazogoceuxdfhfxmfydcghcfexhahcoyyhcazfaeaaagayeefegxccazfxmuyxmoeohaudhcdchoyughhdoxyaamxdeufhceaeufxaouemffmzxzmxoxezzhgmduymufzyeegxhgfecfaygfhfygfogcoeodfxymzgfuayghfooaozzcoyhgoxzzhfhezmgxdyuxxcdfgoxeezuchcuemzcmhadeuoehxmhfzagumahyzcchazamcyhoodmymfaxozhyhmodouzxzoohmuxoyuoumcfyudzxcoozzxxoxxefguhzgoyoohzmcdcczxuhcmfhhdydaaeyohoehgzyfudcmyhammgmahcefuyducdyuyyfzoocmxogmfxdgmcyfxycymhhmyeygfzyhexodduhgfhycydoyefcgamgmeocyyoohduoxadhdyxgdaduuofehczamfhfxayhauauemhazzuhmomaahuyhzagzzdxeefxuyuozdzxxfucxoycdcmxxczxcydffxfxyoddyohmhyzauyhdyzeyhdehxyzfdyzgxyyccfumzhaxoayeeodymydugzydfdozxchacucmahcceexcocuaxyghmeyxczchfoczcmcchhdxehodxfuxggzxomyuheufddmmeeadzzuahuddcygeexuxagcoggmhxgaaxudugguhgygaagadyzeoxfcyyexhamummhgocoygedhezxyecmzocdohaxgddmxzaoazaucfuohcddfgeuzcozfcxexxgdxomycccueydmghehzemxdducaoyygdhmfcaycuffzzguocozcdcfxfhueccxgeedhaazccmcogzohaxdyygmxyxguouuuxodzgdeaeuoyoxxueamddcaxghxgdxcdoxefcfdzoumeauuzcggyzeyuygamhgoodazhcamfhdmcezaufguczgzgxgzxgamfyzhmgzeeecemzuffaegeaogdfommhaaydxhoudegmmdgdayeugmffegomffdocfmhoxmxocceddoxoymmouuchuzcfxaoagydmzagffzfzhaazomfzuuufuchuhzuczgmozxamoxygcyeucdygodxfmczzxyuzacaoxofhcgamfugazfgamoxyxufzgufafugezoozyyzouxgmayxzmdxfhgzcufeofoaegexgzeydaagumcomfmxzgzomfocucgoxdyumcagzzhgzhmegaazaexxhezaxcodaxdcgxygcauezczodumzhgzcfddcacchyycffcadhcecaxayoazmmfaxadhecooomaeafgmhdduydzeymcgoxafduzcygcxehcmeoddcczagcugezzmxggguhhhzyyuxgfghuomuggmacucyudzecxeoczyymmycedzhomcdummzzdgfhfhgdyzduughhdhhmmymfgfgugxfyedcfgoycfdxxxeyzxdaychhzuueucyoghaeezaghofhgcydzcummfmhfufhhefaauoxeguhaomudyhmxdzoeaxeehfuxgycyofacfeguezzcxdyyuohzagafdcxzammyeayuauyugeyffeuouyuggfzyoyhgmhcyzgfhoagofgmdymmhhdoghaadhoaeddcycfuyxodzayyhzydxfuxcohmaayzhgdxxgchazdegfdzezmfffzhgzdmgoxgcyeoozhedafagxhxeuhecfxfdogzxhmxomdygxdxemdmfacuhfhfmmuhgeymfxmmmhdfozemufxuzdmaexzueccmdhhxzmehhogoxzhxzugfayhaymxhmagmdfduemxmhoaeadcufmchfyhcfyufmmhufegohehdoxoyzuegxzdcadymfuzagfguhhyemhzcxduhazehcgcafagzaxguxzfyomgoeyagfxfcaefmuuxfhhxxohuyhgeomdacaxhzyuumzmumhfaxfxhoaehhzofegdxcfoyghedzuzamgghoyyayxygzfayzhggcxmzhgehdgfxddhhdduyxgouohufyuhyghumdygmzccxeemeyogyymmohechmgumeuoodduxfyyczghdhmxezgzmmdhhgeofzdxggueudycmzucxxxzudfefmgzdyofcgoumeohmyfxfuohfhzuyddfuhufyuuomazhmzxmxfmgfugmgyyuxuoexadagefgcmuduycehguuyxhmfzyycafaxxxfyuuyagfzeedzmfczufmufhymfedhuehuucmucddoffcffxhaxhzxeaozmxcghedazxmzgozhffgfcfzyfcuxacydoxcohuxygcgzxfxazayggcoceumoggudugeozycuohzyocfxczagzafggfmxcomzuhozcxhzcfaffdmcfgfcocmuxgeudcygaezhhxcfmdaddaufagymoxyhoommxcefdaxuezfmedyeheeayghhoehezhmdzgchechodcghhczxuacouahxhacguhhddyuyhefyaxyhxaduchyfzzoegccumdzoodzfdfcmhhufaeccogzuydyggfeazceceudfogofygxcemfzmzzzyddxgdgmcmgudadzffaohdfugcgedafyzxuhxuxeczygyyfgfhcxffxgcmcecuheexzdamdgaccxghahgcxeyhmaxzzegaomhehdxhohgcgudfyfhmzmaadooxyfzzxhmcmyfdmudhxzxcehhyeougachfmxygmaehamzahzygyeagdmezfodxugyhgdchaedohchamaexoghfofxayyauxmadgadyggzdeyhmfcoumzdagehamgugcehgmhuexxezdexzmzfecxzomfhdzfoefhdfeaxaxuuaexxhxduozggdycemeuzyafxzhzagayxmdemocuxfmuyzamxxumdfchhyucehzmgumzugudhxcmeaxzfxxuecuufyamhoozexymzechfmmacgggymhahymycumyxxdueeghhmcuzexmgmodaayghyxuxogzgfgzmmcgexaxfyghoheuefcfxymdaoxexfyxcxmyyxudyuaocgyfaeachymmadmmaoeaaoecdxufyzfgxozuogaeyoyxfzmydmxzcuogdoumzdogxyzdcyogufuamoacughegdxzmzxdezzaauoceohugxxaazacomgfazfmmafaeguufeuoddxaucgfehgomxacfhegedfdozgamzhhfymxhcfafemcyuhmmmzuazoazcggfmyeafcufxzmddzuyzafyeadcexaeyfcmggdamyaoooeafaxeeumghxmoeyfeadyyczcgdeadogugmugmcfcoccoedmemzzhzecmgmeycdfohazmacuxmdoycyfcohhguzumddaaauuufagcamdghfoueyxzehfafoafecfmuagagdcexxcayccouhfoyzchmoguydgadgagoyauzagmemecxaucemmgeamfmdmodufcacygoedoddzfzmuzooocgyzedcmdaodxcmfodzeyxmohazdhcgzzagedmyooahoxcgfdeycgmhcmeahxcegzhyhhmdhxofeeyuhyymaxyfadoozufoezcfmhhzdddedumdfoxuahemzzcfzdmadaxchdxzooxxodgzzzudhfmeoxcmhayuymhmogcxuhzezguuafzgehagehhzyafhczdfuzxuohezaaaxmfxcyxxehxdffgmgyzfaxogoecczoyxcmeeggcyxzfhcdumaecfegyoayxzmmmezuyyyuzayyzgumxmeyaaygmzzyzhyeuhcgzfmzfucyozdheagaudeahozzxfhuoouedmzcuycfyygeuoegayxouxhazuyaoefdaodxmyezxmfehauufacfhuhhmfhucmhcauehycfzmhxyuadzyyzohcmmduxmeozyogmdhzedeocxfeoccaamxdugzoafyemfomdgogmxuemfhzhuhcefueouyaoofmzgemzfmdeozhcaxhgfxfuagefdehducycyzugfogafhhemyaezcyxohehdzcehexofomcagooauhyoumzydyffmdggzdeahexcfexucecfuudfczeeyazyoeeoayymgoazadfagcycehffxghuezmofmfdoacymxezeghohyyemouhhexzedxafggechfduhoahxoaafoueuaxazmefeghxezaoamgdxgcecymuyoxufemhgychxofzgxhococcadzayczhahoeeuhachhhohyfgagzfxuxhyhmhymxcxefyafmuuxeagmxcmohafagocadgczdyhmmehcueufdxehoeehymmyuazfdedfgozgouuuguecfhumcgyhyoxuozgoxddeceucmaudxuzhcxchaohaedgduddafafdyemyxmdfdxcozdcoudduoaxadmxyofmxzygaagofcccfdmzaudoogzmzmhyufdyxzdyoyfcuhfduzzzccgghxhcmcoeeuoxgxoxyhogafhxxdheyzdmacxehgyuoemgozxoeoueeoagucmcmehyocgxeexgxegxzafzzfxmmdzuehcydhmmzeefgyfcghzymguyoxuuxmdcahcozoduchgxyxazfoffzduzeazfggyxfmozcyomxzfugcxhhuzoauhfhcoxdxyefehmycuogxadgodygxyyzcocugyhdyxfucogcxxydgzfoymzzdomxoafzexazhemffdeezmefxhaeugogxyhzhmzxeauxzfoeooduyyfceeymhexxyecxmheyyeyugfdmaumeeffxgxxuzchezehymzcyacyfoahauogouxcoaeacfuuuhzdehzoxxugahdfzxfzeyeamdhcueegxyzzoydmexcmzzgmecmzfzgomydzugcoegyzcemcoycgaghgouaddggdhuyyaogyfahoeogdzumxydzuymfcefeoymygzcyzgmzzcdumumfmgyhfdxagamfmzhmaxgxhmacxgdyuhhdcdymohehghxxfmgoxzoodeydezezzohehchzozmoxdommmhcuzmfxxxmamueuufdemuohuzdeczadcxdmzdmyyduddczzyhczzgzxcuxgcaoxzofzahuafczdhoxmmcmdfhmzuygocggcugdzofhxacumgmofhemocccmozmfzyghfcmzxfmgezcgxdyyduccycuadgumoyhyecoaozoxauouyzuoomyhecxefdoeuyaxzyufhgyehxyzomgyozddughmyhuafehyefgmfzccxhduyfaofmhayozomuyaugczazauyauhmgaxudfxfxahxghhaoaoecddyzxfymageydxfxgyzfmaemccmyoxcuoahhmdgzcmemfhxcxmzofymdhhxzdzdaogghfgexedgguzzufaudagcgudxefmazdfhuaozdcxffyhzfeamzzzheydguecxhzauhzozyyocfoaeecduuhfyedfxyyufcyuhoxoooxcxeyczgmxoyghooeecmghohecegcozdocgyddhaxgohohxczgxyxmuceogmddhhacehoayazafuggegmchzyafyyxehfumyeemuuaugoccfofaoxxdfemmcumodafuegyxdzuzfymogdyyeygugyaufocedzemzuydmccycfyhhucaaxxeoozzuxumezzogccuzeyzoeaaagfxocdafxeyhgoxeefzxcffyxcmzmzzyahzxzuegxeyghhdazmfmmegaxyycugafmcdyxuucegchzgdfzzxhedxgagxgdyhyamcdhyccyxgoaaoeymfyxgxyyhdumxcfchhohyzmfcdomgmdoxdaxuxxczdeddxcgdmzuhyacxzagzuozgmgzxugmfedemyddchcfofemhyzhfzyaozyxghyggemeyymgauhmxyzgcyydxmdyfauzmxemmeydaemyhhcdhmdyccyhfughgygoemafgxzuauehxfaoaozgygdxeczdhxzzdzmehafcdahduxamhamhcmefheygyzfgzggyyyygmxgxygxayehdyuxefdcaedomhcmzcfuydhmyymuyhuchxddayudygymuyyeeuoyyemccxmxzozfyzzacmfgxmhamegcydecmuzodomacueexhxzheoemmgauzffzdfffemeoeyguzzxfuyzczhoduumgzzycgocmmzfomyygamcegdhgohyumahhhumyzdxyydmyzmcyceeczxffyehdaxxyayguzyumofaxfccuccuhguchzgohfgezmhxxodumozhhhghzgccudeofmzchddcuugghfudufuzyaazfamycmhcfyuadhzocfmeuudxcoehxhgumxoacohxzzccuczoyycycgfcoxdmzguozzhfxguocomaauoyffcfhhfhxdcyeamdghxoexmduhxucdeaayaccmzhccuhhmgmxeozxyuggmxxfxcgomdcdzufzdhcaogyxxchzxyxxxyoadaefacymfehgmfeaayheuxzumyyodgumaczyduoeuuccozcafuceefefccuymmccxhcfczdeoodfmfeeogxfocfyuouaueohmuzaxgmhmcyxyhfzaxcgzcxghgdexgcomamgfyfomgmohyxxoudduoeofamyymzehcxhxmhcgxzhgydfyhomuogacmegocfuhayoxafdzaudaahoffodfduaxxauyeahgeexeuufozggfcahxgcehucaexghecdxoaeczygguuohauyuhygfgaeagdzxgucecccfaxgfgczxfzzmfaogcufomffyaccooumuzzgmoexgoefzfhhgyycymmucmcduaaugoczdecxgahzdfzacuamyzyexycoayydocufxumgogehzfmoadefaohumomgxafzohhcyccccdxocgdxzygzahdyffzyyzxozmzhhdcyxzaxemmzouyehmeufdmdxdhefmfyuafyedafxcogofhxdcfhmafuufcheguhyaxzoeueahuaexdecfexhfodocumyeucxcomfuxeefygcygcyhgeecemgegczgacmmzmafhxmxefxdmuaaxgfczyachofymdchyxxmgxdggguezcmoocxcdgyyuzffgczhmfxzozyhyxhmfyzeefmauxcodgdyghghzgfoyhhaoehzzyzxufammfmzayozofhzhzdcyfhuuoguayogumxcugudymeymdduguxadumehfhaoydhehzoymzzzfhzaygadagyecacdmoogzdexmdoxuodgfohuacxczaumffxuahgghzcuefufaamhdzfzdacyafahzfxdfohddgfxfayayzxygmexodmghdfdayxhhoezhuhaudfouzdccgfxcaacmcffmucdyofczymgydoegzyoccymzohhamcmfhadhhuodyfcuuedxomxfyogcgaxayzyeoofyyuaagceccmaaceouomyzyhfaddfygezmguhmofufxocxfeecaoyxdxmgmdfzafexfhecuchhzoccxczehxdxxufoexddezxmufcxeceeoycmuzzyzyfzhmdeodxcmmxoyyyeucmgdeyhezhzdafadchoghhzxzhffmuxdzomeghfdmeecmcxmhxafzexafdhzgxxeafzdhchzauoyayueyceymeaoexzcdmfcgdmehxgzhxchumfmzceedayhfczayxadhaughaoxocffzogdcoogyhfggzyygdehymhohzodyyhdchhhfohdmhoyoozuyhaexcgoxoezcczfggoxxfmxdfzfccummohfazdyczfxohhdgcumydzoezyudecgmzueyodozfmmfcoymhazmcyycudaaouyyggudxyxmgzxcuhfmyuogcafeegfuafcyegufxhhdfuxhdaaeodemeuxmuzzeuamogdghfzehumyyxchyoyouodffdfafdhumceafauaecydoyaagfoxahxozgfauuzouuhhghoxymfohfyhyzdxfzxmfzmhazfmfgdfucodadmdoxafuzhzcgauamgeemzmxzmzdcdzcgmczmohffuedacaahhzzzyoeczfmohccmezgxuochczdouamfeuhgzmaxzzzhdxhddfmuoueafogxfudogfdhyzgeayfaogmuxmcaheaexhhouhhoycmfoogocxzmuyezudmumxxdchmgdzdczfaoadxhhfhmugzgzmeeadgghxeuuymmofzdghezmfxzeadfagdhzymzxaumhdhefyagccfhgchaezeuhxdemcfgzuyucuoauaamfezyzafffexodcmgdoemhfooxyxxxaghcgxgefaefzygfuyduuxexcogfedoyffhyhxhmeeauczmudghzyxufzzcamceyoayeuauxohyyfdzxgdomgeaodzdzfoamueffeohaocdhzgooazofuydceoayemzuazceeczfyaahfyohxmzyxedguogacuygfeoahddmmozmxyguemdfgzfcmazmhmczdhoafgxmyoaahuauxfzuffdmfumaagxhfaafczuamohuhgdymmczhoagaaxfzcmegduyufefxmomgogmogyzgduacucgahoggdeomzzgfxzduomufazuaemzoedzxauzzzhmfucozmxxgeeyozymfhycuzcdacmogaezzcuxfazoezfzumehymguxfamuccemdgaghgugydxhcugmoahhgahczxzochgxzoafzdceyggzaezuhgoooyxyohgzuyfzyexdcdougchcaymxeuadhuyfcczxuoduedzaaggegodcafzzmdcuyxededzgdzoyaohuedgmuyhzehxmahemocyxhaygdgmcmdgaheymxxmhzcmauhgezodxygmdzycefahdehuummxguezcmaegfzcdegaooydgychezaugzufyzguhmfxxhxgzdaxcfhxgghdccdxfdxoadhhazomydyxxzzafomefmzcggzyfmeocazxegmmdygeaydxomzudfhfyamyodeaaexcohodzxoxcmfaoouugudeamxaagymfmzcgxfxaoumoyofmfohxmhzmdyhmggyoxffyfacfdmefoemmhexhhdcdcgzgdacumaxfeaxmdmemhfuocfeygygxfccgddoyxxmdzauaaxzeaogugyzaueocycummodycmugaamfymeugahgouymgazggyadxhzghfgccuamfyhgahgfhfcedcuemzfugdyzzozxfdymmouzomudxmmeuyhdfdoguyehgcdayyuhgoeaczeucfcdmzmodcxheyfayaffcdgxczcmmfzoddxuzeocfmfezhhmfadoomamyxzuaddoducxdemcucumcaefyxacyxzzzuaczcfggdoamzxmuaayochgzzhhfcoagzuoyyhuhfgmczmdmmdzzzfeeudmgxydfyymfayeumehgfxechuegceuyageohofzhouxhyyoduuxeehgfezefgfdaxhhdyumhcdoxxgczxzhhgfexmdgfdhhzxeezhzfcyxxdeofagodofcdaecgxezxczyadyyeouhffhxzgyymygcmdxaxxydhmdheumzdhmyccyhdyuffzguucaxuxdafaxacxfdcgumeuuuzguxohuhfzuyezeddgyuheeocdhhazffaxyzmchfohmchzzedmefhycfeemcdmdyghefacmuouodxemxfcfymaxhhycxyzomfxemefufmgfymhmooyzhfaheoexccayycmfouexaaeafmdmyfffayuggcfmoyxmxeddhdhfxddzucexhhygfeuxzzyxcufxzzaxzgmohxacduhaczzfumcaomeyyxgugoomufazczzfdeymozyuoegemyexhcexcffoomhcechuxxzcxmxcymyxgououdoymhmcgeggzofheozmodghddzucxmyfouydhxgfoygcmuymeoaydhmedhfozhuxzyaomcgugmeoazhfacahfaucycceccfexzafochfhemxzcdfagyczhydhhffoodhhhomxhyxgmoayfhcfumzacdaoyxegyfmczacfyhdfohcmmoyeoafoxcahhuaaazmacczyzyufuczhczdzdzfhhmdohcyyoyyagduuoegofamyghcofxmczouedaguameuccdmcdammaauaychfxhugmddoyxaoomecgfhofhmczzefgucmdcdgduhzmxdhccmxffuzzfxehyucmzeczhuczdzdyxuohmudmmmyuhgxzyxxhgccauxhzmmczadacxhcdxdomzzfduhozmyxfecydeuxxhuemyyoagecgxufyddgfcocfaogyzxexoohgdodecdaahccdafxaeudhuuhgczuofadcageaaexgzumdzfeyuuzhxahzcdooxxyzzxhdggxgchuemaouzacyyxoefegugaedeccddxchycaexmacccmezzuduxcmgmemducyczegucemhguzhzommdhzhduxcaedhuegdumegxhhaoxegmxuodmycdzyegmycufhxdxahuhhuchazoeycmxxdzdfaamoyyamxhhhgfhzuyzacxmmgaffaydcydeegedgchudzmueugxdguhcdezcdgeozexdudhofmzfzgacoeamxohzoehmgghdamdzmfmhuudfooxedaygyyymduaezfuduzaohegxcahcxomamzhzfmcfmofoyeemuyfaxyccxmoezhxcygahezedehmhffgxfzaedeyxgxdmdygccymecyguhmofuycaecozaufgdfyyzzocfgdfmfcczmgyhfzaxxyoygudchaghzeumcgazmdzoggoezzumdxuegaohcfdcoaymhfgfmofmauexyeadmxmdzaxghxemgyayoogeezufgzymcumaoameaaxzagamuhumooddfcggdyhecoxmdoghoghhzmcemmeohhchazyhuocgyyhdzuzhhyuumyhxemauzocfghefmxcfyzaucdczuzmocexxuzmxhzffugmyzgzymcoffhzhgxyzyzmcyaezomuufamcfygzzceoymoyfggxdyocegxoeofuzyumzdufcedzoehoaugfmzmzxxudhucfgdecayouhgheddhzgzmufacymzzcuyhcfadgymcuumddexzcaaooyffzdyyxoueyhagmefzyyfmcxyamfhgdcyfecdxhooefzugodhmhhxozuzacozdooazdmxxacyzzmgyemuooohyddzhxxmecxhxayzuegoyoydyfehxzmxcoozcxmudcdchhmccoyoecffueacgocgzdguhadeeogfyzaycuhayzgxedhemzczyeuxczzxzmggdffeghuouueeocxexmxmcuaghyaffmmyuheoxguhgxehfeudufgfoxfaauxczmauefgxffygcyhyuugfdxufadafuuuumaymoucxyygumedgmxggfmeoxxcafzaheayhgfcomgdgxuzmahxeohmgczauomyyzehzmxuzagomeygcmgygycaaomamzogyaoxocaghchggedauafeadcezeeudzxymofzofaccgahczfouoyycacmcyemdxaygxfcedcmocazooaoouuzgcxemmzcdgohezeamfecooaeyzgmgaoeuehfcygzcxayfgdyfzouzfhdmuueofxoxdyaeogoachcyfaeyxcxzzduueoxecxfeuhxfdzzofxgozegfzzmzmdoxxmaaouuefemzymocehfahofoudhcmfafahecfexzzxcaaoauyfmgoexyfchyuaaoedcxhzoozzcgceghucueezucocodgoyaxhceuuxhxdcmygmyauohcoyaaexzamdghyfyxhagoegaggechgfyeaczdeeuhhoehycdmfaefxgadazchumchzhomxxxzmmzaoacfmzomcgmdefucoedyeafedzhaodogyofxagxuchfhmyufxgcymyuxumfmmafmdegmfzzaaogduofgchhaugxuzomydmchxdghzxdfyzcohgofmdedudddzcfgaxzhxzozefezzxfxemcaahxdxhuazfudmdchayyuoodzgohmgmfcxeaaafheccxdzucaogmcgcfmghugxezucodgfmgzuhzaycmmxmzmhfmuhgeaueyuuxufydgecxxmafefoueamxxgzhhhezzdaohgzyagmchzffchhucxyyzdhoceexxdyxhdmfeaacydfhzefmmzyeeyeocouccadyemmuzefucdfhaammoxeaagdcdaygxhhdguuhcmmzzyoxagzooeyyzfxfazgmhohydzdxgfcaeydomeugecfemcmheeaggcfmagxxfffyzmyogauzfxeomxemuaufuezmafghofxhauhofgmgzhoaccfmagaocuyoxfmcfuudfceceuyxehcdgdxfxddeffmggueahaoemugezxxxozmcozycccmxzhghyuxdmmdzffazodzadgayaychuxxxcecehhhghuhyoaycaxgyaemaxmeghxhzmhfhzoxuufaoooafoegduduheyaxcxzaexyaudzmegcxxodumyofemocdhcucfhxgcfydedccyhezaxoefdxcxahaayggzexazdyacomhyzomcfhmmceogmceuyoufozyxhgchgfzdeyahygfxcafxeooomczgdxuzgheagmddgzfgxceyfzdamecymamxggaoyofxcyexumucamhazzzeugyceohhcxgdumfzgdyfuzoyuumaczeuhdfeghgoohhmauzmgzugacgdhoazhffcddyyxmxoauafyogfguuzzdgoheoguuxgexduefhhmzhaxyzzdceffmudecxhyzoezuegcafueooyyzzuhyezdmyeegaffxocozuodexgxzymzoffeczxxygchycyfyzefdcxgfcmyuhxxdxodmxxefyaagcxzuyfffcuymfczcyfgyzahdczmucmhfeucczgodyueazeygcyucchzyfaycmfzodzhoxuzyxfmeazaxfdhxhzygoyguyahxcczcadoddgedhzhafxgeecguyxchaguyxgggohcfhzdcyguouyzchuegxumffeugfeodumfghacxghgycgmxyyoococdocchaufhadyhdecdehudyuuxmoxcaghguxhhuheegcfyymoxezfxfceohgoczhhzzmzhygxzummzczcdmzdfmugyeuyhhhhexhufzddazyyammhhzcdfhzoamhuhechexuugozdxxzhffydcmaxahocuyxhzgmmogxmyfyxfyamucexdmaehfehyxceugyfxzduhodayooyxayzocomaduecoxhfucgazafzgfeafdgyczugdccmuauhmacggzaayexchmyufafzfdmzmzdghcexhxazouaagdmxhfeyfuhheyddoeyyuguyehumfdxczyoxcymmgfuyuoumuzofmcguhymzeuhxfxhyuuzyfcfxmxmgggxdehyddezcufcgmzcumzuefuymhfgymcaagxcyegxcaxaeazczogexugxgxohzyzyzgmzmgozoyfgchufdmgugayexyzhzecezemhomdhxccazhucheezydacadmhzmmehmmdmhoxezdexodaeccducomzyeohfgayyaeeaaaecumomcuuhfxomoxcceddxxhcfaeoxhemueafoxhzuhdzeyzhoexxxyydcazhyozhyeyuaazamfgfduzfddyxmddeydomhxzfzozfxxgmyzeeffcmmmaeufxzeacueycdgxzofcyammoyczgcuzhcffdmfgfdggodufaeacoezdfcmmcgocgfdyazuxogxzycheaeudxecxfchdczogoxmaychdemygyazghafodomucxhedxaocacofzudzuymychcumhuagffxcauyefoaaxxmzhcmooggyeoucduyzhxdeuegyucyoehyaczgcczmaumhfeuymduecefmugzehgfmodeyguyuuamhcydmzodaocmmuxdmhgafaoafcdcyehmczudoehhhxxfeheuccxgfdmdfmzofgyfzfoceooxfyoecehyccxghddumghfhuzzgyedfccfhuczzeuahmudhacdumucheefxggoghamohehazydmgafyaezmfumcohdgcccoeahfyeucecoheumdcezfhuumefmgyooxxuoeheduhaxmmxdfcgumxdueohfeychuyygyxfohzfamfzoceagohcfyegoafhyzcgxfzyzhhahafuoufcaeogeecdzgzcuazazyxdxodymmaymgfygfuuhuomzyagoafhxddcfghzcyddmdcghczuzcoayadaadxgmeouoacdyoozoggxdcdecocuaacxffhmyyedfgfefoegozfmdhymdzuyyzuxoezzfazgzuafydxxoudugagfyhhexxcmxdxoyhyoyyofzhamcoemgydyuaxcymgoazahczffcfxgoeecmmyeahzcccamcfhafgggfmazacazhmmgyuhzxzeguoaazeaoyuefddxduexgdxaoacxyfycufoahumzgyxafgymhudchhymgzcydgemecgdaumczamfocgxchhdofxdyouuxezgdaazyxdzadfehyhdhyuyfoaozozzugeaeedfmuxozyoeadeofuxxhemudyoxhguymfefefhhoouemmocyzhgcyeaydmohzcooczeudameogudyfzzagdxyzmggfhhyodgcxouoahzxeycmfyydacoocazcgyyafmagdcuyouozeddxaxugxexuodezexgxmaoaydozxgzzxucuaogehafxecxgodgmguoozaaaoexcgyeagemhacccoggoaydeyeyymofuhcczzedemamduomzaeedhyegoyyzgzmfagyafeomccogmyxogedmdcmoexcfouuuxcyzmyadfccdeymxmmeumcedhayhegmggzcffhhocuuuofoaxezdcgydmhfaededhyzeydeggmucaxcxexhyhhzxchfehduyyafamdfyaefcchyyhudafemuxomdgdehzexouodxmmczaygyhugmfugaauofegmhuuedfxgxezodamuzdoazeuhufxdzyucyaegfxuhffxmdmhhhhydzaxyhmyaoegzaffgghuauueoemfeyuuohyofyahgxyhzfgauumooechgedymhuehaoyxfgfehxcumcdefffyhoxcmmgezdggyzfozdhcdyyzzfhzuhzdofuoxeuzuzxegxhzxyuexxdhfedxdyuuydfgdychcagaexodgmaueocofffgxxgfydxeaxcccocdgyuaaegoozomceeczeyycgmmuuazgeuaaofgafoyyxcxuyudmouzaxczygozfemgexxmfyumdeaoxxuxmdadgudgdmauumoxhgaucoufdzuayoxfzeayayegxacuefgxucdyxyzaeeeduecmeyccfhdegozmffeeghoeohymeffyuuudghzgyoayddgfhzyzuhggoaxxfocfgchgxzxfczcfyzezouuhmghzefazhzeohghugfgcoccoxcahxdeezuguooaghdemhzozomzzydauoumcmfogzcdmuedhdmexxxhoyydegxmafyaumadzehemmfaxhzdzamfozgfghodomfauhgdudmugeoacdedzfauffcxoydoohggzdccmmmhuhzgxmgmmhyzgzdyxheodyfmfxahaxeueueczzfahcyaahocohayyyxcdxhuzheahxeudecuycazcooeoddomxmccdygycdezecxyhxymamzuyfgcmhyeooemxuaazdfecoufcooeoooxeaozyocmyxmcgymcyceyoegummfmchddgcdzoceoafocafoxdacemdoxzhezaooyxfceuaahducyyaomamyfazxaddgxauxehcchoocaoduohmzexfgagcgzuehooacougoexzmcmmxmemehmeecazeddzagmyfgcedhamhxgeeefmahudfygfhhgofgudegoaehhcddgezmafuouxofdhdfmmmzauheoghxdyuemzhaodcgcmfefemyedygaoymxohgoceofmgfgaoxochyaocgffxzyhghyhgxmmamazxauohhffhmffhoauhxycyyzcuozdffymgdycmuuohxmumaaaudzfmhyaaofeezggmomuxcuyccaammgxdgdzyhmozxmuyzagyaaedfzmfaezomoheyefefdugaoagyocxdohgudoxgcdudgdouyazzdghmxhxodgxadcahzoxxemexduaxdmuuueogogyoggmadfcmxzouhezfgehcfeumgdyxydgzxamgcyocdycgoohaymmmegouyayhxzccxgdyaacucacafyufueudzdxffdozggocfezhuhduyfaxxcduefyecouzcmyzgzgyhxhfcedfohhfhueuczxyyffxyzyzuxeofegxyofuxhofduodxfhzfmfoffofoamdfgoxuefxuhgymuaoexddozcdoeufgaeuahouddyxhmyzzzoyyghymydczuzufxamefycfcfhfghhefzodzxhdaufghzyyodguodefuaocxauzodhefyhmeyzzdzzoumfzuocxzmcaygzheugxomgcyymefafafmmdcgeouofhxdyeuegouazdhmzazameagugzdoaueehycgymymzamchyxuoumxauemdfydxhfuuzmaygcxoaeoufxccohadycyodyaxoedoaozfxhcuzahgeehxxxyzggmfgdmughahdygmgcazhmeyfdfyuahcdxadzuadafxhhhuyxfedfdgazdyoeyaaecufddygydxhhafzeagfxzzcdacedxxmmegddxugxeemdamgyzxxhdohumgdhaogmhxfhexyzcmeyfaufhahgahczooaxdecduxfzczogxmahhodhygzyouxhohzddxzydxmgyufafxgdedgzahaccyfyoehxaxycucyfayfzheocchafuffcdfehyffameyxxyhmxmxzfeaffocgxcyexomdxuhaoydygehzfzgyahamehahxhhxzchauazeudfmfafzuxyooemghzhxhxgmmogfyhegzhgdhyexfzxdhuezfdohzexadzzdmxmyozzydoymfmmofgeuxcdfmhfhfzamzyocgxgzhxauuoffedzheuoacucaxexmmdfuczhayezmdcezfmuhcdxhdudhcmhfycxdohgamamoudzhmmyufhmdeceegxefhmzxgchecfacfufxydfmhygdfeefoyyegdzdmmagfufucufxygadchxfhyoxhxxgyechadoyaegexzhhxdyamzfxzeyyahdhuymeyxhheyghfguemyozyohdgmauzmomeyczgfcxxcefdxcyemzyxhxaozhcamcxemamczhhzyddxaeomcayfzhxeymzdyamazxyydeehxxyhfzmeoxoacxzumcoddyeoazfcmzudyxohxxgmohyofdhefouhzccmyfugfohouecyguuuxfmyfcgmumxazaxuugchugggyhzyfezyegohumemaegxeaxfcxeyzxdhadaaeyyzgdueuzgdgxzxydaxdudoueuzcmuchomouuzmzxcmahyfzozuahahaxuyzxxumfydhgmfeeougofdghexhxxexhedfuzyxugmeuemmomoyeeafxcumzyeaoegxooeacdgccgzyyfadyehohhzmxzxdychacuegghxfmgmhgaxaymhxfyuxumdcfuuxyfchycoufyyxodhcmmdoozxhxchuhdghyozudhcdmyeezffcoymgofccmmcdcfcycecuemcucdfoycgcueyoxhgzecafycuyuuyyxcxxeezhfzezfezhducfmzafczuffdgmgdxuzeygydaddafxmxmoxycaadyhxyxoghzuzozomhyucfzguczaymgazhhhegdeoogadfhhhauzfmehzeaodmfazhchyfyyoxcafhaafemomeemhgoyauhfgyoxyaxfczmyaeyhudmxxodugxcfxohuadeaazhhhuhdouaxzgaxzfuducxgezmzfyeozoacccxaaxmcuxacaaxoxuuomfzxhdodcmmgxcehxycycyxdzyozmhgfmoyfodfyhcazdagyzhcdcyodfygmmeezaeydhxadohzhczmcfofxzaxfhdaggghmuczdumugfoauzzfdexcfozdhgyugyazxgomzxhxomhddfoceguddgfzzfcdaefoaagcmcezzozexzcyczheeefdduzyemcacayazoaexyzoxgzcgfauzyzfemhodyecgfeoeuhuohmoyazdexyguxaexuogmzcmdaeomxcaxyhffzhzzeagcfhhhaacmcdygmecocyoamudcuafmadhuxuozuecayahdyzzdfufmhdcfezoozcxzcfeceghhuyaudmxzfhgxfgcgddezggfmazgzxmfcaacdydxfeeemmdhhydcmofxxaohchugghadhxeedghxhzghedezuyuedzmzozfaeyhuuxodamghghzhffhyohdexdhuaygdxexomdumddhxameuafmcgxyyfxgcyoeohyzzzeeudoodyfodcmcamffohzcmahzfezozcdyeaezomzeafxffamycfeyddgczcgooddamdzuyuudmxyfmyxmuuhedzfxgzczuzzueyyuooegafgcehazyhzdgaoeaxgexagdexhyfaoaguexfyayammdafhaoymedxdgfdeogduuchuhzdhyxxzeffgzzxhudoyyoxddfxufofadyfgfeooygeecmumhfyfuhgxgmouahuogfoxyxguggofxuemcdoaaucdzxymfxfeeodhffgcgohhhmochfhuohazoxcecdcfxcfoheheydahmgfczzxhfahgaomdgcdfymyehdfayxucchcceohzyxyzfdadyahamagxegyfzxguxzyfdaydxmfxgefuzdmfadgzumouhdyuucmxaoxmafohogyzzzgyxgzfydyoufcefauagezugmhgmfcyhuamcexzhoaefffefefxufdudeouugcxffouzazgemcdghycofddxcxdyegeumfgfcfgmedzhcdgxhcymuhdfxxoeahfzmmzudugaexhaafgzmueofgdeoymoxmgfuemfofxuegyguhhhdymzfuzxxuehmuxzhdfzacdfauefydehzxuexmgcayyzmhafafzyahduzceeemyhagfzymfmchyychemycyggogdyhoyffzfgyoxeoohogcyzmxozcyayyyghgggagayhueymfaugxxzgzfgdgxyofmydfmzaaazohfhuadmoxucyydzfogxdumaamoohyhhzzzocydymmcoayzxaaygxdougcfadcyzfyeaoymdedguzfcagfgxdccmmzfeuozaumodfhgmffcudocomydmfyfzhfauezuaoeoeaocmzxeyzaddmagoduauhuemdozamodchggyyaduefecaaygmddmmyecmdfhyydoxcagdgofffoadxeyumfhheyehggzoffcdfmuxgmzcyyycmzfmddmdhoumghggufdgaxxfodazfxfaayfzafzguoxecaohmoggyzduhgzefyhfcooayyedfeheogdxhzfcyhfmumxoeyzmcueayxmcoxzaczamzcoxachfdumgdhegoxfgffyuuhmdumaxaoehzyahoxhofxmaufgexcagamzxadeemfdacmzzoxhyoecxxagfmfxgaoohcexehhxdhdcmxyexxucuxgcyxxcxadcuymhydgxzxcogafzhycxgaoygmemzdyyuayyuaczeuhzmcoxzydxyxehougdafuxdcggzymhfucezcemoomzeuefayccezoyzxeyehaxeceayhzxeyhmcyygefhzycmefcceoxcuyhefemaycgghmdegxmumhxfumcamuchcdgmofzgoyxgfhhxdyxoxoduamomygagxzcfuhuygudydfagxcguaxmuoghxcuadcxgugazomfuyodfgcgeaghxhxmydgaghoezmaoefcxyyeyzydhcghoyudmcumeafcoxuagxamoxzhhczmomxccodhggmmazccccczefcmuufhecxdxuaeeeeuhffomuzfmfxmoyfcmefomexumfuocmuomxzaazuhyfdzazmyhddghfhdxxehocdoouxxoofheomoaaxmzamxhoxdugdguzfugmhdhyuyuegxcooezahgmyfmcyxemeduohyfzoaueemcehfgzfxfyodaochuugzmmfdffhedgcxogyfhyoygaxcuczoodgmuzmogayyazgodyoycmzzeaahyhfxcexygccchoofxghhdggxcfdoxxyzdhdazfdhcmxcccyehegadhaucydyozcoeccgzdygmcdaeodyffhfeozcmgfhmymzmazfamhmamfczedddxemcugzdcmxxfycfoddmzmayehzuxzxuzzxamahadgxygfcfazzhmcguhzeoocoomyhmdgefmfofmxmxghxadayyuuzghaecdfhodemhoohuhfoumgfmfuhfmugdhuocodyfhhfffxmodgzyzyhuodoouyuyhyedhomuhhfofyoggxfmahymeumhcmxufcgofedygfgmogeffmzozmdhggxcxucxgcafydfzhmfghuommohdyeohadoexzeaoahczxeougdgoyxgemccdgecgadufgufhyohgzmffedezfagmyygyfgxexahxuemfmgagfcghaudfugzxaxaodamyhhyahagcmgmegyumdcgedumhdamgoeozgzhxofycuymadhgexxdczeummeoamxuoeoeugzzmeadufymgfgfeagdhhdufmayymhmdxozouygycyueehcdcfohoozagougeeehozuxcuhuexufuechfhygmxdaoodmzgfgczgdmdadmaoamgzzuddaadmxdcexedaxzfxeeueyfcchddmczaexdugxozoocygauhmfuyumauyacdmgudzhegcfceemzfmgcauoczdyhxfzuxeexguuyhzzydocddxhohgacgzfxzmzdmxcxgfoadgymxuzhcgzehmmghomcxzyohegdufdgceexzguggcfgdafyzxdaoecggdehfyzuoedezxdfcaoxmyhhehumuzehfyzuachehuxouefudmammemzhcfxecuyzyhufcfddmcccxyuzmxmczmhzayaffumcfhafcouuuhgzhozuohaecyfxmxumgeguzzcohhxdzofgeocddzhxxzfcfghahhhdemdzufaagmhadeoggaydfumdgozmygezfchcxhuxgaaxoagfyzmxxzucddeeyhoxxehzaucodyzxxmfazuuoeadyohohymgdeuhhcgufehdcdammaeagfamfhhexdxaaodazymageymmmgcdhgeoyedffmehxfyyauohmccmdaahxdxxcmuouuegazmfoxdfugfzazagfguxecxzhxdahzymfgcxomufgxfemmeoyhcxeefxeymagdgmdzzxgxxzgfzzafgamhdmhmfhexhdacoexofmacxfzhemeogoxoyaacfgxcycxaocdufzhayofuxoyyagecfaxzcauxhmmmameggccdzcfocaucguzaoeyfdgxcxdoydhuxhezfguxfymmzmueyfeuedmcaxggeoumfahdgmyodoexefxuhhyauagfcecmegohzmhehdmxhcahzmuhucxcchyfzadauzmgyggyacfgzhmcfxeacdxaoffhodohfucmhdyazfchmedoufczmemmfmcooacmdhuzeoaeummxyehhahzedohzyooozxgomucmghdhxeuxccemyxxcggzuhaouzycfehdufoxeyucyyzgaohxyfgzazhdocazhexdmguheaucxahcffahuhuxaxxchhxzgocfacgahxxuxahuxdcegxfaaxeemxfoyoogcgemcedxzufezazaexdoedaocuazaefzhfeoczmyuaucmecfohfxfxmgxhdgcfxyxygcmfufzgxoodeahyoxhcfahcchexzxgxoxzcyhgzczggodygfocmucgaduegazzfoazhhxdxgzexzuxcafufoagoegdoeoxmaaodeodmyemehfgzcazgxufacxdxzceogyyghaudzhddcocyegxuxgdxofzmmxycuehgmhgzgmyhygafcoacymaofoygomedxdegodhyhcezexzchhxazxxzeacxhodxyeumachxcduhcaezoxouuddxegdogdyzdxzoxxgcxagxufcgaoaghyauzzmmoyfaemafozuodfudyxfxfeohaumxuaagycumhudcyffxyfyozfyxcezaefgcazgffzdgfzefecyyeguoddumoheoxxggezezdacuxduzuofozouggdefyumdcuzecdmgofoaegahdygeefddxmcxezzxmadyazzmechazammxmhcxehghdzfhxxcgxzcfeyazayzeegfhueguguoyhxofyxcceuhymgafaahdgouoyhoczdcoohgduzmzdumcxooymfduhcdfyxguhzyeafyudzzzooxgdfxcdzhhfyuecdgxafzduameafacegfahufgfzgdmeuddhgzeeayfoazzcacgeaeeaxdgefzuucuagfhuzdyhxxfzgcmyfayhdydeougcfczxmxhxfmhcdxaocfugoxzdayhaxmueocgegoyeoafyyfcymdzugmhecueuyeehmcooydoagehmzzfmcheucggyhzxeghemcxafodozdedyeoyoadgfxmuehohxgzyaamfegydhyacccdfozxeuaezumfxceuaefmehxxyyzdfmfzhcuofayxdezchyuxahxymdccmxmagczzaozmycoemoecyhyuohocmacohagyozxgzdofdohmmecxoafdeohaehemzydchaxoxgfdzghudozeyhzxugzchmehhhgyffcucoehgcfeagcxafhuoczggcxgexagfoufycgedzycmfhxmaaxocghhaxcgzxffaafxhggxhzefomohaxefgczomgzcezyohcdozzfmomzehcuzcyefmaxdahmyoodyyfhhyefueyczmcaduddazduccaomxgoeghymexoyxddexdgfodoomfogmdohhyyduychaxaefddoomymzmcddafgxxhhfoyxoyffhuzuxazaofachmgaemufxdyxafxmdxuofhzghddfamaduxyxmxxcmfzfezyuhheuhfdzgouxfmeffzmdayuozuyggxycxdfedoozzedhcedxafyyzzggmazmycxuaguhegucuydcdaaozxmxamgyohfghxzcuyezdxoaegzufcxxgcueuueydygfuuxhumfxoehaeoodfggfmyzudmoegaoyammgmghcaofefffgmemdhfuhdmyoxfxhegyexdyyzemgumagmgfayfaffzhafaghffgzdczodeaomfxggycdacxxhechfgxmfmzgoofyzhueyfdyucfxyxfcaeuyxexadxamzymuaeochchafxzyxodxaoxzuaadoxmooamxyhyfxfxegzcafaxmuxemuacdgcexmfhaffeddgxxmgduehcahgefgaamugydcaggaafehycchafexommgzoyfemdmmxhaaxmzfugfamhxauyhegffmgmxzeddcydfhaeeucdxexeegaycudxumuafzadmxugmeuyocdcoodccfazecyzmhddoyfamocueeauchgddxofmyoygmhyudgcagcceuzducamuzymuygxuhmxzzcmzymzmfgcauzyymofzuhxgzoduhfehfdzgeyoaxfdodzadymymmfozzfexhdgfcoeefxagzfzuhhyczzfzhdmdmeuuguhzfmumxxxfdcmuodhoguhgcdgcoxoaguhedcfhaguofxzydoaygxcchofaudaeddmugcdfgmggfmdegazugayogmcgzzxydmxaymuyaohfxhaahuoduegoxeygdgohozhexmgymcuymgfyfhggfhcuyfgeghdxfozzugcofzgayocgfgdazmocduydomcaueegcmhocxfuegauazacodgzyhuuhxczzoucdmamzhozfxzuudmazoczhazcdeyumzhcoemmozgudguuhyozzaxxcghehyhzuzcymxchugfocmmgfychfmoagachgahhdazedcagyazxcyyaghdxzzzxdaezadmfhgxhgeohxmazaxehedygcfddhygfzmmmdzxfheeuaoheucfzmdccxdxfufgmgzxmoxhmffedezayhyuyyahugaecgygxmcozhxyhzmgeezecufghexdzmzecumhxeuoaazcyxgyamuxmdfuezhgxeoygzexhfayxhhmeezcfdozofeyfefczfdhyhgdxogeoeaoyzeoacxehedhxeogohgmmccdayyecuzfgmcazchaedzyfaeedyafheafxgehyayyxyyydyeymecdgyyoduhdcmodadezgfyhcaymmeafayagfxcdmdfyzuyoccoghdmxdcoddyfmhxaemyzguuuzzdmymfyzhodecgoyzuyzooyfuuufxooueudfcxcemyhxzymgddzamcmdhfyzfxeuzdacecoxfcfaafzgfcacyocxoyfyxmmzaygexadaocofauaymzagmaudgcmcyyaagcuuucouggdcfodoyufgdfehzeymugfcuxcfyuemaammoaczoyxzmeeafuzcxhfgfyfxhzfzaoyfffhcxfeudmdxygyocozzdmccxdmxzhuxuhdmuduyxzzedzemoefxaffzmghxzdfozeoydfhuufgfoezygchxxecuzeaexdoduoezgoeyoxdhxxgmauhdzdeuyfzxymhyzxmmomuycxgxzhcduyzemehcyyxuaxexgeydmdczufxfmggxmfcfuofochzfgecedmagcamzyfgoxgamoxuagoezhafdzaoegzceecohgmyxxchhfaczycmduhfxcumdfuacamyzgumxemxfzaodouyduohuxzmagogccchfzfhufegemxhadcchzogmcgddmuezyuahexexhugzgmyyazycmfdzohfcgmdzfzmfeaecohxghmfyufuyxeeyageoxxhyhgagoffgdfuhfzgdxcoaocemdmuhuugydydhmzuuhgzcfamcaxmzhcffmxazdyyaedmfdzouagaofxofgmeyyzgahgfeefyfdeyozexyozcuxcmuggoaxmzmadfauuzegfohadgmxdaoexyhmcyxcdgumaoufezxzczuuomghyemggyfzazmofeuxymzaxdoecdfdaumozmoauacuamuadgzuddhzhzhhoouocdhchczdaahxgehhxoucfocuhxaacdhafouauheeyemghgfchfzffzfhyfeuhxzycychyumggzhxgooeezhgdfofhfhaoyagxzxfemmhedzgmhucmmyyaaaaouuhacfgyeyxccdoxmcaaegouzdmdzzzazyxgzhuxcxzzugehfczffmceehydyadhfyogdzmgaoyhfohhmyfzcuffozxacdduhfzzaceoxfzehggdgzazezuofoghaofchhdyyhuczzuzuyeezuhhmhhczuazeazzddexdcgyhxhgcyxouzufyaddfacecxoduomhzyfyececmyuuaoyagxhyxhaedxyagfmxmfzuuuzdxfxgzfamhczfffomaeuhgxchycauxuuyxazzzfeaczyccudhchyhgeueafxzduuydhguhxamooahzgdxhooyzcdehchdhomyheguxyaodccxaeaahuooauxdaooyaozaoozzaucefeoehdgumfuygcygydzduuozahgdzahouxmacdchcfufzycazghhzogoxgohmmodxfuamgeyauhgcaxhxxdffmxuumfdaefffygmgxemygmdzcyagzmcyygaffgomozhcueeuuumyduxcfchhmghzygfyfyecyyexgggczdohzczxfcgyxaxacuzmhxzuccauoxuzghauzmeczddyoaahzexyyguxezgxcgodhhgdhodfgdyeufxmyaaeaamezdxzeudmoyedddocxayyyudggeeeymzgadzdhemmdhghuhyzmmyufdffumgyzecyyooaxoahxcxxfxfxyydxmcdhxcycxyayguaugcygoxdzhxudczmfdcguoyyzzdmcahxzoggdhxmufmuzmfogudeacozoyzyhamexamacfxaymoxaxaxxdozzzyzxmmgaoomuxefzgdhudxuffhfmfggocudzeocdxahzooyaeoxxhcaucdoxehgefzgufdmgecamahuceduyuyzmaomdmheoxgemgmagfxxoohcduhcacuauxeyxedeooehuezogaxyhdgehfxhfychozecgdxghxxyagzeuguzhayegdcuzmyfczdeayygeddaxofymdhogyxuxcafhyhaougheafddgeddgacagxgmfuchuduzgmhoahomdcyexhazuhdfoemgcacdymhffaouzhdhguuxomumehcyfmxfmgzeyczaufazocygmouyhddmomchaezmzauoehhyyayhgxcxcamommefozyddeemxmgfgdxaxoouyzfeyxdhehdhgzgogczucefhhuccfoffazfxofeffeemxxmxgfxcxeyfxmzghaagmcgemzuexxzxdffdzgxugxdfuxhufhfxfegufochhoouchfhyoaoczogchechdzdhdxahzaadfcheegxmzoahzhzmyuyumyfgxcfuezmayzymmdgxmcuuddaxgyhzcohadyafedomeyayfezzfeygugcyzuyodhcfduxudcfmezxuozggozaemugoegyaeahhxocazgeddfmgagzhfozfuegudueohafdacegouegdocygymyfzgdcddacehzfaaxzyzagadmzmdcfmuddcydgomeudymfeeedfugchudegoducxhhazzmyfauexoafyafeeoxzdyhgxzhydazeaohchhxhgauhzyhuyyfxyxcuamcouugxogoedfdeooazycayozmhmochgyhycmmmxachyxfucxcxcufacdaxzzuhchoefhuheugafuegdeahzuyueedyouucozgefmachmgexxacamghfzehmmgoyfemymmgcoadyuhzgochduefdfhayyyzhoxhygxoxghuazmgzzhhfaygdhyuhfdmhghmgddcggycfuhozggemedamofzhzomgdmddxgafzhymxcohaaohyyguuahyxyyayocmfzuaxxaufxyaczymyeeygzogohuxoafuzemxofmaoddddxaoaoxyhemxefhgfyauoeocoofmfzzuyoumegzcomdaxcyzfhugmmycdhoyoymahyhzdoocdfffoaegcuxxoemuzgxmoxaygadhuxadfyogzeuemucaacgydmyczfyahexmxzugoyhohuohhfcofmuauyyamhauayxcohxhumhzycechdgychcafccxzouxxxezmdmcgdfocmuezguacyuzacyzffomddgzfegeoogxhxgmmxyaxmxzcmhcmohgycdodamgfafmaeugdhxhumyuzhmymfehdxhdmgxoxefyuycyzgmaaeycozoccmooxucxfgzoxuaxaaomgffxceazxhaxgmfzozzhydxaoyefcahuxudhoaydyhuedgecxcdhcxagfcuuhxxfmodeedfofhzhgumhhyeduguhfgcezdaegfmxhgdyccmuxxzcgaommfycuddezhzcedmcadxhhxuogxzuhcuzdfxmeyfzgzemxcuemduecyyxemxmezxozcgguuxdzgxceydzezahyzeydzdcyxgmmmfoeeayxaehzgfzxooamemxzxgzezgmydhageuacyuhddcxgguxccuhoaeuuxuecyegexyoaoyoauumxoecgcdcaghgduazufhcamudafuxeyodhyzdumczuxdaxzemezumyxdyhahzaocygdaxyczgczdafgcxumyggmmdmmuezzhyfhmxheecuzcufzyohmdyucmyxohyxaomexmmuxxzamafaxohhcaygyuyehzxmcghzuchzyhgezzehdxxxhgczguyyfxfeychuzahffadhmdoeumoufcuuhxodugcgfcucxhduyddxehcgagdgexfcgegxaefedmazmzhcdzhhzhohxdcommffdcgzzxmcyxmdzyayufaahcxzzucdyeefxchfdfcdgefcofgydmhcymoegagaggozuzemudoxyhczmoeufofxzdagdagdagahyoeummdzmygezdyehmemmyahxgyzxgcedmycmcdxgedzdheogazguxduchdfmmxoczcxczemfzumhhuyggohohfgagfyhxugozcedhcxaeoeoudacexzemcucfexhuaymhzahxdgzyhzymcecucmdyfuhmhxzaohydzaxfzoeyzhfuxuhehuuxoaozxhugccucccozgacugduhcdemgfzouohzdaexhcxzgyxayyuhoemuxhzxgmfaxfeemgfommzhmmmfhmmmgcaxfgymdfamdddmxahxehhzaemmccyauaxhfedeyzooyyfehoyuyxufdzcaecaumgcdxhygohomadzhhdocmuouxxamcdeuchyodxuzfyaagxouffahhhzfdxdceoefyymuzumfdyfefghxoeaxddxumafmyuyyfzhgeagmayuffmymgyoozfdcudyzgamdxfuaemhaccgcuamgahxzyecomgcxmuehfayzzooouzxahoeaxyxuocgcdacfxmyhceazofdheyoufdyofgcmfdufcugcexmgeyozuycmyccfocmcogoyoyfxymdyazzucumudyxdefcoeoaoudhfzgoauzhcgycaoyuozyfdccgzeooaaohgcygzmzhfehmeohdoomdudceoacgddahgymyfgaxyaamagxgmaccfyzofaeemyyaxxyoeudmcfexyugazyamuuauzhffdyducuhycexuuoauzhhumxodxyacymahyuxcdauycuddduugfecgudecuegxumguoaxcyufmfzehzmhyyxzgodaoozyxaeacexeuhoaazauoxofxdmyxoffymadgxcccygeygeedygxzheefofodoadfxoddhfoxyhcexeaoodxdgzmmdxxfhuazayageahaoczagdhoeugufaxofeuhaudzzhzgaygfmhzxgouyydhxdoeyyeddxhaomdgocdhhzggyamhxfgyxemaymeafgzecffouzhuahaagmefhhyumxfmfuyhhfgzxcczuhoxmdcffcxegzyufgaagayffdzgmaomydheeyoyfohacfeeymxdxfefgxhaocaymofodcuyfdoemuzhycfgfxxedzdfuuemhffddhhgaddohmzcceoagydhuhmccfgodogeuumfxfxeomgxmddgxhuuhhdgaxegyxdmhgghgmoaefoacmouccegucyymzgozfahcyfmaezzaedhhmcfzhmaxmagmeuhmdyomyaheuhyfaezazehyocmhexeumdamccfffgmcdxhzofhuazyhxyuemhmfagoeymmxcuhmguagoeeofycoefuhezcxgygyxfemygeooyggfzocoagczfdcxaugdzegzmouzggghzhhafyxmuzcyxfugehzycexoucumemfmefuddmxyaagmogaxyozhamhdyueehozxxeuaccffdgfxyhuffameoxhcagzdyayyofdfodofucuczhygzfffgfomgahcxycxaaxamxcyaayohgydxfehdauzhdugucgcffcgafacfycxhdugdeufxuoduzodomffcmumzgyhfgyggmxxcaygeayxaeuceohdgzxmyzahdcafyggfcfcaeehhazumaxodygzhummczaoogzofhffzugegdyoccmfxffaxgcoexuymgaodxgafoayodmzadhyoedcghymxmhohdyhfoezaucydmzzzgauuhafxyoxuugooeexxaggehgdhuhddzamaeyffmmmamyeeefgoxayxafzczzadfhuhgduufomaheyhmhzcdhmgeefueeaycyycgayhmfdddeoecyxoxumogaaumaeuayfzouadzudmeaaeeecgcocohuygaofggymyaufaexgdgzxhcouzhhouhgmfcfxaxmhgacgzguymdugggumcchaxghceahdoogmeuxcgdodyyoeaaocyddffegxmezxczayymogdgyuegozyxgdfufmumzhayeydyyyfhgogeeuachdyuuccxdhozdfdufmycucmgcducoaogaooacemhcyduceydfudmxooaayufhzaemcgdzaymxccucycxyygaxduuhumxayuuxumguoguzeguufdeyymydxdxghcaoaxhyuhuyooaauzegmhdcccheeeyxchmomuaxumaddodhfduoauezzhzhyyhfexeugyamchyyzgdgehxzuoezxhxzofuyooehocoyocyoguoxmoemuddhuohxeycomczzyayumcfzdfaxcdefghhxhomccxguyhedxuaxemecoodumyghfdaahfcuuagehefoguhgxoeeaaoxdyxceyouuohoumdozommyzazmmgmmuefmfdegzxgafugazdxxaxyzaochoygefzggxodxahuycefuohzfxggzhzuaazmcecymcgaxgfchoaxuxyuuyxccohgfdghxfuxxfmmhccadefezaxczuagaaeuuuhfmxaagghucxghmyfehhgzyyuagmeehouzxfueumogdffyehegehxmhfcxoouzfzdouhemcgzhmmyeyzumhzudfygaohgghymccdzozzzhmzcfdoxygdfuccxhzodaedcdxexmcxmexdedgmhmxheugyumagyzdohddcymmhmdzaodczcehdhgmycfzoezdxhczeyxgogegydxahezzmgzydhxeahmyfogdzydudoauxhazdhoazoyayfgyxmuzadfxxmuaxoadexayfayymaffymedcecmdydhxmcgycxgdoyxudhcdoydcodecdzcyffoyeycxdzzhodddoddfgddxadxoazzgzhgefayhzhydzzcdzocxdaghhuafddozuxoxdfooyffmfyhmeazhzzyzmedyuhhzeoyafhmyudfexcaymheagdodmgoaaumdhaegcoghudehmadhmmmgumommyyzhahxeymgguhexuzzdcdcauxycfghyhhudghhcyhuexgodccgmugcycumuhzdohmgxygymmmofuguufafooxzzydydxucfohuuyohcoayoazeaaozddzfahehaxumuhdfdedgxeoazoymhmfedxhuddxcuyzhudgcaucmcmadmeayfhadhuzxmcdfgochdfyhmhameyyzxzzhfhzfcfeczoedgfdddzdeyoxamdhoemxcmayaxocxcddxxmdxouffdhyohamdafaduxuddfdczeguuuxfcfaydmfoguyyeodcmzdfhchzufdgamfxufxdyuzdyyodxgdyduehyeehcuhagxddyaoduoydydxdchcymummgexfyyyzozczfogxzgocddyguuzcyazccyzymeuccegymedgxfexzcaucogagcexudafhhyauuozfyyuyuezauomycaguyycdezzfycamycfaoacyeeeyemuxuggzhacxhhdfdaycyxhmgcuuuedcczdaoaheazoecmmaefomfyeghohdyxchhgodcadouhzgmmeymxmeuehydghyhouyymoymcxufymxhuxgfaeggxayezayxfegyfccmezcxcyxxugdmayofedezfxxudaagzaddofcefofdzaxzmgzhmdfmdhafzefozxxaugemzuzexzcemcoxecxghuocdzhychdodhffeoeufmzhdudzmuhyfdfzcyaahdmmgfgyycdcuacmmxxuyuuaugxogfuedxhehgxuzcfafxuzdaezzcocadozgauaayeefocuhzcudafdmyygagehhzzoyozuxeoheomoegcfzfuouzzaagodxcdecxedhmefhfxczyyeofcgedehouyxoxuzyyghdyumumeuguzmcmxyzcdcahehahedxaooexgxzcumofgdhhocxdcufzuxfmgcyeaymeumyxcuuzdhofzxyxgaafdmauaxzucdgzddcfuxufcumdgceuzzmymhxhffeeofxameygmccaeumdoffzfaauuyxymhdxumaxzegdfygghuafzeczzuoggugdmocydoggfcocmexazmxdgagmhuuoodafuaofmeyfddueadhofhffyumeahzfezccooghdhyhxzegexdxheoaogcxmcdccuoocuhehyfhchggxzxehghfzyeeecdamoxczgouduxxadugzxeoyuhmhmxdomzhzxzczhoeoxdayfofxemfoxzhgagfadeohdccfgyyzxcuzhdmgeefoyemdedxzcufafeuoyuycmzzoxdmfmmguumaazocfohmzmfxychedefgaeoxgzmyheddhehhyucgxfzcyyhdccgufcfydueaoeycmhzxgfdguuzmoofhyedgoghaofcozohacozdchafhcedfffmzzhcuaxxchauuoocaaumxmuozyddaayuoemozfdyfffdhcmeoedxamdhoeufuzghamduzhddfgxmuyufgaeomygzochoumumodzxcegadzodacxccuyeaexhhghyyzcauhxdaoagexyeygxmumfzdaxcuyhzzmaxhxuomufhdodachafxcfxyucehuzemgdxdfygdhuyeyfgaffecydfmaccfzuueccfcmeaudouamgchhgyfauzfueaoymedoezuxzdzouzgxuauedyxdgczhcdzymexoexuyzmchodgxcoedmoxfdazehoyeoadfyxhmzmgfdgymeaeduagczxxaxmyahocxffuyffueffafodguoucmxmzyomeeecocahudadxxmdezhmzhccuxdyugdhfdeheuhmfudogoeazzaemyzfugxxechdmycgyzahgoccdcaaugxzxmudoxdamxemuyymucxmeyxychmfhmxcxchfccydcyymdfechfzxyohyeaohaogffgzgxhhoaeuxgxgaafmfxehuxczfuzdeheygfecyguxxxeymfgehoecceyhzhxzcdggocdmddygoexxucgyeymoamfefeczmgeeemueggmxoemxdgehczdexgxhxamfyghhodhzhocozfaxoaegazagmeuohhoaudhmmucxgcxcdhofffmaxdgfgyhaafgfzuduyzmhfuczcfhcgayfgxyxyxmoccaexeayxzamyemghuehmzmouxooamdmamddgdgoocahchymucmcymymfahccuafeazuuuhxmaffhufxgxgdhhuhyyaxoczzycyuyaxzcazxmocygmeggcfocdhuduadoeghfzchgocuyuyfdeecxhguzahzogfycfcxczgaxmmhayufcxfxumyhxfgomxhzyzgxaezafmfgdzueaafyohhymmhohggdmfmxxxdyzzyfxmduhacuueduudcfuoxcfmoyffuhffxuzghoayxhuexcmdyoufxyxzxugmuyaeyfzfzyyoozgymmhofhmgzcffcuzdozgyhxhudmuahdghfcxoeggcmxdcaggxxdeofzygfozauzgyzgxoxdcfuyheoyefcydezgeemfcmdfzoxomfoexfghaxeexgexuacmeagcehfgdhcayzmdhdygxcummhxgggaodezzoxdzxdouxxudaxxhmudugfyyzyuomeehxmeyfycxaozguezzxzxaxadycygoeufcczhffhxyzgecuhxodcexaecchdzumazydgmcaxhfxcggzchoxccxhhudchamgxzgafgecgmxfogycgghdmzghedfayehxacyffazzuchzocxchccezxuzoydgdofyagyymomzmxdxhdfeyumaxyodccyhyxadaymucexzeamexmyeauzeuaadaxdmegdgmmxmccmcgczfzeazezuehhycczcxxmhumaehggegcggmmdoygaemmzyoyygcfddhdgfmeeccczdufddfzoefugyguxfmddxhmzyhxxfzhaxgyexoxgeaxfxdzgfmcaumzuomuohyyeucuddzoohfuzhfdcozaxyyhcudadxzucceuohdoefcmdeucogxzyuchyhaoxcxcxuhcafghudugexxdxyczydxgecxhugmazucggxucaazmydhagzyuhyfzgdfueaffhmfxaefzhcoauegddmfgacxazgyaaocufdeoxaoymmaffecffmafycuzuxdomcmchxfzhfffmugyxuxoeexuecgduooxmauocdhychfccyyxcadudafeefcdyzfcxgmugoeeuxuxhcezyyouafxmxhgxedyhhyeoyfhdoomhayazxhdffcmedzgoacgcazemyyhzumhyzhxycydagohuhyyhcadfozhycdeczyaahyoxyucgzhecfcemzomyfodfeyducguazzfhdacgoyecxzdmdzmcdoxehodufgffahgeucfoudmzughgamymmzzeeouymyyyxoaazyyydxyxmfgagghgoyhmxuzefuzhzgfxcozhauoudezhhxeaxumoufxxaugdeoufedecfxfchmdfxghccxexgmhdmffzmxhfgoyyyducmgcgaoexfdfgexgouxfaydzzmhuhzdhmzgdfmfudhefadacgfdzgxcfcgggduoofhuoohduoyhzgyggcaufufeuohhhxuaodeggxdxchexghaxyyfcogzmagyhdfyyxugahdhdodcoecdhcaudahzuxhaymydhgfoxumexggzzxuhaodemaxxfgfzedmzzzhuuydocogeaoyehexegduuxzxzydfhduhxfggofexygcmhumfzcecyodacyachxhafeyuzmcahfuxcdmaocgddhmhcfaohgufgdgyhudgmmofucouycfzyfffxuumzhcdcmxayhhgaamdgyegeaocgchhufdmfemdmmcddadcoudogxdgffczazcmmeoozgghezhdxcuygadzzohzdzdfxcafhdxzfmehxuoyhxuugogofgzmahcmomfuyxzgauaxycdyhfhzydafyumyxgydmumuyocumeocafdudmeohmxmxmoduoygamecfycxmecuffogccgegcoofmcfghyfdgfmzmcdhdccfehedazzzfzaogyyfddoxhgohgfyefyhdmhxgcagezydeyemoczooxofffuaacumezomhdaxaghoezxyoemhfyahfoydhxuadxmxeyuoogxxegxzdcuxffygooafmemuuzomycxmgggchxzeayezffdecfycyyyxdhhzzcomxachygoaayueogxyeyahamugmyhdahxyeyxxmhaudeffxgzedzydyggaeaxgoeuyhuaxyaozamxfgdoxgumgzzczadgyucexudgdyzcmzahzxyeedegcdazmmoyeeczgeymozhmxexdfgdayzaumodczoxfymoduyhccfycgmfxyfoymuumxmoagxamdccodcauydmhzgzyuxmxaoacxauocheegzxcghxgfzoguxdmheexfohuyyhgxyccygxedhfxcaagxyemayzazhahfdfcummdcoxoyugazzfyaghxohxafozxzuaduaxugmycdeohgmogdchdyazezuhyeegyhemguauuhecuggdxfxzfyfhfefhdgfczgguoxfyfcgeofguczoumoozcmzfzmaxfcxxdffezoefxgxcyexexcacymfhyffxgfdzooezzuauzzagadzxucofuoauycddxehyghcfcyddeeheefoxafcgfzefeuozaafhheccmfxffoxmdomzyoodoffcccyezmuuccxegfezhceocdghexfhfozddhcyxyaccaodofgohmmdfxcehfhfxmayzcxhxuxxyhxfugffayumomzdcoyzccehcfxmgzoheooudzgmfoudfzxguczdaemuohufueeuoyaeyhafxadhyhymmuczmuofhdmayfgcdoxhaoumacyuzoehayxxouoefgaeaazhfmgmxzgfcexgmyaoghyfozmuxmyydzogdcoadxzoyechhxzdgmeemfyggmaxofexxfaagzmguyzmfoueddeagfdychyhzehmfxzgmhduhaygfcdameeauxdumhydymoeexffymfmfgxdudmdzcoxhmxuaeymfoyzgahfayamfufdmgdyuhcaazxuufcazxycoczaemaaexfeguxhfxzcecdafyxyzfdoooecmehmddgcmfuecmahgoozedamagxhmmexyaczgguxmgudzaguuuzzxgxcauzfyuzcughfefguhzyyohcmzcezhfcfczuhehegfhgfoghdcxodxagegmzeddczfccdeuchzfxhzehachceucehzxmdofheggeoxfddxxczaoudomomydhhoezcamgggfgxameaxfcggfezyducyghaeoffxfcgmgdyfdhgahmcfuyzgaxhuufefxdxzeaddexzeycohzdfhyzffffxoexeddeufdedhdhugfxuudagggyxauzxzdyamyeayzeduaggfyfaxehaoocdfuechyhoxfmazadamhodoghocxufffymydedzfffaozxzyzxeyhxgoxehedezcaggzymmffcycuuacgdcxmcazcfmzduozoxfgucygmuaocyhzomedzeuocmdfxgdogagyocoahxdeoauxxmheyxafdzoxyhzddhxohymhyaxzzyyuuzdduacafocmzumahcdxdguyghmamxgauuuoczffaecdefehodxxoyeyxaufhaouzfxeeexfhggyoguxyuhdyodomeaumxuzhhcchgdxdxcxcagczyzgcozuhxefuzuaugfxxczfaofcccdezduezadadezzcazamxeyommcxeoodccfcazgdzohhfumxeafdzzufzhygamzmegcuhauhfhzxecdduzgfmzdyyfdeddexoucdymcdogofyyogacuaodyecgexfxcfyahxfmfffcfemoydfaghomafougdmaoydeehfugyyyychyyhyudzgdfcgcxhxdazghxzamydaazudduhcaucffxmufagcgadmdzgugaycodgedogeaaadyzaooohafoxxmmhzdcuaamuxxeyeoxomuhdofdahxcxzaudymgxeuomaehzmgumoxdmxygxmzxgymyozzgfhfxhhahuayhhddzahmagmogfhgcamuahazefchhzgmdeuuuzaxohyffyuggagzdgagfcmzefacooaxacugagoexgxoezaaecouomugxyxyoyccezmzdmzzmfmhdydyagoyaxcfxfdauxfomzdoygyhzyocxdfcxxydomuhmoeemcmcydyffmzgydamoomfmyhgycaggzoxoyycymufchzcxcdhmueczgxeaggeauygyyccfofyoxehyaouuozyaxudoyacfmacuduyofczdomxodocfeamaacufheauzyheehcaadafdygcuamhemyoffduohchfycohcxouzffozcaexuocyedmgezucxzeeaezcxadohfdodexmcuyzdxacgaaggezuyzuhduccgxyuhddoemxuazaddhumdofzaecyffzdhfyodoyoyuaeeeazyhocmguhegoyyeeahzgehfxchgggxxfyeoexuzefxuexocmaxfgmccygygoggagdufgmfyxmhczhzfooxxagdcmcahhymzufofdzyumxgaucazamgzhcdffmoygmugxxeyxdcyufzuggoueuufgmfymyzcggzyyohefmgcuzfygdfzhyaemymzgmhyydgoczhgfazmuexaaeuxcydozgmzmdmgeceuzhzofuomoyedgugyxdxychohmdzuodmhhecxoduxzhuymcuhdcczgugufzzzhzaghucdmheymzzeuofomdygofhydogegzhmghmmfezeayhuxoffguuhxhozfghfdyfxooyyxugzaxhcfzaeyyahhgadxhhhdzacdgamaggzuazhcyagefedhddmmdacfguczgdayzcuuxcuzemxfdmhfcfcauuhoyxdxxchfzfdczzgzmumfmcheddymczzxhogggudghhugyxehoymhfozxaccfuxdaecafgdzzcdfzhmfoouadffeohhzdhuaaefhmhzxafhhuuxxuffeudhaxuuocxzeueaoyahzcaxxufffeamhugaeecufdxdcyuemyeezcaadzegedehfomxymxomgcxuuhxdmofuhdgmmyfmhmxfoodahdhaeydezfdyyezmhzocxxzmfhmhoecogdyugocuxdemyyhuduyczxooxxommuzuuoggahhuzzddfcguuemyugzhcfoumfegmamumezmfzmyxueuaogzxggzadacducoyhadddcyhodfmohefmdyyfuhumcfhxzyahumddfzdahhmhgzhcguzzxyegehuedgoczouegchmhahffmfuhhyxuufegmecaxfeuyhzfhxxuuegxmaoogafxffoucgycaodeoooayfcxggxzchuhfdafuegccmhcdzemczaacyzfodeocdzymhxfhmucdeedamefmxfyazumoefhyzmagaggoaehamxhucyaomhyfddgzghxamxyacaecuyozceufcgduugycxoaefmyazmgxcchmeefmzyehccmmzauhxyymyzumfummcoyycummguadocfmcgmzadeozmexehomxuaaahgdegyhgyfoxogoemdmzyacmdmgxdameheuhzycacheyxmduoehoxecaxuzcmgmdzyfxgugzdyfoghcamcfuofgxzaouhhomghauzfgefxduaxxcoyxxmxhfxhcdmzaoeuhxuffadgyadaahzydehmgezxuffegahxfmomxdmgoaaduemugzugcyaodxxegecuxmxgyehddxhzhooyhhhozzemfmzyyzfegzeuzxymgmdchamceaczdhdaaaeaccchogdmmgfzhyzmyocdaxgyguaccogmgymuooeadxeddyedamzcccfyadccedxahfgaddychygcfmmfzufgzegeychogfemyafghzddyhxmdxamyxuuyfzuagmazhdeuaeuhaexuoacgaczdeodfmuyzghhyyaxgdazzcdoefxzhhzxcczegogmhmfamdzeofhhmcmydxddmeuuuoedzmfxgmhxzefefaxdaumuxdocdmmzfhdeymgezgoxozoaehmzgmfugzmxddfhdoyayfzazxuaxezmhxocgugoxygacuhxuyauhecouheomodyczduzmagecyoymmgcddogyafhcexuahmomgmdayzfgaocexcegfmfhhfugfgmxgyaoehfcccxgmhgfahzeeadxexyeycxaeyooydhzhaemumyuygahffmduhxayehdeddxdomegafehzxzaafyzcgghfzcexeghmhmygmxdumyfamzffhgxcehofcyumuggfyyyzhyfyeeocgdudagcgcecfyuaahmzgacfzygdegyycfyhhmmaauhouycefdoguyeufezhchdxeoffeghugzhmxzagaehcmedudyzfgyyaoghgddaoyudyoxdcoogxocumogehudfmxxdxcyhoxuggdfeydghyuodzgfehahuoxeyofoaoaagzmgueeyyuudhazuxxmzzdhogfgzzaugdzdhzaodcacacfzhczgeezuyemzdhexazuegafyzodccyyxxxxamdadzfczuygaxagzzchuooegdaughuuaugmfamuxcgmxyucefgxacefmyafdhgeehemzdumgxdhzazyogyxozeudeuhogeoamofedxxfocyogzehexhffzcyxyohcyodmuzxadcydhhummmghhxxmfzgzdeuzyhughcezdggzahacyydzdxgeocfdfxaeycugmmzeamyaxxucxoydycuydhuydodxyahcxhohdczucyuychcucfcghazdemzohuymcodezyceecmzxxgxfgxoeumhgmgxyyzhzxcudyyzghdhzyfmafczuduzhgazdmduaxohamzggauzgmofoxuaxxggguufhohoguucuemoaxdgdydzazuzoemgmafuymmyexueczmzddafgdzodcmmfgccezyzxhxufgxmdufzcduyoyzzdegmcauhmydxgadeoamucuauxazmeumaaoayuooeegggfxxcxcxamygohxhzuexouemauyzaydxzfuzhxhdomegmhdymmcdymghdfmodufahoauczgxmoczheoyfzffyuugdgauuxuuzhxoauhgayemcyeeadfedfmuzddhhmcddmydzmocuhmffxoyhcxaudxygmeedfxougaeeaumaxdhxfuaehfhzudouyezuaudxzeafmzhyhxzmayggxyedozuxfchhxacxmdxuycgmuzdemgxaaedozdghxmmcomgeyyumceofuzfohyahmohahdzzdzzhxomghzgddhhahdzyoygagyuygcfudogdaymmzumcuuoygddmuzomcaoohuozmmyxgccdmuydxeuugxguxfgaxgfxczeazxehfxudmzoeyefgdgcfeaahdmxdyychhxudxmmxmmzaygocxfoezeoafmhfccmefyxzmxxegdcyouhexeyuedgxyxyogzdxhzzzcdyuzuucmacgahueeuafoydcucuzmmcxayamyuoxueaauogeemfzhfzmzeegcuecemzeduymhyzagmgxadhcmxfdxehcyhyazhcfxfucyoggcuoyazfoomecyoggdufmmeoffmxgxuehxzaeofxzacoyymaxyzhyazdoyfoxgdcfzyxaoaezmhgedzzyfhmczdhuhayzueogaeoygcemacxxaegyeuhdxdoozumudycdfxccyggzmgcfouhczggfdadoaeeuehhoemchzccmeexedcfhoyyhzmexfyemzdohcummdeauyumohucozygdyxchggufuxchfadgdudgfmfgzufmdfcmdcmudyxcoyfdmgxazfmydoeyzgfxocodaduuomfodzmghagyffchdodxauzfmddzhfcfzezoccfdmhefaccgcxfmugxhedgxddzozfoazohouuxhgzhmduhuzhyafcgcmdmgochzymamyegzczdceyuzxcxueeuexdxzuuzoxchomoyzycxoxdggammeeoomzzyuhoyyyzggamgxofmeedmfumgedcfmougcdocyucmhyoyuhmfhffxfucmyzmuhxaceaodzzdeczazgahyacodzghzyzczfzoogxfacuceecfdghhyfaemhmueygyemdzgmzhdoggzzacuecucayxcxadzxaedecdgechhfdxmedxdgezayxoefofmdgamgagxgfagadadahhmayymfdzoufocmmogdcmfdxmhahmczmhdhmfdcxccdhguzudouhfdudggzmyomagxzxzeuehmmagmcyyoocoxhfmfcoyodcghmeeuxdueugxuugcgfhgxgddcmggoyeuhdcacfmxzoumexxgzcachgmxozxezfffzhxheouxoyyzaeycmygyzhcymxyyzzcuygooagozmzyfxzfdgeuegzyueymhofuxcdfafzfxxyygdhuoufoceoychcxucmaezhcyhhohhafhhxecadcyoouggomfaeeomzfcaffaeyhhcaaufxoxdcoocmygdycezazohcdxoozdeuzhahmfmcoeoyzmzmyaxdzcfgoacedceayofogyamdmaheuxmxyouaoohdffuadyzuuoemzhgdaofchmmfyceozydxdamhmadzhcgfhdazcfzegcgeehchdyaauzddxageumyfzudazuxzozggemohzueahuefdgdzoxhafydzademgdacmefduofahhguadefgfaxgffcayomdyyecfohgouumzeoahdgmxhzzchxzygzmedxuzohyzcymoucxofomacyhxcugeafcuzxzhxzyhgofmcoyzgxuggxxzxzoexfdyxguaahzxdzceuzcfadydadoyxdydxyhfzcddgggeuggehdocfxmmaucufduygzxhgafegghddhxyzhzfzoedozegzazuxmuezugddezeadfmheedhoducmhhdmmxzoghgdedogfuhudfgducceeuxgmmhxazghaagumemuxcodzoeogcgcdgehxdhoogdcofyuczhexefhgegyyxouggguyxcgmaxgacfxcoxdhggxzhyyfcdzdgzxeohzmxcdyfehdmuuugxagfmyezfhahdagmucmcgfdhxccammduuudfaghhmfhadhcdufozmdhedhcymuzuofxouezzueazxhhduhyefhmofyachcmuazoaufgeexudcuohhfdcmmyczyyeaodadoaxgmddzxymexedcaxyucfyuhfeuahoogfhymochhzmdaecxeaozecgfoyuohhfeyddgfcuoxugoyzzhoaghduoofgahcghuuozehugahgzaaddmgogffcuuyagmuddmazfhooaaymduyzymzgazcoocxeogucofxfmuffmehofedzzcazyhufcoegefuczxfxxueufuyxfzmmffaodceyzhcczzgcggxgmcfycgezhhaohzfmeeaeozmumyfozhdycghcacadymouhczhzhzmfazchduydufouogfogyoycmmccfcyayzaffcmemefxzhuczdgmooxxohodyxeffuoxgzxucxmhchdxmghfxuzoyyugmefgaedhhfxxxeofadoeuaozxyguxaggumeogecuaeguaohemhyyxezagfyccgyzmfaecdefoyxzafuaddzdghofhfeddooufhaxohmaxedxcfexxdouyyefoxuhyxczuexdzuzoadxxzdhcfozxmxmyadadmzdxxmoaemyacdcyhcoodemaoaddfczohhgazoecgeoogccxomzyheyzehmggyuxcfdufzhfaoydzmfyaghcuouzffxmggohegzdayxmyyzoyuadxfdueafcfgzuzhyohdayhdacydmmagazxzauffeyhyugxgodmacedyeemeuhemexehdumuefumhgchxdcemxdmazfhamaadzxgghmhufgddfoehaghezohhdhmzuzayxxgymzedgauyxccdaoxcmgdxfghddgofooucocgxgomhamfguofmycgdmhefmmggdzecedzdauzefxxdzxefgzdmoeoocgxofooyozauxfaegofocuxmxomaddzhymuyzxfauxhhzmgfxfhuyhdxdghaufcfamxxhuugzemdeygcmygmyoacffoeguuhgfymygzfcudhfgohxcgygxoumffamozadyyyagmzxaumfooafefahceohoghagadxdmzoghfaxuzyuzagzoomzhffdmedgyeoozuhuogozyzgugydxzxauyuxeguehzemceudgagxfhmcaaggufyhmacuhmxhxgegozgfgmufcugffxhmzxmxzgyfucefzcoeoocmdhogdmdgemhmczeeuyczoeouyxmoahoehhhfdxexfhoouuzzxuumomyzdzxdmuhdcffzugygedugduxcxoodagodzuxoucuozcgmgmzumzohudzuegozzayaadaymmxfeccuxfuzzguhxmyezumxoohhcccoadhucymezaaaouucmgdhuocxfzghuedyygyxmedzcehxayguhuugaufhgahmcghahycdougoazhfxegzoouyyfyyoaeymamxhfaafachehhougohuhaemgmoedxdfhegxxgxxafychyuadugeacfgfgcuoyuhmagdxmhexfozmfeaxhaafommyhcccedacoocuouezmcymuzacfaxffuaecxofudmofmoacxeexgahzoohuhudhuddxxxmmgheuocefdgffdeycohchodadgcdhmgezfzmyxayaamgdoahddmyxguudcymgmudyhcfagzzdxmmoooxcoxdzmfzcfeaguugacmzoymzafdgaoxxhdgezddfcodyhzumhcufhdeeggeyedxhdfexemamggghhxzxxguaxyeccgcfghyfguhmmdxhaxgcahxedomhaoxzhheeemhzaohocfudcdefmzfxeagozdcyzhmoeaaocaezzzcgxuyemehgzddfxfmfhyczuduuxedxghyeggzdgcxzuhadzxoxuzgxaoxdzhyaxxuomacaxzagyhodyuczochxhhyydayzhxmhhgmcugffhuuaeffaddddgfdyozmugdgoayxmocyeefdgzcyuzgddaeamzcamfugxmzghcmaccdeduuucocmxyxmhzdacehcfuxzgauxfxuggxyaeyaeoemhhocydmxeozomhecxeymouyuzuugydfhfchoogfeaaagdgdcumzczfaefyhuoeadgohogccydfudhfdxmmuaoxyuofcemffdheggzgyzdmoedmmgzzommfxgoohcyzemxfdfyuddaxchmfaaozcffzgdoumzefeefcgzydygumfdhezzcucccecoaouyoemxcyghudygxahxmhmfumufcexzyuodmhzycxcauzdxdahczhhoceymdzmhzufmacgyoxffoghadgahfeggzhucuhyhoueozxmdadcgcfoguaczoyzxdecayzhdhmhddmfyhxucgczdoyceedhfyzmxgzgmzehfcyduazmdxmchmdugxemmmmyzzeyxaagdggduycoehzycexudxxeaozhcoazhzxmaoxxxyadaoaahugdzogxxxfchmozcoyyhhggfyfxaeafoayugfzzhyamzmexuuzzzagmyyhoeaacouhhgouhahggzfcazyfdfmmghumcahxfghmfuucoyzfmzggucmhmdcyufddfdacuahmdhxggyaefucxuguxaomyxgdxugaeyugfmdmxdumayyedcmfmoyuaemaohzuzxyuegdyaymeuemxzumfxeghcdccxumxamoomygezzgohezmxfaaaxxhfyogyfchofzmmdumcoouxfxexomaoguxhuxahcamhccyxzuaazyocoxahfdayfudfodyoydxuymygmhoxzdgohoxagdeydfadghxzeehaommyymafxcdygceugaeucxgagfocoooyuedgudccfczczchzxxzaeydmmceogyxezcyxfgzadahzdehuxfxzmzcfhuxxgoyayomhadeodfzgeyzhhoxcgdcymxuydxmdfeyxxeffgudmuxyogxycefuxhacudxoudxoxcomdmoazhdumfgccuyxfczmohucugedczaxucdyxoczuhfdgdehcdomzdyedahxhxyuddduuocayadcagezyuhccahyfeuhuoxomofmymgdzxdgudddcfdeygmyeugggddafuydgfzcfyfecyhyfcdhxeexuaauyffoocaeafugyfeoedzxfamfogamogyzhcgmxmhucdcdydfufhmgfgzfyahzducefguzgfmdfggyzzfczxocgdcoeooghxzoefdoeedmezfcczczazycugzdcuacefzuchuaxyxahayxummeoeuexhaamoygxueeudmgocomazhggmxdgzghxhamfdfzdzxooyumhzhgadugfczfmyuuadmgfdmacegmgzudegeuhfefzecfgchcgozzfaoxaemhmgedzzzefduzguaymhyfhczzghomomauomzxfammhcemmgfgzhxecmcaeffyfacxxhgaycyzoxucyuuyzudemeyfduzuzuouuhexedcfdfgzhacuuoaoxaufdxfhgxuyfxdadxuuuhyyddehggmaczdzddzxmcxymememxeyyufduhxzuouzfehxachchymgmxayucgcgccueufgfodyyxehhzyhhxucocmeghggmfxooudazyddzeocfgxexhodddmyghogagcaggczgfdceefhfffzfzuoeagaoecemydudezmecdxgcfacfydfmhemhfaaoydaxmgyuumxcfdxgfezmghomyduxezhuhefdzduhaamaxxhxxdzozfhhedmdhmoedoyccomdxuahhhhacdazyfmuauxmzuheeaydxxmyeehamguxdoagodocfydzodefdzymdczdayuhagfxmfgmzmeafhczmuuuohudafdfxzeeyegomcceaaydfygamagmhhzzzgchohzzfyfaauaeexyzfdmxxhxexfueooyhuzuxcfaohuhomoaymhgmzcgmygxazfodcddhemeucgufmaodeamyhdoaheozdmozouofaeauoemedxxexdzfuomhzmxammxfoxhdoudegdozecmhmmmfamydcfguzgheuucmegoeexxheuafehdcodfzghzadfyomxzedhmmceofeuafzzmhygdmxxfxeeeaxmdfmydoamxguggeezfhuuxhhoyuahmohoyfaexgyfymcmudggxmmxdzgxyefhaamzmemhgeuufamdoggmfadcuzmuzahxyeoymmdgzgmexeumuzoxfhuoexodfffzozazmgxccgdxodocyyhhoaozxmmzxaeudeyymxzhefhgymycyyzhuocgyoudmefgzzaoaugcdmhcgmccfcomzdodxffhgcezadoeyyhuecuguczcfcdgazuhamuacgahgxhaceeehgefyuggdmxzgxhxeohzczgxeyufmdfmeygxxdouxucxmgmcumaadomxmfefxyyeumehgxxycocyzzamgmgdgcmumexfcmfedcagfuaeooyfdzhzczhouuxoxaxgyzaeoxohgudzzguyfxaycmcommufoahhfdfdxuyoacoafdxehafefudcgxgugedgohdzzgdhyayehaydogcymhodzcagcxgfoeuzgffhgcmomxoadyoyfzaegeoazmdegmaymezygmxyeomechdydfdhyheedyecxffmxdodyduagxoogdmmhmhyxofeuegfhhfuyyycofuhauoduoahffcdofexeaafmfueeeuzcxfugyucamxyoecfehggduzczdmdghhygmafyyxdfoxgochemmegzxeoxdxudgzfaxzyozedcxfzgcgxxuczeadeyfxgggeuagzaoyccuzummufhdczhgezodueezcemuxydacmxfuhmehycezyzfccuugdxyouuagafuocxhcyugdyuuugzcmmeoahcfhuhoeeagycxauzhdgxcxzmoouodgyugducxehxezfgoaoedefmefhfxoufazfdagdxymyyugoofxyeghmafdfceuzcduoyufhuxxzumxgauouccuxdgahcceyfadyhzuuaxxygzuogcyocoydyhdgzhuzoumdmueuzgczexoududggxgxamogegfxoumyeocamzzxmuyggufghyfumafmmemocoaeouhoyfoyccoyazfgmayfyogcamyeehzxooycmmugxgeouhyhudehxugoaxyhyzyhzeeccdumdmxyzueeaaoehgycdhxxuogfhehdmmemeeymhhgxeaufaefuudhfmxyeczcycodooufxmazoeceducmdafcxhoufcmxdyymmdhcfcxauygzuymgdoyxxmeyxedgmhdhfyomczecygmuoafcdhguyemdxxyhfgdeumeezhzfuyghuzodcdeedezxhdzyfayughocuuyghceczxzzohyuaffmugadfcafmemfyuuxcfoohymeyxehcmddmczfghhgfxdmouggodumddomgxuaxzxxdfmefoofmxmxhfxxczzcceadgzczmmoegmdcoohydxcemhxchuzychuoffggozoeehggadodaydayoyuxgohgdmxyxegoygxeyaomuayhcuzxaozxyooudgoezghxgehfzfcooocgmcfufogogmamfohofuaheazyyoyyzyodeouomxmfzoeoffmyafehcooozzzuudfxezdxoeuaxzgfougyhexguzumhhxgexmaeaaxegeayyucycgzhhohczedmxoeugdfcczycecudexomzghhamdhogyzghhmoueogxdahuxgoaddeoyoyzhguhauufxfacgycuaufdemmzhoyedmxaouyueceduaoyzfgyyuzyegayeemheeaofyaofdfcdxzzfdxxahdxzcxudezuoyuoymxyzzdcgfcgdoeuhzmeggzegcohmaddduhcyxzgxeyzdzouazygegeaydhzaxymhmfaadfhyhyhcefmduyzhddcdmhfydczoadfuzmghooyfmfgogmdoefumddzgdamgumuhauucxfhmzmfyzugxexcehfmfoaoxydadmuuommmgdhyuyucychyoydfdzamdgmuyzhxaegezzydyyocyodamazmzdeoyxfchozafygofmgzxyxxzmyygfgeuehfzyhammggahzomuamgxddzfxmxeuezxaahuzfhogacxhaezzfomuyucozyggmhuxfafxgmexxyogyyxmodzuxhgadouuyaeucdeccgohzcyemcdxfmxyzuaazxygccfdumddedhxogfdemayfzfzacgcmggaoemzochmdgyuegaoagzyozuyczahchdzgycdcchhxuyfzyehyeoeaaxxogeahmeguxaeueeofhmmzumoxhddcdhcxfxomxmdduazxuhcmxuadoauhzmchuxfayeeegyugxhyzdmchdumzacdaduazcudhmguaxeccmuaumaoxfaeegdmzmeyhfddccaeugdegzcouahozmhhgmmymxzzezgexmgxugxxmhdmxhegxfefffxhffxogucozcdgmxxaccczmuocgduuzmoyexcyuxyzymgazuyamzxmddymdxydgmucuoxyaaxmdcfafgmmzyugamdgdcdugfazzuguacdaoeyugheffyyehxuzmzxeayxffuzauaczzhhzdghegchmhhzfoyamczfgfzuyfemzcxygaxxxgghafamucozxuxcfdezuehzmhzcyhfxdcyczgmeefccafahhymmucouxddoehhmmxyazucoxommghafoyfhmuuagegcuxfgdfygdoymegczhuxxfddmcadagmegghcfmxgzxadfoaefmhdeogyucghyacdzcyhyaefmaoyhgaegfgcfcadezmoeuoczufhohzmzydyyammdxygezmaaehozumoezgagefzooyyzemxchyumdhoxzaoezhmhomhzyemuzzdxeayffdaoafzhezecuzgfydmyaugugffyffmugzxezeaeduxmgymzzhyeygaazafxugyfcudfgaccmuxzmeufzuamhzaahfyhmzmauyuduxzadgaxcmmochzhmzhcmyyomgcogohmoxuduxuhyeemzuzxgmzxmcddoddghugumgcecaufezyaxefoxhzgmuoudyhoaoyhagogazxuxuhcuhmedafyhxuycxdgcdzygyzdcfdzmgfzdohmczuduyzymgdfmhgcexzgymmmgfuodxdgzeyazdxgadadxeczaeughydhfuzoomuxffhzmczgazouzyfmeecomeuczoxeexhxuehaceddddcuzyzmozyffxxycfxehxyydguzdaamheuzdcaxzfxuazydmzxzfmmcdggzhhygymaeymoygghygdxegdmooouoamaffozuzzumgxxeocxadauggahoaoouyzcumyeyccycxxccxdhcdomfddchaemezchhmodxxfyyyfogeffyamcxymzhuaouycxxyaaczuzexdeahhyyfuxgfheedfxxcaomchamxczuyuccgycxgcdhodzgogzuzxfoyfzoaugoxgcyxoxhcuyyooafdgfaefmzeffhueoyoagxoheydfdfhuzghgczccoozzachfhdmaaafgxegdhfaudaugchxygooozuadyouccycguyyeedxhagyzfagfduxomefagxohdcoyzzaxuumoygegucahzxezaxoyxxdczeuexgucufgyfhdddhfuyeezfgoxyxhyyggedhfmaaamzzyghmgezaycfafaucfzmygahychxxoeyfazyemufudhoguzexmhmzoauedamcadhumzfzgoaaohggaxmhafxcgxuymzuomdddfhgxeuodfoaomheodzgygyadxxafdmmyehocmzhhhdamhyxyeudzzfcedfgugczygzxehaczgfygumcceuxdmcuechoeeduyummyuaayoyumgudxchhdgfaahmccuuoozoacdzeaahxxeggohydamdugcgcgzedhamadcogcecxzuamexoexmzaxzhcfxhhuexdaxydeaymygmygmfucyzmxzgezeaxauyyfgeafcghadyamgyyfumfyuxoxcueeogfzdmgeyhhzyhmheggaghmuugaoyooocmaocdhfdgfcczadyocfmmddzaczohhfzcdomudaagfxafxzxcgzduxuxhdfmmdouzxemzucxgzoyufacfayyhfofadcaydhcxfozhymegyfyyaeyfouaaudmcdfumuuydxhzycmuuofomdemzzccxmdhhheouxxhhzymgoohxdzyyoemohxcoeafggzcyhgmzdcczddaycuedmyzdmzhyoxcmzyfxchffaamgucxucemmgyhhmzedzfzcdcxmmceuxehuhyyadgxzodhumogyyadeydudumyuoyoufgdxymyahymgymummdzfhcxcgcgdomomoyzmgymzdxexefeaoxhmecyfyamgzfmoeceehzgxmhfuhahczochyumxozmcfahoyzxazaademzdmeduzcmoydfhehchhahxadmmduhoxeuyufceueyodyeuyodzmfuydzxaezoeodccyemxhxuxhfyyheyyggygguugfmmdezhhegucxmhuyyzfxugmumoggceahxuzhgyzafymzuhfemdehhzxhefzddyzmfefhzomugcouozffhoggcgyagzugzcoxacoazoxzhhygugeuuyezhxaoeauguehhgucgocgxufcudxcafzhgcecyzmyheacxafhgzyhhumccfuhhuahgcxfcccdgeeahoeczeucuhxchoxzehguymhcemhzfxmyueehgyfaachfaygghadazodohcmehyzxfcghafgyfeecuogxgouuxxyeazxefymhxdcmehafcfmxaumyemcghfhexhuxcuefommxxcexzagxmcafedcffaxzmooeeuozcmhomyemxmhuofaxhmxgyeuchyegaodxohfegfmhddauzhmmdmymehecezhhghaafmadccggcefxacoguaxcgzxhzfzzgzouoazyyuhoxuoyozdfmfyceexzedahyehcfuoadcafygfhedamzceedyazeuocdchhhzhhgazahdfgxfffzagooauedgaoduzfxygxaauuhdfuhhecyfgeyxxdehuuamozgfzaoxzuhzhgfehyggdzxhzfhdydmgxgozgyduyhmhfohomfdhghexmuhmhmdhgzodoxddocahyemouyoyfayacxumzacaxuozxyhdhhzauhagzzmxzxaeumzofahuacduguchcycgecguchhxmychxogeahoeuhxuefeyahmoceozyozaafofdmyxdauaaouhhgooghzfycofuguoomoahaghoumuuzxeughoxexcuduexhoeeaxyfmgcydoueozcazmocdayxdmfoydumfdaecyauceucmexueoddhdofacmhgfxyoddhfgdodddxmzmxaxfgugyzdhexehczfxagzcdfxmzmocgxecomeeyezxogcozohaamczoxayyufxcxuccdoffumfcyhyeuuguhehfdozxcgheoeugoxzahcxxhdfeddehygexouuymgeamyuahxaeayomhaeeoemofeoogcafamgxxfxdgeyfeagohhzueaogamfmaxxeycdygghgzdadgafudmhxuuoooyzomfoueuegxhadxcahzzzfgmafefougdyachexfoufhghcomzhzmhhzyufudzeomzmafoehgzfohyzdaammcehxydazmfyzafexcamaghdoazhxmfccffzzyccoyeyuexxydeecccfygeygfhcohamycxhygxyygfezdxohugfmofcayxedhuyeyxxogmfxcxxoxcefhmguxohddhhuyguycfxemuchuxezyuoxchoyxxaeamfgxmmezeyyuyfhygcuoyccoohxyxadyxuaeuzxedxdmxahgauoezazcfxofzehodfymxhyafaxadcofyxhdceuhgofdyxczfeedoazfyxxoggamhcmzuuocxayeuehggamcoodczaoxyexchcafdxdxafcdmdfzdfczozahdhcmhydmghzxczayxmycyfauuozgdxuaemoazfduufmhmffcddzgydamcuayacxgacfayzhydxyzeoaexzhzxgfufycouuuddmouaghfhyufdymmfxocxmfdfexcczcccuyomzddhfmoeymczmgyeuugueogammgdxacaaomofxufoohuayzefegozcmdzaumgzhxueuohuzayceoehuufdeyxcuzudmdzdfyduhyccaufyzhgegdzggufufmuumouumyayyedzgamcczhfdmauyzhcfczduhzuefzxexegumuxmxheugdoczudmeyaxohmeozoofuymayuxacyaemucdaeexxuxzzogoymdozxefazzgyefmmxmxmgouofezhfoafggyouahhouuahzxauxcdgdcxuzyzazxamyumghzyzaafeoyuofexmgazdzadmghfuhaemoyxxdmmmaycamfaxudoyfoxczmeamdeoozdhafdmamyhfdzdcofugacueeccymgeyzxcgfzmxazguyyamfyyxuzhfyhuxadgheuhaydycoeumfccgefdcmxcuefheuhzfxyyhecuecefdoozzycyxfdyyuygmcfxddcdmoxuzghcmomdmcuhzceufguafyuzazgmcaucgdagoamoemouhamzoxfgfyexyaecuyoazzcxeafzeefegcugazofzzxxdghogycxeyhcufguduczuhdmzgdzcmfgzeauoezxoohezfhoeyyaxaxxcoggxmfmzmamumxmxmaeaxcexmzmdhmczzxexohyzczhucmgmcycauyhdecofoyahfhuaufxyzefzaxyxyzfmfegycfzocfaddaucoexeuezyoecghdchudhfemoggaaumxfhfmdgmhcguozzafeeegxyzhcgdgeedahemhfggzdaehmzeeyzaomfudfaxdcdhmxxaaxaxhfhxmgemogofgmgaguhfhyceedfedddzedaahczxmofeemgouguduyemefxyxadehgfydhddxuyxmohogadeuoxcyaczoycxmuugafuuydygydfgocaxghhxaffefhhgazcheuffdufaucxzxyfuaxofcfxooufaofaffxeugayxcogezgoofhuuyoozuzgmmxfcaeaomedeodzxdgauudgcamhahaffoueeazmufyyufydcafhacxageyuezgmoazxfzguyxfcahgaodhxyxomyxhmgodohomeggzhdococcaxxxguaofahdcfmzgmeecfzummhocdygaaxxaogeayoecdzefzmcaauzzduoxgdgzomyefzaxxmfhdfehdouyouffdfemahyfmamudohmmyoedcyuzccgxmyeamouoaaxfuomxdoyffguzzzxouyfahhoydgzduhehddyfuhaogcchgdzmayeaycyzzxffohehfxfzoecfufxoahxayueeeaxcdhedhayeummzhxczamhzedcfecgdyfdycyfeccgeamggeoycduxohoemxfecgheamehfyygdcoahzdeyumgzoyfeacohuygazxzoxxagfzudoodgucyhmcuyxoxfuhfyxfcmcuecdfadoyfzhfdhhhmyhudzamoymxfzdmudedmgddaffyfzggxxomxugmagyemhahxfyhuxddffddeaymzouydfemmehyaxecfeezuzuhzmezxxyfxycguhoxcggcyxceaxeufffezocgcuczccuydcfefxuomyzcegoohcxxegmcafhxgocccmuguyhfoxzddecfouzcdoehmgyxyzhxudgzxxyuyxmzogdyaudzhddzcfefgcmouoyozmyueycuhmohuxeoofcdmzhdgxzegcaxgoozchfozacgdefmzhfxzzhezaycfufeeoxfozcaxayycegmddxfdymzcdchoehmuxffeuoohfddfohfgumfcuaggfxamexguamgxzxozfaocuaazhxocahyuduogzgadehyeyxyczmufxxuzmfgeocmyxuozamemcmgyzcmuegyceghhyocdgygczaydueodamuyyuxzoxzamheoaommomzxxucauaheagzccdoemmaegczgfzouzdfcexfohgyogfaxhhzgfmyxhahefxxoohmmydxyfyeogxyggzouyhxdmedmcozzxahaagoyoomzedcmaufufuyyydxddocggdcmuhhdemcaeuuhhcoedfcceyamygyxyoydhofchzhcmdxaehomhyghxumfmdyodmgemuzxohoguzudxoegyydhgmfdhzfzouxhfhmxdgxyaaxayfoafhooxdozaefcocxecducgfexgdayhdfcgudyfycdyeeauzxmzxgfghuuahgemaefxuyhodyfzayygcuhaeyhzcayaxxofzgyymyymoazfgeffxggffegocgaxhhzmaeeocedegxmgfegyacaahdumumocyahuaedmhaoxmcoohdugecgeumxzzxddeudcdohgumfuuaummuafczoeoadugozfcdcaczugghhzffuuzzuxoehxuuxueehzgdcogyamhyozdagzechgmcyhmfcadfuofghgzdohxmcezcfhxhyhamhumaayacdodfaucgfufdxhfazouauhamghzcxxaohofozfamymxxdmazoufzddfuceuazoxugecdcdmmyecoaagzmgydedohcaedemyfxcaamfgehexyaceaczugeuhoxxdghmmaoeamayaegduehdcdaxcxyzmgcmcegxxudhuxhhdaygcgufhyfzfexaxeogxdyxmxfyogydyoxfuzdxhyhhuehgghaeemhcdoudccdcmgaoddgaxeaodfeyuxemxzcaxogzfexhemzofzudgocgaumegdecxdyzafauzxyoaczdffgocdmffyyuzfhogggcdfeeoyymuyxuhxuyudfauzfdayaffxyodyeuxyafyfdfcmazgmxddzgxamexdofxgueddfyzyefxeudzxaehzemyyegdxhxymhczzgamuecyooueouymazdzhegooazgddxyooeoaooggaamzycxzayuzyxfgxmycuugzaoxzfzdcoyfxfayoeuezmyemfdxoeefduuzuomeehzcggufcdmmoddcmceyfcmgcccfuyzouogxdhymzoggaczhgheydumfdmyfaefzxhffcdxdxyecaoxmhgmamfmogaaezmcgggxzauauccmuxdamxyxzozymooffdcfdmgxzedxcexfzmgaaxumhzcmgduxgydueymfeffgeazzoddyggdcmxcmhoaagzzcuzzchmdochgafzxhmoyduuczghxfocdxcydueheyzughexcxhzxuecozgyoadxgmgfoouaazemfauhhxdmzomdhmocdmzhzmcodezyofegfufohcazmfxexdgaugmuduuudofzydxxccyechxddfhzxceayauumofyfdfdfyfeumaxhxyocezhozfhdogzmohzzzheezfcuocmdoxoohgghzcoeazaaaduuuhhaoeeaghddxaozzhzyoeeyzxyumeaceuyzcaechuczocyaxyedogoaycgdegfefxyuoagcggcfhyzdaodxumoxaugxhfahxxahdxgfgcfuoxyomgaaffogchchhzzdgyghdoxzadgcfefefyuuezfhzxozgadfofezzffdegoomxchfudeffmzzoydufcugammczxuohazumyouuoychuamfaoahadhzuuhemghgmdahcmfhyhyfmgxfxuaxuymgdyzeyzzxfacehhuxddhozezedcgcudefhhxmcymcedmzxuczzzheezyhfouccheazyzduzcfamyocaxeeyauyhmymzeexdcmmgoefhauaoougagfohazmmxcofuzacfxodmguehfmuyddaczdcuueydoufadogxodzgoauuocyuhzzgdxuxgxzfhfheaamofemheazduhyemxofccecyuyheazhdheuagaoafcafczueufdcaxogoafoffyzhuexxfcucmyymduycgfodygaehoozezughmfgyhdxhaohdmoffafexdgzegyydyadzoeeayhyfzezdyodhoagfexgdaogchzfoehodzzdyzdycyzeoggfzgxxghhezczoggcuouufodemmfycmoaafhuczuhzcdufcgmczmoamxhyooezxoaauczxchdexmdxhmfuooouazymahexgacozzohhhczdzhffogozadhzugeaeefhfdagdmfuoxczgomeogauyzfhmamymyccdmxfdacgzgffeghduahyoyddzffhoyuhuzzgoehmmegezehghacygmmmmoeouzeuzydxgadchgmgcyxzayfhzceyzugdaudgeyxcudyhzmafxdgmduedducmaxuxazduecymydhzmaugecdydfgdzodmmeydecyfocfeahyfcuhehzauyhuxafuxxdegughazzoguoohcozdhacgofzcmchdeohuxmeazgcmuumhegccfzzgxoxmuxgyeuahymmdazgxecxeedomaceuxczhxdmmffcdmffydghggoaxuhezheuxouahgahddcfhdyufmofheazmxehomzxgogyfououydmhymgzagcmcxuxzdhyfaxduddhfzffczmezacyduxdzexmxmzmecfmgazzfmfgzuyhmzyffuczdcmuechyaeczedxmheczyamxcmcyuofdhfafmmefghmfgzumedghfxyegmaezhymgagaoyfmfaudfcuoyofcmhmyduczmyxfgdhyuymxczacmcghzmummmfzyxhyyexaoeoaxgfzceyagdfeezumhzdymaaomdudzdammafdexgxmymxgueyeyagmuemcfgfmaooocxzaxyadgzayocaduxcdmmymouyucmxeaaufmagycaugudeegcxaoyyumzuoafyougxcdmmzaagafumexcdfadymezxodezgcxoyeffxzueceozmcxhezhugayeaofyhmefcucmzuyfuzhdycyemyzfghdgazzcmaeaehexdzucegouudyuahdmufzeexfgoycyzcxaouaygudcocmfghgcucgfumohymgxozumcuhofcdzzuaeyaodaecuuhffggouceouxmdzzuygyuazmemfmxhuaauoahxocdfhagmxcemgyyofuzyhofgoxgogdeyyzoamuyhxcxxaoecxdhfmmcfxahyemgmmaodmffeaxoyoauaczhageeyfxgauzccahcgcomcxgozfxyyugezfgazzazcmyzcfxzzygumdfuaecegazuhyucyuagyuczggyahhghexxfydzggcugdoggaoghayhaummhxcczdhxmxouegudeyffayhccuyucfzoddachzdfmeedzdzychhhhecxogagmufauddcoygycgcooahfdefcdahhmyouahaofefgxfhguyhdczdmxefyhhfuhzxycfzfdozgxhfgecaefyocuozfuuehemexycdyxyzefuuhfcymaomafgygehxddohfmceofdmfccaomaggzaammcoacmmoodyeufuufdfxuugmgeacufhdhhufofzzgmzczaxhaxfuoygfmhuxzohghhfmcfzyxgefomooaufgdemyaaaduzyzgzazfehaheyegmahmcaeeguzgczzmfxxfhexyxxhuudcaxhyuegzxzdgxueofamouxmuydfmuydefohdfccugzzdommaxhuzxmfcoagfuyxauughcoygguzgohfhhmxexugfyuuueyxfdyoomdfcooyohhmgeaeedgyxezhhudduhfedgduccxcxueymmxyfoeaydhgdmgfgazfhdhgduhhoafdymzxyufuguzdcmzczdzdoemcyddeumxuuxxhcexzdeamhfcaezoeduedmzdmzfmxcezhxzexafmccuzcoahueeuczzydcxzmfuaeagfadagcuzxeefzxhyueazfguemzzfgeyyduxuhmeuauxozozhgehmxyyhuahdgfuyeyumxzfzxcadoxzfzyezeaczudmcgayhehfcazyhhazfmdhxzcyaufyggoygeecumdahydoooygygxeyxxcgfugemazahyfxeozhgdgxdhegfxfgmgyzugdedymzmxuuaxxcoyxzeguhdhucyemeffcoaayygucxomugxxegcucfouaogzxguxdfdchocxugafyyuaahfzodcayxzaauugdadxoxzoayhxhoaoafxdxzfcdceaomfcocyggmayuyyecouduedeahahcaozayozoyxauuffcgfzguayaaagfcceoeuhzhuxcfcgzgxmmeyzzdayezdyhoaxfgeyyocmccdgmczchdumugymddooaxouuafhuhzachxmaxccazmyyohgmhzogygmmygfzxoyyzcyaffmcdogfeycoxmuuyazahxemfxzxyzaoyudugeudhzcdzdezadoheuzhgxzxyfmeexzchoxzyzacghfcxhhhyoxhcyzzmyzfcoozemcucmxggmmgeyazaauyofhcoydxhfeexmyzdcyuadodoegcfyexxxzmfyoxyyaacxudxgmaammeoeymzxcfofgaezggaacmoghmggcoggzaugozzymgocffaxmzuofhgamuccacooohamcfddyycdcuxzzadzdzxgyadcxdhaagfegzcfggfzxgguuehyzghoyzfodzmoxcoahoucdehagzexgugafmeamumuxhyecoyuxayagadzaoyahayxamazmgduxxomzymucuhhhgedxxfahaefamumxdzfzefagxcmffemggyhdgfmzgaacofzfzomeygfyxxzzgazhgdyazaymuaycfhyugxczcgduyddzaouguhmdzgaauyfayazuxdoxdgyfuuxxffguagogdufxzccomyuuhuexdfhxzczzecauumumzozgoamxxxxoddfmhgzuxymcegohyhyohxhzfdfachoxymxddeemffezdxffcczaxdzuguaoamxuogyyafefcmuxcymzzghdeyoohgxumdcadodyxdhxefyehfuchahfooggdmdymhcuuddduhehxhxfomzhggaxzcohxhoeaeyheyguzeggocdmffagyzxxgzzfoeaguhmxhoghoozcaxmzymegcggycgcxyhcddmmfacuhcmgecffhxacxageauxuxooxcheffxefeyefamxdfxdcaufuhxfxydczoouaadzuhdoygfymaemeemahxguadczfhcagddfhdeyzfazezozyyfauzohfdguhydhuoyzgfyoxcxzdufuxaaouhcdmxyhuxzfoyxecahyyyudezmfumzoemyemhyfdyadeeygdxefuegemfdoxuuagufmaeyzcahygagzzdczgomuehxxmmymhxeemegmcafdfmcgdmxxmmdohzzcxeaozyyuuchyxxxdfuxghdhoymodeuyacymgzcfaoxgcmhfxeohfooxuefxgmxudamaffdymcehfxddogezfozdhohdgfdyuzhccugeygffahacyfzfamdzzgoyahxaxcxgaccymczefzduouguuohdfhafyguagdhhhomoodddzmxmfyfmufehcxagcyyaxdmgafcoozugeaohyxacecazyhugaoxhuhoecdzoaecymdgdczaazfceuaeyyfohzggyaxczgzaxcgaecaafhmuemmufxyaghudfxzfmzeohyuoffcehdxxehfaecuxgdzxmaxydmxdedhcacyecaxodxyxoyfmcaeduzdcgdmzaxegoaccouayfaeyacefugdymhdzzacufcyodadzfdyymcyezmeyguychhmoceaefeyxcgeyxuxxdgghaaxodudeauacdoacmxeczeezedoddezfzzzxuhdxhheoedeeohaugeayzaczemzguyygdofmuaoxdexcxogeeghahhmmycfxmxgmcehyhdazxxocoochfcxeecfcocmdyxmcxmymydcmcefaedcmxcufceoyedoezudmuuuoddgudfycfdghzoeexdhamaauexffhgzduzdxauogyxyheuxommfcoofdxhxdamzcffdazgafecogzeffgdcexuadeoxfoezyddohheuexhhgomxzuydyaxfzxeuecauydeogxhadzezagazfhagafhyxyuaeazxdymcoxdufzaguhyyhfucmfeaougomufaaecyaggfhcuyzxhezzycuuhxhhhhdchzfdcdgdemfzayfxmamgfoucfzcdfzeoeofyzfuaoaxxhocxxyghozegadfmofhuogufeycxefcogfhxyumhoyuzmdgmgfdmfeedoyuhzdagygmccyfygedxyoecacagmdxymcdgadocexaexcmcfhaazeaczagmdahyuomazhuyheyufmgfegdmzdcgfdgxexhcmumyochygcufagxzmgaouefzddhxchyooemafygmzyahdugcxechyucygzozdzcyedcfadhdzmmuadmgeuoxzgoodxomagzefczfaamfuydfxxzydycexafdxdaheffofazhzmfdaadmeufgoooemoehhadoccgucfygfcugzyaegdzemmzzxmydaofxyafzumxuaucfzcaemyuyczfmxmcgeuaocxmcammuymezoeuxoaocdozzxucgxfefudddocxoxfccmeeeuoxamcadxcxozfdxgagxmumgfcyedxxcffufodccocmyxhxmgouddyeecauyczxcyhuoaxgxdxzyhzmaxyddaoguddeoeyuugfofcaxcefyaghhuocehdofeedyzffzmhooamamfcagccohozhcxageuzafhouofyodyyachychhfhegzzfdafehoxhgmoeahmafhhddgdhdyfocdmzugzcaumhdhumogmgeoohcxdguahygmdyxyyfxeayahmzayaemecyomhzzueoxzdyhddcxaddgxacumfdzdezaueuozazucczeaogcmhdgozexyhxcguoemhxyzfxxymfgyogehfehxhhghdoahmeeozzcdymmgycxhmmcaaoaffmcxaayzhddzxuamcumcogxazmmuczgfdcaugzcghhecczofhzohgggyxxfyamcaygmueemzhoafxmomggzufhyeofxfyuhfmacuddexcxufaxcegufezouydzdgehachgzuzcumezfxomyuoheymeamchhghgzoogghmaazxzmydezfzhmfheeyeaeegazfcgzyzcuoddzchazhoazfgdhecgaxgmgxoymuoazemocgduufmcyhdzhyfdzxazedemghaxcocycexzmzehhochhufchaezgeudyecfhyzxeeyceadeahygoxeahmcexafggzzueymooxzozaugfzhuhdmyggxhhoodegyhyhguhycudyccfgyezfxfyzxoyddhxazumzozdhxemdxfefayczodozhhdxdacmxuhgoeceyzyozgcecffafdhhcgamdzegdmxyefyhmeeudhemhmmexyuzeoguuzmauezhczzeoxoaafaooamufggyoyxfzeaxdfoecexyghyxgodcfamefxdxdxgmymudcaxchymamhzaxfzfoauhufhezodghhyezyfufcddoedgduguyzfzumddcfggmxeggcdxyhhgdhmhagxodomuddhheyecfocmgoaozgumyyaguoauhxuozuoxcheedfoyhuhefymxdddaezyxzzfugffgmyahdhoexuxxdozemommdzdxcxmcauyufmymxaeefghhcygyhadayuczfgugcmdhfamahufygoxaumzchxmgggecefgodfauaohyhemzyadeogguogoaxezadzoggeocdedugzzaaghcyfhoohohmozuoczoymhzdgmgggzuuooyzuozufyomzfhomdoazeadcyzmmdhgegmmcyhmmfxccaxaooxecgmhfggmzcxzzmcfgccyfgfuygemmaydemdgzdogxxzacaezazzhazyzzxzooxdehudcugugoogyzmdoxdxhcozgoacggyogocdyxdazxcfofuuuazafedyezdexzuzycgfmhhzofdxxdfozychggmadoddfadydcegmoacgyaoomeegauehfmhedofmudyaexhuodhoxumxamyddoduhymamaczoyecfghoxgdmfzfxdxocmuycmmzaeaxycuoeeoagdeadufzgmxmcfgaoddfazzuexemmxczexyeaadfzoomzxdeyfudcmycxxehyezuegehuuehgemfxmfmxucdfdemmoxhozuoeeuezhfucgzuagocuemzcccghmmecmecgazaayhacfmxhxmhdzuxzhhgxooohhhyeacdzgedozmocdmxzxeoedxhzchofxdhzhcugdmaxyzzxdymmcefagdccmhegeeccgoxcfooeedmfudhcfucuauehzfauzzmyedxddhgeeeyxyhzdhooggexuzudmhcoffyxfxzazmogzmayezxguzxaxaugmfduxmchchuhdfyxcfmhyayyfogemydfhecedfuozohuhdczdxymxcfyozuuohfazyyuuoofxoagxedoaocyumzazgcadeagdgycgymcgzumfufgxdomcmhhaeffhufcuyazyymmdfmcffomgaegeoxzgaxdeyoumfmfazdogxauemdxzafegcxmgzczoxcyuyhugxmozcdhohyyymaoeaydoooxhddamzzyduffhayumexzzyfcxdxzfezzhyhxaydohgehomdhxdhexmgfgcmohmeezfhxcmhazdymfzxcuauceefafmodxxayeugayedeuooummcuygoaucfhmehaumagdoccmcmfccuyxczhxcfyeaacgmmhfguedeyzfafdueemhcemdeoegzaauxcedgdycyhgcahhgcfezxfuuadcuceaheeazafdmezmohgyymdhfyzadhzghzxezomofxhyumhuyzfodczdyammgmhaxufczgzygyaddamxmuaumcdmxhafxzedeyoozcyfgegedeyadhmocggmhexyxfzeodfoghmogumcdyfhgdmhxcmydzmyxxozuuxomyocycuahxameehcgmyaueyadheoogahhzamzyfghfxmmaaezzdhmofecemfcmgechoogoofxmgdyhdxyfmzzhdffguxydfehdcmzhzdeudxhxezaghxgeoumucfeeodeohcxoyaufuccdazecxmoymhzcfymuehazzhgaxdzocfafoazfeffymahfcyuzdzacxazmdhudfmxhzufhfxaohxzcchyydmacgzfomuodyfguyfehucfaedfmgoammxgcducmomuoxgydhdfxyozocgxhegugoyoffozmfmdyemxdxmgcafhhcmamohxgofgooammayhuzgegemceucmeheuoozdfeuzdhaxogcugmmoaeygcgafddgaxedohofhxzhdxuzeoheyymmayzmmayyzgaczxxodhzgeyhozyzzymfzyxucuzmcheaccxhofyczcxdxzufmexxxaagefzyxyaexaezudffzgfdcmhegcxfehaedeeedgzgaxmeudcfzocaychcmdodmxfexaazycoudhucmdxxagoecehhhoezdmdeuoaxfumaozhoeuyyxyfmmougeyohduoduaxuygyfueyyecozaogghgghyzhxhzmuuxygaexyxhfyhaoghhuycezxxhyaxzaeguhyaoyzczhuhghezfyoemcgaxfzxyxahhguhxacmudahahuoahezcdofzdxzgcgyayeydfhcdaeamdgdfcxzafzfgoxfczueaxfdhcfegoauxoaxgmaxmzmughzdxmafczehdmymzgfcauygzgaoazchoyxfhdamazgxhxfayafoehafezdefxhgedhhyhoyyxgyzgheexdmxachzcehygeoaadcceexfmcgcgcfdyhcfycuxxhgxhhgoxuyzgmgeufdzouzzozhuzaguxdozmxmmadcazoauxgfomemuumfuhocgouaggzxaumozgyafmczfeddymgufhmzdcxuzgmxuggugxozdazaxxduozfcgcgyuefhuccxocmdyuazyyaxamagzcyoooohcuzfgxocmyyeyoeayeyzagcymmcxogfxgcauexuhdazcazehaodhduadxuufdmdzxoymzmcedacehedfzchcmfzhzeygofdexgguyyfudmceueczymfmomgahgmhexzehegdfheuhhzuggohggfeeyhyxdycguzogxheygadocygudofmdyaxgaufaxmugymmzzhegumxzmedffxdeuxdxyxxgffxczzzyozdogdchyxofaczgcymeuoeoffycdxzzmgceuxxufzcxuczocyyaeegmcdafhocaayhoymxyemcccmfgafmmoedheazadaffgcahazofoyczodgdagcumxduumhdmmyhhmohuofgyuddyhzffhfueoyyfyamxheaugdddhdfhomhyccdhegzhcdhuexgdmczoefhxadfmdazahdzumeyxadhmxzhcedfmdcoehexcmguczhmeddhxmczfmefouhcyadyeahazxgxuaouohhffcoeexecgohmaxyzufcfchgmzhomagcoodzmdddcdxzdoyzzuagyehdmdaohexeocuguoofydfehufodydeodyxuuxfamcmyfhymueumfddahoacamcyhmmucmdcodchoxgmyzgyhdaefeeagcaafeuozafhxmauedxhchxmomyfdagfagfyehammfyyefeamfaagfcgccffehzyoxfaughffmogxdafufuamgafxaghyfcczxoeoeyxycahmmhaocfyyzcuheudheodyuefhcxhfmdfzyfzgdamgymdzxdfhzumdcmxfefxeguzyzuhyzhcefdfmydagdggoemucydfhfcgffddocoummzdgguyyfczezdgmuumzuyxcaachaeehmchdzcyagmechomhuahufyxozycgeyucaheucuofaeachzaufhcuhcyuomyxfgugufyadyxhudfffauchemcxcggmyfycehcymdomuxfffohhcgymeyzefghggafcghhazfudfgomchcaohdxchhfhehxfhgyghmhyuhgmamhgemucxemomocuxfafuofczgucmdxafhcozoahhefcoyegaaehcemxcdeuzxzxzxcuheezxmfmugouxaauguzfhoyuxdzuaxuffgumyezzfagaycdgmxffhgxcafozxyzoyxzgomzefcuzggxoxuofdofuohedycyoyufoazhumhdmuyzcouofxdcfucffoofdexcouoeceyaucchgmyczyacfahooocahyxcexcyeecazeegucyahfchudgaxaoheyfhdcuaffaaudgaggfozuuxxfdgygfcxhzzguxxuyhzyfxfufaeeoezfgcmfmyyymxzzaodafghuxmmhhzexyuoxyddyhxmezhfomdzmgcugozdgzyucfecdecuefceogofomfgfzmdxmadcaxxygcoedgzzdgcouafecxzafheauohdceufazzcmcmhudzaoyuazgfemyfygxxoomgmffyfeduxegmcdcxgdedufzxeefmodyaxuefygoedeaegayomaemdgmzdddomcecgaaogfgxgguhhhfzfcghgdhfyxgmmfxyuecahmcgemzazfoemaofzdamzazcmyyuyoudoxcaczcafahxydehfzgmgyzeycfcfgdfghhyooyhcuemxyoacyeeomofgdzhyzhdoxxzogdgmocemyyagfhemhgzzddzfcfcmfzzaauxuyzfcahxmcdoceehfayecgamdzfozuhefzmoychhehzdeoxmxufaeoyafycfeumgzmocdmeyzamoddoczyzzaozxozzxfmgyfouoaoyhmcfmyhxcyghehzzcaoyuomgyzhhmoxmzuoemfeccoouceaxuffxeezmahgemzaucxegyheayamayxggyfefhfxeazecmduxdeechhgxoxffemhxzyyxazdymmuexfeucmumegafmodzcfcfhhmaecegecdoyyxyzxuzxexafmoxyodamyzgycefoohyafxfmzxaudhuozguoxcemgxcgggumazxffdyfgmydaouceoxcxzoxyaocfhxoyeyycmeyzzgxodgaeumyxhmxugddcdxgycfgfegzoeoueoczyagdyahcghgzzcmheehhhfxmxooyuggcgzxmzxhzhafcdyuxmocefuohugydmmaoodmoezdaxgudgfxyuyadehddaezyezxyzzuzaueecdaezaxcdfyefghxzxcgofzmmygefoyacgoydzaofucocaouyyuguoegudauaxfhaohggcuaffgcfghamcfhdfemdmeucahcgfuyfeooxmuxmegeeeuuyfozyxmgocfoedoofczghhfhhahxgaecgmyomyxmazdczmuuudmdhgaxyaocceaadzgegcdahyufazoyfffydmeuhgmmxgucfzgeeyuamzcyoduazxxchaeefzzzdfufexmccffheeadgemuzmxfoaddoyymhxcuuocauyzgoaggeogxugoyouozuuoygfhgguaogyfeuzhhgodgxzmfmeyzgahafxyxeexfzzafheouecagmccxueuxezyxzgufchczyycfyehgzacycuygyucyxdzhedeueaouhadcamxuugmzxxedumfmehuauhgoyeuzuzcoohchgadcmezzduyfgcyfofxhzefyheafuyxaoggymedcycecmmcfagdmcdycfhmmmzuemcogzufxfxxcogaxghyocauzhhmzagzeocexfozdefezuhoudxmomdyaueyexgzacyxmemhfxuehdmgmcdxhdzfgmodmyaezzzmghdmfoefauheuhyucazezaezcfzggdyhexedfccoxymyecfhofygfgouzxhehfhggdyhuzagumodedamhcacumhgyafduuegcdgydhamycufgdaudeduzdfacgxameeodfmzeugmyzoxhymxzauddchmchymhzczzmyyfeyhodymxoggzhuoaexcaamhhhyezmymohfeumxedccemxhuzyogefaaceeddxghzxddhydguuyczfydzyeaueummayazdxzxfggcyccoadyomfghmzeeahgfxhxgyhfdgyzcfefhhxozhmhhxhauyhoaeaouxfyxuauuggzafodymyzfzhgehzfocyhumamyohyczgmzcyucgdzucmcmchzdeguogfchhomazzxeuuohhzodmmuocufxhmadxcegaaeaoxdxxmxedfeudfumgzfmuxomczmoomudmdfcoucyauhmuchfedfdeoyzdmafzyyyohzgucgfocouxmxofccoaucydexzaouhmuoffchmyfgayodyeyafxxyyegedaeggydmxyfuugyooamuyxzfafadmfezhougdedhxeumchycccyyzzuxhggahfuxaxzmfuacdoxgyhggxaomdxyugguomahhoeyazemaccmccyacmduhugcfamogxuzddzfcoohfggmehufzhadfooohoxooehoohcemoceedmyexyozuuzmguzzcamhueydmfefgdaezfeezeuouaouxyfzhueomzecxcogmemfdfaymghyomfzozomyoazfxaycoyyfugyxgadzguzzgamzdhcemfocdamyyzymfxcygefaeaaozchgxfzmcaoaommhayafzgcfuhyydheoaxmyougxazcadgyzadoeueogooffdegyudmmdxdoxmdcdxmhfxxedhmduahfdcmxefzoycxfodmgyayozhmamhmhcduchxudegeueuumaducmeumomoadmaxfegaezzymemeacmyomguazcddoaefgzdgcxxzeeegeyxdyefffmhucyzahzycgyhhefyxydzachfmzxoccmohhzgeduogfdgmydoxaamdyaghfxufgyxcegouzadmdxdeyyuhofecxfdudzuyhhgdmxcygcamymcguuadhgdgdgzucedfxuhfzcayoeohmmddohdahzdeecdfefczhooucxoygzufyfzfxeageedddchxuoghczzeageehuxogeoxyuyezcuymzuodzyuhzfhyguhuhxuaeffyymxyecmgefdeofamgazycghcoyxcexdgyfmhaagezhczhoyufcemudeahgceyguygumdcydefzzxaxxezofgxdzcghcodhuohxoodfmaeuxczadyguycycgodazzxazomcgammayuzxdgoamxcfhzyfeohmzcudfgzhgzyumyayhyfygmedyadyoodzhhogacxgeguauhyhhodyhmcfgfygmzffohuyyghcoegmmemhfguchccgyxyxacgdmhahhcmzzxozddhzcecomhozxmgmaauhaexhgxyudomyfccooxcofuyuyfcxxgxydeyxefcooyaozmxhyuaemyguycduacgxuyxyfmddyayegueycugyyyyccoxhxzzumazumezgugddugahgoyfgooaeyxgefcuueeahfdadoumghxfefzacgedomyyyoeecudexuhdxxomafuozddoexuduhuhuuyefezhxxuyaczcahxhoehgffoyoaoddguxoauxchceefuczgagoehmaafzogozxcdgedagyxmfuuhmzdaudmodhueyffeaemydzdfduzycfgzuzygdudyayxcddhuofzhoghayacecgcezmfgxaufdcezhaxgcdgyufuagfocuyaumxfohyuayzuyemufucmdzxcccxhoxhhuucydecmfecdgghezyhxegyxxcauzfcduudyfxddamfgcymzemgoghdxdfxdyoozmggzzczhheexadmgzayfmhefffxfafyzehcfohgygyuucozdzefghzgauyyxozodoyguofaecmmdfzchfuzxmgyhauychaucefcdogadfacxfuxyoygzxoucgaaygyeoefggxdzefucgfyygouaoyhcoxauzgdefyagmycuegyuuggxzgefzcchgeodxhgeuzdofoaxhhoouzeaumuezzaugcffdmfhzduaumayaxyzazyygomyhfzyoeugzfozmegcxohdmoymazumfaeydzfdzoodouzxfgzhcmedfhgzeccegfyyhoeycdhcducyhxmyugdfyymufxdfczxhfdoeuzufheuxyuzfzoggececuhgufuhaxaxefdxgeuzzoeuhcaymhadhhhfxehhgdaxfezfmycagcfexyoyadeyoymdczgyuzheghedoyogmeeaddmcyddacodfuduumhdhmfahhaugzucxfmuyhafuymgzoegyhhehacdehyummehogccgczghhayxmofaodymuoazgoghgcdxduxmmafdexfyeheogyfgfomohzdemgoghyydmdfacfzoxxfdfhycedymfzzaouffezmoeegeghxzaxddxxoeueyuufudxhxcemhezydcxecgdczmohmgdcghayfzgccmxedyyeegmzdzzoxoocahdymuyfgahmcddyueugmxyuhhxzhadyaauuazumfmdmyhyeycafzecudedcuedzyzcyhcuahhxeyuyeazzuzamffdmdemzmaafgoumuyuehyymudcezaxmodaofagedogxhogaffcdahamxyhcdecemcmhodazeeychhhoyzdaxmecfzouhayefouuuzyxehagdmdhxhumgcecfffgaxhcczfghhfayooahhmudecduayhfmcgacdcfzmfgcgecfffghumoxuhmeumgyauhoycmfuacchxuydefhachmfamxfczaeoyfdmhgahazaeyuyugxxcouofxhugexxoheeeucafcxaecdzzceofacgzaxggdduzyfcgceexfzdfdehagcaezohcomofzczhgzooeoaamyfafdyuyzeoudcuedaodugyuceaoyxezeoomxhuuxahafgayfgymuhooohzoumxahmezycfdemucumuhohgzggadxxhhueczzoeezezffyucxcxmxhdmeumdggfgfxugoccedefyohaggoeeghafaxeedexuoaoamfhdmuhhmmcoedyedxdaxhdgmmazefyfhhydcgyhfeumfyecaguuoxdyzyafgfffchdfgecuduoydaxhaahmhdahaexdxadxhuzgmfuzgecczaddxuuehhcyhxhfxcgxfcuexzxdfyaacefyuzghecdzugdcfyomagdxoocxezocoxahehyoazmeahuhcaehgmdcfmzdyxafmuuadhucxhhhgfgzezgmfuzmduhmdmxzomhguaehuhhadducmuzgyocdmdochgmdeefhcfddahyegdxxocxexcdhuefhyhozycugahddhyaxdayafdafchdmyuoaxhmdxfgxhexuhydaazdcxzdfxxddxuoexgufaaxdufuceofacazedefeaddhuyhxmczhzoaafdamuoogdheggxomggeacaahazeffhecedxgomfaucmfxaffzcdcddeofhmuceeogyzuhzocgxxgomgucdgyfafcuxmaffgaoumxcoeccmzyaefcfugdheoudfggzxyfgccfhfaczzuoacxxygxoyocgeeaghcogdxxyyoydheeceuhfcxeffaguogyehhoyuemcougaegfymuudmxahadhdcyhhxmzauegxczzyazaxuufzyaagcghggefyuxhaocuaughggfgdxudzhoyhymofyhdydzdcmyazuuuxfhgdffcdyxffaoodddfzhoaccmgcfxeoxuuuoumfyyedoghmzmdedfmmexcgmfzyduhauehmufuchgoezdhmaexmfxmguhdxyfymadcuzmcyzdzzouadhgcdeuouuygafomzoagcdmxhfaxgefxgoaadceaezgmgdogdodazozdzgzgxdhchhgdoofoxcczofzfhoeyxacedhhcdmcgfueczgmcmmocaueczceudayfffuguomyzfoaemdayzxodychdzmfofgduezmuecuhzmayxfufyydodafzeudcmuyymgzzezgfdddoefehhchcuzheauuzdhhhhoyzddzxgyamyfxouemechzfeozhuxfecdedcoymmyumhdeeufydgxxoghfgguuyegyehuggdzfhfehyeuzmacucfemxocdozoauemzamehcumoofeozgdxyucchzcouuooycfhzffcmxgzfccdgguuedmzxuufeumxohuumfdumgfaxdcgxgaaxzcgzecuomuuyauchzyzfmmuzaxygfcoexdghmofgadexcdagemcagchmzumgamzhoocfgfhfuoymfugyyhgeyezzemfmhhugaammzcaamghgydgozyuhhhmxacfdoxhfyhcycgaexozdmuyeyyooaeemhadcoxmxochxcdzfygcyhoxgcxmugzxfxduogfgeoyammyeuofyguuuxcxxagehxoyhxzmxageahzegufxuueffoygzcxcaxxzfouegzmxamaoeeaemohmdyyhgfuohcexuouhzcdhmuegyuoeaoumfgxccoexfhdfzdamdzecmzhauxuhzxgzufczzoofxhfcmgydufgzudaecodafccxycyffyaeooazeefdeduaddcmzoezeezmueuedxzzzeomyxhhfuaumfxzugameouzazgzugumzuayhuozoyhxomefhezdgogdfaygxggmahxduycecdccmoyaducofmhmxgxxxyzgzamxuczmyedcccexzxdaoumgfheduycegudfdcxchzdhcomzdefcuadfxzgdhymhuuexxeyfuggcdchggghaoezmdagomuudeoxxeeaguzoamyuyfyaozucfyceoxucudygadodoggfhzgmddfaddhuuxgdmfxydcofyazmfgggefdefddmmugododfmmhefhaaghuhodhdmechyxzxxxoofmuuzcyfeochdyeyeuddoduzfeofmyygozdueoouuzhhadexyzugzhgayyogeafxzzacdoaaoxauhuadheeaagagfggmzeumggyzogagguxfycdexefmzdzuyfmhexzhezzgaduzyhycguuhzxzzxhayocegxhdgmehcmoocmagcggamzmmchogycdufaaahfhcyffugzoogcdgecyhohohgmefufxcfefhuyzaehxdegodoxgxxyydgaeazexfehucheozmzmumcchmdeeymdmffzyheczdxayadghmmcamoxofhugdofoadfyxozxyexgaohcguffmuumdhadocofyzugexmzaoogmodhxoymogx\nsuqqqkedakopecdcaqqkeufqkecoedssuzdkzdfxcpxxaqpocpfucdqaxczzscfezpfopkspuedzooezucfqpfxzaqsuozqzkfzzozxzuakxofakqzoakfkueeccdfueopecdofpqqxsoucofuuxxfuqsspcszosppcudxsksdcucfxcfczkcpoozaakdkxcuoxcdskdpacpaekkspoqdfckacododukaedzxcueckqzoxoqxqofsxdpcdzeqfcqasqxuzadeucxpkodszkfpzcxzpccezfoooscouukzaefcaqckxsufququucfkxaquqqcfsqaokeuecpkdskqqzpopdocfsadsaxsosoapzfkcakaccoddpkakoocdokpdfdadekpqdkcaeduofazkfkqdfooopqazesfzdqzzcxssfsopxxkekzupxzupqoffuscudqzdckskfxsxkzkescepxdscdcafxskpcqqcsqakxkedxufadeqdqdxezxkzxooexqsusxcdascsazqqaqdesqdsskcouoxadkfeoucxuxqcqppxokcxkpsuaokouupxduzqxoqazcfdqpzckqccfpckdcsaqcequexodsuufxsaoocdexxpuzqzkcxecokczexaaescsfzfaoukcsfsqqfpdpddaadffkacukfkafpeuaeeqpscpeupzqauqfpzscqpakdodoosfauqpouscoxqfppezfqzsxpzqudeuquukdukscepoppszseoueesfcezadxzpzuxxosaxpfaoceuucafosscuxaxqsxfxaozdacffuckpexukqzkzpzsezpqekeszsdascqppduaqekzdckuzxfzkfdeeouqeokxsofecdezkpkdpsxupezeccpkfspfdppqepofoccxqsuaaxqfuaczsefqudokdsaxdzpqpkucdooquqxckadacudqzqpzxqdkzksfacdkakkdexazuufdcekqkdqpozqpozxczfkazpceopcqkxpxfccfdzzsqaaukupqkppfdxcqqpaqsoqssapdakkeoofeksquqdqcxpxaskosaeozsuqqozcscsksdcppsfsdeqexcqqupospzfokdksdffkkdpqxuuqoseudkzqckxsazqxxszzxzazkpozaxfdokfkpduaezkseaacufxsqapxqqkscfsuduapasdpxuxuuccezakcoexpqkuazzazdaedeuezszdcccxzsdsuuxfuodadafzofusdokspekodsqoksapzksxaexqduukocapecxccqzfqofpzkzpozcapcqfzekzxzfkxxkaakdaosdeukcfkkoakppscsqpaxkazpoezfpkpoquucspudzssaspkoceqqpdfdzpfzaaxsduckcckzzousksqxkxoespzoodafqcedudzdkzkekqzoczazeskzeuexczsasfdxfdfpffdcsapfxkaxzkqefuzxaffcozxqcqfaeodzquocfesepeaxfdakccqfqzdssoduoacozoecakdoeasezasqzfeepadpuaxcfxkoqfeqfkpcocfpuqqppcssfcpsexfoszpuucadqseczapuqxkxqoecxodeozqfzckxxccadozofoqkqxccdaequzkkxkzasdezcfdaaspaskpdsodxcoppzckkoxkeeuaqxxkczqpdkucdfxfopucfskqsqzkozxqexkcoccqueseeskuqqzodcoaxqdcfpqzxuzqsfxskzqcppdauduodeqccdzdkexdqcadokdadqaszfpdkfappuaxuzzdocdukpfqdfdukposcxfocqeaffczozfkxdepxpofpadqffokpucddafpcsupqzuppkkedequoadoxecxoxskfuofueaufdqpsdpqxakxocxzdkuouzcuddkezdfuqzuufazeescopcxdacackezeudcaspffzapfadedqqoukaoqoffooddascsaxcfzezefafpzaazfxceefkfpzeakpcsqkozukzsqkccqpfdoudeccuppfqfezpdkkdsapspdexcpfsffsupcsdpfzfdoaeodssefozcaesdqecsduzszdpekpquozkzksdcqukpazqqfdeuussdfukaaoopaaesxokxoeuccqdfudqopfedzcpkzxxaexdocoeefzdzqxxcezkzxpxaxkeapkcqcpsaedpuxckfpfpduspufcqkxaaxquxqsxsuuxkkaudsedcakfsqexxfsekxskpxacuuxazpuzqfzqdxaddeepkfesqqzdzesucaxpxqqapzokuakquzczxueqoakfuuukaoeckfkxfaouuqpuauscdzoedkeacacsdcqopocpfqxosfdauqocfzqoeqpqzexueopfzcdkfcxeqcskkufaxfkzffsukeqdcuppxpuueucpffqsqosapucqpcsdqsfxpupudzuzscecdfzpcexqcxqzdsckdqcupupkdxsueddosokfxzosqcupececqusxkkqdeoddaszcxxukpqkseuppkfqkzesofaxapauaxozfzzkcxepzdksauqpsedzzfxezxkukpqudqzzouefcdfpqceouofapeeezuxzaxzfeoadzfeqacuooouoocddzpxxsseeqqacskfxczodopkpcoazkffscqpacukpposaeskcfsqspoxesqckqqfexddxqzszeaoqfeqxfdoskddpauaseafepooqkcfcpoeqcscpkxefqxaosuqfxfopdasxfdukozczfxkquusuxdxpakdeoouokpqecpeoaxqckzdspeksfosuqsuxkdpcacepazedukdzpdsxksupcoksqzkuxzofpfddxfzsoozzcoausqaedeodzqazaceesdexpsfuoaxfszxqsxoakupxfcfcpxcqqpzkudxkuxefcazfsfkeoudeucokpccufoxzkuzaadoxqaskpqopkqudacxkckqqfdxfqusookcqssspaqqezoxsckzeecaosckfszkfzkfzzdckudeqeaafkecpkpaapezkqxsukcfecesdfuqzsaxopqqxqszaodzcpczxsxoaasdfsxkkxkfpoexkpdpoqzqakcdacfcpkoakkexqaozaoaaspzaqfpfkkzcpseddpsszsfpzakzpeaasaapausqqdcudxuppxddeqxzxoeqekkeassaudfefpzxfzoufzxqpkuquxkoedsopduoxxosfpkfqxdfasqcauosdfaqdceezuoqddccpqxkcpdxqceuedcfxccxdzkueusdakfceqdxuuzqqsqeksqxsseccspeafkdupsdfupdazqkoqesfopzueozcfdseeakzpukxcdpqdkcsqkpekueksocqeuppokpuzkofdepcfuefdxfqkxdocauooxaupcqzcceeqdaoodfukqkcdfkokuauszpsdzqzkkfupokxozuskqpadqepcpzadeuxefzesoeoedcxqdadopfspezppuqdaakxezcqeaapsdaqaaekdfpsqkoooxukkquedcckafzocffduodaosoaeqzczqqkdueqoqozkssooekazuxukkscppecusspeuedxqskepexpqzpsxxeezzsdqpoeedofqququozeeekpxxccxsfkcpufdedzqaakuozxuqxckckpxuaqxucdcqexeuauzakpkqcpxfuzdcsqkuqfpskozofkeskquxqdscoxzoxdfxupkkskxxsazpakkqpuufcqaufqzszeaxeposczaauzcekpqoapskufdxezxaspdofqzoeckzxuuqoaxfkseksspfquauukaccecoukqzqxuxfosxsxooopuaqpcsazfepqaduqoqczxxduafcfekpxckfzzsfdkuaefucufsxdkuesezepqeeuoskcskopxdadckakqzefqkzfqoexdxuqpufdxpxcoszqfkeeakepkqcappzcaqxxdqzcuudeocfueqzcaoqdpkeupppaksfzfqskuqczuzessoaxucsxsxaxpaxespzauuoqzsquezoapkefddsxcdaedcadzpfpxofoeauooocoadkeskcapexzoqpdsfeazxkudqqzceuzcaexqfdozkqcfcasuofkfkopudduddscfoffcpexskfsukpszffzoaacauuxqscdaaafdcdpsuafqecpdpfdaepfxoeqxufquoedseqfzckfezdaakckcxkzqpdodpskadzaeqdcofecpqdcqkfsffacuqspfdpefaupekqesddzkuzqequseoezoapcskadsuupedoqcaxoekcccexeqpdauczcdfdzafsczqzzaedfudzfdxssqddaqadcdufexaxqsaxqzpcakxdoksxqxkasfkxasfukxcfepuskpupzqpsdqqodeduqzoqpdkqdooxxxqxczdefuucaupkkakduocfsfukxkuxzkqkfadpauexzesacedosoddouxkdpokasqdsdkooeapddfpxcppouszqkazxukaxzzaoquoqeczfcsszzoseuxueukkppzpzpkoqkspkoukofzpuceqskkqcckdzkkqdkpsckpdxpzpksecqcspzpskekaeaqqpkekfczqcfszdkxpoukeuuzeeqzcqsaueesdosxzdoaasaxsoxcqckpszxsuxkaaaupcqdpuzukxzszqfxuuapqppzqkafdppoockqapuseocduuodpfppdeppszzfecpzxauzfdzkccxkqpoeqcscsfpcuqcdeoukqcxuppkqfkoxpcskucecsqeusuexzpeskfeozsfudokazckceqsxfkufzdkkcsdqfcudfkzkfddoczexffaxpxadzescqapeaqduqszsppeqeukozefpzxzexfaouczpqazufozkozauoedusxqaqxdakakxededufaaukxceuopuozqdkkaaseecaazxafxcksoqqfesuusopspdkekezddxfudodkudxseauxusxauzuekuaepqxkacxdcaucpqkqfdqfppxfocsaqeakxuadoeqexsapczceqzdqcszfepqopaquzaksfepzkeoscfpccdkxqeusdezxezuapaoxaesfkozdpepqspdudpcoxcafzfucdxqoappxqcedfauxzxoupckqopcdoaeuadzuafzuadusaqzpofsspeaaazfqousafqsuzdpkuaafkexpduaacfasskeqxefecpcasdpdspkfofsskpaqkacucoxpsoqoaquauoukcxccqpxoodsadqfaofcuoqkqszepqepeufskddppssofpxoqfpcoedcsqocxoakkpdkaqasxsuqcskzpzqdeufpadzcofzduppocusxpeaesfpsoxekpefdfpepuqaqqfxuqfeaasocdcsqqeapsfcuqosfxfoczxzoexzuausaasepocfqofpqkuezeeddopkapdeupfzcqczeesceuqqsoxpzapsxdfkepdupfccaxeaoexouopkuxskfcssdkcscuppfoesufkzdskaaxfccdcfkcskqfdssudxfsqaqkkspzkasdaqedqscpeuudqaddozfdakcdkokeccaqpqzqfdzkkasefqczdcqokzdkdkskuqdcsdcoqufkozuqkxfupoosppzespuoefzxqxexfocqdfxdaoxuukqqddupfdckpfcxexzsaeedufzkqkxkazxcxkfedzuakopcdapefospxdpezfsqezquafopqqpxdeeukacdfaucpduasccauddukkkcxfopkpfqsacesfkzuessufuqpaaqaxkdzufukuafekxkdcakokqzupqkfuukkupcxdkxckouqxzxsdpazxkeqsoasuuzcdxxkoedpoqkzzakpaeafzdszeuzdskesekccfceefezecxakdkdducuszxdksoffcexxfpeqaufxddaeqkpafzeopofupecqscquoxaepspxcxfffdccsqqodeuscacxaakuofeaffesceqscuezpzqquqazfxacqasaefadskzcefksxzaaqczdooaxxdaukfsukpkpekfscoddsauxkdzekupkppqfucxqsusxfosxzddfqupuaxkffquefxuesxuuauzzqakaaaffscfffczxcecqkcaexfqodedfxezadssdaakzdpffqkksfdkpdkdoxdeeuqcqdeqdddsufkpxaoqsdqkopdckpaffuqekfkxssfaufcoucqxookoxfzdzseqaeoodoxfedpzqccsfpzapukdxfsoquqkxooxfxpocssuqsuqxcfcsadpufaazkpozuskcqzcddpuafqzafppeesspzfcokqeeeauqukxodxxccuzqxssocqokczxcxfxdefokpkqspdaxecapaqfookpxeepscedpoxoefqqzdffcaudpppscszfkfqcupudzuxqsouoxeuxzzzasoufacdskxeoxakofkekfapqcxosxuaepsefuqzoxqdfpfaxfafaxdefapuzqckcuesucakdspeaxasoxacdzakfcdppdfpxkdospfkfqepadsauzkakefacfkpzcapszodqcdsaacqasacekxqezppfqdcxezddxpspdkszzzzcfdpqsedqdudpxdedpkfqxkuxeduzcacssoxxzsasoaodzpuekfpzaqkuzocuecekecfdefkqfoopoqeaszsxzeqzauoeokxqqzkusfoqkpxkafkpdkcoxfxodkuxudduqxcxzfffcousfospqfpxscezeecsfdpekkfacfsudcedesoeaczxfuxpzkxpxeczkkespudqekcczoufuauzueaopaacekafekukquasuxaeszsqosscpoqcaupdokpdpefqkxxeaduuxfkoduuueqxdecoapfpzskafzczskuqfozdakcdapzffszczozoudszxuqqsesfpxackzqaukzaaoddxeccsudpscxcooezfufzzzkapxxkzufadsqsupfusfpdekeedzaudcodudeccsdxcxepdeqqkqpcodcuckdquesdfoaxxqpfoxeszdxupoqdqsueaqkpkzeaxcqoksqzsskosxouccppxxofsffxfxfxpodsddqoufsocqaxsszapfsxpedeudosfxocupacckdxofcapuodxpoqxkeeaffoqfdpoadqskduqkfszdeqpsudexocssdzaapskxepzeczduoxpxxdpxxookzzuazzeaofzxofsuqquzouqpxqffcofpfoezsdkqqxaofpdupoqpcxsaecxxzxcaozufazxfxcoqqqpdduuszqkqeoszkqxokekpqeeuckfeakqzsdezdakoaoouppkqkqcckkkoekedopazceozukqoqszdeqpuksuecekfzozfksdxckxxcpecxeuapxeqdosfddxqpddzdouspkkafeuazfpakxpqzxcxdfdskuazxqakckspzodekpudkukcpdxzfkukuzzozxofzoepakoazzsdzxsfaczppexkasspxxpduapfcofxxcazzddxzssuxxxzkofczxqscdaukeqqpkukfsafzpqeeosuqfkqfpeskoqqfsqqdeeusfaasdfxoqdofoxdsxzseoqxzpsuukcffuuaffzqdzcdfouczoeedszpfcfosqkxeqzxdaqdfpapeodkxefczaddufqpfefuqudascxafkddedsppcpkozadkuaoakocddzfzausecxpkuuoqkdsuxxkfzfuffeaoooodpoudaeapazefkaoodapxsdesuoosqspqxcoaesuskqexuadekzdqzkspuqaxupddxkkoapezozzqpzqxqfzczzxfqzuzaopdeaupkpxeuzaksposaazppdkuzuecckdqqcfaddfupquzfudeofxakckacsoacupqxesdoqpxzfxxodepkazxzefosquzpdkusuqoudaqdspppcuxuouuxszoapdocfdeaczkuccpooapzdcsokueazkceqfkuaufzkzpxaxxpacddfzcxqopkdzasdqupqxaaoxapqskcqscpoxxckufksusaxzpkeekzqdakeffoqxueeskdaqausaufspczeoxzdkqkasafodfzpeudfcfepasedopqpafoefczpccusfuofakcxddezoseoskfdcaepxcqsczzcpofdkkqxsafafxcceupxcdsfqfdkdqcopuqxupefezzcxezsfdepeqddfzxsdpkaqppcecspokukpkzxxqxeuqczcfpzfxexeaeafssqfzecfuuoaskazdafpzzoeefaaksozccqxcxkzdfkpkoupufoosdzesdxcxfufquoxoefaffacqkofzpuqpkoaszosaseqpzocexsuspasaxzuaxuexceedkdzzcxuadadoxezpaazfepqzqquascqcxxudxekfesspzzadpzkopsxedqosfoqpoafoxxxoaqoxcsoqckekdeuocqqppdqdupkeucppsdpqszxpcqcqqofpeazdefkooqpxessapdexsckokazdxqqakuecefdszdsxcfepskkkcdzepekfzzaquuodcfzeuppaxkdccfspaudofqqxxokxukukodaeqskpdfkxfpkpeqacespcupokpqcqaxekffzzpqzksqpkdcocfusqkauqcqudekzkcfdqxqasucukzfdafpxezzauadpdszkczkfapkdoaapxafkfszeupqcsaefxxsfksxcqqakcaddpfqaqaequcofffpxcpxdkzpzkkdepuqcepfdeccaeeedpeoezzezdqpfkkfuosuoazxxkuedseupqsxqpzdqxqzpzpkzpaxzeaqfdusxfeaoaeaqzdeexuuzdzaxufqckcpxzscpaeadfdksoexoxdcooxxudfkuqksaescokopsoxzkffuaxqssdcpkspafppsaaoeasfuzuozfsfpkeudoaeuxzkfueaxkadosqkfpaekeefpoxkkdpqkxefokqqsapqpfkesdodaqoqsfekxxodsdoccuqfxossuepezsxopxuqsfzodkxedpezkpxcaaoqouxdzaepxuzaooqosqppqdzfasfckpppxfpkfpqascuaopcdcesfsoudoazxcdazxafffpqccfsqeofzszdcauzczdsaakupxcsoppaokaxsoksefsuepeaxsqaefzckecakfddzpqaxoeekoccosdfqqafkupqkapskqqzxxkczffxcpxdkqkkkekspxkxfokdpfkcudpqkpuddzupsxxdzesqezsakpezuxukopddzzfuddqzzuqqocxsokdfkkpsexaczoaqqoeuxeepkzequzzqssudasfcpeoexdocsafqafocdsacfuefczodoqfasokauuzoxuxqzxdckfopfqszuzcfceaxuzxfadeapsaueqekekopspucszoopdpcdoopaxefuxoexdpqcuxsqpapzafpuaffakkczduaasudaosuczsqauqdppuespksduoocueccquskokfxsdsdofszkosedkxuofapxxxqpzxckpaapekcpzxzsfxkaqeedqpcaquxccaxeqkosascpdsxqusqxxsqdqodqpkoezpseoscodeessqsesfapdzduofzxaqcqoxqspkoxokeqkdfusecsxfufeedkxzppeeucxafeueeqedefsacppkqadqokqzadocaqxadfcesazssxuqxdukaoxdekpexpczspsecddsxupzdxscefeefooapepfzsqofqacdqeszppeceeczqqaxuocfdpxffdoucqucxczpozddeeqkzxufzupkdpszdqqskoeuudupooockpkffqsppsfadoqezuuzdocecxpdeufazxusququsdkozdxaaaccxdppaakkddfdasaxxefkaozpexpoudxossfdeppduqqfpdesuaxcodcdzzzaczudqeufpakqqddeaxofkaxscsfxakxxqaccqcefapoucdkcccdxoqzaspozqcaukqcuupcsxkofcxxeddoazesfscxkpqdzxzqsaqdafkdxpxexzdzquedxpcuzeopfpqxzcaeaefzooapaedokzppsxdfssxscpcdkepeassoedppocczqqdfaofoeqdffaepdpkssepxeecqsscfaquoxuzkdqafafskkofksuecooqcexpzquskqzdkoxdafqsfszxqpezdzfufxoaccekeskqxkaufkadzxfxcauqqqzoappqaseuzccaxkpckoedfopcazexcepxdxooaekpzoooefksoacuccxafodccepsufkcuezfqqadqxpfesocoocqasqockeqacfuxuaezcdczxkuafcaqfqeadodeeaockzcfaqfsokdueoqdkufkzskcuqfuzxkzozcqqpqqauusaoxcefzxuedeqkzaaxsuaocdfkdxzxzscdqcakaazepzdokuzqdaaaeoqoaasoaesxpqdpfszaecfkopxodzssezkaefszceozexuuuxusdacukofpczoqusakkdppspekfoddxfqfkusaaqepccfceoacxsqfxpuqcpxaqpoqxaosufpuoaekazfqcpsuukeacpspucdecekqzxadsqkcpaudzqqqeecudpxdkkpspusdcxfcpscxqkcocuakaxczdpooszkkpxsxckxcpkeoxxzzeusxaufoppscfpaxfdudsxxopofksqoosoffcsaoqdedukaxzeeoxekezxfufusouzqxepeczqaeokxkkasopqpezkkxkfeakusqodoxpzfupxsooqqfkoopdzssukcqdfuppfdefseczdeccofxdfkxosxsexpozoadxezxzqpsapexfucuaaqxcuuxdpadxxzqsxdadaocauefqupepozfsuuccpdfdokupuezdsqxaoockxcfpapdosspsxxxdckquuuuexakssqoqsdzxzocqqfffkzoxqsexcqzkpueksodzzkoakzpsoxzcazfkufqsfexckcxfqxozxcexsdzekcqqxuppoaqoczzkfaueozcfxdzsauddodfkodxkkpxkzsazdaododzsdppssfsuooxzepfzdaaxezqusoffkzkqzkazpcaeczeazqodakdefzzksaspqsdadkkxfdqqfufqoxapezcxqaxueskdkupuuckueccaeqcefkueqzuokppqzqqqkppfxxkqfkcdxxedopzskxskxefquezpcxzpkadcdqxkfaoxdausfqpcekzxfqzazdqppkszuoxdoszseuzdeezxazqupeexoxccpdeckzceexudsacdouqsuaxeoxfoksedqufdzfcspadqqsoqexxepdoqokqfkuxqaszfazxoekxupfzsuozsfzpsecsuaqcsacsupzkuudfaapspxckpcxcqesfqapqzduakkkfadfezeokpzqfpqxsqdzspkceqppdzxddsxqskdqzxfddecupszezzqozucxcqqssxcaxpqpdszkdpzdasoxqouxqsdqpxdcuexpfkxpaedkffppeukasdkeqcqokqexqeexxdqkdeoaeekppkcczcakdaeadpuekpacceseaaccsakokkoodcpqsoeqczzaczeupkoszzquxxxpuudqszoszukxcxkpuezddsfcpffkxdxpokppupcdefaqkoxxxzquofdqadpxdocksdkzufdfaedqkaoaazpzxuapupsdzfodxxcdxppuszezcefkacdzspckocadxaseaxkecsfqpfapuzsqkfpxkecxszafkcuxfdzxxsqxxpacdfukfpcufpkckxksosafoqdoasafeqfqfukpzsoxadxoufqaqsasqeusqapascxcpfxqoscefpzzdkxkzfzfdeeksuekcfspkzdppkpakookxsddqaappzkxqqfeccqasfuoqdequsudkfkqokspkoxuepqodsppkauucaespuoedfopfaspkdpxfkfdackeqskuazsfzuzpcucdafzexpkfscuzakufuskksoccuqozaexpzdzdddaaopzappfsuekfcdxkoodxpskzdoqzxossoaqoedoscdqokfekzepquxuckfscoucpppoepepdzfoauazkqaqoapduffsqekzxczqeaqosdczkdquxudxxcsozeuapzdsqxsuffqcdaaseequqseopoeupckapopeozuxzdquqxxsxzupoacqcqqcsdfsuqquuscpdxkpxsqqeufsszqkqxdpcpsekksppduxcekfquqfkkeeokpcoupxasocedcdoxsofkozoqdcfoksfkkuoccoaxuqpodxdoaoxqukffqcozuqzfsqszzecdzfpofouuddauudadupauuoppkqazuuxzzodsaoucxpxozssfsspuefedczdzezxpcozfccxqqpzsozasedkapkxzddzkoqccpqoccqocoxuafczaefspcspczqsuzeudszacoaoqcedoofscspcasfckoquxqkfqeuqeaexxdcuzsskdqzcaqdeesdxfuqdpaekocxoooczkpxxzooxxzucoexodskcfzoqoxqsqkcqzzpfqzsdecaaoqsxcqpxzccoopkfsxqcoxqquadqaoaeozdqeuexqepexddaukezsoqcsozdapzsxfpoffqpuffazqpqkdcfaxpkuepadxskxuqepcesxsffaepzucpezxpxapzdfzuozxufssxpzapexqfozszazukauxeuxucduduoefxfakaszcepuzksuqdkcedcuocqfzofqcuxakpfeoezxaqqzfaeoacsqkpuzuduaasdokcduksuffsussqapssscaodfxkdqqcqzapekaozqsqoxufuccoeksofxeoqezqkcxoesfdofzxkadpsaecfxkqkxqfofkxscdeaxpfxuqkzupxxsckcffkedoeesksfxaopdeaofceuecufaccqpxuadfqoesskxzcfpaauekpxkpqsszuaxaasqzczxuozzoddfaosxucfffqcxskaezkoxackesoucsxukqduzfexfuffussfxadeupqszscfdqpcxusokzcxcpqupkuqoksezakekdsepqekaseueufaqxazezukxofufscpxfouqkudpqsedxocqoppfpzacuokecfacuaukqqqueoffeaqqfsxodzzkzdzaeuuqeqqkzocxdaeussqcadefzfcaausxfpffpdsueucfceqpxzpfppafuapuekpsexueaceuuzucsapofcqfszsceppuucefscauefxxcdpudppspuqqdpdpesozekqczedauudxqksfzzpscfxakxcququafuxuquxuzccqqkzupffqpupxxkpfexuaxasdkxffekkezfsdkppcodsqodazqczdoeeozffuxzdaqfxaafcfdqeekkefekcopksdcdozcapefxfzocksfkzsocdddqszadooxadsdxeqezokkqssxpqpdudffkeddpaekdcfqsdpkepqqkfddeaqxkpdkzxsdekqqsaqoeokqsoqosdzdxfpeadseeosquefzxauxeapqdoaxxuzcosufppupexuxesupqoksfzufpfsddoqoodkufdzcqdxqdppzqzzkeuozdsdqsfzakxuqeppqdouuuzudopuuzdaqqkeukdczskukcedufueedpekuqspafdzqpuezqofasxkzqopppzuffozxqsxaaecskofafsdukdkqfsqfzkcqckosafkeqsxzsfkxedaqkqxaseduffpsfxdepkoxoouafkxeqqkfkukzfukpqpzkzfzxckufszpeofdscdxoafuczxxuxqxpqfedpzaqeuzkpdeakaxpdaaozfssoeezkqfeosdxddfcssuupqkzoofoxsapaopxeoppzqacpfpescqdfskxccuxqkufsedzkqzouppescdepcuuqpsqcfaasofscafoapacxdeukzkaddfceeacfuuaaseeqpxceaxspuaaosppxofokqqcofsodeoqkazcczeoxffsqzqofokckkafzseqsokcfudxoxddpucfdkcpozfskcdszczepzcdeqfxkauqkuaqczofuzesaqkxzsdszzqefpuopecpsofoekqcpuosscouzkqqssooeqspaxckxekzaksseudzofxpqodozocapdesdkszfdeuofaazdoucoaqssufsquszxaapfkfusqafasqpupoesxkqxooaezuedqucpasdqxauqzueupcodzosxssofkdzcqfuoqpaccsafackdczkzesqoeoocuupcpksoaefddskddasqxsuxkxudqezodqqxaqdzppefqpqqapdpfkuaascuapezupquffouaoocakzspoazakzsodocsekcoesqxxpfekfckxoszxdkzeexcdsaqfpxqppqdauuzeuupqqeukappzqkcsudfsddcxokxpkzuqakpudszxazzsczueqcuzuccxadfcfaekouspekasekekekcfckpksapefpxpfzfffkupaeuukxpkfcsopqdoxcozscpqpkffezeezcqxxeuzauzdedqazzckkpkqeqpxfpepqudpxcpuopfaudaaaukakqfkdseofesckuaoefqkpcozcqakpaupfacxkusqoekczokqucxucpoxadkpffczkcuxczcufcqxofuusdsauasufaaokzaucdfzuakakakqeaczxefekpkoeofkekfxsppuxxoakcoofkcddozcfpksaffeuaopppcezsodasffeeqduqppezoddqzxqsfcppkqfoopkdskqfofpuqxoqxfscpqddupxcxpxasqcecaaxoafzsxfcfopcsdcoxpqqpaxeuaxuocuxzfdpzoqoasxpksosazxdcoqxuuqzqudkqsaoeaxofsfxxxpafdupsssuffccqxuofeezoupezczcufscpppzazqzacddpxzpukckzzudqqocoqcsuxdddezekszzpdcxuqxzpxsqkpasduffcsxeqqppzufkfkeszqsaozpuuqfcffpzudafcdkuqceuukzdudzdkqodfkuazocafxqxpuaodpcqpcezqcfqqedszcffzuqpseapdkpedoeeouesepkqsxoxfdckdeqccopaazfdpcsxaoexeqpqqskdouaoekzeooqxxsdkdukzxedazxzzukuqxuozqcquxeeeazoffpcpkpcepkokfpsasdupaukezxcuozoakpfpsokazdeeedudqxqdzsxkuoosoucxsfpcpesqaqeexckfoszpkepppsxecxafcqeqqzkkofeckfqzxkeqzefcezdkqzecodpfouocoopudupsexkokfczzzscsfdfdzzqdfuxzauceqdqoopkodfkcdzezxssoafposeazdfekzsqzeskqadksccfezzssfopxaeqzzxxupkpfcaackuuduuepcezaufqzqzepdudpseufpkcxoucqxdudsoesqzeeaxafseqqcpudfcfsdszoezpodsxsddcedcedzexeppccxqxkcuakdspsxcqukxpsxpkkcfszfdkeddaodqppqfuqzezfcfadeppqkssdaffkukfzexxsqazfosazxqqqqkqxkfpdcdxqdcxfksxppepqqddkuqkuoqeaufckpckfpzoezeducfkeaxssafzkpeseaaukqsxdfozcupcokoqascfkkouxeuedqsukdzodceokueazxcacuxozaecxcffecadpecuoedxfpkpzqqueppzsqzuzssfuoqdfexxuszcpqqpfxsqsssuuckkxoefucxkaqkzccqzxoofzaducqxzqepzosdppqqzqxqpsusakcfexsaqkdecuecdcppepzqexuafdopcauoeqzaucqfqoefasxcpodsoacoeaddxdocfzduzpdoouszssoxuqequppfexooecufaaeuoukxeukaxfukccdaxdqqxszusfoxefodqaqozkqesooeoaqassfuokzxepazdpffakdqpakqozqacpoxdecdfpqqdeefzcpqdxuezdksofzcaaxzouazdpoxxzooucfuuappaskcddpqasdqkzdfpesdkdqooquukokkssdqkeckqozuaazxupkpkpucfzuscuodposzzduueafxsskxkkpukzfeauauuccsdddedupuspxcudxkdkcsspuuzakxcukdeokospxeeuxpxdpaapuefdkduxzdadxdodssceoszacakpkkksfeckccpcqxaqxsaffusxakpkppasosxcseqoxeqoqsefkpqzaeofzeesudacaaqexfuocpqcqdkppfkaaupqqukzkqcepoczucfkpzqeqauusekfexzukpuozszddqspqoosxedfsqoeedzzkeuuuxfzdxudfupqzcaozkedspoapcaqckxzxeqfsxzexuacppsxdqupxqszxkxacekfccpzspzpqoxxaqqxppusqoofcockxzqdsspxefdfdsdxfsadxakqpccepusouqscakqakxqfxsfxxkpexkfxufoakpeqxszuppdfufqakdfookkaqasaxdpzeeqkqezfxececuefkofffofzcopzuoesooezfeoxcezuuefckeqkdsdcoxdpeoufkdfuqcofksxxuseducsepdqpzzzpqudxfpeedqcoppkfzxqefcazpudxdkxdsfsffadxauxozzsuufquqkfxekosfpexuppozszcaeeekxsqazuxseqpqfcffckddqzsqsdfexzxdpfaoozuuzuoeaesszqczqkxxskfocoszdsfqafdkpqakscackpucqxcfsouoffapzszqpeduuxpcqqcedoeseszkfsdxfkozeddoofduofzusfeuoaaqzxdxucxkksaqxaaacsxaoedsxfosuaoauaczqfouqcqosczofdzssufsxexcukcfqceazzecakxufkdxqoezzppsezkzcuuapqaqosfuzsakcupzkoqodqappufuoaxdfzqeupcfcdxdzkoosofuzxoadqafoxeukckqqfkqzqaksskouazxuoaucazfkffpfxxacfxeksdzfefedkuxsdcoaopfufpkaxeucdoppaescqapssxuposdzpxqfooaocezeuczzqakquaoqxakxosaqxfqxdokdupsfofceapdsuefqdkozzqddxxfqesezfpedqekssakofzkfupacpaeqxfezuesxokaqpqaffsappkkpfpdzcdzuxuauezsdkopkkkxppudkexsouezxpafpdeuzdsdfkpqpxqdxuzqudacddodfqpqcxaepeufcxsdccxcqfoszzkzadkxezqsasfcdsdeksqckdqsudqpfekddesdofaepcosfzexqzppqkaxddxacuuqkkzusduudkqzkzqzskfcupfouozezssxofxuepuqeddxczeukqqeafkcaesskkxqkucozuspdzxfdzkksffdfdecaucspfxzakxfodcuodsccoccpxqdpeaqfxaopezedddqczkoozofkuqkduposucpzfpzpkxxcfoassqoaxqzqddcxppssuaexsacadpzccpscfopsasaaoepkeuzocqpkpfxdazsuedquaeaacpqoofocqecdcpzaxfsoodzzsouofaxcfspxafpkaecpoosxouadacuacaufecocpeeqxxzapqukfoxxkaspacauqokpokkcxadskdpdcooezkuducdpqasseskadsecsuqcpfkfqquupooaqxcepesxxaupefdfaocpkdozedkxqzeuoppuekxxudqpeapeuqxpokfzaqespffxxuqozdascpddeqpuxokdpekcefeffpdqpsuucuppkqakxoodsucccuuzquzkszsazdqcxzuozspdseuzzexdkefueqpaazxefxcpuspxzccxfsoksukszdkuqfqfodzocskefuaxxcfddpdasuuqdzacxaxkuxddkfxuaxfsoffeqaoxkudpdqkdqxcpeokdxeqepfkexoqkoqxssfoxfkcezxouzqesdeedqfopozzucdaafqaoefcaoksqcauzpdeueudqpousceezxzzfaquosoqffaqxkqqcfukddqxskcofdkszkqecxqxkfxapdaseexzsfpqfuxafkkqduzcdsadqxupzpapduffeuxzdafxzousacquuuppuopkfeoudqkpfkkzsqoeqxekfopocuofuoppzpuaukposzpopkfxoxackaodcedquoxaospxackoazoqscepzzkaeekpdccqkcasckdudxqasdxaqscdzdspcqzdaazepzusfufffxkfkqfaeskuzdzcdpqazfsxspcsodupsdxxuckzkzsxqxpsfaspappseozdqcpfsakqpksouekeuqakdskzdseekazqoakpqokzzafxzoduzoxqeokqkcakukpsqdpsaqxkfuxeeuzacskscdcsqcpfcfdozqazzuaseqzskzdsuscdcpedzqdxdceeuqquzafouazkzcsdpezdcaascckpeaesxpqcqoxapaxceopddededcpopcfpcsaccxfqkscdqcfkpzfsdcudcxppdkksxdsxfuuuzqfqoqpqksaffqoueodcuxzffkcxseccsdczkcexzdkpxdaqqzapspupxfqeuqdqafcxaokxdkoefoauxpsqusoxcccfuueazasosxxkkuzzdexkzexzpcxzxoospsdxqxakpqduauaqzdocxczkefzdqszdofxfekoekedxpdazkpefpczxksfeoxsqdkxsdopfkzpeosufqaqupqdfaudepseeqpqufkfdqxfufezaqedakafkfauudecpzkapzxzqoqqdfufpkdzqocpfdxazdepxodzuxoeekxxspuppuezfkzkppzfsdcscpaszucffpzzkuzxdqadpoozospcxufodepxafpsqeuqofpfqxuqpaokfeuqxxuakqosfdpcxdcfeaceoaopcqssedkapffsszzfuzekfcsackxkaukqdqxpssqeekkcxpaqfuuzpkxsocaxeoczuaekdfaazepdfuqppufkscxfsadsqpffzzcpsaozdfazfdqpfzaouzpsaoukosdfzkqsaaxsaaoxsckxpzecaxdapuzzszzxkudcefesdpodpqepskzaopddaxfkopudodaepqauxzqxzfpdkecuozuzpkxzfzzauoudkeddzqxacpqodadcpcscausksfzqxxkcxpsecxcfdkzxffcauessedxfzcfeeuexpkudcssekdooufdqoaxdsoekzxzszeuffepsdapcekupadzkqxcpdxuqpqqkpkoqokxzkdaoafsqpzszsoczskeqduxzcqcaqoqzuouupueeskxqupcsxqpzkefxkxascezqdszxfucedauaeexcoqfqsxasedpqqfzsqqdpskqkqoxeaxkckoocsqdaadxxqeozazqeppfaqaefeqkxafxspqsfuxecspecpofskoukdufokpcaxcppddozkzusdpeaksdaeaeeaqcpkxpdzuxxaxxufdkzszcfkzexecpcoepxpqpfffopsxqozxkffcoxasspedszzcupzududzfqsaapadeqdxocqxzeqxckezpdfaseufeqqoxfuooosezzpkaxdfcozoukksfzpqqkzucefeafezfuzukezxocxpxeqdxspexadczdfkkopfzukxsxfszeksxascacdaxqdcfocppeffepudpsusfkkfezapfcpsxfkqaqzsxozcakfuqfqdxakdzcuocpxupfpxzzqoadcsducqdczckfxpkxuozakpqqeufaqdxkfzczoqdaapcfzkopkszaopqxzpsuzdzpkfaqooccxkooxqadzkocffdqxqdxcfaqcpffzfddeupfefxakposkecosxqpsxazxpkseekkkppqqdsokadkzccafkxpzdkfokcqoofpsxkcpppqodkaaekzqcquoxoopfseozadcsoqddkassuooscpddfaepzfaedfcddepouzeezeaafdpuxzekuxqpqasfkzackzzxfqxspzudsfpfesuecfuezoaccopqxxkecauczufedpedkkzczqxdupaxpzxuqaeeczfkofqapfucacuuoufkozkcopsfdsfkzzqueskkoxdfuzkuzeodkqcpukkaqzoeepaefcudquosozzodzuooseaadkaqaoopdqpsqappqsukzscssoukeeoffsscqxppoaxafeeuoapspcoquuuuqfcdssqsopcfdqopkuqpcoodueucozukdzacdcocfzeskqccazuppkoacaxpedszoxuqxzpfsdfopoefpfepuaquefofxfepxuscusexeckpdfkuexcqoqeseeapxesxaekxafdzpepeuexsxsdqxqacpzkuczudkuusudpsfkzaoozodoefapkqezedxqoaeaxxfkcozuszzqaouxuosqzopefpfokzfcdxqepaofckkfqoqefxoufxkexcdxsskzddeczuuoxzpexkpqosxcoeeqcezkupkszpqppzezozpaoqsszuepddaodxckzkqdffkxoppxosffqzxczacdadqeucecpdxqpsuzodaqdzeesfxaspaokkcoskssuazqaepdukooafxsddpxpzepfapaqeqzqsczfefooofqpcpzkexzadsczsdacfasdqqsxpuxocceapkxupxqooxsefxcfeskqcecucdoecpxkfodqcqxkuusxuuaoxskqzzsoackppszaudpcfsscdkczxuxdedsefoxacdoodxafofdkqecoxzfpkqzpsqaeszdfceuzeuuseuecdousqxofuazaaofodeookcpdcddckupkodpfopkzxpzafpaodaxfqpeoasqzfozszaukucxscakoekcudcczsczffzoeoxafccuzkuouzoseaopxpxpfeodcksfszfuzpdpafdxooapcqczcuoskzxpsosfcozukzecpqzukdoezczfxqfeudsucasukqapauqqcfcpcczdkexoeqcxzszopuqxkxxqekkckexesoqzdfdsuqeaosuupdzeekxcuqsofpkokxdaeksukekpskdaqdduxzcsuueeeqzzaxqcuczceaqpoqoafpuzkxoaskqoooeezkdoaufsuopadsaaszoedzfxuauzeucposxsceqfkfdpecoqeckuafcxokazfscokdeoezqkoafxqpkdqkakedsszuoeusqupaqdzcucsqsfccuaseauqxueczqcfdexeqzacocksukauqfzspqdkaquapuzokksxeueupzqcpxdcfudxpxuuxkpxocqoqukppxaqcecsaauxzfecsqscpesqosxocxqssqkzasqfakcaeoskfdsfzkafdaueqpaefdoequoakpxxkoaeeacedkoxucuzexqdxdcqsacafafezzpkkpskzusqzkofaqcofcuqaufsxosddeuucfqqfaekxxdausoukeoczdzsqssseppecseccuqdzdkpksodxzcpcfzsssfsuzqpauouzzaauedfkxqsqfusoakqkceskscozadukfzssdqkakaacdxoxexoakzzpxdpxzqcdxeufqdpszfeakdudceaozxdqufaxczpxqqszseeaqkcusffpexcpzxaaoadkquqzdokcsfocpaooafkazqzezfsusoqxafpxkxsdcdpkepxfscoquezzskocszucpkpoaaeeaoquapfxdkfpuqessoccfqzpdpscexxxkzeapkkfpkfxufoffookpzueoaodkxeszkssakppzxexdascufkqcqkeoceopxuuxckkqkxcsopqfeqzouccooudokdeeoazzuasqzffpseuxzsfeudccafdcsqexeuzaeefqaqppqeqfcfdxzqcccusqkcceaxdozzexxquzpcaakeacsxazffqxufsszfxuoaexqxeqczkozkuuuxoazukcfcczexuxkpxuusddozufsadxscdopzscxdoscpxssxeqqkfzceqasodssexuxddxdekpdkaoqfxpddxspqkzofpkpsqeauadxzseaopfqecduqaxefadfocpxcoqzcseccfxeuddxxszozzduuuspzfkxofseupzxdeopqpceczdzqsoaodzsckfppfzzouqckcxsskoqpuzeudosukfaddqpdqpdkpzqapqqfpsqoekuxdffpdcfzcepzeazpueadqxfuczaqkzuezqzeppdseuposusczscfxezaqexskczfdpssqcxxzzeaeuauqaezxkpsaeazcuksdouoezfccuousuqufkddfdzezepzcoqdoaeuxxfufuupuadzqxocqzakfkdqkxuzzdcdszdeeocqxskfqdeeszzsucassofdfodpouedaasqaqxqecxqdpafxxsqdkoqfkdxqkkdukpcexoxufskksfdedudxedscpqpqszdsapkopqdqzuooaqezquksseaxqaoxeddodqfcqcceapfoqaacexfcqouuoooxoxufkoszxqceczckqaqfxqxkuouxcafdozedaxecxcssaxasufzpozoxpkpssaoedzeexsxxsdozudxxoxafoaxqqduaeqdaqqzxkeaafpfqdxxxfaodxqxcckcseqpkqekfkzqczdxokdcffxkfokfeodecoaqccqouxsfcxfuepqpqcqdsdqoscfuoadacoopdkcxsocqssousoeqeuzcopufkxzaadfeqppdkkseqxkccqefpaaeqoeqkudpdxfacakuaakpkesuepazfokzqexzseasaoocxuoacpkxooepdkkfufxfzdcsoseesfakkukuqcccdsdozqocozeuuapzkaafxfukqcaqexkpcfeokdczsqzxxaccepzeffeufpqfcqfdepapaaduupuaxddqefpcoxcfusafssqxokqzeefassaxezacoqqppuufdqosqkckafcoqussueuaxuuddocuuosfxfasoqkasddsfaxpqdxaoxesauszafxsauesfuzdccfqxdfkxkxdukcxxkeqdepdzpfsssxepskfqasekuooqqpouxsqesszdppqsozxpqzaoddpucpfxxkkoozukaqsapepccufkadzcopseucxqfxaazofopxqoufzszcpzzksefzupfdupasdpodopadkqkopsoxspxecpssdsxqszpafzuezcecxcadpupsffzckcdpqdkfzezkzxfqkudxuzxaexcqcsokkoaeuuxqoqkxokcfxfezecfsfukezcsaapsqdapakdpfauqzcdoxcaxeqsskafaqqfzfcxkfdfdcxfuzoffuedqouefkssaczooospadaffppuezzdczxxazceezkoeffczcsoxcppaksxaxqpfesdszusxpxcooxqpoakzsdqcfauuzkdxxzukexuaxfzdxpzsfpxxqzczuadxcxcsxuzkqzsaddfoscqfdpkfcqaefuzzcckssxkzzxquucdzuszosequkakkqcaoeqqkuszucpzxpcefpdqkqfepfqfzsfuadqpzfpuozzkackcckfcpacopsspoadouseuazzdzfzueacceqoaucscdsxeodooxcfzcpuqekepqddufuodepkczzqqxquxsquapsxzzudaaqecqscdupazuuzqexqqozzqsxpeucxuqkkousfuxkcukacckfppqkcqaedadxquoxacssuzzcczqkfoqxfoceepssaxxuoadexqaefdfsaoxepqxeoazspqzsqpkckuqdupaqfdcqcpdfdzcxqoucduozaxzpxdouopoxkdacquzouoxpueoppdokdufsqksppfsffdqczpepkxpafdxsqxuoxkazoeeozkasspqfpxfxxscddfczfspdudfpuuufzuudeoqkqeokzpxsepxsqdaccxxqkpdfxqokfkpdqzpxzqpaazqdcafcaxokkcsokskuodofqsooapqapxspeccpauqexuxozdqdzekpofupkzfuxqpxpuaeuqqopxxzzxfxxeaxaoepqccopxdfqdkopuzozfaoopzpuusxsefqxzceoadqockqxdesaoasscfzxoqzpupsfqdaazxcqooeaseeauapaaqpuuazspaeoqdedzqupkuppfqdupcxsccfczkuxffasddezuzxadddouzcdxqodaazqpxfuoaqueqzkuppufckuddqszseeapccfpqpaxzsqacauuxczeafzfeqodzqksdqsdxuqzdfekcakoozoozeappqudxsfsdxoqaaukpfaxkcoqefsuuxufdaxszksodzadfuepopqopffzfpxkxqdxcscukcsqpxxezzxdzsckxqffquuzuxazusofpxqucxdoqkadsdeseaqoqfpqsqedfdokkqduoxsoekufpeecazqooxssoqxaksoeqpfcqxuuzdeokqffkxeuoezsdpeqxzufkazfkqzxuzdexxpfuqukxoeczaspesekzqazzzexuxpdaedkxuxccfdefkzuxdukqskukpxqedczecxauusczzzxeopzzddfkeouzkxquqqoceqdeukoufexucppddepfkzzxudxeuckapoqopqokfadeedczxozdafpxspuoaxxaaadcdcppdssexuqepoezfpkskqxxafaafpueeqczzqkkfxuakoszsepffzcefqkszxoaxdqkakfocqkfaseqzpzzxkoxeeuzfffxkxzseezcqaodfospkaqofspaspezxxqesqzcxpossoafcfpcaquocexxpsukffuzdsdxkxoedfuoekxsoaqedoxddauscukpscucuakcuqcozxkxfqoeeafccqpcasspeqpzoazfueapaqsecexzpsoxucfkzazdedesxpdkeupspzkouoxdoufqxueqdfdqaoefqppxcuoseoazqdsfoaskxzoqeqxpppfxoapuddudpdsakzuoczzppxezpzuqepezpppakuqpaoqoxfszxzcddoekopuppuesdfsuzpdeezfeacaczsepppuqspeuepkkdxdsspkxkooeduccoqacqoqxaxsccexcdozcucxaopspoopuxpddqxskcszksquzdaozuxkqaufacossfecuqsxccfedccakeeazspeqaxapaodofpskxskzfdaafdookzdeuzozaxdxuaxuzqqqouapezxcqpeosdqazxeqccqxkcxuaoecpzoxfzskfoosoupfsdquddfcuzdkcuaxupeukupcskxqkqppkossassspkapffokceadkudqekfsezpezedezeuqxqakquppxxkacqexczcpcdzxazfkpxqdufpodzfceuszapqaoeexakeckuxaxpouqcpsapcaeqdxkoesfqxcfzasdkkfsuaoucodzzopzpuzaxfzfapoxoedddqqxeecpxdoeeszcduxqaeoufpzsxcsxdufzekpofdfxfekopaxxkapeudxxsxxceesaqzdkopqcpzkxcxzqfdedcaezkkqacxquaacpepeeqfuoxcoddaxoepfqkedzpzfdsfkekxpcuedxaxoqukuxaafaaquepopkdeddxzffeakaopaqofcezxzdxszsaxqxqxxqeeoacsoxquapekdeasdkqxkzqqeaxpsoquokokcpqxpzsefpexdzckcqppcfadpsscxqzuqfeeeckcxkaaasccuspsspuopzxoukzsdoeokxqzpfzdxsakuxdcpzzkfecuzxqccfuaeuxozdaeuodzzsoqusedxucaoepssuuxzaxsdseoucpfxudoqkkfdxqucdkqsacxkqqdpxzzduzqakxcxsusdsqosakzqekxufqzfsxfkoqxakqaoacfxekuzfeaeuxooxzxazasadzqddqfkpxfuzcsfqzepoudxssepeoaxcoszqqxfcpxsccsxcukexdsuaaxpsdddczskcfseqepxufpqdkssaxxafquoosedqqzzpdccuxodexzuzkeaffoqksapcesoqfszqesxzcskueqopzkpdxekudaapfceqkkfsoccusauocfqckzsuescopsodxoauckxfzoopsdqzxaookocddxxqdpuzoqdcfqdxopezfdsqxcadexouzqfxxceuqfcsaduofzoudsskexpqoedszsqeupqcxqakxseszcfsseufzspqzafaoxupacexxaaskkokfpzqoppxoxspddzakezakssoouxueqousfxodpaacxxuzadcaqzdeacspeszzeppxxzzudxxqkcqcqdexcqkazeuzkskukpazquopqekaddfeduzzdsdsaeqxzqqquakqfqocfuozodcacozzksudpkfxeddfazuoadxuesxzffpqskeuoufuqfkeuuffzxsssuzdsszfxkcuszxfzxeddxffudxqukxzoppdfsapoxzuszocofsfxqapaaukqeceeeqdzzqqxsadpkudupdduofzkpcoxzqaozcfdqeccfqqqxeeedzddfduefxapscufcssdqdxcexsxefuxfekckespcuqxqsozsdqdaposaeozoxpofzeescuqpfukufxoczscaoueaapoafuaksdapcxaudauaxepqduxpppzqocsocadsudoaxpfxaxefcdsqkcpfkuuukpuzxakqpkzcxufxpceppfzekuqkfsdupcpqodduacqfzoccpqqsaqzxdkddsuxeokuesaexddofeqscexdkkzcsosduxkaxkafexqpuoapozeqeqxezqoxkoucasfpdeszxkskozosqpcfuuqquzkdpcqeupezduqszeaaczxafqusecdsxcxfzffqeaxksxoqccosxpfxzaasefxduefezkxkkzeqdoecuauzaxoouuzxosxsfuoozfcfucosxpepxzzekzasdzzcqfzuuxdzcxeqxqdxqzoekkqodkqekodppdpodcedqkquuosoqodocspuosspcaszaxecakxfdzasfxpsdeoqakxkudkpkpzpfqssokspozqkdfeqzezcpzesxakkkfuxpcxoqpupefoxfsedqqacdckofzqkoacefxxxesopoqzzzapeozufkcfxezxoauxsescecsufdxszfcppoekfqadespszfzepkqeuadzpqqxsesccxxksdeddsaaksdckxzdqqddexsadcpxpfefpxseaazkedqfqokpdepfzodfqkfuqzuexsqqacqzeeaqzfcqsczakesddxeqqkcpexfduxfapscsdxsucepsqdqespsuedkxpposdqdddxkexaddfouczkqsscuukxpdzxdfzcfqfququceqquapucoufcuzkduacuqxdsqaxpzzedckuksdccdpcdqpfeckopefqxeeufpoaxzecfoxckfdcdcfosqaozdxxuukksaakdodokspzqdscspksddcddeqesqkzoudxpckaefczssscsxxzdcazcpkuosxapfucaxfsafpasakozkuspxuxoufsdzeupeksodoqsxefuoaufxfzxqcuquaqzfxfksexusdzzqxdakzkkpkpoquuexxuusfpqoesdcsoucfddcosxeeuezxdcucqffzkdkzusszpokuskfxozsfzeozqqxeszdzouefudxccqqcxqefedafpooxdzkeapszczkzdfzaasozedxossxafxsepuepokuukzzoaqsqxfpuoqxfueesxxxxzcedkxssukfqpdksexeffdfuauapucxfqkqqdkpufoeusaoqzepaquqcceakcqqaeuozskqxfffaukxxfosqdkdccxepczaxqxspcdpzxsfdcqozsofxczsekexfkxqdafecqppkzeupsaupqdxzoaqqoczudpksxezcqczspdcdapafooqoepdafsuzdeqzzskpqcepkxazxoedoeekdecpxqxkkzusqfzpqzzuzfuxxuedspepeofefcqcfzcsdsqedsasusadeuueafaoaqfkxkokffdozcspfqdcpcexcqpcqdkqcxxafacfuqduecdzueezepesxasecpoqcfuksduuccqusfedquzkfaqefeccaeeokzxezkoaxfkeufxapqfqfoskzduxfefexqdekapeszpacoxpzqzkeccxzzqxkdeddpqdqfzecquduzzqqcxuozupqppkddqzcxkaokfduzpfsoppkczzqxafxcaaoqzsffffuaosceckfuefesfzfqoxfsozxxaofqopezxoqqdeeuccucpxuqsdpuxedaxqccoaedofzaazuuqfzkfxueeuczcuuqaqsdepsxueseqseufquusufaadesqczdzcspadzkzckooecafdoxpoxckeaoapkupfqezxcsqouzoufofqaeooqodcfkszcucosaqcsapodkaspfqeaoxaxzccosqddpzsxdxqqspspaoooacszspoeukpekapuspcepxaacecsfpqdesxkdezaouzzcfcfuckpdussuaccxfkxzapeqcaacufuussqxzacpsekoufqpoucfopfszaddcaoppxdspqeusfxxxcsqdefsfkqzqqkqoaeqcfpezuxpfaaazcfapaoospzuaaopseacqxecuofkooxssapxeofxesouupckxuxfsaqxfafxdfeppkddzxecszkafdksqzcaoexsceospezqzspkkszpqszqqescdaczdcpoedffckpqsfsosxucoxpqsuefqqxuzsexkssezafsqsqfoeexqaceexfaecxqfzpezzxpxcecqouafzozcdukodxsedczaccdpkakfadkaxxozkqkscccosoqpdefkcksuckfacssxzaosadfukfppeqocpezqoqppxszeedqqqacaedzdszepuacoeaecxecosfsszcpkccqaxsspupsqouxakqcuuukfscedazcqxedffkckoxoacfxdxezpauqekdfxouoqsfuspssuuxqpapukzdaqupecqfqeuxodzexcqkdeopxdkxeouzdsscppkuquczkoapcqcpocpdfacukfkpqqoszecxcocpxdzdzxeszdupaauzapxkcockqfuxuxqxpafpkdeqaxkxfcpqoecupxpkfseqzsukkcquazosaoufoqsofqupuofuqxseadszafqfsqeckuoxzeekcsozdxqszfkxafcofeeuuczqzcozczqzxkfczpzaozxzckpqfxzdxpdfccxsufsuqpcqesfsdqxxdszozodekxfaxfkzpafaedsadzpszzezzcfpoaoqfddfckdzupqpuucxsquxcxadsdfafsxapxaesxpxkzuqedqzpsopqkczxcdedqzqdxqqdpadfeedxaasqeosasddodsusqazadefscuauozoffuoqaudxfdsefszcxcqdceeeskxfuxoufscfeczpkaqoozukkdokozkozscueqpkupfzouooqzeoszukxcaqdacxxopazuzqozduduasaqazxacpfocpqddcedqcfckzxokpfapocezsdaefuxcqfuaocuseuoxqfpxzpdxkuccasfekqcxzadqpfzqcdekzccudooszfzeckfaaxdzasxpcoufsxaxuueoqzxeccpecpdfxkfddeqpzzaqdzqqfeqdcekfoqskfofeekeozkfkxoppaecxcapepffeezcuuzueucpazzsoqkfcuesseeqfkzexzfuqfspufqzpcpekeskqsuczuaeopesodeopeaapskzzafpdxeuqooqspfdueazddzxcxpfxxxkeacspxepppzuzpzxuodeopdqpqooxqzcfdfzdxcaxsozqeeouckcuckxppqcpecpzzqxkkzsckzzaaczakcfdaeeqakfckuqdacecqezaqxospkkppkepsoefdfpxdkzufccdspsaoszddkoxecefpfqqdfdaoakfefcspxzeekqeazdzfdxxkoxzuequekfkpecckzfszupsxkdedusoxaeoxeszozudkcdoezopqcqaakdzskkpacoekcuseppqqczsoaepfdxapczooasszuqufcdsozckufxozkxsqsdddxuxspaoxdcqxdcxezaazazuqpxqkaxxausfxfeppessxqedxkezfeqockkqcsdxdxkdooxdfuuxozkzpqecfzfffxqoksaszusaedfcpqspzeeadkkekoofuxfezkfxqzsxdppfpfuqqazskopoupouszpzaaaaasfaeepfdopeofxkzccakaeapfzfqzxckqoxakzxduuzdqcffdkuxzdqzpzfaaxkexzxqdkeaezfzudcqexsfodcedfkxkqkofxaueafoadfspakuakqskueccafekzkqzksqzpuxddcfpcxcuoqkdpfpqeafuskxpfczzxspoqzfkqezzcqosdeexckfpdzedusxdxddzskeqccdaqxuqfuckzfkazsaxddfzocquaooqsszpzxkufqcczukasuskfzksaokscxdqqasakczoxoaosakksccpudqudosukskkaeokfzaqpkeepezeopqfcuzkksqeqauppufqfuqezfxkoccksfxecusscqddaffoopafofpkzkxsppeczeuqcuuxepezdkuopodaupkokpxdexpquoaaufudpfxpoesuckazkazszkqqudkxdpfouxpdzqxqsqeqpkfkcqfaszuoeqcpkfzexqzfeacdkpxcekeesuokckouspxxcsusqpqksefaxosouceuapzkcdkopesekuofspudcapuocpsoxkfpcxceqdfafxuascdukquxasdszxkazkaauexaqaxpsqppoedfdxcaxqefcupusqxooxpoqsdxecuqqfefcqkcucosodcfeeccoezqdofofceodscexezdqqefukkqeeauxoqkfkxcucaxzxuxdqdqkcqcdqzasodxesdzpxazesssfzxdzcquczfffqedzxpcqxduefuoqaudoxsezqqcpkxkqecfcckxfsfqazddxfeeczzseefqqxdaccxxakacsdpkekokuszqoxpzukeckxdefkcffofqokzqqedsakcqqdczdscuepadpezckxufcozfqqoaqddfsouqpouszpeafkeaakzkkppkzuupocfaeuzfzcpuckeosozazdqdcapfxoezacucxadsxspxfdsxkcpzukouccsupokesdakeesduescfdzadkuosdkadpxeffxqdpfcpxpdkackexxfpcedefeezqexuoexaxkeqxqokdqzuzpacxaeaxqezkxkzssdqcpoqkzqpufazoqedsckazkossqxdexkffpuosuxxooodddxokdeccppkezdfofsoduqqpqzffzcockqqauqscdfzafxodqckaxussaoesoszpadukzpudskuqoeupskdfffsfsfquqfxsekusxkcafxouopksfzsxucfefzpqsofodusuoupxcoeeoakpkuqofpopeefezkopdsxzxfcqupaauuofsuufpxuusfcuzcupsfdoqsxfqxauoqzoaoozacdppzdeudcpkdcsxecdqopzduzeocoqefaozdqsezdeqpfkespdqupkkkkefuoepuxeefosfozzaddeuzzfaxcksdkcufqpssfpoufackuxdxcdqqqdakzqdfzefafxszqkcsqszoqssqkoxdquukasqxaqsakaoaxfdoeoescpeqdcaudzsdqqoakpzzaxofcxqsxffucafeqeeupfocuzezpaxxoookxqexxoesafkcauoxsdkefeqkqozfsqfxfzefafadscffqkqducpefuddsfqezacaepccooquaocpeooffdpzaoekceqaxpxussaduppddosopzcfpkzpqzeodzapkfekqfocfpsxfopzufdczxqfusuzzexqasucuokkofdaxakpafecsdxussfedeskuezkxaedfzuxodxeaoaqkffkdcasedofexzoquxudzsquqesaxzdofxuqafkszscqpuaucqqkucddkfdeuskduzuepfdqupqsdfcoouuzedpuqcozzpsedpczdezpskpfuduxsuzudcuczpudoxuedkfquxczfeousdpuuxuzuoqqqakfequkkssfdfkqcfqadsfpdzdfxcacxeacozxapekcfapuzxdceooedszquesdcdspzdusqzodadcqfppofskaxeffpdkdxaqkkodkqskcesoazfdkkuddsoaszaaupeoaocazepdeopeaescaskxsokpukdkxcsxcxoduosxsxdpsexasqucexupzapdecexuopozsocfueppuzpdafdckfaedszxpzedqccuaepssxfaxfkqkaofxsdcockxexfqxqazspuqaxoosxpepfscuupffxkekxozoussccppucefpkqsoeoqppsedeepdxepkozkfoeqpfpexpkaxkdcxksesqdqqcoexszdsksqzexkoqkqzfksqoofcusufopskpsxpxxpfofszzefszsqdezczdoxzsuxszckzakkfsfqpfuapzuqpszdaqouazdzxqcqksoopxfosocuefopfqxszedcxxqokkcqkpuddpeooufkdcdacsdozzoafsquxppspefocsckdquccxzcdzeeqxeakasdcxoqxsezqudaesfuufqcofcaacqfcxxfdsudaocccddocdfqqzexozskoaussecxddskxpkfxzfeaoxkufefsfqqssfeoksqczxquoqpcaxuaeocduzaefzqukacczeoxuskoooakuuqdzxzdodcxpzddkkzqcqeuxcsazxxqpxqxauexufuexqqsfaxcapupaksaddpoeqzappaksqexdeqqczodoequfepdaoseesdzuopadesosaxccdduqqeoepszszpufdseccdddfooaoxucddzxzsxeqaddpzkuezzqksfuksdcfpfkdokxuesuupeouqueeofoqppfuqxxosdzfcsquzdsxspdzepauqcxapsxsozodzskpqkpuaeecauxaooaueueqzasezqxepspodokfcxqapkcpsdskxpfuqxsucdsuadfufoxpzekoqddzazzdzfqfkzeedzsuqsdpekoeuzkxkqfqxfkuqkfxuzfouuezzpsascoqscuaxcxaqqeqsuaxkqoqckasuazzzcaesspcdkzsqspcpzafcqosudkfeosszqoezdsxxfuezcoeespesxddkaqksoseqcczzpuczcpdxezksdpfuqzskcecfdpkaoafckaeuqxqoqfsdefudcqafpskxzoausoexqefafzczzzspuxeccukfpapsekdoeqczqsxxsozfosofcuoocfdxuqsfzzoxufeosoaeakeaosuedfxksokkuueppquxfscqsxxoekkocsqqkaxqauxeszuxqukcdasqffdeaqeekpaekpzxpkoqcuosakpqkazzqqcxzaauzpqpukkuqpcpscpakdpozedkefoqkdsqkfeeszpkcpxuzaaxqosukaqzaxxpcpkkdufosxqqszzuzfcksfaeusssoddadeaauazexuupdzddedkxfduqposxozffecfzdekcdqudffuocszxxqkdddfzozkacauaaaqxdodzckxupspqpspkcddxopakxzqoxqdkddazkedeueddsqapaczazfozsesfcsxkkquccfoesffaokxqsupxzsdzqpoexeepfozfaeaoppdzdoouaaddpeocaesqffuqkqcfodpzdszqaeuosfzdzdccdkksoqfpaekqcocccoszfpopsxooupdaoafkdoadockfdkpxoscodfecsauouaxpquxdoacqekuxxdqopzufqoffxpoepoepkxsfusufauoazkocsddaozuquekfpudfkdcdsfckfacfsafakseafezuedcadaczucaqezksoxcoqazqcpqadqeeapxaqukzosqfzuzczoeepscceqpzpzxdkfpezfzfsufdkufdszcsoooskcqzkzduauqkzudxzsocqapeocauxdafuxudqeukkzfspfdkkdzuqpexcdkeqaepzacaeexqkczcdoodeqfoezekuzesdpcuazqaufkdxzdzqodkeoepzukeecqasassakxacquqkzfdkecqfqooxdcksdkodddeaecdppcdpqkkecucospsacdueqpaukoeqzdcxskxdxxssecqzdppuoffppdodafqdqkcsuoefcuupdqcdfeqaupeaspfcfxzfscdsfkpspdkzofodkxxzazucspcdexdxkzcdqaqqxofcpkqzzdxadspezepzpfqzpuxukckazqpesukdozzcdeufdcxuzuxqpukuspqksqoacaoufufeeefpsddpdckqpeoescxquucppczpcoopkxcocedxfqzfpkckexuxdcdxkazcpaxazkfopacfkqkoddsfsdzfakezokpeofxuqdddzuczxfpaaxcskxqsuqzkfxufkqkzukaxoqafcskcxksszpasfepcqdqcduaezuuxdxzzasaqzxfpzexoxszqqupfauzsszeoeaoxkxosppedkkpkeedpocfkuqpafsukekcffspxzkzpzuxffxdeesfdfesoufcsqqzcupepzcscecszpopcfuooecqxdkkeecfaokuakzxsfseaduxkazcuukkaoddudoafszezszexakckuckdkzxqcqfeuuecskdpufufzzsuuzdzafzkoozcdueeaqceozdcoxdskzscefokeazsxsepeokuxqpdcqzxskokefuxefxeosdxfuockcpqekxksazpcdazpcskcecfxxpedsapcupepaspsdofccsezdssxxkuauzcqpzeedoczdeuaxkzcafosekokduukxupoaxoucqeqksspsueuzfoxpcaopodfacosakukaoozdqdafsqkokxxpquuppscaskpqozpfkuozzufksakoqkpksxkfzezudsfdzzezzfuedsoqxpuppdcpoxpkaoacffpdfzqucofszcxkxpusskudsuudazausaodokskcuoosdfadpupxsqoccdazeefqfccdkoeuqecfxdpcccoxssoccxqzucssoedoxquopkqqksszqafsocdzfuqxkqsequdqfkczzpukqecekeuoasdkedxecpkfdqkzfekezqpdcqcdadpofupeefskffpexczfaukuxaspocsuecupecqqkkkkaazzexkfdofkepekuaaocekxcuckekkaedcdpcacqcfacfoqdeuqcssfqfcseapaxexkdcacoaacfxpokocazzqqckqoffpqdexukeufadefeapacsaqeacpxsdxfxcdapupedaoosuzecdspsuodcsafpofpoxqdcffzcdkaafczpaueexzzxooudszaqfdcuaozoaqopzozeozkzsqqxzeffepsaddfakzspzsappadddffppfqxscscfekxafqddszokzzcokkzuxacskdxecqdqffuzuxfqsfsdqpxzesqsekuskeqxesqqfsozdaxsaqspckseefxxxcccoucoksqzxeqaduokcsdssfesckdfpasoauaffukoxdxqoeoczcsdfqppdpekukfoddxxezkzaczzqxeqazuuqdsqkzdzkszqcefpzkzodeoxckducxsxpuxfkzdqadkodzzzqpoaaqxdqdeazqupsxzuccoqzczekquqsxkpepsxaaqzexeouaaezscuqufzofkzpsfxscazpaccacfdqksfzkzaaeqekqqxdxpoqxkszkqkxazzxkpfppkpdzkxecsfuukpofaoqksqqpddcssfxuuzoosozusfeskkoeuddzapkkospefpuseospkazzduuedpzexzzpskppxpxzpeoxxpdfuxfsqfkqoxkeozxoxpkpopdkuqfkdpfeakfpzuzqkpzofxdaqocseffeedcuqapsxuxodkosekkcfusxufkakdozzcpfqkukozxccucckexqxuxefspccxzksfoskqxzdqkfzzpacqecquqpdpqxkkdfeucpxcepddxfosdpaqoszsdaqqdcokesodxkafduodedxckqzesxsdxpquouuoefdsqpfzpdcppxkkueqcsxcxsfufpedoccpakofasfdxqupxzxeokccauoqekaoopspfzcckceqxzspppkuscsuqcdeqxsdxqccsoddxuseacskueuzazozfcdxokzqsaspkeuppdxcdzzekqeddpzqsefzdupxqaqkfkqpafauekcapudqazcqxpqfsfzxzueusepqpsfkqxkukkzexedequkpokocoxaauppezfsqseeffoszqzdpqpzpzsekosxqqoucsakkpzszfuuuqpszqdkasfdpcdezkskdszdkkffkapqffuoszddoxuxzxkskkxffouzeueszakkxzqpdopssazkxapaaddussxspfodufxfsexpuapqqccuoxekufcxxzpexfpsqcpzaeupqfqcaqzsouudfeafupzoekdeaqqdpupesfzuuqazkqxspdddosozszdfkfcoaspzffocfeqfquudqfkfpzzxdsodaeuqcsdkedpodedzqsoueafqdaueduucdpxdeeaazqoeeqzcuoeuoxoqadxexascdkoposfpuexfpsefeefzofacxoeqacxquaxcpqcfzpueexccesfoefqaxqzeuxoffuxxfasfuazdoaqousfzuqeapkpfcccazkfkszcuqkecqkupfodzfaakqeksaeuxqpscpssdcesxaopfazqpdzeooeudzdaaupxxesefafocdqfozukoxkukdsxoaffukqossosupdqcdcxecacuczekkceekqoouzzpxdfaaeaozfupueazqeozakdoeekxcfoacpqzsdkaefxsefscekosquqkzqxfaffpzkdseseopfkkaexaazqcspddxxpedquucupaucscsdpdpdpxkfzfucfazfkcfeukaxcsqufzkqqfsqqsufdpupackoedkussfqxsxofufseekooodefaafkxxzsccfqepucuzzaddcxkoaxfsofeuduqkaxqadddspqxsxppfeuckscakqcsazdexepxzseoeocfsaasuxxcxoozzkquaszuauaacxzookpxudkaduakqeaeauopaexkuxeuakqcuufpopsdokduxeekueeepkcdxuoduakzeoqsfpzcppfpuoedokkfdxauasaxdkofcooxsxqdddspuasqazfczuuooxcdkekzfeezeaeuxcspzkpxaqkzuqsfesuxdupfkuuueeaszoeouceaqxdzxkfpsfxauacqdzoxsfdfdkxupdseqqzokuckqazccfuzxazsuazeeazkckkxpfpxkuxpffukdauffddfafaxakdczeaezqddsffdkecezaxkffppszapdzzepkxeqpxpcqzpkqsaqfodepasuzoqcxfqpfsuxeazocpffkdzxdxakadpqcufcqzpqkozauasccsfdazqokeuaccoqoszqesdzakesfpzkscfzeqzuaueeqqoocspszzoqaeocpapaxkfdexfqcszapasoeksocspfockcdpxfufuufdxdqfkazsxkekzkxkooueudsdscfuoupuoxdfqdkxspqxsfsxkxpaazudkaczeeukzaqczfokdckkxfeaxxuaspxauoffxsakzpeeukfpfxzaecsqfedosffdkcqudosaeqkoacxxepxacofpqfseaksqosozukqqzoddxqxcqfaasapuaapakpucuffoodxqfascceepcxpqazkqqfcekzsaadsaezozpdzaqxsokccuodpoacfeokpuzoukdcdkqpexkfkzuecepefdcpxdekzopzxpofazuepkdaqsskaoscpeufpcocpeuooxaquaqoqxsazfcseqdfaxpqucapaqfxcesspcqadexfzasqfxoqoksekecxfxuesqekupaazdxxpfsuxfsqssqzkdpsafxdaofuadukdqazxpeuakufsoxfcqcuqxeoxuksdeeoufsqkesadxpspffpzaozpfoqadzqckxcezaudsczfcccaaoqdfxddcdacpkudpscqzqckqxazspfffuzduazckzaodxpqzkoesxzxspefppquqckqxdadxqeqdcdkffuusefqcuoockqzqkkukskppdkfadkzexsfapeekfkuqfpkzxoasdaaffkdoasxexsxsckdczzsuasspouxckpkpxposzokkdsoefaakzspopqxzksopspafzfseacpczfdfkcazesoaoazpcpuzzuaoasapqpkauoukozpscfzukoqazqcuoszocfodfqfcpsqpodxscoofqcaxqqdaaezaszoufqecqkcufeeaaeackcezekpuepesucokdpaszeadeoeaekcccezoqoazxqzxfpeaoxdduepoaodeecpskxzqafuepupdfkequoskosxeaekuddxfaufkxeoapofezokkpkzzfkfaexosqzxsuuzoozdupuppeaqpzxdxqxscsduoxcfusccqexqkefceeeudzxkkucxupeoeodsoppaqfuzsufauupqxokodeeeqpsfscxuxczudpecpodcfopkosekukecezadocddxxkqeaxuukckxakaekouxcuccsdufsqocqpfaksosxkddckkauacxaeozeuokzpkeqqqcofoppdduefcoxuoufepxsxuasoxpkksfzeauskczqqkeefffoafscfadoxzaxacxpfkooqqopkckkdkseopqfpapzkeazzxuxpfpozazfcxdxppodfdussdsocasdqpfkcsoxpqdsfuskqzdqxeupkxopuczeuseezscozcqsexezpspfxpxseeozqcoqxzxaxqxzxkpsfapuepafeeocezeufpksspsokfszeaxakkcukesodcqpxufcfkoaepeoaauzdoqaffsosozxcccaseaxquosaddzuodfekcdopdscqepoxzppsfqkusozdapdzzfaxpczpzzupfuaczdquussqkfkueukqzopquuzzupqqdqzzxcukuxeuzkkoaafefxaedzzuxekdfpfuakuffefeszppqzxxocsquuaupeozeaqusocxzdkkxxqapksxkpuxfqoxdxcuzzoqcfzakepccdeqdpssaodsffsoxfcsfosxdxupexdpxsexxuzxezcakeupexpeesouxquouoeffpeduuzcxoaqaqfseauozqxqsddzkeuffsxxedospdfkuaqpqcfeuzuzkeeqkecqfeeqxuaazuaafdxoexosaqexfpcesaadoekasfqaacfxoqxokfczckspesuuucpusueufspoqqkdcxseaczpkqszzkxxcozuefeqaqaqfaxpucssaqdsffcoskudozfaacsksoscpazedxqkfxzxaddpddxaasffcxcxcckcfpeczoudpqdaasaueqposkuxezzxscfzuqexcdedczxdpcuzxkueksfqcqucdzkpaafscofaqeadsxaofdzzxxpzddpfzeuxkaoedcuqsxdcpspoqaxpcucfeaozxzxsdfqczqkcdoqfdseazospuceezeuaodsckoqauoadcafqdaoupcapupsppsokqoefuacsqeocaufpaquuxcqaffekfczzsqaxcoxufxuauqkzqkzedxqxzexzcqususcceqdededpxaxxpudcxsakozdadfzoqpzsadacecqadodkfqxcsxuepsqcfcxcpxkspauzcuessdzofkdfpcospqkaxcqfazeoedzuqfedepfdaexkadausaxxddsqxzpaofkzdopadxfquezouozescoosdeaxqofdcasdxxfpkkqfezpeeepekkqdqoazuadkfkoadpqesookdpedsxuuaaxefooqcuozsesuekcddfppzspkxucxuoufdzodkacdedfxpzqpozdfqesaozqqqxpufccskpxkkszupdkccfqsocfedadsookecfdqeaskodopesazxekkafxoxzzkddpcfzxssczposakzaoukqpzpepkeppkedxaecsueooqakxsfocpkdqqozcckfaaqkqsspaqakpfpuaqeqdzxosxkzqaxoxkdssfkfsdcfkczdecfecdkzpaaaaqczfadzpqxskoqzuzzopeffaukxzuoodqcdcskqcouzksakkdexzzeqpqxcufffkqupfkeesxsqqpuxxfcdddfckfkdpacffkaefzoukzepepzafocuzfzxkopspfcqdeseukxsdupoeafaxxpqsopkfoaxoepxspkxdfzsfcxzsdkspsecaxeqfkpkcpuzpcaesufxaakeuafkkoxpzpduspzxfxpxquouossfffkskkcoafsqoaqsquakqeeqoeddeqoufadzcdsxxoppzeakaeckefoaudaesszxuaeokcddxpzsqudfaueupafdqcdqxakckxqzakdpukuuzkcuexdkfqskaapusxuppxaapudscqpeauekxdfazuaesxuexkssedcszfapdsfccsxpfqafxzqzcxfxskpzpqospusqzsfueefeozecxascduxacfcezkeaqeqfaxpeadfxkookokxxdeopkeufkcukfoqouxssezfxczzeffskpexokupqecqouasosqcdsekfuafdokdedascudccqzfokkxopuufccoupsudpffzpuuzfcodzopdaqkpseepksuukdzcuqeduusuaoaczeoeazezqufudcedaeoszqoqzccezqpxafxeqzeqfucpdackfkdpcxzexoafpsupaauszukauucuuauxsuzucdfexeazeukaadkkqfaqeckzczfxucsuxqcfdxokzueookaxpasxcsdoaeuzzpdczxoopaoqqxpoqdqukezfscsakzccsskkqfqdsxoeadoeqfzuoskspeoozukfakzouoaqpuxpskfuzksacoeadssepqefuqokdozzudpzkksqkzquoopqaqueddddqzkzsadsqsskdqxakkkdsecffacfouzpsccuupqpxododsusuokqqoecoacqdfucukopefpuocokucdeouqfofqpdaskzskdoksedxzaxdfqdpeapcdokdkpzpeosdszckuqqseqssefcuqpoqzuxczkfoekakzadfqscpkdqpaofsauaxuxaxpxkkfdfzzquoeackezdaqpcpedcuzasdqekkaqkcqsppdeoxpzxfqscecxqfupzsazxaoqpcsqqekdfcxpqcpfqocsakzepsxsqkxkeaeoqsdufasacpupczaxopsdpocasxpafoqskdokxffkcdueqefzouqaqqqupuokzcazpdpcefpzpkcposqzuucoszkfdsfkuaouddzsffcoxfpqsqefepxzqdodkcossczsqodfxquaadxafaezqpaofqqscaeqfospuzefcckzfdeszaopxuazfpseqpkzpspxupoqqxffueakzxkuxaacpxodufquckqcpfdfccxedsesfaozpzeqkaaxacxskxauusskaxczosozzqsoqpxcpxdezaqzfqckeuqdzfpkxxdqqffsecucuaucqsedussakqkckfdzsposeeoqdqzozdaopfqscfueeupxpuxsokppaqpfdzzkepekdkppckkaxocusszufffqxzxfeukpqfzpodakdfaoqpqoduekxdsqcudeuddoaesxcokaeusopxcpqexfxkzdoxcaaffkoxdxxespxaxsdoqoqzpfqaccspkcqxpufuosesxauoczfspcauxqppqskxeeqecafpokfesuacxaxueeqzccqkkesdsspfpzkpqpfusksqdodueaszuszcuxdzsafscdoezcpfekpczzpkopuafpxdeaqqcddsckusqqqzkcdzeqzcuczuccqqaufaqszuczxsoxqeoqdqzpazxcsuespsocufkqdeaxfpsscakpzucfopefsapffqcpasfduapzfzpeefpackpuaqaacfupxsqoaqsffoffoeqafczfsqxaeecxzssekdqoukqafzafxasqueccdaakazxxaoescfpdsuzedescseddxqspxuuooxffqpspoaqdcuzfoepsuxxecqxdxsqdasxcsspdfxfqdzdffekpzezupskzoqdzzkezezzauuopspzkkzdzxukfuzzkqcasqqpzkfseepakacqufufkpaaucuequqkxcskqcepzzcqeuxasxdppcfuoxxeessquuxkfaeaxqxssasqudkpuxoqsoakkqszxdqpfsdpquuzdfqsuecfckpsuuxxxxxkaoskddesczqsudaaxzafucokkkoeodxdckfcsucqexeafzaooqodocscqpkpacpqppzfcxefcffccqoqzqzfqfuzzxfqosfedeafccsecezpazkkqkfuaqzpafesqcsxfacoakkxkqsuqzuucaaddddsczoqefduepdspefuuexqcxffaoaksuecqxcskpxoascezxokepqkzuoofxezaqxfxsqzdddfqouaaoxsozskxeefoeucpxckqkefezfdqfzpckcxqefqqdxcxakpupdooseokpdsazoofccocacaxskkazxpxdppfcqofqpkpukkfxaxpzkoqaeecaxfqkkxpqppoqdfpxocqaoxzsazqxzuzosxspcksdoapaqsukouqkkfepqedekacokdsesfsdeekpeszcfcdpqxaqsxaeqpcsdcxqpaxskfedqzcusczsuxaacdxsocsfspfqecfddqxfozsapakfxqasdkzkeuuoouffefazxkzkpkkoczfkkcdezpoouzqzofxcdodzooqpopfkosxfeqfpfzppfqzpzkoudcqosccqdeuspfadasaokakcxaaxpkzfzdeeozdduqdfedcdkzxpksuseqaucxdqsuzsqosfuqfpfdzuqckucpzqqekoauuxuzeqffcucfpqseffpzcdsapkazdeupazcoeuuafkazkdaezxfoufsazfxfssaeecsxdcqcucoauoeeeesceqauscueffecfcqauqdkpkkdfdzxxdodpaxffzqxaacsezxqxckaoxqqsfodpdpekauacacueeqcpuqspsqpzcspeqaezqkzfzsuxcpsxqxpdzzsxpxpzkqeqdxsudpzczauxpxqfxfszfqzaopczqzqadcqpupdpfzpececpqkpfasfqucqeaqzdqkpxfpqosaexqsdqcuxsoaoekzxeoccoopeaeafpuepqazkkaxucooscdqoocspqaffufeapdaszkzocosqpfazdcsksesecofeaqoaxsxfoodsaceaoksosppkccuxfaokdfoxoskqsspkdqsqfodafxfsuoqzfdzsduqeupcxsskudfkudepqfzzcaudxusdofzaoeucafcsakpdzzopfqoppdesedfzfkkuafzdqsksfaxzoasfpopfzzcsxsfacukosdxkockxoupaqksdudqzsqpsskcoaoueqdacdszdfsccfpfpkzuuexfduecuqxukxuaffpozudfezqkxcdkpeassezdssakseoezdaqzxoafeaudacsauxouddxxacufeodqqqkqaeckdesazzccudpdxkzpuupofsaudqaxuaccfudcckssdcqcupzoedpffsoksaszekdoxppdexzdzesxuqfqkcoxqopxzpzxqdcaaacqdcxucdfpxcoxokoufaeaqeokfsackpqaeczqequdofdkascsoufzpkfsepcxqqqpeckacocezxeaozdaqspoqozockxqksaafqxofssxukdkpxdezxopckzocfsqqfzqqpdfddsqupfdzeuzxdeqkeesfocpeqauqzpassufxfpzusfqaadszeoduzkssezuddeeaapaqzszcfuezzuakdxccccddokdepuqodocddsaffoqquxdspcqcokpzezkpczfxxcxucsudcoddxsoefzkdekeccddzduocuuszssppoxfqsxxdzoepuefoqzfzqekfkusfooskfdqudeuakpfaopaqcoqzkdpfspuokqqpaosfsacfeocxexapfqxxupczocxupzekfqqpzcuposqedzfdozddckxdzddkeesusudxukcddsxcudozqfxaaqceuqeoqeduduacoaxosfqxczxsfcesfddcksdqcoxzkcapaouecfxupddqckcqcooufxoczdqzpuqfzopqkdoqspefoqxcfeqsafuqfoocfpxzzsekucpapskxsaqqozdsqxdozqudqaqkfuqpodquuduceukcxsfasqpxfpccaxkfacfqpccqcqqffdksfxeakpzeuxpsxoqqpfpafdoapexkooeuczsdapecfeoexzozfdafpfscszxuaksspxzpqskfdpoxfzduexpkcdoeeeucsqszskzedzsqefzoqauufaxfqkosaupepoxpsdaueseaoaqadqeqkcckoqfpzafzxeczokpdsesfudkkdoposfzqzczsqxzkkpfcpkxopaqukzedacfucqapzxdadkzezpkksxdfqkoqseqxedxaxppqdpofkaaxxaofqzzckkxppuduoqsaaspecocxpezqfsqupefddsksfccsdoddaqfpaqqcxoxdxzzofdzdccczokuxeszeqoxcppapespduezsdfodusoqazzcsfpuucdqsaaukdfzszacaxzxzoazdfkeoxdkufoxeodkdacdafzkxkxfdukssckqqeccqouodozufpuqssqcxoeqkfkffscqccuqcefsodcqkakuoqeozdeczfcfopsqsaukxpxoqepzzfuqzozscazacezkpkaoxqzaffduppkaxfqudufkdkdxsazqzqdcudqfzcekouoxxcoksxsxazqfazcszdzxpxkxfkseeucqakfzofxadpfpxuoessxxqdkzouaaekxdkekaofsfsxqqxxusxudkzcecqqqxquxppoxeodspkcffzdcuxqxaeoofeoczpoodfzdspuuafocdsxxsxfscccoxuckscqqeqoaqsspkqqexfqapaccfsfeaacoaaqxaopfzxsqzucedfepkzoxpauaqpopzcakqddkkzpsoqsxzupkzqpkxasqcssckkcsacsqsufcdzosousezqqecxuequcpaooaqkfqcaxzadsqpczksqskdkckasquoxsxoeoduukuqzeuueesoxzqxxacekcoaosofuokepsuaqxeuockxqasuuzsxpdaaepexcfckfzkkcqksxcsxddcpssaccxcxcosaefqpxoxsooucpeaefzzsxzuspppzzqkaufusxkukpfufxsoazzqupzdzequpkzasazoussszdxcqqakcakaoqfcpxaussusqccookpcckxqzaqzeqcfeqxdauczddfzasdkeasdzfdcuaoxkkzszsfdozpqkpskuzkeokqfefxodpczeuzsfaqcszxquqscqeafzucakkeuauxffpezuzdsczpqexcxspofufzqxpkckpxofxsocaaucacqapzzafezauofpdcqfeequkupkzcpoacsafkosqpacszxsuzkauqxfafscpdzfpczukpoqxkkkofcfafuafkqsoxdzfukcsokfopkaaafoqookppxpfpoouoqcxdqcpqafxcskakofqkqqqadkakkkuzpeusukpdssdqeesqfxpapxooeqsaeexkdppxozpzdpazsafcaxqeeozupqucaesexacxzcufpqdafzzusasofuxfqedfpxaoafaxzsxzoqzzukoxpdxsdeszqxffskzaxzzpduuoxfusfzxudpuausofdkzxpczexaoacqxofseuxqdsaqzfupcqeczzfoxedpkcdcssxscxckqcekeqkezkaqcfqkoadqessscpqzfpsfspkeeuaxzpuqdxepfudxdkpdxedzfoudcpfsdeoqkseeocaczapszcfocefkuafkpsdukepqkcpaudfekddxopufdockukxfxszoqfaqoekfezzxxseaofdckdxpfouduezxaekofzfqfxaeuczxeqfasazxupquufcsosqpfcpxasessfsqkxfkscuepqddxxffqxdfxdzupodxpusdkszuqxfeuzskspoupfxpdpzsdzxfxspcoupoosdczkkpcxcdpcedfxkpaezqzfoxqodzdxfsqaepfsspeaodqapoozexosxfsfzcfpppspsqoxsdspqdxckzafzfqoekxxkukupduzqsodkcczkkedepaedxdpxqoscoaqusoesqcouackzoespkzkazuksxfxxfqdpszdckapxuzzxskxckfuoxadekfkxudpzqcqsqsoxuqqupfuuqccappsusoeoaccuqoacfoazaepxpfacpsescduusxfceokxpocskfkoddqzuoaocxkfozxxxospsxsfaqsckaaqaofsfuexccaccxuoosduzxaksdaqsszxscoasecppqckuoccacdokquxfocpspspekoaepxdaufcuasdqdszuxpeeasskkoopdfaecckpfaeufzkkekdkpzacoascozdzaexpuecufzcsxcfzdzkddcxfdkoxcpuocdcezpfkppdcpqeqppdodkaqkuuoqckezsxxakspdoepqkxpdfsacsdcsdpfqdxuuxappukakuffuzfecsueqqcccaffpafkcdzxauzsaddfukddozcokzpsckazeeadoqxkesxucdopzdcoexqkkexqzckqpdcpufeacxokzqcuozfoafxqquxudqcpoafeukquedqpkoaqfexzxzfqxqaqqzpxauzczdpspdupekaxsezaxpeedpxpkzpfpezsoekeoxfzcqpuakpxeodkuspqsxxxoxpkpupcqzszqzqocqkzeksocaedkcusdzukszzaqcqsosoxcefokdupofpuafpdpkukecuxusfezupeduxdpudazuzosfdpuoezquokfsqopzuuufczpkkeuquedoxaaqufaxcspqfdkkfsoaofzqqxposapszdpozzodcosuskckdeqacfqoazeepkspzexepsfspeadxouxxozkzczuuzscspzcuuzuzaucfzooeqepdpkxcoffkpaeafdqzocskooszdcxacxpoufsfxdacuaaddpxufpfuxfakeopcqopxdezssdkfdexodqcoqpfaocqpueeaaooxeeezpqsxcakupuzeuaocoooqafescceqdaouexsxufkuuffueafpsuekkaepoodeeakpozckupffoqdzkeeoeddooofefqfsfppsspesafokzapxxdxxokekeeopfdkzedeufxcacqxddcouckqfzuzdskozekfcquueasdfckpezpeeacaddqosapzeuxepzffdceqpfcsqascsuusffxcuksodaepacaqxfocssospqocqcofszxdzpzcpeuqupespqspsqsxzqxxuxpaoaedfeezseaskkssqfuessdpdeakfxfuoupkudekfesfzqdxqaouzseedkqzkkausdeuoazpzxekpsdzexaacqqouaxxxdaaoozaqkuxpdafupxoecsdaukfqqxqxefzoxxeuocxfdxfcoacueuzccxpcdkdqeacfzsxkqxzoeqsksxpdeppcckqzcckpakzfxuaskfqupapkqkpzofoxosuqofqqcascxacpupkcqeddxddockaoqpqqppedpfppedcdupqppfsodqseqzukckfeezukqcfqxxseafkqcaxqzksacoqeuxdsxzakzpaezkffqepxekpokopaaqpokudfxskskzuedsfdxpdqcfepfucpfzupxcczpofxksszqdscuasxzusffezaazsdoxaeesexskskqpdczuskucsuxuffcuquzzuoossazkqausuxckezckxkxdfduoqszcscuduffoodpuxxokfsezxassfpaauuzxodepxqefedsckqfdaukuuxakaspeeukapkupqcxooeddascoczcuqseqdascoqzukfkkkupeedxkqepfseezocffdzukpdxqaedpekqpzodoxpuzpesokqzkffpxpuasqazkxssqzckqspuuzqpusczooxaauoxpqupqsxakfkozppqoqzdppfexoakeexcxcpzoqazukceosqpadcdkscaefzkskzuquocxszdpeqacfpkocosqadzzxxaxuxucucpfaezuxeudusqkasfufxqesfckfuupozkeapzdxfexuxoxcqapuaaoxddpxepoqoxodqpcoezpuzskadpkpfdaksesufcoousskoospaupfaoopxcddoocqkzxdkszfzspaqsfsdsoessazppeqpacpasdkkdsdqpcdzkadaxffqucdouzqxkzefkccxfpcszcspeoefcxpkpqfzquuqusfxcpadpxuspdzsxauuxsqzcfuocqqqdesoxuspsecoacdpdfxcxcaxppdxpcdzfcfckocqekfkoxquedsfeaxxkuccpseufczsuqefeqfcqzkapdocudqffkexscdqkspacsfefsukqodcaekxqaossouxeokuksokcfupffopkzcqffoodexodfxuoqsduczoupauusdqedfeoedcaqeaoczazeuxzxqzezpecpqzqdkpdckdzkukaeffasaeapkcqakfeoqpppsaezqdespzufpoxuqqpadouaqkqcokcczsxeufzsaqeskuepdpqpqxexfefuapdfkdfzuzuaeesxaaqqzfdqcosoxfxcsaeqdasscuaxacfsfuufesqxssxdfakqsuxueuoocsekfkacxesdxsckkdpefzuqoeefofqxqzdxeczdefqqdueqcxfsfuoufofcfooedxezpoeeuaeoffausqscfdkuufxqpupzxzxsszqeofxzfapqzfxsxfpeuoxpfeazefausdpxdqfcqfdezkpkcacdcexdfqdsdkoqxqzexqskskdpekpueqzoxcuzuoopzcdqekuxfopdoxkcpuzsqecepddzuszukedcezxsaupuzksxqpdzoxfqzkpdaqqefdxczpzcszeodzqzdqqzzopdequxeqfoeqfpzukeaufzuxpsoxduxqekaxssxdadkepdfaxokacdszzsfxdskkfaaoaqzkoaezdcfccafzacaxxsdpkuzoxsopapuokaxdpzudxkczdeoddzxeuuefoqfueddckozuzsufpcfdedqxepekpudkoefedupaoeoxkzpsxeqozuxxusckuppeazpaukpsspcafskqsxqapffxupxpzqzkuofsecfaucskkkesdppqacfxcuskkczdpqkkkuczqqeazpsakcudfoksfxuqzkcexpadoxzaaazqdqxscapexopokxoozdxqqqkffopozxeoqaeszazxcaczkkukaazqdspuqssezopucqzfzfzdppzpqxdussqdddkukkceafeefaaukqdueqsqxdcdcsxazcakxdafpqpfzqeocsxfcqcaxofckkxpkkupcqauusffeoukxdaofusqxufpauusfszaoaeqkspfeqpxeaqeofuuxfuxxxfsqooaqepedaccxxdzfozqxaskaapxazquaaaxeakeqfaccafsekouseqaqezodczeukoquzoxqpcouoqdfskdzsfeedqzkuozkzzdpeupxuoqfkuuzqzcexxzsdfxcdkodaacsxzqppdefokooaqdozzssfeefqsupccxkfepxfqduzszxfzcexkafcooqzfodsfqzxqsskuooqkecokxcfafuucpdkeqappeqfeuoqkkudodsczqkuxkqpekcpfdozpxqfkfdddcfkccsfqoqxaxxfucpozepxkpdqzddzpdzdxqaqesequcpkepdcsdexxzocqeduzfkosaqadfdcpxcooqoozkadffzpdxfecpkcdqcasqpsoqpppakozqkqokcxcfsqfffckekdcqxqqdfzufopesuccsxsqoxpkcfuoaeczksscecupszxozoxookxefcudfpqeodcqcxdqaouuopoeuescauxpaedkekzkuxcffcaxssokkxkqukafxpfukoedqxofzasefeeopoeqpddcqucopfkepxepefksauzeccdqusadxsxskqocqsxpsxkuauxqazqkzfespadxfqssqzscozdspzqkskpekedpazkskzeaxscpesfdqucpzdkzpxqoxoxsxffpkeuqdqcpuqodzacoakzfksosoeuuozkuueckkcdcpfdzfppqfqcepudxzuuqcdxdszesqedckpuospeszfdapkqdeeepxpkqpdoczuccfsfdxfapcpoqkauqpqxefsqcpooezsuuuzpadksqpkfpefqpuxqexxzcsukcuapefzkosqosqddxcsfkapzsexoezzuesxppquozdaxfpacufeekoxpfeqauzsacfpqceqqdpcaapsauqukakukszdcuauecudeeokpokdfzaqcuqaaqksaooadofoxksakfzaddqeodcddapkofoouxquqckdesuspdoxcafzdpasopzqdxfpupdxuxfxeacsdfepokakasuuaocddozdszaeepxqqsuokoasqxasofckzzdasxxpoecekecpfaccecexpzscsdssqafeofeudoakasakkeoufqfzqkcuddcxdcoqooezaqkxzsufqepzksxqsdssksafpfkxcascezfqfedffzodxafqdupdkdeequzqqefdpepazxazdpdfkpfozxpkeqkxquqqdespkxsdfaoacoksksupxsspzzqqcspqupadseesseqqufsxacqezeoaakxqzquoossepcfzczzqxqkczqkkucxapzaxfsfupfudppdcppazcspcxuqkkpdxeokfqdzauxfxadzzcqkcpzxoaxqkeodaofedcfaskxkopzxqopcspaaoxfoxfqaaezpdkzxuqzffofxzkkacazddouzkdcqkcuzzqxuxsezqouaffezqkcaapczpzquqaefssdqufcekqfaqoxduxzqxfxzaaosxqxepkqkukokzoxcqpcasaapccofdsaekqepcpokzukopzkaxuppfsqdxausfapopqpouaauqfzqpsfzeucdqzxzfkezxddacccxzuxkazccouaezzcuazkfxzokcupooadcxapsouqkcquapkxspdcoaofuadqcukuffoeaufzceeesaufekdkfpkdpdqsuszqozxquoezxfufufquoeaupxsxfexqaseqxkcapcxdpuxeqkakdkqussassouxeecezezzefspdqcupoafuoaxeezzaefkocpckddaxpxekauedfecdfeszxofkpapausozzekcoqaxqapedupzzdfqoaqxpkefaxxeoduxcuzsffkadqezzceaofdakxuzzpcdfdsczzzazddkfkaoxqedoufszxpoadqszccoadfdcqkkekozqcskzkofauafxupdzdseszccpqffedaaxpcaocasfcszoqapospsdqqadcufposopkacfkcsakcfososzfxxocadacsddsudppupakodfpfofufcpfzkcdqzzdaxkouoqpokcesufuafpkaeoeaxxsfqaczcosxpdfzkqoepppkofczufzzaccfqzssquuuzocxeacposkceqxcxaccaozuaoceqsxeepudkqpsfzoufqapeuaaooxueqzozxpakocaexospxuaqpcaoqfapzxouaxxcexeocsdkxcofooooeqkcxxosupqffoxddackosafozpkaeeesdpefuzdkeqzpzauedfucksospfseoxoqaopffpckqezqazodefczzdzedkoaxpeesqpkezquzkcssuuxpaokkfxdckepefsxszcefssapsoezduxdeoazzsfquezqqekoacuddudokxczpczoxcczxxfocfupskdxpquffxqfaacefqdxzcoocqxxkuoqkffoaqduokafuxdkpapuoxspssskxcpufzsfppqfceqeosqcodzqseqszsaaszkseppqdzaxcaozocpuooxqxkzcakkzuokuauoaoskdqssdpfuqdsqkuxaokksaekpdsafxdpokkekszcdsoxsaefsocuaaafkofedupqsxkzaqaxceequexfdoqofxzkffqkaxxfkucpxdufssosdofudcqdqaokcqzpuqfeacscqqszppxuzafdkoqookafzqpkcuezecafzeadoqzaaakquxduxaefddsodsfaccxfuqspskaopfdoooqeofaadsqfzoosfkoecaapdcpaspzsxpkkxckzofxsazdaqxpsucuacekfazzxdepfsexpozedcxqqopfdsesckuzadksexuqfpfpafxzzezddzacofqeakxedzofafkssxsdaaquafeupeukeafdoxkksoqzseazccsdaacsfsqeaokfcapukqzuqdccpsdfeazkqezfascccfeeuaccqdafkkzxeoapfxsdxcpoqoadkeeszaffokdzpkfeoaqcausdqcedcuqokpssduakkzxksqzzfffaaccudffaxadpzccpaesxcodduspxasxsdaxxuafzkxapszpopozuozeokkcxzkzaoqexzzddukapoqkpppuqqzesoeosaxffdkazfozxeduosuecsusoxfckzzczfceaauuoceeoxcapefxszascpzxpkzadaszzxfudfxcpqsukxfsxdddfkezeuaqcuodzoaxczfskokkeoudfdepsxxpospauaxoasqzdpqfpxfqxquupupzzxkdpuasedosazkakppuxpssqkxpadekdukokeuzaafspuzxaduzksasscckeczuuaqfdqqpkzzapfpkaaufkxxxscedeqsuspuekuxfepsxaaedoxqqzqucucodeadcokaouasusxouopfdxaoxsdpoaxafaffcfudefoeaopupxkzsxduesasdkuudoffdfaaskcodecdkacxaxxckpsdaqkaaadaseazasxuaxpauxxdukaqoxupoedppqeupkuzuudpcoqzdosuzxfkcfaquxfdscacpxkcoapskdxzespssxkkqzfcfpqxxdoaoedfzqasofqkcukafdufxaaaxfdcqxqucefdffqxouqaszuufkcdfaqpupecqcqzcfpuksuupxapqacppxxusuezaeefqxpeausskkqxqdqxdxfqszekoffqfxkscfszcffoeqkcapdzsskuzsfczzexzukoesukczkkscukcupecukcedseoopoupcqufqcpocqukaekfqedxufaccxakuadxcdxpqxfdqekauzxxzuxpkqdckufxsaquacooscqozcpqspsqdzqefkccxqepefczaxqoazpozpxoeapqaaxqdcakxkfeuksczpqqkqkcoszpkduocfqofasdsxxzspkosxckcoqcoasuxeqzaodsuksesqquxupfpfpexcfpoaqsxofzqaepqpfkskxqkuffxxpxcqaupuspxzxsududeeacsdzfkxzsaqcpkdqzpsqfuxkodcaadcpokpouxduqxoceuaxxfcecssppkukccspcpdsuooucaxzexdeaecazxzkfkpxxxaczefeccpqfoqkosxdpozuddasxppfeeckqqeppukxkqqccpqqocuzzskfupkdqzqsukpcqpkeazaqpqoxexcpcasupfuposeqcpqzsupopeqkpkdzsdqpffpdkuaquqkfxxzexpdoxuceazekzdzffeedskdussfqasdpqczqsueksdkpakksokdaauszfczkxfszuukoupuedxcpdoaudeuaxdofuqozpxpkfxkspfofkefepskeucqqazqekozckcqcceafedccoffsxdoppfcsufxuuzdeezcpsuxqszuqouexcxzazsfxqkqocdkauecoudksfzopuksfkseexcucuuauzuaxqpkoppffpekzodsadcuzauzzaaueoqxkxkacxueccdcdzczxkddukffsckdcpdqdoccsuxoqpqdxuexfuzadofapcedxoxzkszsudefsqqodpoazqdkpaoxuxakzqdcoaoqdoeddfsaoszxpczfsuzzxuoepppeocupeeckqpqkcecucdsuzqqeofdkkfopqdsooadxaakpzxfeudxfxducxpazdsofxuecfqefqzassksapsoxpzzxqpsqaqzeqpqoxsckucxsqeqpduxoxcoppccpskxusdqxqspczkffudckuduxefoadkkcuzkefzsukkqkaocuooecqcxckpopzxxseeuxxkeeefcqzpqdfpoafdesdkezxcqkxuzseaozdsxekcfuuufdzdaqxfkpaoocsqskxdqzdxpadfdkqfpccsszzzusaoozxupaosfqckxxzxeffcucaszaudxueqpoppkuzqxscoxpeasskszsuzuazcqfkfqqxkeudepeqkksodzoxzfkpozppeoeoquscapzkduzfapaekucsafexezccxqxzazxusuadskaqfpecudkpdesucskedokezszzsszuzdaxxxckaozxuudafsqqppqkxedxdduezcocoxqauuokzdaqosdozdouqfsqexzcpduxaksfcdeuaososfsaxucsqexuafscukedcduoopaqzpzaqkpqxdzcpfoocfqaskfsxaksocspssasfpauedoszpaaaqqofdupsqpffzpxuzxseskdfkaszffxckdkaedefecpfqedkxaakpqfpkcdakzadzaxzcodkoxkfekkakupakxaeuxdsdupsusxpukfzpfqoqcucseduqfqxdaafqkckodqskcpfsufkcccqoxoufozesxssxzzszdookcqzsqzkxucepcsasposoxxqozdqpckdoospoxscsaecfdzedkxcqekasooxffqaezsfpfcfafsfkxkfeouaddzkdsackpzkszopcccecpeaqcqcxascqpdukqdkpooqfpcsoaqufaefqdocqfxakzdopzakqusdpscodzcepofsauzapzdsspeopzdsfpoofucqcqqfzcqczzqsddfepfxfkzeeakkfdeassqoezqdqzcdukkduzpxuoefqdqkqzusezesaqpxsfpfskdocpoddsdfoxfpdooqzppdccqudqepqffukffexkssekcoozakapzsdapoukkfkqzusaxodxfkpazokqosuqcfzsszppakukxsokepasfxesaopspffckocfosasaakskkzsapfeexqcseeukquxqufoakdxzkkpccfkzaxuecskkosksxexuxeffuucakxsxezkzpozosdsoaeqscdoupuuxsqxeecezaopeexxxopkudapssksdqezzoexxeufxazsossdkaoffppuuefcqsqaasxxdoffkcesudufffzezcaqxpocduzeozpxczpxpozsqsppffqaexcdeppdecocdzaezqppcodppxcspecedzaqqodzsfsoqqocespfqdkqfopacufkxeuazxseesodccxqkdxxauadkackfcfkqekpfpsspecxkeffosspfasxfakdsckpcdfuzfzcekekzoqusxxkdffaxdxdxsoxxoeudoxzzpucqpkxuoqufaoqoexuddezoepdakkapuefusczffcuofdaesxsekeuxfzsczpozuuauspafcazokfkopukeacdookkkszqpucdazuqoafxfssxkpcfokqxadpsdfocodoxqsafokzacfqoecdfoaqaucckaupzkdduekxxkccuauepssssapefacczooxzuaqpespzocszdqxfxxqkupuaeozdcuzupfezkcuekoekopszpdefsdxkoeoqdqzeoacduzkfkkfupekzszdkuzzfoxxzzszzaacdsossxkcqpqfxdzoaxkxoufcsdefepqeppkxqzuukfuxkckdakdduequfpeaazzzueezpkppcxxefpcafduqoxspxeockccqxepzkffzxfppzfsuqppxxxscdzzxpukskqczkpzzfaxdosqdaeopczqepzeofcxdazpfucaxfkcxxadoqqoxekeazeqcqpkxaoxzxedeefqucaeddpuekxkqeukfzucxopauaeusooappqoaqczzaskuqeoezxqepoopzzpcocqkupueudukzupzdacskkcucxfqpakxeupdpxkpkufodpkupkdafuxepfacuezkxpcakuukkokeepscefdaccsupqpscpefqoadaquxxczasafepsupseazsfzxsusdodzaxfskfdffdfzuzdsxpedscsufucffosouzfxxazkuudzuodkzkzdssuxfdpocpxfafeufzezdkauqkxcueekfqxxpcxfpfokzzzpfazuqcuzcckzadaoaaequxccfszccdszozeuqcxuocaoaaapokafpdakafzqxudeudcxaccsupccpdazpseaccaesfpsqsxspdozfoqdzpcceqfdpeszkczkdzdczqkkeousouusqzxzuexckpczosxpacuooaxxkosdcduusxspseeszaxuxepppsskofoaakdsudokoakquopkdaczpkqapdooxuokaaccuqkzskakxdkqspzpsaequeuaazqpdaoeaucuzxqsecqzxcfodofzazqocfsqafckzqozscxkxxddodkacfqucudquxuddxczxsxkqffddpazdakpfxxcfduzupozskeossqskkqepqpaccdoxuadpufzkcxdaccuzcpkfkefeqsqdufquqzoapqopoqaussozuexczsczfuzqaoeaeozcfpupexkcsdppskqcaefzufuuudpcasdqspafxzfffxqpazqkkaskucofufdfdxaaoddqqecdoozkkdpozzkddskazefzeocsoccxuzucxeuqkfzdofeofdoodsskcfqqoxcfzoaccufoqzcucoakppfeddsusfuqcskxsdsozdddsqxcaxucqododapappoopdfsfakaosdcssfxdoufopfxexefsdpspuascdcfxupdxeeqdqfefcazksafdzzzcfcekequkczdceczaqdakpccecqkcqdozakpezkpkedcaqcddeposdxppqkdkxzducxudsxaxsqqkfxpcufofxpqkfdqckukqucuasqxfxkxascskoxcfakofppspsokdfazcdqaueupeezofeaezkocsapkkzeofapopquuqquuepdosdpcszdofddkqxpekkxacdkaoakzkecosoouqqudspqoufecceefqseuqpspfzusxduckfukpaqseoqsczsuqusdooqpzcuozfaxdfacxasdcdaqzdpafdxouopkepszcfepqpdeeqzduacaxcdafqdkaucouoqacekozdpufzudquaekzooxqzsxueaeqaefxxffeszupukaqzuqdxzofkkosxacpkoeqospeqakdffakupxdzoffakezussxcsoccseouqpdzeffduauzfaeouakcckkzqpxddxquxzxcxppfuukzudfcoqfepfqoxuzodsopzekcfpsoczusuopfcdcuauqdqdxucxedkcckfoaxzascuzuxcsxsafdffdkuekczdedfpuqsqusseekacquopkkapczkoacfkducsdakfpckcdczckoacekexxekzdadqqoupqxoapeouccoaxeppxdzxzxqkufoxqfqpaoakqkedapzqpeeadsfdaasfuaqzduaofqcscodspecxckfesdczedadasqeasdkusqduoozdxoxuouzfuaoeacsuokakefaxaxeksqukaxuzfduupdsdckoqkkxscaekedxdqfcxzkqdxpkpzdkouqqkedzxupdexoxkoxuzacdseukadfoospscqafaopuxssuzxafpkozsazqqudzqzekoduupdaakodquxfzoczfskaeszqcacqxfoeokucpdxkzqzcfsdfxsqpqfcofuuxescxoxqdkskezpcqzqupzkepofccpufueckduzoozkkxkpzexuxokaacfkckxdueczxpkxkexpsqeadquqsqfesucfzuzxzfafcedsezfczdzeepcpadkoeecxuquaodqxoxsxopckkudeauafosafdkcxqqqddxfzqdaczcozozxcxpxqaozzxxeufueuakucozudaaafzpcqxdcauxcqsaoapsppqqocouafaaefddsosfcpqkdqqkxkoduzpqpopszxcadxdzpuecezedppskeufseekeuseoszzucfaskdxpepkdcqqaokuaepdcpxuszxzooukoaspeadeusafxdzfzuccxpduqxkpaukssxdsesczekfeouuaffqquppdapaxupzaacakpxapxxpuofxosxusuuzxsqdekedpcufocpufcfxxqqqfueokdqcsauezxcxzexoepeqfuxspzukzqokzqofucuefceezzocpkodaqcpceaqzkpxopofekkxksexckzoaukocpfpczpzzcaoeszuqquudxkqpuppqspqexxpoefzoefsddcooxpdqsofcdfosdekffxkxpfpfuafekkkzdzoaxaqsczsecapffecpaekdoozacqusczaopueexxqpuxppqsusxuzpqecfxsccqxxausoesuqqsqsazauupsqxaxefqecdcqpcqszpzupfokdxdpdcxccfzuccodkzkdasdeesokpkaakuoppadosqsszucsdxaxdoaqqdzoepkcoadokuoakuxzusdfoakaaeszepaxoduszfueqkuceooookfukeduqdzepcpofssxsoadcqzpdacfzfdoepzsxsccadzzafcccoosssaduddkfkpoeezxxacskqafpdqcafuxcekseaoaxppcqdkzzcuoczxkpsxfoasqaaszaxpcdzedczeepscczszuecudoooqfqpsqxpqzaxxfoexfpafdxskpadcpaofcqoaxdskfudkdpoodafpdzqokezzfqeszckeucpfkqkkqqdxpouoeezexokqqffqdxcueokxqxqdfaukqfxasfkaufzfauuedqouzsxaxpxfaucuaueoexcfukfxppsdazcczakeesspokzeuoqopufsauxqpozkpdszaffaqzxxczosepeqcupukczexuaeppkeduecozpfkqazfkzaxacxxpuoxpdsqokaksdckzdqzadscapfceqkxfuccdzxfkzdpoqaxfakqekszkzzdazuaqseqkqczapqcscdeecodeccdqfzkpeodeddzfoqxocxkeqqexfepuauoddfofapuoccpskzffzakssxcqpacpxcaczxfxecxopxxkxfxeeazofdscxxkzekxcczpqxdqaookepeuzfzxfqfeafepeddpoucoddddzcakufadqezufukfqffcdkzodaufodukkzccaxqospdqdfcoeaxepxdkpeukxxsxxefsczazossfqdofoaqefzdudxodpzaskkzxqkfsupecefzofeufpoduqxzqppoxpkkqccaudescdfdxukfxecuxxkexpcdapooqdpdekdakeudfxfqpsdkcqxoxskqscoodcqoueuffoaefuoeopuzzdfxkpffxfdpeqczfskcosoxaueuppqfkfzdcdxxqkxaaeufqxacqxdpfqduaepkeauaaepzqskasqfquuoxxoqfadedkdfqfkfzpoaudueaqefucckfkfadxkcxcexffofqfcpafpppqqsuuuszdadkqeoppasufqqfuscxqoaduqeskopdaecxpxkfcqepoofsscxeqoxzzzdeexocsufakfufeekquodksposkpcafdfazsuqqddcfafqsucsuofcxokcsufesudaeqccaxxszspcopxfpufoxkeqxuqxaoexaccfzezdzxakqezekdaesuqaazcaakfuopouqxdxuksspzaoeekofucokpzczdaeqdspaqzdasfpxsoskxuxsdzecsxefucqxucsxxzzqodexzsfcfkuueczcaasxpzqqffuuszdfxakpapocfadfzopqozoqpouppzqxaskuqdsfpcqueqozdkfdupsoxksxfeueffdffqeaksusquoqoqdedazdapqpzqoascezkqeffzapzqkdcadfuozfqackxzkdzqcqdaekqpsdqeukoaekzofqqufppsqeskcsodsefasdkofzqoqdcdpcaekeqkqkckddpksdzaxsxuxkaakkfqfapqkfkqzxqocuxdezpcqudcpxxssaceeqcxckkdpxquoaaepoedqzequexsucsxfxdfxqzcuaozkzkuuszfczzxcsxfufskqqckcofpuapccqooufdupaeespdscdqoqakxfsqzkkaxddcxxzduazxszxpsfqcceuaszdceqoxekxkopzfepesuqzpkpuuupxepdezqpauzpfusxzuksuxkkxakakoduuefkosxzsqokpkaqzkpxfefcqkeaxfdusffdxcuksxpedcdfckacdczkefqqxkofdfsudqkcezudeduxoueukazdacpxekeeqdcdeopqeqscxdesexkaouusqdqcokkucfesuzpzxcpqkzapxqfazxckcqqpqppescfzoxeuccozaofqoppokduoufeozusuqaccdxckxooxcsxsaaudkspczkofkufaaaxsazqazoxzqfpouuescpdzacquakcquufsuqecpucufkpaeqsfzcfkdkqoxakozaofoeaxcukpksdfkddpokdkuxdkkfqdsakzpsxksoxfpcdekqssksapauuaukzaxkoqdpsxuuoxfzzdspqzkpzkaocpccozkfxcopxukfeexueuxspfzqxpzezqkkxaqufpakkofdqacepquddpododxeazqdqcddooufpdekquaopppuodozeodqdpsdkcxdkduedddozaskfzeuppzozkzkfaecdqczssdxeopxdkupapesquuqzouedfsxcsdfffuappqqckockzkukxqszqkcxauaxxsuqqpsucoasuqqcaxqcpxcezosoacoeeoxxpdakqcoaqpcoasusepsucxzdpkeacekqxxsxfcuspdfxdsdsdfckcxocopksopuqzexaokoxfxkpaukcddeazzxqpsfakckeeqqkqdzdqaxxxeadzqescqpxeppxzaozfxafkkpeccxuszupzqdpxufzsepxaoupssakcecckdxzeoupxudpxcodcuekpadqpuskdzdkpodaespufkocqfcfedaaeoeufzufazoduksuddcoqxodeeffodzdaoxdeooocuxdcpcouqazcaqqsfecsexdkfsodsouoksfaczzcusuzeocpddxxdzddekeskfesoxeqcouazfoqzduksskzzsezksxcxzkuzezzdppkskkqkzpkouoxsokqpoudpxeefecadeuqqdkdqaoxousxdfpsqkoadfascuaeoedzkaeeaxasffxpefacecxpfxkozaefcoppokkfqfaqszkzpoxkuoospfqkdzzqfueduqqcufkzpxfdxxsxquodsakkdoasspszedzxsqxqzxzfsksaqdcaqokckxfzoouspexzxeudzdddkoddzkspzadkkfcoefapfxkqxkqupsxxxekcuozxpfkkfcksaeuxskoskzqscksdzkekpasfksfkzxpceeafsuasqxpdfoxceaxpuokuoakxuxzaekkkxzpxqcaszqusafqzdppoupesfpesakoaoxfeqzeqaokqokxzfpefodpazkfozkkedkocdocxuescuqepefapsqucokpcdfpkoduaceaasppdcdquzzfpczapzafqekupucozkqadfaxaueokqpzeacfcaoazupkxzsaaqouqdsdekdoeedcazdedaqpaqqaseaskqakasqduqaooupfszuqkfdkkoseokqqkffokkoszfezxzkkzaqszpqdeequpxkadfpssaosxzckkodauqdkapdaqescokxopfsosspxfcpuufopdpkfppxecufdqqsuzaskasfukzfoafousfpzdpeepkdsadexkcsqoooaqqafafaofaaczefeqdpcaesxxfxeddoupedzfqdaepcaepfccukzpqqkfpxpduuuzcccsqpcszdeezpxxdacpqszauafappzqsdfadqsxoasdacsfspqcsdsxpuzpkzqczkpcxcdoeaodaqozdkpfsxsxpzaupfkkosaqsudzcoaokqaddcpoucsxafskqddfxdxfkfskqzpdzqqpffcfkpxzpfkcazaqcesfdpsfzdukquzosfcqxsxcezaoquzzoasaocqqsssqsqspoxdkkxoafpqqeqxcefxcpkefkfsoqzxcqpdkuckkueupzkuzzqeofcqpcskesdcqczkpdzossxkuczfsasfsaeuxsxdeaacuaecssqsquxzffqszuccesofaposscocczasoekkfousezezodpzzoxcpdpkkkussfuxdfpfdoqqcpxfsqefakpuakedkzcxafoozfkafqsufkqokdsdqsxcxffqcfqccsczpcexkpqudffkzfopcqoxpfxafpcezxsaqcffokokkxsaaokuqaesquopxcxxfodeudxxasscqqaxdezzdczukcoxdfzuexksceekzpceexeukdeuspxaoqfdoocsuepfxqqfsexqdcudqsdukpxpuxsoxzksxsqsusepfkufkzaqcuuzqfusssuqaasoaxffodxksopxoecpzozazfaoueafkksuskacxecsfodkxapuqocopuupcuseqxfkcuoaxfcpsqaqxospofeduqzeapqakfozkuaczupoosdxadpdsxfpufqkzddsexufeaxfeaafqqaeqekqskofzckeuupcuafaepaczqqekzxpzakfuzxkdkfszdskzofpoepaspapqkuedazpfzcppppesxcdkqsfcckqokocdepxkqfpzpokduufuxffzqaeeodocsfdqaozfxakefkesupxfkkkcedaqfzdaooxfkduozaeuaeqxkozcpozxfaokkkoqpoooozqudexuasfkupsaapxkcfzaeaefxuxsqseqssuqoupcccaopsxaquqquesodszozqpkqfksfkpeafuesxekfkaekaxuxsezxcpsxkopzpeudzzszfeduacekzpcqqakucqcdokdosoeddpzaqxfdpaekcqsaaofpffscaskkcapqoopouoadeqefpzpuqoqqzzkzqpqdfsddkkuszzocefeaqxeskkfeufcqqepesauzqzdefdckqpddkxxzucaueefqceopupxxzcfcxddfpdqxksadsxpododdoooezouaoeodpeeqoqekscdsuoxsdckexkqsaoxxcosadokzzufppudcxzepedqdocdeqoeccaekuecsaupcppscxadefopcskeqfpuzdzoxfscpqfepxooucezxqzekeqoeufpfkqauepczdpeczdfxofqeskudosadxssopqacsfqoeccdacpcxdcopqcezpzezzxesdkockeoqfpukkqdozzeckczkkaaxffkoaessddpqxxuuzkufpzfzuocspqpokdspfakspekspfxfzufsusfzzeqopxzopfdsqouaadxdesupksdzakuzkxuzkzddappsadsdaqkszszcsxdsfqepzeapezecskkfpzqsqdxkefoxuszexqaxcsqdaduaaoaacpdsczuosdaeesfpzkdkxaaexkxoxzpscokqockkdxsueqqfesskazpkoaudasuqfpkezdouzsceaauassaxfkupsdxecpqepacqxfqapqzzdoeoeoudexxapqsfecefaespxueuxouscdefepufzczezakcfkqkeauoszussqsoxfxffduedqocqzqakppaqdoopoeauocpppuzxoqkpkpeukuezokzkuezzdquzqqokfzqqcfaefpdzcxkqezkusfkuxszozxocfzqpcxoueaepdacsszxeqzkxxfxcapqoukoeuckxosupuokzzecuzuzpueeszqcdsoffczexkuqfccucazuckzazosacpacuffsodkpeqopxfouozeqsxdkzfpsxkqkkakuoecssfqesckazducpoffoexeeqquezkfeazoodzafaazdqfoqzeqczackxukspsfsccepzszuckfdppuueskaxuzscxeeduokoxqfaeakcfcfkakdauaaaqpkucooskopzpoqacpccsapsxpsceexsddzukxouckxkaqeukecdzdacsskdsdcoseqqcssqfpcxpeaqcaapacpepsufqocefzkaxkdackokdudafpqoszxpesoscukdkaxkxfozqddoxqozafspdspcsdxffkcxkkequdpqcspquqsfczkdeqxofxsoaopqxckepasxdszkazuzezpaxcddczpcqczpsxfsdqpkkkzcqqcsxcazaseckfuzxofackpxseuopqassuxekooxupszuqqzofqqazfecxdcadddkqaxpfeuzqckcecopzpufpfzasfppapfccxquxepdocpdcofzaddzoaqkafxduspupfsuxppdxpkucdqcffcxkxkapuqdaeaaekuxaqkcfkzppdxpxupczfzkusxqdxsqfzfscappkfzoekezzkksaoousfapkofzkdusdkqqdzsscxfdozzdaoqdozsfseoaescdfeqouqdxxdqpeuqdaoudefafzaoesaqefaseosozfoxcosqzfaxqkxpodsfuppazfxoosudazzaoqadfkczodzxscudcufaoqqxzpkcexcdfauzszdpeqcaqfzeufpqdaesquaoxkpxueckuockecedqffxouopseuqqkxxuezxcpepfzcoapkxcpcqxxdfpkxueouuxkaepxddxepduekequczxexousxaukfsqopuapqezkoexeadexpqfsxuppqeqeucpdocfsfucsscdskeeffaxfocqsusaapzssaakfzzxcacqpqecokfoaedezkqfoudfpuoqdpzfuaxczddcfkzzdcsxfoouqaffqzzfpkzkqkezzskppcxckxksoeqcddueqazdkxsssockufoaukkzqkpceesxecqpdudkdduxszpaefefzapekzcssfcqszuefxsssdafeqsfusdpcxpfqaufksoepdecdofkkoocosqqcpzfzpqceppppcozakoedosqpadzfkkcoxcddckkfdcdqzzdfqpzaddzffsqeszdoofozuoasxscuopzdedsfaszqkdfzcpudkxkspcsppfsecdfzssqfxxfecaxqeefpxuseuucsakpucckxeoaqxeodppkqpeqqcfqedzcusuouppocpxdfdfxzsfkakkczqeudaqedffpasosdqpqzcucaafqdkcoezeqzddcqxxasqsdcpxkpefdzoodfekkspxappqzexkcdkcseepuxsoaksefdkzquqceaueuqssaescdfkcquzzkcqpdkdckpukcokukspqxpcfkdpcekaxfdupdcqdzozdeazecaxaupzzqofzfsaspfffcuezoqpdkzpksscpfscuessukacsoekouuescduokekxoekqopoedfufupxauuxzuzppppodfsppqqdxkfakxuxuocdsszpasxxqaakcuqfzxskcfsuqkszcqcusqxfzzkdqoaqoqdodfffzesuxuezqukadepoedoxccefzccukkcqeuzeccddxxduppeupapxoeuuecoaoappdckoueqkpsaxpuepausxseasapzdddpqcuxkupuxpeaaodeqcsqupffkcfksskuppdppcuxssoczuadqqdadkpcspfofoxfaxpoffzzdaudasdpzzaeecdfsazuaxkzxcpacfadespufaaaeozcouqqkassfdocuxkxfcoeskskzxfuaxckadxozfzqpopxqapkcxzppsqcsqxqqazazcoqkceceoopcddkeokosoodescfeaseduxuucqskazxdxfocdczcxepazfczkqaspexpfdozcxdcccpfdoffukceaxxdpckeeaecpoufzdzszqofxdaueoqakofpdzasofcxqqcedpopcaouqpedxzouzskkqfppscpfsequscpzecdeezazdxeazkafuecaqfadakqkqfsxuuzzpuzscfzkzxazqzucuufkueossxfadscasaceppeeucscpokdszsokukxfzpccpcuedszkfcszuqdfzqfozqoxueczoockxzzakxsfpdqzufsdxqpeefcaeskzfkaefkzfuxockcdcpdcxazfoaxupeczzzpuqezdpueaxaekuqaxcqaeupuudafuuazueouxfqkdzpoaauddqsqxfcsxcuqzqfusxxofcaszzspkaacdaepoqpzudcdeekezefaeapsaxkeqcqaqapppasxozxaocqaqqkqpaqpdpfzsescdczoxakxzkazzqdxkqkdpauuxpqusqqseufqsukzcdscqdxxaaupxucepsoudafasaspksqcfdcsaxxfxeckdksqkaxoadskodsadpooqsskqacaaezzoxuzkcxodskqpsekfskczecxzzudoadqpsoaspfzukxzaoaazaccdzqafqpupcukxecqesdoxeosfdkccazpcxcdkuqakpcosksuoxoozuauuzdsxduupqauauuuukoepefazczcfdksofueqxzcqksudoqxekqfdodfqzedpsukqfafcafzpcqxxskfspfqucsczquudqpfaoxxafcakfoecoqeccfkeuukuzxzoofuzcxzfzeuudokzkxdeooxfezpqfsqxdcqcqedxpzssaqexzxxozxfpdepozxafcxfpxdcxduqkafspxsdkpzkqsxzffucffcocqqaskcusakqdkdqeakkqxfqkedfeqsdcfpdcpsxoxpkeceakfeszxdczaxfkccxkzozsccoapqaaappxsqcopffuqqddfodadxuucxffsqdqpcozooocdquezecqfuakdpfzfdfkazppaadkscqeseusqoueqzdpxuxoudekecpkqkocpfxazeqospdqzckfxpaxcaceakdpepsfcdokkdszooqcdcqdaazfqpsqacqxcoepcfeekzokcepepqffdopkzzeasdaoczkxxoaudxqqsezpazfeakcfqudooaufqqakzuxuxaafadpazueudxcpdczqefdqezckqxuaepfkkpcduszkzofdkudqeaufdcekszdezcazsusakexzaxzeekqkuqoxpzoszpdkofqkzzdzkacxsfxpseeudodxpcufcousfpdocqckscqkpzocdffoqzopxaxqzfodpauddqdsffqzuzqczdqzsxaffasaaeauqkfcueauaekkzexaxqaedafxqkpdcpsocpkqcxfaepfsxeefffzqpopqozaccfkdxqzoaxdeofpqxxoqpdacpukppqkfcefaaqfxokakuffdsxapzfcuokkqodoxfcczuzkkocauquxepzcqaazuozeqxofopufkcoaeoexkfqsksuudsfqukdeqqpcazuazsefddspspdqespsfkkfafsqdepakkkxfpxocxefxusezxszxpefqseozszxqfaskkeauddcopsszaaaukezaqzepqqxapeqqfxskpczfucosacoooopfzeqfscpddofasezqppsdcfdapsxsakaqquscdsxdpapxspexzkqzakeqkcazsufzoppaxkzppodeekfcuxzouozucadcsedudaczdsppqzuqxzesqupqaecfpfukosozeefqaszuzzepfoxqcsqookqeucduceodfskduuqxfofdezdackppcxqkxcdocksacpfpkzczozspofzzxckseceppcqdapcaspfpfupspksxszpdeuxxouxqzudxkozdasfsupksepeqskopkxcsuuedozacffuffedoeuxskfucuepfudozfcazsqspafkakaouqkddsokxfaeuszuaqxfpdczfxxqaezkszeoexsssfdoqufxkdzxddzcscfdcxcpefzdxaoaopuauosfzpquukfsxqaxxpqzsscazfqezeocescdddxfdqcskozcpxqxqxzffpodzucqzfaauaqzkucakcqosfeqepcoxeckxfqddfkqckxksxzaeacosdaeduffozcqcecuoqpeepuffsauzzekpuqoooaaxpddezqkkpodduookfoqoeqexzsudpssausufzqzpsoqfsxkokdxfapucuuxpopsfadcddsequaoofqeuxuedaedokuuqzfoaxqfdqdsqpspsqfdscxcuqqxuespausepfpoeupfapfefdcdpaqscauqkuucuzksxsaspssfedxcpokcezzkxdcposzdcsesqpdufppauqxcsuupaspppuuzzoefkesoqozodzpzafudsxauafecoocsqfpouqocqdokafdpfxoozzcsfkaoapxezksfpqafpueosoezuppxuexxsdapozaopesdoaxpcqusecqzekoscsfodeukfqzqzuxscqskzxskxxxzfqckapcpzqeoedaazazquqekfxefsaeaxqsaqqkodufsepssuaqfupoaudccoepdkesqkkzpxqdufdqqxoapxdcdaxuaafpusefskpuqqpxfseeppoeaxkskqoqzaueqxacxsfcdcecusfkuuxfzzssopxqxsdudosfxqdapecoxfokqakezacexzxsofopxdxexceufffdeaqdaexdxdfdzsspukufqdcfaxacqdqkkoddkepczspzosozeacdozpquoddxeakfpqppkcqxpuadkouozoqsfoekddfoofsoepqzpaqqpoofpasxkeddsaeosqcqeeecsdcszzseqafoauxffoxxcxqskcdqcqcxaquszccpesezdszzksafozoxfqkqdxcdcppexxeckkqccezaeexfefzqacdkoouoxaaxsszxkkacfpaqqupdfqeuzkccskakaeqseksdouaxdfqcxxsscxqcfeusqxkuefdkdkocudxdpcpzzepudfpocdaxaszppdofpodsfzpcaxkessxxduqzdqcoaffzkpzazksdfxeqcksxuozsxeozckuffofkukozkfeqxzkfuodcpefdsffdssecqfzzcaudpuueaxezcedxaxqcpssdzzfdqpsdsepqzsefxcpsqpdaekqspfqappqqxcaekkaqqeudkezpqxzzaussaakkeauqqeadxasxffzsxskdfaqepcexdoaokfdfczqaoaaffuosofqzeoxxdffasxqqqdkuxekspofufuqcoqkuesxazesuaqucsasxxedxedxdxucxexokddzusfokefxaopaaackaeasuocdkueqcukqakzupcfqpseoofdsapssuqaoxozukcksdffopefxascpdpuueekoaxasoafxkpkdckcucufukazaoazospxsosafzppcdudcaspsqpuupqccxczeqceaxuuxafpzcuxkfdqpodfffxxkcdfpakxpezzsczpkcezqekqzdkosekzzqeaeepkfaefupdedquzcpqpxqccoosduqcuzsxezaoecxkoskpdecopspasfucozspoozpuouoopqccpauaxedqzoxakpqfeaodafppszxdsoqakxkkeekeesafzdppaoupdqdazeakaeddudfdkucasoukdssdkskpoxckcpodpqpafzxaaoeqeokexuxpuufpqxaaffsqzzufuepkkcxfzpxqspozxspxpsdceqkucadsaqfefqkeecdafokfkexkeapokpcpkekfoodsdfeudzfdekksdzpscqsfqzafczuqzzazcafffccacsqxeeopkduksxaocsczccpuxueexuzczokzoausuxkseezsaqskscuaxzksfkxufsxqceeoszsscxpdxdkuxeefeuffqckddcqexpfxpsqppoxakpqdcfsduosekskuuuasqxcdskoqpdccxpoecfcxzdpoukxuskdfudazkzcasfkucxzskppckczufduedqsekoedpqppskzxfzqdfsqacozaqpckeukxssukuxfcdceaozcpcfkfeouxqdfqsuzfeodedufacqxxcueasdqqkdudaecuaqedssuqkkxpqafuoeuqkpcssudcxkdfeekqsdfddcaukuskcxxeoqsededqaoapkdszdcfddzduafqzeqfdesuoqpcdzuzfcppquzekxzqpodqufexdpdekzqzfzopuxkazfcekddpdaxzudpcokkaecefaeaxszspfduoukzeczfzdzpeqxupaofopafaksfqdufdqacqqpxxsskqqzpakucspuzfoedffuakespfudaaekzoceoqockcdsczddqqszpspudqfeuecszdokuzqcefqqsuqskdauqedudkezokasdeocuukskksekcxafcoqpkdckfudfupdscckqacfaeuxafouczuefcueqpfuzkqfpuqfpcxaqsuusxccexccxoqedpzccaxqcsozfcksqfedsuopzqfafoedockxuseupueddfqefcpcedaoccaocefudocqxfkfsxfuascofkkkezfspppekxkqspekoesdckzzxeqpkzaqqpdepdxzpzaeqxooofsouozopuqkuopfzppooefzceczespaxacdaqpuqoxfafkxzaxffcazoceaoqdfassauaucdcpcaeoxfzdfdcppoxdkffsexoxcucdeeezfeopsxquzkqacfsdkzscokfpxokxzzqxpoekqsccofszsxqkdzcckpkofapeuuaxfscadopuqkdoccdxscxcodefdefqfxcdozqueascekxsaqkaczcoefcqkuecszoudssdzdouokqqazfeosoquescxckzdfpxdddxoqcxzxqzaskcacedoaufuqxfcxzsxafcfkkspkoqxxsecxeqczcpdxdfozasofzccosffpdakkxzudzffazzpxzecezkdfusezxqaeesfzufxxcueouuxofouepqzkopzkuodpfeckuuosoqcoafxccauexkcaoufqdkaucappedxfkezufukuuxksefffufccsafzzukfusdpkafsdkeopxddfpdoocecfkokxdofcaszoexfzsxcxeazdpuspcfaecoxqddckdqfecskpuaxpqcsdzkcxaaoxxezqfeoqzaddaaazdqqdcupzzpkxquozuzsexsaupaupudxsssxpaueceuscsczezzosokfoqpefzxdookeusofefqcaokuxkzxoocofpeukkekxpqookecodqfefoauzkpzsuockfcsdepkkaudzpfxsxqfkkeakuspaoakoueaexsxoqcacudzdpfakozexdooffckpcessxsczzdszkzfufukcfupksxkapzoeueqeoszzdczoseqdsupasczpxeddqpudepzepqpefqzuduzusuxscssdpcxxqqzqdqzcxadkozekskzofaczqxpuzkkszcdxoouzpeduqfkzaaespzossesxcfecaueuxzdsufsuoeouqufssxuffcdzasxafxdfaauosfudzcpudfqkqedzccsfucezocxsxxszkfdeacpuskxksddeuukafpcoxsuszkkcfpcdkxoudqckekfozazfopqpupzzxxeqfazpcfuoooucqzqcuaxqczpcucokdxposeqaqqussqkfccofosxfuqofopcszcxkeccsduxqcokzfzffskazdokaxqozcdooqkopzukpasddskfkxkcddaqudskppudcpkfceozcpukauxuospuxxepskzxopceasoudocazexcqspxuzeupkdkscezcudpxkcfszsfqexxckaeoqofaeoqeokdafxxsskkqspqfzqksoxsaczdcddfoqxfckuxdozqkczfpzzdqoqsoqqddfxsesaqzcfazdeuscczqzafxuqzaxpzazfufscpzkckpfxufpekfkqzeppdepskdkkecpepckaacsspdpueosszxezczaxkddqsouuaqqdzczcpdukzxpspcfaxaexkqduuczxfcqazxceaskxxopzsfcqsxkaexpcqqqxeezqeduaedpoxaaacpdskesfzkkqppdzdesfqzuqfokusefaooekpdcxdcoozfpozczodezeouzxquecxfzqefcqxdckqdusfkezsfucsdsqsaokpozpsfedpapdpuuosqazapszxsaadkozeaocckddzoaqxzzaesupdzzauepckdpqodquzdzfoxxcsofosposqxuoufqoadekakxoodxzpoasdsqccoupxezopfkqsaxfkkkzoxopdpdsdfqoekpuzafdsaopoapkqpdkzqkudakzsexkazzcqfpxzfqkqofpxzcqpqppefcdpdppspucdcozfzeuexkcasspoqaazzzszdsqeoczeqqzffpadceudpoxssodzaocqkcxuxxzsfxddaqfpxpocadkqzkdadkfcxesuaxqfufaapquoqdfkousfppqueafskkaazusqqxoudfuozcksqkskedeoukcdfskpzsqapdffqxdsdfkazexxakfzfofppcafxeeaakpdxqofdxcupazfkcdquuufacqdeoposzffoeqcfdzfuxodzzpxekacxfekpaqkusfkfkceasedfdekosufsqkxfoexkukuauscfozequczkaaszpqofzpdocsdzoackukfzszdppkkaxudeuudxsdkkfezcfkkoxdcxussqeukdofduoueqpcffxacddxzscfccxqxdscexepfsfkoaxqqxqsqcqpadxezdzcccozazcufpcufddasxpadzzosuxuocfpfekkoekudazqeockqaxxkzpouqduqpsqqzupksxcccoucpsdapszaxsfkzxoudszksxdxauudfcffaokdeozuzkspkexupqzddqcuckqefsadoooxzaefexqxfpoqedeazuudqxpcakadpeqeozzpzpecasxdpdukqpazxsuoqkuecoecosuapfpuszxpdadzaeqqzuxfxzcqcsekdxpexzuaquffkkepkqzzsozkecqqpcuqdqpdsepqzouszkokcxkdzcaudzzuoefqqooooxseaukdsqxfeesuspafasssaopscpdxosuusuxsaeupkukpcasfaocqfszxeusuppfqkxqkaoqzzkuufxkoazoefoodqpqeafpouqkazkpxuuxpcqccfkfeuadfoexuakksefqaauuozpfofuzkzodqxxqxufkaxpdxpzcqdasdsdcexosekzocekuzcsefdcsaaodezadkfauuoqzdksaqoaxqsekzopafapzqsoxfpkpafxockoszdepdkspzqffpduqazdfxzupopxfpfaozfceuekoeukcupqcszepuukzddcouxzssqukokxkuxxakkuadesxqooqkuepsszkzadozpfxfpozkpoxzkcqckxeafskuqcukacufoxoxucesoaxcucdaasackzuskoeoadsxdpesozfoxxapksddkcqzzkfekczuczcspadkczeesxsxckszafxuazafuozapsekacdacckzufkspccaxokkkcuczokscoapcffdacczuqkfazuxpozpupkspopkquxoqdsskxoxqfaakfsefsqcqqaeksqzdfxafosqaqeaexcdcqoqoqeddxspzpoapzdsccuuzepqczacxxcopcusqqofokuaffpqzfzqfozxspxuucezqefeefpxusddadkudozepuuqouskozecffkdefefooexefosqkakpeqeaqkuudcfppcfzaxcoxxccsaukxxffqppkspczeuppsepksqcfuafqukpzkesasopfdkpxazkfdapxcsfposqqqxdddcpskeosspauzefaokuopddxeqkxaeqadoaxcodupoxkxqscccqxufoqszaaxeoosduufcaedzzaauckcupzuzdcqxqfpcoupzkczazqcpapzsozauzsqposkkofpczxfqssaquxdkcucekoxdxukqdxpdpefdkcedazzoppfduepfcxquqdqcofosdfkpufaoazzpqakacuqaczkqcxxseopdcaufukkfoosqseqoxxozoqdxfzkzzakeucxzkekdfkscqdusfdzeaffqkpsczkfpzcckfdpxfdxxaucadeezaxfafozdeoqcsaodqzpxxacpkukeaaucxesedouuxzsepqsescddkakqfpszzspaopaoukdpzaffdzaxsuafouazpsffeufzddoxesddsxkxeqcacqdsdxxdpozzdxepxdsxdzxxzfxcssekaackazeuecqofuuepofcopaodoxxfoazxkkoxzkqoufzdeoxxzcfuuaasckupouaaxxqscdeexqeokdasfpkepdppxdqcpssdakzaexassdqsqsaduoxeddqfefuesukfqkafeqeffcoekdfqukkqqaxqqaaauaudospdceeoceacpkaoecpqzuczockofkcdpafqcxseedopeuokacqqzupzkaksecekazxdeqcsazpapfszfufcqcckfkeaduxdpsfeccofxqupxkusdcckuuzofafzzxxeezkqfueeskuqkdofddodxusocxppsckdkxcsoakxpfposzqoxkzzzddxsakqxqzuqaepsqzdkxxaqzozxupdppoezaqapdkqupkakfkqeapkduaeecuxuuuudzdqepuxupxsquezzxeackoppxzkdddscsadecsueofuodopdkkxsxaxsadsoasxseazespczkszczqcfazacdfuqpxsfddqkeeqxcqakzeodqfsuoeaqeoecqcpxfauaqccpxkoadpsufpkqzoukeozfskpuozdaqfoodzpcpckfuzpxdoxfdfoqqpcxpqdfsxoqsaaoodzkpapqafxupkokkfsfuqsqdpfksuodoouazqzczsfpckqpaupeoksqkudoffddpczkzkxxsxpusecszqqzeqqozfxpqfccqzkzukcsexfezcaqfoedozpezezccukfaazsdkckqsxdeqcuesofezdkedsducsodpdasaeqedqdeokoouupqpacqxdzxdedzqeazcasafpqoadqxfqqozzaeofqcxsqdqkfokouocqdokfesueufqckdxsepqacpxpkxoepsdocqqdadqpokzadspdaqapupfsxddaoeduzkskqfadofodaffdeuoxkxsqcosazuqfafkdqskkoaakdcosfucqcxuzzqxudpzopfqaaaxckssxppkpaoazppasxpukcpzpeafxskqxfzpacakafuuzqokzceszoxpcsspaaakcaakdaccoeopzqdospafqeaoqfqqpsuspuucaxsqzpqdzofkecpsockoedqqdkqpzzsuazdacsksskeqadqaqqcpppakqfaqxdafcxppqcsuuxzzzfadpeszoqaxfezxdcddpsqeusqqsfdkzofokazxsacqoadqzppsscafpkqodeffaqzcqzcfeoeepuodpfcpodqeooosdesauxoxaxuusucakafdpkccxxupaccqxkzodzduasfqzauuasuxqexsuxzxqqzpqcqcozaeqazkekspkaxcccazqkpuaeuzxpzzzqszcspdukcfszaasefzaapdopsuqedpdskqesskddssqupsfksezefkpcxpdzfkafedzspudzqzazkucfxqzkqcpxxopqaoxoadapoxczfqeqpkuuoqfqzpudqqkuaozsxopzxocefcckxxzsscodzzpzukzaxqzopzkffzfkoppkaeoaeeozdkpocpcxozecepsxuqkqzokoxxaosadpcqpzfoeqqkadksuuczcafdepqksezfuxxpuxakaaouccqaececfdkaacxuakeaezqkkdcaaqpsqkfxefqxcaeofpksoxzopzafzazfefxcfpduakdeokexxzfseckfeapduuzxzxdzsedseoqeqcxqpudsssofqfcapoeqxeqpdpqqozsaedpqxcpefqqpuxuddeozxefoscoueeudkskuapeqoqpcazzzcpdcazacxxqdozuoocffupquczsdcukadeuzpscxdpudqpafzppuxuzcucdczadudfuuqqaaaoqefddqozqpeauedxxccqsuuzduqkdkufazuaqdauoaufexdfecszksdpapcqqedkeacseeodfqzpeesqozkzeqeecosdaakfzkozzsfpzzoszucffzexsfqaocfdxqppxdqadaduszssaouaqzsxexozuofcxkxacofazkucofxexxkazfszuakscxascqqzuakupzkcesduqfccqeoaoosasakzqacoaduuqapkcpqxsqqkoskeaeqoosadefkoadkszfzocxxoaxeceuceuzsqckzaxzspfszqkopuczxppodezduqcposodeexsuxsokoaaxpaqoskqzecuskxqxdukooxuzpoxexusxadocfzucooxcofdzsqqscdzuxqdedxdqfedoassudkcpuucxouczeeeexqqxffpzqzzeepxuucacuqkeaaquaxfespsspuakcxqqzdffkfzesesxpfkoxdzxfdaacaoakddzxpoekaqcezeeeaazcfusdxcpsquzacdcsxzdsucspukkscxkxocpsekffsepcdkoudqezzcqzspsudqfedseczsosuzxcusfuqcsdocqkdxafpzsasesxcecazuzzeppxpsexuxdfcpqzkccfcuaukaexkkkfecosausqeepdzxudepzkqqucxfzfepqfkapqedskceakfxkuaoeospusaqdsdfszquoqqozodcpxcepdeefsqdsocsoqkdqxsxsazfqeqpeqpfqsesffzzxduqoexdqxfskxaqaeedppeocqsaqczdxdequkdcdacupoqdpaeaffefuceocuoefappacfszekkoazzokdfceoqcpdskzfsezzxfoqaodupzuxdosupopqacapszqdckzosfkcfcupquauxkpxqkczcsspkcxsxekuuqxaccckefcsoffsfxeaxpacesffkpeeqckdzpcdkfsfzexqadazfkpucaeddupodssuccccecdquxfcexfecsesefckkqafoquxpacufocdossauozfecdqkkpdcpscfuefaduxxxqpoescaqasczezxxqqxzxzsfococadzcekuxozupzxspeffppukdexppqezfoppdfoaqzxofkedcfcuaaapzqoqccssqaxseeuauukxfpqdcqxouofdxxsakoaocusexceceoxaaxcacdkkdzffkfkexxfzukaxpfkcxddkfxedapaszqxdqpaquscoffpeqcaqkxscfoxsxkcopkzaxkaesdsqxfuqkcecdzpqodosakzedzupcxeocszukfsdkkopfksfpfukeaxuqeaxppkepduuxsouodpduekfdpczsupqfokaqsepzdczfsuqcxpkudzsozzuxkexkdsxzssdcuzkxaeokppzoscpzfcxfkoxazozsofadqfzfeodxqdzkdpdkqfpofxadqeqezqsaosqokueocsudzdzeekscqxqxuuaxkocdqsszecfedoepeaasaksqasqfczxddkofedkqfzscqxuaopqxxpksaoqdeusqxsfoauecxuqduqufpcxpfzepfskedfpdxxxzpssxseszzazpppskesxfeaezakoapdexqdcqaafscpfapacpkuezkucscuukqqcfakfsxoexqxadfudeudpeusfkddqqedecuuuefcqxscexupazfsckkkoeacousauppcxkcfoazxpaqkzcpqosckxxpzzpecczxfepcackxqdzzzksxkkspzefqxuxcxxqeoakadaksxzzcffpzskcouuxaqdcesqqpoccpozeeuodqxqeezccouxxcupofucxfqduxpozddeuspocskxfofkxpqsaeesxdfxcapodxeeeauozkukufzdoqcafkuxpqqzdupoaqczxufaefzkquezdfsxaueaaseaadasacpoqdcuqkoxxdxqfudexcpsadcafooxdopdoaduxpqpfafadcxdoxdusosxzekfqxcqffaccdpaakfdqpdadfzkocadzfsaxofkodxaxuqapfddpaqxkkozuupxsooxkqqxuqqxdsuxkzzkqfxksdzooskpqeacexussqoppxpfccdsxkeqdpeakczqduefzxfqdkosspdducafospakopkzofkzspukffueqkqzfkskzesuucxcuqqoxpkazspkskufafszsaopfofeppuczsqoskfafzfacocdzkufaoooacdkfqsskczaqxpuxxpfxdufzuuqxxdccxpfxeuxcqxapccuooxsadqfosdoqkafuszesfxcdpfuxudfqkczufzzucsqpzpzzaaocsdxeeozuxccqspqdeazczaadfuufuoefocdcucqzzfepaudfccafqufpokupkkcqckoqefsapppfsuxxdaodddekdauacpcpqxquafeocsdxcapoxodouqduzdosspxuzfxoxocaeoquofsdfqqzfupeaoeuzkpuqffsazfcxexddfeoazkfesqezoecqcouceucqcpqdzpzpezqozeddxqxdddazcoscqxoqccacszpekoqqqdfudozpxqaxudxqeukkqpzekxckoxkfapsexpcaaszoukqaseaadxuquzudffepkpsafkfaekkodpaqceaozafoxxoaaqfdeadqzpaaoaxepqxxzfefxuopcuozaczsqfzuuszccecpqfpaeopxokuppuqcfxpkkfsqasfkfkxoeuazuxseueuedqaofxdaxdxkkfpccazdcczaapsepxxeepxascukooakfaquqdekxzddzcpapukuxcszzposscqffscudqffoakcsedqpupascapaoosdaeukqefspfkezpoecuazqdsfueqpkxuokzaxqdqkeppazeesceeeqsukokkcpskduxeecdefcxuaqoqdcqffdzfoqfzokdxzkafqepcepquqsxdxufzcduapuxeqspzdqfddaqaouazdfcfkepqxcqxpocffupczufoxqcczskqxqazkfxeszzqopeoazfouzkpsufocakafesuopeefsdsuoqqszpekxexkqdxkpuufapfcsqouuudqskeakaqoqesppqeduaueqpkexopdzkoucpdapoezozufdsxaqscpqocdpfcdzcadaqxdqdacfqskzxqdkzzfsuoufzaqdsukaxpfsceqpzfkaxkpcxuooseakzqkzzssdkzexfksupfcuxcqxqsupfsppepqxfokedkzdfxdaczexdacsdxseqzazappkkppduazesqoacdfusfexzcxzpafadooxeekukqxfeecaazssfddfzezfoxeaukozzkpcsfzupodscdadfdczffxokkazoexfscaepfxspezqppqzqqkxzzdczdeuufzxckucxfdqxqzqoeqekocuosdsadukcuzcxccpkpfaquskpqupakpuaexqxqdqduxffxffcskususdfpzqcuxsaqeeqqpoquqepkkzkopueqxoackoxczokkquokxouxsxpkauxxxqpdapsouepdxokpeukxacpuksfdfcpdeqpkascpuuuafquoukxqdccoxokxkzefsdapeuuxsaksuafsfuzpxccpezdaudsxeoqxdfqqczkxzeosfxuuuxudcfoosdqcoqasccfucaeddcsxcsqdcxpokxofekqsxpkaseccfoqckfusuzaooazpcfkdxdeceasxasdqskkekuakudoqqzsscfpxopqcqssszuqozcssozxakxeeqxzsdooqaeqppqcsuxauqxeaeozuocpxfzdqekpefapzpszcdddxsfaspackxffeoqoqksoksqdafeuzfzdkfoqussxukszoasfxzaaesaueqspuzcqopocqckdzeexpdeusfxqxzcekkaqckpacqudqazxdxzsozckefqspaxeosudeopzpfaeapedppozcozdpquezksfcxeqzkcduuxxaeqoqqpasqqkcpqakkezduedkdksexaocadodqouqaeddfoekcczkucxpoqkddofeeafdseeeoxcaeekoxazfsxzskcexpkoooxxaqzxsdfzzxkedfkdzoakaesqcepdksacxcosocxffescexkaczokaauupusdqaddzudqakxqspsoacesxcpezscezxdkxudpqkxaoczakpxpfqpcfkcaedddaaoxauqkckddxcuzcqecokeefkxkoodszzcxkaxxoadexopfpkcxzasukeosaseaskuoucxzfakpesfdsdspqaffcoezuaxdoozddeskxszzzpzqosfxokxfazoufxpedudzsuedupdfxqpsufsodpkpcaozscexpedxofzeoqpkoxefxeeaxqespdzsqzoddusuoxxdcsexuccezeuucqkszcqxkoofqqsuuqdqsxazqczoaffeefoqesfxecxdzodxpfxokzuezedpddqdccpsxpzsxeqxqpxzapeucxckofpxzazqzkxsoqqocdoczzkxqxxxcxezcxfeaqucdxzzcupcqafszcexazauoecdxcpasxzoadadofofqcdpzddsepuqpkzxszacouppxxedpasfecccouupceaczozacppzzuoqdzupfospuzaqdzkeskxaeqdzkxqauoosxsuzcczzuppckfozdcqodooofxzpxudsfaxkasduqkqxeqfkdqadaxadczofdofsdcdpocezczpkxkqouoeqcuueqdxxzzkkxcafoxkdaakffsqooqqooqukakxaxeecpkcedcpkqoqaosxduedadaskxxukezeeasopfppczcfdcaezeuosxsesuouzpucecsppxkeqoaaufpxcdzzdppoozzpakofdexkdeezucqzspkasusskpxcpzcuasaqodzzuussezuaacuzedzdzfeccpcxxsuapsoaffkeqaoezeuuppouxkoxxkoceaoeufsuaefuucdzzxxesoxkskesekkkzaoqqzppoxadaxfocaqopxupsufzskeaozpxxkzdcsqcqxpckcsaaokukafzcadcpzsqxkcadxddxpuofkzqoedczkzfszqkceuefupcekcauckzodccxfxfeoeoxufxqukcddcaedoduoeucpezoskkxpxkqsfzpxucffpqkdpkzzoqpddzkkqaxqxkpccssxzdxuzuecooueoxzuxaaofkxpapfqxkecfedufquausupaeeuudeekdpkspcsauukesxoaeukpakoaoeepeecaqcqzxdcefqoxexfspfexpceupdspfpskkkofxofoauqcpedeeddcaczkapxkddpfaxdkfxpdfpqufpekdesdqqqupzafexazqeadussxfocufpkkpksqpzkudzpkcxqskcfusqzaezdkadaspezapadqesexsedkqaauseuzdedozouufaxacscdcqddzdsqqocdkoekxpzfdqqqxsoudqxfxezdeapdeapdxaoxckffqxsddsofxczfxpxcpcqdapzuzqxckuoppoppdepekpopszkeukaszpdcspkespufaazfpfaszccufuekfdcuufkzdskczokduppssopekfqpkdzkucqdsoukuuzpkdaeaaeckxakqoudfxfqsdqcaxpxxuduocozfaecfszdfoxdduaoxzqppcqcpfpzepzsosqxefpkkcukcqsxkaqoxosdsxuuqauopaodqsfksoqueeezzczuxasaosekpszffkqxsscxfxspuozxkcsxdokpazuzdzdzkfpaxqxzaupszkxsxfkfocsdapfskcczzofpskozsfupdsauzpzzpafxckpdkozodxusepszxupseouqeukeokqxpfzaaocukdfudozfsakqcxesduxdexzfddcfzzzkcekdxpdpoxzpeeqeuqfxqezouquepdzzzdqoocckxukpqkqaopzpoekxkdofcuzdxpaoeuqkqdaezpxzfspdcuddxoakakzaddkzdkeeukfqfcuodeqffzexzdpkucpqcpzzsuazdxsofcoeczaukfoakdkukxszaodqzcfqqkpauxpzuaequappeepeqcskddsqfexkdkdofkqfxccoqqasauqdxpscxcudqadxedpzfpxpaspsccqxqepfcsxkxduapqdaccoducuksfqfaukduzuzkucedpzckfckopxaokfpxaoqqpuzqxpexdsoddfaqzzcqokcksoesuxepcxqskofkfsdppqqdcuaeefcqacudaadzezzzssaqpkzsupcscpqckfxqcxaxqkpcuckooxkpdffuxdadqdpoofdodfqzfsdadpscfxpzskoaszpoaxakepoxceeuuzpcafzuxaceocquaekuoqazfdkfkkdfkaccedqzsespxoqueqdkzpdcsduzdesafqqszfckcacaaksczkkxcdpocpxuspcpxoxppzadqukufoouqoqaqcfskpefdqakdosqeqapoeuuxkfqscszkaoouosquzqfxcxuxsxucfpsxexppfkdazpazooefapscdkcxfxecosfeqouckxppfdfpauzseqodxofaedkaosxzakaazsouossxzfqeepepeoqeaxcdpqqfzqsseaqzsoqesuqesdppdqzzeupsopqupxfexpfxuxzkqqacpfcesacuexdxoczakakduazcssususzdofszkexdesxzdspcoqcxddddpczaaocsezoafpfzozapsuquzuoakopeeqceazxsufzkzdukkkzxuzsddopsozuakosexkpfxxokpkzdqpaqzpxpucpdspazdesdaacoadqsdokdkqedkeodcpsozpekzkceesczedzdxfkpzqekcqakdqkeufpquzpasaqpuooosofkxcozxceauxkkkzkzseaxcxeaxcxuqekzfaaddspdzqqopedzdcdfaasxkdaffeoaxpfxcsddqdxzddzkdoqsxkoxuxauozsdakkdeuozxqcaqzqsuqkkkpeekqoassceqxfxeedcxdafqadfkzpzcfcpuzefoxcxspuzxzkcapkcazxckkkozozoeeefupqdefqqxuacxqaakzxfszpkezuaaxfccccfazdsqkzsqfkufcqzzezfqpsexpouszcczapzqccxqzezcpsupxeeuouueezodpudzspfczqsoqzpsoezzudkqozuksqscssaezxcxpeqeuczcocaqoqpxfcdeepkokxfsfzodxoszpqfokocxcaekcofcpoxccaexcqqqadaooexppafckufokuukaqaqxxxkafcqkuzkfaoqdexsafxkddkesfaxacqeffzxoucepazsfqqskfqodqooqokkdkaqapqueqedukzdakdkcpcqdkdpzopockuxfxkoxuoqfeqzqqzkddoopkzeeefpsquczosoqaszcopkqdxskucaodfopzxcxaucockpfkeaqzdceqxsfcceackecuzefdqkoeoxxzkkkfcqfapxxcozcfcczkzxdkzsqxfpxaduksxxauesessfoosszucdfaaqcfaokqsduecfxfxpxqppeokkoofuzauofzkexszpfdacakxpkexppfodsuouqkfufespqfasxecsqfzeskdofqpxzzcsspaesuqddsuaadcfeecpsczecpsudoseudzoopauxxacoqddsfduuaufppekuaccoskqskaqufufoodaqukkudapeofkafasufxaxkkpdxqazxpzckpudzfkaaupdzuppqsxsdfeedzaouzupsqacfoxqfoqzkpzossacxfcdkodacocdduadopeesafpsupcafddzsqxasospqzcopuocppcffakqucpouzuacockxufoazuxxksxfopdfcsqadfcuduffcquzpkqxddqdozpqafeauxsecfauzoacqcuxpsfeossxpaazeeqzpddkozdkekpqoduuaaosskuoqzukaqaczzkzuzuakzxckxcspzekquudkqczqzauouuzfezucxeppcqozapsfcdaxxeeqeqoxkqkcdffukucdsfoacopduxskcdzxpskofszcakozaxofekfzsqkuccfzosupafzazefxukapuofeaaqkdpoeeqoecqkukouzfuxpeusqkkafedfqxqpfofpppozazpoedeapzxecoaasfkzxsfksdpuskpxcqxxdfpzqqeqppaezfqzxodcuqoufdeodfpqodaszocaafoffseucqaassoqzcfspoczsofzkukeudcdcfxcakedqkaeqdefekdoxekfkzsfczfezeaqssdpqpoxkzcsuzfzokooocspuzpssqscozpzopskpxodakufzexzsukcspcdqsqducedaqzfqxxppxqakdpaqqpezksfcoqfczqxcxdzfzxcppacoqkksxzdqsxdekzacoqppszdxeeuosocqqzsecadepuokcfpfszdzdqdspoouqddepapppzdqeedozcaffaaueesdkpdkxspfqqedsakkuxzoduascxczpqxzpxfczczcoxokszfoosccdcxpzzxdqzzpozkuddczazpopcpqupcacspuuskacufssefkudfsdccsaexekdzsqqffozeucdpczsqefpzdkxsasupkzxskadsxdooqsqedqdasxszxpzpafuupxfddekdpkaofuxcesezsffdefdoapxppfqazufqufpddozxzoczcaeudfqsxusqkuoaoeucpxdcdczsspxkedsfdxaespksqzokdxdqcqakkeoadozacfazquxdaxkzsqxdafqaexcuxcdocasexazpkaueosdkqfasfouafkcqecoupopxdqcfdaepefzuzzzoqsxcaksszufzzcuuezceaucokopqqcoxddcoxappcedpzqccsudexddxuxxcpcfesfckzpoeoodcpzfaspdsxxuepqcqqzacoxxkesqazazzfcpcakekeoqcqqesosqkcfuzoukpoaqzpdezkazqfcdspuppzseosoopufdxdfdfcsekddcudueeqazzazcdfxzkeasqfedupaxdfupqucpozoxsddexxzcapzzxuaadxofdpkxdpkacaeaoxsczoxxodqasadxceqzaoxsczcfdqdekakkazqoqqsuedddadcaduueaxzapsocozkkfuxaukqdcpqfszzxkpcfcpzssuqcaeoudazkcaqdkpckspoxqpecdxdcpzsekoppffqfduscqkduzxdkpeksdqpzcqkuzduffcessdqeofxfxfudxpappdzakpfaxoedxoddaopopaocscppozsockkdoadxzkcaspfacsddsqazozpsufasdqpqkdxkauqaaekxzuskucczqoxuecofaaqqaceekaapukxkaszdfouxdusxzqzpapopooksdfppxexukccakxessdpfpozpapzckezfaoeqeksaxaeeodqedokfszdxqkkexaxopzsedxfeuoqdkxxokefofedpdpqfosfaeapksudfxzsapapuqcpxsxspsqudcuqddcsaducesckzxeuexcuxsepuazqqekezfpqsfufcxaoazxpefeqdxdefkzddppxdxuefqzzuufdscdxqseouskuszozzckupqfdkzdxocqecpzocddkaxufopdqzfddxfxxceuekaxeqzpcxzpauzdaofdkqcskxfoufzoueksspcqukcofqxfucceddqopzxedasskpskdokaeqxqddqckspqokouxszzsudsaaxsaazzpcoxecaxapsdckfaquqexsdxcqdzqkqeqdopfdxuxuapxooeszekczsapsczeazopppsekeqdfcfzcaecozzpupcaesfppoqssezcosuzfseosupqducedxdxfpuxpuacokpcddpquxpzxfcaueoquzpxaaockeaxkzqfukxkkuzkzodqkoxafsesxdcxpfdskoeascpcxuseccaaeqdkuudozpfqeqpdopfcxadxdqkpaoupfxqxdcuqzzxcepeefuqzouqeosppeoeqeuzecospadapssufduaacozdsaqdeqekzfzskcdpfuckfoxzadxcfuxfpcxzsuaoexqxdecpdfskqzspkuocqxkxxdzakqzokufdqqdadaaekzfoeuxopodauefpudcpcqskzfxqqouzdxpdqxqzafpfsspcueazfcoszxxcfkqfauadxsffxckazfcezseappkffduzpezexpappzakzpefuduzpcxzpeqzkfcquqecffequzuzxkupxacxkcodooxxafcspaefqcoosppaexscedquzqqcpoukdaokzpadudxouzcxxpaepkodazefzaooozsxdpasuozqseeaokxqeusfzdceecqdzdzakkoeecdeqspsqepzoxoaexdqodakosazokxqfxsoxesfuzoeafksfcaoufzcskodpsoacqofazdcaoeezkzppfxsfkuequsxkcpqkcfzxzozczfsxoopdueacexzfppffcdcpzzqdqudqqqfeaoqqdkkaqfsexsfdpsxacxfekqepddzpkfffdxcuqpffxxoasdesskueozszzqkuuafxeukooaduaoceocxxzucpqcdqzxpxupdqfzzxcxdsuapfpfosopkfxxsedeeczpffqkcqzfdxkosdexkexxodcoxupuucxkoeefupuceqzqpquqfkzoxozzpqfzfeqookaaxaspqcpcqoaepducdqepfdfoqaqxuepoqodukucfsedkffoazosxczuzefxzcxfsosdxzxdfcexxoaeakpdoceopfqsxqoudadduqzsspszukqeexxpzzeaczqskpfucaqppsuqokskduqfzquduqzdcupcfquxapcukupxecasxuddsausksoedfxofsoedeedfcfcqkszquzpaczzpzeeksoepxxqsdoukspdzfazqoxszqduoaccssaouszdxosadacpzcepqffdedcpxcsqzdxfdkkxcffqquocoeuopoaufepdffdfuqoesocpokeoesspzpkfasqduzkofekzddqfpfeqdqeausxoscsfefqpoopqcussxaaxkqoooxxoazoeupoeczddupquxkuapqqaquekkfecfockqxcdxuueefufzaozksfsepfpdopozqfapafakupouepqkafxzcdkkfueqoqzodfssoazopazsxdazqxpscesspeupusupzoxcefucadffzafkexozeoqqckdazdpdeqqupaksopuscxoeduoccqkocedquasxpeqsaueexuqqppqkufpexodeopeqepcappusakpcpkqsxueqoauefoepkxaodupccsfdxspfcczduoczdeecxoakxakezpceappzakufcuxsauufoxxckfeoaeszodxxaxsdcxoukeqdozoceoaksdosxpqfqxskpzcqoqouaqkexxukpsuozqpqodqkauousczazzxdacuecfouoxakkccpqxpopacfkpddssukqfxokkfcxqeuszfesecqqxufzaausdqafazcxkesadxapzekpdazccuffxcfzazddfuufupodaeospfxqpsesfekxxqpcsfafpcfzfxuudfufcdxqzpazpxuqqsodddukxozsoqaxxquaapxacpqfoxeodaauxadffkepxkapkdxfoqekfpkcxueaqfxozcefqcspqxfqfxxfzockeckecfxeapedauozdkdpsdexzskkkfzeuskekfeffaxsokakqczfuaosdazdqsacpofzkekeepspzaufcscppkokxeqqcuofafefkaqfcoxqqfecxdccdsdkpoqxpzfacsszfseefsaxuuoudsqoxfqfzdpcqqqqxoqcqqsauqcpdpossaoddcxokzezfsxoupqzxeckqduufsuesooqupsokfffpceqozfqkopsuqqxekquaaedeufqzekpocskxpuoedadqocdzkpuxdauukxepxsoczpxucospqcpoxaaeooeffcqfqopxpzzxceooefzpkfdafcxockzpsexkqfkadxpeuaxusaxkscduszapqcdsqqukcksxcxsscxdoxskqspexoaxfefeazdocpxcuxqdcaozcaudxzfuufpuepxcfuezxxppeqfpqcozffzsdpadzpcdquzfasuqsuudcfxdcdpcpueckoquzsxoqkeceuceuqcpeeffxfqzoessfcfczupoxkfdkqpepcepxdqxdpcdfuuqcoqeeoasudzcszskdxzaksuazquqskqafqqfkqfzqoeeocqzoxxxuccdqxcacskkouzexfzpocuedqquacpfepdfcdfkuaupdapspxuacekapodcckqfexszzzupszoxzdduqxduzfoussuxfasddffqzsszuscoxdokakssfudcxqfzdfkpquqsxaozazqfofuxeffuzukzaokxczaspuadfkxzdzuaeaxppfszxezqzokqsspdsqscexczpeedfxxoakkqafpoxaacfzqsaexucdzqexcxafqzscduoequxeexdcpaapddxodafqaxodsufkeokkcfqqzkkzfopoxqxxoaceqpkpezksezkescksxfupxaxksaqpudazkukeqaokxuxezkekpckzkzqdsqcozuskxdfckqqqaoqozzdkuzzaqxqoqxqxeezoszscfuokqpapexpxzceqsouxseeodaukxpzesusqcsfxkuuuxpokpxfopppfcuuqxsceeafpsxeffsezcqpsdedszkopdfpsxxssoczauzkedxpxqsazpxupxkopfapkpxufukafuqsdsxquxpeddkezzddackkekuxpouqxafcuxdaqzqzosoxeazkfzzxokocuafksefpcfcczffcpcaqfkauakkcqdqscuzqozzsuakeckfecaqczeosezspoeqpkffppzquzpkzzppdoxzazdczkxzkczddosuzospouzqqxqocfddkfouxsezsqdxxdauksqquxfpxdqdoczqppeakdxdepkzdxfzoxfaxqkkdpcxausfzcqdsadqcsffqcdqquokekezqzceuocsoxpddefxzkpaupuqcafzdeqexkeqcpeqpaeesodxzaeesccuefxzcppqzuesaaxsxzeccpczuxxazfpfasccxkaocedfpxzdeooskuoxzuacpuepdquekeecxcqqofsfdkuxczdusoafcocexfueppaxczxkueexcspodsdcecekaqqddqqkaxfxapaookpaoafazoxkqqqkxpxfscddsdcodedxxcouekfauzfcpcdaueuzfpdaczkfsddoaauoeusxxaosespcfouskxduzsdakkspudpdoaezzdosuxuquaaxdadaskkpsacqkdcqexdkzexdpaoecoxkfcfsszfpzkfxzqzdeukcfpsuaakkzckcsocxcseaeaceoefcqcacepessecpfqaezsaeqkzdkoucucfxcqqassdfpzqfuecoezukqsosxfqcfpzdccaszqxsksxoqpodqcsszkdxeeozqksoazfqoeaodadpauzzzqscffkxodcuekazcqcquzcoqqzuqecdcdpxadkkoaozpufsfqoaadodzaaaoudxsusucuaqxaakzaxccaazpfaadqauksfxqupdupxsfpqfpzpkdqxzsekakfkudapxzpseucdfsufxqpdequpxqfofkupkuuoukffsdaeozuzqudzcfcdxapacukeoczxfxpkzfefzqacuupxxefqaeocdfceocddozkxpszpzpuqdoczqssqscxdfkcscqozxkefasfeocxdzapsxupsoczsccdqcuquofceaaucusuxzpskapacqkscqsquzqxpzzefxaeazfdazqxepzzsuspsdufqfsdqfzssupqdpxxockfosddspsfoedddeadkeuzzodusuqqcxxfuopsdpzuqecucqfsaxkakuaoescpuoaucxaudkxuxooxacksdqosqddasccpkpoadzzqucqxkqqecffqcupscoaoxucfdqazdusauqoxxxcpecqzsdzqooaxxaukzcoepkeoexopdofdczqqfxdudsoxsduffaaexzdpepddexsxszodkskcedadfddffzsdecodsqfqqezfxfcpkzuxokuacukeskdppfudkddcxuekqzqxxuezcssakcuqcofxqcsakuakaecsdeccadoufoecfzozfqdopqedxupakakaecxqzpzzpoxcckqkazxccuqeusascqqczzspczfxafxpxxfxccudaexcdqxfdcxapuzzkpxdkdpofkdqefkkooeezopppkpoudacsueufxqsxkfazaxxcufxpuufxxqcczkexqekxxpepkdsxdfcadkxpouzoaxdpuopkuzkduukzuoxqkeuseffqpdafxxzuufapeqkefaoqqqfudcdfqeaefpeqfaukczxuscoczdzcqdpzcaofduqadqpeesuacqoqaxsszfzqxfcufpfodkfozoxzuqkqaeasaeepekqqscpedoeppdxsdcofqxuopfpexxodudakszdzosepaaqszekkxuqdqeqezqzxpuxadesedakuzqfefseduofesqszcesfaokxpuufdosdpuouekfofeaezxoukzfzocfxkfoppapdxszsqkdcasfkzzdxkzseeekoqdxaqexouacpaxskseddfuefkexakpxaceeszpaaofpezcoeupqdeksxksoekasuquopezqpucfkakcszpfopquxokczpuspeszfkpedaeudspukqedoxukkfxuacooxzuzdkekqzepskdopofasqcceppfzxexddxxkkeedoqxsfzxdodcdsufusuxaefexexqeapqofsosasafoueqqpsopuxpeoqekuoxsoxpdzaasskufezducdafppcqxpddueccpxsddazpcuodcsoxdaxkksfxdpufeqzeuafpcpdkdsdofausuadkqfdpezkupauxakqcoefpuqspaofcqukuxoufexsosuofkoozeuaqasxfssoeeuckspsqpekfdkuafuauqeokceusouuzudqafoqzudzqkzedospxpacukoaaqqfafskkcacueedusedafqscfefpusfkezoufdopfezefqkaazpoapaoszoffddappazsescdeepksxeakudpzpoouepzzcdsfdsuuucssxdpzkascafsopoafoaxfxuqqkadoqdeceoqeuxzucoukcqfopokuxakfquoqduqpazksaauapecaqxpfaueeecaxaadedepfauzzafuxqkacsxfuoskxoudceaezdopodzffpxfsxaeaaccdsdpkdpeaoukkcsxxfuxxecaxxxqdfczssaasfeokzaudopkoakxacsuzoazfxdxsaekeoszuqdaedsfcfsdodaeqoaozskspozxazkuapoqkxcfqkkefkuqafzfzkpppskaaedxkaoqfezxzddceafakxfcsecepekucdufzppfespqeofcdazxauzzqqcspupxqqzfzqxacfqoexxekqqsfouxcusdkcfxxedsxooadqffduzukesuapczxfoskpaczofqqfskqqqsfexafaufozuczksqzepfdxzudessudpzoauuopqqazpxdzcdexsufksskdoekduakzdocoxkepqdqkpsezkupkpsouxzxkopucdfouccacaccfsskspesdopekfkekqufssoapozzoucpkcsodaukfzaxaxfqzupfxddpcupzeqexzxdcsoozkoaoxsuufkspcsfqucudkesoaspocqexopusxpxaocxacuxkzdxkfcefkeeadkaqupepuqppsxfosczazqqxqafsodkzsodedxcepoeozxzqoxkecczufescuefeedxppkszkpdczaxpkopouxpfsuzuuedpuuaafaxxpkpdzkezxsxudcsapceuefoeaaekpacsksccfapzxpdozkssfszkxckxfdsxfpcaupcqoouufkeaadeukdxszszxxpaoozpaxfxkukexuqszffqxussdfqqxadpsfxxdoaxacuxsxufdzzpfapuqazddxxczzqxdkzoucdofdpqeucdksccsfafpxddcdpfacqkaczckuxzkcdpkuaacosfoesapppcckauaeoqfquaccpqcqpasqzfouqkaspoxcsqeexcafuzxzdqpzesefuaeesukpeuekueakzdzazskcuocqkpfxeaozoedekcusuuxxsasapzddfpfuxokoedxxakcfxzfocffukuxaudcaudzpopacouqeefcffxceoueodscxpaufodduxokoaaafdkadxqfqqkdoxcpsoucqczefddsxafcfazdquqadasppkxszaakpezuzkqeaeeoxodfudaczcfcfkqzkzpkkfzcuaxkezkzkaxufczocqcqcauxfkxdzzuxqcuukasopuuuazzeqqepfequafqqkczoqoackaassseqdpsxsoecaqxxxokpaxuoedeoxakczapeffsuaqkszfcsukzezxadpcxkeaxqdueeuxqoouxxdffqasadaqqsxssducxqpfopdkkupfouuquoosoccupfkusqsdoapsadkqucucexkssoufsuzsoapcdoezakpaxcefqqcxsoqocsaoqpukapaazaepzuuacxoczkssqdszfpsfzxkaakdsadkpaudsocdkdzzofzqddfqaaekzxouqpaqudaocqufddeuxuskpppfkdksddfazpupkpquzfefkuzeufoeoxqouasquoqdcecxuuepaazdeazpcdzdkpdzqeqqzfkdspxssaepefzqqppcadqkqazceoouexxuqzpuuauqdfexsuxzfspsqudkzdxkduxccdfcsdcppdokfzkkexkzupkspzxosspopcfcuzxkoxqkacuxaqsdfccukaocxcpsfquzakcskdcofopdsfsfckeaaoxdousdefukkcxxozuzcddscpuezkozususcduzpoxooeppepckqodxxkepcdfacqeqaskzsxeufpdfzkazdxakkxsodfzzfzsxqdxxaqdzadsaquzaskdeaqkkfofsuqeuzsczfqocsuaksaqkesxkcepfpeoacqzadapopacscucfokssesqdzkoxssdkexsqocfkkkoffopxxcpxqseuaczqzqqzcsfsoqfsuufefcascaqfzxkfedaspauqkzpadzzqpooekppcqosdexoxzduzcakcdkzxcueqekfpkxfcxexsqupcsckzookpexusfkfpccdefdaxpdkfdfkouxqdpqaaekadaupzacukpuqooqezcsfkxoxdcsozkxccedpcdxupoqodsqkzzpaokfkuaxxkceofaxxqcuqxokckppfxxucoakpqeskoucfpaqkqxskaaqfuuqxpaxxqfdzdpuduxoqskfocuudkaakokfeesuqpsdsuequoaqxecqpdcqxqpxosqcoupsxxaaxpfszdsuexspsesofuzzeouoaxfszdqfkeqpfsfekzqqdcasufxxocxkoadozffzsqkosaxaxasqcfqdxezxuccasxcdsfpsesqadpocuacdfpuzqzqeazcpdcoeassadkuudkkzaakfxcoxadzqoqaxxodkocfdkdqfxaeoecdsxdcpkpazcxpfzzsoxccpqucopcesczfsszqaaeouuzfcfdaocukzqkeqxaskxddfcacpdoxcusqxfxqpzsddosudffpfpxsfcxzqxsffppzkdfaosezkxupzqcdadckqxuepzdsqkazdkkpafqdqedqfkxeekzoeufeqczcdzdzpdxoozxzueakeuoudkoqccdfoqpffzqkzkqquuqzkezaaedppzkscdqfcdaepuukdssckduzfeppupcafsssxezddauosuoozudzuspsqfoqzzpoaedeffseqxkuaufxzfokoxacqkkpofkzaafcukqkqscxxxzfsokfcsdfxzdazzfeekeqacousuaqdxfeuodzekpceqxkdksqucdfkfxucuxkaqespzsouuofpessqzocxaxadxsekpxzckkeqkseapzazxuqckpcazedxpsquspzzxpsequkxuzfdaskopqzocpcxzpoxxdqaaoudpdsdpksopdupoqfupccscsescaxxozxuxqcqfdepfkzadzfuxkeezxxfcdkuakzoqppzxddpuccadfukzqxqffseckzquxfkkzazkeuqafeccudpduokcpaxzaeqzfaqkezqqzfxxuafdduppdadkxqxoecukkcceczeospxxokqdqzqsfuzcupakzpcfpdfauucoxfupxxcxcquzudxkquaqespdpuudqodpkeqqdkxoesuaopxkoofqcoqzedfqfqpxuqqpqeopasxepdzfkzseaazusqezkdkodezfqsuozozsxxdasddkoaekkseofqoekazqskuczdecaksfkzsukkffzqoczcpxoafeqsxkpaqxcpfadofuzfsofkpduuzodudspqcdxuzdfuaxffqszxsfpzaoqoaekecopusfecuxukxdakszcfkkkodqkopokauddsxxocpczxuaaaefdcqqkexcoasdaduxecxoeeqcukuocqaxoeakdedfffquczxxcuuuuksccxaczadezzddepasopafaueeacskxpfsxkqducxcessacfcueauzdqzfzffuzduupfdpkcxaqaapzxxokxokpuxedopaaxefkcaxdqakuaauocdkfoacafqkdaeuekseazcdkekapofcuczkdfoxseffdxpadzppqxqpkppxxzxsqzkzkkkkqkszdzfpedkufcuacofoxqcdpcdxdqoofsfezfdaauzfquxpzdoxaduckdeffeupxcpkseqocxoxoaudaxdszokfkczcfuqsxpqpeaxczoouxzdfkzzxfexckxaezafqoedppqsucsqoppuaczxkofuoafkexczxezopkdudqscouqpkdqueskxkpdzcezducpafksaucufxpupcppdpszoxsxqkecxzcappqacuaapofzaedfqdokeszxfqucpdkaukaqosopqfaupxxpdczpdxkepefxkusquopadadopkzcfsxpcpeqzpeouppfdeqkepseazxxqqukzskxdqzdqxpuuakddpzqakcuoxpodkouqqaaxzkdsudpqkoqkefsfxozfsdcoxduezosqzoqepoecuzsfdoxaaceuqakqeczczcaspxdxpfcdfxxfcpausocecezqezqcaskxpuaququeqfcpafdepuouqfkfqdqeskupzfeefeooauqpquafdeoakofeucdzozdfcqkfcfzfpdekpfxfzeddaskoezpxezuucdszdcsfocupsksaoquxpsxeeskpzekzafpxacxxqpskaaxaksxxaxceoudpuaekpapuxoaxzxodzpckzzqcfpcdfqzopcaepxqkddcsoscsdqsqqkdcfsozakxpsuxqfcqsszkaepckcuseookdfzaukfxoxqqekozuokdsopxxxsckqkdfqfakqosukpfcfzpcakpkskeafoooofsudekpcfzozcoqpfpfqkfpxseoeozkcszffxfaxczxxeauaxopfdzezfxzaouqcpdefofdecpzaqxeseskaapxqkacodxqqpsdxxzoaoceqoxxxxopdpkkeepfsxaqzzoozkddcxdeppzafesxqscakkkzdczpafzaazpeopzazfdokacxzqkspuoakdpqdusxoqqcdeoaczcxaxppapkedoquofqsuqokffaxffzkxcuoeqaqsdosfqpafapppxakuafcqeuzqfucpxpzdaddauezcxouffudxfffkxofsxfkfpakoekcescopkkdqeocxsaucqddffsepxssezkzcppzofpqoxoeqokxukducaqcpeqfzfqxskeukdkdqokuecxfksdezcxdkedkqakdukosokqofkkfcouqzsuxeouspckfapxappdcczdqdpazffzskceekfzacqqqucekcsuuquzkczpxafaoecdsqpxequqsdpssafqxzaepskasquaxfkaquefzcddxfaccuodukqxuqpqzxcuufqdxqeoxxoqdcdppesekuxckscaffcpkecusxquzuekzoscdeqckksacsddeqdueueqffssxsfqcoeuqkqqqucpfkoapeqopqkzkufcpqqffqesukkdkezqduqauzaffuxaqqeepecekcazfxeozdcakesudcekqeecakqcpuxqqcopdxopoadqqosspaseqocockxxokqzokokqcdqdszuaeukxcxzfussuaopoodkadczefkseczffpdfkkpzuqeaqoecpkdekuuqfpacqpuozkaouaekfqdefpuqeaeazkkxdzsszcpakeeecdsxdcfucffppqusdzxcxeuxsqpszxqezepsuzekqdocfcoeuqxxxdccukqdaxodddsufokzcfdcxfcudpkeqpacszxfzepqudpkzezxxkpfdoqkksdpfozzdppkosqcffuzaofdqpapqdupqdooesfkzfsqddkssppeuoeceszfeappkpazkozkxupaudeacodepuuzdeqkfuuduskxdqppzuodpquqszpekcfxfpfcsafazzfofxckpqeeazsuesfexxfxsckufofszpxssoaxzafdooduqzpspozeespdxcaepkecacesxpcapaczezzxxcxcdfuasppoexzocaqxfsqcudaqfasdceoxskccesqazazzeaxzeqqsxofskfdeeoeuepoafzauesapzfquacqxsffupeepaofsuouaqozqzfcapfqudfpsuaaaazxzdzepzkccdofaauuazkkpqxseuossudzocxeoccuussqpoqfcxqeaqoxzpfkoaoxsauaakzouuczzdpofucucoqfqfqffsdcqzzzoazdxpdqfqsaffsdcczckespzxxkqdzxxacadzeopqaxxksxzzcdcfpufdxepdxuuksfsddppcpqqxpaudofxfpuqzquaezuuxxksueopdzaxoazkeoapacpcxekozdsxffszzzpkupusczqpfsuduupqqcopceeedpkxfooooksxqocosoqkqazxfdkqzkakseoxxfzdkdfxodauzqzpkxzefczpddqpkukxffakeokoesqsoqaqeauqodkefxzfqeukfceddodkscuskdekffxsaxaxseuaqfaaxazucseasuzekfpfapqqooqddqqdaaszxkqdcososffsoedfpecokcpcaassezffqcpudzzqfcpququkxukuesqpcecxdxfeeapokdcqudqxkkdfdokaedoaqaxzpukdapzepeskzeukoqqfexadpcoppzefodsseqkuqspkcsqexuczodfcfpfxozzeoespzsfpaczpekpfofdpfedazxdsakezkzscezexqadfecqaeeepzoszuezaxefzokuppqsqexakaseaopcfsakpzekacccqqdzufcfoskpfqkxadsxqodkeseeskpcfaqqsfozfqozzdsaapasozudkdcpssofxzfefxcpzzafdadcxddkzuaaqexxquapceaekuuuokkszeqxskpkupufxpqfpeudzkccsoczfasxddspufpqxosseodzuaoupxuaezkukufuozefzuupkuocqcuaeqskfcdfaqqxoedkzcxscodfokzfpqsqpzfoqxpkeduoaaqseuzkfxskexdadudqadokfaocofxzsssksqqzppzdseduafudxfuezpqfpxqzeaezoocxkxqccqoacduaddedsuqpxooezuqdsppcquxdoadapoeuuzappkeqsxzodeudpzapkdkadusffxqozqzcexafqzkakkfkpxpuupqqpaxuuazpzckuoacsfcfzssdqudqeksqfxpfcuuuezdxessfaduaofsqdqofofsaeucqeepscdooduxuzkoqxaoufuzxpxadakazdeefaazsqcpapcazkzuooeqkpfzcozpufseaaucpzfaepxouzeszuaeaczfpkpckesqzxuodxkpaeeskaceczxfuxkcfuuazxoxksoekxfozqospecqfakpuxfkeoucpfpxfdqusufeukcocfoakpozfozcocqsqkacxdssuxsasupfzepkeepdkcedxkoqxoskzukpozofsuqfddzdcqzduzacoqdocafzcecfokssudoczkeskozdseuxdcqapcuaaxsuefqxzkckkxsqpafkdzssuooffusffofsdoceuoddaczszkffdksqdpoodkqpakfdseazpefxxpzucukaxoeukocskfuodqpddkdzqqeasupdxzzadxappfocfxaoudcqeuckdpckasoeqxpcszccqzpzffkzkocdxqzxsdafdqdeocukzaxkuffadoffzcpszkeaqzckdsauoeoqzkafdxezacuzuxxcddzezokufsqckpeupecfekdqpfaacaaqfaaosopaafkkefeuuqasxfpoozddpzedzakouoezppzsespapfkpcepdeecdxeoacozkxkpacdxsfcffoapfoqpauausdezqspfpcxfzofuukaexfcdkadsccdccufscuudupxqfpcdeaopedquxxaoqeafpzfxkocefaakcqcexeccsaszaxxadqseaqzsoakazuzofpcokcoopzxcopefduszxoeosuzxoosdszaxzupefauuaafuzqdpeopcdapsfcdufufzuauxfckxdqspdakfksfxpkoqcquauuzoffkcxckzpscosfeupdccxeoszsoocfdsqooezpxeccxzossuoseaczooxcxazepseusdqaskecxapzuoazxxffceasxzkeqsdeeeucsdkezqkkesfcfasqqpzfdsqxsksspudsxpxsaxxczpfqxfeaasfkxfxpafffdzfqepxukxzpdpzcdxzxaxcosudqcoopzacackxzddaxkoussfucdqxcxqoudcxfkqusdqkdcfoxseqksxzkszkaepfuxpedfsqzszosqzedcouqesososasazsoczkdquuppkzeaxqoxkqqoquxspcdkpkpskkcpoksekfcusoaxdufooockufecpkodsqqeqeqoszzzozzockkezkzueuzffsqossxukcosxfszxcddckopauxpduxopexdsdusaxakczsxdaqdfkoqoqpxepzxuscffospkexxdpfazqxuxekuxxadpdasfzuzpupkzduopkqxpeafcdfksqsasqfkxxcsassodeddqpcfcdxpxexafzqsepqzkddofoaqcecfdkcfzsxzqfpdaafazzozascppsfkusffddceeqspdcckseeapdssoacqakdczadpedpkpcuqdqspazsazdcfuxafeqxucopepkzzzzuopdpuzqsxadzezaqdpsapfusqxopqdqxzoqdceoppazqszcszksdukadfucszupudxqzcaqdukaecxfsxpksdfaffzcaqxacekeazaadeuaakqukxxczafqfdqkpczxpzuexpxaeqqzdopskookddfddseuuaexukqcxcckcfxauecupqzzaeqsapccpkapoezzpdcuddpouozsfsecuukfdeczzsaxufcssecupzxezkzauskpxdusskaxeaefkuaeqkopzaszuzuqezszozzedqksuudkxxseuexpfapfxookszukqqpfquddqkzaksuzdzquzuzzdeakxfookoaakfdkozpufckxdqzqaquksuekcssuesddpzxseascpexzzzfusfzkdaqqxezzpuakzuuoeudaqpsekuuezdpxqxpkxzazuqqpfqcszceaeacxuosscdkusqdkuepfdsxeuesddxsxdfafceoakqxezfckksoffxxszsqcsfukxofedsdcxozzfqeudeexksduqaxpeusaakepdpzfzxuscfdfqzukaefdpudpdpqsueusqoeufoekkkdxssdcfckdazcsdxfepxpuzpokqoaqacqezqodpquoddfuoxffdepxoeazseodpuxdexoqkpccqqdxsfxkupozecdooxxszoxuaqxusdosaqkqaxoufuckucfzaaxodsaqxeffkeoppzoooskfukzpazduqkedkkuzopzoaoqpkdpcdeaadkzzzpkekfuaukexzpkpkcufofqaazkasxzoadeoeaccfeafsfspsszuocpzeuddxzpdkkfofesqzusaupadacsxukzcosxodpsqoepdxqdxoudpdffokufcdpusquxccsuakfocfqueuscceoekoczspfcqcdzexffcfuoxfcxxkzddquxfuzkaqucppuausekkqaoeuookexskoouszusqkzxxczusfzxfdxpkuesqzazfaosqqupfxxsupukepppspuouafcazoxdkqfakzqqasxxopdcxcufkpscscekaddzaeocdzzksozscdeakaqspscfufoxsddkckqqccskpaxkdquskokozxfxaaxcoscekspskokzoskxdeuuezazfqqqccpzfspuaxxazcfddacekppoudcsfaocupqqaouepauqodzxsafxkpxqkskdqodfafoeeuekoekuupqpoaoaaosaefupekpzeefpukupdepcdukofdksezazozzexepckaodskeapoxzfcpsseooeoadsxsxxudkoduffodzdsukkfqppqskdaqkkqfdduqccdsaqscassdezsauxodsozksdpaofooduuqsoqsuxksakxoqodopuaczzfkpdkxzfadkqddzksudzfdqeuqzoxeoeassfxecoecfqkoecadxuqkqzdqsfuaxekpxfdzxkxcufqzfqazeqczqoqafezdeqpucfxueuzkzukkdqzzkupocxqdcdkskkueeqsoecauopzuuopukffuqcsscefezuupcuxpzqzxessoffpzqqoqdoeopdxodeaxqfpsaqxuexxcoqcdfzkxzeaeaduqkazdkekkddusudccfkzfacqxzdaxqqxpxukdfexuzapeofpapufzkoffczzpzodzcospedocpdckxdqexecxkddfqcakzpdoufasqdapekxpuodzczkzkkuuxcqkseuzkppskzxcedafspfdqscsszcffapzoakcoouoxsxccseexxckeeuqeacssseqsfdecaspsxoeesaazkukdpxoooaceokcsoxpufuzfqpffoeufcoepuskokduczsfozfexpskzcpzexsupffzpsxzazfuzxpcasusqxcqeoufzpoukoeposzezkxpfqcckqeofkzafkepfkxxapfdccxdkfxooezkfpqxfusqesuexzsdsdafcdccaqcoseuoefdkdpkkadoczqeufodxxfdzucepezqkxuxcadxesxescdxcfcpaesukdcfcedazxzxuefqfxfpuzqcskocdckfkkkeduqzxxcsckfapazoseqfqauesdqkpzdeozzxdoakuqkecxcfoqkxkdsapdcsecpupeqepqxofsecesucuzkdxoaczskdqzeoacpfcksaepxkfkddafcsspeuqpxddxqfuspzfpdexfupcsppxufekkoucfcczuufduxkzpkaaxpeaexzskxqzeuzceedxxoeqkqepopsudqczupepkxsuqseccfqpddqqdadszzxadadzodsduadfdpeazouaucpcuezzxuuskxekfoxxsfokzkucodxzkexspoqcxaqxezufxxsdfxzoopzukouqkxpfxkkqxaoffszdfkzzdaaxpcaqszcfcsqkzsuefouafeddqpxqzfzszzzuaqkxcpzasxouezeusxqdxdodxqfaqcepquezqaafqkuckeoppkdkddffzczeuxafdfeozzffsfookxdxaufpxuackzpokfkskdafkksdockoffdfsxzufdosxxfpeqkkszfqfqfasooauooccsafdfscfzcqzsszpzzafsfeakqfoszkedxfkuzksaacssxzpuudouufucxxzqfpzecdkuuappfqqczzqdokokzseeappkeqocucqopaaquzopzppuuaozfukqdxkdpcqdpkqecdeqsczokzzxzzzuzzzuusapsspacxoaeocepekoxqczpqfefpuaeosueeesopzadeepedqedzupccxpfoszskufxszzaedokfpexkpokuzqxsckqozaqafapuzozoxzfzefpkuckzaoxfxdoxxsedxpuskuefaxcxcpqxszfkfpqeakaaezkpucpkefudpzxpfpqocpoudxsfuqpeefudfcaqokszcdcczupexauzqfzscefdksxfaopseefdfuxfkeckaaqouxzapouccxdseoacudfxsxsafqokduzeskkpxpsszusccffxosdozudqezeaaeqouseuddkeqeecasqsooaquxeopxqkepccupopuodooxdszeuoosdekdxoosfkcxcxafasofoduosdqekdsazeukuzxosaqucskqpakufsauoaqxpdaokcfododdqoxexxdxaeeczcezcosxxuzpazcoeqdcqdfeeffxxsoexxkdeeeazupxpapkxkzkkzquufokdqzcozfapxdzuzsodkpczaqzxszksozdackeacuasukaddqecacqsuceeoxcfxudoddquszxzduukofxfczqcpoodaqppfcaksqoukaspzksdcposeoecfxqopdzqzufuaxqdpqdpkdqpddpdocsukauxskxocxzqozofsusfxseceazdcadxasscaszkcsxpkqfuceuddxskoxsqosczossssdpxpkszcxqqoxspzozpxeczzcdkpokupueapafckeusefqozsezxcoesekoaqsupaokdzfcsqxcxuekqekuupesqkakuucqaqdffedcafkfofdceqdaddsedkdkpdscsessdxcpcpfooofcfcdzocxfofpauocaoeukcoofaxkopfqpacespoddoeeakpszzfpqaeqpsxxcfekpudoqpfosdsfqcdexxuffsfxczeszapdspdsuxszeucsxoddodqxcdqdzqeoxspeoqskkoupqcxfzuefpszpaqdfasqxxfsfeeccuudfuaouecaxpuxdkcsdeszesoesqoaxuoxscdosfoquqpusoczsdpupzaedekkkdscoaocpdedqapqdsoscqksqsxocuezfppdpzqpefsppsskaxspukdqcsaezepdkzfzooxcsqpqqacxzukeoeozcdsduouocqdaaacuuupzaapfdqxpqppkuexdsxfkopaufseeudqspceuecxukksaappfqsqxaezfepdqessqxzfdceauezapkedsdadafdcuqceqeqqezaueffoxaeazzskkkoxapedkdxsqzzpxxusedsoffakoxsxseqfxkqudofkzexkzzqpqcaduxsxkozpkokaeazxdkkcqoqqkcxsckxcxfkdxaqdkofesqzekaeeskzuouoxauakepsuocpefddxodaufofquafpdadzocsspocdkuxaexexekzceaazakkdcqkuqodpazqoxfcqaffuzquocouzqufxkqqaezdccuazqcpfeuoqscxfuxzkououusxkdxoexdxqukkqdcdxsuxuffekxfpukzedqocscuxedsoxaxxqcquxkckfoqxqqoakepdxkpfdzppupxuazzqsposfaadspuaszzoxddxcfxdafpdeskfopzaxqkacffzkdoosaepqxkudckfzzfcudoacfzeoscokezqczoexezsuaqeacdxodkopdcozpzcdefcoqszpcazkfxcssusaupzzfuosfeduxsokkuzdefkukofxasadfdqdzcqfaxofqeaeqazdfzfquoqsoafozpupcczpfkfqazopdsfcxqsofqpkokeoxeqddfdqopokqdzesqpddsddsqddafukusckzpqaeqqaofpuquoeqpzsafsqzfcquzeuaxfdeexfkxezaoexxoeafdeszefcaazacfxkxzeaaasqxoaeccodxaxsocxkezkpzpcxssasqckxodfpcxxapeaddozdocszesdufszfxqxoqozfezxpkzekezoxdoaecuapqekoadzcppdccdzqcdxqfkpzseffqaadkaxcceofsckefzaazeekpcxczukzqsufxzzzpqzfxxzpsdfxepfpkfcfxufucoeczpufcdxoezxdcscqkazksockzqcuoaffqqdudfdsfdafcefoefcqpouqucdkazdopaqaxpsuqoeukacdfdqxxopaduzcdqesefzpkeqqapfkeqczfefkkuodqsffdcfsdeooqxoxukckczkkcqkoucoqzosfxedcadeduakcqxfdeoeddcdekcppdxcxseuxspepfdeopxzkoqacdkqaccpeaupzdapcddaeqduqxffppkkpcseokdxkkfaqfqqudxzcozfcpausdpxadkxffcqoudkqquaufezazxdsuukospuzzfqaaaqakqoeuzqqaocxdauocfkfuqkofsossdexuqxkccqepkfaouseuoqacqpdkqpodzxdfokpppsxcpqfpzduaefdcadxupccodkkxfcdsapcfqxozxscdoqoacozfqqdkodakxpdodcdzfczfsqceupzpzqfouoezssuaezcfszoxxfsufkckaafadkcdqaazxxzkufqpdxuxcucdspcpuaepfupcufozqpkffddzxexpqoadaeqaecdefufqxqcoeaaqcffcuexaekszdxdzfdadqauacpzxdeseeoazpukuqufxqxfoqsxxzqqxoqqeeucesccdkcopeepeqdpzdxdpdszocxoezuaaqpqssxczeefqkuuocfczxkopofxcuqpauxpddqkkzusosuqpxfqpzcxkappkoeudqscxzqeeeqaosepppppzupcaaoaaescqxsedxksdzcouuxqkqzoukpuxqcddxddqxaaeckxkeuupqffzofefpqqfukukfudpcpfopaauokcdfseuzcpduspuofauffqxcouxcpuxuszqpcopapseexfufuqokfxfeuudqqdofqeaukqzdeczoafofxxpdepzddqpzupcauepxdqukzocceuqaouzczufuoodeakxcaksdkpcadaacuxoauqduufqefekfsqdccexazxfzecqokfcpppfouecdefdpqfcccfskuxkdkqexdefpozpfdxpauqzsezkpoodadqkdeuefzddxkeqxeusfskaedsuzcuzoxpazeeexuzqqzosdqdzocqzokkdeeeokxuqfoqsqeffccfzskukfkzedoxxcdfezkdusuaxpucfqcducffapeqkesdockosadxpazscfqxossaqzxkxcsekddkcpocfpxkcdxoqoazcefepuaeqzpkqdozqokeqspezeqxdxkpzexqusaskpqkpxefzqduopxuxzxoxqpzqcxuxqdqaaaffcczxakueukkxkazecxffzzufokcusqqdeazuffqqaqaoououqodeauadzezpuuefaqacxcxffpoqqczacdpodkqpdfxfscookkkauksqoxpxouxukuuzqfzoapzzkudzpxzookzdsxdpqouusekqaqoosuxuczuqpuxoeqpazasqexxededqxoozccuxspzdpzsxpxofzuouddqsffxaocpdsfkoczffdxfuoospfdccsqfupzezoacpkkxzxkuzfpfpdzzxefpffucauoekfpqkksudzaxueddaodszdoacuxuqxkdfpkzueksdakupukkaxuqkpzdecseuuzxzpzuusfspxqudkaeasqqxdqdcocfakpzsaxdfzkcepckxdafoozzfpxqqpspkuuxefxxzffacazuuxedexapspsqockfasqczaxqccczdofxqxpeadspsekxeuapeucxdqupkqdcofzfzsoaocezqppsxzspxuoeaacoxoqedpzfcoxspsaqopeazposdozaqzadueedpsqzxfaudoudfzzpeqsozsqofxuakpxeaeuokaoqouappacpqzzpokqdkepeupcsdpsseekdcpokozssqkqxccdudkqcduxsodofxzzszuqxpkosqecsffezpzouakdaksxezkqufkqqeufcexekefqufzxezcsxczzzskeoacpoduedacfzxxukoxpccudodzfzcdozpaezqxqcxfexakoqzfofzfoeukccfzkecacfofopuxupqsaqqaexoqpcxeuooqupaodqxooxaksezocfappkpcxxppacxufucxzdffzoozzcpeauczdsqaedzaexecczededpeapxdfqxdkafxapsaaseazdzzqdfzdosfuaxdkquudfkffdkepazqspuoscxkfukduakeoazspfodsddeaussapadkfqdxpfassudasazczqcukcfpafzdcqqeuzfoqueucuosccsopucpekcxekexpaaezzukefzqcokusceqqxqzkusczfesckuzdoxqkcdaszezoocdqauedzoscdaffcqxaedcfxpfssqpkkpokqzppedxaekfcpfuaxaduuapqusappdzpkozxdqepcfpxuzduafqdpesfuduccfpozdukcfeofuzcczpxkqudcsqqdussoazdcuzzscqczzdqqaapxoqadefzezdduqpxzcospauqzpzfuafuzxpfpqudfpacdupqffakuopoxqskqffdozaefacckdasopzocdqdskpaddfsxfqxoxfpopzfcsxspxuapzkpkckuufppuqfeaazzsukqaqpxucsfxfsxkfpkckdcckduepxkczfkfxzcucdqedxfduzdooafcusqczooaupsaskkkpkcqszcsexaudkqfepadqcfszoxexkakupcssodupqfccpoccsdkpfuqsazppecdfqfqzxfffcadpkokqeesaozekupazpzaxfckucuoekcazcsqckxzuddoapadszxkzczexzaxofxozqaoqaksfkkqecaxpecaouaqqdadukfocecfqaepuepzpaqoufkuqpaxpfcdxaaokokqopdecsdcecueazzosdzfzquffuozaacaoqukoszeeuskekdpouqpspckkozksuzafexpaqduudcfkzdqfcoxxauapxsuddcxaouskpkzucfzasxozdxekpeaxpqeedcakqfdoezupfqzdqxsxoscdakecxcxxoexqaakeazzoppqpfuqpupfpuxsxcfoofpdzfozcqofzfpcadxzecqcqpzzzozcaodfkscpdakkcpcfafzpqdaqxqeppxuueccxxfscxqxcufqqkfexocoeazadpfeuoofpxxkudczqufpsdauqodsxsddefedxoqzdpxsaaekqofkqexosxpfxooczsddsoazukzqexasueccpskpqeekadaccefuaoodxqfxuaqfzkzsazcaxkpzxzcakafkcquqasussdpuqskscooxkkuzaudcfpaofsacxeczpdaskqfdkqusqkdfexczasaxufuzxcqkfauzdkzsaauuoexpqsauqpsoufqauaopuoauuxazkpfoedqpekoxoxsckqxuuzefdxxsapokdsdadkqoquqpozdkkuqqppkkexpxdefsfodpzzdcxoqeedszkofufcaaouczkcdqkfseqaesupdaaezquqqkefupusoxosozfucezuqfdpocfsczpuouzzauxxzkuopazfuekdeoucfuquosfdpsdqzosfosxddzpqxxcaxekcccfzapzpkpfcpzodsxzazxsuzoapspzfzcpxfcozdpczzpqqdxkpxacadzpkaxzadzsdckkfufkopkzadfkkecuppoadfdxduaspkkaouceqeckpqqeoxpfazuequqxsaaxedpddxqoexoaaqqzzfpdqzdxuxskfpeoxpadpozepsufqcasexukdkdppxsqokqzpzqqfodsfcqekdkoqzpezqopsucxesaakppzzxkkzupuakzscdppopecfkeozsdepkxdecffaeefzouxxzcqzpxsdkdpqsdqedpqdcazpcezeaaesoqkocqcsscxccusqpdxzapaaqdpocsucqesacuscucoooozeksdocokzxoxzaqpufssaeqosxdfxpdsazoqxqkxzuudkxkfseackczxfcucoepzazoxcxoxuzzkpfsqkoeeecpkaqdeufcaezacoqoqcefzzzuxzedzazdxacqxkazsdeaexuqkfqqxoscpeaeakexqususofxpaufpouszxxpxszzeqauepsssqoexaaqsfqfacdoxxsedxudxfcddzxsskkakuszaeouxdxedcfaukpafcqaquucoupkcpfcaqdopfqxoxukekkssxzczkzxefdffakpkpfedazoccozckzeseqdqzeokzkdszusueozccasoqzsdksdckeadocassasskqpuepeapcxzsxqqcqafapzaxesaucfxkoecqoexeekodqqodkaadzzosudopoaezpuekpqfocdcsqfkxqfufsxocdeedzcxkkpffzzeodfqxqeuoczzkkkxscfasackopdxfuqssupsqfcpoqupekcqxdefuskdkxpzefkzsodqpqpdkedxccppexpqcdfxpqsfxeocqpxppdszcpofaedkxcsksuaudossppcaexeuzdkfsuxsucpssqaouooucozzfdekuasqokxppsupqoecopfdopoczddqdksqozuxudqqzfsofapqcecxffcfcauufsesqeeeaaacpkoqoppfuspodpxaqsqssssuzxxcqcqzuzxkuxoaaqodqpaccqxxpucuuuepdkqdescoxufzxsokxczqapqcxpkusfxddsfeukfssqxacxqcafxoqufcfdaadkqduoudkqfkzcqfxccddzuquzukcsddqqzqqsxxspfocdsxzqszcfooopddcddeasuqcoauqefaefcozuzouxqzceaesszzqcdpupqkccxucxksqczcopddaksczsxzuuupekpzpfdafzzesfeozfzoexuexeckfeqoxfqaufdxkqozaqduxcaszfzxsuueuakqpupkkacoeacaosesqzquxofkdaoscacfxaqxpddsapquuzefqssxuskqazqscdudupqfqfskkqxzpaoepupfuxuqdxxoucpsdfpaxudcxxfufpdxuekzfcapcfqqksssuuekcdoxdkusouuqfcpppcedqqpcsfspxpuacacxxdczfesuqksepsseqxkqqfzpkeqxzoxpzspcokfdufqezzfzcpuupczqxqafxxfzfspzzxdzckeaxffqecfqxsqkupfkxpfodpcsxfossqcefkpkxuaauuxpefekszfcdzcqksuazesfpksxeuxuoxoqoaqxpqoxocpfxzqueouekcuuozoxzacczqocauqsdpauozfsddpduesxkpppofzuusqdpfkscoaxpapqqcffeofdfuuuxoudsossaoqoddqeppusoakxkfeoqazpacofepzqqkxsssqqfexpkqkpauqddfxusdzkpkzcdzdqxuudezuecofeezfoqodzpzcooooqdzeppsqepkpxozqcqsefzfkupkskaaxozuqsqccocoqffoxqkxqqzfzzdxkossqfqapekxuqzosqudeqaczzxpeoxqzzqeaoqszsccpfxqucszkuaqckdufssqukpoafsasoaxpzpdzfdaaqqeeudszdduzkeaqxxkkxcdcooakcsqauazpzfffpxsepafeuasszfezszusfzseeuqsozzqqaddoxofxoeuosudxszekzfszqsezaeoukspukoakfoaakxoeaszezuepddqkqkeopxezduqxedxdoqcxoukacpxaadfezuopzxuokpfkfkqfsaoucqcxoqcofxqpozfdspdzacxxpfcoapoofxdqcpupskecuadsqpqskasxufocdusxkqoapxfqzquqzuuzeueezpdfeszzzxkaodfpcfazsodfosqekuqexaxzaudquedzxaaqooedcfxdzsquadfaodofszauacodapuaszzfdaoazxxszxsqfapfdxfzxddauazqsxsousoosdqsuffdzssszdkspffcezpsxfxqkaauzapadusdskdzkpsouzqecxuuzdpdzsxqqzsfoccukesuekopaaeasxduzucfsdodaqpzexacqozduzsfuopckxqfqzosffcqooacoskdddzaxudekfoksqseesaozzdpuzxfxueeazxuaudeqpfafezuakquuxuqqxdofakusckzdoccqsksffupqazsfzqcxkazcepkaoczqecskaapaszkpeufzfquoazopqeeexecesaquoefufuakzckezcexxxacpqocoqqdukfkpccpxaxuqaodsdxqxsoppaskpoodfcxsasaxxpqkofdkkscqfaescaxffpzocxksapuacfpsqucukfukfaaauzdeqackxddsfzkxafeddkpuucaccodckxdskcdzdssskozoeuxqcpaszpxpkasxosfdafkkspakpxaeedxzpzeqpxkpuskspposeaoezzfdaceaozsdpfsxxzkdxpsccfdcsupzqqpeokoaoppfseqqcdafkxxkxaoxxcoaqkedaudkszqsqqzapzpkkczskaapcdcadaoeaxepufpqeffkcfcqdapeusqxfqqpsoudcfzfdfqpazcdqoafffeuaassuosfodqxfxkcffeqooqsafupcafoscauapfufqckufkkdzsfkasufpapezxsapzkdskcadooczaqcaeapouupzecxxffeuakdzxxooufkzfkqpqeodeocoeaassaadaaaouoouaxzcooxfpouckuqopqacauezxzusfsxzzoeczfedaqfauqqqzqfefkedkuxdedzazpxcfezkskpkksepzzkkqcdaqxaueukxzcxkoqpxszkuozqeaokkfoeuksokxpsukascedkooofupdcqxfzccaeaxqoszoadekszesusudfqkusfqeeuoqcedouzzsazzocpscucdcooffqdqpededpucdxouzoeopfkzsuakeqffdpufuxozqeudaccxkxxucxaxdqqofxkodfufczaxuuocxkuxzeeokckssaqcefseeeqpzpfqcfcpdsxzozdksxaquskdpcfpdqxeupescaeazdzdqxfppzdpsofaooqcxpdqppzaaqzaasuukkfeuksksaadpusqqcpuodscuoccquzzqeskfucqpuzukacdceauduocdokzaozdpzdqskfupkdaeksapdxxfkkupkoqzcqpfpazpcxsdzuzsckdaqxokufeofepofcoexfcefdxsoazzsxkfaakepczdfsqaekdcuzapdoxdoequkxzszeouodkpauaqxxdxxspfoksqedkpzpzkssszfakkfxesuqkuxadapfzeuqddqcakaeksesaedxdsuxzofxoaaadaefzxpseqdpzzsdexefcxaaxzxqexdpucoqpkexcdxuqdkaqokaaokkzzpkxdpupppucekxkkxqkpopqpfdaxzffuedcsqkxzcceaofqckzazdpkfeduaxdoqafpaoaecokxfeqeqaeeppzapzafufzksdeuukczkzepzffcqqkxuskdczzdaukkoaxaeufcqcueexkcpksueuoaxudsduaqacqxeuzxqadcuqodaafpecfddoxooaquuofkxofazcfkcduszqpcsfzkafqkdcfxkfpoexoedefqqoqesfazsdfadaqfzkezducucfxqsuuesfqdokdzoopdsscofqaqufpekexacqsuoddfpekkzscpdupdsoqakzpfpuccpqeezeofzzduuqopppdooedfzzxszzeupsssozcxaeeaofqeqxdqfdskcodqexeedpfoapxzoasppdoexdxqksfxzeqcskfoezpxpzpasfeeoczakdxdpxzzzkofuokdcudsppqqeoskfoqcxkokpxffkkcufdfkoxeaepqeecxkoxqofasefudaaukqppsuqpuxzzqezeqpzdsxkeeesqxckafxecxcksdfcopedkfeoqzapdozxfkcxqezzoxasdfospkxcxeazpxkdxkzkoksueqqzsfdkkcpkpcfseososdckxkxzkuqkpapkcqcxsfkascqukazeqkqdequuqzqakefqdkfxzczpkaoozdeuspqezepeuuxkfqccoaoeasoqsqxsoquspaakscdxfpdqqkdzkfkofeeozpqefeuakzduadsxousedxsceqosfoqfoxokeoecacfkkoekoucudxkuodeuzcosskdzssdadpppexxqzkkpzzxqpdqxsskazpkpqooozxepcuaqcookzuopqcxoccpkpspsfadkeseuscsekszzqekzxaoosdzocazuouueokkfqxddueccpcxsoufkfscqkosqdfzzzfxcaxukzpcppskuucfoxuupxqeauapfscuaxpssqpfpoaqezaupuoeeaesdcfckxfkqekfzaezfzfppoadpuaukxeezpaupcsaedxaxfudxpdczzusdszdoaqeszksudzxscdusxzekqpapxkfxzekxsakfzxdfpsxxxeaxzcdqkpuezpuffszkucucdfzcxqfukqxezakkdaqafsdoxzfzzsqddqeauzuzapkxfpzepffokuzcszdkufaudozqezkqfdapacxpdcskacoeqadppsppeqkkxkeukxpuakzeqpxcusxexfcufzdpfqucdekeukasuaufeufseceofufodcckzcfaqskassdooddpeskquoqcxkzxxxxsfpqpcxcefsopuduokaadpuxssoepofookapzzkoofkoxqppfcasqakpspaoqdokdeaoquqqdufesedecaaedkcfskoxozofpzapooxdceceuucdpdqpfcsspdkozkaaeauequufkedupupfxcdoqcuuadffofadzeepzfszospaeuzxfkaduxakfqpokxokfkcckadufskqeexpxaexeofkszsqafzskfqczzkekuucfquosuqxdpudpdzzzsqqkuppkfspedzdsfeauuadeqccqkqcdzouodfaxpzsusksoxddauusofxeezzsqdokdcfuaqceccffscxofqczdafqofeoxdzaxqcpqfcqxqeoseqookqpzkesfusuxfkxdopfscodaexxxsuqqdksafcqxafcsqzdeqepzsoqqefkdqzkupoczxkquuxdosssexauupoaqsocxpzqkpoqfqkadozqupqksfofqduouosqacezddsxkfpckecxsodfaezfdesxezfspdcdopooxdqepadfacdkeqpdfqpuddekquuuaxouuckzsuodxsapkekduqzfupuqqaoukceaxfckzopopfzezsqxczpkpoxuxfpcpzpkkodddpqodcfcfoccousczxspqusdqzuepxkpcqqufeaopdosefppqeukkppeaaxpzpsckfduoqfxkeeuqokocxkepedoqekqsoekeeaspsauoedqoqoxxqooqopfuqkeozefusezddcofpcfcoquopqspspxsokusfkdsdouczecoccdzcxfucquksseuqeezpdpkdxdkosozzcqepfppaaqpecakzszpafoqqxkoooqxpkfkxuxcucxkksuupuaoaksqpxsukqooqaesaqffkszdqokpxedzzszokddozzfxufxqooacsxcdskfuqoozuscpeqzszdkueezefqspsepfudpepczuquekfxocuzzdkdekpsppukauaoeqzooasosoxzpdfofduoceeapxspscudsdxxqeodzzzefqpqukfaqkuuqezssufoqdakfdxpskaposxauqdxcuofkaafceedakasxdpsaupfozduppakfdqudupfpaukkzqcpesoapqoaqeauuufepedekspfqqcqfksdqeckfpaddqqpqespaeqfdcfszpqpszpfaezeakoeauxdzxzzfsdesxaexofoxuaddddcaudaezeuodxuocxkczzafussdokcdksxdusdqekazsekpuuxupkucquaqxofapxdudzkuuqppfxsazpusufxudckdxeeapfoopzfuzudeekeazpfepsakdepkkszczukzzskkzpecxopqecksupppxspdqassoqdfqsdxcfsqszadqfuqzxqzazscaazfdqfkxxxfapzzfdkpesokcezceeeefuducdeekzqcpqopcczeucaeacoexkxuaoszfkpoeefczokkczpuofoxscocspckdekeuxqdcuadkpukcsdksecxdeqefxqceoqzpcdcofqfkufsefkuqqaqusspxefkkszpesxzauqkkpzucopacezucaufuqaedekezppesasxxkauqpsudzesdskcxoxozepdeaoescqsezksppeequskdsxxzzuexkqqzpefsksakqxdzexkeofxcczdsodzfdaoefqxcxsppzfzdaoqdqspqocdcfkuocqcfxdpcpzkzoodzeasocxqxfkksudfscpospzekxapafeazzuaffzcsozpcsusxdzocddscffpckceescdeodudpdzdqkczccsuddkzoxcszcqudsfduqouqdsescdaudqddkcukdkfufzdxczssszqxquodsaqpfcfeupqffafdkcokffkxocczdsfqadcfzeufcpxpdoefqskeeuacsasossaxcpxucfecxafqppdeuccfzxpcsceqcfpceqfqaazffcxsspfczcaxpkoeezquxcfcfuueoxepqufpozsdkdoocudezspxdofdfzceckxzdasokacapzspxkadccsckzcxouuqsazefsseeufquaeauepoppfcqfeoaaeceekkkqazofzakcqequaoqquueaouzoqofxpoxsfoasezzedzeduaqpausfxkxsquzdpzeafqaqzqzqdupzczdodkecexosskzapeuqqqkufdfpapaeokafkquedopcazkozxpcaszxuuqzcuxqcxooffqcxzqspzaqfaxcefedfoecspqaoakczfezafdpzzacffdpkoodcqdfqfpuuccpafdkzoozocxozkfcuacdsaqkopkaqzkdafszcspsofesdfopxdoesxzfoxopuxckskdkozpsqeefueofqfkceqkckzkuczsuoododeeospxdspdzpzazopxezkccssaaxueufopzdscdsoupudccsxqoafddecekapkfppaxouokofaacakcffseaskqxdaecukacusaaauqzxkdxxufsppazqsdseqeacxucxsodcpaukoodeasoeauoupfxqezxdokdeckeoexcofacqcpxuooqacqzkqduuouucoepqafcdqqopezckxcuezesqqxcqkdodspskzsdfoufoecouzupkqepqfpoasoeoxfqfafkqoodkqcxfasoxzqkeadpusoxxczkkqdqkcpdkxfefsdkaqsqfoueapuoxqqaefdekzofacpfkxzpppxdqxkxzdzpdcfaukkcaecuzfdsdoesoddpuezaoceqqkqpoxpcxfcezkaxdquduoskdefsoqaaffakuzeqqfoddedozcpfdaoaaooufcxafszpzqedxxeoszcqxeeqoqupquxkqkzxpaqcpkupdxeaosukeokukokeackfazxpeekafazxecooaqxkuscszdsqxufpxfpzsecoskffufoepcefpuxuoaafaaqqqapspxdzoqkqzqzpxcuosakeaaodpoqzppzuqasfzpdfacuoxasszqpcsupqqocuouxkzsecuxzfadqksadzppxoccaecepduefxdozkkzucooaxdqeqaufdsdekxecxdekfkoduxkzuzuazdzskadsxqcuuzkoqucodfxoueskqqcxcozddesxufxezkexkqkkqdkeeoqaoaxpusuqxpapekzuseuofaoqszkpcufkadxceuszefefqqzqokcfdockezdxkcduoxasccaqcckfazffspkkkcesxfzoqukuekadxpkxcpxsxesxcdcxzzcxakezuckdcudpaccxqqzqudksdcsdfqezeokcksoaakczaxcuzuqkfqspokaczdcpsaaapdzqdeuekqudezuszpkopodpkkudcdzudfpxuudooddsuaskuuacsddsdkedusdeqqazezzauukfopxodskzfodcuuqzecqfpeeopupouzxqfxoepkkqfzfofpkxzosecssepecackdacdzkqcuxczesoxkuacqxqfkocspedcqcxkauzufufcpdccoskdufzfocfusapaxseeosqpdzedksfaqkcexsopusepsdaofpapafpuqaxpekkfpcxueozezfeaoufxeqxsxocxefdxasacxxqocueufoxdzqsxxzxfaeaqcqdqkzookduaodsaapdzzoxkddpkxakapfqkuffcfdxdzfkspcccscukfosuekzdcpoezefuudoufozxepccsaqsezsscdakcokzsxkqakzqzsxsqqpsxdqazesooequqpfoeddascksoazsppsxqpxeskcspcdoaauzuexpqekazpdfaqapxcduqxqeedekzfxduesafuazspduoqfakqfzkqsoquqxzkapzqkzzxkzesekaseqqfakeakspdpsszaxpdkpaxfpzekpoxafqdazxasckdzdkkxxduzxsusdxoxofzxpzafzfookkcopfdxsququkuuxqdcozcckkekduczdcquzzfopoauoceekpkuzcxczksxpcfzkceuszzakoudducpqoppzczszkkzscpeduqzazopeueoozakxdposddokafdzuuxqxpzfocexckkouaksqueaafszupcqsfczxpaqssopecoxqaxkxaxxkfuueeqffuexxcsspskpqppepzupukouuzzuqdufueczoucdxaqufsskefupddokoppkpsfadoocafefexdddqcosqcxcpfsqkdafezuzzooofzqkpoacducoexekappqpqdkskdcuqouopqzqfdookcqefxdkesdxqpqaffpqkppdasckkpeqokqpufpeuccqosfqfsfoqfzeqdxekfxqsexoxaxkcqpkodaskcoufaopopoffcepuaepozcdkeqcskszpfksxupadoqqscdsekfufqxeapfecescdfepkocuxccqodzkpexcduccaeaxsdfsksexxxzekxfqaaafkccfesqsaqkczopedpkkuaquuduofacesfkzofcsozxzdkoqesfdqqddoecdaxqzcpacfxqpupzsusexeqqdooexxsfkzpxuufskapokfpseukapaspsucdsuaqexcxpxauudfdxuksdcpszouxokosxzxfxeefzxdusaozxozpquzfdxueouzsxadckadedxdzdaxkuduausxssofxazoeefskqdcqufukaaazaqfkpsuoocsqscapkesppafapakukcxxqufasszdqdfqqpppfdkxzszaqsafxfepqzpqacoqscuqdacsfcfuxpazufxzxzsoxodzakuxxzudpdfsqpszqqxaxfffpkxeqozuoakxucfufpduqqoauxkueodosoadfpxsefszfopqufspuxzukesfakxkkfzcfxckpzzosekzxpaapekxoksepeeeuexzaupfqqqqezdxqxfxusopfffxcsaddqfqpusuoqoccszuffzupfcdfuxukuuseskaeopcdazqqezsokcauoffddzfexsudcapxaueaouedpxxeufszqkcfzuaxxopdaxzaekzcuouqzqedqqksupdxcuafoxqzpdufaucxacasuquaoddceazzkcokesdkpoapdokaqxuaquzcquduadcecpufaeqcxqskafupdkepcfuqudazodsfdsxddppsoaacsodfqsudeuacqazueqsspoxfcqfuzdfpedfzpqdqozkzqpukzadxpoqpqppodacszaxzfdaacpfedszzukfqeqxczpexupsfzseqssdukqcccqpfxseqkfefouaaoeoekaufzszseaoccpofdqaeeoqqdosqfqsfxzoszddcdzaskqfuxedcxzzaspqduqcafaafuceseqpaaueaqdeksksqkxzksssadzkkkoudppesxocoppoxezezefaskxeuquckpofxqcakueszpfccssaeqdzqeoookudedkzcxpdpqaucssaspouusqqxaopausopxuzcoukdkfzakddzdkkqoqozukxduufaquazzuafasupdxzauoeqxssdsfofpzpzdexfpdcaxofkccfzzpzesuqoxqxeaxcepxuooezcpappuazkfuoofdfxpppqqxucsauczapakkuzdoeossaksszokdcfqfqofcoquozfafsdzskcccdaokaszdzepkdpzdeqdoeqxppckpopoxpuseqdcesoxscasodaepqkfqexoqeduqufkdszuaopdaucszffuofoquxzcfausskzexkfxqdokoqokpcsfcsqeeaeocssxufcssopakodapeefukouzufcuzkeafzfzeaasfeqaxdxuuqzudpqoeaadeaadqzzszzscqcauauafcocaxxocdxxqeokxcapsadxpsfqacpducffsxxaqdcdafakudedekdkfkccfpcqueksxfuasecookxxxpaouuefqddqakadduzcfzspszceuofxfufouozfcecueuadexekacxdoocoespdfpecxxzkzasfffpkkkpfpkuuqqkucfqsspqkddpcueokuzskskoceoqucucofuspkppppcdpsodxxeuaescpauezfzfzazkzsqxpukqpkcsfsqsqsqfkkzusdxspxcpsaoppzaszfdkcqssufcapeufssupcesxcekqzcqckoxczfcqeuqocxpacadkckpuucufszuesdzdxzaozxceddfxpapppckufpokuqfuofzuccfozkxzkqfdpfdocdpqddasxsppcsxadckpakuqkkkffeofezzakkuexfockzcpcaodscfaaqkksacxosepsecseuofukafkcpepauxxskasefazeaopxqkzqfkxqfccodsqxokdeoafqufczdcpzpksqzzzsqqqxzpzuazeoefxpxoxupzfuzqppakfspoexskkcdexsqcsdpdxpxcukuzkausxczexxfdkqqxfxdsdsfdxeuuxoczcxepdqqfzouufaqfksqzepzokpuzfcxxxzzxppofduaquppaqukkxfqffucpeedqxcfaeqdkpekfadcdxxpoeqfopezexdqkzuqxfeepquoqfzzpfdzcpaosacsopdesuxoupaqdskspxcuceodspazpqkxoekkfsesxkafckqaqzsqeepxffouodezkkzfpkfaxzuoaxfdecqpkfpdqpfceqxdcafczzdccecquxasszddqxzozdzapsfkuxzuuzqqoozoukxaozdzoxufdspudoczuaueszdaxsfcqupqffpcsefcaeccokdqqksfuoezuxapoekkofkzfxqcsdscfssuppdscsskdcdxspoeqaaooasqcusucaxfqxkdsfkzfkppfazqeufoxkzzaesczxaazdeqofdxcoxafqxcodsfquzodefpaszdazauuspxzzzffxdeodczqasozxxqqckfaaqeoauoskssfszfszcucdpozkeqeauukufxxexucufuzxoadxedopsdpcfaezpfxfcpqxpoffkufpsfecxzaxxxzecxxafpeueaozdoqkpouqffxfuozfkquqkczkauaspzqksufxdfxfsascqpkpqdskeuspddqsefsfcqffxqdpusxozkczpxpfexuudzkxpkzakoseucsffsakepfzsuqcekuqqopscfdzooxfcdazdepoazfpzszxcoxxacxascessuexqccsssacodpocxzsueccucxxxzakazudpqoaaeeaxocfeeoqofxdsqasxakfzsaqfkuqouzedaxpqeducdqoapzeqdffxsxsssdzczfqqcapcdccksccpokafcpupzakfaoxzoepsqqeudacdpqexakapscczqqczxxexpuduxfxddfqaaqccaczspfzkcpazfoocxsqaxsocpocqzxskoopxscpxdqkdddffaaqpauduefqxkxxdsaxoecaoupuduezzqzzacedaxffzczducfcxufofkqsexzxazudqdcqcezpdxfpssdezousxcufpkaaooekdukpqfdpesfofsacqqcxzcfeekuzokfsqeufzppuaefxkqzsouaqpofpqxsackpecqoffxueuudfeksdfcuzfacqfsxfsqzuzdufpouexquufcaaopoddpdfeudofpsqfqqqukuuqddfdezfxekcxzsqadppqscxdqdefxxezfxofzqcodsxcecakqucpqsquxauzpekdcxupeopxxxxqckfapoacfzxdaddaqeccouuoqkackacdcozqoskpqqcedfuqpxczksexezfoufxqopedzdfccufxadpxpkoquqfoepzqedopfpzsckpocuzdqksakfequsefpfzfokqofszkafokkfpqocdcuqfppfzuepuckskkkazoaqqeaofczpxkkxupuxqxdceqzqpqssacxkzfkfffcqqqsxxzepafdpkpcfzduosfxqzxqdpeusdcasqesezoxpedsussefokkfqaduefpxocqadxedxoeodufxzdqaddazqzxpeappzpdsocqfsfusxedkzuqodeacusckeaqofaddcfszofdczfxsosfsqauaufkzczouucxedcqsaxcazfepeaozxpezdceqeszsepkdoocqdcseqfpzazuokaekxzsqxkqcdskaooukxqpzooafacuuqzxofaqczkzdskczfoppeauedccsdezxoqoexzpkaszdeqpfzasczupqeoexfuxsuqcapaoufeczaaqxdxezafdfpaookdockaekfzecxfpukosfufskzqozsxaqkeudsoepodpqzfxkososssequfpueuzzocpdqfdfaodfcdeoaadeaxfkuueppzqqoqxxszccoqkzocfuckuqpeokpdfepoedpsfksqdqfdfzkkpoedkcaeodazqqqpfzusdscusocoxodcoadocffqqqzxxkdqapasozzcdcfxqzdkaxxukppfoappzccukeexcdccssesxocfocafzcpsacucpeeooueeeposecqueoxkaxcxdofofxkffkqxzeoceszsufdzsudsuokxcxzcdfoaozzqapqfkcazfapokxccdqfqkxxopcdqpepcuzkcakezxcxefezzopazofuezccoseddzzxoedpezksqzqapsepfxauxpcffufpeckfxcsozcskesafezkdfxzxopucqdeaaxdxusskaqddouoepuedseccpfxspoxqppqexsoexfefcxscocazcoqofppsdpuezcsdzkcupseoqfofqxsuepuapfpossoufuockaceucckksqcxqxquaupaadsfcsfqofqqazfazqzfuxeoqouuafcfakqaasfcqazazcupkfkekoxdexxkepauszpoasxkquaucfpdexoxdsxzecaocxfdokocuzzockqxkfkkkakzffxfadcckqxdspzdsufuokpeocecouzpaooeudzkksdefpxocfkfpxdkupfsxxsqdqsdudfqqoasepzspxqzffadoaxfcxkzaxoxzaxuacufuexdzsqaxpkzaoxuukuqqcuzoaudqqoxofqsadezpddcexaudffqpcocpfsqcsokefpufodsoxqkapskozqccokqksczouueszsxkduqozosueupqdquuospduzpupscxzpeqdcuuqqdduddfxapoqauzuuoqsceccqdpocsxooezekkfzuoufoaqzxpecszokssaskocfxpzepcezpzzxquucsduasxdeasczxdzczsooszfzaxqzofdueepoaxozczeuzfxcaksasfuczzuuoepudkeoezdaekeppuxfocqksxoxdkzokpkpfsokqqposuskkopzoqkaqqedffxdpzpuqeqddxpcduzcecsddcqdczexxdxdzueezuosozqkpzoezqfzoefodzqxezqadzzccxpsqokdukzffuezszepaqzexeuqdcokcpcskoccffdcucpkdzaosfzdcqcoxucqcsccooedfouedxpdaaqduszpofpxeessffkeqqpkopeeczaffdpdkacuaasodakkdpepaapoazakkakezqfudxczzfdokspssoaucuzafeofqdzfcsquceuokdaeesdqkukqkpcxpuoceexafpqcuqxcdfddaeduszcccpfzesaofoqfsdeepckuzzaeosxckzcpxxqqapucuqcecxdxopfccdaffeokkqccscuaquokdezzasdzdapupppdueqaefkfpuzuddpfkseeckdaodaedceudfxcxequpsfkppqcaazqfzpzaksoauuekqocksxoescfqkpxapcqaqadaqdaksxzqosaqfffcfsqpxxkfafkuaexussokkzedoupefasseaekzfpasxxfausxxeucxsoudsduccfeeuduzssuppcopqcxdkukazesqkaxxqxqokkqusxqpppxpcopoqpcqasuqdksudzaczfpcezauedxscqqdzpqkckuduxocaksxpakqxaksudzdpxqapxkxpafquuqzzqupdaskzdqsedxoaqcpxfuxukfafdaqfzekkapscusxsdqaqusxucpcaudezpsckaqqoaqosfakkqkfddofqkdcuekdecadzackpfqcquepsqoaqcxeeckccozzcxxckeocfckdkzukqssxkdkeofcuuuskfkxasoeepzeqfzscaudkxepqczacdfocsfueeccqkacpafqqsdaaapoooqzzpdaxaopuspaaskcpczpeqfcdfucqzzsszcfeqouscepssqqeaxoxoaezqeppaooeoosszsxaxapadxzfecxauzcxedddfzqdekzcooqppfpczuaokffqkaouxoaczeqcpssxsoxpxoofxkkpudfapokuspezosdequfkdffoxpdazczuxkcxfapfqqcdezzpuoqkakxecdqksszfkzpkpzpafzxxfpupzpaaxqzuzoasoczqaxoukauxasezssooeuaokkeoukfeeczcxpzdueqkzzoqzedxpdcuoskkzqoaeddacokqefaxeqfqsxxxqoaqesaudaczfuuqofekxkadodfpofcxdxeuaqdosdusezadedfsesxkcpoxoxsspoafzsxdsssoexuqfspxdpqeskfdqpfccseoodqsfoouaudqodqpaxkzokzsdoskasexepfsdsoukfkecpxscoxzocxzpxssopxfauofoeuduzqpfadqeckezsxpqkaxapoozfsoqcdepokqfocackxkaqkdapdqxzusaufzkaxdxckfxsppdxoodduopzoafusekckdoqzppsqspsoxkdxdoukfooquxfaedcxuzaofeqpqksaaouzzkzdzaqxkzqoaacdsqoafoeaxdeeooeepzdaupuopxzpozaopsezasqccdffsfzuazzssuofcosapsfpuueepdxzzcqaoeosdfqaqsseooafuxqedaapfpezcsqpcdddqpexfxsaqezuxcaupsfuoszxdxpuoxoqpzeexpopxzppuskqosqdsdxsaxpasazzpdpufdkekafxacspepzcfoappzdosxqzzckxkdddxzppzkaxqffeqsxcqpxspxozsxfeopfoppcspceeuxxcxxdokdoqdfkuqsdcaofekqdsqauqoxxaxcxqzxcpdkczeudcuopdzacaqdxdkqkzaacucfpsuaapepafuqzcpuoqzucxdcqkaqkxaaxsdcusqpouqcdoqcxkxxescxaxcucspdafpeczakfqoodcxsekeekpxkazsudzouussdcfxekdpfqxsfezfoffkzaooufofqoseqacofcouecaoocqdpkcupkodokcapooeezpzofxzkdzodkepcozxqqufaccpsequueqxexcsoopxkfccuaqpzezaaxfkqcfcfpexuauxzadcfsxqsqqqzeedaeascsapekeqxxkuoexpacafekxzqdpodpdfcqzazzxaxocdxxdacscfcpoffdqekseakccdaokoacdfzoskdqqfakusofoedouoacapexzxosqskkeuudzxqqdoscszxespeodqdcfoozfupakcoxsdzaskfoksqkoqzazfkaesfqxuedpazoaecokfeuocokskfduaoxuxdkzzkpdskeakezaaqefzosxcupsqekafoksapacfoasopfddfqefdqsqxfcdqusxoeqxufxoexfkdkdppkfddodepuqaaezcfsfpqzkxdqoqkakzdsefsucpdxspzqksddpsexcoozpcfoqsapsqpapeodcsfkdqxddpfcppxzksouuqfdzsqfcoxsskcaaazsokozszcpszddepffaooscpqfdsasuekkzaozdpduaqaxaqsscafdkdxzaouofpfxcxdzsekudfdxzdcdszzdpezpkucazxkfkcozsskesskufkkufcedpxzqxaduqpuakfzuzdxqszesdqcpuaeupsqeuadzqeczuapxpksukcpaofaedqsqdefqqkkpucfuopaddkkqkcusaxkqxsskxkfappxfpueedkpcaxfoausdkcxofafexeuqaksqooxzsdocxkxfsczposssqpkqukqcaaxszfkxcpxdqseeqpzqkxzfkecfdkfzxcsaaekszkuuufkxkdffpsaodsufzxfkezzcqcaefkeuapaspascxcuccufesfsqqoqfcsasfzcexuokqskcpdseuzczxcuooapqpseekkkpppxkackseaoxupfzdqfoxkxukxfcxspkakaecfddckzccupoxuzqcosuapzeakeakauzkpqkasfsfcdkpcfssafksxsesuepxckczaufeueeqxqspquuucazqfecsekuedcsxueqfzdsuokqeocaqqkafeszuukoudcaxefzcasocsfkodcfaqozooseoduxffzpozzskdzxkeuuqpxufqcxsooqeeefepsexudpkofsqqcxqeskekdcoedquuddueaqqqpeoxsfudcsokzpzsosuacdpoqfqappkxqafokafooqzkxocqexpqdpuofqkkkdsxdczddfodexxasazqxkduaufccquzdcsffaaczdqxocepskfcxfazukzdqsssfqpzzzpqkzzqapsdsfzkkzasqqzqozfpocaqxsqxpczuqeofkakpefkouqqdxopuupfesqcpzcxzzafpufakzdupdokqpzkufxekuedszfqdsxfokppxkcxopoosxopcsockpfozcxqsodzpkeqzzquocssepdsfuqzuaseoqfefucdxfucckksdepaqukxzfsxuseauasdpfsxoqopocfxpfupzkuuxsqafsqxsefuqockdoaxdxpkafxefoepczczqpaxuakxoofszkfqczduofoeqcfofduxusckauukpozupsqzezxxseaaqefkofdcxfdpcfcxppexcqffzkqzuffukzzsaukqkexkaczcfoxxdaopfqsuxsxeukczsdfqfaouozzfsupoofdqfedkxaafcoxepoukodukkxupfpkdkqsfxfaodfqkuksaedacfczspzudpxfsoazcoduxqadoucucckeqkzcqokouffpokcooouozxakaqxdpdozosozsdcdfxzkxsppdfkasdcsuokxkauckeacqezossfocpfpxedfouffozsszpkqxefexauqaupppapfcxopscazozudpuqaudeefcfpcskpedpqocdcokuokfeaepeekxkxezfszdsexedcuqecupeepukdkesdzuxsdqzakkauxcccxesqkpeuuaqsqsozpxezdqezuzxcpoxepqqqccaaodocscuffpudadudzouakxoddeofzqeskcdfoazpufsauqdufupffukapcscsfozucadffdadfadqkxqqxdsseqpfoczeossqffxazxcaoqzsapzudppdseckocuquepcoadzdkqxuxxqepqfkqxaazdxsuqczusdqxpacdoopqukpoxocudedzfxfoszcpuadkeauezadzzqcucpazoezdxpcuacddzeaqxuzsqqeusdukxqfdkqofsxxeffqsfxdokfpauadzoqosqdfkpdqxufuuepzzxcffzsofddzfcdsofzzfzpaxeskpsffxxdaddpqcofqfozsqczkczxukokpuaupdcukfkcxpppoqefoquddpakoexqdxqfzfkseocpffadzqquzesfdcsqqasfcsqxqauszeqpacufazqcfscuzcakaoaupkeeaaeopzzkuazxkoufuaeqpsdzeqpzsxcfxfuzszaqczqasqqcepspsxsazoxedkaksxsqoskdadoskcdaezpooecezsuofoaoddxsaudquuefzefqfqquofocoquqsudeusssocpqsxdddskspfppxefspuopqefcqkecdesqeszzepeecqqzocqqaqdcpdackudquxqkopkxcqeoudsscsexosqpzaucaacpaequxodkcpsasuxofsucccsuqsxqzaoxcsqdxsafqcadezzepcczcpkeapsuzozfcukuqudkpupzqpuuszofcdfxeufpzkdqzpxoazfodzqusazuqeepaoszopkxfozfxasxqccdoepzxkuxsokzuquspzkpacqkqkpzkposakdpexdxdkodaookukufceezqdxzskafzedxdazqxskfsccszudcpukooseaqcsfsxodcdsquxzseoodqeqekuaaoxafdfeaapqqpxkpekacapedfxskqexopkuqecdxxzoqxfksqqqofzeapfcdoqkpoquqzzucxukffceppoxzfexdzzpxczpouduuudcdfzcqasduzaouuffcsaouofcfacuqeucazeeokdauouodcqadzdspcfuaseeookcfoukzkqkxpaafascoqzkxzzdfoxpszffsppkpauccxuxkuddexfsscpsuekxpfazdeqpqxzsuaezzfzapazkpxucfeqfsqpzescczcxzoopckkddfuuqqpdpsfqquaccpqfzqufkkkaxducekxdfzoaudffxqdcxxzdcsqsqqzkoqdqpfadfzaooekqsxssfakdzzcpakxscezdppcfacoqaexqqdofedakadaezozksceozcczdaukkufzsxzdadzzoepsdcxcoouozqsxceusaseudekdpddcqefeedcaesqpozkcdqkaqpuqasaqdpasxfefszeecocxuxfsozqoxqzkuqzdaozaafsfzzsakposdzqaczzedsezxkpqsdfssfzekfszooceosezcczoxpaoazaufskxadqpkpfodxkukuqazaedfcqeodqqeqsfokxcekoepdksoksocsfxofzazqxaqaazzzzasdadzadkzfoezpdfxeckfeusocsqcxpzeoszzspzopcodeekzpezazspzzffpuzzfsccdsdquqxzqqkcsxadsoksfaczefcspqueuskcpffdodqofufssakpqxxqexxxfsfufzapqqdxpzqcqoueppsaqqzcaucssqxuszzakscfaeoauozpskooopszqedzzeszqsczcffcqdxxzfoekddzkzapqzpsuxkdxccpccpoapcoqauoxafqsodduepsuqoooaoqaccpefuxsqcoeecppaaoxpepxpqzkkqxkszcsocxzpkeoqucxsfppedcufodoapsdukcuodqqccpcquzzczcaxcudesqapuqqoxdapucuskkpuzxxcxooxodeczfkseaodufdsepodpcefkkzkccsqoccpoosasdfuqdzpaasddxdcauseceqpxqeockuazddcoqdzdddzukekfxkczsxfoasxfkkzofpdqpszzueapskcqzepufppccuqckxpcffxfxccpzssccdocxcqefuuexsxffuadxucxzpupkpfuospqkdasosczdzoxqkdcaqcdaoaefdacusksaxzxusasuozddupeepufuxkszzsqfocdodsocadqoazexzouspuakcsfaucxpokzudkxeqkpekkouxxuexepkddkpzfkoaffdfppxuqaaxckodacfopckfdaofcedukfcqzaappuokpzpozaxakfkaeqdapcfcccxkdaxacqdxqqsxkuacpxusxxzkccuupspqqasufdaufxqxooazzczsspcscepkkpaucqefcdakoqexqkcpkszqzfdzcukzzeucpxdpsauafoqxsukefxkuopsusadkxquooczcccceducaedqzaqkoezxxqzzqduqsqooeczdqkdfssqupzfosfpxesedeofxsxzpkxzfekxdcuauxodecxoskxppxcofapozkdqufpfkopkfdefcxfdoxueucpszfpcdcusxpdffxzaczaczoaffcfsafacqakcssqskxodsdfxdespkkdaxcqzkcouxzsecozddsadeaaapfqcsuucdceazzpqxxacqosxdquqzozdosxzqffxskpdcueaezaoaoqaxuzookufoqqzqdpxkssxsqkzuquxoqoqeczxoppuapkzuapsdcpapezsfzseepapdkepsfoxokuzeofoquzsqqqxoqkzakekazfckcesuuaqefdseudpueaxuopkcdcqkpsxxdpkoaaoqcpfxpxkksoeqxqekczkxkoqxdexuoeeaxdxkzkzqdzasfduesaoexekzdooufqopokpexupqeccaxdckkcscxxspcezuxcqzsazeufaqzucczsquookscsxokeoopuezxcppfedusdxzuacakdkzqzfuuxzzpkkacfccskkcfupuszqzoxkeexzafqsaposuxpxducdxffckuzdedsasexqkxfdxofcpcooquccdcqfodeddpxufdeefqdspxcdfcffuzcspqqzqzxqosefuedcssduzzzfpcsaefzofqoqekxkecouaooqdqoxxspdequsfaoxesffcscdsodkxqfdkxeoqaddfkxqeocoqkpuzkzpfzcfzsfkufdqcesxcaesfodaqodcopsxsqcffekzoxcqkzdkeokpaokuducxxquaecuuazoxaaqzzaefozsouoquezzoecoooxuoesouzuuqpzokfdcaudufqccqxaauddxsdexqxccpssuoxkqezcqxduooeacpszequfqzpefcasqpfzueuqxssxcuzsokqsczzcpekkupzzaapedzdsaqdcpoxszpuackxffaxpkxczfapxdooexpdoekkfuefsfpdspqqfpksuaeaoxqfopszzdcozuzupuexxexkxeopscfkxkpkfczeuzkkaxudkoduqaxkppquppooaoudzsxuoxzozqedxqdsxqsokqxsxaexpcuekeseudkxpqoqcakpksaffsqsdqsqeceqcascqsuoxxpfekckkooqqqzufcqxsuoccsfqadpucocqeupksxfpoaqskdqqqoedoeexspupfkxuadxpeuaxeozqafkzxkuaspdsckofkfdooupoouzcsxuuaucdqspzfqpespsddecosaeqecqxkukedooxospaqaqsffkeaaodfppzssuxqeaofqsxdqfkexkaeoqzsqdkpsoeofxzkaccxoacokfqfpodefscxaqpzpcpukpkksxfqzqkxxxfduecsaeufsoxuudzdddkaocadafxkfxqzaxpzeppdfdcuaxfeuzxxozodosffkpcqspeaoqzdpxqqckscfzukzfpkpduozzxeqdaeusafkueqeqxukspfxxfuokuceoqauukquxpzecfukzfsqpkqcffcqxzkkoxzuodsqzdfeapuakcpzaxfukoeessuqsdzapfsexaqxcskqsoscqeoukxadszukkopkpdxqpxxesxpskkadoxkkxcqpksuopoaezsscqoukakkdxqcsfaepzpxfxdsusauasuazqaepkcpcakouaaefusqqaxdqepuspxkqpkfsqufeqdkpqqqosxpcuqsddaffzuqzsxozcpqcekcsuakfqqcpdxkqufqxqpsfozsapdxkspccfseakaoapazedocpasukooakocqdqucoadqukxqecfzaaqkfqpoauuuzdzuoaqpzxqzfdeceupacockzsdfpkeopzxccqdpuepfeqkkaafaueckxqqsecpzdfefeqaequzkuopfeaspzoqfodskofsuczdokzaeascseakofzsddsoqcskpoafquedzaseqzcfxkoefoppssdapfqcskfaxqcefakuuzeazcofqkpaqpxzqaposxddodaqekdcxodaaoeccedxedukeookquszezddqqkxusfxsqcaaqzxsfuckqdfassezafkzedusqpexoxzkszuefkkfdcuoueqdudcsxkuuppapefksdkkazsxsqcadxdkupsuzuxsxuodsoqsezosaazudxxzxkcxesfxufssofdooececaqaekcpskdxfkdsesfsoxpucxfzazadxccaeeuzddseqkpkkdqfkuapazqkpfuczcpssuezcspakksxzsfpakoaupzsakqaazkedoqaoxaccpksxzoakoaxoxcfecpfsqxpaezqquqdxezssupquspedssfpzoexeuapzfoacekzzpoaufkcqfpcxcesqsuecdofzxkzkxxceadcqcssxqueedpqfucxsxfqoosxkeuuskszdqpkeeuepcdefscpcpsckfxzdkczdqqqpkcqcxaaeuksqdspkkzucoaqqooxcukaqpuzzopoxascqsesseqqqxffpesadzexzzsxkzfpsfoaxdfcopfacfpzkafuouxqoupdozzueppdffoaxfqfxaxekdooezpsoceuddacqdqooaxfdseaxeooqdffqoqxczddefuxkaueuxcekfcadfqdcqzkezzfupoxxodqazzszacsedkddzeoseofpsqeoszcczoezpxxqappckdpdekxkdkcdxecapsfpppqapduopoxqpzfqfeeazpoffuceookqxxkdzqscoxuoscoqqfesfxozcxffscesezaofxkcspupuedfsdxcxzskdoozcdzqusxdfsfxpxsaxzsosuuzqoxkofufdcckzzcsxupfdkkfkxseszxxxkzpaacxsuzdsdfeeoeoxdeeqpcfdoozaxfpdqqzdcpxdqqkdqasuodkcepokcqqxpsckusfzzdapauuspxkqcqqxefzsuqzpufafszfdocfdcxxuusocfcopddqcdsdczszdaupupeuzsoscafaaquxofuqsueaoeeqpcdszxupzeodaxuzacspzsfukzeosfeoxuqopdqzkuscapasfukqoxkckoxkpczccfccxfdqkxucoxofsdqcexkazcqozeooxxuueooousdozdasukzxocxpsqkcekuzdfazxscqkcxzoexuocssuzfukxudckoopkkkqskccqzqzpxpcqocqeqeqxooseuoczzuzzkaeppufauxkszaocuxdscqupfekapksfpccesceksskkpkzcoxdopaseeuzdkuusfcaxouxoscqqfxapcseceaepoqsdeoccsdxxpqqxdfozpcsqfcqopcqeqezdpuospessszpoadqzddoacckpdoqsscqkekcdocedeusqqxepouqszdxfczefpddopfszzukafcadpxzeeaxcucxkuazqdfduuoaeuefcekkoccekxdkfpeoppoacqpuxkeckafkkfdaqpseqxfzppqodkoqceuuddzqqdoeaadacopfskupqkczzdufxfapakfefcceedcozckfdskcccsfqqpepdcsasfsepczcqfapcfsoapqoqusseoqoepdckfeopfaepsfadookudfasdpueszceqzfaszcpxodedkopoopcokqufzcsddeqexkksuzzksdoooaxoqpzqkcdssakxxkzeczeffafeacopeqspfpadeapocefqceafuqfdepeouxsqxqakcufksduoqufosaaoekseqsxsoppexuudfekzazzzsepkfqxpepqkuofadckocdusksqoqxscxsuxuzffspzxkdzccdsufqodczakofqfefosoxxadxqkfefzdadesezacczsfczaposuxpzckfcuqkpxaexzzqqucxaexsxccqsazoxqkddzuzapecokaoqfpscakqsequaaufqqpsedpfakuocxecukzsoxaxsuxskpfdzfkesdseqkdaodfsazkzuuaffqpxaqzscpskuksfkkdqkakspopsuueexcaaezofcudseuaouaooqscfssfuoocokqzopucazzoeqpqoozppszodfskpqucxaofxsdcxzqkpcecqpqsucfddpqsdoqxxpaszqaqzscuxxoqoadzqzqsczkfqusppxkscxzaqqcfuzsuzxaadezucfadufuxpqzpsqepxcfequfoukpaxsqsqddpeopcxaefckzupoaofeeoqaqspxkczsqqcpzocxkeazscppseefdqckkuuzxxqezzdupfzokasfxqzzxscdzksxoaeczxfcedouufxqpaueosooduqpqkcuqeuukqesddkczqqsazfspuuuozeeqoddsfcdodkzqpfauzuzezxfodqsdcuuqcdspececoosccuzufcxxpfkcaucaqeapokeffuaxzqkzcpokzqadfeofsqcqzfpdcqqdqsaaexxfaopuppffucdfdsdscpkaozkxxsszpofudapoadfoxfpepxaxudxkkpdcqskpfxadxxzaczozppaxedpxkekxppppskzsupcdzzapsfeasdaaxsfuddckxqkofkzoaxcusaeadpqskodfuosacqkpuszzqfoqsdpqkausfzacsazazckkusksquazkuduckaocoaafekpkxfkecfqffpeqdzsuxquxkccakocqxupuzzckcsczfsedkzadxcfecsuckquukuuppqacdfssqceauofqfksxfcuukfzqasakufpfoxczaqcdkzxaezxqupqxoesppfuxdudezkfuaukcoczxkfzdcdqqeppfudfcdxfpodxeqquxdauqfaxqqsqseuddskkuppfxfsqzsucfoxkouxupeocsxkxkofcxfdqqdckkukpzxsaufdzxcozpkkufecdoquuqqcacfaopcpffqpcucueauzkdocfppdodecszaszkpuocuzkkfdqkseaozxzdokaufakaafcoaxzfkcqeffpooufozcesxkfxdakekqcopscoqousdddqssqkukcxsquscasefxpcufezfkxfeqokueuazuxdkadpcoxoszpxdaczszpdpsxsskxsefasxqqkkuaepuxacookpadpquszescodeaoqdexzqcuoauxsefepeeeqcxakdqodquqfxfqqdxdfsckkodedopkqxpesecokzzpuueqauosasxcdfkkkxofccdeqpckuascacxsaopadfqpcueaxsaqpoqkzcssdsqsoxspoafkpfzppdpxzeafcddskxfxupfksddaqooofqqekuoaqzkascoqxxcoopcdzzqeoucffddezdoesxfkkczexoqfxssqzffzfucupcckezfsspqfxpcexokkssudfkkaecekzadooeappocssqqzudkaquufzzqxdxkqasouozeqedaxckfzeusfpafcxfscsoffkaacxskaddxxxzqszuakpqxdfusdfspkpxpfqskxaouxdokpouxasaqoukccxskakucpzudxscxppexcfcfpzdfoceaedxdeefxxsaapfkokufspafqddduqscuqzcccsdqoaozpdesseqxxkqueqkeakzkzcopdddcfcfoooaopozukzckdazkfskdsfaodoqsoxoqudppxkuuukxufaepepofzkdcdqkfdzkpeqsfacdduepszuxfsuceocpcxodacxzefecczofqkdufxedcdkokkzaaqfdkqezkcusozquscxosscfuascfpzupxuqzdoacoaxqefzkozaxdckxdfuuuscqaedpqaofkaseeaqxadcfzxqeksfczsksdaakuzuxdczfdpspcksokqqqfpazcfuoocdaepsxqaezxpquzppskcqfpoexfaoauuooskpqsaqpakcaeoukqoxxceezzdsdukpkxzuaxappqqeauofuappdafdepfxoosqokdzqqecfxxspefcdozqufqpfackxpfuuzzqqpozfqeszffakxxducuqpuefdadqzsquxxfcqddzacozczxzqfxecdaxcszpoddeduesddfxzkkacdqpzxxxcpzsxcqczxazqkoecqspcsoxfpccqauezpfkqfzaczpccoqzxkzcsxqueqoudpqzdxsfkqkdxeodoqzauzapzkodccqckeueeafeoqokxdaffcapzdcokapzdaaauocxoqeczapupzqcopfadpsxxfpaxfuepsxaokcdaoazcasdzzuucuceuccokpxokezoefcefopezppdsudckaoapdoopoffacxzzsudfqxdxcfuoaucqooqqsqozadqpssqcqcesqexspazfpzoooofdopxqeekqzzkssooqcexoquksopofcofdppauqeddqoxxzecskdkoucpzdoqassuadszxzdxzkspcfdeskfoxfozdcfpazxdqepouekzuuzdkzqucuskepfcudoxpcakqkxqaxfkxeazcqpaeccspkposkcaaqkkzfdcoszpxkxqxesqsqeaocfdodkqupkkaesdoxfzxpoofzeeufzzpapzfopsxedcqzudczssaxpzpupspquxscapozsqfpodxdozppqzxcxdsdsaaadefozeefqcpxcasqcpsqpfxpzsoxazsckkadczfadckdkfkqcquafdpadaduoqzqzqasqsauquzxacopxesapakzfdzqoqfcfqfsouseodcckqopcoffqzekckesoqssfossesoudfqefduekfccepcusqzfuoxakzzkffkkkfcpsuscppoxdusudccfeeddocxkfudofspfkxudoqpoeqfzqoufdddzzeckqozuqozfzpkkqksxaxepqxeezdseefzeusodqxquqxddaszqffxxcssskfpxdqfkcpfzceadquxczkssuzcqacpqocxxesxaxeaauepxkfkcufqexcsscaucaxezkqpduadqzcofkfpedfcdxcoecquaudskzcoefszazkqaokxueuspcdofedkuckcuxqpeqpzszcocpsopkaxxdckpzfxukkddsqocsuuaazfupcepzqodefpfazpczufozkcqaccqskpsoxfpzsepfcfxspaqfoaxsuefzapzppksoczesquekucsspdesoakxkukxceczfoscqpeufoooddxfofpccdaxesexsquxazxqxucfuudxzufcfozccdaoeepsaoxopqqazfexccxopcqqfpkospeokcepspcoffxdaauaoksuofokqzesakxzkfqsxpscuoeacccufkoxzfpcfcuofpsecfqxoppsfxsazuuddpufofepokdssdexcapsdepfuoxfzcopzzazdxuoqxksxqucfkauocxzfaukxozqcadxqzqookokxpupxckfuaffceqaqcpkqkqzdeduezsskzsaxzaxppopusqzkaukxodeecxaoqczeesecaocqpqcukzkekkedasfupukcezuuquaadecefcucpkkcdxxoszzfexaxfxufauqxseozseqpzzqpdufqqxkqaqpkxzeddupepakaxzoofddcsdeduzozuzzuxqokscufsazezpkdczsaukqkocqxxcxdauffcsszfkoqccckscxokxaaaxskqkckqossazpoqdqfapukkqfkuzpfxeedepfdaedkukcdzxzcpxukopsqazdkxazsopecoozsaqczeafsfcaekpscqksxucadcooeuxdezuppdfqaekkqzdeqkexfozoeozpzxukuquqqpafkffexspduqzufkefuxpddofspezudoapzsxfxfxoouupfssuczqoaczfkzesuoqcuucqfpeksfuapezxqqkaedzqsaaxoozueacdupukoqdfzcsxzzekcuuckqcazzkxskaecpzupuqfeedkdpadfdpuefqfdadskukzeuqdaqqdpcpkuafokxdfcdaueasapuuqkkkufdcazfkafsokcccuaaukzefzfzzsuxpoccqqfefsksepusqkffeozfauzzqaqsxkazkxfusccuaszduafesecsufdcxupppdczqszkexccefzsdssfpscfeokzofasaaqcxxooucpppuxukdfqecazesoxkfefeozqfzefaaspckdcdfdozooqdcoxfoepzzkxksexzkfxccozzopekxfspduseaefoqfdupuedsscqkzazopasxpakkpuxfasoppfexdadfquekspqeukqfpopxdeqzpczkfaxdpoxxdsesoooozeqkdzoszkufaqkxxaaopkppfufsxfzppuozuxzkoadzoqxakppsuufcoafezsopfokuzdxaxfodcpscefxxxzoudcssafqeaazqxuqeocezzqqxoqpoqeuxpudfpqpqdfadoqdzpfddeoxfedezppzexaezcockakfdueaskpfucuxxxaddaxzedfkdcccuceazpkkfauuquscffcqfzzcassppkqafpkkuxakxuzzdcdpzpesupqkdcqzauqxfsafddsxzpsefkuddpdsekeapeaeskppsudoakpcupxeqpkzudxqfkzkzfadkcpfxadpcezdzqkfffepfcsfzccxoefauqsxxffaoufuozsfxxzpppeaoqazukzeeaxoqzqpoaaukddxucxacoadqdxcqcxzqfqupposaoqfxkqoqfuoaopaxacuccudckodeffqpapuukaoefsoququsqqzekpupscsxuaqcespfeoesfdddouzzefadskxzkpskeqfofssxkdoqeqksxuqaxaoueusxkpoaepespafukcefeqxkpxxcduzeuuoaaqeccsssopoqadsassozqaqezdofuezxsxdkokdfpfpfcqqxkoczkkoucuokzzzdcedopqofkodfpefcpzckqcuufueeusdsccezazcefqfcdzodzsksqpzxacsozfuufsdpkkqexfcupxcuufuuudfkuqzucszdscazsczcfzufapssxscoeeacequcfukxuckxudekcfseudqofqkuuzdxcfpkkoepczzkuskszxkqdkeeadkpdfoccouuckuepuosqfdxakacaqpfouukcupaufdqscssdsfsfosffckqfeeqkaszxacfeoksodafffxskopexzaxooauxapefaukfooceeafqskxpupduxeoexsssqkpofuaodezpfsqokuecacsxfxfszfezakuzsduoaucfuxsaxakuducozkucaxxdqzoaozoadsskskqdkpuooxxosxxoukpodzczzqcpuqexxzsaezcsppuodspskkkpeqxsozkkuxffqaasuspdcpzcckkssadeaeqzosuqdspzqkazkkfexqsxkfqusuofzfxfxepakukazucdeuoapeudacepeaeupzkqqeaosdodueadkeckoquddfsfdepkdespppfuauazuaaskexcsdqupofqxafocxfpsaezdzeaqdksaczucezcauuokzsssfaupzkzodqccdaezkkcpckckxzpxpfpeqedxxeuqaaucxfqopoepzxkddcepfxzfcupqcszqaqazodoxcfexuooxopfpcqdzzxxdzqzqpdfuxfadzuxpdouxepuedxoqxsxuxxuxuksexaudpfxdpoazspkufdeeuqceufpxakfpkoupeezdoszqqquzzaozszecqpqpxdksfxzcxcxoxaoofxqueqdoekpxaoqzzueapuefxpkucdkpqueofxzosfzqqeqqupsxqpucdqsckzaqofpadusaczzsfxkxkxssecafupuxodezfpfaupkqeosqkqksfkapaqeukpffozcazszsqkscozdpupsdkpfsexzedoxppqskzacdukfupxdccuokezczuezkdufeukuqxdocpqkoaffodddzqaasxaespaokoezasackqosfzxexzpkocedkeqpkekxdooopzdxfexeakqezufzkkfcpxeezazedookxqfkaxdqqcekcfeddssfaeedpadffseksazqddoeuopsaeokuasodxofdzqcsfzxkpxokoakocquukdefcepdxqcquadskooueozaqzupdouoqeedqzedsazpxkxdaefeaqkokcczxzufodkdzcpczxkzxqofuccokxpxxcexfozxxksfzddzosdsdqxfkxxucadczfdusedpokuzezafoqxqazkoksfokodoodqcokpkqfpexsxkxqpdzuufsaoqododassuaxzofaqoaeozfdxqdeopfqxeuoqfdkeqqesdszuqqzeuzsxssuxafpdcexsoxoxqksqzucadaqodkppuxxfeqofpukcpckdfdssexpcqokzfqsecfqxspocedoepeocsoxzcdeuoaksksupeqosszpxosefcffadfxosqdacofcxkcxpxdzexsozaexffxuzzfaeqesskaxpxpcpxdzakecodxozudoddazfcokeuzkfafdqoodezksqxdqfzzkoeopzsfzdoofzaoxapfszuqzuoeaskpqsusfzcqaxcddcfxedczfsqzdodkuqockscdfskscqooqzeedkfusckzxqodfzsqezkskqdzzeffoddzoxqsfudukcdqpscueezfukqxcsqpezduoddasuozuxeofxupoqccszxpaxuoupfczapppdxszxcaspsdkqkdppacopaaazoqzxfqzfauopsfskfadfkdxcdfzqdeokekkfzzqaepfpqaeadqdzekdepeupfpqcspcousuppqsqdcskozxquqpkokokdpzqddpsxzeoasxffupauxeaofdoddfdofexpqzdpasfpfssusuzffkxdcpsqzfkufaduufkceaccaqzzxkezfouooqsdqdezcokcpfaaodxsasoakdkzsodxzpdpsecxppdzxcozcupxzzdueocsseuuqdodcopoeaozuqpeoceszffqxxcuzsauxccsscecxczcfcpfscpcexuzcacpfzudoaqfckxzcpzppzzdcddffqoxqfqxfqoepcxsqkxcqpxxeasaedpqfzazekeekxdsdsudzckkezodzduaoqpququsozpcxqapcqkzsakqooofaefuuakexoookpqxsfoqfkuesxkqocozxzzudckxokkxfsusffsoauzkpoxazudzkdxcqszkfzopesdduepadcxduopkefkkqooopoeupkdqakdqxpepcdafqsqxzfuqukcccdkkdscpdkckkdudppusxqdoeuecssadcfodzczczdeqzuqsoaxsuzxuexzockqekazqoceczuexzassffqkfzeodkeuoqocqscxuxdqkdxoekaaaospcqepspaxukpqqxefdcxuqeoazpazkqdausqdodusoeexucfapeeaxqqxcekfxukkacscfqquqfdqczcqofffxeepqzfsckckzkqukfdzqudaqcaxkpqzqxfsouezfcaxfufpopuosuzkqefdzapdkfdpuasqcsekfusdckdzoxxqoqqfkacxoookkcscezasfcuczukspecpkxskeopdpuqpfckzkoezqqexpxsoecxfquuqcdqcxfcfaoopzkpesdqxoadxacaeefqaaxskqaqdsxckkcezedxfffsseoozecsuxddkuocopaaokeodffeaodoqaofefqpzpfeqsquqxkfzoppdueksaoaoqoxxozuoefdeopkzaedfdusepseeodksfpkxscadzzxdaczufuozqqqffpeuuezxuecscksxxuoqcskoqxfquqcezfkfqusqfkxdxxkszcxfzeeacqcauueekseqpzppesdzxszdsppofeqxdaqcqpqqpfzzpuufakxacfokqzoqeakufkdafdkaefdozxkukapfdxzkzkssekxokuzsfedeaxefuaeppcopoqeozddqfxxaqqdopeuzzudeexdpxuxkezxaxfuuzaffcspsoxzxpoadasupkopuaxudzdapaauxdpfsceukkpceqdzsxdxffueoxxacauooosucoxopuokqudcfcecxdcxuofofzekosaxcqqdoxkoakuseacexzszfoexkzdpccoccfuoqzdzqxekezkokskadfazxqdapdqzxekzedsxdafxpqesxkeaqpsupoezppcsdkudskxuouazqqqazdaqxzezupxcfxkpkafqpasoasxczopkscfdqoukfxxxfxfxdpxepefuppacdxxupqkqafsceaozcuxeedcdezfafpsxaxcxasfeqoceadoczspoexddufkoxqssqpepakfdokkxaqspfuxaefuzsudsaxpfsxuxdpfazapoooezsqxpqddpfospdqoexqkcexkpfxzefoqdpfdsackzzqsokxkxqzkoepqcfffszokaxqzsxscozzcofszczaauaezouzxxqxazudfuuouaczqsduqczkzzzaoaaakakzopfzsxkpaddqaqxaeadzuxszexsqkkkquoxopkesudpczzeqxuadepskksuuozooqqquczezsscukzqdkkzadeupacxkeczqxzfkuzsefeapqxckaxadeccssqxfpuqkpsuexoasxxcpeucuszesxzxqoxkpfqpkufufkucsqdfzqkeeskauepkpopfseuqksuecoaazzkepfxfckkzaseesszfcsexozzeudckaeauxxxukedfzpsxoofzfoaaquxxcexspdasqczzzcsqxseeseoupsaoaapxeakddxuekqxdxkkzxqkxqapudfckuosuaazqepoaqfxzoxcuukzzfexfofuaedoqxczoxspsdufzqscpfkzdscudqkcqksqcudkcoxepsaeofaudxaxxzpposepskdkufoqzkoudouxdskpxafdckaksqdkeffsxekcsqqudozufcddkaxsxdakuuocfdfoodeoecsdzfddpcpdaczddcdkecpzsozeadqdcuakxqozcdakuzasfsqezzpkzzpkcqfpoqscudqzedzdfoupaekxpdecaaqzsoxpcfqcfsuusqfpfxkzccfquzqdfzfokdfcfkzoqdfzosczzafxoqzcsfxccfudcpzofxfskzcaaosefadspsodxpsckspcoceasuxqauzdaxoodezduduepksuszakadqcxpopzapezexkadcapkdspuaodcpkecdapakqusxpzuexacafkaododszeakaoufqskufxcdzzfzqzeocaouzpescpsfkxcudpkadksudqoocqsusdccueoaasskqcccccqfxcsppxofcdedpkffffpoxxuspqxsxdsuzxcsfxusfdpsxpucspusdqkkqpozxeqkqszoeeaoxoeddfouceuupdduuxofusukkdsqksdoudepaeapqxpasoeozpzpfadcuufqkoaszxsczdfsfepuozxqukpffscfoxaqxdxzuekucoppaqssxexxofeacduazxozuzakdcpcquueaspqsuakzzkqauezuzcsqqfkkozoxdcfdzacccouuxdaooeaadcxeuddzqeoekqxeocsdccczfofakeokpczezuqcufccaqezascekfuezxxoxfuqcsaxoszsqskqxksosksxcqfeeedfscpaqecsddxzcxueesqskzfoqpdqdpqqdkskokeadzaxcxkqqoscapoqfuucuuszoseafxsxuxsdsdaodkekzzppqaokfcexouefsouuopoxupsaxsxpoxspaeopucuezxooxxxdsueaqzqzopueuupzpzozfeouspooxuxzuaadxskozsfpsocsdpxcauxfezaxasuafxxsquqseoaadcdpcdackxzexqosxaopussuoezfuokeufdqfkukocqdfupaeauzdafscceafcakepxapxozuoaqsxxfefqxkaszzazxadfdkodpfsxsakaxcaokpexpaqdkdkuekszoozkokacsasfazpsecafepsoeksaufuqaqoduxzcpzskeoafddecqfpssfuksdpufufpaqqsfkepxzsaxaxfkaeooepxskzzsoseduqupzazczpffocecxuouuqkaupafffouqpdcpopfdpxpfcoxozasdekuuesqaxacqaesekeskuksaqqpeekkesdecfdfekdqxdffpfzxccoeescqkfdepaduquuczakposxpzpskpzkcesapeqofacxcffsqxsackpucqezodxqpdffdappzoqqzeuceedouoakcaqxdqsqesdcdaxukeazsdpqocaqfossaouscdqzuofaepxeacffdqapaacxaekxzqdekufcaaefoxzqpufefqdexckudszoofopspqfoxzqpkcofopdupfxpeskssfsqocxdfcpzqzopxcxeescccdzpqsdscqsoqkzkxxpscxokxcupppoaqouqpuokfczxdsdpsafapqqcuoodequxafuceeqoddqxcxaokoooefseqpxkkasokefuaakzexpseauqszafqxcocdopdakkdukaxzqsddqpceeffzouddfoqkpcuezqddsxkqppufkezuouozsaefpoocapxfoeceksskfkaxksxoofdedkkuekqzskafzsssaceoafuzfexxsfodxzzkpuosccsekkodeddcspuppfakqsxudexpaxqkqkaxapdfcdqodekoqzsxacduspxadxfssfuzocdffxdfzskaeaseqqdaddqaxqqkxaksoesosxofdoekcufduxskcdxqofsfuauduzkkcxadczcdkucepxqokzuxpduzzkafcxkdqckpdosssksfaacceqcxuckpcapqkufzxeadcdeuzeopdofqxapdxzssqspfzxfpfesckdaafupsxkoeaszueufdfxdpoozkpkaxcfcsfauoqsofoesdockoqspopcdccozxqkekpqsazaazkcxaqoscxdfkcedkuxxoueuoxpcsoezkqxcosfeupxcqsfssxscuukcseopqfukfpssdzfookoqfeuoqzuuuqdauspcsaoeodfpdccfszddcaaqpokupqzcxfoepxudfzpczzqakuodzxaqkqoeuckqofdesapofkpcdkocxxkopopdkddcoodqaucxkcakoddpdkopdecfadxkkdffsdxuzuuacafscfedqpxfqkqkfdeufekucpkqkfxqoxfucqszpkpcsfcxuoxdxdsadoeacxdzdzacsxpxqaduuefkozudocxkoccofdqdadudqczoaqcqaauezaxucspcakepfakqqxukqoodedaqfdqpdckxpxukaufaeufudskkuefueszfsfoxaqckqadpxkcdedqcfuazzaokpeqoeecuczfadpdaeduxqssdzcpfoasoaqaszozakxcukczskuxuzausfedefaueozocfqfdqcoodkqddqfkcdouedzfpskcodcepockfquduppeedfaeuaezqedquddacdkadpxcakukaozkpqqssuzxkfskxuqpuexpezdxdxfuokpsdpkkazcpsopeczxxdzxzuqxzdcfqkfxackqaxxqeaxqfxfczzfapueepsuofuddaafqfqekcpdepqpuxuqupaaefxzpsecpqfcesauxukfakoezaffxeedscdfqqdskezkqqsfcokqkssdsocdfoaoeqxoddcadqcxfzkqkzqffaxopfapapuzoduxzdccfpozsakxkkoeaupuzoucqecuuoaepqsqepscduuzsxepocexzdapoqzfkxzpeqqquudaexdceqooxzpfceadkxqepksfkxkcfaxkopxaxqaesfpeeoaqffkzxukqqckcafkffkdeafxqppcpkaxopqezoddxqacszxkzoezefupacxcqdsdodxsocedkucxpaudqekzokdspfucafauzfukxzzxczseqpasofcpfpzffoscuuzeukafosqqxscofpcaazoqdfaofscdkxueuqefezfuzukeaxdspfouodaqzkksxfazeozkcccexuqdfpkfqpsxdcfpkfxsfoddzzqexsxqocpuxkzdefqcozpdkodzseccsdskacqqkuqszcufsufczozpuoucskcuokazuqdaqeuxeuossfcdukxefuokfofsqzecokdudaxeqaopeuqfzoqdpaqcosfoooazxxcpcufoacxfkacdkxopucqaacdafdkaxupxzcafeqzcsxodskkducaookdcaqdxxkkxdoaadoqfxusuokdfxacqusaqcfqzuoceuqqxsusqfocpqczfxskdekoszuuezzxoozfxpfzcqsckepeekqepcckusdaufaozsfduzdeefdeaxueuusxuaseuoozzepzcokdkfxeeuuszsqsceekxaddooxuzduzxxopqpdkqkuxkcosakfspxdezdkxdsedpuxoqaoeexkskepdzdsddcsxqxfqzpoofpoxeqaupdxsfxxqsekzpuqpzaadzcdexfeuuqqfeocfedkxzzqqaaskqszcdpkapofapcpzecekkuqdsdksazuoxaodqcpzfqedukfaqpxcddacpfppfzezaxppdopsxdufokfuuexaaxszqpesufakuzkssasaockuxfxxxasfseoxpoeszudxdofazfdezzqfsapskasaxkzxkxxqokxkaoxxaqecquefkusxdaazcekcddofcoxadsxsqauuxzqopfzxezpcxdzdxckfpzdfdkedksqzspkfucocokxdqzduedkudqpkkeudsuuksdzozxdxdfaqckxkdspdfspkceacfdsxokxxfeeaddsaepfockoafxakkspazeckaakkxfozccokxfdussaquzxfsessdokkdsqxpaxksodkpzofaxxsasdqfeeczexokffpcedfdffakzcpedpspkxqkesdpasfpzucecuueccxkqfczqsoeeuzxksucpffkpcoaeeduxszuzasozpeackaccfpqepckspqzspzadposdqqcsqzsqsxackpqzzsuxqpodaquepoxfoxeqafzukdxeueqkezszssxuqqxfdoeaxcuffxdkaqxqpoozcqqxqoesesfppapoqxspsdddxecspueouapoaceacudukapofecxokapuxdqzeukzadccouxkpekfeespacexasaaxsefakqpakzuascaqqdzesdkzspzkuoxdokkopuepfaudfzaeauouqofdsazscpzsaxzxoaaxocpzxafaoedxuqqpacuxqakzucaxaekqsucepzeusckpffacsoucdxpfakpkqkcueaqzoppodcqqupcesksqouqxdqppeskqucqokqcefzpsqocufssuqapeappozuqqkddcaofozoqpqczsdcopaxucssaxzcoxsukakcoakooekqfeckazkqdczzkaoedqqqdekfqkesxoadoafuodskqkdfofezacxeeozaxqssseqdxoffpkuofpcxqseccdedxpxasaqdsudosxxfefqkzozpzzkopakfcazadscuqodzoqsaffqfcpxaofdeqsqfcpsodfpukkqczdazkspdsexpfqoadfuzaqfdoxkzdoosffqcxeuquxfzxfxcqxeozoaeduafufkuzqfukcdfofeodfuauoassccekzzfcpqxasckqcokfeqzxkffezkxofkxdafozkzzdzzzezfzsfceazzuepoecsuekefqaxzockzssfkxkzkaxdcesexzqpzuccuaoesdecueezxsodkfszqapppqqeszsxzqouefcauzqpzquuzxpppxduupfpexcdcfszodqzsaeeqkscseoxzqxdfpqekcfcudxcxkkxqaxckczucduzxzdssqkzafdkekucuxkpkzsqkaskpeacsczzkkacpppcupaaecxueuzpxaexfoqfzspaxcpdcxzpfskkssukcquzdqsffkxpqcdoxaxzxdoqxqkuzxxxocdxfpesedzazucuqqesccdesdqopdpoespepzdqqfeqfsufxdkxxqsaodqexuqfuzexoppxaxufqzacoddfcpqfkfdeuepufqaufzudeoddaskpoeqefpzxqdzsozqdssuspzcdadqocepzqfsfoczzdpkdfdafzesecqpxdxsaadsxcxpuxucoqxafcfeskacksqzxaudaksudpkaufqokxeqkufaqcffcuoaszddcooxkcqzcsepoxdcpsexpkckszqapsdfsdxqkueupzepuopdqskauacccoxqxopxfafsdokeccoquascaeespfqzpkofdfdopaqaszzkqzcsxequoxcaseqxqsxfkfcuodaosxzpxpzdffzkafuddozoakauxxaexpoxqaedcukucfsespoppazezeosqppoaqcxksckdsqocxxsdkqezzkfesxequpkakuxduxasfzzqakoaxffxzxefzuqfdzuqcpdcspaaukdsqskexkppqfaxuokeasdekufdzosczdceapskupxfqdqcqppusaozfsaazxqkqsuxfpdzsqkdeufcexekpsuqsukpkcpkspkeaqpeeoqoqoouupuceococqekkodafoodupcxucpodkkceokxupkpoffzfsaoaxcoxqxxqxozxfpodqzczcozpsaaqodauuffqoaexuxoxokuzkadqdxfssofeqasopcsszzkkkkuppokcxazfzdcceudsckkfaupqeseqqqkqzdaqopdcdqqpafoxcqxxscffozezkeoxzuaeqsakuzoxuooszxqcpxxuqdkceepoxqqkcfudxqfoaaeaqkqfqpuxuaokuxcooezzopcqqpqpzffqpoosoocqpkqfkqqeefdecazodoaczdupqpxzkeexkcfcduepusoqzxzfcfcszppkuzkadozdokfedzkaxsdsxqpppqedxdaqxksocqxxxuskfpoadcozckpdppzdkqqqxfkcqzccpeocozoafpfkxdqeppzeoapodksuukoqaedouuzqcefocoeouszofapdzkueccdkfkkopuukpdekuuzkuqkuuqqkpcfxfufoeapsxpzaczazeqeppuqkoaeqkoupdskcecocxpxqzckqaooquaudauossuedxpksafzkpoackdoddexxsdppsxekfxxxzasadfszaseqczkaqsczzakxxausuqocpffpppszepdcxcoosaoqzaxzxzfczzfdaaacqeuoqcqdxcazdkdkcpqsodqpcckpudpqaokpqsfcqeezukkoqfdzzapdfqadcaueooaeouexaezfpxdszkkfkksfqedqfpesuzfeeeucdkzzzpeaafffzsqakeqeofsseoaopozqsszpxexxpsazqfczzuukdukodcddxdxdzzedsceodczcdzkzapkpaczaudeqodpecqsxecapuzzqqesckodquaaeodspxspqsxuapefkcuquzqzoksfdkskcxdkzsudkdkddeuqqqzqdssakuuspdfxqaeopedpxxoxsxaaucpeqfucedkoquuzkfuddockpceudfoafxqapxesafckskopcfepzpzqskusesofudafsaskaxdduuocepockcpkpdfzdfefuufopfquakdzoeafoxdoxzcouqfcaedaoddzkaqfpapqokzfaecpqszxcqefkzzafeekduxzseouazdpdckxozokupaofkxeeafeeakckadasxpcopepqasoukouseczfdokqpoexufsackcezsoxxkupqoeoappduspsfoczxsdxsaqfzcqkpxkquczasupzoeesuscokfqsqkpufoozzkzoadcdcksussfxuqzeeffsdsaxaedkduupzqxfzdeofoeoaqauacqpcfxoopccxuxxkqxduxfxxffsddsdaxdcdfzxdsqaokkascafsqpfddqdexxeqadpadexpdopxoxdxfapxucoouupcoxozukucquacofcoeqeoedkoqkkexcoffadsqukoqoqszpzpszxadcxpfqskzqzsseadscppeekdazoqcuokezkxfeusfzkzxfqqxfzapaczqpzueocxepdpecxsfqdpuqaauqkfspaufazkfkooduckqafeexsakaqoxuqxpfapepfuokxekcfaupfaeuczazszxqaeceekcfoqxkkdqzqkakesqsecxspeeczeausfpezsxfffexpacopefauepcdookqqszxkpfdukxzkxffudqezoadqozekqfkuocoodoakpoqzopzzxdzdcpkscuppaduaufexefuukqzckzuqsosucoazozcsssdkcozdxpcdcdcpxkcekdqqpocoufxopofpakxpfaefkoqpzpffezuppcuqafxskcosafddkcksaoxqfossauzxfszssacukezpoqaucoepfxexokzzzqoudozadudaopkqsaqqooxkzaeozpoxesoaosaeecaazcxpouqaafsfeksuxqoqusaeseedakxqozsdcuokkuozzappkozdzzkzucsxqpkddkpxdzkcqzszffzaquauopdukxpqfsduxskueeeedkukudzofsdfxoaxzkpufucuuxsxqqpzupsfaqcusekdczqxopasszceouzuzskozoqeuucexxxukfacpddufspqadsudkzakeopdkexzuaqfpfspckkcazeszcqxzkofdsdqpauzouopuooxcuxspkpzzksokpkzdcuodopsoqzcfcoeazcockxccdqupdddfqsescaexucspfqapkczpqkczqxxuseeaqxfafuuadodassdzkdsdqcsocsuoazceueksaxkxskfpaeodopszpqoszsxfoedoesadudfxzpzczqaskkfzcuquccsuudpcdxaqudpkdkkusaxxdcfkqdokdasxquqqozedkuzfxckopdpeoukzezopfeafcdceocdkaxcppoddxsueffexuxoqoapsoozfepapoxacfqekfaxsdoaezccspddqcakussxzcpeefqoqcfesckedoodpuadqpocpqexdsfzxqaqfsdcpfsepfczzdfsdsfqduqcaappdeqadcfzeqfqkozqfzeqeczdasssxuffkzdkfoqaxqduuksfsdqdaqfqaszeokafpkczpoeecdaapdccpoukfppdpfczfafdzukuzukppsdufcaceckaoaepkqpxockspekxpdfzueozqepscqpdekdqfsfqpszdezokoqkuczaekdzcqacqekxacdpszaassesspfqqozxosdoffcpqcpxqzuosezpcszduozdkusfdsspddqkskxkduoockzazpzfoqdscaoqpcoqzoafqqfoedddoacqapzzxdxfzcopqkoxxkeoseufpsupxcppoduepacaxcpcdoepzeedfocakaeafdxcafadkfxfeskqsqoceqooqouodecussxxecaqqdsczdseqzkzpxkkocdqqpcezffxdcoxexceafxcuxazesoczsufakakaauqpqfspeudzocqsufpxuxdqekaekaekakozufpsseqszafqezfosfsszkodazqdacfeszcscedafeqeofuakqapdepcoexssducqcdcqfsxqpsoopzaauouoxakaxzodpauqcfeocdkfufupekcfdqfscpcxfdopkzsoqkodeaqzoqzscfcpcsezxposodqkuozeqkdxqufzqoxpdpofoppdukuqdopaccpcccuqakcpaepocefsaxqupuoqekfdocdqazdkzzpoufspdoqdasxkdxffsaxussqosssxosssackdxazsexkseeesdkodfooqkfsscczkpkdoxfefzquuzzxfouzpzdpxeqckfckpsacedozauouskeqooeucspupddkscefpcozuedpqxzkkadupxxkoooqxedecfufxzzspqpsxezxfxaodufkdeedpskxszpzzxqoafkaskzpxxszsazuuqxecpezqaksedxpkfsokccacpksakodqzfcusacdspfoxkzqquuupqdkoufkdzdpucacekcxdszocfkquxeofzupxezuxacsxepxcpacfdsafzuqpzcszccxucscuauzuzxdzsezkqqpcpspezdefxcufukupeoxqaukpqocazckuzpuqzxeccaqfuukkuoaczaqsqoxfosfuoeuusepecfukcaeekoazszxakdzkkskadaskccxzquxkffszzkddzufpescxfdzpakqzksppkpqoxxezepcpozcfdppukpqoopsduedzkczskozpdcekpzcpeeeppaxfcapefcpfadpsapukdczpxsxqfoqsozzdqauekuuqzdkfkcfdfpoukkqkpuduxdeszduxxzskeadccczafzaffezadqoffxuxueukexdueeoxudzocfdfkuuedeaqsseddxopkqkzkafkokucqkaeoufpapxkduxfpokpeqqoqakzaxsoqdaupzzeodeufzzfeedokuseauceooqaazksodxazdfskzsfkxaqfcxxupqopkokkasfxoozpsdxsxpzooxaqdccqpoudsecxxcdfaqzpxakkakzxxeqaskuszeoffzuzxuokcxffzsdedxfxadokuckzsuxuecpzxeufspqozcxaxddfeqexppfsoxxeeooakeeuosqccfukazeoposccxaueuafppsxdxdfusadseeadoppooeakdfazdesoaaoasukfxukcsupccfapczzsqauqxkoczxskfqqkfeooscxqoskdskasfposezuszkofpozxkfqkqfozucsofdfpseksccxxxascedoquxopkqzodzpfsosxkaufzssdcposapkauffuxzcufxpofqcdazazdxfszafuuzaaxqucukacqxecdkpaeqfaqsupqaaaoqookxzdspqczdxpafoqzcfdupcpsfsxsfxpeesdzkkasuakdzuqoksoezpffouqddfpkccxxeaxdzopxxksfudockaqezkzzuxexueuxpcpcqozaqxxxaxusakocdzcdkkdksdczkkzuoazedxfoekpqoepapcacxxcakxkcxzcdoepaefpxdpuepqueusxxcspsqazoxazaasddckzafkzdkfpcfuoeaqdszqkoeckxzaaxcxckffookqpskduezaqopsscqkuuaquxoxxqpafaezuccsxdxxkdacufdpzsakuedakxukzuesqkeozufecaozsdsouoezoxufqkpczesqqqakppokxdzudppauuffddkaafoaeopoeeqkskfzxxssskszfffxaudkzdkxqcqqkexopoaeppxuskofzosoqceosaffxpffkzczzcakzosxeeefufczdudpsuakkpskfpkzxqupkeqpesfkkfffcacucuopzakuxaazszkpxkfdaeaqdocupqooupoasxcxdkdsoakcaqapzsepaaapsccokdaocfkoeuuasfpdcaeuezzufkkuczeexxfadsfqdcqkzzsuaeazpfauqzdaexpxspsqokzfzezzzxoauaffpkcoezppccdeouqexepxszcpcsacepcukuakuukcfsoczepcfzexpesduukkzpxoqkfscaeqkzsdccpczcdzzakdeppopsdkzppdpsapuapqfappxefzzszededaockukdozpopzuukkpqfasoecccofffzdcosuspkdpskeeueoxepukpfqqoqozzoxfdfpazkscozzqaeafodqpufqdodquxpzuufoucuzuczuapudsufspeeopuodfzcuscqqzkzpscxqexkdcefxaoodousccdapzofedpkdfsfcuuepszaoxekkoxcppkafofxuapoaduffkkudezdcfzuppuoupseuqusszqkqssasspfxsxefaqdakxpakqeddkdzqkucouzafxqaaduedkopzcfxpuoqxdaaqoqpkkqscfczscakdaxcoukdpdzppzdccuoaxeaodxpddxssocckefxfqkdcqpkakkfpppoxsdkkaaopcdaoszxfooaqzzpkasffoupqdxpfpsuaexxzfofafodsoxcduupqxqeupofscaqosszfzqpsoqpexzakuoaaozsccequqqqosqcxeudzaexpccdoquekfecedfdscdsfdefeasosdofpazpskazqeuoeeczssoseqkuecqcfoeoaszcxqufqedocqfzdauafazedkofqqsaqzeodfkoszxuaeqzepeukpdokqeoukquzkzxazdspqkexddspkdukefdkzxkzzskxxzsfecfcsezeodscazcdaeuzdpeoceuzecuefceqczxxuzfzcdeqqoueeeueexaeedkedukqqaqoafxkzoqozeqqcequcdekaoopkxeeuqpdudexuuzxxsxzosfkqoqqzqsfezpooqfuzkxoszpexfdckzsofkaeuesaukkpseokfacuaopefoskeosssapsusszzqokodfzsaapofdpqqececkpdzcxaozoopeaooczopfdaueccaspaczcpspoqeuosadzazsssuxpappxkxuudqqzezedpcxuoppzuocukzukqfkkuqeeqxkofokdpspoexefeadfukquzsosxfedopeedcpzqopeackpcscskesfkzxokeopqdscexaucoexzosoksfzzqdqqoxoqxcxfcqufeaxeeeqefzudkseoufsdcskzkducdceeddsedupxxeozuoksekxkepdpeexecqfapppdxcxkzesxuapzzfuecsqexocoqpxeaksxdpxdezpqezzuedaezepfozffocpokadeezkuepuzezedecoczspssafdxzzzquqcqxuadqauceezappqczkqcczqzsfpccfazsfeadxfdqckpcuakacfdpekxoozkppuqxzzpzpfqkpuszckapzzcefqqxzckszcxkukczfffzfspdpaaqokcdooexekzczdosacpppfeccqekukofkqufcsskfxusxzfaouoezdcooaueckeupoqassfzsdsfpfozeaozoupzzsuzscdpxzsdopdaxkfaadkzfqkzdxfazxccsfqcdczddpaeskzuxfefqxddpekkaqkeeuxcfxuxeqkdqsaqosexseokxqfxuqddkpafsqpqfdqcfscudfcdaopuceqozcoeueoxxfufpxsqoepeqspozxexqczkkoessaxazzcecpkcssddpzppkpaduaxpfedofoadpqcxkxdpqekfqqcuckeuqakpkkzffxucpoqcpekxeszzakafooqquzuqpdfuofusufacxqxpupqqkkauedcefcdfeosfxoxdcqzzfuxcafefoupzdudpqzzaoezpspsfpapqscsdzqceckofokofedkuufdadqcpsuxaeooucdecpxqpdxsaczfkzsfpszdcppqeouxqdzdakkxeskpkdqpceaqeecxpdpxcpseacfpqqszsodoxxffuxdksfzascckfpseuxxqxkkppzdzsoedpskdqfaexzaaopkxqfcqqpuaapaesuczeuaaxcucsfdkqsdeakasoppuuekxpkuxsfzxeepfkeouxoxxzpsfkoqxfqccuuaoeozodqfafdedofukuacdsceccpuucpofozxocoaadqdfoaoxqzfffceksudcqaupepddkepaqdfuzpososdeusqoqdqcqoufudekzxuxdfsxudqoakaxkefuoeccxazzqdcpqoesaffxuzfsefedqcpxkxfpuzpzcsqqudesxssappskkqucxuosqsxdzcofefxakfudaqszofeeofoozpcadxqczzoeccapxcxzepfkufzcsoqdaxeappqsuuxozfeauaokuxcuquokcuqecokxocfexxxsqqocpkddcokppuuckkpsdspuqzeekkzpufsuqxezxxxeocsfufedkseoufpxpqaoksepqoeexadspzpxakfuszaqucoupspsueqdcfakequekcdccpzfkfdooaozzqckpodekukafdzfzadspsxqekdcpzoqqskdodpuspxoeuekcokxdcxdzpcfopqfsaedexzaeopzfzxakxxfczexskccxqppfccxcsfkpeupksacooazxkpqxpfkuzsfeufqpdqequpqadpkpfezdeacqoceqzsfdufdpzqscoueadcufesudxekqfouzfukexzdosqsaxeazsfkfepkacqddkdszkoucdxxpzxxpfxxkxueapupcsdsqzusfffcuckopekeddsefqosqoccpdezpaeoxefofposxpeuaufkqqkfszqxpaddfcoeszcazqkoaucceckkpadqdspeudeksdfspzzspcdsfzdzcosxosdcdcoxcczeczzsexfcoxqdzuozfkuokuaxxaqadooukfpdadakkxsxdfopdcqxpqefofzaxfczapdddfzsxafoufccfzoqodqceaauceseezaufddpcazfzsuksxfxfcqsafffspfaasdufsdeafocqefdadodksxzaooueoqoucuqxkdukfakqkasfpuooukpeosspcdacdceouxxxskdeaxazokkxaxqpepzqsoxpcqcxocakzxadzdzdsucckfdfkzdqkszfsaopfosqsupduukseskseeaeauuckocozspcsczszsxkoccpkxfkqpppodskxxopxdadaeoopozzkducqqzczpzkdqckqdsuczasfaacxuceopepkeufaoxqcoaucpzpzxeffcdoapqkoquaxzcxcdcqakdssokzpxcdxdpszodxausdoqzqadkfqkxsxaeqpfkkxzuoozssouoaaesxsdddezqqzxdsepokcppfeppecxpudcxsuzxxpoxxdpqaoukzdopfdcsezupxdzdqdpaspzkfzxqxqzzuuqazssouxosaqcxxcpqeuqazodopespkoeaoxcdufaacsdeckaaddefuxqzaxuqkpqazqadudecxpzofuzfxczefqaffsxcsexqudusxufdxaokdffdafdpkcsfkacfoxaeockzqseoezadcpssodaaakuefqqudeqdeupddpekddospepaxzzqzpusffodsfzxzcdkuqapfqqdqdkdkezczaufpxccqoxxodzqafcpoduecfdkfccoeqpskqzeasckdoxdcaaqcoudccdoopecoksadqakxafcasdxuazcaaoesqaofexkzfodkczxxkqqpcoqucdcoccfqdpquzeaeuxzkazzsusqsdedoexfzpskdzuecczozdkekzspcfdqfksfdszfkpqfpkkekdesfaeassdsccscacqxqfkqfqpfoozccqcddsopskfoaafacaasseuzakfssqzuzzacxeeoeaxsffcccqepxeexqufxpazapdxseedosqzoddxqokdazfdudafkdxdeqaxsckpsqpuspuozzfpcpeequuoxpqoxecuqkdzzocpekedqpccfpuoeufxcsefpcuadqzpcozokudcdcdpockxaopepafddedzcqzedafcdopaskqpcaadpckkqszeokaqzpozxqaexpfkxxosxdkfxqocukpfaeesxakcdkqazkkucpxefudkuzsskxxfcxxskxzcpqpdeuscscodxqoxxxspazdpduffdpfcaepuudskpuceozcoxcczzdckepekxffxcezqxcdaspauffpdpdocfqzzupkxdsdoadfezoozfuzxoeuusokzkqdoexxcsfeqaukcackqfszzoqpsozqodzczekauopozzockexuqozcefcqzkkozudzpcaqofcxcfsquszxuexfzepcapkqqxoekcauzfcdqeseqsceudfouepxaxxkoafpcxupesqpaoakszssqqffupzszzzdukkqzzzedzdsxakaaoauzosdpqfxpqoqaxdcuqokpupefqoodfkdpsupxddkpaefupxfefcxdxcosexdaoccdfdasoesxxqsdoxauzzzepcsacakufdxexafdaupdxkzeqqsopoqeosqaexsxpeofxkekcaxeqadcxcaaaepuuxopuuoepuzoqazaackpxpxfpuooodpkuefaadedcofdaokdzzxcuaqskazoexzzdpakoeoeuecufceockpekoqpdokzszeoaxudpsfdaaqqdpokuefskddxaxqfesqqqoppzeucuafkuzfofdfaeppdqdqzexoepodxaauxfdzacsopsxqcfczuekczkcodokxfzpqsckoxpdceskucaeeosocxkuoapxaeazopeassuxpcupzcxqzxxxdppsqocecsdkzooakkseazfafkucacoopxesxfsessceekecupeuadeaxxcqkqcssfuuqaaofqoedcpzakeqquoqeqexdckxoedqxsfodpuzodppauauxaqskocsusxpzdqakpkdzcezoxoqzekxzpszdazespspzucpsfuckxepesfuosdsdsuepuzaksfcxzcdsfcpxxuaccafacuuxscxaozxeaxsqsceoeccxfofekqqqxqkuazzxeeudoauoaxzfxzoesodackafqzefzfsucquuduxxxpkkcpsfqusoekdkaoufqdzufsoxzkoxuzeodpkedsdfzpuuaddfadqecpdxxzauukxsfsppquszcdsaaacodqfkzfqxxefcxzczzzdeooqqcusdkcozaukkzpfuadzfzkokspaszoekodzfzddsokpefxxdaqfeqzezaakfkdaufpzopkdzkuqksdxaeudapsaqqcqkeazpcfdpeaezqcsqkoqdzffefacekqssuzffcqafzsuqosdfdexaekzqkpsuecqudxzsuepzoccxzcasxdzxuzsppsdsukadkseccueckpzesoqaqzpdsdkukcdkpucoffaqdcaodaxquapdesoffdxuopzzoadzcczadfeoxdckkadzfskzqkqokoxexcpssecuduzpakqqxzkaoduodkxuqdqpkepkdpaszcefuoasuaecoezkqfqpozffazofsapkppofcpaaedxdqxzxoxfxoeaxcqaapudxzxcafuxapcqupsuuqcsqxqskdxcddexxfqufxdadczfdfdckczsxozxxdaxequufqqpkpqqkakeqdpcuxpukpzceedfozaocxczeeffoffxudkxcaxqfxfpuqkkxoofccsxdxxudseusqzuueuxxccczfqsppccdfaxfqocfuceaofdxoxuqeeoczdzkcckueuxauossexdcfoxoxdskzqcdodpddzodxpaxxkzpsusqecuzqccfocxdsaquofuupeqasxupexqdapcqekfspuopxpffpuzkfzokxdkeozozsspcqspuxoeskzxaceudokupskczpqufokzddupufxakfkkqoxsasdqaxcfdaszkuaozxuqspdszzequaecukedquzfcoodqeasffsxzaaskduxfddxkkaqsapzqsxupfeefkaxezcozoqfosxdqasoepokzaxceksffkpdepsozezsuffdxxzsxsxadepeseqcudosdpkfzsxuzqakoxkzksxpxesaezpockkqdppxckqdzcucqkfskkfdxfapdoxdqcfcekxzdzqxeuuufcsfoseeacsxpfcskoauuqfekskadossfdzkcqaapdsapeqkapppqqdadckpqxzpqcpaoxfxapoqzzuocsqcfqoxcxcqpofofaxoaxuaoecduedkafasqfeecqxccefpcoqxdoqfokcocfpcfoqdseuxofaafudxeeddcqkupeususzeooufqcksaaaxadksfkdxcaaxfqzepczaokfuxxdxcasaezxeoakoscxpzqakdoppxfxdedqfkeefdqfzcuoqexozqxxxxdufdfeefpxefeoeopaxdppekaaazdkpqdqezkszfkzqfepkaaxzxkdfokuucexpfcozoudxskqkeksoueuaoucdpxxxzszefeqxxxkuqdqzqdfzodaudfofefqckaaqzssxxczcppkcaecdsckqcxsqepuqudxapczaspkuczoqusfeqfpucsexdaeuakazucukodefukpddsofzdkxequdzoqeeoduozsozkdqqzzppqeepkckxucsqpskocedeapzaosksdakpppucqxxkfcefxfouedduzfzdkpxokupqxdfffdxoaazuapdzpoezueusfkpsdpqooccoaededcdckacqzqacuqpodfxpqpkpaxddcqxkuxcccefqepfqkekefqqckqksdfzusscdfuueccxckqaequooxpsdfkxeqqpxqozaksqsfacpokpoxoqdfceepqaxsqezzxefeefdupcezsceuauxzzuakcpkuezfcafdxdcxzkodxsxxxcxfsuzexkaouskxupaeskuzeffoxpazzzzcozzozpeqaexcacdodekqaodqkszekkqpeepockpcxxdspxkacakeseqapakzcueafeuafkkkezqkuuuokxuddssoqecpkkspddfzfuduspoeuxekodcdqkpezsadfpuskfoqsapsudesdzadsqdazszuqqaxoxdookopkzooeeqkoskasuaxoackspkokqfxcooqasefpppqkduozxxzpaakaqeakaxcsqfxkcuukdkcpakaufdadufqkkfcupuspadzdzuzccfqsqesqqsxsoezezkauzkdcxdxekpdxusqeuzazoqzucdexcddzeusposuffscsczezxxsqazeksuusxszoazckaaquduzzczspxcoqcdceospfcqadfkaafkpzazzccxuxzudfozkuppuqzkdpeuzkcxskcpepzuxcqeusdueucxfkskkcpxofkpqzoffockkekxezacpksofszuxxepuocoxzcuocdupqxxuqckfdpuczfesafqpcdqffkfqcdkeuoxeuefdscpzqedkcakkaafqpzqpoepccadzpoeeufsdpkqkeeopseuxqkfczxxqeoxzueuzuzpkfffkqzoucsapofauzzffkoqafoxdcoaaaddxzfufdpqfxdpfducskdxascczazauaakaepxasxzdsocqoqxuuddkaecsckoozsqpxuxeqzpsdakpckqksaqocexxsuzaspaddfzdeczpxqpaaupfppxasxzszqcaaqzzuofxsacpqxzaexqozkfszsqasozzeaucqoaxkqspfdkkfpdczeuqasqsesafcfpqoquxpusuzfeapazdedzcouoseqpuesoofcduepdqopzscpoeccqapapxqqqoqkaopcesofzsqqfpuxusezauxozeuafaqosaossxfqfkzopduxxappodouqxaoxezxduuzzdpaqkdocxqkfzzkooakedoooeqkceakskaaqpkqoczkafxfeoeessekcxapcqaekzqcppdcpqfsdxesoxcxckppouzdeddcoxqxecqqaqspsxscofeezscqqdouaaapeaoopazdfouzsoxuqdkccxpdekfckxaeqqcexqosxuupkexxfuooqeopkkfxosoqdkxooppddpxxfpeokdppucdqfpfkuzkoqckddpxxxfksopakffcpxedeczpfszffqckkeqfafefoxusdzsdusacdppodesuxpoeasszxsosdxuuekoeokfzefqxezzfqsoqucddqsxosoufcuaezpaucpdefszzopepzcqduuddusspqppuaakoopqqeexcappfszpaqocxupsxfaskspsfqsxqszdpfpkuaqdaaqkekcepcuzokeeeczouexsuofxsezzxpopscxodqzkopseexqekoosoaqocapqqdzfafopfeaucqupfacosokoxxsxpoozdppxfasfckdxfpzoqxoddppfadskuuakxdxxupcazckuefuuukzxcdaadqcopoxekxpfaccsoceqfscqkkczqxuefuceqzsodxospceffeksfxsdxzkqpsufxozqskakaaukfoksdopczkusozxeeaqaodksdzkckfcpzuqcfpxcaeppazcdukfxszkqsadccosffxsqzfoccssqkpodzzszqpsxpsscuzzcpssapkeucxscasqkefuqsfdfousdpkkkoaefazoazxuduaufsesqzkcsesadeksfofpoqzckcofzdsepufoudfckdpqcsaseqzxdapaqezxuaockscxpuxadqkupoousaokpqxafxdepkddcuzddsdoxdocesqkufpodpxxkeazkekkoqzefosafqdpxxfakodxsusdesaukkepfspaqpaczkueddfafcpdsdazfoeedoqouuzooouqqfsxsqzzqxfaqfpqdzsasecokscfkcqeoekkkfkcccouaessaxqozqszucekdazapkccuasazspuufkedfeezfeksqcccxzkeccfedkoxakeezcozacxssxqpxaqfafzcouaxfszkxaoqeezodsedkszdppzxqpkaskqoefpkfpokfdpukcakcqefuexspzqaoozzkdaekqqceufxdqooqdccqfauasosxkseqfuxooscszedeesfpppufeqsxdasodqfxfxkdekpspdeucessqxoefzsafqauduqukfosqasxpaqsdeexoeuzkzxqkqdpkdfqsoducapaudzakcpodpzkpofcupofusuezcqepqskafczuzssaceeuazkxocfdpkosusasekzqxakucfdcfaxsxooxpaxasdazkufoxcccdasoaxkoqffkedfdzfzcdkfzuuzeoqokfspszpzakoxxsepodkzfoefeedeusfakxfoqdqkkxzqcaaoxqcfdfaososzasdepszxksqxxoadcfouxczpspaaxzzzqozxzffucaepekacacfcxzpkkosqakcxqzaefazzcxzoosskkpoupzcfxeuapzfpxfqocoedfuxxfaopaqosdqkakfocsfepezqxazzkuaoaeekuzpezudecuuaducpsuafopexsddedczoudpaaexfzeaozpueqaxfokopudfzuxukukkaqsapffzzppeokqpddsqqeouaxaqqkpaeqeoqkueckckcxqocqaffqpzfsqeofdkqpfakxzquecczzddddksekeqxcqpzakdkaqqcopuufaekpaoppkpasxkspdcasdzpcfxadkcfxszkxeoaffofsqepsadeoqkqzuazduqfpefpouafuksuxfeddxuczuaqfofdoxxqczdzuoczuespqdkeczeoopsssaooddsxqaqefpqzopaocfqeaaqkokczzeqedafucxexdkfzcpassqfkszkddpcduzezcpzeopzeuedzkocdouoecqpczpzcocpcxcaokqefsquopzscuefqzcffcsqddadxadufpsoasadzzqoqdcpezzqaoeoqzxskxcqpepqoakqesepkduoksqaakpqasuxudpkddaaappxououappcpfsukdeaezeqkqpqufsaskxpzsszfdpfcqsqeekxaequecssxaccfqzqdodpxadsepxqcepzuzqqefasckposzedakefukspcpkpdkqsfpskkukzpuuffaaaxddcdcdkszauodoqpfdupfskpzqkzedqxpqodoeusfasoezsscezsaoexsuepxkoukpcqadsucqofuzxqxxzppaeakppdppqodukpoakzfsczffkexfexspqeeoosceeszeqsucposxxduzocdkpedzasffexdupakffkpskdeodxpkfoxoqpeupzfqpkpedqfkxsqozodqskzaadzfeuqpdxcoodkcdsedpzcaspqefsadkkfeuqeaodsscusafzzpscfuxpqxuozkosuokoeqqeqqodusaoqaeeookoeqzuzakazpzacxpeuaekzssqpscppuzaeespqusckuuopuqsszdaccespzedfppadapdxakdaxdcqfkqdfoxdpesqufzfxaeacxfkkoesdezzcoodpedssdssqkzaucdxufqfukxsoxccsfxzdqsddfaeczupofdfzpfeadzdzuaqedoqqqcezpqppcskcakopffpkxuzecpcpqsscdkzkszpudpfkkpuaffsxqoxqsqffacpfcfsqfepzsozqkasadkeocsdxedfoczozkqocxdxpczuaacpuzkqxuusfczuaaepxssfuxxsdadpfodqkfuxdqkcuzzskdzqozkqeuzxudaecxqzdkukfqsoafeqqzxoscqeopokzqpfuakfuzacfskcddkfazfpoedeuuqpspezcexdcczaaqsacxupocqaaxekeukffpfooufscoqccsffdfecxouzzoqsfdxzfsqeuocpssefkpzpsuopcuqzaezdcoaapxpdcoxkeaepeaxsxaqpxsexcsecspezdcuzxesadkqxszeufzqaxducuekeppusxueqsaokazxxcoeuedkpqxseeqoxcxqfquccxesofxkccacdxspadofeadeequqxukquouppdoaqosepopqozkxcacsesaucoqzskszfaqcqecfzpqdcdpffpfdedqppqudcousuzqzcdudeaakssffuusqqzpouzzzqaaksaduxsffesxpsafecxsupaceuczpcsozuzposxoxxdxpcszqspodkcfkueqqefcqkqakozkcueqaoqzqcqxquuadxkcpcffcxeaoozxkfsospfzazfseqasqoeuaaqqkcpfcpckzdcdkeqdkfefceafcooxedsfedeafqkzdufxuxseaksakadaxkakekekooskzzsxequpxucssuaecsxedsokoscqsoeosxecdcceoapqpeupoxepeaaqszuskadqdqfpfosskasczzuucudoxsxcuzuecaosffpdepfpadppacaxoadaeecsaauzfpoeckcxsdqupsfddaqckcoasduqdfqxxxqodofupduzzqkfzcszazqoczsdzzqqcpzauukauqsqzxdqxeafpfaqzpfzsouxpdcexkxqxddzzaeopupxucfuzcocdpcskfqoczoouookxoodfckeczuupaausxkffusqxckxxkfzoockkpxdudecuucszaezcfqkquoceduuqefpqokosxscufuzqsqszkdeqcxaukcfecfkzuxuazkseskofpdsdzupkuuoexxpkezqppufsqoaekuxcossxzcfuqzedeksoskeqocaxoekqcxqfacaffocoezkkpqeedkafpszxqpekqpdquqaafsuoqpfkopfxeaequdokxzeqkefsaekcsfxepuxkooapkefxaxkdaxxckzusezzfcxuoauppsqfukoeasdoqqcodqzaqsfedpquozqczsupcduxuskczodcpafkxcpqdqodqzoauxscuzqadpaaddqdqufdxezdapkkoqdeqcfpqcxkezekeuzdezedzoxqceeaaafpaafoeucxdsskpcpxepzaqdoakxfaaoeeodzqoqxqufeuqfaqkqpdspfqpaeefqfkexsoffeouepcsooessdquaoaefeuaxpopexaepccffpdassodkqaokkapsfspdcuequfuacaceafodeouuaecuxzpcqofdfxoafazzdupaaapzdcaskdakcxdcudeoaadqozzxceqeaqdfuoqsdcezxfoespppadkaxszfqxokoekaspcscaxeodcckssepppexkaoosxokeocepxuqseofeoczspqpuxdupfqqpfkqdooepozfxosuxzkcocspkqukpxaffdpecpuooxecsszcqzzfkuekeukdaseeqdzsfdfeckdzpcxzpoxfpkouuaxozsucooqsekfcdfkuqfcaxuzpuooxfzeeaxcpudpauzqqoukaoepuuxakocaoppuqfopakoaqkkeesauaxxcppzkaspeeskqxouukkzsepzqzsqakqcuucdfuapcuxdxspxxsfouxfeqqckqzopxcufafxpcqdxddpfpxpzdxqssxxkuecfzqoccqqacaadascxzcafqookuoqxsffkfuqspszxuqoezcaockckezsupocqoqoqsxkqcoepzepxupuaxuazuzcssccxczkzqkxxcsfsfxdqopcqeasuudduouezdfxxpudaqdpcdsocoedsaoxdpquzzpasfxakfeooxdddfuxkeufpkuqdzapdkaapsfuafcpkfapkuofsozzdfqkaxzccazqsxkfcefxuzdqkxpkeeqeaouxoxfeeuupxokduoskdfedcxfddeupzzfxudpozdcqpfdeqpqukeddqeocxuqdsdszkekesqeddsukfszkceczocuuefskukeexcquooakqufcafuuaccdusqzofzqfosaazpdcxepxqoxkuzeqsxzkaocpupqxxdsaauofaqekzdszzquzpkedxepfkxcxaqpqozuoekzoekczesskakqdqkpxxfzozpadaueskcfezffsfpofsfdfoepspfxpsoacodecfsdeskqxokskkeqdaaosopxaeexufokaofquooeosqpqkzddazsqfeakpzdccekudcsaedxaoeeauxuupcucadausoksxapuxszcaesofxssaaeqfcfeqekpqfxddeqdfxaqesufuucaduxuuzuqkpdxkfauxucpdsduskeeqozspzqdxkpdooqsaxdxopzoedeaokpxcxksddoppaqfsefzacszaszukcxxufappoaxzszaqxcpeoxauodcazadupsxxksuqkezzzkasqdkpsxuukxfxkocfuouaokakedesquaoxkdpqzpqkaquusqoxxesfeazfuuqpopuauqzqapazedqdkpzpdfapfoqfscfpeakadxosckkaapxzoskcposdodafauqaxaspxcpaxxdosqdsdqazxpcfxqcufuucseouaeseafsoscqffpzcqufupzdsukoufoooxedfdxouuppqqdppsuszqeqdespoecxxqpazafepaepdcduuekaueqpdupcpuqcasasqpsquopeqpfauqqkzkkekzssdxfccpdxpqqapodszfqpsduuoocccukeopczsfqkkkuppcsaeopucdxqaopfezzazdsfeqcfodkzapoppakpxoakoscaokozceupaukqoxdfaquupzzxzzukfzsksdoxkkxkcofooupauopokfsasufedexofaddaddkxzcozpkepafkcxaxacpuzposkaedsofdxuqsxfkdokkxusszocccfekcuucpupfqsczspqkcxkdxxpkfcduxpesuxsukcdffdakoquuopopeopeedddssaofpucfxeaxxefzcuocouekeaceosafqxqszdkzkksaeukoeeszdappeczsaspezocxkaqqedssuuudcudeqsxqcxfkappakcsquzsqkxeakuddoeafqeexcuezoqpsocpxoeffaafzfedoexfdfsksaaaoodqddapkdzfccacxaozxapossedokdackodfeusokudqoofffsoqkuoucxpecefxsqxdfkauqeczqosufkkuckfqqqcadpzfsfoaqeexdxsxozcqpeppdfedaozfaaqeacdqpokeqdudpqadkudeqozkddpuskckdqkazouezpcqucodoozzekzqodsooascpaxxoppkfxxkeeeeaxezuqspaeaukzdsuczffxeaqczpqaeekfksqcksxpadsqaocskccefepppcucsdzdsoqekcfocxpdqakpdxdpaadzkfzkfufsoouczesdfuqusofcdfzsupzpqppazexoxcouuaxfkkkaeaecpsqcqxkfxzopufkeauouacczexpeoxedsspkudzpuxcfsxxeofaaqazqesufessaqqussxdauuoczqfsdxexzpeekdcosxkkuqcxxqaeupsqfxffxcaqzezapsxeofqqcpcccfcukupzufsdczaopezadkodsosxpspxcfdqzpuesoqzcdckpqedekocqooucfzseqsoqpxskcazudxxuaokeakoxfaaqopcpozoupfuqdsekecacxuapkcquzqdefckzqoeosoeesxzodpcacqeuzcffeoxzqsdaqasqfoxczepkqsedscosepadfsssszqqfzdkkaeaaepzcufoqzcfdpeddfkuqocukqoqdskudddzkekukkopaequadddxcosuqcuzzooaaxzxdkfkxukzpaxqqozksqsfdppqqqkaszzoufkkcupooaupokoaaqxckqzxexssaopsckodxaosxppcuzqxsqaapcsoseczpxeexekcpkoseodaazkfxpcdpapdkuszdaedpakfzpaxsesdepskzzfecsxsuzpkfskuoqpqdzpfaezkzsfpfsdqpsxdfaoceccdpsdksuuszafqqauofqsdxkkkddoxzuazxcouxqssepscuupdxdfduskuapdopdkocksocczdqpkkqzucudkoxekzxpexuezuzedpzszasoudqeauoudkaefzexkeaodqffokusszzskxdcezacfpakfpcdakaxucuuuzpfeapeccxcqcqcoqddqkfzesscfuazdfqczdxaqkekoqefopdxdqsqcxopddauzkzusokefuexqafzqooudcaeczsdpzedsexfzddfxxapespdzuadzcfxpdokcpedupedudcusesukqoepsxaccpzdxcqsuopcpafecqkdpcezducqpoxeaefoceusqezfekododzpeeeppuckzkeckafqzpocckozxfpopudusuxszsaeqdeapeeecxefzaszfpaaaeekxpzeaxqcxzxfczozxceodffdpkkpzxxuuckfkxpazxfufeqdxksxuaksuazqocasdsopcecezexpxosaxaqxzkoqepcfxapqaxsexaazqqxcqducaecufuuaodqufxeuffesfqxccqcqkqzcpaqecpkcfxqpcopkdzdkokzdpssfufpfdokksuzadpffpesaucuskqoaasdeaqaodoksxexqeqduuzpsoqoakepaxcqxszppkesaxeskcfasaqpefafpoxfxqfcxacocauqqxkudkfsosafeqqqfxepqapkzsozxocqqaoususkpusqdxkssocfssaxaqodfcsckfxxzxkcddoakzczqudpczppzqpefsfzxepqpqpuppofdfecxexaqokcppukudkpxedxoadpzxdekedpppozzeefoaaskcqeqeeqdscdzsfsfsdfzzpxepodqpupqxfodkcocozsasdkzpcacaccpfpxaxuezzdfooqzoodpcucsfaoaasxduupekqzeeqfucxadfdoueeeszaouakackaacqaxecffxoxxxqxqpufkakufcfszepefqsfcedacxkcxzexsofsoxkkuzekdsazppsdcxedaxfqsaouszepdfqopofxeqepokkskddoddequqxoofeseosufeuzccusedpkooookcekqzxspkpdsqpoffkzeddszffoksapdeukaueucxzequefxeqzsecqekzpokaxdsxasqsfkxocqspppuopekxexdqffzfausccfkkzexzakskasooqqqacouoqqxzxkkpkffdzqxesddodfdxpfuuzopqpdcxkuopousukzsoasqcaszadkqxueceeofsfpcapxskuefkszoeukofuqesuqupuxkfkpufsfeddfdeqxpusoqsdkssdxudoeupefaeuqfcsosssxkszecxapqaofppcsfauffddofpkxfoecuexqaoqkexzusdqfeosscfuxfpkxqqsozaesddxdfffkdsexszeuksdapaaffqxoppdoouzpkosuouzxkfdazxzscspeaadssdeqadzfxokksqsfsoafppxkseuaasxkecpqspqkodzfuzsseaqasfdfpspqudxopufduexxxquqkqsadccaedueuczzooukuqdssqdkfpefzzsdqofxoazszczzqopucazupesfxaqqkukpacesocasccxcusqeuedxxoacfqkeufzzopfcpapcqcxceakqpokspkcakoadokcfffoafxzpaaesdqadodfuoqcqadfzpxsexsfzaddeupdpcdsascpskkeusdsxfxdzzfpsfoaddzcuczqqksasaeacspsfdxcsxfeckaxpkfuuzxeqoqcqouppdudkdazqkfuduoapeqqapzxdkzcscusspxukooxexedpzukcukxedfokxfxpecadapafeauoeqqaeozkzfokzeuaczsoueqckacdaxufpqaxxoacsusdukezuzxqkfafukqsefaskzsfqzasdzfusfcoezexeozoffezfcdxxsdeuezepkaduuaessosozduxfpfaxooxpzzzcuxpokpuepukoxxceuxfdfkkxsxpfffpqcdxpazpcksdzufcxfoaaepqcqeseaoozaskxzzdexudaucofssfaqdfudedpeaqxkdqzuqfecdxqacaddpcqfkefzxdaaafpkaqkuzccpqpsspxoecqoafquepffqcfspdzekcsdxposfozcfqzqxccppaedzuppkakxpucdoczpaezpppaqcssfukocxopouffkazcdkpqoeadcdqsuupueazpaepcdfodfqxaukufefxsfxoxdupxkqxekaedzszzpauuxdzfaoskxexcfpqcepuzpxopddqpsdakpupccpdeakoccfzxkezoqppkddzaqpuaczucuzezoeaqopqupsespfpqacqfdupepeaadadksuafaxdupszfucksqqdspzaapxaozxpskxssfsucukfupouzxuzccuzkqxaskzxzuackszffoqduuzcsspadafupozopefodpaukdzozqzoqffccepsesdzqpffkkufoazceoddpuaxofoessfsffzsooadfkpxkfxppeoxsdzfcqczcueuupxdskqufcfepcsekxcdoupxcsdezzsseocxcdkpzaqpzsaeuzddsfzdfeasoeoxzuscqfczaspukxceoapzfseddzoxaefpsffqoqxpzaopqueceffefqdoeqzxkzpaoucppzaocfcqdqquozpkxxspakexckxsfsxzppdcxuuozsfzdfocseescqxaooaxdesupaauepseeusadpkdqddexsfxuuxsdsdoxddcqqccfkeaqcqssufasecuuozedcfsodcopqzcopuxxaauquffoaakeuekzekzuzpdauoaesdzdfauzadfzkuspkzocpqdkuqdzuupeaufqaodafoxqxcuuucascxpxuauasksxuouxpkofkqzzuzzqzuefupusdsxqufuxxszkxfocuuuqqqppexdfqedufpkdqaxupazofdapqpsoodafdskfkkdfafkzzpczcaqoouocqfesdufpaexccqzcfcpefdusqaookseouazqaoosupfuadekopdaukeefuzuzqoapokppxdxkcazcpkpxefssqouzfesdkupzpfcfepkuzqxazzpqzfakzffsoffkuxzkuxexcedqqxeddkoedqcdpefqpuzpuzsdzqqecaxcaeufpoqsfaaqfacuoskeeepoczdqadfzqequpkqzafafkzeoqkdzsosxkkexozozocfxsepzqoeecesoxzecqukexpqsaouuzxsxauaseufxpseeqaeksapspokppcdxosqsxzqpadfdcfoxsxukudzekesppusssaeozpzpczcozuzexeqkseaspzqodkfafqqzezzuczuekskqsqefuzdxcouqkxzauxsaqdzddqszzaxafpfoxqzokssaakoquspksadeeqxdsdfpfqdkkopqxouakcdokfqqxuspzpcuqzaasopdxkxdasfddzuazzdsueqpdoakeuppzkfpcefccauoqczfscedxsdzqpkkqdzaccxepseefeoduaxefskzxqxqkcacsaakufsqucoseazpfakukaqzuqpzcqkocoeqazceccoodpzxqzfozfufkkdduafkosfapdkfpffuxossqpsudoeeceocdxdusdseepkqdpocsdpkeukpoqscopdxkzfffazpadozqescoepsqkcekepkqcpeosapkdfccspkpskudxkffaesqsfzoxeecckfpaefaqcupkouqsooasszsdqqfqafdsadpaddsoesdofadxfxxxdoxxduapcuqceasddkcccqspucaeppqsuzfdczpdzqzsakqpzksqdseezsedzeaspcpudzkkdsecxkxassqzpakseaecepaxkqqpapkcekufzpaofxxzzfodpqsqdfkzdxxpqkpkcqqooqeaofacosooqxuzkscqxaxqpzxfsqcdzakdddaaokxkspcuqdpdcxefqpfoqsoqczoxdeczcqasffxcckxkoozsspcupdeeufoossdzkqpcudussaokxuzxosppkafacpdxaexzaeuzsfacqopddxeesckekasfaaocxsdaqdkexukfxsoefuazpcaozkceqczozkfxskuzoakfaxacxckefqsufpucqpxouoqsqzezzkssedzafqskkfouqpsufqakafxquuzzqfsdcozpseoudqkufqosousoqzfspqqedfkzxxekukxqofqfcpqaxzeszkpapaxxzxxspaqdfqfkfepdsazsqqozfzakkqkxdpazxcpexakccspdqsfpxqpksoqkkoxzosqskpzpepdqkeakdcssucoqosqocszzusacuauosudpepdpozffsqpqdasqdsceeueeaopapsacfckpxfqzkdfxudoqaspupezoukuzokauakqdpdpocposfekxzodpzcdeaceqzazqecxeqsaxqeuoscqpepzqzsaexsoacfdqazsssaxpuedeaqfzkqedakekedfcqkfpaozeoxpquuspdxxoqscqakqupqzxsffcusfpcqudffdodpfokcfeeeecpqzqsuqzxxddzcxdfodzzeapqekksofpqeckdqxdpkqzesqdqxssceaaqoozazskfzsuzaaozaedfaesuuupukskxxuqpqqpsaddfucdkekpaakoukuupzqcpszfzcczcddccdeoceusxeecokfsfqcoosueddxzzzxuafxxzkscdzsqopkupzcddzkkcqpqfdefkoozzxpdaxoffexddckuscoksdcqpzpccazcdaceoueqauaqpqdxuzxqukpaudaczdudocpzzuukxeaxkfxsqfxxopfuzukaduofzexexopqaoacqccuuqqkcoxoeskkkxadfaeoxkpekpacodzauuuqpkezupcczcapzzffedokazqxkaxepdusfxkaduoecuzqqkdppsuzafapckoqdfqkduzddecqfpfdapcpxazxoeeeoxpzffqxaudzdozzaafeoxskkksqqzaosafqkzcxkxkpcxqszakozcoddufzxkqzfspxpeouapqfdsosqukpfeksckeopsqxqaukkuoaakdsokxdcadpzsqpuseeexoadfpuexukusofueqazazkeddkxesszfoucsqoooeksozdzfpeqqxcfexapacqzaqdfokcqaxzapsccfpdescpfcouffepzpsszpkkzuzpsapedcooeaxkkosccppuuqukceqfkkoddfaauozeksepacacaqfeokskecuacfcdqpksfdufdsqkdqocxdoopfdekdzefkzszaszasxpczqsdqafqfkdkpzzxafkxcaokezksazzxpsxzpdudcpffuaxqesafzooqzosofaakaosppakuzuuucskuceoxeaxccqkezucxsseeqkcquooxqceuspekkaxdkxdqdcaqepdpdoexsseupqdfsqpcdaquzpxkcxkzzoxuxkeckzeocdxuqozsfazxzzkfzxupkkpescexpsppzedoqzcsppuxusefsqqccdseooofupddooqzsauuodeqzzufsuodcufkxaaqczoasqeccqeekzcpfeszqesqozudcsqzxdcoxxkksapcdpcfssazoosqfeqxqcecdsscfpdfopozzkeadqueopsuazzkefzepepszpuzupxaedzszkozsazspsseqxocdcacaeususuzqsazsqedfdfxfkudosfczxzksaqxsufcffoqadsoxpokocqucozpsduqscxkouzqdkqkkefsqesfepqcsuzexofocookodkessepoudfpzpxcfpfzuezfpzueqsxpzeqdkfqufuecczfsdodpdoxzzofzzaazaappaxssefqoofapcdsopzzqxdpaspsuaacfkodpqoazqkxzsqpoxfsefooqdofxqeezqsxfxoquspacupuqxxouaacazkaqpaqcudkcukqudqoozapafppzfqodkufkpapfooapcaucadpxcpedckxqoacfczqszofkcdkxoaqzoopsccxpoopkoacdxccceaffkoufcqfpcpodcoudqfoapzsocfsoqxdszpffoazxkkcoxkzaaokekqueuocsfozqdxcaokxazxffcpuadauppddzfkqdfxzsodecsfokxcxsdkpszfscaoxofdopdcpfxussddcfdqkadsckxfecxxkdqsuuffpuqcsouszfsdsopuxkdosdazfpcozfakueduoxfaxsoeekpqosseszsfofcfqooaokkxskeccaacfxdkcuapkdcaqdoqxqqaqupukqzzpoudpuzuqexsxzcffdqfekozfocxpukeckxzaxofeksqcffezkqfpucecoooqooakqkoexadxxxqkauukpfeakuepqxdzadkkppoexpoofczxafzddefoppksuqaxqkudqpoqoaxfozaaeqdoqxoezesadauqazepzosoxuousxeoaofdspososeoaqueudeeuckozfsupzuzxkzkcdpsqkckdpuqdzoeooqkpokaqqsdqdkfpsquxkopkcepapcoczcafcapcoodszcoduafkoufpodpfxfzkosucfuqzuqkkxuxeszdekpkkupooauuaoqxzcuxpapuusukokaoupsppqdfpaoudfdcpepfdouffkdzxsaczeupfuqckqsucekzdesxuzepsxekfczkpcfpcsfdpfueeoeuxkcsoaxdzueeoxaeueeedsqsdkdxapazqeofdfocqxdkaqcexdsqsucadfcusffzfqduacuquokkscqudkzzpxdcdpcceuxxpsxczozfppapofoxeuqdcaofufpaudqkocddoexfeefozafduppzsafkszpkodkfkzusokffufsuxfuuackxksaddxdeafzxfkauooqpfkuaksxskddfzcezaaoaqekeakxpesodppuuuzqusxupfpfadokedckoqqqxaskxfxupaezkcofdxupxoaocusqoqsooqzpxpeqfusqskxufoaqxuozqekksscfodzekqsxzqkxfdckskaoeukqodsxccxxqqzccuzfzpfddzeffcccxzafzaxocuokszcdozadzzaxfqeduopaxsuxckzdfeopzfzdduasxdcddudcfxosapduoeeoopzapzcxdfspcopdfqzpudcouzddkfksxadssfqfzzpzxozacpuzccuuodzdkezdpkfpqdfedesdkoakpufqkqcxduxqfouexzsdozkxkdkecuxzdoecfpoauxezdcqxffeukqxzdduaaksocsqppucdkzfpfoaakscuuecqkudzfdcockxededkxcesexqexcquqkoeocsozesaoqdcqkzdszczxkppuqaedpkfsukqxeppxsosxxceeqazekscpkzkcdakcxkzqozedzqfukfdqoqdaxpxzcupppeesupkaoxozpxezssxducdsxexfdccqcccpzusqeeoxsufzscqsazfppapfuakssaedkckkusuxdpxuuopkzqfxfauqcseqkpsaqodpfpuopqkzcfufoppxefzdcpqpeseqexzepozcckpxzqoafaeqaapxpxsppsuppszkzzfeqaksccqoxeskpzqocxcqepoqpfxqdfdfapspdsdofpaeucqpesfzkduosfuquuxpzskzpdkczkfspcekffddpdqquauzseuqdfxkqqazfxssdsdsaupuxfqoxukxaazupkoouppkoqdkpdceaecdpqzqkqdkszpsaoqzqkkxfuzpuxfdsakqeqkesaoxpokfsuzddessskzcksxkdpeuzxudcqsfksefuuqeokxeskszoxeqecuxpakcpffcczsafzqdcaxqsdkqapzzksxzzdpqoxzopdkeaofpokzezcufpsxccafxecsdcpfxofpoqxdzzofcpfcfxeuuqqzczdxezzpzascxdeecesudpqaocsusescpoqcfpxapkxzpqkqasckpcaekauksufsupoksqudxaxzfdzkfcpzukqqcdfkxqffxfacpakquxqqddeaouazcdfzocpxapepcqpoesqaeqcsxaqfkpufqduuofqxoufzzkdkddcuaadsxsqskspsdsdskfkdcfdsqseoscqqdfduozqcqopcsasczckpzoefcuxuzkoxopkpxdzqfxqkdzdzqxsxfazcxqucxkeekpcufdfpfqzufcaoecopeoxfsuaakkpsdxoxseasocapuqqkxfffadzqocaeaffekofsoxaaqekfosqffzqkusxpexkdeceosddkkdkdoxodsafsuauxasakapoxozcffexfeeeqfekkocqdsuxffsaupapepzfsfxdzdkefoaxzeoeedpzdsuouakefpudczkcquzcdsppakxppzezazexauckdaoodkxxfxooakqcofpxxepxkpcdqdzxpkduxcxduupxkuxkxxdfpakzdcuafqauuxoppzuuqpqassdxckfkusfefueqdeakppeacksokokxxupffkqspxzzpxzeckxokcdkafzpfqasukqdxqapzdxckoakueodzduszdosaueuousfaaqoeucucckdddapkuxkoecxsqasffcxqpssoucezakkddkuafkzufceqfxqsckkpqqepudaeaquszfxqkddsxoexfoeupzupxxexfskozxskspeuosszufeczpqccadszfksupukkdxpusdeuzxxapqqqdupzxkoouzeaqepofoeezxpokuaccoaeqskzfkzczqqdxxuofoxdxqufcxpxdukodkzpfffkdceofeokzfpssqodcqksoqfecxfcaezxezczxfccafksaafuzcepduoufsdxfcaofksfoxzzaecukoqefzpsaquzxfkcuopzakqdquddkaxqpeuueapczoscpzdudxpoxzdxcscpfcexkeuzxqoxeoooszopeqksuzsdxqespefesaeekxxzxqaaddusdpaskazfsokodxzopdeexxeefkzsqupzexfssfozkdfcxffqpqpoqsfqddzxdzcapoudcaaczdcfkdfpxxxfqucacpcqccpzecxfxdpuszqcfauuocddfasckxodaucccspapzoxudqeefcxupqceufosazdzqodpeaqddzpzdsquaezkpeqoeeqcxfxacsupuzuqszpfzcposuopdfuuxcesqoeadqfackdauuqcoxuqkcaefxsqoxdqqofqkzcxpxffudxuqckdkzzcfaseedxezsqcecoufospdxxfpuuoxeexuoxapsxcpkaaxdksfdapksadqduqxkucpkkqoduckozpepuaqakefozfzdzcqspxddpqsxafucszdpuqksfscsazqcspfazcfaoozuceazacqkzepfuekspzzpdqudqksofukussusqddpckpkofkaqcceufsskfacqaxqupqexcfdxuoazuaxkdooqaxszdokofxdduuosszedzxzfuadzaaqupzodesfescuqqdkokkauzuusqfecskpxpxpzzzedeeucaaecspooefsckfppoocufexccfzkszazdzuzeouxcoqocsedkfousozaodpsxsezuesafspqduouapqpedufazzeoasxeoqxqupdoxosdeadzkkdkzxukxouudeuqkfxcucdfcepcaxfdaekzoexcapezxzcezffkpqdsqdaxaoppkoafskfxdpzouezxqkzzacpokfzoqckzkdduxqazzszzsukqxafxxdaaxxfaucakdooqskffucfefadsaxfazkckkoepspsuczkopkfesokudscuuoepafcafpsdqqdeefpeceuoapsxppkpsspkxcqufukepauqxceckcqpaaooqxxppqqpdufodppdpffoqaecuazksozuqekaqfcoasczosxckexpuxaoaqeuodscfqcxodozoksopskkzkceuexkpcaxpxedoxkqupkpoksaoqcddkuouxuqxkszsddeskqupxqeexpcfpkqudpafcecesszfcukkaqsazefeuockfefszxdckksxafofdzkcfkcqpafpouddeaosskufkskzkfaepfoecekdcdzqsacscfaddpeopdooekzacapxozxqxfdkdfuadezdsdxzuazezudxpqedozoopfoaaokffsoceupeccecsakueeakdfkuexfzpdfsdqckduaqxfdofsquxqpeaucakpsfaefcdezqkxkpqdzukcqexxaucesxxzzpqxouaaacexffuzzspzdpodpzpexkpqxekzkxxdzuezfpdzkxzxexcskqasdeeqadksfdeuxdapfeexzqzfxdfpeqdkfoqfszzfaedodzsocqqakspfczuupfupzskqeqofauukqaeedzuufukuuaakksqzcdqkzpqzdxadszcppaqkudqxqecuzxdxkzufpfqszfsxeduffxeppqpusffoqcaapxcessueecscfzxcsacccxpzqupuadeozsquaakcqoaofzepsxeszxkfxqdoxxcededzfckudsoasksxsuakkfqscaaadqkpkpccspdeksdzdquqzsuuxxecxesadqfedcfdxqsakkdpsoqcsaepdazepfzsxfxxafkqqueezaaecsdcsoukkaqqcpqqcoseucoakxqdosuzeppcqaodxucedczepfofzqpaofdcdoqdpfcuqazukedasaxuupkkqfsxkpoodesquseosucesqoqscuefqzuxfaxpxuockqsxdfdeakpaspepppeuxqzeddcczfcodeexoqdcfkzkppsuxzxexexzxfpskdodzucfqouqxoeuaqsuoqqqoffqxcpucseuduuoaaoqcufkqkkkepppookuffkaoeedkuqqoqzuffzqdzpsfkcfpzqckfcopcquczkdzfeuaukzcaefaxfxdzpukacaacxozqekuedpsudkpadoxkoddkoedaxacxpudzusakkxxuacocooqqeazaoeudqkeacxfxfxzppfqxoqduqakexuxfqqxxefauusdcoxpefxxsqquzepxcpaksscqdpuokqpszuppuzcopksxkukokeoqppofsaoasekocsxozozxsadxdpkdpzsaezqfzqqdxkcfoopdeeouqfqfecacpefxoodsczscfesqdpcqqqoffqzoxupccofkqzqepqcxkszuckdffzkpzoszsqffdecssaufxokpkuupakaxuokqssdcuxpqkcxduesapfoxspzeekcqecppfzeupxkeuadueqaukppuczpoqqaedpdadqxoxofkksuxfsofkqepozfsduxccfczpzofkqoeofpkakukxckxcqpfpxeckduaukxuxxzqopfddxcpcszzsepzcaxuezakfouuqfqpaosxazoedokuoesuxxkxfdeaqfazzezkequffkzozxqfqezueoukaxfdaekuacoqxufoueqqezqezczqfuaaxqaddaoofqcquaacpuppxuefssxzcsukkxopcqpoqcepxcascqsuksdozuufqdukkpcqdcoefdsedosxpuuupkqzskofdakcuqquooocqeqoxxuauqkeoqpafkffxoxekaesxpudcqausfuakpzqxoskszszccesdxekcaqaxxfaoepkozuzeeqxxouzpopqqaufossfafqfoaokczassssufupqfpqzedakecoasaczdqkzxoqcfzqpaekpeafzdcpezoqskxdeasepfeepcskdpdkqepfczszeoqskpafcezexaequessfzefczxucxfkozxcpofoqkpzopdkxpddefapaokqquapuuocuqeokcauxqcscoefuopdsfkqacsppsofaccxqqadudspdazfpkozssekqadfcdffeuskcfpdcqodessxxcesxxzeaoaaukdpofqofpdupkoakoeecxoezpxsuxofkqsdfousqdauazxupupzesozsaqkacscdpdqeozxkdepeeoxqxxcqsfqkczepdeqfdsdsqsfcxsakqqxsxaqpzosqzxxpcqecspfcozkfcqfedsofcqzksdcsczpuxeoxkxssfxaosxaqpsfeaoxdzfaskfqozsakakuzxsxkpexcpuzuxcsoszepcqszdxaeozpzsdcqkcscaoqspsssxqzdozzfdkufukdaxqcfzkaexffqpsoqezskkusepeqeksskxefdadszsdapfzfzkaspfscxaxskuuucdqkdzkeaqkzuckepdcesszsupzpcsdfkkpxskazckpapeffacdkuzzpsqpukxzupadcessqkkakxpsfdcexkezsfqduefqacduzfxxdqpfcfuqscdofqopakzfkuxzosfxcpcsqpzxpqoezczfszqxaoeakqqcskfkfofdeqpcfauppezpkoespxqffdxauzczqcdkupkzapecucsxaoacpcaxpsuozsaduqpscpouxceqqpkfzkuekfcppoxxaaupcfupdseqqpzazpkqsfsxsdopkkpukoducexokasdcfsazzuxpqzouxaudauaefzzqukspzodcddkufcdeoxsscxdkozfsasskuesxxfkduzukpkcqokaffzxdakpqcckocacuscdauqxdzzpafqxakqqkqcszqcxdqqzapsexpkfcfakqpozpczpkazpcqaazkooaofddxzeqaacpaeuaakuaokzokpssodccqeodsdupfapefzxxkzoccpzpcxqueekcoqexsffeqeqzcoooofcduakaspxkpeecuzazcacuukoxefxcekooszupkokuxfxadxoapzoecqesdfxzooxpoqdzcxqxeuqadoxafckfxzucpuqxppfofsfdzcezdzqfxppoxczskuskxazafodeeuoxscfuxesxcckuskaaqkksscukcssuuezfpxppxexdppasafkcpxoeoopxuxqqasqcqkdokdxpuzaxsopdquoaooxscxqzdafxusuukpxaefszkkkepqzqaqkqxfokofzfaskosckffapqacqqsxddxofdzddoppeckdozpfaqdqeadpfuxksupdspzexspzefxuoexccpaqqeusskdopqdsxcukaxpzdkppaocuzaapqauoxoosdfdpaxzpppfzdxezuusexcuuzuoosafkffeazdfqoopeepoxfeaepccdcdpfzssdzxufkzeoaesaxakqxoeoaepooukxezsqdzpxpapqecsqcqeqeufsczeefpsdppddocfdqefksoxckfqufepfesqesqxsdcfqodqfdkxsccpqcukopffpcqqzecdqsxpkfkaxkekacpqdffxqdozpfkqxapfsqqxafzzepdposfpkpduquqoafosdzzopkoeaxpzfzpsdqxqdckeudqxqzfqfkcqpescakzofoxckqzookqxseodqczkpxzaauzaffcpsekozeuuuzazadfzddcaxpafskqkozxdfuqoaeadeofaxdxasazqpaefezsqsdppkddcuzdqfapoeopczfsfxxcukkzzapcduspaddfacpcxupkuaqdapdexecoucdpakxzzpkkoxqueckzdqkkppaekedudqukzodoukukxdedqxcecfkusxcuczaaskzpzzfcupepfefkokockuqkzuquzdkppxxcaxqapkzkkkaxccfufpoqopdcxcaqadssfzqqekzfqezoukdxafzzucscceascqcoepspazseeuukduppkxopoqkcodskdcckqszzuoasoquazasszaxqduzzqczkxxsceuaxfzcudsppzkqkodfsxdqdzqkuzpepafpeoqceqefqkeuofpqoadqdzxsffdqcoudqzqkcaoxcdooozudoczqqszqxcuuqfscpcsdaassafzkqkkpzuxocuzedoxffdszqeczpkeueufacxzfdddqsxzudzzkkcdpedaskkssfufzsqdcxuxakfqaakkcsuaosaacuaaqkpauqqzsaucxxkdsqpuxoakspcckcuuuokscxeezzcecpdqqkeqeqdazkecdeokkaxfaqcxaaxqdaappfozqaouzqxueqsudcukoupcefokaqfdapakxsfkspspdozfcuzpdkzkakeqkuzkokzdkskqsaepddusqzspcpoooafeddxkokfxkspsdeqxqfxkadcsxxfsaazoeaxsqakkcuxqxqusfzaxzddqqakqoaezkqkzspkzcxozpadcqcaepzeeqkupaposeqakkpzxkzkqpdeudeazxppddxxapkauaepxdqccuszppopfdexodqcqqfckppspsquqauksddddueexsoaqpdzscfauozozuodoqxexkcoudzsdeeffsxxfqedxxccqkdeqpapkuksdpuazzkxfxcspdczsqqaoefzuuoadpseckeuezdeodfxzfoxpcokoxuuaaesezsocppeeepofododxusqoaakdqcuodoufkfzofzapqfaaucesxxkazqddaqqxufkaposdouaouuqckdsqzsfacaazcacdzoceessxkcpocsafcxxodkcdkafkpdpduudcofxxdfxfzfxksdexdeckpxpodxdzecquupkkeqpoeuzaxzskfsffskodapkecqxockaeexoefzqxkqfquqzzxkpquoxeapozeopuzqaxzudcdqepxpdkkupocesdzopdqxuzdfckozzzpefqsxpsqufszfsozxezkeffzaedfxpfafsxeudppkapxskfzqckozakaqqecqauspfoddsszsodffsfasckxexscaesddsseuoqqcdfkuqzzppcozdddexpdaoeouzsuefpzkczsaqcxkudacsoxdfuoxuudpfxdasdpekskxxezscfoxdeeuafqxuqeouoeaxezpqoccpafzaxxkokczxqxkseqqauzkodkdcdakcczscqfxqepupappuoexokxzapkaeooousuueeeqsdsxzxspxfocdkaczzkdesakxcuuqpafkuozdkcfckqzopakudopoufcequkfczseaecqkkqxcfpkfzzxuoqaazkdcqaqkdcakfckkxospfsspxdzkaopexdqxsqfuozpuxxcfoeddfoxkfcpdaeqdskdzesdefeockczfckduedzduzxsckfepqecaesqkdfaukccupkzxkfzkcfxpaezsoeqqkcpxczuekeqxezzsczfqsfzapzcoosucfkfxfzdcafzdpddeaaokkduepefkpkceukcsdfcqffqfeueefqxqqqdpoedoofufeffuokpafkzqkcqfsqapzzaeuxspkudefdcduaffaokoosszcxdsdascfozoekqdducuucoxcdffcxcucsezdscdszszecscfxkfecsdcpxcfuzfeufqpespppueeapexzcxeaoquffdeokskkpfdxxoaqepqedkpuazdzofpdussxcuuxedodeksqcxxekqakxfcuaqfxxaecfdpkefudxufqzeeuoofpfdooausdqpzezkdxqdfpfckpzefuadokeqfqkakqxokakxozdzpkfkqdezscudepxqkapozzoxpcsxfkupauspxkkfczkaaxocpzqdofqqzcppodooooecoqxeceaefsxqkzxdsksaxupcxqcexqfufuxzqxpkukddoucddzaouqfakexsuxopuapxfzcdfxcuaxodzpsouzpqseasaxesxffeuzpoqekazascczxzafedzufckckasedzsceakeucfdkfdcscxokkqfkcqkasekozpuskqopzofzpxsaxfaesqecaxeadfdocspszucozacpxkadqsakupfxqeeodcozuufskxzasqzkoepacdfcozpczaquqeqczfecxkeoeqsspkesafpudqauueduskaqfxcqxkksxpzexddqzezcfdkxedekofxxuxkqoqsxekkesfpxauuufsufookeuccapcxzaxcpaqzkfaeqfssqqdszekuxdzkxqpsdpkpcxqckfszpzcqxsdscafpkucdscksspzsfqufpdukuceuqqdpcadxfxpeeeucdudxccsfffpudksckedcduqxedakadspsaxczfeddcxxpxueccucszdodsaupeezffckpzcqdczopukdadedqzoqskdzeekuapeefufzppaxuxckdcfxzkaoopucfoeuxffezqxxqsouuksksxckaccuouqocdkafpqkxoupuxzuezzkcozcooxofaqqxekxfoudoasufkoskxooeeaeoezxucesqpaqckpsoeopsuasafuuocdeapkozasezdzzxdfkzkosqkzkfsfczusoqqpfudqezoeecdkeeadkcpsxeqefqkpfpuqkqpccqfkuacsoeauqfdzodcapufsodzqxddzsxazuafoxfodooaoeukosffuqqcezssazcdossckkukxxscdkkzqoeeqdpkscpscuadkqsspcqaxeckpaqcaoofccquxoquoaaazddxzksckzaspffsqoukxdsusaaqpxozfuxdxzpoxskcpeefdcdpxkdcfapxfqupzeqeafokcoaqpqcpsfqxduszpuofzsfkscooaoaquuaaoskkqdqszefqxqosxoffzfkffakqxcaqzqcpueeqcokqoukqxaeofcakdasaduzspukqfsucaeppxsczoeqozxeqdkqfefsaokdcuczcfdqsqfooucoopxcokfqafpezfcxozqdffzcfkefkozaudfkoscfdkxaaqqpfzsuudquqkpaxqopoeszaadoouuefazozoapozcpezccxazfqxdxzqduzeeodkqpsquqeodfsedxfxkzcqueuqooedekcsdpoaufcfzqzuqacfcxxkxeoocakseqfaesdzfxzosffpeofsossfdzpqfuappqskpfqocqqfudukkxkuukspxaazuzdxqfkdexufcfdzaozdauecxksfxdededaszspeckdcozsksoqkdxqxukpopxofqueaoozfqzxpxceeufeaepapzqxqpseecxaasdfaacedzooaeosokadueuspeeoofzfcxucsaukuqapszzkapukpodpuqpudcoffexuzopofxzsdeeekfqzdqqxpaxxaszkoeoufdpddeuqfsusseqedcdsckpzpxszsdkffxaooczazokekzpcqxapacseoxkskopxzaudkpsqcodsaaafcfxauexkpkuozofsqzkefuaapuaukdfqkequaafucefepaqqkkaoczxouuouosuqpucquzsoqeasaaaqppuuzqpuqpxzusqxouseukqfkeczqsseoafassczossxdcckdkuudfcasoxaasqcdqqscxacczxaxpzafsskzefseaqeuaddqkckfqkqqokqzqqdquudefopecpapauuazqseudedocuqaukcaazuaucezdekqdcxuxpppkqkxfezfqefdqpqzcaxsooquxeddexuqzcoaaskeueexkezecfasukcazkuusffakpfoxsofeuxspezkfdopueoudpsdkszeeuepozskskcquzfcxaoudaesxqxdeducspzcssqkfkdzcpuffukaefkepxqasdscxakueexkqqpfdfssdcqfdzfkkexquusqdefzxpecszcddfozfqpfafoppfoafsxdsxsdpcexefssudouqpuffpfqoxpcaqpkaucpfsqcccaossfcsfcakqkkzokcxsdodsoeqpdqooaduuuooozfkceqafeuqsucesdqdfufedoqcouxdeoqocpaeskdzqqdezsscfxkaeccsofaffccaudcxuuffesxpeocxpcpkpfoqxkpqqszfedeeoafffzdzoqeouuaafdpqpesocuxxzdxdqkqsuaqskzfqdapqdkdkpasxepdscocopoexzdcxsozkzzxuafszexofcfexpuquopoecqedzsdcxzuqppuoxkqzzppuuxdukadfeukuczpsqkqackefkaeazcazscaqpsxpxadeuscsookfxxopxcpzkqzzssexscxxusakfafudqakdefzupsxsxkqeuadkpfsedqkxfacdsaqcqudczpzopadsuqceouozzzskufkzeuuudoeeksqqzepxxokzpsfdqqzxcdedqxfqqozodkzeuoafouseodeofdsaxacsuosffqxodcsokqezsxqdcpkpcffxkxsueddkzfpakzfefpuupsscpzaukpcxosfokpskaeuccscsxccpzdcqodcxzfkkcassoxapfefzqxkxepffsocfsefufaqkkpdcfeaezczoackooacxfqdxppkecpcfkoffkqkxesfqsuoazzseoxzqkeoqaoqdfqusuxdozpsopzqxuecqezkssasokdpxcqaqzazkeeksdspkpscesdokxdqfefzuuqczxafafefzkeosucaasofdzdxqfuexuaosuapscezxoaesodcszeqszdduqppduszuczcpkodksffocaszkpfzkeofuuakooqksqzxaoxdsskkfqqeosuxfcfsxcsafcouuauuxdsaezoedzxsqqoexxapdzexfoecsqoqefpedodfqkaodafupspcxffuefuocduzkpxpccekqfcdsuzsoqcxzspfokqqoakdequcxkxukqxfxxzskoxczpqeqkcdkqseopexsdoqpxoxdkuodqccozzeskcaqxuspuezxapzxfopcxkfexsaukssdacepcsuspudazeoexdzuqucadofapauzuxxuqsxsezfsdedsackxoocsksuodauxauuksskzopqafafscfpcsfofpuuqexfpqeokduacpassukfzacakxeeakdfeuouxodqoedpqfuofzzsskzqsskzzqakcqddueoqafzouqzqqzsxqzdpcpqscofkccdouxzcqcdedqpxsfdddkkafxqzdzkfdkfqpexxqaxecsofacdxfokfefffeaqakdsfpecxquckzcocseuesdxfdkkqzcupeopcseddkaufcfoooufqesefpukdxpskuqoufpzzdzxssupafzuoepuepkdpzazxpfzzfcuqkuaaoaaozqodoqsppdzakfdzdoxzokuaoopzcfqddozkdqkfapozkuzqcqopoaofqxzufscakdxqdzdkooapodkcspekokopukofqceuxqedqacazkzfzexocekfkseaexcdqkxqxaudxcqpfkdxeocxfaukpdukdaskdsqspaoqedskxcqfoeszsqaxckpzaqakukqcouzdxoekskqadodxkzkxufokxfqefxdoafeoozouzzdazqaoffdesdkcoqcfozafukkeccffdxscacacxezocxzcpddoadooaudpzqasafpxequpqquqopqkapdeuqsdsskeckqukpdaxusfsppsxpoucaupkaaqdkpsuqazkxscqxfeezsapxosqecdpqasdpaapaduqekqkddepuqxcacazpfxopccducsezpkqzzkdkskaqczuuuuocpqxaducszzfzufkzfzqkaczsscduaxdackpfdpoekqckqfokueoepkedppxeseqduzsqscfekcfofexqcocsxqoqfzauxefdaapzzxpescfpfcqzsxsusakoasofdqfofaexofpooqpaauoaaxffzozdezcapquadofzakeuczapeuxsezkdakpxkdspazssqqofapsdqsfexxdefpdedzddaxxdcqqqzuqeuaecozduxkcqaczsfpufuxxzcedqqsacfpddpxqcdpcquczzkffascekxouckkzouzsdzfscccsxakxssufeofkqkekxxackokquxuzcqueaekacpsdeppsoesszoosuopuxazpeezoqxxoxpfuzzxzksdofkpaeeeoexousozcceofaqoceopfdaescqufxodkexsekqkoeqpsfzdkeosdqocfexsecufofdcsapcqosfeeodscqxsfxupoczkezfkokqdadpkupuooxxcuffdfcauoskdzqpxcxcoasqouskacuueqseeecedqeuzqqpkazfoesekuofdfucpapuuxzexfopxuezefuezdppdxkscszxozspfpsxeekoukcksczosspcsecuecoudaszqazoekfxffkackkxfpuqkxodskpfedocodsuszxekaxkaxzfokssxzzfxfksxkkaxcaccxxfoqzudxkpaoxxsuadekxpxpksakxdkaozxccqdufufzdzckossokucxzzqcpofpeofuezpfxocdoxsexqzxqaeksazseqdexoqpsecsdxfxdfapqzqpozqocfxexszekaeaaufspczexoxcaxxeeucupssqeaapzzxcqfqeasppsqpzdckkcokffoscoeqczkasfcousopkopxzduqzcafzpckofpcpuxkfkcoqkpxocpoczpuszdxapapxzkezdopexxxkpcofscdcaaszxzcfoczseuspdxxxuoocazsfzqfxaoaakxcaookqxpexauscockuoedcooxofodxoazaosozpoasksoafspcdfsusucpdxkxpuxcqapcsedkxocuqukoofxcuzfakkfocfsdcefpqdqdqdcpoffqdsxspaupdkkpapqxouzpdeqpkdpxxapszfqqxkakzceasdxxoadckxuqdzquzdqausqfxcpqaadudpuxeuxpuofezczuzpxukqopsoespzqcupuxdecxpcxxuuxefdcupufcfzkpccoaszcqzkcxkouuuckozdcfdczffckqffapczkoxcopeakdkuofzxoecpkxxkkpeakaaxuqppddxeazaxcdoqqapddpzoqzxdxpxkffufqxacsxszzzsdqqkuekxaopdssooqfdzpudzeezodsfqoxuseqsacpauqeaqzpcxfcefcpfxcfuauxusxaxqsedskeckddzacufeaqqeacupkxfcdqkxofkpuoecfpxkqqcscsopeqkuzpkqaxfszxzadduusasxxzxfepdfascecdaefepxqdffxsuezkdpfxzaufefkfakzuskfseasqeeeuscfcakkuaxadaapoooxqxcaoaeoxzdassxdzpfckoscafsqkqxufskuxqeksqkqcszzpzupeudckcqckxkodzefoxqasazqfzcxcxaexaoozuuzocpfsdzukczffusuxaeqozqoeuddquaeasucfszzkaxofsoaqqeeqxcxcsxqqkkpdpzqxckodsceucffoxkzfcakseqxuqpofxqsuzcoofoqefudsdpxkfuzkxzcxfpsaqsucesfzqksueeucqzqqkuqduqqdxsazxupukuzoscxszodczaofoqqckuzpusazqoosudsqpufsxfccuupcfkdpxxdffqskoafsqkpcdfazofkzkskzdaazxfxoxdfkqfcsepdeffcooadudxxfsodqzzdkqezsspfdxfpcspsfakxsueqcxcxooskfcfafceuzzdzqdpqdfdkxsudzuekszqazcfxuuozkxdxsqdkpeopuqapudcfsadcaaapskqdxxezxaszekupcfudcdqudzkucxoduzfzzcsfzqqadueakfpszdosdpaeecedazcxaxfaqufupfucqzkaezkocaoaqqcsoffoooxdsduuzpaacaqdsqdoqokxcezpdsucfxpuopazesskuuesufqekdapeaxdzpzkefoeekfqzfqdzqqpqkpffcekfqkdcexzfxaodqdcauxqsszafxuzkcauzeqkuxpcuckupzzpapufapekpkdxokuoaacpkxxacxaokscxoexfsesfpckocaxpzxfuudspdsfafffppzxuqzdsaucxufeuuxcqaooxookodakfcaszuszdskqecqspppeseoakdzkuccfkkeqafacekozpxkquzxxxzesfpoassdapcxqaffzpksqczuepkqddcokffxqqqexpxfdsccxxoffkeafspqsdxukeeuzzsodcppuckpzqaukaafuadpauzupuqppuzaxoaapkuazxfpqooaueadqsxsfzqakokxdzdffdxqqkxofupfckasccdpfpdfqzdqapxcocqzzcxzfoaqkczcpzazpczdeqofefpfkupokecksdppasqddfepsxsfopkpoauzfpqpqcuuocoakecsfqqepzxaczxuxdoqfxzofkxpzdkuaazsfeczcfcsscxkaescezcxosssqpfscuaqpxdxddcuakdaozuckpqoosqkaqfucfdxuqefxfqpoupedsusezkpfzfdaqkczdsfsoxdpfoesascedoeqxasueszkfqqqsaoesxufxkpofpozpckqfqkfqcxqaaezofdfexccudzszfcxouxzaxaupqdofoxoaaezopqkapsuefeksockcpsoazkxeppfaceazeokszcpxaekpefepqexkcadksffuexsqfpaszqudozsdqkpeecoscozsoqcqqszzxfzouezsduaaqopukfdckksooozfqszsuoxfpsdfeccfsdopqzuafxkkcffeedaoqdeeozeappzcqxzeqzfkpfpsskzkqedqdxaaczccukezusxaosqffkoaxdodazoxeazqcxfxooduqosoodokpzoukfkupdxzdpkppaaqkxuezszqxqoafoqxuczopskszuozcqasqczpcaeqpcscscoqefapuaxcoouskqqdfppuooquesspucpxdoskedcfakkfkudeddsdfexfpexpsaqxspduscqsuuspesexcupczkpospcoxfexefuzqeskxqzzzuoqapcaxucupdsduxccukpczefdqkupospuxxcoszxakzuezfzkxddzzfafekfaazesdzxppazuukspzdqxkxkesxfqoupaefeodfpscozccczzqqpdoaakoxpdkdqsxpkceudazoaadkusedzpaapuskooufzkqfskccscczkcsepopacxksuadpqeeqxcuuoxaasfopxqokexuuuouduufouuocfsucffeszfdzuqppqsapqqcksopfzesxfxaekfqxffqfpupkupdzxqopfusqfcdcuasfsxexkzsaozusxququszukqxdkzcuzzxpazdakeqapqqaksqeocfsxucekszzqzsxdczafxkfkkuqcoadxqsckukussokzkxqacxpozzeofukdszupadkqckeazqkeufpfuauuxxefazpessedeudsecedsoxddfeosepkoxecsdfxquzcdxuesazkzuqosksosocepcodpefafpfppskepcsfpsusukeskdxfakfqqzsfsfkcszusapkqceeukfxaqeacddqfffafzdezfxxxsopczqkoqzcazoofxzdzeqkcoxsqduccsuooqafepuaxeaszeudkksezkaoxdpxazdcfaupqkesedefzzpouxfcdxepeqpzooaesdczackszscappkeoaeaeaqpcfexdpoxqckzufuosseeuoekoqeffcexfxcqouupcduzaqpxzxqxdfkaffeeecodpuaocqqfkaffopduafudzpzfqcpzsqpueqzpoqxozapopodpkfxxzzsdzfcsafxefuxksakqzcaocuzdcfdeazxsokkafqocqouzpxcfspefkoacfzapzapseczefxqqdkddfquxadeqcaocueopuoduuexskfpdcqkezapzczcauekqqdkquscaksskzpqdeauksdcxoqzxfuosqcpexaqoaqzpszkzozxzasfezkezuueqoouakcdafapkpozoouezoscxaxzasqxxuopzzaocufassfsoxapcoccazdzdkcaesokoocsqqduqeeoqcfcusouqdsaskkpokfdoadzpeuszxccuudcuxpzpzxcddadzefzdfxcuuzkuqsdozpkfszapzcepkcadpzdzxseezkzfapfzcpazzzzccudodqqpskqpsfqapaeepakoauzxauukfzdafxcppffkoxekeupsaodxfxqkcafeuszzzuffcpefdpoedduskxpuqeeufdpepopoppzfxfqoddpzkcqckodoufoaxxuzukueeapdukpdcocffxpcqakaufoskkxquauqdceafekazdsxpposqekpesueopfzxxfkfszeqexepqzcxaqpqzaepezkzdceeopuxqouaokzkcfcacfqsxadkpxecfqokdaceazpxpkaxucpzkpsdxuozpkzqpzfspxpcseqdcccdoudooppczefcsxfceaaofqzodfazddckpqxceppezxdeeksxaczsqfsauaoedexdezuuqsaaqqcqooffdkesaqkzxsofxxxdxkxzqfocxuoazazppcuqeqfxaoqakpzzduqueuzapuxkfcssexqcoxpqdsazokpzcokpcfxceuakexkcdxpdzuzaqdupcakkzazfufxaadeqfxpcaxzzaupkuzocudkpqaefxzkaszcpfazppaadqafxqccoafuedoafpqeuxukdoouupqfkpspfqqkpacxxesxoqepkpskzkdzqkqzzauszoxqzufpaqxuqsfacduoesuzskqpsxkfzeqxequueupqdxaqocsfexoaqfccfaxzzoufzceocepczodszpaexzzspxdexcqdoxeufpqpxofpdzpqxquaafcfcpoapxpokdkdfxedafpqqufpockzsokeoooxdfooaekdxfqxszckacxfdzuzkefzuzsecqazpqofaofeuzuasffkeesczeekcuexpeppsoeosxkookpaqpcdxspzokxpzsaqufazoofokcefozpssfouaccacqaookzdsuxkuezspukqauaoacedepdsskxefdxzfofuazxaxusuoqefsauaozzesexkcxquddxexozcfezsxqqkupxxfqsuffafaodqkdeeddufpfzppxpedodcfsofqzecdfcaecqsuosaecaokzxqaccsdfezzffasqeqquduuckoezspzxakosceezpfpasdzpoodqokezkkppkqpsxseszozfzckxqfcpefecpfeqzqczocpkoodfzpzfkqqpqksxxesefsqskkxaupspzpfozzspecfqkdsuekuxkafeuadouakxxcekoksdzocefcfscsouekqffzcooouzqekdsfcxqupokzfxupppqzdfokaeseodopsacfcxxxakdoccqxaooxkzuukoospefcepkzoxscakcecxqsxacafcxxxaopsudposfpsazkpouzcsxpkccodpzefxokcosxksdxcqkfuzxesoakokqkfzpzpaddcupuxdopafdduofffpckxcdkfceqqcfuxkcaqkdaaeepqzxcacffdxqexefokackfquocusuxqcqoaquufukkszxkxezpzqfupecpfekuepazpcfkuzdfqfuusdoppdkokxakzxazspouuuoqupsdkosfqzcxefspcpspouoaqaakeddoopfcqquffqfqxxzpcdcdsdoesfpseaaxaxdpauccfefxzuokaauffaokxkdffefdpukuksxoespoosscufezfedekdoeasskqfxzxoozecazoxfpsxzfckappudezqzkxaxxxcoexafcpepuzekdokkosoekokfdedkedopqasxpqafccqkeedppfooczodoxdcadxcpfdqdexzkkcfxzpqaofceqpaecxzuskaeduucdfqucudkofozukqsfkopockfoasecxsqezdkxsppkeopcdoooaxaqfqasxpqseposesdqusoapkfopookeepcspqazuceseucoaseffxocxeekozfaedducdfdceopfxozouqzcpakoeeozkdekzkxekxcoeszpukdosedxadofdpozekkqecdqexddeedpufdapxkkdepxpcfuxkckqfefxfkeeopzodscqoqukkxekspuuaeofaadusaafkckkokqfxxofcfedausxkpcsxdkxxqceceefuxospcffuazqpoqucaddausapceazxkxcpdskxxakupsdcufccsqzkfxcxpaeofupexaaqdzxaccxoxkcqqpukcddzaduzucaffkaocuaeddzzuzeoffcfpoxcdfxxkapuazfoouzpfscupakfaxzsppesdkokeoeczoodsqkpfadcqqzkqkdppxqzkkacaoaafxzpdokucpkpaoaaxaedpeqouzozsuxzoezeqecszkqpppdxoaexxcezdxxkuueeexqoukccsacxdfudpppupsxzzfeuaosqsefexssfdcasxqzepokpfospxpcoaufqeoskfdsxdsapoedzxzskecpqsczqeqqupkeoacefpuppzakxusqukacesdoxkdafxdaukkecfkfqasaeuaeuekquqeqaqadeocooaeuuxudccquxqxoufzdkcfeoocescaxpfcqascssuckpfcqcfpekzxxxpapuszqxukfsekzqduezcoeqsxuxaepfqspfcpoqskzdxpxzzeuekxqfpecspzzsaqqfqaxeeeufxfoococpqofkppqeoooouzqeeqdazkszxdupfsfcoqxfuqopdxfcefecuzsszpsoeffpxzeadduaoxaappzfazfopaaeqxoxfozfpqskcpcxfsduceuqukpfsqksfocpsuuxfuqaedzpccoqcuppuuzcxoqxxcsdaqxcceaappfesqdppxfpsduoppsxepsaxkdecadakkdqcaqfcpusppzkpcoqzqxsspqkdzaxcufdeaosuxakefdcekafsckacosqpsaksqouucxaxoxpuzsxpazzoafzfqqfsxsoopakkssqckksaoazeauqzpooosdkcxeudoxzoczcakfduqespzfzzuukffsokecudsducodceqxzaczoudacdspaqdxdepuaxafuzksszfpuxzapppdcddkafoduzodqsdkafkoqfapxdppfxxuzaqcdckddqxupfaqsdkskuffkfsuosezzoaxpuocfdpupoqceospfazpufkupsxadccufdxoexqekseqfcsqokpdpoqdaqpxcqquuxdoxcsazepxaqpekfcuekxccdzczxxzkfuukqffxefepkeecsqufqffqspfpfedqqqfuszdooxpkpsxdqpaksfupqkqaqpapsqpkzopuquzodusfxofqeauaexkzadaaskodepzcfceccsuzkepcuxsosdadddzqaqksdpcqszfecccfdqdekupsaxofepzcfapexecdcoqeocusqefxcpkexdqaeozsoppfddfzxpaacecoaaaokufqsekausppefuddffkapqukszpzxzkuqpcxzcfudpcpezakeueuaaxoqaseexkeeoppdaesxdzecuxzkqsxaaafxefxeesspaueuexssofxokkaopoueoesfcozdqddduuxsppqczxfucoezfzfpeeuepqxfuxszzauqepfuuppqookefdzqpaqoakzzuafkxdqqkceukkudkpopkeoffkkakaxaasqfpsaazquakaapdxzcefdfxsqeqpzxsofdqofqqakepqzozcappoqdqqdokzucfadoeasfocsuucskacaaksqsscouazcepxkkkoxoczxxpaquuaceafczououoasfxpxdcxfxopzqkfodefaueudaddzzeakfkqfdxfopcofuqsqspsccoseffzsesxxqzofcqedkzkeaosscksuduxopaeuxukexzduqdzfdakuocapxxsppseokeucuxzqpafdsqkuuasueoduzsuad\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 437,
        "task_id": 4108,
        "test_case_id": 18,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "wdxonnkoddoxxgkngxkgnxguoghwhhuwggwooxuwnhhdoxwghxwuddghhdugkkxkohudxgndxnxddnwhhunxgdkohndnhwhgdkdudhnwnuhnoudgoddhnwgonngxkokogxounwnhhgwhdnuwhgdgggdnnondkgnhoonkkguggwdnnkokgooxnondwogxkxdgwhuxnnkxgnkkhgdgdndudgkhkhhdkoougdndogughgghowgwhxhdhhohdhngkduhxgxnuwhguoxwgxxdgxwwgggggnundgwoukhhwnuhxuuuoxwuwhddudowhngkkwhunhgdguduuwggwngkhxoghkdgknudhhngdkhnnxwnduxhxguxhhhdgwuxdgkuhonohggokkdgxhnoohnkxgdhkdoggwxxhnudguoddngoxukhxgxunnkhoxxgggwxkgxkwgddondxdhkngxuxdunggdxhnxwwgwwgkkxhuowkkkgwkngxxwkkkugxduxxgkgxxnhoduxundokhoxxoggxodkwgngnhuhdguougnwgwkoouxxdgddnxwuunghxhxndkukkkoduondwdnnwnhwxxgkognnxduknougwwguwxndudohohdwkxxgwguddddkxgkxkkwkhuoxkxkoxooghwhguuhxxnwoogwuknkkuhuuwwxoduwukxhdxkwdxwohokngngnddkdhgnwkgwddduhdnuxxnxghxuuuookdnukdnxoxhgggokhguhgwxdunguwngkknwnhohugoxgogghwudwwxxdgnguwxgonudxngowhggwkdugwdxwwwxxhnodgdgwghwxxknudnwgouuhggghnokohhxohwwgkgnughnnkoonhgkwwkhgugooxdnnknokgdnnhgwghhwowdwudxuwogdugogwwhwwwoghhoxkonngododkunkwkxohwkhkwkwuokoxdgnhnnunuuwnudohkgwowdgdhwhxdhhdhxohkkxnuxnwhgonuondxwknxdowwkxgkgguonguowxunwhkwwdguoxhoohgugkdhduodwkudononukwnnuuhhkxokhwoukwhhhguxgohwgxxoxkkngdwwouwgohgnouhhkwxwuokkknoowwgkkgodguhudoohhhdonnduxgdwkogdhxgunxnkwhxnxodndoxwdxkduuwoukggghxxowdggxhnnhkokgndkuoukhghkuowukkkhnuhdhkggknudxnhhxwwuowogxddhdnkduudnwhohxgxkkhnnwgudoudhnogwuddxdnwghkhnddoxggxwdhgxgnhuongwxhhxdhhwdxkuuukdhdohxhhuooddwgnwkwdndkoxuuknnhxxxhnkwhhooudggnkdnuduouxgnuohdndkwndknukkgonguhuduxoddkhxughwnggkuxknxuwodghgngonwhnonhwhudwknwwwogguwkngwkgwhwxgowhnukwkhnhodwuxowkhoxxwnkknoghhnogggukgoukddonxhdhudogxgwwondnoxhkggukwowwuxdxwnughkhkggwdoouhuwnxkknkxnhwwoxknwnnduwknwnkkkwugoowgnxhwgogguwxggwunkwndxkdowkuxwxwkgoxwunndxugudnkdwwuhnugkgddohwuoogwxownunkhookwwwkhwudkxwknxonngkgonxnxwkkhnuxwokkdhxdgwxnxwukhxugwhngwunwuhghnhuxkdghwwgondwwodogdkxhxxghwkohougkxwwwnnkkdkundoxxdgkgdkkhunxhoxwuxnhwoxkouhgkdwxnxgnxgxgwnxwgnxokokxkxxhuhhkhuwdkouoodggkwxwgghhguuwwwdokxuknxgdnnxggokddwuhoogkdgngokwxkwdkhdnuuugnohxnwuwuhkonwndxhnhwuxuknkkgnnwokxwwxxhdnoghdhuggkxhgunknudxukkwuuxxudnkwwgnxwwghunkxkdkukxhdouudowhhdkonuwhudxkxxuouwwhndgundokkdugdgdonkknwhdwnodgokonhhwdxunuxowxkdgkkxwwungognuuxhonhgghugnkndkhguuoounwudghokgwundhhghhhdhodnkokkhndnnnwxghwdkukdguhodwkudgkxugkhduohkwdhuhhownxkuoodnkuhhgowdkhxkxgnknwwnwhdnwkduoognwooukgxnuddnuukhgodxxduonuukkhdudnwxduxwguxuugnhunnhhwuhxnhoodwxhwkxxugkndonwgwogxuhwdnndgonwwwgnnwhxogkguxxngoukukgouwhdwdxnngdhwxwdwungwnwxxhowxwkgkgoxguxduwnuknxuhxkuxkwxwgnnkxwnogdhukwkuodkhowwghdgooodnughoonohnukhxxudgnkgnokkdknoxdxuhnuxhwukdudgxukkoxnkwwgkgnhhnukounnodnowokngngoddowunwduhkxhwxkukxxwnxdhkodxuknuhxonkwxgkdwgxhndxguunkhgguuunuggddduhgohukdnwdkgdnggddgoukgkwgonxgxuwoxknndwoxhugnunohnkudwghhwuowngouuogwukxndhdxwhxkodwxknnunwonhgghuwoghgxdwhwkxdhkukxgogxudgxkuondgududondgnkgoxughhouuwokdduwgguuhxwkdhgowhnhdwhohowhkdwnogdwndokdkndononhoxuhuwwdwdkxoknogodnxokwkukondxnowhuugknxxgnwnxxkhhxuxxgkknkuxukduhuhxkndxwgwxknowkuxdxukwhhkuhxgohuohkhdkxnkdouwdkkdddnkkhxowhuowxxnudkuokoouhkwghnuoxwxxxdwdouxwxkdxwnddgunghhhgxokwkkxxwkuoxokxgkoxxxuhdkdgkonxxwwwwwukuwxdgnwgxoughwggxggxoghgondnnddoxxguhuwddkwhgxxknxhhxwxhnodwxukokuwookonnndhwkwogdxnokxwodnngokwxggunouhgkdhnhugwoouuwhddnhguoxgguunhxwowxwuhwnghhdhxhnnwdhoddxnhxgwgokgooouxudkxkgkwkghoxogkuddnwxkgogdwxnhhounkkhuxugundundkohkdoouwnudxwonguwhhwdhuuxddkgkwnhnkndgwkdohuonwwuuwxuognwonwnnwhwkudhgkxkgkkdokwdokwwuhxknwuwnounnonuduxgwnownwnnunkdnxxdounwundkgxogwhhwougounngkhhdxkudwnonoxwxxdwhkugwhgxdokxkhhnnuxhkdnhxxknwkuddnugwnuhxkwuukhwxxuwhouongwnuhgkdwowwgdhnouodkhxoukoxwonknxkhwnuknkddkkhkdkkwhxhkdnhkdndwnwgogwdgwuxxognxoxwxdhnhndhwhwuhoudwukukdkudoxwgdkhxooohhoohondxodwogonuukndxunuwxggnwxogwhgxwwnkdgduuhokogogdxuhgoonxugodwkhghgddxkhwunuhwhwkgdnhhgnhhkgdgnkwdngxoxxouudnoxdwunxooxgxoguhxgouuxwgnxoknwdgdxxkwkogwoxwwkkuhxndoxowhgdnxkhwuxxdgdggwxgoowggwxknhoukgxxuookounnnwodwgwogdogghddhwudnxukwuhuxuxnwhwkkhhdgdohhnxngngxgnkudowxkunhuugxdkownnnwkwdwdxnkugkxxhkgkgwnxohxdnkgonuownwhxuddhhnnduwhwookdhkwhuownuohxdowxdwkxokoxkxgkxhhduxdhoognkwwkhhuownkxuhdhhookkdnggwwduxnkkgowxnwgwgkhxndhwhxowhxgouhhwukuddggkdouongngxoxxuunhgwgdnddwogxuonnudnxguhuodnouokohxxwdwunukounhkxoohgonhgunuhxwudgnonwonwnghxukgodxnkhxoouhououxuuwowkodwkxghoohugoduoxkdoohwungkxudxdxoknxhhnkwwugxoknuuonxwkguuwxhhhxnnuwgogonkndxuxdwkugxkohohdogukxoxonuxkuwgguduxddnkkukkkhddxhgdwgodnokuxnouuududuhokdhxwknwxnhuogogngwnwdxounknwgwowngogoknkxoughxwnkwokhggxkddukgowhwhohgoddxdgnggwokwwkxgwngkwghuxhkhguoonnddguuhhnkgkdwkonxhwgwounkkhhuoguuxwuxhhxuunhungnnugwxwgwnwgkxnnnuwwwohknhhxddkhwkknoddkngdugxuxnwhoudounohggwkxghkwhnwgnxuoohowhggnodhokwoowndghodwxohwdhwnxddokdodkunonuxngoguwuxkdohwxkkuwwdhuuuhhgkwhoghwdddhxgoggodxxgkdxguxnnhxhgdnkknwhkduwgnwuogwuognhnnkkhhhgngohxnooghohnkkkdughkunxkwwkgwxkgwxudugnuggxwuundhokdhgokwokhwngwngunxddkhkokgdkdwowghxkunwwgkuuguhwuxgnkgohoxuwwhowooxgnghnnuounuggukhnhxudxgnwnuhkkuxhwgxnkddwhhuondhkouuodxnognkknnhxddhxhuoguxkdwdkwgdhhxnwnhddnnnxohuwxgghuxkdukknkxhwukxkduxxhuxuknhwwwoouwxxhohwgdugoghhnungugdxwdukgdnougoudhkhnddugxnodgwggdkgddnxuwoddkkkdhodduhhduhkwdhxudnnwhkxnngoxunuoxkuwkxgnkkknkxdwnkwdwkdwdugknxnxndwkdxxnknhwodkuhohnknokdowuoxdxxxkguxunddoddhhudgxnuhgwxnwukddddwngnuggxdddwooodwhxkwwugnouwxhwgwowxdgxhhxxdoxngoonxodxukxxhnhghkoghndxghknxoxuuudhxgxoxnoudnxunxggddwonhuuokghxkuuowkkwnknnuoddkuxnnuxgkhhuuondguukwkhownddggoduxwkhxgxxdogonguuknhoxhngwgghohgdododnkdhhxggxdghugdkxkhxxhknuxxggnwwkwwxogddgwwonogdxuxgohhuxwkxgkwhoddkdhkhgogngggxouhwghgxudkdunnkdgwhduhnhokkghxxxnwxhuuhoowgddhunnwxgogognghuxkdhxooxogondkndkxohkwhnuwdndgnowngdowxnohoowonuunoddxxnkuoddgkowdkokkxdohnouhhnxukwonogonohkhxxuhwgxokwxugugokokdhwngwwkkkwnkokwuowggxudghkwxnwdggxouhdwhnukuhnnooohguwkdohxkxdhxddxhkukkwuhddkdoookwnkgknxknnuxgdwkkxnondognwkkunkknwhghgwokhnwkxxxuogdxwuhunxdowguooonugnwndkdhxngoxuduhgugduhhuwowhhxkuunwnuhohhkhwuuxkwkkxkwxdonxwdokoxxwhhohgnwndwokgwdkhnhnkkxgduhnddwwwhoxwkhwngonndxkkxgudduuwkxdhkxdnnnhoodxdnwgdookdghkgxwgnggouowdnwoohxnougokwnkwgnnowkdgongdndwudnunwuudunhwukognnkgkgknhgokgguowxxwdnuxkhkngduowhohnwnggdongxgkgohwkgdouxhnowgdugdukkoduhgndudwdnhxwkowgungkhxkdhgkxognxoxwxwhwugugnhgnnxodnhnwhknouwdnwnhxnxghhgoddoxwogoonwkkggnkdwdgdwdnowgxdhukkwxhuonkhdxwnounxgdgwuxxghuxgwuoknwokxuwkgduwuxnuuwgxuokuhuogknhxxnhhugkhoxhkxuwkwkooududhxudwugguwuwokwnxnhgdhgoxnkxddguxohguwdkuugugwhkwuoxoggknhohuddwnuwwxwxhngoguokknohkwougxkkwhhkwkukgxownwuoghounhgougohduwdoonuwgngndwhkdwhngghxgkuwguknnxnunuxndwdgudnuwxugkuxkkuuddkkkkxwnugknoguuuowodwdudwowddxonkokkgnuohodwhhxdnoggdgngogxxdggdnxuouxxxhnhndxkgxkxxgwnxnoggdhuunugkkgdwkxwguuduwwxnnxodxhwwwwkougwowhxwdnxxwxnwggxknngddouowuuoughdgnhxxugwkhdxdudggwdnoxunxdodohwgnonxugkkkxodghnhwdxkkodwnhhgdgxuhhnxnuwgkdknoogwndgowdougwoonguuuodwknxkwdgoxgggknhuhnuxwonwhkudddwnghhxgwhgghoukwkxkkuxdkghxggghdhdkhohxwngghhhoghnuhgkhguguonoghndwnkggwkhduoukhwohnnwhdxnhxdgkuhwugwxuxwkghkkdddhxwgnnuogkoguukdudgknoougxugngwgwkwgunnnnodongnokddnwogwxddoxunooxowgdukxdghwdhudnxhxxgwdduuuggwxdwuowhkwxugdugoudkodugxxndghdkwnoduhkdoxuxgwnguhdkhkdhuwuddndhwghxnohdnkgkwowxngwohnwhwndnhdxgkxkoxouxhndkknxghwkhdkuukgkuxwgknxhnxwdgdwhwugnxnwxgdugoudwoououxdudoogounuonddxoxhududxuddndohwunxkwdguwukxoxnhwnwhogxoduhudoxogwkhgwggwkkxhkwxuxowhnoggukhggoxxxwnxuhdxgxxkndwukudkuudwxkkohwkhgkgdddxguxdkgnuonngugxhggnonnonxhowdukkuhdonkgguhnnudkuukhogohkhwgwwdhhhukkuouhxhgdhxknwkuhohdnxghkdoohowxogxhwkknxuwunhugwonuuuoggohxkngnuhwddukgngdwhxognnwhowdgoguhduudhnohuuwhxwuxkxwkwodwhwkgknwdngxkwhkkknnwwhnnwdwowooouxxkhoxgdgxuwoddgdukngxohodgguhwkdgugudwnuogkdnxuxhokwohwokxhonuknkhuouwwnuhxwgkwoohnndwonuhdghkuxdnwuxgdudkkxhuuxokkudxuduugkgdndhwngdhgguxkuoxudgdwwodwxgwnwkwkwhgdxdonwugohgxnwnggnkhhhhgwoxwukndhhxokdhgdhdkgdohkgohhhgwwxghknhhgdgggxggowdkhnkwdguhdhgoowxdnxkoggohwnhddxdwknwxkwkkodxhnooknknkgwnuxgxdngnggwkwwhogdgxhondnwungxgxudxwgokndggoxgwukhgnwdnuuoodggngwogngonhoohgxkkxknugnxhuuooxduwwuxhhuwwoxwnwgguwououoxnwkgdwgghohogowxdduxkhkunwkowdonuxhukwwuxodwdggkduuxhonkodngwgxgudxwuxhkkongonugwukxukukkuddudugnungxnxwdkguogokguxknhodohhnddukdkhowxkxngduwnkkhogknkkhhgukwuokhguggwughdowddgxghuhgguudwoudhowoukouhuduounwkuddxxdwnuuhxughkxdngggdxknnnxdnuxuuudknogkxuxwohwxhwgnukhowunnnxkwxhuxdxwngkxngkgukgdghhxkwhxnwuuuwnhwdhhunkwhwhwuunokngdhouxhuwduwxohhnxhkggwhnhgnohhkhnoduxxwwkxuowdxhdwxuduuxuhgxkkdowuxwdkkgkddnokxxhxohhnkhukonxudhwughdhwgknoudngxkduwhwdknwgkdnkgwuxwokdwooknhdkwxhwxnhkhhddugggnongxwhdouwowwxwogdddgxuouxuodwghouxkknnwwghhwknkhdokogdowxwgdhhgnodwuhghuxuwhgukodkdnohkxouwngknhkuxhnwuwuukwhodwgkgxognxxgwgxgxduodwduwngnuxwwhdwnwndhunnogdxokdohonnnhxduwoundkdoxgknwnknugxokowdgdkwkddhoodduuhhnhuohwxgugnukwnwghoxhoxdkxddxnduwwuonwhndxodnhoxkowkugnxwxwxwuxodkkugognwohgknhnukwokngkkongodxkhnkngdhkduudgxwkkdooukkdkkowknggkxugxkxhhhxdxdgxkugogohxwxogkdhuxkwughouxuodnxxnhoxkoggxdknnxkogdkwwddukxxodkgwhnodhooguwdhxnhoodkdnwhoowwdggxxhguwnkggnwodngkhoouggdwxowggouhnwgoodkguxkkdhhdodkoxnoxuhdowwuwhkundkgowxnonkxgdondxuoowouuohogwndnkdwxwugxkxwwkooxwwugngwxkwouohwouwuxwwwnwhdhggngxunwukxdwdnhwgodxuxwdghdkoxdkkhgkkgxwknggguouxkwoodhohwuuodonwknxggxxkxhdnxxwkohukoxwkhxddwkxxhxxuxooxxdgwohnoohuwddxgoxnkoxngkkhuxnxkdgohguhxhnnwxhxxoxwwxkwggdhhooudnkxukxngnkgduhxdohknuhkdkdndnhxxouwnkwuxunognongdkxknoxxogudhnwgudnowwoxdowddudokdwnuoduonkdgggondxnknxghuguggxkhkkhdnkxowoougdgkoxwuhwkghxduoddwgwhdwwdwkhkonxdwdoonhunugwnxuhkhgngkghwddxodxoodkgkowgwxwdkgkngngxohdohgwgdnukgnngxxoguhduhkdxhokuhnwgdkkhkokkhdnhhguwokhuukdugogxxkuxwhxxhkudgwddungxunhdwxxxxhounnhhwdxukoxxuohxuhuoxgkdhgguoxdggwwuogkkduuduxnuowoxhwwoonnghnoxudnhnoghdguhnxnnhhnghnwgdkhngdohdngokngwxoogoodgxdhoxnuxdxxhgxdxggnhouxnnnunoghdxxhouwhhkwhonxouwuuowuwhgwduuhwkdnkwgwngxxwdghhnddoxogkwkxxghwgxnnwdhggkxwkwxkkknoxdoodwkdxghxwxwgkgxwnwghxxdhhxwnunughooxxhokkdhnhukkghkddxwxnuogwggdhhkodhxndwhgkxggkwdnngggkguoxoowouuwuxgwdogxgunkogkoonhxxdddhxhhgdouhhnoxggundghngdnhokhhngnkhxxxwoxwguwnogkgwxgoxwgdhwnxhogxukgkkhkhokuudooghdxduwwhghkhduudxhkxhgwogwwuxhkdndxguxknnnwdgowguxgknhwhhxnwukookhxkuxoodkwdxxxhnnhkkdghxdnhuxdnhnxgduwhwddhuknggghhwukwhnnkkxwgnddhhhwgkkukddhkugkndxkdnhuonkkuouxuugknkwxkgdhkdddxugnudnukkkdghkuugndoxuugodgohxodxgxxogwdkhnhkwhgnnukwouukohdxgxhhdxogndkxuhkwxhgdnduwxhxhngkdkguwxhuxokgxxukdouxnudwggughkhxgdgdhkwhounkgukoodxonnhxugnwhokhdgdogwukkowunxknnxkuxknuoxndhxhuxgddonnnkuguowodxxwhgnnxxdnhkxwuxdkoxhdunhhwxhwdhnhunnkohhuuwguhhhgwwwhkxhxxkgxwxhnwwwkxnxkowhnduxxugoggnkohoxuxouwxxddnowwokxundowuxhwkudnxgogokouoknxghowdkwhxwxxnuggdnwhhxhnoknwwhnkwokwhngdxuohghhwddodgkwdgnkwoownuxgokkoohdkhnohogkudnudxkwwknhxkkgdohhwgdhowogwxkuxduuukdokghwuokhohgodhggoxkhohowhhudnkxondgnwokwkduuwkwnoooknkwuoowdgwgwhooowwnxgxwwhdgnxkughhxgkgonunhkdowxwukkoxnghoxgnxkunwghookonkgkkoogounkgwwugwxwxdndhnkuowuuogddndxkgdkwuxwdowogxukxowxuukhwowknoohnuogxnkowhnxnouxkxgooguhdugkxxkdhkgxhogdognxdoxnxgguowwwwdowggnwkuowuhundkkoououkhonukggogxhnkhnxwkkhwknohxdkdkwnnxwxwxddgoxodddduknuoudhoodwoxonuughwgxuwwwnwngugdhkgooxwoghnnddxwowdnhwwkdkuugdhokdxhhkwdndndxdhwxgunokuwgndouhwhouwnuddowonngxgggooohwdohhgodngwwwuuhwuuhuuhxhwkokgkdhxnknwowngxuxkddnkndgowdhkwnwgwgukwwknhddhdxoudohwohxodhxwwwwwkwowdguduooxggxgonohwkuddwwwwxoxknwokwddkhxwwwgdwxnhkudnwkkgkhgnoukoddgxhgggwhgoouokwgxdwkwwxgooxhwuxxwwogunnnkghuwwgguuxunhugohdwukwdndnuudxouwkwudkuowxwguxgdxwkognwoxxhduxkwgxognohkwnoghwkxwxhguuuggonxogdgunhnkuwhkodhgnoodgnhndonkdxdxoxnuwhdkxdkhogxxhnxugkkoouuouongoogkukuwdwnudoxnngwoodnhkohwhowxhooodnngudhgdwowdkgwhuxugoouudnxddxkxonwuwnhouonuoxdwxduwhwgxwoxudwkkxwwdnwhoxuwwoogwxndnunhhdxnxdwnggnhnkkghxxdwhokxgokkokwodkgngdkwgogxuuguuhhgxuhnndxonnkgwnkhdnwgxukuoxgowhgxhnnhngxghwkugkkgdkduuxwdhkudxgxkukdokwkxnhdxxnhhohkohhdkgoggddkggodkgguwxhuxdouxnhdgkkukhhnkoogoougxwkouuhdkdohngkkoxhkuxxwouuggddkxkxdkukxhughnghodxwooguxxwhkohwdkdngkoxwggdwuxoouhxhwkwwxondkwdgkhxhuoudwgoknxngkdkunkgdgukuoddukwogxdnuugohgdodggduwkunnxnwdognxgdxhxwkgkkdwdxxhdxhuoxwkondddugwwokgxgudnkgggkgkohudwdkdogkwknuhxdohxunxhnwgdwguwdggoguggdohkohgogkxdnhkkggwowdhgdkoudhkuwngouugwnnxkhxhuxwnnhhnoukxukgkhxgknkdhkuxxhwdggudduuuhoudugxogdhwxdukkxuwwkxxuugugxxkuwodkwxukhnxnuwduhgdoggxnhundnhwghwxwhkxgggxuxdhkkkwgnuuogongwodhwodgdnwgngnhknwngukwokgdkgddoxughokugdnxwdwkooxodugokonxohwdwnkhhdgwuwwoxhxdwkhdhowkohnnkkoowwkgoodnxodgxxgdndowhhounnoxokhhhdgwuwkwowkhhxkoknhwuoonkwkxunwxunhuwwkhuuwngwgohhdgnkgwgonwhnoowwdhnwxuxxdxkunokdwuwhonnduoxxnuguduxdxknngxggugdxgwhkxhddkwnxnxohnhuunoggohngdnhohkxduwoxnkkohkduokkxughkouuokhkuooohdwwxghodokoodkgwgdgnhoghnduogdgdwkhdkxugodkhgndookhxogxxkunoxhuukdxoxxnouowogudhdohxudukghdkduohgdwghndwxnhxdwwkukggwghoouokxhudgdkkxoghnwgnwwwhxknnxnnwhwowhkhxhdwkxunuddxggkkxkhgwgonnuuohkokgkhoxgkwdkkggkkdnxnwxohhxodwwooxhkgwuogukxgdgwxdxhuonndgwdkgonukhddnhohkxgnunwxgwwowdgxdggxnkhxhwnxwgwohxgnuhxddukkdggogouuxxxhnkkunuwohguuwhnuhnuwdkguxgkgkhuuddwwunhhxkouhngnuwwxwuguhgxdhuhxnkwwonngxdxxgudxkgdxhhdunnohkwoxwuononngkdwnguxwwwxugudnwdxxdgwhowndkwuxggdkwgkdkxxkgwhkggdokugwhnkdnhkxudgouunxhhuhwhuhuxgwowwuxdoxhgxhonhkohkggngoxkhkkdgdwouwkdkgddxkkhxdnddowwxoudddhggdxougonxdxhkuwhggdhhunowndkhxdonwdnkndxwhxuuuwkugnhwuxowowohwdohnhwwxwuhuggokuhngknduxwhuoxdnhxkdhngxxdndukhkuogdoonggndokkwwdxkhwhgknghouhxhdkdoduodgndgwoukudxwowxodxhhxhkuwhhnuxwnghkgxuwxngduondndwhowgghgddonhdghdhgogggduknkwwwknnhwnokgxwxudkunwundxgkuxwuonouuwnxxudhooxxnkkoduddxhdxnghunwkxdngkogknhgnnkowgohhuxhxkgwggwwxdxoxhxwwhkwowoghwougxohwwkdhdhukxwwwwgnkudwxdwggnuxkdgowokudhwwnkguudhdhwdguhnxukwgxwhhgxkdgwokxnnugdowxnnxuhwghhnwxxhdkkkuonxhdduxokxxunooxwxgwgohoguwuhkxwkdnhhugunggdgghuxhnhkwkhowwddwdnuduukuhggxodwxgkowhuoowwkxwuhnxnoughkudgohdwwugnnwxdghwhnoknwhhgowkdhndgnoxokgkohdkhnkxhonuwddxhkgonxghwxodgkkwnnukdkuudokuduxxgwnhhgxhdwxxnukkkxnnkudnnhoxnxwxduwuxughkhnhuhhxxdnngkowdnhgdudwuwdogkghkgnokwuxuhndduohoxkxhnukgwnhuonhnkkxnuogdunwhndngodonhguhnugwhxwnoxuuwgwxxxonuwoxgxkgnwuhdddxkxgowhudgnuhkhkknhkdohwndxnhgnxukhwohdogonxoxwdkkhknhdunddkkuxkngnnnnxgnhuuogdkhukoghhxxkxgunkogoxohkwhonggndhwknnuwonwdkuouuowooxwdnoouowwouodnnuguknwgkoohxdkkdnhwowokgggwuhdhdguhgdgknuowndngxuwwwghngkudkuudwunkxhghgunokkddokuugxduoookonkhuoxgonnnhkoduxokhgdxoxhdhngwddwdknouhhxhhoddhukgoguxxuouodwggokgkoounhouxgxwoduhwhwwddhukwwoohxkkugggkoxdhdxonguuooghookdwuhghdgkkkkdgnnwuuhonddnxkkkwxhnxdhhdndukwungwhkndxknuguoukhhxxkhogddwxuxkuddwwnokwgnddxwudhxhknhnoxxnhunkngkhnkuwwddknwduowhwwgguougwhdkowxwhuhdxnunoxghuouhgdhugggoukwgnnodkxokuwkxkwudngkwhknwhnduouoxdwkdwdukkdnxwkwuxowokhdndhnwkgwkdxgkudghndgddhhoukkkgouxndgwghhogxwxwkuhoduwnnddhndognhnoohhudkkxokohnxhdkndwkkhxhggwngxhxgwxkwhgwdnkdoxhxddddhogxghwodxonuwhhnuukndxdxkwguuoxghddhxwkogwoogghdxhuwwouxokhwdkdngdxwdoxuddduoghhondhgdouxxhnkoxuoknooxunxgogwugowookkghuwhdnhxkndkogwukhdwuhwgwhnokkkdngxuugwoduxdwkggddwhxuxnohoowgdwuhhhdwxgkukokxoxuuwnwnukngwdokowuohondwxnwwhnunknxgxwukudnkkuhnnxduwgnnguxngwhddukxdguggogdkodknwgkxhnugukkkggwnnxdxgnkxxdodouwnoknnwxkxowwnhogkouxxdxgnxnwkhouokdxdwggnokhknnhdkkohuxwudhondwhhkwxnxnokkkdxnxhkwonxwkohhkkuownhdongwnonhxdhhwdxxugxwugkwnxndonwwhwhhuduhwnowhkkududnhxdghuxkxdwxhnddxgkhoxgwgudwxukdduwnkgokdkhuuwhogwxxgnduhwnnhxwoohwxnwxxdkkxwukxggwuuuouooxndxudnugunxunuhdouxwuknnxkgggngdnxohugnduknuookkdgxgoxxoxgknogxhuhkohwkonhnhggwnuggkkowndndhxndnknxghhnndxnoououonwnnwxkkwkuudodxgxnwnukxgukdkxokdwkugoxwwngnxdnnhkdhhkkhhoxunxnuxxgdnxohgdkknwoogwgkxuonkxudwhdhxudwuonwwoughuuwnonhndxdonggnxgonkghugnguokhgukkowuodkoghhukgogwdokgdudkwdungxukghuodognodkuuxxhkxuoxhgdodohgdxkhxddnxwuxuonowdxguudgwddkhwndkkhhuhkghowohxwoukuhdxonugxoxouwgxxxodgohnwwwoxhxngnowkxndwwkkwhxuhuohkuxdhnghkwdnkxxhxxuhoowodgwkuonwnkxnwkhoodxuuxknonxokgwwxguduwghnwughdhxxkwxowgdkdnhuduxgnonxodxnudwgdnxokokuwdddungoxnkkxkwunwohhxuuduxouhnnhukkhdkduxxwdngwgknhxxxnugodxodxdnoggodhnuohouughukoownggxwnuoggxkxggudguhgxukhwonoghgdnuondoownguoxgwxxhhknowhwgwdohgkhoukxkgnkgoxhxdxdkgkgkuuxhnxnuuhudgowdghkudgduxunukghuoxdnhnxkghxwgdwguoxuuduggndkuxwhkxxhnukxwndhogowxhdhowxkxgwgndowhkgngokwwxdddhdggoxhhxhukkkhuwogwxnuwgwkdxudkwowwonwuwuhnxdxnhgwhhdugndxuuwkkkggxxgxuxhwdwwdhowkxknuwkukhukwhduwogokodgwuxkkknxouonuoxuuguhodhnhwgxkdndxwgkkkxhwnxnkukngouwhdhnogdhwwhungunduuggwhnkgdnkuxkuuowxxuwngwggkugxdddwwkgnounuhwggnnxwdxxwwwuhghkoddnoxuhonxhnoodnhnwwhuhkgnkwwddwoxdnxxhhhkgkkxgdxhkhwdodkwxgddxonnodxxhhhuukwgoghnonokxdkwwuookwnwdoduxdkwwduuukgxodxkkngwudknknuoohnundduuunnnggxhddonwxgnohoukknnoxndouuxwukxdgnuunnwkgnughgxugkghuugunxxkuokoxxxxduxxoggudhuoohoonwuokxdkghdkododwxdxxgwnwhdxukwungnowdukuwxgwoxndhohhwowwwdghkdkgwuhkndhukkddgkdhghooguwnxxwuxxhwggowuwxwukxkgknhdhdwhgkxuodwhhxdwowgwnxdwdduohhdgkxnnkdhkkkhwuhnwwkhuoggwwuuxhxkouugdggwnduxuoxgkgkgwxgxokdhdwwnhgnxgdkwxnoowdoggoxnwnnddkkwgxggwnokkdgwwxhukhhohkowdughnohokdwxxghhowunduhwduxhnuoowkhxwggngodxnukxwghdxkgonoudwwukokguuknoonoghxkdkuxugowxouwdnxuudhhhnxkkokwdxguwndokkxxwhnxuxgdxuuxdnhduwnhowxwgukdhgwndxkwondkghdkoguuowwnhwohgghdgwongghnhkuxndxxhnhxgwuhxwuwwkwdgugoxgdoxwhkognxwdgwgxwkuokwhonnnhnnhxxgukgdnoohnknkhkgdkdhnwkohduokwgnogodgdhxxuwxhxghoxkhxnonnkgoowouxdkuuuhdnwuonndgudoxdhxxgndxxgxkdughxdkxdokuukgwxnwdudgowhxngnhxxukuwokdddhxxnhdnkgkxodoxxknukoghokxguonuxnhnxhnhduhxwwxkonhxxnudhxgkxowuouwnhhowduohgoxukgoxhnuunkwxwkxhhowghodxxgowduoxgkxxwgwwukxhhxgudundgwdwwgxhodnxnhgogwodwxxkhodonnxdkgkxxkhwnuxwuooxohhukhhwgxdhgwoxhnduhngkwgknhndgokgxnogdhxgknhwwwoonuhdhdxgxggoxnnudngdoxnngdxuudxddddwdwdngkhnggouhndxxuuhxnoundognwgwdwkhhgnnghndkonuggxwhkwhgdhxxwudgoxuxudooxxkhxkhxghkkguhwxdhwxokdgwhogoukgkxhunhuoxxgowwnukooxhxhdkonddungddhukgnkgongghgdwgughkhdxxkkwhkuoxkgwwxnkokonkkgxwgddxxoownhuuwgdnouohouuknuguhgkhghxdwxxnnxohnnwondhuggnoxwdndwwuodoxnddhnxwhknokuduxhkuudxdxwxgdndwhnxngoxgugwuwngdohhuddkwoukgukuuuknuhwowkhxuwuxwdouundhghxhndxxxndonkdwgdggdgwhnwuuwookwduxnxohxuxhgguxhukhxhxxngdoxwngddxnxwnhkghdgowgoxoxhnkndohdhddnnxnxnouhdoodhohknonwnwkuhungdhwgnnunkuxuuhxhgnuwdhugdxowwuhuwguhuudwkwhhgkhnwdhuwuwnxwwwddhxgkwuxgugwkwhnnoxogddogwxggwxowwddhkdwxkgoxduoonuhonnuwoggooooonwgwxxondnkounggxdggnkgwnxuknxuouddwhwgddgwxhouokgggnxuwnhxudgnudwgnokghwxugnouxkxddoddhxddhxuxhukduwhxwkxxdhdgwkxxnnnkwnguwnohghxhudugwgoouhguwkxonkokonnkwgxhuhkxdxkdnnonwuwdwwnhkghwddkkdwhkogoknwxnuduooonddonkxokkwgwnhkkonowhghkhghxowondwokugggoohoxkxxwookgwhwhgguuwokkuodwnwunhxohnxhukkouxgowkgunukwgxxkkuxugguudghkxdoxduwdxogwoxnhgwxwxwdkuuxghuddggunhdonhkkugkuhhdgkdddnwohnhgnwodunkhwokknuwgdghkkhgkhghgunnhuhwwwxdonnxkugoohnukwhwwdhhdwxkhnonxnxokunwnoodohhwgnnunxodkndodkghwxuguxgokhduggnuxunwhxgxxnhhuongxxuhkhkggxwndhxdghhkoudoukxxxnxkhuodwwugknkwngxnxunwkkxkhnngukgxgnxoguwnnhugkhxwwwhnxwoogwwgndogkxdggowuxnodhuohhgwodowukwuowwowowdnkwowgwxduughowwoodxgwuxknnkuwkhuwdouowwgkooxhdngxdnhdudwhwowkkgguohkddkknokodnkxgnwhnkkuuxxwkunnwhnxwxgkowwxukhuoohondwuwhkuhuowwggwundwdnwwoownkhhhkgouuhouownodwgdogohgnnhndkuughxnhgnokkhwkndgdhkodxgdxdghgxxwhonhgwxgodwwwdkkdwohhxwnogdwnddngnndnnhhhkwuduxowhkdhnoxkkogdhunoddonukwkhhxgdohggwnxnudxwunggohdohnuhdkhkkwnkxkukdwxgknxhndxgdhooxdgxnngkxuxgdnhoxwxudxxduxddhgdxgdoowhuwouhwungwxdhddounoowogonhwxkgwknnoxdwdnwkuugwudndwgnkdxwkngwwwkuwkkwuohuohkdungngxwuuwxuwxxnnhwxwddwdxdhuogkunwhwnukuhunuhgggwkhdhkwuxwdgdxkdogxkxnhwkhduogooouwgnnghnkoowdodkgnunoghnogxkkdxunwduuhxwhgxwxkoxwddkgokoddxdngwgkdodghowhxgdhxhxuwwxwghwkkggkkgoxnnkhuxxwdowguduguoxwxddhxowokunohwdkhkwnuwgwuxnoknudxkkxhnguhnxhdgnnwnhoduxokxuownhxgdgngugxokdwnudonghngdnuwoouxnnwxhndhnxnggouukunxnohkoguwwgwdddwwhgknuxuhgxdxuhkhooohhounuhodoouuxoowgwxgonwxwgdonowgguuowxkdxogwunhhguwoxhhhwuugnodnhoodxhdwkdhdoukkhxuwhkonndwuudduuxndgwxugxghgkkgnooonnuhuduwgxogxdhnhunkhkhdgohhdwgooonoxgnhggudnokhuokkodhdkwkduduxwgnkohxunhkhngwhknhdxonwouownxkgwukhxgwhnhxkxdxunugoxuuoogowhddkwhdownghuhohngudooxgknxkwhoxhoxnkhwgxwxudxwxwxgwdnxduuohuodgonknkwnwonwnddoddwnugwwddnkkkhdghhxhoughkhxonkkowgdononokodwunwhkwhohwonggnukwxokunxongooxgkggxwunnnwkkxhdogwknwgxwdnkhgnxodkuhuhooxuxogxxnhnuhwohgkdhugohddkxnnkkxdkgxdwhhxukukdnouugxudwknownhuhhghkduggonxhodogkgknowxnukowndkdgxnxxknnxnhhuhdkgnxuogxduudxhuudhxngkugxdongddhudhnnwngokkdkgxhxgoxxkwxgwwhxonokwdnwdognnnhkddkndwgwhkunondwuhwuhxdddxddogdnwhnxhoduhkghnxnggkdokwuuggokokuwugdungxwngknukgggukhhxwhghwghkgnodkwkgxkggoudkngguxxukgngddgddukgdxkkxnuownkxwhxxudguohdhnhdouxwnonhnxgggkddhugukkowouxukgghhnwgxoxwnwhkkdwuxdukndxudxognhxnnkhogugggonwwukxgunougkhokuhkkgkxngnkhdohodoxonowkxkkxohghkuxknghgohxkoxghduokxokdwxgokukddwwhxgodonghgunnhgwwouwdhgddowuhkhdkkxwhhghkkudngdkdogwkkkouokgwnnknuggwhwnxknhuoxkoondnkuwundhguxnuhxxodhgnwuwdukoouhwonkxdwkdwxddwkuowowudnwhxhndwkhdoghnuogxxuwghuudnkxwdxnhguuoxnhwdnhgnhndwxkohouonwdduhuooooowkkxhguudhnnxnnhnngugwkuhxhkgugnkhxwkwuwgxxgkwxdwdowwuhnwkdgowhokwhhhuoxowngwwukhdwhonuuunkhgkdogkkdgkwuwknkddgwokkkxkwkxkdnnwnhoxokuuhwukhgknwnxhogwgngukwdngonnnxongdhduhonuwnkgggooxhgokgwgxhwdwdundudooguwxdghonghgxguxukuhhdnhhoudnhgkhhoukxnddgkxuunuxnowgxxxdkkkhngnxggnwkkxoxxdhgddnwngugwudkonhkxoohdohgounwhunuwxwkdxndudnongunugngnknnkkwnwdhnounxkudhhnxgwgdhudxgwwnuknwhhggdgwnxkowuxnxxhnhxunnohduuuuhokkgkukhkohgxwoghdhnnhkxwwnukwdukookwdowdkkhunghhwdwwhhwgguwowxhdkuknxwxnuuuxgohgowgdwddkghgxxhdugnwkoxkhdnkkduohkgkowgdxwuoknnuouwxokkoogdxkxknngxhuhkdhxgnuxnwdngokhoooonxunddxnwxnkkdxuowddugxognwkonngkgwhdhdkogkgwgkugnxgxhdnuhnxdungkhndgdknddghhknohwnkxxkowoknxngodwnxnhhdhxohdwdkdnknwnxodddwddddoouwhnnnxwhnnnhoxxxowknnxhknkdkhnkkwdkgogggnuwwgkookwhohgonhwhxngxwnxxkwdhdwdnkdnkxuuugugdgunoukxnuuohdkgokxknwwwhgxwwgkoggnkudkxgduhwhdowhonxdkghhhhugxhowwgkkkhdhnuhuoxwgdgoowwwugkoknokogugnnokdxodngdxoddnuxwowhkghnkghxxnhkxxxwhkduxuuwdxuwxkoxgxokgwukoukxuouhnkkwwhonxoxuoohowwgdxdhhungnnkxxxhxnkguwnwxoddnxnnkooxkgughuwwuouxxdoxodxnxgoghhxxkugkwkuxoguwdouunduwnnkdxndhowuguohdxxnuhuddkndunwkxuwgxhdxuhgkdhndwxwxnkugguokoggxunhhxxuuwouhnuhxxhxknnnxdgkdgdhdkxxdogdudoghgxgxwudwwwnhookgoougxggognudgdnodggnxwkggohnnxuuwxhwoggxgnkknnuukgnwwxuuowuuwgkkwkwgoxxhkxgwunxghkwnugnxhkxokdkddkowhkohwounhngxuhxngkowghghhxnxdgdxhdwhuxnxdwgknogudduwwdxdnukoonuhgodkodnoowhokgouwouohxhxwxkwdnonwhuowwwounoonnuoxghgnkuxokkknwkwhkxxdngwowhuwwhhxunghwhdkhwowwukwoohoxwnndxhgkowkoknknnuxnnxxgkxkhkhhhxgduuoknnoxnudwuoddxuwwgxoxgwudxnhoghnknkhnuowkwxhhwnughgguxdwkgdogxodgudwohwndnwdwogdkndonxkxwuwwughunxuhhdkxgkuohgookdnwnkgunhukngwkhwuhkudgunxxddwuodhduukkgkhohxkwwgoxuowhuhdnodkxdwonnhwkgkghnxwwdgudgkgunwuxxdxhxgdkowouduwggxokwxwknhxohowhnuxwuhhodddhhwhhuwokkkkouxougnnugudhhduoxxnwuwkkwwngkdkgnugxughnkxddkwkxwxuxwgohowwunnxwgxugkgkuwkuxuwdgwxxkwkunugwwhdwdwugooknuuudukndxoodxnkdgwhggxohdkhudkwowwdguokohngdhuunhnuhuhdxowdokngkgouwggnwukkwgwwhdnxwkonkunhnwudohwxgkunwxxuxndhxxoouokkxdonokoxogondodwwdghokowouguuknwkhgwwhonuohxohwnhdhgwnwdgkdoodonwdgnugwwnwhdnxogugwdonnxwxggghxuuukwhwuxhnwogwunkohwdddnouogkghkoxdgxkxxhnhgxdonxdxdwudwowggdwhhghxudugnogndxowkwwudwgkhndwxohowunuodhgwxkkoowgdxogoonxxhodghwhdduxnwwunkxxgwhwuukdkhwowxukhnwdhknxwukxnugdhgndhhhuowugwwguwghduwkdddgdoxgogwoudnxuhudxnwkgwoxnoguhuonxngwknhgonnnkhgdhgnuxkdgndgogdnuuonwwowkkxgkxwgkxxwhnoxgwdhhddngxuhnkhndgwggwhnnkgxnunwnungxohooodhxougwxuohokkddodounhhggwgxxxowgwxdnooxkwgnwkdgnoogghuhwwhghkxoxgnoxuuugoduohxxdnuxnxhxnndkogggdggxndudnuuoxgdknwkhoukkwnuugnkgdgdokkdwoungukuougkwkhdwkwxgxowkxkuohhkxxgoxknnknhgkxuxkuhuuhnkdhuwgnnwhwounoowouhokxwouuxkuxkooddxugwxgnkunwxhohkhnuuxooxkuoxkdnduxdgxoxwgudnxngowkduhdxudwgguookxwdghxgowoowhkkonxwxuwuudgdhukhudxdkgnuhxwdgkowooggkokduhooguhghuwuwhuhndknuknxdhnwdudxuhgwkgdndougwoxwguokkuwnxxdhgxnoodokookkxuhwuhxhkkgwnkuxgghunwhgoukgnwgnognhnnwkownnkokwkhwudkdwhwugkgkhwdkdhxuwhxonuhhwkuwoguwxhnwddokxoouonnunuuugxdhhhggxkgxwodgokkkkkuudwuukuuwohonxdxdokwoohgkukxngwoxuxoudkonkukhnxhdnwxuhgkkkxddhongohkughwuwnwhgdgukwwdokhhgohxowuggnhkhudodxngohddnuwguuhnhkkdgxhxgokhuxkhnkuhhdxhduxndouwugwhhodnxouxdgdnguuouknonwnunxwhgnuxhouodndgdkhwwnuxdhknxwxxghgkxouwwnguoggukdgunxgdkwkwwukooohhwouhnnwhwkokgguhhokkgoguwdkxdguhoknhowxudxuodgwuduwgdkdognxgdgohhgkduxhoxwkkhxudgkndgguxdwkhoguukodwxukkkknuwuugodduxdukhkxoxhkhuhkuhnkkdhowunwknnowdognxwkghxooonhkgknxgkkdxonxkkhdudhkgwxkognkndnkxwkuougxokxuxgwhoonxhxogxhxdogoghouwxkxowhxhnxddgwuhuuuxknugdugxudxggxokgungddnnguxgxgwghkwwnonhgnhxdugonooxdwxokdkugxoghuhxnnxhnoukxuuugghxwukwwdxkhnxxgnokdxuokkgoxkgnxdxgwhxukddudhwkgouoknhkkhhdoohunxognhhkogunxxkhnuugwkguxwuukndhxukukdnogkwggkghhndnxuxkdwknuwxunguoxwnkghhkdgokuwxkohhgxugdhukkgokhduoknokoknnknuuohwoukxdkwngnxkdwkuxnxdgguoddxkdhwhognuwdghhddkuookgxokdxwgoggwdddohnddgduxwdnnoxhndkngkhdukhkkkxuounduxuwxdgkonnnhkkwuguhdowhkdgwwnuohohuwdgwnxdnhowhkkgongugdohnkhhuxxuwdguhunnhgxkdokhhxkuonwhdohwwwxunwgxnkxdndnnkwkwugoxnkoxoodwnnxnowxduhwkwkwhnoxwxhnunhgwkowxnouwugonoxwdgxduwodkdnwuxdoghukwgwudogkhnwhknokdxkxguuuxdowhhhnwduhnnggkxwkkkxkduxnwodohggkohwxgndgduoxxnhknhggdnunduudunkdxxguuhdxkgnnxnxguhdxhdxkhokodgdhdwxwduhkxhxhxoxoxuoxunhnkodhukndkkddkdnhkuxunnknuokgkoxxghngghoxoxknonhhhnudxwkughxwuookdxkhnouxwwhudunghggooukdkuoguonhgugdnonhuggnnxnughouxnwnxnhhgughonnwngkoxkououhkghxuwhwkuxnnkonukkgdnwxdxowukxxdxknkxuxgudonoxwdknodwduwgguudogohnddodnwkknokgdoughkgkoodhxgxggohogddhhwohohkdukgundxgoghnugdkoxudwoonddokowgkhohkhhdnhuhwnoknkgxkhuhohoohouonoknxuownuhohoxkwgnoughdwuokgduhnxhgdgggugnkdxhhggnukdgodgxnnknougkgunkghownuddwnwookkwkgwwukwdhoohnghgxgohhuxuhwnwonwgwxxnkkgdxdxwowgddxdkkngdodwwhduwwkkwhohgdkwxoudnkxhodhnkxugxkxxknkkhgokwxhwukuxwkowwwgwwxwkhkxxwugnkdxgxnnuonukwgnodnhnduokdxkdwdhnnwhxkguwwxxgxgkgnnhgonkxoodwdxnhwhxounuxukhdxuhdxwnxondxdxuhxoxwudondounxoguhuhhwdwdgohonwhxnudxwdgudnkungookugonoduukogxhgkoonnwononngnnhnxoxxhxnuhgwggwgownukxkuwuxkhdkukogndxodnkduukuuuohxnghkgguxkgkxuxnukxhddggxknouuhgghoudhnugwwhnhohxwgxdodhxokdnkddkuxghkhkxnnkdodxknkuododdxhdgwkwdwgowhukhhgggokouuwxhkxhhnnnoxnkxwnwdduwnxuhohxnonxhgwgduouuhkwwguwhgxgohxxowgdggouwnwokwxdxuwdxnggghuhhoukkoxuodukkhndkngokuhkoxxhgxgohudgkdnxhxkhgoukkdgdwgnuowuxdnuwkkwogdwxdnwwgkhnohgkugdhnuuwwdnuughhonnuwuxnkdkxoxodnkghxnnohouuwhxukduuodkhnngogdndwohnokxgxnwdkodgdhxnnnxkookkuxuhnhdxnugwhuhhwwdkugugxkwhnonxhxkdwdxkwkkgdhndohwkghnokwwuokungxxnxgwkxhonnxhxnxhxdgkxuhkgonhwkdugnnkgxhounxwhgooxghndhkggxxxnkgxnokdnnkkoognhkxgnkdhnkkdxxnggkgwuwgnggwuxdouxgoxguxkgkdddowhxkgdwwokgounoddokuwuhukkhgxwnkghoghododwouohngkowuunwddnwuhuhdhouxnhdhnkwndkwhdwhnkkxwdxguxxwhwhxxgdgkodduhxwghookkwwxuuhkgdgudnxuwugoxxhgdxgxudkohkudgwxdohknwuuxnhdhuudwhwodduogwgwdgwkwouxououxxkwxdwunggxkxnghhokhwxdkgkgkddnnddkwgdxxwhoughogwxhxxgogdxugodxdkkndxwdouduwggdggwnhwgdokhouugonwuohouhwhwdgoowdgwgndgdwxnwwgwggkdxkhgnxwnhgxddxndhnddnxdwhgkkogxhnwdhhxwhxgxwngkoxnghguhxxgxouuxooxhkuhgwkduokxoxwwkddxgdwodnxogxododoxdwwwunwxxnoddxngnggkxgndxoouokxghunudndhdwkxnnhookgwkxkdkhdnkdghudxgkwdhhhnngonwgnodhhnkuhkgnuhuwgghnkkogdgnkdwgwnohdhudndwugkxhnhwxddoknuwgowddwkwwuudxouwokhouwdxkndhgkkhonkuhgudowundouuuggugnuudnwdkkhudxkukwnghnxnhxoookwnxxdkgoxuddgokhxukgnggxhnhghkdnnunouxuouokodhuhkukdwkkghgugunuxnuhgnwwwgndxwhhwxhokkgkkngxkkuhxkhguhhkdogghgghouhxhnwuukunknddkgwkwnduhkddwokdwgwnhhokugggddowwwoudkxgungwkwngghuwxdddkndgwgxdxnddhdhxgoguoduodhkoghuxnhwkkkgxodxunxognodkuogggnwhxkguwuookwkhudogoxndduonkkuxxgonxnwnouhouoodwndnnodowxuxhhwuuwwkgnxgxnxkdkuowwngnguuwduwhwghoxgkundogwonunodgohxuwxughwnddxxwohnowuwnwwgwndwgdghgnooooxdxuuohoxhnudnoxukugkdunhgukhnuwdowghwwkkowhxwxxnwxnwkngkgoxhhdxdhnxuowwdwghgohxgwhodduokwxwudukghwwxokkghgndngnhkuuxgxudduwgodhuunwukooohkkxkkdgownghxhdxkgkuhhhgugddngdwhhkwddhhxnkuohngohwdohgugxhhwdkouhdhnhkhxxoxuggowhhunguwgxnuhgdnhxuxwgdnduowhnnwgwhdhwhkwxuhdoxndngnoogwxkxokogdwoonukhkkhwhkhxxhuxxxkghhwhxoknwkgwddkngohwwdoknnunkwgounkgxdxgghuwxkhdnkguwwkhdnxwnodudnhdouhnduxxdgkokhwkhxnngghoghodxkuuxxdghoognghhhgxxnwnnonwonggonookuwhhwokhnwwwddodoohnkdouwkdkdngnoguwnxudxwxkonhghoxhkghddounhwhodxkoxonnduhwwwxohdhokhwouwhhuouohuhoouukuxnnnhngdwxxduwhuuxghhnhkuhxongxwxhxuonggxoohxndoxnouwwndnukdxdkughndwowhhgxdkoddowhowhgkonwuoduuxkudgxnxngknnugnkxdgdwxhwohnnwnohuuxwnkdhoxdokhkhwnkukugdonwohudognowkgdxdnwhdkghgdxodhxkdxngghwhkgngxnddwduwnkkowxoxxkxkognuownkdxdownuonhwdoxhwdknngnognnhgguhgwungudhnwnkxkxuhkxhwdkuwhuggdhoudddxkhgdhxhdgxkdugwwdnwhhwxhxnxhngwguuhdgwnhowhhdxuowdwdkowndhxdhwohnxuunuhknnwxxxdohhuguowguhhngwgownndonnggnkwkoggohhhxnounddnxowwwokodohnhxngugkoonhuhknhudkwxgnxkwwonnddgwwxuoxkowooognhwhnwwwoggdxgdnwugonkkgonkxkxkwxdkokkwnnddwdxuxodgkkxohxguuukkxdunooxkuundwggxuxuuudxgkhnnkggwxxkoodonhuwngxkxkhhxoknoddxghkodgxndnuxdnxxkuowgghoukwkdhdokdodhkxddxhkgwnwxdkdkuknugkxhhdngwudgxuhdwxwdwkhxdhdwdkgwwndouwuuukhhkokwonnnunkodghgohdguugooxxknkhwonxkuhgodokggnkohndwnwunodxdgxdxwknukoxgguwknhxdgndnnkgkkkxxwokhwuunduuwknkodkdwwkoxngdwdnkongxkxhonuohwxddgnwwkkhwokkdnhnooogodowhhnghuunnuwkhkdddwkghoghdknkudwkhgnoxxhdxounkhohghwwwokxxkowohddukwuxdgwonkoxukkxxwuouggguxougxwghndkxoduwooudxhogwhdxhokxgnunuokgxxnddhguuhxuhkwkhouxdudhhugukxnnkkwkkhxhghdgukxnhwuwhhgnnhwukddunnuugkkoudggdggkgwgugndghguwuoxkxkknodwhwukudkwkokooxukkgkggwggnxnkoghggukooxuduoghhohwwxggowhkndkgwggdgnkxgudhodwkohgudxxukunkwxohgkgdugxwuknuwddhkwhdxhonwnnohwkkgwkundxnddnkghnhoxdowuwkxxdxgxogkdkdgxnkwxkxdxnukuhkowdhnkuwhnhwgdkngkgnhudwhndxkhxkwhwuhohwdhwddkhkuxuohwgnkkunwdouhgkuxkkgkhoxuukkwwkwwkhgngkouxxnkhxuoduxkxgkgdxnhoudkhdkknuowkkwgokdouxoudoggnddgudnhhugkoogdhuxxkdohoxowgdhnhokwkdnoukkxkhuoowdoxdnoxhnxxgwoghdgoxhxdxgkwuuxhdwnxwwuwnongxoogwnwkhdwwxunhhxxxwxggoukoxnuundddxkxnuxounxnkohkgxhwkhudkkouookwogdnoohuhokwuwwdxhxxuwdunkhwdunhdggggogwokkoxkonwddxnxokkghkddnkwodndwwknwdguwunwkdokwxonxhwdwugxxgonwughxhnnxwxhnxghgunughgknohnwuohwxgkdonhhuduohddduxxkdxuodxoodggouonnuuwuwwunuogkhxuouhwwxhwkngnkxddduuoouxuunuuddxduggwghduwwwnundkhowukdowokwownhxhnnxnoondkdundxhhnwhnxxhkdkuhudwokxgdduxgdhgggdoxhxdxgkxxnodoxhdkxoouhoddgnhxkokudnwkgduxdgkkhxhxoxdhkxwgwddnkxgudkdxhnuudgdwoowuhxkxonwnwggkuxnuxghnhxguhhdgkgnhonhgngdgndogohooonnhgxwxdugowkuoggunndwhxuxkhnundxwwkukwguggkhuxoukkhwudgouhnnxnxugdxkgwhngnxouwgooogdwnuoxkoxxxgouukhxgdxoondhhdkdxnwnwgxukgnhduwwdwwuouwukkunwnohxwnwkwwhhdongdkkwowuxonwgowkdwguoohggduhxknhgodnowughxukwonwuodnhgxnwnoxnwhnddwkxgowwhuwgknowxhxkdgnuxhxkgugkwdknxhdxwdhgxwohhdnoddhwohkgoonkgunnhkhkhgghwnhognouwnkhwxungnxwnoxdnooknkonwgduxggwnokouxuguhnguhnuudwhdxduwoxxwugogkdownoongnwxwhxkuxhdwhwgdxhhkwhkudnxhwdwugwdoxwhwnkxnxdwnnnxowndxdgdogxkdoxgdkwohdkgxkdngxhwgknonuuuxwxwwggdhxuuhgxghwdnghnnoognwhuuuxgwguuuhowgkkwnxugwwwdugghxhdgnxhwguwowdddoudhwnnnddgnngugnxxxkwngdhhunnnuokogndkhgoggunkuuxwonxdnokwgdhoowgdduguwhxhkxkkwhkogwxkdoxnhnoxwuguggnndxowxgudondnoxndnoonuudwhwhdwwhukxhhonwkgnuxwdwgwgonkwnggwnwonhhnngwwdkuhdghhnxdkhkknkkdodgdwkxxhnknhwdkudukhhuguxhxuwuxkngxxwundwouxkwohwukukhuxoodkukngdwkguhxdoowgwddwnuhowkonwxkwnxxohnkddodhuknuhnwugunxundhggxnuogokwhwhougndhnwwdgkuduwukdwddhhwwouwhdowhukkhoxkundwkxonknxwhgxwknkgxnxwowguohwxgukhdowhkwgdgkwdnuhdokoudunhdwhnkwonuxodguoxwwukkuggxdohuhkxngwuwdhxdnohggoudgnkkhownghogkndnxhxghxgnhxgouudhgkdxwkwdxogndohdxwhdhhdxwndnwknonwhduoodgnunouhdxdxdndkwxnowoonnhgowxdxnnukddxxhkkhwhwnhddonowuhkwhddwkuonnnxxugooxdnunhgwdhokwxhkdnwxoxwhundwhunodkuxkwughudwdonkhdkgkxxoxxhhhuhkkokggouuwdnodouowhgwddkooknhohuhhuhnhkuxuukohhnhddxxuguwwhkoudwuxndxxuowgghdxxhnkkdkhndhhokgdhnxuhnhuoukknokdngwhwxoxgududunhoxkxkodonuwgwnxdwdukduhhukonhddxhnwngwwdnknnwdgwougxxnkgwkhhwgohoknxkkkuwwknkggnuguhhdxwhgokonhdngkduxkkwwowuhhwdhknhxghgowdxhdxwwnnoxuunuxkxhdgwxxhwudoxowkhokoxgoxunhxuxgoxwnkhkwxuxwkguundxngnnhugngouwohduhhnoogooxugowduukogkohukkkwwduwxnkgowdxhdnkxxkwgnhokxngknhuokhkxhxhwngndnnodnxnxoxonhdwkukgghggduxhkngwggxuxxnxkgguoxnokwhxdnnkhkwghduwxwdxonnndxuhgnnwgnhdgokudonhxhkhuoudundwdgxddnxudddguhxkkudhowhuhghwndwxhwuuhownouhwnokdwogdgwogkokwhxkdunwnxdkhnuxkkgwondndgwxounkwhhowghwdghdwgoodhghdnxwghwwunkxwhxhhnoxnxhnxxkkuodgkgdudnxdkxxudnohddwhkodxgxxhdxkkxxnxnonkxdoxgdwhkxunxxkdwwuodhkdxdnkxhuxuuxhukwhhuwdduxhdugkhdxunoxhxwnknuxnoxuoxukxnnohwnuuunndwkggkohkdoungkogdxnhuwkwknhghgnwkxxkodnhkoxnuwhuhdxowkogxokodgukgdonhhxugghdggndduxghdunghkhnhuuxkkdkhwwowhkdwknkwuhnoxkhodugodkguudkowwduwoukxugnghnwkuxooknuoknwxogxwwhnhxngxxohhogowxohxoonxokdwhgnwuxugonudoxnowgxggnguududknukuoddwhhkgxwdhkgdguoxgnknguxooxwkdxnwgghxnkdogguukuungkhxooogxxkoxdodhgoudhxuxdgwdngoknhhhkdggukxnhodguuhuhuhwkgwnknwwhghwxxwhwgkkxhuuxxuwouunxxwgxouwuwwohhhkdwddgxxondnghggnuwokhdddokuxknuuwungonngdogodghwkhkhhuwkhxnxxudxwxdodkkodnxhknnwnoxnnxkhnundwonghgwohokdhuouowwxggxxknwnkxgnnkdnugkxwxxxnkwkndnghokxounoxddhnkwonwkkxxkguwnuudhxxxwwdknghgngknkkguhhnowohnuhwwgxkdxhkhxghnxggkdkdgwuogohxuknkgduhkgxgkxxdxxkkkownhkungonhkkguxxnkkuwgkxhxuowkuwgwgdhduongwwdkkkoddkgkhxunohhhugoowhohkkhuwddwkhhhxdkudodwuhxokkdnonduwkguudguxdwhxdhkgnhgnknkwugkouuhdwkkoxukooghngkhodduodgdkkokkhkoxhkknwouxhnkowoukgodgonxgnwdunnodwgdnddwggkxnkdhhnoghngonkwdxgwwkudkxnxxouudnnhugwognxxhkhnokunwwookuhgxhghowwdugxuknxxuuknwgokdngunduohhwwohwdkkwxhokonhwudduxwgodudwowduwowxouwgxkhguguxgwnnouokdndnxwgdgwkkowwokngkonokouxdnukdoukuhuhkhnxxonwndngkonggdoxwkudwxhknxgdnuuhxogwxuuwnuohwwndkgddwnkwodxdkkkhugwxnudxngkgdwxdhhkwhogooowodouwuwhwdhouhuohudnnddoudogdnodhuugnwwhugxxwhhkongxndwuhguwoxdunkdxudugwdwgdkxnohnkukoukhokxhugowxgwdnowhwgkwgxunguwnoohunnxwuhuouxdxngnhggggxwuodknhnounkknxhxoxggxxnwownngnnnxdunohnhukhhohdxognngxguxhwgxxuowuxkgxxukxuknnooonwxnudwwwdgkwdndkdknhgkkhxdowhguhkdxghgxkguuxkwddouhudgungkgghxguknwdguwooknxwouoonghdogokooxhkouwhdkdugnhugxddkdkwoxngdghhuugoodwkhdnxnggkknuhonkhodnwgkxdwkwxdnnuoxoukwxnudwgdunudoowuuxwuogwwwwdwxghxuwundouuukhgwkoxnknwwuokhonnwoogwhdgnggwkndhwxkkddugoxngggoohdxuhgwgxhhknnxdngdgxkwwhkwuhhouudnhnxwnxhgnohwhnonhhhkoouugggnhkdnxudxdddhnhwxndndxdowuduguugwhnnnhdodddwhodxxwunkdokxhwxwnohoxoxknwdxdknwkndundxkuwxxwkooknxuhnwugugkddhunxuwnghwnxoxhwuwkondugggkdghhoouwunddnnnduwoxudodxhhkhowuodxonkgukxhxhkxwxwhoxudungokuduxhwhwuhxwnkoxnnxgwuxnxdgdgkoghxduowdouoxodwhdxhgwguwknkoxxnkwwgxkkuooogkukhudduxdoukdhowxdgkwwhgxnugwhgwuohgdkwookgxgowohwuhwouwxguxhuxxwwdgguohowkkdgnnkondxwwnwnxkwoduxowuonhwdoxgnhdduhogkguwkwgkdxxxduwokkougkkkohwdhhghwkwxnwkuouhuwwuxokduwonowuxwkhhkwnoowgwwuhddxoduwoukwxnwnoudxuhdwoduxoxhhxwnukhgggwhoknunkkkuwdoownkggkuuxkdhwddugxgxxhodkkoohukgxonwowwuhowxwhgwkxdhnngkuwkxuhgoouonnugwkgdwkoxuwxdodnguoxunkdddokxndnnwnoxwuxudkhdddwndkxxwdgnhgukxonguxuxhddukndhxddnnxdxgxghkdwhkwxhwdxodowoudognxxguoxoohxnhnhgowxkgokwdnxuuxwoduxudunuwuhxuxwhdkdhugkgngxghugnungwukxnuogdhnuguxoukdgwdndhkwhhgxudnwhukuwdndknkwhgwnkgwwxuhugwoxununokouxkkkxdknnxwhxounuokndghgknunoxkuhukuukgohhwdooghokunnwknwhoonndogdudukwhuwwhhxdkgnnuhkgdhognuoggwkuhuhnwxkhokhuxungggwudkuxwkkkwhwnxhnggxuxgdhongwxwngohodxkwhoongunhduhxkhxhkgghuuwodownnduwxwdxhoououhxwowwwouougnoxognonugodowkxohwhundkohhkoxdgkhkukngwxxnduukgonhddxukxoohuooukhkugdxuonxoxuoddouwguhkgddhoxkxhdxognohwgwnuduwxduxxxgwwdwgoknuwxugoxhogxohhhgnxgongdkkkhghuhhwhkkuxokdwkkxoghkkuonkndknnhgdunowuxxddwnkxghhnowkhkxwgkuoonkndgohxhunhnknwudxkoknwgnkhdowdnwhkwdokwwnhkoghnxxokoodohxhkhxwxhgoudogohgdwnkxxxoknohddugkhudoudxhhhwdgnoohggdkxugnkuhodxknnoogdwkkhdkhwuokkdkdxnkudxwodwudxwdhhgnhxxdggonohuknxogndwxugnuonuuukxgoggdnuhogxwoggdxdwgogxghkdxnwgudogndhxwgwogokwogngddkxunugwnxghowukkkxdwhgunokkkkdhuogxxwnkgouuhkknhnnokunuougnwwgkkkxnkkhugkwukouohguguhunwhkukuowhkooknwuguduhhxgkkuhgkxuxouknouhxkxddduhgnwkxddngwggdguggxogndnhwuxouonkhndxwkngkgoukonukwgxdddxwgkkoghxhkouxkghnnodxhowhduwdunwunduddkdhguhhukghgxuwoddkxounnoxxxxhwhdkuhokwxodnonxohuxnnguuwnkohwnondhuonkdxnxuugodogohnkxugunxdundwughdxnghuougdxhgdhwxxxhughxonnoonhkwohdoxnhxwuogxunwnngnxghowonhxugdgxkwoghddgxdxhhdhkhwwgkgxkwwwgdghxdhhhhgkgxgokuwuhoxxxxhukknunnknogowdwxhkxnkdnxgkunggdhoukwdxwgxkdnhkuwwnngudkwduwuduwkxwnhonwdknkhowkddhowkhonwoudnkkxkugowhdwhnkodohxxgdowoknhkkkhddokohhwknwdghokwxuohwgokondunnggnnuuxgghddghhndnkhgkododgkkghuoggduoxowwxudhwhguxogkxknhhnogxkngwxoxkxudwxwhkhdunkungodhkuhgxdookhwxnkdundwogxgwhnxunhugkhkdhgwndxooxhwhhukugkuwonhxwdwghnxnkhxwwuhnhuhxkoukghknnowhnkhgnuuwgkkgodgkggnkugnwxodhndwhwwokhonukwgkknuuohugdnkuhwnhnddghnghkdonddokwdnodhkdokgukhdnhndkgdhhdhdggunhgnnhdnuxkghghnhdnudokhkuuhkdoxkuxnhgouhxohgnkhwhhxuhkhnudxhdxoungukkdghwwkhdookhghwoxxguduhnwhghxdnwnukukhgwkngkkxdxxwhwwdxokugghnkhdwodggwouuxodghuhuhuwxnkxghdnnhdokkwdkwhxwwxggkgxuxhkguounuhgwxwxohnuwodohgknnhuoxghuwnwdwkoowddnkxowggudxhwnwxhwxdhwgndxuddnkghowgukndnwkhkxnduhxhggkggnkowdongkonhhwnhuwugnhxwdhxxhugookuokxnkgnxhhxxxxhgxuowkgnxudhxdkddnhkkgwnkkuundodhxoouwdddwhghnnhnouxhdhhhhndouuxngwogxkkxxkohdokxnuundkgkuxugngkdgnhukgwkhugwuuodkkdonnxxddhounnxowdwdkhkduukudoghhoxowdwkoduodwwhnuwnxhnwkddhgxhguxouwuodwxgodonguhuwhuuggkxkuhudonkknghkgudukkghuguuuxdhuunundkxdgxdkhxwxuukdddnwkwxkxndwwguuoouowuwuuuwwkhoxnhxugnnxxkowdohwxuxhgduouuugkwxoxokdgkhdwonkkxohdxogddwdnkkhgnuuoxnhwkgwuhonouugwhuddxxxddwddkhgoogwnnuxonuxooknuwnndhhuxwxnhwdouhnnnhnkkgoxwxwhxnkuknwhkgwdhkwguudwwxuownnnnhnkuhhwnghukxxuuunghxkouugohxuwxkdokxknknngogkuwhdkodgxowxggoxnghunhwgddwxogouoxnuhkhguwwuwkwkhnoxgxknuodhxwdxuxwxhukgnhdhgnuhxnwundonxukgwhknunhoxxkugdnxnduwuouhhuhunxhugddxukoowwwdwxwdwxgxogknwgwghdowokknokdgnguhukuguxkdxkduxghhndgodxuhugxdxudnddwgkunnknggwwwkxuhdxkxwnndwxxuxdnookdukkuowwwxdkugnhongdddhuddowwgudoohdhhxogwhxkodnwoduxdowwkoxwnkhdgduhwhnnnxxkoxnkowgkhnnnkgdnuxhxokgdunghxxnnhkkxoxgwuuwdgoodwwdukhondkhxwdhwdhxduookkkduhwukwgdxhwuukunhkdhhoxxhgkwuknouhwhxgxhwnxwudonhhokwkxgnohwwwkwwhnxhwxugghhukhddhhukukughuxoduknwgoouuknunhhuudgxowkggngxkxgkwkhdodkxgodgxkugwohxxgnwxkuwgxhknkgdhnkdouukuhnghhguxwwxggnohhgdowowwxohnwdgxhwonnghwwgnnuxukxunhdunhoogkooonukhdknuxxuughxuohhdxgxdxunnkhxdwwwongwxuuwkkwkxgohxhxuhkhkuoodwduohuwuguxnxunkodoguxoukwxxdogddwhowdwxgkugnhwhggkkwgwdkghoogokogunohdunkkhdhhxgwwhgoxkxuguxwkuhoughkhuhoudwuxxgwododkkdgowwguhxxhddnnoodouooxkgonhgxgknxhgnohwgwkkknhxnkdgukhkkxgnhoxnddgdgddghdhguduuhwwwdnggugkxggknnhodwwuuhwuhudddkxkxwdwgxwoownnwkgdwguwuxdunoknkkoxoxgwghxwkkwuhgxdoodxndugxnxdohouonhuxngouxdwwghwgnhwndoghndhxwxwduowgodxwuwguxhknwkkguuwkuudxdgdudwoouwwkwdkhgdudkgkoxgkkonuhxowgdudhkhnhxoxkggnnxoowwxxnwwgkggkhoduhuhxgkkgghokgohwxxkgngooduogwokodgknogxwhnhdhgogddkowgwxwdgoooodngkuuuhguoouudununwooxkguooudwkhnhkxoxxnkkwhguhonwhohxgnwkgxxnknunnndkwkkudouodwnguoxonwwodkngohgdknoognwongugouwohhgounnxnodnwnudnxndxokdwhhodxuknhxkxgowowooxoddhxkuhdxddgoknhgokungudgdudxkuowguhhdouhkggownwhhuxdnhuuxnhondddxwodxhhhxwwxkgkxoxkguxxhouugwxhgdknkhwhwgkugwgxuodohnugdguouuoohxxdndugonuhngkguhdhwkdkkdxxwhukokkgndkohudhgugxdxxuowuodhddhdwgukwwgxgghgxnowxwuhkonkudugwxhkhdwdddhwoonndgwugghudnkxwwkugwnwhnwohoukokxwxxhhxdoukgkgnnwxgunnhkkwnwhounoxgxkhdhhwkkhwwwngduwdnnoohxunhuuxooxwkddukouddnkgkwdgoxuxwuxwgudwxdhwxooxwdxdkhgnouxwnookkddgxndxggkwnxnwwkxdndkdknkhwunxooxhgdgddgxuowhgwudghonwdwghwdnxxgddoxxkkwodunoudowknokoduudkwwonxnxhngddnnhkxohgxxnooxwgxnwxhdgnwkhnhxoggkgdnduudxogkhxognkhxhudgwhugnghoognunnogukxoxnuxnduuxnwoxnhoohhwugdnohhxwxonuxohwhxhnungukudhxxddkugunonghwnohuwnxgxookkokooknuhnwukwnoxgxuwwkkwkkgduwwhkwwdogkwwghuguhxkuknnxwouwgnnkdououkxxxuodxxhxgxxuoxxkxwhhnddxhnnxnxukgggkdhhgxkwohnkowognhoxwoxxwnxxkkdguukuxuxgkwwohkndkognnnwhnnggdkuoxdxgddoxxkkodhwkdwhguwhgnukdddhddhknogwgdxxxwuuunhnkdwnkowxnhuhnohwhdxxdwxhdkgunwuwhonkugnxnokoxwnxgxdxnhkuwgngodwwhxhdhdkhwdkdugwkhdndoddxwdnudhnnxdunwddhxgokohxwghoxxuxkuoonkkhuwxungunnxwdgkxgoxhdwddddugnwungdghhxwkkhxgnuoonwnonugkwuhkdwxwwxwkkhkoowodngnhxungxnuhxuookhwdoouuonkxuwohwdnkoxkxxhxwnkdwoxxgoxkxxuwnhxnndguowduuoxwwuhnwnhkohnwuggukwnhunoonnwkkghwkhuonuguohonkkoonkdwdhxhxxwuxgnkkwkonhnwhnwddnnnugxuuwdkddxhgkuooohnnkgxgohgxwghdwhddxwognnduhgxxxwgnouddhodooknnxgwdxdkdugugwduwdnguuxoogdgnhwnggkknodgxdwhdunnuuguwxxoxondnoohwxknxnohnnhhukoudowhnhdwudnwdknwghnngknknhxwdgghuowohdwukwnwoohgnxogdnunknonxkodkwodkkhnwhokkhdknokddnhunowkxdwnxkdowwxkhxhwndkoggnungnuggwxghkndnnnwdggdwkkkxwgnuogxohhnxhgooghdwnuwwgkgkggdohhgddwwgnuxnowgnuhwgdouxkkhdxkxuongwguwuoxdhkohnnoddkkgoonduogdgngkdhuwhugnuoknhhxxgwguwhhkuokwdwgwhgwnnxxnogouggngkgugdhhxkdkngghuwudodkxwnnkknuugnondodddwdxgxndgwkownonuuhuwuduuuxxhudududunuhgudwhungkkdwgugonnwwwkuxhxdgoxnnoouuwgnhddhuouuhdnnohhuuxhuudouokkndgxwhnxnxndnnkxkxkwdougdgknnuxhhnukkkxgnxhdudoudxdxgnkgkgnkwkuokgxokwnkkugkggoxkhhuxooxdwnwwonnkgwhwknudwkndgkwwnnwnuxuogoohwukdkhohxdwkdnkhduduhonnognuonkhdhwgdxxkuhhhhdundduwknhuouxuoukhngkodnkodonhwokdkxguwnknkwwuwdxkwxhokxkuwgxuhnudxhohxxgxuhkhwwookduhuggxuknwgukwkoknxgguddhnggonhgkxgdhxguhhhngkdxhondwwdgnwnnwdwuwkkhxdodwhkwkowxuuuuwgwondhoungwxuxggkodhkwkkwhgkkhuoxknudxukounoknuuuxwowwdogwuwdhnudwnnkwghdwhukhuuhhkngdhgxkgohngdxxgxuhugonooxkxoxxhwwnnoxwuhnxogdhgwgwhwwkoggnxnxgdhdwnwxgnouunugkdwohghwknkwnggudnddxkghggxwggoghghdwhdxownwkgdndxoowuwkndknohhnnkohuwkxunxhoxonuouhwhgugduohxgwnhxkhoxnxgnnhwgodnwwwhkkgududwgghdhnxwhhnugoxxodwkngnwkxhghnuwxwhxggdkuhowwgkhxknunonguodugownnghuowwunouwuwwdogwghnokohowghdkhwxkgnxguhxwkgkwknkuxgkxgooxxodkxoohxkdokdkxnkwxngdkduhwwxkxnwwnkdkxgwkkxgwodnoondghnokwuwndxouhoogndkxxxuokunuudxowudnhkkhnddokxoxhnouwnxwnodokkduuuxkwuoxwgdkgwhhhwxugxguwgghxhkhkuugnhnwkhnwxnxdxdhhgxxkoxxuuwohoogukxgwdokogkxdghohuxnnuhhxggdoduowwgwouwnukhxwgoxuddukwxhxhooxuhkhnuohudhgdxgxngdgkogguokdkkwkgukxuxkouwunodggkdoxowxohxxknkohdgxwkwokdnkndgduwnnxkhknuwhoowuunwgxghwnnhodhdwnuhwokghuddunuhwkgdwxgwnuowgxddgughkwkdugoougnxkokndxuhdugghhggkkhnxxkxndnnhggnhnwnnndkwkudghwohwkudxuxuwxxuhokhdxugwhdwkkunwuknxkuugxokowodhdwgxwngoghkwkokdhdgnhnxnnnwuondowxgkhwxxuuwhdnodugooduxgxgghxhooxnwkowhgugkunxgxouxhnuduuwohxdhhxkhxuunugkdongdghnxwknnuouoohguhdggxgnkuwounwwkdgkkhhdwxhgowuoxdgoonxxngnhhhdudxgkdoowxkuwkgwwowndugkuhuuddnuxhnwxxhohwkuoghgonhkuohxdndnhkwuwudouuuunxnhwouhdohgdodwddddoxuhdwuxnnuxwwxwgwwnoonouxgwknxhnhxoungngdogukhxwuwnnhxowgggdnndgwgnxwuukxwgnxgowwokxnkgkowuwgnhgdkowxhonghgwungwguggonkhwhnouohohnhxkwwunkhuunhkhuddgxxgxkkggddxoxkghgdhougwnwhwnkhonhxhoknwnhxgguuwdhkhkhwowgxkwxknnkhnwkkxhhodgdgowdwgxddkouunounxgduxdknnnhunxgogxhdgughowxwndhxwhxkwwkkgxgoohgnxxnuxkkndndnugkuddgouoghokkgdundhouunxhudgwknhwonuukgdwowhwonngwnognuuguogwukdxokhwdknhwwhudnnuxxkhuoonhunndowuxhghwdhhkdonnhxdkkgkxwnkungxkwhkoxxdhhwwunndnxhxndonxngnohkouuxuxwdgwhnknwunoodgnwgkkuhuuwwhnguhdonhwkhxknuwwkodxnukuuohxkwxxgxuxuxknoukxoondkuwdhuknonuohkwuuhkkknnhggghggkdkkwkxuouuuhgouwhgndunoogxukgougwxdwxxdguhdkhoxxhxukdxuxxwuwkxxkkwndwoouuhgkwhhnxnxwonhhhdwhkxddoguhudghohuhxhoowhxkwwkowgkuwnxgxxughgxuugnunghkdkowkkugowxdxouundxnwwundoogdxxhokknhdxkhnudxuxdnguonugduwgwwngwowodkgwuxhxouhnkugnnuxdxonunxdxgnknuhwwuuhkghgkdwkowkxnundgundgdndkkxogkgddnunxodndxkhdkdkxwwgohgkwdnwkwgwxhudxxunnwudhudwxkwnuoxgdhuguwxnhokwdndxhdwondxhoxwggwgxxhngxnhhwxxxxnhwugnwhkgonuguuhuwxhwudkkghwdwuougxwknnwnxdwdonkhwgghghhnkuuuhgkuuggouhdhnonwgdnxgkkkwuuhwwdngnowundwxhxgxuhgwggouwxdwhdhguokunodudkhdhugxxuhgunogohwnonwduxguoudgwwhgndugkwhhuhdkuwkuhughdkkwuuhukgonuhnkudoghdkhgugowgnhghwonwdoggnohgukwoonuuhxhokgwwwhkgddxnwkdxonkdxdhgwwnguukouugokuknhunwwxunhngwdxudxkdgunxxdgoowudddkkndknxukhkhhddggghunhdxwunonoundgwkwhggkwuohuungooknnoukhuooohkkdxddddhnguookuwgdudnwkhkooddkdkwxwuowwgdgkdwgkunxwgoohuxukddkxnoukdhwxnwnwgkowkxkhhkohxuwnognhdoognxnkwkwodhdogxdgnwwhugxudgwdogokxnhwoonkhdnwxkduokggdgunkndxgugdknonxwnokdkdknokdhgudugnnwondxhxnokhddouhuwhwwwoxhguxoudngnhgudgkhhxhkxgowwwwwxnxxkdkhdguxwuugugguwghggnxgouowwkhuwxduhxguwudkwugxwgoohxoxkgughkdwguuuoohwunnnukundghoxgoohuhdgddoogugndxgdxgkwguwxnuhhnnxxoxnwkkdowkuooodoohgnnwndgxwdxxkognohoggogouxokhkxoxukkoowghhnwuokouxhkdkggkgxkdxwdxhwwkghuxwdgwkukxnhkxknnnxggxdgwwxuuxggkonhdgdkhuwnnnhuhugkuhnoxdngwghnhxhnhhghxuddukkkxokwwkgggdgunnkxkghungnwdxnhwnxgdwxwngugnkkxwhdudxkoudgukkdggnokwugxudwddgduxxuwudhnhuwudohunuoxhdkxkuwhowwwouoxuwunxoonwnwnonugdoxknnghnhgnowhguukwddxwddkkokuxohohwooxhdnwwuwnxxkuhhuhxwduuoknndngxdkokkhnudwdkguxnxdwoknhxkkunhxxxwkwodhuowdunxnouwxuonkxgdghgognuknwxgxhkoonugukhdxwokhwhuxukwwkugwxdhoghdnxuoudnkooxwwxodogodxoxngxkguxdkodguguhkoukddxdknkunoukxuwhkugxkuhdnghowdxhkngdxxnhowghddwkgwkuukgowdundouuowgdoxgowuuwhdxdwoddkdxgnnwdguudkkuhdudkdggwxgnxonduhugdwknwodkxwhkhgdodgxghonnkwuuhnhkxwggugwnuhdxhoxdgohukdunhguounnugddwkdkwndnudhxowdnndwhnohgnkgkguduohuhuhgnhohnokodwxwkndhhhnkxdwdokhnugkkunhdnwdnongkouhngdwgkwkhunnhkhgggodkhgxwhuudnndwxkhxgdunknoxuxwhnoxuudduondnowohwdwdhhnnonhuoodwnhwwkwwuxhwgkghonxnhnnxdgunwokhgxhudouookdxowgkunwuwudwhwhgwogkwnkuknukwowhxwkdnnxdwunxxnxhknkxgnxuwnghwgxguhoooxuxguhkxnnhodgwkxnuxkkwgwooxxgwdhgnudnoogkokwgkdwgogunwxgkuukxdnwdhnxghhgnxdougkhgxnkwudonkxhguhnkddwgnugkkwwgxwdhuhuxoxwngkdkwhhwgnkdhwknhdhoxxwnhuuwohohoukwuhnuwwduxwunwkxhodwkwxwxhdhgwxuhwgghxudnundddkgnndwnhnkgnuonwowwnxnkhnuhnxhguhudnndodxwdnnoxkxggkwokxxhonggwgdwgonwgxnknnxggnwuhgogooduokoxhgougkwduogwxgxgkuoohoddxwknkdghnnngkdokhhxxdgwoxndxdhhugxhdxguwuhxuwkwxkdgwkndhxxuoknxgkdngkddwwkkwduxwkwhuxnddunowhuukkghhkndgooxggkoooknkgxwxxkgdongohngwdkkgxnnowuxudoxdunoxdkhwgwuuonnwukhgdxhdkxhhkkgogxhdggxkhwxxxgkwgwkxnguhwwxoodnwdkuhdxddduggdwodgkdwowunhguggdowkhkhghdunwwxhxgdugonhhnoxdouudnnkuhgxwudkhwdgwdnxhxdoduhgdohwxddgwxghxkundkoxdgngdwounuhdoxwukwxnwohdudgwgoduwwhdxwwhdhwnkwdxkknxxhwkkxoxknwguduonwxdunngxuxuxonhkhwxnxkoghnhohxwgnkxkkdndgdkwwhghxdgkowwxxnwkxhgdkwnhwokkxgndgkwdkwknghhuonuddngwdhgukngokxwxxdnddwwguknwudguwkdnukwuhghuhudkdxkxwkdoonuhuoodunnuxxuokkohkdgudgnndxhwowoxunouwndownuouukkxwhkoouxuxgnuwodnuuhgnkwwxwohdggnuougwxgngghkonuhwdhhknhguowwhuoxuwohghgkxudxwuuogwgggnnuuooohnoxghounokwonhwdhkownghhouuuxodhddwknghuxkohhwwwhnxdxunhwxwnkndxkgnuhxuhugdxwkxogguhogguxxxhwnxnwgowxwggxdwuwgwxxhgxuxxguxgdddkukdduuhhokkxxkuwuknwwhwdxoxdxongxkoownnnxnodxkwxnokgkwhwkhdkknhxwwxokhwkohhuwknnkdonnwohgngngkxwuonwuuhdwkukwdnhxgngdwkhknwhgxhhxhuwxdxdhdwxxngwndwxdkxkkkdhnohduxnkwgnnwkhuoghoxonuuwgknhudxwwhkwwukwhnwxxxkxwwnwnuuxudhundnxwxxkudghwwkhxugdkkdhwndkukhuxhnxwohwgxuuuwngdknuhuhdnhwxhkogodowhwkohuhwuoxugkhdnkuwokuwhwxuxnggknnuxnunohxugdugguhukuhoohuxuooknkkndgknukhkdnxohodxokxhdxuukgwxghuxwhwhuuodngughdkgohoghhwhhkdwodxuhonxwongxgxdkxkwhgkdgdkxxhxxhuooguuxouxhhudhuxondougounhdodxhugnuuhgddkkkhxhnodonxkuddwgnhhhnuooxgnoxdouxokkuhxdnkugwwwxkggwudxnudwkwnxdxunuhgwunxwhhwounddxkokhokkguwooxuwgnkknhkuoddkohodgxxggnkdxhuugxwouxnkwxdwkxogkuwdnwuhnwdxwgxhokxgnhgoghhnxhhdxowdohoodnugwwhhooxddxxkxddxowknuuukooowouoohhdduxonhxgkukhkukgdonhdhnxdkungoghkgduwnohwwwkhoxnukugnxxhhnoxkodokonnwguhgdwugdxdnxdxxgxxuhgundnnunwohuwdgkkkdgokgudghddhggkuddudowohhknhwxkxgoknoxgndkwokdwkwuwhxudhhnognoxkwgnowwndwwwohxhkggggkokhuhuhwwhnhkuuxwgxgxnxwndwwwdxwddgowdnxknxwhugugnghhwkknhugwoddknudwxgkhnhnxddkwxwuwnnhooguudwhohknwwuoddokdxdouwgndknugxoxuwoonwwunuokgokddgdwdouxodkddxghgkdguoggxnwxhnxdnugnwkwoxxdwxndgxudhkowxghghnxoukxwndgwkddkkxnkoxdwudgkggxhwkkgxgkgwohnxkgnugguunwkdhgowxdxnhwnnhuddnunhwwkhwkwxdxhudkwouduhxduxddkkdounhuddudokkhdndokonwghwudwukogouoohhnhdndxunxnxhkudnwowggxgxdkghnhxxgduwndunggkxdduodugkundhxnwugxuwnuxdxdknoukdhouxhxwokwugddooudunkghnwdxggxwgkdhnwgnwonhuokwnggnxhnnggngkwohhhnhnxkdxuhggnnoxddkwdhnnoudohuuuooukdodxdgxoxghkhkxgodonununokgnuwodkdhouodondnwkoxuugxwwgugoxxggghgxduudkkxnouxhudhnoxuwwudxdxdngndwnnxhunkxxodknuxxnokhgxxokwndghknowdwwhgddkogdhhogkxwdouoxnuxhdokhxdwghwnnkngkodngokguohhwhgdwdngoogdggxkoghhhuwgguwxnnguwonodkodkghwknokhxhwkwhxxounhkkoxuxnxnnohowxgwooxwgwuhwnwhouxxgoxnnhwnokgnhhhhhhdkxudnhdkwonxdoghngkgohdnoggnxogwxdohwgduhouuxkugghkdunnhnougohgdwgnkxhhhoknwndhgxnokwnguuxunndxkkhwwownxwdxgdghwknnhhwowxxngddxdxxkwxoxohxdgdugdwwwxnoungwhnuwgxxgugndxggnnwudxgwwknouogduugwdkhkkgunnukhddgkwkugxdhuduuhgddwxkhdhdwdhnhukhkodkuhgdodwookwgwndkodnhhonguuuxddhxnhxndnwdogwowowkgggoxngwwhddwnouwnnwkoxgxhkwnkndohdoognuwdxonhxwudkkkouxwowxkwdgunwwuxxhnwwhunhddhkdxhhndggkuhghgdnwooknnguwwxknxdhxugooguooggdkxudoduwgxgngdhooogookhknhwdkxukuhoouxgdnxunxkgwxxkxgunukugwwghhuddwuxkkoowdkxdnxuwodxdkkuhddwnxkgxnkngxgdhnoxnhokkdnngnhhougwdwdkgonowxhukkxxgdkxodnukddxunxdkkxwwhnuwodddhhkunhuoodooonnwkgwhxwdwhkduhdwugondkkdndgndnhukdwxdxukunkoggnduohxuuhngugdooguknwndonnkudkgxndokhxhuhwwduwnuuhhwgwugghwnnhuhkdnwhnwdkwhudwnuknxdkwxdddwhgghhgoxowhogdnonnnohkxwgkddnnhxxxknwnuoxgdwwnxddgguxwugguxhxhxkgkwowwwhdxuuogwondnooodxunongnudoghkdgnxukhdodooxuowkkhkxduudwkowkkxooowkxnhxhowdkuunnnnuknxkkhoxdhoounwdogngdukooknouhxddnghonugxdohhhdwuhkuwdooohkdxgxwhxgowgdkgdknwhkgkhgnohgogowhxxhuknnwwugnuwoxndhkkxhdxnxhxkxgnououxukhokghudxogdwodouhookudxnhkkxhdxuhhohohgxhxuwnnngnknuwhuuwdxoxodxoxwohkowxwunxnknudwgwddxnhowowxkghhunoxunkuxgwwwdkxghudnnoxuwnhhggndoohdoknudgxxwungdnnxkohdukxuddwuunkdoxwhwdknouwhghhxhnnogxhwgghwhokdxwwdnkkhxgkduxokhdxgwggugddxknxokgwkddokoxxxwxghwgdugkwnonuxggounnwoxuuwgxonunndowokknhoduudooxnogdwwhungunwwnoxhuhuxddxwudkndwnwgunngwugnhgwnhoknnkwuuknkodhdwuxgkkwkxuoxohwxkonhnhoudkukoxhnhnoxohoughoudxoduodghgwogkkgdwkhnudghdwnwdugohohowwkohkgnguhwwgouxohhwguuhudxhgdxgondnuuwuduowxwhgndwgdowwnudhnddwughhxdodhgkdxuuunughhhohnkuowkggghudkgnwxgwddodxhxxgduuduouguhxkxugugxugknownnhxuxuwodddkxxkwoukuwugodhwxkdkgwwdonggkxxonnkwkdgndxukhkwhgodknnuggkkoxdkwuwgnnwggnuounoxudhdndnoxodoxghkugwnggoukxhgxnnwgkwdhxwowwoxguwkkwguwkwkhddhuohuowhxwkngddnkggoxnnxgduhwwghundudouxoxokggkkohkuugxhnduxgoxxhxgoduwhnunxwhooxhhuokwuuuwwkwhdhokkdkxgnkdnghddknkodhnxgdododkwkgoudkgwknnokkkwdxknkkuduwudgkxgxuhxhhhdhuwwhgxuwwhhkoxkwxgnhkuxnddxnghkdxukwxxxuwnooxwxgwdknhkwdwxxxdxngxxnwunoggdxwngudnwhdhxhgxhwuddxuhkgohonuokgxwondoownngwhxwudknxhhwhkxdxnxdnhuhkkghohwdkoghghgxkuwxnodxnnwuwxxgnkwukkghnwwgnkxxgodkwgghdghdhgkuwwwkhudwwkuwnddkowdxwuwowxwoudunnuhuxogxgoknwwwwduukdgnowwwhgowgkhdwuxxhxhxkxdggxwkwxxhnkhwnughxnohogddukdknhgwhhgngnkndowkwwxggokukdkuggdxgwdnooddhnokoxxddudouxunxokhouhxwgwkggkhkuoonkwxohxodwkohhdongddduwkgkogdkxhgxhdgoguwnkggudghhuxxxkhwnhduuhdgkndooddohkwwdkwunuuunudgukwgogxnkwhwdddoxghndohxohohkkkhgdnkodwnhkoxgogxdwxkgkkkddkdogghkdddgxxhdgxuohowuuodgkxhowdgwkwwkududkokdwokndwuxooxhukkwxxuwonxhgndkhhwwuhgkdduxxwhdnxwhgwkkudowxxokukxdwkwwxxndwwkhxgwunonxohuxwnxgkdxhoduhhhwnhhkgkdugwkdougggknowkddgkodkgooooghgnghudogdhdoonxnonuxguwwoohwunnoxgonnnokddhuddgnkxxhkdkwnkgxuogkgxwxonddngwdwwnduxkougxhhxxukdugwxhoxhxkuxonondkuxuxhgnndnkowwuxodwxgwodnnnwxnghhwkokxwgxuxhhngxhxxggugwddxgxuxxhhuhxgooowdoduwnndknkhnxgogwnxgkggnohnunkggkdwdwnkhxdukgdnxgouunogwxnknuwwddknnouodohknoxxuuxngxonukxgoxwkwwkuwwkuwokhohdkgnudwuhouwdhnonnowxwuhxxduhxokouwwukgdxkxonuxuouxnuhxxwnudkuohuknggunokwdoogwkghkwhhnkudkkddnwhhdhkdxdxwdugxoogxuonghwdnhoxnxgohkgkgxkxxugunhgkgohddodkwugwkwknkndxknkhgxwgkudkxxggugxudkhhdnwughdnwxwohwwknhwowgwkuhxxhuxunwhkwgddouukxukngnuwnoduxwnxuundddnnokkowwddgwxkodgonodhxnnoxnwwdwhnhwdoxuwhgoxdhouowwhkxgukonuhgdnxhnxnuhnghkndwdukkhgwdnkxwwndgkdukwkhoowgdkkuugnhkdhkogghuxwuhokhugnuhdxnkoudkohogwggnoohnkxuxxkuoggnghduxnkuhgkxkxdnhkwxuxxwhwxuxkndugunguhondkkououxdxuhdknwugnnwwkogdknduuuuxhgudhouduoxdddhoxdxnxogowdwwuokhkgxhkduhndwondwgnonxuggdddwoghnkkhhhohgnkhxwohgnogokwgnxuxduudhnddondounhunuuwnkxhuxhkukknhwhkxhdnkdokgwwwgwdkogguuogxgwxhuuohxdokxkwnowhuukuoxnnnknnddnxgwhxhwgnoogunkggodkudohhwududgowuuuwuwwnunhwgwwhuunuxwduxoxhnknuxxnkxoodnougoxnhhhnkdggwghkwkxgxhkgdwwddggnkhkodhhwxkouwudunohhowddhxugogwoduuudhhhngkuxuowuokhxnxkwnuuuudgxuuuwxowknoggndukugohowhoxhddwxgokkkugggnhhkwxxxhhuxknhhkhhuwdwggkughwhwudgoxkkhhnxgnooougnwkdgwwuuohhkkkdodowgxukkodxxgnuoddgwuxdwoxwkgkoduddnnwuhxnukwowkoooxonkuuuxhukukkoddhnnuhxnuwxdxdddwxdkwokuduugugudhkhdxddkwodokgdondxuuhgduowwokuwwdnhduonoxduoxxnxknkougkxkuhgnwowunnxooggxhudohuhxnogkxdkghdnwudoooookwhkknxxdxddkghukkkkxxunouohkxhngkudguhdhugdnwhuuwonuwuwgdoxwdkkxwgdhugunogghhgwkwuxdukoukwookhuhwkwdkguwuggdxkokwkkhgdgukkggoxdugnwodhndgnwdohgdhuhukxdwnhgngukhnwkgkdohhdkngkwxnudxudgooxnwndkooukhwnuwxnxdoukhwxuouuxuuxddhwnowuxgkxwodxokgwgoodnoxdugwuuugxngkkkkddxgkgdkwxwukkwwwuknkwuudndghdhxuognxudnhkxoxgwdouxowwwxwoodnkghunkxwwookkungkkkuwwggwgdhxnddkkudgdokgounnkgxhkhxogxkdgwggnunkooudgwhdnoundxnunwuwnudkuxkkwgwdkonuwkudgdnnwxooongohnwhgwoukokunounnghndhhkwdwdxknnngkgxdhnhxxononxkxgxnxnxnnukdxwhxdnwgxgugkwhwuoxxkonundogowuknhoxkwgdkdgxxdgowkggwuhnknuxdoxkwnuwdughdgdnugdkwukooxwuxghxnxuuxdkuodwxuxkwhxxhdhoukhhgnukwuwngxxduwhhokwdonwhoxkuxudxgnnhgnuwhwgnxgxkoggdxxdnnxxwukuhhowwkukkkwkhndgonxdudxuhukwnugknnkwuonxxuuuohnndkgxwngnxwnghxnknoodhwnuwhwkxkuwwkgwxwhdwwdgndxoxognkngoxxuuwouwgwnhnuogxhkdnngokxggwgdnhnwnddgkohnxuuhokodoookkdkkkdugxokkuhwudgxhkkgxohuwdguohoxudwnuxoughhudhxonkwkxxouxhhngguhonguhkdkgwwwxghngohuonkohkhndggunoggxgxohgkudunoxogdhokndondokodogwdxxgnwxouokuhghxkwoduhndhgwoogxkhuxonkdnnokdhghxwdwonxngdhnhuugdokgnwhnougguhduowxugwuxxdhkuugdgddnkduoxhkonnwkxdwwgkhdnkwguxoxookouwhuxukodnndonwgwhhodukxdghknxxudxngndxukownndwgodudduuhogogdwxowxxxdogguwnohghhwonxuwohhkgxodxxwxhhhoowgugxxkddundknxkwguhxxxhoghooddguduwwhxkokngwunxxwkkwxoxggodwnuugoxwnghdggukwoxokhxunononddxxdhwoohgdondungngdxdgohdxxodghohnhdgghhuwnhggwdgkxonnxkdkhwnnwxddkwhndkhwkhxdogwohhdhoudxxwgogxuoxxkkwnwoguggdxkoxwonxghgkoxwogggxdwddhkognuxohndwuhdouownwoxokhuhggxgukwxghokhkgugukdxukddwdohgogkwgnuhxunkknugkxunggdhxhnuukonokhnuogxwoohhuowdononuxwwngwkxdkuxxggknwknwhwggowoxdwhwdndxkhhuuuwgooxhkgkugdghuhdwgonxwouwoxunkxuuxuhhdhxwhgkdognhgkwhdhwnwnhoddgknunddkwnohkowxknowguonokuukukdhxxghkxgdxwundhuhwhdhkxwgguxkwhookxnudokwnnwkdhdddguduuhnxohhhnuoxoxnuknxkxwxwuhwguudnowkgxonxdwkhxwhoxkdoohokgwguuwogwxxukkngwxudgdhuxogwuhxwnkddogkdnuhduxukdkukkhoxnknoghwwdnhdnnouudkgnxwwnonuhgowwuxwhddunonhohouugunnhxxdoouwkhouxkdnohgohxkowguuxugknkkuhxhhdnghdnkhdkxwgkndugdnhngnwududogwnuwkxhhgwookuuwxouwkgougouxoxuwudxwdwuwdwddxdogwouokudxnwguxuwouwhownxxnxnwghkdxxknhdondhkxugkhkohhxogxnnwuwgnxdhhwnnxodxgdudxuwugddodkdwunudhxxhndhoxgukhudhunnkwndgudokgdundwguddxkhnxxgoddwdwgwdxkdnxoddxxxkxxhoukdohwnhdwgongouohdxhdkkowdohhknnnduwhwgwdhwgkgoowwukhxuuhnxodxxkggugnodoohowhuunoghuxndwuhnnukdwhouokukwhwxdkohkghodgdugdudxngnwngkxnxndoxgodxkdwuwxoondnhkdwndogodhgoukohwnnoxwuduwwhwkddkoguxwhngxugwhhwwwohkwnohwugugnkogwdxxxnxuxhxgnnkkunwhnkndhxgknwduxghkkwngwuodkogdugwgwhkxgkonhxdxwwduxunnkhngdhnkhnwhuoxkxkkgwohdgduxgggodxwgokokxwuxnnkwwggudhxhokuxowdwgxxxgwnwnnonoukownowukdxxdunxuwnndunohnnhdwunkukkkkonhuxhuhngdngdnuxkuwhhgwuoouxkddkowhdkkknwodgwhhkdnnoggxuxhuonogxoxhhokhhnxxxgdhhduudunkukghdxudghxkuwxhgxwdhuhgodddwguhguukwnoukndnknoxxnngkodwodnndhdddnuwxoohduhdnndkwhwnnnooguuhhuohkwwwgoghooxkkxdxwxnoxwwhhuxgwxdgwuxgkxkdooguwwhkxuwuuwxhhdoxugwxwuxudknwxgngghxndgxddwuohxhxhukohohwghwowxhwwwokghxwgkddghxhkwuwuxuudgdnxxgkgukgxuuuunkwhukxwwoxdokkukhkunwwndxnnkdkddwgknwouknwdwokgukunwuxokwxoghuknuooodduwknkgguwuugwghxhnxdohddnukohuxghxduhhudxgwunohuxgnhuodgwdkuhonkhonxhndwndudkwwdnxghdghgddoouxxoghwguxkokxduoooduukgwkxuhwhuuwxxgohhxgkkwkwxxhkwonwuuxdoonhkwwwxddkknwwnhknwxdohunkudkwwwohwudguguxoungudoxuoukguoknudnxdgkduxgkokdguxwnhookwkxggxdxxkdhxodnkuhwkkwdhxnnoxxdohndokwxwxnkuxoduuwkghkddhxhhuoohdoddwkggkxohgngnoghxghnxowhkgnhhkgnxnkkxkdogunkxxnxxggoohndudokgxunnddknuuxuoghdgunxnhgnxoxkugxgxowgwxuxundxnhdokuxoxwxuouhhuwdonwnodonghwwwxoddhxhwwkuhdhoxdondnwxggguwkokknkkdgdkghkhoxnkdxokwnwwndgooxgdookunnhkwxhwxxdoxoxhhdhwgnwwkxuxhgdxwugxwgogghonndguwwkwhdghnxwghhgnowggwhoxndnunohhkxwuwxwukoouuuokonnghhxnuhhwkgxoknknoxhdghnddgxhdnoknnodwkhdounohundnhggnugnkkxungkudhdxwxngkwokuudkuwgnxhwwohudduwhwwgkwuddxhnnhdxkkunoukohggwgdhoukhhdnxdkohkooodnknxkghxohghwudxugukgkodddnxoddhgkgknudwoouukgnxdukduxgogkudwuwkhhuhdwwddnxhwnnhkukokwdwuhxoddoognuoduxkdhddgowuhdwowhuxogodkwhnduoukoukkgwoxnknuukdknohdondgogxxwowhudnkownnohxohoudkxwgxhgkhxwwnxgddduhxuxuoxxwhwwxwwhkgdnhonhkoohgkxghodkdgouhouhnhdoddngddduwhghgdgdoddwonghgowhwwnukdndnknkwoxgxdkgoxddxxhgwkwhxgxkugnhuwuxonnogkwkuwhgwgugnnhdkkkukdxxodkwuowkouhhxhokuxukhgnkhwhkwghgdngddunuwwudxnodgdukuoxwohduwwkxkndookxxnkudhdohhhowuohdxodduwggonuhnoxngudgxognunhoowdgwxgohdwxnowxdodddkohxkgowhuuugdwoxwwwwxhxkxonuggoouoknoxdnudnhgwguhxdkhhokougohouhhouguwkunkndgwouhgxhgudkoouuxouduukxongwoddugwgdxxhuukdgdudognuxhhgxonoknnnnnodgxokdouxhnnuwookwddxuguwdnwkoxnuuhhxkxkonnxhkogwgounhuwdwnxwuwxdgkkhdoxowdwhgdokdwdwndhdookwdkxukwgdxkwxkgnkogxwnwddwxgxuuwgdohdunxxudkknxogoukuwhuhxuwnwungggnknnxxhwduhxdonwoxhdkkhdukuuxkkgoxgnnxgkunnonkwxwgxdgddnwxguunxuxddoxxxudwoxngnhonhxndnukkkgnngggdknhkwhwownuoxoghuxggwgkxkhnkkxhdwxungdhkxkuxkdgkogknnhgguhgndkugnnkddwgnhgnkgkgxghnxdkwhdgdgongnnhdohwxdnhogdddhddndxdohhhhxnnohudnhkdxwugxwdoknogoouodhgdkxddukndonnndhhhggxunnudgkhgxnukgxxgdhokgnnoxhwnohodowkwkxukdkdxgnxnhghdwnkkkgduhxoxxwhxkxdkxhwodxokdhwggowdgxdxkxwuwoxxxuhgdgwdogwxkghwoxwhuwdhgogdunukoxhxownndxonuxoxnohwkhnxgxdkkdgnnnghkndnwudhduduudwwokhnxgknxknoghhghooudguwuwxhgkwkhnugduxouduxdwgdddnohhdhungknxhgxggwndwxxokhxwxggnhxgxgonhuogxwuxxggukogwgnnxggogdndghgwuohuokhnddkghnukgxuwuhuhuunxuhwkkhknkuhuuxogggxkguouxkwnogxdwwwxwwhxwgdhkdnhgnggowduwkdgnddwxngxdnuhuwougxgwwxouxggnkwunxgnxngounngokxkuwuhkkkonuwkuokhnxwwxwnuhkuwnnkxwwgdwogoxukgxgdxuxxgukxwwxdnndkwnuhkwgghhggnwhxxkowgnhowkhkgngwkdnddnughgdwuohuoudhdwwnhonxdxhkwouwowwxudwgnnudwxkukwgxwxguhhwohdoxkxkguhogxwwkxdhkgkwnhxkwxuhdnuuuhoohgwxhugugwugkxhxdnwndhxwngngxngdukwhhgonngnugkungwundoukgooxgguhgonoknnoxxwwhowdddoggukxwxkxwkwhkwugoxkwwxunxgdhdngwwknddxnxxoowwkgnkuknhuuoogwkwoogkkhokhwonhhxudkgowwgwguhdukwonwkuwkookgoxnhxghgwgxhhnkwgkokgkdwhkwwxugowkwxxwnuxhgkoxdondgdxukghwgdnhxuohowhnhdxwkxdhhukooggogxduhwndkgghoodonguxnnokkgwnwxdxnnoxkohghwkgouugouowhuuukwxngghwkhuunhdudxgxwwxxdhdxnnxogddnxuxxkuoodxdwnokhwhhknhxwkohwxuoddgxwkgxnhgwnkonoxnnnhwnokxnkuuggwoxgkuogokdhundgoodhnghgxdodwgunxghxguknxxhwwwkwhguudwhugxoohdwuwdnudkudnkgxkhghwgkxoxhwxxddnhkdxkhdoggnunddgonnghhuokxwowxhwkgwuoxxwkuwxhxkhwgonnuxdhdxhukodnguwxnowwnwnuongkunnkhdkouhoxkookndxkwwkwgoxdwkxkwkuxhhxwhnoukxgguddokgouxunohxooxunhhwxnowdwkohhnhwohggxnnwukogwxugxgwuhwkwgohhodokgdghuuuwkgdxwxnhdghghnhkoudwndnouwwunnxknwngdogghwudkdgwkxhwhkugxxngkwddhhgnndxduuhwwuhwouwokwhwxggkkkndkxhxoodkxnhwunghxndwxhdxwxwhnwxkokkuoohogxkwhdxxowkwgukdgxdhnkwuhxdouuwnwhukhonhdodgndgnndhooohxxdndoknddhnonouwnxundkdognnoknkxknwnxonnnkhkgdwdhwgoogwwwkxwdnunxuunhxddwghdgkodxnukoooddnghwugoxxguhdxouwgowdhwnkdxodnwnoddoxgwdouxngwounkwukxuodhuoxodhuhghgnnxxkgkndgwgogwkxxwdwkgnhwxuggwghdxdokuwwugoukodnkduohonnnkwdwgwkowdguxhggkdkknxuuwdnwxowgkxuwxddoxuudkwxhddnhnddhwkokuuuokdukxnnhgdnwxgwgdnddhghughwxhohuxhookgdknowxkghkxwwhgnhuugnxodhdghxwoxduoghwxxxdxdohwdodxwuuuhwdounduuwodwxugduhkunhdhnnwhnuxhhohohuoononnuwnohnukduwkxoudnhhxnnknxnhwxwdgwhdoodkugxkkxngkwunhngokkkonxuhgnhxghxoouhgnxowgngdowwnugwhoxghkkowuhwhnodgxdowdohokgdohohkngkxhnkugkknuhdgudddkkhwxhxkhwxddhhhhhdnuounkkukunwdwxhwxdhonxhggkghdnhnxxgngwxnhnoonxukwdguhuxnukkuhwoghdhhhogggnwghnhgxnwuhukonnkkgdxuhuwdhnxkkxdugdgugdxkxhwgguxugxxxokwdwwwhkhokdkxgowwuowkugnnhouunxdwxkhwwkgxgkgkwxoxnkhxnwwggdxowhxuukoguxkkuxhokuowggnknogxhnohgxxkokduxwuknhnunnwnggwwhhuwgkkxuunhxwkngdowwgdkudwhohohwgdxgnwndxdnugwxhhddxhudwhxxoxuhukkouodxuwowkwnwkokukhukddkhxuoduwhowwoxwwkwhndddduuuwuownkkkndhowkkuxnnowwhknkkgunwxndwwdkxhonxxgngonkngggkhukukgwkukxngohdxdhdxwukkkgoxxukuwhnxkhkxxgxxxoxwongwghxoxwxhodnhdxohwdgwkuuuudwxwnuhuwxognhxxnkkwodwxuxududxddxhgdhndougggxkwhdnnkogudnnhnxwxoxudghuhnhwukdkngdownukxdukkhxddgonghuuxwuukxngdokxhxwxdownudowogxuxhdxwdgoxdkxhuknkxhwwuokuwokkukonwhohnhdghkkknwnnhxuwhxgggunknnddgkxnkooxunnnhdnkwdwnhnxooxudgogukkowoudwgkwkxgnownxgonnnwuunnnwxhhguogndnukoxkduuhgoggookhuxdnhgxkodxdodhnwkwkdxodoxghnknguwdnudxnugghonnougnwkgwnhxndxdknknuwkwgnuondxgwkkdxnuhxkuugnhnuggwuudkgdwnhkkdonodxhudxnuughngwxongxdwuuhuhuhkwhndkuxhdhxokwgdwgdnudkkdwodwwukxgnudodkgxdohnoxhxdxxhngxgouwnwwxknwkkxhudhxxxxxwhhwgnuhuhudowkgkogxhkwdkooohgokwnxddugngkuokwxddwdodwdkuohhhngghnonduwuugduxxhhwohhuxowddgkwddhdhwgxxgkhogowokgknoxunkwkwnudnhxnwxguhhuwxkxhxhhowghgdxdkhxohnonhdowghkhxwxwwokwwgogohwondouwhwngghhgoukgukhdukoxkoouuwxwuuxgwnhoouoowokkoghwodkgwhogonnwgxkxndxdnkkwohwduwugugohddndwxuukuodggkkwngkwououxuuxxhwxuwhwdwdndwxhxhgdkxhxkxkundnguwgwkgnghgguwowkxddhoddgkuoxdxgxwgdudkhhdkwdwwkdkhhddgghwhukwogxouhogdgkowguokxwdhukgkkhnxgnuhxdnoghdhwhkdkhuudkuxkwgodgdnoudhhndowowgkhooukxwwgwwwodokxugdunogdddhnwxwwodkdnkwdknkxgkhhgdwoohuoouwdwoxgkkxwkxkhkguudhunoxxdwhngnhdduuuodkkxunoogoonxwxuwdoukohkxxwkhnwwoukgukukxxuuhkogxxxohgxxkodxwxwohhxgguxuudnuuxxwwhgggunonoxodhnggkoxudguuohxkkdgxwxghkgngwhodhuouwnkghhdggonkhwgdowwonuuwdodgoddgghwnhonnwkdnknxkodwhkoonwxxkggookkdxhokkxogugnoodwdkghgkxdkdgnodhgkkwgxuownwnwkukwuodwnnkownduhgdnnogxwuxkxnuoguuddunnwxknwouwwouxgnnkgggxgdxowhookxngdhnhoghuwwwukuouoogwgnkgxhdghogdwdogwwkkkgouwwdooknuwhkhxnngwxnwoggduxxgggwxwdghnkwnowdxuwhhgkkhhukwnhwkxgwhuhddxuwkougxuohuuggnnkdnnhwdhxhxhghuwwnkoudoogkwkwxgxonnkxokwkondgwgddxuwnxoowhwgnndkgnkdnkhdhdxnwuugwokouxkduddoxdkouwuhowxhdnxhogkgokwwxukgoowuukxghkdggghdwhghdggdxgwhndnddgoxkdnkdgwohhgokxnnghxnhwxndhxooduhuhgwdnwhuxkgnokwhkkdoxhwwxwooxuhxknwgohuuhghuhdnxoxggdhuxnhhwknwdhuougowguoxkgouuhghxngxhuoghgnhggxoknnnudxdnuonnwnwhwowwhohodhohhoxxnxkgwkkgxgwwkwwxwgohgwnwogggduwgognwhgnwouhnxgndoognxuhdghwxgnoxdnundokkonnuuhnohuhoggkdgoonhhdxgdhknkokddokoohuhxdgnugxxxouuhhhngowxwddhdkughukhugdghkwknnkwukgougnwxkgwhuhdhnhnwxoonhdwnhokukhhnuhxggnhhgwundkdxkxnuowxdgunkxkxukhnddggxxukwkwdonxwungukgkokghnognwgkwwoukouooohwxghowununohhoxhduwdnhwguhngohnuwuuukdgnudhduuxnuwguxnggkgghwdgkghwxooxuogodkunwnhxonnhuowuxukoouooxwhguknnxgngoowondudhkoxxkondnkohdodgunxukhnnggdhnxwdohnkduhgdxwhougkdxngddknddhngknxdndkxdwnghwhwuuxdkuxoxdookggkhoxknngnxxwdhdngukhhoxddgkuhndonwuhgkuwhhxwwhuunxdkwnxnohdkkhguuhhwdknnkuohxwohwduxxuxdnkxoxohxkkuwxxxdwxdkngdodgouxkouodhkohdwhuduwkoxwhkndhnxwgdxgkkxnkxkdgwnnhngddxwgnngudhodddwwukhgdgwgdwwhkndkxuxndnugxhhwknxngkuhxkgduookhnkkhnkhddugwhxwhndgugwhunkwxnuwhkuohugukxukdndowkownuuguxdnhgghwhnknwkuhwwndwkxgdhwdddnonoodhgkwwhnnonoooowxnhonkhowkxhxoxdhwgdndhhngunukudwxugnoxunwohwododgogguwkuuxkogxuwwkwghwxkxdwxodhnxkxkungdhogwndxxxhhgokokuuwgoguxgwxhookhxuohgwuwwgnohkhohgxgnhhdoddxhhdnxdkowudkxhgokddhhndudxxowgdudddxwdgguhgwukkuxgkhxuwxnknnoddnhdxukouhgxwhhnohddohxgnggxdnhwnuxhdwkuuodwxwohgugxudkkwnggudxdddwnxwhdngodnuukgngnxuhhuhxhhuuwghonnddwdhwngkownohkgxhnunkhgkohxugxddkhhnhognhogdgguwkuwkwgdugowhnhkdnhkggonwhwxudogugkkukgwkdudukdwkdhkxuuhhgwkhwuwkxkxwdwoounnoudunxgnxxwdwxhwnnuuoxwwxohuwhogngwhxxxggguxwdkwxhgunudoghgddhdwxdkxgxkkxghgdhhxxngkdhdxodgwkxwokodxogxokxowhuxwwdxwngohdxdokxwounxnuxxugouwddhnkdxdwwondkkuwdnduwxxnxnonhowwoogkuwowhugwdhdxhuhguoongddnonwdgxdxudnkhwxgdxdddxunwxuoukgdxwwkxkgnkkdhhuudgxugwghogdnxxkkuhduxunddunokuddduwowgohdkhwguooggnnudgkuhhoouuxnkdddowwkxhgduhwoxdkxoknknnxxuugddhogngduxhooxkdnodnndkgonoxxgxnndhdgoonxdokhonggwdhogukwknodowwdwnwnnnhokxwwuwnhkkdoooghkogxuoogxknknnngouhdhonnnnonwwhgknggggknonwunwgwwnxkdxughooghhxwxdwukddwdgkkouhoohwkhkkoxhkuuknhhnnxxnkudkxxwhdxuhhhkgnxhhhunxhxdukohukdhgnohhkgddwdhouugohwndwdoooonukuwkhnonnnhkkkdndoogkngnxkkxnxwggkodonxdhnguuudghngxgndnkoowdnkoognowkkuwondugnwonowgguggouxdkgowwxkohkdooghkhgnougnwxuhhxoxhxoghkggwdkwhxuggunogddhwkkngonnnunkoudondhowgddhwhuxhuhoxwuohngkdhgouhngdkxgodkdhoxxdkgougnxkgwxngdkoougkdkdhhwoxgxgknnkgwdxuunudxxxhkhxhhdxhwkdhhnkdownkhhkngxxnkgxhxowwdundkduddouugoxoogwddndghdwuuggonuwhwnuoxwuknonwxkwgwhkwxonxwnxgduduxgdkwughgooknghhhxggnhkhuxnhuughdhgggodxnxxkddwwgwggwhwgnwowdddkghunddwwdnoxdgoudgxhngxhhdxnunhgkowkhkuhuwwknhokwdggdxdkgxgudukdoxhwkwnndkknhxhhkwghnuxuukkkkgndwowuuunudxkdnoowkxddxhxnonhwduuwwkxoohwdgxkwhhowwoddxdhnwnnoouxxohdggghxdgdnokuookghgowuduuuhgnkugnuwhhkndxkdgguhdxdkduwndnkwwogwkxnhhxkuudogdwhhddxknuhuhdkddgogokuwhnoukwdgdwuuwxghnxungonuwukxkonhxxouohhdxwkkwnkwukxhoxgkoxwwddnnwouhogkkkwwudungknxxnnwgnoxxohkowxuwonoxdxxkwwnkdgdounxwxkxgdhnuohuudgwhxggdoukwukuokdxgwnnwhnohkodhonhggxwungxxkwxondgnhnngugxowxohddhohnhhdognnxwxgkwowxhgounddwoxowxxnndxgokhkhwhwuknuukxodwnwwuononhnkkngkxooxkdgdnhkhhuhkxnohkdndxkwwddxogdhuownounnnwkgkhddxkonnkxwnwxkwndxoxnxwwggdoohoxwwdwnkxgwdnhonkodgwogugwnuggxxhgwnxondowgnnnuxguhouuxxdogndkwoudduooxuhhgwohhodkghkukgwgghohhuhxxxngxkddhggdogguxdnnwkhkxgxxhuxxhxunnxkhnohudkxxnxhgdhoudxhuwdndwonxhdunhwxoxuoudwhdhohuoudxdxnkdguouuwknhuokughdodnuhuuhkgxdwgnhgkxuwxgwuwguondkwkkhgwdxnggwdugogxdguoxhdndkxodnkuwdogdhkwuwwuwnhhwgwddhkowhxnnguuhdxkuuudkukuwugdkxgxugkkwogndwkkwoohhgdgwggkohonkhowogguuodxhwxxhdnwhnnhgknuogndhogduwogwowudhongxwwoughhwdxhhwownuhxnuowdwnxnndgnxkudhwdxnkonkogwhuohwnkwxuddgknnuhohnhguduonwkdguwohgdhkggkugunknxuhdhudguwkdodnogwnnhkwunugwudnxwnguohxuoukgkdhwhdwwnwnnkkhnhhgkdkwkhgnkhguhonnunkhdkxwuuxgkwkdnwngwkkgxhwkkhkdnnhwkooowondxhokoxgwwouhgogxgwdwxwkkknukgoxxndxonxgwowkuxkouuxuouggghxkowdugkxuxdkouwonhgwdnxwhddkhxxokkdgokwhuuhgonogdgugndunghgwwwdndwogxxuhxooknhukgkhuhnxhkkxdgxwwdwukhduhkwdgnkkkgwuhxongxnkudkwhgnguddhhuduudxwooxkdxowwdonwngngdhwddnnxodoxonxuwhwgghghndudgugogongwhxnxukhuhxxuhxnuuxgkudghdugwxgnkohdxghwwwouhkuxkodnuggxnhwohhxwnwgoonxdnhdkuxhkgkgdxwknogndkhdonnwkodnnxnnxnhkwwnwnugkdhnooogohxguxxunhxkwwhgogngukgoogddnhudxxudhdnudwogkunhnknnokkxgdungwwghndxkwkgdnwuhwkkdhuwxxgukwdnokdokdukkdxwgowkhhkwnhgghuugowuhuuokwxkdukuhonuuuwuwgknhnogwxdoogngowkxokghuokngudddoxxnghxxxxwnwugohgoghgdwduwowonoxwnxuoxdnxwkngxdnodkkuooguwnnkwxnkxgnxwhhdhwohunxdgxgxgdhgukouukxgxwuwxxoxdhhwgguowohuxnguhuxhunwdkkogoxkxwhhuonuhhhohnouwgkgdhkwhgnxwwwuunxwgxwwdggwwwwhgdxohknhxxkxokkxgkkgkwoxhnnxkkudognknxxhdghunnkwohudwxnhxowunkdkgwnkuggnnouhdhuodwohxxhdgoxngooxhwgwkxdggdnxgwukugddkdgnhwdhdodxxdkwhdxhwkokkhokhkohnodkwxgndgkkugxgdnxxhxuouhuwkddhokhgdwhwwxuknunghuknwdkggkohhuwxkduddhknhndkwnundxgguunwxdunuuwhxngogxudxwkxwhowngxkndkxuxwdnougukhwukxhwhonwnddnonkxongghxkounxuxkwkohgunwkhwggdkhouhxogwkxnkgnnxouuxwonowohgwxduwxnduhnwdoxohuwdduwhuwxwxnkoxkdogdwxhgdxowduhxxhgogokkwoguhxwdddwgkwdugnkdwdoouxukwndwxdwgwdwdnuuwgugxuxoudwdgkwngodogkdnoodxhdgndoohhwungguohwhhogwghguxxwknxoooohkhwudhgxdgkgougwxghguudondkdhkgkokogoduxghhuxhhkkxhuwhknkwxhonxdnwdunkgwhnhhdgnkwgknokdodxkkxoknkkguhogxnnhwwxwxnuhkdudnogdoghguogxhhuhxxudxwhnnwgxgudnwukwkxkuoowwxhknwkudodnkwuuodwhwknnohgwkghhuokwoxdukguxkowuggxnwdouwkokwuhowgnwuxkododhgkduhunhggkdgnwgdxgdukugxdnwgxkkdkxkonhknngkwwkhhnogkgudgdwuxwdxwkwnodooooonxoooodhhxkkwuxhhoonoxdwnnkwkguhonuouhhwowdwkghougxkdnhgdhnnkoonnunxguunoghgodknoonogwngunhhgwkhuxoogdxoddonodgnowgxxkxwwoghdnodkdxuoghwdduxkgdnunkgugknddhnhuxnndxhggoudwoohxgkdwoongnodgnwoddoonnuoonggnogukhwkohnwxghxhouxwghnwxuwuddngokhhgwdgndggxgodwnuhdkhoguhduuhgnwwdnddxkddwhdgkkkwukggnxghgxoduwxonuhouhhwgukknwudoxxooxnokogdxhnxgngdknggudngxguokundxhuduwuuogodndkhunohdnxduokudowggdduhgwuudgnxkkgnxxwogoxwxdxhwnuuggxkkhgkuonhnhkgxdwdkhhxugxhnxhunuxoowdgwndoonknoouhhoddhxduuohoggdwudghdxxonwdnnnoxugngkwnwwhwuxuwuhnngwknhunodnwgwowowouxuxokoxghgxdxnooxdowkdhhdkngndwudgghwokguwwnnngnkxgouoduhwwwgwxxhwwkhxhukuhghnnnuwwoxnnhgxkkkugxwkhdgxgoxudxnuhwnwgwdxgdokguwgnhdndoudduwxxggogwhuxxgunkoxkkkwdhnoxonkhxhnhggnhnwnkgnooddwuhkoogdkxkgkdohnudoodougwhkdxhxwdunngwxxnugxghddgukxhnungdwohndxdxxkuwhxgwodgoonowwkdggowhuxoxgwkxwuxkknghkxhunhkwhuodngxgghnowoguhuhdoxouohgkodnxngwwwuuoxwodughkxodowohguugoouddhkkuuxwxxnwndodhuondxxnnghkndhnwoggknoggxnohhwxuwdxddgukgnuddxgkxkwhwkohkxwogwhnxnxhnkxxhhwdddwhdwddowdhguhuggwnukuounndhdnkggkhogdwwwhxwhwhkwkhxdugnuouhxnowdodkhkgoxngxwuuohkwgxhwxkuhnnndhgdhuhuwukkgnhkgunxwogdnkndokdoxuxookwwhuouhuhnxwxnnkunuxdnwgndhndukgghggnukhxkhkokxwknodkkwwhonwhduwhonkdwwxnogndnggdwgnhnxnxognndwdhdwgxhggnhgkhokooguhxnnuwuguwghooukxhxgdndnguuxnwdkowguxnkhkkhxkuhhouhxxnxdnghwxkhwhkdohokundoddxknuhoghwdnuwhgowhooughonwoggdwdwdnwwgkgwxoudukwodwuxhnkhunhkudoodnuouoxouxnoxxodkdwkhuuxhhounokxnogwnhouxddowkodwuxgxkgxonxwnwxnuuowxunwggkxngkoxxxhuuhwonkwxougoxdoxnodkdxkwdwkkddhdonoxoxkuwxuxkuuxgoghgdwwndknnxwnxuuxkuohwxdgdhhwxgnwdwhwhkxodgwounounhuhkxnhghuhnkhkwugddkokugkwwukwhxohgudkxwuuukggghwkxnkowwnxdhuokodunnokxxddnkdwgnxnwuuxdoguhgnwxgnuowukxxdgkxggkwgwgnwxhwxxhnnnuxuhkxdughonghxngkunuodwxkkkhnhhuukxgowownxnxduwnkowwuwwugnhnwwkuhhwunghgdhgxxogokdxkgdoxhndnxhhnhhxxghdhguhowkuwudwkkdowukogunokkkhkwguxgngkxkhuoonuokkdoogdxoxduhhnnngwoknxgxxxuxxxwwnudghdnuwhguuuwxxnnuooxgwkuggowwhxnuxgoguoguoukdnoxggnkgugnhgnuwndxodhdnwkgdoxkhnwuokodnkhkhungwknghhxknwhghhhhwkunwuhdnohxonggxuhgwdkwogwhngnuwndwxhxdoooukxkgogknwodhkdoduddhuwognnkdnuudwoohkwwoduhuohxhdkxunhogwhdgwduxxgouoknuxwngdggkngononungdwhdxxkuogoodddkknhowggouddxnhknuxdkwgkukxxgxggwdhnkkghwdgowouhhkkddwdxduwxokunogghokukduodkdxkhxgwhhwhnxxhuuhgwnhxgxdkhuhugxngownxuhddwxgondkkghgwdgdngghwunknuuwgugdhdnkknodnonxkduduoxuknogodhdxnkkonuugdwhhoxggdoxhkxdhhxdugxggxnnwkuonxudwuxughuoudxguddgndxdkkwhhnxnxnwokwwhnkokgghnudwwkgkwgxookdxdhnwkoddhxgwuwhwkgdxdwkkukhohowhodowgkngxnxuoonhgwuhgndkknhdhhduudgugkgdhoondhghkugukunuuwgngwwdwxuuhknxuuogxxnnododgnkgwokhnhudhwwukodwghduwgukhwkwoughnnggudhhgwxdkkdnkhxhhwugduoouxuhuwongwnokkudnkkkokdhuxnoudkxkxugxghoxhghkwddunukhuonwgknounnuxxgududndohoonngoknwknhonxnxdgkwhguwwnuxgxgdhuhgkghwkoohnwnwuwkgxxkkdognukwuhkgowuwwxukgnugonkkwkkhxgwgnwndhodxooowodxohwggowhkxuxuwxnguuhnguhhxggxowwuxwwkdddwxugwwuwknxgowukxondkohgkddodnkknwhuhkouwxgxukdnddkuowuonouuokwkukonnhwnwxwwwwhwndxuxdkxxxdoogngugxxwudouxnxoddnhxukuduxnxwhxdgwuuhoghnwnwdgdxhdxgwgnwhguknowuhgwdxuuhuhgkhngdoohnondkndhhdxowxdxwhndhduuoddkwnnnokwukwwnxoguhxkgxoduxnnonwnouhohwdhkknkohdhgooghwduhxxgwdhowoduohhnunudunkgkxknnuokhwwohuhggunkuwunxkhknddunkoduonxokuhxuuukwuoxhuhxdnoggxggohdhggxukdnhkukugohoxdownkkhukuwndxxxugunwwnnhhwgkkuoddhnuokougwkughnxowonnhowgxngknhdwhgdnnwdhxndugdukoungwuonxuuuwghdxongwuxuwowwdokkooxkuoogoxoohhunohogkxdhnuudnkgdkgnghuwuuukungkkkgkhwgdwdogdngnwnxkuxxoogwkknhgukhxxwoxkoounuokdxnuwoonwhoxxdhkkxkngkdhkhhkkhkxuhxxgonokoxdoukunkgngxxunddkgnoxguowhoukokohwdnkwkwxhdkkowukuxkxkkgxwnkhdkonghnguguhogwwdghoggkxwnuduhodgdnxuwxknddnodwkxuxdwhknooxwoxgkkguhokwxououhdgowhxwounxdoduhoowxgohknwhxdgkuhhuhnuugnunogwghguwuggwogohgkgkwonnougdxggukodkdxgokhhgouwxugdwnguonkxgnkhonxxhgoughugkuxwkwngndxgwxxxkxkxghkdggxddnwdghukknduhdhndwuoknodduuonwnwwohuxwxxnhhuukwxwgoonugdhugoknnukxodwxdgxduwuhnhguhkgodudwdxonunhunxkddwdgndxxnkgkxokwhundxnnkdndhxdndhxknkghkkwhghwgnnduxdohodhhxxougxkxhodgoxhghxnhdxdokhdnkoonkkdhkkgonxxodgukddxdouoxdhkgnnuhnuxkodknwdkuwhhokwohxhggnxnnkxkowgowxowdhkdhghwdnuokhkwdgnxuxdkghxxwhgndddoohwowguuokkduwwdogkgodkhgowoxgogkxunnoxhwnxknunnnxuoddohdogkxduduowwguuhddoduwukkuodhgwwwggknunhnuwnwxuwuxknxduhxgnkddoohouhunxgwouxduodwddkhkxkxxoxxonuhugggugodgugoxwdhkdgwnookohwkdddnwxuhhdundxkwgwdnghhdwhuknodwdghwgndhogwdwwwughknxguuxkoxddwwndohghoddoohngodxkhhxhodoohknukuodhuhooungnxdkohonkwwwkxokdhdnoohgxxwhxddwwndogdwuggkkkddxnwxgkgxxhwnuwhkxhddgwnohodkwdxdgwnudoxwhxwxudxgodkokkxdgxwokugohnkwdhuwxownddnodxudokkkxdhwwdouuwhkoundkxhnndghwxguddhgooohgxdhugkxnddokuxohghxwkgogkhkxkdhwdkwooxgdxodxwxundwodnwhuduxwnuwwhddhdowuxwuxhxxudunkununuuxgukhdodnkxngwnwdndgddwwhngookwguxnnungxwwkdddwggnhonhdxgdhwdnggooxnhdgdwhxgdukdxxguxwodgudhhknudunowgwukoddngnndxnxghwddxhdhxkhuwnnxdhknuknnonxwwxdwgnkxwkgnguhxdohwxgkwggohnxhxnnngunkhuddddndggduhdnhkxnxdwdhggdokhhkoogoghwwhkwwddkxxknkhggkkwgwwguuokkouwkgwgghwonwknnuhggudguhhxnxnxnhohhkxdghggukhodxhkuxogkwhhhgkkdnxhdwhondhnkknguowdhowwhhouugkwuudwxxnxxhuwoxwokhhunguwoknnxwxdnhgoodhuhhuwdgnnkunkdnwdxkudhwdknwnnxgwkugdxxuxkogxhnnxnxwdxugnonngnkugxuxukxgukhuunodkhuhoguddgkoowwuhgdunwwgxwduxdhgwhdnowhudhdwwhwuxnuwwohghkwkhkhknddkohnughhohdguognwxoxhnuddwwuugouodowdxxkddddghugggngxdgxxwuodxdhxwwdguwdkgnwwudkdoxnudkxwoxwhxogugowgnwhhwohgwodnxgdgxddunkwkxudgxudohxhhkguwxuodwoouxndhoougnhnnxgogowxdkkuhxkookgxndhghxogggxoxnhwwkwnkogkunndunkudwxukxdodxkhnkdkdodgoxnuhxoxgokwxwhxduudgknodhkxxddnxxdudgwxwnxoddgwwwkugkddkkkdhdkgxkwnuodkoongwhoghddghwwwhnokhguughxxhwgxkouhuxoowkgouuounhokohwkgxonxnhuduoxxnkdxxxkkgwhkohokknwkxnuodudggdnonhhowunhgkhhdhhuongdkgxwdwgnkonkngnnhdoxddgonhonughkgdhgnundodnkgxoxnkohudnnuogkdddhoxnhhxxoxhkkgkkgkkkuxonouhunkkgdwudhgxdhnxxdnxwdugdhoukukwxknoxohkwkndgodghhnddgwhgxdogkxohnhwdnhhhgooxnwdxwxkondnngwhxhooonognxugguwnnxukhuonhognnguogwnxnngudwgohonnhgxwkwnxwgkxxxkhdokhghwwnwdwoonnunkxwnhxwuwhuknnhounnuxuhxkdugwhowdwhuuohddxwgxhwddonwnnhwokoggwxkkkgwghkngwgxhuhnogdndkhokuugxxhwdxdugwokdhkhokowkxhhuxwnhkkukhhwdkouuggnuxugogdugdnwwoungnddnuhodgxgxndkonognoohnonnwngkuddhguxugouudxokwwwxxnnkxkxohddguxwghgnodkxxggdxoknkhxgdwxnunwwxdgwkwdhuxxxwxdgnuwgonxuohodgkwdokuunnuuhkuhdwnuxnxxdxkokggodokxwwwgwohnghxkwwxohkghggwggukwxxuuxgwoddnkxkkuxuwodhnxkxwndhhgwkdddokhondgwoxhugouokwoxwwnguwugdwndwwkodooxdhhuudkgkhnowhugndggnxuuwkdwuxdkwwnxwukuxhxhknxxdhhkxndxkgnhkkhkxuhuwdxnnuowkghwgxxxxhdooxxkxxuwxwkgdunngxhhwnnwhkwxxnuhhdnkowxgnnuggkkgnhoohuuknhdkdgnnxhxxggdkxkuogoduokknhnkokxwndwnugunhwokkxuwxghkkgxxkhkokwghodhwhwdddkkxnxwhgdnxxudkuxuwungwhnoxdodohhhowuuunghgoguxuungokxxgguhwugnnkoouoodnxhhdwdoggxgogkwuduwdhgxgxunnnwknonununonwguhhoogohoxdwgkgkwohhwwhkhudwuogkuugghouxgnudkkhukoogkgohwghkwdknkuxouhgnddgonudxhkxhnwdxhdkwnhduhoggnwwxnwwkxngdnkuohwuhokxgghwduwkdwxkwwgohoxwxhghxoxwwuonnnoowhdhkhokudooxdwuoxxuknnokxdwndounkxdghkxgddgkkogxugnunnxxnkowkggwgughhwhdduuuxkhhdhwuuudwohhhndkxgkhxxhwghwgduwgkohxhgxonxgwdogkhxngkxkndhwhowghuknkkwxkwnhxkhhgggnhohnnkuunnukdnhhokundngngkoonggoddwuuwxxwohhgnnxdnhguggdgghdudogoxoxxgwuhdnouxgggggkhwdoxxkgkokxnngngkokhxnugxdndoxhnuddkwgxonnknkxdounhxwkwxxnkwoxuhdohooowxguxwkkxdxuxkonokonwoxguokdunooohxuowuhkdhnodnnxnduhnhnuuoukxdnkkwwgukoxkkhhkodoonhokxxgduhwwuwhdonuukhgxhwxnhgkguwuxukwxggxgkoxdkokkwgxgondkgndhoudkdkokdnuoxnodwunnnhxkuoxguhugkkknkuooukkgxggwknkdugxhnhukxxokwdgwxxuwkkuuknxnxnhhwnddgxxkoxohuhhdkwnhnughugxkwhwhuxknhdkguoghxxkwwhwwdkouhdoxxuddohduunnhdwdkxwkxxxongunxxukuodkkhdukxxdxnxxunuhhkudkwgoohxgogwgoukhdkhgndnnwgnxkkwhohnnxooxunudxgghgnnhuwdnwwdduxxkwnoxundkwgdknkxukugugxouhduwggkowxunnwgonhowndwhxgdgnuhxgxddhnkkgxuxnonhwonoguudondgogukxnhuoxgkgduhwghgdwxngouwguguogxwxdgnouwdxgkkodxwxnhwhkookxohxxwkdgwoxgdhwhkoghwnhxxownhdxdhdwxhwohhguugkhokwddnnuwwwkonghgohgwguooohkdkkwxhwduwxxwkduuoxwwondggdugwxdoonxxukwkhghggwkhdxoodhnnuogkkuowudxhwgwdggokuuowwndxnkuwunukhuwxnwwkdxhhwkdnnkuugonghgxgxwnowwkoxkgwwudgoudhgddnhkudxnxowdhdgodnkgwwnggowdghgxwxxgkwkuwhdhgunkkuhoxxonodhxnggnwookuwodukdhuxnkunodwguxonhouwwxkoukdonkguggddonkdonuonohuuokdnwuunnkxgdhwndnhuhhnukgwdwgnowuooduxwxughowgkwwhdxkxhkwkkhnkwonhwkdnnuxxngnxuogdkwooxhgowdonuwknnhxnhhgdwnhwwonkuowowhnnnwwkddwgxuxgdodhowknngngkwhgokxngkhknkxgkodnnogkwoogwwkgkwudkndwndnkowwnhnwxngngxwhggdxxwxuoouughwgnkxowunkxdwnwgkgxkdhoxggxdxxudodokoowoxnogxunxgxwnonwguxkonoudxuhkxkgwnkgnonnnoukkhghunxwkhxnxhouxuodwkgkuoooxooownwgukngnxwouoognxgxgkhgounwkhnnugohownwdxwduoxdnnunoouongooondgkuoxxxudnhknkkhduowohkhoxdwndkhkoodhudkwuhhnnkwwuounnuukdggwohhwngxxukhdwodxghnhuoonxgxoknugokwunuxoxuxuuokkkdduuuoduxukhhundwxkxhghuxohouxuwhgdnxhdkghownonxuohxuukgkuuxhkuuoudnghdgdhxkuwgxhogdoughgdgnundnxxdxnxnwxxknxhndnxxnhxxuxughghuxxwhwgxdhhggxhhwwnhwggkxdowuuodnohwhxhgwuowwoxgnnuxngnuugdwgdndhndnohougnukuogodhxnhgwognhowgxhnhkouoodnxxknwddkhdhxdwdugnkxwodxxdkodkkughwwnuxxdxuwnuowogdxnkkxkuohwdxwgdnunohdgxookxkxdkwhukuukkudguxwhkhgwgdwudwuwodxwhhggwhxxgdwwdxgonuhwhnoguwnoxohunukknkxkwnnhohngwggwkkogwhuoxduhxokoukhoxdogwwwwuwghdouuguwokuhddxgxkouudhknkkgudkukogohhgguuxdukhunkukuoudxuxdwhkgxkhngudghwhkgwxxknxgxhnxwodhdwuwhwxondndhguoxkoudxwdxhkkdoknuuwwuxuhowndhdkdnxkxkduhooggwwdhwgwkhwxuooonohxxhkxknxouhookdwouxhwndoduhodnwgxkwownoxuooxngdngnkgxdxukhwukuddkdhdoohdhoxgugxhunundnnokuhdhnugduwukxhwxudonkgwdogdogoguododuugudhxxxdoxggownxowoxghdxxudgkgdxundhdhonkknuxgwnxdxunuxwoudwwwoxohhdkgdougdoghdgdwghhdhohguunwgkdkgnnogkgndngnuonwdhxogdkhgogkugkhdxnhxgkgkuxhohgdudhggwxguwonxxddwxgdhddonkdhwgkdnnoxkuhdhoohunkwwdnuhwkwkkugodnowxgxhdwhguuuggkoxhhnukhdknukhddhkdkdoouxhgxddudggknwuxhddhdnhdnoowdgwkwwxogkdnkwdwkwuodkdwxxduuxowhghodnkuduxhdwdohkoukhhgxukuwuhxdhnhoknnonugwuukwkhdwxwdokgwgdnkxdkhnugkgxkdhdknuxuogxwhdudkxxdnunnknogkgokkwuwnkwxngxkknuundwnngwdwodhdwdhnugugonwkwnhgxnuuggwhukhuwwhgxhxwgkxdkwxwxuuouddgowxgduggdwguhhkkxowugdnnonghkhodxgnwxogdgnuokhuuudhkhkkwokdgkkgxnugnuxgnoknxdwhwhkdhohdhxokkxwnxdoohuwwgnohggwwuhxunhdnownkgudhghokxgkxuwkkdhokgdnxhgwhwdghngwxdguhgxuwgwggdogxwdwhokogwkwohwxodhgokwgkngowkhkndggohdokxxuwnwgxwwkghoggokhwowwgdohodgdwdhwdnknnngohduuxwxuknxgndhkunnuhuuhwdgdgxnxhxghdnkwdnwohgdkdxgwkkxwuwgouknkgogoxnkkkownnudughnwhowgwuoogohngukghdwhkwoxnxougkowuhwgdddoggxghokxnxknnuxkudgoudwxgdwuuxnkkhnukownkououdxxdwukoodoonghdkdhdkkhngghnhkuwnhgkkgonugnwnhoxowhdwddhxhgkgokkddokhuhnhnogxgodgodouunhodkdgdkgxddwhohxxxonohnxhknnnndohnhwxdkxddduxhhdddwkndxghxwuxuhgkdnghwudkgddwhhkdouwunkkkugguunkonwhkwonhdkoouunouddkknokhguhgoxhndxwkhwunkghghkxguuwgxggdnxkxnwxuxnkggwhuddhkngonxdhhdodkgxdkoooknnngodnghdkxgdkxogdhxdkdgunxkhdwdkuognkwghokonouxnwunxdnugwnxdhddxwwkgdgugxhhkunoxhkndghgngguxxnkhnunghxkwgggknoduukkugdokxgwowkxhwuxgwdguonunoxgoghkxonhdnwndowhkoudxwknohoogxuuhnowuonoogduxuudkwxnxnhukkwkhghgkoohxdwdnkngnwwhxxuwgduhonugxodunnnkkkndxhxowgggwkkkkuoxnkxonddwxwnwukkgkkddkkknkhnnxgdduhokgdgwgnnoxdnndukwdkxnuhkouhxgonnnokgdxhkndghnwdxkxxnkuhdhhwdkddkudwwowgnwhkdnnxngghxdgxhuudkgkxduxoodxnnwxgghkwhdnkhgghngugkxkxunddkognxxwxwxgggggdhunonxunkgguuwdwwxhkxougkwhxxhgkowowkuxownuuknwwhdhkokoowghdnouonxhhkgdukwxguudownduhdhwxoknndhgwogkhkxgudwdxdhhxwgdgugddwkwhuxwdwxxgggwuooxxhnkwdgknokwwuhkuhxwoouhwwdddwgnkgxwxgohndxknudwkxkwhwhgkhxwunowogxhkkuxoknhdknhwxuhhdwkooxgxgdkdwhgoodudokgnhkhnwogndhgnnxddgwnnokddxwxnddhodwunxwkwodkkhhnunundwukhgkhhhwnudnxoknuuokguooxggogxohxdhownhkkwhduxnououxwggokxdkknudhxghuohdnwgukhxwhhhuookuwkkkxkhwuwgndgkkuugkkduggdghggwhhxgnnkgkxhkudhggwhgghgxuhodwdkkkxuhdokuughxogonhdnndhowkxdnwnnhwnwgxwuwggggogkdhkdnxwhhkdohkkonwoddwxnknoughdwhhxnwohohkuwnkuuxnwudxgxduwndduxxukoxxkkwnuunudkuhkgxudowhowhodwnhgkduunwuowdgnkxgddogxuhonhnwuokkgkkgkhwkughuwgddnwnownuwkogxowwnunnxxhwkkwnduudnnngdduwkkdxoxkxnunnxunkxdhkdkhokdxdxndxdgnxuxhwnnnkngnxgnnuowogownoddnhokxnndgxhoxdkwoogxhwoxuxxnhgxnnnhgwwonohgwgookohnuuhnkkdxuknuuhwkgnuwnuukdhxwnwgdowwhodkhugnhxkknnhugxwhwnwdoowkwoxhooxwuddnxxwuknugwdnnkkhoxognoxgkwwdoookkndodxgxxwkhdgoudoodoxuhwuhuouuohuhokguhknokkohknuhnuhkwwnouukugnkduoukowdkkuudwwnwdxkxoudukhndwndnxnguoughhndhdkuugnkxwguwwodgnohwhoxodnnownonkkunxhkunuggduhnhhuxxwkhwuwxkhkwkwgnxkwgdhkxnhkduwuowhwwknoukdwxwduokouukgkxxnhoxoongxnxxoxddhkoggxwxhnkgdkxddhdkxwwogoduggnkknuxogkhohoonnnkonhdxkxxnowggugghghhkxoowkxgggxgkoouwnhukkwogxwondwoddxnwgnhuwhwkoxkxnuudwxohgouoxxgkgouxounwhkwwggkhxhkwggugdgunkoxunxwgkgknogoggdghnuguddkwnkohungnodxxknddwknxhuwnwkwdxokowwonooxwoogkkhgxwoggnuouwugokhnkugkxxkkowkodokdxkxhwukwdoukuwwwgknngkukgkxhoouhhwwodwwuwhouknhkggugdgwoxkkguhdxwdnxwxwuwwdhgowdwxkwhokhowxdgxoxkdddgnndoxwnwwgnnddgkkgohdkhunukndgonkkxkduogwxuxdnonnwxgkugduudgdkkhhuxoukngxwghknwgunohkoowdgnnwxxwndukdnonwgkndkxoggwuxnoohnxnknkwxngdongxkuhxgkkhwgudndkwhknunuuxgouhgwkgxogugokkowngxnkuddnuxohdoxdokkouxohkughwxkgduwnkowhdnokknnhhhuxxonxgwhnnddnkwkndkwgghgduxgkkuonxowxudduhnoxuuwwxgokohudhnonhkgxkwuxnkdwnguogwdddnhgdnhouuwuguunnwnhnnkooddndudnoggogougouhdnodwxodohkohxhoduxoknhhddognhkdodhggdnwnwkwduwuuohkdxwxoonhnxgoouhxghgokhkghdxwoxuxdodhkxxogxgwdkohhognudhnhkukooudxuwkwkonhhkkkwhoxgwggkkuxdkuhxwggwhhhnnwkhonuuwgdxwnghwnnwxdxhxognxgxxnwkhoxnngnwunwdxkxwkxgukwdhhnuhdnkoogudgookggognkhnwnohgdhhxwdogkwxxkwggugwxnnwxudxdwhhnxgdwonhxogwhdunngnghwdwkgnnwoxowxnkwhogwhxgukdkkuudhguudhunukwhgwxxknwowgwhxukonuhoohougxhdoognhkodkwkndkgduwxudkkhdkgdhdghuhwwdwwgdhgokokknuwgunwxhdhdhokwogxdhgguxhxkonghuwgnwhxugggunohhgnguowududdxddxwdknxhoxgkdhgwghowwgwgwkoxdgwngxowwnxnwuxdgukkndohhwgnwxkuggxkgkxuuuugwdxoxdwwohgokgwodhowuxnhwwdnkkdhxunhxhoowxkhkxoguhxngduxnhhwkuwuwxkgwhkhkwokuuguwdhggnnohwhgxhdhhwdkxwnwokwnnhwxhououghdundonudowudhdxnxouohkkdkdxgunxxouowhudhhwwuwkkngwwddxngnukwohdxddkwdwkunnwxodukgguhkhuhdwkkdhuuoowxouxukgdxdgugxdkohunuohxxkuugkdwndoowghxuoouhwwodndgnhnnuuuhuowkwuhghuwohhwgkdhghwokwudxxkxhhkowhwdwnuuduwxudnokugoukuhxdndonnduxgxkhdnnuuuxwwdhoddgdnwnukwghhougddkkhhnhoxxxhnnuukgnwhgdonuuxdhuodgghwuowwgdgnwwuohwhowouunwxwouodhhuuhndundkddwhxnwuxgwxokuokhgghnnkdkxdhxunowkhodwkxwuhhhgdxuundhxnwhdgouwdxonkodxwwngukhhhxhnxwduoxowhgduwdonnxdddddkwxgdnxhnkdhwhkxnowxkuwuxgoduhghdnunwddwwgwkdkwwkdukwoduwwwoddudwhhkhkudooukxxowwukgxounwhndgwkdknxhwhwwgokhdwounhgwohuhnugogknohhgwgwkodkduxknuowdhhuoxoxxhukxwnnkwxguohouhguduwxowxnohdudogoukkogwoxxdhuxwuhwggdwwxhnhhduwgxkuhnwgokwududuxnghnnkggdgwdugxxunwnwukohguxwukdhngohughowwnuwgkgxnxndoggxkonwhogdwkduhkoxngxwnxkkggnhwuwokxohkhhkngdnwwoggwhhwgxhuuookgwwkhxdwwxuhhxduwnoxxhkxgghkkwnkwkukdwuwkxkwddnwowudnouoxxkuuxugxgouxdnkgwoxkddowkxxnxggkdkkxkxgdhddgogoowhxwhnkhwxunuwongwodgxxxknxughuhwwononwukodguhdkwhkgkwnhxuxxhndkgudnxgkouxwkngxgdghkhuuogdwdghxwwxudkgogdowkkxnoodddxxugohgnkkwukuxuodowdhoxhudnownungooxnkuhgnnoxxkduouudwwhuuddhwdugduwgwnuxuunuuguggkodhguhokokhuxxxdkhgduunuwuxwndwhngkkhkgxuhghukduoxddwugkhgonwodgxukxguwwddnuxowodkxknwwxwwnonxohhnxddduhndwgukwduwookhwkkkggudhddhuwokkknhnhghxgoxowgdkkxnxhwwgwnkhhndgdkwwhohwdwoxwwgoknxxndwddxdndwdouxkgxkdkwddnhgnxkkwhuwnnughdohkhokdowngdoguokkonwkwokdkkuxgdggwxnknuoouhkwuonnxxwhouughuhnxhxxnhuhdwdkgduukkuowgdgoukunxnkoghdxkxduxgnwhkwhkooxdohhuuhuuuhdudngwxxgwokgudxowokddwhdgowxuwohouwwouwwoghnkkhhdkonoxxxuxuknknnkwnnxhokngohdnkkuoudxgonoxhdgwnghkudnwdwuxoukhndoggdgohxgnwouxuhhodwhohuhhnxwxuooxgwhkgngouhonhxooxkogkognodunwhxwddngduxwxnwuonoodddxdhkdnxudowhxughuxgxgghxkghogohxnhnxhwnoxkkghhxgkonxdoowhhkhkowhddoukkokgngdowxuwkxouduxgxgggkwxxxhowoxnonghgwgnkwkhukugnunwdnwwggxwuhkhhxukwuduoghndwoxohdngddhwodkuxhxwgnnxnwhooowughnkgdxhgoknwwgwggnngxhxgxdokonodhwuhhddhngwonukxowwgogookohnkkkhduxwdhgoooddhghndxdxwxouwkwnxgnhgxgdgkkouuxgodnxdddhwdodhwnguohhwkoduxuxhwdnxwhhhkukxnuuhguuddxnduuowghnkohwodwkhoownguughhhwnunkdhgkndgkhhuonowkhdnonwgggkduudwgwngdggwghhwwdnkkokgwwdgowhhxwxxwwgxnnhoknghoundkwnxdngdwuukogwunxgwuuxhdnxxdudhxhnkngdhggnkwuxuwdknhxkxogwddoxxwoonnkhdkwhdxguhddkuwhnokgogngwgxgxgnxkgdnxghgggddgxxhnxkhkguwkwhnxkgxxgognwdxkhwgonnhgunhhknkxownuwgwdgnhdodxudoxukwnwgnwkwkhxdkxudknkndoonohknhdughowguknowkkdoxxgwoxnudxddowgkhghnuwhxkhwxhghnkdhgkokgudxonkonuowwuxukhgxgxdwkngukuwgohxwunukwnwuxwnohdddudgdngxxhghwgxnunnnwdodudkogxkxuoxndwdnhdduwdundkoouudouwkwwgkkggwhhhxgdoghxuwkgxnnkhodwdxwxhoukgwnxhougwxudhdughnkunnkhunwdnogknxwudnhundwxggduhkdwdwndgodunuouxhgknhdhxwngwxxwgwwuuonngngogdukdxhxxoknguxdxkhnnxokxkgokkuogoddunhokouwddngwdghugxwndnnhkhoowuxodudwouwnunhokxkkuddhnuggkoongnhwkgkhohoxkhdugxddwhhwxnhonxngdknkdxxhnoxgowuhuxoxodudnhgkwnudkdkhdhwgkwguuxkgkxggdunnkhhddnuhxxognnghduhoknwhohxkdwkknggwkhdnxwokoohxgowwguogogxukoxgoxghkownxowwwngwwdwgkuwxhudggkwhxhwukhnkxdudknkxxnnxhwgdhnnxndhkgouxgwxwuhhhdwkogkwhkxughwxgnkownhxgkndguxgdwdnhnxokwndhookhoouwoxwoohkxwwhkkduggudkgnwudxkunnhouxogxuhnxwkggwkkkdoxungxwooxhugudhdwkowuwdwxdxoknnnouwddddwuwuuxuonkwhkwxnknwuhnnwnowgwkwdoxxwkonogguohuukoxuoxgkuhwnnwwghwohgdhghudggwugxkwxuhwdddkknkuhxhxdgonodokukgnkkdhgngwgxounwdoxxohhxohouduwxkkuhnuuowwknghwuungghxongkkkkwxdongnuhongwugwnwdoknukkxunwoddhhuhgnuhxkudkkxkukgdngodhnxdndnhwdnwxdduwdkhnhnwkguxhgxuoudhwgudxwukgkxkhogxoukxkkkkougnguuuuguowdunxxkooxwguhxowgnouwxwokkkwownoohnkwdggkdddhdwuoghdouudwuhkugkwgghoggunnwkoxukuhgwonogxhdwnhnxdoonhohdgwouwdxdoonxkwngkhdokukwwoougukhknnwnhnngxhhggwohhkuounkhwxhwxouwkuuxxdhwxggxongndxukddkouxogoukkgokhdwgxgdodgdkoddgxdodudunkxwodhnxnwngdxnhhxwddugwdnxwuuwhuxxwgwkohkgohuuwxoughwkuxkunonxhuwuguxxnuuhnnddkhgkxngxgunhngunudxwxnwxxonudwwxdoooxounwxhnoowonodwwudouxkuugunhxxxkwoukwwgwxxudokoghgnnohwdnnwodnoxwdnghgwohhnognogohkgkdghonwhwougkdwxkhggdwwdogoxxuohunuugouuhhwhhknggwhnouhuhwxgxhuoxxuowgkgdnhdxhhuwnkxohwwwdnowkkuknuknkwuduwkxnukndukohhxdxwnndhnhunhxxwwxduokuwnxhugwkwgngwhkkggogkuhwxghxuhdoookkwxkdknwnwxodwhwxgnghdhnghndwdxgdnnuuunkxgughkhwkounwwownugkuwkgxxuxhwdnwuwxnwkowwoounnxgxduughwxhgohxkukdkkukhnguohwduuxndxonhgwkkukuhohgguxdnokxgnnhuoouungnhkuwowgoxnkxogwdgnghxhkkuwguguohkkgondodxhggduwduxwdkgwhkkgonkdhunhwhnuowwnhuukhkhhgxwnuoxknhddhgxonouhwkwxukwohdnuxkgnkhdnkuuokhddgunhknwkwdngohugowgohxhhodnhghwnuondnwduguxhkhdkxudxxnhkhunkuwnngnwudwgdudukhdhwouwkouuhxwdukgdoxghwxnwndnnkdkxhkoxwxnguxownxguudnhgwdxdohuxhkuxwduhwwowhwnkoonngwdoxohkoggkggwhwdkdxunxgungwxxddukkwowxdnwkdxhuhddunnnohghgwokxdwhodugkhxgwouduguxkxdkuxohnonoungwuwkhokuknnkukuwuxdnuodxxhwoxhhkkgwgwgxnhhwkhodkwxghxudgoxhwuoxwgwxoodwkuougonkkohokdghwoungukgudkgndnwnogukhxoxwhuhhwgxgdnngoudgudddugkdwwwnugnwghnxonhwnguxxnugxhkwookdwkxhnugwwknnhkudgxkxngxukugohwugwudxhokduwwuouxxhkngugndoghhhkoghwwnxxkhkxkwggxogkknnugdwdwkdhduogwkknookdudkuhhoohxwxodwghwdhgukounxnkxooxhgdhoudugwknggkgkxodkohoxwxowuuwxuodkuuudgwxkuwuhogkgukugkwdwxkonnuwnowognhuxongoundwooogduddhxxnkwkhdugugdnuhugnhnuwhogwxhnnxohoghwuxunuooddhkuuuhokwunwowwknhghwoghhknhugkkxnhwxxknkgguwodddondnkonoxgwwdkodhxuoghnxhkgogxooxxnndxugxhwhggwhhxwkohkxowhxwodxokuwxxxnhhnouwodgdoxkghoonxghwuguonhngxoxkdnghwukdkkhxwknhdhxhdhudxgwonxunuhwxnuhukhgnowdndxoxwkgodxwdhhoxgduhkndwkwodwuoxuodxwoxnkwkdxxxonokhkhdunnwhhxgnxxxoghwodhukgxowxnoudognhxuokdnkoduwdogghgxghwdgnugnwxxdouuxxhxdkkkxdddoxddhuuuuxhwdwokxxhxdhuhnxxwdwgokxwuddoouonkhxwggwhogduwgkggonwgknkhxhukhwndokuxwkhkwudogwhxnkgxnhuwdoxkhodxnoxokhxuxdkkkuwdkowxuxowohnoonnxhwuhhxxnuokhuhwogkndhungkgukkxgxgxxduguxughdnoxwwgowxxddxuxxonugxxwdwkwukxhdngnwkwkxxnogkxhwhhwhuggukgnognuhokhdgxukdnwowwxhhndddgdxkkxgdghhuhwxuonnkdnxkukxhhnwoodkdohknwwkgooxhnkukhohknhdxudukwukuxxwkhnhghnwwgoxhuhxhhxdxuwhhxhoonhggxwhnhxxndkodudgkuohddowudkunoxnkohxndokxhgukxhxnoxxogugnkunukgnkugnnkkdxohnoddkxnhgnnuwwwhggohgudhxnwduxkdhxngdwxghdwhkwxngxgogkkkodhngxdhwhwggxwwndkoxnukxhngxkonnxxgowxxwhouduxuogdndkgowgoownudnkugnngnggwoxxhwkdukxxugwnnkxdnguhxukdugdohunddgxdondddogwgkgdgkkxodwgkhhkhdxddgngwwgggkungdddudhxggdwnndugnnggowooguduhhgdkhuodxuxkhuxgkddhxnngxgnudoxdowkgdghwoouxnkughdgdkxnudgxkdnxkxkdwonxoxnukhngxudonhkwwuowgdduonwxohwddhkkwowhnxnxdgwkwnnnwkhkdonxogudnoxoguogdwdnnxonuxnuukhwokkodddnnhnhooohxonnnkoxdnuwkonhokgxhhkxuowdnddxhowooxwuuwunkdxhuoooxowhkuohoxdwowhkknuoownxnkuhxkgdgwhhohwdxhhwdwhwdwhwoodonghnkhhoudxkudkwwnwknhgdgwonhduwngnhgnugnkwnodoxunknwuxkgdhwwoguowhhkognwwkhkngonkdnwunnnkgkkkxhnhkoxnnknuxxuugoduuguoouuxhuxuuwnwgxnnxwohowxkgduxgunxkgnnhohkooughwnuohuhxgwkhdxouhuxnhhhkduwwwhukgdhggkxgnodhknuxudoknuuokgouxugngddxgwxgxoukwhxhuhdngnkxkukxgwnuhgkwkgxohhxghxxnxhnndgkkwokwkkuhkwxghnhknxhddngxkhdkgkkuododokdkgxhknnokwhhnuxwgdxwhguhodhohuonxhggnxdhwgudouxwdwdggoukndgkoggdognhdnhhdxkdhhhxxxhwkwghwuudkgwuunuwokxhdkxugoudhnguxxwkxghdhhoukxkwgnxgnodkngdwuuoxdwxwgxkhdunddwxknwhhodowhnxxkokonhuodxgkhgodgxnkowxhuhhukgoxkxddodnudxxggohxxnguhnkgkwxkwukhkxngxnwnhwoogggdhwuguogxhxuxgwgkoduwkhgnwwhoouwdunkxgghddwghhodgwxdkdkkwhgudhhukngdugghhhogkdhxngxgoddodggkgguggxdnuuuxkhdugodknxndokokokhddkxknnononkhdudwuhnkuungkdkxhdkxouxwknhunudnndughowkgunokggwxuxuxxdkwunnkduugxhhnxwkngxhunwukuhouuuugkdowddhgngxhuuwxwghxxukuxwuuxxnnkhdkxkwownkuhxkxodkxonxnxookxohwwwnwuuxohuohwdwggkhxokohnwxnuuguwxonwuhkkugohnonugwnkknxkknxhuxgnhgdgnwnhgonxhouuhuxnnngoowkxnuwxuxhnxnnnduudkkxknhodguhoxuwukxkdgnkxhgknxkxdggxdoxnxhxxxugkxduonwhgukgddxdoowwddnxhxnwxdwwnudxwwokowdwgnhuwwnkhoooxwhwxhhukhgnkdndunxguohhxwxookgkodhwuokkwudddwghghwdouoxxkghkkwoxxhugudgowkugkunwuxhxwkkuguwkuxwkohkunokdnwhwndkuwkddohkogwnghudhwwgxuhggwwnwwdunuuunxhhodhwxhhkgddknhhnngxonnhhndwduuwokdhhnngoxhkknwddngkhuhwgxgddogoguunongwxhhwwunhudkwhhudhdwkxuhudwkxnkhwokhndnxookxxkoohwuhknxkgkhkkuxokunhkughxohwxdhwuoknnwhdhnhgkgkxdkguwkxuxxuuuwoknknnnnkwdhnnghgdxxxwodxhxwkwxwwnoudkduxdnnooguwuxuodugnxnkxuowhdudgwhwokgkgnkgwgxxowknkgghudhoowwkoddhuouugxgkndhowxnnwxgddoxwnuununxunooowkwwwnxxxownnwwokxoogwogonkddhuxgkkhogkhdhdndndkwuhgkgnknokgkxndounwhnddkgudhnwnkgdouhukdoogoohxgukxuhwnwondkhhhnkudxogkhdkhwuxxgongooxhoxwdkoouongxggoonxhwwdnxohhhgwwoudkgudxhouhxwwgouwgkgdkghhguwodudunuoxodkgkxhwxdkwwgdhhdondwnnwnxxwnoudhhwhnnwxgodwokundkgooknhuoknhgnhdkugduohgxkwnxudwonkwoxhooxdonodhgudxokdugxhgxnxkdhowkngoknhxdxdwdkudhxdhdoxnkkwghxoxxunnxnxdkdnuhgdhhgwhkdxougnwghxodndowuhonuuuoddnxuhxooghhkgwgogghugggxhkhhxkwkdxggxkgoxduwhxxduonkouhodwudkgknhhnudnghkngxnkxxnokxdgkkuwgoknnndndugkoghhokoukugkogkukkxwwgxdoudukuhouwngdxhgowhkkoohgogkhoggudxduxndkggdgokwnnokduhunddhuwuhhuxxwdndhnohwghkkogdhuuhokghhgkkodukwdwkudhwghkhxhudxohxohuwnugkxxhkohhdwwuuwugxxonnndgkgkxwxwuoxowxkguwxndggxuowuwkhgkdukwokwxgnkxhnunnwkhwnddkxddwgxhhoognwhnuddnwwhuwghhunduwuhuxuhgghgondudxgnuxdhnnxgowgoonunuowhnggdkooghudkohxuonuokdkgugdhgughuwnxdwodxkuuuxogndnwgwkdhxudnndgnhkouwddwnuxdxuukngddougkodguhkxudgugudkxdwukwooohndwunkwwnudhxgguxwdodowngwwduknokkhuxokgdhounwgwudxoonukghwwogoghxhxhduognxhgkhugggohhnxwuwwxhhuuokkdgwnxdxkuokonkwxonwowwnxddxguhdwnodknhukknxgngugnhggkoggkouhunhuxdgukxgdxwghkxghxdooonwdgudwkkxuunhhdnkouddxwwuuukhkuuxudhdxgxxuxdwkwdgohdoghuxwkdxgnnwddonuwwogkdhwgudgwgdkxukwhkknoondgkognguxgowhnwgdhndxhkxdkuhowdogxougnhwnodkknxxhunuudxkknhuwdnhnnddokddwnnhonnuxokkonoduowxxkgoohnhgnhhokdkhxgkddkgxhhdowukwgdgdhounonouuhnxwkwxkwdowkokwondnkwnkxdxnwnwgxhdxhxdnouuhkxwwxkoxwwwowkdhddxokgdwnugkowuxgunxkgohdongkgnkuokgkxhgxndwunhxxoxgwxwhxgohhonwugnxxhudwnundhnnxwdokgohdngggdxhnnxdwghnnowuudhhoudxouudouhkxdxndxhdggokohdxhxgkxnuoknxhkhuukdkdhuxwwxdgohkxgukduxwuwnodgkudkwkugkxwgdkhgogxuwxxnnuunkgkxdwkuwuuggkdxhdwhdohwxkuxxukonuhwuodukdddhhowohduuhwhhohwgxkkdnhwwgxdxxwdkdhnxdduwxwwnxwnndoxughxxxhnxxwkudkwhhhdhnkoukhkuxhwwnwkxgnuhudwokuwwnngnndohdhgddungxnxwgdnxdxdokkxdxnxkgogghgnddnuuouuhxgxuhkxwxwnnokkhgguwnwugdhnnwunghowuhkooununoxxudwxgouxwnwxhhdnuhngwhdkwdodnunowndouwgoogoudkoxhkkgkuuugugunugdwogooununkgkuxnokhgodwdnodokddoddhwknwhuxnxdxuuhugddxhkouwhoknhdokohhdgoowhngnkxhndkxgkwuxwnkgouuhhgogodhhnxgggdgdghkwhuwuwwgukudkogkuowuowwuwhwkdnkooddnkugguuwuoodwwukwgddgokxxwxkddugkghouxdhwwxhgdkhnhwhhnxggnwnwgxwkwoxhkohwhkokdoudunwhxxuwdkxuxwonwknxnkgnuxkgkodxdugwkghoounxwxxdoxghwognkdnnxghkxouwododkxuwhhgdwhukunhwkkxuohuhwwhwkuoowgwoduohohdxkoxoxdhknokkxxwwxowghgwxodkoxhuhohngxhudkhwwkxwgnugdkxuogogkxnkhnwnougxhuukkooonukdhungkxuudgkhhgonuuukkgngdokkodkhknwouhukduhguwwuhxuxwngndwxdoxwxodguxoknkkukohdxwngodnxnhxhwkukxgoudnhhowonohkouowhhuohknkgdukgwxwuwwkuwduhowhxodhuokgoxgdxxwouownhkdoukuuhkwgxkogwdkkuhunkxwdohuknoknhkgkuxnxunxxxkoohwukwwoxhknodnxkkgkwoongdddxdudxdknwdhuhunxdduooudxhdwdudxdkxxxxdkohuwhuxwukgxgnxhukwkunkxnoondgnwnwgodkdohxxngwduxhokwgoknwduuowhdugughnxwoxuhkdxgnoonnuohxnnxugowuwdonxdghgogxonwkwhxgunnwxhunuunhodnuggxxohokkhhuookknxdgkoxguhdwowddkgowhwkxhuxohkgwwuuogxxgghxhknudwhxwddhddhxnhnuwgukunouggkhnhdxwgwdgxdhkhgohwkwxgndkkogxdkhkgknuhkunounhuxxdgokoduxoknuooxwugkgddnhhnowxoogwdwuukouuhdoxgghwwdghhggxdnguuonnoowkhkxxkohnogkkgkhgowgnnhoxooddxnxdwxdhkxnnokxuduownkuouundnghgknkxhoduououhxgwdhkuggowkongkdkwnuououkxoggkoxoouhwhudwxukwkhhuonunxuxxhxgxkxkuuoxwdwhdwdkdwxwwogdgooonngkhwgkowwgkdnnhwonwononxkowngkwogdohgdwnghowxkxogdkxunkhndgnhndnuoughwnuuxhxxunhukoohghwkdnkhkdhuxnowkknwxxokhooguoghxdhodouxukdxhhhnonowxndxwnnnuwxxwkxhhwwdxhokunknhgxkuhxnghnxxgdhxhhddndnnkohuuxhohognxgokodwhkdnwdghnkdhxgudgkonwowuwxkgoxdugghunnoxwwdhodggnxwkhnwxwuxnnongdgngoxdhuwohghkwggdhndogdxkgdghknngdhgkdkwxhhwngkxdnuxnooonhghdgwwnggokdxxxdungoddokwghggwgwwudxuoxxdkwonwookgdnngwhhxnohxuuxduhhuuxxogwhnxwwhnnougdgwknxxwuxhkukguduoxxookowhoukuxnkwownnunguohndkghhhxkhxkuwdgnkkoxuxowxndwxhgxxddnhhdudwghgokhoxhnxdodxnnhokdnudxxokkwhknxohwkgkgowhnkwdhuxhddodxokgnnukoxuowwdogduwdwxghguknwkohwnngghdkknggodnduhkkxhxgwuwdkkhuuxondkugnkghodoohoognhkgxdhwhuuoxogdgndxxxgwhwngnuhhwgwkoghwwwgdhgkudwkgukknggdnwwhdnhgohdkkgwndwkuuxgxhunokdhxkouwwuknkkoogdudgwnugdkoukgnknxhhxhongukwnnkudnwgxgnnonnxxukddxohnodknnngddnkdwdwdwkwdghxngxuonxxowhwkwduwkndghnhxnudoukuhwgxuxxghxdkwknxkkuuwnnugwnukhwunxxwuxuxhdouunoghodududxknwondnwxkgxohkxnkghxuxgxkggoougggwodwnoxddonhhxoughxnwodgxdhogkwkhwuodnnwgknnwxxukoodxdokxkwkkwnxungxnguohoukhdwhundouwxoduhuknnwkouuwhhuhxondoddwoukkwkggwnhnxuwdxogdkgugnxuokognohdgoxonxwhdwuwukxnuowdnooodxuuhwhdxxwgkuwhwnhgndhoduhwnwgunwdghuxowuodoodukkowgnuuxhxhnkouuukhxuwgogwhugoxnuuxxdhgwhhhwokoognddwkhkkkxoududhhnooxghdhwgggxwxowkxkuuwxhdkgxgogoonddhnohhhgxgnhgwkhdddhugognuxuwkdkhuuhhxxwwnwuwxgdwhkgdkdxwdhoddohuxknognoowgghwwwokxgkguxgxnxnggndgodxnhgnunhdkgooonhxnwdnonkkwnwkddoxwgxnoogkdhungkwgudwuughwxwkuwgugnwggkxwoxkdoodnwxonhooukwkkwoxuonnuuuxnxxdgonowuodwhdogwdhohhooxwxgdhwduhhdonwkoxhgukdoxdggogwxnwuohdgdkgwwudndkoddgxdohhuhwkwgguodoohuuugoxdohunxgwhxngouuxkhnkgdxugohoghxowwkgndoxuunggwohdxkdoowdnwkdwnwkohnggnownhgkwxxonwuxuuhxddoxddoknuhuxdguuwuoohnxkkdkouuhughkokonnnnxhohkwoohgnnuxunxwhgndhugkwdkughkwnnoxwoxhxdnwdnkoukoxwhudhwohkhoowhuwudkudnkwhkdhnxhgdhwuxxhuhdwokgdgkdkndxwwohhdoduxdgonugoongwnwguwgkuwgdwhxnhkduogkokguhwhgxuuodwnwggnnnuddowuoohwkouohokgguhhohuwhkogxwnxugwxwdoxxduuknhxhxxkhguhgwkuuwkuounhgwokkhukxwooggghouxgukwhouoxuxkgwgnkhhdouguxddhhdhggdwhnouggohdukoxhuhwuunndhowdxnhhhnxnduunxwdkdxoggukxgdkowxkhnhudnwdxhuohhnunnhwnuduhuhnoknwkxdgwnonuokxwhddukukugngwuxhdxgghoudduhuwwdhwohkxhgnodkogkgdxgxkhkhounkkonugghngugdgnwwuonoowkhnguohnnokukwxxkhkdxonogxoguowdougxnggkhwhdooghxkowwonwdddknowokkgwkdddggdgwhhwdhgndhgdwwoxnhnunokwxhhknnhdhxhuddoowkkhndxnnokwghkkwxkuwwoukndgoowugxwkhxxxonhogxhwngudnhhowxunhghwokdoddkdoodxhooudgxwkwokdgohdguhkwggkwkwxhknknhxhhghxoknuwoonhowxngwghkxxukxoxkhdgkngodxnhwxnkuoxwkdwhkwuokgxuodddgnuwukudokooouokwnouuwxnxkghkxknxugndodhhdnuxodkkgnoghxundwkgouxghdgxkudhhxogdxhgoknguohkddhngkhgddxhnhnuuuxxgxuhgokkdugdxdnunnggkgnxxhdnxunxogwokxnhkdhowgkwooooggxdouukhoxdddookxkhnghonuwkxwooxkudkddduwnkkowxddwokhkhwnxwuggoxhxoowwxouongknnhnundhogkwkhownkhwkdhkhkhdnhohoxhhwdhkkhngxnuxdogdndoxkuxwdxkxukokdhwnwwxxdwugouguhnkkhunwgwwuwhwkwungxgouowxhkddoxhwnkxgdnhgwwhnxnxgxxhknoxdndkwwnwwwdgghduounnnhdggnxxwnngkknwxxxknooowkuwwgxnkwxhughukknuunhuxkwngxookhoodnkuwukgdxuduuxhnhuguhdnxhkxgkduudknhungkwgnugxwooxkokkhuxndkgnhooonwukndhxnkogkwdxdwggogdhkoggduxodnxdgnugdxkwgwhukkowhongwdggnhnddgohkhwxkudkhgkdudwuxhwddwodnwkdogkhuxgunhhonwuxkkunuwnuguoxnuonuouhdgnkgnhdukdnowdwuuuugohkhhhhnxghwxnwouodhggnnnkguhnxhxdgdoguwwxgxdnhudokdgxowdhwxwohggxxdgnkhuwuhohhkduhddkguxxhgndkdhnhxodxnnwxonohdwoukxunxouhhgudkxggdwuknwgkkwdnguoxuggodgnxhgxuggghwgkguhgxknwkxwohnwuuodkdhhkdhohgndhohwnwxdxuwxwduouuwhngnnkhgxhkogdwgnwwnxwxgwhdouownnwnwonhwhdhgkxgouuhghdouhdhwdonxgunxnkkkxhudkndkgknnwxuxgdnkxxkkxkwwunwkwuknwoghugxxknxkwdxwdxgoowkhkkkdxdxxhkhuhuhwhkxowxhgnouwhwdukdkookgnunohodwnnouxuguouxouwuokgndnkooxuhwuxxddkhogogouugohwudgxuxwhhwoghhkghnnhnxngknwhhougkdgxxnokukuwugdwhxxgxuduooxhgghdwuoouuogdookknxdgkwxdxhguwoxukknxxgkhuhuddwokunugngoxdndwndndonddhwdnhgonuugoouxghxxhxdhokhkdnnkuggkknwxokkgxwhhkxgxohndwxukkunnuknwgwxdukkkwwuxwnogwodkohoxgxwxkhwnuggowdknhuddnkhwughhunngdxdxwgxxongkkkuouohuxduxwkukkwxhgoukgkngnwgwkwnnguguwnxdkodxoodounnuuddhouknhndwhdghnookunukhhwnnogkkukxuudnxhonwxdodhwwwokdngdxhnwuguxhnwowxokunkdokwxoghknhgddhdgnwnwgwwwddhnnnwhnddnukhhwkwdoonxngxwgkwuuhkhunkwgdxdnoxngodwoxguwguuhuoogudoxdkohxnnggwnwwkndkxkxnhhdddwdwgggkkgkghokddduwkhgoukxddxhxdouuodwdnohhnundogddxdkndxuknhwkggdnwonndohownduounonwxkwuhnxnhdwuhhdwhhuxwxhxkgkxhngdhxhgduwnndndwunxdkoxohhkwdhougxdowodokowwxgwunnhoghghkkdduwwgxkkukowxdoxxxhuuduhudwowdwnkkdgxxhhnoonkdogxoodnwdgdwndndgxdnxndhkhgkgnwnuuodxokhdodguouwdohohgdxkhwgwugouwhdudkhwwgkhdouununhuwxkkwngokddghowgnndxnxunkxhxhhhdxkkxhnggngxduunukgnggxwxdogukhwggdhxkowgohdgkngwdgwkggxdwxwxdnxxhgoodddxhokuokgwnoungohuuxuhgdwooddkxxuxhwhnukuukowdnggxounxuguundkunkxdwxwkgnkdnhkggnokgkhoohgxuuguoonwxdkudhdodunkghdhgguhdoxhkwxxdnkdonokhuoddxnowgxknhndnkndokkwdkhkdwhdwkxnuwukddggnwddkoogwoxxgoghhguuudnnhohodnwnxndogkuxhkghhkdkxgndgoduwdwodoxduugdduuhunnhnxowwhkwhdwudhknxxhudwokgkkkwkodnkgwxdnudgxghwowhnnknnkogkuuhwnkhokkhuogxnoodguodhunkhowndknhhhwxunhhwugdxgwuwoohgxknnodhokdknwukunkhggoogkouwwxdxkkhnoougdkdukhxkxuxgokkwogkodknkudwoodgdgkkwhguxkdnkuhgowdkhodgxgwkuxkxxoowghwdndghkdukxgdudghnnhddxkdghnooggogdhgdhgkxowggkuwodoughhhxuwwuonguhghwnkgnkxwdhwuxdgxgwhxwduxuguxhngokuwookkkhnkwknhunduxuxwkghndukdkonhkuduhnkngkukkdkduxxdnngkgxnxuwxgonuukukxuwhooxuugxxnghnwduwxkwgwhwxundwgkhxhxxwdnuxgnnokwohuknwknxkdnodnhuwhggkndngngnxgxuwudwkkwnxuhxkkxgxdonuhnhndongoxkxwohoxwuhdhnxwkxwoukoodoxuwnkudxhdgokuwkhknodhwwodowhkkndugwkxdndwhhxxhknwxuuonkuuxkhohowhkgwknwowgkuhgkodwughunoxduhxdwguunxwngghhwdhdkwwhggonhodgghkhgkkuwhuungkwkuwxuxxkxxowdwoukgwhwogdnhokugkuogwoddwkwhkokodoukkokkggwnkodxohdxwhokddkkhxhdnhhhxgkgxxonxguouduhxgghdknwxunxxguudxuwxkwodkuknooxwwgonnnoowuggxddknooxhoxouhnoddwwkwououwuowowwwukohxwgdgugukoddnhudowwoukdnodhowgdwgwhuddnkuddgwxdhoudhkxuhugwwgwohuxuuwdnnkwwuxnhnoddhgkkgugxgdoxnkgukowukgxwgkwwhwuowdhooudwxdgknohuwwoogoxnggdndhhoowwkonohwggdgdkndhduwhhguwooukhgkhghhwnxuowdwhnkkkxdwwxkwugnxwwxwwdnxkgwwwxxuxxxwouknnhkwxoowokhngoodduwhuxuwnxunxwhdkwknhkwnhgkwkouunxooungohuoohxuwdkuxwwwdundgxukogokghgndxdhhkxgxguknxwhokognudhhuhxwwwhwngowkuwwxkdhnddxggnunwooogwkxnnxnkwhgxowdnuuxnxuwoxwhkdhnxuuguwkdggkokuuuwnunhuxngnukhxngxguodxxwggndwxgddnnwuuknogkgxudhknxxgwowxxxxukxddownngodwghngndkkdngwoukgwhhdkghouohhhwnhxdhnuddxxohgdwudxoudnddnwoxdogwxhgxuugugkwunxgduouwxduwnugwnnhunuohxwdxwdokkgxhuoghodhokkohddnhhuxgdhkudnhdhgwoknkkwxnwdnokkwgnnkudxhhoknwhwxxhwhkohxuunwnogowuguunuhhhkhxgnonkwgwuxhudkugnoxuxnudgnnoxkouwwgwuonuwdukoduwunwhhdwgdgndgdkdoxxhwhwdnnuuxunuogwnnwuhwuxhgkkgghguhgkhwwgwokkwgghukkuwowhwugnkgowoxggwkowowkgghnnkngdhxouhdugwxkxgokhudxgkwouhhwdonwwxkxdknngxuwdkukokdxhwnxdwwhnkhhwkhonnduwnxudhuhuoouhhxnkdwdwddnhwdoxkugungnuuxdngokghkxhndnkhoxdgogwknhhohkwkwdhkkuddgokhdnkhxxgndwogxkwxdxkokuknuwnxoougdoxdoxgdnkuuxunonwgundgxuonnxowhnwnnhnndouowwwdgwokwnhoughkdkwkhoxhuwdnkguwohhngxhxkwdgkkhukwxdoohukundknkhouwggnxghhhwnknxngkkxkowddhwxhuhungggwhggxwkkguohgnduddhwhhdhgohgdukuowuhnuwdownnwhgoxwwgddxkhwdxkndgkuhguukdnkhudxunwuugnddwnkkxowwknukhuwodghwdgoundohwkghhgdhhdgwddxuodonkgguxkoxuwhugukhxunoxhokgngxudxouuxhxhhknudgwhkwdgoxokogkgokhwwgdhwkxohnkgwxdghxnnowgkhukundxgdgxokkwwdhndwwxhkgwnxggndwoddonxhddwknwndhxnxwkwxxugxoudxdhdugxoudonwxoxhndkgnhgxgdhkkgxgnowgodgdkohxonxkuuwxwugkgnhkhxxwhnxnwodgnndondkkwuknkowkghwgwdouxgowngdnoxnknkwkwduokundkhowxdwowodhuhnwgnnuoxondhhwugkxhouowgxngghodhgouddohgnwwhukwdhoddokwowgododknugkkwxknuxhxdoudhoxnxnuhgownuodghodhxhuwxdgwgxhkgdxwkduhgxdwonwoohoduudnohonwonddgukgouwxuunwgwddxdndwnxdhxkhukwkggnnxukuxwhxdwokdugnoxgxxokdowgkdxkkundnoxoxohghwgdowxdwdxkkuoduhkdgukggkwdugwxwgwnkxgdhonkknhhuxhdnkoguxgdudhkuxuugxnuhxhwuwxkkdugddxwdwxnxuhuxwdngwkxwhgxokdwwokwougnodhkwudxuxwonodhwwoxxwokuddgonkgoxxghdwgdxouowwwhgxnnwwhndxuxdwddnowxnxxxnokkxkxkgoxuohohdwoxdkkxkuhkunowdwdnuwnhhnoguxnwkkuukowowkwukughddwndhdkxddwxongdhunoohkuxogngxwgdukxokuxdokuhxoxnokwuhgxxhnuhowxnwggdkodohgdkdxhdukwxhwowxogwdhkgunuwwwxdgwhknknkggxghdgkdnudkgxhdkdwohxhhhxhgugknhgkgggxgkonhunkoowkugkgkudwwhdodwwdukuoggggdxngxdkougkkndugoouxggukkhkdkwxwuunxnngoouxhgkouduhnwgwxwgwdddxoxhxuugknwuuuhdkkogxkgndduxkgnwhnggxgnnoogoxdkgnkwuuxgdowkkngwhoddhodkkgkodhhkdgxddgdohwhduuownukxnhxgnuhdnhgdwkuxhxxxuwowuuxnxhhddkgogwwdxugwwnkwxggodhnghnxwwonoghkwgnkngddkungndkgxnxwohdkokdxhhwdudounhunhkhngxdxgwhhdwouhgngxuxwnkdxkhghhxuknooxgnnhghdwhgkuwxugdugkhxnoxhdhuxohxxkxguhoxkdxxownhgnwudonngnxkwknukdwuxkodxwnhwnnnudogogudododwnwuowxhwudoxxdondkdhunuhuoohodhooghndgduodndhogkuhwnononkhoxhuxwudnoohnowuwhkgxnoghxodkdonxgwouwkuokhoohxwgkggknguxxdkdwxohkuwgunokxdohdkxwxwwkxxdhdwxxuukonxhhuwuugokdghhhnuoghgkxggohghuwookoxuudxdkhnkoxxkxwwuudgxwhwnxwgukhuxukwxgukdnghkxxogdohndxkkhdghhgggwuguhkdkoxhxdxkdnowhngdkdodwgdwguwonxhgnwxkxwwnwoguuwuouhggouokxuownwokwunhudkknogxgugugnxuwuowkohndoododdowkgxwggxhgdxhhnhhunwxxhkudohwxxnonoxhwhxxdhkkuxnxonxhoxkouougxnkukkugwxkgkuxuxgnkxkoddnnhuwnxdgdgdwhhdwudkoownxxngduowougohgnhungxoduuwxwgdkgwxxdoggdghxohnkdguwodxohxnunwgdongnhxudkugonnokxonugxhxwkoxnkwdddoddoogoxxnxndonghoghxwwkkdhwkkuwhuggwxodhggxgkxggxgdnnugugnoxhhwgxxhwdogugdukdnhxwkxnkhxwhhhuuuxhngwnnnonwgoxhkonxdndonknudogxuddwwwwnodnxowkudduwxxwookguonwkwhwhugounxdnhoooooxugddgwkwxwxxdxxxggxkokhhwwnxuogxggngnnghnhnkhhkokkouhohwhwnxkuhnkogxhgxxoookkwxuwwokkxuonnnnwnnxxnkugdokgwkgkguuhnkxdddkghuudgohkuowhwkxkwgohgkugxnndgwddxuwwudwokxkhooxxddudnxdxoxukugunkndkuhuwdoohdwxhxohnogxxgwdgwhngxhxxdkdwxukwxhokukhgdxwnuduwxuuwdndduhgwxwdwgkhkoddddoungkgkgggdnknggdnodkwgunxonnnoooxdwgdhgokunokuxnhkuhoxonouuwwodgnodukxhxgkdwognowoxxnhodkxnowxwwdxddwdghkonkkhoukogugowgwdwnwhnggogwgwkowwdoxhgdxuwwuwxhhkkhgknkgughokkhgdxghnnugdunxdooughhgwwgxuhukgdxndhdwxwwkxgxhndkuoodngkhndnwdkxwdxxuwwndogxnnnononxwkxhxgkwuxhgwuxhonkxonhxghgwdwhhokgdwkwgnkohxoxhookwnxdgdhggdoohwookuknhuuooxdooonnogugwnuhwwuuwwgnuxhgwuknhgoxkohhowgnxwhukuuxgoohngoxhkwggxknkuwnnkuokhuhnduwgukkhdowodooggonhdxwhdwhxhwhonuxuwnggnoddkgnkkknhdkdwgokuwugdxhnwudkkhwhhunxwguknggxxgnhoohwnxohuoxwouwnkdxdkxnoohxhhokhhnddwoudwkhdkoohwnduuuxdghkndgddgndxdhnnxuhgnxnohxwgxgxdxxghxguokhdkoxhhohugugnhhkhdwuwxkwhuhgxdoukwdgnxooxohwdhdhkdhogkgogoddwdnnngxkogghxogxhxouuxhxhodwddngungnogndwhokgudhhxkkwkoxwhnnoohnhugkookuwhndokhouwhgdnnwuoukgxkokkggdnugdxunowgunkkundddggonhwnnxkowddxnwxhwgkgnugndwodoxhnxuxoggnnwhunwddgundhudxowxoxdkxwkugwuukwgnnxgwgdgdognnhhhhoxnxoxoxkuxkgddoudgugnuudxugwownwkgggwoxododohnowkwokoggxnkugunwxxownwdoxxhwnkohoxowkoghgnkdkudouxddkohdghdghwhuxdgxwokuhkkuxuxhdowonkgggknukhwwxkhxodnndgnwxwndknononnnxogudhuudxgxonwxokxhhnkwwohwxnuodunddogdxuuonngwhnwxgonhgxkhodgodkkxddouknguxnxwkdkodndonnuogwddunuwwgwonhwghdwwokdxnkddkkxxwnouhokuuxdonxnonxkhgxonukkohgkxduxoxuhghgkondhdwhdgoknnxkhgxwugukduuohhwwunukunwuhkdkduxoggohwdwgudxohxwkwdowkukdoggkwgnhgkgdudghnwkxdghuddugggwwhdxxooookougnwkoxgxuohggkwhxguhwkunhdkxnugkgdwugkxguxhghukkwxokohxkohuwnxxgkdhxxoukhugoonknnggukgnxnxwhoxdhuwhgxgnnugwngnukxgddhwonowhgowhxhukdxukuhhkwhnkhohugwwwdxghkkwgdhdgdhdxudguoxdwkxnwnuxggnhhhddhdxkokwodhknknnugdnwdkwxnggwugdgunohuhdnxhhkkxgdhdwowkwxhhxdxkooxkoxdoukhnnuonnxugwwhdowouugwgguhokxhdhhxnhuxwxkwoknkgdkoghgnuuukxhhuwhooxwkhkugonhnkgndwhkxhdudgohkhdouhkddoudkuhnhxwnhkohggxokxudokkwkkkkoghkkgwwwoodxkkwunodggdwudnouukhnnknkndxnodwgxknngxxoxwwgundkwkduxnndokxdngdownnogwnhhxgdunuuhnhngoxhkdonwgwgxuuudnkggdwdwgogwhnhonndwxdwdhdwxxhuonunxxuownuoukdnhkwogwouhwwnkkngugknhdnnwdhohkggxkkuonodduuwwgxkouxnokguuouwhuhdwkwghuxhgnnkghuowonduxgdhuggnuxhohknxxhgxonunhduxhggkwxdgoxxwkhoddgwnwuoxkddugkhxnuwnwwkndghhhkxdodnkxwngkuhkdkkxxwxhkxuouogwxhwhnnwnggndgxonkxgdxhxgowkkouxguknnkxoonhgkwgwkhgxxxggughwkwnhggkkdwhoxuddkokukowuooowowukkxouwohkxkkwkuuuunhooxghkwgkxwuwwnuuwxnkwouuunxuhkokhnkonnnoxnouodkxdggwxwwhxhowuwhhouxuowuuhuuhwunkdnoknouuowhghwhoxnogkwxoghgkdhonwgnwdkwdgowwdngduwdwukhkuwnwuxxxhhdhwxwgwhnkudkxhknkggdgwgdkdnodhnwddouuxhdhoxwwnuukxhdhdnougonwouhukgdkdgoouuxwxukngwukkgkoggdduugdhugdnxuhwwwoghoxdunuuxhnwouwuhwhuongowudgduhhhnhwxwhwnuogxxghkxdxwgkkogxhgnngdxoowxhxohogoduwnwgukxknhkgkxgdoonwuhgnhdkduouwkhuokgwhouokngwkkgwwxuwgunwkhwhxnwhdhowggkkxkonhoxghwgownwhdnuknxuondnhooonnxxkxkhnndohgxhkxxdkkhgdhuggnwnoxkhouhwhdxdhuuudwnunuuuxuudoknkoohgxkgnuxdwwwgdonxkxwwdnndxdodwhdowdwdukdoxkondddhownonkwgdgugkokhooxkxkkhnkgxwgkkugudgkhxouxdhwuugoudgwdokhuuunowguxwkkxunxhouxnwdodhdxdddwododnduhwowwkdxdoohoxdwngwwhguxxuhkogdxxdnhknxwwwdwwndwxowgkguwwkwunuwgdghhuhwoxwndunnxodkudhunkdwnwnkkgoxkdhdnnhudgdxwguhdnxodwxgwwwxohghnwkggddnhnduhwdxknnhkhxdkhnxugodonhnkgndwxwohuhnwxoouxugndungwnxdnoggodnnohhuowwdgknokgwxuudghwdkowwxdghnuuonxkkwdowghuwoxguhxwuhowgwknkxkxudndowndgngxhkodnhwgxunndxhgxkxoouokdnnoxnkkuxhnokkdndgkxwkokwodxxohddxdgouohuwokudxoxuxdgwhkukuxnhgxxonhkuhoohghuduwnggowngxghxuuogwguwxkgudnodudhhdgdohuhxuunuddnnuggndkgkdxnhwdwkxghodwwdoogknxkuhdxwogwdhoxkwkxnhxguowwdundngudugdnkkukoxkwwokdnuggnddwdgkwgnkxodukhwhwwxhkduohunxuogdknxhgnxdddkhknguxhkknxuhxgnkkwkgguxgghoxnwokowwkxkdunkwhnhdwxkuhdokndwgoggnhddwoodgwhdwgkwwngxxgugohunooxukdugwgnxxuonxdxounduxxggowxgdokgouhkwwoouknxwndhhxhhnwkukngxwxuownwonuhudunwwwoownwkgkdwwoxuugnknwxoooxwnwwghohkdogxhxnkxdxwkxgoouohhnknhxwuknunookdxnxkhkdgwkuguhgowxwgwhhhwwddxhouwgkudgwokkowhdoxduoxgkdkxdnooknwwxkdoxknxhgkunwhnkhgkhnduxhxoogddkhgnwwdxhnuhohowgxkkudwdonwowuhowhdkhkonxwgxuguhhowxuxnugkukddwunuohnoghuukgnwhndndddooodkxnnwoghnkndouowwuhkuknuoohkggowukkwkoxhhwokoduhwnnngdnkwxddunxxwuwghdunxgonugduduohxuxdkugkghkohkxgnwkkxdhnhookgxogunuhnokwohhxxoudohkwndndndnnonoogwgonhgowguuuhdgdowgwndoggnghoxwkwogngdkwdhwhoonkwdgkknxnxwdnogxnxdwdgxwuxdonxodxkodxwwuwoogwdgwxdnuuwgnukwkkkowuokddnuhonnwwwxxoxddodkwhohkwhwgokwxgxduonwwwddxwgkxgunwukohududohoohhowgkgokwuhxgognhdxoxuwunoukdnxugkoxkodhwnwghdxuwdkognnxwndxgnkhgwddnogwuhuoxgxkxhknuohdxoxdngnnxhkxugwouunohudkogokuxhdggknnkkoooohgnkwdhdxnnkkowhguhkgukhhkkkuddogdxhukguwxkghhnnkggnhkggdgwwghxookxuhwnkdoowkgdkuwxkhouhognohwdgdndgdkhodnggdwunowownhdhuxwkogndudoddnxwdnnkogowkwdhwnxxkgnghukuowohngnwkgnngdkgndnugduwghodngngkhunugnognxwgonowdxgukkgnnuougnowuddghouoodxoxkwuokkuoogdxukxnkkduuhdnkgwhkhghuonndwnhkhdnuokuokdduggwggdwuodgwwwuhgkwkwwudkohkkdxukwdgnuxdxkxhuuukgwdhgghxnundgodxwnoxhgkowhwhohonodhdnuhdwokuxwxwgxwohnnuxgwxdxxowhwnodogdggokhoggwokukxghugukwhduwwnhhkhnxhuduxdkdkondungkhnggohwwnxwxxodgodkndhdodonnxxghddddonoguwggokuogngdnxwghgnxwnxkuxukddnkwohgouxghduwgxwoooxdxdxokkxdkhnouknokhnhwdgkookxwxoowuhnhwxkgoknhdwhwnoonuhkkhknnhhuudxgkhhdngdnxudnouwkuuongnwoonondunkuxnghdxowkxdwhwugxkndhodohowxhdnhuuxoduxkouunnukknungxxxxuhxwuhwhwwkowkookugkkdouwngxkdkngwwxhouxxunkghohwuxkuhkhxkwgxxkxhhhunwkhunhuuuuxnnddhouuxhuddhwgohhohkoguoxgdhgkwndkgduduwkkwhxoowwgxgoxkohnggwogudkwwhdownkuugggxwxhkhxoxknkkwxhwxogxdnwhgkggnkwkhuokghkdkuhgnnxwokhgxddunhnduhwwwwxnkkxdknuxkgdwhoonkdgdnguoowoxhgknhonhugxohwddhhoohuxuxkwndgwxkhnoougdkhndndnduhxnwokkonxdxnhkuoxddxddndouhkudhdkguxkndodwwhhkxkxkdgxkuuxhngnhxdxdgdkxhgndhkhxxgnwhnhhwongunwokdxxuhonnxongowhhkxdnkuuukgddwdudwunxhxxwdgxknhnhghugghdxndkgoxnodhwoukwxgkxwwghwxwnxuugkxunohughudgxkdwuughkgkwduddhkgxkooouhxgudokhnhuxxhdooxgddxwkonhodkuxdgkhonnndknoudwnuudnwduudognodwdnnhkwkxhoxuxnkudwwgxxohhgxhuhugxonwokgdwnwnwdhxkkduungxknkwhodkugkxhkougxdnngkuuodwkxdhowoddgnonxuuxxwoogxxouohdxuudnwhgowdondxkdgdowhgknuhhxkhodkdooxhhwwnxhnoxnwwgkknkkwhwxxwwddggnokggwhxnwooungxnundxkxwkkkdkxwnxoghkxnnwkxukgnxdgoxohkkwkkkwhggwohnxguxdkxhokxxdwgghowxwdnwonhkwgwndhukxxghxkgnnoxnwxwondohkknhghdououggnwxgggnggkwguhogohwwkwdxxgdddgwxgkukdnxhwdwuowudnnunnwxhogokhuudkuhggogxwdxuddhkngwdwxdokxhhwnwwgxokuwwnxkuonkwwgnxxwuxonhuggugnukxxodxokkxdhnhundnnnxhudxuxuohkxxndxhkhxoxdodxuhuhdxkuokhookukxgxxgkhnkxnhkuonodhxwnkddxxwgxuxwwhghwdkngdonuwuxugnddxoookudnunwdogkdwkxwudnxxowgdgkuxhgnuooggwokwodduxdgwkukhdgnxunxdwnkngwukdwgdkxdokgdknxghohxgkouxkundxundknxwxuuknuhgwnkgxgwghoxwxoudnnudwkdhxdodxunwggxkxwnowoohxohkggxgxodgddoundwwdkxhdogknwxoxudgkwguxuxkgowwkxgdngxkogknknouookxngkxhowxnowkdggkuoghhhhwhugdnuwwuhhddkndooxnnhdwuuouoxwgdkkgoognkowukwohnnhwhhwhkhdggdngggwhnguodgnhhugnondxnxunwungndwwhoddwxudguhoodkhwwohwnunkwkdkuxghgdookdxohwwukdnhonwddxudnhuwnwondwngxkuowondwxouxnodgxhwudguuxxdkoukdwdkokhkhuoxxkxhguxuhondoowhuugdhodwuwxhhooxkxgggxxwwkowggdhdnguudnhugnkkounghxoowudhkgkwdoghwxogdkgoxudxhkknhkodoonhxxxhdwxdxxdwdkwkxhhdxguuxwnnhkwkuhowkudwoddgwwddnxkddnhwnwokduukkguxggogwxxxgknhhxookhdxwxkdhukuhhgwnuuuwuugkxgonugonhxdkkwhogowhokkdwghwkwxnxokwkwxxxhkugnxddhkoduhdhgxxuwnkoxoxnwgokdxokwngduowgnwgxnuonghxkdwwwhdkuonuuoowhwhxwugndokwdokouudhhhkkxkuhwgwnnuddwdwhgkdkdkhugwxxngghhnxxxghxugdowuukugdxkxuwgxnhdnkohduugwgngxkdghxnhkdkdkxnddunukxgdnkxgxgxknwghdowwggxhgkgdxhgnuguuhxgkkngggoonkhgdoxkuxnnoggwgunuonkhwunwggkwduukuxuoddugghwhwhwhukxkhkoguuuohnhnhgkxuwdnxkoxdhnogdnhwgnxnoxduhdnxhkonkohhngohwnhwdngxhdxuukkkdxokgdxdhggddguhkdnwooxxkdwwxkdxhnkkwwognnnxddxdwxwnkkwhdwdukhxwgxghndxuowgoowghkukgowhdggggnwkxuuxoooknxokwnhgndxwhdxxgguxnhkgkhwnkkkgxowhuwnknongoxgdnnoguoxwgxnhwdgnkxdxokdwognhdonokuxhxhhngnxogngkwwdunukwnknndukondgnwunudxunwguuhungxgxwgwhukgguwgukugdokohhddxnxhdugxoduxxhhunxongkonxowxnkowxowwokgudhgogdnunnuxoddxdhuxdkgkuodhwxkuukodkhnwkxuxdwonxuguxdudknknnxgkwgwndndxhngddooukgodhhhghxhxgghwggwxhddgkwwnhdwoudugxnukhkudkkkggxgkwnowkudxwxgwoxwghugkwokkhnoxwxwodugkgoxhgwhhwkuwkgkndokhhxoxhghdwkgwuughdwwggugnwudgdhkkhuduwkxdknhhgkkkdogoxuxggguhnngdhkddgxxoddwndkwwounxowwnukhudgogndnoxwxuuuoowodduwhnddgxdunxwwwnokhkwnknognhwogdggguwxnhhxwhggkhkkgnwwugoxwkhoddhxdngohdudoukuuhdgkxuuuugdhxdodkgdodxuodhknohkwudkgdkgdxwxukhhxuxoggwhwwwnonngkgwowxhnnnuwghuukhhkuuhokxngwughxxouuogonuwkxxowknngdhnnkhxgxunhghxowdonhghguunwnowknhnnxogxwnddoknodknuxwkhxhwndwkuwwuokkxkndnngkodgndxonxwxwhnxggodhwkxhgnhhwouuduwhgduwxgokngkwdkdohwdkhouhnkwkxhhnxhkwkundkuwugouwxhnokwokxokhuxnxndxudnwogoxogkuwkwnknnxxgkgxoogukgngxwggdkuogkxukxhkkkoknwwukwhhwhxhxxowgukxouxgnhxuuunuuhdohkxdxgodhnokkuhxwodwxnkkxkoghnohoouwuwuxxnxodhxwwkgnnhhxonkkoxxgxwwxghgxkhwwhdgkwdwgoguwngddxohwwxwuddxnkxkdduhghuuwwkkwuowundhngdudwwongxonwhwngghxdgxkowgxgguxudoddowoknundnuunwkwuddnowxxghkowdknhggunwkdnwdghnxgnuuokooxunwnoghhgdkoduddkhhnkggokuxdxhhngnhnuugungoogkhguxdhngnnuwggwxhnkxknnnhnwkwwnknwhnnooxowdokwkunkwxndkgkhndkkkgdgdonogkkndhwhkgnwxguuggkuwowghgohnwkkudhkghnhxhwoxwnokhhggwhwgxnhwgugoxgxohnddxgkuxnxhnxwoowndhwnngndhkdhxhggkogdwnnnwgdnnghhhwgudnoxxwduxokxodukuonhhowdnudgwwoxhuukukknokugnhnuukdhkghdoxwkxdgnwwwguxodhkgguungxnwuwknhkdhddhkgngnwxnxhhdogxhnhguwogkwhouddgkgwohwnguhnwhdddgnouuohdkuodhkdnodkwddhkgxhnggkonwhkguxhuhkunukounoxdnookdxdokduuxhxnuhgnnhuwwkgghnhuwxhhwkkgwgouxugddnnuwuhwghdokoknguoxowogkuwuwdgkuokudgoukggugwkkgxgwukkkwhonxnggxwxoduknkodhdokxdhhnnoxkwwoouwgoukhdhhkuxoouxhuwxxonnxggdunudwhhwhwdwuodoudnhduxdngwnukxkohhduxwnhxwduuwgdxhdhndhduwhwnxkonkwuhhhwdhkwouxgdkkodhknnownuhdxdkwngnkhgohkdnndduhouugdngggkwdxuhxghknhkkwdokundnhhxwhwnhxhuonkndhdnhngwghxuuodunnnhkwkdwougddkhwhwkngguddwxkdkgohoxxgnkxdowhkuxwudhhdgwokdgokhkuxdnhoukgwoodhwhkunwogokkhuhnxhudhkxwkdwdduxxknwxuuwhwnoxukkwxnkxkuowxdkohkdwuxuwohxnxnwxngugnhkugukxhhuknxgukddkkhwxkwhghxoggonkhwowuwohdgggxkhognhokuhunohxokunhhknukdgogwgwkgkoowwxgguugngnukkoghgxxhkxkxkhwggwwngnuugwdnokokoonhnghddwgughwuukuukkhxxxkgghgokkhhwdnwnwhnkxdhxkunoxkxhgnwngxdkkogugwhhxuoxduhwuhxxgdodxxuukgxnxhkudhhdgwgghdnxwwxoooxnxnwghhxokknhxnxdkogxuudounoxwhdgkwxngougkgdnhdgxnwkduxwxddkxdoxkodxgdghunkwkugowgnuwwwhndwhxwuounodhhdhxoonodxnxnxkowkkkghondxwhudxuudxuogkxxgdgxhwhuxgnwxgxxuwdwugwxxddhhhhgnwwdonhxuxgnuxgwdnxngwddodokdkuwnhhhwgonxwwuongodhxhgduowdkxxhukwgoxogukuhohxhnoddkxduwnnnngowwuddddhdknohdxwwnxxxgoxxuohgoghwuhwndknhwghduxnxknwohuhwnkouudoddwdhhxunudkkuwdgwgnwhhhnuoukunnwhnkoddhuonndhxgowunhnhkkgwuwduuuwnhxggwnxknhxndgwugxnnxnxuxnxwxxwnodhkguugwdwgdwnongwhhkwdgogokgxhxwkukoknkodgxdhnxuukhookodguhhogwoxhndggnnuuhwkwxngunwwhkxhxdugnnnuwwgkunudoguokhogngngnghxwgxxkhxxdnkdkhduwnkwuoogwnnuwwghuxoghwnhkkkhxxxwxdxddouowxxhxukgkxdogkxhgohunkhdunngnhxgdgohgwoggunuungxkdwhkonunduowkgxnkowxwnwdhuhgdkghndwdkkngxouwhnxgwdkuhdnkkdnkwnwdndnkwooouodggghndwgggwkugkgnnnnuwhdgokgwuhnhhhnxnowhhowwkkhxgudguuhdkxughhuwokgdwxdnxnuoxkdhgwowuuhhxxuxgwgngndnwwgwuhdnnkugoduxdgdokdoudxhkwhnhdggkxxnuggouwwknwdnoxgxngoxxnoxuukwnxohhgnuxkgnxggnguhwnuxouwgkkohxonxdnnundhnogxugdggkgdkkukwwodhgkhdkhnhdkkddukwhgdddhookgnwknuonnuxuodwxkhxnhudghwhghkkgnwdxkwhwggkxnwohkwwuoghnkgkoxwduxddwdhgndwwxhddgkkwkhnxkdnwgudnnxxowngnnkonwxxoggguuwgkokouxwonukhdudnwddhxkwnkoxugugdwdwhngxkhdnhxwwohwgoknwuxdwdkkhwwnxhkuxoohdkuodgknonhknhhkuxkhuxwuukgdgohukugwgknxhnwdnduggddhkkgokdxnxxxwgodxxondunokgdkdkxonogguouoouxxkdwgodxuogxghkknhgognkdxwnkoogukgdodokoghnduhhnnkghxwkuwwoouogouwgoxkoxdkuohuhwuowwhhxuwxdudgduhkdhwxhgdxkhhkgunouowknhdkdugowkwnwunhxunwxghwodxngohdxgghkgoukodkxgnxdhngwounxxukdgddnodggwwxgnwgdxwkkogxgunhnkokhnxhukoggnwuohkokgdxnkhddkhxhhduohxgogdgdxndxxdndoduwohhkxhgkwoxodxdowddngnnkhnngghhgnhhdukounuxhkdokunkokuuhuwkoxgwnouhgdnowdkkooukgoxkwuxkdkwguxuwwxgkwuokkghxogddkdonhgknonknwnonxhudoodduxguuknwxhxxghdndudwoxdwnnoxuwdkxgkxuxxwonuwhouxuhggoxgwdknnxhnhgknkuddghoudgwxwdndkkgxododnkuounnowdunhxkgxgdouoooknuughnwhuoguudkhwwkuxxkxnduxgwxgnoxnnnohgungnhhdnuwkwndhwkkuknkkdxkhwwwonhkkoxgohdwxnkwdhghhunuxddnxdwxxxwgkoxwdduhxwwdouwuxgkwoxoowxkkxhxkokkguwkxwoouxxkxnwwhhkwdodkuuhugnwxhhunkknwxwnwukdwguxdnduhkxhuhuwhndndowhkwkgxodhhuwhoudnxkxuguokuuxxkonuxukhkgwohkouwdxnggnohwnwngwddddxhxuxgoukwoxgkkdxuxooouhhhgoxhwkhdgwhhkokxudxxodnxknnogkdudhxnnoogxnxhuxgnhxkkdghxohnndndwokhukwkoxnddxwgdxhdwuwwgxogwuhwodhokugoxnnxxuwwxnwdunoxnxwowuonnnhhnuhkkgonxwgookhxxwdhknkgwdxuhdgkxhgouuohkhkxhdduonouwwuxuuhwxuokdduhukknxdhdougwwgogdkudxxhguwugkxokukowxkkkxwxwdoxkxdwwoxhxwkgndxxunuhkdnkoxdowxxgxhxkhxhwohuwkndukuuwndkhkwhhhhgdukxuokxgnxoowoxnwdkoohgnhgwdhnhggwuogoxhugxuhnughhngxokdodggkgxxhokkukngnogukxhdkgnodndhwngkknhwhuuwdkhgwkxogudnhhgnwkhwngdwkwkkkkkxkhxdkooukwgdgdduhdkkhuougukgdxoukxoxhgkgxxgnwhogkukdwowwgodkgnxhgguukwokuhxkodohhgoxwhundngkxuuhggwxhogdoxxknwokunwgkxnxguowunduohwdunkhghgukdwdxnnwoxoouxhkuoknhdkwkugohduknggkgwkndgndhnknkkkuokoggggwkukkknwnokgoxnuwhnuhdgggdwwnguhogkxghdnwxwxxdkuwkghoxhhxkwkngkhudoguodwgnwuxgnxhghhdgwwxkuwwodgnwdxkukxhgxnnxgwhwogdgggndxhwwwxnouwxnhoxknnwhuukhwoduddhhdoxunnoohnhnuwogwkxukhunnghnodnhdxoxwounwxkodndxdhxgukddohxwokuukwnnwxnkgddxuxhdonguhhwdogkukdokwhuuuhkdukhkdwxgudxuxdouxngdkohwudxwwhxhuhoxuhggxdkxgoxguknguwggxkgkunwuwgghwduxgnhouogwnhwgwuuxgkguokhxuokwnnggndudkwkuuwohxggugouddxkonoxkuoodwnxxnggdouhkwkkuxkhkkudguonwhhxuoxxwddnwxudhghukhwxghhdhxhxgwodwddwguuhounxdgxghxokwgwhdwhhhhkukgnwgnuwxwhnxhwohnnwxuuuoxhwhonohddwgouowohhowdndhdnukgkdwngoxgxduxxkwokdhugkwkxgnouxuxxuoxgkuowkkgxwxooukdhgnnhkuoungxohhhgndoxkhnddxnkokhugouughkguuxuwhnddgguudooxdnwukdhdguuhudhkkwkhgxwunongkkdwuuohgwggwwhxdhxdddkkwugwkdwnduwkuwwunwhgnxhouohdnkwxxgwdwookngkndgxkodxgwodxuhohuduxhoouhgxxkdgxukxokknhghwknhukowwngxhudwkuuuguduunughxodhgnxuhdnwndhunoxxkouowxgxwddwwkkhwkwukoxhnxxhhuxoghxkdnxhowowkdgxnooouudoxonhngdwxhwgwgkndxkonhuodkgghdgwhdndnxxwnonnodnuhkkhnowxgdkkxnwwhwgwnhxwgwugonnooxdxxhghwxgndknognngkonoouwkxnwuguookgxgohoxkkuhuwhkkoongkuwuxngodxhkogkwkdoohuogonwonuowuxodoxxhwohdwdnohhdgwhdukkuuwxdkhgukwdxoknuhxdduhdkwxdhdhdxgwogxdguhhxxwokngnxgwdgoxognnngwooxungkxnhnkdnngwnhokkdkdxuuwdddkoghxwgwuhgokndhnkwogghdhgnkoohwgnnnxggnxwwwnugoxhuwunxdhugdwhddwhhxwxxxhngngdgxgdhddgndddkxxwodxxwgddghhoudugnhgkduwoundkuogxukuokwxhnouoxgnxokngkdghkwkkudhknnxuwgdgnohdgdugookwhuwuxukguonwgddohunxuoxukggwkuwnuxgduhhdkkohkuooxoxknhdnhngngwnuoxgogdkunohhwdxhxnnnunognxguunkxodxuwwogxdoknwuouondxnngukwhoxughwwdgkookuwnnwnxxndukkghnowwwhhgxgxhgduggwhoogndnuxwhxhgnhxghghwokwuwhwxuxhxuownuhhuugkuguxokuudgngnwhoggdouokdgwgknxdodwwkhhukwxdxuugngwwkgxwngwuxgduhhwudhnxukungdodghhhxxokdowwxdxgddohkxhxxwnoukgnunhdxodxnxuwuxguuhdkuudodoxgnhkdddkkgdkwxdghgugodgxgxknuhnwknwdgdxhuwwhuhndkhdddwnnnhudhunukwhxdxdukdxoowhukwodddukdwwuwdnnhwnudhgnggwwkuxdgnhowwwddnoowhxnhwnwuohxkuooguxngxxgdkkxunkxnnkgwdhgdnwdddnhougkxogxoogwoohkggxhkkdgdwxhxhxwunuxuuhuuudouududgwxknwxwxxhwxxxhggwhnddkxoununngdugkxngwkwknwhhdhnhwhdgkhnkdhgggdwgdoxngkouhwnuonounhdgkkxnxdohnwxgddkugddhwxwohduxoouwwdxwokuwkodhkwhkwxwdnhnhdnnxkkhxxdowdonohwdgnunwnxddgnwwxdgwxhkhggkdwoxdogdguwdokxgdnowonhuuonhwwxgwkkwdkwxnugkxuxukxnwggxdxxwhdhxxwnhkukduouhhxhonxwuowgowuhuohhxdgdohoxnoxhxukkxxnuunxwndohwwxdguwwxdgudgdnxoohhngnnxdugwgwxxknhhhgownhwnnuxxngdxudxkdhudnndwnhgoodgudwddnhgwdhuxndnuugkokuhkhgnougouxgdgdukxhwuudodgnwwdhwwdonukgwhhndkkoguhgudwgxguoduxwkdgxouxghndxnggodwdngkndudkxognxkdoghdxowwhwknnnwokxdwgxuuhwndnguownnouwkxwdowukkgdkdohdhnkonoknwokhxhohxnnnuwohndxgooxhgudxxxuxhwkxhuhhnukugkkkkhuwddnodnhonhwookngoxghnhwuwuxodnknnnwdhwhxonxhdhwhxhhduwokhwnggguughwgkxxkuxdndogodhgdhnhunkddhxdwgkxgdoohxwgndnxodxkgowxkgdwuhugonuxxwundgnhnoxnxhdouuoggogonnhknddhgwughwngwuxgonuhuhdoxkxxwkwnoguhkhunnwohhoughoodkhoxuoudkkungxohdgudguxxkudxknodwodnhduuwwhunkxuwuuhxhgngdnhkhnddknkkggokxnhngnuguwdxnkwudokxkoowggdnhnxuodhhhxxgdohghdgwuunwdxgngkogdnhhnookoguhwhhdhuhouoohxwnukukuxkokuxdnhuwwoxkxkxdodgkxdgdgogxodogxkdowdgdndnwddwknwgdkxkwgggkxhwdonnokukxukwuudhuuukgkkwndnkdgdwndwwkggunxuukdggowndnhnukuhokddnhghgdgohoughgdxhwkdwdhxkgkwuukgghnddhxxxwddkxwgkkdgxonoowgdnnxdxwguuhwgwxnhdgnkokuohxxdwkogxguhwounuxnwnkudgudxhngwnudxnwxxoghduddxdhndxoggogoukkxndgkdudxuugxxdkwghkxgkdxwxkkxoxkwodwkknhwxnhkonxnwwwoudwhdknxxhgnxxgxnodouwxwnohkghokxgnwdodkxuhdnogwwwhdwuuhxkgndnhgnnkxxnwnokkhngogoxnoxogdwuduxgoxwxndxownddgxndkdxowuxxuoduwdudkxhkggxkonxkxxokxohhunokuxudwkoghdhononnwgwxddwnkdhuxuhhoodxxhwdouxoxkxxogowhnxokxxhnkhgwdhgdxkhhohohxuowuwhkukkkdggnohdwkududugkdhnughownkggwxkgxdnghuohxhkwkxhgodhodngkxgkkkuxngdhggodnogdoxduooohuwuwddogwhxuwddgduhduxgowugwwhdhxhdhwhodogxuukhxxdooxdhhugkwkukudunddgunngnokunkwunkoxuggxdduhhdxuxhdgxgkouhkkdodxoowgknounddokghgkhnwnxnwnhhwhdhuhgdggwoohuhxdnkdouwnhwhghokdgunundnggdhgdwkdgndwnhguxknxdokhuduoxhohxgwwxnwhwhwnwwdxnxhowoxgwudgowwuduouhhwnkhkkhgxxwogokhwgdhwunowxouwddgxdngohgouhkxxoxwwduxuwgowdxggwkhkxngunxwuxkxguwhxunkkwdukxoxgknggkkdohndkndwuxdkndxuunoxwwhuuokohkuuouuxwoxhxuhxgokxgdwkdogggngnunknhwhodngxonxxkxhgddouwwdxdokwdhhuddnkgkhnukoghkhugdxouohxkgwudkkkkxogddokhwoxxkhxnugdxwwoudgkwxggdkkngxnhxhwkhkdunxgxgughxoddodwukundwgwoodghdodwohkugunwkouxnknwxwhxogdnuwukohgnukhkuondkunohxwnondokkkukkkdxkddduhxxuodxkounwnwxghgugoongxgnhuokxnuuwhodhwoknokkuwkhwunkdogxhxhndwkxngkkhwodknxdhnhngxohggwodhngogudogknkwnxnnuuhoohgwxouxwhdgwokdoxndnoghunduhxwknkhgghwoxogwwkkgnguwkwwhuxxunhgxodddwdnwhudhdwxhuxnouwgwdxwohhwgguwgwnhnuuunuougudgdggddnxgughnwouugxuxnoxnxgdugkgnkokhwkduuxugxknogkwkxhgoguxxnukhnugodxdduxwndkdnknonwudknxkoodkonnhdoowxnnkkdhkngwhxuxwkudnwwkuhwduouuoonooggnowkkunwnhxgdwkudddghxgdxogoxdhodkoggdnudwnugkkowgghkoxggohhggkonugggwgxghwoognkuunhngnoxouukhnhxdudwnhwnwooowhukwhnnukwdxkoduuughnkoknhxwonoouuugouwgnnhuxhxghdokkugoxuxwxwhgggudxggxxdowddowdhguuhkxwnwxhhuhkgwugodxdguoghuungdoxnuuknddnkwhnudxdkdwnnnkxgxunwudduhhnknowdgohdxngkkxxkwkwgukndxwdonnnngdnnoggwdxuwuwowggnkdkdhuxxxuduuhdxunxuundhkgkxxgnoudooohunkgguuhxwgdwnugdgkknxoxhwowhdxwhddokwgghnxudonuoowwgookwwnoodgknwknnuhwowuwnnngwwgxgunnkngogwohdwdowhkwddhooukhdwhxnxunnxduwowwuonxudxnouxnkwwhxxudknxkxdkxdunghogwnhxunnwwkdhgouuuuhuhdgouhwwgxnnhgukhouoowdxhonkunonhdgwuhukdodgonoknxdnuwxxwhngwhghxxkgxxkxwxdxudooxdohuguhhokghgdwhhwnnxnddndkddhukgouokhudwxwwnwddondknhkwngddgxxdwwdognxudxuwkwkuxokoxnndkgkxxggnhnghdnowxwhnhuooxgkwxguouuxhxdohwwddddnnonuwuhxwugkhdxwwggknnguwkxddokwnuwdxuoxggwkogdowgugddhookwoxhhduoxdgdkhwhndgdkhohoonndnknwuudnkdxwkuwkhoxuxhkxukooghgnnognuogunxdudwnkdhnoodwonnxkguggdwnodwhnguduuuxhkghdnwuukxoongkxuunhhnuogwwuoxnddkgudowuouuxdkonndughwhhugggdnokxwkkowxunxkgwndnwdghxwgwkxwddoxhxkxkggoxknggouhohddkwhwdnhuuuhnxhoowokuhkxdkwdohdngooouwwhdggxwdxwxkknohndkuhongnnwhkugdkhkwnoxdugkohnwdhdodngwwhnxnwwdhnnduhhdxhknkddwondugxhhgwhddgonnxnugwuukuxxknugnkhuudoowhhggnogoggoudkughoduwhuhuoknxkngngxduuwhohxgwoxgwgdgdwnoxhngdghguoowdghwgxugwkkkoookkkukxgnwukxgonxokguuuoduwhnduwhgdxhwowkoonxxgowndhkkhuxdnxnuoouhodwhohudukouuugwhkudxwuxxwxnduhoohxkknooxuwhnnwhoknkhgnggxkhknxhhxnonkxxooxookdddudggguxgxnxwxgukhongnwgnxuwngkdxhwnnwwgkhxwgxounkxukknuwgnxhwkdouuxghoxkwuxndwxuunhukxuxunwngnuoxuwnhknxkngoxhnkuouwhxudkhnxkwduuxhugxhudgoduonkhuhonhohxndwnxhowooouuooounwwwwxudnhkkdooohwwhdwhdxxhdhnuwoxkkhdkxgxxkddhhhdkxxkhkdgguxxkxghkwxdwhgwkguownwwxdngungnkkgoggoxonununwdukkxdxxxnnkkokhudgudkhnggngohgdudgoouhnkwwnkognxxokouhkgxkkohdwogwodkdhhnxgkwghgohgdwdonnxggonoxwnuugkwxwkxxudxuxdkwkxwnxhgghxuggkwnggwkxndowwhuxghxoxkuunuhxukhhkdkuuogkwhowddwgwhxnodgxdxxnxwugkuhoxgdougwhwgdhgodkdxnnhkggkwdnwkghuddhxkuodnxgodxouxkkxugwodudnhdhonxkdxwuuuudkkouhwdxwwwukgowodngdwgkogwdwwnoxhwgouookkhokdhddkgogxxugohknhdkwouwuhownkoxnxoouknwnunowndodkddnhdhwwuxwogdgwxndhxuhuwnkkgxdwddggdnwuwxnngdhwhgdwxgwddokhhwgnnwgxonggdwxxgwwhohnkokkxhogguhhndghguunoknnhddgwonuggwnndhgnohdnwoodxddhdndonnwnddxogwdowuwddouggxxhowhxkkokkhxwxodnuondkxgxwgkondggogdhdgnuwwkoghxnuhnwghnwxokwngkxuuunugdokoodkwhwodkgwnnghonuundokhwwwgnwghxwnhkohwwxnudgwnounodxnuhdxnkguohhwkxxdkunkxodugkxxwnghdhwwohddxxxuohdokuxgxhogdnkkkgkdxnkwdxwwkohwgwudgwhndggudghuugdhgxhwundkkhugdhwgohgwgnngoudnggungkgkhhogdhuhxkxnnuggdhundgonnkokkhouoknuodxugooohwdwhdkhdkunkukwgkwnohddukhwxookgkxgodghnxkhuhdgkokggwgdgwwkxugunukughkguwknddokhnwdxdwwhuudguuuxxohxunngngunnhugxxwxghhdgxdnngxhnudgxowwugkhxkguokwuwghuggudngxhgnxwknukdhhhkwgwwunhuugnxxknhdonhkgxnnokxhhkkdogdkkddnudhoxgxhxkxxxwhogddddxkonounghxkhgggohgghkkwkkhugdkogwkukkhhokdnuwowhwnkxngxnndnnduhddxxhxhwxhudnngwnxkxkdxowuwwnwghhhoxxxkgknonhwhhxonohnkuhkxwxxxuowxkoggkoxohowuuwnnwkhgxdhgkwndngddnkdxdwgougxxohnngnhgdwkhxkhohwokxhwkwohdonuxhwwukwoknowdxukwkdwhonkxxugnhnoukdnknnxudhxwghwdxuonwndxxuwdnwonokxwghxdkxoownkdwoxohuogkdwkknoggxdunuwxounwoxxwnhwwgnknkognuudxnnwdxnouxgkxdoxnxukkowggwuukxkhkdhgwwkdhodoogwgdwxuudwghwkkxouwkxhugugonngxndkwdkxunxnnwognohhuxughdxdouhdxguhodhhnwnownxxxwwokkxkknuooxhohwnngnkdguwdnxnkgxdgowdnduxkhkndggxdwuohhngkkhnxnxwuxhogdukwkxoxgknogxnohohgokuhwkxdxkdgkdgnguhunownhowkowdwnxowxgonwdwnnwhhuwwowgdgugxdwkkkxxhxonduhuuhnhddwkxgxoohkhdggggokuhuhgwnuokwhnuxhxxdnkxgowxkuhhokgddkoxuwwgdkwxxhkwdgdogoohhduukwkdkwhouodhogwnnoxnuhodhxwnwddkugonokxnodxwdnoxowghkuguwwgodnuggdkwhgdnnhuxwgnhhkkowdwgodxuhdukdhhuogxwnwxnuxwkwhgoudwhuhnkkghdhxhouohudugndgdunkdggkoohngkdddkoxnkkoddoggxxudwghohxuoxhwhwugooooxuuuxgnhugnnudhnxwowkwwwhdduouoxkhnxgunoughwhdxdknokudwonhoxdnhwoxkxguwudgugnkwkkuddhxhhngokdxnwwxnkxnkhnnwwhkunkdkxkdgwhdwdoguwkodduwnuwkhdhngxngdhgwwkkdgwgohggxokwxgnxnduhnwdwhnuudoukohoodnkgdodhohgugokhogooowxhxonwxwudugowknunxoooownggwhdwdknnhwhoonudnguonkdugwoghnokxwggudgonwoxxkhuddwwnnoogguxgxohukwodgghwghhuwnngdxhodouguuunkhxxonuhxhdgndhxgkxdwnokoxokuohhdoxxguwoohkxdxwnhxgohdngwhnkuhwouoxwkdhunkddkdxnudohxhngokuoowuonkkgxhhwkhnohdkuuxnhonxnknnunxukoxuxxkxggokghnkhohuhgnnwnxkuxowdwxhnhowokxnwuwkwuguhowndununwnouoxdwkukdknukwognngoowgwngxonggnkkdgndwnhnhwhdxwgwdgkdoknudnxkdwnuxhhgnhdndhgnuxoudwddgondwodxdgodugnuwdwdoxknnudhnkxdnhhdodwxuugugnkkkdnuxgugnowddggndxwuukgddognwhogddgxudwngnwduudkhhgdhugdhuwhgonuwdhukdugdguddggxunuwxxxgokkowdkouuwwognuddohuwnwwxxogwokhnwuknkhgghukohnhuxdwhhxxdkowkguhuxwohwdugkgwgnndwxugxxxouxxuugouxkuuwuhonogndugwwnwdhnxnhkuwdnudxwogoxnogognghhkxwhhnknknhdwnugnuonkddduxudhhodgudggwuxohwhowghxgwhgndnnxxnhowuonhonkxdnwxxkwuwghoxdoudghhnkdxduhhwuwwoxkoxhdhookxhudhoxohgdouxdhdnhhuhkkkogkgkhhuxdhnxoxgdgguknkdxnuxwdgwknhkwdngkxhhgwnxngghnwnungdkwnhudnxowkkokwhnxxnxgxwdwhwxxhkkdkwunknndghudkkugdnwggndduhooxwgwuxdxxokdkogoxnnwwhnkddhhxhnxnnxngwhwdkoowwhxohwodxughxkkgnnnuxgdwwwhxhgkwggduokkdngxxdukkgkhoxowuxoxdxngwdxgohoxuohoknxodonnxokkkdhguwunhkddhngwndngknwoddwwnxkouoooxwuownwddxwdduxdggxnhohogdwdwgughwkkknnhkhxoddoguhguxkkkghkhokodhxdnknkgwnhnwkoknxkwhnhxxoudhhhkdnxxoghhnwuuhwwonnugnwknwgwxoxkhgnkuxddouhuhouuhuwokukoxggokndwnduhgnguwxdhhwnngnxnndghghokunggkukuddhokdwkdokuuxugxxgghhxngdukdxxhxdxoouggggnxoguhkdkkxoouogggnxxokkdnxukwggdgowuokkxogkkwxdknwkggxgdnngkohnkkdggkuokxkonngwxhgdwuhnwkuhngkwoxokkoduxghxhokwugdkohuhuwnuukxkduuhdoxwwwdwxdwxuxodxnxwggowxuwwwhddgxnnwhgdwkddhwwxudxogxgxkohwhgwowwoxgknkxoddukxukuonwggwxookxdhdkkhgxhddxkdxowxohhkugnggxkhwdukwhgdngokgxuuxouwnkdkdnkkohxuwghdkxwguddwuhkguoogodhghknkhnnkhxuohndxnnhouudnohhdguhkdwhnkhngwkknhwxowxgwwgunwowgxhxgugokgngdokxxnxuxkokgndudggkwggoxknuguonugooxhkkdnoudxwokxkwugxwnodhkhgdwnogghoxhhohddgononnnxgnuwgkhkxgwxxoohxngowokkuukungngkdxoxdouhnkkddxxkkknunuuhknggohnnkhukudxxdkkwhxddguuuhoowuhgohnoknknxxhugwoknxkndhknwxxwgxkouwnhhgnwgkgnguukgngxunnhwuuddwghxookkddhkxwghoknnduxukkguuxuuwgwhudogowgdhxonuounxoxuwnnwoxodhdhhgwhkhodkkxdxkhhdxhogokounnokdxuokxgodhkhkhndxgndohdwowuxhuhnghdkdghxodwhwnwounxhxowhxnxwdkhhgxkkoxkxohuogndxddwohungwuugdnnguuookndudxdhongoddnwkwoogugxdxoonhhgggkgknnohunhgdggndkgxnghunoxgukhuxuknoddndxowoxkkdhgwunxnuwxdkdndgghhgnxhkxnkgxgkduwgudddduxwgxwwddhxukndoxwdgnudndohoooogdxdxwghuooukooogodhuhnhwunwhuwwnwxuwhuhhwukwoxdxnxuhhhxoduudhooxgdhxudxooxnxkouuwnxhgxouugnuxuukwhknnxdohkwgwxwxwngxokgxnkwowgkxwxdhhkkwwxkhggxkgxgxxxouoxghwxkxkgkkkxgodguundnnduddgkunxnxwhgddxxwohgxgohhxuohnoxhnhoxxdgwnxhxgowoouoxgkuxwhunwhwhddxuxwkwnwoddnuwokhwwgwwxuwnxuougooonogkkunhogkwkooughngkhgowhgwguddkugxwxgwduwonhkudwhhnghwwunwuguokdwoxxhhxunhhkdonnoxxkdnwunkddhxxohwnndukxdodnxodxoudkkwdxhxdknhuwdwhdugkkgxxhodowxnodghkogonouukuguduooxdduhndddwnnukgkwohnddkhudnnoouwhgxwuuhkkgndgukknudongwodnxwxohkgxowgwhnhhukkhugodwoxxnghnkooogngnuhuhohohxxoghngnhknuodhhdouwuhnnunwgxwwgwhgndxwoghwnkhowokodhgugkonxunxhhdkogdgnggwkkgguoukdohwkohugdwxdwhokxxuxdkghxhwhwkugdhwghhgooxnoxwkkwnodgkuwgxkxknkdgdkwoxohgdkwgxugkdxxhxxgkhwuwhdxogdhuouwwhodkxkwxdognnwwogwoxkduwnnnhoxwhnwkwwdhowwhxwwnguxhwdokghuoxdxuxxxwuwunkdnwxhhwhudoohondwukxxuuxwnnwhunguwnngkwuudkwndkuxgoogwokowxxwhuxkukxkuxuonwoxxnongwxnwhuoxnuognokwxunudkhnwgohxgnhkohwkwkkkdgghoudhxgkouwhnnugwdhkwwukdhhwkwddowkdwdwgkguuxduhguhdguwhdkxwokouxdhwdonknxdwhokwhoxdxkhogwwgowhhndkwogunkwoghdwgonnnhwhugnduwugkhkougogxokkgdxdhuguxokdhudhdoggoghgugodxnoknuhggnguxwudugkkwdgukhnunwwnwwwddxgddnougkkxdoowokxghkkxnogxhdkhokdoundoohxhongdguugwnnwddwhngnwgkwhokxnodwgwnkwnkhggnxdxudxgwhdkkdhgkuwnxnkgxwhdddwknkdnnuhoxgnwnuxgdggnwuouhnwdwownddnnuuuwndoxhdgonkhkxwodoghnudnhnodxuhodxkgukohdkxhnxdnuugdnxkuohhohoddowwugugwdwohwnuhxdxunguuhggdxuhdxdhghhhdndkxuoudgkgkgdgkognnouohwwhndhxghnxokkxuxoongwdkxndnownnhdohgdukdhdhdhndnuunhdddhgokkdongkhnwgdgnowuhwuwxunghhuooxxxwudkduouuxxnogguggohguogxkxwonwnknghugnxnwxddowhohhgdduonkkkduuxdhwhnwhnkxhghgukkgukxuunduxukwonhdnnondhgwgghwxxowgdougddxdgwxunhhkuuuooukuguogngkhgdhxknhhnukokkohxhhudkgugxohuhwdwhdkxuxnxgohdnxuuxukxgohkkwkhuwwdxdohdundnonuxgugwgnnnuonkwoxxdnnkhknwhgnuxxuwxuxuhwogdhhwohxuxgnhxuhwnxgnkxwwgkdxxnghwkwnnodwwhkxuxnougnnxnkuxkhkghokddgokgdxooggguudkwunwgnwkhkunghnuunwwkwdghhhogxgdnhhohxgngunxwnowxokoxknoxnknxnukgnwwgxxhhnhokoghhggungngxdgounwgnnxgduhhnugkdwwwhxgunokkdnnhdxngggduuognwhxdnkxgxngwuwhngxudkdoungdhdkxodhnhohxhxdgoxkwdhokwkngkknhwouuhgxxgdohkwnndnxunogxkdxhnouowndkdnhukwhounhnnwoxxgdndknuxkkwwkgoowukokgoddnwwnukhdknwugxngnkhoxxnhouwkwodnooxwuwwwhuuuwxnhduuuwwgudkwnnggkkdhuudonhdggowuxudxgwggdwuwwnwkouwhddnkdxwnnndohkhdwwkogndggkwdgguggodhuduguudwognhhnuhnxuwhhduwoghgnnhdnwggnkxnkhxgwkuknnkgohxwwgdoxhwknnxgokhxdxndogknkngghgkgwnwkuhxndhgxoxhguwdhuwwhnuwgkwdxxhoukknkkdwhdhxxgdxdwnwxwxdkudwhdxxohudunxuhdkhhuuhwkuhduxwxxgxnggnkhkohhhnngohgxowudwuuouwwddduuxxhxhdnoxnkhhkugnowggxnungooohuunknwoxkdwdoxouhunwxudhdugxxhdwuodnuugdkhnounxuxngkkkgkdhnhxxnkouodgnnnnwwkguhunnxdhogognxkkouwwowwdudhnuohhdgunogkddwwkgnonowunwkhddudgugddwgxxdkwwhkugnohgnunddhnnwxnghuuggnwookukwnnnugxhugxxxxnwhowxhguxdnddoukgdxngkhxxxohudkdwkguggnghokdgowuggxxxggugnwngddhnnowddwhdhkgkkuxkhwkdxnuxkkkggghnwwkouxnknndxukuungkkuxgunhkknhkgngknkunooohwhugxgwuunwkoddgwwkohnndhodndxoungkkuknwgwonguudddwgnhoxduwxdgwudhhdnnoxownxdknxkuknguowhuudnguoduodwnowuoogwhhuugkgggnoohxohguonkkkxhxukhkdxhnwdwuwgkodnukwduxnuhxdhuoxxnkkudxkxgwkudgkkhwgxwogknkggwgkxnwnhhdukdowgouwnduuokookhounhxnnhowkngodoggkxgxoguwokdwgkxknkxgxnxwwhdxdonnuxuuxkugwgwxuxondugwhxxxgwkukgnkkdnwhddwoknuxodkhoowdnhunkwouxgnwwwoxwooughgkhuhgdgnkuuwxdkkwkddxwhnkoggwhkhxuxdnghknwodgwoxunndguxnhxwdkkhhwukuhxxghkxnwowhxngdnddohkkkwuowhxhdoxudgohkughuxuhxuundwkkdokgkxgnnwowkukwxxhhoodwoouwwoouxhhoknkdnnnduhuwdwnooxkgowkdhhkonnndokhhduowgxkuxngkgdgkgxgnkhngoxhwxkgdxxokonddhwwxhxxhkngudoxwngwnnggdgkuukhgwkddnkkodduxghkhodoghdgokhkukuwkhnghxowxwhhgoddhhkdkhwwownwhgxngxoowkddnwhuwkduhuhuggwxxgodwohxhuoduohxhkxdkunukonnnokughnnxhnohwkkhouwgxowhwkoghhuowkukkunuhuxddnuohgkuhduxdxwhwhggguhoohonhggoxhwoxkdnnnouwwddxxnwxgwokdhoohgodhxhkdowwhkknhgwxuwuwuukoxdhxxokwdxnknduoxghnkwxoudwwwohkgokxgkdgukwuxxhonxudwwgwdnnxgxknndgnuhwuwwhhuoddhodkowgknkhgnwouugdowhuxxnxxwgwukgwuwgwdnnuodokkhxggnxgkuggodhkudnxougxdnxhdoxuwonxongdhkxggdngdkgkdknuoduhwogohddgownnuwguxkoxwwougwuoxogxgwdkduhnuowuukouogowunkkgddowxnggowowngduwhdxudguooxgdnkohxxhggxxuhwwwwhooguoowxdgnudhonduuwhwwuxgooooxgduxnnowhdkwnnkgnhunnogwnwdwuuokxwhxgdnkugnwnxwgwnooxgxxhddhhoudnnoukdduhokxkghkhwgwgdghdkuggddhndwdooodoguwuhokkwduuwundgunxggxkxxuugowwdwhwdndwwwkodudkdkohkwuwhnkugnkkxuuuxowhhgnnnkuxunknkkgngooxwdkgdxxuwghdukhdwoguudnxukuxxnxdunduxkxwndkgnnxddwgkkogkwkwwkhnownnhouxkogwnxgwguwhwxkugukhkunkoungkhddungdhkowxonhgxukowggkkukwnxghhhwknxxongnxhuuoknuoxgxuxxhhowuddkkxxooknuwxxxowhoddxdhwdkguhndunddwwuwgdnnwguhugkgwggdnkuwhunkwgwkgkwkdgohkuduuwxouggxoxhdgkghxxnhwgnhnodongkxuuhoghwogowwhxougudkhkoghhdonwkhudwhodnxdwonnhnwhhoghdoghxwnknondxxgwknhuxuwonnkdokxxuoddwgggdnwwwouwwndgdwhnonxxowdknxgunxxungdwnknhngwwuokknhgdgnnwouuxkuonwnwduhuuowgnwduhowddggghwodxwdhhuhuunkunxkouwgwowkgnuhoxokwgxhnwoxwxwnwggkgwuuxoogxkdnhwxhxggohonhxhgxhkghgdhgkxoguodxonuoukkguuxngdhxwwnnxkkggxugkhxunowdhgdowxhhngndudxwwuuknoggdounkwwwxnxondhdwdggnuhnnodoonoxxhdnhghhdgghhwoowghxnwuguuhgdodxdxunxwugwkwowxoudkwdwugdnkdghoukuhkhnddokhkggkwonkodknxndhuohkwxkkdunkdhndhhwoggxnuwxdooxdxnudgukxxxuouxxgudngnhwuxuogggwwxxxnuwxgwxhwwxhknuhouunhunonxwxuhngddhdwokhxdwhdgduhhukhhhndwxgwokokoudnonghnuooooxxhnhndwdhkkhxdwdxuonwggdhxhxwhddoddngdnnogdxodnhgwwkoughxowuhnwnohuwxnxhuxgnxngxowxxdhohwxkxkhnhkudndhkohkduohkgnkuoxdoghdnnhhgxhxxwugxuonxowkodxdhdnxhohnhdddknhguoxokhoghnnxknkknxwnxwxhdhnhxxwdhnxgdkwokdnhudogghodnwkxgkwgwnkhxhhxhwwndxkudkonnukggxugunnuhdkhuwddhkhghxukwxxwkokggduxhxgxnwwhgwhwogwonoggdnodnuwkkuhdggnkogwuxknkunknhxhnnkhkhkhkogowunuououhooxddukuxuhuwgudhwxdkwhnuohhgouxuukwowkgoknogwoxhunwhwugxxxgdowggogxggdkxgxnuoonkhonhwhgwxkdxodgwuwdxggwknhngxngwwhnuuouhuhoohdwxggkhukdnkungnuuxugodxkunwhoxngnnndngnxgxxoukdxdxxouwohgnnnuouxdxonnouhdwdkxwkundkdownnoowhuxnwhwooxgduwowxnoghoxgdkdgkduuodxoknwkuohxddgdhuxnnhknwuuuxwuxondgxghuoogoougddwwowugdonkgxnnwnwguxkoxxnhxgwgondudwowdnkxudgohugunogxwwdgdkxxdnuhwxwnddwknugnwghunnkxoggdkwhgwdgdhkdhhxnghkndhxwnkkgogodoxxgkwkxxhokxokxhdohwonxnoghuhukwuxhohnnhhhhokdkndxnkknwdudgxudgggnouwgodunnugdnhknxdxdwowwwxwhokdkddukdwuknngwdnkuhhdgoxnugogogkgnodhwhhkwdhogxonkooodnhxduhhwhwnoxnggdkghkghonhhoxgodxuukhkgnxgxghuohukwdwnhkdnwogukxxgdgkgohkuoughnhuoodgdnnxgwxnwghuwhgnwwohkgogxohuohnxogknkonhgknuwnnnggxogdkwnodgonuoxudnxwdgwnuknugdngdgkungkxxokoxdxwwdxgwdwgudxnndownkhunhkhgkdkuhkwwdkoxgoowkkoodnndonwgxodhoghdnnuouxwuhognnnxghukoxhdgggxghdxhnokkghnxhdhgdoxxxguhhhowknowwhowdnkwwhknouhwdkhohhwnuhwugdhuxokwggdhwuxnwkoowuwhndookhkkkxxogndngkghnkdhwguwwuokgnuwdnduxxxkuxdhkwwowkkxnhududwkdkdonokdxkhkdgukguohohuddgkgxowkuuhhggkddoonxdnkdwwhnkdukgxudwdxughnooddwhgukuhugghndodwuhdnhnuduhonnkoouknkoodnggnwuhxdwuoonnggdudwghnnhnuodnndnwxhgdkohxonnokwkhguduhnnkuuuokgguxwokuhuduuonghwohgokgkhggoxwoxkghkwdwwxhxnkknkndugodwddxdhkdgwhgonxxhwnhogdwudunngnnwddwuwkxgxnoxxnoxodukgdwxokuduoxhwhnowgdhgkunhwknwuoghwnnoxwngkounouhgnuugdgnwodkowkhughdoxwggdwgnxudhonouhwgukhuuuowohwdnooxodwohwgokkwnoodkkhxhddkkggggxghgnxkhxxgoxokohxnunxwowhgondwownondnndghxwuhhgwxkhoouhwhkwkuunhhxdokoogkdxxnundnuohddkgdnwnkohnknkwxoxxghwkdohhnkkowoghwkhxhowkukkdxxdgnwkgddhghuwkdnnkwdkduxknwgwhwggoogwkggoowodoxxghgkhxdnoonkkwoukukuxgxgwdnhhwnohnwwdohkhnwhghwgdnhxknoxddhwohugwuxhxgdkkdxdwwgoxdxuhkuohkuhgokonxkxndogkdgkowghwkogxkoudwdgundxohuxwkngkohuuwgdwwgoxgxxhxwxknoowggguuuxoxuxwoxxwwxnuhuwuhxwxhundwxuwkgogdkgwxugwwwuxkkouhhogghudwnhhxuxdxwgxdddxdoxxhnndxnwgwnwggxwuwhnkddghondxuuhdhnwnknhhdwdkuxkhnkgkunxdokxwxdoxunwouonuogohnxnkdgxnognwukhgowduoonkonoouoghdnkgoukuokkxhxwwggouonwwxwdxdhknxxogkkwhkohhkogkxhxwkhunohwugdnxhnuhhguwdduwddxnnkgwdkgooxdxghnngunnkowhxgwkxugkndxkowdnhukddonongdxokdnkonnnduddndohwodgdkdhwkkunngoggohudwuuwdxgguouokgxdgwuhuxdunxuhohhoghgxkdnhdkxhdnungooxxgkkndokhwohwwkxhuunxhkxongnxunhogguxkughgkuoukgdhhkgddugwduunugwoohwokngxoxgowdkwxnhuoowkugdnuoohwdownnuohodwhuowuhnowoogddkuuwudknouwnwhdwdudwdkodoxgkxonxhnwokoduuxkgoxnwwoouwxwohunnwnknunghdkhookdwdxnuhgxnxxwkghxdgwwhognndkxwwwoxgnuxwnnuuhxoxgxuhodgdgnnkwknokhxohnxougwdgdhkdhkwdxuxokgnnuoudwxhgnndgogxwkwgxwkkdkoxodhwwgkkuodxudxuhguxhxugkhgogdnuxkhhgdhnnxokkdhkdxohkndxnkoxgxgwxogooxhxonkhhnhunnkhnonnwdkgknnhhohwxwdokhowukuudxggunnwkoknookdhuokgkoghnkooxdkkkkowngwkkxdxggnwgxkkhgxhnkwkkdhghukknuwgwwgdhwuoongkuxgwkdgddhxdghxdgnowhhgdhkkwwwdnxhwwguhhwgguxkuknhgxownuwkdwukwkgnwhwnnouunguwhxxgndodoohudkdkwnwdkgdonookogngdxgxxxddoonngwnhuxgwhxxgxgwhdgkdnwuwuxkxogxuhkondxhgnhoxnhowghgokdxnxugkhonownwkgdkuuxdohohuowgnwhokuowouuxxohdwxgukdggduxhkhkkgwdxnougxdxdwnwxnwghwxkxgduwgdhxgndodgnnxkogwnknxhhndkhkhggnogdnwnududkxwghdunwhukhhkwhxnxdxnhnoouwghgukxhhouxnohghdkwkddwkguxhogwnnxukhnxgnggwnhxugkoxdxwooggxwoogugkkkgxowoonodhnhknhxxdwkgkddohoonhkughwuguhwudgukdxhdkxgkwhxokkduwoxwxknhooggkdhkdogxgguhdnwxwgdgdnkhohuukkoxguxuhondxhdndxhwdghoukgwwhkgooduknokkunnokohundduowxukhwnokokkghukgwggwngndwhdwuodgggnnuowkhxxunhgkwwwhhhdukdwodunwxxdwddhdgdowunwhwgxxwhkwdouhngxngoxgoodxkndxhhhnonwnxkhudwdgdhnudwxxukhnddwuunwndhnngghggonnuwnwouhdgkkuohuxgwnkgdwkhndnwdxwgohddoxuuwkokddnnhkwdgkgnxuwdxkuuognxwngoohwkddwwhoonkggokxonhhwxxnhgngodgxxxognkhxwnhnounkuwhukogxukwnkukwdonkxxkdkdnwknghhuokddngddwhhugwukhwhhhhnnduowokkgwokwhxdxowkwonddndhuhduuugxdnxwgwhnwdwoxnnugnokwwwodgudnhunhuwnhoxdwnddhhdohnowdwoudwnnkoowhuxnxudxhkwonhddoknxudwuxdhwdghhxxodwuhonnhnddwukdwhogdgouoxonnxnwnkukookdddkkhohkkddduwguxodgwhugdxhxngndnwnwdxoxhoxwghxhnkgnxhgkkhdgnuwhnooxkwuxdoudwkxxundhgodugxddwgnuuxdxdowkggwkgggdukhhnwddohhwwxuuxguknwkhwnuwdxnwhukgnudhuuudgowduuuhnxdugnhhukkuohnnwwxgohkdgudouxuowgokngnowunxdgkhkdodwkogwudhxwnuwxkugdhkdodkngndoxkndkouodxnxnukuoudokondonnddhgoonwdxxxonkwugkddgoxunowduwnhnudonuhdnnnhgnxowhkgwndxoxgknwnxuonuuhdukgnhhduoowwwdgknhuukxonwuodgkkddwggdnwgghdkdwdkkogdguxgnodouuddxhgduwnogwhxxhkugkhgxknhndhxuugdwgghhxdwonkhwkwungkukkhwkwwgwnkdxdkhnunukunoxguxgxwudodhnoooguhwuduxkoughuhwknxguohhwwhgxdxohoxkuoxwdnundndhwdgdwhkgnkhhddhxnknkduoungguhonuwxgngnhgwddxkkxuwwdkxwogoxdwgonwukkngdhxhukdxndokhokhxuwhdxnhdwxwhxhnhkoxnhogdngnnouoohngoxnkugugwkudxhwxdxkdhowddognunnuodgndwukdhkhkhhgxwuhngdwdoxoknuuuhgghhuunowkkgkodgnhxokogkwowgkxhxgnxuunogkuguonoxkkkdwdohuhnodwdnxhdhndhwndxgxhhukunwkwkddkwnkhnhkookuuhwudhoxxxguxxwkoguwxdgdkxxwhwugguduhuxonoghkkukuuodoxondgwwwndwhkdhnghdwdohgwugonugngxwggkkgoddnkwowxnohduxhknwuohghdgnkggwwknuoghknoxkkwnwwwgdnxukkxouxonkknwkgkuwxduxoonnghgogduhkwnooonnnkhhhonwxdgwuwhggkngkkoguwxowohhwhddwowudkwoodxuwknnhgnnwuoonkkhnkkouuondohwkongudonxhwugohnugdwkkdxuwdgdnkogkhhkhdnkhdoxnkkxxhkwwwuhhknwnuduuhukwwgokxwddwugokdkkgxdhoxukgnuoowdgdoohnugxwwgnoxoukonokgoddudwhdwkuohhgwgxxukkgxoogxhhxwoddkuwgungnhgxghoguxndwgdouhwnghghkoxgnkuoouukxdgxhoxhxwnugogkugonhnxxxduuoxnnkxdokwxnghuwkngnnhhnddoxxudhdggkwgognwwdounggnonkuuwuhowhknknnhkkodhnwnkgudwugugxukogodkokwuwhudgkxxuuoonxuxnkununogggkhokgdxhxoxougnxgwkogkhuxxouxndwhggokuknnxgguwnwguoxknwnoohgnndugdwgxxudduwnndunwdwwxuunxwuohgowhwowngdkugoduhonokghwgduwogndwddwgxngwxnxkxndgwgwunownonhnnwdwhokwxdnhgxggdoodhhkgwwwxnhhwguwwgogndndnhongudduudkxwuxdhogdodwnokukwwohdhdoxhuudwdhxokhgougonoxkdnwnugonouudhduggnkuhdwxwkxuhokkkxdxhnhondkuwxunxdohonuxnxohgunnuoukxunhuwwdxngwuwukkhgokdowuokdxoxdkhxwhknougxdkwouknhdnwuhggkxogxkokokkhdogkkgogxghgggukuxdkxhkohodnnwnkgwdouxdwodkhwwghghdxokgowhhodnwdhuwxudkkuungoggkhwouwdgwuhnhnhnkoohnoxdkukkuwwggxwwonhhknwxdgoxognukxwgxhhownohuhdoxhdnxxukknwhooouxhwwxuuohnndhgxhkxwgnhkuxwhxwohwwxduuhkgohunknnxkwwdogxwnknounkxdgdhgndowoxnukkwxnonnuxngggdnwouokwxwouwouogkugkwggkdhognhhhxoukuhkghhuuugonnxkdhhuunnndkkonhuxwgkkkgwwxuohkwnooouohnddxdwddoknuuuounnkunugkggddkuxngkwwkdnkxwhwxowdnwgwhudhknwxkxuoxouwohuundnnxdkoxondnwhxkuugggoogwndognwnuuwdguwhuxwgndnxxggukghhwodhkxnhdokdguxhxwndowuoxhkdxgdggohdkwwxdnggdxnhwnggwnnuggwdoknggnknwnuokhkkxdooouugnnhwxuxdgxnounkdnkwuxxuwhhnghoxognodxgunxxhgxwoxhhddnwkdgwhnukooggxgougwonxnuuxwggxognduwxwohhwgdhokouodogggdxggwoouonwooddoggkxgudhoxgdouuhgkhxxxhwggkdnkxxddwkkggnodkghnkxdhuhkhnnddnwowwudwkhdohognwddnghuohkgwuwkdkodkgghhgdohgxnduudxdxnxdookxokdkohkukkgowghoknodhodwwkgwgnhndnhgwduoxgnhnohnxhugonuxhwxwxuukgdwkudokxkuknnkguhdxnkwhhuxdudgndxkwhghxhgxwoonnoowouownwgkwgxxgoknduwduwxdwxkuuuhkknuxdnowkunnhogooouddnwxnhhkndhxuhnkdwnnuwndwxnwnddowkdwkonuogkkonunhdnxxhgodowunogogwkxokgkkkxhodnhxohghondgxnkxwxhuwoukhhdodoxxxhwwokhwnxnnnngnognndhxuwhkwnwhnhwwndgnguxgkknkugnwuhhkodkxkdgknhwgunghwuooxowdgouwxuwkdhnhdxgxdghuooxguukwuodkkuugxdhwhhgdduudwooxnhhhuhwohkdkdwgwnhxkwukkwoghkhnoowkxxwunuxgwwduhwdkdgokuoukuuhxouwddunnxhgohoogwkdkudodndkdxhkdowdngwxddduduxwgdgoodnhkgdxdnxngddkhhxnnkhhxdhunnxxdxhndghohnudooknhhokhugwwhudxhkoxnuonoukdkwxonkuuokkxhhgodhhhuododgukwkhounxxxhkuukkkdonxwndhxxwgwddkoudukdkdohxxxononnuohooogxoxhoknkngkkwxuwhhuuxgoouwgdxwwuoudgouukgwnxukknohuxxdgudhxuhkkhhkhhkhddohhonwoxhxgnxodkgnokuhxdndnxwgdxduudhgxkxhnoohkhoxhowukuwxdghxukgxnwdnkognxgnxnoodundhuhokgkugnuxxgdonxdnnkwdxkdunhwhddduoxunoogkdukdgwuohndggwwogoxhndodnoogwxudgkhnuddkkxdnhwgnkdnkxkwnghhguuugughddudkxkuoxkdwuwxkknudkkwukoxkkohoudgggoguxkuxxnhhxgokgwxgwhukgdgkdxookokxggdgdnwdgghxwokwudxkwoondhuxhnxxdnwhwkkxoowodokgkwnnhdgdxouuoondxowxdhwxwwdudkwxuwuuhugdhoxghunuuuxnnxhhkgnknwwonknuunwuowghnndhghgkhuhuwngunxngwnkghnhohowuxhukokxgohhwghohxxnogkuwnkxwknohknxgowkgodgwowuuwknxwhwwhdhowkgkgxondgnxuxgnwoxxxwukkwkndwgodwdoxknuuukugnnngxgwoogxgduxxxgdnkodwngnhguuogwghxkdwkwnxgugunoxhunugdhukowognhkxdwguhwdkxwggkoxkwkogoknukdwknxgkkghhxxgwduxoodhhgxkhgwxkxkxughhgwguugdooxdowoxunwunoxkuxkxooxodxuwkwwuxundukdxwnhdgdhxuwnwwdxwxhudooonukggouggdowkdowxxggxugkooguwxxxndnkdnxuxowhdxkunxuduuowkuuxnxdkguddwoukuwwwonnhxouguddggnhxxgkhudxkxkkwndnndkkxxdwnwdhxunxxonwwnkogxkhognuxkuxwwwooxuukhnoukuwnduoxkukonwdwwddwduxxuhwhwuowkxhwwodwdguoxnguxudnhnknkhwduxkkdoukgwxuknkoggdoowdhuokhuddkxhnkhondodgdxhdnhuxwnkxhkkxhknkuukngkwoxonkxnkgdodgddhkwkkhdwogkdhndhggxhdnnkwkkohhwhknxnnhkukwuhdkduokwkxduugduhkdwhhogdgoddgwkkwxwdhkuonuhxuoxkwuodhoghhgxouwwnhogkdknnkwdhhuhdxognkhhuwxdohxnnkwhwnddgwxknxgwdguuwhwunwgnxxuhdkkwwdkggkxokoxndnxnuuukudohkgnwnwuhdggxkdgkgwhowknwdwonnnxgkoudxkohuwhuhhwgwwkxwdgxdkokoghhgowdkkkkgukggxokknuhwwwwdxkgoxhxhhguodwoknnonkgdwgkuhngogxwokhogwxuhgdugwwuokknuhuhhdggwxghwugxuwnododwgkhxdxgkhxkhdkxxnxnoudwodgokkgunohxogugkdgknwxnxonuwkuxudxukuhkkuddguhnouuonukggdnhxgohkkgdodgdonwonhxdgwoknkuokuhgunxkhukwhwwhoukwxunouuogxnnkunxohngkxdoudkoowuxxhwwudgxkhxxnxhnuhdukngkgndowuuggwuhngdoudwnokuxwxoxxuoggukxukhounwgwhndhnuuuhunuungwwnxxdxxwoxunwogoogwgxudonhxnggknxhuhudwwddwhdownoxuodnxwwonxuwnngwdhnkndudndnkdwwuwhghdoohnngwnwunhxuuwgdohdhdgokxkkghkhoohkxkxogwgwudguuknwunuddwoxddxdgouhunwwgkxxddduukhxxhgkdxdwkhnnoddxdgundhwnuundokwuoxhhwoxkggnoongkwwodwdhxgukxduohngwgnxxxnngudgkwghhkknkndwdddohwkkgkdouxonwhxxdkgkxndhndhnxnooogxuwwndhhguknhogugggoxwonxnkwwwhonwnuunuddxxnhgkxggunodnhwnuuwnwnwxwgdkkuhkuxukkwdxhnhxdxuhhngdndkkndxkdgxhwngnwkhwkoknndhgnhhoggkhxdwhugouwwdhkddkngxkhkhxguwkkggouuwwgukxdknnkugxhdkxwhwoggwudwwxuhgwnkhkdnwnnhxugnxogkwnnuoxdwkwxdwwnodwhguoonnnkgxwgdhwgnxndwouxoodoxhohhkdhouonknhnknggxowhhkknkoukudwwkuownuggwxoxogogxndgodwnwwwgukwwhxuxxnhhnohxnunkwxownxkxxxgwhuungwhhhgxoodkhkwohkwdnxkhduxxggwwuuhkhxuxwhndgonwduxkgnxwgdwuogkkkhwkwnhwukonouoggudnhkhwuugwugkhkuogohgngnhhooxhwwxouugxduwhkoogdwdukoxgonohdoknxxxhgohuuwgndnxxonwxhwnguwndonoxhwohwxdkwdxxxngdgwhhkoxndohwukdnuxhwwxhkungnwnwnohgxxdnduuhhonwhwhxuxowdoddxdkdxoxwkwgkddgwdwhkhkwxgxkoxghkghnwkkdndhowxwoxowukwuxdnnounwngdnhuhdwoxhwnxnoungkgownwuwxkoduddnkddunohghuuxwwoogdnxwkhngkwgdhxnuogkdxhnnxodunxnnkhoohowwukkdxxuonhunhohoguhogdogkhxkgdkkxgokuwduxxwunhxwwdnxdnohhnkoxgohgwhwwxkdhoookgouudkgdukuwgxdnghohwnhdhwwooggdhdhduhnkkhkngghkxogddkoukkxgkxnodwoowngkookdkgokkodxxdkuxxoohxkhnwohuxuugdukdwdxhndwknnoxhduwgxxoxouxwwknnkogodonuughgngxnuxxwkdgdnuwhuonghdgddkugwdggudhgwuwdxdduhookwnxgxkdohkkhwndugndxugukxuhuoghokxxokuduuddghoxnwwuhnxdnhwdnkwohghwgdkkooukhhuhwxxnouxuhudwguunnhdnuooduodkxhddxwdhuoownxnhdnhuddnnwxduwwxkkxkhuungdkudookwnwkxxwunkogwoknnwunkwoxhdkguxughnxuguwughxowudkohduwnuwnodwxhxokwhnxwxwwuohwdhnunngxgkxnhxxwggxwonohkgxkhkonnghugdunxnkudnudxhxgnhuwnhghhxwgukxuxhuxnwgwgoonxhukxnhdhkguduuwkxwhgxnwuwohhdwnknxoxhhnxoooooxnodnwkdhokdgxhgoowwknuxhunduwxugkhxkuhkkhoowunukgownukddnukouudogwhhhkowxwuhhdnxouxkonhdgodgwhnouowxndnhnxxhgwokohoghukwoonwwugnuddxukxuhgxhdhkwwhoowhdokdkkxdkhdguodogdwohgwkkdnhgxddxhdgduuugkhugunhwnndkudnnwukoonddnwxgnwhgkoxdhnhhxgxxonxundhdwnxhhdwonxwhowwnkxoongwngdougugwokggkuhhuukgnkunnkowhkdxhdhkxddxxxwgnwkowuudnuwxxwghogdxwuduxhnokoddunkwuxgnookxoxnkndogkxndukghxhoungoghkxxuhkknooxwkdxwwduuughwohughnhdnnokugnwdnunxwgnddowgnkkdhgnkoxdkhxnhhgxxwggoguhxgohduhdkwkugdgxnghxoxoxkknouwxnowngxhowngnxwxhgxhgkxxghxunnxnxghkkkkwgddohddxkhguwnxxdknkkowuwgokonxohddwgonghwdgwwuxuunoohuuhgnuxunhgouxxxonhdkxxnnododohnxwdhdxwwonkxwogdooguddgwdunxkxxuogwnunnkugouowgwxhgunhhuuhhxguuwguoukxnukuuxxgknhkxodwgggxnkgwnngdwkxogwogdkohdgxuhnnxdnodxxhokoukxgngndwhxxwxhxhgnngnduuhgxdxxugukkgkukdukwdxkgwuwxuwdgduxgxddgunnnhwwkkxxkuwxuuwxnokkhgkukdnoohgwkwukoukwnxkwhkwhdknkknguhhgonwxwkngohgxdhkdukkugdkkuhnwwdkdhuxhwhogxnwhxdnhhokkhhxnkwdwgwhnuhuwgxhukowxdwnnunndnxkgndkunggunggowkuwddkkdxkghdknhoxhdhnnoohdknxonodknoxgnoxxgngdungunhnxnookxuxxdkgwuxdgohdnhgkkguhnxxhoouggongodkkwnnwunukdxnnodgugnwdudukduwuxwhwuohuunxuuunndkwxohknnhhhwhgokwxgodnwwgugddwuuduxookdnuhwxkwnkhuwxdudhwogwgwdhxxdgxdodxkgouwooodxxxnghkwgkxuwooduxwhdudnohokghxokhuggknggxwggwnxohxhwndngokkdgndgnuxghhggondnggnnkwuxdohnnnnwkwknghdgkknggugundgukhwduoughxhduwoxnxukxoknggwwdkngwwnwhdkoukkdoougxxoxgwnnugnuuuwknxxounuhwunnhwgwgknoongngwghxuowgkgnhhgkhkdkukgwguogddnkxxndnkugxgokkuughwhhnohohhhxddkxguwxdnxodgkdghknkhkdxngwooggguowknwooxxkuhkuwxhwhkodngkghunodghkggkdohxgdgnnhhxkxxggnoddnuhuxnwohgudxoknoxowwkuknnxgwoodwwguuukghoogdxhwxhokwogknxongxgwowkxhgwogxnhnkhnxhuxoknodxdoowuhukxwdhuoddgoxkwhxnhoduuxnhgokkdhohnwxowxhkxxxhoxwgkgkgwwdgwxgooknwxgkokudhhngoduhuxnxoxxhngngwowhnhhnduwukuddxgnxkxxndhdkgdukdogknguoduhdgwkkdhkwdoxndownghwhwnxuwnoowhndkddgdwgkxhodnnwungunwohggwkwhggouxghnwdggowhohkxnoxnhokhuhunnkhnwgxwgxggkonhkdwuxxudgdwokxxgddnwodnnnxxohwdwnuwuodnhnudgnoggoxddhhwkonnhxkokhkkodwggxwgonhxgkugkgguxxngkxnwxuhxokgwgxxknhhdgwnngoxwhkdnukwhxounxgdkdkkdgxowkokhohouhkxgdkgohhggoxkwgogdxggowuohnugwhkddhkwxuowhkxkuunukhgwxhughdhdwgwoooxodnhunugndxuoknxgguwokkxxudoggdkogkxhnxkukgwxwnwoxndoxounhxwoukdghwghhuuudokgukukkudnhughdhhunwxdguxwwdxhxnhwwdkxnunouwxoxxuohuodugwuxoghuhwnokgdnwhnhugxkhwkogkhooxxwhuxohhgwghdnunoxxookdogndnondkduuxxxoxuxwddgdgwdududdoxxggughwxogohxnwnwwxhogukhonnkdhnokkkgwnwkwggnhguhhugkhokwwxxdhkuhxoxooghnkxoohuwnxogogxnuhkugwgnugugukoowxddgdkkggkhxdgnwuhgxnhwuuxuukuuogoxxkkknowddhodhhhxnkwhggouugnhwnhxkdnhwnxohwoxggxowuownnngddgduxuwwxgxdoghwxoouguwgudwddwxwwgdodkxxoxhnxhkxnuounudnxxddoudohdudnuxwgwuwxoxddhghwxgxgnwnwkhughkkunuhgnggwkkugddxogdnwhgwkkdugonwhgndnwkwnkggxxnwhughwhgohuwxuhnudhkonooungdwguhghudwwgghodnwwuuouxkhhwngkdgduhhouwdxxwhdnxouxugwwkonxuxxhkguodudowkhdhugnunohkxkdonoxgwkundxuxgkhgkuhgxxxugnkgkwwoxdwhonoxudwnwowdwngdnkonwughkgddhxgxgwkgoxxoohddnhoxxoouduuuhgxoggkduxhhdknhodkkuhunkdxkxnkwwhonknkgogungnhkgogxkoonhgwndxhwgxdnuguduudxnnkgdddghkkndhnwhooooxhxwgnukdnnouhwuogwgkxwnxxwondundwnkhhwxgkhouwghkuuxnnnonnndowwgwghnxoowxgnxwwwudkukhdxgugddoudkuwdduuundddoghouhnuughghngwukwghuwgkdwhudonoxohhndhxhnuxkwugxxwhownugohdkggowuhnghuokggdgudngoxwnkwdwdnhkngxnwknuonddxdxxndhhnnwddxhwohdgodudhunnwugnhgugowxhnnoxwugxnnxwghkggonggxdoodngkkkghnhhnnuukknwnxudguowunuwwuknonnguuongwukgxooghnnuoxgwkouodudxgxhwwhggdgnnduogxxkxdhgwgghuxdkudgndnndgugdhuodxudnonkuhdgghuhxnxhngohkondxkkouxxwdndnogowngknduwkgnduhxhuhwhwuhxgggoxdxooundgguwndgdoknxwxhhxdxxwkkouhgdodunwwwodoxhongugghokgwnhdnhuwhgxxkunhhuuunodnwdhwdwkkonnnhwoodkgukuudwwoknxxgxkkwxwuonnhnuuodgxuunkdwxowdnxnhkouxgguwhonxngdoddunonuunoxwohnukkghnnhwwdxgughkhuhhnhhghnhddogdoguokgxgognwhhwggougwogondhnduxwxxghgkwgkhdohxwxgnkoxggwdhdwddghkwuddxgounngwnkkhkkgggdnhwwkkhdhgdudwknxwuokhkgkkoooudgdnwnxxgngwgdwwhxdxuoogwxwwgkdukhkxdwoxhodxuhkwwxohwxdhhookdogguudoxduhxuwuuhhwgggwkokkndowhndwnkxhudgddkkgouduhxodxgnhgwwkwndwowkookuknowggnnnduhxuoxuuuowohnxdgodgowgnwnkuxuggwhuwdhdoukudnnhgdxgdunuuhwoowkxwgwdxwddnduoxnuwognxowgnouowwuouwwgdkkhgowkhuxwhhodownhghxhnxnwhwdhhkdgnokdkwnhxxxwwxhxhkgggnwwxuwwkuwkhhdoxwdhwkxngguhhkokxnodnxnwhhwuoxkhwoudnnwnndudkwdgnwxgokkwkxkhnwuoudxgwunknhdwkowhoodhkgwuukoundwgxhhnknnnxudwkhwkokwnxowdkngxhkukohhoggwkduuwxddnohuhxodgduxxwgxxuhnnonwgukhggoxwwdkhdnhgkohnhkkonkwnghxwxugdgdhunxoghnduhkokddhxwwhokguwghgukwkunghgggoghdwkwhokkwdokhuwdnxudknwuodnwhuokkdunkwhdoguudxonwxuwdnogxouddnohhhnxhggnhhogndxhdhxnkkognddgwdkhoknngnukuduonwndgoduxgguuoghoknhdkukguoxgoonodhdwxkugungkkuwuhdhddkdgngkuondhunxwhdohwohwogugxkdxhhhuwdgoxkhgdugwdkkduhwuwgwxouknxnodhhwonnowkkguxdgoxoxkwuxgknnooogdkwgkhhkgxhuugxnwuxhwwxouoowgxnowwgouuxkukhndxnoudnukkodgnowxuwnnuwkdndgwouuhgdwoxdxdkoohxungnknwnkxkxgngwwgdodkkuukdkdnwddkkxgwokkwdngunonnuhuhnxwwuodkukdxxhughwghhxhongdghhogdxhknowoudnohkgdgdwxuxkwwhhwwgxxhxndxkdugddonghwwhwhguggooukguxnhwgoxxohxowhwnkhxhkhxnwoonnuhwdhhwhoxnokwxougnkknondndouxdkxngougxghwngwhggxwxugnxxwwhnogkxughxhhuxduxnxhokhwkwokkdwkdkonwkhggxkkddhgdkhhxgxhwwhonnkouwhgnxduxnudgwoknhodhdndhhkuhgnohuxuhgwgxkwdnndhhwkukudonnognhghuhdkxdxgxwdnxudgdkdndggdwnwuondgggwoowxhouuxkxgxwxggwowkgwgnodxodkxwuhgkonoohhwnowgkhgnxdoondgkkduwwuungwgwdkdhnhdxnghooudggunnkdkhdkgonkgdkxkdhwguogwgkwwxxwhuhwgguuwkoonwdxohokxuoxkxkkxukoxuxnhxxkuggndwokukdnhohgohunxnwdxxunhnknxhooohxgkuwxnxogxoohuonhnxkgnwxukhxwwdkwkxxkudhnhhnwhkhonuukwghkhxuoowhndohddowoxdwwhgugnhdnkknhonxowhnngxgdhgouxudhkhnxghoxoggdgudngxkgokukkuunknouohouwhuoogonnxunxkdowhhwwuwwugowudnhokuugkgdndudkkuudnhkkxngnwgdnuxhwooknohnwnhxoxdxokouddgndxddoknnwkdhdowwodwwoxnwnokhhwwdddwhgnxkxgxowkddgkuwhnxkhwxhooonuxgguxwuxdhhgnxuoghugodhxuouoxhhdngdnwooxnwnhogdhdnhdnxxgnkgnuuhnhdnngxdggdnkuuoxwhoggxhhuuggwdgodhngowkxhxdodkxkuhdknwougnnhdgxhokddhnxnxougnkohgguhgxwogudukknwudonnuhhwwwwkkodwwxuukdkuddwkowoongoxnxwxkdwxnghwhugudwwdnxhgdkdxkowkodghgoguuggowwghwhhudndxddoknowoudwnukguxwgknghokonkoxngkgkhggxdkuhwunudugwnkkuhguudgkokguxnwgkdgxdxduuwwdkkgkowonknhkkkdduggodkgognouuodngnogknxxguowhkdodhuhnwwkwhhwxkkuukdookxwokohdoundoxxwxognkgkkxggogkknonhuxwonggnxoxxnwxhdddgdohudnukuxnuxhwdwnwhkouuoxhhhhdxwdduxnxwxxxnwhwnognudxnkkkxxgkgkudxkodxghdnxxdwhkwnnohuuukoxoukuukugwoohkoungdxxgogwwwnxouuowkgwnukduudkhgudxooodhnxhhgwuggkowdukuddnuhkknxxknukdoxuooouhnxondwodnddukgxnodgohdngowddnxkxxxxknhohnwugxkkknoxhuodgnwooxxguduunwkdgoouxhdxxkhxwxkuxhuonkwugxngdwxgnugxoxxokukxwhnhokdunwhwoddhndounudhxowodddngkwunkwkouwukdwgxdwunwdwhwukgokdwkwhxdokukhdnwhnwkknwdohhuokudngnghnwxokdowwukooudohogkdkwxxngnknguoxnxwkgdukouwgdkwowwgxhndwukgkudkhunuoddkunhnuohhkkgdughhkgonhwuhwdhdououdukxoxnxhkxhxdonxxoungkkukwggnuhggdohnknxhukkwuxddhhuwooggduduwgnuwxddgwkknkhoxgonwkgdonnwogduodwwwhkhhwhuwdnkdkdkndnwdwwnhnndgngughudgwxwnxwxuoowkdghguookgghxhhuxxkoxkwwoghgdgxdxnuduhhwnhwwxoxxggoxodxwdhhonwdxunungdgggnuuxudkdguwndowognghgowohkhowngohdwnokxukwxxogxxnoukokxhgxnnhodnggnhgwkwdohduokndwogxxkggxoxdhkogggnxwhhnuhgxhxonnngokgwowkukoonkxkhwhhunxuggghhkokdxwgddkuhohondxdddohddwkwggdwnwuodgnoxdgxkodgnhuxhkhhouhudgwukdongwdoxhxdxxgkkhuukhdokduuguxnukhxkgoxxhhughnuhxugwkxkdhkudxwhngdkkukhhwouggkxwkkngddghkxdkxwuxhkxuunudxxohohxddnnonwkgdgokhxwuwuhnuhuhkuogokdnuduhwnwouxddnnnghwgwuwoxdhnkodkxgkxwuuoukhogouhwdhgoxouhoggwgndxgxxxhdodwxwuuwdguhukundxunwkxwwohuoxhkuwhxhoxodxnhookxwwkoddunndhwdwkudkkohgnngkhnhguwnhwnnnggudxduxnxwhnxxngwxxkgugdkodxdghkwohudnogknuugwdokduouuhkxgxoxgwnnhhxoogwwgxghhunougxogohxonhxgndduxgxkohwhkgddohhohxwdwhghhwxdkwwgkkodhhnhhodxoughkxdgxdkggoukkhdxukxwkokxxuognnduhxdxhoddnhguunhkuhdwxdnwhhuxxhhuognxgwxnogkxodxowooxdkkogknkkukuxgkkwhxnxuogknduhgnohhkgdwgwwuxxuhnhdwhxhnhdxggxwkxodxwhookhnnwnnuxngknxkhgdgokdghuodwoghdnugwdodkkkghgokugokwkdkduwkugwnndhwonnkknuowknkkkuuwukduxgukdgnkgowwdokxxggxugwdoddonxgowukxwhdxokhhngkkuhwwxunhoudddgxugxwngguwddggukuhxdhxknunxhxguxoonguunhxnhwxodxuwnuknokdowxxxhowwxxhuddukwdkhwonoxuxwguxgkhungwxgdduununkgkxgxduooknxohdkukuxuxxukgwwxgnxouoxkgudgwowwwonkxgngoxxgwxnoxdnwonhuwdwxuhxdukkguwwohnudkknnuugdwukoukonnongnhndgxuukkhnwoohoondonxdugxwowgghxhuxkgdxoddgwnuxoknuudhxuwowgdgwdnxnndkhonxdkkkoonggnuxxnkkngdgxgkognxhhokdxdgknkowdnuwwhdkuwkhgnkhonwhdgnxknuhkwnokxwouoxoondkhgwnodkugndkkdundkkoddkhkoxgngddnhxogwxhnwdgnwuxghxgnnuodohgdxwonouhghxdxddhxxungdxxuknnduoouddwkgwkogdwxwwghwowxkkkknxnxkwowdgggxughnnguhhdokxwuxwgnkdkgngghnnudoxukgddgokhonduhukokguguuuwgxxdhkkodxdhnoxhugkxnhuhggxgxgukunuonukxxgwnkwnowdhnnhxhxowdhhdnxwwwhuohgdugonowdhhkgwxuuogwxgwoohkdudwnkwdgknokodxwdngwdghxgkxnxkgwnhxoowxkgdoggoukuddwouhoodnuunwkxwxgnhxhdhkxxdhdgxkndxnxounhnkooogxhndoknnuuukdngdukddwhghkgunxhhxuoxhohohdkwkhokxoggonnonnwxdooxowgkgggxhdodwddguhgwundnodxuudxnnhxkhukownwggnhwoxogxhnuukwxxogwokwwghkxgduwnunkoodkxuohnnxkxuowwwwnokhxhhownuoodnowwdwxxwdgkudnokduuwokgohgngnwxkuhkhxdhoghxkuxgkndxnuuuxdxknghhxdgwwkxnoxgdnogdnkodhnkdnondwxgnodnugxhuhnonxhhoguwkunxgndhnwwhonognuxxwhoonkdgwdxnxknknhdkgdhnkuxhddhdxgduxdhkhwghxhgwgunuwnwkkddxkkggkwunnwdxgxgwxwdgdhoungnhwwgwoonghdughnokwwkdhoxkgungonownuknkdogkokudnkkhuugghhkkuunhgxgwhxugkwxgxwgwxnohodukdunxukugxdnddowdxudxxxgxgddkoxdgkxxuugowggxxdhgnudnkhdwdhonokhkugodokndonwguxxxkhxnnodkkdgxndnnuwwkoudkogkwowhkokghouugdgnwwohowwduukkkwkkdgkngdnkxokgwhuwxhgwgnnwnknhkhoguxohnuunnhuhdxnuddoghwgnkdkdghukhwxkxxuuxkuogddxonkhwokuwdwxhokxwgxhxgwgkuwhxxnnknouoowowdkoghuuuguwdonxnogukuwghhokxwdonxhgunwddnhgwwxxddgwgohwgwxkdwowwdwghkggunuokxgxhwdxudnndndwdggdgohhdhdhwounonokwdwukdkggnuuxggnxhwoxhddxhxhwuwuoghxhxxuuwoxdohdouxhnwudogonwuxkwngdhkwgonwogwnkuxxwkxwuhhuowwukhkkgugugdkkokgduguxndnghnugngdudodwoonwnowugoxhdonnkwhnhwuggooohwhwuohdwnnnuxgnkhwugdkouwngokuhwhwdnuwkgwgxnoxuxgugxwwowooonwkdkdngohkogdxxonndnugxungoukwkkxgknuhhgxogdwhnouxhowwodgduwonndwdnxkodugdhxhddgoxdxduxxhhugnhwugounnwghuooxgkodouonhxhogxxwxkxknxduwkdhwddgkxxnknoxgnhhdkkwxxhhdnoxooghgwnggxuxndwukguhdnwknuknuunnwwkhxduknhwkdduknhouxknxhhwgkxwxuwgwggxkkuuwhhukhdoxwxuwwdngndgunkuoogunwgdowkxokwkodwhndnoudwhnnwhhxdwdnwnugowkhgxwxoouuddnkhdxxonodhowgwgdodguhuuduwggkhnwnnkkgohnddnuddhgxdukkhwwdunxwwngxoddoxnxxwhugnkuhkdwxdononddgndwdxnnuhdogduowgkxdwuhxhuudwgkgukxuhduhndoggowohhnxhhhdgdodookuuduuogddhkhxuhohxkuxddunkdnowouowukknoododhuohxugndwkwnukukndgxxkxxnkhndddkxgddonkddgukxhukuoggkkgdngkkgogdhhokghuxwugwknwdkwdkxwwwkuxhdgwggwnhgoduxxohwxxuwkxowuudwkguwggwoogowxkdhuowgnkukguddxnhxwgnoguohoggddhdgxkodddwhhuuxndghddddookkuxoknknkokxdxdoudwkgnoogxxnwdwuuwxdxodxgxgwokxuuknhngdhuwnuhnnguxhwudxndugkxwuuhxwhnhdokodokdwohhodhhnwkwouhhxokhoxwoddhnhwuugogguddnxhxkwgnkxwxhwdhddugghdgukdgxkgohkkogxhkdhknnkukkkkogndghxokhkuhkokkhwxxwdwdxhwhwwghnhkohndhudongoonuwudknuugxgkxgoxgdoukxgonwgokhdgudxoonwguwhuhokoooduhdhxxxdnkokkunddnkuxoownkhxkkxxgxkoooxukhhnwdwwkwxuhkdxwxkdnwddoxkhdxhhhgxdhugouhogdodhokdhwkoogwhkgnghkdodgknhxxwgdhxgkkonhdwnohnnwnuxhgogkhxkdgngxouxudkkkguuwognnuxowodowxoodownnnwxxuodnhkdgxgowxxxwwkwgnunhhxnwxdxdwwdodogxodxggwgwhxuooknodhghghkxxkgudnhkdnxghkndnuuoodddhgoxuwxhwkwuouoogxxdhwxwnhoggwduwnghghkhkhhuwnokwhkdhhdohhowxogknhddggdugnkxhkkkwnxngkhkuoodookgdohgnxgxounghxgkndudkgdondwndxgudhxdnghxgddggwuhnwdxoddukwdhgokduxxhhgdhghkhouokdkhwhkwnonodouhghhnwgkdwuhuuxwngkkkowdgkdhxdxuknxuundduhxdnokhdxoxgunouxxouudognxwxonuongxdggwgkkuhhwkghuohkdxuhhhdxuhunoowdugohuhnoduxxdhxuowhnhxnduukuongwgoodnwwwgxngkxdxxdgdxkoxkduokdngdnhnnhnxkknxxxxooxuhoddunukohknhngxxdkonokgkhggunnxnxodwhduounndnkokkwwugkoknhuudwnkwghxxoxwxxungouukwdgdhohwngkgdhghkonhhkukkkkuwgdkguddxxuwknhoondnounkkgdoowoguhouokduoxdxkdkdkkxoxkgkgkwxhwhknxdndhhxuxxuhukxxuxxdoougoxwoknguxwnunnkghowoxhhohkwhuhkkdnwnwkddkhgnkowhkdwwugxnghdkhhohknxknuudkdoongunwhunxnwknhoxunkhouwnwowdhxkgoungxnhogdoxounkghougoguuuuxdghukuoowkdkgokxwhouokwhdgunudkwgwdongduhnuokduhwgxogdxhgunohudohhnxouowxhxnnnxnodxdxunnxnguhnohudkwowdwgnhdxonhkkhuwnunxwunxhwxoogxghkdhwdokgwwwxunnghnxndxgxhukuxggdxdhdnxwgxuxdwgghdwkuogognuxhugunhwhkxoxgogdddxownhokwhkokgwgwxxnwohkxokhokhxhkwkwkxdgdhnnhgokoxonnkowukxhkwgnkgxukxwwxouxxwhhgnwgugwghggonohndxhgnwduonhwhokkxxuuhhgoxhgnxodughknddwwhunoouowwoxdnukxgkunnuhdhkuwgwownokdokogxuhkohxdwkgoxkdndkxdhkoduwkggnowkuoxxhuxonnwdnxddxguwhohdowohuhgwgohhndxoknxxwwxhxgdohxuddkkwouuwhxxdhxoohonxduguwgoouhogwguwdwonhkkohgddhgwunhnxxuxhhhxduhohnwohhwdwuxwxkghkwgoodxxuhngwdguhghxwnwgdugkwxhdohdnuxdhuwunkodggxdgkxngkwhgonxwkuhhkokuohowxdonhungggnohudoxwhoohhxkgxkokgwngxwxdwwudddnxnkuonggouhdguxgwodgghngdoogwkhwgndwxkoduxuknunxgwkhkkgdkgogohnndudguxgdddkggwnonnokdkuxhhngdwnudxhdowwodghkdwghxduhndgxhoodkhwukhowdwhhoonxnwxkwgxuwgndoxhwxgnoogxounokhwdxwhkwkkuohhwoxkguxgkokdghxdhwuwonwxondogkxuwhxnwognnkknwwwkuogwkwkwxwwhdkdnkkwuxgwxdwhwuuxkhouxhgxxdwkxgxhhgxhdxwuwndwhdkddddwkouhnwugwwghdnkddoudohghhnhduohkhhwowdudkxwuknxxgwnkdkgnhdddhkonkkugnnhxguoouhungkggudonnongdgwwdxnxdkudoggkxxuoxhgggkuwokodxhnhdknduxhxduhhonxgxhnhhkgxgdnoouguhwkxwxoxugwnwxguxxdhuwwnnndknunxhkdoghhkxugkdwooxnhgkuodggkxngwoxgnuokwuwhndohnxhhnddwwnuwxhkdkkhxduungxowuuwwkdhxgudhxogkkkuguwnngunnuwwxnuwwwxuhkgokuwxogwouxkogkuuggwdnoxgxonwnxwhnogdwuxnonkodhohhhhwndnkxnkogwongdxwnukgokkwdkunoxxnowgxknooounuogooogdunonxhkxknxookoowkhuddddkgwndkunugkxoondxwnuhkunkhwknhxnhhgugxxhouwdwdwkhdgoxwnxkduokhnugxodowdgwkgxdnugdguhwnwwudkhownnnwndguxkdghunknhdunnokodkkgwunkwdnohdddugndnwhxwkdguonguwwgnnnunkdugdwgdodhooxhnuwhgonhdukwhhugkudddgxuonxoxunknduwkudnhnkughnkhgoxukkuhxnokggdkokwhgwkkukghgxhgouxgdwgnkwhgxnkkonduukngkdwdxkwxukdxgngngugxkounddwgnukxgownnxgkhnghddgoxgnhhnxuxokukkdnknunwkwkodnghhokhxgkwhkxoxgxuwxohoxnouhhgdxwuwgownxhgoougnhdhkhggdxkxgndwnhnugxnkudgonnxwwogdhwkxdgoonowgxkdxognxxdhkhdgxgugounnduhugkdhuhxwkdgohhndhonnhunuokogonounxnxuoxkunwxnkdhughkoxoghxhddhkoxdhwhkxkkxxgwdnxnudwwukxonhuhwunnugghwkgnugnodkgwoodnhwudwhxxhohdxwwwohwgghgxhoxdxkdughkwhnxkuwhuohkwwwknnxuggxoouxwnuoudxknxndnunnwnuhhgghhungknwxhdkugguxoxgowgukxnxdnnndxgookdxguhguhogwuoknukondhkwwkhwkowkoddoogxgkuddnkxkgwxgxhkgggnnndxnohxuhwogohdgkhkndkohgguwnkogxggkwkndnhdwgdnhxduhdwwnnwddowgnonuuwkkunuhddwwxuwoxxohgndnhdxdxnhnghodowddowhkxwwguxdwwugouohhwnnxwxxhgunkkkuduoxuxndgnduwogoowxhkwohxghwdgkwguonhhhnnwkhwunduxxongxwxuuuwuuhnwoddodwgxgxhwxdouoxxkwnkhgukwoxoduxhukkuhxwgdxxukwxnkhuxdwgowdndnhkoghgoxxnknwkggggwunkhodguwkxxxuhxgggnukokuggwxhgdwwguhdnwddxkkuhoggdnxkhxkhognnxkkgdkuhwhohoouxwodnudunnoxodhgxkduudgxhoggkuhxwguudnnuwudhhoxkkonnwgwunogdokodhoguonnkunoxhwghwhohhgukukkgxdduxwdkukdwdodgggodwgodhkxkgkwdwggooowdudwuxxouuhodkggkwxoododhwodhgkukhdhgkgdxxnnkxhdooxgnngouwogxgwkudhgnoxdgwnonudnnndnnkwgogdxnuwwhwhghgonnnkkukhwhkwggnhwkhwxhgggdoowkhwhwxhxdxnudgdhgxkuuuxhdhxhwowughhhgnnhkxkkxoxkwgnhhunnwkkgdgonkwhghgdhuxnxgxxnkxhukkdognkguxhwoggoknugnwhuwkgxxhhonugwowdduxudddduowgnwhggdgnwxoudoxxdkuxkkgxwwuugoduuwdhdggghdxduugwokudgnggwggwkhughhgodowddwohowukxunohhxnooownkowhhkduoxoxwgoxhudukunxoknuwggxxxgdhukdnkkgdohugdnowhogkknoxgdgkhkduxhghnogwxkdwdhdgwhhhhwkuhxunxkkownxuooxggxohuughggnnwudoxdhxuoxgwnguunuwukdhounokoghhwuogohwgdnxdohuogkwhknnouuxxuodxgnwukdkdhouwwwnnowoguuxgngnxhoxhhoxdugoonwnddkwkxnuhkxxuuwhwddowungxnhuxwugwdwkkwhddxgwgnhxodgxogxkgxuonugwdukduuwwnokgonghnknhkxgdhuuhkhgnuodgoxxdxwndxunogwgkondkwukuwxwguoouwdgxkdwxonnoukuhuwnxkuwguhdxuxhuhoohgndndxukognxnxxodnnxxuwxxuggwxknwdnnukkhngkowdddnwhwukkuxwwxnuxhoonnudwhoonwxhwukhdgkhuwgwkudnouxnoghwhhhnhukwghxxoxhhugonhhdgggkhuxwxgxdkkuxkwxohxuuoxknkkxwkgnkggdkkonkohkwoowoonhnouhgughugnwgxnuonohhxngwkhdxgwkonowgunuhwxxounxxkguuhwoxgdxxkxghuuowkkguxkuwowuogkxuonnowxkdhuxukkwdhhwohdnkunkkggxodkgdwgoowdgnodwddxkooddodowxokuknwhkxkxkuuonxkkxoknhwnghonhxugunnuohhkuogddwxgwnnnhuokhgnxxxouwxhknwugwuhggndnwnhnxodokkoxhwhknwgunxgkwkhggxddngwdkhkgokxhwgxdohxdxoonhkwdxhkwohknondgnnwknonkuxnxghxkkuxdxkonhxxohgwnkhgowouxokhwwuxoxuowkguuuhuxnhkghohxungwguhkwwgwxknuggkhgwxukkudokohkhghnugokwowngkgguhonxnwoxokwdouokunouwgwhokhuwudknkkxnwxnkgnnhuwdhwhnnxhxxgowxgggkgdwodkudgwxkokdhkukdkxwnwkggnhxkukxudxgwkhhknnwooxwohndonuuxnnkxgkdkowohkkhnguuwdowkgdhuokoudkkhgxhghghhxhxhwdhuhndwhuxhgdhngwnxdxnxkdoduwuwnxdwxuhwxwxgxoowognkuwdwkkxkxhkkuxgkhhdgduhndgowouhgggkgodnownuhxoxowuhdhuwdwouxndkkwxnuxnxhggdxwuhhugngowxnnxwxnxwnnwunnggdwohnnxwhunwonxxdxowoxdxknhgwogxwxoknduhwxhokowhkudwkxghduxndguhkuwxdhwdgkgnwnnuhonhkohnuwokgxxhxxxnhodhugxuwduuxnkuxwduougnhwdkwuhddokuwdhogowngknoondxgkhnnowongwdnunxgnghgxhondxoxghnhuokgxouxxwhngwokougwuwxhkhwowgnooxkgwdowxhgdnuxdxgwwxuuouhxgnkouwgngukkonodhookknxkkuooouhkdkkognxuxkdkhnogkhnogukkxxunuxukhougnuxxuhnugxonowuugwddwgxoowonowwnnouohokgwkgguwoonwowhodxkdwnuuwknkkokkgkkwookgnhxhkhnkuxhkdokduxunhgguxunnggnnxouowundggnhhunhkdwnohnnwonduxhndnkdookgukgkokgnxknoxugdhwxuhhwxgdxoxooggkghukgowxoxxohhdnwxhdhnwohokouwgkxoghxnnohnwgwxognwggwwxdxgdgnguwxnxwngxhgohgxudkwgwonwuohnhwwohuwwnuunwoonhuwhkoxgkudkgkhoudndodhdkwgunogggoxxnughdnkwduhwohggkkodnwgnuwoxxuwuodwogdhhohgonkoughnxouwonuuxxukuwogwnoxgxgghndgxkdwhknwnkxnnkoxhwnohonkxdkhxnkunhuuxuwhunkhwhwgwhdkuguhnwohxkdwgnhnnukkhghkkhxkxudxhwhkkgxngohnwgknwxudokokxnouuwwdxnkuwddxwxukwwuhxxnkoghwnkkohwuwkdhwuwnxowkxhuuxkkknkwokwnuowwhkxokowugwnxkgwdgdnxdxnkuwuunxokuugdgnodgkgxgdunudxudxdunwxunoknuoxoggkuxuxwouddwknndhnwwuwxowkxduuhwuwxhdodwokwowgokngxwnwxwwuoogudxdnwhxknukwkxukuuhxkkdhougonwukkdnunuwdnkgxgnhxndknkdhookwkdugukunkkodxgoodggwuoduddkwwdongndndnkdgxxnnogkkuugwhnggudgkonxunxwnnoxkgddguonxdongkkkghhgwuguhhgnukgohukgunwdghkhdukngdkowhhgxkdgungkddwwndxdkgxdwuxuggddgdwuudgoonokhxxkgxnwgkkknwxhhudxhhxuudoduhhnxwhonwnwgdnwhgdowwounhnduxwugwondunggxoowgdhwonnwwnggguuunwxnwghnhhdwouxdgunnkugxxdohhhwhwkoxohwonhuoxkuhuggonxkhwouhdwnkogggdwxxkdkhhuddohddkwgukhnoxgowxxggkuwkoxgohkkkwuhxkhgunxkokoodoghgnkdwnnwunwdhgokdnhwwgxhxhuoudwgwwngkwhduoonhxgxdwxwoxwkxnguxwodkwuokxuhhdwogxuxwwohhxonwguwdngwgukhnkwgghhxuduukkdnhwouwkkknhhxkuduhuhooukkunwugxxhhdoxnhouguknhxuwooddgwhdwgdxgknukohnxnoxuogdndwogxwgwxknuhkgxngkggwxudhugnuggkkhuonoouwhkhghhghkkuknkkxxxxxdwdhngnxwhxnodunwgdhhdwwxdhuooodhgkdgddxgonngxkndwkwdkdwughgwonkowgugxdhuhghdkwwxkghdngwuuogwoohdodxndgunhonhunguwokokwudkukgnoddnhgndgnxdkhwohowguxxhnkkddhxwoudohwknuoxogohwkndgoonuxhggnkgkxwwdxowohhhxhkuokdnuwhddowugoowowokxokxwkknoohowxugnunuwhdonhhuuguxnhguwkgodwnnxddhunghwdwwunkhnnunkgkuuuokoukwxdgnhhgunhohhgkwdwgndknkkonxokwuhhxgxonwkkggdhunggxoohukgdkukgghnwnxugghonhuxngxhxdhnudghnnnkonoogowoowwhwwdwududhddnhnhkudownhkohgknhwhgugnkugwhkdkononkoxnuhwdguudxuxhwxwkodkxuwwouwgnkuhxkukgnxudkxkgownhwwkxgunnuownxoxgngkdugwwwhdwwuwndonuhdguwwhodgnxkwndkwwnxkooxnonowownhnkngouokuoukwkogghokoxhwdnwhkkxnngwkgwwwxgdhxgwnokuhnxudhduhduxwwoddhxgxodxngnogwkxxgnxoxxownghwdgdhdwokguhwwnxkxkukdnoodwdgwxwudoounugkdwkxknkxudwkkoxwuxuuokhwhkuhkgdwwohnduwndddwgxxkgnkdwnnhwdohxgxhxugduonhkunkokxhxdnxkdoooxwwgudxgxknuudxhhnxunxxxxknxokodhwhdhkgudukudngxddwownuhdgwdxdkgxgxwgodhonnkokxhwhhkhxoggxguxnnwwdxoonkuhngodnwdhngoukunxknhnhnggnnukhgouxnngdhngkoduoukonkhhddnwdkouougowudguxukkuhkdghkodwoxwkxduhkxokonnkgokwnwugdogwdonuxkdkgkwhgowxughggoxxkhokugwwogkunhxuwdwxxxwdxkgwgouxgkkgwuukknddgknnwowghgnkdgxkxuxhundukhgdkkwoouuonkxkhunxxwhoxhxwowhhhxwhgudngowhnwwgukkgkguhnndhgnhguxgxhwnwgoxggwnknogkgohwgnodgdwoogxnwuokookggdwkgduxudhddngnhdhhhdwwowwkhxdgdkkukouunhkhknndouhkkdodhhwxxhkkwxnoxxgxxkuxhgkxxkuhnndghggxkhkhnhdhnokuhkhudwhdunuxgukgdogduoxwghwgdwuxkxkkukgwkohduwkwwooodugwxhdxkhkoxddonnngnkwwghdgddkdohgxoxhhuhngughxownonghdgkuuhxhhdwnxkgghnxhdowdhdwxdoxunuhxuwuwdxnuohnhkhhdongkwondkonodnonhodgukdxdxnxghkoouhxgogkxduddnnookwkogkgnwnxoxdxukdnukxukohhdghoonnwkxodhghgwnkdnxdooggkoonwkgudgnoohgxwhkudhhdgxuwkhdwngkkwxnnuwkuhwukkknxunwdduxgowxhxhnnwxukgxhwwdddghnduwunwwxwkgxnowndgnngkuwongukhoxuxhggnxxhhxwkkunxxgkuddwuggnwhgdwgxxgoxndwwgohkuwkxngonughhwxgnkkundodduuguuxggknguuouguwggdxkxxxohnogxondkggodnudwwoknouuuxhnnkkuowugwndkdgnnhogwwxodowhwunxxxkkxkxwkxxuxwxwknuxuxgxnohnkodndngdggukghggwkddnwghwxouughhwokwwokkwxkguoxdgxnwdkodkgdndwkkgdoduxgwwxdnxudukwnxngduwgkxxwxnhgxokuhgundwdgugkuxgnhuohukwnxgxhkxuuxkhkgnowwoudkxnhuhkuuwdguuknunnhgouhknooknogkukhgunkounonghwnxoxonkkuokwnhwwhxknnggxxwdhuggnwgdwwdwxdhghduxuookwowkddxxxknxhoknhououkhhgkwhoogwdhnkouonodoxoundwddxhuhhonhkngduhggwgwxhwwxooowxuuhhkhxhndxxdoxgdgohwwxodkkhkoowdxdxodndkgukkuwwnndxkngxnknxhddokooooggwwuxgdhduwokwghgoxhuuhognghknhkwuunnnoxkwnduwnkoudnwwnwxhwnnuuonwuhuoowohuukunxondgwwkghduxgudwkouuuughgwxdhhougunhundnkugwndggkuxkwhodwkugonnwuhkuxuogoknnkkkkuxhhkxnnwdxduhddkkuonxugwxwnnnhkuxwgnddodgkghwhouhdohnhnughxnxkkkdunkuognnwkwxxkwunwwduwwwuuknnwngxxnuguwodnwxkugwuwxknxoggdxohkohhgukwxkuxodxwgwnwwngkdwhnggughuxknodhuxwkwgouwwunookgwhkohuwkogduunkohguuhokkngknhkkddhhnxgdhwdhnnwgwuukdwxokuukdkuhnkkkuwnddxxwdwxodnwohgxhogwnwwduuxgnkggowuowdwnwndggxwouxguowdkwhouhhouugkdunnkggxhgwoughggxndhnnuwnkxdkddkundkunugdhugdnuudgxkknxxoknxdxuukduwhowoowdnuognwkookdohogkxxhdondwkkuxownngoghukndgkgunwxnxxnghnwuxuwukhwkwgwxgwgkdgxxuwnxkudxwgkndnnowgodxnxhwhugdguhkukunxdwgwnnodwuxwgowhunnwuoggogwodndkndgdokxwxguhhxhouukwuxwhohohkwgodnhgohgonhhkuodkxgxxhhghnhhwwxodohuwxungokknhkgnwkxnkndougunwkghonnudwgguogkwwuhuhwungdggudwngudohdwkwuxnxugkghwgnuwnnkwdoknnhxdoowwhdduuuxhxxoonnuhnhdowhkxghugwohouwuwggudwwwouhkuondhuxohkugnxdkkwgxuduuouxuwndkddoowxkgudhukdxudnknxkkxowkxxoknnnhddohdxwwdhdkokxudnhgwodnuwkkgkudowouwwxuxghknxuukdhuhnogdnukunxxgkndkudxghwwkdwwhxhukxkuokoxxgngndkgnuxkkknudkukgwgnxdkudwnuxkwuwnguowkghwguxgxonxhonwdgnwhxonnkkggokuknnohgguwkhnxkhknxkuhkgoduwwogggwxukxoouknwkukkwduonkgnuhuwwukwkndnukongouuhwwhhwdgghxukogxgxuodgodkxgunudnnuokxwgowkouxkokwwxxoxwghwhkwowgokkgkdhdwowkwouhnoowkxgdhxnwuxwgxdunuxnwxdhngouhwwduknuwuuwxkoxdxwnogdnhnwxxdkudodogouxkdwhnkgduuxwunhkwxodxndudndkwuhxkwwkkuwwgonkoudwukgoxwgwhuxgnwuxdxhghxhhdhgkgogdwwdxudknhdwndwxgkdkgxdngundnongdggddhxwhuxkwhnonknnuxguhngonudonduwhwkodxkdhdxkkkkgoukdhxhgnugnokxonoognuhkhwxkoxonhwowgnoxghwuxgogxohkddukwuuddhuwgkgxooxxhdgdxhwgdnnhnkwxgnkwkuwnodowguhwkoxxohnnkxoghdkxwxhknhhnwwokdhxxohhuuuuxdxwdudowkodunnkxknhunkwuwgugowwouhodooxnggouuoxxnxknnxxhouuonwhwxknduodnkgnnxduhdouwnguwwxgggghgxodwhgoddodndwwhhwdgxxxdgggkxkhxkwunddhwxxgdhwkdgxhogkkuonwwxkhwwwgkgxuougdhwwooukgdogdkxwkgdudoowdnohngkonxxgugxongohonhwuxdohdokgdhwokwkhduxwndhwnwdngghodkdnnokkwwhdhknoouhnhouwwouxouxknkxowowwhkhuogdgkgowwkuhwhwxwokungwdkouxwuognkwggonndogxkwoughwuohhgokdnkhxxugghoknwhdodogdkxwnwowdohhuggowkwxuugkkgudnnxgknowokxwouxgkhhgnkkhuxdgwxnwokxwxokwkoodgnwwuoxghodhxxxwugghnggwodkddhoxkuukwxoxnxwnnkhdogxxxdghkhgwxdxwkwdgoguxwwnnkgdowndkgokxhdkonwdhouugoudhkkwnhgwdggwuhkuwhxkhnxxoxnwwknkunogodwdwhkhouxnuwunhkdkkwkhkkhgnhugudxkwhgkwnhukungnwddghdhdxhwnuwkngnuxohnhxdhhoxnwwwndnhhowuwdgdxhohhduhwxogxugwwwuxxnkdnhddwwwxhoxnuugxgxwdwhguhxwkdgkdgwhwgwnognuogwkkhguogwnugukgdngwudnoddhohhknhdwugudxdnwuhnxnhxugkouxggghkghxkkgwddgudwkoohnkhwwgdwwwgoxdxhddodkwhxowngnuuhgukkghnnxkxdohxnhxxxuuguwxggoukxnhnkwukuhkxoouwkxuxkkwwkokhwuddkowwwxowkodknwuhwndunkwwkkgkkdokghgxnhdowuhhhuggwhggxhgkkxdkdxoonuxnondkdonddounkgdghodxhukxkkdwxgnxhodkkxuhgouuxgwdgohnuhuugwwnkhwkuxwwwxdgudgddkuwnxgnowdkuduhhwwgwgwwuwxhnhuokxhhwwhououwxhkwwkdngguxoohkwnwudwngnowxhkxoxuukgoxkoxwnxwnowugxwuguuxoknwhgwngnugnwhwokodxwhgxkohnwxgugoghhkuwkdxwkdddgguuoggdkuhudkgoogwdwwxhwgnuhxxxdudxhgnhhkuugnkdnhxdhxgoonxhoxxhxokwwugonuungoudnwngkhxhunkhnnnxggugowwdwkdnuuwxkgwnxknoxddkkohnxhdwxhondwgdwxkwgxdxghxwkwxxnguhnggwwdowhnxhnugoxxdoxxoxgnuhgwwkhggukdohhwwwuwgwxwhuhxogwgdxwdxkhnxnhgkudwhxhwxnkwokwwudugwwghdouxduxuooxgunoogwndhwuxhokxknokdwohuxnoxgkwnwhdndgxodggokkddggnxhodnxhkhxokhhnhknxxukxouonhkunhkhuxnogouwddguwwndwgdohkngdhwkwowxwnnhhggghougxxoohkxdwkhwdkhxohoxgdnxudxxohxukgdghxdokhoghdoondwhhddnookkddwdhwgxdhgnookxnwkxugxowgwgwnhohuongokhdnknonwoxxgggnukuuunokkknhhghuhhuxnnhhxkwxwkknwhkukoxxhwowowndkhwdhxkunkhhukghwukxhwhhndouxxukngxdhuddhouknddnunononnohxugoouxdghnuoxxknudugxoxxokwddwugoxkduhkdgxwnuggghohhuwugudodkgwdggkkwdhuowgxgduhwdgxdnxwdxohnuhhhdwuddhhdhugkongnkoghknukounhduouddknowdonhnkxdxwoduowxduwxwwnuwdxxhgkwhddxxoxwwowdnduoooduuxwhgownwguhwunkdnwkownuhonnuwxkhnndkgduxndduhxuohouuwokudokhoxwhokougknuxxgdhnghwnknhdnkuodoknxnooukdhwgwdhwdnhhdukxxxougoodgdgghxdkouuwgxxwxgnxohgwdwoughgudnnhdduguhdogwxhnndxhguhkkwxngohggkwxwuuxgwghhgkxxngdukgkxhnkuxdhxwxooknwwwdunoxxwhhwohxwxuwdkkkhouhwxguxgdxwougdknhhhuxnwowduoxwhnkwdukhndokgonxwuudnkodgnnhokongnhdnuuudwwuougwwdnxdgunokkgwooxnndxduggkgnwnkxddxkuugxxunhdohowgohhohkodwondnhhodugkgnkunoggogddugwuxugohgukxkggwnxxhoogdgxhghughkhxkxugkdnwuwxxduhondghgoohxhwxuokuouuuownwunnongokkwwhxwnnkhxokhohdhnxhwhxkuwhnxuhnnunoggxguoxhkdondxnxhndhhdgonxkkdhugundwndgkggdnuddunwuuhonhwxuwuhuugwhnhhhkhooddogwgugnwkggwhgnnhouhghxoodokgwddukkdxnghxhnuwuouxxdowwkkknhoxkudhxxxonduxxxonnuwknxxgudowokngudnhkkhggokndxukdhxoohuuxnddhhdwwhnnxdngduhhhowuxdodxoggokxhoxghdkxohgghnowkhhxnudxdhhduduuhdunghggowgduhuohwukndhuodonuokhkdgogoogukxuxxxuuwwgonhnddwowouogndokhdunhouhdgkouwhnhduwggnooxowdnkodukdgkhuugkdnkxwuxxxdduxddxguxnndnnhwwduodwodgwuhkwohoonohggdouxhhhnuuhxkuwkkxghnokwnnhgdkowuddxnoxogkudwhhhhounuokgxdowdkdwdooxhungdxdhwhowknngoouxuxogouwkgxhnunghxhnkgxokgohduxhuouxxwxokokodwxkwhuuuxkuddnhnkgkdowkwkougowhoogounwdhggxdgnkugwkkkgkduouwohkknokhkxdungxxhxggoonuwhgwwdunxgnhukkxdnhoxddwkwnkwwgkgoghwhddhknoodkxxxgxnddduwxhogwnghdgnxkwwgxhxhugwxoxgduuwkuonhgdkwkwukwdgwkhugonggkwooowxknxwdukndonokdnxhknonunudxnkkkhdgkuxudxouogwwndkuxhkghxwknhoogwkokkhnnxhxwuhuxggwoohudnkggowwohgdkhhuxuwouwxudwwoxngundnhuwdkdnxoxndgookuohonhxoghxxxdhxohoggdkggogoxoxonnguwdwnkuohnkxknnhhdouonooughnxownhnkhghgghohhkgwudhwwhonxukuoknodhwkhhwudwohxuudhxdoxkohkhuuduwnxhguhdggndokdwokuuhxwkgdghxhnnkoxnxwhudooxwokgdddwgkookwdogwgokddwghhuhudhhxnnhkghgdudhowxxkhkxooohooknkkhwxwdoxugdkhgwwnknxgdoknuwdxowdhkxgkhukuuhwngnwoxhuhdhkghhoxkkdnuhkoxuoddnngnnguoxdhxoodkongoxdxkhwgoxonwkdudwkwhwwogkughxddknkhkdhnwkkwoouodkdhwnxuondxwhggkooxouwxwdxhodwgunxxxkwgugnwgkugkudxkunxdkndkuxdkuggdhuwxuoxkxkudxndhuxdxxxwwxdnhhxgxxowkhhwxodxhooukkxhdoonxdkddhkuxonhkoggghwdhxnkxgwhwnkohnuuwgwwgxxhxunwnduduowxnuuwndwhwokudnwnwwxgxuguoxxnnoohxkxdxxkndkgdxukdxuhxwxxwknkxwuxwdhhowgooungxognwnuxdwhwhnddhxwkwukhounughuhonnnuodnhhkwwdunudoxngkddukgkhndkxghnngghhdkkggdwdgxodhgguwhodhdhxodwonhgugxounogkkhhwoguowkukxnunnwhxggukdunkdxxhdhgdhkugnkwdwowgugwoxdxukokwwxknghkxwdnxxndddgknxuundguhuxoowkgxhnkoduwkudwoduggdowxgdxoxgdooownuuwookhwuwwonkonkgdddngnxhoghgnwgkogdduhouonwohnxgwgkggdukdonoodkwnxdoxkndooohhxohkwxgndoxkodhudhuuokukhwwxwxuodxdghxdxwhkknxwoggngxhkhududdudhkkdkuhukukdxdwxkgxduxwggkognkwxhhogddgwxknxknukwuwwwoxukhxwkuwkhxuwwkhnnwnwwggxduwwngxohgoxddgdudxougngdnwndnhwnkhwnokdwgowhudwuhogwuowkowkokudhuogodkdkxuwndoowgkgkoogxdhngwnudndwgnhhnwooghdhkwddxudhxkxkhuoxgwnuxnwxnwhxnghhxgkuhgxowgkodxdxddwhxwkgnuhnouhhwggkhkxhxdhxgxkxnhkdxgkwxuxxowdwwunuxdgwdxguunogkgwdddowhwdwhxdhkdnwwooohxunnognnxwwgndkdhduwkddgdxnxwnuhxkgxukwdougouuudwunhkhunokwkhghnkgxxunuuwhwohohhuohkkogohwhunhugkdgkwuonxxwoxudooduxgouowoognxxouwgkkkuhwnhnkxooxughhxhuxdhxooxwokkxxkkuwhgdwwxghxowxnxkdwoduuuwnwxhokdnwdnxokdodukxxdnknxgxoxxuwoxdguohkdooowkwkuuxdhnwgwkohxooxdhkoddoghuounwkuwwxnhdgnguwddhwndxuguxkkdoxkdwoukuuddxuxnwxhhoonwdhghnxxnduxwgxwkwduxdxkwookuxggogwdwhgxxogxgwnughkhugggxwouwnnuonhwgnxwdonhkhkndunggghungxngkxguoxxwhkhhkxkwgnkhwdgdxwkdhnunghonnodkgdxwgguxnwkdhngxohkohowoxgnohwgkdgdokwgnkxuunhgkwoxnhxkdkwnguoxnduownwuudduhuuddxwhwhkxkgwnnowuwouwoogxwwuwgdhouxugkuonxuuonddhkgwduxhuunwxwokhkhonxxdknkdddxxwgkkggngwkghxuhgxhddxkgxggnhnoxkxkwdugxkodkonwkwnxkkxoddxgkwgdxxwknhdwwgddooddhhogdgdxgguduukxggxngoodgwkuuwgkuouxokkgxdkhxuxongohukxkgxwouwggodghxgwdkdgkwxhkkkhgwuwnkkhwwkhgngodkhxhwkdonduuhghnhxoogowxgdxudxgdkuxnwkhnhwwhokdnnnwohdonkuudxokdodnoxhnkhododdxhuhuwdogdxuowkkonhxnoodxwkuhnxknwwdgdxgxowghkxwnughnukowxkghngugoxkwudhxwgdwxudwdhuknhdnohnudkxowuowgwwkuuwknkxoduhkngxdwuohwwdkxxowdgokoxdhwxgudononndugghuuwnkougddhguoknxkunnkhdhxdwhdkdkdkdnhhugwdhhgdunwdhuoxgkdgghduhhgugkgguggounkngwxoxxnxoondgoguhdokouougnxxnhokgdkhogdnodwngkownodogxowhwowkngogxkuwgoxnowkuwhudowkgkddkkgnxoxodungxxooowkwghknohhwhkuuxudnnnhhnxokdwowhknooogxowugnhgogddnkhxddoudkoxhxgdhhgkokodoudwnxghxoduwwwwgguwokwunuonhhookdoknhhhkxdhkuwuxuuhdukdxwwoddxxhuwnkgnowkkhkhdugnwhduuduhhwhooodhhxnxkwggdhdhnnnoonkwndhkddkukudxkuwnhwognudkndxxgunwnuwwwoxukokhduoggdknhkwknuxnoognduwkuhwuodhwxdhguooghngngwdgnkohwwgdkgwghonongkkukkddxuuxunuwogohwhkdowkhwdgddwkunhknxhnkokdnouuonnhwhdkgxnhhggwwwkxxwnugguuukkudgwoodwngkgxgknwnwnnhxnwoxwwgnuogodkxwugghngugwunxgnggohkhunwhxoohkhkxxxuwxwkdkghohugnhxgoxghondnunwxkkuwodoukdxdguxhdodgnkgxugxudwwohuddwhwhnudnxddxdduwhdnhuowxoxdouddhdnugonnokounxdhnndngudkwkkgxxwuhxdunkhngxkkhxwgkghndngknnxdkhhgknxddohggodkdhondxkknnkgkoxguxogdwghwduhdddxhdgoghnuouhgnonxuhdokwxwuxnxwwuwoxokgxngnxuxhugnkwwuddwnhhnknxoxkgnxkdhwkhxohnkukhxgnhhnxgdkwuhhngunwknwgonodudnouuwudhhuodkwdnggdxhxnxxohdouwnngwkkungnxwkxggkodwwgdggoxgughdxwgngughkdwxkhkowduwnnwodxukdgxhxdkdxdnognxhxhxwngnwwkxhwkuhohugooxnngkkdoxxoduxkkwokuukwxkonduhddonhkxkonnxxxknkhokdgdnkdgkhkkduunkwhownouduhxkowhudgkgggxxnngkxhnknkkkukwgwdhuwxkkouhuxuxguhudxxugnoduoxuhkukdhkgkohwnuwddhkgknxwwkkogonwgndoukwdkuxxwunnuggoughgdhokkwxkounudonnxguwdxkxhwhxwhwwxwknxnownuoxnxxdkguoogdoggudooduoohdhuonhxokggwdwdhnuwwxoonuonoddwwnwuddxhwxudnonkhxnhkdddhxwodukxnwnongwuhdohwouhgogdwkuukggwdoxkdgddgnwkwgwowdxhkxghkxgxuxkuhxgndggohunkhkhkdggdnkxkkgnkwnouoddugdngwkhugxkghhxwnwghgohdwwxxhnuxwwnnhwxhohuguxkhugknhuhuwwodouhkxuguuudukunnnnugngggwuuuxgwnnwgokgkxkudowkogogukhhnogduuddonwonudxwkogoddowdnxwunnhndndhkokdghndooghwouhugxwohhunwxxghunkxknnokdunwhkwuonxhwoowndgoudokhdxowxukhxggkghnuggwogxgwohkouxwkdoodokhwhggodggxwkddgddknhkhhxwuoguunnxxxxnoxgxohnouwwnhoundxxkxogouggxnkdxkohhonwguwgogdughkxgdndwkgdooudoohkxknhonxwwkxuuuhowkghgonoxhxkkkdhhowdwgkgnohkuguuwgnnudwggkxxddxwdhdouuwxoohdwhonunkokgdhkkkxxouwxkuwgodxuouowngwdndkuhuwuudnnxuxndokkkngdghhxxkwwxnkngwngwxxunwwogxukodhononougnokudxwwhhuxdxgdnnukndxwkgonowndnkkgwhkuowhwwhhdgxwonuuxkwwkhhnowwxggdghkouxxgduduhwgxnwoohhwggkwowdknndnnnhgdokwhdnkkdokhhkgougwggwnohndnhwxddonhwghxwndohdgwdxwwuhduwogngnxwxngouhxhnnwxxhxggxonuhgohnudwgdkugggddwngodhohdwgxunwkudxoouhwoouhndugkkkkohwhggknhuwkknodxnnowohggkxuwduxdhwkonngkhhwnhgundngwwohdhwwdnodukxxxhuwodouhghnwkhkhungdnhowhdwwuxuugokukkokgkkouuxdgdugwwoonhwkdwuguxogxnxdkkhdwnnonwggdoxdggkokukuuhgwkduowwkowundohwkhwwkgohhxkddxkuuguwxdgnunnwdknhkdgoxogxkxdkuddxuwwwnwggkxxxknwdwkgodowhxxnhxgdxwowdgwwgkhwunogukxhkwnwgngnhgdwuxoxxudxhxdnxkwkwonkgokngoowuxnuhxdkodduughduduuuoxhunkdxwnuduwhdxuwgxhwdxgkhdodnkkghuhuxgxwooxwkhwwwwxhndxdkuwukdkhnwduokxkwhwoowkgkdowuxnnxunndkhkxuodxnnhgkhgxxogwgxuuknhxuhdxnhodhwxknwkkdhoxnkhwxdhwnohukknohkduhukuwuggxdgkhhkdggnkhhhowgndhunggnudhxdkodudngnhhhuuhkoodhhwwxunuxkogookguuhoonkgnkoxkwhuuwdwxunudoohkwhhkkdunkgnunuuuwdkxgohdwkgdxgngnkhuwhgdwoxokugogkwgoddukwkdughhknhkogdnxnkddoddgxukhxngwdkndouddwdwugguukduxnoxnuhxnngoxgggongodkuknuwxugkgkohnoohgxgukkdxngkoxkokoknkgudugxdkduknhonwhdxugnnwkuowkwuhounkhgkkhwdnxhodggogwdnkoudgdnhoxnoogdwkkuokgdxnnhxwodxdhuuwhdkddgdddxwhokudhdkwgxxwkndukouwxowgndnonxngnhhdxhgngwnhgwxxxgddxoxugkkxhggungnuxoxknxgxxhnuhuwdkgnwnhduxgwnkgdgouwnxodhhwuxohkndwoxoohudxxxnwkoonxhhggwhwggxxonxonngwuwonddxkdxxkgxonxgunuguukkgwgwhxwukngwdokwdnxggngnkhggdongnnhgwxugxdwkxkknhhgududxgwhhdngwdnuungxoxgxxxnouuonnwdgguwhowuuxxdwgowuonwdkkuxoxdnxxnkgoxddnhxxhggdnnwghnwnoxodwnhkdnuodnkduonxndghndhkxwkgdngxdunkxhgwgwdukdxgdohhdxhxxhdnuwnnxkhokdogodguduuukdohhkoogdxgudhwndnwhnhhgggdnwguuwogkughxxkdugwohxodhngunhhugkdokgxxwkknwwhwwohgodkkkxndndxxdoohodkhkknogognxkhdxwwkxhhuwohnwdkknwwnngndwhhohwxnxxwwhuxhnhddugkuuxgknwxdhuwwwnxghuhkhdwkhgukuodxnxkogokgduxhugxgkuxnnhoxnknukhogkwwwnoukguwdxnwwgowngkowwonoxkuognxwxdxkwuxwwodnonkwxoxwoknkkxgunnxdhkkkdouhuonuxuxohwwodknhdwhgxuwdxowhukdhuwxkngdxwgwxgxuknukuohohhuwwkkdnkdhwhkhwdxdggnnxkdhooxuokhnndgnnuuduokougnwxhkhwwkhohonkgughgkhudhkhukwuuonxxhkuhdgggwuhdodowgdxdnukxwdhdhwgudnwuhnwxhnguuoohwxhgkhdxhxddkwkkohgoononwkdghoxkhouxownkkdgnxwonxoxxnxdxkudoukggoxdduddkhdgowuknxxgxuhxdwhouuwxnkxxdxdddkxouwwhhkxghwxdhxwwkggxhougouuxkhdokoggwdhuongughghowghhnkkhwokouwkxkhdukdwdhdxodgdnouonnkddhkkxwxkuokdwondhkwuhwguxownnuoookoxdwknodxuxuhngwonunhwxggwhxhxkwunoxwogohogngdknhognhgnndhdgwhndxguhxhogoongdwghuuxhgxgwwugokkkughkunhogwwhhkdnohkoguugddgdxhnkkoduonohnkgggdohxdngnkwugxdokxwdhwdohwhwghhdnnouookoxgodkkhwowkxwkxonhnwdukhuxudnuhgnnhhnxxoxnhkndwghdhdougohhwgkuwkgoowokgdgkkwohduxgngwwoxghnukdgxhdkunkgwughxohgdwhondxhgwgdhohhuwxhwgnwdhnondkwxowxhhdhnwkxhwgknkwnokddwhxnhhgkdogugdguodgokuonuggxgoxudonhhkowwhndxuuhgkguxnouokkuxhhngnkxonokownxngkkgngxnkkuouknkugddnngwnkoogkuuuonhnowwwungnggwkwoguhwhowwxndhnkokdxnukgnowhoguuhohwungunokdoxoodgwkohuuxgwdwnkwnwkukugxwgwdhxonowwodgggdxkunughhduxdkhduohnuxxdwuwdokhnnhkuwndonnnwhuxnxxnughwuudkdouonkgnkxuhhkgwnuxuddoxwngohddwwwdddwwxnkhgdxgodhwoguoddhoxgogohdhxgnxxxxuodhhwnnhxghudkdwdwhdxkuknkhngnnoxuknwuhdhwwdnknnkudnwnuxghhudggunhwuokxxwxdkkokdhoguxkwudhdunduugnggkkxxnkuunkwdnwdhwnkuwgoxgdukduxnnhdxdnggoxkogokwoxhnoowxhouxgodgxuwuxuonwxhgxwudonogwoxghkhhddhnohowwggnguhwdnxxwxwnndwkdwxgwwuxogkukguukhuduownwdkwodohxhxngdkxnwnxoxuhuowgnokdgdowxgkxgwxkdwogownguooduhnnukdkdxdwudhdkwhwhwuuwdxwwhxkwkohggougudgdhgwxunkdguoodxggxdngnhwdoxonxhhognnnoduxkdhgnkoonxghunkkgugnunhdnddnoouoodwknnduoghgkuhghkoghduxkokhkkgwwowxkhxudunxndxguhkokgdduxkggxnuxugoonxuxkudohxxuudhuxxuxxugxodnwkwnudhogxoddohnxwdwkhkkwnohugxdgxdkxduxhgwwhknxnundohoduhhgxxxddwwgkxkwnnwxugounwxgkhgdnkknunwxxxwodndduwwxddxxxkgxddxhugwwghowohhkogknkxgxhuhogggdddhhohoxnhkdxhnnhkgougxkwoghownoonnwnxoouwodowkdkwkndongnxoougxxwgggowuxuhukwgnwnogdkwkhgkwnhggnkgnwgwnguwddghgkghoxdhdxwxohxgguwoghnwgxxwxdowdkwnkgdohuwkhounoowohuouhwkdukuhowdhuxkowdxhuggdndduukwxhhkgwxwwgnnnuhgwdwunuhkdnwxhhwwwwgwkwwdnngkkxouonwwnxgxodnndwwuwokohudokndkowxkhonuwnxohknouwkdwknhoduoonkxgukgudnwgkokwgkghdgghdhuugnddggxxuudgodnhugwndohouoduokoxhhuxnoogoxhuwghhwduuoxgoddhxxghxdkonwkgkgugwdwhnukukuunhhxwxkxwouowwggkdkoxuuwgoonkkhwxnhduwkhxdduhxxhuxnkdxkownkkunxnnwundwdkgkduukuowxnnxnuuhhghuduguonngwouhkuwhhgxuhhwhguduounhwnoxdwddkdhowxdnxwunngkuuxhwkghdkkoguonhwndhuwgohdnnnnxhuudkgdngxuknwgdoxowxnudxdunkugundhodondhxonwxxwukuxxhdodxnkougxnnwxnxdugnkgxnxkwwhhohkhuxggdkodnnhwxokoonuohhwunongnowdhkononwnkkohgohdkxwxnhngdhndgxduodwhnnnhouwowgnohhnnngwnhowgkukooowdhhdhgxnghgnwhdhxnhnguwodnkxgkukkonnxhhdnhkgnkhnxhkdoxgkwkkoxgggudkguudngouuxkunhuukxkwxwndongxouuhondghoouhkhhkxhknnwhnnddokkdxdhnwxdxgogonwuxwgxnohdouwukxgkduowwgwxoudnxhugnwhuggguxkkkkowxxdodoooukwukngxdwdguhwdokhkhduwxodnuoxwdknwhooggooxgghkdgodwugddxgdwwudnoohxuhxxwgxngkndxgnxokxdnndnwkuhoogunxuuudongdkxuwxhnknwnhhudddknnhwdkkugghgnxwonxhwoxoxwowkwdwdnhdooohhgxxknghwudwkooukddugxnndwugxuxwogognooukhnwhxuuxxouduggwwxxgxuukgkudwgnkdwnwdwnnhohkuhdwkwnnwkxgwguugxduoxkgnwgohgxkuhgdhwhgnxokdwwnkhwndkokouxxokgxkhnnwnhxkowxkdhndnhwkghdhwgwdnoxxuuwdxoodkwkhowondwxkdowxkhkgnhkhwxnoxoouxhwdgnwnguwwxgowowugkhdgnxgwoxowgwnkgkdnwouxxdownxkunwohdonwoggwxdngwduxwunkkxhkoddudhonkwoxuxgkkwxuoxdxugnwhxxwxwxdwgnkxdondwwdguhwhgokwxnxxnnunddxxdnkuonkghdnohuuxwgwkuodhkkkdwkgwukduuwkundwwxkkgwugxwkdgouknkwhwhohxkddkkwowdnokhwudohhnowduounuxhwdgoxxkdohdugwddxhuxohnxnownohnxwnhuunokwonwxwugogwdnnwnkgdndgndxnwgnggugxhogwooxukodgwoxkxwnwuduwdhhduoduouwoxnhuuwukxgkkokwxhhukwhwdoddwnknudhnghowxxguxgokdokdwkwxxxokwooowkngnnhhnxnkugxhkgxunnnwhhhdkkkuwdxxxnukooxwndkkxnxgooxugounhxdwxhkuwwhwwugohogugnooduukohhhxhhuowwhwkwnhdnnuonxdugnwnohhwoxgkdkhxxgudgdwduuxuunhudhohdnugxnghhokhhwdhhxnxhxuuhookdknddgxwkndugxoxxdouhhxwwuguoxdnkgdhwnkwwoxogxhkwhuwdogwhgowgwhdkkkokdwwxwdhooxgwwkgnhxoogxouowhuwxnhkxxxogwnhunhhgouwdndoxkxghonxghdoxhgogdgdxxgnwwxdddugukxxxgngodknwnuwkokddggogxukkgowxkouwkowwohkknokgwhhhxxgdwnkxundkngxwkwnowwgnhkkkoxddugdgddgdoowunwwohhxgxudwoxunnokuwowudhnggngoddnoxdnwnognxkdnkwowddnwduounguuwgxkwkoxkhxkxxxnonugogowuhdwkghdkhgwugxxwxhuhdkgondonxkowxwdhuhddhnxwkugwxnonxodwhxoghwdduhdkkknkuowwhnwxhodwwndwkukuwouoxguhxxwhkohngnkohuoudnghwkgdwhwokokduoxknwxduondndhoondknononhkxowhhdukudoxxgndoownkwdkguwunddxddkownggkkugkugkxxonouuukkonhgukkxwhhdoukukdnnnuoxwdukhhkhkugxxddnkwhkhkoungkdhxhwgkhunwkgnwhogondwwonkndnwunkkguouukoggkhdxhhnngwxdunxdgkghxnwnwwduhuhgnnhxkuhudxxnhhunghxxwwwowwhdudoxdxwkuohkohnkuwkdghwoxwnkwuddkgkhguxhnoxhwxuowkghddgxknwkoowwonxdwwxdxhhkgukhkxuxkggwonkxwoougxgwunxodnhkxhkuxkhohnunuoggdwuoonoouxgoxwhogxguhoxkuhhgohungohuonwwngguxwohhhdxnwwuxkogwkhnkowhgxunggduhkdxdxwhxwkokhdkhnxxungkhxwddkwgouundougwxkohwwguxunxungddhdkxkunohxhugwuhdxhgwndkkgdndudwuuddggwghondxnwhwgxdogwwwddohgwdxwdowgughuknkknnowxkgnwduddngxdwkuongxxgogwxgnkoxwdgxwgddoonuhnuxdowdhgukogkwxnhdukgdnwdukkgwhoxouhundhudguwwnxkwkgohxxhoogkonnkxhkondoxhooukggkuouwuoxkwhgooxwgdhnhudkohuuoxgdnxxkgkxodughxgwkggoknnkouhouwkddoxuodwdkkuudognxgoonkdhhohkuhuwduoonwkhhkdwuwwdokkxwghudoodkngukgwungndkuhwdouoxoxgnokddxnudoxwhwkdgxogkogwhwnxuwouodohxxudhoxwnnoowknuwdxhongnnduwonhnuokunouudhxonhdngoodhkwhxdnxngowkxxhggdoohnuoxknodohkkxxnxhkxxhwnghnxgodxhgwwdhxddhonhgwggnkghxodkdkdddkkxguwokhogggohndnkkddxwogduhhdgkhxngndoowdhukuuwuwwkowndxhguxwwuxndxxnhxkwokgundghgonoxnhhkxnwowxudnxgkxuokkdhwhuxgxnxwkduxkuwxnhnxgwodnhgwndxxgkknghdogkkgdnxwunnuuokhdnnhxhwukkkhudughdnhokdnunkdudnhwgnhxknhnodwoogwkkkhodknddokgghowxguxhugnonunxxnhdokguugukgoxdkguonhokhwkwghnuowokxukkuouddugnwoonkohxnougnoxnxduuwnodookknnguoknnognnoohhwdgnxgdhogdwodxdndwdkuundnnunnhuxxkxnkkhdudogownxnuhgwnukxnhwnoxhuwwdxwgxdwhoudngwxxuxhoxhdgndhnkhkxduhxwnowkdwoonwhwgnowwudduwgxxunxgwhkounxkukguxnnnwdxkdnxxngdnnuwghkhknogugwxgnohxuokouxoxdwguugudkuuwxkoghhnhgnwkdhgxkhowdhkxnkdookukuwundoohunnnogxkknxuuxxxuodgdgxwudooduukdhuhwunhhgodgnknhnodnowhxnnokwohxownwxukoohohgukhxnokoghowkhgxkddgkduoxuhgwwougxxgwnhhkdgkhkokhuuhnhhkwxwddnkhogwdogougnuddkouognuuwohnndkxnowdowwkgnuodhgkhdonhdgxuduxnuknuxoodddkkhwwuuguwououxohkdwuowuwhxguudgwwxouokdwdhxwokddhggokxgxggxwxnuwkkdunkwwuukuxwwuwhnnwhdugwnnwwuxuwghhounkuuognxxnwhhkuxhonhdukuwokxkhounhkxoddghgoguugdxgooodkknunknnhdhngonnuhdunownghdkkknxhodunowhndkhowkooxdudddxxgxkdwgwhuggnguxndhkwxoudgdugkxgkonungxxugkggwxhguxoodgwwhonndhnunwdokwhgxdwhngxohkodxxodukdxnxuhkdnxxxgxodogxhknwhkguxndhngwoxknxggwnuxkuoddhgxxnxuwuwgxkhkkgwohhwhudxnuowwkdxkndhkxoukunknwnwudododwdxkukdxhhgoohnohunkwnxuxxgxdxnuwggxwowxxhgkxknnkggnkgxknhoggogwwxhgkoggnwxwwhdunoguxxxnugkwuonwudxnxohxnwkogkwhngkunhwgoxkwkhoooughnudhdwwxkxukdndhoxnounuohhngwogwnwwghdhnguknggxkukohhwkkgouxwuohwwdkuwgxgkngnnoowknnhwghxnwdwwwkwddngogdngwgkhnwogonxwwxwwdxkdxgggkgxkgudhhnwouxokkugggokwwkkukugkghwoudknwngdnhgonxnkxdgudwwgunhnoddwwdnhuowwxwhgxdkwdxxgkdddhohdunknnghdhukwgxowxxugggudwdgnuhudnkkhokwuxxnhowokhuwuknwngownonxxgowxnwggkondhgxdxhkonudxodhgunwwdkgknxkuwdgkowxknduhkhuxwodnoxkwguknuohhgddhgnnxkgkkhunnxwowggoddhnnnoxhhunuuogugwguwogoxwdohuggwonhnhnghuwnuoudxnhdununxkkhwgdhkuggknwknuxoxwwogxhndowodkwouogwodgnugkkhnuknuwkhwwwukgwwkukwowkddhhuuuoghxuodunugohgxnondnxwnhgukuhwkhxhnhdhnuwodxwwgxuuhxdwwkddkkgxkdnxhugxdkughdddxxnnnhdgowkxdhowwggwwwkgghdkxdkgohugxoxungghdddohxxoghxnokxhnxxnudndxuwnnngngoxhxugwxkkgxnowoxdwuwogdngwnhkwnddwkudhwknxxndnouonuhxxgkdhudkxkoukuxoxogwkxggwgwgwwndgodoxnwwuwdgnduhudkuonunhwghoudkwwdxghdgooohxgwwhuhnkghuxgonkhhhuxdxkkkxduukdkwkhhwohduwugkuwxdnghndxukoxhohhgouxooxoudwuwndgwnhudhooxngwohhkkhkuwkkdowohkhuggonokxokhkuduwxgdgkddhduunuxwwxugonuouhduxgdnonhugxkhxgxuodxuwndwxxdohdngxxdkkgduwndhuugnuooxwnnxgdwgxkoxxxoguwkndxxnxhgwkhkwhuuhwnowwodhkohwhwhxdhuwdoohuxnnuduunwhunoognwwnngndgongdhowwxuxhxuwxhdxxwkwddoxhonnonhxxknoghxukkogohxnkduudoxkhohodxoddhxdhgwowkuhognxdukgnxnnnnwxoggkhnguhhohoxnuhuoounuwhnxkxgwxghhdnnuondhgoxnhwxwkgndxddnukoughknwgouhghwxhodoxukhxugwwungdhoowkwwhgwxgkhnuuggwukndkxkdonuoxgdwgdwwokhugddxwwhkoxdgodohooungguonwggxuwwohxukwodhdnuoxongdkxddwwokhodxknduudnouwugkxoguugnohhkkhwdnuwhnoxundhdnkogkndnnnkwgdwgwuodgxgnnnnoggowoukonwdgngxddkndgouowukwdouddugnkghhgugkkuuukwuwxhouduooduxxkhuognwwhuuddhonuwgwowoxouhhnnookwnungdgohnhgdnkxxowunuohdnoxguxkwwondnhgohwgxudwkxohxwunguohnoddxkgnuxguwwogkgghhoxhuwdoudukogdnhgunxnwwhhdddohgooxwonnnhgnhhunwuknngognddknodwgkggdwxknodkndxwdhgudgxnxxwdhgohunhghuxgwgnnuouwooxxdohdxddgxkukohudgxdddwnogxhunxnkwkuhnnxxxkwduwwkookkxwdduhdwgduodokuhhdxudwnkugwkndudnudugggngkhndnwgoddnkxwdxuowodknohodouxnkkwghxkxxhxuxwwhxokuhononkdhxuoxuhdwuunwgkoknghxokuugdhuggxuxwwgxwougdxduhkohwugkgonogwunoduwonxddwnwkuhxhdhugwxknogxokkghgkxhuhongwgdkwkwxodguuhwxukxggkdkuxndxowndwoxouwodnxnghwhhgonookxuwownhgkndxkodxoxuhkknhhknuhddwuxowhoxdnhxuxgknkhxhhnoxgggwunkxodnodnxuhxokwukwhohuwngowngghwudwowxgnxundndhkgxgoxwnggunwwxhouuuwhooxnuododdxnkouwhngohkdhuguukgdwnwdwnxwonukkhnooohuwwhgwgunwuhnhunknkdoxonkxwxdwwwuwkkxnnghxowdxgkwxwoghnkodghwghxwwudkwonoxngkuwwgoddwdkxugddhogwkkdohgdduwdkxdwdduongddxkxdddgxkdkwkkkngkkuuhhokunogduuonokhuxwudhdxnoguxwuuwnxxwdnxxoxkwdxhhgokhgwhkkuwouoowddodowwdxhddgkkwnwkhoxuxnnodonndkwxxhnghxgxgououndwnhwukwddwnughnwhnkkgxwohhwugnnndhhnouwnooukdgnwwuhkooxdgkxudoxdwdkwngxhuhwhguxodhonhgxkknhoxgdggohxxdwddxoxokuwwwduhwdgdohkhdkhdugkxodndnnwugduwgouwkwwnohghdnowouhnxunxknnohdxwkdowohuwnkhkwhdnndgwkwhxkkdgwwunxugwkuokhkxxxnduhdwgoxkhhwwoggwoonoxnuogxuonnwgnghooguuwhggxwwwgdnuokhwduwxdwhuowgggwxkhoxohdwwhuxnuxhxwwwhgknhoukouxgnnunkdxwwxkwnokdoohnuuxonuonuxhhkdwdgwhnokknkgnnwnuugggnohudkkgkdxhdonwogxkhggohxhnwkddwwonnhxuunnnokoxudkooduxwwhnxookdhdnnwdgxhdonnowokugowkookhnwuhhxonhgnhodkodkkodkognddwhoxwxxnowxknhkxngnwodkhnoggdnwgxxxxxhkunouogxhguuggdhukwggduuxnnoxhudxhgnuxoxkkggwwondxwwgxddnduxnhwnddhnxdxwuwnnowkohxxdghudkkgkowggknuwhkxkodnxwouhknuguuugdkgxuoxwhkxukwuxgxkduouuhhgxddngxgxghgxkxhuuwkogudkgknhuwxnkhxxhkhdgdxgxknwukknoughwdgkuohxukdunkkwgxdxhkohddonuhxxhowhwhwhhnxwhhwnkdohxgkukuwkdhngwowdwdwxnwogdoxnhugwndgxhhkughxxdxwggxonkwxxhwgduugwddnhoggouunuhdxdxokdukgkdnxkudkxgudxkowkxxkkdunxxhdhnxhnnwuhoonnguoouxhnkkgwhkhknhoxgugxhwuknhdkhkhnoououdkdduugdxowkddhohhdodwukdnxggnudxhwwxudghdxxhwokxddgwhuhhwwkkdndnnkhohwxukoukwxxnggkdxhhggdwgddwowkhgxowdghwwdxwudhdwonkwonkuhwgxookoukhuokxuohkdnuwugdwdwwnxokdhnxkkuodkhdouokkwwduggdnwdgdgkdowuhnwgougnohgwhdgukdndokdunhwgoxuwxunhnwouhdokxhooddgougdxxguduxxuokgdowokohwkuhhkduuokkkwkuodowodxkhxwnukxuxognunhduxghdgxkdkddnuowwnkunwudndkdudwgkguuxwohuxuhnhxxxwgxunxkkokdduuduwgwonghknhwwdxxdkdgnhwkuuhnuhkxxnukwhkungghwkoxuwdwnxwxuxokxdxnwxkkxnwoooddduuokhokxhkunxuggwxudwnohgukgnnoonwooowwggwnoxwkxdhhoxdkxgxnuxkhhdohhunowugddxkggghxkxdhhhkowwhhkdwxxokkxhuwnhdhohgwdghnhxkxnwxgxdxgwkxhxhunwuuwooodnwhddwxwxuwoodkkwhhoowgwxnkknwdwnuunkxwgnogouxkxnxnghwwgxnuuodxudohhgwgxowohkkwdgxddhuwddwndwxwugkknnuunkonwhooowkdwxwnwkdnudugwxdwhouodggxknuxnhoungonwwxkxnkkowndonxugxxhxoxhgugunhhwgwngdhwxghdnxgguwuwnoxwxxudxguodxkgoxnwgkgwdgdgggkukdgdngkdhhhowkxwnghdoguhngxnndgxhnxxknhhngnhukuhhdohonkukohnnxxnhnhduxonnwhhduggouodnghkowhhudkgkxgkhgxuhnknngnhwgghohxghuohkoowokdggxddohgxxoddooddunnukxnogdkxoxxugxnugwonwxkngnokdkdgdkknnwudkhndonxognxhnkgdghwxuoxodndhkhdnnnwgdkkhwnxoukgohokghudkduohgwdxownwoodoohhwnhwuxxggwxhxwnnngxgxguowkoxwxwnhhddooghgudnuudwuugkuuugwhkokkgwhugxohwwwkwgwoowuwdxkoknoudnnnnddoxnoxouxwxnxonnuxookkwgnkuxudwukwdhkgnxhxkdgxkodnwwwgokudgxnuhkddhhungnxgdodohdhxnghndkuguuguodwoowkggookdnxnxxhngwunohgdgdxognxgdnoxdwgkgdkknxggoxxwnxounwouguhgngdnnwghxdwddnkknndowgnoonduonxdwwdxdgdxnnkdudougnxgghdnoggnunkkggunouxnngwouxudxnkwwwgukddgduogkoxkodhognoudwonhnunuhgxkdwokokhuhhkkwkddwkhowowkdhduukduohddndounxndwgdwkdgnnuggogxhuownwngnhodwknuhwgwkuhookgxhkwdgwdwwhkwouuwdohkhwkhohngnkgonuddndkkuxnwngnxhkugngkohuxdoogdxuwgugghngxwxuhoxxhgkwhwwduhxhhuuwdhhddknodkwhoohuwuxnodgkxuohdwnkwxgkkxnndgnhkwdgdowugggxoxhnkkkdnndhooowxnxuuhwggkgxdxnwuhdwggwhukwhduxdxwukwnxdnoggwxgkooudkxnnddgxnohkkndoohoognkgxgwkuwdhwgoghuoguwhwdkookgxhohkugxxgxxxwwknuununwxnwogduxxnxduuukhwhhkxkungndnhdnuwonokggndnxnxngdxhkxwwnkkokukdkkhkwhxkdguxhoxwkwdxgdwwownohkwhuhnkhuxuwnuwxdowhhnxuwknkukkunuudnwuxowwuxndwugxugkuuohkwkgkwdudowgkunkhhunuoxgxugdnkukguxuuuohkuhwdwduugughuwduhuungxxghwnonnndkngdgngdhnxndkwdgowgxngoxuuxnhgduxkhoxdxggokndxwddhndxxxghddhguwwwoohggndugnkoodxnxdkxuwxkxnwnxhxhgunoxxudghhuhdkkonohwuwgouwdxkngxukkkhonouxgguownnddxhunhxddgkuuxxxkouudnnkduokxdnxkkdwhoguwhokwnwuxuowkukxgkgogduoddwxnowgkxdnhgngngxoowunhwkhunougwddknxhgouugxddkwwwnkwnkgunoxkxdwhnuuhnxhudxkhkdnngnxuddkhuwgkwngwhuxkoxnwwhnhwnoxwxokdgxkwokwhknhgugkgwhwgnhgundwxogwnuxgohkoxwnxnddnukgdxduxoxhkggnokuxgkxoxwxwgoxnnxugwughwxkggnhdhwukgughgoxxonkxkgggkgnnknnghuhwwkxnwghxgogooguhwoxkouuodkoxkhgnnkghhhhnxkuohuwuhnuddwuunnkgohdgkduoxkuonhogogkwoxgkguxkwdxoowuoonnxuhnxxnxknduudgnnxnxdhxxngnukougwhxdxdkhkdokndwgdwogkhwwnogkknxgnowwhgouukwduwkkdxwonuuxoodxnxxnhnxgwxugxxwduknhknxdnhxkghkdgxukdhgkungnouxghonkxgwkdkodowugxhgxudhuhkgwwhgddxkhwdkwuxhxxdogxggdhhhoxwkwnwxhxxdugkokuuuxonwouddkwdungnookonnxkkhhnhwunowwndwnowoongxkddwonnuduxgogknxohxuodkgnuwnwwgnxnknoukwwdgkkgguuhdnxdghkuhkkwkwddoddxdgnndggokwhwhhukuxwgknokndhguhwuxxknouxdxwhkodxoohxgnguunduodgwkuokkohdhoxuuxoxgunhuoogxggdouxdkohhgokndukuwwdgxugngxodhhkduknungonnogwxhwdoddkdhwkxohoooxgouhnwgoddnugnhwnonoxkdhgungwkohxgudhonxgghxxgwunxkgwwwugxdxdongnknhukuwxndududokhhhuhghwndukkunhxdknwggkhhnduddxukdkdunnuuungnnxxgodgggxhwkhnwgdnwohkxxwuwgghkuuggodkuxndnowxhhdggwowhkdwonnouwxdwkudoxnnoxhuxgkhkowodkoudnhgodndkuhgwwognkuggnkwdnonukudkknuxhdkogdnkokuhkodnkhxouugxuhdhuhohghowdhwnoknhdoxwghwwhoxxxhxgnkwdkwgdnhdkdkhugdwkdowghohduhohoondkduogngoxwunnkuowgnnodnokwnonnnnwghwdudhnuwokgdwhxgoxwdhuhwowkdgoukdudkoxkohohgkgkuwwwoxnnhghgwnohknuuhnghwuwdowwdugxhohnndkdghgukxxnghdhxgnxudxxdhgdxowdkngnkxohnwuwhhwdwwkgudonkukkgdkhoxdnwhowokkugkdwuwkgnnxkgghnnxwnuxnugoodwwwuuohxkhonwnhogkxnkngnhuwxdkkwoknxnnonnwnngdwngwkgxgxxnkgxkwkwxxxuhhdxknuukdhodwddhugkukgxoxoxkunknwnhoxkkwwudhxdhkghdxkgdxwkuwohdkghngwxuokngkhknugoghohxuhhwggnhkodudwognwnxnoggkkkwhkxdonodhougwuhnkwwwnnggngodkukwwdnwwhwuwduhwghkxxodnhooxuguoxkhdgkkwokxowkhunnognwkdhununhokdoghuxgwhndhdguoukuowhxudohgnxhdxdxxwouhdhnokwwkuwonkhwuxnkwxkugxkhxohnkwhxgunhxgwddwnkghggnkxwuxgwgxugnxgnhuhghuuoogxdddndnhxhhkhkuddkghkohdudgxnnuhoknwxngokddouuogggdxhgxwwxwhhxnuxunxdknughuhnghggkoxwownuwdduwxgudnwdkhuudgxnxxxuwuuoouuguwknohnowhkhdggnodkhgknnwhwuuhogdguunkowguuwwdognuuxgokhgggnogguunhduxwgdhdhxhdxwoudgggnhxuhgwguhwggdkoohodokwwwnxxhwdukungxddhuwuxuxnxwonkkodkhununoduukoxhxhhdkkkugwggxgdnhgkuunduxkwnuunkxkodwduhgnkxuwnhxxognowghukxhdxwoudnkgddnnuxkuxoudhknghkuohudknknowhddoogxdhdwndhwohnnkohoudnnghunnnhhdndnkkgowoowkdxxddnohohkxxgdnnogouuwgwxwdwoxgkknuowhxkokndkxoxkhuxwhogwwgnguoguknnhdokdhukxudkkdwuoknxdgxduwuhkwgnnwkwnwuoxnogodwkownxgukhgxnkxkgdkhokwnohxdkgowwwokhdogudundooxnndudhduughondgkhddgngwwhgoxwkwhdkkwokdwghnxunhggdxxdukkhudnkdooxnwhuduuuwwukdwkhwdonuwudnugdgdhndgdxwwhxkodkuwgdoghxwdxuohogndogoxuoouhwddxdnhowokkddguuxoxnnxndhdddkdngxhkhxoghwkuwxdowhwxnxgxhoxdowkognwhgwndgwudwgoxdhduwkuukoguhxdggogukhkkoxwowwguxokgggoohhhghdwwohnoxnkxohkokowugodgukxukgdxxdnddhdoudunxhwhodwhdunhookodxgxgohwkdkknnhdnoxwhnhoowxhhndwhxhnwhuddhxwnuudhggwhhhwwngnkkxnowgonhduxonuugdnxhuuhwkdkhxhghoguhuwunkunodhogxdnxkdgokudkxdhwndgghunoxwnnxuhngxxodwhgdhdhdnhngghddhxxnuxuukonodhuuwdndwnwkghwgnwngkhgnunkkhhxohnkoknkxwuhoxwxdoukxhhohuhwognuhonkwghgxwkxhknouhonnwwdgghkhunoggknuuogdnkhhoodhndowxhooonukxhggggnxuhnwxngnukkwdngxdwkxoxguuoogghwhunuukowwnddgohxuwnwugodxngkudwhkxddkgxukdgdggwxgnokdkognuodudkgoohodhokwwnuoxhuxxdnkhkdkxhgkohohxowkowwdkgughgggkxguwghknwogxukwghnuuunohunhohnkuokgdxgguxwundnnkxhughuxgguwuhhdknnnokkhhhdngduwodhoxunkxukodkxdhgdhnunxokndnxkwuxdgnduuhhwwknnonxdgngnhowhdghugdugwduhughwdwhudhwxdxunxhhkdwuooxngxxuhgkunwuunoggwnwoknhkwhxwuwnwxhuokwnokhknwxnhwkduhgxgkkooknudkdgowxduwhongguhwhhwnohgkhoowxwwuohwxkwwwxwkuowkxounuugdxowxuhgogwwudgkwuhgdhwnwxoxhwwwwdnxugkdxxwkdgoohgkoxddhghxgkxddhwouowgugdwngxoxuhnnodhoxwkxxggnwwhounukkkdunnnhnwgxoouuxhdwwgdndggxunwghwoxhhdgouxxkduoxkkdxdxgkhuwxwgdxdnwwhngnxoouwnouwxduwnnowhoggddhodhkdoxwnouxgnxhxhwwhnodnxwuwgxxukngunkggwkxkhuuhodngkhhoknooxgxxwngggndoohownouuxhkuxdxwuhuhoookhogwuuhxondgnwwoxuoxgnoouhknhnhuwwxnwguunonkhkukxwnuxxndnhxkgnnodkdgxodunkdxkhdnogwgwonohogokouknonownkhwugokggkhdhkkgduognxkkwwddkdwkuudoouxnwuwgwgxdkhnxonkkkxkunnxudhkggduhxhdhdnxnhgonukhdxwxoxohuokwdwoxgnnnkkdhnkgdkuudndooohuknnhodxkokuwwgoxwwoddgkohhhnkngwgdkhuhukxnohhgoonwhonuknhgouodhhnhudnknkukhuhxngwndhhgnuhhoohkxhknwkdgunoxoguwdxxxxoukohwdhwokwggkgkgnggxunwdhhgguhdwnoxuxnkwhguhxxhuogxgxgxnwuwodugkkgdokuwuoxuknhngwouhhuhdgdhwokndxwdxdxukkhhhxxonduhndguodohugdugkunwhnhxhnnkudwddddoxuoxwxodkwoknnxgungonggwouxkwouwkuwoggxxdwowhwhxhunukkxwodxknkkoodhduhwnukkgwuwhgnuxuwnhdnoowugguwohudkwghkhgokdghwxodndduhdgxnxnhokdkndnohhdxwdonnwdodogxnnkuxkgdgwnkdkkdkhkdwddxnoxwhgohxgondwuukdhwwdkxokwdugknowwkwdhoukwnuoohwookwuwxhxuwwwkxgwxoxxxwwhddghkundwwnxgngwundggwgggodhnuuuuxxodugndhxnxxdgnhduuxnoohhkugookwuxghhxhhuhhownhudwnuudhggxxwkxxhuodxkhwwggwdhwuhxnngdxuhuuuxxgkwhwkowokgxnhgugnxwohndukghndhhdognuhkkgxkdukxwwwhghdugugkuugxdnhdxgdongwkohuxuhoxudxxxgnxggkdokkghxwguooxoggnggkdhdwnnodxugxuhndogohxkohgwwonwuwguwdhgkxhwwnoggkdhogwxdnwxxonooghwknnhkhgounwoxnxddhwkgxnwodnhkuhnxwddnhkxxwwkdwnkdudxhgnooukwudkunuxwundgwdnguwxxkxokdknnwuxwwwwnxoooxongnnxwwuxkhuuddduwggunxdnddnuugdxdnkwnookhgxnnggooxxhunwnxdhkkokdwhkkwhxgodduwunuuguuuwhxdxwwgxdggodkkngkogugxwoxnkuohkxuwwxhhkdnhwwxgwkkuxhhgwkgkgndwoodxuuuguwkgkkuhukgwdkkwgxguxggwdukuwoghgughhdohxnkkkudouxwnkghuhwngxuduxdxxdwggdunxuooodoxggwggkhkxonggkowdounxnkgxwdugognuowhwhhukkgxwxghduudhnxhugkwuwxwunhogxkdwxwodhukhdwwouhndwodduwkngxkhxhkngwxhoxhunuuownhgxdnggdoxwhdxnwooxuhwxkukhwgkdnwhdwwgwdxxnnnhdhooxgdoghxgkuhkdnouwnddgxuogdkdhkkgghhowwuwhhwxdgwgohuuduoxnkowohwwwnwnwngddhggwdognwudxunhokggoxuhuxwoogwuwnwuwhgnxhwoououwunxkdouuwgwggngkuuwkhwduohnowokdwgodogggkguwukgohnkguxuuwnggnwdkduxhxhdgonodknnugxwdooouohuwxdngokkgnuxdwgkxdudowkuuxohkgndxxuxodoxwhhkokgkhkdgkwuduknukhxuuknxhxwoogognonunkxxkkdhhodxoggdguwxohkxukgwddwhkxhuouwokxunhhuxuknongoggkxwhhwwdddwukkxkouxogwkkdkugwdggkukxxogwugddudkuhdoggduguhkhxkgxhwxuodnwoowwuouwowxwhxdoghkwwhxnwuwguwkhxuxgouduhxognoxodukgooodkxwokkwgnxdodhgodunghdknoohdkhnwxuuxhodgdwxngwxkghxdxhnxwxxhoohxxudxddwwdndduhkwwogxodkuoxhwwdnkunkoghduhnunkogdwunnwnuknnwdnnwwhhoggoooguukwhdwhokkgnxnuwhkugnxkdxhxgxwhnkogngddkgwoonhgghxxhwxhnhokoxxudkgnunodwodgkkoxoxxwkoonxhuoxgnhkohgxnxokwdxdkowouguoxwoudugnoxhgdghgwgkunkwodnohhuwduwhugxngxnghgohuduxohxkuwgxghggwoduugwoudhunknugknwhodgondhgoxkddkkxxuxohhgnokhdkugdkxudwkdxdxunuxgnuxhgkxwhxddgwooukunwuwxhgxxkgghogxdhknwdwgwhowgdnxuoduduwnkghwohwkxkxxkukkuwdgowhkwuhhkhwhxkunwduxowkdhnuggnnkxhuxgwnnuwuouhhxkgongxxuuxkdguunnkhhxhuwwoughkuukdxunxxkhhknndhhhwdhwhwknhxdnukuxudungkgxxhgkhgwwoghxodgooxgooghohwwgwhnnokwxhduwxuukwdudndnuxgkxgdggokwxgdxuwxhwkxdkknnuogkdokdndkgdxxunkwhgkxxnuwghohknndundogxhokuuxnognwdxgwuwkxkuohugodnxwnhhxxdnwhgkdokuxdwohuunwxggkxwhwkgwkkxngdoonwhkkukgoxokhkhgowxgwgoxguonggdkxwnodxggguknxugdodoxhhgogdxdndxuuoxgnuwkxogxguxgguxxwnudgdgoxwwndwgkkgwdkdgkoxdguhkxxkhhuhdoxgnxkugkwxdkgoodkkgwdkunwdwxwugwkkkkxwwnuxxxdhkxnxdwnnnhkxhooundnuhnokghxdhukgdukxxwwoxgggkwhukukkunkgdgwknxhkgoowouwunhwoxhdhohohdxkhgodognkodkkuwhgnkxdududgdwnwnuonkwxhhghwooodoonkgokkdnhuknnxwxxxdxwhnxwohwuxknnwwugxhgogonhgwdgddgkwgunoggkukxxwuxxndkxwuwhoxhgxnxdhwkhdwxgwgwdkghgguhgdxxdkxdohhdukxokxkxkokgknnnkhuudnkkggxhoukkhkokknwxuggknxodddhdnggwkgnoognhggkggxdgwkhkuoxhdkhghwxxxkouwwhoxgknhnhhonkdxxuduxdhnxoxhukgxxgnwnngukoxxodkkhgwddohdhoonnkdkdddgxxndngkhhknxnowogoogddduohwwnxuxnwkxkgxnxwohkkounhhgkokoxxnxxknxdonxonndudhwgwnhnwkdxxhdodnnuhwkxhxxxknwkonhnhxxudxnuknxdgwhhkdkngkxknknxkdndkodonoxdxnoguooghkhwowdkudkwgdnoghnwounxngxghghdgwgxuukogdhwkduxxdgkxoghwkwxkohkgkungnoddxkxnuhnngokxokxwwkdhgdunkxwnugodkdkoukwhxwwuohkdddkwkdkhhwkxuwhndxwonwukondngoohgwxxouuxhxnnkudwxuhxnhukxwxoxhoogukhxxdnkxkhonhuddohdxdhugodnhgxggdgdkhgwngddgxxoukgxkgwudwdxwhhdkdugghxokduukkhhndnonnwuukwxuhwxwwxdgnoxdnugxkgdxhdddgkhwdnnkkoghkhgdxgwngudghgkgddhkwhxduwwwnhwuooowkkwnokkhgxnugxhnddgukggwokwodkuwgdddunhnxkxgnnhwonwhngonkkkxowuhnggokugwnuhxoxkwokwwwowxkoxhhugokxxdouugnhxngdgdkwwdnhkwkgdhddxouxdukokhohnokooxnwxuddgdowhwhxooxuokdknxuudhokkhnxowdxukwkoguwgdxgwundgowxxodxwguonwoonwwwdugxgukhoudkdghwwxxxooxhdxhnouxwdnkdndwkhnwkhkwnkgokxxgwnhnodxdhgwndnnxkkduwhunoxgnwgdudxnnukkxwhwngkuxxghodndnwukdxkowxhdndwkxndonxwhxdgxwwnodwnkuuhukodudkwwdkxhwokoxggxhgugnxwohduwnhwnuggxokhnnxkoxxxongxnhknhdnwnkodohkgxouwnnnnghhkuoduxhgxknhuugdxwohukgxodkgguwonnwudxhwuxdngnxkowdondgngkxnkukkxgkgggdhhgnnxuxxgwkgkungngdxxkoxhknxgunkkkuwknxuungughohdknxkhwnunxhookkwkgxonuukkxwgkukwohguuuhhgoddguunohwdxuwwuguhdddgwxdghgwgxkhnudkkwgughwgoxdhgdookxxnhungdwoogwogwdgugkhdhkwnxwxhnohkohnuududgkhwkkukxnddkonughnkhnwogokouwwxkgwuwdghxddwwunkwdhwguxowwnxxoguwdognkgghdongonhwundonhnxhnnoxxkdhokonokuhghkwxuhwwghxokouhknohggohwgkdnhwgwkhndwwhwwogokdxwdgwghxnhkonxhxgowhoguuokdkkndukgduxwdnkgxknxdxndggxwudhgxhxwwonukgwoxkxuukunhgguknwxoodoxwukngwdhduwxwgnoohhkggndndxdhnddounugdogudhgunkuhuhdghgwowknugoognxnkkuoxokdokxwdooukndxgwkhwgwhhnhhukkxogohkhkxhwowhnoonnwwkoughowwdhuungdooxxkuownnudkuwnhokkuggnohwuoxnhnxukkxnhdxhkookxdwddnhkdowhoduxkhwgxdkognwxwuouwuwdddnwogwondwkhdouudnuhxxwdwdhhhnhuooguxwgokdohouxxkkwnwuukooxhxkdwwngounoddhwdnhkwxukdxkxuhudunddngunhxoughndokdgogkgxnnnknhgwxxododkukkwdhognnkxogwhwxxuwnxuhnougguohgnokkhkogxounwdnxhhknggguwgnndkudxowowdwoudnhkukoxhkwdhwwxxdngxkdwwoddnngunokuwkgogukxduxdkhnxkonkxuuddwghgnkwnnddxdhdnguungooudgkunuwuxdndnnggknhdwuogodkokdkokowoddxxxwxnodwnhgugkuxoxogoowwwwdnhuowwonnhkuwnkwxnkxwonxdgxkdwnukkwwuwuxunwdhddgknhhuougognxkkwxoknwhogwoxgdnhwuhghkdhkuuudouggxokodxdwdhdgxknguookggnunughxghkgnnugwkkdwgxhduwdwokuhdwdudwnxoowknuoggodhgkhgkxgokoudgonongdodgwwwwnhnnhdghodhohkunwduugduwnonowoudhoohkgwwxwddgkoooxnhhxkdxogndxnhngdwuuohhknwdokxgokhxukhgngknooxgkxgouoxndggodugwxxundwxgxoxwnhgxwwgnkoodugxndgddnwkhondkxkhowknnggddxwuhhxhwhkouxhogodugdgxoduuoxhdddgnndhhwounhdnugxgnuogokuwdoukdonhxggxuxhuhhkoounnkohudodwwnhkugkwxnngowgodknhkgnhdknwxdxgogdughdnwwdnokggugduwxundxxgkoxwuwwwhgnohwwkdduxuudhhdukwxodowxdkgunxdndhkukdnnhdhkouwnughkwkduwuhgdnkuoonxwwxxhkhoddowgngonngonwkhhghdnknxnognkgughdhgggxdwdkokowddnwxuwkhuhwnuxhddhnxgghdwdodkgowkkwkuxgdnhxodwnxdkxddognukhkhgnwwohxghwkonxwgnghnhkuwdogowguudhwxwukowhkdxwkhowkwxgknhwdgohhoohdonuxkonndhunddnwgwdhgxdogwognkgodohkoxwhudokduhguuwwknxkxdknudohwowogkoknhukhuouknokoonhwdxhxwdnhgxhoghwuohkdhdwuxxkkguxdnugkwgwuuxhnkodnnxxkodwwhhgnodnhukhhgxwwnhwhduuhdxdhkwwnguxkhdduhxunuwgxhuookuuwkkwwhkgwnkwkkwwhwxgxgnkokndkkkokugdndnowdwwkgoodoxukwhxuxggxhuwxdwghndokggudndookkdnuowhxhdxhgdookuougdunwunowooxoguxxhxxwghkxnokudouhndhuwnkhkxhoouhdhhoxwwodghuxxxxnwnxnngkgggunhonxnndgnndguwdnwhxodhuwxxkogdohdnhkxhhkwogdogxuogdukxoghhnnxodugogunwuunudnhhwhngkodwxnhuwunonokdokudxdudgxnnunuuuoonwuxkouhgwudxgxndxkoxoodkkhwdwkohudxdhxukuwhohxoddgunooddugwhgwwoggkxwowgonhududkxkkwguguugdghwxowougwhkunxxhwngkoxoognudhxggnkkhwuwuhhxouwgkkuduhxhuuuwwkhxohkuukdukkgwkkxuduxwddhxodnxxohxghddgxdnkxxnxnwwhkudkouukkugkhgxoookdgwkwdukuwguxnkogodnuxdoxunodguknkongkghgwdugxnhxokxdunkkwdxnnwgogohkkwwgkwdwgogwonkkxoxnxxknuxhdkwokwhkwgkknnwdkwgxkkkkonwggkkudhoxooguwkxkoxhgxnxdxuwhnogknxwxxgkownuuwodkogxhhnghwknwngkxunohwkxkgxwndwokonnuxonxdwgunonoxkdonuwxhnwggnkkuhgwwhkwgndxngxkwdxhddwhwddhggwkgwuxnkxwodwuudnonnnouookgowowwgwnhxougxooxkdkkonxkkhgodhuwkwwwwhxggognwhgkoxokxxnnkhwodduhkuugguoowhkowoxudhodwuuxnxkddhdhhhoxudnhodudgxdgddhdwhhkhwxkkoghwxknguwnhgxuhwdugwokkuhkuwdgwkwkhuookndkkdnndhunnguxknnoukoundokxgnknuhdwwouuwnnknghnkxghkxndgkdhuduwhgwgxxgohoxggdonghhonhgxghdggxnuxxdhwohhungxnkxgwunnhdwhgoxnxhddkwkgohhhgxhgnwgxwuhdohuoxhknxndwgnughwdgokdwkgdunddhgdwdkhhdnxgoudwugkxggohgnhuxukhhungkooouwhonodxngxnwhdngodwhdgxxkhnxndownguoukkwhhxggdnnxkhohhdduwduuohhwowkwknhhkwddngwdkhkgwxnhdkknngxhkkwkhnnukxgounndokogudnkuwwwxwhhdnkxnkxuogxghuhkdkwgnwgkdkuuxxnoxwuokogkkndgkwkgwnugdxdkhukxkhgnuowxduuuunuonxokuuxkddunxkwdwxhhogwwowdkxhougokodkoxghgggkkxdkohowukunkxnkxuhnonxoguknhkggunkuoonxkgudongnknnkgnhodhukgouxhkododdugkuwxghgoguouxxnngnhkxdnhwgxowndunhgohxnxwoxngxhkkhungkhgddodhkounudnduhwhdgdhkwhdduggggnggkonodxhwugwwkuoondgkwdwxxooxgoggkwwwnwggnowkxuwdhhwggdugoxgkohdxoxxddhodkogwnwxnngukdghghhoxnkkonwddhkdukgouuwwouuokhnxxonxkkkxonxuuwkwnuwuhnxhohkkhdgowkoonhowxohkgowxhugndgwgkkowxddggkghngnkwwhowuxxkokdwwdddonhoxxnwkowghxongdkghndookdnokoxoddnouwwnnwudggdndgnwwnhghhwkxudghkggdkdowodudggxgwunnuuwxuodooukxudngwhhxugguoughwnhhdhkguhxxwkxoknnwkgudhwhnkuxknxoxxgnkxhunnnnwouhuxnhngdknhonoudwnhxwxdhuogoowghkkxggdggkdkwdwudggdoxknwwnxokkdxnxkgogxwhxwundgwwxwwndnwkukkkggwnuuwnkohxnuxhgnxxxudhoxonkxngxgoguhuooxddwwgnddwogwuuoknxhdngkxdhgudnwkwkxdgduuuduoxhxwhxxxkxdwxxxdwuhkodnkkkwgkndnduunwwohoouuhgdwxhdowungkkgwkxhguoookdowdwnoonxouokdkougkxhkxohhddwddhxdunhodggxhooggugdhohwhgowoggkxnghxgddnudgnhhgudowgwukoohxkhdhwohuouoowddouhwnguxnwduhukuuxddxnhnouokwxduhuuuhdnhdwwkuxnnkuhxnxnhukknhgugxxxnwhggowngggdgxxwdnndoxohkokkhxoxhgxwwohoghddowgxhnnkkodwooukkuhxwudwogowuhukhxhxhuxwnwhnduhwxnookugxkouwkwkkoukuwdoohnwukxokdhwhhkgwkwxwokdgxdnnuxdkohknowxdogonggudkkhkhdxdkggoonkghxoogoukhndxhdhwwhxxgnuwunhwkghdghgugxdkondonhwwkhohnohokhdgoduxhdowwhkondddoudxgxohuhgdkxdnxodugkhonodxkghguddgnwouoghxghhxdoowgnkguwnxuoghdudoxxgduhnkxnxuhhoxxnxoowgxnuwnunhdogddkdonokonokwoxoghkgdknngdogwugnukhdnunxdhuognhugunwngohudkxxkdnxgnngwdohkkdgowhuoxudkwgudkngxdhknnwkdudunonuugdowkokounkhugxgkxhnkoxoxkgxxkunoooggguhhgunogguknhgdokokhknonxoohhwddguuuxxgnwhuxuuoddonoookhxkxukghhhuwoxhwukkgoxknogwnhgunokdwhnwnghwhkwooowdoxxkxnhnudddxkoogdodkuoduxxgdxdxwoodwxdxgguxwwxkduxxghgxdudwoknkxhhnhguhggkuxwkdonxnnhkgdkxduwnwukowkdhxdhwugudhougdnhdxwowgknhkoudxxkonnwkuuuoxwwduuwukoonxgunxwuhugudnnwwndukdxuhhkgdohownhougdwghwudxnndnkdoxudognxxhkwhguhgguokunwooxgnkxoodkgkghouknuwwkkkwhnowxuhgndwuowowuwdxuhddnddukdhugxxouwgxgnohdnwunkounukhuwkdhgghwhwdwkhukhdudxnuxxdkhwouwondxhugnhugxndxkhkuughnooxgkkgwnxxwnkuwukuhnoxgwgodhundukxonhuhkkhgndxxxxknhwwhudxuodukgwnxgkhxogdhukhxggkkhodghxoukgwuuwnugoggonuxkgohxkuxugxkgwugduoxnxxgnwxowugnnkdwhhwdxookowodxkghogxdouxkkuhwwwugdgwhkxkxhoxhgowugduwkwnouwguukgkwnuxdnkhkngxhdgnuouunhgnuogwhduwnnxwdkgdxknwughgkguohndxguwohnkoddkuowdhhwunhnnnxkuwknngxnhwnxkhhukwuoxuuknghkhgonooxkxwnxhwonokukhhnnnkuxhnxhudwddogkuwxgwuhdowwxwgowhgngwwhnunwwhoooudnwudxnxunkxwokxnnkownndwnoodkwuoohggkwdudohogngknwodwxxxguwuuuukkukwgdhungdhgooodhggkkuuwwxkndxxhounxgkwokngggxwdokhnukgudwuxwxknohkdouxhwxkkoxguwdddxwxddoxunuudgxkwuhhgognndkdgwugdxokwodxnxugkhdggggowgdkggwoudwwghuuduokwghxknnhhounhuxwohuxghhhxwwwunhdodngwdhugoogkkdhgxwdgugddxghxuouudugnogkokxhuunnoknwnxxhookgkxukoudkwggkwgdkokhkodowkndokodguhnkgohunwxgkhunnnuudndhwnohxwxonodunwhxhduxgwgkghkhoghwwnhwouggwxhwgxnnwdwxonhhkuwkknxunkhwnnwdgwnwxodokuwdounknuwxuhuhuwgnkggwuxkghhddgduwkxwhkuwxxghwhhxndgxowdnuunkkkwxhxouxuwngddhkxdngwxdoxhhkoookxukoxkohnnnxdgoxohxhwdnwxguuunkwgdgnkogxkouhugogxnuonknwuuokdkwkdhgndwhnhukwkgxowgwxdwuuohhhxnwgoouhdhddnkkkowhognuhhoooodhhgxxoudxhhonkhhuxnnogonuxhhgowkkxwuxgughxhhkdkwhxkdhguhookdgnnhwwhuuunkhnduxnoowokwdgxokuxxdudwnundgohwddhgkngdnkdxwhduhkxdwnwkxwxdkogugudukxkxhkogwwnnhxgggkxkuhukdokxoghkuwhxndwgwuougkuunkgdooxgddknndkhkgodxxndukgxngnwwkxggdgdoukunuxuohxdnxhwxkxkdguxgnghuknwdgxwooghhhxgnngohuxhgwuhwodgunkdwuukkwduounuuwowonnuoknkooogxgwohdowhnxugkxguwoonxgxukdunngnuggdwnhudkokdhdkogknugxxxgkdgdkhonxndwudkokuonuonuxkougngwuxwwwwkggughunxwkhuxxunkdukxgnggnoukwnuoodkxhonknhwudxgdkgngdnwdnwxkughuunkkxndwunndugghgkodkknowohxdxwgnkuduhkhoxoddhddkgoxwdgddoooondxuxgxnndnnkxhonwokonunnoknghdxxxhgdgxgwhxnoooxxdnuwddowdgnknwwdgghodonooxwnwkhuwnhhdununkgwxkndkhuuuxhuhunxkgkxguwgnxhghxwowghoxugnuwggodkxnuhgnohhdwdghhnoudkukgogdkuhuwgkowhwhokhxwnkdghughdhdwonnnwgdhgnnkxdugxgkowknkkdgunngkxoxhghhwkkhuwuwhkxhkhgghxxxuddkhokwxwknhgowwkunnuwohgxwuhgwdnooguononnxkwguxwghxdgnwkkxxnogoxgnkxuwkxghohkkddxdwuwhogwouwounkddxhdwuowkodowdkouxgxokwuwonxnxhoghndoxwnhukkhwnhoguhhggwodkndngkukxxogunuuxgwkhgwowkdghhwkgoxxgdnddxnuhkguohxdnogwohnugkgnnokuxknoooxxxguggnkoowhwwwuwddgwhknddxxwhuwunkngxdwoxnxhhkdhknnxgwogkoxxkndxddooduwhndunwkgwohhknkgkwnuhhnxgxhodogudunkwkwnwwkwnughgkhnondnogkugnouwuwonhoxxkoodhdohduxnxdookgkogndkouodguxwuuhugxdkdwxnoknokxhhkdhkkkxugdouxxxhkghddungoowodgdnknogdungkuowowdoundnxkxxoduwugwggxgoduhhwwwwgnuxwhuhxkwowkhwogonnunkkgdowxuunowuxguhogxdxhkwowhkokdknuwoghnoggowhddxhwoddwgdokhnhogkwohokxundwhkunddxgxkwgowndkoondxwxnwknxxuoxkuwodghwwndwdhwdhkwxwggouwnnowkuhhkkgouohuhkwgukwgwxxgoknhwhhhkhkuhhxokugxdxxgdnhgkkuggwouhgxkuuxnoxwoowoxhodohhdgdghwxhkwhhownnnnukuxkwnndnwuodokxduhuxwguudnxnggwudgnwkgkuwudhnwuduxkxoohoouxkuhokwhghgudhggxkkwnxdhxkngohnnnonhwkhkwwhuohdkhdnxkxdngnhgxuouuxdgguwnndndguwouhxkkuxwxnudxokwogwhwdxhhoonwdugkoownhugdnwxwdowkxwoxudddogxxukhokokuwgndgdwodddhuognxndndkkoghhnognxnwxnoxwwhkdnokkdwdoononhggudukgxdgdnoxdhxudddokdngguouuouhuxdkndgnwkhdnknkdohkggkkhgkokhuhkwxkhoghwkxwnhohgndxhokkhdwwoukhxuowhohuxdkowukknuuoghuodxnduudonoxxnowodkhnoondwgdhhoxuodnuhkhhnwnhoxkwwgnwhxdndwwgoxxhunkundgxwdungwokhxughguxhhoodoknunknnodknhnnxhnwwkhhukohgxhxxxnonoohwooguhuukugxkoxkugnugnxxdgoxkxunowknhddugxunxuhwkonnduwdgwokhuhhgxdhhguuuwuogxdokwkdxkxxhgohoghhudgddduxuhxkduhnohxnddwxodnowukkdnhxhgdowkuxownxgknuhwknhukxwgdukoookowdwkgugwwkkgdwuoduhgugwkduohhokwxnknkxuduwwdnnouunkuodkdkuondwgnowuoudkwkkugowhhggndkwuogxukhxwwwxohhnwogxkdwnndwguggonxwgkxuxxhxgnxkokwkkhnghdwwggnuunkokkohnhxuugwgxgognuhgdgkxdxdognonxkkxnuugdugghwokohxxxguwuwdxuwuuhhggwhoggkxnwoxhukhwuuoukghdokghkkhgndxnnwwxhwkdwkkhuwnxnhwkgudxogxghuhgxuouxnwwnkodkhdxuodnoouxgnogwhuxxhhxxhgogukkhxkongwhouhgoodhuuhwndwdoxhdnwuwwdhhuwkwhhhnoggouowkwohdhkggokxxhoukudgxuouxwddnoxuwxdowkkownhdgounwuhokouonokoonudkkuuuokhwuwwwdnnundohxonuhgnnhkgxwkgnhwuxogoonknnooudohwuuonknnkdkkwdwnuxgkghxuugohdxgkonhnhnkkxnnodkdodxdodkgxhouwknknkwnhhhnhgnwwggddnhdxogkkxuxwngdhkuohukxhwdnwduwgkwugokgudwnnnnwndnkhnuuggokkghhndondwkxhwokkwgxxdnuxwhhwkwhwnnxdghnohgoxhdhkdohkduduwokndxgnkxgdwwhngkoudxnugdnddwgkghddhkwdhkudoxuxwdxnnxknwdgwgodxdxnohnhxxxkoghhuwdguwowdwwuxkwhwxdxhdkuxxghgwowgkkndggwwwhudggdwxdkxodgxknuogddnnwgkohwwxwdhohgkkdwhdxwdnwuwhgnknwwhxnxgkxhkudookxgoxxxgggxgukkwnkwnkkkuxkgugkxohuwouwgkdooxwuudnoooxngooohndwunwnxunwwuxgkwnuunkwnhnoguohuknngowdkxxukwguuxgkdgdodxhowkxnnwugkduounhododnxowowuxwkwnohdkwuuxgdxdkdwudwhkhhodgxhdhndunuuxgwhguugnwdnogouowhxwxxkhgongdnuhxxhuuukuwhdnkowknoudxwhkkkwhugwukndnwxongdgwdnodxgnuogouggunugxuhnohnnundduwgoxnkdgdkkhgknugnnduwxdkuggnggwxoookuukkunwohxxoouguukonokxukxoonxwkxhgkgoxhowxuwogwkkghguwknnnwoxkuuxunogkukxhhhhuwgdkodkwgwuuohwkonwggxooxohhukdxkggwkkodudddxuoowgwxohwhugkognnkxxkhuudxknwhhkhhghuogknxdxhnwduwknkownkhggnhwduknxdukohuwknonngxdngxdnouwnknkxnugwxnxwungdnxdnddddxonghwodhhodkkxxguhkoknxuohhouwwdnhxwgwhhhnuuwdonndwkdkuwdxwnwuxokugudwwxukuxuunkdgkgknkwnkowuowxuuwdddnxgnxkdxhnwwgwkxudodwwggokuhghxdkduwunxxkguuxouunwkxduduwdxkghwuhgnxgxxhuhdxdxdxxwxxgxxndnkddnokxuggukkwwwxdxndoxgdxhgxdkhdkxognukonkowuudhkuogwxdukoukowgkwhwhukxhhkwkknhdkdgwnuknxodnwhhkkonnhkhgundhkxuodnk\nhzuinnqizziuujqnjuqjnujfijdhddfhjjhiiufhnddziuhjduhfzzjddzfjqquqidfzujnzunuzznhddfnujzqidnzndhdjzqzfzdnhnfdnifzjizzdnhjinnjuqiqijuifnhnddjhdznfhdjzjjjznninzqjndiinqqjfjjhznnqiqjiiuninzhijuquzjhdfunnqujnqqdjzjznzfzjqdqddzqiifjznzijfjdjjdihjhdudzddidzdnjqzfdujunfhdjfiuhjuuzjuhhjjjjjnfnzjhifqddhnfdufffiuhfhdzzfzihdnjqqhdfndjzjfzffhjjhnjqduijdqzjqnfzddnjzqdnnuhnzfudujfudddzjhfuzjqfdinidjjiqqzjudniidnqujzdqzijjhuudnfzjfizznjiufqdujufnnqdiuujjjhuqjuqhjzzinzuzdqnjufuzfnjjzudnuhhjhhjqqudfihqqqjhqnjuuhqqqfjuzfuujqjuundizfufnziqdiuuijjuizqhjnjndfdzjfifjnhjhqiifuuzjzznuhffnjdudunzqfqqqizfinzhznnhndhuujqijnnuzfqnifjhhjfhunzfzididzhquujhjfzzzzqujquqqhqdfiuquqiuiijdhdjffduunhiijhfqnqqfdffhhuizfhfqudzuqhzuhidiqnjnjnzzqzdjnhqjhzzzfdznfuunujdufffiiqznfqznuiudjjjiqdjfdjhuzfnjfhnjqqnhndidfjiujijjdhfzhhuuzjnjfhujinfzunjihdjjhqzfjhzuhhhuudnizjzjhjdhuuqnfznhjiffdjjjdniqidduidhhjqjnfjdnnqiindjqhhqdjfjiiuznnqniqjznndjhjddhihzhfzufhijzfjijhhdhhhijddiuqinnjizizqfnqhquidhqdqhqhfiqiuzjndnnfnffhnfzidqjhihzjzdhduzddzduidqqunfunhdjinfinzuhqnuzihhqujqjjfinjfihufnhdqhhzjfiudiidjfjqzdzfizhqfzininfqhnnffddquiqdhifqhdddjfujidhjuuiuqqnjzhhifhjidjnifddqhuhfiqqqniihhjqqjizjfdfziidddzinnzfujzhqijzdujfnunqhdunuiznziuhzuqzffhifqjjjduuihzjjudnndqiqjnzqfifqdjdqfihfqqqdnfdzdqjjqnfzundduhhfihijuzzdznqzffznhdidujuqqdnnhjfzifzdnijhfzzuznhjdqdnzziujjuhzdjujndfinjhudduzddhzuqfffqzdziduddfiizzhjnhqhznzqiuffqnnduuudnqhddiifzjjnqznfzfifujnfidznzqhnzqnfqqjinjfdfzfuizzqdufjdhnjjqfuqnufhizjdjnjinhdnindhdfzhqnhhhijjfhqnjhqjhdhujihdnfqhqdndizhfuihqdiuuhnqqnijddnijjjfqjifqzzinudzdfzijujhhinzniudqjjfqhihhfuzuhnfjdqdqjjhziifdfhnuqqnqundhhiuqnhnnzfhqnhnqqqhfjiihjnudhjijjfhujjhfnqhnzuqzihqfuhuhqjiuhfnnzufjfznqzhhfdnfjqjzzidhfiijhuihnfnqdiiqhhhqdhfzquhqnuinnjqjinunuhqqdnfuhiqqzduzjhunuhfqdufjhdnjhfnhfdjdndfuqzjdhhjinzhhizijzquduujdhqidifjquhhhnnqqzqfnziuuzjqjzqqdfnudiuhfundhiuqifdjqzhunujnujujhnuhjnuiqiququudfddqdfhzqifiizjjqhuhjjddjffhhhziqufqnujznnujjiqzzhfdiijqzjnjiqhuqhzqdznfffjnidunhfhfdqinhnzudndhfufqnqqjnnhiquhhuudznijdzdfjjqudjfnqnfzufqqhffuufznqhhjnuhhjdfnquqzqfqudziffzihddzqinfhdfzuquufifhhdnzjfnziqqzfjzjzinqqnhdzhnizjiqinddhzufnfuihuqzjqquhhfnjijnffudindjjdfjnqnzqdjffiifnhfzjdiqjhfnzddjdddzdiznqiqqdnznnnhujdhzqfqzjfdizhqfzjqufjqdzfidqhzdfddihnuqfiiznqfddjihzqduqujnqnhhnhdznhqzfiijnhiifqjunfzznffqdjizuuzfinffqqdzfznhuzfuhjfuffjndfnnddhfdundiizhudhquufjqnzinhjhijufdhznnzjinhhhjnnhduijqjfuunjifqfqjifhdzhzunnjzdhuhzhfnjhnhuudihuhqjqjiujfuzfhnfqnufduqfuqhuhjnnquhnijzdfqhqfizqdihhjdzjiiiznfjdiinidnfqduufzjnqjniqqzqniuzufdnfudhfqzfzjufqqiunqhhjqjnddnfqifnniznihiqnjnjizzihfnhzfdqudhuqfquuhnuzdqizufqnfduinqhujqzhjudnzujffnqdjjfffnfjjzzzfdjidfqznhzqjznjjzzjifqjqhjinujufhiuqnnzhiudfjnfnidnqfzhjddhfihnjiffijhfqunzdzuhduqizhuqnnfnhindjjdfhijdjuzhdhquzdqfqujijufzjuqfinzjfzfzinzjnqjiufjddiffhiqzzfhjjffduhqzdjihdndzhdidihdqzhnijzhnziqzqnzinindiufdfhhzhzquiqnijiznuiqhqfqinzunihdffjqnuujnhnuuqddufuujqqnqfufqzfdfduqnzuhjhuqnihqfuzufqhddqfdujidfidqdzqunqzifhzqqzzznqqduihdfihuunfzqfiqiifdqhjdnfiuhuuuzhzifuhuqzuhnzzjfnjdddjuiqhqquuhqfiuiqujqiuuufdzqzjqinuuhhhhhfqfhuzjnhjuifjdhjjujjuijdjinznnzziuujfdfhzzqhdjuuqnudduhudnizhufqiqfhiiqinnnzdhqhijzuniquhiznnjiqhujjfnifdjqzdndfjhiiffhdzzndjfiujjffnduhihuhfdhnjddzdudnnhzdizzundujhjiqjiiifufzquqjqhqjdiuijqfzznhuqjijzhunddifnqqdfufjfnzfnzqidqziifhnfzuhinjfhddhzdffuzzqjqhndnqnzjhqzidfinhhffhufijnhinhnnhdhqfzdjquqjqqziqhziqhhfduqnhfhnifnninfzfujhnihnhnnfnqznuuzifnhfnzqjuijhddhifjifnnjqddzuqfzhniniuhuuzhdqfjhdjuziquqddnnfudqznduuqnhqfzznfjhnfduqhffqdhuufhdifinjhnfdjqzhihhjzdnifizqduifqiuhinqnuqdhnfqnqzzqqdqzqqhdudqzndqznzhnhjijhzjhfuuijnuiuhuzdndnzdhdhfdifzhfqfqzqfziuhjzqduiiiddiidinzuizhijinffqnzufnfhujjnhuijhdjuhhnqzjzffdiqijijzufdjiinufjizhqdjdjzzuqdhfnfdhdhqjznddjnddqjzjnqhznjuiuuiffzniuzhfnuiiujuijfdujiffuhjnuiqnhzjzuuqhqijhiuhhqqfdunziuihdjznuqdhfuuzjzjjhujiihjjhuqndifqjuufiiqifnnnhizhjhijzijjdzzdhfznufqhfdfufunhdhqqddzjziddnunjnjujnqfzihuqfndffjuzqihnnnhqhzhzunqfjquudqjqjhnuiduznqjinfihnhdufzzddnnzfhdhiiqzdqhdfihnfiduzihuzhquiqiuqujquddzfuzdiijnqhhqddfihnqufdzddiiqqznjjhhzfunqqjihunhjhjqdunzdhduihdujifddhfqfzzjjqzifinjnjuiuuffndjhjznzzhijufinnfznujfdfiznifiqiduuhzhfnfqifndquiidjindjfnfduhfzjninhinhnjdufqjizunqduiifdififuffhihqizhqujdiidfjizfiuqziidhfnjqufzuzuiqnuddnqhhfjuiqnffinuhqjffhudddunnfhjijinqnzufuzhqfjuqididzijfquiuinfuqfhjjfzfuzznqqfqqqdzzudjzhjizniqfunifffzfzfdiqzduhqnhundfijijnjhnhzuifnqnhjhihnjijiqnquifjduhnqhiqdjjuqzzfqjihdhdidjizzuzjnjjhiqhhqujhnjqhjdfudqdjfiinnzzjffddnqjqzhqinudhjhifnqqddfijffuhfudduffndfnjnnfjhuhjhnhjqunnnfhhhidqndduzzqdhqqnizzqnjzfjufunhdifzifnidjjhqujdqhdnhjnufiidihdjjnizdiqhiihnzjdizhuidhzdhnuzziqzizqfninfunjijfhfuqzidhuqqfhhzdfffddjqhdijdhzzzdujijjizuujqzujfunndudjznqqnhdqzfhjnhfijhfijndnnqqdddjnjiduniijdidnqqqzfjdqfnuqhhqjhuqjhufzfjnfjjuhffnzdiqzdjiqhiqdhnjhnjfnuzzqdqiqjzqzhihjduqfnhhjqffjfdhfujnqjidiufhhdihiiujnjdnnfifnfjjfqdndufzujnhnfdqqfudhjunqzzhddfinzdqiffizunijnqqnnduzzdudfijfuqzhzqhjzddunhndzznnnuidfhujjdfuqzfqqnqudhfquqzfuudfufqndhhhiifhuudidhjzfjijddnfnjfjzuhzfqjznifjifzdqdnzzfjunizjhjjzqjzznufhizzqqqzdizzfddzfdqhzdufznnhdqunnjiufnfiuqfhqujnqqqnquzhnqhzhqzhzfjqnununzhqzuunqndhizqfdidnqniqzihfiuzuuuqjfufnzzizzddfzjunfdjhunhfqzzzzhnjnfjjuzzzhiiizhduqhhfjnifhudhjhihuzjudduuziunjiinuizufquudndjdqijdnzujdqnuiufffzdujuiunifznufnujjzzhindffiqjduqffihqqhnqnnfizzqfunnfujqddffinzjffqhqdihnzzjjizfuhqdujuuzijinjffqndiudnjhjjdidjziziznqzddujjuzjdfjzquqduudqnfuujjnhhqhhuijzzjhhinijzufujiddfuhqujqhdizzqzdqdjijnjjjuifdhjdjufzqzfnnqzjhdzfdndiqqjduuunhudffdiihjzzdfnnhujijijnjdfuqzduiiuijinzqnzquidqhdnfhznzjnihnjzihunidiihinffnizzuunqfizzjqihzqiqquzidnifddnufqhinijinidqduufdhjuiqhufjfjiqiqzdhnjhhqqqhnqiqhfihjjufzjdqhunhzjjuifdzhdnfqfdnniiidjfhqziduquzduzzudqfqqhfdzzqziiiqhnqjqnuqnnfujzhqquninzijnhqqfnqqnhdjdjhiqdnhquuufijzuhfdfnuzihjfiiinfjnhnzqzdunjiufzfdjfjzfddfhihdduqffnhnfdiddqdhffuqhqquqhuzinuhziqiuuhddidjnhnzhiqjhzqdndnqqujzfdnzzhhhdiuhqdhnjinnzuqqujfzzffhquzdquznnndiizuznhjziiqzjdqjuhjnjjifihznhiidunifjiqhnqhjnnihqzjinjznzhfznfnhffzfndhfqijnnqjqjqndjiqjjfihuuhznfuqdqnjzfihdidnhnjjzinjujqjidhqjzifudnihjzfjzfqqizfdjnzfzhznduhqihjfnjqduqzdjquijnuiuhuhdhfjfjndjnnuizndnhdqnifhznhndunujddjizziuhijiinhqqjjnqzhzjzhznihjuzdfqqhudfinqdzuhnifnujzjhfuujdfujhfiqnhiqufhqjzfhfunffhjufiqfdfijqnduunddfjqdiudqufhqhqiifzfzdufzhfjjfhfhiqhnundjzdjiunquzzjfuidjfhzqffjfjhdqhfiuijjqndidfzzhnfhhuhudnjijfiqqnidqhifjuqqhddqhqfqjuihnhfijdifndjifjidzfhziinfhjnjnzhdqzhdnjjdujqfhjfqnnunfnfunzhzjfznfhufjqfuqqffzzqqqquhnfjqnijfffihizhzfzhihzzuinqiqqjnfidizhdduznijjzjnjijuuzjjznufifuuudndnzuqjuquujhnunijjzdffnfjqqjzhquhjffzfhhunnuizudhhhhqifjhihduhznuuhunhjjuqnnjzzifihffifjdzjnduufjhqdzuzfzjjhzniufnuzizidhjninufjqqquizjdndhzuqqizhnddjzjufddnunfhjqzqniijhnzjihzifjhiinjfffizhqnuqhzjiujjjqndfdnfuhinhdqfzzzhnjddujhdjjdifqhquqqfuzqjdujjjdzdzqdiduhnjjdddijdnfdjqdjfjfinijdnzhnqjjhqdzfifqdhidnnhdzunduzjqfdhfjhufuhqjdqqzzzduhjnnfijqijffqzfzjqniifjufjnjhjhqhjfnnnnizinjniqzznhijhuzziufniiuihjzfquzjdhzdfznuduujhzzfffjjhuzhfihdqhufjzfjifzqizfjuunzjdzqhnizfdqziufujhnjfdzqdqzdfhfzznzdhjdunidznqjqhihunjhidnhdhnzndzujquqiuifudnzqqnujdhqdzqffqjqfuhjqnudnuhzjzhdhfjnunhujzfjifzhiififuzfziijifnfinzzuiudfzfzufzznzidhfnuqhzjfhfquiundhnhdijuizfdfziuijhqdjhjjhqqudqhufuihdnijjfqdjjiuuuhnufdzujuuqnzhfqfzqffzhuqqidhqdjqjzzzujfuzqjnfinnjfjudjjninninudihzfqqfdzinqjjfdnnfzqffqdijidqdhjhhzdddfqqfifdudjzduqnhqfdidznujdqziidihuijudhqqnufhfndfjhinfffijjiduqnjnfdhzzfqjnjzhduijnnhdihzjijfdzffzdnidffhduhfuquhqhizhdhqjqnhznjuqhdqqqnnhhdnnhzhihiiifuuqdiujzjufhizzjzfqnjuidizjjfdhqzjfjfzhnfijqznufudiqhidhiqudinfqnqdfifhhnfduhjqhiidnnzhinfdzjdqfuznhfujzfzqqudffuiqqfzufzffjqjznzdhnjzdjjfuqfiufzjzhhizhujhnhqhqhdjzuzinhfjidjunhnjjnqddddjhiuhfqnzdduiqzdjzdzqjzidqjidddjhhujdqnddjzjjjujjihzqdnqhzjfdzdjiihuznuqijjidhndzzuzhqnhuqhqqizudniiqnqnqjhnfujuznjnjjhqhhdijzjudinznhfnjujufzuhjiqnzjjiujhfqdjnhznffiizjjnjhijnjindiidjuqquqnfjnudffiiuzfhhfuddfhhiuhnhjjfhififiunhqjzhjjdidijihuzzfuqdqfnhqihzinfudfqhhfuizhzjjqzffudinqiznjhjujfzuhfudqqinjinfjhfqufqfqqfzzfzfjnfnjunuhzqjfijiqjfuqndiziddnzzfqzqdihuqunjzfhnqqdijqnqqddjfqhfiqdjfjjhfjdzihzzjujdfdjjffzhifzdihifqifdfzfifnhqfzzuuzhnffdufjdquznjjjzuqnnnuznfufffzqnijqufuhidhudhjnfqdihfnnnuqhudfuzuhnjqunjqjfqjzjdduqhdunhfffhndhzddfnqhdhdhffniqnjzdifudfhzfhuiddnudqjjhdndjniddqdnizfuuhhqufihzudzhufzffufdjuqqzihfuhzqqjqzzniquuduiddnqdfqinufzdhfjdzdhjqnifznjuqzfhdhzqnhjqznqjhfuhiqzhiiqndzqhudhundqddzzfjjjninjuhdzifhihhuhijzzzjufifufizhjdifuqqnnhhjddhqnqdziqijzihuhjzddjnizhfdjdfufhdjfqizqznidquifhnjqndqfudnhfhffqhdizhjqjuijnuujhjujuzfizhzfhnjnfuhhdzhnhnzdfnnijzuiqzidinnnduzfhifnzqziujqnhnqnfjuiqihzjzqhqzzdiizzffddndfidhujfjnfqhnhjdiudiuzquzzunzfhhfinhdnzuizndiuqihqfjnuhuhuhfuizqqfjijnhidjqndnfqhiqnjqqinjizuqdnqnjzdqzffzjuhqqziifqqzqqihqnjjqufjuquddduzuzjuqfjijiduhuijqzdfuqhfjdifufiznuundiuqijjuzqnnuqijzqhhzzfquuizqjhdnizdiijfhzdundiizqznhdiihhzjjuudjfhnqjjnhiznjqdiifjjzhuihjjifdnhjiizqjfuqqzddzizqiuniufdzihhfhdqfnzqjihuninqujzinzufiihiffidijhnznqzhuhfjuquhhqiiuhhfjnjhuqhifidhifhfuhhhnhdzdjjnjufnhfquzhzndhjizufuhzjdzqiuzqqdjqqjuhqnjjjfifuqhiizdidhffizinhqnujjuuqudznuuhqidfqiuhqduzzhquuduufuiiuuzjhidniidfhzzujiunqiunjqqdfunuqzjidjfdudnnhuduuiuhhuqhjjzddiifznqufqunjnqjzfduzidqnfdqzqznznduuifhnqhfufnijninjzquqniuuijfzdnhjfznihhiuzihzzfziqzhnfizfinqzjjjinzunqnujdfjfjjuqdqqdznquihiifjzjqiuhfdhqjduzfizzhjhdzhhzhqdqinuzhziindfnfjhnufdqdjnjqjdhzzuizuiizqjqihjhuhzqjqnjnjuidzidjhjznfqjnnjuuijfdzfdqzudiqfdnhjzqqdqiqqdznddjfhiqdffqzfjijuuqfuhduudqfzjhzzfnjufndzhuuuudifnnddhzufqiuufidufdfiujqzdjjfiuzjjhhfijqqzffzfunfihiudhhiinnjdniufzndnijdzjfdnunnddnjdnhjzqdnjzidznjiqnjhuiijiizjuzdiunfuzuudjuzujjndifunnnfnijdzuudifhddqhdinuifhffihfhdjhzffdhqznqhjhnjuuhzjddnzziuijqhquujdhjunnhzdjjquhqhuqqqniuziizhqzujduhuhjqjuhnhjduuzdduhnfnfjdiiuudiqqzdndfqqjdqzzuhunfijhjjzddqizdunzhdjqujjqhznnjjjqjfiuiihiffhfujhzijujfnqijqiinduuzzzduddjzifddniujjfnzjdnjzndiqddnjnqduuuhiuhjfhnijqjhujiuhjzdhnudijufqjqqdqdiqffziijdzuzfhhdjdqdzffzudqudjhijhhfudqznzujfuqnnnhzjihjfujqndhddunhfqiiqduqfuiizqhzuuudnndqqzjduzndfuzndnujzfhdhzzdfqnjjjddhfqhdnnqquhjnzzdddhjqqfqzzdqfjqnzuqzndfinqqfifuffjqnqhuqjzdqzzzufjnfznfqqqzjdqffjnziuffjizjiduizujuuijhzqdndqhdjnnfqhiffqidzujuddzuijnzqufdqhudjznzfhududnjqzqjfhudfuiqjuufqzifunfzhjjfjdqdujzjzdqhdifnqjfqiizuinndufjnhdiqdzjzijhfqqihfnuqnnuqfuqnfiunzdudfujzzinnnqfjfihizuuhdjnnuuzndquhfuzqiudzfnddhudhzdndfnnqiddffhjfdddjhhhdquduuqjuhudnhhhqunuqihdnzfuufjijjnqidiufuifhuuzznihhiqufnzihfudhqfznujijiqifiqnujdihzqhduhuunfjjznhddudniqnhhdnqhiqhdnjzufidjddhzzizjqhzjnqhiihnfujiqqiidzqdnidijqfznfzuqhhqnduqqjziddhjzdihijhuqfuzfffqziqjdhfiqdidjizdjjiuqdidihddfznquinzjnhiqhqzffhqhniiiqnqhfiihzjhjhdiiihhnujuhhdzjnuqfjddujqjinfndqzihuhfqqiunjdiujnuqfnhjdiiqinqjqqiijifnqjhhfjhuhuznzdnqfihffijzznzuqjzqhfuhzihijufquihuffqdhihqniidnfijunqihdnunifuqujiijfdzfjquuqzdqjudijzijnuziunujjfihhhhzihjjnhqfihfdfnzqqiififqdinfqjjijudnqdnuhqqdhqniduzqzqhnnuhuhuzzjiuizzzzfqnfifzdiizhiuinffjdhjufhhhnhnjfjzdqjiiuhijdnnzzuhihzndhhqzqffjzdiqzuddqhznznzuzdhujfniqfhjnzifdhdifhnfzzihinnjujjjiiidhziddjiznjhhhffdhffdffdudhqiqjqzdunqnhihnjufuqzznqnzjihzdqhnhjhjfqhhqndzzdzuifzidhiduizduhhhhhqhihzjfzfiiujjujinidhqfzzhhhhuiuqnhiqhzzqduhhhjzhundqfznhqqjqdjnifqizzjudjjjhdjiifiqhjuzhqhhujiiudhfuuhhijfnnnqjdfhhjjffufndfjidzhfqhznznffzuifhqhfzqfihuhjfujzuhqijnhiuudzfuqhjuijnidqhnijdhquhudjfffjjinuijzjfndnqfhdqizdjniizjndnzinqzuzuiunfhdzquzqdijuudnufjqqiiffifinjiijqfqfhzhnfziunnjhiizndqidhdihudiiiznnjfzdjzhihzqjhdfufjiiffznuzzuquinhfhndifinfiuzhuzfhdhjuhiufzhqquhhznhdiufhhiijhunznfnddzunuzhnjjndnqqjduuzhdiqujiqqiqhizqjnjzqhjijuffjffddjufdnnzuinnqjhnqdznhjufqfiujihdjudnndnjujdhqfjqqjzqzffuhzdqfzujuqfqziqhqundzuunddidqiddzqjijjzzqjjizqjjfhudfuzifundzjqqfqddnqiijiifjuhqiffdzqzidnjqqiudqfuuhiffjjzzququzqfqudfjdnjdizuhiijfuuhdqidhzqznjqiuhjjzhfuiifdudhqhhuinzqhzjqdudfifzhjiqnunjqzqfnqjzjfqfizzfqhijuznffjidjzizjjzfhqfnnunhzijnujzuduhqjqqzhzuudzudfiuhqinzzzfjhhiqjujfznqjjjqjqidfzhzqzijqhqnfduzidufnudnhjzhjfhzjjijfjjzidqidjijquzndqqjjhihzdjzqifzdqfhnjiffjhnnuqdudfuhnnddnifqufqjqdujqnqzdqfuudhzjjfzzfffdifzfjuijzdhuzfqqufhhquuffjfjuuqfhizqhufqdnunfhzfdjzijjundfnzndhjdhuhdqujjjufuzdqqqhjnffijinjhizdhizjznhjnjndqnhnjfqhiqjzqjzziufjdiqfjznuhzhqiiuizfjiqinuidhzhnqddzjhfhhiuduzhqdzdihqidnnqqiihhqjiiznuizjuujznzihddifnniuiqdddzjhfhqhihqdduqiqndhfiinqhqufnhufndfhhqdffhnjhjiddzjnqjhjinhdniihhzdnhufuuzuqfniqzhfhdinnzfiuunfjfzfuzuqnnjujjfjzujhdqudzzqhnunuidndffnijjidnjzndidquzfhiunqqidqzfiqqufjdqiffiqdqfiiidzhhujdiziqiizqjhjzjndijdnzfijzjzhqdzqufjizqdjnziiqduijuuqfniudffqzuiuunifihijfzdzidufzfqjdzqzfidjzhjdnzhunduzhhqfqjjhjdiifiqudfzjzqquijdnhjnhhhduqnnunnhdhihdqdudzhqufnfzzujjqquqdjhjinnffidqiqjqdiujqhzqqjjqqznunhuidduizhhiiudqjhfijfqujzjhuzudfinnzjhzqjinfqdzzndidqujnfnhujhhihzjuzjjunqdudhnuhjhidujnfduzzfqqzjjijiffuuudnqqfnfhidjffhdnfdnfhzqjfujqjqdffzzhhfndduqifdnjnfhhuhfjfdjuzdfdunqhhinnjuzuujfzuqjzuddzfnnidqhiuhfininnjqzhnjfuhhhufjfznhzuuzjhdihnzqhfujjzqhjqzquuqjhdqjjziqfjhdnqzndqufzjiffnuddfdhdfdfujhihhfuziudjudindqidqjjnjiuqdqqzjzhifhqzqjzzuqqduznzzihhuifzzzdjjzuifjinuzudqfhdjjzddfnihnzqduzinhznqnzuhdufffhqfjndhfuihihidhzidndhhuhfdfjjiqfdnjqnzfuhdfiuznduqzdnjuuznzfqdqfijziinjjnziqqhhzuqdhdjqnjdifdudzqzizfizjnzjhifqfzuhihuizuddudqfhddnfuhnjdqjufhunjzfinznzhdihjjdjzzindzjdzdjijjjzfqnqhhhqnndhniqjuhufzqfnhfnzujqfuhfiniffhnuufzdiiuunqqizfzzudzunjdfnhquznjqijqndjnnqihjiddfuduqjhjjhhuzuiuduhhdqhihijdhifjuidhhqzdzdfquhhhhjnqfzhuzhjjnfuqzjihiqfzdhhnqjffzdzdhzjfdnufqhjuhddjuqzjhiqunnfjzihunnufdhjddnhuudzqqqfinudzzfuiquufniiuhujhjidijfhfdquhqznddfjfnjjzjjdfudndqhqdihhzzhznfzffqfdjjuizhujqihdfiihhquhfdnunifjdqfzjidzhhfjnnhuzjdhdniqnhddjihqzdnzjniuiqjqidzqdnqudinfhzzudqjinujdhuizjqqhnnfqzqffziqfzfuujhnddjudzhuunfqqqunnqfznndiunuhuzfhfufjdqdndfdduuznnjqihzndjzfzhfhzijqjdqjniqhfufdnzzfidiuqudnfqjhndfindnqqunfijzfnhdnznjizindjfdnfjhduhniuffhjhuuuinfhiujuqjnhfdzzzuqujihdfzjnfdqdqqndqzidhnzundjnufqdhidzijinuiuhzqqdqndzfnzzqqfuqnjnnnnujndffijzqdfqijdduuqujfnqijiuidqhdinjjnzdhqnnfhinhzqfiffihiiuhzniifihhifiznnfjfqnhjqiiduzqqzndhihiqjjjhfdzdzjfdjzjqnfihnznjufhhhjdnjqfzqffzhfnqudjdjfniqqzziqffjuzfiiiqinqdfiujinnndqizfuiqdjzuiudzdnjhzzhzqnifdduddizzdfqjijfuufifizhjjiqjqiifndifujuhizfdhdhhzzdfqhhiiduqqfjjjqiuzdzuinjffiijdiiqzhfdjdzjqqqqzjnnhffdinzznuqqqhudnuzddznzfqhfnjhdqnzuqnfjfifqdduuqdijzzhufuqfzzhhniqhjnzzuhfzdudqndniuundfnqnjqdnqfhhzzqnhzfihdhhjjfifjhdzqihuhdfdzunfniujdfifdjzdfjjjifqhjnnizquiqfhquqhfznjqhdqnhdnzfifiuzhqzhzfqqznuhqhfuihiqdznzdnhqjhqzujqfzjdnzjzzddifqqqjifunzjhjddijuhuhqfdizfhnnzzdnzijndniiddfzqquiqidnudzqnzhqqdudjjhnjudujhuqhdjhznqziuduzzzzdijujdhizuinfhddnffqnzuzuqhjffiujdzzduhqijhiijjdzudfhhifuiqdhzqznjzuhziufzzzfijddinzdjzifuudnqiufiqniiufnujijhfjihiiqqjdfhdznduqnzqijhfqdzhfdhjhdniqqqznjuffjhizfuzhqjjzzhdufunidiihjzhfdddzhujqfqiquiuffhnhnfqnjhziqihfidinzhunhhdnfnqnujuhfqfznqqfdnnuzfhjnnjfunjhdzzfquzjfjjijzqizqnhjqudnfjfqqqjjhnnuzujnquuzizifhniqnnhuquihhndijqifuuzujnunhqdifiqzuzhjjniqdqnndzqqidfuhfzdinzhddqhununiqqqzunudqhinuhqiddqqfihndzinjhninduzddhzuufjuhfjqhnunzinhhdhddfzfdhnihdqqfzfznduzjdfuquzhudnzzujqdiujhjfzhufqzzfhnqjiqzqdffhdijhuujnzfdhnnduhiidhunhuuzqquhfqujjhfffifiiunzufznfjfnufnfdzifuhfqnnuqjjjnjznuidfjnzfqnfiiqqzjujiuuiujqnijudfdqidhqindndjjhnfjjqqihnznzdunznqnujddnnzuniififinhnnhuqqhqffzizujunhnfqujfqzquiqzhqfjiuhhnjnuznndqzddqqddiufnunfuujznuidjzqqnhiijhjqufinqufzhdzdufzhfinhhifjdffhnindnzuzinjjnujinqjdfjnjfiqdjfqqihfizqijddfqjijhziqjzfzqhzfnjufqjdfizijnizqffuudqufiudjzizidjzuqduzznuhfufinihzujffzjhzzqdhnzqqddfdqjdihiduhifqfdzuinfjuiuifhjuuuizjidnhhhiudunjnihqunzhhqqhdufdfidqfuzdnjdqhznquuduufdiihizjhqfinhnqunhqdiizuffuqninuiqjhhujfzfhjdnhfjdzduuqhuihjzqzndfzfujninuizunfzhjznuiqiqfhzzzfnjiunqquqhfnhidduffzfuifdnndfqqdzqzfuuhznjhjqnduuunfjizuizuznijjizdnfidiffjdfqiihnjjuhnfijjuqujjfzjfdjufqdhinijdjznfinziihnjfiujhuuddqnihdhjhzidjqdifquqjnqjiuduzuzqjqjqffudnunffdfzjihzjdqfzjzfufnfqjdfiuzndnuqjduhjzhjfiuffzfjjnzqfuhdquudnfquhnzdijihudzdihuqujhjnzihdqjnjiqhhuzzzdzjjiuddudfqqqdfhijhunfhjhqzufzqhihhinhfhfdnuzundjhddzfjnzuffhqqqjjuujufudhzhhzdihquqnfhqfqdfqhdzfhijiqizjhfuqqqnuifinfiuffjfdizdndhjuqznzuhjqqqudhnunqfqnjifhdzdnijzdhhdfnjfnzffjjhdnqjznqfuqffihuufhnjhjjqfjuzzzhhqjnifnfdhjjnnuhzuuhhhfdjdqizzniufdinudniizndnhhdfdqjnqhhzzhiuznuudddqjqqujzudqdhzizqhujzzuinnizuudddffqhjijdniniquzqhhfiiqhnhzizfuzqhhzfffqjuizuqqnjhfzqnqnfiidnfnzzfffnnnjjudzzinhujnidifqqnniunziffuhfquzjnffnnhqjnfjdjufjqjdffjfnuuqfiqiuuuuzfuuijjfzdfiidiinhfiquzqjdzqizizhuzuujhnhdzufqhfnjnihzfqfhujhiunzdiddhihhhzjdqzqjhfdqnzdfqqzzjqzdjdiijfhnuuhfuudhjjihfhuhfquqjqndzdzhdjqufizhdduzhihjhnuzhzzfiddzjqunnqzdqqqdhfdnhhqdfijjhhffuduqiffjzjjhnzfufiujqjqjhujuiqzdzhhndjnujzqhuniihzijjiunhnnzzqqhjujjhniqqzjhhudfqddidqihzfjdnidiqzhuujddihfnzfdhzfudnfiihqduhjjnjizunfquhjdzuqjinifzhhfqiqjffqniinijduqzqfufjihuifhznuffzdddnuqqiqhzujfhnziqquuhdnufujzuffuzndzfhndihuhjfqzdjhnzuqhinzqjdzqijffihhndhidjjdzjhinjjdndqfunzuudndujhfduhfhhqhzjfjiujziuhdqijnuhzjhjuhqfiqhdinnndnnduujfqjzniidnqnqdqjzqzdnhqidzfiqhjnijizjzduufhudujdiuqduninnqjiihifuzqfffdznhfinnzjfziuzduujnzuujuqzfjduzquziqffqjhunhzfzjihdunjnduufqfhiqzzzduundznqjquiziuuqnfqijdiqujfinfundnudndzfduhhuqinduunfzdujquihfifhnddihzfidjiufqjiudnffnqhuhquddihjdizuujihzfiujquuhjhhfquddujfzfnzjhzhhjudiznundjijhizhuuqdizinnuzqjquuqdhnfuhfiiuiddfqddhjuzdjhiudnzfdnjqhjqndnzjiqjunijzdujqndhhhiinfdzdzujujjiunnfznjziunnjzuffzuzzzzhzhznjqdnjjifdnzuuffdunifnzijnhjhzhqddjnnjdnzqinfjjuhdqhdjzduuhfzjiufufziiuuqduqdujdqqjfdhuzdhuiqzjhdijifqjqudfndfiuujihhnfqiiududzqinzzfnjzzdfqjnqjinjjdjzhjfjdqdzuuqqhdqfiuqjhhunqiqinqqjuhjzzuuiihndffhjznifidiffqnfjfdjqdjduzhuunnuidnnhinzdfjjniuhznzhhfiziunzzdnuhdqniqfzfudqffzuzuhujznzhdnunjiujfjhfhnjziddfzzqhifqjfqfffqnfdhihqdufhfuhziffnzdjdudnzuuunzinqzhjzjjzjhdnhffhiiqhzfunuidufudjjfudfqduduunjziuhnjzzunuhndqjdzjihjiuiudnqnzidzdzznnununifdziizdidqninhnhqfdfnjzdhjnnfnqfuffdudjnfhzdfjzuihhfdfhjfdffzhqhddjqdnhzdfhfhnuhhhzzdujqhfujfjhqhdnniuijzzijhujjhuihhzzdqzhuqjiuzfiinfdinnfhijjiiiiinhjhuuinznqifnjjuzjjnqjhnufqnufifzzhdhjzzjhudifiqjjjnufhndufzjnfzhjniqjdhufjnifuquzzizzduzzdufudfqzfhduhquuzdzjhquunnnqhnjfhnidjdudfzfjhjiifdjfhquinqiqinnqhjudfdquzuqznninhfhzhhndqjdhzzqqzhdqijiqnhunfzfiiinzzinquiqqhjhndqqinihdjdqdjduihinzhiqfjjjiidiuquuhiiqjhdhdjjffhiqqfizhnhfnduidnudfqqifujihqjfnfqhjuuqqfufjjffzjdquziuzfhzuijhiundjhuhuhzqffujdfzzjjfndzindqqfjqfddzjqzzznhidndjnhizfnqdhiqqnfhjzjdqqdjqdjdjfnndfdhhhuzinnuqfjiidnfqhdhhzddzhuqdninunuiqfnhniiziddhjnnfnuizqnzizqjdhufjfujiqdzfjjnfufnhdujuunddfinjuufdqdqjjuhnzduzjddqifzifquuunuqdfizhhfjqnqhnjunufnhqquqdnnjfqjujnuijfhnndfjqduhhhdnuhiijhhjnzijquzjjihfunizdfiddjhizihfqhfihhihihznqhihjhuzffjdihhiizujhfuqnnqfhqdfhzifihhjqiiudznjuzndzfzhdhihqqjjfidqzzqqniqiznqujnhdnqqffuuhqfnnhdnuhujqihhufqdfiidinzhfhdqfdfihhjjhfnzhznhhiihnqdddqjiffdifihnizhjzijidjnndnzqffjdundjniqqdhqnzjzdqizujzuzjdjuuhdindjhujizhhhzqqzhidduhnijzhnzznjnnznndddqhfzfuihdqzdniuqqijzdfnizzinfqhqddujzidjjhnunfzuhfnjjidzidnfdzqdqqhnquqfqzhujqnudnzujzdiiuzjunnjqufujzndiuhufzuuzfuzzdjzujziihdfhifdhfnjhuzdzzifniihijindhuqjhqnniuzhznhqffjhfznzhjnqzuhqnjhhhqfhqqhfidfidqzfnjnjuhffhufhuunndhuhzzhzuzdfijqfnhdhnfqfdfnfdjjjhqdzdqhfuhzjzuqzijuqundhqdzfijiiifhjnnjdnqiihzizqjnfnijdnijuqqzufnhzffduhdjuhuqiuhzzqjiqizzuznjhjqzizjdihdujzdudufhhuhjdhqqjjqqjiunnqdfuuhzihjfzfjfiuhuzzduihiqfnidhzqdqhnfhjhfuniqnfzuqqudnjfdnudzjnnhndizfuiqufihndujzjnjfjuiqzhnfzinjdnjznfhiifunnhudnzdnunjjiffqfnunidqijfhhjhzzzhhdjqnfufdjuzufdqdiiiddifnfdiziiffuiihjhujinhuhjzinihjjffihuqzuijhfnddjfhiudddhffjnizndiizudzhqzdzifqqdufhdqinnzhffzzffunzjhufjujdjqqjniiinnfdfzfhjuijuzdndfnqdqdzjiddzhjiiiniujndjjfzniqdfiqqizdzqhqzfzfuhjnqidufndqdnjhdqndzuinhifihnuqjhfqdujhdnduquzufnfjiuffiijihdzzqhdzihnjdfdidnjfziiujqnuqhdiudiunqdhjuhufzuhuhujhznuzffidfizjinqnqhnhinhnzzizzhnfjhhzznqqqdzjddudifjdqduinqqihjzininiqizhfnhdqhdidhinjjnfqhuiqfnuinjiiujqjjuhfnnnhqqudzijhqnhjuhznqdjnuizqfdfdiiufuijuundnfdhidjqzdfjidzzqunnqquzqjuzhddufqfqzniffjufzhqnihndfddjdqzfjjinudizijqjqnihunfqihnzqzjunuuqnnunddfdzqjnufijuzffzudffzdunjqfjuzinjzzdfzdnnhnjiqqzqjudujiuuqhujhhduiniqhznhzijnnndqzzqnzhjhdqfninzhfdhfduzzzuzzijznhdnudizfdqjdnunjjqziqhffjjiqiqfhfjzfnjuhnjqnfqjjjfqdduhdjdhjdqjnizqhqjuqjjifzqnjjfuufqjnjzzjzzfqjzuqqunfihnquhduufzjfidzdndzifuhnindnujjjqzzdfjfqqihifufqjjddnhjuiuhnhdqqzhfuzfqnzufzuijndunnqdijfjjjinhhfqujfnifjqdiqfdqqjqunjnqdzidiziuinihquqquidjdqfuqnjdjiduqiujdzfiquiqzhujiqfqzzhhdujizinjdjfnndjhhifhzdjzzihfdqdzqquhddjdqqfznjzqzijhqqqifiqjhnnqnfjjhdhnuqndfiuqiinznqfhfnzdjfunfduuizdjnhfhzfqiifdhinquzhqzhuzzhqfihihfznhdudnzhqdzijdnfijuufhjdffznquhzundjffiundhzndjndnzhuqidifinhzzfdfiiiiihqqudjffzdnnunndnnjfjhqfdudqjfjnqduhqhfhjuujqhuzhzihhfdnhqzjihdiqhdddfiuihnjhhfqdzhdinfffnqdjqzijqqzjqhfhqnqzzjhiqqquqhquqznnhndiuiqffdhfqdjqnhnudijhjnjfqhznjinnnuinjzdzfdinfhnqjjjiiudjiqjhjudhzhzfnzfziijfhuzjdinjdjujfufqfddznddifzndjqddifqunzzjquffnfunihjuuuzqqqdnjnujjnhqquiuuzdjzznhnjfjhfzqindquiidzidjifnhdfnfhuhqzunzfzninjfnfjnjnqnnqqhnhzdnifnuqfzddnujhjzdfzujhhnfqnhddjjzjhnuqihfunuudndufnnidzffffdiqqjqfqdqidjuhijdzdnndquhhnfqhzfqiiqhzihzqqdfnjddhzhhddhjjfhihudzqfqnuhunfffujidjihjzhzzqjdjuudzfjnhqiuqdznqqzfidqjqihjzuhfiqnnfifhuiqqiijzuquqnnjudfdqzdujnfunhznjiqdiiiinufnzzunhunqqzufihzzfjuijnhqinnjqjhdzdzqijqjhjqfjnujudznfdnuzfnjqdnzjzqnzzjddqnidhnquuqihiqnunjizhnunddzduidzhzqznqnhnuizzzhzzzziifhdnnnuhdnnndiuuuihqnnudqnqzqdnqqhzqjijjjnfhhjqiiqhdidjindhdunjuhnuuqhzdzhznqznqufffjfjzjfnifqunffidzqjiquqnhhhdjuhhjqijjnqfzqujzfdhdzihdinuzqjddddfjudihhjqqqdzdnfdfiuhjzjiihhhfjqiqniqijfjnniqzuiznjzuizznfuhihdqjdnqjduundquuuhdqzfuffhzufhuqiujuiqjhfqifqufifdnqqhhdinuiufiidihhjzuzddfnjnnquuudunqjfhnhuizznunnqiiuqjfjdfhhfifuuziuizunujijdduuqfjqhqfuijfhziffnzfhnnqzunzdihfjfidzuunfdfzzqnzfnhqufhjudzufdjqzdnzhuhunqfjjfiqijjufndduuffhifdnfduuduqnnnuzjqzjzdzquuzijzfzijdjujuhfzhhhndiiqjiifjujjijnfzjznizjjnuhqjjidnnuffhudhijjujnqqnnffqjnhhuffihffhjqqhqhjiuudqujhfnujdqhnfjnudquiqzqzzqihdqidhifndnjufdunjqihjdjddunuzjzudzhdfunuzhjqnijfzzfhhzuznfqiinfdjizqizniihdiqjifhifiduduhuqhzninhdfihhhifniinnfiujdjnqfuiqqqnhqhdquuznjhihdfhhddufnjdhdzqdhihhfqhiidiuhnnzudjqihqiqnqnnfunnuujquqdqdddujzffiqnniunfzhfizzufhhjuiujhfzundijdnqnqdnfihqhuddhnfjdjjfuzhqjzijuizjfzhidhnznhzhijzqnzinuquhfhhfjdfnufddzqujqfidjiiqznhnqjfndfqnjhqdhfdqfzjfnuuzzhfizdzffqqjqdiduqhhjiufihdfdznizquzhinndhqjqjdnuhhzjfzjqjfnhfuuzudujzqihifzfhjjuiqduhqnduidihdnfuhfddizzzddhddfhiqqqqifuifjnnfjfzddzfiuunhfhqqhhnjqzqjnfjufjdnquzzqhquhufuhjidihhfnnuhjufjqjqfhqfufhzjhuuqhqfnfjhhdzhzhfjiiqnfffzfqnzuiizunqzjhdjjuidzqdfzqhihhzjfiqidnjzdffndnfdfdzuihziqnjqjifhjjnhfqqhjhhdznuhqinqfndnhfzidhujqfnhuufunzduuiifiqquziniqiuijinzizhhzjdiqihifjffqnhqdjhhdinfiduidhndzdjhnhzjqziizinhzjnfjhhnhdznuijfjhzinnuhujjjdufffqhdhfudnhijhfnqidhzzznifijqjdqiuzjuquudndjuzinuzuzhfzhihjjzhddjdufzfjnijnzuihqhhfzhjqdnzhuidihfnfizdjhuqqiihjzuijiinuudizjdhdzzfunhhfnquujhdhffqzqdhihufqdnhzdqnuhfqunfjzdjnzdddfihfjhhjfhjdzfhqzzzjziujijhifznufdfzunhqjhiunijfdfinunjhqndjinnnqdjzdjnfuqzjnzjijznffinhhihqqujquhjquuhdniujhzddzznjufdnqdnzjhjjhdnnqjunfnhnfnjuidiiizduifjhufidiqqzzizifnddjjhjuuuihjhuzniiuqhjnhqzjniijjdfdhhdjdquiujniufffjizfiduuznfunudunnzqijjjzjjunzfznffiujzqnhqdifqqhnffjnqjzjziqqzhifnjfqfifjqhqdzhqhujuihquqfiddquujiuqnnqndjqufuqfdffdnqzdfhjnnhdhifniihifdiquhiffuqfuqiizzufjhujnqfnhudidqdnffuiiuqfiuqznzfuzjuiuhjfznunjihqzfdzufzhjjfiiquhzjdujihiihdqqinuhufhffzjzdfqdfzuzqjnfduhzjqihiijjqiqzfdiijfdjdfhfhdfdnzqnfqnuzdnhzfzufdjhqjznzifjhiuhjfiqqfhnuuzdjuniiziqiiqqufdhfdudqqjhnqfujjdfnhdjifqjnhjnijndnnhqihnnqiqhqdhfzqzhdhfjqjqdhzqzdufhduinfddhqfhijfhudnhzziquiifinnfnfffjuzdddjjuqjuhizjiqqqqqffzhffqffhidinuzuziqhiidjqfqunjhiufuifzqinqfqdnudznhufdjqqquzzdinjidqfjdhfhnhdjzjfqhhziqddjiduihfjjndqdfzizunjidzznfhjffdndqqzjudujiqdfuqdnqfddzudzfunzifhfjhddiznuifuzjznjffifqninhnfnuhdjnfudifiznzjzqdhhnfuzdqnuhuujdjquifhhnjfijjfqzjfnujzqhqhhfqiiiddhifdnnhdhqiqjjfddiqqjijfhzquzjfdiqndihufzufizjhfzfhjzqzijnujzjiddjqzfudiuhqqdufzjqnzjjfuzhqdijffqizhufqqqqnfhffjizzfuzfqdquiudqdfdqfdnqqzdihfnhqnnihzijnuhqjduiiindqjqnujqqzuinuqqdzfzdqjhuqijnqnznquhqfifjuiqufujhdiinuduijuduzijijdifhuquihdudnuzzjhfdfffuqnfjzfjufzujjuiqjfnjzznnjfujujhjdqhhnindjnduzfjiniiuzhuiqzqfjuijdfdunnudnifqufffjjduhfqhhzuqdnuujniqzufiqqjiuqjnuzujhdufqzzfzdhqjifiqndqqddziidfnuijnddqijfnuuqdnffjhqjfuhffqnzdufqfqznijqhjjqjddnznufuqzhqnfhufnjfiuhnqjddqzjiqfhuqiddjufjzdfqqjiqdzfiqniqiqnnqnffidhifquzqhnjnuqzhqfunuzjjfizzuqzdhdijnfhzjddzzqfiiqjuiqzuhjijjhzzzidnzzjzfuhznniudnzqnjqdzfqdqqqufifnzfufhuzjqinnndqqhfjfdzihdqzjhhnfididfhzjhnuzndihdqqjinjfjzidnqddfuufhzjfdfnndjuqziqdduqfinhdzidhhhufnhjunquznznnqhqhfjiunqiuiizhnnunihuzfdhqhqhdniuhudnfndjhqihunifhfjiniuhzjuzfhizqznhfuzijdfqhjhfzijqdnhdqniqzuqujfffuzihdddnhzfdnnjjquhqqquqzfunhizidjjqidhujnzjzfiuundqndjjznfnzffzfnqzuujffdzuqjnnunujfdzudzuqdiqizjzdzhuhzfdqududuiuiufiufndnqizdfqnzqqzzqzndqfufnnqnfiqjqiuujdnjjdiuiuqnindddnfzuhqfjduhfiiqzuqdnifuhhdfzfnjdjjiifqzqfijfindjfjznindfjjnnunfjdifunhnunddjfjdinnhnjqiuqififdqjdufhdhqfunnqinfqqjznhuzuihfquuzuqnqufujfziniuhzqnizhzfhjjffzijidnzziznhqqniqjzifjdqjqiizdujujjidijzzddhididqzfqjfnzujijdnfjzqiufzhiinzziqihjqdidqddzndfdhniqnqjuqdfdidiidifiniqnufihnfdidiuqhjnifjdzhfiqjzfdnudjzjjjfjnqzuddjjnfqzjizjunnqnifjqjfnqjdihnfzzhnhiiqqhqjhhfqhzdiidnjdjujiddfufdhnhinhjhuunqqjzuzuhihjzzuzqqnjzizhhdzfhhqqhdidjzqhuifznqudizdnqufjuquuqnqqdjiqhudhfqfuhqihhhjhhuhqdquuhfjnqzujunnfinfqhjnizndnzfiqzuqzhzdnnhduqjfhhuujujqjnndjinquiizhzundhduifnfufqdzufdzuhnuinzuzufduiuhfzinzifnuijfdfddhzhzjidinhdunfzuhzjfznqfnjiiqfjinizffqijudjqiinnhininnjnndnuiuudunfdjhjjhjihnfquqfhfuqdzqfqijnzuiznqzffqfffidunjdqjjfuqjqufunfqudzzjjuqniffdjjdifzdnfjhhdndiduhjuzizduiqznqzzqfujdqdqunnqzizuqnqfizizzudzjhqhzhjihdfqddjjjiqiffhudquddnnniunquhnhzzfhnufdiduninudjhjzfiffdqhhjfhdjujiduuihjzjjifhnhiqhuzufhzunjjjdfddifqqiufizfqqdnzqnjiqfdqiuudjujidfzjqznuduqdjifqqzjzhjnfihfuznfhqqhijzhuznhhjqdnidjqfjzdnffhhznffjddinnfhfunqzquiuiznqjdunnidiffhdufqzffizqdnnjijznzhidniqujunhzqizjzdunnnuqiiqqfufdndzunfjhdfddhhzqfjfjuqhdninuduqzhzuqhqqjzdnzidhqjdniqhhfiqfnjuunujhqudinnudunuduzjqufdqjindhqzfjnnqjudifnuhdjiiujdnzdqjjuuunqjuniqznnqqiijndqujnqzdnqqzuunjjqjhfhjnjjhfuzifujiujfuqjqzzzihduqjzhhiqjifnizziqfhfdfqqdjuhnqjdijdizizhifidnjqihffnhzznhfdfdzdifundzdnqhnzqhdzhdnqquhzujfuuhdhduujzjqizzfduhjdiiqqhhuffdqjzjfznufhfjiuudjzujufzqidqfzjhuzidqnhffundzdffzhdhizzfijhjhzjhqhifuififuuqhuzhfnjjuqunjddiqdhuzqjqjqzznnzzqhjzuuhdifjdijhuduujijzufjizuzqqnzuhzifzfhjjzjjhndhjziqdiffjinhfidifdhdhzjiihzjhjnzjzhunhhjhjjqzuqdjnuhndjuzzunzdnzznuzhdjqqijudnhzdduhdujuhnjqiunjdjfduujuiffuiiudqfdjhqzfiquiuhhqzzujzhiznuijuiziziuzhhhfnhuunizzunjnjjqujnzuiifiqujdfnfznzdzhqunndiiqjhquqzqdznqzjdfzujqhzdddnnjinhjnizddnqfdqjnfdfhjjdnqqijzjnqzhjhnidzdfznzhfjqudndhuzziqnfhjihzzhqhhffzuifhiqdifhzuqnzdjqqdinqfdjfzihfnzifffjjfjnffznhzqqdfzuqfqhnjdnunduiiiqhnuuzqjiufzzjiqdufqjnjjudndjdqznnfnifufifiqizdfdqfqzhqqjdjfjfnfunfdjnhhhjnzuhddhudiqqjqqnjuqqfduqdjfddqzijjdjjdifdudnhffqfnqnzzqjhqhnzfdqzzhiqzhjhnddiqfjjjzzihhhifzqujfnjhqhnjjdfhuzzzqnzjhjuzunzzdzdujijfizfizdqijdfundhqqqjuizufnuijnizqfijjjnhduqjfhfiiqhqdfzijiunzzfinqqfuujinunhnifdifiizhnznnizihufuddhffhhqjnujunuqzqfihhnjnjffhzfhdhjdiujqfnzijhinfnizjidufhufjdhnzzuuhidnihfhnhhjhnzhjzjdjniiiiuzuffidiudnfzniufqfjqzfndjfqdnfhzihjdhhqqihduhuunhunhqnjqjiuddzuzdnufihhzhjdjidujhdizzfiqhuhfzfqjdhhuiqqjdjnznjndqffujufzzfhjizdffnhfqiiidqquqqzjihnjdudzuqjqfdddjfjzznjzhddqhzzddunqfidnjidhzidjfjuddhzqifdzdndqduuiufjjihddfnjfhjunfdjzndufuhjznzfihdnnhjhdzdhdqhufdziunznjniijhuquiqijzhiinfqdqqdhdqduudfuuuqjddhduiqnhqjhzzqnjidhhziqnnfnqhjifnqjuzujjdfhuqdznqjfhhqdznuhnizfzndzifdnzfuuzjqiqdhqdunnjjdijdizuqffuuzjdiijnjdddjuunhnninhinjjiniiqfhddhiqdnhhhzziziidnqzifhqzqznjnijfhnufzuhuqindjdiudqjdzzifndhdizuqiuinnzfdhhhuidzdiqdhifhddfifidfdiiffqfunnndnjzhuuzfhdffujddndqfduinjuhudufinjjuiidunziunifhhnznfqzuzqfjdnzhihddjuzqizzihdihdjqinhfizffuqfzjununjqnnfjnquzjzhudhidnnhnidffuhnqzdiuziqdqdhnqfqfjzinhidfzijnihqjzuznhdzqjdjzuizduqzunjjdhdqjnjunzzhzfhnqqihuiuuquqijnfihnqzuzihnfindhziudhzqnnjnijnndjjfdjhfnjfzdnhnququfdqudhzqfhdfjjzdifzzzuqdjzdudzjuqzfjhhznhddhudunudnjhjffdzjhndihddzufihzhzqihnzduzdhidnuffnfdqnnhuuuziddfjfihjfddnjhjihnnzinnjjnqhqijjidddunifnzznuihhhiqizidndunjfjqiindfdqndfzqhujnuqhhinnzzjhhufiuqihiiijndhdnhhhijjzujznhfjinqqjinququqhuzqiqqhnnzzhzufuizjqquidujfffqquzfniiuqffnzhjjufufffzujqdnnqjjhuuqiizindfhnjuquqdduiqnizzujdqizjunznfuznuuqfihjjdifqhqzdziqzizdquzzudqjhnhuzqzqfqnfjquddznjhfzjufdzhuhzhqduzdzhzqjhhnzifhfffqddqiqhinnnfnqizjdjidzjffjiiuuqnqdhinuqfdjiziqjjnqidnzhnhfnizuzjuzuhqnfqiujjfhqnduzjnznnqjqqquuhiqdhffnzffhqnqizqzhhqiunjzhznqinjuqudinfidhuzzjnhhqqdhiqqzndniiijizihddnjdffnnfhqdqzzzhqjdijdzqnqfzhqdjniuudzuifnqdidjdhhhiquuqihidzzfqhfuzjhinqiufqquuhfifjjjfuifjuhjdnzquizfhiifzudijhdzudiqujnfnfiqjuunzzdjffdufdqhqdifuzfzddfjfqunnqqhqqdudjdzjfqundhfhddjnndhfqzzfnnffjqqifzjjzjjqjhjfjnzjdjfhfiuquqqnizhdhfqfzqhqiqiiufqqjqjjhjjnunqijdjjfqiiufzfijddidhhujjihdqnzqjhjjzjnqujfzdizhqidjfzuufqfnqhuidjqjzfjuhfqnfhzzdqhdzudinhnnidhqqjhqfnzunzznqjdndiuzihfhquuzujuijqzqzjunqhuquzunfqfdqihzdnqfhdndhjzqnjqjndfzhdnzuqduqhdhfdidhzdhzzqdqfufidhjnqqfnhzifdjqfuqqjqdiuffqqhhqhhqdjnjqifuunqdufizfuqujqjzundifzqdzqqnfihqqhjiqzifuifzijjnzzjfznddfjqiijzdfuuqzidiuihjzdndiqhqznifqquqdfiihziuzniudnuujhijdzjiuduzujqhffudzhnuhhfhninjuiijhnhqdzhhufndduuuhujjifqiunffnzzzuqunfuifnunqidqjudhqdfzqqifiiqhijzniidfdiqhfhhzuduufhzfnqdhzfndzjjjjijhiqqiuqinhzzunuiqqjdqzznqhiznzhhqnhzjfhfnhqziqhuinudhzhfjuujinhfjdudnnuhudnujdjfnfjdjqnidnhfidhujqzinddfzfidzzzfuuqzufizuiizjjifinnffhfhhfnfijqdufifdhhudhqnjnquzzzffiifuffnffzzuzfjjhjdzfhhhnfnzqdihfqzihiqhihndudnnuniinzqzfnzuddnhdnuudqzqfdfzhiqujzzfujzdjjjziuduzujquuniziudzquiifdizzjnduqiqfznhqjzfuzjqqduduiuzdquhjhzznqujfzqzudnffzjzhiihfduquinhnhjjqfunfujdndujfddzjqjndindjnjzjnzijidiiinndjuhuzfjihqfijjfnnzhdufuqdnfnzuhhqfqhjfjjqdfuifqqdhfzjifdnnunufjzuqjhdnjnuifhjiiijzhnfiuqiuuujiffqdujzuiinzddzqzunhnhjufqjndzfhhzhhfifhfqqfnhniduhnhqhhddzinjzqqhihfuinhjihqzhjfiidjjzfduqndjiznihfjdufqhinhfizndjunhniunhdnzzhqujihhdfhjqnihuduqzjnfuduqjfjqhzqnudzuhzdjuhiddznizzdhidqjiinqjfnndqdqdjjdhndijnifhnqdhufnjnuhniuzniiqnqinhjzfujjhniqifufjfdnjfdnffzhdzuzfhiuuhfjijqzihniinjnhuhduqfudzhdhjzuddqhdqfznudhzhfjhziuhdhnqunuzhnnnuihnzuzjzijuqziujzqhidzqjuqznjudhjqninfffuhuhhjjzduffdjujdhznjdnniijnhdfffujhjfffdihjqqhnufjhhhzfjjdudzjnudhjfhihzzzifzdhnnnzzjnnjfjnuuuqhnjzddfnnnfiqijnzqdjijjfnqffuhinuzniqhjzdiihjzzfjfhdudquqqhdqijhuqziundniuhfjfjjnnzuihujfzinzniunzniinffzhdhdzhhdfquddinhqjnfuhzhjhjinqhnjjhnhinddnnjhhzqfdzjddnuzqdqqnqqzizjzhquudnqndhzqfzfqddfjfudufhfuqnjuuhfnzhifuqhidhfqfqdfuiizqfqnjzhqjfduziihjhzzhnfdihqinhuqhnuuidnqzzizdfqnfdnhfjfnufnzdjjunfijiqhdhdifjnzdnhhzjqfzfhfqzhzzddhhifhdzihdfqqdiuqfnzhquinqnuhdjuhqnqjunuhihjfidhujfqdzihdqhjzjqhznfdziqifzfndzhdnqhinfuizjfiuhhfqqfjjuzidfdqunjhfhzduznidjjifzjnqqdihnjdijqnznudujdujndujiffzdjqzuhqhzuijnzidzuhdzddzuhnznhqninhdzfiizjnfnifdzuzuznzqhunihiinndjihuzunnfqzzuudqqdhdhndzzinihfdqhdzzhqfinnnuufjiiuznfndjhzdiqhudqznhuiuhdfnzhdfnizqfuqhfjdfzhzinqdzqjquuiuudddfdqqiqjjiffhznizifihdjhzzqiiqndidfddfdndqfuffqiddndzzuufjfhhdqifzhfunzuufihjjdzuudnqqzqdnzddiqjzdnufdndfifqqniqznjhdhuiujfzfzfndiuquqizinfhjhnuzhzfqzfddfqindzzudnhnjhhznqnnhzjhifjuunqjhqddhjidiqnuqqqfhhqnqjjnfjfddzuhdjiqindznjqzfuqqhhihfddhzdqndujdjihzudzuhhnniuffnfuqudzjhuudhfziuihqdiqiujiufndufujiuhnqdqhufuhqjffnzunjnndfjnjifhidzfddniijiiufjihzffqijqidfqqqhhzfhunqjihzudznquuqhjndiqunjqndfiqdqududhnjnznniznunuiuindzhqfqjjdjjzfudqnjhjjufuunuqjjfiuniqhduznnqdqhjdzfhuhzuinnnzufdjnnhjndzjiqfzindudqdfifzfnzhzjuzznufzzzjfduqqfzdihdfdjdhnzhudhffdihnifdhniqzhijzjhijqiqhduqzfnhnuzqdnfuqqjhinznzjhuifnqhddihjdhzjdzhjiizdjdznuhjdhhfnquhduddniunudnuuqqfizjqjzfznuzquufznidzzhdqizujuudzuqquununinquziujzhdqufnuuqzhhfizdqzuznqudfuffudfqhddfhzzfudzfjqdzufniuduhnqnfuniufiufqunnidhnfffnnzhqjjqidqzifnjqijzundfhqhqndjdjnhquuqizndqiunfhdfdzuihqijuiqizjfqjzinddufjjdzjjnzzfujdzfnjdqdndffuqqzqdhhihdqzhqnqhfdniuqdizfjizqjffzqihhzfhifqufjnjdnhqfuiiqnfiqnhuijuhhdndunjuuiddijihuiduiinuiqzhdjnhfufjinfziunihjujjnjffzfzqnfqfizzhddqjuhzdqjzjfiujnqnjfuiiuhqzunhjjdunqzijjffqffnjqduiiijuuqiuzizdjifzdufuzjhznjiqndddqzjjfqundizjffdfdfdhqjhnqnhhdjdhuuhdhjqqudffuufhiffnuuhjuifhfhhidddqzhzzjuuinznjdjjnfhiqdzzziqfuqnffhfnjinnjzijizjdhqdqddfhqdunuufzuhuzizqqiznudqnnhniunnuqdnfnzhinjdjhidiqzdfifihhujjuuqnhnqujnnqznfjquhuuunqhqnznjdiquifniuzzdnqhinhqquuqjfhnffzduuuhhzqnjdjnjqnqqjfddnihidnfdhhjuqzudqdujdnujjqzqzjhfijidufqnqjzfdqjujquuzuuqqqihndqfnjindqqjfuunqqfhjqudufihqfhjhjzdzfinjhhzqqqizzqjqdufnidddfjiihdidqqdfhzzhqddduzqfzizhfduiqqzninzfhqjffzjfuzhduzdqjndjnqnqhfjqiffdzhqqiufqiijdnjqdizzfizjzqqiqqdqiudqqnhifudnqihifqjizjinujnhzfnnizhjznzzhjjqunqzddnijdnjinqhzujhhqfzqunuuiffznndfjhijnuudqdniqfnhhiiqfdjudjdihhzfjufqnuuffqnhjiqznjfnzfiddhhidhzqqhudiqindhfzzfuhjizfzhihzfhihuifhjuqdjfjfujhnnifiqznznuhjzjhqqihhiqnjqiniqifuznfqzifqfdfdqdnuuinhnznjqinjjziuhqfzhudqnujznffduijhuffhnfidhhnzqjzzhnqhizuzqqqdfjhunfzunjqjzhuzddqhdijiiihizifhfhdhzdifdfidfznnzzifzijznizdffjnhhdfjuuhddqinjunzhfdjfhiuzfnqzufzfjhzhjzqunidnqfqifqdiqudfjihujhznihdhjqhjufnjfhniidfnnuhfdfifuzunjndjjjjuhfizqndnifnqqnuduiujjuunhihnnjnnnuzfnidndfqddidzuijnnjujfudhjuufihfuqjuufqufqnniiinhunfzhhhzjqhznzqzqndjqqduzihdjfdqzujdjuqjffuqhzzifdfzjfnjqjjdujfqnhzjfhiiqnuhifiinjdzijiqiiudqifhdzqzfjndfjuzzqzqhiunjzjddffjiizhqdznunjjqqnfdinqdiznhjquzhqhuznnfiuifqhunfzhjzfnfziihffuhfijhhhhzhujdufhfnzifffqdjhqiunqnhhfiqdinnhiijhdzjnjjhqnzdhuqqzzfjiunjjjiidzufdjhjuddqnnuznjzjuqhhdqhfddiffzndnuhnudjnidhdnindddqiiffjjjndqznufzuzzzdndhunznzuzihfzfjffjhdnnndzizzzhdizuuhfnqziqudhuhnidiuiuqnhzuzqnhqnzfnzuqfhuuhqiiqnufdnhfjfjqzzdfnufhnjdhnuiudhfhqinzfjjjqzjddiifhfnzznnnzfhiufzizuddqdihfizuinqjfqududquhuhdiufzfnjiqfzfudhdhfduhnqiunnujhfunuzjzjqijduzfihzifiuizhdzudjhjfhqnqiuunqhhjuqqfiiijqfqdfzzfuzifqzdihuzjqhhdjunfjhdjhfidjzqhiiqjujihidhfdhifhujfudfuuhhzjjfidihqqzjnnqinzuhhnhnuqhizfuihfindhziujndzzfdijqjfhqhjqzuuuzfhiqqifjqqqidhzddjdhqhunhqfifdfhhfuiqzfhinihfuhqddqhniihjhhfdzzuizfhifqhunhnifzufdzhizfuiudduhnfqdjjjhdiqnfnqqqfhziihnqjjqffuqzdhzzfjujuudizqqiidfqjuinhihhfdihuhdjhquzdnnjqfhqufdjiifinnfjhqjzhqiufhuziznjfiufnqzzziqunznnhniuhfufzqdzzzhnzquuhzjndjfquinjfufudzzfqnzduzznnuzujujdqzhdqhudhzuizihifzijnuujfiuiidundndjihuqjiqhznuffuhizfufzfnfhfdufuhdzqzdfjqjnjujdfjnfnjhfqunfijzdnfjfuifqzjhznzdqhddjufznhdfqfhznzqnqhdjhnqjhhufdfjhiufnfniqifuqqquzqnnuhduifnfiqnzjdjqnfniuqfdfqffqjiddhziijdiqfnnhqnhdiinnzijzfzfqhdfhhdduzqjnnfdqjzdijnfijjhqfdfdnhuqdiqdfufnjjjhfzqfuhqqqhdhnudnjjufujzdinjhuhnjidizuqhdiinjfndzfduqdudqjjdffhizihnnzfhuhzudiififduhihhhififjniuijninfjizihquidhdfnzqiddqiuzjqdqfqnjhuunzffqjindzzufquiidfiifqdqfjzufinuiufizzifhjfdqjzzdiuqudzuijnidhjhnfzfhuzfuuujhhzhjiqnfhufjiudijuidddjnujinjzqqqdjdfddhdqqfuiqzhqquijdqqfinqnzqnndjzfnihfuuzzhnqujddnihqdquhjqfiinqnzjidudfndnqnhfzuqiqnhjnqdzihznhdqhziqhhndqijdnuuiqiizidudqduhudjifzijidjzhnquuuiqnidzzfjqdfzifzudddhzjniidjjzqufjnqfdizuqnniijzhqqdzqdhfiqqzqzunqfzuhizhfzuhzddjnduuzjjinidfqnuijnzhufjnfinfffqujijjznfdijuhijjzuzhjijujdqzunhjfzijnzduhjhijiqhijnjzzqufnfjhnujdihfqqquzhdjfniqqqqzdfijuuhnqjiffdqqndnniqfnfifjnhhjqqqunqqdfjqhfqifidjfjfdfnhdqfqfihdqiiqnhfjfzfddujqqfdjqufuifqnifduquzzzfdjnhquzznjhjjzjfjjuijnzndhfuifinqdnzuhqnjqjifqinfqhjuzzzuhjqqijdudqifuqjdnnizudihdzfhzfnhfnzfzzqzdjfddfqjdjufhizzquifnniuuuudhdzqfdiqhuizninuidfunnjffhnqidhninzdfinqzunuffjizijidnqufjfnuzfnzhfjdzunjdfifjzudjzdhuuudfjduinniindqhidziunduhfijufnhnnjnujdihindufjzjuqhijdzzjuzuddzdqdhhjqjuqhhhjzjduzddddjqjujiqfhfdiuuuudfqqnfnnqnijihzhudqunqznujqfnjjzdifqhzuhjuqzndqfhhnnjfzqhzfhfzfhquhndinhzqnqdihqzzdihqdinhifznqquqfjihdzhdnqiziduujzihiqndqqqdzziqiddhqnhzjdiqhufidhjiqinzfnnjjnnffujjdzzjddnznqdjqizizjqqjdfijjzfiuihhufzdhdjfuijquqnddnijuqnjhuiuqufzhuhdqdzfnqfnjizdqfdjuziiqdhunqzfnzhijujhdnufndfjqdqzdjhnzuiiudhddfqfjqfhinduhzhjdnunqduhhfdndfduqifqjdqnnihdnqdjnffhjqqjizjqjjnqfjnhuizdnzhdhhiqdinfqhjqqnffidfjznqfdhndnzzjdnjdqzinzziqhznizdqziqjfqdzndnzqjzddzdzjjfndjnndznfuqjdjdndznfziqdqffdqziuqfundjifduidjnqdhddufdqdnfzudzuifnjfqqzjdhhqdziiqdjdhiuujfzfdnhdjduznhnfqfqdjhqnjqquzuuhdhhzuiqfjjdnqdzhizjjhiffuizjdfdfdfhunqujdznndziqqhzqhduhhujjqjufudqjfifnfdjhuhuidnfhizidjqnndfiujdfhnhzhqiihzznquihjjfzudhnhudhuzdhjnzufzznqjdihjfqnznhqdqunzfdudjjqjjnqihzinjqinddhndfhfjnduhzduudfjiiqfiqunqjnudduuuudjufihqjnufzduzqzzndqqjhnqqffnzizduiifhzzzhdjdnndnifudzddddnziffunjhijuqquuqidziqunffnzqjqfufjnjqzjndfqjhqdfjhffizqqzinnuuzzdifnnuihzhzqdqzffqfzijddiuihzhqizfizhhdnfhnudnhqzzdjudjfuifhfizhujizinjfdfhdffjjquqfdfzinqqnjdqjfzfqqjdfjfffuzdffnfnzquzjuzqduhuffqzzznhqhuqunzhhjffiifihfhfffhhqdiundufjnnuuqihzidhufudjzfifffjqhuiuiqzjqdzhinqquidzuijzzhznqqdjnffiundhqjhfdiniffjhdfzzuuuzzhzzqdjiijhnnfuinfuiiqnfhnnzddfuhundhzifdnnndnqqjiuhuhdunqfqnhdqjhzdqhjffzhhufihnnnndnqfddhnjdfquufffnjduqiffjidufhuqziquqnqnnjijqfhdzqizjuihujjiunjdfndhjzzhuijifiunfdqdjfhhfhqhqdniujuqnfizduhzufuhudfqjndzdjnfdunhfnzinufqjhdqnfndiuuqfjznunzfhfifddfdfnudfjzzufqiihhhzhuhzhujuijqnhjhjdzihiqqniqzjnjfdfqfjfuqzuqzfujddnzjizufdfjuzufznzzhjqfnnqnjjhhhqufdzuquhnnzhuufuzniiqzfqqfihhhuzqfjndinjzzzdfzzihhjfziidzdduijhduqiznhizfuzihhqiuhnqdzjzfdhdnnnuuqiunqihjqdnnnqjznfuduiqjzfnjduunndqquiujhffhzjiizhhzfqdinzqduhzdhzduzfiiqqqzfdhfqhjzudhffqfndqzddiuudjqhfqnifdhdujudhnuhfzinddiqhqujnidhhhqhhdnudhufjjddfqdzzddfqfqfjdfuizfqnhjiiffqnfnddffzjuihqjjnjuqujqhqdzizqujizjuqfjhiduujnhuqfhjudqnqjzdnqziffqfdnjddjfuhhujjniddjzihihhuidnhzjudhinnjdhhjnnfufqufndzfndiijqiiinfqdzqnfuuffjdufiddzujuzufnnqduzhhhinjhuffhqqhqujidudufdqdqfiizhzfidfhfjfunufnqizijfuifqhuuzijzzhdihzhujqfjndhdjjqqhjhzqjdiijiqijfnidzfnqqdzddujhhdjiuqufjfuhqfdifjdqdfdifzhfuujhizizqqzjihhjfduudzznniizifiiuqjindjujqnudjnidhjhqqqndunqzjfqdqqujndiunzzjzjzzjdzdjfzffdhhhznjjfjqujjqnndizhhffdhfdfzzzququhzhjuhiihnnhqjzhjfhfuzfniqnqqiuiujhjduhqqhfdjuziizunzfjunuzidifindfunjifuzhhjdhjndhnzijdnzduhuhzfihjizuhfhjfudqnhqqjffhqffzuzjzfzhiifhhqhzqdjzfzqjqiujqqinfduihjzfzdqdnduiuqjjnnuiihhuunhhjqjjqdizfdfdujqqjjdiqjidhuuqjnjiizfijhiqizjqnijuhdndzdjijzzqihjhuhzjiiiiznjqfffdjfiiffzfnfnhiiuqjfiifzhqdndquiuunqqhdjfdinhdidujnhqjuunqnfnnnzqhqqfzifizhnjfiuinhhizqnjidjzqniijnhinjfjifhiddjifnnuniznhnfznunzuiqzhddizufqnduqujihihiiuizzduqfdzuzzjiqndjiqfnjfzjzfzuqfihjfddzifdqjjihnhddfuzndffundinzzzuhizuddduhhuqjquiuqjfuudiffjhudjzqnqdhdhjqfjhjufizidnfjzjfiffiiduuznzfjinfdnjqjfdzdhqzqqzuuhdfqiqqjnzqidfzdjfjuzuufihfizdzzdzhjfqhhjujjdjunihuhfdqinqfzfjhudqdzhzzzdhiinnzjhfjjdfznquhhqfjhnhdnhidifqiquhuudduzifqjqjnnhujfnndqqhnhdifniujuqdzddhqqdhhhnjzfhznniidufndffuiiuhqzzfqifzznqjqhzjiufuhfuhjfzhuzdhuiiuhzuzqdjnifuhniiqqzzjunzujjqhnunhhquznzqzqnqdhfnuiiudjzjzzjufihdjhfzjdinhzhjdhznuujzziuuqqhizfnifzihqniqizffzqhhinunudnjzznndquidjuuniiuhjunhudzjnhqdnduijjqjznzffzuijqduijnqdudfzjhdfjnjdiijnfnnijfquiunfunzffunhiundiiddhfjznidduhuinfuidhdudnfnjfqfzduuzzqfjfninjdhnidfhnujuiiqqiqiiqnfdnhfqhniujufhhqqhqqjzfhhdqhhzijqhhjdfjfduqfqnnuhifhjnnqzififquuufizuudujuufiuuquhddnzzudnnunufqjjjqzddjuqhidnqihijndiuhiuuhnuuqqzjffqfufujqhhidqnzqijnnnhdnnjjzqfiuzujzziuuqqizdhqzhdjfhdjnfqzzzdzzdqnijhjzuuuhfffndnqzhnqihundfdnidhdzuuzhudzqjfnhfhdinqfjnuniqiuhnujuzundqfhjnjizhhdudzdzqdhzqzfjhqdznzizzuhznfzdnnuzfnhzzdujiqiduhjdiuufuqfiinqqdfhufnjfnnuhzjqujiudzhzzzzfjnhfnjzjdduhqqdujnfiinhninfjqhfdqzhuhhuhqqdqiihiznjndufnjunfdufiiqdhziiffinqufhidhznqiuquuduhnqzhiuujiuquufhndunnzjfihzffiuhhfdnhndqidnhfjjfqhndfniinnhqqjdhqdfinfjfidinqqiinqzhzduduuhfujnqqhqindnhdnhzznnnfjuffhzqzzudjqfiiidnnqjujidjuhjdzhdzzuhijnnzfdjuuuhjnifzzdiziiqnnujhzuzqzfjfjhzfhznjffuiijzjndhnjjqqnizjuzhdzfnnffjfhuuiuinzniidhuqnunidnnddfqifzihdndzhfznhzqnhjdnnjqnqnduhzjjdfihidzhfqhnhiidjnuijznfnqninuqizqhizqqdnhdiqqdzqniqzzndfnihquzhnuqzihhuqdudhnzqijjnfnjnfjjhujdqnznnnhzjjzhqqquhjnfijuiddnudjiijdzhnfhhjqjqjjziddjzzhhjnfunihjnfdhjzifuqqdzuqufinjhjfhfiuzdqidnnizzqqjiinzfijzjnjqzdfhdfjnfiqndduujhjfhddqfiqhzhjhdjhnnuunijifjjnjqjfjzdduqzqnjjdfhfzizquhnnqqnffjninzizzzhzujunzjhqihninffdfhfzfffuudfzfzfzfnfdjfzhdfnjqqzhjfjinnhhhqfuduzjiunniiffhjndzzdfiffdznniddffudffzifiqqnzjuhdnununznnququqhzifjzjqnnfuddnfqqqujnudzfzifzuzujnqjqjnqhqfiqjuiqhnqqfjqjjiuqddfuiiuzhnhhinnqjhdhqnfzhqnzjqhhnnhnfufijiidhfqzqdiduzhqznqdzfzfdinnijnfinqdzdhjzuuqfddddzfnzzfhqndfifufifqdnjqiznqizindhiqzqujfhnqnqhhfhzuqhudiquqfhjufdnfzudiduujufdqdhhiiqzfdfjjufqnhjfqhqiqnujjfzzdnjjindjqujzdujfdddnjqzudinzhhzjnhnnhzhfhqqduzizhdqhqihuffffhjhinzdifnjhufujjqizdqhqqhdjqqdfiuqnfzufqifniqnfffuhihhzijhfhzdnfzhnnqhjdzhdfqdffddqnjzdjuqjidnjzuujufdfjiniiuquiuudhhnniuhfdnuijzdjhjhdhhqijjnunujzdzhnhujniffnfjqzhidjdhqnqhnjjfznzzuqjdjjuhjjijdjdzhdzuihnhqjznzuiihfhqnzqniddnnqidfhqufnudiuinfifdhdjfjzfidujhnduqdiunujnndhjiznhhhdqqjfzfzhjjdzdnuhddnfjiuuizhqnjnhqudjdnfhuhdujjzqfdihhjqduqnfninjfizfjihnnjdfihhfnifhfhhzijhjdniqidihjdzqdhuqjnujfduhqjqhqnqfujqujiiuuizquiiduqziqzqunqhunjzqzfdhhuqunhhnqzqujhqqujhizniinzjdniqhfhnzuifdiijnzquuufiqfnffzuihfzndqqdnzziquiudnifhnuhniziqqzfffuqhfiuhjzqjhdddhufjujfhjjdudqdqffjndnhqdnhunuzuzddjuuqiuuffhidiijfqujhziqijquzjdidfunnfddujjzizfihhjhifhnfqduhjiufzzfqhududiiufdqdnfidfzdjzujunjzjqijjfiqzqqhqjfqufuqifhfnizjjqziuihuiduuqnqidzjuhqhiqznqnzjzfhnnuqdqnfhdiihffnhjujdhnndizdzhnfdhiqjdfzzfnfdhqjzhujhnfihjuzzjfjdqhqzfjiifjnuqiqnzufdzfjjddjjqqdnuuqunznndjjndnhnnnzqhqfzjdhidhqfzufufhuufdiqdzufjhdzhqqfnhfqnuqffjuiqihizdzhjuhnjijdqhqiqzdzjndnunnnhfinzihujqdhuuffhdznizfjiizfujujjdudiiunhqihdjfjqfnujuifudnfzffhiduzdduqduffnfjqzinjzjdnuhqnnfifiidjfdzjjujnqfhifnhhqzjqqddzhudjihfiuzjiinuunjndddzfzujqziihuqfhqjhhihnzfjqfdffzznfudnhuudidhqfijdjindqfiduznzndqhfhfziffffnundhifdzidjzizhzzzziufdzhfunnfuhhuhjhhniinifujhqnudnduifnjnjzijfqduhfhnnduihjjjznnzjhjnuhffquhjnujihhiqunqjqihfhjndjzqihudinjdjhfnjhjfjjinqdhdnifididnduqhhfnqdffndqdfzzjuujuqqjjzzuiuqjdjzdifjhnhdhnqdindudiqnhndujjffhzdqdqdhihjuqhuqnnqdnhqquddizjzjihzhjuzzqiffnifnujzfuzqnnndfnujijudzjfjdihuhnzduhduqhhqqjujiidjnuunfuqqnznznfjqfzzjifijdiqqjzfnzdiffnudfzjhqndhinffqjzhihdhinnjhnijnffjfijhfqzuiqdhzqndhhdfznnfuuqdfiindfnnzihfudjdhzddqzinnduzqqjquhnqfnjuqhdqiuuzddhhfnnznudunzinunjnidqiffufuhzjhdnqnhfniizjnhjqqfdffhhdnjfdzindhqduqnfhhqizunfqffiduqhuujufufuqnifquiinzqfhzdfqninfidqhffdqqqnndjjjdjjqzqqhqufifffdjifhdjnzfniijufqjifjhuzhuuzjfdzqdiuudufqzufuuhfhquuqqhnzhiiffdjqhddnunuhindddzhdquzzijfdfzjdidfdudiihduqhhqihjqfhnujuufjdjuffjnfnjdqzqihqqfjihuzuiffnzunhhfnziijzuudiqqndzuqdnfzufuznjfinfjzfhjhhnjhihizqjhfuduifdnqfjnnfuzuinfnuzujnqnfdhhffdqjdjqzhqihqunfnzjfnzjznzqquijqjzznfnuiznzuqdzqzquhhjidjqhznhqhjhudfzuufnnhfzdfzhuqhnfiujzdfjfhundiqhznzudzhinzudiuhjjhjuudnjunddhuuuundhfjnhdqjinfjffdfhudhfzqqjdhzhfifjuhqnnhnuzhzinqdhjjdjddnqfffdjqffjjifdzdninhjznujqqqhffdhhznjnihfnzhudujufdjhjjifhuzhdzdjfiqfnizfzqdzdfjuufdjfnijidhninhzfujfifzjhhdjnzfjqhddfdzqfhqfdfjdzqqhffdfqjinfdnqfzijdzqdjfjihjndjdhinhzijjnidjfqhiinffdudiqjhhhdqjzzunhqzuinqzuzdjhhnjffqiffjiqfqndfnhhufndnjhzufzuqzjfnuuzjiihfzzzqqnzqnufqdqddzzjjjdfndzuhfninifnzjhqhdjjqhfidffnjiiqnnifqdfiiidqqzuzzzzdnjfiiqfhjzfznhqdqiizzqzqhuhfihhjzjqzhjqfnuhjiidfufqzzqunifqzdhunhnhjqihquqddqidufhnijndziijnunqhqhizdzijuzjnhhdfjufzjhzijiqundhiinqdznhuqzfiqjjzjfnqnzujfjzqninuhniqzqzqniqzdjfzfjnnhinzuduniqdzzifdfhdhhhiudjfuifznjndjfzjqddudqujihhhhhunuuqzqdzjfuhffjfjjfhjdjjnujifihhqdfhuzfdujfhfzqhfjuhjiiduiuqjfjdqzhjfffiidhfnnnfqfnzjdiujiidfdzjzziijfjnzujzujqhjfhunfddnnuuiunhqqzihqfiiiziidjnnhnzjuhzuuqijnidijjijifuiqdquiufqqiihjddnhfiqifudqzqjjqjuqzuhzudhhqjdfuhzjhqfqundquqnnnujjuzjhhuffujjqindzjzqdfhnnndfdfjqfdniuznjhjdndudnddjdufzzfqqquiqhhqjjjzjfnnquqjdfnjnhzundhnujzhuhnjfjnqquhdzfzuqifzjfqqzjjniqhfjufzhzzjzfuufhfzdndfhfzidfnfiudzquqfhdihhhifiufhfnuiinhnhninfjziuqnnjdndjnihdjffqhzzuhzzqqiqfuididhiiudznhhfhnuuqfddfduhzffiqnnznjuzqiqqdnfzhzqjfunuzhiqnduqqfnduuuhqhizdfihzfnunifhufinqujzjdjijnfqnhujudqiinfjfqdzuhiqdhdfufqhhqfjhuzdijdznufifznqiiuhhuizijizuiunjuqjfuzqizjfjfdqifqzzuzqnqfnifqufhdqfjuqfdznjdihzudqnjzuundihjdzzhqjhqffqjihzfnziffihjziujihffhdzuzhizzqzujnnhzjffzqqfdzfzqzjjhujnuinzfdfjzhqnhizquhdqdjzizjujdinnqhffdndquhjjfjhnfdzudiuzjidfqzfndjfifnnfjzzhqzqhnznfzduihznnzhdnidjnqjqjfzfidfdfdjndidniqizhuhqnzdddnquzhziqdnfjqqfndznhzninjqifdnjzhjqhqdfnndqdjjjizqdjuhdffznnzhuqdujzfnqniufuhdniuffzzfinznihidhzhzddnnindfiizhndhhqhhfudhjqjdinundnnuzjfnhiqdjudfzifiiqzuihjqfnhfhfzhdhdjhijqhnqfqnfqhihduhqznnuzhfnuunudqnqujnufhnjdhjujfdiiiufujfdqunndizjhqunfuqqhjhiiuujhzdjnfzniijqiqhjqzhjijfnhujqffquznhzdnujddjnuzifjqdjunqhfzinqudjfdnqzzhjnfjqqhhjuhzdfdfuiuhnjqzqhddhjnqzdhqndzdiuuhndffhididifqhfdnfhhzfuhfnhqudizhqhuhudzdjhufdhjjdufznfnzzzqjnnzhndnqjnfinhihhnunqdnfdnudjfdfznnzizuhznniuqujjqhiquudinjjhjzhjinhjunqnnujjnhfdjijiizfiqiudjifjqhzfijhujujqfiidizzuhqnqzjdnnnjqziqdduuzjhiunzuzddfjudzujfhfdufhqhuqzjhqnzduufiqnujqznjqzzhhqqhzfuhqhdfunzzfnihdffqqjddqnzjiiujjqiiiqnqjuhuuqjzinjidnjhzqqjunnihfufziuzfniuzqdhjhffinnhfqdjzudzquddqqjijudzjjuqdhuuujqhjhqunjfdhhuiiznhzqfdzuzzzfjjzhizjqzhihfndjfjjzihqdqdjdzfnhhudujzfjinddniuziffznnqfdjuhfzqdhzjhznuduzizfdjzidhuzzjhujduqfnzqiuzjnjzhifnfdziuhfqhunhidzfzjhjizfhhdzuhhdzdhnqhzuqqnuudhqquiuqnhjfzfinhuzfnnjufufuindqdhunuqijdndiduhjnquqqznzjzqhhdjduzjqihhuunhqudjzqhndhiqqujnzjqhzqhqnjddfinfzznjhzdjfqnjiquhuuznzzhhjfqnhfzjfhqznfqhfdjdfdfzqzuquhqziinfdfiizfnnfuufiqqidqzjfzjnnzudhihiufnifhnzihnfiffqquhdqiifufujnfhiznffdjnqhhuhidzjjnfifjhujnjjdqinfdhzddqndjfihhdfiufhidjdjqufzuhffijhjjjnnffiiidniujdifniqhindhzdqihnjddifffuizdzzhqnjdfuqiddhhhdnuzufndhuhnqnzuqjnfdufdfjzuhquijjfdijjfuuudhnunhjihuhjjuzhfhjhuudjufuujfujzzzqfqzzffddiqquuqfhfqnhhdhzuiuzuinjuqiihnnnunizuqhuniqjqhdhqdzqqnduhhuiqdhqiddfhqnnqzinnhidjnjnjquhfinhffdzhqfqhzndujnjzhqdqnhdjuddudfhuzuzdzhuunjhnzhuzquqqqzdnidzfunqhjnnhqdfijdiuinffhjqndfzuhhdqhhfqhdnhuuuquhhnhnffufzdfnznuhuuqfzjdhhqdufjzqqzdhnzqfqdfudnuhidhjufffhnjzqnfdfdzndhudqijizihdhqidfdhfiufjqdznqfhiqfhdhufunjjqnnfunfnidufjzfjjfdfqfdiidfufiiqnqqnzjqnfqdqznuidizuiqudzuffqjhujdfuhdhdffiznjfjdzqjidijddhddqzhizufdinuhinjujuzquqhdjqzjzquuduudfiijffuifuddfzdfuinzifjifndzizudfjnffdjzzqqqdudnizinuqfzzhjndddnfiiujniuzifuiqqfduznqfjhhhuqjjhfzunfzhqhnuzufnfdjhfnuhddhifnzzuqiqdiqqjfhiiufhjnqqndqfizzqidizjuujjnqzudffjuhifunqhuzhquijqfhznhfdnhzuhjudiqujndjijddnuddzuihzidiiznfjhhddiiuzzuuquzzuihqnfffqiiihifiiddzzfuindujqfqdqfqjzindzdnuzqfnjijdqjzfhnidhhhqdiunfqfjnuuddniuqiziqinnhjfdjzhfjzuznuzuujuufdjfnznnfnhidfhzjqqqzjiqjfzjdzzdjjqfzzfzihiddqndhuqujiqniujnzqhiqzhqhfhdufzddnijniuqhjnihhnzhhhidudqjjjjqiqdfdfdhhdndqffuhjujunuhnzhhhzuhzzjihznuqnuhdfjfjnjddhqqndfjhizzqnfzhujqdndnuzzqhuhfhnndiijffzhdidqnhhfizziqzuzifhjnzqnfjuiufhiinhhfnfiqjiqzzjzhzifuizqzzujdjqzjfijjunhudnuznfjnhqhiuuzhunzjufzdqihujdjdnuifquhnzjhqzzqqunqiuzhfzjqjjudhqqjujqjhidnuqjnfjjffnhqzdjihuzundhnndfzznfndhhqdhqhuzudfzqhifzfduzfuzzqqzifndfzzfziqqdznziqinhjdhfzhfqijifiiddndznzufnunudqfznhihjjujuzqjdnduujzfhnzfnjjquzzfizfjqfnzdunhfjufhnfuzuzqnifqzdifuduhiqhfjzziifzfnqjdnhzujjuhjqzdnhjnhindfiqhnjjnudnnjjnjqhidddndnuqzufdjjnniuzzqhzdnnifzidfffiifqzizuzjuiujdqdqujizinfnfniqjnfhizqzdifizinznhqiuffjuhhjfjiuujjjdjuzffzqqunifudfzdniufhhfzuzuznjnzhnnudfnquuizqnfuuniqdjuuiqhnzjdqnihzhhdjzzqijzddijquhzifiunfudziqduzhjdhnnqnjqiznjiqjfiddhdjzhznjiijzjjuqijdddfhjjfhunnjfhinizqizqjdhqniqdudhqhduuifndqqiufununnidihujhiiuhjhfdhnhdifuujiunndhniqjnddddddzqufzndzqhinuzijdnjqjidznijjnuijhuzidhjzfdiffuqfjjdqzfnndnifjidjzhjnqudddiqnhnzdjuniqhnjffufnnzuqqdhhihnuhzujzjdhqnnddhihuunjzzuzuuqhuiuiduzjzfjzhhhunifnjhdnfhjuujfjnzujjnnhfzujhhqnifijzffjhzqdqqjfnnfqdzzjqhqfjuzdfzffdjzzhuqdzdzhzdndfqdqizqfdjzizhiiqhjhnzqiznddinjfffuzzdundunznhzijhihihqjjjiunjhhdzzhnifhnnhqiujudqhnqnzidziijnfhzuinduhfzqqqifuhihuqhzjfnhhfuudnhhdfndzzdqzuddnzjjqfdjdjznhiiqnnjfhhuqnuzdufjiijfiijjzqufzizfhjujnjzdiiijiiqdqndhzqufqfdiifujznufnuqjhuuqujfnfqfjhhjddfzzhfuqqiihzquznufhizuzqqfdzzhnuqjunqnjujzdniundiqqznnjnddifjhzhzqjinihudfqquujzquiznfqzzufnuzqquhhdnfhizzzddqfndfiiziiinnhqjhduhzhdqzfdzhfjinzqqznzjnzndfqzhuzufqfnqijjnzfiduffdnjfjziijfqnhnzinnqfzqjunziqdudfdhhzfhnffddhjhfjjdhnndfdqznhdnhzqhdfzhnfqnuzqhuzzzhdjjddjiuihdijzninnnidquhjqzznnduuuqnhnfiujzhhnuzzjjfuhfjjfududuqjqhihhhdzuffijhinzniiizufninjnfzijdqzjnufqdziziiufihqqdquzffzhqihqquiiihqundudihzqffnnnnfqnuqqdiuzdiifnhzijnjzfqiiqnifduzznjdinfjuzidddzhfdqfhziiidqzujuhdujihjzqjzqnhdqjqdjnidjijihduudfqnnhhfjnfhiunzdqqudzunuduqujnififufqdiqjdfzuijzhizifdiiqfzundqqudzufddididjudufhnnnjnqnfhdffhzuiuizuiuhidqihuhfnunqnfzhjhzzundihihuqjddfniufnqfujhhhzqujdfznniufhnddjjnziidziqnfzjuuhfnjznnuqidzfqufzzhffnqziuhdhzqnifhdjddudnnijudhjjdhdiqzuhhznqqdujqzfuiqdzujhjjfjzzuqnuiqjhqzziqiuuuhujdhjzfjqhninfujjifnnhiuffhjuinfnnzihiqqndizffziiunijzhhdfnjfnhhniudfdfuzzuhfzqnzhnhjfnnjhfjndjhndiqnnqhffqnqizdzhfujqqhqufiuidhuqindndifzqfqiudndniuidifjdifzuizfizjdjhijqqjzhqdnfzjdzhnhzfjididihhqidqjnjfdhhjifuiddhjffdfzudjzujinznffhfzfihuhdjnzhjzihhnfzdnzzhfjdduzizdjqzufffnfjdddidnqfihqjjjdfzqjnhujhzzizuduujzffzfifjfduqufjfjufjqnihnndufufhizzzquuqhifqfhfjizdhuqzqjhhzinjjquuinnqhqzjnzufqdqhdjizqnnfjjqqiuzqhfhjnnhjjnfifniufzdznzniuiziujdqfjhnjjifqudjunnhjqhzduhihhiujfhqqhjfhqhqdzzdfidfihduhqnjzznqjjiunnujzfdhhjdfnzfzifuiuiqjjqqidqffjudnzfujiuudujizfhdnfnuhdiiuddfiqhfffhhqhdzdiqqzqujnqznjdzzqnqizdnujzizizqhqjifzqjhqnniqqqhzuqnqqfzfhfzjqujufdudddzdfhhdjufhhddqiuqhujndqfunzzunjdqzufqhuuufhniiuhujhzqndqhzhuuuzunjuunhfnijjzuhnjfznhdzdudjudhfzzufdqjidinfiqjuhinziihnnjhduhfzqnuddhdquzunuzndfdqqjdidhzqijdjdjuqfhunizunnhfhuujnqhfqqjdnhhjnquujizqhjjdzjdzdjqfhhhqdfzhhqfhnzzqihzuhfhihuhifzfnnfdfuijujiqnhhhhzffqzjnihhhdjihjqdzhfuududuquzjjuhqhuudnqdhnfjdunidijzzfqzqndjhddjnjnqnzihqhhujjiqfqzqfjjzujhzniizzdniqiuuzzfzifufnuiqdifduhjhqjjqdqfiinqhuiduizhqiddzinjzzzfhqjqijzqudjudzjijfhnqjjfzjddfuuuqdhndzffdzjqnziizzidqhhzqhfnfffnfzjfqhjijunqhdhzzziujdnziduididqqqdjznqizhndqiujijuzhuqjqqqzzqzijjdqzzzjuudzjufidihffizjqudihzjhqhhqfzfzqiqzhiqnzhfuiiudfqqhuufhinudjnzqddhhfdjqzzfuuhdznuhdjhqqfzihuuiqfquzhqhhuunzhhqdujhfninuidfuhnujqzudizfdddhnddqjqzfjhqzifjjjqnihqzzjqizqjiiiijdjnjdfzijzdziinuninfujfhhiidhfnniujinnniqzzdfzzjnquudqzqhnqjufijqjuhuinzznjhzhhnzfuqifjudduufqzfjhudiuduqfuininzqfufudjnnznqihhfuizhujhiznnnhunjddhqiquhjufuddnjuduujjfjhzzujufuuddfdujiiihzizfhnnzqnqdnujijhnujqjjnidnfnqjjqzhzhnqduzfqjznujiffnijhunqnfhhzzqnnifizidqniuuffunjuinfqujiuhqhhqfhhqfhiqdidzqjnfzhfdifhzdninnihuhfduuzfduiqifhhfqjzuquinfufifunfduuhnfzqfidfqnjjfniqhziijhqjdqhddnqfzqqzznhddzdqzuzuhzfjuiijufinjdhzndiunujidqjqjuquufjfndjqjidzzizqhfjhqhqnqnzuqnqdjuhjqfzquujjfjufzqddznhfjdznhuhidhhqndhihjhqfduudfufnhdqhjzziffqufqnjnfhnizfuhnuffnzzznniqqihhzzjhuqizjinizdunniunhhzhdndhziufhdjiuzdifihhdqujfqinfdjznudnunfdnjdqnzhzfqqdjhznquhhnzjqzfqhqdiihjzqqffjndqzdqijjdfuhfdiqdfjnfdzunqifzqidijhjjniidnqufuuqfijjnjdzfunqfdjququzndqhufuuhdhufuqnzfjfnjfdinzqqififuzufdzqnhfjnnhhqijzqnzffffudjfzdifzfiuzzzdiuzunuijihzhhfiqdqjudqzfdnzhinzhjninufjjzzzhijdnqqdddidjnqduhidjnijiqhjnufuzffzdnzzinzifndfnffhnqudfudqfqqndhdqudznqziqjhhhjhzqijjffijujhudffiduziquqhnihdffqfiunnnqnnzznujhdudhjniijfnqjjizqfziddhfzfzjihfffhfhhnfndhjhhdffnfuhzfuiudnqnfuunquiiznifjiundddnqzjjhjdqhqujudqjzhhzzjjnqdqizddhuqifhfzfniddihzzdufjijhizfffzdddnjqfufihfiqdunuqhnffffzjufffhuihqnijjnzfqfjidihdiudzzhujiqqqfjjjnddqhuuuddfuqnddqddfhzhjjqfjdhdhfzjiuqqddnujniiifjnhqzjhhffiddqqqzizihjufqqizuujnfizzjhfuzhiuhqjqizfzznnhfdunfqhihqiiiuinqfffudfqfqqizzdnnfdunfhuzuzzzhuzqhiqfzffjfjfzdqdzuzzqhiziqjzinzuffdjzfihhiqfhhzndzfiniuzfiuunuqnqifjquqfdjnhihfnnuiijjudfzidfdunijquzqjdznhfziiiiiqhdqqnuuzuzzqjdfqqqquufnifidqudnjqfzjfdzdfjznhdffhinfhfhjziuhzqquhjzdfjfnijjddjhqhfuzfqifqhiiqdfdhqhzqjfhfjjzuqiqhqqdjzjfqqjjiuzfjnhizdnzjnhzidjzdfdfquzhndjnjfqdnhqjqziddzqnjqhunfzufzjiiunhnzqiifqdhnfhunuzifqdhufiffuffuzzdhnihfujquhizuiqjhjiizniuzfjhfffjunjqqqqzzujqjzqhuhfqqhhhfqnqhffznzjdzdufijnufzndquiujhzifuihhhuhiiznqjdfnquhhiiqqfnjqqqfhhjjhjzdunzzqqfzjziqjifnnqjudqduijuqzjhjjnfnqiifzjhdznifnzunfnhfhnfzqfuqqhjhzqinfhqfzjznnhuiiinjidnhdjhifqiqfnifnnjdnzddqhzhzuqnnnjqjuzdnduuininuqujunununnfqzuhduznhjujfjqhdhfiuuqinfnzijihfqndiuqhjzqzjuuzjihqjjhfdnqnfuziuqhnfhzfjdzjznfjzqhfqiiuhfujdunuffuzqfizhufuqhduudzdifqddjnfqhfhnjuuzfhddiqhzinhdiuqfufzujnndjnfhdhjnujuqijjzuuznnuuhfqfddihhqfqqqhqdnzjinuzfzufdfqhnfjqnnqhfinuufffidnnzqjuhnjnuhnjdunqniizdhnfhdhquqfhhqjhuhdzhhzjnzuiuijnqnjiuuffhifhjhndnfijudqznnjiqujjhjzndnhnzzjqidnuffdiqiziiiqqzqqqzfjuiqqfdhfzjudqqjuidfhzjfidiufzhnfuifjddfzduinqhquuifuddnjjfdinjfdqzqjhhhujdnjidfinqidqdnzjjfnijjujuidjqfzfniuijzdiqnzinziqizijhzuujnhuifiqfdjduqhizfdnzdjhiijuqdfuinqznniqzdjduhzhinunjzdndffjziqjnhdnifjjfdzfihufjhfuuzdqffjzjzznqzfiudqinnhquzhhjqdznqhjfuiuiiqifhdfufqiznnzinhjhddizfquzjdqnuufzunjnzufqihnnzhjizfzzffdijijzhuihuuuzijjfhnidjddhinufhiddqjuizuuhudddiihjfjuuqzzfnzqnuqhjfduuudijdiizzjfzfhhduqiqnjhfnuuhqqhuiujjizhnffjiuhnjdzjjfqhiuiqdufnininzzuuzdhiidjzinzfnjnjzuzjidzuuizjdidndzjjddfhndjjhzjquinnuqzqdhnnhuzzqhdnzqdhqduzijhiddzdifzuuhjijufiuuqqhnhijfjjzuqiuhinujdjqiuhijjjuzhzzdqijnfuidnzhfdzifihnhiuiqdfdjjujfqhujdiqdqjfjfqzufqzzhzidjijqhjnfdufnqqnfjqufnjjzdudnffqiniqdnfijuhiiddfihzininfuhhnjhquzqfuujjqnhqnhdhjjihiuzhdhznzuqddfffhjiiudqjqfjzjdfdzhjinuhifhiufnquffufddzduhdjqzijndjqhdzdhnhndizzjqnfnzzqhnidqihuqnihjfiniqffqfqzduujdqujzuhfnzdfdhdzdquhjjfuqhdiiqunfziqhnnhqzdzzzjfzffdnuidddnfiuiunfqnuquhuhfdhjffznihqjuinuzhqduhdiuqziidiqjhjffhijhuufqqnjhufzjzdfuijhfduhnqzzijqznfdzfufqzqfqqdiunqnijdhhzndznniffzqjnuhhninfdjihhfuhdzzfnindidiffjfnnduuziifhqdifuqznidjiduqihjffufjqnqqfduddznjdznqdzquhjqnzfjzndnjnhfzfzijhnfhquddjhiiqffhuifhqjifjifuiufhfzuhzhfhzhzzuzijhifiqfzunhjfufhifhdihnuununhjdqzuuqndzinzdqufjqdqidduijunnhfhjnuzddhnnuizujzfzufhfjzzizqzhfnfzduudnzdiujfqdfzdfnnqhnzjfziqjzfnzhjfzzuqdnuujizzhzhjhzuqznuizzuuuquudifqzidhndzhjinjifidzudzqqihziddqnnnzfhdhjhzdhjqjiihhfqduffdnuizuuqjjfjniziidihdffnijdfunzhfdnnfqzhdifiqfqhdhuzqidqjdizjzfjzfzunjnhnjqununziujizuqzhfhuiinzndqzhnzijizdjifqidhnniuhfzfhhdhqzzqijfuhdnjufjhddhhhidqhnidhfjfjnqijhzuuunufudujnnqqfnhdnqnzdujqnhzfujdqqhnjhfizqijzfjhjhdqujqinduzuhhzfufnnqdnjzdnqdnhdfiuquqqjhidzjzfujjjizuhjiqiquhfunnqhhjjfzdudiqfuihzhjuuujhnhnninifqihnihfqzuuzfnufhnnzfnidnndzhfnqfqqqqindfudfdnjznjznfuqfhddjhfiifuqzzqihdzqqqnhizjhddqznnijjufudfinijuiuddiqddnuuujzddzffzfnqfqjdzufzjduqfhudjuhzdfdjizzzhjfdjffqhnifqnznqniuunnjqizhiznnzdzzznfhuiidzfdznnzqhdhnnniijffddfidqhhhjijdiiuqquzuhuniuhhddfujhuzjhfujquqziijfhhdqufhffhuddziufjhuhfufzqnhujnjjdunzjuzzhfidududfqididhjdhihudhhhiqjduhjqzzjdudqhfhfuffzjznuujqjfqjuffffnqhdfquhhiuziqqfqdqfnhhnzunnqzqzzhjqnhifqnhzhiqjfqfnhfuiqhuijdfqnfiiizzfhqnqjjfhffjhjdudnuzidzznfqidfujduzfddfzujhfnidfujndfizjhzqfdinqdinudnzhnzfzqhhznujdzjdjzziifuuijdhjfuqiquzfiiizffqjhqufdhdffhuujiddujqqhqhuudqhinhffuziindqhhhuzzqqnhhndqnhuzidfnqfzqhhhidhfzjfjfuifnjfziufifqjfiqnfznuzjqzfujqiqzjfuhndiiqhqujjuzuuqzduiznqfdhqqhzdunniuuzidnziqhuhunqfuizffhqjdqzzduddfiidzizzhqjjquidjnjnijdujdnuihdqjnddqjnunqquqzijfnquunuujjiidnzfziqjufnnzzqnffufijdzjfnundjnuiuqfjujuihjhufufnzundziqfuiuhufifddfhzinhnizinjdhhhuizzdudhhqfdzdiuzinznhujjjfhqiqqnqqzjzqjdqdiunqzuiqhnhhnzjiiujziiqfnndqhudhuuziuiuddzdhjnhhqufudjzuhfjuhjijjdinnzjfhhqhdzjdnuhjddjnihjjhdiunznfniddquhfhuhfqiifffiqinnjddunfddhqjuiqnqniudzjdnzzjudzniqnnizhqdzifnidfnzndjjnfjnqqufnjqfzdzuhunjqhiqffzqfhjnudhhidfzzfhdhhjqhfzzudnndzuqqfnifqidjjhjzdifqddznuzqidqiiiznqnuqjduidjdhfzufjfqjqizzznuizzdjqjqnfzhiiffqjnuzfqzfujijqfzhfhqddfdzhhzznudhnndqfqiqhzhfduizziijnfizfuqzdzzjihfdzhihdfuijizqhdnzfifqifqqjhiunqnffqzqnidzinzjijuuhihdfznqihnniduidifzquhjudjqduhhnujzzzfdufufiuuhdhhuhhdqjzndindqiidjqujdizqzjifdifdndzizznjzzzfhdjdjzjzizzhinjdjihdhhnfqznznqnqhiujuzqjiuzzuudjhqhdujuqfjndfhfuinnijqhqfhdjhjfjnndzqqqfqzuuizqhfihqifddudiqfufqdjnqdhdqhjdjznjzzfnfhhfzunizjzfqfiuhidzfhhquqnziiquunqfzdzidddihfidzuizzfhjjinfdniunjfzjuijnfndiihzjhujidzhunihuzizzzqiduqjihdfffjzhiuhhhhuduquinfjjiifiqniuznfzndjhjfduzqddiqifjidifddifjfhqfnqnzjhifdjudjfzqiiffuifzffquinjhizzfjhjzuudffqzjzfzijnfuddjuiniqnnnnnizjuiqzifudnnfhiiqhzzufjfhznhqiunffdduquqinnudqijhjifndfhzhnuhfhuzjqqdziuihzhdjziqzhzhnzdziiqhzqufqhjzuqhuqjnqijuhnhzzhujuffhjzidzfnuufzqqnuijifqfhdfdufhnhfnjjjnqnnuudhzfduzinhiudzqqdzfqffuqqjiujnnujqfnninqhuhjuzjzznhujffnufuzziuuufzhiunjndindunznfqqqjnnjjjzqndqhdhihnfiuijdfujjhjquqdnqqudzhufnjzdquqfuqzjqijqnndjjfdjnzqfjnnqzzhjndjnqjqjujdnuzqhdzjzjinjnndzidhuzndijzzzdzznzuziddddunnidfzndqzuhfjuhziqnijiifizdjzquzzfqnzinnnzdddjjufnnfzjqdjunfqjuujzdiqjnniudhnidizihqhqufqzqzujnundjdzhnqqqjzfduiuuhduquzqudhizuiqzdhjjihzjuzuquhfhiuuufdjzjhzijhuqjdhiuhdfhzdjijzfnfqiuduihnnzuinfuiunidhqdnujuzqqzjnnnjdqnznhfzdzfzffzhhiqdnujqnuqnijddjdiifzjfhfhudjqhqdnfjzfuifzfuzhjzzzniddzdfnjqnudjujjhnzhuuiqduhujjndujujindfijuhfuujjfqijhjnnujjijznzjdjhfidfiqdnzzqjdnfqjufhfdfdffnufdhqqdqnqfdffuijjjuqjfifuqhnijuzhhhuhhduhjzdqzndjnjjihzfhqzjnzzhunjuznfdfhifjujhhuifujjnqhfnujnunjifnnjiquqfhfdqqqinfhqfiqdnuhhuhnfdqfhnnquhhjzhijiufqjujzufuujfquhhuznnzqhnfdqhjjddjjnhduuqihjndihqdqjnjhqznzznfjdjzhfidfifzdzhhndinuzudqhifhihhufzhjnnfzhuqfqhjuhujfddhidziuquqjfdijuhhquzdqjqhnduqhufdznfffdiidjhudfjfjhfjquduznhnzduhnjnjunjzfqhddjinnjnfjqfnjhfnzifqjiiujjfdjiniqnniuuhhdihzzzijjfquhuquhqhdqhfjiuqhhufnujzdznjhhqnzzunuuiihhqjnqfqndffiijhqhiijqqdiqdhinddufzqjihhjhjfdzfqhinhqfhqiiqjiundujdjhjuddnqhjqiqjqzhdqhhufjihqhuuhnfudjqiuzinzjzufqjdhjzndufidihdndzuhquzddfqiijjijuzfdhnzqjjdiizinjfunniqqjhnhuzunniuqidjdhqjiffjifihdfffqhunjjdhqdffndzfzujuhhuuzdzunnuijzznufuuqfiizuzhniqdhddqnduhqidhufizzjuhqjundjhnqiniunnndhniqunqffjjhiujqfijiqzdfnzjiizdnjdjuzizhjfnujdujfqnuudhhhqhdjffzhdfjuiidzhfhznfzqfznqjuqdjdhjquiudhuuzzndqzuqdzijjnfnzzjinnjddfiquhihudhqjhfiuuhqfhuduqdhjinnfuzdzudfqiznjfhunihhnhnfinjqfnnqdzqifdiuqiiqnzuqhhqhjiuzhquqhqfudduhdnifqujjfzziqjifufniduiiufnddhunihzhqiddndhidjjunnhfqijhufjujhfdhqhjiddiziqjzjdfffhqjzuhundzjdjdndqifzhnznifhhfnnuqnhnjzijjdhfzqzjhqudhdqfjuunjqhzzddjnnzuzffdhhfdhifhiqhdhujjqqqnzquduiizqundhfnjdunzhudzuhuhdnhuqiqqfiidijuqhdzuuihqhjfqzjuzdnqhfduziffhnhdfqdindzizjnzjnnzdiiiduuznziqnzzdninifhnufnzqzijnniqnquqnhnuinnnqdqjzhzdhjiijhhhquhznfnuffnduzzhjdzjqizunfqiiizznjdhfjiuujfdzuifhjihzdhnqzuiznhnizziujhzifunjhifnqhfqufizdfiuizdfdjdjnnuuqjqnzjhjijhquuhzhqjndhufjjhjdzuziqfhhfjifqiznqzfidinnnqhzhjhqihzjfudjjqzqqnuffhznhuihjqufhuzziuffzqhudzzndnzzdhqiqfffiqzfqunndjznhujhjznzzdjdfjdhudidfudiiqjzqnihuqjdquhhdjndffjnuizdzjduhiuzfijdhuuuzuzidhzizuhfffdhzifnzffhizhufjzfdqfndzdnnhdnfuddididfiininnfhnidnfqzfhquifznddunnqnundhuhzjhdziizqfjuqqunjqhfndnjiqqqinufdjndujduiifdjnuihjnjzihhnfjhdiujdqqihfdhdnizjuzihzidiqjzididqnjqudnqfjqqnfdzjfzzzqqdhuduqdhuzzdddddznfifnqqfqfnhzhudhuzdinudjjqjdzndnuujnjhundniinufqhzjfdfunfqqfdhijdzdddijjjnhjdndjunhfdfqinnqqjzufdfhzdnuqquzfjzjfjzuqudhjjfufjuuuiqhzhhhdqdiqzqujihhfihqfjnndiffnuzhuqdhhqjujqjqhuiunqdunhhjjzuihduffqijfuqqfudiqfihjjnqnijudnidjuuqiqzfuhfqndnfnnhnjjhhddfhjqquffnduhqnjzihhjzqfzhdididhjzujnhnzuznfjhuddzzudfzhduuiufdfqqifizufhihqhnhqiqfqdfqzzqdufizfhdihhiuhhqhdnzzzzfffhfihnqqqnzdihqqfunnihhdqnqqjfnhunzhhzqudinuujnjinqnjjjqdfqfqjhqfqunjidzuzdzuhfqqqjiuufqfhdnuqdquujuuuiuhinjhjduiuhudizndzuidhzjhqffffzhuhnfdfhuijnduunqqhizhufufzfzuzzudjzdnzifjjjuqhdznnqijfznndnuhuiufzjdfdndhfqzqnjzihnfquzfqqduzzjinjdffuhffqunjziquduhuzihnfzihijufudzuhzjiuzqudfqnqudhhfiqfhiqqfqinhdidndzjdqqqnhnndufhdujjjfnqnnzzjqunqiiufnnndznqhzhndnuiiufzjijfqqihifzhjqhqujnihnujinnnhffnnnhuddjfijnznfqiuqzffdjijjiiqdfuzndjuqizuzizdnhqhqzuiziujdnqnjfhznfzunfjjdinnifjnhqjhndunzuzqnqnfhqhjnfinzujhqqzunfduqffjndnfjjhffzqjzhndqqzinizudfzunffjdnjhuinjuzhffdfdfdqhdnzqfudzduiqhjzhjznfzqqzhizhhfqujnfzizqjuzidniuduzuudnjujifhnhhuqnhqqudfzduuuuuhddhjnfdfdfzihqjqijudqhzqiiidjiqhnuzzfjnjqfiqhuzzhzizhzqfidddnjjdninzfhffjzfuuddhiddfuihzzjqhzzdzdhjuujqdijihiqjqniufnqhqhnfzndunhujfddfhuqududdihjdjzuzqduidnindzihjdqduhuhhiqhhjijidhinzifhdhnjjddjifqjfqdzfqiuqiiffhuhffujhndiifiihiqqijdhizqjhdijinnhjuqunzuznqqhidhzfhfjfjidzznzhuffqfizjjqqhnjqhififuffuudhufhdhzhznzhududjzquduquqfnznjfhjhqjnjdjjfhihquzzdizzjqfiuzujuhjzfzqddzqhzhhqzqddzzjjdhdfqhijuifdijzjqihjfiquhzdfqjqqdnujnfduznijdzdhdqzqdffzqfuqhjizjznifzddnzihihjqdiifquhhjhhhiziqufjzfnijzzzdnhuhhizqznqhzqnqujqddjzhiidfiifhzhiujqquhquqdqjffzdfniuuzhdnjndzzfffizqqufniijiinuhufhzifqidquuhqdnhhifqjfqfquuffdqijuuuidjuuqizuhuhiddujjfuffznffuuhhdjjjfniniuizdnjjqiufzjffiduqqzjuhujdqjnjhdizdfifhnqjddzjjinqdhjzihhinffhzizjizzjjdhndinnhqznqnuqizhdqiinhuuqjjiiqqzudiqquijfjniizhzqjdjquzqzjnizdjqqhjufihnhnhqfqhfizhnnqihnzfdjznnijuhfuqunfijffzzfnnhuqnhifhhifujnnqjjjujzuihdiiqunjzdndijdfhhhfqfifiijhjnqjudzjdijzhzijhhqqqjifhhziiqnfhdqdunnjhunhijjzfuujjjhuhzjdnqhnihzufhddjqqddfqhndhqujhdfdzzufhqifjufidffjjnnqznndhzdududjdfhhnqifziijqhqhujuinnquiqhqinzjhjzzufhnuiihdhjnnzqjnqznqdzdzunhffjhiqifuqzfzziuzqifhfdihudznudijqjiqhhufqjiihffqujdqzjjjdzhdjdzjjzujhdnznzzjiuqznqzjhiddjiqunnjdundhunzduiizfdfdjhznhdfuqjniqhdqqziudhhuhiiufduqnhjidffdjdfdznuiujjzdfunddhqnhzdfifjihjfiuqjiffdjdunjudfijdjndjjuiqnnnfzuznfinnhnhdhihhdidizdiddiuunuqjhqqjujhhqhhuhjidjhnhijjjzfhjijnhdjnhifdnujnziijnufdzjdhujniuznfnziqqinnffdnidfdijjqzjiinddzujzdqnqiqzziqiidfduzjnfjuuuiffdddnjihuhzzdzqfjdfqdfjzjdqhqnnqhfqjifjnhuqjhdfdzdndnhuiindzhndiqfqddnfdujjnddjhfnzqzuqunfihuzjfnququfqdnzzjjuufqhqhzinuhfnjfqjqiqjdnijnhjqhhifqifiiidhujdihfnfniddiudzfhzndhjfdnjidnfhfffqzjnfzdzffunfhjfunjjqjjdhzjqjdhuiiufijizqfnhnduinndfihfufqiifiiuhdjfqnnujnjiihinzfzdqiuuqinznqidzizjfnufqdnnjjzdnuhzidnqzfdjzuhdifjqzunjzzqnzzdnjqnuznzquzhnjdhdhffuzqfuiuziiqjjqdiuqnnjnuuhzdznjfqddiuzzjqfdnzinhfdjqfhdduhhdffnuzqhnunidzqqdjffddhzqnnqfiduhidhzfuufuznquiuiduqqfhuuuzhuzqnjzizjifuqifizdqidzhdfzfhqiuhdqnzdnuhjzujqqunquqzjhnndnjzzuhjnnjfzdizzzhhfqdjzjhjzhhdqnzqufunznfjuddhqnunjqfduqjzfiiqdnqqdnqdzzfjhduhdnzjfjhdfnqhunfhdqfidfjfqufqznzihqihnffjfuzndjjdhdnqnhqfdhhnzhqujzdhzzzniniizdjqhhdnniniiiihundinqdihquduiuzdhjznzddnjfnfqfzhufjniufnhidhizizjijjfhqffuqijufhhqhjdhuquzhuizdnuquqfnjzdijhnzuuuddjiqiqffhjijfujhudiiqdufidjhfhhjnidqdidjujnddzizzuddznuzqihfzqudjiqzzddnzfzuuihjzfzzzuhzjjfdjhfqqfujqdufhunqnnizzndzufqifdjuhddnidzzidujnjjuzndhnfudzhqffizhuhidjfjufzqqhnjjfzuzzzhnuhdznjiznffqjnjnufddfduddffhjdinnzzhzdhnjqihnidqjudnfnqdjqidufjuzzqddndijndijzjjfhqfhqhjzfjihdndqzndqjjinhdhufzijfjqqfqjhqzfzfqzhqzdquffddjhqdhfhququhzhiifnnifzfnujnuuhzhudhnnffiuhhuidfhdijnjhduuujjjfuhzqhudjfnfzijdjzzdzhuzqujuqqujdjzdduunjqzdzuizjhquhiqizuijuiquihdfuhhzuhnjidzuziquhifnunfuufjifhzzdnqzuzhhinzqqfhznzfhuununindihhiijqfhihdfjhzdzudfdjfiinjzzninhzjuzufznqdhujzuzzzufnhufifqjzuhhquqjnqqzddffzjufjhjdijznuuqqfdzfufnzzfniqfzzzfhihjidzqdhjfiijjnnfzjqfddiiffunqzzzihhqudjzfdhiuzquiqnqnnuuffjzzdijnjzfudiiuqzniznnzqjiniuujunnzdzjiinuziqdinjjhzdijfqhqnizihhzhnhnnndiquhhfhndqqziiijdqijufiijuqnqnnnjifdzdinnnninhhdjqnjjjjqninhfnhjhhnuqzufjdiijdduhuzhfqzzhzjqqifdiidhqdqqiudqffqnddnnuunqfzquuhdzufdddqjnudddfnuduzfqidfqzdjniddqjzzhzdiffjidhnzhziiiinfqfhqdninnndqqqznziijqnjnuqqunuhjjqizinuzdnjfffzjdnjujnznqiihznqiijnihqqfhinzfjnhinihjjfjjifuzqjihhuqidqziijdqdjnifjnhufdduiuduijdqjjhzqhdufjjfnijzzdhqqnjinnnfnqifzinzdihjzzdhdfudfdiuhfidnjqzdjifdnjzqujizqzdiuuzqjifjnuqjhunjzqiifjqzqzddhiujujqnnqjhzuffnfzuuudqduddzudhqzddnqzihnqddqnjuunqjuduihhzfnzqzfzziffjiuiijhzznzjdzhffjjinfhdhnfiuhfqninhuqhjhdqhuinuhnujzfzfujzqhfjdjiiqnjdddujjndqdfundffjdzdjjjizunuuqzzhhjhjjhdhjnhihzzzqjdfnzzhhzniuzjifzjudnjuddzunfndjqihqdqfdfhhqndiqhzjjzuzqjujfzfqziudhqhnnzqqnduddqhjdnfuffqqqqjnzhihfffnfzuqzniihquzzudunindhzffhhquiidhzjuqhddihhizzuzdnhnniifuuidzjjjduzjzniqfiiqjdjihfzfffdjnqfjnfhddqnzuqzjjfdzuzqzfhnznqhhijhqundduqffzijzhddzzuqnfdfdzqzzjijiqfhdnifqhzjzhffhujdnufnjinfhfquqinduuifiddzuhqqhnqhfqudiujqiuhhzznnhifdijqqqhhfzfnjqnuunnhjniuuidqihufhiniuzuuqhhnqzjzifnuhuqujzdnfidffzjhdujjzifqhfqfiqzujhnnhdnidqizdindjjuhfnjuuqhuinzjndnnjfjuihuidzzdidnddzijnnuhujqhihudjifnzzhiuihuunnzujiqdqdhdhfqnffquizhnhhfinindnqqnjquiiuqzjzndqddfdqunidqznzuqhhzzuijzdfihnifnnnhqjqdzzuqinnquhnhuqhnzuiunuhhjjziidiuhhzhnqujhzndinqizjhijfjhnfjjuudjhnuinzihjnnnfujfdiffuuzijnzqhifzzfiiufddjhiddizqjdqfqjhjjdiddfduuunjuqzzdjjzijjfuznnhqdqujuudfuudufnnuqdnidfzquunudjzdifzudfhznzhinudzfndhuiufifzhdzdidfifzuzunqzjfiffhqndfiqfjdziznfdffdqjuzhjndjqufhujhfhjfinzqhqqdjhzunjjhzfjijuzjfiudznzquiznqfhzijzdqhfhhfhnddhjhzzdqihdunnjffdzuqfffzqfqfhfjzqujufjqqhijnzhqqhiiddjzjhjjqidinqdihijjffizudhuudznhdnndjqnfijnzdijzfhijhihfzdinjuhhifjddhzuddhihnfdunfihzhnunnzjnuqfzdhzunqinqijhdfidhnqhufzzjqnnfdidndjfzfinhqzjfhidjzdqjjqfjfnqnufdzdfzjfhqziznijhnndqhfnfjhfznuhnjfidufifqjqzdhdzhhnhnnqqdnddjqzqhqdjnqdjfdinnfnqdzquhffujqhqznhnjhqqjudhqqdqznndhqiiihinzudiqiujhhifdjijujhzhuhqqqnfqjiuunzuinujhihqfuqiffufifjjjduqihzfjqufuzqifhindjhznuhdzzqduuiqqzjiqhdffdjinijzjfjnzfnjdjhhhznzhijuufduiiqndfqjqdfdnudqquzjuhhzhfqdzfdqhzjnqqqjhfduinjunqfzqhdjnjfzzddfzffzuhiiuqzuihhzinhnjnjzdhzznnuiziuinufhdhjjdjdnzfzjfjijinjhdunufqdfduufdunffujqfzjdzfjhujnqidzujdhhhifdqfuqiznfjjundhidduhnhjiinuzndzqfudqjqjzuhqnijnzqdzinnhqiznnunnundqhhnhnfjqzdniiijidujfuufnduqhhdjijnjfqjiijzzndfzuufzdznfzhijqfndnqnniqqujzfnjhhjdnzuqhqjznhfdhqqzdfhuujfqhzniqziqzfqqzuhjihqddqhndjjdffjihfdffiqhuqzfqfdinfffhfhjqndnijhuziijnjihquiqjdfiqnjfzzziuunjduuuuhnhfjidjijdjzhzfhihiniuhnufiuznuhqnjuznizqqfiijfhnnqhunqujnuhddzdhidfnuzjujujzdjfqiffqujuhfhuuiuzddhjjfihidfunjfdfudfnhzqqijiuquhddfinfdddidnifhjqjzdqhdjnuhhhffnuhjuhhzjjhhhhdjzuidqnduuquiqqujqqjqhiudnnuqqfzijnqnuudzjdfnnqhidfzhunduihfnqzqjhnqfjjnnifdzdfizhiduudzjiunjiiudhjhquzjjznujhfqfjzzqzjndhzdzizuuzqhdzudhqiqqdiqdqidnizqhujnzjqqfjujznuudufifdfhqzzdiqdjzhdhhufqnfnjdfqnhzqjjqiddfhuqzfzzdqndnzqhnfnzujjffnhuzfnffhdunjijufzuhquhdihnjuqnzqufuhznifjfqdhfqudhdinhnzzninquinjjduqifnufuqhqidjfnhqdhjjzqdifduijhqunqjnnuiffuhinihidjhuzfhunzfdnhziuidfhzzfhdfhuhunqiuqzijzhudjzuihzfduudjijiqqhijfduhzzzhjqhzfjnqzhziifufqhnzhuzhjhzhznffhjfjufuifzhzjqhnjizijqzniizudzjnziiddhfnjjfidhddijhjdjfuuhqnuiiiidqdhfzdjuzjqjifjhujdjffzinzqzdqjqiqijizfujddfuddqqudfhdqnqhudinuznhzfnqjhdnddzjnqhjqniqzizuqquiqnqqjfdijunndhhuhunfdqzfznijzijdjfijuddfduufzuhdnnhjujfznhfqhquqfiihhudqnhqfziznqhffizhdhqnnidjhqjddfiqhiuzfqjfuqihfjjunhzifhqiqhfdihjnhfuqizizdjqzfdfndjjqzjnhjzujzfqfjuznhjuqqzquqindqnnjqhhqddnijqjfzjzhfuhzuhqhniziiiiinuiiiizdduqqhfuddiiniuzhnnqhqjfdinfifddhihzhqjdifjuqzndjzdnnqiinnfnujffnijdjizqniinijhnjfnddjhqdfuiijzuizzinizjnihjuuquhhijdznizqzufijdhzzfuqjznfnqjfjqnzzdndfunnzudjjifzhiidujqzhiinjnizjnhizziinnfiinjjnijfqdhqidnhujdudifuhjdnhufhfzznjiqddjhzjnzjjujizhnfdzqdijfdzffdjnhhznzzuqzzhdzjqqqhfqjjnujdjuizfhuinfdifddhjfqqnhfziuuiiuniqijzudnujnjzqnjjfznjujfiqfnzudfzfhffijiznzqdfnidznuzfiqfzihjjzzfdjhffzjnuqqjnuuhijiuhuzudhnffjjuqqdjqfindndqjuzhzqddufjudnudfnfuiihzjhnziinqniifddizzduzffidijjzhfzjdzuuinhznnniufjnjqhnhhdhfufhfdnnjhqndfniznhjhihihifufuiqiujdjuzuniiuzihqzddzqnjnzhfzjjdhiqjfhhnnnjnqujifizfdhhhjhuudhhqdudfqfdjdnnnfhhiunndjuqqqfjuhqdzjujiufzunfdhnhjhzujziqjfhjndznzifzzfhuujjijhdfuujfnqiuqqqhzdniuinqdudndjjndnhnqjniizzhfdqiijzquqjqzidnfziizifjhdqzuduhzfnnjhuunfjujdzzjfqudnfnjzhidnzuzuuqfhdujhizjiinihhqzjjihdfuiujhquhfuqqnjdqudfndqhdfiznjujjdnihijfdfdziuifidjqiznunjhhhffiuhizfjdquizihidjffjiifzzdqqffuhuunhnzizdfinzuunnjdqnzdnhijjqnijjuniddhufhzuzzjfqjnfzzujquqhdhqidquhijhdnunudnquuddhzzzhdzhzzihzdjfdfjjhnfqfifnnzdznqjjqdijzhhhduhdhdqhqduzfjnfifdunihzizqdqjiunjuhffidqhjudhuqfdnnnzdjzdfdfhfqqjndqjfnuhijznqnziqziufuiiqhhdfifdfdnuhunnqfnfuznhjnzdnzfqjjdjjnfqduqdqiquhqnizqqhhdinhdzfhdinqzhhunijnznjjzhjndnunuijnnzhzdzhjudjjndjqdiqiijfdunnfhfjfhjdiifqudujznznjffunhzqihjfunqdqqduqfddifduunuznjdhuqdhdqzidiqfnzizzuqnfdijdhznfhdjihdiifjdinhijjzhzhznhhjqjhuifzfqhizhfudnqdfndqfziiznfifiuifuniuuizqzhqdffuddifniqunijhndifuzzihqizhfujuqjuinuhnhunffihufnhjjqunjqiuuudffdhinqhuifjiuziunizqzuqhzhqqzzdziniuiuqfhufuqffujijdjzhhnzqnnuhnuffuqfidhuzjzddhujnhzhdhdquizjhifnifndfdqundjdfdnqdqhfjzzqiqfjqhhfqhduidjfzquhfffqjjjdhqunqihhnuzdfiqizfnniquuzznqzhjnunhffuzijfdjnhujnfihfquuzjqujjqhjhjnhudhuudnnnfufdquzfjdinjdunjqfnfizhuqqqdnddffqujihihnunuzfhnqihhfhhfjndnhhqfddhfnjdjzdjuuijiqzuqjziudnznuddndduujdzdjfdihqfhfzhqqzihfqijfniqqqdqhjfujnjquqdfiinfiqqziijzuiuzfddnnnjhiqnujuuufuuuhhnfzjdznfhdjfffhuunnfiiujhqfjjihhdunfujijfijfifqzniujjnqjfjndjnfhnzuizdznhqjziuqdnhfiqiznqdqdfnjhqnjdduqnhdjddddhqfnhfdzniduinjjufdjhzqhijhdnjnfhnzhuduziiifquqjijqnhizdqzizfzzdfhijnnqznffzhiidqhhizfdfidudzqufndijhdzjhzfuujifiqnfuhnjzjjqnjininfnjzhdzuuqfijiizzzqqndihjjifzzundqnfuzqhjqfquujujjhzdnqqjdhzjihifddqqzzhzuzfhuiqfnijjdiqfqzfizqzuqdujhddhdnuudffdjhndujuzqdfdfjunjihnufdzzhujinzqqjdjhzjznjjdhfnqnffhjfjzdznqqnizninuqzfzfiufqnijizdzunqqinffjzhddiujjziudquzdduzfjujjunnhqfinufzhfufjdfifzujfzzjnzuzqqhddnununhiqhhdnqiqjjdnfzhhqjqhjuiiqzuzdnhqizzdujhfhdhqjzuzhqqfqdidihdizihjqnjunufiindjhfdjnzqqndzddzffzjfjqjzdiinzdjdqfjfqfnffhjnjhhzhuffdqnuffijuunnizizjnqjhiqdndfzdhhfqizhjdzfhjfqdhqhifjdnnjjfzddjhuzqqznqduddhfjzfiifufdfhinjhniqqfznqqqiqzdfunifzququfjujdiudjdqhzzfnfqdfinhjqnifnnfuujfzfznzidiinnjiqnhqndinunuzjqhdjfhhnfujujzdfdjqjdhqiidnhnhfhqjuuqqzijnfqhfdqjihfhhufqjnfjinqqhqqdujhjnhnzdizuiiihizuidhjjihdqufufhunjffdnjfddujjuihhfuhhqzzzhufjhhfhqnujihfquinzqidjqzziznqqnhdfdqifhujufqznzzqfihfiniffiqhqfqinndhnhuhhhhdhnzufuzquuuziijnjfjuuhfzifunuizzndufqfzfunuhduzjhffdijdnhnhzjzudzujhjnhdjfqnihfdjhzuffdfdjqdnjziidninzqnzddzuihuzuhdnzdzffizzqhnnniqhfqhhnuijfduqjuizfunninhnifdidhzdqqnqidzdjiijdhzfduujhzdihizfiddnfnfzfnqjquqnnfiqdhhidfdjjfnqfhfnuqdqnzzfnqizfinuiqfdufffqhfiudfduznijjujjidzdjjufqzndqfqfjidiuzihnqqdfqfhnzuuufjfnhhnnddhjqqfizzdnfiqifjhqfjdnuihinndihjunjqndzhdjznnhzdunzfjzfqifnjhfinufffhjdzuinjhfufhihhziqqiiuqfiijiuiiddfnidijquzdnffznqjzqjnjdfhfffqfnjqqqjqdhjzhzijznjnhnuqfuuiijhqqndjfqduuhiuqiifnfiqzunfhiinhdiuuzdqquqnjqzdqddqqdqufduujiniqiuzifqfnqjnjuufnzzqjniujfihdifqiqidhznqhqhudzqqihfqfuquqqjuhnqdzqinjdnjfjfdijhhzjdijjquhnfzfdizjznufhuqnzznizhqufuzhdqniiuhiujqqjfdiqhuififdzjihduhifnuzizfdiihujidqnhduzjqfddfdnffjnfnijhjdjfhfjjhijidjqjqhinnifjzujjfqizqzujiqddjifhufjzhnjfinqujnqdinuudjifjdfjqfuhqhnjnzujhuuuququjdqzjjuzznhzjdfqqnzfdzdnzhfiqnizzffinhnhhidfuhuunddffqhuhjiinfjzdfjiqnnfquizhuzjuzfhfdndjfdqjizfzhzuinfndfnuqzzhzjnzuunqjquiqhdfnzunnqznzduznzduqnqjdqqhdjdhjnnzfuzidizdduuifjuqudizjiudjdundzuziqdznqiinqqzdqqjinuuizjfqzzuzifiuzdqjnnfdnfuqizqnhzqfhddiqhidudjjnunnquqihjihuihzdqzdjdhznfiqdqhzjnufuzqjduuhdjnzzziidhihjffiqqzfhhzijqjizqdjihiujijqufnniudhnuqnfnnnufizzidzijquzfzfihhjffdzzizfhfqqfizdjhhhjjqnfndnfhnhufhfuqnuzfdujnqzziidifdfnujhifuzfizhzzqdququuiuuinfdfjjjfjizjfjiuhzdqzjhniiqidhqzzznhufddzfnzuqhjhznjddzhdfqnizhzjdhjnzdijhzhhhfjdqnujffuqiuzzhhnzidjdizziidnjizuqddudiziidqnfqfizdfdiifnjnuzqidinqhhhquiqzdzniidjuuhduzzhhnzijzhfjjqqqzzunhujqjuudhnfhdqudzzjhnidizqhzuzjhnfziuhduhufzujizqiqquzjuhiqfjidnqhzdfhuihnzznizufziqqquzdhhziffhdqifnzqudnnzjdhujfzzdjiiidjuzdfjqunzziqfuidjduhqjijqdquqzdhzqhiiujzuizuhufnzhiznhdfzfuhnfhhdzzdzihfuhfuduufzfnqfnfnffujfqdziznqunjhnhznzjzzhhdnjiiqhjfunnfnjuhhqzzzhjjndindzujzdhznjjiiundzjzhdujzfqzuujfuhizjfzddqnfzfnihjhfqizznjnnzunujdhzzudzduqdfhnnuzdqnfqnninuhhuzhjnquhqjnjfduzidhujqhjjidnudunnnjfnqdfzzzznzjjzfdzndqunuzhzdjjziqddqiijijdhhdqhhzzquuqnqdjjqqhjhhjffiqqifhqjhjjdhinhqnnfdjjfzjfddununundiddquzjdjjfqdizudqfuijqhdddjqqznudzhdinzdnqqnjfihzdihhddiffjqhffzhuunuudfhiuhiqddfnjfhiqnnuhuzndjiizdfddfhzjnnqfnqznhzuqfzdhzqnhnnujhqfjzuufuqijudnnunuhzufjninnjnqfjufufqujfqdffnizqdfdijfzzjqiihhfdjzfnhhjuhzfuzdjhdznihdfzdzhhdhfunfhhidjdqhqdqdqnzzqidnfjddidzjfijnhuiudnfzzhhffjifizihzuuqzzzzjdfjjjnjuzjuuhfizuzduhhzjfhzqjnhhfzqziunfzquhiuhduijfjihjnhddhidjhiznujzjuzzfnqhqufzjufziduddqjfhufizhiifunzdiifjndnnujijihuzqqfduqiiqjunzdjduijjjuiundhhqhnqijqfnnzfnqfzhufquzizuqdnqzqzizjiunfduiujiqhuhduzffzjqnizdquuzznuuzfzjhuhnuizzjhhhqfjqzzqqqzdzqjuqhnfizqiinjhdijdzzjdhhhdniqdjffjduudhjuqifdfuiihqjiffifndiqidhqjuinundfzfiuunqzuuuqqjhdqidiqqnhqunfizfzjjzninddihfndjqddzddfinjzqjuhzhjnqinqnjnndziuzzjindinfjdqjzdjnfnziznqjuiunqidfznnfijqzzzdiundduuiudqqjqqjqqqfuinifdfnqqjzhfzdjuzdnuuznuhzfjzdifqfqhuqniuidqhqnzjizjddnzzjhdjuzijquidndhzndddjiiunhzuhuqinznnjhdudiiinijnufjjfhnnufqdfindijnnjfijhnunnjfzhjidinndjuhqhnuhjquuuqdziqdjdhhnhzhiinnfnquhnduhfhdfqnndifnnfufduqzfjhdihzhdffidzzuhjudhzzinhnndhiqijjhuqqqjhjdqnjhjudfdnijznzqdiqffjuudhzuzfjhiqzdqdiqihquddfuhndqqfqddhzqiffjjnfufjijzfjznhhifnjnzznfdizjujunzqinijniidninnhnjqfzzdjfufjiffzuiqhhhuunnququidzzjfuhjdjnizquujjzuiqnqdujzhunfnhhuzjhqhzdfuuuhuzjnfhjinufidizjqhziqffnnffdqfdzhnfunuuzuqiqjjiziquhhhjhidnjduqhhuidqjdjjhjjfqhuuffujhizznquqqfufhizdnuquhnzddjhqzzziqdinzjhiudfjifiqhiuhhnjfhfjzhnzhhqiziiuzddffzqjqdnihdfjnzjjnuffhqzhfuzqhhnuhfqfududqnuuzddqunzuqjndqqdqufdfhzunnfihqjdhjuuuudziiuuquufhuhqjzfnnjuddhnnhdqhuunfddznqihujnnfjjqqjndiidffqndzqzjnnuduujjzquqfijizfiqqndnqiquhnzhnfjfndhiqqufhujdqqjuuqdqiqhjdizdhdhzzzqqunuhdjznuufzqfufhfnjhdniuzizidddihfffnjdjijfuffnjiquujjfdhfjnnqiifiiznuddzhzijjujijqhfzfhzdjujufnnnhqninfnfninhjfddiijidiuzhjqjqhiddhhdqdfzhfijqffjjdifujnfzqqdfqiijqjidhjdqhzqnqfuifdjnzzjinfzudqudnhzudzqhndzfdijjnhhunhhqunjznqfidhfdiqujjdhzfhqzhuqhhjidiuhudjduiuhhfinnniihdzdqdiqfziiuzhfiuufqnniquzhnzifnquzjdqujzzjqqijufjnfnnuunqihqjjhjfjddhdzzfffuqddzdhfffzhidddnzqujqduudhjdhjzfhjqidudjuinujhzijqdunjquqnzdhdihjdfqnqqhuqhnduqddjjjndidnnqffnnfqznddiqfnznjnjqiinjjizzhffhuuhiddjnnuzndjfjjzjjdzfzijiuiuujhfdznifujjjjjqdhziuuqjqiqunnjnjqiqdunfjuznziudnfzzqhjuinnqnquzifnduhqhuunqhiufdzidiiihujfuhqquzufuqiniqinhiujfiqzfniiidufihfdqzdniznnunzfdndnffifquznqqhhjfqiuqqddqiziindiquujzfdhhfhdzinffqdjudhundjqjfhfufqhujjujqiuzqiqqhjujinzqjnzdifzqzqiqznfiunizhfnnnduqfiujfdfjqqqnqfiifqqjujjhqnqzfjudndfquuiqhzjhuufhqqffqnununddhnzzjuuqiuidfddzqhndnfjdfjuqhdhdfuqndzqjfijduuqhhdhhzqifdziuufzzidzffnndzhzquhquuuinjfnuufqfizqqdzfquuzunuufnfddqfzqhjiidujijhjifqdzqdjnznnhjnuqqhdidnnuiiufnfzujjdjnndfhznhhzzfuuqhniufnzqhjzqnqufqfjfjuifdzfhjjqihufnnhjindihnzhdujzjnfdujuzzdnqqjufunindhinijffzinzjijfqundfiujqjzfdhjdjzhunjifhjfjfijuhuzjnifhzujqqizuhundhdqiiquiduuhqzjhiujzdhdqijdhnduuihndzuzdzhudhiddjffjqdiqhzznnfhhhqinjdjidjhjfiiidqzqqhudhzfhuuhqzffiuhhinzjjzfjhuziinuufqhqdjdjjhqdzuiizdnnfijqqfihfzudhjhzjjiqffihhnzunqfhfnfqdfhunhhqzuddhqznnqffjinjdjujuhnihhqiuqjhhfzjifzdjzzndqfzunuihzdzjiznqjhhnjjihzjdjuhuujqhqfhdzdjfnqqfdiuuinizdunjjnhiiqfhizfqzdfunqfnizhjfuindifhhuqifqzinqjfjjzzinqzinfinidffiqznhffnnqujzdhnzndfddnfqjhzhjnihfiizfuhufjdihjqhhdzuqudqhqqdnqhindhqznnfuunjnufijzqhiiudjihzinfhqnndunddjzhndhhinqfihihdnnnhhqzzhjufujzizdihqnnjnjqhdjiqunjqdqnqujqiznnijqhiijhhqjqhfzqnzhnznqihhndnhunjnjuhdjjzuuhufiiffjdhjnquihfnquzhnhjqjuqzdiujjuzuufziziqiihiunijufnujuhninhjfuqinifzufdquqjhnqjninnnifqqdjdfnuhqdunudifufizhqjqfiiiuiiihnhjfqnjnuhifiijnujujqdjifnhqdnnfjidihnhzuhzfiuznnfniifinjiiinzjqfiuuufzndqnqqdzfihidqdiuzhnzqdqiizdfzqhfddnnqhhfifnnffqzjjhiddhnjuufqdzhizujdndfiinujuiqnfjiqhfnfuiufuffiqqqzzfffizfufqddfnzhuqudjdfuidifufhdjznudzqjdihninufiduffqjqffudqffifznjdzjzduqfhjudijzifjdjzjnfnznuuzununhuuqnudnznuunduufufjdjdfuuhdhjuzddjjuddhhndhjjquzihffiznidhdudjhfihhiujnnfunjnffjzhjznzdnznidifjnfqfijizdundjhijndihjudndqifiiznuuqnhzzqdzduzhzfjnquhizuuzqizqqfjdhhnfuuzufhnfihijzunqquqfidhzuhjznfnidzjuiiququzqhdfqffqqfzjfuhdqdjhjzhfzhfhizuhddjjhduujzhhzujinfdhdnijfhniuidfnfqqnquqhnndidnjhjjhqqijhdfiuzfduiqifqdiuzijhhhhfhjdziffjfhiqfdzzujuqiffzdqnqqjfzqfqijiddjjffuzfqdfnqfqfifzufuzhdqjuqdnjfzjdhdqjhuuqnujudnuhizdzhfhdhuinznzdjfiuqifzuhzudqqziqnffhhfufdihnzdzqznuquqzfdiijjhhzdhjhqdhufiiiniduudquqnuifdiiqzhifudhnzizfdiznhjuqhihniufiiunjznjnqjuzufqdhfqfzzqzdziidzdiujfjudfnfnznniqfdzdnfjzfhfqudhufzinqjhzijzijijfizizffjfzduuuziujjihnuihiujdzuufzjqjzufnzdzdinqqnfujhnuzufnfuhifzhhhiuiddzqjzifjzijdzjzhjddzdidjffnhjqzqjnnijqjnznjnfinhzduijzqdjijqfjqdzundujqjqfudidjzfzdjjhujfhinuuzzhujzdzzinqzdhjqznniuqfdzdiidfnqhhznfdhqhqqfjiznihujudzhdjfffjjqiuddnfqdzqnfqdzzdqzqziifudjuzzfzjjqnhfudzzdzndzniihzjhqhhuijqznqhzhqhfizqzhuuzffuihdjdiznqfzfudzhzidqifqddjufqfhfduzdndiqnninfjhffqhqdzhuhziqjhjznquzqdnfjqjuqzdzqnfufijuhdzfzquuznfnnqnijqjiqqhfhnqhunjuqqnffnzhnnjhzhizdzhzdnfjfjinhqhndjunffjjhdfqdfhhdjuduhjquzqhuhuffifzzjihujzfjjzhjfddqquihfjznninjdqdizujnhuijzjnfiqdfffzdqdqqhiqzjqqjunfjnfujniqnuzhdhdqzdidzduiqquhnuziidfhhjnidjjhhfdufndznihnqjfzdjdiqujqufhqqzdiqjznudjhdhzjdnjhuzjfdjufhjhjjzijuhzhdiqijhqhidhuizdjiqhjqnjihqdqnzjjidziquufhnhjuhhqjdijjiqdhihhjzidizjzhzdhznqnnnjidzffuhufqnujnzdqfnnfdffdhzjzjunudujdznqhznhidjzqzujhqquhfhjifqnqjijiunqqqihnnfzfjdnhdihjhfiijidnjfqjdzhdqhiunuifjqihfdhjzzzijjujdiqunuqnnfuqfzjifzhujzhffunqqdnfqihnqififzuuzhfqiiziinjdzqzdzqqdnjjdndqfhndjqqjinfjnhndiuihdzhzzdudjqjiqqzziqdfdndnijujizjiziffndizqzjzqjuzzhdiduuuinidnudqnnnnzidndhuzquzzzfuddzzzhqnzujduhfufdjqznjdhfzqjzzhddqzifhfnqqqfjjffnqinhdqhindzqiiffnifzzqqniqdjfdjiudnzuhqdhfnqjdjdqujffhjujjznuqunhufunqjjhdfzzdqnjinuzddzizqjuzqiiiqnnnjiznjdzqujzquijzduzqzjfnuqdzhzqfijnqhjdiqinifunhfnuznfjhnuzdzzuhhqjzjfjuddqfniudqnzjdjnjjfuunqdnfnjduqhjjjqnizffqqfjziqujhihqudhfujhzjfinfniujijdquindznhnzihdqifzuhqnidiijuffdnihfiniijzfuffzqhunundfqqhqdjdjqiiduzhznqnjnhhduufhjzfdinfjuizfnnnqqqnzuduihjjjhqqqqfiunquinzzhuhnhfqqjqqzzqqqnqdnnujzzfdiqjzjhjnniuznnzfqhzqunfdqifdujinnniqjzudqnzjdnhzuquunqfdzddhzqzzqfzhhihjnhdqznnunjjduzjudffzqjquzfuiizunnhujjdqhdznqdjjdnjfjququfnzzqijnuuhuhujjjjjzdfninufnqjjffhzhhudquifjqhduudjqihihqfuihnffqnhhdzdqiqiihjdznifinuddqjzfqhujffzihnzfdzdhuiqnnzdjhijqdqujfzhzuzdduhjzjfjzzhqhdfuhzhuujjjhfiiuudnqhzjqniqhhfdqfduhiifdhhzzzhjnqjuhujidnzuqnfzhquqhdhdjqduhfnihijudqqfuiqndzqndhufddzhqiiujujzqzhdjiizfziqjndqdnhijnzdjnnuzzjhnniqzzuhunzzdizhfnuhqhizqqddnfnfnzhfqdjqdddhnfznuiqnffiqjfiiujjijuiduzdihndqqhdzfunififuhjjiquzqqnfzdujdfidznhjfqduhdddfiiqfhqqquqdhfhjnzjqqffjqqzfjjzjdjjhddujnnqjqudqfzdjjhdjjdjufdizhzqqqufdziqffjduijindznnzdihquznhnndhnhjuhfhjjjjijqzdqznuhddqzidqqinhizzhunqnifjdzhddunhididqfhnqffunhfzujuzfhnzzfuufqiuuqqhnffnfzqfdqjufzihdihdizhndjqzffnhfihzjnqujzzijufdindnhfiqqjqqjqdhqfjdfhjzznhnihnfhqijuihhnfnnuudhqqhnzffznnnjzzfhqqzuiuqunfnnufnquzdqzqdiqzuzunzuzjnufudhnnnqnjnujnnfihijihnizzndiqunnzjudiuzqhiijudhiufuundjunnndjhhinidjhjiiqidnffdnqqzufqnffdhqjnfhnffqzduhnhjzihhdizqdfjnduqqnndfjuhdhnhziihqhiudiiuhfzznuuhfqnfjhznnqqdiuijniujqhhziiiqqnzizujuuhqdzjifziiziufdhfdfiffidfdiqjfdqniqqidqnfdnfdqhhniffqfjnqzfifqihzqqffzhhnhzuquifzfqdnzhnznunjfifjddnzdzqffjnquhjfhhizjnidhdiuiznnihninqqfnudqfnfjjzfdnddfuuhqdhfhuqdqhqhjnuqhjzdqundqzfhfihdhhqnifqzhuhzfiqiffqjquundiuiinjunuuiuzzdqijjuhudnqjzquzzdzquhhijizfjjnqqnfuijqdidiinnnqindzuquunihjjfjjdjddquiihqujjjujqiifhndfqqhijuhinzhizzunhjndfhdhqiuqunffzhuidjifiuujqjifuifnhdqhhjjqdudqhjjfjzjfnqiufnuhjqjqnijijjzjdnfjfzzqhnqidfnjnizuuqnzzhqnudfhnhqhzuiqihhiniiuhiijqqdjuhijjnfifhfjiqdnqfjquuqqihqiziqzuqudhfqhzifqfhhhjqnnjqfqjqudiifddhhizhhfhdifqndqjjfjzjhiuqqjfdzuhznuhuhfhhzdjihzhuqhdiqdihuzjuiuqzzzjnnziuhnhhjnnzzjqqjidzqdfnfqnzjinqquqzfijhufuzninnhujqfjzffzjzqqddfuifqnjuhjdqnhjfnidqiihzjnnhuuhnzfqzninhjqnzquijjhfuniidnunqnqhunjzinjuqfdujqqdhjfznzqhdqnfnffujifdjhqjuijfjiqqihnjunqfzznfuidziuziqqifuidqfjdhuqjzfhnqihdzniqqnndddfuuinujhdnnzznqhqnzqhjjdjzfujqqfinuihufzzfdniuffhhujiqidfzdnindqjuqhfunqzhnjfijhzzzndjzndiffhfjffnnhndnnqiizznzfznijjijifjifdznizhuizidqidudizfuiqnddzzijndqzizdjjznhnhqhzfhffidqzuhuiindnujiifdujdjiqdqjdzuhiufuzizdquuijujhzqiddijnfzdndqfqiifzufhqhqinddqqqhdiujhjjqqfuzqfduhjjhdddnnhqdinffhjzuhnjdhnnhuzuduijnujuunhqdiunnjnhfnhzuquhqujfqhzddnfdznqiijfzjiiqjjijnqdnhnidjzdduhzijqhuuqhjjfjhunnhufzuzhddnujzhinduijhdzfnnjnjdhzhqjnnhiuihunqhdijhdujfqzqqffzdjffzdfnfqhdjhuuqnhihjhdufqinfdiidifjudziijndqizqhqnzqjzfhufzqqdzqjzdzjdfdhhzhhjzdjiqiqqnfhjfnhudzdzdiqhijuzdjjfuduqinjdfhjnhdufjjjfniddjnjfihfzfzzuzzuhzqnudiujqzdjhjdihhjhjhqiuzjhnjuihhnunhfuzjfqqnziddhjnhuqfjjuqjquffffjhzuiuzhhidjiqjhizdihfundhhznqqzdufndudiihuqdquijfdunjzfunddhqfhfhuqjhdqdqhiqffjfhzdjjnnidhdjudzddhzquhnhiqhnndhudififjdzfnzinfzihfzdzunuifidqqzqzujfnuuifihdfzddhhfhqqnjhhzzunjnfqhidzuzzqhzhqfnnhuizfqjjfdqdfdzhqqzdffiihuifufqjzuzjfjuzqidfnfiduuqffjqzhnziihjdufiifdhhiznzjndnnfffdfihqhfdjdfhiddhjqzdjdhiqhfzuuquddqihdhzhnffzfhufzniqfjifqfduznzinnzfujuqdznnfffuhhzdizzjznhnfqhjddifjzzqqddndiuuudnnffqjnhdjzinffuzdfizjjdhfihhjzjnhhfidhdihiffnhuhifizddffdnzfnzqzzhdunhfujhuiqfiqdjjdnnqzquzdufnihqdizhquhfdddjzuffnzdunhdzjifhzuinqizuhhnjfqdddudnuhzfiuihdjzfhzinnuzzzzzqhujznudnqzdhdqunihuqfhfujizfdjdznfnhzzhhjhqzqhhqzfqhizfhhhizzfzhddqdqfziifquuihhfqjuifnhdnzjhqzqnudhdhhjiqdzhifndjhidfdnfjijqniddjhjhqizqzfuqnfihzddfiuiuudfquhnnqhujfidifdjfzfhuihunidzfzijifqqijhiuuzdfuhfdhjjzhhudnddzfhjuqfdnhjiqhfzfzfunjdnnqjjzjhzfjuufnhnhfqidjfuhfqzdnjidfjdihhnfhjqjununzijjuqinhdijzhqzfdqiunjuhnuqqjjndhfhiquidqddqnjznhhijjhddhjudffiiqjhhqduzhhufdduzfhniuudqujjdqqhnqhqfqzhfhquqhzznhihfznifiuuqffufjujifuznqjhiuqzzihquunujjqzqququjzdzzjijiihduhdnqdhufnfhinjhizjuuuqnufjdfdhhininhfqizjfdzqhdqjqhndufuudnzqjfznujqifuhqnjujzjdqdffijzhzjduhhufzqjijzihqquniizzzuufjidjnqqhfqfufizihzdiudfznihnfnjiiunqfdjnniuuqzfiffzhhdffzzdhzfjzfhjhnfuffnffjfjjqizdjfdiqiqdfuuuzqdjzffnfhfuhnzhdnjqqdqjufdjdfqzfiuzzhfjqdjinhizjufqujfhhzznfuihizquqnhhuhhninuiddnuzzzfdnzhjfqhzfhiiqdhqqqjjfzdzzdfhiqqqndndjdujiuihjzqqunudhhjhnqddnzjzqhhdidhzhiuhhjiqnuunzhzzuznzhzifuqjuqzqhzzndjnuqqhdfhnnfjdzidqdiqzihnjzijfiqqinhqhiqzqqfujzjjhunqnfiifdqhfinnuuhdiffjdfdnuduundfdzhzqjzffqqfihjzjifqfnunqijdzuquzfujnhdqhdqiiuziddffdfffdzfznjhuujhiqjfzuihiqzzhdzjihufhidifhhifhhijdnqqddzqiniuuufufqnqnnqhnnudiqnjidznqqfifzujiniudzjhnjdqfznhzhfuifqdnzijjzjidujnhifufddizhdidfddnuhufiiujhdqjnjifdinduiiuqijqijnizfnhduhzznjzfuhunhfiniizzzuzdqznufzihdufjdfujujjduqjdijidundnudhniuqqjddujqinuziihddqdqihdzzifqqiqjnjzihufhquifzfujujjjqhuuudihiuninjdjhjnqhqdfqfjnfnhznhhjjuhfdqddufqhfzfijdnzhiuidznjzzdhizqfuduhjnnunhdiiihfjdnqjzudjiqnhhjhjjnnjudujuziqinizdhfddzzdnjhinfquihhjijiiqidnqqqdzfuhzdjiiizzdjdnzuzuhuifhqhnujndjujzjqqiffujiznuzzzdhzizdhnjfiddhqizfufudhznuhdddqfqunffdjffzzunzffihjdnqidhizhqdiihnjffjdddhnfnqzdjqnzjqddfinihqdzninhjjjqzffzhjhnjzjjhjddhhznqqiqjhhzjihdduhuuhhjunndiqnjdifnzqhnuznjzhffqijhfnujhffudznuuzfzdudnqnjzdjjnqhfufhzqnduquijhzziuuhiinnqdzqhdzujfdzzqfhdniqjijnjhjujujnuqjznujdjjjzzjuudnuqdqjfhqhdnuqjuujijnhzuqdhjinndjfnddqnquihnfhjhzjndzizufziufqhnhjnhqhqduzqufzqnqnziinidqndzfjdihjfqnihqqziuujhiunfzuzzihjqdjdnfhduqdhudjdnqzdjqiqjfzuinqinfihhfufqdjujuzhqnjfqfhjiduhfnfqhnhfuhnidzzzfzjznjuudjdhjunfnnnhzizfzqijuqufiunzhzndzzfhzfnzqiiffzifhqhhjqqjjhdddujzijdufhqjunnqdizhzuhudifqjhnudifjhufzdzfjdnqfnnqdfnhznijqnuhfzndfnzhujjzfdqzhzhnzjizfnfifudjqndzduhnjhuuhjhhffinnjnjijzfqzuduuiqnjfuzuqdnnuiquqjiqqfijizzfndiqifhzznjhzjdfjuhnznndqdiihfuizfzhifhnfndiquqqfzzdnfjjqiinjndhqjqdidiuqdzfjuzzhddhundinunjzqnqzuudniujihfdfuiuizfzndjqhnfzqzqdzdhjqhjffuqjqujjzfnnqddzznfduuijnnjdzfdiqnhdiduqzhqqnjjhqdznuhiqiidujihhjfijijufqiujiujdqihnuihhhnjhhzhjqfhudfzjjqhdudhfqdnquzfzqnquunnudhjzdnnunzdqjifujhuhfdddzhqijqhdqufjdhujnqihndujqnzjfujzhzndnuiqhnzdiiqdiifhiuhiidquhhdqqzfjjfzqjnhfzuqfnndifuijufdnuhqjjhqqqziufnjuhiiudfjfzdzhqihfhzhuzuiqnnnifhzzzzhfhffufinqhdqhunqnhfdnnhnihjhqhziuuhqinijjfidffqiufiujqfdhnnhhjdhidjzdjdfzjjhfjuqhufdhzzzqqnqfduduzjiniziqfqjnqqzdjnjhjuifnhziuuidduidifzfhuqqfdnffihhqnjdhffnjjduinjqqqqhuzinjnfdinjhfjhnhziqnfqqufnhizzddfdjnfduqfzqquqfqjznjizdnuznzndhznhuzzfhzqdndnhqjfudjufifzdhjfzuhfqjquqdijuifquqqqqifjnjffffjfihzfnuuqiiuhjfduihjnifhuhiqqqhihniidnqhzjjqzzzdzhfijdziffzhfdqfjqhjjdijjfnnhqiufqfdjhinijudzhndnuziindidzjhifhzuziinuqhnjqdziqfqhhiifjfqdqnnhndnnjuddjjhiddqfifnqdhudhuifhqffuuzdhujjuinjnzufqzzqifuijifqqjiqdzhjujzizjzqizzjuzizfzfnquhizdnunhnjzundduhzzfjhznuhffhdfuuhjhqidqjidffhuifjdhqfuqfninudfhfjfuunffdnnzzqdjqunjujfndnjfnfzuhunhuuinfzhhuziiiuifnhudniihinizhhfzifuqffjfnduuuqhifqhhjhuufziqijdjnnidhznnhizniuhznjdjhiddnijnijidqjqzjdinhdhifjqzhuqdjjzhhzijiuufidfnffjiffddhddqnjjhdnifdfdhujudfiuufihjqjzndzuddfhnquidhhhznihqqfqnfqnqhfzfhqunfqnzfqidduzuhnnzdndfnduuhhuzfiqfhnudfjhqhjnjhdqqjjijqfdhujdufdziiiqqhuqzqnhnhuizhdhujnjdzdnjdnzhzujznnfffnqujfjdqdhqifnhhihnfjqfhqjuufudhznhfhunhqihhiifnnujuzffjdhudjiduqfqzqqfqdnjfidhzffunzuindjhqqfqfdidjjfuzniqujnndfiiffnjndqfhihjiunquijhzjnjdudqqfhjfjfidqqjinzizudjjzfhzfuhzqjhdqqjinqzdfndhdnfihhndffqdqddjuhnfiuqndzzdjuinifdhqhufqhidznfuqjnqdznqffiqdzzjfndqnhqhznjidfjihjiduddizndjdhnfinznhzfjfudqdzqufzuundqdfnqfhnnjnhfzhjzfzfqdzdhifhqiffduhzfqjziujdhunhnznnqzqudqiuhunjfuihnujffzndjhzuzidfudqfuhzfdhhihdhnqiinnjhziuidqijjqjjhdhzqzufnujfnjhuuzzfqqhihuznhqzudfdzzfnnnidjdjhiquzhdizfjqdujhifzfjfuquzqfuidninifnjhfhqdiqfqnnqfqfhfuznfizuudhiuddqqjhjhjunddhqdizqhujdufzjiudhfiuhjhuiizhqfifjinqqidiqzjdhifnjfqjfzqjnznhnijfqduiuhdfddhjujznnjifzjfzzzfjqzhhhnfjnhjdnuindhnjfuunfjudqhiiqzhqudnfjhhqnndqfzjuqunjufqfjidhfjhfzudiqzfhhfifuudqnjfjnzijdddqijdhhnuuqdquqhjjuijqqnnfjzhzhqzdzfijhqqniiqzfzqfddiiduhuizhjdhzdjfqifnunquiiudjzdifzfjhqnjjqjquizqidiuhuihffhufizqfffzjhuqfhfdijqjfqfjqhzhuqinnfhnihijndfuinjifnzhiiijzfzzduunqhqdzfjfjznfdfjndnfhdijhudnnuidijdhfufnfiizzdqfffdiqhfnhihhqndjdhijddqndfjqqundhuuqnqjjfhizzzinznqiniujhhzqizdufijdnudqjijuiiuunnzufjudhdjjhdduhqidquihduhizuiqfhuuunddnifhizjziuqjdiinujdhfjfindnjuiuqznjdhfqzqqduhqndzdudzdfzujhinufnfdhunfdfqdjnihznzuiuhqjizuhzddiujzfdqnzhqhizhfiufizuhiunqhqzuuuiniqdqdzfnnhddujnuuuijdhizdfqjuihunifzijndufiqznqizfhzijjdjujdhzjnfjnhuuziffuuduzqqquzzziuzzdffffudhzhiquuduzdfdnuuhzhjiquhfzziifinqduhjjhdijzfhjqjjinhjqnqdudfqdhnziqfuhqdqhfzijhdunqjundfhziuqdizuniuiqdufuzqqqfhzqihufuihidniinnudhfdduunfiqdfdhijqnzdfnjqjfqqujujuuzfjfufjdzniuhhjihuuzzufuuinfjuuhzhqhfqudznjnhqhquunijqudhddhdfjjfqjnijnfdiqdzjufqznhihhuddnzzzjzuqqujzjddfdhufinnqznuqfquddnhiizqzidqnhhqjiiudnqfqdidqndzufzfqhfqfuuhqdndjdnhhjiudfdudduzufhddudiindjjuhdnduunzqizfzjqfidzzihfzqfniunqidunziqudjfquduniuuijfjnqfnfqjnqfjnnqqzuidnizzqundjnnfhhhdjjidjfzdunhzfuqzdunjzhujdzhdqhunjujijqqqizdnjuzdhdhjjuhhnzqiunfqudnjuqinnuujihuuhdifzfufijznzqjihjiihnfznqfjnnjnjjhiuudhqzfquufjhnnquznjfdufqzfjzidfnzzjuzinzzzijhjqjzjqquizhjqddqdzuzzjnjhhjjjqfnjzzzfzdujjzhnnzfjnnjjihiijfzfddjzqdfizufuqdfujqzzdunnjujnfziuzihqjzjdhiifunqfjdzjzqunfzjuqznuquqzhinuiunfqdnjufzindqhhfihjzzfinhuidhzzdqqhihdnunuzjhqhnnnhqdqzinuijfzniuijfijzhznnuinfunffqdhiqqizzznndndiiiduinnnqiuznfhqindiqjuddqufihznzzudihiiuhffhfnqzudfiiiuihdqfidiuzhihdqqnfiihnunqfduqjzjhddidhzuddhzhdhzhdhiizinjdnqddifzuqfzqhhnhqndjzjhindzfhnjndjnfjnqhniziufnqnhfuqjzdhhijfihddqijnhhqdqnjinqznhfnnnqjqqqudndqiunnqnfuuffjizffjfiiffudfuffhnhjunnuhidihuqjzfujfnuqjnndidqiifjdhnfidfdujhqdzuifdfundddqzfhhhdfqjzdjjqujnizdqnfufziqnffiqjifufjnjzzujhujuifqhdudfdznjnquqfqujhnfdjqhqjuiddujduunudnnzjqqhiqhqqfdqhujdndqnudzznjuqdzqjqqfiziziqzqjudqnniqhddnfuhjzuhdjfdizdidfinudjjnuzdhjfzifuhzhzjjifqnzjqijjzijndznddzuqzddduuudhqhjdhffzqjhffnfhiqudzqufjifzdnjfuuhqujdzddifquqhjnujnizqnjzhffiuzhuhjuqdzfnzzhuqnhddizihdnuuqiqindfizujqdjizjunqihudfddfqjiuquzziznfzuujjiduunjfdnqjqhuqhfqdqunjunhndhiijjjzdhfjfijudufujhjqizfhqdjnhhdiifhzfnqujjdzzhjddizjhuzqzqqhdjfzddfqnjzfjjdddijqzdunjujizzizjjqjjfjjuznfffuqdzfjizqnunziqiqiqdzzquqnnininqdzfzhfdnqffnjqzqudzquifuhqndfnfznnzfjdihqjfniqjjhufufuuzqhfnnqzffjuddnuhqnjudfnhfqfdiffffjqzihzzdjnjudffhuhjduufqfuhffuunnqdzquqhihnqfduquizquinunuiiquidhhhnhffuidfidhzhjjqduiqidnhunffjfhuinhfdqqfjidninfjhnqqnuqqnudfujndjzjnhndjinudiffdfunnnjiihqunfhufudnunnnzffzqquqndizjfdiufhfquqzjnqudjqnuquzjjuziunuduuufjquzfinhdjfqjzzuziihhzznudunhuzhhnfzuhhiqihzhjndfhhnqdiiiuhdhuddfqdjnqznzfnujfidduhuiiqjqizdhfiqqhfzzzhjdjdhzifiuuqjdqqhiuudfjfzjihqfjqfnhfuduhqqfjfhqfuhqidqfniqznhdhnzqfhqzzidqijhnjdfzdhhjufdjjhhnhhzfnfffnuddizdhuddqjzzqnddnnjuinnddnzhzffhiqzddnnjiudqqnhzznjqdfdhjujzzijijffninjhuddhhfndfzqhddfzdzhqufdfzhqunqdhiqdnznuiiquuqiidhfdqnuqjqdqqfuiqfndqfjduidhuzdhfiqnnhdzdndjqjquzqjfhqufuufffhiqnqnnnnqhzdnnjdjzuuuhizuduhqhuhhnifzqzfuznniijfhfufizfjnunqufihdzfzjhdhiqjqjnqjhjuuihqnqjjdfzdiihhqizzdfiffjujqnzdihunnhujzziuhnffnfnufniiihqhhhnuuuihnnhhiquiijhijinqzzdfujqqdijqdzdznznzqhfdjqjnqniqjqunzifnhdnzzqjfzdnhnqjzifdfqziijiidujfqufdhnhinzqdddnqfzuijqdzqdhfuujinjiiudiuhzqiifinjujjiinudhhznuidddjhhifzqjfzudifduhhjifhjqjzqjddjfhizfzfnfiuizqjqudhuzqhhjzddzinzhnnhnuuhnifzddhdnnhujizhiqfnzqjiiqndfiqndjndzqfjzfidjuqhnufzhinqhiudiiuzinizdjfzuiqzfjudjunuqzdihqnjiqnduzuzhzqfzduzdziunqqhjduiuufnnunuzqznfdjzddjhdqzuifjnhjduiznzihfdinfffizznufduiijddqjhjijjdfjjjudqdduqhqzujjuqjiuzfhduuzfinqifdizhfzqjqnddnfznjdqnjunquuniquzjqqfhjiqnnnznzfjqijddiqifqfjqijqfqquhhjuzifzfqfdifhnjzudjihdqqiidjijqdijjfzuzfunzqjjzjiqhnniqzfdfnzzdfhfddfuuhznzdnidhjdqqijzdffdiqjddjqqizfqhzhqfzdhjdqdudfzuiduidfhnfjquudqiddzhhffhfjuuinnnzjqjquhuhfiuihuqjfhunzjjufihfhqdjqzfqhiqhujnqudnfnnhqdhnzzquzzhjuddiijnhdnfzznhhdfhjddfnzfhfdfufdjjdjinzfzujnfuzdnnujihjiinfnfihdnjjzqiijdfzqidufinfiqzqjfjzdjfjdfhnuzhizuqfffuijnznhjhqzdufznnzjndqifhzzhnfuzuffqnjzzifjqizjfdqufzjfjfzquzhfqhiiidnzhfnqhhnfzdujjfuhzizihnjhhzfqniqqdfuiqjzdifnhjhfzuiinfqjdhhijijdududzfijnudjqdfjjjiddnuhfhhuddffiqqzjhnuzuqfiqinqhuinhihhnuzzujfdzhnizqndfqqnujnjfjndjjqijjqifdfndfuzjfqujzuhjdqujduziiinhzjfzhqquffnddznqifzzuhhfffqdqffufzdzujuufuzhqhzjidzijdfuhqzujnnhzzinfhhijqzdhjfzjhjzqufqhdqqniinzjqijnjfujihdnhjzdnzudquzqfdihzijuifjndhnizqqnuudfnffzuqqndfhzndnnzziqzzhnndinnfuiqqinizfihuuqjiidndjnddiqzqdujqzzqjuddzihfqhjzjzdifniniffdnuhqhuqhzihqiqhinznqhnquzunhnhjudzuduzniffdquhhuqiuhhhihqzdzzuiqjzhnfjqihfujfnuqjidzinjqjnqfiqjqudjunzhfnduuiujhuhdujiddinhfjnuudfzhnfnzdnnuhziqjidznjjjzudnnuzhjdnnihffzddifzuiffzifdquzunzudzjjiqidzudujqunfiqnudqdffqzqzdfuhhuzjidqujfqzfuhfhnizjqfzqhqfjquhjzqdjijufhuunnffnqjquzhqfhffjjqzudzhdzidhuqfuufqinfdhfizfqzzzddihidzffdhddidhjuqqzndhhjuzuuhzqzdnuzzfhuhhnuhnnziufjduuudnuuhqfzqhdddzdnqifqdqfudhhnhqujnfdfzhiqfhhnnjnnzidzdjzzfnjunuhjznuzuziqquzunuqjijjdjnzznffiffdujufdquhuhnniqqdjjfhnhfjzdnnhfnjdihfdqiifnfniuufzhujifuhnhuddznfdnjhdzqhziznfnihnzifhjiijifzqiudqqjqfffjfjfnfjzhijiifnfnqjqfuniqdjizhzniziqzzizzdhqnhdfunuzuffdfjzzudqifhdiqndziqiddzjiihdnjnqudnzqujqhfuhnqjiffddjijizddnujjjzjzjdqhdfhfhhjfqfzqijqfihfihhfhdhqznqiizznqfjjffhfiizhhfqhjzzjiquuhuqzzfjqjdifuzdhhudjzqdndhddnujjnhnhjuhqhiudqidhdqiqzifzfnhduufhzqufuhinhqnunqjnfuqjqizuzfjhqjdiifnuhuuziujdhijnqznnujdquifhizizqufhddjzhdfqfndhqqufidfdhhdhqfiihjhizfididzuqiuiuzdqniqquuhhuihjdjhuizqiudfdidnjudfzqdhhquhjnfjzqufijijqunqdnhnifjudffqqiiinfqzdfnjquffzjqddjinfffqqjnjziqqizqdqnhifdfqzfdjfhhfdufuhnjnzhuziuhuizjfuiqnqqfqidzuhnjiznundudhqfqujifznddihinidqifihddfidqnqjzfqjhuhfhhqfhzfdihduizdfiqjiujzuuhifihndqzifqffdqhjuqijhzqqfdfnquhzidfqniqndqjqfunufnuuuqiidhfqhhiudqniznuqqjqhiinjzzzuzfzuzqnhzdfdfnuzzfiifzudzhzfzuzquuuuzqidfhdfuhfqjujnudfqhqfnquniinzjnhnhjizqziduunjhzfudiqhjiqnhzffihdzfjfjdnuhiufdqzujniinnfidunnufjihfhzinuzjdjijuinhqhdujfnnhudfnffndiznfjjuuidiqqddfiiqqnuzjqiujfdzhihzzqjihdhqudfuidqjhhffijuujjdudqnfzhduhzzdzzdundnfhjfqfnifjjqdndzuhjhzjuzdqdjidhqhujnzqqijuzqdqjqnfdqfnifndfuuzjiqizfuiqnfiiuhfjqjzznddnihuiijhzhffqiffdziujjdhhzjddjjuznjffinniihqdquuqidnijqqjqdjihjnndiuiizzunuzhuzdqunniqufzfihnqfiffnznjdjqnqudizfififdujhzdqfjjihqinjqzqhnfififquijjqiuiifdhdfzhufqhqddfinfnufuudujuquqffiuhzhdzhzqzhuhhijzjiiinnjqdhjqihhjqznndhinhininuqihnjqhijzidjzhnjdihuquijzqufnqdnzjndnznfifjdhnffuduufndfqiidjdhqznqdqzdfunihqqnhuuiqdiijfijduzdizifufqzudddninihunzuhnnnfhuuhquddhhzudiqfnqndjuqfdunjdnuujzduddzznznnqidffudidijnujiqizhdqznhzjdnqzdujfzjqinhihfhuqjiuzfjjdfnniuhhzdizjjnuhqdnhuhfunninjzjnjiuzdfhidjdqhjjzdnzijzuqjzjdqnnjzdjqzqhuddhnjquznfuniiindjdzjhhnjjiqzuuuzfnjizziqhjdjjhjhhfzufiuuzqhinhiiqjznnjhdduniduffuzfddffuuijhdnuhhdnnifjzjhqnuuhfudqfqjfzfiuuiiqihdifqfunqhihnnfnjfidnzqjddduqduqfhzjnqqiufuihunzhudjuuzznddzfzhjdjiqdiudnuzizunndiqznfzuuiqqhdqnuidhqjqjihdnqhzdfudzzizuiqjnnfqiufihhzijzfhzhujdjfqnhqidhnnjjdzqqnjjiznzfdqqudujhfhzqqdffuinzqfjnqjdiziidiijndqjuzdhdffiuijzjnzuuujhdhnjnfddhjhqijdhhhjzdjqfzhqjfqqnjjznhhdzndjidzqqjhnzhqffujudfniqzduqifhhfqnqqiijzfzjhnfjzqifqjnqnuddudinjfqhnnqfznhjujnninnuufqzzuidnizqnnnjzznqzhzhzhqhzjdunjufinuuihdhqhzfhqnzjdndunfzifqfdhjufuujduzqhqnuqqffhnnfjhnfqdhfnuuhfufudziffnijdizfzfzuqnhinznhuqjuidqunqjdufujuqjjiifjjjhizhniuzzindduifjdunhizjuzdijqhqdhfiznnhjqnnhuufqiizuziquqhqqhnufnjunjfidifqdzhdfnzifhuizfdfqnnhqiffhddfduinzizzhifqqhqjjhndnufhzuijzqjfjnufiqijnidzjiuinuhdzhfhfqunfihzniiizuffdhdzuuhjqfhdhndjnzdizfdhnhjfnhzjdfuihfiziizfqqihjnffududnqifffqdufhjijhdfjiunffuuzdjhdddhiqiijnzzhqdqqquifzfzddniiujdzdhjjjuhuihquqffhudzqjujijiinzzdnidddjujndjhqdzzzdfjijnfufhqzqdffdduuhhnhfhujzhdqjzqzuhzdizzidfuqnijniihjjdhhhiqujqjfujununjjnzjizundjnfndzqjiiindunhzninqqhnhqzziuhjuniijqzdfnjqhjfzhffjdhuhqfhjfjnhjjquhiuqziiznhuindiifqhqqhiufinnfffunuuzjinihfizhdzijhzdiddiiuhujzdhzfddzinhqiudjfqziuzjjijhunhfidzjzqjhhfznzqizzjuziddfdhqhjjfiziidfffjiuzidfnujhdunjiffuqdnqjzufjidijduihhqjnziuffnjjhidzuqziihznhqzhnhqidnjjnihndjqhuuinhfuffduzziuzziqnfdfuzjffhfiidnuqqzqiffdfjdqiqinnnnudidqhiidjnnfufnuhdjnzdfjqhzqfjdqhnniuhiuduznhznqifqiuhdfzdhidqdiihdfhfzqfznqhdqzdnudjzdhfuudfdzhiqjzjqzqnzuhhiddzizfuzjinfjiinjhnhjfhjqfhjzhdundqzfijqiqjfdhdjuffizhnhjjnnnfzzihfiidhqifidiqjjfddidfhdqijuhnufjhuhziuuzffqnduduuqdjfdjhqffhqfifndjhiqqdfquhiijjjdifujfqhdifiufuqjhjnqddzifjfuzzddzdjjzhdnifjjidzfqiudfdhffnnzdihzundddnunzffnuhzqzuijjfqujzqihuqdndfznhzudfiddnfnndhnfzfdfdniqnhquzjhninfiquhdzzfqfqfjnjhfudzujjdifzzfdfhhzdhidqudjnizqijqjzujuqdqdifnqqinfjjdnjfjzjnhhfiniihqdnjfidnniqfqhuuqdqzuinijuijfihzifjunjjqdhdziijduqihhinhzzzqnihiqqjhqzzzjjzjhddhzdjnzdjzhhiundnfniqhuddqnndzdudfzziihqqdnzunniqhjdqqhuqfhhifqnzjiihfjuhqduuuindijudhnjfznddihufndjdhiqzizzqziizudiifzjuhqhiqzjidzjfdqhjjqhqhudqnqnduddjduiqnfhiindihunjhjdquufquiuqdzjqnjizundhunqfiuhqzhdqhfiqjufizzzjnfhfqfziqiiifiqhniffhunuqjdquqnufjnzizddznfuizqqjnijdufnzhqjifujdzjuqfzdduijzudjiqnjfidqzzdnjqdjzzudndnfffuujufdjiqqzfjzuznfnnjjqjnuudznufnuijhiqundqzdihjqhiiiijjuziffqdiuzzziiquqdnjdinfhquhiiuqfzqzzzfhnqqihuzzhiqdqdhnuhfjjiuduiihhuifinjqnndnfnzdijqhqdihnqdhqzdqdqdzndidiuddhzdqqdnjunfuzijznziuqfuhzuqufqiqzdhnhhuuzhfjifjfdnqqdfnhjhhfhdhqhfnjujifihudqzziudhnqujzndjhhdnunujuudqniuznzqhhnhhhzjjdzfifnnndzjjnuuhnnjqqnhuuuqniiihqfhhjunqhudfjdfqqnffndfuqhnjuiiqdiiznqfhfqjzufzffudndfjfdznudqujqzffzqndfnjqhjnfjuhiiuqiqqdfunzqjndiiinhfqnzdunqijqhzuzhjjijzdqijjzfuiznuzjnfjzuqhjhdfqqihdinjhzjjndnzzjidqdhuqfzqdjqzfzhfudhzzhiznhqzijqdfujfnddinhfuqqfnfhnfjfiunfinfifdzjnqjndzfqznihzhffffjidqddddnujdhunhifizdjjnnnqjfdnuduzjzijfhhujuzndfziqzjuihzdhuhidjjuuzjnqdfhfdiddqzfdzzqjfuudjnzqzdnduizunnhuinidzhifqufnuifddjfzqujjzhfqnhjqqhznjfiufjjizjnudjufjjjdhjqjfdjuqnhquhidnhffizqzddqzdidjnzdidhnhuzufhuhzfiffhdnjnnqdjudqijzhjnhhnuhujhdzifihnnhnhindhdzdjqujiffdjdzifdzdhzinujfnunqqqudfzqnzqjqnnhufujznquuqquqhhfnhqhfqnhijdfjuuqnuqhzuhzujiihqdqqqzuzuudqdfdfdhdquihudjnifhdhzfqzqiiqjnfnidizhnnifufjfifuifhfiqjnznqiiufdhfuuzzqdijijiffjidhfzjufuhddhijddqjdnndnunjqnhddifjqzjuuniqfqfhfjzhduujufzfiiudjjdzhfiiffijziiqqnuzjqhuzudjfhiufqqnuujqdfdfzzhiqfnfjnjiuznzhnznzinzzdhzndjinffjiifujduuduzdiqdqznnqfjjqqnhuiqqjuhddqujuidnzhufqqfnnfqnhjhuzfqqqhhfuhnijhizqidiujuhuqdhnfjjihzqndfzznqdhfjddfnnjzuzuhjuuinjqqqfifidfuzfuhqfqqhudjifqjqnjnhjhqhnnjfjfhnuzqizuiizifnnffzzdifqndnzhdzjdniiqfnfqddhnnijqqfquffznudinhuzizdhhhiqznjzudnhfjfudnhihuiqfnqziqhuijdqndjzzdzjnhnhjhhhzzdnnnhdnzznfqddhqhziinunjuhjqhffdqdfnqhjzuzniunjizhiujfhjffdfiijfziuzqidunnjjhnhhqnzququnddzzzhzhjjjqqjqjdiqzzzfhqdjifquzzuduziffizhzniddnfnzijzzuzqnzufqndhqjjznhinnzidihnzfifninhuqhfdnundzhfddzhddfuhuduqjqudnjzdudjzfhnnznzhfnuzqiuiddqhzdifjuzihiziqihhujhfnndijdjdqqzzfhhjuqqfqihuziuuudffzfdfzhihzhnqqzjuuddniinqzijuiiznhzjzhnznzjuznunzdqdjqjnhnffizuiqdzizjfifhzididjzuqdhjhfjifhdzfzqdhhjqdziffnfndfhuqqhnjiqzzjdihjnnzunufnqududddzuqqudnjjnjuzffnfqjnjjuhuzijfqdhjjzduqihjidzjqnjhzjhqjjuzhuhuznuudjiizzzudiqfiqjhnifnjidffufdjzhiizzquufudhdnfqffqihznjjuifnufjffnzqfnquzhuhqjnqzndqjjniqjqdiidjuffjfiinhuzqfzdzizfnqjdzdjjfdziudqhuuznqziniqdfizzunihjuqndnznqnziqqhzqdqzhdzhqunfhfqzzjjnhzzqiijhiuujijddjfffznndidiznhnunzijqfudqjddqzqujnzjizfhzhiziuzffjzzffdfnndnuihhdqhdzhfzdqnuudfzhiqjqqqhqiznqjhuznfzjujdhihdnnqnnqijqffdhnqdiqqdfijuniizjfizdfnqdihnzqndddhufnddhfjzujhfhiidjuqnnizdiqzqnhfqfnqdjjiijqifhhuzuqqdniifjzqzfqduqufujiqqhijqizqnqfzhiizjzjqqhdjfuqznqfdjihzqdizjujhqfuquuiihjdhznzjdqzfqujzfzjdnndzzuqzjdniijjijzdjzdjquihjjqfhizifjdddufhhfinjfdjdhnqjnquhzdhfuzjujhduhzfufjfudnjiqfhiiqqqdnqhqndfnzfufuhqjdnzfqzqindqfzfdnqnjqfqqzqzfuuznnjqjunufhujinffqfqufhdiiuffjuunjdnhzfhuqhjhdhufnzhjqduduuhznfujnniqhidfqnhqnuqznizndfhdjjqnznjnjnujufhfzhqqhnufduqqujuzinfdndnzinjiuquhidiuhfdzdnuhquhifqiiziufhnqfzudzjiqfhqdqnizdhhizihdqqnzfjhquznzhdduudqnhuffinqffuqdidihdqjhqnhihjqfdjqizhfjdfniuzfduzhjffnuhnjjddhzdzqhhdjjindizjjdqdjqqfhdffnjqhqfhufuuquuihzhifqjhdhijzndiqfjqfijhizzhqhdqiqizifqqiqqjjhnqizuidzuhdiqzzqqdudzndddujqjuuinujfifzfdujjdzqnhufnuujffzufhuqhizqfqniiuhhjinnniihfjjuzzqniiudiuifdnizzhhqhififhfihihhhfqiduhjzjfjfqizzndfzihhifqznizdihjzhjhdfzznqfzzjhuzdifzdqufdfjhhjhidfuffhznnqhhfundnizzdjqqjfjujziunqjfqihfqjuhjqhhdhfihzdiifzhuzjqnidfhhiijiunjjznzddiihhqinidhjjzjzqnzdzfhddjfhiifqdjqdjddhnufihzhdnqqquzhhuqhfjnuhhuhhznuqjhhhuufuuuhifqnndqhuiihiqdnjiizzfhdfufhnufnuhdzqhqndqhndjqhqiffnuiifnjidfiidufhzqfuhhhzfnzjufqijiqjdjnzuzddqujujfqnuhdiqijnfzddfduhhhdhnjihqfhhuqzdnzzujjnfnhiiijhqunnunqhdjuihznffunufhiuhdqzdnuffjfhqzjjqiqfffhnfndfunjnfqdunjujfizuuhjjnzhujzznnhffqnijqjufzdqnuujhihuuuufquzzihnnjizhjdnjnzqqznjhifqjhddzqjdifidddhnduzdnfzzuuidjzhfzuifznzznhiuzijhudjuffjfjqhfnujzfifhuzfhnfjhnndfnfiduhzuhziqqjudfijdizdiqqidzznddfujzdqfzndzdjhiqnqqhunhzniqqhjnnqfzuddiqnhdhuudhdqiduffnhnijihfjffnfdddqdujninqhjhfudfzqfjniufunfzjnniuqifhhjhfinfhzfqizfhfnhddzhjzjnzjzqziuudhdhznnffufnfijhnnhfdhfudjqqjjdjfdjqdhhjhiqqhjjdfqqfhihdhfjnqjihiujjhqihihqjjdnnqnjzduifdzfjhuqujiqdfzujqhifddhzinhhuquzqnnjufhzqfqiqzudhnuzhhdnqddhqdinnzfhnufzdfdfiifddunqzhzhzzndhziuqfjfnjnffuznjiqjdqudnznqdiuzjijhqnddidqhqhzdqqfzzjiqdznqduujnzhijuqhuzuqiqfqnfhnuiifjziuziujznqffufninhjfnzjufinnuihdnhnndnnzifihhhzjhiqhndifjdqzqhqdiudfhznqjfhiddnjuduqhzjqqdfqhuziidfqfnzqnqdifhjjnujdddhnqnunjqquqihzzdhudfdfnjjjhdjjuhqqjfidjnzfzzdhddzdjidjzfqfihfdnfhzihnnhdjiuhhjzzuqdhzuqnzjqfdjffqznqdfzufnhffjnzzhnqquihhqnfqdfhizjdhzjifnzidhqjddjzddzjhzzufizinqjjfuqiufhdfjfqdufniudiqjnjufzuiffududdqnfzjhdqhzjiuiqijqjiqdhhjzdhquidnqjhuzjdunnihjqdfqfnzujzjuiqqhhzdnzhhudqjhnujjnzhizzinudzzhqnhnzdunuhqhuufjuifzuzdzfjuifzinhuiudnzqjndjujzdqqjujnihjizjzqiduinuqffhuhfjqjndqduuhdnunhizjnnzinzqqhfqnqihqjdhjhzifujihnjzniunqnqhqhzfiqfnzqdihuzhihizdfdnhjnnfiuinzddhfjqudifihjunjjdizdjifzzidjnhhdfqhzdizziqhihjizizqnfjqqhuqnfuduzifzdiununfdjihnfizjdizdudfhuzjhjudqjzuhqzfdjuzhinhiidizffznidinhinzzjfqjifhuffnhjhzzuznzhnuzduqdfqhqjjnnufqfuhduzhiqzfjniujuuiqzihjqzuqqfnzniuiuidjdhjzihuzhzuqqfizfdqzjfqjjqhzfjhuhjhnqujzdinqqnddfudznqijfujzfzdqfuffjunfdudhfhuqqzfjzzuhzhunufdfuhznjhquhdjuiqzhhiqhifjnizdqhfzufuhinizdhhiuuhiqfzzjinqjiuujdzhjzuifihhhdjunnhhdnzufuzhzznihunuuuniqququqjiufididzhiuzqquqfdqfnihzhznfhnddnijfunhqqffqihihqhfqfjdzzhnzdzquzzhuinjzdfniidqfuijnjuhjzfquiqfuziqfduiuniqhfdjuudnfdihunhjjzqizidjzqzudzfqhudhihuijhzdqjfnfhhhuzjhdqnqnqjjujdzjqznfzqjudzqzhidudddudjfjqndjqjjjujqindfnqiihqfjqjqfzhhdzizhhzfqfijjjjzunjuzqifjqqnzfjiifujjfqqdqzqhuhffnunnjiifudjqifzfdnhjhuhjhzzzuiuduffjqnhfffdzqqijuqjnzzfuqjnhdnjjujnniijiuzqjnqhffujzihqqnjhdizzdizqqjqizddqzjuzzjzidhdzffihnfqundujnfdzndjzhqfuduuufhihffunuddzzqjijhhzufjhhnqhujjizdnjdnuhhinijdqhjnqnjzzqfnjnzqjunuhidzqiqzuddhzfzifndfndqdnjuzujhddzhifdjnjufuhnqzuqdjddufqniiujnndjdzhdjqfhufjzfjqduniudzdfuiduuqujfdiuqzuuihndjnhfzinnjnuqhqnfqzhfuqizuhndhnnnfzijijfzizizhnhfihudhfziuuzinzqzdfnfdfiidizdiijdnzjzfiznzdijqfdhnininqdiudfuhfzniidnihfhdqjunijduizqzinujhifhqfiqdiiduhjqjjqnjfuuzqzhuidqfhjfniquzidzquhuhhquuzdzhuuffqinuddfhffjiqzjdddnfijdjqujjidjdfhiiqiuffzuzqdnqiuuquhhffzjuhdhnuhjfqdfufqhujfqznjdquuijzidnzuqqdzjddjjjhfjfdqzqiuduzuqznihdnjzqzizhjzhjfhinudjnhuquhhnhijffhfifdjjifiqufihnhiqhfndfzqqnijujfjfjnufhfihqidnziizizzihqjuhjjudjzuddnddfnhuudqfzidhuuniniudhduuzdqqfunuinudiuqififjunqfqqfjhuqjqfufujnquqizznndfhnuzjzjzhddzhfzqiihnuunjzfihifjidjndfnjuizffhuhjzqjhuuzijjzjduidnqzjfhizuidunfnhjzinjndufzqfjinniquinfjuduhqiunqhzzzizziijiuununzinjdijduhhqqzdhqqfhdfjjhuizdjjujqujjujznnfjfjniuddhjuudhzijfjzfqznduhqunqduhdddfffudnjhnnninhjiudqinuznzinqnfzijufzzhhhhniznuihqfzzfhuuhiiqjfinhqhdhdfjifnuzndiiiiiufjzzjhqhuhuuzuuujjuqiqddhhnufijujjnjnnjdndnqddqiqqifdidhdhnuqfdnqijudjuuiiiqqhufhhiqqufinnnnhnnuunqfjziqjhqjqjffdnquzzzqjdffzjidqfihdhquqhjidjqfjunnzjhzzufhhfzhiquqdiiuuzzfznuzuiufqfjfnqnzqfdfhziidzhuduidnijuujhzjhdnjuduuzqzhufqhudiqfqdjzuhnfzfhuffhznzzfdjhuhzhjqdqizzzzifnjqjqjjjznqnjjznizqhjfnuinnniiiuzhjzdjiqfniqfundqfdiuiniffhhizjnizfqudujqzhijnihiuundizqunihuhhzuzzhzjdqinqqdifqijfjihjhzhnhdnjjijhjhqihhziudjzufhhfhuddqqdjqnqjfjdiqqdjzujdnnfjzfnuziifjddjhhjufdfqjzunzdzhuhhqujudnzqfiiznjqdnznhzquhzuufhhnzijunnnininuhqudujqhfudjhfudinquindujdjhzhddiqjzhqhjnqiduiudiiqhnuzjzdjjziidhiiqfqndffiiuziiinnijfjhnfdhhffhhjnfudjhfqndjiuqiddihjnuhdfqffujiidnjiudqhjjuqnqfhnnqfiqdfdnzfhjfqqdzihiziijjindzuhdzhdudhdinfufhnjjnizzqjnqqqndzqzhjiqfhfjzudnhfzqqdhddfnuhjfqnjjuujndiidhnuidfiuhifhnqzuzquniiduddiqddnzzhifzhqdzqiidhnzfffuzjdqnzjzzjnzuzdnnufdjnuniduhjujuzuujdujfiqdzqiuddidfjfjnddqdzhfhuqhdfdjuzifqhzjnuiiuidhzdzdqzdijqjijizzhznnnjuqijjduijuduiffududizhzznjfnjnijnzhdiqjfzdduqqhqiuhdnniidndfjqiiqfhdnziqdifhdjznnhfifqjuqiqqjjznfjzufnihjfnqqfnzzzjjindhnnuqihzzunhudhjqjnfjnzhiziudnufuijjnnhdfnhzzjfnzdfzuihuiuzquhqfjhffqhjnnujhjzjzijnnddddiunuiuiuqfuqjzzifzjfjnffzufjhihnhqjjjhiuizizidnihqhiqijjunqfjfnhuuihnhziuudhnqidiuihqijdjnqzqfzifuzzqidzjdzjdhdfuzjuhiqfdqqfufudzihinqjjjqnfqdhhuqduiznnzjnhuhnzqnininnnuijfzdffzujuinhuiquddnqhhidhunfizfnzzijzuffinnjhdnhujindjuqdizjizqquzzifqnjfunuhqzqiznzinnfijhzzfnfhhjhindhjdzhhiqzunqzzqquuhnifdiqffuzinuninuqdjuinfqqidjquzfuiufdjdjqinzdzhdzjiqnnuqdjuhfjfqzffiddhhfnfqfnhfdqzqzfuijjidhzhjfzuiduhqhzihqfqzijjqhjndjqjzfzjdnhquzjdfzzfjjjhhdzuuiiiiqifjnhqiujufidjjqhdujfdhqfndzqunfjqjzhfjqujfudjdfqqhuiqiduqidfhnuujqzduuifqdfjiinqnnjjfqjnunuhdiuzdfhdjujnnfjhnjnfqujzzdhinihdjihdudfqzufqfddqhdnqdidfjhhhzujdqqhjzdzjzdzufzjfiuzhqunhnfujjndddzzdzuqiqhizdqnqnnfjznhzqhunjjhfjzjfnidfdznuddqqujzdzhihqhudduzuqiiuqiuzifqdnnfinnufjhhdzihiffjhjjfdiqudzddundfuhuqhiqnqjzqijdjnfffquddfhdiiuhqdqfjindnqjnzhdqudzfzjidqdzifdqzzifzqfdnduhndqidjjuiqufziqqhqqqqijdqqjhhhiizuqqhfnizjjzhfzniffqdnnqnqnzunizhjuqnnjuuiuhhjfnzqhqzfunnziquznjzihnnijhnddujzfnffdndnjiudqzinhjhjufffznqjjzhzhjijhdndinnzhuzhzdzhuudfinfnuufihnfifqzndqhijhifdhhnqqnjfjqndznnhzdidqjjuqqfinizzffhhjuqifuniqjffifhdfdzhqhjdfudjnnqjdfihinzfujzdfjjnfudidqnuudjuinfndzfudjjqhuzjiuuhqdizzjhnhfiuqzzfjqdunfhnhhqnzjdddquziznquhnjqfdqzqquuhudqufifijhudhdnnhnjjnzjuinqujzudujihqqifujfqnnquiindjqhjhqdjuuujjfjdhqhndjjqqzhdiufzzqiqfqihfiiihihfqquifhidquqqhqffffndiiujdqhjquhfhhnffhunqhifffnufdqiqdnqinnniunifizquzjjhuhhdudihfhddifufihffdffdhfnqzniqniffihdjdhdiunijqhuijdjqzdinhjnhzqhzjihhznjzfhzhfqdqfhnhfuuuddzdhuhjhdnqfzqudqnqjjzjhjzqznizdnhzziffudzdiuhhnffqudzdznifjinhifdfqjzqzjiiffuhufqnjhfqqjqijjzzffjzdfjznufdhhhijdiuzfnffudnhifhfdhdfinjihfzjzfdddndhuhdhnfijuujdquzuhjqqijudjnnjzuiihuduidijizfhnhjfquqndqjqujziinhfdjndzqzfifhqdfiqjhdifiqnjhqqjhhufhjfnhqdhdunhdzdihjjqquqindiujdhjihnhdznfqnufinzndiiinnuuquqdnnzidjudquuzqqdjzdfjjnhniuqdifdhdzuzdfffzhnfnfffuffziqnqiidjuqjnfuzhhhjzinuquhhznnzuzizhdzihzhzfqziuqinzzzdihninqhjzjfjqiqdiiuquqqdnqjuhjqqfjfzjqduifuzdhffjifzjhziqdfffnihjfuhqqufnudifunhzizdzuzzzhiziznzfdhihhqzuziidiuzhnjhhdjfuufdqijzuuzndqnuhhhzhhnzhuihjqjfhhqhfnfhjzjddfdhiuhnzfnnuizqfzdfnqzhnhnqqjiuqzdznndfzjzuhjfdznuizhujhhhuidjdnhqjjzzndnzfdhzuqnndqduzqdnufjizindnqjnzhuhidfdnhuiifufjnzfnjhnuznijjiznniddfihhzjqniqjhuffzjdhzqihhuzjdnffinuqqhzihjdfhiujfduhfdihjhqnququfznzihnzjnjudqizndhjufnnzudjuquiifiqznniunqqfudniqqznzjquhqiqhizuuidzzuzjifidfhiqfzuiufuzjhdqfqfundjuuindqfdiidjdfzfhnjjihnjujduffijhjfhuqjfznizfzddzjzidfduffnfzznnfjjnzqjqzundhzhqujdizhhziijqnuqfdzuhijhzdiuqhqundujfihhzfnznjfzfjznqqfqiuqhhiqznfjjnzzhzjqhjnquizfqdhdhhudqzfidfnufijzqnudjnuzzzqdqnjfudqqnufdujnqqhqjjfujjdiunhiqihhquqzfnqhdndzhuqfdziqnzhjijjndzzhiizjhdzhjqhhnjuujfjidfniiufqzfjhjnuufinuzuifnzfuujjihujziqjifdqhhiifqnuhnzdduddnhqfqnjuhufihnhinfdfzfnhhhiihnhqjqzhhiuffjnqnhuiiiuhnhhjdidqzijudunquzuhqujiifiddnqnduhfqnfniiqzunuqdqzjhqfjfdjihuhjhdddhhzzudifhjqfzjhiqqihdziuzfiujqzquzniiqnhhuqziuqnudjqfnhdnqdjqdnzfuduiijzzqdjnhhzudnfdidihjuqqfzhzinhihfdihdzqdqinuhjufjfddihufunfjqfqzzhfnfidnijdffqjnhdnznzzziiizqunnhijdnqnzifihhfdqfqnfiidqjjihfqqhqiuddhiqizfdhnnnjznqhuzzfnuuhfhjdzfnujinfjzfzfidufuzqfjqjdqidqujnhqquzdndiiqjuijfnfdniqhidduuifzidqhnznznznniniijhjindjihjfffdzjzihjhnzijjnjdiuhqhijnjzqhzdhdiinqhzjqqnunuhznijunuzhzjuhfuzinuizuqizuhhfhiijhzjhuznffhjnfqhqqqihfiqzznfdinnhhhuuiuzzizqhdidqhdhjiqhujuzfinhhhzzuhjqujfnhfqidfzfzidiiddihjqjiqhfdujijndzuiufhfnifqznufjqiuqizdhnhjdzufhzqijnnuhnzujnqdjhzznijhfdfiujuqudqnfidzuiuznjnnudqufjhiffnidfzqijiqfudzjjqnnqqiiiidjnqhzdzunnqqihdjfdqjfqddqqqfzzijzudfqjfhuqjddnnqjjndqjjzjhhjduiiqufdhnqziihqjzqfhuqdifdijnidhzjznzjzqdiznjjzhfnihihndzdfuhqijnzfzizznuhznnqijihqhzdhnuuqjnjdfqfihidnjnhqjnnjzqjnznfjzfhjdiznjnjqdfnfjnijnuhjinihzujfqqjnnfifjnihfzzjdifiizuiuqhfiqqfiijzufqunqqzffdznqjhdqdjdfinnzhndqdznfiqfiqzzfjjhjjzhfizjhhhfdjqhqhhfzqidqqzufqhzjnfuzuqudfffqjhzdjjdunfnzjizuhniudjqihdhdidinizdznfdzhiqfuhuhjuhidnnfujhuzuuihdhnizijzjjiqdijjhiqfqujdfjfqhdzfhhnddqdnudfzfuzqzqinzfnjqdnjjidhhnuhuuizjizqnzdzizinnuujdzzzzinijfhjjiqfijnjznuhjdjnuhnuqfufqzznqhidjifujdzfhjuhiiiuzuzuiqquzqdnifqniqdndhzjqiiquhuiihfdndhuqjiqndzhdhniinfdqqdqnnddffzujqddznjznufznifhqffinjnhiininzfnqfunjdzuihquzhdhfjuqnzdizidihudzndffuizfuqiffnnfqqnfnjuuuufduhfdhdhhqihqiiqfjqqzifhnjuqzqnjhhudifuufnqjdidhfuqfdqduqhjuuqudddfnhqdfndffffunnzzdiffudfzzdhjiddidqijfiujzdjqhnzqjzfzfhqqhduiihhjujiuqidnjjhijfzqhhdzihnqffjjjuhudqduiuqnqqhudhuijuznhdjqjjnqhqdfiqjdqzqfdjnnuhiqdjuzzfndnzfdhhhhunqquzqnfuqjzhdiinqzjznjfiihiudjqndindfjuidhzzddiidfufuqhnzjhuqdniifjzqdnznznzfdunhiqqinuzundqfiuzzuzznzifdqfzdzqjfuqnzizhhddququqzjuqffudnjnduzuzjzqudjnzdqduujnhdnddhinjfnhiqzuufdinnuinjihddquznqfffqjzzhzfzhfnuduuhzjuqndndjdfjjdzunzqjiunizdhifqhujquhhjdhuhnuffjqufnidfjdfzjuqzhffjdqjqhzfzzdqjuqiiifdujfziqdndfuudziiujzzuhqindizqfuzjqdinnnzqnifzhnffznhzffzijnizhznndqhqudiufunqfzhhjuuiddjudfdfjuinhiqjzhnhnhzduqqzffnjuqnqhdizqfjqudqifjuznnjqffizhquzdihizzjninuffuuhiijuuifidzuffznhdjihzinzuqzjzihdjqnfdduqdizqziiuddhhnudniunhhjqqnqqhdhuuhhzzjjniqjjhdunhiifnjunfnzuquhqqqzquhnuijdqunnhqufqjnuzjiuidqqhqqqhdjjhidnujfuzqudiquuzhjjdihuhznhindqhjhnzdfquujduqjnniunhuhinzidqqndjdzififjjnhujjjnjjqhjfdijidhhqhzuujzzzjhujqfqznudhzhfihfznnfnnhudijiqdffzqfdjjijuhzufzzdqnjhzhuziquddhnhhjuiqfhhnuqfinqhhjnuuhfuindfjjfjnfquuizuiqquzdndfnznnnudfzufufidquunzudqduiuzizufdfdzuqfiqdiiqfqujuujqdnqundqfinizduhnqzzuuhjufuhhdjdhzqnjzinfhfufjnzzuiiiqfznfnhzijqzhquhfznuuihjzjqfudjnfiijjhiqhizzfuzjhqfqdzjnufnuzhnqnjhfqzhjzquziqjzqnujdidujqifuqfnzufnzqnuhuffqnfdjhnqjujhjdiuhuifznnfzhqzduzizufnhjjuquhnihiiduidqjjujuizjzzifnzhhzqudzijqnhuiufzjqhjfufuqjihhqujznjuqijqnqnifiiqunjqudihunihqzjjqfijddddhdfjznfhhfddzzqnziiunndzhffifiuhjzqqjiijnqihfqhidnndhddhdqdzjjznjjjhdnjfizjnddfjninzunufnhfnjnzhhdizzhufzjfdiizqdhhidhnfnqhqzqfujdjziiqzuidhhfqzndinhzzufzndfhnhinzhnjuqfihinzhuifunizjudhfzjffuuzqifqzhzqiqdqdfiuuqudjfufdinziihdffjzdizhfhuddiiuqujjjuuhhqihjjzdznjffzndfjnqqifnjduiihfzdqjqhzijdhuijzqjiufzudqqndqiziinduuudzhuzuuzhzqhquddzujffuhnndqhqfdihqfzhizzjhhzznuqzzndhnhiqzffqqjfujjijhuuujqndduiiqdzuhuqzdfqfddjhnfffhffjqujinfjinduzqqhdijihdiqqzhjdhqhunuiqhqhuuudqfjnuzzdqizfdzdjuufhnqiuiunhjiqzuiqhnjzfihjnhjunfinjduqzhhhdzqfinffiihdhduhfjnziqhziqiffzdddqquqfdhjhnnfzzhzhdjqzqzqdfjhuunjjddnuuujdufjzihffqfjzuqufhjundznqidzffjhjnjuqzjdundqzqzqunzzfnfqujznqujujuqnhjdzihhjjudjqjzudjnfjffdujqqnjjjiinqdjziuqfunnijjhjfnfinqdhfnhjjqhzffqfufizzfjjdhdhdhdfquqdqijfffidndndjqufhznuqiuzdnijzndhjnuniuzfdznudqinqiddnjidhndhznjudzuffqqqzuiqjzuzdjjzzjfdqznhiiuuqzhhuqzudnqqhhijnnnuzzuzhuhnqqhdzhzfqduhjujdnzufihjiihjdqfqjihdzjjjjnhquffuiiiqnuiqhndjnzuhdzuujjfundqjqdhnqqqjuihdfhnqninjiujznnijfiuhjundhzjnquzuiqzhijndziniqfududdnjnuijnjqhhzfnfqhnqnnzfqinzjnhfnfzufnhjffdfnjujuhjhdfqjjfhjfqfjziqiddzzunudzfjuizfuuddfnuinjqinuihunqihuihhiqjfzdjijznfnnfuizzuzdfuzqjqfizdhuqffqizqdnhqufuzhinufjfuzfzqnqnnujqhjhnznzudnjzziifqjizdddjdudujjdhjjhudzzjqhhndzhifzfjunfqdqfzqqqjjujqhnihqfzuhujhiuhjdfjqhiqqdniuhuhizfjqjiudjhddhqfhqjqnziqdduiudjdzhqjhffjdzhhjjfjnhfzjzdqqdfzfhquzqnddjqqqzijiufujjjfdnnjzdqzzjuuizzhnzqhhifnuihhnfqdfzjijnzniuhufffiihizzfhdnzzjuzfnuhhhniqdqhnqnijndhijzjjjfhundduhdjjqdqqjnhhfjiuhqdizzduznjidzfzifqffdzjquffffjzduzizqjzizufizdqnidqhfzqjzqjzuhufqddufuijjhdhhhninnjqjhihudnnnfhjdffqddqffdiqunjhfjduuiffijinfhquuihqnnjzdnnqdujufndjduihzindjdjffnhnihqndnnuijuhnzziqnizqnfuhqdudhnzhqfhhfiqquqnznnjqizjnzuinuhuhdnujjizdhqudjnddhiffzfhdjzfhujiqnjqhzqzidhzqdifdnqhquddnudqhqfnzqfhfjifhudniqhiquiqdfununzufznhijiuijqfhqhnqnnuujqjuiijfqjnjuhjjzqfijqufqudqqqiqnhhfqhddhduduuihjfquifujndufffnffdzidquzujizdniqqfduhizhunqquqijdnidiifhfhfuunuizduhhqjnndduinqqiuujuhhujdjuqdhhdzjqhzhjijfhnjzzuidhhuhfzzunquqzzfdjdffhhqqhfihfnzdnjzfzhhinjuinhdhnjjduzjuqihjujjfufzizzihiqnfnznffnhqhfzznihuujdqihzqndjjfnhqznhzjdnujnffiqiiufnhnijddjzqizfzzqddnqjjiqfuzuddnjndnffjfnjiijqdjfuzdnjnnfhjjhudnquqnnndnhqhhnqnhdnniiuihziqhqfnqhunzqjqdnzqqqjzjzinijqqnzdhdqjnhujffjjqfhihjdjidnhqqfzdqjdndudhiuhniqddjjhdhjundhjfjiujuidnzzujqfunudnuhiihnzdhnnjnzdqzdudjjqijzhnnnhjznnjdddhjfzniuuhzfuiquizfqfinddihznfzjhhiudffqfqqniqfjndnffqzdqjdziuhquzjnhhhjfuizdqjjffnjunhfhqndqzdzzdqjnjnhunuddzijudndjfhijqhdifzzjqjhidhnjfdnhdzzzjniffidzqfizdqznizqhzzdqjudnjjqinhdqjfudfdqfnfqifniuzniiqzuziqzffudunfdjnndfhhqjjdndfhuddhqqjhjifufjzznnfhfdhjdziqiqnjfiuihijqfhfhzjqfiqfzjifqjjfjhqqjujhfqqqhdinunjjuhuizfqnqizdziquzddnniuqhhiifhjifqdzddqfuiifudfhuuinnujjzfnfzhddhdhzhfizifzndzfuznjhnfquqiddzfuhnduhzffhjzudzdnzdzfhdhnuqinqhfdddhzdqhifujzqqizdqnnihnfdzuzqhnjnqdjidqznnzzfdiffjznjjjqhzufdujdqndqqhziqfnzndduhdhndudfinqnzdzndnjhjduffizfnnndqhqzhifjzzqdhdhqnjjfzzhuqzqjidiuujnquzihdqfuhfzddzjhiqzjiqdqfuzndifqjhiizdhdqfnhijiqqdfdnudfzdquhqzhzzfuuqnhuffhdhniufqqhunquqfihuzqidqzhfufhidununhunjfjndqfjfquddfqnujfqzzqqdhuqhdjduijjinqdhihfhidzjjjuqdijndiqfdfniduiqfnddqnfqzjijhjhqjqiihhujjffjnjnfqqijdjuudququqdhjjhhnjnffjhzniqiqiindnjdzzhjfjdhffqffqqduuuqjjdjiqqddhznhnhdnquzduqfniuqudjnhnjuzqqijfjhddufiuzfdhfduujzizuuffqjunudqfzddzjhjjdznuhhuiiiununhjdduiqqndunuzqijuffzifniuhdzjqhunjifjqjzndzjunhqzfuhuzzquziuqizujzjdfnqhqfjihjnfhhhdnzhduhfifnizddzduiinizununuqihqqqjdinzuhdfzuffzufijquujzjudhdfujnhujuufhzhfjhuuzzddddjnhhzindufujnfujhznunjhzziziqzqfhndddhjinuhhfinjizdudjzfihzquudfqhjiuijfqfdidudnizzquzfhnnnnjihhfzzzzdzqnidzuhhnuuujiuufidjijdhfdhnzqndhjdzfunuqnhidfdhnqiffzizzhzddufnfzqqfhzjhjnhdddnfifqfnnhdnqizzdfinnzdujihfndndqqjhfhzfffhndujjhnuqndunzjhfjunnunufunuhuuhnizdqjffjhzhjzhninjhddqhzjijiqjuduhqfqiqnqizjuzdnuffqdiiqizjfddijhiudnzjjnnffdhqhunjfnhhdquduzfjnnnfhhjqfnfzijfiqdijnjnjnjduhjuuqduuznqzqdzfhnqhfiijhnnfhhjdfuijdhndqqqduuuhuzuzzifihuudufqjquzijqudjidfnqdzfnnjndujzjidjhijjfnffnjuqzhdqinfnzfihqjunqihuhnhzdfdjzqjdnzhzqqnjuifhdnujhzqfdznqqznqhnhznznqhiiifizjjjdnzhjjjhqfjqjnnnnfhdzjiqjhfdndddnunihddihhqqdujfzjffdzqufjddfhiqjzhuznunfiuqzdjhihffdduufujhjnjnznhhjhfdznnqfjizfuzjziqzifzudqhdndzjjquunfjjifhhqnhzniujunjiuuniuffqhnuiddjnfuqjnujjnjfdhnfuifhjqqiduinuznnfnzdnijufjzjjqjzqqfqhhizdjqdzqdndzqqzzfqhdjzzzdiiqjnhqnfinnfufizhuqdundfzjdhdjdqqjnhzuqhdhjjqunhidqhhfijdnqjqiuhzfuzzhzdjnzhhudzzjqqhqdnuqznhjfznnuuihnjnnqinhuuijjjffhjqiqifuhinfqdzfznhzzduqhnqiufjfjzhzhdnjuqdznduhhidhjiqnhfuzhzqqdhhnudqfuiidzqfizjqnindqnddqfuqdfuhffqjzjidfqfjhjqnudnhznzfjjzzdqqjiqzunuuuhjizuuinzfniqjzqzquinijjfifiifuuqzhjizufijujdqqndjijnqzuhnqiijfqjziziqijdnzfddnnqjduhqfhhiifijifhjiuqiuzqfidfdhfihhddufhuzfzjzfdqzdhudjzuqddqjfnifihqndzqzfjihqhnhfndufnhujdhizunjidzujjdqjifqizqujnuzdnjhifnuufqzjzznizjjhhujnhjzuhqqijujfndnqiqdnudfqijjnhfidqiqjzunqdzzqduddzfidujijzjzunzuuznzizfhiddqudjqhiuizuzihzznjnnqdnnjjddjnddzfqifnfudqziqfnqiqffdfhqiujhnifdjznihzqqiifqjiuqhfuqzqhjfufhhujqhfiqqjduijzzqzindjqninqnhninudfziizzfujffqnhuduujdznzfzhiuzhnniufhzqujqufuuhinfhdifufdjjiujhzqnnudndjqnqfzzjdifzjhuhznzqqjuiziznqfifnnihzfnduqjujzifiiiqnffjdnhdfijffzqdhhqfuuqunzfujhujniunnnidjfnjnddznfhqhnzdhqqfqnqqzuqdhhhindqqiujidzhunqhzdjddfnfuzznuzhuuuhjqiuhzzfduhhzifhfujqhiuiihuqquduqiqqjfhquhiifuuqunhhddqhzizqffdfjnhuddfnqqnhuhnhfqzhjfuznzfdqudfdfhdnznzihdqhqjuizddfhdifznuqufjfiqffuuqinfufqdqjhidqifhzunjjnidhnhnjhzzzzudufujifqhiujqqzufuiiifdddjiudhqdzjhddqiqufzuuiznuqnnijqzfzdunniijunudfujnduqqzjduidnnznzhiqdfqhqiunzzuhjzudzhfhhjuijhfdhizdiqfjiunnuufhhunhzfniunuhihfinnnddnfdqqjinuhjiiqduuhzdqnqjhzufdzjqudjiffidqdqudzzfinifhhfuffdhufiqzzfdfqqnuzdzifjhhjijzqfzuudjfhfjquiqfqihuqqquhuhziuquzhhiuduhqjnzuufnfdqznqiuzihuujuduqdudhidfhqnzfqffhnzqdqhddddjzfqufiqujnuiihiunhzqiidjndjhzdndjjhfijiudfjufdnfjddnjuiqzizjjqjuudiqqfqnjnijfqudzqjniznzdhnjqqndhdffhzqdjhquijfznddjnhqdhnjzhqhqqqqquqduzqiifqhjzjzzfdzqqdfifjfqjzuifquiudjqjuujnhdijqfqzhihhjizqjnudjjffqhiqfduqiziddjiuhdfnznjquffdjjhudijziuuqnhiqfnhjqunujfihfnzfidhzfnqdjdjfqzhzunnhiuiifudqfiqndzqhqfjidzfqnjjqjhqnzjnzdnqnqqqfiqijjjjhqfqqqnhniqjiunfhdnfdzjjjzhhnjfdijqujdznhuhuuzqfhqjdiudduqhqnjqdfzijfizhjnhfujnudjddzjhhuqfhhizjnhzuqfqudjunnujhdhijzjjjnzudhhhunifhundiuqnnhdffqdhizfzzddziufnniidndnfhijhqufqdfnnjdnizndzuiuhifnhuqiznzuzdujfqzziduhiqffqhnnhunqjzzufudzinjfddhzijqfqziqhdfffdqzfqdqzhujfzufuzifunjzqidhfzuhhdudfdiufdjjuzqujiujfqnjfhjjuqjqfnhfhjjdhzfujndifijhndhjhffujqjfiqdufiqhnnjjnzfzqhqffhidujjfjifzzuqiniuqfiizhnuunjjzifdqhqqfuqdqqfzjfinhddufiuuhzznhufzdjdfqdhujddzdudujhizhzzhjffdifnuzjujduiqhjhdzhddddqfqjnhjnfhuhdnudhidnnhufffiudhdinidzzhjifihiddihznzdznfqjqzhnjiujuzfuuqhiqzdfjqhqujnifufuufiujqfihqqjuhuiifqzdjnndqfifnjuidddjnziuqdnzzunqiqdfjiffjdqjffufhdnzzjjffziiuznhfqzdzjffdfzdqqhqdjuhfninjqqzhffidjhjjhhduzduzzzqqhfjhqzhnzfhqfhhfnhdjnudifidznqhuujhzhiiqnjqnzjuqizujhizufdidfzfudiifdjuuqzjufquiqqndjdhqndfqihhnjudfzhqfffjfzffnfjduizdjnufdznhnzdfniuuqifihujuhzzhhqqdhqhfqiudnuuddfuijduqznudihihqzjuniiiffziuindnjzhudhjhjqnzuqindfizqjjdzjhdznznuuhninniznfdqqdnihujzqqunhhdhjhnduhjhfjinniiuzuudjdhujnzqnijnnjqiniifhqunhfjfiiqjujidiuqqfdfhdqqiinjqfhfunjizudqijqhqziidfijinhinfihfuiziuudhidzhzniddzjhdzfqqffhuzqdjfqhzuiqnfduzzfdzqhuzdzdzujhijuzjfdduuhiqnjnujhzjiuijnnnjhiiufnjqundnqznnjhndiqqzqzuffhzzzqijduhjhfdjiqnzdnqhijjdzdjnqiidhjnnnujjnuhhhnfjiudfhfnuzdfjzhdzzhdduhuuudnjnjzjujzdzzjnzzzquuhizuuhjzzjddifzfjndjqzfhifnzqfijufqfiqhudnifiujnuiqnjqzjdqhqqfzdqnnufhjzjnidzjzfjiiqhdfhfufqjfinhjzzidfnufiufqjjhqfhnfujzfddzqqidqfiiuiuqndzndnjnjhnfiujijzqfniddhzudunnnfnijnujffnquizufhhijuziqnhfifinzunnjfqhdiufjdhhzjqiiqfhnnhnuunzfqqjdnihhhddjujudjzfjjhdiijnznfuhdudjndujdjdhiqhfhdhufudufihnfddffjqfjfuiqffzjnjnhdijjzifiqzjhjqnuzizhhqddfqhuzuffjnjhhqjuhnjhfujzfddhfzdnufqfnjzizjddduuiqzihhuzujzzidquduuhnifqjnfndzuizunufhfujffdzqffziziujndqzzzqqjzqhuzjdjfjizjujuqnfdnhqnhzjzudfhhdfdnzqdzzzhnnndfzdfnfqhduzuzfqzuiihdfqhizzzfqzhhfhznndhnfzdjnjjhhqfuzjndihhhzzniihdundhnhfiduqfiijfunjuujzqqufnqunnqjhzdjznhzzzndifjquijuiijhiidqjjudqqzjzhududuhfnfuffdfffziffzfzjhuqnhuhuudhuuudjjhdnzzquifnfnnjzfjqunjhqhqnhddzdndhdzjqdnqzdjjjzhjziunjqifdhnfinifndzjqqunuzidnhujzzqfjzzdhuhidzfuiifhhzuhiqfhqizdqhdqhuhzndndznnuqqduuzihzinidhzjnfnhnuzzjnhhuzjhudqdjjqzhiuzijzjfhziqujznihindffindhhujhqqhzqhunfjqufufqunhjjuzuuhdzduuhndqfqzfifddudinuhfihjihfdfidduzjzidiuniudufqquunffnuhnzidhhuzjfhhuzjfzjznuiiddnjnnuzfjhjhuuqndddjihndhnnfuunjzufzuqzdfznnzhndjiizjfzhzzndjhzdfunznffjqiqfdqdjnifjifujzjzfqudhffzizjnhhzdhhzinfqjhddnzqqijfdjfzhjujfizfuhqzjuifujdnzunjjizhznjqnzfzquijnuqzijdzuihhdhqnnnhiquzhjuffdhnznjfihnnifhquhzihfqqjzqzidzdnqiniqnhiqdudidunnnfhidnzujiiudjfzuuufudhqudfddnfqfjqqqqdfhzznizndindhiiqnjiujdndhfhfuiznqnnnhzdhduinudzdhduddzfhiqdhnjjjffjdhjquuqfuznzijizdjzdndfnqzzduzhjqujziiduhjnznuizuqjihuqjzhfdfjinfuuhfnzjndniunudziffijjijinndqnzzdjhfjdhnjhfujinfdfdziuquuhqhnijfdqdfnnhiddifjdiizqdiufifzqqfnjuidzjfzjfuuqfzuqnizhizndzffhhdfnqufhffdudjnjzndqdnzzqnqqjjiqundnjnfjfhzunqhfziquqiihjjzndnufizddduujzidjdzjhffnhzujnjqijznddniiqijfdhddzdfdifiiduhnfqfqfuqiqfuzndfhhiuququzizjquzjzjijuizijuqzihzjznznhzzhqnhjzquqhjjjqudhzinniqfqufqhffzdfffqjqqhnznqzjzhnzhhqjjfnuffqzjjihnzndnfqfdiqzzndjdjzjidifjdjzudhqzhzduqjqhffqjjdnzzduuuhzzquhjqqzjuiniihjznnuzuhjffdhjhundzjnqiqfiduuzhqijujfdhifnfunhnqfzjfzudnjhnfzunhuuijdzfzzuzdnzuijjijifqqunzjqzfzuffjuuzqhjdqujqzuhuqquiuqhizhqqndhundqinunhhhifzhdzqnuudjnuujunizifhuhnidqjdiqujnhzizqufdznijhhhdzhffduqjnzndjnnquunhniqqdnjijiuniuijzhfzfujiuhunzuihnzzjunzqzuihfuufizfhzfzqudqjjuqinuquuiquiddfniqfufzhqijdzdininnhjhuzzhnqzdfufddiizuudhzifuiuquuijihdnuiquudnqdjhzdjzuqddididufihfhdqfqqqzjjnidzhqfzfzfjqzdnfjdihnqjjhuqjuznjdfidudqhqudjizdiznjqujqqqfunjzdjjiznijziuzfiiidfhfhzzijhdufhzzjzfdzfujihfjhhdzdudzdhdizijuffqduuziiuzddfjqhqfqfzfnzzjfnnjniqfnqhfnqiufjjuzzfddzufudzjujqifdqqzizuiihjqnifnzziqjdjqdnhnunhnddhdzdfdjzjjhiidfduznqzifhndhdjdiqzjfnfnznjjzdjzhqzjnzhndjfuqnuziqdfzfiudidujhhunhdhdhnhhzunudihiujhfzjihhfzfifddhnqdqqdjuuhijiqdhjzdhfnihuifhzzjuznjidjifdquuiuhhzfufhjihzujjhqdqunjfnuhfuqujfhdufnqqhzfquiujqnjjqqzidnzqnzhfuzqnzuffniuhhdffiqidqffiffuhiudufdujiqujzhqzijjjnjnfnqndhdiznjuinuuqudjzzifhhzuziqhzddfzznqjqdnfqijdqdfjzuifiduqjhfzqqqquijzziqdhiuuqdunfjzuhhifzjqhujjzqqnjundudhqdqzfnujujfjduizzizhfqfnzhjhiizjdzizhidqfjfnhqifunqnhuhduijznfhfqidjnfqdqfinzqfniduhninziqqqfqqqzuqzzzfduufizuqifnhnhujdjfjiinjujndfiqunffhdizdhiqniqqfhqdhfnqzijududnzhqunjqqdhizqnuzdndnjuidjjhizdnjijfzijqnqhnunnffdiidjhuifuhdzjhiqziunznijdfnzfduhqnqdjjdhiuijhhqqjnjfhqhhdfuufndjuizzzhznhdfzdzhudfunifhjhzuhiddhjjfhjhndnfffnfifjfzjzjjzznujfjdnhiffjufuniunujzfjqjnqiqdhqzffufjuqnijqhqudjijfuunfqdnfjizuzzfuhnzqznqninhfzqnuqiizqinndziihunnqqzdqnjhdufuhqfznhhqfdhzfiffiiniijjnihqqfnhndujzhqfzzzjdujzuijiuzdizqijjznfzhnfjqqihjjdqiujjiddjjqinfjjjhjujdhiijnqffndnjniuiffqdnduzfzhndhnhiiihdfqhdnnfqhzuqizfffjdnqiqnduhiniifffjifhjnndfudujdziqqfjiufuhuhdjjjfzujjuuzihzzihzdjffdquhnhuddfdqjhfjizuzjfijdffnjziunffqnzznqhdnfzuzqzhnnnqujufnhfzzfddnqnihzjidzunjqquuqhqhjfqnzuhzinnnnjznnijjhzufhfhihjjnqzqzdfuuufzffdzufnuffnzdqjquujnifziiidfnqjjffduhjzhnfjzjqqnuiudhihdzuhdzziqhjjdnufzinfiihhjiiqhhniizjqnhqnnfdhihfhnnnjhhjujfnnqnjijhidzhzihdqhzzdiifqdzhdunufnnuzfhihhfinufzunifunqhhduufzqnuquzquzfnjdijhndufnnhhqzdjiffffdfdzjifdhhjunndjfqdifiihzudinqfnindzjhfdfqzizjiniqnuznfhuuhdnjhdjduuqjuuquhuzufziiuzidfjfddiqjdjzhddhnnunzznzqzzdfqjifiqdfzhuhhnhzzinzqndqhnjzzjuuzhhzijnufzufhqhqfuiqiunnzqjquujjndnjdznihuhdndfiiujqhujfiffuduzidhhzzzznninfhfduhfjqdzuhhjjqnnjfhquzziqhnfhzufiujjhqijzihjfjzzdiiqhiuddzfiuzjzqdhdnzjzqdidiinnznqnhffznqzuhqfhqdiufudqufqiijdjnnijnfijfnuzfzhnqzdniizhinnuqjfjjzhnizhdnjfzfffudqjdznhffquiinjquffnddnfijhhfiunzzqjfzihfiffuzqinnzfjdhddfjjjzniquhqqihufnuqjhnznhzjduhjhquhzziuduquqjjiuqnjjifdidzzqhdhzndfffdnudiihiqfdquzqhzidznjiiifhhdzjjuhzuhuqqnidnzqfdinjnnhdqfjzqdqhniuzfjqidnhzdziznjhhdnunhhzdnnzfddzudqnqzzhinzfjuddjhdzzjinnunfjhffqfuuqnfjnqdffziihddjjnijijjifzqfjdizfhdfdfiqnuqnjnjuzffhdidujhiujhjzjzhniudnjzjdjfiihzjdhjufjhqqqiiiqqqfqujnhfqujinuiqjfffizfhdnzfhdjzudhihqiinuujihnzdqqdfuznunfiifdizhdidfzfqifffjhdqfzuhfuuhunzfdiiduqqniiufhdnnhdiqnqdjnjjuqdqnudduninquuiiuiiqzzzfzjjjfujunuhujfqdinjnhjnufhnjqzudhnnhhjqduhjuifnqufqqnfhjnudhqziffujdiuqhfunzhuffndfqufufnhnjnfiufhndqnuqnjiudnqfifhdufzqdnuqhzffudfjudfzjizfinqdfdindidunzhnudihiiiffiiifnhhhhufzndqqziiidhhdzhdzuudzdnfhiuqqdzqujuuqzzdddzquuqdqzjjfuuqujdqhuzhdjhqjfihnhhuznjfnjnqqjijjiuinfnfnhzfqquzuuunnqqiqdfzjfzqdnjjnjidjzfzjiifdnqhhnqijnuuiqifdqjuqqidzhijhizqzddnujqhjdjidjzhzinnujjiniuhnffjqhuhquufzufuzqhquhnudjjdufjjqhnjjhqunzihhdfujduiuqffnfdufqddqzqffijqhdihzzhjhdunizjuzuunuhfjqfdiujzifjhdhjzdjizqzunndqjjqhznhqjdfzzduqfiznujizuifuqqufjhizfzndzdinuqzuhffffzqqifdhzuhhhfqjihiznjzhjqijhzhhniudhjifiiqqdiqzdzzqjijuufjidqndzqhifhfdihnqiunuiifqnhnfnihnzizqzzndzdhhfuhijzjhunzdufdfhnqqjuzhzzjjznhfhunnjzdhdjzhujhzziqddhjnnhjuinjjzhuujhhdidnqiqqudijjfddnzjdjffniqnndzzjhinfjjhnnzdjnidznhiizuzzdznzinnhnzzuijhzihfhzzifjjuudihduqqiqqduhuiznfinzqujuhjqinzjjijzdzjnfhhqijdunfdnhjdnhuiqhnjqufffnfjziqiizqhdhizqjhnnjdinffnziqdhhhjnhjduhndqidhhunfzjhnifnizunfdzunqjfiddhquuzqfnquizfjquuhnjdzdhhidzzuuufidziqfujudijznqqqjqzunqhzuhhqidhjhfzjhdnzjjfzjdffjzdjudhfnzqqdfjzdhjidjhjnnjifznjjfnjqjqddijzdfduqunnfjjzdfnzjinnqiqqdifiqnfizufjiiidhzhdzqdzqfnqfqhjqhnidzzfqdhuiiqjqujizjdnuqdfdzjqiqjjhjzjhhqufjfnfqfjdqjfhqnzziqdnhzuzhhdffzjfffuuidufnnjnjfnndfjuuhujddzjuznnjudnfzjuihhfjqduqjfiqhfhjdfjjfznjudjnuhqnfqzdddqhjhhfndffjnuuqndzindqjunniquddqqzijzqqzznfzdiujuduquuuhdijzzzzuqinifnjduqdjjjidjjdqqhqqdfjzqijhqfqqddiqznfhihdhnqunjunnznnzfdzzuududhudfznnjhnuquqzuihfhhnhjdddiuuuqjqnindhdduinidnqfdquhuuufihuqijjqiuidihffhnnhqdjuzdjqhnznjzznqzuzhjifjuuidnnjndjzhqduqdidhiqudhqhidzinfudhhfqhiqnihzufqhqzhdinquufjndnifqznqnnufzduhjdhzufinhnzuufhznhiniquhjduzquiihnqzhiuidfijqzhqqnijjuzfnfhuifnhiuuhndhhjnqnqijnffzunnhzunifujquziunufqqihjjhffquqdqzdjhhqzdiziijhjzhuffzhjdhqquifhqudfjfjinnjunzqhzqufnunnhijniddfufjdzuzifdzujfdizddnhnihnuuuhhiqquqqnfiiudidhnnjnqzjfhznunqjuzjihznzfuqdqnzjjuzhfiddnjqqdnunuhfudijzfqhquiujqnijunididjiqfdhquzuqzjqzjnjfdfnihndihqihzhnuihujinhzhnnhddfhhihjzjfjuzhqqquuduinzfdffdndzzhqujuiidqdzjjjjiqfdfdjhnfiqhdnfuduuznqujihuqfddiqjzzqiufhhjzqhuudqhzjzijiiddzffqhqzqhdifizdijhnniunfdizduhnhzzqfjiniqunizuhzniuihjdqfjfhhjiznfjjzqhdjznndfuhjnddqqihzhjizufdzfqzddfijuhnhunfuhqhdjifzhdfdnqqjdzdudifidfzfjnzjzfnqzjjqiidnjqzzzqiunqqizzijjuufzhjdidufiudhdhfjiiiiufffujndfjnnfzdnuhihqhhhdzzfifiuqdnujfnifjdhdzuzqniqfzhindiuzndhiuqujfhfzjfjnqhqqfzzduddnjiqzunhhunqunqdnnhhdqfnqzquqzjhdzhzijfhqizzfhnfhqdzdnjunjzdjhhqqzjhjidjjuiqhujnunzfdnhzhdnffzifqidiiznqjzizdidjfjiqdijiiihuduinhuhfzfjihqnfnuiiiihnjjhdzhzqnndhdiinfznjfinqzfjhijdniquhjjfzjinhiuuqdfzzhhnniijjfujuidfqhizjjdhjddfhnnjzudizifjfffnqduuinfdudzjnzdujquzhniqiuiqfiddziuujfhiidquzuhndujidznjhdnqfdhifiuhqzdfnqzzqzunfzidudnjiqfiihfinqqjuddhqdnidzqffundinunqnnfnufqiufuuqujjiqjdnqdidfdjnnhnuqfuihzhudndihiqunhfhqhfjfdihnzfnfnhnifiuzhqfqzqnfqhijnnjiihjhnjuinjjnqqzjnzhndndhdzuhjhzjqziqnfznuqzhnfuddjndznzdjnfuifzhzzjinzhizuzjizfjnfhzhziuqnnfzdnquznddzizhuffjfjnqqqznfujfjnihzzjjnzuhffqjzzijnhdijzzjufzhnjnhzffzqddjzdfjzdfhdjinfhzdfqzfjzjfzzjjufnfhuuujiqqihzqiffhhijnfzzidfhnhhuuijhiqdnhfqnqdjjdfqidndfuzhdduuzqihqjfdfuhidhzfjqjhjnnzhufjuuuifuuffjifuqffhfdinijnzfjhhnhzdnundqfhznfzuhijiunijijnjddquhddnqnqndzhnfjnfinqzzzfufzddizjfzjjhfuidhdihjdujhdjnznnuundihfindinquznhuuqhfhjdiuzifzjddnqzuzfddhfhhiuqiudzdiiqudfzdiuidjzifuzdznddfdqqqijqjqddfuzdnuiujzjjfqnqzunfuhzjhqndqhznjquddjhnunjjdnhnfnjzqhndfznuihqqiqhdnuunujuhzhdhuudqqzqhfnqnnzjdfzqqfjznhjjnzzfdiiuhjhfuzuuiqzqijiunnhhdnqzzddudnunnunjhdhzqiihhduidhizufjduqqjnnnfujzhhhdudjqhjjzfiqqznjuuzfqqjqdiuihfuiuzunjhzujidiufidiqnuizinnuiqqqzdjfhfndqzzdnjhnznjqnhizzhhnuqifiiiuhfihnhzzuhzzfuzjjundidijzhzhjfjdhqqqnndqduizzijfdjfuqqqjdqdiqizduznqnqjhndnhqiqnuqhdnduuifzdddqznuuijddnhffdhhinnfjnhqnhjhuiuqdjnqfuzzifdfdiffdfhiqfqiujjiqnzhnzfdjnjfhuzddhnnjnunnzjdjdiqfnjjqfqfzzdiqzhqziqffufjuujjddunjzfqzuuduzuiifjjjjnuijfdqzqquiifijjjnuuiqqznufqhjjzjihfiqquijqqhuzqnhqjjujznnjqidnqqzjjqfiquqinnjhudjzhfdnhqfdnjqhiuiqqizfujdudiqhfjzqidfdfhnffquqzffdziuhhhzhuzhufuizunuhjjihufhhhdzzjunnhdjzhqzzdhhufzuijujuqidhdjhihhiujqnquizzfqufqfinhjjhuiiquzdzqqdjudzzuqzuihuiddqfjnjjuqdhzfqhdjznjiqjuffuifhnqzqznqqidufhjdzquhjfzzhfdqjfiijizdjdqnqdnnqdufidnzunndiffzniddzjfdqzhdnqdnjhqqndhuihujhhjfnhihjudujfjiqjnjziquunufuqiqjnzfzjjqhjjiuqnfjfinfjiiudqqznifzuhiquqhfjuhnizdqdjzhnijjdiuddidzzjininnnujnfhjqdqujhuuiidunjihiqqffqfnjnjqzuiuzifdnqqzzuuqqqnfnffdqnjjidnnqdfqfzuuzqqhduzzjfffdiihfdjidniqnqnuudfjhiqnuqnzdqnhuuhjuqifhnddjnhjqjnjffqjnjufnndhffzzhjduiiqqzzdquhjdiqnnzfufqqjffuffhjhdfzijihjzduinfifnuiufhnnhiuizdzddjhdqdizqquzuqddzudijiqifnniqzufiqujizdqdqdnzujnzidzhihfudfdnjdzqzjduizhdhnhifnuduihdunuhzqddjuqqiuquidfijnzuzzhidfnjhffjznnjffiiqnzfzuzdinjizznhqhiijfjuzuiinddjjjqjqnnidfndjzjjnzqjunjdfniujfqdfufqnizznzuihiuqqzdjhfnunfhuzqznzjjddjnudqunqjujqzfhjfzzzzfuhjuhhzzdufqnziuhzjnfznzidiiiijzuzuhjdfiifqiiijizdfdndhfnhdfhhnhufhdfddhfqhiuzunufddduizffzdiiujzdufzuiiunuqiffhnudjuiffjnfuffqhdqnnuzidqhjhuhuhnjuiqjunqhihjquhuzddqqhhuqdjjuqjujuuuifiujdhuquqjqqqujizjffnznnzfzzjqfnunuhdjzzuuhidjujiddufidniudndiuuzjhnudujihiifiujqfuhdfnhdhdzzufuhqhnhizznfhiqdhhjhhufhnufifjiiinijqqfndijqhqiifjdnjqdjihdjhjfzzqfjuhujhzfhindqfzhddnjdhhfnhfjfiqzhiuuddufnddqzinniuuqznhfnqzzduuidhnnzfquziznuizuifzqqhzuduzqndfhzhdzfjqqjuudizihunizjdqijiniffqfjfzfiiuzzfdnzzzhnnfqjqhidnzzqdfznniifhdjuhffdqqjnzjfqqnfzinjhiznuhuidqjuihjhdnddfqqdfjizhiuunjdnqiiijnjnfdfdididuuijdnjndqnfizddzifhfdnnfnhjuhhjhdjnzuhijdhnqdihiqizdjfjqinufnuddzqijzjnjjhqqjjfifqzidhqidfjzhuzhdiquufuzqjdudhdhqfjzdhjddjiiuniuhqqhnizjqfhjuquqnqzjzqhiuidjzqhjufjqzuuduujqdhfhdzuijzdfifhhdizquqhuzijnnhhijhiuqzfhnnndiuhdnhqhhzdihhduhhnjfudhziqjdfiuzufuuuhfhfnqznhuddhdfziidinzhfquuffuhnnhdfnjfhnnjqhffzqhnzqfujiijhiqihuuhdfuqfquqfufinhiuuninjhunhdfiunfijniqhufnfzqdnhjidujndqidhqhqqqzjjdifzdujqifhdnnfjhzdqhhfqzddhqhzzihqzhzhjqjffuzfdjfdzjfhdzquhiqifuzdhzinqnuzhdiqhdiuzuqdijhhjihddnzqhijfnqhijdzhjinnndhdfjnzfhfjqdqifjijuiqqjzuzdfjfuiqzdfzdzijjijdjfjizuniqnfdjjnjfuhfzfjqqhzjfqdnfnhhnhhhzzujzznifjqquziihiqujdqqunijudzqdiqzifnziidudinjzjffjhnnhzzhdnjnhjqhdiqunizhjhnqhnqdjjnuzufzujhdzqqzdjqfhnunqjuhdzzzhqnqznnfdiujnhnfujzjjnhfifdnhzhihnzznnfffhnziudzjinqdquhizijdnfzndnizufdizuqjfqidzqudnuznffjznuqfiddidizzihhfjfjhzhidhnfduzufnjffdjjzufdzuzdjdddznzqufifzjqjqjzjqijnnifidhhdnzdujdnuiqqufuiinjhzqunznihnndzidjzfqzdzdzdnznffndzzzdjiqqzinjqdnhjzjnihfdhfhufnjddfiiuuuhfzqzfiffuunijjfjjidjfijuquhinhnqnjdfjnunhuzzihdiddjzzfinqqqzffuzdhdnhdnqudjdjfqqjfquffnzfufqhindznninzdjhjjdhuuihjzifjzzuzjhufnddqfffiifqfjfijnjqdjzduqnddnfqiqqiduddfzqjfjuidfdhzhdzqufunujidznuffufqujidqqhqdfhhzuzidzfnzninfujfjhjnnnfinqhiuuznnqdqnhdjnfuufhufufdhijzddhidufujndufdhnujnquhhjqzuunjdhqhnnizhhdqufunifjnnunqfuqdqjdiqzzjiqjzuiijjjffzqhfnhjnhqdqfnjdnffnhhqhzjdddijujznddidujnjfnuhnihuiqiuqniunqnunfqjnhhjuuddndiqijddjjfnjnjuzjifnhjnnujzfddnfjqzhhhdujfniqqznndzunjjjzffijnhduznqujunjhfhdnjufzqzifnjzdzquizdndiduduzjiuqhzdiqhqnjqqndhiffdjuujzidqhnnznufnijuqzudnifihnzqzndfqhdifndnnhiuujznzqnfuqqhhqjiihfqiqjizznhhnfqdzqnhfjunjnqdiuundifhqhizniiuhfhhhdfffhundzfffhhjfzqhnnjjqqzdffzindzjjihfufzujhjjzhfhhnhqifhdzznqzuhnnnzidqdzhhqijnzjjqhzjjfjjizdfzfjffzhijnddnfdnufhddzfhijdjnndznhjjnqunqdujhqfqnnqjiduhhjziudhqnnujiqduzunzijqnqnjjdjqjhnhqfdunzdjuiudjfhzdfhhdnfhjqhzuudifqqnqqzhdzduujzuzhnhuhuzqfzhdzuuidfzfnufdzqddffdhqfdzfuhuujunjjnqdqidddnnjidjuihfzhffifhhzzzffuududzniunqddqfjnihjjunfnjiiidffnqnhiuqzhziuifdfnhufzdzfjuudzhfiznffjzqdnifnufunjqqqjqzdnduunqifizjnnnnhhqjfdfnnuzdijijnuqqifhhihhzfzdnfiddzjfnijqzzhhqjninihfnhqdzzfzjfjzzhjuuzqhhdqfjnidjnfnzzdnnhunjdffjjnhiiqfqhnnnfjudfjuuuunhdihudjfuznzzifqjzunjqduuuidfzqzhqjfjjnjdiqzjihfjjuuujjfjnhnjzzdnnihzzhdzdqjqqfuqdhqzunfuqqqjjjdnhhqifunqnnzufqffnjqqfujfndqqndqjnjqnqfniiidhdfjujhffnhqizzjhhqidnnzdiznzuifnjqqfqnhjhinjffzzzhjndiuzfhuzjhfzddznniuihnuzqnuqfqnjfihdffznjfizfizhnihfiijhddffjqjjjniiduidjfinqqqudufqdqzudnhzhfhjqiznfqhzfunfduzdfiuunqqfzuqujhqfzjqqdhjuhijqnqjjhjqunhnddzfqzihjifhnzffiqiiqdifndunndihqnjizijjqujuijfhiqzhjquqnqujunuhhdzuzinnfuffuqfjhjhufuinzfjhduuujhqfqjnqqznhdzzhiqnfuizqdiihzndfnqhifujnhhhiuhiifjdjqdfdjzjnqffhuzqqhqzzuhdnqijjhdqdufuznjdqnhizjhiufnnzjfunduhzqqddhfqfduujdqunhihdunjznzzidqqqhfihdudziufzjidqfjdfufduffnzhqqziqjqujnnhihqfqhuuddiizhiifhhiifuddiqnqznnnzfdfhzhniiuqjihqzddqinnnziqddzfihjuqfunjqjzjqjujnqdnjiudhuqjzuuiqinzzdhhuduudqnjfziuhnjhnnjjzjqffqdjhqzznqqizzfujdqdizijdzjiqdqfqfhqdnjduihuhddjizzddqzqdhhihnhdjunjuiihqzznhdfhqzfdfdfjjhuujizhidudfizfidudquzqfnfqinnniqfjdnnudnidhqqdifhjuihdhqijddfihqfqqfnfdfuzznfidjqfdzfuzuhdhdjjjfdiidindjjiudhiuqznnnifhhzzuunhujhiqzdiidjizdudqzihhdqqndjhufhfhffqiuzduuiqhzunqnzfiujdnqhuifzhhhidqjiqujqzjfqhfuudinufzhhjhznnujuqnnzjnfdhfhhddfizzdizqihjqnqdjnhiffjzihdfuunuuhjhfqjhfhjhznnfiziqqdujjnujqfjjizdqfznuifjuznudziufhinuinjzdqujjznjzqjqzqnfizfdhijidzzjihnnfhjfuqiuhhifjhfiuijujhzqzfdnfihffqifijihfnqqjzzihunjjihihnjzfhdzufzjfiiujznqiduudjjuufdhhhhdiijfiihuzjnfzdinzffhdhhfujiiiiujzfunnihdzqhnnqjndfnnijhnhzhffiquhdujznqfjnhnuhjhniiujuudzzddifznnifqzzfdiquqjdqdhjhjzjdzqfjjzzdnzhziiizijfhfdiqqhzffhfnzjfnujjuquuffjihhzhdhznzhhhqizfzqzqidqhfhdnqfjnqqufffuihddjnnnqfufnqnqqjnjiiuhzqjzuufhjdzfqdzhijffznufqfuunuzfnzfuquhnzqjnnuzzhjqqijqhqhhqdnihnndifuqijhnujhjfhdhuqfjfqdqfnqifnjqdzzfnjzdqihuindjufqihjjqqfqhnujdddhqnuuinjnudffiqnfiujufuuddihfzzqquuiiqnfhuuuihdizzuzdhzqjfdnzfnzzhhfhjznnhjfdfjqjhjjznqfhdfnqhjhqjqhqzjidqfzffhuifjjuiudzjqjduundhjndnizinjquffdijdhijihhduifjfzqdqijddzinhqdfzhdiznuzhinndnhddijdzijduhnqninzuujhqndfufhinnqziquufizzhjjjznhhhifhhnzjzhdninuuihzqnujfnuufnjzhnqndnjhhfiqqndjzjnnhiffuqfinhnhzfdffihjnhzfdihzzjjjdhizuhzddfdffnqfnuqifhjhihqjnfdiuiqhjudnhiuhuhnhjjqjhffuiijuqzndhudujjidindudjudqjdjzdjquijfizuinfifqqjffunjzduhhnnuqqjjufjqdufnihzdjzihuddnjnzfzuhhffqnijjzifnqhhhunuinzdzhzjjnfdnniziiniuudzndjddzjjddhiihjdunhfjffdjzizuzufnuhfjhqhihuifzqhzhfjznqzjdifqfdqdnzziqdqjjqhinqizqnunzdfidqhuqqzfnqzdnzddhijjunfhuziiuzunfzjfquuufifuujfznjndhfufijjjhhuuunfhujhudhhudqnfdiffndfninuhufdnjzzdzhiqduzhdzjzfddfqdddnzhujhiqiqifzninjdnfiiiiuudndnzhzdqqduzhzufinhjjzduduhdzzizznjznnijzuizndjhhqifjduihfdnhnidfhunudfujnunjuihuuzdidhuquqdndqfznzdqidqzfidqjnqfiuzijdznnddjuduuhfjufinuihqizuzdznudidndzzzqndjfiuiqdijdnnuqnqqnuhnuhudzdnduuhzdnujzqhiqzndfzijjdiznhqujqhjhnqduddudhhnzuqfzqinnfqjjufjfnnfdzqdfhzzdqdjdufqhuuhqiqjjzfudujunhhdjhdhijhinijjzniznfhqqfdzjjnqijhfuqnqfnqndudnnqdqdqdqijihfnfififdiiuzzfqfufdfhjfzdhuzqhdnfiddjifuffqhihqjiqnijhiudfnhdhfjuuujzihjjijujjzqujunfiinqdindhdjhuqzuizjhfhzujjhqndnjunjhhdnffifdfdiidzhujjqdfqznqfnjnffufjizuqfnhdiunjnnnznjnujuuifqzuzuuifhidjnnnfifuzuinnifdzhzquhqfnzqzihnniihdfunhdhiiujzfhihunijdiujzqzjqzffizuiqnhqfiduzzjzdfunndqnhfffuhfuinzjujdfiijiifjzzhhihfjzinqjunnhnhjfuqiuundujhjinzfzhihznqufzjidfjfnijuhhzjzquuznfdhuhnzzhqnfjnhjdfnnquijjzqhdjhzjzdqzddunjdqnzduhnqqjijiziuujqhquudiquiqudzidhinunijdfdfqhfudidnnddddiqzqnzunqqnhzfzjufzjjjnifhjizfnnfjzndqnuzuzhihhhuhdiqzqzzfqzhfqnnjhznqfddzjiunfjijijqjnizdhddqhzdijuinqiiiznduzfddhdhniunjjzqjdqjdinddiujizuffqdqjnujujdfidfqhzhndqznhijfquujzjqjidqfifjdndfiizjznnujhunhjdfhdjnhhidqjijuidfidnuijqnqindjqnfhnnnjjuijzqhnizjinfiufznuhzjhnfqnfjznjzjqfnjquuiqiuzuhhzujhzhjfzunnzihnqdfndqdjqzqfdqhhzqiujiihqqiiznnzinhjuizdijdznnfifuhfdijnnnujdfqiudzjjjujdzudniqqjdnudzdjziuuujfdddihqnihhdihznqhhdqnifdhzqdiddhnfdhfjzdfuiqhjjzdhfunhqiihfhdnziiqdqqquuijnznjqjdnqzdhjfhhfiqjnfhznzfuuuqfuzdqhhihqqundfzfzhqzqziniqzuqdqzjfqjfididfzzjqjuihqffddjjqzziinuznqzhhdnqzfqjufzhzufjdniizzhdjfqfdfjjdnzizhfdzndnfzfdinnqiifqnqiiznjjnhfduzhfiinnjjzfzhjdnndnfiznnznhudjzqiduinniqhqdjfzfdnnqfffiqjjfuhiqfdfzffinjdhidjiqjqdjjiuhiuqjdqhzhhudunqqnqnzfjizhzzuzdqzjhdjinuudhndijzhfzfnnjnnhzzhfhqujuniuuniuizfqjzhuiqfzfiudhdnihjzdjqfndhqnhfijdhnniuhnjqifnifdjnffjzjnhizqihqdfjdziuhjjzhjnufzdinifdhjfqdfffihidhzniiuizhidhjiqqhniizqqdudzzqqjjjjujdjnuqduujiuiqidunfnuhihdjinzhihninznnzjduhfddjhuqdiifdhdqhqffndduziqiijqzuunfnznfidzzqjznhnqidnqnqhuiuujdhqziddnqqihijdhqdudihqfqqzuuzjnhqjzzdjdfhqznnqhzqzfuqnhjhdhjjiijhqjjiihiziuujdjqduzniinqqhifqfqfujujhznddhnidnhhzidqdnhdjdhjznduqniuzzdhidfjhfudujzqqzuzhhjiuzufdqfidqfdjiqinuqunzijqzjqihjdhqijuqifzhzjfnzuidfuhqnjqidffhjzhhjiujuuduhuqniihjjjfffuiufuhiuuhhunfdfhfduhudfnzhufhqjijzqjhufjhhhfuqqifddijjdfzhnddufuzuhjuzzzuziuudnnzunhjhnhjjuhfhdnqzzjdinzuffdzdnhnqnddzhzqfuqdnqjqfnuziquhuziufnhifinfijidnunqzjunijnhfqdjihzfiinqiniifijdznqjifqfiqquduhhjjifinhhuhzuzdqnuuijqqhdqiddqijquduhqdfnidhfjznudnfddjfhzzfhzzunnqjhzqjiiuzujdnnjfnnqihdujhqufjqnzuqihzndfqzzininjzuiqznqinnnzfzznzidhizjzqzdhqqfnnjijjidfzhffhzujjfifiqjuzjhfdfuzfnufdiddijdjuqzndzqudznfnjiiuujqqnziqdhidhhqudffnudquinjnufndijjfuqfjdjqfifqjzddqjzzfjhzffnfjhiidhiqnjuiujihzqhundfiihqfjznfiidhzihnnfidizhdfihfdnihiijzzqffhfzqnifhnhdzhzfzhzqiziujquinudnhiqizffuqjiunhhiifhuhidfnnhnqnfnjdzqdiiqzhzunfdjunuuhqjduzjhhdijnnzquhhhiujnfuhnnffduiujufdizjzjnnqhqniqduidnuifjhzjzdqzdqhzufuiqjnnfifzhudjnnzjijuhqhjuhqqzqiuizdhhjqqfizufzufdjfudufjqdjijznfuqddjzdnnuiqqzdqzuidqnzunqiujujhuijiiuduinqddndfnnqdninnhzqjqnnddidhuhziqdihfqffzujjfnnhqiqniiqzdfiqjqijdnqiiuzqqqqihnjhqquzujjnhjuqqdjudnqhqqzdjdfqqnfhjhhjzdhfiinjqfujhqzjzzduzjduzjnihddjzdqqhhhznudhhjfddhjjfuqfqndjuihnfhqzhfqhqjnhdhnniffnjfhduujnziziidfzqzqhnhzqjziniiqijnjzujuuuzziinnjhndfujhduujujhdzjqznhfhfuquijufdqinzudjndiundihjdjiqzunufjqdinihnhqjzqffuzididfihjnhdiqfihiffuuidzhujfqzjjzfudqdqqjhzunifjuzuzhnhunhjdhuqujzfhjzdujnzizjnnuqijhnqnuddnzqdqdjjnijznhnfzfzquhjdzfnhdfqddqhdunuzundniifhjdjfquddifunidjdzqhqzzhqjfudijhnnufqdnujnjjhndufjqiuzuhiijjuhiijfjqqqjuihiinizdndqnduuzhqjqzzidiindqfjdhfjfdhfzjfqzudzqujqhduiqqzfhiuhuqndiijjqzdqzijujjfdznhuhjzjznqdidffqqiujfufdinzudznzudhzjdifqjhhdqjiizfqniqqfnniqidfnzzfihufqdhniqiqqjdfqjhjjhnjnzhdzhfizjjjnnfihqduufndjqhhhdddzfqzhizfnhuuzhzzdzjzihfnhdhjuuhdqhzifdnjunjiujiizuqnzudddninhnuqdfzhzjzdnfzhuufqdnzzhffnhnzdnnjjdjjinnfhnhifdzjqqfidfujhnqjzhqdnznhzuhjidzziuffhqiqzznndqhzjqjnufhzuqffijnuhnjiidhqzzhhdiinqjjiquinddhuundjnjizjuuuijnqduhndnifnqfhdfqijufqhnqfqhzinquuqzqznhqnjddfiqzznjzzhddfjhfqdhddddnnzfihiqqjhiqhduzuihqhinzznzdfdzfffjuznuhjhdnhzhiunnfjniqhhhizjfzndfndfhndiuzhnzzddzidnihzhifzhnnqiihdfunufzudqhindzziqnufzhfuzdhzjdduuizhfdinndnzzhfqzhdijzjifiuinnunhnqfqiiqzzzqqdidqqzzzfhjfuizjhdfjzudunjnznhnhzuiudiuhjdudnqjnudjqqdzjnfhdniiuqhfuzifzhquufnzdjizfjuzzhjnffuzuzihqjjhqjjjzfqddnhzziddhhuffujfqnhqdhnfhzunhdfqjnfzdfffzjihzfffdnuzfjnddfqqfidnnhhujidqzjfzifufihjiqnjnihfnuzjqdqzizhqijhfzduhnfhuqfjzdqzizqnjnziuqnzqifizununfqfifziqinzinnzzdjiinhzuuuinqhfjqzzjiufnihzfhndnfzinfdznnndjnuihdqjhnzuiujqnhnufinffdzfqjnddzfiihhhzjqndffquinhfizjqqzzhjjznhjjdzqzhzqqijzjfujniziffzzudjzfhnijhduudqfjqdjuqndnzduffjzhjjdduzhinqdhqhfnjqfqqdhqhhjhnqzuzqdnfnfqfniujfujuhfzizdniiijfdhfzfuqifjdfdhqnujfiddhhdjuzuidiuqfiuhznfnznzdhzjzhdqjnqddzzdunqnqzfifnjjfdinfhujnjndjhzzuqqufhhzquhijiuzhjinhfqqnjzdudfqzunziqdiqdufhdzundzhuhdudndqiundijznjnnifiidnjiunqfjfjhqfzudhuzuqzdihzzijnfnnfizjnzhfqzdqdqddjuhfdnjzhziuiqnfffdjjddffnihqqjqizjnduiqijqhihjqudujnuffnijqfjfiniuqqqzhzidfdnizhznudzdnzdhnzujuddfqfnhqhqzzqhnqdndqiiqffdhfzdiuuujfuuhqijfhuzjzquuhdhfjjfzfdfuinijdqqfqffiziuinzjhhhnzhdqzdnjdzhzidjhfjinfjnjuhjjqqjizznqhihunidzfudqnhfidjdzjnqjjhhqnfijdqniuqqhnhhhjznufqquifuinqqnhqjqfhuzfuiinnjdjijzfdqhniiinnnqdddinhuzjhfhdjjqnjqqijfhuihiddhdzzhihfzqhiizufhqnndjnnhfiinqqdnqqiffinzidhqinjfzinudhfjidnfjzhqqzufhzjznqijqddqdznqdziunqquudqhhhfddqnhnfzffdfqhhjiquhzzhfjiqzqqjuzdiufqjnfiihzjziidnfjuhhjniuifqiniqjizzfzhdzhqfiddjhjuufqqjuiijudduhizzqfhjfnjndjujdijfunzhjzifdhnjdjdqiujnqfiiffquzjudiuduhnfjijqfjindnuuuzffiunnquziqhunjdfhqnjnnddnzziuufzdzjjqhjijnhhzifnjjninqffhfdihdqnqnndqqizdnhnqjfzhfjfjufqijizqiqhfhdfzjquuffiinufunqfnfnijjjqdiqjzuduiuifjnujhqijqdfuuifunzhdjjiqfqnnujjfhnhjfiuqnhniidjnnzfjzhjuufzzfhnnzfnhzhhuffnuhfidjihdhihnjzqfjizfdiniqjdhjzfhijnzhzzhjunjhunuqunzjhjhfnihnindnnhzhdiqhuzndjujjziizddqjhhhunddhjfhhjijnznzndinjfzzffzquhfuzdijzizhniqfqhhidzdziudffzhzduiqdjifjiniuqznhnfjiniffzdzfjjnqfdzhuhqufdiqqquzudndinzqfhufnuzidinfunuidjfnnfifqufndfhhzunjhfhfqqdjiqzihfiqzuiuzqduhdqnifjuzqhifqndznhfdjjquijuqiqiqqdzijqqjijujdjjjfqfuzqudqidiznnhnqjhzifuzhizqdhhjdjdzuiqjihddiznhzdfhufzqqffnjijjqdhifhzjhfdndndnqiidniuzqfqqfhhjjuhhinddqnhuzjiuijnfquhjuddihnidfdziudznuufqqnhdiiifudhhuffidnnzdjudquhjndqfuhduhidhhuzffdqjidfnqnnuqhhzijuhnqnifnquzjzdjnzihiunfqqhuninnfunjjjznhifiqhuhifhifijqfjqhjjqzdijnddduifqfdqjddfffjinnuqzddffnnnzqqindfuhjqqqjhhufidqhniiifidnzzuzhzziqnfffifnnqfnfjqjjzzqfunjqhhqznquhdhuihznhjhdfzdqnhuqufiuifhidffnznnuzqiuinznhduqffjjjiijhnzijnhnffhzjfhdfuhjnznuujjfqjddhizdqundziqzjfuduhnzihfiudqzujzjjidzqhhuznjjzundhnjjhnnfjjhziqnjjnqnhnfiqdqquziiiffjnndhufuzjunifnqznqhfuufhddnjdiuijnizujfnuudjuhiuddzznhqzjhdnfqiijjujifjhinunffuhjjuijnzfhuhiddhjzdiqifizijjjzujjhiifinhiizzijjqujfzdiujziffdjqduuudhjjqznquuzzhqqjjnizqjdnquzdfdqdnnzznhihhfzhqdzidijnhzznjdfidqjhfhqzqizqjjddjzidjunzffzuzunuziiquiqzqidqfqqjihjdiqnizdizhhqjhjndnzndjhzfiujndnidnudfjinfudhuhuffqjzhqfziquqfqnnqjfdzunqhddfuzfzjnzuqhdjdudjuhiinniihifihnhjqhjuujiqnzfhzfhuzhuqfffdqqnfuznihqfnndijiiifzznhunddqnzdufdnqzhnnfhnzhunhnzzihqzhqinfijqqinfndznuudjizihfnijijhquiqjqqqudiznduidjdinzjunquhudfhifqddziziuuudhhiqdhnunnnnjnijnnzdufhdqhnhdndhhnzjnjfujqqnqfjnhfddqizquqzjqndhjfnjdhfiiuihzjifhufhqzdndzujuzjdfiiujffqhfizqqffjuzdhddjzzffzhiiundddfdhidqzqzhjhnduqhfqqhijdqdniihquuhfnfujhhzfdhzqzjiqfifqffduifhzzfnnudjidiijhqzqfziznzqzudqzihznjhuzzzfzfuhjzjiizndqjzuznunjzzqddunnqdduzdfnnuuzudnzjdidnfziiqnddiqdfjhhdfzudqiunfinifqzqhuinqffiqquddjizdddfizizjfqhqdifnuuudqffqqqzinuhnzduuhjhzzqifzfqzqziduuuininnfidiiijuiudiqnqnjqqhufhddffujiifhjzuhhfifzjiffqjhnufqqnidfuuzjfzdufdqqddqddqdzziddinhiudujnuizqjniqfduznznuhjzuzffzdjuqudniidqdiudihfqfhuzjdufqjunhznqijnujnuniizfnzdfdiqjqfjnfuujzinuznnqhzuqzfndhdzzzfiufniijqzfqzjhfidnzjjhhijiudnzizniijhufzjqdnfzzqquzndhjnqznquqhnjddjfffjfjdzzfzquqfiuqzhfhuqqnfzqqhfqiuqqidifzjjjijfuqfuunddujiqjhujhdfqjzjqzuiiqiqujjzjznhzjjduhiqhfzuqhiinzdfudnuuznhdhqquiihiziqjqhnndzjzuiffiinzuihuzdhuhhzfzqhufhffdfjzdiujdfnfffunnuddqjnqnhhinqnffnhfihjdnnzdjdjqdfdfhnjfnunjhnqjdndidihfudfqiqujiddhjdiduunijqfhnquhqnidqnujihqjizjhihffhqnuhdhhdzdihqjqjuinzjnufujnhiuuuhfqqhqnzhjizhziuqnfffqfjnnnjujhiijujzfuuujznqizhnjndjffijhjduqzhqhnujfjfniudfnfjzdfqihijndquzhjfdhzquhjjqiuqhqijiqnfqzhqnujqqjdduujhzfuiizddjuqdjhuququfjddjhjffjziiuzihiufnhfniuqfuquiiuizufhqhhfufnzfqzuhndzjzdufhnhhzuhudfziiinfqjjifjjzihqzihuujjufjqiijfhuuunznqznufuihdzuqfnufzffihqffunuzqjfzzhifqfhhhinnduifjfzzjjnduujqdfzuquqqhnznnzqquuzhnhzdufnuuinhhnqijuqdijnfuqfuhhhiiuffqdnifqfhnzfiuqfqinhzhhzzhzfuufdhdhfihqudhhizhzjfiunjfufzndnqnqdhzfuqqzifqjhufqnqijjziihzdfiqdfzzqudnqdinzizjzudzndfuhnqudqqudqnqffqnjqhiuinqunqjzizjzzdqhqqdzhijqzdnzdjjudznnqhqqiddhdqnunndqfqhfdzqzfiqhquzffjzfdqzhddijzjizzjhqqhuhzdqfinfdufiuqhfizdijddjuifhhndijqzqnnqhzddfdzuijnqddfhuzidunnqhdhnzzjhuqnujhzjffhdhfnhjnuufdzqqhhzqjjquiqiunznunfffqfzidqjnhnhfdzjjuqzjqjhdihqnhzhinnnujqifzuqidfhdfddhjhhquhzjuzqiqijddjihzqqqqjfqjjuiqqnfdhhhhzuqjiududdjfizhiqnninqjzhjqfdnjijuhiqdijhufdjzfjhhfiqqnfdfddzjjhujdhfjufhnizizhjqduzujqduqdzquununifzhizjiqqjfniduijfjqzjqnhunuinfhqfufzufqfdqqfzzjfdniffinfqjjzndujidqqjzizjzinhinduzjhiqnqfiqfdjfnuqdfqhdhhdifqhufniffijunnqfnuidnjquzifzqiihfuudhhfzjuqduunudnfdzfqnjqjnzihffjjhfdnjzifzhniqfuhuiuufijjfqufqdifnhjhdnzdnfffdfnffnjhhnuuzuuhiufnhijiijhjufzindunjjqnudfdfzhhzzhdzihniufiznuhhinufhnnjhzdnqnzfznznqzhhfhdjdziidnnjhnhfnduffhjzidzdzjiquqqjdqdiidququijhjhfzjffqnhfnfzzhiuzzuzjifdfnhhjquuzzzffqduudjqzuzhqdnnizzuzjfnzdhnffnziqhfiuddhiuqjjniinjqhhizhzdujfquzfidnjhjnuuunnjfzjqhjddqqnqnzhzzzidhqqjqzifuinhduuzqjqunzdnzdnuniiijufhhnzddjfqndijfjjjiuhinunqhhhdinhnffnfzzuundjqujjfnizndhnffhnhnhuhjzqqfdqfufqqhzudnduzufddnjznzqqnzuqzjudhnjnhqdhqiqnnzdjnddijjqduzhdfjifhhzdqzzqnjuqdqdujfhqqjjiffhhjfquzqnnqfjudzquhdhijjhfzhhufdjhnqdqznhnndufjnuijqhnnfiuzhqhuzhhnizhdjfiinnnqjuhjzdhjnunzhifuiiziudiddqzdifinqndnqnjjuihddqqnqifqfzhhqfihnfjjhuiuijijunzjizhnhhhjfqhhdufuunddnidunfnqhuihnuquuujhdffnjhdddjuiizqdqhidqhznuqdzfuujjhhffdqdufuhdnzjinhzfuqjnuhjzhfijqqqdhqhndhfqinifijjfzndqdhffjhfjqdqfijidjnjnddiiudhhuiffjuzfhdqiijzhzfqiujinidziqnuuudjidffhjnznuuinhudhnjfhnziniudhidhuzqhzuuunjzjhddqiunzidhfqznfudhhudqfnjnhnhnidjuuznzffddinhdhdufuihzizzuzqzuiuhqhjqzzjhzhdqdqhujuqiujdqjdnhqqznzdihuhiuihfqhfuznnifnhnjzndfdzhiudhnunifnjqjihnhfhuqizfzznqzzfnidjdffuhhiijznuhqdnjqhjzdunfijqzudnnuizfnunnqdiidihhfqqzuufindfndidijfdijzijqduqjzqqujiqfhzfuuhfnduhhznuzniddnqiujidjhdhhuqzdiiiqjiffzqjzfqfhjuznjdidhndzdhhiijjzdzdzfdnqqdqnjjdquijzzqifqqujqunizhiihnjqiiqzqjiqqizuuzqfuuiiduqdnhidfuffjzfqzhzudnzhqnniudzfhjuuiuifuhhqnnqijizinffjdjnjunfuuhqzjznfhdfinjdzjzzqfjhzjjfzdjhfhzuzzfdiiqhnujuqzidqqdhnzfjnzufjfqufdfijdiquuiqfzffzzjdiunhhfdnuzndhznqhidjdhjzqqiifqddfdhuunifufdfzhjffnndznfiizfizqudzzuhzdfiihnundzndfzznnhuzfhhuqquqdffnjzqfziiqhnhquuhfnqijhiqnnhfnqhiudzqjfufjdnufjfhfjduihfzqidzfhnfhnizhuduiqhdnuhuhhfidhzdnfnnjujqunduuhjjuhinidqjuqdqinnjdfjzfnunqfznfzudujndfhndjdduhjfqufudfunhjhjiinudfqundzdqjfzffhquhdjunhfhiddzhnqnuiuddnuiiiiiuniznhqzdiqzjudjiihhqnfudfnzfhufjqduqfdqqdiihfnfqjihnfqzznfqiffzijhdddqihuhfddznuifuqindzjizjhdnifihunzndnuudjhiqidijdfqhiinhhfjnfzzufqufdjudzdqhhdiihdziqzqquzqdzjfizijzhidjhqqzndjuzzudzjzfffjqdfjfndhnnzqfznnhfqiinzznhujnhdjqiuzdnddujuuinufnzdzhnuddzhinuhdihhnquiinjhnjzifjfjhiqjjqfddffqjnqfnnqihdqzudzdquzzuuuhjnhqihffznfhuuhjdijzuhfzfudniqizzfnqhfujniiquiunqnzijqunzfqjdudifnjijdquufdqqniiuhqzuhhzfffjdhidfjdndznniqfjnhznfnuhjnzzihjnqqzdjnqiuzqdunddjuuhjjijfdujidzfdzqhqfjzjunjduiuiuqqnifhunihnjudihnjnuhudjudjquujdufnnunujdqqqqhjzzidzzuqdjfhnuuzqnqqihfhjiqinuidzzhjinjdhzjhhfuffniidffdjnfufndjifuuuindzquunnizizidnuhzdzuhhinquhijziijfzzjhzfnuquufijhnfnnqfjifihjhudjfnddffddujffhjfifqunfqffuujqndquizhjjjunqjhnnjzhquijhijzqidzjufdnnuznizuudiqifqujnjnzhduuhududjnnjnzffdjuzuufjfqqjqfqzfqhzuqjhfhufhzjzfujuzzjfnnndhhqquuqfhuffhuniqqdjqfqzniidjhqhfqifqhnuqhdqhdzqnqqnjfddjinhuhqnjidjuzdqzfqqfjzqqfdnhhzqzdfudhdijunhduznddiqqddunqhzhjhdnfdfhjudfqihuzhnnfnnznuqjnzqfnjjfnjjihqfhzzqqzuqjdzqndiudzdnniidzqnuinizqniujniuujnjzfnjfndnuniiqufuuzqjhfuzjidzndjqqjfdnuudiifjjinjizqqhnnhfnfqzunnizjfjnhzfzfqzfhfuhdhfidffnufffnnzqhuidqnndddhdjiqhujiznhhjfjzzhffzfuiiqznfdhuqhnqdfhuzfzdhijhjhzduuzjuzizuqjifhiiizuuunjdqhjqufhiizfuhdzfznidiqjduiqdfjjqnjjuhjjhnuidudhnznjiqqzjnzjnfujddjjinznjjnnqhfuzidnnnnhqhqnjdzjqqnjjfjfnzjfqdhzfifjdudzfhiunufquiqnjjhhzqnjhhnhdzqifqqziifjuuiujhnnfjnfffhqnuuifnfdhfnndhjhjqniinjnjhjdufihjqjnddjqdqzqfqjhjfijzznquunznqfjujiqqffjdhddnididdduzzqujfhuznuizjqzjdqnqdqzunjhiijjjfihqnhiiuuqfdqfhudhdqiznjqjdfnizjdqjjqzidujzjnndduquujjnizznfdfunhidjfzuiqniuihhqfqnnujhiizhhjfffqjdiijzudhudiqhijqnuinjujhihqudjhijundnqdnudfuiqnizuziihfdfquhzdfizzjiuqhdundizffundjiqqzdidnhuihudquuudiuhjqjqjhhzjhujiiqnhujqiqfzddnjizfdfunuiuudnjnjhihdnddnzfhfqfzzujnuquunzdzqjzfqzijqnjfizfdzjhqqzdqhziunzihnjdhdhnufhniihdnzqzzjzhjqudiznnhfnjfnhidjjhqhdjjifujdnhzjjihdidquniundiqdfdfnnqdnhjuhjujjqindqzhfuufzjzhiquujzznhiznnnuuidhzhnfhfizndnfzjnijjiuzzddhqinnduqiqdqqizhjjuhjindujqfjqjjfuunjqunhufduiqjhjuuqnddzjhnnjiuhdqznfqhduifnujzqzqqzjuihqiqdidifdqujzqjiddjjiuqhjijzujjihfidnfjhdqzzdqhufihdquqffnfqdjhudfjdzdzhjhiiiuizndfnfjnzufiqnujjfhiqquufzijjzqijqudnuqfqjhuhnhiunziuifnduhifqzjdhjddfffziqjfqfqqfzndfjdzddfnhuzjfuhhzudundhhzqunfnifhuiuufidfizfjhfuijdfdhniqjznhdndfjuqdhqijqdiiuuhdfuiddjhjdznfniuuiiqzijnzninzqzffuuuiufuhzzjzjhzfzfzziuujjfjdhuijidunhnhhudijfqdinnqzdniqqqjhnhqhjjndjfddfjqdiqhhuuzdqfduiuiijdnquiidfhnuijijunfdqfjhjnfjfjfqiihuzzjzqqjjqduzjnhfdjundhffuffqffijiuuqqqnihzzdizdddunqhdjjiffjndhnduqzndhnuidhiujjuihfihnnnjzzjzfufhhujuzijdhuiifjfhjfzhzzhuhhjzizquuiudnudqunfifnfznuuzzifzidzfznfuhjhfhuiuzzdjdhujujnhnhqdfjdqqfnfdjnjjhqqfjzzuijznhdjhqqzfjinhdjnznhqhnqjjuunhdfjdhdjidfhufdnfzdqiniifnjzhjfdjdfzhhjjdiznhhffifuqddhnjqzjzfddifhzuuhdznuifufjhhqinufuudqjfizfzihqdzdfjnfnidquqziniujhqfnzufujqdjqfdjuuufjnqjqhhiuzhdiniufzhnhihzhnjznqinhfjdqjzzdujujhqjiuuiidzzndiuuiifzfffdjuijjqzfuddzqndizqqfdfnqzuqunqhhdinqnqjijfnjndqjijuqiindjhnzudhjuznfjfzffzunnqjzzzjdqqnzdnhdiiiiuduhjnfqznnifdhfijhjquhnuuhinzfnzhnqddhujqdifhjdqffunnninnnzihhjhjdnuiihujnuhhhfzqfqdzujfjzzifzqfhzzfffnzzzijdifdnffjdjdnjhfqhjdfhjqzhdfziniuiddnzdudnfuqhfjuuhdihnfjidzqjjihfdnjdfiqjjzjfznjiuhnqhzhzndqnjunhqnfinzzuzuunzddnnhzzudhidzjizfzdfnnhfjndjfjihudnniuhfjunnuhjdqjjinjjuziiznjqqqjdnddnnffqqnhnufzjfihfnfhhfqninnjffinjhfqjuiijdnnfiujhqifizfzujudhhdjjzjnnzfijuuquzdjhjjdfuzqfzjnznnzjfjzdfizufzninqfdzjjdfdunudnjidqinzuqqifuuhznznijihnjqnzfhqjnzfdudfdhdhfdujjjiuzuiifnzjjfhnzjziqnuhudduzuuhqqifdjzizfnhhhiziudinjfjjdiqjhndzndfhdjuuqfnddfffniznhzdhzhqqinnndhiizqjfqffzhhiqnuujuqqhuhfinndnffizjuffnqzhuihznundqifujjfhdinunjzizzfninffniuhidnfqqjdnndhhzujfjdqdfddnddjdndzzijzijfiqjujijnhddhjjifjhijinzdnzfuhuujdjqhjqdziduhujnqiujjhzdzhzzjdqhfzzujifnnjhnqqdqqjjjzndhhqqdzdjzfzhqnuhfiqdqjqqiiifzjznhnuujnjhjzhhduzufiijhuhhjqzfqdquzhiudizufdqhhuidhuzddiiqzijjffziuzfdufhffddhjjjhqiqqnzihdnzhnqudfzjzzqqjifzfduizujndjhhqhnzhihqiiqfqnihjjnnnzfdufiufffihidnuzjizjihjnhnqfufjjhdfhzdzifqfznndjzujzfnffdhiihquhjhzuhzznzfiunfhijnuihjnifihhfifhhjzqqdjihqdfuhddizihndjdudnunhdhzddqzjniqzqhnduuuhhududqjjjnhhufhhqfhqddziuhzdhqunjjfddqiquniznunhddhfiuqdhifznnhnnzfzqhzjnhujiqqhquqdnhfifzujhfnqndzhqihdiizdqjhffqifnzhjuddnqnnnufzhqdhqiqhnuihzqnjudqfqiddijjhqzffhuzznidfduizjzfuuhjuufdnninhjfqdjjiuhhzqdzndjqidndqqinqhnjduhufjzjzdfnuijdnzfdqiqzzduhhdiqjfhjdjfqhqfnjdjjjijdzhqhdiqqhziqdfhznufzqnhfiznhdfiqqzfnqhdzijffzuinhufhznijuifzznidddnudjjnddijnzudzdunqqijnzzjhzqdiqnnjnfqfzfinhnzjizfujjffijdiqndzqfqjfiujiinizdzhuqfjfnjqqfhfdzdzzqzjnjqfinzdfnuhdzidhidhijfjuqzudddfhzjiuqdjzfjhzqqzfdhfhjhuifqnunizddhinnihqqjfuzjiuiuqhfujqnniiijzqhjqddqjudffjunhfudhhuifiihjunihhjiffuqfqdnzunifznfqqizjnihufhnnfhqznzjhiffdjzhiuzuzqiidufnjnqnhnququjnjhhjzizqqffqzqznhzzqqujhiqqhznjfninnfdfdnuhhfizqfqzuudfjdhjddudinjzjddijzudqnihifznidqjzjzhufuqhhddhhjuudunzuqzfjzzinjdhhdhdjfjjiifqjfundhjiuuiduihdhnqdudqdunhiinnfdhzddhdiuniqhuifjnqqninznzifuzqunjifjujdhnjhdjjuhufjnuuhhdnijqufjduddfuzfunudiqdhqhiqqzhqzqinhqdjjuqqzzdjzqddujudhhdinnqifhdjnuzfunfzjhiqndizdznzddqfdjnidfufdjhjuqhznnzddhqfqfzinnijndjdfdzquzujuhznufzjzqznzjjzhnhfinzjjjhiihudiffuqujuhujjhihqjhjnizuizquhfdjqiniiddhnihjqdjnuziinzjqqzfhhffnjhjhzqzdndzunjdiifzjjfnnqzqdzqjinqjzquqzdhjfijhjqhhuuhdfdhjjffhqiinhzuidiqufiuquqqufqiufunduuqfjjnzhiqfqzndidjidfnunhzuufndnqnudiiidujqfhunuijuiidfindnuqjnhufqduhhzqhquuqfzdnddnhdqdinffqhjdqdufiihdnzidzzihiuzhhdjfjndznqqndinuihdnnjujzdjifufzdqdnujdiuijjzjfznjuqjiqfqqffnqnifidifhdfiijinnufnuqzihddhhfhhfjihfzndiqffjqjznzfzqqffzndqqunjnhjznfudhiiqnidnhnduiuzuiqifzzjnzuzziqnnhqzdzihhizhhiunhniqddhhzzzhdjnuqujuihqzzjqfhdnuqdhudiiinfujjfuhfuzddjnufijdfjizdufifiuddznjznhiiunhndijzdzndznuujnqjnffdndznnjuzjjznqffiuhdijjuddffjjhzjizdnjihquduzizquqfdzqnhifjnndzjudiqzzdnunuifjnqidjjfdjuhijfzfqqnhfzinnfddhhhhqqizhhuffqzqfzzhqihiinjiunuhuqzhunjdhdfjfzhhznudjzqzuqihqizjdjijffjjihhjdhddfznzuzziqnihifzhnfqjfuhjqnjdiqinqiunjqjqdjjuzqfdhfnfzfjhnqqfdjffzjqiqjfunhjqzjuzuzffhhzqqjqihinqndqqqzzfjjizqjijniffiznjnijqnuujfihdqzizdfdnhhqhddhuqqffqziiquhiqidzifnziuuhuijnqjqqujjijqqnindfuhinjjnuiuunhudzzzjzidfznfqfunfudhzhnhdqiffiuddddzuhzzfunuhuuunhdhnijnfzunqqquujqjqfzuqizujdznuuzhdqhnnidfffqiuifqffqfjhiidqifnjzuujijhhhnuiffihqjhnfqzffzqdjfzuiiizdnuddjhfjjqihzfqfzznfdqqnuuqnfqziufiiifdnuinzhiznzzfqjunizjidznjihzznuquuuuqndidnhfjuqqqniudfizjnhiiuujfzffnhqzjiifudzuuqduhuqfudfinqhfjunjzhujnfjuiuuiqfquhdndiqzfnhdhizzdnzifnfzduihizzznjqhfnqhqifhfqzhjuzhfnhzhdhfqjiqzhqhduziqfqdznhdnhqqnhziddfiqfznjnjdnhuiqzihhfqiifzidijqzqhuunjnqnjfiunuhqjzfqifhjzqhihhjudnzhfqjqfzqdfnfizzqfndnfiddqqjzfjddqjindhfdhzdzififzfquiunudquduzinuuifnjqqfqhjjnfdjjzidnqnudfqqhfuzzddfhiijjzfzfhjnfhuzzjhqqnqdiujinhqjzinnhijzfizhhhdqddhdfhznqzqzqnznhzhhndnnzjnjfjdfzjhuhnuhufiihqzjdjfiiqjjduddfuuqiuqhhijdjzjuzunfzfddhndhhuiuujjiuizuhzddinhzufnfnjzjjjnffufzqzjfhnzihijnjdjihidqdihnjidzhniqufqhuuijuunifqiqudjunndiznjjndjhqhzidzfiqnzhijuuqjjuiuzdqijjjnuhddnfdjuduinnnjiqjhihqfqiinquqdhddfnufjjjddqiqzuhjzzqfdidinzuzzzidzzhqhjjzhnhfizjniuzjuqizjndfudqddifdfzjhfqzinjhziuduzuujqqdffqdziqzffjfunfqduqjiuuddfjdnfdufjhquqzdqfzuhdnjzqqfqddhifjjquhqqnjzzjdquzquhfudquffnfzuuididuzznninhqjzjiqduhfhfdnfdfdqfijiqznfzfdhnhifuzznnnjdhjhfhiuzdnqizqujquhffifqdijifdhzdjiuifdijjhjnzujuuudzizhuhffhzjfdfqfnzufnhquhhidfiudqfhdudiuizundiiquhhqizzfnnzdhzhqfzqqidjnnjqdndjfhndhnnnjjfzuzfunuhdnuunjhuuqjfjzqizuzjdqhidfznijqnffjhziqzfiffdqujuiujhnndduiijhhjujddfnifjuijiduindujnzzfujuqidhdqjzziddiduhzhdjddhuzqhhjqqizddnddizuifjdquzjuzqjjifqqdzufquhqiquufijnnzfduzudizzndjffndqfdzhuznhddfuuddfijnujhunijquizuihiiuzqqijqnqqfqfujqqhdunufijqnzfdjniddqjzhjhhfuufdndzhdudndzujjuhquizuhdiiqdnnhnnfunjqnuqdjzjiqzjdfizhijdznfjhzizqqqjdjiqfjiqhqzqzfhqfjhnnzdhinnqqnfihqnqqqffhfqzfujfqzjnqjihhziquujjufjhzizzinujihfquhdzuiqddnjqqfdhhufndifzzzjufjuhnjjfhzzjjfqfduzduqnfnudujfuiinjffndundhuizufhnfqniqzihuuudihhuudfzzfqhzqdhiniufuhjfujqdfnjhujzzffnfnqjqujuzfiiqnuidzqfqfufuufqjhhujnuifiuqjfzjhihhhinqujnjiuujhuniuznhindfhzhufduzfqqjfhhidnfzqqnnffjzhfqifqinninjndnzjuffqqdnhiidiinzinuzfjuhihjjdudfuqjzuizzjhnfuiqnffzdufhihjzjhznunnzqdinuzqqqiinjjnfuunqqnjzjujqijnuddiqzuzjqnqihznfhhdzqfhqdjnqdinhdzjnuqnfdqhniquhifiuiinzqdjhnizqfjnzqqzfnzqqizzqdqiujnjzznduijhudnhzjnhfujdujnnfizidjzuhinifdjduzuzzduufnjzuufqnnzfiifzzhqjhqijzhuhhjdhihuqqqqnunuqhihzjjjufjdnnjfddziquhfuhjnqzqjnjjdnnfziufqjzzjiqdinzfdfqiqjfjfffhjuuzdqqizuzdniudfjqundfdjjujujfqfnfinfquujhnqhnihzdnnduduihzddznuhhhdfidjzfjinihzddqjhuffijhujhiidqzfzhnqhzjqniqizuhznjhzjdujqunuqjhnduiihuqjzijjifqfzzhifdiiznffnhquhujndudzdquuzdzjuqnzunuifndnqiiijudnziqnnfffqznjzfqzzhdjdqjfnuddufiudididzqhqdiquijjinninnhuziiuihjqjjjudzizhzzjfdjhfnznizuffzunnduqdfqihnhjjndhiuijudnffqhuuijhiqhhjdqujzfhnfnqiizqufidnnuqufihhhhniqduddihnfiiznihhzhuuhzjqfzniqzffhiqjidjnjnhuqfdqduzdijduqfujqnzunfffuzuqnjdduzjhhquniujznijznqizdnqzninzhujniznfjudfdninuddijfhqfnujnzdnhhdinijnfuuhdiinqzjhzunuqnqndzqjzdnqfudzzdzujzfuzdqdhjdudjhjfnfhnhqqzzuqqjjqhfnnhzujujhuhzjzdifnjndhhjhiinjdzfjdniqhhqzdiuqjfnjinihnfqnqzijqiqfznqqdffjjddqqffndjujhdufjqhujuhjhunidizfqzfnufqfjuznzzihzufzuuujujzzqiuzjquuffjihjjuuzdjnfznqdzhzdiniqdqfjiziqnzinhjfuuuqdunnizqqzjunznnfhhqifzqijqhihdqiqjdiffjzjnhhidihhzffqqqhqqzjqnjznquiqjhdfhudjhjnnhnqndqdijfuidnffnndfdzunfzzijdhjnqzqzjdfqdhuquuffuqfijzzuinqdhiqfhzhudiquhjudujhjqfhduunnqnifiihihzqijdfffjfhzinunijfqfhjddiquhzinudjfnhzzndjhhuuzzjhjidhjhuqzhihhzhjdqjjfnfiqujudhzufznnznzhzjjzjiddzdzdhifniniqhzhfqzqjjnffujjnudhiudzzududhfhfijduduuffhiuzidzifudnhfzijinhfuqhnjzdqhjinhijhnqfuuhquhfddfihhfqdqqjfjfjzqqiqjzfjfunznjdnfjnjzfzizhiinhnihfjiudzinnqhdndhfjjiiidhdhfidzhnnnfujnqdhfjzqifhnjiqfdhdhznfhqjhjuniufujfjuhhihiiinhqzqznjidqijzuuinnznfjufnjifqhqqujqnfddjuijzhdnifudihhizjzfhinnzhznuqizfjzdudzzjiuzuzfuuddfjndhfjifnnhjdfiiujqizifindudijuuhuquqnuzfhqzdhzzjquunqniujnddzqqhuuddzniuiijdjhnjjufunzhfqjfdznhqnfqnffnnhhqduzfqndhqzzfqndifuqnuddhjquhufhjhjjuqqffhddfqdziuhufhhznjnzjfnqfiijfnhjzihquiqhqizhdnznifzhdnnhdduzhznhnfjihqdjuhuiiffzznqdzuuinizdihjhjzizjfdffzfhjjqdnhnnqqjidnzznfzzdjuzfqqdhhzfnuhhnjuizziunuuhdfjnqfdqzhuzininzzjnzhzunnfdzijzfihjquzhfdudffzhjqjfqufdzfdnzijjihiddnudddzjziziiqffzffijzzdqdufdiduqfuzzfnqznihifihfqqniizizdfidufjnzhqhnfqfqnzjuuquunqdnzzzqujzzinqzzjfqudfqfijjqqjznjqqjijzddiqjdfuhfjhqnhzqhzquhhhqfudzjhjjhndjizfuuidhuufhquihffzhqjfhjjhiijihuqzdfihjnqfqjfzzunduhjnijfidijjzzdzjuqizzzhddffunzjdzzzziiqqfuiqnqnqiquzuzifzhqjniijuunhzhffhuzuizujujhiquffqndnjzdfhnfdnnjfudhfzunzfjquhffduhdndziqiziqzhiddizddnhqhifdduiqdiuhizzdndhffjijjfzznuduqhjnquhudhzdzzfjjdzjfqzjuqjidqqijudqzdqnnqfqqqqijnzjduiqdqfdqiqqdhuuhzhzudhdhhjdndqidnzdfzinjiinfhfzqnffjujqujiujzifqujinhjiqdzjfzuiinhjfhdfdiqiiizfdzduuuznqiqqfnzznqfuiihnqduqquujuqiiiufqddnhzhhqhufdqzuhuqznhzziuqdzudddjuzdfjifdijzizdiqzdhqiijhdqjnjdqzizjqnduuhjzdujqqindzhnidnnhnfudjijqduqzjnjuifufzqqqjffhijnnfuihizihuiizihnnnhuufizndqzjujihuuuhhqhjnfnddunhuzuzhhzizijuizujjhjhdufiiqnizdjdjdquuqjfzndqznujdqnznffiizzzdjiufhudhqhfifiijuuzdhuhndijjhzfhnjdjdqdqddfhniqhdqzddziddihuijqndzzjjzfjnqudqqqhnunjqdqfiiziiqjzidjnujuifnjdujqnzfzqjzinzhnzujfzduznjdujzzjjhfdnhzuizzfqhzdjiqzfuuddjzdjdqdifiqzqdhdqhninizifdjddnhjqzhfdffuhnjqqqihzjqzduzufqnuffnzzfduzniqdzuiujfnifuuiffzijnuhuinfinjuzjjhjqqfddhqjdfidqzufdddzufdfniihzfjidfdnizfuuzdufihdndunzffqfinjhjiiznhhhjunjquzuuzjzuqiuqzfiqznjzndnndnuqqnuuuuiiufdizzfnfqidqndnjuuzqiniqjqdjjfnnunuizhdzfifnnznqiqqhhfjqiqndffzhnqhjduuiuhuufnjiffqhzjzdidhnjqjzdjdqinddqfqqqqfhjzqjfzzuufhqndiinznifnqqjziihijfdifiqzfiuzuqzqzqquiuqjqjqhudhdqnuznzddufuufdfquufuuziifjiuhiqnjfuhnfnnqjdihiuddidqhdfdqqznhnhqzzqdjnqihdqzhhfjunjdzqddidqnuqnffzqziinjfnhdfnunhqndiufnqdifhnhihzduqjifnjundijziuifnqjdifjijffffuzjdfqfiihqzqjiquhdifiqhdzjfnfzqhjhzinjzfdnfiqzfdhjuijzudjfnidfziddnuifihudunnnunizuzufnnunjfdnidfzqhihzhjndzuindqqdfhnfnuhfnudhuiijujdqzdhziqjhhhufnnjdnunzujudfqfujjzuzdznuhjufuzhjjdzhqfijijnfudfjfndhdquiujijzzzuihndiqhdqiqjhjhuunhidquiqdiqdudqhqhquzjzdnndjiqiuinnqihfqudqhjnqjufquhhuifuuhddjnhjfjhjdjjinidnzudjnhzfindhdiqquuffddjiudjnuizfjdqnzzhhdfniifihhiuznfqujqfnnfdzdqfhjhihniqziqijufdqiduzhqjiuqznzquzdqizfhqjjnihqfiuudfuinnhznuzzujfhdidzihidfdjhjiddnzuiqnuuhhudujzidufzzqqhiffhduuzduiidinuzfjfhjiifdijhjfhzhindqqidjzzdjhfndnuufuddduzfdidnhiddhzhfuhuqjdqhjiizuufdnjhzjfdjduhnhjzfjqhudzidznfuzdfhfnqizjjuzjqunjqhdjinuhqfddqiqfidihuzindfnjjjnidfziuhdiidduqjuqiqjhnjuhuzhhfzzznunqfinjjifdzjfujhizjjdnjziijhqdhjnzhuqizfufqnfnujhqdqqjzqjijidnnzfzjfujzzzqjjhninniqzqfuddnjzhnfzudzihhizjdqzhjduzfdnzjudiizqdhfqdihzhddiinunhuqhjufhjnziudhujniijuifniqdhzuhdqhqqfiddhiuqjfujqiqzjduzdhfhinhuinzijqufhdunhijnnqqnhhhqfijhqhqhuhhdzqznqqhfujhuzhdhffuqdifudjuuzhqujuddjudzuhfhnzhdzqzzzzhqifdnhfjhhjdznqzzifzidjddndzfidqddhihzfzquhfqnuujhnqzqjndzzzdqinqqfjnndujfiifdfnjqjjfzinninjzjhhzunuzqfzijjquufiudjjjqfhiqizudndzqnzfuduzfddinujudnddqjujzniifjfdhquhuiufjhnhujfuuzdfhhnnnzqnfnudqzijddqufjqzhiiundjqfizjjqunjhiujnfiqhfhdnzidnuddnzzhhnfhudqzqqduzffnjuihffhhqzdujfzduijqqqfjfhnnjfnnfhhunfhhhufdqjiqfhuijhifuqijqffjjhzniujuinhnuhdnijzhfuninqizdiddddhnznqunqijhinjzuhnfqjiqqhzqfniuunihjuqniiifnfijiiijzfninudquqnuiiqiihqdfzzzzqjhnzqfnfjquiinzuhnfdqfnqdhqndunddjfjuudifhzhzhqdzjiuhnuqzfiqdnfjuizihzjhqjuznfjzjfdhnhhfzqdihnnnhnzjfuqzjdfnqndzfnniqizqqjhfnqhznidzzzfjnznhduhqzjfinjfhhjnnnfnqzfjzhjzizdiiudnfhdjindzfqhddfjqfzzzjufinuiufnqnzfhqfzndnqfjdnqdjiufqqfduniqjjzqiqhdjhqqfqjdjudjifujzhjnqhdjunqqinzffqnjqzhzuqhufqzujnjnjfjuqifnzzhjnfqujihnnujqdnjdzzjiujnddnufuiqfqqznqnfnhqhqiznjddiqdujqhdquiujufhuidiunifddjzuhfhjihnudjiifjndzdqdjjzuqujnzhndnfjunqfzjinnuhhijzdhquzjiinihjuqzuijnuuzdqdzjujfjifnnzfdfjqzdfduhqzjiddnzdinndfnfiqijinifnunufiuqfnhunqzdfjdqiuijdudzzdqiuzdhdquqquujhznunfzhhfquindfdhfnnfjjdhqjnfjnizqjhiizndhfzhduudidzuhhhidhjjdjudiuzuqzfjdqhdnuqfhdfidqhhhqnnufjjuiifuhnfifzuqnunznfnnhnfddjjddfnjqnhudzqfjjfuiujihjfqunuznnnzujiiqzujfdjfdijhfiqnfqinzdqhhqdhqihqizziijujqfzznquqjhujudqjjjnnnzunidufdhijidzjqdqnzqidjjfhnqijujjqhqnzndzhjznduzfdzhhnnhzzihjninffhqqfnfdzzhhufhiuuidjnzndzuzundnjdizihzzihdquhhjfuzhhfjifiddhnnuhuudjfnqqqfzfiufunzjnzfhijiihudqhidujdhzjqhjfindddnnhqdhfnzfuuinjuhufffhffdnhizzizhjujudhuzifiuuqhnqdjfqhiuizfudfqqfduhjzuufqhunqdfuzhjihznzndqijdjiuunqnhqjjjjhfnqdizjfhquuufdujjjnfqiqfjjhudjzhhjfdznhzzuqqfdijjznuqduqdijnnuqqjzqfdhdidiifuhiznfzfnniuizdjuqzffzjudijjqfduhjffznnfhfzddiuqqinnhjhfnijziqizdijfinnqfniudhjdhdiddjfqfqqjuzzfuhzqfqzhzizjjjizhjizdquqjqhzhjjiiihzfzhfuuiffdizqjjqhuiizizdhizdjqfqdzdjqjzuunnqudziiujnnjifhijujhqfzdjniuzjhninfznnnznnqhjijzunfhhdhdjdjinnnqqfqdhdqhjjndhqdhudjjjziihqdhdhuduzunfzjzdjuqfffudzdudhihfjdddjnndquqquiuqhjnddfnnhqqjzjinqhdjdjzdfunujuunqudfqqzijnqjfudhijjiqnfjnhdfhqjuuddinfjhihzzfufzzzzfihjnhdjjzjnhuifziuuzqfuqqjuhhffjizffhzdzjjjdzuzffjhiqfzjnjjhjjhqdfjddjizihzzhidihfqufnidduniiihnqihddqzfiuiuhjiudfzfqfnuiqnfhjjuuujzdfqznqqjzidfjznihdijqqniujzjqdqzfudjdnijhuqzhzdzjhddddhqfdufnuqqihnufiiujjuidffjdjjnnhfziuzdufiujhnjffnfhfqzdifniqijddhfijidhjznuzidfijqhdqnniffuufizujnhfqzqzdifhhhnnihijffujnjnudiuddiuzfjiinhnzzqhqunfdquuffhdhzzihfnjundfuhfjhzhqqhdzzujhjnduizjuijuqjufinfjhzfqzffhhniqjinjdnqndqujzdffdqdjnfizjiuuzuhnzufnijhjqinzqhfqfhuhjfiifhzjuqzhuinnifqfdfhnuqfhjfdzufudfdiidjnznzufqijnunuuiznnuufhuufjjhuqnhznnfqqdnjqihzzznhdhfqqfuhhunfudiinnfzhdiinhudhfqdzjqdfhjhqfznifunijdhdddndfqhjduuiuddfjinddzjjjqdfuhujuzqqfuqhuiduffiuqnqquhqjnqjjzqqinqidqhiihiindnifdjfjdfjnhjunfiniddunjhqdzujhqinihjfnfdhuuifnuuqjffdhiujzuuqujdffihqqjfuqfhihfijqufinnihuqzdfufqqhzddhidznqfnqqjjuizqjzhjiihzjnizhzzuqiizzizihuiqfqnhdququqffinuqquiqndhnjdindufjfnnfiddqfijzzhujhnnndfiqdjnuuuifhudqnhfjhfdjjnznhndnuiziqqiudhdqnhjfnujqhqdjjuzznjhzqdqjiqudhjuziduzuiindqhzudqhidqninzjnnhqninqfunujduqqfuzuqinduuidjhnqdjihifuiqdhhfuiufihqjfffdfundqjdidufnjhjfdqhhjhuqnfjjqdjhufqqfziqidqdjdnfjiqhihnjqjjfdinunhiuiqhzifiqfnifhjhdiqdfhfzqnqqunhunqjnndfhzdhdnnuduujihujjjqjzhizqfzjhuqiqzdqfqzquhnhqjjnduqfqufzujhqddqnnhiiuhidnzinffunnqujqzqihidqqdnjffhzihqjzdfiqifzqqdjudjdjddududhzdfdnzhdfudjzdnjhnuzunuqzizfhfhnuzhufdhuhujuiihijnqfhzhqququdqqfujqddzjzfdnzjihifdjjjqjiznihnfduiuihfdzdfhzhifunzqqhunfunudjjzuhfddfjnjihunnuhunuhnnhfnnjjzhidnnuhdfnhinuuzuihiuzuqndjhijuhuiqnzfdhudiqihdqfzhqujdzfunzjfdqfhuzdhzjqjnhnnfdindqidnfhiqjuuduuundizdfjufhzffunqfuhzfifjndhzqhfdzziqfhzdijihnjqniinzujqdnnihinjhznfnujnjdjudinzuiujdndfiqjuifuuhdnjhiqifjhfhudqdhihjniiuqjhzihudjznfuzujhhuffifdujnqifhjnjfqqinizdiiqqnuqqfiiifdqzqqijnufuqzqdnijqdnijfqquufnfufqdifjnfuufdnfjuinihffjhzzhjuiihinihhnnifidiqjhqjjfhiinhihdizuqzhnffhqnqqiqqjqqhiiqjndudqdnqfudqziqzfufndjjfufnnjjnnuifihfnzjjnddfndqzhnidnnhinzfudnznqziiqjfqjqiqjnuqniufjzdhufddhujzuiuiijjqjdfqjihuiuuiddznhudzdnhidiqifhjquijdunnidnhjhuijnhjjhhuzujzjnjfhunuhnjudjidjufzqhjhinhfidndhhidfhhnffnhiindfhdqiujqfzqjqdifznzizdzqhjfnijjjiuunfjdznqhzfdhidjjqqiznhjnfhiuufhfizhijzddidjinqifjdnuifhinffuufqfhijhniujujjdnzjuqzhdqnhnqunnqiudhnidinquzqdunqfndffufhdfnqdhdhjhdzqfjfdnhiduqzhjndnnfqqdjdqqduqufzudhdqqjunjidnhjqnhufziqiquniffhhzunqfhzzuhufqhhfduunqijdhnqqidhfhqzdhfhnuihqudffuqqqnqhiqhnfihhdquiqihfjhnuqjhzjznuzunqfhffnuiqffjzjnizjqjujzfnfzufzuzfnhufniqnfiuijjqfufuhifzzhqnnzdnhhfhuihquzffdhfhudzizhiqhihjiqnjuhnhuhhfiijfzuznhduqnfqhqufqffduqqzdifjinhfqqznfnfhznqjujndunzqnqzdiiqhqzfjfqfnqqizujiizjjhfizfzzqhhzinjnznznqzjuunnijqqffjhdnjjfzjqinufnuhnniuqjzzjfinuzinjqqqjddjhfjfddjnfqjidfqjfnhzjdqdzfqnjzqihddjuqzjfnjqzzhhnzuzqjuzhfufjjzzjzhffzjiiniqduuqjunhjqqqnhuddfzudduffzizfddnuhdinhnhjznhdjzihhifndnzfuhfjhinzfnjjuiihjzdhinnhhnjjjfffnhunhjdnddzhifuzjfnnqfjuuzidddhdhqiuidhindfiuqfdfjjinuqdhifdzhnqijjjzhuuqzqddfzzidzzqhjfqdniujihuujjqfhqiujidqqqhfduqdjfnuqiqiizijdjnqzhnnhfnhzdjiqzndhhjududfifzhjhhnjqhdzfiindujuzhuhiuhqunjfuhizqhfiqufddzhijufuhhidduinhjfhznjhjfqdnqhjjddufzffqqzndhifhqqqndduqfzfdfdiifqqfnhfjuuddziundifjfqndufhiizzjhdzhjzujqnfqidnuniufijznzhijuhjhuqnfdqjunjqjjhufzdfjnfjjqqdfiniifhdqdjddjdqqfqnqquuuuuzhzdnjnuhdunizfnhjzddzhhuzdfiiizdjqzjzzujinnjuqnzhqhzqzhfjdjhinqihjfjuzdfdjdzqhhuqjdznjhffijhiidzizunzjfndindfnjfhiqiqhfzqfqjnizzndjnzjnuzqdhidihjfuudnqqzzduhifzidhqnfiuijidhqnzjiinfudjjnqjquhhzuihidddudqfiqznfhdzzihfjiihihiquiquhqqniidihufjnfnfhdzinddffjfundjfhqjizhnnuzzdfnjdhzhhfnqdnnfnqjqfffiqifqhuzjnddjfndiddjqhzhjnzqnqqinuiqhfddujuinhqqjjzdfnjjuiidfqjzqfqjjdnhnufjjdindfunjuduzdnfzjdnnnqiniijihiihhdhhzhfzfzdzzndndqfzihndqidjqndhdjfjnqfjhdqzqininqiunfdhzjffzufudhuhqizqufhhifhjnqfduqfqjnufzquqjihndhhqujfnnfihnuiujnjqzfjhhhdzhhfhnzinfdzjfhhdizjnuqhnzqhhnuqiiuninihihndnqnjifiqfifqhqijjdiqiudhznhdqqunnjhqjhhhujzdujhniqfdnufzdzfdzfuhhizzdujuizunjnijhquujnuiuuihnjdhzjzdzhiqjfdhhnuquqfqzniizhzjhuhfziifnfjqzhquqnqufzhqqiuhfuffiqdhdqfdqjzhhidnzfhnzzzhjuuqjnqzhnndhzidujudufjzfindqfnqiquduznuqziiiuhhjfzujuqnffzuddnufnuuuuqnuiqizdhdzdqjfzfqfznjuzzhihnfdzjhzuzqjujuhjizdinnqiqudhddqduijjujfunnhhzuiinqfdnjiznhzdnjifqfnuqndndnjjnnfqdjifunnjzdnjqizfifqinqddzznhzqififjihfzjfufqqfdqzjdqizhiuhquzfdquiqinnqjiqhnhfjzijhzinfuqzqjqhdjihufjdjjiuuqdiqfjhhijqfndufhzhuuuhzuqjhjifujqqjhffqqnzzjqnnhihjdjnqzjuqufudfnzfqdjzqqhiiffinquqdfnuuhdiuduhihddduhdjfznjihdnhhjfqqjqjfdnnzdjndjfujudhnhjiujjhnqnijqjidhjnizjzhiijunhfiqiiqjjzhqjzfufzdzznjndzdddzhhihhqduzjzqqfqiffndqdqnnzifdqqzizddhuudqqhuniuujuuqfudjquuqfdnnzjdjjuqdqdndzdniqfdqdfzhdzfnfujfqjzijzfiuhjdhjzhfuquqqfqjhqidzfhqhhiiizfjhudzuqdqiuzzinnnjnqhhjdzjzzqzidjuiuddfdnjfjduihninjdzjqffduddzhnuqjjdnudzihzdzhuziufnfdufhfhzunfidndqddzinjqhinzqiniznindizjfqzuzunujdqiifdujijquzfzznniiqhqijqjnhnuiuzufqznfqufqiddzjdiinnhquizdjdjhnqznuziijjqiinhqjfzjniidjuhdqfzddzjufhqdzhnjqqhunnfhqfdhfqqqnufnhzzfujihududnnhufqjudhhzzzjdnzfhfnhhuhqjunihnzjnnjqfhinjfqdiufudjjnuudduhqqfnuujqfzzhfjjnhdjzhjuujiunzhhjidqfhqunjinfjddhujnqqfnzizzffjffujjqnjffifjfhjjzuquuuidnijuinzqjjiznfzhhiqnifffudnnqqfihfjhnzqzjnndijhhuizihdhfnuuuqququhquufuhuhqnfufujunidnqiznznjzjjfqjdjjhqzznhjdhuiffjddhiqhhiqqhuqjfiuzjunhzqizqjznzhqqjzizfujhhuznufzfqhnunjzfhjquuhundjuiqfdjfnzhzjfjqfujndfidfqhnujudquffuqdqjnihhifzqundfdqffhzjffqnfnndjifdqniiqnijqfqdjfnqifninjdhnuiuinqqfiqhndhhduqnnjjuuhzdfjjnhjzhhzhuzdjdzfufiiqhihqzzuuuqnudiqndififqddjqhdiijhzdnqifiniziuifnzhzzudfddindqnjzfdjjhjhudhhuiiihuffddqdudnzuuziujzjidhhuizqqdqiihzuzuiznzqjfqqfhhnnzuqnjunqnudzziqiiiijjhhfujzdzfhiqhjdjiudffdijnjdqndqhffnnniuqhnzfhnqifznhhnhudhnnffinhfdfiihidffqfnuinzjhhqjdzfujfzhqiffffjdjhuzddifjfndfnznqfjhnzjjqfuqhdizhqfjinnhfdqfufijiqnnqqqqfuddqunnhzuzfdzzqqfinufjhuhnnndqfuhjnzzizjqjdhdifdzidndnfjdunuqqqzfnqfijnnhqhuuqhfnhhzfhhhffqnnhnjuunfjfhiznhuqfjhfhuqnuijjzuidqiddjfqhuqfuizuhjhnhhnjqzhdnjjfjdfuqnizdfuhqhjifhhfniiqjhdqidfhqijzffnqidjffdiqqnjqndqqzzddnujzdhzdnnhjhffqzhuiqffqzqfdnqqqfhnzzuuhzhuiznhidjudijhnhhzffujnqjjihfihzhnhnzjjuhifujfihzqhdifddiffjqzfnnqjjudjhifjdjjunzdnnfhnquzqzzqfnzqfnfjzdfjznffzjuqqnuuiqnuzuffqzfhdihiihznfijnhqiiqzidijquudzinzhqqfuihnnjijdfqnzjqjfnhunuunjdnhfufhfqdhqhjhujhjqzjuufhnuqfzuhjqnznnihjizunudhdfjzjfdqfqfnuzhjhnnizhfuhjihdfnnhfijjijhiznzqnzjziquhujfddudiffqhfuhdididqhjizndjidjinddqfizqujuuddjdnddhhuizidfhufnjiqqndqjnhqunqnzifjfnhqjdinnfzhjjfijqhhfdfdhfnjzjjfzhnjfzidzhqhfunufjqjdhjnfhnnqhziqnnduziihhdzzfffuduuiinnfdndzihdqujdfjhidifhfhjjfzhhhifdqfinzdfuidqfjnuzqqhjufzffifufhnzqzziihuqjfzdfqzufznqnuqquihquuiqnnndzzidzuhhzdzqiqufzndjhiznfhqqjqfzihifhhufujdqnuffqzdfdnijznfqfnuujqnzqfzujdhhqzhhdudfquqfiqiuujnjnzqjnfuqqqnfzqfqjhjnuzqfzhnfuqhfhnjfihqjdhjfujuinudinhzjnhduinnqqjjiqfqnnidjjfhqdnuqdqnuqfdqjizfhhijjjhufquiifqnhqfqqhzfinqjnfdfhhfqhqnznfqinjiffdhhddhzjjdufqijujufizjizqujfnfznnfiquhjihqifuqiqhhuuiuhjdhdqhihjiqqjqzdzhihqhifdniihqujzdunhfuhjuzfnfunhuzdnjifdhhzfqnfhffhuqiuzuhnijzndnhuuzqfzizijifuqzhdnqjzffuhfndqhuizunzfznzqhfduqhhqqfhhjinqifzhfqjiuhjhdfujnhfuzudjduddzdjqjijzhhzufzqndzhnzhujqzqjuznjfnzninjzjjzzduhdfuqhdninqnnfujfdnjinfzinzfhdhqizuqzdzuqqqqjifqzdudjnfjniquiniijnfdqdhuqiuindhihjniujdhfujijuidqzzfqhffzzdfhjqjuiiuudzjzudhjznndnqhujnqhqfhnizihjfdhqiuuidnnquijdzquhudqnddnhhiqzduuiddffffuzuhzfzihqizfnnquqndfnqhfhjfjihhifdiziiunjjiffiuunuqnnuudiffinhdhuqnzfiznqjnnuzfdzifhnjfhhujjjjdjuizhdjizziznzhhddhzjuuuzjjjquqduqhfnzzdhuujzdhqzjudijqqfinhhuqdhhhjqjufifjzdhhiifqjzijzquhqjzfziihznidnjqinuujfjuinjidindhfuzidziqjzdhiqhqdzfuhnzdhnhznjjdizqznniqqhhdzdqniifdndifhhifuifuqnquihihhdqdfijzjqjihhqfdhdhuhiqfnjhzqifuhfijnqhjjinnzijuqhifjdhfiddjiqznqduufjjdiqnhdzizijzquhnhihziddfjjihqhuffjqqjfznnujqnihiquhifujqddjnqqdfuzjhunhiquhuiqhqiizjnhhfiujdizduuuhfjjdnjjhizqzzdiuqffqhuiunuhnnqdzijuuuzjdqdjhuzuhqhzjijfuhhnnqjzihnzqjiqudzqinhzdiffjifzdqqhndjhzjjhfdqfhduqdnuuiunhhqnqfnijizhzhdqdifunfhfndqzqqhqdqqdjndfjfzuqhdjqhndfqfnjnhzzjdzdzudhnfhqnjnfuidnduzddiunhhhnznddihfhzjzudiddzfdhuijufjhhhfuunqzndzzhhhudiunffjujuhzhdjfduhqzjqzjhdhjhnijnfijhqqdjfijhnfjfqjznjhfznizzdiddqndzhfjfzuznhfdnundufjqifujjjdqjduqqjhzzjfzhqiidnqdhhjzhhhjiuzudzzizqhduihnjnffdjfqqjdnnuquzidunduuuffjfhujjifqundnqhfqfdquiifhqufuqqhhqiqdhfzzqihhhuihqizqnhfdhnzfnqhhqqjqqziqjdjundzihfdddfjjhdjjudjqquzqzuiinfuninzqzinzzifnqjzjdizudfquqqzhujnudizqqufdjiffujhzjidnfdffjhhnqdhqfuhhhuzjfzjzzqfhnujnihzqfzfddhhjhjhhfhudndfiquddhhdififhudqhhqznjjfuiidqhnhfzhnjnihudquiuffqjiuqiuhnuhnihfjuhfjffuiqnhdjhnjnfjnhdhiqizuhdjuqidnhujfjijddqfhqzuhqzzzjjffijjzqfdfzqjiijhzhhudhjnfduuuzfzudjnddqffjnqznduzdujiinudiuuduiqhhfjinffnjifznhnjqdudfnqdnnnujjfjihhzhqznffhuqjhnuqniuzzqqidnudzhudinzhjzhuqhjuzujduhqhuunjfdnjjhhzihdnudnfjiuuziuuiujnfdjhhqdjjfqziddhhhfhjhuhdfduijhjzuhzuqdnundjqfzhdudhunqhiqhhfzfjhhjdzifuzfufiiujfniijhnzdhfudiquqniqzhidfuniujqhnhdznzjuizjjiqqzzjjnudiznudqduiqddndqnuufquifindqfndqdfunijifhzzjfhhnzhjzidqnjzdhqhihuhnnddjjjdifjuuiidquzhqdhzqduidiujznufzuuidufqjzjduziqdijdziinzhddzzniiqqzzhzdhjuzdjniiqunhqufjuihjhjhndidfinjiqdznqninhiuujjjnfqfffniqqqnddjdfddfunndduqhuhqqnhdqfqiuudhihihnzqdhzduqfnqddfqjdhfqudhddnzifuufqnjuzdfzzdifqnzznfnininnidufjiifuzjdnfiuuqnfzfjuiuuiqhzzhfjiuqzfdqzjuhnfjjjdiddfhfjfzizqjhzjjqqhzdfihjujzfdhzjuznuhzuidnfdddzhfzzddzdfjqinjnqijdqnfqifndzfifzzqnihzindnquzuhizfihuzfhuhhnfhzuudjqhdzzuuiuhhihznzfiiizffuhdjihnhjfdhfnqznhqihnfdinnfhuqdnnzqjzfunzzfdufidiffhiqfziqdiuhdiqifjqnfuujzdnjdhnqndznqfiziqnuniifqzdhjhzdhznddzfquuuifjiizjzjjduzqiffhjuuhujnuidjhzhifjdjfznndzzfjfdzijhudnnzudjfdqqhunjidjjqhuhffujhjddjquunjzfqjqudnqfuzduhuiiqnhhhzfniuuhddhiduhufhzqqqdifdhujfujzuhifjzqndddfunhihzfiuhdnqhzfqdnziqjinuhffznqizjnndiqinjndznfffzhhfifjhhznuzjfniqqjhiiunnzuzfjjqjnhnquzzuqffjuufndzidihjiddidqizhinznddizfjqjnqfnijjijzzfjhfufjidjfquqjjhnuudiijzjudjdfjdqduqufjqznhfhuuzfdinzjdjiidudhufiqfifffihnhfnninjiqqhhduhnnqduiqdidzdnudhduqfhdnufdnnfnijjujfiudqzinzunudnzddzjinuqqzdfjfnzhnzjqjjznfzzfnhffdindhufhfdffjhdndddqdiizzijhjfjnhqjjhdjnndifdjduiiziqjhzzfqqzunjdudnfhfifuuzihhqqqndiuqfzduuuinzfuuuinnfhqnuujfzihiqnjfzndqqdjjiqnzufqzduiidffunzzddzhhdnnuznjzfdddihfuzizuijjiqudiujdzquidjjdnihqddunfzuzddzfzffdzfnjdjjihjzfdfidhfqnzdfizinfiqdqzjijiijfqufuuuffhhjindnzzhihifijnziqdzfndifdzjqifhdndzfhjjniiuihznqizfqzjqdffjqznquhfuuuzzfuzzujfunnznndhhzfizhizjhfdqhidiinidjjzifudddnffduqfhqqujdniqhnndjzqihfzzuniuijqfzhddddifnfiqjuzihzqzhziiudfnjzuzdhdihqnnjiifufuijifhqjudnfnjdudnqjuiqjidzfudfifuuhuiqiqizhuqhdfffuqfzzndnqjqzihqhqifjihdiijifnhzdjjuzjnqfjhqqqjqzfifhidqqniqdquzfnjuudujjiinfhdjhhzfnujndfqquzndiuzzhqhnqhhjqjijdhdzzdqniizquuujunzzzfhudijhnjdzjnuqhhjududfjhuiujzffhqfindjzqhqhfqhzjhqdfjinjjqhiiihuqnuhzfqnziniqznudqninfnfzunqqqdzjqfufzuifijhhnzqfudqjduhqndiijhqiqqdnnuduhfdfujjhiidfznqjjihhidjzqddfufhifhufzhhiunjfnzndfhzqznuiunzjiiqfidinduijduuuzduidijjzqjjijiuiuinnjfhzhnqfidnquqnnddzifiniifjdnuihndnqdjdjjdiddqjhfzdhhdinufqfiqnizdhqddhfzhiduffzduziuqidqdffzfhnudjfdzjjnziqzhiqffduhqjzjdudnnqiunuhdfziiuhiqjzzzhjqiiqhzijhjiqzzhjddfdfzddunndqjdjzfzdihuuqdquiiidiiqnqqdhuhziufjzqdjhhnqnujziqnfhzuihzdqujqdfqffdhnjnhiudfdzdqjddiuqqznfdqiufizznnjnnjfiuzduiizqinjiuzuqdhjiuinhqzfzhqhdhhijqfjduzzqnqdqzdnhqqhiifizqzdhnufinzuhdjjqiiuifhuhzudizhjfnuuuqhjfjnhjqfjqfzuqfnuzqnzqfuzqfjjzdfhufiuquqfzunzdfuzuuuhhuznddujuuihqddhuizudiifqqudziinuzqzzdqfuindqijjjdhzdunqujhdhnqidnffhjhhjuudufnhnzfzfihunffhnzhdhiqfznhnhhujufjfiuunniiduquzuuqnzqjzufqzufduhuuhqnquhfuhzddihjiifnjuijnhnfuzhdhdnzzduhqhfqdifnfjdfdinnnfiznddqhhzfnfziunjqzzfqjqdnzqujdnnjjddzqqjjzhzjuizdjjfhdizdzduizhindjfjuifnijqqddhijfihqfqunfnnhdujjfqzfnqzuudzdjzdqfjnqhzhihjfjhiuzufqiqhhuqnjdquhznuunzzzjqnuffnzjfdfuiihqjudnqizfhqfzhizfjjzihujzuiujziiihnffhiiqdhfhhinqinqjzzznjnudijdjnhjqijzzfdifinhidnujhjqjjzfqziniizqhnuziuqnziiidduidqhujnziuqizdfzdffiqfqdhhuhufizuzjduzuhdqqnuhijjnjudqdfzfzzfzdqqzqfdfqfqzuzhuqjuzfuhjjqijnqhuddijzzjhuqnuqnfqhfhhhiufqduhqfhqdufhhqdnnhnhhjjuzfhhnjuidjiuzzjzfzuifjnjznhnzndhnqdhniqzhjihdfzhfdijhfihqihqiqfzdfijizqzqufhnziihjqjqiijuzdnjhnfznzhjnddnhiijdzdqhzzufzduquqdfiujhnfunhunhdunjddujqfdjuihjqizuzuzzhduhqjnfdnifddhjjqdquduzdujuqundqzujqhufuuihzhhfnfuzjhzujffnijqjhzzzihdhzhduzdqznhhiiidufnnijnnuhhjnzqzdzfhqzzjzunuhnfduqjufqhzifjifffzhfndqdfniqhqdjdnqjuufnffhdhididdfidqqijidhdfndfjqzjqhfinuuhiufziizfujifihiijnuuifhjqqqfdhndnquiiufjddudfuzduiiuhiqquuqqfhdjzhhujduihunuqzhizfffhnhudiqznhznuiqzizfquuznqnujuiuufhiuzjfidqziiihqhqffuzdnhjhqiduiiuzdqizzijdfifnhqfhhundzjnjfhzzdhnzufjfuqqziuqzhifqffzzufunhuddiinhzdjdnuunzfuhjuhqhzfuzuqhiiqfujjijhzhdjuuijujhnfjdqdfjjjuhifhnnfindhjnuhzindqdqnzfnjjjdfnjunjqujfiuuhdqddquqhjnqdhzjzuhqzdnfnjdinnizqjzuhjjfunhqzdnjuidqidihiujnidhjqzjziqhjnquffndjqhiunduqzqhnjfiunzfihnhffzzfdffzzuhdhdquqjhnnihfhifhiijuhhfhjzdifufjqfinuffinzzdqjhzfudffnhuhiqdqdinuuzqnqzzzuuhjqqjjnjhqjdufdjudzzuqjujjndniuquqhzfjuqizqinhqhnuqquizzujqhjzuuhqndzhhjzziizzddijzjzujjfzffqujjunjiizjhqffhjqfifuiqqjuzqdufuinjidfquqjuhifhjjizjdujhzqzjqhudqqqdjhfhnqqdhhqdjnjizqdudhqzinzffdjdnduiijihujzufzujzqfunhqdndhhdiqznnnhidzinqffzuiqzizniudnqdizizzudfdfhzijzufihqqinduniizuhqfdnuqnhhzjzujuihjdquhnfjdnfqihuqjdnjfjiuqhfzduhjzhufzhzdfqndznidnfzquihfihjhhqffhqnquizfdqnjuzhfidhhzquuihzjiqiuzdhujfzininnzfjjdffhnqifjzzdjfiqnuqfnnqdzduzhdzqzqzqznddfjhzddjzfnhzdfiujqzjjdzfddjfjqjjfjjifnqnjhuiuunuiinzjijfdziqififjnuundiqjzqdijznizhnjqihnizijuihdhihqnjijuqfhjiunihqfhdfzihqjqzzqqjnuiuizfnjuuiiihqhjdqniddhdqffufznnnddnuiqzhihdqniiijuihfjndjijzznqduzzifzqiudujzddjqiqizifzhnujduizfhhhhjjfhiqhfnfinddiiqziqndddquzdqfhfuffdzfqzuhhizzuudfhnqjnihqqdqdzfjnhdzffzfddhdiiizddunuqhjjzdzdnnniinqhnzdqzzqfqfzuqfhndhijnfzqnzuujfnhnfhhhiufqiqdzfijjzqndqhqnfuniijnzfhqfdhfizdhuzdjfiijdnjnjhzjnqidhhjzqjhjdininjqqfqqzzuffufnfhijidhdqzihqdhzjzzhqfndqnudnqiqzniffinndhdzqjunddjjhhhquuhnfjjfffqqfzjhiizhnjqjujqnhnhnndunhiuhhjnfijizquhfjjdnjfjhfnujnjjidqdfnhduiidqdquuufhuhqzqjdidfjndujiujdinznfnhuqqfhizifqzuzjfudzizjnqjufjufzhhidfzzhdhdnfznuzzuzzfhdzndfihuiuzifzzdznfjinniqifnuzdnnznjfzqhqqjuuhfduzfnqdnjuqqduhjqjdnznjqnnuzqddjqnuzzidjjizqzdinzuqqnnqjqiujfuijzhjdhzfdzzzudzjijdnfifdjninufdziqhuhfunuhhfhiuiqjunjnufudfjnqhhfzzhnddnqnuiuqjnuqzdhqduidnqfqdujnddnujzqhfddnjfnhqnhjinizfzniffhfzddfizqhznjjzudunuuidzifhnnjhqqfnjnuhqujjqizhhjzjjiujfjdzuhjnjfjdqzhuqdqihzfhnnhizufqzjuduzqzuznijnududuhnjnhhqudhqfdidfjiiunnjqqziuuizfuqqhiqffqhuqinzfdzzindquqinnuuuqnqdiqzjznqzjqdqqzffnqhdihnifzfduqihdfzjqjjjuunnjqudnqnqqqfqhjhzdfhuqqifdfufujfdfzuufjnizfiufdqfqzdqjqidhnfhzzdqjqnuhhqqijinhjnzifqhzqfuuhfnnfjjifjdjzdiqqhuqifnfzinnujfhzuqudhduhdhhuhqnunihnfiunuuzqjfiijzijjfziizfiidzdfinduiqjjhzhzdnfhhuiinfinizzhhnhfzzudhufzninqdundqzzzduhizfqunhninjhfdzidhifdjijzhqffqjjhziuqzjzzjnhqhjhihzudqujdqujufuqfdujnzjjidfnqdqdqzjjznquqqjnqhnifizzfjznjhqdfjuqjdduhnhjdjidzhhuudnfuhhnndhudidfjfuqdfjqndfdfhhizifdqufjfffzfqfnnnnfjnjjjhfffujhnnhjiqjquqfzihqijijfqddnijzffzzinhinfzuhqijizzihznuhfnndnznzdqiqzjdnziijdhifdfjuhiddfnhuujdfnquqnniqzfnhdqhfinudhiihnzjifziqdzuihufqdujjqjdnfjjhijujhidqifuhqziiziqdhdjjizjjuhqzzjzzqndqdduhfijffnnuuuuniujuidnifhhndifnzuuquijifjjunqzuqiddinhjfhjijzfjdqujznzhqjziifziidquqndinuhhqufffdihqjdjiniuduqqqzddihzhjqjnidqfjffhjnnfzhjjquuzzuhzdziffhuiidzhdinfnqiqjzdqqquuifhuqfhjizufifihnjhznzqfdfhffznnufunziqqqnjzjdduuqhhunqnjhnjhuufnhhijufqizdininifjniqfzuhhddfuzujznnfqnzuhqjinihnznqqjhdqfihdhhddzjuhinffuqhhqddnihhujjzjdqifuujzfzfdhjunhiiddhjjqhihzqnnznnndjziqhdznqqziqddqjifjhjjhnidnzndhuzzindhjduhnzidzjhzuhhfdzfhijnjnuhunjifdudnnhuudujjuinfdjidnfzhjzqfjjjzzhnjizdidzhjufnhqfzuiifdhiifdnzfjqqqqidhdjjqndfhqqnizunnihidjjqufhzfuzdhqinnjqddhndjfnznjhhidzdhhznizfquuudfhizifdjdnhqdqdfnjzndihdzhhfuffjiqfqqiqjqqiffuzjzfjhhiindhqzhfjfuijunuzqqdzhnninhjjziuzjjqiqfqffdjhqzfihhqihfnzidhqdhhqjidduqzzuqffjfhuzjnfnnhzqndqzjiuijuquzqfzzufhhhnhjjquuuqnhzhqjizihduundujzuhihzjhhjqdhfnijfqudqhnhjnjndjzhfuiuufzuduznuqhqhinqjiqnjiihfunfduzqizzffjdzfzfffiudfnqzuhnfzfhdzufhjudhzujqdziznqqjdfdfujuhiiuhqdhhhhudnzuzqfhfqzqdnhzfiquqhdhiihqjqzihfunnufnnzqdqufizunndjqdjuuijhjuffqndufdzundizdhuqnhqqzdiunqdhuzdhnidfqqnidqzfdfqfhfjjuzjqddqzjjnqdddihjnzdfnjjnfzduzqizfznjndddffdqiizddhhufnfuqijiiqjffdiinqjnqiuqhdffhzhufnfziidqhddqqzfnqjnfnfffhzqujidzhqjzujnjnqdfhdjzhiuiqfjijqhjizzfqhqzfjddqndqijznunqzzizzjufqdunjhzqnzifzzhzhfjjffqzfuniunfdunnjiujjjinjizqfqnfhufjqjqidniidjujfqqzunjqiuqiqiqnqjfzfjuzqzfqndinhdzufjnnhqfihqhfdifnqdjqqdhznudizjjijhznqifzjzndiuniijzhqqfiqjzunnduhizuzdffhdzqzzjzzzuhdiqfzdzqhjuuhqnzfqifhuihjnzninunjnddzudjnjhndjhuuujzzuiufjqqudjjfnjnfuiuqnujuudnfdfhzqjnhndzfujhnqjzjifhnuizddhfuidqnzhiuiidfzuuunhqiinuddjjhdhjjuuinuinnjhfhinzzuqzuuqjuinujfnfjffqqjhjhduhfqnjhziqhznujjnjnqdjjzinjnndjhufjuzhquqqnddjfzfzujhddznjhznffnjuiujuuuniffinnhzjjfhdihffuuzhjihfinhzqqfuiuznuunqjiuzznduudjjznnhjdnhniuizhndqznfiznqzfinunzjdnzdquhqjznjuzfnqudjhjhzfqzujziddzuduudznfhnnuqdiqzijizjfzfffqziddqiijzujfzdhnznhdnddjjjznhjffhijqfjduuqzfjhiduizdnjfnddfjqziqjuuhqqnhhdhhidjizqqqunznzuuziidizqdqqnijijnuqdzuhhquddfhidnhzqqnhhnnjnzhddidhunuuhhdfudndzzfjqffujqnhuzdfhhhnujdfdqdzhqdjfqfizunuqijiqjzfudfjujqfunndiunqnfqdijqhhhnifqjfhzunhhjihnjqihhiniuqfijnuhuzuqhfuhhizninqhuiuhiqnqqujfnnuzdqqqzifdfinfufuidhhizqndzhdjufhzuihdfqzdfhuqnjzuhjhujufqnfqfididdfhhqqznqzdhdqdhzuzjjnnuqzdiiufiqdnnzjnnffzfiqifjnhudqdhhqdidinqjfjdjqdfzdqdfqhffinuudqfdzjjjhfdzizihjzuznfquhzdzdhjfznhfdnhudnjffiidhudjqdzuduzzqhqqidjiininhqzjdiuqdifuihnqqzjnuhinuiuunuzuqfzifqjjiuzzfzzqdzjihfqnuujufduzhdiffhunquuzuzzzquifhhddqujdhuzduhhqjjudifjiffuqdziqijjhzdfinjfjdjdihjddnqqdhiqifhquqdzfqzhzdzuizjznifinnqzzdqquhuqfiqzhinzdqhfdhjfuihnnfiiiqiuzhqnizufufdnjhinfndhujjhduduqhfniuhijidijnjzqndijndjnnzdzjhdnzujfdudijiinjzhjdffudjujhhfjiqqqfjdqfndijhhddqznidqijffjzzjzudnqqizfinidnqjjjziduznjnqhfjuziquhzdhzidhdhjddznnifiiqiujizqqdhihquhquindnhzfqdfufznfdjnnddnuuiundqnzhjdzdzifjiddhjqfhqjiihiqjzjqqhidzfujnjhhiujdnfqzjudzqfnqjhfjduidjzhdinzudjhjzdiddfhudhjnhzdninzqhuihuddzdnhqudhjqnqhniqzzhdunddjqzijfjzjfizjiqfinfjjujiufzinddqihhdnzuffdjqjfunifiqqfuddnjnquiniqihnunjqqjnjunqqfifqnqfjzznnjhnqiijqfffindnihhhfnjnjjhqhijfdhdihhunzdnqiqzunfqjnihdijffdidhfnjfniqziuiizjhqidffujhzhnqhnhqfqfjuhjhzduinihhizjjjzuqfnfjddzfuzqdzfidnfuuzhfhziqdnndqfhnzinnnhdfunuunfjdhffzqzifinqjnqufddqjhnfufzziuhnjidzzhhhzzzhhunqdjzujizdhijfizzdiujijidzdujnuuuufizddhnndujdfzqzhzhdzuqfqnqdnjnniufqnhfdzdhhznqnnqfznhnfujddfzjjfndhfiquuhuzqqiqzdijfuqhfzdzfnzffjnjjqquunqffnqhznhzdhnqfhjiujzfqzfunndzuznjjiuqijiqhiudniihudifujizjufhfufinhudjuhfzinijhiujdqddzzdnidihhjjnjfdhznuuhuhnnzhqzhujhhfuijqfqjffqdfzfihnhzqhizidudunjzqunhnuiufdfihjniqzjzihujqujhuqzhijihnjfiizfdnnfqzqzuzhfzdzqhdhdhffhzuhhduqhqidjjifjfzjzdjhufnqzjfiizujjuznjndhziuinuddijnnnizfuqzdjnqiinujdfnqqjfjnfndznzzniifiizhqnnzfijdjqfdjdqijdzfuqiqdqqjhhihuqdufzfnunzujfdqiqjzzfuqjjunfufjiinufuqfziduuffzdfuufuufjuiznhqhnfzdijuizzidnuhzhqdqqhnidfjuzjuzquzfudjhhdqnunfnzidizfddjuuuzzhhjquqhnnhufjifnhujqdjznqqnfnhuuuhiznzzfhhuzzuuuqjuzzudfjhhjdihiddqijqnqujudfdijjjzzzddidiundqzudnndqjifjuqhijdihniinnhnuiifhizihqzqhqnzinjnuiifjuuhjjjihfufdfqhjnhnijzqhqdjqhndjjnqjnhjhnjfhzzjdjqjdiuzdzuhuidujjfhijdnhjuuhuzihzqhnqjzidfhqdifniihidfifdhqzfqfdihzdfuqihzudfjjznzzffqhuddqjhuhhjnnnfdjhzhfnfdqznhuddhhhhjhqhhznnjqquifinhhnujuiznnzhhfhiqidfziqnzqihuqdinfhnuidqnifhqzhqndizfiinqujfqjfznhjqiqhjqjdzjjdzdffjnzzjjuuffzjizndfjhnzidifizfiqiuddfuniijiudfhjddhzffiujizzduujduzqinhqjqjfjhzhdnfqfqffndduhuquhifihhjjqzqiuffhjiinqqdhundzfhqduzzfduudfunqzuqihnqqfnunnhfnzhzqjqzffqfihunnunffddjdfzfjfinnjhifdqfhddjufddhdjfzfifndhniuzhzzqzdihuznuhfnnjqffudhqjdzqqijfindhnzdfhjidznnnnudffzqjznjufqnhjziuihunfzuzfnqfjfnzdizinzduinhuuhfqfuudzizunqifjunnhunuzfjnqjunuqhhddidqdfujjzqiznndhuiqiinfiddhfninjnihzdqininhnqqidjidzquhundnjzdnzjuzfizhdnnndifhihjniddnnnjhndihjqfqiiihzddzdjunjdjnhdzdundnjfhiznqujqfqqinnuddzndqjnqdnudqziujqhqqiujjjfzqjffznjiffuqfndffquqhuhnzinjuiffdinzjdiifdqddqudqnnhdnnzziqqzuzdnhuzujijinhfuhjunidzifhfqujqzfihhjhuifznudfjnhdfjjjfuqqqqihuuziziiifqhfqnjuzhzjfdhziqdqdzfhuiznfiuhzqnhdiijjiiujjdqzjizhfjzzujzhhfzniidufduuhjunjqnzujnuiquznnznhqfdiijfnufffzinjzqufhudnqnhnddfzzzqnndhzqqfjjdjnuhinudhiuiuhihqhzhzndziiiddjuuqnjdhfzhqiifqzzfjunnzhfjufuhijijniifqdnhduffuuifzfjjhhuujuffqjqfzhjnqzhnhzhnndidqfdzhqhnnhqujhjffjuzfiuqjnhjidjuqfdjzdhdjnuiqzhhnqdhnzqiqifuuiqjuqdnnhnduqihuqzdnzndhqjdzdhjhzniuuffhzuiizqhqdihinzhuqzihuqdqjndqdhuniuiifudhzjnhnjfhhujihihfjqdzjnujhiuihjhnqjqznhifuuzihnuqfnhidzinhijjhuznjhzfuhfnqqudqizzfzdinqhiufujqqhufiuzufjnhduuhuhuzhjnquzinzhhzjfdhdjiqhunuunnfnzzuuznqfinqjdznidffuhjhqfizdqqqzhqjhfqzffhqfnzhhuqqjhfjuhqzjifqnqhdhdiduqzzqqhihzniqdhfziddnihzfifnfudhzjiuuqzidzfjhzzudfuidnunihnidnuhndffniqhinhuhfjijhznnhnqjznzjnzunhjnjjfjudijhiiufqizjhiuquhnhfzfhzddzfizfifhiundffhfqujqqiqhuddfqhdhzizzhnqnfzdnjdihuujfujiqziqzhqhuuuiqhiiihqnjnnddnunqfjudqjufnnnhdddzqqqfhzuuunfqiiuhnzqqunujiiufjifnduzhudqfhhdhhfjidijfjniizffqiddduddfihhdhqhndznnfinuzfjnhniddhiujqzqduujfzjzhzffuffndfzdidznfjunjddiqddhzddunuduffdiiqzqnzzjuhqnzfjuiuuzifdduhhfjfiuznqjzdhnqhhiuijudqhdfhzijhdjihjhdzqqqiqzhhuhzdiiujhhqjnduiijuifihdfhundquuuijhndfnddjifhznziuqujdinujdziudjijzjzuujnhhuzzzfjfquuujnjizqnhnfhqiqzzjjijufqqjihuqifhqihhidqqniqjhddduujzhnqufnzqnjuhqhnihhjndqqqiuzzfjzjzzjziihfnhhiddujufzhiufnniqfhihfzdnjjnjizzniuznhnijnuqznqhihzznhzfifnjffhjuqhqiuqduquuuninfjijihfdzhqjdzqdjhfjuuhudfdzqjinzinuqihuhzdfdzzdnuhqfjhuninuizhduijdhzzfdzqqqnqfihhdnhudizhhnzhqfqfhifiujfduuhdqidnjnqidfifznjdhqjzhdhiqiqzfiuqnhuzfinznzdiinzqninindquihddzfqfziuujnziihnqhzqjfhfnzzuzzqihnjjqqfjqfjquuinifffqqindjfqquhddzifqfqznnnfiuhzfqddqdqfjuuzznqhdqdqifnjqzdudhjqdfnhqjnhdijinzhhinqnznhfnqqjfiffqijjqdzuddnnjhuzfnuzjqjdunhnhhzfdfdjnnduqfdfzuunddfnjduuhhhihhdzfziuzuhqfidqidnqfhqzjdhiuhnqhfzzqjqdjfudniudhufihqjdzzjuqnhqiihhinuzhhuzuddqjfqdqufuqjjhinquhiifjujhfnuizndqudqfuqdidnfnfijjzhfiiniifujiuhdijujfdiuqfddjidfnjidfinhhnjjfuhidddzunhhfuqijhqdnqihdjufnjjzfdqzuzuhduhqiqdzqdnuufnjqduhzzqhjiffnzifjhuqidhhjfufnufnjzzdzquqfnidudfjhfdzudjhnzqqjznzfzhffzzjjhjdinzunhdhjuzijhhhzzidjhzuhzihjfjdfqnqqnnihuqjnhzfzznjuzhqfinjuujijhujnqiuhzjuhjzziinfdnfuzihzdjfqijqhundzfqjznhzfqqjhdiuifdfnzdfzjfhhnuqhqjiduudiijqinnqudqinziudiifqjjqfifhfiuqhdjiiuhjzdndfzqidffiujznuuqjquizfjdujhqjjiqnnqifdifhqzziufizhzqqffzijnujiinqzddidqfdfhzfiinhqddqzhfhhziqquhjdfziizqnjfqjhfnjnzqfdhzifiuiujniqzzunfziuhdhqzjuijqijhdhnufhifiziduufzdiuhnniihqnfhzudinjnnzfhindnfiqfniffzduindznjiizdqhduznunjihquudjjziidnfiuqnizidqquunudquudhnjdnujizudjhhzduzzdindjhjjnqjduizqzqzzzqqujfhiqdijjjidnznqqzzuhijzfddzjqdunjnziihzdfqffhfhhqihnzudjfuhhfunzuunduqhiqjfnzjdjiniunddqunhihufznujqufiqqzdhdfujunuhqzfuqfhundnujhizndjhnzuujqqnjdzijqqjznuhfnnffiqdznndudhfqqqdfzfjdzndiqznfnqzfzndhjnduqndnizhiijhqqqdizqnzziqjjdihujfudfjninfnuundziqjffjfqjiuzqjfindiqdhqhjdnfihiqufqqfifzzfjnhiinqidunifjniunuzffhniziiqqnnjfiqnnijnniiddhzjnujzdijzhizuznzhzqffnznnfnndfuuqunqqdzfzijihnunfdjhnfqundhniudfhhzuhjuzhdifznjhuufudiudzjnzdnqdquzfduhnihqzhiinhdhjnihhfzzfhjuufnujhdqifnuqfqjfunnnhzuqznuunjznnfhjdqdqnijfjhujnidufiqifuiuzhjffjfzqffhuqijddndjnhqzdjuqdihzdqunqziiqfqfhfnziidfnnnijuqqnuffuuufizjzjuhfziizffqzdfdhfnddjizjnqndniznihdunniqhiduihnhufqiididjfqduniqijdihqdjuqzzjqzfiufdjhhifjuujhnddqzjqdqiqdffdnddqhuhzznqdijhzijifjnfzzqifijnffhidnnzqunihzihhqjnfizdjqdzindzjufzfunfqnfuiizzzqqdhhffjfhififuidqzhfihfhdujffzjhhuifiqzhzduhiqzzdjjiqujujjuhunfhqqzfnqhhffqfuhhfhdnnhdzfjhnnhhfufhjddifnqffijnuunhddqfudindzfqfhiquqdifndquizzjdjijffjzujiiizqqnfnqnndzdnjinnfdzfnihnjdzqqqnudizfnihdnzqdihqiiuzfzzzuujuqzhjhdfjjnjfunzdqhuifzjzfjqujqinfnjuufjqjjhudjfuiizjhhdinnzdnfnhziqhdjuzhdnjuidqizuuizfqzunufdqznuuujuizijudqnhdqjfunzdnjhiuqnujjhnfuqfizzdjuunufhfhjuqdqqjhiddhdfzunfihhqzuqnzdquifqfnqnhnhfzizizhzuqfqzuddjiidnidfnqhnufuujuzunfhjjuhihuudjquqnnqjjnqjuqndijjijhhudjqijjnhuhhdzfnijfuuunfjqhfinhfzunuidunhqijqhdnjqfndhjiuqhqdiiifjdnfzdzhhuqufqznzdiunifnfiddnjhijhnhhjdzdnjfqnjjuqfqiddhqqjifuhfidhhzqfhjujqnjnniihqnndhjdunhzhhhqhzznjijznjhjqdnhijinuhhuhhzuqzujjjqjuqjfzddnhifuiqqfjjjiqhhqqfqfjqjdhifzqnhnjzndjinunquzjfzhhjfndnizzhhzndfihhuhdjuzqhzuujqzzzdidzfnqnnjdzdfqhjuihuufjjjfzhzjnfdfznqqdiqhfuundihiqdfhfqnhnjihninuujihunhjjqinzdjuzudqinfzuizdjfnhhzqjqnuqfhzjqihuqnzfdqdfuhizniuqhjfqnfiddjzzdjnnuqjqqdfnnuhihjjizzdnnniuddfnffijfjhjfhijiuhzidfjjhindndnjdfhnfifzundzfnfnuqqdhjzdqfjjqnhqnfuiuhhijudnzihizqhifijhizjnfjqqdnfqnfhqdhhhfqjhhqfqhihqzzddfffijdufizfnfjidjuninznuhndjfqfdhqdudndzdnfhizuhhjuffduzhhqzzqqjuqznudfjuzqfjdzzzuunnndzjihquzdihhjjhhhqjjdzquzqjidfjuiufnjjdzzziduuijduniqudnuunfznzufhnnnjnjiudufjhuqqjunihiuzhfhijznjhndqhnzzhqfzdhqnuunznifinfduujqzdfzquqifqfuiuijhqujjhjhjhhnzjiziunhhfhzjnzfdfzqfinfndhjdifzqhhzujdzjiiidujhhdfdnqjdfujinqdddfuzuqqquzffqzqhqddhidzfhfjqfhuznjdnzufqiudiddjifuiiuifzhfhnzjhndfzdiiunjhiddqqdqfhqqzihidqdfjjiniquiqdqfzfhujzjqzzdzffnfuhhufjinfifdzfujznindfjuqdujufizufhnzhuuzidznjuuzqqjzfhnzdffjnfiiuhnnujzhjuqiuuuijfhqnzuunudjhqdqhdffdhnihhizdqidhdhduzdfhziidfunnfzffnhdfniijnhhnnjnzjinjzdihhufudufhudzuuhqhzziudinninduuqnijdufqqijidunqzffziuqdidizuizzduzdjhihqfdijnuzfqjnunnnnhuijjqdnjfddidiunfdfiifnfhdnuqujhujddznnfinzdjiundhuhqjnzuzznfqifjdqnhjifdjdhudiziufqdufjhhfnjzdiihqhhdjhujqdnffjjhfqnzquqzinfiujzhjzhhiqdfjzzuhhdqiuzjizidiifnjjfinhjjufhhidufqhizdznfiuinjzquzzhhiqdizuqnzffznifhfjquijffjniddqqdhznfhdniufnzdznqijqnznnnqhjzhjhfizjujnnnnijjihifqinhzjnjuzzqnzjifihfqhzifzzfjnqjddjfjqqfffqhfhudifzfiizfuuqdfijnhhdffzzdinfhjhihiuifddnniiqhnfnjzjidndjznquuihfnfidzniujfuqhhinzndjidhjufzhquiduhfnjfidnizzuqjnfujfhhijqjjddiudfhzifzfqijzndjfnunhhddzzzidjiiuhinnndjnddfnhfqnnjijnzzqnizhjqjjzhuqnizqnzuhzdjfzjunuuhzdjidfndjdfujhjnnfifhiiuuzidzuzzjuqfqidfzjuzzzhnijudfnunqhqfdnnuuuqhzfhhqiiqquhzzfdzhjzfiziqfddzufzhnqfjhqnzfznfzfjjjnjqdnznhjizznquhzufihizqnidizifunqqhjduquudufuhhduiqfdininqzdufiufdzhffnhjqiqnjduiqffjzdfjjufuhhjuhifjzuzfdqidhfjqjinijhfnizfhinuzzhnhqfdudzdfjhuqnijuiqqjdjqudfdinjhjzqhqhuizjffdhufqujjqzqfunzuihnzhiuifhiznunjdhddjiniiqufhihndjqnzuqizuiufdqqnddqnfdzzhfuihdiuzndufujqnqduddniujjjhfnquizniznufduiqhfqhdidfhnjihnjjdhfzhihujnufnznzdqjujiuhnjjfnhhudifffhdiiunfizizzunqifhdnjidqzdfjffqjzhnhzhnuhinfqqdniiidfhhdjhjfnhfdndfnqnqziuinquhuzhhhfhqqunnjduihzujqhuhijdnqizjdhjduhhfzqhiniunjqfhhjizzhzqufjzzdijhqqzidjzzfhzquzhzzfinjzzuquzzzjuqzqhqqqnjqqffddiqfnijzffiniqdfuhfzdzunijfuhffhnuuhznuuiuqhzuddjiqdjhdqqfhifiihzzizihhzudzzjqqhnhqdiufunnizinnzqhuudnjdujujififnzhndhfqhzzhnfjdnhdnqqjuhiddhfjnnnzddnifhniifqzjnhhfdqiiuzjqufziuzhzqhnjudfdhdjfuizdindjuqqndiujzjjiduuzhzzuiuiqfhhhzfdhzjzidqdzqdzfjquiznznnhfjzfhjifhqhhnidjdznihifdnufnuqnnidzuhqzihidfhnqdqhdznnzjhqhduqqzjhhfnufjhqfiqdquuunzfdzhjiuqddhhijjhiiniunfijufinnhjnjdiijffhdjjuhhhjznfiqdhzfhuzhdfihjjjhuqdiuidzhhdfunfuduhhhdjqndifqifujnnfnqzuhhuqhniqziidnffuinfinfuddqzhzjhdniqqnqjnnhnffjjjnidfzqqjqzudzinhijuqdjjidudnhqzzhhinnduffnnniqiufzqiizfuhhdnuiiqzdznnhzjudzinnihiqfjihqiiqdnhfdduindjndizqizqqizqijnzzhdiuhuunihuqndqunjnhizqdnijjznhjuuuuudqfnifijudjffjjzdfqhjjzffunniudfzudjnfuiuqqjjhhinzuhhjuzznzfundhnzzdnuzuhfhnnihqiduuzjdfzqqjqihjjqnfhdquqiznuhifdqnfjfffjzqjufiuhdqufqhfujuqzfiffddjuzznjujujdjuqudffhqijfzqjqndfhunqduudqdzjzujuqnhfqqnifjdhzjqfidufqzfnqqhjuzudqidzzinfduudihdhdhddnuhddhnqzidujqfqfhqzdnjhihzhzhunhijziundfjhnzjuddqfjduuzuhjjuinqhuudhjzffjhzzndijjiffnfdzuzuiqzfqjqznuqfzqujfzuqihquuqqzfnuudzdnudnnhfdiinnjfiifudnqqjhdqdqndiujfjudhfqndzqdqdniififzqzzffjzuihqzzdiddzizhfqznujjnfzudhhufzjdzuudhiquzzjhdfddhhqqznznnqdidhufqifqhuunjjqzuddjjzhjzzhihqdjuihzjdhhzuhfzdzhinqhinqfdhjuiiqifqdfiqufidqznfhfjzhzhhnuiqzdnuqqfizqdzifiqqhhzfjjznhzjzjqzihfdnhjifjnidjhdzjfqznziqzfndhjiufhufndnhifdziqudiizzjifjzuujfzfuufiqjzihiqidhqfddqzffiqqqhqfizihizuqduhnfqufuijnfndzfujdzjuqzqzznfihhnqfnhfznzqzfzhjqjffuhidfufdnduuuhjufnuqqiqzzffzfhjhinjdqndhhzuuzqzjndhqffdnfdquunfqhdqfnjjdhqiufhzhnuhufuiquzunhuqqunhiiizzzffiqdiqudqfnufjjhufzhnidjfqjnniinhiiihhjjhniuhquzddiuzqujunfuqddziddfnihfjzzuqjjjduquzdddqihhddqzhuuiqqudfhndzdidjhzjdnduqunhujuzujhqududfnhffhiiiznhdzzhuhufhiizqqhddiihjhunqqnhzhnffnquhjnijifuqununjdhhjunffizufziddjhjuihidqqhzjuzzdfhzzhnzhuhfjqqnnffnqinhdiiihqzhuhnhqznfzfjhuzhdifizjjuqnfundifnjinhhuqunqqihnzinufjuuduiudjfjfnddhjhnjzdhujdznujjfhfhniuhuufzujfizuqjiunhjqjhzjzjjjqfqzjznjqzdddihquhnjdzijfdnjunnzjudnuuqnddnjndfqfddzidinqfqidnnuundndzfuinnhddzfjjifiznjdqihddfzqjqujqdjufdnqnnjndhjjdidujdfidqiihiqzjjuzzidjuuizziizzfnnfqunijzquiuufjunfjhinhuqnjniqzqzjzqqnnhfzqdnzinuijnudnqjzjdhufiuiznzdqdznnnhjzqqdhnuifqjidiqjdfzqzfidjhzuihnhiiziiddhndhfuujjhuduhnnnjujujfihqiuhuhnddzziijdjfznffzhffjqfffjhdqiqqjhdfjuidhhhqhjhiihfhzuqiqnifznnnnzziuniuifuhunuinnfuiiqqhjnqfufzhfqhzdqjnuduqzjuqiznhhhjiqfzjunfdqzzddfnjnujzizidzdunjdnzqfjffjfizhiihqjjiiqznunuudnjhfnidjzjzuijnujzniuzhjqjzqqnujjiuuhnuifnhifjfdjnjznnhjduzhzznqqnnzihjniinzfinuzhhzuzjzunnqzfzifjnujjdznijjnfnqqjjfnifunnjhifufzunqhhhjfqzzjzfijqiuqizdijnifzhindnfnfdjuqzhiqiqdfddqqhqzzhqdihihqzdzffqzfidzznzifnunzhjzhqzjnnfjjijudfihnhnjndizhqnfdhjhqfdiiqjudqhzjhzhhdqhiffhzidqdhqdidnjnqjinfzznzqqfunhnjnudqfjnjqidfuziijzufhjfjjdnjuhufdiuudjqhdhhzfduddffhzddzzqnizqhdiidfhfunizjqufidzhnqhujqqunnzjndqhzjzihfjjjuiudnqqqznnzdiiihunuffdhjjqjuzunhfdzhjjhdfqhdzfuzuhfqhnuznijjhujqiifzqunnzzjunidqqnziidiijnqjujhqfhzdhjijdfijfhdhzqiiqjudidqfjuujuuuhhqnffnfnhunhijzfuunuzfffqdhddquqfnjnzndznfhiniqjjnznununjzudquhhnqqiqfqzqqdqhduqzjfudiuhqhzujzhhihnidqhdfdnqdfufhnfhuzihddnufhqnqfqqfnffznhfuihhfunzhfjufjqffidqhqjqhzfzihjqfnqddfnfiujufjznqfqjfufffidqfdhzhzffjfjdfhzfdffnjuujdhninnnzqnjzjnjzdnunzqhzjihjunjiuffundjzfuqdiuzujjiqnzuhzzdnzuuujdzzdjfhhhiidjjnzfjnqiizunuzqufhuqunhnududjfniuufzjddfdzqqinidhfhjifhzuqnjufqqqdinifujjfihnnzzudfnduzzjqffuuuqiffznnqzfiquznuqqzhdijfhdiqhnhfufihqfqujqjijzfizzhunihjquzndjnjnjuiihfndhqdfnifjhzzqnudjiffjuzzqhhhnqhnqjfniuquzhdnffdnudfzuqdqznnjnufzzqdfhjqhnjhdfuqiunhhdndhniuhuiqzjuqhiqhdqndjfjqjhdhjndjfnzhuijhnfujidqiuhnunzznfqjzuzfuiudqjjniqfujquiuhuhjiunnufjhfjdhuqjjndzdhfqjfjdjiuuinquqjjjqjnnqnnjdfdhhqunhjdujijiijfdhiuqiffizqiuqdjnnqjddddnuqfidfhfdnfzzhffnnqjidzjqzfiuqfindijijqhiujqjfuqhzuiihfiinnufdnuunuqnzffzjnnunuzduunjnfqifjhduzuzqdqziqnzhjzhijqdhhnijqqnujnihhdjiffqhzfhqqzuhinffuiizunuundnujhufjuuhzfqndqnuznduqjdqzjufqzdjqfnjnifujdinqujhqzqizihfjudjufzdfdqjhhdjzzuqdhzqhfuduuzijujjzdddiuhqhnhuduuzfjqiqfffuinhifzzqhzfnjniiqinnuqqddndhfnihhnzhnihiinjuqzzhinnfzfujijqnuidufizqjnfhnhhjnunqnifqhhzjqqjjffdznuzjdqfdqqhqhzzizzuzjnnzjjiqhdhddfqfuhjqniqnzdjfdhfuuqnifuzuhdqizuiidujnjffnzfizjhqfiqqidzdiuffuiujfndfiijujjzifuzqiddjiqnzfqfhhzjufjnjuizddqzfqnfnjinnijhudhzizzqzdhquidiiiujifdnhjizznfjndhniniuqzdjfnjhqidujfzdinujjduujhfnuqjhhhfjuzuzinjnqndfqfhunzfzfziqdddfdjdhnzfqqfnduzqnhjjqddnzfzzufqzqzfnnfffnjnnuujizjjjudhqdnhjznhidquuhfhjjdqffjjizqfunznihuddzjjhihdqzhinnifhuzhqfziunniudfujqdqihizqifzndjiznzqfdjhhijnqfjjnqhzninfqfzqqnfudzqijznqiqfdqiznqduiffjufdzdfdidjdihzdhniqndziuhjdhhdiuuudujnqhzqhjzndzqzqdfjzhqzihjdidzfdidiinzqzfijnjiuhfnnqfihjnnizniqhninnnnhjdhzfzdnfhiqjzhdujiuhzdfdhihqzjifqzfzqiuqididjqjqfhhhiunndjdjhnidqnffdnjdhfhzihhzfjudidnnzqzjdjfquunjdzdujnufzuuzdjzuihzqnjnquidnhfhddhzhhqjfzinqfqqjzqdiuznhdihiqqfjqzhfhqjnnuqjjdnnuhnfunfjiizhhhffiduqdinhndijqunqnjndfhuzqqhiqnunninnhnnjzhnjhqjujuunqjuqhqhuuufddzuqnffqzdizhzzdfjqfqjuiuiuqfnqnhndiuqqhhfzduzdqjdzuqjzuhqfhidzqjdnjhufiqnjqdqnfjijdidufddhjjndqizfzhijnhnunijjqqqhdquzinizdifjhfdnqhhhnnjjnjizqfqhhznhhdhfhzfdhjdquuizndiiufjfiuqdzjqqhiquihqdfnnijnhqzdfnfndiqzijdfujhdnzdzjfifqfihdufzidjnudzuzuuhifdzdniqhhqfhinqdhfunqhuqfjuqduidnqhdujfndujhzzhnqjdjjnquhfujhjufjnujndfdjdffiijuzzznznduddqdqfzzqjdqidzfzjunnfdiqnhunjiqzziffijjjzudjuhhuhddunfufnuzqnfjdfdnjdjjqiuhihnfhzzfhujfznhzqdffzjunuuufhffiiffjfhqnidnihdqdzjjnizqdjqnnhdhffdijzjffnqihjffhhzijnffujiqdjjjnijjffndzfuhjzdzdudzuhifzjjjndufdjhjfdhjjzqiidiziqhhhnuudhzfqfnjuzzdfhfufunuhinqqizqdfnfnizffqiududdzqqqfjhjjujzndjqffnzfuqhnffnquqizhzfdjnqufhnduuijnihjdfqudzuhifznqjzznnfuqfuifzdqnjdqfidfzqnqnihdzziijuzdzhnzdhidnnqidifznnjdfnnnddznznqqjihiihqzuuzznididquujznnijiffhjhuhzhiujqqnfihduqiqnzquiuqdfuhdijhhjnjfijfqnndziqzdfqufzqqzhfiqnuzjuzfhfdqhjnnhqhnhfiunijizhqihnujfqdjunquqjzqdiqhniduzqjihhhiqdzijfzfnziiunnzfzdzffjdinzjqdzzjnjhhdjiuhqhdzqqhiqzhjdnufndjjzuuzfqqdfznqziiunhdfzfffhhfqzhqdhzinfhfznfjzjzdnzjzuhhduqizqfhjzijduhzufidijnzijiufiifdhzzuzndihiqqzzjffuiunnunzdzzzqznjudqduijdhqfhuzihdhunujudiuzihqijnhdjhnzjhfzhjiuzdzfhqffqijfduzjjijfqdqqiuhihhjfuiqjjjiidddjdzhhidniunquidqiqihfjizjfqufqjzuuznzzdzifzfnudhdizhdzfndiiqizujujidhqzqqnndzniuhdndiihuddnzhdudnhdfzzduhnffzdjjhdddhhnjnqqunihjindzfuinffjznudffdhqzqdudjdijfdfhfnqfnizdijuznuqzjiqfzquzdhnzjjdfniuhnnufdnjuuizhdjzdzdzndnjjdzzduunfuffqinizdffhznzhnhqjdhjnhnjqdjnfnqqdduidnqiqnquhfdiuhuzifquddidfdhijnfdinqhjdjuhqudqnifdinnhhzjjdqdfnijjqnffijznqddiizdnzihudiiinfqudjjjjnufdnhunjnfqqhznjuzhquiujffiijjdhdfnffqihhnzzjidufhnhfjizunjqfzhdquzzqjufqzjzjjhujniqzqijnfizfzqjiidizdiqhhnfiudfuuznqdqzqudjqididuihqihhzqjfjdjjjqujfhjdqnhijufqhjdnfffnidfndidnqfiqjzujjfuhfnznnqudfjdfujjfhfddzqnnniqqdddznjzfhizdiufnqufqizquzdjzdnfnuiqnznuqhfuzjnzffddhhqnninuzjnjndihdzjdfjzfjhzfdfjdhzhdfzdhuzufnuddqzhfiiunjuufdjqfnhffnijjhnhiqndqhduhfhnhudfiqhniqdqnhundhqzfdjujqqiiqnfzqzjihuzfhdinjjfdhddhnidjqdiihuhhfidhuqhhhuhqfihquifnffjzuihufdjijhhfzjqhfdjzdhnhuiudhhhhznufjqzuuhqzjiidjqiuzzdjdujquzzdhifihjfjzhnjuiufdnnizdiuhquujjnhhdifnfqqqzfnnndnhjuiiffudzhhjznzjjufnhjdhiuddzjifuuqzfiuqqzuzujqdfhuhjzuznhhdnjnuiifhnifhuzfhnnihdijjzzdizdqziuhnifujnududhhdniznuhfhjuufqnjfnqjjhquqdffdiznjqddiqniiujuuhnjjjnziidihniffudqfuzuhfdfdiiiqdijhffduinzjnhhiufiujniifdqndndfhhunhjffninqdqfquhnfuunznduqjnnizqzjuizfnqzuqdznijhjhinidijiqifqninihnqdhfjiqjjqdzdqqjzfijnuqqhhzzqzhqffziifunhfhjhjuzqdnuinqqquqfnnufzdqjjzfdudzdznundjinfqdzuhuiuidfiqhzhiujnnnqqzdnqjzqffznziiidfqnndizuqiqfhhjiuhhizzjqidddnqnjhjzqdfdfquniddjiinhdinfqndjifizddndfznqnqfqdfdunjhnzddjnfddiidqudqnhqzjfniuijfhzuuuuifqidhzdhiqhjjqjqjnjjufnhzddjjfdzhniufunqhdjfduudfijujujunhfhizfjqqjziqfhfiufqndnjhifddfdzjzdhiqnzuhzuzufqqddduuinzfdnzjfizidfjzfjqfnhdndudnnqfzhzzzziufiuhuizqhiqnnujfnjinjjhifuqhifhqfhijjuuzhihdhdudfnfqquhizuqnqqiizdzfdhnfqqjhfhdjnfufhndzniihfjjfhidfzqhjdqdjiqzjdhuiznzzfdzjunundiqzqnzniddzuhzinnhzizijunnqfuqjzjhnqzqqzqdqzhzzuniuhdjidujinzhffqzdhhzquiqhzfjqnihhqhzdifqhnfiidhiiqhfhudufhhhqujhuiuuuhhdzzjdqfnzhhnujnjhfnzjjhjjjizdnffffuuizfjnzdunuuzjndzffuniiddqfjiiqhfujdduddfddihndfzhnffzdjjuuhquudfizuqdhhjjhzdhfdunnjzufdfffuujqhdhqihiqjundjfjnuhidnzfqjdnzddzijnfdqqjuqzfquhhhdjdzfjfjqffjuzndzujzinjhqidfufdiufzuuujnujjqziqqjduhjfiiuijjnjjqzdzhnnizufjufdnzijiduqidjhhinhfhjfhzdjqudhhnijjqzdijhuznhuuiniijdhqnndqdjifnhiunuzzdhqjunhizndqfdnuhzzndquuhhqzhnqzfzudjniifqhfzqfnfuhfnzjhznjfhuuquiqzqnnhfuhhhhnuiiiuinjnnuhhfuqdffzzzfhjjfnuznzznffjzuznqhniiqdjunnjjiiuudfnhnuzdqqiqzhdqqhdujizzfhfnffjfffhduzuhhjuzjjizqqnjqijfjuhiunqfidqufhhuddqzndhhujhqqfuddjhqjqjnzhiizufffjfhqjqqfdfqjhzqqhjujfujjhzfqfhijdjfjddzidunqqqfzifuhnqjdfdhnjufzfuzuuzhjjzfnufiiiziujjhjjqdquinjjqihzifnunqjuhzfjijnfihdhddfqqjuhujdzffzdnudfjqhfhuhfndijuqzhuhizdfqdzhhifdnzhizzfhqnjuqdudqnjhudiudfnffihndjuznjjziuhdzunhiiufdhuqfqdhjqznhdzhhjhzuunnndzdiiujzijdujqfdqznifhnzzjufijzqzdqqjjddihhfhddhuzjhjidffzfiunqihidhhhnhnhnjzzdjjhzijnhfzufndiqjjiufdfuhiijhfhnhfhdjnudhiififhfnuqziffhjhjjnjqffhqdhzfidnihiqzhjizijjjqjfhfqjidnqjfuffhnjjnhzqzfududzjinizqnnfjuhziiifidfhuznjiqqjnfuzhjquzfzihqffuidqjnzuufuiziuhddqiqjqdqzjqhfzfqnfqduffqnuduhiijijninfnquuqqzddizuijjzjfhuidqufqjhzzhdqudfifhiqufnddfufqninjijjquhddhhzzzhfqquqifuijhqqzqfjhzjjqfquuijhfjzzfzqfdzijjzfjfdqduqjudhufiznhiihhfifhihuhduzijdqhhdunhfhjfhqdufujifzfduijniuizfqjiiizquhiqqhjnuzizdjizfnjdzqniidzqdnhuffudizjzhunjhuqjduzudnuhuudiiduufzuzzhhznzzfdqhhijuizqfiudhhznqfnqijdzfdnfnqijzhfnnhnfqnnhznnhhddijjiiijffqhdzhdiqqjnunfhdqfjnuqzudujuhdnqijnjzzqjhiindjjduudhudndiqiuufzqjnfnizhizjqqiuiuuhqiinudfiujndqidjunuiqhzuzqihifjfiuhifzfjniudjzjdjhjqfnqhizniddfhzfhdfjunjunjdjidfzfuiduqfhjujdjjhizffjhifzdfnqnfjqnhdizjinzdjiuqzzqquufuiddjniqdzqfjzqufzhqzuzufnfujnfudjquhduzzjhiifqfnhfhudjuuqjjdijuzdqnhzhjhdihjznufizfzfhnqjdhidhququuqfqqfhzjihdqhfddqdhduqfnhzfuihqzdnfjjnnqudfujhnnfhfifdduqjinjuuffuqzjffnnqddudfhhifjdqffqzufnuuqddqnnzdddhzdhdhqnduznfqfufzfnjqjuudjqdjhhijduizjiiujiijdidhhjhdnniqhudzfhuffqhzfznznfujqujzjjiqhujzufhudhquzqqnnfijqziqznzqjzuufnqhdjquunfhjdidqnnzfnzijudiqffunijnhzujhfhquqfidfjiznuhndduuznhdjqziqfuzhidffnhujjquhdhqjhqqunjziinhdqqfqjiuiqdqdjihujhjiujfinjjzquhnizujjjfqnufjziziuddjijzuznzuffiujnfhquijujfujjfuuhnfzjzjiuhhnzhjqqjhzqzjqiuzjfdquuqddfdziujnuqfjqhuzqjiizqqjhzqfnhzhuhfjhqqqquhhnfuuuzdqunuzhnnndqudiifnznfdniqjduzdfqjzfquuhhiujjjqhdfqfqqfnqjzjhqnudqjiihifhfndhiudzdididzuqdjizijnqizqqfhdjnquzfzfzjzhnhnfinqhuddjdhiiiziinqjiqqzndfqnnuhuuuzuhdnuhidhfuqnnhhfjudjijindjhzjzzjqhjfnijjqfquuhfuunzquhfhdiudjunuzdhqdzhujhjhzqjdjjfdjzuuzquziddzfquiququqiqjqnnnqdffznqqjjudifqqdqiqqnhufjjqnuizzzdznjjhqjniijndjjqjjuzjhqdqfiudzqdjdhuuuqifhhdiujqndnddinqzuufzfuzdnuiudfqjuujnhnnjfqiuuizqqdjhzzidzdiinnqzqzzzjuunznjqddqnunihijiijzzzfidhhnufunhquqjunuhidqqifnddjqiqiuunuuqnuzinuinnzfzdhjhndnhqzuudziznnfdhquduuuqnhqindnduufzunfqnuzjhddqzqnjquqnqnuqznzqiziniuzunijfiijdqdhihzqfzqhjznijdnhifnunjujdjdzjhjuffqijzdhqzfuuzjquijdhqhuqidqjqfnjnizzuqunfdnnjiquiquhhqzdjzfnquhnfjizqzqifqhduhhfidqzzzqhqzqddhqufhdnzuhinhfqinznjiidjhuuiffudunnqfzhufdundfquhuiudiijfqduuznquqdindfzzidzuzdfjizndjujjzjzqdjhnjzzjuuifqjuqjhfzhzuhddzqzfjjduiqzffqqddnzninnhffqhufdhuhhuzjniuznfjuqjzudzzzjqdhznnqqijdqdjzujhnjfzjdjqjzzdqhduzfhhhndhfiiihqqhniqqdjunfjudnzzjfqjjhiqhizqfhjzzzfndnuqujnndhinhdnjinqqquihfdnjjiqfjhnfduiuqhiqhhhihuqiuddfjiquuziffjndunjzjzqhhzndqhqjzdzzuifuzfqiqdidniqiiunhufzzjzihdhduiiufiqzqnuffzdiqqdnuihzufqhqijfhjzujhfnzjihuuizuhjfinhiinhhhzfjujfqdifzqzjdhhuuuiiudzudnifuhznqznzhqdnhqdqhnqjiquujhndnizuzdjhnznnuqqzfhdfniujnhjzfzunnfqquhdhnjqfuujdiznznhfqzuqihudznzhqunzinuhduzjuhhnizhnqffdfqizfzqhhzqudhiqiujjudjfjnuhidzfhndhnfjjuiqdnnuqiuuuinjundqndznhnqizidqjuifhnnnnjddqfizfudjuqndffjzuhidfqjuizqjjfhinnhfzudhfuznjnuqihzinzjnjqunqfqqujqjjjzddjnnufuujhqjqfnjnjzuuqiudqnujfnqqqfhqnuffnjfjdidzqnuqdhnfnudiiqqhqjuinffqquhjqfqhidjfffddjizzjffnidhzufhhfjfdzzzjhuzjdjhjuqdnfzqqhjfjdhjiuzdjziiquundfnjzhiijhijhzjfjqdzdqhnuhudnidqidnffzfzjqdhqqfqunzzqinfjdnqdnhijiqifhhuqjhfhzjduzzhhfnqhzdhjfuihhnuuijfhzijnqjjdzinjindhfnzindnudnniuuqzdiqiniqfdjdqhufdhhjduiqifdqnidjjidhjqzndhjhqdnzhhdhhijiqzuhzjhjdundqinudujihdijffiqzqqnzfqjzfuhznqjuqnuzunzjjuhfzdjuduhhinfqjhiuquffqfndjjfqnhuiiziuhfqnjhzdzfhuhjniiddqjjnznzuzdnzzifnfjzijfzdjfnqfdfdzjdjhihqnfjiijnunqqfiuiqziquhziifqnzujhqdhjhddnddfqquijidqdqudhihdniinnhhqifjdihhzdffnjziiuuqfihnnfzqfhndiqqfjjnidhfiundnufqqundzudqiiquzhzzndqzihdizfuqdhjuzqijnhuhfifhfhzzznhijhinzhqdziffznfduuhzhzdddndfiijfuhjiqzidifuuqqhnhffqiiuduqzhhnjifnizzdhzndqhufqzuqufdfzfnzznjfnduifjdnziqzjijqjunnnqndjhuuizizqfqqhzdijnnquijhdhuufhnufdnifjjfidjniqqdqijuifnhznuddqnjjjfhjnnzqfzuihihzhifzndqfqiudqhzdhhuuznjuqzhhizznnjfniqfhqjijfquzfuzqdnuqinquffzzhjdjnqhnnzzuzdznjffnjiifzjqfnfhfuznznnjjqndzhfijizqiqzqiqihizzuuuhunizhndjfjqfuiuijiihhhhzndfihhinndqfhnqhunquhinuzjuqzhnfqqhhfhfufnhzdzzjqnddfifjijnuqqhuiqnhdijhiujzndhfdjdqzdqfffzifjjuiqizuzhzdzjuqnjfiiqjjnfnfjdujdqjnnfjhqqzhjudzfhzhiqfdzhzfzhnuiihqnfijjizdjqdjqujiqifzjininjzizjhhhhndnndzjdizdidqfnhzffjzfhninihifzdiidqjhhuhzzjqiiiundduqzuijnzundnjzhffiddqnhziqujiqdufqdjnjqniiujqujifiunzjjizfjhuufnzhujuiuhndjuhhjnqiizfjunzjzznhqdinzquqdihqnnjjzzuhfddudhdqifudijizfjzjuizffiudzzzjnnzddhifndznfjujnfijiqfhzifqzindujjufudfddqiifnnqidfzizhhndqfjqhunnjihjizqndqjndzqnhuzujijzfjdznhhzniqjjfjzfhufnzuujqiuhfhhhdjnidhhqzzfuffzddzfqhuizihuzqjfnuznzdqfqznndzdqifhnfjdqhqzfhfdjznqfiinuhhuudqdizzihjnjinnjinhqddjdznqnunijnqjfjdzdjjjuzhzqiqihzznhufhqdfdhnfudzzdnujjdzhzizqjihqqhqfujznduizhnuzquzzijnfqdqdjnhhidujdhqinuhjnjdndqfhzijihjffzdhuhfqihdqzuhqdihqhujqndhzjiddiidzinfuqinnzdfnzznhjhzdjuzijhijnqjizidqiuhdfziqzfdjffhhqnuquzqnfzidhihijqiqndfqdfifqniqiindhzuduhzndjudijdhfidqzdzhfuuqqjfuznfjqhjhffudnqiznnuuqizhhddjnizndfqddjuhhndhdzffdzuzdqhhnjfuqdzzfdufnfhjudfiiqffhqqhhdqjhnqhqqhhdhujujnqiqnzqqqiqfjznznihzhhqjiiziufqhdufujjudfhuzhjdnziqjjfznziiqqznfihdudzudjziiqfifjzfnhfnihiiuijfuuduuhjdquniqfzifdnzdfhnqdqudiifdzddiuhhizjdfuuuunhnunnjqjjjfndinunnzjnnzjfhznhduizdfhuuqijzidzndquddqhijzijufijzfquijddnnuizfjijfnhffnfznddhdnjqizhundfhfniniqziqfzuzfzjunnfnfffiinhfuqifdjhfzujunzuqiuiizqqdhzhqidfzuzdufqfhdiduizzjfniizzfjhdjhhijjquhihjindfzfzquqqhjfjffjzjdhuihifjhdqfnuudhnjqiuiijnfzdujjnqqdhfhfdduifhjqqfzfdudfffhhqduidqffqzfqqjhqqufzfuhzzduiznuuidujdzzjuznquununhhdqfzqiffqqfjqdjuiiiqzjhqhzfqfhjfunqijiznfuziufnizjfqnqinjqjdjhzfjunduiquzfnqqhzunnhjijidqqhhjqhzhjijhinqquiunuuqnfudzqhiqhdqhjqqnnhzqhjuqqqqinhjjqqfzdiuiijfhquqiudjunuzufhdnijqnuhuujqihnffhizqijuddnjdhqnhnjqufnidhquqjuhnzhiqinnfuinuzhjfniniuqzinfhudnhjjnqqfdjhhdqhjnzunjuqhzudzzhdhzzdjjhqjhfunquhizhffzninnnifiiqjihihhjhnduifjuiiuqzqqinuqqdjizdfhqhhhhdujjijnhdjqiuiquunnqdhizzfdqffjjfiihdqihiufzdizhffunuqzzdzdddiufzndizfzjuzjzzdzhddqdhuqqijdhuqnjfhndjufdhzfjhiqqfdqfhzjhqhqdfiiqnzqqznnzdfnnjfuqnnifqifnziqujnqnfdzhhiffhnnqnjdnqujdqunzjqzdfzfhdjhjuujidiujjzinjddindjujdzjjunfuuzdhiddfnjunqujhfnndzhdjiunudzzqhqjidddjudjnhjuhfdzidfiudqnunzhjnfjdhzjiqzhqjzfnzzdjzhzqddznujifzhfjqujjidjndfufqddfnjqiiifhdinizunjunhdznjizhdzjuuqdnunzihnjfifqqhddujjznnuqdiddzzfhzffiddhihqhqnddqhzznjhzqdqjhundzqqnnjudqqhqdnnfqujifnnziqijfznqfhhhuhddznqunqufijujdfdqzqhjnhjqzqffuuniuhfiqijqqnzjqhqjhnfjzuzqdfquqdjnfihuzffffnfinuiqffuqzzfnuqhzhuddijhhihzqudifjiqizqiujdjjjqquzqidihfqfnqunqufdninuijfqndqjjfnqfiinuqjfzinjnqnnqjndizdfqjifudqizizzfjqfhujdjijfifuunnjndquzndhjuihnzfndjidunuhiunjudqqdfnjqdjzzizdqifnfznzfdhdzjzdqhdzzfjjjjnjjqinizudhfjhhqfiinzjqhzhuuiiujijjqhhhnhjjnihqufhzddhjjzfjiujqidzuiuuzzdizqijhnhunnjfqzjdjddiunqqinhzzdqzfqjiffhhiffiqdnuuinuqqquinuffhqhnfhfdnudidqqdzjihqiindihuidqjihudfjnzjhjqqihuzzjjqjdnjnqhhdihfuuqiqzhhzzzindiuunhqihjduinjzqjdnziiqzniqiuizznifhhnnhfzjjznzjnhhndjddhqufzjdqjjzqzihizfzjjujhfnnffhufiziifqufznjhddufjjfifjdhnddzdqjfduuhquiqnnhqjfzdhdnqfuqnuiuujnqudfnnnnhifdfundnjzqndinifzhnduhuzdfijiihjdqqujjzjjqzqhzhfzjjziuqnhhnuiqqzunuqjijuhduhfnzjhhuhhnznhqfqqqjjhnffhnqidunfudjnuuufzdiuinqunjujijfdfiiuzzhhjnzzhijhffiqnudznjquzdjfznhqhquzjzfffzfiuduhduuuquzhuuuzhfdqiznqqqhjqnznzffnhhidiiffdjzhudzihfnjqqjhqudjfiiiqzihzhniinuifiqzqifjqudquiddzzhzzduzfndizjjudiijjfjzdidhdjihijjqunjdujzznfzjnddjfzihjhfqiiduqdzdhidfifiihzzifdhnjfunhzfdfqffuzzundnifiqhuzfdfffdzndzhhqfunnqfdunundfqqndjfjuuunhdjjihnjjjzjuuhznnziuidqiqqduiudjuhhidijdzzihjudnnqqizhiifqqfduhfzhijihfdfqdududfuhnhdnzfdhuniiqfjuqifhqhqqifqfhziidnhfquiqzdhddqjhqhuhiqzjuznnfuzqidqnihuzijinjjfzqqdqdzuzqjjiinqjduiijifqdnzudzdhhduujnfhfndhqjdzjdjfjuzqinzindhhqdidnidiqdzjizfudzihhdqinzzzifzujuidfdjzquznuizfjqdinizuqjdjfzzjnhifijdujdduziihjnqjfhnufijdzfziuujzfdnqunufddiuunuiihjunfhnfndzijzzqziniqiniqhiuijdqjzqnnjzijhfjnfqdznfnuzdfijndfjfnhnjidfzquuqznujnnjhzidqqzjihdfiufzqhjfzqnjuzdqnnhqzfzfninffjzihqiqifnqdfjujqudnqiuiuqjuuqfniiijjjfddjfnijjfqndjziqiqdqninuiiddhzzjfffuujnhdfuffizziniiiqduqufqjdddfhiudhfqqjiuqnijhndjfniqzhdnhnjdhdqhiiihziuuqundnfzzzuqiijzizqfizfuujzuzuhiizhuzujjfuhhuqzfuujdjuzfzhiqnquddndjfdjjqfuhqzinunndqjzquzfhnhfqihqzduzdhfjfzdifjzndzuhihjqndqifzuuqinnhqfffiuhhzffhfqiinujfnuhfdfjfznnhhnzfqzufddqjzidihndifjzhjdhfzunnznqziufzijnuudqhdjfdjjfiqfnhiiujnquiizqjqjdifqnfhhqqqhdnihufdjnzhfihihfhzufdzznzzfqzdfjuuifhjujnidznhfnqifnfqdfhqzdjjdhdhzhqdfqdzfzunfuuzqdhifhinzudfjndfjunzuqdqffjdniiujqqjhnuuhnqfhfqfdniujhjizdfnzfquindfdqqdjnzuuuuqndhhdfzufizfqjhnujqduijzdfqdujjqqdizjduifqjhffhnfjijjinfuqjiduqfufjuqjhfjzfiunuujnhuihfjnnqzhddhzuiiqihizuqjdijuzifuqqfdhhhfjzjhdququdiudjihfjzfhqhnifhjffqjqhnfuznqdqnjudzjnfiffndjnfijhdzfhnnuhzqjzuqnhfjdjqjfidnzujfhidnqizzqfihzddhfndnnnuqfhqnnjundhnuqddfqhfiuffqnjdqdjiniiuquhnudhiniqfqddnnnqfudnudfzhzzijqfhujhfdzihhuhjihdjnjhhdnfnhhdiiifznhfzunufnquhiqunnqihnnzhniizqhfiidjjqhzfzidijnjqnhizhuuujfhffffqqfqhjzdfnjzdjiiizdjjqqffhhuqnzuudifnujqhiqnjjjuhziqdnfqjfzhfuhuqnidqzifudhuqqiujfhzzzuhuzziufnffzjuqhfddjijnnzqzjhfjzuiqhizunufjqdzjjjjihjzqjjhifzhhjdffzfiqhjduqnnddifndfuhidfujddduhhhfndziznjhzdfjiijqqzdjuhzjfjzzujdufiffzfjnijqiqudffnniqnhnuudiiqjqufqifzqhjjqhjzqiqdqizihqnziqizjfdnqjidfnhujqdfnnnffznzdhniduhuinizfnhdudzfujhjqjdqdijdhhndhifjjhudhjunnhzhuinddqfhqqnufnqdhnnhzjhnhuiziqfhzifnqnfhufdfdfhjnqjjhfuqjddzzjzfhquhdqfhuujdhddunzjuihznffnqqqhuduifufhnjzzdquznjhuziuddqiiiqufqiuqidnnnuzjiuidudhznhujfffnqhjzjnqijuqifdfjijunfinqnhffiqzqhqzdjnzhdndfqhqjuihjhuzhffidddunhjiifdzdzznqqqihdijnfddiiiizddjuuifzuddinqddfunnijinfuddjihqquhfujfjduddqzqhduqzdjfdiiqzjnndhhdfffnqdnzfuniihiqhzjuiqfuuzfzhnfnzjidhzzdjqnjznqzuhdzfdquzhnhquhuzqijfjfzfququdqijhhnndujjjquqfdfqziquijdqfhdunzhjhfifjqffnqjziiujzzqnnzqdqjizuunzfqjunjnhhqujjzjzifqfnfufiduznudhuquqzjfujnjdfqnhzjuhiijdddujnnjidfudjhfdhizjfnqzhffqqhzfifnffhihinnfiqnqiiijujhidzihdnufjqujfhiinujufqzfnnjnfjjzhndfzqiqzdzqijqnfjuuujqzjzqdinunzhfzqiqfinfinfuqifjnjhfuhhhhqjjfjdfnuhqdfuufnqzfqujnjjnifqhnfiizqudinqndhfzujzqjnjznhznhuqfjdffnqqunzhfnnzfjjdjqizqqnihiduzuhjnqfzfdqdiuizzdzzqjiuhzjzziiiinzufujunnznnqudinhiqinfnniqnjdzuuudjzjujhduniiiuuznfhzzihzjnqnhhzjjdiziniiuhnhqdfhnddzfnfnqjhuqnzqdfffudfdfnuqjqujfhjnudjduhihjdiufjnfhjjizqunfdjniddzhzjddnifzqfqjijzqfdfhjqihdhdiqduhnqzjdfjdzdzhinnnhjzdjnnquzfjujqihqnqqzjfnnjquiudjddhqqdfhfhdqudqdjjduuufzzqdiqhuhqndjihhqfnnfhidjuhfdjhzniijfininnuqhjfuhjduzjnhqquunijiujnqufhqujdidqqzzuzhfhdijhifhifnqzzudzhfihqizihzqifujuiqhfhinunudijdnziuhndfqqdhndijfddjjhizqnznjqfquuijfnffujhqdjhihqzjddhqjiuujznzzunfdqjfiduznijhidnfjqjnniqfuqniiiuuujfjjnqiihdhhhfhzzjhdqnzzuuhdfhfnqnjuzhiunuddqzdqnnujhijqiuuqnzuzziizfhdnzfnhqjhiddqnqjqhnfddnujudizijfzfnqhqhnhhqhnfjdjqdninznijqfjnifhfhindiuuqiizdzidzfunuziiqjqijnzqifizjfuhffdfjuzqzhuniqniquddqzdqqqufjzifuuudqjdzzfnjiihizjznqnijzfnjqfihihzifnznuquuizfhfjhjjujizfddhhhhjnfuhdfduqhihqdhijinnfnqqjzihuffnihfujfdijuzudqhihdqiqzqnfhijdnijjihdzzudhizzhjziqdndijqhidiqufnzhdqfnzzujuqhjihnzqiinzuhunhqnuufiuqfhizjdhhnzhzdhzdqhuhjjifhnnihqfddqqjifidfdqhjfqhjhuujiqndhdddqdqfdduiqfjuzuujzndjqqfjjhifdjuqffuniuhiihiudiziddzjzjdhudqhddihnnnnfqfuqhnnznhfiziquzfdfuhjffznunjjhfzjnhqjqfhfzdnhfzfuquiidiifuqfdiqhdjdjfzdjjuqqhnuzduqnjidnnnindhqdqhhdfidzqdznuquznjndjufiffuzjjfhnnznzjfhifduqqfuhunfzuiqhijhdhzuddiinhzfjqiihndfjznhuhzihquhiufzzzijuufqdiqiqfhjnzjzhizzzdfijnunznzqqijddnijnunhuniuhhdqzniqqzhziinindjjfzfqjuzjzniuzdufzzziqznjjfiffifdfuzqnzjnhqdznqnqzidqjjqqdjqiqdfdqhuqdijdhquhndidjnzudiqqdzhhifqdufihdidfuzqihfqqnffijdfizunzffziniuunihizqdniinzhjzddiufiznfdqddnhndiuqhhjnhduznzhhjiuudfnqfnzjuhzfnjhiqdufjdjfuddiiziqnfnqnnizqndnnudnhhqddfqidjuduuuniniidhiijfdffqfjuqiuqfjnfjnuuzjiuqufnihqndzzfjufnufdhqinnzfhzjhiqdfddjuzddjfffhfijuziqhqzuquudjidijddfzjzzzfufduqzfdnidunzzhuiznihfqqzndudjzihqfuihnujqnfdhqndfquhjzfqiiiqihzhqjfjhhqqjzhfizfdjfjhqzfiddiqhunqnqufzfhhznniffnqfizqzqfinzhjnihfifzqhqqfjihddjjnzqhfijufqduhhhuiddnhijuqzhnnzhjfjjinuhjqufuudujnuqiqhqqdnjdzhhjjnffnqiqqidnduffjhjujijnfdjzjquzuzijninuqqunffjzfjjdhiqiduuujfhfhzufhffddjjhdijjqunhiudfqdhffifqjdziqjdqqdjnzunnhhudhqzhqqdfhnundhqjfzuijujdfdjufifunhhnqizqdzufizniifujnijhdfuudduudjijfqqduqinjhdifdjiizdffdhnzhziudznhfhhzddfhqhdddnijjifihqhidzdqjjiquudifqfzjufifuhzzniufhuzihqqihndzjifnhfdiqifiniqiinfzqqfffiqdhfhhhznnfnziduinfdjnndqjuhqjndhfuijiinqnniifzidhffinqnnqzqqhzhnfujqjduffjidzujqindndnqqunnizqzizuzizqjudifhqnqnqhndddndjnhhjjzzndzuijqqufuhnjzdqfidfqudhznhzfhjqhfjiqjfzhnnnnhnznqdnffjjiqqjddnzinzhqudhiqqhjuuznfuhddhqhdhnnuzjdnidjiudzdqzidqzfzfhiqnzujnqujzhhdnjqifzunfjznzzhjqjdzzdqhzdqfziufuhzunnuqnhzjhjizuzunidnduuuqijddfhzjfhihzhhfuqhdhuzudzqfuujdjhihjqqnzjjhhhdfzjjzhuzquizjuqnfijzznnhjqidhhuhzdidjqqzhdzuhznhfhdjnqnhhdunujqudqfziiqujiuuujjjujfqqhnqhnqqqfuqjfjquidfhifhjqziiuhffzniiiunjiiidnzhfnhnufnhhfujqhnffnqhndnijfidfqnnjihzquufqhjffujqzjzizudihqunnhfjqzfifndiziznuihihfuhqhnidzqhffujzuzqzhfzhdqddizjudzdnzfnffujhdjffjnhznijifihduhuuqdjinjznfduudfffqfhdznqihqnifzuhdqqqhdfjhfqnznhuinjzjhznizujnfijifjjfnfjufdnidnnfnzzfhjiunqzjzqqdjqnfjnnzfhuzqfjjnjjhuiiiqffqqfnhiduuiifjffqiniqufquiinuhqudjqjiudihufhijhqqjdjfhqnnnhiuqffufnijqfquddddfhjzqizqhjhffidhqinhjjuiiuiddfqzuqjjhqqizfzzzufiihjhuidhdfjqijnnquuqdffzuqnhddqddjdfijqnuzudnhzfhqnqihnqdjjndhzfqnuzfqidfhqninnjuznjuznifhnqnqunfjhunuhfnjznuznzzzzuinjdhizddizqquujfdqiqnufiddifhhznduhjhdddnffhzinnzhqzqfhzuhnhfuiqfjfzhhufqfuffnqzjqjqnqhnqihfihuffhzzznujnuqzudnhhjhqufzizhhjjiqfdjduzqzfhfnuuqjffuiffnhquzfzfhzuqjdhfdjnujuudfdzuzuzuuhuujuunznqzzniqufjjfqqhhhuzunziujzudjuzqdzquijnfqinqihffzdqfijhuzfqifqihjqhdhdfquddqhqqndzqzjhnfqnuiznhddqqinndqdjfnzdqufiznq\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 438,
        "task_id": 4108,
        "test_case_id": 20,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "qsqqqsqssqsssqssqsqqssqsqqqqssqsqqqqqqsqqsqsqqsqqsssqsqqqsqqssqqssqssqsqqqqsqqssqssqqqsssqqsqssssqqqssqqqqsqqsssssqqssqqssqqsssqqqqssssqsqssssqqssssssqsqqqqqsqssssqqssqssqsssqsqqqqqsqqsssqsqsqsqqqqqqsqqssqqsssqsqssqsssqqssssqqsqqqqssssqsqqqssqsssssqqsqqqsqssqqqqqsqqqsssqqqqssqqsqqqqssssqqssqqssssqsqqssqqqqqsssqqqqsssssssqssqsqqqsqssssqsqssqsqssqsqsqsqssqqqqssqqsqqssssqsqsssssqqqsqssssssqssqqqssqqqssqqqsqsqsqqqsqqqsqqqqqsqsssqqqsqqqssqsqsqsssqqqqsqqqsqqsqqqsssssqssqssssqqqssqqssqqqsqqqsqqqsqqsqsqqsqsqssqqqqsqqsqqqqqqqsqqqqqqqsqqqqqssqsssqssqsqqsqssqqqsqsqqqqqqqsqqsqsqsqqqqqsssqssqqqsqssqsqqqqqqsqqqqssqsssqqqqqsqsssssssqsqssqssqqsqssqqsssssqssqsqqqqqsqqqsssssqqssssssqqqqsqqssqqqsqsqqsqsqqsssssqsqsssssqssssqssqqqqssqqssssssqsqsqsqqqqqqqqssssqqqqsqsssqqssqqsqsssqsssqssssqqqqsqqqsqssqsqsqqqqsqsqqqqqqqqqqssqqsqqssssqqssqsqqqsssssqsqqqqqssqsqqqqsssssqqsqqssqssqqqqsqsqqqqqqsqqqqsqqssqssssqsssqqqssqqsqqqssqqsqssqqqsssqssqqqqssqqsqqsssqsqqqqsssqqqsqsqqqssqqqssqqssqqqsqsqqssqsqqqsqsqsqssssqsqqqssssqsssqsqqqqqqssssqsssqqssqsqqssqqsssqqqssqqqsssssqqqqsqssqqqqqsqqqsqsssqssqqqsssssqqqssqssqsqqsqqssssqqsqsqqsssqqqqssqqqqqqqqsssqqsqqqqqsqqsqsqqqsqsqqqqqqqsqqsqqsssqqqqqqqsqsqsqqqsqsqqssqqqqsqsqssssqqsqqssssqqqqssqsqsqssssqsssqsqqqqssqqqsqqqqqqsqqqssqqssqqssqqqssqsqsqqqqsqqqssssqqqssqsqqqqsqssssqssssqsqqqssqqsqsqqqsqssqsqsqqsqsqssssssqsqsqqqsqqqqsqsssqqsqqqssqsssqsqsqsqssssssqqqsqsqssssqqqsssqqqqqssqsqsqsssqqsqqsqqqqsssqsqsqqsqqsqqqqsssqqqqqsqqsssqssqqqqsqsqsssqsssssssqsssqsssqqssqqqqsssqqqqsqqssssqsqqqqsqssqqqsssqssqssqqqsqqqssqsqssssqssqsqqssssqsqqsssqsqssqsqsqsssqsqqqqqssqsqqqqqsqqqssssqssqqqqqqsqqssqqsqqssqqqqsssqqsqqqsqqsqqsssqqqqsqqqqqsqsssqsqssqqqssqsqqssqsqsqqqssqssqssqqqsqqqqqqqqqssssqssqqsqsqsqsqsssqsqqssssqqqsssqqsqsssqqqqqqqqqsqqsqqssqsqsqqqqqssssssssssqqssqssqqsqsqsqqqssssqqqsqqqsqsssqqssqssqqqqsqqqqssssqssqqssqqqssqssqssqqqssqqqqsssqqqssqsqsqqsqsssssqqsssqqqqsqsqqqqqqssqsqqsqqqqqsqsqqssssqqsqqqsqqqssqqqsssssqqsssssssqqssqsssssssqssqssqsssqssssqqsqssqqqsqssqssssqqqsqssqssqsqsssssssqsqqqsqqsqqsqqqsqssqssqqqqssqsqqqsqsssssqssqqqqqssssssssqqqqqqssqqqqqsqsqssssqsqqqssqqssqqsqqqqssqqqsqsqsqqssssssqsssssqssqqqqsqqqsqqsqsqqqqqqsqqssqqsqqqsssqssqssqqssssqqqssqqqssqsssqqqqqsssssqssqqqqssssqsqqsqsqqssssqqsqqqqqqqqqsqqsqsssqssssqssssqssqqsqssqqqqqsssssqqqqssssqqsqqqsqsqqssssqqsqqqqqqsssqssqqsqqsssssssqsqsqqsqqsqsqqssqqqqqsqsssqssqsqqqqsqsqqsssqqqqqqsqssqqqqsssqqqqssqqqqssqqqqssqqsqsqqssssssqssqsqssqssqssqsqsqqqsqqsqqqqqqsqqqssqqssqqqsssqsqqsssqsssssqsqsssqsqqssqsqsqqqsssqssqsqqsqqqqssqqsssqqsqsqqqqqqqqqqqqqsssqssqqqsssqsqsssqqqsqqsqssssqsqsqsqssqqsqsqqsqqssqsssqsqqsssqqsqqqsqqsqsqsqsqsssqssssqqssqqqqqsqsssqqssssssssqqqsqsqqsssqsqqqqqsqqqqsssssssqqqsqqsqsssqsqsqqqqsqssqssqqqssqqqssqsqqqsssqsqssqqsqsqqsqqssqsqssssqqqssqssqqsssssqqsssqssssqqqqqssqqqqsqqssqqqsssqqsssssqqssssqqqsssqssqsqsssssqsqqsqqsqqqqqqsssqsqqqqsssqssssssqqsqssqssqsqssqsqsssssssssqssqqsqqssqsssssqssqqsqsqqqqqqqsqssqsqsqsqsqqqsssqqqsqqqssssqsqsqqsqqsqqqsqssqqqsssssqqqqqqsqsqqqssssqqqqssqqqqssqssssqsssqssqsqqsssssssssqssqqssqqssqqqssqssqsqqssqsqsssqqqqqqqsqqqsssqqqqsqqqqqqqsssssssssqqqqqqqqssssqsqqsssqqsqssqqqqsqqsqsqsqqqssssqqsqssqqsqsqqqqqsssqsqqqqqqssqssssqqqqsqssqqssssqsqssssssqqsqssqssssqsqqssqqqsqqssssqsqqsqqqqsqqqsqssssssqsssssssqqsqsqqssqqqssssqqqqqqssssssqsqqssqqsqqsssqqssqsqqsqsqqqssqsqsssqsqqsqssqssqsqqqsqqqqsssqqssqsqssqqqsqqqsssqqqsqsqqqsqssqqssqssqssqqsqsqsqsqssqqssqqsqqqsqqqqssqsqqqsqqqqqqqqqssqqsssssqqqqsqsqqsssqqqqsqsqssqqsqsqqssssqqqqqssqsqqsqqqsqqssssqsqqqssqqqqqssqssqqsqsqsqqsqssqqqssqqqqsqqqqsssqqqsqqqsqqsssssssqssqqqssssqqqsssqqqqssssssssqssqqqqqqsqqqqssssqqsqssqsqsqqssqsqqssqqsqssqqssssssqssqsqqqsqssqsqqqsqssqsssqsqqqssqsssssqqqqqsssqsqssqsssqqsqsqsqsqssqqqsqqssssqssqqssqssqsqqsqsssqqssqsqsssqsqqsqsssqqssqqssqssqsqqqqqsssqqsssqqqqqqqsqsqssqqsqsqssssssqqqsqqqssqsqqqqqsqqqsqqsqqsqqssqqssssqssqssssqqssqssqssqsqsssqsqsssqqqqqqsqssqsssqsqssssqsqqsqssqqsqqssqqsqsssssqqqsqsqsqsqssqsssqqqssqqssqqqqqqssqqssqssqsqssqsqqqssqqsqssqqsssqsqsssqssssssssqssssssssqsssqqsqqssqqqsqssssqssqqsqqqsqsqsqqqqsssqsqsssqqqqqsqqssqqsqqsqqssqqqsssqssssqsqqqsqqqqsssssqqqqqssqqssssqsqqsqqqqssssqqssqqssssqqqqqqsqsqsqqsqqssqssqssqsqqqqsqsqsqsqsqssqqsqsqssqqsqqssqqsqsssqqqsqqqsqsqsqqsqqqqsqssqqqsqqsqqqsqsssqqssqsqqsqssqsqsqqssssqqsqssqsqsqqqqsqssqqqqqqqssssqqqqsqsqsqsqqsssqsqssqsssqqsqqqsqsqsqsqssqsqssssqqqsqssqqqqsqsqssqqsssqqsssqsqsqqqsqsqqssqsqqssssqssqqssqqsqqsqsqqqqsqsqqssqqqqqsqqqsssqsqssqsqqqssqqssqqsqqqqqssqqqqqssqqqqqqssqsqqqsqqssssqqsqsqqsqsqsssqsqqqqqsqqqssqqqssqssssqqqsqqqsqqqqsqssssssqqqqqqsqssqsqsqqsssssqqqqsqssqqsqssssqqsssssqsssqqqqsqqqqsqqsqqqsqqsqqqsssqqqqsqqsssqqqqqsssssqsqssssssqssssssqsssssqqqsqqqsssssqqqsqssssssqqssqqsssqqsqqqqqqsqqsqqssqsssssssqsssqqsssqsssssqssqssssqsqqsqssqqssqsqqsssqqqssqssqssqsssqsqqqsqqsqsssqqqqqsqsqqsqsqsqssqqqqqqsqsssqsssssqsqssqqsqsqqsqqqsssqssqsqqsssqsssqqqssqsqssqsqsqssqqqqqsqsssqqqqqqsssqqqssqqsqssqsqqqsssqqqqqsssqsqqsqqqssqqqsqsqqsqsqqsssssqsqsssqqsssqsqsqqsqqqsqqsssqsqsqqssqsssqqqsssssqsqqsssssssqsqqqsqqsqsssqqsqssqsqqsqsssqsqqqsssqssqssqqsqqqsqqsqqqqqqssqsqsqsqqsqqssqqsqsssssssqsssqqqqqqssqqqsqsqqsqssqqsqqqsssssqqqqqsqqqqsqqqssqssqsssqssqssqqssqsssssqqsqsssqsssqqqsqqssqqsqssqsssqqssqsqqqqqqqsqsssqqqqssqssqqsqsqqsssssqsqqssqssqqqsqqqqssqssssqsqqssqsqssssqqssssqsqsqqqsssqqsqqsqqqqsqqssqqsqqsqqssqqssqqsqqqqssqqssqqsqqsqqsqqssqsqqssqsqssqsqssqsqqsqssqqqssssqqssqssqqssqqsqssqqqqsssqsqsqqssqsqqsqsqsqqssqqsqqqsqsqqqqsssqqsqqqssqsqqssqsqsqssqsqqssqsqsqsqssssqsqqsqsssqqssqqsssqqssqqqssqqqqssqqsqsssqssqssssqqsqqqqqqqssqsssqqqqsssssssqsqqqqsqsqqssssqsqsqqssssqssssqsqqsqssqsqqqsqqqqqsqsqssqsqqqqqqqssqqqqqqqqqssqqsqsqsqqsssqqqqsqqsqqqqqqssqqqsssqqqqqqsqqsqqqqsqsqqsqqssqsqsqqqqqssssqqsssqqssqssssqqssssqqqqqsssqsssqsqqqsqssqqsssqqqsqssqsqqqqssqqqqqsssqqqqqsqqssqqqqsssqqsqssqqsqqsssqsqsqqqqsqsqqqqsqsqqsqqqqssssqqqsqqsqsqqqqqsqssssssqqqsqsqqqsqsqsqsqsqqssqsqqqsqssqqsqssqqqqqssqsqsqqqqsqqsssqqqqsqssqqqqqqqssqssqqqsqqqsqqsqssqqsssqqsqsqsqssqssqssqssqqqsqssssssssqqqssqsqqqqqqsssqsqqqqsqqsqsqsssqsssssqssqqssqqqsssssqqqqssqqqqsssqsqqssqqqsqsssqqqsssqsqqqssqqqsqsqqsssssqqsqqqsqssssqsqssqqqssssqqsqqsqsqssqsqssqqqqqqqqssqqqsssqsqqqssqqqsqqqsqsqqsqssssqsssqsqsqssqsqqsssqssqsqsqsqssssssqsqqqsqqqssqqsqsqqqssqsqqqqsssqqqsssqsssqssssssqqqqssqsqsqqqqsqsqqqqsqsqsqqqsqqsqsqqqqqsqsqqssssssqssqssssqssqqqqsqssqqqssssssqqsssssqqsssqqssssqsqsssqssssqsqqsssqsssqsqqsqsqsssqsqsqsqsssqsqssqssqssssqssqsqssqqqqssssqssssssqqsqsqqqssqqsssqssqsqsqqqqsssqqsqsqqssqqqqsqsssqsqqqqqqqsssqssqqsssqsqqsqssqqqqsqqqqqqqqssssqqsqqsqsssssqqssqqsqsqqsqqqsqsqqqsssqqssqssssssqqqsqqqqqqsqsqqqssssqsqsqqssqsqsssqssssqqqsssqqqsqsqsqqqqsqqqqsqqsqsqsssssqqssqssqsqqqssqqsqssssqsqsssqsssqsssqssssqsssssqssqqsqssqqqssqssqqssqqssqqqsqqssssqqssqsqqqsssqqsqsssqqssqsqqqsssssqsssssqqqqsqqqqssqqsqqsssqqssqqssqsssssssqqsssqqqqssqsqqssssqqqsqqsssqssqqsqqqqqsqssssssqqssqsqqqqsqqsqqssqqsqsqsssqqqqsssqssqsqqsqsqssqssssqsqqsqqssssqsqssqqqsqsssqqqqsqqssqsqqsqqqsqqqqqqqsqqqqsqqsssssssqqqqsssqsqsqqsqqssqqssssqsqsssqqssqqqqqsqqsssqqsqsqsssqssqsqqqqqssqqqqsssqqsqssqsqsssqsqqqqssqssqqqssqqsssqqqqqqqqssqqqqqsqsqqsqssqssssqssqqqsqsqqsqqqsqsqsqssssssssssqqsqsqqqqqqqsqsqsqsqqsssqqqsqsqsssssssqsqsqqssqqsqqsqqsqqsqsssqssqqsqqssqqqssqqqsqsqssssqqssqsqsqqsqsssqsssqsqsqqqssssssqsqqqsqsssqqsqssqqqssssqqqqqsssqqsqqssqssssqqqsqssqqqsqssssssqsqqsqqqqssqsssssssqsqsqssqqsqqqssqqsqsqqqqqqssqqsqqqsqqqssqsssssssqsqssqqqsqsqsqsssqqsqqsqsqqsssqssqsqsqssqssssssqqqssqssqsqsqsssqsssqsqsqqqqsssqqqssqqqssssqsqqqsqqsqqqqqsqqqssqsssqqqqqqqsqqsqssssqsqqssqsqqssqqssqqqsqqqsssqssqssqqsqsqqqsqsqqqsqqsssqssqqqsqsqqqssqsqsssssssqsqqssssssqqsssqsqsssqqsqqsqqsssqsqssqsqssqqqqqsssqssqssqqqqsqqsqqssqssqqqssqqsqqssqqssssqsqssqqqsqssssssqssqssssqqqsqsssssqqssssssqsqqqsssqssqqqssqqqqssssqqqqqsqsqqqsqqqqsssqqssqsssqssqssqqqssssqqqssqsqqqqqqsqqssssssqsqsqssssqqqsqsqqssqqqssssqqqqqsqqssqsqsqsqssqsqsqqqqqqsqssssqqssqqqssssqsssssqqqqsssqqssssqssqssqqsqqssssqssqqqssqssqqqsqqqssqqsqqssqqsqsqssqsqsqqsqqqssqqqssqqsqsqqqqqqsssqsqqssssqssqsqqssqqssqqqsqqqsqsqsqqssqqsqssssqqqqqqqqqqqqqqqqsqsqqsqsqqsssqsqqsqqsqqsqqqssqqqqsqssssqqsssqsssqqsqqssssqsqqqqssssqssqqqsssqssqqqqsqsqsssqqqqqssqssqqqqqqqssqqsqqqssssqssqqqqqsqssqsqssssqsqsqssssqssqsqqqqssqssqqqssqsqssssqsssqssssqqqssqqqssssssqqqqssqsqsqsqssqqsqqssqsssssqqsssqssqsqsssqssqssqssssqsqsqssqsssssssqssqqssqsqsqssqssqqsqqssqqsqqssqqqqqssssqqssqqqsqqqqqssqsqqqqssqqqqqsssqsqsqqqqqqsqqqqsqssqssqqqqqsqssqsqqsqsqqqqsqqsqsqqssqqqsqsqsqssqsssqssqsqsqqqsssqssqqqssqqqqsssssqsqqsqsqsssqqsqqqqqssqsqqqsqqqqsssqqqqqqqsqsssqqsqsqqqqqqqsqqqqsqqssqqsqsqsqssqqqqsssssqsqqsqssqqqsssqsqqqqsqsqqsqsqqsqsqssssqssssqsqsqqsqqqssqsqqqqsssqssqqsqsqsqssqsssqssqqsqsqqqqqqssqsssqsqssqqsssqsssqsssqsqqsqsqqqqqqsqqqsqssssssqqsqqsqqqqqqqsssqqqsqqsssqsqsssssqssqsqsqqsqsqqssqsqssqqsqsssssssssssqqsssssqsqqqsqqsqqqsqqqqqsqqqqsssssssqqqqsqqsssqsqssqqqqssqsqsqsssqssssqssqsqqsqqqssqssqqqsqsqqqsqqqqsqsqsssssssqqssqqqssqsssssqsssqqqqqsqsssqqqsqqsqsqssqssqsqsqssqssqsqqqqqsqqqqqqsssqsqqsssqqqqssqsqsqsqqqsqsqqsssssssqqqsssqsqqsqqqqsqqsqqsqssqqqqsqsqsqqsssqqqqsqsqqqsqssssssqssssssqqssqssqqqqssqqssqsssqqsqsssssqsqqsssqssqsqsqqsqssqqqqsssssqsssssssqsqqqqssqqqsqsqssqqqsssssssqssqqqssqsqqsqssqqqqqsssssqqqqssqqssqsqqsqqqssqqssqssqqsssqqqsqqsssqqqssqqsqqqsssssqsqqsqsqssqsqqqssqqqsqqssqsqsqqqqsqsssqsqqsqqqssqqqqssqsssqqqsqqsssqsqqsqqqsssssssqsssqqsssqqqqssssqssqsssqssssssqqssssqqsqsqssssqqssssssssqqssqqqsssqqsqqssssssqqssssssssssqssqqqsqsqqqsssqsssqqqssqqqqqqssqsqsqssqsssqsqsqqsqqssqsqqssqqqqsssqsqsssqsssssqssqsqsssssssssqqqsqqsssqqsqsqssssssqsqqsqsqqqqqqsssssssqsssqqqqsqssqqsssqsqqqqqsqqsqsqssqsssqsqsqssssssssqssssqsqqsqsqssssqssqqsqqqsqqsqqqqqssqqsqssqqqsssqssssssqqssqsqqqqqssqsqsssssqqsqqsqqssssqqsqsqssqsqqqsqsqqqsqqssssqsqssqsqsqqsssqsqqsqsqsssssssssqqqsssqsssqssqqqssssqssqsqssqqssqsqsqssqqsqqqsqsqqqqqqqsqssqqsqsqssqqqsqqqqsqsqsqqqssssssqsqsqssssqqsssqsqqsqqssqsssssqssqsqqsqqsqsqqqqssqsssssqqssqqqssqsssssssqqqsqsqsssqsqqsqqsssssqsqsqsqqsqsssssqssqssssssssqqqqsqqssqsqsssssqqqsqsqqqqqqsqqqqssqssqqsqqssqqssssqqsssqsqsssqssqqqqqqqqqqqssqqsqqsssqqsqsqsqsqqssqqssqqsqqqqsqqsssqsqqqsqqsssqqqqqssqqsqsqsqqqsqqssssqqqssqqqssqqqssqqqsqsqsqsssssqqssssqsqsssssqqsssssqssssqsqqsqqqsqsqssssssssqqsssqqsqqssqqqqqqqqqqssqqqqqqqsqqsqqqqqsssqqqsqqsqqqqqssqqsqqqqsssqsqqsqssqsqqqqqqqsqqssqssqssqqssqsssssqssssqqsqqqqqssqsqqsqqqssssqqsqqqqqssssssqqqsqqsqqqsqqqqqqsssqsqqqqqsqsssqqsssqsqsqsssqqqqqssqqqsqsqqqsqsssssqsqqsqssqqssqsqqqqqssqsqsqqqsssqsqqqqssssqqqssqqsqsqssqssqsqqssqqqsssqqqqqqssqsqssssqqsqqssqssqsssqssqsqqssqqqqssqqqsqsssqsqsssqssqsqqssqssssqqssqsqsqsqsqqqqsqqssqssssqqqsqqssssssqqqqsqsqsqssssqqssqqqqsqsqsqsqqqsqqsqssqqqssssqqsssssssqsqqqssqqqqqssssqssqsqqsssqqqsqqsqsssqssqqsqssqqqqsqssqqsssqqsssqsqssssssqsqsqqqsqssssqqsqqssqqqqsqqqsqqsqqsssqsqqsqqsssqqqqsqqssqsqsqssqqssqqqqqqsqssssqssqssqqsqqqsqqssssqqsqssqqsqsqssqqsqqqssqqsqsqssqqsqqqqsqsqsqsqsqssqqqqsqsssqssqsqsssqsqqqqsqsqssqqqssqqqsqsqssqqqqsqqqsqsssqqsqqssqsqssqssqssqqqsqqqssssssssqqqsqsqssssqssqsqqsqsqssssqssqssqqqqsssqqssqqqssqqsqqsqqsssqqsqqqsssssqqqqqssqqqqqsqssssssqsssssqssqqsssqqsssqqqqqssssqqsssssqqsqsqsqqqqqqqssssqqqssqssssqqqsssqqqssqqsqqqsqqsqqqqqsqsqqsqsqsssqqqqqsqqssqsqsqqqqqsqqqqssqqqqqsqsqssssssqqssqssqqsqqssqsqsqsqqsqqqqqsssssqsssssqsssssqqqqssssssqsqssqqqqqqsssqqqsssqqsqsqqsqqqqqqsqsqsqqqsqqqqssqqsqsqsqssssqqsqqqqssqqsqsqssqsssqssqsssssqsssqqsssqsssqsqqqssqqssssqqsqqqqqsqssqqqqsqsqqsssqsssqsssqqqsqqqssssqqqqsqsssqsssqqsssssqqsqqqqqqqqsssqssqqsqqqqqssqqqqsqqssqssqsqssqsqssqqssqsssqsqssqssqsqsssqsqqsqsqqqqsqqqqssqqsqsqqqqqsqsqqsqsqsqssqqqsqssqqqqqssssqqqqsqsqsqssqqqsqqqqqqqqqqqqsqsqsqssqqqsssqqqssqqqssqssqsqsssqqqssqqssssqqsssqqsqqsqqqqsqssqqssssqqsqsqqssqsssssqssssqqsqsqqssqsssssssssqqsssqqqqsqqqqsqqsssssssqqqqsqqssqqqsssqqsqqsqssqqqssqqqsqssqqqqqqssqqqqssssqssqqqqqsqsqqqqssqqsssqsssqqssssqsqqssqsqqqssqqqqsqsqsqsssqqssssqqqqssqsqqqqqqqqssqqqqssssqqssqqqsqsssqqsqsqsssqqqsqsqqsqssqsssqqsqqsqssqsqsqqqssssssqsqsssqqqqssqqqqsqsqqssssqsqqsqssqsqqqssqsqqqqqsqsqsqqssqqqqsqqqssqsqsssssqsqqqssqqqqsqsqqssqqsqqqssqssqqqsqsqqssqsssqqsqsqqssqssssqsqqqqsqqsssqqqqqqsssqssqqqsqsssssqqssssqqsqqssqqssqqqqqsqqqqqqssqqsqqqqqsqsqsqsqsqqsssssssqsqssqsssqqqqqssqsqqqsqssqssqqqsqsqqqqsssssqqsqsqsqqssqsqssqqssssssssqqqqqsqsqqqsqsqqqqqssqqssqqsqssqsqsssqqssqsqsqqsqsqqsqqqqsqqqssssqsqqsqqqsqqqqsqqssqsssqsqsqqsqsqqqsssqqqssssqqsssqqsqssssqqqsqsqqqsqqqqqqqsqqssssqqqqssqsssqqssqqqqssssqssssqqqqsqqqsssqqqssssssqsssqssqsqqqsqsssqsqssqssssqqsqqqsqqssqsqqqqsqqssqqssqqqqqsssqsssqqsqqsqqssssqsqssssqssqsssqqqqqqsqqsqssqsqqqqqsqsqqqsssqssqsqsqssssqsqqssqqqssqqssssssqsssqqsssqqqsqqsqsqsssqqsssqsqqqqqssqqssqqqqsssqqqqssssqqqssqqsssqsqqsqsqsqsqqssqsqsssqssqssqsqqssqqqsqssqsqqsssqsqqsqqqqssqqsqsqqqsqsqqsqsqsqqssqqqssqsqqsqsssssqqqqqsssssssssqqqqssqqqssqqsqsqsssqsqsqqssssqsqsqqqssqssqqsqqssqsssssssqsssqsssqsqssssqsqqsssqssqqqqqqssqqsqsssqssqqqqsqqsqsqqqsssssqqsqqssqqssqqssqsssqsssqqqqqssqssssssqsqqqqqsqqqsqqqsqsqsqqqqqsqsssqqssqqqqqssssqqsqqqqqsqqssqqqssqssssqsqssqsssqqqqqqqqsssqsqsqqqsqqsqqssqqsqsqqqssqsqssqqqqsssqqqsssqqssqsqssqqqqqsssqqsqsqsqsqqssqsqsqqsqsqsqqssssssqsqqqsqqqqqsssqssqsqqssqsqqqqsqqqqssqqsqsqqsssssqsqsqsqsqqsqssqsssqqsqqsssqsssqqsssqqssqsqqsqsssqssssqssqqqsqssqssqqqsqsqsqqsqqqsssqqqqssqqqqssqqqsqsqqsqsssssssqqqqsqsqqqssqqsssqqsqssqssqqqsqqqsqsssqqsssqsqqssqqqsqssqqqsqqssqsqqqsqssqsssqssqqsqqsssqqsqqqqsqssqssqsssssqssqqqqqqsqqssssssssqsssssqssssssssqsqqqqsqqsqsssqssssqsqsqqsqssqqssqqssqsqqqsqqsqqsqqssqssqqqssqsqqqqssqsqssqqssssqsssssssqsqsqqsqssssqsqqssssqssqsqqqqqssqqsqssqsqqsssqsqqsqqsqssqqsssqqqqssqqqqqssssssqqsssqqsqqsssqssqqsqqqsqqqqqssqqsqssssssqssqsssqqsqssqsqqssssssqssqqqsqqqqsqssqqqqqqsqsqqssqssqqssqqssqqqqqsssssqqsqqssqqsqssqsqsqqqsqssqsssqsqsqssssqssqqsssqsqssqsqqqqqqssssssqsqsqqqsqqsqqqssqsqsqssqqqsqqsssqsssssssssqqqssqsqqqqqqsqssqssqssqsqssqqqqqqssssqsqqqqssssqssssssqqqsqsqsqssqqsqsqqqqsqssqqqqqssssssssssqsqsqsssssssqssqqssqsqqsqqqqsssqqsqssssqsqqsqssqssqsssqqqssqqqsqssqqqqqsqsssqqqqsqqsqqqqsqqsssssqqqqqqqqsqqqsqsqqsssqqqqssssssqsqqqssssqsqqqssqqsssqqsqqsqqssqsssssssqqqssqssqsqqqsqssqqqsqqqqqssqssqqqqssqqqqqqsqqsssqqqssqsssssqsqsqsqssqsqssqqqqqqqqqqssqqqssqssqsqqsqqsqssqssqsssqsqsssqqqssqssqqqsqsqssqsqsqqqssqqsssqqsssssssqssqsqqsqsqsqqqqsqqssqqqssqsqqqsqqsqqqqqsqqqssqssqqqsqqqqsqqqsqsqssqqsqqssssssqssqsqsqqqsqssqqqqqqqqqsqsqqqqqsssssqssssqqqsqssqqqsqqqsqqssqsqqsqsssqsssqqsqssqqqsqsqqqqqsssqqqsqsqqqssqqqqssqssssqqqsqssqqsssqqqsssssqsqqqssssqsqssqqsssqssssqqqqsqsqqssqsqssssqsqqssqqsqsqqsqsqsqssqsqsqqssqsqsssssqqsqqqqsssssqqssqqqqqsqqqsqqqqqqqssqqqsqsqsqsqqsqsqsqqssqqqssqssqsqsqqqssqqsssqsqqsssqqqqqqqsqssqssqqqqqssqqssqsqssqsqssqqqsqsqqqqqsqqssssqqsqssqqqsqqqsqssqqssqsqsssqsqqqsqsssqqssssqqsqsqqsqsqqsqssqsqqssqqsqqssqqsqssqqssqqqssqsqsqssssqqsqsqsqsqqqqsssqqqqqssqqsqsqqqqssqqssssqsqqsqqsqqssqsqsqsqsssqqqqsqqssqsqqsqssqqsqsqsqsssssqqsqsqsqsqssqqsssqqqssssssqsssqqsqqsqqqsqssqqssqqsqqqqqqqssqsssqsqsssssqssssqqqssssqqssqqssqqqqsssqsqqsqsqsqqsssssqqqsqsqsqsqssqssqsqsqqsqqqqqsqqsqqqqsssqsqqqqssqqsssqsqsqssqqqsssqssssqqsqqssqqqssqqqqsqqqsqsqqqsqssqqssqsqssssqqssqsssqqsssqsssssqqqqqqqsqqqqssqsqqsqsqqsqsssqqsqsqqqqqqsqsssssqqssqqsqqsqqsqssqssqsqsssqqsssqsqqqssqqqqqsqssqssqqqsqqssqsqqqsqsssqsqqsqsqqssqssqqqsqqsqssqqsqqsqssqqssssqssqssssqqqqsqsqqqssssqqqsqsqssqssqsssqqsqsqsqsqssqqsssssqqqqqsssssqsqsqsqsssqqsssqqsssqsqsssqssssssqsqsqssssqqsqqqqsqqsqqsqssqqqsssqqsssssssqqsssqqsqsqqsqqsqsqqsqsqsssssqssssqqsqsqqqssssqqqsssssqssqqqqqssqsqsqsqsssqqqqqqssqqsqssssqqqqqsqqsqqsqqsssqsqqqsqqsqqsqsssqsqsqssqsqsqsqssssqsqqqsqqssqsqqssqsqssqqqqssqqqqqsqqsqqssssqqqssssqqqqsqsqssqqqqsqssssqqqsqssqqqqqqssqqsqsssssqsqqqqssssqqqsqssssqsssqssssqssssssqqqsqsssqssssqsqsqqqsqsqsqqsssssqsqsqqsqsqqsqsqssqsqsqqsqssqqsssqqsqqsssqqqsssqsqsqqqqqqqqqqqssssqqqsssqqsssqsqqsqqssqqsqsssssssqssqssqssssssssssqqssqqqssssqqsqssssssqqsssqqssqqsssqsqqssssqsssqsqsqsqssqqssqssssqsqqqqqqsqssqqqqqqqqssqqqqqqsqqqqsqsqqsssqqqqsqqqssqsqqqqsqqssssqqsqqqqsqqsqqsqssqsqqqqqqsssqqqsqssqssssssqsssqqsqsqsqqqqqqssqsqqsqqsqqsqssqsqsqqqqqssqsqsqqqsqssssqqssssqqqqsssssqqqssqqssssqqqsqsqsqqqsqssqssssqqqqsqsqqsssqssssqssqqqsqssqsqsqqsqqqsqsqsqssqqqqqqqssqssqsssqqsqsssqqqsqqqssssqqqssqqsssqqsqsqqqqsssqqssqqsqqqsssqqqqsqsqqsqqssqqsqsqssssqqsqqsssqsssqqqsqqsqqssqssssqsqqqssqsssqqqssqqqsqqqsqssssqqqqsssqqssqqqsqsssqsssqsqssqssssqqqssqqsssssqsqqqsssssqssssqqssqqqqsqsqssqqqqqsqqsqqssqssqssqqssqqsqqqssqqqsqqqsssssqqqqsqqssqqqqssqqsqqqqqsqqssqsqsqsssqsqsqsqqssqqssssqssqssqsqsqqqqsqqqsqssqqqqsqssqsqsssqssqsqsqssqssqqqqssqqssqqsqsssqssqqqsqqqsqssqssssqsqssqqssssqsqqqssqsqqsqssqqssqqqqssqqqsqqsqsqqssqqssssqqqssssqsqqsqqqqqqqqqssqqqqqsssqqqsqssssssqssqssqqsssssqsqqqsqqsssqssqsqsssqssssqssqsssqsqqqsssssssqqssssqsqqssqsssqsqqqqsqqsqsqssqsqqsqsqsssqsssqqsqqsqqsssqssqqqsqqssqqqqqqsssqsqsqqsqqqqssqsqqqqqqqsqqsqqssqqsqsssqsssssqqssssqqsqsqqqsssqqsssqqqqqsssssssqqssqsqsqsqssssssqsqqsqssqssqqssqqqsqsqqsqqsqssqqsqqsqsqqqqsqqqssqsqssssssqqqqsqsqqqqsqsqqqsqqssqssqqqsqssqssqqsssssqqqqsqsqssqsqsqqqqqqsssqsqsssqqsqssssqqssssqsqqssqsqsssssssssqqqqsssqqqqqqqqsqqssqsqqsqqqssqssssqssqsqsssssqqqsqqqqqsqsssqqqqsqsssqssqsqssqssssqsssqqssqqssqssqqssqsqsqsqqqssqqqsqsqsqqqsqqqsqsqsqsqsssqqqsqssssqqqqssqssssqsqsqqqqqqqsqqqsssqssqsqqssqqqqsqqsqsqqqssssssssssqqsqsqssssqsssqsqsssssqqsssssqqqsqqsqqqssssqqsqqqsqqssqsqssqqqqqqqqssqsqssssqssqsqsqqssqsqqssqqqqssssqsqqssqsqsssssssqqqsqqssqssssssqqqqqsqsqqqsssqssqqsqqsqqqsssqssqqqsqqqqsqssqqqsqqssqsqqqqqqqsqsqsqssssqqssqqqqsqqssssqqqqsqssqssssqsqqsssqqqsssqqsqqqsssqqqsqqsssssqssqqqssqqssqssqqsqsssqssqsqssqssqqssssqqqqsqqsqsqsqqsqqsqsqsqsqsssqssqqssssqsssqsqssqssssqssssqqqqsqqqsqqsqqqsssqssssqqqsqqssqqqqsqsqssssqqqqsqqsqqqsqqqqqqssqsqssssqqsqqqqsqqqsqsqqqqsqssssqqsssqsqqqqssqsqqqqqqsqqsqqssssqqsqsssqqssqqqsssqqsssqssqqssqssqqssqqsssqqqsssqqssssqqsssssqqsqssqssqqqqqsqssqsqqssqqqqqsqssqsqqssqssqsqqqqqqssssqssssssssqqqsqqqsqqqqqssqsqssqqqqsqssssqqssssqsqqqqqssqqqqqqqqqqqsssqqqqqsqqsqqqsqqssqqsssssqqsqssqssqqssqssqqssqssqqqsqsqsqqqsqqssqsqqsqsqqqqqqsqssqssqqqqssqsqsqqsqsssqsqqqqsssqqqqqqqqqsqsqqqqqqssssqsqsqqsqqsqsqsssqqssqqqqqqsssqssqsqqqqssqsssqqqsqsqqssqsqsqsqsssqsqqqqqsssqqqssqssqsqssqqqqsssssqqqsqqsqqqsqqqqsssqqsqqssssqqsqqqqqsqqsqssqqqqssssqsqqsqqqqqsqssssqsqsqqqqqqqssqqsssqqqsssqqsqqqqqqsqsssssqsqqqqqsssqsqqsqssqsssqqqsssqsqqqqsqsqssqsssssqsssssssssssqsssssqsssqqqssssqqsqsqqsssssssssssssqsqqssqqqsqqsqsqqsqqqssqsssqsssqsqqssqqsqqsqssssssqqqssssqqqsqqsssqsssqssqsqqssssqsssqqsqqqqsssssqsqqqqsqqssqsqqqssqqssqssqqqssqsqqqsqssqsqsqsqsqqsqqqqsqqsqqsqqqsqqsssqsssssqqsqssqsssqssssqsqsqqqssqssqqqqsssqqqsqqsssqqqqqqsqsqqsqsssssqqqssqqssqssssssssqqqqqsqssqssqsssssqqqqssqsssqqqqqsqsqsssqssqsqsssqssqqssqssqsssqqqsqssqssqssqsssqsssqsqsqqqqssqqqqsqsqsqsssqsqqqqqqqssqqsssssqsqsssssqqsqsqsssqqqsqsssqqqqqsssqqsqqsqsqssqqsqssqssqssqqsqsssssqsssqsqqqsssqsqsqssqqqqqqqqssqqqsqsqqssqqqqsqsqsqsqsqqqqqsqssqsqqssqqsqsqsqqqssssqssqqssqqsssqqsqqsqqsqssqqqqqsqqqsqqsssqssssqsqsqssqsssqqqsqqsssqqqqssqsqqqqqsqsqssqssqsssqqqqsqsqqssqqssssssqqsqqqqqsqqsqqssqsqsqsqsqqqssqsqsqsqqqsqqsqsqssssqqsssssqssqqssqsqssqqsqqqqqqqsqssqssqqqssssssqsqssqqsqqqsqqsqqssqqsqsqsssqsqsssqsssqsssqsqsqsqsqqqssqsqqssqssqqqssqqqsqqssqsssqqsqsssqssssqsssssqqqqsqqsssqqqsqqsqsqqqsqsqqsqsssqqqqssqqsssqssqqssqqsssssqssssqqsqqsqqsssqqssqqqqsqqqssqssssqsssssqssssqsqsqqqssqqqsqsssqqqsssqsssssqqsqssqqsqqqssqssqqqqqqssqsqqqssssqqsqqsssqqqsqqqqsqssqssssqssssqqqqqqqsqsqsqqqsqsqsqqsqsqsqqqqssqsqssssqqsssqqssqsqqsqqsqqqssqsqssqqsqssqqqsqqqsssqsqssqsqqsqssqssqssqsqqsssssqsqssqsqqsssqqsqqssqqsqqsqsqsqssqqsssqqqqqssqsqqqsqsssqqsssqqqqssqqsqsssssqsqsqsqsqqsssssqsqsqsssssssssqqsqqsqssqqqsqsqsqqqqqqssqqsssqqqsssqqqqsqqqssqqqssqqsqqsssssssssqsqqssqqqqqqssssqsssqssssqssssqsqsqqqqsqqqssqqsssqqssqqsqssqsqssqqsqqqssqqqqqssqssssqssqqqqsqsqsqsssqssqssqsqsqqqsqqqqsqqsqqqqssqqsqqqsqsqsqsqqqsqsqsqssssqqqsqsqsqqqqssssssssssssqssqsqssssqqqsqsqssssssqqqqsqsqssqsssqqsssqsssqssssssssssqsqqsqqsqqqssssqsqqsqssqqsssqsqsssqssqqqsqqsqsqsqqqsqssqsqsqqssqqqqssqsssqqsqqqsqqsqqqqssqsqsssqqqssqqqqsqqqsqqqsssqssssqssqqqqqsqsssqqssqsqsqsqqssqssqssqssqqqsssqqsqsqqqssqssqqsqsqqsqqqsssqqsqsssqqqssqqqssqqsqqssqsqssqqsqsssssqqsqqsqsqsqsqsqqqqqssssqssqssssqssssqssssqsqqsssqqssqssqqqqssqsqqqsssqsqsssqqqsqqqssqqqsqqqsssqqsqqqqsqqssqqqqsqsssqsqqsqsqsssssqsqsqqsqqqqsssqqsqsssssqsqsqsqqsssssssssqqqqqqsqsqsqssqsqqssqqsqssqsssqsqssqsqqssqssqssqqsssqqsssqqsqssqqqsqqssssqssqqsssssqsqsqsqssssssqqqqqssssqsssqsqqssqqqsqsqsqssqssssqssqsssqsqqqsqqqsqqsqqqsqqqqqqqssqqssssqsqqsqsqsqsqqssqsqsqssssqsqqqqqssqsqsqsssqqqsqqssqsqqqqqqsssqsqqqssssssqqssssqsqsqqsqsqsqqsqqsqqqssqsqqqqsqssqsssqqsssqqsqsqsqqsssqqsqqsssssqqsqsqsqqsssssqsqqqqsqqsqsssqqqssqssqqqsssqsqqqqqsqsssqsssssqqssqssqqsqsqsqqsqsssqqqqqqqqssqsqssqqqsqssqqsqsssqqqqqsqsqsssqqqqqsssssssqqqsqqqssqqssqqsssssssqqqssqqqssqqssssqsqqsqssqsqqqsqqsqqqsqsqqssqsssqqssqssqsqssssssssqsqqqsqssssqqqsssqqsqsqssqqssssqqsqqqqssssqqssqssssssssqqqsqqqssssssqssqssqqqsqqssqsqqsqsqsqqssssssqssqqqsqsqqssssssssqsqqsqqssqqsqqsqssqssssqqsqsqsssqssqqssqqssqqssqsqqsqssqsqqsqsqqqqssqssqssssqsqqqqqsssssqqqqqqsqqssqsqqsqqqsssqssqqqqsqssqsqqqqsqsssssqqsqqqqqssqqqqqsqsqssqqqsqqqsqssqqqsqqsqqqsqqqqsssssqsqssqqqqqqqsqsqssqsqsssqqqsqssqssqsssqqsqqqqqqqsqqqsssssqqqqqqssqqqqqssqqqqsqsssqsqsqsssqsqssqsqsqqqssssqqqqssqssqssqsqsqsssqqqqssqsqssssqsqssqsssqqqsqsqsqsssqqqqsssqssqsqssssssqsqsssssqqqqsqqqsssqqsssqsqqsssqsqsssqssqsqsssqqssqssqqqqqqqqqsqqqqqqssssqqqqsqqqqqsqsqqssssssqqsqqsqsssqsqqqqqqqqqqqssqsqssqsqqsqssssqsqqqsssqqqsqsssqqqsqssqsqqqsqqqqssssssqsqsqqqsqqqsqsqssqqsssqqsqssqqssqqqssqsqssssqssssqqsqsqssqssssqqqssqqqssqsqqqqqsqsqqsqsssqqssqqqqqqssqssqsqsqsssqqsqqssssqqqqssqqqssqsqssqqqqssqssssqqqqsqqsqqqsssqqssqssqsssqqsqqqqqssqqqssqsqsqqqqssssssqssqsqqqsqsqqqqssssssqsqsqqssqqqsssqsssqssqsqqqsqqsqsqqsqssssqqqqqqqqsqsqqqqqqssqssqsqqsqssqqqqsqqqqqsqqsqqsqsssqqqqqsqssqqsqsqsqssqsssqqsqsqqqsssqsqsqsssqsqsqsqsqqqssqssssssssssssqsqqsssqsqsqssqqqqqqqsssqqqssssqqqssqqqqssqqsqssqsssssqsqsssqsssqqqsqqqsqqssqqssqqssqssqqqqqqsqssssssqqqqsqqsqssqsqqqssssssqsqqqqsqqqsqqqqsqsqqqssssssqqqsqqsqqqssqsssqsssqsqqqqssssssqssqqssqqqqqqqqqsqsqssqsssssqqsqqsqqqsqsqssqqssssssqssqqqqqsqsqqssqqqqssssqqqsqssqssqqsqqsqqsqqqssqsqqqqqssqsqsqsssqqqsssqssqsqqqsqssqssqssqqsssqqsqqsqssssqqsqqsqqqssssssqqsssqsssssqsqsqssssqqsqssssqqsqqqqqsssssssqssssqsqqsqqqqsqssqqsqqqqsssqqsssqssssqqqqqqssqqqqqsqssqqqsqqqqssqqsqqsssqsqsqssqsqssssqsqsqqqqssqssssssssssqqqqsqsqsqsqsqsqsqsqqsqsssqqsssssqssssqsssssqsqssqssqssqqqqsqqqssqsqsqqqsssqsssssssqsqssqsqsqsqsqqssqqqssqssqqqqqqqsqssqqssqssssqsqqqssqsssqssssqqsqqsqsqqssqqsqqqssqqqssqsqqssqssqssqqsqqqsqssssssssssqssqqsqsssssqsqssqqsqsqqqsqsqsqqqqsqqqqsqsqsqsqssqqsqqsqsqqssqsqsqsqqqqssqsqsqsssqqqsssqsssqsqqqsssqssqqqqsssqsqqsqqqqssssqqqqsqsqsqqqssqqqsssqqqsqqqsqssqqsqssqqqqssqqssqsqqqsqqsqssqsqsqsqqsqsqssqqsqsqqsqqqsqsqssqsssqqsqssssqssqssqqqqqqssqqsqsqqssqsqsssqssqsssqssssqqqqsqsqssssqssssqsqqqqqqqssqqqsqsqqsqqssqssqqqsqqsssqqqqsqqqsqqsqqsqsqssqqqqqsqqsqqsssqsqsqsqsssqqqqssqqsqsssqsqqqssqqqqqsqqqssqsqssqsqsqqssqqqsqqqqqqsqsqqsssqsqsqqsqqqssqsqsqqsqsqssssssqqqqsssssqssssqssssqsssqqqqsqqssssqqsqqsqsqssssqssqqsqssqsqsssqqqqssqssqssqqqqqsqqsssqqqsssssqqqsssqqsqqssqsssssqsqsqqqqqqsqqqssqssqqqssqqsqqssqsssqqqsqqqqssqqqqsqsqqsqqqssqqqqqsqssqqssqsssqqqqsqsqsqsqsssqqsqqqssqsqqsssssqssqsssqqsssqsssssssssqqqssssqqqsqqqqqqqqqssqsqqqqsqqqsssssqssssqsqsqsqqssqqsqqqqqqsqqssqsqqqsqqsqsqqsssqssssssqqqsqsqqsqqqsqqsqqqssssqssssssqsqqqssssqqsqqssqsssqqqsqqsqqsqqssqqqqqsssqqssssqsqqqsqqssqsqssqsqssqqsqsqsqqsqsqsssqsqsssqqssqssqqsqqsqsqqssqsqqsqssqqqsssssqsqsqssqsqqsqqsssqqqqqqqsqqsqsssqsqsqqssssqqqsssssqqqqqqqsqsqsqqqssqqqqsqqqsqqqsqssqqsqqsqsqsqqqsqssssssssssssqssqssssssqsqqqsqqsqsqqqsqsqqqsqssqsqssqsqsqqqqqssqsqsqqsqqsqqsqqsssssqqqsqqqssssqqsqsssqsqqsssqqssqqssqssqqqsqssqqsssssqqqqsqsqsssqsssssqsqqqsqqqsqqsqsqsqsqqsqsqqqqsqsqqqqssqsqqqqqssqsqsqssssssqsssqsqqssssqqsssssqsqssqssqsqqqssqsqsqsqqsqqsssqqssqsqqsqqsqsqssqqqqsssssqqqqssqqsqsqssqsqqqqsssqsqsssqqqqqqsqsssqsqqqsqqqqqsqsqqqqqssssqsqsqqsqqqssssqqssqsqssqssqqssssqqsqqqsqsssssqsqssssssssqqsqqsqqqqqssqssqqsssssqqsqqqsqqssqsqqssqsqqqqssqqsqsqqsssqqqssqqqqqssqqssqqqqqsqssqqqqqqsqqqsqsqsqsqqssqssqsqqsssssssqqssqsqssqsssqqssqssqqsqssqssssqqqqsssssssqqsqssssqssqssqsqqsssqqssssssssqqssqqssqqsqsssqsqqqqqsqqqqqqqssqsqqqsssqqsqqsqssqssqssqsqqsqsqsqssqqqsssqssqssqqsqqqqsqqssssssqqsqssssssqqqqssqqsqsqsssqqqqqqqqqssssqssssqqssqsqqssqsssqsqssqsqqqqssssqqqqsqqssssssssssqqsqqqssqsqqqsqqqssssqsqssssqssqqsqsssssqssqqqqsqqssqqssqqqqqssqsqsqqssqssqqsqsqsqqqqsqsssqqsqqsqsqssqsssqssqqqqsqsqqssqsqsssqqqssqqssqsqsqsqsqsqqssqqqsqsqqqqqsqqqqqsqqsqsqssssqqqqsqqqqsqqsssqqsqssqqqssqqssssqsqssqssssssssssqqqssqsqqssqsqsqsqqsqsqqqsqsqqqqqsqsqqssqqssssqqssqsssssqsssssssqqqqqsqsqsqqssqssqqqssqqqsqqqsqsssqqsssqsssssssqqqqsqqsqqsqqsqsqqqsqqssssqqqssqqqqqsqqqsqsqssqqssqsqqsqssqsqsqqssqqsqssqsqqqsqssqsqqssqqsqqsqqsqsqsssqsssqqqqsqqqqssqqqqsqsqsqqsssqsssqqssssqsqqqssqqssqqqqsqqsqqqsqqqqsqqqssqsqqqqqsqsssqqqsqqqqsqqssqqqqssssqqqsssssqsqqssssqqqqqqsqssssqqssqssqqsqssqsqqqqqqsqqssqsssqqqqqqsqqssqssssqssssqqqqqqsqssqssqsqqsqssssssqssqqsssqqqqqqqqsqqqqqqqqqqqssssqqqssqqssqqqsssssqsqqqqqssqsqqssqqqqqsqqqqqsssssssqqssqqssqqsssssqsqsqqssssqsqqqsssqqssqssqssqqssqssssssqssssqsqsssqssqqsqqqssqsqssqqqsqsqsqqqssqqqqqqqqsqssssqqsqqqssqsqssqsqqqqqsqqqssqssqqsqsqsqssqsqsssqsssqqssqqssqqqsqqqqqqqssqqsssqsqsqqsqsqsqqqsqqqsssqqqqqsqsqqqqsqqqsqqsqsqqsqssqqqsqssqqssqqsqqsssqsqsqqqsssqssssqsqsqsssqqqqqsqqqsssqqqsqsqqqqqqssssqqqsqsqqssqssqssqqsssssqqsqsqqsqqqssssqsssqqsssssqqqqqqqqssqsqsqqqqsqqqsqsqqqqqssqqqqqssssssqsqsqqqqqsqsssqqsqssqqqqqsssssssqqqqsqqqssqqsqqqssqssqssqqssssqqqqsqqsqqsqsqqsqqqqsssqqsqqqqqqqssssssqqsqsqqqqqsqqssqsssssqqqqsqsqssqsqssssqqssqqssqssqsqqsssqqsqsqsqqqqsqqqsssssssqqsqssssqqsqqqqqqqqqsqqqqssqqsssqssssqqsqssssqsqqqqsssssqsqsqqqqsqsqsqqqsqqsqsqsqqqsqsqqqsssqsqssssqsqqqssqsqsssqsqqqqqqsssqqqsqqqssqqqqsqqqsqsqqsssqqsssqssqsqsqqssqqqqqssqssqsssqsqsqsqssssqsqqsqssssqqsqsssqqqqsqqqqssqqqqssssqqsqqqssqsqqqqssqqqqqsqssqqsqsqqsssqssqqsqqqssqqsqqqssqqsssqqqssqqssqqqssqsqqssqqqsqqssssqqqsssqqqssqqssqsssssqqqqssqsqsqqqqqssqqsssqqssqqssqsqqsqssssqssssqqssssqqqqqqqqqqqsssqsssssssqssqqssqqsqqqqqssqsqqqqqssssqqsssssqsssqsqsqqssssqssqqssqqsqqsssqsqsqsqssqssqqqqsqqqsssssqqsssqsqqqssqqqsqqsqssssqsqssqsqsqsqqqssqqqqqqqqssqsqqqsqssssqqsqssqsqsqsqsqsssssssqqqsqsssqqssqqqqssqssqqsqqssssqqqqqsssssqqqsssqssqqsqqsqqsqsqssssqqsqssqsqqqsssqqqqqqsqsqqsqssqqsqqqsqqqsqssqssqssqsqssssssqssssqssqsqqssqqsqssssqqqssqqqqqsqsqqsqqsqsqqqssqqqqssqsssqsqssqqqssqsssssqsqqqqqssqsssssqqqsqsqqqqqsqqqsssssqqqssqsqsqsqqssqqsqsqqqqqqqqqqqssqqqqsqqqqqsqqsqqsssqqsqqqqqqsqssssqsqqsqsqssqqsqsqsqqqssqsqqqqqqqqqsssqqssqssqqqqqqqqsssqqqsssqqsqqqqsqsqsqsqqssqqqqsqsssqqssqsqsqqqssssssqsssqqqsssqsqsqqsqqsqsqqsqsqqqsqssqssssqqsqqqssqqssqssqssssqssqqssqqqqssqssssqqqqssqssqsssssqqsqqsqssqqqsqssssqssqqssqsqsqsqqqssssqssqsqqqqqssqqsqqqsqssssqqqqqssqqqqqsssssqqsqsqqsqssssssssssqqqqsqsqqqqssqsqqqsqqsqssqsqqsqqqqqsqqqsqqqsqsqssqssqsssssssssqqqqqqqsssssqqsssqqqqqqqqqqqqqssqqqsqqqsqsqsqqqssqsqsqqssqssqsqqqqqsqssssqqsqqsqqsqsqqqssqsqqssssqqsqqqsqqqqssqqssqsssssssqssssqssqqqsssqsqqqsssssqqsqssssqqssqsqssqqqsqsqqssqqsqqsssssssqsqqsqqssssssqsqqsqqsqsqqqsqqqqsqqsqqqssqsqqqqsssssqqsqqqqqqqqqsqqsqssqqqssssqsqsssqssqqqqqsqsqsssssqssqssqqssqqsqsqqsqqqqqsqsssssqssqsqqssqqssqqqqqsqqqsqssqssqssqsssssssqsqqqsqsssqqqqqssqsqqsqqqqssssqssqqsqssqsqqqqqsqqqsssqqqqqqqsssqsqsssqqqssssqsqssqsqqssqqssqqsqqqssqsqqssqqsqssqsqqssssqsqsqsssqsssqsqssssqqssqqqqqsqssqqsssqqsqqsqqqsssqqsqsqsqqssqssqqqqsssssqsqssqsssqssqsqsqqqqsqsqqssqqsssqqqssssqsqqqsssqqsqqqqqqqsqqssqsqssssqqqssqsssqqssssqssssqssssqqqqqssqqsssqssqsqqqssqqqssssqqssqsqqqsssqsqqsssssssqssqsqqsqqqqqqsssqqqsqqsssssssqssqqssqsqssqsqssqsqsssssssssqqsqqsqqssqssqsqqsssssqqqqsqqqqsqssqqqsssssqqsssssqsqsqsqqssqsqssssqqsqqsssssqqqssssssssqqqsqsqqqsqqsqqqsqsqssqqqqqsqsqsqsqqqqqqqsssssssssqssqsqsqssssqqqssssqqsssqqqssssqqsqqqssqqqsssssqqsqqqqqqssssssssssssqqqqsqqqssqqqqqsqqqqqqsqssqssssqssqqqqssqsqqsqqsqssqsqqqssqssssqsqqsqqsqssqssqsqsqssqqqsssqsqssssqsqqqqssqsssqqssqqsqqqsssssqsqsqqssqqqsqqqsqqsssssqsssssssqqsqqqqqqqqsqssssqqqqqssssssqqqqssqssqqsssqqsqqsssqqqqqqqsqqqsqsqsqqsqssqssqssqqsqqsqssssqssqqqqsqsqsqqqssssqqsqsqsqsqsqqqssqssssqqssssqsqsqqssqssqqssqsssqqqssqqqqqsqqqqqsqqqssqsssqqsqqqqsssqsssssqsqsqssssqqsqsqsssqsqqqqqssqssqqqqssqqssssqqqqqssqsqssssqsqqqsssqqqqsssqqsssqqsqqsqqqqsssqssqqqqqqqssqssssqsqsqqqsssqsqssqqqqqqsqqssqsqssqqqqqqsqqqqsqssqqsqssqsqqsqsqqqqqssqqsqssqsssssssqssssqqssqssqsqqqqqssssssqsqqqssqsqsqqqqqqqsqsqqsssssssqsqssqsqqsssqqqsqqssqqqqqqsssqssqsqssqqssqssqqssqssqsqqqqqssqqqssqssqssqsqsqqqsssqqssqqqqqssqssqqqssqsssqssqsssqqqssqqqqqqssssssqqqsqqssqssqqssqssqsqsqqsqssqssqssqqssssqqssqqssssqsqsqsssssqqssqsqssssqssqsqsqsqsqsssqqqqssssssqqsqqqqqssqqqsssqqqssqqssqqqsqqssqsssqssqsqssqsqqqqsqqsqsqqqssqssqsssqqsssssssqqssssqssqqsssqsqsssqqqsssqssqsqqqsqqqqssssqqqqqsqssqssssqqqqqssssqsqqsssqssqqssssssssqqsqqqsqssqsssqsqqsqssssqsqqsssqsssqsqqsssqqsssqsqssqqsqqqsssssqsssqqssssqssqsqqqqsssqsqsqsqssqssqqqqsqqsqqqqsssqsssqqqssqqsqsqqqqssqqssqsssqsqsssqqqsqsssqqqsqqqqqqqqqsqsqqssqsqqqqsssqqsqsqqqqsssqqqqqqsqsssqqqqqsqqqsqqqssqqqsssssssqqqqqqsqqsqsqssqsssssssqqsqssqqqqqqsqsqqqsssqqssqqqqsqqqsqsqqssqsqsqssssqssqsqqqsqsqqqqqsqsssqqssqqqqqqqqqsqsqqsssqqqqssssqssqqsqqqqsssssqqqssqqqsssssqsqqqsqssssssqqqsqqsqssssqqsqqqqqsqqqssqqsssqssssqsssssqsqsqqsqsqsssssqqssqsssqssqqssssqsqqqqqsqssqqsqssssqsqqsssqsqsqsqsqqsqqsqqqssqsssssqsssssqqqsqqsssqsqqsssssqqsqssqsssqsqsqssqqsqsqqqqsqqqsssqsqqqsqsssqsqqqssqssssqsssqqsqqqqqsqqsqqsssssssqsssqsqsqssssqsqssqsssqqsqqqqqsqqqsqssssssqsqsqssqqssqsssqqsqsqqqsqqsssqqqqsqqsqqqsqsqssqqqqssssssqqqssssqsqssqqsqsqqsqqqqssqssqsqqsssqsssqqsssssqqsqsqsqqsqqqqqqqsssqsqqqsssqqqqssqqsqqsqsqssqssqsqqqsqsqqqqsqqqssqqsqqsqssqsqssqssqssqqsssqsssqqqsqqqqqqssqsssqsqqqqssssqssqssssqsssqsssqssssqsqqssqqsqsssqqsqssqsqsqqqssqsqqqqqsqssqssqsqqsqsqqsqqsqqqssqsqsssqssqqssqqsssqqsqssqqqssqssqsssqsssqssqsqssssqqqqqqssssqqsqqsqqqsqqqsqqqsqsssqqssssqqqsqqssqsqqsqsqsqsssqqqsqqqqqssqssqsssqqssqssqqqqqsqssqsqqqsssqsssqsqsqqsssssqssqsssqsqqqsqqqqqsqssssqsqqssqsssqqsqssssqqsqsqsqsqsqqqqssqqqqsqqsqqqsqqsqqssqsssqqssqsqssqqssqqqqqqsqsqqssssqqssqsqqsqqqqssqqqsqsqqqsssssqqssqsqssqsssqqssqqqssssqsqsqqsqsssssqsqsqqsqqqsqqqsqsqqssssqqqsqssssqsqqssqqqqqqsssqsssqsqsqsqsqsqqssqsssssqqqsqsqsssqqsqsqsssqqqsqsqqssqqqqssqssqqssqsqsqqssqqqqsqsqqsssssqsqssqqqsssqqsqssqqqqqqssssqssssssqssqqsqsqsssqqqqqqssqssqsqqqqqqsssqqqqqqsqqsqqqsqsqssqssqsqqqssssqqqssqsqqqqqssqqqsqqqqqsqsqqsqsqqsqqsqqsssqsssqsqqsqqqqsqqsqqqsssqsssqsqqsqqssssqqqssqqqsqsqqqssssqqssssqsqqqqsssqsqssqqssqqsqqqsqsqsqqssqqqqqsqqsqsssqqsqsqqqqqqsqqsqsqsqssqqqqsqsqqqqsqqqqqsqqqqqqsqssqsqqqsqsqqqsssqsqqqsqqqsssqqssqqsqqsqssqqqqqsqqqssqsqsqsqsqssqqssqsssqqqsqsssqssqqqsqqqsqqqsqsqqqssqqqqsqsqssqssqsqqsqqsssqsssqsssqqsqssqsqqqsqqssqqsqqsqqqqqqqqsssqqssssqssqqsqqqqssqssssqqsqqqqssssssssssqqqsqsqqsqqssqqqssqqsqsqsqsqsssqsqqqsqqqsqssssssqssqqsssqsqqsqqssqqqsqssqsqsqqqqqssssqsqsssssqqssqqqqqsqssssqsqsssqsqqsssqsqssqqqqsssqssqsqssssssqsssqqqqqsqqqssqqsssqqqsqqsqqqqsssqqqssqqssssssssssqssqssqsqqqqqqqqsqqqqsqsqsqqssqsqqsqqqqqsqsqqssssssqssqssssqsqqsqssqssqqqsssssqqqssssqqqsqsqqssssqsqsssqssqsqssqssqsssqqqsqqqssssqqsqqqqqssqqsssqsssssqsssqqqqssqqqsqssqqssssssssssqsqqqssqqqsqqsqssssqqqsqssqqsqsqqqqqqqssqqssqsqqqqqqqqssqsqqsssqqsqqsqssqqqqsqsqqqqsqqssqsqssqsqqqsssqqqsqqsqsqssssqsqsqqqsssqqsqssssqqssqssqqsqqqqqsqqqssssssqsqqssqsqsssqqssqqqqqsqqqqsqqqsqqqqsssqqsqqsqsssqqssqssssqqssqqsqsqqsssqsqqqssssqsssqsssqqsqssqqqsssqsqqqqssqqqsqqssqqqqqqssqqqsqqssssqssssssqqsqsqssqsssqqqqqsqqqqsqssqsssqqqqqssqsssssqqssqsssqqsssqssqsqssqqsqqsssqqqssqssqqssqsqqqsqqsssqqqqsqqsqqqsqssssssqsqqqsqqqqsqqsqssqqssqssqqsssqqsssqssqqqsqqsqsqqsssqqssqsqqsssqqqqqsqqqsqssssqqqsqssqssqssqsqsqqsqqsqssqqqqqqssssssqqsqssssssqqsqssqssqqsqssqqsssqqssqqqqqsqqqqqssqsssqssqsqsssqqqsssssqqqsssqqqqssqsqssssssqqqssqssqqqssqqqssqqqqqqqqssqqsqssqsqqssssqsssqsqsqqsqqsqsqqqsssqqsqsqssqssqssqqsqsqqqsqsqsqsqqqsqqqssqqsqssqqssssssqsqsqqsssqsqqsqqsqqsqsssqssqqsqsssqqqsqqssqssssssssqssqqssqsqqsssqsqsqsqqqsqssssssqsqqqsqqqsqqsqqqsqqssssqsqqqqsqqqsqqssqsqssqqqsqsssqqsqsssqqsssqsqsqqqsqsssqqsssqsqqqsssqsqqssqqqsqqqqqsqqqsqqqsqqqqsqsssssssqssqsqqsssqsqsqsssssqqqqqqqssssssssqqsqsqqsqssssssqqqqqqssqsssqsssqsqsqsqsqqqqqssqqqsqssqssssqqqsssqqsqqsqqsqqqsqqsssqqqqqqssqqqqssssssqqssqsqqsssqssqqqsqsqsssqsqqsssssqssssssqsqsssqqssqssqsssqsqqqssqsqsqssqssqqssqsssssqqsssqqqqssqqsqqsqqqqssssssqqssqqqqsqsssqssqsqqqqqsqssqqssqssqqsssqssssssqqssssqsssqqqqsssssssssssqsqssqsqqqsssqsqqqsqsssqsqqqqssqqssqsssqqsqqqqqqqsqqsqqqqqssssqqqsqqssqqsqqssqssqqqsqsssqqqsqsqqqqsqqqsssssssqsqqssssqqqqssssqssqqqqsqsqqqqqqqqssqsqsssqssqsqqqsqqqqqqsqqsqqssqqqqssqqsssqssqqqssqsssssqqsssqssqqqqqssqqqsqqqssqsqqqssqssqsqsqqqqqqqsqssssqsqssqqqqqsqqqqssqqsqqsqsqqqsqsqsqqqsssqsqsssssssssssqqsqsqsqsqsqsssqqsqssssqqqqqqqqqssqqqsqqqsqssssqsqssqqqqqqqsqqsqqqssqqqqsqsqssqsqsssssqsqsqqssqssqqqqqsssssssqqqssqqsqqqqqqsssssqqqsqsssqssqsqqqqqssqssqqqqsqsssqqqqqqqqqsssqsqssqssqssqssqssqssqqqqsqssqssssqssssqsqsqsssqssqqsqsqqsssqssqqqsqsqqsqsssqsqqsqqqsqqsqssqqsqssssqqsqssssssqssqsqssqssqqqsqsssqssqqssqqsqqsqssssqssqqsqqsssqqqssqsqqqqsssqqssssqssqqqqqssqqssqqssqqqssssqqqqsqsqqqqssqqqqqqsqsssssqsqqqqssqqsqqsqqqsqsssssqssqqqsqsqsqssssssqssqqssqqqsqsqqsqqqssqqqqssqssssqqqqsqsssqqsqqqqqssqsssqsqqsssssqsssqqqssssqqssqssssqqqqssqqssqqqqsqssqqsssssqqqssssqqqqqqqsqqsqsssqsqqqqsqsqqsqsqqsqsqsqsqqssssqqssqssqqqqsqsqqqqqsssqsqqqqqqsqqsssqqsssqqsssqsqsqsssqsssqsssssqsqqqsssqsssqqsqsqsqqqssssqsssqssqsssqqqqqsqqsqqqqsssqqssqqsssqsssqsssqssqsqssqsqsqqssssqssqsssssssqsssssssqsssssqqsqqqsqqsqssqsqqsssqsqsssssssqssqsqsqsssssqqqsqqsssqsqqsqssssssqssssqqsqqqsssssqsqqqqqqqsqsqqsqqssqsqqssqqqqqsqqsqsssssqsssqqqqqssqqqqqqssssqssqqsssqsqssqsqssqqqqqsqsqqqqqsqqqqsqqssssqqssqqqqqqsqsqsqssssssssqqqqssssqsqqqssqqssqsqqqsqqqsqqqqssssqsssqsqqsqsqssssqsqssssssssssqqssqssqqqqssqqsqsssqqqqqsqsssssqqsqssssqqqqqssqssqqsqqssssqsqssssssqssssqssqqsqqqqsqqqsssqqssqsssqqssqsqqsssqqqsqqssssqqssqssqqqsqssssqqqsssqsqsssqqsssqqssqqsssqsqssqqsqsssqsqsqsqqqqsqsssqqqqsqqqsqssssssqqqqsqqqssqqsqssqqssqqqsssqqsssqqqqqssssqsqqsssssqsssqsqqqsqqsssqqqqqsssqqsqqsqssqssqqqqssqsqssqqqssssqqssssssssqqqssqsssssqssqsqsssqsqsssssssqssqssqqqsssssssqsqsqsssqsqssqqssssqsqsqqqqssqssqqqqssssqqsqsqsqqqqsqqqsqssssqqsssqssssssqsssqqssqqssqqsssqqsqsqssssqsssqqqqsssqqsqssssqsqqqqsqqqqsqsssqqssqsqsssqsqqsqsqssqsqsqqqqqqsqsqsssqssssqsqqqssqsssqqsqqqsqsqsqsqqqqqqsssqsqsqqqqsssqqqsssssqqsqsqsqqqssqssqssssqqqsqsqssqssqssssqqqsssssqssqqqsqqssssqsqsqqqsqqqqqqqsqqqsqqqssqqssssqqqssssqssqqqqsqssssqsqqsssqqqsqqsqqsssqsssqqsqsqqqqsqqsqssqqqqsqssqqqsqsqqsqsqsqqqsqsssssqqsqsssssqsssqqqqsqqssssssqssqqssqssqqssssqqqssqsssqssqssqqqssssqsssssqsqqqsqsqqsssqqsqssqqsqsqsssqqsqqsqqsssqsssssssssqqqqsqqssqsqsqsqsqqqsqssqqqqsssqqqssqsqqqsssssssssqssqssqqsqsqsssssqqqqqqqqqqssqqsqqssqsqsqsssqqqqsssqsssqsqqqssqqsqqssssqssssqqqqsqqssqqsssqqsqqsqqsssqqssssqqqsssqqsqsqssqsqqqqqssqqqssssqsqssssssqqsqssqsssssqsqssqqqqssqsssqsssqqsssqqqqqssqqqqqqqssqqsqqqqqqqsqqsqqsqqqsqqqqssqsqqsssqsqqsqqqqsssqsqqsqqsqsqqqqqqqsqsssqssqssqsssqsqqsqqssssqqsqsssqsqqqqqsqqsssssqqqqqqqqssssssqqsssssqsqsqqqqsqsssqqssqqssqssssqqsssqsqsqssqqqqqqsqqqqqsqqssssqsssqssqsqssssssqssqqssqsssqqqsqqsqqssqqqqsssqqsssqqsqqqsssssqqqqqsqqssssqqqqsqssqsqssqqqqssqsssssssssqssqsqqqsqqqqsqqqqsqqssqsqqsssssqqqqqssssqqqqssqsssqsqssqqqqssqssssssqqqsqqssqssqqqqqqqsqsqssqssqsqssqqsssssqsqqqsqqsqssssqsqssqqqssssssqsqqssssqqqssssqqssssqqssssqqssqsqssqqqqqqsqqsqsqqsqqsqqsqsqsssqssqssssssqsssqqssqqsssqqqsqssqqqsqqqqqsqsqqqsqssqqsqsqsssqqqsqqsqssqssssqqssqqqssqsqsssssssssssssqqqsqqsssqqqsqsqqqsssqssqsqqqqsqsqsqsqqssqsqssqssqqsqqqsqssqqqssqsssqssqsqsqsqsqqqsqqqqssqqsssssqsqqqssqqqqqqqqsssqsqssqqqsqsssssqssssqqqqqqqsssqssqsqqqsqsqssssqsqqsqqsssqqsssqqsqsssqqqsqsqqssqsqssqssqqsqsqqqqsssqqsqqssqqqqqssqqqsqqqqsssssqqssssqssqqsssqqqssqqqqqssqqqqsssqqqsqqsqsqqqqqsqssqssqssssssqqqsqssssqqqsqqqqqqssqsqqsqqsqsqqsqsqqqqqqqqqsqqssqssqqsqqqqqsqqssqsqsssssssqsqqsqsqsqsqsssqqqsssqsssqqqqsqsqssqssqsssqsqqsssqqqqqssssssqsqsssqqqqssssqqssssqqsqqqqsqqqsqqsqssqqqqqqqqqsqqssqqssqqsssqqsqqsqssqqsqsqqqsssssssqsssqqqssssqsssssssqqqqqqqqqssssssssqqqqsqssqqqssqsqqssssqssqsqsqsssqqqqssqsqqssqsqsssssqqqsqssssssqqsqqqqssssqsqqssqqqqsqsqqqqqqssqsqqsqqqqsqssqqsssqssqqqqsqssqssssqsssqsqqqqqqsqqqqqqqssqsqssqqsssqqqqssssssqqqqqqsqssqqssqssqqqssqqsqssqsqsssqqsqsqqqsqssqsqqsqqsqsssqssssqqqssqqsqsqqsssqsssqqqsssqsqsssqsqqssqqsqqsqqssqsqsqsqsqqssqqssqsssqssssqqsqsssqsssssssssqqssqqqqqssssqsqssqqqssssqsqsqqssqsqssqqqqsssssqqsqssqsssqssqqqqsqsssqqsssssqqsqqssqsqsqssqsqqsssqqssssqssssqqqsssqsssqssqqqqqqqsqqsssqqqqsssqqqssssqqqqqqqqsqqssssssqssssqqqqssqsqqsqsqssqqsqssqqssqsqqssqqqqqqsqqsqsssqsqqsqsssqsqqsqqqsqsssqqsqqqqqsssssqqqsqsqqsqqqssqsqsqsqsqqsssqssqqqqsqqssqqsqqsqssqsqqqssqqsqsqqqsqssqsqqqssqqssqqsqqsqsssssqqqssqqqsssssssqsqsqqssqsqsqqqqqqsssqsssqqsqsssssqsssqssqssqssqqssqqqqsqqsqqqqssqqsqqsqqsqsqqqsqsqqqssssssqsqqsqqqsqsqqqqsqssqsqqssqssqqssqsqqqqqsssqsqsqsqsqqsqqqsssqqssqqssssssqqssqqsqqsqsqqsqsssqqssqsqqssqqqsqsqqqsqqqqqqqqsqqqqqqqqsqqqssqssqqsssqsqqqqsqqssqsssqsqsqssssqqqsqsqqqsssssqssqqssqssqssqqsssqqqsqqqqsqsssqssssqqqqqsssssqqssqqqqsqssqssssqqqqssqqssqqqqssssssqsqsqssqssqqsqqsqqsqssssqsqsqsqsqsqqssqsqsqqssqssqqssqsqqqsssqsssqsqsqssqssssqsqqsssqssqsssqsqqqssqqsqssqsqqsqsqssqqqqssqsqqsqsqssssqsqqsssssssqqqqssssqsqsqsqssqqqsqsqqsqqqssqsssqsqsqsqsqqsqsqqqqsssqsqqssssqsqsqqssqqqssqqqsqsqsssqsqssqqsqssqqqqsqqssqqssqssqsqssssqsqssqqsssssqsssqqqsqsqqsqsssqqssqqssqsssssqqsssssqqssssssqqsqsssqssqqqqssqsqssqsqsqqqsqsssssqsssqqsssqqsqqqqsssqsssqssssqsqqqqqqssssssqsqqsqsqssqqqqqssssqsqqssqsqqqqssqqqqqsqqqssssqssssqssqsssqssqsssqqqssssqssqqqsssssqqqqqsqsqqqqqqsqqqqqqsqqqqqsssqsssqqqqqsssqsqqqqqqssqqssqqqssqssssssqssqssqqsqqqqqqqsqqqssqqqsqqqqqsqqsqqqqsqssqsqqssqqsqssqqqsssqqsqqsqqsqqqsqsssqssqsqqqsssssqsqssqsqsqsqqssssssqsqqqsqqqqqsqsqqssqsqssqsssqqqsqqsqssqqqsqqqsssqqsqsqqsqsqsqqsssssqsqqqssssssqqqsssqqssqsqqsqsssqqqsssssqqqsqssqsssqqsssqsqssqsqssqqqqqsqsqqqssqqqsqsqssqsssqssqqqsqsqssqqsqqqsssqqqqqsqssqqqqqqqsqsssqssqsqqqssqsqqsqssqsqqqsqsssqqqsqqsqqssqsssqssqssssssqqsqsqsqssqssqqssqsqqqqqqqsqqqssssssqqsssqsqssqsqqssqsssqqqqqsssssqssssqsssqqsqqsqqqsqqsqqssqqsqqqqqssqsqqqsqqqsssqssqqssqsqqsqqqssqqsqsssssssqsqqqssssqqsqqssqsqssqqqqqsqssqqsqqsssqssssqqsqqqqsqssqqsqsqqqqssqqqqsqsqsssqqqssqssqssssqssqqssqssqssqqssqqssqssssqqssqqssqssqssqssqqsqssqqsqsqqsqsqqsqssqsqqsssqqqqssqqsqqssqqssqsqqssssqqqsqsqssqqsqssqsqsqssqqssqsssqsqssssqqqssqsssqqsqssqqsqsqsqqsqssqqsqsqsqsqqqqsqssqsqqqssqqssqqqssqqsssqqssssqqssqsqqqsqqsqqqqssqsssssssqqsqqqssssqqqqqqqsqssssqsqssqqqqsqsqssqqqqsqqqqsqssqsqqsqsssqsssssqsqsqqsqsssssssqqsssssssssqqssqsqsqssqqqssssqssqssssssqqsssqqqssssssqssqssssqsqssqssqqsqsqsssssqqqqssqqqssqqsqqqqssqqqqsssssqqqsqqqsqsssqsqqssqqqsssqsqqsqssssqqsssssqqqsssssqssqqssssqqqssqsqqssqssqqqsqsqssssqsqssssqsqssqssssqqqqsssqssqsqsssssqsqqqqqqsssqsqsssqsqsqsqsqssqqsqsssqsqqssqsqqsssssqqsqsqssssqssqqqssssqsqqsssssssqqsqqsssqsssqssqsqqssqqqssqsqsqsqqsqqsqqsqqsssqsqqqqqqqqsssqqsqssssssqqqsqssssqssqsqsqqqsqqqqqsqqssqqsssqqqqqssssqqssssqqqsqssqqsssqsqqqsssqqqsqsssqqsssqsqssqqqqqssqsssqsqqqqsqsqqsssqqqqssqssqsqsqqsqsqqssssssssqqsssqqqsqsssqqsssqsssqsqssqsqqqqsqqqsqsqsqqsqssqqqsqqsqsqsqsqqqqqqsqsssqsssqqssqsqsssqqsqssssqqqsssqqqsqqqsqqqqqqssssqqsqsqssssqsqssssqsqsqsssqssqsqsssssqsqssqqqqqqsqqsqqqqsqqssssqsqqsssqqqqqqssqqqqqssqqqssqqqqsqsqqqsqqqqsqssqqqsqqqsqssqsqsqqqsqsqsqsqqqsqsqqsqqsqqqqsqqsqsqqssssqqqqsqqqqqqssqsqsssqqssqqqsqqsqsqssssqqqssqsqssqqssssqsqqqsqsssssssqqqsqqssqqqsqssqsqqssssqssssssssqqqqssqssqsqqqqqssqqssqsqssqsssqsqsssqqqssqqsqqqqqqsssqssssssqsqsssqqqqsqsqssqqsqsqqqsqqqqsssqqqsssqsqsqssssqssssqssqsqsqqqqqssqqsqqsqsssqqssqsqqqqsqsqqqsqqqsqqqsqqqqsqqqqqsqqssqsqqsssqqsqqssqqssqqsssqssqqqqssqqsqsssqqqssqsqqqssqqsqsssqqqqqsqqqqqssssqssssqqssqssqqqssqqssqqsqqqqqqqssqqqssssqqsqssqqqqsssqssqqqsqqssqsssssqsqqqqqqssqqsqssssqssqssqqssqsqsqqqssssqqqsqqsqssqsqsqqsqqqqsqssqssqqqqsqsqqsssqsqqqssssqssqqsqssqsssqsssssssqssssqssqqqqqqqssssqqqsqsqssqssqqssqqqqsqsqqqssqqsssssqssqqqssqsqsqqqsqqsqsssssqqssssqqqssqsqqsqsqqqsqssssqqsqqsssqqssqqqssssssssqqsssssqsqssqsqqsqqqqsqqsssqsqssqsssqsqsqsqqqqqqqqqqssqsqsssssssqsqsqsqssqqqsssqsqsqqqqqqqsqsqssqqssqssqssqssqsqqqsqqssqssqqsssqqsssqsqsqqqqssqqsqsqssqsqqqsqqqsqsqsssqqqqqqsqsssqsqqqssqsqqsssqqqqsssssqqqssqssqqsqqqqsssqsqqsssqsqqqqqqsqssqssssqqsqqqqqqqsqsqsqqssqsssqqssqsqssssssqqssqsssqsssqqsqqqqqqqsqsqqsssqsqsqsqqqssqssqsqssqqqsqqsqsqsqqsqqqqqqsssqqsqqsqsqsqqqsqqqsqsqssssqqqsssqqsssqqqqsqsssqssqsssssqsssqqsqqqsssssssqssqsqqqqsqssqqsqssqqssqqsssqsssqqqsqqsqqssqsqsssqsqsssqssqqqsqqsssqsqsssqqsqsqqqqqqqsqssqqqqqqssqqqsqsqqqssqssqssqqqsqsqqsqsqqsssssqqqsqqsqqssssqssqssqqsqqsssqqssqssqqssqqqqsqsqqsssqsqqqqqqsqqsqqqqsssqsqqqqqssqqqqqqsqsssqqqsqqsssqqssssqqqqsssssqsqsssqssssqqqssqqsqqqsqqsqqsssqqqqsssqqsqssssssqssqqqqqqsqsqsqqqqsssqsqssqqsssqqqqsssssqssqqsqsqsqsqqsqsqssssssqsqqqqssqqsssqqqqsqqqqqssssqqqssqqqqsqqsqqssqssqqqqsqqsssqqsqqsssqsssqqssqssqqssqsqsqqsqsqssqsssqqsssqqssqsqssssssqqqsqssqqqqsqqsqssqqssqqsssqsssqsqsqssqqssqsqqqqssssssssssssssssqsqssqsqssqqqsqssqssqssqsssqqssssqsqqqqssqqqsqqqssqssqqqqsqssssqqqqsqqsssqqqsqqssssqsqsqqqsssssqqsqqsssssssqqssqsssqqqqsqqsssssqsqqsqsqqqqsqsqsqqqqsqqsqssssqqsqqsssqqsqsqqqqsqqqsqqqqsssqqsssqqqqqqssssqqsqsqsqsqqssqssqqsqqqqqssqqqsqqsqsqqqsqqsqqsqqqqsqsqsqqsqqqqqqqsqqssqqsqsqsqqsqqssqssqqssqssqqsssssqqqqssqqsssqsssssqqsqssssqqsssssqqqsqsqssssssqssssqsqqsqqsssssqsqqsqssqsqssssqssqsqssqqsssqsqsqsqqsqqqsqqsqsqsssqqqsqqsssqqssssqqqqqsqssqsqsqqqssqsssssqqsqsssqssssqqqsssssssqsqqqssqsqsssssssqssssqssqqssqsqsqsqqssssqqqqqsqssqsqqsssqqqsqssssqsqssqsqssqsqsqqqqsqqqqsqsqssqsssqqsqssssqqqsqqssqsqsqsqqsqqqsqqssqsqssssssqqsqqqsqsqqssqqqsqqqsqqqsqssqsqssssssqsssqsqqqqqqssqssqsssssssqqqsssqssqqqsqsqqqqqsqqsqsqssqsqssqqsqsqqssqsqqqqqqqqqqqssqqqqqsqsssqssqsssqsssssqssssqqqqqqqssssqssqqqsqsqqssssqqsqsqsqqqsqqqqsqqsqssqsssqqsqqsssqsqsssqssssqsqsqqqqqqqssqqsssqqsqqqqqsqqqsssssqsqqqsssqssqsqsqqsqqsqsqsqqsqqsqsssssqssssssqqqsqssqqqssssqqsqsqsqsssqsqssqqqqqqqsssqqqsqssqssssqssqssqsqqssssqsqsqssqqqssssqsqsssqsqqqqqqsqqqqqqssqqsqqssssqqssqqsqqqssqsqqqqqsqssqqqsqqsqsqssqsqqssssqqqqqsqqqqqqqsqssssqqsssqsqsqqsssqqqqqqqsqqsssqqsqssqsqqsssssqqqqqssssqqssqqsqssqsssqqssqqsqqssqqqsssqssqqqsssqqssqsssqqqqqsqssqsqsqqsqsssqqsssqssqqsqsqssssqsqqqsqssqsssqqssssqqsqqqsssqssqqqsqssqsssqqqqqqqsqqqssqqqssssqqqqsqqsqqqsqqqqqqssqqqqssqsqsqqqqssqqqqqqqqssqqsssqqqssqssqqqqqqssqqqqqqqqqqsqqsssqsqsssqqqsqqqsssqqssssssqqsqsqsqqsqqqsqsqssqssqqsqssqqssssqqqsqsqqqsqqqqqsqqsqsqqqqqqqqqsssqssqqqssqsqsqqqqqqsqssqsqssssssqqqqqqqsqqqssssqsqqssqqqsqsssssqssqsqsqqsqqqsqsqsqqqqqqqqsqqqqsqssqsqsqqqqsqqssqsssqssqsssssqqssqsqqsssqqqsqqqqqqssqqsqsssssqqsqsqqqqqssqssqssqqqqssqsqsqqsqsssqsqsssqssqqqqsqsqqsqsqssqqqsqssqsqsqqqqqqqqqsssqqqsqqqsqqsssqqqqsqqsqsqqssqqsqsqsqqssqsssqsqsssssssqsqqssqsqsqqsssqssssqsqsqsssqqqqqqsqsqsqqqqssqqqsqssqssqqsqqqqqsqqsqssqssqsqssssqqsqqqqqssqqsssqqsqqqqqqqsssqsqsqqqsqssqssqqqqqsqsqsqssqsqqqqqsqqsqqqqqqqqssssqssqqsqsqqqqqsssqsqssssssqssssqqsqqssqssqqssqqqqssqqqsqsqqqsqqsssssssssssqqssqssqqqssqsqsqsqssqqssqqssqssssqssqqqsqsssqssqqqsssssqqssqsqsqsssqssqqqqsssqqsssqqsssqqsssqsqsqsqqqqqssqqqqsqsqqqqqssqqqqqsqqqqsqssqsssqsqsqqqqqqqqssqqqssqssqqssssssssssqqsssssssqssqsssssqqqsssqssqsssssqqssqssssqqqsqssqsqqsqsssssssqssqqsqqsqqssqqsqqqqqsqqqqssqsssssqqsqssqsssqqqqssqsssssqqqqqqsssqssqsssqssssssqqqsqsssssqsqqqssqqqsqsqsqqqsssssqqsssqsqsssqsqqqqqsqssqsqqssqqsqsssssqqsqsqsssqqqsqssssqqqqsssqqssqsqsqqsqqsqssqqsssqqqssssssqqsqsqqqqssqssqqsqqsqqqsqqsqssqqssssqqsssqsqqqsqsqqqsqqsqssqqsqqqqssqqsqsqsqsqssssqssqqsqqqqsssqssqqqqqqssssqsqsqsqqqqssqqssssqsqsqsqsssqssqsqqsssqqqqssqqqqqqqsqsssqqsssssqqqqsqqsqssqqqsssqssqsqqqsqqssqsqqssssqsqqssqqqssqqqsqsqqqqqqsqsqsssqsqqqqssqssqqssssqsssqssqssqqqsqssqssqqqssssqssqqsqsqsqqssqqssssssqsqqqqsqqsqqssqsssqssqqqqssqsqqssqsqsqqssqsssqqssqsqsqqssqssssqsqsqsqsqsqqssssqsqqqsqqsqsqqqsqssssqsqsqqsssqqsssqsqsqqssssqsssqsqqqssqssqqsqsqqsqqsqqsssqsssqqqqqqqqsssqsqsqqqqsqqsqssqsqsqqqqsqqsqqssssqqqssqqsssqqssqssqssqqqssqsssqqqqqsssssqqsssssqsqqqqqqsqqqqqsqqssqqqssqqqsssssqqqqssqqqqqssqsqsqsssssssqqqqsssqqsqqqqsssqqqsssqqssqsssqssqsssssqsqssqsqsqqqsssssqssqqsqsqsssssqssssqqsssssqsqsqqqqqqssqqsqqssqssqqsqsqsqssqsssssqqqqqsqqqqqsqqqqqssssqqqqqqsqsqqssssssqqqsssqqqssqsqssqssssssqsqsqsssqssssqqssqsqsqsqqqqssqssssqqssqsqsqqsqqqsqqsqqqqqsqqqssqqqsqqqsqsssqqssqqqqssqsssssqsqqssssqsqssqqqsqqqsqqqsssqsssqqqqssssqsqqqsqqqssqqqqqssqssssssssqqqsqqssqsssssqqssssqssqqsqqsqsqqsqsqqssqqsqqqsqsqqsqqsqsqqqsqssqsqssssqssssqqssqsqsssssqsqssqsqsqsqqsssqsqqsssssqqqqssssqsqsqsqqsssqssssssssssssqsqsqsqqsssqqqsssqqsssqqsqqsqsqqqsssqqssqqqqssqqqssqssqssssqsqqssqqqqssqsqssqqsqqqqqsqqqqssqsqssqqsqqqqqqqqqssqqqssssqssssqssqqqqqqqssssqssqqsssqqqssqssqsqqsssqqsssqsqqssssssqqssssqqqqsqqsssssqsqssssqqssqqqsqqqssqqqqsqssqqsqsssqqssssqsqsqsqqqssqqqqssssqqsqssssssssqqssssqqqqssqqsssqsqqqssqsqsqqqsssqsqssqsqqsqqqssqssqsqqsqsqsssqqqqqqsqsqqqssssqqssssqsqssqqqqsqssqsqqsqsssqqsqsssssqsqsqssqqssssqsssqqsqsqqqqqsqsssqqssssqsqssqqssqsssqqsqqsssqsqssqqsqqqssqsqssqqsqqqqsqssssqssqqqssssssqqqsqqsssqsqqqqqssqqqqssqssqqssqqsssssqssssssqqssqsssssqsqsqsqsqssqqqqqqqsqsqqsqqqsssssqqsqsssqsqqsqqsssqsqssssqqqqqssqsqsqssqqsqsqqssqqqqqqqqsssssqsqsssqsqsssssqqssqqssqsqqsqsqqqssqqsqsqssqsqssqssssqsssqqqqsqssqsssqssssqssqqsqqqsqsqssqsqsssqqqsssqqqqssqqqssqsqqqqsssqsqsssqsssssssqssqqqqssssqqsqqqssqqssssqqqqsqqqqssssqsssqqqsssqqqqqqsqqqsqqsqsssqsqqqsqsqqsqqqqssqsssqssqqsqssssqssqqssqqsssssqqqsqqqssqssqssqqqqsqsqqqqsqqsqqqssssssqssqsqqsqsssssqsqsssqqqsqqsqsqsqqqqsqssqqsssqqssqqqqqqsqqqssqqqsssqssqsqsqqqssqqqsqsssssqqssqqssssqqqssssqqqqsssqqssqqqsqssqsqsqsqssqqsqsqqqsqqsqqsqssqqsssqsqqsqssqqqsqssqssssqqssqsqsssqsqssqsqsqssqqsssqqsqssqsqqqqqsssssqqqqqqqqqssssqqsssqqssqsqsqqqsqsqssqqqqsqsqsssqqsqqssqssqqsqqqqqqqsqqqsqqqsqsqqqqsqssqqqsqqssssssqqssqsqqqsqqssssqssqsqsssqqqqqssqssqqssqqssqqsqqqsqqqsssssqqsqqqqqqsqsssssqsssqsssqsqsqsssssqsqqqssqqsssssqqqqssqsssssqssqqsssqqsqqqqsqsqqsqqqssssssssqqqsqsqsssqssqssqqssqsqsssqqsqsqqssssqqqsssqqqssqqsqsqqsssssqqqssqsqsqsqssqqsqsqssqsqsqssqqqqqqsqsssqsssssqqqsqqsqssqqsqssssqssssqqssqsqssqqqqqsqsqsqsqssqsqqsqqqssqssqqqsqqqssqqqssqqsqssqsqqqsqqqqsqqsssqsqqsqqsssqsqsqssqsssqqqssssqqssssqqsssqsqssqsqqqqqqqssssqsqsssqqssqqqssqsqqsqqsssqsssqsqqqssqqqsqssqqsssqsqqsssqssqqsqsssqsqqsqqqsqqssqssqqqssqssssqsqqsqqsqqqqqsqqssssssqssqqqqqqqqsqqqqqsqqqqqqqqsqssssqssqsqqqsqqqqsqsqssqsqqssqqssqqsqsssqssqssqssqqsqqsssqqsqssssqqsqsqqssqqqqsqqqqqqqsqsqssqsqqqqsqssqqqqsqqsqsssssqqssqsqqsqssqqqsqssqssqsqqssqqqssssqqsssssqqqqqqssqqqssqssqqqsqqssqsssqsssssqqssqsqqqqqqsqqsqqqssqsqqsqssqqqqqqsqqsssqssssqsqqssssssqsqssqqsqqssqqssqqsssssqqqqqssqssqqssqsqqsqsqsssqsqqsqqqsqsqsqqqqsqqssqqqsqsqqsqssssssqqqqqqsqsqsssqssqsssqqsqsqsqqsssqssqqqsqqqqqqqqqsssqqsqssssssqsqqsqqsqqsqsqqssssssqqqqsqssssqqqqsqqqqqqsssqsqsqsqqssqsqssssqsqqsssssqqqqqqqqqqsqsqsqqqqqqqsqqssqqsqssqssssqqqssqsqqqqsqssqsqqsqqsqqqsssqqsssqsqqsssssqsqqqssssqssqssssqssqqqqqssssssssqsssqsqssqqqssssqqqqqqsqsssqqqqsqsssqqssqqqssqssqssqqsqqqqqqqsssqqsqqsqsssqsqqsssqsssssqqsqqssssqqssssssqssqqqsssqqsqqqqqsqsqsqsqqsqsqqssssssssssqqsssqqsqqsqssqssqsqqsqqsqqqsqsqqqsssqqsqqsssqsqsqqsqsqsssqqssqqqssqqqqqqqsqqsqssqsqsqssssqssqqsssqqsqsssqssqsssssqsssqqsqqsssqssssqsssqsqsqqssqssqqqqqqsqqsqsqsssqsqqsssssssssqsqsssssqqqqqsqqqqsssqsqqsssqsssqssqqsqssqsqqqsqqqssqsqqsssqsqsssssqqqsssqsqsssqqssssqqsqqqqsssqsqqssqqqsssqqqqqsqsssqqqqsqsqqssqqqsqqqqssssqsqssqqsqsqqqqsqssqqssqsqssqsqsqsqqsqsqssqqsqsqqqqqssqssssqqqqqssqqsssssqsssqsssssssqqsssqsqsqsqssqsqsqssqqsssqqsqqsqsqsssqqssqqqsqssqqqsssssssqsqqsqqsssssqqssqqsqsqqsqsqqsssqsqsssssqssqqqqssqsqqsssqsssqsqqssqqsqsqqqsqsssqsqqqssqqqqssqsqssqsqssqsqqsqssqqssqssqqssqsqqssqqsssqqsqsqsqqqqssqsqsqsqssssqqqsssssqqssqsqssssqqssqqqqsqssqssqssqqsqsqsqsqqqssssqssqqsqssqsqqssqsqsqsqqqqqssqsqsqsqsqqssqqqsssqqqqqqsqqqssqssqsssqsqqssqqssqsssssssqqsqqqsqsqqqqqsqqqqsssqqqqssqqssqqssssqqqsqssqsqsqssqqqqqsssqsqsqsqsqqsqqsqsqssqsssssqssqssssqqqsqssssqqssqqqsqsqsqqsssqqqsqqqqssqssqqsssqqssssqsssqsqsssqsqqssqqsqsqqqqssqqsqqqssqqqsqqqqqsssssssqssssqqsqssqsqssqsqqqssqsqssssssqsqqqqqssqqssqssqssqsqqsqqsqsqqqssqqqsqsssqqsssssqsqqsqqsssqssqqsqsssqsqqqsqssqsqssqqsqqsssqssqsqqssqssqsqqssqqqqsqqsqqqqssssqsqsssqqqqsssqsqsqqsqqsqqqssqsqsqsqsqqssqqqqqsssssqqqqqsqsqsqsqqqssqqqssqqqsqsqqqsqqqqqqsqsqsqqqqssqssssqssqssqsqqsssqqqssqqqqqqqssqqqssqsqssqssqsqssqsqsqqqqqsqqqqssqsqsssqqqqsssqqqqqsqqsssssqqsqsqsqsqqqssssssqqssqsqqqqsssssqssqssqssqqqsqsssqssqssqsqqqsqsqsqqsqsqsqsqqqqsqsssqssqqsqssqqsqsqqssssqqsssssqssqssqqqqsssqqqqssssqsqsqqssssqsqqqqsssqsqqssssssqqssqsqqqqqsqssssqqqqsssqsqqqqsqqqsqqqqsqqqqqqsssqsqqqsqqqqsqsqsssqsqsqssqqqqqsqsqssqsqssqsqsqqsqsqssqsqqssqqqssqssqqqsssqqqsqsqsssssssssssqqqqsssqqqssqqqsqssqssqqssqsqqqqqqqsqqsqqsqqqqqqqqqqssqqsssqqqqssqsqqqqqqssqqqssqqssqqqsqssqqqqsqqqsqsqsqsqqssqqsqqqqsqssssssqsqqssssssssqqssssssqssssqsqssqqqssssqsssqqsqssssqssqqqqssqssssqssqssqsqqsqssssssqqqsssqsqqsqqqqqqsqqqssqsqsqssssssqqsqssqssqssqsqqsqsqsssssqqsqsqsssqsqqqqssqqqqssssqqqqqsssqqssqqqqsssqsqsqsssqsqqsqqqqssssqsqssqqqsqqqqsqqsssqsqqsqsqssqsssqsqsqsqqsssssssqqsqqsqqqssqsqqqsssqsssqqqqsssqqssqqqssqsqssssqqqssqqssqsssqqqssssqsqssqssqqssqsqsqqqqssqssqqqsqqqsssqssqssqqsqqqqsqsssqqsqqqsssqqsssqsssqsqqqqssssqqqssqqsssqsqqqsqqqsqsqqsqqqqsssqqssqqqqqsqsssqqqqqsqqqqssqqssssqsqsqqsssssqssqssqqsqqsqqssqqssqsssqqsssqsssqqqqqssssqssqqssssqqssqsssssqssqqsqsqsqqqsqsqsqssqqssqqqqsqqsqqsqsqssssqsssqsqqssssqsqqsqsqqqsqqsqsqsqqsqqssssqqssqqssqsqqqsqqsssqsssqsqqsqqqqsqsqqssqqqqsqsssqqsqssqsqqssqqssssqqsssqssqsqssqqssqqqqsssqqqqsqssqsssssssssqqsssssqqqsssqsqqqqqqsqqsqqssqqqqqsqsssqssqqqsqqsqsqqqsqqqqsqqsqqqsqsssqqqqqqqssqqqqsqssqqsqqqsqssssqssqsqsqqsqssqsqsqqqsqqqssqssqssqqqsqqsssqssqqssssssqqqsqsqssqssssqqsqsssssssqssqssqqssqsqqqsqqqqqssqqqqssqsqsssqqqssqqqsssssqqqqqqqssqqsqsqsqsqqqqqqsqssqsqqsqqssqqsssqsqssqssqsqqssqssqsqssssqsssqqsqsqqqqqqssssqsqssssqsqsssqssqqsqqsssqsqqsqqssqqqqqssssqsqsqqsqsqssssssqqqsqsqqqssqsqqqqssqqqqsqssqqsqsqqqqqqqqqssssqqqssssssssqssqqsqssqsssqqsqqqqsqqsqsqqqqqsssqsssssqsqqqssssqsqqqsqqsqsqqsqqqqsqqqssqqssqqsqqssqqsqsqsqsssqqsssqsqsqsssqsssqsqsqsqsqqqsssqsqqqqssssqqsqqqqsqsqsssssssqsssqqqsqqsqssqqssssqssqsqsssqqqqqqqqqqssqsqsqqqqsqqqsqsqqqqqssqqqqqsssqssqsssqqqqssqsssqssqqsqsqqssssssssqqsqsqqqqsqqsqsqssqqsqssqqssssqqqqsqssqqsqsqqqqqqqsssqssqqsqqqqqqsssssqsqsssqqqsqqssqssqsssqqqsqqsssqssssqsqqsssqssqqsqsssssssqsqsqsqqqqssqqssssqssqqqqssssqsqqsqqqqsqssqqqsssqqqssqsssqqqsssqssqqqqqsqqsssqqssqqsqqssqsqqqsqqsqsqqsqqssqqqqssssqssqsqsqssqssqsqsqsqsqqqsqqssqqqqsqqqsqsqqsqqqqsqqqqssssqsssqssqsssqqqsqqqqsssqssqqssssqsqsqqqqssssqssqsssqssssssqqsqsqqqqssqssssqsssqsqssssqsqqqqssqqqsqssssqqsqssssssqssqssqqqqssqsqqqssqqsssqqqssqqqsqqssqqsqqssqqssqqqsssqqqssqqqqssqqqqqssqsqqsqqsssssqsqqsqssqqsssssqsqqsqssqqsqqsqssssssqqqqsqqqqqqqqsssqsssqsssssqqsqsqqssssqsqqqqssqqqqsqsssssqqsssssssssssqqqsssssqssqsssqssqqssqqqqqssqsqqsqqssqqsqqssqqsqqsssqsqsqsssqssqqsqssqsqssssssqsqqsqqssssqqsqsqssqsqqqsqssssqqqsssssssssqsqssssssqqqqsqsqssqssqsqsqqqssqqssssssqqqsqqsqssssqqsqqqsssqsqssqqsqsqsqsqqqsqsssssqqqsssqqsqqsqsqqssssqqqqqsssqssqsssqssssqqqssqssqqqqssqsssssqssqsqqssssqqqqsqssqsssssqsqqqqsqsqsssssssqqssqqqsssqqqssqssssssqsqqqqqsqsssssqqqsqssqsqqsqqqsssqqqsqssssqsqsqqsqqqqqsqqqqqqqqqqqsqqqqqsqqqsssqqqqssqsqssqqqqqqqqqqqqqsqssqqsssqssqsqssqsssqqsqqqsqqqsqssqqssqssqsqqqqqqsssqqqqsssqssqqqsqqqsqqsqssqqqqsqqqssqssssqqqqqsqssssqssqqsqsssqqssqqsqqsssqqsqsssqsqqsqsqsqsqssqssssqssqssqsssqssqqqsqqqqqssqsqqsqqqsqqqqsqsqsssqqsqqssssqqqsssqssqqqssssssqsqssqsqqqqqsssqqssqqsqqqqqqqqsssssqsqqsqqsqqqqqssssqqsqqqsssssqsqsqqqsqqsqsqqqsqqssqqsqqsqqqsssqsqqsqqsqqsqqqsqqqsqsqssssqqssssqsqsqsqqqsqsssssssqqssqqqqqsqsqqqqqssqsqsqqqsssqsqqqsssssqqqssqssqsqsqqssqsqqsqqsqqssqsqqqqqsqqqsqsssqqqsqsqsqqssssssssqqsssqsqssqqssssqsqsqsqsqsssssqsqqsqssqqssqsqsqsssqqqqsqqssqqssqqqssqssqssqsqqsssssqsssqssqqqsqqqqsqsqsqqsqqqsssqssqqqssssqqsqsssssqsqsqqsqqsqqqssssqsqssqqssqqqqqqssqsssssqssqssqqsqsqsqsqsssqqsqsqsqsssqssqsqsqqqqssqqqqqsqqssqqsqsqqssqsssssssqsqqsqqsssqqqqqqsqsqqssqsssqssqssqqssqsqsqqqsqsqqqsqqqsqqqsqsqsqsqsssqqsqssqqsqqsssqqsssqssqqsqqqssqsqqqsqqqqsqqqqqssssqssqqqsssqssqsqsssqsqssqsqqqssssqqssqqqsqqssqqssqqqqqsqqqqssqssqssqqqssqqssssqsssqqsqqqqsqqqqqsqqqqsqsqsssqqsssqsqqqsssqqqsqqqqqssqsqqssqsssqqsqqssssssqqsqsssqqqqssqssqqqsssqssssqsqqsqqqqsqqqqsssssssqsqsqsssqsqsqssqsqsqssssqqsqsqqqqssqqqssqqsqssqssqsssqqsqsqqssqsqqsssqsssqqqsqsqqsqssqsqqsqqsqqsqssqqqqqsqsqqsqssqqqssqssqqssqssqsqsqsqqssqqqsssssqqsqsssqsqqqssqqqssssqqssqsqqqqqsqsqsqsqssqqqqqsqsqsqqqqqqqqqssqssqsqqsssqsqsqssssssqqssqqqsssqqqssssqsssqqsssqqssqssqqqqqqqqqsqssqqssssssqqqqsqqqsqqqqsqqqqsqsqssssqsssqqssqqqssqqssqsqqsqsqqssqsssqqsssssqqsqqqqsqqssssqsqsqsqqqsqqsqqsqsqsssqssssqssqssssqqssqsssqsqsqsqsssqsqsqsqqqqsssqsqsqssssqqqqqqqqqqqqsqqsqsqqqqsssqsqsqqqqqqssssqsqsqqsqqqssqqqsqqqsqqqqqqqqqqsqssqssqsssqqqqsqssqsqqssqqqsqsqqqsqqsssqssqsqsqsssqsqqsqsqssqqssssqqsqqqssqsssqssqssssqqsqsqqqsssqqssssqsssqsssqqqsqqqqsqqsssssqsqqqssqqsqsqsqssqqsqqsqqsqqsssqqqssqsqsssqqsqqssqsqssqsssqqqssqsqqqsssqqsssqqssqssqqsqsqqssqsqqqqqssqssqsqsqsqsqsssssqqqqsqqsqqqqsqqqqsqqqqsqssqqqssqqsqqssssqqsqsssqqqsqsqqqsssqsssqqsssqsssqqqssqssssqssqqssssqsqqqsqssqsqsqqqqqsqsqssqssssqqqssqsqqqqqsqsqsqssqqqqqqqqqssssssqsqsqsqqsqssqqssqsqqsqqqsqsqqsqssqqsqqsqqssqqqssqqqssqsqqsssqssqqqqsqqssqqqqqsqsqsqsqqqqqqsssssqqqqsqqqsqssqqsssqsqsqsqqsqqqqsqqsqqqsqsssqsssqssqsssqsssssssqqssqqqqsqssqsqsqsqssqqsqsqsqqqqsqsssssqqsqsqsqqqsssqssqqsqssssssqqqsqsssqqqqqqssqqqqsqsqssqsqsqssqssqsssqqsqssssqsqqsqqqssqqqssqsqsqssqqqssqssqqqqqssqsqsqssqqqqqsqssssqssqsqqqsssqqsqqsssqqqsqsssssqsqqqsqqqqqssqqsqqssqsqsqssqsqqqssssssssqqsqsqqsssqsqqssqsqqqsssssqsqsqqqsssssqqqqqqqsssqsssqqssqqssqqqqqqqsssqqsssqqssqqqqsqssqsqqsqsssqssqsssqsqssqqsqqqssqqsqqsqsqqqqqqqqsqsssqsqqqqsssqqqssqsqsqqssqqqqssqssssqqqqssqqsqqqqqqqqsssqsssqqqqqqsqqsqqsssqssqqsqssqsqsqssqqqqqqsqqsssqsqssqqqqqqqqsqssqssqqssqssqsqqsqqqqssqsqsqqqsqqssqqssqqssqqsqssqsqqsqssqsqssssqqsqqsqqqqsqsssssqqqqqssssssqssqqsqssqsssqqqsqqssssqsqqsqssssqsqqqqqssqsssssqqsssssqsqsqqsssqsssqsqqsssqssqsssqssssqqqqqsqsqqsssssssqsqsqqsqsqqqsssqsqqsqqsqqqssqsssssssqsssqqqqqssssssqqsssssqqssssqsqqqsqsqsqqqsqsqqsqsqsssqqqqssssqqsqqsqqsqsqsqqqssssqqsqsqqqqsqsqqsqqqsssqsqsqsqqqssssqqqsqqsqsqqqqqqsqsqqqqqssssqsssqqqssqqqsqssqqqsqsqqqsqqsqsqqqssqqsqqsssssssssqssssssqqqqssssqsssssqsqssqqqqqqssqssqsqqqsqsssssssssssqqsqsqqsqssqsqqqqsqsssqqqsssqsqqqsssqsqqsqsssqssssqqqqqqsqsqsssqsssqsqsqqssqqqssqsqqssqqsssqqsqsqqqqsqqqqssqsqsqqsqqqqsssqqsssqqsqsssssqsqssqsqqqssqqssssssqqsqqsqsqsqqqssqssqqqqssssqqsssqqsqsqqssssqqsqqqqssssqssqsssqqqssqqsqqsqqqssqsssssqqsssqqsqsqssssqqqqqqsqqsqsssqsqssssqqqqqqsqsqssqqsssqqqsqqqsqqsqsssqssqsqssqsqqqqssssssssqsqssssssqqsqqsqssqsqqssssqsssssqssqssqsqqqsssssqsqqssqsqsqsqqsqqqssqsqsssqqqsqsqsqqqsqsqsqsqsssqqsqqqqqqqqqqqqsqssqqqsqsqsqqsssssssqqqsssqqqqsssqqssssqqssqsqqsqqqqqsqsqqqsqqqsssqsssqssqqssqqssqqsqqssssssqsqqqqqqssssqssqsqqsqsssqqqqqqsqssssqsssqssssqsqsssqqqqqqsssqssqsssqqsqqqsqqqsqssssqqqqqqsqqssqqsssssssssqsqsqqsqqqqqssqssqsssqsqsqqssqqqqqqsqqsssssqsqssqqssssqqqqsssqsqqsqqssqssqssqsssqqsqsssssqqsqsqsqqqsssqqqsqqsqsssqsqqsqqsqqssqqqssqssqsqqqqssqssqsssqqqqqqssqqqsqqqqqsqsqsqqqqssqsqqqqssqsssssqqqqqqqsqqqqsqssqssssqsqqssqssssqqqssqqqsqqqqssssssqqsssssqsqqsssqssssqqssqssqqqsqsqsqqsqsqqqqsqsqssssqqsqqqqqqqqqqssssqsqsqsqsqsqsqsqssqsqqqssqqqqqsqqqqsqqqqqsqsqqsqqsqqssssqsssqqsqsqsssqqqsqqqqqqqsqsqqsqsqsqsqssqqsssqqsqqsssssssqsqqssqqsqqqqsqsssqqsqqqsqqqqssqssqsqssqqssqsssqqsssqqsqssqqsqqsqqssqsssqsqqqqqqqqqqsqqssqsqqqqqsqsqqssqsqsssqsqsqssssqssssqsqsqsqsqqssqssqsqssqqsqsqsqssssqqsqsqsqqqsssqqqsqqqsqsssqqqsqqssssqqqsqssqssssqqqqssssqsqsqsssqqsssqqqsssqsssqsqqssqsqqssssqqssqqsqsssqssqsqqsqsqsqssqsqsqqssqsqssqsssqsqsqqsqqqssqsqqqqsqqsqqssssssqqssqsqssqqsqsqqqsqqsqqqsqqqqssssqsqsqqqqsqqqqsqsssssssqqsssqsqssqssqqsqqsssqssqqqssssqsssqssqssqsqsqqsssssqssqssqqqsqsqsqsqqqssssqqssqsqqqsqsssqqsssssqsssqqsqsqqsqsqssqqsssqssssssqsqssqqqsqsqssqsssqqsqsqssqsqsqqqqqqssssqqqqqsqqqqsqqqqsqqqssssqssqqqqssqssqsqsqqqqsqqssqsqqsqsqqqssssqqsqqsqqsssssqssqqqsssqqqqqsssqqqssqssqqsqqqqqsqsqssssssqsssqqsqqsssqqssqssqqsqqqsssqssssqqssssqsqssqsssqqsssssqsqqssqqsqqqssssqsqsqsqsqqqssqsssqqsqssqqqqqsqqsqqqssqqqsqqqqqqqqqsssqqqqsssqsssssssssqqsqssssqsssqqqqqsqqqqsqsqsqssqqssqssssssqssqqsqsssqssqsqssqqqsqqqqqqsssqsqssqsssqssqsssqqqqsqqqqqqsqsssqqqqssqssqqsqqqsssqssqssqssqqsssssqqqssqqqqsqsssqssqqsqsqqsqsqqssqsqsqssqsqsqqqsqsqqqssqqsqqssqssqsqssqqsqssqsqqsssqqqqqsqsqsqqsqssqssqqqsssssssqssqsqqqsqsqssqqqqsssqqqqqsssssssqsqsqsssqqssssqsssqsssqsqqssqssqsqsqsssqsqqqqqqqqqqqqsqqsqqqqqqsqsssqssqsqsssqsqsssqsqqsqsqqsqsqsssssqqsqsqssqssqssqssqqqqqsssqsssqqqqssqsqqqsqssqqqssqqssqqsqqsssqsqqssqqqqqssssqsqsqqqsqqqqqsqsssqsssqssqsqsqsqssqsqssssqsqssssqqsqsssssqqsqsqsqqqqqqsqqqsqssqqqqssqqqqqsqsqqsqqsqsssqqsqsqsqssqssqqqssqqsqssqssqsqsqqssssqqqqqssssqqssqsqsqqsqssssqqqsqsqqqssssssqsqqqsqsssqsssssqsqsssssqqqqsqsqssqsssqqqqssqqsqsqqsqqssqqqqssqsssqsqqqqqsqsqqqqqqqqssqssqsssssqqsqqssqqqqqssqsssqssqqsqssqqsqssssqqssqsqssqqqsssqqsssssqqssqqsssssqsqqssssssqsssqsqsqsqssqqsqqsqssqqqqqqqssqqsqsqqsqqqssqqsqqssqsqqsqqqqssssqqqqqqqssqsqqqqsqqsqqsqssqqqssqqqqqqqqssqqssqqssqsqqqsqsssssqsssssssqqsqsssqqqssqssqsqqsqqsqqsqssqsqsqsqqsssqqqsqqsqqssqssssqssqqqqqqssqsqqqqqqssssqqssqsqsqqqsssssssssqqqqsqqqqssqqsqssqqsqqqsqsqqsqssssqqqqssssqssqqqqqqqqqqssqsssqqsqsssqsssqqqqsqsqqqqsqqssqsqqqqqsqqssssqssqqssqqsssssqqsqsqssqqsqqssqsqsqssssqsqqqssqssqsqsqqsqqqsqqssssqsqssqqsqsqqqsssqqssqqsqsqsqsqsqssqqsssqsqsssssqsssssqssqsqsqqqqssssqssssqssqqqssqsqqsssqqssqqqqsqsqqsqqqqqqqqqqsssqqsqssqqsqsqsqssqsqsssqsqsssssqsqssqqssqqqqssqqsqqqqqsqqqqqqqsssssqsqsqssqqsqqsssqqsssqsssqsqqqssqqqsqqqqqqqssssqssqssqssqsqsssqssqqqqsssqqsssssqsssqsqsqqssqqsqssqsqqsqsqssqqssqsqqsqsssqsqqsqssqqssqssqssqsqsqqqsqqqssssqssssqqssssqsqsqssqqqsqqqssqqqqsqsssqqssqqssssqssqsssqssssqsssqqsqsssssqsqqqsssqssssqssqqssssqqqqsssqqqqqsqssqqqqssssssqsqqqqssqqsqqssqsqqsqssssssqssqqsqqqssssssqssqqsqqqqsqqqqssssssqsqqsqqsqssqsqqqqqqsqqssqqqssssssssqsssssssssssqqqqsssqqssqqsssqqqqqsqsssssqqsqssqqsssssqsssssqqqqqqqssqqssqqssqqqqqsqsqssqqqqsqsssqqqssqqsqqsqqssqqsqqqqqqsqqqqsqsqqqsqqssqsssqqsqsqqsssqsqsqsssqqssssssssqsqqqqssqsssqqsqsqqsqsssssqsssqqsqqssqsqsqsqqsqsqqqsqqqssqqssqqsssqsssssssqqssqqqsqsqssqsqsqsssqsssqqqsssssqsqssssqsssqssqsqssqsqqsssqsqqssqqssqssqqqsqsqsssqqqsqqqqsqsqsqqqsssssqsssqqqsssqsqssssssqqqqsssqsqssqqsqqsqqssqqqqqssqsqssqsssqqqqsqqqssqqqqqssssssssqqsqsqssssqsssqsqsssssqqsssssqqqqqqsqsqsssssqsqqqssqsqqsssssqqqqqqqssssqsssqqssqsssqqsqqsqqssqqqqssssqssqssqsqssqssssqqqssqsssssssqqqqqqssqsqsssssqssqqsqqqqqssssqsqsqqsqsqqqqssqqssqqsqqsqssqqqssqsqsqssssqsssqqqqqqqssqsqqqqssqsssssssssqssssqqssqqqsqqqqssqsqqqqsqssssqqqqqsqsqssssqsqsqsssqssqsqsqsssqsqsssqqqsqsqqqqsqsssqqsqsqqqsqssssssqqqsssqsssqqssssqsssqsqssqqqssqqqsqqsqsqssqqsssssqqsqqsqqqsqsqsqsqqqqsqssqsqqqqssqsqqqssssqssssqqssssqqqqssqsssqqsqssssqqsssssqsqqssqsqssqqqsqqssqsssqqssqsssqqssqqqsssqqssqqsssqqsqssqqsssqssqqqqsssqqqsssqqssqqsqqqqqssssqqsqsqsssssqqssqqqssqqssqqsqssqsqqqqsqqqqssqqqqsssssssssssqqqsqqqqqqqsqqssqqssqsssssqqsqsssssqqqqssqqqqqsqqqsqsqssqqqqsqqssqqssqssqqqsqsqsqsqqsqqssssqsssqqqqqssqqqsqsssqqsssqssqsqqqqsqsqqsqsqsqsssqqssssssssqqsqsssqsqqqqssqsqqsqsqsqsqsqqqqqqqsssqsqqqssqqssssqqsqqssqssqqqqsssssqqqqqsssqqqsqqssqssqssqsqsqqqqssqsqqsqsssqqqssssssqsqssqsqqssqsssqsssqsqqsqqsqqsqsqqqqqqsqqqqsqqsqssqqssqsqqqqsssqqsssssqsqssqssqsqsssqqssssqqsqqqsqsqqsssqqsqqqqqsqsssssqqsqqqqqsssqsqsssssqsssqqqqqsssqqsqsqsqssqqssqsqsssssssssssqqssssqsssssqssqssqqqssqssssssqsqqqqsqssqsqsqqssqsqsqsssqqsqsssssssssqqqssqqsqqssssssssqqqsssqqqssqssssqsqsqsqssqqssssqsqqqssqqsqsqsssqqqqqqsqqqsssqqqsqsqssqssqsqssqsqsssqsqqsqqqqssqsssqqssqqsqqsqqqqsqqssqqssssqqsqqqqssssqqsqqsqqqqqssqssqsqqsssqsqqqqsqqssqqsqsqsqsssqqqqsqqsqsssssqqssqsssqsqqqqsssssqqsssssqqqqqssqsqssqsqqqqqqqqqqssssqsqssssqqsqsssqssqsqqsqssqsssssqsssqsssqsqsqqsqqsqqqqqqqqqsssssssqqqqqssqqqsssssssssssssqqsssqsssqsqsqsssqqsqsqssqqsqqsqsssssqsqqqqssqssqssqsqsssqqsqssqqqqssqsssqssssqqssqqsqqqqqqqsqqqqsqqsssqqqsqsssqqqqqssqsqqqqssqqsqsqqsssqsqssqqssqssqqqqqqqsqssqssqqqqqqsqssqssqsqsssqssssqssqsssqqsqssssqqqqqssqsssssssssqssqsqqsssqqqqsqsqqqsqqsssssqsqsqqqqqsqqsqqssqqssqsqssqsssssqsqqqqqsqqsqssqqssqqsssssqsssqsqqsqqsqqsqqqqqqqsqsssqsqqqsssssqqsqssqssssqqqqsqqssqsqqsqsssssqsssqqqsssssssqqqsqsqqqsssqqqqsqsqqsqssqqssqqssqsssqqsqssqqssqsqqsqssqqqqsqsqsqqqsqqqsqsqqqqssqqsssssqsqqssqqqssqssqsssqqqssqsqsqssqqsqqssssqqqqqsqsqqsqqqsqqsqsqssssqsqssqqssqqqsssqqqqsqsssqqqssqsssssssqssqqsqsqqqqsssqqsqqqssqqqqsqqqqsqqqqsssssqqssqqqsqqsqsssqqsssqqqqssqqsqsssqqqsqssqqqqqqqsqqsqssqssssssqqqsssqssqqqqqqqsqqssqqsqsqqsqsqqsqsqqqqqqqqqssqssqssqqsqqsqssqqqqqssssqssssqsqqsssqqqqqssqqqqqsqsqsqssqqsqsqqqqssqssqqqqqsssqqqqqqqqsssqsqsssqssqsssqsqsqqsssssqsqsqsqsssssssqqqqqqqqqsqqsqsqsqqqqsssqqqqssqqqsssqqqqssqsssqqsssqqqqqssqssssssqqqqqqqqqqqqssssqsssqqsssssqssssssqsqqsqqqqsqqssssqqsqssqssqsqqsqsssqqsqqqqsqssqssqsqqsqqsqsqsqqsssqqqsqsqqqqsqssssqqsqqqssqqssqsssqqqqqsqsqssqqsssqsssqssqqqqqsqqqqqqqssqssssssssqsqqqqsssssqqqqqqssssqqsqqssqqqssqssqqqsssssssqsssqsqsqssqsqqsqqsqqssqssqsqqqqsqqssssqsqsqsssqqqqssqsqsqsqsqsssqqsqqqqssqqqqsqsqssqqsqqssqqsqqqsssqqsssssqsssssqsssqqsqqqssqssssqqqsqqqqqsqsqsqqqqssqsqsqqqsqsssssqqsqqssssqqssqqqqsssssqqsqsqqqqsqsssqqqssssqqqssqqqssqssqssssqqqsqqsssssssqqsqqqqsqsqsssqqqsqsqqssssssqssqqsqsqqssssssqssssqsqqssqsqqsqssqsqsssssqqssqsqqsqqqqqqqsqqqqssqqsqqsqsssssqqqqqqsqsssqqsqsqsssssssqsqssqqqqqqqsqsqqsqssqqqsssqssqqssssssqqqsqqsqsqqssqqsqqssqqsqqsqsssssqqsssqqsqqsqqsqsqsssqqqssqqsssssqqsqqsssqqsqqqsqqsqqqsssqqssssssqqqqqqsssqssqqsqqssqqsqqsqsqssqsqqsqqsqqssqqqqssqqssqqqqsqsqsqqqqqssqqsqsqqqqsqqsqsqsqsqsqqqssssqqqqqqssqsssssqqsssqqqsssqqssqqsssqssqqsqqqsqqsqsqqsqssssqssqsqsssqqsqqsqqqssqqqqqqqssqqqqsqqssqqqsqsqqqsssqqqsqqsqsssqssssqqqqsssssqsqqsqqqqsssssqqqqsqssqqqsqqssqqqqqqqqssqsssqsqqsqqqsqssqsqqqqsqssqqqsqqqsqssqqqssqqqsqsqqssqsssqqqqqsqqqssqqqqsqqsqssssqqqsqsqsqsqqsqqssssqssqssssqqqsqqqsssqqssqsqssssqqssqqsqqqsqsqqqsssqsqqqsssqsssssssssqsqssqqsqssssqqqssqsqssssqqqssssssqsqqqsssssqsssqsssqqsssqqqqqqqssssssqssqsqsqqsqqqqqqqssqsqqssssssqsqsssqqqssqqssssqsssqsqssqqsqsqsqqqqsqqsqsssqsqsssssqsqqqssqqsssssssssqsqssqqqssssqqqqsqqssqssssqqqqqsssqqsssqqqqqsqsssqsqqqqqqsssqssqsqqqqssqsssssqsssqqssqqqsqqqqsqqqqqsqsqssqsqsqqqqqssqqsqqqsqqssqqqqsqsssssqsqqssqsqqqqsqssqqqsqsqsqsqssqssqsssqqsqqqqqsqqqqqsssqssqqqsqssqqqqqssqsqqsqqqsqsqsqqssqsqssssqsssqqqsqsssqsqqqsqsssqqsqqqqsqqqssqsssssqssqssqqqqqqqsqqqsqsqsqqqqsqsqqsqqqssqsssssqsssqsqqqqqqsqsqsqqssqqsqqqssqsqsssqssqqqssssqssqsssqsqsqqssssqqqqqqsssqqqqsqsqqssqsqssqssssqqsqqsqssqqqsqqqssqqqqqssqsqsqssqsssssssqqqsqsssqqqssssqqssqssqsqsqqsqqsqsssqsqssssqsssqqssqssqsqqsqsqqsqqsqqssqqqsqqqsssqssssssqqsqqqsqssssqqqqsqqsqqqqsqqqsqqqsqqqqsqssqqssqsqqqssqsqqsqsqsssqqsqsssssqsqqsqqsqssqsqssqssqsssqqsqsqqqsqqssqqssqqqssqsqqsssqqsqqsqqqsqqqsqqsqsqqqqssssssqqqqssqssqsssqsssqsssqsqqqssqqqqsssqssqqsqssqsqsqsqqqsssqsssssqqsqqsqqqssqqsqqsssssqsqqsqsssqqqsqqqsqsqssqqqqqsqqsqqqsqsssqsssssqsqqqqsqssqqsqqqssqsqqqqssqsqsqsqsqssssqqssssqssqsssqssqssqqsqqqssqqsqsqqssqqssssssqsqssqqqqssqqsqssqssssqqsssqsqsssqqqqqssqqsqsqqsqqqssqqsssqqqqsqsqssqsqqqqqsqsqssqsssqsssqsqssqqqqsssqsqqqqsqssqqssssssqqqsqqqsqsqsqsqsqssqqsqqqqqsssqsqsqqqssqsqsqqqsssqsqssqqssssqqsqqssqqsqsqssqqssssqsqssqqqqqsqsqqsssqqqssqsqqssssssqqqqsqqqqqqsqqssqsqsqqqssssssqqsqqsqssssssqqqssssssqssqsssqsqsqqsqqsqsssqqqqsssqqsqsssssqqsssqsssssqsqssqsqssqssqssqqqsqqqsqssqssssqssqsssqqqsqqqsqssqssqqqqsssqqsssqsqsssqqqqssqqqqsqssssqqqsqsqqssqqssqsssqsqsqssqqsssssqssqsqqqssqsqssssssqssqsqsqsqqssssqsqssssqsssssqssssssqsqqsqsssqsqsssqqqsqsssqsssqqqssqqssqssqsqqsssssqsssqqsqsqsqsqsqqssqqsqqqsssqsqqqsqqsssqsssqsssqsqsssqqssssqsqsqqsqqsqssqssqqqsqqqsqqqssqsqqsqsssqssqqssqssqssssssssqqqssqqqqsqqssqssssqqsqqqqssqssssqqqqqqqqqqsssqsqssqssqqsssqqssqsqsqsqsqqqsqsssqsssqsqqqqqqsqqssqqqsqssqssqqsssqsqqsqsqsssssqqqqsqsqqqqqssqqsssssqsqqqqsqsqqqsqssqqqsqsqqssssqqqsqqsqsqqqqqqsqqqsssssqsssqqssqqqsssqssqssssqqqsssqqssqqqqqqqqqqsqqsqqsqssssssssqssssqsqsqssqqsqssqsssssqsqssqqqqqqsqqsqqqqsqssqsqqsqqsssqqqqqsssqqqqsssqsqssqqqqsqsqqqsqqsqsqqsqqsqqqsssqsssqqqqssqsssssqqssqqqsqqqqqsqqqssssqqsssqsqqssqqqqqqqqqqsqsssqqsssqssqsqqqqsssqsqqssqsqsssssssqqssqqsqssssssssqqsqssqqqssqssqsqqssssqsqssssqssqqsqsqqsqsssqqqsssqssqsqsqqqqsqsqsssqqqssqsqqqqssqqsqqssqsssssqsssqqqqqqsqssqqsqsqqqssqqsssssqssssqsssqssssqqqssqssqsqqqssqqsqqqqssqqssqsqssqqqsqsssqqqqsqqqsqqqssqsqqsssqqqsqssssqqsssqssqqssssssqqsssqssqqqqsqqqqqqssqsqsqqsqqqsssssqssssqsqqsqqqsssssqqsqqqqqssqqsqqqssqqqsqqsqsqqssqssqqqsssqqsqqssqqsqsssqssqqqssssqssqsssqsqqqqqqsqsssqssssqssqsqqssqqsqqssqqqssqqqsqqsssqssqsqssqqqssqqsqssqqqsssssqsssqsqqqqsssqsqqsqqsqqsqsqssqssqsqqssssssqqqqqqssqsqqqqqqssqsqqsqqssqsqqssqqqssqqsssssqsssssqqsqqqsqqsqsqqqsssqqqqqsssqqqssssqqsqsqqqqqqsssqqsqqsssqqsssqqssssssssqqssqsqqsqssqqqqsqqqsqsqssqssqsqsssqqqssqsqsqqsqqsqqssqsqsssqsqsqsqsssqsssqqssqsqqssqqqqqqsqsqssqqqsqssqssqssqsqqqsqqssqsqqqsssqssqqsqqqqqqqqsqqssqqsqssqqqsqsqsqsssqsqqqqqqsqsssqsssqssqsssqssqqqqsqssssqsssqssqqsqsqqsssqsqqqssqsqqqssqqqsqsqsssqsqqqssqqqsqsssqqqsqssqqsssqsssssqsssqsssqssssqsqqqqqqqsqqsqssqqqsqsqsqqqqqsssssssqqqqqqqqssqsqssqsqqqqqqssssssqqsqqqsqqqsqsqsqsqsssssqqsssqsqqsqqqqsssqqqssqssqssqsssqssqqqssssssqqssssqqqqqqssqqsqssqqqsqqsssqsqsqqqsqssqqqqqsqqqqqqsqsqqqssqqsqqsqqqsqsssqqsqsqsqqsqqssqqsqqqqqssqqqssssqqssqssqssssqqqqqqssqqssssqsqqqsqqsqsssssqsqqssqqsqqssqqqsqqqqqqssqqqqsqqqssssqqqqqqqqqqqsqsqqsqsssqqqsqsssqsqqqsqssssqqssqqsqqqssqsssssssqssqsssssqqqqsssqssqqssqssqqsqqsssqsqqqsssqsqssssqsssqqqqqqqsqssqqqqssssqqqqsqqssssqsqssssssssqqsqsqqqsqqsqsssqssssssqssqssqqssssqqssqqqsqqsssqqsqqqqqssqqqsqqsssssqqsssqsssqqsqsssqqsqqsqsqsssssssqsqqqqsqsqqsssssqssssqqssqssqsqsssqsqsqsssqqqsqsqqqqqqqqqqqssqsqsqsqsqsqqqssqsqqqqsssssssssqqsssqsssqsqqqqsqsqqsssssssqssqsssqqssssqsqsqqsqsqqqqqsqsqssqqsqqsssssqqqqqqqsssqqssqssssssqqqqqsssqsqqqsqqsqsssssqqsqqssssqsqqqsssssssssqqqsqsqqsqqsqqsqqsqqsqqssssqsqqsqqqqsqqqqsqsqsqqqsqqssqsqssqqqsqqsssqsqssqsqqqsqssqsssqssqsqqssqsqqqqssqsqqqqqqsqqsqsqqsqqsssqsqqqsqqssqqssqssqsqqqqsqqssqssqqqsssqqsqssssqqqssqqqqsqqsssssqqssqqssqqsssqqqqssssqsqssssqqssssssqsqqqqqsqssssqqssqssqsssqsqqqqqsqqsssqsqsqsqqqqqqsqqssqqsssqsqssqsssqqssssqqsqqqqssssqsqqqssqsssssqqsqqqsqssqqqqqsqqqsssqqqqssqqsqqqqssssqqssqqssssqsqqssqqqqqsssqqqqsssssssqssqsqqqsqssssqsqssqsqssqsqsqsqssqqqqssqqsqqssssqsqsssssqqqsqssssssqssqqqssqqqssqqqsqsqsqqqsqqqsqqqqqsqsssqqqsqqqssqsqsqsssqqqqsqqqsqqsqqqsssssqssqssssqqqssqqssqqqsqqqsqqqsqqsqsqqsqsqssqqqqsqqsqqqqqqqsqqqqqqqsqqqqqssqsssqssqsqqsqssqqqsqsqqqqqqqsqqsqsqsqqqqqsssqssqqqsqssqsqqqqqqsqqqqssqsssqqqqqsqsssssssqsqssqssqqsqssqqsssssqssqsqqqqqsqqqsssssqqssssssqqqqsqqssqqqsqsqqsqsqqsssssqsqsssssqssssqssqqqqssqqssssssqsqsqsqqqqqqqqssssqqqqsqsssqqssqqsqsssqsssqssssqqqqsqqqsqssqsqsqqqqsqsqqqqqqqqqqssqqsqqssssqqssqsqqqsssssqsqqqqqssqsqqqqsssssqqsqqssqssqqqqsqsqqqqqqsqqqqsqqssqssssqsssqqqssqqsqqqssqqsqssqqqsssqssqqqqssqqsqqsssqsqqqqsssqqqsqsqqqssqqqssqqssqqqsqsqqssqsqqqsqsqsqssssqsqqqssssqsssqsqqqqqqssssqsssqqssqsqqssqqsssqqqssqqqsssssqqqqsqssqqqqqsqqqsqsssqssqqqsssssqqqssqssqsqqsqqssssqqsqsqqsssqqqqssqqqqqqqqsssqqsqqqqqsqqsqsqqqsqsqqqqqqqsqqsqqsssqqqqqqqsqsqsqqqsqsqqssqqqqsqsqssssqqsqqssssqqqqssqsqsqssssqsssqsqqqqssqqqsqqqqqqsqqqssqqssqqssqqqssqsqsqqqqsqqqssssqqqssqsqqqqsqssssqssssqsqqqssqqsqsqqqsqssqsqsqqsqsqssssssqsqsqqqsqqqqsqsssqqsqqqssqsssqsqsqsqssssssqqqsqsqssssqqqsssqqqqqssqsqsqsssqqsqqsqqqqsssqsqsqqsqqsqqqqsssqqqqqsqqsssqssqqqqsqsqsssqsssssssqsssqsssqqssqqqqsssqqqqsqqssssqsqqqqsqssqqqsssqssqssqqqsqqqssqsqssssqssqsqqssssqsqqsssqsqssqsqsqsssqsqqqqqssqsqqqqqsqqqssssqssqqqqqqsqqssqqsqqssqqqqsssqqsqqqsqqsqqsssqqqqsqqqqqsqsssqsqssqqqssqsqqssqsqsqqqssqssqssqqqsqqqqqqqqqssssqssqqsqsqsqsqsssqsqqssssqqqsssqqsqsssqqqqqqqqqsqqsqqssqsqsqqqqqssssssssssqqssqssqqsqsqsqqqssssqqqsqqqsqsssqqssqssqqqqsqqqqssssqssqqssqqqssqssqssqqqssqqqqsssqqqssqsqsqqsqsssssqqsssqqqqsqsqqqqqqssqsqqsqqqqqsqsqqssssqqsqqqsqqqssqqqsssssqqsssssssqqssqsssssssqssqssqsssqssssqqsqssqqqsqssqssssqqqsqssqssqsqsssssssqsqqqsqqsqqsqqqsqssqssqqqqssqsqqqsqsssssqssqqqqqssssssssqqqqqqssqqqqqsqsqssssqsqqqssqqssqqsqqqqssqqqsqsqsqqssssssqsssssqssqqqqsqqqsqqsqsqqqqqqsqqssqqsqqqsssqssqssqqssssqqqssqqqssqsssqqqqqsssssqssqqqqssssqsqqsqsqqssssqqsqqqqqqqqqsqqsqsssqssssqssssqssqqsqssqqqqqsssssqqqqssssqqsqqqsqsqqssssqqsqqqqqqsssqssqqsqqsssssssqsqsqqsqqsqsqqssqqqqqsqsssqssqsqqqqsqsqqsssqqqqqqsqssqqqqsssqqqqssqqqqssqqqqssqqsqsqqssssssqssqsqssqssqssqsqsqqqsqqsqqqqqqsqqqssqqssqqqsssqsqqsssqsssssqsqsssqsqqssqsqsqqqsssqssqsqqsqqqqssqqsssqqsqsqqqqqqqqqqqqqsssqssqqqsssqsqsssqqqsqqsqssssqsqsqsqssqqsqsqqsqqssqsssqsqqsssqqsqqqsqqsqsqsqsqsssqssssqqssqqqqqsqsssqqssssssssqqqsqsqqsssqsqqqqqsqqqqsssssssqqqsqqsqsssqsqsqqqqsqssqssqqqssqqqssqsqqqsssqsqssqqsqsqqsqqssqsqssssqqqssqssqqsssssqqsssqssssqqqqqssqqqqsqqssqqqsssqqsssssqqssssqqqsssqssqsqsssssqsqqsqqsqqqqqqsssqsqqqqsssqssssssqqsqssqssqsqssqsqsssssssssqssqqsqqssqsssssqssqqsqsqqqqqqqsqssqsqsqsqsqqqsssqqqsqqqssssqsqsqqsqqsqqqsqssqqqsssssqqqqqqsqsqqqssssqqqqssqqqqssqssssqsssqssqsqqsssssssssqssqqssqqssqqqssqssqsqqssqsqsssqqqqqqqsqqqsssqqqqsqqqqqqqsssssssssqqqqqqqqssssqsqqsssqqsqssqqqqsqqsqsqsqqqssssqqsqssqqsqsqqqqqsssqsqqqqqqssqssssqqqqsqssqqssssqsqssssssqqsqssqssssqsqqssqqqsqqssssqsqqsqqqqsqqqsqssssssqsssssssqqsqsqqssqqqssssqqqqqqssssssqsqqssqqsqqsssqqssqsqqsqsqqqssqsqsssqsqqsqssqssqsqqqsqqqqsssqqssqsqssqqqsqqqsssqqqsqsqqqsqssqqssqssqssqqsqsqsqsqssqqssqqsqqqsqqqqssqsqqqsqqqqqqqqqssqqsssssqqqqsqsqqsssqqqqsqsqssqqsqsqqssssqqqqqssqsqqsqqqsqqssssqsqqqssqqqqqssqssqqsqsqsqqsqssqqqssqqqqsqqqqsssqqqsqqqsqqsssssssqssqqqssssqqqsssqqqqssssssssqssqqqqqqsqqqqssssqqsqssqsqsqqssqsqqssqqsqssqqssssssqssqsqqqsqssqsqqqsqssqsssqsqqqssqsssssqqqqqsssqsqssqsssqqsqsqsqsqssqqqsqqssssqssqqssqssqsqqsqsssqqssqsqsssqsqqsqsssqqssqqssqssqsqqqqqsssqqsssqqqqqqqsqsqssqqsqsqssssssqqqsqqqssqsqqqqqsqqqsqqsqqsqqssqqssssqssqssssqqssqssqssqsqsssqsqsssqqqqqqsqssqsssqsqssssqsqqsqssqqsqqssqqsqsssssqqqsqsqsqsqssqsssqqqssqqssqqqqqqssqqssqssqsqssqsqqqssqqsqssqqsssqsqsssqssssssssqssssssssqsssqqsqqssqqqsqssssqssqqsqqqsqsqsqqqqsssqsqsssqqqqqsqqssqqsqqsqqssqqqsssqssssqsqqqsqqqqsssssqqqqqssqqssssqsqqsqqqqssssqqssqqssssqqqqqqsqsqsqqsqqssqssqssqsqqqqsqsqsqsqsqssqqsqsqssqqsqqssqqsqsssqqqsqqqsqsqsqqsqqqqsqssqqqsqqsqqqsqsssqqssqsqqsqssqsqsqqssssqqsqssqsqsqqqqsqssqqqqqqqssssqqqqsqsqsqsqqsssqsqssqsssqqsqqqsqsqsqsqssqsqssssqqqsqssqqqqsqsqssqqsssqqsssqsqsqqqsqsqqssqsqqssssqssqqssqqsqqsqsqqqqsqsqqssqqqqqsqqqsssqsqssqsqqqssqqssqqsqqqqqssqqqqqssqqqqqqssqsqqqsqqssssqqsqsqqsqsqsssqsqqqqqsqqqssqqqssqssssqqqsqqqsqqqqsqssssssqqqqqqsqssqsqsqqsssssqqqqsqssqqsqssssqqsssssqsssqqqqsqqqqsqqsqqqsqqsqqqsssqqqqsqqsssqqqqqsssssqsqssssssqssssssqsssssqqqsqqqsssssqqqsqssssssqqssqqsssqqsqqqqqqsqqsqqssqsssssssqsssqqsssqsssssqssqssssqsqqsqssqqssqsqqsssqqqssqssqssqsssqsqqqsqqsqsssqqqqqsqsqqsqsqsqssqqqqqqsqsssqsssssqsqssqqsqsqqsqqqsssqssqsqqsssqsssqqqssqsqssqsqsqssqqqqqsqsssqqqqqqsssqqqssqqsqssqsqqqsssqqqqqsssqsqqsqqqssqqqsqsqqsqsqqsssssqsqsssqqsssqsqsqqsqqqsqqsssqsqsqqssqsssqqqsssssqsqqsssssssqsqqqsqqsqsssqqsqssqsqqsqsssqsqqqsssqssqssqqsqqqsqqsqqqqqqssqsqsqsqqsqqssqqsqsssssssqsssqqqqqqssqqqsqsqqsqssqqsqqqsssssqqqqqsqqqqsqqqssqssqsssqssqssqqssqsssssqqsqsssqsssqqqsqqssqqsqssqsssqqssqsqqqqqqqsqsssqqqqssqssqqsqsqqsssssqsqqssqssqqqsqqqqssqssssqsqqssqsqssssqqssssqsqsqqqsssqqsqqsqqqqsqqssqqsqqsqqssqqssqqsqqqqssqqssqqsqqsqqsqqssqsqqssqsqssqsqssqsqqsqssqqqssssqqssqssqqssqqsqssqqqqsssqsqsqqssqsqqsqsqsqqssqqsqqqsqsqqqqsssqqsqqqssqsqqssqsqsqssqsqqssqsqsqsqssssqsqqsqsssqqssqqsssqqssqqqssqqqqssqqsqsssqssqssssqqsqqqqqqqssqsssqqqqsssssssqsqqqqsqsqqssssqsqsqqssssqssssqsqqsqssqsqqqsqqqqqsqsqssqsqqqqqqqssqqqqqqqqqssqqsqsqsqqsssqqqqsqqsqqqqqqssqqqsssqqqqqqsqqsqqqqsqsqqsqqssqsqsqqqqqssssqqsssqqssqssssqqssssqqqqqsssqsssqsqqqsqssqqsssqqqsqssqsqqqqssqqqqqsssqqqqqsqqssqqqqsssqqsqssqqsqqsssqsqsqqqqsqsqqqqsqsqqsqqqqssssqqqsqqsqsqqqqqsqssssssqqqsqsqqqsqsqsqsqsqqssqsqqqsqssqqsqssqqqqqssqsqsqqqqsqqsssqqqqsqssqqqqqqqssqssqqqsqqqsqqsqssqqsssqqsqsqsqssqssqssqssqqqsqssssssssqqqssqsqqqqqqsssqsqqqqsqqsqsqsssqsssssqssqqssqqqsssssqqqqssqqqqsssqsqqssqqqsqsssqqqsssqsqqqssqqqsqsqqsssssqqsqqqsqssssqsqssqqqssssqqsqqsqsqssqsqssqqqqqqqqssqqqsssqsqqqssqqqsqqqsqsqqsqssssqsssqsqsqssqsqqsssqssqsqsqsqssssssqsqqqsqqqssqqsqsqqqssqsqqqqsssqqqsssqsssqssssssqqqqssqsqsqqqqsqsqqqqsqsqsqqqsqqsqsqqqqqsqsqqssssssqssqssssqssqqqqsqssqqqssssssqqsssssqqsssqqssssqsqsssqssssqsqqsssqsssqsqqsqsqsssqsqsqsqsssqsqssqssqssssqssqsqssqqqqssssqssssssqqsqsqqqssqqsssqssqsqsqqqqsssqqsqsqqssqqqqsqsssqsqqqqqqqsssqssqqsssqsqqsqssqqqqsqqqqqqqqssssqqsqqsqsssssqqssqqsqsqqsqqqsqsqqqsssqqssqssssssqqqsqqqqqqsqsqqqssssqsqsqqssqsqsssqssssqqqsssqqqsqsqsqqqqsqqqqsqqsqsqsssssqqssqssqsqqqssqqsqssssqsqsssqsssqsssqssssqsssssqssqqsqssqqqssqssqqssqqssqqqsqqssssqqssqsqqqsssqqsqsssqqssqsqqqsssssqsssssqqqqsqqqqssqqsqqsssqqssqqssqsssssssqqsssqqqqssqsqqssssqqqsqqsssqssqqsqqqqqsqssssssqqssqsqqqqsqqsqqssqqsqsqsssqqqqsssqssqsqqsqsqssqssssqsqqsqqssssqsqssqqqsqsssqqqqsqqssqsqqsqqqsqqqqqqqsqqqqsqqsssssssqqqqsssqsqsqqsqqssqqssssqsqsssqqssqqqqqsqqsssqqsqsqsssqssqsqqqqqssqqqqsssqqsqssqsqsssqsqqqqssqssqqqssqqsssqqqqqqqqssqqqqqsqsqqsqssqssssqssqqqsqsqqsqqqsqsqsqssssssssssqqsqsqqqqqqqsqsqsqsqqsssqqqsqsqsssssssqsqsqqssqqsqqsqqsqqsqsssqssqqsqqssqqqssqqqsqsqssssqqssqsqsqqsqsssqsssqsqsqqqssssssqsqqqsqsssqqsqssqqqssssqqqqqsssqqsqqssqssssqqqsqssqqqsqssssssqsqqsqqqqssqsssssssqsqsqssqqsqqqssqqsqsqqqqqqssqqsqqqsqqqssqsssssssqsqssqqqsqsqsqsssqqsqqsqsqqsssqssqsqsqssqssssssqqqssqssqsqsqsssqsssqsqsqqqqsssqqqssqqqssssqsqqqsqqsqqqqqsqqqssqsssqqqqqqqsqqsqssssqsqqssqsqqssqqssqqqsqqqsssqssqssqqsqsqqqsqsqqqsqqsssqssqqqsqsqqqssqsqsssssssqsqqssssssqqsssqsqsssqqsqqsqqsssqsqssqsqssqqqqqsssqssqssqqqqsqqsqqssqssqqqssqqsqqssqqssssqsqssqqqsqssssssqssqssssqqqsqsssssqqssssssqsqqqsssqssqqqssqqqqssssqqqqqsqsqqqsqqqqsssqqssqsssqssqssqqqssssqqqssqsqqqqqqsqqssssssqsqsqssssqqqsqsqqssqqqssssqqqqqsqqssqsqsqsqssqsqsqqqqqqsqssssqqssqqqssssqsssssqqqqsssqqssssqssqssqqsqqssssqssqqqssqssqqqsqqqssqqsqqssqqsqsqssqsqsqqsqqqssqqqssqqsqsqqqqqqsssqsqqssssqssqsqqssqqssqqqsqqqsqsqsqqssqqsqssssqqqqqqqqqqqqqqqqsqsqqsqsqqsssqsqqsqqsqqsqqqssqqqqsqssssqqsssqsssqqsqqssssqsqqqqssssqssqqqsssqssqqqqsqsqsssqqqqqssqssqqqqqqqssqqsqqqssssqssqqqqqsqssqsqssssqsqsqssssqssqsqqqqssqssqqqssqsqssssqsssqssssqqqssqqqssssssqqqqssqsqsqsqssqqsqqssqsssssqqsssqssqsqsssqssqssqssssqsqsqssqsssssssqssqqssqsqsqssqssqqsqqssqqsqqssqqqqqssssqqssqqqsqqqqqssqsqqqqssqqqqqsssqsqsqqqqqqsqqqqsqssqssqqqqqsqssqsqqsqsqqqqsqqsqsqqssqqqsqsqsqssqsssqssqsqsqqqsssqssqqqssqqqqsssssqsqqsqsqsssqqsqqqqqssqsqqqsqqqqsssqqqqqqqsqsssqqsqsqqqqqqqsqqqqsqqssqqsqsqsqssqqqqsssssqsqqsqssqqqsssqsqqqqsqsqqsqsqqsqsqssssqssssqsqsqqsqqqssqsqqqqsssqssqqsqsqsqssqsssqssqqsqsqqqqqqssqsssqsqssqqsssqsssqsssqsqqsqsqqqqqqsqqqsqssssssqqsqqsqqqqqqqsssqqqsqqsssqsqsssssqssqsqsqqsqsqqssqsqssqqsqsssssssssssqqsssssqsqqqsqqsqqqsqqqqqsqqqqsssssssqqqqsqqsssqsqssqqqqssqsqsqsssqssssqssqsqqsqqqssqssqqqsqsqqqsqqqqsqsqsssssssqqssqqqssqsssssqsssqqqqqsqsssqqqsqqsqsqssqssqsqsqssqssqsqqqqqsqqqqqqsssqsqqsssqqqqssqsqsqsqqqsqsqqsssssssqqqsssqsqqsqqqqsqqsqqsqssqqqqsqsqsqqsssqqqqsqsqqqsqssssssqssssssqqssqssqqqqssqqssqsssqqsqsssssqsqqsssqssqsqsqqsqssqqqqsssssqsssssssqsqqqqssqqqsqsqssqqqsssssssqssqqqssqsqqsqssqqqqqsssssqqqqssqqssqsqqsqqqssqqssqssqqsssqqqsqqsssqqqssqqsqqqsssssqsqqsqsqssqsqqqssqqqsqqssqsqsqqqqsqsssqsqqsqqqssqqqqssqsssqqqsqqsssqsqqsqqqsssssssqsssqqsssqqqqssssqssqsssqssssssqqssssqqsqsqssssqqssssssssqqssqqqsssqqsqqssssssqqssssssssssqssqqqsqsqqqsssqsssqqqssqqqqqqssqsqsqssqsssqsqsqqsqqssqsqqssqqqqsssqsqsssqsssssqssqsqsssssssssqqqsqqsssqqsqsqssssssqsqqsqsqqqqqqsssssssqsssqqqqsqssqqsssqsqqqqqsqqsqsqssqsssqsqsqssssssssqssssqsqqsqsqssssqssqqsqqqsqqsqqqqqssqqsqssqqqsssqssssssqqssqsqqqqqssqsqsssssqqsqqsqqssssqqsqsqssqsqqqsqsqqqsqqssssqsqssqsqsqqsssqsqqsqsqsssssssssqqqsssqsssqssqqqssssqssqsqssqqssqsqsqssqqsqqqsqsqqqqqqqsqssqqsqsqssqqqsqqqqsqsqsqqqssssssqsqsqssssqqsssqsqqsqqssqsssssqssqsqqsqqsqsqqqqssqsssssqqssqqqssqsssssssqqqsqsqsssqsqqsqqsssssqsqsqsqqsqsssssqssqssssssssqqqqsqqssqsqsssssqqqsqsqqqqqqsqqqqssqssqqsqqssqqssssqqsssqsqsssqssqqqqqqqqqqqssqqsqqsssqqsqsqsqsqqssqqssqqsqqqqsqqsssqsqqqsqqsssqqqqqssqqsqsqsqqqsqqssssqqqssqqqssqqqssqqqsqsqsqsssssqqssssqsqsssssqqsssssqssssqsqqsqqqsqsqssssssssqqsssqqsqqssqqqqqqqqqqssqqqqqqqsqqsqqqqqsssqqqsqqsqqqqqssqqsqqqqsssqsqqsqssqsqqqqqqqsqqssqssqssqqssqsssssqssssqqsqqqqqssqsqqsqqqssssqqsqqqqqssssssqqqsqqsqqqsqqqqqqsssqsqqqqqsqsssqqsssqsqsqsssqqqqqssqqqsqsqqqsqsssssqsqqsqssqqssqsqqqqqssqsqsqqqsssqsqqqqssssqqqssqqsqsqssqssqsqqssqqqsssqqqqqqssqsqssssqqsqqssqssqsssqssqsqqssqqqqssqqqsqsssqsqsssqssqsqqssqssssqqssqsqsqsqsqqqqsqqssqssssqqqsqqssssssqqqqsqsqsqssssqqssqqqqsqsqsqsqqqsqqsqssqqqssssqqsssssssqsqqqssqqqqqssssqssqsqqsssqqqsqqsqsssqssqqsqssqqqqsqssqqsssqqsssqsqssssssqsqsqqqsqssssqqsqqssqqqqsqqqsqqsqqsssqsqqsqqsssqqqqsqqssqsqsqssqqssqqqqqqsqssssqssqssqqsqqqsqqssssqqsqssqqsqsqssqqsqqqssqqsqsqssqqsqqqqsqsqsqsqsqssqqqqsqsssqssqsqsssqsqqqqsqsqssqqqssqqqsqsqssqqqqsqqqsqsssqqsqqssqsqssqssqssqqqsqqqssssssssqqqsqsqssssqssqsqqsqsqssssqssqssqqqqsssqqssqqqssqqsqqsqqsssqqsqqqsssssqqqqqssqqqqqsqssssssqsssssqssqqsssqqsssqqqqqssssqqsssssqqsqsqsqqqqqqqssssqqqssqssssqqqsssqqqssqqsqqqsqqsqqqqqsqsqqsqsqsssqqqqqsqqssqsqsqqqqqsqqqqssqqqqqsqsqssssssqqssqssqqsqqssqsqsqsqqsqqqqqsssssqsssssqsssssqqqqssssssqsqssqqqqqqsssqqqsssqqsqsqqsqqqqqqsqsqsqqqsqqqqssqqsqsqsqssssqqsqqqqssqqsqsqssqsssqssqsssssqsssqqsssqsssqsqqqssqqssssqqsqqqqqsqssqqqqsqsqqsssqsssqsssqqqsqqqssssqqqqsqsssqsssqqsssssqqsqqqqqqqqsssqssqqsqqqqqssqqqqsqqssqssqsqssqsqssqqssqsssqsqssqssqsqsssqsqqsqsqqqqsqqqqssqqsqsqqqqqsqsqqsqsqsqssqqqsqssqqqqqssssqqqqsqsqsqssqqqsqqqqqqqqqqqqsqsqsqssqqqsssqqqssqqqssqssqsqsssqqqssqqssssqqsssqqsqqsqqqqsqssqqssssqqsqsqqssqsssssqssssqqsqsqqssqsssssssssqqsssqqqqsqqqqsqqsssssssqqqqsqqssqqqsssqqsqqsqssqqqssqqqsqssqqqqqqssqqqqssssqssqqqqqsqsqqqqssqqsssqsssqqssssqsqqssqsqqqssqqqqsqsqsqsssqqssssqqqqssqsqqqqqqqqssqqqqssssqqssqqqsqsssqqsqsqsssqqqsqsqqsqssqsssqqsqqsqssqsqsqqqssssssqsqsssqqqqssqqqqsqsqqssssqsqqsqssqsqqqssqsqqqqqsqsqsqqssqqqqsqqqssqsqsssssqsqqqssqqqqsqsqqssqqsqqqssqssqqqsqsqqssqsssqqsqsqqssqssssqsqqqqsqqsssqqqqqqsssqssqqqsqsssssqqssssqqsqqssqqssqqqqqsqqqqqqssqqsqqqqqsqsqsqsqsqqsssssssqsqssqsssqqqqqssqsqqqsqssqssqqqsqsqqqqsssssqqsqsqsqqssqsqssqqssssssssqqqqqsqsqqqsqsqqqqqssqqssqqsqssqsqsssqqssqsqsqqsqsqqsqqqqsqqqssssqsqqsqqqsqqqqsqqssqsssqsqsqqsqsqqqsssqqqssssqqsssqqsqssssqqqsqsqqqsqqqqqqqsqqssssqqqqssqsssqqssqqqqssssqssssqqqqsqqqsssqqqssssssqsssqssqsqqqsqsssqsqssqssssqqsqqqsqqssqsqqqqsqqssqqssqqqqqsssqsssqqsqqsqqssssqsqssssqssqsssqqqqqqsqqsqssqsqqqqqsqsqqqsssqssqsqsqssssqsqqssqqqssqqssssssqsssqqsssqqqsqqsqsqsssqqsssqsqqqqqssqqssqqqqsssqqqqssssqqqssqqsssqsqqsqsqsqsqqssqsqsssqssqssqsqqssqqqsqssqsqqsssqsqqsqqqqssqqsqsqqqsqsqqsqsqsqqssqqqssqsqqsqsssssqqqqqsssssssssqqqqssqqqssqqsqsqsssqsqsqqssssqsqsqqqssqssqqsqqssqsssssssqsssqsssqsqssssqsqqsssqssqqqqqqssqqsqsssqssqqqqsqqsqsqqqsssssqqsqqssqqssqqssqsssqsssqqqqqssqssssssqsqqqqqsqqqsqqqsqsqsqqqqqsqsssqqssqqqqqssssqqsqqqqqsqqssqqqssqssssqsqssqsssqqqqqqqqsssqsqsqqqsqqsqqssqqsqsqqqssqsqssqqqqsssqqqsssqqssqsqssqqqqqsssqqsqsqsqsqqssqsqsqqsqsqsqqssssssqsqqqsqqqqqsssqssqsqqssqsqqqqsqqqqssqqsqsqqsssssqsqsqsqsqqsqssqsssqqsqqsssqsssqqsssqqssqsqqsqsssqssssqssqqqsqssqssqqqsqsqsqqsqqqsssqqqqssqqqqssqqqsqsqqsqsssssssqqqqsqsqqqssqqsssqqsqssqssqqqsqqqsqsssqqsssqsqqssqqqsqssqqqsqqssqsqqqsqssqsssqssqqsqqsssqqsqqqqsqssqssqsssssqssqqqqqqsqqssssssssqsssssqssssssssqsqqqqsqqsqsssqssssqsqsqqsqssqqssqqssqsqqqsqqsqqsqqssqssqqqssqsqqqqssqsqssqqssssqsssssssqsqsqqsqssssqsqqssssqssqsqqqqqssqqsqssqsqqsssqsqqsqqsqssqqsssqqqqssqqqqqssssssqqsssqqsqqsssqssqqsqqqsqqqqqssqqsqssssssqssqsssqqsqssqsqqssssssqssqqqsqqqqsqssqqqqqqsqsqqssqssqqssqqssqqqqqsssssqqsqqssqqsqssqsqsqqqsqssqsssqsqsqssssqssqqsssqsqssqsqqqqqqssssssqsqsqqqsqqsqqqssqsqsqssqqqsqqsssqsssssssssqqqssqsqqqqqqsqssqssqssqsqssqqqqqqssssqsqqqqssssqssssssqqqsqsqsqssqqsqsqqqqsqssqqqqqssssssssssqsqsqsssssssqssqqssqsqqsqqqqsssqqsqssssqsqqsqssqssqsssqqqssqqqsqssqqqqqsqsssqqqqsqqsqqqqsqqsssssqqqqqqqqsqqqsqsqqsssqqqqssssssqsqqqssssqsqqqssqqsssqqsqqsqqssqsssssssqqqssqssqsqqqsqssqqqsqqqqqssqssqqqqssqqqqqqsqqsssqqqssqsssssqsqsqsqssqsqssqqqqqqqqqqssqqqssqssqsqqsqqsqssqssqsssqsqsssqqqssqssqqqsqsqssqsqsqqqssqqsssqqsssssssqssqsqqsqsqsqqqqsqqssqqqssqsqqqsqqsqqqqqsqqqssqssqqqsqqqqsqqqsqsqssqqsqqssssssqssqsqsqqqsqssqqqqqqqqqsqsqqqqqsssssqssssqqqsqssqqqsqqqsqqssqsqqsqsssqsssqqsqssqqqsqsqqqqqsssqqqsqsqqqssqqqqssqssssqqqsqssqqsssqqqsssssqsqqqssssqsqssqqsssqssssqqqqsqsqqssqsqssssqsqqssqqsqsqqsqsqsqssqsqsqqssqsqsssssqqsqqqqsssssqqssqqqqqsqqqsqqqqqqqssqqqsqsqsqsqqsqsqsqqssqqqssqssqsqsqqqssqqsssqsqqsssqqqqqqqsqssqssqqqqqssqqssqsqssqsqssqqqsqsqqqqqsqqssssqqsqssqqqsqqqsqssqqssqsqsssqsqqqsqsssqqssssqqsqsqqsqsqqsqssqsqqssqqsqqssqqsqssqqssqqqssqsqsqssssqqsqsqsqsqqqqsssqqqqqssqqsqsqqqqssqqssssqsqqsqqsqqssqsqsqsqsssqqqqsqqssqsqqsqssqqsqsqsqsssssqqsqsqsqsqssqqsssqqqssssssqsssqqsqqsqqqsqssqqssqqsqqqqqqqssqsssqsqsssssqssssqqqssssqqssqqssqqqqsssqsqqsqsqsqqsssssqqqsqsqsqsqssqssqsqsqqsqqqqqsqqsqqqqsssqsqqqqssqqsssqsqsqssqqqsssqssssqqsqqssqqqssqqqqsqqqsqsqqqsqssqqssqsqssssqqssqsssqqsssqsssssqqqqqqqsqqqqssqsqqsqsqqsqsssqqsqsqqqqqqsqsssssqqssqqsqqsqqsqssqssqsqsssqqsssqsqqqssqqqqqsqssqssqqqsqqssqsqqqsqsssqsqqsqsqqssqssqqqsqqsqssqqsqqsqssqqssssqssqssssqqqqsqsqqqssssqqqsqsqssqssqsssqqsqsqsqsqssqqsssssqqqqqsssssqsqsqsqsssqqsssqqsssqsqsssqssssssqsqsqssssqqsqqqqsqqsqqsqssqqqsssqqsssssssqqsssqqsqsqqsqqsqsqqsqsqsssssqssssqqsqsqqqssssqqqsssssqssqqqqqssqsqsqsqsssqqqqqqssqqsqssssqqqqqsqqsqqsqqsssqsqqqsqqsqqsqsssqsqsqssqsqsqsqssssqsqqqsqqssqsqqssqsqssqqqqssqqqqqsqqsqqssssqqqssssqqqqsqsqssqqqqsqssssqqqsqssqqqqqqssqqsqsssssqsqqqqssssqqqsqssssqsssqssssqssssssqqqsqsssqssssqsqsqqqsqsqsqqsssssqsqsqqsqsqqsqsqssqsqsqqsqssqqsssqqsqqsssqqqsssqsqsqqqqqqqqqqqssssqqqsssqqsssqsqqsqqssqqsqsssssssqssqssqssssssssssqqssqqqssssqqsqssssssqqsssqqssqqsssqsqqssssqsssqsqsqsqssqqssqssssqsqqqqqqsqssqqqqqqqqssqqqqqqsqqqqsqsqqsssqqqqsqqqssqsqqqqsqqssssqqsqqqqsqqsqqsqssqsqqqqqqsssqqqsqssqssssssqsssqqsqsqsqqqqqqssqsqqsqqsqqsqssqsqsqqqqqssqsqsqqqsqssssqqssssqqqqsssssqqqssqqssssqqqsqsqsqqqsqssqssssqqqqsqsqqsssqssssqssqqqsqssqsqsqqsqqqsqsqsqssqqqqqqqssqssqsssqqsqsssqqqsqqqssssqqqssqqsssqqsqsqqqqsssqqssqqsqqqsssqqqqsqsqqsqqssqqsqsqssssqqsqqsssqsssqqqsqqsqqssqssssqsqqqssqsssqqqssqqqsqqqsqssssqqqqsssqqssqqqsqsssqsssqsqssqssssqqqssqqsssssqsqqqsssssqssssqqssqqqqsqsqssqqqqqsqqsqqssqssqssqqssqqsqqqssqqqsqqqsssssqqqqsqqssqqqqssqqsqqqqqsqqssqsqsqsssqsqsqsqqssqqssssqssqssqsqsqqqqsqqqsqssqqqqsqssqsqsssqssqsqsqssqssqqqqssqqssqqsqsssqssqqqsqqqsqssqssssqsqssqqssssqsqqqssqsqqsqssqqssqqqqssqqqsqqsqsqqssqqssssqqqssssqsqqsqqqqqqqqqssqqqqqsssqqqsqssssssqssqssqqsssssqsqqqsqqsssqssqsqsssqssssqssqsssqsqqqsssssssqqssssqsqqssqsssqsqqqqsqqsqsqssqsqqsqsqsssqsssqqsqqsqqsssqssqqqsqqssqqqqqqsssqsqsqqsqqqqssqsqqqqqqqsqqsqqssqqsqsssqsssssqqssssqqsqsqqqsssqqsssqqqqqsssssssqqssqsqsqsqssssssqsqqsqssqssqqssqqqsqsqqsqqsqssqqsqqsqsqqqqsqqqssqsqssssssqqqqsqsqqqqsqsqqqsqqssqssqqqsqssqssqqsssssqqqqsqsqssqsqsqqqqqqsssqsqsssqqsqssssqqssssqsqqssqsqsssssssssqqqqsssqqqqqqqqsqqssqsqqsqqqssqssssqssqsqsssssqqqsqqqqqsqsssqqqqsqsssqssqsqssqssssqsssqqssqqssqssqqssqsqsqsqqqssqqqsqsqsqqqsqqqsqsqsqsqsssqqqsqssssqqqqssqssssqsqsqqqqqqqsqqqsssqssqsqqssqqqqsqqsqsqqqssssssssssqqsqsqssssqsssqsqsssssqqsssssqqqsqqsqqqssssqqsqqqsqqssqsqssqqqqqqqqssqsqssssqssqsqsqqssqsqqssqqqqssssqsqqssqsqsssssssqqqsqqssqssssssqqqqqsqsqqqsssqssqqsqqsqqqsssqssqqqsqqqqsqssqqqsqqssqsqqqqqqqsqsqsqssssqqssqqqqsqqssssqqqqsqssqssssqsqqsssqqqsssqqsqqqsssqqqsqqsssssqssqqqssqqssqssqqsqsssqssqsqssqssqqssssqqqqsqqsqsqsqqsqqsqsqsqsqsssqssqqssssqsssqsqssqssssqssssqqqqsqqqsqqsqqqsssqssssqqqsqqssqqqqsqsqssssqqqqsqqsqqqsqqqqqqssqsqssssqqsqqqqsqqqsqsqqqqsqssssqqsssqsqqqqssqsqqqqqqsqqsqqssssqqsqsssqqssqqqsssqqsssqssqqssqssqqssqqsssqqqsssqqssssqqsssssqqsqssqssqqqqqsqssqsqqssqqqqqsqssqsqqssqssqsqqqqqqssssqssssssssqqqsqqqsqqqqqssqsqssqqqqsqssssqqssssqsqqqqqssqqqqqqqqqqqsssqqqqqsqqsqqqsqqssqqsssssqqsqssqssqqssqssqqssqssqqqsqsqsqqqsqqssqsqqsqsqqqqqqsqssqssqqqqssqsqsqqsqsssqsqqqqsssqqqqqqqqqsqsqqqqqqssssqsqsqqsqqsqsqsssqqssqqqqqqsssqssqsqqqqssqsssqqqsqsqqssqsqsqsqsssqsqqqqqsssqqqssqssqsqssqqqqsssssqqqsqqsqqqsqqqqsssqqsqqssssqqsqqqqqsqqsqssqqqqssssqsqqsqqqqqsqssssqsqsqqqqqqqssqqsssqqqsssqqsqqqqqqsqsssssqsqqqqqsssqsqqsqssqsssqqqsssqsqqqqsqsqssqsssssqsssssssssssqsssssqsssqqqssssqqsqsqqsssssssssssssqsqqssqqqsqqsqsqqsqqqssqsssqsssqsqqssqqsqqsqssssssqqqssssqqqsqqsssqsssqssqsqqssssqsssqqsqqqqsssssqsqqqqsqqssqsqqqssqqssqssqqqssqsqqqsqssqsqsqsqsqqsqqqqsqqsqqsqqqsqqsssqsssssqqsqssqsssqssssqsqsqqqssqssqqqqsssqqqsqqsssqqqqqqsqsqqsqsssssqqqssqqssqssssssssqqqqqsqssqssqsssssqqqqssqsssqqqqqsqsqsssqssqsqsssqssqqssqssqsssqqqsqssqssqssqsssqsssqsqsqqqqssqqqqsqsqsqsssqsqqqqqqqssqqsssssqsqsssssqqsqsqsssqqqsqsssqqqqqsssqqsqqsqsqssqqsqssqssqssqqsqsssssqsssqsqqqsssqsqsqssqqqqqqqqssqqqsqsqqssqqqqsqsqsqsqsqqqqqsqssqsqqssqqsqsqsqqqssssqssqqssqqsssqqsqqsqqsqssqqqqqsqqqsqqsssqssssqsqsqssqsssqqqsqqsssqqqqssqsqqqqqsqsqssqssqsssqqqqsqsqqssqqssssssqqsqqqqqsqqsqqssqsqsqsqsqqqssqsqsqsqqqsqqsqsqssssqqsssssqssqqssqsqssqqsqqqqqqqsqssqssqqqssssssqsqssqqsqqqsqqsqqssqqsqsqsssqsqsssqsssqsssqsqsqsqsqqqssqsqqssqssqqqssqqqsqqssqsssqqsqsssqssssqsssssqqqqsqqsssqqqsqqsqsqqqsqsqqsqsssqqqqssqqsssqssqqssqqsssssqssssqqsqqsqqsssqqssqqqqsqqqssqssssqsssssqssssqsqsqqqssqqqsqsssqqqsssqsssssqqsqssqqsqqqssqssqqqqqqssqsqqqssssqqsqqsssqqqsqqqqsqssqssssqssssqqqqqqqsqsqsqqqsqsqsqqsqsqsqqqqssqsqssssqqsssqqssqsqqsqqsqqqssqsqssqqsqssqqqsqqqsssqsqssqsqqsqssqssqssqsqqsssssqsqssqsqqsssqqsqqssqqsqqsqsqsqssqqsssqqqqqssqsqqqsqsssqqsssqqqqssqqsqsssssqsqsqsqsqqsssssqsqsqsssssssssqqsqqsqssqqqsqsqsqqqqqqssqqsssqqqsssqqqqsqqqssqqqssqqsqqsssssssssqsqqssqqqqqqssssqsssqssssqssssqsqsqqqqsqqqssqqsssqqssqqsqssqsqssqqsqqqssqqqqqssqssssqssqqqqsqsqsqsssqssqssqsqsqqqsqqqqsqqsqqqqssqqsqqqsqsqsqsqqqsqsqsqssssqqqsqsqsqqqqssssssssssssqssqsqssssqqqsqsqssssssqqqqsqsqssqsssqqsssqsssqssssssssssqsqqsqqsqqqssssqsqqsqssqqsssqsqsssqssqqqsqqsqsqsqqqsqssqsqsqqssqqqqssqsssqqsqqqsqqsqqqqssqsqsssqqqssqqqqsqqqsqqqsssqssssqssqqqqqsqsssqqssqsqsqsqqssqssqssqssqqqsssqqsqsqqqssqssqqsqsqqsqqqsssqqsqsssqqqssqqqssqqsqqssqsqssqqsqsssssqqsqqsqsqsqsqsqqqqqssssqssqssssqssssqssssqsqqsssqqssqssqqqqssqsqqqsssqsqsssqqqsqqqssqqqsqqqsssqqsqqqqsqqssqqqqsqsssqsqqsqsqsssssqsqsqqsqqqqsssqqsqsssssqsqsqsqqsssssssssqqqqqqsqsqsqssqsqqssqqsqssqsssqsqssqsqqssqssqssqqsssqqsssqqsqssqqqsqqssssqssqqsssssqsqsqsqssssssqqqqqssssqsssqsqqssqqqsqsqsqssqssssqssqsssqsqqqsqqqsqqsqqqsqqqqqqqssqqssssqsqqsqsqsqsqqssqsqsqssssqsqqqqqssqsqsqsssqqqsqqssqsqqqqqqsssqsqqqssssssqqssssqsqsqqsqsqsqqsqqsqqqssqsqqqqsqssqsssqqsssqqsqsqsqqsssqqsqqsssssqqsqsqsqqsssssqsqqqqsqqsqsssqqqssqssqqqsssqsqqqqqsqsssqsssssqqssqssqqsqsqsqqsqsssqqqqqqqqssqsqssqqqsqssqqsqsssqqqqqsqsqsssqqqqqsssssssqqqsqqqssqqssqqsssssssqqqssqqqssqqssssqsqqsqssqsqqqsqqsqqqsqsqqssqsssqqssqssqsqssssssssqsqqqsqssssqqqsssqqsqsqssqqssssqqsqqqqssssqqssqssssssssqqqsqqqssssssqssqssqqqsqqssqsqqsqsqsqqssssssqssqqqsqsqqssssssssqsqqsqqssqqsqqsqssqssssqqsqsqsssqssqqssqqssqqssqsqqsqssqsqqsqsqqqqssqssqssssqsqqqqqsssssqqqqqqsqqssqsqqsqqqsssqssqqqqsqssqsqqqqsqsssssqqsqqqqqssqqqqqsqsqssqqqsqqqsqssqqqsqqsqqqsqqqqsssssqsqssqqqqqqqsqsqssqsqsssqqqsqssqssqsssqqsqqqqqqqsqqqsssssqqqqqqssqqqqqssqqqqsqsssqsqsqsssqsqssqsqsqqqssssqqqqssqssqssqsqsqsssqqqqssqsqssssqsqssqsssqqqsqsqsqsssqqqqsssqssqsqssssssqsqsssssqqqqsqqqsssqqsssqsqqsssqsqsssqssqsqsssqqssqssqqqqqqqqqsqqqqqqssssqqqqsqqqqqsqsqqssssssqqsqqsqsssqsqqqqqqqqqqqssqsqssqsqqsqssssqsqqqsssqqqsqsssqqqsqssqsqqqsqqqqssssssqsqsqqqsqqqsqsqssqqsssqqsqssqqssqqqssqsqssssqssssqqsqsqssqssssqqqssqqqssqsqqqqqsqsqqsqsssqqssqqqqqqssqssqsqsqsssqqsqqssssqqqqssqqqssqsqssqqqqssqssssqqqqsqqsqqqsssqqssqssqsssqqsqqqqqssqqqssqsqsqqqqssssssqssqsqqqsqsqqqqssssssqsqsqqssqqqsssqsssqssqsqqqsqqsqsqqsqssssqqqqqqqqsqsqqqqqqssqssqsqqsqssqqqqsqqqqqsqqsqqsqsssqqqqqsqssqqsqsqsqssqsssqqsqsqqqsssqsqsqsssqsqsqsqsqqqssqssssssssssssqsqqsssqsqsqssqqqqqqqsssqqqssssqqqssqqqqssqqsqssqsssssqsqsssqsssqqqsqqqsqqssqqssqqssqssqqqqqqsqssssssqqqqsqqsqssqsqqqssssssqsqqqqsqqqsqqqqsqsqqqssssssqqqsqqsqqqssqsssqsssqsqqqqssssssqssqqssqqqqqqqqqsqsqssqsssssqqsqqsqqqsqsqssqqssssssqssqqqqqsqsqqssqqqqssssqqqsqssqssqqsqqsqqsqqqssqsqqqqqssqsqsqsssqqqsssqssqsqqqsqssqssqssqqsssqqsqqsqssssqqsqqsqqqssssssqqsssqsssssqsqsqssssqqsqssssqqsqqqqqsssssssqssssqsqqsqqqqsqssqqsqqqqsssqqsssqssssqqqqqqssqqqqqsqssqqqsqqqqssqqsqqsssqsqsqssqsqssssqsqsqqqqssqssssssssssqqqqsqsqsqsqsqsqsqsqqsqsssqqsssssqssssqsssssqsqssqssqssqqqqsqqqssqsqsqqqsssqsssssssqsqssqsqsqsqsqqssqqqssqssqqqqqqqsqssqqssqssssqsqqqssqsssqssssqqsqqsqsqqssqqsqqqssqqqssqsqqssqssqssqqsqqqsqssssssssssqssqqsqsssssqsqssqqsqsqqqsqsqsqqqqsqqqqsqsqsqsqssqqsqqsqsqqssqsqsqsqqqqssqsqsqsssqqqsssqsssqsqqqsssqssqqqqsssqsqqsqqqqssssqqqqsqsqsqqqssqqqsssqqqsqqqsqssqqsqssqqqqssqqssqsqqqsqqsqssqsqsqsqqsqsqssqqsqsqqsqqqsqsqssqsssqqsqssssqssqssqqqqqqssqqsqsqqssqsqsssqssqsssqssssqqqqsqsqssssqssssqsqqqqqqqssqqqsqsqqsqqssqssqqqsqqsssqqqqsqqqsqqsqqsqsqssqqqqqsqqsqqsssqsqsqsqsssqqqqssqqsqsssqsqqqssqqqqqsqqqssqsqssqsqsqqssqqqsqqqqqqsqsqqsssqsqsqqsqqqssqsqsqqsqsqssssssqqqqsssssqssssqssssqsssqqqqsqqssssqqsqqsqsqssssqssqqsqssqsqsssqqqqssqssqssqqqqqsqqsssqqqsssssqqqsssqqsqqssqsssssqsqsqqqqqqsqqqssqssqqqssqqsqqssqsssqqqsqqqqssqqqqsqsqqsqqqssqqqqqsqssqqssqsssqqqqsqsqsqsqsssqqsqqqssqsqqsssssqssqsssqqsssqsssssssssqqqssssqqqsqqqqqqqqqssqsqqqqsqqqsssssqssssqsqsqsqqssqqsqqqqqqsqqssqsqqqsqqsqsqqsssqssssssqqqsqsqqsqqqsqqsqqqssssqssssssqsqqqssssqqsqqssqsssqqqsqqsqqsqqssqqqqqsssqqssssqsqqqsqqssqsqssqsqssqqsqsqsqqsqsqsssqsqsssqqssqssqqsqqsqsqqssqsqqsqssqqqsssssqsqsqssqsqqsqqsssqqqqqqqsqqsqsssqsqsqqssssqqqsssssqqqqqqqsqsqsqqqssqqqqsqqqsqqqsqssqqsqqsqsqsqqqsqssssssssssssqssqssssssqsqqqsqqsqsqqqsqsqqqsqssqsqssqsqsqqqqqssqsqsqqsqqsqqsqqsssssqqqsqqqssssqqsqsssqsqqsssqqssqqssqssqqqsqssqqsssssqqqqsqsqsssqsssssqsqqqsqqqsqqsqsqsqsqqsqsqqqqsqsqqqqssqsqqqqqssqsqsqssssssqsssqsqqssssqqsssssqsqssqssqsqqqssqsqsqsqqsqqsssqqssqsqqsqqsqsqssqqqqsssssqqqqssqqsqsqssqsqqqqsssqsqsssqqqqqqsqsssqsqqqsqqqqqsqsqqqqqssssqsqsqqsqqqssssqqssqsqssqssqqssssqqsqqqsqsssssqsqssssssssqqsqqsqqqqqssqssqqsssssqqsqqqsqqssqsqqssqsqqqqssqqsqsqqsssqqqssqqqqqssqqssqqqqqsqssqqqqqqsqqqsqsqsqsqqssqssqsqqsssssssqqssqsqssqsssqqssqssqqsqssqssssqqqqsssssssqqsqssssqssqssqsqqsssqqssssssssqqssqqssqqsqsssqsqqqqqsqqqqqqqssqsqqqsssqqsqqsqssqssqssqsqqsqsqsqssqqqsssqssqssqqsqqqqsqqssssssqqsqssssssqqqqssqqsqsqsssqqqqqqqqqssssqssssqqssqsqqssqsssqsqssqsqqqqssssqqqqsqqssssssssssqqsqqqssqsqqqsqqqssssqsqssssqssqqsqsssssqssqqqqsqqssqqssqqqqqssqsqsqqssqssqqsqsqsqqqqsqsssqqsqqsqsqssqsssqssqqqqsqsqqssqsqsssqqqssqqssqsqsqsqsqsqqssqqqsqsqqqqqsqqqqqsqqsqsqssssqqqqsqqqqsqqsssqqsqssqqqssqqssssqsqssqssssssssssqqqssqsqqssqsqsqsqqsqsqqqsqsqqqqqsqsqqssqqssssqqssqsssssqsssssssqqqqqsqsqsqqssqssqqqssqqqsqqqsqsssqqsssqsssssssqqqqsqqsqqsqqsqsqqqsqqssssqqqssqqqqqsqqqsqsqssqqssqsqqsqssqsqsqqssqqsqssqsqqqsqssqsqqssqqsqqsqqsqsqsssqsssqqqqsqqqqssqqqqsqsqsqqsssqsssqqssssqsqqqssqqssqqqqsqqsqqqsqqqqsqqqssqsqqqqqsqsssqqqsqqqqsqqssqqqqssssqqqsssssqsqqssssqqqqqqsqssssqqssqssqqsqssqsqqqqqqsqqssqsssqqqqqqsqqssqssssqssssqqqqqqsqssqssqsqqsqssssssqssqqsssqqqqqqqqsqqqqqqqqqqqssssqqqssqqssqqqsssssqsqqqqqssqsqqssqqqqqsqqqqqsssssssqqssqqssqqsssssqsqsqqssssqsqqqsssqqssqssqssqqssqssssssqssssqsqsssqssqqsqqqssqsqssqqqsqsqsqqqssqqqqqqqqsqssssqqsqqqssqsqssqsqqqqqsqqqssqssqqsqsqsqssqsqsssqsssqqssqqssqqqsqqqqqqqssqqsssqsqsqqsqsqsqqqsqqqsssqqqqqsqsqqqqsqqqsqqsqsqqsqssqqqsqssqqssqqsqqsssqsqsqqqsssqssssqsqsqsssqqqqqsqqqsssqqqsqsqqqqqqssssqqqsqsqqssqssqssqqsssssqqsqsqqsqqqssssqsssqqsssssqqqqqqqqssqsqsqqqqsqqqsqsqqqqqssqqqqqssssssqsqsqqqqqsqsssqqsqssqqqqqsssssssqqqqsqqqssqqsqqqssqssqssqqssssqqqqsqqsqqsqsqqsqqqqsssqqsqqqqqqqssssssqqsqsqqqqqsqqssqsssssqqqqsqsqssqsqssssqqssqqssqssqsqqsssqqsqsqsqqqqsqqqsssssssqqsqssssqqsqqqqqqqqqsqqqqssqqsssqssssqqsqssssqsqqqqsssssqsqsqqqqsqsqsqqqsqqsqsqsqqqsqsqqqsssqsqssssqsqqqssqsqsssqsqqqqqqsssqqqsqqqssqqqqsqqqsqsqqsssqqsssqssqsqsqqssqqqqqssqssqsssqsqsqsqssssqsqqsqssssqqsqsssqqqqsqqqqssqqqqssssqqsqqqssqsqqqqssqqqqqsqssqqsqsqqsssqssqqsqqqssqqsqqqssqqsssqqqssqqssqqqssqsqqssqqqsqqssssqqqsssqqqssqqssqsssssqqqqssqsqsqqqqqssqqsssqqssqqssqsqqsqssssqssssqqssssqqqqqqqqqqqsssqsssssssqssqqssqqsqqqqqssqsqqqqqssssqqsssssqsssqsqsqqssssqssqqssqqsqqsssqsqsqsqssqssqqqqsqqqsssssqqsssqsqqqssqqqsqqsqssssqsqssqsqsqsqqqssqqqqqqqqssqsqqqsqssssqqsqssqsqsqsqsqsssssssqqqsqsssqqssqqqqssqssqqsqqssssqqqqqsssssqqqsssqssqqsqqsqqsqsqssssqqsqssqsqqqsssqqqqqqsqsqqsqssqqsqqqsqqqsqssqssqssqsqssssssqssssqssqsqqssqqsqssssqqqssqqqqqsqsqqsqqsqsqqqssqqqqssqsssqsqssqqqssqsssssqsqqqqqssqsssssqqqsqsqqqqqsqqqsssssqqqssqsqsqsqqssqqsqsqqqqqqqqqqqssqqqqsqqqqqsqqsqqsssqqsqqqqqqsqssssqsqqsqsqssqqsqsqsqqqssqsqqqqqqqqqsssqqssqssqqqqqqqqsssqqqsssqqsqqqqsqsqsqsqqssqqqqsqsssqqssqsqsqqqssssssqsssqqqsssqsqsqqsqqsqsqqsqsqqqsqssqssssqqsqqqssqqssqssqssssqssqqssqqqqssqssssqqqqssqssqsssssqqsqqsqssqqqsqssssqssqqssqsqsqsqqqssssqssqsqqqqqssqqsqqqsqssssqqqqqssqqqqqsssssqqsqsqqsqssssssssssqqqqsqsqqqqssqsqqqsqqsqssqsqqsqqqqqsqqqsqqqsqsqssqssqsssssssssqqqqqqqsssssqqsssqqqqqqqqqqqqqssqqqsqqqsqsqsqqqssqsqsqqssqssqsqqqqqsqssssqqsqqsqqsqsqqqssqsqqssssqqsqqqsqqqqssqqssqsssssssqssssqssqqqsssqsqqqsssssqqsqssssqqssqsqssqqqsqsqqssqqsqqsssssssqsqqsqqssssssqsqqsqqsqsqqqsqqqqsqqsqqqssqsqqqqsssssqqsqqqqqqqqqsqqsqssqqqssssqsqsssqssqqqqqsqsqsssssqssqssqqssqqsqsqqsqqqqqsqsssssqssqsqqssqqssqqqqqsqqqsqssqssqssqsssssssqsqqqsqsssqqqqqssqsqqsqqqqssssqssqqsqssqsqqqqqsqqqsssqqqqqqqsssqsqsssqqqssssqsqssqsqqssqqssqqsqqqssqsqqssqqsqssqsqqssssqsqsqsssqsssqsqssssqqssqqqqqsqssqqsssqqsqqsqqqsssqqsqsqsqqssqssqqqqsssssqsqssqsssqssqsqsqqqqsqsqqssqqsssqqqssssqsqqqsssqqsqqqqqqqsqqssqsqssssqqqssqsssqqssssqssssqssssqqqqqssqqsssqssqsqqqssqqqssssqqssqsqqqsssqsqqsssssssqssqsqqsqqqqqqsssqqqsqqsssssssqssqqssqsqssqsqssqsqsssssssssqqsqqsqqssqssqsqqsssssqqqqsqqqqsqssqqqsssssqqsssssqsqsqsqqssqsqssssqqsqqsssssqqqssssssssqqqsqsqqqsqqsqqqsqsqssqqqqqsqsqsqsqqqqqqqsssssssssqssqsqsqssssqqqssssqqsssqqqssssqqsqqqssqqqsssssqqsqqqqqqssssssssssssqqqqsqqqssqqqqqsqqqqqqsqssqssssqssqqqqssqsqqsqqsqssqsqqqssqssssqsqqsqqsqssqssqsqsqssqqqsssqsqssssqsqqqqssqsssqqssqqsqqqsssssqsqsqqssqqqsqqqsqqsssssqsssssssqqsqqqqqqqqsqssssqqqqqssssssqqqqssqssqqsssqqsqqsssqqqqqqqsqqqsqsqsqqsqssqssqssqqsqqsqssssqssqqqqsqsqsqqqssssqqsqsqsqsqsqqqssqssssqqssssqsqsqqssqssqqssqsssqqqssqqqqqsqqqqqsqqqssqsssqqsqqqqsssqsssssqsqsqssssqqsqsqsssqsqqqqqssqssqqqqssqqssssqqqqqssqsqssssqsqqqsssqqqqsssqqsssqqsqqsqqqqsssqssqqqqqqqssqssssqsqsqqqsssqsqssqqqqqqsqqssqsqssqqqqqqsqqqqsqssqqsqssqsqqsqsqqqqqssqqsqssqsssssssqssssqqssqssqsqqqqqssssssqsqqqssqsqsqqqqqqqsqsqqsssssssqsqssqsqqsssqqqsqqssqqqqqqsssqssqsqssqqssqssqqssqssqsqqqqqssqqqssqssqssqsqsqqqsssqqssqqqqqssqssqqqssqsssqssqsssqqqssqqqqqqssssssqqqsqqssqssqqssqssqsqsqqsqssqssqssqqssssqqssqqssssqsqsqsssssqqssqsqssssqssqsqsqsqsqsssqqqqssssssqqsqqqqqssqqqsssqqqssqqssqqqsqqssqsssqssqsqssqsqqqqsqqsqsqqqssqssqsssqqsssssssqqssssqssqqsssqsqsssqqqsssqssqsqqqsqqqqssssqqqqqsqssqssssqqqqqssssqsqqsssqssqqssssssssqqsqqqsqssqsssqsqqsqssssqsqqsssqsssqsqqsssqqsssqsqssqqsqqqsssssqsssqqssssqssqsqqqqsssqsqsqsqssqssqqqqsqqsqqqqsssqsssqqqssqqsqsqqqqssqqssqsssqsqsssqqqsqsssqqqsqqqqqqqqqsqsqqssqsqqqqsssqqsqsqqqqsssqqqqqqsqsssqqqqqsqqqsqqqssqqqsssssssqqqqqqsqqsqsqssqsssssssqqsqssqqqqqqsqsqqqsssqqssqqqqsqqqsqsqqssqsqsqssssqssqsqqqsqsqqqqqsqsssqqssqqqqqqqqqsqsqqsssqqqqssssqssqqsqqqqsssssqqqssqqqsssssqsqqqsqssssssqqqsqqsqssssqqsqqqqqsqqqssqqsssqssssqsssssqsqsqqsqsqsssssqqssqsssqssqqssssqsqqqqqsqssqqsqssssqsqqsssqsqsqsqsqqsqqsqqqssqsssssqsssssqqqsqqsssqsqqsssssqqsqssqsssqsqsqssqqsqsqqqqsqqqsssqsqqqsqsssqsqqqssqssssqsssqqsqqqqqsqqsqqsssssssqsssqsqsqssssqsqssqsssqqsqqqqqsqqqsqssssssqsqsqssqqssqsssqqsqsqqqsqqsssqqqqsqqsqqqsqsqssqqqqssssssqqqssssqsqssqqsqsqqsqqqqssqssqsqqsssqsssqqsssssqqsqsqsqqsqqqqqqqsssqsqqqsssqqqqssqqsqqsqsqssqssqsqqqsqsqqqqsqqqssqqsqqsqssqsqssqssqssqqsssqsssqqqsqqqqqqssqsssqsqqqqssssqssqssssqsssqsssqssssqsqqssqqsqsssqqsqssqsqsqqqssqsqqqqqsqssqssqsqqsqsqqsqqsqqqssqsqsssqssqqssqqsssqqsqssqqqssqssqsssqsssqssqsqssssqqqqqqssssqqsqqsqqqsqqqsqqqsqsssqqssssqqqsqqssqsqqsqsqsqsssqqqsqqqqqssqssqsssqqssqssqqqqqsqssqsqqqsssqsssqsqsqqsssssqssqsssqsqqqsqqqqqsqssssqsqqssqsssqqsqssssqqsqsqsqsqsqqqqssqqqqsqqsqqqsqqsqqssqsssqqssqsqssqqssqqqqqqsqsqqssssqqssqsqqsqqqqssqqqsqsqqqsssssqqssqsqssqsssqqssqqqssssqsqsqqsqsssssqsqsqqsqqqsqqqsqsqqssssqqqsqssssqsqqssqqqqqqsssqsssqsqsqsqsqsqqssqsssssqqqsqsqsssqqsqsqsssqqqsqsqqssqqqqssqssqqssqsqsqqssqqqqsqsqqsssssqsqssqqqsssqqsqssqqqqqqssssqssssssqssqqsqsqsssqqqqqqssqssqsqqqqqqsssqqqqqqsqqsqqqsqsqssqssqsqqqssssqqqssqsqqqqqssqqqsqqqqqsqsqqsqsqqsqqsqqsssqsssqsqqsqqqqsqqsqqqsssqsssqsqqsqqssssqqqssqqqsqsqqqssssqqssssqsqqqqsssqsqssqqssqqsqqqsqsqsqqssqqqqqsqqsqsssqqsqsqqqqqqsqqsqsqsqssqqqqsqsqqqqsqqqqqsqqqqqqsqssqsqqqsqsqqqsssqsqqqsqqqsssqqssqqsqqsqssqqqqqsqqqssqsqsqsqsqssqqssqsssqqqsqsssqssqqqsqqqsqqqsqsqqqssqqqqsqsqssqssqsqqsqqsssqsssqsssqqsqssqsqqqsqqssqqsqqsqqqqqqqqsssqqssssqssqqsqqqqssqssssqqsqqqqssssssssssqqqsqsqqsqqssqqqssqqsqsqsqsqsssqsqqqsqqqsqssssssqssqqsssqsqqsqqssqqqsqssqsqsqqqqqssssqsqsssssqqssqqqqqsqssssqsqsssqsqqsssqsqssqqqqsssqssqsqssssssqsssqqqqqsqqqssqqsssqqqsqqsqqqqsssqqqssqqssssssssssqssqssqsqqqqqqqqsqqqqsqsqsqqssqsqqsqqqqqsqsqqssssssqssqssssqsqqsqssqssqqqsssssqqqssssqqqsqsqqssssqsqsssqssqsqssqssqsssqqqsqqqssssqqsqqqqqssqqsssqsssssqsssqqqqssqqqsqssqqssssssssssqsqqqssqqqsqqsqssssqqqsqssqqsqsqqqqqqqssqqssqsqqqqqqqqssqsqqsssqqsqqsqssqqqqsqsqqqqsqqssqsqssqsqqqsssqqqsqqsqsqssssqsqsqqqsssqqsqssssqqssqssqqsqqqqqsqqqssssssqsqqssqsqsssqqssqqqqqsqqqqsqqqsqqqqsssqqsqqsqsssqqssqssssqqssqqsqsqqsssqsqqqssssqsssqsssqqsqssqqqsssqsqqqqssqqqsqqssqqqqqqssqqqsqqssssqssssssqqsqsqssqsssqqqqqsqqqqsqssqsssqqqqqssqsssssqqssqsssqqsssqssqsqssqqsqqsssqqqssqssqqssqsqqqsqqsssqqqqsqqsqqqsqssssssqsqqqsqqqqsqqsqssqqssqssqqsssqqsssqssqqqsqqsqsqqsssqqssqsqqsssqqqqqsqqqsqssssqqqsqssqssqssqsqsqqsqqsqssqqqqqqssssssqqsqssssssqqsqssqssqqsqssqqsssqqssqqqqqsqqqqqssqsssqssqsqsssqqqsssssqqqsssqqqqssqsqssssssqqqssqssqqqssqqqssqqqqqqqqssqqsqssqsqqssssqsssqsqsqqsqqsqsqqqsssqqsqsqssqssqssqqsqsqqqsqsqsqsqqqsqqqssqqsqssqqssssssqsqsqqsssqsqqsqqsqqsqsssqssqqsqsssqqqsqqssqssssssssqssqqssqsqqsssqsqsqsqqqsqssssssqsqqqsqqqsqqsqqqsqqssssqsqqqqsqqqsqqssqsqssqqqsqsssqqsqsssqqsssqsqsqqqsqsssqqsssqsqqqsssqsqqssqqqsqqqqqsqqqsqqqsqqqqsqsssssssqssqsqqsssqsqsqsssssqqqqqqqssssssssqqsqsqqsqssssssqqqqqqssqsssqsssqsqsqsqsqqqqqssqqqsqssqssssqqqsssqqsqqsqqsqqqsqqsssqqqqqqssqqqqssssssqqssqsqqsssqssqqqsqsqsssqsqqsssssqssssssqsqsssqqssqssqsssqsqqqssqsqsqssqssqqssqsssssqqsssqqqqssqqsqqsqqqqssssssqqssqqqqsqsssqssqsqqqqqsqssqqssqssqqsssqssssssqqssssqsssqqqqsssssssssssqsqssqsqqqsssqsqqqsqsssqsqqqqssqqssqsssqqsqqqqqqqsqqsqqqqqssssqqqsqqssqqsqqssqssqqqsqsssqqqsqsqqqqsqqqsssssssqsqqssssqqqqssssqssqqqqsqsqqqqqqqqssqsqsssqssqsqqqsqqqqqqsqqsqqssqqqqssqqsssqssqqqssqsssssqqsssqssqqqqqssqqqsqqqssqsqqqssqssqsqsqqqqqqqsqssssqsqssqqqqqsqqqqssqqsqqsqsqqqsqsqsqqqsssqsqsssssssssssqqsqsqsqsqsqsssqqsqssssqqqqqqqqqssqqqsqqqsqssssqsqssqqqqqqqsqqsqqqssqqqqsqsqssqsqsssssqsqsqqssqssqqqqqsssssssqqqssqqsqqqqqqsssssqqqsqsssqssqsqqqqqssqssqqqqsqsssqqqqqqqqqsssqsqssqssqssqssqssqssqqqqsqssqssssqssssqsqsqsssqssqqsqsqqsssqssqqqsqsqqsqsssqsqqsqqqsqqsqssqqsqssssqqsqssssssqssqsqssqssqqqsqsssqssqqssqqsqqsqssssqssqqsqqsssqqqssqsqqqqsssqqssssqssqqqqqssqqssqqssqqqssssqqqqsqsqqqqssqqqqqqsqsssssqsqqqqssqqsqqsqqqsqsssssqssqqqsqsqsqssssssqssqqssqqqsqsqqsqqqssqqqqssqssssqqqqsqsssqqsqqqqqssqsssqsqqsssssqsssqqqssssqqssqssssqqqqssqqssqqqqsqssqqsssssqqqssssqqqqqqqsqqsqsssqsqqqqsqsqqsqsqqsqsqsqsqqssssqqssqssqqqqsqsqqqqqsssqsqqqqqqsqqsssqqsssqqsssqsqsqsssqsssqsssssqsqqqsssqsssqqsqsqsqqqssssqsssqssqsssqqqqqsqqsqqqqsssqqssqqsssqsssqsssqssqsqssqsqsqqssssqssqsssssssqsssssssqsssssqqsqqqsqqsqssqsqqsssqsqsssssssqssqsqsqsssssqqqsqqsssqsqqsqssssssqssssqqsqqqsssssqsqqqqqqqsqsqqsqqssqsqqssqqqqqsqqsqsssssqsssqqqqqssqqqqqqssssqssqqsssqsqssqsqssqqqqqsqsqqqqqsqqqqsqqssssqqssqqqqqqsqsqsqssssssssqqqqssssqsqqqssqqssqsqqqsqqqsqqqqssssqsssqsqqsqsqssssqsqssssssssssqqssqssqqqqssqqsqsssqqqqqsqsssssqqsqssssqqqqqssqssqqsqqssssqsqssssssqssssqssqqsqqqqsqqqsssqqssqsssqqssqsqqsssqqqsqqssssqqssqssqqqsqssssqqqsssqsqsssqqsssqqssqqsssqsqssqqsqsssqsqsqsqqqqsqsssqqqqsqqqsqssssssqqqqsqqqssqqsqssqqssqqqsssqqsssqqqqqssssqsqqsssssqsssqsqqqsqqsssqqqqqsssqqsqqsqssqssqqqqssqsqssqqqssssqqssssssssqqqssqsssssqssqsqsssqsqsssssssqssqssqqqsssssssqsqsqsssqsqssqqssssqsqsqqqqssqssqqqqssssqqsqsqsqqqqsqqqsqssssqqsssqssssssqsssqqssqqssqqsssqqsqsqssssqsssqqqqsssqqsqssssqsqqqqsqqqqsqsssqqssqsqsssqsqqsqsqssqsqsqqqqqqsqsqsssqssssqsqqqssqsssqqsqqqsqsqsqsqqqqqqsssqsqsqqqqsssqqqsssssqqsqsqsqqqssqssqssssqqqsqsqssqssqssssqqqsssssqssqqqsqqssssqsqsqqqsqqqqqqqsqqqsqqqssqqssssqqqssssqssqqqqsqssssqsqqsssqqqsqqsqqsssqsssqqsqsqqqqsqqsqssqqqqsqssqqqsqsqqsqsqsqqqsqsssssqqsqsssssqsssqqqqsqqssssssqssqqssqssqqssssqqqssqsssqssqssqqqssssqsssssqsqqqsqsqqsssqqsqssqqsqsqsssqqsqqsqqsssqsssssssssqqqqsqqssqsqsqsqsqqqsqssqqqqsssqqqssqsqqqsssssssssqssqssqqsqsqsssssqqqqqqqqqqssqqsqqssqsqsqsssqqqqsssqsssqsqqqssqqsqqssssqssssqqqqsqqssqqsssqqsqqsqqsssqqssssqqqsssqqsqsqssqsqqqqqssqqqssssqsqssssssqqsqssqsssssqsqssqqqqssqsssqsssqqsssqqqqqssqqqqqqqssqqsqqqqqqqsqqsqqsqqqsqqqqssqsqqsssqsqqsqqqqsssqsqqsqqsqsqqqqqqqsqsssqssqssqsssqsqqsqqssssqqsqsssqsqqqqqsqqsssssqqqqqqqqssssssqqsssssqsqsqqqqsqsssqqssqqssqssssqqsssqsqsqssqqqqqqsqqqqqsqqssssqsssqssqsqssssssqssqqssqsssqqqsqqsqqssqqqqsssqqsssqqsqqqsssssqqqqqsqqssssqqqqsqssqsqssqqqqssqsssssssssqssqsqqqsqqqqsqqqqsqqssqsqqsssssqqqqqssssqqqqssqsssqsqssqqqqssqssssssqqqsqqssqssqqqqqqqsqsqssqssqsqssqqsssssqsqqqsqqsqssssqsqssqqqssssssqsqqssssqqqssssqqssssqqssssqqssqsqssqqqqqqsqqsqsqqsqqsqqsqsqsssqssqssssssqsssqqssqqsssqqqsqssqqqsqqqqqsqsqqqsqssqqsqsqsssqqqsqqsqssqssssqqssqqqssqsqsssssssssssssqqqsqqsssqqqsqsqqqsssqssqsqqqqsqsqsqsqqssqsqssqssqqsqqqsqssqqqssqsssqssqsqsqsqsqqqsqqqqssqqsssssqsqqqssqqqqqqqqsssqsqssqqqsqsssssqssssqqqqqqqsssqssqsqqqsqsqssssqsqqsqqsssqqsssqqsqsssqqqsqsqqssqsqssqssqqsqsqqqqsssqqsqqssqqqqqssqqqsqqqqsssssqqssssqssqqsssqqqssqqqqqssqqqqsssqqqsqqsqsqqqqqsqssqssqssssssqqqsqssssqqqsqqqqqqssqsqqsqqsqsqqsqsqqqqqqqqqsqqssqssqqsqqqqqsqqssqsqsssssssqsqqsqsqsqsqsssqqqsssqsssqqqqsqsqssqssqsssqsqqsssqqqqqssssssqsqsssqqqqssssqqssssqqsqqqqsqqqsqqsqssqqqqqqqqqsqqssqqssqqsssqqsqqsqssqqsqsqqqsssssssqsssqqqssssqsssssssqqqqqqqqqssssssssqqqqsqssqqqssqsqqssssqssqsqsqsssqqqqssqsqqssqsqsssssqqqsqssssssqqsqqqqssssqsqqssqqqqsqsqqqqqqssqsqqsqqqqsqssqqsssqssqqqqsqssqssssqsssqsqqqqqqsqqqqqqqssqsqssqqsssqqqqssssssqqqqqqsqssqqssqssqqqssqqsqssqsqsssqqsqsqqqsqssqsqqsqqsqsssqssssqqqssqqsqsqqsssqsssqqqsssqsqsssqsqqssqqsqqsqqssqsqsqsqsqqssqqssqsssqssssqqsqsssqsssssssssqqssqqqqqssssqsqssqqqssssqsqsqqssqsqssqqqqsssssqqsqssqsssqssqqqqsqsssqqsssssqqsqqssqsqsqssqsqqsssqqssssqssssqqqsssqsssqssqqqqqqqsqqsssqqqqsssqqqssssqqqqqqqqsqqssssssqssssqqqqssqsqqsqsqssqqsqssqqssqsqqssqqqqqqsqqsqsssqsqqsqsssqsqqsqqqsqsssqqsqqqqqsssssqqqsqsqqsqqqssqsqsqsqsqqsssqssqqqqsqqssqqsqqsqssqsqqqssqqsqsqqqsqssqsqqqssqqssqqsqqsqsssssqqqssqqqsssssssqsqsqqssqsqsqqqqqqsssqsssqqsqsssssqsssqssqssqssqqssqqqqsqqsqqqqssqqsqqsqqsqsqqqsqsqqqssssssqsqqsqqqsqsqqqqsqssqsqqssqssqqssqsqqqqqsssqsqsqsqsqqsqqqsssqqssqqssssssqqssqqsqqsqsqqsqsssqqssqsqqssqqqsqsqqqsqqqqqqqqsqqqqqqqqsqqqssqssqqsssqsqqqqsqqssqsssqsqsqssssqqqsqsqqqsssssqssqqssqssqssqqsssqqqsqqqqsqsssqssssqqqqqsssssqqssqqqqsqssqssssqqqqssqqssqqqqssssssqsqsqssqssqqsqqsqqsqssssqsqsqsqsqsqqssqsqsqqssqssqqssqsqqqsssqsssqsqsqssqssssqsqqsssqssqsssqsqqqssqqsqssqsqqsqsqssqqqqssqsqqsqsqssssqsqqsssssssqqqqssssqsqsqsqssqqqsqsqqsqqqssqsssqsqsqsqsqqsqsqqqqsssqsqqssssqsqsqqssqqqssqqqsqsqsssqsqssqqsqssqqqqsqqssqqssqssqsqssssqsqssqqsssssqsssqqqsqsqqsqsssqqssqqssqsssssqqsssssqqssssssqqsqsssqssqqqqssqsqssqsqsqqqsqsssssqsssqqsssqqsqqqqsssqsssqssssqsqqqqqqssssssqsqqsqsqssqqqqqssssqsqqssqsqqqqssqqqqqsqqqssssqssssqssqsssqssqsssqqqssssqssqqqsssssqqqqqsqsqqqqqqsqqqqqqsqqqqqsssqsssqqqqqsssqsqqqqqqssqqssqqqssqssssssqssqssqqsqqqqqqqsqqqssqqqsqqqqqsqqsqqqqsqssqsqqssqqsqssqqqsssqqsqqsqqsqqqsqsssqssqsqqqsssssqsqssqsqsqsqqssssssqsqqqsqqqqqsqsqqssqsqssqsssqqqsqqsqssqqqsqqqsssqqsqsqqsqsqsqqsssssqsqqqssssssqqqsssqqssqsqqsqsssqqqsssssqqqsqssqsssqqsssqsqssqsqssqqqqqsqsqqqssqqqsqsqssqsssqssqqqsqsqssqqsqqqsssqqqqqsqssqqqqqqqsqsssqssqsqqqssqsqqsqssqsqqqsqsssqqqsqqsqqssqsssqssqssssssqqsqsqsqssqssqqssqsqqqqqqqsqqqssssssqqsssqsqssqsqqssqsssqqqqqsssssqssssqsssqqsqqsqqqsqqsqqssqqsqqqqqssqsqqqsqqqsssqssqqssqsqqsqqqssqqsqsssssssqsqqqssssqqsqqssqsqssqqqqqsqssqqsqqsssqssssqqsqqqqsqssqqsqsqqqqssqqqqsqsqsssqqqssqssqssssqssqqssqssqssqqssqqssqssssqqssqqssqssqssqssqqsqssqqsqsqqsqsqqsqssqsqqsssqqqqssqqsqqssqqssqsqqssssqqqsqsqssqqsqssqsqsqssqqssqsssqsqssssqqqssqsssqqsqssqqsqsqsqqsqssqqsqsqsqsqqqqsqssqsqqqssqqssqqqssqqsssqqssssqqssqsqqqsqqsqqqqssqsssssssqqsqqqssssqqqqqqqsqssssqsqssqqqqsqsqssqqqqsqqqqsqssqsqqsqsssqsssssqsqsqqsqsssssssqqsssssssssqqssqsqsqssqqqssssqssqssssssqqsssqqqssssssqssqssssqsqssqssqqsqsqsssssqqqqssqqqssqqsqqqqssqqqqsssssqqqsqqqsqsssqsqqssqqqsssqsqqsqssssqqsssssqqqsssssqssqqssssqqqssqsqqssqssqqqsqsqssssqsqssssqsqssqssssqqqqsssqssqsqsssssqsqqqqqqsssqsqsssqsqsqsqsqssqqsqsssqsqqssqsqqsssssqqsqsqssssqssqqqssssqsqqsssssssqqsqqsssqsssqssqsqqssqqqssqsqsqsqqsqqsqqsqqsssqsqqqqqqqqsssqqsqssssssqqqsqssssqssqsqsqqqsqqqqqsqqssqqsssqqqqqssssqqssssqqqsqssqqsssqsqqqsssqqqsqsssqqsssqsqssqqqqqssqsssqsqqqqsqsqqsssqqqqssqssqsqsqqsqsqqssssssssqqsssqqqsqsssqqsssqsssqsqssqsqqqqsqqqsqsqsqqsqssqqqsqqsqsqsqsqqqqqqsqsssqsssqqssqsqsssqqsqssssqqqsssqqqsqqqsqqqqqqssssqqsqsqssssqsqssssqsqsqsssqssqsqsssssqsqssqqqqqqsqqsqqqqsqqssssqsqqsssqqqqqqssqqqqqssqqqssqqqqsqsqqqsqqqqsqssqqqsqqqsqssqsqsqqqsqsqsqsqqqsqsqqsqqsqqqqsqqsqsqqssssqqqqsqqqqqqssqsqsssqqssqqqsqqsqsqssssqqqssqsqssqqssssqsqqqsqsssssssqqqsqqssqqqsqssqsqqssssqssssssssqqqqssqssqsqqqqqssqqssqsqssqsssqsqsssqqqssqqsqqqqqqsssqssssssqsqsssqqqqsqsqssqqsqsqqqsqqqqsssqqqsssqsqsqssssqssssqssqsqsqqqqqssqqsqqsqsssqqssqsqqqqsqsqqqsqqqsqqqsqqqqsqqqqqsqqssqsqqsssqqsqqssqqssqqsssqssqqqqssqqsqsssqqqssqsqqqssqqsqsssqqqqqsqqqqqssssqssssqqssqssqqqssqqssqqsqqqqqqqssqqqssssqqsqssqqqqsssqssqqqsqqssqsssssqsqqqqqqssqqsqssssqssqssqqssqsqsqqqssssqqqsqqsqssqsqsqqsqqqqsqssqssqqqqsqsqqsssqsqqqssssqssqqsqssqsssqsssssssqssssqssqqqqqqqssssqqqsqsqssqssqqssqqqqsqsqqqssqqsssssqssqqqssqsqsqqqsqqsqsssssqqssssqqqssqsqqsqsqqqsqssssqqsqqsssqqssqqqssssssssqqsssssqsqssqsqqsqqqqsqqsssqsqssqsssqsqsqsqqqqqqqqqqssqsqsssssssqsqsqsqssqqqsssqsqsqqqqqqqsqsqssqqssqssqssqssqsqqqsqqssqssqqsssqqsssqsqsqqqqssqqsqsqssqsqqqsqqqsqsqsssqqqqqqsqsssqsqqqssqsqqsssqqqqsssssqqqssqssqqsqqqqsssqsqqsssqsqqqqqqsqssqssssqqsqqqqqqqsqsqsqqssqsssqqssqsqssssssqqssqsssqsssqqsqqqqqqqsqsqqsssqsqsqsqqqssqssqsqssqqqsqqsqsqsqqsqqqqqqsssqqsqqsqsqsqqqsqqqsqsqssssqqqsssqqsssqqqqsqsssqssqsssssqsssqqsqqqsssssssqssqsqqqqsqssqqsqssqqssqqsssqsssqqqsqqsqqssqsqsssqsqsssqssqqqsqqsssqsqsssqqsqsqqqqqqqsqssqqqqqqssqqqsqsqqqssqssqssqqqsqsqqsqsqqsssssqqqsqqsqqssssqssqssqqsqqsssqqssqssqqssqqqqsqsqqsssqsqqqqqqsqqsqqqqsssqsqqqqqssqqqqqqsqsssqqqsqqsssqqssssqqqqsssssqsqsssqssssqqqssqqsqqqsqqsqqsssqqqqsssqqsqssssssqssqqqqqqsqsqsqqqqsssqsqssqqsssqqqqsssssqssqqsqsqsqsqqsqsqssssssqsqqqqssqqsssqqqqsqqqqqssssqqqssqqqqsqqsqqssqssqqqqsqqsssqqsqqsssqsssqqssqssqqssqsqsqqsqsqssqsssqqsssqqssqsqssssssqqqsqssqqqqsqqsqssqqssqqsssqsssqsqsqssqqssqsqqqqssssssssssssssssqsqssqsqssqqqsqssqssqssqsssqqssssqsqqqqssqqqsqqqssqssqqqqsqssssqqqqsqqsssqqqsqqssssqsqsqqqsssssqqsqqsssssssqqssqsssqqqqsqqsssssqsqqsqsqqqqsqsqsqqqqsqqsqssssqqsqqsssqqsqsqqqqsqqqsqqqqsssqqsssqqqqqqssssqqsqsqsqsqqssqssqqsqqqqqssqqqsqqsqsqqqsqqsqqsqqqqsqsqsqqsqqqqqqqsqqssqqsqsqsqqsqqssqssqqssqssqqsssssqqqqssqqsssqsssssqqsqssssqqsssssqqqsqsqssssssqssssqsqqsqqsssssqsqqsqssqsqssssqssqsqssqqsssqsqsqsqqsqqqsqqsqsqsssqqqsqqsssqqssssqqqqqsqssqsqsqqqssqsssssqqsqsssqssssqqqsssssssqsqqqssqsqsssssssqssssqssqqssqsqsqsqqssssqqqqqsqssqsqqsssqqqsqssssqsqssqsqssqsqsqqqqsqqqqsqsqssqsssqqsqssssqqqsqqssqsqsqsqqsqqqsqqssqsqssssssqqsqqqsqsqqssqqqsqqqsqqqsqssqsqssssssqsssqsqqqqqqssqssqsssssssqqqsssqssqqqsqsqqqqqsqqsqsqssqsqssqqsqsqqssqsqqqqqqqqqqqssqqqqqsqsssqssqsssqsssssqssssqqqqqqqssssqssqqqsqsqqssssqqsqsqsqqqsqqqqsqqsqssqsssqqsqqsssqsqsssqssssqsqsqqqqqqqssqqsssqqsqqqqqsqqqsssssqsqqqsssqssqsqsqqsqqsqsqsqqsqqsqsssssqssssssqqqsqssqqqssssqqsqsqsqsssqsqssqqqqqqqsssqqqsqssqssssqssqssqsqqssssqsqsqssqqqssssqsqsssqsqqqqqqsqqqqqqssqqsqqssssqqssqqsqqqssqsqqqqqsqssqqqsqqsqsqssqsqqssssqqqqqsqqqqqqqsqssssqqsssqsqsqqsssqqqqqqqsqqsssqqsqssqsqqsssssqqqqqssssqqssqqsqssqsssqqssqqsqqssqqqsssqssqqqsssqqssqsssqqqqqsqssqsqsqqsqsssqqsssqssqqsqsqssssqsqqqsqssqsssqqssssqqsqqqsssqssqqqsqssqsssqqqqqqqsqqqssqqqssssqqqqsqqsqqqsqqqqqqssqqqqssqsqsqqqqssqqqqqqqqssqqsssqqqssqssqqqqqqssqqqqqqqqqqsqqsssqsqsssqqqsqqqsssqqssssssqqsqsqsqqsqqqsqsqssqssqqsqssqqssssqqqsqsqqqsqqqqqsqqsqsqqqqqqqqqsssqssqqqssqsqsqqqqqqsqssqsqssssssqqqqqqqsqqqssssqsqqssqqqsqsssssqssqsqsqqsqqqsqsqsqqqqqqqqsqqqqsqssqsqsqqqqsqqssqsssqssqsssssqqssqsqqsssqqqsqqqqqqssqqsqsssssqqsqsqqqqqssqssqssqqqqssqsqsqqsqsssqsqsssqssqqqqsqsqqsqsqssqqqsqssqsqsqqqqqqqqqsssqqqsqqqsqqsssqqqqsqqsqsqqssqqsqsqsqqssqsssqsqsssssssqsqqssqsqsqqsssqssssqsqsqsssqqqqqqsqsqsqqqqssqqqsqssqssqqsqqqqqsqqsqssqssqsqssssqqsqqqqqssqqsssqqsqqqqqqqsssqsqsqqqsqssqssqqqqqsqsqsqssqsqqqqqsqqsqqqqqqqqssssqssqqsqsqqqqqsssqsqssssssqssssqqsqqssqssqqssqqqqssqqqsqsqqqsqqsssssssssssqqssqssqqqssqsqsqsqssqqssqqssqssssqssqqqsqsssqssqqqsssssqqssqsqsqsssqssqqqqsssqqsssqqsssqqsssqsqsqsqqqqqssqqqqsqsqqqqqssqqqqqsqqqqsqssqsssqsqsqqqqqqqqssqqqssqssqqssssssssssqqsssssssqssqsssssqqqsssqssqsssssqqssqssssqqqsqssqsqqsqsssssssqssqqsqqsqqssqqsqqqqqsqqqqssqsssssqqsqssqsssqqqqssqsssssqqqqqqsssqssqsssqssssssqqqsqsssssqsqqqssqqqsqsqsqqqsssssqqsssqsqsssqsqqqqqsqssqsqqssqqsqsssssqqsqsqsssqqqsqssssqqqqsssqqssqsqsqqsqqsqssqqsssqqqssssssqqsqsqqqqssqssqqsqqsqqqsqqsqssqqssssqqsssqsqqqsqsqqqsqqsqssqqsqqqqssqqsqsqsqsqssssqssqqsqqqqsssqssqqqqqqssssqsqsqsqqqqssqqssssqsqsqsqsssqssqsqqsssqqqqssqqqqqqqsqsssqqsssssqqqqsqqsqssqqqsssqssqsqqqsqqssqsqqssssqsqqssqqqssqqqsqsqqqqqqsqsqsssqsqqqqssqssqqssssqsssqssqssqqqsqssqssqqqssssqssqqsqsqsqqssqqssssssqsqqqqsqqsqqssqsssqssqqqqssqsqqssqsqsqqssqsssqqssqsqsqqssqssssqsqsqsqsqsqqssssqsqqqsqqsqsqqqsqssssqsqsqqsssqqsssqsqsqqssssqsssqsqqqssqssqqsqsqqsqqsqqsssqsssqqqqqqqqsssqsqsqqqqsqqsqssqsqsqqqqsqqsqqssssqqqssqqsssqqssqssqssqqqssqsssqqqqqsssssqqsssssqsqqqqqqsqqqqqsqqssqqqssqqqsssssqqqqssqqqqqssqsqsqsssssssqqqqsssqqsqqqqsssqqqsssqqssqsssqssqsssssqsqssqsqsqqqsssssqssqqsqsqsssssqssssqqsssssqsqsqqqqqqssqqsqqssqssqqsqsqsqssqsssssqqqqqsqqqqqsqqqqqssssqqqqqqsqsqqssssssqqqsssqqqssqsqssqssssssqsqsqsssqssssqqssqsqsqsqqqqssqssssqqssqsqsqqsqqqsqqsqqqqqsqqqssqqqsqqqsqsssqqssqqqqssqsssssqsqqssssqsqssqqqsqqqsqqqsssqsssqqqqssssqsqqqsqqqssqqqqqssqssssssssqqqsqqssqsssssqqssssqssqqsqqsqsqqsqsqqssqqsqqqsqsqqsqqsqsqqqsqssqsqssssqssssqqssqsqsssssqsqssqsqsqsqqsssqsqqsssssqqqqssssqsqsqsqqsssqssssssssssssqsqsqsqqsssqqqsssqqsssqqsqqsqsqqqsssqqssqqqqssqqqssqssqssssqsqqssqqqqssqsqssqqsqqqqqsqqqqssqsqssqqsqqqqqqqqqssqqqssssqssssqssqqqqqqqssssqssqqsssqqqssqssqsqqsssqqsssqsqqssssssqqssssqqqqsqqsssssqsqssssqqssqqqsqqqssqqqqsqssqqsqsssqqssssqsqsqsqqqssqqqqssssqqsqssssssssqqssssqqqqssqqsssqsqqqssqsqsqqqsssqsqssqsqqsqqqssqssqsqqsqsqsssqqqqqqsqsqqqssssqqssssqsqssqqqqsqssqsqqsqsssqqsqsssssqsqsqssqqssssqsssqqsqsqqqqqsqsssqqssssqsqssqqssqsssqqsqqsssqsqssqqsqqqssqsqssqqsqqqqsqssssqssqqqssssssqqqsqqsssqsqqqqqssqqqqssqssqqssqqsssssqssssssqqssqsssssqsqsqsqsqssqqqqqqqsqsqqsqqqsssssqqsqsssqsqqsqqsssqsqssssqqqqqssqsqsqssqqsqsqqssqqqqqqqqsssssqsqsssqsqsssssqqssqqssqsqqsqsqqqssqqsqsqssqsqssqssssqsssqqqqsqssqsssqssssqssqqsqqqsqsqssqsqsssqqqsssqqqqssqqqssqsqqqqsssqsqsssqsssssssqssqqqqssssqqsqqqssqqssssqqqqsqqqqssssqsssqqqsssqqqqqqsqqqsqqsqsssqsqqqsqsqqsqqqqssqsssqssqqsqssssqssqqssqqsssssqqqsqqqssqssqssqqqqsqsqqqqsqqsqqqssssssqssqsqqsqsssssqsqsssqqqsqqsqsqsqqqqsqssqqsssqqssqqqqqqsqqqssqqqsssqssqsqsqqqssqqqsqsssssqqssqqssssqqqssssqqqqsssqqssqqqsqssqsqsqsqssqqsqsqqqsqqsqqsqssqqsssqsqqsqssqqqsqssqssssqqssqsqsssqsqssqsqsqssqqsssqqsqssqsqqqqqsssssqqqqqqqqqssssqqsssqqssqsqsqqqsqsqssqqqqsqsqsssqqsqqssqssqqsqqqqqqqsqqqsqqqsqsqqqqsqssqqqsqqssssssqqssqsqqqsqqssssqssqsqsssqqqqqssqssqqssqqssqqsqqqsqqqsssssqqsqqqqqqsqsssssqsssqsssqsqsqsssssqsqqqssqqsssssqqqqssqsssssqssqqsssqqsqqqqsqsqqsqqqssssssssqqqsqsqsssqssqssqqssqsqsssqqsqsqqssssqqqsssqqqssqqsqsqqsssssqqqssqsqsqsqssqqsqsqssqsqsqssqqqqqqsqsssqsssssqqqsqqsqssqqsqssssqssssqqssqsqssqqqqqsqsqsqsqssqsqqsqqqssqssqqqsqqqssqqqssqqsqssqsqqqsqqqqsqqsssqsqqsqqsssqsqsqssqsssqqqssssqqssssqqsssqsqssqsqqqqqqqssssqsqsssqqssqqqssqsqqsqqsssqsssqsqqqssqqqsqssqqsssqsqqsssqssqqsqsssqsqqsqqqsqqssqssqqqssqssssqsqqsqqsqqqqqsqqssssssqssqqqqqqqqsqqqqqsqqqqqqqqsqssssqssqsqqqsqqqqsqsqssqsqqssqqssqqsqsssqssqssqssqqsqqsssqqsqssssqqsqsqqssqqqqsqqqqqqqsqsqssqsqqqqsqssqqqqsqqsqsssssqqssqsqqsqssqqqsqssqssqsqqssqqqssssqqsssssqqqqqqssqqqssqssqqqsqqssqsssqsssssqqssqsqqqqqqsqqsqqqssqsqqsqssqqqqqqsqqsssqssssqsqqssssssqsqssqqsqqssqqssqqsssssqqqqqssqssqqssqsqqsqsqsssqsqqsqqqsqsqsqqqqsqqssqqqsqsqqsqssssssqqqqqqsqsqsssqssqsssqqsqsqsqqsssqssqqqsqqqqqqqqqsssqqsqssssssqsqqsqqsqqsqsqqssssssqqqqsqssssqqqqsqqqqqqsssqsqsqsqqssqsqssssqsqqsssssqqqqqqqqqqsqsqsqqqqqqqsqqssqqsqssqssssqqqssqsqqqqsqssqsqqsqqsqqqsssqqsssqsqqsssssqsqqqssssqssqssssqssqqqqqssssssssqsssqsqssqqqssssqqqqqqsqsssqqqqsqsssqqssqqqssqssqssqqsqqqqqqqsssqqsqqsqsssqsqqsssqsssssqqsqqssssqqssssssqssqqqsssqqsqqqqqsqsqsqsqqsqsqqssssssssssqqsssqqsqqsqssqssqsqqsqqsqqqsqsqqqsssqqsqqsssqsqsqqsqsqsssqqssqqqssqqqqqqqsqqsqssqsqsqssssqssqqsssqqsqsssqssqsssssqsssqqsqqsssqssssqsssqsqsqqssqssqqqqqqsqqsqsqsssqsqqsssssssssqsqsssssqqqqqsqqqqsssqsqqsssqsssqssqqsqssqsqqqsqqqssqsqqsssqsqsssssqqqsssqsqsssqqssssqqsqqqqsssqsqqssqqqsssqqqqqsqsssqqqqsqsqqssqqqsqqqqssssqsqssqqsqsqqqqsqssqqssqsqssqsqsqsqqsqsqssqqsqsqqqqqssqssssqqqqqssqqsssssqsssqsssssssqqsssqsqsqsqssqsqsqssqqsssqqsqqsqsqsssqqssqqqsqssqqqsssssssqsqqsqqsssssqqssqqsqsqqsqsqqsssqsqsssssqssqqqqssqsqqsssqsssqsqqssqqsqsqqqsqsssqsqqqssqqqqssqsqssqsqssqsqqsqssqqssqssqqssqsqqssqqsssqqsqsqsqqqqssqsqsqsqssssqqqsssssqqssqsqssssqqssqqqqsqssqssqssqqsqsqsqsqqqssssqssqqsqssqsqqssqsqsqsqqqqqssqsqsqsqsqqssqqqsssqqqqqqsqqqssqssqsssqsqqssqqssqsssssssqqsqqqsqsqqqqqsqqqqsssqqqqssqqssqqssssqqqsqssqsqsqssqqqqqsssqsqsqsqsqqsqqsqsqssqsssssqssqssssqqqsqssssqqssqqqsqsqsqqsssqqqsqqqqssqssqqsssqqssssqsssqsqsssqsqqssqqsqsqqqqssqqsqqqssqqqsqqqqqsssssssqssssqqsqssqsqssqsqqqssqsqssssssqsqqqqqssqqssqssqssqsqqsqqsqsqqqssqqqsqsssqqsssssqsqqsqqsssqssqqsqsssqsqqqsqssqsqssqqsqqsssqssqsqqssqssqsqqssqqqqsqqsqqqqssssqsqsssqqqqsssqsqsqqsqqsqqqssqsqsqsqsqqssqqqqqsssssqqqqqsqsqsqsqqqssqqqssqqqsqsqqqsqqqqqqsqsqsqqqqssqssssqssqssqsqqsssqqqssqqqqqqqssqqqssqsqssqssqsqssqsqsqqqqqsqqqqssqsqsssqqqqsssqqqqqsqqsssssqqsqsqsqsqqqssssssqqssqsqqqqsssssqssqssqssqqqsqsssqssqssqsqqqsqsqsqqsqsqsqsqqqqsqsssqssqqsqssqqsqsqqssssqqsssssqssqssqqqqsssqqqqssssqsqsqqssssqsqqqqsssqsqqssssssqqssqsqqqqqsqssssqqqqsssqsqqqqsqqqsqqqqsqqqqqqsssqsqqqsqqqqsqsqsssqsqsqssqqqqqsqsqssqsqssqsqsqqsqsqssqsqqssqqqssqssqqqsssqqqsqsqsssssssssssqqqqsssqqqssqqqsqssqssqqssqsqqqqqqqsqqsqqsqqqqqqqqqqssqqsssqqqqssqsqqqqqqssqqqssqqssqqqsqssqqqqsqqqsqsqsqsqqssqqsqqqqsqssssssqsqqssssssssqqssssssqssssqsqssqqqssssqsssqqsqssssqssqqqqssqssssqssqssqsqqsqssssssqqqsssqsqqsqqqqqqsqqqssqsqsqssssssqqsqssqssqssqsqqsqsqsssssqqsqsqsssqsqqqqssqqqqssssqqqqqsssqqssqqqqsssqsqsqsssqsqqsqqqqssssqsqssqqqsqqqqsqqsssqsqqsqsqssqsssqsqsqsqqsssssssqqsqqsqqqssqsqqqsssqsssqqqqsssqqssqqqssqsqssssqqqssqqssqsssqqqssssqsqssqssqqssqsqsqqqqssqssqqqsqqqsssqssqssqqsqqqqsqsssqqsqqqsssqqsssqsssqsqqqqssssqqqssqqsssqsqqqsqqqsqsqqsqqqqsssqqssqqqqqsqsssqqqqqsqqqqssqqssssqsqsqqsssssqssqssqqsqqsqqssqqssqsssqqsssqsssqqqqqssssqssqqssssqqssqsssssqssqqsqsqsqqqsqsqsqssqqssqqqqsqqsqqsqsqssssqsssqsqqssssqsqqsqsqqqsqqsqsqsqqsqqssssqqssqqssqsqqqsqqsssqsssqsqqsqqqqsqsqqssqqqqsqsssqqsqssqsqqssqqssssqqsssqssqsqssqqssqqqqsssqqqqsqssqsssssssssqqsssssqqqsssqsqqqqqqsqqsqqssqqqqqsqsssqssqqqsqqsqsqqqsqqqqsqqsqqqsqsssqqqqqqqssqqqqsqssqqsqqqsqssssqssqsqsqqsqssqsqsqqqsqqqssqssqssqqqsqqsssqssqqssssssqqqsqsqssqssssqqsqsssssssqssqssqqssqsqqqsqqqqqssqqqqssqsqsssqqqssqqqsssssqqqqqqqssqqsqsqsqsqqqqqqsqssqsqqsqqssqqsssqsqssqssqsqqssqssqsqssssqsssqqsqsqqqqqqssssqsqssssqsqsssqssqqsqqsssqsqqsqqssqqqqqssssqsqsqqsqsqssssssqqqsqsqqqssqsqqqqssqqqqsqssqqsqsqqqqqqqqqssssqqqssssssssqssqqsqssqsssqqsqqqqsqqsqsqqqqqsssqsssssqsqqqssssqsqqqsqqsqsqqsqqqqsqqqssqqssqqsqqssqqsqsqsqsssqqsssqsqsqsssqsssqsqsqsqsqqqsssqsqqqqssssqqsqqqqsqsqsssssssqsssqqqsqqsqssqqssssqssqsqsssqqqqqqqqqqssqsqsqqqqsqqqsqsqqqqqssqqqqqsssqssqsssqqqqssqsssqssqqsqsqqssssssssqqsqsqqqqsqqsqsqssqqsqssqqssssqqqqsqssqqsqsqqqqqqqsssqssqqsqqqqqqsssssqsqsssqqqsqqssqssqsssqqqsqqsssqssssqsqqsssqssqqsqsssssssqsqsqsqqqqssqqssssqssqqqqssssqsqqsqqqqsqssqqqsssqqqssqsssqqqsssqssqqqqqsqqsssqqssqqsqqssqsqqqsqqsqsqqsqqssqqqqssssqssqsqsqssqssqsqsqsqsqqqsqqssqqqqsqqqsqsqqsqqqqsqqqqssssqsssqssqsssqqqsqqqqsssqssqqssssqsqsqqqqssssqssqsssqssssssqqsqsqqqqssqssssqsssqsqssssqsqqqqssqqqsqssssqqsqssssssqssqssqqqqssqsqqqssqqsssqqqssqqqsqqssqqsqqssqqssqqqsssqqqssqqqqssqqqqqssqsqqsqqsssssqsqqsqssqqsssssqsqqsqssqqsqqsqssssssqqqqsqqqqqqqqsssqsssqsssssqqsqsqqssssqsqqqqssqqqqsqsssssqqsssssssssssqqqsssssqssqsssqssqqssqqqqqssqsqqsqqssqqsqqssqqsqqsssqsqsqsssqssqqsqssqsqssssssqsqqsqqssssqqsqsqssqsqqqsqssssqqqsssssssssqsqssssssqqqqsqsqssqssqsqsqqqssqqssssssqqqsqqsqssssqqsqqqsssqsqssqqsqsqsqsqqqsqsssssqqqsssqqsqqsqsqqssssqqqqqsssqssqsssqssssqqqssqssqqqqssqsssssqssqsqqssssqqqqsqssqsssssqsqqqqsqsqsssssssqqssqqqsssqqqssqssssssqsqqqqqsqsssssqqqsqssqsqqsqqqsssqqqsqssssqsqsqqsqqqqqsqqqqqqqqqqqsqqqqqsqqqsssqqqqssqsqssqqqqqqqqqqqqqsqssqqsssqssqsqssqsssqqsqqqsqqqsqssqqssqssqsqqqqqqsssqqqqsssqssqqqsqqqsqqsqssqqqqsqqqssqssssqqqqqsqssssqssqqsqsssqqssqqsqqsssqqsqsssqsqqsqsqsqsqssqssssqssqssqsssqssqqqsqqqqqssqsqqsqqqsqqqqsqsqsssqqsqqssssqqqsssqssqqqssssssqsqssqsqqqqqsssqqssqqsqqqqqqqqsssssqsqqsqqsqqqqqssssqqsqqqsssssqsqsqqqsqqsqsqqqsqqssqqsqqsqqqsssqsqqsqqsqqsqqqsqqqsqsqssssqqssssqsqsqsqqqsqsssssssqqssqqqqqsqsqqqqqssqsqsqqqsssqsqqqsssssqqqssqssqsqsqqssqsqqsqqsqqssqsqqqqqsqqqsqsssqqqsqsqsqqssssssssqqsssqsqssqqssssqsqsqsqsqsssssqsqqsqssqqssqsqsqsssqqqqsqqssqqssqqqssqssqssqsqqsssssqsssqssqqqsqqqqsqsqsqqsqqqsssqssqqqssssqqsqsssssqsqsqqsqqsqqqssssqsqssqqssqqqqqqssqsssssqssqssqqsqsqsqsqsssqqsqsqsqsssqssqsqsqqqqssqqqqqsqqssqqsqsqqssqsssssssqsqqsqqsssqqqqqqsqsqqssqsssqssqssqqssqsqsqqqsqsqqqsqqqsqqqsqsqsqsqsssqqsqssqqsqqsssqqsssqssqqsqqqssqsqqqsqqqqsqqqqqssssqssqqqsssqssqsqsssqsqssqsqqqssssqqssqqqsqqssqqssqqqqqsqqqqssqssqssqqqssqqssssqsssqqsqqqqsqqqqqsqqqqsqsqsssqqsssqsqqqsssqqqsqqqqqssqsqqssqsssqqsqqssssssqqsqsssqqqqssqssqqqsssqssssqsqqsqqqqsqqqqsssssssqsqsqsssqsqsqssqsqsqssssqqsqsqqqqssqqqssqqsqssqssqsssqqsqsqqssqsqqsssqsssqqqsqsqqsqssqsqqsqqsqqsqssqqqqqsqsqqsqssqqqssqssqqssqssqsqsqsqqssqqqsssssqqsqsssqsqqqssqqqssssqqssqsqqqqqsqsqsqsqssqqqqqsqsqsqqqqqqqqqssqssqsqqsssqsqsqssssssqqssqqqsssqqqssssqsssqqsssqqssqssqqqqqqqqqsqssqqssssssqqqqsqqqsqqqqsqqqqsqsqssssqsssqqssqqqssqqssqsqqsqsqqssqsssqqsssssqqsqqqqsqqssssqsqsqsqqqsqqsqqsqsqsssqssssqssqssssqqssqsssqsqsqsqsssqsqsqsqqqqsssqsqsqssssqqqqqqqqqqqqsqqsqsqqqqsssqsqsqqqqqqssssqsqsqqsqqqssqqqsqqqsqqqqqqqqqqsqssqssqsssqqqqsqssqsqqssqqqsqsqqqsqqsssqssqsqsqsssqsqqsqsqssqqssssqqsqqqssqsssqssqssssqqsqsqqqsssqqssssqsssqsssqqqsqqqqsqqsssssqsqqqssqqsqsqsqssqqsqqsqqsqqsssqqqssqsqsssqqsqqssqsqssqsssqqqssqsqqqsssqqsssqqssqssqqsqsqqssqsqqqqqssqssqsqsqsqsqsssssqqqqsqqsqqqqsqqqqsqqqqsqssqqqssqqsqqssssqqsqsssqqqsqsqqqsssqsssqqsssqsssqqqssqssssqssqqssssqsqqqsqssqsqsqqqqqsqsqssqssssqqqssqsqqqqqsqsqsqssqqqqqqqqqssssssqsqsqsqqsqssqqssqsqqsqqqsqsqqsqssqqsqqsqqssqqqssqqqssqsqqsssqssqqqqsqqssqqqqqsqsqsqsqqqqqqsssssqqqqsqqqsqssqqsssqsqsqsqqsqqqqsqqsqqqsqsssqsssqssqsssqsssssssqqssqqqqsqssqsqsqsqssqqsqsqsqqqqsqsssssqqsqsqsqqqsssqssqqsqssssssqqqsqsssqqqqqqssqqqqsqsqssqsqsqssqssqsssqqsqssssqsqqsqqqssqqqssqsqsqssqqqssqssqqqqqssqsqsqssqqqqqsqssssqssqsqqqsssqqsqqsssqqqsqsssssqsqqqsqqqqqssqqsqqssqsqsqssqsqqqssssssssqqsqsqqsssqsqqssqsqqqsssssqsqsqqqsssssqqqqqqqsssqsssqqssqqssqqqqqqqsssqqsssqqssqqqqsqssqsqqsqsssqssqsssqsqssqqsqqqssqqsqqsqsqqqqqqqqsqsssqsqqqqsssqqqssqsqsqqssqqqqssqssssqqqqssqqsqqqqqqqqsssqsssqqqqqqsqqsqqsssqssqqsqssqsqsqssqqqqqqsqqsssqsqssqqqqqqqqsqssqssqqssqssqsqqsqqqqssqsqsqqqsqqssqqssqqssqqsqssqsqqsqssqsqssssqqsqqsqqqqsqsssssqqqqqssssssqssqqsqssqsssqqqsqqssssqsqqsqssssqsqqqqqssqsssssqqsssssqsqsqqsssqsssqsqqsssqssqsssqssssqqqqqsqsqqsssssssqsqsqqsqsqqqsssqsqqsqqsqqqssqsssssssqsssqqqqqssssssqqsssssqqssssqsqqqsqsqsqqqsqsqqsqsqsssqqqqssssqqsqqsqqsqsqsqqqssssqqsqsqqqqsqsqqsqqqsssqsqsqsqqqssssqqqsqqsqsqqqqqqsqsqqqqqssssqsssqqqssqqqsqssqqqsqsqqqsqqsqsqqqssqqsqqsssssssssqssssssqqqqssssqsssssqsqssqqqqqqssqssqsqqqsqsssssssssssqqsqsqqsqssqsqqqqsqsssqqqsssqsqqqsssqsqqsqsssqssssqqqqqqsqsqsssqsssqsqsqqssqqqssqsqqssqqsssqqsqsqqqqsqqqqssqsqsqqsqqqqsssqqsssqqsqsssssqsqssqsqqqssqqssssssqqsqqsqsqsqqqssqssqqqqssssqqsssqqsqsqqssssqqsqqqqssssqssqsssqqqssqqsqqsqqqssqsssssqqsssqqsqsqssssqqqqqqsqqsqsssqsqssssqqqqqqsqsqssqqsssqqqsqqqsqqsqsssqssqsqssqsqqqqssssssssqsqssssssqqsqqsqssqsqqssssqsssssqssqssqsqqqsssssqsqqssqsqsqsqqsqqqssqsqsssqqqsqsqsqqqsqsqsqsqsssqqsqqqqqqqqqqqqsqssqqqsqsqsqqsssssssqqqsssqqqqsssqqssssqqssqsqqsqqqqqsqsqqqsqqqsssqsssqssqqssqqssqqsqqssssssqsqqqqqqssssqssqsqqsqsssqqqqqqsqssssqsssqssssqsqsssqqqqqqsssqssqsssqqsqqqsqqqsqssssqqqqqqsqqssqqsssssssssqsqsqqsqqqqqssqssqsssqsqsqqssqqqqqqsqqsssssqsqssqqssssqqqqsssqsqqsqqssqssqssqsssqqsqsssssqqsqsqsqqqsssqqqsqqsqsssqsqqsqqsqqssqqqssqssqsqqqqssqssqsssqqqqqqssqqqsqqqqqsqsqsqqqqssqsqqqqssqsssssqqqqqqqsqqqqsqssqssssqsqqssqssssqqqssqqqsqqqqssssssqqsssssqsqqsssqssssqqssqssqqqsqsqsqqsqsqqqqsqsqssssqqsqqqqqqqqqqssssqsqsqsqsqsqsqsqssqsqqqssqqqqqsqqqqsqqqqqsqsqqsqqsqqssssqsssqqsqsqsssqqqsqqqqqqqsqsqqsqsqsqsqssqqsssqqsqqsssssssqsqqssqqsqqqqsqsssqqsqqqsqqqqssqssqsqssqqssqsssqqsssqqsqssqqsqqsqqssqsssqsqqqqqqqqqqsqqssqsqqqqqsqsqqssqsqsssqsqsqssssqssssqsqsqsqsqqssqssqsqssqqsqsqsqssssqqsqsqsqqqsssqqqsqqqsqsssqqqsqqssssqqqsqssqssssqqqqssssqsqsqsssqqsssqqqsssqsssqsqqssqsqqssssqqssqqsqsssqssqsqqsqsqsqssqsqsqqssqsqssqsssqsqsqqsqqqssqsqqqqsqqsqqssssssqqssqsqssqqsqsqqqsqqsqqqsqqqqssssqsqsqqqqsqqqqsqsssssssqqsssqsqssqssqqsqqsssqssqqqssssqsssqssqssqsqsqqsssssqssqssqqqsqsqsqsqqqssssqqssqsqqqsqsssqqsssssqsssqqsqsqqsqsqssqqsssqssssssqsqssqqqsqsqssqsssqqsqsqssqsqsqqqqqqssssqqqqqsqqqqsqqqqsqqqssssqssqqqqssqssqsqsqqqqsqqssqsqqsqsqqqssssqqsqqsqqsssssqssqqqsssqqqqqsssqqqssqssqqsqqqqqsqsqssssssqsssqqsqqsssqqssqssqqsqqqsssqssssqqssssqsqssqsssqqsssssqsqqssqqsqqqssssqsqsqsqsqqqssqsssqqsqssqqqqqsqqsqqqssqqqsqqqqqqqqqsssqqqqsssqsssssssssqqsqssssqsssqqqqqsqqqqsqsqsqssqqssqssssssqssqqsqsssqssqsqssqqqsqqqqqqsssqsqssqsssqssqsssqqqqsqqqqqqsqsssqqqqssqssqqsqqqsssqssqssqssqqsssssqqqssqqqqsqsssqssqqsqsqqsqsqqssqsqsqssqsqsqqqsqsqqqssqqsqqssqssqsqssqqsqssqsqqsssqqqqqsqsqsqqsqssqssqqqsssssssqssqsqqqsqsqssqqqqsssqqqqqsssssssqsqsqsssqqssssqsssqsssqsqqssqssqsqsqsssqsqqqqqqqqqqqqsqqsqqqqqqsqsssqssqsqsssqsqsssqsqqsqsqqsqsqsssssqqsqsqssqssqssqssqqqqqsssqsssqqqqssqsqqqsqssqqqssqqssqqsqqsssqsqqssqqqqqssssqsqsqqqsqqqqqsqsssqsssqssqsqsqsqssqsqssssqsqssssqqsqsssssqqsqsqsqqqqqqsqqqsqssqqqqssqqqqqsqsqqsqqsqsssqqsqsqsqssqssqqqssqqsqssqssqsqsqqssssqqqqqssssqqssqsqsqqsqssssqqqsqsqqqssssssqsqqqsqsssqsssssqsqsssssqqqqsqsqssqsssqqqqssqqsqsqqsqqssqqqqssqsssqsqqqqqsqsqqqqqqqqssqssqsssssqqsqqssqqqqqssqsssqssqqsqssqqsqssssqqssqsqssqqqsssqqsssssqqssqqsssssqsqqssssssqsssqsqsqsqssqqsqqsqssqqqqqqqssqqsqsqqsqqqssqqsqqssqsqqsqqqqssssqqqqqqqssqsqqqqsqqsqqsqssqqqssqqqqqqqqssqqssqqssqsqqqsqsssssqsssssssqqsqsssqqqssqssqsqqsqqsqqsqssqsqsqsqqsssqqqsqqsqqssqssssqssqqqqqqssqsqqqqqqssssqqssqsqsqqqsssssssssqqqqsqqqqssqqsqssqqsqqqsqsqqsqssssqqqqssssqssqqqqqqqqqqssqsssqqsqsssqsssqqqqsqsqqqqsqqssqsqqqqqsqqssssqssqqssqqsssssqqsqsqssqqsqqssqsqsqssssqsqqqssqssqsqsqqsqqqsqqssssqsqssqqsqsqqqsssqqssqqsqsqsqsqsqssqqsssqsqsssssqsssssqssqsqsqqqqssssqssssqssqqqssqsqqsssqqssqqqqsqsqqsqqqqqqqqqqsssqqsqssqqsqsqsqssqsqsssqsqsssssqsqssqqssqqqqssqqsqqqqqsqqqqqqqsssssqsqsqssqqsqqsssqqsssqsssqsqqqssqqqsqqqqqqqssssqssqssqssqsqsssqssqqqqsssqqsssssqsssqsqsqqssqqsqssqsqqsqsqssqqssqsqqsqsssqsqqsqssqqssqssqssqsqsqqqsqqqssssqssssqqssssqsqsqssqqqsqqqssqqqqsqsssqqssqqssssqssqsssqssssqsssqqsqsssssqsqqqsssqssssqssqqssssqqqqsssqqqqqsqssqqqqssssssqsqqqqssqqsqqssqsqqsqssssssqssqqsqqqssssssqssqqsqqqqsqqqqssssssqsqqsqqsqssqsqqqqqqsqqssqqqssssssssqsssssssssssqqqqsssqqssqqsssqqqqqsqsssssqqsqssqqsssssqsssssqqqqqqqssqqssqqssqqqqqsqsqssqqqqsqsssqqqssqqsqqsqqssqqsqqqqqqsqqqqsqsqqqsqqssqsssqqsqsqqsssqsqsqsssqqssssssssqsqqqqssqsssqqsqsqqsqsssssqsssqqsqqssqsqsqsqqsqsqqqsqqqssqqssqqsssqsssssssqqssqqqsqsqssqsqsqsssqsssqqqsssssqsqssssqsssqssqsqssqsqqsssqsqqssqqssqssqqqsqsqsssqqqsqqqqsqsqsqqqsssssqsssqqqsssqsqssssssqqqqsssqsqssqqsqqsqqssqqqqqssqsqssqsssqqqqsqqqssqqqqqssssssssqqsqsqssssqsssqsqsssssqqsssssqqqqqqsqsqsssssqsqqqssqsqqsssssqqqqqqqssssqsssqqssqsssqqsqqsqqssqqqqssssqssqssqsqssqssssqqqssqsssssssqqqqqqssqsqsssssqssqqsqqqqqssssqsqsqqsqsqqqqssqqssqqsqqsqssqqqssqsqsqssssqsssqqqqqqqssqsqqqqssqsssssssssqssssqqssqqqsqqqqssqsqqqqsqssssqqqqqsqsqssssqsqsqsssqssqsqsqsssqsqsssqqqsqsqqqqsqsssqqsqsqqqsqssssssqqqsssqsssqqssssqsssqsqssqqqssqqqsqqsqsqssqqsssssqqsqqsqqqsqsqsqsqqqqsqssqsqqqqssqsqqqssssqssssqqssssqqqqssqsssqqsqssssqqsssssqsqqssqsqssqqqsqqssqsssqqssqsssqqssqqqsssqqssqqsssqqsqssqqsssqssqqqqsssqqqsssqqssqqsqqqqqssssqqsqsqsssssqqssqqqssqqssqqsqssqsqqqqsqqqqssqqqqsssssssssssqqqsqqqqqqqsqqssqqssqsssssqqsqsssssqqqqssqqqqqsqqqsqsqssqqqqsqqssqqssqssqqqsqsqsqsqqsqqssssqsssqqqqqssqqqsqsssqqsssqssqsqqqqsqsqqsqsqsqsssqqssssssssqqsqsssqsqqqqssqsqqsqsqsqsqsqqqqqqqsssqsqqqssqqssssqqsqqssqssqqqqsssssqqqqqsssqqqsqqssqssqssqsqsqqqqssqsqqsqsssqqqssssssqsqssqsqqssqsssqsssqsqqsqqsqqsqsqqqqqqsqqqqsqqsqssqqssqsqqqqsssqqsssssqsqssqssqsqsssqqssssqqsqqqsqsqqsssqqsqqqqqsqsssssqqsqqqqqsssqsqsssssqsssqqqqqsssqqsqsqsqssqqssqsqsssssssssssqqssssqsssssqssqssqqqssqssssssqsqqqqsqssqsqsqqssqsqsqsssqqsqsssssssssqqqssqqsqqssssssssqqqsssqqqssqssssqsqsqsqssqqssssqsqqqssqqsqsqsssqqqqqqsqqqsssqqqsqsqssqssqsqssqsqsssqsqqsqqqqssqsssqqssqqsqqsqqqqsqqssqqssssqqsqqqqssssqqsqqsqqqqqssqssqsqqsssqsqqqqsqqssqqsqsqsqsssqqqqsqqsqsssssqqssqsssqsqqqqsssssqqsssssqqqqqssqsqssqsqqqqqqqqqqssssqsqssssqqsqsssqssqsqqsqssqsssssqsssqsssqsqsqqsqqsqqqqqqqqqsssssssqqqqqssqqqsssssssssssssqqsssqsssqsqsqsssqqsqsqssqqsqqsqsssssqsqqqqssqssqssqsqsssqqsqssqqqqssqsssqssssqqssqqsqqqqqqqsqqqqsqqsssqqqsqsssqqqqqssqsqqqqssqqsqsqqsssqsqssqqssqssqqqqqqqsqssqssqqqqqqsqssqssqsqsssqssssqssqsssqqsqssssqqqqqssqsssssssssqssqsqqsssqqqqsqsqqqsqqsssssqsqsqqqqqsqqsqqssqqssqsqssqsssssqsqqqqqsqqsqssqqssqqsssssqsssqsqqsqqsqqsqqqqqqqsqsssqsqqqsssssqqsqssqssssqqqqsqqssqsqqsqsssssqsssqqqsssssssqqqsqsqqqsssqqqqsqsqqsqssqqssqqssqsssqqsqssqqssqsqqsqssqqqqsqsqsqqqsqqqsqsqqqqssqqsssssqsqqssqqqssqssqsssqqqssqsqsqssqqsqqssssqqqqqsqsqqsqqqsqqsqsqssssqsqssqqssqqqsssqqqqsqsssqqqssqsssssssqssqqsqsqqqqsssqqsqqqssqqqqsqqqqsqqqqsssssqqssqqqsqqsqsssqqsssqqqqssqqsqsssqqqsqssqqqqqqqsqqsqssqssssssqqqsssqssqqqqqqqsqqssqqsqsqqsqsqqsqsqqqqqqqqqssqssqssqqsqqsqssqqqqqssssqssssqsqqsssqqqqqssqqqqqsqsqsqssqqsqsqqqqssqssqqqqqsssqqqqqqqqsssqsqsssqssqsssqsqsqqsssssqsqsqsqsssssssqqqqqqqqqsqqsqsqsqqqqsssqqqqssqqqsssqqqqssqsssqqsssqqqqqssqssssssqqqqqqqqqqqqssssqsssqqsssssqssssssqsqqsqqqqsqqssssqqsqssqssqsqqsqsssqqsqqqqsqssqssqsqqsqqsqsqsqqsssqqqsqsqqqqsqssssqqsqqqssqqssqsssqqqqqsqsqssqqsssqsssqssqqqqqsqqqqqqqssqssssssssqsqqqqsssssqqqqqqssssqqsqqssqqqssqssqqqsssssssqsssqsqsqssqsqqsqqsqqssqssqsqqqqsqqssssqsqsqsssqqqqssqsqsqsqsqsssqqsqqqqssqqqqsqsqssqqsqqssqqsqqqsssqqsssssqsssssqsssqqsqqqssqssssqqqsqqqqqsqsqsqqqqssqsqsqqqsqsssssqqsqqssssqqssqqqqsssssqqsqsqqqqsqsssqqqssssqqqssqqqssqssqssssqqqsqqsssssssqqsqqqqsqsqsssqqqsqsqqssssssqssqqsqsqqssssssqssssqsqqssqsqqsqssqsqsssssqqssqsqqsqqqqqqqsqqqqssqqsqqsqsssssqqqqqqsqsssqqsqsqsssssssqsqssqqqqqqqsqsqqsqssqqqsssqssqqssssssqqqsqqsqsqqssqqsqqssqqsqqsqsssssqqsssqqsqqsqqsqsqsssqqqssqqsssssqqsqqsssqqsqqqsqqsqqqsssqqssssssqqqqqqsssqssqqsqqssqqsqqsqsqssqsqqsqqsqqssqqqqssqqssqqqqsqsqsqqqqqssqqsqsqqqqsqqsqsqsqsqsqqqssssqqqqqqssqsssssqqsssqqqsssqqssqqsssqssqqsqqqsqqsqsqqsqssssqssqsqsssqqsqqsqqqssqqqqqqqssqqqqsqqssqqqsqsqqqsssqqqsqqsqsssqssssqqqqsssssqsqqsqqqqsssssqqqqsqssqqqsqqssqqqqqqqqssqsssqsqqsqqqsqssqsqqqqsqssqqqsqqqsqssqqqssqqqsqsqqssqsssqqqqqsqqqssqqqqsqqsqssssqqqsqsqsqsqqsqqssssqssqssssqqqsqqqsssqqssqsqssssqqssqqsqqqsqsqqqsssqsqqqsssqsssssssssqsqssqqsqssssqqqssqsqssssqqqssssssqsqqqsssssqsssqsssqqsssqqqqqqqssssssqssqsqsqqsqqqqqqqssqsqqssssssqsqsssqqqssqqssssqsssqsqssqqsqsqsqqqqsqqsqsssqsqsssssqsqqqssqqsssssssssqsqssqqqssssqqqqsqqssqssssqqqqqsssqqsssqqqqqsqsssqsqqqqqqsssqssqsqqqqssqsssssqsssqqssqqqsqqqqsqqqqqsqsqssqsqsqqqqqssqqsqqqsqqssqqqqsqsssssqsqqssqsqqqqsqssqqqsqsqsqsqssqssqsssqqsqqqqqsqqqqqsssqssqqqsqssqqqqqssqsqqsqqqsqsqsqqssqsqssssqsssqqqsqsssqsqqqsqsssqqsqqqqsqqqssqsssssqssqssqqqqqqqsqqqsqsqsqqqqsqsqqsqqqssqsssssqsssqsqqqqqqsqsqsqqssqqsqqqssqsqsssqssqqqssssqssqsssqsqsqqssssqqqqqqsssqqqqsqsqqssqsqssqssssqqsqqsqssqqqsqqqssqqqqqssqsqsqssqsssssssqqqsqsssqqqssssqqssqssqsqsqqsqqsqsssqsqssssqsssqqssqssqsqqsqsqqsqqsqqssqqqsqqqsssqssssssqqsqqqsqssssqqqqsqqsqqqqsqqqsqqqsqqqqsqssqqssqsqqqssqsqqsqsqsssqqsqsssssqsqqsqqsqssqsqssqssqsssqqsqsqqqsqqssqqssqqqssqsqqsssqqsqqsqqqsqqqsqqsqsqqqqssssssqqqqssqssqsssqsssqsssqsqqqssqqqqsssqssqqsqssqsqsqsqqqsssqsssssqqsqqsqqqssqqsqqsssssqsqqsqsssqqqsqqqsqsqssqqqqqsqqsqqqsqsssqsssssqsqqqqsqssqqsqqqssqsqqqqssqsqsqsqsqssssqqssssqssqsssqssqssqqsqqqssqqsqsqqssqqssssssqsqssqqqqssqqsqssqssssqqsssqsqsssqqqqqssqqsqsqqsqqqssqqsssqqqqsqsqssqsqqqqqsqsqssqsssqsssqsqssqqqqsssqsqqqqsqssqqssssssqqqsqqqsqsqsqsqsqssqqsqqqqqsssqsqsqqqssqsqsqqqsssqsqssqqssssqqsqqssqqsqsqssqqssssqsqssqqqqqsqsqqsssqqqssqsqqssssssqqqqsqqqqqqsqqssqsqsqqqssssssqqsqqsqssssssqqqssssssqssqsssqsqsqqsqqsqsssqqqqsssqqsqsssssqqsssqsssssqsqssqsqssqssqssqqqsqqqsqssqssssqssqsssqqqsqqqsqssqssqqqqsssqqsssqsqsssqqqqssqqqqsqssssqqqsqsqqssqqssqsssqsqsqssqqsssssqssqsqqqssqsqssssssqssqsqsqsqqssssqsqssssqsssssqssssssqsqqsqsssqsqsssqqqsqsssqsssqqqssqqssqssqsqqsssssqsssqqsqsqsqsqsqqssqqsqqqsssqsqqqsqqsssqsssqsssqsqsssqqssssqsqsqqsqqsqssqssqqqsqqqsqqqssqsqqsqsssqssqqssqssqssssssssqqqssqqqqsqqssqssssqqsqqqqssqssssqqqqqqqqqqsssqsqssqssqqsssqqssqsqsqsqsqqqsqsssqsssqsqqqqqqsqqssqqqsqssqssqqsssqsqqsqsqsssssqqqqsqsqqqqqssqqsssssqsqqqqsqsqqqsqssqqqsqsqqssssqqqsqqsqsqqqqqqsqqqsssssqsssqqssqqqsssqssqssssqqqsssqqssqqqqqqqqqqsqqsqqsqssssssssqssssqsqsqssqqsqssqsssssqsqssqqqqqqsqqsqqqqsqssqsqqsqqsssqqqqqsssqqqqsssqsqssqqqqsqsqqqsqqsqsqqsqqsqqqsssqsssqqqqssqsssssqqssqqqsqqqqqsqqqssssqqsssqsqqssqqqqqqqqqqsqsssqqsssqssqsqqqqsssqsqqssqsqsssssssqqssqqsqssssssssqqsqssqqqssqssqsqqssssqsqssssqssqqsqsqqsqsssqqqsssqssqsqsqqqqsqsqsssqqqssqsqqqqssqqsqqssqsssssqsssqqqqqqsqssqqsqsqqqssqqsssssqssssqsssqssssqqqssqssqsqqqssqqsqqqqssqqssqsqssqqqsqsssqqqqsqqqsqqqssqsqqsssqqqsqssssqqsssqssqqssssssqqsssqssqqqqsqqqqqqssqsqsqqsqqqsssssqssssqsqqsqqqsssssqqsqqqqqssqqsqqqssqqqsqqsqsqqssqssqqqsssqqsqqssqqsqsssqssqqqssssqssqsssqsqqqqqqsqsssqssssqssqsqqssqqsqqssqqqssqqqsqqsssqssqsqssqqqssqqsqssqqqsssssqsssqsqqqqsssqsqqsqqsqqsqsqssqssqsqqssssssqqqqqqssqsqqqqqqssqsqqsqqssqsqqssqqqssqqsssssqsssssqqsqqqsqqsqsqqqsssqqqqqsssqqqssssqqsqsqqqqqqsssqqsqqsssqqsssqqssssssssqqssqsqqsqssqqqqsqqqsqsqssqssqsqsssqqqssqsqsqqsqqsqqssqsqsssqsqsqsqsssqsssqqssqsqqssqqqqqqsqsqssqqqsqssqssqssqsqqqsqqssqsqqqsssqssqqsqqqqqqqqsqqssqqsqssqqqsqsqsqsssqsqqqqqqsqsssqsssqssqsssqssqqqqsqssssqsssqssqqsqsqqsssqsqqqssqsqqqssqqqsqsqsssqsqqqssqqqsqsssqqqsqssqqsssqsssssqsssqsssqssssqsqqqqqqqsqqsqssqqqsqsqsqqqqqsssssssqqqqqqqqssqsqssqsqqqqqqssssssqqsqqqsqqqsqsqsqsqsssssqqsssqsqqsqqqqsssqqqssqssqssqsssqssqqqssssssqqssssqqqqqqssqqsqssqqqsqqsssqsqsqqqsqssqqqqqsqqqqqqsqsqqqssqqsqqsqqqsqsssqqsqsqsqqsqqssqqsqqqqqssqqqssssqqssqssqssssqqqqqqssqqssssqsqqqsqqsqsssssqsqqssqqsqqssqqqsqqqqqqssqqqqsqqqssssqqqqqqqqqqqsqsqqsqsssqqqsqsssqsqqqsqssssqqssqqsqqqssqsssssssqssqsssssqqqqsssqssqqssqssqqsqqsssqsqqqsssqsqssssqsssqqqqqqqsqssqqqqssssqqqqsqqssssqsqssssssssqqsqsqqqsqqsqsssqssssssqssqssqqssssqqssqqqsqqsssqqsqqqqqssqqqsqqsssssqqsssqsssqqsqsssqqsqqsqsqsssssssqsqqqqsqsqqsssssqssssqqssqssqsqsssqsqsqsssqqqsqsqqqqqqqqqqqssqsqsqsqsqsqqqssqsqqqqsssssssssqqsssqsssqsqqqqsqsqqsssssssqssqsssqqssssqsqsqqsqsqqqqqsqsqssqqsqqsssssqqqqqqqsssqqssqssssssqqqqqsssqsqqqsqqsqsssssqqsqqssssqsqqqsssssssssqqqsqsqqsqqsqqsqqsqqsqqssssqsqqsqqqqsqqqqsqsqsqqqsqqssqsqssqqqsqqsssqsqssqsqqqsqssqsssqssqsqqssqsqqqqssqsqqqqqqsqqsqsqqsqqsssqsqqqsqqssqqssqssqsqqqqsqqssqssqqqsssqqsqssssqqqssqqqqsqqsssssqqssqqssqqsssqqqqssssqsqssssqqssssssqsqqqqqsqssssqqssqssqsssqsqqqqqsqqsssqsqsqsqqqqqqsqqssqqsssqsqssqsssqqssssqqsqqqqssssqsqqqssqsssssqqsqqqsqssqqqqqsqqqsssqqqqssqqsqqqqssssqqssqqssssqsqqssqqqqqsssqqqqsssssssqssqsqqqsqssssqsqssqsqssqsqsqsqssqqqqssqqsqqssssqsqsssssqqqsqssssssqssqqqssqqqssqqqsqsqsqqqsqqqsqqqqqsqsssqqqsqqqssqsqsqsssqqqqsqqqsqqsqqqsssssqssqssssqqqssqqssqqqsqqqsqqqsqqsqsqqsqsqssqqqqsqqsqqqqqqqsqqqqqqqsqqqqqssqsssqssqsqqsqssqqqsqsqqqqqqqsqqsqsqsqqqqqsssqssqqqsqssqsqqqqqqsqqqqssqsssqqqqqsqsssssssqsqssqssqqsqssqqsssssqssqsqqqqqsqqqsssssqqssssssqqqqsqqssqqqsqsqqsqsqqsssssqsqsssssqssssqssqqqqssqqssssssqsqsqsqqqqqqqqssssqqqqsqsssqqssqqsqsssqsssqssssqqqqsqqqsqssqsqsqqqqsqsqqqqqqqqqqssqqsqqssssqqssqsqqqsssssqsqqqqqssqsqqqqsssssqqsqqssqssqqqqsqsqqqqqqsqqqqsqqssqssssqsssqqqssqqsqqqssqqsqssqqqsssqssqqqqssqqsqqsssqsqqqqsssqqqsqsqqqssqqqssqqssqqqsqsqqssqsqqqsqsqsqssssqsqqqssssqsssqsqqqqqqssssqsssqqssqsqqssqqsssqqqssqqqsssssqqqqsqssqqqqqsqqqsqsssqssqqqsssssqqqssqssqsqqsqqssssqqsqsqqsssqqqqssqqqqqqqqsssqqsqqqqqsqqsqsqqqsqsqqqqqqqsqqsqqsssqqqqqqqsqsqsqqqsqsqqssqqqqsqsqssssqqsqqssssqqqqssqsqsqssssqsssqsqqqqssqqqsqqqqqqsqqqssqqssqqssqqqssqsqsqqqqsqqqssssqqqssqsqqqqsqssssqssssqsqqqssqqsqsqqqsqssqsqsqqsqsqssssssqsqsqqqsqqqqsqsssqqsqqqssqsssqsqsqsqssssssqqqsqsqssssqqqsssqqqqqssqsqsqsssqqsqqsqqqqsssqsqsqqsqqsqqqqsssqqqqqsqqsssqssqqqqsqsqsssqsssssssqsssqsssqqssqqqqsssqqqqsqqssssqsqqqqsqssqqqsssqssqssqqqsqqqssqsqssssqssqsqqssssqsqqsssqsqssqsqsqsssqsqqqqqssqsqqqqqsqqqssssqssqqqqqqsqqssqqsqqssqqqqsssqqsqqqsqqsqqsssqqqqsqqqqqsqsssqsqssqqqssqsqqssqsqsqqqssqssqssqqqsqqqqqqqqqssssqssqqsqsqsqsqsssqsqqssssqqqsssqqsqsssqqqqqqqqqsqqsqqssqsqsqqqqqssssssssssqqssqssqqsqsqsqqqssssqqqsqqqsqsssqqssqssqqqqsqqqqssssqssqqssqqqssqssqssqqqssqqqqsssqqqssqsqsqqsqsssssqqsssqqqqsqsqqqqqqssqsqqsqqqqqsqsqqssssqqsqqqsqqqssqqqsssssqqsssssssqqssqsssssssqssqssqsssqssssqqsqssqqqsqssqssssqqqsqssqssqsqsssssssqsqqqsqqsqqsqqqsqssqssqqqqssqsqqqsqsssssqssqqqqqssssssssqqqqqqssqqqqqsqsqssssqsqqqssqqssqqsqqqqssqqqsqsqsqqssssssqsssssqssqqqqsqqqsqqsqsqqqqqqsqqssqqsqqqsssqssqssqqssssqqqssqqqssqsssqqqqqsssssqssqqqqssssqsqqsqsqqssssqqsqqqqqqqqqsqqsqsssqssssqssssqssqqsqssqqqqqsssssqqqqssssqqsqqqsqsqqssssqqsqqqqqqsssqssqqsqqsssssssqsqsqqsqqsqsqqssqqqqqsqsssqssqsqqqqsqsqqsssqqqqqqsqssqqqqsssqqqqssqqqqssqqqqssqqsqsqqssssssqssqsqssqssqssqsqsqqqsqqsqqqqqqsqqqssqqssqqqsssqsqqsssqsssssqsqsssqsqqssqsqsqqqsssqssqsqqsqqqqssqqsssqqsqsqqqqqqqqqqqqqsssqssqqqsssqsqsssqqqsqqsqssssqsqsqsqssqqsqsqqsqqssqsssqsqqsssqqsqqqsqqsqsqsqsqsssqssssqqssqqqqqsqsssqqssssssssqqqsqsqqsssqsqqqqqsqqqqsssssssqqqsqqsqsssqsqsqqqqsqssqssqqqssqqqssqsqqqsssqsqssqqsqsqqsqqssqsqssssqqqssqssqqsssssqqsssqssssqqqqqssqqqqsqqssqqqsssqqsssssqqssssqqqsssqssqsqsssssqsqqsqqsqqqqqqsssqsqqqqsssqssssssqqsqssqssqsqssqsqsssssssssqssqqsqqssqsssssqssqqsqsqqqqqqqsqssqsqsqsqsqqqsssqqqsqqqssssqsqsqqsqqsqqqsqssqqqsssssqqqqqqsqsqqqssssqqqqssqqqqssqssssqsssqssqsqqsssssssssqssqqssqqssqqqssqssqsqqssqsqsssqqqqqqqsqqqsssqqqqsqqqqqqqsssssssssqqqqqqqqssssqsqqsssqqsqssqqqqsqqsqsqsqqqssssqqsqssqqsqsqqqqqsssqsqqqqqqssqssssqqqqsqssqqssssqsqssssssqqsqssqssssqsqqssqqqsqqssssqsqqsqqqqsqqqsqssssssqsssssssqqsqsqqssqqqssssqqqqqqssssssqsqqssqqsqqsssqqssqsqqsqsqqqssqsqsssqsqqsqssqssqsqqqsqqqqsssqqssqsqssqqqsqqqsssqqqsqsqqqsqssqqssqssqssqqsqsqsqsqssqqssqqsqqqsqqqqssqsqqqsqqqqqqqqqssqqsssssqqqqsqsqqsssqqqqsqsqssqqsqsqqssssqqqqqssqsqqsqqqsqqssssqsqqqssqqqqqssqssqqsqsqsqqsqssqqqssqqqqsqqqqsssqqqsqqqsqqsssssssqssqqqssssqqqsssqqqqssssssssqssqqqqqqsqqqqssssqqsqssqsqsqqssqsqqssqqsqssqqssssssqssqsqqqsqssqsqqqsqssqsssqsqqqssqsssssqqqqqsssqsqssqsssqqsqsqsqsqssqqqsqqssssqssqqssqssqsqqsqsssqqssqsqsssqsqqsqsssqqssqqssqssqsqqqqqsssqqsssqqqqqqqsqsqssqqsqsqssssssqqqsqqqssqsqqqqqsqqqsqqsqqsqqssqqssssqssqssssqqssqssqssqsqsssqsqsssqqqqqqsqssqsssqsqssssqsqqsqssqqsqqssqqsqsssssqqqsqsqsqsqssqsssqqqssqqssqqqqqqssqqssqssqsqssqsqqqssqqsqssqqsssqsqsssqssssssssqssssssssqsssqqsqqssqqqsqssssqssqqsqqqsqsqsqqqqsssqsqsssqqqqqsqqssqqsqqsqqssqqqsssqssssqsqqqsqqqqsssssqqqqqssqqssssqsqqsqqqqssssqqssqqssssqqqqqqsqsqsqqsqqssqssqssqsqqqqsqsqsqsqsqssqqsqsqssqqsqqssqqsqsssqqqsqqqsqsqsqqsqqqqsqssqqqsqqsqqqsqsssqqssqsqqsqssqsqsqqssssqqsqssqsqsqqqqsqssqqqqqqqssssqqqqsqsqsqsqqsssqsqssqsssqqsqqqsqsqsqsqssqsqssssqqqsqssqqqqsqsqssqqsssqqsssqsqsqqqsqsqqssqsqqssssqssqqssqqsqqsqsqqqqsqsqqssqqqqqsqqqsssqsqssqsqqqssqqssqqsqqqqqssqqqqqssqqqqqqssqsqqqsqqssssqqsqsqqsqsqsssqsqqqqqsqqqssqqqssqssssqqqsqqqsqqqqsqssssssqqqqqqsqssqsqsqqsssssqqqqsqssqqsqssssqqsssssqsssqqqqsqqqqsqqsqqqsqqsqqqsssqqqqsqqsssqqqqqsssssqsqssssssqssssssqsssssqqqsqqqsssssqqqsqssssssqqssqqsssqqsqqqqqqsqqsqqssqsssssssqsssqqsssqsssssqssqssssqsqqsqssqqssqsqqsssqqqssqssqssqsssqsqqqsqqsqsssqqqqqsqsqqsqsqsqssqqqqqqsqsssqsssssqsqssqqsqsqqsqqqsssqssqsqqsssqsssqqqssqsqssqsqsqssqqqqqsqsssqqqqqqsssqqqssqqsqssqsqqqsssqqqqqsssqsqqsqqqssqqqsqsqqsqsqqsssssqsqsssqqsssqsqsqqsqqqsqqsssqsqsqqssqsssqqqsssssqsqqsssssssqsqqqsqqsqsssqqsqssqsqqsqsssqsqqqsssqssqssqqsqqqsqqsqqqqqqssqsqsqsqqsqqssqqsqsssssssqsssqqqqqqssqqqsqsqqsqssqqsqqqsssssqqqqqsqqqqsqqqssqssqsssqssqssqqssqsssssqqsqsssqsssqqqsqqssqqsqssqsssqqssqsqqqqqqqsqsssqqqqssqssqqsqsqqsssssqsqqssqssqqqsqqqqssqssssqsqqssqsqssssqqssssqsqsqqqsssqqsqqsqqqqsqqssqqsqqsqqssqqssqqsqqqqssqqssqqsqqsqqsqqssqsqqssqsqssqsqssqsqqsqssqqqssssqqssqssqqssqqsqssqqqqsssqsqsqqssqsqqsqsqsqqssqqsqqqsqsqqqqsssqqsqqqssqsqqssqsqsqssqsqqssqsqsqsqssssqsqqsqsssqqssqqsssqqssqqqssqqqqssqqsqsssqssqssssqqsqqqqqqqssqsssqqqqsssssssqsqqqqsqsqqssssqsqsqqssssqssssqsqqsqssqsqqqsqqqqqsqsqssqsqqqqqqqssqqqqqqqqqssqqsqsqsqqsssqqqqsqqsqqqqqqssqqqsssqqqqqqsqqsqqqqsqsqqsqqssqsqsqqqqqssssqqsssqqssqssssqqssssqqqqqsssqsssqsqqqsqssqqsssqqqsqssqsqqqqssqqqqqsssqqqqqsqqssqqqqsssqqsqssqqsqqsssqsqsqqqqsqsqqqqsqsqqsqqqqssssqqqsqqsqsqqqqqsqssssssqqqsqsqqqsqsqsqsqsqqssqsqqqsqssqqsqssqqqqqssqsqsqqqqsqqsssqqqqsqssqqqqqqqssqssqqqsqqqsqqsqssqqsssqqsqsqsqssqssqssqssqqqsqssssssssqqqssqsqqqqqqsssqsqqqqsqqsqsqsssqsssssqssqqssqqqsssssqqqqssqqqqsssqsqqssqqqsqsssqqqsssqsqqqssqqqsqsqqsssssqqsqqqsqssssqsqssqqqssssqqsqqsqsqssqsqssqqqqqqqqssqqqsssqsqqqssqqqsqqqsqsqqsqssssqsssqsqsqssqsqqsssqssqsqsqsqssssssqsqqqsqqqssqqsqsqqqssqsqqqqsssqqqsssqsssqssssssqqqqssqsqsqqqqsqsqqqqsqsqsqqqsqqsqsqqqqqsqsqqssssssqssqssssqssqqqqsqssqqqssssssqqsssssqqsssqqssssqsqsssqssssqsqqsssqsssqsqqsqsqsssqsqsqsqsssqsqssqssqssssqssqsqssqqqqssssqssssssqqsqsqqqssqqsssqssqsqsqqqqsssqqsqsqqssqqqqsqsssqsqqqqqqqsssqssqqsssqsqqsqssqqqqsqqqqqqqqssssqqsqqsqsssssqqssqqsqsqqsqqqsqsqqqsssqqssqssssssqqqsqqqqqqsqsqqqssssqsqsqqssqsqsssqssssqqqsssqqqsqsqsqqqqsqqqqsqqsqsqsssssqqssqssqsqqqssqqsqssssqsqsssqsssqsssqssssqsssssqssqqsqssqqqssqssqqssqqssqqqsqqssssqqssqsqqqsssqqsqsssqqssqsqqqsssssqsssssqqqqsqqqqssqqsqqsssqqssqqssqsssssssqqsssqqqqssqsqqssssqqqsqqsssqssqqsqqqqqsqssssssqqssqsqqqqsqqsqqssqqsqsqsssqqqqsssqssqsqqsqsqssqssssqsqqsqqssssqsqssqqqsqsssqqqqsqqssqsqqsqqqsqqqqqqqsqqqqsqqsssssssqqqqsssqsqsqqsqqssqqssssqsqsssqqssqqqqqsqqsssqqsqsqsssqssqsqqqqqssqqqqsssqqsqssqsqsssqsqqqqssqssqqqssqqsssqqqqqqqqssqqqqqsqsqqsqssqssssqssqqqsqsqqsqqqsqsqsqssssssssssqqsqsqqqqqqqsqsqsqsqqsssqqqsqsqsssssssqsqsqqssqqsqqsqqsqqsqsssqssqqsqqssqqqssqqqsqsqssssqqssqsqsqqsqsssqsssqsqsqqqssssssqsqqqsqsssqqsqssqqqssssqqqqqsssqqsqqssqssssqqqsqssqqqsqssssssqsqqsqqqqssqsssssssqsqsqssqqsqqqssqqsqsqqqqqqssqqsqqqsqqqssqsssssssqsqssqqqsqsqsqsssqqsqqsqsqqsssqssqsqsqssqssssssqqqssqssqsqsqsssqsssqsqsqqqqsssqqqssqqqssssqsqqqsqqsqqqqqsqqqssqsssqqqqqqqsqqsqssssqsqqssqsqqssqqssqqqsqqqsssqssqssqqsqsqqqsqsqqqsqqsssqssqqqsqsqqqssqsqsssssssqsqqssssssqqsssqsqsssqqsqqsqqsssqsqssqsqssqqqqqsssqssqssqqqqsqqsqqssqssqqqssqqsqqssqqssssqsqssqqqsqssssssqssqssssqqqsqsssssqqssssssqsqqqsssqssqqqssqqqqssssqqqqqsqsqqqsqqqqsssqqssqsssqssqssqqqssssqqqssqsqqqqqqsqqssssssqsqsqssssqqqsqsqqssqqqssssqqqqqsqqssqsqsqsqssqsqsqqqqqqsqssssqqssqqqssssqsssssqqqqsssqqssssqssqssqqsqqssssqssqqqssqssqqqsqqqssqqsqqssqqsqsqssqsqsqqsqqqssqqqssqqsqsqqqqqqsssqsqqssssqssqsqqssqqssqqqsqqqsqsqsqqssqqsqssssqqqqqqqqqqqqqqqqsqsqqsqsqqsssqsqqsqqsqqsqqqssqqqqsqssssqqsssqsssqqsqqssssqsqqqqssssqssqqqsssqssqqqqsqsqsssqqqqqssqssqqqqqqqssqqsqqqssssqssqqqqqsqssqsqssssqsqsqssssqssqsqqqqssqssqqqssqsqssssqsssqssssqqqssqqqssssssqqqqssqsqsqsqssqqsqqssqsssssqqsssqssqsqsssqssqssqssssqsqsqssqsssssssqssqqssqsqsqssqssqqsqqssqqsqqssqqqqqssssqqssqqqsqqqqqssqsqqqqssqqqqqsssqsqsqqqqqqsqqqqsqssqssqqqqqsqssqsqqsqsqqqqsqqsqsqqssqqqsqsqsqssqsssqssqsqsqqqsssqssqqqssqqqqsssssqsqqsqsqsssqqsqqqqqssqsqqqsqqqqsssqqqqqqqsqsssqqsqsqqqqqqqsqqqqsqqssqqsqsqsqssqqqqsssssqsqqsqssqqqsssqsqqqqsqsqqsqsqqsqsqssssqssssqsqsqqsqqqssqsqqqqsssqssqqsqsqsqssqsssqssqqsqsqqqqqqssqsssqsqssqqsssqsssqsssqsqqsqsqqqqqqsqqqsqssssssqqsqqsqqqqqqqsssqqqsqqsssqsqsssssqssqsqsqqsqsqqssqsqssqqsqsssssssssssqqsssssqsqqqsqqsqqqsqqqqqsqqqqsssssssqqqqsqqsssqsqssqqqqssqsqsqsssqssssqssqsqqsqqqssqssqqqsqsqqqsqqqqsqsqsssssssqqssqqqssqsssssqsssqqqqqsqsssqqqsqqsqsqssqssqsqsqssqssqsqqqqqsqqqqqqsssqsqqsssqqqqssqsqsqsqqqsqsqqsssssssqqqsssqsqqsqqqqsqqsqqsqssqqqqsqsqsqqsssqqqqsqsqqqsqssssssqssssssqqssqssqqqqssqqssqsssqqsqsssssqsqqsssqssqsqsqqsqssqqqqsssssqsssssssqsqqqqssqqqsqsqssqqqsssssssqssqqqssqsqqsqssqqqqqsssssqqqqssqqssqsqqsqqqssqqssqssqqsssqqqsqqsssqqqssqqsqqqsssssqsqqsqsqssqsqqqssqqqsqqssqsqsqqqqsqsssqsqqsqqqssqqqqssqsssqqqsqqsssqsqqsqqqsssssssqsssqqsssqqqqssssqssqsssqssssssqqssssqqsqsqssssqqssssssssqqssqqqsssqqsqqssssssqqssssssssssqssqqqsqsqqqsssqsssqqqssqqqqqqssqsqsqssqsssqsqsqqsqqssqsqqssqqqqsssqsqsssqsssssqssqsqsssssssssqqqsqqsssqqsqsqssssssqsqqsqsqqqqqqsssssssqsssqqqqsqssqqsssqsqqqqqsqqsqsqssqsssqsqsqssssssssqssssqsqqsqsqssssqssqqsqqqsqqsqqqqqssqqsqssqqqsssqssssssqqssqsqqqqqssqsqsssssqqsqqsqqssssqqsqsqssqsqqqsqsqqqsqqssssqsqssqsqsqqsssqsqqsqsqsssssssssqqqsssqsssqssqqqssssqssqsqssqqssqsqsqssqqsqqqsqsqqqqqqqsqssqqsqsqssqqqsqqqqsqsqsqqqssssssqsqsqssssqqsssqsqqsqqssqsssssqssqsqqsqqsqsqqqqssqsssssqqssqqqssqsssssssqqqsqsqsssqsqqsqqsssssqsqsqsqqsqsssssqssqssssssssqqqqsqqssqsqsssssqqqsqsqqqqqqsqqqqssqssqqsqqssqqssssqqsssqsqsssqssqqqqqqqqqqqssqqsqqsssqqsqsqsqsqqssqqssqqsqqqqsqqsssqsqqqsqqsssqqqqqssqqsqsqsqqqsqqssssqqqssqqqssqqqssqqqsqsqsqsssssqqssssqsqsssssqqsssssqssssqsqqsqqqsqsqssssssssqqsssqqsqqssqqqqqqqqqqssqqqqqqqsqqsqqqqqsssqqqsqqsqqqqqssqqsqqqqsssqsqqsqssqsqqqqqqqsqqssqssqssqqssqsssssqssssqqsqqqqqssqsqqsqqqssssqqsqqqqqssssssqqqsqqsqqqsqqqqqqsssqsqqqqqsqsssqqsssqsqsqsssqqqqqssqqqsqsqqqsqsssssqsqqsqssqqssqsqqqqqssqsqsqqqsssqsqqqqssssqqqssqqsqsqssqssqsqqssqqqsssqqqqqqssqsqssssqqsqqssqssqsssqssqsqqssqqqqssqqqsqsssqsqsssqssqsqqssqssssqqssqsqsqsqsqqqqsqqssqssssqqqsqqssssssqqqqsqsqsqssssqqssqqqqsqsqsqsqqqsqqsqssqqqssssqqsssssssqsqqqssqqqqqssssqssqsqqsssqqqsqqsqsssqssqqsqssqqqqsqssqqsssqqsssqsqssssssqsqsqqqsqssssqqsqqssqqqqsqqqsqqsqqsssqsqqsqqsssqqqqsqqssqsqsqssqqssqqqqqqsqssssqssqssqqsqqqsqqssssqqsqssqqsqsqssqqsqqqssqqsqsqssqqsqqqqsqsqsqsqsqssqqqqsqsssqssqsqsssqsqqqqsqsqssqqqssqqqsqsqssqqqqsqqqsqsssqqsqqssqsqssqssqssqqqsqqqssssssssqqqsqsqssssqssqsqqsqsqssssqssqssqqqqsssqqssqqqssqqsqqsqqsssqqsqqqsssssqqqqqssqqqqqsqssssssqsssssqssqqsssqqsssqqqqqssssqqsssssqqsqsqsqqqqqqqssssqqqssqssssqqqsssqqqssqqsqqqsqqsqqqqqsqsqqsqsqsssqqqqqsqqssqsqsqqqqqsqqqqssqqqqqsqsqssssssqqssqssqqsqqssqsqsqsqqsqqqqqsssssqsssssqsssssqqqqssssssqsqssqqqqqqsssqqqsssqqsqsqqsqqqqqqsqsqsqqqsqqqqssqqsqsqsqssssqqsqqqqssqqsqsqssqsssqssqsssssqsssqqsssqsssqsqqqssqqssssqqsqqqqqsqssqqqqsqsqqsssqsssqsssqqqsqqqssssqqqqsqsssqsssqqsssssqqsqqqqqqqqsssqssqqsqqqqqssqqqqsqqssqssqsqssqsqssqqssqsssqsqssqssqsqsssqsqqsqsqqqqsqqqqssqqsqsqqqqqsqsqqsqsqsqssqqqsqssqqqqqssssqqqqsqsqsqssqqqsqqqqqqqqqqqqsqsqsqssqqqsssqqqssqqqssqssqsqsssqqqssqqssssqqsssqqsqqsqqqqsqssqqssssqqsqsqqssqsssssqssssqqsqsqqssqsssssssssqqsssqqqqsqqqqsqqsssssssqqqqsqqssqqqsssqqsqqsqssqqqssqqqsqssqqqqqqssqqqqssssqssqqqqqsqsqqqqssqqsssqsssqqssssqsqqssqsqqqssqqqqsqsqsqsssqqssssqqqqssqsqqqqqqqqssqqqqssssqqssqqqsqsssqqsqsqsssqqqsqsqqsqssqsssqqsqqsqssqsqsqqqssssssqsqsssqqqqssqqqqsqsqqssssqsqqsqssqsqqqssqsqqqqqsqsqsqqssqqqqsqqqssqsqsssssqsqqqssqqqqsqsqqssqqsqqqssqssqqqsqsqqssqsssqqsqsqqssqssssqsqqqqsqqsssqqqqqqsssqssqqqsqsssssqqssssqqsqqssqqssqqqqqsqqqqqqssqqsqqqqqsqsqsqsqsqqsssssssqsqssqsssqqqqqssqsqqqsqssqssqqqsqsqqqqsssssqqsqsqsqqssqsqssqqssssssssqqqqqsqsqqqsqsqqqqqssqqssqqsqssqsqsssqqssqsqsqqsqsqqsqqqqsqqqssssqsqqsqqqsqqqqsqqssqsssqsqsqqsqsqqqsssqqqssssqqsssqqsqssssqqqsqsqqqsqqqqqqqsqqssssqqqqssqsssqqssqqqqssssqssssqqqqsqqqsssqqqssssssqsssqssqsqqqsqsssqsqssqssssqqsqqqsqqssqsqqqqsqqssqqssqqqqqsssqsssqqsqqsqqssssqsqssssqssqsssqqqqqqsqqsqssqsqqqqqsqsqqqsssqssqsqsqssssqsqqssqqqssqqssssssqsssqqsssqqqsqqsqsqsssqqsssqsqqqqqssqqssqqqqsssqqqqssssqqqssqqsssqsqqsqsqsqsqqssqsqsssqssqssqsqqssqqqsqssqsqqsssqsqqsqqqqssqqsqsqqqsqsqqsqsqsqqssqqqssqsqqsqsssssqqqqqsssssssssqqqqssqqqssqqsqsqsssqsqsqqssssqsqsqqqssqssqqsqqssqsssssssqsssqsssqsqssssqsqqsssqssqqqqqqssqqsqsssqssqqqqsqqsqsqqqsssssqqsqqssqqssqqssqsssqsssqqqqqssqssssssqsqqqqqsqqqsqqqsqsqsqqqqqsqsssqqssqqqqqssssqqsqqqqqsqqssqqqssqssssqsqssqsssqqqqqqqqsssqsqsqqqsqqsqqssqqsqsqqqssqsqssqqqqsssqqqsssqqssqsqssqqqqqsssqqsqsqsqsqqssqsqsqqsqsqsqqssssssqsqqqsqqqqqsssqssqsqqssqsqqqqsqqqqssqqsqsqqsssssqsqsqsqsqqsqssqsssqqsqqsssqsssqqsssqqssqsqqsqsssqssssqssqqqsqssqssqqqsqsqsqqsqqqsssqqqqssqqqqssqqqsqsqqsqsssssssqqqqsqsqqqssqqsssqqsqssqssqqqsqqqsqsssqqsssqsqqssqqqsqssqqqsqqssqsqqqsqssqsssqssqqsqqsssqqsqqqqsqssqssqsssssqssqqqqqqsqqssssssssqsssssqssssssssqsqqqqsqqsqsssqssssqsqsqqsqssqqssqqssqsqqqsqqsqqsqqssqssqqqssqsqqqqssqsqssqqssssqsssssssqsqsqqsqssssqsqqssssqssqsqqqqqssqqsqssqsqqsssqsqqsqqsqssqqsssqqqqssqqqqqssssssqqsssqqsqqsssqssqqsqqqsqqqqqssqqsqssssssqssqsssqqsqssqsqqssssssqssqqqsqqqqsqssqqqqqqsqsqqssqssqqssqqssqqqqqsssssqqsqqssqqsqssqsqsqqqsqssqsssqsqsqssssqssqqsssqsqssqsqqqqqqssssssqsqsqqqsqqsqqqssqsqsqssqqqsqqsssqsssssssssqqqssqsqqqqqqsqssqssqssqsqssqqqqqqssssqsqqqqssssqssssssqqqsqsqsqssqqsqsqqqqsqssqqqqqssssssssssqsqsqsssssssqssqqssqsqqsqqqqsssqqsqssssqsqqsqssqssqsssqqqssqqqsqssqqqqqsqsssqqqqsqqsqqqqsqqsssssqqqqqqqqsqqqsqsqqsssqqqqssssssqsqqqssssqsqqqssqqsssqqsqqsqqssqsssssssqqqssqssqsqqqsqssqqqsqqqqqssqssqqqqssqqqqqqsqqsssqqqssqsssssqsqsqsqssqsqssqqqqqqqqqqssqqqssqssqsqqsqqsqssqssqsssqsqsssqqqssqssqqqsqsqssqsqsqqqssqqsssqqsssssssqssqsqqsqsqsqqqqsqqssqqqssqsqqqsqqsqqqqqsqqqssqssqqqsqqqqsqqqsqsqssqqsqqssssssqssqsqsqqqsqssqqqqqqqqqsqsqqqqqsssssqssssqqqsqssqqqsqqqsqqssqsqqsqsssqsssqqsqssqqqsqsqqqqqsssqqqsqsqqqssqqqqssqssssqqqsqssqqsssqqqsssssqsqqqssssqsqssqqsssqssssqqqqsqsqqssqsqssssqsqqssqqsqsqqsqsqsqssqsqsqqssqsqsssssqqsqqqqsssssqqssqqqqqsqqqsqqqqqqqssqqqsqsqsqsqqsqsqsqqssqqqssqssqsqsqqqssqqsssqsqqsssqqqqqqqsqssqssqqqqqssqqssqsqssqsqssqqqsqsqqqqqsqqssssqqsqssqqqsqqqsqssqqssqsqsssqsqqqsqsssqqssssqqsqsqqsqsqqsqssqsqqssqqsqqssqqsqssqqssqqqssqsqsqssssqqsqsqsqsqqqqsssqqqqqssqqsqsqqqqssqqssssqsqqsqqsqqssqsqsqsqsssqqqqsqqssqsqqsqssqqsqsqsqsssssqqsqsqsqsqssqqsssqqqssssssqsssqqsqqsqqqsqssqqssqqsqqqqqqqssqsssqsqsssssqssssqqqssssqqssqqssqqqqsssqsqqsqsqsqqsssssqqqsqsqsqsqssqssqsqsqqsqqqqqsqqsqqqqsssqsqqqqssqqsssqsqsqssqqqsssqssssqqsqqssqqqssqqqqsqqqsqsqqqsqssqqssqsqssssqqssqsssqqsssqsssssqqqqqqqsqqqqssqsqqsqsqqsqsssqqsqsqqqqqqsqsssssqqssqqsqqsqqsqssqssqsqsssqqsssqsqqqssqqqqqsqssqssqqqsqqssqsqqqsqsssqsqqsqsqqssqssqqqsqqsqssqqsqqsqssqqssssqssqssssqqqqsqsqqqssssqqqsqsqssqssqsssqqsqsqsqsqssqqsssssqqqqqsssssqsqsqsqsssqqsssqqsssqsqsssqssssssqsqsqssssqqsqqqqsqqsqqsqssqqqsssqqsssssssqqsssqqsqsqqsqqsqsqqsqsqsssssqssssqqsqsqqqssssqqqsssssqssqqqqqssqsqsqsqsssqqqqqqssqqsqssssqqqqqsqqsqqsqqsssqsqqqsqqsqqsqsssqsqsqssqsqsqsqssssqsqqqsqqssqsqqssqsqssqqqqssqqqqqsqqsqqssssqqqssssqqqqsqsqssqqqqsqssssqqqsqssqqqqqqssqqsqsssssqsqqqqssssqqqsqssssqsssqssssqssssssqqqsqsssqssssqsqsqqqsqsqsqqsssssqsqsqqsqsqqsqsqssqsqsqqsqssqqsssqqsqqsssqqqsssqsqsqqqqqqqqqqqssssqqqsssqqsssqsqqsqqssqqsqsssssssqssqssqssssssssssqqssqqqssssqqsqssssssqqsssqqssqqsssqsqqssssqsssqsqsqsqssqqssqssssqsqqqqqqsqssqqqqqqqqssqqqqqqsqqqqsqsqqsssqqqqsqqqssqsqqqqsqqssssqqsqqqqsqqsqqsqssqsqqqqqqsssqqqsqssqssssssqsssqqsqsqsqqqqqqssqsqqsqqsqqsqssqsqsqqqqqssqsqsqqqsqssssqqssssqqqqsssssqqqssqqssssqqqsqsqsqqqsqssqssssqqqqsqsqqsssqssssqssqqqsqssqsqsqqsqqqsqsqsqssqqqqqqqssqssqsssqqsqsssqqqsqqqssssqqqssqqsssqqsqsqqqqsssqqssqqsqqqsssqqqqsqsqqsqqssqqsqsqssssqqsqqsssqsssqqqsqqsqqssqssssqsqqqssqsssqqqssqqqsqqqsqssssqqqqsssqqssqqqsqsssqsssqsqssqssssqqqssqqsssssqsqqqsssssqssssqqssqqqqsqsqssqqqqqsqqsqqssqssqssqqssqqsqqqssqqqsqqqsssssqqqqsqqssqqqqssqqsqqqqqsqqssqsqsqsssqsqsqsqqssqqssssqssqssqsqsqqqqsqqqsqssqqqqsqssqsqsssqssqsqsqssqssqqqqssqqssqqsqsssqssqqqsqqqsqssqssssqsqssqqssssqsqqqssqsqqsqssqqssqqqqssqqqsqqsqsqqssqqssssqqqssssqsqqsqqqqqqqqqssqqqqqsssqqqsqssssssqssqssqqsssssqsqqqsqqsssqssqsqsssqssssqssqsssqsqqqsssssssqqssssqsqqssqsssqsqqqqsqqsqsqssqsqqsqsqsssqsssqqsqqsqqsssqssqqqsqqssqqqqqqsssqsqsqqsqqqqssqsqqqqqqqsqqsqqssqqsqsssqsssssqqssssqqsqsqqqsssqqsssqqqqqsssssssqqssqsqsqsqssssssqsqqsqssqssqqssqqqsqsqqsqqsqssqqsqqsqsqqqqsqqqssqsqssssssqqqqsqsqqqqsqsqqqsqqssqssqqqsqssqssqqsssssqqqqsqsqssqsqsqqqqqqsssqsqsssqqsqssssqqssssqsqqssqsqsssssssssqqqqsssqqqqqqqqsqqssqsqqsqqqssqssssqssqsqsssssqqqsqqqqqsqsssqqqqsqsssqssqsqssqssssqsssqqssqqssqssqqssqsqsqsqqqssqqqsqsqsqqqsqqqsqsqsqsqsssqqqsqssssqqqqssqssssqsqsqqqqqqqsqqqsssqssqsqqssqqqqsqqsqsqqqssssssssssqqsqsqssssqsssqsqsssssqqsssssqqqsqqsqqqssssqqsqqqsqqssqsqssqqqqqqqqssqsqssssqssqsqsqqssqsqqssqqqqssssqsqqssqsqsssssssqqqsqqssqssssssqqqqqsqsqqqsssqssqqsqqsqqqsssqssqqqsqqqqsqssqqqsqqssqsqqqqqqqsqsqsqssssqqssqqqqsqqssssqqqqsqssqssssqsqqsssqqqsssqqsqqqsssqqqsqqsssssqssqqqssqqssqssqqsqsssqssqsqssqssqqssssqqqqsqqsqsqsqqsqqsqsqsqsqsssqssqqssssqsssqsqssqssssqssssqqqqsqqqsqqsqqqsssqssssqqqsqqssqqqqsqsqssssqqqqsqqsqqqsqqqqqqssqsqssssqqsqqqqsqqqsqsqqqqsqssssqqsssqsqqqqssqsqqqqqqsqqsqqssssqqsqsssqqssqqqsssqqsssqssqqssqssqqssqqsssqqqsssqqssssqqsssssqqsqssqssqqqqqsqssqsqqssqqqqqsqssqsqqssqssqsqqqqqqssssqssssssssqqqsqqqsqqqqqssqsqssqqqqsqssssqqssssqsqqqqqssqqqqqqqqqqqsssqqqqqsqqsqqqsqqssqqsssssqqsqssqssqqssqssqqssqssqqqsqsqsqqqsqqssqsqqsqsqqqqqqsqssqssqqqqssqsqsqqsqsssqsqqqqsssqqqqqqqqqsqsqqqqqqssssqsqsqqsqqsqsqsssqqssqqqqqqsssqssqsqqqqssqsssqqqsqsqqssqsqsqsqsssqsqqqqqsssqqqssqssqsqssqqqqsssssqqqsqqsqqqsqqqqsssqqsqqssssqqsqqqqqsqqsqssqqqqssssqsqqsqqqqqsqssssqsqsqqqqqqqssqqsssqqqsssqqsqqqqqqsqsssssqsqqqqqsssqsqqsqssqsssqqqsssqsqqqqsqsqssqsssssqsssssssssssqsssssqsssqqqssssqqsqsqqsssssssssssssqsqqssqqqsqqsqsqqsqqqssqsssqsssqsqqssqqsqqsqssssssqqqssssqqqsqqsssqsssqssqsqqssssqsssqqsqqqqsssssqsqqqqsqqssqsqqqssqqssqssqqqssqsqqqsqssqsqsqsqsqqsqqqqsqqsqqsqqqsqqsssqsssssqqsqssqsssqssssqsqsqqqssqssqqqqsssqqqsqqsssqqqqqqsqsqqsqsssssqqqssqqssqssssssssqqqqqsqssqssqsssssqqqqssqsssqqqqqsqsqsssqssqsqsssqssqqssqssqsssqqqsqssqssqssqsssqsssqsqsqqqqssqqqqsqsqsqsssqsqqqqqqqssqqsssssqsqsssssqqsqsqsssqqqsqsssqqqqqsssqqsqqsqsqssqqsqssqssqssqqsqsssssqsssqsqqqsssqsqsqssqqqqqqqqssqqqsqsqqssqqqqsqsqsqsqsqqqqqsqssqsqqssqqsqsqsqqqssssqssqqssqqsssqqsqqsqqsqssqqqqqsqqqsqqsssqssssqsqsqssqsssqqqsqqsssqqqqssqsqqqqqsqsqssqssqsssqqqqsqsqqssqqssssssqqsqqqqqsqqsqqssqsqsqsqsqqqssqsqsqsqqqsqqsqsqssssqqsssssqssqqssqsqssqqsqqqqqqqsqssqssqqqssssssqsqssqqsqqqsqqsqqssqqsqsqsssqsqsssqsssqsssqsqsqsqsqqqssqsqqssqssqqqssqqqsqqssqsssqqsqsssqssssqsssssqqqqsqqsssqqqsqqsqsqqqsqsqqsqsssqqqqssqqsssqssqqssqqsssssqssssqqsqqsqqsssqqssqqqqsqqqssqssssqsssssqssssqsqsqqqssqqqsqsssqqqsssqsssssqqsqssqqsqqqssqssqqqqqqssqsqqqssssqqsqqsssqqqsqqqqsqssqssssqssssqqqqqqqsqsqsqqqsqsqsqqsqsqsqqqqssqsqssssqqsssqqssqsqqsqqsqqqssqsqssqqsqssqqqsqqqsssqsqssqsqqsqssqssqssqsqqsssssqsqssqsqqsssqqsqqssqqsqqsqsqsqssqqsssqqqqqssqsqqqsqsssqqsssqqqqssqqsqsssssqsqsqsqsqqsssssqsqsqsssssssssqqsqqsqssqqqsqsqsqqqqqqssqqsssqqqsssqqqqsqqqssqqqssqqsqqsssssssssqsqqssqqqqqqssssqsssqssssqssssqsqsqqqqsqqqssqqsssqqssqqsqssqsqssqqsqqqssqqqqqssqssssqssqqqqsqsqsqsssqssqssqsqsqqqsqqqqsqqsqqqqssqqsqqqsqsqsqsqqqsqsqsqssssqqqsqsqsqqqqssssssssssssqssqsqssssqqqsqsqssssssqqqqsqsqssqsssqqsssqsssqssssssssssqsqqsqqsqqqssssqsqqsqssqqsssqsqsssqssqqqsqqsqsqsqqqsqssqsqsqqssqqqqssqsssqqsqqqsqqsqqqqssqsqsssqqqssqqqqsqqqsqqqsssqssssqssqqqqqsqsssqqssqsqsqsqqssqssqssqssqqqsssqqsqsqqqssqssqqsqsqqsqqqsssqqsqsssqqqssqqqssqqsqqssqsqssqqsqsssssqqsqqsqsqsqsqsqqqqqssssqssqssssqssssqssssqsqqsssqqssqssqqqqssqsqqqsssqsqsssqqqsqqqssqqqsqqqsssqqsqqqqsqqssqqqqsqsssqsqqsqsqsssssqsqsqqsqqqqsssqqsqsssssqsqsqsqqsssssssssqqqqqqsqsqsqssqsqqssqqsqssqsssqsqssqsqqssqssqssqqsssqqsssqqsqssqqqsqqssssqssqqsssssqsqsqsqssssssqqqqqssssqsssqsqqssqqqsqsqsqssqssssqssqsssqsqqqsqqqsqqsqqqsqqqqqqqssqqssssqsqqsqsqsqsqqssqsqsqssssqsqqqqqssqsqsqsssqqqsqqssqsqqqqqqsssqsqqqssssssqqssssqsqsqqsqsqsqqsqqsqqqssqsqqqqsqssqsssqqsssqqsqsqsqqsssqqsqqsssssqqsqsqsqqsssssqsqqqqsqqsqsssqqqssqssqqqsssqsqqqqqsqsssqsssssqqssqssqqsqsqsqqsqsssqqqqqqqqssqsqssqqqsqssqqsqsssqqqqqsqsqsssqqqqqsssssssqqqsqqqssqqssqqsssssssqqqssqqqssqqssssqsqqsqssqsqqqsqqsqqqsqsqqssqsssqqssqssqsqssssssssqsqqqsqssssqqqsssqqsqsqssqqssssqqsqqqqssssqqssqssssssssqqqsqqqssssssqssqssqqqsqqssqsqqsqsqsqqssssssqssqqqsqsqqssssssssqsqqsqqssqqsqqsqssqssssqqsqsqsssqssqqssqqssqqssqsqqsqssqsqqsqsqqqqssqssqssssqsqqqqqsssssqqqqqqsqqssqsqqsqqqsssqssqqqqsqssqsqqqqsqsssssqqsqqqqqssqqqqqsqsqssqqqsqqqsqssqqqsqqsqqqsqqqqsssssqsqssqqqqqqqsqsqssqsqsssqqqsqssqssqsssqqsqqqqqqqsqqqsssssqqqqqqssqqqqqssqqqqsqsssqsqsqsssqsqssqsqsqqqssssqqqqssqssqssqsqsqsssqqqqssqsqssssqsqssqsssqqqsqsqsqsssqqqqsssqssqsqssssssqsqsssssqqqqsqqqsssqqsssqsqqsssqsqsssqssqsqsssqqssqssqqqqqqqqqsqqqqqqssssqqqqsqqqqqsqsqqssssssqqsqqsqsssqsqqqqqqqqqqqssqsqssqsqqsqssssqsqqqsssqqqsqsssqqqsqssqsqqqsqqqqssssssqsqsqqqsqqqsqsqssqqsssqqsqssqqssqqqssqsqssssqssssqqsqsqssqssssqqqssqqqssqsqqqqqsqsqqsqsssqqssqqqqqqssqssqsqsqsssqqsqqssssqqqqssqqqssqsqssqqqqssqssssqqqqsqqsqqqsssqqssqssqsssqqsqqqqqssqqqssqsqsqqqqssssssqssqsqqqsqsqqqqssssssqsqsqqssqqqsssqsssqssqsqqqsqqsqsqqsqssssqqqqqqqqsqsqqqqqqssqssqsqqsqssqqqqsqqqqqsqqsqqsqsssqqqqqsqssqqsqsqsqssqsssqqsqsqqqsssqsqsqsssqsqsqsqsqqqssqssssssssssssqsqqsssqsqsqssqqqqqqqsssqqqssssqqqssqqqqssqqsqssqsssssqsqsssqsssqqqsqqqsqqssqqssqqssqssqqqqqqsqssssssqqqqsqqsqssqsqqqssssssqsqqqqsqqqsqqqqsqsqqqssssssqqqsqqsqqqssqsssqsssqsqqqqssssssqssqqssqqqqqqqqqsqsqssqsssssqqsqqsqqqsqsqssqqssssssqssqqqqqsqsqqssqqqqssssqqqsqssqssqqsqqsqqsqqqssqsqqqqqssqsqsqsssqqqsssqssqsqqqsqssqssqssqqsssqqsqqsqssssqqsqqsqqqssssssqqsssqsssssqsqsqssssqqsqssssqqsqqqqqsssssssqssssqsqqsqqqqsqssqqsqqqqsssqqsssqssssqqqqqqssqqqqqsqssqqqsqqqqssqqsqqsssqsqsqssqsqssssqsqsqqqqssqssssssssssqqqqsqsqsqsqsqsqsqsqqsqsssqqsssssqssssqsssssqsqssqssqssqqqqsqqqssqsqsqqqsssqsssssssqsqssqsqsqsqsqqssqqqssqssqqqqqqqsqssqqssqssssqsqqqssqsssqssssqqsqqsqsqqssqqsqqqssqqqssqsqqssqssqssqqsqqqsqssssssssssqssqqsqsssssqsqssqqsqsqqqsqsqsqqqqsqqqqsqsqsqsqssqqsqqsqsqqssqsqsqsqqqqssqsqsqsssqqqsssqsssqsqqqsssqssqqqqsssqsqqsqqqqssssqqqqsqsqsqqqssqqqsssqqqsqqqsqssqqsqssqqqqssqqssqsqqqsqqsqssqsqsqsqqsqsqssqqsqsqqsqqqsqsqssqsssqqsqssssqssqssqqqqqqssqqsqsqqssqsqsssqssqsssqssssqqqqsqsqssssqssssqsqqqqqqqssqqqsqsqqsqqssqssqqqsqqsssqqqqsqqqsqqsqqsqsqssqqqqqsqqsqqsssqsqsqsqsssqqqqssqqsqsssqsqqqssqqqqqsqqqssqsqssqsqsqqssqqqsqqqqqqsqsqqsssqsqsqqsqqqssqsqsqqsqsqssssssqqqqsssssqssssqssssqsssqqqqsqqssssqqsqqsqsqssssqssqqsqssqsqsssqqqqssqssqssqqqqqsqqsssqqqsssssqqqsssqqsqqssqsssssqsqsqqqqqqsqqqssqssqqqssqqsqqssqsssqqqsqqqqssqqqqsqsqqsqqqssqqqqqsqssqqssqsssqqqqsqsqsqsqsssqqsqqqssqsqqsssssqssqsssqqsssqsssssssssqqqssssqqqsqqqqqqqqqssqsqqqqsqqqsssssqssssqsqsqsqqssqqsqqqqqqsqqssqsqqqsqqsqsqqsssqssssssqqqsqsqqsqqqsqqsqqqssssqssssssqsqqqssssqqsqqssqsssqqqsqqsqqsqqssqqqqqsssqqssssqsqqqsqqssqsqssqsqssqqsqsqsqqsqsqsssqsqsssqqssqssqqsqqsqsqqssqsqqsqssqqqsssssqsqsqssqsqqsqqsssqqqqqqqsqqsqsssqsqsqqssssqqqsssssqqqqqqqsqsqsqqqssqqqqsqqqsqqqsqssqqsqqsqsqsqqqsqssssssssssssqssqssssssqsqqqsqqsqsqqqsqsqqqsqssqsqssqsqsqqqqqssqsqsqqsqqsqqsqqsssssqqqsqqqssssqqsqsssqsqqsssqqssqqssqssqqqsqssqqsssssqqqqsqsqsssqsssssqsqqqsqqqsqqsqsqsqsqqsqsqqqqsqsqqqqssqsqqqqqssqsqsqssssssqsssqsqqssssqqsssssqsqssqssqsqqqssqsqsqsqqsqqsssqqssqsqqsqqsqsqssqqqqsssssqqqqssqqsqsqssqsqqqqsssqsqsssqqqqqqsqsssqsqqqsqqqqqsqsqqqqqssssqsqsqqsqqqssssqqssqsqssqssqqssssqqsqqqsqsssssqsqssssssssqqsqqsqqqqqssqssqqsssssqqsqqqsqqssqsqqssqsqqqqssqqsqsqqsssqqqssqqqqqssqqssqqqqqsqssqqqqqqsqqqsqsqsqsqqssqssqsqqsssssssqqssqsqssqsssqqssqssqqsqssqssssqqqqsssssssqqsqssssqssqssqsqqsssqqssssssssqqssqqssqqsqsssqsqqqqqsqqqqqqqssqsqqqsssqqsqqsqssqssqssqsqqsqsqsqssqqqsssqssqssqqsqqqqsqqssssssqqsqssssssqqqqssqqsqsqsssqqqqqqqqqssssqssssqqssqsqqssqsssqsqssqsqqqqssssqqqqsqqssssssssssqqsqqqssqsqqqsqqqssssqsqssssqssqqsqsssssqssqqqqsqqssqqssqqqqqssqsqsqqssqssqqsqsqsqqqqsqsssqqsqqsqsqssqsssqssqqqqsqsqqssqsqsssqqqssqqssqsqsqsqsqsqqssqqqsqsqqqqqsqqqqqsqqsqsqssssqqqqsqqqqsqqsssqqsqssqqqssqqssssqsqssqssssssssssqqqssqsqqssqsqsqsqqsqsqqqsqsqqqqqsqsqqssqqssssqqssqsssssqsssssssqqqqqsqsqsqqssqssqqqssqqqsqqqsqsssqqsssqsssssssqqqqsqqsqqsqqsqsqqqsqqssssqqqssqqqqqsqqqsqsqssqqssqsqqsqssqsqsqqssqqsqssqsqqqsqssqsqqssqqsqqsqqsqsqsssqsssqqqqsqqqqssqqqqsqsqsqqsssqsssqqssssqsqqqssqqssqqqqsqqsqqqsqqqqsqqqssqsqqqqqsqsssqqqsqqqqsqqssqqqqssssqqqsssssqsqqssssqqqqqqsqssssqqssqssqqsqssqsqqqqqqsqqssqsssqqqqqqsqqssqssssqssssqqqqqqsqssqssqsqqsqssssssqssqqsssqqqqqqqqsqqqqqqqqqqqssssqqqssqqssqqqsssssqsqqqqqssqsqqssqqqqqsqqqqqsssssssqqssqqssqqsssssqsqsqqssssqsqqqsssqqssqssqssqqssqssssssqssssqsqsssqssqqsqqqssqsqssqqqsqsqsqqqssqqqqqqqqsqssssqqsqqqssqsqssqsqqqqqsqqqssqssqqsqsqsqssqsqsssqsssqqssqqssqqqsqqqqqqqssqqsssqsqsqqsqsqsqqqsqqqsssqqqqqsqsqqqqsqqqsqqsqsqqsqssqqqsqssqqssqqsqqsssqsqsqqqsssqssssqsqsqsssqqqqqsqqqsssqqqsqsqqqqqqssssqqqsqsqqssqssqssqqsssssqqsqsqqsqqqssssqsssqqsssssqqqqqqqqssqsqsqqqqsqqqsqsqqqqqssqqqqqssssssqsqsqqqqqsqsssqqsqssqqqqqsssssssqqqqsqqqssqqsqqqssqssqssqqssssqqqqsqqsqqsqsqqsqqqqsssqqsqqqqqqqssssssqqsqsqqqqqsqqssqsssssqqqqsqsqssqsqssssqqssqqssqssqsqqsssqqsqsqsqqqqsqqqsssssssqqsqssssqqsqqqqqqqqqsqqqqssqqsssqssssqqsqssssqsqqqqsssssqsqsqqqqsqsqsqqqsqqsqsqsqqqsqsqqqsssqsqssssqsqqqssqsqsssqsqqqqqqsssqqqsqqqssqqqqsqqqsqsqqsssqqsssqssqsqsqqssqqqqqssqssqsssqsqsqsqssssqsqqsqssssqqsqsssqqqqsqqqqssqqqqssssqqsqqqssqsqqqqssqqqqqsqssqqsqsqqsssqssqqsqqqssqqsqqqssqqsssqqqssqqssqqqssqsqqssqqqsqqssssqqqsssqqqssqqssqsssssqqqqssqsqsqqqqqssqqsssqqssqqssqsqqsqssssqssssqqssssqqqqqqqqqqqsssqsssssssqssqqssqqsqqqqqssqsqqqqqssssqqsssssqsssqsqsqqssssqssqqssqqsqqsssqsqsqsqssqssqqqqsqqqsssssqqsssqsqqqssqqqsqqsqssssqsqssqsqsqsqqqssqqqqqqqqssqsqqqsqssssqqsqssqsqsqsqsqsssssssqqqsqsssqqssqqqqssqssqqsqqssssqqqqqsssssqqqsssqssqqsqqsqqsqsqssssqqsqssqsqqqsssqqqqqqsqsqqsqssqqsqqqsqqqsqssqssqssqsqssssssqssssqssqsqqssqqsqssssqqqssqqqqqsqsqqsqqsqsqqqssqqqqssqsssqsqssqqqssqsssssqsqqqqqssqsssssqqqsqsqqqqqsqqqsssssqqqssqsqsqsqqssqqsqsqqqqqqqqqqqssqqqqsqqqqqsqqsqqsssqqsqqqqqqsqssssqsqqsqsqssqqsqsqsqqqssqsqqqqqqqqqsssqqssqssqqqqqqqqsssqqqsssqqsqqqqsqsqsqsqqssqqqqsqsssqqssqsqsqqqssssssqsssqqqsssqsqsqqsqqsqsqqsqsqqqsqssqssssqqsqqqssqqssqssqssssqssqqssqqqqssqssssqqqqssqssqsssssqqsqqsqssqqqsqssssqssqqssqsqsqsqqqssssqssqsqqqqqssqqsqqqsqssssqqqqqssqqqqqsssssqqsqsqqsqssssssssssqqqqsqsqqqqssqsqqqsqqsqssqsqqsqqqqqsqqqsqqqsqsqssqssqsssssssssqqqqqqqsssssqqsssqqqqqqqqqqqqqssqqqsqqqsqsqsqqqssqsqsqqssqssqsqqqqqsqssssqqsqqsqqsqsqqqssqsqqssssqqsqqqsqqqqssqqssqsssssssqssssqssqqqsssqsqqqsssssqqsqssssqqssqsqssqqqsqsqqssqqsqqsssssssqsqqsqqssssssqsqqsqqsqsqqqsqqqqsqqsqqqssqsqqqqsssssqqsqqqqqqqqqsqqsqssqqqssssqsqsssqssqqqqqsqsqsssssqssqssqqssqqsqsqqsqqqqqsqsssssqssqsqqssqqssqqqqqsqqqsqssqssqssqsssssssqsqqqsqsssqqqqqssqsqqsqqqqssssqssqqsqssqsqqqqqsqqqsssqqqqqqqsssqsqsssqqqssssqsqssqsqqssqqssqqsqqqssqsqqssqqsqssqsqqssssqsqsqsssqsssqsqssssqqssqqqqqsqssqqsssqqsqqsqqqsssqqsqsqsqqssqssqqqqsssssqsqssqsssqssqsqsqqqqsqsqqssqqsssqqqssssqsqqqsssqqsqqqqqqqsqqssqsqssssqqqssqsssqqssssqssssqssssqqqqqssqqsssqssqsqqqssqqqssssqqssqsqqqsssqsqqsssssssqssqsqqsqqqqqqsssqqqsqqsssssssqssqqssqsqssqsqssqsqsssssssssqqsqqsqqssqssqsqqsssssqqqqsqqqqsqssqqqsssssqqsssssqsqsqsqqssqsqssssqqsqqsssssqqqssssssssqqqsqsqqqsqqsqqqsqsqssqqqqqsqsqsqsqqqqqqqsssssssssqssqsqsqssssqqqssssqqsssqqqssssqqsqqqssqqqsssssqqsqqqqqqssssssssssssqqqqsqqqssqqqqqsqqqqqqsqssqssssqssqqqqssqsqqsqqsqssqsqqqssqssssqsqqsqqsqssqssqsqsqssqqqsssqsqssssqsqqqqssqsssqqssqqsqqqsssssqsqsqqssqqqsqqqsqqsssssqsssssssqqsqqqqqqqqsqssssqqqqqssssssqqqqssqssqqsssqqsqqsssqqqqqqqsqqqsqsqsqqsqssqssqssqqsqqsqssssqssqqqqsqsqsqqqssssqqsqsqsqsqsqqqssqssssqqssssqsqsqqssqssqqssqsssqqqssqqqqqsqqqqqsqqqssqsssqqsqqqqsssqsssssqsqsqssssqqsqsqsssqsqqqqqssqssqqqqssqqssssqqqqqssqsqssssqsqqqsssqqqqsssqqsssqqsqqsqqqqsssqssqqqqqqqssqssssqsqsqqqsssqsqssqqqqqqsqqssqsqssqqqqqqsqqqqsqssqqsqssqsqqsqsqqqqqssqqsqssqsssssssqssssqqssqssqsqqqqqssssssqsqqqssqsqsqqqqqqqsqsqqsssssssqsqssqsqqsssqqqsqqssqqqqqqsssqssqsqssqqssqssqqssqssqsqqqqqssqqqssqssqssqsqsqqqsssqqssqqqqqssqssqqqssqsssqssqsssqqqssqqqqqqssssssqqqsqqssqssqqssqssqsqsqqsqssqssqssqqssssqqssqqssssqsqsqsssssqqssqsqssssqssqsqsqsqsqsssqqqqssssssqqsqqqqqssqqqsssqqqssqqssqqqsqqssqsssqssqsqssqsqqqqsqqsqsqqqssqssqsssqqsssssssqqssssqssqqsssqsqsssqqqsssqssqsqqqsqqqqssssqqqqqsqssqssssqqqqqssssqsqqsssqssqqssssssssqqsqqqsqssqsssqsqqsqssssqsqqsssqsssqsqqsssqqsssqsqssqqsqqqsssssqsssqqssssqssqsqqqqsssqsqsqsqssqssqqqqsqqsqqqqsssqsssqqqssqqsqsqqqqssqqssqsssqsqsssqqqsqsssqqqsqqqqqqqqqsqsqqssqsqqqqsssqqsqsqqqqsssqqqqqqsqsssqqqqqsqqqsqqqssqqqsssssssqqqqqqsqqsqsqssqsssssssqqsqssqqqqqqsqsqqqsssqqssqqqqsqqqsqsqqssqsqsqssssqssqsqqqsqsqqqqqsqsssqqssqqqqqqqqqsqsqqsssqqqqssssqssqqsqqqqsssssqqqssqqqsssssqsqqqsqssssssqqqsqqsqssssqqsqqqqqsqqqssqqsssqssssqsssssqsqsqqsqsqsssssqqssqsssqssqqssssqsqqqqqsqssqqsqssssqsqqsssqsqsqsqsqqsqqsqqqssqsssssqsssssqqqsqqsssqsqqsssssqqsqssqsssqsqsqssqqsqsqqqqsqqqsssqsqqqsqsssqsqqqssqssssqsssqqsqqqqqsqqsqqsssssssqsssqsqsqssssqsqssqsssqqsqqqqqsqqqsqssssssqsqsqssqqssqsssqqsqsqqqsqqsssqqqqsqqsqqqsqsqssqqqqssssssqqqssssqsqssqqsqsqqsqqqqssqssqsqqsssqsssqqsssssqqsqsqsqqsqqqqqqqsssqsqqqsssqqqqssqqsqqsqsqssqssqsqqqsqsqqqqsqqqssqqsqqsqssqsqssqssqssqqsssqsssqqqsqqqqqqssqsssqsqqqqssssqssqssssqsssqsssqssssqsqqssqqsqsssqqsqssqsqsqqqssqsqqqqqsqssqssqsqqsqsqqsqqsqqqssqsqsssqssqqssqqsssqqsqssqqqssqssqsssqsssqssqsqssssqqqqqqssssqqsqqsqqqsqqqsqqqsqsssqqssssqqqsqqssqsqqsqsqsqsssqqqsqqqqqssqssqsssqqssqssqqqqqsqssqsqqqsssqsssqsqsqqsssssqssqsssqsqqqsqqqqqsqssssqsqqssqsssqqsqssssqqsqsqsqsqsqqqqssqqqqsqqsqqqsqqsqqssqsssqqssqsqssqqssqqqqqqsqsqqssssqqssqsqqsqqqqssqqqsqsqqqsssssqqssqsqssqsssqqssqqqssssqsqsqqsqsssssqsqsqqsqqqsqqqsqsqqssssqqqsqssssqsqqssqqqqqqsssqsssqsqsqsqsqsqqssqsssssqqqsqsqsssqqsqsqsssqqqsqsqqssqqqqssqssqqssqsqsqqssqqqqsqsqqsssssqsqssqqqsssqqsqssqqqqqqssssqssssssqssqqsqsqsssqqqqqqssqssqsqqqqqqsssqqqqqqsqqsqqqsqsqssqssqsqqqssssqqqssqsqqqqqssqqqsqqqqqsqsqqsqsqqsqqsqqsssqsssqsqqsqqqqsqqsqqqsssqsssqsqqsqqssssqqqssqqqsqsqqqssssqqssssqsqqqqsssqsqssqqssqqsqqqsqsqsqqssqqqqqsqqsqsssqqsqsqqqqqqsqqsqsqsqssqqqqsqsqqqqsqqqqqsqqqqqqsqssqsqqqsqsqqqsssqsqqqsqqqsssqqssqqsqqsqssqqqqqsqqqssqsqsqsqsqssqqssqsssqqqsqsssqssqqqsqqqsqqqsqsqqqssqqqqsqsqssqssqsqqsqqsssqsssqsssqqsqssqsqqqsqqssqqsqqsqqqqqqqqsssqqssssqssqqsqqqqssqssssqqsqqqqssssssssssqqqsqsqqsqqssqqqssqqsqsqsqsqsssqsqqqsqqqsqssssssqssqqsssqsqqsqqssqqqsqssqsqsqqqqqssssqsqsssssqqssqqqqqsqssssqsqsssqsqqsssqsqssqqqqsssqssqsqssssssqsssqqqqqsqqqssqqsssqqqsqqsqqqqsssqqqssqqssssssssssqssqssqsqqqqqqqqsqqqqsqsqsqqssqsqqsqqqqqsqsqqssssssqssqssssqsqqsqssqssqqqsssssqqqssssqqqsqsqqssssqsqsssqssqsqssqssqsssqqqsqqqssssqqsqqqqqssqqsssqsssssqsssqqqqssqqqsqssqqssssssssssqsqqqssqqqsqqsqssssqqqsqssqqsqsqqqqqqqssqqssqsqqqqqqqqssqsqqsssqqsqqsqssqqqqsqsqqqqsqqssqsqssqsqqqsssqqqsqqsqsqssssqsqsqqqsssqqsqssssqqssqssqqsqqqqqsqqqssssssqsqqssqsqsssqqssqqqqqsqqqqsqqqsqqqqsssqqsqqsqsssqqssqssssqqssqqsqsqqsssqsqqqssssqsssqsssqqsqssqqqsssqsqqqqssqqqsqqssqqqqqqssqqqsqqssssqssssssqqsqsqssqsssqqqqqsqqqqsqssqsssqqqqqssqsssssqqssqsssqqsssqssqsqssqqsqqsssqqqssqssqqssqsqqqsqqsssqqqqsqqsqqqsqssssssqsqqqsqqqqsqqsqssqqssqssqqsssqqsssqssqqqsqqsqsqqsssqqssqsqqsssqqqqqsqqqsqssssqqqsqssqssqssqsqsqqsqqsqssqqqqqqssssssqqsqssssssqqsqssqssqqsqssqqsssqqssqqqqqsqqqqqssqsssqssqsqsssqqqsssssqqqsssqqqqssqsqssssssqqqssqssqqqssqqqssqqqqqqqqssqqsqssqsqqssssqsssqsqsqqsqqsqsqqqsssqqsqsqssqssqssqqsqsqqqsqsqsqsqqqsqqqssqqsqssqqssssssqsqsqqsssqsqqsqqsqqsqsssqssqqsqsssqqqsqqssqssssssssqssqqssqsqqsssqsqsqsqqqsqssssssqsqqqsqqqsqqsqqqsqqssssqsqqqqsqqqsqqssqsqssqqqsqsssqqsqsssqqsssqsqsqqqsqsssqqsssqsqqqsssqsqqssqqqsqqqqqsqqqsqqqsqqqqsqsssssssqssqsqqsssqsqsqsssssqqqqqqqssssssssqqsqsqqsqssssssqqqqqqssqsssqsssqsqsqsqsqqqqqssqqqsqssqssssqqqsssqqsqqsqqsqqqsqqsssqqqqqqssqqqqssssssqqssqsqqsssqssqqqsqsqsssqsqqsssssqssssssqsqsssqqssqssqsssqsqqqssqsqsqssqssqqssqsssssqqsssqqqqssqqsqqsqqqqssssssqqssqqqqsqsssqssqsqqqqqsqssqqssqssqqsssqssssssqqssssqsssqqqqsssssssssssqsqssqsqqqsssqsqqqsqsssqsqqqqssqqssqsssqqsqqqqqqqsqqsqqqqqssssqqqsqqssqqsqqssqssqqqsqsssqqqsqsqqqqsqqqsssssssqsqqssssqqqqssssqssqqqqsqsqqqqqqqqssqsqsssqssqsqqqsqqqqqqsqqsqqssqqqqssqqsssqssqqqssqsssssqqsssqssqqqqqssqqqsqqqssqsqqqssqssqsqsqqqqqqqsqssssqsqssqqqqqsqqqqssqqsqqsqsqqqsqsqsqqqsssqsqsssssssssssqqsqsqsqsqsqsssqqsqssssqqqqqqqqqssqqqsqqqsqssssqsqssqqqqqqqsqqsqqqssqqqqsqsqssqsqsssssqsqsqqssqssqqqqqsssssssqqqssqqsqqqqqqsssssqqqsqsssqssqsqqqqqssqssqqqqsqsssqqqqqqqqqsssqsqssqssqssqssqssqssqqqqsqssqssssqssssqsqsqsssqssqqsqsqqsssqssqqqsqsqqsqsssqsqqsqqqsqqsqssqqsqssssqqsqssssssqssqsqssqssqqqsqsssqssqqssqqsqqsqssssqssqqsqqsssqqqssqsqqqqsssqqssssqssqqqqqssqqssqqssqqqssssqqqqsqsqqqqssqqqqqqsqsssssqsqqqqssqqsqqsqqqsqsssssqssqqqsqsqsqssssssqssqqssqqqsqsqqsqqqssqqqqssqssssqqqqsqsssqqsqqqqqssqsssqsqqsssssqsssqqqssssqqssqssssqqqqssqqssqqqqsqssqqsssssqqqssssqqqqqqqsqqsqsssqsqqqqsqsqqsqsqqsqsqsqsqqssssqqssqssqqqqsqsqqqqqsssqsqqqqqqsqqsssqqsssqqsssqsqsqsssqsssqsssssqsqqqsssqsssqqsqsqsqqqssssqsssqssqsssqqqqqsqqsqqqqsssqqssqqsssqsssqsssqssqsqssqsqsqqssssqssqsssssssqsssssssqsssssqqsqqqsqqsqssqsqqsssqsqsssssssqssqsqsqsssssqqqsqqsssqsqqsqssssssqssssqqsqqqsssssqsqqqqqqqsqsqqsqqssqsqqssqqqqqsqqsqsssssqsssqqqqqssqqqqqqssssqssqqsssqsqssqsqssqqqqqsqsqqqqqsqqqqsqqssssqqssqqqqqqsqsqsqssssssssqqqqssssqsqqqssqqssqsqqqsqqqsqqqqssssqsssqsqqsqsqssssqsqssssssssssqqssqssqqqqssqqsqsssqqqqqsqsssssqqsqssssqqqqqssqssqqsqqssssqsqssssssqssssqssqqsqqqqsqqqsssqqssqsssqqssqsqqsssqqqsqqssssqqssqssqqqsqssssqqqsssqsqsssqqsssqqssqqsssqsqssqqsqsssqsqsqsqqqqsqsssqqqqsqqqsqssssssqqqqsqqqssqqsqssqqssqqqsssqqsssqqqqqssssqsqqsssssqsssqsqqqsqqsssqqqqqsssqqsqqsqssqssqqqqssqsqssqqqssssqqssssssssqqqssqsssssqssqsqsssqsqsssssssqssqssqqqsssssssqsqsqsssqsqssqqssssqsqsqqqqssqssqqqqssssqqsqsqsqqqqsqqqsqssssqqsssqssssssqsssqqssqqssqqsssqqsqsqssssqsssqqqqsssqqsqssssqsqqqqsqqqqsqsssqqssqsqsssqsqqsqsqssqsqsqqqqqqsqsqsssqssssqsqqqssqsssqqsqqqsqsqsqsqqqqqqsssqsqsqqqqsssqqqsssssqqsqsqsqqqssqssqssssqqqsqsqssqssqssssqqqsssssqssqqqsqqssssqsqsqqqsqqqqqqqsqqqsqqqssqqssssqqqssssqssqqqqsqssssqsqqsssqqqsqqsqqsssqsssqqsqsqqqqsqqsqssqqqqsqssqqqsqsqqsqsqsqqqsqsssssqqsqsssssqsssqqqqsqqssssssqssqqssqssqqssssqqqssqsssqssqssqqqssssqsssssqsqqqsqsqqsssqqsqssqqsqsqsssqqsqqsqqsssqsssssssssqqqqsqqssqsqsqsqsqqqsqssqqqqsssqqqssqsqqqsssssssssqssqssqqsqsqsssssqqqqqqqqqqssqqsqqssqsqsqsssqqqqsssqsssqsqqqssqqsqqssssqssssqqqqsqqssqqsssqqsqqsqqsssqqssssqqqsssqqsqsqssqsqqqqqssqqqssssqsqssssssqqsqssqsssssqsqssqqqqssqsssqsssqqsssqqqqqssqqqqqqqssqqsqqqqqqqsqqsqqsqqqsqqqqssqsqqsssqsqqsqqqqsssqsqqsqqsqsqqqqqqqsqsssqssqssqsssqsqqsqqssssqqsqsssqsqqqqqsqqsssssqqqqqqqqssssssqqsssssqsqsqqqqsqsssqqssqqssqssssqqsssqsqsqssqqqqqqsqqqqqsqqssssqsssqssqsqssssssqssqqssqsssqqqsqqsqqssqqqqsssqqsssqqsqqqsssssqqqqqsqqssssqqqqsqssqsqssqqqqssqsssssssssqssqsqqqsqqqqsqqqqsqqssqsqqsssssqqqqqssssqqqqssqsssqsqssqqqqssqssssssqqqsqqssqssqqqqqqqsqsqssqssqsqssqqsssssqsqqqsqqsqssssqsqssqqqssssssqsqqssssqqqssssqqssssqqssssqqssqsqssqqqqqqsqqsqsqqsqqsqqsqsqsssqssqssssssqsssqqssqqsssqqqsqssqqqsqqqqqsqsqqqsqssqqsqsqsssqqqsqqsqssqssssqqssqqqssqsqsssssssssssssqqqsqqsssqqqsqsqqqsssqssqsqqqqsqsqsqsqqssqsqssqssqqsqqqsqssqqqssqsssqssqsqsqsqsqqqsqqqqssqqsssssqsqqqssqqqqqqqqsssqsqssqqqsqsssssqssssqqqqqqqsssqssqsqqqsqsqssssqsqqsqqsssqqsssqqsqsssqqqsqsqqssqsqssqssqqsqsqqqqsssqqsqqssqqqqqssqqqsqqqqsssssqqssssqssqqsssqqqssqqqqqssqqqqsssqqqsqqsqsqqqqqsqssqssqssssssqqqsqssssqqqsqqqqqqssqsqqsqqsqsqqsqsqqqqqqqqqsqqssqssqqsqqqqqsqqssqsqsssssssqsqqsqsqsqsqsssqqqsssqsssqqqqsqsqssqssqsssqsqqsssqqqqqssssssqsqsssqqqqssssqqssssqqsqqqqsqqqsqqsqssqqqqqqqqqsqqssqqssqqsssqqsqqsqssqqsqsqqqsssssssqsssqqqssssqsssssssqqqqqqqqqssssssssqqqqsqssqqqssqsqqssssqssqsqsqsssqqqqssqsqqssqsqsssssqqqsqssssssqqsqqqqssssqsqqssqqqqsqsqqqqqqssqsqqsqqqqsqssqqsssqssqqqqsqssqssssqsssqsqqqqqqsqqqqqqqssqsqssqqsssqqqqssssssqqqqqqsqssqqssqssqqqssqqsqssqsqsssqqsqsqqqsqssqsqqsqqsqsssqssssqqqssqqsqsqqsssqsssqqqsssqsqsssqsqqssqqsqqsqqssqsqsqsqsqqssqqssqsssqssssqqsqsssqsssssssssqqssqqqqqssssqsqssqqqssssqsqsqqssqsqssqqqqsssssqqsqssqsssqssqqqqsqsssqqsssssqqsqqssqsqsqssqsqqsssqqssssqssssqqqsssqsssqssqqqqqqqsqqsssqqqqsssqqqssssqqqqqqqqsqqssssssqssssqqqqssqsqqsqsqssqqsqssqqssqsqqssqqqqqqsqqsqsssqsqqsqsssqsqqsqqqsqsssqqsqqqqqsssssqqqsqsqqsqqqssqsqsqsqsqqsssqssqqqqsqqssqqsqqsqssqsqqqssqqsqsqqqsqssqsqqqssqqssqqsqqsqsssssqqqssqqqsssssssqsqsqqssqsqsqqqqqqsssqsssqqsqsssssqsssqssqssqssqqssqqqqsqqsqqqqssqqsqqsqqsqsqqqsqsqqqssssssqsqqsqqqsqsqqqqsqssqsqqssqssqqssqsqqqqqsssqsqsqsqsqqsqqqsssqqssqqssssssqqssqqsqqsqsqqsqsssqqssqsqqssqqqsqsqqqsqqqqqqqqsqqqqqqqqsqqqssqssqqsssqsqqqqsqqssqsssqsqsqssssqqqsqsqqqsssssqssqqssqssqssqqsssqqqsqqqqsqsssqssssqqqqqsssssqqssqqqqsqssqssssqqqqssqqssqqqqssssssqsqsqssqssqqsqqsqqsqssssqsqsqsqsqsqqssqsqsqqssqssqqssqsqqqsssqsssqsqsqssqssssqsqqsssqssqsssqsqqqssqqsqssqsqqsqsqssqqqqssqsqqsqsqssssqsqqsssssssqqqqssssqsqsqsqssqqqsqsqqsqqqssqsssqsqsqsqsqqsqsqqqqsssqsqqssssqsqsqqssqqqssqqqsqsqsssqsqssqqsqssqqqqsqqssqqssqssqsqssssqsqssqqsssssqsssqqqsqsqqsqsssqqssqqssqsssssqqsssssqqssssssqqsqsssqssqqqqssqsqssqsqsqqqsqsssssqsssqqsssqqsqqqqsssqsssqssssqsqqqqqqssssssqsqqsqsqssqqqqqssssqsqqssqsqqqqssqqqqqsqqqssssqssssqssqsssqssqsssqqqssssqssqqqsssssqqqqqsqsqqqqqqsqqqqqqsqqqqqsssqsssqqqqqsssqsqqqqqqssqqssqqqssqssssssqssqssqqsqqqqqqqsqqqssqqqsqqqqqsqqsqqqqsqssqsqqssqqsqssqqqsssqqsqqsqqsqqqsqsssqssqsqqqsssssqsqssqsqsqsqqssssssqsqqqsqqqqqsqsqqssqsqssqsssqqqsqqsqssqqqsqqqsssqqsqsqqsqsqsqqsssssqsqqqssssssqqqsssqqssqsqqsqsssqqqsssssqqqsqssqsssqqsssqsqssqsqssqqqqqsqsqqqssqqqsqsqssqsssqssqqqsqsqssqqsqqqsssqqqqqsqssqqqqqqqsqsssqssqsqqqssqsqqsqssqsqqqsqsssqqqsqqsqqssqsssqssqssssssqqsqsqsqssqssqqssqsqqqqqqqsqqqssssssqqsssqsqssqsqqssqsssqqqqqsssssqssssqsssqqsqqsqqqsqqsqqssqqsqqqqqssqsqqqsqqqsssqssqqssqsqqsqqqssqqsqsssssssqsqqqssssqqsqqssqsqssqqqqqsqssqqsqqsssqssssqqsqqqqsqssqqsqsqqqqssqqqqsqsqsssqqqssqssqssssqssqqssqssqssqqssqqssqssssqqssqqssqssqssqssqqsqssqqsqsqqsqsqqsqssqsqqsssqqqqssqqsqqssqqssqsqqssssqqqsqsqssqqsqssqsqsqssqqssqsssqsqssssqqqssqsssqqsqssqqsqsqsqqsqssqqsqsqsqsqqqqsqssqsqqqssqqssqqqssqqsssqqssssqqssqsqqqsqqsqqqqssqsssssssqqsqqqssssqqqqqqqsqssssqsqssqqqqsqsqssqqqqsqqqqsqssqsqqsqsssqsssssqsqsqqsqsssssssqqsssssssssqqssqsqsqssqqqssssqssqssssssqqsssqqqssssssqssqssssqsqssqssqqsqsqsssssqqqqssqqqssqqsqqqqssqqqqsssssqqqsqqqsqsssqsqqssqqqsssqsqqsqssssqqsssssqqqsssssqssqqssssqqqssqsqqssqssqqqsqsqssssqsqssssqsqssqssssqqqqsssqssqsqsssssqsqqqqqqsssqsqsssqsqsqsqsqssqqsqsssqsqqssqsqqsssssqqsqsqssssqssqqqssssqsqqsssssssqqsqqsssqsssqssqsqqssqqqssqsqsqsqqsqqsqqsqqsssqsqqqqqqqqsssqqsqssssssqqqsqssssqssqsqsqqqsqqqqqsqqssqqsssqqqqqssssqqssssqqqsqssqqsssqsqqqsssqqqsqsssqqsssqsqssqqqqqssqsssqsqqqqsqsqqsssqqqqssqssqsqsqqsqsqqssssssssqqsssqqqsqsssqqsssqsssqsqssqsqqqqsqqqsqsqsqqsqssqqqsqqsqsqsqsqqqqqqsqsssqsssqqssqsqsssqqsqssssqqqsssqqqsqqqsqqqqqqssssqqsqsqssssqsqssssqsqsqsssqssqsqsssssqsqssqqqqqqsqqsqqqqsqqssssqsqqsssqqqqqqssqqqqqssqqqssqqqqsqsqqqsqqqqsqssqqqsqqqsqssqsqsqqqsqsqsqsqqqsqsqqsqqsqqqqsqqsqsqqssssqqqqsqqqqqqssqsqsssqqssqqqsqqsqsqssssqqqssqsqssqqssssqsqqqsqsssssssqqqsqqssqqqsqssqsqqssssqssssssssqqqqssqssqsqqqqqssqqssqsqssqsssqsqsssqqqssqqsqqqqqqsssqssssssqsqsssqqqqsqsqssqqsqsqqqsqqqqsssqqqsssqsqsqssssqssssqssqsqsqqqqqssqqsqqsqsssqqssqsqqqqsqsqqqsqqqsqqqsqqqqsqqqqqsqqssqsqqsssqqsqqssqqssqqsssqssqqqqssqqsqsssqqqssqsqqqssqqsqsssqqqqqsqqqqqssssqssssqqssqssqqqssqqssqqsqqqqqqqssqqqssssqqsqssqqqqsssqssqqqsqqssqsssssqsqqqqqqssqqsqssssqssqssqqssqsqsqqqssssqqqsqqsqssqsqsqqsqqqqsqssqssqqqqsqsqqsssqsqqqssssqssqqsqssqsssqsssssssqssssqssqqqqqqqssssqqqsqsqssqssqqssqqqqsqsqqqssqqsssssqssqqqssqsqsqqqsqqsqsssssqqssssqqqssqsqqsqsqqqsqssssqqsqqsssqqssqqqssssssssqqsssssqsqssqsqqsqqqqsqqsssqsqssqsssqsqsqsqqqqqqqqqqssqsqsssssssqsqsqsqssqqqsssqsqsqqqqqqqsqsqssqqssqssqssqssqsqqqsqqssqssqqsssqqsssqsqsqqqqssqqsqsqssqsqqqsqqqsqsqsssqqqqqqsqsssqsqqqssqsqqsssqqqqsssssqqqssqssqqsqqqqsssqsqqsssqsqqqqqqsqssqssssqqsqqqqqqqsqsqsqqssqsssqqssqsqssssssqqssqsssqsssqqsqqqqqqqsqsqqsssqsqsqsqqqssqssqsqssqqqsqqsqsqsqqsqqqqqqsssqqsqqsqsqsqqqsqqqsqsqssssqqqsssqqsssqqqqsqsssqssqsssssqsssqqsqqqsssssssqssqsqqqqsqssqqsqssqqssqqsssqsssqqqsqqsqqssqsqsssqsqsssqssqqqsqqsssqsqsssqqsqsqqqqqqqsqssqqqqqqssqqqsqsqqqssqssqssqqqsqsqqsqsqqsssssqqqsqqsqqssssqssqssqqsqqsssqqssqssqqssqqqqsqsqqsssqsqqqqqqsqqsqqqqsssqsqqqqqssqqqqqqsqsssqqqsqqsssqqssssqqqqsssssqsqsssqssssqqqssqqsqqqsqqsqqsssqqqqsssqqsqssssssqssqqqqqqsqsqsqqqqsssqsqssqqsssqqqqsssssqssqqsqsqsqsqqsqsqssssssqsqqqqssqqsssqqqqsqqqqqssssqqqssqqqqsqqsqqssqssqqqqsqqsssqqsqqsssqsssqqssqssqqssqsqsqqsqsqssqsssqqsssqqssqsqssssssqqqsqssqqqqsqqsqssqqssqqsssqsssqsqsqssqqssqsqqqqssssssssssssssssqsqssqsqssqqqsqssqssqssqsssqqssssqsqqqqssqqqsqqqssqssqqqqsqssssqqqqsqqsssqqqsqqssssqsqsqqqsssssqqsqqsssssssqqssqsssqqqqsqqsssssqsqqsqsqqqqsqsqsqqqqsqqsqssssqqsqqsssqqsqsqqqqsqqqsqqqqsssqqsssqqqqqqssssqqsqsqsqsqqssqssqqsqqqqqssqqqsqqsqsqqqsqqsqqsqqqqsqsqsqqsqqqqqqqsqqssqqsqsqsqqsqqssqssqqssqssqqsssssqqqqssqqsssqsssssqqsqssssqqsssssqqqsqsqssssssqssssqsqqsqqsssssqsqqsqssqsqssssqssqsqssqqsssqsqsqsqqsqqqsqqsqsqsssqqqsqqsssqqssssqqqqqsqssqsqsqqqssqsssssqqsqsssqssssqqqsssssssqsqqqssqsqsssssssqssssqssqqssqsqsqsqqssssqqqqqsqssqsqqsssqqqsqssssqsqssqsqssqsqsqqqqsqqqqsqsqssqsssqqsqssssqqqsqqssqsqsqsqqsqqqsqqssqsqssssssqqsqqqsqsqqssqqqsqqqsqqqsqssqsqssssssqsssqsqqqqqqssqssqsssssssqqqsssqssqqqsqsqqqqqsqqsqsqssqsqssqqsqsqqssqsqqqqqqqqqqqssqqqqqsqsssqssqsssqsssssqssssqqqqqqqssssqssqqqsqsqqssssqqsqsqsqqqsqqqqsqqsqssqsssqqsqqsssqsqsssqssssqsqsqqqqqqqssqqsssqqsqqqqqsqqqsssssqsqqqsssqssqsqsqqsqqsqsqsqqsqqsqsssssqssssssqqqsqssqqqssssqqsqsqsqsssqsqssqqqqqqqsssqqqsqssqssssqssqssqsqqssssqsqsqssqqqssssqsqsssqsqqqqqqsqqqqqqssqqsqqssssqqssqqsqqqssqsqqqqqsqssqqqsqqsqsqssqsqqssssqqqqqsqqqqqqqsqssssqqsssqsqsqqsssqqqqqqqsqqsssqqsqssqsqqsssssqqqqqssssqqssqqsqssqsssqqssqqsqqssqqqsssqssqqqsssqqssqsssqqqqqsqssqsqsqqsqsssqqsssqssqqsqsqssssqsqqqsqssqsssqqssssqqsqqqsssqssqqqsqssqsssqqqqqqqsqqqssqqqssssqqqqsqqsqqqsqqqqqqssqqqqssqsqsqqqqssqqqqqqqqssqqsssqqqssqssqqqqqqssqqqqqqqqqqsqqsssqsqsssqqqsqqqsssqqssssssqqsqsqsqqsqqqsqsqssqssqqsqssqqssssqqqsqsqqqsqqqqqsqqsqsqqqqqqqqqsssqssqqqssqsqsqqqqqqsqssqsqssssssqqqqqqqsqqqssssqsqqssqqqsqsssssqssqsqsqqsqqqsqsqsqqqqqqqqsqqqqsqssqsqsqqqqsqqssqsssqssqsssssqqssqsqqsssqqqsqqqqqqssqqsqsssssqqsqsqqqqqssqssqssqqqqssqsqsqqsqsssqsqsssqssqqqqsqsqqsqsqssqqqsqssqsqsqqqqqqqqqsssqqqsqqqsqqsssqqqqsqqsqsqqssqqsqsqsqqssqsssqsqsssssssqsqqssqsqsqqsssqssssqsqsqsssqqqqqqsqsqsqqqqssqqqsqssqssqqsqqqqqsqqsqssqssqsqssssqqsqqqqqssqqsssqqsqqqqqqqsssqsqsqqqsqssqssqqqqqsqsqsqssqsqqqqqsqqsqqqqqqqqssssqssqqsqsqqqqqsssqsqssssssqssssqqsqqssqssqqssqqqqssqqqsqsqqqsqqsssssssssssqqssqssqqqssqsqsqsqssqqssqqssqssssqssqqqsqsssqssqqqsssssqqssqsqsqsssqssqqqqsssqqsssqqsssqqsssqsqsqsqqqqqssqqqqsqsqqqqqssqqqqqsqqqqsqssqsssqsqsqqqqqqqqssqqqssqssqqssssssssssqqsssssssqssqsssssqqqsssqssqsssssqqssqssssqqqsqssqsqqsqsssssssqssqqsqqsqqssqqsqqqqqsqqqqssqsssssqqsqssqsssqqqqssqsssssqqqqqqsssqssqsssqssssssqqqsqsssssqsqqqssqqqsqsqsqqqsssssqqsssqsqsssqsqqqqqsqssqsqqssqqsqsssssqqsqsqsssqqqsqssssqqqqsssqqssqsqsqqsqqsqssqqsssqqqssssssqqsqsqqqqssqssqqsqqsqqqsqqsqssqqssssqqsssqsqqqsqsqqqsqqsqssqqsqqqqssqqsqsqsqsqssssqssqqsqqqqsssqssqqqqqqssssqsqsqsqqqqssqqssssqsqsqsqsssqssqsqqsssqqqqssqqqqqqqsqsssqqsssssqqqqsqqsqssqqqsssqssqsqqqsqqssqsqqssssqsqqssqqqssqqqsqsqqqqqqsqsqsssqsqqqqssqssqqssssqsssqssqssqqqsqssqssqqqssssqssqqsqsqsqqssqqssssssqsqqqqsqqsqqssqsssqssqqqqssqsqqssqsqsqqssqsssqqssqsqsqqssqssssqsqsqsqsqsqqssssqsqqqsqqsqsqqqsqssssqsqsqqsssqqsssqsqsqqssssqsssqsqqqssqssqqsqsqqsqqsqqsssqsssqqqqqqqqsssqsqsqqqqsqqsqssqsqsqqqqsqqsqqssssqqqssqqsssqqssqssqssqqqssqsssqqqqqsssssqqsssssqsqqqqqqsqqqqqsqqssqqqssqqqsssssqqqqssqqqqqssqsqsqsssssssqqqqsssqqsqqqqsssqqqsssqqssqsssqssqsssssqsqssqsqsqqqsssssqssqqsqsqsssssqssssqqsssssqsqsqqqqqqssqqsqqssqssqqsqsqsqssqsssssqqqqqsqqqqqsqqqqqssssqqqqqqsqsqqssssssqqqsssqqqssqsqssqssssssqsqsqsssqssssqqssqsqsqsqqqqssqssssqqssqsqsqqsqqqsqqsqqqqqsqqqssqqqsqqqsqsssqqssqqqqssqsssssqsqqssssqsqssqqqsqqqsqqqsssqsssqqqqssssqsqqqsqqqssqqqqqssqssssssssqqqsqqssqsssssqqssssqssqqsqqsqsqqsqsqqssqqsqqqsqsqqsqqsqsqqqsqssqsqssssqssssqqssqsqsssssqsqssqsqsqsqqsssqsqqsssssqqqqssssqsqsqsqqsssqssssssssssssqsqsqsqqsssqqqsssqqsssqqsqqsqsqqqsssqqssqqqqssqqqssqssqssssqsqqssqqqqssqsqssqqsqqqqqsqqqqssqsqssqqsqqqqqqqqqssqqqssssqssssqssqqqqqqqssssqssqqsssqqqssqssqsqqsssqqsssqsqqssssssqqssssqqqqsqqsssssqsqssssqqssqqqsqqqssqqqqsqssqqsqsssqqssssqsqsqsqqqssqqqqssssqqsqssssssssqqssssqqqqssqqsssqsqqqssqsqsqqqsssqsqssqsqqsqqqssqssqsqqsqsqsssqqqqqqsqsqqqssssqqssssqsqssqqqqsqssqsqqsqsssqqsqsssssqsqsqssqqssssqsssqqsqsqqqqqsqsssqqssssqsqssqqssqsssqqsqqsssqsqssqqsqqqssqsqssqqsqqqqsqssssqssqqqssssssqqqsqqsssqsqqqqqssqqqqssqssqqssqqsssssqssssssqqssqsssssqsqsqsqsqssqqqqqqqsqsqqsqqqsssssqqsqsssqsqqsqqsssqsqssssqqqqqssqsqsqssqqsqsqqssqqqqqqqqsssssqsqsssqsqsssssqqssqqssqsqqsqsqqqssqqsqsqssqsqssqssssqsssqqqqsqssqsssqssssqssqqsqqqsqsqssqsqsssqqqsssqqqqssqqqssqsqqqqsssqsqsssqsssssssqssqqqqssssqqsqqqssqqssssqqqqsqqqqssssqsssqqqsssqqqqqqsqqqsqqsqsssqsqqqsqsqqsqqqqssqsssqssqqsqssssqssqqssqqsssssqqqsqqqssqssqssqqqqsqsqqqqsqqsqqqssssssqssqsqqsqsssssqsqsssqqqsqqsqsqsqqqqsqssqqsssqqssqqqqqqsqqqssqqqsssqssqsqsqqqssqqqsqsssssqqssqqssssqqqssssqqqqsssqqssqqqsqssqsqsqsqssqqsqsqqqsqqsqqsqssqqsssqsqqsqssqqqsqssqssssqqssqsqsssqsqssqsqsqssqqsssqqsqssqsqqqqqsssssqqqqqqqqqssssqqsssqqssqsqsqqqsqsqssqqqqsqsqsssqqsqqssqssqqsqqqqqqqsqqqsqqqsqsqqqqsqssqqqsqqssssssqqssqsqqqsqqssssqssqsqsssqqqqqssqssqqssqqssqqsqqqsqqqsssssqqsqqqqqqsqsssssqsssqsssqsqsqsssssqsqqqssqqsssssqqqqssqsssssqssqqsssqqsqqqqsqsqqsqqqssssssssqqqsqsqsssqssqssqqssqsqsssqqsqsqqssssqqqsssqqqssqqsqsqqsssssqqqssqsqsqsqssqqsqsqssqsqsqssqqqqqqsqsssqsssssqqqsqqsqssqqsqssssqssssqqssqsqssqqqqqsqsqsqsqssqsqqsqqqssqssqqqsqqqssqqqssqqsqssqsqqqsqqqqsqqsssqsqqsqqsssqsqsqssqsssqqqssssqqssssqqsssqsqssqsqqqqqqqssssqsqsssqqssqqqssqsqqsqqsssqsssqsqqqssqqqsqssqqsssqsqqsssqssqqsqsssqsqqsqqqsqqssqssqqqssqssssqsqqsqqsqqqqqsqqssssssqssqqqqqqqqsqqqqqsqqqqqqqqsqssssqssqsqqqsqqqqsqsqssqsqqssqqssqqsqsssqssqssqssqqsqqsssqqsqssssqqsqsqqssqqqqsqqqqqqqsqsqssqsqqqqsqssqqqqsqqsqsssssqqssqsqqsqssqqqsqssqssqsqqssqqqssssqqsssssqqqqqqssqqqssqssqqqsqqssqsssqsssssqqssqsqqqqqqsqqsqqqssqsqqsqssqqqqqqsqqsssqssssqsqqssssssqsqssqqsqqssqqssqqsssssqqqqqssqssqqssqsqqsqsqsssqsqqsqqqsqsqsqqqqsqqssqqqsqsqqsqssssssqqqqqqsqsqsssqssqsssqqsqsqsqqsssqssqqqsqqqqqqqqqsssqqsqssssssqsqqsqqsqqsqsqqssssssqqqqsqssssqqqqsqqqqqqsssqsqsqsqqssqsqssssqsqqsssssqqqqqqqqqqsqsqsqqqqqqqsqqssqqsqssqssssqqqssqsqqqqsqssqsqqsqqsqqqsssqqsssqsqqsssssqsqqqssssqssqssssqssqqqqqssssssssqsssqsqssqqqssssqqqqqqsqsssqqqqsqsssqqssqqqssqssqssqqsqqqqqqqsssqqsqqsqsssqsqqsssqsssssqqsqqssssqqssssssqssqqqsssqqsqqqqqsqsqsqsqqsqsqqssssssssssqqsssqqsqqsqssqssqsqqsqqsqqqsqsqqqsssqqsqqsssqsqsqqsqsqsssqqssqqqssqqqqqqqsqqsqssqsqsqssssqssqqsssqqsqsssqssqsssssqsssqqsqqsssqssssqsssqsqsqqssqssqqqqqqsqqsqsqsssqsqqsssssssssqsqsssssqqqqqsqqqqsssqsqqsssqsssqssqqsqssqsqqqsqqqssqsqqsssqsqsssssqqqsssqsqsssqqssssqqsqqqqsssqsqqssqqqsssqqqqqsqsssqqqqsqsqqssqqqsqqqqssssqsqssqqsqsqqqqsqssqqssqsqssqsqsqsqqsqsqssqqsqsqqqqqssqssssqqqqqssqqsssssqsssqsssssssqqsssqsqsqsqssqsqsqssqqsssqqsqqsqsqsssqqssqqqsqssqqqsssssssqsqqsqqsssssqqssqqsqsqqsqsqqsssqsqsssssqssqqqqssqsqqsssqsssqsqqssqqsqsqqqsqsssqsqqqssqqqqssqsqssqsqssqsqqsqssqqssqssqqssqsqqssqqsssqqsqsqsqqqqssqsqsqsqssssqqqsssssqqssqsqssssqqssqqqqsqssqssqssqqsqsqsqsqqqssssqssqqsqssqsqqssqsqsqsqqqqqssqsqsqsqsqqssqqqsssqqqqqqsqqqssqssqsssqsqqssqqssqsssssssqqsqqqsqsqqqqqsqqqqsssqqqqssqqssqqssssqqqsqssqsqsqssqqqqqsssqsqsqsqsqqsqqsqsqssqsssssqssqssssqqqsqssssqqssqqqsqsqsqqsssqqqsqqqqssqssqqsssqqssssqsssqsqsssqsqqssqqsqsqqqqssqqsqqqssqqqsqqqqqsssssssqssssqqsqssqsqssqsqqqssqsqssssssqsqqqqqssqqssqssqssqsqqsqqsqsqqqssqqqsqsssqqsssssqsqqsqqsssqssqqsqsssqsqqqsqssqsqssqqsqqsssqssqsqqssqssqsqqssqqqqsqqsqqqqssssqsqsssqqqqsssqsqsqqsqqsqqqssqsqsqsqsqqssqqqqqsssssqqqqqsqsqsqsqqqssqqqssqqqsqsqqqsqqqqqqsqsqsqqqqssqssssqssqssqsqqsssqqqssqqqqqqqssqqqssqsqssqssqsqssqsqsqqqqqsqqqqssqsqsssqqqqsssqqqqqsqqsssssqqsqsqsqsqqqssssssqqssqsqqqqsssssqssqssqssqqqsqsssqssqssqsqqqsqsqsqqsqsqsqsqqqqsqsssqssqqsqssqqsqsqqssssqqsssssqssqssqqqqsssqqqqssssqsqsqqssssqsqqqqsssqsqqssssssqqssqsqqqqqsqssssqqqqsssqsqqqqsqqqsqqqqsqqqqqqsssqsqqqsqqqqsqsqsssqsqsqssqqqqqsqsqssqsqssqsqsqqsqsqssqsqqssqqqssqssqqqsssqqqsqsqsssssssssssqqqqsssqqqssqqqsqssqssqqssqsqqqqqqqsqqsqqsqqqqqqqqqqssqqsssqqqqssqsqqqqqqssqqqssqqssqqqsqssqqqqsqqqsqsqsqsqqssqqsqqqqsqssssssqsqqssssssssqqssssssqssssqsqssqqqssssqsssqqsqssssqssqqqqssqssssqssqssqsqqsqssssssqqqsssqsqqsqqqqqqsqqqssqsqsqssssssqqsqssqssqssqsqqsqsqsssssqqsqsqsssqsqqqqssqqqqssssqqqqqsssqqssqqqqsssqsqsqsssqsqqsqqqqssssqsqssqqqsqqqqsqqsssqsqqsqsqssqsssqsqsqsqqsssssssqqsqqsqqqssqsqqqsssqsssqqqqsssqqssqqqssqsqssssqqqssqqssqsssqqqssssqsqssqssqqssqsqsqqqqssqssqqqsqqqsssqssqssqqsqqqqsqsssqqsqqqsssqqsssqsssqsqqqqssssqqqssqqsssqsqqqsqqqsqsqqsqqqqsssqqssqqqqqsqsssqqqqqsqqqqssqqssssqsqsqqsssssqssqssqqsqqsqqssqqssqsssqqsssqsssqqqqqssssqssqqssssqqssqsssssqssqqsqsqsqqqsqsqsqssqqssqqqqsqqsqqsqsqssssqsssqsqqssssqsqqsqsqqqsqqsqsqsqqsqqssssqqssqqssqsqqqsqqsssqsssqsqqsqqqqsqsqqssqqqqsqsssqqsqssqsqqssqqssssqqsssqssqsqssqqssqqqqsssqqqqsqssqsssssssssqqsssssqqqsssqsqqqqqqsqqsqqssqqqqqsqsssqssqqqsqqsqsqqqsqqqqsqqsqqqsqsssqqqqqqqssqqqqsqssqqsqqqsqssssqssqsqsqqsqssqsqsqqqsqqqssqssqssqqqsqqsssqssqqssssssqqqsqsqssqssssqqsqsssssssqssqssqqssqsqqqsqqqqqssqqqqssqsqsssqqqssqqqsssssqqqqqqqssqqsqsqsqsqqqqqqsqssqsqqsqqssqqsssqsqssqssqsqqssqssqsqssssqsssqqsqsqqqqqqssssqsqssssqsqsssqssqqsqqsssqsqqsqqssqqqqqssssqsqsqqsqsqssssssqqqsqsqqqssqsqqqqssqqqqsqssqqsqsqqqqqqqqqssssqqqssssssssqssqqsqssqsssqqsqqqqsqqsqsqqqqqsssqsssssqsqqqssssqsqqqsqqsqsqqsqqqqsqqqssqqssqqsqqssqqsqsqsqsssqqsssqsqsqsssqsssqsqsqsqsqqqsssqsqqqqssssqqsqqqqsqsqsssssssqsssqqqsqqsqssqqssssqssqsqsssqqqqqqqqqqssqsqsqqqqsqqqsqsqqqqqssqqqqqsssqssqsssqqqqssqsssqssqqsqsqqssssssssqqsqsqqqqsqqsqsqssqqsqssqqssssqqqqsqssqqsqsqqqqqqqsssqssqqsqqqqqqsssssqsqsssqqqsqqssqssqsssqqqsqqsssqssssqsqqsssqssqqsqsssssssqsqsqsqqqqssqqssssqssqqqqssssqsqqsqqqqsqssqqqsssqqqssqsssqqqsssqssqqqqqsqqsssqqssqqsqqssqsqqqsqqsqsqqsqqssqqqqssssqssqsqsqssqssqsqsqsqsqqqsqqssqqqqsqqqsqsqqsqqqqsqqqqssssqsssqssqsssqqqsqqqqsssqssqqssssqsqsqqqqssssqssqsssqssssssqqsqsqqqqssqssssqsssqsqssssqsqqqqssqqqsqssssqqsqssssssqssqssqqqqssqsqqqssqqsssqqqssqqqsqqssqqsqqssqqssqqqsssqqqssqqqqssqqqqqssqsqqsqqsssssqsqqsqssqqsssssqsqqsqssqqsqqsqssssssqqqqsqqqqqqqqsssqsssqsssssqqsqsqqssssqsqqqqssqqqqsqsssssqqsssssssssssqqqsssssqssqsssqssqqssqqqqqssqsqqsqqssqqsqqssqqsqqsssqsqsqsssqssqqsqssqsqssssssqsqqsqqssssqqsqsqssqsqqqsqssssqqqsssssssssqsqssssssqqqqsqsqssqssqsqsqqqssqqssssssqqqsqqsqssssqqsqqqsssqsqssqqsqsqsqsqqqsqsssssqqqsssqqsqqsqsqqssssqqqqqsssqssqsssqssssqqqssqssqqqqssqsssssqssqsqqssssqqqqsqssqsssssqsqqqqsqsqsssssssqqssqqqsssqqqssqssssssqsqqqqqsqsssssqqqsqssqsqqsqqqsssqqqsqssssqsqsqqsqqqqqsqqqqqqqqqqqsqqqqqsqqqsssqqqqssqsqssqqqqqqqqqqqqqsqssqqsssqssqsqssqsssqqsqqqsqqqsqssqqssqssqsqqqqqqsssqqqqsssqssqqqsqqqsqqsqssqqqqsqqqssqssssqqqqqsqssssqssqqsqsssqqssqqsqqsssqqsqsssqsqqsqsqsqsqssqssssqssqssqsssqssqqqsqqqqqssqsqqsqqqsqqqqsqsqsssqqsqqssssqqqsssqssqqqssssssqsqssqsqqqqqsssqqssqqsqqqqqqqqsssssqsqqsqqsqqqqqssssqqsqqqsssssqsqsqqqsqqsqsqqqsqqssqqsqqsqqqsssqsqqsqqsqqsqqqsqqqsqsqssssqqssssqsqsqsqqqsqsssssssqqssqqqqqsqsqqqqqssqsqsqqqsssqsqqqsssssqqqssqssqsqsqqssqsqqsqqsqqssqsqqqqqsqqqsqsssqqqsqsqsqqssssssssqqsssqsqssqqssssqsqsqsqsqsssssqsqqsqssqqssqsqsqsssqqqqsqqssqqssqqqssqssqssqsqqsssssqsssqssqqqsqqqqsqsqsqqsqqqsssqssqqqssssqqsqsssssqsqsqqsqqsqqqssssqsqssqqssqqqqqqssqsssssqssqssqqsqsqsqsqsssqqsqsqsqsssqssqsqsqqqqssqqqqqsqqssqqsqsqqssqsssssssqsqqsqqsssqqqqqqsqsqqssqsssqssqssqqssqsqsqqqsqsqqqsqqqsqqqsqsqsqsqsssqqsqssqqsqqsssqqsssqssqqsqqqssqsqqqsqqqqsqqqqqssssqssqqqsssqssqsqsssqsqssqsqqqssssqqssqqqsqqssqqssqqqqqsqqqqssqssqssqqqssqqssssqsssqqsqqqqsqqqqqsqqqqsqsqsssqqsssqsqqqsssqqqsqqqqqssqsqqssqsssqqsqqssssssqqsqsssqqqqssqssqqqsssqssssqsqqsqqqqsqqqqsssssssqsqsqsssqsqsqssqsqsqssssqqsqsqqqqssqqqssqqsqssqssqsssqqsqsqqssqsqqsssqsssqqqsqsqqsqssqsqqsqqsqqsqssqqqqqsqsqqsqssqqqssqssqqssqssqsqsqsqqssqqqsssssqqsqsssqsqqqssqqqssssqqssqsqqqqqsqsqsqsqssqqqqqsqsqsqqqqqqqqqssqssqsqqsssqsqsqssssssqqssqqqsssqqqssssqsssqqsssqqssqssqqqqqqqqqsqssqqssssssqqqqsqqqsqqqqsqqqqsqsqssssqsssqqssqqqssqqssqsqqsqsqqssqsssqqsssssqqsqqqqsqqssssqsqsqsqqqsqqsqqsqsqsssqssssqssqssssqqssqsssqsqsqsqsssqsqsqsqqqqsssqsqsqssssqqqqqqqqqqqqsqqsqsqqqqsssqsqsqqqqqqssssqsqsqqsqqqssqqqsqqqsqqqqqqqqqqsqssqssqsssqqqqsqssqsqqssqqqsqsqqqsqqsssqssqsqsqsssqsqqsqsqssqqssssqqsqqqssqsssqssqssssqqsqsqqqsssqqssssqsssqsssqqqsqqqqsqqsssssqsqqqssqqsqsqsqssqqsqqsqqsqqsssqqqssqsqsssqqsqqssqsqssqsssqqqssqsqqqsssqqsssqqssqssqqsqsqqssqsqqqqqssqssqsqsqsqsqsssssqqqqsqqsqqqqsqqqqsqqqqsqssqqqssqqsqqssssqqsqsssqqqsqsqqqsssqsssqqsssqsssqqqssqssssqssqqssssqsqqqsqssqsqsqqqqqsqsqssqssssqqqssqsqqqqqsqsqsqssqqqqqqqqqssssssqsqsqsqqsqssqqssqsqqsqqqsqsqqsqssqqsqqsqqssqqqssqqqssqsqqsssqssqqqqsqqssqqqqqsqsqsqsqqqqqqsssssqqqqsqqqsqssqqsssqsqsqsqqsqqqqsqqsqqqsqsssqsssqssqsssqsssssssqqssqqqqsqssqsqsqsqssqqsqsqsqqqqsqsssssqqsqsqsqqqsssqssqqsqssssssqqqsqsssqqqqqqssqqqqsqsqssqsqsqssqssqsssqqsqssssqsqqsqqqssqqqssqsqsqssqqqssqssqqqqqssqsqsqssqqqqqsqssssqssqsqqqsssqqsqqsssqqqsqsssssqsqqqsqqqqqssqqsqqssqsqsqssqsqqqssssssssqqsqsqqsssqsqqssqsqqqsssssqsqsqqqsssssqqqqqqqsssqsssqqssqqssqqqqqqqsssqqsssqqssqqqqsqssqsqqsqsssqssqsssqsqssqqsqqqssqqsqqsqsqqqqqqqqsqsssqsqqqqsssqqqssqsqsqqssqqqqssqssssqqqqssqqsqqqqqqqqsssqsssqqqqqqsqqsqqsssqssqqsqssqsqsqssqqqqqqsqqsssqsqssqqqqqqqqsqssqssqqssqssqsqqsqqqqssqsqsqqqsqqssqqssqqssqqsqssqsqqsqssqsqssssqqsqqsqqqqsqsssssqqqqqssssssqssqqsqssqsssqqqsqqssssqsqqsqssssqsqqqqqssqsssssqqsssssqsqsqqsssqsssqsqqsssqssqsssqssssqqqqqsqsqqsssssssqsqsqqsqsqqqsssqsqqsqqsqqqssqsssssssqsssqqqqqssssssqqsssssqqssssqsqqqsqsqsqqqsqsqqsqsqsssqqqqssssqqsqqsqqsqsqsqqqssssqqsqsqqqqsqsqqsqqqsssqsqsqsqqqssssqqqsqqsqsqqqqqqsqsqqqqqssssqsssqqqssqqqsqssqqqsqsqqqsqqsqsqqqssqqsqqsssssssssqssssssqqqqssssqsssssqsqssqqqqqqssqssqsqqqsqsssssssssssqqsqsqqsqssqsqqqqsqsssqqqsssqsqqqsssqsqqsqsssqssssqqqqqqsqsqsssqsssqsqsqqssqqqssqsqqssqqsssqqsqsqqqqsqqqqssqsqsqqsqqqqsssqqsssqqsqsssssqsqssqsqqqssqqssssssqqsqqsqsqsqqqssqssqqqqssssqqsssqqsqsqqssssqqsqqqqssssqssqsssqqqssqqsqqsqqqssqsssssqqsssqqsqsqssssqqqqqqsqqsqsssqsqssssqqqqqqsqsqssqqsssqqqsqqqsqqsqsssqssqsqssqsqqqqssssssssqsqssssssqqsqqsqssqsqqssssqsssssqssqssqsqqqsssssqsqqssqsqsqsqqsqqqssqsqsssqqqsqsqsqqqsqsqsqsqsssqqsqqqqqqqqqqqqsqssqqqsqsqsqqsssssssqqqsssqqqqsssqqssssqqssqsqqsqqqqqsqsqqqsqqqsssqsssqssqqssqqssqqsqqssssssqsqqqqqqssssqssqsqqsqsssqqqqqqsqssssqsssqssssqsqsssqqqqqqsssqssqsssqqsqqqsqqqsqssssqqqqqqsqqssqqsssssssssqsqsqqsqqqqqssqssqsssqsqsqqssqqqqqqsqqsssssqsqssqqssssqqqqsssqsqqsqqssqssqssqsssqqsqsssssqqsqsqsqqqsssqqqsqqsqsssqsqqsqqsqqssqqqssqssqsqqqqssqssqsssqqqqqqssqqqsqqqqqsqsqsqqqqssqsqqqqssqsssssqqqqqqqsqqqqsqssqssssqsqqssqssssqqqssqqqsqqqqssssssqqsssssqsqqsssqssssqqssqssqqqsqsqsqqsqsqqqqsqsqssssqqsqqqqqqqqqqssssqsqsqsqsqsqsqsqssqsqqqssqqqqqsqqqqsqqqqqsqsqqsqqsqqssssqsssqqsqsqsssqqqsqqqqqqqsqsqqsqsqsqsqssqqsssqqsqqsssssssqsqqssqqsqqqqsqsssqqsqqqsqqqqssqssqsqssqqssqsssqqsssqqsqssqqsqqsqqssqsssqsqqqqqqqqqqsqqssqsqqqqqsqsqqssqsqsssqsqsqssssqssssqsqsqsqsqqssqssqsqssqqsqsqsqssssqqsqsqsqqqsssqqqsqqqsqsssqqqsqqssssqqqsqssqssssqqqqssssqsqsqsssqqsssqqqsssqsssqsqqssqsqqssssqqssqqsqsssqssqsqqsqsqsqssqsqsqqssqsqssqsssqsqsqqsqqqssqsqqqqsqqsqqssssssqqssqsqssqqsqsqqqsqqsqqqsqqqqssssqsqsqqqqsqqqqsqsssssssqqsssqsqssqssqqsqqsssqssqqqssssqsssqssqssqsqsqqsssssqssqssqqqsqsqsqsqqqssssqqssqsqqqsqsssqqsssssqsssqqsqsqqsqsqssqqsssqssssssqsqssqqqsqsqssqsssqqsqsqssqsqsqqqqqqssssqqqqqsqqqqsqqqqsqqqssssqssqqqqssqssqsqsqqqqsqqssqsqqsqsqqqssssqqsqqsqqsssssqssqqqsssqqqqqsssqqqssqssqqsqqqqqsqsqssssssqsssqqsqqsssqqssqssqqsqqqsssqssssqqssssqsqssqsssqqsssssqsqqssqqsqqqssssqsqsqsqsqqqssqsssqqsqssqqqqqsqqsqqqssqqqsqqqqqqqqqsssqqqqsssqsssssssssqqsqssssqsssqqqqqsqqqqsqsqsqssqqssqssssssqssqqsqsssqssqsqssqqqsqqqqqqsssqsqssqsssqssqsssqqqqsqqqqqqsqsssqqqqssqssqqsqqqsssqssqssqssqqsssssqqqssqqqqsqsssqssqqsqsqqsqsqqssqsqsqssqsqsqqqsqsqqqssqqsqqssqssqsqssqqsqssqsqqsssqqqqqsqsqsqqsqssqssqqqsssssssqssqsqqqsqsqssqqqqsssqqqqqsssssssqsqsqsssqqssssqsssqsssqsqqssqssqsqsqsssqsqqqqqqqqqqqqsqqsqqqqqqsqsssqssqsqsssqsqsssqsqqsqsqqsqsqsssssqqsqsqssqssqssqssqqqqqsssqsssqqqqssqsqqqsqssqqqssqqssqqsqqsssqsqqssqqqqqssssqsqsqqqsqqqqqsqsssqsssqssqsqsqsqssqsqssssqsqssssqqsqsssssqqsqsqsqqqqqqsqqqsqssqqqqssqqqqqsqsqqsqqsqsssqqsqsqsqssqssqqqssqqsqssqssqsqsqqssssqqqqqssssqqssqsqsqqsqssssqqqsqsqqqssssssqsqqqsqsssqsssssqsqsssssqqqqsqsqssqsssqqqqssqqsqsqqsqqssqqqqssqsssqsqqqqqsqsqqqqqqqqssqssqsssssqqsqqssqqqqqssqsssqssqqsqssqqsqssssqqssqsqssqqqsssqqsssssqqssqqsssssqsqqssssssqsssqsqsqsqssqqsqqsqssqqqqqqqssqqsqsqqsqqqssqqsqqssqsqqsqqqqssssqqqqqqqssqsqqqqsqqsqqsqssqqqssqqqqqqqqssqqssqqssqsqqqsqsssssqsssssssqqsqsssqqqssqssqsqqsqqsqqsqssqsqsqsqqsssqqqsqqsqqssqssssqssqqqqqqssqsqqqqqqssssqqssqsqsqqqsssssssssqqqqsqqqqssqqsqssqqsqqqsqsqqsqssssqqqqssssqssqqqqqqqqqqssqsssqqsqsssqsssqqqqsqsqqqqsqqssqsqqqqqsqqssssqssqqssqqsssssqqsqsqssqqsqqssqsqsqssssqsqqqssqssqsqsqqsqqqsqqssssqsqssqqsqsqqqsssqqssqqsqsqsqsqsqssqqsssqsqsssssqsssssqssqsqsqqqqssssqssssqssqqqssqsqqsssqqssqqqqsqsqqsqqqqqqqqqqsssqqsqssqqsqsqsqssqsqsssqsqsssssqsqssqqssqqqqssqqsqqqqqsqqqqqqqsssssqsqsqssqqsqqsssqqsssqsssqsqqqssqqqsqqqqqqqssssqssqssqssqsqsssqssqqqqsssqqsssssqsssqsqsqqssqqsqssqsqqsqsqssqqssqsqqsqsssqsqqsqssqqssqssqssqsqsqqqsqqqssssqssssqqssssqsqsqssqqqsqqqssqqqqsqsssqqssqqssssqssqsssqssssqsssqqsqsssssqsqqqsssqssssqssqqssssqqqqsssqqqqqsqssqqqqssssssqsqqqqssqqsqqssqsqqsqssssssqssqqsqqqssssssqssqqsqqqqsqqqqssssssqsqqsqqsqssqsqqqqqqsqqssqqqssssssssqsssssssssssqqqqsssqqssqqsssqqqqqsqsssssqqsqssqqsssssqsssssqqqqqqqssqqssqqssqqqqqsqsqssqqqqsqsssqqqssqqsqqsqqssqqsqqqqqqsqqqqsqsqqqsqqssqsssqqsqsqqsssqsqsqsssqqssssssssqsqqqqssqsssqqsqsqqsqsssssqsssqqsqqssqsqsqsqqsqsqqqsqqqssqqssqqsssqsssssssqqssqqqsqsqssqsqsqsssqsssqqqsssssqsqssssqsssqssqsqssqsqqsssqsqqssqqssqssqqqsqsqsssqqqsqqqqsqsqsqqqsssssqsssqqqsssqsqssssssqqqqsssqsqssqqsqqsqqssqqqqqssqsqssqsssqqqqsqqqssqqqqqssssssssqqsqsqssssqsssqsqsssssqqsssssqqqqqqsqsqsssssqsqqqssqsqqsssssqqqqqqqssssqsssqqssqsssqqsqqsqqssqqqqssssqssqssqsqssqssssqqqssqsssssssqqqqqqssqsqsssssqssqqsqqqqqssssqsqsqqsqsqqqqssqqssqqsqqsqssqqqssqsqsqssssqsssqqqqqqqssqsqqqqssqsssssssssqssssqqssqqqsqqqqssqsqqqqsqssssqqqqqsqsqssssqsqsqsssqssqsqsqsssqsqsssqqqsqsqqqqsqsssqqsqsqqqsqssssssqqqsssqsssqqssssqsssqsqssqqqssqqqsqqsqsqssqqsssssqqsqqsqqqsqsqsqsqqqqsqssqsqqqqssqsqqqssssqssssqqssssqqqqssqsssqqsqssssqqsssssqsqqssqsqssqqqsqqssqsssqqssqsssqqssqqqsssqqssqqsssqqsqssqqsssqssqqqqsssqqqsssqqssqqsqqqqqssssqqsqsqsssssqqssqqqssqqssqqsqssqsqqqqsqqqqssqqqqsssssssssssqqqsqqqqqqqsqqssqqssqsssssqqsqsssssqqqqssqqqqqsqqqsqsqssqqqqsqqssqqssqssqqqsqsqsqsqqsqqssssqsssqqqqqssqqqsqsssqqsssqssqsqqqqsqsqqsqsqsqsssqqssssssssqqsqsssqsqqqqssqsqqsqsqsqsqsqqqqqqqsssqsqqqssqqssssqqsqqssqssqqqqsssssqqqqqsssqqqsqqssqssqssqsqsqqqqssqsqqsqsssqqqssssssqsqssqsqqssqsssqsssqsqqsqqsqqsqsqqqqqqsqqqqsqqsqssqqssqsqqqqsssqqsssssqsqssqssqsqsssqqssssqqsqqqsqsqqsssqqsqqqqqsqsssssqqsqqqqqsssqsqsssssqsssqqqqqsssqqsqsqsqssqqssqsqsssssssssssqqssssqsssssqssqssqqqssqssssssqsqqqqsqssqsqsqqssqsqsqsssqqsqsssssssssqqqssqqsqqssssssssqqqsssqqqssqssssqsqsqsqssqqssssqsqqqssqqsqsqsssqqqqqqsqqqsssqqqsqsqssqssqsqssqsqsssqsqqsqqqqssqsssqqssqqsqqsqqqqsqqssqqssssqqsqqqqssssqqsqqsqqqqqssqssqsqqsssqsqqqqsqqssqqsqsqsqsssqqqqsqqsqsssssqqssqsssqsqqqqsssssqqsssssqqqqqssqsqssqsqqqqqqqqqqssssqsqssssqqsqsssqssqsqqsqssqsssssqsssqsssqsqsqqsqqsqqqqqqqqqsssssssqqqqqssqqqsssssssssssssqqsssqsssqsqsqsssqqsqsqssqqsqqsqsssssqsqqqqssqssqssqsqsssqqsqssqqqqssqsssqssssqqssqqsqqqqqqqsqqqqsqqsssqqqsqsssqqqqqssqsqqqqssqqsqsqqsssqsqssqqssqssqqqqqqqsqssqssqqqqqqsqssqssqsqsssqssssqssqsssqqsqssssqqqqqssqsssssssssqssqsqqsssqqqqsqsqqqsqqsssssqsqsqqqqqsqqsqqssqqssqsqssqsssssqsqqqqqsqqsqssqqssqqsssssqsssqsqqsqqsqqsqqqqqqqsqsssqsqqqsssssqqsqssqssssqqqqsqqssqsqqsqsssssqsssqqqsssssssqqqsqsqqqsssqqqqsqsqqsqssqqssqqssqsssqqsqssqqssqsqqsqssqqqqsqsqsqqqsqqqsqsqqqqssqqsssssqsqqssqqqssqssqsssqqqssqsqsqssqqsqqssssqqqqqsqsqqsqqqsqqsqsqssssqsqssqqssqqqsssqqqqsqsssqqqssqsssssssqssqqsqsqqqqsssqqsqqqssqqqqsqqqqsqqqqsssssqqssqqqsqqsqsssqqsssqqqqssqqsqsssqqqsqssqqqqqqqsqqsqssqssssssqqqsssqssqqqqqqqsqqssqqsqsqqsqsqqsqsqqqqqqqqqssqssqssqqsqqsqssqqqqqssssqssssqsqqsssqqqqqssqqqqqsqsqsqssqqsqsqqqqssqssqqqqqsssqqqqqqqqsssqsqsssqssqsssqsqsqqsssssqsqsqsqsssssssqqqqqqqqqsqqsqsqsqqqqsssqqqqssqqqsssqqqqssqsssqqsssqqqqqssqssssssqqqqqqqqqqqqssssqsssqqsssssqssssssqsqqsqqqqsqqssssqqsqssqssqsqqsqsssqqsqqqqsqssqssqsqqsqqsqsqsqqsssqqqsqsqqqqsqssssqqsqqqssqqssqsssqqqqqsqsqssqqsssqsssqssqqqqqsqqqqqqqssqssssssssqsqqqqsssssqqqqqqssssqqsqqssqqqssqssqqqsssssssqsssqsqsqssqsqqsqqsqqssqssqsqqqqsqqssssqsqsqsssqqqqssqsqsqsqsqsssqqsqqqqssqqqqsqsqssqqsqqssqqsqqqsssqqsssssqsssssqsssqqsqqqssqssssqqqsqqqqqsqsqsqqqqssqsqsqqqsqsssssqqsqqssssqqssqqqqsssssqqsqsqqqqsqsssqqqssssqqqssqqqssqssqssssqqqsqqsssssssqqsqqqqsqsqsssqqqsqsqqssssssqssqqsqsqqssssssqssssqsqqssqsqqsqssqsqsssssqqssqsqqsqqqqqqqsqqqqssqqsqqsqsssssqqqqqqsqsssqqsqsqsssssssqsqssqqqqqqqsqsqqsqssqqqsssqssqqssssssqqqsqqsqsqqssqqsqqssqqsqqsqsssssqqsssqqsqqsqqsqsqsssqqqssqqsssssqqsqqsssqqsqqqsqqsqqqsssqqssssssqqqqqqsssqssqqsqqssqqsqqsqsqssqsqqsqqsqqssqqqqssqqssqqqqsqsqsqqqqqssqqsqsqqqqsqqsqsqsqsqsqqqssssqqqqqqssqsssssqqsssqqqsssqqssqqsssqssqqsqqqsqqsqsqqsqssssqssqsqsssqqsqqsqqqssqqqqqqqssqqqqsqqssqqqsqsqqqsssqqqsqqsqsssqssssqqqqsssssqsqqsqqqqsssssqqqqsqssqqqsqqssqqqqqqqqssqsssqsqqsqqqsqssqsqqqqsqssqqqsqqqsqssqqqssqqqsqsqqssqsssqqqqqsqqqssqqqqsqqsqssssqqqsqsqsqsqqsqqssssqssqssssqqqsqqqsssqqssqsqssssqqssqqsqqqsqsqqqsssqsqqqsssqsssssssssqsqssqqsqssssqqqssqsqssssqqqssssssqsqqqsssssqsssqsssqqsssqqqqqqqssssssqssqsqsqqsqqqqqqqssqsqqssssssqsqsssqqqssqqssssqsssqsqssqqsqsqsqqqqsqqsqsssqsqsssssqsqqqssqqsssssssssqsqssqqqssssqqqqsqqssqssssqqqqqsssqqsssqqqqqsqsssqsqqqqqqsssqssqsqqqqssqsssssqsssqqssqqqsqqqqsqqqqqsqsqssqsqsqqqqqssqqsqqqsqqssqqqqsqsssssqsqqssqsqqqqsqssqqqsqsqsqsqssqssqsssqqsqqqqqsqqqqqsssqssqqqsqssqqqqqssqsqqsqqqsqsqsqqssqsqssssqsssqqqsqsssqsqqqsqsssqqsqqqqsqqqssqsssssqssqssqqqqqqqsqqqsqsqsqqqqsqsqqsqqqssqsssssqsssqsqqqqqqsqsqsqqssqqsqqqssqsqsssqssqqqssssqssqsssqsqsqqssssqqqqqqsssqqqqsqsqqssqsqssqssssqqsqqsqssqqqsqqqssqqqqqssqsqsqssqsssssssqqqsqsssqqqssssqqssqssqsqsqqsqqsqsssqsqssssqsssqqssqssqsqqsqsqqsqqsqqssqqqsqqqsssqssssssqqsqqqsqssssqqqqsqqsqqqqsqqqsqqqsqqqqsqssqqssqsqqqssqsqqsqsqsssqqsqsssssqsqqsqqsqssqsqssqssqsssqqsqsqqqsqqssqqssqqqssqsqqsssqqsqqsqqqsqqqsqqsqsqqqqssssssqqqqssqssqsssqsssqsssqsqqqssqqqqsssqssqqsqssqsqsqsqqqsssqsssssqqsqqsqqqssqqsqqsssssqsqqsqsssqqqsqqqsqsqssqqqqqsqqsqqqsqsssqsssssqsqqqqsqssqqsqqqssqsqqqqssqsqsqsqsqssssqqssssqssqsssqssqssqqsqqqssqqsqsqqssqqssssssqsqssqqqqssqqsqssqssssqqsssqsqsssqqqqqssqqsqsqqsqqqssqqsssqqqqsqsqssqsqqqqqsqsqssqsssqsssqsqssqqqqsssqsqqqqsqssqqssssssqqqsqqqsqsqsqsqsqssqqsqqqqqsssqsqsqqqssqsqsqqqsssqsqssqqssssqqsqqssqqsqsqssqqssssqsqssqqqqqsqsqqsssqqqssqsqqssssssqqqqsqqqqqqsqqssqsqsqqqssssssqqsqqsqssssssqqqssssssqssqsssqsqsqqsqqsqsssqqqqsssqqsqsssssqqsssqsssssqsqssqsqssqssqssqqqsqqqsqssqssssqssqsssqqqsqqqsqssqssqqqqsssqqsssqsqsssqqqqssqqqqsqssssqqqsqsqqssqqssqsssqsqsqssqqsssssqssqsqqqssqsqssssssqssqsqsqsqqssssqsqssssqsssssqssssssqsqqsqsssqsqsssqqqsqsssqsssqqqssqqssqssqsqqsssssqsssqqsqsqsqsqsqqssqqsqqqsssqsqqqsqqsssqsssqsssqsqsssqqssssqsqsqqsqqsqssqssqqqsqqqsqqqssqsqqsqsssqssqqssqssqssssssssqqqssqqqqsqqssqssssqqsqqqqssqssssqqqqqqqqqqsssqsqssqssqqsssqqssqsqsqsqsqqqsqsssqsssqsqqqqqqsqqssqqqsqssqssqqsssqsqqsqsqsssssqqqqsqsqqqqqssqqsssssqsqqqqsqsqqqsqssqqqsqsqqssssqqqsqqsqsqqqqqqsqqqsssssqsssqqssqqqsssqssqssssqqqsssqqssqqqqqqqqqqsqqsqqsqssssssssqssssqsqsqssqqsqssqsssssqsqssqqqqqqsqqsqqqqsqssqsqqsqqsssqqqqqsssqqqqsssqsqssqqqqsqsqqqsqqsqsqqsqqsqqqsssqsssqqqqssqsssssqqssqqqsqqqqqsqqqssssqqsssqsqqssqqqqqqqqqqsqsssqqsssqssqsqqqqsssqsqqssqsqsssssssqqssqqsqssssssssqqsqssqqqssqssqsqqssssqsqssssqssqqsqsqqsqsssqqqsssqssqsqsqqqqsqsqsssqqqssqsqqqqssqqsqqssqsssssqsssqqqqqqsqssqqsqsqqqssqqsssssqssssqsssqssssqqqssqssqsqqqssqqsqqqqssqqssqsqssqqqsqsssqqqqsqqqsqqqssqsqqsssqqqsqssssqqsssqssqqssssssqqsssqssqqqqsqqqqqqssqsqsqqsqqqsssssqssssqsqqsqqqsssssqqsqqqqqssqqsqqqssqqqsqqsqsqqssqssqqqsssqqsqqssqqsqsssqssqqqssssqssqsssqsqqqqqqsqsssqssssqssqsqqssqqsqqssqqqssqqqsqqsssqssqsqssqqqssqqsqssqqqsssssqsssqsqqqqsssqsqqsqqsqqsqsqssqssqsqqssssssqqqqqqssqsqqqqqqssqsqqsqqssqsqqssqqqssqqsssssqsssssqqsqqqsqqsqsqqqsssqqqqqsssqqqssssqqsqsqqqqqqsssqqsqqsssqqsssqqssssssssqqssqsqqsqssqqqqsqqqsqsqssqssqsqsssqqqssqsqsqqsqqsqqssqsqsssqsqsqsqsssqsssqqssqsqqssqqqqqqsqsqssqqqsqssqssqssqsqqqsqqssqsqqqsssqssqqsqqqqqqqqsqqssqqsqssqqqsqsqsqsssqsqqqqqqsqsssqsssqssqsssqssqqqqsqssssqsssqssqqsqsqqsssqsqqqssqsqqqssqqqsqsqsssqsqqqssqqqsqsssqqqsqssqqsssqsssssqsssqsssqssssqsqqqqqqqsqqsqssqqqsqsqsqqqqqsssssssqqqqqqqqssqsqssqsqqqqqqssssssqqsqqqsqqqsqsqsqsqsssssqqsssqsqqsqqqqsssqqqssqssqssqsssqssqqqssssssqqssssqqqqqqssqqsqssqqqsqqsssqsqsqqqsqssqqqqqsqqqqqqsqsqqqssqqsqqsqqqsqsssqqsqsqsqqsqqssqqsqqqqqssqqqssssqqssqssqssssqqqqqqssqqssssqsqqqsqqsqsssssqsqqssqqsqqssqqqsqqqqqqssqqqqsqqqssssqqqqqqqqqqqsqsqqsqsssqqqsqsssqsqqqsqssssqqssqqsqqqssqsssssssqssqsssssqqqqsssqssqqssqssqqsqqsssqsqqqsssqsqssssqsssqqqqqqqsqssqqqqssssqqqqsqqssssqsqssssssssqqsqsqqqsqqsqsssqssssssqssqssqqssssqqssqqqsqqsssqqsqqqqqssqqqsqqsssssqqsssqsssqqsqsssqqsqqsqsqsssssssqsqqqqsqsqqsssssqssssqqssqssqsqsssqsqsqsssqqqsqsqqqqqqqqqqqssqsqsqsqsqsqqqssqsqqqqsssssssssqqsssqsssqsqqqqsqsqqsssssssqssqsssqqssssqsqsqqsqsqqqqqsqsqssqqsqqsssssqqqqqqqsssqqssqssssssqqqqqsssqsqqqsqqsqsssssqqsqqssssqsqqqsssssssssqqqsqsqqsqqsqqsqqsqqsqqssssqsqqsqqqqsqqqqsqsqsqqqsqqssqsqssqqqsqqsssqsqssqsqqqsqssqsssqssqsqqssqsqqqqssqsqqqqqqsqqsqsqqsqqsssqsqqqsqqssqqssqssqsqqqqsqqssqssqqqsssqqsqssssqqqssqqqqsqqsssssqqssqqssqqsssqqqqssssqsqssssqqssssssqsqqqqqsqssssqqssqssqsssqsqqqqqsqqsssqsqsqsqqqqqqsqqssqqsssqsqssqsssqqssssqqsqqqqssssqsqqqssqsssssqqsqqqsqssqqqqqsqqqsssqqqqssqqsqqqqssssqqssqqssssqsqqssqqqqqsssqqqqsssssssqssqsqqqsqssssqsqssqsqssqsqsqsqssqqqqssqqsqqssssqsqsssssqqqsqssssssqssqqqssqqqssqqqsqsqsqqqsqqqsqqqqqsqsssqqqsqqqssqsqsqsssqqqqsqqqsqqsqqqsssssqssqssssqqqssqqssqqqsqqqsqqqsqqsqsqqsqsqssqqqqsqqsqqqqqqqsqqqqqqqsqqqqqssqsssqssqsqqsqssqqqsqsqqqqqqqsqqsqsqsqqqqqsssqssqqqsqssqsqqqqqqsqqqqssqsssqqqqqsqsssssssqsqssqssqqsqssqqsssssqssqsqqqqqsqqqsssssqqssssssqqqqsqqssqqqsqsqqsqsqqsssssqsqsssssqssssqssqqqqssqqssssssqsqsqsqqqqqqqqssssqqqqsqsssqqssqqsqsssqsssqssssqqqqsqqqsqssqsqsqqqqsqsqqqqqqqqqqssqqsqqssssqqssqsqqqsssssqsqqqqqssqsqqqqsssssqqsqqssqssqqqqsqsqqqqqqsqqqqsqqssqssssqsssqqqssqqsqqqssqqsqssqqqsssqssqqqqssqqsqqsssqsqqqqsssqqqsqsqqqssqqqssqqssqqqsqsqqssqsqqqsqsqsqssssqsqqqssssqsssqsqqqqqqssssqsssqqssqsqqssqqsssqqqssqqqsssssqqqqsqssqqqqqsqqqsqsssqssqqqsssssqqqssqssqsqqsqqssssqqsqsqqsssqqqqssqqqqqqqqsssqqsqqqqqsqqsqsqqqsqsqqqqqqqsqqsqqsssqqqqqqqsqsqsqqqsqsqqssqqqqsqsqssssqqsqqssssqqqqssqsqsqssssqsssqsqqqqssqqqsqqqqqqsqqqssqqssqqssqqqssqsqsqqqqsqqqssssqqqssqsqqqqsqssssqssssqsqqqssqqsqsqqqsqssqsqsqqsqsqssssssqsqsqqqsqqqqsqsssqqsqqqssqsssqsqsqsqssssssqqqsqsqssssqqqsssqqqqqssqsqsqsssqqsqqsqqqqsssqsqsqqsqqsqqqqsssqqqqqsqqsssqssqqqqsqsqsssqsssssssqsssqsssqqssqqqqsssqqqqsqqssssqsqqqqsqssqqqsssqssqssqqqsqqqssqsqssssqssqsqqssssqsqqsssqsqssqsqsqsssqsqqqqqssqsqqqqqsqqqssssqssqqqqqqsqqssqqsqqssqqqqsssqqsqqqsqqsqqsssqqqqsqqqqqsqsssqsqssqqqssqsqqssqsqsqqqssqssqssqqqsqqqqqqqqqssssqssqqsqsqsqsqsssqsqqssssqqqsssqqsqsssqqqqqqqqqsqqsqqssqsqsqqqqqssssssssssqqssqssqqsqsqsqqqssssqqqsqqqsqsssqqssqssqqqqsqqqqssssqssqqssqqqssqssqssqqqssqqqqsssqqqssqsqsqqsqsssssqqsssqqqqsqsqqqqqqssqsqqsqqqqqsqsqqssssqqsqqqsqqqssqqqsssssqqsssssssqqssqsssssssqssqssqsssqssssqqsqssqqqsqssqssssqqqsqssqssqsqsssssssqsqqqsqqsqqsqqqsqssqssqqqqssqsqqqsqsssssqssqqqqqssssssssqqqqqqssqqqqqsqsqssssqsqqqssqqssqqsqqqqssqqqsqsqsqqssssssqsssssqssqqqqsqqqsqqsqsqqqqqqsqqssqqsqqqsssqssqssqqssssqqqssqqqssqsssqqqqqsssssqssqqqqssssqsqqsqsqqssssqqsqqqqqqqqqsqqsqsssqssssqssssqssqqsqssqqqqqsssssqqqqssssqqsqqqsqsqqssssqqsqqqqqqsssqssqqsqqsssssssqsqsqqsqqsqsqqssqqqqqsqsssqssqsqqqqsqsqqsssqqqqqqsqssqqqqsssqqqqssqqqqssqqqqssqqsqsqqssssssqssqsqssqssqssqsqsqqqsqqsqqqqqqsqqqssqqssqqqsssqsqqsssqsssssqsqsssqsqqssqsqsqqqsssqssqsqqsqqqqssqqsssqqsqsqqqqqqqqqqqqqsssqssqqqsssqsqsssqqqsqqsqssssqsqsqsqssqqsqsqqsqqssqsssqsqqsssqqsqqqsqqsqsqsqsqsssqssssqqssqqqqqsqsssqqssssssssqqqsqsqqsssqsqqqqqsqqqqsssssssqqqsqqsqsssqsqsqqqqsqssqssqqqssqqqssqsqqqsssqsqssqqsqsqqsqqssqsqssssqqqssqssqqsssssqqsssqssssqqqqqssqqqqsqqssqqqsssqqsssssqqssssqqqsssqssqsqsssssqsqqsqqsqqqqqqsssqsqqqqsssqssssssqqsqssqssqsqssqsqsssssssssqssqqsqqssqsssssqssqqsqsqqqqqqqsqssqsqsqsqsqqqsssqqqsqqqssssqsqsqqsqqsqqqsqssqqqsssssqqqqqqsqsqqqssssqqqqssqqqqssqssssqsssqssqsqqsssssssssqssqqssqqssqqqssqssqsqqssqsqsssqqqqqqqsqqqsssqqqqsqqqqqqqsssssssssqqqqqqqqssssqsqqsssqqsqssqqqqsqqsqsqsqqqssssqqsqssqqsqsqqqqqsssqsqqqqqqssqssssqqqqsqssqqssssqsqssssssqqsqssqssssqsqqssqqqsqqssssqsqqsqqqqsqqqsqssssssqsssssssqqsqsqqssqqqssssqqqqqqssssssqsqqssqqsqqsssqqssqsqqsqsqqqssqsqsssqsqqsqssqssqsqqqsqqqqsssqqssqsqssqqqsqqqsssqqqsqsqqqsqssqqssqssqssqqsqsqsqsqssqqssqqsqq\nfmfffmfmmfmmmfmmfmffmmfmffffmmfmffffffmffmfmffmffmmmfmfffmffmmffmmfmmfmffffmffmmfmmfffmmmffmfmmmmfffmmffffmffmmmmmffmmffmmffmmmffffmmmmfmfmmmmffmmmmmmfmfffffmfmmmmffmmfmmfmmmfmfffffmffmmmfmfmfmffffffmffmmffmmmfmfmmfmmmffmmmmffmffffmmmmfmfffmmfmmmmmffmfffmfmmfffffmfffmmmffffmmffmffffmmmmffmmffmmmmfmffmmfffffmmmffffmmmmmmmfmmfmfffmfmmmmfmfmmfmfmmfmfmfmfmmffffmmffmffmmmmfmfmmmmmfffmfmmmmmmfmmfffmmfffmmfffmfmfmfffmfffmfffffmfmmmfffmfffmmfmfmfmmmffffmfffmffmfffmmmmmfmmfmmmmfffmmffmmfffmfffmfffmffmfmffmfmfmmffffmffmfffffffmfffffffmfffffmmfmmmfmmfmffmfmmfffmfmfffffffmffmfmfmfffffmmmfmmfffmfmmfmffffffmffffmmfmmmfffffmfmmmmmmmfmfmmfmmffmfmmffmmmmmfmmfmfffffmfffmmmmmffmmmmmmffffmffmmfffmfmffmfmffmmmmmfmfmmmmmfmmmmfmmffffmmffmmmmmmfmfmfmffffffffmmmmffffmfmmmffmmffmfmmmfmmmfmmmmffffmfffmfmmfmfmffffmfmffffffffffmmffmffmmmmffmmfmfffmmmmmfmfffffmmfmffffmmmmmffmffmmfmmffffmfmffffffmffffmffmmfmmmmfmmmfffmmffmfffmmffmfmmfffmmmfmmffffmmffmffmmmfmffffmmmfffmfmfffmmfffmmffmmfffmfmffmmfmfffmfmfmfmmmmfmfffmmmmfmmmfmffffffmmmmfmmmffmmfmffmmffmmmfffmmfffmmmmmffffmfmmfffffmfffmfmmmfmmfffmmmmmfffmmfmmfmffmffmmmmffmfmffmmmffffmmffffffffmmmffmfffffmffmfmfffmfmfffffffmffmffmmmfffffffmfmfmfffmfmffmmffffmfmfmmmmffmffmmmmffffmmfmfmfmmmmfmmmfmffffmmfffmffffffmfffmmffmmffmmfffmmfmfmffffmfffmmmmfffmmfmffffmfmmmmfmmmmfmfffmmffmfmfffmfmmfmfmffmfmfmmmmmmfmfmfffmffffmfmmmffmfffmmfmmmfmfmfmfmmmmmmfffmfmfmmmmfffmmmfffffmmfmfmfmmmffmffmffffmmmfmfmffmffmffffmmmfffffmffmmmfmmffffmfmfmmmfmmmmmmmfmmmfmmmffmmffffmmmffffmffmmmmfmffffmfmmfffmmmfmmfmmfffmfffmmfmfmmmmfmmfmffmmmmfmffmmmfmfmmfmfmfmmmfmfffffmmfmfffffmfffmmmmfmmffffffmffmmffmffmmffffmmmffmfffmffmffmmmffffmfffffmfmmmfmfmmfffmmfmffmmfmfmfffmmfmmfmmfffmfffffffffmmmmfmmffmfmfmfmfmmmfmffmmmmfffmmmffmfmmmfffffffffmffmffmmfmfmfffffmmmmmmmmmmffmmfmmffmfmfmfffmmmmfffmfffmfmmmffmmfmmffffmffffmmmmfmmffmmfffmmfmmfmmfffmmffffmmmfffmmfmfmffmfmmmmmffmmmffffmfmffffffmmfmffmfffffmfmffmmmmffmfffmfffmmfffmmmmmffmmmmmmmffmmfmmmmmmmfmmfmmfmmmfmmmmffmfmmfffmfmmfmmmmfffmfmmfmmfmfmmmmmmmfmfffmffmffmfffmfmmfmmffffmmfmfffmfmmmmmfmmfffffmmmmmmmmffffffmmfffffmfmfmmmmfmfffmmffmmffmffffmmfffmfmfmffmmmmmmfmmmmmfmmffffmfffmffmfmffffffmffmmffmfffmmmfmmfmmffmmmmfffmmfffmmfmmmfffffmmmmmfmmffffmmmmfmffmfmffmmmmffmfffffffffmffmfmmmfmmmmfmmmmfmmffmfmmfffffmmmmmffffmmmmffmfffmfmffmmmmffmffffffmmmfmmffmffmmmmmmmfmfmffmffmfmffmmfffffmfmmmfmmfmffffmfmffmmmffffffmfmmffffmmmffffmmffffmmffffmmffmfmffmmmmmmfmmfmfmmfmmfmmfmfmfffmffmffffffmfffmmffmmfffmmmfmffmmmfmmmmmfmfmmmfmffmmfmfmfffmmmfmmfmffmffffmmffmmmffmfmfffffffffffffmmmfmmfffmmmfmfmmmfffmffmfmmmmfmfmfmfmmffmfmffmffmmfmmmfmffmmmffmfffmffmfmfmfmfmmmfmmmmffmmfffffmfmmmffmmmmmmmmfffmfmffmmmfmfffffmffffmmmmmmmfffmffmfmmmfmfmffffmfmmfmmfffmmfffmmfmfffmmmfmfmmffmfmffmffmmfmfmmmmfffmmfmmffmmmmmffmmmfmmmmfffffmmffffmffmmfffmmmffmmmmmffmmmmfffmmmfmmfmfmmmmmfmffmffmffffffmmmfmffffmmmfmmmmmmffmfmmfmmfmfmmfmfmmmmmmmmmfmmffmffmmfmmmmmfmmffmfmfffffffmfmmfmfmfmfmfffmmmfffmfffmmmmfmfmffmffmfffmfmmfffmmmmmffffffmfmfffmmmmffffmmffffmmfmmmmfmmmfmmfmffmmmmmmmmmfmmffmmffmmfffmmfmmfmffmmfmfmmmfffffffmfffmmmffffmfffffffmmmmmmmmmffffffffmmmmfmffmmmffmfmmffffmffmfmfmfffmmmmffmfmmffmfmfffffmmmfmffffffmmfmmmmffffmfmmffmmmmfmfmmmmmmffmfmmfmmmmfmffmmfffmffmmmmfmffmffffmfffmfmmmmmmfmmmmmmmffmfmffmmfffmmmmffffffmmmmmmfmffmmffmffmmmffmmfmffmfmfffmmfmfmmmfmffmfmmfmmfmfffmffffmmmffmmfmfmmfffmfffmmmfffmfmfffmfmmffmmfmmfmmffmfmfmfmfmmffmmffmfffmffffmmfmfffmfffffffffmmffmmmmmffffmfmffmmmffffmfmfmmffmfmffmmmmfffffmmfmffmfffmffmmmmfmfffmmfffffmmfmmffmfmfmffmfmmfffmmffffmffffmmmfffmfffmffmmmmmmmfmmfffmmmmfffmmmffffmmmmmmmmfmmffffffmffffmmmmffmfmmfmfmffmmfmffmmffmfmmffmmmmmmfmmfmfffmfmmfmfffmfmmfmmmfmfffmmfmmmmmfffffmmmfmfmmfmmmffmfmfmfmfmmfffmffmmmmfmmffmmfmmfmffmfmmmffmmfmfmmmfmffmfmmmffmmffmmfmmfmfffffmmmffmmmfffffffmfmfmmffmfmfmmmmmmfffmfffmmfmfffffmfffmffmffmffmmffmmmmfmmfmmmmffmmfmmfmmfmfmmmfmfmmmffffffmfmmfmmmfmfmmmmfmffmfmmffmffmmffmfmmmmmfffmfmfmfmfmmfmmmfffmmffmmffffffmmffmmfmmfmfmmfmfffmmffmfmmffmmmfmfmmmfmmmmmmmmfmmmmmmmmfmmmffmffmmfffmfmmmmfmmffmfffmfmfmffffmmmfmfmmmfffffmffmmffmffmffmmfffmmmfmmmmfmfffmffffmmmmmfffffmmffmmmmfmffmffffmmmmffmmffmmmmffffffmfmfmffmffmmfmmfmmfmffffmfmfmfmfmfmmffmfmfmmffmffmmffmfmmmfffmfffmfmfmffmffffmfmmfffmffmfffmfmmmffmmfmffmfmmfmfmffmmmmffmfmmfmfmffffmfmmfffffffmmmmffffmfmfmfmffmmmfmfmmfmmmffmfffmfmfmfmfmmfmfmmmmfffmfmmffffmfmfmmffmmmffmmmfmfmfffmfmffmmfmffmmmmfmmffmmffmffmfmffffmfmffmmfffffmfffmmmfmfmmfmfffmmffmmffmfffffmmfffffmmffffffmmfmfffmffmmmmffmfmffmfmfmmmfmfffffmfffmmfffmmfmmmmfffmfffmffffmfmmmmmmffffffmfmmfmfmffmmmmmffffmfmmffmfmmmmffmmmmmfmmmffffmffffmffmfffmffmfffmmmffffmffmmmfffffmmmmmfmfmmmmmmfmmmmmmfmmmmmfffmfffmmmmmfffmfmmmmmmffmmffmmmffmffffffmffmffmmfmmmmmmmfmmmffmmmfmmmmmfmmfmmmmfmffmfmmffmmfmffmmmfffmmfmmfmmfmmmfmfffmffmfmmmfffffmfmffmfmfmfmmffffffmfmmmfmmmmmfmfmmffmfmffmfffmmmfmmfmffmmmfmmmfffmmfmfmmfmfmfmmfffffmfmmmffffffmmmfffmmffmfmmfmfffmmmfffffmmmfmffmfffmmfffmfmffmfmffmmmmmfmfmmmffmmmfmfmffmfffmffmmmfmfmffmmfmmmfffmmmmmfmffmmmmmmmfmfffmffmfmmmffmfmmfmffmfmmmfmfffmmmfmmfmmffmfffmffmffffffmmfmfmfmffmffmmffmfmmmmmmmfmmmffffffmmfffmfmffmfmmffmfffmmmmmfffffmffffmfffmmfmmfmmmfmmfmmffmmfmmmmmffmfmmmfmmmfffmffmmffmfmmfmmmffmmfmfffffffmfmmmffffmmfmmffmfmffmmmmmfmffmmfmmfffmffffmmfmmmmfmffmmfmfmmmmffmmmmfmfmfffmmmffmffmffffmffmmffmffmffmmffmmffmffffmmffmmffmffmffmffmmfmffmmfmfmmfmfmmfmffmfmmfffmmmmffmmfmmffmmffmfmmffffmmmfmfmffmmfmffmfmfmffmmffmfffmfmffffmmmffmfffmmfmffmmfmfmfmmfmffmmfmfmfmfmmmmfmffmfmmmffmmffmmmffmmfffmmffffmmffmfmmmfmmfmmmmffmfffffffmmfmmmffffmmmmmmmfmffffmfmffmmmmfmfmffmmmmfmmmmfmffmfmmfmfffmfffffmfmfmmfmfffffffmmfffffffffmmffmfmfmffmmmffffmffmffffffmmfffmmmffffffmffmffffmfmffmffmmfmfmfffffmmmmffmmmffmmfmmmmffmmmmfffffmmmfmmmfmfffmfmmffmmmfffmfmmfmffffmmfffffmmmfffffmffmmffffmmmffmfmmffmffmmmfmfmffffmfmffffmfmffmffffmmmmfffmffmfmfffffmfmmmmmmfffmfmfffmfmfmfmfmffmmfmfffmfmmffmfmmfffffmmfmfmffffmffmmmffffmfmmfffffffmmfmmfffmfffmffmfmmffmmmffmfmfmfmmfmmfmmfmmfffmfmmmmmmmmfffmmfmffffffmmmfmffffmffmfmfmmmfmmmmmfmmffmmfffmmmmmffffmmffffmmmfmffmmfffmfmmmfffmmmfmfffmmfffmfmffmmmmmffmfffmfmmmmfmfmmfffmmmmffmffmfmfmmfmfmmffffffffmmfffmmmfmfffmmfffmfffmfmffmfmmmmfmmmfmfmfmmfmffmmmfmmfmfmfmfmmmmmmfmfffmfffmmffmfmfffmmfmffffmmmfffmmmfmmmfmmmmmmffffmmfmfmffffmfmffffmfmfmfffmffmfmfffffmfmffmmmmmmfmmfmmmmfmmffffmfmmfffmmmmmmffmmmmmffmmmffmmmmfmfmmmfmmmmfmffmmmfmmmfmffmfmfmmmfmfmfmfmmmfmfmmfmmfmmmmfmmfmfmmffffmmmmfmmmmmmffmfmfffmmffmmmfmmfmfmffffmmmffmfmffmmffffmfmmmfmfffffffmmmfmmffmmmfmffmfmmffffmffffffffmmmmffmffmfmmmmmffmmffmfmffmfffmfmfffmmmffmmfmmmmmmfffmffffffmfmfffmmmmfmfmffmmfmfmmmfmmmmfffmmmfffmfmfmffffmffffmffmfmfmmmmmffmmfmmfmfffmmffmfmmmmfmfmmmfmmmfmmmfmmmmfmmmmmfmmffmfmmfffmmfmmffmmffmmfffmffmmmmffmmfmfffmmmffmfmmmffmmfmfffmmmmmfmmmmmffffmffffmmffmffmmmffmmffmmfmmmmmmmffmmmffffmmfmffmmmmfffmffmmmfmmffmfffffmfmmmmmmffmmfmffffmffmffmmffmfmfmmmffffmmmfmmfmffmfmfmmfmmmmfmffmffmmmmfmfmmfffmfmmmffffmffmmfmffmfffmfffffffmffffmffmmmmmmmffffmmmfmfmffmffmmffmmmmfmfmmmffmmfffffmffmmmffmfmfmmmfmmfmfffffmmffffmmmffmfmmfmfmmmfmffffmmfmmfffmmffmmmffffffffmmfffffmfmffmfmmfmmmmfmmfffmfmffmfffmfmfmfmmmmmmmmmmffmfmfffffffmfmfmfmffmmmfffmfmfmmmmmmmfmfmffmmffmffmffmffmfmmmfmmffmffmmfffmmfffmfmfmmmmffmmfmfmffmfmmmfmmmfmfmfffmmmmmmfmfffmfmmmffmfmmfffmmmmfffffmmmffmffmmfmmmmfffmfmmfffmfmmmmmmfmffmffffmmfmmmmmmmfmfmfmmffmfffmmffmfmffffffmmffmfffmfffmmfmmmmmmmfmfmmfffmfmfmfmmmffmffmfmffmmmfmmfmfmfmmfmmmmmmfffmmfmmfmfmfmmmfmmmfmfmffffmmmfffmmfffmmmmfmfffmffmfffffmfffmmfmmmfffffffmffmfmmmmfmffmmfmffmmffmmfffmfffmmmfmmfmmffmfmfffmfmfffmffmmmfmmfffmfmfffmmfmfmmmmmmmfmffmmmmmmffmmmfmfmmmffmffmffmmmfmfmmfmfmmfffffmmmfmmfmmffffmffmffmmfmmfffmmffmffmmffmmmmfmfmmfffmfmmmmmmfmmfmmmmfffmfmmmmmffmmmmmmfmfffmmmfmmfffmmffffmmmmfffffmfmfffmffffmmmffmmfmmmfmmfmmfffmmmmfffmmfmffffffmffmmmmmmfmfmfmmmmfffmfmffmmfffmmmmfffffmffmmfmfmfmfmmfmfmffffffmfmmmmffmmfffmmmmfmmmmmffffmmmffmmmmfmmfmmffmffmmmmfmmfffmmfmmfffmfffmmffmffmmffmfmfmmfmfmffmfffmmfffmmffmfmffffffmmmfmffmmmmfmmfmffmmffmmfffmfffmfmfmffmmffmfmmmmffffffffffffffffmfmffmfmffmmmfmffmffmffmfffmmffffmfmmmmffmmmfmmmffmffmmmmfmffffmmmmfmmfffmmmfmmffffmfmfmmmfffffmmfmmfffffffmmffmfffmmmmfmmfffffmfmmfmfmmmmfmfmfmmmmfmmfmffffmmfmmfffmmfmfmmmmfmmmfmmmmfffmmfffmmmmmmffffmmfmfmfmfmmffmffmmfmmmmmffmmmfmmfmfmmmfmmfmmfmmmmfmfmfmmfmmmmmmmfmmffmmfmfmfmmfmmffmffmmffmffmmfffffmmmmffmmfffmfffffmmfmffffmmfffffmmmfmfmffffffmffffmfmmfmmfffffmfmmfmffmfmffffmffmfmffmmfffmfmfmfmmfmmmfmmfmfmfffmmmfmmfffmmffffmmmmmfmffmfmfmmmffmfffffmmfmfffmffffmmmfffffffmfmmmffmfmfffffffmffffmffmmffmfmfmfmmffffmmmmmfmffmfmmfffmmmfmffffmfmffmfmffmfmfmmmmfmmmmfmfmffmfffmmfmffffmmmfmmffmfmfmfmmfmmmfmmffmfmffffffmmfmmmfmfmmffmmmfmmmfmmmfmffmfmffffffmfffmfmmmmmmffmffmfffffffmmmfffmffmmmfmfmmmmmfmmfmfmffmfmffmmfmfmmffmfmmmmmmmmmmmffmmmmmfmfffmffmfffmfffffmffffmmmmmmmffffmffmmmfmfmmffffmmfmfmfmmmfmmmmfmmfmffmfffmmfmmfffmfmfffmffffmfmfmmmmmmmffmmfffmmfmmmmmfmmmfffffmfmmmfffmffmfmfmmfmmfmfmfmmfmmfmfffffmffffffmmmfmffmmmffffmmfmfmfmfffmfmffmmmmmmmfffmmmfmffmffffmffmffmfmmffffmfmfmffmmmffffmfmfffmfmmmmmmfmmmmmmffmmfmmffffmmffmmfmmmffmfmmmmmfmffmmmfmmfmfmffmfmmffffmmmmmfmmmmmmmfmffffmmfffmfmfmmfffmmmmmmmfmmfffmmfmffmfmmfffffmmmmmffffmmffmmfmffmfffmmffmmfmmffmmmfffmffmmmfffmmffmfffmmmmmfmffmfmfmmfmfffmmfffmffmmfmfmffffmfmmmfmffmfffmmffffmmfmmmfffmffmmmfmffmfffmmmmmmmfmmmffmmmffffmmmmfmmfmmmfmmmmmmffmmmmffmfmfmmmmffmmmmmmmmffmmfffmmmffmffmmmmmmffmmmmmmmmmmfmmfffmfmfffmmmfmmmfffmmffffffmmfmfmfmmfmmmfmfmffmffmmfmffmmffffmmmfmfmmmfmmmmmfmmfmfmmmmmmmmmfffmffmmmffmfmfmmmmmmfmffmfmffffffmmmmmmmfmmmffffmfmmffmmmfmfffffmffmfmfmmfmmmfmfmfmmmmmmmmfmmmmfmffmfmfmmmmfmmffmfffmffmfffffmmffmfmmfffmmmfmmmmmmffmmfmfffffmmfmfmmmmmffmffmffmmmmffmfmfmmfmfffmfmfffmffmmmmfmfmmfmfmffmmmfmffmfmfmmmmmmmmmfffmmmfmmmfmmfffmmmmfmmfmfmmffmmfmfmfmmffmfffmfmfffffffmfmmffmfmfmmfffmffffmfmfmfffmmmmmmfmfmfmmmmffmmmfmffmffmmfmmmmmfmmfmffmffmfmffffmmfmmmmmffmmfffmmfmmmmmmmfffmfmfmmmfmffmffmmmmmfmfmfmffmfmmmmmfmmfmmmmmmmmffffmffmmfmfmmmmmfffmfmffffffmffffmmfmmffmffmmffmmmmffmmmfmfmmmfmmfffffffffffmmffmffmmmffmfmfmfmffmmffmmffmffffmffmmmfmfffmffmmmfffffmmffmfmfmfffmffmmmmfffmmfffmmfffmmfffmfmfmfmmmmmffmmmmfmfmmmmmffmmmmmfmmmmfmffmfffmfmfmmmmmmmmffmmmffmffmmffffffffffmmfffffffmffmfffffmmmfffmffmfffffmmffmffffmmmfmffmfmmfmfffffffmffmmfmmfmmffmmfmmmmmfmmmmffmfffffmmfmffmfffmmmmffmfffffmmmmmmfffmffmfffmffffffmmmfmfffffmfmmmffmmmfmfmfmmmfffffmmfffmfmfffmfmmmmmfmffmfmmffmmfmfffffmmfmfmfffmmmfmffffmmmmfffmmffmfmfmmfmmfmffmmfffmmmffffffmmfmfmmmmffmffmmfmmfmmmfmmfmffmmffffmmfffmfmmmfmfmmmfmmfmffmmfmmmmffmmfmfmfmfmffffmffmmfmmmmfffmffmmmmmmffffmfmfmfmmmmffmmffffmfmfmfmfffmffmfmmfffmmmmffmmmmmmmfmfffmmfffffmmmmfmmfmffmmmfffmffmfmmmfmmffmfmmffffmfmmffmmmffmmmfmfmmmmmmfmfmfffmfmmmmffmffmmffffmfffmffmffmmmfmffmffmmmffffmffmmfmfmfmmffmmffffffmfmmmmfmmfmmffmfffmffmmmmffmfmmffmfmfmmffmfffmmffmfmfmmffmffffmfmfmfmfmfmmffffmfmmmfmmfmfmmmfmffffmfmfmmfffmmfffmfmfmmffffmfffmfmmmffmffmmfmfmmfmmfmmfffmfffmmmmmmmmfffmfmfmmmmfmmfmffmfmfmmmmfmmfmmffffmmmffmmfffmmffmffmffmmmffmfffmmmmmfffffmmfffffmfmmmmmmfmmmmmfmmffmmmffmmmfffffmmmmffmmmmmffmfmfmfffffffmmmmfffmmfmmmmfffmmmfffmmffmfffmffmfffffmfmffmfmfmmmfffffmffmmfmfmfffffmffffmmfffffmfmfmmmmmmffmmfmmffmffmmfmfmfmffmfffffmmmmmfmmmmmfmmmmmffffmmmmmmfmfmmffffffmmmfffmmmffmfmffmffffffmfmfmfffmffffmmffmfmfmfmmmmffmffffmmffmfmfmmfmmmfmmfmmmmmfmmmffmmmfmmmfmfffmmffmmmmffmfffffmfmmffffmfmffmmmfmmmfmmmfffmfffmmmmffffmfmmmfmmmffmmmmmffmffffffffmmmfmmffmfffffmmffffmffmmfmmfmfmmfmfmmffmmfmmmfmfmmfmmfmfmmmfmffmfmffffmffffmmffmfmfffffmfmffmfmfmfmmfffmfmmfffffmmmmffffmfmfmfmmfffmffffffffffffmfmfmfmmfffmmmfffmmfffmmfmmfmfmmmfffmmffmmmmffmmmffmffmffffmfmmffmmmmffmfmffmmfmmmmmfmmmmffmfmffmmfmmmmmmmmmffmmmffffmffffmffmmmmmmmffffmffmmfffmmmffmffmfmmfffmmfffmfmmffffffmmffffmmmmfmmfffffmfmffffmmffmmmfmmmffmmmmfmffmmfmfffmmffffmfmfmfmmmffmmmmffffmmfmffffffffmmffffmmmmffmmfffmfmmmffmfmfmmmfffmfmffmfmmfmmmffmffmfmmfmfmfffmmmmmmfmfmmmffffmmffffmfmffmmmmfmffmfmmfmfffmmfmfffffmfmfmffmmffffmfffmmfmfmmmmmfmfffmmffffmfmffmmffmfffmmfmmfffmfmffmmfmmmffmfmffmmfmmmmfmffffmffmmmffffffmmmfmmfffmfmmmmmffmmmmffmffmmffmmfffffmffffffmmffmfffffmfmfmfmfmffmmmmmmmfmfmmfmmmfffffmmfmfffmfmmfmmfffmfmffffmmmmmffmfmfmffmmfmfmmffmmmmmmmmfffffmfmfffmfmfffffmmffmmffmfmmfmfmmmffmmfmfmffmfmffmffffmfffmmmmfmffmfffmffffmffmmfmmmfmfmffmfmfffmmmfffmmmmffmmmffmfmmmmfffmfmfffmfffffffmffmmmmffffmmfmmmffmmffffmmmmfmmmmffffmfffmmmfffmmmmmmfmmmfmmfmfffmfmmmfmfmmfmmmmffmfffmffmmfmffffmffmmffmmfffffmmmfmmmffmffmffmmmmfmfmmmmfmmfmmmffffffmffmfmmfmfffffmfmfffmmmfmmfmfmfmmmmfmffmmfffmmffmmmmmmfmmmffmmmfffmffmfmfmmmffmmmfmfffffmmffmmffffmmmffffmmmmfffmmffmmmfmffmfmfmfmffmmfmfmmmfmmfmmfmffmmfffmfmmfmffmmmfmffmffffmmffmfmfffmfmffmfmfmffmmfffmmfmffmfmmmmmfffffmmmmmmmmmffffmmfffmmffmfmfmmmfmfmffmmmmfmfmfffmmfmmffmffmmfmmmmmmmfmmmfmmmfmfmmmmfmffmmmfmmffffffmmffmfmmmfmmffffmffmfmfffmmmmmffmffmmffmmffmmfmmmfmmmfffffmmfmmmmmmfmfffffmfffmfffmfmfmfffffmfmmmffmmfffffmmmmffmfffffmffmmfffmmfmmmmfmfmmfmmmffffffffmmmfmfmfffmffmffmmffmfmfffmmfmfmmffffmmmfffmmmffmmfmfmmfffffmmmffmfmfmfmffmmfmfmffmfmfmffmmmmmmfmfffmfffffmmmfmmfmffmmfmffffmffffmmffmfmffmmmmmfmfmfmfmffmfmmfmmmffmffmmmfmmmffmmmffmmfmffmfmmmfmmmmfmmfffmfmmfmmfffmfmfmffmfffmmmffffmmffffmmfffmfmffmfmmmmmmmffffmfmfffmmffmmmffmfmmfmmfffmfffmfmmmffmmmfmffmmfffmfmmfffmffmmfmfffmfmmfmmmfmmffmffmmmffmffffmfmmfmmfmmmmmfmmffffffmffmmmmmmmmfmmmmmfmmmmmmmmfmffffmffmfmmmfmmmmfmfmffmfmmffmmffmmfmfffmffmffmffmmfmmfffmmfmffffmmfmfmmffmmmmfmmmmmmmfmfmffmfmmmmfmffmmmmfmmfmfffffmmffmfmmfmffmmmfmffmffmfmmffmmmffffmmfffffmmmmmmffmmmffmffmmmfmmffmfffmfffffmmffmfmmmmmmfmmfmmmffmfmmfmffmmmmmmfmmfffmffffmfmmffffffmfmffmmfmmffmmffmmfffffmmmmmffmffmmffmfmmfmfmfffmfmmfmmmfmfmfmmmmfmmffmmmfmfmmfmffffffmmmmmmfmfmfffmffmfffmmfmfmfmmfffmffmmmfmmmmmmmmmfffmmfmffffffmfmmfmmfmmfmfmmffffffmmmmfmffffmmmmfmmmmmmfffmfmfmfmmffmfmffffmfmmfffffmmmmmmmmmmfmfmfmmmmmmmfmmffmmfmffmffffmmmffmfmmmmfmffmfmmfmmfmmmfffmmfffmfmmfffffmfmmmffffmffmffffmffmmmmmffffffffmfffmfmffmmmffffmmmmmmfmfffmmmmfmfffmmffmmmffmffmffmmfmmmmmmmfffmmfmmfmfffmfmmfffmfffffmmfmmffffmmffffffmffmmmfffmmfmmmmmfmfmfmfmmfmfmmffffffffffmmfffmmfmmfmffmffmfmmfmmfmmmfmfmmmfffmmfmmfffmfmfmmfmfmfffmmffmmmffmmmmmmmfmmfmffmfmfmffffmffmmfffmmfmfffmffmfffffmfffmmfmmfffmffffmfffmfmfmmffmffmmmmmmfmmfmfmfffmfmmfffffffffmfmfffffmmmmmfmmmmfffmfmmfffmfffmffmmfmffmfmmmfmmmffmfmmfffmfmfffffmmmfffmfmfffmmffffmmfmmmmfffmfmmffmmmfffmmmmmfmfffmmmmfmfmmffmmmfmmmmffffmfmffmmfmfmmmmfmffmmffmfmffmfmfmfmmfmfmffmmfmfmmmmmffmffffmmmmmffmmfffffmfffmfffffffmmfffmfmfmfmffmfmfmffmmfffmmfmmfmfmfffmmffmmmfmffmmmfffffffmfmmfmmfffffmmffmmfmfmmfmfmmfffmfmfffffmffmmmmffmfmmfffmfffmfmmffmmfmfmmmfmfffmfmmmffmmmmffmfmffmfmffmfmmfmffmmffmffmmffmfmmffmmfffmmfmfmfmmmmffmfmfmfmffffmmmfffffmmffmfmffffmmffmmmmfmffmffmffmmfmfmfmfmmmffffmffmmfmffmfmmffmfmfmfmmmmmffmfmfmfmfmmffmmmfffmmmmmmfmmmffmffmfffmfmmffmmffmfffffffmmfmmmfmfmmmmmfmmmmfffmmmmffmmffmmffffmmmfmffmfmfmffmmmmmfffmfmfmfmfmmfmmfmfmffmfffffmffmffffmmmfmffffmmffmmmfmfmfmmfffmmmfmmmmffmffmmfffmmffffmfffmfmfffmfmmffmmfmfmmmmffmmfmmmffmmmfmmmmmfffffffmffffmmfmffmfmffmfmmmffmfmffffffmfmmmmmffmmffmffmffmfmmfmmfmfmmmffmmmfmfffmmfffffmfmmfmmfffmffmmfmfffmfmmmfmffmfmffmmfmmfffmffmfmmffmffmfmmffmmmmfmmfmmmmffffmfmfffmmmmfffmfmfmmfmmfmmmffmfmfmfmfmmffmmmmmfffffmmmmmfmfmfmfmmmffmmmffmmmfmfmmmfmmmmmmfmfmfmmmmffmffffmffmffmfmmfffmmmffmmmmmmmffmmmffmfmffmffmfmffmfmfmmmmmfmmmmffmfmfffmmmmfffmmmmmfmmfffffmmfmfmfmfmmmffffffmmffmfmmmmfffffmffmffmffmmmfmfffmffmffmfmmmfmfmfmmfmfmfmfmmmmfmfffmffmmfmffmmfmfmmffffmmfffffmffmffmmmmfffmmmmffffmfmfmmffffmfmmmmfffmfmmffffffmmffmfmmmmmfmffffmmmmfffmfmmmmfmmmfmmmmfmmmmmmfffmfmmmfmmmmfmfmfffmfmfmffmmmmmfmfmffmfmffmfmfmmfmfmffmfmmffmmmffmffmmmfffmmmfmfmfffffffffffmmmmfffmmmffmmmfmffmffmmffmfmmmmmmmfmmfmmfmmmmmmmmmmffmmfffmmmmffmfmmmmmmffmmmffmmffmmmfmffmmmmfmmmfmfmfmfmmffmmfmmmmfmffffffmfmmffffffffmmffffffmffffmfmffmmmffffmfffmmfmffffmffmmmmffmffffmffmffmfmmfmffffffmmmfffmfmmfmmmmmmfmmmffmfmfmffffffmmfmffmffmffmfmmfmfmfffffmmfmfmfffmfmmmmffmmmmffffmmmmmfffmmffmmmmfffmfmfmfffmfmmfmmmmffffmfmffmmmfmmmmfmmfffmfmmfmfmffmfffmfmfmfmmfffffffmmfmmfmmmffmfmmmfffmfffmmmmfffmmffmmmffmfmffffmmmffmmffmfffmmmffffmfmffmffmmffmfmfmmmmffmffmmmfmmmfffmffmffmmfmmmmfmfffmmfmmmfffmmfffmfffmfmmmmffffmmmffmmfffmfmmmfmmmfmfmmfmmmmfffmmffmmmmmfmfffmmmmmfmmmmffmmffffmfmfmmfffffmffmffmmfmmfmmffmmffmfffmmfffmfffmmmmmffffmffmmffffmmffmfffffmffmmfmfmfmmmfmfmfmffmmffmmmmfmmfmmfmfmffffmfffmfmmffffmfmmfmfmmmfmmfmfmfmmfmmffffmmffmmffmfmmmfmmfffmfffmfmmfmmmmfmfmmffmmmmfmfffmmfmffmfmmffmmffffmmfffmffmfmffmmffmmmmfffmmmmfmffmfffffffffmmfffffmmmfffmfmmmmmmfmmfmmffmmmmmfmfffmffmmmfmmfmfmmmfmmmmfmmfmmmfmfffmmmmmmmffmmmmfmffmmfmmmfmffffmffmfmfmmfmffmfmfmmmfmmmffmffmffmmmfmmfffmffmmffffffmmmfmfmffmffffmmfmfffffffmffmffmmffmfmmmfmmmmmffmmmmffmfmfffmmmffmmmfffffmmmmmmmffmmfmfmfmfmmmmmmfmffmfmmfmmffmmfffmfmffmffmfmmffmffmfmffffmfffmmfmfmmmmmmffffmfmffffmfmfffmffmmfmmfffmfmmfmmffmmmmmffffmfmfmmfmfmffffffmmmfmfmmmffmfmmmmffmmmmfmffmmfmfmmmmmmmmmffffmmmffffffffmffmmfmffmfffmmfmmmmfmmfmfmmmmmfffmfffffmfmmmffffmfmmmfmmfmfmmfmmmmfmmmffmmffmmfmmffmmfmfmfmfffmmfffmfmfmfffmfffmfmfmfmfmmmfffmfmmmmffffmmfmmmmfmfmfffffffmfffmmmfmmfmffmmffffmffmfmfffmmmmmmmmmmffmfmfmmmmfmmmfmfmmmmmffmmmmmfffmffmfffmmmmffmfffmffmmfmfmmffffffffmmfmfmmmmfmmfmfmffmmfmffmmffffmmmmfmffmmfmfmmmmmmmfffmffmmfmmmmmmfffffmfmfffmmmfmmffmffmfffmmmfmmfffmffffmfmmfffmffmmfmfffffffmfmfmfmmmmffmmffffmffmmmmffffmfmmfmmmmfmffmmmfffmmmffmfffmmmfffmffmmmmmfmmfffmmffmmfmmffmfmmmfmmfmfmmfmmffmmmmffffmffmfmfmffmffmfmfmfmfmmmfmmffmmmmfmmmfmfmmfmmmmfmmmmffffmfffmffmfffmmmfmmmmfffmffmmffffmfmfmmmmffffmffmfffmffffffmmfmfmmmmffmffffmfffmfmffffmfmmmmffmmmfmffffmmfmffffffmffmffmmmmffmfmmmffmmfffmmmffmmmfmmffmmfmmffmmffmmmfffmmmffmmmmffmmmmmffmfmmfmmfffffmfmmfmffmmfffffmfmmfmffmmfmmfmffffffmmmmfmmmmmmmmfffmfffmfffffmmfmfmmffffmfmmmmffmmmmfmfffffmmfffffffffffmmmfffffmffmfffmffmmffmmmmmffmfmmfmmffmmfmmffmmfmmfffmfmfmfffmffmmfmffmfmffffffmfmmfmmffffmmfmfmffmfmmmfmffffmmmfffffffffmfmffffffmmmmfmfmffmffmfmfmmmffmmffffffmmmfmmfmffffmmfmmmfffmfmffmmfmfmfmfmmmfmfffffmmmfffmmfmmfmfmmffffmmmmmfffmffmfffmffffmmmffmffmmmmffmfffffmffmfmmffffmmmmfmffmfffffmfmmmmfmfmfffffffmmffmmmfffmmmffmffffffmfmmmmmfmfffffmmmfmffmfmmfmmmfffmmmfmffffmfmfmmfmmmmmfmmmmmmmmmmmfmmmmmfmmmfffmmmmffmfmffmmmmmmmmmmmmmfmffmmfffmffmfmffmfffmmfmmmfmmmfmffmmffmffmfmmmmmmfffmmmmfffmffmmmfmmmfmmfmffmmmmfmmmffmffffmmmmmfmffffmffmmfmfffmmffmmfmmfffmmfmfffmfmmfmfmfmfmffmffffmffmffmfffmffmmmfmmmmmffmfmmfmmmfmmmmfmfmfffmmfmmffffmmmfffmffmmmffffffmfmffmfmmmmmfffmmffmmfmmmmmmmmfffffmfmmfmmfmmmmmffffmmfmmmfffffmfmfmmmfmmfmfmmmfmmffmmfmmfmmmfffmfmmfmmfmmfmmmfmmmfmfmffffmmffffmfmfmfmmmfmfffffffmmffmmmmmfmfmmmmmffmfmfmmmfffmfmmmfffffmmmffmffmfmfmmffmfmmfmmfmmffmfmmmmmfmmmfmfffmmmfmfmfmmffffffffmmfffmfmffmmffffmfmfmfmfmfffffmfmmfmffmmffmfmfmfffmmmmfmmffmmffmmmffmffmffmfmmfffffmfffmffmmmfmmmmfmfmfmmfmmmfffmffmmmffffmmfmfffffmfmfmmfmmfmmmffffmfmffmmffmmmmmmffmfffffmffmffmmfmfmfmfmfffmmfmfmfmfffmffmfmfmmmmffmmmmmfmmffmmfmfmmffmfffffffmfmmfmmfffmmmmmmfmfmmffmfffmffmffmmffmfmfmmmfmfmmmfmmmfmmmfmfmfmfmfffmmfmffmmfmmfffmmfffmffmmfmmmffmfmmmfmmmmfmmmmmffffmffmmmfffmffmfmfffmfmffmfmmmffffmmffmmmfmmffmmffmmmmmfmmmmffmffmffmmmffmmffffmfffmmfmmmmfmmmmmfmmmmfmfmfffmmfffmfmmmfffmmmfmmmmmffmfmmffmfffmmfmmffffffmmfmfffmmmmffmffmmmfffmffffmfmmfmmmmfmmmmfffffffmfmfmfffmfmfmffmfmfmffffmmfmfmmmmffmmmffmmfmffmffmfffmmfmfmmffmfmmfffmfffmmmfmfmmfmffmfmmfmmfmmfmffmmmmmfmfmmfmffmmmffmffmmffmffmfmfmfmmffmmmfffffmmfmfffmfmmmffmmmffffmmffmfmmmmmfmfmfmfmffmmmmmfmfmfmmmmmmmmmffmffmfmmfffmfmfmffffffmmffmmmfffmmmffffmfffmmfffmmffmffmmmmmmmmmfmffmmffffffmmmmfmmmfmmmmfmmmmfmfmffffmfffmmffmmmffmmffmfmmfmfmmffmfffmmfffffmmfmmmmfmmffffmfmfmfmmmfmmfmmfmfmfffmffffmffmffffmmffmfffmfmfmfmfffmfmfmfmmmmfffmfmfmffffmmmmmmmmmmmmfmmfmfmmmmfffmfmfmmmmmmffffmfmfmmfmmmffmmmfmmmfmmmmmmmmmmfmffmffmfffmmmmfmffmfmmffmmmfmfmmmfmmfffmffmfmfmfffmfmmfmfmffmmffffmmfmmmffmfffmffmffffmmfmfmmmfffmmffffmfffmfffmmmfmmmmfmmfffffmfmmmffmmfmfmfmffmmfmmfmmfmmfffmmmffmfmfffmmfmmffmfmffmfffmmmffmfmmmfffmmfffmmffmffmmfmfmmffmfmmmmmffmffmfmfmfmfmfffffmmmmfmmfmmmmfmmmmfmmmmfmffmmmffmmfmmffffmmfmfffmmmfmfmmmfffmfffmmfffmfffmmmffmffffmffmmffffmfmmmfmffmfmfmmmmmfmfmffmffffmmmffmfmmmmmfmfmfmffmmmmmmmmmffffffmfmfmfmmfmffmmffmfmmfmmmfmfmmfmffmmfmmfmmffmmmffmmmffmfmmfffmffmmmmfmmffmmmmmfmfmfmfmmmmmmfffffmmmmfmmmfmffmmfffmfmfmfmmfmmmmfmmfmmmfmfffmfffmffmfffmfffffffmmffmmmmfmffmfmfmfmffmmfmfmfmmmmfmfffffmmfmfmfmmmfffmffmmfmffffffmmmfmfffmmmmmmffmmmmfmfmffmfmfmffmffmfffmmfmffffmfmmfmmmffmmmffmfmfmffmmmffmffmmmmmffmfmfmffmmmmmfmffffmffmfmmmfffmmfmmfffmmmfmfffffmfmmmfmmmmmffmmfmmffmfmfmffmfmmmffffffffmmfmfmmfffmfmmffmfmmmfffffmfmfmmmfffffmmmmmmmfffmfffmmffmmffmmmmmmmfffmmfffmmffmmmmfmffmfmmfmfffmffmfffmfmffmmfmmmffmmfmmfmfmmmmmmmmfmfffmfmmmmfffmmmffmfmfmmffmmmmffmffffmmmmffmmfmmmmmmmmfffmfffmmmmmmfmmfmmfffmffmmfmffmfmfmffmmmmmmfmmfffmfmffmmmmmmmmfmffmffmmffmffmfmmfmmmmffmfmfmmmfmmffmmffmmffmmfmffmfmmfmffmfmffffmmfmmfmmmmfmfffffmmmmmffffffmffmmfmffmfffmmmfmmffffmfmmfmffffmfmmmmmffmfffffmmfffffmfmfmmfffmfffmfmmfffmffmfffmffffmmmmmfmfmmfffffffmfmfmmfmfmmmfffmfmmfmmfmmmffmfffffffmfffmmmmmffffffmmfffffmmffffmfmmmfmfmfmmmfmfmmfmfmfffmmmmffffmmfmmfmmfmfmfmmmffffmmfmfmmmmfmfmmfmmmfffmfmfmfmmmffffmmmfmmfmfmmmmmmfmfmmmmmffffmfffmmmffmmmfmffmmmfmfmmmfmmfmfmmmffmmfmmfffffffffmffffffmmmmffffmfffffmfmffmmmmmmffmffmfmmmfmfffffffffffmmfmfmmfmffmfmmmmfmfffmmmfffmfmmmfffmfmmfmfffmffffmmmmmmfmfmfffmfffmfmfmmffmmmffmfmmffmmfffmmfmfmmmmfmmmmffmfmfmmfmmmmfffmmfffmmfmfffffmfmffmfmmmffmmffffffmmfmmfmfmfmmmffmffmmmmffffmmfffmmfmfmmffffmmfmmmmffffmffmfffmmmffmmfmmfmmmffmfffffmmfffmmfmfmffffmmmmmmfmmfmfffmfmffffmmmmmmfmfmffmmfffmmmfmmmfmmfmfffmffmfmffmfmmmmffffffffmfmffffffmmfmmfmffmfmmffffmfffffmffmffmfmmmfffffmfmmffmfmfmfmmfmmmffmfmfffmmmfmfmfmmmfmfmfmfmfffmmfmmmmmmmmmmmmfmffmmmfmfmfmmfffffffmmmfffmmmmfffmmffffmmffmfmmfmmmmmfmfmmmfmmmfffmfffmffmmffmmffmmfmmffffffmfmmmmmmffffmffmfmmfmfffmmmmmmfmffffmfffmffffmfmfffmmmmmmfffmffmfffmmfmmmfmmmfmffffmmmmmmfmmffmmfffffffffmfmfmmfmmmmmffmffmfffmfmfmmffmmmmmmfmmfffffmfmffmmffffmmmmfffmfmmfmmffmffmffmfffmmfmfffffmmfmfmfmmmfffmmmfmmfmfffmfmmfmmfmmffmmmffmffmfmmmmffmffmfffmmmmmmffmmmfmmmmmfmfmfmmmmffmfmmmmffmfffffmmmmmmmfmmmmfmffmffffmfmmffmffffmmmffmmmfmmmmffffffmmfffffmfmmfffmffffmmffmffmmmfmfmfmmfmfmmmmfmfmffffmmfmmmmmmmmmmffffmfmfmfmfmfmfmfmffmfmmmffmmmmmfmmmmfmmmmmfmfmmfmmfmmffffmfffmmfmfmfffmmmfmmmmmmmfmfmmfmfmfmfmffmmfffmmfmmfffffffmfmmffmmfmmmmfmfffmmfmmmfmmmmffmffmfmffmmffmfffmmfffmmfmffmmfmmfmmffmfffmfmmmmmmmmmmfmmffmfmmmmmfmfmmffmfmfffmfmfmffffmffffmfmfmfmfmmffmffmfmffmmfmfmfmffffmmfmfmfmmmfffmmmfmmmfmfffmmmfmmffffmmmfmffmffffmmmmffffmfmfmfffmmfffmmmfffmfffmfmmffmfmmffffmmffmmfmfffmffmfmmfmfmfmffmfmfmmffmfmffmfffmfmfmmfmmmffmfmmmmfmmfmmffffffmmffmfmffmmfmfmmmfmmfmmmfmmmmffffmfmfmmmmfmmmmfmfffffffmmfffmfmffmffmmfmmfffmffmmmffffmfffmffmffmfmfmmfffffmffmffmmmfmfmfmfmmmffffmmffmfmmmfmfffmmfffffmfffmmfmfmmfmfmffmmfffmffffffmfmffmmmfmfmffmfffmmfmfmffmfmfmmmmmmffffmmmmmfmmmmfmmmmfmmmffffmffmmmmffmffmfmfmmmmfmmffmfmmfmfmmmffffmmfmmfmmfffffmffmmmfffmmmmmfffmmmffmffmmfmmmmmfmfmffffffmfffmmfmmfffmmffmffmmfmmmfffmffffmmffffmfmffmfffmmfffffmfmmffmmfmmmffffmfmfmfmfmmmffmfffmmfmffmmmmmfmmfmmmffmmmfmmmmmmmmmfffmmmmfffmfffffffffmmfmffffmfffmmmmmfmmmmfmfmfmffmmffmffffffmffmmfmfffmffmfmffmmmfmmmmmmfffmfmffmfffmffmfffmmmmfmmmmmmfmfffmmmmffmffmmfmmmfffmffmffmffmmfffffmmmffmmmmfmfffmffmmfmfmmfmfmmffmfmfmffmfmfmmmfmfmmmffmmfmmffmffmfmffmmfmffmfmmfffmmmmmfmfmfmmfmffmffmmmfffffffmffmfmmmfmfmffmmmmfffmmmmmfffffffmfmfmfffmmffffmfffmfffmfmmffmffmfmfmfffmfmmmmmmmmmmmmfmmfmmmmmmfmfffmffmfmfffmfmfffmfmmfmfmmfmfmfffffmmfmfmffmffmffmffmmmmmfffmfffmmmmffmfmmmfmffmmmffmmffmmfmmfffmfmmffmmmmmffffmfmfmmmfmmmmmfmfffmfffmffmfmfmfmffmfmffffmfmffffmmfmfffffmmfmfmfmmmmmmfmmmfmffmmmmffmmmmmfmfmmfmmfmfffmmfmfmfmffmffmmmffmmfmffmffmfmfmmffffmmmmmffffmmffmfmfmmfmffffmmmfmfmmmffffffmfmmmfmfffmfffffmfmfffffmmmmfmfmffmfffmmmmffmmfmfmmfmmffmmmmffmfffmfmmmmmfmfmmmmmmmmffmffmfffffmmfmmffmmmmmffmfffmffmmfmffmmfmffffmmffmfmffmmmfffmmfffffmmffmmfffffmfmmffffffmfffmfmfmfmffmmfmmfmffmmmmmmmffmmfmfmmfmmmffmmfmmffmfmmfmmmmffffmmmmmmmffmfmmmmfmmfmmfmffmmmffmmmmmmmmffmmffmmffmfmmmfmfffffmfffffffmmfmfffmmmffmffmfmmfmmfmmfmffmfmfmfmmfffmmmfmmfmmffmffffmffmmmmmmffmfmmmmmmffffmmffmfmfmmmfffffffffmmmmfmmmmffmmfmffmmfmmmfmfmmfmffffmmmmffffmffmmmmmmmmmmffmfffmmfmfffmfffmmmmfmfmmmmfmmffmfmmmmmfmmffffmffmmffmmfffffmmfmfmffmmfmmffmfmfmffffmfmmmffmffmfmfmmfmmmfmmffffmfmffmmfmfmmmfffmmffmmfmfmfmfmfmffmmfffmfmfffffmfffffmffmfmfmmmmffffmffffmffmmmffmfmmfffmmffmmmmfmfmmfmmmmmmmmmmfffmmfmffmmfmfmfmffmfmfffmfmfffffmfmffmmffmmmmffmmfmmmmmfmmmmmmmfffffmfmfmffmmfmmfffmmfffmfffmfmmmffmmmfmmmmmmmffffmffmffmffmfmfffmffmmmmfffmmfffffmfffmfmfmmffmmfmffmfmmfmfmffmmffmfmmfmfffmfmmfmffmmffmffmffmfmfmmmfmmmffffmffffmmffffmfmfmffmmmfmmmffmmmmfmfffmmffmmffffmffmfffmffffmfffmmfmfffffmfmmmfffmffffmffmmffffmmmmfffmmmmmfmffmmmmffffffmfmmmmffmmfmmffmfmmfmffffffmffmmfmmmffffffmffmmfmmmmfmmmmffffffmfmmfmmfmffmfmmmmmmfmmffmmmffffffffmfffffffffffmmmmfffmmffmmfffmmmmmfmfffffmmfmffmmfffffmfffffmmmmmmmffmmffmmffmmmmmfmfmffmmmmfmfffmmmffmmfmmfmmffmmfmmmmmmfmmmmfmfmmmfmmffmfffmmfmfmmfffmfmfmfffmmffffffffmfmmmmffmfffmmfmfmmfmfffffmfffmmfmmffmfmfmfmmfmfmmmfmmmffmmffmmfffmfffffffmmffmmmfmfmffmfmfmfffmfffmmmfffffmfmffffmfffmffmfmffmfmmfffmfmmffmmffmffmmmfmfmfffmmmfmmmmfmfmfmmmfffffmfffmmmfffmfmffffffmmmmfffmfmffmmfmmfmmffmmmmmffmfmffmfffmmmmfmmmffmmmmmffffffffmmfmfmffffmfffmfmfffffmmfffffmmmmmmfmfmfffffmfmmmffmfmmfffffmmmmmmmffffmfffmmffmfffmmfmmfmmffmmmmffffmffmffmfmffmffffmmmffmfffffffmmmmmmffmfmfffffmffmmfmmmmmffffmfmfmmfmfmmmmffmmffmmfmmfmffmmmffmfmfmffffmfffmmmmmmmffmfmmmmffmfffffffffmffffmmffmmmfmmmmffmfmmmmfmffffmmmmmfmfmffffmfmfmfffmffmfmfmfffmfmfffmmmfmfmmmmfmfffmmfmfmmmfmffffffmmmfffmfffmmffffmfffmfmffmmmffmmmfmmfmfmffmmfffffmmfmmfmmmfmfmfmfmmmmfmffmfmmmmffmfmmmffffmffffmmffffmmmmffmfffmmfmffffmmfffffmfmmffmfmffmmmfmmffmfffmmffmfffmmffmmmfffmmffmmfffmmfmffmmfffmffmmmmfffmmmfffmmffmmfmmmmmffffmmfmfmfffffmmffmmmffmmffmmfmffmfmmmmfmmmmffmmmmfffffffffffmmmfmmmmmmmfmmffmmffmfffffmmfmfffffmmmmffmmmmmfmmmfmfmffmmmmfmmffmmffmffmmmfmfmfmfmmfmmffffmfffmmmmmffmmmfmfffmmfffmffmfmmmmfmfmmfmfmfmfffmmffffffffmmfmfffmfmmmmffmfmmfmfmfmfmfmmmmmmmfffmfmmmffmmffffmmfmmffmffmmmmfffffmmmmmfffmmmfmmffmffmffmfmfmmmmffmfmmfmfffmmmffffffmfmffmfmmffmfffmfffmfmmfmmfmmfmfmmmmmmfmmmmfmmfmffmmffmfmmmmfffmmfffffmfmffmffmfmfffmmffffmmfmmmfmfmmfffmmfmmmmmfmfffffmmfmmmmmfffmfmfffffmfffmmmmmfffmmfmfmfmffmmffmfmfffffffffffmmffffmfffffmffmffmmmffmffffffmfmmmmfmffmfmfmmffmfmfmfffmmfmfffffffffmmmffmmfmmffffffffmmmfffmmmffmffffmfmfmfmffmmffffmfmmmffmmfmfmfffmmmmmmfmmmfffmmmfmfmffmffmfmffmfmfffmfmmfmmmmffmfffmmffmmfmmfmmmmfmmffmmffffmmfmmmmffffmmfmmfmmmmmffmffmfmmfffmfmmmmfmmffmmfmfmfmfffmmmmfmmfmfffffmmffmfffmfmmmmfffffmmfffffmmmmmffmfmffmfmmmmmmmmmmffffmfmffffmmfmfffmffmfmmfmffmfffffmfffmfffmfmfmmfmmfmmmmmmmmmfffffffmmmmmffmmmfffffffffffffmmfffmfffmfmfmfffmmfmfmffmmfmmfmfffffmfmmmmffmffmffmfmfffmmfmffmmmmffmfffmffffmmffmmfmmmmmmmfmmmmfmmfffmmmfmfffmmmmmffmfmmmmffmmfmfmmfffmfmffmmffmffmmmmmmmfmffmffmmmmmmfmffmffmfmfffmffffmffmfffmmfmffffmmmmmffmfffffffffmffmfmmfffmmmmfmfmmmfmmfffffmfmfmmmmmfmmfmmffmmffmfmffmfffffmfmmmmmfmmfmffmmffmmfffffmfffmfmmfmmfmmfmmmmmmmfmfffmfmmmfffffmmfmffmffffmmmmfmmffmfmmfmfffffmfffmmmfffffffmmmfmfmmmfffmmmmfmfmmfmffmmffmmffmfffmmfmffmmffmfmmfmffmmmmfmfmfmmmfmmmfmfmmmmffmmfffffmfmmffmmmffmffmfffmmmffmfmfmffmmfmmffffmmmmmfmfmmfmmmfmmfmfmffffmfmffmmffmmmfffmmmmfmfffmmmffmfffffffmffmmfmfmmmmfffmmfmmmffmmmmfmmmmfmmmmfffffmmffmmmfmmfmfffmmfffmmmmffmmfmfffmmmfmffmmmmmmmfmmfmffmffffffmmmfffmffmmmmmmmfmmffmmfmfmmfmfmmfmfmmmmmmmmmffmffmffmmfmmfmffmmmmmffffmffffmfmmfffmmmmmffmmmmmfmfmfmffmmfmfmmmmffmffmmmmmfffmmmmmmmmfffmfmfffmffmfffmfmfmmfffffmfmfmfmfffffffmmmmmmmmmfmmfmfmfmmmmfffmmmmffmmmfffmmmmffmfffmmfffmmmmmffmffffffmmmmmmmmmmmmffffmfffmmfffffmffffffmfmmfmmmmfmmffffmmfmffmffmfmmfmfffmmfmmmmfmffmffmfmmfmmfmfmfmmfffmmmfmfmmmmfmffffmmfmmmffmmffmfffmmmmmfmfmffmmfffmfffmffmmmmmfmmmmmmmffmffffffffmfmmmmfffffmmmmmmffffmmfmmffmmmffmffmmmfffffffmfffmfmfmffmfmmfmmfmmffmffmfmmmmfmmffffmfmfmfffmmmmffmfmfmfmfmfffmmfmmmmffmmmmfmfmffmmfmmffmmfmmmfffmmfffffmfffffmfffmmfmmmffmffffmmmfmmmmmfmfmfmmmmffmfmfmmmfmfffffmmfmmffffmmffmmmmfffffmmfmfmmmmfmfffmmmffffmmmffmmmffmffmffffmmmfmmfffffffmmfmmmmfmfmfffmmmfmfmmffffffmffmmfmfmmffffffmffffmfmmffmfmmfmffmfmfffffmmffmfmmfmmmmmmmfmmmmffmmfmmfmfffffmmmmmmfmfffmmfmfmfffffffmfmffmmmmmmmfmfmmfmffmmmfffmffmmffffffmmmfmmfmfmmffmmfmmffmmfmmfmfffffmmfffmmfmmfmmfmfmfffmmmffmmfffffmmfmmfffmmfmmmfmmfmmmfffmmffffffmmmmmmfffmffmmfmmffmmfmmfmfmffmfmmfmmfmmffmmmmffmmffmmmmfmfmfmmmmmffmmfmfmmmmfmmfmfmfmfmfmmmffffmmmmmmffmfffffmmfffmmmfffmmffmmfffmffmmfmmmfmmfmfmmfmffffmffmfmfffmmfmmfmmmffmmmmmmmffmmmmfmmffmmmfmfmmmfffmmmfmmfmfffmffffmmmmfffffmfmmfmmmmfffffmmmmfmffmmmfmmffmmmmmmmmffmfffmfmmfmmmfmffmfmmmmfmffmmmfmmmfmffmmmffmmmfmfmmffmfffmmmmmfmmmffmmmmfmmfmffffmmmfmfmfmfmmfmmffffmffmffffmmmfmmmfffmmffmfmffffmmffmmfmmmfmfmmmfffmfmmmfffmfffffffffmfmffmmfmffffmmmffmfmffffmmmffffffmfmmmfffffmfffmfffmmfffmmmmmmmffffffmffmfmfmmfmmmmmmmffmfmmffffffmfmfffmmmffmmffffmfffmfmffmmfmfmfmmmmfmmfmfffmfmfffffmfmmmffmmfffffffffmfmffmmmffffmmmmfmmffmffffmmmmmfffmmfffmmmmmfmfffmfmmmmmmfffmffmfmmmmffmfffffmfffmmffmmmfmmmmfmmmmmfmfmffmfmfmmmmmffmmfmmmfmmffmmmmfmfffffmfmmffmfmmmmfmffmmmfmfmfmfmffmffmfffmmfmmmmmfmmmmmfffmffmmmfmffmmmmmffmfmmfmmmfmfmfmmffmfmffffmfffmmmfmfffmfmmmfmfffmmfmmmmfmmmffmfffffmffmffmmmmmmmfmmmfmfmfmmmmfmfmmfmmmffmfffffmfffmfmmmmmmfmfmfmmffmmfmmmffmfmfffmffmmmffffmffmfffmfmfmmffffmmmmmmfffmmmmfmfmmffmfmffmffffmmfmmfmffmmmfmmmffmmmmmffmfmfmffmfffffffmmmfmfffmmmffffmmffmffmfmfmmfmmfmfffmfmffffmfffmmffmffmfmmfmfmmfmmfmmffmmmfmmmfffmffffffmmfmmmfmffffmmmmfmmfmmmmfmmmfmmmfmmmmfmffmmffmfmmmffmfmmfmfmfffmmfmfffffmfmmfmmfmffmfmffmffmfffmmfmfmmmfmmffmmffmmmffmfmmfffmmfmmfmmmfmmmfmmfmfmmmmffffffmmmmffmffmfffmfffmfffmfmmmffmmmmfffmffmmfmffmfmfmfmmmfffmfffffmmfmmfmmmffmmfmmfffffmfmmfmfffmmmfmmmfmfmffmmmmmfmmfmmmfmfffmfffffmfmmmmfmffmmfmmmffmfmmmmffmfmfmfmfmffffmmffffmffmfffmffmffmmfmmmffmmfmfmmffmmffffffmfmffmmmmffmmfmffmffffmmfffmfmfffmmmmmffmmfmfmmfmmmffmmfffmmmmfmfmffmfmmmmmfmfmffmfffmfffmfmffmmmmfffmfmmmmfmffmmffffffmmmfmmmfmfmfmfmfmffmmfmmmmmfffmfmfmmmffmfmfmmmfffmfmffmmffffmmfmmffmmfmfmffmmffffmfmffmmmmmfmfmmfffmmmffmfmmffffffmmmmfmmmmmmfmmffmfmfmmmffffffmmfmmfmffffffmmmffffffmffmfffmfmfmmfmmfmfffmmmmfffmmfmfffffmmfffmfffffmfmffmfmffmffmffmmmfmmmfmffmffffmffmfffmmmfmmmfmffmffmmmmfffmmfffmfmfffmmmmffmmmmfmffffmmmfmfmmffmmffmfffmfmfmffmmfffffmffmfmmmffmfmffffffmffmfmfmfmmffffmfmffffmfffffmffffffmfmmfmfffmfmfffmmmfmfffmfffmmmffmmffmffmfmmfffffmfffmmfmfmfmfmfmmffmmfmmmfffmfmmmfmmfffmfffmfffmfmfffmmffffmfmfmmfmmfmffmffmmmfmmmfmmmffmfmmfmfffmffmmffmffmffffffffmmmffmmmmfmmffmffffmmfmmmmffmffffmmmmmmmmmmfffmfmffmffmmfffmmffmfmfmfmfmmmfmfffmfffmfmmmmmmfmmffmmmfmffmffmmfffmfmmfmfmfffffmmmmfmfmmmmmffmmfffffmfmmmmfmfmmmfmffmmmfmfmmffffmmmfmmfmfmmmmmmfmmmfffffmfffmmffmmmfffmffmffffmmmfffmmffmmmmmmmmmmfmmfmmfmffffffffmffffmfmfmffmmfmffmfffffmfmffmmmmmmfmmfmmmmfmffmfmmfmmfffmmmmmfffmmmmfffmfmffmmmmfmfmmmfmmfmfmmfmmfmmmfffmfffmmmmffmfffffmmffmmmfmmmmmfmmmffffmmfffmfmmffmmmmmmmmmmfmfffmmfffmffmfmmmmfffmfmmffmfmfffffffmmffmmfmffffffffmmfmffmmmffmffmfmmffffmfmffffmffmmfmfmmfmfffmmmfffmffmfmfmmmmfmfmfffmmmffmfmmmmffmmfmmffmfffffmfffmmmmmmfmffmmfmfmmmffmmfffffmffffmfffmffffmmmffmffmfmmmffmmfmmmmffmmffmfmffmmmfmfffmmmmfmmmfmmmffmfmmfffmmmfmffffmmfffmffmmffffffmmfffmffmmmmfmmmmmmffmfmfmmfmmmfffffmffffmfmmfmmmfffffmmfmmmmmffmmfmmmffmmmfmmfmfmmffmffmmmfffmmfmmffmmfmfffmffmmmffffmffmfffmfmmmmmmfmfffmffffmffmfmmffmmfmmffmmmffmmmfmmfffmffmfmffmmmffmmfmffmmmfffffmfffmfmmmmfffmfmmfmmfmmfmfmffmffmfmmffffffmmmmmmffmfmmmmmmffmfmmfmmffmfmmffmmmffmmfffffmfffffmmfmmmfmmfmfmmmfffmmmmmfffmmmffffmmfmfmmmmmmfffmmfmmfffmmfffmmffffffffmmffmfmmfmffmmmmfmmmfmfmffmffmfmfffmmmffmfmfmmfmmfmmffmfmfffmfmfmfmfffmfffmmffmfmmffmmmmmmfmfmffmmmfmffmffmffmfmmmfmmffmfmmmfffmffmmfmmmmmmmmfmmffmmfmffmmmfmfmfmfffmfmmmmmmfmfffmfffmffmfffmffmmmmfmffffmfffmffmmfmfmmfffmfmmmffmfmmmffmmmfmfmfffmfmmmffmmmfmfffmmmfmffmmfffmfffffmfffmfffmffffmfmmmmmmmfmmfmffmmmfmfmfmmmmmfffffffmmmmmmmmffmfmffmfmmmmmmffffffmmfmmmfmmmfmfmfmfmfffffmmfffmfmmfmmmmfffmmmffmffmffmfffmffmmmffffffmmffffmmmmmmffmmfmffmmmfmmfffmfmfmmmfmffmmmmmfmmmmmmfmfmmmffmmfmmfmmmfmfffmmfmfmfmmfmmffmmfmmmmmffmmmffffmmffmffmffffmmmmmmffmmffffmfmmmfmmfmfffffmfmmffmmfmmffmmmfmmmmmmffmmmmfmmmffffmmmmmmmmmmmfmfmmfmfffmmmfmfffmfmmmfmffffmmffmmfmmmffmfffffffmffmfffffmmmmfffmffmmffmffmmfmmfffmfmmmfffmfmffffmfffmmmmmmmfmffmmmmffffmmmmfmmffffmfmffffffffmmfmfmmmfmmfmfffmffffffmffmffmmffffmmffmmmfmmfffmmfmmmmmffmmmfmmfffffmmfffmfffmmfmfffmmfmmfmfmfffffffmfmmmmfmfmmfffffmffffmmffmffmfmfffmfmfmfffmmmfmfmmmmmmmmmmmffmfmfmfmfmfmmmffmfmmmmfffffffffmmfffmfffmfmmmmfmfmmfffffffmffmfffmmffffmfmfmmfmfmmmmmfmfmffmmfmmfffffmmmmmmmfffmmffmffffffmmmmmfffmfmmmfmmfmfffffmmfmmffffmfmmmfffffffffmmmfmfmmfmmfmmfmmfmmfmmffffmfmmfmmmmfmmmmfmfmfmmmfmmffmfmffmmmfmmfffmfmffmfmmmfmffmfffmffmfmmffmfmmmmffmfmmmmmmfmmfmfmmfmmfffmfmmmfmmffmmffmffmfmmmmfmmffmffmmmfffmmfmffffmmmffmmmmfmmfffffmmffmmffmmfffmmmmffffmfmffffmmffffffmfmmmmmfmffffmmffmffmfffmfmmmmmfmmfffmfmfmfmmmmmmfmmffmmfffmfmffmfffmmffffmmfmmmmffffmfmmmffmfffffmmfmmmfmffmmmmmfmmmfffmmmmffmmfmmmmffffmmffmmffffmfmmffmmmmmfffmmmmfffffffmffmfmmmfmffffmfmffmfmffmfmfmfmffmmmmffmmfmmffffmfmfffffmmmfmffffffmffmmmffmmmffmmmfmfmfmmmfmmmfmmmmmfmfffmmmfmmmffmfmfmfffmmmmfmmmfmmfmmmfffffmffmffffmmmffmmffmmmfmmmfmmmfmmfmfmmfmfmffmmmmfmmfmmmmmmmfmmmmmmmfmmmmmffmfffmffmfmmfmffmmmfmfmmmmmmmfmmfmfmfmmmmmfffmffmmmfmffmfmmmmmmfmmmmffmfffmmmmmfmfffffffmfmffmffmmfmffmmfffffmffmfmmmmmfmmmfffffmmffffffmmmmfmmffmmmfmfmmfmfmmfffffmfmfffffmffffmffmmmmffmmffffffmfmfmfmmmmmmmmffffmmmmfmfffmmffmmfmfffmfffmffffmmmmfmmmfmffmfmfmmmmfmfmmmmmmmmmmffmmfmmffffmmffmfmmmfffffmfmmmmmffmfmmmmfffffmmfmmffmffmmmmfmfmmmmmmfmmmmfmmffmffffmfffmmmffmmfmmmffmmfmffmmmfffmffmmmmffmmfmmfffmfmmmmfffmmmfmfmmmffmmmffmmffmmmfmfmmffmfmmmfmfmfmffffmfmmmffffmfffmfmmmmmmffffmfffmmffmfmmffmmfffmmmffmmmfffffmmmmfmffmmmmmfmmmfmfffmffmmmfffffmmmffmffmfmmfmmffffmmfmfmmfffmmmmffmmmmmmmmfffmmfmmmmmfmmfmfmmmfmfmmmmmmmfmmfmmfffmmmmmmmfmfmfmmmfmfmmffmmmmfmfmffffmmfmmffffmmmmffmfmfmffffmfffmfmmmmffmmmfmmmmmmfmmmffmmffmmffmmmffmfmfmmmmfmmmffffmmmffmfmmmmfmffffmffffmfmmmffmmfmfmmmfmffmfmfmmfmfmffffffmfmfmmmfmmmmfmfffmmfmmmffmfffmfmfmfmffffffmmmfmfmffffmmmfffmmmmmffmfmfmfffmmfmmfmmmmfffmfmfmmfmmfmmmmfffmmmmmfmmfffmffmmmmfmfmfffmfffffffmfffmfffmmffmmmmfffmmmmfmmffffmfmmmmfmffmmmfffmffmffmmmfmmmffmfmffffmffmfmmffffmfmmfffmfmffmfmfmfffmfmmmmmffmfmmmmmfmmmffffmffmmmmmmfmmffmmfmmffmmmmfffmmfmmmfmmfmmfffmmmmfmmmmmfmfffmfmffmmmffmfmmffmfmfmmmffmffmffmmmfmmmmmmmmmffffmffmmfmfmfmfmfffmfmmffffmmmfffmmfmfffmmmmmmmmmfmmfmmffmfmfmmmmmffffffffffmmffmffmmfmfmfmmmffffmmmfmmmfmfffmmffmffmmmmfmmmmffffmffmmffmmmffmffmffmmmffmmmmfffmmmffmfmfmmfmfffffmmfffmmmmfmfmmmmmmffmfmmfmmmmmfmfmmffffmmfmmmfmmmffmmmfffffmmfffffffmmffmfffffffmffmffmfffmffffmmfmffmmmfmffmffffmmmfmffmffmfmfffffffmfmmmfmmfmmfmmmfmffmffmmmmffmfmmmfmfffffmffmmmmmffffffffmmmmmmffmmmmmfmfmffffmfmmmffmmffmmfmmmmffmmmfmfmfmmffffffmfffffmffmmmmfmmmfmmfmfmmmmmmfmmffmmfmmmfffmffmffmmffffmmmffmmmffmfffmmmmmfffffmffmmmmffffmfmmfmfmmffffmmfmmmmmmmmmfmmfmfffmffffmffffmffmmfmffmmmmmfffffmmmmffffmmfmmmfmfmmffffmmfmmmmmmfffmffmmfmmfffffffmfmfmmfmmfmfmmffmmmmmfmfffmffmfmmmmfmfmmfffmmmmmmfmffmmmmfffmmmmffmmmmffmmmmffmmfmfmmffffffmffmfmffmffmffmfmfmmmfmmfmmmmmmfmmmffmmffmmmfffmfmmfffmfffffmfmfffmfmmffmfmfmmmfffmffmfmmfmmmmffmmfffmmfmfmmmmmmmmmmmmmfffmffmmmfffmfmfffmmmfmmfmffffmfmfmfmffmmfmfmmfmmffmfffmfmmfffmmfmmmfmmfmfmfmfmfffmffffmmffmmmmmfmfffmmffffffffmmmfmfmmfffmfmmmmmfmmmmfffffffmmmfmmfmfffmfmfmmmmfmffmffmmmffmmmffmfmmmfffmfmffmmfmfmmfmmffmfmffffmmmffmffmmfffffmmfffmffffmmmmmffmmmmfmmffmmmfffmmfffffmmffffmmmfffmffmfmfffffmfmmfmmfmmmmmmfffmfmmmmfffmffffffmmfmffmffmfmffmfmfffffffffmffmmfmmffmfffffmffmmfmfmmmmmmmfmffmfmfmfmfmmmfffmmmfmmmffffmfmfmmfmmfmmmfmffmmmfffffmmmmmmfmfmmmffffmmmmffmmmmffmffffmfffmffmfmmfffffffffmffmmffmmffmmmffmffmfmmffmfmfffmmmmmmmfmmmfffmmmmfmmmmmmmfffffffffmmmmmmmmffffmfmmfffmmfmffmmmmfmmfmfmfmmmffffmmfmffmmfmfmmmmmfffmfmmmmmmffmffffmmmmfmffmmffffmfmffffffmmfmffmffffmfmmffmmmfmmffffmfmmfmmmmfmmmfmffffffmfffffffmmfmfmmffmmmffffmmmmmmffffffmfmmffmmfmmfffmmffmfmmfmfmmmffmfmfffmfmmfmffmffmfmmmfmmmmfffmmffmfmffmmmfmmmfffmmmfmfmmmfmffmmffmffmffmmfmfmfmfmffmmffmmfmmmfmmmmffmfmmmfmmmmmmmmmffmmfffffmmmmfmfmmfffmmmmfmfmffmmfmfmmffffmmmmmffmfmmfmmmfmmffffmfmmmffmmmmmffmffmmfmfmfmmfmffmmmffmmmmfmmmmfffmmmfmmmfmmfffffffmffmmmffffmmmfffmmmmffffffffmffmmmmmmfmmmmffffmmfmffmfmfmmffmfmmffmmfmffmmffffffmffmfmmmfmffmfmmmfmffmfffmfmmmffmfffffmmmmmfffmfmffmfffmmfmfmfmfmffmmmfmmffffmffmmffmffmfmmfmfffmmffmfmfffmfmmfmfffmmffmmffmffmfmmmmmfffmmfffmmmmmmmfmfmffmmfmfmffffffmmmfmmmffmfmmmmmfmmmfmmfmmfmmffmmffffmffmffffmmffmffmffmfmfffmfmfffmmmmmmfmffmfffmfmffffmfmmfmffmmfmmffmmfmfffffmmmfmfmfmfmffmfffmmmffmmffmmmmmmffmmffmffmfmffmfmmmffmmfmffmmfffmfmfffmffffffffmffffffffmfffmmfmmffmmmfmffffmffmmfmmmfmfmfmmmmfffmfmfffmmmmmfmmffmmfmmfmmffmmmfffmffffmfmmmfmmmmfffffmmmmmffmmffffmfmmfmmmmffffmmffmmffffmmmmmmfmfmfmmfmmffmffmffmfmmmmfmfmfmfmfmffmmfmfmffmmfmmffmmfmfffmmmfmmmfmfmfmmfmmmmfmffmmmfmmfmmmfmfffmmffmfmmfmffmfmfmmffffmmfmffmfmfmmmmfmffmmmmmmmffffmmmmfmfmfmfmmfffmfmffmfffmmfmmmfmfmfmfmffmfmffffmmmfmffmmmmfmfmffmmfffmmfffmfmfmmmfmfmmffmfmmffffmffmmffmmfmmfmfmmmmfmfmmffmmmmmfmmmfffmfmffmfmmmffmmffmmfmmmmmffmmmmmffmmmmmmffmfmmmfmmffffmmfmfmmfmfmfffmfmmmmmfmmmffmmmffmffffmmmfmmmfmmmmfmffffffmmmmmmfmffmfmfmmfffffmmmmfmffmmfmffffmmfffffmfffmmmmfmmmmfmmfmmmfmmfmmmfffmmmmfmmfffmmmmmfffffmfmffffffmffffffmfffffmmmfmmmfffffmmmfmffffffmmffmmfffmmfmmmmmmfmmfmmffmfffffffmfffmmfffmfffffmffmffffmfmmfmffmmffmfmmfffmmmffmffmffmfffmfmmmfmmfmfffmmmmmfmfmmfmfmfmffmmmmmmfmfffmfffffmfmffmmfmfmmfmmmfffmffmfmmfffmfffmmmffmfmffmfmfmffmmmmmfmfffmmmmmmfffmmmffmmfmffmfmmmfffmmmmmfffmfmmfmmmffmmmfmfmmfmfmmfffffmfmfffmmfffmfmfmmfmmmfmmfffmfmfmmffmfffmmmfffffmfmmfffffffmfmmmfmmfmfffmmfmffmfmmfmfffmfmmmfffmffmffmmfmmmfmmfmmmmmmffmfmfmfmmfmmffmmfmfffffffmfffmmmmmmffmmmfmfmmfmffmmfmmmfffffmmmmmfmmmmfmmmffmffmfffmffmffmmffmfffffmmfmfffmfffmmmfmmffmmfmffmfffmmffmfmmmmmmmfmfffmmmmffmffmmfmfmmfffffmfmmffmffmmmfmmmmffmffffmfmmffmfmffffmmffffmfmfmmmfffmmfmmfmmmmfmmffmmfmmfmmffmmffmmfmmmmffmmffmmfmmfmmfmmffmfmmffmfmffmfmffmfmmfmffmmmffffmmffmffmmffmmfmffmmmmfffmfmfmmffmfmmfmfmfmmffmmfmmmfmfmmmmfffmmfmmmffmfmmffmfmfmffmfmmffmfmfmfmffffmfmmfmfffmmffmmfffmmffmmmffmmmmffmmfmfffmffmffffmmfmmmmmmmffmfffmmmmfffffffmfmmmmfmfmmffffmfmfmmffffmffffmfmmfmffmfmmmfmmmmmfmfmffmfmmmmmmmffmmmmmmmmmffmmfmfmfmmfffmmmmfmmfmmmmmmffmmmfffmmmmmmfmmfmmmmfmfmmfmmffmfmfmmmmmffffmmfffmmffmffffmmffffmmmmmfffmfffmfmmmfmffmmfffmmmfmffmfmmmmffmmmmmfffmmmmmfmmffmmmmfffmmfmffmmfmmfffmfmfmmmmfmfmmmmfmfmmfmmmmffffmmmfmmfmfmmmmmfmffffffmmmfmfmmmfmfmfmfmfmmffmfmmmfmffmmfmffmmmmmffmfmfmmmmfmmfffmmmmfmffmmmmmmmffmffmmmfmmmfmmfmffmmfffmmfmfmfmffmffmffmffmmmfmffffffffmmmffmfmmmmmmfffmfmmmmfmmfmfmfffmfffffmffmmffmmmfffffmmmmffmmmmfffmfmmffmmmfmfffmmmfffmfmmmffmmmfmfmmfffffmmfmmmfmffffmfmffmmmffffmmfmmfmfmffmfmffmmmmmmmmffmmmfffmfmmmffmmmfmmmfmfmmfmffffmfffmfmfmffmfmmfffmffmfmfmfmffffffmfmmmfmmmffmmfmfmmmffmfmmmmfffmmmfffmfffmffffffmmmmffmfmfmmmmfmfmmmmfmfmfmmmfmmfmfmmmmmfmfmmffffffmffmffffmffmmmmfmffmmmffffffmmfffffmmfffmmffffmfmfffmffffmfmmfffmfffmfmmfmfmfffmfmfmfmfffmfmffmffmffffmffmfmffmmmmffffmffffffmmfmfmmmffmmfffmffmfmfmmmmfffmmfmfmmffmmmmfmfffmfmmmmmmmfffmffmmfffmfmmfmffmmmmfmmmmmmmmffffmmfmmfmfffffmmffmmfmfmmfmmmfmfmmmfffmmffmffffffmmmfmmmmmmfmfmmmffffmfmfmmffmfmfffmffffmmmfffmmmfmfmfmmmmfmmmmfmmfmfmfffffmmffmffmfmmmffmmfmffffmfmfffmfffmfffmffffmfffffmffmmfmffmmmffmffmmffmmffmmmfmmffffmmffmfmmmfffmmfmfffmmffmfmmmfffffmfffffmmmmfmmmmffmmfmmfffmmffmmffmfffffffmmfffmmmmffmfmmffffmmmfmmfffmffmmfmmmmmfmffffffmmffmfmmmmfmmfmmffmmfmfmfffmmmmfffmffmfmmfmfmffmffffmfmmfmmffffmfmffmmmfmfffmmmmfmmffmfmmfmmmfmmmmmmmfmmmmfmmfffffffmmmmfffmfmfmmfmmffmmffffmfmfffmmffmmmmmfmmfffmmfmfmfffmffmfmmmmmffmmmmfffmmfmffmfmfffmfmmmmffmffmmmffmmfffmmmmmmmmffmmmmmfmfmmfmffmffffmffmmmfmfmmfmmmfmfmfmffffffffffmmfmfmmmmmmmfmfmfmfmmfffmmmfmfmfffffffmfmfmmffmmfmmfmmfmmfmfffmffmmfmmffmmmffmmmfmfmffffmmffmfmfmmfmfffmfffmfmfmmmffffffmfmmmfmfffmmfmffmmmffffmmmmmfffmmfmmffmffffmmmfmffmmmfmffffffmfmmfmmmmffmfffffffmfmfmffmmfmmmffmmfmfmmmmmmffmmfmmmfmmmffmfffffffmfmffmmmfmfmfmfffmmfmmfmfmmfffmffmfmfmffmffffffmmmffmffmfmfmfffmfffmfmfmmmmfffmmmffmmmffffmfmmmfmmfmmmmmfmmmffmfffmmmmmmmfmmfmffffmfmmffmfmmffmmffmmmfmmmfffmffmffmmfmfmmmfmfmmmfmmfffmffmmmfmfmmmffmfmfffffffmfmmffffffmmfffmfmfffmmfmmfmmfffmfmffmfmffmmmmmfffmffmffmmmmfmmfmmffmffmmmffmmfmmffmmffffmfmffmmmfmffffffmffmffffmmmfmfffffmmffffffmfmmmfffmffmmmffmmmmffffmmmmmfmfmmmfmmmmfffmmffmfffmffmffmmmffffmmmffmfmmmmmmfmmffffffmfmfmffffmmmfmfmmffmmmffffmmmmmfmmffmfmfmfmffmfmfmmmmmmfmffffmmffmmmffffmfffffmmmmfffmmffffmffmffmmfmmffffmffmmmffmffmmmfmmmffmmfmmffmmfmfmffmfmfmmfmmmffmmmffmmfmfmmmmmmfffmfmmffffmffmfmmffmmffmmmfmmmfmfmfmmffmmfmffffmmmmmmmmmmmmmmmmfmfmmfmfmmfffmfmmfmmfmmfmmmffmmmmfmffffmmfffmfffmmfmmffffmfmmmmffffmffmmmfffmffmmmmfmfmfffmmmmmffmffmmmmmmmffmmfmmmffffmffmmmmmfmffmfmffffmfmfmffffmffmfmmmmffmffmmmffmfmffffmfffmffffmmmffmmmffffffmmmmffmfmfmfmffmmfmmffmfffffmmfffmffmfmfffmffmffmffffmfmfmffmfffffffmffmmffmfmfmffmffmmfmmffmmfmmffmmmmmffffmmffmmmfmmmmmffmfmmmmffmmmmmfffmfmfmmmmmmfmmmmfmffmffmmmmmfmffmfmmfmfmmmmfmmfmfmmffmmmfmfmfmffmfffmffmfmfmmmfffmffmmmffmmmmfffffmfmmfmfmfffmmfmmmmmffmfmmmfmmmmfffmmmmmmmfmfffmmfmfmmmmmmmfmmmmfmmffmmfmfmfmffmmmmfffffmfmmfmffmmmfffmfmmmmfmfmmfmfmmfmfmffffmffffmfmfmmfmmmffmfmmmmfffmffmmfmfmfmffmfffmffmmfmfmmmmmmffmfffmfmffmmfffmfffmfffmfmmfmfmmmmmmfmmmfmffffffmmfmmfmmmmmmmfffmmmfmmfffmfmfffffmffmfmfmmfmfmmffmfmffmmfmfffffffffffmmfffffmfmmmfmmfmmmfmmmmmfmmmmfffffffmmmmfmmfffmfmffmmmmffmfmfmfffmffffmffmfmmfmmmffmffmmmfmfmmmfmmmmfmfmfffffffmmffmmmffmfffffmfffmmmmmfmfffmmmfmmfmfmffmffmfmfmffmffmfmmmmmfmmmmmmfffmfmmfffmmmmffmfmfmfmmmfmfmmfffffffmmmfffmfmmfmmmmfmmfmmfmffmmmmfmfmfmmfffmmmmfmfmmmfmffffffmffffffmmffmffmmmmffmmffmfffmmfmfffffmfmmfffmffmfmfmmfmffmmmmfffffmfffffffmfmmmmffmmmfmfmffmmmfffffffmffmmmffmfmmfmffmmmmmfffffmmmmffmmffmfmmfmmmffmmffmffmmfffmmmfmmfffmmmffmmfmmmfffffmfmmfmfmffmfmmmffmmmfmmffmfmfmmmmfmfffmfmmfmmmffmmmmffmfffmmmfmmfffmfmmfmmmfffffffmfffmmfffmmmmffffmffmfffmffffffmmffffmmfmfmffffmmffffffffmmffmmmfffmmfmmffffffmmffffffffffmffmmmfmfmmmfffmfffmmmffmmmmmmffmfmfmffmfffmfmfmmfmmffmfmmffmmmmfffmfmfffmfffffmffmfmfffffffffmmmfmmfffmmfmfmffffffmfmmfmfmmmmmmfffffffmfffmmmmfmffmmfffmfmmmmmfmmfmfmffmfffmfmfmffffffffmffffmfmmfmfmffffmffmmfmmmfmmfmmmmmffmmfmffmmmfffmffffffmmffmfmmmmmffmfmfffffmmfmmfmmffffmmfmfmffmfmmmfmfmmmfmmffffmfmffmfmfmmfffmfmmfmfmfffffffffmmmfffmfffmffmmmffffmffmfmffmmffmfmfmffmmfmmmfmfmmmmmmmfmffmmfmfmffmmmfmmmmfmfmfmmmffffffmfmfmffffmmfffmfmmfmmffmfffffmffmfmmfmmfmfmmmmffmfffffmmffmmmffmfffffffmmmfmfmfffmfmmfmmfffffmfmfmfmmfmfffffmffmffffffffmmmmfmmffmfmfffffmmmfmfmmmmmmfmmmmffmffmmfmmffmmffffmmfffmfmfffmffmmmmmmmmmmmffmmfmmfffmmfmfmfmfmmffmmffmmfmmmmfmmfffmfmmmfmmfffmmmmmffmmfmfmfmmmfmmffffmmmffmmmffmmmffmmmfmfmfmfffffmmffffmfmfffffmmfffffmffffmfmmfmmmfmfmffffffffmmfffmmfmmffmmmmmmmmmmffmmmmmmmfmmfmmmmmfffmmmfmmfmmmmmffmmfmmmmfffmfmmfmffmfmmmmmmmfmmffmffmffmmffmfffffmffffmmfmmmmmffmfmmfmmmffffmmfmmmmmffffffmmmfmmfmmmfmmmmmmfffmfmmmmmfmfffmmfffmfmfmfffmmmmmffmmmfmfmmmfmfffffmfmmfmffmmffmfmmmmmffmfmfmmmfffmfmmmmffffmmmffmmfmfmffmffmfmmffmmmfffmmmmmmffmfmffffmmfmmffmffmfffmffmfmmffmmmmffmmmfmfffmfmfffmffmfmmffmffffmmffmfmfmfmfmmmmfmmffmffffmmmfmmffffffmmmmfmfmfmffffmmffmmmmfmfmfmfmmmfmmfmffmmmffffmmfffffffmfmmmffmmmmmffffmffmfmmfffmmmfmmfmfffmffmmfmffmmmmfmffmmfffmmfffmfmffffffmfmfmmmfmffffmmfmmffmmmmfmmmfmmfmmfffmfmmfmmfffmmmmfmmffmfmfmffmmffmmmmmmfmffffmffmffmmfmmmfmmffffmmfmffmmfmfmffmmfmmmffmmfmfmffmmfmmmmfmfmfmfmfmffmmmmfmfffmffmfmfffmfmmmmfmfmffmmmffmmmfmfmffmmmmfmmmfmfffmmfmmffmfmffmffmffmmmfmmmffffffffmmmfmfmffffmffmfmmfmfmffffmffmffmmmmfffmmffmmmffmmfmmfmmfffmmfmmmfffffmmmmmffmmmmmfmffffffmfffffmffmmfffmmfffmmmmmffffmmfffffmmfmfmfmmmmmmmffffmmmffmffffmmmfffmmmffmmfmmmfmmfmmmmmfmfmmfmfmfffmmmmmfmmffmfmfmmmmmfmmmmffmmmmmfmfmffffffmmffmffmmfmmffmfmfmfmmfmmmmmfffffmfffffmfffffmmmmffffffmfmffmmmmmmfffmmmfffmmfmfmmfmmmmmmfmfmfmmmfmmmmffmmfmfmfmffffmmfmmmmffmmfmfmffmfffmffmfffffmfffmmfffmfffmfmmmffmmffffmmfmmmmmfmffmmmmfmfmmfffmfffmfffmmmfmmmffffmmmmfmfffmfffmmfffffmmfmmmmmmmmfffmffmmfmmmmmffmmmmfmmffmffmfmffmfmffmmffmfffmfmffmffmfmfffmfmmfmfmmmmfmmmmffmmfmfmmmmmfmfmmfmfmfmffmmmfmffmmmmmffffmmmmfmfmfmffmmmfmmmmmmmmmmmmfmfmfmffmmmfffmmmffmmmffmffmfmfffmmmffmmffffmmfffmmfmmfmmmmfmffmmffffmmfmfmmffmfffffmffffmmfmfmmffmfffffffffmmfffmmmmfmmmmfmmfffffffmmmmfmmffmmmfffmmfmmfmffmmmffmmmfmffmmmmmmffmmmmffffmffmmmmmfmfmmmmffmmfffmfffmmffffmfmmffmfmmmffmmmmfmfmfmfffmmffffmmmmffmfmmmmmmmmffmmmmffffmmffmmmfmfffmmfmfmfffmmmfmfmmfmffmfffmmfmmfmffmfmfmmmffffffmfmfffmmmmffmmmmfmfmmffffmfmmfmffmfmmmffmfmmmmmfmfmfmmffmmmmfmmmffmfmfffffmfmmmffmmmmfmfmmffmmfmmmffmffmmmfmfmmffmfffmmfmfmmffmffffmfmmmmfmmfffmmmmmmfffmffmmmfmfffffmmffffmmfmmffmmffmmmmmfmmmmmmffmmfmmmmmfmfmfmfmfmmfffffffmfmffmfffmmmmmffmfmmmfmffmffmmmfmfmmmmfffffmmfmfmfmmffmfmffmmffffffffmmmmmfmfmmmfmfmmmmmffmmffmmfmffmfmfffmmffmfmfmmfmfmmfmmmmfmmmffffmfmmfmmmfmmmmfmmffmfffmfmfmmfmfmmmfffmmmffffmmfffmmfmffffmmmfmfmmmfmmmmmmmfmmffffmmmmffmfffmmffmmmmffffmffffmmmmfmmmfffmmmffffffmfffmffmfmmmfmfffmfmffmffffmmfmmmfmmffmfmmmmfmmffmmffmmmmmfffmfffmmfmmfmmffffmfmffffmffmfffmmmmmmfmmfmffmfmmmmmfmfmmmfffmffmfmfmffffmfmmffmmmffmmffffffmfffmmfffmmmfmmfmfmfffmmfffmfmmmmmffmmffmmmmfffmmmmffffmmmffmmfffmfmmfmfmfmfmmffmfmfffmffmffmfmmffmmmfmffmfmmfffmfmmfmmmmffmmfmfmmmfmfmmfmfmfmmffmmmffmfmmfmfffffmmmmmfffffffffmmmmffmmmffmmfmfmfffmfmfmmffffmfmfmmmffmffmmfmmffmfffffffmfffmfffmfmffffmfmmfffmffmmmmmmffmmfmfffmffmmmmfmmfmfmmmfffffmmfmmffmmffmmffmfffmfffmmmmmffmffffffmfmmmmmfmmmfmmmfmfmfmmmmmfmfffmmffmmmmmffffmmfmmmmmfmmffmmmffmffffmfmffmfffmmmmmmmmfffmfmfmmmfmmfmmffmmfmfmmmffmfmffmmmmfffmmmfffmmffmfmffmmmmmfffmmfmfmfmfmmffmfmfmmfmfmfmmffffffmfmmmfmmmmmfffmffmfmmffmfmmmmfmmmmffmmfmfmmfffffmfmfmfmfmmfmffmfffmmfmmfffmfffmmfffmmffmfmmfmfffmffffmffmmmfmffmffmmmfmfmfmmfmmmfffmmmmffmmmmffmmmfmfmmfmfffffffmmmmfmfmmmffmmfffmmfmffmffmmmfmmmfmfffmmfffmfmmffmmmfmffmmmfmmffmfmmmfmffmfffmffmmfmmfffmmfmmmmfmffmffmfffffmffmmmmmmfmmffffffffmfffffmffffffffmfmmmmfmmfmfffmffffmfmfmmfmffmmffmmffmfmmmfmmfmmfmmffmffmmmffmfmmmmffmfmffmmffffmfffffffmfmfmmfmffffmfmmffffmffmfmmmmmffmmfmffmfmmfffmfmmfmmfmffmmfffmmmmffmmmmmffffffmmfffmmfmmfffmffmmfmmmfmmmmmffmmfmffffffmffmfffmmfmffmfmmffffffmffmmmfmmmmfmffmmmmmmfmfmmffmffmmffmmffmmmmmfffffmmfmmffmmfmffmfmfmmmfmffmfffmfmfmffffmffmmfffmfmffmfmmmmmmffffffmfmfmmmfmmfmmmffmfmfmffmmmfmmfffmfffffffffmmmffmfmmmmmmfmffmffmffmfmffmmmmmmffffmfmmmmffffmffffffmmmfmfmfmffmmfmfmmmmfmffmmmmmffffffffffmfmfmfffffffmffmmffmfmmfmmmmfffmmfmffffmfmmfmffmffmfffmmmffmmmfmffmmmmmfmfffmmmmfmmfmmmmfmmfffffmmmmmmmmfmmmfmfmmfffmmmmffffffmfmmmffffmfmmmffmmfffmmfmmfmmffmfffffffmmmffmffmfmmmfmffmmmfmmmmmffmffmmmmffmmmmmmfmmfffmmmffmfffffmfmfmfmffmfmffmmmmmmmmmmffmmmffmffmfmmfmmfmffmffmfffmfmfffmmmffmffmmmfmfmffmfmfmmmffmmfffmmfffffffmffmfmmfmfmfmmmmfmmffmmmffmfmmmfmmfmmmmmfmmmffmffmmmfmmmmfmmmfmfmffmmfmmffffffmffmfmfmmmfmffmmmmmmmmmfmfmmmmmfffffmffffmmmfmffmmmfmmmfmmffmfmmfmfffmfffmmfmffmmmfmfmmmmmfffmmmfmfmmmffmmmmffmffffmmmfmffmmfffmmmfffffmfmmmffffmfmffmmfffmffffmmmmfmfmmffmfmffffmfmmffmmfmfmmfmfmfmffmfmfmmffmfmfffffmmfmmmmfffffmmffmmmmmfmmmfmmmmmmmffmmmfmfmfmfmmfmfmfmmffmmmffmffmfmfmmmffmmfffmfmmfffmmmmmmmfmffmffmmmmmffmmffmfmffmfmffmmmfmfmmmmmfmmffffmmfmffmmmfmmmfmffmmffmfmfffmfmmmfmfffmmffffmmfmfmmfmfmmfmffmfmmffmmfmmffmmfmffmmffmmmffmfmfmffffmmfmfmfmfmmmmfffmmmmmffmmfmfmmmmffmmffffmfmmfmmfmmffmfmfmfmfffmmmmfmmffmfmmfmffmmfmfmfmfffffmmfmfmfmfmffmmfffmmmffffffmfffmmfmmfmmmfmffmmffmmfmmmmmmmffmfffmfmfffffmffffmmmffffmmffmmffmmmmfffmfmmfmfmfmmfffffmmmfmfmfmfmffmffmfmfmmfmmmmmfmmfmmmmfffmfmmmmffmmfffmfmfmffmmmfffmffffmmfmmffmmmffmmmmfmmmfmfmmmfmffmmffmfmffffmmffmfffmmfffmfffffmmmmmmmfmmmmffmfmmfmfmmfmfffmmfmfmmmmmmfmfffffmmffmmfmmfmmfmffmffmfmfffmmfffmfmmmffmmmmmfmffmffmmmfmmffmfmmmfmfffmfmmfmfmmffmffmmmfmmfmffmmfmmfmffmmffffmffmffffmmmmfmfmmmffffmmmfmfmffmffmfffmmfmfmfmfmffmmfffffmmmmmfffffmfmfmfmfffmmfffmmfffmfmfffmffffffmfmfmffffmmfmmmmfmmfmmfmffmmmfffmmfffffffmmfffmmfmfmmfmmfmfmmfmfmfffffmffffmmfmfmmmffffmmmfffffmffmmmmmffmfmfmfmfffmmmmmmffmmfmffffmmmmmfmmfmmfmmfffmfmmmfmmfmmfmfffmfmfmffmfmfmfmffffmfmmmfmmffmfmmffmfmffmmmmffmmmmmfmmfmmffffmmmffffmmmmfmfmffmmmmfmffffmmmfmffmmmmmmffmmfmfffffmfmmmmffffmmmfmffffmfffmffffmffffffmmmfmfffmffffmfmfmmmfmfmfmmfffffmfmfmmfmfmmfmfmffmfmfmmfmffmmfffmmfmmfffmmmfffmfmfmmmmmmmmmmmffffmmmfffmmfffmfmmfmmffmmfmfffffffmffmffmffffffffffmmffmmmffffmmfmffffffmmfffmmffmmfffmfmmffffmfffmfmfmfmffmmffmffffmfmmmmmmfmffmmmmmmmmffmmmmmmfmmmmfmfmmfffmmmmfmmmffmfmmmmfmmffffmmfmmmmfmmfmmfmffmfmmmmmmfffmmmfmffmffffffmfffmmfmfmfmmmmmmffmfmmfmmfmmfmffmfmfmmmmmffmfmfmmmfmffffmmffffmmmmfffffmmmffmmffffmmmfmfmfmmmfmffmffffmmmmfmfmmfffmffffmffmmmfmffmfmfmmfmmmfmfmfmffmmmmmmmffmffmfffmmfmfffmmmfmmmffffmmmffmmfffmmfmfmmmmfffmmffmmfmmmfffmmmmfmfmmfmmffmmfmfmffffmmfmmfffmfffmmmfmmfmmffmffffmfmmmffmfffmmmffmmmfmmmfmffffmmmmfffmmffmmmfmfffmfffmfmffmffffmmmffmmfffffmfmmmfffffmffffmmffmmmmfmfmffmmmmmfmmfmmffmffmffmmffmmfmmmffmmmfmmmfffffmmmmfmmffmmmmffmmfmmmmmfmmffmfmfmfffmfmfmfmmffmmffffmffmffmfmfmmmmfmmmfmffmmmmfmffmfmfffmffmfmfmffmffmmmmffmmffmmfmfffmffmmmfmmmfmffmffffmfmffmmffffmfmmmffmfmmfmffmmffmmmmffmmmfmmfmfmmffmmffffmmmffffmfmmfmmmmmmmmmffmmmmmfffmmmfmffffffmffmffmmfffffmfmmmfmmfffmffmfmfffmffffmffmfffmfmmmfffffffmmffffmfmmffmfffmfmmmmfmmfmfmffmfmmfmfmfffmfffmmfmmfmmfffmffmmmfmmffmmmmmmfffmfmfmmfmmmmffmfmmmmmmmfmmfmmffmmfmfffmfffffmmffffmmfmfmmmfffmmfffmmmmmfffffffmmffmfmfmfmffffffmfmmfmffmffmmffmmmfmfmmfmmfmffmmfmmfmfmmmmfmmmffmfmffffffmmmmfmfmmmmfmfmmmfmmffmffmmmfmffmffmmfffffmmmmfmfmffmfmfmmmmmmfffmfmfffmmfmffffmmffffmfmmffmfmfffffffffmmmmfffmmmmmmmmfmmffmfmmfmmmffmffffmffmfmfffffmmmfmmmmmfmfffmmmmfmfffmffmfmffmffffmfffmmffmmffmffmmffmfmfmfmmmffmmmfmfmfmmmfmmmfmfmfmfmfffmmmfmffffmmmmffmffffmfmfmmmmmmmfmmmfffmffmfmmffmmmmfmmfmfmmmffffffffffmmfmfmffffmfffmfmfffffmmfffffmmmfmmfmmmffffmmfmmmfmmffmfmffmmmmmmmmffmfmffffmffmfmfmmffmfmmffmmmmffffmfmmffmfmfffffffmmmfmmffmffffffmmmmmfmfmmmfffmffmmfmmfmmmfffmffmmmfmmmmfmffmmmfmmffmfmmmmmmmfmfmfmffffmmffmmmmfmmffffmmmmfmffmffffmfmmfffmmmfffmmfmmmfffmmmfmmfffffmffmmmffmmffmffmmfmfffmffmfmffmffmmffffmmmmfmmfmfmfmmfmmfmfmfmfmfffmffmmffffmfffmfmffmffffmffffmmmmfmmmfmmfmmmfffmffffmmmfmmffmmmmfmfmffffmmmmfmmfmmmfmmmmmmffmfmffffmmfmmmmfmmmfmfmmmmfmffffmmfffmfmmmmffmfmmmmmmfmmfmmffffmmfmfffmmffmmmfffmmfffmffmmffmffmmffmmfffmmmfffmmffffmmfffffmmfmffmffmmmmmfmffmfmmffmmmmmfmffmfmmffmffmfmmmmmmffffmffffffffmmmfmmmfmmmmmffmfmffmmmmfmffffmmffffmfmmmmmffmmmmmmmmmmmfffmmmmmfmmfmmmfmmffmmfffffmmfmffmffmmffmffmmffmffmmmfmfmfmmmfmmffmfmmfmfmmmmmmfmffmffmmmmffmfmfmmfmfffmfmmmmfffmmmmmmmmmfmfmmmmmmffffmfmfmmfmmfmfmfffmmffmmmmmmfffmffmfmmmmffmfffmmmfmfmmffmfmfmfmfffmfmmmmmfffmmmffmffmfmffmmmmfffffmmmfmmfmmmfmmmmfffmmfmmffffmmfmmmmmfmmfmffmmmmffffmfmmfmmmmmfmffffmfmfmmmmmmmffmmfffmmmfffmmfmmmmmmfmfffffmfmmmmmfffmfmmfmffmfffmmmfffmfmmmmfmfmffmfffffmfffffffffffmfffffmfffmmmffffmmfmfmmfffffffffffffmfmmffmmmfmmfmfmmfmmmffmfffmfffmfmmffmmfmmfmffffffmmmffffmmmfmmfffmfffmffmfmmffffmfffmmfmmmmfffffmfmmmmfmmffmfmmmffmmffmffmmmffmfmmmfmffmfmfmfmfmmfmmmmfmmfmmfmmmfmmfffmfffffmmfmffmfffmffffmfmfmmmffmffmmmmfffmmmfmmfffmmmmmmfmfmmfmfffffmmmffmmffmffffffffmmmmmfmffmffmfffffmmmmffmfffmmmmmfmfmfffmffmfmfffmffmmffmffmfffmmmfmffmffmffmfffmfffmfmfmmmmffmmmmfmfmfmfffmfmmmmmmmffmmfffffmfmfffffmmfmfmfffmmmfmfffmmmmmfffmmfmmfmfmffmmfmffmffmffmmfmfffffmfffmfmmmfffmfmfmffmmmmmmmmffmmmfmfmmffmmmmfmfmfmfmfmmmmmfmffmfmmffmmfmfmfmmmffffmffmmffmmfffmmfmmfmmfmffmmmmmfmmmfmmfffmffffmfmfmffmfffmmmfmmfffmmmmffmfmmmmmfmfmffmffmfffmmmmfmfmmffmmffffffmmfmmmmmfmmfmmffmfmfmfmfmmmffmfmfmfmmmfmmfmfmffffmmfffffmffmmffmfmffmmfmmmmmmmfmffmffmmmffffffmfmffmmfmmmfmmfmmffmmfmfmfffmfmfffmfffmfffmfmfmfmfmmmffmfmmffmffmmmffmmmfmmffmfffmmfmfffmffffmfffffmmmmfmmfffmmmfmmfmfmmmfmfmmfmfffmmmmffmmfffmffmmffmmfffffmffffmmfmmfmmfffmmffmmmmfmmmffmffffmfffffmffffmfmfmmmffmmmfmfffmmmfffmfffffmmfmffmmfmmmffmffmmmmmmffmfmmmffffmmfmmfffmmmfmmmmfmffmffffmffffmmmmmmmfmfmfmmmfmfmfmmfmfmfmmmmffmfmffffmmfffmmffmfmmfmmfmmmffmfmffmmfmffmmmfmmmfffmfmffmfmmfmffmffmffmfmmfffffmfmffmfmmfffmmfmmffmmfmmfmfmfmffmmfffmmmmmffmfmmmfmfffmmfffmmmmffmmfmfffffmfmfmfmfmmfffffmfmfmfffffffffmmfmmfmffmmmfmfmfmmmmmmffmmfffmmmfffmmmmfmmmffmmmffmmfmmfffffffffmfmmffmmmmmmffffmfffmffffmffffmfmfmmmmfmmmffmmfffmmffmmfmffmfmffmmfmmmffmmmmmffmffffmffmmmmfmfmfmfffmffmffmfmfmmmfmmmmfmmfmmmmffmmfmmmfmfmfmfmmmfmfmfmffffmmmfmfmfmmmmffffffffffffmffmfmffffmmmfmfmffffffmmmmfmfmffmfffmmfffmfffmffffffffffmfmmfmmfmmmffffmfmmfmffmmfffmfmfffmffmmmfmmfmfmfmmmfmffmfmfmmffmmmmffmfffmmfmmmfmmfmmmmffmfmfffmmmffmmmmfmmmfmmmfffmffffmffmmmmmfmfffmmffmfmfmfmmffmffmffmffmmmfffmmfmfmmmffmffmmfmfmmfmmmfffmmfmfffmmmffmmmffmmfmmffmfmffmmfmfffffmmfmmfmfmfmfmfmmmmmffffmffmffffmffffmffffmfmmfffmmffmffmmmmffmfmmmfffmfmfffmmmfmmmffmmmfmmmfffmmfmmmmfmmffmmmmfmfffmfmmfmfmfffffmfmfmmfmmmmfffmmfmfffffmfmfmfmmfffffffffmmmmmmfmfmfmffmfmmffmmfmffmfffmfmffmfmmffmffmffmmfffmmfffmmfmffmmmfmmffffmffmmfffffmfmfmfmffffffmmmmmffffmfffmfmmffmmmfmfmfmffmffffmffmfffmfmmmfmmmfmmfmmmfmmmmmmmffmmffffmfmmfmfmfmfmmffmfmfmffffmfmmmmmffmfmfmfffmmmfmmffmfmmmmmmfffmfmmmffffffmmffffmfmfmmfmfmfmmfmmfmmmffmfmmmmfmffmfffmmfffmmfmfmfmmfffmmfmmfffffmmfmfmfmmfffffmfmmmmfmmfmfffmmmffmffmmmfffmfmmmmmfmfffmfffffmmffmffmmfmfmfmmfmfffmmmmmmmmffmfmffmmmfmffmmfmfffmmmmmfmfmfffmmmmmfffffffmmmfmmmffmmffmmfffffffmmmffmmmffmmffffmfmmfmffmfmmmfmmfmmmfmfmmffmfffmmffmffmfmffffffffmfmmmfmffffmmmfffmmfmfmffmmffffmmfmmmmffffmmffmffffffffmmmfmmmffffffmffmffmmmfmmffmfmmfmfmfmmffffffmffmmmfmfmmffffffffmfmmfmmffmmfmmfmffmffffmmfmfmfffmffmmffmmffmmffmfmmfmffmfmmfmfmmmmffmffmffffmfmmmmmfffffmmmmmmfmmffmfmmfmmmfffmffmmmmfmffmfmmmmfmfffffmmfmmmmmffmmmmmfmfmffmmmfmmmfmffmmmfmmfmmmfmmmmfffffmfmffmmmmmmmfmfmffmfmfffmmmfmffmffmfffmmfmmmmmmmfmmmfffffmmmmmmffmmmmmffmmmmfmfffmfmfmfffmfmffmfmfmmmffffmmmmffmffmffmfmfmfffmmmmffmfmffffmfmffmfffmmmfmfmfmfffmmmmfffmffmfmffffffmfmfffffmmmmfmmmfffmmfffmfmmfffmfmfffmffmfmfffmmffmffmmmmmmmmmfmmmmmmffffmmmmfmmmmmfmfmmffffffmmfmmfmfffmfmmmmmmmmmmmffmfmffmfmmfmffffmfmmmfffmmmfmfffmmmfmffmfmmmfmmmmffffffmfmfmmmfmmmfmfmffmmfffmmfmffmmffmmmffmfmffffmffffmmfmfmffmffffmmmffmmmffmfmmmmmfmfmmfmfffmmffmmmmmmffmffmfmfmfffmmfmmffffmmmmffmmmffmfmffmmmmffmffffmmmmfmmfmmmfffmmffmffmfffmmfmmmmmffmmmffmfmfmmmmffffffmffmfmmmfmfmmmmffffffmfmfmmffmmmfffmfffmffmfmmmfmmfmfmmfmffffmmmmmmmmfmfmmmmmmffmffmfmmfmffmmmmfmmmmmfmmfmmfmfffmmmmmfmffmmfmfmfmffmfffmmfmfmmmfffmfmfmfffmfmfmfmfmmmffmffffffffffffmfmmfffmfmfmffmmmmmmmfffmmmffffmmmffmmmmffmmfmffmfffffmfmfffmfffmmmfmmmfmmffmmffmmffmffmmmmmmfmffffffmmmmfmmfmffmfmmmffffffmfmmmmfmmmfmmmmfmfmmmffffffmmmfmmfmmmffmfffmfffmfmmmmffffffmffmmffmmmmmmmmmfmfmffmfffffmmfmmfmmmfmfmffmmffffffmffmmmmmfmfmmffmmmmffffmmmfmffmffmmfmmfmmfmmmffmfmmmmmffmfmfmfffmmmfffmffmfmmmfmffmffmffmmfffmmfmmfmffffmmfmmfmmmffffffmmfffmfffffmfmfmffffmmfmffffmmfmmmmmfffffffmffffmfmmfmmmmfmffmmfmmmmfffmmfffmffffmmmmmmffmmmmmfmffmmmfmmmmffmmfmmfffmfmfmffmfmffffmfmfmmmmffmffffffffffmmmmfmfmfmfmfmfmfmfmmfmfffmmfffffmffffmfffffmfmffmffmffmmmmfmmmffmfmfmmmfffmfffffffmfmffmfmfmfmfmmffmmmffmffmmmmmmmfmffmmffmffffmfmmmffmfffmffffmmfmmfmfmmffmmfmmmffmmmffmfmmffmffmffmmfmmmfmffffffffffmffmmfmfffffmfmffmmfmfmmmfmfmfmmmmfmmmmfmfmfmfmffmmfmmfmfmmffmfmfmfmmmmffmfmfmfffmmmfffmfffmfmmmfffmffmmmmfffmfmmfmmmmffffmmmmfmfmfmmmffmmmfffmmmfmmmfmffmmfmffmmmmffmmffmfmmmfmmfmffmfmfmfmmfmfmffmmfmfmmfmmmfmfmffmfffmmfmffffmffmffmmmmmmffmmfmfmmffmfmfffmffmfffmffffmmmmfmfmffffmffffmfmmmmmmmffmmmfmfmmfmmffmffmmmfmmfffmmmmfmmmfmmfmmfmfmffmmmmmfmmfmmfffmfmfmfmfffmmmmffmmfmfffmfmmmffmmmmmfmmmffmfmffmfmfmmffmmmfmmmmmmfmfmmfffmfmfmmfmmmffmfmfmmfmfmffffffmmmmfffffmffffmffffmfffmmmmfmmffffmmfmmfmfmffffmffmmfmffmfmfffmmmmffmffmffmmmmmfmmfffmmmfffffmmmfffmmfmmffmfffffmfmfmmmmmmfmmmffmffmmmffmmfmmffmfffmmmfmmmmffmmmmfmfmmfmmmffmmmmmfmffmmffmfffmmmmfmfmfmfmfffmmfmmmffmfmmfffffmffmfffmmfffmfffffffffmmmffffmmmfmmmmmmmmmffmfmmmmfmmmfffffmffffmfmfmfmmffmmfmmmmmmfmmffmfmmmfmmfmfmmfffmffffffmmmfmfmmfmmmfmmfmmmffffmffffffmfmmmffffmmfmmffmfffmmmfmmfmmfmmffmmmmmfffmmffffmfmmmfmmffmfmffmfmffmmfmfmfmmfmfmfffmfmfffmmffmffmmfmmfmfmmffmfmmfmffmmmfffffmfmfmffmfmmfmmfffmmmmmmmfmmfmfffmfmfmmffffmmmfffffmmmmmmmfmfmfmmmffmmmmfmmmfmmmfmffmmfmmfmfmfmmmfmffffffffffffmffmffffffmfmmmfmmfmfmmmfmfmmmfmffmfmffmfmfmmmmmffmfmfmmfmmfmmfmmfffffmmmfmmmffffmmfmfffmfmmfffmmffmmffmffmmmfmffmmfffffmmmmfmfmfffmfffffmfmmmfmmmfmmfmfmfmfmmfmfmmmmfmfmmmmffmfmmmmmffmfmfmffffffmfffmfmmffffmmfffffmfmffmffmfmmmffmfmfmfmmfmmfffmmffmfmmfmmfmfmffmmmmfffffmmmmffmmfmfmffmfmmmmfffmfmfffmmmmmmfmfffmfmmmfmmmmmfmfmmmmmffffmfmfmmfmmmffffmmffmfmffmffmmffffmmfmmmfmfffffmfmffffffffmmfmmfmmmmmffmffmmfffffmmfmmmfmmffmfmmffmfmmmmffmmfmfmmfffmmmffmmmmmffmmffmmmmmfmffmmmmmmfmmmfmfmfmfmmffmffmfmmfffffffmmffmfmffmfffmmffmffmmfmffmffffmmmmfffffffmmfmffffmffmffmfmmfffmmffffffffmmffmmffmmfmfffmfmmmmmfmmmmmmmffmfmmmfffmmfmmfmffmffmffmfmmfmfmfmffmmmfffmffmffmmfmmmmfmmffffffmmfmffffffmmmmffmmfmfmfffmmmmmmmmmffffmffffmmffmfmmffmfffmfmffmfmmmmffffmmmmfmmffffffffffmmfmmmffmfmmmfmmmffffmfmffffmffmmfmfffffmffmmmmfmmffmmffmmmmmffmfmfmmffmffmmfmfmfmmmmfmfffmmfmmfmfmffmfffmffmmmmfmfmmffmfmfffmmmffmmffmfmfmfmfmfmmffmmmfmfmmmmmfmmmmmfmmfmfmffffmmmmfmmmmfmmfffmmfmffmmmffmmffffmfmffmffffffffffmmmffmfmmffmfmfmfmmfmfmmmfmfmmmmmfmfmmffmmffffmmffmfffffmfffffffmmmmmfmfmfmmffmffmmmffmmmfmmmfmfffmmfffmfffffffmmmmfmmfmmfmmfmfmmmfmmffffmmmffmmmmmfmmmfmfmffmmffmfmmfmffmfmfmmffmmfmffmfmmmfmffmfmmffmmfmmfmmfmfmfffmfffmmmmfmmmmffmmmmfmfmfmmfffmfffmmffffmfmmmffmmffmmmmfmmfmmmfmmmmfmmmffmfmmmmmfmfffmmmfmmmmfmmffmmmmffffmmmfffffmfmmffffmmmmmmfmffffmmffmffmmfmffmfmmmmmmfmmffmfffmmmmmmfmmffmffffmffffmmmmmmfmffmffmfmmfmffffffmffmmfffmmmmmmmmfmmmmmmmmmmmffffmmmffmmffmmmfffffmfmmmmmffmfmmffmmmmmfmmmmmfffffffmmffmmffmmfffffmfmfmmffffmfmmmfffmmffmffmffmmffmffffffmffffmfmfffmffmmfmmmffmfmffmmmfmfmfmmmffmmmmmmmmfmffffmmfmmmffmfmffmfmmmmmfmmmffmffmmfmfmfmffmfmfffmfffmmffmmffmmmfmmmmmmmffmmfffmfmfmmfmfmfmmmfmmmfffmmmmmfmfmmmmfmmmfmmfmfmmfmffmmmfmffmmffmmfmmfffmfmfmmmfffmffffmfmfmfffmmmmmfmmmfffmmmfmfmmmmmmffffmmmfmfmmffmffmffmmfffffmmfmfmmfmmmffffmfffmmfffffmmmmmmmmffmfmfmmmmfmmmfmfmmmmmffmmmmmffffffmfmfmmmmmfmfffmmfmffmmmmmfffffffmmmmfmmmffmmfmmmffmffmffmmffffmmmmfmmfmmfmfmmfmmmmfffmmfmmmmmmmffffffmmfmfmmmmmfmmffmfffffmmmmfmfmffmfmffffmmffmmffmffmfmmfffmmfmfmfmmmmfmmmfffffffmmfmffffmmfmmmmmmmmmfmmmmffmmfffmffffmmfmffffmfmmmmfffffmfmfmmmmfmfmfmmmfmmfmfmfmmmfmfmmmfffmfmffffmfmmmffmfmfffmfmmmmmmfffmmmfmmmffmmmmfmmmfmfmmfffmmfffmffmfmfmmffmmmmmffmffmfffmfmfmfmffffmfmmfmffffmmfmfffmmmmfmmmmffmmmmffffmmfmmmffmfmmmmffmmmmmfmffmmfmfmmfffmffmmfmmmffmmfmmmffmmfffmmmffmmffmmmffmfmmffmmmfmmffffmmmfffmmmffmmffmfffffmmmmffmfmfmmmmmffmmfffmmffmmffmfmmfmffffmffffmmffffmmmmmmmmmmmfffmfffffffmffmmffmmfmmmmmffmfmmmmmffffmmfffffmfffmfmfmmffffmffmmffmmfmmfffmfmfmfmffmffmmmmfmmmfffffmmfffmfmmmffmmmfmmfmffffmfmffmfmfmfmmmffmmmmmmmmffmfmmmfmffffmmfmffmfmfmfmfmfffffffmmmfmfffmmffmmmmffmffmmfmmffffmmmmmfffffmmmfffmffmmfmmfmmfmfmffffmmfmffmfmmmfffmmmmmmfmfmmfmffmmfmmmfmmmfmffmffmffmfmffffffmffffmffmfmmffmmfmffffmmmffmmmmmfmfmmfmmfmfmmmffmmmmffmfffmfmffmmmffmfffffmfmmmmmffmfffffmmmfmfmmmmmfmmmfffffmmmffmfmfmfmmffmmfmfmmmmmmmmmmmffmmmmfmmmmmfmmfmmfffmmfmmmmmmfmffffmfmmfmfmffmmfmfmfmmmffmfmmmmmmmmmfffmmffmffmmmmmmmmfffmmmfffmmfmmmmfmfmfmfmmffmmmmfmfffmmffmfmfmmmffffffmfffmmmfffmfmfmmfmmfmfmmfmfmmmfmffmffffmmfmmmffmmffmffmffffmffmmffmmmmffmffffmmmmffmffmfffffmmfmmfmffmmmfmffffmffmmffmfmfmfmmmffffmffmfmmmmmffmmfmmmfmffffmmmmmffmmmmmfffffmmfmfmmfmffffffffffmmmmfmfmmmmffmfmmmfmmfmffmfmmfmmmmmfmmmfmmmfmfmffmffmfffffffffmmmmmmmfffffmmfffmmmmmmmmmmmmmffmmmfmmmfmfmfmmmffmfmfmmffmffmfmmmmmfmffffmmfmmfmmfmfmmmffmfmmffffmmfmmmfmmmmffmmffmfffffffmffffmffmmmfffmfmmmfffffmmfmffffmmffmfmffmmmfmfmmffmmfmmfffffffmfmmfmmffffffmfmmfmmfmfmmmfmmmmfmmfmmmffmfmmmmfffffmmfmmmmmmmmmfmmfmffmmmffffmfmfffmffmmmmmfmfmfffffmffmffmmffmmfmfmmfmmmmmfmfffffmffmfmmffmmffmmmmmfmmmfmffmffmffmfffffffmfmmmfmfffmmmmmffmfmmfmmmmffffmffmmfmffmfmmmmmfmmmfffmmmmmmmfffmfmfffmmmffffmfmffmfmmffmmffmmfmmmffmfmmffmmfmffmfmmffffmfmfmfffmfffmfmffffmmffmmmmmfmffmmfffmmfmmfmmmfffmmfmfmfmmffmffmmmmfffffmfmffmfffmffmfmfmmmmfmfmmffmmfffmmmffffmfmmmfffmmfmmmmmmmfmmffmfmffffmmmffmfffmmffffmffffmffffmmmmmffmmfffmffmfmmmffmmmffffmmffmfmmmfffmfmmfffffffmffmfmmfmmmmmmfffmmmfmmfffffffmffmmffmfmffmfmffmfmfffffffffmmfmmfmmffmffmfmmfffffmmmmfmmmmfmffmmmfffffmmfffffmfmfmfmmffmfmffffmmfmmfffffmmmffffffffmmmfmfmmmfmmfmmmfmfmffmmmmmfmfmfmfmmmmmmmfffffffffmffmfmfmffffmmmffffmmfffmmmffffmmfmmmffmmmfffffmmfmmmmmmffffffffffffmmmmfmmmffmmmmmfmmmmmmfmffmffffmffmmmmffmfmmfmmfmffmfmmmffmffffmfmmfmmfmffmffmfmfmffmmmfffmfmffffmfmmmmffmfffmmffmmfmmmfffffmfmfmmffmmmfmmmfmmfffffmfffffffmmfmmmmmmmmfmffffmmmmmffffffmmmmffmffmmfffmmfmmfffmmmmmmmfmmmfmfmfmmfmffmffmffmmfmmfmffffmffmmmmfmfmfmmmffffmmfmfmfmfmfmmmffmffffmmffffmfmfmmffmffmmffmfffmmmffmmmmmfmmmmmfmmmffmfffmmfmmmmfffmfffffmfmfmffffmmfmfmfffmfmmmmmffmffmmmmffmmffffmmmmmffmfmffffmfmmmfffmmmmfffmmfffmmfmmfmmmmfffmffmmmmmmmffmffffmfmfmmmfffmfmffmmmmmmfmmffmfmffmmmmmmfmmmmfmffmmfmffmfmmfmfmmmmmffmmfmffmfffffffmffffmmffmffmfmmmmmffffffmfmmmffmfmfmmmmmmmfmfmmfffffffmfmffmfmmfffmmmfmmffmmmmmmfffmffmfmffmmffmffmmffmffmfmmmmmffmmmffmffmffmfmfmmmfffmmffmmmmmffmffmmmffmfffmffmfffmmmffmmmmmmffffffmmmfmmffmffmmffmffmfmfmmfmffmffmffmmffffmmffmmffffmfmfmfffffmmffmfmffffmffmfmfmfmfmfffmmmmffffffmmfmmmmmffmmmfffmmmffmmffmmmfmmffmfffmffmfmffmfmmmmfmmfmfmmmffmffmfffmmfffffffmmffffmffmmfffmfmfffmmmfffmffmfmmmfmmmmffffmmmmmfmffmffffmmmmmffffmfmmfffmffmmffffffffmmfmmmfmffmfffmfmmfmffffmfmmfffmfffmfmmfffmmfffmfmffmmfmmmfffffmfffmmffffmffmfmmmmfffmfmfmfmffmffmmmmfmmfmmmmfffmfffmmmffmmfmfmmmmffmmffmfffmfmfffmmmfmfffmmmfmmmmmmmmmfmfmmffmfmmmmfffmmfmfmmmmfffmmmmmmfmfffmmmmmfmmmfmmmffmmmfffffffmmmmmmfmmfmfmffmfffffffmmfmffmmmmmmfmfmmmfffmmffmmmmfmmmfmfmmffmfmfmffffmffmfmmmfmfmmmmmfmfffmmffmmmmmmmmmfmfmmfffmmmmffffmffmmfmmmmfffffmmmffmmmfffffmfmmmfmffffffmmmfmmfmffffmmfmmmmmfmmmffmmfffmffffmfffffmfmfmmfmfmfffffmmffmfffmffmmffffmfmmmmmfmffmmfmffffmfmmfffmfmfmfmfmmfmmfmmmffmfffffmfffffmmmfmmfffmfmmfffffmmfmffmfffmfmfmffmmfmfmmmmfmmmfffmfmmmfmfffmfmmmffmffffmfffmmfmmmmmfmmfmmfffffffmfffmfmfmffffmfmffmfffmmfmmmmmfmmmfmffffffmfmfmffmmffmfffmmfmfmmmfmmfffmmmmfmmfmmmfmfmffmmmmffffffmmmffffmfmffmmfmfmmfmmmmffmffmfmmfffmfffmmfffffmmfmfmfmmfmmmmmmmfffmfmmmfffmmmmffmmfmmfmfmffmffmfmmmfmfmmmmfmmmffmmfmmfmffmfmffmffmffmmfffmfffmmmfmmmmmmffmfffmfmmmmffffmffmffffmfffmfffmffffmfmmffmmfmfffmmfmffmfmfmmmffmfmmmmmfmffmffmfmmfmfmmfmmfmmmffmfmfffmffmmffmmfffmmfmffmmmffmffmfffmfffmffmfmffffmmmmmmffffmmfmmfmmmfmmmfmmmfmfffmmffffmmmfmmffmfmmfmfmfmfffmmmfmmmmmffmffmfffmmffmffmmmmmfmffmfmmmfffmfffmfmfmmfffffmffmfffmfmmmfmmmmmfmffffmfmmffmfffmmfmffffmmfmfmfmfmfmmmmffmmmmfmmfmmmfmmfmmffmfffmmffmfmffmmffmmmmmmfmfmmffffmmffmfmmfmmmmffmmmfmfmmmfffffmmffmfmffmfffmmffmmmffffmfmfmmfmfffffmfmfmmfmmmfmmmfmfmmffffmmmfmffffmfmmffmmmmmmfffmfffmfmfmfmfmfmmffmfffffmmmfmfmfffmmfmfmfffmmmfmfmmffmmmmffmffmmffmfmfmmffmmmmfmfmmfffffmfmffmmmfffmmfmffmmmmmmffffmffffffmffmmfmfmfffmmmmmmffmffmfmmmmmmfffmmmmmmfmmfmmmfmfmffmffmfmmmffffmmmffmfmmmmmffmmmfmmmmmfmfmmfmfmmfmmfmmfffmfffmfmmfmmmmfmmfmmmfffmfffmfmmfmmffffmmmffmmmfmfmmmffffmmffffmfmmmmfffmfmffmmffmmfmmmfmfmfmmffmmmmmfmmfmfffmmfmfmmmmmmfmmfmfmfmffmmmmfmfmmmmfmmmmmfmmmmmmfmffmfmmmfmfmmmfffmfmmmfmmmfffmmffmmfmmfmffmmmmmfmmmffmfmfmfmfmffmmffmfffmmmfmfffmffmmmfmmmfmmmfmfmmmffmmmmfmfmffmffmfmmfmmfffmfffmfffmmfmffmfmmmfmmffmmfmmfmmmmmmmmfffmmffffmffmmfmmmmffmffffmmfmmmmffffffffffmmmfmfmmfmmffmmmffmmfmfmfmfmfffmfmmmfmmmfmffffffmffmmfffmfmmfmmffmmmfmffmfmfmmmmmffffmfmfffffmmffmmmmmfmffffmfmfffmfmmfffmfmffmmmmfffmffmfmffffffmfffmmmmmfmmmffmmfffmmmfmmfmmmmfffmmmffmmffffffffffmffmffmfmmmmmmmmfmmmmfmfmfmmffmfmmfmmmmmfmfmmffffffmffmffffmfmmfmffmffmmmfffffmmmffffmmmfmfmmffffmfmfffmffmfmffmffmfffmmmfmmmffffmmfmmmmmffmmfffmfffffmfffmmmmffmmmfmffmmffffffffffmfmmmffmmmfmmfmffffmmmfmffmmfmfmmmmmmmffmmffmfmmmmmmmmffmfmmfffmmfmmfmffmmmmfmfmmmmfmmffmfmffmfmmmfffmmmfmmfmfmffffmfmfmmmfffmmfmffffmmffmffmmfmmmmmfmmmffffffmfmmffmfmfffmmffmmmmmfmmmmfmmmfmmmmfffmmfmmfmfffmmffmffffmmffmmfmfmmfffmfmmmffffmfffmfffmmfmffmmmfffmfmmmmffmmmfmmffmmmmmmffmmmfmmffffmffffffmmfmfmffmfffmmmmmfmmmmfmffmfffmmmmmffmfffffmmffmfffmmfffmffmfmffmmfmmfffmmmffmffmmffmfmmmfmmfffmmmmfmmfmmmfmffffffmfmmmfmmmmfmmfmffmmffmffmmfffmmfffmffmmmfmmfmfmmfffmmffmfmmfffmmmmmfmmmfmffffmmmfmffmffmffmfmfmmfmmfmffmmmmmmffffffmmfmffffffmmfmffmffmmfmffmmfffmmffmmmmmfmmmmmffmfffmffmfmfffmmmfffffmmmfffmmmmffmfmffffffmmmffmffmmmffmmmffmmmmmmmmffmmfmffmfmmffffmfffmfmfmmfmmfmfmmmfffmmfmfmffmffmffmmfmfmmmfmfmfmfmmmfmmmffmmfmffmmffffffmfmfmmfffmfmmfmmfmmfmfffmffmmfmfffmmmfmmffmffffffffmffmmffmfmmfffmfmfmfmmmfmffffffmfmmmfmmmfmmfmmmfmmffffmfmmmmfmmmfmmffmfmffmmmfmfffmmfmfffmmfffmfmfmmmfmfffmmfffmfmmmfffmfmmffmmmfmmmmmfmmmfmmmfmmmmfmfffffffmffmfmmfffmfmfmfffffmmmmmmmffffffffmmfmfmmfmffffffmmmmmmffmfffmfffmfmfmfmfmmmmmffmmmfmffmffffmmmfffmmfmmfmmfmmmfmmfffmmmmmmffmmmmffffffmmffmfmmfffmffmmmfmfmfffmfmmfffffmffffffmfmfffmmffmffmfffmfmmmffmfmfmffmffmmffmfffffmmfffmmmmffmmfmmfmmmmffffffmmffmmmmfmfffmffmfmmmmmfmffmmffmffmmfffmffffffmmffffmfffmmmmfffffffffffmfmffmfmmmfffmfmmmfmfffmfmmmmffmmffmfffmmfmmmmmmmfmmfmmmmmffffmmmfmmffmmfmmffmffmmmfmfffmmmfmfmmmmfmmmfffffffmfmmffffmmmmffffmffmmmmfmfmmmmmmmmffmfmfffmffmfmmmfmmmmmmfmmfmmffmmmmffmmfffmffmmmffmfffffmmfffmffmmmmmffmmmfmmmffmfmmmffmffmfmfmmmmmmmfmffffmfmffmmmmmfmmmmffmmfmmfmfmmmfmfmfmmmfffmfmfffffffffffmmfmfmfmfmfmfffmmfmffffmmmmmmmmmffmmmfmmmfmffffmfmffmmmmmmmfmmfmmmffmmmmfmfmffmfmfffffmfmfmmffmffmmmmmfffffffmmmffmmfmmmmmmfffffmmmfmfffmffmfmmmmmffmffmmmmfmfffmmmmmmmmmfffmfmffmffmffmffmffmffmmmmfmffmffffmffffmfmfmfffmffmmfmfmmfffmffmmmfmfmmfmfffmfmmfmmmfmmfmffmmfmffffmmfmffffffmffmfmffmffmmmfmfffmffmmffmmfmmfmffffmffmmfmmfffmmmffmfmmmmfffmmffffmffmmmmmffmmffmmffmmmffffmmmmfmfmmmmffmmmmmmfmfffffmfmmmmffmmfmmfmmmfmfffffmffmmmfmfmfmffffffmffmmffmmmfmfmmfmmmffmmmmffmffffmmmmfmfffmmfmmmmmffmfffmfmmfffffmfffmmmffffmmffmffffmmmmffmmffmmmmfmffmmfffffmmmffffmmmmmmmfmmfmfffmfmmmmfmfmmfmfmmfmfmfmfmmffffmmffmffmmmmfmfmmmmmfffmfmmmmmmfmmfffmmfffmmfffmfmfmfffmfffmfffffmfmmmfffmfffmmfmfmfmmmffffmfffmffmfffmmmmmfmmfmmmmfffmmffmmfffmfffmfffmffmfmffmfmfmmffffmffmfffffffmfffffffmfffffmmfmmmfmmfmffmfmmfffmfmfffffffmffmfmfmfffffmmmfmmfffmfmmfmffffffmffffmmfmmmfffffmfmmmmmmmfmfmmfmmffmfmmffmmmmmfmmfmfffffmfffmmmmmffmmmmmmffffmffmmfffmfmffmfmffmmmmmfmfmmmmmfmmmmfmmffffmmffmmmmmmfmfmfmffffffffmmmmffffmfmmmffmmffmfmmmfmmmfmmmmffffmfffmfmmfmfmffffmfmffffffffffmmffmffmmmmffmmfmfffmmmmmfmfffffmmfmffffmmmmmffmffmmfmmffffmfmffffffmffffmffmmfmmmmfmmmfffmmffmfffmmffmfmmfffmmmfmmffffmmffmffmmmfmffffmmmfffmfmfffmmfffmmffmmfffmfmffmmfmfffmfmfmfmmmmfmfffmmmmfmmmfmffffffmmmmfmmmffmmfmffmmffmmmfffmmfffmmmmmffffmfmmfffffmfffmfmmmfmmfffmmmmmfffmmfmmfmffmffmmmmffmfmffmmmffffmmffffffffmmmffmfffffmffmfmfffmfmfffffffmffmffmmmfffffffmfmfmfffmfmffmmffffmfmfmmmmffmffmmmmffffmmfmfmfmmmmfmmmfmffffmmfffmffffffmfffmmffmmffmmfffmmfmfmffffmfffmmmmfffmmfmffffmfmmmmfmmmmfmfffmmffmfmfffmfmmfmfmffmfmfmmmmmmfmfmfffmffffmfmmmffmfffmmfmmmfmfmfmfmmmmmmfffmfmfmmmmfffmmmfffffmmfmfmfmmmffmffmffffmmmfmfmffmffmffffmmmfffffmffmmmfmmffffmfmfmmmfmmmmmmmfmmmfmmmffmmffffmmmffffmffmmmmfmffffmfmmfffmmmfmmfmmfffmfffmmfmfmmmmfmmfmffmmmmfmffmmmfmfmmfmfmfmmmfmfffffmmfmfffffmfffmmmmfmmffffffmffmmffmffmmffffmmmffmfffmffmffmmmffffmfffffmfmmmfmfmmfffmmfmffmmfmfmfffmmfmmfmmfffmfffffffffmmmmfmmffmfmfmfmfmmmfmffmmmmfffmmmffmfmmmfffffffffmffmffmmfmfmfffffmmmmmmmmmmffmmfmmffmfmfmfffmmmmfffmfffmfmmmffmmfmmffffmffffmmmmfmmffmmfffmmfmmfmmfffmmffffmmmfffmmfmfmffmfmmmmmffmmmffffmfmffffffmmfmffmfffffmfmffmmmmffmfffmfffmmfffmmmmmffmmmmmmmffmmfmmmmmmmfmmfmmfmmmfmmmmffmfmmfffmfmmfmmmmfffmfmmfmmfmfmmmmmmmfmfffmffmffmfffmfmmfmmffffmmfmfffmfmmmmmfmmfffffmmmmmmmmffffffmmfffffmfmfmmmmfmfffmmffmmffmffffmmfffmfmfmffmmmmmmfmmmmmfmmffffmfffmffmfmffffffmffmmffmfffmmmfmmfmmffmmmmfffmmfffmmfmmmfffffmmmmmfmmffffmmmmfmffmfmffmmmmffmfffffffffmffmfmmmfmmmmfmmmmfmmffmfmmfffffmmmmmffffmmmmffmfffmfmffmmmmffmffffffmmmfmmffmffmmmmmmmfmfmffmffmfmffmmfffffmfmmmfmmfmffffmfmffmmmffffffmfmmffffmmmffffmmffffmmffffmmffmfmffmmmmmmfmmfmfmmfmmfmmfmfmfffmffmffffffmfffmmffmmfffmmmfmffmmmfmmmmmfmfmmmfmffmmfmfmfffmmmfmmfmffmffffmmffmmmffmfmfffffffffffffmmmfmmfffmmmfmfmmmfffmffmfmmmmfmfmfmfmmffmfmffmffmmfmmmfmffmmmffmfffmffmfmfmfmfmmmfmmmmffmmfffffmfmmmffmmmmmmmmfffmfmffmmmfmfffffmffffmmmmmmmfffmffmfmmmfmfmffffmfmmfmmfffmmfffmmfmfffmmmfmfmmffmfmffmffmmfmfmmmmfffmmfmmffmmmmmffmmmfmmmmfffffmmffffmffmmfffmmmffmmmmmffmmmmfffmmmfmmfmfmmmmmfmffmffmffffffmmmfmffffmmmfmmmmmmffmfmmfmmfmfmmfmfmmmmmmmmmfmmffmffmmfmmmmmfmmffmfmfffffffmfmmfmfmfmfmfffmmmfffmfffmmmmfmfmffmffmfffmfmmfffmmmmmffffffmfmfffmmmmffffmmffffmmfmmmmfmmmfmmfmffmmmmmmmmmfmmffmmffmmfffmmfmmfmffmmfmfmmmfffffffmfffmmmffffmfffffffmmmmmmmmmffffffffmmmmfmffmmmffmfmmffffmffmfmfmfffmmmmffmfmmffmfmfffffmmmfmffffffmmfmmmmffffmfmmffmmmmfmfmmmmmmffmfmmfmmmmfmffmmfffmffmmmmfmffmffffmfffmfmmmmmmfmmmmmmmffmfmffmmfffmmmmffffffmmmmmmfmffmmffmffmmmffmmfmffmfmfffmmfmfmmmfmffmfmmfmmfmfffmffffmmmffmmfmfmmfffmfffmmmfffmfmfffmfmmffmmfmmfmmffmfmfmfmfmmffmmffmfffmffffmmfmfffmfffffffffmmffmmmmmffffmfmffmmmffffmfmfmmffmfmffmmmmfffffmmfmffmfffmffmmmmfmfffmmfffffmmfmmffmfmfmffmfmmfffmmffffmffffmmmfffmfffmffmmmmmmmfmmfffmmmmfffmmmffffmmmmmmmmfmmffffffmffffmmmmffmfmmfmfmffmmfmffmmffmfmmffmmmmmmfmmfmfffmfmmfmfffmfmmfmmmfmfffmmfmmmmmfffffmmmfmfmmfmmmffmfmfmfmfmmfffmffmmmmfmmffmmfmmfmffmfmmmffmmfmfmmmfmffmfmmmffmmffmmfmmfmfffffmmmffmmmfffffffmfmfmmffmfmfmmmmmmfffmfffmmfmfffffmfffmffmffmffmmffmmmmfmmfmmmmffmmfmmfmmfmfmmmfmfmmmffffffmfmmfmmmfmfmmmmfmffmfmmffmffmmffmfmmmmmfffmfmfmfmfmmfmmmfffmmffmmffffffmmffmmfmmfmfmmfmfffmmffmfmmffmmmfmfmmmfmmmmmmmmfmmmmmmmmfmmmffmffmmfffmfmmmmfmmffmfffmfmfmffffmmmfmfmmmfffffmffmmffmffmffmmfffmmmfmmmmfmfffmffffmmmmmfffffmmffmmmmfmffmffffmmmmffmmffmmmmffffffmfmfmffmffmmfmmfmmfmffffmfmfmfmfmfmmffmfmfmmffmffmmffmfmmmfffmfffmfmfmffmffffmfmmfffmffmfffmfmmmffmmfmffmfmmfmfmffmmmmffmfmmfmfmffffmfmmfffffffmmmmffffmfmfmfmffmmmfmfmmfmmmffmfffmfmfmfmfmmfmfmmmmfffmfmmffffmfmfmmffmmmffmmmfmfmfffmfmffmmfmffmmmmfmmffmmffmffmfmffffmfmffmmfffffmfffmmmfmfmmfmfffmmffmmffmfffffmmfffffmmffffffmmfmfffmffmmmmffmfmffmfmfmmmfmfffffmfffmmfffmmfmmmmfffmfffmffffmfmmmmmmffffffmfmmfmfmffmmmmmffffmfmmffmfmmmmffmmmmmfmmmffffmffffmffmfffmffmfffmmmffffmffmmmfffffmmmmmfmfmmmmmmfmmmmmmfmmmmmfffmfffmmmmmfffmfmmmmmmffmmffmmmffmffffffmffmffmmfmmmmmmmfmmmffmmmfmmmmmfmmfmmmmfmffmfmmffmmfmffmmmfffmmfmmfmmfmmmfmfffmffmfmmmfffffmfmffmfmfmfmmffffffmfmmmfmmmmmfmfmmffmfmffmfffmmmfmmfmffmmmfmmmfffmmfmfmmfmfmfmmfffffmfmmmffffffmmmfffmmffmfmmfmfffmmmfffffmmmfmffmfffmmfffmfmffmfmffmmmmmfmfmmmffmmmfmfmffmfffmffmmmfmfmffmmfmmmfffmmmmmfmffmmmmmmmfmfffmffmfmmmffmfmmfmffmfmmmfmfffmmmfmmfmmffmfffmffmffffffmmfmfmfmffmffmmffmfmmmmmmmfmmmffffffmmfffmfmffmfmmffmfffmmmmmfffffmffffmfffmmfmmfmmmfmmfmmffmmfmmmmmffmfmmmfmmmfffmffmmffmfmmfmmmffmmfmfffffffmfmmmffffmmfmmffmfmffmmmmmfmffmmfmmfffmffffmmfmmmmfmffmmfmfmmmmffmmmmfmfmfffmmmffmffmffffmffmmffmffmffmmffmmffmffffmmffmmffmffmffmffmmfmffmmfmfmmfmfmmfmffmfmmfffmmmmffmmfmmffmmffmfmmffffmmmfmfmffmmfmffmfmfmffmmffmfffmfmffffmmmffmfffmmfmffmmfmfmfmmfmffmmfmfmfmfmmmmfmffmfmmmffmmffmmmffmmfffmmffffmmffmfmmmfmmfmmmmffmfffffffmmfmmmffffmmmmmmmfmffffmfmffmmmmfmfmffmmmmfmmmmfmffmfmmfmfffmfffffmfmfmmfmfffffffmmfffffffffmmffmfmfmffmmmffffmffmffffffmmfffmmmffffffmffmffffmfmffmffmmfmfmfffffmmmmffmmmffmmfmmmmffmmmmfffffmmmfmmmfmfffmfmmffmmmfffmfmmfmffffmmfffffmmmfffffmffmmffffmmmffmfmmffmffmmmfmfmffffmfmffffmfmffmffffmmmmfffmffmfmfffffmfmmmmmmfffmfmfffmfmfmfmfmffmmfmfffmfmmffmfmmfffffmmfmfmffffmffmmmffffmfmmfffffffmmfmmfffmfffmffmfmmffmmmffmfmfmfmmfmmfmmfmmfffmfmmmmmmmmfffmmfmffffffmmmfmffffmffmfmfmmmfmmmmmfmmffmmfffmmmmmffffmmffffmmmfmffmmfffmfmmmfffmmmfmfffmmfffmfmffmmmmmffmfffmfmmmmfmfmmfffmmmmffmffmfmfmmfmfmmffffffffmmfffmmmfmfffmmfffmfffmfmffmfmmmmfmmmfmfmfmmfmffmmmfmmfmfmfmfmmmmmmfmfffmfffmmffmfmfffmmfmffffmmmfffmmmfmmmfmmmmmmffffmmfmfmffffmfmffffmfmfmfffmffmfmfffffmfmffmmmmmmfmmfmmmmfmmffffmfmmfffmmmmmmffmmmmmffmmmffmmmmfmfmmmfmmmmfmffmmmfmmmfmffmfmfmmmfmfmfmfmmmfmfmmfmmfmmmmfmmfmfmmffffmmmmfmmmmmmffmfmfffmmffmmmfmmfmfmffffmmmffmfmffmmffffmfmmmfmfffffffmmmfmmffmmmfmffmfmmffffmffffffffmmmmffmffmfmmmmmffmmffmfmffmfffmfmfffmmmffmmfmmmmmmfffmffffffmfmfffmmmmfmfmffmmfmfmmmfmmmmfffmmmfffmfmfmffffmffffmffmfmfmmmmmffmmfmmfmfffmmffmfmmmmfmfmmmfmmmfmmmfmmmmfmmmmmfmmffmfmmfffmmfmmffmmffmmfffmffmmmmffmmfmfffmmmffmfmmmffmmfmfffmmmmmfmmmmmffffmffffmmffmffmmmffmmffmmfmmmmmmmffmmmffffmmfmffmmmmfffmffmmmfmmffmfffffmfmmmmmmffmmfmffffmffmffmmffmfmfmmmffffmmmfmmfmffmfmfmmfmmmmfmffmffmmmmfmfmmfffmfmmmffffmffmmfmffmfffmfffffffmffffmffmmmmmmmffffmmmfmfmffmffmmffmmmmfmfmmmffmmfffffmffmmmffmfmfmmmfmmfmfffffmmffffmmmffmfmmfmfmmmfmffffmmfmmfffmmffmmmffffffffmmfffffmfmffmfmmfmmmmfmmfffmfmffmfffmfmfmfmmmmmmmmmmffmfmfffffffmfmfmfmffmmmfffmfmfmmmmmmmfmfmffmmffmffmffmffmfmmmfmmffmffmmfffmmfffmfmfmmmmffmmfmfmffmfmmmfmmmfmfmfffmmmmmmfmfffmfmmmffmfmmfffmmmmfffffmmmffmffmmfmmmmfffmfmmfffmfmmmmmmfmffmffffmmfmmmmmmmfmfmfmmffmfffmmffmfmffffffmmffmfffmfffmmfmmmmmmmfmfmmfffmfmfmfmmmffmffmfmffmmmfmmfmfmfmmfmmmmmmfffmmfmmfmfmfmmmfmmmfmfmffffmmmfffmmfffmmmmfmfffmffmfffffmfffmmfmmmfffffffmffmfmmmmfmffmmfmffmmffmmfffmfffmmmfmmfmmffmfmfffmfmfffmffmmmfmmfffmfmfffmmfmfmmmmmmmfmffmmmmmmffmmmfmfmmmffmffmffmmmfmfmmfmfmmfffffmmmfmmfmmffffmffmffmmfmmfffmmffmffmmffmmmmfmfmmfffmfmmmmmmfmmfmmmmfffmfmmmmmffmmmmmmfmfffmmmfmmfffmmffffmmmmfffffmfmfffmffffmmmffmmfmmmfmmfmmfffmmmmfffmmfmffffffmffmmmmmmfmfmfmmmmfffmfmffmmfffmmmmfffffmffmmfmfmfmfmmfmfmffffffmfmmmmffmmfffmmmmfmmmmmffffmmmffmmmmfmmfmmffmffmmmmfmmfffmmfmmfffmfffmmffmffmmffmfmfmmfmfmffmfffmmfffmmffmfmffffffmmmfmffmmmmfmmfmffmmffmmfffmfffmfmfmffmmffmfmmmmffffffffffffffffmfmffmfmffmmmfmffmffmffmfffmmffffmfmmmmffmmmfmmmffmffmmmmfmffffmmmmfmmfffmmmfmmffffmfmfmmmfffffmmfmmfffffffmmffmfffmmmmfmmfffffmfmmfmfmmmmfmfmfmmmmfmmfmffffmmfmmfffmmfmfmmmmfmmmfmmmmfffmmfffmmmmmmffffmmfmfmfmfmmffmffmmfmmmmmffmmmfmmfmfmmmfmmfmmfmmmmfmfmfmmfmmmmmmmfmmffmmfmfmfmmfmmffmffmmffmffmmfffffmmmmffmmfffmfffffmmfmffffmmfffffmmmfmfmffffffmffffmfmmfmmfffffmfmmfmffmfmffffmffmfmffmmfffmfmfmfmmfmmmfmmfmfmfffmmmfmmfffmmffffmmmmmfmffmfmfmmmffmfffffmmfmfffmffffmmmfffffffmfmmmffmfmfffffffmffffmffmmffmfmfmfmmffffmmmmmfmffmfmmfffmmmfmffffmfmffmfmffmfmfmmmmfmmmmfmfmffmfffmmfmffffmmmfmmffmfmfmfmmfmmmfmmffmfmffffffmmfmmmfmfmmffmmmfmmmfmmmfmffmfmffffffmfffmfmmmmmmffmffmfffffffmmmfffmffmmmfmfmmmmmfmmfmfmffmfmffmmfmfmmffmfmmmmmmmmmmmffmmmmmfmfffmffmfffmfffffmffffmmmmmmmffffmffmmmfmfmmffffmmfmfmfmmmfmmmmfmmfmffmfffmmfmmfffmfmfffmffffmfmfmmmmmmmffmmfffmmfmmmmmfmmmfffffmfmmmfffmffmfmfmmfmmfmfmfmmfmmfmfffffmffffffmmmfmffmmmffffmmfmfmfmfffmfmffmmmmmmmfffmmmfmffmffffmffmffmfmmffffmfmfmffmmmffffmfmfffmfmmmmmmfmmmmmmffmmfmmffffmmffmmfmmmffmfmmmmmfmffmmmfmmfmfmffmfmmffffmmmmmfmmmmmmmfmffffmmfffmfmfmmfffmmmmmmmfmmfffmmfmffmfmmfffffmmmmmffffmmffmmfmffmfffmmffmmfmmffmmmfffmffmmmfffmmffmfffmmmmmfmffmfmfmmfmfffmmfffmffmmfmfmffffmfmmmfmffmfffmmffffmmfmmmfffmffmmmfmffmfffmmmmmmmfmmmffmmmffffmmmmfmmfmmmfmmmmmmffmmmmffmfmfmmmmffmmmmmmmmffmmfffmmmffmffmmmmmmffmmmmmmmmmmfmmfffmfmfffmmmfmmmfffmmffffffmmfmfmfmmfmmmfmfmffmffmmfmffmmffffmmmfmfmmmfmmmmmfmmfmfmmmmmmmmmfffmffmmmffmfmfmmmmmmfmffmfmffffffmmmmmmmfmmmffffmfmmffmmmfmfffffmffmfmfmmfmmmfmfmfmmmmmmmmfmmmmfmffmfmfmmmmfmmffmfffmffmfffffmmffmfmmfffmmmfmmmmmmffmmfmfffffmmfmfmmmmmffmffmffmmmmffmfmfmmfmfffmfmfffmffmmmmfmfmmfmfmffmmmfmffmfmfmmmmmmmmmfffmmmfmmmfmmfffmmmmfmmfmfmmffmmfmfmfmmffmfffmfmfffffffmfmmffmfmfmmfffmffffmfmfmfffmmmmmmfmfmfmmmmffmmmfmffmffmmfmmmmmfmmfmffmffmfmffffmmfmmmmmffmmfffmmfmmmmmmmfffmfmfmmmfmffmffmmmmmfmfmfmffmfmmmmmfmmfmmmmmmmmffffmffmmfmfmmmmmfffmfmffffffmffffmmfmmffmffmmffmmmmffmmmfmfmmmfmmfffffffffffmmffmffmmmffmfmfmfmffmmffmmffmffffmffmmmfmfffmffmmmfffffmmffmfmfmfffmffmmmmfffmmfffmmfffmmfffmfmfmfmmmmmffmmmmfmfmmmmmffmmmmmfmmmmfmffmfffmfmfmmmmmmmmffmmmffmffmmffffffffffmmfffffffmffmfffffmmmfffmffmfffffmmffmffffmmmfmffmfmmfmfffffffmffmmfmmfmmffmmfmmmmmfmmmmffmfffffmmfmffmfffmmmmffmfffffmmmmmmfffmffmfffmffffffmmmfmfffffmfmmmffmmmfmfmfmmmfffffmmfffmfmfffmfmmmmmfmffmfmmffmmfmfffffmmfmfmfffmmmfmffffmmmmfffmmffmfmfmmfmmfmffmmfffmmmffffffmmfmfmmmmffmffmmfmmfmmmfmmfmffmmffffmmfffmfmmmfmfmmmfmmfmffmmfmmmmffmmfmfmfmfmffffmffmmfmmmmfffmffmmmmmmffffmfmfmfmmmmffmmffffmfmfmfmfffmffmfmmfffmmmmffmmmmmmmfmfffmmfffffmmmmfmmfmffmmmfffmffmfmmmfmmffmfmmffffmfmmffmmmffmmmfmfmmmmmmfmfmfffmfmmmmffmffmmffffmfffmffmffmmmfmffmffmmmffffmffmmfmfmfmmffmmffffffmfmmmmfmmfmmffmfffmffmmmmffmfmmffmfmfmmffmfffmmffmfmfmmffmffffmfmfmfmfmfmmffffmfmmmfmmfmfmmmfmffffmfmfmmfffmmfffmfmfmmffffmfffmfmmmffmffmmfmfmmfmmfmmfffmfffmmmmmmmmfffmfmfmmmmfmmfmffmfmfmmmmfmmfmmffffmmmffmmfffmmffmffmffmmmffmfffmmmmmfffffmmfffffmfmmmmmmfmmmmmfmmffmmmffmmmfffffmmmmffmmmmmffmfmfmfffffffmmmmfffmmfmmmmfffmmmfffmmffmfffmffmfffffmfmffmfmfmmmfffffmffmmfmfmfffffmffffmmfffffmfmfmmmmmmffmmfmmffmffmmfmfmfmffmfffffmmmmmfmmmmmfmmmmmffffmmmmmmfmfmmffffffmmmfffmmmffmfmffmffffffmfmfmfffmffffmmffmfmfmfmmmmffmffffmmffmfmfmmfmmmfmmfmmmmmfmmmffmmmfmmmfmfffmmffmmmmffmfffffmfmmffffmfmffmmmfmmmfmmmfffmfffmmmmffffmfmmmfmmmffmmmmmffmffffffffmmmfmmffmfffffmmffffmffmmfmmfmfmmfmfmmffmmfmmmfmfmmfmmfmfmmmfmffmfmffffmffffmmffmfmfffffmfmffmfmfmfmmfffmfmmfffffmmmmffffmfmfmfmmfffmffffffffffffmfmfmfmmfffmmmfffmmfffmmfmmfmfmmmfffmmffmmmmffmmmffmffmffffmfmmffmmmmffmfmffmmfmmmmmfmmmmffmfmffmmfmmmmmmmmmffmmmffffmffffmffmmmmmmmffffmffmmfffmmmffmffmfmmfffmmfffmfmmffffffmmffffmmmmfmmfffffmfmffffmmffmmmfmmmffmmmmfmffmmfmfffmmffffmfmfmfmmmffmmmmffffmmfmffffffffmmffffmmmmffmmfffmfmmmffmfmfmmmfffmfmffmfmmfmmmffmffmfmmfmfmfffmmmmmmfmfmmmffffmmffffmfmffmmmmfmffmfmmfmfffmmfmfffffmfmfmffmmffffmfffmmfmfmmmmmfmfffmmffffmfmffmmffmfffmmfmmfffmfmffmmfmmmffmfmffmmfmmmmfmffffmffmmmffffffmmmfmmfffmfmmmmmffmmmmffmffmmffmmfffffmffffffmmffmfffffmfmfmfmfmffmmmmmmmfmfmmfmmmfffffmmfmfffmfmmfmmfffmfmffffmmmmmffmfmfmffmmfmfmmffmmmmmmmmfffffmfmfffmfmfffffmmffmmffmfmmfmfmmmffmmfmfmffmfmffmffffmfffmmmmfmffmfffmffffmffmmfmmmfmfmffmfmfffmmmfffmmmmffmmmffmfmmmmfffmfmfffmfffffffmffmmmmffffmmfmmmffmmffffmmmmfmmmmffffmfffmmmfffmmmmmmfmmmfmmfmfffmfmmmfmfmmfmmmmffmfffmffmmfmffffmffmmffmmfffffmmmfmmmffmffmffmmmmfmfmmmmfmmfmmmffffffmffmfmmfmfffffmfmfffmmmfmmfmfmfmmmmfmffmmfffmmffmmmmmmfmmmffmmmfffmffmfmfmmmffmmmfmfffffmmffmmffffmmmffffmmmmfffmmffmmmfmffmfmfmfmffmmfmfmmmfmmfmmfmffmmfffmfmmfmffmmmfmffmffffmmffmfmfffmfmffmfmfmffmmfffmmfmffmfmmmmmfffffmmmmmmmmmffffmmfffmmffmfmfmmmfmfmffmmmmfmfmfffmmfmmffmffmmfmmmmmmmfmmmfmmmfmfmmmmfmffmmmfmmffffffmmffmfmmmfmmffffmffmfmfffmmmmmffmffmmffmmffmmfmmmfmmmfffffmmfmmmmmmfmfffffmfffmfffmfmfmfffffmfmmmffmmfffffmmmmffmfffffmffmmfffmmfmmmmfmfmmfmmmffffffffmmmfmfmfffmffmffmmffmfmfffmmfmfmmffffmmmfffmmmffmmfmfmmfffffmmmffmfmfmfmffmmfmfmffmfmfmffmmmmmmfmfffmfffffmmmfmmfmffmmfmffffmffffmmffmfmffmmmmmfmfmfmfmffmfmmfmmmffmffmmmfmmmffmmmffmmfmffmfmmmfmmmmfmmfffmfmmfmmfffmfmfmffmfffmmmffffmmffffmmfffmfmffmfmmmmmmmffffmfmfffmmffmmmffmfmmfmmfffmfffmfmmmffmmmfmffmmfffmfmmfffmffmmfmfffmfmmfmmmfmmffmffmmmffmffffmfmmfmmfmmmmmfmmffffffmffmmmmmmmmfmmmmmfmmmmmmmmfmffffmffmfmmmfmmmmfmfmffmfmmffmmffmmfmfffmffmffmffmmfmmfffmmfmffffmmfmfmmffmmmmfmmmmmmmfmfmffmfmmmmfmffmmmmfmmfmfffffmmffmfmmfmffmmmfmffmffmfmmffmmmffffmmfffffmmmmmmffmmmffmffmmmfmmffmfffmfffffmmffmfmmmmmmfmmfmmmffmfmmfmffmmmmmmfmmfffmffffmfmmffffffmfmffmmfmmffmmffmmfffffmmmmmffmffmmffmfmmfmfmfffmfmmfmmmfmfmfmmmmfmmffmmmfmfmmfmffffffmmmmmmfmfmfffmffmfffmmfmfmfmmfffmffmmmfmmmmmmmmmfffmmfmffffffmfmmfmmfmmfmfmmffffffmmmmfmffffmmmmfmmmmmmfffmfmfmfmmffmfmffffmfmmfffffmmmmmmmmmmfmfmfmmmmmmmfmmffmmfmffmffffmmmffmfmmmmfmffmfmmfmmfmmmfffmmfffmfmmfffffmfmmmffffmffmffffmffmmmmmffffffffmfffmfmffmmmffffmmmmmmfmfffmmmmfmfffmmffmmmffmffmffmmfmmmmmmmfffmmfmmfmfffmfmmfffmfffffmmfmmffffmmffffffmffmmmfffmmfmmmmmfmfmfmfmmfmfmmffffffffffmmfffmmfmmfmffmffmfmmfmmfmmmfmfmmmfffmmfmmfffmfmfmmfmfmfffmmffmmmffmmmmmmmfmmfmffmfmfmffffmffmmfffmmfmfffmffmfffffmfffmmfmmfffmffffmfffmfmfmmffmffmmmmmmfmmfmfmfffmfmmfffffffffmfmfffffmmmmmfmmmmfffmfmmfffmfffmffmmfmffmfmmmfmmmffmfmmfffmfmfffffmmmfffmfmfffmmffffmmfmmmmfffmfmmffmmmfffmmmmmfmfffmmmmfmfmmffmmmfmmmmffffmfmffmmfmfmmmmfmffmmffmfmffmfmfmfmmfmfmffmmfmfmmmmmffmffffmmmmmffmmfffffmfffmfffffffmmfffmfmfmfmffmfmfmffmmfffmmfmmfmfmfffmmffmmmfmffmmmfffffffmfmmfmmfffffmmffmmfmfmmfmfmmfffmfmfffffmffmmmmffmfmmfffmfffmfmmffmmfmfmmmfmfffmfmmmffmmmmffmfmffmfmffmfmmfmffmmffmffmmffmfmmffmmfffmmfmfmfmmmmffmfmfmfmffffmmmfffffmmffmfmffffmmffmmmmfmffmffmffmmfmfmfmfmmmffffmffmmfmffmfmmffmfmfmfmmmmmffmfmfmfmfmmffmmmfffmmmmmmfmmmffmffmfffmfmmffmmffmfffffffmmfmmmfmfmmmmmfmmmmfffmmmmffmmffmmffffmmmfmffmfmfmffmmmmmfffmfmfmfmfmmfmmfmfmffmfffffmffmffffmmmfmffffmmffmmmfmfmfmmfffmmmfmmmmffmffmmfffmmffffmfffmfmfffmfmmffmmfmfmmmmffmmfmmmffmmmfmmmmmfffffffmffffmmfmffmfmffmfmmmffmfmffffffmfmmmmmffmmffmffmffmfmmfmmfmfmmmffmmmfmfffmmfffffmfmmfmmfffmffmmfmfffmfmmmfmffmfmffmmfmmfffmffmfmmffmffmfmmffmmmmfmmfmmmmffffmfmfffmmmmfffmfmfmmfmmfmmmffmfmfmfmfmmffmmmmmfffffmmmmmfmfmfmfmmmffmmmffmmmfmfmmmfmmmmmmfmfmfmmmmffmffffmffmffmfmmfffmmmffmmmmmmmffmmmffmfmffmffmfmffmfmfmmmmmfmmmmffmfmfffmmmmfffmmmmmfmmfffffmmfmfmfmfmmmffffffmmffmfmmmmfffffmffmffmffmmmfmfffmffmffmfmmmfmfmfmmfmfmfmfmmmmfmfffmffmmfmffmmfmfmmffffmmfffffmffmffmmmmfffmmmmffffmfmfmmffffmfmmmmfffmfmmffffffmmffmfmmmmmfmffffmmmmfffmfmmmmfmmmfmmmmfmmmmmmfffmfmmmfmmmmfmfmfffmfmfmffmmmmmfmfmffmfmffmfmfmmfmfmffmfmmffmmmffmffmmmfffmmmfmfmfffffffffffmmmmfffmmmffmmmfmffmffmmffmfmmmmmmmfmmfmmfmmmmmmmmmmffmmfffmmmmffmfmmmmmmffmmmffmmffmmmfmffmmmmfmmmfmfmfmfmmffmmfmmmmfmffffffmfmmffffffffmmffffffmffffmfmffmmmffffmfffmmfmffffmffmmmmffmffffmffmffmfmmfmffffffmmmfffmfmmfmmmmmmfmmmffmfmfmffffffmmfmffmffmffmfmmfmfmfffffmmfmfmfffmfmmmmffmmmmffffmmmmmfffmmffmmmmfffmfmfmfffmfmmfmmmmffffmfmffmmmfmmmmfmmfffmfmmfmfmffmfffmfmfmfmmfffffffmmfmmfmmmffmfmmmfffmfffmmmmfffmmffmmmffmfmffffmmmffmmffmfffmmmffffmfmffmffmmffmfmfmmmmffmffmmmfmmmfffmffmffmmfmmmmfmfffmmfmmmfffmmfffmfffmfmmmmffffmmmffmmfffmfmmmfmmmfmfmmfmmmmfffmmffmmmmmfmfffmmmmmfmmmmffmmffffmfmfmmfffffmffmffmmfmmfmmffmmffmfffmmfffmfffmmmmmffffmffmmffffmmffmfffffmffmmfmfmfmmmfmfmfmffmmffmmmmfmmfmmfmfmffffmfffmfmmffffmfmmfmfmmmfmmfmfmfmmfmmffffmmffmmffmfmmmfmmfffmfffmfmmfmmmmfmfmmffmmmmfmfffmmfmffmfmmffmmffffmmfffmffmfmffmmffmmmmfffmmmmfmffmfffffffffmmfffffmmmfffmfmmmmmmfmmfmmffmmmmmfmfffmffmmmfmmfmfmmmfmmmmfmmfmmmfmfffmmmmmmmffmmmmfmffmmfmmmfmffffmffmfmfmmfmffmfmfmmmfmmmffmffmffmmmfmmfffmffmmffffffmmmfmfmffmffffmmfmfffffffmffmffmmffmfmmmfmmmmmffmmmmffmfmfffmmmffmmmfffffmmmmmmmffmmfmfmfmfmmmmmmfmffmfmmfmmffmmfffmfmffmffmfmmffmffmfmffffmfffmmfmfmmmmmmffffmfmffffmfmfffmffmmfmmfffmfmmfmmffmmmmmffffmfmfmmfmfmffffffmmmfmfmmmffmfmmmmffmmmmfmffmmfmfmmmmmmmmmffffmmmffffffffmffmmfmffmfffmmfmmmmfmmfmfmmmmmfffmfffffmfmmmffffmfmmmfmmfmfmmfmmmmfmmmffmmffmmfmmffmmfmfmfmfffmmfffmfmfmfffmfffmfmfmfmfmmmfffmfmmmmffffmmfmmmmfmfmfffffffmfffmmmfmmfmffmmffffmffmfmfffmmmmmmmmmmffmfmfmmmmfmmmfmfmmmmmffmmmmmfffmffmfffmmmmffmfffmffmmfmfmmffffffffmmfmfmmmmfmmfmfmffmmfmffmmffffmmmmfmffmmfmfmmmmmmmfffmffmmfmmmmmmfffffmfmfffmmmfmmffmffmfffmmmfmmfffmffffmfmmfffmffmmfmfffffffmfmfmfmmmmffmmffffmffmmmmffffmfmmfmmmmfmffmmmfffmmmffmfffmmmfffmffmmmmmfmmfffmmffmmfmmffmfmmmfmmfmfmmfmmffmmmmffffmffmfmfmffmffmfmfmfmfmmmfmmffmmmmfmmmfmfmmfmmmmfmmmmffffmfffmffmfffmmmfmmmmfffmffmmffffmfmfmmmmffffmffmfffmffffffmmfmfmmmmffmffffmfffmfmffffmfmmmmffmmmfmffffmmfmffffffmffmffmmmmffmfmmmffmmfffmmmffmmmfmmffmmfmmffmmffmmmfffmmmffmmmmffmmmmmffmfmmfmmfffffmfmmfmffmmfffffmfmmfmffmmfmmfmffffffmmmmfmmmmmmmmfffmfffmfffffmmfmfmmffffmfmmmmffmmmmfmfffffmmfffffffffffmmmfffffmffmfffmffmmffmmmmmffmfmmfmmffmmfmmffmmfmmfffmfmfmfffmffmmfmffmfmffffffmfmmfmmffffmmfmfmffmfmmmfmffffmmmfffffffffmfmffffffmmmmfmfmffmffmfmfmmmffmmffffffmmmfmmfmffffmmfmmmfffmfmffmmfmfmfmfmmmfmfffffmmmfffmmfmmfmfmmffffmmmmmfffmffmfffmffffmmmffmffmmmmffmfffffmffmfmmffffmmmmfmffmfffffmfmmmmfmfmfffffffmmffmmmfffmmmffmffffffmfmmmmmfmfffffmmmfmffmfmmfmmmfffmmmfmffffmfmfmmfmmmmmfmmmmmmmmmmmfmmmmmfmmmfffmmmmffmfmffmmmmmmmmmmmmmfmffmmfffmffmfmffmfffmmfmmmfmmmfmffmmffmffmfmmmmmmfffmmmmfffmffmmmfmmmfmmfmffmmmmfmmmffmffffmmmmmfmffffmffmmfmfffmmffmmfmmfffmmfmfffmfmmfmfmfmfmffmffffmffmffmfffmffmmmfmmmmmffmfmmfmmmfmmmmfmfmfffmmfmmffffmmmfffmffmmmffffffmfmffmfmmmmmfffmmffmmfmmmmmmmmfffffmfmmfmmfmmmmmffffmmfmmmfffffmfmfmmmfmmfmfmmmfmmffmmfmmfmmmfffmfmmfmmfmmfmmmfmmmfmfmffffmmffffmfmfmfmmmfmfffffffmmffmmmmmfmfmmmmmffmfmfmmmfffmfmmmfffffmmmffmffmfmfmmffmfmmfmmfmmffmfmmmmmfmmmfmfffmmmfmfmfmmffffffffmmfffmfmffmmffffmfmfmfmfmfffffmfmmfmffmmffmfmfmfffmmmmfmmffmmffmmmffmffmffmfmmfffffmfffmffmmmfmmmmfmfmfmmfmmmfffmffmmmffffmmfmfffffmfmfmmfmmfmmmffffmfmffmmffmmmmmmffmfffffmffmffmmfmfmfmfmfffmmfmfmfmfffmffmfmfmmmmffmmmmmfmmffmmfmfmmffmfffffffmfmmfmmfffmmmmmmfmfmmffmfffmffmffmmffmfmfmmmfmfmmmfmmmfmmmfmfmfmfmfffmmfmffmmfmmfffmmfffmffmmfmmmffmfmmmfmmmmfmmmmmffffmffmmmfffmffmfmfffmfmffmfmmmffffmmffmmmfmmffmmffmmmmmfmmmmffmffmffmmmffmmffffmfffmmfmmmmfmmmmmfmmmmfmfmfffmmfffmfmmmfffmmmfmmmmmffmfmmffmfffmmfmmffffffmmfmfffmmmmffmffmmmfffmffffmfmmfmmmmfmmmmfffffffmfmfmfffmfmfmffmfmfmffffmmfmfmmmmffmmmffmmfmffmffmfffmmfmfmmffmfmmfffmfffmmmfmfmmfmffmfmmfmmfmmfmffmmmmmfmfmmfmffmmmffmffmmffmffmfmfmfmmffmmmfffffmmfmfffmfmmmffmmmffffmmffmfmmmmmfmfmfmfmffmmmmmfmfmfmmmmmmmmmffmffmfmmfffmfmfmffffffmmffmmmfffmmmffffmfffmmfffmmffmffmmmmmmmmmfmffmmffffffmmmmfmmmfmmmmfmmmmfmfmffffmfffmmffmmmffmmffmfmmfmfmmffmfffmmfffffmmfmmmmfmmffffmfmfmfmmmfmmfmmfmfmfffmffffmffmffffmmffmfffmfmfmfmfffmfmfmfmmmmfffmfmfmffffmmmmmmmmmmmmfmmfmfmmmmfffmfmfmmmmmmffffmfmfmmfmmmffmmmfmmmfmmmmmmmmmmfmffmffmfffmmmmfmffmfmmffmmmfmfmmmfmmfffmffmfmfmfffmfmmfmfmffmmffffmmfmmmffmfffmffmffffmmfmfmmmfffmmffffmfffmfffmmmfmmmmfmmfffffmfmmmffmmfmfmfmffmmfmmfmmfmmfffmmmffmfmfffmmfmmffmfmffmfffmmmffmfmmmfffmmfffmmffmffmmfmfmmffmfmmmmmffmffmfmfmfmfmfffffmmmmfmmfmmmmfmmmmfmmmmfmffmmmffmmfmmffffmmfmfffmmmfmfmmmfffmfffmmfffmfffmmmffmffffmffmmffffmfmmmfmffmfmfmmmmmfmfmffmffffmmmffmfmmmmmfmfmfmffmmmmmmmmmffffffmfmfmfmmfmffmmffmfmmfmmmfmfmmfmffmmfmmfmmffmmmffmmmffmfmmfffmffmmmmfmmffmmmmmfmfmfmfmmmmmmfffffmmmmfmmmfmffmmfffmfmfmfmmfmmmmfmmfmmmfmfffmfffmffmfffmfffffffmmffmmmmfmffmfmfmfmffmmfmfmfmmmmfmfffffmmfmfmfmmmfffmffmmfmffffffmmmfmfffmmmmmmffmmmmfmfmffmfmfmffmffmfffmmfmffffmfmmfmmmffmmmffmfmfmffmmmffmffmmmmmffmfmfmffmmmmmfmffffmffmfmmmfffmmfmmfffmmmfmfffffmfmmmfmmmmmffmmfmmffmfmfmffmfmmmffffffffmmfmfmmfffmfmmffmfmmmfffffmfmfmmmfffffmmmmmmmfffmfffmmffmmffmmmmmmmfffmmfffmmffmmmmfmffmfmmfmfffmffmfffmfmffmmfmmmffmmfmmfmfmmmmmmmmfmfffmfmmmmfffmmmffmfmfmmffmmmmffmffffmmmmffmmfmmmmmmmmfffmfffmmmmmmfmmfmmfffmffmmfmffmfmfmffmmmmmmfmmfffmfmffmmmmmmmmfmffmffmmffmffmfmmfmmmmffmfmfmmmfmmffmmffmmffmmfmffmfmmfmffmfmffffmmfmmfmmmmfmfffffmmmmmffffffmffmmfmffmfffmmmfmmffffmfmmfmffffmfmmmmmffmfffffmmfffffmfmfmmfffmfffmfmmfffmffmfffmffffmmmmmfmfmmfffffffmfmfmmfmfmmmfffmfmmfmmfmmmffmfffffffmfffmmmmmffffffmmfffffmmffffmfmmmfmfmfmmmfmfmmfmfmfffmmmmffffmmfmmfmmfmfmfmmmffffmmfmfmmmmfmfmmfmmmfffmfmfmfmmmffffmmmfmmfmfmmmmmmfmfmmmmmffffmfffmmmffmmmfmffmmmfmfmmmfmmfmfmmmffmmfmmfffffffffmffffffmmmmffffmfffffmfmffmmmmmmffmffmfmmmfmfffffffffffmmfmfmmfmffmfmmmmfmfffmmmfffmfmmmfffmfmmfmfffmffffmmmmmmfmfmfffmfffmfmfmmffmmmffmfmmffmmfffmmfmfmmmmfmmmmffmfmfmmfmmmmfffmmfffmmfmfffffmfmffmfmmmffmmffffffmmfmmfmfmfmmmffmffmmmmffffmmfffmmfmfmmffffmmfmmmmffffmffmfffmmmffmmfmmfmmmffmfffffmmfffmmfmfmffffmmmmmmfmmfmfffmfmffffmmmmmmfmfmffmmfffmmmfmmmfmmfmfffmffmfmffmfmmmmffffffffmfmffffffmmfmmfmffmfmmffffmfffffmffmffmfmmmfffffmfmmffmfmfmfmmfmmmffmfmfffmmmfmfmfmmmfmfmfmfmfffmmfmmmmmmmmmmmmfmffmmmfmfmfmmfffffffmmmfffmmmmfffmmffffmmffmfmmfmmmmmfmfmmmfmmmfffmfffmffmmffmmffmmfmmffffffmfmmmmmmffffmffmfmmfmfffmmmmmmfmffffmfffmffffmfmfffmmmmmmfffmffmfffmmfmmmfmmmfmffffmmmmmmfmmffmmfffffffffmfmfmmfmmmmmffmffmfffmfmfmmffmmmmmmfmmfffffmfmffmmffffmmmmfffmfmmfmmffmffmffmfffmmfmfffffmmfmfmfmmmfffmmmfmmfmfffmfmmfmmfmmffmmmffmffmfmmmmffmffmfffmmmmmmffmmmfmmmmmfmfmfmmmmffmfmmmmffmfffffmmmmmmmfmmmmfmffmffffmfmmffmffffmmmffmmmfmmmmffffffmmfffffmfmmfffmffffmmffmffmmmfmfmfmmfmfmmmmfmfmffffmmfmmmmmmmmmmffffmfmfmfmfmfmfmfmffmfmmmffmmmmmfmmmmfmmmmmfmfmmfmmfmmffffmfffmmfmfmfffmmmfmmmmmmmfmfmmfmfmfmfmffmmfffmmfmmfffffffmfmmffmmfmmmmfmfffmmfmmmfmmmmffmffmfmffmmffmfffmmfffmmfmffmmfmmfmmffmfffmfmmmmmmmmmmfmmffmfmmmmmfmfmmffmfmfffmfmfmffffmffffmfmfmfmfmmffmffmfmffmmfmfmfmffffmmfmfmfmmmfffmmmfmmmfmfffmmmfmmffffmmmfmffmffffmmmmffffmfmfmfffmmfffmmmfffmfffmfmmffmfmmffffmmffmmfmfffmffmfmmfmfmfmffmfmfmmffmfmffmfffmfmfmmfmmmffmfmmmmfmmfmmffffffmmffmfmffmmfmfmmmfmmfmmmfmmmmffffmfmfmmmmfmmmmfmfffffffmmfffmfmffmffmmfmmfffmffmmmffffmfffmffmffmfmfmmfffffmffmffmmmfmfmfmfmmmffffmmffmfmmmfmfffmmfffffmfffmmfmfmmfmfmffmmfffmffffffmfmffmmmfmfmffmfffmmfmfmffmfmfmmmmmmffffmmmmmfmmmmfmmmmfmmmffffmffmmmmffmffmfmfmmmmfmmffmfmmfmfmmmffffmmfmmfmmfffffmffmmmfffmmmmmfffmmmffmffmmfmmmmmfmfmffffffmfffmmfmmfffmmffmffmmfmmmfffmffffmmffffmfmffmfffmmfffffmfmmffmmfmmmffffmfmfmfmfmmmffmfffmmfmffmmmmmfmmfmmmffmmmfmmmmmmmmmfffmmmmfffmfffffffffmmfmffffmfffmmmmmfmmmmfmfmfmffmmffmffffffmffmmfmfffmffmfmffmmmfmmmmmmfffmfmffmfffmffmfffmmmmfmmmmmmfmfffmmmmffmffmmfmmmfffmffmffmffmmfffffmmmffmmmmfmfffmffmmfmfmmfmfmmffmfmfmffmfmfmmmfmfmmmffmmfmmffmffmfmffmmfmffmfmmfffmmmmmfmfmfmmfmffmffmmmfffffffmffmfmmmfmfmffmmmmfffmmmmmfffffffmfmfmfffmmffffmfffmfffmfmmffmffmfmfmfffmfmmmmmmmmmmmmfmmfmmmmmmfmfffmffmfmfffmfmfffmfmmfmfmmfmfmfffffmmfmfmffmffmffmffmmmmmfffmfffmmmmffmfmmmfmffmmmffmmffmmfmmfffmfmmffmmmmmffffmfmfmmmfmmmmmfmfffmfffmffmfmfmfmffmfmffffmfmffffmmfmfffffmmfmfmfmmmmmmfmmmfmffmmmmffmmmmmfmfmmfmmfmfffmmfmfmfmffmffmmmffmmfmffmffmfmfmmffffmmmmmffffmmffmfmfmmfmffffmmmfmfmmmffffffmfmmmfmfffmfffffmfmfffffmmmmfmfmffmfffmmmmffmmfmfmmfmmffmmmmffmfffmfmmmmmfmfmmmmmmmmffmffmfffffmmfmmffmmmmmffmfffmffmmfmffmmfmffffmmffmfmffmmmfffmmfffffmmffmmfffffmfmmffffffmfffmfmfmfmffmmfmmfmffmmmmmmmffmmfmfmmfmmmffmmfmmffmfmmfmmmmffffmmmmmmmffmfmmmmfmmfmmfmffmmmffmmmmmmmmffmmffmmffmfmmmfmfffffmfffffffmmfmfffmmmffmffmfmmfmmfmmfmffmfmfmfmmfffmmmfmmfmmffmffffmffmmmmmmffmfmmmmmmffffmmffmfmfmmmfffffffffmmmmfmmmmffmmfmffmmfmmmfmfmmfmffffmmmmffffmffmmmmmmmmmmffmfffmmfmfffmfffmmmmfmfmmmmfmmffmfmmmmmfmmffffmffmmffmmfffffmmfmfmffmmfmmffmfmfmffffmfmmmffmffmfmfmmfmmmfmmffffmfmffmmfmfmmmfffmmffmmfmfmfmfmfmffmmfffmfmfffffmfffffmffmfmfmmmmffffmffffmffmmmffmfmmfffmmffmmmmfmfmmfmmmmmmmmmmfffmmfmffmmfmfmfmffmfmfffmfmfffffmfmffmmffmmmmffmmfmmmmmfmmmmmmmfffffmfmfmffmmfmmfffmmfffmfffmfmmmffmmmfmmmmmmmffffmffmffmffmfmfffmffmmmmfffmmfffffmfffmfmfmmffmmfmffmfmmfmfmffmmffmfmmfmfffmfmmfmffmmffmffmffmfmfmmmfmmmffffmffffmmffffmfmfmffmmmfmmmffmmmmfmfffmmffmmffffmffmfffmffffmfffmmfmfffffmfmmmfffmffffmffmmffffmmmmfffmmmmmfmffmmmmffffffmfmmmmffmmfmmffmfmmfmffffffmffmmfmmmffffffmffmmfmmmmfmmmmffffffmfmmfmmfmffmfmmmmmmfmmffmmmffffffffmfffffffffffmmmmfffmmffmmfffmmmmmfmfffffmmfmffmmfffffmfffffmmmmmmmffmmffmmffmmmmmfmfmffmmmmfmfffmmmffmmfmmfmmffmmfmmmmmmfmmmmfmfmmmfmmffmfffmmfmfmmfffmfmfmfffmmffffffffmfmmmmffmfffmmfmfmmfmfffffmfffmmfmmffmfmfmfmmfmfmmmfmmmffmmffmmfffmfffffffmmffmmmfmfmffmfmfmfffmfffmmmfffffmfmffffmfffmffmfmffmfmmfffmfmmffmmffmffmmmfmfmfffmmmfmmmmfmfmfmmmfffffmfffmmmfffmfmffffffmmmmfffmfmffmmfmmfmmffmmmmmffmfmffmfffmmmmfmmmffmmmmmffffffffmmfmfmffffmfffmfmfffffmmfffffmmmmmmfmfmfffffmfmmmffmfmmfffffmmmmmmmffffmfffmmffmfffmmfmmfmmffmmmmffffmffmffmfmffmffffmmmffmfffffffmmmmmmffmfmfffffmffmmfmmmmmffffmfmfmmfmfmmmmffmmffmmfmmfmffmmmffmfmfmffffmfffmmmmmmmffmfmmmmffmfffffffffmffffmmffmmmfmmmmffmfmmmmfmffffmmmmmfmfmffffmfmfmfffmffmfmfmfffmfmfffmmmfmfmmmmfmfffmmfmfmmmfmffffffmmmfffmfffmmffffmfffmfmffmmmffmmmfmmfmfmffmmfffffmmfmmfmmmfmfmfmfmmmmfmffmfmmmmffmfmmmffffmffffmmffffmmmmffmfffmmfmffffmmfffffmfmmffmfmffmmmfmmffmfffmmffmfffmmffmmmfffmmffmmfffmmfmffmmfffmffmmmmfffmmmfffmmffmmfmmmmmffffmmfmfmfffffmmffmmmffmmffmmfmffmfmmmmfmmmmffmmmmfffffffffffmmmfmmmmmmmfmmffmmffmfffffmmfmfffffmmmmffmmmmmfmmmfmfmffmmmmfmmffmmffmffmmmfmfmfmfmmfmmffffmfffmmmmmffmmmfmfffmmfffmffmfmmmmfmfmmfmfmfmfffmmffffffffmmfmfffmfmmmmffmfmmfmfmfmfmfmmmmmmmfffmfmmmffmmffffmmfmmffmffmmmmfffffmmmmmfffmmmfmmffmffmffmfmfmmmmffmfmmfmfffmmmffffffmfmffmfmmffmfffmfffmfmmfmmfmmfmfmmmmmmfmmmmfmmfmffmmffmfmmmmfffmmfffffmfmffmffmfmfffmmffffmmfmmmfmfmmfffmmfmmmmmfmfffffmmfmmmmmfffmfmfffffmfffmmmmmfffmmfmfmfmffmmffmfmfffffffffffmmffffmfffffmffmffmmmffmffffffmfmmmmfmffmfmfmmffmfmfmfffmmfmfffffffffmmmffmmfmmffffffffmmmfffmmmffmffffmfmfmfmffmmffffmfmmmffmmfmfmfffmmmmmmfmmmfffmmmfmfmffmffmfmffmfmfffmfmmfmmmmffmfffmmffmmfmmfmmmmfmmffmmffffmmfmmmmffffmmfmmfmmmmmffmffmfmmfffmfmmmmfmmffmmfmfmfmfffmmmmfmmfmfffffmmffmfffmfmmmmfffffmmfffffmmmmmffmfmffmfmmmmmmmmmmffffmfmffffmmfmfffmffmfmmfmffmfffffmfffmfffmfmfmmfmmfmmmmmmmmmfffffffmmmmmffmmmfffffffffffffmmfffmfffmfmfmfffmmfmfmffmmfmmfmfffffmfmmmmffmffmffmfmfffmmfmffmmmmffmfffmffffmmffmmfmmmmmmmfmmmmfmmfffmmmfmfffmmmmmffmfmmmmffmmfmfmmfffmfmffmmffmffmmmmmmmfmffmffmmmmmmfmffmffmfmfffmffffmffmfffmmfmffffmmmmmffmfffffffffmffmfmmfffmmmmfmfmmmfmmfffffmfmfmmmmmfmmfmmffmmffmfmffmfffffmfmmmmmfmmfmffmmffmmfffffmfffmfmmfmmfmmfmmmmmmmfmfffmfmmmfffffmmfmffmffffmmmmfmmffmfmmfmfffffmfffmmmfffffffmmmfmfmmmfffmmmmfmfmmfmffmmffmmffmfffmmfmffmmffmfmmfmffmmmmfmfmfmmmfmmmfmfmmmmffmmfffffmfmmffmmmffmffmfffmmmffmfmfmffmmfmmffffmmmmmfmfmmfmmmfmmfmfmffffmfmffmmffmmmfffmmmmfmfffmmmffmfffffffmffmmfmfmmmmfffmmfmmmffmmmmfmmmmfmmmmfffffmmffmmmfmmfmfffmmfffmmmmffmmfmfffmmmfmffmmmmmmmfmmfmffmffffffmmmfffmffmmmmmmmfmmffmmfmfmmfmfmmfmfmmmmmmmmmffmffmffmmfmmfmffmmmmmffffmffffmfmmfffmmmmmffmmmmmfmfmfmffmmfmfmmmmffmffmmmmmfffmmmmmmmmfffmfmfffmffmfffmfmfmmfffffmfmfmfmfffffffmmmmmmmmmfmmfmfmfmmmmfffmmmmffmmmfffmmmmffmfffmmfffmmmmmffmffffffmmmmmmmmmmmmffffmfffmmfffffmffffffmfmmfmmmmfmmffffmmfmffmffmfmmfmfffmmfmmmmfmffmffmfmmfmmfmfmfmmfffmmmfmfmmmmfmffffmmfmmmffmmffmfffmmmmmfmfmffmmfffmfffmffmmmmmfmmmmmmmffmffffffffmfmmmmfffffmmmmmmffffmmfmmffmmmffmffmmmfffffffmfffmfmfmffmfmmfmmfmmffmffmfmmmmfmmffffmfmfmfffmmmmffmfmfmfmfmfffmmfmmmmffmmmmfmfmffmmfmmffmmfmmmfffmmfffffmfffffmfffmmfmmmffmffffmmmfmmmmmfmfmfmmmmffmfmfmmmfmfffffmmfmmffffmmffmmmmfffffmmfmfmmmmfmfffmmmffffmmmffmmmffmffmffffmmmfmmfffffffmmfmmmmfmfmfffmmmfmfmmffffffmffmmfmfmmffffffmffffmfmmffmfmmfmffmfmfffffmmffmfmmfmmmmmmmfmmmmffmmfmmfmfffffmmmmmmfmfffmmfmfmfffffffmfmffmmmmmmmfmfmmfmffmmmfffmffmmffffffmmmfmmfmfmmffmmfmmffmmfmmfmfffffmmfffmmfmmfmmfmfmfffmmmffmmfffffmmfmmfffmmfmmmfmmfmmmfffmmffffffmmmmmmfffmffmmfmmffmmfmmfmfmffmfmmfmmfmmffmmmmffmmffmmmmfmfmfmmmmmffmmfmfmmmmfmmfmfmfmfmfmmmffffmmmmmmffmfffffmmfffmmmfffmmffmmfffmffmmfmmmfmmfmfmmfmffffmffmfmfffmmfmmfmmmffmmmmmmmffmmmmfmmffmmmfmfmmmfffmmmfmmfmfffmffffmmmmfffffmfmmfmmmmfffffmmmmfmffmmmfmmffmmmmmmmmffmfffmfmmfmmmfmffmfmmmmfmffmmmfmmmfmffmmmffmmmfmfmmffmfffmmmmmfmmmffmmmmfmmfmffffmmmfmfmfmfmmfmmffffmffmffffmmmfmmmfffmmffmfmffffmmffmmfmmmfmfmmmfffmfmmmfffmfffffffffmfmffmmfmffffmmmffmfmffffmmmffffffmfmmmfffffmfffmfffmmfffmmmmmmmffffffmffmfmfmmfmmmmmmmffmfmmffffffmfmfffmmmffmmffffmfffmfmffmmfmfmfmmmmfmmfmfffmfmfffffmfmmmffmmfffffffffmfmffmmmffffmmmmfmmffmffffmmmmmfffmmfffmmmmmfmfffmfmmmmmmfffmffmfmmmmffmfffffmfffmmffmmmfmmmmfmmmmmfmfmffmfmfmmmmmffmmfmmmfmmffmmmmfmfffffmfmmffmfmmmmfmffmmmfmfmfmfmffmffmfffmmfmmmmmfmmmmmfffmffmmmfmffmmmmmffmfmmfmmmfmfmfmmffmfmffffmfffmmmfmfffmfmmmfmfffmmfmmmmfmmmffmfffffmffmffmmmmmmmfmmmfmfmfmmmmfmfmmfmmmffmfffffmfffmfmmmmmmfmfmfmmffmmfmmmffmfmfffmffmmmffffmffmfffmfmfmmffffmmmmmmfffmmmmfmfmmffmfmffmffffmmfmmfmffmmmfmmmffmmmmmffmfmfmffmfffffffmmmfmfffmmmffffmmffmffmfmfmmfmmfmfffmfmffffmfffmmffmffmfmmfmfmmfmmfmmffmmmfmmmfffmffffffmmfmmmfmffffmmmmfmmfmmmmfmmmfmmmfmmmmfmffmmffmfmmmffmfmmfmfmfffmmfmfffffmfmmfmmfmffmfmffmffmfffmmfmfmmmfmmffmmffmmmffmfmmfffmmfmmfmmmfmmmfmmfmfmmmmffffffmmmmffmffmfffmfffmfffmfmmmffmmmmfffmffmmfmffmfmfmfmmmfffmfffffmmfmmfmmmffmmfmmfffffmfmmfmfffmmmfmmmfmfmffmmmmmfmmfmmmfmfffmfffffmfmmmmfmffmmfmmmffmfmmmmffmfmfmfmfmffffmmffffmffmfffmffmffmmfmmmffmmfmfmmffmmffffffmfmffmmmmffmmfmffmffffmmfffmfmfffmmmmmffmmfmfmmfmmmffmmfffmmmmfmfmffmfmmmmmfmfmffmfffmfffmfmffmmmmfffmfmmmmfmffmmffffffmmmfmmmfmfmfmfmfmffmmfmmmmmfffmfmfmmmffmfmfmmmfffmfmffmmffffmmfmmffmmfmfmffmmffffmfmffmmmmmfmfmmfffmmmffmfmmffffffmmmmfmmmmmmfmmffmfmfmmmffffffmmfmmfmffffffmmmffffffmffmfffmfmfmmfmmfmfffmmmmfffmmfmfffffmmfffmfffffmfmffmfmffmffmffmmmfmmmfmffmffffmffmfffmmmfmmmfmffmffmmmmfffmmfffmfmfffmmmmffmmmmfmffffmmmfmfmmffmmffmfffmfmfmffmmfffffmffmfmmmffmfmffffffmffmfmfmfmmffffmfmffffmfffffmffffffmfmmfmfffmfmfffmmmfmfffmfffmmmffmmffmffmfmmfffffmfffmmfmfmfmfmfmmffmmfmmmfffmfmmmfmmfffmfffmfffmfmfffmmffffmfmfmmfmmfmffmffmmmfmmmfmmmffmfmmfmfffmffmmffmffmffffffffmmmffmmmmfmmffmffffmmfmmmmffmffffmmmmmmmmmmfffmfmffmffmmfffmmffmfmfmfmfmmmfmfffmfffmfmmmmmmfmmffmmmfmffmffmmfffmfmmfmfmfffffmmmmfmfmmmmmffmmfffffmfmmmmfmfmmmfmffmmmfmfmmffffmmmfmmfmfmmmmmmfmmmfffffmfffmmffmmmfffmffmffffmmmfffmmffmmmmmmmmmmfmmfmmfmffffffffmffffmfmfmffmmfmffmfffffmfmffmmmmmmfmmfmmmmfmffmfmmfmmfffmmmmmfffmmmmfffmfmffmmmmfmfmmmfmmfmfmmfmmfmmmfffmfffmmmmffmfffffmmffmmmfmmmmmfmmmffffmmfffmfmmffmmmmmmmmmmfmfffmmfffmffmfmmmmfffmfmmffmfmfffffffmmffmmfmffffffffmmfmffmmmffmffmfmmffffmfmffffmffmmfmfmmfmfffmmmfffmffmfmfmmmmfmfmfffmmmffmfmmmmffmmfmmffmfffffmfffmmmmmmfmffmmfmfmmmffmmfffffmffffmfffmffffmmmffmffmfmmmffmmfmmmmffmmffmfmffmmmfmfffmmmmfmmmfmmmffmfmmfffmmmfmffffmmfffmffmmffffffmmfffmffmmmmfmmmmmmffmfmfmmfmmmfffffmffffmfmmfmmmfffffmmfmmmmmffmmfmmmffmmmfmmfmfmmffmffmmmfffmmfmmffmmfmfffmffmmmffffmffmfffmfmmmmmmfmfffmffffmffmfmmffmmfmmffmmmffmmmfmmfffmffmfmffmmmffmmfmffmmmfffffmfffmfmmmmfffmfmmfmmfmmfmfmffmffmfmmffffffmmmmmmffmfmmmmmmffmfmmfmmffmfmmffmmmffmmfffffmfffffmmfmmmfmmfmfmmmfffmmmmmfffmmmffffmmfmfmmmmmmfffmmfmmfffmmfffmmffffffffmmffmfmmfmffmmmmfmmmfmfmffmffmfmfffmmmffmfmfmmfmmfmmffmfmfffmfmfmfmfffmfffmmffmfmmffmmmmmmfmfmffmmmfmffmffmffmfmmmfmmffmfmmmfffmffmmfmmmmmmmmfmmffmmfmffmmmfmfmfmfffmfmmmmmmfmfffmfffmffmfffmffmmmmfmffffmfffmffmmfmfmmfffmfmmmffmfmmmffmmmfmfmfffmfmmmffmmmfmfffmmmfmffmmfffmfffffmfffmfffmffffmfmmmmmmmfmmfmffmmmfmfmfmmmmmfffffffmmmmmmmmffmfmffmfmmmmmmffffffmmfmmmfmmmfmfmfmfmfffffmmfffmfmmfmmmmfffmmmffmffmffmfffmffmmmffffffmmffffmmmmmmffmmfmffmmmfmmfffmfmfmmmfmffmmmmmfmmmmmmfmfmmmffmmfmmfmmmfmfffmmfmfmfmmfmmffmmfmmmmmffmmmffffmmffmffmffffmmmmmmffmmffffmfmmmfmmfmfffffmfmmffmmfmmffmmmfmmmmmmffmmmmfmmmffffmmmmmmmmmmmfmfmmfmfffmmmfmfffmfmmmfmffffmmffmmfmmmffmfffffffmffmfffffmmmmfffmffmmffmffmmfmmfffmfmmmfffmfmffffmfffmmmmmmmfmffmmmmffffmmmmfmmffffmfmffffffffmmfmfmmmfmmfmfffmffffffmffmffmmffffmmffmmmfmmfffmmfmmmmmffmmmfmmfffffmmfffmfffmmfmfffmmfmmfmfmfffffffmfmmmmfmfmmfffffmffffmmffmffmfmfffmfmfmfffmmmfmfmmmmmmmmmmmffmfmfmfmfmfmmmffmfmmmmfffffffffmmfffmfffmfmmmmfmfmmfffffffmffmfffmmffffmfmfmmfmfmmmmmfmfmffmmfmmfffffmmmmmmmfffmmffmffffffmmmmmfffmfmmmfmmfmfffffmmfmmffffmfmmmfffffffffmmmfmfmmfmmfmmfmmfmmfmmffffmfmmfmmmmfmmmmfmfmfmmmfmmffmfmffmmmfmmfffmfmffmfmmmfmffmfffmffmfmmffmfmmmmffmfmmmmmmfmmfmfmmfmmfffmfmmmfmmffmmffmffmfmmmmfmmffmffmmmfffmmfmffffmmmffmmmmfmmfffffmmffmmffmmfffmmmmffffmfmffffmmffffffmfmmmmmfmffffmmffmffmfffmfmmmmmfmmfffmfmfmfmmmmmmfmmffmmfffmfmffmfffmmffffmmfmmmmffffmfmmmffmfffffmmfmmmfmffmmmmmfmmmfffmmmmffmmfmmmmffffmmffmmffffmfmmffmmmmmfffmmmmfffffffmffmfmmmfmffffmfmffmfmffmfmfmfmffmmmmffmmfmmffffmfmfffffmmmfmffffffmffmmmffmmmffmmmfmfmfmmmfmmmfmmmmmfmfffmmmfmmmffmfmfmfffmmmmfmmmfmmfmmmfffffmffmffffmmmffmmffmmmfmmmfmmmfmmfmfmmfmfmffmmmmfmmfmmmmmmmfmmmmmmmfmmmmmffmfffmffmfmmfmffmmmfmfmmmmmmmfmmfmfmfmmmmmfffmffmmmfmffmfmmmmmmfmmmmffmfffmmmmmfmfffffffmfmffmffmmfmffmmfffffmffmfmmmmmfmmmfffffmmffffffmmmmfmmffmmmfmfmmfmfmmfffffmfmfffffmffffmffmmmmffmmffffffmfmfmfmmmmmmmmffffmmmmfmfffmmffmmfmfffmfffmffffmmmmfmmmfmffmfmfmmmmfmfmmmmmmmmmmffmmfmmffffmmffmfmmmfffffmfmmmmmffmfmmmmfffffmmfmmffmffmmmmfmfmmmmmmfmmmmfmmffmffffmfffmmmffmmfmmmffmmfmffmmmfffmffmmmmffmmfmmfffmfmmmmfffmmmfmfmmmffmmmffmmffmmmfmfmmffmfmmmfmfmfmffffmfmmmffffmfffmfmmmmmmffffmfffmmffmfmmffmmfffmmmffmmmfffffmmmmfmffmmmmmfmmmfmfffmffmmmfffffmmmffmffmfmmfmmffffmmfmfmmfffmmmmffmmmmmmmmfffmmfmmmmmfmmfmfmmmfmfmmmmmmmfmmfmmfffmmmmmmmfmfmfmmmfmfmmffmmmmfmfmffffmmfmmffffmmmmffmfmfmffffmfffmfmmmmffmmmfmmmmmmfmmmffmmffmmffmmmffmfmfmmmmfmmmffffmmmffmfmmmmfmffffmffffmfmmmffmmfmfmmmfmffmfmfmmfmfmffffffmfmfmmmfmmmmfmfffmmfmmmffmfffmfmfmfmffffffmmmfmfmffffmmmfffmmmmmffmfmfmfffmmfmmfmmmmfffmfmfmmfmmfmmmmfffmmmmmfmmfffmffmmmmfmfmfffmfffffffmfffmfffmmffmmmmfffmmmmfmmffffmfmmmmfmffmmmfffmffmffmmmfmmmffmfmffffmffmfmmffffmfmmfffmfmffmfmfmfffmfmmmmmffmfmmmmmfmmmffffmffmmmmmmfmmffmmfmmffmmmmfffmmfmmmfmmfmmfffmmmmfmmmmmfmfffmfmffmmmffmfmmffmfmfmmmffmffmffmmmfmmmmmmmmmffffmffmmfmfmfmfmfffmfmmffffmmmfffmmfmfffmmmmmmmmmfmmfmmffmfmfmmmmmffffffffffmmffmffmmfmfmfmmmffffmmmfmmmfmfffmmffmffmmmmfmmmmffffmffmmffmmmffmffmffmmmffmmmmfffmmmffmfmfmmfmfffffmmfffmmmmfmfmmmmmmffmfmmfmmmmmfmfmmffffmmfmmmfmmmffmmmfffffmmfffffffmmffmfffffffmffmffmfffmffffmmfmffmmmfmffmffffmmmfmffmffmfmfffffffmfmmmfmmfmmfmmmfmffmffmmmmffmfmmmfmfffffmffmmmmmffffffffmmmmmmffmmmmmfmfmffffmfmmmffmmffmmfmmmmffmmmfmfmfmmffffffmfffffmffmmmmfmmmfmmfmfmmmmmmfmmffmmfmmmfffmffmffmmffffmmmffmmmffmfffmmmmmfffffmffmmmmffffmfmmfmfmmffffmmfmmmmmmmmmfmmfmfffmffffmffffmffmmfmffmmmmmfffffmmmmffffmmfmmmfmfmmffffmmfmmmmmmfffmffmmfmmfffffffmfmfmmfmmfmfmmffmmmmmfmfffmffmfmmmmfmfmmfffmmmmmmfmffmmmmfffmmmmffmmmmffmmmmffmmfmfmmffffffmffmfmffmffmffmfmfmmmfmmfmmmmmmfmmmffmmffmmmfffmfmmfffmfffffmfmfffmfmmffmfmfmmmfffmffmfmmfmmmmffmmfffmmfmfmmmmmmmmmmmmmfffmffmmmfffmfmfffmmmfmmfmffffmfmfmfmffmmfmfmmfmmffmfffmfmmfffmmfmmmfmmfmfmfmfmfffmffffmmffmmmmmfmfffmmffffffffmmmfmfmmfffmfmmmmmfmmmmfffffffmmmfmmfmfffmfmfmmmmfmffmffmmmffmmmffmfmmmfffmfmffmmfmfmmfmmffmfmffffmmmffmffmmfffffmmfffmffffmmmmmffmmmmfmmffmmmfffmmfffffmmffffmmmfffmffmfmfffffmfmmfmmfmmmmmmfffmfmmmmfffmffffffmmfmffmffmfmffmfmfffffffffmffmmfmmffmfffffmffmmfmfmmmmmmmfmffmfmfmfmfmmmfffmmmfmmmffffmfmfmmfmmfmmmfmffmmmfffffmmmmmmfmfmmmffffmmmmffmmmmffmffffmfffmffmfmmfffffffffmffmmffmmffmmmffmffmfmmffmfmfffmmmmmmmfmmmfffmmmmfmmmmmmmfffffffffmmmmmmmmffffmfmmfffmmfmffmmmmfmmfmfmfmmmffffmmfmffmmfmfmmmmmfffmfmmmmmmffmffffmmmmfmffmmffffmfmffffffmmfmffmffffmfmmffmmmfmmffffmfmmfmmmmfmmmfmffffffmfffffffmmfmfmmffmmmffffmmmmmmffffffmfmmffmmfmmfffmmffmfmmfmfmmmffmfmfffmfmmfmffmffmfmmmfmmmmfffmmffmfmffmmmfmmmfffmmmfmfmmmfmffmmffmffmffmmfmfmfmfmffmmffmmfmmmfmmmmffmfmmmfmmmmmmmmmffmmfffffmmmmfmfmmfffmmmmfmfmffmmfmfmmffffmmmmmffmfmmfmmmfmmffffmfmmmffmmmmmffmffmmfmfmfmmfmffmmmffmmmmfmmmmfffmmmfmmmfmmfffffffmffmmmffffmmmfffmmmmffffffffmffmmmmmmfmmmmffffmmfmffmfmfmmffmfmmffmmfmffmmffffffmffmfmmmfmffmfmmmfmffmfffmfmmmffmfffffmmmmmfffmfmffmfffmmfmfmfmfmffmmmfmmffffmffmmffmffmfmmfmfffmmffmfmfffmfmmfmfffmmffmmffmffmfmmmmmfffmmfffmmmmmmmfmfmffmmfmfmffffffmmmfmmmffmfmmmmmfmmmfmmfmmfmmffmmffffmffmffffmmffmffmffmfmfffmfmfffmmmmmmfmffmfffmfmffffmfmmfmffmmfmmffmmfmfffffmmmfmfmfmfmffmfffmmmffmmffmmmmmmffmmffmffmfmffmfmmmffmmfmffmmfffmfmfffmffffffffmffffffffmfffmmfmmffmmmfmffffmffmmfmmmfmfmfmmmmfffmfmfffmmmmmfmmffmmfmmfmmffmmmfffmffffmfmmmfmmmmfffffmmmmmffmmffffmfmmfmmmmffffmmffmmffffmmmmmmfmfmfmmfmmffmffmffmfmmmmfmfmfmfmfmffmmfmfmffmmfmmffmmfmfffmmmfmmmfmfmfmmfmmmmfmffmmmfmmfmmmfmfffmmffmfmmfmffmfmfmmffffmmfmffmfmfmmmmfmffmmmmmmmffffmmmmfmfmfmfmmfffmfmffmfffmmfmmmfmfmfmfmffmfmffffmmmfmffmmmmfmfmffmmfffmmfffmfmfmmmfmfmmffmfmmffffmffmmffmmfmmfmfmmmmfmfmmffmmmmmfmmmfffmfmffmfmmmffmmffmmfmmmmmffmmmmmffmmmmmmffmfmmmfmmffffmmfmfmmfmfmfffmfmmmmmfmmmffmmmffmffffmmmfmmmfmmmmfmffffffmmmmmmfmffmfmfmmfffffmmmmfmffmmfmffffmmfffffmfffmmmmfmmmmfmmfmmmfmmfmmmfffmmmmfmmfffmmmmmfffffmfmffffffmffffffmfffffmmmfmmmfffffmmmfmffffffmmffmmfffmmfmmmmmmfmmfmmffmfffffffmfffmmfffmfffffmffmffffmfmmfmffmmffmfmmfffmmmffmffmffmfffmfmmmfmmfmfffmmmmmfmfmmfmfmfmffmmmmmmfmfffmfffffmfmffmmfmfmmfmmmfffmffmfmmfffmfffmmmffmfmffmfmfmffmmmmmfmfffmmmmmmfffmmmffmmfmffmfmmmfffmmmmmfffmfmmfmmmffmmmfmfmmfmfmmfffffmfmfffmmfffmfmfmmfmmmfmmfffmfmfmmffmfffmmmfffffmfmmfffffffmfmmmfmmfmfffmmfmffmfmmfmfffmfmmmfffmffmffmmfmmmfmmfmmmmmmffmfmfmfmmfmmffmmfmfffffffmfffmmmmmmffmmmfmfmmfmffmmfmmmfffffmmmmmfmmmmfmmmffmffmfffmffmffmmffmfffffmmfmfffmfffmmmfmmffmmfmffmfffmmffmfmmmmmmmfmfffmmmmffmffmmfmfmmfffffmfmmffmffmmmfmmmmffmffffmfmmffmfmffffmmffffmfmfmmmfffmmfmmfmmmmfmmffmmfmmfmmffmmffmmfmmmmffmmffmmfmmfmmfmmffmfmmffmfmffmfmffmfmmfmffmmmffffmmffmffmmffmmfmffmmmmfffmfmfmmffmfmmfmfmfmmffmmfmmmfmfmmmmfffmmfmmmffmfmmffmfmfmffmfmmffmfmfmfmffffmfmmfmfffmmffmmfffmmffmmmffmmmmffmmfmfffmffmffffmmfmmmmmmmffmfffmmmmfffffffmfmmmmfmfmmffffmfmfmmffffmffffmfmmfmffmfmmmfmmmmmfmfmffmfmmmmmmmffmmmmmmmmmffmmfmfmfmmfffmmmmfmmfmmmmmmffmmmfffmmmmmmfmmfmmmmfmfmmfmmffmfmfmmmmmffffmmfffmmffmffffmmffffmmmmmfffmfffmfmmmfmffmmfffmmmfmffmfmmmmffmmmmmfffmmmmmfmmffmmmmfffmmfmffmmfmmfffmfmfmmmmfmfmmmmfmfmmfmmmmffffmmmfmmfmfmmmmmfmffffffmmmfmfmmmfmfmfmfmfmmffmfmmmfmffmmfmffmmmmmffmfmfmmmmfmmfffmmmmfmffmmmmmmmffmffmmmfmmmfmmfmffmmfffmmfmfmfmffmffmffmffmmmfmffffffffmmmffmfmmmmmmfffmfmmmmfmmfmfmfffmfffffmffmmffmmmfffffmmmmffmmmmfffmfmmffmmmfmfffmmmfffmfmmmffmmmfmfmmfffffmmfmmmfmffffmfmffmmmffffmmfmmfmfmffmfmffmmmmmmmmffmmmfffmfmmmffmmmfmmmfmfmmfmffffmfffmfmfmffmfmmfffmffmfmfmfmffffffmfmmmfmmmffmmfmfmmmffmfmmmmfffmmmfffmfffmffffffmmmmffmfmfmmmmfmfmmmmfmfmfmmmfmmfmfmmmmmfmfmmffffffmffmffffmffmmmmfmffmmmffffffmmfffffmmfffmmffffmfmfffmffffmfmmfffmfffmfmmfmfmfffmfmfmfmfffmfmffmffmffffmffmfmffmmmmffffmffffffmmfmfmmmffmmfffmffmfmfmmmmfffmmfmfmmffmmmmfmfffmfmmmmmmmfffmffmmfffmfmmfmffmmmmfmmmmmmmmffffmmfmmfmfffffmmffmmfmfmmfmmmfmfmmmfffmmffmffffffmmmfmmmmmmfmfmmmffffmfmfmmffmfmfffmffffmmmfffmmmfmfmfmmmmfmmmmfmmfmfmfffffmmffmffmfmmmffmmfmffffmfmfffmfffmfffmffffmfffffmffmmfmffmmmffmffmmffmmffmmmfmmffffmmffmfmmmfffmmfmfffmmffmfmmmfffffmfffffmmmmfmmmmffmmfmmfffmmffmmffmfffffffmmfffmmmmffmfmmffffmmmfmmfffmffmmfmmmmmfmffffffmmffmfmmmmfmmfmmffmmfmfmfffmmmmfffmffmfmmfmfmffmffffmfmmfmmffffmfmffmmmfmfffmmmmfmmffmfmmfmmmfmmmmmmmfmmmmfmmfffffffmmmmfffmfmfmmfmmffmmffffmfmfffmmffmmmmmfmmfffmmfmfmfffmffmfmmmmmffmmmmfffmmfmffmfmfffmfmmmmffmffmmmffmmfffmmmmmmmmffmmmmmfmfmmfmffmffffmffmmmfmfmmfmmmfmfmfmffffffffffmmfmfmmmmmmmfmfmfmfmmfffmmmfmfmfffffffmfmfmmffmmfmmfmmfmmfmfffmffmmfmmffmmmffmmmfmfmffffmmffmfmfmmfmfffmfffmfmfmmmffffffmfmmmfmfffmmfmffmmmffffmmmmmfffmmfmmffmffffmmmfmffmmmfmffffffmfmmfmmmmffmfffffffmfmfmffmmfmmmffmmfmfmmmmmmffmmfmmmfmmmffmfffffffmfmffmmmfmfmfmfffmmfmmfmfmmfffmffmfmfmffmffffffmmmffmffmfmfmfffmfffmfmfmmmmfffmmmffmmmffffmfmmmfmmfmmmmmfmmmffmfffmmmmmmmfmmfmffffmfmmffmfmmffmmffmmmfmmmfffmffmffmmfmfmmmfmfmmmfmmfffmffmmmfmfmmmffmfmfffffffmfmmffffffmmfffmfmfffmmfmmfmmfffmfmffmfmffmmmmmfffmffmffmmmmfmmfmmffmffmmmffmmfmmffmmffffmfmffmmmfmffffffmffmffffmmmfmfffffmmffffffmfmmmfffmffmmmffmmmmffffmmmmmfmfmmmfmmmmfffmmffmfffmffmffmmmffffmmmffmfmmmmmmfmmffffffmfmfmffffmmmfmfmmffmmmffffmmmmmfmmffmfmfmfmffmfmfmmmmmmfmffffmmffmmmffffmfffffmmmmfffmmffffmffmffmmfmmffffmffmmmffmffmmmfmmmffmmfmmffmmfmfmffmfmfmmfmmmffmmmffmmfmfmmmmmmfffmfmmffffmffmfmmffmmffmmmfmmmfmfmfmmffmmfmffffmmmmmmmmmmmmmmmmfmfmmfmfmmfffmfmmfmmfmmfmmmffmmmmfmffffmmfffmfffmmfmmffffmfmmmmffffmffmmmfffmffmmmmfmfmfffmmmmmffmffmmmmmmmffmmfmmmffffmffmmmmmfmffmfmffffmfmfmffffmffmfmmmmffmffmmmffmfmffffmfffmffffmmmffmmmffffffmmmmffmfmfmfmffmmfmmffmfffffmmfffmffmfmfffmffmffmffffmfmfmffmfffffffmffmmffmfmfmffmffmmfmmffmmfmmffmmmmmffffmmffmmmfmmmmmffmfmmmmffmmmmmfffmfmfmmmmmmfmmmmfmffmffmmmmmfmffmfmmfmfmmmmfmmfmfmmffmmmfmfmfmffmfffmffmfmfmmmfffmffmmmffmmmmfffffmfmmfmfmfffmmfmmmmmffmfmmmfmmmmfffmmmmmmmfmfffmmfmfmmmmmmmfmmmmfmmffmmfmfmfmffmmmmfffffmfmmfmffmmmfffmfmmmmfmfmmfmfmmfmfmffffmffffmfmfmmfmmmffmfmmmmfffmffmmfmfmfmffmfffmffmmfmfmmmmmmffmfffmfmffmmfffmfffmfffmfmmfmfmmmmmmfmmmfmffffffmmfmmfmmmmmmmfffmmmfmmfffmfmfffffmffmfmfmmfmfmmffmfmffmmfmfffffffffffmmfffffmfmmmfmmfmmmfmmmmmfmmmmfffffffmmmmfmmfffmfmffmmmmffmfmfmfffmffffmffmfmmfmmmffmffmmmfmfmmmfmmmmfmfmfffffffmmffmmmffmfffffmfffmmmmmfmfffmmmfmmfmfmffmffmfmfmffmffmfmmmmmfmmmmmmfffmfmmfffmmmmffmfmfmfmmmfmfmmfffffffmmmfffmfmmfmmmmfmmfmmfmffmmmmfmfmfmmfffmmmmfmfmmmfmffffffmffffffmmffmffmmmmffmmffmfffmmfmfffffmfmmfffmffmfmfmmfmffmmmmfffffmfffffffmfmmmmffmmmfmfmffmmmfffffffmffmmmffmfmmfmffmmmmmfffffmmmmffmmffmfmmfmmmffmmffmffmmfffmmmfmmfffmmmffmmfmmmfffffmfmmfmfmffmfmmmffmmmfmmffmfmfmmmmfmfffmfmmfmmmffmmmmffmfffmmmfmmfffmfmmfmmmfffffffmfffmmfffmmmmffffmffmfffmffffffmmffffmmfmfmffffmmffffffffmmffmmmfffmmfmmffffffmmffffffffffmffmmmfmfmmmfffmfffmmmffmmmmmmffmfmfmffmfffmfmfmmfmmffmfmmffmmmmfffmfmfffmfffffmffmfmfffffffffmmmfmmfffmmfmfmffffffmfmmfmfmmmmmmfffffffmfffmmmmfmffmmfffmfmmmmmfmmfmfmffmfffmfmfmffffffffmffffmfmmfmfmffffmffmmfmmmfmmfmmmmmffmmfmffmmmfffmffffffmmffmfmmmmmffmfmfffffmmfmmfmmffffmmfmfmffmfmmmfmfmmmfmmffffmfmffmfmfmmfffmfmmfmfmfffffffffmmmfffmfffmffmmmffffmffmfmffmmffmfmfmffmmfmmmfmfmmmmmmmfmffmmfmfmffmmmfmmmmfmfmfmmmffffffmfmfmffffmmfffmfmmfmmffmfffffmffmfmmfmmfmfmmmmffmfffffmmffmmmffmfffffffmmmfmfmfffmfmmfmmfffffmfmfmfmmfmfffffmffmffffffffmmmmfmmffmfmfffffmmmfmfmmmmmmfmmmmffmffmmfmmffmmffffmmfffmfmfffmffmmmmmmmmmmmffmmfmmfffmmfmfmfmfmmffmmffmmfmmmmfmmfffmfmmmfmmfffmmmmmffmmfmfmfmmmfmmffffmmmffmmmffmmmffmmmfmfmfmfffffmmffffmfmfffffmmfffffmffffmfmmfmmmfmfmffffffffmmfffmmfmmffmmmmmmmmmmffmmmmmmmfmmfmmmmmfffmmmfmmfmmmmmffmmfmmmmfffmfmmfmffmfmmmmmmmfmmffmffmffmmffmfffffmffffmmfmmmmmffmfmmfmmmffffmmfmmmmmffffffmmmfmmfmmmfmmmmmmfffmfmmmmmfmfffmmfffmfmfmfffmmmmmffmmmfmfmmmfmfffffmfmmfmffmmffmfmmmmmffmfmfmmmfffmfmmmmffffmmmffmmfmfmffmffmfmmffmmmfffmmmmmmffmfmffffmmfmmffmffmfffmffmfmmffmmmmffmmmfmfffmfmfffmffmfmmffmffffmmffmfmfmfmfmmmmfmmffmffffmmmfmmffffffmmmmfmfmfmffffmmffmmmmfmfmfmfmmmfmmfmffmmmffffmmfffffffmfmmmffmmmmmffffmffmfmmfffmmmfmmfmfffmffmmfmffmmmmfmffmmfffmmfffmfmffffffmfmfmmmfmffffmmfmmffmmmmfmmmfmmfmmfffmfmmfmmfffmmmmfmmffmfmfmffmmffmmmmmmfmffffmffmffmmfmmmfmmffffmmfmffmmfmfmffmmfmmmffmmfmfmffmmfmmmmfmfmfmfmfmffmmmmfmfffmffmfmfffmfmmmmfmfmffmmmffmmmfmfmffmmmmfmmmfmfffmmfmmffmfmffmffmffmmmfmmmffffffffmmmfmfmffffmffmfmmfmfmffffmffmffmmmmfffmmffmmmffmmfmmfmmfffmmfmmmfffffmmmmmffmmmmmfmffffffmfffffmffmmfffmmfffmmmmmffffmmfffffmmfmfmfmmmmmmmffffmmmffmffffmmmfffmmmffmmfmmmfmmfmmmmmfmfmmfmfmfffmmmmmfmmffmfmfmmmmmfmmmmffmmmmmfmfmffffffmmffmffmmfmmffmfmfmfmmfmmmmmfffffmfffffmfffffmmmmffffffmfmffmmmmmmfffmmmfffmmfmfmmfmmmmmmfmfmfmmmfmmmmffmmfmfmfmffffmmfmmmmffmmfmfmffmfffmffmfffffmfffmmfffmfffmfmmmffmmffffmmfmmmmmfmffmmmmfmfmmfffmfffmfffmmmfmmmffffmmmmfmfffmfffmmfffffmmfmmmmmmmmfffmffmmfmmmmmffmmmmfmmffmffmfmffmfmffmmffmfffmfmffmffmfmfffmfmmfmfmmmmfmmmmffmmfmfmmmmmfmfmmfmfmfmffmmmfmffmmmmmffffmmmmfmfmfmffmmmfmmmmmmmmmmmmfmfmfmffmmmfffmmmffmmmffmffmfmfffmmmffmmffffmmfffmmfmmfmmmmfmffmmffffmmfmfmmffmfffffmffffmmfmfmmffmfffffffffmmfffmmmmfmmmmfmmfffffffmmmmfmmffmmmfffmmfmmfmffmmmffmmmfmffmmmmmmffmmmmffffmffmmmmmfmfmmmmffmmfffmfffmmffffmfmmffmfmmmffmmmmfmfmfmfffmmffffmmmmffmfmmmmmmmmffmmmmffffmmffmmmfmfffmmfmfmfffmmmfmfmmfmffmfffmmfmmfmffmfmfmmmffffffmfmfffmmmmffmmmmfmfmmffffmfmmfmffmfmmmffmfmmmmmfmfmfmmffmmmmfmmmffmfmfffffmfmmmffmmmmfmfmmffmmfmmmffmffmmmfmfmmffmfffmmfmfmmffmffffmfmmmmfmmfffmmmmmmfffmffmmmfmfffffmmffffmmfmmffmmffmmmmmfmmmmmmffmmfmmmmmfmfmfmfmfmmfffffffmfmffmfffmmmmmffmfmmmfmffmffmmmfmfmmmmfffffmmfmfmfmmffmfmffmmffffffffmmmmmfmfmmmfmfmmmmmffmmffmmfmffmfmfffmmffmfmfmmfmfmmfmmmmfmmmffffmfmmfmmmfmmmmfmmffmfffmfmfmmfmfmmmfffmmmffffmmfffmmfmffffmmmfmfmmmfmmmmmmmfmmffffmmmmffmfffmmffmmmmffffmffffmmmmfmmmfffmmmffffffmfffmffmfmmmfmfffmfmffmffffmmfmmmfmmffmfmmmmfmmffmmffmmmmmfffmfffmmfmmfmmffffmfmffffmffmfffmmmmmmfmmfmffmfmmmmmfmfmmmfffmffmfmfmffffmfmmffmmmffmmffffffmfffmmfffmmmfmmfmfmfffmmfffmfmmmmmffmmffmmmmfffmmmmffffmmmffmmfffmfmmfmfmfmfmmffmfmfffmffmffmfmmffmmmfmffmfmmfffmfmmfmmmmffmmfmfmmmfmfmmfmfmfmmffmmmffmfmmfmfffffmmmmmfffffffffmmmmffmmmffmmfmfmfffmfmfmmffffmfmfmmmffmffmmfmmffmfffffffmfffmfffmfmffffmfmmfffmffmmmmmmffmmfmfffmffmmmmfmmfmfmmmfffffmmfmmffmmffmmffmfffmfffmmmmmffmffffffmfmmmmmfmmmfmmmfmfmfmmmmmfmfffmmffmmmmmffffmmfmmmmmfmmffmmmffmffffmfmffmfffmmmmmmmmfffmfmfmmmfmmfmmffmmfmfmmmffmfmffmmmmfffmmmfffmmffmfmffmmmmmfffmmfmfmfmfmmffmfmfmmfmfmfmmffffffmfmmmfmmmmmfffmffmfmmffmfmmmmfmmmmffmmfmfmmfffffmfmfmfmfmmfmffmfffmmfmmfffmfffmmfffmmffmfmmfmfffmffffmffmmmfmffmffmmmfmfmfmmfmmmfffmmmmffmmmmffmmmfmfmmfmfffffffmmmmfmfmmmffmmfffmmfmffmffmmmfmmmfmfffmmfffmfmmffmmmfmffmmmfmmffmfmmmfmffmfffmffmmfmmfffmmfmmmmfmffmffmfffffmffmmmmmmfmmffffffffmfffffmffffffffmfmmmmfmmfmfffmffffmfmfmmfmffmmffmmffmfmmmfmmfmmfmmffmffmmmffmfmmmmffmfmffmmffffmfffffffmfmfmmfmffffmfmmffffmffmfmmmmmffmmfmffmfmmfffmfmmfmmfmffmmfffmmmmffmmmmmffffffmmfffmmfmmfffmffmmfmmmfmmmmmffmmfmffffffmffmfffmmfmffmfmmffffffmffmmmfmmmmfmffmmmmmmfmfmmffmffmmffmmffmmmmmfffffmmfmmffmmfmffmfmfmmmfmffmfffmfmfmffffmffmmfffmfmffmfmmmmmmffffffmfmfmmmfmmfmmmffmfmfmffmmmfmmfffmfffffffffmmmffmfmmmmmmfmffmffmffmfmffmmmmmmffffmfmmmmffffmffffffmmmfmfmfmffmmfmfmmmmfmffmmmmmffffffffffmfmfmfffffffmffmmffmfmmfmmmmfffmmfmffffmfmmfmffmffmfffmmmffmmmfmffmmmmmfmfffmmmmfmmfmmmmfmmfffffmmmmmmmmfmmmfmfmmfffmmmmffffffmfmmmffffmfmmmffmmfffmmfmmfmmffmfffffffmmmffmffmfmmmfmffmmmfmmmmmffmffmmmmffmmmmmmfmmfffmmmffmfffffmfmfmfmffmfmffmmmmmmmmmmffmmmffmffmfmmfmmfmffmffmfffmfmfffmmmffmffmmmfmfmffmfmfmmmffmmfffmmfffffffmffmfmmfmfmfmmmmfmmffmmmffmfmmmfmmfmmmmmfmmmffmffmmmfmmmmfmmmfmfmffmmfmmffffffmffmfmfmmmfmffmmmmmmmmmfmfmmmmmfffffmffffmmmfmffmmmfmmmfmmffmfmmfmfffmfffmmfmffmmmfmfmmmmmfffmmmfmfmmmffmmmmffmffffmmmfmffmmfffmmmfffffmfmmmffffmfmffmmfffmffffmmmmfmfmmffmfmffffmfmmffmmfmfmmfmfmfmffmfmfmmffmfmfffffmmfmmmmfffffmmffmmmmmfmmmfmmmmmmmffmmmfmfmfmfmmfmfmfmmffmmmffmffmfmfmmmffmmfffmfmmfffmmmmmmmfmffmffmmmmmffmmffmfmffmfmffmmmfmfmmmmmfmmffffmmfmffmmmfmmmfmffmmffmfmfffmfmmmfmfffmmffffmmfmfmmfmfmmfmffmfmmffmmfmmffmmfmffmmffmmmffmfmfmffffmmfmfmfmfmmmmfffmmmmmffmmfmfmmmmffmmffffmfmmfmmfmmffmfmfmfmfffmmmmfmmffmfmmfmffmmfmfmfmfffffmmfmfmfmfmffmmfffmmmffffffmfffmmfmmfmmmfmffmmffmmfmmmmmmmffmfffmfmfffffmffffmmmffffmmffmmffmmmmfffmfmmfmfmfmmfffffmmmfmfmfmfmffmffmfmfmmfmmmmmfmmfmmmmfffmfmmmmffmmfffmfmfmffmmmfffmffffmmfmmffmmmffmmmmfmmmfmfmmmfmffmmffmfmffffmmffmfffmmfffmfffffmmmmmmmfmmmmffmfmmfmfmmfmfffmmfmfmmmmmmfmfffffmmffmmfmmfmmfmffmffmfmfffmmfffmfmmmffmmmmmfmffmffmmmfmmffmfmmmfmfffmfmmfmfmmffmffmmmfmmfmffmmfmmfmffmmffffmffmffffmmmmfmfmmmffffmmmfmfmffmffmfffmmfmfmfmfmffmmfffffmmmmmfffffmfmfmfmfffmmfffmmfffmfmfffmffffffmfmfmffffmmfmmmmfmmfmmfmffmmmfffmmfffffffmmfffmmfmfmmfmmfmfmmfmfmfffffmffffmmfmfmmmffffmmmfffffmffmmmmmffmfmfmfmfffmmmmmmffmmfmffffmmmmmfmmfmmfmmfffmfmmmfmmfmmfmfffmfmfmffmfmfmfmffffmfmmmfmmffmfmmffmfmffmmmmffmmmmmfmmfmmffffmmmffffmmmmfmfmffmmmmfmffffmmmfmffmmmmmmffmmfmfffffmfmmmmffffmmmfmffffmfffmffffmffffffmmmfmfffmffffmfmfmmmfmfmfmmfffffmfmfmmfmfmmfmfmffmfmfmmfmffmmfffmmfmmfffmmmfffmfmfmmmmmmmmmmmffffmmmfffmmfffmfmmfmmffmmfmfffffffmffmffmffffffffffmmffmmmffffmmfmffffffmmfffmmffmmfffmfmmffffmfffmfmfmfmffmmffmffffmfmmmmmmfmffmmmmmmmmffmmmmmmfmmmmfmfmmfffmmmmfmmmffmfmmmmfmmffffmmfmmmmfmmfmmfmffmfmmmmmmfffmmmfmffmffffffmfffmmfmfmfmmmmmmffmfmmfmmfmmfmffmfmfmmmmmffmfmfmmmfmffffmmffffmmmmfffffmmmffmmffffmmmfmfmfmmmfmffmffffmmmmfmfmmfffmffffmffmmmfmffmfmfmmfmmmfmfmfmffmmmmmmmffmffmfffmmfmfffmmmfmmmffffmmmffmmfffmmfmfmmmmfffmmffmmfmmmfffmmmmfmfmmfmmffmmfmfmffffmmfmmfffmfffmmmfmmfmmffmffffmfmmmffmfffmmmffmmmfmmmfmffffmmmmfffmmffmmmfmfffmfffmfmffmffffmmmffmmfffffmfmmmfffffmffffmmffmmmmfmfmffmmmmmfmmfmmffmffmffmmffmmfmmmffmmmfmmmfffffmmmmfmmffmmmmffmmfmmmmmfmmffmfmfmfffmfmfmfmmffmmffffmffmffmfmfmmmmfmmmfmffmmmmfmffmfmfffmffmfmfmffmffmmmmffmmffmmfmfffmffmmmfmmmfmffmffffmfmffmmffffmfmmmffmfmmfmffmmffmmmmffmmmfmmfmfmmffmmffffmmmffffmfmmfmmmmmmmmmffmmmmmfffmmmfmffffffmffmffmmfffffmfmmmfmmfffmffmfmfffmffffmffmfffmfmmmfffffffmmffffmfmmffmfffmfmmmmfmmfmfmffmfmmfmfmfffmfffmmfmmfmmfffmffmmmfmmffmmmmmmfffmfmfmmfmmmmffmfmmmmmmmfmmfmmffmmfmfffmfffffmmffffmmfmfmmmfffmmfffmmmmmfffffffmmffmfmfmfmffffffmfmmfmffmffmmffmmmfmfmmfmmfmffmmfmmfmfmmmmfmmmffmfmffffffmmmmfmfmmmmfmfmmmfmmffmffmmmfmffmffmmfffffmmmmfmfmffmfmfmmmmmmfffmfmfffmmfmffffmmffffmfmmffmfmfffffffffmmmmfffmmmmmmmmfmmffmfmmfmmmffmffffmffmfmfffffmmmfmmmmmfmfffmmmmfmfffmffmfmffmffffmfffmmffmmffmffmmffmfmfmfmmmffmmmfmfmfmmmfmmmfmfmfmfmfffmmmfmffffmmmmffmffffmfmfmmmmmmmfmmmfffmffmfmmffmmmmfmmfmfmmmffffffffffmmfmfmffffmfffmfmfffffmmfffffmmmfmmfmmmffffmmfmmmfmmffmfmffmmmmmmmmffmfmffffmffmfmfmmffmfmmffmmmmffffmfmmffmfmfffffffmmmfmmffmffffffmmmmmfmfmmmfffmffmmfmmfmmmfffmffmmmfmmmmfmffmmmfmmffmfmmmmmmmfmfmfmffffmmffmmmmfmmffffmmmmfmffmffffmfmmfffmmmfffmmfmmmfffmmmfmmfffffmffmmmffmmffmffmmfmfffmffmfmffmffmmffffmmmmfmmfmfmfmmfmmfmfmfmfmfffmffmmffffmfffmfmffmffffmffffmmmmfmmmfmmfmmmfffmffffmmmfmmffmmmmfmfmffffmmmmfmmfmmmfmmmmmmffmfmffffmmfmmmmfmmmfmfmmmmfmffffmmfffmfmmmmffmfmmmmmmfmmfmmffffmmfmfffmmffmmmfffmmfffmffmmffmffmmffmmfffmmmfffmmffffmmfffffmmfmffmffmmmmmfmffmfmmffmmmmmfmffmfmmffmffmfmmmmmmffffmffffffffmmmfmmmfmmmmmffmfmffmmmmfmffffmmffffmfmmmmmffmmmmmmmmmmmfffmmmmmfmmfmmmfmmffmmfffffmmfmffmffmmffmffmmffmffmmmfmfmfmmmfmmffmfmmfmfmmmmmmfmffmffmmmmffmfmfmmfmfffmfmmmmfffmmmmmmmmmfmfmmmmmmffffmfmfmmfmmfmfmfffmmffmmmmmmfffmffmfmmmmffmfffmmmfmfmmffmfmfmfmfffmfmmmmmfffmmmffmffmfmffmmmmfffffmmmfmmfmmmfmmmmfffmmfmmffffmmfmmmmmfmmfmffmmmmffffmfmmfmmmmmfmffffmfmfmmmmmmmffmmfffmmmfffmmfmmmmmmfmfffffmfmmmmmfffmfmmfmffmfffmmmfffmfmmmmfmfmffmfffffmfffffffffffmfffffmfffmmmffffmmfmfmmfffffffffffffmfmmffmmmfmmfmfmmfmmmffmfffmfffmfmmffmmfmmfmffffffmmmffffmmmfmmfffmfffmffmfmmffffmfffmmfmmmmfffffmfmmmmfmmffmfmmmffmmffmffmmmffmfmmmfmffmfmfmfmfmmfmmmmfmmfmmfmmmfmmfffmfffffmmfmffmfffmffffmfmfmmmffmffmmmmfffmmmfmmfffmmmmmmfmfmmfmfffffmmmffmmffmffffffffmmmmmfmffmffmfffffmmmmffmfffmmmmmfmfmfffmffmfmfffmffmmffmffmfffmmmfmffmffmffmfffmfffmfmfmmmmffmmmmfmfmfmfffmfmmmmmmmffmmfffffmfmfffffmmfmfmfffmmmfmfffmmmmmfffmmfmmfmfmffmmfmffmffmffmmfmfffffmfffmfmmmfffmfmfmffmmmmmmmmffmmmfmfmmffmmmmfmfmfmfmfmmmmmfmffmfmmffmmfmfmfmmmffffmffmmffmmfffmmfmmfmmfmffmmmmmfmmmfmmfffmffffmfmfmffmfffmmmfmmfffmmmmffmfmmmmmfmfmffmffmfffmmmmfmfmmffmmffffffmmfmmmmmfmmfmmffmfmfmfmfmmmffmfmfmfmmmfmmfmfmffffmmfffffmffmmffmfmffmmfmmmmmmmfmffmffmmmffffffmfmffmmfmmmfmmfmmffmmfmfmfffmfmfffmfffmfffmfmfmfmfmmmffmfmmffmffmmmffmmmfmmffmfffmmfmfffmffffmfffffmmmmfmmfffmmmfmmfmfmmmfmfmmfmfffmmmmffmmfffmffmmffmmfffffmffffmmfmmfmmfffmmffmmmmfmmmffmffffmfffffmffffmfmfmmmffmmmfmfffmmmfffmfffffmmfmffmmfmmmffmffmmmmmmffmfmmmffffmmfmmfffmmmfmmmmfmffmffffmffffmmmmmmmfmfmfmmmfmfmfmmfmfmfmmmmffmfmffffmmfffmmffmfmmfmmfmmmffmfmffmmfmffmmmfmmmfffmfmffmfmmfmffmffmffmfmmfffffmfmffmfmmfffmmfmmffmmfmmfmfmfmffmmfffmmmmmffmfmmmfmfffmmfffmmmmffmmfmfffffmfmfmfmfmmfffffmfmfmfffffffffmmfmmfmffmmmfmfmfmmmmmmffmmfffmmmfffmmmmfmmmffmmmffmmfmmfffffffffmfmmffmmmmmmffffmfffmffffmffffmfmfmmmmfmmmffmmfffmmffmmfmffmfmffmmfmmmffmmmmmffmffffmffmmmmfmfmfmfffmffmffmfmfmmmfmmmmfmmfmmmmffmmfmmmfmfmfmfmmmfmfmfmffffmmmfmfmfmmmmffffffffffffmffmfmffffmmmfmfmffffffmmmmfmfmffmfffmmfffmfffmffffffffffmfmmfmmfmmmffffmfmmfmffmmfffmfmfffmffmmmfmmfmfmfmmmfmffmfmfmmffmmmmffmfffmmfmmmfmmfmmmmffmfmfffmmmffmmmmfmmmfmmmfffmffffmffmmmmmfmfffmmffmfmfmfmmffmffmffmffmmmfffmmfmfmmmffmffmmfmfmmfmmmfffmmfmfffmmmffmmmffmmfmmffmfmffmmfmfffffmmfmmfmfmfmfmfmmmmmffffmffmffffmffffmffffmfmmfffmmffmffmmmmffmfmmmfffmfmfffmmmfmmmffmmmfmmmfffmmfmmmmfmmffmmmmfmfffmfmmfmfmfffffmfmfmmfmmmmfffmmfmfffffmfmfmfmmfffffffffmmmmmmfmfmfmffmfmmffmmfmffmfffmfmffmfmmffmffmffmmfffmmfffmmfmffmmmfmmffffmffmmfffffmfmfmfmffffffmmmmmffffmfffmfmmffmmmfmfmfmffmffffmffmfffmfmmmfmmmfmmfmmmfmmmmmmmffmmffffmfmmfmfmfmfmmffmfmfmffffmfmmmmmffmfmfmfffmmmfmmffmfmmmmmmfffmfmmmffffffmmffffmfmfmmfmfmfmmfmmfmmmffmfmmmmfmffmfffmmfffmmfmfmfmmfffmmfmmfffffmmfmfmfmmfffffmfmmmmfmmfmfffmmmffmffmmmfffmfmmmmmfmfffmfffffmmffmffmmfmfmfmmfmfffmmmmmmmmffmfmffmmmfmffmmfmfffmmmmmfmfmfffmmmmmfffffffmmmfmmmffmmffmmfffffffmmmffmmmffmmffffmfmmfmffmfmmmfmmfmmmfmfmmffmfffmmffmffmfmffffffffmfmmmfmffffmmmfffmmfmfmffmmffffmmfmmmmffffmmffmffffffffmmmfmmmffffffmffmffmmmfmmffmfmmfmfmfmmffffffmffmmmfmfmmffffffffmfmmfmmffmmfmmfmffmffffmmfmfmfffmffmmffmmffmmffmfmmfmffmfmmfmfmmmmffmffmffffmfmmmmmfffffmmmmmmfmmffmfmmfmmmfffmffmmmmfmffmfmmmmfmfffffmmfmmmmmffmmmmmfmfmffmmmfmmmfmffmmmfmmfmmmfmmmmfffffmfmffmmmmmmmfmfmffmfmfffmmmfmffmffmfffmmfmmmmmmmfmmmfffffmmmmmmffmmmmmffmmmmfmfffmfmfmfffmfmffmfmfmmmffffmmmmffmffmffmfmfmfffmmmmffmfmffffmfmffmfffmmmfmfmfmfffmmmmfffmffmfmffffffmfmfffffmmmmfmmmfffmmfffmfmmfffmfmfffmffmfmfffmmffmffmmmmmmmmmfmmmmmmffffmmmmfmmmmmfmfmmffffffmmfmmfmfffmfmmmmmmmmmmmffmfmffmfmmfmffffmfmmmfffmmmfmfffmmmfmffmfmmmfmmmmffffffmfmfmmmfmmmfmfmffmmfffmmfmffmmffmmmffmfmffffmffffmmfmfmffmffffmmmffmmmffmfmmmmmfmfmmfmfffmmffmmmmmmffmffmfmfmfffmmfmmffffmmmmffmmmffmfmffmmmmffmffffmmmmfmmfmmmfffmmffmffmfffmmfmmmmmffmmmffmfmfmmmmffffffmffmfmmmfmfmmmmffffffmfmfmmffmmmfffmfffmffmfmmmfmmfmfmmfmffffmmmmmmmmfmfmmmmmmffmffmfmmfmffmmmmfmmmmmfmmfmmfmfffmmmmmfmffmmfmfmfmffmfffmmfmfmmmfffmfmfmfffmfmfmfmfmmmffmffffffffffffmfmmfffmfmfmffmmmmmmmfffmmmffffmmmffmmmmffmmfmffmfffffmfmfffmfffmmmfmmmfmmffmmffmmffmffmmmmmmfmffffffmmmmfmmfmffmfmmmffffffmfmmmmfmmmfmmmmfmfmmmffffffmmmfmmfmmmffmfffmfffmfmmmmffffffmffmmffmmmmmmmmmfmfmffmfffffmmfmmfmmmfmfmffmmffffffmffmmmmmfmfmmffmmmmffffmmmfmffmffmmfmmfmmfmmmffmfmmmmmffmfmfmfffmmmfffmffmfmmmfmffmffmffmmfffmmfmmfmffffmmfmmfmmmffffffmmfffmfffffmfmfmffffmmfmffffmmfmmmmmfffffffmffffmfmmfmmmmfmffmmfmmmmfffmmfffmffffmmmmmmffmmmmmfmffmmmfmmmmffmmfmmfffmfmfmffmfmffffmfmfmmmmffmffffffffffmmmmfmfmfmfmfmfmfmfmmfmfffmmfffffmffffmfffffmfmffmffmffmmmmfmmmffmfmfmmmfffmfffffffmfmffmfmfmfmfmmffmmmffmffmmmmmmmfmffmmffmffffmfmmmffmfffmffffmmfmmfmfmmffmmfmmmffmmmffmfmmffmffmffmmfmmmfmffffffffffmffmmfmfffffmfmffmmfmfmmmfmfmfmmmmfmmmmfmfmfmfmffmmfmmfmfmmffmfmfmfmmmmffmfmfmfffmmmfffmfffmfmmmfffmffmmmmfffmfmmfmmmmffffmmmmfmfmfmmmffmmmfffmmmfmmmfmffmmfmffmmmmffmmffmfmmmfmmfmffmfmfmfmmfmfmffmmfmfmmfmmmfmfmffmfffmmfmffffmffmffmmmmmmffmmfmfmmffmfmfffmffmfffmffffmmmmfmfmffffmffffmfmmmmmmmffmmmfmfmmfmmffmffmmmfmmfffmmmmfmmmfmmfmmfmfmffmmmmmfmmfmmfffmfmfmfmfffmmmmffmmfmfffmfmmmffmmmmmfmmmffmfmffmfmfmmffmmmfmmmmmmfmfmmfffmfmfmmfmmmffmfmfmmfmfmffffffmmmmfffffmffffmffffmfffmmmmfmmffffmmfmmfmfmffffmffmmfmffmfmfffmmmmffmffmffmmmmmfmmfffmmmfffffmmmfffmmfmmffmfffffmfmfmmmmmmfmmmffmffmmmffmmfmmffmfffmmmfmmmmffmmmmfmfmmfmmmffmmmmmfmffmmffmfffmmmmfmfmfmfmfffmmfmmmffmfmmfffffmffmfffmmfffmfffffffffmmmffffmmmfmmmmmmmmmffmfmmmmfmmmfffffmffffmfmfmfmmffmmfmmmmmmfmmffmfmmmfmmfmfmmfffmffffffmmmfmfmmfmmmfmmfmmmffffmffffffmfmmmffffmmfmmffmfffmmmfmmfmmfmmffmmmmmfffmmffffmfmmmfmmffmfmffmfmffmmfmfmfmmfmfmfffmfmfffmmffmffmmfmmfmfmmffmfmmfmffmmmfffffmfmfmffmfmmfmmfffmmmmmmmfmmfmfffmfmfmmffffmmmfffffmmmmmmmfmfmfmmmffmmmmfmmmfmmmfmffmmfmmfmfmfmmmfmffffffffffffmffmffffffmfmmmfmmfmfmmmfmfmmmfmffmfmffmfmfmmmmmffmfmfmmfmmfmmfmmfffffmmmfmmmffffmmfmfffmfmmfffmmffmmffmffmmmfmffmmfffffmmmmfmfmfffmfffffmfmmmfmmmfmmfmfmfmfmmfmfmmmmfmfmmmmffmfmmmmmffmfmfmffffffmfffmfmmffffmmfffffmfmffmffmfmmmffmfmfmfmmfmmfffmmffmfmmfmmfmfmffmmmmfffffmmmmffmmfmfmffmfmmmmfffmfmfffmmmmmmfmfffmfmmmfmmmmmfmfmmmmmffffmfmfmmfmmmffffmmffmfmffmffmmffffmmfmmmfmfffffmfmffffffffmmfmmfmmmmmffmffmmfffffmmfmmmfmmffmfmmffmfmmmmffmmfmfmmfffmmmffmmmmmffmmffmmmmmfmffmmmmmmfmmmfmfmfmfmmffmffmfmmfffffffmmffmfmffmfffmmffmffmmfmffmffffmmmmfffffffmmfmffffmffmffmfmmfffmmffffffffmmffmmffmmfmfffmfmmmmmfmmmmmmmffmfmmmfffmmfmmfmffmffmffmfmmfmfmfmffmmmfffmffmffmmfmmmmfmmffffffmmfmffffffmmmmffmmfmfmfffmmmmmmmmmffffmffffmmffmfmmffmfffmfmffmfmmmmffffmmmmfmmffffffffffmmfmmmffmfmmmfmmmffffmfmffffmffmmfmfffffmffmmmmfmmffmmffmmmmmffmfmfmmffmffmmfmfmfmmmmfmfffmmfmmfmfmffmfffmffmmmmfmfmmffmfmfffmmmffmmffmfmfmfmfmfmmffmmmfmfmmmmmfmmmmmfmmfmfmffffmmmmfmmmmfmmfffmmfmffmmmffmmffffmfmffmffffffffffmmmffmfmmffmfmfmfmmfmfmmmfmfmmmmmfmfmmffmmffffmmffmfffffmfffffffmmmmmfmfmfmmffmffmmmffmmmfmmmfmfffmmfffmfffffffmmmmfmmfmmfmmfmfmmmfmmffffmmmffmmmmmfmmmfmfmffmmffmfmmfmffmfmfmmffmmfmffmfmmmfmffmfmmffmmfmmfmmfmfmfffmfffmmmmfmmmmffmmmmfmfmfmmfffmfffmmffffmfmmmffmmffmmmmfmmfmmmfmmmmfmmmffmfmmmmmfmfffmmmfmmmmfmmffmmmmffffmmmfffffmfmmffffmmmmmmfmffffmmffmffmmfmffmfmmmmmmfmmffmfffmmmmmmfmmffmffffmffffmmmmmmfmffmffmfmmfmffffffmffmmfffmmmmmmmmfmmmmmmmmmmmffffmmmffmmffmmmfffffmfmmmmmffmfmmffmmmmmfmmmmmfffffffmmffmmffmmfffffmfmfmmffffmfmmmfffmmffmffmffmmffmffffffmffffmfmfffmffmmfmmmffmfmffmmmfmfmfmmmffmmmmmmmmfmffffmmfmmmffmfmffmfmmmmmfmmmffmffmmfmfmfmffmfmfffmfffmmffmmffmmmfmmmmmmmffmmfffmfmfmmfmfmfmmmfmmmfffmmmmmfmfmmmmfmmmfmmfmfmmfmffmmmfmffmmffmmfmmfffmfmfmmmfffmffffmfmfmfffmmmmmfmmmfffmmmfmfmmmmmmffffmmmfmfmmffmffmffmmfffffmmfmfmmfmmmffffmfffmmfffffmmmmmmmmffmfmfmmmmfmmmfmfmmmmmffmmmmmffffffmfmfmmmmmfmfffmmfmffmmmmmfffffffmmmmfmmmffmmfmmmffmffmffmmffffmmmmfmmfmmfmfmmfmmmmfffmmfmmmmmmmffffffmmfmfmmmmmfmmffmfffffmmmmfmfmffmfmffffmmffmmffmffmfmmfffmmfmfmfmmmmfmmmfffffffmmfmffffmmfmmmmmmmmmfmmmmffmmfffmffffmmfmffffmfmmmmfffffmfmfmmmmfmfmfmmmfmmfmfmfmmmfmfmmmfffmfmffffmfmmmffmfmfffmfmmmmmmfffmmmfmmmffmmmmfmmmfmfmmfffmmfffmffmfmfmmffmmmmmffmffmfffmfmfmfmffffmfmmfmffffmmfmfffmmmmfmmmmffmmmmffffmmfmmmffmfmmmmffmmmmmfmffmmfmfmmfffmffmmfmmmffmmfmmmffmmfffmmmffmmffmmmffmfmmffmmmfmmffffmmmfffmmmffmmffmfffffmmmmffmfmfmmmmmffmmfffmmffmmffmfmmfmffffmffffmmffffmmmmmmmmmmmfffmfffffffmffmmffmmfmmmmmffmfmmmmmffffmmfffffmfffmfmfmmffffmffmmffmmfmmfffmfmfmfmffmffmmmmfmmmfffffmmfffmfmmmffmmmfmmfmffffmfmffmfmfmfmmmffmmmmmmmmffmfmmmfmffffmmfmffmfmfmfmfmfffffffmmmfmfffmmffmmmmffmffmmfmmffffmmmmmfffffmmmfffmffmmfmmfmmfmfmffffmmfmffmfmmmfffmmmmmmfmfmmfmffmmfmmmfmmmfmffmffmffmfmffffffmffffmffmfmmffmmfmffffmmmffmmmmmfmfmmfmmfmfmmmffmmmmffmfffmfmffmmmffmfffffmfmmmmmffmfffffmmmfmfmmmmmfmmmfffffmmmffmfmfmfmmffmmfmfmmmmmmmmmmmffmmmmfmmmmmfmmfmmfffmmfmmmmmmfmffffmfmmfmfmffmmfmfmfmmmffmfmmmmmmmmmfffmmffmffmmmmmmmmfffmmmfffmmfmmmmfmfmfmfmmffmmmmfmfffmmffmfmfmmmffffffmfffmmmfffmfmfmmfmmfmfmmfmfmmmfmffmffffmmfmmmffmmffmffmffffmffmmffmmmmffmffffmmmmffmffmfffffmmfmmfmffmmmfmffffmffmmffmfmfmfmmmffffmffmfmmmmmffmmfmmmfmffffmmmmmffmmmmmfffffmmfmfmmfmffffffffffmmmmfmfmmmmffmfmmmfmmfmffmfmmfmmmmmfmmmfmmmfmfmffmffmfffffffffmmmmmmmfffffmmfffmmmmmmmmmmmmmffmmmfmmmfmfmfmmmffmfmfmmffmffmfmmmmmfmffffmmfmmfmmfmfmmmffmfmmffffmmfmmmfmmmmffmmffmfffffffmffffmffmmmfffmfmmmfffffmmfmffffmmffmfmffmmmfmfmmffmmfmmfffffffmfmmfmmffffffmfmmfmmfmfmmmfmmmmfmmfmmmffmfmmmmfffffmmfmmmmmmmmmfmmfmffmmmffffmfmfffmffmmmmmfmfmfffffmffmffmmffmmfmfmmfmmmmmfmfffffmffmfmmffmmffmmmmmfmmmfmffmffmffmfffffffmfmmmfmfffmmmmmffmfmmfmmmmffffmffmmfmffmfmmmmmfmmmfffmmmmmmmfffmfmfffmmmffffmfmffmfmmffmmffmmfmmmffmfmmffmmfmffmfmmffffmfmfmfffmfffmfmffffmmffmmmmmfmffmmfffmmfmmfmmmfffmmfmfmfmmffmffmmmmfffffmfmffmfffmffmfmfmmmmfmfmmffmmfffmmmffffmfmmmfffmmfmmmmmmmfmmffmfmffffmmmffmfffmmffffmffffmffffmmmmmffmmfffmffmfmmmffmmmffffmmffmfmmmfffmfmmfffffffmffmfmmfmmmmmmfffmmmfmmfffffffmffmmffmfmffmfmffmfmfffffffffmmfmmfmmffmffmfmmfffffmmmmfmmmmfmffmmmfffffmmfffffmfmfmfmmffmfmffffmmfmmfffffmmmffffffffmmmfmfmmmfmmfmmmfmfmffmmmmmfmfmfmfmmmmmmmfffffffffmffmfmfmffffmmmffffmmfffmmmffffmmfmmmffmmmfffffmmfmmmmmmffffffffffffmmmmfmmmffmmmmmfmmmmmmfmffmffffmffmmmmffmfmmfmmfmffmfmmmffmffffmfmmfmmfmffmffmfmfmffmmmfffmfmffffmfmmmmffmfffmmffmmfmmmfffffmfmfmmffmmmfmmmfmmfffffmfffffffmmfmmmmmmmmfmffffmmmmmffffffmmmmffmffmmfffmmfmmfffmmmmmmmfmmmfmfmfmmfmffmffmffmmfmmfmffffmffmmmmfmfmfmmmffffmmfmfmfmfmfmmmffmffffmmffffmfmfmmffmffmmffmfffmmmffmmmmmfmmmmmfmmmffmfffmmfmmmmfffmfffffmfmfmffffmmfmfmfffmfmmmmmffmffmmmmffmmffffmmmmmffmfmffffmfmmmfffmmmmfffmmfffmmfmmfmmmmfffmffmmmmmmmffmffffmfmfmmmfffmfmffmmmmmmfmmffmfmffmmmmmmfmmmmfmffmmfmffmfmmfmfmmmmmffmmfmffmfffffffmffffmmffmffmfmmmmmffffffmfmmmffmfmfmmmmmmmfmfmmfffffffmfmffmfmmfffmmmfmmffmmmmmmfffmffmfmffmmffmffmmffmffmfmmmmmffmmmffmffmffmfmfmmmfffmmffmmmmmffmffmmmffmfffmffmfffmmmffmmmmmmffffffmmmfmmffmffmmffmffmfmfmmfmffmffmffmmffffmmffmmffffmfmfmfffffmmffmfmffffmffmfmfmfmfmfffmmmmffffffmmfmmmmmffmmmfffmmmffmmffmmmfmmffmfffmffmfmffmfmmmmfmmfmfmmmffmffmfffmmfffffffmmffffmffmmfffmfmfffmmmfffmffmfmmmfmmmmffffmmmmmfmffmffffmmmmmffffmfmmfffmffmmffffffffmmfmmmfmffmfffmfmmfmffffmfmmfffmfffmfmmfffmmfffmfmffmmfmmmfffffmfffmmffffmffmfmmmmfffmfmfmfmffmffmmmmfmmfmmmmfffmfffmmmffmmfmfmmmmffmmffmfffmfmfffmmmfmfffmmmfmmmmmmmmmfmfmmffmfmmmmfffmmfmfmmmmfffmmmmmmfmfffmmmmmfmmmfmmmffmmmfffffffmmmmmmfmmfmfmffmfffffffmmfmffmmmmmmfmfmmmfffmmffmmmmfmmmfmfmmffmfmfmffffmffmfmmmfmfmmmmmfmfffmmffmmmmmmmmmfmfmmfffmmmmffffmffmmfmmmmfffffmmmffmmmfffffmfmmmfmffffffmmmfmmfmffffmmfmmmmmfmmmffmmfffmffffmfffffmfmfmmfmfmfffffmmffmfffmffmmffffmfmmmmmfmffmmfmffffmfmmfffmfmfmfmfmmfmmfmmmffmfffffmfffffmmmfmmfffmfmmfffffmmfmffmfffmfmfmffmmfmfmmmmfmmmfffmfmmmfmfffmfmmmffmffffmfffmmfmmmmmfmmfmmfffffffmfffmfmfmffffmfmffmfffmmfmmmmmfmmmfmffffffmfmfmffmmffmfffmmfmfmmmfmmfffmmmmfmmfmmmfmfmffmmmmffffffmmmffffmfmffmmfmfmmfmmmmffmffmfmmfffmfffmmfffffmmfmfmfmmfmmmmmmmfffmfmmmfffmmmmffmmfmmfmfmffmffmfmmmfmfmmmmfmmmffmmfmmfmffmfmffmffmffmmfffmfffmmmfmmmmmmffmfffmfmmmmffffmffmffffmfffmfffmffffmfmmffmmfmfffmmfmffmfmfmmmffmfmmmmmfmffmffmfmmfmfmmfmmfmmmffmfmfffmffmmffmmfffmmfmffmmmffmffmfffmfffmffmfmffffmmmmmmffffmmfmmfmmmfmmmfmmmfmfffmmffffmmmfmmffmfmmfmfmfmfffmmmfmmmmmffmffmfffmmffmffmmmmmfmffmfmmmfffmfffmfmfmmfffffmffmfffmfmmmfmmmmmfmffffmfmmffmfffmmfmffffmmfmfmfmfmfmmmmffmmmmfmmfmmmfmmfmmffmfffmmffmfmffmmffmmmmmmfmfmmffffmmffmfmmfmmmmffmmmfmfmmmfffffmmffmfmffmfffmmffmmmffffmfmfmmfmfffffmfmfmmfmmmfmmmfmfmmffffmmmfmffffmfmmffmmmmmmfffmfffmfmfmfmfmfmmffmfffffmmmfmfmfffmmfmfmfffmmmfmfmmffmmmmffmffmmffmfmfmmffmmmmfmfmmfffffmfmffmmmfffmmfmffmmmmmmffffmffffffmffmmfmfmfffmmmmmmffmffmfmmmmmmfffmmmmmmfmmfmmmfmfmffmffmfmmmffffmmmffmfmmmmmffmmmfmmmmmfmfmmfmfmmfmmfmmfffmfffmfmmfmmmmfmmfmmmfffmfffmfmmfmmffffmmmffmmmfmfmmmffffmmffffmfmmmmfffmfmffmmffmmfmmmfmfmfmmffmmmmmfmmfmfffmmfmfmmmmmmfmmfmfmfmffmmmmfmfmmmmfmmmmmfmmmmmmfmffmfmmmfmfmmmfffmfmmmfmmmfffmmffmmfmmfmffmmmmmfmmmffmfmfmfmfmffmmffmfffmmmfmfffmffmmmfmmmfmmmfmfmmmffmmmmfmfmffmffmfmmfmmfffmfffmfffmmfmffmfmmmfmmffmmfmmfmmmmmmmmfffmmffffmffmmfmmmmffmffffmmfmmmmffffffffffmmmfmfmmfmmffmmmffmmfmfmfmfmfffmfmmmfmmmfmffffffmffmmfffmfmmfmmffmmmfmffmfmfmmmmmffffmfmfffffmmffmmmmmfmffffmfmfffmfmmfffmfmffmmmmfffmffmfmffffffmfffmmmmmfmmmffmmfffmmmfmmfmmmmfffmmmffmmffffffffffmffmffmfmmmmmmmmfmmmmfmfmfmmffmfmmfmmmmmfmfmmffffffmffmffffmfmmfmffmffmmmfffffmmmffffmmmfmfmmffffmfmfffmffmfmffmffmfffmmmfmmmffffmmfmmmmmffmmfffmfffffmfffmmmmffmmmfmffmmffffffffffmfmmmffmmmfmmfmffffmmmfmffmmfmfmmmmmmmffmmffmfmmmmmmmmffmfmmfffmmfmmfmffmmmmfmfmmmmfmmffmfmffmfmmmfffmmmfmmfmfmffffmfmfmmmfffmmfmffffmmffmffmmfmmmmmfmmmffffffmfmmffmfmfffmmffmmmmmfmmmmfmmmfmmmmfffmmfmmfmfffmmffmffffmmffmmfmfmmfffmfmmmffffmfffmfffmmfmffmmmfffmfmmmmffmmmfmmffmmmmmmffmmmfmmffffmffffffmmfmfmffmfffmmmmmfmmmmfmffmfffmmmmmffmfffffmmffmfffmmfffmffmfmffmmfmmfffmmmffmffmmffmfmmmfmmfffmmmmfmmfmmmfmffffffmfmmmfmmmmfmmfmffmmffmffmmfffmmfffmffmmmfmmfmfmmfffmmffmfmmfffmmmmmfmmmfmffffmmmfmffmffmffmfmfmmfmmfmffmmmmmmffffffmmfmffffffmmfmffmffmmfmffmmfffmmffmmmmmfmmmmmffmfffmffmfmfffmmmfffffmmmfffmmmmffmfmffffffmmmffmffmmmffmmmffmmmmmmmmffmmfmffmfmmffffmfffmfmfmmfmmfmfmmmfffmmfmfmffmffmffmmfmfmmmfmfmfmfmmmfmmmffmmfmffmmffffffmfmfmmfffmfmmfmmfmmfmfffmffmmfmfffmmmfmmffmffffffffmffmmffmfmmfffmfmfmfmmmfmffffffmfmmmfmmmfmmfmmmfmmffffmfmmmmfmmmfmmffmfmffmmmfmfffmmfmfffmmfffmfmfmmmfmfffmmfffmfmmmfffmfmmffmmmfmmmmmfmmmfmmmfmmmmfmfffffffmffmfmmfffmfmfmfffffmmmmmmmffffffffmmfmfmmfmffffffmmmmmmffmfffmfffmfmfmfmfmmmmmffmmmfmffmffffmmmfffmmfmmfmmfmmmfmmfffmmmmmmffmmmmffffffmmffmfmmfffmffmmmfmfmfffmfmmfffffmffffffmfmfffmmffmffmfffmfmmmffmfmfmffmffmmffmfffffmmfffmmmmffmmfmmfmmmmffffffmmffmmmmfmfffmffmfmmmmmfmffmmffmffmmfffmffffffmmffffmfffmmmmfffffffffffmfmffmfmmmfffmfmmmfmfffmfmmmmffmmffmfffmmfmmmmmmmfmmfmmmmmffffmmmfmmffmmfmmffmffmmmfmfffmmmfmfmmmmfmmmfffffffmfmmffffmmmmffffmffmmmmfmfmmmmmmmmffmfmfffmffmfmmmfmmmmmmfmmfmmffmmmmffmmfffmffmmmffmfffffmmfffmffmmmmmffmmmfmmmffmfmmmffmffmfmfmmmmmmmfmffffmfmffmmmmmfmmmmffmmfmmfmfmmmfmfmfmmmfffmfmfffffffffffmmfmfmfmfmfmfffmmfmffffmmmmmmmmmffmmmfmmmfmffffmfmffmmmmmmmfmmfmmmffmmmmfmfmffmfmfffffmfmfmmffmffmmmmmfffffffmmmffmmfmmmmmmfffffmmmfmfffmffmfmmmmmffmffmmmmfmfffmmmmmmmmmfffmfmffmffmffmffmffmffmmmmfmffmffffmffffmfmfmfffmffmmfmfmmfffmffmmmfmfmmfmfffmfmmfmmmfmmfmffmmfmffffmmfmffffffmffmfmffmffmmmfmfffmffmmffmmfmmfmffffmffmmfmmfffmmmffmfmmmmfffmmffffmffmmmmmffmmffmmffmmmffffmmmmfmfmmmmffmmmmmmfmfffffmfmmmmffmmfmmfmmmfmfffffmffmmmfmfmfmffffffmffmmffmmmfmfmmfmmmffmmmmffmffffmmmmfmfffmmfmmmmmffmfffmfmmfffffmfffmmmffffmmffmffffmmmmffmmffmmmmfmffmmfffffmmmffffmmmmmmmfmmfmfffmfmmmmfmfmmfmfmmfmfmfmfmmffffmmffmffmmmmfmfmmmmmfffmfmmmmmmfmmfffmmfffmmfffmfmfmfffmfffmfffffmfmmmfffmfffmmfmfmfmmmffffmfffmffmfffmmmmmfmmfmmmmfffmmffmmfffmfffmfffmffmfmffmfmfmmffffmffmfffffffmfffffffmfffffmmfmmmfmmfmffmfmmfffmfmfffffffmffmfmfmfffffmmmfmmfffmfmmfmffffffmffffmmfmmmfffffmfmmmmmmmfmfmmfmmffmfmmffmmmmmfmmfmfffffmfffmmmmmffmmmmmmffffmffmmfffmfmffmfmffmmmmmfmfmmmmmfmmmmfmmffffmmffmmmmmmfmfmfmffffffffmmmmffffmfmmmffmmffmfmmmfmmmfmmmmffffmfffmfmmfmfmffffmfmffffffffffmmffmffmmmmffmmfmfffmmmmmfmfffffmmfmffffmmmmmffmffmmfmmffffmfmffffffmffffmffmmfmmmmfmmmfffmmffmfffmmffmfmmfffmmmfmmffffmmffmffmmmfmffffmmmfffmfmfffmmfffmmffmmfffmfmffmmfmfffmfmfmfmmmmfmfffmmmmfmmmfmffffffmmmmfmmmffmmfmffmmffmmmfffmmfffmmmmmffffmfmmfffffmfffmfmmmfmmfffmmmmmfffmmfmmfmffmffmmmmffmfmffmmmffffmmffffffffmmmffmfffffmffmfmfffmfmfffffffmffmffmmmfffffffmfmfmfffmfmffmmffffmfmfmmmmffmffmmmmffffmmfmfmfmmmmfmmmfmffffmmfffmffffffmfffmmffmmffmmfffmmfmfmffffmfffmmmmfffmmfmffffmfmmmmfmmmmfmfffmmffmfmfffmfmmfmfmffmfmfmmmmmmfmfmfffmffffmfmmmffmfffmmfmmmfmfmfmfmmmmmmfffmfmfmmmmfffmmmfffffmmfmfmfmmmffmffmffffmmmfmfmffmffmffffmmmfffffmffmmmfmmffffmfmfmmmfmmmmmmmfmmmfmmmffmmffffmmmffffmffmmmmfmffffmfmmfffmmmfmmfmmfffmfffmmfmfmmmmfmmfmffmmmmfmffmmmfmfmmfmfmfmmmfmfffffmmfmfffffmfffmmmmfmmffffffmffmmffmffmmffffmmmffmfffmffmffmmmffffmfffffmfmmmfmfmmfffmmfmffmmfmfmfffmmfmmfmmfffmfffffffffmmmmfmmffmfmfmfmfmmmfmffmmmmfffmmmffmfmmmfffffffffmffmffmmfmfmfffffmmmmmmmmmmffmmfmmffmfmfmfffmmmmfffmfffmfmmmffmmfmmffffmffffmmmmfmmffmmfffmmfmmfmmfffmmffffmmmfffmmfmfmffmfmmmmmffmmmffffmfmffffffmmfmffmfffffmfmffmmmmffmfffmfffmmfffmmmmmffmmmmmmmffmmfmmmmmmmfmmfmmfmmmfmmmmffmfmmfffmfmmfmmmmfffmfmmfmmfmfmmmmmmmfmfffmffmffmfffmfmmfmmffffmmfmfffmfmmmmmfmmfffffmmmmmmmmffffffmmfffffmfmfmmmmfmfffmmffmmffmffffmmfffmfmfmffmmmmmmfmmmmmfmmffffmfffmffmfmffffffmffmmffmfffmmmfmmfmmffmmmmfffmmfffmmfmmmfffffmmmmmfmmffffmmmmfmffmfmffmmmmffmfffffffffmffmfmmmfmmmmfmmmmfmmffmfmmfffffmmmmmffffmmmmffmfffmfmffmmmmffmffffffmmmfmmffmffmmmmmmmfmfmffmffmfmffmmfffffmfmmmfmmfmffffmfmffmmmffffffmfmmffffmmmffffmmffffmmffffmmffmfmffmmmmmmfmmfmfmmfmmfmmfmfmfffmffmffffffmfffmmffmmfffmmmfmffmmmfmmmmmfmfmmmfmffmmfmfmfffmmmfmmfmffmffffmmffmmmffmfmfffffffffffffmmmfmmfffmmmfmfmmmfffmffmfmmmmfmfmfmfmmffmfmffmffmmfmmmfmffmmmffmfffmffmfmfmfmfmmmfmmmmffmmfffffmfmmmffmmmmmmmmfffmfmffmmmfmfffffmffffmmmmmmmfffmffmfmmmfmfmffffmfmmfmmfffmmfffmmfmfffmmmfmfmmffmfmffmffmmfmfmmmmfffmmfmmffmmmmmffmmmfmmmmfffffmmffffmffmmfffmmmffmmmmmffmmmmfffmmmfmmfmfmmmmmfmffmffmffffffmmmfmffffmmmfmmmmmmffmfmmfmmfmfmmfmfmmmmmmmmmfmmffmffmmfmmmmmfmmffmfmfffffffmfmmfmfmfmfmfffmmmfffmfffmmmmfmfmffmffmfffmfmmfffmmmmmffffffmfmfffmmmmffffmmffffmmfmmmmfmmmfmmfmffmmmmmmmmmfmmffmmffmmfffmmfmmfmffmmfmfmmmfffffffmfffmmmffffmfffffffmmmmmmmmmffffffffmmmmfmffmmmffmfmmffffmffmfmfmfffmmmmffmfmmffmfmfffffmmmfmffffffmmfmmmmffffmfmmffmmmmfmfmmmmmmffmfmmfmmmmfmffmmfffmffmmmmfmffmffffmfffmfmmmmmmfmmmmmmmffmfmffmmfffmmmmffffffmmmmmmfmffmmffmffmmmffmmfmffmfmfffmmfmfmmmfmffmfmmfmmfmfffmffffmmmffmmfmfmmfffmfffmmmfffmfmfffmfmmffmmfmmfmmffmfmfmfmfmmffmmffmfffmffffmmfmfffmfffffffffmmffmmmmmffffmfmffmmmffffmfmfmmffmfmffmmmmfffffmmfmffmfffmffmmmmfmfffmmfffffmmfmmffmfmfmffmfmmfffmmffffmffffmmmfffmfffmffmmmmmmmfmmfffmmmmfffmmmffffmmmmmmmmfmmffffffmffffmmmmffmfmmfmfmffmmfmffmmffmfmmffmmmmmmfmmfmfffmfmmfmfffmfmmfmmmfmfffmmfmmmmmfffffmmmfmfmmfmmmffmfmfmfmfmmfffmffmmmmfmmffmmfmmfmffmfmmmffmmfmfmmmfmffmfmmmffmmffmmfmmfmfffffmmmffmmmfffffffmfmfmmffmfmfmmmmmmfffmfffmmfmfffffmfffmffmffmffmmffmmmmfmmfmmmmffmmfmmfmmfmfmmmfmfmmmffffffmfmmfmmmfmfmmmmfmffmfmmffmffmmffmfmmmmmfffmfmfmfmfmmfmmmfffmmffmmffffffmmffmmfmmfmfmmfmfffmmffmfmmffmmmfmfmmmfmmmmmmmmfmmmmmmmmfmmmffmffmmfffmfmmmmfmmffmfffmfmfmffffmmmfmfmmmfffffmffmmffmffmffmmfffmmmfmmmmfmfffmffffmmmmmfffffmmffmmmmfmffmffffmmmmffmmffmmmmffffffmfmfmffmffmmfmmfmmfmffffmfmfmfmfmfmmffmfmfmmffmffmmffmfmmmfffmfffmfmfmffmffffmfmmfffmffmfffmfmmmffmmfmffmfmmfmfmffmmmmffmfmmfmfmffffmfmmfffffffmmmmffffmfmfmfmffmmmfmfmmfmmmffmfffmfmfmfmfmmfmfmmmmfffmfmmffffmfmfmmffmmmffmmmfmfmfffmfmffmmfmffmmmmfmmffmmffmffmfmffffmfmffmmfffffmfffmmmfmfmmfmfffmmffmmffmfffffmmfffffmmffffffmmfmfffmffmmmmffmfmffmfmfmmmfmfffffmfffmmfffmmfmmmmfffmfffmffffmfmmmmmmffffffmfmmfmfmffmmmmmffffmfmmffmfmmmmffmmmmmfmmmffffmffffmffmfffmffmfffmmmffffmffmmmfffffmmmmmfmfmmmmmmfmmmmmmfmmmmmfffmfffmmmmmfffmfmmmmmmffmmffmmmffmffffffmffmffmmfmmmmmmmfmmmffmmmfmmmmmfmmfmmmmfmffmfmmffmmfmffmmmfffmmfmmfmmfmmmfmfffmffmfmmmfffffmfmffmfmfmfmmffffffmfmmmfmmmmmfmfmmffmfmffmfffmmmfmmfmffmmmfmmmfffmmfmfmmfmfmfmmfffffmfmmmffffffmmmfffmmffmfmmfmfffmmmfffffmmmfmffmfffmmfffmfmffmfmffmmmmmfmfmmmffmmmfmfmffmfffmffmmmfmfmffmmfmmmfffmmmmmfmffmmmmmmmfmfffmffmfmmmffmfmmfmffmfmmmfmfffmmmfmmfmmffmfffmffmffffffmmfmfmfmffmffmmffmfmmmmmmmfmmmffffffmmfffmfmffmfmmffmfffmmmmmfffffmffffmfffmmfmmfmmmfmmfmmffmmfmmmmmffmfmmmfmmmfffmffmmffmfmmfmmmffmmfmfffffffmfmmmffffmmfmmffmfmffmmmmmfmffmmfmmfffmffffmmfmmmmfmffmmfmfmmmmffmmmmfmfmfffmmmffmffmffffmffmmffmffmffmmffmmffmffffmmffmmffmffmffmffmmfmffmmfmfmmfmfmmfmffmfmmfffmmmmffmmfmmffmmffmfmmffffmmmfmfmffmmfmffmfmfmffmmffmfffmfmffffmmmffmfffmmfmffmmfmfmfmmfmffmmfmfmfmfmmmmfmffmfmmmffmmffmmmffmmfffmmffffmmffmfmmmfmmfmmmmffmfffffffmmfmmmffffmmmmmmmfmffffmfmffmmmmfmfmffmmmmfmmmmfmffmfmmfmfffmfffffmfmfmmfmfffffffmmfffffffffmmffmfmfmffmmmffffmffmffffffmmfffmmmffffffmffmffffmfmffmffmmfmfmfffffmmmmffmmmffmmfmmmmffmmmmfffffmmmfmmmfmfffmfmmffmmmfffmfmmfmffffmmfffffmmmfffffmffmmffffmmmffmfmmffmffmmmfmfmffffmfmffffmfmffmffffmmmmfffmffmfmfffffmfmmmmmmfffmfmfffmfmfmfmfmffmmfmfffmfmmffmfmmfffffmmfmfmffffmffmmmffffmfmmfffffffmmfmmfffmfffmffmfmmffmmmffmfmfmfmmfmmfmmfmmfffmfmmmmmmmmfffmmfmffffffmmmfmffffmffmfmfmmmfmmmmmfmmffmmfffmmmmmffffmmffffmmmfmffmmfffmfmmmfffmmmfmfffmmfffmfmffmmmmmffmfffmfmmmmfmfmmfffmmmmffmffmfmfmmfmfmmffffffffmmfffmmmfmfffmmfffmfffmfmffmfmmmmfmmmfmfmfmmfmffmmmfmmfmfmfmfmmmmmmfmfffmfffmmffmfmfffmmfmffffmmmfffmmmfmmmfmmmmmmffffmmfmfmffffmfmffffmfmfmfffmffmfmfffffmfmffmmmmmmfmmfmmmmfmmffffmfmmfffmmmmmmffmmmmmffmmmffmmmmfmfmmmfmmmmfmffmmmfmmmfmffmfmfmmmfmfmfmfmmmfmfmmfmmfmmmmfmmfmfmmffffmmmmfmmmmmmffmfmfffmmffmmmfmmfmfmffffmmmffmfmffmmffffmfmmmfmfffffffmmmfmmffmmmfmffmfmmffffmffffffffmmmmffmffmfmmmmmffmmffmfmffmfffmfmfffmmmffmmfmmmmmmfffmffffffmfmfffmmmmfmfmffmmfmfmmmfmmmmfffmmmfffmfmfmffffmffffmffmfmfmmmmmffmmfmmfmfffmmffmfmmmmfmfmmmfmmmfmmmfmmmmfmmmmmfmmffmfmmfffmmfmmffmmffmmfffmffmmmmffmmfmfffmmmffmfmmmffmmfmfffmmmmmfmmmmmffffmffffmmffmffmmmffmmffmmfmmmmmmmffmmmffffmmfmffmmmmfffmffmmmfmmffmfffffmfmmmmmmffmmfmffffmffmffmmffmfmfmmmffffmmmfmmfmffmfmfmmfmmmmfmffmffmmmmfmfmmfffmfmmmffffmffmmfmffmfffmfffffffmffffmffmmmmmmmffffmmmfmfmffmffmmffmmmmfmfmmmffmmfffffmffmmmffmfmfmmmfmmfmfffffmmffffmmmffmfmmfmfmmmfmffffmmfmmfffmmffmmmffffffffmmfffffmfmffmfmmfmmmmfmmfffmfmffmfffmfmfmfmmmmmmmmmmffmfmfffffffmfmfmfmffmmmfffmfmfmmmmmmmfmfmffmmffmffmffmffmfmmmfmmffmffmmfffmmfffmfmfmmmmffmmfmfmffmfmmmfmmmfmfmfffmmmmmmfmfffmfmmmffmfmmfffmmmmfffffmmmffmffmmfmmmmfffmfmmfffmfmmmmmmfmffmffffmmfmmmmmmmfmfmfmmffmfffmmffmfmffffffmmffmfffmfffmmfmmmmmmmfmfmmfffmfmfmfmmmffmffmfmffmmmfmmfmfmfmmfmmmmmmfffmmfmmfmfmfmmmfmmmfmfmffffmmmfffmmfffmmmmfmfffmffmfffffmfffmmfmmmfffffffmffmfmmmmfmffmmfmffmmffmmfffmfffmmmfmmfmmffmfmfffmfmfffmffmmmfmmfffmfmfffmmfmfmmmmmmmfmffmmmmmmffmmmfmfmmmffmffmffmmmfmfmmfmfmmfffffmmmfmmfmmffffmffmffmmfmmfffmmffmffmmffmmmmfmfmmfffmfmmmmmmfmmfmmmmfffmfmmmmmffmmmmmmfmfffmmmfmmfffmmffffmmmmfffffmfmfffmffffmmmffmmfmmmfmmfmmfffmmmmfffmmfmffffffmffmmmmmmfmfmfmmmmfffmfmffmmfffmmmmfffffmffmmfmfmfmfmmfmfmffffffmfmmmmffmmfffmmmmfmmmmmffffmmmffmmmmfmmfmmffmffmmmmfmmfffmmfmmfffmfffmmffmffmmffmfmfmmfmfmffmfffmmfffmmffmfmffffffmmmfmffmmmmfmmfmffmmffmmfffmfffmfmfmffmmffmfmmmmffffffffffffffffmfmffmfmffmmmfmffmffmffmfffmmffffmfmmmmffmmmfmmmffmffmmmmfmffffmmmmfmmfffmmmfmmffffmfmfmmmfffffmmfmmfffffffmmffmfffmmmmfmmfffffmfmmfmfmmmmfmfmfmmmmfmmfmffffmmfmmfffmmfmfmmmmfmmmfmmmmfffmmfffmmmmmmffffmmfmfmfmfmmffmffmmfmmmmmffmmmfmmfmfmmmfmmfmmfmmmmfmfmfmmfmmmmmmmfmmffmmfmfmfmmfmmffmffmmffmffmmfffffmmmmffmmfffmfffffmmfmffffmmfffffmmmfmfmffffffmffffmfmmfmmfffffmfmmfmffmfmffffmffmfmffmmfffmfmfmfmmfmmmfmmfmfmfffmmmfmmfffmmffffmmmmmfmffmfmfmmmffmfffffmmfmfffmffffmmmfffffffmfmmmffmfmfffffffmffffmffmmffmfmfmfmmffffmmmmmfmffmfmmfffmmmfmffffmfmffmfmffmfmfmmmmfmmmmfmfmffmfffmmfmffffmmmfmmffmfmfmfmmfmmmfmmffmfmffffffmmfmmmfmfmmffmmmfmmmfmmmfmffmfmffffffmfffmfmmmmmmffmffmfffffffmmmfffmffmmmfmfmmmmmfmmfmfmffmfmffmmfmfmmffmfmmmmmmmmmmmffmmmmmfmfffmffmfffmfffffmffffmmmmmmmffffmffmmmfmfmmffffmmfmfmfmmmfmmmmfmmfmffmfffmmfmmfffmfmfffmffffmfmfmmmmmmmffmmfffmmfmmmmmfmmmfffffmfmmmfffmffmfmfmmfmmfmfmfmmfmmfmfffffmffffffmmmfmffmmmffffmmfmfmfmfffmfmffmmmmmmmfffmmmfmffmffffmffmffmfmmffffmfmfmffmmmffffmfmfffmfmmmmmmfmmmmmmffmmfmmffffmmffmmfmmmffmfmmmmmfmffmmmfmmfmfmffmfmmffffmmmmmfmmmmmmmfmffffmmfffmfmfmmfffmmmmmmmfmmfffmmfmffmfmmfffffmmmmmffffmmffmmfmffmfffmmffmmfmmffmmmfffmffmmmfffmmffmfffmmmmmfmffmfmfmmfmfffmmfffmffmmfmfmffffmfmmmfmffmfffmmffffmmfmmmfffmffmmmfmffmfffmmmmmmmfmmmffmmmffffmmmmfmmfmmmfmmmmmmffmmmmffmfmfmmmmffmmmmmmmmffmmfffmmmffmffmmmmmmffmmmmmmmmmmfmmfffmfmfffmmmfmmmfffmmffffffmmfmfmfmmfmmmfmfmffmffmmfmffmmffffmmmfmfmmmfmmmmmfmmfmfmmmmmmmmmfffmffmmmffmfmfmmmmmmfmffmfmffffffmmmmmmmfmmmffffmfmmffmmmfmfffffmffmfmfmmfmmmfmfmfmmmmmmmmfmmmmfmffmfmfmmmmfmmffmfffmffmfffffmmffmfmmfffmmmfmmmmmmffmmfmfffffmmfmfmmmmmffmffmffmmmmffmfmfmmfmfffmfmfffmffmmmmfmfmmfmfmffmmmfmffmfmfmmmmmmmmmfffmmmfmmmfmmfffmmmmfmmfmfmmffmmfmfmfmmffmfffmfmfffffffmfmmffmfmfmmfffmffffmfmfmfffmmmmmmfmfmfmmmmffmmmfmffmffmmfmmmmmfmmfmffmffmfmffffmmfmmmmmffmmfffmmfmmmmmmmfffmfmfmmmfmffmffmmmmmfmfmfmffmfmmmmmfmmfmmmmmmmmffffmffmmfmfmmmmmfffmfmffffffmffffmmfmmffmffmmffmmmmffmmmfmfmmmfmmfffffffffffmmffmffmmmffmfmfmfmffmmffmmffmffffmffmmmfmfffmffmmmfffffmmffmfmfmfffmffmmmmfffmmfffmmfffmmfffmfmfmfmmmmmffmmmmfmfmmmmmffmmmmmfmmmmfmffmfffmfmfmmmmmmmmffmmmffmffmmffffffffffmmfffffffmffmfffffmmmfffmffmfffffmmffmffffmmmfmffmfmmfmfffffffmffmmfmmfmmffmmfmmmmmfmmmmffmfffffmmfmffmfffmmmmffmfffffmmmmmmfffmffmfffmffffffmmmfmfffffmfmmmffmmmfmfmfmmmfffffmmfffmfmfffmfmmmmmfmffmfmmffmmfmfffffmmfmfmfffmmmfmffffmmmmfffmmffmfmfmmfmmfmffmmfffmmmffffffmmfmfmmmmffmffmmfmmfmmmfmmfmffmmffffmmfffmfmmmfmfmmmfmmfmffmmfmmmmffmmfmfmfmfmffffmffmmfmmmmfffmffmmmmmmffffmfmfmfmmmmffmmffffmfmfmfmfffmffmfmmfffmmmmffmmmmmmmfmfffmmfffffmmmmfmmfmffmmmfffmffmfmmmfmmffmfmmffffmfmmffmmmffmmmfmfmmmmmmfmfmfffmfmmmmffmffmmffffmfffmffmffmmmfmffmffmmmffffmffmmfmfmfmmffmmffffffmfmmmmfmmfmmffmfffmffmmmmffmfmmffmfmfmmffmfffmmffmfmfmmffmffffmfmfmfmfmfmmffffmfmmmfmmfmfmmmfmffffmfmfmmfffmmfffmfmfmmffffmfffmfmmmffmffmmfmfmmfmmfmmfffmfffmmmmmmmmfffmfmfmmmmfmmfmffmfmfmmmmfmmfmmffffmmmffmmfffmmffmffmffmmmffmfffmmmmmfffffmmfffffmfmmmmmmfmmmmmfmmffmmmffmmmfffffmmmmffmmmmmffmfmfmfffffffmmmmfffmmfmmmmfffmmmfffmmffmfffmffmfffffmfmffmfmfmmmfffffmffmmfmfmfffffmffffmmfffffmfmfmmmmmmffmmfmmffmffmmfmfmfmffmfffffmmmmmfmmmmmfmmmmmffffmmmmmmfmfmmffffffmmmfffmmmffmfmffmffffffmfmfmfffmffffmmffmfmfmfmmmmffmffffmmffmfmfmmfmmmfmmfmmmmmfmmmffmmmfmmmfmfffmmffmmmmffmfffffmfmmffffmfmffmmmfmmmfmmmfffmfffmmmmffffmfmmmfmmmffmmmmmffmffffffffmmmfmmffmfffffmmffffmffmmfmmfmfmmfmfmmffmmfmmmfmfmmfmmfmfmmmfmffmfmffffmffffmmffmfmfffffmfmffmfmfmfmmfffmfmmfffffmmmmffffmfmfmfmmfffmffffffffffffmfmfmfmmfffmmmfffmmfffmmfmmfmfmmmfffmmffmmmmffmmmffmffmffffmfmmffmmmmffmfmffmmfmmmmmfmmmmffmfmffmmfmmmmmmmmmffmmmffffmffffmffmmmmmmmffffmffmmfffmmmffmffmfmmfffmmfffmfmmffffffmmffffmmmmfmmfffffmfmffffmmffmmmfmmmffmmmmfmffmmfmfffmmffffmfmfmfmmmffmmmmffffmmfmffffffffmmffffmmmmffmmfffmfmmmffmfmfmmmfffmfmffmfmmfmmmffmffmfmmfmfmfffmmmmmmfmfmmmffffmmffffmfmffmmmmfmffmfmmfmfffmmfmfffffmfmfmffmmffffmfffmmfmfmmmmmfmfffmmffffmfmffmmffmfffmmfmmfffmfmffmmfmmmffmfmffmmfmmmmfmffffmffmmmffffffmmmfmmfffmfmmmmmffmmmmffmffmmffmmfffffmffffffmmffmfffffmfmfmfmfmffmmmmmmmfmfmmfmmmfffffmmfmfffmfmmfmmfffmfmffffmmmmmffmfmfmffmmfmfmmffmmmmmmmmfffffmfmfffmfmfffffmmffmmffmfmmfmfmmmffmmfmfmffmfmffmffffmfffmmmmfmffmfffmffffmffmmfmmmfmfmffmfmfffmmmfffmmmmffmmmffmfmmmmfffmfmfffmfffffffmffmmmmffffmmfmmmffmmffffmmmmfmmmmffffmfffmmmfffmmmmmmfmmmfmmfmfffmfmmmfmfmmfmmmmffmfffmffmmfmffffmffmmffmmfffffmmmfmmmffmffmffmmmmfmfmmmmfmmfmmmffffffmffmfmmfmfffffmfmfffmmmfmmfmfmfmmmmfmffmmfffmmffmmmmmmfmmmffmmmfffmffmfmfmmmffmmmfmfffffmmffmmffffmmmffffmmmmfffmmffmmmfmffmfmfmfmffmmfmfmmmfmmfmmfmffmmfffmfmmfmffmmmfmffmffffmmffmfmfffmfmffmfmfmffmmfffmmfmffmfmmmmmfffffmmmmmmmmmffffmmfffmmffmfmfmmmfmfmffmmmmfmfmfffmmfmmffmffmmfmmmmmmmfmmmfmmmfmfmmmmfmffmmmfmmffffffmmffmfmmmfmmffffmffmfmfffmmmmmffmffmmffmmffmmfmmmfmmmfffffmmfmmmmmmfmfffffmfffmfffmfmfmfffffmfmmmffmmfffffmmmmffmfffffmffmmfffmmfmmmmfmfmmfmmmffffffffmmmfmfmfffmffmffmmffmfmfffmmfmfmmffffmmmfffmmmffmmfmfmmfffffmmmffmfmfmfmffmmfmfmffmfmfmffmmmmmmfmfffmfffffmmmfmmfmffmmfmffffmffffmmffmfmffmmmmmfmfmfmfmffmfmmfmmmffmffmmmfmmmffmmmffmmfmffmfmmmfmmmmfmmfffmfmmfmmfffmfmfmffmfffmmmffffmmffffmmfffmfmffmfmmmmmmmffffmfmfffmmffmmmffmfmmfmmfffmfffmfmmmffmmmfmffmmfffmfmmfffmffmmfmfffmfmmfmmmfmmffmffmmmffmffffmfmmfmmfmmmmmfmmffffffmffmmmmmmmmfmmmmmfmmmmmmmmfmffffmffmfmmmfmmmmfmfmffmfmmffmmffmmfmfffmffmffmffmmfmmfffmmfmffffmmfmfmmffmmmmfmmmmmmmfmfmffmfmmmmfmffmmmmfmmfmfffffmmffmfmmfmffmmmfmffmffmfmmffmmmffffmmfffffmmmmmmffmmmffmffmmmfmmffmfffmfffffmmffmfmmmmmmfmmfmmmffmfmmfmffmmmmmmfmmfffmffffmfmmffffffmfmffmmfmmffmmffmmfffffmmmmmffmffmmffmfmmfmfmfffmfmmfmmmfmfmfmmmmfmmffmmmfmfmmfmffffffmmmmmmfmfmfffmffmfffmmfmfmfmmfffmffmmmfmmmmmmmmmfffmmfmffffffmfmmfmmfmmfmfmmffffffmmmmfmffffmmmmfmmmmmmfffmfmfmfmmffmfmffffmfmmfffffmmmmmmmmmmfmfmfmmmmmmmfmmffmmfmffmffffmmmffmfmmmmfmffmfmmfmmfmmmfffmmfffmfmmfffffmfmmmffffmffmffffmffmmmmmffffffffmfffmfmffmmmffffmmmmmmfmfffmmmmfmfffmmffmmmffmffmffmmfmmmmmmmfffmmfmmfmfffmfmmfffmfffffmmfmmffffmmffffffmffmmmfffmmfmmmmmfmfmfmfmmfmfmmffffffffffmmfffmmfmmfmffmffmfmmfmmfmmmfmfmmmfffmmfmmfffmfmfmmfmfmfffmmffmmmffmmmmmmmfmmfmffmfmfmffffmffmmfffmmfmfffmffmfffffmfffmmfmmfffmffffmfffmfmfmmffmffmmmmmmfmmfmfmfffmfmmfffffffffmfmfffffmmmmmfmmmmfffmfmmfffmfffmffmmfmffmfmmmfmmmffmfmmfffmfmfffffmmmfffmfmfffmmffffmmfmmmmfffmfmmffmmmfffmmmmmfmfffmmmmfmfmmffmmmfmmmmffffmfmffmmfmfmmmmfmffmmffmfmffmfmfmfmmfmfmffmmfmfmmmmmffmffffmmmmmffmmfffffmfffmfffffffmmfffmfmfmfmffmfmfmffmmfffmmfmmfmfmfffmmffmmmfmffmmmfffffffmfmmfmmfffffmmffmmfmfmmfmfmmfffmfmfffffmffmmmmffmfmmfffmfffmfmmffmmfmfmmmfmfffmfmmmffmmmmffmfmffmfmffmfmmfmffmmffmffmmffmfmmffmmfffmmfmfmfmmmmffmfmfmfmffffmmmfffffmmffmfmffffmmffmmmmfmffmffmffmmfmfmfmfmmmffffmffmmfmffmfmmffmfmfmfmmmmmffmfmfmfmfmmffmmmfffmmmmmmfmmmffmffmfffmfmmffmmffmfffffffmmfmmmfmfmmmmmfmmmmfffmmmmffmmffmmffffmmmfmffmfmfmffmmmmmfffmfmfmfmfmmfmmfmfmffmfffffmffmffffmmmfmffffmmffmmmfmfmfmmfffmmmfmmmmffmffmmfffmmffffmfffmfmfffmfmmffmmfmfmmmmffmmfmmmffmmmfmmmmmfffffffmffffmmfmffmfmffmfmmmffmfmffffffmfmmmmmffmmffmffmffmfmmfmmfmfmmmffmmmfmfffmmfffffmfmmfmmfffmffmmfmfffmfmmmfmffmfmffmmfmmfffmffmfmmffmffmfmmffmmmmfmmfmmmmffffmfmfffmmmmfffmfmfmmfmmfmmmffmfmfmfmfmmffmmmmmfffffmmmmmfmfmfmfmmmffmmmffmmmfmfmmmfmmmmmmfmfmfmmmmffmffffmffmffmfmmfffmmmffmmmmmmmffmmmffmfmffmffmfmffmfmfmmmmmfmmmmffmfmfffmmmmfffmmmmmfmmfffffmmfmfmfmfmmmffffffmmffmfmmmmfffffmffmffmffmmmfmfffmffmffmfmmmfmfmfmmfmfmfmfmmmmfmfffmffmmfmffmmfmfmmffffmmfffffmffmffmmmmfffmmmmffffmfmfmmffffmfmmmmfffmfmmffffffmmffmfmmmmmfmffffmmmmfffmfmmmmfmmmfmmmmfmmmmmmfffmfmmmfmmmmfmfmfffmfmfmffmmmmmfmfmffmfmffmfmfmmfmfmffmfmmffmmmffmffmmmfffmmmfmfmfffffffffffmmmmfffmmmffmmmfmffmffmmffmfmmmmmmmfmmfmmfmmmmmmmmmmffmmfffmmmmffmfmmmmmmffmmmffmmffmmmfmffmmmmfmmmfmfmfmfmmffmmfmmmmfmffffffmfmmffffffffmmffffffmffffmfmffmmmffffmfffmmfmffffmffmmmmffmffffmffmffmfmmfmffffffmmmfffmfmmfmmmmmmfmmmffmfmfmffffffmmfmffmffmffmfmmfmfmfffffmmfmfmfffmfmmmmffmmmmffffmmmmmfffmmffmmmmfffmfmfmfffmfmmfmmmmffffmfmffmmmfmmmmfmmfffmfmmfmfmffmfffmfmfmfmmfffffffmmfmmfmmmffmfmmmfffmfffmmmmfffmmffmmmffmfmffffmmmffmmffmfffmmmffffmfmffmffmmffmfmfmmmmffmffmmmfmmmfffmffmffmmfmmmmfmfffmmfmmmfffmmfffmfffmfmmmmffffmmmffmmfffmfmmmfmmmfmfmmfmmmmfffmmffmmmmmfmfffmmmmmfmmmmffmmffffmfmfmmfffffmffmffmmfmmfmmffmmffmfffmmfffmfffmmmmmffffmffmmffffmmffmfffffmffmmfmfmfmmmfmfmfmffmmffmmmmfmmfmmfmfmffffmfffmfmmffffmfmmfmfmmmfmmfmfmfmmfmmffffmmffmmffmfmmmfmmfffmfffmfmmfmmmmfmfmmffmmmmfmfffmmfmffmfmmffmmffffmmfffmffmfmffmmffmmmmfffmmmmfmffmfffffffffmmfffffmmmfffmfmmmmmmfmmfmmffmmmmmfmfffmffmmmfmmfmfmmmfmmmmfmmfmmmfmfffmmmmmmmffmmmmfmffmmfmmmfmffffmffmfmfmmfmffmfmfmmmfmmmffmffmffmmmfmmfffmffmmffffffmmmfmfmffmffffmmfmfffffffmffmffmmffmfmmmfmmmmmffmmmmffmfmfffmmmffmmmfffffmmmmmmmffmmfmfmfmfmmmmmmfmffmfmmfmmffmmfffmfmffmffmfmmffmffmfmffffmfffmmfmfmmmmmmffffmfmffffmfmfffmffmmfmmfffmfmmfmmffmmmmmffffmfmfmmfmfmffffffmmmfmfmmmffmfmmmmffmmmmfmffmmfmfmmmmmmmmmffffmmmffffffffmffmmfmffmfffmmfmmmmfmmfmfmmmmmfffmfffffmfmmmffffmfmmmfmmfmfmmfmmmmfmmmffmmffmmfmmffmmfmfmfmfffmmfffmfmfmfffmfffmfmfmfmfmmmfffmfmmmmffffmmfmmmmfmfmfffffffmfffmmmfmmfmffmmffffmffmfmfffmmmmmmmmmmffmfmfmmmmfmmmfmfmmmmmffmmmmmfffmffmfffmmmmffmfffmffmmfmfmmffffffffmmfmfmmmmfmmfmfmffmmfmffmmffffmmmmfmffmmfmfmmmmmmmfffmffmmfmmmmmmfffffmfmfffmmmfmmffmffmfffmmmfmmfffmffffmfmmfffmffmmfmfffffffmfmfmfmmmmffmmffffmffmmmmffffmfmmfmmmmfmffmmmfffmmmffmfffmmmfffmffmmmmmfmmfffmmffmmfmmffmfmmmfmmfmfmmfmmffmmmmffffmffmfmfmffmffmfmfmfmfmmmfmmffmmmmfmmmfmfmmfmmmmfmmmmffffmfffmffmfffmmmfmmmmfffmffmmffffmfmfmmmmffffmffmfffmffffffmmfmfmmmmffmffffmfffmfmffffmfmmmmffmmmfmffffmmfmffffffmffmffmmmmffmfmmmffmmfffmmmffmmmfmmffmmfmmffmmffmmmfffmmmffmmmmffmmmmmffmfmmfmmfffffmfmmfmffmmfffffmfmmfmffmmfmmfmffffffmmmmfmmmmmmmmfffmfffmfffffmmfmfmmffffmfmmmmffmmmmfmfffffmmfffffffffffmmmfffffmffmfffmffmmffmmmmmffmfmmfmmffmmfmmffmmfmmfffmfmfmfffmffmmfmffmfmffffffmfmmfmmffffmmfmfmffmfmmmfmffffmmmfffffffffmfmffffffmmmmfmfmffmffmfmfmmmffmmffffffmmmfmmfmffffmmfmmmfffmfmffmmfmfmfmfmmmfmfffffmmmfffmmfmmfmfmmffffmmmmmfffmffmfffmffffmmmffmffmmmmffmfffffmffmfmmffffmmmmfmffmfffffmfmmmmfmfmfffffffmmffmmmfffmmmffmffffffmfmmmmmfmfffffmmmfmffmfmmfmmmfffmmmfmffffmfmfmmfmmmmmfmmmmmmmmmmmfmmmmmfmmmfffmmmmffmfmffmmmmmmmmmmmmmfmffmmfffmffmfmffmfffmmfmmmfmmmfmffmmffmffmfmmmmmmfffmmmmfffmffmmmfmmmfmmfmffmmmmfmmmffmffffmmmmmfmffffmffmmfmfffmmffmmfmmfffmmfmfffmfmmfmfmfmfmffmffffmffmffmfffmffmmmfmmmmmffmfmmfmmmfmmmmfmfmfffmmfmmffffmmmfffmffmmmffffffmfmffmfmmmmmfffmmffmmfmmmmmmmmfffffmfmmfmmfmmmmmffffmmfmmmfffffmfmfmmmfmmfmfmmmfmmffmmfmmfmmmfffmfmmfmmfmmfmmmfmmmfmfmffffmmffffmfmfmfmmmfmfffffffmmffmmmmmfmfmmmmmffmfmfmmmfffmfmmmfffffmmmffmffmfmfmmffmfmmfmmfmmffmfmmmmmfmmmfmfffmmmfmfmfmmffffffffmmfffmfmffmmffffmfmfmfmfmfffffmfmmfmffmmffmfmfmfffmmmmfmmffmmffmmmffmffmffmfmmfffffmfffmffmmmfmmmmfmfmfmmfmmmfffmffmmmffffmmfmfffffmfmfmmfmmfmmmffffmfmffmmffmmmmmmffmfffffmffmffmmfmfmfmfmfffmmfmfmfmfffmffmfmfmmmmffmmmmmfmmffmmfmfmmffmfffffffmfmmfmmfffmmmmmmfmfmmffmfffmffmffmmffmfmfmmmfmfmmmfmmmfmmmfmfmfmfmfffmmfmffmmfmmfffmmfffmffmmfmmmffmfmmmfmmmmfmmmmmffffmffmmmfffmffmfmfffmfmffmfmmmffffmmffmmmfmmffmmffmmmmmfmmmmffmffmffmmmffmmffffmfffmmfmmmmfmmmmmfmmmmfmfmfffmmfffmfmmmfffmmmfmmmmmffmfmmffmfffmmfmmffffffmmfmfffmmmmffmffmmmfffmffffmfmmfmmmmfmmmmfffffffmfmfmfffmfmfmffmfmfmffffmmfmfmmmmffmmmffmmfmffmffmfffmmfmfmmffmfmmfffmfffmmmfmfmmfmffmfmmfmmfmmfmffmmmmmfmfmmfmffmmmffmffmmffmffmfmfmfmmffmmmfffffmmfmfffmfmmmffmmmffffmmffmfmmmmmfmfmfmfmffmmmmmfmfmfmmmmmmmmmffmffmfmmfffmfmfmffffffmmffmmmfffmmmffffmfffmmfffmmffmffmmmmmmmmmfmffmmffffffmmmmfmmmfmmmmfmmmmfmfmffffmfffmmffmmmffmmffmfmmfmfmmffmfffmmfffffmmfmmmmfmmffffmfmfmfmmmfmmfmmfmfmfffmffffmffmffffmmffmfffmfmfmfmfffmfmfmfmmmmfffmfmfmffffmmmmmmmmmmmmfmmfmfmmmmfffmfmfmmmmmmffffmfmfmmfmmmffmmmfmmmfmmmmmmmmmmfmffmffmfffmmmmfmffmfmmffmmmfmfmmmfmmfffmffmfmfmfffmfmmfmfmffmmffffmmfmmmffmfffmffmffffmmfmfmmmfffmmffffmfffmfffmmmfmmmmfmmfffffmfmmmffmmfmfmfmffmmfmmfmmfmmfffmmmffmfmfffmmfmmffmfmffmfffmmmffmfmmmfffmmfffmmffmffmmfmfmmffmfmmmmmffmffmfmfmfmfmfffffmmmmfmmfmmmmfmmmmfmmmmfmffmmmffmmfmmffffmmfmfffmmmfmfmmmfffmfffmmfffmfffmmmffmffffmffmmffffmfmmmfmffmfmfmmmmmfmfmffmffffmmmffmfmmmmmfmfmfmffmmmmmmmmmffffffmfmfmfmmfmffmmffmfmmfmmmfmfmmfmffmmfmmfmmffmmmffmmmffmfmmfffmffmmmmfmmffmmmmmfmfmfmfmmmmmmfffffmmmmfmmmfmffmmfffmfmfmfmmfmmmmfmmfmmmfmfffmfffmffmfffmfffffffmmffmmmmfmffmfmfmfmffmmfmfmfmmmmfmfffffmmfmfmfmmmfffmffmmfmffffffmmmfmfffmmmmmmffmmmmfmfmffmfmfmffmffmfffmmfmffffmfmmfmmmffmmmffmfmfmffmmmffmffmmmmmffmfmfmffmmmmmfmffffmffmfmmmfffmmfmmfffmmmfmfffffmfmmmfmmmmmffmmfmmffmfmfmffmfmmmffffffffmmfmfmmfffmfmmffmfmmmfffffmfmfmmmfffffmmmmmmmfffmfffmmffmmffmmmmmmmfffmmfffmmffmmmmfmffmfmmfmfffmffmfffmfmffmmfmmmffmmfmmfmfmmmmmmmmfmfffmfmmmmfffmmmffmfmfmmffmmmmffmffffmmmmffmmfmmmmmmmmfffmfffmmmmmmfmmfmmfffmffmmfmffmfmfmffmmmmmmfmmfffmfmffmmmmmmmmfmffmffmmffmffmfmmfmmmmffmfmfmmmfmmffmmffmmffmmfmffmfmmfmffmfmffffmmfmmfmmmmfmfffffmmmmmffffffmffmmfmffmfffmmmfmmffffmfmmfmffffmfmmmmmffmfffffmmfffffmfmfmmfffmfffmfmmfffmffmfffmffffmmmmmfmfmmfffffffmfmfmmfmfmmmfffmfmmfmmfmmmffmfffffffmfffmmmmmffffffmmfffffmmffffmfmmmfmfmfmmmfmfmmfmfmfffmmmmffffmmfmmfmmfmfmfmmmffffmmfmfmmmmfmfmmfmmmfffmfmfmfmmmffffmmmfmmfmfmmmmmmfmfmmmmmffffmfffmmmffmmmfmffmmmfmfmmmfmmfmfmmmffmmfmmfffffffffmffffffmmmmffffmfffffmfmffmmmmmmffmffmfmmmfmfffffffffffmmfmfmmfmffmfmmmmfmfffmmmfffmfmmmfffmfmmfmfffmffffmmmmmmfmfmfffmfffmfmfmmffmmmffmfmmffmmfffmmfmfmmmmfmmmmffmfmfmmfmmmmfffmmfffmmfmfffffmfmffmfmmmffmmffffffmmfmmfmfmfmmmffmffmmmmffffmmfffmmfmfmmffffmmfmmmmffffmffmfffmmmffmmfmmfmmmffmfffffmmfffmmfmfmffffmmmmmmfmmfmfffmfmffffmmmmmmfmfmffmmfffmmmfmmmfmmfmfffmffmfmffmfmmmmffffffffmfmffffffmmfmmfmffmfmmffffmfffffmffmffmfmmmfffffmfmmffmfmfmfmmfmmmffmfmfffmmmfmfmfmmmfmfmfmfmfffmmfmmmmmmmmmmmmfmffmmmfmfmfmmfffffffmmmfffmmmmfffmmffffmmffmfmmfmmmmmfmfmmmfmmmfffmfffmffmmffmmffmmfmmffffffmfmmmmmmffffmffmfmmfmfffmmmmmmfmffffmfffmffffmfmfffmmmmmmfffmffmfffmmfmmmfmmmfmffffmmmmmmfmmffmmfffffffffmfmfmmfmmmmmffmffmfffmfmfmmffmmmmmmfmmfffffmfmffmmffffmmmmfffmfmmfmmffmffmffmfffmmfmfffffmmfmfmfmmmfffmmmfmmfmfffmfmmfmmfmmffmmmffmffmfmmmmffmffmfffmmmmmmffmmmfmmmmmfmfmfmmmmffmfmmmmffmfffffmmmmmmmfmmmmfmffmffffmfmmffmffffmmmffmmmfmmmmffffffmmfffffmfmmfffmffffmmffmffmmmfmfmfmmfmfmmmmfmfmffffmmfmmmmmmmmmmffffmfmfmfmfmfmfmfmffmfmmmffmmmmmfmmmmfmmmmmfmfmmfmmfmmffffmfffmmfmfmfffmmmfmmmmmmmfmfmmfmfmfmfmffmmfffmmfmmfffffffmfmmffmmfmmmmfmfffmmfmmmfmmmmffmffmfmffmmffmfffmmfffmmfmffmmfmmfmmffmfffmfmmmmmmmmmmfmmffmfmmmmmfmfmmffmfmfffmfmfmffffmffffmfmfmfmfmmffmffmfmffmmfmfmfmffffmmfmfmfmmmfffmmmfmmmfmfffmmmfmmffffmmmfmffmffffmmmmffffmfmfmfffmmfffmmmfffmfffmfmmffmfmmffffmmffmmfmfffmffmfmmfmfmfmffmfmfmmffmfmffmfffmfmfmmfmmmffmfmmmmfmmfmmffffffmmffmfmffmmfmfmmmfmmfmmmfmmmmffffmfmfmmmmfmmmmfmfffffffmmfffmfmffmffmmfmmfffmffmmmffffmfffmffmffmfmfmmfffffmffmffmmmfmfmfmfmmmffffmmffmfmmmfmfffmmfffffmfffmmfmfmmfmfmffmmfffmffffffmfmffmmmfmfmffmfffmmfmfmffmfmfmmmmmmffffmmmmmfmmmmfmmmmfmmmffffmffmmmmffmffmfmfmmmmfmmffmfmmfmfmmmffffmmfmmfmmfffffmffmmmfffmmmmmfffmmmffmffmmfmmmmmfmfmffffffmfffmmfmmfffmmffmffmmfmmmfffmffffmmffffmfmffmfffmmfffffmfmmffmmfmmmffffmfmfmfmfmmmffmfffmmfmffmmmmmfmmfmmmffmmmfmmmmmmmmmfffmmmmfffmfffffffffmmfmffffmfffmmmmmfmmmmfmfmfmffmmffmffffffmffmmfmfffmffmfmffmmmfmmmmmmfffmfmffmfffmffmfffmmmmfmmmmmmfmfffmmmmffmffmmfmmmfffmffmffmffmmfffffmmmffmmmmfmfffmffmmfmfmmfmfmmffmfmfmffmfmfmmmfmfmmmffmmfmmffmffmfmffmmfmffmfmmfffmmmmmfmfmfmmfmffmffmmmfffffffmffmfmmmfmfmffmmmmfffmmmmmfffffffmfmfmfffmmffffmfffmfffmfmmffmffmfmfmfffmfmmmmmmmmmmmmfmmfmmmmmmfmfffmffmfmfffmfmfffmfmmfmfmmfmfmfffffmmfmfmffmffmffmffmmmmmfffmfffmmmmffmfmmmfmffmmmffmmffmmfmmfffmfmmffmmmmmffffmfmfmmmfmmmmmfmfffmfffmffmfmfmfmffmfmffffmfmffffmmfmfffffmmfmfmfmmmmmmfmmmfmffmmmmffmmmmmfmfmmfmmfmfffmmfmfmfmffmffmmmffmmfmffmffmfmfmmffffmmmmmffffmmffmfmfmmfmffffmmmfmfmmmffffffmfmmmfmfffmfffffmfmfffffmmmmfmfmffmfffmmmmffmmfmfmmfmmffmmmmffmfffmfmmmmmfmfmmmmmmmmffmffmfffffmmfmmffmmmmmffmfffmffmmfmffmmfmffffmmffmfmffmmmfffmmfffffmmffmmfffffmfmmffffffmfffmfmfmfmffmmfmmfmffmmmmmmmffmmfmfmmfmmmffmmfmmffmfmmfmmmmffffmmmmmmmffmfmmmmfmmfmmfmffmmmffmmmmmmmmffmmffmmffmfmmmfmfffffmfffffffmmfmfffmmmffmffmfmmfmmfmmfmffmfmfmfmmfffmmmfmmfmmffmffffmffmmmmmmffmfmmmmmmffffmmffmfmfmmmfffffffffmmmmfmmmmffmmfmffmmfmmmfmfmmfmffffmmmmffffmffmmmmmmmmmmffmfffmmfmfffmfffmmmmfmfmmmmfmmffmfmmmmmfmmffffmffmmffmmfffffmmfmfmffmmfmmffmfmfmffffmfmmmffmffmfmfmmfmmmfmmffffmfmffmmfmfmmmfffmmffmmfmfmfmfmfmffmmfffmfmfffffmfffffmffmfmfmmmmffffmffffmffmmmffmfmmfffmmffmmmmfmfmmfmmmmmmmmmmfffmmfmffmmfmfmfmffmfmfffmfmfffffmfmffmmffmmmmffmmfmmmmmfmmmmmmmfffffmfmfmffmmfmmfffmmfffmfffmfmmmffmmmfmmmmmmmffffmffmffmffmfmfffmffmmmmfffmmfffffmfffmfmfmmffmmfmffmfmmfmfmffmmffmfmmfmfffmfmmfmffmmffmffmffmfmfmmmfmmmffffmffffmmffffmfmfmffmmmfmmmffmmmmfmfffmmffmmffffmffmfffmffffmfffmmfmfffffmfmmmfffmffffmffmmffffmmmmfffmmmmmfmffmmmmffffffmfmmmmffmmfmmffmfmmfmffffffmffmmfmmmffffffmffmmfmmmmfmmmmffffffmfmmfmmfmffmfmmmmmmfmmffmmmffffffffmfffffffffffmmmmfffmmffmmfffmmmmmfmfffffmmfmffmmfffffmfffffmmmmmmmffmmffmmffmmmmmfmfmffmmmmfmfffmmmffmmfmmfmmffmmfmmmmmmfmmmmfmfmmmfmmffmfffmmfmfmmfffmfmfmfffmmffffffffmfmmmmffmfffmmfmfmmfmfffffmfffmmfmmffmfmfmfmmfmfmmmfmmmffmmffmmfffmfffffffmmffmmmfmfmffmfmfmfffmfffmmmfffffmfmffffmfffmffmfmffmfmmfffmfmmffmmffmffmmmfmfmfffmmmfmmmmfmfmfmmmfffffmfffmmmfffmfmffffffmmmmfffmfmffmmfmmfmmffmmmmmffmfmffmfffmmmmfmmmffmmmmmffffffffmmfmfmffffmfffmfmfffffmmfffffmmmmmmfmfmfffffmfmmmffmfmmfffffmmmmmmmffffmfffmmffmfffmmfmmfmmffmmmmffffmffmffmfmffmffffmmmffmfffffffmmmmmmffmfmfffffmffmmfmmmmmffffmfmfmmfmfmmmmffmmffmmfmmfmffmmmffmfmfmffffmfffmmmmmmmffmfmmmmffmfffffffffmffffmmffmmmfmmmmffmfmmmmfmffffmmmmmfmfmffffmfmfmfffmffmfmfmfffmfmfffmmmfmfmmmmfmfffmmfmfmmmfmffffffmmmfffmfffmmffffmfffmfmffmmmffmmmfmmfmfmffmmfffffmmfmmfmmmfmfmfmfmmmmfmffmfmmmmffmfmmmffffmffffmmffffmmmmffmfffmmfmffffmmfffffmfmmffmfmffmmmfmmffmfffmmffmfffmmffmmmfffmmffmmfffmmfmffmmfffmffmmmmfffmmmfffmmffmmfmmmmmffffmmfmfmfffffmmffmmmffmmffmmfmffmfmmmmfmmmmffmmmmfffffffffffmmmfmmmmmmmfmmffmmffmfffffmmfmfffffmmmmffmmmmmfmmmfmfmffmmmmfmmffmmffmffmmmfmfmfmfmmfmmffffmfffmmmmmffmmmfmfffmmfffmffmfmmmmfmfmmfmfmfmfffmmffffffffmmfmfffmfmmmmffmfmmfmfmfmfmfmmmmmmmfffmfmmmffmmffffmmfmmffmffmmmmfffffmmmmmfffmmmfmmffmffmffmfmfmmmmffmfmmfmfffmmmffffffmfmffmfmmffmfffmfffmfmmfmmfmmfmfmmmmmmfmmmmfmmfmffmmffmfmmmmfffmmfffffmfmffmffmfmfffmmffffmmfmmmfmfmmfffmmfmmmmmfmfffffmmfmmmmmfffmfmfffffmfffmmmmmfffmmfmfmfmffmmffmfmfffffffffffmmffffmfffffmffmffmmmffmffffffmfmmmmfmffmfmfmmffmfmfmfffmmfmfffffffffmmmffmmfmmffffffffmmmfffmmmffmffffmfmfmfmffmmffffmfmmmffmmfmfmfffmmmmmmfmmmfffmmmfmfmffmffmfmffmfmfffmfmmfmmmmffmfffmmffmmfmmfmmmmfmmffmmffffmmfmmmmffffmmfmmfmmmmmffmffmfmmfffmfmmmmfmmffmmfmfmfmfffmmmmfmmfmfffffmmffmfffmfmmmmfffffmmfffffmmmmmffmfmffmfmmmmmmmmmmffffmfmffffmmfmfffmffmfmmfmffmfffffmfffmfffmfmfmmfmmfmmmmmmmmmfffffffmmmmmffmmmfffffffffffffmmfffmfffmfmfmfffmmfmfmffmmfmmfmfffffmfmmmmffmffmffmfmfffmmfmffmmmmffmfffmffffmmffmmfmmmmmmmfmmmmfmmfffmmmfmfffmmmmmffmfmmmmffmmfmfmmfffmfmffmmffmffmmmmmmmfmffmffmmmmmmfmffmffmfmfffmffffmffmfffmmfmffffmmmmmffmfffffffffmffmfmmfffmmmmfmfmmmfmmfffffmfmfmmmmmfmmfmmffmmffmfmffmfffffmfmmmmmfmmfmffmmffmmfffffmfffmfmmfmmfmmfmmmmmmmfmfffmfmmmfffffmmfmffmffffmmmmfmmffmfmmfmfffffmfffmmmfffffffmmmfmfmmmfffmmmmfmfmmfmffmmffmmffmfffmmfmffmmffmfmmfmffmmmmfmfmfmmmfmmmfmfmmmmffmmfffffmfmmffmmmffmffmfffmmmffmfmfmffmmfmmffffmmmmmfmfmmfmmmfmmfmfmffffmfmffmmffmmmfffmmmmfmfffmmmffmfffffffmffmmfmfmmmmfffmmfmmmffmmmmfmmmmfmmmmfffffmmffmmmfmmfmfffmmfffmmmmffmmfmfffmmmfmffmmmmmmmfmmfmffmffffffmmmfffmffmmmmmmmfmmffmmfmfmmfmfmmfmfmmmmmmmmmffmffmffmmfmmfmffmmmmmffffmffffmfmmfffmmmmmffmmmmmfmfmfmffmmfmfmmmmffmffmmmmmfffmmmmmmmmfffmfmfffmffmfffmfmfmmfffffmfmfmfmfffffffmmmmmmmmmfmmfmfmfmmmmfffmmmmffmmmfffmmmmffmfffmmfffmmmmmffmffffffmmmmmmmmmmmmffffmfffmmfffffmffffffmfmmfmmmmfmmffffmmfmffmffmfmmfmfffmmfmmmmfmffmffmfmmfmmfmfmfmmfffmmmfmfmmmmfmffffmmfmmmffmmffmfffmmmmmfmfmffmmfffmfffmffmmmmmfmmmmmmmffmffffffffmfmmmmfffffmmmmmmffffmmfmmffmmmffmffmmmfffffffmfffmfmfmffmfmmfmmfmmffmffmfmmmmfmmffffmfmfmfffmmmmffmfmfmfmfmfffmmfmmmmffmmmmfmfmffmmfmmffmmfmmmfffmmfffffmfffffmfffmmfmmmffmffffmmmfmmmmmfmfmfmmmmffmfmfmmmfmfffffmmfmmffffmmffmmmmfffffmmfmfmmmmfmfffmmmffffmmmffmmmffmffmffffmmmfmmfffffffmmfmmmmfmfmfffmmmfmfmmffffffmffmmfmfmmffffffmffffmfmmffmfmmfmffmfmfffffmmffmfmmfmmmmmmmfmmmmffmmfmmfmfffffmmmmmmfmfffmmfmfmfffffffmfmffmmmmmmmfmfmmfmffmmmfffmffmmffffffmmmfmmfmfmmffmmfmmffmmfmmfmfffffmmfffmmfmmfmmfmfmfffmmmffmmfffffmmfmmfffmmfmmmfmmfmmmfffmmffffffmmmmmmfffmffmmfmmffmmfmmfmfmffmfmmfmmfmmffmmmmffmmffmmmmfmfmfmmmmmffmmfmfmmmmfmmfmfmfmfmfmmmffffmmmmmmffmfffffmmfffmmmfffmmffmmfffmffmmfmmmfmmfmfmmfmffffmffmfmfffmmfmmfmmmffmmmmmmmffmmmmfmmffmmmfmfmmmfffmmmfmmfmfffmffffmmmmfffffmfmmfmmmmfffffmmmmfmffmmmfmmffmmmmmmmmffmfffmfmmfmmmfmffmfmmmmfmffmmmfmmmfmffmmmffmmmfmfmmffmfffmmmmmfmmmffmmmmfmmfmffffmmmfmfmfmfmmfmmffffmffmffffmmmfmmmfffmmffmfmffffmmffmmfmmmfmfmmmfffmfmmmfffmfffffffffmfmffmmfmffffmmmffmfmffffmmmffffffmfmmmfffffmfffmfffmmfffmmmmmmmffffffmffmfmfmmfmmmmmmmffmfmmffffffmfmfffmmmffmmffffmfffmfmffmmfmfmfmmmmfmmfmfffmfmfffffmfmmmffmmfffffffffmfmffmmmffffmmmmfmmffmffffmmmmmfffmmfffmmmmmfmfffmfmmmmmmfffmffmfmmmmffmfffffmfffmmffmmmfmmmmfmmmmmfmfmffmfmfmmmmmffmmfmmmfmmffmmmmfmfffffmfmmffmfmmmmfmffmmmfmfmfmfmffmffmfffmmfmmmmmfmmmmmfffmffmmmfmffmmmmmffmfmmfmmmfmfmfmmffmfmffffmfffmmmfmfffmfmmmfmfffmmfmmmmfmmmffmfffffmffmffmmmmmmmfmmmfmfmfmmmmfmfmmfmmmffmfffffmfffmfmmmmmmfmfmfmmffmmfmmmffmfmfffmffmmmffffmffmfffmfmfmmffffmmmmmmfffmmmmfmfmmffmfmffmffffmmfmmfmffmmmfmmmffmmmmmffmfmfmffmfffffffmmmfmfffmmmffffmmffmffmfmfmmfmmfmfffmfmffffmfffmmffmffmfmmfmfmmfmmfmmffmmmfmmmfffmffffffmmfmmmfmffffmmmmfmmfmmmmfmmmfmmmfmmmmfmffmmffmfmmmffmfmmfmfmfffmmfmfffffmfmmfmmfmffmfmffmffmfffmmfmfmmmfmmffmmffmmmffmfmmfffmmfmmfmmmfmmmfmmfmfmmmmffffffmmmmffmffmfffmfffmfffmfmmmffmmmmfffmffmmfmffmfmfmfmmmfffmfffffmmfmmfmmmffmmfmmfffffmfmmfmfffmmmfmmmfmfmffmmmmmfmmfmmmfmfffmfffffmfmmmmfmffmmfmmmffmfmmmmffmfmfmfmfmffffmmffffmffmfffmffmffmmfmmmffmmfmfmmffmmffffffmfmffmmmmffmmfmffmffffmmfffmfmfffmmmmmffmmfmfmmfmmmffmmfffmmmmfmfmffmfmmmmmfmfmffmfffmfffmfmffmmmmfffmfmmmmfmffmmffffffmmmfmmmfmfmfmfmfmffmmfmmmmmfffmfmfmmmffmfmfmmmfffmfmffmmffffmmfmmffmmfmfmffmmffffmfmffmmmmmfmfmmfffmmmffmfmmffffffmmmmfmmmmmmfmmffmfmfmmmffffffmmfmmfmffffffmmmffffffmffmfffmfmfmmfmmfmfffmmmmfffmmfmfffffmmfffmfffffmfmffmfmffmffmffmmmfmmmfmffmffffmffmfffmmmfmmmfmffmffmmmmfffmmfffmfmfffmmmmffmmmmfmffffmmmfmfmmffmmffmfffmfmfmffmmfffffmffmfmmmffmfmffffffmffmfmfmfmmffffmfmffffmfffffmffffffmfmmfmfffmfmfffmmmfmfffmfffmmmffmmffmffmfmmfffffmfffmmfmfmfmfmfmmffmmfmmmfffmfmmmfmmfffmfffmfffmfmfffmmffffmfmfmmfmmfmffmffmmmfmmmfmmmffmfmmfmfffmffmmffmffmffffffffmmmffmmmmfmmffmffffmmfmmmmffmffffmmmmmmmmmmfffmfmffmffmmfffmmffmfmfmfmfmmmfmfffmfffmfmmmmmmfmmffmmmfmffmffmmfffmfmmfmfmfffffmmmmfmfmmmmmffmmfffffmfmmmmfmfmmmfmffmmmfmfmmffffmmmfmmfmfmmmmmmfmmmfffffmfffmmffmmmfffmffmffffmmmfffmmffmmmmmmmmmmfmmfmmfmffffffffmffffmfmfmffmmfmffmfffffmfmffmmmmmmfmmfmmmmfmffmfmmfmmfffmmmmmfffmmmmfffmfmffmmmmfmfmmmfmmfmfmmfmmfmmmfffmfffmmmmffmfffffmmffmmmfmmmmmfmmmffffmmfffmfmmffmmmmmmmmmmfmfffmmfffmffmfmmmmfffmfmmffmfmfffffffmmffmmfmffffffffmmfmffmmmffmffmfmmffffmfmffffmffmmfmfmmfmfffmmmfffmffmfmfmmmmfmfmfffmmmffmfmmmmffmmfmmffmfffffmfffmmmmmmfmffmmfmfmmmffmmfffffmffffmfffmffffmmmffmffmfmmmffmmfmmmmffmmffmfmffmmmfmfffmmmmfmmmfmmmffmfmmfffmmmfmffffmmfffmffmmffffffmmfffmffmmmmfmmmmmmffmfmfmmfmmmfffffmffffmfmmfmmmfffffmmfmmmmmffmmfmmmffmmmfmmfmfmmffmffmmmfffmmfmmffmmfmfffmffmmmffffmffmfffmfmmmmmmfmfffmffffmffmfmmffmmfmmffmmmffmmmfmmfffmffmfmffmmmffmmfmffmmmfffffmfffmfmmmmfffmfmmfmmfmmfmfmffmffmfmmffffffmmmmmmffmfmmmmmmffmfmmfmmffmfmmffmmmffmmfffffmfffffmmfmmmfmmfmfmmmfffmmmmmfffmmmffffmmfmfmmmmmmfffmmfmmfffmmfffmmffffffffmmffmfmmfmffmmmmfmmmfmfmffmffmfmfffmmmffmfmfmmfmmfmmffmfmfffmfmfmfmfffmfffmmffmfmmffmmmmmmfmfmffmmmfmffmffmffmfmmmfmmffmfmmmfffmffmmfmmmmmmmmfmmffmmfmffmmmfmfmfmfffmfmmmmmmfmfffmfffmffmfffmffmmmmfmffffmfffmffmmfmfmmfffmfmmmffmfmmmffmmmfmfmfffmfmmmffmmmfmfffmmmfmffmmfffmfffffmfffmfffmffffmfmmmmmmmfmmfmffmmmfmfmfmmmmmfffffffmmmmmmmmffmfmffmfmmmmmmffffffmmfmmmfmmmfmfmfmfmfffffmmfffmfmmfmmmmfffmmmffmffmffmfffmffmmmffffffmmffffmmmmmmffmmfmffmmmfmmfffmfmfmmmfmffmmmmmfmmmmmmfmfmmmffmmfmmfmmmfmfffmmfmfmfmmfmmffmmfmmmmmffmmmffffmmffmffmffffmmmmmmffmmffffmfmmmfmmfmfffffmfmmffmmfmmffmmmfmmmmmmffmmmmfmmmffffmmmmmmmmmmmfmfmmfmfffmmmfmfffmfmmmfmffffmmffmmfmmmffmfffffffmffmfffffmmmmfffmffmmffmffmmfmmfffmfmmmfffmfmffffmfffmmmmmmmfmffmmmmffffmmmmfmmffffmfmffffffffmmfmfmmmfmmfmfffmffffffmffmffmmffffmmffmmmfmmfffmmfmmmmmffmmmfmmfffffmmfffmfffmmfmfffmmfmmfmfmfffffffmfmmmmfmfmmfffffmffffmmffmffmfmfffmfmfmfffmmmfmfmmmmmmmmmmmffmfmfmfmfmfmmmffmfmmmmfffffffffmmfffmfffmfmmmmfmfmmfffffffmffmfffmmffffmfmfmmfmfmmmmmfmfmffmmfmmfffffmmmmmmmfffmmffmffffffmmmmmfffmfmmmfmmfmfffffmmfmmffffmfmmmfffffffffmmmfmfmmfmmfmmfmmfmmfmmffffmfmmfmmmmfmmmmfmfmfmmmfmmffmfmffmmmfmmfffmfmffmfmmmfmffmfffmffmfmmffmfmmmmffmfmmmmmmfmmfmfmmfmmfffmfmmmfmmffmmffmffmfmmmmfmmffmffmmmfffmmfmffffmmmffmmmmfmmfffffmmffmmffmmfffmmmmffffmfmffffmmffffffmfmmmmmfmffffmmffmffmfffmfmmmmmfmmfffmfmfmfmmmmmmfmmffmmfffmfmffmfffmmffffmmfmmmmffffmfmmmffmfffffmmfmmmfmffmmmmmfmmmfffmmmmffmmfmmmmffffmmffmmffffmfmmffmmmmmfffmmmmfffffffmffmfmmmfmffffmfmffmfmffmfmfmfmffmmmmffmmfmmffffmfmfffffmmmfmffffffmffmmmffmmmffmmmfmfmfmmmfmmmfmmmmmfmfffmmmfmmmffmfmfmfffmmmmfmmmfmmfmmmfffffmffmffffmmmffmmffmmmfmmmfmmmfmmfmfmmfmfmffmmmmfmmfmmmmmmmfmmmmmmmfmmmmmffmfffmffmfmmfmffmmmfmfmmmmmmmfmmfmfmfmmmmmfffmffmmmfmffmfmmmmmmfmmmmffmfffmmmmmfmfffffffmfmffmffmmfmffmmfffffmffmfmmmmmfmmmfffffmmffffffmmmmfmmffmmmfmfmmfmfmmfffffmfmfffffmffffmffmmmmffmmffffffmfmfmfmmmmmmmmffffmmmmfmfffmmffmmfmfffmfffmffffmmmmfmmmfmffmfmfmmmmfmfmmmmmmmmmmffmmfmmffffmmffmfmmmfffffmfmmmmmffmfmmmmfffffmmfmmffmffmmmmfmfmmmmmmfmmmmfmmffmffffmfffmmmffmmfmmmffmmfmffmmmfffmffmmmmffmmfmmfffmfmmmmfffmmmfmfmmmffmmmffmmffmmmfmfmmffmfmmmfmfmfmffffmfmmmffffmfffmfmmmmmmffffmfffmmffmfmmffmmfffmmmffmmmfffffmmmmfmffmmmmmfmmmfmfffmffmmmfffffmmmffmffmfmmfmmffffmmfmfmmfffmmmmffmmmmmmmmfffmmfmmmmmfmmfmfmmmfmfmmmmmmmfmmfmmfffmmmmmmmfmfmfmmmfmfmmffmmmmfmfmffffmmfmmffffmmmmffmfmfmffffmfffmfmmmmffmmmfmmmmmmfmmmffmmffmmffmmmffmfmfmmmmfmmmffffmmmffmfmmmmfmffffmffffmfmmmffmmfmfmmmfmffmfmfmmfmfmffffffmfmfmmmfmmmmfmfffmmfmmmffmfffmfmfmfmffffffmmmfmfmffffmmmfffmmmmmffmfmfmfffmmfmmfmmmmfffmfmfmmfmmfmmmmfffmmmmmfmmfffmffmmmmfmfmfffmfffffffmfffmfffmmffmmmmfffmmmmfmmffffmfmmmmfmffmmmfffmffmffmmmfmmmffmfmffffmffmfmmffffmfmmfffmfmffmfmfmfffmfmmmmmffmfmmmmmfmmmffffmffmmmmmmfmmffmmfmmffmmmmfffmmfmmmfmmfmmfffmmmmfmmmmmfmfffmfmffmmmffmfmmffmfmfmmmffmffmffmmmfmmmmmmmmmffffmffmmfmfmfmfmfffmfmmffffmmmfffmmfmfffmmmmmmmmmfmmfmmffmfmfmmmmmffffffffffmmffmffmmfmfmfmmmffffmmmfmmmfmfffmmffmffmmmmfmmmmffffmffmmffmmmffmffmffmmmffmmmmfffmmmffmfmfmmfmfffffmmfffmmmmfmfmmmmmmffmfmmfmmmmmfmfmmffffmmfmmmfmmmffmmmfffffmmfffffffmmffmfffffffmffmffmfffmffffmmfmffmmmfmffmffffmmmfmffmffmfmfffffffmfmmmfmmfmmfmmmfmffmffmmmmffmfmmmfmfffffmffmmmmmffffffffmmmmmmffmmmmmfmfmffffmfmmmffmmffmmfmmmmffmmmfmfmfmmffffffmfffffmffmmmmfmmmfmmfmfmmmmmmfmmffmmfmmmfffmffmffmmffffmmmffmmmffmfffmmmmmfffffmffmmmmffffmfmmfmfmmffffmmfmmmmmmmmmfmmfmfffmffffmffffmffmmfmffmmmmmfffffmmmmffffmmfmmmfmfmmffffmmfmmmmmmfffmffmmfmmfffffffmfmfmmfmmfmfmmffmmmmmfmfffmffmfmmmmfmfmmfffmmmmmmfmffmmmmfffmmmmffmmmmffmmmmffmmfmfmmffffffmffmfmffmffmffmfmfmmmfmmfmmmmmmfmmmffmmffmmmfffmfmmfffmfffffmfmfffmfmmffmfmfmmmfffmffmfmmfmmmmffmmfffmmfmfmmmmmmmmmmmmmfffmffmmmfffmfmfffmmmfmmfmffffmfmfmfmffmmfmfmmfmmffmfffmfmmfffmmfmmmfmmfmfmfmfmfffmffffmmffmmmmmfmfffmmffffffffmmmfmfmmfffmfmmmmmfmmmmfffffffmmmfmmfmfffmfmfmmmmfmffmffmmmffmmmffmfmmmfffmfmffmmfmfmmfmmffmfmffffmmmffmffmmfffffmmfffmffffmmmmmffmmmmfmmffmmmfffmmfffffmmffffmmmfffmffmfmfffffmfmmfmmfmmmmmmfffmfmmmmfffmffffffmmfmffmffmfmffmfmfffffffffmffmmfmmffmfffffmffmmfmfmmmmmmmfmffmfmfmfmfmmmfffmmmfmmmffffmfmfmmfmmfmmmfmffmmmfffffmmmmmmfmfmmmffffmmmmffmmmmffmffffmfffmffmfmmfffffffffmffmmffmmffmmmffmffmfmmffmfmfffmmmmmmmfmmmfffmmmmfmmmmmmmfffffffffmmmmmmmmffffmfmmfffmmfmffmmmmfmmfmfmfmmmffffmmfmffmmfmfmmmmmfffmfmmmmmmffmffffmmmmfmffmmffffmfmffffffmmfmffmffffmfmmffmmmfmmffffmfmmfmmmmfmmmfmffffffmfffffffmmfmfmmffmmmffffmmmmmmffffffmfmmffmmfmmfffmmffmfmmfmfmmmffmfmfffmfmmfmffmffmfmmmfmmmmfffmmffmfmffmmmfmmmfffmmmfmfmmmfmffmmffmffmffmmfmfmfmfmffmmffmmfmmmfmmmmffmfmmmfmmmmmmmmmffmmfffffmmmmfmfmmfffmmmmfmfmffmmfmfmmffffmmmmmffmfmmfmmmfmmffffmfmmmffmmmmmffmffmmfmfmfmmfmffmmmffmmmmfmmmmfffmmmfmmmfmmfffffffmffmmmffffmmmfffmmmmffffffffmffmmmmmmfmmmmffffmmfmffmfmfmmffmfmmffmmfmffmmffffffmffmfmmmfmffmfmmmfmffmfffmfmmmffmfffffmmmmmfffmfmffmfffmmfmfmfmfmffmmmfmmffffmffmmffmffmfmmfmfffmmffmfmfffmfmmfmfffmmffmmffmffmfmmmmmfffmmfffmmmmmmmfmfmffmmfmfmffffffmmmfmmmffmfmmmmmfmmmfmmfmmfmmffmmffffmffmffffmmffmffmffmfmfffmfmfffmmmmmmfmffmfffmfmffffmfmmfmffmmfmmffmmfmfffffmmmfmfmfmfmffmfffmmmffmmffmmmmmmffmmffmffmfmffmfmmmffmmfmffmmfffmfmfffmffffffffmffffffffmfffmmfmmffmmmfmffffmffmmfmmmfmfmfmmmmfffmfmfffmmmmmfmmffmmfmmfmmffmmmfffmffffmfmmmfmmmmfffffmmmmmffmmffffmfmmfmmmmffffmmffmmffffmmmmmmfmfmfmmfmmffmffmffmfmmmmfmfmfmfmfmffmmfmfmffmmfmmffmmfmfffmmmfmmmfmfmfmmfmmmmfmffmmmfmmfmmmfmfffmmffmfmmfmffmfmfmmffffmmfmffmfmfmmmmfmffmmmmmmmffffmmmmfmfmfmfmmfffmfmffmfffmmfmmmfmfmfmfmffmfmffffmmmfmffmmmmfmfmffmmfffmmfffmfmfmmmfmfmmffmfmmffffmffmmffmmfmmfmfmmmmfmfmmffmmmmmfmmmfffmfmffmfmmmffmmffmmfmmmmmffmmmmmffmmmmmmffmfmmmfmmffffmmfmfmmfmfmfffmfmmmmmfmmmffmmmffmffffmmmfmmmfmmmmfmffffffmmmmmmfmffmfmfmmfffffmmmmfmffmmfmffffmmfffffmfffmmmmfmmmmfmmfmmmfmmfmmmfffmmmmfmmfffmmmmmfffffmfmffffffmffffffmfffffmmmfmmmfffffmmmfmffffffmmffmmfffmmfmmmmmmfmmfmmffmfffffffmfffmmfffmfffffmffmffffmfmmfmffmmffmfmmfffmmmffmffmffmfffmfmmmfmmfmfffmmmmmfmfmmfmfmfmffmmmmmmfmfffmfffffmfmffmmfmfmmfmmmfffmffmfmmfffmfffmmmffmfmffmfmfmffmmmmmfmfffmmmmmmfffmmmffmmfmffmfmmmfffmmmmmfffmfmmfmmmffmmmfmfmmfmfmmfffffmfmfffmmfffmfmfmmfmmmfmmfffmfmfmmffmfffmmmfffffmfmmfffffffmfmmmfmmfmfffmmfmffmfmmfmfffmfmmmfffmffmffmmfmmmfmmfmmmmmmffmfmfmfmmfmmffmmfmfffffffmfffmmmmmmffmmmfmfmmfmffmmfmmmfffffmmmmmfmmmmfmmmffmffmfffmffmffmmffmfffffmmfmfffmfffmmmfmmffmmfmffmfffmmffmfmmmmmmmfmfffmmmmffmffmmfmfmmfffffmfmmffmffmmmfmmmmffmffffmfmmffmfmffffmmffffmfmfmmmfffmmfmmfmmmmfmmffmmfmmfmmffmmffmmfmmmmffmmffmmfmmfmmfmmffmfmmffmfmffmfmffmfmmfmffmmmffffmmffmffmmffmmfmffmmmmfffmfmfmmffmfmmfmfmfmmffmmfmmmfmfmmmmfffmmfmmmffmfmmffmfmfmffmfmmffmfmfmfmffffmfmmfmfffmmffmmfffmmffmmmffmmmmffmmfmfffmffmffffmmfmmmmmmmffmfffmmmmfffffffmfmmmmfmfmmffffmfmfmmffffmffffmfmmfmffmfmmmfmmmmmfmfmffmfmmmmmmmffmmmmmmmmmffmmfmfmfmmfffmmmmfmmfmmmmmmffmmmfffmmmmmmfmmfmmmmfmfmmfmmffmfmfmmmmmffffmmfffmmffmffffmmffffmmmmmfffmfffmfmmmfmffmmfffmmmfmffmfmmmmffmmmmmfffmmmmmfmmffmmmmfffmmfmffmmfmmfffmfmfmmmmfmfmmmmfmfmmfmmmmffffmmmfmmfmfmmmmmfmffffffmmmfmfmmmfmfmfmfmfmmffmfmmmfmffmmfmffmmmmmffmfmfmmmmfmmfffmmmmfmffmmmmmmmffmffmmmfmmmfmmfmffmmfffmmfmfmfmffmffmffmffmmmfmffffffffmmmffmfmmmmmmfffmfmmmmfmmfmfmfffmfffffmffmmffmmmfffffmmmmffmmmmfffmfmmffmmmfmfffmmmfffmfmmmffmmmfmfmmfffffmmfmmmfmffffmfmffmmmffffmmfmmfmfmffmfmffmmmmmmmmffmmmfffmfmmmffmmmfmmmfmfmmfmffffmfffmfmfmffmfmmfffmffmfmfmfmffffffmfmmmfmmmffmmfmfmmmffmfmmmmfffmmmfffmfffmffffffmmmmffmfmfmmmmfmfmmmmfmfmfmmmfmmfmfmmmmmfmfmmffffffmffmffffmffmmmmfmffmmmffffffmmfffffmmfffmmffffmfmfffmffffmfmmfffmfffmfmmfmfmfffmfmfmfmfffmfmffmffmffffmffmfmffmmmmffffmffffffmmfmfmmmffmmfffmffmfmfmmmmfffmmfmfmmffmmmmfmfffmfmmmmmmmfffmffmmfffmfmmfmffmmmmfmmmmmmmmffffmmfmmfmfffffmmffmmfmfmmfmmmfmfmmmfffmmffmffffffmmmfmmmmmmfmfmmmffffmfmfmmffmfmfffmffffmmmfffmmmfmfmfmmmmfmmmmfmmfmfmfffffmmffmffmfmmmffmmfmffffmfmfffmfffmfffmffffmfffffmffmmfmffmmmffmffmmffmmffmmmfmmffffmmffmfmmmfffmmfmfffmmffmfmmmfffffmfffffmmmmfmmmmffmmfmmfffmmffmmffmfffffffmmfffmmmmffmfmmffffmmmfmmfffmffmmfmmmmmfmffffffmmffmfmmmmfmmfmmffmmfmfmfffmmmmfffmffmfmmfmfmffmffffmfmmfmmffffmfmffmmmfmfffmmmmfmmffmfmmfmmmfmmmmmmmfmmmmfmmfffffffmmmmfffmfmfmmfmmffmmffffmfmfffmmffmmmmmfmmfffmmfmfmfffmffmfmmmmmffmmmmfffmmfmffmfmfffmfmmmmffmffmmmffmmfffmmmmmmmmffmmmmmfmfmmfmffmffffmffmmmfmfmmfmmmfmfmfmffffffffffmmfmfmmmmmmmfmfmfmfmmfffmmmfmfmfffffffmfmfmmffmmfmmfmmfmmfmfffmffmmfmmffmmmffmmmfmfmffffmmffmfmfmmfmfffmfffmfmfmmmffffffmfmmmfmfffmmfmffmmmffffmmmmmfffmmfmmffmffffmmmfmffmmmfmffffffmfmmfmmmmffmfffffffmfmfmffmmfmmmffmmfmfmmmmmmffmmfmmmfmmmffmfffffffmfmffmmmfmfmfmfffmmfmmfmfmmfffmffmfmfmffmffffffmmmffmffmfmfmfffmfffmfmfmmmmfffmmmffmmmffffmfmmmfmmfmmmmmfmmmffmfffmmmmmmmfmmfmffffmfmmffmfmmffmmffmmmfmmmfffmffmffmmfmfmmmfmfmmmfmmfffmffmmmfmfmmmffmfmfffffffmfmmffffffmmfffmfmfffmmfmmfmmfffmfmffmfmffmmmmmfffmffmffmmmmfmmfmmffmffmmmffmmfmmffmmffffmfmffmmmfmffffffmffmffffmmmfmfffffmmffffffmfmmmfffmffmmmffmmmmffffmmmmmfmfmmmfmmmmfffmmffmfffmffmffmmmffffmmmffmfmmmmmmfmmffffffmfmfmffffmmmfmfmmffmmmffffmmmmmfmmffmfmfmfmffmfmfmmmmmmfmffffmmffmmmffffmfffffmmmmfffmmffffmffmffmmfmmffffmffmmmffmffmmmfmmmffmmfmmffmmfmfmffmfmfmmfmmmffmmmffmmfmfmmmmmmfffmfmmffffmffmfmmffmmffmmmfmmmfmfmfmmffmmfmffffmmmmmmmmmmmmmmmmfmfmmfmfmmfffmfmmfmmfmmfmmmffmmmmfmffffmmfffmfffmmfmmffffmfmmmmffffmffmmmfffmffmmmmfmfmfffmmmmmffmffmmmmmmmffmmfmmmffffmffmmmmmfmffmfmffffmfmfmffffmffmfmmmmffmffmmmffmfmffffmfffmffffmmmffmmmffffffmmmmffmfmfmfmffmmfmmffmfffffmmfffmffmfmfffmffmffmffffmfmfmffmfffffffmffmmffmfmfmffmffmmfmmffmmfmmffmmmmmffffmmffmmmfmmmmmffmfmmmmffmmmmmfffmfmfmmmmmmfmmmmfmffmffmmmmmfmffmfmmfmfmmmmfmmfmfmmffmmmfmfmfmffmfffmffmfmfmmmfffmffmmmffmmmmfffffmfmmfmfmfffmmfmmmmmffmfmmmfmmmmfffmmmmmmmfmfffmmfmfmmmmmmmfmmmmfmmffmmfmfmfmffmmmmfffffmfmmfmffmmmfffmfmmmmfmfmmfmfmmfmfmffffmffffmfmfmmfmmmffmfmmmmfffmffmmfmfmfmffmfffmffmmfmfmmmmmmffmfffmfmffmmfffmfffmfffmfmmfmfmmmmmmfmmmfmffffffmmfmmfmmmmmmmfffmmmfmmfffmfmfffffmffmfmfmmfmfmmffmfmffmmfmfffffffffffmmfffffmfmmmfmmfmmmfmmmmmfmmmmfffffffmmmmfmmfffmfmffmmmmffmfmfmfffmffffmffmfmmfmmmffmffmmmfmfmmmfmmmmfmfmfffffffmmffmmmffmfffffmfffmmmmmfmfffmmmfmmfmfmffmffmfmfmffmffmfmmmmmfmmmmmmfffmfmmfffmmmmffmfmfmfmmmfmfmmfffffffmmmfffmfmmfmmmmfmmfmmfmffmmmmfmfmfmmfffmmmmfmfmmmfmffffffmffffffmmffmffmmmmffmmffmfffmmfmfffffmfmmfffmffmfmfmmfmffmmmmfffffmfffffffmfmmmmffmmmfmfmffmmmfffffffmffmmmffmfmmfmffmmmmmfffffmmmmffmmffmfmmfmmmffmmffmffmmfffmmmfmmfffmmmffmmfmmmfffffmfmmfmfmffmfmmmffmmmfmmffmfmfmmmmfmfffmfmmfmmmffmmmmffmfffmmmfmmfffmfmmfmmmfffffffmfffmmfffmmmmffffmffmfffmffffffmmffffmmfmfmffffmmffffffffmmffmmmfffmmfmmffffffmmffffffffffmffmmmfmfmmmfffmfffmmmffmmmmmmffmfmfmffmfffmfmfmmfmmffmfmmffmmmmfffmfmfffmfffffmffmfmfffffffffmmmfmmfffmmfmfmffffffmfmmfmfmmmmmmfffffffmfffmmmmfmffmmfffmfmmmmmfmmfmfmffmfffmfmfmffffffffmffffmfmmfmfmffffmffmmfmmmfmmfmmmmmffmmfmffmmmfffmffffffmmffmfmmmmmffmfmfffffmmfmmfmmffffmmfmfmffmfmmmfmfmmmfmmffffmfmffmfmfmmfffmfmmfmfmfffffffffmmmfffmfffmffmmmffffmffmfmffmmffmfmfmffmmfmmmfmfmmmmmmmfmffmmfmfmffmmmfmmmmfmfmfmmmffffffmfmfmffffmmfffmfmmfmmffmfffffmffmfmmfmmfmfmmmmffmfffffmmffmmmffmfffffffmmmfmfmfffmfmmfmmfffffmfmfmfmmfmfffffmffmffffffffmmmmfmmffmfmfffffmmmfmfmmmmmmfmmmmffmffmmfmmffmmffffmmfffmfmfffmffmmmmmmmmmmmffmmfmmfffmmfmfmfmfmmffmmffmmfmmmmfmmfffmfmmmfmmfffmmmmmffmmfmfmfmmmfmmffffmmmffmmmffmmmffmmmfmfmfmfffffmmffffmfmfffffmmfffffmffffmfmmfmmmfmfmffffffffmmfffmmfmmffmmmmmmmmmmffmmmmmmmfmmfmmmmmfffmmmfmmfmmmmmffmmfmmmmfffmfmmfmffmfmmmmmmmfmmffmffmffmmffmfffffmffffmmfmmmmmffmfmmfmmmffffmmfmmmmmffffffmmmfmmfmmmfmmmmmmfffmfmmmmmfmfffmmfffmfmfmfffmmmmmffmmmfmfmmmfmfffffmfmmfmffmmffmfmmmmmffmfmfmmmfffmfmmmmffffmmmffmmfmfmffmffmfmmffmmmfffmmmmmmffmfmffffmmfmmffmffmfffmffmfmmffmmmmffmmmfmfffmfmfffmffmfmmffmffffmmffmfmfmfmfmmmmfmmffmffffmmmfmmffffffmmmmfmfmfmffffmmffmmmmfmfmfmfmmmfmmfmffmmmffffmmfffffffmfmmmffmmmmmffffmffmfmmfffmmmfmmfmfffmffmmfmffmmmmfmffmmfffmmfffmfmffffffmfmfmmmfmffffmmfmmffmmmmfmmmfmmfmmfffmfmmfmmfffmmmmfmmffmfmfmffmmffmmmmmmfmffffmffmffmmfmmmfmmffffmmfmffmmfmfmffmmfmmmffmmfmfmffmmfmmmmfmfmfmfmfmffmmmmfmfffmffmfmfffmfmmmmfmfmffmmmffmmmfmfmffmmmmfmmmfmfffmmfmmffmfmffmffmffmmmfmmmffffffffmmmfmfmffffmffmfmmfmfmffffmffmffmmmmfffmmffmmmffmmfmmfmmfffmmfmmmfffffmmmmmffmmmmmfmffffffmfffffmffmmfffmmfffmmmmmffffmmfffffmmfmfmfmmmmmmmffffmmmffmffffmmmfffmmmffmmfmmmfmmfmmmmmfmfmmfmfmfffmmmmmfmmffmfmfmmmmmfmmmmffmmmmmfmfmffffffmmffmffmmfmmffmfmfmfmmfmmmmmfffffmfffffmfffffmmmmffffffmfmffmmmmmmfffmmmfffmmfmfmmfmmmmmmfmfmfmmmfmmmmffmmfmfmfmffffmmfmmmmffmmfmfmffmfffmffmfffffmfffmmfffmfffmfmmmffmmffffmmfmmmmmfmffmmmmfmfmmfffmfffmfffmmmfmmmffffmmmmfmfffmfffmmfffffmmfmmmmmmmmfffmffmmfmmmmmffmmmmfmmffmffmfmffmfmffmmffmfffmfmffmffmfmfffmfmmfmfmmmmfmmmmffmmfmfmmmmmfmfmmfmfmfmffmmmfmffmmmmmffffmmmmfmfmfmffmmmfmmmmmmmmmmmmfmfmfmffmmmfffmmmffmmmffmffmfmfffmmmffmmffffmmfffmmfmmfmmmmfmffmmffffmmfmfmmffmfffffmffffmmfmfmmffmfffffffffmmfffmmmmfmmmmfmmfffffffmmmmfmmffmmmfffmmfmmfmffmmmffmmmfmffmmmmmmffmmmmffffmffmmmmmfmfmmmmffmmfffmfffmmffffmfmmffmfmmmffmmmmfmfmfmfffmmffffmmmmffmfmmmmmmmmffmmmmffffmmffmmmfmfffmmfmfmfffmmmfmfmmfmffmfffmmfmmfmffmfmfmmmffffffmfmfffmmmmffmmmmfmfmmffffmfmmfmffmfmmmffmfmmmmmfmfmfmmffmmmmfmmmffmfmfffffmfmmmffmmmmfmfmmffmmfmmmffmffmmmfmfmmffmfffmmfmfmmffmffffmfmmmmfmmfffmmmmmmfffmffmmmfmfffffmmffffmmfmmffmmffmmmmmfmmmmmmffmmfmmmmmfmfmfmfmfmmfffffffmfmffmfffmmmmmffmfmmmfmffmffmmmfmfmmmmfffffmmfmfmfmmffmfmffmmffffffffmmmmmfmfmmmfmfmmmmmffmmffmmfmffmfmfffmmffmfmfmmfmfmmfmmmmfmmmffffmfmmfmmmfmmmmfmmffmfffmfmfmmfmfmmmfffmmmffffmmfffmmfmffffmmmfmfmmmfmmmmmmmfmmffffmmmmffmfffmmffmmmmffffmffffmmmmfmmmfffmmmffffffmfffmffmfmmmfmfffmfmffmffffmmfmmmfmmffmfmmmmfmmffmmffmmmmmfffmfffmmfmmfmmffffmfmffffmffmfffmmmmmmfmmfmffmfmmmmmfmfmmmfffmffmfmfmffffmfmmffmmmffmmffffffmfffmmfffmmmfmmfmfmfffmmfffmfmmmmmffmmffmmmmfffmmmmffffmmmffmmfffmfmmfmfmfmfmmffmfmfffmffmffmfmmffmmmfmffmfmmfffmfmmfmmmmffmmfmfmmmfmfmmfmfmfmmffmmmffmfmmfmfffffmmmmmfffffffffmmmmffmmmffmmfmfmfffmfmfmmffffmfmfmmmffmffmmfmmffmfffffffmfffmfffmfmffffmfmmfffmffmmmmmmffmmfmfffmffmmmmfmmfmfmmmfffffmmfmmffmmffmmffmfffmfffmmmmmffmffffffmfmmmmmfmmmfmmmfmfmfmmmmmfmfffmmffmmmmmffffmmfmmmmmfmmffmmmffmffffmfmffmfffmmmmmmmmfffmfmfmmmfmmfmmffmmfmfmmmffmfmffmmmmfffmmmfffmmffmfmffmmmmmfffmmfmfmfmfmmffmfmfmmfmfmfmmffffffmfmmmfmmmmmfffmffmfmmffmfmmmmfmmmmffmmfmfmmfffffmfmfmfmfmmfmffmfffmmfmmfffmfffmmfffmmffmfmmfmfffmffffmffmmmfmffmffmmmfmfmfmmfmmmfffmmmmffmmmmffmmmfmfmmfmfffffffmmmmfmfmmmffmmfffmmfmffmffmmmfmmmfmfffmmfffmfmmffmmmfmffmmmfmmffmfmmmfmffmfffmffmmfmmfffmmfmmmmfmffmffmfffffmffmmmmmmfmmffffffffmfffffmffffffffmfmmmmfmmfmfffmffffmfmfmmfmffmmffmmffmfmmmfmmfmmfmmffmffmmmffmfmmmmffmfmffmmffffmfffffffmfmfmmfmffffmfmmffffmffmfmmmmmffmmfmffmfmmfffmfmmfmmfmffmmfffmmmmffmmmmmffffffmmfffmmfmmfffmffmmfmmmfmmmmmffmmfmffffffmffmfffmmfmffmfmmffffffmffmmmfmmmmfmffmmmmmmfmfmmffmffmmffmmffmmmmmfffffmmfmmffmmfmffmfmfmmmfmffmfffmfmfmffffmffmmfffmfmffmfmmmmmmffffffmfmfmmmfmmfmmmffmfmfmffmmmfmmfffmfffffffffmmmffmfmmmmmmfmffmffmffmfmffmmmmmmffffmfmmmmffffmffffffmmmfmfmfmffmmfmfmmmmfmffmmmmmffffffffffmfmfmfffffffmffmmffmfmmfmmmmfffmmfmffffmfmmfmffmffmfffmmmffmmmfmffmmmmmfmfffmmmmfmmfmmmmfmmfffffmmmmmmmmfmmmfmfmmfffmmmmffffffmfmmmffffmfmmmffmmfffmmfmmfmmffmfffffffmmmffmffmfmmmfmffmmmfmmmmmffmffmmmmffmmmmmmfmmfffmmmffmfffffmfmfmfmffmfmffmmmmmmmmmmffmmmffmffmfmmfmmfmffmffmfffmfmfffmmmffmffmmmfmfmffmfmfmmmffmmfffmmfffffffmffmfmmfmfmfmmmmfmmffmmmffmfmmmfmmfmmmmmfmmmffmffmmmfmmmmfmmmfmfmffmmfmmffffffmffmfmfmmmfmffmmmmmmmmmfmfmmmmmfffffmffffmmmfmffmmmfmmmfmmffmfmmfmfffmfffmmfmffmmmfmfmmmmmfffmmmfmfmmmffmmmmffmffffmmmfmffmmfffmmmfffffmfmmmffffmfmffmmfffmffffmmmmfmfmmffmfmffffmfmmffmmfmfmmfmfmfmffmfmfmmffmfmfffffmmfmmmmfffffmmffmmmmmfmmmfmmmmmmmffmmmfmfmfmfmmfmfmfmmffmmmffmffmfmfmmmffmmfffmfmmfffmmmmmmmfmffmffmmmmmffmmffmfmffmfmffmmmfmfmmmmmfmmffffmmfmffmmmfmmmfmffmmffmfmfffmfmmmfmfffmmffffmmfmfmmfmfmmfmffmfmmffmmfmmffmmfmffmmffmmmffmfmfmffffmmfmfmfmfmmmmfffmmmmmffmmfmfmmmmffmmffffmfmmfmmfmmffmfmfmfmfffmmmmfmmffmfmmfmffmmfmfmfmfffffmmfmfmfmfmffmmfffmmmffffffmfffmmfmmfmmmfmffmmffmmfmmmmmmmffmfffmfmfffffmffffmmmffffmmffmmffmmmmfffmfmmfmfmfmmfffffmmmfmfmfmfmffmffmfmfmmfmmmmmfmmfmmmmfffmfmmmmffmmfffmfmfmffmmmfffmffffmmfmmffmmmffmmmmfmmmfmfmmmfmffmmffmfmffffmmffmfffmmfffmfffffmmmmmmmfmmmmffmfmmfmfmmfmfffmmfmfmmmmmmfmfffffmmffmmfmmfmmfmffmffmfmfffmmfffmfmmmffmmmmmfmffmffmmmfmmffmfmmmfmfffmfmmfmfmmffmffmmmfmmfmffmmfmmfmffmmffffmffmffffmmmmfmfmmmffffmmmfmfmffmffmfffmmfmfmfmfmffmmfffffmmmmmfffffmfmfmfmfffmmfffmmfffmfmfffmffffffmfmfmffffmmfmmmmfmmfmmfmffmmmfffmmfffffffmmfffmmfmfmmfmmfmfmmfmfmfffffmffffmmfmfmmmffffmmmfffffmffmmmmmffmfmfmfmfffmmmmmmffmmfmffffmmmmmfmmfmmfmmfffmfmmmfmmfmmfmfffmfmfmffmfmfmfmffffmfmmmfmmffmfmmffmfmffmmmmffmmmmmfmmfmmffffmmmffffmmmmfmfmffmmmmfmffffmmmfmffmmmmmmffmmfmfffffmfmmmmffffmmmfmffffmfffmffffmffffffmmmfmfffmffffmfmfmmmfmfmfmmfffffmfmfmmfmfmmfmfmffmfmfmmfmffmmfffmmfmmfffmmmfffmfmfmmmmmmmmmmmffffmmmfffmmfffmfmmfmmffmmfmfffffffmffmffmffffffffffmmffmmmffffmmfmffffffmmfffmmffmmfffmfmmffffmfffmfmfmfmffmmffmffffmfmmmmmmfmffmmmmmmmmffmmmmmmfmmmmfmfmmfffmmmmfmmmffmfmmmmfmmffffmmfmmmmfmmfmmfmffmfmmmmmmfffmmmfmffmffffffmfffmmfmfmfmmmmmmffmfmmfmmfmmfmffmfmfmmmmmffmfmfmmmfmffffmmffffmmmmfffffmmmffmmffffmmmfmfmfmmmfmffmffffmmmmfmfmmfffmffffmffmmmfmffmfmfmmfmmmfmfmfmffmmmmmmmffmffmfffmmfmfffmmmfmmmffffmmmffmmfffmmfmfmmmmfffmmffmmfmmmfffmmmmfmfmmfmmffmmfmfmffffmmfmmfffmfffmmmfmmfmmffmffffmfmmmffmfffmmmffmmmfmmmfmffffmmmmfffmmffmmmfmfffmfffmfmffmffffmmmffmmfffffmfmmmfffffmffffmmffmmmmfmfmffmmmmmfmmfmmffmffmffmmffmmfmmmffmmmfmmmfffffmmmmfmmffmmmmffmmfmmmmmfmmffmfmfmfffmfmfmfmmffmmffffmffmffmfmfmmmmfmmmfmffmmmmfmffmfmfffmffmfmfmffmffmmmmffmmffmmfmfffmffmmmfmmmfmffmffffmfmffmmffffmfmmmffmfmmfmffmmffmmmmffmmmfmmfmfmmffmmffffmmmffffmfmmfmmmmmmmmmffmmmmmfffmmmfmffffffmffmffmmfffffmfmmmfmmfffmffmfmfffmffffmffmfffmfmmmfffffffmmffffmfmmffmfffmfmmmmfmmfmfmffmfmmfmfmfffmfffmmfmmfmmfffmffmmmfmmffmmmmmmfffmfmfmmfmmmmffmfmmmmmmmfmmfmmffmmfmfffmfffffmmffffmmfmfmmmfffmmfffmmmmmfffffffmmffmfmfmfmffffffmfmmfmffmffmmffmmmfmfmmfmmfmffmmfmmfmfmmmmfmmmffmfmffffffmmmmfmfmmmmfmfmmmfmmffmffmmmfmffmffmmfffffmmmmfmfmffmfmfmmmmmmfffmfmfffmmfmffffmmffffmfmmffmfmfffffffffmmmmfffmmmmmmmmfmmffmfmmfmmmffmffffmffmfmfffffmmmfmmmmmfmfffmmmmfmfffmffmfmffmffffmfffmmffmmffmffmmffmfmfmfmmmffmmmfmfmfmmmfmmmfmfmfmfmfffmmmfmffffmmmmffmffffmfmfmmmmmmmfmmmfffmffmfmmffmmmmfmmfmfmmmffffffffffmmfmfmffffmfffmfmfffffmmfffffmmmfmmfmmmffffmmfmmmfmmffmfmffmmmmmmmmffmfmffffmffmfmfmmffmfmmffmmmmffffmfmmffmfmfffffffmmmfmmffmffffffmmmmmfmfmmmfffmffmmfmmfmmmfffmffmmmfmmmmfmffmmmfmmffmfmmmmmmmfmfmfmffffmmffmmmmfmmffffmmmmfmffmffffmfmmfffmmmfffmmfmmmfffmmmfmmfffffmffmmmffmmffmffmmfmfffmffmfmffmffmmffffmmmmfmmfmfmfmmfmmfmfmfmfmfffmffmmffffmfffmfmffmffffmffffmmmmfmmmfmmfmmmfffmffffmmmfmmffmmmmfmfmffffmmmmfmmfmmmfmmmmmmffmfmffffmmfmmmmfmmmfmfmmmmfmffffmmfffmfmmmmffmfmmmmmmfmmfmmffffmmfmfffmmffmmmfffmmfffmffmmffmffmmffmmfffmmmfffmmffffmmfffffmmfmffmffmmmmmfmffmfmmffmmmmmfmffmfmmffmffmfmmmmmmffffmffffffffmmmfmmmfmmmmmffmfmffmmmmfmffffmmffffmfmmmmmffmmmmmmmmmmmfffmmmmmfmmfmmmfmmffmmfffffmmfmffmffmmffmffmmffmffmmmfmfmfmmmfmmffmfmmfmfmmmmmmfmffmffmmmmffmfmfmmfmfffmfmmmmfffmmmmmmmmmfmfmmmmmmffffmfmfmmfmmfmfmfffmmffmmmmmmfffmffmfmmmmffmfffmmmfmfmmffmfmfmfmfffmfmmmmmfffmmmffmffmfmffmmmmfffffmmmfmmfmmmfmmmmfffmmfmmffffmmfmmmmmfmmfmffmmmmffffmfmmfmmmmmfmffffmfmfmmmmmmmffmmfffmmmfffmmfmmmmmmfmfffffmfmmmmmfffmfmmfmffmfffmmmfffmfmmmmfmfmffmfffffmfffffffffffmfffffmfffmmmffffmmfmfmmfffffffffffffmfmmffmmmfmmfmfmmfmmmffmfffmfffmfmmffmmfmmfmffffffmmmffffmmmfmmfffmfffmffmfmmffffmfffmmfmmmmfffffmfmmmmfmmffmfmmmffmmffmffmmmffmfmmmfmffmfmfmfmfmmfmmmmfmmfmmfmmmfmmfffmfffffmmfmffmfffmffffmfmfmmmffmffmmmmfffmmmfmmfffmmmmmmfmfmmfmfffffmmmffmmffmffffffffmmmmmfmffmffmfffffmmmmffmfffmmmmmfmfmfffmffmfmfffmffmmffmffmfffmmmfmffmffmffmfffmfffmfmfmmmmffmmmmfmfmfmfffmfmmmmmmmffmmfffffmfmfffffmmfmfmfffmmmfmfffmmmmmfffmmfmmfmfmffmmfmffmffmffmmfmfffffmfffmfmmmfffmfmfmffmmmmmmmmffmmmfmfmmffmmmmfmfmfmfmfmmmmmfmffmfmmffmmfmfmfmmmffffmffmmffmmfffmmfmmfmmfmffmmmmmfmmmfmmfffmffffmfmfmffmfffmmmfmmfffmmmmffmfmmmmmfmfmffmffmfffmmmmfmfmmffmmffffffmmfmmmmmfmmfmmffmfmfmfmfmmmffmfmfmfmmmfmmfmfmffffmmfffffmffmmffmfmffmmfmmmmmmmfmffmffmmmffffffmfmffmmfmmmfmmfmmffmmfmfmfffmfmfffmfffmfffmfmfmfmfmmmffmfmmffmffmmmffmmmfmmffmfffmmfmfffmffffmfffffmmmmfmmfffmmmfmmfmfmmmfmfmmfmfffmmmmffmmfffmffmmffmmfffffmffffmmfmmfmmfffmmffmmmmfmmmffmffffmfffffmffffmfmfmmmffmmmfmfffmmmfffmfffffmmfmffmmfmmmffmffmmmmmmffmfmmmffffmmfmmfffmmmfmmmmfmffmffffmffffmmmmmmmfmfmfmmmfmfmfmmfmfmfmmmmffmfmffffmmfffmmffmfmmfmmfmmmffmfmffmmfmffmmmfmmmfffmfmffmfmmfmffmffmffmfmmfffffmfmffmfmmfffmmfmmffmmfmmfmfmfmffmmfffmmmmmffmfmmmfmfffmmfffmmmmffmmfmfffffmfmfmfmfmmfffffmfmfmfffffffffmmfmmfmffmmmfmfmfmmmmmmffmmfffmmmfffmmmmfmmmffmmmffmmfmmfffffffffmfmmffmmmmmmffffmfffmffffmffffmfmfmmmmfmmmffmmfffmmffmmfmffmfmffmmfmmmffmmmmmffmffffmffmmmmfmfmfmfffmffmffmfmfmmmfmmmmfmmfmmmmffmmfmmmfmfmfmfmmmfmfmfmffffmmmfmfmfmmmmffffffffffffmffmfmffffmmmfmfmffffffmmmmfmfmffmfffmmfffmfffmffffffffffmfmmfmmfmmmffffmfmmfmffmmfffmfmfffmffmmmfmmfmfmfmmmfmffmfmfmmffmmmmffmfffmmfmmmfmmfmmmmffmfmfffmmmffmmmmfmmmfmmmfffmffffmffmmmmmfmfffmmffmfmfmfmmffmffmffmffmmmfffmmfmfmmmffmffmmfmfmmfmmmfffmmfmfffmmmffmmmffmmfmmffmfmffmmfmfffffmmfmmfmfmfmfmfmmmmmffffmffmffffmffffmffffmfmmfffmmffmffmmmmffmfmmmfffmfmfffmmmfmmmffmmmfmmmfffmmfmmmmfmmffmmmmfmfffmfmmfmfmfffffmfmfmmfmmmmfffmmfmfffffmfmfmfmmfffffffffmmmmmmfmfmfmffmfmmffmmfmffmfffmfmffmfmmffmffmffmmfffmmfffmmfmffmmmfmmffffmffmmfffffmfmfmfmffffffmmmmmffffmfffmfmmffmmmfmfmfmffmffffmffmfffmfmmmfmmmfmmfmmmfmmmmmmmffmmffffmfmmfmfmfmfmmffmfmfmffffmfmmmmmffmfmfmfffmmmfmmffmfmmmmmmfffmfmmmffffffmmffffmfmfmmfmfmfmmfmmfmmmffmfmmmmfmffmfffmmfffmmfmfmfmmfffmmfmmfffffmmfmfmfmmfffffmfmmmmfmmfmfffmmmffmffmmmfffmfmmmmmfmfffmfffffmmffmffmmfmfmfmmfmfffmmmmmmmmffmfmffmmmfmffmmfmfffmmmmmfmfmfffmmmmmfffffffmmmfmmmffmmffmmfffffffmmmffmmmffmmffffmfmmfmffmfmmmfmmfmmmfmfmmffmfffmmffmffmfmffffffffmfmmmfmffffmmmfffmmfmfmffmmffffmmfmmmmffffmmffmffffffffmmmfmmmffffffmffmffmmmfmmffmfmmfmfmfmmffffffmffmmmfmfmmffffffffmfmmfmmffmmfmmfmffmffffmmfmfmfffmffmmffmmffmmffmfmmfmffmfmmfmfmmmmffmffmffffmfmmmmmfffffmmmmmmfmmffmfmmfmmmfffmffmmmmfmffmfmmmmfmfffffmmfmmmmmffmmmmmfmfmffmmmfmmmfmffmmmfmmfmmmfmmmmfffffmfmffmmmmmmmfmfmffmfmfffmmmfmffmffmfffmmfmmmmmmmfmmmfffffmmmmmmffmmmmmffmmmmfmfffmfmfmfffmfmffmfmfmmmffffmmmmffmffmffmfmfmfffmmmmffmfmffffmfmffmfffmmmfmfmfmfffmmmmfffmffmfmffffffmfmfffffmmmmfmmmfffmmfffmfmmfffmfmfffmffmfmfffmmffmffmmmmmmmmmfmmmmmmffffmmmmfmmmmmfmfmmffffffmmfmmfmfffmfmmmmmmmmmmmffmfmffmfmmfmffffmfmmmfffmmmfmfffmmmfmffmfmmmfmmmmffffffmfmfmmmfmmmfmfmffmmfffmmfmffmmffmmmffmfmffffmffffmmfmfmffmffffmmmffmmmffmfmmmmmfmfmmfmfffmmffmmmmmmffmffmfmfmfffmmfmmffffmmmmffmmmffmfmffmmmmffmffffmmmmfmmfmmmfffmmffmffmfffmmfmmmmmffmmmffmfmfmmmmffffffmffmfmmmfmfmmmmffffffmfmfmmffmmmfffmfffmffmfmmmfmmfmfmmfmffffmmmmmmmmfmfmmmmmmffmffmfmmfmffmmmmfmmmmmfmmfmmfmfffmmmmmfmffmmfmfmfmffmfffmmfmfmmmfffmfmfmfffmfmfmfmfmmmffmffffffffffffmfmmfffmfmfmffmmmmmmmfffmmmffffmmmffmmmmffmmfmffmfffffmfmfffmfffmmmfmmmfmmffmmffmmffmffmmmmmmfmffffffmmmmfmmfmffmfmmmffffffmfmmmmfmmmfmmmmfmfmmmffffffmmmfmmfmmmffmfffmfffmfmmmmffffffmffmmffmmmmmmmmmfmfmffmfffffmmfmmfmmmfmfmffmmffffffmffmmmmmfmfmmffmmmmffffmmmfmffmffmmfmmfmmfmmmffmfmmmmmffmfmfmfffmmmfffmffmfmmmfmffmffmffmmfffmmfmmfmffffmmfmmfmmmffffffmmfffmfffffmfmfmffffmmfmffffmmfmmmmmfffffffmffffmfmmfmmmmfmffmmfmmmmfffmmfffmffffmmmmmmffmmmmmfmffmmmfmmmmffmmfmmfffmfmfmffmfmffffmfmfmmmmffmffffffffffmmmmfmfmfmfmfmfmfmfmmfmfffmmfffffmffffmfffffmfmffmffmffmmmmfmmmffmfmfmmmfffmfffffffmfmffmfmfmfmfmmffmmmffmffmmmmmmmfmffmmffmffffmfmmmffmfffmffffmmfmmfmfmmffmmfmmmffmmmffmfmmffmffmffmmfmmmfmffffffffffmffmmfmfffffmfmffmmfmfmmmfmfmfmmmmfmmmmfmfmfmfmffmmfmmfmfmmffmfmfmfmmmmffmfmfmfffmmmfffmfffmfmmmfffmffmmmmfffmfmmfmmmmffffmmmmfmfmfmmmffmmmfffmmmfmmmfmffmmfmffmmmmffmmffmfmmmfmmfmffmfmfmfmmfmfmffmmfmfmmfmmmfmfmffmfffmmfmffffmffmffmmmmmmffmmfmfmmffmfmfffmffmfffmffffmmmmfmfmffffmffffmfmmmmmmmffmmmfmfmmfmmffmffmmmfmmfffmmmmfmmmfmmfmmfmfmffmmmmmfmmfmmfffmfmfmfmfffmmmmffmmfmfffmfmmmffmmmmmfmmmffmfmffmfmfmmffmmmfmmmmmmfmfmmfffmfmfmmfmmmffmfmfmmfmfmffffffmmmmfffffmffffmffffmfffmmmmfmmffffmmfmmfmfmffffmffmmfmffmfmfffmmmmffmffmffmmmmmfmmfffmmmfffffmmmfffmmfmmffmfffffmfmfmmmmmmfmmmffmffmmmffmmfmmffmfffmmmfmmmmffmmmmfmfmmfmmmffmmmmmfmffmmffmfffmmmmfmfmfmfmfffmmfmmmffmfmmfffffmffmfffmmfffmfffffffffmmmffffmmmfmmmmmmmmmffmfmmmmfmmmfffffmffffmfmfmfmmffmmfmmmmmmfmmffmfmmmfmmfmfmmfffmffffffmmmfmfmmfmmmfmmfmmmffffmffffffmfmmmffffmmfmmffmfffmmmfmmfmmfmmffmmmmmfffmmffffmfmmmfmmffmfmffmfmffmmfmfmfmmfmfmfffmfmfffmmffmffmmfmmfmfmmffmfmmfmffmmmfffffmfmfmffmfmmfmmfffmmmmmmmfmmfmfffmfmfmmffffmmmfffffmmmmmmmfmfmfmmmffmmmmfmmmfmmmfmffmmfmmfmfmfmmmfmffffffffffffmffmffffffmfmmmfmmfmfmmmfmfmmmfmffmfmffmfmfmmmmmffmfmfmmfmmfmmfmmfffffmmmfmmmffffmmfmfffmfmmfffmmffmmffmffmmmfmffmmfffffmmmmfmfmfffmfffffmfmmmfmmmfmmfmfmfmfmmfmfmmmmfmfmmmmffmfmmmmmffmfmfmffffffmfffmfmmffffmmfffffmfmffmffmfmmmffmfmfmfmmfmmfffmmffmfmmfmmfmfmffmmmmfffffmmmmffmmfmfmffmfmmmmfffmfmfffmmmmmmfmfffmfmmmfmmmmmfmfmmmmmffffmfmfmmfmmmffffmmffmfmffmffmmffffmmfmmmfmfffffmfmffffffffmmfmmfmmmmmffmffmmfffffmmfmmmfmmffmfmmffmfmmmmffmmfmfmmfffmmmffmmmmmffmmffmmmmmfmffmmmmmmfmmmfmfmfmfmmffmffmfmmfffffffmmffmfmffmfffmmffmffmmfmffmffffmmmmfffffffmmfmffffmffmffmfmmfffmmffffffffmmffmmffmmfmfffmfmmmmmfmmmmmmmffmfmmmfffmmfmmfmffmffmffmfmmfmfmfmffmmmfffmffmffmmfmmmmfmmffffffmmfmffffffmmmmffmmfmfmfffmmmmmmmmmffffmffffmmffmfmmffmfffmfmffmfmmmmffffmmmmfmmffffffffffmmfmmmffmfmmmfmmmffffmfmffffmffmmfmfffffmffmmmmfmmffmmffmmmmmffmfmfmmffmffmmfmfmfmmmmfmfffmmfmmfmfmffmfffmffmmmmfmfmmffmfmfffmmmffmmffmfmfmfmfmfmmffmmmfmfmmmmmfmmmmmfmmfmfmffffmmmmfmmmmfmmfffmmfmffmmmffmmffffmfmffmffffffffffmmmffmfmmffmfmfmfmmfmfmmmfmfmmmmmfmfmmffmmffffmmffmfffffmfffffffmmmmmfmfmfmmffmffmmmffmmmfmmmfmfffmmfffmfffffffmmmmfmmfmmfmmfmfmmmfmmffffmmmffmmmmmfmmmfmfmffmmffmfmmfmffmfmfmmffmmfmffmfmmmfmffmfmmffmmfmmfmmfmfmfffmfffmmmmfmmmmffmmmmfmfmfmmfffmfffmmffffmfmmmffmmffmmmmfmmfmmmfmmmmfmmmffmfmmmmmfmfffmmmfmmmmfmmffmmmmffffmmmfffffmfmmffffmmmmmmfmffffmmffmffmmfmffmfmmmmmmfmmffmfffmmmmmmfmmffmffffmffffmmmmmmfmffmffmfmmfmffffffmffmmfffmmmmmmmmfmmmmmmmmmmmffffmmmffmmffmmmfffffmfmmmmmffmfmmffmmmmmfmmmmmfffffffmmffmmffmmfffffmfmfmmffffmfmmmfffmmffmffmffmmffmffffffmffffmfmfffmffmmfmmmffmfmffmmmfmfmfmmmffmmmmmmmmfmffffmmfmmmffmfmffmfmmmmmfmmmffmffmmfmfmfmffmfmfffmfffmmffmmffmmmfmmmmmmmffmmfffmfmfmmfmfmfmmmfmmmfffmmmmmfmfmmmmfmmmfmmfmfmmfmffmmmfmffmmffmmfmmfffmfmfmmmfffmffffmfmfmfffmmmmmfmmmfffmmmfmfmmmmmmffffmmmfmfmmffmffmffmmfffffmmfmfmmfmmmffffmfffmmfffffmmmmmmmmffmfmfmmmmfmmmfmfmmmmmffmmmmmffffffmfmfmmmmmfmfffmmfmffmmmmmfffffffmmmmfmmmffmmfmmmffmffmffmmffffmmmmfmmfmmfmfmmfmmmmfffmmfmmmmmmmffffffmmfmfmmmmmfmmffmfffffmmmmfmfmffmfmffffmmffmmffmffmfmmfffmmfmfmfmmmmfmmmfffffffmmfmffffmmfmmmmmmmmmfmmmmffmmfffmffffmmfmffffmfmmmmfffffmfmfmmmmfmfmfmmmfmmfmfmfmmmfmfmmmfffmfmffffmfmmmffmfmfffmfmmmmmmfffmmmfmmmffmmmmfmmmfmfmmfffmmfffmffmfmfmmffmmmmmffmffmfffmfmfmfmffffmfmmfmffffmmfmfffmmmmfmmmmffmmmmffffmmfmmmffmfmmmmffmmmmmfmffmmfmfmmfffmffmmfmmmffmmfmmmffmmfffmmmffmmffmmmffmfmmffmmmfmmffffmmmfffmmmffmmffmfffffmmmmffmfmfmmmmmffmmfffmmffmmffmfmmfmffffmffffmmffffmmmmmmmmmmmfffmfffffffmffmmffmmfmmmmmffmfmmmmmffffmmfffffmfffmfmfmmffffmffmmffmmfmmfffmfmfmfmffmffmmmmfmmmfffffmmfffmfmmmffmmmfmmfmffffmfmffmfmfmfmmmffmmmmmmmmffmfmmmfmffffmmfmffmfmfmfmfmfffffffmmmfmfffmmffmmmmffmffmmfmmffffmmmmmfffffmmmfffmffmmfmmfmmfmfmffffmmfmffmfmmmfffmmmmmmfmfmmfmffmmfmmmfmmmfmffmffmffmfmffffffmffffmffmfmmffmmfmffffmmmffmmmmmfmfmmfmmfmfmmmffmmmmffmfffmfmffmmmffmfffffmfmmmmmffmfffffmmmfmfmmmmmfmmmfffffmmmffmfmfmfmmffmmfmfmmmmmmmmmmmffmmmmfmmmmmfmmfmmfffmmfmmmmmmfmffffmfmmfmfmffmmfmfmfmmmffmfmmmmmmmmmfffmmffmffmmmmmmmmfffmmmfffmmfmmmmfmfmfmfmmffmmmmfmfffmmffmfmfmmmffffffmfffmmmfffmfmfmmfmmfmfmmfmfmmmfmffmffffmmfmmmffmmffmffmffffmffmmffmmmmffmffffmmmmffmffmfffffmmfmmfmffmmmfmffffmffmmffmfmfmfmmmffffmffmfmmmmmffmmfmmmfmffffmmmmmffmmmmmfffffmmfmfmmfmffffffffffmmmmfmfmmmmffmfmmmfmmfmffmfmmfmmmmmfmmmfmmmfmfmffmffmfffffffffmmmmmmmfffffmmfffmmmmmmmmmmmmmffmmmfmmmfmfmfmmmffmfmfmmffmffmfmmmmmfmffffmmfmmfmmfmfmmmffmfmmffffmmfmmmfmmmmffmmffmfffffffmffffmffmmmfffmfmmmfffffmmfmffffmmffmfmffmmmfmfmmffmmfmmfffffffmfmmfmmffffffmfmmfmmfmfmmmfmmmmfmmfmmmffmfmmmmfffffmmfmmmmmmmmmfmmfmffmmmffffmfmfffmffmmmmmfmfmfffffmffmffmmffmmfmfmmfmmmmmfmfffffmffmfmmffmmffmmmmmfmmmfmffmffmffmfffffffmfmmmfmfffmmmmmffmfmmfmmmmffffmffmmfmffmfmmmmmfmmmfffmmmmmmmfffmfmfffmmmffffmfmffmfmmffmmffmmfmmmffmfmmffmmfmffmfmmffffmfmfmfffmfffmfmffffmmffmmmmmfmffmmfffmmfmmfmmmfffmmfmfmfmmffmffmmmmfffffmfmffmfffmffmfmfmmmmfmfmmffmmfffmmmffffmfmmmfffmmfmmmmmmmfmmffmfmffffmmmffmfffmmffffmffffmffffmmmmmffmmfffmffmfmmmffmmmffffmmffmfmmmfffmfmmfffffffmffmfmmfmmmmmmfffmmmfmmfffffffmffmmffmfmffmfmffmfmfffffffffmmfmmfmmffmffmfmmfffffmmmmfmmmmfmffmmmfffffmmfffffmfmfmfmmffmfmffffmmfmmfffffmmmffffffffmmmfmfmmmfmmfmmmfmfmffmmmmmfmfmfmfmmmmmmmfffffffffmffmfmfmffffmmmffffmmfffmmmffffmmfmmmffmmmfffffmmfmmmmmmffffffffffffmmmmfmmmffmmmmmfmmmmmmfmffmffffmffmmmmffmfmmfmmfmffmfmmmffmffffmfmmfmmfmffmffmfmfmffmmmfffmfmffffmfmmmmffmfffmmffmmfmmmfffffmfmfmmffmmmfmmmfmmfffffmfffffffmmfmmmmmmmmfmffffmmmmmffffffmmmmffmffmmfffmmfmmfffmmmmmmmfmmmfmfmfmmfmffmffmffmmfmmfmffffmffmmmmfmfmfmmmffffmmfmfmfmfmfmmmffmffffmmffffmfmfmmffmffmmffmfffmmmffmmmmmfmmmmmfmmmffmfffmmfmmmmfffmfffffmfmfmffffmmfmfmfffmfmmmmmffmffmmmmffmmffffmmmmmffmfmffffmfmmmfffmmmmfffmmfffmmfmmfmmmmfffmffmmmmmmmffmffffmfmfmmmfffmfmffmmmmmmfmmffmfmffmmmmmmfmmmmfmffmmfmffmfmmfmfmmmmmffmmfmffmfffffffmffffmmffmffmfmmmmmffffffmfmmmffmfmfmmmmmmmfmfmmfffffffmfmffmfmmfffmmmfmmffmmmmmmfffmffmfmffmmffmffmmffmffmfmmmmmffmmmffmffmffmfmfmmmfffmmffmmmmmffmffmmmffmfffmffmfffmmmffmmmmmmffffffmmmfmmffmffmmffmffmfmfmmfmffmffmffmmffffmmffmmffffmfmfmfffffmmffmfmffffmffmfmfmfmfmfffmmmmffffffmmfmmmmmffmmmfffmmmffmmffmmmfmmffmfffmffmfmffmfmmmmfmmfmfmmmffmffmfffmmfffffffmmffffmffmmfffmfmfffmmmfffmffmfmmmfmmmmffffmmmmmfmffmffffmmmmmffffmfmmfffmffmmffffffffmmfmmmfmffmfffmfmmfmffffmfmmfffmfffmfmmfffmmfffmfmffmmfmmmfffffmfffmmffffmffmfmmmmfffmfmfmfmffmffmmmmfmmfmmmmfffmfffmmmffmmfmfmmmmffmmffmfffmfmfffmmmfmfffmmmfmmmmmmmmmfmfmmffmfmmmmfffmmfmfmmmmfffmmmmmmfmfffmmmmmfmmmfmmmffmmmfffffffmmmmmmfmmfmfmffmfffffffmmfmffmmmmmmfmfmmmfffmmffmmmmfmmmfmfmmffmfmfmffffmffmfmmmfmfmmmmmfmfffmmffmmmmmmmmmfmfmmfffmmmmffffmffmmfmmmmfffffmmmffmmmfffffmfmmmfmffffffmmmfmmfmffffmmfmmmmmfmmmffmmfffmffffmfffffmfmfmmfmfmfffffmmffmfffmffmmffffmfmmmmmfmffmmfmffffmfmmfffmfmfmfmfmmfmmfmmmffmfffffmfffffmmmfmmfffmfmmfffffmmfmffmfffmfmfmffmmfmfmmmmfmmmfffmfmmmfmfffmfmmmffmffffmfffmmfmmmmmfmmfmmfffffffmfffmfmfmffffmfmffmfffmmfmmmmmfmmmfmffffffmfmfmffmmffmfffmmfmfmmmfmmfffmmmmfmmfmmmfmfmffmmmmffffffmmmffffmfmffmmfmfmmfmmmmffmffmfmmfffmfffmmfffffmmfmfmfmmfmmmmmmmfffmfmmmfffmmmmffmmfmmfmfmffmffmfmmmfmfmmmmfmmmffmmfmmfmffmfmffmffmffmmfffmfffmmmfmmmmmmffmfffmfmmmmffffmffmffffmfffmfffmffffmfmmffmmfmfffmmfmffmfmfmmmffmfmmmmmfmffmffmfmmfmfmmfmmfmmmffmfmfffmffmmffmmfffmmfmffmmmffmffmfffmfffmffmfmffffmmmmmmffffmmfmmfmmmfmmmfmmmfmfffmmffffmmmfmmffmfmmfmfmfmfffmmmfmmmmmffmffmfffmmffmffmmmmmfmffmfmmmfffmfffmfmfmmfffffmffmfffmfmmmfmmmmmfmffffmfmmffmfffmmfmffffmmfmfmfmfmfmmmmffmmmmfmmfmmmfmmfmmffmfffmmffmfmffmmffmmmmmmfmfmmffffmmffmfmmfmmmmffmmmfmfmmmfffffmmffmfmffmfffmmffmmmffffmfmfmmfmfffffmfmfmmfmmmfmmmfmfmmffffmmmfmffffmfmmffmmmmmmfffmfffmfmfmfmfmfmmffmfffffmmmfmfmfffmmfmfmfffmmmfmfmmffmmmmffmffmmffmfmfmmffmmmmfmfmmfffffmfmffmmmfffmmfmffmmmmmmffffmffffffmffmmfmfmfffmmmmmmffmffmfmmmmmmfffmmmmmmfmmfmmmfmfmffmffmfmmmffffmmmffmfmmmmmffmmmfmmmmmfmfmmfmfmmfmmfmmfffmfffmfmmfmmmmfmmfmmmfffmfffmfmmfmmffffmmmffmmmfmfmmmffffmmffffmfmmmmfffmfmffmmffmmfmmmfmfmfmmffmmmmmfmmfmfffmmfmfmmmmmmfmmfmfmfmffmmmmfmfmmmmfmmmmmfmmmmmmfmffmfmmmfmfmmmfffmfmmmfmmmfffmmffmmfmmfmffmmmmmfmmmffmfmfmfmfmffmmffmfffmmmfmfffmffmmmfmmmfmmmfmfmmmffmmmmfmfmffmffmfmmfmmfffmfffmfffmmfmffmfmmmfmmffmmfmmfmmmmmmmmfffmmffffmffmmfmmmmffmffffmmfmmmmffffffffffmmmfmfmmfmmffmmmffmmfmfmfmfmfffmfmmmfmmmfmffffffmffmmfffmfmmfmmffmmmfmffmfmfmmmmmffffmfmfffffmmffmmmmmfmffffmfmfffmfmmfffmfmffmmmmfffmffmfmffffffmfffmmmmmfmmmffmmfffmmmfmmfmmmmfffmmmffmmffffffffffmffmffmfmmmmmmmmfmmmmfmfmfmmffmfmmfmmmmmfmfmmffffffmffmffffmfmmfmffmffmmmfffffmmmffffmmmfmfmmffffmfmfffmffmfmffmffmfffmmmfmmmffffmmfmmmmmffmmfffmfffffmfffmmmmffmmmfmffmmffffffffffmfmmmffmmmfmmfmffffmmmfmffmmfmfmmmmmmmffmmffmfmmmmmmmmffmfmmfffmmfmmfmffmmmmfmfmmmmfmmffmfmffmfmmmfffmmmfmmfmfmffffmfmfmmmfffmmfmffffmmffmffmmfmmmmmfmmmffffffmfmmffmfmfffmmffmmmmmfmmmmfmmmfmmmmfffmmfmmfmfffmmffmffffmmffmmfmfmmfffmfmmmffffmfffmfffmmfmffmmmfffmfmmmmffmmmfmmffmmmmmmffmmmfmmffffmffffffmmfmfmffmfffmmmmmfmmmmfmffmfffmmmmmffmfffffmmffmfffmmfffmffmfmffmmfmmfffmmmffmffmmffmfmmmfmmfffmmmmfmmfmmmfmffffffmfmmmfmmmmfmmfmffmmffmffmmfffmmfffmffmmmfmmfmfmmfffmmffmfmmfffmmmmmfmmmfmffffmmmfmffmffmffmfmfmmfmmfmffmmmmmmffffffmmfmffffffmmfmffmffmmfmffmmfffmmffmmmmmfmmmmmffmfffmffmfmfffmmmfffffmmmfffmmmmffmfmffffffmmmffmffmmmffmmmffmmmmmmmmffmmfmffmfmmffffmfffmfmfmmfmmfmfmmmfffmmfmfmffmffmffmmfmfmmmfmfmfmfmmmfmmmffmmfmffmmffffffmfmfmmfffmfmmfmmfmmfmfffmffmmfmfffmmmfmmffmffffffffmffmmffmfmmfffmfmfmfmmmfmffffffmfmmmfmmmfmmfmmmfmmffffmfmmmmfmmmfmmffmfmffmmmfmfffmmfmfffmmfffmfmfmmmfmfffmmfffmfmmmfffmfmmffmmmfmmmmmfmmmfmmmfmmmmfmfffffffmffmfmmfffmfmfmfffffmmmmmmmffffffffmmfmfmmfmffffffmmmmmmffmfffmfffmfmfmfmfmmmmmffmmmfmffmffffmmmfffmmfmmfmmfmmmfmmfffmmmmmmffmmmmffffffmmffmfmmfffmffmmmfmfmfffmfmmfffffmffffffmfmfffmmffmffmfffmfmmmffmfmfmffmffmmffmfffffmmfffmmmmffmmfmmfmmmmffffffmmffmmmmfmfffmffmfmmmmmfmffmmffmffmmfffmffffffmmffffmfffmmmmfffffffffffmfmffmfmmmfffmfmmmfmfffmfmmmmffmmffmfffmmfmmmmmmmfmmfmmmmmffffmmmfmmffmmfmmffmffmmmfmfffmmmfmfmmmmfmmmfffffffmfmmffffmmmmffffmffmmmmfmfmmmmmmmmffmfmfffmffmfmmmfmmmmmmfmmfmmffmmmmffmmfffmffmmmffmfffffmmfffmffmmmmmffmmmfmmmffmfmmmffmffmfmfmmmmmmmfmffffmfmffmmmmmfmmmmffmmfmmfmfmmmfmfmfmmmfffmfmfffffffffffmmfmfmfmfmfmfffmmfmffffmmmmmmmmmffmmmfmmmfmffffmfmffmmmmmmmfmmfmmmffmmmmfmfmffmfmfffffmfmfmmffmffmmmmmfffffffmmmffmmfmmmmmmfffffmmmfmfffmffmfmmmmmffmffmmmmfmfffmmmmmmmmmfffmfmffmffmffmffmffmffmmmmfmffmffffmffffmfmfmfffmffmmfmfmmfffmffmmmfmfmmfmfffmfmmfmmmfmmfmffmmfmffffmmfmffffffmffmfmffmffmmmfmfffmffmmffmmfmmfmffffmffmmfmmfffmmmffmfmmmmfffmmffffmffmmmmmffmmffmmffmmmffffmmmmfmfmmmmffmmmmmmfmfffffmfmmmmffmmfmmfmmmfmfffffmffmmmfmfmfmffffffmffmmffmmmfmfmmfmmmffmmmmffmffffmmmmfmfffmmfmmmmmffmfffmfmmfffffmfffmmmffffmmffmffffmmmmffmmffmmmmfmffmmfffffmmmffffmmmmmmmfmmfmfffmfmmmmfmfmmfmfmmfmfmfmfmmffffmmffmffmmmmfmfmmmmmfffmfmmmmmmfmmfffmmfffmmfffmfmfmfffmfffmfffffmfmmmfffmfffmmfmfmfmmmffffmfffmffmfffmmmmmfmmfmmmmfffmmffmmfffmfffmfffmffmfmffmfmfmmffffmffmfffffffmfffffffmfffffmmfmmmfmmfmffmfmmfffmfmfffffffmffmfmfmfffffmmmfmmfffmfmmfmffffffmffffmmfmmmfffffmfmmmmmmmfmfmmfmmffmfmmffmmmmmfmmfmfffffmfffmmmmmffmmmmmmffffmffmmfffmfmffmfmffmmmmmfmfmmmmmfmmmmfmmffffmmffmmmmmmfmfmfmffffffffmmmmffffmfmmmffmmffmfmmmfmmmfmmmmffffmfffmfmmfmfmffffmfmffffffffffmmffmffmmmmffmmfmfffmmmmmfmfffffmmfmffffmmmmmffmffmmfmmffffmfmffffffmffffmffmmfmmmmfmmmfffmmffmfffmmffmfmmfffmmmfmmffffmmffmffmmmfmffffmmmfffmfmfffmmfffmmffmmfffmfmffmmfmfffmfmfmfmmmmfmfffmmmmfmmmfmffffffmmmmfmmmffmmfmffmmffmmmfffmmfffmmmmmffffmfmmfffffmfffmfmmmfmmfffmmmmmfffmmfmmfmffmffmmmmffmfmffmmmffffmmffffffffmmmffmfffffmffmfmfffmfmfffffffmffmffmmmfffffffmfmfmfffmfmffmmffffmfmfmmmmffmffmmmmffffmmfmfmfmmmmfmmmfmffffmmfffmffffffmfffmmffmmffmmfffmmfmfmffffmfffmmmmfffmmfmffffmfmmmmfmmmmfmfffmmffmfmfffmfmmfmfmffmfmfmmmmmmfmfmfffmffffmfmmmffmfffmmfmmmfmfmfmfmmmmmmfffmfmfmmmmfffmmmfffffmmfmfmfmmmffmffmffffmmmfmfmffmffmffffmmmfffffmffmmmfmmffffmfmfmmmfmmmmmmmfmmmfmmmffmmffffmmmffffmffmmmmfmffffmfmmfffmmmfmmfmmfffmfffmmfmfmmmmfmmfmffmmmmfmffmmmfmfmmfmfmfmmmfmfffffmmfmfffffmfffmmmmfmmffffffmffmmffmffmmffffmmmffmfffmffmffmmmffffmfffffmfmmmfmfmmfffmmfmffmmfmfmfffmmfmmfmmfffmfffffffffmmmmfmmffmfmfmfmfmmmfmffmmmmfffmmmffmfmmmfffffffffmffmffmmfmfmfffffmmmmmmmmmmffmmfmmffmfmfmfffmmmmfffmfffmfmmmffmmfmmffffmffffmmmmfmmffmmfffmmfmmfmmfffmmffffmmmfffmmfmfmffmfmmmmmffmmmffffmfmffffffmmfmffmfffffmfmffmmmmffmfffmfffmmfffmmmmmffmmmmmmmffmmfmmmmmmmfmmfmmfmmmfmmmmffmfmmfffmfmmfmmmmfffmfmmfmmfmfmmmmmmmfmfffmffmffmfffmfmmfmmffffmmfmfffmfmmmmmfmmfffffmmmmmmmmffffffmmfffffmfmfmmmmfmfffmmffmmffmffffmmfffmfmfmffmmmmmmfmmmmmfmmffffmfffmffmfmffffffmffmmffmfffmmmfmmfmmffmmmmfffmmfffmmfmmmfffffmmmmmfmmffffmmmmfmffmfmffmmmmffmfffffffffmffmfmmmfmmmmfmmmmfmmffmfmmfffffmmmmmffffmmmmffmfffmfmffmmmmffmffffffmmmfmmffmffmmmmmmmfmfmffmffmfmffmmfffffmfmmmfmmfmffffmfmffmmmffffffmfmmffffmmmffffmmffffmmffffmmffmfmffmmmmmmfmmfmfmmfmmfmmfmfmfffmffmffffffmfffmmffmmfffmmmfmffmmmfmmmmmfmfmmmfmffmmfmfmfffmmmfmmfmffmffffmmffmmmffmfmfffffffffffffmmmfmmfffmmmfmfmmmfffmffmfmmmmfmfmfmfmmffmfmffmffmmfmmmfmffmmmffmfffmffmfmfmfmfmmmfmmmmffmmfffffmfmmmffmmmmmmmmfffmfmffmmmfmfffffmffffmmmmmmmfffmffmfmmmfmfmffffmfmmfmmfffmmfffmmfmfffmmmfmfmmffmfmffmffmmfmfmmmmfffmmfmmffmmmmmffmmmfmmmmfffffmmffffmffmmfffmmmffmmmmmffmmmmfffmmmfmmfmfmmmmmfmffmffmffffffmmmfmffffmmmfmmmmmmffmfmmfmmfmfmmfmfmmmmmmmmmfmmffmffmmfmmmmmfmmffmfmfffffffmfmmfmfmfmfmfffmmmfffmfffmmmmfmfmffmffmfffmfmmfffmmmmmffffffmfmfffmmmmffffmmffffmmfmmmmfmmmfmmfmffmmmmmmmmmfmmffmmffmmfffmmfmmfmffmmfmfmmmfffffffmfffmmmffffmfffffffmmmmmmmmmffffffffmmmmfmffmmmffmfmmffffmffmfmfmfffmmmmffmfmmffmfmfffffmmmfmffffffmmfmmmmffffmfmmffmmmmfmfmmmmmmffmfmmfmmmmfmffmmfffmffmmmmfmffmffffmfffmfmmmmmmfmmmmmmmffmfmffmmfffmmmmffffffmmmmmmfmffmmffmffmmmffmmfmffmfmfffmmfmfmmmfmffmfmmfmmfmfffmffffmmmffmmfmfmmfffmfffmmmfffmfmfffmfmmffmmfmmfmmffmfmfmfmfmmffmmffmff\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 439,
        "task_id": 4108,
        "test_case_id": 21,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "kkakkaaaakkaakaakakaaaaaakkaakakakaakaakakaaaakkkakkkakaakkakaaakkakkkaakkkaaaaakaaakkkakkkaaaakakkaakaaakaaakkaaaakaaakkkakkkakkkaaaakkkaakaaakakakakaaaaaaakkkkakaaaaaaaaaakakkakkaakkakkkaakkkkkakkkkkkakkkakakkkkakakakaaaakkakaakkakkaaakaaaaaakaakakaaaaaaaakkakkakakaakaakakaaakkkkakkakaakkkakkaaakakkkkkkkkkaakakakkakakkkkaakaaaaakaakkaakkkkkakaaakkkkaaakaaakaaakakaaaaaaakaakaaaakaaakaakakakkkakaaaaaaakkkaakkkkkaakakkkkakakaakaakkkaaakaakaakaaaaaakaakkkkkkkakaaakakakkkakkkakkakaakaaakaakaaaaaaakaaaaaakkkaakkaaakaaakkaakaakkkkkaakakkakkaaakaakkaaakkkakaaakkkaaaaakkakakakaaaakkaaakaakkkkkkaakkkaakakkkaaaakaakkaakkkkaakaaakkakkaakaaaaakkakkaakkakkkkaaaaakakkaaakaakaakakkaakakkkaaakakkkkkakkkkakkkkakakkkkakaakkkakaaakkkakakaakkkaakakakkaaakkkaakkkkakaaakaakaakkkakkaakkaakakkaaakkkakakkkkkaakkaakkkakkaaaaakaakkkkkaaakkkkakkakkkkakaaakaakaakakkaakkakkkkaaaaaakaakaaaakkkakakkkaakakaaakkkkkaaakkakkkkkaakakkaaaakkkkkkaaaakkaaakkkaaaaakkakkkkkakakakkkkakakakakaakkakaaakkkaakakaakakaaakkaaaakaakakakkkkkakkaaaaakkaaaakaaaaaakakakakkkkkakkkkkakaaakkkkkkkaakkakaaaakakakkkkaaaaakakkkakaaaaaaakaaakkaakakkakkkakkakaaakakakkakkakaakakaakkakkaakkaaakkkkkaakkaakaaaaaakkaaaakkkakkkkkaakkkkkakkakkakkkkkkakakaakkakakaakkakkkkkkkaaaakkaakkkkaaaakkkkkkkkkkkkkaakkaakakakkakaakakaakkkkakkkakkaakkkkaakkkakakaakaaakkaakaakkkkaakkkkakaakakkaakkaaakaaaakakakkaaakkkakkkkaaakkaakaakkkakaaakkakakkaaaaaakkakkaaakaakaaakakkkakkkaakaakkaakakkkakkkkaakkakaakkaaakakkkakakakkkaaaaaakkakkkkakaaakakkakaaaakkkkaakkkkkkaakaaakaakaakaakakkkaaaaakkkakakakkakaaaakaaaaaaakkkakkkaaakaaaaakakkakaakakakkkakakakaaakaaaaakakkakaaaakakaaakkakkaakkkakaaaaakkkkkkkkkaaaakakakkkaaakaakaakkkakakaakkakkkkkkakkkakaakkaaakaaakkaaakaakaaaakaaaakkakakaakaaakakaaakkkakkkakkkkkakakkaaakakkaaaakakakkkkkaaakaakakkaakaakaakkkaaakkakakkaaakaaakkakakkkaakkakkkaaaaakakkaaakaakakkaakaaakaaakkkkkkkakkkkkaakaakaaakaaaakkaaakaaakaaaakaakakkkakkkkkaakkaaaakkakkaakakaakakaaakkakkakakkkakakakkaaakkaakakaakaaakakakkkkaaakakakkkakaaakaakkaakkkakakkkaakkkkakkkaakkakaaakkkkaakaakaaaakkkakakkkkkakakaaaakkkakkaakkkakaakkakkkkakkaaaaaaakaaakkkkakkkaakkkakkakaaaaakaaaaaakakaakakaaakkkaakkkaaakkkkkkakkkakkakakaaakkkkakakakakakaaaakkakakkaaakaaakkaakkkakakkaakakkaakaaaakaaakkakakkkakkkaakakkaakakkkakaaaakakaaakaaakkkkaaaakkkakkaaakkaaakaaaakaakkaakkaakkkkkakaaakakaakakkkkakaakaaakkkakkakkkakakaakkaakkaaaaakaaakakakkkkkkkakakkakakakakakkakkaakakkakaaaaakaaakaakkkkakakkakkakkkkkkakakkakkakakkaakaaakkkkkakaakakkaaaaaaaakkkkaaaakkaaakakkakaaakkkaakakkaakaaakakakkaakkaakaaakkkkaaakakakakkaakkkakkkakkkkkaaaaaaakakaaakakaaaaakkakkkkakakaaakaaaaaaaaakkkaakkakkkkaakakakkaaakaakkaaakkakakkaakaaaakkkkaaakakkakakkkkkkkkakakkkaaakkkkkkakaakaaaaaaakaakaaaakkaakaakakaakkkaaakkakkkaaakkkakkakkkaakkakaaaakaaakaakakkkkaakkkkakkakakaaakaaakakkaaaakkkkkkkkkkkaakkaakkkkkakkkkkkkakakaakakaaakkkakkakkkkkakakakakkkakakkakakaakakaaaakkkakakaakkakaaaaakkakaaaakaaaaakkkkkakakaaaaakkakaakaaakaaakkkakkkaakakkkakkkkakaaaaakkkaaaakkaaaakkkakaaaaaaakkakakkkaakaaakaakkkkkaakkaakakkkkaakkkakkkaakaakaakkkkakaaakkkkkakaakkaakakkkakaaaakkakkkakkkkakkkkakkkaakaakkkkkkaakkaakakkakakkakkkaaaakkkakkakkaakkkkkakkakakkkakkkkaaaaaaakakkakakaakkakkkkakaakaaaaaakakaaaaakkkkaaaaaaaakkaakakkakkakaakaaakaaaakaakkkkkakkaaakkaaakkaaakkkakakkaakkkakkkaaakkakakkkkakakkakaakaaakkaaaakakaaaakkaaaakkkaaaakakkaaakaaaakakkakakkaakaakaakkakakakkakkaaaaaaaakaaaaakkkakakkakkaaaaakaakakkakakkkkaaakaaaaakaaaaaakaaaaakkakaakaakaaaaakakaaaakkakkakkkkaakkkkkkkkkkaaaaakaakkkakkkkakaakaaakaaakkaakaaaaakkaaaakkkaakakaakkkkkakkkkkaakaaakkkakakkkaakkkkkaaaakkkaaaakkkkkakkkkkakkaakkkkkaaakkkaaakkakakaaakkakkakakkkkaakkakaakakkakakkkkakaakakaaakakkaaaaaaaaaaakkaakkaakkkkkakkaakakkakkakkkaaakakaakakkaakkakakaakaaakkkakkkaakaaakkkaakkkkkakkkkaakkkakaakakkkaaaakakkkaakkkkkkakakakkakakkakkkkkkakaakakkaakkaakkkkkkkkaaaaakkkkakakakaaaakkaaaakkkaakkkaakkaakaaaakaaaaakkkkaaakkkkaakkkakkkkakakakaaakkakkaakkkakaaaaakakaakakakakakkkkkkakkakkakkkakkaaaaaakakkakkaaaakakkkkaakkaaaakakaakaaaakkakakaaakakkakkkaaakkaakkkkaaakaakkakkaaaakakaaakaaakaakakakkkaakaaaaakkkakkkakakkkkaaaakaakkkkkaakaakkkaaakkakaakkaaakakkkakakaakkaaaaaaakkkakaaakakkakkkakaakaakkkkakkaaakaakkakkakakakakkakkaakkaaaaaakkakkkaaakaakkakaaakkakaaakkaakkakkakakkaaakaakaaaaakkakkkkakakkkkakakakakkaaakkkaaakaaaaaakaakakkkaaaaaaakaaaaakakkkkkkkkakkakkkkaakkkaakkaakakakakaaaaakakakakkaaakkkkkkaaaakkkaakkakaaakkkakkkkaakkakakkakkkkkkakaaaaakakkkakkaakkkakkkkkaakkaakakaaaakkakakkakkaakkkaakkkkakakkkkkakakakkaakkkaakaaakaakakaaakaakaakkakaakaaaakaakkkkkaaakkakkkkkkaaakkaakakakakkakakakkakakkkkkkakkkakkkaaaakakakkkaaakakakaaakaaakkakkkakaaakkakkaakkkaakakakkkkkaaakkakkkaakkakkakkkakkkakkakakkaaaaaaaakaaaaakaaakkakakaakkakaaaaakaaaakkkaakkakkakkkaakaakkkaakkkakakkaaakkaaakkkkaakakaakakkakakakakkkkaakkkkakkakkkkakakkkakakaaakkkakakaaaakkkkkkaakkakkakakaakaakkkkkkaakaakaakkaakakakakakkkaakaaakkaakkaaaakkakkakkkkkaakkkaakkaakaaakkkkkakkaakakaakaakakkkaaakakkkkakkkaakakkkaakkaakkkkkakakkaakkkakaakakaaaaaakkkkkkkkakakkakkaaakakakkkkaaakakkakakaakakkaakaakaakakaaakkakakkkkkkkkkaaaakaaaaakkaaaakaakaakkkkkaaaaakaakkaaakakkkakkakakkkaakakkakkakaaakkkakakkkakkakakkkaaakkkkakkakaaakkaaakkkakaaaaaakakkakkkkkkakkkkakakaakkakkaakkkkakakaaakkakakkkkkkaaaakkkaaaaakkaaakkaakkakaakakkaakkaaakakkkkkakkkkaakkakakkaakakaakkkaaaakakkkkkkkkaaakakkkkakkkakakakkakaakkakaakkakaakakkaakakakaakkkakkakkkaaaakkkkkaakkkkkakkkaakkakaaakakkakkkaaakaakkaaakkakaakkaaaaaakkkkaakkaakaaakakkkkkkkakaakaaakakkkkkaakkkaakaaaaaaaakkkkaakakakkaakkkakkkakakaaaakaaaaaakakaakkaakakaaaaakkaakaakaakakkkkkakakkkkkakkakakaakkkaaaaakkaakakaakkkaaakakaakakakkaaakaaakkaaaakkkkakaakakkaakkkakakaaakakkkakakakkakkaakkaakkakakkkkaaaakkkkkkkakakkkkkakkaakakkakaaaakakakkkakkaakkkkaaakaakkkaakakakakaaaakkkakaakkakkkaaaakakkkkkkaakkkakakaaakaaakkkaakaaakaakkakkaaaakakkkakaakkkkkkaaakkaaaakaakaaakaaakakkaaaaakakkkkaakakkakakakakaakkkaaaakkaaakkkaakkakaakkkkkaakaaakaakkkkakkkakkkkakaakakkakaakaakkkkkakkkaakkkkkkakakakkkkkakkkaakkkakkkkkaakkakkkakkkakaaakkakkkkkakkkkaakkakaakkaaakakkakaaaakkakkkaaakakaaaaaaakkakkaakakkkaaakakaakkkakkakkkkkkakkkkaakkaakkaakaaaaaaaakkakaaakaakaaaaakaakakaaaakkkakakaaaaaakakaaaaaakakkakkkakakkakkkaaaakakakkkkakakakkkakkakkaakaakaakkkaaaaaakaaakakakkkkkaakkkaaakakaaakkakkakakakakaaakakkkkakakkakaakaaakaaakakkaaaaakkakakkkkakkkkkkakkaakkkkaakkkakaaakaakkakkakaaakkaaaakkaaaakaakkaakakakakkkakkakakkakkakakaakaaakakkkakkkakkaakkaakkakakakkkkkakkaakaaakkkkaaakaakaaakkkakkkkaaaakkaakkkkakkaakkkkkkakaaakkkkkaaaaaaakaaakkkaakaakkaaaaakaaakaaakkakkaaakkakaaakkkakkkkkakakkakkaakkkkaaakakkkkaaaakaakakakkakakkakaakaakkkaaaaakaakaakkkkaakkkakaakkaaakkkakkkakkakaaakkaaakaakkaakaaakkaakakkakkkakaaakakaaaakkakaaakakkaaaaakkaakkakakakaakaakkaaakakkaaaaaakkakakaakkkkkaaaaakkaakkaaaakakkaaaakkkkkakaaakaaakakaakaakkkakkkkaaakakakaakkkkaaaakkkaaakkkkaakaakaakkkakkakkakkaaaakaakkaaakkkakaakkkaaaakakkaakakkakakaakkaakkaaaakkakaakakkkakkkaakkaakkakakkkakakaakkkkkaaaaakaaaaakkkkakakkkkkakkaaakakkaakaaaakkkkakaakaaakaaakaaaaaakaaakkkaakaaaakaakakaaaaaakakaakkkkaaakkaaaaakaakakakkkkakkkakkaakkakakkkkkaakaakakakkkkkakakakkkaakakkakkkakakaakakaakkaakkkkkkaakkakkkaakakakkkaakakkkkakkakakkkkaakkkaaakakaakakkaaaakaakakakakkaaaaakakakkakakkaaakaaakkkkkkaaakaakakkakkkaaakkkakakaaakkkaaakkkkkaakkkaaaaaaakkkkkkakkkaaaakkkkkakkaaaaaakakaakakkakakakakkkaaaakkkakaakaaakkkakakaakkkakkkaakaakkakkaakakkaaaaakkakkkaakkakaakkkkkaaaaaaakkkkaaakaakkakaaaaakakkaakakkakkakakaakaakkaakaaaakkkkkaakakaaakkaaaaaaakkkaaaaaakakkkakakkakkkkkaaakkakakkaaaaakkkkkakkakkakkakkkakakakkkakkkkaaaakkkaaakakaaaaakkkkaaakakakaakkaaakakakakkakakkakakakakaaaakkaakkkakkaakkkakaakaakakkakkaaakakaakakkkakaakkaakaakaakakkaakkakakkaaakkaakaakakakkkakkakkaakkakakkakkkkkakaaaaaaakaakkkaaaaakkkaakkkkkaaakkkkkkakkaaakkkkaakkkaaakakakkkakkakkkakkkakakaaakkaaaakkaakaakakaaaaakkkkkakkaaaaaakkkakkakkkakakaakaakaakkakaakkakaaakakkkkkaaakaakakkkkakkaaaakakakkkkkaaaaakaaakakaaaaakkkaakkkakkakkkakaakakaakakkkkkkkkakakkkakkakaaakakaaaakaaakakkkakaakakaaakakakkaakkaakakkkkakkkaaakaakkaakaaaaaakaaaakkkkkkkkkkkaaakkakkkkaaakaaakkakakaaaakkaakkaakkkaaaakakkkkkkkkkkkakakkaakaaakaaaakkkakkaakaakaakaakkaakkaaakkakaaaaakaaakaaakkkakkakkaaakaaaakaaakaaaaakakkakakakaaaakkaaakkakkakkaaaakkaakkaaaaaaakakkkaaakkakaakaaakkaaaakkaakkakaaakkakaaakkkkkkaakkkaaaaaaakakkkkakakakaaakkaaakaakkaakkaaaaakakkaaakkakkaaaakkkkkaakaaakkkkkakkaaakakkkkkaaaaaaaakaakaakaakkkkkkakakaaakkkkakkakaaakakaakkaakakakakaaakkakkakkkaakakkkaaaaaaaaaaaaaakaaaaakkakkaaakaakakaaakkakkkkaakakkkakaakkaaaaaakkakakaakakakaaaakaaaakkakaaakakaakaakkkkkaakaakkkkkaaakkaakaakkkkaaaaakakaaakaaakkaakaaakkakakaaaakkkakkkkaakkkkaaakkakkaaaakaakaakakakkkakkaakkakaaaaaakkkkkkkkaaakaakakkkakakakkakaaaakakaakaaakaaakaaakaakkkakkkkakkaaakaaaaaakkaaakakakkakakaaaaaakaaakkkakkkakkkkakaakkakakakkakkakkaakakkkakkkkakkakaakkkaakakkaaakakaakkakkaaakkakkaakaakaakkaakkakaakakkakaakkkkkakkakaaaakaakaakakkkkaaakkkkkkkkkkkkaakkakkkakkakkakakakkaaakkaaaakakakaakakakkaaakkkaaakaaaaaaaakakaakkkakkakkaaakakkaaakkaakakkaakaakkaakkkkkaakkkkkaakkkkkaaakkakakkkkkkaakaaakkakkkkakkkkkkaakakkaakakkaakkaaakkkkkakakaakaaakaakkkkaaakkaakkkkkakkakaakakkkkkkaakakaaakkkkaaaaakaakkkkkakaaakakkaaaaakakaaakakkaakkkaaaakaakakaaakkaakaaaakaaakkakkaakkaaakkkaaaakakkaaaaakaaakkkkaakkakkaakaaaakkakkaakaakaaaakaaakkkkaaakkaakaaakaaakaakkakakkaakkkkkkkkakkaaakkkaaakakkakkakaakaaakkkkaakkaaaakakkaakkaakakaakakaaakkkkaakkkkkkakkkakaakaakakkkkakkkkkaakaaaakakkkakkakkkkaaaakkaaaakaaaaakkakaaakkkakkakkaaakkkaakkkaakakaakkakaakkakkaakkkkkkkkkkaakaaaaaakaaakakkkkkaakkakakaakakkaakaaaakaaaakaaakaaaakkaaakkkkkaakaaaaakkkakakakaakkkkaaaaakkkkakaaaakkaaaakakkkakakaaakakkaakkkkkakakkkakkkaakkkkkakkkakkkakakkkaaaaaaaaakkakakkaakkaakaakaakaaaakkkkkkkaakaaakaaakakaakakkkkkaaakkakkaaaaaakaaaakakaaaaakakaakkaakkakaaakkkkakaakakakaaaakkakaaakkaaaakkkaakkaakaakaaaakkakakkakkkaakkakkkkkkkkkakaaaaaaakkkkkkaakakkkkakakaakaakkkkkkakkkakkakkaaakaaaaaakkakkaaaaakakakkkakakaakaakkakaakakkakkkakkkkaakakaaaakakkaaakkkkkkkkkkkaakaaakkkakkaakaakkaakakkakakkkaaaaaaakakaaakaaakakakkaaaakkkkkaakkakakkkakkaakakakakkakkaaakakakkaakaaakakaakkaaakaaaaaaaakaakkaakkkkkakakkaakkakaaakaaakkkkkakkakkaakkakkkkkakaaakkaaakkkkakkaakaaaaakkakkaakakakakkkakaakkakkkakkkkaaakakaakaaaaakkaaakakaaakkkkkakaakakakaakakakkkkkakaaaaaakkkakkkkkaaakakkakakkkkakkaaaaaaakaakkkakakkkaakkkkkaaakakkakkaaakkakaakkakkakkkkkakkaaakkkkkkkkkkkkkkkakakaaakakkaaakkakkakaakkakaakakaakkaakkakakaaakkaaaakkkakaaaakaakkkaaakkkkaakaaaakkaakakkkaakkaaaaaaaakkaakkkakakakkakkkkaakaaakkakkkaaakkaaakaakakkkkkakakkkkakkkakaakaakaaaakkakkakkkakaakkkkakkkakaaakkaakakakkakakkaaakkakakkkkaakkakkaaakkaakakaaakaaakkakkkakkaakkkkkkkakkaakakkkakkaakkakaakkakkkkakaakakkkkaaaaakkkkkkakakkkaakaakakaakkkaaakakaaaaaaaakaaakaaaaaakaaakkkkakkakkaaakkaakkakkkaakkkkaaakaaaakkaakakakkaaakkaaaakkakkkkaakkaaakaaaakkkaakkakkkkaakakaakaaaaakkkakkkkakakaaakkaakakakkaakakkakkkkkkakaaaakkkkkaaakakkkaaaakakaaaaaakakaakakkakaakkaaaakkkkkakaakkkaakkkkaakakkaaakaakkakkkkaakaakaaaakaaakkkaaaaaakkaakkaakaakaakakkkkakkaakkkakaaaaakkkakakkkkakakkaakakaaakakaakakkkkkkkaakkaakakaakkaakkakkakakaakkkakkkkkakakakaaakaakkakkkakaaakkkkakkakaaaaakkakaakaakkkkaaakaaaaakkakkkakkkaakkkaaaakakaakkaaaaaaakakakaaaakkakkkkkaaakaaaakakkkkkaakkaakaaakkkkakkakaakaaaakaakkkkkkaaakakkkakakkkakkkkkakkaaaakkakaaakkakkkakaakakaaaaaaakkkaaakaaakaakakkkkaaakaaaakkkakkkkaakkkkkkkkkakkakkakakkaakakkakakaaaakakakaakakaakakkakkkkkakaaaaakkkaaaaaaaakakaakaaaakkkkakakakkaaaaaakaakkakkkaaakkaaakkaaaakkakaakaaakakkkaaaakkakakkakkaakkkkaakaaakkaakakakaaaakkkkkakkkaaaaaakkkkakkaaakakkaaakaaaakaaaaaaakkkaakakaakakakaakkakaakakakakaakkaakaaakakakkkkakkkaaakkkkaakaaaakaaaaaakakkakakkaakkakaakakkakakkakkkkakkaakkakkkkkkkkaakaakkkkkkkkkkkkaakkaaaaaakkaakaaaakkaaakaakkaaaaaaaakakkakkkkaakakaakkkkakakaaakkakaaakaakkaakkkkkkkakkkaaakkakkkkkaaaakakaaaakaaakaakkkakkakakkakkaakakaakaakakakkkakkaakakkkakaakaaaakkkaaakakkkakakkkkkkakkaakakkaakkkaaaakkakaakakaaakkakakkakaakkkkakkkkkkakakkkaaakakaaakakakakkaaakkaakkaaaaaakkkkakakkkkkkakakaakkakkakkkkkakakkakkaakaaakkkakkakkaaakaakkkkakakaaaaakaaakkkkakkkkkaaaaakaaaakaaaakkkkkakkkkkkkakaaakkkaaaaaakakkaaakaaakkkakakaaakakkakakkkakaakakkaaakakkkkkkakkaaakakkkkkaakkaakkakkakaaaakakakakakaaakaakaaaaaakkkkkakkkkkkkkaaakkakakkaakkakkkkaakaakaaakaakaakaaakkkakkaaakakkkaaakakakkkkkakaakaakaaakaaakkkkaaakkakaakkakkkakakkkkkkaakakkaaaakkaakkaakakkaakkaaaakaaakkkakkakaaaakkakkakakakkkkakaaaaaaaakaakkakkkaakkaakkaakkkkkaakaakkkaakakkaaakkaaakkkkakakakkakkkkakakaakakkkaaakkkakakkakakaaaaaakaakakkkkaaakaaaaakkaakkkkkkkkkakkaaakkkakkaaaakaakakkkakakakakkkakakkaaakkaakkaaaaakaakkkakaakkkkakkkkakkkakakaakkakkkaaaakaakaakkakaakkkkkkkkakaaakkakakkaaakkakakkakkaakkaaaaakkakkakkkkakkaakkakkkkakkaaaaaakakkakkkakaakkakaaaaakkkaakakakaaakakkkkakkkaakkakaakakakkakaakkaakkaakkkaakakkkaaakaakakkkkkaaakaaakkaakaaakkakkkkkaaaakakkkaaaaaaakakkkkakkkaaaakaaakakakkkkakakkkakaaaaakakaaaaakakaaakkakaakaakakkkkaaakkkakkaaaakkakkakkaakkkaakkakkkaakkkkaakkaakkaaaakkkaaaakakakakkkaaaakkkkkakakkkkakaaaaakakakakakkkkaakkkakkkaaakkkkkkaakkaakkakaaaaaaaakkkkkaaaaakaakaaakkkakkkkkkaaaaaakkakaakaaaakkakkaaakkkkakkkaakkkakakaakkakakkkakakaaakkkkkkkkkaaaaakkakkaaakakkkakakaakkkkaakkkkaakaakaaakakkkkakkkkkakkkaakakkakkkakkakkkkkaaaakkkkaaakaakkkkkaakakaakakkaakkakakkkaakkkkaakakakaakkaaaakkkkkaakakakaaaakkaakkaaakakkaaakkaakkaakaakkakkakkaaakkakakkkakaakaaakaaakkaaakakkkakakaaakkkakaakkakkakkaakaakakakkaakkkaakkkkkaakkakakkaaaakkakkakkakkkkkaaakkkaaakaakakkaakkaaakaakaaakakakaakkkakakkakaakkakakaaakaaaakakaaaakakkkakakaaaakakkkkakkkaaakakaakaakkakaaakakkakkkkakkakkkaaakkakkakkaakaakkkkaaakkkkaakkkaakkakkkakakaakkkakkkaaakkaaakakaakaaaaaaakkakaaakkakaaakakkaakkkkkaakkakkakakkaaakakaakaaakaakaakakaakaaaaaakkkkaaaakkkkaaaakakkaaakaaakkkakkkkaaaaakaaakaakkaaakkkaakkakkkkkkkkakakakaaaaaaaakkaakkaaakkaakakakkkkaaaakkaakaaakaakaakkkkaaakkakkaaakaakakkkakakkkkakkakkkkkaakkaakkkkakkakaaaakkkkkkkaaaakkkkakkaakkkkakkaakkaaakkkakaakkkkkaaakaakkaakkakakakaaaaaakakaakakaakakaakakkkakkaaakkakakaaakaaakkkaakaaakkkakkaaakkakkkkkkkkakkkkakaakkkaaaaakkkaaakaaakakkkaaaaaakkakkakaakakakakakaakkakkkkkakakkakaakkaakakkkkkakkakakakkkkkakkkakkakkkaakakkakakkaakkkkaakkkakkakkkkkaaaakkakakkkkkakkaakkkkkaakkaakkkkaaakaaakaaakkakaakkkkaakkaaaaaaaakaakakaaakkkaakkkaakaaakakkaakkakaakaaakkaakkakakkkkaakkkkakkkkkkakaakkkkakkakaakaaaaakkkakkkkaakakaakkaakakaaaakkkkkkkaakaaakakaaaakakaakaaaaakakkaaakkaaaaaaakkkaaaakakaaakkakkkkkkkkaakaaaakkaaakkkaaaaakakkaakkkaaakakaaakkakkakakakakakakakkkkkkakkkkaakaakkkaaaakakakakkkkkaakkaakkkkkaaakkakakkkkkkkaaaaakkkkkakkakaakakakaakaaaakkaakkaakaaakakkaakkaakkkkkkaaakakaaaaaaakkkakkakkaakakaakkkkkakakkkakakakkaaakkkaaakakaaaakkaakkkkaakakkkakkkkakaaakkkkkkaaaakaaakkakaakkakkaaakkaaaaakkakaaakaaakaakkkakkkaakkakakakkkaakkkkakkkaakkaaaakkaaakkkkkkaaaakakkaaaakaaaaaaakakaakkaaaaaakkakkakkkkkaaakakaaakaaakakakakakakaaaakkkaakakkkaakkkkkkaakkkkakkkakaakkaaaakakkakkaakakkakakkkkaakkakkkkaaakaakkakakakkaaaakkaaakakkakakakaaaaaakkakkaaaaaakkaaaakkkakakaaaakakkkkakkakkkakkkakaakaakakakkkkkkaaaakkkaakaakaakakaaaakkakaaakakkaaaakkakakaakkkakaakkkaaakakkkakaaakakakaakkakkaaaakkaaaaaaakkkaakkakkkkkkakaakkakkakaaaaaakaaakaakaaaakkkkakakakaaakkaaaaakkaakkkaakkkkkkaakaaakkkaaaaaaaakakakkakakakaakaakakkkaaaakkkkakakkaakkkakaakaaakakaakkkakkkakkaakaakakkkkkaaakakaaakkkkkkkakaaakkkkkakaakkakaakakkkaakkaakakakkakaaakkkkaakkakkkkakakakkakkkkakkkkkakkkakakkkaakakaaaaakaakkkakkakaaaaaaakakaakkakaaakkaakkkkakaakaaakakkakkkakaakkkaaaakakkkaaakkkkkaaakkkaaaakaaakakkkkkaaaakkkkaaaakakkakakakaakaakakakakkkakaaakakkakaaaaaaakkakakaaakkaaakaakaakkakkaakakkkaaakkkakkkkakkakaakakakaakkkaaaakkaaakaakkaaaaaakkakkakakkkkkakkkkaakakkkaaaaaaakkakakakaaakakakakkkkkkkkkaaaakaakkaaaakkkkkkkkkakkkaaakaaaakakakkkakkakkakakakkakaaakakakkkkaaaaakkaakakkakaakkkkakakkakkaaakkaaaaakakakkaaakkakakakakkkkkkkaakakakkaakkkakaakkakkkakkaakakakaaaakkkakaakkkkkaaakkkkkkkakkkaaaaaaakkkkkkakkkkkkkakkakaaaakkaaakkkkkkkakakakaaakkakkkaaaaakkaaakkkkkaaakkaakkakkkaakkkkakakkaakkaakakkakkkkakkkkkakakkkakkaaaakkaakkakkkkakkakkkkkakkaakakkkkkaakkkakkkakaaaaakaaaaaaaakaaaaaaaakaakkkakkakkkkakkkkaaaaakkkakkkkkkkakkkaaakkkaaaaakkkaakkkkakakkaaaakkakkkaaaakkakakkkakkkaakakaaakakaakakkkkkakkkakaakkkaaakakakakkakakkaakakakkkkaakakakkakaaaaaakkaakkakakaakkaakaakkakkkaakakaaaakakkkkakakaaakkaakkkaaaakakkkkkkkkakkkakkaaakakaakakakkkakakakakkaakkkkkaakkaaakakkaaakkkkkkkaaakkkakkkkkkakkaaaakaakaaaaaakakaaaakkkaaakaaakaakkkaakkaaaakaakakaaaaakkkkkkakkakkakaakkaakkaaaakkaakkakakakakkakakkkkakaakkkaakakaakakakkakakakkaakakaakaaakkakkaakkakakkaaakkakkaakakkakkaakaakakkkakakaaakakkkkakaaaakaakaakaaaaakakkkkakakkkakaakakaakaaakakaakkaakkkakakkkakaakkkkkakakkkkkaaakkaaaaaaakakaaaaakkkkkaakkaakkkaaakkakakaaakaakkakakakaaaaaakkaaakaakaakkaaakkaaaakkaaakakaaaakaakkkkaaaaaakkkkkakakkakkkakakkkaakkkakaaakkaaakkkaaaakkkkaaaaaakkkakkkkakkaaaakakkakkaaaaaakkaaaakakkkakaakkkkkaaaaakkkkkaakkaakkakkaakkkaakkakkkaaaakkkaakkkakaakkaaakaakkkkkakkakaakakakkakaaaaaakakkaakkakakakaaakkaaakkkkkkaakkakakkakkkkaakkkkakkaaaakkkaaaakakkakkakkaaakakaaaakkkaakkakkaakakaakkakakkaaakkakkakaakaakakkkkkkkkakkakaakakaaaaakakkkkakakakkkkkakkakaakkakkkaaaakkakakaakkkakaaaaakakakakaakakkakkaakaaakaakaaakakaakakakaakkkkaakkakkaaaakakkaaaaakakkkakkkakaaakkkkkakkkkkaakkakakkkakkakakkaaakkakkkaaakkkakaakakkaakakakaakkkakkakakaaakakaaakaakkkkaaaaaaakkkakakkakkakakkakkkkakakaakkakkaakakkaaakkkkakkaaaakkkaaaaaaakaakakkakakakaaaaaaaakkaaakaakaaaakkakkaakaaaakkaakkkaaakkakkaakaakaaaakkaakkkakkaakaaaakaaaaaakaakaaaakkaaakkkaakkkaaaaaaakkakkakkakaakkakkkkkaakakkaaakkaaaaaakaakaakakkaaakkkkaaakkakaaaakkkkakkkkkakkaaaaakkkkaaakkkkkakkkakkaaaaaakaakakkkkkkakaaakkakkkakkakkkakakakkaaaakaaakkkkakaaakakakkkkkakakkkkakkaaakaakkkkakaakkakkaakkkakkakkkaakaaakaakaakkkkkkkkaaakaaakaakkkkakkaaaakakaakkaakakaakkaaakkkkkaakkaaaakkkaakkkaakkkkaaaakakakkakaakakkakakkakakkaakaaakkakkaakakkakakakakkkaakkakkakkaakkkkkkkaakaaaaaaakakakakkaakkaakakkkaaaaaakakkakaakkaaaaaaakkkaakakkakkakakkakkkaaaakaaaaaakkkkaaakakkakkaakkakaakkkkkakaaaakakaakakkakakkkkkakakkkaakkakkakaakaakkakakkakkkakkkaakkaaaakaakakakaaakakkkaakaakkkkkkkkakkakkakkkkakkkakkkakaaaaaakaakkkakkaaakakakakkkakaakkkkakkakakkakkakaaakkkaakkakakaakkkaaaakkkkkkkakkkaaakkakaakkkkaaaakaakkkaaakakkkkaaaaaakakaaaaakaakkakkaaaakkkkkaaakaaaakkakkkkaakkkaakakkaaaaakkkaaakkkkkakaakkakkkakaakaakkakakaakkaaaakkkaaakkkkakakaaakakkaaakakaakkaakkkakkakakkkakaakkkakkkakkaaakakakkakkkkkkakakaaaakkakaaakakkaaakaaaakaaakakkakaaakkaakkakkakkakakakaakkkakkkkkakaaaaakakakakkkkaakaakkakakakkakkakkaakakakkakakakakaakkkakaakkakkakkakakakkaakkakkakkkkkakkkkakkakkkkkkkkkkkkkkakaaakakkaakkkakkkkaaaaaaaakakaakkaakkkkakkakkakaakkakkaaakakaakakaaakaakaaaaaakkkkakaakkaakkaaakaaaaakaakkaakakakkakakkkkkakakkakkkaaakkkkaaakkakaakkkkakkkkkakaaaaakaakaaaaakaakkakkkkaakkkkakkkkkaaaakaakakkkkaaaaakaakkkaaakakaakaakkakakkaaakkaaakkaakkakkkakkaakkkakkkaakaaakkkkaakaakkkkaakkakkakaaakkakkkkaakakkaakakakkkkkaakkakakakkkkaakkakaakaakaakaaakaaaakaaaaaaaakakkakkaaaaaaakkakakaakkakaaakaakakkakkakkkkaaakkaaaakkkkkakaakkaaakakkkkkkkkkkkkkkkakkakkaakaaaakkkkkkkkkkakaakkkkkkakakkakkakkaakakkkakaaaakakakaaaaaaakkaaakkkkaaaaakakakkakaakaakkkaaakkakkaaaakakkakkkkaakkkkaaaaaakkakkakakkakkkaaakkaaaaaaaakaakkaaakkakkakkakakakaakaaakkkakakkaaakkkaakkkkakakakaakaakkkakaaaakkkkakkkakkaakakaakaaakakkkakakaakkkakkakkakaaakkaaaakakkkkkkkakaakkkakkakkkkakkkkkaakkakkkkaaakaaaaakkkaaaakkkaakkkaaaaaakkakaaakkkaaaakakaakkkaakakaaaakkkaaakkkaaakaakkaaaaaakkkkakkaaaakkaaakkkkakkkkaakkakkkakakkakkkkkkakaaaakakakaaakkakkkaaaakakkkaaaaakkaaaakaakaaakakkkakaakkaakkkkakkkaaakaakaakkkkkkaaaaaakkkkkakkaakaakaaakkaaaakakkakaakakkkkaaaaaaaakkkaaaakakakaaaakaaakkakkakakkkkakaaaakaaaaakkkaakkkaaakkaaaakaakaakaaakakkkakaakkkkkkaaakakkakkaaaaaakkaakkkakkkaakkkkkakakkkakaakkkkkkkakakakkaakaaaaakaaaaaaaakakaaakaakakkkaakkakaakaaakakaaaaaakkaakakkkkkkakkkaaakkkkkkkaaaakaaaakakakkakakkaakkkkkkaakkakkaakakkaaakaakaakakakkkkaakaakkakkkkakakakakkaaaaakkkaakakaakkakakaaakkaaaaaaakaakakkkkaakakaakaakakakaaaaaakakakaakakkkkaakakakkkaakakakkaakaakkkakaaaaakaakaakkkakkakaakaakaaaakaakaakkaaakaakkakkakkkkaaakkakkkkkkaakakkkakakkkkkakkaaakakkaakkaaakakkkakakkkaaakkaakakakakkkakkkakkkkkkkkkkakakakaaaaakakaakkaakaaakkkakaaakakkkkakkakkaakkkakakakkakkakkakakkaaaakkakkkakaakakkakakaaaakkkakaakakakkakkkkkakkkkkaaaakakkkakaakakkakkakkkakkkkaaaaakkaaakaakakkaaaaakkkkkakakaakkaakkkkkkaakkaaakaakakaaakkkkkkakkakakakkakakkkakkaakakkaaakakakakkkakkkaakkaaakkkkkkkaakkkkkkkkaaakakakkaaakakkkkaakaakakakaakkakkaakakakkkaakakkkaaaaaakkkakkkkaakkaaaaakaaakaakkaaaaakkkakkkkaaaakkakakaaakkkaaaakaaakkakkakaaakkaaaaaaaaakkkakakaaaakkaakaaaaakkakkkaakaaaakkakaaakkaakkaakkkaakkkakaakakakkaakkkkaaakkaakakkkakkkkkkaakkkakaaaakakkkkaakkkakakkkkakakaaakaaaakkkkkaaakaaaaakkaakkaakkakakkkkaakakkaaaakakaakaakkakakakkkkkakakkakkkkaakaaakaakaakakkkkakkkaakkkkkkkkaaakakkkakkkaaakkkakaakkakaakkakkakaakaaakkakkakakakkkkakkkakaaaaaaaaakaakkakkkkakkaakaakaakakkakaakakkkkakakkkakaakakaakakkkaakakaakaakakkakakkkkkakakakkakkakaaaakaaaakaaaaaakaaakkaaakkakakkakkaakaaaakkaakkakkkkaakkkaaaakkkkkkaaaakakakkakaakkaaaaaaaakaakkakaaaakaakkaaakakkkakaakkakaaakkakkakkakakkkakaakkkkakaaaaakkkaakkaakkkaakkkkkakkkkkkaaaaakkkaaaaakkaaaakakakkakkaaaakkkkkakakkkkakaaaaaakkakaaakkkkakakkakkakkakkkkkkaakaakaaaaaaaaaakaakkkkaaakkakakakakkkakkkkkaaaaaaakkakaakkaaaakakakaakaakakkakakkkakkkkakkakakakaaakkaakkakkakkkaaaaakkakaaaakaakakkaaaakkkaaakkakkkkaakaaakkkkkkakkkkkaakkaakakkkkakkkaakkkkkaakkkkkkaaakakkkaakaakkaakkkakaakaaaakkkaakakaakkakakakkaaaakkkkkakkkakakakaakakkkkkaakakkaaakkakakakkaakkakaakkkkakkaaakkaakakkkaaaaakkkaaakakkkakakakaakkakkakkkkkakaaakaakakakaakkkaaaaakkakkakaaakkaaaaakakkaakakakkkaaakkkkakkakkakkakaaaaakakkakkaakkkakakkakkkkakaakaakkaaakkkaakkakakakakkkkakaaaaaakaakkkkkkkkakkkaaaaaakkkkaaakkakakkkkakkkkkkakakkkkaakaaakkkkkkaakakkkaaakakaaaakkkkaaakaakkkakkkaaakkakakakkakaaakaaakkakakakkakaakaakaaakkkkaaakkakkkkakaaakkakkkaaakkakkaakakkakaaaaaakkakaaaakkkkkaakaakkakakaakkaaakkkaaakakaaaakaakkaaakkkaakkakakakkaaaaakkkaaaaaaaakaakkkaaaakaakakakkkkkaaaakkakakkkaakaakkkkaaakkkkaaaakaakakkkakakaakakkkaakkaaaakaakakakaaaakaaakaakaakaaaakakkkaaakakakakkkkkkkaaaaakkaakkkakaaakaaakaakkaakakkkkakaaaakakaakaakkkaakakakakkkaaakkaaaaaakaakkaaakaakakkkaakaaakkaakkkkkakakkkaaakkkakakakakkkaaaakaakaakkaaaaaakkaakaaaaaakakkaakaakaakkkkaakakkakaaakkakkaakkkakaakakakkakkakakkkaakkkaakakkakakakkkkakaakkkakaakkakkakakkkakakkakkaaaakakkkkaakkkaakkkaakkkaaaaaakkaakakaakkakkakaaaaaakaaaakkkkkakkaakkaakaaakkkkkkkkkkakkaaaaaaakakkkkkkkaaakakaaakkkkaaaakkkkakkkkkkkaaakakkkakkkkaaaakaakkaaakkaaakkakkkkkaakaaakaaakaakkkaaaaaaaakakkaaakkaaaaaakkkkaaakkaaaakakkakkkkkkaaakaaaakkaaakkkakaaaaakkaakkkaaaaakaakkakkaaaakkkakakakaaakkkaakkkkaakkkkkkkkaaaakakkkakkkaakkaakakkkaaakkkkaakkkaaaaaaaakkkkkaakkaaakakakkakaaaakkkakkaaaaaakakaaakkaakkkkkkaaaaakakaaaaakkkakkaakkkaakaakkkkaakakkkakakkkkakakkkaaaaakakakkaaaaakkaakakakkkakaakaaaakkaakkakakaaakkakkakkkkkkaaakakaaakkakkakaaakkakkakakkkaakkakkkakkakakaakkkkaaakkkkaaakaaakkakakkaaaaakaaaaakkaaaaaakakaaaaaaakaaakaakaaakkkkaakkkaaaaaakkakkkaaakakaaaakkkaakakakakkkkkkkkkakkkkkkkaaakkkkaakkakkkkkaaaakkakakkkkkakkakkkkakaaakakakakakkkaaakkaaakakkkkakakakkaaakkakakaakaakkkkakkaaaakaaakakkkkkkkkkakakakkaakaakakaaaakkkaakaakakkkaaaaaaakkkkaakakkkkaaakkkkaakakkakakaakakaaaaakkkakkakkaakakakakkkaakaakkakakkkaaaaaaaakkkakkkkakkkaakaakaakkakaaaaaaaakkkaakaaaakakkkkaaakaaakkaaaaaakkakkkkakkkkkkkkkaaakkkaaaakaakaakaaaakakkkaaaakakkkkaaakakkkakaakaakkkakaakaaakakkakaakakaaakaakaakakakkaaaakaakaakaakkkkkakaakkkkkakkakaakaakkakakaakaakakakkakaaaakakaakkakkakaaakaaaaakkkakkkkkaaakakakkkkakaaaakkakaakkkakkakaaaakaakakaaakakaaakkkakkkkakkkkakkkkakaakkakkaakkaaakkakaaaakakakkkkakkkakkkkaaakaakkaaaaaakkkaaakakakkkkakkkkakaakkkkkkkkkaakaakaaakkkaaaakakkkaakaaakakaakaakkaaaaakkkkakkkaaakkkakkkkakkkkaaaakaakakkkkaaakkakaaaakkkakkkkkakakakakkakkakkkkkkkakakaaakakakkaaakkaaakkaaakakkkkkakkkaakakaakaaaaakkkakkakkakakkakkaakkkakakkkkkkkkkakakakkkkkakkaakkkkkkaakakkakkakakkaakkkaakkkkaakaaakkkakaaaakakkkaakkaaakakkkkkkkakakaakaakaakkkkkkaakkakkakkaakakakakakkkkakaaakkkkaaakkkkkkkakakakaaaaakkkkakaakakkakakkaaaaaakkaaakkaakaaakakkkkkakkaakaakaakkkaaakaakkaaakkaakakakkaaakaaakaaaaakkkakakaakkkkakkkkkakakkkaakaakkakaakkakkakakkkkkaakakkaakkkkkkkkaakkakkkakakakaaaaaaaaaakakakaaakkaakkkakkakkkkakkkaakaaakkkaakkakkkkkkkaaakkkakaaaaaakaakkkakkkkaaaakkkkkkakaaaaaaakkkkkkakakakkaakkkaakaakkkakkkkaaaakkkkkakaaakakkakakkkakaaakkkkaakakaakakaaaaakkkaakkakakaakaaakaaakkkkkakkkakkaaakkkkkkkaaaaakaaakkakaakkakkkkkkkkakkkakkaakkkkkakakakkaakakaakkkakkkkkkaakaaaakakkakakkkkkkkaakakaakkkkkkkkkaaaakaakakkkkakkaakakkkaakakaaakaaakaaaaakaakaaakakkakaakkkkkaakkakaaakaakaakkkaaaaaaakkakakkkakakkkkkkkakkaaaaaakkkakkkkaakaaakkkkakaakaakkaakkaaaakkkakkkaaakaaakaaakakkakkakakkkakkkakakaakkakkkkakaaaakakkaakakaaakakkkkkaakkkakaaaaaaakaaaaaaaakkaaakakkkkkkakaakkkkaakakkkkkakakkkakaaaakakaaaakkkkaaaakkkakkkaaakkkkakaaakkakkaaakaaaakakaakaaakaakaakaaaakaaaaakkaaakkkkaaakaakkaaaakakakaaakakkakakakkkakkkakkkkkkkaakkakakkkaaaakkkaaaaakkkkkkkakkkkaaaaakkakakkaaaaakkkaaaakkkkaakakkakkkkkkakkkkakaaakakkkakakaaakaakkakkaakakkkkkakkkakaakkakkkkakaakkakkakakkakakkakkaaaaakkakaakkakkkakkaakkaaaakakkkaakkakkkkakkkkaakkkkakkkaakkaaaaaakaaaakkakaaaakakaakaakkaakakkkaakakkaakaaakkkkaakaakaaakaaaaakkkkkkaaakkakaakkaaaakakakkkkkkakaakkkkakkakaaaakakaaaakakkkakaakkkaaakakakakakkkaakakaakkaaaaaaaaakaakkakkakakakaakkkaakkkakaaaaaaakkkaaaaakkkkakaaakaaakkkkkkkkaakaakkaaakkkakkaaakkaakakakkkakaakkaaaakaakakkkkakaakkkkkaakakaaakkkaakkkaaakkakaaakaaaaakaakaakkkakaaakkkakkaaakkaakkakkkkaaaaakkaakakaaakkaaaaakakkaaaakkkaaakaakakaakkkkkakakkaaaaakakkaaaaaaakkkakkkkaakakkkkakaakkakaakaakakaakkakkaaakaaaaakaakkkkakakakaakakkkkkaaaaaaakkakkakakkaaakkakakkaaakkaaaakkaaaaaakaakakkakkkkaakkaaaaakkkaaaaakkaakkakkkkkaaakakkaaakakkaakkakaaakaakaaaaaaaaakakakaaaaakkkkakkaaaakaakkkkkkakaakakkkkakakaaaaakaakkkaakaakakaakakakaakkaaakkakkkkkkkaakakkaaakakakaakkkkaakkkkakkakkakaakaaakkaakkkaaaakkkkkakakaakkakkaaakaakkkaakaakkaakkakkkaakkkkakaakakakkaaakkakkakakkaaaakaaaaaakkaakkakaakaaaaakaakkaakkakkkakaakkkkkkaaakkkkkkaakakakkakkkakaakakkkkaaaaakakaakakkaakaakaakkkakkkkkakkkkaakakkkakaakaaaaaakkkkakkaakkakaakkkkkkkkakaakkakakkkaaakakkkaakkakkkkkkkkakakakkakakkaaakakkkaakkkakkkaakkaaaakakkkkakaaaaakkkaakaakaaakakkakkakkaakakakakaakkakkkkaaakaakkkakkaakkakakkkkkaakakkakkkkkkkkkaakaaaakkaaaakaaaakaakkaaakkkakkkkaakkkakakkakaakkkkaaakkaakkkaakkaakkkaaakaakkkkaaaakaakaakkakkaakaakkkakkaaaakaakkkaakkkaaaaaaaaaaakkkaakakkkkakaakkkkkaakaakkkkaakakaaakaaaaakkaaakkkkakakakakakkakakkkaakkaakkaakkakakaaakaaakkakakakkkkakakaaaakkkkkakkaaaakkkkkkaaakakakaakaaaaaaaakakaakaaakkakkaakkkkkkakkakaaakkaakkakkkaakaakakakaakkkaakaakkakakaakakkkkkkakakkkkaaakaaakkakakakkakkakkakkkkkkakkakkkakkakaakkaaakkkakakaakkkkkkkkakaakkaakakakakakakakkakaaaakaaakkakkaakkkkakkakaakaakkakkakakaakakaaaakkaakaaaaaakkakkkaakakakkakakakkaakaakkaakakkkkakakkkkaakkkaakkkaakkakkaaakaakaakakkakkakkakaaaaakakkkkkaaaaaakakakkaakkkkkkaakkkaaakakkkakkaaaaaakaakkkaaakakakkakakkkakaakakkkkakkkkakkkkkakkaaakaakakaaaaaakkakaakaakakkakkkakkaaaaakkaaakkkakakkaakakakkaakakakakkkkkkaaakkaaaakkaakkakakakkaaakaakkaaaakakkakkaaaaaaaakakakakaaakakakaakaakakkkakakakakaakaaakkakakkkkkakkkakkkkakkkkkkkaakkkkakkaakaaaakakkkkkkkakkakkakkkkaaaakakaaakkakaaakaaaakakakakaaaaaaaakakkkkkkkkkaakaakkkkaaakaakakakaakakkkaaaaaakkkkaaaaakkaaakaakakkkkakkkakkkkaaaakaaaaaaaakaakkkaakkkkkakkakakakaakaaakakkkakkaaaakkaakkkaakakakaakaakkkakaaakkaakakkkakaaakakakkaaakakkaaakkkkaakkkkakkaaaaakkkaaakakkkkakkakaaaakakkakkkkkkaakaaaakkkakkkaakaaaakkkkaaaaaaaakkkkkkaaaakkakaaakkkaaakakkakkkkaakakaaakkakkkakkaaaaakkkkkaaaaakkkkakaaaaakkakaakkkakakakakaaaakkkkkkakkkkaaakakaakakkaaaakkakkkaaaakaakkaaaaaaaaakakaakakakakkaakaaakakkakakkakaakkaaaaakkakakaaaaaaaakkkakkkakaakakakkaakaaaakakkakkkkkkakaaakakkkkaakkkakkkaakkkaaakaakakkakkkkakkkaakaaaaakkkkakkakkkaakaaakaakaakaaaaakkkakakkakkkaaaakakkakkkaaakkkkkkkkakakkkkakkkkaaakkkakakakkkkkkakkkkkkkakaakkakkaakaakakakaakaaakkkkkaaakkkkkaaaaakkakaaakkkkakkakkakkkkakakkkkkkkkkakakkkaakkkkakaakkkaaaakkkkkakkkkkkaakaakaaakaakaaaaaakaakkkkaakkaakkkakakakkkkkkakakkkaaaakakkaakkkkaakkkaaakaaaaakakaakakkakaakaakakakaaaaaaaakakaakakkkkaaaakkkkkaakaaakaaakaakkaaakkaaakakaaakkaaaakkkaaaakaaakkkaaaaakaaaaaakkakkkakkkakakkakkkkkkkakakkkaaakakkkakkaaakkaakakkaaakkkakakkkkaakaaaaakakaaakkaaakaaakkkkkkkakakaaakakaaaakkaaakaakaaaakkakaaakaakkkaaaakkaaakaakakakkaakakakkakakaaakkakkkakaakaakkkakaaaakakakakkakakkkkkkkaakkakkaaakkakkkkakakakaaaakkkkakkkkaaaaaaaaaakaaakkkaakaakkakkakakkkkkaakkkkkkakakaaaaaakakaaakaaakkakkakakakaakakkkakkkaaakkaaakakakkkkkakkkaaakakakkkkkakkakkkkkaakaaaaakakkakakakakkakakakakakakkkkkkaakaakkakkakkkkkaaaakakkkaakkkkakkaaaaakaakkaaakakaaakkkakkkkaaaaakakakkaakkkkakkaaaakkkkkkkakaaakaaaakkaaaakakkkkakkkakaaaakaaakaakaaakaakakkkkaakkkaakkaakakkakkkakkakkkakkkakkakaakakkkkakkkkkkkkkkaakakaakaaakaakkkakakkkkakakkakakkakkaakakaaakakakkkakkkkkakaaaakakakakkaakakkaaakkakkkakakaaaakakkkkakkkakakkaaaakakkkaakaakakkakkkaaaakkakkkakkaaaakakakakaakkkkkkaaakakaakaaakakaakakakkkakakkkkakkakaakaaakaaakaaakakakakaaakkkaaaaakaakkkkkkkakakkakakakkaakaakakaakkkkaaakakaakkaaakaakaakkkkaaakakakkkaakaaakaaaakaaaaaakaaakaaaakkaaaakaaaaakaaaaakaaakakkkkaakkaaaaaakaakkaaakkakakkaaaakkkaakaaakkaakkakaaaakaakaaaakakkkkkkakkakaaakaakkaakakakkkakaakkkkakaaaaaakkaakkakaakkakkkkaakkaakkakaakkkaakkaaakakkakakkkkaakaaakkkaakakkkaaakaakaaaakakaaakakkkakaaaaakakkkkaakkaaakaakaaaaaaakaakaaakakkaakkakkkakakkkkakkkaaaaaakakkakkaakakaakaaakaakaakakaakkkkkkakkkaakakakakaakakkakkakaaakkkakaakkaaaaakkaaaakkaakakkkaakakakkkkaakakkakkkkkakkaaaaakaakakkkkkakkkakakkaaaakkakkkkakaakakaakkakkaakakakkakakakakaaaaakakkkkkkkkkkaakkkkakkakkaaaaakkkakakkaakaakkaaaaakkakakakkakakaaaakkkkakaaaaakaaaakakaaakakaaaakkakakakakkkaakakkkkkkkkaaaakakaakakakaakkkakaaakkakkaaaaakkakkaaaaakaakaaakkkaaaakkkkkaakkkaaakaakaakakaakkaakkkakakaakkkkaakaaakkkaakkkkakkkaaakkkakakaaaaaaakakaaaakkkaakakkkaakakaaakkaaaakakkakkkakakkkakkaakkkaaaaakkkkaakaakkakaaaakakkkaakakkaakaaaaaaakkakkakkkkaakkkkaakakkkkaaaakkaakkakkkakaaaaaakkakkkkkkkkaakaakkaaakkakkkkakkaaaakkkakakaakkkaakaaakkkakkkkakkkakakaakkaakkkkakkkakaaakkaakkkaakaaaakaakaaaakaakakakkaaaaaakkkakkkkaaaakakkakaakkkkaaaakkkaakkaaakaaakakkaakakkakaakaaaakkkaakaaakakkkaakaaaaaakaaakakaaaakkakaaakaakaaaakaakkaaakakakakkkkkakaaaaakkakkkaakkakkkkakaakkkakakkkkakaaaakakaakaakkkkaakaaaakkkaaaakakakkkakkkkaakkakkakkkaakaaakkkakkakkakakaaaaakkkakkkkkakkaaakakkaakakkkkkaaaakaakkakaaakakkaakaaaaakkkkaakkkkaakaakkakkaakkaakakkkaakaaaaakaakkaaakkakakaaaakkakkkaaaakkkaakaakkaakakakakakakaakkaaaakakakaakaakaakkkaakakkkaaaakaaakakaakkakkakkaaaaaaaaaakkkkkakkaakkaakkakkkkkkkaakaakkaaaaakkkakkkkkkakaakakaaakkaaaakaaakkaakkakkkaaakkkakakkkkkkaakakkkkaakkakkkaaakkkkakkkakakaakkakkkaaaaaaakkakkaaakkaaaaaakkkaakakakaaakaakakkkakkaaaaaakkkkakakkkakakaaakakakkkakaakkaakaakaaaakakkaaakkaaaaaakaakkkkkkkkkkkkkkaaaakkkkkakkaaakaaakakkkaaaakkaaakkkaaakaakkakkaaaakkaaakakakkkaakkakkkkkkakaaaaakkaakkaaakkkkakaaaaakakkaakaakkakkkakkkaakkaakkkaaaakaaaaakkkkakakkakakakkakakaaakaaakaakaaakkaakakaaakakaaakkakakaaakkakkakkkkkkaaaakkaaaakkkkakakkkakkkaakakkkakaaakkkakakaaaaakkkaaaakkkaaakaaaakaaakkaakaakakaaakkaaaaaakkaaaaaaaakakakkakkaaaakkaaakaaaaaakkkakkaaakaakaaaakkkkkkakaaakakkkkkkkakkkkakakaakkkkakkkkkakkkkaaakakkkkkkakakakakakakkakkakakkakkakkakkkaakaaakkkakaakkkkaaakkkakaakakkkkkakaaaaakakakakkkkkkkkkkkakakaaaakakakakakkkkaakakkaakkaaaaaaakakkakkaaakaakaakaaakkaakkaakkkkakaaakaaakakkakaakkakakakkkaakakkkakkkkkaaaakaaakakakkkkaakkaakakkaakkkkkaaaaaakkkkkakaakakaakkaaaaaaaaaaaaaaaakkkkkkkaaaaakakkaakkkkkaakkkkakaakaaaakakkkakakkakakkaaakakakkaaakakkakkkakkaaakakkakaakaaakakkkkakaakakkakaakkakaakaaaakkkakaakkkkkakkaaakaaakkakakkaakkaakakaakaakakakaakkkkaakaaaaaaaaaakakkaaakaaakkkkakkkkkkaaakkakakkkaakkakkaakkaakkkakakaakkaakkkkkkaaakkkakkakaaaaakkkkaakkakakkaaaaaakakakakkakakakkkkaaaaaakkaaakakkkkaaakakakkkkaakkkkkkaakakkkakkaakaakaaakkkkaaakakkkakkkaakakaakkkkkaaakaakkakkkkaakkkkakakkakkkakkaaaaakakkkkkaaaakkaakkkakakkkkkakaakkakkakaakakkkkaakakakakakaaaaaakkaaakkaaakkkkkkkaaakkakakaaaaakakaakaaaaakkkakkakaaakkkaaakaakkkkakakakakkkkkakaaakakaakaakaaakkkakakkkkkakaakkkaaakakakakakakaaakkakakkkaakaakkkkkkkakakaaakaaakkaakakaakkakaakkakkakkkakakkkkkakaakkkaaaakkkkkakaaakakaakakkkkkakaakakkaakkkaaakaaakaaaakaakaakaakkkkkkkkaakakkakkakaaakaakaakkkaaaaakakkakaaaaakaaaaakkkakakakkkkkakkakkkkkakkkakakkkaaaakkakkakkkkkaaaakkaakkkkkkaakkaakaaakaakakakaakaaakakaaakakkaakaaakkkakaakkkkakkkaakkakakaaaaaaakkkkkaaakkkkkkkkaaaakaakkkakkakakakkakakkakaaaaaaaakkkkkakakkakkakkaakkaakkkakaaaaakaakakkakaakkakkakakakakaaaaaakaakkkaakkakakaakakakkkaaaaaaaaaakakakkkakakkkakkaaakkkakkkkaaakkaaakaakaakaakkkkakaaakkkakkakkkkkkakakkkaaaaakaakkaakakkkkakaaaakaakkkkkkkakkkakakakaakakaakkkaaakakkakakkkkaakaakakkkaakakaakkkaakaakaakkkkaakkakkakakkkkkkaakkakakakkakkakakkkkaaakaaakakkaakakkkaakaaakkaaakkkkkakkkaaakaaakkkkakaakkakkkakkkaakkkkakkkaaakaaakaaakkkkaaakkakkkakakakakkkkkkkaaaakakkkkkkkkkkakaakaakkaakaaakkaaaaakaaaaaakaaakakaaaakakakakkkkaakakkaakaakkkakkkkkkakkakakkkkkkkkaakaakakakkakkakakkkaaaakaakakkaaakaakkkakaaaaaaaaakkakakaakakaaaakkakkkkkakkaakkaaaaakakkkaaaakkkakkkakkkakakkkkkkkakkakkkkakkkakkakakaaakakkkkkkkaaakkaaaaakkakaaaakakakkakkaaakkkakkakkakkkkkkakkaaaaaaakakkkakakaaakaaakaakakkakkkakkakkkkkkkakkkkkkaaakkaakkkakkkaakkakkaaaaakkakaakaakkkakkaakkkaaakakkkaaakkkkkaakakakakkkkaakkkakkaaaaaakkaaakkakaaakkkkakkaakkaaaakkakkkaakaakkakkkkkaakaakkaakaaaakkkkkakaakkkakkakkakaakkakaaakkkakaaaaakaaaakaaaakakaaaakakkaaakakkkaaakakakkaaakkakakaakkkaaakkaaaakakkkakkakkaaakaakkaakkakaakkkaaakakaaaaakkaakkaaakaakkkkkakkaaaaakkkaaaakaakaaaakakkkakkakkakaakkaakaaaakkkkkkakkakkkkaaakakaaakkakakkkaaaaakkkaakaaaaakkakaakkkkaaaaaakkkkaakkkaaakkkkkaakaaaaakakakaaaakakakakakkaakakkkaaakkakakkakakkkaakkkkakkakakaaaaakaakkkkkaakkkkakkkkkkakakakaaaaakaaaaakakkkaaaaaaakkaakakkkkakakaaaakkkkkakaaakakkkkkkkakkkaakkakaakaaakaakakkkakakaakaakakkakakkaakaakkaakkkaaaaakkaakkakkkkkkaakkkkaaakaaaaakkaaaaakaakaakaaaaaakakakkaakakakkaakaaaaaaakkkkaakkaaaakkkkaaaaaaaaaaaaakkaakkakakaakakkakakkaaaakaaakaakkaaaakkaaakakakkakkkaakkakkaaaakkaaaakakkakaakkaakkkakkkkakakaakkkaaakaaaakkkaakkakkaaakakkkaakakaakkkkkkaakaakkkakkakkkakaaakaaakkakkaakkakaaakaaaakkaakakkaakkkakaaakakakaaakkkkkkaakaaaakakkkakaakakkkkaaaakkaaaaaakkakkkakkakkakkakaaakkkkkaaakakakaakakkkkakkkkkkkaaakaaakkkakkkkkakaakakkakakaaakakakakkkakkkkkakaakakkkkakakkkaakaakkaaakakkkkkaaaaaaaaakkkkakakaaakkkakkakkaaakakakkaakaaaaaakaaakakkaakkkakkkaakkkakkakkkkakkkkaakakakkakkkakakkkaaakaaakaaaaakakaakkkakaakkkkakakaaaaakkkakkakaakkakkakkaaakkkaakakaakkkakkkaakakaaakkaakaaakkkkkakaakkkakkakaakkakkkakkkaaaaaaakaaaaakkakkakkkakkkkaakkkakkkakkkkakkakaaakaaaaakkaakkkkaakaakkakakkakakkkaakaakakaaakakakaakkkaakkakakkakkkakakaaaakkkakakaaakakkkakkaakkaaakakaaakkaaaakaaakkaakakkkaaaakkakkakkkkaaakakaaaaakakakkkkaaakaakkaaakakkaakaaaakaakkkkkkkakkkaaaakaaakkaaakaakakkkkkakkkkkkakakkakakkkaaakkaaakkkaaaaaakaaakaakakakkkaaaakakakakakakkkkaakakaakkkakkkaakkaaakakaakkakaakkakkkkakkkaakakaaakaaakkakaakkakaaakakkkkakakkkakkkaaaakkkkaaakaakkkaakkkakkkkakkaakkaakkaaaaakakkkakakkakaaaakakkakkkaaakaakaaakakakkaakkaakkkkkakkkakakaaaaaaakakaakakakakakaakaakkakaakakkkkkakkkakkaaaakakaakaakaaaaaakakaakaakakaakkakkkaaaaakakkakaakkkkkkkkaaaakkkkaakkkakaakakkkaaakkakaakkakkkakakaakkaakkakkkaaaakkkakakakaakkaaakaaakaaaaakkkkkkkakakkkakakkkkkaakaaaakakakkkakkkkkkkkkaaakkaakaaaakkakakaakkkakkaakkkaakakaakkakkkkaaaakkkakaakakaaaaaaaakakaaakkkaaaaaakakkakkkkkkkakkakkkkaakkakkakakkaaakkkaakaaakkkaaakaakaaakkaakakkkkakkkakkakaaaakkaaaakaakakakkkakkkakaakkkkaaaaaaaaaaakkaakkaaaaakaaaaaaakakakkakakkkaaakaakaaaaakakakakaaakakaakakakkakakkkkaaakakakkaakakkkkkaakakkkkakkkkkaaaaakakakkkkkaakakkakkkakkkaaakaaakkakaaakaaaakakkkkkaaakkkkaakkkkaaakakkkkkkkaakakaaakkakkkakkaaaaakkaakkakaaaakkaaakaaakkakkakkaaaakakkkaaaaakakkaakkakaaakakkkkaakaaakaaaakaaaakaaakkakkaaaaaakkaakkakaakakaakaaakkkkaaakaakaakkaaaaakaakakaaakaaaakkkkkkkakaakakakkaakaaaakakkakkkkkkakakkkkkaaaakkkkkkkkaakkakaakaakakkakkkakkkkakkaaaaakaakkkaakkkaakkkaaakakaakkaaakaaakkkaakakaaaakakaakakkakkkaakkkkakakkkkaakkkkaaakkkkakaakkkakkkkakaakakaakkakkakkaakakakaakaakkkkkkkkakkkkkaaakakaakaakkkkkakkakaakakaaaakkkakkkkkakkkkkkakkkkkaakakkakkakkkkkakakkkkaakaakaaaakkaaaaaaaaaakkkkkakkaaakaaaakakkakkkakkkaakkakkkkkaakkkkaaakkakakkaaaaakaaaaakkakkkaaakakaaakkaaaaakkkkaaakkkkaaaaakaaaaakaakkaaaaakkkaaakkkaakakakkkaakaakakaaaakkaakakkakaakakaaaakakkakakkkakaakkkkkkkkkkkaakkaakkaaaaakaakkakaakaakaaakkkakakkakaakkaakakakkakkkaaakaaakkakkkaaakkaaaaakaaaakkaaakakkakaaakkkkakaaakkaaaaaakakakaakakaakaaaaaakakkakaakkaakkaaaaaaaakkkkkaaaakakakakkkkaakkkkaaakkaaakkaakkakkkkakkkkkaaaakkkaaaakkaaakaaaakakakakkkaakaakkaaakakkkkkakakkakakakakaaaaaakaakaakaaakaakkkkkkakaakaakkkkakaaaakkaakkkkakakkakkkkaakakakkkakaakaaakkkaakkaaaakkkakkaakaakkkkakakkkakkkakkakakaaakkakkkkkaaakaaakakaaaakkkkakkaaaaakkakkaaakkkaakakkaakkkakaaakakakkaakkkkkkkaaakakkkakaakaaakakkakkaaaakaakkkakkaakaakakakakaakaakkaakkkkkkaakaaakkkakkaakakkkaakakkkaakkaakaakakaakkkakkakkkkkaakaaaakakaaaakakakakaakkkaaakkkakkkkkkakkakaaakkkkkkkakkkkkakaaaaaaaakaakaaaakkaaakkaakkakakakakkkkkakakakaakkkaaaaaakkkkaaakkaakakkkaaakaaaakkaakakaakaaaaaakakkkkkakaaakaakkaaakaaaaakkaakkakakkkkaakakaakaakkaaakkaaaakakaaaaakakakaakkaaakkakkkakkakakkkakkakkaakakkakkkkakkaaaaakkkaakaaaaaakkkaakkakakakaakakakaakakaaaaaakaaakaaakkkkakakaaakkkakakakkkakkkaakaaakakkkaakaakkaaakkakakaaaaakkkaakaaakkaakaakaaakaaakaakakaakkkkkkkkakkkkkakkkaakakakkaakakkkkkakkkkaaakkaakaakaaakkakkaaakkaaakakaakkkaakkkaaaakkakakkakaakakakakaaaakkaaaakaakaaaakakaaakakakkkaaakakakkkkaaaaaakkaakaakakakkakkaaaaaakkakkakkaakkakakakakaaakkakkkaakkaakkkkaakaakaaaaakkaaakkaakkakkkaaaaakaakkakakkakkakaaakkkakaaaakaaakkakaaakkaakkaaaaakakaakkaaakakkakakkkkkkaaaaaaaakakaakaakkkakakaaaakkkakaakakakkakaakkakkakkakakkkaakakaaaaaaaaakkkkakkkkkaakkkkakkakkaaaaakkkkkakkaakkkakaaakaakakaaakkakaakaakakkkaaakakaaakaakakaaakkkaaaakaakakkkaakkkaaakakkkkkkakaakaaaaaakaaaakakakkaakaakkaaaakakakkkaakakaaaaaakkkkaaakkkkkaakkkaakkaakakkakaakkaakkkakaaaaakaaaakkaakakaakkakakkaaakkkkakaaaaaaaakkkakaaaakaaakakakaakakkaakakkaakakkakaakkakakakkaaakaakaaakkkkaaaaakkaaaaakaaakkaakakkkakaakaaakkkakkaakkkaakakkaakkkkkkaaaakkaakkakkkakaaaaaaakakkakkkakaaaaakkaaakkakkkkkkkkaaaakkakakaakkaaakaaakakakkkkakkkkkkakakkaakkakakkkkkaakkakkakkakaaaaakakaaaaakaakakakkaaakkkkkaakkakakkaaakkkakakkakakaakkkakkkaakkkkaaaakakkakaakkaaakakakkkakaaakakakaakaakkaakkaakakaaaakkkkaaaaaaakakaaaaakaakkakaakakkkkakakaaakaakkaaaakkkakkaaakkakakakakkkkaaakakkaakaaakkkkakaaaaaakkaaakakakkkakkkaaakkakkkakkaakaakkkkakaaakakkaaaaaakkkaakkkkakkakkkakkkakaakkkkkakaaaakkakaakakakakakkaaakkkkaakkkaaakkaakakkaaaaakkakkkakkaaaakaaakaaaakakkakaakakkakkaaaaakaaakkaaaaaakakakaaaaakaaakkaaakaaaaakkaakaaakaaakakkkaakaaaaakaaaakkaakakkaakkkakaakakkkkaakaaakkkakakkkkkkkaakaakkakaaakkkakakkaaakaakaaaaaakaaaakkaakkaakkakkkkkkkkaakakkkakkakkkkkakkakakkkkaaakakakkkkkkakakkkkkkakaakaaakakaakaaakkkkakakaaaakakakaaakaakaakkakkakkaaakkkkkkakkkakakaaaaakkaaakkkakakkkaakaakakakakakkkakaaaakakaakakkakkkakkkakaakkkkkaakakaaaakaaaaaakaakkaaaakkaaakakkkakkaakaakakkkaakkkkaakkkkakkaakkakakakaaakaakakaakaakakakkakkkakaaakaaakaakkaakkaakakakaaaaakaakkakkkaaaakkkakkakkkaaakaaaakkkkaakkaaaakaakkaaaaaakakkkaaaaakkkkkkkakkkaaakkakkaakkkkkakkkakkkaakaakkkaakakkkaaakaaaaakakaakaakkaaaakkkakaaaakkkkakkakakaakakaakakkakkaaakkkkkakkakkaaaakkaaakakkaakkkaaakaaakaakakkkaakkkakkaakkakkkaakkakaakaaakakkkakakkkkaakakkkakaakkkkkaakkaakakakakkakkaakkkakaakkkkkkaakakakkaaaaakkkkkaakkaakkkkakaakkkkaaaaakakkkakkkakakkakkaaakaaaakkkakakakkaaaakkkkaaakkkaaaakkakkakkaaakaakaakaakkkkakkaakkkaaakakkaaakkkkakaakkakaakakakkaakkaakkkkaakakkakaaakaaakkaakkaakakaaakakakkaaaaakkkkkakkkkkaaaakakaaaaakaakkkakaakkakkkkaaaakakkakkkakkkakkkkkkakkkaaakkakkkkakkakakkkkkkakakkaaaakkkaakkkkkakkakakaaaakaaakaakkaakakaaaaakkakkakakaaaaakakakaaakkakaakaaakakakkakakkaakkaaaaaakkaakaaakkakakaaakkakaaaakaakakaaaakkaaakkkakakkakaakkkkakkakakakaakkkkkakakaakakaakkkakkkaaaaaakkkakkakaakaaakkkaaakakakkkaaakkkaaaaakkaaakkkkkkkaaaaaakaaakkkkaaaaakaakkkkkkakakkakaakakakakaaakkkkaaakakkakkkaaakakakkaaakaaakkakkaakaakkakaakkkkkaakaaakkaakakkaaaaakkkkkkkaaaakkkakkaakakkkkkakaakkakaakaakakakkakkaakkakkkkaaaaakkakakkkaakkkkkkkaaakkkkkkakaaakakaakaaaaakkkaakakaakkkkkaaaaakaakaakaakaaakakakaaakaaaakkkkaaakkkakakkkkkaaaakkkakakakkaakkkakakakaakakaakakakakakkkkaakkaaakaakkaaakakkakkakaakaakkkakakkakaaakakkaakkakkakkakaakkaakakaakkkaakkakkakakaaakaakaakkaakakaakaaaaakakkkkkkkakkaaakkkkkaaakkaaaaakkkaaaaaakaakkkaaaakkaaakkkakakaaakaakaaakaaakakakkkaakkkkaakkakkakakkkkkaaaaakaakkkkkkaaakaakaaakakakkakkakkaakakkaakakkkakaaaaakkkakkakaaaakaakkkkakakaaaaakkkkkakkkakakkkkkaaakkaaakaakaaakakkakakkakaaaaaaaakakaaakaakakkkakakkkkakkkakaaakakkakakkkakakaakkaakkakaaaakaaakkkakkaakkakkkkkkakkkkaaaaaaaaaaakkkaakaaaakkkakkkaakakakkkkaakkaakkaaakkkkakaaaaaaaaaaakakaakkakkkakkkkaaakaakkakkakkakkaakkaakkkaakakkkkkakkkakkkaaakaakaakkkakkkkakkkakkkkkakaakakakakkkkaakkkaakaakaakkkkaakkaakkkkkkkakaaakkkaakakkakkkaakkkkaakkaakakkkaakakkkaaaaaakkaaakkkkkkkakaaaakakakakkkaakkkakkaakkaakkkkkakaakkkaakaakkkkaaaaakkakkkaaaaakaakkkakaaaaakkkkkkkkakkakkakkaaaaaakakakkkaaaakaakakkkakakkaakkakakakakkkaakaakaaakkakaaakkkkkkkkkkkkkkakkkkkaakaakkkakkakakkkaakaaaakkakaaakakkaakkkkkkaakakakkakakakkkkakkkkaakakkkakakkakkaaaaakkakkaaaaakkkaakkakkaaaakkkkkakakkkakkkaakkakkkaakakakkkkaaakaaaakkaaaakkkaakaakkkkakkakkakakaaakaakkaakakkkkkkaaaaaaaakkkakkakaaakakakaakakkkkakakkakkkakkkakkkakkaaakaaaakaakkkakkkkkkaakkkakakaakakakkkkkkakkkaaakaaakaaaakakkaakakakaakaakaakkakaaakaaaakaakakkaaakkakaakkkakakkaakaakkkaakaakkakkakkaakkaakakkakaakakkaaaaakaakakkkkakkakkakaaaakkkaaaaaaaaaaaakkaakaaakaakaakakakaakkkaakkkkakakakkakakaakkkaaakkkakkkkkkkkakakkaaakaakaakkkakaakkkaakkakaakkakkaakkaaaaakkaaaaakkaaaaakkkaakakaaaaaakkakkkaakaaaakaaaaaakkakaakkakaakkaakkkaaaaakakakkakkkakkaaaakkkaakkaaaaakaakakkakaaaaaakkakakkkaaaakkkkkakkaaaaakakkkakaakkkkkakakkkakaakkaaakkkkakkakakkkaakkakkkkakkkaakaakkaakkkaaakkkkakaakkkkkakkkaaaakkaakaakkakkkkaakaakkakkakkkkakkkaaaakkkaakkakkkakkkakkaakakaakkaaaaaaaakaakkkaaakkkakaakaakakkakkkaaaakkaakkkkakaakkaakkakakkakakkkaaaakkaaaaaakaaakakkakkakaaaakaaaaakkakkkkakaaakaakaaaakkkkaakkkkakkkkkaakakkkaaakaakaakkkaaakkaaakkakakkaakakkaakaakkaaaaaaaaaakkakkkkkkakkkakaaaaakkaakakakkakaakkakkkkakkkkakkkakkkkaakkkaaaaakkakkkkkaaakakakakkaaaakkkkkaaaakakkkkaakkkkakaaakakakkkakaakkaaaaakakaaakaaakkaaaaakaaakaaakakaaakkkkkkkkkaakakaakkaakkakkakkakkkkaaaaaaakkakkkakkkakakkakaaaaakkkaakaakkkkkkakkkkakakkkkkakakkaakkaakakkkaaaakakkakakakkkkaakakkkaakkkkaaakkaakkakkakkkkaakakaakaaakkaakaaaaaaaaakakkkkkkkaaaaaakkakaaaakakakkakkaaaaaakaaakaakaakkkakkkkkkaakaakkkkkakakaaakakakkakkaakakkakaakaaakaaaakkakakkkkakaakkkaaaaaaaaaaakkakkkaaakaakkakkaakkakaakakaaakkkkkkkakakkkakkkakakaakkkkaaaaakkaakakaaakaakkakakakaakaakkkakakaakkakkkakakkaakkkakkkkkkkkakkaakkaaaaakakaakkaakakkkakkkaaaaakaakaakkaakaaaaakakkkaakkkaaaakaakkakkkkkaakaakkakakakaaakakkaakaaakaaaakkkakakkakkkkkaakkkakakkkaaaaakakkakakakkakakaaaaakakkkkkkaaakaaaaakkkakaakakaaaakaakkkkkkkakkaaakakaaakkaaaaakkkakaakaakkkaakakkaakaakaaaaakaakkkaaaaaaaaaaaaaaakakakkkakaakkkaakaakakkaakakkakakkaakkaakakakkkaakkkkaaakakkkkakkaaakkkaaaakkakkkkaakkakaaakkaakkkkkkkkaakkaaakakakaakaaaakkakkkaakaaakkkaakkkakkakaaaaakakaaaakaaakakkakkakkkkaakaakaaakakkaaaakaaakakkkaakkakakaakakaakkkaakakaaaakkaakaakkkaakkakakkkakkkaakaaakaakkaaaaaaakaakkakaaakaakkaakakkaakaaaakakkakaaaakkkkkaaaaaakakaaakkakkakakkaaakkkakakkkkkkkkakkkakkkkkkakkkaaaakaakaakkkaakkaakaaakkaaaakkkakkkkaakkakakaakkkaakkkkaakaaaakkaakkkakkkkaaakkaakaaaakkakakkakkkkkaaakaaaakakakkkaakkakakaakkakaakaaaaaakakkkkaaaaakkkakaaakkkkakakkkkkkakakkakaakakkaakkkkaaaaakakkaaakkaaaakkakaakkkakkaakaaaakkakkakkkkakkkaaakkkkkkaakkaakkakkakkakaaaakaakkaaakakkkkkaaakakaaaakakaakkakakkkakakkakaaaaaaakkaakkakakkaakkaakaakakakkaaakaaaaakakakakkkakkaakaaakakkkaaaakaakakkkkkaakakkakkaaaakkkakkkkkaakaaakaaakkaaakkkkakakkaakkkkkkkakakakkkkaakaaaaakkkakkkkakaaaaakkaakkakkkaaaakaakakkakkkkakkaaaaaakkkakaaakakaaakaaaaakaakkkkaakakkkaakaaakakkakakkkkkkkaaakkkakkkakkakaaaakkkakkkkaaakaaaakkaaaaaaaaakaakaakakaakkakaakakakkkkakakakkakakkakaakaaaaakakkkkkaaakkkkkkkkakakkakkkkaaaakakakaakkkkkkakkaakaaakkkaakkkaakkkkaakakkakkkakaaakkkkaakakaakaakkaaaakkakkkaakkakakakkkkaaaaakaaakkkkkkaaaakaakkkakaakkkakkkkakkkkkkkaaakkakakkakakakkaakakkakakakakkaakkakkkakakaaaakaaakkkaaaakkakkkkakkkkkkakaakakaakkaakakkakaakakaakaaaakaakkaakaaaaaaaakkakkaaaaaaaaaaaakkaakkkkkkaakkakkkkaakkkakkaakkkkkkkkakaakaaaakkakakkaaaakakakkkaakakkkakkaakkaaaaaaakaaakkkaakaaaaakkkkakakkkkakkkakkaaakaakakaakaakkakakkakkakakaaakaakkakaaakakkakkkkaaakkkakaaakakaaaaaakaakkakaakkaaakkkkaakakkakakkkaakakaakakkaaaakaaaaaakakaaakkkakakkkakakakaakkkaakkaakkkkkkaaaakakaaaaaakakakkaakaakaaaaakakaakaakkakkkaaakaakaakkkakkaaaakakakkkkkakkkaaaakaaaaakkkkkakkkkakkkkaaaaakaaaaaaakakkkaaakkkkkkakaakkkakkkaaakakakkkakaakakaaakakkakaakkkakaaaaaakaakkkakaaaaakkaakkaakaakakkkkakakakakakkkakkakkkkkkaaaaakaaaaaaaakkkaakakaakkaakaaaakkakkakkkakkakkakkkaaakaakkkakaaakkkakakaaaaakakkakkakkkakkkaaaakkkaakakkaakaaakakaaaaaakkakaakkkkaakkaakkakaakkaakkkkakkkaaakaakakkkkaakaakakakaaaakakkkkkkkkakkaakaaakkaakkaakkaaaaakkakkaaakkakaakkkaakkkaaaakakakaakaaaakakakkakaaakkkaaakakaakakakkkkkkakkakaaaakkkakkkkkaakkaaaaaaaaakaakkkaaakaakkkkakkakaaakakakakaaakakaakkkaakkaakkkkkakkaaakakkaaaakaaaakaaakakakkaakaaakkkkakkakkaakakkaaaaaaaakakkkaakakaakkkaakakaakaakkaakkkkkaakaakaaaakaakkaakaaaakaakkkkkkakaakaaakakkaakakkkkkaaakkakakakkkakaaaakaaakkaakakkakakaakakkaakkaakkaaakkakaaakkkakkakaaaaakkkakkkaakkakkkaakaaaaakkkkakaaakkkkkkkakaaaakaaakkkkakkkakakaaaakakaaakakkkkkakakkkkkakakkkaakakkakkakaaaakkkaaakaakkkkaakaakaakkaaakkaakaaakkaaaakkaakkaakkkkaaakkkkakakakaaakkkkaaaaakakaaaakakkkkkakakakakaaaakkaaakaaakkkaaaaaakkaakkaakakkkkkkkkaaaaakkkkkakkakkkaaakaaaaaakkkkkkaakakkakkkkaakaakkkaaaakaaakkaaakakakkaakakaaakakakkkaaaaaaaaakkkkkaakaakkkakaaakakakkaaaakkaaaakkakkakkkakaaaakaaaaakaaakkakaakaaakaakaaaaakkkkaaaakkkakkaaaaakkakakkakaakkaakakaaakkaaaakkakakakkaakkkkaaaaakkakakakkkkaakkaakkkakaakkkaakkaakkakkaakaakaakkkaakakaaakakkakkkakkkaakkkakaaakakakkkaaakakkaakaakaakkakkakakaakkaaakkaaaaakkaakakaakkkkaakaakaakaaaaakkkaaakkkakkakaakkaakkkakkakkkakakakkaaakakaakakkaakakakkkakkkkakakkkkakaaakakakkkkakaaaakaaakkkakakkakkaakakkkakaakaaaakaakaaakkkaakaakaakkakkaaaakkkaaaakkaaakkaakaaakakakkaaakaaakkkaakkkakakkakkkkkkkaakakkkaakakkkakaakkaaaaakkaakaakakaakkkakakkakkkakkakkakakkakkkkkkaaaakkkkaaaakkkkakaakkkakkkaaakaaaakkkkkakkkakkaakkkaaakkaakaaaaaaaakakakakkkkkkkkaakkaakkkaakkakakaaaakkkkaakkakkkakkakkaaaakkkaakaakkkakkakaaakakaaaakaakaaaaakkaakkaaaakaakakkkkaaaaaaakkkkaaaakaakkaaaakaakkaakkkaaakakkaaaaakkkakkaakkaakakakakkkkkkakakkakakkakakkakaaakaakkkaakakakkkakkkaaakkakkkaaakaakkkaakaaaaaaaakaaaakakkaaakkkkkaaakkkakkkakaaakkkkkkaakaakakkakakakakakkaakaaaaakakaakakkaakkakaaaaakaakakakaaaaakaaakaakaaakkakaakakaakkaaaakkaaakaakaaaaakkkkaakakaaaaakaakkaaaaakkaakkaaaakkkakkkakkkaakakkaaaakkaakkkkkkkkakkakakkkaaakkaaakkakkkakaakkaakakkakkkaakkaakakaaaakkaaaakaaaaaakakkaaaakaakakkakkkkkaaakaaaakkakakkaakkakakkkkaaaaaaakkakkkakakkkkakakkakkkkkakaakkkaakkkkkkkaaakkkkakakkkaakaaaaaaaakkakkkkaakkkaaakkkkkakaakkaaakkkakakkkaakaakakakakakakakaaaaaakaaaakkakkaaakkkkakakakaaaaakkaakkaaaaakkkaakakaaaaaaakkkkkaaaaakaakakkakakakkakkkkaakkaakkakkkakaakkaakkaaaaaakkkakakkkkkkkaaakaakaakkakakkaaaaakakaaakakakaakkkaaakkkakakkkkaakkaaaakkakaaakaaaakakkkaaaaaakkkkakkkaakakkaakaakkkaakkkkkaakakkkakkkakkaaakaaakkaakakakaaakkaaaakaaakkaakkkkaakkkaaaaaakkkkakaakkkkakkkkkkkakakkaakkkkkkaakaakaaaaakkkakakkkakkkakakakakakakkkkaaakkakaaakkaaaaaakkaaaakaaakakkaakkkkakaakaakkakaakakaaaakkaakaaaakkkakkaakakakaakkkkaakkkakaakakakakkkkkkaakaakkkkkkaakkkkaaakakakkkkakaaaakaakaaakaaakakkakkakakaaaaaakkkkaaakkakkakkakakkkkaakakkkakaakkkkaakakakkaaakakkaaakkkakaaakakkkakakakkaakaakkkkaakkkkkkkaaakkaakaaaaaakakkaakaakakkkkkkakkkakkakkkkaaaakakakakkkaakkkkkaakkaaakkaaaaaakkakkkaaakkkkkkkkakakaakakakakkakkakaaakkkkaaaakakaakkaaakakkakkkakakkaaakaaakaakkakkakaaaaakkkakakkkaaaaaaakakkkaaaaakakkaakakkakaaakkaakkakakaakakkkaaaakkaakaaaakakakaakaaaakaaaaakaaakakaaakkakakkkkkakkaaakaakakkkkkkkakakkaakakkkaakkaaaakakkakkkakaakaaakakkaaakkkkakaaakkkaaaaakkkaaakkkkakkkakaaaaakkkkaaaakkkkakaakakakakkakkakakakaaakakkkakaakakkkkkkkaakakakkkaakkkakkakkaakaakkakaaakkkaaakaaaakaakakkakakakkaaakkkkaakkkakkaakkkkkkaakaakakaaaaakaaaakkakaaakkkkkkkaakakakakkkakakakaaaaaaaaakkkkakkaakkkkaaaaaaaaakaaakkkakkkkakakaaakaakaakakakaakakkkakakaaaakkkkkaakkakaakakkaaaakakaakaakkkaakkkkkakakaakkkaakakakakaaaaaaakkakakaakkaaakakkaakaaakaakkakakakkkkaaakakkaaaaakkkaaaaaaakaaakkkkkkkaaaaaakaaaaaaakaakakkkkaakkkaaaaaaakakakakkkaakaaakkkkkaakkkaaaaakkkaakkaakaaakkaaaakakaakkaakkakaakaaaakaaaaakakaaakaakkkkaakkaakaaaakaakaaaaakaakkakaaaaakkaaakaaakakkkkkakkkkkkkkakkkkkkkkakkaaakaakaaaakaaaakkkkkaaakaaaaaaakaaakkkaaakkkkkaaakkaaaakakaakkkkaakaaakkkkaakakaaakaaakkakakkkakakkakaaaaakaaakakkaaakkkakakakaakakaakkakakaaaakkakakaakakkkkkkaakkaakakakkaakkakkaakaaakkakakkkkakaaaakakakkkaakkaaakkkkakaaaaaaaakaaakaakkkakakkakakaaakakakakaakkaaaaakkaakkkakaakkkaaaaaaakkkaaakaaaaaakaakkkkakkakkkkkkakakkkkaaakkkakkkakkaaakkaakkkkakkakakkkkkaaaaaakaakaakakkaakkaakkkkaakkaakakakakaakakaaaakakkaaakkakakkakakaakakakaakkakakkakkkaakaakkaakakaakkkaakaakkakaakaakkakkakaaakakakkkakaaaakakkkkakkakkakkkkkakaaaakakaaakakkakakkakkkakakkaakkaaakakaaakakkaaaaakakaaaaakkkaakkkkkkkakakkkkkaaaaakkaakkaaakkkaakakakkkakkaakakakakkkkkkaakkkakkakkaakkkaakkkkaakkkakakkkkakkaaaakkkkkkaaaaakakaakaaakakaaakkaaakakkkaakkkaaakkkkaaaakkkkkkaaakaaaakaakkkkakaakaakkkkkkaakkkkakaaakakkaaaaakkkkkaaaaakkaakkaakaakkaaakkaakaaakkkkaaakkaaakakkaakkkakkaaaaakaakakkakakaakakkkkkkakaakkaakakakakkkaakkkaaaaaakkaakakaakaaaakkaaaakaakkkkaaakkkkakaakaakaakkkakakkkkaaakkaakaakkakakkaakakaakkkaakaakakkakkakaaaaaaaakaakakkakakkkkkakaaaakakakaaaaakaakakkaakaaakkkkaakakakkaaakakkkkkakakakakkakaakaakkakkkakkakkkakakkakakakkaaaakkaakaakkkkakaakkkkkakaaakaaakakkkaaaaakaaaaakkaakakaaakaakakaakkkaakaaakkkaaakakkakaakkakakakkaaakaakakakkkakakkkakkaaaakkkkkkkaaakakaakaakakaakaaaakakakkaakaakkakaakkkaaaakaakkkkaaakkkkkkkakkakaakakakakkkkkkkkaakkkakkakkkkaakaakkakkkkaakkaaakkkaakaakkakkakkkkaakkaaakaakkakkkkakkkkkkakkakkkkaakkkaaakkaaakkkkkkkaakaakaakakkaakaaaaakkakaakkkaakkkkkkakkakkakaakkkaaaakkkaakakkkkaaaakaaaaakaakkkkkaaaakkkaaaaakaaakaakkkkkkakkakaaaaaakakkkaakaaakaakaaakakakaakkkkakkkaaaakakkkakakaaaaakakaaaakaakkkakkaaaakakkaakaakkaaakaakaaakkakkkakkakkaaaaaaaakkkakkkakkaaaakaakkkkakakkaakkakakkaakkkaaaaakkaakkkkaaakkaaakkaaaakkkkakakaakakkakaakakaakakaakkakkkaakaakkakaakakakakaaakkaakaakaakkaaaaaaakkakkkkkkkakakakaakkaakkakaaakkkkkkakaakakkaakkkkkkkaaakkakaakaakakaakaaakkkkakkkkkkaaaakkkakaakaakkaakakkaaaaakakkkkakakkakaakakaaaaakakaaakkaakaakakkakkaakakaakaaakaaakkaakkkkakkakakakkkakaaakkakkaaaaaaaakaakaakaaaakaaakaaakakkkkkkakkaaakaakkkakakakaaakakkaaaakaakakaakaakakkkaaakkaakakakkaaakkkkaaaaaaakaaakkkaakakkaaaakkkkakkaaakkkakaaaakkkkkkakakkkkkakkaakaakkkkaaaaakkkakkkkaakaaaakkaaakkakaakkkkkaaakkkaaaaakakkaakaaakakkakkaakakakkaakkkkaaakkkaaaakakakkkakaakkkakakkaakkaaakaakakaaakakkaaakaaakaakkkakakaakaaaaaakakakkkkaakakkkakaakkkakkkkakkkakaakakkkaakkaakaakaakakakakkaaakaaaaakakkkkkakakakaaaakkakkaakakakaakaakaakkakakaakakakakakkaaakakkaakaakaakakakaakkaakaakaaaaakaaaakaakaaaaaaaaaaaaaakakkkakaakkaaakaaaakkkkkkkkakakkaakkaaaakaakaakakkaakaakkkakakkakakkkakkakkkkkkaaaakakkaakkaakkkakkkkkakkaakkakakaakakaaaaakakaakaaakkkaaaakkkaakakkaaaakaaaaakakkkkkakkakkkkkakkaakaaaakkaaaakaaaaakkkkakkakaaaakkkkkakkaaakkkakakkakkaakakaakkkaakkkaakkaakaaakaakkaaakaaakkakkkaaaakkakkaaaakkaakaakakkkaakaaaakkakaakkakakaaaaakkaakakakaaaakkaakakkakkakkakkkakkkkakkkkkkkkakaakaakkkkkkkaakakakkaakakkkakkakaakaakaaaakkkaakkkkaaaaakakkaakkkakaaaaaaaaaaaaaaakaakaakkakkkkaaaaaaaaaakakkaaaaaakakaakaakaakkakaaakakkkkakakakkkkkkkaakkkaaaakkkkkakakaakakkakkaaakkkaakaakkkkakaakaaaakkaaaakkkkkkaakaakakaakaaakkkaakkkkkkkkakkaakkkaakaakaakakakakkakkkaaakakaakkkaaakkaaaakakakakkakkaaakakkkkaaaakaaakaakkakakkakkkakaaakakakkaaakaakaakakkkaakkkkakaaaaaaakakkaaakaakaaaakaaaaakkaakaaaakkkakkkkkaaakkkkaaakkaaakkkkkkaakakkkaaakkkkakakkaaakkakakkkkaaakkkaaakkkakkaakkkkkkaaaakaakkkkaakkkaaaakaaaakkaakaaakakaakaaaaaakakkkkakakakkkaakaaakkkkakaaakkkkkaakkkkakkakkkakaaakakkaakkaaaakaaakkkakkakkaaaaaakkkkkkaaaaakaakkakkakkkaakkkkakaakakkakaaaakkkkkkkkaaakkkkakakakkkkakkkaakaakakaaaakakkkkakkkkkaaakkaaakkkaakkkkakkakkakkkakaaakakkaaaaaakkkakaakaakkkkkkaakkaaakaaakkaaaaakakaaakakkaaaaaaakakakaakkakkkkkakkkkkkkkakakkkakkakaaakkaakakkakkkakakkkkkkaakkakaaaaaakaaakkkaaaaaaakkkkakkkkakakaakakaakkaaaaaakkaakaakkakaakkkakkakkakakaaaakkakkaakaaaakakakakaakkkkkaaakkakakkaakakakkkaakkkkkkkakkakaaaakkakakkakkakakakkkkkkakakakkakaaaakkakakaaakkakakaakkakkaaakakkkkkakkakkaaakaakakkakkakkkkakkakkaakkkakkaakaakaaaakkkaakaaaaaakkakaaakakaaaaakaakkkakaakkaakkkakaaakakaaakkkaakkakakakaaakaaakaaaaaaaaaakakakakkkkkakakkaakkakkkaaakakkkakaaaakaakaakkaaakakakaakaakaakakaakkkkaakaaakakkakaakakakkkkaaakakkakakaakaaaaakaaaaakkkkakaaakakkakaakaakaaakaaaakkkkkaakkkakkakaakkkkkaaaaakakakkaakkaaaaaakkaakkkakkakakkkaaaaaakaakakakaakakaaakaakkakaakkkakakakaaakaaakkaakkkaaaaaaakkaaaaaaaakkkakakaakkkakaaaakkakkakakakkaakaakkakakaaakkakaaakkkkkkaaakaaaakkaakkkkkakkkakkaakkkkkaaakaaaakkkkaakakakkkaaakkkkakkkaakaakakkkaakkkkkkkkkaaakakakkkkaakkakkkkkaakaaakkakkkkaakakkkaakkaakkaaakkaaakakkakakaakkaaaakkkaakkakaaakaaaaaakkaaakakkkkakaaaakkaaakakaaaakakakkkakkkkaaaaakkkakkkkkaakkaakkaakakaaaakkakaakkkkakakkakkaakakakaaaaakakaakaaaakkakkkakkakkakaaaakaaakkaaaaaaaakkkakaaakaaakkkaaakakkaakakkaakaakakkakkkaakaakakakaaaakaaakakkkkkkkkkakkaakaaaakaakkakkakkakaakakkakaaaakakaaakakkakakkakaaakkakakkakkakaakakaaaaakakakaakaakakkkkakkkkakkkkkkakkkaakkkaakakaakaakkakkkkaakkaakaaaakkaaakkkkaaaaaakkkkakakaakakkaakkkkkkkkakkaakakkkkakkaakkkakaaakakkaakakkkaakaakaakakaaakakkaaaakakkkkkaaakkaakkaaakkaaaaakaaaaaakkkkkaaakkkkkaakkkkakakaakaakkkkaaaaakakaaaakakkkkkkaakakkkaaaakakaakaakaakaaaaaakkakkakkkkkkkkkkakkaaaakkkaakakakakaaakaaaaakkkkkkkaakakkaakkkkakakakkakkakaakakaaakaaaakaakakakakkkaakkaakaakaaakkkkkaakakkkkakkakaakkkkaaakkkaakaaaakkakkkaaaaaakaaaaakkaakkakaaaakaaakkaaaaakkaaaaaakkkakaaakkakkaakkaaakakkakkkkaaakkakakkaakakakaakkkkaaaaakaaakakakakkakaaaaakkakaakkkaakakakaakkaakakkaaaakaakkkaakkakaaakkkkkaaakkkakaaakakakakkaakaakaaaaakakkkakkakakakkaaakkkkkaakaakakkkaakkkkkakaakkakakaaakkkaaaakaakaakaakakkkkkakaakaakkaaakakaakaaaakakkakkaakkkaaakkaakakakakaaaakakkkkkkakkaaaaaaaakaaakkkkkkaaaakkkaakakaaaakaaaaaakakaaaakkakkkaaaaaakkakaaakkkakakkkkaaaakkkakkaaakaaakkkaakakakaakakkkakkkaakakakaakakkakkakkkaaaakkkaakaaaakakkkaakaaakkkaakaakkakaakakkkkkkaakakkkkaaaaakkakkaakakakkaakkkaaakkkakakkkkakkaakkkaaakkaakakakaakkkkkaaakkkkkkkkakkaaakkkkakkakakaaaaakkkkaakakaaakkakkaaaakkkaaaakkkkakkakaaakakakkakaaakkaakkkkakkakakakkkkakkkakkakkakkkkakaaakkkakakakaaaaaaakkkkkaakkaaakakkkakkkakkaakkakaaaakakkkkakakkakkaaakkakakakaaakkkaakkkkkkakkaakkkakkakaaakkakkkaakkaaaaakakaaakkkaaakakakakaaakkkkakkakkaakkkkkkaakkakkkkkkakaakkakkakkaaaakkakaakakkkaakaakkaaakakkakakaakaakakaaakkaaakkakaakakakaaaakakkaaakakkaakaakakaaakakaakaakkkkakaaaakkaaakkaaakkaaakkkkkkaakkakakkaakaakakkkkkkakkkkaaaaakaakkaakkakkkaaaaaaaaaakaakkkkkkkakaaaaaaakkkakakkkaaaakkkkaaaakaaaaaaakkkakaaakaaaakkkkakkaakkkaakkkaakaaaaakkakkkakkkakkaaakkkkkkkkakaakkkaakkkkkkaaaakkkaakkkkakaakaaaaaakkkakkkkaakkkaaakakkkkkaakkaaakkkkkakkaakaakkkkaaakakakakkkaaakkaaaakkaaaaaaaakkkkakaaakaaakkaakkakaaakkkaaaakkaaakkkkkkkkaaaaakkaakkkakakaakakkkkaaakaakkkkkkakakkkaakkaaaaaakkkkkakakkkkkaaakaakkaaakkakkaaaakkakaaakakaaaakakaaakkkkkakakaakkkkkaakkakakaaakakkakkkkaakkaakakakkkaakaakaaaaaakkkakakkkaakaakakkkaakaakakaaakkaakaaakaakakakkaaaakkkaaaakkkakkkaakakaakkkkkakkkkkaakkkkkkakakkkkkkkakkkakkakkkaaaakkaaakkkkkkaakaaakkkakakkkkaaakkakakakaaaaaaaaakaaaaaaakkkaaaakkaakaaaaakkkkaakakaaaaakaakaaaakakkkakakakakaaakkkaakkkakaaaakakakaakkkaakakakkakkaaaakaakkkkakkkakaaaaaaaaakakakaakkakkakakkkkaaakkakkakaaakkkkkkkaaaakkakaaaakkkaaaakkakaakakakkakakkkkkaaakaakaakkakakakaaakkakkaakakaaakkkkkkkkaaakaaaakaaakkakkakkaakakkkkkkkkaaakkakkkkakaaaakkkakkkaakkkkkkaakaaaakaaaaaaaaakkkaaakkkkakkakkakkkkakaaakkkkakaaaakkkakaaakakkakkaaakakkakkkakaakakkakakkkakkakkakakaakkkkakkakkakkaaaaakakkaaaaakaakakkakkaakakakkakkakakaakakkkkakakkaakaakakkkakkkkkaaakaaaaakkkakakaaaakakkkkaakakkaaakaakakkkkakkakakkkakakkkaaakaaaakaaaakaaaakakkaakaakkaakkkaakakkkkakakaaaakaaakaaaakkkakkaakkkkkkaaakkkakakaaaakaaaakakkaaaaaaaaakkakkakkkaaakkkkakaaakkakkkakakkakkaakkkkkaaaakaaakkkaaakaaaakaaaakkkkakkakaaaakkkaakakkkkaaakaaaaakakakakaakaakaaaaaaakakakkkakakaakkkaakkkaakkkakaaaaakaaakkakakkakkkkkaaakaakaakakaakaakkaaakakaaaaaaaaakakakaaaaakaakkaaaaaakkakaakaakakaakkaaakkaaaakkakkkaaakakkkkakaaakkaakkkakaaaaaaakakakkakkakkaaaaaakkaakaakaakkakakakakaaaakakkkaaaakkkaaaaaaakakakakkkkkaaaakakkakaakakaakkkkkkaakkkaakkakkkakaaaaakaakkakkakkaaakkkakkaakkkaakkakakaakkkakkkakkkkkaaakakakkaaaakaaaaakakaaakkakkaakakkaakaakakaaaaakkakaakkaaaaaaaakkaakaaakakakakkkkkkkkkkakakakkkaakkaaakaakaaaakaaakkakkkaaakkaakaaaaaaakkkaaakakkkkkkakkaaakaaaakkkkaaaaaakakkkkkkkaaaaaakakakaakkaaakkakkaaakaaaakkkkaaaaakakkkakaakakaaakakkkaaaakkakakkakakkkkkaaakkaakakakkakkkakkkaaaaakaaakaakkkaaaaaaakkkkkakkkaakakkaakaaaaaaaakaaakaakkaaaaakakakaakkakakkaaakaaaaaakkakkkkakaakakaaaaaaakkakakkaaaaaaaaakkkkakkakaaaakaakkakaaakkakakkkakkkakkkkkakkakkkakaakakkaaaaakkaakakkkakkakkaaakkkkkkkaakakaaakakaaaaaaakaakkkkkkaaakaaaakkakkkaaaakakkakkaakkaakkkkaaakaaakkkakkkakkkakaakaakakaaakaaakakakkaakaaaakakkkkakaakkakakkkakaaaaakkaaakakkkkkkkakkkkkkkkaakkkakaaaaaakakkaaaakkakaaaaakakaaakakkkkakakkkkaaaakkkkaaakaaakkkaaaakakkkaakaakkkakkkkakakkakkkakkakkakkkkakkkkkaakkkaaaakkkakkaakkkkakakakkkakaakakakaaakaaakaaaaaaakkaakakaaakkkkaaakkkkkaaaaaaakaaaakkkkkaakakaakkkkkaaakkkkaaaakkakaakaaaaaakaaaakakkkakaaakakakkkakkaakaakkakaaaaakaaakakkaakaaaakakkaakaakakaakakaakaakkkkkaakakkaakaaakaakkaakkkkakaaakkaakaaaakaaaakkaaaakaaakkaakkkkkkakkkkaakakkkkakakkakkaakkakaaakkakaakkakkkaaaakkakkakkkakkkkkaaaaaakkkaakakkaakkkkakakaaaaaakakkaaaakaakakkkkakakkkkakaaakakkaaakkkakakakakaaakkakakkaakkkkkkkkkakkaakaakakakakkaaakkaaakakkkkkkkaaakkkkkaaaakakkkakkkaaaaaaaakkakkaakkkaaakaakkkaakkakakaaakakkaakkkkakkakaaaakakkaaaaakkakakkkaaakkaaakkkaakakkkakkkkkakkakkaaakakkkaaakaakkkaakkaakaaaakkkkkaakkakakkkaakkkkkakaakkkkaaakkkakkakakkaaaaakakaakkkkkakaakkkkkkkaaakaaaakkakaaaakakkaakakkakkakakkaakaakkkakkkkkakkaaaakakakakkakaaaaakkkkkkkaakaakakaakkkaakakaakkkaakkkkaakkkkkkakkakaakaaaakkaakkkkkaaakkkkkaakkaakaaaaakkkakaakkkakaakkaakakkkakkakkkkkkkkkakakakkkkkaaaakaakkkkakkaaaaaakakkakaaaakakakkkkkakkaaakkakkakakkakakakkaakkkaakaaaaaaakkakaakkkakakakkaaaakkaaaakaakaakakkakkkaakkaaakkkkaaaaakakakkaakaakkkakkaaakkakkaakkaakaaakkaaaakakkakakaakkkaakaakakaakkkkakkkkkkaakkaakakkakkkkkakkaakkaakaaakakkaaaaaakkkaaaaaakkakakaakaaakakkakaaaakkkkkakakkakaakkakkakkaaakaaaaakaaaakkakaaakakkakkkkkkaaaakaakkaakakkaaaaaaaakakkaakakaaakkkakaaakkaakaaaaaaaakakakaakakaakkkakaaakkaaakaaakkaakkkkakaaaakakkkkkaaakkakkakkkakaakaakaakkakakakakkaakaaaakkkakkaaakaakkaakakaaaaakkakaakaaaaaaaaakkakkkkaakkkkakkkkakkaakkkaaakaaaakkaaakakaakakkaaaakkkaakkaaakkaakkaaakkkakkaaaakkkkakkakkaakaakkakkaaakaakkkkakkaaakkaaakkkkkkkkkkkaaakkakaaaakakkaaaaakkakkaaaakkakakkkakkkkkaakkkaaaakakakakakaakakaaakkaakkaakkaakakakkkakkkaakakakaaaakakakkkkaaaaakaakkkkaaaaaakkkakakakkakkkkkkkkakakkakkkaakaakkaaaaaakaakakkkaakkaakaaakkakkakakakkaaakkakkaakakakkakaaaaaakakaaaakkkakkkaakakakaakaakaakaaaaaakaakaaakaakakkaakkkaaakakakkaaaaaaaakakkaakkakakakakakakaakakkkkakkkaakaakkaaaakaakakkakkaakaakakakkakakkkkaakkakkkkkkaakaaakkakakaakakakaakkakkaakkakaaaakakaaaakkaaakkaaakkaakaakkkakkakkakaakaakaakakkkkkakaaaaakkkkkkakakaakkaaaaaakkaaakkkakaaakaakkkkkkakkaaakkkakakaakakaaakakkakaaaakaaaakaaaaakaakkkakkakakkkkkkaakakkakkakaakaaakaakkkkkaakkkaaakakaakkakakaakkakakakaaaaaakkkaakkkkaakkaakakakaakkkakkaakkkkakaakaakkkkkkkkakakakakkkakakakkakkakaaakakakakakkakkkaakakaaaaakaaakaaaakaaaaaaakkaaaakaakkakkkkakaaaaaaakaakaakaaaakkkkakakkkaakakkkakkkkakakakakkkkkkkkakaaaaaaaaakkakkaaaakkkakkakakakkakaaakkkkkkaaaakkkkkaakkkakkakaaaakaaakaaaakkkkakkkkkkkkakkaaakkaaaaakaakakakakkakkkakaaakaakkkkaakkaaakkakakakkakkaaakakkkaakkakaaakakkkakakaakkkakaakkkaaaakkaaaakaakkkkkaaakkkakaaaakaakakkkkakaakaaaaaakkakkkkaaakaaakkakkkkaaaakkkkkkkkaaaaaakkkkaakakkkaaakkkakaakaaaakkakakkkaakaaakaakkkkkaaaaakkkkkaaaakakkkkkaakakkaaakakakakakkkkaaaaaakaaaakkkakakkakaakkkkaakaaakkkkakkaakkkkkkkkkakakkakakakaakkakkkakaakakaakakkaakkkkkaakakakkkkkkkkaaakaaakakkakakaakkakkkkakaakaaaaaakakkkakaaaakkaaakaaakkaaakkkakkakaakaaaakaaakkakkkkkaaaakaakaaakkakkkakkakkakkkkkaaakakaakaaakkkkakaakaaakkkaaaaaaaakakaaaakaaaakkkaaakakakaaaaaakaaaaaaakakkaakaakkakkakakakkakkkaaaaakkkaaaaakkkkkaakakkkaaaakaakaakaaaakakaaaaaaaaakakaaakkaaaakakkaaakkkkaaaaakaaaaaakkakkakkkakkakkkkkkakkaaaakkaakkaaakakakaaaaaakakaaakkkkakaakkaaaakkaaakkkakkkkkakakkakaakakkakkakakakkkkkkkkakakkakaaaakkkkaaaaakkakkkakkkakkaakkkaakkkakakkkaakkkkaaakkkkakkkaaakkkkkakkkkkkaakaaakaaakakaakaaaaaaakakaaakkkakaaakaakkkaakkakaakkkaaakakaaaakkakkkkkakakkkaakkkakkkaaaaaaakakakkkakakkkkaakkkakkakkkkaakakkkakkaaakkkkaakkkakkakakaakkakakaakakakkkaakaaakakkakkaaakakkkkakakakaakakaaaaaaakkaakaakkkaakaaaakakakakkkkaaaakaaaakkkkkkkkkkakkkaaakkakkaakaakakaaaaakkaaaaaakakakkkkkkakakkkakkkaakaakakakakkakaaakaaakkkaakkkakakaaaaakaaakkkakakaaaaakaakaaaaakkakkkkkakaakakakakaakakakakakakaaaaaakkakkaakaakaaaaakkkkakaaakkaaaakaakkkkkakkaakkkakakkkaaakaaaakkkkkakakaakkaaaakaakkkkaaaaaaakakkkakkkkaakkkkakaaaakaaakakkkkakkkakkakkkakkakaaaakkaaakkaakkakaakaaakaakaaakaaakaakakkakaaaakaaaaaaaaaakkakakkakkkakkaaakakaaaakakaakakaakaakkakakkkakakaaakaaaaakakkkkakakakaakkakaakkkaakaaakakakkkkakaaaakaaakakaakkkkakaaakkakkakaakaaakkkkaakaaakaakkkkakakakakkaaaaaakkkakakkakkkakakkakakaaakakaaaakaakakkakkkakkkakkkakakakakkkaaakkkkkakkaaaaaaakakaakakakaakkakkakakkaaaakkkakakkaakkkakkakkaaaakkkakakaaakkakkkakkkkakkkkkkakkkakkkkaakkkkakkkkkakkkkkakkkakaaaakkaakkkkkkakkaakkkaakakaakkkkaaakkakkkaakkaakakkkkakkakkkkakaaaaaakaakakkkakkaakkakakaaakakkaaaakakkkkkkaakkaakakkaakaaaakkaakkaakakkaaakkaakkkakaakakaaaakkakkkaaakkakaaakkkakkakkkkakakkkakaaakakkkkkakaaaakkaakkkakkakkkkkkkakkakkkakaakkaakaaakakaaaakaaakkkkkkakaakaakkakakkakkkakkakkakakkaaaaaakaaakkakakakakkakaakaakakkkaaakakkaakkkkkaakkkkaakkakaaakkakakaaaakkakaakaaaaakaakkkkkakkakaaaaakaaakakaakkkkaakaaaakakkakakkaakaakkakakaakakakakakkkkkakaaaaaaaaaakkaaaakaakaakkkkkaaakakaakkakkaakkkkkaakakakaakakakkkkaaaakakkkkkakkkkakakkkakakkkkaakakakakaaakkakaaaaaaaakkkkakakkakakakkaaakakkkaakaakkkkkaakaakkkkkakkakkkaaakkkkaaaaakkaaakkkakkakkakakkaakkaaakakakkaaaakkakkkaaakkaaaakaaakkkaaakakakkkkkkkakakkkkaaakkakaaakkakakkkaakkkkakaakaaakakaaakaakkaaakkkkkaaaakkakkaakakkkkakaaakkakaakkakkkkkkkaakaakaaaakkaaaakkakaaaakkkkaakkaakaaakakkkkkkaakaaaaaaaakkakkaakkkaakaaaakaakkkkaaakakakkaaakkakkkaaakaaaakaaakakakkaakkaaaakaaakakkkaakkaaakkakkkkakkakkkkakkakakaakkkkkkaaakaaaakkkkakaakakkaaaakkkkaaakkaakkkakkkakaakkakaakakkakkkkaaakkakkkakaaakkakkkkkkakkkakakkkkaakakkkakkakkkkakkaakkkakakakaaaaakakkkkkaakaaakkaakaaaakakkaaakakaaaakakkkkakakkakkaaaakkakkkkaaakkkkakakaaakaaaakkaakaakaaakkakkkaaakaakaakakakkkkkaaakaaaaakaakkkakaakkakaaaaakkkkakkaakakkkakaakkakkkkkaaaakkaaaakkakkaakaakkaakkakaaakkakkkkkakkaakkkaakakakkkkaakaaakkkkaaakkakkaakkakakakakakakkaakkkkakakakkakkakkaaakkakaaakkkkakkkakakkaakaakaakkkkkkkkkkaaaaakaakkaakkaakaaaaaaakkakkaakkkkkaaakaaaaaakakkakakkkaakkkkakkkaakkaakaaakkkaaakakaaaaaakkakaaaakkaakaaakkkaaaakaaakakakkaakaaakkkkkkkaakaakkkaakkkkkkaaakkakakakkkakkakaaakaakkkkkkaaaakakaaakakakkkakakaaakakkaakkakkakkkkakaakkkaakkkkkkakkaaaaaaaaaaaaaakkkkaaaaakaakkkakkkakaaakkkkaakkkaaakkkakkaakaakkkkaakkkakakaaakkaakaaaaaakakkkkkaakkaakkkaaaakakkkkkakaakkakkaakaaakaaakkaakkaaakkkkakkkkkaaaakakaakakakaakakakkkakkkakkakkkaakkakakkkakakkkaakakakkkaakaakaaaaaakkkkaakkkkaaaakakaaakaaakkakaaakakkkaaakakakkkkkaaakkkkaaakkkakkkkakkkaakkakkakakkkaakkkkkkaakkkkkkkkakakaakaakkkkaakkkakkkkkkaaakaakkkakkakkkkaaaaaakakkkakaaaaaaakaaaakakakkaaaakaaaaakaaaakkkakaaaaaakakakakakakaakaakakaakaakaakaaakkakkkaaakakkaaaakkkaaakakkakaaaaakakkkkkakakakaaaaaaaaaaakakakkkkakakakakaaaakkakaakkaakkkkkkkakaakaakkkakkakkakkkaakkaakkaaaakakkkakkkakaakakkaakakakaaakkakaaakaaaaakkkkakkkakakaaaakkaakkakaakkaaaaakkkkkkaaaaakakkakakkaakkkkkkkkkkkkkkkkaaaaaaakkkkkakaakkaaaaakkaaaakakkakkkkakaaakakaakakaakkkakakaakkkakaakaaakaakkkakaakakkakkkakaaaakakkakaakakkaakakkakkkkaaakakkaaaaakaakkkakkkaakakaakkaakkakakkakkakakakkaaaakkakkkkkkkkkkakaakkkakkkaaaakaaaaaakkkaakakaaakkaakaakkaakkaaakakakkaakkaaaaaakkkaaakaakakkkkkaaaakkaakakaakkkkkkakakakaakakakaaaakkkkkkaakkkakaaaakkkakakaaaakkaaaaaakkakaaakaakkakkakkkaaaakkkakaaakaaakkakakkaaaaakkkakkaakaaaakkaaaakakaakaaakaakkkkkakaaaaakkkkaakkaaakakaaaaakakkaakaakakkakaaaakkakakakakakkkkkkaakkkaakkkaaaaaaakkkaakakakkkkkakakkakkkkkaaakaakakkkaaakkkakkaaaakakakakaaaaakakkkakakkakkakkkaaakakaaaaakakkaaakkkakakakakakakkkaakakaaakkakkaaaaaaakakakkkakkkaakkakakkaakakkaakaakaaakakaaaaakakkaaakkkkaaaaakakkkakakkakaaaaakakkakaakkaaakkkakkkakkkkakkakkakkaaaaaaaakkakaakaakakkkakkakkaaakkkkkakaakakkkkkakkkkkaaakakakaaaaakaakaaaaakaaakakaaakkkkaakaakaaaaakkkkaakkaaaaaakkaakkakkkakkakakakkakkkakakkkakaakkakkkaaakakkaaaakaaakkaakakakkkkkkkaaaaakkkaaaaaaaakkkkakkaaakaakakakaakakaakakkkkkkkkaaaaakakaakaakaakkaakkaaakakkkkkakkakaakakkaakaakakakakakkkkkkakkaaakkaakakakkakakaaakkkkkkkkkkakakaaakakaaakaakkkaaakaaaakkkaakkkakkakkakkaaaakakkkaaakaakaaaaaakakaaakkkkkakkaakkakaaaakakkkkakkaaaaaaakaaakakakakkakakkaaakkkakaakakaaaakkakkakaaakkakakkaaakkakkakkaaaakkaakaakakaaaaaakkaakakakaakaakakaaaakkkakkkakaakkakaaakkakkkaakkkaaaaakaaakkkakkkaaaakakkaakaaakaaakkaaaakaaakkkakkkakkkaaaakkkaakaaakakakakaaaaaaakkkkakaaaaaaaaaakakkakkaakkakkkaakkkkkakkkkkkakkkakakkkkakakakaaaakkakaakkakkaaakaaaaaakaakakaaaaaaaakkakkakakaakaakakaaakkkkakkakaakkkakkaaakakkkkkkkkkaakakakkakakkkkaakaaaaakaakkaakkkkkakaaakkkkaaakaaakaaakakaaaaaaakaakaaaakaaakaakakakkkakaaaaaaakkkaakkkkkaakakkkkakakaakaakkkaaakaakaakaaaaaakaakkkkkkkakaaakakakkkakkkakkakaakaaakaakaaaaaaakaaaaaakkkaakkaaakaaakkaakaakkkkkaakakkakkaaakaakkaaakkkakaaakkkaaaaakkakakakaaaakkaaakaakkkkkkaakkkaakakkkaaaakaakkaakkkkaakaaakkakkaakaaaaakkakkaakkakkkkaaaaakakkaaakaakaakakkaakakkkaaakakkkkkakkkkakkkkakakkkkakaakkkakaaakkkakakaakkkaakakakkaaakkkaakkkkakaaakaakaakkkakkaakkaakakkaaakkkakakkkkkaakkaakkkakkaaaaakaakkkkkaaakkkkakkakkkkakaaakaakaakakkaakkakkkkaaaaaakaakaaaakkkakakkkaakakaaakkkkkaaakkakkkkkaakakkaaaakkkkkkaaaakkaaakkkaaaaakkakkkkkakakakkkkakakakakaakkakaaakkkaakakaakakaaakkaaaakaakakakkkkkakkaaaaakkaaaakaaaaaakakakakkkkkakkkkkakaaakkkkkkkaakkakaaaakakakkkkaaaaakakkkakaaaaaaakaaakkaakakkakkkakkakaaakakakkakkakaakakaakkakkaakkaaakkkkkaakkaakaaaaaakkaaaakkkakkkkkaakkkkkakkakkakkkkkkakakaakkakakaakkakkkkkkkaaaakkaakkkkaaaakkkkkkkkkkkkkaakkaakakakkakaakakaakkkkakkkakkaakkkkaakkkakakaakaaakkaakaakkkkaakkkkakaakakkaakkaaakaaaakakakkaaakkkakkkkaaakkaakaakkkakaaakkakakkaaaaaakkakkaaakaakaaakakkkakkkaakaakkaakakkkakkkkaakkakaakkaaakakkkakakakkkaaaaaakkakkkkakaaakakkakaaaakkkkaakkkkkkaakaaakaakaakaakakkkaaaaakkkakakakkakaaaakaaaaaaakkkakkkaaakaaaaakakkakaakakakkkakakakaaakaaaaakakkakaaaakakaaakkakkaakkkakaaaaakkkkkkkkkaaaakakakkkaaakaakaakkkakakaakkakkkkkkakkkakaakkaaakaaakkaaakaakaaaakaaaakkakakaakaaakakaaakkkakkkakkkkkakakkaaakakkaaaakakakkkkkaaakaakakkaakaakaakkkaaakkakakkaaakaaakkakakkkaakkakkkaaaaakakkaaakaakakkaakaaakaaakkkkkkkakkkkkaakaakaaakaaaakkaaakaaakaaaakaakakkkakkkkkaakkaaaakkakkaakakaakakaaakkakkakakkkakakakkaaakkaakakaakaaakakakkkkaaakakakkkakaaakaakkaakkkakakkkaakkkkakkkaakkakaaakkkkaakaakaaaakkkakakkkkkakakaaaakkkakkaakkkakaakkakkkkakkaaaaaaakaaakkkkakkkaakkkakkakaaaaakaaaaaakakaakakaaakkkaakkkaaakkkkkkakkkakkakakaaakkkkakakakakakaaaakkakakkaaakaaakkaakkkakakkaakakkaakaaaakaaakkakakkkakkkaakakkaakakkkakaaaakakaaakaaakkkkaaaakkkakkaaakkaaakaaaakaakkaakkaakkkkkakaaakakaakakkkkakaakaaakkkakkakkkakakaakkaakkaaaaakaaakakakkkkkkkakakkakakakakakkakkaakakkakaaaaakaaakaakkkkakakkakkakkkkkkakakkakkakakkaakaaakkkkkakaakakkaaaaaaaakkkkaaaakkaaakakkakaaakkkaakakkaakaaakakakkaakkaakaaakkkkaaakakakakkaakkkakkkakkkkkaaaaaaakakaaakakaaaaakkakkkkakakaaakaaaaaaaaakkkaakkakkkkaakakakkaaakaakkaaakkakakkaakaaaakkkkaaakakkakakkkkkkkkakakkkaaakkkkkkakaakaaaaaaakaakaaaakkaakaakakaakkkaaakkakkkaaakkkakkakkkaakkakaaaakaaakaakakkkkaakkkkakkakakaaakaaakakkaaaakkkkkkkkkkkaakkaakkkkkakkkkkkkakakaakakaaakkkakkakkkkkakakakakkkakakkakakaakakaaaakkkakakaakkakaaaaakkakaaaakaaaaakkkkkakakaaaaakkakaakaaakaaakkkakkkaakakkkakkkkakaaaaakkkaaaakkaaaakkkakaaaaaaakkakakkkaakaaakaakkkkkaakkaakakkkkaakkkakkkaakaakaakkkkakaaakkkkkakaakkaakakkkakaaaakkakkkakkkkakkkkakkkaakaakkkkkkaakkaakakkakakkakkkaaaakkkakkakkaakkkkkakkakakkkakkkkaaaaaaakakkakakaakkakkkkakaakaaaaaakakaaaaakkkkaaaaaaaakkaakakkakkakaakaaakaaaakaakkkkkakkaaakkaaakkaaakkkakakkaakkkakkkaaakkakakkkkakakkakaakaaakkaaaakakaaaakkaaaakkkaaaakakkaaakaaaakakkakakkaakaakaakkakakakkakkaaaaaaaakaaaaakkkakakkakkaaaaakaakakkakakkkkaaakaaaaakaaaaaakaaaaakkakaakaakaaaaakakaaaakkakkakkkkaakkkkkkkkkkaaaaakaakkkakkkkakaakaaakaaakkaakaaaaakkaaaakkkaakakaakkkkkakkkkkaakaaakkkakakkkaakkkkkaaaakkkaaaakkkkkakkkkkakkaakkkkkaaakkkaaakkakakaaakkakkakakkkkaakkakaakakkakakkkkakaakakaaakakkaaaaaaaaaaakkaakkaakkkkkakkaakakkakkakkkaaakakaakakkaakkakakaakaaakkkakkkaakaaakkkaakkkkkakkkkaakkkakaakakkkaaaakakkkaakkkkkkakakakkakakkakkkkkkakaakakkaakkaakkkkkkkkaaaaakkkkakakakaaaakkaaaakkkaakkkaakkaakaaaakaaaaakkkkaaakkkkaakkkakkkkakakakaaakkakkaakkkakaaaaakakaakakakakakkkkkkakkakkakkkakkaaaaaakakkakkaaaakakkkkaakkaaaakakaakaaaakkakakaaakakkakkkaaakkaakkkkaaakaakkakkaaaakakaaakaaakaakakakkkaakaaaaakkkakkkakakkkkaaaakaakkkkkaakaakkkaaakkakaakkaaakakkkakakaakkaaaaaaakkkakaaakakkakkkakaakaakkkkakkaaakaakkakkakakakakkakkaakkaaaaaakkakkkaaakaakkakaaakkakaaakkaakkakkakakkaaakaakaaaaakkakkkkakakkkkakakakakkaaakkkaaakaaaaaakaakakkkaaaaaaakaaaaakakkkkkkkkakkakkkkaakkkaakkaakakakakaaaaakakakakkaaakkkkkkaaaakkkaakkakaaakkkakkkkaakkakakkakkkkkkakaaaaakakkkakkaakkkakkkkkaakkaakakaaaakkakakkakkaakkkaakkkkakakkkkkakakakkaakkkaakaaakaakakaaakaakaakkakaakaaaakaakkkkkaaakkakkkkkkaaakkaakakakakkakakakkakakkkkkkakkkakkkaaaakakakkkaaakakakaaakaaakkakkkakaaakkakkaakkkaakakakkkkkaaakkakkkaakkakkakkkakkkakkakakkaaaaaaaakaaaaakaaakkakakaakkakaaaaakaaaakkkaakkakkakkkaakaakkkaakkkakakkaaakkaaakkkkaakakaakakkakakakakkkkaakkkkakkakkkkakakkkakakaaakkkakakaaaakkkkkkaakkakkakakaakaakkkkkkaakaakaakkaakakakakakkkaakaaakkaakkaaaakkakkakkkkkaakkkaakkaakaaakkkkkakkaakakaakaakakkkaaakakkkkakkkaakakkkaakkaakkkkkakakkaakkkakaakakaaaaaakkkkkkkkakakkakkaaakakakkkkaaakakkakakaakakkaakaakaakakaaakkakakkkkkkkkkaaaakaaaaakkaaaakaakaakkkkkaaaaakaakkaaakakkkakkakakkkaakakkakkakaaakkkakakkkakkakakkkaaakkkkakkakaaakkaaakkkakaaaaaakakkakkkkkkakkkkakakaakkakkaakkkkakakaaakkakakkkkkkaaaakkkaaaaakkaaakkaakkakaakakkaakkaaakakkkkkakkkkaakkakakkaakakaakkkaaaakakkkkkkkkaaakakkkkakkkakakakkakaakkakaakkakaakakkaakakakaakkkakkakkkaaaakkkkkaakkkkkakkkaakkakaaakakkakkkaaakaakkaaakkakaakkaaaaaakkkkaakkaakaaakakkkkkkkakaakaaakakkkkkaakkkaakaaaaaaaakkkkaakakakkaakkkakkkakakaaaakaaaaaakakaakkaakakaaaaakkaakaakaakakkkkkakakkkkkakkakakaakkkaaaaakkaakakaakkkaaakakaakakakkaaakaaakkaaaakkkkakaakakkaakkkakakaaakakkkakakakkakkaakkaakkakakkkkaaaakkkkkkkakakkkkkakkaakakkakaaaakakakkkakkaakkkkaaakaakkkaakakakakaaaakkkakaakkakkkaaaakakkkkkkaakkkakakaaakaaakkkaakaaakaakkakkaaaakakkkakaakkkkkkaaakkaaaakaakaaakaaakakkaaaaakakkkkaakakkakakakakaakkkaaaakkaaakkkaakkakaakkkkkaakaaakaakkkkakkkakkkkakaakakkakaakaakkkkkakkkaakkkkkkakakakkkkkakkkaakkkakkkkkaakkakkkakkkakaaakkakkkkkakkkkaakkakaakkaaakakkakaaaakkakkkaaakakaaaaaaakkakkaakakkkaaakakaakkkakkakkkkkkakkkkaakkaakkaakaaaaaaaakkakaaakaakaaaaakaakakaaaakkkakakaaaaaakakaaaaaakakkakkkakakkakkkaaaakakakkkkakakakkkakkakkaakaakaakkkaaaaaakaaakakakkkkkaakkkaaakakaaakkakkakakakakaaakakkkkakakkakaakaaakaaakakkaaaaakkakakkkkakkkkkkakkaakkkkaakkkakaaakaakkakkakaaakkaaaakkaaaakaakkaakakakakkkakkakakkakkakakaakaaakakkkakkkakkaakkaakkakakakkkkkakkaakaaakkkkaaakaakaaakkkakkkkaaaakkaakkkkakkaakkkkkkakaaakkkkkaaaaaaakaaakkkaakaakkaaaaakaaakaaakkakkaaakkakaaakkkakkkkkakakkakkaakkkkaaakakkkkaaaakaakakakkakakkakaakaakkkaaaaakaakaakkkkaakkkakaakkaaakkkakkkakkakaaakkaaakaakkaakaaakkaakakkakkkakaaakakaaaakkakaaakakkaaaaakkaakkakakakaakaakkaaakakkaaaaaakkakakaakkkkkaaaaakkaakkaaaakakkaaaakkkkkakaaakaaakakaakaakkkakkkkaaakakakaakkkkaaaakkkaaakkkkaakaakaakkkakkakkakkaaaakaakkaaakkkakaakkkaaaakakkaakakkakakaakkaakkaaaakkakaakakkkakkkaakkaakkakakkkakakaakkkkkaaaaakaaaaakkkkakakkkkkakkaaakakkaakaaaakkkkakaakaaakaaakaaaaaakaaakkkaakaaaakaakakaaaaaakakaakkkkaaakkaaaaakaakakakkkkakkkakkaakkakakkkkkaakaakakakkkkkakakakkkaakakkakkkakakaakakaakkaakkkkkkaakkakkkaakakakkkaakakkkkakkakakkkkaakkkaaakakaakakkaaaakaakakakakkaaaaakakakkakakkaaakaaakkkkkkaaakaakakkakkkaaakkkakakaaakkkaaakkkkkaakkkaaaaaaakkkkkkakkkaaaakkkkkakkaaaaaakakaakakkakakakakkkaaaakkkakaakaaakkkakakaakkkakkkaakaakkakkaakakkaaaaakkakkkaakkakaakkkkkaaaaaaakkkkaaakaakkakaaaaakakkaakakkakkakakaakaakkaakaaaakkkkkaakakaaakkaaaaaaakkkaaaaaakakkkakakkakkkkkaaakkakakkaaaaakkkkkakkakkakkakkkakakakkkakkkkaaaakkkaaakakaaaaakkkkaaakakakaakkaaakakakakkakakkakakakakaaaakkaakkkakkaakkkakaakaakakkakkaaakakaakakkkakaakkaakaakaakakkaakkakakkaaakkaakaakakakkkakkakkaakkakakkakkkkkakaaaaaaakaakkkaaaaakkkaakkkkkaaakkkkkkakkaaakkkkaakkkaaakakakkkakkakkkakkkakakaaakkaaaakkaakaakakaaaaakkkkkakkaaaaaakkkakkakkkakakaakaakaakkakaakkakaaakakkkkkaaakaakakkkkakkaaaakakakkkkkaaaaakaaakakaaaaakkkaakkkakkakkkakaakakaakakkkkkkkkakakkkakkakaaakakaaaakaaakakkkakaakakaaakakakkaakkaakakkkkakkkaaakaakkaakaaaaaakaaaakkkkkkkkkkkaaakkakkkkaaakaaakkakakaaaakkaakkaakkkaaaakakkkkkkkkkkkakakkaakaaakaaaakkkakkaakaakaakaakkaakkaaakkakaaaaakaaakaaakkkakkakkaaakaaaakaaakaaaaakakkakakakaaaakkaaakkakkakkaaaakkaakkaaaaaaakakkkaaakkakaakaaakkaaaakkaakkakaaakkakaaakkkkkkaakkkaaaaaaakakkkkakakakaaakkaaakaakkaakkaaaaakakkaaakkakkaaaakkkkkaakaaakkkkkakkaaakakkkkkaaaaaaaakaakaakaakkkkkkakakaaakkkkakkakaaakakaakkaakakakakaaakkakkakkkaakakkkaaaaaaaaaaaaaakaaaaakkakkaaakaakakaaakkakkkkaakakkkakaakkaaaaaakkakakaakakakaaaakaaaakkakaaakakaakaakkkkkaakaakkkkkaaakkaakaakkkkaaaaakakaaakaaakkaakaaakkakakaaaakkkakkkkaakkkkaaakkakkaaaakaakaakakakkkakkaakkakaaaaaakkkkkkkkaaakaakakkkakakakkakaaaakakaakaaakaaakaaakaakkkakkkkakkaaakaaaaaakkaaakakakkakakaaaaaakaaakkkakkkakkkkakaakkakakakkakkakkaakakkkakkkkakkakaakkkaakakkaaakakaakkakkaaakkakkaakaakaakkaakkakaakakkakaakkkkkakkakaaaakaakaakakkkkaaakkkkkkkkkkkkaakkakkkakkakkakakakkaaakkaaaakakakaakakakkaaakkkaaakaaaaaaaakakaakkkakkakkaaakakkaaakkaakakkaakaakkaakkkkkaakkkkkaakkkkkaaakkakakkkkkkaakaaakkakkkkakkkkkkaakakkaakakkaakkaaakkkkkakakaakaaakaakkkkaaakkaakkkkkakkakaakakkkkkkaakakaaakkkkaaaaakaakkkkkakaaakakkaaaaakakaaakakkaakkkaaaakaakakaaakkaakaaaakaaakkakkaakkaaakkkaaaakakkaaaaakaaakkkkaakkakkaakaaaakkakkaakaakaaaakaaakkkkaaakkaakaaakaaakaakkakakkaakkkkkkkkakkaaakkkaaakakkakkakaakaaakkkkaakkaaaakakkaakkaakakaakakaaakkkkaakkkkkkakkkakaakaakakkkkakkkkkaakaaaakakkkakkakkkkaaaakkaaaakaaaaakkakaaakkkakkakkaaakkkaakkkaakakaakkakaakkakkaakkkkkkkkkkaakaaaaaakaaakakkkkkaakkakakaakakkaakaaaakaaaakaaakaaaakkaaakkkkkaakaaaaakkkakakakaakkkkaaaaakkkkakaaaakkaaaakakkkakakaaakakkaakkkkkakakkkakkkaakkkkkakkkakkkakakkkaaaaaaaaakkakakkaakkaakaakaakaaaakkkkkkkaakaaakaaakakaakakkkkkaaakkakkaaaaaakaaaakakaaaaakakaakkaakkakaaakkkkakaakakakaaaakkakaaakkaaaakkkaakkaakaakaaaakkakakkakkkaakkakkkkkkkkkakaaaaaaakkkkkkaakakkkkakakaakaakkkkkkakkkakkakkaaakaaaaaakkakkaaaaakakakkkakakaakaakkakaakakkakkkakkkkaakakaaaakakkaaakkkkkkkkkkkaakaaakkkakkaakaakkaakakkakakkkaaaaaaakakaaakaaakakakkaaaakkkkkaakkakakkkakkaakakakakkakkaaakakakkaakaaakakaakkaaakaaaaaaaakaakkaakkkkkakakkaakkakaaakaaakkkkkakkakkaakkakkkkkakaaakkaaakkkkakkaakaaaaakkakkaakakakakkkakaakkakkkakkkkaaakakaakaaaaakkaaakakaaakkkkkakaakakakaakakakkkkkakaaaaaakkkakkkkkaaakakkakakkkkakkaaaaaaakaakkkakakkkaakkkkkaaakakkakkaaakkakaakkakkakkkkkakkaaakkkkkkkkkkkkkkkakakaaakakkaaakkakkakaakkakaakakaakkaakkakakaaakkaaaakkkakaaaakaakkkaaakkkkaakaaaakkaakakkkaakkaaaaaaaakkaakkkakakakkakkkkaakaaakkakkkaaakkaaakaakakkkkkakakkkkakkkakaakaakaaaakkakkakkkakaakkkkakkkakaaakkaakakakkakakkaaakkakakkkkaakkakkaaakkaakakaaakaaakkakkkakkaakkkkkkkakkaakakkkakkaakkakaakkakkkkakaakakkkkaaaaakkkkkkakakkkaakaakakaakkkaaakakaaaaaaaakaaakaaaaaakaaakkkkakkakkaaakkaakkakkkaakkkkaaakaaaakkaakakakkaaakkaaaakkakkkkaakkaaakaaaakkkaakkakkkkaakakaakaaaaakkkakkkkakakaaakkaakakakkaakakkakkkkkkakaaaakkkkkaaakakkkaaaakakaaaaaakakaakakkakaakkaaaakkkkkakaakkkaakkkkaakakkaaakaakkakkkkaakaakaaaakaaakkkaaaaaakkaakkaakaakaakakkkkakkaakkkakaaaaakkkakakkkkakakkaakakaaakakaakakkkkkkkaakkaakakaakkaakkakkakakaakkkakkkkkakakakaaakaakkakkkakaaakkkkakkakaaaaakkakaakaakkkkaaakaaaaakkakkkakkkaakkkaaaakakaakkaaaaaaakakakaaaakkakkkkkaaakaaaakakkkkkaakkaakaaakkkkakkakaakaaaakaakkkkkkaaakakkkakakkkakkkkkakkaaaakkakaaakkakkkakaakakaaaaaaakkkaaakaaakaakakkkkaaakaaaakkkakkkkaakkkkkkkkkakkakkakakkaakakkakakaaaakakakaakakaakakkakkkkkakaaaaakkkaaaaaaaakakaakaaaakkkkakakakkaaaaaakaakkakkkaaakkaaakkaaaakkakaakaaakakkkaaaakkakakkakkaakkkkaakaaakkaakakakaaaakkkkkakkkaaaaaakkkkakkaaakakkaaakaaaakaaaaaaakkkaakakaakakakaakkakaakakakakaakkaakaaakakakkkkakkkaaakkkkaakaaaakaaaaaakakkakakkaakkakaakakkakakkakkkkakkaakkakkkkkkkkaakaakkkkkkkkkkkkaakkaaaaaakkaakaaaakkaaakaakkaaaaaaaakakkakkkkaakakaakkkkakakaaakkakaaakaakkaakkkkkkkakkkaaakkakkkkkaaaakakaaaakaaakaakkkakkakakkakkaakakaakaakakakkkakkaakakkkakaakaaaakkkaaakakkkakakkkkkkakkaakakkaakkkaaaakkakaakakaaakkakakkakaakkkkakkkkkkakakkkaaakakaaakakakakkaaakkaakkaaaaaakkkkakakkkkkkakakaakkakkakkkkkakakkakkaakaaakkkakkakkaaakaakkkkakakaaaaakaaakkkkakkkkkaaaaakaaaakaaaakkkkkakkkkkkkakaaakkkaaaaaakakkaaakaaakkkakakaaakakkakakkkakaakakkaaakakkkkkkakkaaakakkkkkaakkaakkakkakaaaakakakakakaaakaakaaaaaakkkkkakkkkkkkkaaakkakakkaakkakkkkaakaakaaakaakaakaaakkkakkaaakakkkaaakakakkkkkakaakaakaaakaaakkkkaaakkakaakkakkkakakkkkkkaakakkaaaakkaakkaakakkaakkaaaakaaakkkakkakaaaakkakkakakakkkkakaaaaaaaakaakkakkkaakkaakkaakkkkkaakaakkkaakakkaaakkaaakkkkakakakkakkkkakakaakakkkaaakkkakakkakakaaaaaakaakakkkkaaakaaaaakkaakkkkkkkkkakkaaakkkakkaaaakaakakkkakakakakkkakakkaaakkaakkaaaaakaakkkakaakkkkakkkkakkkakakaakkakkkaaaakaakaakkakaakkkkkkkkakaaakkakakkaaakkakakkakkaakkaaaaakkakkakkkkakkaakkakkkkakkaaaaaakakkakkkakaakkakaaaaakkkaakakakaaakakkkkakkkaakkakaakakakkakaakkaakkaakkkaakakkkaaakaakakkkkkaaakaaakkaakaaakkakkkkkaaaakakkkaaaaaaakakkkkakkkaaaakaaakakakkkkakakkkakaaaaakakaaaaakakaaakkakaakaakakkkkaaakkkakkaaaakkakkakkaakkkaakkakkkaakkkkaakkaakkaaaakkkaaaakakakakkkaaaakkkkkakakkkkakaaaaakakakakakkkkaakkkakkkaaakkkkkkaakkaakkakaaaaaaaakkkkkaaaaakaakaaakkkakkkkkkaaaaaakkakaakaaaakkakkaaakkkkakkkaakkkakakaakkakakkkakakaaakkkkkkkkkaaaaakkakkaaakakkkakakaakkkkaakkkkaakaakaaakakkkkakkkkkakkkaakakkakkkakkakkkkkaaaakkkkaaakaakkkkkaakakaakakkaakkakakkkaakkkkaakakakaakkaaaakkkkkaakakakaaaakkaakkaaakakkaaakkaakkaakaakkakkakkaaakkakakkkakaakaaakaaakkaaakakkkakakaaakkkakaakkakkakkaakaakakakkaakkkaakkkkkaakkakakkaaaakkakkakkakkkkkaaakkkaaakaakakkaakkaaakaakaaakakakaakkkakakkakaakkakakaaakaaaakakaaaakakkkakakaaaakakkkkakkkaaakakaakaakkakaaakakkakkkkakkakkkaaakkakkakkaakaakkkkaaakkkkaakkkaakkakkkakakaakkkakkkaaakkaaakakaakaaaaaaakkakaaakkakaaakakkaakkkkkaakkakkakakkaaakakaakaaakaakaakakaakaaaaaakkkkaaaakkkkaaaakakkaaakaaakkkakkkkaaaaakaaakaakkaaakkkaakkakkkkkkkkakakakaaaaaaaakkaakkaaakkaakakakkkkaaaakkaakaaakaakaakkkkaaakkakkaaakaakakkkakakkkkakkakkkkkaakkaakkkkakkakaaaakkkkkkkaaaakkkkakkaakkkkakkaakkaaakkkakaakkkkkaaakaakkaakkakakakaaaaaakakaakakaakakaakakkkakkaaakkakakaaakaaakkkaakaaakkkakkaaakkakkkkkkkkakkkkakaakkkaaaaakkkaaakaaakakkkaaaaaakkakkakaakakakakakaakkakkkkkakakkakaakkaakakkkkkakkakakakkkkkakkkakkakkkaakakkakakkaakkkkaakkkakkakkkkkaaaakkakakkkkkakkaakkkkkaakkaakkkkaaakaaakaaakkakaakkkkaakkaaaaaaaakaakakaaakkkaakkkaakaaakakkaakkakaakaaakkaakkakakkkkaakkkkakkkkkkakaakkkkakkakaakaaaaakkkakkkkaakakaakkaakakaaaakkkkkkkaakaaakakaaaakakaakaaaaakakkaaakkaaaaaaakkkaaaakakaaakkakkkkkkkkaakaaaakkaaakkkaaaaakakkaakkkaaakakaaakkakkakakakakakakakkkkkkakkkkaakaakkkaaaakakakakkkkkaakkaakkkkkaaakkakakkkkkkkaaaaakkkkkakkakaakakakaakaaaakkaakkaakaaakakkaakkaakkkkkkaaakakaaaaaaakkkakkakkaakakaakkkkkakakkkakakakkaaakkkaaakakaaaakkaakkkkaakakkkakkkkakaaakkkkkkaaaakaaakkakaakkakkaaakkaaaaakkakaaakaaakaakkkakkkaakkakakakkkaakkkkakkkaakkaaaakkaaakkkkkkaaaakakkaaaakaaaaaaakakaakkaaaaaakkakkakkkkkaaakakaaakaaakakakakakakaaaakkkaakakkkaakkkkkkaakkkkakkkakaakkaaaakakkakkaakakkakakkkkaakkakkkkaaakaakkakakakkaaaakkaaakakkakakakaaaaaakkakkaaaaaakkaaaakkkakakaaaakakkkkakkakkkakkkakaakaakakakkkkkkaaaakkkaakaakaakakaaaakkakaaakakkaaaakkakakaakkkakaakkkaaakakkkakaaakakakaakkakkaaaakkaaaaaaakkkaakkakkkkkkakaakkakkakaaaaaakaaakaakaaaakkkkakakakaaakkaaaaakkaakkkaakkkkkkaakaaakkkaaaaaaaakakakkakakakaakaakakkkaaaakkkkakakkaakkkakaakaaakakaakkkakkkakkaakaakakkkkkaaakakaaakkkkkkkakaaakkkkkakaakkakaakakkkaakkaakakakkakaaakkkkaakkakkkkakakakkakkkkakkkkkakkkakakkkaakakaaaaakaakkkakkakaaaaaaakakaakkakaaakkaakkkkakaakaaakakkakkkakaakkkaaaakakkkaaakkkkkaaakkkaaaakaaakakkkkkaaaakkkkaaaakakkakakakaakaakakakakkkakaaakakkakaaaaaaakkakakaaakkaaakaakaakkakkaakakkkaaakkkakkkkakkakaakakakaakkkaaaakkaaakaakkaaaaaakkakkakakkkkkakkkkaakakkkaaaaaaakkakakakaaakakakakkkkkkkkkaaaakaakkaaaakkkkkkkkkakkkaaakaaaakakakkkakkakkakakakkakaaakakakkkkaaaaakkaakakkakaakkkkakakkakkaaakkaaaaakakakkaaakkakakakakkkkkkkaakakakkaakkkakaakkakkkakkaakakakaaaakkkakaakkkkkaaakkkkkkkakkkaaaaaaakkkkkkakkkkkkkakkakaaaakkaaakkkkkkkakakakaaakkakkkaaaaakkaaakkkkkaaakkaakkakkkaakkkkakakkaakkaakakkakkkkakkkkkakakkkakkaaaakkaakkakkkkakkakkkkkakkaakakkkkkaakkkakkkakaaaaakaaaaaaaakaaaaaaaakaakkkakkakkkkakkkkaaaaakkkakkkkkkkakkkaaakkkaaaaakkkaakkkkakakkaaaakkakkkaaaakkakakkkakkkaakakaaakakaakakkkkkakkkakaakkkaaakakakakkakakkaakakakkkkaakakakkakaaaaaakkaakkakakaakkaakaakkakkkaakakaaaakakkkkakakaaakkaakkkaaaakakkkkkkkkakkkakkaaakakaakakakkkakakakakkaakkkkkaakkaaakakkaaakkkkkkkaaakkkakkkkkkakkaaaakaakaaaaaakakaaaakkkaaakaaakaakkkaakkaaaakaakakaaaaakkkkkkakkakkakaakkaakkaaaakkaakkakakakakkakakkkkakaakkkaakakaakakakkakakakkaakakaakaaakkakkaakkakakkaaakkakkaakakkakkaakaakakkkakakaaakakkkkakaaaakaakaakaaaaakakkkkakakkkakaakakaakaaakakaakkaakkkakakkkakaakkkkkakakkkkkaaakkaaaaaaakakaaaaakkkkkaakkaakkkaaakkakakaaakaakkakakakaaaaaakkaaakaakaakkaaakkaaaakkaaakakaaaakaakkkkaaaaaakkkkkakakkakkkakakkkaakkkakaaakkaaakkkaaaakkkkaaaaaakkkakkkkakkaaaakakkakkaaaaaakkaaaakakkkakaakkkkkaaaaakkkkkaakkaakkakkaakkkaakkakkkaaaakkkaakkkakaakkaaakaakkkkkakkakaakakakkakaaaaaakakkaakkakakakaaakkaaakkkkkkaakkakakkakkkkaakkkkakkaaaakkkaaaakakkakkakkaaakakaaaakkkaakkakkaakakaakkakakkaaakkakkakaakaakakkkkkkkkakkakaakakaaaaakakkkkakakakkkkkakkakaakkakkkaaaakkakakaakkkakaaaaakakakakaakakkakkaakaaakaakaaakakaakakakaakkkkaakkakkaaaakakkaaaaakakkkakkkakaaakkkkkakkkkkaakkakakkkakkakakkaaakkakkkaaakkkakaakakkaakakakaakkkakkakakaaakakaaakaakkkkaaaaaaakkkakakkakkakakkakkkkakakaakkakkaakakkaaakkkkakkaaaakkkaaaaaaakaakakkakakakaaaaaaaakkaaakaakaaaakkakkaakaaaakkaakkkaaakkakkaakaakaaaakkaakkkakkaakaaaakaaaaaakaakaaaakkaaakkkaakkkaaaaaaakkakkakkakaakkakkkkkaakakkaaakkaaaaaakaakaakakkaaakkkkaaakkakaaaakkkkakkkkkakkaaaaakkkkaaakkkkkakkkakkaaaaaakaakakkkkkkakaaakkakkkakkakkkakakakkaaaakaaakkkkakaaakakakkkkkakakkkkakkaaakaakkkkakaakkakkaakkkakkakkkaakaaakaakaakkkkkkkkaaakaaakaakkkkakkaaaakakaakkaakakaakkaaakkkkkaakkaaaakkkaakkkaakkkkaaaakakakkakaakakkakakkakakkaakaaakkakkaakakkakakakakkkaakkakkakkaakkkkkkkaakaaaaaaakakakakkaakkaakakkkaaaaaakakkakaakkaaaaaaakkkaakakkakkakakkakkkaaaakaaaaaakkkkaaakakkakkaakkakaakkkkkakaaaakakaakakkakakkkkkakakkkaakkakkakaakaakkakakkakkkakkkaakkaaaakaakakakaaakakkkaakaakkkkkkkkakkakkakkkkakkkakkkakaaaaaakaakkkakkaaakakakakkkakaakkkkakkakakkakkakaaakkkaakkakakaakkkaaaakkkkkkkakkkaaakkakaakkkkaaaakaakkkaaakakkkkaaaaaakakaaaaakaakkakkaaaakkkkkaaakaaaakkakkkkaakkkaakakkaaaaakkkaaakkkkkakaakkakkkakaakaakkakakaakkaaaakkkaaakkkkakakaaakakkaaakakaakkaakkkakkakakkkakaakkkakkkakkaaakakakkakkkkkkakakaaaakkakaaakakkaaakaaaakaaakakkakaaakkaakkakkakkakakakaakkkakkkkkakaaaaakakakakkkkaakaakkakakakkakkakkaakakakkakakakakaakkkakaakkakkakkakakakkaakkakkakkkkkakkkkakkakkkkkkkkkkkkkkakaaakakkaakkkakkkkaaaaaaaakakaakkaakkkkakkakkakaakkakkaaakakaakakaaakaakaaaaaakkkkakaakkaakkaaakaaaaakaakkaakakakkakakkkkkakakkakkkaaakkkkaaakkakaakkkkakkkkkakaaaaakaakaaaaakaakkakkkkaakkkkakkkkkaaaakaakakkkkaaaaakaakkkaaakakaakaakkakakkaaakkaaakkaakkakkkakkaakkkakkkaakaaakkkkaakaakkkkaakkakkakaaakkakkkkaakakkaakakakkkkkaakkakakakkkkaakkakaakaakaakaaakaaaakaaaaaaaakakkakkaaaaaaakkakakaakkakaaakaakakkakkakkkkaaakkaaaakkkkkakaakkaaakakkkkkkkkkkkkkkkakkakkaakaaaakkkkkkkkkkakaakkkkkkakakkakkakkaakakkkakaaaakakakaaaaaaakkaaakkkkaaaaakakakkakaakaakkkaaakkakkaaaakakkakkkkaakkkkaaaaaakkakkakakkakkkaaakkaaaaaaaakaakkaaakkakkakkakakakaakaaakkkakakkaaakkkaakkkkakakakaakaakkkakaaaakkkkakkkakkaakakaakaaakakkkakakaakkkakkakkakaaakkaaaakakkkkkkkakaakkkakkakkkkakkkkkaakkakkkkaaakaaaaakkkaaaakkkaakkkaaaaaakkakaaakkkaaaakakaakkkaakakaaaakkkaaakkkaaakaakkaaaaaakkkkakkaaaakkaaakkkkakkkkaakkakkkakakkakkkkkkakaaaakakakaaakkakkkaaaakakkkaaaaakkaaaakaakaaakakkkakaakkaakkkkakkkaaakaakaakkkkkkaaaaaakkkkkakkaakaakaaakkaaaakakkakaakakkkkaaaaaaaakkkaaaakakakaaaakaaakkakkakakkkkakaaaakaaaaakkkaakkkaaakkaaaakaakaakaaakakkkakaakkkkkkaaakakkakkaaaaaakkaakkkakkkaakkkkkakakkkakaakkkkkkkakakakkaakaaaaakaaaaaaaakakaaakaakakkkaakkakaakaaakakaaaaaakkaakakkkkkkakkkaaakkkkkkkaaaakaaaakakakkakakkaakkkkkkaakkakkaakakkaaakaakaakakakkkkaakaakkakkkkakakakakkaaaaakkkaakakaakkakakaaakkaaaaaaakaakakkkkaakakaakaakakakaaaaaakakakaakakkkkaakakakkkaakakakkaakaakkkakaaaaakaakaakkkakkakaakaakaaaakaakaakkaaakaakkakkakkkkaaakkakkkkkkaakakkkakakkkkkakkaaakakkaakkaaakakkkakakkkaaakkaakakakakkkakkkakkkkkkkkkkakakakaaaaakakaakkaakaaakkkakaaakakkkkakkakkaakkkakakakkakkakkakakkaaaakkakkkakaakakkakakaaaakkkakaakakakkakkkkkakkkkkaaaakakkkakaakakkakkakkkakkkkaaaaakkaaakaakakkaaaaakkkkkakakaakkaakkkkkkaakkaaakaakakaaakkkkkkakkakakakkakakkkakkaakakkaaakakakakkkakkkaakkaaakkkkkkkaakkkkkkkkaaakakakkaaakakkkkaakaakakakaakkakkaakakakkkaakakkkaaaaaakkkakkkkaakkaaaaakaaakaakkaaaaakkkakkkkaaaakkakakaaakkkaaaakaaakkakkakaaakkaaaaaaaaakkkakakaaaakkaakaaaaakkakkkaakaaaakkakaaakkaakkaakkkaakkkakaakakakkaakkkkaaakkaakakkkakkkkkkaakkkakaaaakakkkkaakkkakakkkkakakaaakaaaakkkkkaaakaaaaakkaakkaakkakakkkkaakakkaaaakakaakaakkakakakkkkkakakkakkkkaakaaakaakaakakkkkakkkaakkkkkkkkaaakakkkakkkaaakkkakaakkakaakkakkakaakaaakkakkakakakkkkakkkakaaaaaaaaakaakkakkkkakkaakaakaakakkakaakakkkkakakkkakaakakaakakkkaakakaakaakakkakakkkkkakakakkakkakaaaakaaaakaaaaaakaaakkaaakkakakkakkaakaaaakkaakkakkkkaakkkaaaakkkkkkaaaakakakkakaakkaaaaaaaakaakkakaaaakaakkaaakakkkakaakkakaaakkakkakkakakkkakaakkkkakaaaaakkkaakkaakkkaakkkkkakkkkkkaaaaakkkaaaaakkaaaakakakkakkaaaakkkkkakakkkkakaaaaaakkakaaakkkkakakkakkakkakkkkkkaakaakaaaaaaaaaakaakkkkaaakkakakakakkkakkkkkaaaaaaakkakaakkaaaakakakaakaakakkakakkkakkkkakkakakakaaakkaakkakkakkkaaaaakkakaaaakaakakkaaaakkkaaakkakkkkaakaaakkkkkkakkkkkaakkaakakkkkakkkaakkkkkaakkkkkkaaakakkkaakaakkaakkkakaakaaaakkkaakakaakkakakakkaaaakkkkkakkkakakakaakakkkkkaakakkaaakkakakakkaakkakaakkkkakkaaakkaakakkkaaaaakkkaaakakkkakakakaakkakkakkkkkakaaakaakakakaakkkaaaaakkakkakaaakkaaaaakakkaakakakkkaaakkkkakkakkakkakaaaaakakkakkaakkkakakkakkkkakaakaakkaaakkkaakkakakakakkkkakaaaaaakaakkkkkkkkakkkaaaaaakkkkaaakkakakkkkakkkkkkakakkkkaakaaakkkkkkaakakkkaaakakaaaakkkkaaakaakkkakkkaaakkakakakkakaaakaaakkakakakkakaakaakaaakkkkaaakkakkkkakaaakkakkkaaakkakkaakakkakaaaaaakkakaaaakkkkkaakaakkakakaakkaaakkkaaakakaaaakaakkaaakkkaakkakakakkaaaaakkkaaaaaaaakaakkkaaaakaakakakkkkkaaaakkakakkkaakaakkkkaaakkkkaaaakaakakkkakakaakakkkaakkaaaakaakakakaaaakaaakaakaakaaaakakkkaaakakakakkkkkkkaaaaakkaakkkakaaakaaakaakkaakakkkkakaaaakakaakaakkkaakakakakkkaaakkaaaaaakaakkaaakaakakkkaakaaakkaakkkkkakakkkaaakkkakakakakkkaaaakaakaakkaaaaaakkaakaaaaaakakkaakaakaakkkkaakakkakaaakkakkaakkkakaakakakkakkakakkkaakkkaakakkakakakkkkakaakkkakaakkakkakakkkakakkakkaaaakakkkkaakkkaakkkaakkkaaaaaakkaakakaakkakkakaaaaaakaaaakkkkkakkaakkaakaaakkkkkkkkkkakkaaaaaaakakkkkkkkaaakakaaakkkkaaaakkkkakkkkkkkaaakakkkakkkkaaaakaakkaaakkaaakkakkkkkaakaaakaaakaakkkaaaaaaaakakkaaakkaaaaaakkkkaaakkaaaakakkakkkkkkaaakaaaakkaaakkkakaaaaakkaakkkaaaaakaakkakkaaaakkkakakakaaakkkaakkkkaakkkkkkkkaaaakakkkakkkaakkaakakkkaaakkkkaakkkaaaaaaaakkkkkaakkaaakakakkakaaaakkkakkaaaaaakakaaakkaakkkkkkaaaaakakaaaaakkkakkaakkkaakaakkkkaakakkkakakkkkakakkkaaaaakakakkaaaaakkaakakakkkakaakaaaakkaakkakakaaakkakkakkkkkkaaakakaaakkakkakaaakkakkakakkkaakkakkkakkakakaakkkkaaakkkkaaakaaakkakakkaaaaakaaaaakkaaaaaakakaaaaaaakaaakaakaaakkkkaakkkaaaaaakkakkkaaakakaaaakkkaakakakakkkkkkkkkakkkkkkkaaakkkkaakkakkkkkaaaakkakakkkkkakkakkkkakaaakakakakakkkaaakkaaakakkkkakakakkaaakkakakaakaakkkkakkaaaakaaakakkkkkkkkkakakakkaakaakakaaaakkkaakaakakkkaaaaaaakkkkaakakkkkaaakkkkaakakkakakaakakaaaaakkkakkakkaakakakakkkaakaakkakakkkaaaaaaaakkkakkkkakkkaakaakaakkakaaaaaaaakkkaakaaaakakkkkaaakaaakkaaaaaakkakkkkakkkkkkkkkaaakkkaaaakaakaakaaaakakkkaaaakakkkkaaakakkkakaakaakkkakaakaaakakkakaakakaaakaakaakakakkaaaakaakaakaakkkkkakaakkkkkakkakaakaakkakakaakaakakakkakaaaakakaakkakkakaaakaaaaakkkakkkkkaaakakakkkkakaaaakkakaakkkakkakaaaakaakakaaakakaaakkkakkkkakkkkakkkkakaakkakkaakkaaakkakaaaakakakkkkakkkakkkkaaakaakkaaaaaakkkaaakakakkkkakkkkakaakkkkkkkkkaakaakaaakkkaaaakakkkaakaaakakaakaakkaaaaakkkkakkkaaakkkakkkkakkkkaaaakaakakkkkaaakkakaaaakkkakkkkkakakakakkakkakkkkkkkakakaaakakakkaaakkaaakkaaakakkkkkakkkaakakaakaaaaakkkakkakkakakkakkaakkkakakkkkkkkkkakakakkkkkakkaakkkkkkaakakkakkakakkaakkkaakkkkaakaaakkkakaaaakakkkaakkaaakakkkkkkkakakaakaakaakkkkkkaakkakkakkaakakakakakkkkakaaakkkkaaakkkkkkkakakakaaaaakkkkakaakakkakakkaaaaaakkaaakkaakaaakakkkkkakkaakaakaakkkaaakaakkaaakkaakakakkaaakaaakaaaaakkkakakaakkkkakkkkkakakkkaakaakkakaakkakkakakkkkkaakakkaakkkkkkkkaakkakkkakakakaaaaaaaaaakakakaaakkaakkkakkakkkkakkkaakaaakkkaakkakkkkkkkaaakkkakaaaaaakaakkkakkkkaaaakkkkkkakaaaaaaakkkkkkakakakkaakkkaakaakkkakkkkaaaakkkkkakaaakakkakakkkakaaakkkkaakakaakakaaaaakkkaakkakakaakaaakaaakkkkkakkkakkaaakkkkkkkaaaaakaaakkakaakkakkkkkkkkakkkakkaakkkkkakakakkaakakaakkkakkkkkkaakaaaakakkakakkkkkkkaakakaakkkkkkkkkaaaakaakakkkkakkaakakkkaakakaaakaaakaaaaakaakaaakakkakaakkkkkaakkakaaakaakaakkkaaaaaaakkakakkkakakkkkkkkakkaaaaaakkkakkkkaakaaakkkkakaakaakkaakkaaaakkkakkkaaakaaakaaakakkakkakakkkakkkakakaakkakkkkakaaaakakkaakakaaakakkkkkaakkkakaaaaaaakaaaaaaaakkaaakakkkkkkakaakkkkaakakkkkkakakkkakaaaakakaaaakkkkaaaakkkakkkaaakkkkakaaakkakkaaakaaaakakaakaaakaakaakaaaakaaaaakkaaakkkkaaakaakkaaaakakakaaakakkakakakkkakkkakkkkkkkaakkakakkkaaaakkkaaaaakkkkkkkakkkkaaaaakkakakkaaaaakkkaaaakkkkaakakkakkkkkkakkkkakaaakakkkakakaaakaakkakkaakakkkkkakkkakaakkakkkkakaakkakkakakkakakkakkaaaaakkakaakkakkkakkaakkaaaakakkkaakkakkkkakkkkaakkkkakkkaakkaaaaaakaaaakkakaaaakakaakaakkaakakkkaakakkaakaaakkkkaakaakaaakaaaaakkkkkkaaakkakaakkaaaakakakkkkkkakaakkkkakkakaaaakakaaaakakkkakaakkkaaakakakakakkkaakakaakkaaaaaaaaakaakkakkakakakaakkkaakkkakaaaaaaakkkaaaaakkkkakaaakaaakkkkkkkkaakaakkaaakkkakkaaakkaakakakkkakaakkaaaakaakakkkkakaakkkkkaakakaaakkkaakkkaaakkakaaakaaaaakaakaakkkakaaakkkakkaaakkaakkakkkkaaaaakkaakakaaakkaaaaakakkaaaakkkaaakaakakaakkkkkakakkaaaaakakkaaaaaaakkkakkkkaakakkkkakaakkakaakaakakaakkakkaaakaaaaakaakkkkakakakaakakkkkkaaaaaaakkakkakakkaaakkakakkaaakkaaaakkaaaaaakaakakkakkkkaakkaaaaakkkaaaaakkaakkakkkkkaaakakkaaakakkaakkakaaakaakaaaaaaaaakakakaaaaakkkkakkaaaakaakkkkkkakaakakkkkakakaaaaakaakkkaakaakakaakakakaakkaaakkakkkkkkkaakakkaaakakakaakkkkaakkkkakkakkakaakaaakkaakkkaaaakkkkkakakaakkakkaaakaakkkaakaakkaakkakkkaakkkkakaakakakkaaakkakkakakkaaaakaaaaaakkaakkakaakaaaaakaakkaakkakkkakaakkkkkkaaakkkkkkaakakakkakkkakaakakkkkaaaaakakaakakkaakaakaakkkakkkkkakkkkaakakkkakaakaaaaaakkkkakkaakkakaakkkkkkkkakaakkakakkkaaakakkkaakkakkkkkkkkakakakkakakkaaakakkkaakkkakkkaakkaaaakakkkkakaaaaakkkaakaakaaakakkakkakkaakakakakaakkakkkkaaakaakkkakkaakkakakkkkkaakakkakkkkkkkkkaakaaaakkaaaakaaaakaakkaaakkkakkkkaakkkakakkakaakkkkaaakkaakkkaakkaakkkaaakaakkkkaaaakaakaakkakkaakaakkkakkaaaakaakkkaakkkaaaaaaaaaaakkkaakakkkkakaakkkkkaakaakkkkaakakaaakaaaaakkaaakkkkakakakakakkakakkkaakkaakkaakkakakaaakaaakkakakakkkkakakaaaakkkkkakkaaaakkkkkkaaakakakaakaaaaaaaakakaakaaakkakkaakkkkkkakkakaaakkaakkakkkaakaakakakaakkkaakaakkakakaakakkkkkkakakkkkaaakaaakkakakakkakkakkakkkkkkakkakkkakkakaakkaaakkkakakaakkkkkkkkakaakkaakakakakakakakkakaaaakaaakkakkaakkkkakkakaakaakkakkakakaakakaaaakkaakaaaaaakkakkkaakakakkakakakkaakaakkaakakkkkakakkkkaakkkaakkkaakkakkaaakaakaakakkakkakkakaaaaakakkkkkaaaaaakakakkaakkkkkkaakkkaaakakkkakkaaaaaakaakkkaaakakakkakakkkakaakakkkkakkkkakkkkkakkaaakaakakaaaaaakkakaakaakakkakkkakkaaaaakkaaakkkakakkaakakakkaakakakakkkkkkaaakkaaaakkaakkakakakkaaakaakkaaaakakkakkaaaaaaaakakakakaaakakakaakaakakkkakakakakaakaaakkakakkkkkakkkakkkkakkkkkkkaakkkkakkaakaaaakakkkkkkkakkakkakkkkaaaakakaaakkakaaakaaaakakakakaaaaaaaakakkkkkkkkkaakaakkkkaaakaakakakaakakkkaaaaaakkkkaaaaakkaaakaakakkkkakkkakkkkaaaakaaaaaaaakaakkkaakkkkkakkakakakaakaaakakkkakkaaaakkaakkkaakakakaakaakkkakaaakkaakakkkakaaakakakkaaakakkaaakkkkaakkkkakkaaaaakkkaaakakkkkakkakaaaakakkakkkkkkaakaaaakkkakkkaakaaaakkkkaaaaaaaakkkkkkaaaakkakaaakkkaaakakkakkkkaakakaaakkakkkakkaaaaakkkkkaaaaakkkkakaaaaakkakaakkkakakakakaaaakkkkkkakkkkaaakakaakakkaaaakkakkkaaaakaakkaaaaaaaaakakaakakakakkaakaaakakkakakkakaakkaaaaakkakakaaaaaaaakkkakkkakaakakakkaakaaaakakkakkkkkkakaaakakkkkaakkkakkkaakkkaaakaakakkakkkkakkkaakaaaaakkkkakkakkkaakaaakaakaakaaaaakkkakakkakkkaaaakakkakkkaaakkkkkkkkakakkkkakkkkaaakkkakakakkkkkkakkkkkkkakaakkakkaakaakakakaakaaakkkkkaaakkkkkaaaaakkakaaakkkkakkakkakkkkakakkkkkkkkkakakkkaakkkkakaakkkaaaakkkkkakkkkkkaakaakaaakaakaaaaaakaakkkkaakkaakkkakakakkkkkkakakkkaaaakakkaakkkkaakkkaaakaaaaakakaakakkakaakaakakakaaaaaaaakakaakakkkkaaaakkkkkaakaaakaaakaakkaaakkaaakakaaakkaaaakkkaaaakaaakkkaaaaakaaaaaakkakkkakkkakakkakkkkkkkakakkkaaakakkkakkaaakkaakakkaaakkkakakkkkaakaaaaakakaaakkaaakaaakkkkkkkakakaaakakaaaakkaaakaakaaaakkakaaakaakkkaaaakkaaakaakakakkaakakakkakakaaakkakkkakaakaakkkakaaaakakakakkakakkkkkkkaakkakkaaakkakkkkakakakaaaakkkkakkkkaaaaaaaaaakaaakkkaakaakkakkakakkkkkaakkkkkkakakaaaaaakakaaakaaakkakkakakakaakakkkakkkaaakkaaakakakkkkkakkkaaakakakkkkkakkakkkkkaakaaaaakakkakakakakkakakakakakakkkkkkaakaakkakkakkkkkaaaakakkkaakkkkakkaaaaakaakkaaakakaaakkkakkkkaaaaakakakkaakkkkakkaaaakkkkkkkakaaakaaaakkaaaakakkkkakkkakaaaakaaakaakaaakaakakkkkaakkkaakkaakakkakkkakkakkkakkkakkakaakakkkkakkkkkkkkkkaakakaakaaakaakkkakakkkkakakkakakkakkaakakaaakakakkkakkkkkakaaaakakakakkaakakkaaakkakkkakakaaaakakkkkakkkakakkaaaakakkkaakaakakkakkkaaaakkakkkakkaaaakakakakaakkkkkkaaakakaakaaakakaakakakkkakakkkkakkakaakaaakaaakaaakakakakaaakkkaaaaakaakkkkkkkakakkakakakkaakaakakaakkkkaaakakaakkaaakaakaakkkkaaakakakkkaakaaakaaaakaaaaaakaaakaaaakkaaaakaaaaakaaaaakaaakakkkkaakkaaaaaakaakkaaakkakakkaaaakkkaakaaakkaakkakaaaakaakaaaakakkkkkkakkakaaakaakkaakakakkkakaakkkkakaaaaaakkaakkakaakkakkkkaakkaakkakaakkkaakkaaakakkakakkkkaakaaakkkaakakkkaaakaakaaaakakaaakakkkakaaaaakakkkkaakkaaakaakaaaaaaakaakaaakakkaakkakkkakakkkkakkkaaaaaakakkakkaakakaakaaakaakaakakaakkkkkkakkkaakakakakaakakkakkakaaakkkakaakkaaaaakkaaaakkaakakkkaakakakkkkaakakkakkkkkakkaaaaakaakakkkkkakkkakakkaaaakkakkkkakaakakaakkakkaakakakkakakakakaaaaakakkkkkkkkkkaakkkkakkakkaaaaakkkakakkaakaakkaaaaakkakakakkakakaaaakkkkakaaaaakaaaakakaaakakaaaakkakakakakkkaakakkkkkkkkaaaakakaakakakaakkkakaaakkakkaaaaakkakkaaaaakaakaaakkkaaaakkkkkaakkkaaakaakaakakaakkaakkkakakaakkkkaakaaakkkaakkkkakkkaaakkkakakaaaaaaakakaaaakkkaakakkkaakakaaakkaaaakakkakkkakakkkakkaakkkaaaaakkkkaakaakkakaaaakakkkaakakkaakaaaaaaakkakkakkkkaakkkkaakakkkkaaaakkaakkakkkakaaaaaakkakkkkkkkkaakaakkaaakkakkkkakkaaaakkkakakaakkkaakaaakkkakkkkakkkakakaakkaakkkkakkkakaaakkaakkkaakaaaakaakaaaakaakakakkaaaaaakkkakkkkaaaakakkakaakkkkaaaakkkaakkaaakaaakakkaakakkakaakaaaakkkaakaaakakkkaakaaaaaakaaakakaaaakkakaaakaakaaaakaakkaaakakakakkkkkakaaaaakkakkkaakkakkkkakaakkkakakkkkakaaaakakaakaakkkkaakaaaakkkaaaakakakkkakkkkaakkakkakkkaakaaakkkakkakkakakaaaaakkkakkkkkakkaaakakkaakakkkkkaaaakaakkakaaakakkaakaaaaakkkkaakkkkaakaakkakkaakkaakakkkaakaaaaakaakkaaakkakakaaaakkakkkaaaakkkaakaakkaakakakakakakaakkaaaakakakaakaakaakkkaakakkkaaaakaaakakaakkakkakkaaaaaaaaaakkkkkakkaakkaakkakkkkkkkaakaakkaaaaakkkakkkkkkakaakakaaakkaaaakaaakkaakkakkkaaakkkakakkkkkkaakakkkkaakkakkkaaakkkkakkkakakaakkakkkaaaaaaakkakkaaakkaaaaaakkkaakakakaaakaakakkkakkaaaaaakkkkakakkkakakaaakakakkkakaakkaakaakaaaakakkaaakkaaaaaakaakkkkkkkkkkkkkkaaaakkkkkakkaaakaaakakkkaaaakkaaakkkaaakaakkakkaaaakkaaakakakkkaakkakkkkkkakaaaaakkaakkaaakkkkakaaaaakakkaakaakkakkkakkkaakkaakkkaaaakaaaaakkkkakakkakakakkakakaaakaaakaakaaakkaakakaaakakaaakkakakaaakkakkakkkkkkaaaakkaaaakkkkakakkkakkkaakakkkakaaakkkakakaaaaakkkaaaakkkaaakaaaakaaakkaakaakakaaakkaaaaaakkaaaaaaaakakakkakkaaaakkaaakaaaaaakkkakkaaakaakaaaakkkkkkakaaakakkkkkkkakkkkakakaakkkkakkkkkakkkkaaakakkkkkkakakakakakakkakkakakkakkakkakkkaakaaakkkakaakkkkaaakkkakaakakkkkkakaaaaakakakakkkkkkkkkkkakakaaaakakakakakkkkaakakkaakkaaaaaaakakkakkaaakaakaakaaakkaakkaakkkkakaaakaaakakkakaakkakakakkkaakakkkakkkkkaaaakaaakakakkkkaakkaakakkaakkkkkaaaaaakkkkkakaakakaakkaaaaaaaaaaaaaaaakkkkkkkaaaaakakkaakkkkkaakkkkakaakaaaakakkkakakkakakkaaakakakkaaakakkakkkakkaaakakkakaakaaakakkkkakaakakkakaakkakaakaaaakkkakaakkkkkakkaaakaaakkakakkaakkaakakaakaakakakaakkkkaakaaaaaaaaaakakkaaakaaakkkkakkkkkkaaakkakakkkaakkakkaakkaakkkakakaakkaakkkkkkaaakkkakkakaaaaakkkkaakkakakkaaaaaakakakakkakakakkkkaaaaaakkaaakakkkkaaakakakkkkaakkkkkkaakakkkakkaakaakaaakkkkaaakakkkakkkaakakaakkkkkaaakaakkakkkkaakkkkakakkakkkakkaaaaakakkkkkaaaakkaakkkakakkkkkakaakkakkakaakakkkkaakakakakakaaaaaakkaaakkaaakkkkkkkaaakkakakaaaaakakaakaaaaakkkakkakaaakkkaaakaakkkkakakakakkkkkakaaakakaakaakaaakkkakakkkkkakaakkkaaakakakakakakaaakkakakkkaakaakkkkkkkakakaaakaaakkaakakaakkakaakkakkakkkakakkkkkakaakkkaaaakkkkkakaaakakaakakkkkkakaakakkaakkkaaakaaakaaaakaakaakaakkkkkkkkaakakkakkakaaakaakaakkkaaaaakakkakaaaaakaaaaakkkakakakkkkkakkakkkkkakkkakakkkaaaakkakkakkkkkaaaakkaakkkkkkaakkaakaaakaakakakaakaaakakaaakakkaakaaakkkakaakkkkakkkaakkakakaaaaaaakkkkkaaakkkkkkkkaaaakaakkkakkakakakkakakkakaaaaaaaakkkkkakakkakkakkaakkaakkkakaaaaakaakakkakaakkakkakakakakaaaaaakaakkkaakkakakaakakakkkaaaaaaaaaakakakkkakakkkakkaaakkkakkkkaaakkaaakaakaakaakkkkakaaakkkakkakkkkkkakakkkaaaaakaakkaakakkkkakaaaakaakkkkkkkakkkakakakaakakaakkkaaakakkakakkkkaakaakakkkaakakaakkkaakaakaakkkkaakkakkakakkkkkkaakkakakakkakkakakkkkaaakaaakakkaakakkkaakaaakkaaakkkkkakkkaaakaaakkkkakaakkakkkakkkaakkkkakkkaaakaaakaaakkkkaaakkakkkakakakakkkkkkkaaaakakkkkkkkkkkakaakaakkaakaaakkaaaaakaaaaaakaaakakaaaakakakakkkkaakakkaakaakkkakkkkkkakkakakkkkkkkkaakaakakakkakkakakkkaaaakaakakkaaakaakkkakaaaaaaaaakkakakaakakaaaakkakkkkkakkaakkaaaaakakkkaaaakkkakkkakkkakakkkkkkkakkakkkkakkkakkakakaaakakkkkkkkaaakkaaaaakkakaaaakakakkakkaaakkkakkakkakkkkkkakkaaaaaaakakkkakakaaakaaakaakakkakkkakkakkkkkkkakkkkkkaaakkaakkkakkkaakkakkaaaaakkakaakaakkkakkaakkkaaakakkkaaakkkkkaakakakakkkkaakkkakkaaaaaakkaaakkakaaakkkkakkaakkaaaakkakkkaakaakkakkkkkaakaakkaakaaaakkkkkakaakkkakkakkakaakkakaaakkkakaaaaakaaaakaaaakakaaaakakkaaakakkkaaakakakkaaakkakakaakkkaaakkaaaakakkkakkakkaaakaakkaakkakaakkkaaakakaaaaakkaakkaaakaakkkkkakkaaaaakkkaaaakaakaaaakakkkakkakkakaakkaakaaaakkkkkkakkakkkkaaakakaaakkakakkkaaaaakkkaakaaaaakkakaakkkkaaaaaakkkkaakkkaaakkkkkaakaaaaakakakaaaakakakakakkaakakkkaaakkakakkakakkkaakkkkakkakakaaaaakaakkkkkaakkkkakkkkkkakakakaaaaakaaaaakakkkaaaaaaakkaakakkkkakakaaaakkkkkakaaakakkkkkkkakkkaakkakaakaaakaakakkkakakaakaakakkakakkaakaakkaakkkaaaaakkaakkakkkkkkaakkkkaaakaaaaakkaaaaakaakaakaaaaaakakakkaakakakkaakaaaaaaakkkkaakkaaaakkkkaaaaaaaaaaaaakkaakkakakaakakkakakkaaaakaaakaakkaaaakkaaakakakkakkkaakkakkaaaakkaaaakakkakaakkaakkkakkkkakakaakkkaaakaaaakkkaakkakkaaakakkkaakakaakkkkkkaakaakkkakkakkkakaaakaaakkakkaakkakaaakaaaakkaakakkaakkkakaaakakakaaakkkkkkaakaaaakakkkakaakakkkkaaaakkaaaaaakkakkkakkakkakkakaaakkkkkaaakakakaakakkkkakkkkkkkaaakaaakkkakkkkkakaakakkakakaaakakakakkkakkkkkakaakakkkkakakkkaakaakkaaakakkkkkaaaaaaaaakkkkakakaaakkkakkakkaaakakakkaakaaaaaakaaakakkaakkkakkkaakkkakkakkkkakkkkaakakakkakkkakakkkaaakaaakaaaaakakaakkkakaakkkkakakaaaaakkkakkakaakkakkakkaaakkkaakakaakkkakkkaakakaaakkaakaaakkkkkakaakkkakkakaakkakkkakkkaaaaaaakaaaaakkakkakkkakkkkaakkkakkkakkkkakkakaaakaaaaakkaakkkkaakaakkakakkakakkkaakaakakaaakakakaakkkaakkakakkakkkakakaaaakkkakakaaakakkkakkaakkaaakakaaakkaaaakaaakkaakakkkaaaakkakkakkkkaaakakaaaaakakakkkkaaakaakkaaakakkaakaaaakaakkkkkkkakkkaaaakaaakkaaakaakakkkkkakkkkkkakakkakakkkaaakkaaakkkaaaaaakaaakaakakakkkaaaakakakakakakkkkaakakaakkkakkkaakkaaakakaakkakaakkakkkkakkkaakakaaakaaakkakaakkakaaakakkkkakakkkakkkaaaakkkkaaakaakkkaakkkakkkkakkaakkaakkaaaaakakkkakakkakaaaakakkakkkaaakaakaaakakakkaakkaakkkkkakkkakakaaaaaaakakaakakakakakaakaakkakaakakkkkkakkkakkaaaakakaakaakaaaaaakakaakaakakaakkakkkaaaaakakkakaakkkkkkkkaaaakkkkaakkkakaakakkkaaakkakaakkakkkakakaakkaakkakkkaaaakkkakakakaakkaaakaaakaaaaakkkkkkkakakkkakakkkkkaakaaaakakakkkakkkkkkkkkaaakkaakaaaakkakakaakkkakkaakkkaakakaakkakkkkaaaakkkakaakakaaaaaaaakakaaakkkaaaaaakakkakkkkkkkakkakkkkaakkakkakakkaaakkkaakaaakkkaaakaakaaakkaakakkkkakkkakkakaaaakkaaaakaakakakkkakkkakaakkkkaaaaaaaaaaakkaakkaaaaakaaaaaaakakakkakakkkaaakaakaaaaakakakakaaakakaakakakkakakkkkaaakakakkaakakkkkkaakakkkkakkkkkaaaaakakakkkkkaakakkakkkakkkaaakaaakkakaaakaaaakakkkkkaaakkkkaakkkkaaakakkkkkkkaakakaaakkakkkakkaaaaakkaakkakaaaakkaaakaaakkakkakkaaaakakkkaaaaakakkaakkakaaakakkkkaakaaakaaaakaaaakaaakkakkaaaaaakkaakkakaakakaakaaakkkkaaakaakaakkaaaaakaakakaaakaaaakkkkkkkakaakakakkaakaaaakakkakkkkkkakakkkkkaaaakkkkkkkkaakkakaakaakakkakkkakkkkakkaaaaakaakkkaakkkaakkkaaakakaakkaaakaaakkkaakakaaaakakaakakkakkkaakkkkakakkkkaakkkkaaakkkkakaakkkakkkkakaakakaakkakkakkaakakakaakaakkkkkkkkakkkkkaaakakaakaakkkkkakkakaakakaaaakkkakkkkkakkkkkkakkkkkaakakkakkakkkkkakakkkkaakaakaaaakkaaaaaaaaaakkkkkakkaaakaaaakakkakkkakkkaakkakkkkkaakkkkaaakkakakkaaaaakaaaaakkakkkaaakakaaakkaaaaakkkkaaakkkkaaaaakaaaaakaakkaaaaakkkaaakkkaakakakkkaakaakakaaaakkaakakkakaakakaaaakakkakakkkakaakkkkkkkkkkkaakkaakkaaaaakaakkakaakaakaaakkkakakkakaakkaakakakkakkkaaakaaakkakkkaaakkaaaaakaaaakkaaakakkakaaakkkkakaaakkaaaaaakakakaakakaakaaaaaakakkakaakkaakkaaaaaaaakkkkkaaaakakakakkkkaakkkkaaakkaaakkaakkakkkkakkkkkaaaakkkaaaakkaaakaaaakakakakkkaakaakkaaakakkkkkakakkakakakakaaaaaakaakaakaaakaakkkkkkakaakaakkkkakaaaakkaakkkkakakkakkkkaakakakkkakaakaaakkkaakkaaaakkkakkaakaakkkkakakkkakkkakkakakaaakkakkkkkaaakaaakakaaaakkkkakkaaaaakkakkaaakkkaakakkaakkkakaaakakakkaakkkkkkkaaakakkkakaakaaakakkakkaaaakaakkkakkaakaakakakakaakaakkaakkkkkkaakaaakkkakkaakakkkaakakkkaakkaakaakakaakkkakkakkkkkaakaaaakakaaaakakakakaakkkaaakkkakkkkkkakkakaaakkkkkkkakkkkkakaaaaaaaakaakaaaakkaaakkaakkakakakakkkkkakakakaakkkaaaaaakkkkaaakkaakakkkaaakaaaakkaakakaakaaaaaakakkkkkakaaakaakkaaakaaaaakkaakkakakkkkaakakaakaakkaaakkaaaakakaaaaakakakaakkaaakkakkkakkakakkkakkakkaakakkakkkkakkaaaaakkkaakaaaaaakkkaakkakakakaakakakaakakaaaaaakaaakaaakkkkakakaaakkkakakakkkakkkaakaaakakkkaakaakkaaakkakakaaaaakkkaakaaakkaakaakaaakaaakaakakaakkkkkkkkakkkkkakkkaakakakkaakakkkkkakkkkaaakkaakaakaaakkakkaaakkaaakakaakkkaakkkaaaakkakakkakaakakakakaaaakkaaaakaakaaaakakaaakakakkkaaakakakkkkaaaaaakkaakaakakakkakkaaaaaakkakkakkaakkakakakakaaakkakkkaakkaakkkkaakaakaaaaakkaaakkaakkakkkaaaaakaakkakakkakkakaaakkkakaaaakaaakkakaaakkaakkaaaaakakaakkaaakakkakakkkkkkaaaaaaaakakaakaakkkakakaaaakkkakaakakakkakaakkakkakkakakkkaakakaaaaaaaaakkkkakkkkkaakkkkakkakkaaaaakkkkkakkaakkkakaaakaakakaaakkakaakaakakkkaaakakaaakaakakaaakkkaaaakaakakkkaakkkaaakakkkkkkakaakaaaaaakaaaakakakkaakaakkaaaakakakkkaakakaaaaaakkkkaaakkkkkaakkkaakkaakakkakaakkaakkkakaaaaakaaaakkaakakaakkakakkaaakkkkakaaaaaaaakkkakaaaakaaakakakaakakkaakakkaakakkakaakkakakakkaaakaakaaakkkkaaaaakkaaaaakaaakkaakakkkakaakaaakkkakkaakkkaakakkaakkkkkkaaaakkaakkakkkakaaaaaaakakkakkkakaaaaakkaaakkakkkkkkkkaaaakkakakaakkaaakaaakakakkkkakkkkkkakakkaakkakakkkkkaakkakkakkakaaaaakakaaaaakaakakakkaaakkkkkaakkakakkaaakkkakakkakakaakkkakkkaakkkkaaaakakkakaakkaaakakakkkakaaakakakaakaakkaakkaakakaaaakkkkaaaaaaakakaaaaakaakkakaakakkkkakakaaakaakkaaaakkkakkaaakkakakakakkkkaaakakkaakaaakkkkakaaaaaakkaaakakakkkakkkaaakkakkkakkaakaakkkkakaaakakkaaaaaakkkaakkkkakkakkkakkkakaakkkkkakaaaakkakaakakakakakkaaakkkkaakkkaaakkaakakkaaaaakkakkkakkaaaakaaakaaaakakkakaakakkakkaaaaakaaakkaaaaaakakakaaaaakaaakkaaakaaaaakkaakaaakaaakakkkaakaaaaakaaaakkaakakkaakkkakaakakkkkaakaaakkkakakkkkkkkaakaakkakaaakkkakakkaaakaakaaaaaakaaaakkaakkaakkakkkkkkkkaakakkkakkakkkkkakkakakkkkaaakakakkkkkkakakkkkkkakaakaaakakaakaaakkkkakakaaaakakakaaakaakaakkakkakkaaakkkkkkakkkakakaaaaakkaaakkkakakkkaakaakakakakakkkakaaaakakaakakkakkkakkkakaakkkkkaakakaaaakaaaaaakaakkaaaakkaaakakkkakkaakaakakkkaakkkkaakkkkakkaakkakakakaaakaakakaakaakakakkakkkakaaakaaakaakkaakkaakakakaaaaakaakkakkkaaaakkkakkakkkaaakaaaakkkkaakkaaaakaakkaaaaaakakkkaaaaakkkkkkkakkkaaakkakkaakkkkkakkkakkkaakaakkkaakakkkaaakaaaaakakaakaakkaaaakkkakaaaakkkkakkakakaakakaakakkakkaaakkkkkakkakkaaaakkaaakakkaakkkaaakaaakaakakkkaakkkakkaakkakkkaakkakaakaaakakkkakakkkkaakakkkakaakkkkkaakkaakakakakkakkaakkkakaakkkkkkaakakakkaaaaakkkkkaakkaakkkkakaakkkkaaaaakakkkakkkakakkakkaaakaaaakkkakakakkaaaakkkkaaakkkaaaakkakkakkaaakaakaakaakkkkakkaakkkaaakakkaaakkkkakaakkakaakakakkaakkaakkkkaakakkakaaakaaakkaakkaakakaaakakakkaaaaakkkkkakkkkkaaaakakaaaaakaakkkakaakkakkkkaaaakakkakkkakkkakkkkkkakkkaaakkakkkkakkakakkkkkkakakkaaaakkkaakkkkkakkakakaaaakaaakaakkaakakaaaaakkakkakakaaaaakakakaaakkakaakaaakakakkakakkaakkaaaaaakkaakaaakkakakaaakkakaaaakaakakaaaakkaaakkkakakkakaakkkkakkakakakaakkkkkakakaakakaakkkakkkaaaaaakkkakkakaakaaakkkaaakakakkkaaakkkaaaaakkaaakkkkkkkaaaaaakaaakkkkaaaaakaakkkkkkakakkakaakakakakaaakkkkaaakakkakkkaaakakakkaaakaaakkakkaakaakkakaakkkkkaakaaakkaakakkaaaaakkkkkkkaaaakkkakkaakakkkkkakaakkakaakaakakakkakkaakkakkkkaaaaakkakakkkaakkkkkkkaaakkkkkkakaaakakaakaaaaakkkaakakaakkkkkaaaaakaakaakaakaaakakakaaakaaaakkkkaaakkkakakkkkkaaaakkkakakakkaakkkakakakaakakaakakakakakkkkaakkaaakaakkaaakakkakkakaakaakkkakakkakaaakakkaakkakkakkakaakkaakakaakkkaakkakkakakaaakaakaakkaakakaakaaaaakakkkkkkkakkaaakkkkkaaakkaaaaakkkaaaaaakaakkkaaaakkaaakkkakakaaakaakaaakaaakakakkkaakkkkaakkakkakakkkkkaaaaakaakkkkkkaaakaakaaakakakkakkakkaakakkaakakkkakaaaaakkkakkakaaaakaakkkkakakaaaaakkkkkakkkakakkkkkaaakkaaakaakaaakakkakakkakaaaaaaaakakaaakaakakkkakakkkkakkkakaaakakkakakkkakakaakkaakkakaaaakaaakkkakkaakkakkkkkkakkkkaaaaaaaaaaakkkaakaaaakkkakkkaakakakkkkaakkaakkaaakkkkakaaaaaaaaaaakakaakkakkkakkkkaaakaakkakkakkakkaakkaakkkaakakkkkkakkkakkkaaakaakaakkkakkkkakkkakkkkkakaakakakakkkkaakkkaakaakaakkkkaakkaakkkkkkkakaaakkkaakakkakkkaakkkkaakkaakakkkaakakkkaaaaaakkaaakkkkkkkakaaaakakakakkkaakkkakkaakkaakkkkkakaakkkaakaakkkkaaaaakkakkkaaaaakaakkkakaaaaakkkkkkkkakkakkakkaaaaaakakakkkaaaakaakakkkakakkaakkakakakakkkaakaakaaakkakaaakkkkkkkkkkkkkkakkkkkaakaakkkakkakakkkaakaaaakkakaaakakkaakkkkkkaakakakkakakakkkkakkkkaakakkkakakkakkaaaaakkakkaaaaakkkaakkakkaaaakkkkkakakkkakkkaakkakkkaakakakkkkaaakaaaakkaaaakkkaakaakkkkakkakkakakaaakaakkaakakkkkkkaaaaaaaakkkakkakaaakakakaakakkkkakakkakkkakkkakkkakkaaakaaaakaakkkakkkkkkaakkkakakaakakakkkkkkakkkaaakaaakaaaakakkaakakakaakaakaakkakaaakaaaakaakakkaaakkakaakkkakakkaakaakkkaakaakkakkakkaakkaakakkakaakakkaaaaakaakakkkkakkakkakaaaakkkaaaaaaaaaaaakkaakaaakaakaakakakaakkkaakkkkakakakkakakaakkkaaakkkakkkkkkkkakakkaaakaakaakkkakaakkkaakkakaakkakkaakkaaaaakkaaaaakkaaaaakkkaakakaaaaaakkakkkaakaaaakaaaaaakkakaakkakaakkaakkkaaaaakakakkakkkakkaaaakkkaakkaaaaakaakakkakaaaaaakkakakkkaaaakkkkkakkaaaaakakkkakaakkkkkakakkkakaakkaaakkkkakkakakkkaakkakkkkakkkaakaakkaakkkaaakkkkakaakkkkkakkkaaaakkaakaakkakkkkaakaakkakkakkkkakkkaaaakkkaakkakkkakkkakkaakakaakkaaaaaaaakaakkkaaakkkakaakaakakkakkkaaaakkaakkkkakaakkaakkakakkakakkkaaaakkaaaaaakaaakakkakkakaaaakaaaaakkakkkkakaaakaakaaaakkkkaakkkkakkkkkaakakkkaaakaakaakkkaaakkaaakkakakkaakakkaakaakkaaaaaaaaaakkakkkkkkakkkakaaaaakkaakakakkakaakkakkkkakkkkakkkakkkkaakkkaaaaakkakkkkkaaakakakakkaaaakkkkkaaaakakkkkaakkkkakaaakakakkkakaakkaaaaakakaaakaaakkaaaaakaaakaaakakaaakkkkkkkkkaakakaakkaakkakkakkakkkkaaaaaaakkakkkakkkakakkakaaaaakkkaakaakkkkkkakkkkakakkkkkakakkaakkaakakkkaaaakakkakakakkkkaakakkkaakkkkaaakkaakkakkakkkkaakakaakaaakkaakaaaaaaaaakakkkkkkkaaaaaakkakaaaakakakkakkaaaaaakaaakaakaakkkakkkkkkaakaakkkkkakakaaakakakkakkaakakkakaakaaakaaaakkakakkkkakaakkkaaaaaaaaaaakkakkkaaakaakkakkaakkakaakakaaakkkkkkkakakkkakkkakakaakkkkaaaaakkaakakaaakaakkakakakaakaakkkakakaakkakkkakakkaakkkakkkkkkkkakkaakkaaaaakakaakkaakakkkakkkaaaaakaakaakkaakaaaaakakkkaakkkaaaakaakkakkkkkaakaakkakakakaaakakkaakaaakaaaakkkakakkakkkkkaakkkakakkkaaaaakakkakakakkakakaaaaakakkkkkkaaakaaaaakkkakaakakaaaakaakkkkkkkakkaaakakaaakkaaaaakkkakaakaakkkaakakkaakaakaaaaakaakkkaaaaaaaaaaaaaaakakakkkakaakkkaakaakakkaakakkakakkaakkaakakakkkaakkkkaaakakkkkakkaaakkkaaaakkakkkkaakkakaaakkaakkkkkkkkaakkaaakakakaakaaaakkakkkaakaaakkkaakkkakkakaaaaakakaaaakaaakakkakkakkkkaakaakaaakakkaaaakaaakakkkaakkakakaakakaakkkaakakaaaakkaakaakkkaakkakakkkakkkaakaaakaakkaaaaaaakaakkakaaakaakkaakakkaakaaaakakkakaaaakkkkkaaaaaakakaaakkakkakakkaaakkkakakkkkkkkkakkkakkkkkkakkkaaaakaakaakkkaakkaakaaakkaaaakkkakkkkaakkakakaakkkaakkkkaakaaaakkaakkkakkkkaaakkaakaaaakkakakkakkkkkaaakaaaakakakkkaakkakakaakkakaakaaaaaakakkkkaaaaakkkakaaakkkkakakkkkkkakakkakaakakkaakkkkaaaaakakkaaakkaaaakkakaakkkakkaakaaaakkakkakkkkakkkaaakkkkkkaakkaakkakkakkakaaaakaakkaaakakkkkkaaakakaaaakakaakkakakkkakakkakaaaaaaakkaakkakakkaakkaakaakakakkaaakaaaaakakakakkkakkaakaaakakkkaaaakaakakkkkkaakakkakkaaaakkkakkkkkaakaaakaaakkaaakkkkakakkaakkkkkkkakakakkkkaakaaaaakkkakkkkakaaaaakkaakkakkkaaaakaakakkakkkkakkaaaaaakkkakaaakakaaakaaaaakaakkkkaakakkkaakaaakakkakakkkkkkkaaakkkakkkakkakaaaakkkakkkkaaakaaaakkaaaaaaaaakaakaakakaakkakaakakakkkkakakakkakakkakaakaaaaakakkkkkaaakkkkkkkkakakkakkkkaaaakakakaakkkkkkakkaakaaakkkaakkkaakkkkaakakkakkkakaaakkkkaakakaakaakkaaaakkakkkaakkakakakkkkaaaaakaaakkkkkkaaaakaakkkakaakkkakkkkakkkkkkkaaakkakakkakakakkaakakkakakakakkaakkakkkakakaaaakaaakkkaaaakkakkkkakkkkkkakaakakaakkaakakkakaakakaakaaaakaakkaakaaaaaaaakkakkaaaaaaaaaaaakkaakkkkkkaakkakkkkaakkkakkaakkkkkkkkakaakaaaakkakakkaaaakakakkkaakakkkakkaakkaaaaaaakaaakkkaakaaaaakkkkakakkkkakkkakkaaakaakakaakaakkakakkakkakakaaakaakkakaaakakkakkkkaaakkkakaaakakaaaaaakaakkakaakkaaakkkkaakakkakakkkaakakaakakkaaaakaaaaaakakaaakkkakakkkakakakaakkkaakkaakkkkkkaaaakakaaaaaakakakkaakaakaaaaakakaakaakkakkkaaakaakaakkkakkaaaakakakkkkkakkkaaaakaaaaakkkkkakkkkakkkkaaaaakaaaaaaakakkkaaakkkkkkakaakkkakkkaaakakakkkakaakakaaakakkakaakkkakaaaaaakaakkkakaaaaakkaakkaakaakakkkkakakakakakkkakkakkkkkkaaaaakaaaaaaaakkkaakakaakkaakaaaakkakkakkkakkakkakkkaaakaakkkakaaakkkakakaaaaakakkakkakkkakkkaaaakkkaakakkaakaaakakaaaaaakkakaakkkkaakkaakkakaakkaakkkkakkkaaakaakakkkkaakaakakakaaaakakkkkkkkkakkaakaaakkaakkaakkaaaaakkakkaaakkakaakkkaakkkaaaakakakaakaaaakakakkakaaakkkaaakakaakakakkkkkkakkakaaaakkkakkkkkaakkaaaaaaaaakaakkkaaakaakkkkakkakaaakakakakaaakakaakkkaakkaakkkkkakkaaakakkaaaakaaaakaaakakakkaakaaakkkkakkakkaakakkaaaaaaaakakkkaakakaakkkaakakaakaakkaakkkkkaakaakaaaakaakkaakaaaakaakkkkkkakaakaaakakkaakakkkkkaaakkakakakkkakaaaakaaakkaakakkakakaakakkaakkaakkaaakkakaaakkkakkakaaaaakkkakkkaakkakkkaakaaaaakkkkakaaakkkkkkkakaaaakaaakkkkakkkakakaaaakakaaakakkkkkakakkkkkakakkkaakakkakkakaaaakkkaaakaakkkkaakaakaakkaaakkaakaaakkaaaakkaakkaakkkkaaakkkkakakakaaakkkkaaaaakakaaaakakkkkkakakakakaaaakkaaakaaakkkaaaaaakkaakkaakakkkkkkkkaaaaakkkkkakkakkkaaakaaaaaakkkkkkaakakkakkkkaakaakkkaaaakaaakkaaakakakkaakakaaakakakkkaaaaaaaaakkkkkaakaakkkakaaakakakkaaaakkaaaakkakkakkkakaaaakaaaaakaaakkakaakaaakaakaaaaakkkkaaaakkkakkaaaaakkakakkakaakkaakakaaakkaaaakkakakakkaakkkkaaaaakkakakakkkkaakkaakkkakaakkkaakkaakkakkaakaakaakkkaakakaaakakkakkkakkkaakkkakaaakakakkkaaakakkaakaakaakkakkakakaakkaaakkaaaaakkaakakaakkkkaakaakaakaaaaakkkaaakkkakkakaakkaakkkakkakkkakakakkaaakakaakakkaakakakkkakkkkakakkkkakaaakakakkkkakaaaakaaakkkakakkakkaakakkkakaakaaaakaakaaakkkaakaakaakkakkaaaakkkaaaakkaaakkaakaaakakakkaaakaaakkkaakkkakakkakkkkkkkaakakkkaakakkkakaakkaaaaakkaakaakakaakkkakakkakkkakkakkakakkakkkkkkaaaakkkkaaaakkkkakaakkkakkkaaakaaaakkkkkakkkakkaakkkaaakkaakaaaaaaaakakakakkkkkkkkaakkaakkkaakkakakaaaakkkkaakkakkkakkakkaaaakkkaakaakkkakkakaaakakaaaakaakaaaaakkaakkaaaakaakakkkkaaaaaaakkkkaaaakaakkaaaakaakkaakkkaaakakkaaaaakkkakkaakkaakakakakkkkkkakakkakakkakakkakaaakaakkkaakakakkkakkkaaakkakkkaaakaakkkaakaaaaaaaakaaaakakkaaakkkkkaaakkkakkkakaaakkkkkkaakaakakkakakakakakkaakaaaaakakaakakkaakkakaaaaakaakakakaaaaakaaakaakaaakkakaakakaakkaaaakkaaakaakaaaaakkkkaakakaaaaakaakkaaaaakkaakkaaaakkkakkkakkkaakakkaaaakkaakkkkkkkkakkakakkkaaakkaaakkakkkakaakkaakakkakkkaakkaakakaaaakkaaaakaaaaaakakkaaaakaakakkakkkkkaaakaaaakkakakkaakkakakkkkaaaaaaakkakkkakakkkkakakkakkkkkakaakkkaakkkkkkkaaakkkkakakkkaakaaaaaaaakkakkkkaakkkaaakkkkkakaakkaaakkkakakkkaakaakakakakakakakaaaaaakaaaakkakkaaakkkkakakakaaaaakkaakkaaaaakkkaakakaaaaaaakkkkkaaaaakaakakkakakakkakkkkaakkaakkakkkakaakkaakkaaaaaakkkakakkkkkkkaaakaakaakkakakkaaaaakakaaakakakaakkkaaakkkakakkkkaakkaaaakkakaaakaaaakakkkaaaaaakkkkakkkaakakkaakaakkkaakkkkkaakakkkakkkakkaaakaaakkaakakakaaakkaaaakaaakkaakkkkaakkkaaaaaakkkkakaakkkkakkkkkkkakakkaakkkkkkaakaakaaaaakkkakakkkakkkakakakakakakkkkaaakkakaaakkaaaaaakkaaaakaaakakkaakkkkakaakaakkakaakakaaaakkaakaaaakkkakkaakakakaakkkkaakkkakaakakakakkkkkkaakaakkkkkkaakkkkaaakakakkkkakaaaakaakaaakaaakakkakkakakaaaaaakkkkaaakkakkakkakakkkkaakakkkakaakkkkaakakakkaaakakkaaakkkakaaakakkkakakakkaakaakkkkaakkkkkkkaaakkaakaaaaaakakkaakaakakkkkkkakkkakkakkkkaaaakakakakkkaakkkkkaakkaaakkaaaaaakkakkkaaakkkkkkkkakakaakakakakkakkakaaakkkkaaaakakaakkaaakakkakkkakakkaaakaaakaakkakkakaaaaakkkakakkkaaaaaaakakkkaaaaakakkaakakkakaaakkaakkakakaakakkkaaaakkaakaaaakakakaakaaaakaaaaakaaakakaaakkakakkkkkakkaaakaakakkkkkkkakakkaakakkkaakkaaaakakkakkkakaakaaakakkaaakkkkakaaakkkaaaaakkkaaakkkkakkkakaaaaakkkkaaaakkkkakaakakakakkakkakakakaaakakkkakaakakkkkkkkaakakakkkaakkkakkakkaakaakkakaaakkkaaakaaaakaakakkakakakkaaakkkkaakkkakkaakkkkkkaakaakakaaaaakaaaakkakaaakkkkkkkaakakakakkkakakakaaaaaaaaakkkkakkaakkkkaaaaaaaaakaaakkkakkkkakakaaakaakaakakakaakakkkakakaaaakkkkkaakkakaakakkaaaakakaakaakkkaakkkkkakakaakkkaakakakakaaaaaaakkakakaakkaaakakkaakaaakaakkakakakkkkaaakakkaaaaakkkaaaaaaakaaakkkkkkkaaaaaakaaaaaaakaakakkkkaakkkaaaaaaakakakakkkaakaaakkkkkaakkkaaaaakkkaakkaakaaakkaaaakakaakkaakkakaakaaaakaaaaakakaaakaakkkkaakkaakaaaakaakaaaaakaakkakaaaaakkaaakaaakakkkkkakkkkkkkkakkkkkkkkakkaaakaakaaaakaaaakkkkkaaakaaaaaaakaaakkkaaakkkkkaaakkaaaakakaakkkkaakaaakkkkaakakaaakaaakkakakkkakakkakaaaaakaaakakkaaakkkakakakaakakaakkakakaaaakkakakaakakkkkkkaakkaakakakkaakkakkaakaaakkakakkkkakaaaakakakkkaakkaaakkkkakaaaaaaaakaaakaakkkakakkakakaaakakakakaakkaaaaakkaakkkakaakkkaaaaaaakkkaaakaaaaaakaakkkkakkakkkkkkakakkkkaaakkkakkkakkaaakkaakkkkakkakakkkkkaaaaaakaakaakakkaakkaakkkkaakkaakakakakaakakaaaakakkaaakkakakkakakaakakakaakkakakkakkkaakaakkaakakaakkkaakaakkakaakaakkakkakaaakakakkkakaaaakakkkkakkakkakkkkkakaaaakakaaakakkakakkakkkakakkaakkaaakakaaakakkaaaaakakaaaaakkkaakkkkkkkakakkkkkaaaaakkaakkaaakkkaakakakkkakkaakakakakkkkkkaakkkakkakkaakkkaakkkkaakkkakakkkkakkaaaakkkkkkaaaaakakaakaaakakaaakkaaakakkkaakkkaaakkkkaaaakkkkkkaaakaaaakaakkkkakaakaakkkkkkaakkkkakaaakakkaaaaakkkkkaaaaakkaakkaakaakkaaakkaakaaakkkkaaakkaaakakkaakkkakkaaaaakaakakkakakaakakkkkkkakaakkaakakakakkkaakkkaaaaaakkaakakaakaaaakkaaaakaakkkkaaakkkkakaakaakaakkkakakkkkaaakkaakaakkakakkaakakaakkkaakaakakkakkakaaaaaaaakaakakkakakkkkkakaaaakakakaaaaakaakakkaakaaakkkkaakakakkaaakakkkkkakakakakkakaakaakkakkkakkakkkakakkakakakkaaaakkaakaakkkkakaakkkkkakaaakaaakakkkaaaaakaaaaakkaakakaaakaakakaakkkaakaaakkkaaakakkakaakkakakakkaaakaakakakkkakakkkakkaaaakkkkkkkaaakakaakaakakaakaaaakakakkaakaakkakaakkkaaaakaakkkkaaakkkkkkkakkakaakakakakkkkkkkkaakkkakkakkkkaakaakkakkkkaakkaaakkkaakaakkakkakkkkaakkaaakaakkakkkkakkkkkkakkakkkkaakkkaaakkaaakkkkkkkaakaakaakakkaakaaaaakkakaakkkaakkkkkkakkakkakaakkkaaaakkkaakakkkkaaaakaaaaakaakkkkkaaaakkkaaaaakaaakaakkkkkkakkakaaaaaakakkkaakaaakaakaaakakakaakkkkakkkaaaakakkkakakaaaaakakaaaakaakkkakkaaaakakkaakaakkaaakaakaaakkakkkakkakkaaaaaaaakkkakkkakkaaaakaakkkkakakkaakkakakkaakkkaaaaakkaakkkkaaakkaaakkaaaakkkkakakaakakkakaakakaakakaakkakkkaakaakkakaakakakakaaakkaakaakaakkaaaaaaakkakkkkkkkakakakaakkaakkakaaakkkkkkakaakakkaakkkkkkkaaakkakaakaakakaakaaakkkkakkkkkkaaaakkkakaakaakkaakakkaaaaakakkkkakakkakaakakaaaaakakaaakkaakaakakkakkaakakaakaaakaaakkaakkkkakkakakakkkakaaakkakkaaaaaaaakaakaakaaaakaaakaaakakkkkkkakkaaakaakkkakakakaaakakkaaaakaakakaakaakakkkaaakkaakakakkaaakkkkaaaaaaakaaakkkaakakkaaaakkkkakkaaakkkakaaaakkkkkkakakkkkkakkaakaakkkkaaaaakkkakkkkaakaaaakkaaakkakaakkkkkaaakkkaaaaakakkaakaaakakkakkaakakakkaakkkkaaakkkaaaakakakkkakaakkkakakkaakkaaakaakakaaakakkaaakaaakaakkkakakaakaaaaaakakakkkkaakakkkakaakkkakkkkakkkakaakakkkaakkaakaakaakakakakkaaakaaaaakakkkkkakakakaaaakkakkaakakakaakaakaakkakakaakakakakakkaaakakkaakaakaakakakaakkaakaakaaaaakaaaakaakaaaaaaaaaaaaaakakkkakaakkaaakaaaakkkkkkkkakakkaakkaaaakaakaakakkaakaakkkakakkakakkkakkakkkkkkaaaakakkaakkaakkkakkkkkakkaakkakakaakakaaaaakakaakaaakkkaaaakkkaakakkakaakaaaaakakkkkkakkakkkkkakkaakaaaakkaaaakaaaaakkkkakkakaaaakkkkkakkaaakkkakakkakkaakakaakkkaakkkaakkaakaaakaakkaaakaaakkakkkaaaakkakkaaaakkaakaakakkkaakaaaakkakaakkakakaaaaakkaakakakaaaakkaakakkakkakkakkkakkkkakkkkkkkkakaakaakkkkkkkaakakakkaakakkkakkakaakaakaaaakkkaakkkkaaaaakakkaakkkakaaaaaaaaaaaaaaakaakaakkakkkkaaaaaaaaaakakkaaaaaakakaakaakaakkakaaakakkkkakakakkkkkkkaakkkaaaakkkkkakakaakakkakkaaakkkaakaakkkkakaakaaaakkaaaakkkkkkaakaakakaakaaakkkaakkkkkkkkakkaakkkaakaakaakakakakkakkkaaakakaakkkaaakkaaaakakakakkakkaaakakkkkaaaakaaakaakkakakkakkkakaaakakakkaaakaakaakakkkaakkkkakaaaaaaakakkaaakaakaaaakaaaaakkaakaaaakkkakkkkkaaakkkkaaakkaaakkkkkkaakakkkaaakkkkakakkaaakkakakkkkaaakkkaaakkkakkaakkkkkkaaaakaakkkkaakkkaaaakaaaakkaakaaakakaakaaaaaakakkkkakakakkkaakaaakkkkakaaakkkkkaakkkkakkakkkakaaakakkaakkaaaakaaakkkakkakkaaaaaakkkkkkaaaaakaakkakkakkkaakkkkakaakakkakaaaakkkkkkkkaaakkkkakakakkkkakkkaakaakakaaaakakkkkakkkkkaaakkaaakkkaakkkkakkakkakkkakaaakakkaaaaaakkkakaakaakkkkkkaakkaaakaaakkaaaaakakaaakakkaaaaaaakakakaakkakkkkkakkkkkkkkakakkkakkakaaakkaakakkakkkakakkkkkkaakkakaaaaaakaaakkkaaaaaaakkkkakkkkakakaakakaakkaaaaaakkaakaakkakaakkkakkakkakakaaaakkakkaakaaaakakakakaakkkkkaaakkakakkaakakakkkaakkkkkkkakkakaaaakkakakkakkakakakkkkkkakakakkakaaaakkakakaaakkakakaakkakkaaakakkkkkakkakkaaakaakakkakkakkkkakkakkaakkkakkaakaakaaaakkkaakaaaaaakkakaaakakaaaaakaakkkakaakkaakkkakaaakakaaakkkaakkakakakaaakaaakaaaaaaaaaakakakakkkkkakakkaakkakkkaaakakkkakaaaakaakaakkaaakakakaakaakaakakaakkkkaakaaakakkakaakakakkkkaaakakkakakaakaaaaakaaaaakkkkakaaakakkakaakaakaaakaaaakkkkkaakkkakkakaakkkkkaaaaakakakkaakkaaaaaakkaakkkakkakakkkaaaaaakaakakakaakakaaakaakkakaakkkakakakaaakaaakkaakkkaaaaaaakkaaaaaaaakkkakakaakkkakaaaakkakkakakakkaakaakkakakaaakkakaaakkkkkkaaakaaaakkaakkkkkakkkakkaakkkkkaaakaaaakkkkaakakakkkaaakkkkakkkaakaakakkkaakkkkkkkkkaaakakakkkkaakkakkkkkaakaaakkakkkkaakakkkaakkaakkaaakkaaakakkakakaakkaaaakkkaakkakaaakaaaaaakkaaakakkkkakaaaakkaaakakaaaakakakkkakkkkaaaaakkkakkkkkaakkaakkaakakaaaakkakaakkkkakakkakkaakakakaaaaakakaakaaaakkakkkakkakkakaaaakaaakkaaaaaaaakkkakaaakaaakkkaaakakkaakakkaakaakakkakkkaakaakakakaaaakaaakakkkkkkkkkakkaakaaaakaakkakkakkakaakakkakaaaakakaaakakkakakkakaaakkakakkakkakaakakaaaaakakakaakaakakkkkakkkkakkkkkkakkkaakkkaakakaakaakkakkkkaakkaakaaaakkaaakkkkaaaaaakkkkakakaakakkaakkkkkkkkakkaakakkkkakkaakkkakaaakakkaakakkkaakaakaakakaaakakkaaaakakkkkkaaakkaakkaaakkaaaaakaaaaaakkkkkaaakkkkkaakkkkakakaakaakkkkaaaaakakaaaakakkkkkkaakakkkaaaakakaakaakaakaaaaaakkakkakkkkkkkkkkakkaaaakkkaakakakakaaakaaaaakkkkkkkaakakkaakkkkakakakkakkakaakakaaakaaaakaakakakakkkaakkaakaakaaakkkkkaakakkkkakkakaakkkkaaakkkaakaaaakkakkkaaaaaakaaaaakkaakkakaaaakaaakkaaaaakkaaaaaakkkakaaakkakkaakkaaakakkakkkkaaakkakakkaakakakaakkkkaaaaakaaakakakakkakaaaaakkakaakkkaakakakaakkaakakkaaaakaakkkaakkakaaakkkkkaaakkkakaaakakakakkaakaakaaaaakakkkakkakakakkaaakkkkkaakaakakkkaakkkkkakaakkakakaaakkkaaaakaakaakaakakkkkkakaakaakkaaakakaakaaaakakkakkaakkkaaakkaakakakakaaaakakkkkkkakkaaaaaaaakaaakkkkkkaaaakkkaakakaaaakaaaaaakakaaaakkakkkaaaaaakkakaaakkkakakkkkaaaakkkakkaaakaaakkkaakakakaakakkkakkkaakakakaakakkakkakkkaaaakkkaakaaaakakkkaakaaakkkaakaakkakaakakkkkkkaakakkkkaaaaakkakkaakakakkaakkkaaakkkakakkkkakkaakkkaaakkaakakakaakkkkkaaakkkkkkkkakkaaakkkkakkakakaaaaakkkkaakakaaakkakkaaaakkkaaaakkkkakkakaaakakakkakaaakkaakkkkakkakakakkkkakkkakkakkakkkkakaaakkkakakakaaaaaaakkkkkaakkaaakakkkakkkakkaakkakaaaakakkkkakakkakkaaakkakakakaaakkkaakkkkkkakkaakkkakkakaaakkakkkaakkaaaaakakaaakkkaaakakakakaaakkkkakkakkaakkkkkkaakkakkkkkkakaakkakkakkaaaakkakaakakkkaakaakkaaakakkakakaakaakakaaakkaaakkakaakakakaaaakakkaaakakkaakaakakaaakakaakaakkkkakaaaakkaaakkaaakkaaakkkkkkaakkakakkaakaakakkkkkkakkkkaaaaakaakkaakkakkkaaaaaaaaaakaakkkkkkkakaaaaaaakkkakakkkaaaakkkkaaaakaaaaaaakkkakaaakaaaakkkkakkaakkkaakkkaakaaaaakkakkkakkkakkaaakkkkkkkkakaakkkaakkkkkkaaaakkkaakkkkakaakaaaaaakkkakkkkaakkkaaakakkkkkaakkaaakkkkkakkaakaakkkkaaakakakakkkaaakkaaaakkaaaaaaaakkkkakaaakaaakkaakkakaaakkkaaaakkaaakkkkkkkkaaaaakkaakkkakakaakakkkkaaakaakkkkkkakakkkaakkaaaaaakkkkkakakkkkkaaakaakkaaakkakkaaaakkakaaakakaaaakakaaakkkkkakakaakkkkkaakkakakaaakakkakkkkaakkaakakakkkaakaakaaaaaakkkakakkkaakaakakkkaakaakakaaakkaakaaakaakakakkaaaakkkaaaakkkakkkaakakaakkkkkakkkkkaakkkkkkakakkkkkkkakkkakkakkkaaaakkaaakkkkkkaakaaakkkakakkkkaaakkakakakaaaaaaaaakaaaaaaakkkaaaakkaakaaaaakkkkaakakaaaaakaakaaaakakkkakakakakaaakkkaakkkakaaaakakakaakkkaakakakkakkaaaakaakkkkakkkakaaaaaaaaakakakaakkakkakakkkkaaakkakkakaaakkkkkkkaaaakkakaaaakkkaaaakkakaakakakkakakkkkkaaakaakaakkakakakaaakkakkaakakaaakkkkkkkkaaakaaaakaaakkakkakkaakakkkkkkkkaaakkakkkkakaaaakkkakkkaakkkkkkaakaaaakaaaaaaaaakkkaaakkkkakkakkakkkkakaaakkkkakaaaakkkakaaakakkakkaaakakkakkkakaakakkakakkkakkakkakakaakkkkakkakkakkaaaaakakkaaaaakaakakkakkaakakakkakkakakaakakkkkakakkaakaakakkkakkkkkaaakaaaaakkkakakaaaakakkkkaakakkaaakaakakkkkakkakakkkakakkkaaakaaaakaaaakaaaakakkaakaakkaakkkaakakkkkakakaaaakaaakaaaakkkakkaakkkkkkaaakkkakakaaaakaaaakakkaaaaaaaaakkakkakkkaaakkkkakaaakkakkkakakkakkaakkkkkaaaakaaakkkaaakaaaakaaaakkkkakkakaaaakkkaakakkkkaaakaaaaakakakakaakaakaaaaaaakakakkkakakaakkkaakkkaakkkakaaaaakaaakkakakkakkkkkaaakaakaakakaakaakkaaakakaaaaaaaaakakakaaaaakaakkaaaaaakkakaakaakakaakkaaakkaaaakkakkkaaakakkkkakaaakkaakkkakaaaaaaakakakkakkakkaaaaaakkaakaakaakkakakakakaaaakakkkaaaakkkaaaaaaakakakakkkkkaaaakakkakaakakaakkkkkkaakkkaakkakkkakaaaaakaakkakkakkaaakkkakkaakkkaakkakakaakkkakkkakkkkkaaakakakkaaaakaaaaakakaaakkakkaakakkaakaakakaaaaakkakaakkaaaaaaaakkaakaaakakakakkkkkkkkkkakakakkkaakkaaakaakaaaakaaakkakkkaaakkaakaaaaaaakkkaaakakkkkkkakkaaakaaaakkkkaaaaaakakkkkkkkaaaaaakakakaakkaaakkakkaaakaaaakkkkaaaaakakkkakaakakaaakakkkaaaakkakakkakakkkkkaaakkaakakakkakkkakkkaaaaakaaakaakkkaaaaaaakkkkkakkkaakakkaakaaaaaaaakaaakaakkaaaaakakakaakkakakkaaakaaaaaakkakkkkakaakakaaaaaaakkakakkaaaaaaaaakkkkakkakaaaakaakkakaaakkakakkkakkkakkkkkakkakkkakaakakkaaaaakkaakakkkakkakkaaakkkkkkkaakakaaakakaaaaaaakaakkkkkkaaakaaaakkakkkaaaakakkakkaakkaakkkkaaakaaakkkakkkakkkakaakaakakaaakaaakakakkaakaaaakakkkkakaakkakakkkakaaaaakkaaakakkkkkkkakkkkkkkkaakkkakaaaaaakakkaaaakkakaaaaakakaaakakkkkakakkkkaaaakkkkaaakaaakkkaaaakakkkaakaakkkakkkkakakkakkkakkakkakkkkakkkkkaakkkaaaakkkakkaakkkkakakakkkakaakakakaaakaaakaaaaaaakkaakakaaakkkkaaakkkkkaaaaaaakaaaakkkkkaakakaakkkkkaaakkkkaaaakkakaakaaaaaakaaaakakkkakaaakakakkkakkaakaakkakaaaaakaaakakkaakaaaakakkaakaakakaakakaakaakkkkkaakakkaakaaakaakkaakkkkakaaakkaakaaaakaaaakkaaaakaaakkaakkkkkkakkkkaakakkkkakakkakkaakkakaaakkakaakkakkkaaaakkakkakkkakkkkkaaaaaakkkaakakkaakkkkakakaaaaaakakkaaaakaakakkkkakakkkkakaaakakkaaakkkakakakakaaakkakakkaakkkkkkkkkakkaakaakakakakkaaakkaaakakkkkkkkaaakkkkkaaaakakkkakkkaaaaaaaakkakkaakkkaaakaakkkaakkakakaaakakkaakkkkakkakaaaakakkaaaaakkakakkkaaakkaaakkkaakakkkakkkkkakkakkaaakakkkaaakaakkkaakkaakaaaakkkkkaakkakakkkaakkkkkakaakkkkaaakkkakkakakkaaaaakakaakkkkkakaakkkkkkkaaakaaaakkakaaaakakkaakakkakkakakkaakaakkkakkkkkakkaaaakakakakkakaaaaakkkkkkkaakaakakaakkkaakakaakkkaakkkkaakkkkkkakkakaakaaaakkaakkkkkaaakkkkkaakkaakaaaaakkkakaakkkakaakkaakakkkakkakkkkkkkkkakakakkkkkaaaakaakkkkakkaaaaaakakkakaaaakakakkkkkakkaaakkakkakakkakakakkaakkkaakaaaaaaakkakaakkkakakakkaaaakkaaaakaakaakakkakkkaakkaaakkkkaaaaakakakkaakaakkkakkaaakkakkaakkaakaaakkaaaakakkakakaakkkaakaakakaakkkkakkkkkkaakkaakakkakkkkkakkaakkaakaaakakkaaaaaakkkaaaaaakkakakaakaaakakkakaaaakkkkkakakkakaakkakkakkaaakaaaaakaaaakkakaaakakkakkkkkkaaaakaakkaakakkaaaaaaaakakkaakakaaakkkakaaakkaakaaaaaaaakakakaakakaakkkakaaakkaaakaaakkaakkkkakaaaakakkkkkaaakkakkakkkakaakaakaakkakakakakkaakaaaakkkakkaaakaakkaakakaaaaakkakaakaaaaaaaaakkakkkkaakkkkakkkkakkaakkkaaakaaaakkaaakakaakakkaaaakkkaakkaaakkaakkaaakkkakkaaaakkkkakkakkaakaakkakkaaakaakkkkakkaaakkaaakkkkkkkkkkkaaakkakaaaakakkaaaaakkakkaaaakkakakkkakkkkkaakkkaaaakakakakakaakakaaakkaakkaakkaakakakkkakkkaakakakaaaakakakkkkaaaaakaakkkkaaaaaakkkakakakkakkkkkkkkakakkakkkaakaakkaaaaaakaakakkkaakkaakaaakkakkakakakkaaakkakkaakakakkakaaaaaakakaaaakkkakkkaakakakaakaakaakaaaaaakaakaaakaakakkaakkkaaakakakkaaaaaaaakakkaakkakakakakakakaakakkkkakkkaakaakkaaaakaakakkakkaakaakakakkakakkkkaakkakkkkkkaakaaakkakakaakakakaakkakkaakkakaaaakakaaaakkaaakkaaakkaakaakkkakkakkakaakaakaakakkkkkakaaaaakkkkkkakakaakkaaaaaakkaaakkkakaaakaakkkkkkakkaaakkkakakaakakaaakakkakaaaakaaaakaaaaakaakkkakkakakkkkkkaakakkakkakaakaaakaakkkkkaakkkaaakakaakkakakaakkakakakaaaaaakkkaakkkkaakkaakakakaakkkakkaakkkkakaakaakkkkkkkkakakakakkkakakakkakkakaaakakakakakkakkkaakakaaaaakaaakaaaakaaaaaaakkaaaakaakkakkkkakaaaaaaakaakaakaaaakkkkakakkkaakakkkakkkkakakakakkkkkkkkakaaaaaaaaakkakkaaaakkkakkakakakkakaaakkkkkkaaaakkkkkaakkkakkakaaaakaaakaaaakkkkakkkkkkkkakkaaakkaaaaakaakakakakkakkkakaaakaakkkkaakkaaakkakakakkakkaaakakkkaakkakaaakakkkakakaakkkakaakkkaaaakkaaaakaakkkkkaaakkkakaaaakaakakkkkakaakaaaaaakkakkkkaaakaaakkakkkkaaaakkkkkkkkaaaaaakkkkaakakkkaaakkkakaakaaaakkakakkkaakaaakaakkkkkaaaaakkkkkaaaakakkkkkaakakkaaakakakakakkkkaaaaaakaaaakkkakakkakaakkkkaakaaakkkkakkaakkkkkkkkkakakkakakakaakkakkkakaakakaakakkaakkkkkaakakakkkkkkkkaaakaaakakkakakaakkakkkkakaakaaaaaakakkkakaaaakkaaakaaakkaaakkkakkakaakaaaakaaakkakkkkkaaaakaakaaakkakkkakkakkakkkkkaaakakaakaaakkkkakaakaaakkkaaaaaaaakakaaaakaaaakkkaaakakakaaaaaakaaaaaaakakkaakaakkakkakakakkakkkaaaaakkkaaaaakkkkkaakakkkaaaakaakaakaaaakakaaaaaaaaakakaaakkaaaakakkaaakkkkaaaaakaaaaaakkakkakkkakkakkkkkkakkaaaakkaakkaaakakakaaaaaakakaaakkkkakaakkaaaakkaaakkkakkkkkakakkakaakakkakkakakakkkkkkkkakakkakaaaakkkkaaaaakkakkkakkkakkaakkkaakkkakakkkaakkkkaaakkkkakkkaaakkkkkakkkkkkaakaaakaaakakaakaaaaaaakakaaakkkakaaakaakkkaakkakaakkkaaakakaaaakkakkkkkakakkkaakkkakkkaaaaaaakakakkkakakkkkaakkkakkakkkkaakakkkakkaaakkkkaakkkakkakakaakkakakaakakakkkaakaaakakkakkaaakakkkkakakakaakakaaaaaaakkaakaakkkaakaaaakakakakkkkaaaakaaaakkkkkkkkkkakkkaaakkakkaakaakakaaaaakkaaaaaakakakkkkkkakakkkakkkaakaakakakakkakaaakaaakkkaakkkakakaaaaakaaakkkakakaaaaakaakaaaaakkakkkkkakaakakakakaakakakakakakaaaaaakkakkaakaakaaaaakkkkakaaakkaaaakaakkkkkakkaakkkakakkkaaakaaaakkkkkakakaakkaaaakaakkkkaaaaaaakakkkakkkkaakkkkakaaaakaaakakkkkakkkakkakkkakkakaaaakkaaakkaakkakaakaaakaakaaakaaakaakakkakaaaakaaaaaaaaaakkakakkakkkakkaaakakaaaakakaakakaakaakkakakkkakakaaakaaaaakakkkkakakakaakkakaakkkaakaaakakakkkkakaaaakaaakakaakkkkakaaakkakkakaakaaakkkkaakaaakaakkkkakakakakkaaaaaakkkakakkakkkakakkakakaaakakaaaakaakakkakkkakkkakkkakakakakkkaaakkkkkakkaaaaaaakakaakakakaakkakkakakkaaaakkkakakkaakkkakkakkaaaakkkakakaaakkakkkakkkkakkkkkkakkkakkkkaakkkkakkkkkakkkkkakkkakaaaakkaakkkkkkakkaakkkaakakaakkkkaaakkakkkaakkaakakkkkakkakkkkakaaaaaakaakakkkakkaakkakakaaakakkaaaakakkkkkkaakkaakakkaakaaaakkaakkaakakkaaakkaakkkakaakakaaaakkakkkaaakkakaaakkkakkakkkkakakkkakaaakakkkkkakaaaakkaakkkakkakkkkkkkakkakkkakaakkaakaaakakaaaakaaakkkkkkakaakaakkakakkakkkakkakkakakkaaaaaakaaakkakakakakkakaakaakakkkaaakakkaakkkkkaakkkkaakkakaaakkakakaaaakkakaakaaaaakaakkkkkakkakaaaaakaaakakaakkkkaakaaaakakkakakkaakaakkakakaakakakakakkkkkakaaaaaaaaaakkaaaakaakaakkkkkaaakakaakkakkaakkkkkaakakakaakakakkkkaaaakakkkkkakkkkakakkkakakkkkaakakakakaaakkakaaaaaaaakkkkakakkakakakkaaakakkkaakaakkkkkaakaakkkkkakkakkkaaakkkkaaaaakkaaakkkakkakkakakkaakkaaakakakkaaaakkakkkaaakkaaaakaaakkkaaakakakkkkkkkakakkkkaaakkakaaakkakakkkaakkkkakaakaaakakaaakaakkaaakkkkkaaaakkakkaakakkkkakaaakkakaakkakkkkkkkaakaakaaaakkaaaakkakaaaakkkkaakkaakaaakakkkkkkaakaaaaaaaakkakkaakkkaakaaaakaakkkkaaakakakkaaakkakkkaaakaaaakaaakakakkaakkaaaakaaakakkkaakkaaakkakkkkakkakkkkakkakakaakkkkkkaaakaaaakkkkakaakakkaaaakkkkaaakkaakkkakkkakaakkakaakakkakkkkaaakkakkkakaaakkakkkkkkakkkakakkkkaakakkkakkakkkkakkaakkkakakakaaaaakakkkkkaakaaakkaakaaaakakkaaakakaaaakakkkkakakkakkaaaakkakkkkaaakkkkakakaaakaaaakkaakaakaaakkakkkaaakaakaakakakkkkkaaakaaaaakaakkkakaakkakaaaaakkkkakkaakakkkakaakkakkkkkaaaakkaaaakkakkaakaakkaakkakaaakkakkkkkakkaakkkaakakakkkkaakaaakkkkaaakkakkaakkakakakakakakkaakkkkakakakkakkakkaaakkakaaakkkkakkkakakkaakaakaakkkkkkkkkkaaaaakaakkaakkaakaaaaaaakkakkaakkkkkaaakaaaaaakakkakakkkaakkkkakkkaakkaakaaakkkaaakakaaaaaakkakaaaakkaakaaakkkaaaakaaakakakkaakaaakkkkkkkaakaakkkaakkkkkkaaakkakakakkkakkakaaakaakkkkkkaaaakakaaakakakkkakakaaakakkaakkakkakkkkakaakkkaakkkkkkakkaaaaaaaaaaaaaakkkkaaaaakaakkkakkkakaaakkkkaakkkaaakkkakkaakaakkkkaakkkakakaaakkaakaaaaaakakkkkkaakkaakkkaaaakakkkkkakaakkakkaakaaakaaakkaakkaaakkkkakkkkkaaaakakaakakakaakakakkkakkkakkakkkaakkakakkkakakkkaakakakkkaakaakaaaaaakkkkaakkkkaaaakakaaakaaakkakaaakakkkaaakakakkkkkaaakkkkaaakkkakkkkakkkaakkakkakakkkaakkkkkkaakkkkkkkkakakaakaakkkkaakkkakkkkkkaaakaakkkakkakkkkaaaaaakakkkakaaaaaaakaaaakakakkaaaakaaaaakaaaakkkakaaaaaakakakakakakaakaakakaakaakaakaaakkakkkaaakakkaaaakkkaaakakkakaaaaakakkkkkakakakaaaaaaaaaaakakakkkkakakakakaaaakkakaakkaakkkkkkkakaakaakkkakkakkakkkaakkaakkaaaakakkkakkkakaakakkaakakakaaakkakaaakaaaaakkkkakkkakakaaaakkaakkakaakkaaaaakkkkkkaaaaakakkakakkaakkkkkkkkkkkkkkkkaaaaaaakkkkkakaakkaaaaakkaaaakakkakkkkakaaakakaakakaakkkakakaakkkakaakaaakaakkkakaakakkakkkakaaaakakkakaakakkaakakkakkkkaaakakkaaaaakaakkkakkkaakakaakkaakkakakkakkakakakkaaaakkakkkkkkkkkkakaakkkakkkaaaakaaaaaakkkaakakaaakkaakaakkaakkaaakakakkaakkaaaaaakkkaaakaakakkkkkaaaakkaakakaakkkkkkakakakaakakakaaaakkkkkkaakkkakaaaakkkakakaaaakkaaaaaakkakaaakaakkakkakkkaaaakkkakaaakaaakkakakkaaaaakkkakkaakaaaakkaaaakakaakaaakaakkkkkakaaaaakkkkaakkaaakakaaaaakakkaakaakakkakaaaakkakakakakakkkkkkaakkkaakkkaaaaaaakkkaakakakkkkkakakkakkkkkaaakaakakkkaaakkkakkaaaakakakakaaaaakakkkakakkakkakkkaaakakaaaaakakkaaakkkakakakakakakkkaakakaaakkakkaaaaaaakakakkkakkkaakkakakkaakakkaakaakaaakakaaaaakakkaaakkkkaaaaakakkkakakkakaaaaakakkakaakkaaakkkakkkakkkkakkakkakkaaaaaaaakkakaakaakakkkakkakkaaakkkkkakaakakkkkkakkkkkaaakakakaaaaakaakaaaaakaaakakaaakkkkaakaakaaaaakkkkaakkaaaaaakkaakkakkkakkakakakkakkkakakkkakaakkakkkaaakakkaaaakaaakkaakakakkkkkkkaaaaakkkaaaaaaaakkkkakkaaakaakakakaakakaakakkkkkkkkaaaaakakaakaakaakkaakkaaakakkkkkakkakaakakkaakaakakakakakkkkkkakkaaakkaakakakkakakaaakkkkkkkkkkakakaaakakaaakaakkkaaakaaaakkkaakkkakkakkakkaaaakakkkaaakaakaaaaaakakaaakkkkkakkaakkakaaaakakkkkakkaaaaaaakaaakakakakkakakkaaakkkakaakakaaaakkakkakaaakkakakkaaakkakkakkaaaakkaakaakakaaaaaakkaakakakaakaakakaaaakkkakkkakaakkakaaakkakkkaakkkaaaaakaaakkkakkkaaaakakkaakaaakaaakkaaaakaaakkkakkkakkkaaaakkkaakaaakakakakaaaaaaakkkkakaaaaaaaaaakakkakkaakkakkkaakkkkkakkkkkkakkkakakkkkakakakaaaakkakaakkakkaaakaaaaaakaakakaaaaaaaakkakkakakaakaakakaaakkkkakkakaakkkakkaaakakkkkkkkkkaakakakkakakkkkaakaaaaakaakkaakkkkkakaaakkkkaaakaaakaaakakaaaaaaakaakaaaakaaakaakakakkkakaaaaaaakkkaakkkkkaakakkkkakakaakaakkkaaakaakaakaaaaaakaakkkkkkkakaaakakakkkakkkakkakaakaaakaakaaaaaaakaaaaaakkkaakkaaakaaakkaakaakkkkkaakakkakkaaakaakkaaakkkakaaakkkaaaaakkakakakaaaakkaaakaakkkkkkaakkkaakakkkaaaakaakkaakkkkaakaaakkakkaakaaaaakkakkaakkakkkkaaaaakakkaaakaakaakakkaakakkkaaakakkkkkakkkkakkkkakakkkkakaakkkakaaakkkakakaakkkaakakakkaaakkkaakkkkakaaakaakaakkkakkaakkaakakkaaakkkakakkkkkaakkaakkkakkaaaaakaakkkkkaaakkkkakkakkkkakaaakaakaakakkaakkakkkkaaaaaakaakaaaakkkakakkkaakakaaakkkkkaaakkakkkkkaakakkaaaakkkkkkaaaakkaaakkkaaaaakkakkkkkakakakkkkakakakakaakkakaaakkkaakakaakakaaakkaaaakaakakakkkkkakkaaaaakkaaaakaaaaaakakakakkkkkakkkkkakaaakkkkkkkaakkakaaaakakakkkkaaaaakakkkakaaaaaaakaaakkaakakkakkkakkakaaakakakkakkakaakakaakkakkaakkaaakkkkkaakkaakaaaaaakkaaaakkkakkkkkaakkkkkakkakkakkkkkkakakaakkakakaakkakkkkkkkaaaakkaakkkkaaaakkkkkkkkkkkkkaakkaakakakkakaakakaakkkkakkkakkaakkkkaakkkakakaakaaakkaakaakkkkaakkkkakaakakkaakkaaakaaaakakakkaaakkkakkkkaaakkaakaakkkakaaakkakakkaaaaaakkakkaaakaakaaakakkkakkkaakaakkaakakkkakkkkaakkakaakkaaakakkkakakakkkaaaaaakkakkkkakaaakakkakaaaakkkkaakkkkkkaakaaakaakaakaakakkkaaaaakkkakakakkakaaaakaaaaaaakkkakkkaaakaaaaakakkakaakakakkkakakakaaakaaaaakakkakaaaakakaaakkakkaakkkakaaaaakkkkkkkkkaaaakakakkkaaakaakaakkkakakaakkakkkkkkakkkakaakkaaakaaakkaaakaakaaaakaaaakkakakaakaaakakaaakkkakkkakkkkkakakkaaakakkaaaakakakkkkkaaakaakakkaakaakaakkkaaakkakakkaaakaaakkakakkkaakkakkkaaaaakakkaaakaakakkaakaaakaaakkkkkkkakkkkkaakaakaaakaaaakkaaakaaakaaaakaakakkkakkkkkaakkaaaakkakkaakakaakakaaakkakkakakkkakakakkaaakkaakakaakaaakakakkkkaaakakakkkakaaakaakkaakkkakakkkaakkkkakkkaakkakaaakkkkaakaakaaaakkkakakkkkkakakaaaakkkakkaakkkakaakkakkkkakkaaaaaaakaaakkkkakkkaakkkakkakaaaaakaaaaaakakaakakaaakkkaakkkaaakkkkkkakkkakkakakaaakkkkakakakakakaaaakkakakkaaakaaakkaakkkakakkaakakkaakaaaakaaakkakakkkakkkaakakkaakakkkakaaaakakaaakaaakkkkaaaakkkakkaaakkaaakaaaakaakkaakkaakkkkkakaaakakaakakkkkakaakaaakkkakkakkkakakaakkaakkaaaaakaaakakakkkkkkkakakkakakakakakkakkaakakkakaaaaakaaakaakkkkakakkakkakkkkkkakakkakkakakkaakaaakkkkkakaakakkaaaaaaaakkkkaaaakkaaakakkakaaakkkaakakkaakaaakakakkaakkaakaaakkkkaaakakakakkaakkkakkkakkkkkaaaaaaakakaaakakaaaaakkakkkkakakaaakaaaaaaaaakkkaakkakkkkaakakakkaaakaakkaaakkakakkaakaaaakkkkaaakakkakakkkkkkkkakakkkaaakkkkkkakaakaaaaaaakaakaaaakkaakaakakaakkkaaakkakkkaaakkkakkakkkaakkakaaaakaaakaakakkkkaakkkkakkakakaaakaaakakkaaaakkkkkkkkkkkaakkaakkkkkakkkkkkkakakaakakaaakkkakkakkkkkakakakakkkakakkakakaakakaaaakkkakakaakkakaaaaakkakaaaakaaaaakkkkkakakaaaaakkakaakaaakaaakkkakkkaakakkkakkkkakaaaaakkkaaaakkaaaakkkakaaaaaaakkakakkkaakaaakaakkkkkaakkaakakkkkaakkkakkkaakaakaakkkkakaaakkkkkakaakkaakakkkakaaaakkakkkakkkkakkkkakkkaakaakkkkkkaakkaakakkakakkakkkaaaakkkakkakkaakkkkkakkakakkkakkkkaaaaaaakakkakakaakkakkkkakaakaaaaaakakaaaaakkkkaaaaaaaakkaakakkakkakaakaaakaaaakaakkkkkakkaaakkaaakkaaakkkakakkaakkkakkkaaakkakakkkkakakkakaakaaakkaaaakakaaaakkaaaakkkaaaakakkaaakaaaakakkakakkaakaakaakkakakakkakkaaaaaaaakaaaaakkkakakkakkaaaaakaakakkakakkkkaaakaaaaakaaaaaakaaaaakkakaakaakaaaaakakaaaakkakkakkkkaakkkkkkkkkkaaaaakaakkkakkkkakaakaaakaaakkaakaaaaakkaaaakkkaakakaakkkkkakkkkkaakaaakkkakakkkaakkkkkaaaakkkaaaakkkkkakkkkkakkaakkkkkaaakkkaaakkakakaaakkakkakakkkkaakkakaakakkakakkkkakaakakaaakakkaaaaaaaaaaakkaakkaakkkkkakkaakakkakkakkkaaakakaakakkaakkakakaakaaakkkakkkaakaaakkkaakkkkkakkkkaakkkakaakakkkaaaakakkkaakkkkkkakakakkakakkakkkkkkakaakakkaakkaakkkkkkkkaaaaakkkkakakakaaaakkaaaakkkaakkkaakkaakaaaakaaaaakkkkaaakkkkaakkkakkkkakakakaaakkakkaakkkakaaaaakakaakakakakakkkkkkakkakkakkkakkaaaaaakakkakkaaaakakkkkaakkaaaakakaakaaaakkakakaaakakkakkkaaakkaakkkkaaakaakkakkaaaakakaaakaaakaakakakkkaakaaaaakkkakkkakakkkkaaaakaakkkkkaakaakkkaaakkakaakkaaakakkkakakaakkaaaaaaakkkakaaakakkakkkakaakaakkkkakkaaakaakkakkakakakakkakkaakkaaaaaakkakkkaaakaakkakaaakkakaaakkaakkakkakakkaaakaakaaaaakkakkkkakakkkkakakakakkaaakkkaaakaaaaaakaakakkkaaaaaaakaaaaakakkkkkkkkakkakkkkaakkkaakkaakakakakaaaaakakakakkaaakkkkkkaaaakkkaakkakaaakkkakkkkaakkakakkakkkkkkakaaaaakakkkakkaakkkakkkkkaakkaakakaaaakkakakkakkaakkkaakkkkakakkkkkakakakkaakkkaakaaakaakakaaakaakaakkakaakaaaakaakkkkkaaakkakkkkkkaaakkaakakakakkakakakkakakkkkkkakkkakkkaaaakakakkkaaakakakaaakaaakkakkkakaaakkakkaakkkaakakakkkkkaaakkakkkaakkakkakkkakkkakkakakkaaaaaaaakaaaaakaaakkakakaakkakaaaaakaaaakkkaakkakkakkkaakaakkkaakkkakakkaaakkaaakkkkaakakaakakkakakakakkkkaakkkkakkakkkkakakkkakakaaakkkakakaaaakkkkkkaakkakkakakaakaakkkkkkaakaakaakkaakakakakakkkaakaaakkaakkaaaakkakkakkkkkaakkkaakkaakaaakkkkkakkaakakaakaakakkkaaakakkkkakkkaakakkkaakkaakkkkkakakkaakkkakaakakaaaaaakkkkkkkkakakkakkaaakakakkkkaaakakkakakaakakkaakaakaakakaaakkakakkkkkkkkkaaaakaaaaakkaaaakaakaakkkkkaaaaakaakkaaakakkkakkakakkkaakakkakkakaaakkkakakkkakkakakkkaaakkkkakkakaaakkaaakkkakaaaaaakakkakkkkkkakkkkakakaakkakkaakkkkakakaaakkakakkkkkkaaaakkkaaaaakkaaakkaakkakaakakkaakkaaakakkkkkakkkkaakkakakkaakakaakkkaaaakakkkkkkkkaaakakkkkakkkakakakkakaakkakaakkakaakakkaakakakaakkkakkakkkaaaakkkkkaakkkkkakkkaakkakaaakakkakkkaaakaakkaaakkakaakkaaaaaakkkkaakkaakaaakakkkkkkkakaakaaakakkkkkaakkkaakaaaaaaaakkkkaakakakkaakkkakkkakakaaaakaaaaaakakaakkaakakaaaaakkaakaakaakakkkkkakakkkkkakkakakaakkkaaaaakkaakakaakkkaaakakaakakakkaaakaaakkaaaakkkkakaakakkaakkkakakaaakakkkakakakkakkaakkaakkakakkkkaaaakkkkkkkakakkkkkakkaakakkakaaaakakakkkakkaakkkkaaakaakkkaakakakakaaaakkkakaakkakkkaaaakakkkkkkaakkkakakaaakaaakkkaakaaakaakkakkaaaakakkkakaakkkkkkaaakkaaaakaakaaakaaakakkaaaaakakkkkaakakkakakakakaakkkaaaakkaaakkkaakkakaakkkkkaakaaakaakkkkakkkakkkkakaakakkakaakaakkkkkakkkaakkkkkkakakakkkkkakkkaakkkakkkkkaakkakkkakkkakaaakkakkkkkakkkkaakkakaakkaaakakkakaaaakkakkkaaakakaaaaaaakkakkaakakkkaaakakaakkkakkakkkkkkakkkkaakkaakkaakaaaaaaaakkakaaakaakaaaaakaakakaaaakkkakakaaaaaakakaaaaaakakkakkkakakkakkkaaaakakakkkkakakakkkakkakkaakaakaakkkaaaaaakaaakakakkkkkaakkkaaakakaaakkakkakakakakaaakakkkkakakkakaakaaakaaakakkaaaaakkakakkkkakkkkkkakkaakkkkaakkkakaaakaakkakkakaaakkaaaakkaaaakaakkaakakakakkkakkakakkakkakakaakaaakakkkakkkakkaakkaakkakakakkkkkakkaakaaakkkkaaakaakaaakkkakkkkaaaakkaakkkkakkaakkkkkkakaaakkkkkaaaaaaakaaakkkaakaakkaaaaakaaakaaakkakkaaakkakaaakkkakkkkkakakkakkaakkkkaaakakkkkaaaakaakakakkakakkakaakaakkkaaaaakaakaakkkkaakkkakaakkaaakkkakkkakkakaaakkaaakaakkaakaaakkaakakkakkkakaaakakaaaakkakaaakakkaaaaakkaakkakakakaakaakkaaakakkaaaaaakkakakaakkkkkaaaaakkaakkaaaakakkaaaakkkkkakaaakaaakakaakaakkkakkkkaaakakakaakkkkaaaakkkaaakkkkaakaakaakkkakkakkakkaaaakaakkaaakkkakaakkkaaaakakkaakakkakakaakkaakkaaaakkakaakakkkakkkaakkaakkakakkkakakaakkkkkaaaaakaaaaakkkkakakkkkkakkaaakakkaakaaaakkkkakaakaaakaaakaaaaaakaaakkkaakaaaakaakakaaaaaakakaakkkkaaakkaaaaakaakakakkkkakkkakkaakkakakkkkkaakaakakakkkkkakakakkkaakakkakkkakakaakakaakkaakkkkkkaakkakkkaakakakkkaakakkkkakkakakkkkaakkkaaakakaakakkaaaakaakakakakkaaaaakakakkakakkaaakaaakkkkkkaaakaakakkakkkaaakkkakakaaakkkaaakkkkkaakkkaaaaaaakkkkkkakkkaaaakkkkkakkaaaaaakakaakakkakakakakkkaaaakkkakaakaaakkkakakaakkkakkkaakaakkakkaakakkaaaaakkakkkaakkakaakkkkkaaaaaaakkkkaaakaakkakaaaaakakkaakakkakkakakaakaakkaakaaaakkkkkaakakaaakkaaaaaaakkkaaaaaakakkkakakkakkkkkaaakkakakkaaaaakkkkkakkakkakkakkkakakakkkakkkkaaaakkkaaakakaaaaakkkkaaakakakaakkaaakakakakkakakkakakakakaaaakkaakkkakkaakkkakaakaakakkakkaaakakaakakkkakaakkaakaakaakakkaakkakakkaaakkaakaakakakkkakkakkaakkakakkakkkkkakaaaaaaakaakkkaaaaakkkaakkkkkaaakkkkkkakkaaakkkkaakkkaaakakakkkakkakkkakkkakakaaakkaaaakkaakaakakaaaaakkkkkakkaaaaaakkkakkakkkakakaakaakaakkakaakkakaaakakkkkkaaakaakakkkkakkaaaakakakkkkkaaaaakaaakakaaaaakkkaakkkakkakkkakaakakaakakkkkkkkkakakkkakkakaaakakaaaakaaakakkkakaakakaaakakakkaakkaakakkkkakkkaaakaakkaakaaaaaakaaaakkkkkkkkkkkaaakkakkkkaaakaaakkakakaaaakkaakkaakkkaaaakakkkkkkkkkkkakakkaakaaakaaaakkkakkaakaakaakaakkaakkaaakkakaaaaakaaakaaakkkakkakkaaakaaaakaaakaaaaakakkakakakaaaakkaaakkakkakkaaaakkaakkaaaaaaakakkkaaakkakaakaaakkaaaakkaakkakaaakkakaaakkkkkkaakkkaaaaaaakakkkkakakakaaakkaaakaakkaakkaaaaakakkaaakkakkaaaakkkkkaakaaakkkkkakkaaakakkkkkaaaaaaaakaakaakaakkkkkkakakaaakkkkakkakaaakakaakkaakakakakaaakkakkakkkaakakkkaaaaaaaaaaaaaakaaaaakkakkaaakaakakaaakkakkkkaakakkkakaakkaaaaaakkakakaakakakaaaakaaaakkakaaakakaakaakkkkkaakaakkkkkaaakkaakaakkkkaaaaakakaaakaaakkaakaaakkakakaaaakkkakkkkaakkkkaaakkakkaaaakaakaakakakkkakkaakkakaaaaaakkkkkkkkaaakaakakkkakakakkakaaaakakaakaaakaaakaaakaakkkakkkkakkaaakaaaaaakkaaakakakkakakaaaaaakaaakkkakkkakkkkakaakkakakakkakkakkaakakkkakkkkakkakaakkkaakakkaaakakaakkakkaaakkakkaakaakaakkaakkakaakakkakaakkkkkakkakaaaakaakaakakkkkaaakkkkkkkkkkkkaakkakkkakkakkakakakkaaakkaaaakakakaakakakkaaakkkaaakaaaaaaaakakaakkkakkakkaaakakkaaakkaakakkaakaakkaakkkkkaakkkkkaakkkkkaaakkakakkkkkkaakaaakkakkkkakkkkkkaakakkaakakkaakkaaakkkkkakakaakaaakaakkkkaaakkaakkkkkakkakaakakkkkkkaakakaaakkkkaaaaakaakkkkkakaaakakkaaaaakakaaakakkaakkkaaaakaakakaaakkaakaaaakaaakkakkaakkaaakkkaaaakakkaaaaakaaakkkkaakkakkaakaaaakkakkaakaakaaaakaaakkkkaaakkaakaaakaaakaakkakakkaakkkkkkkkakkaaakkkaaakakkakkakaakaaakkkkaakkaaaakakkaakkaakakaakakaaakkkkaakkkkkkakkkakaakaakakkkkakkkkkaakaaaakakkkakkakkkkaaaakkaaaakaaaaakkakaaakkkakkakkaaakkkaakkkaakakaakkakaakkakkaakkkkkkkkkkaakaaaaaakaaakakkkkkaakkakakaakakkaakaaaakaaaakaaakaaaakkaaakkkkkaakaaaaakkkakakakaakkkkaaaaakkkkakaaaakkaaaakakkkakakaaakakkaakkkkkakakkkakkkaakkkkkakkkakkkakakkkaaaaaaaaakkakakkaakkaakaakaakaaaakkkkkkkaakaaakaaakakaakakkkkkaaakkakkaaaaaakaaaakakaaaaakakaakkaakkakaaakkkkakaakakakaaaakkakaaakkaaaakkkaakkaakaakaaaakkakakkakkkaakkakkkkkkkkkakaaaaaaakkkkkkaakakkkkakakaakaakkkkkkakkkakkakkaaakaaaaaakkakkaaaaakakakkkakakaakaakkakaakakkakkkakkkkaakakaaaakakkaaakkkkkkkkkkkaakaaakkkakkaakaakkaakakkakakkkaaaaaaakakaaakaaakakakkaaaakkkkkaakkakakkkakkaakakakakkakkaaakakakkaakaaakakaakkaaakaaaaaaaakaakkaakkkkkakakkaakkakaaakaaakkkkkakkakkaakkakkkkkakaaakkaaakkkkakkaakaaaaakkakkaakakakakkkakaakkakkkakkkkaaakakaakaaaaakkaaakakaaakkkkkakaakakakaakakakkkkkakaaaaaakkkakkkkkaaakakkakakkkkakkaaaaaaakaakkkakakkkaakkkkkaaakakkakkaaakkakaakkakkakkkkkakkaaakkkkkkkkkkkkkkkakakaaakakkaaakkakkakaakkakaakakaakkaakkakakaaakkaaaakkkakaaaakaakkkaaakkkkaakaaaakkaakakkkaakkaaaaaaaakkaakkkakakakkakkkkaakaaakkakkkaaakkaaakaakakkkkkakakkkkakkkakaakaakaaaakkakkakkkakaakkkkakkkakaaakkaakakakkakakkaaakkakakkkkaakkakkaaakkaakakaaakaaakkakkkakkaakkkkkkkakkaakakkkakkaakkakaakkakkkkakaakakkkkaaaaakkkkkkakakkkaakaakakaakkkaaakakaaaaaaaakaaakaaaaaakaaakkkkakkakkaaakkaakkakkkaakkkkaaakaaaakkaakakakkaaakkaaaakkakkkkaakkaaakaaaakkkaakkakkkkaakakaakaaaaakkkakkkkakakaaakkaakakakkaakakkakkkkkkakaaaakkkkkaaakakkkaaaakakaaaaaakakaakakkakaakkaaaakkkkkakaakkkaakkkkaakakkaaakaakkakkkkaakaakaaaakaaakkkaaaaaakkaakkaakaakaakakkkkakkaakkkakaaaaakkkakakkkkakakkaakakaaakakaakakkkkkkkaakkaakakaakkaakkakkakakaakkkakkkkkakakakaaakaakkakkkakaaakkkkakkakaaaaakkakaakaakkkkaaakaaaaakkakkkakkkaakkkaaaakakaakkaaaaaaakakakaaaakkakkkkkaaakaaaakakkkkkaakkaakaaakkkkakkakaakaaaakaakkkkkkaaakakkkakakkkakkkkkakkaaaakkakaaakkakkkakaakakaaaaaaakkkaaakaaakaakakkkkaaakaaaakkkakkkkaakkkkkkkkkakkakkakakkaakakkakakaaaakakakaakakaakakkakkkkkakaaaaakkkaaaaaaaakakaakaaaakkkkakakakkaaaaaakaakkakkkaaakkaaakkaaaakkakaakaaakakkkaaaakkakakkakkaakkkkaakaaakkaakakakaaaakkkkkakkkaaaaaakkkkakkaaakakkaaakaaaakaaaaaaakkkaakakaakakakaakkakaakakakakaakkaakaaakakakkkkakkkaaakkkkaakaaaakaaaaaakakkakakkaakkakaakakkakakkakkkkakkaakkakkkkkkkkaakaakkkkkkkkkkkkaakkaaaaaakkaakaaaakkaaakaakkaaaaaaaakakkakkkkaakakaakkkkakakaaakkakaaakaakkaakkkkkkkakkkaaakkakkkkkaaaakakaaaakaaakaakkkakkakakkakkaakakaakaakakakkkakkaakakkkakaakaaaakkkaaakakkkakakkkkkkakkaakakkaakkkaaaakkakaakakaaakkakakkakaakkkkakkkkkkakakkkaaakakaaakakakakkaaakkaakkaaaaaakkkkakakkkkkkakakaakkakkakkkkkakakkakkaakaaakkkakkakkaaakaakkkkakakaaaaakaaakkkkakkkkkaaaaakaaaakaaaakkkkkakkkkkkkakaaakkkaaaaaakakkaaakaaakkkakakaaakakkakakkkakaakakkaaakakkkkkkakkaaakakkkkkaakkaakkakkakaaaakakakakakaaakaakaaaaaakkkkkakkkkkkkkaaakkakakkaakkakkkkaakaakaaakaakaakaaakkkakkaaakakkkaaakakakkkkkakaakaakaaakaaakkkkaaakkakaakkakkkakakkkkkkaakakkaaaakkaakkaakakkaakkaaaakaaakkkakkakaaaakkakkakakakkkkakaaaaaaaakaakkakkkaakkaakkaakkkkkaakaakkkaakakkaaakkaaakkkkakakakkakkkkakakaakakkkaaakkkakakkakakaaaaaakaakakkkkaaakaaaaakkaakkkkkkkkkakkaaakkkakkaaaakaakakkkakakakakkkakakkaaakkaakkaaaaakaakkkakaakkkkakkkkakkkakakaakkakkkaaaakaakaakkakaakkkkkkkkakaaakkakakkaaakkakakkakkaakkaaaaakkakkakkkkakkaakkakkkkakkaaaaaakakkakkkakaakkakaaaaakkkaakakakaaakakkkkakkkaakkakaakakakkakaakkaakkaakkkaakakkkaaakaakakkkkkaaakaaakkaakaaakkakkkkkaaaakakkkaaaaaaakakkkkakkkaaaakaaakakakkkkakakkkakaaaaakakaaaaakakaaakkakaakaakakkkkaaakkkakkaaaakkakkakkaakkkaakkakkkaakkkkaakkaakkaaaakkkaaaakakakakkkaaaakkkkkakakkkkakaaaaakakakakakkkkaakkkakkkaaakkkkkkaakkaakkakaaaaaaaakkkkkaaaaakaakaaakkkakkkkkkaaaaaakkakaakaaaakkakkaaakkkkakkkaakkkakakaakkakakkkakakaaakkkkkkkkkaaaaakkakkaaakakkkakakaakkkkaakkkkaakaakaaakakkkkakkkkkakkkaakakkakkkakkakkkkkaaaakkkkaaakaakkkkkaakakaakakkaakkakakkkaakkkkaakakakaakkaaaakkkkkaakakakaaaakkaakkaaakakkaaakkaakkaakaakkakkakkaaakkakakkkakaakaaakaaakkaaakakkkakakaaakkkakaakkakkakkaakaakakakkaakkkaakkkkkaakkakakkaaaakkakkakkakkkkkaaakkkaaakaakakkaakkaaakaakaaakakakaakkkakakkakaakkakakaaakaaaakakaaaakakkkakakaaaakakkkkakkkaaakakaakaakkakaaakakkakkkkakkakkkaaakkakkakkaakaakkkkaaakkkkaakkkaakkakkkakakaakkkakkkaaakkaaakakaakaaaaaaakkakaaakkakaaakakkaakkkkkaakkakkakakkaaakakaakaaakaakaakakaakaaaaaakkkkaaaakkkkaaaakakkaaakaaakkkakkkkaaaaakaaakaakkaaakkkaakkakkkkkkkkakakakaaaaaaaakkaakkaaakkaakakakkkkaaaakkaakaaakaakaakkkkaaakkakkaaakaakakkkakakkkkakkakkkkkaakkaakkkkakkakaaaakkkkkkkaaaakkkkakkaakkkkakkaakkaaakkkakaakkkkkaaakaakkaakkakakakaaaaaakakaakakaakakaakakkkakkaaakkakakaaakaaakkkaakaaakkkakkaaakkakkkkkkkkakkkkakaakkkaaaaakkkaaakaaakakkkaaaaaakkakkakaakakakakakaakkakkkkkakakkakaakkaakakkkkkakkakakakkkkkakkkakkakkkaakakkakakkaakkkkaakkkakkakkkkkaaaakkakakkkkkakkaakkkkkaakkaakkkkaaakaaakaaakkakaakkkkaakkaaaaaaaakaakakaaakkkaakkkaakaaakakkaakkakaakaaakkaakkakakkkkaakkkkakkkkkkakaakkkkakkakaakaaaaakkkakkkkaakakaakkaakakaaaakkkkkkkaakaaakakaaaakakaakaaaaakakkaaakkaaaaaaakkkaaaakakaaakkakkkkkkkkaakaaaakkaaakkkaaaaakakkaakkkaaakakaaakkakkakakakakakakakkkkkkakkkkaakaakkkaaaakakakakkkkkaakkaakkkkkaaakkakakkkkkkkaaaaakkkkkakkakaakakakaakaaaakkaakkaakaaakakkaakkaakkkkkkaaakakaaaaaaakkkakkakkaakakaakkkkkakakkkakakakkaaakkkaaakakaaaakkaakkkkaakakkkakkkkakaaakkkkkkaaaakaaakkakaakkakkaaakkaaaaakkakaaakaaakaakkkakkkaakkakakakkkaakkkkakkkaakkaaaakkaaakkkkkkaaaakakkaaaakaaaaaaakakaakkaaaaaakkakkakkkkkaaakakaaakaaakakakakakakaaaakkkaakakkkaakkkkkkaakkkkakkkakaakkaaaakakkakkaakakkakakkkkaakkakkkkaaakaakkakakakkaaaakkaaakakkakakakaaaaaakkakkaaaaaakkaaaakkkakakaaaakakkkkakkakkkakkkakaakaakakakkkkkkaaaakkkaakaakaakakaaaakkakaaakakkaaaakkakakaakkkakaakkkaaakakkkakaaakakakaakkakkaaaakkaaaaaaakkkaakkakkkkkkakaakkakkakaaaaaakaaakaakaaaakkkkakakakaaakkaaaaakkaakkkaakkkkkkaakaaakkkaaaaaaaakakakkakakakaakaakakkkaaaakkkkakakkaakkkakaakaaakakaakkkakkkakkaakaakakkkkkaaakakaaakkkkkkkakaaakkkkkakaakkakaakakkkaakkaakakakkakaaakkkkaakkakkkkakakakkakkkkakkkkkakkkakakkkaakakaaaaakaakkkakkakaaaaaaakakaakkakaaakkaakkkkakaakaaakakkakkkakaakkkaaaakakkkaaakkkkkaaakkkaaaakaaakakkkkkaaaakkkkaaaakakkakakakaakaakakakakkkakaaakakkakaaaaaaakkakakaaakkaaakaakaakkakkaakakkkaaakkkakkkkakkakaakakakaakkkaaaakkaaakaakkaaaaaakkakkakakkkkkakkkkaakakkkaaaaaaakkakakakaaakakakakkkkkkkkkaaaakaakkaaaakkkkkkkkkakkkaaakaaaakakakkkakkakkakakakkakaaakakakkkkaaaaakkaakakkakaakkkkakakkakkaaakkaaaaakakakkaaakkakakakakkkkkkkaakakakkaakkkakaakkakkkakkaakakakaaaakkkakaakkkkkaaakkkkkkkakkkaaaaaaakkkkkkakkkkkkkakkakaaaakkaaakkkkkkkakakakaaakkakkkaaaaakkaaakkkkkaaakkaakkakkkaakkkkakakkaakkaakakkakkkkakkkkkakakkkakkaaaakkaakkakkkkakkakkkkkakkaakakkkkkaakkkakkkakaaaaakaaaaaaaakaaaaaaaakaakkkakkakkkkakkkkaaaaakkkakkkkkkkakkkaaakkkaaaaakkkaakkkkakakkaaaakkakkkaaaakkakakkkakkkaakakaaakakaakakkkkkakkkakaakkkaaakakakakkakakkaakakakkkkaakakakkakaaaaaakkaakkakakaakkaakaakkakkkaakakaaaakakkkkakakaaakkaakkkaaaakakkkkkkkkakkkakkaaakakaakakakkkakakakakkaakkkkkaakkaaakakkaaakkkkkkkaaakkkakkkkkkakkaaaakaakaaaaaakakaaaakkkaaakaaakaakkkaakkaaaakaakakaaaaakkkkkkakkakkakaakkaakkaaaakkaakkakakakakkakakkkkakaakkkaakakaakakakkakakakkaakakaakaaakkakkaakkakakkaaakkakkaakakkakkaakaakakkkakakaaakakkkkakaaaakaakaakaaaaakakkkkakakkkakaakakaakaaakakaakkaakkkakakkkakaakkkkkakakkkkkaaakkaaaaaaakakaaaaakkkkkaakkaakkkaaakkakakaaakaakkakakakaaaaaakkaaakaakaakkaaakkaaaakkaaakakaaaakaakkkkaaaaaakkkkkakakkakkkakakkkaakkkakaaakkaaakkkaaaakkkkaaaaaakkkakkkkakkaaaakakkakkaaaaaakkaaaakakkkakaakkkkkaaaaakkkkkaakkaakkakkaakkkaakkakkkaaaakkkaakkkakaakkaaakaakkkkkakkakaakakakkakaaaaaakakkaakkakakakaaakkaaakkkkkkaakkakakkakkkkaakkkkakkaaaakkkaaaakakkakkakkaaakakaaaakkkaakkakkaakakaakkakakkaaakkakkakaakaakakkkkkkkkakkakaakakaaaaakakkkkakakakkkkkakkakaakkakkkaaaakkakakaakkkakaaaaakakakakaakakkakkaakaaakaakaaakakaakakakaakkkkaakkakkaaaakakkaaaaakakkkakkkakaaakkkkkakkkkkaakkakakkkakkakakkaaakkakkkaaakkkakaakakkaakakakaakkkakkakakaaakakaaakaakkkkaaaaaaakkkakakkakkakakkakkkkakakaakkakkaakakkaaakkkkakkaaaakkkaaaaaaakaakakkakakakaaaaaaaakkaaakaakaaaakkakkaakaaaakkaakkkaaakkakkaakaakaaaakkaakkkakkaakaaaakaaaaaakaakaaaakkaaakkkaakkkaaaaaaakkakkakkakaakkakkkkkaakakkaaakkaaaaaakaakaakakkaaakkkkaaakkakaaaakkkkakkkkkakkaaaaakkkkaaakkkkkakkkakkaaaaaakaakakkkkkkakaaakkakkkakkakkkakakakkaaaakaaakkkkakaaakakakkkkkakakkkkakkaaakaakkkkakaakkakkaakkkakkakkkaakaaakaakaakkkkkkkkaaakaaakaakkkkakkaaaakakaakkaakakaakkaaakkkkkaakkaaaakkkaakkkaakkkkaaaakakakkakaakakkakakkakakkaakaaakkakkaakakkakakakakkkaakkakkakkaakkkkkkkaakaaaaaaakakakakkaakkaakakkkaaaaaakakkakaakkaaaaaaakkkaakakkakkakakkakkkaaaakaaaaaakkkkaaakakkakkaakkakaakkkkkakaaaakakaakakkakakkkkkakakkkaakkakkakaakaakkakakkakkkakkkaakkaaaakaakakakaaakakkkaakaakkkkkkkkakkakkakkkkakkkakkkakaaaaaakaakkkakkaaakakakakkkakaakkkkakkakakkakkakaaakkkaakkakakaakkkaaaakkkkkkkakkkaaakkakaakkkkaaaakaakkkaaakakkkkaaaaaakakaaaaakaakkakkaaaakkkkkaaakaaaakkakkkkaakkkaakakkaaaaakkkaaakkkkkakaakkakkkakaakaakkakakaakkaaaakkkaaakkkkakakaaakakkaaakakaakkaakkkakkakakkkakaakkkakkkakkaaakakakkakkkkkkakakaaaakkakaaakakkaaakaaaakaaakakkakaaakkaakkakkakkakakakaakkkakkkkkakaaaaakakakakkkkaakaakkakakakkakkakkaakakakkakakakakaakkkakaakkakkakkakakakkaakkakkakkkkkakkkkakkakkkkkkkkkkkkkkakaaakakkaakkkakkkkaaaaaaaakakaakkaakkkkakkakkakaakkakkaaakakaakakaaakaakaaaaaakkkkakaakkaakkaaakaaaaakaakkaakakakkakakkkkkakakkakkkaaakkkkaaakkakaakkkkakkkkkakaaaaakaakaaaaakaakkakkkkaakkkkakkkkkaaaakaakakkkkaaaaakaakkkaaakakaakaakkakakkaaakkaaakkaakkakkkakkaakkkakkkaakaaakkkkaakaakkkkaakkakkakaaakkakkkkaakakkaakakakkkkkaakkakakakkkkaakkakaakaakaakaaakaaaakaaaaaaaakakkakkaaaaaaakkakakaakkakaaakaakakkakkakkkkaaakkaaaakkkkkakaakkaaakakkkkkkkkkkkkkkkakkakkaakaaaakkkkkkkkkkakaakkkkkkakakkakkakkaakakkkakaaaakakakaaaaaaakkaaakkkkaaaaakakakkakaakaakkkaaakkakkaaaakakkakkkkaakkkkaaaaaakkakkakakkakkkaaakkaaaaaaaakaakkaaakkakkakkakakakaakaaakkkakakkaaakkkaakkkkakakakaakaakkkakaaaakkkkakkkakkaakakaakaaakakkkakakaakkkakkakkakaaakkaaaakakkkkkkkakaakkkakkakkkkakkkkkaakkakkkkaaakaaaaakkkaaaakkkaakkkaaaaaakkakaaakkkaaaakakaakkkaakakaaaakkkaaakkkaaakaakkaaaaaakkkkakkaaaakkaaakkkkakkkkaakkakkkakakkakkkkkkakaaaakakakaaakkakkkaaaakakkkaaaaakkaaaakaakaaakakkkakaakkaakkkkakkkaaakaakaakkkkkkaaaaaakkkkkakkaakaakaaakkaaaakakkakaakakkkkaaaaaaaakkkaaaakakakaaaakaaakkakkakakkkkakaaaakaaaaakkkaakkkaaakkaaaakaakaakaaakakkkakaakkkkkkaaakakkakkaaaaaakkaakkkakkkaakkkkkakakkkakaakkkkkkkakakakkaakaaaaakaaaaaaaakakaaakaakakkkaakkakaakaaakakaaaaaakkaakakkkkkkakkkaaakkkkkkkaaaakaaaakakakkakakkaakkkkkkaakkakkaakakkaaakaakaakakakkkkaakaakkakkkkakakakakkaaaaakkkaakakaakkakakaaakkaaaaaaakaakakkkkaakakaakaakakakaaaaaakakakaakakkkkaakakakkkaakakakkaakaakkkakaaaaakaakaakkkakkakaakaakaaaakaakaakkaaakaakkakkakkkkaaakkakkkkkkaakakkkakakkkkkakkaaakakkaakkaaakakkkakakkkaaakkaakakakakkkakkkakkkkkkkkkkakakakaaaaakakaakkaakaaakkkakaaakakkkkakkakkaakkkakakakkakkakkakakkaaaakkakkkakaakakkakakaaaakkkakaakakakkakkkkkakkkkkaaaakakkkakaakakkakkakkkakkkkaaaaakkaaakaakakkaaaaakkkkkakakaakkaakkkkkkaakkaaakaakakaaakkkkkkakkakakakkakakkkakkaakakkaaakakakakkkakkkaakkaaakkkkkkkaakkkkkkkkaaakakakkaaakakkkkaakaakakakaakkakkaakakakkkaakakkkaaaaaakkkakkkkaakkaaaaakaaakaakkaaaaakkkakkkkaaaakkakakaaakkkaaaakaaakkakkakaaakkaaaaaaaaakkkakakaaaakkaakaaaaakkakkkaakaaaakkakaaakkaakkaakkkaakkkakaakakakkaakkkkaaakkaakakkkakkkkkkaakkkakaaaakakkkkaakkkakakkkkakakaaakaaaakkkkkaaakaaaaakkaakkaakkakakkkkaakakkaaaakakaakaakkakakakkkkkakakkakkkkaakaaakaakaakakkkkakkkaakkkkkkkkaaakakkkakkkaaakkkakaakkakaakkakkakaakaaakkakkakakakkkkakkkakaaaaaaaaakaakkakkkkakkaakaakaakakkakaakakkkkakakkkakaakakaakakkkaakakaakaakakkakakkkkkakakakkakkakaaaakaaaakaaaaaakaaakkaaakkakakkakkaakaaaakkaakkakkkkaakkkaaaakkkkkkaaaakakakkakaakkaaaaaaaakaakkakaaaakaakkaaakakkkakaakkakaaakkakkakkakakkkakaakkkkakaaaaakkkaakkaakkkaakkkkkakkkkkkaaaaakkkaaaaakkaaaakakakkakkaaaakkkkkakakkkkakaaaaaakkakaaakkkkakakkakkakkakkkkkkaakaakaaaaaaaaaakaakkkkaaakkakakakakkkakkkkkaaaaaaakkakaakkaaaakakakaakaakakkakakkkakkkkakkakakakaaakkaakkakkakkkaaaaakkakaaaakaakakkaaaakkkaaakkakkkkaakaaakkkkkkakkkkkaakkaakakkkkakkkaakkkkkaakkkkkkaaakakkkaakaakkaakkkakaakaaaakkkaakakaakkakakakkaaaakkkkkakkkakakakaakakkkkkaakakkaaakkakakakkaakkakaakkkkakkaaakkaakakkkaaaaakkkaaakakkkakakakaakkakkakkkkkakaaakaakakakaakkkaaaaakkakkakaaakkaaaaakakkaakakakkkaaakkkkakkakkakkakaaaaakakkakkaakkkakakkakkkkakaakaakkaaakkkaakkakakakakkkkakaaaaaakaakkkkkkkkakkkaaaaaakkkkaaakkakakkkkakkkkkkakakkkkaakaaakkkkkkaakakkkaaakakaaaakkkkaaakaakkkakkkaaakkakakakkakaaakaaakkakakakkakaakaakaaakkkkaaakkakkkkakaaakkakkkaaakkakkaakakkakaaaaaakkakaaaakkkkkaakaakkakakaakkaaakkkaaakakaaaakaakkaaakkkaakkakakakkaaaaakkkaaaaaaaakaakkkaaaakaakakakkkkkaaaakkakakkkaakaakkkkaaakkkkaaaakaakakkkakakaakakkkaakkaaaakaakakakaaaakaaakaakaakaaaakakkkaaakakakakkkkkkkaaaaakkaakkkakaaakaaakaakkaakakkkkakaaaakakaakaakkkaakakakakkkaaakkaaaaaakaakkaaakaakakkkaakaaakkaakkkkkakakkkaaakkkakakakakkkaaaakaakaakkaaaaaakkaakaaaaaakakkaakaakaakkkkaakakkakaaakkakkaakkkakaakakakkakkakakkkaakkkaakakkakakakkkkakaakkkakaakkakkakakkkakakkakkaaaakakkkkaakkkaakkkaakkkaaaaaakkaakakaakkakkakaaaaaakaaaakkkkkakkaakkaakaaakkkkkkkkkkakkaaaaaaakakkkkkkkaaakakaaakkkkaaaakkkkakkkkkkkaaakakkkakkkkaaaakaakkaaakkaaakkakkkkkaakaaakaaakaakkkaaaaaaaakakkaaakkaaaaaakkkkaaakkaaaakakkakkkkkkaaakaaaakkaaakkkakaaaaakkaakkkaaaaakaakkakkaaaakkkakakakaaakkkaakkkkaakkkkkkkkaaaakakkkakkkaakkaakakkkaaakkkkaakkkaaaaaaaakkkkkaakkaaakakakkakaaaakkkakkaaaaaakakaaakkaakkkkkkaaaaakakaaaaakkkakkaakkkaakaakkkkaakakkkakakkkkakakkkaaaaakakakkaaaaakkaakakakkkakaakaaaakkaakkakakaaakkakkakkkkkkaaakakaaakkakkakaaakkakkakakkkaakkakkkakkakakaakkkkaaakkkkaaakaaakkakakkaaaaakaaaaakkaaaaaakakaaaaaaakaaakaakaaakkkkaakkkaaaaaakkakkkaaakakaaaakkkaakakakakkkkkkkkkakkkkkkkaaakkkkaakkakkkkkaaaakkakakkkkkakkakkkkakaaakakakakakkkaaakkaaakakkkkakakakkaaakkakakaakaakkkkakkaaaakaaakakkkkkkkkkakakakkaakaakakaaaakkkaakaakakkkaaaaaaakkkkaakakkkkaaakkkkaakakkakakaakakaaaaakkkakkakkaakakakakkkaakaakkakakkkaaaaaaaakkkakkkkakkkaakaakaakkakaaaaaaaakkkaakaaaakakkkkaaakaaakkaaaaaakkakkkkakkkkkkkkkaaakkkaaaakaakaakaaaakakkkaaaakakkkkaaakakkkakaakaakkkakaakaaakakkakaakakaaakaakaakakakkaaaakaakaakaakkkkkakaakkkkkakkakaakaakkakakaakaakakakkakaaaakakaakkakkakaaakaaaaakkkakkkkkaaakakakkkkakaaaakkakaakkkakkakaaaakaakakaaakakaaakkkakkkkakkkkakkkkakaakkakkaakkaaakkakaaaakakakkkkakkkakkkkaaakaakkaaaaaakkkaaakakakkkkakkkkakaakkkkkkkkkaakaakaaakkkaaaakakkkaakaaakakaakaakkaaaaakkkkakkkaaakkkakkkkakkkkaaaakaakakkkkaaakkakaaaakkkakkkkkakakakakkakkakkkkkkkakakaaakakakkaaakkaaakkaaakakkkkkakkkaakakaakaaaaakkkakkakkakakkakkaakkkakakkkkkkkkkakakakkkkkakkaakkkkkkaakakkakkakakkaakkkaakkkkaakaaakkkakaaaakakkkaakkaaakakkkkkkkakakaakaakaakkkkkkaakkakkakkaakakakakakkkkakaaakkkkaaakkkkkkkakakakaaaaakkkkakaakakkakakkaaaaaakkaaakkaakaaakakkkkkakkaakaakaakkkaaakaakkaaakkaakakakkaaakaaakaaaaakkkakakaakkkkakkkkkakakkkaakaakkakaakkakkakakkkkkaakakkaakkkkkkkkaakkakkkakakakaaaaaaaaaakakakaaakkaakkkakkakkkkakkkaakaaakkkaakkakkkkkkkaaakkkakaaaaaakaakkkakkkkaaaakkkkkkakaaaaaaakkkkkkakakakkaakkkaakaakkkakkkkaaaakkkkkakaaakakkakakkkakaaakkkkaakakaakakaaaaakkkaakkakakaakaaakaaakkkkkakkkakkaaakkkkkkkaaaaakaaakkakaakkakkkkkkkkakkkakkaakkkkkakakakkaakakaakkkakkkkkkaakaaaakakkakakkkkkkkaakakaakkkkkkkkkaaaakaakakkkkakkaakakkkaakakaaakaaakaaaaakaakaaakakkakaakkkkkaakkakaaakaakaakkkaaaaaaakkakakkkakakkkkkkkakkaaaaaakkkakkkkaakaaakkkkakaakaakkaakkaaaakkkakkkaaakaaakaaakakkakkakakkkakkkakakaakkakkkkakaaaakakkaakakaaakakkkkkaakkkakaaaaaaakaaaaaaaakkaaakakkkkkkakaakkkkaakakkkkkakakkkakaaaakakaaaakkkkaaaakkkakkkaaakkkkakaaakkakkaaakaaaakakaakaaakaakaakaaaakaaaaakkaaakkkkaaakaakkaaaakakakaaakakkakakakkkakkkakkkkkkkaakkakakkkaaaakkkaaaaakkkkkkkakkkkaaaaakkakakkaaaaakkkaaaakkkkaakakkakkkkkkakkkkakaaakakkkakakaaakaakkakkaakakkkkkakkkakaakkakkkkakaakkakkakakkakakkakkaaaaakkakaakkakkkakkaakkaaaakakkkaakkakkkkakkkkaakkkkakkkaakkaaaaaakaaaakkakaaaakakaakaakkaakakkkaakakkaakaaakkkkaakaakaaakaaaaakkkkkkaaakkakaakkaaaakakakkkkkkakaakkkkakkakaaaakakaaaakakkkakaakkkaaakakakakakkkaakakaakkaaaaaaaaakaakkakkakakakaakkkaakkkakaaaaaaakkkaaaaakkkkakaaakaaakkkkkkkkaakaakkaaakkkakkaaakkaakakakkkakaakkaaaakaakakkkkakaakkkkkaakakaaakkkaakkkaaakkakaaakaaaaakaakaakkkakaaakkkakkaaakkaakkakkkkaaaaakkaakakaaakkaaaaakakkaaaakkkaaakaakakaakkkkkakakkaaaaakakkaaaaaaakkkakkkkaakakkkkakaakkakaakaakakaakkakkaaakaaaaakaakkkkakakakaakakkkkkaaaaaaakkakkakakkaaakkakakkaaakkaaaakkaaaaaakaakakkakkkkaakkaaaaakkkaaaaakkaakkakkkkkaaakakkaaakakkaakkakaaakaakaaaaaaaaakakakaaaaakkkkakkaaaakaakkkkkkakaakakkkkakakaaaaakaakkkaakaakakaakakakaakkaaakkakkkkkkkaakakkaaakakakaakkkkaakkkkakkakkakaakaaakkaakkkaaaakkkkkakakaakkakkaaakaakkkaakaakkaakkakkkaakkkkakaakakakkaaakkakkakakkaaaakaaaaaakkaakkakaakaaaaakaakkaakkakkkakaakkkkkkaaakkkkkkaakakakkakkkakaakakkkkaaaaakakaakakkaakaakaakkkakkkkkakkkkaakakkkakaakaaaaaakkkkakkaakkakaakkkkkkkkakaakkakakkkaaakakkkaakkakkkkkkkkakakakkakakkaaakakkkaakkkakkkaakkaaaakakkkkakaaaaakkkaakaakaaakakkakkakkaakakakakaakkakkkkaaakaakkkakkaakkakakkkkkaakakkakkkkkkkkkaakaaaakkaaaakaaaakaakkaaakkkakkkkaakkkakakkakaakkkkaaakkaakkkaakkaakkkaaakaakkkkaaaakaakaakkakkaakaakkkakkaaaakaakkkaakkkaaaaaaaaaaakkkaakakkkkakaakkkkkaakaakkkkaakakaaakaaaaakkaaakkkkakakakakakkakakkkaakkaakkaakkakakaaakaaakkakakakkkkakakaaaakkkkkakkaaaakkkkkkaaakakakaakaaaaaaaakakaakaaakkakkaakkkkkkakkakaaakkaakkakkkaakaakakakaakkkaakaakkakakaakakkkkkkakakkkkaaakaaakkakakakkakkakkakkkkkkakkakkkakkakaakkaaakkkakakaakkkkkkkkakaakkaakakakakakakakkakaaaakaaakkakkaakkkkakkakaakaakkakkakakaakakaaaakkaakaaaaaakkakkkaakakakkakakakkaakaakkaakakkkkakakkkkaakkkaakkkaakkakkaaakaakaakakkakkakkakaaaaakakkkkkaaaaaakakakkaakkkkkkaakkkaaakakkkakkaaaaaakaakkkaaakakakkakakkkakaakakkkkakkkkakkkkkakkaaakaakakaaaaaakkakaakaakakkakkkakkaaaaakkaaakkkakakkaakakakkaakakakakkkkkkaaakkaaaakkaakkakakakkaaakaakkaaaakakkakkaaaaaaaakakakakaaakakakaakaakakkkakakakakaakaaakkakakkkkkakkkakkkkakkkkkkkaakkkkakkaakaaaakakkkkkkkakkakkakkkkaaaakakaaakkakaaakaaaakakakakaaaaaaaakakkkkkkkkkaakaakkkkaaakaakakakaakakkkaaaaaakkkkaaaaakkaaakaakakkkkakkkakkkkaaaakaaaaaaaakaakkkaakkkkkakkakakakaakaaakakkkakkaaaakkaakkkaakakakaakaakkkakaaakkaakakkkakaaakakakkaaakakkaaakkkkaakkkkakkaaaaakkkaaakakkkkakkakaaaakakkakkkkkkaakaaaakkkakkkaakaaaakkkkaaaaaaaakkkkkkaaaakkakaaakkkaaakakkakkkkaakakaaakkakkkakkaaaaakkkkkaaaaakkkkakaaaaakkakaakkkakakakakaaaakkkkkkakkkkaaakakaakakkaaaakkakkkaaaakaakkaaaaaaaaakakaakakakakkaakaaakakkakakkakaakkaaaaakkakakaaaaaaaakkkakkkakaakakakkaakaaaakakkakkkkkkakaaakakkkkaakkkakkkaakkkaaakaakakkakkkkakkkaakaaaaakkkkakkakkkaakaaakaakaakaaaaakkkakakkakkkaaaakakkakkkaaakkkkkkkkakakkkkakkkkaaakkkakakakkkkkkakkkkkkkakaakkakkaakaakakakaakaaakkkkkaaakkkkkaaaaakkakaaakkkkakkakkakkkkakakkkkkkkkkakakkkaakkkkakaakkkaaaakkkkkakkkkkkaakaakaaakaakaaaaaakaakkkkaakkaakkkakakakkkkkkakakkkaaaakakkaakkkkaakkkaaakaaaaakakaakakkakaakaakakakaaaaaaaakakaakakkkkaaaakkkkkaakaaakaaakaakkaaakkaaakakaaakkaaaakkkaaaakaaakkkaaaaakaaaaaakkakkkakkkakakkakkkkkkkakakkkaaakakkkakkaaakkaakakkaaakkkakakkkkaakaaaaakakaaakkaaakaaakkkkkkkakakaaakakaaaakkaaakaakaaaakkakaaakaakkkaaaakkaaakaakakakkaakakakkakakaaakkakkkakaakaakkkakaaaakakakakkakakkkkkkkaakkakkaaakkakkkkakakakaaaakkkkakkkkaaaaaaaaaakaaakkkaakaakkakkakakkkkkaakkkkkkakakaaaaaakakaaakaaakkakkakakakaakakkkakkkaaakkaaakakakkkkkakkkaaakakakkkkkakkakkkkkaakaaaaakakkakakakakkakakakakakakkkkkkaakaakkakkakkkkkaaaakakkkaakkkkakkaaaaakaakkaaakakaaakkkakkkkaaaaakakakkaakkkkakkaaaakkkkkkkakaaakaaaakkaaaakakkkkakkkakaaaakaaakaakaaakaakakkkkaakkkaakkaakakkakkkakkakkkakkkakkakaakakkkkakkkkkkkkkkaakakaakaaakaakkkakakkkkakakkakakkakkaakakaaakakakkkakkkkkakaaaakakakakkaakakkaaakkakkkakakaaaakakkkkakkkakakkaaaakakkkaakaakakkakkkaaaakkakkkakkaaaakakakakaakkkkkkaaakakaakaaakakaakakakkkakakkkkakkakaakaaakaaakaaakakakakaaakkkaaaaakaakkkkkkkakakkakakakkaakaakakaakkkkaaakakaakkaaakaakaakkkkaaakakakkkaakaaakaaaakaaaaaakaaakaaaakkaaaakaaaaakaaaaakaaakakkkkaakkaaaaaakaakkaaakkakakkaaaakkkaakaaakkaakkakaaaakaakaaaakakkkkkkakkakaaakaakkaakakakkkakaakkkkakaaaaaakkaakkakaakkakkkkaakkaakkakaakkkaakkaaakakkakakkkkaakaaakkkaakakkkaaakaakaaaakakaaakakkkakaaaaakakkkkaakkaaakaakaaaaaaakaakaaakakkaakkakkkakakkkkakkkaaaaaakakkakkaakakaakaaakaakaakakaakkkkkkakkkaakakakakaakakkakkakaaakkkakaakkaaaaakkaaaakkaakakkkaakakakkkkaakakkakkkkkakkaaaaakaakakkkkkakkkakakkaaaakkakkkkakaakakaakkakkaakakakkakakakakaaaaakakkkkkkkkkkaakkkkakkakkaaaaakkkakakkaakaakkaaaaakkakakakkakakaaaakkkkakaaaaakaaaakakaaakakaaaakkakakakakkkaakakkkkkkkkaaaakakaakakakaakkkakaaakkakkaaaaakkakkaaaaakaakaaakkkaaaakkkkkaakkkaaakaakaakakaakkaakkkakakaakkkkaakaaakkkaakkkkakkkaaakkkakakaaaaaaakakaaaakkkaakakkkaakakaaakkaaaakakkakkkakakkkakkaakkkaaaaakkkkaakaakkakaaaakakkkaakakkaakaaaaaaakkakkakkkkaakkkkaakakkkkaaaakkaakkakkkakaaaaaakkakkkkkkkkaakaakkaaakkakkkkakkaaaakkkakakaakkkaakaaakkkakkkkakkkakakaakkaakkkkakkkakaaakkaakkkaakaaaakaakaaaakaakakakkaaaaaakkkakkkkaaaakakkakaakkkkaaaakkkaakkaaakaaakakkaakakkakaakaaaakkkaakaaakakkkaakaaaaaakaaakakaaaakkakaaakaakaaaakaakkaaakakakakkkkkakaaaaakkakkkaakkakkkkakaakkkakakkkkakaaaakakaakaakkkkaakaaaakkkaaaakakakkkakkkkaakkakkakkkaakaaakkkakkakkakakaaaaakkkakkkkkakkaaakakkaakakkkkkaaaakaakkakaaakakkaakaaaaakkkkaakkkkaakaakkakkaakkaakakkkaakaaaaakaakkaaakkakakaaaakkakkkaaaakkkaakaakkaakakakakakakaakkaaaakakakaakaakaakkkaakakkkaaaakaaakakaakkakkakkaaaaaaaaaakkkkkakkaakkaakkakkkkkkkaakaakkaaaaakkkakkkkkkakaakakaaakkaaaakaaakkaakkakkkaaakkkakakkkkkkaakakkkkaakkakkkaaakkkkakkkakakaakkakkkaaaaaaakkakkaaakkaaaaaakkkaakakakaaakaakakkkakkaaaaaakkkkakakkkakakaaakakakkkakaakkaakaakaaaakakkaaakkaaaaaakaakkkkkkkkkkkkkkaaaakkkkkakkaaakaaakakkkaaaakkaaakkkaaakaakkakkaaaakkaaakakakkkaakkakkkkkkakaaaaakkaakkaaakkkkakaaaaakakkaakaakkakkkakkkaakkaakkkaaaakaaaaakkkkakakkakakakkakakaaakaaakaakaaakkaakakaaakakaaakkakakaaakkakkakkkkkkaaaakkaaaakkkkakakkkakkkaakakkkakaaakkkakakaaaaakkkaaaakkkaaakaaaakaaakkaakaakakaaakkaaaaaakkaaaaaaaakakakkakkaaaakkaaakaaaaaakkkakkaaakaakaaaakkkkkkakaaakakkkkkkkakkkkakakaakkkkakkkkkakkkkaaakakkkkkkakakakakakakkakkakakkakkakkakkkaakaaakkkakaakkkkaaakkkakaakakkkkkakaaaaakakakakkkkkkkkkkkakakaaaakakakakakkkkaakakkaakkaaaaaaakakkakkaaakaakaakaaakkaakkaakkkkakaaakaaakakkakaakkakakakkkaakakkkakkkkkaaaakaaakakakkkkaakkaakakkaakkkkkaaaaaakkkkkakaakakaakkaaaaaaaaaaaaaaaakkkkkkkaaaaakakkaakkkkkaakkkkakaakaaaakakkkakakkakakkaaakakakkaaakakkakkkakkaaakakkakaakaaakakkkkakaakakkakaakkakaakaaaakkkakaakkkkkakkaaakaaakkakakkaakkaakakaakaakakakaakkkkaakaaaaaaaaaakakkaaakaaakkkkakkkkkkaaakkakakkkaakkakkaakkaakkkakakaakkaakkkkkkaaakkkakkakaaaaakkkkaakkakakkaaaaaakakakakkakakakkkkaaaaaakkaaakakkkkaaakakakkkkaakkkkkkaakakkkakkaakaakaaakkkkaaakakkkakkkaakakaakkkkkaaakaakkakkkkaakkkkakakkakkkakkaaaaakakkkkkaaaakkaakkkakakkkkkakaakkakkakaakakkkkaakakakakakaaaaaakkaaakkaaakkkkkkkaaakkakakaaaaakakaakaaaaakkkakkakaaakkkaaakaakkkkakakakakkkkkakaaakakaakaakaaakkkakakkkkkakaakkkaaakakakakakakaaakkakakkkaakaakkkkkkkakakaaakaaakkaakakaakkakaakkakkakkkakakkkkkakaakkkaaaakkkkkakaaakakaakakkkkkakaakakkaakkkaaakaaakaaaakaakaakaakkkkkkkkaakakkakkakaaakaakaakkkaaaaakakkakaaaaakaaaaakkkakakakkkkkakkakkkkkakkkakakkkaaaakkakkakkkkkaaaakkaakkkkkkaakkaakaaakaakakakaakaaakakaaakakkaakaaakkkakaakkkkakkkaakkakakaaaaaaakkkkkaaakkkkkkkkaaaakaakkkakkakakakkakakkakaaaaaaaakkkkkakakkakkakkaakkaakkkakaaaaakaakakkakaakkakkakakakakaaaaaakaakkkaakkakakaakakakkkaaaaaaaaaakakakkkakakkkakkaaakkkakkkkaaakkaaakaakaakaakkkkakaaakkkakkakkkkkkakakkkaaaaakaakkaakakkkkakaaaakaakkkkkkkakkkakakakaakakaakkkaaakakkakakkkkaakaakakkkaakakaakkkaakaakaakkkkaakkakkakakkkkkkaakkakakakkakkakakkkkaaakaaakakkaakakkkaakaaakkaaakkkkkakkkaaakaaakkkkakaakkakkkakkkaakkkkakkkaaakaaakaaakkkkaaakkakkkakakakakkkkkkkaaaakakkkkkkkkkkakaakaakkaakaaakkaaaaakaaaaaakaaakakaaaakakakakkkkaakakkaakaakkkakkkkkkakkakakkkkkkkkaakaakakakkakkakakkkaaaakaakakkaaakaakkkakaaaaaaaaakkakakaakakaaaakkakkkkkakkaakkaaaaakakkkaaaakkkakkkakkkakakkkkkkkakkakkkkakkkakkakakaaakakkkkkkkaaakkaaaaakkakaaaakakakkakkaaakkkakkakkakkkkkkakkaaaaaaakakkkakakaaakaaakaakakkakkkakkakkkkkkkakkkkkkaaakkaakkkakkkaakkakkaaaaakkakaakaakkkakkaakkkaaakakkkaaakkkkkaakakakakkkkaakkkakkaaaaaakkaaakkakaaakkkkakkaakkaaaakkakkkaakaakkakkkkkaakaakkaakaaaakkkkkakaakkkakkakkakaakkakaaakkkakaaaaakaaaakaaaakakaaaakakkaaakakkkaaakakakkaaakkakakaakkkaaakkaaaakakkkakkakkaaakaakkaakkakaakkkaaakakaaaaakkaakkaaakaakkkkkakkaaaaakkkaaaakaakaaaakakkkakkakkakaakkaakaaaakkkkkkakkakkkkaaakakaaakkakakkkaaaaakkkaakaaaaakkakaakkkkaaaaaakkkkaakkkaaakkkkkaakaaaaakakakaaaakakakakakkaakakkkaaakkakakkakakkkaakkkkakkakakaaaaakaakkkkkaakkkkakkkkkkakakakaaaaakaaaaakakkkaaaaaaakkaakakkkkakakaaaakkkkkakaaakakkkkkkkakkkaakkakaakaaakaakakkkakakaakaakakkakakkaakaakkaakkkaaaaakkaakkakkkkkkaakkkkaaakaaaaakkaaaaakaakaakaaaaaakakakkaakakakkaakaaaaaaakkkkaakkaaaakkkkaaaaaaaaaaaaakkaakkakakaakakkakakkaaaakaaakaakkaaaakkaaakakakkakkkaakkakkaaaakkaaaakakkakaakkaakkkakkkkakakaakkkaaakaaaakkkaakkakkaaakakkkaakakaakkkkkkaakaakkkakkakkkakaaakaaakkakkaakkakaaakaaaakkaakakkaakkkakaaakakakaaakkkkkkaakaaaakakkkakaakakkkkaaaakkaaaaaakkakkkakkakkakkakaaakkkkkaaakakakaakakkkkakkkkkkkaaakaaakkkakkkkkakaakakkakakaaakakakakkkakkkkkakaakakkkkakakkkaakaakkaaakakkkkkaaaaaaaaakkkkakakaaakkkakkakkaaakakakkaakaaaaaakaaakakkaakkkakkkaakkkakkakkkkakkkkaakakakkakkkakakkkaaakaaakaaaaakakaakkkakaakkkkakakaaaaakkkakkakaakkakkakkaaakkkaakakaakkkakkkaakakaaakkaakaaakkkkkakaakkkakkakaakkakkkakkkaaaaaaakaaaaakkakkakkkakkkkaakkkakkkakkkkakkakaaakaaaaakkaakkkkaakaakkakakkakakkkaakaakakaaakakakaakkkaakkakakkakkkakakaaaakkkakakaaakakkkakkaakkaaakakaaakkaaaakaaakkaakakkkaaaakkakkakkkkaaakakaaaaakakakkkkaaakaakkaaakakkaakaaaakaakkkkkkkakkkaaaakaaakkaaakaakakkkkkakkkkkkakakkakakkkaaakkaaakkkaaaaaakaaakaakakakkkaaaakakakakakakkkkaakakaakkkakkkaakkaaakakaakkakaakkakkkkakkkaakakaaakaaakkakaakkakaaakakkkkakakkkakkkaaaakkkkaaakaakkkaakkkakkkkakkaakkaakkaaaaakakkkakakkakaaaakakkakkkaaakaakaaakakakkaakkaakkkkkakkkakakaaaaaaakakaakakakakakaakaakkakaakakkkkkakkkakkaaaakakaakaakaaaaaakakaakaakakaakkakkkaaaaakakkakaakkkkkkkkaaaakkkkaakkkakaakakkkaaakkakaakkakkkakakaakkaakkakkkaaaakkkakakakaakkaaakaaakaaaaakkkkkkkakakkkakakkkkkaakaaaakakakkkakkkkkkkkkaaakkaakaaaakkakakaakkkakkaakkkaakakaakkakkkkaaaakkkakaakakaaaaaaaakakaaakkkaaaaaakakkakkkkkkkakkakkkkaakkakkakakkaaakkkaakaaakkkaaakaakaaakkaakakkkkakkkakkakaaaakkaaaakaakakakkkakkkakaakkkkaaaaaaaaaaakkaakkaaaaakaaaaaaakakakkakakkkaaakaakaaaaakakakakaaakakaakakakkakakkkkaaakakakkaakakkkkkaakakkkkakkkkkaaaaakakakkkkkaakakkakkkakkkaaakaaakkakaaakaaaakakkkkkaaakkkkaakkkkaaakakkkkkkkaakakaaakkakkkakkaaaaakkaakkakaaaakkaaakaaakkakkakkaaaakakkkaaaaakakkaakkakaaakakkkkaakaaakaaaakaaaakaaakkakkaaaaaakkaakkakaakakaakaaakkkkaaakaakaakkaaaaakaakakaaakaaaakkkkkkkakaakakakkaakaaaakakkakkkkkkakakkkkkaaaakkkkkkkkaakkakaakaakakkakkkakkkkakkaaaaakaakkkaakkkaakkkaaakakaakkaaakaaakkkaakakaaaakakaakakkakkkaakkkkakakkkkaakkkkaaakkkkakaakkkakkkkakaakakaakkakkakkaakakakaakaakkkkkkkkakkkkkaaakakaakaakkkkkakkakaakakaaaakkkakkkkkakkkkkkakkkkkaakakkakkakkkkkakakkkkaakaakaaaakkaaaaaaaaaakkkkkakkaaakaaaakakkakkkakkkaakkakkkkkaakkkkaaakkakakkaaaaakaaaaakkakkkaaakakaaakkaaaaakkkkaaakkkkaaaaakaaaaakaakkaaaaakkkaaakkkaakakakkkaakaakakaaaakkaakakkakaakakaaaakakkakakkkakaakkkkkkkkkkkaakkaakkaaaaakaakkakaakaakaaakkkakakkakaakkaakakakkakkkaaakaaakkakkkaaakkaaaaakaaaakkaaakakkakaaakkkkakaaakkaaaaaakakakaakakaakaaaaaakakkakaakkaakkaaaaaaaakkkkkaaaakakakakkkkaakkkkaaakkaaakkaakkakkkkakkkkkaaaakkkaaaakkaaakaaaakakakakkkaakaakkaaakakkkkkakakkakakakakaaaaaakaakaakaaakaakkkkkkakaakaakkkkakaaaakkaakkkkakakkakkkkaakakakkkakaakaaakkkaakkaaaakkkakkaakaakkkkakakkkakkkakkakakaaakkakkkkkaaakaaakakaaaakkkkakkaaaaakkakkaaakkkaakakkaakkkakaaakakakkaakkkkkkkaaakakkkakaakaaakakkakkaaaakaakkkakkaakaakakakakaakaakkaakkkkkkaakaaakkkakkaakakkkaakakkkaakkaakaakakaakkkakkakkkkkaakaaaakakaaaakakakakaakkkaaakkkakkkkkkakkakaaakkkkkkkakkkkkakaaaaaaaakaakaaaakkaaakkaakkakakakakkkkkakakakaakkkaaaaaakkkkaaakkaakakkkaaakaaaakkaakakaakaaaaaakakkkkkakaaakaakkaaakaaaaakkaakkakakkkkaakakaakaakkaaakkaaaakakaaaaakakakaakkaaakkakkkakkakakkkakkakkaakakkakkkkakkaaaaakkkaakaaaaaakkkaakkakakakaakakakaakakaaaaaakaaakaaakkkkakakaaakkkakakakkkakkkaakaaakakkkaakaakkaaakkakakaaaaakkkaakaaakkaakaakaaakaaakaakakaakkkkkkkkakkkkkakkkaakakakkaakakkkkkakkkkaaakkaakaakaaakkakkaaakkaaakakaakkkaakkkaaaakkakakkakaakakakakaaaakkaaaakaakaaaakakaaakakakkkaaakakakkkkaaaaaakkaakaakakakkakkaaaaaakkakkakkaakkakakakakaaakkakkkaakkaakkkkaakaakaaaaakkaaakkaakkakkkaaaaakaakkakakkakkakaaakkkakaaaakaaakkakaaakkaakkaaaaakakaakkaaakakkakakkkkkkaaaaaaaakakaakaakkkakakaaaakkkakaakakakkakaakkakkakkakakkkaakakaaaaaaaaakkkkakkkkkaakkkkakkakkaaaaakkkkkakkaakkkakaaakaakakaaakkakaakaakakkkaaakakaaakaakakaaakkkaaaakaakakkkaakkkaaakakkkkkkakaakaaaaaakaaaakakakkaakaakkaaaakakakkkaakakaaaaaakkkkaaakkkkkaakkkaakkaakakkakaakkaakkkakaaaaakaaaakkaakakaakkakakkaaakkkkakaaaaaaaakkkakaaaakaaakakakaakakkaakakkaakakkakaakkakakakkaaakaakaaakkkkaaaaakkaaaaakaaakkaakakkkakaakaaakkkakkaakkkaakakkaakkkkkkaaaakkaakkakkkakaaaaaaakakkakkkakaaaaakkaaakkakkkkkkkkaaaakkakakaakkaaakaaakakakkkkakkkkkkakakkaakkakakkkkkaakkakkakkakaaaaakakaaaaakaakakakkaaakkkkkaakkakakkaaakkkakakkakakaakkkakkkaakkkkaaaakakkakaakkaaakakakkkakaaakakakaakaakkaakkaakakaaaakkkkaaaaaaakakaaaaakaakkakaakakkkkakakaaakaakkaaaakkkakkaaakkakakakakkkkaaakakkaakaaakkkkakaaaaaakkaaakakakkkakkkaaakkakkkakkaakaakkkkakaaakakkaaaaaakkkaakkkkakkakkkakkkakaakkkkkakaaaakkakaakakakakakkaaakkkkaakkkaaakkaakakkaaaaakkakkkakkaaaakaaakaaaakakkakaakakkakkaaaaakaaakkaaaaaakakakaaaaakaaakkaaakaaaaakkaakaaakaaakakkkaakaaaaakaaaakkaakakkaakkkakaakakkkkaakaaakkkakakkkkkkkaakaakkakaaakkkakakkaaakaakaaaaaakaaaakkaakkaakkakkkkkkkkaakakkkakkakkkkkakkakakkkkaaakakakkkkkkakakkkkkkakaakaaakakaakaaakkkkakakaaaakakakaaakaakaakkakkakkaaakkkkkkakkkakakaaaaakkaaakkkakakkkaakaakakakakakkkakaaaakakaakakkakkkakkkakaakkkkkaakakaaaakaaaaaakaakkaaaakkaaakakkkakkaakaakakkkaakkkkaakkkkakkaakkakakakaaakaakakaakaakakakkakkkakaaakaaakaakkaakkaakakakaaaaakaakkakkkaaaakkkakkakkkaaakaaaakkkkaakkaaaakaakkaaaaaakakkkaaaaakkkkkkkakkkaaakkakkaakkkkkakkkakkkaakaakkkaakakkkaaakaaaaakakaakaakkaaaakkkakaaaakkkkakkakakaakakaakakkakkaaakkkkkakkakkaaaakkaaakakkaakkkaaakaaakaakakkkaakkkakkaakkakkkaakkakaakaaakakkkakakkkkaakakkkakaakkkkkaakkaakakakakkakkaakkkakaakkkkkkaakakakkaaaaakkkkkaakkaakkkkakaakkkkaaaaakakkkakkkakakkakkaaakaaaakkkakakakkaaaakkkkaaakkkaaaakkakkakkaaakaakaakaakkkkakkaakkkaaakakkaaakkkkakaakkakaakakakkaakkaakkkkaakakkakaaakaaakkaakkaakakaaakakakkaaaaakkkkkakkkkkaaaakakaaaaakaakkkakaakkakkkkaaaakakkakkkakkkakkkkkkakkkaaakkakkkkakkakakkkkkkakakkaaaakkkaakkkkkakkakakaaaakaaakaakkaakakaaaaakkakkakakaaaaakakakaaakkakaakaaakakakkakakkaakkaaaaaakkaakaaakkakakaaakkakaaaakaakakaaaakkaaakkkakakkakaakkkkakkakakakaakkkkkakakaakakaakkkakkkaaaaaakkkakkakaakaaakkkaaakakakkkaaakkkaaaaakkaaakkkkkkkaaaaaakaaakkkkaaaaakaakkkkkkakakkakaakakakakaaakkkkaaakakkakkkaaakakakkaaakaaakkakkaakaakkakaakkkkkaakaaakkaakakkaaaaakkkkkkkaaaakkkakkaakakkkkkakaakkakaakaakakakkakkaakkakkkkaaaaakkakakkkaakkkkkkkaaakkkkkkakaaakakaakaaaaakkkaakakaakkkkkaaaaakaakaakaakaaakakakaaakaaaakkkkaaakkkakakkkkkaaaakkkakakakkaakkkakakakaakakaakakakakakkkkaakkaaakaakkaaakakkakkakaakaakkkakakkakaaakakkaakkakkakkakaakkaakakaakkkaakkakkakakaaakaakaakkaakakaakaaaaakakkkkkkkakkaaakkkkkaaakkaaaaakkkaaaaaakaakkkaaaakkaaakkkakakaaakaakaaakaaakakakkkaakkkkaakkakkakakkkkkaaaaakaakkkkkkaaakaakaaakakakkakkakkaakakkaakakkkakaaaaakkkakkakaaaakaakkkkakakaaaaakkkkkakkkakakkkkkaaakkaaakaakaaakakkakakkakaaaaaaaakakaaakaakakkkakakkkkakkkakaaakakkakakkkakakaakkaakkakaaaakaaakkkakkaakkakkkkkkakkkkaaaaaaaaaaakkkaakaaaakkkakkkaakakakkkkaakkaakkaaakkkkakaaaaaaaaaaakakaakkakkkakkkkaaakaakkakkakkakkaakkaakkkaakakkkkkakkkakkkaaakaakaakkkakkkkakkkakkkkkakaakakakakkkkaakkkaakaakaakkkkaakkaakkkkkkkakaaakkkaakakkakkkaakkkkaakkaakakkkaakakkkaaaaaakkaaakkkkkkkakaaaakakakakkkaakkkakkaakkaakkkkkakaakkkaakaakkkkaaaaakkakkkaaaaakaakkkakaaaaakkkkkkkkakkakkakkaaaaaakakakkkaaaakaakakkkakakkaakkakakakakkkaakaakaaakkakaaakkkkkkkkkkkkkkakkkkkaakaakkkakkakakkkaakaaaakkakaaakakkaakkkkkkaakakakkakakakkkkakkkkaakakkkakakkakkaaaaakkakkaaaaakkkaakkakkaaaakkkkkakakkkakkkaakkakkkaakakakkkkaaakaaaakkaaaakkkaakaakkkkakkakkakakaaakaakkaakakkkkkkaaaaaaaakkkakkakaaakakakaakakkkkakakkakkkakkkakkkakkaaakaaaakaakkkakkkkkkaakkkakakaakakakkkkkkakkkaaakaaakaaaakakkaakakakaakaakaakkakaaakaaaakaakakkaaakkakaakkkakakkaakaakkkaakaakkakkakkaakkaakakkakaakakkaaaaakaakakkkkakkakkakaaaakkkaaaaaaaaaaaakkaakaaakaakaakakakaakkkaakkkkakakakkakakaakkkaaakkkakkkkkkkkakakkaaakaakaakkkakaakkkaakkakaakkakkaakkaaaaakkaaaaakkaaaaakkkaakakaaaaaakkakkkaakaaaakaaaaaakkakaakkakaakkaakkkaaaaakakakkakkkakkaaaakkkaakkaaaaakaakakkakaaaaaakkakakkkaaaakkkkkakkaaaaakakkkakaakkkkkakakkkakaakkaaakkkkakkakakkkaakkakkkkakkkaakaakkaakkkaaakkkkakaakkkkkakkkaaaakkaakaakkakkkkaakaakkakkakkkkakkkaaaakkkaakkakkkakkkakkaakakaakkaaaaaaaakaakkkaaakkkakaakaakakkakkkaaaakkaakkkkakaakkaakkakakkakakkkaaaakkaaaaaakaaakakkakkakaaaakaaaaakkakkkkakaaakaakaaaakkkkaakkkkakkkkkaakakkkaaakaakaakkkaaakkaaakkakakkaakakkaakaakkaaaaaaaaaakkakkkkkkakkkakaaaaakkaakakakkakaakkakkkkakkkkakkkakkkkaakkkaaaaakkakkkkkaaakakakakkaaaakkkkkaaaakakkkkaakkkkakaaakakakkkakaakkaaaaakakaaakaaakkaaaaakaaakaaakakaaakkkkkkkkkaakakaakkaakkakkakkakkkkaaaaaaakkakkkakkkakakkakaaaaakkkaakaakkkkkkakkkkakakkkkkakakkaakkaakakkkaaaakakkakakakkkkaakakkkaakkkkaaakkaakkakkakkkkaakakaakaaakkaakaaaaaaaaakakkkkkkkaaaaaakkakaaaakakakkakkaaaaaakaaakaakaakkkakkkkkkaakaakkkkkakakaaakakakkakkaakakkakaakaaakaaaakkakakkkkakaakkkaaaaaaaaaaakkakkkaaakaakkakkaakkakaakakaaakkkkkkkakakkkakkkakakaakkkkaaaaakkaakakaaakaakkakakakaakaakkkakakaakkakkkakakkaakkkakkkkkkkkakkaakkaaaaakakaakkaakakkkakkkaaaaakaakaakkaakaaaaakakkkaakkkaaaakaakkakkkkkaakaakkakakakaaakakkaakaaakaaaakkkakakkakkkkkaakkkakakkkaaaaakakkakakakkakakaaaaakakkkkkkaaakaaaaakkkakaakakaaaakaakkkkkkkakkaaakakaaakkaaaaakkkakaakaakkkaakakkaakaakaaaaakaakkkaaaaaaaaaaaaaaakakakkkakaakkkaakaakakkaakakkakakkaakkaakakakkkaakkkkaaakakkkkakkaaakkkaaaakkakkkkaakkakaaakkaakkkkkkkkaakkaaakakakaakaaaakkakkkaakaaakkkaakkkakkakaaaaakakaaaakaaakakkakkakkkkaakaakaaakakkaaaakaaakakkkaakkakakaakakaakkkaakakaaaakkaakaakkkaakkakakkkakkkaakaaakaakkaaaaaaakaakkakaaakaakkaakakkaakaaaakakkakaaaakkkkkaaaaaakakaaakkakkakakkaaakkkakakkkkkkkkakkkakkkkkkakkkaaaakaakaakkkaakkaakaaakkaaaakkkakkkkaakkakakaakkkaakkkkaakaaaakkaakkkakkkkaaakkaakaaaakkakakkakkkkkaaakaaaakakakkkaakkakakaakkakaakaaaaaakakkkkaaaaakkkakaaakkkkakakkkkkkakakkakaakakkaakkkkaaaaakakkaaakkaaaakkakaakkkakkaakaaaakkakkakkkkakkkaaakkkkkkaakkaakkakkakkakaaaakaakkaaakakkkkkaaakakaaaakakaakkakakkkakakkakaaaaaaakkaakkakakkaakkaakaakakakkaaakaaaaakakakakkkakkaakaaakakkkaaaakaakakkkkkaakakkakkaaaakkkakkkkkaakaaakaaakkaaakkkkakakkaakkkkkkkakakakkkkaakaaaaakkkakkkkakaaaaakkaakkakkkaaaakaakakkakkkkakkaaaaaakkkakaaakakaaakaaaaakaakkkkaakakkkaakaaakakkakakkkkkkkaaakkkakkkakkakaaaakkkakkkkaaakaaaakkaaaaaaaaakaakaakakaakkakaakakakkkkakakakkakakkakaakaaaaakakkkkkaaakkkkkkkkakakkakkkkaaaakakakaakkkkkkakkaakaaakkkaakkkaakkkkaakakkakkkakaaakkkkaakakaakaakkaaaakkakkkaakkakakakkkkaaaaakaaakkkkkkaaaakaakkkakaakkkakkkkakkkkkkkaaakkakakkakakakkaakakkakakakakkaakkakkkakakaaaakaaakkkaaaakkakkkkakkkkkkakaakakaakkaakakkakaakakaakaaaakaakkaakaaaaaaaakkakkaaaaaaaaaaaakkaakkkkkkaakkakkkkaakkkakkaakkkkkkkkakaakaaaakkakakkaaaakakakkkaakakkkakkaakkaaaaaaakaaakkkaakaaaaakkkkakakkkkakkkakkaaakaakakaakaakkakakkakkakakaaakaakkakaaakakkakkkkaaakkkakaaakakaaaaaakaakkakaakkaaakkkkaakakkakakkkaakakaakakkaaaakaaaaaakakaaakkkakakkkakakakaakkkaakkaakkkkkkaaaakakaaaaaakakakkaakaakaaaaakakaakaakkakkkaaakaakaakkkakkaaaakakakkkkkakkkaaaakaaaaakkkkkakkkkakkkkaaaaakaaaaaaakakkkaaakkkkkkakaakkkakkkaaakakakkkakaakakaaakakkakaakkkakaaaaaakaakkkakaaaaakkaakkaakaakakkkkakakakakakkkakkakkkkkkaaaaakaaaaaaaakkkaakakaakkaakaaaakkakkakkkakkakkakkkaaakaakkkakaaakkkakakaaaaakakkakkakkkakkkaaaakkkaakakkaakaaakakaaaaaakkakaakkkkaakkaakkakaakkaakkkkakkkaaakaakakkkkaakaakakakaaaakakkkkkkkkakkaakaaakkaakkaakkaaaaakkakkaaakkakaakkkaakkkaaaakakakaakaaaakakakkakaaakkkaaakakaakakakkkkkkakkakaaaakkkakkkkkaakkaaaaaaaaakaakkkaaakaakkkkakkakaaakakakakaaakakaakkkaakkaakkkkkakkaaakakkaaaakaaaakaaakakakkaakaaakkkkakkakkaakakkaaaaaaaakakkkaakakaakkkaakakaakaakkaakkkkkaakaakaaaakaakkaakaaaakaakkkkkkakaakaaakakkaakakkkkkaaakkakakakkkakaaaakaaakkaakakkakakaakakkaakkaakkaaakkakaaakkkakkakaaaaakkkakkkaakkakkkaakaaaaakkkkakaaakkkkkkkakaaaakaaakkkkakkkakakaaaakakaaakakkkkkakakkkkkakakkkaakakkakkakaaaakkkaaakaakkkkaakaakaakkaaakkaakaaakkaaaakkaakkaakkkkaaakkkkakakakaaakkkkaaaaakakaaaakakkkkkakakakakaaaakkaaakaaakkkaaaaaakkaakkaakakkkkkkkkaaaaakkkkkakkakkkaaakaaaaaakkkkkkaakakkakkkkaakaakkkaaaakaaakkaaakakakkaakakaaakakakkkaaaaaaaaakkkkkaakaakkkakaaakakakkaaaakkaaaakkakkakkkakaaaakaaaaakaaakkakaakaaakaakaaaaakkkkaaaakkkakkaaaaakkakakkakaakkaakakaaakkaaaakkakakakkaakkkkaaaaakkakakakkkkaakkaakkkakaakkkaakkaakkakkaakaakaakkkaakakaaakakkakkkakkkaakkkakaaakakakkkaaakakkaakaakaakkakkakakaakkaaakkaaaaakkaakakaakkkkaakaakaakaaaaakkkaaakkkakkakaakkaakkkakkakkkakakakkaaakakaakakkaakakakkkakkkkakakkkkakaaakakakkkkakaaaakaaakkkakakkakkaakakkkakaakaaaakaakaaakkkaakaakaakkakkaaaakkkaaaakkaaakkaakaaakakakkaaakaaakkkaakkkakakkakkkkkkkaakakkkaakakkkakaakkaaaaakkaakaakakaakkkakakkakkkakkakkakakkakkkkkkaaaakkkkaaaakkkkakaakkkakkkaaakaaaakkkkkakkkakkaakkkaaakkaakaaaaaaaakakakakkkkkkkkaakkaakkkaakkakakaaaakkkkaakkakkkakkakkaaaakkkaakaakkkakkakaaakakaaaakaakaaaaakkaakkaaaakaakakkkkaaaaaaakkkkaaaakaakkaaaakaakkaakkkaaakakkaaaaakkkakkaakkaakakakakkkkkkakakkakakkakakkakaaakaakkkaakakakkkakkkaaakkakkkaaakaakkkaakaaaaaaaakaaaakakkaaakkkkkaaakkkakkkakaaakkkkkkaakaakakkakakakakakkaakaaaaakakaakakkaakkakaaaaakaakakakaaaaakaaakaakaaakkakaakakaakkaaaakkaaakaakaaaaakkkkaakakaaaaakaakkaaaaakkaakkaaaakkkakkkakkkaakakkaaaakkaakkkkkkkkakkakakkkaaakkaaakkakkkakaakkaakakkakkkaakkaakakaaaakkaaaakaaaaaakakkaaaakaakakkakkkkkaaakaaaakkakakkaakkakakkkkaaaaaaakkakkkakakkkkakakkakkkkkakaakkkaakkkkkkkaaakkkkakakkkaakaaaaaaaakkakkkkaakkkaaakkkkkakaakkaaakkkakakkkaakaakakakakakakakaaaaaakaaaakkakkaaakkkkakakakaaaaakkaakkaaaaakkkaakakaaaaaaakkkkkaaaaakaakakkakakakkakkkkaakkaakkakkkakaakkaakkaaaaaakkkakakkkkkkkaaakaakaakkakakkaaaaakakaaakakakaakkkaaakkkakakkkkaakkaaaakkakaaakaaaakakkkaaaaaakkkkakkkaakakkaakaakkkaakkkkkaakakkkakkkakkaaakaaakkaakakakaaakkaaaakaaakkaakkkkaakkkaaaaaakkkkakaakkkkakkkkkkkakakkaakkkkkkaakaakaaaaakkkakakkkakkkakakakakakakkkkaaakkakaaakkaaaaaakkaaaakaaakakkaakkkkakaakaakkakaakakaaaakkaakaaaakkkakkaakakakaakkkkaakkkakaakakakakkkkkkaakaakkkkkkaakkkkaaakakakkkkakaaaakaakaaakaaakakkakkakakaaaaaakkkkaaakkakkakkakakkkkaakakkkakaakkkkaakakakkaaakakkaaakkkakaaakakkkakakakkaakaakkkkaakkkkkkkaaakkaakaaaaaakakkaakaakakkkkkkakkkakkakkkkaaaakakakakkkaakkkkkaakkaaakkaaaaaakkakkkaaakkkkkkkkakakaakakakakkakkakaaakkkkaaaakakaakkaaakakkakkkakakkaaakaaakaakkakkakaaaaakkkakakkkaaaaaaakakkkaaaaakakkaakakkakaaakkaakkakakaakakkkaaaakkaakaaaakakakaakaaaakaaaaakaaakakaaakkakakkkkkakkaaakaakakkkkkkkakakkaakakkkaakkaaaakakkakkkakaakaaakakkaaakkkkakaaakkkaaaaakkkaaakkkkakkkakaaaaakkkkaaaakkkkakaakakakakkakkakakakaaakakkkakaakakkkkkkkaakakakkkaakkkakkakkaakaakkakaaakkkaaakaaaakaakakkakakakkaaakkkkaakkkakkaakkkkkkaakaakakaaaaakaaaakkakaaakkkkkkkaakakakakkkakakakaaaaaaaaakkkkakkaakkkkaaaaaaaaakaaakkkakkkkakakaaakaakaakakakaakakkkakakaaaakkkkkaakkakaakakkaaaakakaakaakkkaakkkkkakakaakkkaakakakakaaaaaaakkakakaakkaaakakkaakaaakaakkakakakkkkaaakakkaaaaakkkaaaaaaakaaakkkkkkkaaaaaakaaaaaaakaakakkkkaakkkaaaaaaakakakakkkaakaaakkkkkaakkkaaaaakkkaakkaakaaakkaaaakakaakkaakkakaakaaaakaaaaakakaaakaakkkkaakkaakaaaakaakaaaaakaakkakaaaaakkaaakaaakakkkkkakkkkkkkkakkkkkkkkakkaaakaakaaaakaaaakkkkkaaakaaaaaaakaaakkkaaakkkkkaaakkaaaakakaakkkkaakaaakkkkaakakaaakaaakkakakkkakakkakaaaaakaaakakkaaakkkakakakaakakaakkakakaaaakkakakaakakkkkkkaakkaakakakkaakkakkaakaaakkakakkkkakaaaakakakkkaakkaaakkkkakaaaaaaaakaaakaakkkakakkakakaaakakakakaakkaaaaakkaakkkakaakkkaaaaaaakkkaaakaaaaaakaakkkkakkakkkkkkakakkkkaaakkkakkkakkaaakkaakkkkakkakakkkkkaaaaaakaakaakakkaakkaakkkkaakkaakakakakaakakaaaakakkaaakkakakkakakaakakakaakkakakkakkkaakaakkaakakaakkkaakaakkakaakaakkakkakaaakakakkkakaaaakakkkkakkakkakkkkkakaaaakakaaakakkakakkakkkakakkaakkaaakakaaakakkaaaaakakaaaaakkkaakkkkkkkakakkkkkaaaaakkaakkaaakkkaakakakkkakkaakakakakkkkkkaakkkakkakkaakkkaakkkkaakkkakakkkkakkaaaakkkkkkaaaaakakaakaaakakaaakkaaakakkkaakkkaaakkkkaaaakkkkkkaaakaaaakaakkkkakaakaakkkkkkaakkkkakaaakakkaaaaakkkkkaaaaakkaakkaakaakkaaakkaakaaakkkkaaakkaaakakkaakkkakkaaaaakaakakkakakaakakkkkkkakaakkaakakakakkkaakkkaaaaaakkaakakaakaaaakkaaaakaakkkkaaakkkkakaakaakaakkkakakkkkaaakkaakaakkakakkaakakaakkkaakaakakkakkakaaaaaaaakaakakkakakkkkkakaaaakakakaaaaakaakakkaakaaakkkkaakakakkaaakakkkkkakakakakkakaakaakkakkkakkakkkakakkakakakkaaaakkaakaakkkkakaakkkkkakaaakaaakakkkaaaaakaaaaakkaakakaaakaakakaakkkaakaaakkkaaakakkakaakkakakakkaaakaakakakkkakakkkakkaaaakkkkkkkaaakakaakaakakaakaaaakakakkaakaakkakaakkkaaaakaakkkkaaakkkkkkkakkakaakakakakkkkkkkkaakkkakkakkkkaakaakkakkkkaakkaaakkkaakaakkakkakkkkaakkaaakaakkakkkkakkkkkkakkakkkkaakkkaaakkaaakkkkkkkaakaakaakakkaakaaaaakkakaakkkaakkkkkkakkakkakaakkkaaaakkkaakakkkkaaaakaaaaakaakkkkkaaaakkkaaaaakaaakaakkkkkkakkakaaaaaakakkkaakaaakaakaaakakakaakkkkakkkaaaakakkkakakaaaaakakaaaakaakkkakkaaaakakkaakaakkaaakaakaaakkakkkakkakkaaaaaaaakkkakkkakkaaaakaakkkkakakkaakkakakkaakkkaaaaakkaakkkkaaakkaaakkaaaakkkkakakaakakkakaakakaakakaakkakkkaakaakkakaakakakakaaakkaakaakaakkaaaaaaakkakkkkkkkakakakaakkaakkakaaakkkkkkakaakakkaakkkkkkkaaakkakaakaakakaakaaakkkkakkkkkkaaaakkkakaakaakkaakakkaaaaakakkkkakakkakaakakaaaaakakaaakkaakaakakkakkaakakaakaaakaaakkaakkkkakkakakakkkakaaakkakkaaaaaaaakaakaakaaaakaaakaaakakkkkkkakkaaakaakkkakakakaaakakkaaaakaakakaakaakakkkaaakkaakakakkaaakkkkaaaaaaakaaakkkaakakkaaaakkkkakkaaakkkakaaaakkkkkkakakkkkkakkaakaakkkkaaaaakkkakkkkaakaaaakkaaakkakaakkkkkaaakkkaaaaakakkaakaaakakkakkaakakakkaakkkkaaakkkaaaakakakkkakaakkkakakkaakkaaakaakakaaakakkaaakaaakaakkkakakaakaaaaaakakakkkkaakakkkakaakkkakkkkakkkakaakakkkaakkaakaakaakakakakkaaakaaaaakakkkkkakakakaaaakkakkaakakakaakaakaakkakakaakakakakakkaaakakkaakaakaakakakaakkaakaakaaaaakaaaakaakaaaaaaaaaaaaaakakkkakaakkaaakaaaakkkkkkkkakakkaakkaaaakaakaakakkaakaakkkakakkakakkkakkakkkkkkaaaakakkaakkaakkkakkkkkakkaakkakakaakakaaaaakakaakaaakkkaaaakkkaakakkaaaakaaaaakakkkkkakkakkkkkakkaakaaaakkaaaakaaaaakkkkakkakaaaakkkkkakkaaakkkakakkakkaakakaakkkaakkkaakkaakaaakaakkaaakaaakkakkkaaaakkakkaaaakkaakaakakkkaakaaaakkakaakkakakaaaaakkaakakakaaaakkaakakkakkakkakkkakkkkakkkkkkkkakaakaakkkkkkkaakakakkaakakkkakkakaakaakaaaakkkaakkkkaaaaakakkaakkkakaaaaaaaaaaaaaaakaakaakkakkkkaaaaaaaaaakakkaaaaaakakaakaakaakkakaaakakkkkakakakkkkkkkaakkkaaaakkkkkakakaakakkakkaaakkkaakaakkkkakaakaaaakkaaaakkkkkkaakaakakaakaaakkkaakkkkkkkkakkaakkkaakaakaakakakakkakkkaaakakaakkkaaakkaaaakakakakkakkaaakakkkkaaaakaaakaakkakakkakkkakaaakakakkaaakaakaakakkkaakkkkakaaaaaaakakkaaakaakaaaakaaaaakkaakaaaakkkakkkkkaaakkkkaaakkaaakkkkkkaakakkkaaakkkkakakkaaakkakakkkkaaakkkaaakkkakkaakkkkkkaaaakaakkkkaakkkaaaakaaaakkaakaaakakaakaaaaaakakkkkakakakkkaakaaakkkkakaaakkkkkaakkkkakkakkkakaaakakkaakkaaaakaaakkkakkakkaaaaaakkkkkkaaaaakaakkakkakkkaakkkkakaakakkakaaaakkkkkkkkaaakkkkakakakkkkakkkaakaakakaaaakakkkkakkkkkaaakkaaakkkaakkkkakkakkakkkakaaakakkaaaaaakkkakaakaakkkkkkaakkaaakaaakkaaaaakakaaakakkaaaaaaakakakaakkakkkkkakkkkkkkkakakkkakkakaaakkaakakkakkkakakkkkkkaakkakaaaaaakaaakkkaaaaaaakkkkakkkkakakaakakaakkaaaaaakkaakaakkakaakkkakkakkakakaaaakkakkaakaaaakakakakaakkkkkaaakkakakkaakakakkkaakkkkkkkakkakaaaakkakakkakkakakakkkkkkakakakkakaaaakkakakaaakkakakaakkakkaaakakkkkkakkakkaaakaakakkakkakkkkakkakkaakkkakkaakaakaaaakkkaakaaaaaakkakaaakakaaaaakaakkkakaakkaakkkakaaakakaaakkkaakkakakakaaakaaakaaaaaaaaaakakakakkkkkakakkaakkakkkaaakakkkakaaaakaakaakkaaakakakaakaakaakakaakkkkaakaaakakkakaakakakkkkaaakakkakakaakaaaaakaaaaakkkkakaaakakkakaakaakaaakaaaakkkkkaakkkakkakaakkkkkaaaaakakakkaakkaaaaaakkaakkkakkakakkkaaaaaakaakakakaakakaaakaakkakaakkkakakakaaakaaakkaakkkaaaaaaakkaaaaaaaakkkakakaakkkakaaaakkakkakakakkaakaakkakakaaakkakaaakkkkkkaaakaaaakkaakkkkkakkkakkaakkkkkaaakaaaakkkkaakakakkkaaakkkkakkkaakaakakkkaakkkkkkkkkaaakakakkkkaakkakkkkkaakaaakkakkkkaakakkkaakkaakkaaakkaaakakkakakaakkaaaakkkaakkakaaakaaaaaakkaaakakkkkakaaaakkaaakakaaaakakakkkakkkkaaaaakkkakkkkkaakkaakkaakakaaaakkakaakkkkakakkakkaakakakaaaaakakaakaaaakkakkkakkakkakaaaakaaakkaaaaaaaakkkakaaakaaakkkaaakakkaakakkaakaakakkakkkaakaakakakaaaakaaakakkkkkkkkkakkaakaaaakaakkakkakkakaakakkakaaaakakaaakakkakakkakaaakkakakkakkakaakakaaaaakakakaakaakakkkkakkkkakkkkkkakkkaakkkaakakaakaakkakkkkaakkaakaaaakkaaakkkkaaaaaakkkkakakaakakkaakkkkkkkkakkaakakkkkakkaakkkakaaakakkaakakkkaakaakaakakaaakakkaaaakakkkkkaaakkaakkaaakkaaaaakaaaaaakkkkkaaakkkkkaakkkkakakaakaakkkkaaaaakakaaaakakkkkkkaakakkkaaaakakaakaakaakaaaaaakkakkakkkkkkkkkkakkaaaakkkaakakakakaaakaaaaakkkkkkkaakakkaakkkkakakakkakkakaakakaaakaaaakaakakakakkkaakkaakaakaaakkkkkaakakkkkakkakaakkkkaaakkkaakaaaakkakkkaaaaaakaaaaakkaakkakaaaakaaakkaaaaakkaaaaaakkkakaaakkakkaakkaaakakkakkkkaaakkakakkaakakakaakkkkaaaaakaaakakakakkakaaaaakkakaakkkaakakakaakkaakakkaaaakaakkkaakkakaaakkkkkaaakkkakaaakakakakkaakaakaaaaakakkkakkakakakkaaakkkkkaakaakakkkaakkkkkakaakkakakaaakkkaaaakaakaakaakakkkkkakaakaakkaaakakaakaaaakakkakkaakkkaaakkaakakakakaaaakakkkkkkakkaaaaaaaakaaakkkkkkaaaakkkaakakaaaakaaaaaakakaaaakkakkkaaaaaakkakaaakkkakakkkkaaaakkkakkaaakaaakkkaakakakaakakkkakkkaakakakaakakkakkakkkaaaakkkaakaaaakakkkaakaaakkkaakaakkakaakakkkkkkaakakkkkaaaaakkakkaakakakkaakkkaaakkkakakkkkakkaakkkaaakkaakakakaakkkkkaaakkkkkkkkakkaaakkkkakkakakaaaaakkkkaakakaaakkakkaaaakkkaaaakkkkakkakaaakakakkakaaakkaakkkkakkakakakkkkakkkakkakkakkkkakaaakkkakakakaaaaaaakkkkkaakkaaakakkkakkkakkaakkakaaaakakkkkakakkakkaaakkakakakaaakkkaakkkkkkakkaakkkakkakaaakkakkkaakkaaaaakakaaakkkaaakakakakaaakkkkakkakkaakkkkkkaakkakkkkkkakaakkakkakkaaaakkakaakakkkaakaakkaaakakkakakaakaakakaaakkaaakkakaakakakaaaakakkaaakakkaakaakakaaakakaakaakkkkakaaaakkaaakkaaakkaaakkkkkkaakkakakkaakaakakkkkkkakkkkaaaaakaakkaakkakkkaaaaaaaaaakaakkkkkkkakaaaaaaakkkakakkkaaaakkkkaaaakaaaaaaakkkakaaakaaaakkkkakkaakkkaakkkaakaaaaakkakkkakkkakkaaakkkkkkkkakaakkkaakkkkkkaaaakkkaakkkkakaakaaaaaakkkakkkkaakkkaaakakkkkkaakkaaakkkkkakkaakaakkkkaaakakakakkkaaakkaaaakkaaaaaaaakkkkakaaakaaakkaakkakaaakkkaaaakkaaakkkkkkkkaaaaakkaakkkakakaakakkkkaaakaakkkkkkakakkkaakkaaaaaakkkkkakakkkkkaaakaakkaaakkakkaaaakkakaaakakaaaakakaaakkkkkakakaakkkkkaakkakakaaakakkakkkkaakkaakakakkkaakaakaaaaaakkkakakkkaakaakakkkaakaakakaaakkaakaaakaakakakkaaaakkkaaaakkkakkkaakakaakkkkkakkkkkaakkkkkkakakkkkkkkakkkakkakkkaaaakkaaakkkkkkaakaaakkkakakkkkaaakkakakakaaaaaaaaakaaaaaaakkkaaaakkaakaaaaakkkkaakakaaaaakaakaaaakakkkakakakakaaakkkaakkkakaaaakakakaakkkaakakakkakkaaaakaakkkkakkkakaaaaaaaaakakakaakkakkakakkkkaaakkakkakaaakkkkkkkaaaakkakaaaakkkaaaakkakaakakakkakakkkkkaaakaakaakkakakakaaakkakkaakakaaakkkkkkkkaaakaaaakaaakkakkakkaakakkkkkkkkaaakkakkkkakaaaakkkakkkaakkkkkkaakaaaakaaaaaaaaakkkaaakkkkakkakkakkkkakaaakkkkakaaaakkkakaaakakkakkaaakakkakkkakaakakkakakkkakkakkakakaakkkkakkakkakkaaaaakakkaaaaakaakakkakkaakakakkakkakakaakakkkkakakkaakaakakkkakkkkkaaakaaaaakkkakakaaaakakkkkaakakkaaakaakakkkkakkakakkkakakkkaaakaaaakaaaakaaaakakkaakaakkaakkkaakakkkkakakaaaakaaakaaaakkkakkaakkkkkkaaakkkakakaaaakaaaakakkaaaaaaaaakkakkakkkaaakkkkakaaakkakkkakakkakkaakkkkkaaaakaaakkkaaakaaaakaaaakkkkakkakaaaakkkaakakkkkaaakaaaaakakakakaakaakaaaaaaakakakkkakakaakkkaakkkaakkkakaaaaakaaakkakakkakkkkkaaakaakaakakaakaakkaaakakaaaaaaaaakakakaaaaakaakkaaaaaakkakaakaakakaakkaaakkaaaakkakkkaaakakkkkakaaakkaakkkakaaaaaaakakakkakkakkaaaaaakkaakaakaakkakakakakaaaakakkkaaaakkkaaaaaaakakakakkkkkaaaakakkakaakakaakkkkkkaakkkaakkakkkakaaaaakaakkakkakkaaakkkakkaakkkaakkakakaakkkakkkakkkkkaaakakakkaaaakaaaaakakaaakkakkaakakkaakaakakaaaaakkakaakkaaaaaaaakkaakaaakakakakkkkkkkkkkakakakkkaakkaaakaakaaaakaaakkakkkaaakkaakaaaaaaakkkaaakakkkkkkakkaaakaaaakkkkaaaaaakakkkkkkkaaaaaakakakaakkaaakkakkaaakaaaakkkkaaaaakakkkakaakakaaakakkkaaaakkakakkakakkkkkaaakkaakakakkakkkakkkaaaaakaaakaakkkaaaaaaakkkkkakkkaakakkaakaaaaaaaakaaakaakkaaaaakakakaakkakakkaaakaaaaaakkakkkkakaakakaaaaaaakkakakkaaaaaaaaakkkkakkakaaaakaakkakaaakkakakkkakkkakkkkkakkakkkakaakakkaaaaakkaakakkkakkakkaaakkkkkkkaakakaaakakaaaaaaakaakkkkkkaaakaaaakkakkkaaaakakkakkaakkaakkkkaaakaaakkkakkkakkkakaakaakakaaakaaakakakkaakaaaakakkkkakaakkakakkkakaaaaakkaaakakkkkkkkakkkkkkkkaakkkakaaaaaakakkaaaakkakaaaaakakaaakakkkkakakkkkaaaakkkkaaakaaakkkaaaakakkkaakaakkkakkkkakakkakkkakkakkakkkkakkkkkaakkkaaaakkkakkaakkkkakakakkkakaakakakaaakaaakaaaaaaakkaakakaaakkkkaaakkkkkaaaaaaakaaaakkkkkaakakaakkkkkaaakkkkaaaakkakaakaaaaaakaaaakakkkakaaakakakkkakkaakaakkakaaaaakaaakakkaakaaaakakkaakaakakaakakaakaakkkkkaakakkaakaaakaakkaakkkkakaaakkaakaaaakaaaakkaaaakaaakkaakkkkkkakkkkaakakkkkakakkakkaakkakaaakkakaakkakkkaaaakkakkakkkakkkkkaaaaaakkkaakakkaakkkkakakaaaaaakakkaaaakaakakkkkakakkkkakaaakakkaaakkkakakakakaaakkakakkaakkkkkkkkkakkaakaakakakakkaaakkaaakakkkkkkkaaakkkkkaaaakakkkakkkaaaaaaaakkakkaakkkaaakaakkkaakkakakaaakakkaakkkkakkakaaaakakkaaaaakkakakkkaaakkaaakkkaakakkkakkkkkakkakkaaakakkkaaakaakkkaakkaakaaaakkkkkaakkakakkkaakkkkkakaakkkkaaakkkakkakakkaaaaakakaakkkkkakaakkkkkkkaaakaaaakkakaaaakakkaakakkakkakakkaakaakkkakkkkkakkaaaakakakakkakaaaaakkkkkkkaakaakakaakkkaakakaakkkaakkkkaakkkkkkakkakaakaaaakkaakkkkkaaakkkkkaakkaakaaaaakkkakaakkkakaakkaakakkkakkakkkkkkkkkakakakkkkkaaaakaakkkkakkaaaaaakakkakaaaakakakkkkkakkaaakkakkakakkakakakkaakkkaakaaaaaaakkakaakkkakakakkaaaakkaaaakaakaakakkakkkaakkaaakkkkaaaaakakakkaakaakkkakkaaakkakkaakkaakaaakkaaaakakkakakaakkkaakaakakaakkkkakkkkkkaakkaakakkakkkkkakkaakkaakaaakakkaaaaaakkkaaaaaakkakakaakaaakakkakaaaakkkkkakakkakaakkakkakkaaakaaaaakaaaakkakaaakakkakkkkkkaaaakaakkaakakkaaaaaaaakakkaakakaaakkkakaaakkaakaaaaaaaakakakaakakaakkkakaaakkaaakaaakkaakkkkakaaaakakkkkkaaakkakkakkkakaakaakaakkakakakakkaakaaaakkkakkaaakaakkaakakaaaaakkakaakaaaaaaaaakkakkkkaakkkkakkkkakkaakkkaaakaaaakkaaakakaakakkaaaakkkaakkaaakkaakkaaakkkakkaaaakkkkakkakkaakaakkakkaaakaakkkkakkaaakkaaakkkkkkkkkkkaaakkakaaaakakkaaaaakkakkaaaakkakakkkakkkkkaakkkaaaakakakakakaakakaaakkaakkaakkaakakakkkakkkaakakakaaaakakakkkkaaaaakaakkkkaaaaaakkkakakakkakkkkkkkkakakkakkkaakaakkaaaaaakaakakkkaakkaakaaakkakkakakakkaaakkakkaakakakkakaaaaaakakaaaakkkakkkaakakakaakaakaakaaaaaakaakaaakaakakkaakkkaaakakakkaaaaaaaakakkaakkakakakakakakaakakkkkakkkaakaakkaaaakaakakkakkaakaakakakkakakkkkaakkakkkkkkaakaaakkakakaakakakaakkakkaakkakaaaakakaaaakkaaakkaaakkaakaakkkakkakkakaakaakaakakkkkkakaaaaakkkkkkakakaakkaaaaaakkaaakkkakaaakaakkkkkkakkaaakkkakakaakakaaakakkakaaaakaaaakaaaaakaakkkakkakakkkkkkaakakkakkakaakaaakaakkkkkaakkkaaakakaakkakakaakkakakakaaaaaakkkaakkkkaakkaakakakaakkkakkaakkkkakaakaakkkkkkkkakakakakkkakakakkakkakaaakakakakakkakkkaakakaaaaakaaakaaaakaaaaaaakkaaaakaakkakkkkakaaaaaaakaakaakaaaakkkkakakkkaakakkkakkkkakakakakkkkkkkkakaaaaaaaaakkakkaaaakkkakkakakakkakaaakkkkkkaaaakkkkkaakkkakkakaaaakaaakaaaakkkkakkkkkkkkakkaaakkaaaaakaakakakakkakkkakaaakaakkkkaakkaaakkakakakkakkaaakakkkaakkakaaakakkkakakaakkkakaakkkaaaakkaaaakaakkkkkaaakkkakaaaakaakakkkkakaakaaaaaakkakkkkaaakaaakkakkkkaaaakkkkkkkkaaaaaakkkkaakakkkaaakkkakaakaaaakkakakkkaakaaakaakkkkkaaaaakkkkkaaaakakkkkkaakakkaaakakakakakkkkaaaaaakaaaakkkakakkakaakkkkaakaaakkkkakkaakkkkkkkkkakakkakakakaakkakkkakaakakaakakkaakkkkkaakakakkkkkkkkaaakaaakakkakakaakkakkkkakaakaaaaaakakkkakaaaakkaaakaaakkaaakkkakkakaakaaaakaaakkakkkkkaaaakaakaaakkakkkakkakkakkkkkaaakakaakaaakkkkakaakaaakkkaaaaaaaakakaaaakaaaakkkaaakakakaaaaaakaaaaaaakakkaakaakkakkakakakkakkkaaaaakkkaaaaakkkkkaakakkkaaaakaakaakaaaakakaaaaaaaaakakaaakkaaaakakkaaakkkkaaaaakaaaaaakkakkakkkakkakkkkkkakkaaaakkaakkaaakakakaaaaaakakaaakkkkakaakkaaaakkaaakkkakkkkkakakkakaakakkakkakakakkkkkkkkakakkakaaaakkkkaaaaakkakkkakkkakkaakkkaakkkakakkkaakkkkaaakkkkakkkaaakkkkkakkkkkkaakaaakaaakakaakaaaaaaakakaaakkkakaaakaakkkaakkakaakkkaaakakaaaakkakkkkkakakkkaakkkakkkaaaaaaakakakkkakakkkkaakkkakkakkkkaakakkkakkaaakkkkaakkkakkakakaakkakakaakakakkkaakaaakakkakkaaakakkkkakakakaakakaaaaaaakkaakaakkkaakaaaakakakakkkkaaaakaaaakkkkkkkkkkakkkaaakkakkaakaakakaaaaakkaaaaaakakakkkkkkakakkkakkkaakaakakakakkakaaakaaakkkaakkkakakaaaaakaaakkkakakaaaaakaakaaaaakkakkkkkakaakakakakaakakakakakakaaaaaakkakkaakaakaaaaakkkkakaaakkaaaakaakkkkkakkaakkkakakkkaaakaaaakkkkkakakaakkaaaakaakkkkaaaaaaakakkkakkkkaakkkkakaaaakaaakakkkkakkkakkakkkakkakaaaakkaaakkaakkakaakaaakaakaaakaaakaakakkakaaaakaaaaaaaaaakkakakkakkkakkaaakakaaaakakaakakaakaakkakakkkakakaaakaaaaakakkkkakakakaakkakaakkkaakaaakakakkkkakaaaakaaakakaakkkkakaaakkakkakaakaaakkkkaakaaakaakkkkakakakakkaaaaaakkkakakkakkkakakkakakaaakakaaaakaakakkakkkakkkakkkakakakakkkaaakkkkkakkaaaaaaakakaakakakaakkakkakakkaaaakkkakakkaakkkakkakkaaaakkkakakaaakkakkkakkkkakkkkkkakkkakkkkaakkkkakkkkkakkkkkakkkakaaaakkaakkkkkkakkaakkkaakakaakkkkaaakkakkkaakkaakakkkkakkakkkkakaaaaaakaakakkkakkaakkakakaaakakkaaaakakkkkkkaakkaakakkaakaaaakkaakkaakakkaaakkaakkkakaakakaaaakkakkkaaakkakaaakkkakkakkkkakakkkakaaakakkkkkakaaaakkaakkkakkakkkkkkkakkakkkakaakkaakaaakakaaaakaaakkkkkkakaakaakkakakkakkkakkakkakakkaaaaaakaaakkakakakakkakaakaakakkkaaakakkaakkkkkaakkkkaakkakaaakkakakaaaakkakaakaaaaakaakkkkkakkakaaaaakaaakakaakkkkaakaaaakakkakakkaakaakkakakaakakakakakkkkkakaaaaaaaaaakkaaaakaakaakkkkkaaakakaakkakkaakkkkkaakakakaakakakkkkaaaakakkkkkakkkkakakkkakakkkkaakakakakaaakkakaaaaaaaakkkkakakkakakakkaaakakkkaakaakkkkkaakaakkkkkakkakkkaaakkkkaaaaakkaaakkkakkakkakakkaakkaaakakakkaaaakkakkkaaakkaaaakaaakkkaaakakakkkkkkkakakkkkaaakkakaaakkakakkkaakkkkakaakaaakakaaakaakkaaakkkkkaaaakkakkaakakkkkakaaakkakaakkakkkkkkkaakaakaaaakkaaaakkakaaaakkkkaakkaakaaakakkkkkkaakaaaaaaaakkakkaakkkaakaaaakaakkkkaaakakakkaaakkakkkaaakaaaakaaakakakkaakkaaaakaaakakkkaakkaaakkakkkkakkakkkkakkakakaakkkkkkaaakaaaakkkkakaakakkaaaakkkkaaakkaakkkakkkakaakkakaakakkakkkkaaakkakkkakaaakkakkkkkkakkkakakkkkaakakkkakkakkkkakkaakkkakakakaaaaakakkkkkaakaaakkaakaaaakakkaaakakaaaakakkkkakakkakkaaaakkakkkkaaakkkkakakaaakaaaakkaakaakaaakkakkkaaakaakaakakakkkkkaaakaaaaakaakkkakaakkakaaaaakkkkakkaakakkkakaakkakkkkkaaaakkaaaakkakkaakaakkaakkakaaakkakkkkkakkaakkkaakakakkkkaakaaakkkkaaakkakkaakkakakakakakakkaakkkkakakakkakkakkaaakkakaaakkkkakkkakakkaakaakaakkkkkkkkkkaaaaakaakkaakkaakaaaaaaakkakkaakkkkkaaakaaaaaakakkakakkkaakkkkakkkaakkaakaaakkkaaakakaaaaaakkakaaaakkaakaaakkkaaaakaaakakakkaakaaakkkkkkkaakaakkkaakkkkkkaaakkakakakkkakkakaaakaakkkkkkaaaakakaaakakakkkakakaaakakkaakkakkakkkkakaakkkaakkkkkkakkaaaaaaaaaaaaaakkkkaaaaakaakkkakkkakaaakkkkaakkkaaakkkakkaakaakkkkaakkkakakaaakkaakaaaaaakakkkkkaakkaakkkaaaakakkkkkakaakkakkaakaaakaaakkaakkaaakkkkakkkkkaaaakakaakakakaakakakkkakkkakkakkkaakkakakkkakakkkaakakakkkaakaakaaaaaakkkkaakkkkaaaakakaaakaaakkakaaakakkkaaakakakkkkkaaakkkkaaakkkakkkkakkkaakkakkakakkkaakkkkkkaakkkkkkkkakakaakaakkkkaakkkakkkkkkaaakaakkkakkakkkkaaaaaakakkkakaaaaaaakaaaakakakkaaaakaaaaakaaaakkkakaaaaaakakakakakakaakaakakaakaakaakaaakkakkkaaakakkaaaakkkaaakakkakaaaaakakkkkkakakakaaaaaaaaaaakakakkkkakakakakaaaakkakaakkaakkkkkkkakaakaakkkakkakkakkkaakkaakkaaaakakkkakkkakaakakkaakakakaaakkakaaakaaaaakkkkakkkakakaaaakkaakkakaakkaaaaakkkkkkaaaaakakkakakkaakkkkkkkkkkkkkkkkaaaaaaakkkkkakaakkaaaaakkaaaakakkakkkkakaaakakaakakaakkkakakaakkkakaakaaakaakkkakaakakkakkkakaaaakakkakaakakkaakakkakkkkaaakakkaaaaakaakkkakkkaakakaakkaakkakakkakkakakakkaaaakkakkkkkkkkkkakaakkkakkkaaaakaaaaaakkkaakakaaakkaakaakkaakkaaakakakkaakkaaaaaakkkaaakaakakkkkkaaaakkaakakaakkkkkkakakakaakakakaaaakkkkkkaakkkakaaaakkkakakaaaakkaaaaaakkakaaakaakkakkakkkaaaakkkakaaakaaakkakakkaaaaakkkakkaakaaaakkaaaakakaakaaakaakkkkkakaaaaakkkkaakkaaakakaaaaakakkaakaakakkakaaaakkakakakakakkkkkkaakkkaakkkaaaaaaakkkaakakakkkkkakakkakkkkkaaakaakakkkaaakkkakkaaaakakakakaaaaakakkkakakkakkakkkaaakakaaaaakakkaaakkkakakakakakakkkaakakaaakkakkaaaaaaakakakkkakkkaakkakakkaakakkaakaakaaakakaaaaakakkaaakkkkaaaaakakkkakakkakaaaaakakkakaakkaaakkkakkkakkkkakkakkakkaaaaaaaakkakaakaakakkkakkakkaaakkkkkakaakakkkkkakkkkkaaakakakaaaaakaakaaaaakaaakakaaakkkkaakaakaaaaakkkkaakkaaaaaakkaakkakkkakkakakakkakkkakakkkakaakkakkkaaakakkaaaakaaakkaakakakkkkkkkaaaaakkkaaaaaaaakkkkakkaaakaakakakaakakaakakkkkkkkkaaaaakakaakaakaakkaakkaaakakkkkkakkakaakakkaakaakakakakakkkkkkakkaaakkaakakakkakakaaakkkkkkkkkkakakaaakakaaakaakkkaaakaaaakkkaakkkakkakkakkaaaakakkkaaakaakaaaaaakakaaakkkkkakkaakkakaaaakakkkkakkaaaaaaakaaakakakakkakakkaaakkkakaakakaaaakkakkakaaakkakakkaaakkakkakkaaaakkaakaakakaaaaaakkaakakakaakaakakaaaakkkakkkakaakkakaaakkakkkaakkkaaaaakaaakkkakkkaaaakakkaakaaakaaakkaaaakaaakkkakkkakkkaaaakkkaakaaakakakakaaaaaaakkkkakaaaaaaaaaakakkakkaakkakkkaakkkkkakkkkkkakkkakakkkkakakakaaaakkakaakkakkaaakaaaaaakaakakaaaaaaaakkakkakakaakaakakaaakkkkakkakaakkkakkaaakakkkkkkkkkaakakakkakakkkkaakaaaaakaakkaakkkkkakaaakkkkaaakaaakaaakakaaaaaaakaakaaaakaaakaakakakkkakaaaaaaakkkaakkkkkaakakkkkakakaakaakkkaaakaakaakaaaaaakaakkkkkkkakaaakakakkkakkkakkakaakaaakaakaaaaaaakaaaaaakkkaakkaaakaaakkaakaakkkkkaakakkakkaaakaakkaaakkkakaaakkkaaaaakkakakakaaaakkaaakaakkkkkkaakkkaakakkkaaaakaakkaakkkkaakaaakkakkaakaaaaakkakkaakkakkkkaaaaakakkaaakaakaakakkaakakkkaaakakkkkkakkkkakkkkakakkkkakaakkkakaaakkkakakaakkkaakakakkaaakkkaakkkkakaaakaakaakkkakkaakkaakakkaaakkkakakkkkkaakkaakkkakkaaaaakaakkkkkaaakkkkakkakkkkakaaakaakaakakkaakkakkkkaaaaaakaakaaaakkkakakkkaakakaaakkkkkaaakkakkkkkaakakkaaaakkkkkkaaaakkaaakkkaaaaakkakkkkkakakakkkkakakakakaakkakaaakkkaakakaakakaaakkaaaakaakakakkkkkakkaaaaakkaaaakaaaaaakakakakkkkkakkkkkakaaakkkkkkkaakkakaaaakakakkkkaaaaakakkkakaaaaaaakaaakkaakakkakkkakkakaaakakakkakkakaakakaakkakkaakkaaakkkkkaakkaakaaaaaakkaaaakkkakkkkkaakkkkkakkakkakkkkkkakakaakkakakaakkakkkkkkkaaaakkaakkkkaaaakkkkkkkkkkkkkaakkaakakakkakaakakaakkkkakkkakkaakkkkaakkkakakaakaaakkaakaakkkkaakkkkakaakakkaakkaaakaaaakakakkaaakkkakkkkaaakkaakaakkkakaaakkakakkaaaaaakkakkaaakaakaaakakkkakkkaakaakkaakakkkakkkkaakkakaakkaaakakkkakakakkkaaaaaakkakkkkakaaakakkakaaaakkkkaakkkkkkaakaaakaakaakaakakkkaaaaakkkakakakkakaaaakaaaaaaakkkakkkaaakaaaaakakkakaakakakkkakakakaaakaaaaakakkakaaaakakaaakkakkaakkkakaaaaakkkkkkkkkaaaakakakkkaaakaakaakkkakakaakkakkkkkkakkkakaakkaaakaaakkaaakaakaaaakaaaakkakakaakaaakakaaakkkakkkakkkkkakakkaaakakkaaaakakakkkkkaaakaakakkaakaakaakkkaaakkakakkaaakaaakkakakkkaakkakkkaaaaakakkaaakaakakkaakaaakaaakkkkkkkakkkkkaakaakaaakaaaakkaaakaaakaaaakaakakkkakkkkkaakkaaaakkakkaakakaakakaaakkakkakakkkakakakkaaakkaakakaakaaakakakkkkaaakakakkkakaaakaakkaakkkakakkkaakkkkakkkaakkakaaakkkkaakaakaaaakkkakakkkkkakakaaaakkkakkaakkkakaakkakkkkakkaaaaaaakaaakkkkakkkaakkkakkakaaaaakaaaaaakakaakakaaakkkaakkkaaakkkkkkakkkakkakakaaakkkkakakakakakaaaakkakakkaaakaaakkaakkkakakkaakakkaakaaaakaaakkakakkkakkkaakakkaakakkkakaaaakakaaakaaakkkkaaaakkkakkaaakkaaakaaaakaakkaakkaakkkkkakaaakakaakakkkkakaakaaakkkakkakkkakakaakkaakkaaaaakaaakakakkkkkkkakakkakakakakakkakkaakakkakaaaaakaaakaakkkkakakkakkakkkkkkakakkakkakakkaakaaakkkkkakaakakkaaaaaaaakkkkaaaakkaaakakkakaaakkkaakakkaakaaakakakkaakkaakaaakkkkaaakakakakkaakkkakkkakkkkkaaaaaaakakaaakakaaaaakkakkkkakakaaakaaaaaaaaakkkaakkakkkkaakakakkaaakaakkaaakkakakkaakaaaakkkkaaakakkakakkkkkkkkakakkkaaakkkkkkakaakaaaaaaakaakaaaakkaakaakakaakkkaaakkakkkaaakkkakkakkkaakkakaaaakaaakaakakkkkaakkkkakkakakaaakaaakakkaaaakkkkkkkkkkkaakkaakkkkkakkkkkkkakakaakakaaakkkakkakkkkkakakakakkkakakkakakaakakaaaakkkakakaakkakaaaaakkakaaaakaaaaakkkkkakakaaaaakkakaakaaakaaakkkakkkaakakkkakkkkakaaaaakkkaaaakkaaaakkkakaaaaaaakkakakkkaakaaakaakkkkkaakkaakakkkkaakkkakkkaakaakaakkkkakaaakkkkkakaakkaakakkkakaaaakkakkkakkkkakkkkakkkaakaakkkkkkaakkaakakkakakkakkkaaaakkkakkakkaakkkkkakkakakkkakkkkaaaaaaakakkakakaakkakkkkakaakaaaaaakakaaaaakkkkaaaaaaaakkaakakkakkakaakaaakaaaakaakkkkkakkaaakkaaakkaaakkkakakkaakkkakkkaaakkakakkkkakakkakaakaaakkaaaakakaaaakkaaaakkkaaaakakkaaakaaaakakkakakkaakaakaakkakakakkakkaaaaaaaakaaaaakkkakakkakkaaa\nddeddeeeeddeedeededeeeeeeddeedededeedeededeeeedddedddedeeddedeeeddedddeedddeeeeedeeedddedddeeeededdeedeeedeeeddeeeedeeedddedddedddeeeedddeedeeededededeeeeeeeddddedeeeeeeeeeededdeddeeddedddeedddddeddddddedddededdddedededeeeeddedeeddeddeeedeeeeeedeededeeeeeeeeddeddededeedeededeeeddddeddedeedddeddeeededddddddddeedededdededdddeedeeeeedeeddeedddddedeeeddddeeedeeedeeededeeeeeeedeedeeeedeeedeedededddedeeeeeeedddeedddddeededdddededeedeedddeeedeedeedeeeeeedeedddddddedeeedededddedddeddedeedeeedeedeeeeeeedeeeeeedddeeddeeedeeeddeedeedddddeededdeddeeedeeddeeedddedeeedddeeeeeddedededeeeeddeeedeeddddddeedddeededddeeeedeeddeeddddeedeeeddeddeedeeeeeddeddeeddeddddeeeeededdeeedeedeededdeededddeeededddddeddddeddddededdddedeedddedeeedddededeedddeedededdeeedddeeddddedeeedeedeedddeddeeddeededdeeedddededddddeeddeedddeddeeeeedeedddddeeeddddeddeddddedeeedeedeededdeeddeddddeeeeeedeedeeeedddededddeededeeedddddeeeddedddddeededdeeeeddddddeeeeddeeedddeeeeeddedddddedededdddededededeeddedeeedddeededeededeeeddeeeedeedededddddeddeeeeeddeeeedeeeeeededededddddedddddedeeedddddddeeddedeeeedededdddeeeeededddedeeeeeeedeeeddeededdedddeddedeeedededdeddedeededeeddeddeeddeeedddddeeddeedeeeeeeddeeeedddedddddeedddddeddeddeddddddededeeddededeeddedddddddeeeeddeeddddeeeedddddddddddddeeddeedededdedeededeeddddedddeddeeddddeedddededeedeeeddeedeeddddeeddddedeededdeeddeeedeeeedededdeeedddeddddeeeddeedeedddedeeeddededdeeeeeeddeddeeedeedeeededddedddeedeeddeededddeddddeeddedeeddeeededddedededddeeeeeeddeddddedeeededdedeeeeddddeeddddddeedeeedeedeedeededddeeeeedddedededdedeeeedeeeeeeedddedddeeedeeeeededdedeedededddedededeeedeeeeededdedeeeededeeeddeddeedddedeeeeedddddddddeeeedededddeeedeedeedddededeeddeddddddedddedeeddeeedeeeddeeedeedeeeedeeeeddededeedeeededeeedddedddedddddededdeeededdeeeedededddddeeedeededdeedeedeedddeeeddededdeeedeeeddededddeeddedddeeeeededdeeedeededdeedeeedeeedddddddedddddeedeedeeedeeeeddeeedeeedeeeedeededddedddddeeddeeeeddeddeededeededeeeddeddededddedededdeeeddeededeedeeedededdddeeedededddedeeedeeddeedddededddeeddddedddeeddedeeeddddeedeedeeeedddededddddededeeeedddeddeedddedeeddeddddeddeeeeeeedeeeddddedddeedddeddedeeeeedeeeeeededeededeeedddeedddeeeddddddedddeddededeeeddddedededededeeeeddededdeeedeeeddeedddededdeededdeedeeeedeeeddededddedddeededdeededddedeeeededeeedeeeddddeeeedddeddeeeddeeedeeeedeeddeeddeedddddedeeededeededdddedeedeeedddeddedddededeeddeeddeeeeedeeedededddddddededdedededededdeddeededdedeeeeedeeedeeddddededdeddeddddddededdeddededdeedeeedddddedeededdeeeeeeeeddddeeeeddeeededdedeeedddeededdeedeeedededdeeddeedeeeddddeeededededdeedddedddedddddeeeeeeededeeededeeeeeddeddddededeeedeeeeeeeeedddeeddeddddeedededdeeedeeddeeeddededdeedeeeeddddeeededdededdddddddededddeeeddddddedeedeeeeeeedeedeeeeddeedeededeedddeeeddedddeeedddeddedddeeddedeeeedeeedeededdddeeddddeddededeeedeeededdeeeedddddddddddeeddeedddddedddddddededeededeeedddeddedddddededededddededdededeededeeeedddededeeddedeeeeeddedeeeedeeeeedddddededeeeeeddedeedeeedeeedddedddeededddeddddedeeeeedddeeeeddeeeedddedeeeeeeeddededddeedeeedeedddddeeddeededdddeedddedddeedeedeeddddedeeedddddedeeddeededddedeeeeddedddeddddeddddedddeedeeddddddeeddeededdededdedddeeeedddeddeddeedddddeddededddeddddeeeeeeededdededeeddeddddedeedeeeeeededeeeeeddddeeeeeeeeddeededdeddedeedeeedeeeedeedddddeddeeeddeeeddeeedddededdeedddedddeeeddededdddededdedeedeeeddeeeededeeeeddeeeedddeeeededdeeedeeeededdededdeedeedeeddedededdeddeeeeeeeedeeeeedddededdeddeeeeedeededdededdddeeedeeeeedeeeeeedeeeeeddedeedeedeeeeededeeeeddeddeddddeeddddddddddeeeeedeedddeddddedeedeeedeeeddeedeeeeeddeeeedddeededeedddddedddddeedeeedddededddeedddddeeeedddeeeedddddedddddeddeedddddeeedddeeeddededeeeddeddededdddeeddedeededdededdddedeededeeededdeeeeeeeeeeeddeeddeedddddeddeededdeddedddeeededeededdeeddededeedeeedddedddeedeeedddeedddddeddddeedddedeededddeeeededddeeddddddedededdededdeddddddedeededdeeddeeddddddddeeeeeddddedededeeeeddeeeedddeedddeeddeedeeeedeeeeeddddeeeddddeedddeddddedededeeeddeddeedddedeeeeededeedededededdddddeddeddedddeddeeeeeededdeddeeeededdddeeddeeeededeedeeeeddededeeededdedddeeeddeeddddeeedeeddeddeeeededeeedeeedeedededddeedeeeeedddedddededdddeeeedeedddddeedeedddeeeddedeeddeeededddededeeddeeeeeeedddedeeededdedddedeedeeddddeddeeedeeddeddededededdeddeeddeeeeeeddedddeeedeeddedeeeddedeeeddeeddeddededdeeedeedeeeeeddeddddededdddededededdeeedddeeedeeeeeedeededddeeeeeeedeeeeededdddddddeddeddddeedddeeddeededededeeeeededededdeeeddddddeeeedddeeddedeeedddeddddeeddededdeddddddedeeeeededddeddeedddedddddeeddeededeeeeddededdeddeedddeeddddededddddedededdeedddeedeeedeededeeedeedeeddedeedeeeedeedddddeeeddeddddddeeeddeededededdedededdededdddddedddedddeeeedededddeeedededeeedeeeddedddedeeeddeddeedddeedededddddeeeddedddeeddeddedddedddeddededdeeeeeeeedeeeeedeeeddededeeddedeeeeedeeeedddeeddeddedddeedeedddeedddededdeeeddeeeddddeededeededdededededdddeeddddeddeddddededddededeeedddededeeeeddddddeeddeddededeedeeddddddeedeedeeddeedededededddeedeeeddeeddeeeeddeddedddddeedddeeddeedeeedddddeddeededeedeededddeeededdddedddeededddeeddeedddddededdeedddedeededeeeeeeddddddddededdeddeeedededdddeeededdededeededdeedeedeededeeeddededddddddddeeeedeeeeeddeeeedeedeedddddeeeeedeeddeeededddeddededddeededdeddedeeedddededddeddededddeeeddddeddedeeeddeeedddedeeeeeededdeddddddeddddededeeddeddeeddddededeeeddededdddddeeeedddeeeeeddeeeddeeddedeededdeeddeeededddddeddddeeddededdeededeedddeeeededdddddddeeededdddedddedededdedeeddedeeddedeededdeedededeedddeddedddeeeedddddeedddddedddeeddedeeededdedddeeedeeddeeeddedeeddeeeeeeddddeeddeedeeededddddddedeedeeededddddeedddeedeeeeeeeeddddeedededdeedddedddededeeeedeeeeeededeeddeededeeeeeddeedeedeededddddededddddeddededeedddeeeeeddeededeedddeeededeedededdeeedeeeddeeeeddddedeededdeedddededeeededddedededdeddeeddeeddededdddeeeedddddddededddddeddeededdedeeeedededddeddeeddddeeedeedddeededededeeeedddedeeddedddeeeededdddddeedddededeeedeeedddeedeeedeeddeddeeeededddedeeddddddeeeddeeeedeedeeedeeededdeeeeededdddeededdededededeedddeeeeddeeedddeeddedeedddddeedeeedeeddddedddeddddedeededdedeedeedddddedddeeddddddedededddddedddeedddedddddeeddedddedddedeeeddedddddeddddeeddedeeddeeededdedeeeeddedddeeededeeeeeeeddeddeededddeeededeedddeddeddddddeddddeeddeeddeedeeeeeeeeddedeeedeedeeeeedeededeeeedddededeeeeeededeeeeeededdedddededdedddeeeedededdddedededddeddeddeedeedeedddeeeeeedeeedededddddeedddeeededeeeddeddededededeeededdddededdedeedeeedeeededdeeeeeddededdddeddddddeddeeddddeedddedeeedeeddeddedeeeddeeeeddeeeedeeddeededededddeddededdeddededeedeeededddedddeddeeddeeddedededddddeddeedeeeddddeeedeedeeedddeddddeeeeddeeddddeddeeddddddedeeedddddeeeeeeedeeedddeedeeddeeeeedeeedeeeddeddeeeddedeeedddedddddededdeddeeddddeeededdddeeeedeedededdededdedeedeedddeeeeedeedeeddddeedddedeeddeeedddedddeddedeeeddeeedeeddeedeeeddeededdedddedeeededeeeeddedeeededdeeeeeddeeddedededeedeeddeeededdeeeeeeddededeedddddeeeeeddeeddeeeededdeeeedddddedeeedeeededeedeedddeddddeeedededeeddddeeeedddeeeddddeedeedeedddeddeddeddeeeedeeddeeedddedeedddeeeededdeededdededeeddeeddeeeeddedeededddedddeeddeeddededddededeedddddeeeeedeeeeeddddededddddeddeeededdeedeeeeddddedeedeeedeeedeeeeeedeeedddeedeeeedeededeeeeeededeeddddeeeddeeeeedeedededdddedddeddeeddededddddeedeedededddddedededddeededdedddededeededeeddeeddddddeeddedddeedededddeededdddeddededdddeedddeeededeededdeeeedeededededdeeeeedededdededdeeedeeeddddddeeedeededdedddeeedddededeeedddeeedddddeedddeeeeeeeddddddedddeeeedddddeddeeeeeededeededdededededddeeeedddedeedeeedddededeedddedddeedeeddeddeededdeeeeeddedddeeddedeedddddeeeeeeeddddeeedeeddedeeeeededdeededdeddededeedeeddeedeeeedddddeededeeeddeeeeeeedddeeeeeededddededdedddddeeeddededdeeeeedddddeddeddeddedddedededddeddddeeeedddeeededeeeeeddddeeedededeeddeeededededdededdededededeeeeddeedddeddeedddedeedeededdeddeeededeededddedeeddeedeedeededdeeddededdeeeddeedeedededddeddeddeeddededdedddddedeeeeeeedeedddeeeeedddeedddddeeeddddddeddeeeddddeedddeeedededddeddedddedddededeeeddeeeeddeedeededeeeeedddddeddeeeeeedddeddedddededeedeedeeddedeeddedeeededddddeeedeededdddeddeeeedededddddeeeeedeeededeeeeedddeedddeddedddedeededeededdddddddededddeddedeeededeeeedeeededddedeededeeedededdeeddeededdddedddeeedeeddeedeeeeeedeeeedddddddddddeeeddeddddeeedeeeddededeeeeddeeddeedddeeeededddddddddddededdeedeeedeeeedddeddeedeedeedeeddeeddeeeddedeeeeedeeedeeedddeddeddeeedeeeedeeedeeeeededdedededeeeeddeeeddeddeddeeeeddeeddeeeeeeededddeeeddedeedeeeddeeeeddeeddedeeeddedeeeddddddeedddeeeeeeededdddedededeeeddeeedeeddeeddeeeeededdeeeddeddeeeedddddeedeeedddddeddeeededddddeeeeeeeedeedeedeeddddddededeeeddddeddedeeededeeddeededededeeeddeddedddeededddeeeeeeeeeeeeeedeeeeeddeddeeedeededeeeddeddddeededddedeeddeeeeeeddededeedededeeeedeeeeddedeeededeedeedddddeedeedddddeeeddeedeeddddeeeeededeeedeeeddeedeeeddededeeeedddeddddeeddddeeeddeddeeeedeedeedededddeddeeddedeeeeeeddddddddeeedeededddedededdedeeeededeedeeedeeedeeedeedddeddddeddeeedeeeeeeddeeedededdededeeeeeedeeedddedddeddddedeeddedededdeddeddeededddeddddeddedeedddeededdeeededeeddeddeeeddeddeedeedeeddeeddedeededdedeedddddeddedeeeedeedeededdddeeeddddddddddddeeddedddeddeddedededdeeeddeeeedededeedededdeeedddeeedeeeeeeeededeedddeddeddeeededdeeeddeededdeedeeddeedddddeedddddeedddddeeeddededdddddeedeeeddeddddeddddddeededdeededdeeddeeedddddededeedeeedeeddddeeeddeedddddeddedeededdddddeededeeeddddeeeeedeedddddedeeededdeeeeededeeededdeedddeeeedeededeeeddeedeeeedeeeddeddeeddeeedddeeeededdeeeeedeeeddddeeddeddeedeeeeddeddeedeedeeeedeeeddddeeeddeedeeedeeedeeddededdeeddddddddeddeeedddeeededdeddedeedeeeddddeeddeeeededdeeddeededeededeeeddddeeddddddedddedeedeededdddedddddeedeeeededddeddeddddeeeeddeeeedeeeeeddedeeedddeddeddeeedddeedddeededeeddedeeddeddeeddddddddddeedeeeeeedeeededddddeeddededeededdeedeeeedeeeedeeedeeeeddeeedddddeedeeeeedddedededeeddddeeeeeddddedeeeeddeeeededddededeeededdeedddddededddedddeedddddedddedddededddeeeeeeeeeddededdeeddeedeedeedeeeedddddddeedeeedeeededeededddddeeeddeddeeeeeedeeeededeeeeededeeddeeddedeeeddddedeedededeeeeddedeeeddeeeedddeeddeedeedeeeeddededdedddeeddedddddddddedeeeeeeeddddddeededdddededeedeeddddddedddeddeddeeedeeeeeeddeddeeeeedededddededeedeeddedeededdedddeddddeededeeeededdeeedddddddddddeedeeedddeddeedeeddeededdededddeeeeeeededeeedeeedededdeeeedddddeeddededddeddeededededdeddeeedededdeedeeededeeddeeedeeeeeeeedeeddeedddddededdeeddedeeedeeedddddeddeddeeddedddddedeeeddeeeddddeddeedeeeeeddeddeededededddedeeddedddeddddeeededeedeeeeeddeeededeeedddddedeedededeedededddddedeeeeeedddedddddeeededdededdddeddeeeeeeedeedddededddeedddddeeededdeddeeeddedeeddeddedddddeddeeedddddddddddddddededeeededdeeeddeddedeeddedeededeeddeeddededeeeddeeeedddedeeeedeedddeeeddddeedeeeeddeededddeeddeeeeeeeeddeedddedededdeddddeedeeeddedddeeeddeeedeededddddededdddedddedeedeedeeeeddeddedddedeeddddedddedeeeddeedededdededdeeeddededdddeeddeddeeeddeededeeedeeeddedddeddeedddddddeddeededddeddeeddedeeddeddddedeededdddeeeeeddddddededddeedeededeedddeeededeeeeeeeedeeedeeeeeedeeeddddeddeddeeeddeeddedddeeddddeeedeeeeddeedededdeeeddeeeeddeddddeeddeeedeeeedddeeddeddddeededeedeeeeedddeddddededeeeddeedededdeededdeddddddedeeeedddddeeededddeeeededeeeeeededeededdedeeddeeeedddddedeedddeeddddeededdeeedeeddeddddeedeedeeeedeeedddeeeeeeddeeddeedeedeededdddeddeedddedeeeeedddededdddededdeededeeededeededddddddeeddeededeeddeeddeddededeedddedddddedededeeedeeddedddedeeeddddeddedeeeeeddedeedeeddddeeedeeeeeddedddedddeedddeeeededeeddeeeeeeedededeeeeddedddddeeedeeeededddddeeddeedeeeddddeddedeedeeeedeeddddddeeededddededddedddddeddeeeeddedeeeddedddedeededeeeeeeedddeeedeeedeededdddeeedeeeedddeddddeedddddddddeddeddededdeededdededeeeedededeededeededdedddddedeeeeedddeeeeeeeededeedeeeeddddedededdeeeeeedeeddedddeeeddeeeddeeeeddedeedeeededddeeeeddededdeddeeddddeedeeeddeedededeeeedddddedddeeeeeeddddeddeeededdeeedeeeedeeeeeeedddeededeedededeeddedeededededeeddeedeeedededdddedddeeeddddeedeeeedeeeeeededdededdeeddedeededdededdeddddeddeeddeddddddddeedeeddddddddddddeeddeeeeeeddeedeeeeddeeedeeddeeeeeeeededdeddddeededeeddddededeeeddedeeedeeddeedddddddedddeeeddedddddeeeededeeeedeeedeedddeddededdeddeededeedeedededddeddeededddedeedeeeedddeeededddededdddddeddeededdeedddeeeeddedeededeeeddededdedeeddddeddddddededddeeededeeededededdeeeddeeddeeeeeeddddededdddddededeeddeddedddddededdeddeedeeedddeddeddeeedeeddddededeeeeedeeeddddedddddeeeeedeeeedeeeedddddedddddddedeeedddeeeeeededdeeedeeedddededeeededdededddedeededdeeededdddddeddeeededddddeeddeeddeddedeeeedededededeeedeedeeeeeedddddeddddddddeeeddededdeeddeddddeedeedeeedeedeedeeedddeddeeededddeeedededddddedeedeedeeedeeeddddeeeddedeeddedddededdddddeededdeeeeddeeddeededdeeddeeeedeeedddeddedeeeeddeddedededdddedeeeeeeeedeeddedddeeddeeddeedddddeedeedddeededdeeeddeeeddddedededdeddddededeededddeeedddededdededeeeeeedeededdddeeedeeeeeddeedddddddddeddeeedddeddeeeedeededddededededddededdeeeddeeddeeeeedeedddedeeddddeddddedddededeeddedddeeeedeedeeddedeeddddddddedeeeddededdeeeddededdeddeeddeeeeeddeddeddddeddeeddeddddeddeeeeeededdedddedeeddedeeeeedddeedededeeededdddedddeeddedeedededdedeeddeeddeedddeededddeeedeededddddeeedeeeddeedeeeddedddddeeeededddeeeeeeededdddedddeeeedeeedededdddededddedeeeeededeeeeededeeeddedeedeededdddeeedddeddeeeeddeddeddeedddeeddedddeeddddeeddeeddeeeedddeeeededededddeeeedddddededdddedeeeeedededededdddeedddedddeeeddddddeeddeeddedeeeeeeeedddddeeeeedeedeeedddeddddddeeeeeeddedeedeeeeddeddeeeddddedddeedddededeeddededddededeeedddddddddeeeeeddeddeeededddededeeddddeeddddeedeedeeededdddedddddedddeededdedddeddedddddeeeeddddeeedeedddddeededeededdeeddededddeeddddeedededeeddeeeedddddeedededeeeeddeeddeeededdeeeddeeddeedeeddeddeddeeeddededddedeedeeedeeeddeeededddededeeedddedeeddeddeddeedeedededdeedddeedddddeeddededdeeeeddeddeddedddddeeedddeeedeededdeeddeeedeedeeedededeedddededdedeeddededeeedeeeededeeeededddededeeeededdddedddeeededeedeeddedeeededdeddddeddedddeeeddeddeddeedeeddddeeeddddeedddeeddedddededeedddedddeeeddeeededeedeeeeeeeddedeeeddedeeededdeedddddeeddeddededdeeededeedeeedeedeededeedeeeeeeddddeeeeddddeeeededdeeedeeedddeddddeeeeedeeedeeddeeedddeeddeddddddddedededeeeeeeeeddeeddeeeddeedededdddeeeeddeedeeedeedeeddddeeeddeddeeedeededddededdddeddedddddeeddeeddddeddedeeeedddddddeeeeddddeddeeddddeddeeddeeedddedeedddddeeedeeddeeddedededeeeeeededeededeededeededddeddeeeddededeeedeeedddeedeeedddeddeeeddeddddddddeddddedeedddeeeeedddeeedeeededddeeeeeeddeddedeedededededeeddedddddededdedeeddeededddddeddedededddddedddeddedddeededdededdeeddddeedddeddedddddeeeeddededddddeddeedddddeeddeeddddeeedeeedeeeddedeeddddeeddeeeeeeeedeededeeedddeedddeedeeededdeeddedeedeeeddeeddededdddeeddddeddddddedeeddddeddedeedeeeeedddeddddeededeeddeededeeeedddddddeedeeededeeeededeedeeeeededdeeeddeeeeeeedddeeeededeeeddeddddddddeedeeeeddeeedddeeeeededdeedddeeededeeeddeddedededededededdddddeddddeedeedddeeeededededddddeeddeedddddeeeddededddddddeeeeedddddeddedeedededeedeeeeddeeddeedeeededdeeddeeddddddeeededeeeeeeedddeddeddeededeedddddededddedededdeeedddeeededeeeeddeeddddeededddeddddedeeeddddddeeeedeeeddedeeddeddeeeddeeeeeddedeeedeeedeedddedddeeddedededddeeddddedddeeddeeeeddeeeddddddeeeededdeeeedeeeeeeededeeddeeeeeeddeddedddddeeededeeedeeededededededeeeedddeededddeeddddddeeddddedddedeeddeeeededdeddeededdededdddeeddeddddeeedeeddedededdeeeeddeeededdedededeeeeeeddeddeeeeeeddeeeedddededeeeededdddeddedddedddedeedeedededdddddeeeedddeedeedeededeeeeddedeeededdeeeeddededeedddedeedddeeededddedeeedededeeddeddeeeeddeeeeeeedddeeddeddddddedeeddeddedeeeeeedeeedeedeeeeddddedededeeeddeeeeeddeedddeeddddddeedeeedddeeeeeeeedededdedededeedeededddeeeeddddededdeedddedeedeeededeedddedddeddeedeededddddeeededeeedddddddedeeedddddedeeddedeededddeeddeedededdedeeeddddeeddeddddedededdeddddedddddedddededddeededeeeeedeedddeddedeeeeeeededeeddedeeeddeeddddedeedeeededdedddedeedddeeeededddeeedddddeeedddeeeedeeededddddeeeeddddeeeededdedededeedeededededddedeeededdedeeeeeeeddededeeeddeeedeedeeddeddeededddeeedddeddddeddedeedededeedddeeeeddeeedeeddeeeeeeddeddededddddeddddeededddeeeeeeeddedededeeededededddddddddeeeedeeddeeeedddddddddedddeeedeeeedededddeddeddedededdedeeedededdddeeeeeddeededdedeeddddededdeddeeeddeeeeedededdeeeddededededddddddeedededdeedddedeeddedddeddeedededeeeedddedeedddddeeedddddddedddeeeeeeeddddddedddddddeddedeeeeddeeedddddddedededeeeddedddeeeeeddeeedddddeeeddeeddedddeeddddededdeeddeededdeddddedddddededddeddeeeeddeeddeddddeddedddddeddeededddddeedddedddedeeeeedeeeeeeeedeeeeeeeedeedddeddeddddeddddeeeeedddedddddddedddeeedddeeeeedddeeddddededdeeeeddedddeeeeddededddedddeededeeededeededddddedddedeedddeeededededdededdeedededdddeedededdedeeeeeeddeeddededeeddeedeeddedddeededeeeededdddededeeeddeedddeeeededdddddddedddeddeeededeedededddededededdeedddddeeddeeededdeeedddddddeeedddeddddddeddeeeedeedeeeeeededeeeedddeeedeeedeedddeeddeeeedeededeeeeeddddddeddeddedeeddeeddeeeeddeeddededededdededdddedeedddeededeedededdedededdeededeedeeeddeddeeddededdeeeddeddeededdeddeedeededddededeeededdddedeeeedeedeedeeeeededdddededddedeededeedeeededeeddeedddededddedeedddddededddddeeeddeeeeeeededeeeeedddddeeddeedddeeeddededeeedeeddedededeeeeeeddeeedeedeeddeeeddeeeeddeeededeeeedeeddddeeeeeedddddededdedddededddeedddedeeeddeeedddeeeeddddeeeeeedddeddddeddeeeededdeddeeeeeeddeeeededddedeedddddeeeeedddddeeddeeddeddeedddeeddedddeeeedddeedddedeeddeeedeedddddeddedeedededdedeeeeeededdeeddedededeeeddeeeddddddeeddededdeddddeeddddeddeeeedddeeeededdeddeddeeededeeeedddeeddeddeededeeddededdeeeddeddedeedeededdddddddeddedeededeeeeededdddedededddddeddedeeddedddeeeeddededeedddedeeeeededededeededdeddeedeeedeedeeededeedededeeddddeeddeddeeeededdeeeeededddedddedeeedddddedddddeeddededddeddededdeeeddedddeeedddedeededdeedededeedddeddededeeededeeedeeddddeeeeeeedddededdeddededdeddddededeeddeddeededdeeeddddeddeeeedddeeeeeeedeededdedededeeeeeeeeddeeedeedeeeeddeddeedeeeeddeedddeeeddeddeedeedeeeeddeedddeddeedeeeedeeeeeedeedeeeeddeeedddeedddeeeeeeeddeddeddedeeddedddddeededdeeeddeeeeeedeedeededdeeeddddeeeddedeeeeddddedddddeddeeeeeddddeeedddddedddeddeeeeeedeededdddddedeeeddedddeddedddedededdeeeedeeeddddedeeedededddddededdddeddeeedeeddddedeeddeddeedddeddedddeedeeedeedeeddddddddeeedeeedeeddddeddeeeededeeddeededeeddeeedddddeeddeeeedddeedddeeddddeeeedededdedeededdededdededdeedeeeddeddeededdededededddeeddeddeddeedddddddeedeeeeeeededededdeeddeededddeeeeeededdedeeddeeeeeeedddeededdeddededdedddeeeedeeeeeeddddeeededdeddeeddedeedddddedeeeededeededdededddddededddeeddeddedeedeeddededdedddedddeeddeeeedeedededeeededddeedeeddddddddeddeddeddddedddedddedeeeeeedeedddeddeeededededddedeeddddeddededdeddedeeedddeeddededeedddeeeedddddddedddeeeddedeeddddeeeedeedddeeededdddeeeeeededeeeeedeeddeddeeeedddddeeedeeeeddeddddeedddeededdeeeeedddeeedddddedeeddedddedeedeeddededeeddeeeedddeeeddddededeeededdeeededeeddeedddeddededddedeedddedddeddeeedededdeddddddededeeeeddedeeededdeeedeeeedeeededdedeeeddeeddeddeddedededeedddedddddedeeeeededededdddeedeeddedededdeddeddeedededdededededeedddedeeddeddeddedededdeeddeddedddddeddddeddeddddddddddddddedeeededdeedddeddddeeeeeeeededeeddeeddddeddeddedeeddeddeeededeededeeedeedeeeeeeddddedeeddeeddeeedeeeeedeeddeedededdededddddededdedddeeeddddeeeddedeeddddedddddedeeeeedeedeeeeedeeddeddddeeddddedddddeeeedeededdddeeeeedeedddeeededeedeeddededdeeeddeeeddeeddedddeddeedddedddeedeeeddddeedeeddddeeddeddedeeeddeddddeededdeedededddddeeddedededdddeeddedeedeedeedeeedeeeedeeeeeeeededdeddeeeeeeeddededeeddedeeedeededdeddeddddeeeddeeeedddddedeeddeeededddddddddddddddeddeddeedeeeeddddddddddedeeddddddededdeddeddeededddedeeeedededeeeeeeeddeeeddddeeeeedededdedeedeedddeeeddeddeeeededdeddddeeddddeeeeeeddeddededdedddeeeddeeeeeeeedeeddeeeddeddeddedededeedeeedddededdeeedddeeddddedededeedeedddedeeeeddddedddeddeededeedeeededddededeedddeddeddedeeeddeeeededddddddedeedddeddeddddedddddeeddeddddeeedeeeeedddeeeedddeedddeeeeeeddedeeedddeeeededeedddeededeeeedddeeedddeeedeeddeeeeeeddddeddeeeeddeeeddddeddddeeddedddededdeddddddedeeeedededeeeddedddeeeededddeeeeeddeeeedeedeeededddedeeddeeddddedddeeedeedeeddddddeeeeeedddddeddeedeedeeeddeeeededdedeededdddeeeeeeeedddeeeedededeeeedeeeddeddededdddedeeeedeeeeedddeedddeeeddeeeedeedeedeeededddedeeddddddeeededdeddeeeeeeddeedddedddeedddddededddedeedddddddedededdeedeeeeedeeeeeeeededeeedeededddeeddedeedeeededeeeeeeddeededdddddedddeeedddddddeeeedeeeedededdededdeeddddddeeddeddeededdeeedeedeedededdddeedeeddeddddededededdeeeeedddeededeeddededeeeddeeeeeeedeededdddeededeedeedededeeeeeedededeededdddeedededddeedededdeedeedddedeeeeedeedeedddeddedeedeedeeeedeedeeddeeedeeddeddeddddeeeddeddddddeededddededddddeddeeededdeeddeeededddededddeeeddeededededddedddeddddddddddedededeeeeededeeddeedeeedddedeeededdddeddeddeedddedededdeddeddededdeeeeddedddedeededdededeeeedddedeedededdedddddedddddeeeededddedeededdeddedddeddddeeeeeddeeedeededdeeeeedddddededeeddeeddddddeeddeeedeededeeeddddddeddedededdededddeddeededdeeededededddedddeeddeeedddddddeeddddddddeeedededdeeededdddeedeedededeeddeddeedededddeededddeeeeeedddeddddeeddeeeeedeeedeeddeeeeedddeddddeeeeddededeeedddeeeedeeeddeddedeeeddeeeeeeeeedddededeeeeddeedeeeeeddedddeedeeeeddedeeeddeeddeedddeedddedeedededdeeddddeeeddeededddeddddddeedddedeeeededdddeedddededdddededeeedeeeedddddeeedeeeeeddeeddeeddededdddeededdeeeededeedeeddedededddddededdeddddeedeeedeedeededdddedddeeddddddddeeededddedddeeedddedeeddedeeddeddedeedeeeddeddedededdddedddedeeeeeeeeedeeddeddddeddeedeedeededdedeededdddededddedeededeededddeededeedeededdededddddedededdeddedeeeedeeeedeeeeeedeeeddeeeddededdeddeedeeeeddeeddeddddeedddeeeeddddddeeeedededdedeeddeeeeeeeedeeddedeeeedeeddeeededddedeeddedeeeddeddeddededddedeeddddedeeeeedddeeddeedddeedddddeddddddeeeeedddeeeeeddeeeedededdeddeeeedddddededdddedeeeeeeddedeeeddddededdeddeddeddddddeedeedeeeeeeeeeedeeddddeeeddededededddedddddeeeeeeeddedeeddeeeedededeedeededdededddeddddeddedededeeeddeeddeddedddeeeeeddedeeeedeededdeeeedddeeeddeddddeedeeeddddddedddddeeddeededdddedddeedddddeeddddddeeededddeedeeddeedddedeedeeeedddeededeeddedededdeeeedddddedddedededeededddddeededdeeeddedededdeeddedeeddddeddeeeddeededddeeeeedddeeededddedededeeddeddedddddedeeedeedededeedddeeeeeddeddedeeeddeeeeededdeedededddeeeddddeddeddeddedeeeeededdeddeedddededdeddddedeedeeddeeedddeeddededededdddedeeeeeedeeddddddddedddeeeeeeddddeeeddededdddeddddddededdddeedeeeddddddeededddeeededeeeeddddeeedeedddedddeeeddedededdedeeedeeeddedededdedeedeedeeeddddeeeddeddddedeeeddedddeeeddeddeededdedeeeeeeddedeeeedddddeedeeddededeeddeeedddeeededeeeedeeddeeedddeeddedededdeeeeedddeeeeeeeedeedddeeeedeedededddddeeeeddededddeedeeddddeeeddddeeeedeededddededeededddeeddeeeedeedededeeeedeeedeedeedeeeededddeeededededddddddeeeeeddeedddedeeedeeedeeddeededdddedeeeededeedeedddeededededddeeeddeeeeeedeeddeeedeededddeedeeeddeedddddededddeeedddededededddeeeedeedeeddeeeeeeddeedeeeeeededdeedeedeeddddeededdedeeeddeddeedddedeedededdeddededddeedddeededdedededdddedeedddedeeddeddededddededdeddeeeededdddeedddeedddeedddeeeeeeddeededeeddeddedeeeeeedeeeedddddeddeeddeedeeeddddddddddeddeeeeeeededddddddeeededeeeddddeeeeddddedddddddeeededddeddddeeeedeeddeeeddeeeddedddddeedeeedeeedeedddeeeeeeeededdeeeddeeeeeeddddeeeddeeeededdeddddddeeedeeeeddeeedddedeeeeeddeedddeeeeedeeddeddeeeedddedededeeedddeeddddeeddddddddeeeededddedddeeddeededddeeeddddeedddeeeeeeeedddddeeddeeedededdedeeeedddeddeeeeeededeeeddeeddddddeeeeededeeeeedddeddeedddeedeeddddeededddededdddededddeeeeedededdeeeeeddeedededddedeedeeeeddeeddededeeeddeddeddddddeeededeeeddeddedeeeddeddededddeeddedddeddededeeddddeeeddddeeedeeeddededdeeeeedeeeeeddeeeeeededeeeeeeedeeedeedeeeddddeedddeeeeeeddedddeeededeeeedddeededededddddddddedddddddeeeddddeeddedddddeeeeddededddddeddeddddedeeedededededddeeeddeeededdddedededdeeeddededeedeeddddeddeeeedeeededddddddddedededdeedeededeeeedddeedeededddeeeeeeeddddeededdddeeeddddeededdededeededeeeeedddeddeddeededededddeedeeddededddeeeeeeeedddeddddedddeedeedeeddedeeeeeeeedddeedeeeededdddeeedeeeddeeeeeeddeddddedddddddddeeedddeeeedeedeedeeeededddeeeededdddeeededddedeedeedddedeedeeededdedeededeeedeedeedededdeeeedeedeedeedddddedeedddddeddedeedeeddededeedeedededdedeeeededeeddeddedeeedeeeeedddedddddeeedededdddedeeeeddedeedddeddedeeeedeededeeededeeedddeddddeddddeddddedeeddeddeeddeeeddedeeeedededdddedddeddddeeedeeddeeeeeedddeeedededdddeddddedeedddddddddeedeedeeedddeeeededddeedeeededeedeeddeeeeeddddedddeeedddeddddeddddeeeedeededdddeeeddedeeeedddedddddededededdeddedddddddededeeedededdeeeddeeeddeeededddddedddeededeedeeeeedddeddeddededdeddeedddededddddddddedededddddeddeeddddddeededdeddededdeedddeeddddeedeeedddedeeeededddeeddeeededddddddededeedeedeeddddddeeddeddeddeedededededdddedeeeddddeeedddddddedededeeeeeddddedeededdededdeeeeeeddeeeddeedeeededddddeddeedeedeedddeeedeeddeeeddeedededdeeedeeedeeeeedddededeeddddedddddededddeedeeddedeeddeddededddddeededdeeddddddddeeddedddedededeeeeeeeeeedededeeeddeedddeddeddddedddeedeeedddeeddedddddddeeedddedeeeeeedeedddeddddeeeeddddddedeeeeeeeddddddedededdeedddeedeedddeddddeeeedddddedeeededdededddedeeeddddeededeededeeeeedddeeddededeedeeedeeedddddedddeddeeedddddddeeeeedeeeddedeeddeddddddddedddeddeedddddedededdeededeedddeddddddeedeeeededdededddddddeededeedddddddddeeeedeededdddeddeededddeededeeedeeedeeeeedeedeeededdedeedddddeeddedeeedeedeedddeeeeeeeddededddededddddddeddeeeeeedddeddddeedeeeddddedeedeeddeeddeeeedddedddeeedeeedeeededdeddededddedddededeeddeddddedeeeededdeededeeededddddeedddedeeeeeeedeeeeeeeeddeeededdddddedeeddddeededddddededddedeeeededeeeeddddeeeedddedddeeeddddedeeeddeddeeedeeeededeedeeedeedeedeeeedeeeeeddeeeddddeeedeeddeeeedededeeededdedededddedddedddddddeeddededddeeeedddeeeeedddddddeddddeeeeeddededdeeeeedddeeeeddddeededdeddddddeddddedeeededddededeeedeeddeddeededddddedddedeeddeddddedeeddeddededdededdeddeeeeeddedeeddedddeddeeddeeeededddeeddeddddeddddeeddddedddeeddeeeeeedeeeeddedeeeededeedeeddeededddeededdeedeeeddddeedeedeeedeeeeeddddddeeeddedeeddeeeedededdddddedeeddddeddedeeeededeeeededddedeedddeeedededededddeededeeddeeeeeeeeedeeddeddedededeedddeedddedeeeeeeedddeeeeeddddedeeedeeeddddddddeedeeddeeedddeddeeeddeedededddedeeddeeeedeededdddedeedddddeededeeedddeedddeeeddedeeedeeeeedeedeedddedeeedddeddeeeddeeddeddddeeeeeddeededeeeddeeeeededdeeeedddeeedeededeedddddededdeeeeededdeeeeeeedddeddddeededdddedeeddedeedeededeeddeddeeedeeeeedeeddddedededeededddddeeeeeeeddeddededdeeeddededdeeeddeeeeddeeeeeedeededdeddddeeddeeeeedddeeeeeddeeddedddddeeededdeeededdeeddedeeedeedeeeeeeeeedededeeeeeddddeddeeeedeeddddddedeededdddededeeeeedeedddeedeededeedededeeddeeeddedddddddeededdeeedededeeddddeeddddeddeddedeedeeeddeedddeeeedddddededeeddeddeeedeedddeedeeddeeddedddeeddddedeedededdeeeddeddededdeeeedeeeeeeddeeddedeedeeeeedeeddeeddedddedeeddddddeeeddddddeedededdedddedeededdddeeeeededeededdeedeedeedddedddddeddddeededddedeedeeeeeeddddeddeeddedeeddddddddedeeddededddeeededddeeddeddddddddedededdededdeeededddeedddedddeeddeeeededdddedeeeeedddeedeedeeededdeddeddeededededeeddeddddeeedeedddeddeeddededddddeededdedddddddddeedeeeeddeeeedeeeedeeddeeedddeddddeedddededdedeeddddeeeddeedddeeddeedddeeedeeddddeeeedeedeeddeddeedeedddeddeeeedeedddeedddeeeeeeeeeeedddeededdddedeedddddeedeeddddeededeeedeeeeeddeeeddddedededededdededddeeddeeddeeddededeeedeeeddedededdddededeeeedddddeddeeeeddddddeeedededeedeeeeeeeededeedeeeddeddeeddddddeddedeeeddeeddedddeedeedededeedddeedeeddededeededdddddededdddeeedeeeddedededdeddeddeddddddeddedddeddedeeddeeedddededeeddddddddedeeddeedededededededdedeeeedeeeddeddeeddddeddedeedeeddeddededeededeeeeddeedeeeeeeddedddeedededdedededdeedeeddeededdddededdddeedddeedddeeddeddeeedeedeededdeddeddedeeeeededddddeeeeeedededdeeddddddeedddeeededddeddeeeeeedeedddeeedededdededddedeededdddeddddedddddeddeeedeededeeeeeeddedeedeededdedddeddeeeeeddeeedddededdeedededdeededededdddddeeeddeeeeddeeddedededdeeedeeddeeeededdeddeeeeeeeededededeeedededeedeededddededededeedeeeddededddddedddeddddedddddddeeddddeddeedeeeededddddddeddeddeddddeeeededeeeddedeeedeeeededededeeeeeeeededddddddddeedeeddddeeedeedededeededddeeeeeeddddeeeeeddeeedeededdddedddeddddeeeedeeeeeeeedeedddeedddddeddedededeedeeededddeddeeeeddeedddeedededeedeedddedeeeddeededddedeeedededdeeededdeeeddddeeddddeddeeeeedddeeededdddeddedeeeededdeddddddeedeeeedddedddeedeeeeddddeeeeeeeeddddddeeeeddedeeedddeeededdeddddeededeeeddedddeddeeeeedddddeeeeeddddedeeeeeddedeedddededededeeeeddddddeddddeeededeededdeeeeddedddeeeedeeddeeeeeeeeededeededededdeedeeededdededdedeeddeeeeeddededeeeeeeeedddedddedeedededdeedeeeededdeddddddedeeededdddeedddedddeedddeeedeededdeddddedddeedeeeeeddddeddedddeedeeedeedeedeeeeedddededdedddeeeededdedddeeeddddddddededdddeddddeeedddedededdddddedddddddedeeddeddeedeedededeedeeedddddeeedddddeeeeeddedeeeddddeddeddeddddededddddddddededddeeddddedeedddeeeedddddeddddddeedeedeeedeedeeeeeedeeddddeeddeedddedededdddddededddeeeededdeeddddeedddeeedeeeeededeededdedeedeedededeeeeeeeededeededdddeeeedddddeedeeedeeedeeddeeeddeeededeeeddeeeedddeeeedeeedddeeeeedeeeeeeddedddedddededdedddddddededddeeededddeddeeeddeededdeeedddededdddeedeeeeededeeeddeeedeeedddddddededeeededeeeeddeeedeedeeeeddedeeedeedddeeeeddeeedeedededdeedededdededeeeddedddedeedeedddedeeeededededdededddddddeeddeddeeeddeddddedededeeeeddddeddddeeeeeeeeeedeeedddeedeeddeddededddddeeddddddededeeeeeededeeedeeeddeddedededeededddedddeeeddeeedededddddedddeeedededddddeddedddddeedeeeeededdededededdededededededdddddeedeeddeddedddddeeeededddeeddddeddeeeeedeeddeeededeeedddeddddeeeeedededdeeddddeddeeeedddddddedeeedeeeeddeeeededdddedddedeeeedeeedeedeeedeededdddeedddeeddeededdedddeddedddedddeddedeededdddeddddddddddeededeedeeedeedddededdddededdededdeddeededeeedededddedddddedeeeededededdeededdeeeddedddededeeeededdddedddededdeeeededddeedeededdedddeeeeddedddeddeeeededededeeddddddeeededeedeeededeedededddededdddeddedeedeeedeeedeeededededeeedddeeeeedeedddddddededdedededdeedeededeeddddeeededeeddeeedeedeeddddeeedededddeedeeedeeeedeeeeeedeeedeeeeddeeeedeeeeedeeeeedeeededdddeeddeeeeeedeeddeeeddededdeeeedddeedeeeddeeddedeeeedeedeeeededdddddeddedeeedeeddeedededddedeeddddedeeeeeeddeeddedeeddeddddeeddeeddedeedddeeddeeededdededdddeedeeedddeededddeeedeedeeeededeeededddedeeeeededdddeeddeeedeedeeeeeeedeedeeededdeeddedddededdddedddeeeeeededdeddeededeedeeedeedeededeeddddddedddeededededeededdeddedeeedddedeeddeeeeeddeeeeddeededddeedededdddeededdedddddeddeeeeedeededddddedddededdeeeeddeddddedeededeeddeddeedededdededededeeeeededdddddddddeeddddeddeddeeeeedddededdeedeeddeeeeeddedededdededeeeeddddedeeeeedeeeededeeededeeeeddededededddeededdddddddeeeededeedededeedddedeeeddeddeeeeeddeddeeeeedeedeeedddeeeedddddeedddeeedeedeededeeddeedddededeeddddeedeeedddeeddddedddeeedddededeeeeeeededeeeedddeededddeededeeeddeeeededdedddededddeddeedddeeeeeddddeedeeddedeeeededddeededdeedeeeeeeeddeddeddddeeddddeededdddeeeeddeeddedddedeeeeeeddeddddddddeedeeddeeeddeddddeddeeeedddededeedddeedeeedddeddddedddededeeddeeddddedddedeeeddeedddeedeeeedeedeeeedeedededdeeeeeedddeddddeeeededdedeeddddeeeedddeeddeeedeeededdeededdedeedeeeedddeedeeededddeedeeeeeedeeededeeeeddedeeedeedeeeedeeddeeededededddddedeeeeeddedddeeddeddddedeedddededdddedeeeededeedeeddddeedeeeedddeeeedededddeddddeeddeddedddeedeeedddeddeddededeeeeedddedddddeddeeededdeededddddeeeedeeddedeeededdeedeeeeeddddeeddddeedeeddeddeeddeededddeedeeeeedeeddeeeddededeeeeddedddeeeedddeedeeddeededededededeeddeeeedededeedeedeedddeededddeeeedeeededeeddeddeddeeeeeeeeeedddddeddeeddeeddedddddddeedeeddeeeeedddeddddddedeededeeeddeeeedeeeddeeddedddeeedddededdddddeededdddeeddedddeeeddddedddededeeddedddeeeeeeeddeddeeeddeeeeeedddeedededeeedeededddeddeeeeeeddddededddededeeedededddedeeddeedeedeeeededdeeeddeeeeeedeeddddddddddddddeeeedddddeddeeedeeededddeeeeddeeedddeeedeeddeddeeeeddeeedededddeeddeddddddedeeeeeddeeddeeeddddedeeeeededdeedeeddedddedddeeddeedddeeeedeeeeeddddededdedededdededeeedeeedeedeeeddeededeeededeeeddededeeeddeddeddddddeeeeddeeeeddddededddedddeededddedeeedddededeeeeedddeeeedddeeedeeeedeeeddeedeededeeeddeeeeeeddeeeeeeeedededdeddeeeeddeeedeeeeeedddeddeeedeedeeeeddddddedeeededddddddeddddededeeddddedddddeddddeeededdddddededededededdeddededdeddeddedddeedeeedddedeeddddeeedddedeededddddedeeeeededededddddddddddededeeeedededededdddeededdeeddeeeeeeededdeddeeedeedeedeeeddeeddeeddddedeeedeeededdedeeddedededddeededddedddddeeeedeeedededdddeeddeededdeedddddeeeeeedddddedeededeeddeeeeeeeeeeeeeeeedddddddeeeeededdeedddddeeddddedeedeeeededddededdededdeeedededdeeededdedddeddeeededdedeedeeededdddedeededdedeeddedeedeeeedddedeedddddeddeeedeeeddededdeeddeededeedeedededeeddddeedeeeeeeeeeededdeeedeeeddddeddddddeeeddededddeeddeddeeddeedddededeeddeeddddddeeedddeddedeeeeeddddeeddededdeeeeeededededdedededdddeeeeeeddeeededdddeeedededdddeeddddddeededddeddeedeedeeeddddeeededddedddeededeedddddeeedeeddeddddeeddddededdedddeddeeeeededddddeeeeddeedddededddddedeeddeddedeededdddeedededededeeeeeeddeeeddeeedddddddeeeddededeeeeededeedeeeeedddeddedeeedddeeedeeddddededededddddedeeededeedeedeeedddededddddedeedddeeededededededeeeddededddeedeedddddddededeeedeeeddeededeeddedeeddeddedddededddddedeedddeeeedddddedeeededeededddddedeededdeedddeeedeeedeeeedeedeedeeddddddddeededdeddedeeedeedeedddeeeeededdedeeeeedeeeeedddedededddddeddedddddedddededddeeeeddeddedddddeeeeddeeddddddeeddeedeeedeedededeedeeededeeededdeedeeedddedeeddddedddeeddededeeeeeeedddddeeeddddddddeeeedeedddeddedededdededdedeeeeeeeedddddededdeddeddeeddeedddedeeeeedeededdedeeddeddededededeeeeeedeedddeeddededeedededddeeeeeeeeeedededddededddeddeeedddeddddeeeddeeedeedeedeeddddedeeedddeddeddddddededddeeeeedeeddeededdddedeeeedeedddddddedddedededeededeedddeeededdededdddeedeededddeededeedddeedeedeeddddeeddeddededdddddeeddedededdeddededdddeeedeeededdeededddeedeeeddeeedddddedddeeedeeeddddedeeddedddedddeeddddedddeeedeeedeeeddddeeeddedddededededddddddeeeededdddddddddedeedeeddeedeeeddeeeeedeeeeeedeeededeeeededededdddeededdeedeedddeddddddeddededdddddddeedeedededdeddededddeeeedeededdeeedeedddedeeeeeeeeeddededeededeeeeddedddddeddeeddeeeeededddeeeedddedddedddededddddddeddeddddedddeddededeeededddddddeeeddeeeeeddedeeeedededdeddeeedddeddeddeddddddeddeeeeeeededddededeeedeeedeededdedddeddedddddddeddddddeeeddeedddedddeeddeddeeeeeddedeedeedddeddeedddeeededddeeedddddeededededdddeedddeddeeeeeeddeeeddedeeeddddeddeeddeeeeddedddeedeeddedddddeedeeddeedeeeedddddedeedddeddeddedeeddedeeedddedeeeeedeeeedeeeededeeeededdeeededddeeedededdeeeddededeedddeeeddeeeededddeddeddeeedeeddeeddedeedddeeededeeeeeddeeddeeedeedddddeddeeeeedddeeeedeedeeeededddeddeddedeeddeedeeeeddddddeddeddddeeededeeeddededddeeeeedddeedeeeeeddedeeddddeeeeeeddddeedddeeedddddeedeeeeedededeeeedededededdeededddeeeddededdededddeeddddeddededeeeeedeedddddeeddddeddddddedededeeeeedeeeeededddeeeeeeeddeededdddededeeeedddddedeeededddddddedddeeddedeedeeedeededddededeedeededdededdeedeeddeedddeeeeeddeeddeddddddeeddddeeedeeeeeddeeeeedeedeedeeeeeedededdeedededdeedeeeeeeeddddeeddeeeeddddeeeeeeeeeeeeeddeeddededeededdededdeeeedeeedeeddeeeeddeeedededdedddeeddeddeeeeddeeeededdedeeddeedddeddddededeedddeeedeeeedddeeddeddeeededddeededeeddddddeedeedddeddedddedeeedeeeddeddeeddedeeedeeeeddeededdeedddedeeedededeeeddddddeedeeeededddedeededdddeeeeddeeeeeeddedddeddeddeddedeeedddddeeedededeededdddedddddddeeedeeedddedddddedeededdededeeededededddedddddedeededdddededddeedeeddeeededddddeeeeeeeeeddddededeeedddeddeddeeedededdeedeeeeeedeeededdeedddedddeedddeddeddddeddddeedededdedddededddeeedeeedeeeeededeedddedeeddddededeeeeedddeddedeeddeddeddeeedddeededeedddedddeededeeeddeedeeedddddedeedddeddedeeddedddedddeeeeeeedeeeeeddeddedddeddddeedddedddeddddeddedeeedeeeeeddeeddddeedeeddededdededddeedeededeeedededeedddeeddededdedddededeeeedddededeeededddeddeeddeeededeeeddeeeedeeeddeededddeeeeddeddeddddeeededeeeeedededdddeeedeeddeeededdeedeeeedeedddddddedddeeeedeeeddeeedeededddddeddddddededdededddeeeddeeedddeeeeeedeeedeedededddeeeededededededdddeededeedddedddeeddeeededeeddedeeddeddddedddeededeeedeeeddedeeddedeeededdddededddedddeeeeddddeeedeedddeedddeddddeddeeddeeddeeeeededddededdedeeeededdedddeeedeedeeedededdeeddeedddddedddededeeeeeeededeedededededeedeeddedeededddddedddeddeeeededeedeedeeeeeededeedeededeeddedddeeeeededdedeeddddddddeeeeddddeedddedeededddeeeddedeeddedddededeeddeeddedddeeeedddedededeeddeeedeeedeeeeedddddddededddededddddeedeeeedededddedddddddddeeeddeedeeeeddededeedddeddeedddeededeeddeddddeeeedddedeededeeeeeeeededeeedddeeeeeededdedddddddeddeddddeeddeddededdeeedddeedeeedddeeedeedeeeddeededdddedddeddedeeeeddeeeedeedededddedddedeeddddeeeeeeeeeeeddeeddeeeeedeeeeeeedededdededddeeedeedeeeeededededeeededeedededdededdddeeedededdeededddddeededdddedddddeeeeedededddddeededdedddedddeeedeeeddedeeedeeeededddddeeeddddeeddddeeededddddddeededeeeddedddeddeeeeeddeeddedeeeeddeeedeeeddeddeddeeeededddeeeeededdeeddedeeededdddeedeeedeeeedeeeedeeeddeddeeeeeeddeeddedeededeedeeeddddeeedeedeeddeeeeedeededeeedeeeedddddddedeedededdeedeeeededdeddddddededddddeeeeddddddddeeddedeedeededdedddeddddeddeeeeedeedddeedddeedddeeededeeddeeedeeedddeededeeeededeededdedddeeddddededdddeeddddeeeddddedeedddeddddedeededeeddeddeddeedededeedeeddddddddedddddeeededeedeedddddeddedeededeeeedddedddddeddddddedddddeededdeddedddddededdddeedeedeeeeddeeeeeeeeeedddddeddeeedeeeededdedddedddeeddedddddeeddddeeeddededdeeeeedeeeeeddedddeeededeeeddeeeeeddddeeeddddeeeeedeeeeedeeddeeeeedddeeedddeedededddeedeededeeeeddeededdedeededeeeededdededddedeedddddddddddeeddeeddeeeeedeeddedeedeedeeedddededdedeeddeedededdedddeeedeeeddedddeeeddeeeeedeeeeddeeededdedeeeddddedeeeddeeeeeedededeededeedeeeeeededdedeeddeeddeeeeeeeedddddeeeededededdddeeddddeeeddeeeddeeddeddddedddddeeeedddeeeeddeeedeeeededededddeedeeddeeededddddededdededededeeeeeedeedeedeeedeeddddddedeedeeddddedeeeeddeeddddededdeddddeedededddedeedeeedddeeddeeeedddeddeedeeddddededddedddeddededeeeddedddddeeedeeededeeeeddddeddeeeeeddeddeeedddeededdeedddedeeedededdeedddddddeeededddedeedeeededdeddeeeedeedddeddeedeededededeedeeddeeddddddeedeeedddeddeededddeededddeeddeedeededeedddeddedddddeedeeeededeeeededededeedddeeedddeddddddeddedeeedddddddedddddedeeeeeeeedeedeeeeddeeeddeeddededededddddedededeedddeeeeeeddddeeeddeededddeeedeeeeddeededeedeeeeeededddddedeeedeeddeeedeeeeeddeeddededdddeededeedeeddeeeddeeeededeeeeedededeeddeeeddedddeddededddeddeddeededdeddddeddeeeeedddeedeeeeeedddeeddedededeedededeededeeeeeedeeedeeeddddededeeedddedededddedddeedeeededddeedeeddeeeddededeeeeedddeedeeeddeedeedeeedeeedeededeeddddddddedddddedddeedededdeededddddeddddeeeddeedeedeeeddeddeeeddeeededeedddeedddeeeeddededdedeededededeeeeddeeeedeedeeeededeeedededddeeedededdddeeeeeeddeedeedededdeddeeeeeeddeddeddeeddededededeeeddedddeeddeeddddeedeedeeeeeddeeeddeeddedddeeeeedeeddededdeddedeeedddedeeeedeeeddedeeeddeeddeeeeededeeddeeededdededdddddeeeeeeeededeedeedddededeeeedddedeedededdedeeddeddeddededddeededeeeeeeeeeddddedddddeeddddeddeddeeeeedddddeddeedddedeeedeededeeeddedeedeededddeeededeeedeededeeedddeeeedeededddeedddeeededdddddedeedeeeeeedeeeedededdeedeeddeeeedededddeededeeeeeeddddeeedddddeedddeeddeededdedeeddeedddedeeeeedeeeeddeededeeddededdeeeddddedeeeeeeeedddedeeeedeeedededeededdeededdeededdedeeddedededdeeedeedeeeddddeeeeeddeeeeedeeeddeededddedeedeeedddeddeedddeededdeeddddddeeeeddeeddedddedeeeeeeededdedddedeeeeeddeeeddeddddddddeeeeddededeeddeeedeeedededdddeddddddededdeeddededddddeeddeddeddedeeeeededeeeeedeedededdeeedddddeeddededdeeedddededdededeedddedddeeddddeeeededdedeeddeeedededddedeeedededeedeeddeeddeededeeeeddddeeeeeeededeeeeedeeddedeededdddededeeedeeddeeeedddeddeeeddededededdddeeededdeedeeeddddedeeeeeeddeeedededddedddeeeddedddeddeedeeddddedeeededdeeeeeedddeeddddeddedddedddedeedddddedeeeeddedeedededededdeeeddddeedddeeeddeededdeeeeeddedddeddeeeedeeedeeeededdedeededdeddeeeeedeeeddeeeeeedededeeeeedeeeddeeedeeeeeddeedeeedeeededddeedeeeeedeeeeddeededdeedddedeededdddeedeeedddededddddddeedeeddedeeedddededdeeedeedeeeeeedeeeeddeeddeeddeddddddddeededddeddedddddeddededdddeeedededdddddededdddddedeedeeededeedeeeddddededeeeedededeeedeedeeddeddeddeeeddddddedddededeeeeeddeeedddededddeedeedededededddedeeeededeededdedddedddedeedddddeededeeeedeeeeeedeeddeeeeddeeededddeddeedeededddeeddddeeddddeddeeddedededeeedeededeedeedededdedddedeeedeeedeeddeeddeedededeeeeedeeddedddeeeedddeddedddeeedeeeeddddeeddeeeedeeddeeeeeededddeeeeedddddddedddeeeddeddeedddddedddedddeedeedddeededddeeedeeeeededeedeeddeeeedddedeeeeddddeddededeededeededdeddeeedddddeddeddeeeeddeeededdeedddeeedeeedeededddeedddeddeeddedddeeddedeedeeededddededdddeededddedeedddddeeddeededededdeddeedddedeeddddddeedededdeeeeedddddeeddeeddddedeeddddeeeeededddedddededdeddeeedeeeedddedededdeeeeddddeeedddeeeeddeddeddeeedeedeedeeddddeddeedddeeededdeeeddddedeeddedeedededdeeddeeddddeededdedeeedeeeddeeddeededeeedededdeeeeedddddedddddeeeededeeeeedeedddedeeddeddddeeeededdedddedddeddddddedddeeeddeddddeddededdddddededdeeeedddeedddddeddededeeeedeeedeeddeededeeeeeddeddededeeeeedededeeeddedeedeeedededdededdeeddeeeeeeddeedeeeddededeeeddedeeeedeededeeeeddeeedddededdedeeddddeddedededeedddddededeededeedddedddeeeeeedddeddedeedeeedddeeedededddeeedddeeeeeddeeedddddddeeeeeedeeeddddeeeeedeeddddddededdedeededededeeeddddeeededdedddeeedededdeeedeeeddeddeedeeddedeedddddeedeeeddeededdeeeeedddddddeeeedddeddeededddddedeeddedeedeedededdeddeeddeddddeeeeeddededddeedddddddeeeddddddedeeededeedeeeeedddeededeedddddeeeeedeedeedeedeeedededeeedeeeeddddeeedddededddddeeeedddedededdeedddedededeededeedededededdddeeddeeedeeddeeededdeddedeedeedddededdedeeededdeeddeddeddedeeddeededeedddeeddeddededeeedeedeeddeededeedeeeeededddddddeddeeedddddeeeddeeeeedddeeeeeedeedddeeeeddeeedddededeeedeedeeedeeedededddeeddddeeddeddededddddeeeeedeeddddddeeedeedeeedededdeddeddeededdeededddedeeeeedddeddedeeeedeeddddededeeeeedddddedddededddddeeeddeeedeedeeededdededdedeeeeeeeededeeedeededddededdddedddedeeededdededddededeeddeeddedeeeedeeedddeddeeddeddddddeddddeeeeeeeeeeedddeedeeeedddedddeedededdddeeddeeddeeeddddedeeeeeeeeeeededeeddedddeddddeeedeeddeddeddeddeeddeedddeededddddedddedddeeedeedeedddeddddedddedddddedeededededdddeedddeedeedeeddddeeddeedddddddedeeedddeededdedddeeddddeeddeededddeededddeeeeeeddeeedddddddedeeeededededddeedddeddeeddeedddddedeedddeedeeddddeeeeeddedddeeeeedeedddedeeeeeddddddddeddeddeddeeeeeedededddeeeedeededddededdeeddededededddeedeedeeeddedeeeddddddddddddddedddddeedeedddeddededddeedeeeeddedeeededdeeddddddeedededdedededdddeddddeededddededdeddeeeeeddeddeeeeedddeeddeddeeeedddddededddedddeeddedddeedededdddeeedeeeeddeeeedddeedeeddddeddeddededeeedeeddeededdddddeeeeeeeedddeddedeeedededeededdddededdedddedddedddeddeeedeeeedeedddeddddddeedddededeedededdddddedddeeedeeedeeeededdeedededeedeedeeddedeeedeeeedeededdeeeddedeedddededdeedeedddeedeeddeddeddeeddeededdedeededdeeeeedeededdddeddeddedeeeedddeeeeeeeeeeeeddeedeeedeedeedededeedddeeddddedededdededeedddeeedddeddddddddededdeeedeedeedddedeedddeeddedeeddeddeeddeeeeeddeeeeeddeeeeedddeededeeeeeeddedddeedeeeedeeeeeeddedeeddedeeddeedddeeeeedededdedddeddeeeedddeeddeeeeedeededdedeeeeeeddededddeeeedddddeddeeeeededddedeedddddededddedeeddeeeddddeddededddeeddeddddedddeedeeddeedddeeeddddedeedddddedddeeeeddeedeeddeddddeedeeddeddeddddedddeeeedddeeddedddedddeddeededeeddeeeeeeeedeedddeeedddedeedeededdedddeeeeddeeddddedeeddeeddededdededddeeeeddeeeeeedeeededdeddedeeeedeeeeeddeddddedeeedeedeeeeddddeeddddedddddeededddeeedeedeedddeeeddeeeddededdeededdeedeeddeeeeeeeeeeddeddddddedddedeeeeeddeedededdedeeddeddddeddddedddeddddeedddeeeeeddedddddeeededededdeeeedddddeeeededdddeeddddedeeedededddedeeddeeeeededeeedeeeddeeeeedeeedeeededeeedddddddddeededeeddeeddeddeddeddddeeeeeeeddedddedddededdedeeeeedddeedeeddddddeddddededddddededdeeddeededddeeeededdedededdddeededddeeddddeeeddeeddeddeddddeededeedeeeddeedeeeeeeeeededddddddeeeeeeddedeeeedededdeddeeeeeedeeedeedeedddeddddddeedeedddddededeeedededdeddeededdedeedeeedeeeeddededdddedeedddeeeeeeeeeeeddedddeeedeeddeddeeddedeededeeedddddddededddedddededeeddddeeeeeddeededeeedeeddedededeedeedddededeeddedddededdeedddeddddddddeddeeddeeeeededeeddeededddedddeeeeedeedeeddeedeeeeededddeedddeeeedeeddedddddeedeeddedededeeededdeedeeedeeeedddededdedddddeedddededddeeeeededdedededdededeeeeededdddddeeedeeeeedddedeededeeeedeedddddddeddeeededeeeddeeeeedddedeedeedddeededdeedeedeeeeedeedddeeeeeeeeeeeeeeedededddedeedddeedeededdeededdededdeeddeedededddeeddddeeededdddeddeeedddeeeeddeddddeeddedeeeddeeddddddddeeddeeedededeedeeeeddedddeedeeedddeedddeddedeeeeededeeeedeeededdeddeddddeedeedeeededdeeeedeeededddeeddededeededeedddeededeeeeddeedeedddeeddededddedddeedeeedeeddeeeeeeedeeddedeeedeeddeededdeedeeeededdedeeeedddddeeeeeededeeeddeddededdeeedddededdddddddedddeddddddedddeeeedeedeedddeeddeedeeeddeeeedddeddddeeddededeedddeeddddeedeeeeddeedddeddddeeeddeedeeeeddededdedddddeeedeeeedededddeeddededeeddedeedeeeeeededdddeeeeedddedeeeddddededdddddededdedeededdeeddddeeeeededdeeeddeeeeddedeedddeddeedeeeeddeddeddddedddeeeddddddeeddeeddeddeddedeeeedeeddeeededddddeeededeeeededeeddededddededdedeeeeeeeddeeddededdeeddeedeedededdeeedeeeeededededddeddeedeeededddeeeedeededddddeededdeddeeeedddedddddeedeeedeeeddeeeddddededdeedddddddedededdddeedeeeeedddeddddedeeeeeddeeddedddeeeedeededdeddddeddeeeeeedddedeeededeeedeeeeedeeddddeededddeedeeededdededddddddeeedddedddeddedeeeedddeddddeeedeeeeddeeeeeeeeedeedeededeeddedeedededdddedededdededdedeedeeeeededddddeeeddddddddededdeddddeeeedededeeddddddeddeedeeedddeedddeeddddeededdedddedeeeddddeededeedeeddeeeeddedddeeddedededdddeeeeedeeeddddddeeeedeedddedeedddeddddedddddddeeeddededdedededdeededdededededdeeddedddededeeeedeeedddeeeeddeddddeddddddedeededeeddeededdedeededeedeeeedeeddeedeeeeeeeeddeddeeeeeeeeeeeeddeeddddddeeddeddddeedddeddeeddddddddedeedeeeeddededdeeeedededddeededddeddeeddeeeeeeedeeedddeedeeeeeddddededdddedddeddeeedeededeedeeddededdeddededeeedeeddedeeededdeddddeeedddedeeededeeeeeedeeddedeeddeeeddddeededdededddeededeededdeeeedeeeeeededeeedddededddedededeedddeeddeeddddddeeeededeeeeeedededdeedeedeeeeededeedeeddedddeeedeedeedddeddeeeedededddddedddeeeedeeeeedddddeddddeddddeeeeedeeeeeeededddeeeddddddedeedddedddeeedededddedeededeeededdedeedddedeeeeeedeedddedeeeeeddeeddeedeededdddedededededddeddeddddddeeeeedeeeeeeeedddeededeeddeedeeeeddeddedddeddeddedddeeedeedddedeeedddededeeeeededdeddedddedddeeeedddeededdeedeeededeeeeeeddedeeddddeeddeeddedeeddeeddddedddeeedeededdddeedeedededeeeededdddddddeddeedeeeddeeddeeddeeeeeddeddeeeddedeedddeedddeeeedededeedeeeedededdedeeedddeeededeedededdddddeddedeeeedddedddddeeddeeeeeeeeedeedddeeedeeddddeddedeeededededeeededeedddeeddeedddddeddeeededdeeeedeeeedeeedededdeedeeeddddeddeddeededdeeeeeeeededddeededeedddeededeedeeddeedddddeedeedeeeedeeddeedeeeedeeddddddedeedeeededdeededddddeeeddedededddedeeeedeeeddeededdededeededdeeddeeddeeeddedeeedddeddedeeeeedddedddeeddedddeedeeeeeddddedeeedddddddedeeeedeeeddddedddededeeeededeeededddddededddddededddeededdeddedeeeedddeeedeeddddeedeedeeddeeeddeedeeeddeeeeddeeddeeddddeeeddddedededeeeddddeeeeededeeeededddddededededeeeeddeeedeeedddeeeeeeddeeddeededdddddddeeeeedddddeddedddeeedeeeeeeddddddeededdeddddeedeedddeeeedeeeddeeedededdeededeeedededddeeeeeeeeedddddeedeedddedeeedededdeeeeddeeeeddeddedddedeeeedeeeeedeeeddedeedeeedeedeeeeeddddeeeedddeddeeeeeddededdedeeddeededeeeddeeeeddedededdeeddddeeeeeddedededdddeeddeedddedeedddeeddeeddeddeedeedeedddeededeeededdedddedddeedddedeeedededddeeededdeedeedeeddeddededeeddeeeddeeeeeddeededeeddddeedeedeedeeeeedddeeedddeddedeeddeedddeddedddedededdeeededeededdeedededddeddddededdddedeeedededdddedeeeedeeedddededdeddeededddedeedeeeedeedeeedddeedeedeeddeddeeeedddeeeeddeeeddeedeeedededdeeedeeedddeedddededdedddddddeededddeededddedeeddeeeeeddeedeededeedddededdedddeddeddededdeddddddeeeeddddeeeeddddedeedddedddeeedeeeedddddedddeddeedddeeeddeedeeeeeeeededededdddddddeeddeedddeeddededeeeeddddeeddedddeddeddeeeedddeedeedddeddedeeededeeeedeedeeeeeddeeddeeeedeededdddeeeeeeeddddeeeedeeddeeeedeeddeedddeeededdeeeeedddeddeeddeededededdddddededdededdededdedeeedeedddeedededddedddeeeddedddeeedeedddeedeeeeeeeedeeeededdeeedddddeeedddedddedeeeddddddeedeededdedededededdeedeeeeededeededdeeddedeeeeedeedededeeeeedeeedeedeeeddedeededeeddeeeeddeeedeedeeeeeddddeededeeeeedeeddeeeeeddeeddeeeedddedddedddeededdeeeeddeeddddddddeddededddeeeddeeeddedddedeeddeededdedddeeddeededeeeeddeeeedeeeeeededdeeeedeededdedddddeeedeeeeddededdeeddededdddeeeeeeeddedddededdddededdedddddedeedddeedddddddeeeddddededddeedeeeeeeeeddeddddeedddeeedddddedeeddeeedddededddeedeedededededededeeeeeedeeeeddeddeeeddddedededeeeeeddeeddeeeeedddeededeeeeeeedddddeeeeedeededdedededdeddddeeddeeddedddedeeddeeddeeeeeedddededddddddeeedeedeeddededdeeeeededeeedededeedddeeedddededdddeeddeeeeddedeeedeeeededddeeeeeeddddedddeededdeedeedddeedddddeededddedddeddeeedeeeddeedededeeeddeeeedeeeddeeddddeedddeeeeeeddddedeeddddedddddddededdeeddddddeedeedeeeeedddededddedddededededededdddeeeddedeeeddeeeeeeddeeeedeeededdeeddddedeedeeddedeededeeeeddeedeeeedddeddeedededeeddddeedddedeededededdddddeedeeddddddeeddddeeedededdddedeeeedeedeeedeeededdeddededeeeeeeddddeeeddeddeddededdddeededddedeeddddeedededdeeededdeeedddedeeededddedededdeedeeddddeedddddddeeeddeedeeeeeededdeedeededdddddedddeddeddddeeeededededddeedddddeeddeeeddeeeeeeddedddeeeddddddddededeededededdeddedeeeddddeeeededeeddeeededdedddededdeeedeeedeeddeddedeeeeedddededddeeeeeeededddeeeeededdeededdedeeeddeeddededeededddeeeeddeedeeeedededeedeeeedeeeeedeeededeeeddededddddeddeeedeededddddddededdeededddeeddeeeededdedddedeedeeededdeeeddddedeeedddeeeeedddeeeddddedddedeeeeeddddeeeeddddedeededededdeddedededeeededddedeededddddddeedededddeedddeddeddeedeeddedeeedddeeedeeeedeededdedededdeeeddddeedddeddeeddddddeedeededeeeeedeeeeddedeeedddddddeededededddedededeeeeeeeeeddddeddeeddddeeeeeeeeedeeedddeddddededeeedeedeedededeededddededeeeedddddeeddedeededdeeeededeedeedddeedddddededeedddeededededeeeeeeeddededeeddeeededdeedeeedeeddedededdddeeededdeeeeedddeeeeeeedeeedddddddeeeeeedeeeeeeedeededdddeedddeeeeeeededededddeedeeedddddeedddeeeeedddeeddeedeeeddeeeededeeddeeddedeedeeeedeeeeededeeedeeddddeeddeedeeeedeedeeeeedeeddedeeeeeddeeedeeededddddeddddddddeddddddddeddeeedeedeeeedeeeedddddeeedeeeeeeedeeedddeeedddddeeeddeeeededeeddddeedeeeddddeededeeedeeeddededddededdedeeeeedeeededdeeedddedededeededeeddededeeeeddededeededdddddeeddeedededdeeddeddeedeeeddededdddedeeeedededddeeddeeeddddedeeeeeeeedeeedeedddededdededeeededededeeddeeeeeddeedddedeedddeeeeeeedddeeedeeeeeedeeddddeddeddddddededdddeeedddedddeddeeeddeeddddeddededddddeeeeeedeedeededdeeddeeddddeeddeededededeededeeeededdeeeddededdededeedededeeddededdedddeedeeddeededeedddeedeeddedeedeeddeddedeeedededddedeeeededdddeddeddedddddedeeeededeeededdededdedddededdeeddeeededeeededdeeeeededeeeeedddeedddddddededddddeeeeeddeeddeeedddeedededddeddeededededdddddeedddeddeddeedddeeddddeedddededdddeddeeeeddddddeeeeededeedeeededeeeddeeededddeedddeeeddddeeeeddddddeeedeeeedeeddddedeedeeddddddeeddddedeeededdeeeeedddddeeeeeddeeddeedeeddeeeddeedeeeddddeeeddeeededdeedddeddeeeeedeededdededeededdddddedeeddeededededddeedddeeeeeeddeededeedeeeeddeeeedeeddddeeeddddedeedeedeedddededdddeeeddeedeeddededdeededeedddeedeededdeddedeeeeeeeedeededdededddddedeeeedededeeeeedeededdeedeeeddddeedededdeeededddddededededdedeedeeddedddeddedddededdedededdeeeeddeedeeddddedeedddddedeeedeeededddeeeeedeeeeeddeededeeedeededeedddeedeeedddeeededdedeeddedededdeeedeedededddededddeddeeeedddddddeeededeedeededeedeeeedededdeedeeddedeedddeeeedeeddddeeedddddddeddedeededededdddddddeedddeddeddddeedeeddeddddeeddeeedddeedeeddeddeddddeeddeeedeeddeddddeddddddeddeddddeedddeeeddeeedddddddeedeedeededdeedeeeeeddedeedddeeddddddeddeddedeedddeeeedddeededdddeeeedeeeeedeedddddeeeedddeeeeedeeedeeddddddeddedeeeeeededddeedeeedeedeeedededeeddddedddeeeededddededeeeeededeeeedeedddeddeeeededdeedeeddeeedeedeeeddedddeddeddeeeeeeeedddedddeddeeeedeeddddededdeeddededdeedddeeeeeddeeddddeeeddeeeddeeeeddddededeededdedeededeededeeddedddeedeeddedeededededeeeddeedeedeeddeeeeeeeddedddddddedededeeddeeddedeeeddddddedeededdeedddddddeeeddedeedeededeedeeeddddeddddddeeeedddedeedeeddeededdeeeeededdddededdedeededeeeeededeeeddeedeededdeddeededeedeeedeeeddeeddddeddedededddedeeeddeddeeeeeeeedeedeedeeeedeeedeeededdddddeddeeedeedddedededeeededdeeeedeededeedeededddeeeddeedededdeeeddddeeeeeeedeeedddeededdeeeeddddeddeeedddedeeeeddddddededddddeddeedeeddddeeeeedddeddddeedeeeeddeeeddedeedddddeeedddeeeeededdeedeeededdeddeedededdeeddddeeedddeeeedededddedeedddededdeeddeeedeededeeededdeeedeeedeedddededeedeeeeeedededdddeededddedeedddeddddedddedeededddeeddeedeedeededededdeeedeeeeededddddedededeeeeddeddeedededeedeedeeddededeedededededdeeededdeedeedeedededeeddeedeedeeeeedeeeedeedeeeeeeeeeeeeeededddedeeddeeedeeeeddddddddededdeeddeeeedeedeededdeedeedddededdededddeddeddddddeeeededdeeddeedddedddddeddeeddededeededeeeeededeedeeedddeeeedddeededdeeeedeeeeededddddeddedddddeddeedeeeeddeeeedeeeeeddddeddedeeeedddddeddeeedddededdeddeededeedddeedddeeddeedeeedeeddeeedeeeddedddeeeeddeddeeeeddeedeededddeedeeeeddedeeddededeeeeeddeedededeeeeddeededdeddeddedddeddddeddddddddedeedeedddddddeedededdeededddeddedeedeedeeeedddeeddddeeeeededdeedddedeeeeeeeeeeeeeeedeedeeddeddddeeeeeeeeeededdeeeeeededeedeedeeddedeeededdddedededddddddeedddeeeedddddededeededdeddeeedddeedeeddddedeedeeeeddeeeeddddddeedeededeedeeedddeeddddddddeddeedddeedeedeededededdedddeeededeedddeeeddeeeededededdeddeeededdddeeeedeeedeeddededdedddedeeedededdeeedeedeededddeeddddedeeeeeeededdeeedeedeeeedeeeeeddeedeeeedddedddddeeeddddeeeddeeeddddddeededddeeeddddededdeeeddededdddeeedddeeedddeddeeddddddeeeedeeddddeedddeeeedeeeeddeedeeededeedeeeeeededdddedededddeedeeeddddedeeedddddeeddddeddedddedeeededdeeddeeeedeeedddeddeddeeeeeeddddddeeeeedeeddeddedddeeddddedeededdedeeeeddddddddeeeddddedededdddedddeedeededeeeededdddedddddeeeddeeedddeeddddeddeddedddedeeededdeeeeeedddedeedeeddddddeeddeeedeeeddeeeeededeeededdeeeeeeedededeeddedddddeddddddddededddeddedeeeddeededdedddededdddddeeddedeeeeeedeeedddeeeeeeeddddeddddededeededeeddeeeeeeddeedeeddedeedddeddeddededeeeeddeddeedeeeededededeedddddeeeddededdeedededddeedddddddeddedeeeeddededdeddedededdddddedededdedeeeeddededeeeddededeeddeddeeededddddeddeddeeedeededdeddeddddeddeddeedddeddeedeedeeeedddeedeeeeeeddedeeededeeeeedeedddedeeddeedddedeeededeeedddeeddedededeeedeeedeeeeeeeeeededededddddededdeeddedddeeededddedeeeedeedeeddeeedededeedeedeededeeddddeedeeededdedeedededdddeeededdededeedeeeeedeeeeeddddedeeededdedeedeedeeedeeeedddddeedddeddedeedddddeeeeedededdeeddeeeeeeddeedddeddededddeeeeeedeedededeededeeedeeddedeedddedededeeedeeeddeedddeeeeeeeddeeeeeeeedddededeedddedeeeeddeddedededdeedeeddededeeeddedeeeddddddeeedeeeeddeedddddedddeddeedddddeeedeeeeddddeedededddeeeddddedddeedeededddeedddddddddeeedededdddeeddedddddeedeeeddeddddeededddeeddeeddeeeddeeededdededeeddeeeedddeeddedeeedeeeeeeddeeededdddedeeeeddeeededeeeedededddeddddeeeeedddedddddeeddeeddeededeeeeddedeeddddededdeddeedededeeeeededeedeeeeddedddeddeddedeeeedeeeddeeeeeeeedddedeeedeeedddeeededdeededdeedeededdedddeedeedededeeeedeeededddddddddeddeedeeeedeeddeddeddedeededdedeeeededeeededdededdedeeeddededdeddedeededeeeeedededeedeededdddeddddeddddddedddeedddeededeedeeddeddddeeddeedeeeeddeeeddddeeeeeeddddededeededdeeddddddddeddeededdddeddeedddedeeededdeededddeedeedeededeeededdeeeededddddeeeddeeddeeeddeeeeedeeeeeedddddeeedddddeeddddededeedeeddddeeeeededeeeededdddddeededddeeeededeedeedeedeeeeeeddeddeddddddddddeddeeeedddeededededeeedeeeeedddddddeededdeeddddedededdeddedeededeeedeeeedeededededddeeddeedeedeeedddddeededdddeddedeeddddeeedddeedeeeeddedddeeeeeedeeeeeddeeddedeeeedeeeddeeeeeddeeeeeedddedeeeddeddeeddeeededdeddddeeeddededdeedededeeddddeeeeedeeededededdedeeeeeddedeedddeedededeeddeededdeeeedeedddeeddedeeedddddeeedddedeeededededdeedeedeeeeededddeddedededdeeedddddeedeededddeedddddedeeddededeeedddeeeedeedeedeededddddedeedeeddeeededeedeeeededdeddeedddeeeddeededededeeeededdddddeddeeeeeeeedeeeddddddeeeedddeededeeeedeeeeeededeeeeddedddeeeeeeddedeeedddededdddeeeedddeddeeedeeedddeedededeededddedddeedededeededdeddedddeeeedddeedeeeededddeedeeedddeedeeddedeededdddddeededdddeeeeeddeddeedededdeedddeeedddededdddeddeedddeeeddeedededeedddddeeeddddddddeddeeeddddeddededeeeeeddddeededeeeddeddeeeedddeeeeddddeddedeeedededdedeeeddeeddddeddedededdddedddeddeddeddddedeeedddedededeeeeeeedddddeeddeeededddedddeddeeddedeeeededdddededdeddeeeddedededeeedddeeddddddeddeedddeddedeeeddedddeeddeeeeededeeedddeeededededeeeddddeddeddeeddddddeeddeddddddedeeddeddeddeeeeddedeededddeedeeddeeededdededeedeededeeeddeeeddedeedededeeeededdeeededdeedeededeeededeedeeddddedeeeeddeeeddeeeddeeeddddddeeddededdeedeededdddddeddddeeeeedeeddeeddedddeeeeeeeeeedeedddddddedeeeeeeedddededddeeeeddddeeeedeeeeeeedddedeeedeeeeddddeddeedddeedddeedeeeeeddedddedddeddeeeddddddddedeedddeeddddddeeeedddeeddddedeedeeeeeedddeddddeedddeeededddddeeddeeedddddeddeedeeddddeeededededddeeeddeeeeddeeeeeeeeddddedeeedeeeddeeddedeeedddeeeeddeeeddddddddeeeeeddeedddededeededdddeeedeeddddddededddeeddeeeeeedddddededddddeeedeeddeeeddeddeeeeddedeeededeeeededeeedddddededeedddddeeddededeeededdeddddeeddeedededddeedeedeeeeeedddededddeedeededddeedeededeeeddeedeeedeedededdeeeedddeeeedddedddeededeedddddedddddeeddddddededddddddedddeddedddeeeeddeeeddddddeedeeedddededdddeeeddedededeeeeeeeeedeeeeeeedddeeeeddeedeeeeeddddeededeeeeedeedeeeededddededededeeedddeedddedeeeedededeedddeedededdeddeeeedeeddddedddedeeeeeeeeedededeeddeddededdddeeeddeddedeeedddddddeeeeddedeeeedddeeeeddedeedededdededddddeeedeedeeddedededeeeddeddeededeeeddddddddeeedeeeedeeeddeddeddeededdddddddeeeddeddddedeeeedddedddeeddddddeedeeeedeeeeeeeeedddeeeddddeddeddeddddedeeeddddedeeeedddedeeededdeddeeededdedddedeededdededddeddeddededeeddddeddeddeddeeeeededdeeeeedeededdeddeedededdeddededeededdddededdeedeededddedddddeeedeeeeedddededeeeededdddeededdeeedeededdddeddededddededddeeedeeeedeeeedeeeededdeedeeddeedddeededdddededeeeedeeedeeeedddeddeeddddddeeedddededeeeedeeeededdeeeeeeeeeddeddedddeeeddddedeeeddedddededdeddeedddddeeeedeeedddeeedeeeedeeeeddddeddedeeeedddeededdddeeedeeeeededededeedeedeeeeeeedededddededeedddeedddeedddedeeeeedeeeddededdedddddeeedeedeededeedeeddeeededeeeeeeeeedededeeeeedeeddeeeeeeddedeedeededeeddeeeddeeeeddedddeeededdddedeeeddeedddedeeeeeeedededdeddeddeeeeeeddeedeedeeddededededeeeededddeeeedddeeeeeeededededddddeeeededdedeededeeddddddeedddeeddedddedeeeeedeeddeddeddeeedddeddeedddeeddededeedddedddedddddeeedededdeeeedeeeeededeeeddeddeededdeedeededeeeeeddedeeddeeeeeeeeddeedeeededededdddddddddedededddeeddeeedeedeeeedeeeddedddeeeddeedeeeeeeedddeeededdddddeddeeedeeeeddddeeeeeededddddddeeeeeedededeeddeeeddeddeeedeeeeddddeeeeededddedeededeeededddeeeeddededdededddddeeeddeedededdedddedddeeeeedeeedeedddeeeeeeedddddedddeededdeedeeeeeeeedeeedeeddeeeeedededeeddededdeeedeeeeeeddeddddedeededeeeeeeeddededdeeeeeeeeeddddeddedeeeedeeddedeeeddededddedddedddddeddedddedeededdeeeeeddeededddeddeddeeedddddddeededeeededeeeeeeedeeddddddeeedeeeeddedddeeeededdeddeeddeeddddeeedeeedddedddedddedeedeededeeedeeedededdeedeeeededdddedeeddededddedeeeeeddeeededddddddeddddddddeedddedeeeeeededdeeeeddedeeeeededeeededdddededdddeeeeddddeeedeeedddeeeededddeedeedddeddddededdedddeddeddeddddedddddeedddeeeedddeddeeddddedededddedeedededeeedeeedeeeeeeeddeededeeeddddeeedddddeeeeeeedeeeedddddeededeedddddeeeddddeeeeddedeedeeeeeedeeeededddedeeedededddeddeedeeddedeeeeedeeededdeedeeeededdeedeededeededeedeedddddeededdeedeeedeeddeeddddedeeeddeedeeeedeeeeddeeeedeeeddeeddddddeddddeededdddededdeddeeddedeeeddedeeddedddeeeeddeddedddedddddeeeeeedddeededdeeddddededeeeeeededdeeeedeededdddededdddedeeededdeeedddededededeeeddededdeedddddddddeddeedeededededdeeeddeeededddddddeeedddddeeeededddedddeeeeeeeeddeddeedddeeedeedddeeddededeeededdeeddddeddedeeeededdeeeeeddededddeeeddeeedddeededddedddddeddeddeeededddeeedeedddeeddeedeeeedddddeeddededddeedddddedeeddddeeedddeddededdeeeeededeedddddedeedddddddeeedeeeeddedeeeededdeededdeddededdeedeedddedddddeddeeeededededdedeeeeedddddddeedeededeedddeededeedddeeddddeeddddddeddedeedeeeeddeedddddeeedddddeeddeedeeeeedddedeedddedeeddeededddeddedddddddddedededddddeeeedeeddddeddeeeeeededdedeeeedededddddeddeeeddeddededdedededdeedddeedeeeeeeeddedeedddedededdeeeeddeeeedeedeededdedddeeddeeeddddeeeeedededdeedeedddeddeeeddeddeeddeedeeeddeeeededdededeedddeedeededeeddddeddddddeeddeededdedddddeddeeddeedeeededdeeeeeedddeeeeeeddededeedeeededdedeeeedddddededdedeeddeddeddeeedeeeeedeeeeddedeeededdeddddddeeeedeeddeededdeeeeeeeededdeededeeedddedeeeddeedeeeeeeeedededeededeedddedeeeddeeedeeeddeeddddedeeeededddddeeeddeddedddedeedeedeeddededededdeedeeeedddeddeeedeeddeededeeeeeddedeedeeeeeeeeeddeddddeeddddeddddeddeedddeeedeeeeddeeededeededdeeeedddeeddeeeddeeddeeedddeddeeeeddddeddeddeedeeddeddeeedeeddddeddeeeddeeedddddddddddeeeddedeeeededdeeeeeddeddeeeeddededddedddddeedddeeeedededededeededeeeddeeddeeddeedededddedddeedededeeeedededdddeeeeedeeddddeeeeeedddedededdeddddddddededdedddeedeeddeeeeeedeededddeeddeedeeeddeddedededdeeeddeddeedededdedeeeeeededeeeedddedddeedededeedeedeedeeeeeedeedeeedeededdeedddeeedededdeeeeeeeededdeeddededededededeededdddedddeedeeddeeeedeededdeddeedeedededdededdddeeddeddddddeedeeeddededeedededeeddeddeeddedeeeededeeeeddeeeddeeeddeedeedddeddeddedeedeedeededddddedeeeeeddddddededeeddeeeeeeddeeedddedeeedeeddddddeddeeedddededeededeeededdedeeeedeeeedeeeeedeedddeddededdddddeededdeddedeedeeedeedddddeedddeeededeeddededeeddedededeeeeeedddeeddddeeddeedededeedddeddeeddddedeedeeddddddddededededddedededdeddedeeedededededdedddeededeeeeedeeedeeeedeeeeeeeddeeeedeeddeddddedeeeeeeedeedeedeeeeddddededddeededddeddddededededdddddddedeeeeeeeeeddeddeeeedddeddedededdedeeeddddddeeeedddddeedddeddedeeeedeeedeeeeddddeddddddddeddeeeddeeeeedeededededdedddedeeedeeddddeeddeeeddedededdeddeeededddeeddedeeededddededeedddedeedddeeeeddeeeedeedddddeeedddedeeeedeededdddedeedeeeeeeddeddddeeedeeeddeddddeeeeddddddddeeeeeeddddeededddeeedddedeedeeeeddededddeedeeedeedddddeeeeedddddeeeededddddeededdeeedededededdddeeeeeedeeeedddededdedeeddddeedeeeddddeddeedddddddddededdedededeeddedddedeededeededdeedddddeedededdddddddeeedeeededdededeeddeddddedeedeeeeeededddedeeeeddeeedeeeddeeedddeddedeedeeeedeeeddedddddeeeedeedeeeddedddeddeddedddddeeededeedeeeddddedeedeeedddeeeeeeeededeeeedeeeedddeeedededeeeeeedeeeeeeededdeedeeddeddedededdedddeeeeedddeeeeedddddeededddeeeedeedeedeeeededeeeeeeeeededeeeddeeeededdeeeddddeeeeedeeeeeeddeddedddeddeddddddeddeeeeddeeddeeedededeeeeeededeeeddddedeeddeeeeddeeedddedddddededdedeededdeddedededdddddddededdedeeeeddddeeeeeddedddedddeddeedddeedddededddeeddddeeeddddedddeeedddddeddddddeedeeedeeededeedeeeeeeededeeedddedeeedeedddeeddedeedddeeededeeeeddedddddededddeedddedddeeeeeeedededddededdddeedddeddeddddeededddeddeeeddddeedddeddededeeddededeedededddeedeeededdeddeeededdddedededeededeeeeeeeddeedeedddeedeeeededededdddeeeedeeeeddddddddddedddeeeddeddeedeededeeeeeddeeeeeedededdddddededddedddeedeededededdedeeedeeedddeedddededeeeeedeeedddededeeeeedeedeeeeeddedddddedeededededeededededededeeeeeeddeddeedeedeeeeeddddedeeeddeeeedeedddddeddeedddededddeeedeeeedddddededeeddeeeedeeddddeeeeeeededddeddddeeddddedeeeedeeededdddedddeddedddeddedeeeeddeeeddeeddedeedeeedeedeeedeeedeededdedeeeedeeeeeeeeeeddededdedddeddeeededeeeededeededeedeeddededddededeeedeeeeededdddedededeeddedeedddeedeeedededdddedeeeedeeededeeddddedeeeddeddedeedeeeddddeedeeedeeddddededededdeeeeeedddededdedddededdededeeededeeeedeededdedddedddedddededededddeeedddddeddeeeeeeededeedededeeddeddededdeeeedddededdeedddeddeddeeeedddededeeeddedddeddddeddddddedddeddddeeddddedddddedddddedddedeeeeddeeddddddeddeedddeededeeddddeeeddedddeeddeededdddeddeddddedeeeeeedeededddeddeeddededeeededdeeeededdddddeeddeededdeedeeeeddeeddeededdeeeddeedddedeededeeeeddedddeeeddedeeedddeddeddddededddedeeededddddedeeeeddeedddeddedddddddeddedddedeeddeedeeededeeeedeeeddddddedeedeeddededdedddeddeddededdeeeeeedeeeddededededdedeedeededddeeededdeedddddeeddddeeddedeeeddededeeeeddedeedeeeeedeedddddeddedeeeeedeeededeeddddeedeeeededdededdeedeeddededeedededededddddedeeeeeeeeeeddeeeedeedeedddddeeededeeddeddeedddddeedededeedededdddeeeededddddeddddededddededdddeededededeeeddedeeeeeeeeddddededdedededdeeededddeedeedddddeedeedddddeddedddeeeddddeeeeeddeeedddeddeddededdeeddeeedededdeeeeddedddeeeddeeeedeeedddeeedededddddddededdddeeeddedeeeddededddeeddddedeedeeededeeedeeddeeedddddeeeeddeddeededdddedeeeddedeeddedddddddeedeedeeeeddeeeeddedeeeeddddeeddeedeeededdddddeedeeeeeeeeddeddeedddeedeeeedeeddddeeedededdeeeddedddeeedeeeedeeedededdeeddeeeedeeededddeeddeeeddeddddeddeddddeddededeeddddddeeedeeeeddddedeededdeeeeddddeeeddeedddedddedeeddedeededdeddddeeeddedddedeeeddeddddddedddededdddeededddeddeddddeddeedddedededeeeeededddddeedeeeddeedeeeededdeeededeeeededdddededdeddeeeeddeddddeeeddddededeeedeeeeddeedeedeeeddedddeeedeedeedededddddeeedeeeeedeedddedeeddedeeeeeddddeddeededddedeeddedddddeeeeddeeeeddeddeedeeddeeddedeeeddedddddeddeedddeedededdddeedeeeddddeeeddeddeeddededededededdeeddddedededdeddeddeeeddedeeeddddedddededdeedeedeeddddddddddeeeeedeeddeeddeedeeeeeeeddeddeedddddeeedeeeeeededdededddeeddddedddeeddeedeeedddeeededeeeeeeddedeeeeddeedeeedddeeeedeeedededdeedeeedddddddeedeedddeeddddddeeeddedededddeddedeeedeeddddddeeeededeeedededddededeeededdeeddeddeddddedeedddeeddddddeddeeeeeeeeeeeeeeddddeeeeedeedddedddedeeeddddeedddeeedddeddeedeeddddeedddededeeeddeedeeeeeededddddeeddeedddeeeededddddedeeddeddeedeeedeeeddeeddeeeddddedddddeeeededeedededeedededddedddeddedddeeddededddededddeedededddeedeedeeeeeeddddeeddddeeeededeeedeeeddedeeededddeeedededddddeeeddddeeedddeddddedddeeddeddededddeeddddddeeddddddddededeedeeddddeedddeddddddeeedeedddeddeddddeeeeeededddedeeeeeeedeeeedededdeeeedeeeeedeeeedddedeeeeeededededededeedeededeedeedeedeeeddedddeeededdeeeedddeeededdedeeeeededddddedededeeeeeeeeeeedededdddededededeeeeddedeeddeedddddddedeedeedddeddeddedddeeddeeddeeeededddedddedeededdeedededeeeddedeeedeeeeeddddedddededeeeeddeeddedeeddeeeeeddddddeeeeededdededdeeddddddddddddddddeeeeeeedddddedeeddeeeeeddeeeededdeddddedeeededeededeedddededeedddedeedeeedeedddedeededdedddedeeeededdedeededdeededdeddddeeededdeeeeedeedddedddeededeeddeeddededdeddedededdeeeeddeddddddddddedeedddedddeeeedeeeeeedddeededeeeddeedeeddeeddeeedededdeeddeeeeeedddeeedeededddddeeeeddeededeeddddddedededeedededeeeeddddddeedddedeeeedddededeeeeddeeeeeeddedeeedeeddeddedddeeeedddedeeedeeeddededdeeeeedddeddeedeeeeddeeeededeedeeedeedddddedeeeeeddddeeddeeededeeeeededdeedeededdedeeeeddedededededdddddeedddeedddeeeeeeedddeedededddddededdedddddeeedeededddeeedddeddeeeededededeeeeededddededdeddedddeeededeeeeededdeeedddededededededddeededeeeddeddeeeeeeedededddedddeeddededdeededdeedeedeeededeeeeededdeeeddddeeeeededddededdedeeeeededdedeeddeeedddedddeddddeddeddeddeeeeeeeeddedeedeededddeddeddeeedddddedeededddddedddddeeedededeeeeedeedeeeeedeeededeeeddddeedeedeeeeeddddeeddeeeeeeddeeddedddeddedededdedddededddedeeddedddeeededdeeeedeeeddeedededddddddeeeeedddeeeeeeeeddddeddeeedeedededeededeededdddddddeeeeededeedeedeeddeeddeeededddddeddedeededdeedeedededededdddddeddeeeddeedededdededeeeddddddddddededeeededeeedeedddeeedeeeedddeedddeddeddeddeeeededddeeedeedeeeeeededeeedddddeddeeddedeeeededdddeddeeeeeeedeeededededdededdeeedddedeededeeeeddeddedeeeddededdeeeddeddeddeeeeddeedeededeeeeeeddeedededeedeededeeeedddedddedeeddedeeeddedddeedddeeeeedeeedddedddeeeededdeedeeedeeeddeeeedeeedddedddedddeeeedddeedeeededededeeeeeeeddddedeeeeeeeeeededdeddeeddedddeedddddeddddddedddededdddedededeeeeddedeeddeddeeedeeeeeedeededeeeeeeeeddeddededeedeededeeeddddeddedeedddeddeeededddddddddeedededdededdddeedeeeeedeeddeedddddedeeeddddeeedeeedeeededeeeeeeedeedeeeedeeedeedededddedeeeeeeedddeedddddeededdddededeedeedddeeedeedeedeeeeeedeedddddddedeeedededddedddeddedeedeeedeedeeeeeeedeeeeeedddeeddeeedeeeddeedeedddddeededdeddeeedeeddeeedddedeeedddeeeeeddedededeeeeddeeedeeddddddeedddeededddeeeedeeddeeddddeedeeeddeddeedeeeeeddeddeeddeddddeeeeededdeeedeedeededdeededddeeededddddeddddeddddededdddedeedddedeeedddededeedddeedededdeeedddeeddddedeeedeedeedddeddeeddeededdeeedddededddddeeddeedddeddeeeeedeedddddeeeddddeddeddddedeeedeedeededdeeddeddddeeeeeedeedeeeedddededddeededeeedddddeeeddedddddeededdeeeeddddddeeeeddeeedddeeeeeddedddddedededdddededededeeddedeeedddeededeededeeeddeeeedeedededddddeddeeeeeddeeeedeeeeeededededddddedddddedeeedddddddeeddedeeeedededdddeeeeededddedeeeeeeedeeeddeededdedddeddedeeedededdeddedeededeeddeddeeddeeedddddeeddeedeeeeeeddeeeedddedddddeedddddeddeddeddddddededeeddededeeddedddddddeeeeddeeddddeeeedddddddddddddeeddeedededdedeededeeddddedddeddeeddddeedddededeedeeeddeedeeddddeeddddedeededdeeddeeedeeeedededdeeedddeddddeeeddeedeedddedeeeddededdeeeeeeddeddeeedeedeeededddedddeedeeddeededddeddddeeddedeeddeeededddedededddeeeeeeddeddddedeeededdedeeeeddddeeddddddeedeeedeedeedeededddeeeeedddedededdedeeeedeeeeeeedddedddeeedeeeeededdedeedededddedededeeedeeeeededdedeeeededeeeddeddeedddedeeeeedddddddddeeeedededddeeedeedeedddededeeddeddddddedddedeeddeeedeeeddeeedeedeeeedeeeeddededeedeeededeeedddedddedddddededdeeededdeeeedededddddeeedeededdeedeedeedddeeeddededdeeedeeeddededddeeddedddeeeeededdeeedeededdeedeeedeeedddddddedddddeedeedeeedeeeeddeeedeeedeeeedeededddedddddeeddeeeeddeddeededeededeeeddeddededddedededdeeeddeededeedeeedededdddeeedededddedeeedeeddeedddededddeeddddedddeeddedeeeddddeedeedeeeedddededddddededeeeedddeddeedddedeeddeddddeddeeeeeeedeeeddddedddeedddeddedeeeeedeeeeeededeededeeedddeedddeeeddddddedddeddededeeeddddedededededeeeeddededdeeedeeeddeedddededdeededdeedeeeedeeeddededddedddeededdeededddedeeeededeeedeeeddddeeeedddeddeeeddeeedeeeedeeddeeddeedddddedeeededeededdddedeedeeedddeddedddededeeddeeddeeeeedeeedededddddddededdedededededdeddeededdedeeeeedeeedeeddddededdeddeddddddededdeddededdeedeeedddddedeededdeeeeeeeeddddeeeeddeeededdedeeedddeededdeedeeedededdeeddeedeeeddddeeededededdeedddedddedddddeeeeeeededeeededeeeeeddeddddededeeedeeeeeeeeedddeeddeddddeedededdeeedeeddeeeddededdeedeeeeddddeeededdededdddddddededddeeeddddddedeedeeeeeeedeedeeeeddeedeededeedddeeeddedddeeedddeddedddeeddedeeeedeeedeededdddeeddddeddededeeedeeededdeeeedddddddddddeeddeedddddedddddddededeededeeedddeddedddddededededddededdededeededeeeedddededeeddedeeeeeddedeeeedeeeeedddddededeeeeeddedeedeeedeeedddedddeededddeddddedeeeeedddeeeeddeeeedddedeeeeeeeddededddeedeeedeedddddeeddeededdddeedddedddeedeedeeddddedeeedddddedeeddeededddedeeeeddedddeddddeddddedddeedeeddddddeeddeededdededdedddeeeedddeddeddeedddddeddededddeddddeeeeeeededdededeeddeddddedeedeeeeeededeeeeeddddeeeeeeeeddeededdeddedeedeeedeeeedeedddddeddeeeddeeeddeeedddededdeedddedddeeeddededdddededdedeedeeeddeeeededeeeeddeeeedddeeeededdeeedeeeededdededdeedeedeeddedededdeddeeeeeeeedeeeeedddededdeddeeeeedeededdededdddeeedeeeeedeeeeeedeeeeeddedeedeedeeeeededeeeeddeddeddddeeddddddddddeeeeedeedddeddddedeedeeedeeeddeedeeeeeddeeeedddeededeedddddedddddeedeeedddededddeedddddeeeedddeeeedddddedddddeddeedddddeeedddeeeddededeeeddeddededdddeeddedeededdededdddedeededeeededdeeeeeeeeeeeddeeddeedddddeddeededdeddedddeeededeededdeeddededeedeeedddedddeedeeedddeedddddeddddeedddedeededddeeeededddeeddddddedededdededdeddddddedeededdeeddeeddddddddeeeeeddddedededeeeeddeeeedddeedddeeddeedeeeedeeeeeddddeeeddddeedddeddddedededeeeddeddeedddedeeeeededeedededededdddddeddeddedddeddeeeeeededdeddeeeededdddeeddeeeededeedeeeeddededeeededdedddeeeddeeddddeeedeeddeddeeeededeeedeeedeedededddeedeeeeedddedddededdddeeeedeedddddeedeedddeeeddedeeddeeededddededeeddeeeeeeedddedeeededdedddedeedeeddddeddeeedeeddeddededededdeddeeddeeeeeeddedddeeedeeddedeeeddedeeeddeeddeddededdeeedeedeeeeeddeddddededdddededededdeeedddeeedeeeeeedeededddeeeeeeedeeeeededdddddddeddeddddeedddeeddeededededeeeeededededdeeeddddddeeeedddeeddedeeedddeddddeeddededdeddddddedeeeeededddeddeedddedddddeeddeededeeeeddededdeddeedddeeddddededddddedededdeedddeedeeedeededeeedeedeeddedeedeeeedeedddddeeeddeddddddeeeddeededededdedededdededdddddedddedddeeeedededddeeedededeeedeeeddedddedeeeddeddeedddeedededddddeeeddedddeeddeddedddedddeddededdeeeeeeeedeeeeedeeeddededeeddedeeeeedeeeedddeeddeddedddeedeedddeedddededdeeeddeeeddddeededeededdededededdddeeddddeddeddddededddededeeedddededeeeeddddddeeddeddededeedeeddddddeedeedeeddeedededededddeedeeeddeeddeeeeddeddedddddeedddeeddeedeeedddddeddeededeedeededddeeededdddedddeededddeeddeedddddededdeedddedeededeeeeeeddddddddededdeddeeedededdddeeededdededeededdeedeedeededeeeddededddddddddeeeedeeeeeddeeeedeedeedddddeeeeedeeddeeededddeddededddeededdeddedeeedddededddeddededddeeeddddeddedeeeddeeedddedeeeeeededdeddddddeddddededeeddeddeeddddededeeeddededdddddeeeedddeeeeeddeeeddeeddedeededdeeddeeededddddeddddeeddededdeededeedddeeeededdddddddeeededdddedddedededdedeeddedeeddedeededdeedededeedddeddedddeeeedddddeedddddedddeeddedeeededdedddeeedeeddeeeddedeeddeeeeeeddddeeddeedeeededddddddedeedeeededddddeedddeedeeeeeeeeddddeedededdeedddedddededeeeedeeeeeededeeddeededeeeeeddeedeedeededddddededddddeddededeedddeeeeeddeededeedddeeededeedededdeeedeeeddeeeeddddedeededdeedddededeeededddedededdeddeeddeeddededdddeeeedddddddededddddeddeededdedeeeedededddeddeeddddeeedeedddeededededeeeedddedeeddedddeeeededdddddeedddededeeedeeedddeedeeedeeddeddeeeededddedeeddddddeeeddeeeedeedeeedeeededdeeeeededdddeededdededededeedddeeeeddeeedddeeddedeedddddeedeeedeeddddedddeddddedeededdedeedeedddddedddeeddddddedededddddedddeedddedddddeeddedddedddedeeeddedddddeddddeeddedeeddeeededdedeeeeddedddeeededeeeeeeeddeddeededddeeededeedddeddeddddddeddddeeddeeddeedeeeeeeeeddedeeedeedeeeeedeededeeeedddededeeeeeededeeeeeededdedddededdedddeeeedededdddedededddeddeddeedeedeedddeeeeeedeeedededddddeedddeeededeeeddeddededededeeededdddededdedeedeeedeeededdeeeeeddededdddeddddddeddeeddddeedddedeeedeeddeddedeeeddeeeeddeeeedeeddeededededddeddededdeddededeedeeededddedddeddeeddeeddedededddddeddeedeeeddddeeedeedeeedddeddddeeeeddeeddddeddeeddddddedeeedddddeeeeeeedeeedddeedeeddeeeeedeeedeeeddeddeeeddedeeedddedddddededdeddeeddddeeededdddeeeedeedededdededdedeedeedddeeeeedeedeeddddeedddedeeddeeedddedddeddedeeeddeeedeeddeedeeeddeededdedddedeeededeeeeddedeeededdeeeeeddeeddedededeedeeddeeededdeeeeeeddededeedddddeeeeeddeeddeeeededdeeeedddddedeeedeeededeedeedddeddddeeedededeeddddeeeedddeeeddddeedeedeedddeddeddeddeeeedeeddeeedddedeedddeeeededdeededdededeeddeeddeeeeddedeededddedddeeddeeddededddededeedddddeeeeedeeeeeddddededddddeddeeededdeedeeeeddddedeedeeedeeedeeeeeedeeedddeedeeeedeededeeeeeededeeddddeeeddeeeeedeedededdddedddeddeeddededddddeedeedededddddedededddeededdedddededeededeeddeeddddddeeddedddeedededddeededdddeddededdddeedddeeededeededdeeeedeededededdeeeeedededdededdeeedeeeddddddeeedeededdedddeeedddededeeedddeeedddddeedddeeeeeeeddddddedddeeeedddddeddeeeeeededeededdededededddeeeedddedeedeeedddededeedddedddeedeeddeddeededdeeeeeddedddeeddedeedddddeeeeeeeddddeeedeeddedeeeeededdeededdeddededeedeeddeedeeeedddddeededeeeddeeeeeeedddeeeeeededddededdedddddeeeddededdeeeeedddddeddeddeddedddedededddeddddeeeedddeeededeeeeeddddeeedededeeddeeededededdededdededededeeeeddeedddeddeedddedeedeededdeddeeededeededddedeeddeedeedeededdeeddededdeeeddeedeedededddeddeddeeddededdedddddedeeeeeeedeedddeeeeedddeedddddeeeddddddeddeeeddddeedddeeedededddeddedddedddededeeeddeeeeddeedeededeeeeedddddeddeeeeeedddeddedddededeedeedeeddedeeddedeeededddddeeedeededdddeddeeeedededddddeeeeedeeededeeeeedddeedddeddedddedeededeededdddddddededddeddedeeededeeeedeeededddedeededeeedededdeeddeededdddedddeeedeeddeedeeeeeedeeeedddddddddddeeeddeddddeeedeeeddededeeeeddeeddeedddeeeededddddddddddededdeedeeedeeeedddeddeedeedeedeeddeeddeeeddedeeeeedeeedeeedddeddeddeeedeeeedeeedeeeeededdedededeeeeddeeeddeddeddeeeeddeeddeeeeeeededddeeeddedeedeeeddeeeeddeeddedeeeddedeeeddddddeedddeeeeeeededdddedededeeeddeeedeeddeeddeeeeededdeeeddeddeeeedddddeedeeedddddeddeeededddddeeeeeeeedeedeedeeddddddededeeeddddeddedeeededeeddeededededeeeddeddedddeededddeeeeeeeeeeeeeedeeeeeddeddeeedeededeeeddeddddeededddedeeddeeeeeeddededeedededeeeedeeeeddedeeededeedeedddddeedeedddddeeeddeedeeddddeeeeededeeedeeeddeedeeeddededeeeedddeddddeeddddeeeddeddeeeedeedeedededddeddeeddedeeeeeeddddddddeeedeededddedededdedeeeededeedeeedeeedeeedeedddeddddeddeeedeeeeeeddeeedededdededeeeeeedeeedddedddeddddedeeddedededdeddeddeededddeddddeddedeedddeededdeeededeeddeddeeeddeddeedeedeeddeeddedeededdedeedddddeddedeeeedeedeededdddeeeddddddddddddeeddedddeddeddedededdeeeddeeeedededeedededdeeedddeeedeeeeeeeededeedddeddeddeeededdeeeddeededdeedeeddeedddddeedddddeedddddeeeddededdddddeedeeeddeddddeddddddeededdeededdeeddeeedddddededeedeeedeeddddeeeddeedddddeddedeededdddddeededeeeddddeeeeedeedddddedeeededdeeeeededeeededdeedddeeeedeededeeeddeedeeeedeeeddeddeeddeeedddeeeededdeeeeedeeeddddeeddeddeedeeeeddeddeedeedeeeedeeeddddeeeddeedeeedeeedeeddededdeeddddddddeddeeedddeeededdeddedeedeeeddddeeddeeeededdeeddeededeededeeeddddeeddddddedddedeedeededdddedddddeedeeeededddeddeddddeeeeddeeeedeeeeeddedeeedddeddeddeeedddeedddeededeeddedeeddeddeeddddddddddeedeeeeeedeeededddddeeddededeededdeedeeeedeeeedeeedeeeeddeeedddddeedeeeeedddedededeeddddeeeeeddddedeeeeddeeeededddededeeededdeedddddededddedddeedddddedddedddededddeeeeeeeeeddededdeeddeedeedeedeeeedddddddeedeeedeeededeededddddeeeddeddeeeeeedeeeededeeeeededeeddeeddedeeeddddedeedededeeeeddedeeeddeeeedddeeddeedeedeeeeddededdedddeeddedddddddddedeeeeeeeddddddeededdddededeedeeddddddedddeddeddeeedeeeeeeddeddeeeeedededddededeedeeddedeededdedddeddddeededeeeededdeeedddddddddddeedeeedddeddeedeeddeededdededddeeeeeeededeeedeeedededdeeeedddddeeddededddeddeededededdeddeeedededdeedeeededeeddeeedeeeeeeeedeeddeedddddededdeeddedeeedeeedddddeddeddeeddedddddedeeeddeeeddddeddeedeeeeeddeddeededededddedeeddedddeddddeeededeedeeeeeddeeededeeedddddedeedededeedededddddedeeeeeedddedddddeeededdededdddeddeeeeeeedeedddededddeedddddeeededdeddeeeddedeeddeddedddddeddeeedddddddddddddddededeeededdeeeddeddedeeddedeededeeddeeddededeeeddeeeedddedeeeedeedddeeeddddeedeeeeddeededddeeddeeeeeeeeddeedddedededdeddddeedeeeddedddeeeddeeedeededddddededdddedddedeedeedeeeeddeddedddedeeddddedddedeeeddeedededdededdeeeddededdddeeddeddeeeddeededeeedeeeddedddeddeedddddddeddeededddeddeeddedeeddeddddedeededdddeeeeeddddddededddeedeededeedddeeededeeeeeeeedeeedeeeeeedeeeddddeddeddeeeddeeddedddeeddddeeedeeeeddeedededdeeeddeeeeddeddddeeddeeedeeeedddeeddeddddeededeedeeeeedddeddddededeeeddeedededdeededdeddddddedeeeedddddeeededddeeeededeeeeeededeededdedeeddeeeedddddedeedddeeddddeededdeeedeeddeddddeedeedeeeedeeedddeeeeeeddeeddeedeedeededdddeddeedddedeeeeedddededdddededdeededeeededeededddddddeeddeededeeddeeddeddededeedddedddddedededeeedeeddedddedeeeddddeddedeeeeeddedeedeeddddeeedeeeeeddedddedddeedddeeeededeeddeeeeeeedededeeeeddedddddeeedeeeededddddeeddeedeeeddddeddedeedeeeedeeddddddeeededddededddedddddeddeeeeddedeeeddedddedeededeeeeeeedddeeedeeedeededdddeeedeeeedddeddddeedddddddddeddeddededdeededdededeeeedededeededeededdedddddedeeeeedddeeeeeeeededeedeeeeddddedededdeeeeeedeeddedddeeeddeeeddeeeeddedeedeeededddeeeeddededdeddeeddddeedeeeddeedededeeeedddddedddeeeeeeddddeddeeededdeeedeeeedeeeeeeedddeededeedededeeddedeededededeeddeedeeedededdddedddeeeddddeedeeeedeeeeeededdededdeeddedeededdededdeddddeddeeddeddddddddeedeeddddddddddddeeddeeeeeeddeedeeeeddeeedeeddeeeeeeeededdeddddeededeeddddededeeeddedeeedeeddeedddddddedddeeeddedddddeeeededeeeedeeedeedddeddededdeddeededeedeedededddeddeededddedeedeeeedddeeededddededdddddeddeededdeedddeeeeddedeededeeeddededdedeeddddeddddddededddeeededeeededededdeeeddeeddeeeeeeddddededdddddededeeddeddedddddededdeddeedeeedddeddeddeeedeeddddededeeeeedeeeddddedddddeeeeedeeeedeeeedddddedddddddedeeedddeeeeeededdeeedeeedddededeeededdededddedeededdeeededdddddeddeeededddddeeddeeddeddedeeeedededededeeedeedeeeeeedddddeddddddddeeeddededdeeddeddddeedeedeeedeedeedeeedddeddeeededddeeedededddddedeedeedeeedeeeddddeeeddedeeddedddededdddddeededdeeeeddeeddeededdeeddeeeedeeedddeddedeeeeddeddedededdddedeeeeeeeedeeddedddeeddeeddeedddddeedeedddeededdeeeddeeeddddedededdeddddededeededddeeedddededdededeeeeeedeededdddeeedeeeeeddeedddddddddeddeeedddeddeeeedeededddededededddededdeeeddeeddeeeeedeedddedeeddddeddddedddededeeddedddeeeedeedeeddedeeddddddddedeeeddededdeeeddededdeddeeddeeeeeddeddeddddeddeeddeddddeddeeeeeededdedddedeeddedeeeeedddeedededeeededdddedddeeddedeedededdedeeddeeddeedddeededddeeedeededddddeeedeeeddeedeeeddedddddeeeededddeeeeeeededdddedddeeeedeeedededdddededddedeeeeededeeeeededeeeddedeedeededdddeeedddeddeeeeddeddeddeedddeeddedddeeddddeeddeeddeeeedddeeeededededddeeeedddddededdddedeeeeedededededdddeedddedddeeeddddddeeddeeddedeeeeeeeedddddeeeeedeedeeedddeddddddeeeeeeddedeedeeeeddeddeeeddddedddeedddededeeddededddededeeedddddddddeeeeeddeddeeededddededeeddddeeddddeedeedeeededdddedddddedddeededdedddeddedddddeeeeddddeeedeedddddeededeededdeeddededddeeddddeedededeeddeeeedddddeedededeeeeddeeddeeededdeeeddeeddeedeeddeddeddeeeddededddedeedeeedeeeddeeededddededeeedddedeeddeddeddeedeedededdeedddeedddddeeddededdeeeeddeddeddedddddeeedddeeedeededdeeddeeedeedeeedededeedddededdedeeddededeeedeeeededeeeededddededeeeededdddedddeeededeedeeddedeeededdeddddeddedddeeeddeddeddeedeeddddeeeddddeedddeeddedddededeedddedddeeeddeeededeedeeeeeeeddedeeeddedeeededdeedddddeeddeddededdeeededeedeeedeedeededeedeeeeeeddddeeeeddddeeeededdeeedeeedddeddddeeeeedeeedeeddeeedddeeddeddddddddedededeeeeeeeeddeeddeeeddeedededdddeeeeddeedeeedeedeeddddeeeddeddeeedeededddededdddeddedddddeeddeeddddeddedeeeedddddddeeeeddddeddeeddddeddeeddeeedddedeedddddeeedeeddeeddedededeeeeeededeededeededeededddeddeeeddededeeedeeedddeedeeedddeddeeeddeddddddddeddddedeedddeeeeedddeeedeeededddeeeeeeddeddedeedededededeeddedddddededdedeeddeededddddeddedededddddedddeddedddeededdededdeeddddeedddeddedddddeeeeddededddddeddeedddddeeddeeddddeeedeeedeeeddedeeddddeeddeeeeeeeedeededeeedddeedddeedeeededdeeddedeedeeeddeeddededdddeeddddeddddddedeeddddeddedeedeeeeedddeddddeededeeddeededeeeedddddddeedeeededeeeededeedeeeeededdeeeddeeeeeeedddeeeededeeeddeddddddddeedeeeeddeeedddeeeeededdeedddeeededeeeddeddedededededededdddddeddddeedeedddeeeededededddddeeddeedddddeeeddededddddddeeeeedddddeddedeedededeedeeeeddeeddeedeeededdeeddeeddddddeeededeeeeeeedddeddeddeededeedddddededddedededdeeedddeeededeeeeddeeddddeededddeddddedeeeddddddeeeedeeeddedeeddeddeeeddeeeeeddedeeedeeedeedddedddeeddedededddeeddddedddeeddeeeeddeeeddddddeeeededdeeeedeeeeeeededeeddeeeeeeddeddedddddeeededeeedeeededededededeeeedddeededddeeddddddeeddddedddedeeddeeeededdeddeededdededdddeeddeddddeeedeeddedededdeeeeddeeededdedededeeeeeeddeddeeeeeeddeeeedddededeeeededdddeddedddedddedeedeedededdddddeeeedddeedeedeededeeeeddedeeededdeeeeddededeedddedeedddeeededddedeeedededeeddeddeeeeddeeeeeeedddeeddeddddddedeeddeddedeeeeeedeeedeedeeeeddddedededeeeddeeeeeddeedddeeddddddeedeeedddeeeeeeeedededdedededeedeededddeeeeddddededdeedddedeedeeededeedddedddeddeedeededddddeeededeeedddddddedeeedddddedeeddedeededddeeddeedededdedeeeddddeeddeddddedededdeddddedddddedddededddeededeeeeedeedddeddedeeeeeeededeeddedeeeddeeddddedeedeeededdedddedeedddeeeededddeeedddddeeedddeeeedeeededddddeeeeddddeeeededdedededeedeededededddedeeededdedeeeeeeeddededeeeddeeedeedeeddeddeededddeeedddeddddeddedeedededeedddeeeeddeeedeeddeeeeeeddeddededddddeddddeededddeeeeeeeddedededeeededededddddddddeeeedeeddeeeedddddddddedddeeedeeeedededddeddeddedededdedeeedededdddeeeeeddeededdedeeddddededdeddeeeddeeeeedededdeeeddededededddddddeedededdeedddedeeddedddeddeedededeeeedddedeedddddeeedddddddedddeeeeeeeddddddedddddddeddedeeeeddeeedddddddedededeeeddedddeeeeeddeeedddddeeeddeeddedddeeddddededdeeddeededdeddddedddddededddeddeeeeddeeddeddddeddedddddeddeededddddeedddedddedeeeeedeeeeeeeedeeeeeeeedeedddeddeddddeddddeeeeedddedddddddedddeeedddeeeeedddeeddddededdeeeeddedddeeeeddededddedddeededeeededeededddddedddedeedddeeededededdededdeedededdddeedededdedeeeeeeddeeddededeeddeedeeddedddeededeeeededdddededeeeddeedddeeeededdddddddedddeddeeededeedededddededededdeedddddeeddeeededdeeedddddddeeedddeddddddeddeeeedeedeeeeeededeeeedddeeedeeedeedddeeddeeeedeededeeeeeddddddeddeddedeeddeeddeeeeddeeddededededdededdddedeedddeededeedededdedededdeededeedeeeddeddeeddededdeeeddeddeededdeddeedeededddededeeededdddedeeeedeedeedeeeeededdddededddedeededeedeeededeeddeedddededddedeedddddededddddeeeddeeeeeeededeeeeedddddeeddeedddeeeddededeeedeeddedededeeeeeeddeeedeedeeddeeeddeeeeddeeededeeeedeeddddeeeeeedddddededdedddededddeedddedeeeddeeedddeeeeddddeeeeeedddeddddeddeeeededdeddeeeeeeddeeeededddedeedddddeeeeedddddeeddeeddeddeedddeeddedddeeeedddeedddedeeddeeedeedddddeddedeedededdedeeeeeededdeeddedededeeeddeeeddddddeeddededdeddddeeddddeddeeeedddeeeededdeddeddeeededeeeedddeeddeddeededeeddededdeeeddeddedeedeededdddddddeddedeededeeeeededdddedededddddeddedeeddedddeeeeddededeedddedeeeeededededeededdeddeedeeedeedeeededeedededeeddddeeddeddeeeededdeeeeededddedddedeeedddddedddddeeddededddeddededdeeeddedddeeedddedeededdeedededeedddeddededeeededeeedeeddddeeeeeeedddededdeddededdeddddededeeddeddeededdeeeddddeddeeeedddeeeeeeedeededdedededeeeeeeeeddeeedeedeeeeddeddeedeeeeddeedddeeeddeddeedeedeeeeddeedddeddeedeeeedeeeeeedeedeeeeddeeedddeedddeeeeeeeddeddeddedeeddedddddeededdeeeddeeeeeedeedeededdeeeddddeeeddedeeeeddddedddddeddeeeeeddddeeedddddedddeddeeeeeedeededdddddedeeeddedddeddedddedededdeeeedeeeddddedeeedededddddededdddeddeeedeeddddedeeddeddeedddeddedddeedeeedeedeeddddddddeeedeeedeeddddeddeeeededeeddeededeeddeeedddddeeddeeeedddeedddeeddddeeeedededdedeededdededdededdeedeeeddeddeededdededededddeeddeddeddeedddddddeedeeeeeeededededdeeddeededddeeeeeededdedeeddeeeeeeedddeededdeddededdedddeeeedeeeeeeddddeeededdeddeeddedeedddddedeeeededeededdededddddededddeeddeddedeedeeddededdedddedddeeddeeeedeedededeeededddeedeeddddddddeddeddeddddedddedddedeeeeeedeedddeddeeededededddedeeddddeddededdeddedeeedddeeddededeedddeeeedddddddedddeeeddedeeddddeeeedeedddeeededdddeeeeeededeeeeedeeddeddeeeedddddeeedeeeeddeddddeedddeededdeeeeedddeeedddddedeeddedddedeedeeddededeeddeeeedddeeeddddededeeededdeeededeeddeedddeddededddedeedddedddeddeeedededdeddddddededeeeeddedeeededdeeedeeeedeeededdedeeeddeeddeddeddedededeedddedddddedeeeeededededdddeedeeddedededdeddeddeedededdededededeedddedeeddeddeddedededdeeddeddedddddeddddeddeddddddddddddddedeeededdeedddeddddeeeeeeeededeeddeeddddeddeddedeeddeddeeededeededeeedeedeeeeeeddddedeeddeeddeeedeeeeedeeddeedededdededddddededdedddeeeddddeeeddedeeddddedddddedeeeeedeedeeeeedeeddeddddeeddddedddddeeeedeededdddeeeeedeedddeeededeedeeddededdeeeddeeeddeeddedddeddeedddedddeedeeeddddeedeeddddeeddeddedeeeddeddddeededdeedededddddeeddedededdddeeddedeedeedeedeeedeeeedeeeeeeeededdeddeeeeeeeddededeeddedeeedeededdeddeddddeeeddeeeedddddedeeddeeededddddddddddddddeddeddeedeeeeddddddddddedeeddddddededdeddeddeededddedeeeedededeeeeeeeddeeeddddeeeeedededdedeedeedddeeeddeddeeeededdeddddeeddddeeeeeeddeddededdedddeeeddeeeeeeeedeeddeeeddeddeddedededeedeeedddededdeeedddeeddddedededeedeedddedeeeeddddedddeddeededeedeeededddededeedddeddeddedeeeddeeeededddddddedeedddeddeddddedddddeeddeddddeeedeeeeedddeeeedddeedddeeeeeeddedeeedddeeeededeedddeededeeeedddeeedddeeedeeddeeeeeeddddeddeeeeddeeeddddeddddeeddedddededdeddddddedeeeedededeeeddedddeeeededddeeeeeddeeeedeedeeededddedeeddeeddddedddeeedeedeeddddddeeeeeedddddeddeedeedeeeddeeeededdedeededdddeeeeeeeedddeeeedededeeeedeeeddeddededdddedeeeedeeeeedddeedddeeeddeeeedeedeedeeededddedeeddddddeeededdeddeeeeeeddeedddedddeedddddededddedeedddddddedededdeedeeeeedeeeeeeeededeeedeededddeeddedeedeeededeeeeeeddeededdddddedddeeedddddddeeeedeeeedededdededdeeddddddeeddeddeededdeeedeedeedededdddeedeeddeddddededededdeeeeedddeededeeddededeeeddeeeeeeedeededdddeededeedeedededeeeeeedededeededdddeedededddeedededdeedeedddedeeeeedeedeedddeddedeedeedeeeedeedeeddeeedeeddeddeddddeeeddeddddddeededddededddddeddeeededdeeddeeededddededddeeeddeededededddedddeddddddddddedededeeeeededeeddeedeeedddedeeededdddeddeddeedddedededdeddeddededdeeeeddedddedeededdededeeeedddedeedededdedddddedddddeeeededddedeededdeddedddeddddeeeeeddeeedeededdeeeeedddddededeeddeeddddddeeddeeedeededeeeddddddeddedededdededddeddeededdeeededededddedddeeddeeedddddddeeddddddddeeedededdeeededdddeedeedededeeddeddeedededddeededddeeeeeedddeddddeeddeeeeedeeedeeddeeeeedddeddddeeeeddededeeedddeeeedeeeddeddedeeeddeeeeeeeeedddededeeeeddeedeeeeeddedddeedeeeeddedeeeddeeddeedddeedddedeedededdeeddddeeeddeededddeddddddeedddedeeeededdddeedddededdddededeeedeeeedddddeeedeeeeeddeeddeeddededdddeededdeeeededeedeeddedededddddededdeddddeedeeedeedeededdddedddeeddddddddeeededddedddeeedddedeeddedeeddeddedeedeeeddeddedededdddedddedeeeeeeeeedeeddeddddeddeedeedeededdedeededdddededddedeededeededddeededeedeededdededddddedededdeddedeeeedeeeedeeeeeedeeeddeeeddededdeddeedeeeeddeeddeddddeedddeeeeddddddeeeedededdedeeddeeeeeeeedeeddedeeeedeeddeeededddedeeddedeeeddeddeddededddedeeddddedeeeeedddeeddeedddeedddddeddddddeeeeedddeeeeeddeeeedededdeddeeeedddddededdddedeeeeeeddedeeeddddededdeddeddeddddddeedeedeeeeeeeeeedeeddddeeeddededededddedddddeeeeeeeddedeeddeeeedededeedeededdededddeddddeddedededeeeddeeddeddedddeeeeeddedeeeedeededdeeeedddeeeddeddddeedeeeddddddedddddeeddeededdddedddeedddddeeddddddeeededddeedeeddeedddedeedeeeedddeededeeddedededdeeeedddddedddedededeededddddeededdeeeddedededdeeddedeeddddeddeeeddeededddeeeeedddeeededddedededeeddeddedddddedeeedeedededeedddeeeeeddeddedeeeddeeeeededdeedededddeeeddddeddeddeddedeeeeededdeddeedddededdeddddedeedeeddeeedddeeddededededdddedeeeeeedeeddddddddedddeeeeeeddddeeeddededdddeddddddededdddeedeeeddddddeededddeeededeeeeddddeeedeedddedddeeeddedededdedeeedeeeddedededdedeedeedeeeddddeeeddeddddedeeeddedddeeeddeddeededdedeeeeeeddedeeeedddddeedeeddededeeddeeedddeeededeeeedeeddeeedddeeddedededdeeeeedddeeeeeeeedeedddeeeedeedededddddeeeeddededddeedeeddddeeeddddeeeedeededddededeededddeeddeeeedeedededeeeedeeedeedeedeeeededddeeededededddddddeeeeeddeedddedeeedeeedeeddeededdddedeeeededeedeedddeededededddeeeddeeeeeedeeddeeedeededddeedeeeddeedddddededddeeedddededededddeeeedeedeeddeeeeeeddeedeeeeeededdeedeedeeddddeededdedeeeddeddeedddedeedededdeddededddeedddeededdedededdddedeedddedeeddeddededddededdeddeeeededdddeedddeedddeedddeeeeeeddeededeeddeddedeeeeeedeeeedddddeddeeddeedeeeddddddddddeddeeeeeeededddddddeeededeeeddddeeeeddddedddddddeeededddeddddeeeedeeddeeeddeeeddedddddeedeeedeeedeedddeeeeeeeededdeeeddeeeeeeddddeeeddeeeededdeddddddeeedeeeeddeeedddedeeeeeddeedddeeeeedeeddeddeeeedddedededeeedddeeddddeeddddddddeeeededddedddeeddeededddeeeddddeedddeeeeeeeedddddeeddeeedededdedeeeedddeddeeeeeededeeeddeeddddddeeeeededeeeeedddeddeedddeedeeddddeededddededdddededddeeeeedededdeeeeeddeedededddedeedeeeeddeeddededeeeddeddeddddddeeededeeeddeddedeeeddeddededddeeddedddeddededeeddddeeeddddeeedeeeddededdeeeeedeeeeeddeeeeeededeeeeeeedeeedeedeeeddddeedddeeeeeeddedddeeededeeeedddeededededddddddddedddddddeeeddddeeddedddddeeeeddededddddeddeddddedeeedededededddeeeddeeededdddedededdeeeddededeedeeddddeddeeeedeeededddddddddedededdeedeededeeeedddeedeededddeeeeeeeddddeededdddeeeddddeededdededeededeeeeedddeddeddeededededddeedeeddededddeeeeeeeedddeddddedddeedeedeeddedeeeeeeeedddeedeeeededdddeeedeeeddeeeeeeddeddddedddddddddeeedddeeeedeedeedeeeededddeeeededdddeeededddedeedeedddedeedeeededdedeededeeedeedeedededdeeeedeedeedeedddddedeedddddeddedeedeeddededeedeedededdedeeeededeeddeddedeeedeeeeedddedddddeeedededdddedeeeeddedeedddeddedeeeedeededeeededeeedddeddddeddddeddddedeeddeddeeddeeeddedeeeedededdddedddeddddeeedeeddeeeeeedddeeedededdddeddddedeedddddddddeedeedeeedddeeeededddeedeeededeedeeddeeeeeddddedddeeedddeddddeddddeeeedeededdddeeeddedeeeedddedddddededededdeddedddddddededeeedededdeeeddeeeddeeededddddedddeededeedeeeeedddeddeddededdeddeedddededddddddddedededddddeddeeddddddeededdeddededdeedddeeddddeedeeedddedeeeededddeeddeeededddddddededeedeedeeddddddeeddeddeddeedededededdddedeeeddddeeedddddddedededeeeeeddddedeededdededdeeeeeeddeeeddeedeeededddddeddeedeedeedddeeedeeddeeeddeedededdeeedeeedeeeeedddededeeddddedddddededddeedeeddedeeddeddededddddeededdeeddddddddeeddedddedededeeeeeeeeeedededeeeddeedddeddeddddedddeedeeedddeeddedddddddeeedddedeeeeeedeedddeddddeeeeddddddedeeeeeeeddddddedededdeedddeedeedddeddddeeeedddddedeeededdededddedeeeddddeededeededeeeeedddeeddededeedeeedeeedddddedddeddeeedddddddeeeeedeeeddedeeddeddddddddedddeddeedddddedededdeededeedddeddddddeedeeeededdededddddddeededeedddddddddeeeedeededdddeddeededddeededeeedeeedeeeeedeedeeededdedeedddddeeddedeeedeedeedddeeeeeeeddededddededddddddeddeeeeeedddeddddeedeeeddddedeedeeddeeddeeeedddedddeeedeeedeeededdeddededddedddededeeddeddddedeeeededdeededeeededddddeedddedeeeeeeedeeeeeeeeddeeededdddddedeeddddeededddddededddedeeeededeeeeddddeeeedddedddeeeddddedeeeddeddeeedeeeededeedeeedeedeedeeeedeeeeeddeeeddddeeedeeddeeeedededeeededdedededddedddedddddddeeddededddeeeedddeeeeedddddddeddddeeeeeddededdeeeeedddeeeeddddeededdeddddddeddddedeeededddededeeedeeddeddeededddddedddedeeddeddddedeeddeddededdededdeddeeeeeddedeeddedddeddeeddeeeededddeeddeddddeddddeeddddedddeeddeeeeeedeeeeddedeeeededeedeeddeededddeededdeedeeeddddeedeedeeedeeeeeddddddeeeddedeeddeeeedededdddddedeeddddeddedeeeededeeeededddedeedddeeedededededddeededeeddeeeeeeeeedeeddeddedededeedddeedddedeeeeeeedddeeeeeddddedeeedeeeddddddddeedeeddeeedddeddeeeddeedededddedeeddeeeedeededdddedeedddddeededeeedddeedddeeeddedeeedeeeeedeedeedddedeeedddeddeeeddeeddeddddeeeeeddeededeeeddeeeeededdeeeedddeeedeededeedddddededdeeeeededdeeeeeeedddeddddeededdddedeeddedeedeededeeddeddeeedeeeeedeeddddedededeededddddeeeeeeeddeddededdeeeddededdeeeddeeeeddeeeeeedeededdeddddeeddeeeeedddeeeeeddeeddedddddeeededdeeededdeeddedeeedeedeeeeeeeeedededeeeeeddddeddeeeedeeddddddedeededdddededeeeeedeedddeedeededeedededeeddeeeddedddddddeededdeeedededeeddddeeddddeddeddedeedeeeddeedddeeeedddddededeeddeddeeedeedddeedeeddeeddedddeeddddedeedededdeeeddeddededdeeeedeeeeeeddeeddedeedeeeeedeeddeeddedddedeeddddddeeeddddddeedededdedddedeededdddeeeeededeededdeedeedeedddedddddeddddeededddedeedeeeeeeddddeddeeddedeeddddddddedeeddededddeeededddeeddeddddddddedededdededdeeededddeedddedddeeddeeeededdddedeeeeedddeedeedeeededdeddeddeededededeeddeddddeeedeedddeddeeddededddddeededdedddddddddeedeeeeddeeeedeeeedeeddeeedddeddddeedddededdedeeddddeeeddeedddeeddeedddeeedeeddddeeeedeedeeddeddeedeedddeddeeeedeedddeedddeeeeeeeeeeedddeededdddedeedddddeedeeddddeededeeedeeeeeddeeeddddedededededdededddeeddeeddeeddededeeedeeeddedededdddededeeeedddddeddeeeeddddddeeedededeedeeeeeeeededeedeeeddeddeeddddddeddedeeeddeeddedddeedeedededeedddeedeeddededeededdddddededdddeeedeeeddedededdeddeddeddddddeddedddeddedeeddeeedddededeeddddddddedeeddeedededededededdedeeeedeeeddeddeeddddeddedeedeeddeddededeededeeeeddeedeeeeeeddedddeedededdedededdeedeeddeededdddededdddeedddeedddeeddeddeeedeedeededdeddeddedeeeeededddddeeeeeedededdeeddddddeedddeeededddeddeeeeeedeedddeeedededdededddedeededdddeddddedddddeddeeedeededeeeeeeddedeedeededdedddeddeeeeeddeeedddededdeedededdeededededdddddeeeddeeeeddeeddedededdeeedeeddeeeededdeddeeeeeeeededededeeedededeedeededddededededeedeeeddededddddedddeddddedddddddeeddddeddeedeeeededddddddeddeddeddddeeeededeeeddedeeedeeeededededeeeeeeeededddddddddeedeeddddeeedeedededeededddeeeeeeddddeeeeeddeeedeededdddedddeddddeeeedeeeeeeeedeedddeedddddeddedededeedeeededddeddeeeeddeedddeedededeedeedddedeeeddeededddedeeedededdeeededdeeeddddeeddddeddeeeeedddeeededdddeddedeeeededdeddddddeedeeeedddedddeedeeeeddddeeeeeeeeddddddeeeeddedeeedddeeededdeddddeededeeeddedddeddeeeeedddddeeeeeddddedeeeeeddedeedddededededeeeeddddddeddddeeededeededdeeeeddedddeeeedeeddeeeeeeeeededeededededdeedeeededdededdedeeddeeeeeddededeeeeeeeedddedddedeedededdeedeeeededdeddddddedeeededdddeedddedddeedddeeedeededdeddddedddeedeeeeeddddeddedddeedeeedeedeedeeeeedddededdedddeeeededdedddeeeddddddddededdddeddddeeedddedededdddddedddddddedeeddeddeedeedededeedeeedddddeeedddddeeeeeddedeeeddddeddeddeddddededddddddddededddeeddddedeedddeeeedddddeddddddeedeedeeedeedeeeeeedeeddddeeddeedddedededdddddededddeeeededdeeddddeedddeeedeeeeededeededdedeedeedededeeeeeeeededeededdddeeeedddddeedeeedeeedeeddeeeddeeededeeeddeeeedddeeeedeeedddeeeeedeeeeeeddedddedddededdedddddddededddeeededddeddeeeddeededdeeedddededdddeedeeeeededeeeddeeedeeedddddddededeeededeeeeddeeedeedeeeeddedeeedeedddeeeeddeeedeedededdeedededdededeeeddedddedeedeedddedeeeededededdededddddddeeddeddeeeddeddddedededeeeeddddeddddeeeeeeeeeedeeedddeedeeddeddededddddeeddddddededeeeeeededeeedeeeddeddedededeededddedddeeeddeeedededddddedddeeedededddddeddedddddeedeeeeededdededededdededededededdddddeedeeddeddedddddeeeededddeeddddeddeeeeedeeddeeededeeedddeddddeeeeedededdeeddddeddeeeedddddddedeeedeeeeddeeeededdddedddedeeeedeeedeedeeedeededdddeedddeeddeededdedddeddedddedddeddedeededdddeddddddddddeededeedeeedeedddededdddededdededdeddeededeeedededddedddddedeeeededededdeededdeeeddedddededeeeededdddedddededdeeeededddeedeededdedddeeeeddedddeddeeeededededeeddddddeeededeedeeededeedededddededdddeddedeedeeedeeedeeededededeeedddeeeeedeedddddddededdedededdeedeededeeddddeeededeeddeeedeedeeddddeeedededddeedeeedeeeedeeeeeedeeedeeeeddeeeedeeeeedeeeeedeeededdddeeddeeeeeedeeddeeeddededdeeeedddeedeeeddeeddedeeeedeedeeeededdddddeddedeeedeeddeedededddedeeddddedeeeeeeddeeddedeeddeddddeeddeeddedeedddeeddeeededdededdddeedeeedddeededddeeedeedeeeededeeededddedeeeeededdddeeddeeedeedeeeeeeedeedeeededdeeddedddededdddedddeeeeeededdeddeededeedeeedeedeededeeddddddedddeededededeededdeddedeeedddedeeddeeeeeddeeeeddeededddeedededdddeededdedddddeddeeeeedeededddddedddededdeeeeddeddddedeededeeddeddeedededdededededeeeeededdddddddddeeddddeddeddeeeeedddededdeedeeddeeeeeddedededdededeeeeddddedeeeeedeeeededeeededeeeeddededededddeededdddddddeeeededeedededeedddedeeeddeddeeeeeddeddeeeeedeedeeedddeeeedddddeedddeeedeedeededeeddeedddededeeddddeedeeedddeeddddedddeeedddededeeeeeeededeeeedddeededddeededeeeddeeeededdedddededddeddeedddeeeeeddddeedeeddedeeeededddeededdeedeeeeeeeddeddeddddeeddddeededdddeeeeddeeddedddedeeeeeeddeddddddddeedeeddeeeddeddddeddeeeedddededeedddeedeeedddeddddedddededeeddeeddddedddedeeeddeedddeedeeeedeedeeeedeedededdeeeeeedddeddddeeeededdedeeddddeeeedddeeddeeedeeededdeededdedeedeeeedddeedeeededddeedeeeeeedeeededeeeeddedeeedeedeeeedeeddeeededededddddedeeeeeddedddeeddeddddedeedddededdddedeeeededeedeeddddeedeeeedddeeeedededddeddddeeddeddedddeedeeedddeddeddededeeeeedddedddddeddeeededdeededddddeeeedeeddedeeededdeedeeeeeddddeeddddeedeeddeddeeddeededddeedeeeeedeeddeeeddededeeeeddedddeeeedddeedeeddeededededededeeddeeeedededeedeedeedddeededddeeeedeeededeeddeddeddeeeeeeeeeedddddeddeeddeeddedddddddeedeeddeeeeedddeddddddedeededeeeddeeeedeeeddeeddedddeeedddededdddddeededdddeeddedddeeeddddedddededeeddedddeeeeeeeddeddeeeddeeeeeedddeedededeeedeededddeddeeeeeeddddededddededeeedededddedeeddeedeedeeeededdeeeddeeeeeedeeddddddddddddddeeeedddddeddeeedeeededddeeeeddeeedddeeedeeddeddeeeeddeeedededddeeddeddddddedeeeeeddeeddeeeddddedeeeeededdeedeeddedddedddeeddeedddeeeedeeeeeddddededdedededdededeeedeeedeedeeeddeededeeededeeeddededeeeddeddeddddddeeeeddeeeeddddededddedddeededddedeeedddededeeeeedddeeeedddeeedeeeedeeeddeedeededeeeddeeeeeeddeeeeeeeedededdeddeeeeddeeedeeeeeedddeddeeedeedeeeeddddddedeeededddddddeddddededeeddddedddddeddddeeededdddddededededededdeddededdeddeddedddeedeeedddedeeddddeeedddedeededddddedeeeeededededddddddddddededeeeedededededdddeededdeeddeeeeeeededdeddeeedeedeedeeeddeeddeeddddedeeedeeededdedeeddedededddeededddedddddeeeedeeedededdddeeddeededdeedddddeeeeeedddddedeededeeddeeeeeeeeeeeeeeeedddddddeeeeededdeedddddeeddddedeedeeeededddededdededdeeedededdeeededdedddeddeeededdedeedeeededdddedeededdedeeddedeedeeeedddedeedddddeddeeedeeeddededdeeddeededeedeedededeeddddeedeeeeeeeeeededdeeedeeeddddeddddddeeeddededddeeddeddeeddeedddededeeddeeddddddeeedddeddedeeeeeddddeeddededdeeeeeededededdedededdddeeeeeeddeeededdddeeedededdddeeddddddeededddeddeedeedeeeddddeeededddedddeededeedddddeeedeeddeddddeeddddededdedddeddeeeeededddddeeeeddeedddededddddedeeddeddedeededdddeedededededeeeeeeddeeeddeeedddddddeeeddededeeeeededeedeeeeedddeddedeeedddeeedeeddddededededddddedeeededeedeedeeedddededddddedeedddeeededededededeeeddededddeedeedddddddededeeedeeeddeededeeddedeeddeddedddededddddedeedddeeeedddddedeeededeededddddedeededdeedddeeedeeedeeeedeedeedeeddddddddeededdeddedeeedeedeedddeeeeededdedeeeeedeeeeedddedededddddeddedddddedddededddeeeeddeddedddddeeeeddeeddddddeeddeedeeedeedededeedeeededeeededdeedeeedddedeeddddedddeeddededeeeeeeedddddeeeddddddddeeeedeedddeddedededdededdedeeeeeeeedddddededdeddeddeeddeedddedeeeeedeededdedeeddeddededededeeeeeedeedddeeddededeedededddeeeeeeeeeedededddededddeddeeedddeddddeeeddeeedeedeedeeddddedeeedddeddeddddddededddeeeeedeeddeededdddedeeeedeedddddddedddedededeededeedddeeededdededdddeedeededddeededeedddeedeedeeddddeeddeddededdddddeeddedededdeddededdddeeedeeededdeededddeedeeeddeeedddddedddeeedeeeddddedeeddedddedddeeddddedddeeedeeedeeeddddeeeddedddededededddddddeeeededdddddddddedeedeeddeedeeeddeeeeedeeeeeedeeededeeeededededdddeededdeedeedddeddddddeddededdddddddeedeedededdeddededddeeeedeededdeeedeedddedeeeeeeeeeddededeededeeeeddedddddeddeeddeeeeededddeeeedddedddedddededddddddeddeddddedddeddededeeededddddddeeeddeeeeeddedeeeedededdeddeeedddeddeddeddddddeddeeeeeeededddededeeedeeedeededdedddeddedddddddeddddddeeeddeedddedddeeddeddeeeeeddedeedeedddeddeedddeeededddeeedddddeededededdddeedddeddeeeeeeddeeeddedeeeddddeddeeddeeeeddedddeedeeddedddddeedeeddeedeeeedddddedeedddeddeddedeeddedeeedddedeeeeedeeeedeeeededeeeededdeeededddeeedededdeeeddededeedddeeeddeeeededddeddeddeeedeeddeeddedeedddeeededeeeeeddeeddeeedeedddddeddeeeeedddeeeedeedeeeededddeddeddedeeddeedeeeeddddddeddeddddeeededeeeddededddeeeeedddeedeeeeeddedeeddddeeeeeeddddeedddeeedddddeedeeeeedededeeeedededededdeededddeeeddededdededddeeddddeddededeeeeedeedddddeeddddeddddddedededeeeeedeeeeededddeeeeeeeddeededdddededeeeedddddedeeededddddddedddeeddedeedeeedeededddededeedeededdededdeedeeddeedddeeeeeddeeddeddddddeeddddeeedeeeeeddeeeeedeedeedeeeeeedededdeedededdeedeeeeeeeddddeeddeeeeddddeeeeeeeeeeeeeddeeddededeededdededdeeeedeeedeeddeeeeddeeedededdedddeeddeddeeeeddeeeededdedeeddeedddeddddededeedddeeedeeeedddeeddeddeeededddeededeeddddddeedeedddeddedddedeeedeeeddeddeeddedeeedeeeeddeededdeedddedeeedededeeeddddddeedeeeededddedeededdddeeeeddeeeeeeddedddeddeddeddedeeedddddeeedededeededdddedddddddeeedeeedddedddddedeededdededeeededededddedddddedeededdddededddeedeeddeeededddddeeeeeeeeeddddededeeedddeddeddeeedededdeedeeeeeedeeededdeedddedddeedddeddeddddeddddeedededdedddededddeeedeeedeeeeededeedddedeeddddededeeeeedddeddedeeddeddeddeeedddeededeedddedddeededeeeddeedeeedddddedeedddeddedeeddedddedddeeeeeeedeeeeeddeddedddeddddeedddedddeddddeddedeeedeeeeeddeeddddeedeeddededdededddeedeededeeedededeedddeeddededdedddededeeeedddededeeededddeddeeddeeededeeeddeeeedeeeddeededddeeeeddeddeddddeeededeeeeedededdddeeedeeddeeededdeedeeeedeedddddddedddeeeedeeeddeeedeededddddeddddddededdededddeeeddeeedddeeeeeedeeedeedededddeeeededededededdddeededeedddedddeeddeeededeeddedeeddeddddedddeededeeedeeeddedeeddedeeededdddededddedddeeeeddddeeedeedddeedddeddddeddeeddeeddeeeeededddededdedeeeededdedddeeedeedeeedededdeeddeedddddedddededeeeeeeededeedededededeedeeddedeededddddedddeddeeeededeedeedeeeeeededeedeededeeddedddeeeeededdedeeddddddddeeeeddddeedddedeededddeeeddedeeddedddededeeddeeddedddeeeedddedededeeddeeedeeedeeeeedddddddededddededddddeedeeeedededddedddddddddeeeddeedeeeeddededeedddeddeedddeededeeddeddddeeeedddedeededeeeeeeeededeeedddeeeeeededdedddddddeddeddddeeddeddededdeeedddeedeeedddeeedeedeeeddeededdddedddeddedeeeeddeeeedeedededddedddedeeddddeeeeeeeeeeeddeeddeeeeedeeeeeeedededdededddeeedeedeeeeededededeeededeedededdededdddeeedededdeededddddeededdddedddddeeeeedededddddeededdedddedddeeedeeeddedeeedeeeededddddeeeddddeeddddeeededddddddeededeeeddedddeddeeeeeddeeddedeeeeddeeedeeeddeddeddeeeededddeeeeededdeeddedeeededdddeedeeedeeeedeeeedeeeddeddeeeeeeddeeddedeededeedeeeddddeeedeedeeddeeeeedeededeeedeeeedddddddedeedededdeedeeeededdeddddddededddddeeeeddddddddeeddedeedeededdedddeddddeddeeeeedeedddeedddeedddeeededeeddeeedeeedddeededeeeededeededdedddeeddddededdddeeddddeeeddddedeedddeddddedeededeeddeddeddeedededeedeeddddddddedddddeeededeedeedddddeddedeededeeeedddedddddeddddddedddddeededdeddedddddededdddeedeedeeeeddeeeeeeeeeedddddeddeeedeeeededdedddedddeeddedddddeeddddeeeddededdeeeeedeeeeeddedddeeededeeeddeeeeeddddeeeddddeeeeedeeeeedeeddeeeeedddeeedddeedededddeedeededeeeeddeededdedeededeeeededdededddedeedddddddddddeeddeeddeeeeedeeddedeedeedeeedddededdedeeddeedededdedddeeedeeeddedddeeeddeeeeedeeeeddeeededdedeeeddddedeeeddeeeeeedededeededeedeeeeeededdedeeddeeddeeeeeeeedddddeeeededededdddeeddddeeeddeeeddeeddeddddedddddeeeedddeeeeddeeedeeeededededddeedeeddeeededddddededdededededeeeeeedeedeedeeedeeddddddedeedeeddddedeeeeddeeddddededdeddddeedededddedeedeeedddeeddeeeedddeddeedeeddddededddedddeddededeeeddedddddeeedeeededeeeeddddeddeeeeeddeddeeedddeededdeedddedeeedededdeedddddddeeededddedeedeeededdeddeeeedeedddeddeedeededededeedeeddeeddddddeedeeedddeddeededddeededddeeddeedeededeedddeddedddddeedeeeededeeeededededeedddeeedddeddddddeddedeeedddddddedddddedeeeeeeeedeedeeeeddeeeddeeddededededddddedededeedddeeeeeeddddeeeddeededddeeedeeeeddeededeedeeeeeededddddedeeedeeddeeedeeeeeddeeddededdddeededeedeeddeeeddeeeededeeeeedededeeddeeeddedddeddededddeddeddeededdeddddeddeeeeedddeedeeeeeedddeeddedededeedededeededeeeeeedeeedeeeddddededeeedddedededddedddeedeeededddeedeeddeeeddededeeeeedddeedeeeddeedeedeeedeeedeededeeddddddddedddddedddeedededdeededddddeddddeeeddeedeedeeeddeddeeeddeeededeedddeedddeeeeddededdedeededededeeeeddeeeedeedeeeededeeedededddeeedededdddeeeeeeddeedeedededdeddeeeeeeddeddeddeeddededededeeeddedddeeddeeddddeedeedeeeeeddeeeddeeddedddeeeeedeeddededdeddedeeedddedeeeedeeeddedeeeddeeddeeeeededeeddeeededdededdddddeeeeeeeededeedeedddededeeeedddedeedededdedeeddeddeddededddeededeeeeeeeeeddddedddddeeddddeddeddeeeeedddddeddeedddedeeedeededeeeddedeedeededddeeededeeedeededeeedddeeeedeededddeedddeeededdddddedeedeeeeeedeeeedededdeedeeddeeeedededddeededeeeeeeddddeeedddddeedddeeddeededdedeeddeedddedeeeeedeeeeddeededeeddededdeeeddddedeeeeeeeedddedeeeedeeedededeededdeededdeededdedeeddedededdeeedeedeeeddddeeeeeddeeeeedeeeddeededddedeedeeedddeddeedddeededdeeddddddeeeeddeeddedddedeeeeeeededdedddedeeeeeddeeeddeddddddddeeeeddededeeddeeedeeedededdddeddddddededdeeddededddddeeddeddeddedeeeeededeeeeedeedededdeeedddddeeddededdeeedddededdededeedddedddeeddddeeeededdedeeddeeedededddedeeedededeedeeddeeddeededeeeeddddeeeeeeededeeeeedeeddedeededdddededeeedeeddeeeedddeddeeeddededededdddeeededdeedeeeddddedeeeeeeddeeedededddedddeeeddedddeddeedeeddddedeeededdeeeeeedddeeddddeddedddedddedeedddddedeeeeddedeedededededdeeeddddeedddeeeddeededdeeeeeddedddeddeeeedeeedeeeededdedeededdeddeeeeedeeeddeeeeeedededeeeeedeeeddeeedeeeeeddeedeeedeeededddeedeeeeedeeeeddeededdeedddedeededdddeedeeedddededddddddeedeeddedeeedddededdeeedeedeeeeeedeeeeddeeddeeddeddddddddeededddeddedddddeddededdddeeedededdddddededdddddedeedeeededeedeeeddddededeeeedededeeedeedeeddeddeddeeeddddddedddededeeeeeddeeedddededddeedeedededededddedeeeededeededdedddedddedeedddddeededeeeedeeeeeedeeddeeeeddeeededddeddeedeededddeeddddeeddddeddeeddedededeeedeededeedeedededdedddedeeedeeedeeddeeddeedededeeeeedeeddedddeeeedddeddedddeeedeeeeddddeeddeeeedeeddeeeeeededddeeeeedddddddedddeeeddeddeedddddedddedddeedeedddeededddeeedeeeeededeedeeddeeeedddedeeeeddddeddededeededeededdeddeeedddddeddeddeeeeddeeededdeedddeeedeeedeededddeedddeddeeddedddeeddedeedeeededddededdddeededddedeedddddeeddeededededdeddeedddedeeddddddeedededdeeeeedddddeeddeeddddedeeddddeeeeededddedddededdeddeeedeeeedddedededdeeeeddddeeedddeeeeddeddeddeeedeedeedeeddddeddeedddeeededdeeeddddedeeddedeedededdeeddeeddddeededdedeeedeeeddeeddeededeeedededdeeeeedddddedddddeeeededeeeeedeedddedeeddeddddeeeededdedddedddeddddddedddeeeddeddddeddededdddddededdeeeedddeedddddeddededeeeedeeedeeddeededeeeeeddeddededeeeeedededeeeddedeedeeedededdededdeeddeeeeeeddeedeeeddededeeeddedeeeedeededeeeeddeeedddededdedeeddddeddedededeedddddededeededeedddedddeeeeeedddeddedeedeeedddeeedededddeeedddeeeeeddeeedddddddeeeeeedeeeddddeeeeedeeddddddededdedeededededeeeddddeeededdedddeeedededdeeedeeeddeddeedeeddedeedddddeedeeeddeededdeeeeedddddddeeeedddeddeededddddedeeddedeedeedededdeddeeddeddddeeeeeddededddeedddddddeeeddddddedeeededeedeeeeedddeededeedddddeeeeedeedeedeedeeedededeeedeeeeddddeeedddededddddeeeedddedededdeedddedededeededeedededededdddeeddeeedeeddeeededdeddedeedeedddededdedeeededdeeddeddeddedeeddeededeedddeeddeddededeeedeedeeddeededeedeeeeededddddddeddeeedddddeeeddeeeeedddeeeeeedeedddeeeeddeeedddededeeedeedeeedeeedededddeeddddeeddeddededddddeeeeedeeddddddeeedeedeeedededdeddeddeededdeededddedeeeeedddeddedeeeedeeddddededeeeeedddddedddededddddeeeddeeedeedeeededdededdedeeeeeeeededeeedeededddededdddedddedeeededdededddededeeddeeddedeeeedeeedddeddeeddeddddddeddddeeeeeeeeeeedddeedeeeedddedddeedededdddeeddeeddeeeddddedeeeeeeeeeeededeeddedddeddddeeedeeddeddeddeddeeddeedddeededddddedddedddeeedeedeedddeddddedddedddddedeededededdddeedddeedeedeeddddeeddeedddddddedeeedddeededdedddeeddddeeddeededddeededddeeeeeeddeeedddddddedeeeededededddeedddeddeeddeedddddedeedddeedeeddddeeeeeddedddeeeeedeedddedeeeeeddddddddeddeddeddeeeeeedededddeeeedeededddededdeeddededededddeedeedeeeddedeeeddddddddddddddedddddeedeedddeddededddeedeeeeddedeeededdeeddddddeedededdedededdddeddddeededddededdeddeeeeeddeddeeeeedddeeddeddeeeedddddededddedddeeddedddeedededdddeeedeeeeddeeeedddeedeeddddeddeddededeeedeeddeededdddddeeeeeeeedddeddedeeedededeededdddededdedddedddedddeddeeedeeeedeedddeddddddeedddededeedededdddddedddeeedeeedeeeededdeedededeedeedeeddedeeedeeeedeededdeeeddedeedddededdeedeedddeedeeddeddeddeeddeededdedeededdeeeeedeededdddeddeddedeeeedddeeeeeeeeeeeeddeedeeedeedeedededeedddeeddddedededdededeedddeeedddeddddddddededdeeedeedeedddedeedddeeddedeeddeddeeddeeeeeddeeeeeddeeeeedddeededeeeeeeddedddeedeeeedeeeeeeddedeeddedeeddeedddeeeeedededdedddeddeeeedddeeddeeeeedeededdedeeeeeeddededddeeeedddddeddeeeeededddedeedddddededddedeeddeeeddddeddededddeeddeddddedddeedeeddeedddeeeddddedeedddddedddeeeeddeedeeddeddddeedeeddeddeddddedddeeeedddeeddedddedddeddeededeeddeeeeeeeedeedddeeedddedeedeededdedddeeeeddeeddddedeeddeeddededdededddeeeeddeeeeeedeeededdeddedeeeedeeeeeddeddddedeeedeedeeeeddddeeddddedddddeededddeeedeedeedddeeeddeeeddededdeededdeedeeddeeeeeeeeeeddeddddddedddedeeeeeddeedededdedeeddeddddeddddedddeddddeedddeeeeeddedddddeeededededdeeeedddddeeeededdddeeddddedeeedededddedeeddeeeeededeeedeeeddeeeeedeeedeeededeeedddddddddeededeeddeeddeddeddeddddeeeeeeeddedddedddededdedeeeeedddeedeeddddddeddddededddddededdeeddeededddeeeededdedededdddeededddeeddddeeeddeeddeddeddddeededeedeeeddeedeeeeeeeeededddddddeeeeeeddedeeeedededdeddeeeeeedeeedeedeedddeddddddeedeedddddededeeedededdeddeededdedeedeeedeeeeddededdddedeedddeeeeeeeeeeeddedddeeedeeddeddeeddedeededeeedddddddededddedddededeeddddeeeeeddeededeeedeeddedededeedeedddededeeddedddededdeedddeddddddddeddeeddeeeeededeeddeededddedddeeeeedeedeeddeedeeeeededddeedddeeeedeeddedddddeedeeddedededeeededdeedeeedeeeedddededdedddddeedddededddeeeeededdedededdededeeeeededdddddeeedeeeeedddedeededeeeedeedddddddeddeeededeeeddeeeeedddedeedeedddeededdeedeedeeeeedeedddeeeeeeeeeeeeeeedededddedeedddeedeededdeededdededdeeddeedededddeeddddeeededdddeddeeedddeeeeddeddddeeddedeeeddeeddddddddeeddeeedededeedeeeeddedddeedeeedddeedddeddedeeeeededeeeedeeededdeddeddddeedeedeeededdeeeedeeededddeeddededeededeedddeededeeeeddeedeedddeeddededddedddeedeeedeeddeeeeeeedeeddedeeedeeddeededdeedeeeededdedeeeedddddeeeeeededeeeddeddededdeeedddededdddddddedddeddddddedddeeeedeedeedddeeddeedeeeddeeeedddeddddeeddededeedddeeddddeedeeeeddeedddeddddeeeddeedeeeeddededdedddddeeedeeeedededddeeddededeeddedeedeeeeeededdddeeeeedddedeeeddddededdddddededdedeededdeeddddeeeeededdeeeddeeeeddedeedddeddeedeeeeddeddeddddedddeeeddddddeeddeeddeddeddedeeeedeeddeeededddddeeededeeeededeeddededddededdedeeeeeeeddeeddededdeeddeedeedededdeeedeeeeededededddeddeedeeededddeeeedeededddddeededdeddeeeedddedddddeedeeedeeeddeeeddddededdeedddddddedededdddeedeeeeedddeddddedeeeeeddeeddedddeeeedeededdeddddeddeeeeeedddedeeededeeedeeeeedeeddddeededddeedeeededdededddddddeeedddedddeddedeeeedddeddddeeedeeeeddeeeeeeeeedeedeededeeddedeedededdddedededdededdedeedeeeeededddddeeeddddddddededdeddddeeeedededeeddddddeddeedeeedddeedddeeddddeededdedddedeeeddddeededeedeeddeeeeddedddeeddedededdddeeeeedeeeddddddeeeedeedddedeedddeddddedddddddeeeddededdedededdeededdededededdeeddedddededeeeedeeedddeeeeddeddddeddddddedeededeeddeededdedeededeedeeeedeeddeedeeeeeeeeddeddeeeeeeeeeeeeddeeddddddeeddeddddeedddeddeeddddddddedeedeeeeddededdeeeedededddeededddeddeeddeeeeeeedeeedddeedeeeeeddddededdddedddeddeeedeededeedeeddededdeddededeeedeeddedeeededdeddddeeedddedeeededeeeeeedeeddedeeddeeeddddeededdededddeededeededdeeeedeeeeeededeeedddededddedededeedddeeddeeddddddeeeededeeeeeedededdeedeedeeeeededeedeeddedddeeedeedeedddeddeeeedededddddedddeeeedeeeeedddddeddddeddddeeeeedeeeeeeededddeeeddddddedeedddedddeeedededddedeededeeededdedeedddedeeeeeedeedddedeeeeeddeeddeedeededdddedededededddeddeddddddeeeeedeeeeeeeedddeededeeddeedeeeeddeddedddeddeddedddeeedeedddedeeedddededeeeeededdeddedddedddeeeedddeededdeedeeededeeeeeeddedeeddddeeddeeddedeeddeeddddedddeeedeededdddeedeedededeeeededdddddddeddeedeeeddeeddeeddeeeeeddeddeeeddedeedddeedddeeeedededeedeeeedededdedeeedddeeededeedededdddddeddedeeeedddedddddeeddeeeeeeeeedeedddeeedeeddddeddedeeededededeeededeedddeeddeedddddeddeeededdeeeedeeeedeeedededdeedeeeddddeddeddeededdeeeeeeeededddeededeedddeededeedeeddeedddddeedeedeeeedeeddeedeeeedeeddddddedeedeeededdeededddddeeeddedededddedeeeedeeeddeededdededeededdeeddeeddeeeddedeeedddeddedeeeeedddedddeeddedddeedeeeeeddddedeeedddddddedeeeedeeeddddedddededeeeededeeededddddededddddededddeededdeddedeeeedddeeedeeddddeedeedeeddeeeddeedeeeddeeeeddeeddeeddddeeeddddedededeeeddddeeeeededeeeededddddededededeeeeddeeedeeedddeeeeeeddeeddeededdddddddeeeeedddddeddedddeeedeeeeeeddddddeededdeddddeedeedddeeeedeeeddeeedededdeededeeedededddeeeeeeeeedddddeedeedddedeeedededdeeeeddeeeeddeddedddedeeeedeeeeedeeeddedeedeeedeedeeeeeddddeeeedddeddeeeeeddededdedeeddeededeeeddeeeeddedededdeeddddeeeeeddedededdddeeddeedddedeedddeeddeeddeddeedeedeedddeededeeededdedddedddeedddedeeedededddeeededdeedeedeeddeddededeeddeeeddeeeeeddeededeeddddeedeedeedeeeeedddeeedddeddedeeddeedddeddedddedededdeeededeededdeedededddeddddededdddedeeedededdddedeeeedeeedddededdeddeededddedeedeeeedeedeeedddeedeedeeddeddeeeedddeeeeddeeeddeedeeedededdeeedeeedddeedddededdedddddddeededddeededddedeeddeeeeeddeedeededeedddededdedddeddeddededdeddddddeeeeddddeeeeddddedeedddedddeeedeeeedddddedddeddeedddeeeddeedeeeeeeeededededdddddddeeddeedddeeddededeeeeddddeeddedddeddeddeeeedddeedeedddeddedeeededeeeedeedeeeeeddeeddeeeedeededdddeeeeeeeddddeeeedeeddeeeedeeddeedddeeededdeeeeedddeddeeddeededededdddddededdededdededdedeeedeedddeedededddedddeeeddedddeeedeedddeedeeeeeeeedeeeededdeeedddddeeedddedddedeeeddddddeedeededdedededededdeedeeeeededeededdeeddedeeeeedeedededeeeeedeeedeedeeeddedeededeeddeeeeddeeedeedeeeeeddddeededeeeeedeeddeeeeeddeeddeeeedddedddedddeededdeeeeddeeddddddddeddededddeeeddeeeddedddedeeddeededdedddeeddeededeeeeddeeeedeeeeeededdeeeedeededdedddddeeedeeeeddededdeeddededdddeeeeeeeddedddededdddededdedddddedeedddeedddddddeeeddddededddeedeeeeeeeeddeddddeedddeeedddddedeeddeeedddededddeedeedededededededeeeeeedeeeeddeddeeeddddedededeeeeeddeeddeeeeedddeededeeeeeeedddddeeeeedeededdedededdeddddeeddeeddedddedeeddeeddeeeeeedddededddddddeeedeedeeddededdeeeeededeeedededeedddeeedddededdddeeddeeeeddedeeedeeeededddeeeeeeddddedddeededdeedeedddeedddddeededddedddeddeeedeeeddeedededeeeddeeeedeeeddeeddddeedddeeeeeeddddedeeddddedddddddededdeeddddddeedeedeeeeedddededddedddededededededdddeeeddedeeeddeeeeeeddeeeedeeededdeeddddedeedeeddedeededeeeeddeedeeeedddeddeedededeeddddeedddedeededededdddddeedeeddddddeeddddeeedededdddedeeeedeedeeedeeededdeddededeeeeeeddddeeeddeddeddededdddeededddedeeddddeedededdeeededdeeedddedeeededddedededdeedeeddddeedddddddeeeddeedeeeeeededdeedeededdddddedddeddeddddeeeededededddeedddddeeddeeeddeeeeeeddedddeeeddddddddededeededededdeddedeeeddddeeeededeeddeeededdedddededdeeedeeedeeddeddedeeeeedddededddeeeeeeededddeeeeededdeededdedeeeddeeddededeededddeeeeddeedeeeedededeedeeeedeeeeedeeededeeeddededddddeddeeedeededddddddededdeededddeeddeeeededdedddedeedeeededdeeeddddedeeedddeeeeedddeeeddddedddedeeeeeddddeeeeddddedeededededdeddedededeeededddedeededddddddeedededddeedddeddeddeedeeddedeeedddeeedeeeedeededdedededdeeeddddeedddeddeeddddddeedeededeeeeedeeeeddedeeedddddddeededededddedededeeeeeeeeeddddeddeeddddeeeeeeeeedeeedddeddddededeeedeedeedededeededddededeeeedddddeeddedeededdeeeededeedeedddeedddddededeedddeededededeeeeeeeddededeeddeeededdeedeeedeeddedededdddeeededdeeeeedddeeeeeeedeeedddddddeeeeeedeeeeeeedeededdddeedddeeeeeeededededddeedeeedddddeedddeeeeedddeeddeedeeeddeeeededeeddeeddedeedeeeedeeeeededeeedeeddddeeddeedeeeedeedeeeeedeeddedeeeeeddeeedeeededddddeddddddddeddddddddeddeeedeedeeeedeeeedddddeeedeeeeeeedeeedddeeedddddeeeddeeeededeeddddeedeeeddddeededeeedeeeddededddededdedeeeeedeeededdeeedddedededeededeeddededeeeeddededeededdddddeeddeedededdeeddeddeedeeeddededdddedeeeedededddeeddeeeddddedeeeeeeeedeeedeedddededdededeeededededeeddeeeeeddeedddedeedddeeeeeeedddeeedeeeeeedeeddddeddeddddddededdddeeedddedddeddeeeddeeddddeddededddddeeeeeedeedeededdeeddeeddddeeddeededededeededeeeededdeeeddededdededeedededeeddededdedddeedeeddeededeedddeedeeddedeedeeddeddedeeedededddedeeeededdddeddeddedddddedeeeededeeededdededdedddededdeeddeeededeeededdeeeeededeeeeedddeedddddddededddddeeeeeddeeddeeedddeedededddeddeededededdddddeedddeddeddeedddeeddddeedddededdddeddeeeeddddddeeeeededeedeeededeeeddeeededddeedddeeeddddeeeeddddddeeedeeeedeeddddedeedeeddddddeeddddedeeededdeeeeedddddeeeeeddeeddeedeeddeeeddeedeeeddddeeeddeeededdeedddeddeeeeedeededdededeededdddddedeeddeededededddeedddeeeeeeddeededeedeeeeddeeeedeeddddeeeddddedeedeedeedddededdddeeeddeedeeddededdeededeedddeedeededdeddedeeeeeeeedeededdededddddedeeeedededeeeeedeededdeedeeeddddeedededdeeededddddededededdedeedeeddedddeddedddededdedededdeeeeddeedeeddddedeedddddedeeedeeededddeeeeedeeeeeddeededeeedeededeedddeedeeedddeeededdedeeddedededdeeedeedededddededddeddeeeedddddddeeededeedeededeedeeeedededdeedeeddedeedddeeeedeeddddeeedddddddeddedeededededdddddddeedddeddeddddeedeeddeddddeeddeeedddeedeeddeddeddddeeddeeedeeddeddddeddddddeddeddddeedddeeeddeeedddddddeedeedeededdeedeeeeeddedeedddeeddddddeddeddedeedddeeeedddeededdddeeeedeeeeedeedddddeeeedddeeeeedeeedeeddddddeddedeeeeeededddeedeeedeedeeedededeeddddedddeeeededddededeeeeededeeeedeedddeddeeeededdeedeeddeeedeedeeeddedddeddeddeeeeeeeedddedddeddeeeedeeddddededdeeddededdeedddeeeeeddeeddddeeeddeeeddeeeeddddededeededdedeededeededeeddedddeedeeddedeededededeeeddeedeedeeddeeeeeeeddedddddddedededeeddeeddedeeeddddddedeededdeedddddddeeeddedeedeededeedeeeddddeddddddeeeedddedeedeeddeededdeeeeededdddededdedeededeeeeededeeeddeedeededdeddeededeedeeedeeeddeeddddeddedededddedeeeddeddeeeeeeeedeedeedeeeedeeedeeededdddddeddeeedeedddedededeeededdeeeedeededeedeededddeeeddeedededdeeeddddeeeeeeedeeedddeededdeeeeddddeddeeedddedeeeeddddddededddddeddeedeeddddeeeeedddeddddeedeeeeddeeeddedeedddddeeedddeeeeededdeedeeededdeddeedededdeeddddeeedddeeeedededddedeedddededdeeddeeedeededeeededdeeedeeedeedddededeedeeeeeedededdddeededddedeedddeddddedddedeededddeeddeedeedeededededdeeedeeeeededddddedededeeeeddeddeedededeedeedeeddededeedededededdeeededdeedeedeedededeeddeedeedeeeeedeeeedeedeeeeeeeeeeeeeededddedeeddeeedeeeeddddddddededdeeddeeeedeedeededdeedeedddededdededddeddeddddddeeeededdeeddeedddedddddeddeeddededeededeeeeededeedeeedddeeeedddeededdeeeedeeeeededddddeddedddddeddeedeeeeddeeeedeeeeeddddeddedeeeedddddeddeeedddededdeddeededeedddeedddeeddeedeeedeeddeeedeeeddedddeeeeddeddeeeeddeedeededddeedeeeeddedeeddededeeeeeddeedededeeeeddeededdeddeddedddeddddeddddddddedeedeedddddddeedededdeededddeddedeedeedeeeedddeeddddeeeeededdeedddedeeeeeeeeeeeeeeedeedeeddeddddeeeeeeeeeededdeeeeeededeedeedeeddedeeededdddedededddddddeedddeeeedddddededeededdeddeeedddeedeeddddedeedeeeeddeeeeddddddeedeededeedeeedddeeddddddddeddeedddeedeedeededededdedddeeededeedddeeeddeeeededededdeddeeededdddeeeedeeedeeddededdedddedeeedededdeeedeedeededddeeddddedeeeeeeededdeeedeedeeeedeeeeeddeedeeeedddedddddeeeddddeeeddeeeddddddeededddeeeddddededdeeeddededdddeeedddeeedddeddeeddddddeeeedeeddddeedddeeeedeeeeddeedeeededeedeeeeeededdddedededddeedeeeddddedeeedddddeeddddeddedddedeeededdeeddeeeedeeedddeddeddeeeeeeddddddeeeeedeeddeddedddeeddddedeededdedeeeeddddddddeeeddddedededdddedddeedeededeeeededdddedddddeeeddeeedddeeddddeddeddedddedeeededdeeeeeedddedeedeeddddddeeddeeedeeeddeeeeededeeededdeeeeeeedededeeddedddddeddddddddededddeddedeeeddeededdedddededdddddeeddedeeeeeedeeedddeeeeeeeddddeddddededeededeeddeeeeeeddeedeeddedeedddeddeddededeeeeddeddeedeeeededededeedddddeeeddededdeedededddeedddddddeddedeeeeddededdeddedededdddddedededdedeeeeddededeeeddededeeddeddeeededddddeddeddeeedeededdeddeddddeddeddeedddeddeedeedeeeedddeedeeeeeeddedeeededeeeeedeedddedeeddeedddedeeededeeedddeeddedededeeedeeedeeeeeeeeeededededddddededdeeddedddeeededddedeeeedeedeeddeeedededeedeedeededeeddddeedeeededdedeedededdddeeededdededeedeeeeedeeeeeddddedeeededdedeedeedeeedeeeedddddeedddeddedeedddddeeeeedededdeeddeeeeeeddeedddeddededddeeeeeedeedededeededeeedeeddedeedddedededeeedeeeddeedddeeeeeeeddeeeeeeeedddededeedddedeeeeddeddedededdeedeeddededeeeddedeeeddddddeeedeeeeddeedddddedddeddeedddddeeedeeeeddddeedededddeeeddddedddeedeededddeedddddddddeeedededdddeeddedddddeedeeeddeddddeededddeeddeeddeeeddeeededdededeeddeeeedddeeddedeeedeeeeeeddeeededdddedeeeeddeeededeeeedededddeddddeeeeedddedddddeeddeeddeededeeeeddedeeddddededdeddeedededeeeeededeedeeeeddedddeddeddedeeeedeeeddeeeeeeeedddedeeedeeedddeeededdeededdeedeededdedddeedeedededeeeedeeededddddddddeddeedeeeedeeddeddeddedeededdedeeeededeeededdededdedeeeddededdeddedeededeeeeedededeedeededdddeddddeddddddedddeedddeededeedeeddeddddeeddeedeeeeddeeeddddeeeeeeddddededeededdeeddddddddeddeededdddeddeedddedeeededdeededddeedeedeededeeededdeeeededddddeeeddeeddeeeddeeeeedeeeeeedddddeeedddddeeddddededeedeeddddeeeeededeeeededdddddeededddeeeededeedeedeedeeeeeeddeddeddddddddddeddeeeedddeededededeeedeeeeedddddddeededdeeddddedededdeddedeededeeedeeeedeededededddeeddeedeedeeedddddeededdddeddedeeddddeeedddeedeeeeddedddeeeeeedeeeeeddeeddedeeeedeeeddeeeeeddeeeeeedddedeeeddeddeeddeeededdeddddeeeddededdeedededeeddddeeeeedeeededededdedeeeeeddedeedddeedededeeddeededdeeeedeedddeeddedeeedddddeeedddedeeededededdeedeedeeeeededddeddedededdeeedddddeedeededddeedddddedeeddededeeedddeeeedeedeedeededddddedeedeeddeeededeedeeeededdeddeedddeeeddeededededeeeededdddddeddeeeeeeeedeeeddddddeeeedddeededeeeedeeeeeededeeeeddedddeeeeeeddedeeedddededdddeeeedddeddeeedeeedddeedededeededddedddeedededeededdeddedddeeeedddeedeeeededddeedeeedddeedeeddedeededdddddeededdddeeeeeddeddeedededdeedddeeedddededdddeddeedddeeeddeedededeedddddeeeddddddddeddeeeddddeddededeeeeeddddeededeeeddeddeeeedddeeeeddddeddedeeedededdedeeeddeeddddeddedededdddedddeddeddeddddedeeedddedededeeeeeeedddddeeddeeededddedddeddeeddedeeeededdddededdeddeeeddedededeeedddeeddddddeddeedddeddedeeeddedddeeddeeeeededeeedddeeededededeeeddddeddeddeeddddddeeddeddddddedeeddeddeddeeeeddedeededddeedeeddeeededdededeedeededeeeddeeeddedeedededeeeededdeeededdeedeededeeededeedeeddddedeeeeddeeeddeeeddeeeddddddeeddededdeedeededdddddeddddeeeeedeeddeeddedddeeeeeeeeeedeedddddddedeeeeeeedddededddeeeeddddeeeedeeeeeeedddedeeedeeeeddddeddeedddeedddeedeeeeeddedddedddeddeeeddddddddedeedddeeddddddeeeedddeeddddedeedeeeeeedddeddddeedddeeededddddeeddeeedddddeddeedeeddddeeededededddeeeddeeeeddeeeeeeeeddddedeeedeeeddeeddedeeedddeeeeddeeeddddddddeeeeeddeedddededeededdddeeedeeddddddededddeeddeeeeeedddddededddddeeedeeddeeeddeddeeeeddedeeededeeeededeeedddddededeedddddeeddededeeededdeddddeeddeedededddeedeedeeeeeedddededddeedeededddeedeededeeeddeedeeedeedededdeeeedddeeeedddedddeededeedddddedddddeeddddddededddddddedddeddedddeeeeddeeeddddddeedeeedddededdddeeeddedededeeeeeeeeedeeeeeeedddeeeeddeedeeeeeddddeededeeeeedeedeeeededddededededeeedddeedddedeeeedededeedddeedededdeddeeeedeeddddedddedeeeeeeeeedededeeddeddededdddeeeddeddedeeedddddddeeeeddedeeeedddeeeeddedeedededdededddddeeedeedeeddedededeeeddeddeededeeeddddddddeeedeeeedeeeddeddeddeededdddddddeeeddeddddedeeeedddedddeeddddddeedeeeedeeeeeeeeedddeeeddddeddeddeddddedeeeddddedeeeedddedeeededdeddeeededdedddedeededdededddeddeddededeeddddeddeddeddeeeeededdeeeeedeededdeddeedededdeddededeededdddededdeedeededddedddddeeedeeeeedddededeeeededdddeededdeeedeededdddeddededddededddeeedeeeedeeeedeeeededdeedeeddeedddeededdddededeeeedeeedeeeedddeddeeddddddeeedddededeeeedeeeededdeeeeeeeeeddeddedddeeeddddedeeeddedddededdeddeedddddeeeedeeedddeeedeeeedeeeeddddeddedeeeedddeededdddeeedeeeeededededeedeedeeeeeeedededddededeedddeedddeedddedeeeeedeeeddededdedddddeeedeedeededeedeeddeeededeeeeeeeeedededeeeeedeeddeeeeeeddedeedeededeeddeeeddeeeeddedddeeededdddedeeeddeedddedeeeeeeedededdeddeddeeeeeeddeedeedeeddededededeeeededddeeeedddeeeeeeededededddddeeeededdedeededeeddddddeedddeeddedddedeeeeedeeddeddeddeeedddeddeedddeeddededeedddedddedddddeeedededdeeeedeeeeededeeeddeddeededdeedeededeeeeeddedeeddeeeeeeeeddeedeeededededdddddddddedededddeeddeeedeedeeeedeeeddedddeeeddeedeeeeeeedddeeededdddddeddeeedeeeeddddeeeeeededddddddeeeeeedededeeddeeeddeddeeedeeeeddddeeeeededddedeededeeededddeeeeddededdededddddeeeddeedededdedddedddeeeeedeeedeedddeeeeeeedddddedddeededdeedeeeeeeeedeeedeeddeeeeedededeeddededdeeedeeeeeeddeddddedeededeeeeeeeddededdeeeeeeeeeddddeddedeeeedeeddedeeeddededddedddedddddeddedddedeededdeeeeeddeededddeddeddeeedddddddeededeeededeeeeeeedeeddddddeeedeeeeddedddeeeededdeddeeddeeddddeeedeeedddedddedddedeedeededeeedeeedededdeedeeeededdddedeeddededddedeeeeeddeeededddddddeddddddddeedddedeeeeeededdeeeeddedeeeeededeeededdddededdddeeeeddddeeedeeedddeeeededddeedeedddeddddededdedddeddeddeddddedddddeedddeeeedddeddeeddddedededddedeedededeeedeeedeeeeeeeddeededeeeddddeeedddddeeeeeeedeeeedddddeededeedddddeeeddddeeeeddedeedeeeeeedeeeededddedeeedededddeddeedeeddedeeeeedeeededdeedeeeededdeedeededeededeedeedddddeededdeedeeedeeddeeddddedeeeddeedeeeedeeeeddeeeedeeeddeeddddddeddddeededdddededdeddeeddedeeeddedeeddedddeeeeddeddedddedddddeeeeeedddeededdeeddddededeeeeeededdeeeedeededdddededdddedeeededdeeedddededededeeeddededdeedddddddddeddeedeededededdeeeddeeededddddddeeedddddeeeededddedddeeeeeeeeddeddeedddeeedeedddeeddededeeededdeeddddeddedeeeededdeeeeeddededddeeeddeeedddeededddedddddeddeddeeededddeeedeedddeeddeedeeeedddddeeddededddeedddddedeeddddeeedddeddededdeeeeededeedddddedeedddddddeeedeeeeddedeeeededdeededdeddededdeedeedddedddddeddeeeededededdedeeeeedddddddeedeededeedddeededeedddeeddddeeddddddeddedeedeeeeddeedddddeeedddddeeddeedeeeeedddedeedddedeeddeededddeddedddddddddedededddddeeeedeeddddeddeeeeeededdedeeeedededddddeddeeeddeddededdedededdeedddeedeeeeeeeddedeedddedededdeeeeddeeeedeedeededdedddeeddeeeddddeeeeedededdeedeedddeddeeeddeddeeddeedeeeddeeeededdededeedddeedeededeeddddeddddddeeddeededdedddddeddeeddeedeeededdeeeeeedddeeeeeeddededeedeeededdedeeeedddddededdedeeddeddeddeeedeeeeedeeeeddedeeededdeddddddeeeedeeddeededdeeeeeeeededdeededeeedddedeeeddeedeeeeeeeedededeededeedddedeeeddeeedeeeddeeddddedeeeededddddeeeddeddedddedeedeedeeddededededdeedeeeedddeddeeedeeddeededeeeeeddedeedeeeeeeeeeddeddddeeddddeddddeddeedddeeedeeeeddeeededeededdeeeedddeeddeeeddeeddeeedddeddeeeeddddeddeddeedeeddeddeeedeeddddeddeeeddeeedddddddddddeeeddedeeeededdeeeeeddeddeeeeddededddedddddeedddeeeedededededeededeeeddeeddeeddeedededddedddeedededeeeedededdddeeeeedeeddddeeeeeedddedededdeddddddddededdedddeedeeddeeeeeedeededddeeddeedeeeddeddedededdeeeddeddeedededdedeeeeeededeeeedddedddeedededeedeedeedeeeeeedeedeeedeededdeedddeeedededdeeeeeeeededdeeddededededededeededdddedddeedeeddeeeedeededdeddeedeedededdededdddeeddeddddddeedeeeddededeedededeeddeddeeddedeeeededeeeeddeeeddeeeddeedeedddeddeddedeedeedeededddddedeeeeeddddddededeeddeeeeeeddeeedddedeeedeeddddddeddeeedddededeededeeededdedeeeedeeeedeeeeedeedddeddededdddddeededdeddedeedeeedeedddddeedddeeededeeddededeeddedededeeeeeedddeeddddeeddeedededeedddeddeeddddedeedeeddddddddededededddedededdeddedeeedededededdedddeededeeeeedeeedeeeedeeeeeeeddeeeedeeddeddddedeeeeeeedeedeedeeeeddddededddeededddeddddededededdddddddedeeeeeeeeeddeddeeeedddeddedededdedeeeddddddeeeedddddeedddeddedeeeedeeedeeeeddddeddddddddeddeeeddeeeeedeededededdedddedeeedeeddddeeddeeeddedededdeddeeededddeeddedeeededddededeedddedeedddeeeeddeeeedeedddddeeedddedeeeedeededdddedeedeeeeeeddeddddeeedeeeddeddddeeeeddddddddeeeeeeddddeededddeeedddedeedeeeeddededddeedeeedeedddddeeeeedddddeeeededddddeededdeeedededededdddeeeeeedeeeedddededdedeeddddeedeeeddddeddeedddddddddededdedededeeddedddedeededeededdeedddddeedededdddddddeeedeeededdededeeddeddddedeedeeeeeededddedeeeeddeeedeeeddeeedddeddedeedeeeedeeeddedddddeeeedeedeeeddedddeddeddedddddeeededeedeeeddddedeedeeedddeeeeeeeededeeeedeeeedddeeedededeeeeeedeeeeeeededdeedeeddeddedededdedddeeeeedddeeeeedddddeededddeeeedeedeedeeeededeeeeeeeeededeeeddeeeededdeeeddddeeeeedeeeeeeddeddedddeddeddddddeddeeeeddeeddeeedededeeeeeededeeeddddedeeddeeeeddeeedddedddddededdedeededdeddedededdddddddededdedeeeeddddeeeeeddedddedddeddeedddeedddededddeeddddeeeddddedddeeedddddeddddddeedeeedeeededeedeeeeeeededeeedddedeeedeedddeeddedeedddeeededeeeeddedddddededddeedddedddeeeeeeedededddededdddeedddeddeddddeededddeddeeeddddeedddeddededeeddededeedededddeedeeededdeddeeededdddedededeededeeeeeeeddeedeedddeedeeeededededdddeeeedeeeeddddddddddedddeeeddeddeedeededeeeeeddeeeeeedededdddddededddedddeedeededededdedeeedeeedddeedddededeeeeedeeedddededeeeeedeedeeeeeddedddddedeededededeededededededeeeeeeddeddeedeedeeeeeddddedeeeddeeeedeedddddeddeedddededddeeedeeeedddddededeeddeeeedeeddddeeeeeeededddeddddeeddddedeeeedeeededdddedddeddedddeddedeeeeddeeeddeeddedeedeeedeedeeedeeedeededdedeeeedeeeeeeeeeeddededdedddeddeeededeeeededeededeedeeddededddededeeedeeeeededdddedededeeddedeedddeedeeedededdddedeeeedeeededeeddddedeeeddeddedeedeeeddddeedeeedeeddddededededdeeeeeedddededdedddededdededeeededeeeedeededdedddedddedddededededddeeedddddeddeeeeeeededeedededeeddeddededdeeeedddededdeedddeddeddeeeedddededeeeddedddeddddeddddddedddeddddeeddddedddddedddddedddedeeeeddeeddddddeddeedddeededeeddddeeeddedddeeddeededdddeddeddddedeeeeeedeededddeddeeddededeeededdeeeededdddddeeddeededdeedeeeeddeeddeededdeeeddeedddedeededeeeeddedddeeeddedeeedddeddeddddededddedeeededddddedeeeeddeedddeddedddddddeddedddedeeddeedeeededeeeedeeeddddddedeedeeddededdedddeddeddededdeeeeeedeeeddededededdedeedeededddeeededdeedddddeeddddeeddedeeeddededeeeeddedeedeeeeedeedddddeddedeeeeedeeededeeddddeedeeeededdededdeedeeddededeedededededddddedeeeeeeeeeeddeeeedeedeedddddeeededeeddeddeedddddeedededeedededdddeeeededddddeddddededddededdddeededededeeeddedeeeeeeeeddddededdedededdeeededddeedeedddddeedeedddddeddedddeeeddddeeeeeddeeedddeddeddededdeeddeeedededdeeeeddedddeeeddeeeedeeedddeeedededddddddededdddeeeddedeeeddededddeeddddedeedeeededeeedeeddeeedddddeeeeddeddeededdddedeeeddedeeddedddddddeedeedeeeeddeeeeddedeeeeddddeeddeedeeededdddddeedeeeeeeeeddeddeedddeedeeeedeeddddeeedededdeeeddedddeeedeeeedeeedededdeeddeeeedeeededddeeddeeeddeddddeddeddddeddededeeddddddeeedeeeeddddedeededdeeeeddddeeeddeedddedddedeeddedeededdeddddeeeddedddedeeeddeddddddedddededdddeededddeddeddddeddeedddedededeeeeededddddeedeeeddeedeeeededdeeededeeeededdddededdeddeeeeddeddddeeeddddededeeedeeeeddeedeedeeeddedddeeedeedeedededddddeeedeeeeedeedddedeeddedeeeeeddddeddeededddedeeddedddddeeeeddeeeeddeddeedeeddeeddedeeeddedddddeddeedddeedededdddeedeeeddddeeeddeddeeddededededededdeeddddedededdeddeddeeeddedeeeddddedddededdeedeedeeddddddddddeeeeedeeddeeddeedeeeeeeeddeddeedddddeeedeeeeeededdededddeeddddedddeeddeedeeedddeeededeeeeeeddedeeeeddeedeeedddeeeedeeedededdeedeeedddddddeedeedddeeddddddeeeddedededddeddedeeedeeddddddeeeededeeedededddededeeededdeeddeddeddddedeedddeeddddddeddeeeeeeeeeeeeeeddddeeeeedeedddedddedeeeddddeedddeeedddeddeedeeddddeedddededeeeddeedeeeeeededddddeeddeedddeeeededddddedeeddeddeedeeedeeeddeeddeeeddddedddddeeeededeedededeedededddedddeddedddeeddededddededddeedededddeedeedeeeeeeddddeeddddeeeededeeedeeeddedeeededddeeedededddddeeeddddeeedddeddddedddeeddeddededddeeddddddeeddddddddededeedeeddddeedddeddddddeeedeedddeddeddddeeeeeededddedeeeeeeedeeeedededdeeeedeeeeedeeeedddedeeeeeededededededeedeededeedeedeedeeeddedddeeededdeeeedddeeededdedeeeeededddddedededeeeeeeeeeeedededdddededededeeeeddedeeddeedddddddedeedeedddeddeddedddeeddeeddeeeededddedddedeededdeedededeeeddedeeedeeeeeddddedddededeeeeddeeddedeeddeeeeeddddddeeeeededdededdeeddddddddddddddddeeeeeeedddddedeeddeeeeeddeeeededdeddddedeeededeededeedddededeedddedeedeeedeedddedeededdedddedeeeededdedeededdeededdeddddeeededdeeeeedeedddedddeededeeddeeddededdeddedededdeeeeddeddddddddddedeedddedddeeeedeeeeeedddeededeeeddeedeeddeeddeeedededdeeddeeeeeedddeeedeededddddeeeeddeededeeddddddedededeedededeeeeddddddeedddedeeeedddededeeeeddeeeeeeddedeeedeeddeddedddeeeedddedeeedeeeddededdeeeeedddeddeedeeeeddeeeededeedeeedeedddddedeeeeeddddeeddeeededeeeeededdeedeededdedeeeeddedededededdddddeedddeedddeeeeeeedddeedededddddededdedddddeeedeededddeeedddeddeeeededededeeeeededddededdeddedddeeededeeeeededdeeedddededededededddeededeeeddeddeeeeeeedededddedddeeddededdeededdeedeedeeededeeeeededdeeeddddeeeeededddededdedeeeeededdedeeddeeedddedddeddddeddeddeddeeeeeeeeddedeedeededddeddeddeeedddddedeededddddedddddeeedededeeeeedeedeeeeedeeededeeeddddeedeedeeeeeddddeeddeeeeeeddeeddedddeddedededdedddededddedeeddedddeeededdeeeedeeeddeedededddddddeeeeedddeeeeeeeeddddeddeeedeedededeededeededdddddddeeeeededeedeedeeddeeddeeededddddeddedeededdeedeedededededdddddeddeeeddeedededdededeeeddddddddddededeeededeeedeedddeeedeeeedddeedddeddeddeddeeeededddeeedeedeeeeeededeeedddddeddeeddedeeeededdddeddeeeeeeedeeededededdededdeeedddedeededeeeeddeddedeeeddededdeeeddeddeddeeeeddeedeededeeeeeeddeedededeedeededeeeedddedddedeeddedeeeddedddeedddeeeeedeeedddedddeeeededdeedeeedeeeddeeeedeeedddedddedddeeeedddeedeeededededeeeeeeeddddedeeeeeeeeeededdeddeeddedddeedddddeddddddedddededdddedededeeeeddedeeddeddeeedeeeeeedeededeeeeeeeeddeddededeedeededeeeddddeddedeedddeddeeededddddddddeedededdededdddeedeeeeedeeddeedddddedeeeddddeeedeeedeeededeeeeeeedeedeeeedeeedeedededddedeeeeeeedddeedddddeededdddededeedeedddeeedeedeedeeeeeedeedddddddedeeedededddedddeddedeedeeedeedeeeeeeedeeeeeedddeeddeeedeeeddeedeedddddeededdeddeeedeeddeeedddedeeedddeeeeeddedededeeeeddeeedeeddddddeedddeededddeeeedeeddeeddddeedeeeddeddeedeeeeeddeddeeddeddddeeeeededdeeedeedeededdeededddeeededddddeddddeddddededdddedeedddedeeedddededeedddeedededdeeedddeeddddedeeedeedeedddeddeeddeededdeeedddededddddeeddeedddeddeeeeedeedddddeeeddddeddeddddedeeedeedeededdeeddeddddeeeeeedeedeeeedddededddeededeeedddddeeeddedddddeededdeeeeddddddeeeeddeeedddeeeeeddedddddedededdddededededeeddedeeedddeededeededeeeddeeeedeedededddddeddeeeeeddeeeedeeeeeededededddddedddddedeeedddddddeeddedeeeedededdddeeeeededddedeeeeeeedeeeddeededdedddeddedeeedededdeddedeededeeddeddeeddeeedddddeeddeedeeeeeeddeeeedddedddddeedddddeddeddeddddddededeeddededeeddedddddddeeeeddeeddddeeeedddddddddddddeeddeedededdedeededeeddddedddeddeeddddeedddededeedeeeddeedeeddddeeddddedeededdeeddeeedeeeedededdeeedddeddddeeeddeedeedddedeeeddededdeeeeeeddeddeeedeedeeededddedddeedeeddeededddeddddeeddedeeddeeededddedededddeeeeeeddeddddedeeededdedeeeeddddeeddddddeedeeedeedeedeededddeeeeedddedededdedeeeedeeeeeeedddedddeeedeeeeededdedeedededddedededeeedeeeeededdedeeeededeeeddeddeedddedeeeeedddddddddeeeedededddeeedeedeedddededeeddeddddddedddedeeddeeedeeeddeeedeedeeeedeeeeddededeedeeededeeedddedddedddddededdeeededdeeeedededddddeeedeededdeedeedeedddeeeddededdeeedeeeddededddeeddedddeeeeededdeeedeededdeedeeedeeedddddddedddddeedeedeeedeeeeddeeedeeedeeeedeededddedddddeeddeeeeddeddeededeededeeeddeddededddedededdeeeddeededeedeeedededdddeeedededddedeeedeeddeedddededddeeddddedddeeddedeeeddddeedeedeeeedddededddddededeeeedddeddeedddedeeddeddddeddeeeeeeedeeeddddedddeedddeddedeeeeedeeeeeededeededeeedddeedddeeeddddddedddeddededeeeddddedededededeeeeddededdeeedeeeddeedddededdeededdeedeeeedeeeddededddedddeededdeededddedeeeededeeedeeeddddeeeedddeddeeeddeeedeeeedeeddeeddeedddddedeeededeededdddedeedeeedddeddedddededeeddeeddeeeeedeeedededddddddededdedededededdeddeededdedeeeeedeeedeeddddededdeddeddddddededdeddededdeedeeedddddedeededdeeeeeeeeddddeeeeddeeededdedeeedddeededdeedeeedededdeeddeedeeeddddeeededededdeedddedddedddddeeeeeeededeeededeeeeeddeddddededeeedeeeeeeeeedddeeddeddddeedededdeeedeeddeeeddededdeedeeeeddddeeededdededdddddddededddeeeddddddedeedeeeeeeedeedeeeeddeedeededeedddeeeddedddeeedddeddedddeeddedeeeedeeedeededdddeeddddeddededeeedeeededdeeeedddddddddddeeddeedddddedddddddededeededeeedddeddedddddededededddededdededeededeeeedddededeeddedeeeeeddedeeeedeeeeedddddededeeeeeddedeedeeedeeedddedddeededddeddddedeeeeedddeeeeddeeeedddedeeeeeeeddededddeedeeedeedddddeeddeededdddeedddedddeedeedeeddddedeeedddddedeeddeededddedeeeeddedddeddddeddddedddeedeeddddddeeddeededdededdedddeeeedddeddeddeedddddeddededddeddddeeeeeeededdededeeddeddddedeedeeeeeededeeeeeddddeeeeeeeeddeededdeddedeedeeedeeeedeedddddeddeeeddeeeddeeedddededdeedddedddeeeddededdddededdedeedeeeddeeeededeeeeddeeeedddeeeededdeeedeeeededdededdeedeedeeddedededdeddeeeeeeeedeeeeedddededdeddeeeeedeededdededdddeeedeeeeedeeeeeedeeeeeddedeedeedeeeeededeeeeddeddeddddeeddddddddddeeeeedeedddeddddedeedeeedeeeddeedeeeeeddeeeedddeededeedddddedddddeedeeedddededddeedddddeeeedddeeeedddddedddddeddeedddddeeedddeeeddededeeeddeddededdddeeddedeededdededdddedeededeeededdeeeeeeeeeeeddeeddeedddddeddeededdeddedddeeededeededdeeddededeedeeedddedddeedeeedddeedddddeddddeedddedeededddeeeededddeeddddddedededdededdeddddddedeededdeeddeeddddddddeeeeeddddedededeeeeddeeeedddeedddeeddeedeeeedeeeeeddddeeeddddeedddeddddedededeeeddeddeedddedeeeeededeedededededdddddeddeddedddeddeeeeeededdeddeeeededdddeeddeeeededeedeeeeddededeeededdedddeeeddeeddddeeedeeddeddeeeededeeedeeedeedededddeedeeeeedddedddededdddeeeedeedddddeedeedddeeeddedeeddeeededddededeeddeeeeeeedddedeeededdedddedeedeeddddeddeeedeeddeddededededdeddeeddeeeeeeddedddeeedeeddedeeeddedeeeddeeddeddededdeeedeedeeeeeddeddddededdddededededdeeedddeeedeeeeeedeededddeeeeeeedeeeeededdddddddeddeddddeedddeeddeededededeeeeededededdeeeddddddeeeedddeeddedeeedddeddddeeddededdeddddddedeeeeededddeddeedddedddddeeddeededeeeeddededdeddeedddeeddddededddddedededdeedddeedeeedeededeeedeedeeddedeedeeeedeedddddeeeddeddddddeeeddeededededdedededdededdddddedddedddeeeedededddeeedededeeedeeeddedddedeeeddeddeedddeedededddddeeeddedddeeddeddedddedddeddededdeeeeeeeedeeeeedeeeddededeeddedeeeeedeeeedddeeddeddedddeedeedddeedddededdeeeddeeeddddeededeededdededededdddeeddddeddeddddededddededeeedddededeeeeddddddeeddeddededeedeeddddddeedeedeeddeedededededddeedeeeddeeddeeeeddeddedddddeedddeeddeedeeedddddeddeededeedeededddeeededdddedddeededddeeddeedddddededdeedddedeededeeeeeeddddddddededdeddeeedededdddeeededdededeededdeedeedeededeeeddededddddddddeeeedeeeeeddeeeedeedeedddddeeeeedeeddeeededddeddededddeededdeddedeeedddededddeddededddeeeddddeddedeeeddeeedddedeeeeeededdeddddddeddddededeeddeddeeddddededeeeddededdddddeeeedddeeeeeddeeeddeeddedeededdeeddeeededddddeddddeeddededdeededeedddeeeededdddddddeeededdddedddedededdedeeddedeeddedeededdeedededeedddeddedddeeeedddddeedddddedddeeddedeeededdedddeeedeeddeeeddedeeddeeeeeeddddeeddeedeeededddddddedeedeeededddddeedddeedeeeeeeeeddddeedededdeedddedddededeeeedeeeeeededeeddeededeeeeeddeedeedeededddddededddddeddededeedddeeeeeddeededeedddeeededeedededdeeedeeeddeeeeddddedeededdeedddededeeededddedededdeddeeddeeddededdddeeeedddddddededddddeddeededdedeeeedededddeddeeddddeeedeedddeededededeeeedddedeeddedddeeeededdddddeedddededeeedeeedddeedeeedeeddeddeeeededddedeeddddddeeeddeeeedeedeeedeeededdeeeeededdddeededdededededeedddeeeeddeeedddeeddedeedddddeedeeedeeddddedddeddddedeededdedeedeedddddedddeeddddddedededddddedddeedddedddddeeddedddedddedeeeddedddddeddddeeddedeeddeeededdedeeeeddedddeeededeeeeeeeddeddeededddeeededeedddeddeddddddeddddeeddeeddeedeeeeeeeeddedeeedeedeeeeedeededeeeedddededeeeeeededeeeeeededdedddededdedddeeeedededdddedededddeddeddeedeedeedddeeeeeedeeedededddddeedddeeededeeeddeddededededeeededdddededdedeedeeedeeededdeeeeeddededdddeddddddeddeeddddeedddedeeedeeddeddedeeeddeeeeddeeeedeeddeededededddeddededdeddededeedeeededddedddeddeeddeeddedededddddeddeedeeeddddeeedeedeeedddeddddeeeeddeeddddeddeeddddddedeeedddddeeeeeeedeeedddeedeeddeeeeedeeedeeeddeddeeeddedeeedddedddddededdeddeeddddeeededdddeeeedeedededdededdedeedeedddeeeeedeedeeddddeedddedeeddeeedddedddeddedeeeddeeedeeddeedeeeddeededdedddedeeededeeeeddedeeededdeeeeeddeeddedededeedeeddeeededdeeeeeeddededeedddddeeeeeddeeddeeeededdeeeedddddedeeedeeededeedeedddeddddeeedededeeddddeeeedddeeeddddeedeedeedddeddeddeddeeeedeeddeeedddedeedddeeeededdeededdededeeddeeddeeeeddedeededddedddeeddeeddededddededeedddddeeeeedeeeeeddddededddddeddeeededdeedeeeeddddedeedeeedeeedeeeeeedeeedddeedeeeedeededeeeeeededeeddddeeeddeeeeedeedededdddedddeddeeddededddddeedeedededddddedededddeededdedddededeededeeddeeddddddeeddedddeedededddeededdddeddededdddeedddeeededeededdeeeedeededededdeeeeedededdededdeeedeeeddddddeeedeededdedddeeedddededeeedddeeedddddeedddeeeeeeeddddddedddeeeedddddeddeeeeeededeededdededededddeeeedddedeedeeedddededeedddedddeedeeddeddeededdeeeeeddedddeeddedeedddddeeeeeeeddddeeedeeddedeeeeededdeededdeddededeedeeddeedeeeedddddeededeeeddeeeeeeedddeeeeeededddededdedddddeeeddededdeeeeedddddeddeddeddedddedededddeddddeeeedddeeededeeeeeddddeeedededeeddeeededededdededdededededeeeeddeedddeddeedddedeedeededdeddeeededeededddedeeddeedeedeededdeeddededdeeeddeedeedededddeddeddeeddededdedddddedeeeeeeedeedddeeeeedddeedddddeeeddddddeddeeeddddeedddeeedededddeddedddedddededeeeddeeeeddeedeededeeeeedddddeddeeeeeedddeddedddededeedeedeeddedeeddedeeededddddeeedeededdddeddeeeedededddddeeeeedeeededeeeeedddeedddeddedddedeededeededdddddddededddeddedeeededeeeedeeededddedeededeeedededdeeddeededdddedddeeedeeddeedeeeeeedeeeedddddddddddeeeddeddddeeedeeeddededeeeeddeeddeedddeeeededddddddddddededdeedeeedeeeedddeddeedeedeedeeddeeddeeeddedeeeeedeeedeeedddeddeddeeedeeeedeeedeeeeededdedededeeeeddeeeddeddeddeeeeddeeddeeeeeeededddeeeddedeedeeeddeeeeddeeddedeeeddedeeeddddddeedddeeeeeeededdddedededeeeddeeedeeddeeddeeeeededdeeeddeddeeeedddddeedeeedddddeddeeededddddeeeeeeeedeedeedeeddddddededeeeddddeddedeeededeeddeededededeeeddeddedddeededddeeeeeeeeeeeeeedeeeeeddeddeeedeededeeeddeddddeededddedeeddeeeeeeddededeedededeeeedeeeeddedeeededeedeedddddeedeedddddeeeddeedeeddddeeeeededeeedeeeddeedeeeddededeeeedddeddddeeddddeeeddeddeeeedeedeedededddeddeeddedeeeeeeddddddddeeedeededddedededdedeeeededeedeeedeeedeeedeedddeddddeddeeedeeeeeeddeeedededdededeeeeeedeeedddedddeddddedeeddedededdeddeddeededddeddddeddedeedddeededdeeededeeddeddeeeddeddeedeedeeddeeddedeededdedeedddddeddedeeeedeedeededdddeeeddddddddddddeeddedddeddeddedededdeeeddeeeedededeedededdeeedddeeedeeeeeeeededeedddeddeddeeededdeeeddeededdeedeeddeedddddeedddddeedddddeeeddededdddddeedeeeddeddddeddddddeededdeededdeeddeeedddddededeedeeedeeddddeeeddeedddddeddedeededdddddeededeeeddddeeeeedeedddddedeeededdeeeeededeeededdeedddeeeedeededeeeddeedeeeedeeeddeddeeddeeedddeeeededdeeeeedeeeddddeeddeddeedeeeeddeddeedeedeeeedeeeddddeeeddeedeeedeeedeeddededdeeddddddddeddeeedddeeededdeddedeedeeeddddeeddeeeededdeeddeededeededeeeddddeeddddddedddedeedeededdddedddddeedeeeededddeddeddddeeeeddeeeedeeeeeddedeeedddeddeddeeedddeedddeededeeddedeeddeddeeddddddddddeedeeeeeedeeededddddeeddededeededdeedeeeedeeeedeeedeeeeddeeedddddeedeeeeedddedededeeddddeeeeeddddedeeeeddeeeededddededeeededdeedddddededddedddeedddddedddedddededddeeeeeeeeeddededdeeddeedeedeedeeeedddddddeedeeedeeededeededddddeeeddeddeeeeeedeeeededeeeeededeeddeeddedeeeddddedeedededeeeeddedeeeddeeeedddeeddeedeedeeeeddededdedddeeddedddddddddedeeeeeeeddddddeededdddededeedeeddddddedddeddeddeeedeeeeeeddeddeeeeedededddededeedeeddedeededdedddeddddeededeeeededdeeedddddddddddeedeeedddeddeedeeddeededdededddeeeeeeededeeedeeedededdeeeedddddeeddededddeddeededededdeddeeedededdeedeeededeeddeeedeeeeeeeedeeddeedddddededdeeddedeeedeeedddddeddeddeeddedddddedeeeddeeeddddeddeedeeeeeddeddeededededddedeeddedddeddddeeededeedeeeeeddeeededeeedddddedeedededeedededddddedeeeeeedddedddddeeededdededdddeddeeeeeeedeedddededddeedddddeeededdeddeeeddedeeddeddedddddeddeeedddddddddddddddededeeededdeeeddeddedeeddedeededeeddeeddededeeeddeeeedddedeeeedeedddeeeddddeedeeeeddeededddeeddeeeeeeeeddeedddedededdeddddeedeeeddedddeeeddeeedeededddddededdddedddedeedeedeeeeddeddedddedeeddddedddedeeeddeedededdededdeeeddededdddeeddeddeeeddeededeeedeeeddedddeddeedddddddeddeededddeddeeddedeeddeddddedeededdddeeeeeddddddededddeedeededeedddeeededeeeeeeeedeeedeeeeeedeeeddddeddeddeeeddeeddedddeeddddeeedeeeeddeedededdeeeddeeeeddeddddeeddeeedeeeedddeeddeddddeededeedeeeeedddeddddededeeeddeedededdeededdeddddddedeeeedddddeeededddeeeededeeeeeededeededdedeeddeeeedddddedeedddeeddddeededdeeedeeddeddddeedeedeeeedeeedddeeeeeeddeeddeedeedeededdddeddeedddedeeeeedddededdddededdeededeeededeededddddddeeddeededeeddeeddeddededeedddedddddedededeeedeeddedddedeeeddddeddedeeeeeddedeedeeddddeeedeeeeeddedddedddeedddeeeededeeddeeeeeeedededeeeeddedddddeeedeeeededddddeeddeedeeeddddeddedeedeeeedeeddddddeeededddededddedddddeddeeeeddedeeeddedddedeededeeeeeeedddeeedeeedeededdddeeedeeeedddeddddeedddddddddeddeddededdeededdededeeeedededeededeededdedddddedeeeeedddeeeeeeeededeedeeeeddddedededdeeeeeedeeddedddeeeddeeeddeeeeddedeedeeededddeeeeddededdeddeeddddeedeeeddeedededeeeedddddedddeeeeeeddddeddeeededdeeedeeeedeeeeeeedddeededeedededeeddedeededededeeddeedeeedededdddedddeeeddddeedeeeedeeeeeededdededdeeddedeededdededdeddddeddeeddeddddddddeedeeddddddddddddeeddeeeeeeddeedeeeeddeeedeeddeeeeeeeededdeddddeededeeddddededeeeddedeeedeeddeedddddddedddeeeddedddddeeeededeeeedeeedeedddeddededdeddeededeedeedededddeddeededddedeedeeeedddeeededddededdddddeddeededdeedddeeeeddedeededeeeddededdedeeddddeddddddededddeeededeeededededdeeeddeeddeeeeeeddddededdddddededeeddeddedddddededdeddeedeeedddeddeddeeedeeddddededeeeeedeeeddddedddddeeeeedeeeedeeeedddddedddddddedeeedddeeeeeededdeeedeeedddededeeededdededddedeededdeeededdddddeddeeededddddeeddeeddeddedeeeedededededeeedeedeeeeeedddddeddddddddeeeddededdeeddeddddeedeedeeedeedeedeeedddeddeeededddeeedededddddedeedeedeeedeeeddddeeeddedeeddedddededdddddeededdeeeeddeeddeededdeeddeeeedeeedddeddedeeeeddeddedededdddedeeeeeeeedeeddedddeeddeeddeedddddeedeedddeededdeeeddeeeddddedededdeddddededeededddeeedddededdededeeeeeedeededdddeeedeeeeeddeedddddddddeddeeedddeddeeeedeededddededededddededdeeeddeeddeeeeedeedddedeeddddeddddedddededeeddedddeeeedeedeeddedeeddddddddedeeeddededdeeeddededdeddeeddeeeeeddeddeddddeddeeddeddddeddeeeeeededdedddedeeddedeeeeedddeedededeeededdddedddeeddedeedededdedeeddeeddeedddeededddeeedeededddddeeedeeeddeedeeeddedddddeeeededddeeeeeeededdddedddeeeedeeedededdddededddedeeeeededeeeeededeeeddedeedeededdddeeedddeddeeeeddeddeddeedddeeddedddeeddddeeddeeddeeeedddeeeededededddeeeedddddededdddedeeeeedededededdddeedddedddeeeddddddeeddeeddedeeeeeeeedddddeeeeedeedeeedddeddddddeeeeeeddedeedeeeeddeddeeeddddedddeedddededeeddededddededeeedddddddddeeeeeddeddeeededddededeeddddeeddddeedeedeeededdddedddddedddeededdedddeddedddddeeeeddddeeedeedddddeededeededdeeddededddeeddddeedededeeddeeeedddddeedededeeeeddeeddeeededdeeeddeeddeedeeddeddeddeeeddededddedeedeeedeeeddeeededddededeeedddedeeddeddeddeedeedededdeedddeedddddeeddededdeeeeddeddeddedddddeeedddeeedeededdeeddeeedeedeeedededeedddededdedeeddededeeedeeeededeeeededddededeeeededdddedddeeededeedeeddedeeededdeddddeddedddeeeddeddeddeedeeddddeeeddddeedddeeddedddededeedddedddeeeddeeededeedeeeeeeeddedeeeddedeeededdeedddddeeddeddededdeeededeedeeedeedeededeedeeeeeeddddeeeeddddeeeededdeeedeeedddeddddeeeeedeeedeeddeeedddeeddeddddddddedededeeeeeeeeddeeddeeeddeedededdddeeeeddeedeeedeedeeddddeeeddeddeeedeededddededdddeddedddddeeddeeddddeddedeeeedddddddeeeeddddeddeeddddeddeeddeeedddedeedddddeeedeeddeeddedededeeeeeededeededeededeededddeddeeeddededeeedeeedddeedeeedddeddeeeddeddddddddeddddedeedddeeeeedddeeedeeededddeeeeeeddeddedeedededededeeddedddddededdedeeddeededddddeddedededddddedddeddedddeededdededdeeddddeedddeddedddddeeeeddededddddeddeedddddeeddeeddddeeedeeedeeeddedeeddddeeddeeeeeeeedeededeeedddeedddeedeeededdeeddedeedeeeddeeddededdddeeddddeddddddedeeddddeddedeedeeeeedddeddddeededeeddeededeeeedddddddeedeeededeeeededeedeeeeededdeeeddeeeeeeedddeeeededeeeddeddddddddeedeeeeddeeedddeeeeededdeedddeeededeeeddeddedededededededdddddeddddeedeedddeeeededededddddeeddeedddddeeeddededddddddeeeeedddddeddedeedededeedeeeeddeeddeedeeededdeeddeeddddddeeededeeeeeeedddeddeddeededeedddddededddedededdeeedddeeededeeeeddeeddddeededddeddddedeeeddddddeeeedeeeddedeeddeddeeeddeeeeeddedeeedeeedeedddedddeeddedededddeeddddedddeeddeeeeddeeeddddddeeeededdeeeedeeeeeeededeeddeeeeeeddeddedddddeeededeeedeeededededededeeeedddeededddeeddddddeeddddedddedeeddeeeededdeddeededdededdddeeddeddddeeedeeddedededdeeeeddeeededdedededeeeeeeddeddeeeeeeddeeeedddededeeeededdddeddedddedddedeedeedededdddddeeeedddeedeedeededeeeeddedeeededdeeeeddededeedddedeedddeeededddedeeedededeeddeddeeeeddeeeeeeedddeeddeddddddedeeddeddedeeeeeedeeedeedeeeeddddedededeeeddeeeeeddeedddeeddddddeedeeedddeeeeeeeedededdedededeedeededddeeeeddddededdeedddedeedeeededeedddedddeddeedeededddddeeededeeedddddddedeeedddddedeeddedeededddeeddeedededdedeeeddddeeddeddddedededdeddddedddddedddededddeededeeeeedeedddeddedeeeeeeededeeddedeeeddeeddddedeedeeededdedddedeedddeeeededddeeedddddeeedddeeeedeeededddddeeeeddddeeeededdedededeedeededededddedeeededdedeeeeeeeddededeeeddeeedeedeeddeddeededddeeedddeddddeddedeedededeedddeeeeddeeedeeddeeeeeeddeddededddddeddddeededddeeeeeeeddedededeeededededddddddddeeeedeeddeeeedddddddddedddeeedeeeedededddeddeddedededdedeeedededdddeeeeeddeededdedeeddddededdeddeeeddeeeeedededdeeeddededededddddddeedededdeedddedeeddedddeddeedededeeeedddedeedddddeeedddddddedddeeeeeeeddddddedddddddeddedeeeeddeeedddddddedededeeeddedddeeeeeddeeedddddeeeddeeddedddeeddddededdeeddeededdeddddedddddededddeddeeeeddeeddeddddeddedddddeddeededddddeedddedddedeeeeedeeeeeeeedeeeeeeeedeedddeddeddddeddddeeeeedddedddddddedddeeedddeeeeedddeeddddededdeeeeddedddeeeeddededddedddeededeeededeededddddedddedeedddeeededededdededdeedededdddeedededdedeeeeeeddeeddededeeddeedeeddedddeededeeeededdddededeeeddeedddeeeededdddddddedddeddeeededeedededddededededdeedddddeeddeeededdeeedddddddeeedddeddddddeddeeeedeedeeeeeededeeeedddeeedeeedeedddeeddeeeedeededeeeeeddddddeddeddedeeddeeddeeeeddeeddededededdededdddedeedddeededeedededdedededdeededeedeeeddeddeeddededdeeeddeddeededdeddeedeededddededeeededdddedeeeedeedeedeeeeededdddededddedeededeedeeededeeddeedddededddedeedddddededddddeeeddeeeeeeededeeeeedddddeeddeedddeeeddededeeedeeddedededeeeeeeddeeedeedeeddeeeddeeeeddeeededeeeedeeddddeeeeeedddddededdedddededddeedddedeeeddeeedddeeeeddddeeeeeedddeddddeddeeeededdeddeeeeeeddeeeededddedeedddddeeeeedddddeeddeeddeddeedddeeddedddeeeedddeedddedeeddeeedeedddddeddedeedededdedeeeeeededdeeddedededeeeddeeeddddddeeddededdeddddeeddddeddeeeedddeeeededdeddeddeeededeeeedddeeddeddeededeeddededdeeeddeddedeedeededdddddddeddedeededeeeeededdddedededddddeddedeeddedddeeeeddededeedddedeeeeededededeededdeddeedeeedeedeeededeedededeeddddeeddeddeeeededdeeeeededddedddedeeedddddedddddeeddededddeddededdeeeddedddeeedddedeededdeedededeedddeddededeeededeeedeeddddeeeeeeedddededdeddededdeddddededeeddeddeededdeeeddddeddeeeedddeeeeeeedeededdedededeeeeeeeeddeeedeedeeeeddeddeedeeeeddeedddeeeddeddeedeedeeeeddeedddeddeedeeeedeeeeeedeedeeeeddeeedddeedddeeeeeeeddeddeddedeeddedddddeededdeeeddeeeeeedeedeededdeeeddddeeeddedeeeeddddedddddeddeeeeeddddeeedddddedddeddeeeeeedeededdddddedeeeddedddeddedddedededdeeeedeeeddddedeeedededddddededdddeddeeedeeddddedeeddeddeedddeddedddeedeeedeedeeddddddddeeedeeedeeddddeddeeeededeeddeededeeddeeedddddeeddeeeedddeedddeeddddeeeedededdedeededdededdededdeedeeeddeddeededdededededddeeddeddeddeedddddddeedeeeeeeededededdeeddeededddeeeeeededdedeeddeeeeeeedddeededdeddededdedddeeeedeeeeeeddddeeededdeddeeddedeedddddedeeeededeededdededddddededddeeddeddedeedeeddededdedddedddeeddeeeedeedededeeededddeedeeddddddddeddeddeddddedddedddedeeeeeedeedddeddeeededededddedeeddddeddededdeddedeeedddeeddededeedddeeeedddddddedddeeeddedeeddddeeeedeedddeeededdddeeeeeededeeeeedeeddeddeeeedddddeeedeeeeddeddddeedddeededdeeeeedddeeedddddedeeddedddedeedeeddededeeddeeeedddeeeddddededeeededdeeededeeddeedddeddededddedeedddedddeddeeedededdeddddddededeeeeddedeeededdeeedeeeedeeededdedeeeddeeddeddeddedededeedddedddddedeeeeededededdddeedeeddedededdeddeddeedededdededededeedddedeeddeddeddedededdeeddeddedddddeddddeddeddddddddddddddedeeededdeedddeddddeeeeeeeededeeddeeddddeddeddedeeddeddeeededeededeeedeedeeeeeeddddedeeddeeddeeedeeeeedeeddeedededdededddddededdedddeeeddddeeeddedeeddddedddddedeeeeedeedeeeeedeeddeddddeeddddedddddeeeedeededdddeeeeedeedddeeededeedeeddededdeeeddeeeddeeddedddeddeedddedddeedeeeddddeedeeddddeeddeddedeeeddeddddeededdeedededddddeeddedededdddeeddedeedeedeedeeedeeeedeeeeeeeededdeddeeeeeeeddededeeddedeeedeededdeddeddddeeeddeeeedddddedeeddeeededddddddddddddddeddeddeedeeeeddddddddddedeeddddddededdeddeddeededddedeeeedededeeeeeeeddeeeddddeeeeedededdedeedeedddeeeddeddeeeededdeddddeeddddeeeeeeddeddededdedddeeeddeeeeeeeedeeddeeeddeddeddedededeedeeedddededdeeedddeeddddedededeedeedddedeeeeddddedddeddeededeedeeededddededeedddeddeddedeeeddeeeededddddddedeedddeddeddddedddddeeddeddddeeedeeeeedddeeeedddeedddeeeeeeddedeeedddeeeededeedddeededeeeedddeeedddeeedeeddeeeeeeddddeddeeeeddeeeddddeddddeeddedddededdeddddddedeeeedededeeeddedddeeeededddeeeeeddeeeedeedeeededddedeeddeeddddedddeeedeedeeddddddeeeeeedddddeddeedeedeeeddeeeededdedeededdddeeeeeeeedddeeeedededeeeedeeeddeddededdddedeeeedeeeeedddeedddeeeddeeeedeedeedeeededddedeeddddddeeededdeddeeeeeeddeedddedddeedddddededddedeedddddddedededdeedeeeeedeeeeeeeededeeedeededddeeddedeedeeededeeeeeeddeededdddddedddeeedddddddeeeedeeeedededdededdeeddddddeeddeddeededdeeedeedeedededdddeedeeddeddddededededdeeeeedddeededeeddededeeeddeeeeeeedeededdddeededeedeedededeeeeeedededeededdddeedededddeedededdeedeedddedeeeeedeedeedddeddedeedeedeeeedeedeeddeeedeeddeddeddddeeeddeddddddeededddededddddeddeeededdeeddeeededddededddeeeddeededededddedddeddddddddddedededeeeeededeeddeedeeedddedeeededdddeddeddeedddedededdeddeddededdeeeeddedddedeededdededeeeedddedeedededdedddddedddddeeeededddedeededdeddedddeddddeeeeeddeeedeededdeeeeedddddededeeddeeddddddeeddeeedeededeeeddddddeddedededdededddeddeededdeeededededddedddeeddeeedddddddeeddddddddeeedededdeeededdddeedeedededeeddeddeedededddeededddeeeeeedddeddddeeddeeeeedeeedeeddeeeeedddeddddeeeeddededeeedddeeeedeeeddeddedeeeddeeeeeeeeedddededeeeeddeedeeeeeddedddeedeeeeddedeeeddeeddeedddeedddedeedededdeeddddeeeddeededddeddddddeedddedeeeededdddeedddededdddededeeedeeeedddddeeedeeeeeddeeddeeddededdddeededdeeeededeedeeddedededddddededdeddddeedeeedeedeededdddedddeeddddddddeeededddedddeeedddedeeddedeeddeddedeedeeeddeddedededdddedddedeeeeeeeeedeeddeddddeddeedeedeededdedeededdddededddedeededeededddeededeedeededdededddddedededdeddedeeeedeeeedeeeeeedeeeddeeeddededdeddeedeeeeddeeddeddddeedddeeeeddddddeeeedededdedeeddeeeeeeeedeeddedeeeedeeddeeededddedeeddedeeeddeddeddededddedeeddddedeeeeedddeeddeedddeedddddeddddddeeeeedddeeeeeddeeeedededdeddeeeedddddededdddedeeeeeeddedeeeddddededdeddeddeddddddeedeedeeeeeeeeeedeeddddeeeddededededddedddddeeeeeeeddedeeddeeeedededeedeededdededddeddddeddedededeeeddeeddeddedddeeeeeddedeeeedeededdeeeedddeeeddeddddeedeeeddddddedddddeeddeededdddedddeedddddeeddddddeeededddeedeeddeedddedeedeeeedddeededeeddedededdeeeedddddedddedededeededddddeededdeeeddedededdeeddedeeddddeddeeeddeededddeeeeedddeeededddedededeeddeddedddddedeeedeedededeedddeeeeeddeddedeeeddeeeeededdeedededddeeeddddeddeddeddedeeeeededdeddeedddededdeddddedeedeeddeeedddeeddededededdddedeeeeeedeeddddddddedddeeeeeeddddeeeddededdddeddddddededdddeedeeeddddddeededddeeededeeeeddddeeedeedddedddeeeddedededdedeeedeeeddedededdedeedeedeeeddddeeeddeddddedeeeddedddeeeddeddeededdedeeeeeeddedeeeedddddeedeeddededeeddeeedddeeededeeeedeeddeeedddeeddedededdeeeeedddeeeeeeeedeedddeeeedeedededddddeeeeddededddeedeeddddeeeddddeeeedeededddededeededddeeddeeeedeedededeeeedeeedeedeedeeeededddeeededededddddddeeeeeddeedddedeeedeeedeeddeededdddedeeeededeedeedddeededededddeeeddeeeeeedeeddeeedeededddeedeeeddeedddddededddeeedddededededddeeeedeedeeddeeeeeeddeedeeeeeededdeedeedeeddddeededdedeeeddeddeedddedeedededdeddededddeedddeededdedededdddedeedddedeeddeddededddededdeddeeeededdddeedddeedddeedddeeeeeeddeededeeddeddedeeeeeedeeeedddddeddeeddeedeeeddddddddddeddeeeeeeededddddddeeededeeeddddeeeeddddedddddddeeededddeddddeeeedeeddeeeddeeeddedddddeedeeedeeedeedddeeeeeeeededdeeeddeeeeeeddddeeeddeeeededdeddddddeeedeeeeddeeedddedeeeeeddeedddeeeeedeeddeddeeeedddedededeeedddeeddddeeddddddddeeeededddedddeeddeededddeeeddddeedddeeeeeeeedddddeeddeeedededdedeeeedddeddeeeeeededeeeddeeddddddeeeeededeeeeedddeddeedddeedeeddddeededddededdddededddeeeeedededdeeeeeddeedededddedeedeeeeddeeddededeeeddeddeddddddeeededeeeddeddedeeeddeddededddeeddedddeddededeeddddeeeddddeeedeeeddededdeeeeedeeeeeddeeeeeededeeeeeeedeeedeedeeeddddeedddeeeeeeddedddeeededeeeedddeededededddddddddedddddddeeeddddeeddedddddeeeeddededddddeddeddddedeeedededededddeeeddeeededdddedededdeeeddededeedeeddddeddeeeedeeededddddddddedededdeedeededeeeedddeedeededddeeeeeeeddddeededdddeeeddddeededdededeededeeeeedddeddeddeededededddeedeeddededddeeeeeeeedddeddddedddeedeedeeddedeeeeeeeedddeedeeeededdddeeedeeeddeeeeeeddeddddedddddddddeeedddeeeedeedeedeeeededddeeeededdddeeededddedeedeedddedeedeeededdedeededeeedeedeedededdeeeedeedeedeedddddedeedddddeddedeedeeddededeedeedededdedeeeededeeddeddedeeedeeeeedddedddddeeedededdddedeeeeddedeedddeddedeeeedeededeeededeeedddeddddeddddeddddedeeddeddeeddeeeddedeeeedededdddedddeddddeeedeeddeeeeeedddeeedededdddeddddedeedddddddddeedeedeeedddeeeededddeedeeededeedeeddeeeeeddddedddeeedddeddddeddddeeeedeededdddeeeddedeeeedddedddddededededdeddedddddddededeeedededdeeeddeeeddeeededddddedddeededeedeeeeedddeddeddededdeddeedddededddddddddedededddddeddeeddddddeededdeddededdeedddeeddddeedeeedddedeeeededddeeddeeededddddddededeedeedeeddddddeeddeddeddeedededededdddedeeeddddeeedddddddedededeeeeeddddedeededdededdeeeeeeddeeeddeedeeededddddeddeedeedeedddeeedeeddeeeddeedededdeeedeeedeeeeedddededeeddddedddddededddeedeeddedeeddeddededddddeededdeeddddddddeeddedddedededeeeeeeeeeedededeeeddeedddeddeddddedddeedeeedddeeddedddddddeeedddedeeeeeedeedddeddddeeeeddddddedeeeeeeeddddddedededdeedddeedeedddeddddeeeedddddedeeededdededddedeeeddddeededeededeeeeedddeeddededeedeeedeeedddddedddeddeeedddddddeeeeedeeeddedeeddeddddddddedddeddeedddddedededdeededeedddeddddddeedeeeededdededddddddeededeedddddddddeeeedeededdddeddeededddeededeeedeeedeeeeedeedeeededdedeedddddeeddedeeedeedeedddeeeeeeeddededddededddddddeddeeeeeedddeddddeedeeeddddedeedeeddeeddeeeedddedddeeedeeedeeededdeddededddedddededeeddeddddedeeeededdeededeeededddddeedddedeeeeeeedeeeeeeeeddeeededdddddedeeddddeededddddededddedeeeededeeeeddddeeeedddedddeeeddddedeeeddeddeeedeeeededeedeeedeedeedeeeedeeeeeddeeeddddeeedeeddeeeedededeeededdedededddedddedddddddeeddededddeeeedddeeeeedddddddeddddeeeeeddededdeeeeedddeeeeddddeededdeddddddeddddedeeededddededeeedeeddeddeededddddedddedeeddeddddedeeddeddededdededdeddeeeeeddedeeddedddeddeeddeeeededddeeddeddddeddddeeddddedddeeddeeeeeedeeeeddedeeeededeedeeddeededddeededdeedeeeddddeedeedeeedeeeeeddddddeeeddedeeddeeeedededdddddedeeddddeddedeeeededeeeededddedeedddeeedededededddeededeeddeeeeeeeeedeeddeddedededeedddeedddedeeeeeeedddeeeeeddddedeeedeeeddddddddeedeeddeeedddeddeeeddeedededddedeeddeeeedeededdddedeedddddeededeeedddeedddeeeddedeeedeeeeedeedeedddedeeedddeddeeeddeeddeddddeeeeeddeededeeeddeeeeededdeeeedddeeedeededeedddddededdeeeeededdeeeeeeedddeddddeededdddedeeddedeedeededeeddeddeeedeeeeedeeddddedededeededddddeeeeeeeddeddededdeeeddededdeeeddeeeeddeeeeeedeededdeddddeeddeeeeedddeeeeeddeeddedddddeeededdeeededdeeddedeeedeedeeeeeeeeedededeeeeeddddeddeeeedeeddddddedeededdddededeeeeedeedddeedeededeedededeeddeeeddedddddddeededdeeedededeeddddeeddddeddeddedeedeeeddeedddeeeedddddededeeddeddeeedeedddeedeeddeeddedddeeddddedeedededdeeeddeddededdeeeedeeeeeeddeeddedeedeeeeedeeddeeddedddedeeddddddeeeddddddeedededdedddedeededdddeeeeededeededdeedeedeedddedddddeddddeededddedeedeeeeeeddddeddeeddedeeddddddddedeeddededddeeededddeeddeddddddddedededdededdeeededddeedddedddeeddeeeededdddedeeeeedddeedeedeeededdeddeddeededededeeddeddddeeedeedddeddeeddededddddeededdedddddddddeedeeeeddeeeedeeeedeeddeeedddeddddeedddededdedeeddddeeeddeedddeeddeedddeeedeeddddeeeedeedeeddeddeedeedddeddeeeedeedddeedddeeeeeeeeeeedddeededdddedeedddddeedeeddddeededeeedeeeeeddeeeddddedededededdededddeeddeeddeeddededeeedeeeddedededdddededeeeedddddeddeeeeddddddeeedededeedeeeeeeeededeedeeeddeddeeddddddeddedeeeddeeddedddeedeedededeedddeedeeddededeededdddddededdddeeedeeeddedededdeddeddeddddddeddedddeddedeeddeeedddededeeddddddddedeeddeedededededededdedeeeedeeeddeddeeddddeddedeedeeddeddededeededeeeeddeedeeeeeeddedddeedededdedededdeedeeddeededdddededdddeedddeedddeeddeddeeedeedeededdeddeddedeeeeededddddeeeeeedededdeeddddddeedddeeededddeddeeeeeedeedddeeedededdededddedeededdddeddddedddddeddeeedeededeeeeeeddedeedeededdedddeddeeeeeddeeedddededdeedededdeededededdddddeeeddeeeeddeeddedededdeeedeeddeeeededdeddeeeeeeeededededeeedededeedeededddededededeedeeeddededddddedddeddddedddddddeeddddeddeedeeeededddddddeddeddeddddeeeededeeeddedeeedeeeededededeeeeeeeededddddddddeedeeddddeeedeedededeededddeeeeeeddddeeeeeddeeedeededdddedddeddddeeeedeeeeeeeedeedddeedddddeddedededeedeeededddeddeeeeddeedddeedededeedeedddedeeeddeededddedeeedededdeeededdeeeddddeeddddeddeeeeedddeeededdddeddedeeeededdeddddddeedeeeedddedddeedeeeeddddeeeeeeeeddddddeeeeddedeeedddeeededdeddddeededeeeddedddeddeeeeedddddeeeeeddddedeeeeeddedeedddededededeeeeddddddeddddeeededeededdeeeeddedddeeeedeeddeeeeeeeeededeededededdeedeeededdededdedeeddeeeeeddededeeeeeeeedddedddedeedededdeedeeeededdeddddddedeeededdddeedddedddeedddeeedeededdeddddedddeedeeeeeddddeddedddeedeeedeedeedeeeeedddededdedddeeeededdedddeeeddddddddededdddeddddeeedddedededdddddedddddddedeeddeddeedeedededeedeeedddddeeedddddeeeeeddedeeeddddeddeddeddddededddddddddededddeeddddedeedddeeeedddddeddddddeedeedeeedeedeeeeeedeeddddeeddeedddedededdddddededddeeeededdeeddddeedddeeedeeeeededeededdedeedeedededeeeeeeeededeededdddeeeedddddeedeeedeeedeeddeeeddeeededeeeddeeeedddeeeedeeedddeeeeedeeeeeeddedddedddededdedddddddededddeeededddeddeeeddeededdeeedddededdddeedeeeeededeeeddeeedeeedddddddededeeededeeeeddeeedeedeeeeddedeeedeedddeeeeddeeedeedededdeedededdededeeeddedddedeedeedddedeeeededededdededddddddeeddeddeeeddeddddedededeeeeddddeddddeeeeeeeeeedeeedddeedeeddeddededddddeeddddddededeeeeeededeeedeeeddeddedededeededddedddeeeddeeedededddddedddeeedededddddeddedddddeedeeeeededdededededdededededededdddddeedeeddeddedddddeeeededddeeddddeddeeeeedeeddeeededeeedddeddddeeeeedededdeeddddeddeeeedddddddedeeedeeeeddeeeededdddedddedeeeedeeedeedeeedeededdddeedddeeddeededdedddeddedddedddeddedeededdddeddddddddddeededeedeeedeedddededdddededdededdeddeededeeedededddedddddedeeeededededdeededdeeeddedddededeeeededdddedddededdeeeededddeedeededdedddeeeeddedddeddeeeededededeeddddddeeededeedeeededeedededddededdddeddedeedeeedeeedeeededededeeedddeeeeedeedddddddededdedededdeedeededeeddddeeededeeddeeedeedeeddddeeedededddeedeeedeeeedeeeeeedeeedeeeeddeeeedeeeeedeeeeedeeededdddeeddeeeeeedeeddeeeddededdeeeedddeedeeeddeeddedeeeedeedeeeededdddddeddedeeedeeddeedededddedeeddddedeeeeeeddeeddedeeddeddddeeddeeddedeedddeeddeeededdededdddeedeeedddeededddeeedeedeeeededeeededddedeeeeededdddeeddeeedeedeeeeeeedeedeeededdeeddedddededdddedddeeeeeededdeddeededeedeeedeedeededeeddddddedddeededededeededdeddedeeedddedeeddeeeeeddeeeeddeededddeedededdddeededdedddddeddeeeeedeededddddedddededdeeeeddeddddedeededeeddeddeedededdededededeeeeededdddddddddeeddddeddeddeeeeedddededdeedeeddeeeeeddedededdededeeeeddddedeeeeedeeeededeeededeeeeddededededddeededdddddddeeeededeedededeedddedeeeddeddeeeeeddeddeeeeedeedeeedddeeeedddddeedddeeedeedeededeeddeedddededeeddddeedeeedddeeddddedddeeedddededeeeeeeededeeeedddeededddeededeeeddeeeededdedddededddeddeedddeeeeeddddeedeeddedeeeededddeededdeedeeeeeeeddeddeddddeeddddeededdddeeeeddeeddedddedeeeeeeddeddddddddeedeeddeeeddeddddeddeeeedddededeedddeedeeedddeddddedddededeeddeeddddedddedeeeddeedddeedeeeedeedeeeedeedededdeeeeeedddeddddeeeededdedeeddddeeeedddeeddeeedeeededdeededdedeedeeeedddeedeeededddeedeeeeeedeeededeeeeddedeeedeedeeeedeeddeeededededddddedeeeeeddedddeeddeddddedeedddededdddedeeeededeedeeddddeedeeeedddeeeedededddeddddeeddeddedddeedeeedddeddeddededeeeeedddedddddeddeeededdeededddddeeeedeeddedeeededdeedeeeeeddddeeddddeedeeddeddeeddeededddeedeeeeedeeddeeeddededeeeeddedddeeeedddeedeeddeededededededeeddeeeedededeedeedeedddeededddeeeedeeededeeddeddeddeeeeeeeeeedddddeddeeddeeddedddddddeedeeddeeeeedddeddddddedeededeeeddeeeedeeeddeeddedddeeedddededdddddeededdddeeddedddeeeddddedddededeeddedddeeeeeeeddeddeeeddeeeeeedddeedededeeedeededddeddeeeeeeddddededddededeeedededddedeeddeedeedeeeededdeeeddeeeeeedeeddddddddddddddeeeedddddeddeeedeeededddeeeeddeeedddeeedeeddeddeeeeddeeedededddeeddeddddddedeeeeeddeeddeeeddddedeeeeededdeedeeddedddedddeeddeedddeeeedeeeeeddddededdedededdededeeedeeedeedeeeddeededeeededeeeddededeeeddeddeddddddeeeeddeeeeddddededddedddeededddedeeedddededeeeeedddeeeedddeeedeeeedeeeddeedeededeeeddeeeeeeddeeeeeeeedededdeddeeeeddeeedeeeeeedddeddeeedeedeeeeddddddedeeededddddddeddddededeeddddedddddeddddeeededdddddededededededdeddededdeddeddedddeedeeedddedeeddddeeedddedeededddddedeeeeededededddddddddddededeeeedededededdddeededdeeddeeeeeeededdeddeeedeedeedeeeddeeddeeddddedeeedeeededdedeeddedededddeededddedddddeeeedeeedededdddeeddeededdeedddddeeeeeedddddedeededeeddeeeeeeeeeeeeeeeedddddddeeeeededdeedddddeeddddedeedeeeededddededdededdeeedededdeeededdedddeddeeededdedeedeeededdddedeededdedeeddedeedeeeedddedeedddddeddeeedeeeddededdeeddeededeedeedededeeddddeedeeeeeeeeeededdeeedeeeddddeddddddeeeddededddeeddeddeeddeedddededeeddeeddddddeeedddeddedeeeeeddddeeddededdeeeeeededededdedededdddeeeeeeddeeededdddeeedededdddeeddddddeededddeddeedeedeeeddddeeededddedddeededeedddddeeedeeddeddddeeddddededdedddeddeeeeededddddeeeeddeedddededddddedeeddeddedeededdddeedededededeeeeeeddeeeddeeedddddddeeeddededeeeeededeedeeeeedddeddedeeedddeeedeeddddededededddddedeeededeedeedeeedddededddddedeedddeeededededededeeeddededddeedeedddddddededeeedeeeddeededeeddedeeddeddedddededddddedeedddeeeedddddedeeededeededddddedeededdeedddeeedeeedeeeedeedeedeeddddddddeededdeddedeeedeedeedddeeeeededdedeeeeedeeeeedddedededddddeddedddddedddededddeeeeddeddedddddeeeeddeeddddddeeddeedeeedeedededeedeeededeeededdeedeeedddedeeddddedddeeddededeeeeeeedddddeeeddddddddeeeedeedddeddedededdededdedeeeeeeeedddddededdeddeddeeddeedddedeeeeedeededdedeeddeddededededeeeeeedeedddeeddededeedededddeeeeeeeeeedededddededddeddeeedddeddddeeeddeeedeedeedeeddddedeeedddeddeddddddededddeeeeedeeddeededdddedeeeedeedddddddedddedededeededeedddeeededdededdddeedeededddeededeedddeedeedeeddddeeddeddededdddddeeddedededdeddededdddeeedeeededdeededddeedeeeddeeedddddedddeeedeeeddddedeeddedddedddeeddddedddeeedeeedeeeddddeeeddedddededededddddddeeeededdddddddddedeedeeddeedeeeddeeeeedeeeeeedeeededeeeededededdddeededdeedeedddeddddddeddededdddddddeedeedededdeddededddeeeedeededdeeedeedddedeeeeeeeeeddededeededeeeeddedddddeddeeddeeeeededddeeeedddedddedddededddddddeddeddddedddeddededeeededddddddeeeddeeeeeddedeeeedededdeddeeedddeddeddeddddddeddeeeeeeededddededeeedeeedeededdedddeddedddddddeddddddeeeddeedddedddeeddeddeeeeeddedeedeedddeddeedddeeededddeeedddddeededededdddeedddeddeeeeeeddeeeddedeeeddddeddeeddeeeeddedddeedeeddedddddeedeeddeedeeeedddddedeedddeddeddedeeddedeeedddedeeeeedeeeedeeeededeeeededdeeededddeeedededdeeeddededeedddeeeddeeeededddeddeddeeedeeddeeddedeedddeeededeeeeeddeeddeeedeedddddeddeeeeedddeeeedeedeeeededddeddeddedeeddeedeeeeddddddeddeddddeeededeeeddededddeeeeedddeedeeeeeddedeeddddeeeeeeddddeedddeeedddddeedeeeeedededeeeedededededdeededddeeeddededdededddeeddddeddededeeeeedeedddddeeddddeddddddedededeeeeedeeeeededddeeeeeeeddeededdddededeeeedddddedeeededddddddedddeeddedeedeeedeededddededeedeededdededdeedeeddeedddeeeeeddeeddeddddddeeddddeeedeeeeeddeeeeedeedeedeeeeeedededdeedededdeedeeeeeeeddddeeddeeeeddddeeeeeeeeeeeeeddeeddededeededdededdeeeedeeedeeddeeeeddeeedededdedddeeddeddeeeeddeeeededdedeeddeedddeddddededeedddeeedeeeedddeeddeddeeededddeededeeddddddeedeedddeddedddedeeedeeeddeddeeddedeeedeeeeddeededdeedddedeeedededeeeddddddeedeeeededddedeededdddeeeeddeeeeeeddedddeddeddeddedeeedddddeeedededeededdddedddddddeeedeeedddedddddedeededdededeeededededddedddddedeededdddededddeedeeddeeededddddeeeeeeeeeddddededeeedddeddeddeeedededdeedeeeeeedeeededdeedddedddeedddeddeddddeddddeedededdedddededddeeedeeedeeeeededeedddedeeddddededeeeeedddeddedeeddeddeddeeedddeededeedddedddeededeeeddeedeeedddddedeedddeddedeeddedddedddeeeeeeedeeeeeddeddedddeddddeedddedddeddddeddedeeedeeeeeddeeddddeedeeddededdededddeedeededeeedededeedddeeddededdedddededeeeedddededeeededddeddeeddeeededeeeddeeeedeeeddeededddeeeeddeddeddddeeededeeeeedededdddeeedeeddeeededdeedeeeedeedddddddedddeeeedeeeddeeedeededddddeddddddededdededddeeeddeeedddeeeeeedeeedeedededddeeeededededededdddeededeedddedddeeddeeededeeddedeeddeddddedddeededeeedeeeddedeeddedeeededdddededddedddeeeeddddeeedeedddeedddeddddeddeeddeeddeeeeededddededdedeeeededdedddeeedeedeeedededdeeddeedddddedddededeeeeeeededeedededededeedeeddedeededddddedddeddeeeededeedeedeeeeeededeedeededeeddedddeeeeededdedeeddddddddeeeeddddeedddedeededddeeeddedeeddedddededeeddeeddedddeeeedddedededeeddeeedeeedeeeeedddddddededddededddddeedeeeedededddedddddddddeeeddeedeeeeddededeedddeddeedddeededeeddeddddeeeedddedeededeeeeeeeededeeedddeeeeeededdedddddddeddeddddeeddeddededdeeedddeedeeedddeeedeedeeeddeededdddedddeddedeeeeddeeeedeedededddedddedeeddddeeeeeeeeeeeddeeddeeeeedeeeeeeedededdededddeeedeedeeeeededededeeededeedededdededdddeeedededdeededddddeededdddedddddeeeeedededddddeededdedddedddeeedeeeddedeeedeeeededddddeeeddddeeddddeeededddddddeededeeeddedddeddeeeeeddeeddedeeeeddeeedeeeddeddeddeeeededddeeeeededdeeddedeeededdddeedeeedeeeedeeeedeeeddeddeeeeeeddeeddedeededeedeeeddddeeedeedeeddeeeeedeededeeedeeeedddddddedeedededdeedeeeededdeddddddededddddeeeeddddddddeeddedeedeededdedddeddddeddeeeeedeedddeedddeedddeeededeeddeeedeeedddeededeeeededeededdedddeeddddededdddeeddddeeeddddedeedddeddddedeededeeddeddeddeedededeedeeddddddddedddddeeededeedeedddddeddedeededeeeedddedddddeddddddedddddeededdeddedddddededdddeedeedeeeeddeeeeeeeeeedddddeddeeedeeeededdedddedddeeddedddddeeddddeeeddededdeeeeedeeeeeddedddeeededeeeddeeeeeddddeeeddddeeeeedeeeeedeeddeeeeedddeeedddeedededddeedeededeeeeddeededdedeededeeeededdededddedeedddddddddddeeddeeddeeeeedeeddedeedeedeeedddededdedeeddeedededdedddeeedeeeddedddeeeddeeeeedeeeeddeeededdedeeeddddedeeeddeeeeeedededeededeedeeeeeededdedeeddeeddeeeeeeeedddddeeeededededdddeeddddeeeddeeeddeeddeddddedddddeeeedddeeeeddeeedeeeededededddeedeeddeeededddddededdededededeeeeeedeedeedeeedeeddddddedeedeeddddedeeeeddeeddddededdeddddeedededddedeedeeedddeeddeeeedddeddeedeeddddededddedddeddededeeeddedddddeeedeeededeeeeddddeddeeeeeddeddeeedddeededdeedddedeeedededdeedddddddeeededddedeedeeededdeddeeeedeedddeddeedeededededeedeeddeeddddddeedeeedddeddeededddeededddeeddeedeededeedddeddedddddeedeeeededeeeededededeedddeeedddeddddddeddedeeedddddddedddddedeeeeeeeedeedeeeeddeeeddeeddededededddddedededeedddeeeeeeddddeeeddeededddeeedeeeeddeededeedeeeeeededddddedeeedeeddeeedeeeeeddeeddededdddeededeedeeddeeeddeeeededeeeeedededeeddeeeddedddeddededddeddeddeededdeddddeddeeeeedddeedeeeeeedddeeddedededeedededeededeeeeeedeeedeeeddddededeeedddedededddedddeedeeededddeedeeddeeeddededeeeeedddeedeeeddeedeedeeedeeedeededeeddddddddedddddedddeedededdeededddddeddddeeeddeedeedeeeddeddeeeddeeededeedddeedddeeeeddededdedeededededeeeeddeeeedeedeeeededeeedededddeeedededdddeeeeeeddeedeedededdeddeeeeeeddeddeddeeddededededeeeddedddeeddeeddddeedeedeeeeeddeeeddeeddedddeeeeedeeddededdeddedeeedddedeeeedeeeddedeeeddeeddeeeeededeeddeeededdededdddddeeeeeeeededeedeedddededeeeedddedeedededdedeeddeddeddededddeededeeeeeeeeeddddedddddeeddddeddeddeeeeedddddeddeedddedeeedeededeeeddedeedeededddeeededeeedeededeeedddeeeedeededddeedddeeededdddddedeedeeeeeedeeeedededdeedeeddeeeedededddeededeeeeeeddddeeedddddeedddeeddeededdedeeddeedddedeeeeedeeeeddeededeeddededdeeeddddedeeeeeeeedddedeeeedeeedededeededdeededdeededdedeeddedededdeeedeedeeeddddeeeeeddeeeeedeeeddeededddedeedeeedddeddeedddeededdeeddddddeeeeddeeddedddedeeeeeeededdedddedeeeeeddeeeddeddddddddeeeeddededeeddeeedeeedededdddeddddddededdeeddededddddeeddeddeddedeeeeededeeeeedeedededdeeedddddeeddededdeeedddededdededeedddedddeeddddeeeededdedeeddeeedededddedeeedededeedeeddeeddeededeeeeddddeeeeeeededeeeeedeeddedeededdddededeeedeeddeeeedddeddeeeddededededdddeeededdeedeeeddddedeeeeeeddeeedededddedddeeeddedddeddeedeeddddedeeededdeeeeeedddeeddddeddedddedddedeedddddedeeeeddedeedededededdeeeddddeedddeeeddeededdeeeeeddedddeddeeeedeeedeeeededdedeededdeddeeeeedeeeddeeeeeedededeeeeedeeeddeeedeeeeeddeedeeedeeededddeedeeeeedeeeeddeededdeedddedeededdddeedeeedddededddddddeedeeddedeeedddededdeeedeedeeeeeedeeeeddeeddeeddeddddddddeededddeddedddddeddededdddeeedededdddddededdddddedeedeeededeedeeeddddededeeeedededeeedeedeeddeddeddeeeddddddedddededeeeeeddeeedddededddeedeedededededddedeeeededeededdedddedddedeedddddeededeeeedeeeeeedeeddeeeeddeeededddeddeedeededddeeddddeeddddeddeeddedededeeedeededeedeedededdedddedeeedeeedeeddeeddeedededeeeeedeeddedddeeeedddeddedddeeedeeeeddddeeddeeeedeeddeeeeeededddeeeeedddddddedddeeeddeddeedddddedddedddeedeedddeededddeeedeeeeededeedeeddeeeedddedeeeeddddeddededeededeededdeddeeedddddeddeddeeeeddeeededdeedddeeedeeedeededddeedddeddeeddedddeeddedeedeeededddededdddeededddedeedddddeeddeededededdeddeedddedeeddddddeedededdeeeeedddddeeddeeddddedeeddddeeeeededddedddededdeddeeedeeeedddedededdeeeeddddeeedddeeeeddeddeddeeedeedeedeeddddeddeedddeeededdeeeddddedeeddedeedededdeeddeeddddeededdedeeedeeeddeeddeededeeedededdeeeeedddddedddddeeeededeeeeedeedddedeeddeddddeeeededdedddedddeddddddedddeeeddeddddeddededdddddededdeeeedddeedddddeddededeeeedeeedeeddeededeeeeeddeddededeeeeedededeeeddedeedeeedededdededdeeddeeeeeeddeedeeeddededeeeddedeeeedeededeeeeddeeedddededdedeeddddeddedededeedddddededeededeedddedddeeeeeedddeddedeedeeedddeeedededddeeedddeeeeeddeeedddddddeeeeeedeeeddddeeeeedeeddddddededdedeededededeeeddddeeededdedddeeedededdeeedeeeddeddeedeeddedeedddddeedeeeddeededdeeeeedddddddeeeedddeddeededddddedeeddedeedeedededdeddeeddeddddeeeeeddededddeedddddddeeeddddddedeeededeedeeeeedddeededeedddddeeeeedeedeedeedeeedededeeedeeeeddddeeedddededddddeeeedddedededdeedddedededeededeedededededdddeeddeeedeeddeeededdeddedeedeedddededdedeeededdeeddeddeddedeeddeededeedddeeddeddededeeedeedeeddeededeedeeeeededddddddeddeeedddddeeeddeeeeedddeeeeeedeedddeeeeddeeedddededeeedeedeeedeeedededddeeddddeeddeddededddddeeeeedeeddddddeeedeedeeedededdeddeddeededdeededddedeeeeedddeddedeeeedeeddddededeeeeedddddedddededddddeeeddeeedeedeeededdededdedeeeeeeeededeeedeededddededdddedddedeeededdededddededeeddeeddedeeeedeeedddeddeeddeddddddeddddeeeeeeeeeeedddeedeeeedddedddeedededdddeeddeeddeeeddddedeeeeeeeeeeededeeddedddeddddeeedeeddeddeddeddeeddeedddeededddddedddedddeeedeedeedddeddddedddedddddedeededededdddeedddeedeedeeddddeeddeedddddddedeeedddeededdedddeeddddeeddeededddeededddeeeeeeddeeedddddddedeeeededededddeedddeddeeddeedddddedeedddeedeeddddeeeeeddedddeeeeedeedddedeeeeeddddddddeddeddeddeeeeeedededddeeeedeededddededdeeddededededddeedeedeeeddedeeeddddddddddddddedddddeedeedddeddededddeedeeeeddedeeededdeeddddddeedededdedededdddeddddeededddededdeddeeeeeddeddeeeeedddeeddeddeeeedddddededddedddeeddedddeedededdddeeedeeeeddeeeedddeedeeddddeddeddededeeedeeddeededdddddeeeeeeeedddeddedeeedededeededdddededdedddedddedddeddeeedeeeedeedddeddddddeedddededeedededdddddedddeeedeeedeeeededdeedededeedeedeeddedeeedeeeedeededdeeeddedeedddededdeedeedddeedeeddeddeddeeddeededdedeededdeeeeedeededdddeddeddedeeeedddeeeeeeeeeeeeddeedeeedeedeedededeedddeeddddedededdededeedddeeedddeddddddddededdeeedeedeedddedeedddeeddedeeddeddeeddeeeeeddeeeeeddeeeeedddeededeeeeeeddedddeedeeeedeeeeeeddedeeddedeeddeedddeeeeedededdedddeddeeeedddeeddeeeeedeededdedeeeeeeddededddeeeedddddeddeeeeededddedeedddddededddedeeddeeeddddeddededddeeddeddddedddeedeeddeedddeeeddddedeedddddedddeeeeddeedeeddeddddeedeeddeddeddddedddeeeedddeeddedddedddeddeededeeddeeeeeeeedeedddeeedddedeedeededdedddeeeeddeeddddedeeddeeddededdededddeeeeddeeeeeedeeededdeddedeeeedeeeeeddeddddedeeedeedeeeeddddeeddddedddddeededddeeedeedeedddeeeddeeeddededdeededdeedeeddeeeeeeeeeeddeddddddedddedeeeeeddeedededdedeeddeddddeddddedddeddddeedddeeeeeddedddddeeededededdeeeedddddeeeededdddeeddddedeeedededddedeeddeeeeededeeedeeeddeeeeedeeedeeededeeedddddddddeededeeddeeddeddeddeddddeeeeeeeddedddedddededdedeeeeedddeedeeddddddeddddededddddededdeeddeededddeeeededdedededdddeededddeeddddeeeddeeddeddeddddeededeedeeeddeedeeeeeeeeededddddddeeeeeeddedeeeedededdeddeeeeeedeeedeedeedddeddddddeedeedddddededeeedededdeddeededdedeedeeedeeeeddededdddedeedddeeeeeeeeeeeddedddeeedeeddeddeeddedeededeeedddddddededddedddededeeddddeeeeeddeededeeedeeddedededeedeedddededeeddedddededdeedddeddddddddeddeeddeeeeededeeddeededddedddeeeeedeedeeddeedeeeeededddeedddeeeedeeddedddddeedeeddedededeeededdeedeeedeeeedddededdedddddeedddededddeeeeededdedededdededeeeeededdddddeeedeeeeedddedeededeeeedeedddddddeddeeededeeeddeeeeedddedeedeedddeededdeedeedeeeeedeedddeeeeeeeeeeeeeeedededddedeedddeedeededdeededdededdeeddeedededddeeddddeeededdddeddeeedddeeeeddeddddeeddedeeeddeeddddddddeeddeeedededeedeeeeddedddeedeeedddeedddeddedeeeeededeeeedeeededdeddeddddeedeedeeededdeeeedeeededddeeddededeededeedddeededeeeeddeedeedddeeddededddedddeedeeedeeddeeeeeeedeeddedeeedeeddeededdeedeeeededdedeeeedddddeeeeeededeeeddeddededdeeedddededdddddddedddeddddddedddeeeedeedeedddeeddeedeeeddeeeedddeddddeeddededeedddeeddddeedeeeeddeedddeddddeeeddeedeeeeddededdedddddeeedeeeedededddeeddededeeddedeedeeeeeededdddeeeeedddedeeeddddededdddddededdedeededdeeddddeeeeededdeeeddeeeeddedeedddeddeedeeeeddeddeddddedddeeeddddddeeddeeddeddeddedeeeedeeddeeededddddeeededeeeededeeddededddededdedeeeeeeeddeeddededdeeddeedeedededdeeedeeeeededededddeddeedeeededddeeeedeededddddeededdeddeeeedddedddddeedeeedeeeddeeeddddededdeedddddddedededdddeedeeeeedddeddddedeeeeeddeeddedddeeeedeededdeddddeddeeeeeedddedeeededeeedeeeeedeeddddeededddeedeeededdededddddddeeedddedddeddedeeeedddeddddeeedeeeeddeeeeeeeeedeedeededeeddedeedededdddedededdededdedeedeeeeededddddeeeddddddddededdeddddeeeedededeeddddddeddeedeeedddeedddeeddddeededdedddedeeeddddeededeedeeddeeeeddedddeeddedededdddeeeeedeeeddddddeeeedeedddedeedddeddddedddddddeeeddededdedededdeededdededededdeeddedddededeeeedeeedddeeeeddeddddeddddddedeededeeddeededdedeededeedeeeedeeddeedeeeeeeeeddeddeeeeeeeeeeeeddeeddddddeeddeddddeedddeddeeddddddddedeedeeeeddededdeeeedededddeededddeddeeddeeeeeeedeeedddeedeeeeeddddededdddedddeddeeedeededeedeeddededdeddededeeedeeddedeeededdeddddeeedddedeeededeeeeeedeeddedeeddeeeddddeededdededddeededeededdeeeedeeeeeededeeedddededddedededeedddeeddeeddddddeeeededeeeeeedededdeedeedeeeeededeedeeddedddeeedeedeedddeddeeeedededddddedddeeeedeeeeedddddeddddeddddeeeeedeeeeeeededddeeeddddddedeedddedddeeedededddedeededeeededdedeedddedeeeeeedeedddedeeeeeddeeddeedeededdddedededededddeddeddddddeeeeedeeeeeeeedddeededeeddeedeeeeddeddedddeddeddedddeeedeedddedeeedddededeeeeededdeddedddedddeeeedddeededdeedeeededeeeeeeddedeeddddeeddeeddedeeddeeddddedddeeedeededdddeedeedededeeeededdddddddeddeedeeeddeeddeeddeeeeeddeddeeeddedeedddeedddeeeedededeedeeeedededdedeeedddeeededeedededdddddeddedeeeedddedddddeeddeeeeeeeeedeedddeeedeeddddeddedeeededededeeededeedddeeddeedddddeddeeededdeeeedeeeedeeedededdeedeeeddddeddeddeededdeeeeeeeededddeededeedddeededeedeeddeedddddeedeedeeeedeeddeedeeeedeeddddddedeedeeededdeededddddeeeddedededddedeeeedeeeddeededdededeededdeeddeeddeeeddedeeedddeddedeeeeedddedddeeddedddeedeeeeeddddedeeedddddddedeeeedeeeddddedddededeeeededeeededddddededddddededddeededdeddedeeeedddeeedeeddddeedeedeeddeeeddeedeeeddeeeeddeeddeeddddeeeddddedededeeeddddeeeeededeeeededddddededededeeeeddeeedeeedddeeeeeeddeeddeededdddddddeeeeedddddeddedddeeedeeeeeeddddddeededdeddddeedeedddeeeedeeeddeeedededdeededeeedededddeeeeeeeeedddddeedeedddedeeedededdeeeeddeeeeddeddedddedeeeedeeeeedeeeddedeedeeedeedeeeeeddddeeeedddeddeeeeeddededdedeeddeededeeeddeeeeddedededdeeddddeeeeeddedededdddeeddeedddedeedddeeddeeddeddeedeedeedddeededeeededdedddedddeedddedeeedededddeeededdeedeedeeddeddededeeddeeeddeeeeeddeededeeddddeedeedeedeeeeedddeeedddeddedeeddeedddeddedddedededdeeededeededdeedededddeddddededdddedeeedededdddedeeeedeeedddededdeddeededddedeedeeeedeedeeedddeedeedeeddeddeeeedddeeeeddeeeddeedeeedededdeeedeeedddeedddededdedddddddeededddeededddedeeddeeeeeddeedeededeedddededdedddeddeddededdeddddddeeeeddddeeeeddddedeedddedddeeedeeeedddddedddeddeedddeeeddeedeeeeeeeededededdddddddeeddeedddeeddededeeeeddddeeddedddeddeddeeeedddeedeedddeddedeeededeeeedeedeeeeeddeeddeeeedeededdddeeeeeeeddddeeeedeeddeeeedeeddeedddeeededdeeeeedddeddeeddeededededdddddededdededdededdedeeedeedddeedededddedddeeeddedddeeedeedddeedeeeeeeeedeeeededdeeedddddeeedddedddedeeeddddddeedeededdedededededdeedeeeeededeededdeeddedeeeeedeedededeeeeedeeedeedeeeddedeededeeddeeeeddeeedeedeeeeeddddeededeeeeedeeddeeeeeddeeddeeeedddedddedddeededdeeeeddeeddddddddeddededddeeeddeeeddedddedeeddeededdedddeeddeededeeeeddeeeedeeeeeededdeeeedeededdedddddeeedeeeeddededdeeddededdddeeeeeeeddedddededdddededdedddddedeedddeedddddddeeeddddededddeedeeeeeeeeddeddddeedddeeedddddedeeddeeedddededddeedeedededededededeeeeeedeeeeddeddeeeddddedededeeeeeddeeddeeeeedddeededeeeeeeedddddeeeeedeededdedededdeddddeeddeeddedddedeeddeeddeeeeeedddededddddddeeedeedeeddededdeeeeededeeedededeedddeeedddededdddeeddeeeeddedeeedeeeededddeeeeeeddddedddeededdeedeedddeedddddeededddedddeddeeedeeeddeedededeeeddeeeedeeeddeeddddeedddeeeeeeddddedeeddddedddddddededdeeddddddeedeedeeeeedddededddedddededededededdddeeeddedeeeddeeeeeeddeeeedeeededdeeddddedeedeeddedeededeeeeddeedeeeedddeddeedededeeddddeedddedeededededdddddeedeeddddddeeddddeeedededdddedeeeedeedeeedeeededdeddededeeeeeeddddeeeddeddeddededdddeededddedeeddddeedededdeeededdeeedddedeeededddedededdeedeeddddeedddddddeeeddeedeeeeeededdeedeededdddddedddeddeddddeeeededededddeedddddeeddeeeddeeeeeeddedddeeeddddddddededeededededdeddedeeeddddeeeededeeddeeededdedddededdeeedeeedeeddeddedeeeeedddededddeeeeeeededddeeeeededdeededdedeeeddeeddededeededddeeeeddeedeeeedededeedeeeedeeeeedeeededeeeddededddddeddeeedeededddddddededdeededddeeddeeeededdedddedeedeeededdeeeddddedeeedddeeeeedddeeeddddedddedeeeeeddddeeeeddddedeededededdeddedededeeededddedeededddddddeedededddeedddeddeddeedeeddedeeedddeeedeeeedeededdedededdeeeddddeedddeddeeddddddeedeededeeeeedeeeeddedeeedddddddeededededddedededeeeeeeeeeddddeddeeddddeeeeeeeeedeeedddeddddededeeedeedeedededeededddededeeeedddddeeddedeededdeeeededeedeedddeedddddededeedddeededededeeeeeeeddededeeddeeededdeedeeedeeddedededdddeeededdeeeeedddeeeeeeedeeedddddddeeeeeedeeeeeeedeededdddeedddeeeeeeededededddeedeeedddddeedddeeeeedddeeddeedeeeddeeeededeeddeeddedeedeeeedeeeeededeeedeeddddeeddeedeeeedeedeeeeedeeddedeeeeeddeeedeeededddddeddddddddeddddddddeddeeedeedeeeedeeeedddddeeedeeeeeeedeeedddeeedddddeeeddeeeededeeddddeedeeeddddeededeeedeeeddededddededdedeeeeedeeededdeeedddedededeededeeddededeeeeddededeededdddddeeddeedededdeeddeddeedeeeddededdddedeeeedededddeeddeeeddddedeeeeeeeedeeedeedddededdededeeededededeeddeeeeeddeedddedeedddeeeeeeedddeeedeeeeeedeeddddeddeddddddededdddeeedddedddeddeeeddeeddddeddededddddeeeeeedeedeededdeeddeeddddeeddeededededeededeeeededdeeeddededdededeedededeeddededdedddeedeeddeededeedddeedeeddedeedeeddeddedeeedededddedeeeededdddeddeddedddddedeeeededeeededdededdedddededdeeddeeededeeededdeeeeededeeeeedddeedddddddededddddeeeeeddeeddeeedddeedededddeddeededededdddddeedddeddeddeedddeeddddeedddededdddeddeeeeddddddeeeeededeedeeededeeeddeeededddeedddeeeddddeeeeddddddeeedeeeedeeddddedeedeeddddddeeddddedeeededdeeeeedddddeeeeeddeeddeedeeddeeeddeedeeeddddeeeddeeededdeedddeddeeeeedeededdededeededdddddedeeddeededededddeedddeeeeeeddeededeedeeeeddeeeedeeddddeeeddddedeedeedeedddededdddeeeddeedeeddededdeededeedddeedeededdeddedeeeeeeeedeededdededddddedeeeedededeeeeedeededdeedeeeddddeedededdeeededddddededededdedeedeeddedddeddedddededdedededdeeeeddeedeeddddedeedddddedeeedeeededddeeeeedeeeeeddeededeeedeededeedddeedeeedddeeededdedeeddedededdeeedeedededddededddeddeeeedddddddeeededeedeededeedeeeedededdeedeeddedeedddeeeedeeddddeeedddddddeddedeededededdddddddeedddeddeddddeedeeddeddddeeddeeedddeedeeddeddeddddeeddeeedeeddeddddeddddddeddeddddeedddeeeddeeedddddddeedeedeededdeedeeeeeddedeedddeeddddddeddeddedeedddeeeedddeededdddeeeedeeeeedeedddddeeeedddeeeeedeeedeeddddddeddedeeeeeededddeedeeedeedeeedededeeddddedddeeeededddededeeeeededeeeedeedddeddeeeededdeedeeddeeedeedeeeddedddeddeddeeeeeeeedddedddeddeeeedeeddddededdeeddededdeedddeeeeeddeeddddeeeddeeeddeeeeddddededeededdedeededeededeeddedddeedeeddedeededededeeeddeedeedeeddeeeeeeeddedddddddedededeeddeeddedeeeddddddedeededdeedddddddeeeddedeedeededeedeeeddddeddddddeeeedddedeedeeddeededdeeeeededdddededdedeededeeeeededeeeddeedeededdeddeededeedeeedeeeddeeddddeddedededddedeeeddeddeeeeeeeedeedeedeeeedeeedeeededdddddeddeeedeedddedededeeededdeeeedeededeedeededddeeeddeedededdeeeddddeeeeeeedeeedddeededdeeeeddddeddeeedddedeeeeddddddededddddeddeedeeddddeeeeedddeddddeedeeeeddeeeddedeedddddeeedddeeeeededdeedeeededdeddeedededdeeddddeeedddeeeedededddedeedddededdeeddeeedeededeeededdeeedeeedeedddededeedeeeeeedededdddeededddedeedddeddddedddedeededddeeddeedeedeededededdeeedeeeeededddddedededeeeeddeddeedededeedeedeeddededeedededededdeeededdeedeedeedededeeddeedeedeeeeedeeeedeedeeeeeeeeeeeeeededddedeeddeeedeeeeddddddddededdeeddeeeedeedeededdeedeedddededdededddeddeddddddeeeededdeeddeedddedddddeddeeddededeededeeeeededeedeeedddeeeedddeededdeeeedeeeeededddddeddedddddeddeedeeeeddeeeedeeeeeddddeddedeeeedddddeddeeedddededdeddeededeedddeedddeeddeedeeedeeddeeedeeeddedddeeeeddeddeeeeddeedeededddeedeeeeddedeeddededeeeeeddeedededeeeeddeededdeddeddedddeddddeddddddddedeedeedddddddeedededdeededddeddedeedeedeeeedddeeddddeeeeededdeedddedeeeeeeeeeeeeeeedeedeeddeddddeeeeeeeeeededdeeeeeededeedeedeeddedeeededdddedededddddddeedddeeeedddddededeededdeddeeedddeedeeddddedeedeeeeddeeeeddddddeedeededeedeeedddeeddddddddeddeedddeedeedeededededdedddeeededeedddeeeddeeeededededdeddeeededdddeeeedeeedeeddededdedddedeeedededdeeedeedeededddeeddddedeeeeeeededdeeedeedeeeedeeeeeddeedeeeedddedddddeeeddddeeeddeeeddddddeededddeeeddddededdeeeddededdddeeedddeeedddeddeeddddddeeeedeeddddeedddeeeedeeeeddeedeeededeedeeeeeededdddedededddeedeeeddddedeeedddddeeddddeddedddedeeededdeeddeeeedeeedddeddeddeeeeeeddddddeeeeedeeddeddedddeeddddedeededdedeeeeddddddddeeeddddedededdddedddeedeededeeeededdddedddddeeeddeeedddeeddddeddeddedddedeeededdeeeeeedddedeedeeddddddeeddeeedeeeddeeeeededeeededdeeeeeeedededeeddedddddeddddddddededddeddedeeeddeededdedddededdddddeeddedeeeeeedeeedddeeeeeeeddddeddddededeededeeddeeeeeeddeedeeddedeedddeddeddededeeeeddeddeedeeeededededeedddddeeeddededdeedededddeedddddddeddedeeeeddededdeddedededdddddedededdedeeeeddededeeeddededeeddeddeeededddddeddeddeeedeededdeddeddddeddeddeedddeddeedeedeeeedddeedeeeeeeddedeeededeeeeedeedddedeeddeedddedeeededeeedddeeddedededeeedeeedeeeeeeeeeededededddddededdeeddedddeeededddedeeeedeedeeddeeedededeedeedeededeeddddeedeeededdedeedededdddeeededdededeedeeeeedeeeeeddddedeeededdedeedeedeeedeeeedddddeedddeddedeedddddeeeeedededdeeddeeeeeeddeedddeddededddeeeeeedeedededeededeeedeeddedeedddedededeeedeeeddeedddeeeeeeeddeeeeeeeedddededeedddedeeeeddeddedededdeedeeddededeeeddedeeeddddddeeedeeeeddeedddddedddeddeedddddeeedeeeeddddeedededddeeeddddedddeedeededddeedddddddddeeedededdddeeddedddddeedeeeddeddddeededddeeddeeddeeeddeeededdededeeddeeeedddeeddedeeedeeeeeeddeeededdddedeeeeddeeededeeeedededddeddddeeeeedddedddddeeddeeddeededeeeeddedeeddddededdeddeedededeeeeededeedeeeeddedddeddeddedeeeedeeeddeeeeeeeedddedeeedeeedddeeededdeededdeedeededdedddeedeedededeeeedeeededddddddddeddeedeeeedeeddeddeddedeededdedeeeededeeededdededdedeeeddededdeddedeededeeeeedededeedeededdddeddddeddddddedddeedddeededeedeeddeddddeeddeedeeeeddeeeddddeeeeeeddddededeededdeeddddddddeddeededdddeddeedddedeeededdeededddeedeedeededeeededdeeeededddddeeeddeeddeeeddeeeeedeeeeeedddddeeedddddeeddddededeedeeddddeeeeededeeeededdddddeededddeeeededeedeedeedeeeeeeddeddeddddddddddeddeeeedddeededededeeedeeeeedddddddeededdeeddddedededdeddedeededeeedeeeedeededededddeeddeedeedeeedddddeededdddeddedeeddddeeedddeedeeeeddedddeeeeeedeeeeeddeeddedeeeedeeeddeeeeeddeeeeeedddedeeeddeddeeddeeededdeddddeeeddededdeedededeeddddeeeeedeeededededdedeeeeeddedeedddeedededeeddeededdeeeedeedddeeddedeeedddddeeedddedeeededededdeedeedeeeeededddeddedededdeeedddddeedeededddeedddddedeeddededeeedddeeeedeedeedeededddddedeedeeddeeededeedeeeededdeddeedddeeeddeededededeeeededdddddeddeeeeeeeedeeeddddddeeeedddeededeeeedeeeeeededeeeeddedddeeeeeeddedeeedddededdddeeeedddeddeeedeeedddeedededeededddedddeedededeededdeddedddeeeedddeedeeeededddeedeeedddeedeeddedeededdddddeededdddeeeeeddeddeedededdeedddeeedddededdddeddeedddeeeddeedededeedddddeeeddddddddeddeeeddddeddededeeeeeddddeededeeeddeddeeeedddeeeeddddeddedeeedededdedeeeddeeddddeddedededdddedddeddeddeddddedeeedddedededeeeeeeedddddeeddeeededddedddeddeeddedeeeededdddededdeddeeeddedededeeedddeeddddddeddeedddeddedeeeddedddeeddeeeeededeeedddeeededededeeeddddeddeddeeddddddeeddeddddddedeeddeddeddeeeeddedeededddeedeeddeeededdededeedeededeeeddeeeddedeedededeeeededdeeededdeedeededeeededeedeeddddedeeeeddeeeddeeeddeeeddddddeeddededdeedeededdddddeddddeeeeedeeddeeddedddeeeeeeeeeedeedddddddedeeeeeeedddededddeeeeddddeeeedeeeeeeedddedeeedeeeeddddeddeedddeedddeedeeeeeddedddedddeddeeeddddddddedeedddeeddddddeeeedddeeddddedeedeeeeeedddeddddeedddeeededddddeeddeeedddddeddeedeeddddeeededededddeeeddeeeeddeeeeeeeeddddedeeedeeeddeeddedeeedddeeeeddeeeddddddddeeeeeddeedddededeededdddeeedeeddddddededddeeddeeeeeedddddededddddeeedeeddeeeddeddeeeeddedeeededeeeededeeedddddededeedddddeeddededeeededdeddddeeddeedededddeedeedeeeeeedddededddeedeededddeedeededeeeddeedeeedeedededdeeeedddeeeedddedddeededeedddddedddddeeddddddededddddddedddeddedddeeeeddeeeddddddeedeeedddededdddeeeddedededeeeeeeeeedeeeeeeedddeeeeddeedeeeeeddddeededeeeeedeedeeeededddededededeeedddeedddedeeeedededeedddeedededdeddeeeedeeddddedddedeeeeeeeeedededeeddeddededdddeeeddeddedeeedddddddeeeeddedeeeedddeeeeddedeedededdededddddeeedeedeeddedededeeeddeddeededeeeddddddddeeedeeeedeeeddeddeddeededdddddddeeeddeddddedeeeedddedddeeddddddeedeeeedeeeeeeeeedddeeeddddeddeddeddddedeeeddddedeeeedddedeeededdeddeeededdedddedeededdededddeddeddededeeddddeddeddeddeeeeededdeeeeedeededdeddeedededdeddededeededdddededdeedeededddedddddeeedeeeeedddededeeeededdddeededdeeedeededdddeddededddededddeeedeeeedeeeedeeeededdeedeeddeedddeededdddededeeeedeeedeeeedddeddeeddddddeeedddededeeeedeeeededdeeeeeeeeeddeddedddeeeddddedeeeddedddededdeddeedddddeeeedeeedddeeedeeeedeeeeddddeddedeeeedddeededdddeeedeeeeededededeedeedeeeeeeedededddededeedddeedddeedddedeeeeedeeeddededdedddddeeedeedeededeedeeddeeededeeeeeeeeedededeeeeedeeddeeeeeeddedeedeededeeddeeeddeeeeddedddeeededdddedeeeddeedddedeeeeeeedededdeddeddeeeeeeddeedeedeeddededededeeeededddeeeedddeeeeeeededededddddeeeededdedeededeeddddddeedddeeddedddedeeeeedeeddeddeddeeedddeddeedddeeddededeedddedddedddddeeedededdeeeedeeeeededeeeddeddeededdeedeededeeeeeddedeeddeeeeeeeeddeedeeededededdddddddddedededddeeddeeedeedeeeedeeeddedddeeeddeedeeeeeeedddeeededdddddeddeeedeeeeddddeeeeeededddddddeeeeeedededeeddeeeddeddeeedeeeeddddeeeeededddedeededeeededddeeeeddededdededddddeeeddeedededdedddedddeeeeedeeedeedddeeeeeeedddddedddeededdeedeeeeeeeedeeedeeddeeeeedededeeddededdeeedeeeeeeddeddddedeededeeeeeeeddededdeeeeeeeeeddddeddedeeeedeeddedeeeddededddedddedddddeddedddedeededdeeeeeddeededddeddeddeeedddddddeededeeededeeeeeeedeeddddddeeedeeeeddedddeeeededdeddeeddeeddddeeedeeedddedddedddedeedeededeeedeeedededdeedeeeededdddedeeddededddedeeeeeddeeededddddddeddddddddeedddedeeeeeededdeeeeddedeeeeededeeededdddededdddeeeeddddeeedeeedddeeeededddeedeedddeddddededdedddeddeddeddddedddddeedddeeeedddeddeeddddedededddedeedededeeedeeedeeeeeeeddeededeeeddddeeedddddeeeeeeedeeeedddddeededeedddddeeeddddeeeeddedeedeeeeeedeeeededddedeeedededddeddeedeeddedeeeeedeeededdeedeeeededdeedeededeededeedeedddddeededdeedeeedeeddeeddddedeeeddeedeeeedeeeeddeeeedeeeddeeddddddeddddeededdddededdeddeeddedeeeddedeeddedddeeeeddeddedddedddddeeeeeedddeededdeeddddededeeeeeededdeeeedeededdddededdddedeeededdeeedddededededeeeddededdeedddddddddeddeedeededededdeeeddeeededddddddeeedddddeeeededddedddeeeeeeeeddeddeedddeeedeedddeeddededeeededdeeddddeddedeeeededdeeeeeddededddeeeddeeedddeededddedddddeddeddeeededddeeedeedddeeddeedeeeedddddeeddededddeedddddedeeddddeeedddeddededdeeeeededeedddddedeedddddddeeedeeeeddedeeeededdeededdeddededdeedeedddedddddeddeeeededededdedeeeeedddddddeedeededeedddeededeedddeeddddeeddddddeddedeedeeeeddeedddddeeedddddeeddeedeeeeedddedeedddedeeddeededddeddedddddddddedededddddeeeedeeddddeddeeeeeededdedeeeedededddddeddeeeddeddededdedededdeedddeedeeeeeeeddedeedddedededdeeeeddeeeedeedeededdedddeeddeeeddddeeeeedededdeedeedddeddeeeddeddeeddeedeeeddeeeededdededeedddeedeededeeddddeddddddeeddeededdedddddeddeeddeedeeededdeeeeeedddeeeeeeddededeedeeededdedeeeedddddededdedeeddeddeddeeedeeeeedeeeeddedeeededdeddddddeeeedeeddeededdeeeeeeeededdeededeeedddedeeeddeedeeeeeeeedededeededeedddedeeeddeeedeeeddeeddddedeeeededddddeeeddeddedddedeedeedeeddededededdeedeeeedddeddeeedeeddeededeeeeeddedeedeeeeeeeeeddeddddeeddddeddddeddeedddeeedeeeeddeeededeededdeeeedddeeddeeeddeeddeeedddeddeeeeddddeddeddeedeeddeddeeedeeddddeddeeeddeeedddddddddddeeeddedeeeededdeeeeeddeddeeeeddededddedddddeedddeeeedededededeededeeeddeeddeeddeedededddedddeedededeeeedededdddeeeeedeeddddeeeeeedddedededdeddddddddededdedddeedeeddeeeeeedeededddeeddeedeeeddeddedededdeeeddeddeedededdedeeeeeededeeeedddedddeedededeedeedeedeeeeeedeedeeedeededdeedddeeedededdeeeeeeeededdeeddededededededeededdddedddeedeeddeeeedeededdeddeedeedededdededdddeeddeddddddeedeeeddededeedededeeddeddeeddedeeeededeeeeddeeeddeeeddeedeedddeddeddedeedeedeededddddedeeeeeddddddededeeddeeeeeeddeeedddedeeedeeddddddeddeeedddededeededeeededdedeeeedeeeedeeeeedeedddeddededdddddeededdeddedeedeeedeedddddeedddeeededeeddededeeddedededeeeeeedddeeddddeeddeedededeedddeddeeddddedeedeeddddddddededededddedededdeddedeeedededededdedddeededeeeeedeeedeeeedeeeeeeeddeeeedeeddeddddedeeeeeeedeedeedeeeeddddededddeededddeddddededededdddddddedeeeeeeeeeddeddeeeedddeddedededdedeeeddddddeeeedddddeedddeddedeeeedeeedeeeeddddeddddddddeddeeeddeeeeedeededededdedddedeeedeeddddeeddeeeddedededdeddeeededddeeddedeeededddededeedddedeedddeeeeddeeeedeedddddeeedddedeeeedeededdddedeedeeeeeeddeddddeeedeeeddeddddeeeeddddddddeeeeeeddddeededddeeedddedeedeeeeddededddeedeeedeedddddeeeeedddddeeeededddddeededdeeedededededdddeeeeeedeeeedddededdedeeddddeedeeeddddeddeedddddddddededdedededeeddedddedeededeededdeedddddeedededdddddddeeedeeededdededeeddeddddedeedeeeeeededddedeeeeddeeedeeeddeeedddeddedeedeeeedeeeddedddddeeeedeedeeeddedddeddeddedddddeeededeedeeeddddedeedeeedddeeeeeeeededeeeedeeeedddeeedededeeeeeedeeeeeeededdeedeeddeddedededdedddeeeeedddeeeeedddddeededddeeeedeedeedeeeededeeeeeeeeededeeeddeeeededdeeeddddeeeeedeeeeeeddeddedddeddeddddddeddeeeeddeeddeeedededeeeeeededeeeddddedeeddeeeeddeeedddedddddededdedeededdeddedededdddddddededdedeeeeddddeeeeeddedddedddeddeedddeedddededddeeddddeeeddddedddeeedddddeddddddeedeeedeeededeedeeeeeeededeeedddedeeedeedddeeddedeedddeeededeeeeddedddddededddeedddedddeeeeeeedededddededdddeedddeddeddddeededddeddeeeddddeedddeddededeeddededeedededddeedeeededdeddeeededdddedededeededeeeeeeeddeedeedddeedeeeededededdddeeeedeeeeddddddddddedddeeeddeddeedeededeeeeeddeeeeeedededdddddededddedddeedeededededdedeeedeeedddeedddededeeeeedeeedddededeeeeedeedeeeeeddedddddedeededededeededededededeeeeeeddeddeedeedeeeeeddddedeeeddeeeedeedddddeddeedddededddeeedeeeedddddededeeddeeeedeeddddeeeeeeededddeddddeeddddedeeeedeeededdddedddeddedddeddedeeeeddeeeddeeddedeedeeedeedeeedeeedeededdedeeeedeeeeeeeeeeddededdedddeddeeededeeeededeededeedeeddededddededeeedeeeeededdddedededeeddedeedddeedeeedededdddedeeeedeeededeeddddedeeeddeddedeedeeeddddeedeeedeeddddededededdeeeeeedddededdedddededdededeeededeeeedeededdedddedddedddededededddeeedddddeddeeeeeeededeedededeeddeddededdeeeedddededdeedddeddeddeeeedddededeeeddedddeddddeddddddedddeddddeeddddedddddedddddedddedeeeeddeeddddddeddeedddeededeeddddeeeddedddeeddeededdddeddeddddedeeeeeedeededddeddeeddededeeededdeeeededdddddeeddeededdeedeeeeddeeddeededdeeeddeedddedeededeeeeddedddeeeddedeeedddeddeddddededddedeeededddddedeeeeddeedddeddedddddddeddedddedeeddeedeeededeeeedeeeddddddedeedeeddededdedddeddeddededdeeeeeedeeeddededededdedeedeededddeeededdeedddddeeddddeeddedeeeddededeeeeddedeedeeeeedeedddddeddedeeeeedeeededeeddddeedeeeededdededdeedeeddededeedededededddddedeeeeeeeeeeddeeeedeedeedddddeeededeeddeddeedddddeedededeedededdddeeeededddddeddddededddededdddeededededeeeddedeeeeeeeeddddededdedededdeeededddeedeedddddeedeedddddeddedddeeeddddeeeeeddeeedddeddeddededdeeddeeedededdeeeeddedddeeeddeeeedeeedddeeedededddddddededdddeeeddedeeeddededddeeddddedeedeeededeeedeeddeeedddddeeeeddeddeededdddedeeeddedeeddedddddddeedeedeeeeddeeeeddedeeeeddddeeddeedeeededdddddeedeeeeeeeeddeddeedddeedeeeedeeddddeeedededdeeeddedddeeedeeeedeeedededdeeddeeeedeeededddeeddeeeddeddddeddeddddeddededeeddddddeeedeeeeddddedeededdeeeeddddeeeddeedddedddedeeddedeededdeddddeeeddedddedeeeddeddddddedddededdddeededddeddeddddeddeedddedededeeeeededddddeedeeeddeedeeeededdeeededeeeededdddededdeddeeeeddeddddeeeddddededeeedeeeeddeedeedeeeddedddeeedeedeedededddddeeedeeeeedeedddedeeddedeeeeeddddeddeededddedeeddedddddeeeeddeeeeddeddeedeeddeeddedeeeddedddddeddeedddeedededdddeedeeeddddeeeddeddeeddededededededdeeddddedededdeddeddeeeddedeeeddddedddededdeedeedeeddddddddddeeeeedeeddeeddeedeeeeeeeddeddeedddddeeedeeeeeededdededddeeddddedddeeddeedeeedddeeededeeeeeeddedeeeeddeedeeedddeeeedeeedededdeedeeedddddddeedeedddeeddddddeeeddedededddeddedeeedeeddddddeeeededeeedededddededeeededdeeddeddeddddedeedddeeddddddeddeeeeeeeeeeeeeeddddeeeeedeedddedddedeeeddddeedddeeedddeddeedeeddddeedddededeeeddeedeeeeeededddddeeddeedddeeeededddddedeeddeddeedeeedeeeddeeddeeeddddedddddeeeededeedededeedededddedddeddedddeeddededddededddeedededddeedeedeeeeeeddddeeddddeeeededeeedeeeddedeeededddeeedededddddeeeddddeeedddeddddedddeeddeddededddeeddddddeeddddddddededeedeeddddeedddeddddddeeedeedddeddeddddeeeeeededddedeeeeeeedeeeedededdeeeedeeeeedeeeedddedeeeeeededededededeedeededeedeedeedeeeddedddeeededdeeeedddeeededdedeeeeededddddedededeeeeeeeeeeedededdddededededeeeeddedeeddeedddddddedeedeedddeddeddedddeeddeeddeeeededddedddedeededdeedededeeeddedeeedeeeeeddddedddededeeeeddeeddedeeddeeeeeddddddeeeeededdededdeeddddddddddddddddeeeeeeedddddedeeddeeeeeddeeeededdeddddedeeededeededeedddededeedddedeedeeedeedddedeededdedddedeeeededdedeededdeededdeddddeeededdeeeeedeedddedddeededeeddeeddededdeddedededdeeeeddeddddddddddedeedddedddeeeedeeeeeedddeededeeeddeedeeddeeddeeedededdeeddeeeeeedddeeedeededddddeeeeddeededeeddddddedededeedededeeeeddddddeedddedeeeedddededeeeeddeeeeeeddedeeedeeddeddedddeeeedddedeeedeeeddededdeeeeedddeddeedeeeeddeeeededeedeeedeedddddedeeeeeddddeeddeeededeeeeededdeedeededdedeeeeddedededededdddddeedddeedddeeeeeeedddeedededddddededdedddddeeedeededddeeedddeddeeeededededeeeeededddededdeddedddeeededeeeeededdeeedddededededededddeededeeeddeddeeeeeeedededddedddeeddededdeededdeedeedeeededeeeeededdeeeddddeeeeededddededdedeeeeededdedeeddeeedddedddeddddeddeddeddeeeeeeeeddedeedeededddeddeddeeedddddedeededddddedddddeeedededeeeeedeedeeeeedeeededeeeddddeedeedeeeeeddddeeddeeeeeeddeeddedddeddedededdedddededddedeeddedddeeededdeeeedeeeddeedededddddddeeeeedddeeeeeeeeddddeddeeedeedededeededeededdddddddeeeeededeedeedeeddeeddeeededddddeddedeededdeedeedededededdddddeddeeeddeedededdededeeeddddddddddededeeededeeedeedddeeedeeeedddeedddeddeddeddeeeededddeeedeedeeeeeededeeedddddeddeeddedeeeededdddeddeeeeeeedeeededededdededdeeedddedeededeeeeddeddedeeeddededdeeeddeddeddeeeeddeedeededeeeeeeddeedededeedeededeeeedddedddedeeddedeeeddedddeedddeeeeedeeedddedddeeeededdeedeeedeeeddeeeedeeedddedddedddeeeedddeedeeededededeeeeeeeddddedeeeeeeeeeededdeddeeddedddeedddddeddddddedddededdddedededeeeeddedeeddeddeeedeeeeeedeededeeeeeeeeddeddededeedeededeeeddddeddedeedddeddeeededddddddddeedededdededdddeedeeeeedeeddeedddddedeeeddddeeedeeedeeededeeeeeeedeedeeeedeeedeedededddedeeeeeeedddeedddddeededdddededeedeedddeeedeedeedeeeeeedeedddddddedeeedededddedddeddedeedeeedeedeeeeeeedeeeeeedddeeddeeedeeeddeedeedddddeededdeddeeedeeddeeedddedeeedddeeeeeddedededeeeeddeeedeeddddddeedddeededddeeeedeeddeeddddeedeeeddeddeedeeeeeddeddeeddeddddeeeeededdeeedeedeededdeededddeeededddddeddddeddddededdddedeedddedeeedddededeedddeedededdeeedddeeddddedeeedeedeedddeddeeddeededdeeedddededddddeeddeedddeddeeeeedeedddddeeeddddeddeddddedeeedeedeededdeeddeddddeeeeeedeedeeeedddededddeededeeedddddeeeddedddddeededdeeeeddddddeeeeddeeedddeeeeeddedddddedededdddededededeeddedeeedddeededeededeeeddeeeedeedededddddeddeeeeeddeeeedeeeeeededededddddedddddedeeedddddddeeddedeeeedededdddeeeeededddedeeeeeeedeeeddeededdedddeddedeeedededdeddedeededeeddeddeeddeeedddddeeddeedeeeeeeddeeeedddedddddeedddddeddeddeddddddededeeddededeeddedddddddeeeeddeeddddeeeedddddddddddddeeddeedededdedeededeeddddedddeddeeddddeedddededeedeeeddeedeeddddeeddddedeededdeeddeeedeeeedededdeeedddeddddeeeddeedeedddedeeeddededdeeeeeeddeddeeedeedeeededddedddeedeeddeededddeddddeeddedeeddeeededddedededddeeeeeeddeddddedeeededdedeeeeddddeeddddddeedeeedeedeedeededddeeeeedddedededdedeeeedeeeeeeedddedddeeedeeeeededdedeedededddedededeeedeeeeededdedeeeededeeeddeddeedddedeeeeedddddddddeeeedededddeeedeedeedddededeeddeddddddedddedeeddeeedeeeddeeedeedeeeedeeeeddededeedeeededeeedddedddedddddededdeeededdeeeedededddddeeedeededdeedeedeedddeeeddededdeeedeeeddededddeeddedddeeeeededdeeedeededdeedeeedeeedddddddedddddeedeedeeedeeeeddeeedeeedeeeedeededddedddddeeddeeeeddeddeededeededeeeddeddededddedededdeeeddeededeedeeedededdddeeedededddedeeedeeddeedddededddeeddddedddeeddedeeeddddeedeedeeeedddededddddededeeeedddeddeedddedeeddeddddeddeeeeeeedeeeddddedddeedddeddedeeeeedeeeeeededeededeeedddeedddeeeddddddedddeddededeeeddddedededededeeeeddededdeeedeeeddeedddededdeededdeedeeeedeeeddededddedddeededdeededddedeeeededeeedeeeddddeeeedddeddeeeddeeedeeeedeeddeeddeedddddedeeededeededdddedeedeeedddeddedddededeeddeeddeeeeedeeedededddddddededdedededededdeddeededdedeeeeedeeedeeddddededdeddeddddddededdeddededdeedeeedddddedeededdeeeeeeeeddddeeeeddeeededdedeeedddeededdeedeeedededdeeddeedeeeddddeeededededdeedddedddedddddeeeeeeededeeededeeeeeddeddddededeeedeeeeeeeeedddeeddeddddeedededdeeedeeddeeeddededdeedeeeeddddeeededdededdddddddededddeeeddddddedeedeeeeeeedeedeeeeddeedeededeedddeeeddedddeeedddeddedddeeddedeeeedeeedeededdddeeddddeddededeeedeeededdeeeedddddddddddeeddeedddddedddddddededeededeeedddeddedddddededededddededdededeededeeeedddededeeddedeeeeeddedeeeedeeeeedddddededeeeeeddedeedeeedeeedddedddeededddeddddedeeeeedddeeeeddeeeedddedeeeeeeeddededddeedeeedeedddddeeddeededdddeedddedddeedeedeeddddedeeedddddedeeddeededddedeeeeddedddeddddeddddedddeedeeddddddeeddeededdededdedddeeeedddeddeddeedddddeddededddeddddeeeeeeededdededeeddeddddedeedeeeeeededeeeeeddddeeeeeeeeddeededdeddedeedeeedeeeedeedddddeddeeeddeeeddeeedddededdeedddedddeeeddededdddededdedeedeeeddeeeededeeeeddeeeedddeeeededdeeedeeeededdededdeedeedeeddedededdeddeeeeeeeedeeeeedddededdeddeee\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 440,
        "task_id": 4108,
        "test_case_id": 22,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "xqqqxqqqqqxqqqqqqxqqqqqxxqxqqxqqxqqqqqxqxqqqqxxqxxqxxxxqqxxxxxxxxxxqqqqqxqqxxxqxxxxqxqqxqqqxqqqxxqqxqqqqqxxqqqqxxxqqxqxqqxxxxxqxxxxxqqxqqqxxxqxqxxxqqxxxxxqqqqxxxqqqqxxxxxqxxxxxqxxqqxxxxxqqqxxxqqqxxqxqxqqqxxqxxqxqxxxxqqxxqxqqxqxxqxqxxxxqxqqxqxqqqxqxxqqqqqqqqqqqxxqqxxqqxxxxxqxxqqxqxxqxxqxxxqqqxqxqqxqxxqqxxqxqxqqxqqqxxxqxxxqqxqqqxxxqqxxxxxqxxxxqqxxxqxqqxqxxxqqqqxqxxxqqxxxxxxqxqxqxxqxqxxqxxxxxxqxqqxqxxqqxxqqxxxxxxxxqqqqqxxxxqxqxqxqqqqxxqqqqxxxqqxxxqqxxqqxqqqqxqqqqqxxxxqqqxxxxqqxxxqxxxxqxqxqxqqqxxqxxqqxxxqxqqqqqxqxqqxqxqxqxqxxxxxxqxxqxxqxxxqxxqqqqqqxqxxqxxqqqqxqxxxxqqxxqqqqxqxqqxqqqqxxqxqxqqqxqxxqxxxqqqxxqqxxxxqqqxqqxxqxxqqqqxqxqqqxqqqxqqxqxqxxxqqxqqqqqxxxqxxxqxqxxxxqqqqxqqxxxxxqqxqqxxxqqqxxqxqqxxqqqxqxxxqxqxqqxxqqqqqqqxxxqxqqqxqxxqxxxqxqqxqqxxxxqxxqqqxqqxxqxxqxqxqxqxxqxxqqxxqqqqqqxxqxxxqqqxqqxxqxqqqxxqxqqqxxqqxxqxxqxqxxqqqxqqxqqqqqxxqxxxxqxqxxxxqxqxqxqxxqqqxxxqqqxqqqqqqxqqxqxxxqqqqqqqxqqqqqxqxxxxxxxxqxxqxxxxqqxxxqqxxqqxqxqxqxqqqqqxqxqxqxxqqqxxxxxxqqqqxxxqqxxqxqqqxxxqxxxxqqxxqxqxxqxxxxxxqxqqqqqxqxxxqxxqqxxxqxxxxxqqxxqqxqxqqqqxxqxqxxqxxqqxxxqqxxxxqxqxxxxxqxqxqxxqqxxxqqxqqqxqqxqxqqqxqqxqqxxqxqqxqqqqxqqxxxxxqqqxxqxxxxxxqqqxxqqxqxqxqxxqxqxqxxqxqxxxxxxqxxxqxxxqqqqxqxqxxxqqqxqxqxqqqxqqqxxqxxxqxqqqxxqxxqqxxxqqxqxqxxxxxqqqxxqxxxqqxxqxxqxxxqxxxqxxqxqxxqqqqqqqqxqqqqqxqqqxxqxqxqqxxqxqqqqqxqqqqxxxqqxxqxxqxxxqqxqqxxxqqxxxqxqxxqqqxxqqqxxxxqqxqxqqxqxxqxqxqxqxxxxqqxxxxqxxqxxxxqxqxxxqxqxqqqxxxqxqxqqqqxxxxxxqqxxqxxqxqxqqxqqxxxxxxqqxqqxqqxxqqxqxqxqxqxxxqqxqqqxxqqxxqqqqxxqxxqxxxxxqqxxxqqxxqqxqqqxxxxxqxxqqxqxqqxqqxqxxxqqqxqxxxxqxxxqqxqxxxqqxxqqxxxxxqxqxxqqxxxqxqqxqxqqqqqqxxxxxxxxqxqxxqxxqqqxqxqxxxxqqqxqxxqxqxqqxqxxqqxqqxqqxqxqqqxxqxqxxxxxxxxxqqqqxqqqqqxxqqqqxqqxqqxxxxxqqqqqxqqxxqqqxqxxxqxxqxqxxxqqxqxxqxxqxqqqxxxqxqxxxqxxqxqxxxqqqxxxxqxxqxqqqxxqqqxxxqxqqqqqqxqxxqxxxxxxqxxxxqxqxqqxxqxxqqxxxxqxqxqqqxxqxqxxxxxxqqqqxxxqqqqqxxqqqxxqqxxqxqqxqxxqqxxqqqxqxxxxxqxxxxqqxxqxqxxqqxqxqqxxxqqqqxqxxxxxxxxqqqxqxxxxqxxxqxqxqxxqxqqxxqxqqxxqxqqxqxxqqxqxqxqqxxxqxxqxxxqqqqxxxxxqqxxxxxqxxxqqxxqxqqqxqxxqxxxqqqxqqxxqqqxxqxqqxxqqqqqqxxxxqqxxqqxqqqxqxxxxxxxqxqqxqqqxqxxxxxqqxxxqqxqqqqqqqqxxxxqqxqxqxxqqxxxqxxxqxqxqqqqxqqqqqqxqxqqxxqqxqxqqqqqxxqqxqqxqqxqxxxxxqxqxxxxxqxxqxqxqqxxxqqqqqxxqqxqxqqxxxqqqxqxqqxqxqxxqqqxqqqxxqqqqxxxxqxqqxqxxqqxxxqxqxqqqxqxxxqxqxqxxqxxqqxxqqxxqxqxxxxqqqqxxxxxxxqxqxxxxxqxxqqxqxxqxqqqqxqxqxxxqxxqqxxxxqqqxqqxxxqqxqxqxqxqqqqxxxqxqqxxqxxxqqqqxqxxxxxxqqxxxqxqxqqqxqqqxxxqqxqqqxqqxxqxxqqqqxqxxxqxqqxxxxxxqqqxxqqqqxqqxqqqxqqqxqxxqqqqqxqxxxxqqxqxxqxqxqxqxqqxxxqqqqxxqqqxxxqqxxqxqqxxxxxqqxqqqxqqxxxxqxxxqxxxxqxqqxqxxqxqqxqqxxxxxqxxxqqxxxxxxqxqxqxxxxxqxxxqqxxxqxxxxxqqxxqxxxqxxxqxqqqxxqxxxxxqxxxxqqxxqxqqxxqqqxqxxqxqqqqxxqxxxqqqxqxqqqqqqqxxqxxqqxqxxxqqqxqxqqxxxqxxqxxxxxxqxxxxqqxxqqxxqqxqqqqqqqqxxqxqqqxqqxqqqqqxqqxqxqqqqxxxqxqxqqqqqqxqxqqqqqqxqxxqxxxqxqxxqxxxqqqqxqxqxxxxqxqxqxxxqxxqxxqqxqqxqqxxxqqqqqqxqqqxqxqxxxxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqqqxqxxxxqxqxxqxqqxqqqxqqqxqxxqqqqqxxqxqxxxxqxxxxxxqxxqqxxxxqqxxxqxqqqxqqxxqxxqxqqqxxqqqqxxqqqqxqqxxqqxqxqxqxxxqxxqxqxxqxxqxqxqqxqqqxqxxxqxxxqxxqqxxqqxxqxqxqxxxxxqxxqqxqqqxxxxqqqxqqxqqqxxxqxxxxqqqqxxqqxxxxqxxqqxxxxxxqxqqqxxxxxqqqqqqqxqqqxxxqqxqqxxqqqqqxqqqxqqqxxqxxqqqxxqxqqqxxxqxxxxxqxqxxqxxqqxxxxqqqxqxxxxqqqqxqqxqxqxxqxqxxqxqqxqqxxxqqqqqxqqxqqxxxxqqxxxqxqqxxqqqxxxqxxxqxxqxqqqxxqqqxqqxxqqxqqqxxqqxqxxqxxxqxqqqxqxqqqqxxqxqqqxqxxqqqqqxxqqxxqxqxqxqqxqqxxqqqxqxxqqqqqqxxqxqxqqxxxxxqqqqqxxqqxxqqqqxqxxqqqqxxxxxqxqqqxqqqxqxqqxqqxxxqxxxxqqqxqxqxqqxxxxqqqqxxxqqqxxxxqqxqqxqqxxxqxxqxxqxxqqqqxqqxxqqqxxxqxqqxxxqqqqxqxxqqxqxxqxqxqqxxqqxxqqqqxxqxqqxqxxxqxxxqqxxqqxxqxqxxxqxqxqqxxxxxqqqqqxqqqqqxxxxqxqxxxxxqxxqqqxqxxqqxqqqqxxxxqxqqxqqqxqqqxqqqqqqxqqqxxxqqxqqqqxqqxqxqqqqqqxqxqqxxxxqqqxxqqqqqxqqxqxqxxxxqxxxqxxqqxxqxqxxxxxqqxqqxqxqxxxxxqxqxqxxxqqxqxxqxxxqxqxqqxqxqqxxqqxxxxxxqqxxqxxxqqxqxqxxxqqxqxxxxqxxqxqxxxxqqxxxqqqxqxqqxqxxqqqqxqqxqxqxqxxqqqqqxqxqxxqxqxxqqqxqqqxxxxxxqqqxqqxqxxqxxxqqqxxxqxqxqqqxxxqqqxxxxxqqxxxqqqqqqqxxxxxxqxxxqqqqxxxxxqxxqqqqqqxqxqqxqxxqxqxqxqxxxqqqqxxxqxqqxqqqxxxqxqxqqxxxqxxxqqxqqxxqxxqqxqxxqqqqqxxqxxxqqxxqxqqxxxxxqqqqqqqxxxxqqqxqqxxqxqqqqqxqxxqqxqxxqxxqxqxqqxqqxxqqxqqqqxxxxxqqxqxqqqxxqqqqqqqxxxqqqqqqxqxxxqxqxxqxxxxxqqqxxqxqxxqqqqqxxxxxqxxqxxqxxqxxxqxqxqxxxqxxxxqqqqxxxqqqxqxqqqqqxxxxqqqxqxqxqqxxqqqxqxqxqxxqxqxxqxqxqxqxqqqqxxqqxxxqxxqqxxxqxqqxqqxqxxqxxqqqxqxqqxqxxxqxqqxxqqxqqxqqxqxxqqxxqxqxxqqqxxqqxqqxqxqxxxqxxqxxqqxxqxqxxqxxxxxqxqqqqqqqxqqxxxqqqqqxxxqqxxxxxqqqxxxxxxqxxqqqxxxxqqxxxqqqxqxqxxxqxxqxxxqxxxqxqxqqqxxqqqqxxqqxqqxqxqqqqqxxxxxqxxqqqqqqxxxqxxqxxxqxqxqqxqqxqqxxqxqqxxqxqqqxqxxxxxqqqxqqxqxxxxqxxqqqqxqxqxxxxxqqqqqxqqqxqxqqqqqxxxqqxxxqxxqxxxqxqqxqxqqxqxxxxxxxxqxqxxxqxxqxqqqxqxqqqqxqqqxqxxxqxqqxqxqqqxqxqxxqqxxqqxqxxxxqxxxqqqxqqxxqqxqqqqqqxqqqqxxxxxxxxxxxqqqxxqxxxxqqqxqqqxxqxqxqqqqxxqqxxqqxxxqqqqxqxxxxxxxxxxxqxqxxqqxqqqxqqqqxxxqxxqqxqqxqqxqqxxqqxxqqqxxqxqqqqqxqqqxqqqxxxqxxqxxqqqxqqqqxqqqxqqqqqxqxxqxqxqxqqqqxxqqqxxqxxqxxqqqqxxqqxxqqqqqqqxqxxxqqqxxqxqqxqqqxxqqqqxxqqxxqxqqqxxqxqqqxxxxxxqqxxxqqqqqqqxqxxxxqxqxqxqqqxxqqqxqqxxqqxxqqqqqxqxxqqqxxqxxqqqqxxxxxqqxqqqxxxxxqxxqqqxqxxxxxqqqqqqqqxqqxqqxqqxxxxxxqxqxqqqxxxxqxxqxqqqxqxqqxxqqxqxqxqxqqqxxqxxqxxxqqxqxxxqqqqqqqqqqqqqqxqqqqqxxqxxqqqxqqxqxqqqxxqxxxxqqxqxxxqxqqxxqqqqqqxxqxqxqqxqxqxqqqqxqqqqxxqxqqqxqxqqxqqxxxxxqqxqqxxxxxqqqxxqqxqqxxxxqqqqqxqxqqqxqqqxxqqxqqqxxqxqxqqqqxxxqxxxxqqxxxxqqqxxqxxqqqqxqqxqqxqxqxxxqxxqqxxqxqqqqqqxxxxxxxxqqqxqqxqxxxqxqxqxxqxqqqqxqxqqxqqqxqqqxqqqxqqxxxqxxxxqxxqqqxqqqqqqxxqqqxqxqxxqxqxqqqqqqxqqqxxxqxxxqxxxxqxqqxxqxqxqxxqxxqxxqqxqxxxqxxxxqxxqxqqxxxqqxqxxqqqxqxqqxxqxxqqqxxqxxqqxqqxqqxxqqxxqxqqxqxxqxqqxxxxxqxxqxqqqqxqqxqqxqxxxxqqqxxxxxxxxxxxxqqxxqxxxqxxqxxqxqxqxxqqqxxqqqqxqxqxqqxqxqxxqqqxxxqqqxqqqqqqqqxqxqqxxxqxxqxxqqqxqxxqqqxxqqxqxxqqxqqxxqqxxxxxqqxxxxxqqxxxxxqqqxxqxqxxxxxxqqxqqqxxqxxxxqxxxxxxqqxqxxqqxqxxqqxxqqqxxxxxqxqxqqxqqqxqqxxxxqqqxxqqxxxxxqxxqxqqxqxxxxxxqqxqxqqqxxxxqqqqqxqqxxxxxqxqqqxqxxqqqqqxqxqqqxqxxqqxxxqqqqxqqxqxqqqxxqqxqqqqxqqqxxqxxqqxxqqqxxxqqqqxqxxqqqqqxqqqxxxxqqxxqxxqqxqqqqxxqxxqqxqqxqqqqxqqqxxxxqqqxxqqxqqqxqqqxqqxxqxqxxqqxxxxxxxxqxxqqqxxxqqqxqxxqxxqxqqxqqqxxxxqqxxqqqqxqxxqqxxqqxqxqqxqxqqqxxxxqqxxxxxxqxxxqxqqxqqxqxxxxqxxxxxqqxqqqqxqxxxqxxqxxxxqqqqxxqqqqxqqqqqxxqxqqqxxxqxxqxxqqqxxxqqxxxqqxqxqqxxqxqqxxqxxqqxxxxxxxxxxqqxqqqqqqxqqqxqxxxxxqqxxqxqxqqxqxxqqxqqqqxqqqqxqqqxqqqqxxqqqxxxxxqqxqqqqqxxxqxqxqxqqxxxxqqqqqxxxxqxqqqqxxqqqqxqxxxqxqxqqqxqxxqqxxxxxqxqxxxqxxxqqxxxxxqxxxqxxxqxqxxxqqqqqqqqqxxqxqxxqqxxqqxqqxqqxqqqqxxxxxxxqqxqqqxqqqxqxqqxqxxxxxqqqxxqxxqqqqqqxqqqqxqxqqqqqxqxqqxxqqxxqxqqqxxxxqxqqxqxqxqqqqxxqxqqqxxqqqqxxxqqxxqqxqqxqqqqxxqxqxxqxxxqqxxqxxxxxxxxxqxqqqqqqqxxxxxxqqxqxxxxqxqxqqxqqxxxxxxqxxxqxxqxxqqqxqqqqqqxxqxxqqqqqxqxqxxxqxqxqqxqqxxqxqqxqxxqxxxqxxxxqqxqxqqqqxqxxqqqxxxxxxxxxxxqqxqqqxxxqxxqqxqqxxqqxqxxqxqxxxqqqqqqqxqxqqqxqqqxqxqxxqqqqxxxxxqqxxqxqxxxqxxqqxqxqxqxxqxxqqqxqxqxxqqxqqqxqxqqxxqqqxqqqqqqqqxqqxxqqxxxxxqxqxxqqxxqxqqqxqqqxxxxxqxxqxxqqxxqxxxxxqxqqqxxqqqxxxxqxxqqxqqqqqxxqxxqqxqxqxqxxxqxqqxxqxxxqxxxxqqqxqxqqxqqqqqxxqqqxqxqqqxxxxxqxqqxqxqxqqxqxqxxxxxqxqqqqqqxxxqxxxxxqqqxqxxqxqxxxxqxxqqqqqqqxqqxxxqxqxxxqqxxxxxqqqxqxxqxxqqqxxqxqqxxqxxqxxxxxqxxqqqxxxxxxxxxxxxxxxqxqxqqqxqxxqqqxxqxxqxqqxxqxqqxqxqqxxqqxxqxqxqqqxxqqqqxxxqxqqqqxqqxxxqqqxxxxqqxqqqqxxqqxqxxxqqxxqqqqqqqqxxqqxxxqxqxqxxqxxxxqqxqqqxxqxxxqqqxxqqqxqqxqxxxxxqxqxxxxqxxxqxqqxqqxqqqqxxqxxqxxxqxqqxxxxqxxxqxqqqxxqqxqxqxxqxqxxqqqxxqxqxxxxqqxxqxxqqqxxqqxqxqqqxqqqxxqxxxqxxqqxxxxxxxqxxqqxqxxxqxxqqxxqxqqxxqxxxxqxqqxqxxxxqqqqqxxxxxxqxqxxxqqxqqxqxqqxxxqqqxqxqqqqqqqqxqqqxqqqqqqxqqqxxxxqxxqxxqqqxxqqxxqxxxqqxxxxqqqxqqqqxxqqxqxqxxqqqxxqqqqxxqxxxxqqxxqqqxqqqqxxxqqxxqxxxxqqxqxqqxqqqqqxxxqxxxxqxqxqqqxxqqxqxqxxqqxqxxqxxxxxxqxqqqqxxxxxqqqxqxxxqqqqxqxqqqqqqxqxqqxqxxqxqqxxqqqqxxxxxqxqqxxxqqxxxxqqxqxxqqqxqqxxqxxxxqqxqqxqqqqxqqqxxxqqqqqqxxqqxxqqxqqxqqxqxxxxqxxqqxxxqxqqqqqxxxqxqxxxxqxqxxqqxqxqqqxqxqqxqxxxxxxxqqxxqqxqxqqxxqqxxqxxqxqxqqxxxqxxxxxqxqxqxqqqxqqxxqxxxqxqqqxxxxqxxqxqqqqqxxqxqqxqqxxxxqqqxqqqqqxxqxxxqxxxqqxxxqqqqxqxqqxxqqqqqqqxqxqxqqqqxxqxxxxxqqqxqqqqxqxxxxxqqxxqqxqqqxxxxqxxqxqqxqqqqxqqxxxxxxqqqxqxxxqxqxxxqxxxxxqxxqqqqxxqxqqqxxqxxxqxqqxqxqqqqqqqxxxqqqxqqqxqqxqxxxxqqqxqqqqxxxqxxxxqqxxxxxxxxxqxxqxxqxqxxqqxqxxqxqxqqqqxqxqxqqxqxqqxqxxqxxxxxqxqqqqqxxxqqqqqqqqxqxqqxqqqqxxxxqxqxqxxqqqqqqxqqxxqxxxqqqxxqqqxxqqqqxxqxqqxqqqxqxxxqqqqxxqxqxxqxxqqxxxxqqxqqqxxqqxqxqxqqqqxxxxxqxxxqqqqqqxxxxqxxqqqxqxxqqqxqqqqxqqqqqqqxxxqqxqxqqxqxqxqqxxqxqqxqxqxqxqqxxqqxqqqxqxqxxxxqxxxqqqxxxxqqxqqqqxqqqqqqxqxxqxqxxqqxxqxqqxqxxqxqxxqxxxxqxxqqxxqxxxxxxxxqqxqqxxxxxxxxxxxxqqxxqqqqqqxxqqxqqqqxxqqqxqqxxqqqqqqqqxqxxqxxxxqqxqxqqxxxxqxqxqqqxxqxqqqxqqxxqqxxxxxxxqxxxqqqxxqxxxxxqqqqxqxqqqqxqqqxqqxxxqxxqxqxxqxxqqxqxqqxqqxqxqxxxqxxqqxqxxxqxqqxqqqqxxxqqqxqxxxqxqxxxxxxqxxqqxqxxqqxxxqqqqxxqxqqxqxqqqxxqxqxxqxqqxxxxqxxxxxxqxqxxxqqqxqxqqqxqxqxqxxqqqxxqqxxqqqqqqxxxxqxqxxxxxxqxqxqqxxqxxqxxxxxqxqxxqxxqqxqqqxxxqxxqxxqqqxqqxxxxqxqxqqqqqxqqqxxxxqxxxxxqqqqqxqqqqxqqqqxxxxxqxxxxxxxqxqqqxxxqqqqqqxqxxqqqxqqqxxxqxqxqqqxqxxqxqxxxqxqqxqxxqqqxqxxxxxxqxxqqqxqxxxxxqqxxqqxxqxxqxqqqqxqxqxqxqxqqqxqqxqqqqqqxxxxxqxxxxxxxxqqqxxqxqxxqqxxqxxxxqqxqqxqqqxqqxqqxqqqxxxqxxqqqxqxxxqqqxqxqxxxxxqxqqxqqxqqqxqqqxxxxqqqxxqxqqxxqxxxqxqxxxxxxqqxqxxqqqqxxqqxxqqxqxxqqxxqqqqxqqqxxxqxxqxqqqqxxqxxqxqxqxxxxqxqqqqqqqqxqqxxqxxxqqxxqqxxqqxxxxxqqxqqxxxqqxqxxqqqxxqqqxxxxqxqxqxxqxxxxqxqxqqxqxxxqqqxxxqxqxxqxqxqqqqqqxqqxqxxxxqqqxqqqqqxxqqxxxxxxxxxqxxqqqxxxqxxqqqqxqqxqxxxqxqxqxqxxxqxqxxqqqxxqqxxqqqqqxqqxxxqxqqxxxxqxxxxqxxxqxqxqqxxqxxxqqqqxqqxqqxxqxqqxxxxxxxxqxqqqxxqxqxxqqqxxqxqxxqxxqqxxqqqqqxxqxxqxxxxqxxqqxxqxxxxqxxqqqqqqxqxxqxxxqxqqxxqxqqqqqxxxqqxqxqxqqqxqxxxxqxxxqqxxqxqqxqxqxxqxqqxxqqxxqqxxxqqxqxxxqqqxqqxqxxxxxqqqxqqqxxqqxqqqxxqxxxxxqqqqxqxxxqqqqqqqxqxxxxqxxxqqqqxqqqxqxqxxxxqxqxxxqxqqqqqxqxqqqqqxqxqqqxxqxqqxqqxqxxxxqqqxxxqxxqqqqxxqxxqxxqqxxxqqxxqxxxqqxxxxqqxxqqxxqqqqxxxqqqqxqxqxqxxxqqqqxxxxxqxqxxxxqxqqqqqxqxqxqxqxxxxqqxxxqxxxqqqxxxxxxqqxxqqxxqxqqqqqqqqxxxxxqqqqqxqqxqqqxxxqxxxxxxqqqqqqxxqxqqxqqqqxxqxxqqqxxxxqxxxqqxxxqxqxqqxxqxqxxxqxqxqqqxxxxxxxxxqqqqqxxqxxqqqxqxxxqxqxqqxxxxqqxxxxqqxqqxqqqxqxxxxqxxxxxqxxxqqxqxxqxxxqxxqxxxxxqqqqxxxxqqqxqqxxxxxqqxqxqqxqxxqqxxqxqxxxqqxxxxqqxqxqxqqxxqqqqxxxxxqqxqxqxqqqqxxqqxxqqqxqxxqqqxxqqxxqqxqqxxqxxqxxqqqxxqxqxxxqxqqxqqqxqqqxxqqqxqxxxqxqxqqqxxxqxqqxxqxxqxxqqxqqxqxqxxqqxxxqqxxxxxqqxxqxqxxqqqqxxqxxqxxqxxxxxqqqxxxqqqxqqxqxxqqxxqqqxqqxqqqxqxqxqqxxxqxqxxqxqqxxqxqxqqqxqqqqxqxqqqqxqxxxqxqxqqqqxqxxxxqxxxqqqxqxqqxqqxxqxqqqxqxxqxxxxqxxqxxxqqqxxqxxqxxqqxqqxxxxqqqxxxxqqxxxqqxxqxxxqxqxqqxxxqxxxqqqxxqqqxqxqqxqqqqqqqxxqxqqqxxqxqqqxqxxqqxxxxxqqxxqxxqxqxxqqqxqxqqxqqqxqqxqqxqxqqxqqqqqqxxxxqqqqxxxxqqqqxqxxqqqxqqqxxxqxxxxqqqqqxqqqxqqxxqqqxxxqqxxqxxxxxxxxqxqxqxqqqqqqqqxxqqxxqqqxxqqxqxqxxxxqqqqxxqqxqqqxqqxqqxxxxqqqxxqxxqqqxqqxqxxxqxqxxxxqxxqxxxxxqqxxqqxxxxqxxqxqqqqxxxxxxxqqqqxxxxqxxqqxxxxqxxqqxxqqqxxxqxqqxxxxxqqqxqqxxqqxxqxqxqxqqqqqqxqxqqxqxqqxqxqqxqxxxqxxqqqxxqxqxqqqxqqqxxxqqxqqqxxxqxxqqqxxqxxxxxxxxqxxxxqxqqxxxqqqqqxxxqqqxqqqxqxxxqqqqqqxxqxxqxqqxqxqxqxqxqqxxqxxxxxqxqxxqxqqxxqqxqxxxxxqxxqxqxqxxxxxqxxxqxxqxxxqqxqxxqxqxxqqxxxxqqxxxqxxqxxxxxqqqqxxqxqxxxxxqxxqqxxxxxqqxxqqxxxxqqqxqqqxqqqxxqxqqxxxxqqxxqqqqqqqqxqqxqxqqqxxxqqxxxqqxqqqxqxxqqxxqxqqxqqqxxqqxxqxqxxxxqqxxxxqxxxxxxqxqqxxxxqxxqxqqxqqqqqxxxqxxxxqqxqxqqxxqqxqxqqqqxxxxxxxqqxqqqxqxqqqqxqxqqxqqqqqxqxxqqqxxqqqqqqqxxxqqqqxqxqqqxxqxxxxxxxxqqxqqqqxxqqqxxxqqqqqxqxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqxqxqxxxxxxqxxxxqqxqqxxxqqqqxqxqxqxxxxxqqxxqqxxxxxqqqxxqxqxxxxxxxqqqqqxxxxxqxxqxqqxqxqxqqxqqqqxxqqxxqqxqqqxqxxqqxxqqxxxxxxqqqxqxqqqqqqqxxxqxxqxxqqxqxqqxxxxxqxqxxxqxqxqxxqqqxxxqqqxqxqqqqxxqqxxxxqqxqxxxqxxxxqxqqqxxxxxxqqqqxqqqxxqxqqxxqxxqqqxxqqqqqxxqxqqqxqqqxqqxxxqxxxqqxxqxqxqxxxqqxxxxqxxxqqxxqqqqxxqqqxxxxxxqqqqxqxxqqqqxqqqqqqqxqxqqxxqqqqqqxxqxxqxxxxxqqqxqxqqqxqqqxqxqxqxqxqxqqqqxxxqqxqxxxqqxxxxxxqqxxxxqxxxqxqqxxqqqqxqxxqxxqqxqxxqxqxxxxqqxxqxxxxqqqxqqxxqxqxqxxqqqqxxqqqxqxxqxqxqxqqqqqqxxqxxqqqqqqxxqqqqxxxqxqxqqqqxqxxxxqxxqxxxqxxxqxqqxqqxqxqxxxxxxqqqqxxxqqxqqxqqxqxqqqqxxqxqqqxqxxqqqqxxqxqxqqxxxqxqqxxxqqqxqxxxqxqqqxqxqxqqxxqxxqqqqxxqqqqqqqxxxqqxxqxxxxxxqxqqxxqxxqxqqqqqqxqqqxqqxqqqqxxxxqxqxqxqqqxxqqqqqxxqqxxxqqxxxxxxqqxqqqxxxqqqqqqqqxqxqxxqxqxqxqqxqqxqxxxqqqqxxxxqxqxxqqxxxqxqqxqqqxqxqqxxxqxxxqxxqqxqqxqxxxxxqqqxqxqqqxxxxxxxqxqqqxxxxxqxqqxxqxqqxqxxxqqxxqqxqxqxxqxqqqxxxxqqxxqxxxxqxqxqxxqxxxxqxxxxxqxxxqxqxxxqqxqxqqqqqxqqxxxqxxqxqqqqqqqxqxqqxxqxqqqxxqqxxxxqxqqxqqqxqxxqxxxqxqqxxxqqqqxqxxxqqqxxxxxqqqxxxqqqqxqqqxqxxxxxqqqqxxxxqqqqxqxxqxqxqxqqxqqxqxqxqxxxqxqqqxqxxqxqqqqqqqxxqxqxqqqxxqqqxqqxqqxxqxxqqxqxxxqqqxxxqxxxxqxxqxqqxqxqxqqxxxqqqqxxqqqxqqxxqqqqqqxxqxxqxqxxxxxqxxxxqqxqxxxqqqqqqqxxqxqxqxqqqxqxqxqxxxxxxxxxqqqqxqqxxqqqqxxxxxxxxxqxxxqqqxqqqqxqxqxxxqxxqxxqxqxqxxqxqqqxqxqxxxxqqqqqxxqqxqxxqxqqxxxxqxqxxqxxqqqxxqqqqqxqxqxxqqqxxqxqxqxqxxxxxxxqqxqxqxxqqxxxqxqqxxqxxxqxxqqxqxqxqqqqxxxqxqqxxxxxqqqxxxxxxxqxxxqqqqqqqxxxxxxqxxxxxxxqxxqxqqqqxxqqqxxxxxxxqxqxqxqqqxxqxxxqqqqqxxqqqxxxxxqqqxxqqxxqxxxqqxxxxqxqxxqqxxqqxqxxqxxxxqxxxxxqxqxxxqxxqqqqxxqqxxqxxxxqxxqxxxxxqxxqqxqxxxxxqqxxxqxxxqxqqqqqxqqqqqqqqxqqqqqqqqxqqxxxqxxqxxxxqxxxxqqqqqxxxqxxxxxxxqxxxqqqxxxqqqqqxxxqqxxxxqxqxxqqqqxxqxxxqqqqxxqxqxxxqxxxqqxqxqqqxqxqqxqxxxxxqxxxqxqqxxxqqqxqxqxqxxqxqxxqqxqxqxxxxqqxqxqxxqxqqqqqqxxqqxxqxqxqqxxqqxqqxxqxxxqqxqxqqqqxqxxxxqxqxqqqxxqqxxxqqqqxqxxxxxxxxqxxxqxxqqqxqxqqxqxqxxxqxqxqxqxxqqxxxxxqqxxqqqxqxxqqqxxxxxxxqqqxxxqxxxxxxqxxqqqqxqqxqqqqqqxqxqqqqxxxqqqxqqqxqqxxxqqxxqqqqxqqxqxqqqqqxxxxxxqxxqxxqxqqxxqqxxqqqqxxqqxxqxqxqxqxxqxqxxxxqxqqxxxqqxqxqqxqxqxxqxqxqxxqqxqxqqxqqqxxqxxqqxxqxqxxqqqxxqxxqqxqxxqxxqqxqqxqxxxqxqxqqqxqxxxxqxqqqqxqqxqqxqqqqqxqxxxxqxqxxxqxqqxqxqqxqqqxqxqqxxqqxxxqxqxxxqxqqxxxxxqxqxxxxxqqqxxqqqqqqqxqxqqqqqxxxxxqqxxqqxxxqqqxxqxqxqqqxqqxxqxqxqxqqqqqqxxqqqxqqxqqxxqqqxxqqqqxxqqqxqxqqqqxqqxxxxqqqqqqxxxxxqxqxxqxxxqxqxxxqqxxxqxqqqxxqqqxxxqqqqxxxxqqqqqqxxxqxxxxqxxqqqqxqxxqxxqqqqqqxxqqqqxqxxxqxqqxxxxxqqqqqxxxxxqqxxqqxxqxxqqxxxqqxxqxxxqqqqxxxqqxxxqxqqxxqqqxqqxxxxxqxxqxqqxqxqxxqxqqqqqqxqxxqqxxqxqxqxqqqxxqqqxxxxxxqqxxqxqxxqxxxxqqxxxxqxxqqqqxxxqqqqxqxxqxxqxxqqqxqxqqqqxxxqqxxqxxqqxqxqqxxqxqxxqqqxxqxxqxqqxqqxqxxxxxxxxqxxqxqqxqxqqqqqxqxxxxqxqxqxxxxxqxxqxqqxxqxxxqqqqxxqxqxqqxxxqxqqqqqxqxqxqxqqxqxxqxxqqxqqqxqqxqqqxqxqqxqxqxqqxxxxqqxxqxxqqqqxqxxqqqqqxqxxxqxxxqxqqqxxxxxqxxxxxqqxxqxqxxxqxxqxqxxqqqxxqxxxqqqxxxqxqqxqxxqqxqxqxqqxxxqxxqxqxqqqxqxqqqxqqxxxxqqqqqqqxxxqxqxxqxxqxqxxqxxxxqxqxqqxxqxxqqxqxxqqqxxxxqxxqqqqxxxqqqqqqqxqqxqxxqxqxqxqqqqqqqqxxqqqxqqxqqqqxxqxxqqxqqqqxxqqxxxqqqxxqxxqqxqqxqqqqxxqqxxxqxxqqxqqqqxqqqqqqxqqxqqqqxxqqqxxxqqxxxqqqqqqqxxqxxqxxqxqqxxqxxxxxqqxqxxqqqxxqqqqqqxqqxqqxqxxqqqxxxxqqqxxqxqqqqxxxxqxxxxxqxxqqqqqxxxxqqqxxxxxqxxxqxxqqqqqqxqqxqxxxxxxqxqqqxxqxxxqxxqxxxqxqxqxxqqqqxqqqxxxxqxqqqxqxqxxxxxqxqxxxxqxxqqqxqqxxxxqxqqxxqxxqqxxxqxxqxxxqqxqqqxqqxqqxxxxxxxxqqqxqqqxqqxxxxqxxqqqqxqxqqxxqqxqxqqxxqqqxxxxxqqxxqqqqxxxqqxxxqqxxxxqqqqxqxqxxqxqqxqxxqxqxxqxqxxqqxqqqxxqxxqqxqxxqxqxqxqxxxqqxxqxxqxxqqxxxxxxxqqxqqqqqqqxqxqxqxxqqxxqqxqxxxqqqqqqxqxxqxqqxxqqqqqqqxxxqqxqxxqxxqxqxxqxxxqqqqxqqqqqqxxxxqqqxqxxqxxqqxxqxqqxxxxxqxqqqqxqxqqxqxxqxqxxxxxqxqxxxqqxxqxxqxqqxqqxxqxqxxqxxxqxxxqqxxqqqqxqqxqxqxqqqxqxxxqqxqqxxxxxxxxqxxqxxqxxxxqxxxqxxxqxqqqqqqxqqxxxqxxqqqxqxqxqxxxqxqqxxxxqxxqxqxxqxxqxqqqxxxqqxxqxqxqqxxxqqqqxxxxxxxqxxxqqqxxqxqqxxxxqqqqxqqxxxqqqxqxxxxqqqqqqxqxqqqqqxqqxxqxxqqqqxxxxxqqqxqqqqxxqxxxxqqxxxqqxqxxqqqqqxxxqqqxxxxxqxqqxxqxxxqxqqxqqxxqxqxqqxxqqqqxxxqqqxxxxqxqxqqqxqxxqqqxqxqqxxqqxxxqxxqxqxxxqxqqxxxqxxxqxxqqqxqxqxxqxxxxxxqxqxqqqqxxqxqqqxqxxqqqxqqqqxqqqxqxxqxqqqxxqqxxqxxqxxqxqxqxqqxxxqxxxxxqxqqqqqxqxqxqxxxxqqxqqxxqxqxqxxqxxqxxqqxqxqxxqxqxqxqxqqxxxqxqqxxqxxqxxqxqxqxxqqxxqxxqxxxxxqxxxxqxxqxxxxxxxxxxxxxxqxqqqxqxxqqxxxqxxxxqqqqqqqqxqxqqxxqqxxxxqxxqxxqxqqxxqxxqqqxqxqqxqxqqqxqqxqqqqqqxxxxqxqqxxqqxxqqqxqqqqqxqqxxqqxqxqxxqxqxxxxxqxqxxqxxxqqqxxxxqqqxxqxqqxxxxqxxxxxqxqqqqqxqqxqqqqqxqqxxqxxxxqqxxxxqxxxxxqqqqxqqxqxxxxqqqqqxqqxxxqqqxqxqqxqqxxqxqxxqqqxxqqqxxqqxxqxxxqxxqqxxxqxxxqqxqqqxxxxqqxqqxxxxqqxxqxxqxqqqxxqxxxxqqxqxxqqxqxqxxxxxqqxxqxqxqxxxxqqxxqxqqxqqxqqxqqqxqqqqxqqqqqqqqxqxxqxxqqqqqqqxxqxqxqqxxqxqqqxqqxqxxqxxqxxxxqqqxxqqqqxxxxxqxqqxxqqqxqxxxxxxxxxxxxxxxqxxqxxqqxqqqqxxxxxxxxxxqxqqxxxxxxqxqxxqxxqxxqqxqxxxqxqqqqxqxqxqqqqqqqxxqqqxxxxqqqqqxqxqxxqxqqxqqxxxqqqxxqxxqqqqxqxxqxxxxqqxxxxqqqqqqxxqxxqxqxxqxxxqqqxxqqqqqqqqxqqxxqqqxxqxxqxxqxqxqxqqxqqqxxxqxqxxqqqxxxqqxxxxqxqxqxqqxqqxxxqxqqqqxxxxqxxxqxxqqxqxqqxqqqxqxxxqxqxqqxxxqxxqxxqxqqqxxqqqqxqxxxxxxxqxqqxxxqxxqxxxxqxxxxxqqxxqxxxxqqqxqqqqqxxxqqqqxxxqqxxxqqqqqqxxqxqqqxxxqqqqxqxqqxxxqqxqxqqqqxxxqqqxxxqqqxqqxxqqqqqqxxxxqxxqqqqxxqqqxxxxqxxxxqqxxqxxxqxqxxqxxxxxxqxqqqqxqxqxqqqxxqxxxqqqqxqxxxqqqqqxxqqqqxqqxqqqxqxxxqxqqxxqqxxxxqxxxqqqxqqxqqxxxxxxqqqqqqxxxxxqxxqqxqqxqqqxxqqqqxqxxqxqqxqxxxxqqqqqqqqxxxqqqqxqxqxqqqqxqqqxxqxxqxqxxxxqxqqqqxqqqqqxxxqqxxxqqqxxqqqqxqqxqqxqqqxqxxxqxqqxxxxxxqqqxqxxqxxqqqqqqxxqqxxxqxxxqqxxxxxqxqxxxqxqqxxxxxxxqxqxqxxqqxqqqqqxqqqqqqqqxqxqqqxqqxqxxxqqxxqxqqxqqqxqxqqqqqqxxqqxqxxxxxxqxxxqqqxxxxxxxqqqqxqqqqxqxqxxqxqxxqqxxxxxxqqxxqxxqqxqxxqqqxqqxqqxqxqxxxxqqxqqxxqxxxxqxqxqxqxxqqqqqxxxqqxqxqqxxqxqxqqqxxqqqqqqqxqqxqxxxxqqxqxqqxqqxqxqxqqqqqqxqxqxqqxqxxxxqqxqxqxxxqqxqxqxxqqxqqxxxqxqqqqqxqqxqqxxxqxxqxqqxqqxqqqqxqqxqqxxqqqxqqxxqxxqxxxxqqqxxqxxxxxxqqxqxxxqxqxxxxxqxxqqqxqxxqqxxqqqxqxxxqxqxxxqqqxxqqxqxqxqxxxqxxxqxxxxxxxxxxqxqxqxqqqqqxqxqqxxqqxqqqxxxqxqqqxqxxxxqxxqxxqqxxxqxqxqxxqxxqxxqxqxxqqqqxxqxxxqxqqxqxxqxqxqqqqxxxqxqqxqxqxxqxxxxxqxxxxxqqqqxqxxxqxqqxqxxqxxqxxxqxxxxqqqqqxxqqqxqqxqxxqqqqqxxxxxqxqxqqxxqqxxxxxxqqxxqqqxqqxqxqqqxxxxxxqxxqxqxqxxqxqxxxqxxqqxqxxqqqxqxqxqxxxqxxxqqxxqqqxxxxxxxqqxxxxxxxxqqqxqxqxxqqqxqxxxxqqxqqxqxqxqqxxqxxqqxqxqxxxqqxqxxxqqqqqqxxxqxxxxqqxxqqqqqxqqqxqqxxqqqqqxxxqxxxxqqqqxxqxqxqqqxxxqqqqxqqqxxqxxqxqqqxxqqqqqqqqqxxxqxqxqqqqxxqqxqqqqqxxqxxxqqxqqqqxxqxqqqxxqqxxqqxxxqqxxxqxqqxqxqxxqqxxxxqqqxxqqxqxxxqxxxxxxqqxxxqxqqqqxqxxxxqqxxxqxqxxxxqxqxqqqxqqqqxxxxxqqqxqqqqqxxqqxxqqxxqxqxxxxqqxqxxqqqqxqxqqxqqxxqxqxqxxxxxqxqxxqxxxxqqxqqqxqqxqqxqxxxxqxxxqqxxxxxxxxqqqxqxxxqxxxqqqxxxqxqqxxqxqqxxqxxqxqqxqqqxxqxxqxqxqxxxxqxxxqxqqqqqqqqqxqqxxqxxxxqxxqqxqqxqqxqxxqxqqxqxxxxqxqxxxqxqqxqxqqxqxxxqqxqxqqxqqxqxxqxqxxxxxqxqxqxxqxxqxqqqqxqqqqxqqqqqqxqqqxxqqqxxqxqxxqxxqqxqqqqxxqqxxqxxxxqqxxxqqqqxxxxxxqqqqxqxqxxqxqqxxqqqqqqqqxqqxxqxqqqqxqqxxqqqxqxxxqxqqxxqxqqqxxqxxqxxqxqxxxqxqqxxxxqxqqqqqxxxqqxxqqxxxqqxxxxxqxxxxxxqqqqqxxxqqqqqxxqqqqxqxqxxqxxqqqqxxxxxqxqxxxxqxqqqqqqxxqxqqqxxxxqxqxxqxxqxxqxxxxxxqqxqqxqqqqqqqqqqxqqxxxxqqqxxqxqxqxqxxxqxxxxxqqqqqqqxxqxqqxxqqqqxqxqxqqxqqxqxxqxqxxxqxxxxqxxqxqxqxqqqxxqqxxqxxqxxxqqqqqxxqxqqqqxqqxqxxqqqqxxxqqqxxqxxxxqqxqqqxxxxxxqxxxxxqqxxqqxqxxxxqxxxqqxxxxxqqxxxxxxqqqxqxxxqqxqqxxqqxxxqxqqxqqqqxxxqqxqxqqxxqxqxqxxqqqqxxxxxqxxxqxqxqxqqxqxxxxxqqxqxxqqqxxqxqxqxxqqxxqxqqxxxxqxxqqqxxqqxqxxxqqqqqxxxqqqxqxxxqxqxqxqqxxqxxqxxxxxqxqqqxqqxqxqxqqxxxqqqqqxxqxxqxqqqxxqqqqqxqxxqqxqxqxxxqqqxxxxqxxqxxqxxqxqqqqqxqxxqxxqqxxxqxqxxqxxxxqxqqxqqxxqqqxxxqqxxqxqxqxqxxxxqxqqqqqqxqqxxxxxxxxqxxxqqqqqqxxxxqqqxxqxqxxxxqxxxxxxqxqxxxxqqxqqqxxxxxxqqxqxxxqqqxqxqqqqxxxxqqqxqqxxxqxxxqqqxxqxqxqxxqxqqqxqqqxxqxqxqxxqxqqxqqxqqqxxxxqqqxxqxxxxqxqqqxxqxxxqqqxxqxxqqxqxxqxqqqqqqxxqxqqqqxxxxxqqxqqxxqxqxqqxxqqqxxxqqqxqxqqqqxqqxxqqqxxxqqxxqxqxqxxqqqqqxxxqqqqqqqqxqqxxxqqqqxqqxqxqxxxxxqqqqxxqxqxxxqqxqqxxxxqqqxxxxqqqqxqqxqxxxqxqxqqxqxxxqqxxqqqqxqqxqxqxqqqqxqqqxqqxqqxqqqqxqxxxqqqxqxqxqxxxxxxxqqqqqxxqqxxxqxqqqxqqqxqqxxqqxqxxxxqxqqqqxqxqqxqqxxxqqxqxqxqxxxqqqxxqqqqqqxqqxxqqqxqqxqxxxqqxqqqxxqqxxxxxqxqxxxqqqxxxqxqxqxqxxxqqqqxqqxqqxxqqqqqqxxqqxqqqqqqxqxxqqxqqxqqxxxxqqxqxxqxqqqxxqxxqqxxxqxqqxqxqxxqxxqxqxxxqqxxxqqxqxxqxqxqxxxxqxqqxxxqxqqxxqxxqxqxxxqxqxxqxxqqqqxqxxxxqqxxxqqxxxqqxxxqqqqqqxxqqxqxqqxxqxxqxqqqqqqxqqqqxxxxxqxxqqxxqqxqqqxxxxxxxxxxqxxqqqqqqqxqxxxxxxxqqqxqxqqqxxxxqqqqxxxxqxxxxxxxqqqxqxxxqxxxxqqqqxqqxxqqqxxqqqxxqxxxxxqqxqqqxqqqxqqxxxqqqqqqqqxqxxqqqxxqqqqqqxxxxqqqxxqqqqxqxxqxxxxxxqqqxqqqqxxqqqxxxqxqqqqqxxqqxxxqqqqqxqqxxqxxqqqqxxxqxqxqxqqqxxxqqxxxxqqxxxxxxxxqqqqxqxxxqxxxqqxxqqxqxxxqqqxxxxqqxxxqqqqqqqqxxxxxqqxxqqqxqxqxxqxqqqqxxxqxxqqqqqqxqxqqqxxqqxxxxxxqqqqqxqxqqqqqxxxqxxqqxxxqqxqqxxxxqqxqxxxqxqxxxxqxqxxxqqqqqxqxqxxqqqqqxxqqxqxqxxxqxqqxqqqqxxqqxxqxqxqqqxxqxxqxxxxxxqqqxqxqqqxxqxxqxqqqxxqxxqxqxxxqqxxqxxxqxxqxqxqqxxxxqqqxxxxqqqxqqqxxqxqxxqqqqqxqqqqqxxqqqqqqxqxqqqqqqqxqqqxqqxqqqxxxxqqxxxqqqqqqxxqxxxqqqxqxqqqqxxxqqxqxqxqxxxxxxxxxqxxxxxxxqqqxxxxqqxxqxxxxxqqqqxxqxqxxxxxqxxqxxxxqxqqqxqxqxqxqxxxqqqxxqqqxqxxxxqxqxqxxqqqxxqxqxqqxqqxxxxqxxqqqqxqqqxqxxxxxxxxxqxqxqxxqqxqqxqxqqqqxxxqqxqqxqxxxqqqqqqqxxxxqqxqxxxxqqqxxxxqqxqxxqxqxqqxqxqqqqqxxxqxxqxxqqxqxqxqxxxqqxqqxxqxqxxxqqqqqqqqxxxqxxxxqxxxqqxqqxqqxxqxqqqqqqqqxxxqqxqqqqxqxxxxqqqxqqqxxqqqqqqxxqxxxxqxxxxxxxxxqqqxxxqqqqxqqxqqxqqqqxqxxxqqqqxqxxxxqqqxqxxxqxqqxqqxxxqxqqxqqqxqxxqxqqxqxqqqxqqxqqxqxqxxqqqqxqqxqqxqqxxxxxqxqqxxxxxqxxqxqqxqqxxqxqxqqxqqxqxqxxqxqqqqxqxqqxxqxxqxqqqxqqqqqxxxqxxxxxqqqxqxqxxxxqxqqqqxxqxqqxxxqxxqxqqqqxqqxqxqqqxqxqqqxxxqxxxxqxxxxqxxxxqxqqxxqxxqqxxqqqxxqxqqqqxqxqxxxxqxxxqxxxxqqqxqqxxqqqqqqxxxqqqxqxqxxxxqxxxxqxqqxxxxxxxxxqqxqqxqqqxxxqqqqxqxxxqqxqqqxqxqqxqqxxqqqqqxxxxqxxxqqqxxxqxxxxqxxxxqqqqxqqxqxxxxqqqxxqxqqqqxxxqxxxxxqxqxqxqxxqxxqxxxxxxxqxqxqqqxqxqxxqqqxxqqqxxqqqxqxxxxxqxxxqqxqxqqxqqqqqxxxqxxqxxqxqxxqxxqqxxxqxqxxxxxxxxxqxqxqxxxxxqxxqqxxxxxxqqxqxxqxxqxqxxqqxxxqqxxxxqqxqqqxxxqxqqqqxqxxxqqxxqqqxqxxxxxxxqxqxqqxqqxqqxxxxxxqqxxqxxqxxqqxqxqxqxqxxxxqxqqqxxxxqqqxxxxxxxqxqxqxqqqqqxxxxqxqqxqxxqxqxxqqqqqqxxqqqxxqqxqqqxqxxxxxqxxqqxqqxqqxxxqqqxqqxxqqqxxqqxqxqxxqqqxqqqxqqqqqxxxqxqxqqxxxxqxxxxxqxqxxxqqxqqxxqxqqxxqxxqxqxxxxxqqxqxxqqxxxxxxxxqqxxqxxxqxqxqxqqqqqqqqqqxqxqxqqqxxqqxxxqxxqxxxxqxxxqqxqqqxxxqqxxqxxxxxxxqqqxxxqxqqqqqqxqqxxxqxxxxqqqqxxxxxxqxqqqqqqqxxxxxxqxqxqxxqqxxxqqxqqxxxqxxxxqqqqxxxxxqxqqqxqxxqxqxxxqxqqqxxxxqqxqxqqxqxqqqqqxxxqqxxqxqxqqxqqqxqqqxxxxxqxxxqxxqqqxxxxxxxqqqqqxqqqxxqxqqxxqxxxxxxxxqxxxqxxqqxxxxxqxqxqxxqqxqxqqxxxqxxxxxxqqxqqqqxqxxqxqxxxxxxxqqxqxqqxxxxxxxxxqqqqxqqxqxxxxqxxqqxqxxxqqxqxqqqxqqqxqqqqqxqqxqqqxqxxqxqqxxxxxqqxxqxqqqxqqxqqxxxqqqqqqqxxqxqxxxqxqxxxxxxxqxxqqqqqqxxxqxxxxqqxqqqxxxxqxqqxqqxxqqxxqqqqxxxqxxxqqqxqqqxqqqxqxxqxxqxqxxxqxxxqxqxqqxxqxxxxqxqqqqxqxxqqxqxqqqxqxxxxxqqxxxqxqqqqqqqxqqqqqqqqxxqqqxqxxxxxxqxqqxxxxqqxqxxxxxqxqxxxqxqqqqxqxqqqqxxxxqqqqxxxqxxxqqqxxxxqxqqqxxqxxqqqxqqqqxqxqqxqqqxqqxqqxqqqqxqqqqqxxqqqxxxxqqqxqqxxqqqqxqxqxqqqxqxxqxqxqxxxqxxxqxxxxxxxqqxxqxqxxxqqqqxxxqqqqqxxxxxxxqxxxxqqqqqxxqxqxxqqqqqxxxqqqqxxxxqqxqxxqxxxxxxqxxxxqxqqqxqxxxqxqxqqqxqqxxqxxqqxqxxxxxqxxxqxqqxxqxxxxqxqqxxqxxqxqxxqxqxxqxxqqqqqxxqxqqxxqxxxqxxqqxxqqqqxqxxxqqxxqxxxxqxxxxqqxxxxqxxxqqxxqqqqqqxqqqqxxqxqqqqxqxqqxqqxxqqxqxxxqqxqxxqqxqqqxxxxqqxqqxqqqxqqqqqxxxxxxqqqxxqxqqxxqqqqxqxqxxxxxxqxqqxxxxqxxqxqqqqxqxqqqqxqxxxqxqqxxxqqqxqxqxqxqxxxqqxqxqqxxqqqqqqqqqxqqxxqxxqxqxqxqqxxxqqxxxqxqqqqqqqxxxqqqqqxxxxqxqqqxqqqxxxxxxxxqqxqqxxqqqxxxqxxqqqxxqqxqxqxxxqxqqxxqqqqxqqxqxxxxqxqqxxxxxqqxqxqqqxxxqqxxxqqqxxqxqqqxqqqqqxqqxqqxxxqxqqqxxxqxxqqqxxqqxxqxxxxqqqqqxxqqxqxqqqxxqqqqqxqxxqqqqxxxqqqxqqxqxqqxxxxxqxqxxqqqqqxqxxqqqqqqqxxxqxxxxqqxqxxxxqxqqxxqxqqxqqxqxqqxxqxxqqqxqqqqqxqqxxxxqxqxqxqqxqxxxxxqqqqqqqxxqxxqxqxxqqqxxqxqxxqqqxxqqqqxxqqqqqqxqqxqxxqxxxxqqxxqqqqqxxxqqqqqxxqqxxqxxxxxqqqxqxxqqqxqxxqqxxqxqqqxqqxqqqqqqqqqxqxqxqqqqqxxxxqxxqqqqxqqxxxxxxqxqqxqxxxxqxqxqqqqqxqqxxxqqxqqxqxqqxqxqxqqxxqqqxxqxxxxxxxqqxqxxqqqxqxqxqqxxxxqqxxxxqxxqxxqxqqxqqqxxqqxxxqqqqxxxxxqxqxqqxxqxxqqqxqqxxxqqxqqxxqqxxqxxxqqxxxxqxqqxqxqxxqqqxxqxxqxqxxqqqqxqqqqqqxxqqxxqxqqxqqqqqxqqxxqqxxqxxxqxqqxxxxxxqqqxxxxxxqqxqxqxxqxxxqxqqxqxxxxqqqqqxqxqqxqxxqqxqqxqqxxxqxxxxxqxxxxqqxqxxxqxqqxqqqqqqxxxxqxxqqxxqxqqxxxxxxxxqxqqxxqxqxxxqqqxqxxxqqxxqxxxxxxxxqxqxqxxqxqxxqqqxqxxxqqxxxqxxxqqxxqqqqxqxxxxqxqqqqqxxxqqxqqxqqqxqxxqxxqxxqqxqxqxqxqqxxqxxxxqqqxqqxxxqxxqqxxqxqxxxxxqqxqxxqxxxxxxxxxqqxqqqqxxqqqqxqqqqxqqxxqqqxxxqxxxxqqxxxqxqxxqxqqxxxxqqqxxqqxxxqqxxqqxxxqqqxqqxxxxqqqqxqqxqqxxqxxqqxqqxxxqxxqqqqxqqxxxqqxxxqqqqqqqqqqqxxxqqxqxxxxqxqqxxxxxqqxqqxxxxqqxqxqqqxqqqqqxxqqqxxxxqxqxqxqxqxxqxqxxxqqxxqqxxqqxxqxqxqqqxqqqxxqxqxqxxxxqxqxqqqqxxxxxqxxqqqqxxxxxxqqqxqxqxqqxqqqqqqqqxqxqqxqqqxxqxxqqxxxxxxqxxqxqqqxxqqxxqxxxqqxqqxqxqxqqxxxqqxqqxxqxqxqqxqxxxxxxqxqxxxxqqqxqqqxxqxqxqxxqxxqxxqxxxxxxqxxqxxxqxxqxqqxxqqqxxxqxqxqqxxxxxxxxqxqqxxqqxqxqxqxqxqxqxxqxqqqqxqqqxxqxxqqxxxxqxxqxqqxqqxxqxxqxqxqqxqxqqqqxxqqxqqqqqqxxqxxxqqxqxqxxqxqxqxxqqxqqxxqqxqxxxxqxqxxxxqqxxxqqxxxqqxxqxxqqqxqqxqqxqxxqxxqxxqxqqqqqxqxxxxxqqqqqqxqxqxxqqxxxxxxqqxxxqqqxqxxxqxxqqqqqqxqqxxxqqqxqxqxxqxqxxxqxqqxqxxxxqxxxxqxxxxxqxxqqqxqqxqxqqqqqqxxqxqqxqqxqxxqxxxqxxqqqqqxxqqqxxxqxqxxqqxqxqxxqqxqxqxqxxxxxxqqqxxqqqqxxqqxxqxqxqxxqqqxqqxxqqqqxqxxqxxqqqqqqqqxqxqxqxqqqxqxqxqqxqqxqxxxqxqxqxqxqqxqqqxxqxqxxxxxqxxxqxxxxqxxxxxxxqqxxxxqxxqqxqqqqxqxxxxxxxqxxqxxqxxxxqqqqxqxqqqxxqxqqqxqqqqxqxqxqxqqqqqqqqxqxxxxxxxxxqqxqqxxxxqqqxqqxqxqxqqxqxxxqqqqqqxxxxqqqqqxxqqqxqqxqxxxxqxxxqxxxxqqqqxqqqqqqqqxqqxxxqqxxxxxqxxqxqxqxqqxqqqxqxxxqxxqqqqxxqqxxxqqxqxqxqqxqqxxxqxqqqxxqqxqxxxqxqqqxqxqxxqqqxqxxqqqxxxxqqxxxxqxxqqqqqxxxqqqxqxxxxqxxqxqqqqxqxxqxxxxxxqqxqqqqxxxqxxxqqxqqqqxxxxqqqqqqqqxxxxxxqqqqxxqxqqqxxxqqqxqxxqxxxxqqxqxqqqxxqxxxqxxqqqqqxxxxxqqqqqxxxxqxqqqqqxxqxqqxxxqxqxqxqxqqqqxxxxxxqxxxxqqqxqxqqxqxxqqqqxxqxxxqqqqxqqxxqqqqqqqqqxqxqqxqxqxqxxqqxqqqxqxxqxqxxqxqqxxqqqqqxxqxqxqqqqqqqqxxxqxxxqxqqxqxqxxqqxqqqqxqxxqxxxxxxqxqqqxqxxxxqqxxxqxxxqqxxxqqqxqqxqxxqxxxxqxxxqqxqqqqqxxxxqxxqxxxqqxqqqxqqxqqxqqqqqxxxqxqxxqxxxqqqqxqxxqxxxqqqxxxxxxxxqxqxxxxqxxxxqqqxxxqxqxqxxxxxxqxxxxxxxqxqqxxqxxqqxqqxqxqxqqxqqqxxxxxqqqxxxxxqqqqqxxqxqqqxxxxqxxqxxqxxxxqxqxxxxxxxxxqxqxxxqqxxxxqxqqxxxqqqqxxxxxqxxxxxxqqxqqxqqqxqqxqqqqqqxqqxxxxqqxxqqxxxqxqxqxxxxxxqxqxxxqqqqxqxxqqxxxxqqxxxqqqxqqqqqxqxqqxqxxqxqqxqqxqxqxqqqqqqqqxqxqqxqxxxxqqqqxxxxxqqxqqqxqqqxqqxxqqqxxqqqxqxqqqxxqqqqxxxqqqqxqqqxxxqqqqqxqqqqqqxxqxxxqxxxqxqxxqxxxxxxxqxqxxxqqqxqxxxqxxqqqxxqqxqxxqqqxxxqxqxxxxqqxqqqqqxqxqqqxxqqqxqqqxxxxxxxqxqxqqqxqxqqqqxxqqqxqqxqqqqxxqxqqqxqqxxxqqqqxxqqqxqqxqxqxxqqxqxqxxqxqxqqqxxqxxxqxqqxqqxxxqxqqqqxqxqxqxxqxqxxxxxxxqqxxqxxqqqxxqxxxxqxqxqxqqqqxxxxqxxxxqqqqqqqqqqxqqqxxxqqxqqxxqxxqxqxxxxxqqxxxxxxqxqxqqqqqqxqxqqqxqqqxxqxxqxqxqxqqxqxxxqxxxqqqxxqqqxqxqxxxxxqxxxqqqxqxqxxxxxqxxqxxxxxqqxqqqqqxqxxqxqxqxqxxqxqxqxqxqxqxxxxxxqqxqqxxqxxqxxxxxqqqqxqxxxqqxxxxqxxqqqqqxqqxxqqqxqxqqqxxxqxxxxqqqqqxqxqxxqqxxxxqxxqqqqxxxxxxxqxqqqxqqqqxxqqqqxqxxxxqxxxqxqqqqxqqqxqqxqqqxqqxqxxxxqqxxxqqxxqqxqxxqxxxqxxqxxxqxxxqxxqxqqxqxxxxqxxxxxxxxxxqqxqxqqxqqqxqqxxxqxqxxxxqxqxxqxqxxqxxqqxqxqqqxqxqxxxqxxxxxqxqqqqxqxqxqxxqqxqxxqqqxxqxxxqxqxqqqqxqxxxxqxxxqxqxxqqqqxqxxxqqxqqxqxxqxxxqqqqxxqxxxqxxqqqqxqxqxqxqqxxxxxxqqqxqxqqxqqqxqxqqxqxqxxxqxqxxxxqxxqxqqxqqqxqqqxqqqxqxqxqxqqqxxxqqqqqxqqxxxxxxxqxqxxqxqxqxxqqxqqxqxqqxxxxqqqxqxqqxxqqqxqqxqqxxxxqqqxqxqxxxqqxqqqxqqqqxqqqqqqxqqqxqqqqxxqqqqxqqqqqxqqqqqxqqqxqxxxxqqxxqqqqqqxqqxxqqqxxqxqxxqqqqxxxqqxqqqxxqqxxqxqqqqxqqxqqqqxqxxxxxxqxxqxqqqxqqxxqqxqxqxxxqxqqxxxxqxqqqqqqxxqqxxqxqqxxqxxxxqqxxqqxxqxqqxxxqqxxqqqxqxxqxqxxxxqqxqqqxxxqqxqxxxqqqxqqxqqqqxqxqqqxqxxxqxqqqqqxqxxxxqqxxqqqxqqxqqqqqqqxqqxqqqxqxxqqxxqxxxqxqxxxxqxxxqqqqqqxqxxqxxqqxqxqqxqqqxqqxqqxqxqqxxxxxxqxxxqqxqxqxqxqqxqxxqxxqxqqqxxxqxqqxxqqqqqxxqqqqxxqqxqxxxqqxqxqxxxxqqxqxxqxxxxxqxxqqqqqxqqxqxxxxxqxxxqxqxxqqqqxxqxxxxqxqqxqxqqxxqxxqqxqxqxxqxqxqxqxqqqqqxqxxxxxxxxxxqqxxxxqxxqxxqqqqqxxxqxqxxqqxqqxxqqqqqxxqxqxqxxqxqxqqqqxxxxqxqqqqqxqqqqxqxqqqxqxqqqqxxqxqxqxqxxxqqxqxxxxxxxxqqqqxqxqqxqxqxqqxxxqxqqqxxqxxqqqqqxxqxxqqqqqxqqxqqqxxxqqqqxxxxxqqxxxqqqxqqxqqxqxqqxxqqxxxqxqxqqxxxxqqxqqqxxxqqxxxxqxxxqqqxxxqxqxqqqqqqqxqxqqqqxxxqqxqxxxqqxqxqqqxxqqqqxqxxqxxxqxqxxxqxxqqxxxqqqqqxxxxqqxqqxxqxqqqqxqxxxqqxqxxqqxqqqqqqqxxqxxqxxxxqqxxxxqqxqxxxxqqqqxxqqxxqxxxqxqqqqqqxxqxxxxxxxxqqxqqxxqqqxxqxxxxqxxqqqqxxxqxqxqqxxxqqxqqqxxxqxxxxqxxxqxqxqqxxqqxxxxqxxxqxqqqxxqqxxxqqxqqqqxqqxqqqqxqqxqxqxxqqqqqqxxxqxxxxqqqqxqxxqxqqxxxxqqqqxxxqqxxqqqxqqqxqxxqqxqxxqxqqxqqqqxxxqqxqqqxqxxxqqxqqqqqqxqqqxqxqqqqxxqxqqqxqqxqqqqxqqxxqqqxqxqxqxxxxxqxqqqqqxxqxxxqqxxqxxxxqxqqxxxqxqxxxxqxqqqqxqxqqxqqxxxxqqxqqqqxxxqqqqxqxqxxxqxxxxqqxxqxxqxxxqqxqqqxxxqxxqxxqxqxqqqqqxxxqxxxxxqxxqqqxqxxqqxqxxxxxqqqqxqqxxqxqqqxqxxqqxqqqqqxxxxqqxxxxqqxqqxxqxxqqxxqqxqxxxqqxqqqqqxqqxxqqqxxqxqxqqqqxxqxxxqqqqxxxqqxqqxxqqxqxqxqxqxqxqqxxqqqqxqxqxqqxqqxqqxxxqqxqxxxqqqqxqqqxqxqqxxqxxqxxqqqqqqqqqqxxxxxqxxqqxxqqxxqxxxxxxxqqxqqxxqqqqqxxxqxxxxxxqxqqxqxqqqxxqqqqxqqqxxqqxxqxxxqqqxxxqxqxxxxxxqqxqxxxxqqxxqxxxqqqxxxxqxxxqxqxqqxxqxxxqqqqqqqxxqxxqqqxxqqqqqqxxxqqxqxqxqqqxqqxqxxxqxxqqqqqqxxxxqxqxxxqxqxqqqxqxqxxxqxqqxxqqxqqxqqqqxqxxqqqxxqqqqqqxqqxxxxxxxxxxxxxxqqqqxxxxxqxxqqqxqqqxqxxxqqqqxxqqqxxxqqqxqqxxqxxqqqqxxqqqxqxqxxxqqxxqxxxxxxqxqqqqqxxqqxxqqqxxxxqxqqqqqxqxxqqxqqxxqxxxqxxxqqxxqqxxxqqqqxqqqqqxxxxqxqxxqxqxqxxqxqxqqqxqqqxqqxqqqxxqqxqxqqqxqxqqqxxqxqxqqqxxqxxqxxxxxxqqqqxxqqqqxxxxqxqxxxqxxxqqxqxxxqxqqqxxxqxqxqqqqqxxxqqqqxxxqqqxqqqqxqqqxxqqxqqxqxqqqxxqqqqqqxxqqqqqqqqxqxqxxqxxqqqqxxqqqxqqqqqqxxxqxxqqqxqqxqqqqxxxxxxqxqqqxqxxxxxxxqxxxxqxqxqqxxxxqxxxxxqxxxxqqqxqxxxxxxqxqxqxqxqxqxxqxxqxqxxqxxqxxqxxxqqxqqqxxxqxqqxxxxqqqxxxqxqqxqxxxxxqxqqqqqxqxqxqxxxxxxxxxxxqxqxqqqqxqxqxqxqxxxxqqxqxxqqxxqqqqqqqxqxxqxxqqqxqqxqqxqqqxxqqxxqqxxxxqxqqqxqqqxqxxqxqqxxqxqxqxxxqqxqxxxqxxxxxqqqqxqqqxqxqxxxxqqxxqqxqxxqqxxxxxqqqqqqxxxxxqxqqxqxqqxxqqqqqqqqqqqqqqqqxxxxxxxqqqqqxqxxqqxxxxxqqxxxxqxqqxqqqqxqxxxqxqxxqxqxxqqqxqxqxxqqqxqxxqxxxqxxqqqxqxxqxqqxqqqxqxxxxqxqqxqxxqxqqxxqxqqxqqqqxxxqxqqxxxxxqxxqqqxqqqxxqxqxxqqxxqqxqxqqxqqxqxqxqqxxxxqqxqqqqqqqqqqxqxxqqqxqqqxxxxqxxxxxxqqqxxqxqxxxqqxxqxxqqxxqqxxxqxqxqqxxqqxxxxxxqqqxxxqxxqxqqqqqxxxxqqxxqxqxxqqqqqqxqxqxqxxqxqxqxxxxqqqqqqxxqqqxqxxxxqqqxqxqxxxxqqxxxxxxqqxqxxxqxxqqxqqxqqqxxxxqqqxqxxxqxxxqqxqxqqxxxxxqqqxqqxxqxxxxqqxxxxqxqxxqxxxqxxqqqqqxqxxxxxqqqqxxqqxxxqxqxxxxxqxqqxxqxxqxqqxqxxxxqqxqxqxqxqxqqqqqqxxqqqxxqqqxxxxxxxqqqxxqxqxqqqqqxqxqqxqqqqqxxxqxxqxqqqxxxqqqxqqxxxxqxqxqxqxxxxxqxqqqxqxqqxqqxqqqxxxqxqxxxxxqxqqxxxqqqxqxqxqxqxqxqqqxxqxqxxxqqxqqxxxxxxxqxqxqqqxqqqxxqqxqxqqxxqxqqxxqxxqxxxqxqxxxxxqxqqxxxqqqqxxxxxqxqqqxqxqqxqxxxxxqxqqxqxxqqxxxqqqxqqqxqqqqxqqxqqxqqxxxxxxxxqqxqxxqxxqxqqqxqqxqqxxxqqqqqxqxxqxqqqqqxqqqqqxxxqxqxqxxxxxqxxqxxxxxqxxxqxqxxxqqqqxxqxxqxxxxxqqqqxxqqxxxxxxqqxxqqxqqqxqqxqxqxqqxqqqxqxqqqxqxxqqxqqqxxxqxqqxxxxqxxxqqxxqxqxqqqqqqqxxxxxqqqxxxxxxxxqqqqxqqxxxqxxqxqxqxxqxqxxqxqqqqqqqqxxxxxqxqxxqxxqxxqqxxqqxxxqxqqqqqxqqxqxxqxqqxxqxxqxqxqxqxqqqqqqxqqxxxqqxxqxqxqqxqxqxxxqqqqqqqqqqxqxqxxxqxqxxxqxxqqqxxxqxxxxqqqxxqqqxqqxqqxqqxxxxqxqqqxxxqxxqxxxxxxqxqxxxqqqqqxqqxxqqxqxxxxqxqqqqxqqxxxxxxxqxxxqxqxqxqqxqxqqxxxqqqxqxxqxqxxxxqqxqqxqxxxqqxqxqqxxxqqxqqxqqxxxxqqxxqxxqxqxxxxxxqqxxqxqxqxxqxxqxqxxxxqqqxqqqxqxxqqxqxxxqqxqqqxxqqqxxxxxqxxxqqqxqqqxxxxqxqqxxqxxxqxxxqqxxxxqxxxqqqxqqqxqqqxxxxqqqxxqxxxqxqxqxqxxxxxxxqqqqxqxxxxxxxxxxqxqqxqqxxqqxqqqxxqqqqqxqqqqqqxqqqxqxqqqqxqxqxqxxxxqqxqxxqqxqqxxxqxxxxxxqxxqxqxxxxxxxxqqxqqxqxqxxqxxqxqxxxqqqqxqqxqxxqqqxqqxxxqxqqqqqqqqqxxqxqxqqxqxqqqqxxqxxxxxqxxqqxxqqqqqxqxxxqqqqxxxqxxxqxxxqxqxxxxxxxqxxqxxxxqxxxqxxqxqxqqqxqxxxxxxxqqqxxqqqqqxxqxqqqqxqxqxxqxxqqqxxxqxxqxxqxxxxxxqxxqqqqqqqxqxxxqxqxqqqxqqqxqqxqxxqxxxqxxqxxxxxxxqxxxxxxqqqxxqqxxxqxxxqqxxqxxqqqqqxxqxqqxqqxxxqxxqqxxxqqqxqxxxqqqxxxxxqqxqxqxqxxxxqqxxxqxxqqqqqqxxqqqxxqxqqqxxxxqxxqqxxqqqqxxqxxxqqxqqxxqxxxxxqqxqqxxqqxqqqqxxxxxqxqqxxxqxxqxxqxqqxxqxqqqxxxqxqqqqqxqqqqxqqqqxqxqqqqxqxxqqqxqxxxqqqxqxqxxqqqxxqxqxqqxxxqqqxxqqqqxqxxxqxxqxxqqqxqqxxqqxxqxqqxxxqqqxqxqqqqqxxqqxxqqqxqqxxxxxqxxqqqqqxxxqqqqxqqxqqqqxqxxxqxxqxxqxqqxxqqxqqqqxxxxxxqxxqxxxxqqqxqxqqqxxqxqxxxqqqqqxxxqqxqqqqqxxqxqqxxxxqqqqqqxxxxqqxxxqqqxxxxxqqxqqqqqxqxqxqqqqxqxqxqxqxxqqxqxxxqqqxxqxqxxqxqxxxqqxxxxqxxqxqxqqqqqxqqxxxxxqqxxxxqxxxxxxqxqxqxqqqqqxqqqqqxqxxxqqqqqqqxxqqxqxxxxqxqxqqqqxxxxxqxqqqxqxxxxxxxqxxxqqxxqxqqxqqqxqqxqxxxqxqxqqxqqxqxxqxqxxqqxqqxxqqxxxqqqqqxxqqxxqxxxxxxqqxxxxqqqxqqqqqxxqqqqqxqqxqqxqqqqqqxqxqxxqqxqxqxxqqxqqqqqqqxxxxqqxxqqqqxxxxqqqqqqqqqqqqqxxqqxxqxqxqqxqxxqxqxxqqqqxqqqxqqxxqqqqxxqqqxqxqxxqxxxqqxxqxxqqqqxxqqqqxqxxqxqqxxqqxxxqxxxxqxqxqqxxxqqqxqqqqxxxqqxxqxxqqqxqxxxqqxqxqqxxxxxxqqxqqxxxqxxqxxxqxqqqxqqqxxqxxqqxxqxqqqxqqqqxxqqxqxxqqxxxqxqqqxqxqxqqqxxxxxxqqxqqqqxqxxxqxqqxqxxxxqqqqxxqqqqqqxxqxxxqxxqxxqxxqxqqqxxxxxqqqxqxqxqqxqxxxxqxxxxxxxqqqxqqqxxxqxxxxxqxqqxqxxqxqxqqqxqxqxqxxxqxxxxxqxqqxqxxxxqxqxxxqqxqqxxqqqxqxxxxxqqqqqqqqqxxxxqxqxqqqxxxqxxqxxqqqxqxqxxqqxqqqqqqxqqqxqxxqqxxxqxxxqqxxxqxxqxxxxqxxxxqqxqxqxxqxxxqxqxxxqqqxqqqxqqqqqxqxqqxxxqxqqxxxxqxqxqqqqqxxxqxxqxqqxxqxxqxxqqqxxxqqxqxqqxxxqxxxqqxqxqqqxxqqxqqqxxxxxqxqqxxxqxxqxqqxxqxxxqxxxqqqqqqqxqqqqqxxqxxqxxxqxxxxqqxxxqxxxqxxxxqxxqxqqqxqqqqqxxqqxxxxqqxqqxxqxqxxqxqxxxqqxqqxqxqqqxqxqxqqxxxqqxxqxqxxqxxxqxqxqqqqxxxqxqxqqqxqxxxqxxqqxxqqqxqxqqqxxqqqqxqqqxxqqxqxxxqqqqxxqxxqxxxxqqqxqxqqqqqxqxqxxxxqqqxqqxxqqqxqxxqqxqqqqxqqxxxxxxxqxxxqqqqxqqqxxqqqxqqxqxxxxxqxxxxxxqxqxxqxqxxxqqqxxqqqxxxqqqqqqxqqqxqqxqxqxxxqqqqxqxqxqxqxqxxxxqqxqxqqxxxqxxxqqxxqqqxqxqqxxqxqqxxqxxxxqxxxqqxqxqqqxqqqxxqxqqxxqxqqqxqxxxxqxqxxxqxxxqqqqxxxxqqqxqqxxxqqxxxqxxxxqxxqqxxqqxxqqqqqxqxxxqxqxxqxqqqqxqxxqxxxqqqxqqxqqqxqxqxxqqxxqqxxxxxqxxxqxqxqqqqqqqxqxqqxqxqxqxqxqqxqqxxqxqqxqxxxxxqxxxqxxqqqqxqxqqxqqxqqqqqqxqxqqxqqxqxqqxxqxxxqqqqqxqxxqxqqxxxxxxxxqqqqxxxxqqxxxqxqqxqxxxqqqxxqxqqxxqxxxqxqxqqxxqqxxqxxxqqqqxxxqxqxqxqqxxqqqxqqqxqqqqqxxxxxxxqxqxxxqxqxxxxxqqxqqqqxqxqxxxqxxxxxxxxxqqqxxqqxqqqqxxqxqxqqxxxqxxqqxxxqqxqxqqxxqxxxxqqqqxxxqxqqxqxqqqqqqqqxqxqqqxxxqqqqqqxqxxqxxxxxxxqxxqxxxxqqxxqxxqxqxxqqqxxxqqxqqqxxxqqqxqqxqqqxxqqxqxxxxqxxxqxxqxqqqqxxqqqqxqqxqxqxxxqxxxqxqqxxxxqqqqqqqqqqqxxqqxxqqqqqxqqqqqqqxqxqxxqxqxxxqqqxqqxqqqqqxqxqxqxqqqxqxqqxqxqxxqxqxxxxqqqxqxqxxqqxqxxxxxqqxqxxxxqxxxxxqqqqqxqxqxxxxxqqxqxxqxxxqxxxqqqxqqqxxqxqqqxqqqqxqxxxxxqqqxxxxqqxxxxqqqxqxxxxxxxqqxqxqqqxxqxxxqxxqqqqqxxqqxxqxqqqqxxqqqxqqqxxqxxqxxqqqqxqxxxqqqqqxqxxqqxxqxqqqxqxxxxqqxqqqxqqqqxqqqqxqqqxxqxxqqqqqqxxqqxxqxqqxqxqqxqqqxxxxqqqxqqxqqxxqqqqqxqqxqxqqqxqqqqxxxxxxxqxqqxqxqxxqqxqqqqxqxxqxxxxxxqxqxxxxxqqqqxxxxxxxxqqxxqxqqxqqxqxxqxxxqxxxxqxxqqqqqxqqxxxqqxxxqqxxxqqqxqxqqxxqqqxqqqxxxqqxqxqqqqxqxqqxqxxqxxxqqxxxxqxqxxxxqqxxxxqqqxxxxqxqqxxxqxxxxqxqqxqxqqxxqxxqxxqqxqxqxqqxqqxxxxxxxxqxxxxxqqqxqxqqxqqxxxxxqxxqxqqxqxqqqqxxxqxxxxxqxxxxxxqxxxxxqqxqxxqxxqxxxxxqxqxxxxqqxqqxqqqqxxqqqqqqqqqqxxxxxqxxqqqxqqqqxqxxqxxxqxxxqqxxqxxxxxqqxxxxqqqxxqxqxxqqqqqxqqqqqxxqxxxqqqxqxqqqxxqqqqqxxxxqqqxxxxqqqqqxqqqqqxqqxxqqqqqxxxqqqxxxqqxqxqxxxqqxqqxqxqqqqxxqqxqxxqxqqxqxqqqqxqxxqxqxxxqxqqxxxxxxxxxxxqqxxqqxxqqqqqxqqxxqxqqxqqxqqqxxxqxqxxqxqqxxqqxqxqxxqxxxqqqxqqqxxqxxxqqqxxqqqqqxqqqqxxqqqxqxxqxqqqxxxxqxqqqxxqqqqqqxqxqxqqxqxqqxqqqqqqxqxxqxqqxxqqxxqqqqqqqqxxxxxqqqqxqxqxqxxxxqqxxxxqqqxxqqqxxqqxxqxxxxqxxxxxqqqqxxxqqqqxxqqqxqqqqxqxqxqxxxqqxqqxxqqqxqxxxxxqxqxxqxqxqxqxqqqqqqxqqxqqxqqqxqqxxxxxxqxqqxqqxxxxqxqqqqxxqqxxxxqxqxxqxxxxqqxqxqxxxqxqqxqqqxxxqqxxqqqqxxxqxxqqxqqxxxxqxqxxxqxxxqxxqxqxqqqxxqxxxxxqqqxqqqxqxqqqqxxxxqxxqqqqqxxqxxqqqxxxqqxqxxqqxxxqxqqqxqxqxxqqxxxxxxxqqqxqxxxqxqqxqqqxqxxqxxqqqqxqqxxxqxxqqxqqxqxqxqxqqxqqxxqqxxxxxxqqxqqqxxxqxxqqxqxxxqqxqxxxqqxxqqxqqxqxqqxxxqxxqxxxxxqqxqqqqxqxqqqqxqxqxqxqqxxxqqqxxxqxxxxxxqxxqxqqqxxxxxxxqxxxxxqxqqqqqqqqxqqxqqqqxxqqqxxqqxxqxqxqxqxxxxxqxqxqxqqxxxqqqqqqxxxxqqqxxqqxqxxxqqqxqqqqxxqqxqxqqxqqqqqqxqxxxxxqxqqqxqqxxqqqxqqqqqxxqqxxqxqxxxxqqxqxqqxqqxxqqqxxqqqqxqxqqqqqxqxqxqqxxqqqxxqxxxqxxqxqxxxqxxqxxqqxqxxqxxxxqxxqqqqqxxxqqxqqqqqqxxxqqxxqxqxqxqqxqxqxqqxqxqqqqqqxqqqxqqqxxxxqxqxqqqxxxqxqxqxxxqxxxqqxqqqxqxxxqqxqqxxqqqxxqxqxqqqqqxxxqqxqqqxxqqxqqxqqqxqqqxqqxqxqqxxxxxxxxqxxxxxqxxxqqxqxqxxqqxqxxxxxqxxxxqqqxxqqxqqxqqqxxqxxqqqxxqqqxqxqqxxxqqxxxqqqqxxqxqxxqxqqxqxqxqxqqqqxxqqqqxqqxqqqqxqxqqqxqxqxxxqqqxqxqxxxxqqqqqqxxqqxqqxqxqxxqxxqqqqqqxxqxxqxxqqxxqxqxqxqxqqqxxqxxxqqxxqqxxxxqqxqqxqqqqqxxqqqxxqqxxqxxxqqqqqxqqxxqxqxxqxxqxqqqxxxqxqqqqxqqqxxqxqqqxxqqxxqqqqqxqxqqxxqqqxqxxqxqxxxxxxqqqqqqqqxqxqqxqqxxxqxqxqqqqxxxqxqqxqxqxxqxqqxxqxxqxxqxqxxxqqxqxqqqqqqqqqxxxxqxxxxxqqxxxxqxxqxxqqqqqxxxxxqxxqqxxxqxqqqxqqxqxqqqxxqxqqxqqxqxxxqqqxqxqqqxqqxqxqqqxxxqqqqxqqxqxxxqqxxxqqqxqxxxxxxqxqqxqqqqqqxqqqqxqxqxxqqxqqxxqqqqxqxqxxxqqxqxqqqqqqxxxxqqqxxxxxqqxxxqqxxqqxqxxqxqqxxqqxxxqxqqqqqxqqqqxxqqxqxqqxxqxqxxqqqxxxxqxqqqqqqqqxxxqxqqqqxqqqxqxqxqqxqxxqqxqxxqqxqxxqxqqxxqxqxqxxqqqxqqxqqqxxxxqqqqqxxqqqqqxqqqxxqqxqxxxqxqqxqqqxxxqxxqqxxxqqxqxxqqxxxxxxqqqqxxqqxxqxxxqxqqqqqqqxqxxqxxxqxqqqqqxxqqqxxqxxxxxxxxqqqqxxqxqxqqxxqqqxqqqxqxqxxxxqxxxxxxqxqxxqqxxqxqxxxxxqqxxqxxqxxqxqqqqqxqxqqqqqxqqxqxqxxqqqxxxxxqqxxqxqxxqqqxxxqxqxxqxqxqqxxxqxxxqqxxxxqqqqxqxxqxqqxxqqqxqxqxxxqxqqqxqxqxqqxqqxxqqxxqqxqxqqqqxxxxqqqqqqqxqxqqqqqxqqxxqxqqxqxxxxqxqxqqqxqqxxqqqqxxxqxxqqqxxqxqxqxqxxxxqqqxqxxqqxqqqxxxxqxqqqqqqxxqqqxqxqxxxqxxxqqqxxqxxxqxxqqxqqxxxxqxqqqxqxxqqqqqqxxxqqxxxxqxxqxxxqxxxqxqqxxxxxqxqqqqxxqxqqxqxqxqxqxxqqqxxxxqqxxxqqqxxqqxqxxqqqqqxxqxxxqxxqqqqxqqqxqqqqxqxxqxqqxqxxqxxqqqqqxqqqxxqqqqqqxqxqxqqqqqxqqqxxqqqxqqqqqxxqqxqqqxqqqxqxxxqqxqqqqqxqqqqxxqqxqxxqqxxxqxqqxqxxxxqqxqqqxxxqxqxxxxxxxqqxqqxxqxqqqxxxqxqxxqqqxqqxqqqqqqxqqqqxxqqxxqqxxqxxxxxxxxqqxqxxxqxxqxxxxxqxxqxqxxxxqqqxqxqxxxxxxqxqxxxxxxqxqqxqqqxqxqqxqqqxxxxqxqxqqqqxqxqxqqqxqqxqqxxqxxqxxqqqxxxxxxqxxxqxqxqqqqqxxqqqxxxqxqxxxqqxqqxqxqxqxqxxxqxqqqqxqxqqxqxxqxxxqxxxqxqqxxxxxqqxqxqqqqxqqqqqqxqqxxqqqqxxqqqxqxxxqxxqqxqqxqxxxqqxxxxqqxxxxqxxqqxxqxqxqxqqqxqqxqxqqxqqxqxqxxqxxxqxqqqxqqqxqqxxqqxxqqxqxqxqqqqqxqqxxqxxxqqqqxxxqxxqxxxqqqxqqqqxxxxqqxxqqqqxqqxxqqqqqqxqxxxqqqqqxxxxxxxqxxxqqqxxqxxqqxxxxxqxxxqxxxqqxqqxxxqqxqxxxqqqxqqqqqxqxqqxqqxxqqqqxxxqxqqqqxxxxqxxqxqxqqxqxqqxqxxqxxqqqxxxxxqxxqxxqqqqxxqqqxqxxqqxxxqqqxqqqxqqxqxxxqqxxxqxxqqxxqxxxqqxxqxqqxqqqxqxxxqxqxxxxqqxqxxxqxqqxxxxxqqxxqqxqxqxqxxqxxqqxxxqxqqxxxxxxqqxqxqxxqqqqqxxxxxqqxxqqxxxxqxqqxxxxqqqqqxqxxxqxxxqxqxxqxxqqqxqqqqxxxqxqxqxxqqqqxxxxqqqxxxqqqqxxqxxqxxqqqxqqxqqxqqxxxxqxxqqxxxqqqxqxxqqqxxxxqxqqxxqxqqxqxqxxqqxxqqxxxxqqxqxxqxqqqxqqqxxqqxxqqxqxqqqxqxqxxqqqqqxxxxxqxxxxxqqqqxqxqqqqqxqqxxxqxqqxxqxxxxqqqqxqxxqxxxqxxxqxxxxxxqxxxqqqxxqxxxxqxxqxqxxxxxxqxqxxqqqqxxxqqxxxxxqxxqxqxqqqqxqqqxqqxxqqxqxqqqqqxxqxxqxqxqqqqqxqxqxqqqxxqxqqxqqqxqxqxxqxqxxqqxxqqqqqqxxqqxqqqxxqxqxqqqxxqxqqqqxqqxqxqqqqxxqqqxxxqxqxxqxqqxxxxqxxqxqxqxqqxxxxxqxqxqqxqxqqxxxqxxxqqqqqqxxxqxxqxqqxqqqxxxqqqxqxqxxxqqqxxxqqqqqxxqqqxxxxxxxqqqqqqxqqqxxxxqqqqqxqqxxxxxxqxqxxqxqqxqxqxqxqqqxxxxqqqxqxxqxxxqqqxqxqxxqqqxqqqxxqxxqqxqqxxqxqqxxxxxqqxqqqxxqqxqxxqqqqqxxxxxxxqqqqxxxqxxqqxqxxxxxqxqqxxqxqqxqqxqxqxxqxxqqxxqxxxxqqqqqxxqxqxxxqqxxxxxxxqqqxxxxxxqxqqqxqxqqxqqqqqxxxqqxqxqqxxxxxqqqqqxqqxqqxqqxqqqxqxqxqqqxqqqqxxxxqqqxxxqxqxxxxxqqqqxxxqxqxqxxqqxxxqxqxqxqqxqxqqxqxqxqxqxxxxqqxxqqqxqqxxqqqxqxxqxxqxqqxqqxxxqxqxxqxqqqxqxxqqxxqxxqxxqxqqxxqqxqxqqxxxqqxxqxxqxqxqqqxqqxqqxxqqxqxqqxqqqqqxqxxxxxxxqxxqqqxxxxxqqqxxqqqqqxxxqqqqqqxqqxxxqqqqxxqqqxxxqxqxqqqxqqxqqqxqqqxqxqxxxqqxxxxqqxxqxxqxqxxxxxqqqqqxqqxxxxxxqqqxqqxqqqxqxqxxqxxqxxqqxqxxqqxqxxxqxqqqqqxxxqxxqxqqqqxqqxxxxqxqxqqqqqxxxxxqxxxqxqxxxxxqqqxxqqqxqqxqqqxqxxqxqxxqxqqqqqqqqxqxqqqxqqxqxxxqxqxxxxqxxxqxqqqxqxxqxqxxxqxqxqqxxqqxxqxqqqqxqqqxxxqxxqqxxqxxxxxxqxxxxqqqqqqqqqqqxxxqqxqqqqxxxqxxxqqxqxqxxxxqqxxqqxxqqqxxxxqxqqqqqqqqqqqxqxqqxxqxxxqxxxxqqqxqqxxqxxqxxqxxqqxxqqxxxqqxqxxxxxqxxxqxxxqqqxqqxqqxxxqxxxxqxxxqxxxxxqxqqxqxqxqxxxxqqxxxqqxqqxqqxxxxqqxxqqxxxxxxxqxqqqxxxqqxqxxqxxxqqxxxxqqxxqqxqxxxqqxqxxxqqqqqqxxqqqxxxxxxxqxqqqqxqxqxqxxxqqxxxqxxqqxxqqxxxxxqxqqxxxqqxqqxxxxqqqqqxxqxxxqqqqqxqqxxxqxqqqqqxxxxxxxxqxxqxxqxxqqqqqqxqxqxxxqqqqxqqxqxxxqxqxxqqxxqxqxqxqxxxqqxqqxqqqxxqxqqqxxxxxxxxxxxxxxqxxxxxqqxqqxxxqxxqxqxxxqqxqqqqxxqxqqqxqxxqqxxxxxxqqxqxqxxqxqxqxxxxqxxxxqqxqxxxqxqxxqxxqqqqqxxqxxqqqqqxxxqqxxqxxqqqqxxxxxqxqxxxqxxxqqxxqxxxqqxqxqxxxxqqqxqqqqxxqqqqxxxqqxqqxxxxqxxqxxqxqxqqqxqqxxqqxqxxxxxxqqqqqqqqxxxqxxqxqqqxqxqxqqxqxxxxqxqxxqxxxqxxxqxxxqxxqqqxqqqqxqqxxxqxxxxxxqqxxxqxqxqqxqxqxxxxxxqxxxqqqxqqqxqqqqxqxxqqxqxqxqqxqqxqqxxqxqqqxqqqqxqqxqxxqqqxxqxqqxxxqxqxxqqxqqxxxqqxqqxxqxxqxxqqxxqqxqxxqxqqxqxxqqqqqxqqxqxxxxqxxqxxqxqqqqxxxqqqqqqqqqqqqxxqqxqqqxqqxqqxqxqxqqxxxqqxxxxqxqxqxxqxqxqqxxxqqqxxxqxxxxxxxxqxqxxqqqxqqxqqxxxqxqqxxxqqxxqxqqxxqxxqqxxqqqqqxxqqqqqxxqqqqqxxxqqxqxqqqqqqxxqxxxqqxqqqqxqqqqqqxxqxqqxxqxqqxxqqxxxqqqqqxqxqxxqxxxqxxqqqqxxxqqxxqqqqqxqqxqxxqxqqqqqqxxqxqxxxqqqqxxxxxqxxqqqqqxqxxxqxqqxxxxxqxqxxxqxqqxxqqqxxxxqxxqxqxxxqqxxqxxxxqxxxqqxqqxxqqxxxqqqxxxxqxqqxxxxxqxxxqqqqxxqqxqqxxqxxxxqqxqqxxqxxqxxxxqxxxqqqqxxxqqxxqxxxqxxxqxxqqxqxqqxxqqqqqqqqxqqxxxqqqxxxqxqqxqqxqxxqxxxqqqqxxqqxxxxqxqqxxqqxxqxqxxqxqxxxqqqqxxqqqqqqxqqqxqxxqxxqxqqqqxqqqqqxxqxxxxqxqqqxqqxqqqqxxxxqqxxxxqxxxxxqqxqxxxqqqxqqxqqxxxqqqxxqqqxxqxqxxqqxqxxqqxqqxxqqqqqqqqqqxxqxxxxxxqxxxqxqqqqqxxqqxqxqxxqxqqxxqxxxxqxxxxqxxxqxxxxqqxxxqqqqqxxqxxxxxqqqxqxqxqxxqqqqxxxxxqqqqxqxxxxqqxxxxqxqqqxqxqxxxqxqqxxqqqqqxqxqqqxqqqxxqqqqqxqqqxqqqxqxqqqxxxxxxxxxqqxqxqqxxqqxxqxxqxxqxxxxqqqqqqqxxqxxxqxxxqxqxxqxqqqqqxxxqqxqqxxxxxxqxxxxqxqxxxxxqxqxxqqxxqqxqxxxqqqqxqxxqxqxqxxxxqqxqxxxqqxxxxqqqxxqqxxqxxqxxxxqqxqxqqxqqqxxqqxqqqqqqqqqxqxxxxxxxqqqqqqxxqxqqqqxqxqxxqxxqqqqqqxqqqxqqxqqxxxqxxxxxxqqxqqxxxxxqxqxqqqxqxqxxqxxqqxqxxqxqqxqqqxqqqqxxqxqxxxxqxqqxxxqqqqqqqqqqqxxqxxxqqqxqqxxqxxqqxxqxqqxqxqqqxxxxxxxqxqxxxqxxxqxqxqqxxxxqqqqqxxqqxqxqqqxqqxxqxqxqxqqxqqxxxqxqxqqxxqxxxqxqxxqqxxxqxxxxxxxxqxxqqxxqqqqqxqxqqxxqqxqxxxqxxxqqqqqxqqxqqxxqqxqqqqqxqxxxqqxxxqqqqxqqxxqxxxxxqqxqqxxqxqxqxqqqxqxxqqxqqqxqqqqxxxqxqxxqxxxxxqqxxxqxqxxxqqqqqxqxxqxqxqxxqxqxqqqqqxqxxxxxxqqqxqqqqqxxxqxqqxqxqqqqxqqxxxxxxxqxxqqqxqxqqqxxqqqqqxxxqxqqxqqxxxqqxqxxqqxqqxqqqqqxqqxxxqqqqqqqqqqqqqqqxqxqxxxqxqqxxxqqxqqxqxxqqxqxxqxqxxqqxxqqxqxqxxxqqxxxxqqqxqxxxxqxxqqqxxxqqqqxxqxxxxqqxxqxqqqxxqqxxxxxxxxqqxxqqqxqxqxqqxqqqqxxqxxxqqxqqqxxxqqxxxqxxqxqqqqqxqxqqqqxqqqxqxxqxxqxxxxqqxqqxqqqxqxxqqqqxqqqxqxxxqqxxqxqxqqxqxqqxxxqqxqxqqqqxxqqxqqxxxqqxxqxqxxxqxxxqqxqqqxqqxxqqqqqqqxqqxxqxqqqxqqxxqqxqxxqqxqqqqxqxxqxqqqqxxxxxqqqqqqxqxqqqxxqxxqxqxxqqqxxxqxqxxxxxxxxqxxxqxxxxxxqxxxqqqqxqqxqqxxxqqxxqqxqqqxxqqqqxxxqxxxxqqxxqxqxqqxxxqqxxxxqqxqqqqxxqqxxxqxxxxqqqxxqqxqqqqxxqxqxxqxxxxxqqqxqqqqxqxqxxxqqxxqxqxqqxxqxqqxqqqqqqxqxxxxqqqqqxxxqxqqqxxxxqxqxxxxxxqxqxxqxqqxqxxqqxxxxqqqqqxqxxqqqxxqqqqxxqxqqxxxqxxqqxqqqqxxqxxqxxxxqxxxqqqxxxxxxqqxxqqxxqxxqxxqxqqqqxqqxxqqqxqxxxxxqqqxqxqqqqxqxqqxxqxqxxxqxqxxqxqqqqqqqxxqqxxqxqxxqqxxqqxqqxqxqxxqqqxqqqqqxqxqxqxxxqxxqqxqqqxqxxxqqqqxqqxqxxxxxqqxqxxqxxqqqqxxxqxxxxxqqxqqqxqqqxxqqqxxxxqxqxxqqxxxxxxxqxqxqxxxxqqxqqqqqxxxqxxxxqxqqqqqxxqqxxqxxxqqqqxqqxqxxqxxxxqxxqqqqqqxxxqxqqqxqxqqqxqqqqqxqqxxxxqqxqxxxqqxqqqxqxxqxqxxxxxxxqqqxxxqxxxqxxqxqqqqxxxqxxxxqqqxqqqqxxqqqqqqqqqxqqxqqxqxqqxxqxqqxqxqxxxxqxqxqxxqxqxxqxqqxqqqqqxqxxxxxqqqxxxxxxxxqxqxxqxxxxqqqqxqxqxqqxxxxxxqxxqqxqqqxxxqqxxxqqxxxxqqxqxxqxxxqxqqqxxxxqqxqxqqxqqxxqqqqxxqxxxqqxxqxqxqxxxxqqqqqxqqqxxxxxxqqqqxqqxxxqxqqxxxqxxxxqxxxxxxxqqqxxqxqxxqxqxqxxqqxqxxqxqxqxqxxqqxxqxxxqxqxqqqqxqqqxxxqqqqxxqxxxxqxxxxxxqxqqxqxqqxxqqxqxxqxqqxqxqqxqqqqxqqxxqqxqqqqqqqqxxqxxqqqqqqqqqqqqxxqqxxxxxxqqxxqxxxxqqxxxqxxqqxxxxxxxxqxqqxqqqqxxqxqxxqqqqxqxqxxxqqxqxxxqxxqqxxqqqqqqqxqqqxxxqqxqqqqqxxxxqxqxxxxqxxxqxxqqqxqqxqxqqxqqxxqxqxxqxxqxqxqqqxqqxxqxqqqxqxxqxxxxqqqxxxqxqqqxqxqqqqqqxqqxxqxqqxxqqqxxxxqqxqxxqxqxxxqqxqxqqxqxxqqqqxqqqqqqxqxqqqxxxqxqxxxqxqxqxqqxxxqqxxqqxxxxxxqqqqxqxqqqqqqxqxqxxqqxqqxqqqqqxqxqqxqqxxqxxxqqqxqqxqqxxxqxxqqqqxqxqxxxxxqxxxqqqqxqqqqqxxxxxqxxxxqxxxxqqqqqxqqqqqqqxqxxxqqqxxxxxxqxqqxxxqxxxqqqxqxqxxxqxqqxqxqqqxqxxqxqqxxxqxqqqqqqxqqxxxqxqqqqqxxqqxxqqxqqxqxxxxqxqxqxqxqxxxqxxqxxxxxxqqqqqxqqqqqqqqxxxqqxqxqqxxqqxqqqqxxqxxqxxxqxxqxxqxxxqqqxqqxxxqxqqqxxxqxqxqqqqqxqxxqxxqxxxqxxxqqqqxxxqqxqxxqqxqqqxqxqqqqqqxxqxqqxxxxqqxxqqxxqxqqxxqqxxxxqxxxqqqxqqxqxxxxqqxqqxqxqxqqqqxqxxxxxxxxqxxqqxqqqxxqqxxqqxxqqqqqxxqxxqqqxxqxqqxxxqqxxxqqqqxqxqxqqxqqqqxqxqxxqxqqqxxxqqqxqxqqxqxqxxxxxxqxxqxqqqqxxxqxxxxxqqxxqqqqqqqqqxqqxxxqqqxqqxxxxqxxqxqqqxqxqxqxqqqxqxqqxxxqqxxqqxxxxxqxxqqqxqxxqqqqxqqqqxqqqxqxqxxqqxqqqxxxxqxxqxxqqxqxxqqqqqqqqxqxxxqqxqxqqxxxqqxqxqqxqqxxqqxxxxxqqxqqxqqqqxqqxxqqxqqqqxqqxxxxxxqxqqxqqqxqxxqqxqxxxxxqqqxxqxqxqxxxqxqqqqxqqqxxqqxqxxqxqxqqxqxxqqxxqqxxqqqxxqxqqqxxxqxxqxqqqqqxxxqxxxqqxxqxxxqqxqqqqqxxxxqxqqqxxxxxxxqxqqqqxqqqxxxxqxxxqxqxqqqqxqxqqqxqxxxxxqxqxxxxxqxqxxxqqxqxxqxxqxqqqqxxxqqqxqqxxxxqqxqqxqqxxqqqxxqqxqqqxxqqqqxxqqxxqqxxxxqqqxxxxqxqxqxqqqxxxxqqqqqxqxqqqqxqxxxxxqxqxqxqxqqqqxxqqqxqqqxxxqqqqqqxxqqxxqqxqxxxxxxxxqqqqqxxxxxqxxqxxxqqqxqqqqqqxxxxxxqqxqxxqxxxxqqxqqxxxqqqqxqqqxxqqqxqxqxxqqxqxqqqxqxqxxxqqqqqqqqqxxxxxqqxqqxxxqxqqqxqxqxxqqqqxxqqqqxxqxxqxxxqxqqqqxqqqqqxqqqxxqxqqxqqqxqqxqqqqqxxxxqqqqxxxqxxqqqqqxxqxqxxqxqqxxqqxqxqqqxxqqqqxxqxqxqxxqqxxxxqqqqqxxqxqxqxxxxqqxxqqxxxqxqqxxxqqxxqqxxqxxqqxqqxqqxxxqqxqxqqqxqxxqxxxqxxxqqxxxqxqqqxqxqxxxqqqxqxxqqxqqxqqxxqxxqxqxqqxxqqqxxqqqqqxxqqxqxqqxxxxqqxqqxqqxqqqqqxxxqqqxxxqxxqxqqxxqqxxxqxxqxxxqxqxqxxqqqxqxqqxqxxqqxqxqxxxqxxxxqxqxxxxqxqqqxqxqxxxxqxqqqqxqqqxxxqxqxxqxxqqxqxxxqxqqxqqqqxqqxqqqxxxqqxqqxqqxxqxxqqqqxxxqqqqxxqqqxxqqxqqqxqxqxxqqqxqqqxxxqqxxxqxqxxqxxxxxxxqqxqxxxqqxqxxxqxqqxxqqqqqxxqqxqqxqxqqxxxqxqxxqxxxqxxqxxqxqxxqxxxxxxqqqqxxxxqqqqxxxxqxqqxxxqxxxqqqxqqqqxxxxxqxxxqxxqqxxxqqqxxqqxqqqqqqqqxqxqxqxxxxxxxxqqxxqqxxxqqxxqxqxqqqqxxxxqqxxqxxxqxxqxxqqqqxxxqqxqqxxxqxxqxqqqxqxqqqqxqqxqqqqqxxqqxxqqqqxqqxqxxxxqqqqqqqxxxxqqqqxqqxxqqqqxqqxxqqxxxqqqxqxxqqqqqxxxqxxqqxxqqxqxqxqxxxxxxqxqxxqxqxxqxqxxqxqqqxqqxxxqqxqxqxxxqxxxqqqxxqxxxqqqxqqxxxqqxqqqqqqqqxqqqqxqxxqqqxxxxxqqqxxxqxxxqxqqqxxxxxxqqxqqxqxxqxqxqxqxqxxqqxqqqqqxqxqqxqxxqqxxqxqqqqqxqqxqxqxqqqqqxqqqxqqxqqqxxqxqqxqxqqxxqqqqxxqqqxqqxqqqqqxxxxqqxqxqqqqqxqqxxqqqqqxxqqxxqqqqxxxqxxxqxxxqqxqxxqqqqxxqqxxxxxxxxqxxqxqxxxqqqxxqqqxxqxxxqxqqxxqqxqxxqxxxqqxxqqxqxqqqqxxqqqqxqqqqqqxqxxqqqqxqqxqxxqxxxxxqqqxqqqqxxqxqxxqqxxqxqxxxxqqqqqqqxxqxxxqxqxxxxqxqxxqxxxxxqxqqxxxqqxxxxxxxqqqxxxxqxqxxxqqxqqqqqqqqxxqxxxxqqxxxqqqxxxxxqxqqxxqqqxxxqxqxxxqqxqqxqxqxqxqxqxqxqqqqqqxqqqqxxqxxqqqxxxxqxqxqxqqqqqxxqqxxqqqqqxxxqqxqxqqqqqqqxxxxxqqqqqxqqxqxxqxqxqxxqxxxxqqxxqqxxqxxxqxqqxxqqxxqqqqqqxxxqxqxxxxxxxqqqxqqxqqxxqxqxxqqqqqxqxqqqxqxqxqqxxxqqqxxxqxqxxxxqqxxqqqqxxqxqqqxqqqqxqxxxqqqqqqxxxxqxxxqqxqxxqqxqqxxxqqxxxxxqqxqxxxqxxxqxxqqqxqqqxxqqxqxqxqqqxxqqqqxqqqxxqqxxxxqqxxxqqqqqqxxxxqxqqxxxxqxxxxxxxqxqxxqqxxxxxxqqxqqxqqqqqxxxqxqxxxqxxxqxqxqxqxqxqxxxxqqqxxqxqqqxxqqqqqqxxqqqqxqqqxqxxqqxxxxqxqqxqqxxqxqqxqxqqqqxxqqxqqqqxxxqxxqqxqxqxqqxxxxqqxxxqxqqxqxqxqxxxxxxqqxqqxxxxxxqqxxxxqqqxqxqxxxxqxqqqqxqqxqqqxqqqxqxxqxxqxqxqqqqqqxxxxqqqxxqxxqxxqxqxxxxqqxqxxxqxqqxxxxqqxqxqxxqqqxqxxqqqxxxqxqqqxqxxxqxqxqxxqqxqqxxxxqqxxxxxxxqqqxxqqxqqqqqqxqxxqqxqqxqxxxxxxqxxxqxxqxxxxqqqqxqxqxqxxxqqxxxxxqqxxqqqxxqqqqqqxxqxxxqqqxxxxxxxxqxqxqqxqxqxqxxqxxqxqqqxxxxqqqqxqxqqxxqqqxqxxqxxxqxqxxqqqxqqqxqqxxqxxqxqqqqqxxxqxqxxxqqqqqqqxqxxxqqqqqxqxxqqxqxxqxqqqxxqqxxqxqxqqxqxxxqqqqxxqqxqqqqxqxqxqqxqqqqxqqqqqxqqqxqxqqqxxqxqxxxxxqxxqqqxqqxqxxxxxxxqxqxxqqxqxxxqqxxqqqqxqxxqxxxqxqqxqqqxqxxqqqxxxxqxqqqxxxqqqqqxxxqqqxxxxqxxxqxqqqqqxxxxqqqqxxxxqxqqxqxqxqxxqxxqxqxqxqqqxqxxxqxqqxqxxxxxxxqqxqxqxxxqqxxxqxxqxxqqxqqxxqxqqqxxxqqqxqqqqxqqxqxxqxqxqxxqqqxxxxqqxxxqxxqqxxxxxxqqxqqxqxqqqqqxqqqqxxqxqqqxxxxxxxqqxqxqxqxxxqxqxqxqqqqqqqqqxxxxqxxqqxxxxqqqqqqqqqxqqqxxxqxxxxqxqxqqqxqqxqqxqxqxqqxqxxxqxqxqqqqxxxxxqqxxqxqqxqxxqqqqxqxqqxqqxxxqqxxxxxqxqxqqxxxqqxqxqxqxqqqqqqqxxqxqxqqxxqqqxqxxqqxqqqxqqxxqxqxqxxxxqqqxqxxqqqqqxxxqqqqqqqxqqqxxxxxxxqqqqqqxqqqqqqqxqqxqxxxxqqxxxqqqqqqqxqxqxqxxxqqxqqqxxxxxqqxxxqqqqqxxxqqxxqqxqqqxxqqqqxqxqqxxqqxxqxqqxqqqqxqqqqqxqxqqqxqqxxxxqqxxqqxqqqqxqqxqqqqqxqqxxqxqqqqqxxqqqxqqqxqxxxxxqxxxxxxxxqxxxxxxxxqxxqqqxqqxqqqqxqqqqxxxxxqqqxqqqqqqqxqqqxxxqqqxxxxxqqqxxqqqqxqxqqxxxxqqxqqqxxxxqqxqxqqqxqqqxxqxqxxxqxqxxqxqqqqqxqqqxqxxqqqxxxqxqxqxqqxqxqqxxqxqxqqqqxxqxqxqqxqxxxxxxqqxxqqxqxqxxqqxxqxxqqxqqqxxqxqxxxxqxqqqqxqxqxxxqqxxqqqxxxxqxqqqqqqqqxqqqxqqxxxqxqxxqxqxqqqxqxqxqxqqxxqqqqqxxqqxxxqxqqxxxqqqqqqqxxxqqqxqqqqqqxqqxxxxqxxqxxxxxxqxqxxxxqqqxxxqxxxqxxqqqxxqqxxxxqxxqxqxxxxxqqqqqqxqqxqqxqxxqqxxqqxxxxqqxxqqxqxqxqxqqxqxqqqqxqxxqqqxxqxqxxqxqxqqxqxqxqqxxqxqxxqxxxqqxqqxxqqxqxqqxxxqqxqqxxqxqqxqqxxqxxqxqqqxqxqxxxqxqqqqxqxxxxqxxqxxqxxxxxqxqqqqxqxqqqxqxxqxqxxqxxxqxqxxqqxxqqqxqxqqqxqxxqqqqqxqxqqqqqxxxqqxxxxxxxqxqxxxxxqqqqqxxqqxxqqqxxxqqxqxqxxxqxxqqxqxqxqxxxxxxqqxxxqxxqxxqqxxxqqxxxxqqxxxqxqxxxxqxxqqqqxxxxxxqqqqqxqxqqxqqqxqxqqqxxqqqxqxxxqqxxxqqqxxxxqqqqxxxxxxqqqxqqqqxqqxxxxqxqqxqqxxxxxxqqxxxxqxqqqxqxxqqqqqxxxxxqqqqqxxqqxxqqxqqxxqqqxxqqxqqqxxxxqqqxxqqqxqxxqqxxxqxxqqqqqxqqxqxxqxqxqqxqxxxxxxqxqqxxqqxqxqxqxxxqqxxxqqqqqqxxqqxqxqqxqqqqxxqqqqxqqxxxxqqqxxxxqxqqxqqxqqxxxqxqxxxxqqqxxqqxqqxxqxqxxqqxqxqqxxxqqxqqxqxxqxxqxqqqqqqqqxqqxqxxqxqxxxxxqxqqqqxqxqxqqqqqxqqxqxxqqxqqqxxxxqqxqxqxxqqqxqxxxxxqxqxqxqxxqxqqxqqxxqxxxqxxqxxxqxqxxqxqxqxxqqqqxxqqxqqxxxxqxqqxxxxxqxqqqxqqqxqxxxqqqqqxqqqqqxxqqxqxqqqxqqxqxqqxxxqqxqqqxxxqqqxqxxqxqqxxqxqxqxxqqqxqqxqxqxxxqxqxxxqxxqqqqxxxxxxxqqqxqxqqxqqxqxqqxqqqqxqxqxxqqxqqxxqxqqxxxqqqqxqqxxxxqqqxxxxxxxqxxqxqqxqxqxqxxxxxxxxqqxxxqxxqxxxxqqxqqxxqxxxxqqxxqqqxxxqqxqqxxqxxqxxxxqqxxqqqxqqxxqxxxxqxxxxxxqxxqxxxxqqxxxqqqxxqqqxxxxxxxqqxqqxqqxqxxqqxqqqqqxxqxqqxxxqqxxxxxxqxxqxxqxqqxxxqqqqxxxqqxqxxxxqqqqxqqqqqxqqxxxxxqqqqxxxqqqqqxqqqxqqxxxxxxqxxqxqqqqqqxqxxxqqxqqqxqqxqqqxqxqxqqxxxxqxxxqqqqxqxxxqxqxqqqqqxqxqqqqxqqxxxqxxqqqqxqxxqqxqqxxqqqxqqxqqqxxqxxxqxxqxxqqqqqqqqxxxqxxxqxxqqqqxqqxxxxqxqxxqqxxqxqxxqqxxxqqqqqxxqqxxxxqqqxxqqqxxqqqqxxxxqxqxqqxqxxqxqqxqxqqxqxqqxxqxxxqqxqqxxqxqqxqxqxqxqqqxxqqxqqxqqxxqqqqqqqxxqxxxxxxxqxqxqxqqxxqqxxqxqqqxxxxxxqxqqxqxxqqxxxxxxxqqqxxqxqqxqqxqxqqxqqqxxxxqxxxxxxqqqqxxxqxqqxqqxxqqxqxxqqqqqxqxxxxqxqxxqxqqxqxqqqqqxqxqqqxxqqxqqxqxxqxxqqxqxqqxqqqxqqqxxqqxxxxqxxqxqxqxxxqxqqqxxqxxqqqqqqqqxqqxqqxqqqqxqqqxqqqxqxxxxxxqxxqqqxqqxxxqxqxqxqqqxqxxqqqqxqqxqxqqxqqxqxxxqqqxxqqxqxqxxqqqxxxxqqqqqqqxqqqxxxqqxqxxqqqqxxxxqxxqqqxxxqxqqqqxxxxxxqxqxxxxxqxxqqxqqxxxxqqqqqxxxqxxxxqqxqqqqxxqqqxxqxqqxxxxxqqqxxxqqqqqxqxxqqxqqqxqxxqxxqqxqxqxxqqxxxxqqqxxxqqqqxqxqxxxqxqqxxxqxqxxqqxxqqqxqqxqxqqqxqxxqqqxqqqxqqxxxqxqxqqxqqqqqqxqxqxxxxqqxqxxxqxqqxxxqxxxxqxxxqxqqxqxxxqqxxqqxqqxqqxqxqxqxxqqqxqqqqqxqxxxxxqxqxqxqqqqxxqxxqqxqxqxqqxqqxqqxxqxqxqqxqxqxqxqxxqqqxqxxqqxqqxqqxqxqxqqxxqqxqqxqqqqqxqqqqxqqxqqqqqqqqqqqqqqxqxxxqxqqxxqqqxqqqqxxxxxxxxqxqxxqqxxqqqqxqqxqqxqxxqqxqqxxxqxqxxqxqxxxqxxqxxxxxxqqqqxqxxqqxxqqxxxqxxxxxqxxqqxxqxqxqqxqxqqqqqxqxqqxqqqxxxqqqqxxxqqxqxxqqqqxqqqqqxqxxxxxqxxqxxxxxqxxqqxqqqqxxqqqqxqqqqqxxxxqxxqxqqqqxxxxxqxxqqqxxxqxqxxqxxqqxqxqqxxxqqxxxqqxxqqxqqqxqqxxqqqxqqqxxqxxxqqqqxxqxxqqqqxxqqxqqxqxxxqqxqqqqxxqxqqxxqxqxqqqqqxxqqxqxqxqqqqxxqqxqxxqxxqxxqxxxqxxxxqxxxxxxxxqxqqxqqxxxxxxxqqxqxqxxqqxqxxxqxxqxqqxqqxqqqqxxxqqxxxxqqqqqxqxxqqxxxqxqqqqqqqqqqqqqqqxqqxqqxxqxxxxqqqqqqqqqqxqxxqqqqqqxqxqqxqqxqqxxqxqqqxqxxxxqxqxqxxxxxxxqqxxxqqqqxxxxxqxqxqqxqxxqxxqqqxxxqqxqqxxxxqxqqxqqqqxxqqqqxxxxxxqqxqqxqxqqxqqqxxxqqxxxxxxxxqxxqqxxxqqxqqxqqxqxqxqxxqxxxqqqxqxqqxxxqqqxxqqqqxqxqxqxxqxxqqqxqxxxxqqqqxqqqxqqxxqxqxxqxxxqxqqqxqxqxxqqqxqqxqqxqxxxqqxxxxqxqqqqqqqxqxxqqqxqqxqqqqxqqqqqxxqqxqqqqxxxqxxxxxqqqxxxxqqqxxqqqxxxxxxqqxqxxxqqqxxxxqxqxxqqqxxqxqxxxxqqqxxxqqqxxxqxxqqxxxxxxqqqqxqqxxxxqqxxxqqqqxqqqqxxqqxqqqxqxqqxqqqqqqxqxxxxqxqxqxxxqqxqqqxxxxqxqqqxxxxxqqxxxxqxxqxxxqxqqqxqxxqqxxqqqqxqqqxxxqxxqxxqqqqqqxxxxxxqqqqqxqqxxqxxqxxxqqxxxxqxqqxqxxqxqqqqxxxxxxxxqqqxxxxqxqxqxxxxqxxxqqxqqxqxqqqqxqxxxxqxxxxxqqqxxqqqxxxqqxxxxqxxqxxqxxxqxqqqxqxxqqqqqqxxxqxqqxqqxxxxxxqqxxqqqxqqqxxqqqqqxqxqqqxqxxqqqqqqqxqxqxqqxxqxxxxxqxxxxxxxxqxqxxxqxxqxqqqxxqqxqxxqxxxqxqxxxxxxqqxxqxqqqqqqxqqqxxxqqqqqqqxxxxqxxxxqxqxqqxqxqqxxqqqqqqxxqqxqqxxqxqqxxxqxxqxxqxqxqqqqxxqxxqqxqqqqxqxqxqxqqxxxxxqqqxxqxqxxqqxqxqxxxqqxxxxxxxqxxqxqqqqxxqxqxxqxxqxqxqxxxxxxqxqxqxxqxqqqqxxqxqxqqqxxqxqxqqxxqxxqqqxqxxxxxqxxqxxqqqxqqxqxxqxxqxxxxqxxqxxqqxxxqxxqqxqqxqqqqxxxqqxqqqqqqxxqxqqqxqxqqqqqxqqxxxqxqqxxqqxxxqxqqqxqxqqqxxxqqxxqxqxqxqqqxqqqxqqqqqqqqqqxqxqxqxxxxxqxqxxqqxxqxxxqqqxqxxxqxqqqqxqqxqqxxqqqxqxqxqqxqqxqqxqxqqxxxxqqxqqqxqxxqxqqxqxqxxxxqqqxqxxqxqxqqxqqqqqxqqqqqxxxxqxqqqxqxxqxqqxqqxqqqxqqqqxxxxxqqxxxqxxqxqqxxxxxqqqqqxqxqxxqqxxqqqqqqxxqqxxxqxxqxqxxxqqqqqqxqqxqxqxqqxqxqqqxqqxxqxqqxxxqxqxqxqqqxqqqxxqqxxxqqqqqqqxxqqqqqqqqxxxqxqxqqxxxqxqqqqxxqxxqxqxqxxqqxqqxxqxqxqqqxxqxqqqxxxxxxqqqxqqqqxxqqxxxxxqxxxqxxqqxxxxxqqqxqqqqxxxxqqxqxqxxxqqqxxxxqxxxqqxqqxqxxxqqxxxxxxxxxqqqxqxqxxxxqqxxqxxxxxqqxqqqxxqxxxxqqxqxxxqqxxqqxxqqqxxqqqxqxxqxqxqqxxqqqqxxxqqxxqxqqqxqqqqqqxxqqqxqxxxxqxqqqqxxqqqxqxqqqqxqxqxxxqxxxxqqqqqxxxqxxxxxqqxxqqxxqqxqxqqqqxxqxqqxxxxqxqxxqxxqqxqxqxqqqqqxqxqqxqqqqxxqxxxqxxqxxqxqqqqxqqqxxqqqqqqqqxxxqxqqqxqqqxxxqqqxqxxqqxqxxqqxqqxqxxqxxxqqxqqxqxqxqqqqxqqqxqxxxxxxxxxqxxqqxqqqqxqqxxqxxqxxqxqqxqxxqxqqqqxqxqqqxqxxqxqxxqxqqqxxqxqxxqxxqxqqxqxqqqqqxqxqxqqxqqxqxxxxqxxxxqxxxxxxqxxxqqxxxqqxqxqqxqqxxqxxxxqqxxqqxqqqqxxqqqxxxxqqqqqqxxxxqxqxqqxqxxqqxxxxxxxxqxxqqxqxxxxqxxqqxxxqxqqqxqxxqqxqxxxqqxqqxqqxqxqqqxqxxqqqqxqxxxxxqqqxxqqxxqqqxxqqqqqxqqqqqqxxxxxqqqxxxxxqqxxxxqxqxqqxqqxxxxqqqqqxqxqqqqxqxxxxxxqqxqxxxqqqqxqxqqxqqxqqxqqqqqqxxqxxqxxxxxxxxxxqxxqqqqxxxqqxqxqxqxqqqxqqqqqxxxxxxxqqxqxxqqxxxxqxqxqxxqxxqxqqxqxqqqxqqqqxqqxqxqxqxxxqqxxqqxqqxqqqxxxxxqqxqxxxxqxxqxqqxxxxqqqxxxqqxqqqqxxqxxxqqqqqqxqqqqqxxqqxxqxqqqqxqqqxxqqqqqxxqqqqqqxxxqxqqqxxqxxqqxxqqqxqxxqxxxxqqqxxqxqxxqqxqxqxqqxxxxqqqqqxqqqxqxqxqxxqxqqqqqxxqxqqxxxqqxqxqxqqxxqqxqxxqqqqxqqxxxqqxxqxqqqxxxxxqqqxxxqxqqqxqxqxqxxqqxqqxqqqqqxqxxxqxxqxqxqxxqqqxxxxxqqxqqxqxxxqqxxxxxqxqqxxqxqxqqqxxxqqqqxqqxqqxqqxqxxxxxqxqqxqqxxqqqxqxqqxqqqqxqxxqxxqqxxxqqqxxqqxqxqxqxqqqqxqxxxxxxqxxqqqqqqqqxqqqxxxxxxqqqqxxxqqxqxqqqqxqqqqqqxqxqqqqxxqxxxqqqqqqxxqxqqqxxxqxqxxxxqqqqxxxqxxqqqxqqqxxxqqxqxqxqqxqxxxqxxxqqxqxqxqqxqxxqxxqxxxqqqqxxxqqxqqqqxqxxxqqxqqqxxxqqxqqxxqxqqxqxxxxxxqqxqxxxxqqqqqxxqxxqqxqxqxxqqxxxqqqxxxqxqxxxxqxxqqxxxqqqxxqqxqxqxqqxxxxxqqqxxxxxxxxqxxqqqxxxxqxxqxqxqqqqqxxxxqqxqxqqqxxqxxqqqqxxxqqqqxxxxqxxqxqqqxqxqxxqxqqqxxqqxxxxqxxqxqxqxxxxqxxxqxxqxxqxxxxqxqqqxxxqxqxqxqqqqqqqxxxxxqqxxqqqxqxxxqxxxqxxqqxxqxqqqqxqxxxxqxqxxqxxqqqxxqxqxqxqqqxxxqqxxxxxxqxxqqxxxqxxqxqqqxxqxxxqqxxqqqqqxqxqqqxxxqqqxqxqxqxqqqxxxxqxxqxxqqxxxxxxqqxxqxxxxxxqxqqxxqxxqxxqqqqxxqxqqxqxxxqqxqqxxqqqxqxxqxqxqqxqqxqxqqqxxqqqxxqxqqxqxqxqqqqxqxxqqqxqxxqqxqqxqxqqqxqxqqxqqxxxxqxqqqqxxqqqxxqqqxxqqqxxxxxxqqxxqxqxxqqxqqxqxxxxxxqxxxxqqqqqxqqxxqqxxqxxxqqqqqqqqqqxqqxxxxxxxqxqqqqqqqxxxqxqxxxqqqqxxxxqqqqxqqqqqqqxxxqxqqqxqqqqxxxxqxxqqxxxqqxxxqqxqqqqqxxqxxxqxxxqxxqqqxxxxxxxxqxqqxxxqqxxxxxxqqqqxxxqqxxxxqxqqxqqqqqqxxxqxxxxqqxxxqqqxqxxxxxqqxxqqqxxxxxqxxqqxqqxxxxqqqxqxqxqxxxqqqxxqqqqxxqqqqqqqqxxxxqxqqqxqqqxxqqxxqxqqqxxxqqqqxxqqqxxxxxxxxqqqqqxxqqxxxqxqxqqxqxxxxqqqxqqxxxxxxqxqxxxqqxxqqqqqqxxxxxqxqxxxxxqqqxqqxxqqqxxqxxqqqqxxqxqqqxqxqqqqxqxqqqxxxxxqxqxqqxxxxxqqxxqxqxqqqxqxxqxxxxqqxxqqxqxqxxxqqxqqxqqqqqqxxxqxqxxxqqxqqxqxxxqqxqqxqxqqqxxqqxqqqxqqxqxqxxqqqqxxxqqqqxxxqxxxqqxqxqqxxxxxqxxxxxqqxxxxxxqxqxxxxxxxqxxxqxxqxxxqqqqxxqqqxxxxxxqqxqqqxxxqxqxxxxqqqxxqxqxqxqqqqqqqqqxqqqqqqqxxxqqqqxxqqxqqqqqxxxxqqxqxqqqqqxqqxqqqqxqxxxqxqxqxqxqqqxxxqqxxxqxqqqqxqxqxqqxxxqqxqxqxxqxxqqqqxqqxxxxqxxxqxqqqqqqqqqxqxqxqqxxqxxqxqxxxxqqqxxqxxqxqqqxxxxxxxqqqqxxqxqqqqxxxqqqqxxqxqqxqxqxxqxqxxxxxqqqxqqxqqxxqxqxqxqqqxxqxxqqxqxqqqxxxxxxxxqqqxqqqqxqqqxxqxxqxxqqxqxxxxxxxxqqqxxqxxxxqxqqqqxxxqxxxqqxxxxxxqqxqqqqxqqqqqqqqqxxxqqqxxxxqxxqxxqxxxxqxqqqxxxxqxqqqqxxxqxqqqxqxxqxxqqqxqxxqxxxqxqqxqxxqxqxxxqxxqxxqxqxqqxxxxqxxqxxqxxqqqqqxqxxqqqqqxqqxqxxqxxqqxqxqxxqxxqxqxqqxqxxxxqxqxxqqxqqxqxxxqxxxxxqqqxqqqqqxxxqxqxqqqqxqxxxxqqxqxxqqqxqqxqxxxxqxxqxqxxxqxqxxxqqqxqqqqxqqqqxqqqqxqxxqqxqqxxqqxxxqqxqxxxxqxqxqqqqxqqqxqqqqxxxqxxqqxxxxxxqqqxxxqxqxqqqqxqqqqxqxxqqqqqqqqqxxqxxqxxxqqqxxxxqxqqqxxqxxxqxqxxqxxqqxxxxxqqqqxqqqxxxqqqxqqqqxqqqqxxxxqxxqxqqqqxxxqqxqxxxxqqqxqqqqqxqxqxqxqqxqqxqqqqqqqxqxqxxxqxqxqqxxxqqxxxqqxxxqxqqqqqxqqqxxqxqxxqxxxxxqqqxqqxqqxqxqqxqqxxqqqxqxqqqqqqqqqxqxqxqqqqqxqqxxqqqqqqxxqxqqxqqxqxqqxxqqqxxqqqqxxqxxxqqqxqxxxxqxqqqxxqqxxxqxqqqqqqqxqxqxxqxxqxxqqqqqqxxqqxqqxqqxxqxqxqxqxqqqqxqxxxqqqqxxxqqqqqqqxqxqxqxxxxxqqqqxqxxqxqqxqxqqxxxxxxqqxxxqqxxqxxxqxqqqqqxqqxxqxxqxxqqqxxxqxxqqxxxqqxxqxqxqqxxxqxxxqxxxxxqqqxqxqxxqqqqxqqqqqxqxqqqxxqxxqqxqxxqqxqqxqxqqqqqxxqxqqxxqqqqqqqqxxqqxqqqxqxqxqxxxxxxxxxxqxqxqxxxqqxxqqqxqqxqqqqxqqqxxqxxxqqqxxqqxqqqqqqqxxxqqqxqxxxxxxqxxqqqxqqqqxxxxqqqqqqxqxxxxxxxqqqqqqxqxqxqqxxqqqxxqxxqqqxqqqqxxxxqqqqqxqxxxqxqqxqxqqqxqxxxqqqqxxqxqxxqxqxxxxxqqqxxqqxqxqxxqxxxqxxxqqqqqxqqqxqqxxxqqqqqqqxxxxxqxxxqqxqxxqqxqqqqqqqqxqqqxqqxxqqqqqxqxqxqqxxqxqxxqqqxqqqqqqxxqxxxxqxqqxqxqqqqqqqxxqxqxxqqqqqqqqqxxxxqxxqxqqqqxqqxxqxqqqxxqxqxxxqxxxqxxxxxqxxqxxxqxqqxqxxqqqqqxxqqxqxxxqxxqxxqqqxxxxxxxqqxqxqqqxqxqqqqqqqxqqxxxxxxqqqxqqqqxxqxxxqqqqxqxxqxxqqxxqqxxxxqqqxqqqxxxqxxxqxxxqxqqxqqxqxqqqxqqqxqxqxxqqxqqqqxqxxxxqxqqxxqxqxxxqxqqqqqxxqqqxqxxxxxxxqxxxxxxxxqqxxxqxqqqqqqxqxxqqqqxxqxqqqqqxqxqqqxqxxxxqxqxxxxqqqqxxxxqqqxqqqxxxqqqqxqxxxqqxqqxxxqxxxxqxqxxqxxxqxxqxxqxxxxqxxxxxqqxxxqqqqxxxqxxqqxxxxqxqxqxxxqxqqxqxqxqqqxqqqxqqqqqqqxxqqxqxqqqxxxxqqqxxxxxqqqqqqqxqqqqxxxxxqqxqxqqxxxxxqqqxxxxqqqqxxqxqqxqqqqqqxqqqqxqxxxqxqqqxqxqxxxqxxqqxqqxxqxqqqqqxqqqxqxxqqxqqqqxqxxqqxqqxqxqqxqxqqxqqxxxxxqqxqxxqqxqqqxqqxxqqxxxxqxqqqxxqqxqqqqxqqqqxxqqqqxqqqxxqqxxxxxxqxxxxqqxqxxxxqxqxxqxxqqxxqxqqqxxqxqqxxqxxxqqqqxxqxxqxxxqxxxxxqqqqqqxxxqqxqxxqqxxxxqxqxqqqqqqxqxxqqqqxqqxqxxxxqxqxxxxqxqqqxqxxqqqxxxqxqxqxqxqqqxxqxqxxqqxxxxxxxxxqxxqqxqqxqxqxqxxqqqxxqqqxqxxxxxxxqqqxxxxxqqqqxqxxxqxxxqqqqqqqqxxqxxqqxxxqqqxqqxxxqqxxqxqxqqqxqxxqqxxxxqxxqxqqqqxqxxqqqqqxxqxqxxxqqqxxqqqxxxqqxqxxxqxxxxxqxxqxxqqqxqxxxqqqxqqxxxqqxxqqxqqqqxxxxxqqxxqxqxxxqqxxxxxqxqqxxxxqqqxxxqxxqxqxxqqqqqxqxqqxxxxxqxqqxxxxxxxqqqxqqqqxxqxqqqqxqxxqqxqxxqxxqxqxxqqxqqxxxqxxxxxqxxqqqqxqxqxqxxqxqqqqqxxxxxxxqqxqqxqxqqxxxqqxqxqqxxxqqxxxxqqxxxxxxqxxqxqqxqqqqxxqqxxxxxqqqxxxxxqqxxqqxqqqqqxxxqxqqxxxqxqqxxqqxqxxxqxxqxxxxxxxxxqxqxqxxxxxqqqqxqqxxxxqxxqqqqqqxqxxqxqqqqxqxqxxxxxqxxqqqxxqxxqxqxxqxqxqxxqqxxxqqxqqqqqqqxxqxqqxxxqxqxqxxqqqqxxqqqqxqqxqqxqxxqxxxqqxxqqqxxxxqqqqqxqxqxxqqxqqxxxqxxqqqxxqxxqqxxqqxqqqxxqqqqxqxxqxqxqqxxxqqxqqxqxqqxxxxqxxxxxxqqxxqqxqxxqxxxxxqxxqqxxqqxqqqxqxxqqqqqqxxxqqqqqqxxqxqxqqxqqqxqxxqxqqqqxxxxxqxqxxqxqqxxqxxqxxqqqxqqqqqxqqqqxxqxqqqxqxxqxxxxxxqqqqxqqxxqqxqxxqqqqqqqqxqxxqqxqxqqqxxxqxqqqxxqqxqqqqqqqqxqxqxqqxqxqqxxxqxqqqxxqqqxqqqxxqqxxxxqxqqqqxqxxxxxqqqxxqxxqxxxqxqqxqqxqqxxqxqxqxqxxqqxqqqqxxxqxxqqqxqqxxqqxqxqqqqqxxqxqqxqqqqqqqqqxxqxxxxqqxxxxqxxxxqxxqqxxxqqqxqqqqxxqqqxqxqqxqxxqqqqxxxqqxxqqqxxqqxxqqqxxxqxxqqqqxxxxqxxqxxqqxqqxxqxxqqqxqqxxxxqxxqqqxxqqqxxxxxxxxxxxqqqxxqxqqqqxqxxqqqqqxxqxxqqqqxxqxqxxxqxxxxxqqxxxqqqqxqxqxqxqxqqxqxqqqxxqqxxqqxxqqxqxqxxxqxxxqqxqxqxqqqqxqxqxxxxqqqqqxqqxxxxqqqqqqxxxqxqxqxxqxxxxxxxxqxqxxqxxxqqxqqxxqqqqqqxqqxqxxxqqxxqqxqqqxxqxxqxqxqxxqqqxxqxxqqxqxqxxqxqqqqqqxqxqqqqxxxqxxxqqxqxqxqqxqqxqqxqqqqqqxqqxqqqxqqxqxxqqxxxqqqxqxqxxqqqqqqqqxqxxqqxxqxqxqxqxqxqxqqxqxxxxqxxxqqxqqxxqqqqxqqxqxxqxxqqxqqxqxqxxqxqxxxxqqxxqxxxxxxqqxqqqxxqxqxqqxqxqxqqxxqxxqqxxqxqqqqxqxqqqqxxqqqxxqqqxxqqxqqxxxqxxqxxqxqqxqqxqqxqxxxxxqxqqqqqxxxxxxqxqxqqxxqqqqqqxxqqqxxxqxqqqxqqxxxxxxqxxqqqxxxqxqxqqxqxqqqxqxxqxqqqqxqqqqxqqqqqxqqxxxqxxqxqxxxxxxqqxqxxqxxqxqqxqqqxqqxxxxxqqxxxqqqxqxqqxxqxqxqqxxqxqxqxqqqqqqxxxqqxxxxqqxxqqxqxqxqqxxxqxxqqxxxxqxqqxqqxxxxxxxxqxqxqxqxxxqxqxqxxqxxqxqqqxqxqxqxqxxqxxxqqxqxqqqqqxqqqxqqqqxqqqqqqqxxqqqqxqqxxqxxxxqxqqqqqqqxqqxqqxqqqqxxxxqxqxxxqqxqxxxqxxxxqxqxqxqxxxxxxxxqxqqqqqqqqqxxqxxqqqqxxxqxxqxqxqxxqxqqqxxxxxxqqqqxxxxxqqxxxqxxqxqqqqxqqqxqqqqxxxxqxxxxxxxxqxxqqqxxqqqqqxqqxqxqxqxxqxxxqxqqqxqqxxxxqqxxqqqxxqxqxqxxqxxqqqxqxxxqqxxqxqqqxqxxxqxqxqqxxxqxqqxxxqqqqxxqqqqxqqxxxxxqqqxxxqxqqqqxqqxqxxxxqxqqxqqqqqqxxqxxxxqqqxqqqxxqxxxxqqqqxxxxxxxxqqqqqqxxxxqqxqxxxqqqxxxqxqqxqqqqxxqxqxxxqqxqqqxqqxxxxxqqqqqxxxxxqqqqxqxxxxxqqxqxxqqqxqxqxqxqxxxxqqqqqqxqqqqxxxqxqxxqxqqxxxxqqxqqqxxxxqxxqqxxxxxxxxxqxqxxqxqxqxqqxxqxxxqxqqxqxqqxqxxqqxxxxxqqxqxqxxxxxxxxqqqxqqqxqxxqxqxqqxxqxxxxqxqqxqqqqqqxqxxxqxqqqqxxqqqxqqqxxqqqxxxqxxqxqqxqqqqxqqqxxqxxxxxqqqqxqqxqqqxxqxxxqxxqxxqxxxxxqqqxqxqqxqqqxxxxqxqqxqqqxxxqqqqqqqqxqxqqqqxqqqqxxxqqqxqxqxqqqqqqxqqqqqqqxqxxqqxqqxxqxxqxqxqxxqxxxqqqqqxxxqqqqqxxxxxqqxqxxxqqqqxqqxqqxqqqqxqxqqqqqqqqqxqxqqqxxqqqqxqxxqqqxxxxqqqqqxqqqqqqxxqxxqxxxqxxqxxxxxxqxxqqqqxxqqxxqqqxqxqxqqqqqqxqxqqqxxxxqxqqxxqqqqxxqqqxxxqxxxxxqxqxxqxqqxqxxqxxqxqxqxxxxxxxxqxqxxqxqqqqxxxxqqqqqxxqxxxqxxxqxxqqxxxqqxxxqxqxxxqqxxxxqqqxxxxqxxxqqqxxxxxqxxxxxxqqxqqqxqqqxqxqqxqqqqqqqxqxqqqxxxqxqqqxqqxxxqqxxqxqqxxxqqqxqxqqqqxxqxxxxxqxqxxxqqxxxqxxxqqqqqqqxqxqxxxqxqxxxxqqxxxqxxqxxxxqqxqxxxqxxqqqxxxxqqxxxqxxqxqxqqxxqxqxqqxqxqxxxqqxqqqxqxxqxxqqqxqxxxxqxqxqxqqxqxqqqqqqqxxqqxqqxxxqqxqqqqxqxqxqxxxxqqqqxqqqqxxxxxxxxxxqxxxqqqxxqxxqqxqqxqxqqqqqxxqqqqqqxqxqxxxxxxqxqxxxqxxxqqxqqxqxqxqxxqxqqqxqqqxxxqqxxxqxqxqqqqqxqqqxxxqxqxqqqqqxqqxqqqqqxxqxxxxxqxqqxqxqxqxqqxqxqxqxqxqxqqqqqqxxqxxqqxqqxqqqqqxxxxqxqqqxxqqqqxqqxxxxxqxxqqxxxqxqxxxqqqxqqqqxxxxxqxqxqqxxqqqqxqqxxxxqqqqqqqxqxxxqxxxxqqxxxxqxqqqqxqqqxqxxxxqxxxqxxqxxxqxxqxqqqqxxqqqxxqqxxqxqqxqqqxqqxqqqxqqqxqqxqxxqxqqqqxqqqqqqqqqqxxqxqxxqxxxqxxqqqxqxqqqqxqxqqxqxqqxqqxxqxqxxxqxqxqqqxqqqqqxqxxxxqxqxqxqqxxqxqqxxxqqxqqqxqxqxxxxqxqqqqxqqqxqxqqxxxxqxqqqxxqxxqxqqxqqqxxxxqqxqqqxqqxxxxqxqxqxqxxqqqqqqxxxqxqxxqxxxqxqxxqxqxqqqxqxqqqqxqqxqxxqxxxqxxxqxxxqxqxqxqxxxqqqxxxxxqxxqqqqqqqxqxqqxqxqxqqxxqxxqxqxxqqqqxxxqxqxxqqxxxqxxqxxqqqqxxxqxqxqqqxxqxxxqxxxxqxxxxxxqxxxqxxxxqqxxxxqxxxxxqxxxxxqxxxqxqqqqxxqqxxxxxxqxxqqxxxqqxqxqqxxxxqqqxxqxxxqqxxqqxqxxxxqxxqxxxxqxqqqqqqxqqxqxxxqxxqqxxqxqxqqqxqxxqqqqxqxxxxxxqqxxqqxqxxqqxqqqqxxqqxxqqxqxxqqqxxqqxxxqxqqxqxqqqqxxqxxxqqqxxqxqqqxxxqxxqxxxxqxqxxxqxqqqxqxxxxxqxqqqqxxqqxxxqxxqxxxxxxxqxxqxxxqxqqxxqqxqqqxqxqqqqxqqqxxxxxxqxqqxqqxxqxqxxqxxxqxxqxxqxqxxqqqqqqxqqqxxqxqxqxqxxqxqqxqqxqxxxqqqxqxxqqxxxxxqqxxxxqqxxqxqqqxxqxqxqqqqxxqxqqxqqqqqxqqxxxxxqxxqxqqqqqxqqqxqxqqxxxxqqxqqqqxqxxqxqxxqqxqqxxqxqxqqxqxqxqxqxxxxxqxqqqqqqqqqqxxqqqqxqqxqqxxxxxqqqxqxqqxxqxxqqxxxxxqqxqxqxqqxqxqxxxxqqqqxqxxxxxqxxxxqxqxxxqxqxxxxqqxqxqxqxqqqxxqxqqqqqqqqxxxxqxqxxqxqxqxxqqqxqxxxqqxqqxxxxxqqxqqxxxxxqxxqxxxqqqxxxxqqqqqxxqqqxxxqxxqxxqxqxxqqxxqqqxqxqxxqqqqxxqxxxqqqxxqqqqxqqqxxxqqqxqxqxxxxxxxqxqxxxxqqqxxqxqqqxxqxqxxxqqxxxxqxqqxqqqxqxqqqxqqxxqqqxxxxxqqqqxxqxxqqxqxxxxqxqqqxxqxqqxxqxxxxxxxqqxqqxqqqqxxqqqqxxqxqqqqxxxxqqxxqqxqqqxqxxxxxxqqxqqqqqqqqxxqxxqqxxxqqxqqqqxqqxxxxqqqxqxqxxqqqxxqxxxqqqxqqqqxqqqxqxqxxqqxxqqqqxqqqxqxxxqqxxqqqxxqxxxxqxxqxxxxqxxqxqxqqxxxxxxqqqxqqqqxxxxqxqqxqxxqqqqxxxxqqqxxqqxxxqxxxqxqqxxqxqqxqxxqxxxxqqqxxqxxxqxqqqxxqxxxxxxqxxxqxqxxxxqqxqxxxqxxqxxxxqxxqqxxxqxqxqxqqqqqxqxxxxxqqxqqqxxqqxqqqqxqxxqqqxqxqqqqxqxxxxqxqxxqxxqqqqxxqxxxxqqqxxxxqxqxqqqxqqqqxxqqxqqxqqqxxqxxxqqqxqqxqqxqxqxxxxxqqqxqqqqqxqqxxxqxqqxxqxqqqqqxxxxqxxqqxqxxxqxqqxxqxxxxxqqqqxxqqqqxxqxxqqxqqxxqqxxqxqqqxxqxxxxxqxxqqxxxqqxqxqxxxxqqxqqqxxxxqqqxxqxxqqxxqxqxqxqxqxqxxqqxxxxqxqxqxxqxxqxxqqqxxqxqqqxxxxqxxxqxqxxqqxqqxqqxxxxxxxxxxqqqqqxqqxxqqxxqqxqqqqqqqxxqxxqqxxxxxqqqxqqqqqqxqxxqxqxxxqqxxxxqxxxqqxxqqxqqqxxxqqqxqxqqqqqqxxqxqqqqxxqqxqqqxxxqqqqxqqqxqxqxxqqxqqqxxxxxxxqqxqqxxxqqxxxxxxqqqxxqxqxqxxxqxxqxqqqxqqxxxxxxqqqqxqxqqqxqxqxxxqxqxqqqxqxxqqxxqxxqxxxxqxqqxxxqqxxxxxxqxxqqqqqqqqqqqqqqxxxxqqqqqxqqxxxqxxxqxqqqxxxxqqxxxqqqxxxqxxqqxqqxxxxqqxxxqxqxqqqxxqqxqqqqqqxqxxxxxqqxxqqxxxqqqqxqxxxxxqxqqxxqxxqqxqqqxqqqxxqqxxqqqxxxxqxxxxxqqqqxqxqqxqxqxqqxqxqxxxqxxxqxxqxxxqqxxqxqxxxqxqxxxqqxqxqxxxqqxqqxqqqqqqxxxxqqxxxxqqqqxqxqqqxqqqxxqxqqqxqxxxqqqxqxqxxxxxqqqxxxxqqqxxxqxxxxqxxxqqxxqxxqxqxxxqqxxxxxxqqxxxxxxxxqxqxqqxqqxxxxqqxxxqxxxxxxqqqxqqxxxqxxqxxxxqqqqqqxqxxxqxqqqqqqqxqqqqxqxqxxqqqqxqqqqqxqqqqxxxqxqqqqqqxqxqxqxqxqxqqxqqxqxqqxqqxqqxqqqxxqxxxqqqxqxxqqqqxxxqqqxqxxqxqqqqqxqxxxxxqxqxqxqqqqqqqqqqqxqxqxxxxqxqxqxqxqqqqxxqxqqxxqqxxxxxxxqxqqxqqxxxqxxqxxqxxxqqxxqqxxqqqqxqxxxqxxxqxqqxqxxqqxqxqxqqqxxqxqqqxqqqqqxxxxqxxxqxqxqqqqxxqqxxqxqqxxqqqqqxxxxxxqqqqqxqxxqxqxxqqxxxxxxxxxxxxxxxxqqqqqqqxxxxxqxqqxxqqqqqxxqqqqxqxxqxxxxqxqqqxqxqqxqxqqxxxqxqxqqxxxqxqqxqqqxqqxxxqxqqxqxxqxxxqxqqqqxqxxqxqqxqxxqqxqxxqxxxxqqqxqxxqqqqqxqqxxxqxxxqqxqxqqxxqqxxqxqxxqxxqxqxqxxqqqqxxqxxxxxxxxxxqxqqxxxqxxxqqqqxqqqqqqxxxqqxqxqqqxxqqxqqxxqqxxqqqxqxqxxqqxxqqqqqqxxxqqqxqqxqxxxxxqqqqxxqqxqxqqxxxxxxqxqxqxqqxqxqxqqqqxxxxxxqqxxxqxqqqqxxxqxqxqqqqxxqqqqqqxxqxqqqxqqxxqxxqxxxqqqqxxxqxqqqxqqqxxqxqxxqqqqqxxxqxxqqxqqqqxxqqqqxqxqqxqqqxqqxxxxxqxqqqqqxxxxqqxxqqqxqxqqqqqxqxxqqxqqxqxxqxqqqqxxqxqxqxqxqxxxxxxqqxxxqqxxxqqqqqqqxxxqqxqxqxxxxxqxqxxqxxxxxqqqxqqxqxxxqqqxxxqxxqqqqxqxqxqxqqqqqxqxxxqxqxxqxxqxxxqqqxqxqqqqqxqxxqqqxxxqxqxqxqxqxqxxxqqxqxqqqxxqxxqqqqqqqxqxqxxxqxxxqqxxqxqxxqqxqxxqqxqqxqqqxqxqqqqqxqxxqqqxxxxqqqqqxqxxxqxqxxqxqqqqqxqxxqxqqxxqqqxxxqxxxqxxxxqxxqxxqxxqqqqqqqqxxqxqqxqqxqxxxqxxqxxqqqxxxxxqxqqxqxxxxxqxxxxxqqqxqxqxqqqqqxqqxqqqqqxqqqxqxqqqxxxxqqxqqxqqqqqxxxxqqxxqqqqqqxxqqxxqxxxqxxqxqxqxxqxxxqxqxxxqxqqxxqxxxqqqxqxxqqqqxqqqxxqqxqxqxxxxxxxqqqqqxxxqqqqqqqqxxxxqxxqqqxqqxqxqxqqxqxqqxqxxxxxxxxqqqqqxqxqqxqqxqqxxqqxxqqqxqxxxxxqxxqxqqxqxxqqxqqxqxqxqxqxxxxxxqxxqqqxxqqxqxqxxqxqxqqqxxxxxxxxxxqxqxqqqxqxqqqxqqxxxqqqxqqqqxxxqqxxxqxxqxxqxxqqqqxqxxxqqqxqqxqqqqqqxqxqqqxxxxxqxxqqxxqxqqqqxqxxxxqxxqqqqqqqxqqqxqxqxqxxqxqxxqqqxxxqxqqxqxqqqqxxqxxqxqqqxxqxqxxqqqxxqxxqxxqqqqxxqqxqqxqxqqqqqqxxqqxqxqxqqxqqxqxqqqqxxxqxxxqxqqxxqxqqqxxqxxxqqxxxqqqqqxqqqxxxqxxxqqqqxqxxqqxqqqxqqqxxqqqqxqqqxxxqxxxqxxxqqqqxxxqqxqqqxqxqxqxqqqqqqqxxxxqxqqqqqqqqqqxqxxqxxqqxxqxxxqqxxxxxqxxxxxxqxxxqxqxxxxqxqxqxqqqqxxqxqqxxqxxqqqxqqqqqqxqqxqxqqqqqqqqxxqxxqxqxqqxqqxqxqqqxxxxqxxqxqqxxxqxxqqqxqxxxxxxxxxqqxqxqxxqxqxxxxqqxqqqqqxqqxxqqxxxxxqxqqqxxxxqqqxqqqxqqqxqxqqqqqqqxqqxqqqqxqqqxqqxqxqxxxqxqqqqqqqxxxqqxxxxxqqxqxxxxqxqxqqxqqxxxqqqxqqxqqxqqqqqqxqqxxxxxxxqxqqqxqxqxxxqxxxqxxqxqqxqqqxqqxqqqqqqqxqqqqqqxxxqqxxqqqxqqqxxqqxqqxxxxxqqxqxxqxxqqqxqqxxqqqxxxqxqqqxxxqqqqqxxqxqxqxqqqqxxqqqxqqxxxxxxqqxxxqqxqxxxqqqqxqqxxqqxxxxqqxqqqxxqxxqqxqqqqqxxqxxqqxxqxxxxqqqqqxqxxqqqxqqxqqxqxxqqxqxxxqqqxqxxxxxqxxxxqxxxxqxqxxxxqxqqxxxqxqqqxxxqxqxqqxxxqqxqxqxxqqqxxxqqxxxxqxqqqxqqxqqxxxqxxqqxxqqxqxxqqqxxxqxqxxxxxqqxxqqxxxqxxqqqqqxqqxxxxxqqqxxxxqxxqxxxxqxqqqxqqxqqxqxxqqxxqxxxxqqqqqqxqqxqqqqxxxqxqxxxqqxqxqqqxxxxxqqqxxqxxxxxqqxqxxqqqqxxxxxxqqqqxxqqqxxxqqqqqxxqxxxxxqxqxqxxxxqxqxqxqxqqxxqxqqqxxxqqxqxqqxqxqqqxxqqqqxqqxqxqxxxxxqxxqqqqqxxqqqqxqqqqqqxqxqxqxxxxxqxxxxxqxqqqxxxxxxxqqxxqxqqqqxqxqxxxxqqqqqxqxxxqxqqqqqqqxqqqxxqqxqxxqxxxqxxqxqqqxqxqxxqxxqxqqxqxqqxxqxxqqxxqqqxxxxxqqxxqqxqqqqqqxxqqqqxxxqxxxxxqqxxxxxqxxqxxqxxxxxxqxqxqqxxqxqxqqxxqxxxxxxxqqqqxxqqxxxxqqqqxxxxxxxxxxxxxqqxxqqxqxqxxqxqqxqxqqxxxxqxxxqxxqqxxxxqqxxxqxqxqqxqqqxxqqxqqxxxxqqxxxxqxqqxqxxqqxxqqqxqqqqxqxqxxqqqxxxqxxxxqqqxxqqxqqxxxqxqqqxxqxqxxqqqqqqxxqxxqqqxqqxqqqxqxxxqxxxqqxqqxxqqxqxxxqxxxxqqxxqxqqxxqqqxqxxxqxqxqxxxqqqqqqxxqxxxxqxqqqxqxxqxqqqqxxxxqqxxxxxxqqxqqqxqqxqqxqqxqxxxqqqqqxxxqxqxqxxqxqqqqxqqqqqqqxxxqxxxqqqxqqqqqxqxxqxqqxqxqxxxqxqxqxqqqxqqqqqxqxxqxqqqqxqxqqqxxqxxqqxxxqxqqqqqxxxxxxxxxqqqqxqxqxxxqqqxqqxqqxxxqxqxqqxxqxxxxxxqxxxqxqqxxqqqxqqqxxqqqxqqxqqqqxqqqqxxqxqxqqxqqqxqxqqqxxxqxxxqxxxxxqxqxxqqqxqxxqqqqxqxqxxxxxqqqxqqxqxxqqxqqxqqxxxqqqxxqxqxxqqqxqqqxxqxqxxxqqxxqxxxqqqqqxqxxqqqxqqxqxxqqxqqqxqqqxxxxxxxqxxxxxqqxqqxqqqxqqqqxxqqqxqqqxqqqqxqqxqxxxqxxxxxqqxxqqqqxxqxxqqxqxqqxqxqqqxxqxxqxqxxxqxqxqxxqqqxxqqxqxqqxqqqxqxqxxxxqqqxqxqxxxqxqqqxqqxxqqxxxqxqxxxqqxxxxqxxxqqxxqxqqqxxxxqqxqqxqqqqxxxqxqxxxxxqxqxqqqqxxxqxxqqxxxqxqqxxqxxxxqxxqqqqqqqxqqqxxxxqxxxqqxxxqxxqxqqqqqxqqqqqqxqxqqxqxqqqxxxqqxxxqqqxxxxxxqxxxqxxqxqxqqqxxxxqxqxqxqxqxqqqqxxqxqxxqqqxqqqxxqqxxxqxqxxqqxqxxqqxqqqqxqqqxxqxqxxxqxxxqqxqxxqqxqxxxqxqqqqxqxqqqxqqqxxxxqqqqxxxqxxqqqxxqqqxqqqqxqqxxqqxxqqxxxxxqxqqqxqxqqxqxxxxqxqqxqqqxxxqxxqxxxqxqxqqxxqqxxqqqqqxqqqxqxqxxxxxxxqxqxxqxqxqxqxqxxqxxqqxqxxqxqqqqqxqqqxqqxxxxqxqxxqxxqxxxxxxqxqxxqxxqxqxxqqxqqqxxxxxqxqqxqxxqqqqqqqqxxxxqqqqxxqqqxqxxqxqqqxxxqqxqxxqqxqqqxqxqxxqqxxqqxqqqxxxxqqqxqxqxqxxqqxxxqxxxqxxxxxqqqqqqqxqxqqqxqxqqqqqxxqxxxxqxqxqqqxqqqqqqqqqxxxqqxxqxxxxqqxqxqxxqqqxqqxxqqqxxqxqxxqqxqqqqxxxxqqqxqxxqxqxxxxxxxxqxqxxxqqqxxxxxxqxqqxqqqqqqqxqqxqqqqxxqqxqqxqxqqxxxqqqxxqxxxqqqxxxqxxqxxxqqxxqxqqqqxqqqxqqxqxxxxqqxxxxqxxqxqxqqqxqqqxqxxqqqqxxxxxxxxxxxqqxxqqxxxxxqxxxxxxxqxqxqqxqxqqqxxxqxxqxxxxxqxqxqxqxxxqxqxxqxqxqqxqxqqqqxxxqxqxqqxxqxqqqqqxxqxqqqqxqqqqqxxxxxqxqxqqqqqxxqxqqxqqqxqqqxxxqxxxqqxqxxxqxxxxqxqqqqqxxxqqqqxxqqqqxxxqxqqqqqqqxxqxqxxxqqxqqqxqqxxxxxqqxxqqxqxxxxqqxxxqxxxqqxqqxqqxxxxqxqqqxxxxxqxqqxxqqxqxxxqxqqqqxxqxxxqxxxxqxxxxqxxxqqxqqxxxxxxqqxxqqxqxxqxqxxqxxxqqqqxxxqxxqxxqqxxxxxqxxqxqxxxqxxxxqqqqqqqxqxxqxqxqqxxqxxxxqxqqxqqqqqqxqxqqqqqxxxxqqqqqqqqxxqqxqxxqxxqxqqxqqqxqqqqxqqxxxxxqxxqqqxxqqqxxqqqxxxqxqxxqqxxxqxxxqqqxxqxqxxxxqxqxxqxqqxqqqxxqqqqxqxqqqqxxqqqqxxxqqqqxqxxqqqxqqqqxqxxqxqxxqqxqqxqqxxqxqxqxxqxxqqqqqqqqxqqqqqxxxqxqxxqxxqqqqqxqqxqxxqxqxxxxqqqxqqqqqxqqqqqqxqqqqqxxqxqqxqqxqqqqqxqxqqqqxxqxxqxxxxqqxxxxxxxxxxqqqqqxqqxxxqxxxxqxqqxqqqxqqqxxqqxqqqqqxxqqqqxxxqqxqxqqxxxxxqxxxxxqqxqqqxxxqxqxxxqqxxxxxqqqqxxxqqqqxxxxxqxxxxxqxxqqxxxxxqqqxxxqqqxxqxqxqqqxxqxxqxqxxxxqqxxqxqqxqxxqxqxxxxqxqqxqxqqqxqxxqqqqqqqqqqqxxqqxxqqxxxxxqxxqqxqxxqxxqxxxqqqxqxqqxqxxqqxxqxqxqqxqqqxxxqxxxqqxqqqxxxqqxxxxxqxxxxqqxxxqxqqxqxxxqqqqxqxxxqqxxxxxxqxqxqxxqxqxxqxxxxxxqxqqxqxxqqxxqqxxxxxxxxqqqqqxxxxqxqxqxqqqqxxqqqqxxxqqxxxqqxxqqxqqqqxqqqqqxxxxqqqxxxxqqxxxqxxxxqxqxqxqqqxxqxxqqxxxqxqqqqqxqxqqxqxqxqxqxxxxxxqxxqxxqxxxqxxqqqqqqxqxxqxxqqqqxqxxxxqqxxqqqqxqxqqxqqqqxxqxqxqqqxqxxqxxxqqqxxqqxxxxqqqxqqxxqxxqqqqxqxqqqxqqqxqqxqxqxxxqqxqqqqqxxxqxxxqxqxxxxqqqqxqqxxxxxqqxqqxxxqqqxxqxqqxxqqqxqxxxqxqxqqxxqqqqqqqxxxqxqqqxqxxqxxxqxqqxqqxxxxqxxqqqxqqxxqxxqxqxqxqxxqxxqqxxqqqqqqxxqxxxqqqxqqxxqxqqqxxqxqqqxxqqxxqxxqxqxxqqqxqqxqqqqqxxqxxxxqxqxxxxqxqxqxqxxqqqxxxqqqxqqqqqqxqqxqxxxqqqqqqqxqqqqqxqxxxxxxxxqxxqxxxxqqxxxqqxxqqxqxqxqxqqqqqxqxqxqxxqqqxxxxxxqqqqxxxqqxxqxqqqxxxqxxxxqqxxqxqxxqxxxxxxqxqqqqqxqxxxqxxqqxxxqxxxxxqqxxqqxqxqqqqxxqxqxxqxxqqxxxqqxxxxqxqxxxxxqxqxqxxqqxxxqqxqqqxqqxqxqqqxqqxqqxxqxqqxqqqqxqqxxxxxqqqxxqxxxxxxqqqxxqqxqxqxqxxqxqxqxxqxqxxxxxxqxxxqxxxqqqqxqxqxxxqqqxqxqxqqqxqqqxxqxxxqxqqqxxqxxqqxxxqqxqxqxxxxxqqqxxqxxxqqxxqxxqxxxqxxxqxxqxqxxqqqqqqqqxqqqqqxqqqxxqxqxqqxxqxqqqqqxqqqqxxxqqxxqxxqxxxqqxqqxxxqqxxxqxqxxqqqxxqqqxxxxqqxqxqqxqxxqxqxqxqxxxxqqxxxxqxxqxxxxqxqxxxqxqxqqqxxxqxqxqqqqxxxxxxqqxxqxxqxqxqqxqqxxxxxxqqxqqxqqxxqqxqxqxqxqxxxqqxqqqxxqqxxqqqqxxqxxqxxxxxqqxxxqqxxqqxqqqxxxxxqxxqqxqxqqxqqxqxxxqqqxqxxxxqxxxqqxqxxxqqxxqqxxxxxqxqxxqqxxxqxqqxqxqqqqqqxxxxxxxxqxqxxqxxqqqxqxqxxxxqqqxqxxqxqxqqxqxxqqxqqxqqxqxqqqxxqxqxxxxxxxxxqqqqxqqqqqxxqqqqxqqxqqxxxxxqqqqqxqqxxqqqxqxxxqxxqxqxxxqqxqxxqxxqxqqqxxxqxqxxxqxxqxqxxxqqqxxxxqxxqxqqqxxqqqxxxqxqqqqqqxqxxqxxxxxxqxxxxqxqxqqxxqxxqqxxxxqxqxqqqxxqxqxxxxxxqqqqxxxqqqqqxxqqqxxqqxxqxqqxqxxqqxxqqqxqxxxxxqxxxxqqxxqxqxxqqxqxqqxxxqqqqxqxxxxxxxxqqqxqxxxxqxxxqxqxqxxqxqqxxqxqqxxqxqqxqxxqqxqxqxqqxxxqxxqxxxqqqqxxxxxqqxxxxxqxxxqqxxqxqqqxqxxqxxxqqqxqqxxqqqxxqxqqxxqqqqqqxxxxqqxxqqxqqqxqxxxxxxxqxqqxqqqxqxxxxxqqxxxqqxqqqqqqqqxxxxqqxqxqxxqqxxxqxxxqxqxqqqqxqqqqqqxqxqqxxqqxqxqqqqqxxqqxqqxqqxqxxxxxqxqxxxxxqxxqxqxqqxxxqqqqqxxqqxqxqqxxxqqqxqxqqxqxqxxqqqxqqqxxqqqqxxxxqxqqxqxxqqxxxqxqxqqqxqxxxqxqxqxxqxxqqxxqqxxqxqxxxxqqqqxxxxxxxqxqxxxxxqxxqqxqxxqxqqqqxqxqxxxqxxqqxxxxqqqxqqxxxqqxqxqxqxqqqqxxxqxqqxxqxxxqqqqxqxxxxxxqqxxxqxqxqqqxqqqxxxqqxqqqxqqxxqxxqqqqxqxxxqxqqxxxxxxqqqxxqqqqxqqxqqqxqqqxqxxqqqqqxqxxxxqqxqxxqxqxqxqxqqxxxqqqqxxqqqxxxqqxxqxqqxxxxxqqxqqqxqqxxxxqxxxqxxxxqxqqxqxxqxqqxqqxxxxxqxxxqqxxxxxxqxqxqxxxxxqxxxqqxxxqxxxxxqqxxqxxxqxxxqxqqqxxqxxxxxqxxxxqqxxqxqqxxqqqxqxxqxqqqqxxqxxxqqqxqxqqqqqqqxxqxxqqxqxxxqqqxqxqqxxxqxxqxxxxxxqxxxxqqxxqqxxqqxqqqqqqqqxxqxqqqxqqxqqqqqxqqxqxqqqqxxxqxqxqqqqqqxqxqqqqqqxqxxqxxxqxqxxqxxxqqqqxqxqxxxxqxqxqxxxqxxqxxqqxqqxqqxxxqqqqqqxqqqxqxqxxxxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqqqxqxxxxqxqxxqxqqxqqqxqqqxqxxqqqqqxxqxqxxxxqxxxxxxqxxqqxxxxqqxxxqxqqqxqqxxqxxqxqqqxxqqqqxxqqqqxqqxxqqxqxqxqxxxqxxqxqxxqxxqxqxqqxqqqxqxxxqxxxqxxqqxxqqxxqxqxqxxxxxqxxqqxqqqxxxxqqqxqqxqqqxxxqxxxxqqqqxxqqxxxxqxxqqxxxxxxqxqqqxxxxxqqqqqqqxqqqxxxqqxqqxxqqqqqxqqqxqqqxxqxxqqqxxqxqqqxxxqxxxxxqxqxxqxxqqxxxxqqqxqxxxxqqqqxqqxqxqxxqxqxxqxqqxqqxxxqqqqqxqqxqqxxxxqqxxxqxqqxxqqqxxxqxxxqxxqxqqqxxqqqxqqxxqqxqqqxxqqxqxxqxxxqxqqqxqxqqqqxxqxqqqxqxxqqqqqxxqqxxqxqxqxqqxqqxxqqqxqxxqqqqqqxxqxqxqqxxxxxqqqqqxxqqxxqqqqxqxxqqqqxxxxxqxqqqxqqqxqxqqxqqxxxqxxxxqqqxqxqxqqxxxxqqqqxxxqqqxxxxqqxqqxqqxxxqxxqxxqxxqqqqxqqxxqqqxxxqxqqxxxqqqqxqxxqqxqxxqxqxqqxxqqxxqqqqxxqxqqxqxxxqxxxqqxxqqxxqxqxxxqxqxqqxxxxxqqqqqxqqqqqxxxxqxqxxxxxqxxqqqxqxxqqxqqqqxxxxqxqqxqqqxqqqxqqqqqqxqqqxxxqqxqqqqxqqxqxqqqqqqxqxqqxxxxqqqxxqqqqqxqqxqxqxxxxqxxxqxxqqxxqxqxxxxxqqxqqxqxqxxxxxqxqxqxxxqqxqxxqxxxqxqxqqxqxqqxxqqxxxxxxqqxxqxxxqqxqxqxxxqqxqxxxxqxxqxqxxxxqqxxxqqqxqxqqxqxxqqqqxqqxqxqxqxxqqqqqxqxqxxqxqxxqqqxqqqxxxxxxqqqxqqxqxxqxxxqqqxxxqxqxqqqxxxqqqxxxxxqqxxxqqqqqqqxxxxxxqxxxqqqqxxxxxqxxqqqqqqxqxqqxqxxqxqxqxqxxxqqqqxxxqxqqxqqqxxxqxqxqqxxxqxxxqqxqqxxqxxqqxqxxqqqqqxxqxxxqqxxqxqqxxxxxqqqqqqqxxxxqqqxqqxxqxqqqqqxqxxqqxqxxqxxqxqxqqxqqxxqqxqqqqxxxxxqqxqxqqqxxqqqqqqqxxxqqqqqqxqxxxqxqxxqxxxxxqqqxxqxqxxqqqqqxxxxxqxxqxxqxxqxxxqxqxqxxxqxxxxqqqqxxxqqqxqxqqqqqxxxxqqqxqxqxqqxxqqqxqxqxqxxqxqxxqxqxqxqxqqqqxxqqxxxqxxqqxxxqxqqxqqxqxxqxxqqqxqxqqxqxxxqxqqxxqqxqqxqqxqxxqqxxqxqxxqqqxxqqxqqxqxqxxxqxxqxxqqxxqxqxxqxxxxxqxqqqqqqqxqqxxxqqqqqxxxqqxxxxxqqqxxxxxxqxxqqqxxxxqqxxxqqqxqxqxxxqxxqxxxqxxxqxqxqqqxxqqqqxxqqxqqxqxqqqqqxxxxxqxxqqqqqqxxxqxxqxxxqxqxqqxqqxqqxxqxqqxxqxqqqxqxxxxxqqqxqqxqxxxxqxxqqqqxqxqxxxxxqqqqqxqqqxqxqqqqqxxxqqxxxqxxqxxxqxqqxqxqqxqxxxxxxxxqxqxxxqxxqxqqqxqxqqqqxqqqxqxxxqxqqxqxqqqxqxqxxqqxxqqxqxxxxqxxxqqqxqqxxqqxqqqqqqxqqqqxxxxxxxxxxxqqqxxqxxxxqqqxqqqxxqxqxqqqqxxqqxxqqxxxqqqqxqxxxxxxxxxxxqxqxxqqxqqqxqqqqxxxqxxqqxqqxqqxqqxxqqxxqqqxxqxqqqqqxqqqxqqqxxxqxxqxxqqqxqqqqxqqqxqqqqqxqxxqxqxqxqqqqxxqqqxxqxxqxxqqqqxxqqxxqqqqqqqxqxxxqqqxxqxqqxqqqxxqqqqxxqqxxqxqqqxxqxqqqxxxxxxqqxxxqqqqqqqxqxxxxqxqxqxqqqxxqqqxqqxxqqxxqqqqqxqxxqqqxxqxxqqqqxxxxxqqxqqqxxxxxqxxqqqxqxxxxxqqqqqqqqxqqxqqxqqxxxxxxqxqxqqqxxxxqxxqxqqqxqxqqxxqqxqxqxqxqqqxxqxxqxxxqqxqxxxqqqqqqqqqqqqqqxqqqqqxxqxxqqqxqqxqxqqqxxqxxxxqqxqxxxqxqqxxqqqqqqxxqxqxqqxqxqxqqqqxqqqqxxqxqqqxqxqqxqqxxxxxqqxqqxxxxxqqqxxqqxqqxxxxqqqqqxqxqqqxqqqxxqqxqqqxxqxqxqqqqxxxqxxxxqqxxxxqqqxxqxxqqqqxqqxqqxqxqxxxqxxqqxxqxqqqqqqxxxxxxxxqqqxqqxqxxxqxqxqxxqxqqqqxqxqqxqqqxqqqxqqqxqqxxxqxxxxqxxqqqxqqqqqqxxqqqxqxqxxqxqxqqqqqqxqqqxxxqxxxqxxxxqxqqxxqxqxqxxqxxqxxqqxqxxxqxxxxqxxqxqqxxxqqxqxxqqqxqxqqxxqxxqqqxxqxxqqxqqxqqxxqqxxqxqqxqxxqxqqxxxxxqxxqxqqqqxqqxqqxqxxxxqqqxxxxxxxxxxxxqqxxqxxxqxxqxxqxqxqxxqqqxxqqqqxqxqxqqxqxqxxqqqxxxqqqxqqqqqqqqxqxqqxxxqxxqxxqqqxqxxqqqxxqqxqxxqqxqqxxqqxxxxxqqxxxxxqqxxxxxqqqxxqxqxxxxxxqqxqqqxxqxxxxqxxxxxxqqxqxxqqxqxxqqxxqqqxxxxxqxqxqqxqqqxqqxxxxqqqxxqqxxxxxqxxqxqqxqxxxxxxqqxqxqqqxxxxqqqqqxqqxxxxxqxqqqxqxxqqqqqxqxqqqxqxxqqxxxqqqqxqqxqxqqqxxqqxqqqqxqqqxxqxxqqxxqqqxxxqqqqxqxxqqqqqxqqqxxxxqqxxqxxqqxqqqqxxqxxqqxqqxqqqqxqqqxxxxqqqxxqqxqqqxqqqxqqxxqxqxxqqxxxxxxxxqxxqqqxxxqqqxqxxqxxqxqqxqqqxxxxqqxxqqqqxqxxqqxxqqxqxqqxqxqqqxxxxqqxxxxxxqxxxqxqqxqqxqxxxxqxxxxxqqxqqqqxqxxxqxxqxxxxqqqqxxqqqqxqqqqqxxqxqqqxxxqxxqxxqqqxxxqqxxxqqxqxqqxxqxqqxxqxxqqxxxxxxxxxxqqxqqqqqqxqqqxqxxxxxqqxxqxqxqqxqxxqqxqqqqxqqqqxqqqxqqqqxxqqqxxxxxqqxqqqqqxxxqxqxqxqqxxxxqqqqqxxxxqxqqqqxxqqqqxqxxxqxqxqqqxqxxqqxxxxxqxqxxxqxxxqqxxxxxqxxxqxxxqxqxxxqqqqqqqqqxxqxqxxqqxxqqxqqxqqxqqqqxxxxxxxqqxqqqxqqqxqxqqxqxxxxxqqqxxqxxqqqqqqxqqqqxqxqqqqqxqxqqxxqqxxqxqqqxxxxqxqqxqxqxqqqqxxqxqqqxxqqqqxxxqqxxqqxqqxqqqqxxqxqxxqxxxqqxxqxxxxxxxxxqxqqqqqqqxxxxxxqqxqxxxxqxqxqqxqqxxxxxxqxxxqxxqxxqqqxqqqqqqxxqxxqqqqqxqxqxxxqxqxqqxqqxxqxqqxqxxqxxxqxxxxqqxqxqqqqxqxxqqqxxxxxxxxxxxqqxqqqxxxqxxqqxqqxxqqxqxxqxqxxxqqqqqqqxqxqqqxqqqxqxqxxqqqqxxxxxqqxxqxqxxxqxxqqxqxqxqxxqxxqqqxqxqxxqqxqqqxqxqqxxqqqxqqqqqqqqxqqxxqqxxxxxqxqxxqqxxqxqqqxqqqxxxxxqxxqxxqqxxqxxxxxqxqqqxxqqqxxxxqxxqqxqqqqqxxqxxqqxqxqxqxxxqxqqxxqxxxqxxxxqqqxqxqqxqqqqqxxqqqxqxqqqxxxxxqxqqxqxqxqqxqxqxxxxxqxqqqqqqxxxqxxxxxqqqxqxxqxqxxxxqxxqqqqqqqxqqxxxqxqxxxqqxxxxxqqqxqxxqxxqqqxxqxqqxxqxxqxxxxxqxxqqqxxxxxxxxxxxxxxxqxqxqqqxqxxqqqxxqxxqxqqxxqxqqxqxqqxxqqxxqxqxqqqxxqqqqxxxqxqqqqxqqxxxqqqxxxxqqxqqqqxxqqxqxxxqqxxqqqqqqqqxxqqxxxqxqxqxxqxxxxqqxqqqxxqxxxqqqxxqqqxqqxqxxxxxqxqxxxxqxxxqxqqxqqxqqqqxxqxxqxxxqxqqxxxxqxxxqxqqqxxqqxqxqxxqxqxxqqqxxqxqxxxxqqxxqxxqqqxxqqxqxqqqxqqqxxqxxxqxxqqxxxxxxxqxxqqxqxxxqxxqqxxqxqqxxqxxxxqxqqxqxxxxqqqqqxxxxxxqxqxxxqqxqqxqxqqxxxqqqxqxqqqqqqqqxqqqxqqqqqqxqqqxxxxqxxqxxqqqxxqqxxqxxxqqxxxxqqqxqqqqxxqqxqxqxxqqqxxqqqqxxqxxxxqqxxqqqxqqqqxxxqqxxqxxxxqqxqxqqxqqqqqxxxqxxxxqxqxqqqxxqqxqxqxxqqxqxxqxxxxxxqxqqqqxxxxxqqqxqxxxqqqqxqxqqqqqqxqxqqxqxxqxqqxxqqqqxxxxxqxqqxxxqqxxxxqqxqxxqqqxqqxxqxxxxqqxqqxqqqqxqqqxxxqqqqqqxxqqxxqqxqqxqqxqxxxxqxxqqxxxqxqqqqqxxxqxqxxxxqxqxxqqxqxqqqxqxqqxqxxxxxxxqqxxqqxqxqqxxqqxxqxxqxqxqqxxxqxxxxxqxqxqxqqqxqqxxqxxxqxqqqxxxxqxxqxqqqqqxxqxqqxqqxxxxqqqxqqqqqxxqxxxqxxxqqxxxqqqqxqxqqxxqqqqqqqxqxqxqqqqxxqxxxxxqqqxqqqqxqxxxxxqqxxqqxqqqxxxxqxxqxqqxqqqqxqqxxxxxxqqqxqxxxqxqxxxqxxxxxqxxqqqqxxqxqqqxxqxxxqxqqxqxqqqqqqqxxxqqqxqqqxqqxqxxxxqqqxqqqqxxxqxxxxqqxxxxxxxxxqxxqxxqxqxxqqxqxxqxqxqqqqxqxqxqqxqxqqxqxxqxxxxxqxqqqqqxxxqqqqqqqqxqxqqxqqqqxxxxqxqxqxxqqqqqqxqqxxqxxxqqqxxqqqxxqqqqxxqxqqxqqqxqxxxqqqqxxqxqxxqxxqqxxxxqqxqqqxxqqxqxqxqqqqxxxxxqxxxqqqqqqxxxxqxxqqqxqxxqqqxqqqqxqqqqqqqxxxqqxqxqqxqxqxqqxxqxqqxqxqxqxqqxxqqxqqqxqxqxxxxqxxxqqqxxxxqqxqqqqxqqqqqqxqxxqxqxxqqxxqxqqxqxxqxqxxqxxxxqxxqqxxqxxxxxxxxqqxqqxxxxxxxxxxxxqqxxqqqqqqxxqqxqqqqxxqqqxqqxxqqqqqqqqxqxxqxxxxqqxqxqqxxxxqxqxqqqxxqxqqqxqqxxqqxxxxxxxqxxxqqqxxqxxxxxqqqqxqxqqqqxqqqxqqxxxqxxqxqxxqxxqqxqxqqxqqxqxqxxxqxxqqxqxxxqxqqxqqqqxxxqqqxqxxxqxqxxxxxxqxxqqxqxxqqxxxqqqqxxqxqqxqxqqqxxqxqxxqxqqxxxxqxxxxxxqxqxxxqqqxqxqqqxqxqxqxxqqqxxqqxxqqqqqqxxxxqxqxxxxxxqxqxqqxxqxxqxxxxxqxqxxqxxqqxqqqxxxqxxqxxqqqxqqxxxxqxqxqqqqqxqqqxxxxqxxxxxqqqqqxqqqqxqqqqxxxxxqxxxxxxxqxqqqxxxqqqqqqxqxxqqqxqqqxxxqxqxqqqxqxxqxqxxxqxqqxqxxqqqxqxxxxxxqxxqqqxqxxxxxqqxxqqxxqxxqxqqqqxqxqxqxqxqqqxqqxqqqqqqxxxxxqxxxxxxxxqqqxxqxqxxqqxxqxxxxqqxqqxqqqxqqxqqxqqqxxxqxxqqqxqxxxqqqxqxqxxxxxqxqqxqqxqqqxqqqxxxxqqqxxqxqqxxqxxxqxqxxxxxxqqxqxxqqqqxxqqxxqqxqxxqqxxqqqqxqqqxxxqxxqxqqqqxxqxxqxqxqxxxxqxqqqqqqqqxqqxxqxxxqqxxqqxxqqxxxxxqqxqqxxxqqxqxxqqqxxqqqxxxxqxqxqxxqxxxxqxqxqqxqxxxqqqxxxqxqxxqxqxqqqqqqxqqxqxxxxqqqxqqqqqxxqqxxxxxxxxxqxxqqqxxxqxxqqqqxqqxqxxxqxqxqxqxxxqxqxxqqqxxqqxxqqqqqxqqxxxqxqqxxxxqxxxxqxxxqxqxqqxxqxxxqqqqxqqxqqxxqxqqxxxxxxxxqxqqqxxqxqxxqqqxxqxqxxqxxqqxxqqqqqxxqxxqxxxxqxxqqxxqxxxxqxxqqqqqqxqxxqxxxqxqqxxqxqqqqqxxxqqxqxqxqqqxqxxxxqxxxqqxxqxqqxqxqxxqxqqxxqqxxqqxxxqqxqxxxqqqxqqxqxxxxxqqqxqqqxxqqxqqqxxqxxxxxqqqqxqxxxqqqqqqqxqxxxxqxxxqqqqxqqqxqxqxxxxqxqxxxqxqqqqqxqxqqqqqxqxqqqxxqxqqxqqxqxxxxqqqxxxqxxqqqqxxqxxqxxqqxxxqqxxqxxxqqxxxxqqxxqqxxqqqqxxxqqqqxqxqxqxxxqqqqxxxxxqxqxxxxqxqqqqqxqxqxqxqxxxxqqxxxqxxxqqqxxxxxxqqxxqqxxqxqqqqqqqqxxxxxqqqqqxqqxqqqxxxqxxxxxxqqqqqqxxqxqqxqqqqxxqxxqqqxxxxqxxxqqxxxqxqxqqxxqxqxxxqxqxqqqxxxxxxxxxqqqqqxxqxxqqqxqxxxqxqxqqxxxxqqxxxxqqxqqxqqqxqxxxxqxxxxxqxxxqqxqxxqxxxqxxqxxxxxqqqqxxxxqqqxqqxxxxxqqxqxqqxqxxqqxxqxqxxxqqxxxxqqxqxqxqqxxqqqqxxxxxqqxqxqxqqqqxxqqxxqqqxqxxqqqxxqqxxqqxqqxxqxxqxxqqqxxqxqxxxqxqqxqqqxqqqxxqqqxqxxxqxqxqqqxxxqxqqxxqxxqxxqqxqqxqxqxxqqxxxqqxxxxxqqxxqxqxxqqqqxxqxxqxxqxxxxxqqqxxxqqqxqqxqxxqqxxqqqxqqxqqqxqxqxqqxxxqxqxxqxqqxxqxqxqqqxqqqqxqxqqqqxqxxxqxqxqqqqxqxxxxqxxxqqqxqxqqxqqxxqxqqqxqxxqxxxxqxxqxxxqqqxxqxxqxxqqxqqxxxxqqqxxxxqqxxxqqxxqxxxqxqxqqxxxqxxxqqqxxqqqxqxqqxqqqqqqqxxqxqqqxxqxqqqxqxxqqxxxxxqqxxqxxqxqxxqqqxqxqqxqqqxqqxqqxqxqqxqqqqqqxxxxqqqqxxxxqqqqxqxxqqqxqqqxxxqxxxxqqqqqxqqqxqqxxqqqxxxqqxxqxxxxxxxxqxqxqxqqqqqqqqxxqqxxqqqxxqqxqxqxxxxqqqqxxqqxqqqxqqxqqxxxxqqqxxqxxqqqxqqxqxxxqxqxxxxqxxqxxxxxqqxxqqxxxxqxxqxqqqqxxxxxxxqqqqxxxxqxxqqxxxxqxxqqxxqqqxxxqxqqxxxxxqqqxqqxxqqxxqxqxqxqqqqqqxqxqqxqxqqxqxqqxqxxxqxxqqqxxqxqxqqqxqqqxxxqqxqqqxxxqxxqqqxxqxxxxxxxxqxxxxqxqqxxxqqqqqxxxqqqxqqqxqxxxqqqqqqxxqxxqxqqxqxqxqxqxqqxxqxxxxxqxqxxqxqqxxqqxqxxxxxqxxqxqxqxxxxxqxxxqxxqxxxqqxqxxqxqxxqqxxxxqqxxxqxxqxxxxxqqqqxxqxqxxxxxqxxqqxxxxxqqxxqqxxxxqqqxqqqxqqqxxqxqqxxxxqqxxqqqqqqqqxqqxqxqqqxxxqqxxxqqxqqqxqxxqqxxqxqqxqqqxxqqxxqxqxxxxqqxxxxqxxxxxxqxqqxxxxqxxqxqqxqqqqqxxxqxxxxqqxqxqqxxqqxqxqqqqxxxxxxxqqxqqqxqxqqqqxqxqqxqqqqqxqxxqqqxxqqqqqqqxxxqqqqxqxqqqxxqxxxxxxxxqqxqqqqxxqqqxxxqqqqqxqxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqxqxqxxxxxxqxxxxqqxqqxxxqqqqxqxqxqxxxxxqqxxqqxxxxxqqqxxqxqxxxxxxxqqqqqxxxxxqxxqxqqxqxqxqqxqqqqxxqqxxqqxqqqxqxxqqxxqqxxxxxxqqqxqxqqqqqqqxxxqxxqxxqqxqxqqxxxxxqxqxxxqxqxqxxqqqxxxqqqxqxqqqqxxqqxxxxqqxqxxxqxxxxqxqqqxxxxxxqqqqxqqqxxqxqqxxqxxqqqxxqqqqqxxqxqqqxqqqxqqxxxqxxxqqxxqxqxqxxxqqxxxxqxxxqqxxqqqqxxqqqxxxxxxqqqqxqxxqqqqxqqqqqqqxqxqqxxqqqqqqxxqxxqxxxxxqqqxqxqqqxqqqxqxqxqxqxqxqqqqxxxqqxqxxxqqxxxxxxqqxxxxqxxxqxqqxxqqqqxqxxqxxqqxqxxqxqxxxxqqxxqxxxxqqqxqqxxqxqxqxxqqqqxxqqqxqxxqxqxqxqqqqqqxxqxxqqqqqqxxqqqqxxxqxqxqqqqxqxxxxqxxqxxxqxxxqxqqxqqxqxqxxxxxxqqqqxxxqqxqqxqqxqxqqqqxxqxqqqxqxxqqqqxxqxqxqqxxxqxqqxxxqqqxqxxxqxqqqxqxqxqqxxqxxqqqqxxqqqqqqqxxxqqxxqxxxxxxqxqqxxqxxqxqqqqqqxqqqxqqxqqqqxxxxqxqxqxqqqxxqqqqqxxqqxxxqqxxxxxxqqxqqqxxxqqqqqqqqxqxqxxqxqxqxqqxqqxqxxxqqqqxxxxqxqxxqqxxxqxqqxqqqxqxqqxxxqxxxqxxqqxqqxqxxxxxqqqxqxqqqxxxxxxxqxqqqxxxxxqxqqxxqxqqxqxxxqqxxqqxqxqxxqxqqqxxxxqqxxqxxxxqxqxqxxqxxxxqxxxxxqxxxqxqxxxqqxqxqqqqqxqqxxxqxxqxqqqqqqqxqxqqxxqxqqqxxqqxxxxqxqqxqqqxqxxqxxxqxqqxxxqqqqxqxxxqqqxxxxxqqqxxxqqqqxqqqxqxxxxxqqqqxxxxqqqqxqxxqxqxqxqqxqqxqxqxqxxxqxqqqxqxxqxqqqqqqqxxqxqxqqqxxqqqxqqxqqxxqxxqqxqxxxqqqxxxqxxxxqxxqxqqxqxqxqqxxxqqqqxxqqqxqqxxqqqqqqxxqxxqxqxxxxxqxxxxqqxqxxxqqqqqqqxxqxqxqxqqqxqxqxqxxxxxxxxxqqqqxqqxxqqqqxxxxxxxxxqxxxqqqxqqqqxqxqxxxqxxqxxqxqxqxxqxqqqxqxqxxxxqqqqqxxqqxqxxqxqqxxxxqxqxxqxxqqqxxqqqqqxqxqxxqqqxxqxqxqxqxxxxxxxqqxqxqxxqqxxxqxqqxxqxxxqxxqqxqxqxqqqqxxxqxqqxxxxxqqqxxxxxxxqxxxqqqqqqqxxxxxxqxxxxxxxqxxqxqqqqxxqqqxxxxxxxqxqxqxqqqxxqxxxqqqqqxxqqqxxxxxqqqxxqqxxqxxxqqxxxxqxqxxqqxxqqxqxxqxxxxqxxxxxqxqxxxqxxqqqqxxqqxxqxxxxqxxqxxxxxqxxqqxqxxxxxqqxxxqxxxqxqqqqqxqqqqqqqqxqqqqqqqqxqqxxxqxxqxxxxqxxxxqqqqqxxxqxxxxxxxqxxxqqqxxxqqqqqxxxqqxxxxqxqxxqqqqxxqxxxqqqqxxqxqxxxqxxxqqxqxqqqxqxqqxqxxxxxqxxxqxqqxxxqqqxqxqxqxxqxqxxqqxqxqxxxxqqxqxqxxqxqqqqqqxxqqxxqxqxqqxxqqxqqxxqxxxqqxqxqqqqxqxxxxqxqxqqqxxqqxxxqqqqxqxxxxxxxxqxxxqxxqqqxqxqqxqxqxxxqxqxqxqxxqqxxxxxqqxxqqqxqxxqqqxxxxxxxqqqxxxqxxxxxxqxxqqqqxqqxqqqqqqxqxqqqqxxxqqqxqqqxqqxxxqqxxqqqqxqqxqxqqqqqxxxxxxqxxqxxqxqqxxqqxxqqqqxxqqxxqxqxqxqxxqxqxxxxqxqqxxxqqxqxqqxqxqxxqxqxqxxqqxqxqqxqqqxxqxxqqxxqxqxxqqqxxqxxqqxqxxqxxqqxqqxqxxxqxqxqqqxqxxxxqxqqqqxqqxqqxqqqqqxqxxxxqxqxxxqxqqxqxqqxqqqxqxqqxxqqxxxqxqxxxqxqqxxxxxqxqxxxxxqqqxxqqqqqqqxqxqqqqqxxxxxqqxxqqxxxqqqxxqxqxqqqxqqxxqxqxqxqqqqqqxxqqqxqqxqqxxqqqxxqqqqxxqqqxqxqqqqxqqxxxxqqqqqqxxxxxqxqxxqxxxqxqxxxqqxxxqxqqqxxqqqxxxqqqqxxxxqqqqqqxxxqxxxxqxxqqqqxqxxqxxqqqqqqxxqqqqxqxxxqxqqxxxxxqqqqqxxxxxqqxxqqxxqxxqqxxxqqxxqxxxqqqqxxxqqxxxqxqqxxqqqxqqxxxxxqxxqxqqxqxqxxqxqqqqqqxqxxqqxxqxqxqxqqqxxqqqxxxxxxqqxxqxqxxqxxxxqqxxxxqxxqqqqxxxqqqqxqxxqxxqxxqqqxqxqqqqxxxqqxxqxxqqxqxqqxxqxqxxqqqxxqxxqxqqxqqxqxxxxxxxxqxxqxqqxqxqqqqqxqxxxxqxqxqxxxxxqxxqxqqxxqxxxqqqqxxqxqxqqxxxqxqqqqqxqxqxqxqqxqxxqxxqqxqqqxqqxqqqxqxqqxqxqxqqxxxxqqxxqxxqqqqxqxxqqqqqxqxxxqxxxqxqqqxxxxxqxxxxxqqxxqxqxxxqxxqxqxxqqqxxqxxxqqqxxxqxqqxqxxqqxqxqxqqxxxqxxqxqxqqqxqxqqqxqqxxxxqqqqqqqxxxqxqxxqxxqxqxxqxxxxqxqxqqxxqxxqqxqxxqqqxxxxqxxqqqqxxxqqqqqqqxqqxqxxqxqxqxqqqqqqqqxxqqqxqqxqqqqxxqxxqqxqqqqxxqqxxxqqqxxqxxqqxqqxqqqqxxqqxxxqxxqqxqqqqxqqqqqqxqqxqqqqxxqqqxxxqqxxxqqqqqqqxxqxxqxxqxqqxxqxxxxxqqxqxxqqqxxqqqqqqxqqxqqxqxxqqqxxxxqqqxxqxqqqqxxxxqxxxxxqxxqqqqqxxxxqqqxxxxxqxxxqxxqqqqqqxqqxqxxxxxxqxqqqxxqxxxqxxqxxxqxqxqxxqqqqxqqqxxxxqxqqqxqxqxxxxxqxqxxxxqxxqqqxqqxxxxqxqqxxqxxqqxxxqxxqxxxqqxqqqxqqxqqxxxxxxxxqqqxqqqxqqxxxxqxxqqqqxqxqqxxqqxqxqqxxqqqxxxxxqqxxqqqqxxxqqxxxqqxxxxqqqqxqxqxxqxqqxqxxqxqxxqxqxxqqxqqqxxqxxqqxqxxqxqxqxqxxxqqxxqxxqxxqqxxxxxxxqqxqqqqqqqxqxqxqxxqqxxqqxqxxxqqqqqqxqxxqxqqxxqqqqqqqxxxqqxqxxqxxqxqxxqxxxqqqqxqqqqqqxxxxqqqxqxxqxxqqxxqxqqxxxxxqxqqqqxqxqqxqxxqxqxxxxxqxqxxxqqxxqxxqxqqxqqxxqxqxxqxxxqxxxqqxxqqqqxqqxqxqxqqqxqxxxqqxqqxxxxxxxxqxxqxxqxxxxqxxxqxxxqxqqqqqqxqqxxxqxxqqqxqxqxqxxxqxqqxxxxqxxqxqxxqxxqxqqqxxxqqxxqxqxqqxxxqqqqxxxxxxxqxxxqqqxxqxqqxxxxqqqqxqqxxxqqqxqxxxxqqqqqqxqxqqqqqxqqxxqxxqqqqxxxxxqqqxqqqqxxqxxxxqqxxxqqxqxxqqqqqxxxqqqxxxxxqxqqxxqxxxqxqqxqqxxqxqxqqxxqqqqxxxqqqxxxxqxqxqqqxqxxqqqxqxqqxxqqxxxqxxqxqxxxqxqqxxxqxxxqxxqqqxqxqxxqxxxxxxqxqxqqqqxxqxqqqxqxxqqqxqqqqxqqqxqxxqxqqqxxqqxxqxxqxxqxqxqxqqxxxqxxxxxqxqqqqqxqxqxqxxxxqqxqqxxqxqxqxxqxxqxxqqxqxqxxqxqxqxqxqqxxxqxqqxxqxxqxxqxqxqxxqqxxqxxqxxxxxqxxxxqxxqxxxxxxxxxxxxxxqxqqqxqxxqqxxxqxxxxqqqqqqqqxqxqqxxqqxxxxqxxqxxqxqqxxqxxqqqxqxqqxqxqqqxqqxqqqqqqxxxxqxqqxxqqxxqqqxqqqqqxqqxxqqxqxqxxqxqxxxxxqxqxxqxxxqqqxxxxqqqxxqxqqxxxxqxxxxxqxqqqqqxqqxqqqqqxqqxxqxxxxqqxxxxqxxxxxqqqqxqqxqxxxxqqqqqxqqxxxqqqxqxqqxqqxxqxqxxqqqxxqqqxxqqxxqxxxqxxqqxxxqxxxqqxqqqxxxxqqxqqxxxxqqxxqxxqxqqqxxqxxxxqqxqxxqqxqxqxxxxxqqxxqxqxqxxxxqqxxqxqqxqqxqqxqqqxqqqqxqqqqqqqqxqxxqxxqqqqqqqxxqxqxqqxxqxqqqxqqxqxxqxxqxxxxqqqxxqqqqxxxxxqxqqxxqqqxqxxxxxxxxxxxxxxxqxxqxxqqxqqqqxxxxxxxxxxqxqqxxxxxxqxqxxqxxqxxqqxqxxxqxqqqqxqxqxqqqqqqqxxqqqxxxxqqqqqxqxqxxqxqqxqqxxxqqqxxqxxqqqqxqxxqxxxxqqxxxxqqqqqqxxqxxqxqxxqxxxqqqxxqqqqqqqqxqqxxqqqxxqxxqxxqxqxqxqqxqqqxxxqxqxxqqqxxxqqxxxxqxqxqxqqxqqxxxqxqqqqxxxxqxxxqxxqqxqxqqxqqqxqxxxqxqxqqxxxqxxqxxqxqqqxxqqqqxqxxxxxxxqxqqxxxqxxqxxxxqxxxxxqqxxqxxxxqqqxqqqqqxxxqqqqxxxqqxxxqqqqqqxxqxqqqxxxqqqqxqxqqxxxqqxqxqqqqxxxqqqxxxqqqxqqxxqqqqqqxxxxqxxqqqqxxqqqxxxxqxxxxqqxxqxxxqxqxxqxxxxxxqxqqqqxqxqxqqqxxqxxxqqqqxqxxxqqqqqxxqqqqxqqxqqqxqxxxqxqqxxqqxxxxqxxxqqqxqqxqqxxxxxxqqqqqqxxxxxqxxqqxqqxqqqxxqqqqxqxxqxqqxqxxxxqqqqqqqqxxxqqqqxqxqxqqqqxqqqxxqxxqxqxxxxqxqqqqxqqqqqxxxqqxxxqqqxxqqqqxqqxqqxqqqxqxxxqxqqxxxxxxqqqxqxxqxxqqqqqqxxqqxxxqxxxqqxxxxxqxqxxxqxqqxxxxxxxqxqxqxxqqxqqqqqxqqqqqqqqxqxqqqxqqxqxxxqqxxqxqqxqqqxqxqqqqqqxxqqxqxxxxxxqxxxqqqxxxxxxxqqqqxqqqqxqxqxxqxqxxqqxxxxxxqqxxqxxqqxqxxqqqxqqxqqxqxqxxxxqqxqqxxqxxxxqxqxqxqxxqqqqqxxxqqxqxqqxxqxqxqqqxxqqqqqqqxqqxqxxxxqqxqxqqxqqxqxqxqqqqqqxqxqxqqxqxxxxqqxqxqxxxqqxqxqxxqqxqqxxxqxqqqqqxqqxqqxxxqxxqxqqxqqxqqqqxqqxqqxxqqqxqqxxqxxqxxxxqqqxxqxxxxxxqqxqxxxqxqxxxxxqxxqqqxqxxqqxxqqqxqxxxqxqxxxqqqxxqqxqxqxqxxxqxxxqxxxxxxxxxxqxqxqxqqqqqxqxqqxxqqxqqqxxxqxqqqxqxxxxqxxqxxqqxxxqxqxqxxqxxqxxqxqxxqqqqxxqxxxqxqqxqxxqxqxqqqqxxxqxqqxqxqxxqxxxxxqxxxxxqqqqxqxxxqxqqxqxxqxxqxxxqxxxxqqqqqxxqqqxqqxqxxqqqqqxxxxxqxqxqqxxqqxxxxxxqqxxqqqxqqxqxqqqxxxxxxqxxqxqxqxxqxqxxxqxxqqxqxxqqqxqxqxqxxxqxxxqqxxqqqxxxxxxxqqxxxxxxxxqqqxqxqxxqqqxqxxxxqqxqqxqxqxqqxxqxxqqxqxqxxxqqxqxxxqqqqqqxxxqxxxxqqxxqqqqqxqqqxqqxxqqqqqxxxqxxxxqqqqxxqxqxqqqxxxqqqqxqqqxxqxxqxqqqxxqqqqqqqqqxxxqxqxqqqqxxqqxqqqqqxxqxxxqqxqqqqxxqxqqqxxqqxxqqxxxqqxxxqxqqxqxqxxqqxxxxqqqxxqqxqxxxqxxxxxxqqxxxqxqqqqxqxxxxqqxxxqxqxxxxqxqxqqqxqqqqxxxxxqqqxqqqqqxxqqxxqqxxqxqxxxxqqxqxxqqqqxqxqqxqqxxqxqxqxxxxxqxqxxqxxxxqqxqqqxqqxqqxqxxxxqxxxqqxxxxxxxxqqqxqxxxqxxxqqqxxxqxqqxxqxqqxxqxxqxqqxqqqxxqxxqxqxqxxxxqxxxqxqqqqqqqqqxqqxxqxxxxqxxqqxqqxqqxqxxqxqqxqxxxxqxqxxxqxqqxqxqqxqxxxqqxqxqqxqqxqxxqxqxxxxxqxqxqxxqxxqxqqqqxqqqqxqqqqqqxqqqxxqqqxxqxqxxqxxqqxqqqqxxqqxxqxxxxqqxxxqqqqxxxxxxqqqqxqxqxxqxqqxxqqqqqqqqxqqxxqxqqqqxqqxxqqqxqxxxqxqqxxqxqqqxxqxxqxxqxqxxxqxqqxxxxqxqqqqqxxxqqxxqqxxxqqxxxxxqxxxxxxqqqqqxxxqqqqqxxqqqqxqxqxxqxxqqqqxxxxxqxqxxxxqxqqqqqqxxqxqqqxxxxqxqxxqxxqxxqxxxxxxqqxqqxqqqqqqqqqqxqqxxxxqqqxxqxqxqxqxxxqxxxxxqqqqqqqxxqxqqxxqqqqxqxqxqqxqqxqxxqxqxxxqxxxxqxxqxqxqxqqqxxqqxxqxxqxxxqqqqqxxqxqqqqxqqxqxxqqqqxxxqqqxxqxxxxqqxqqqxxxxxxqxxxxxqqxxqqxqxxxxqxxxqqxxxxxqqxxxxxxqqqxqxxxqqxqqxxqqxxxqxqqxqqqqxxxqqxqxqqxxqxqxqxxqqqqxxxxxqxxxqxqxqxqqxqxxxxxqqxqxxqqqxxqxqxqxxqqxxqxqqxxxxqxxqqqxxqqxqxxxqqqqqxxxqqqxqxxxqxqxqxqqxxqxxqxxxxxqxqqqxqqxqxqxqqxxxqqqqqxxqxxqxqqqxxqqqqqxqxxqqxqxqxxxqqqxxxxqxxqxxqxxqxqqqqqxqxxqxxqqxxxqxqxxqxxxxqxqqxqqxxqqqxxxqqxxqxqxqxqxxxxqxqqqqqqxqqxxxxxxxxqxxxqqqqqqxxxxqqqxxqxqxxxxqxxxxxxqxqxxxxqqxqqqxxxxxxqqxqxxxqqqxqxqqqqxxxxqqqxqqxxxqxxxqqqxxqxqxqxxqxqqqxqqqxxqxqxqxxqxqqxqqxqqqxxxxqqqxxqxxxxqxqqqxxqxxxqqqxxqxxqqxqxxqxqqqqqqxxqxqqqqxxxxxqqxqqxxqxqxqqxxqqqxxxqqqxqxqqqqxqqxxqqqxxxqqxxqxqxqxxqqqqqxxxqqqqqqqqxqqxxxqqqqxqqxqxqxxxxxqqqqxxqxqxxxqqxqqxxxxqqqxxxxqqqqxqqxqxxxqxqxqqxqxxxqqxxqqqqxqqxqxqxqqqqxqqqxqqxqqxqqqqxqxxxqqqxqxqxqxxxxxxxqqqqqxxqqxxxqxqqqxqqqxqqxxqqxqxxxxqxqqqqxqxqqxqqxxxqqxqxqxqxxxqqqxxqqqqqqxqqxxqqqxqqxqxxxqqxqqqxxqqxxxxxqxqxxxqqqxxxqxqxqxqxxxqqqqxqqxqqxxqqqqqqxxqqxqqqqqqxqxxqqxqqxqqxxxxqqxqxxqxqqqxxqxxqqxxxqxqqxqxqxxqxxqxqxxxqqxxxqqxqxxqxqxqxxxxqxqqxxxqxqqxxqxxqxqxxxqxqxxqxxqqqqxqxxxxqqxxxqqxxxqqxxxqqqqqqxxqqxqxqqxxqxxqxqqqqqqxqqqqxxxxxqxxqqxxqqxqqqxxxxxxxxxxqxxqqqqqqqxqxxxxxxxqqqxqxqqqxxxxqqqqxxxxqxxxxxxxqqqxqxxxqxxxxqqqqxqqxxqqqxxqqqxxqxxxxxqqxqqqxqqqxqqxxxqqqqqqqqxqxxqqqxxqqqqqqxxxxqqqxxqqqqxqxxqxxxxxxqqqxqqqqxxqqqxxxqxqqqqqxxqqxxxqqqqqxqqxxqxxqqqqxxxqxqxqxqqqxxxqqxxxxqqxxxxxxxxqqqqxqxxxqxxxqqxxqqxqxxxqqqxxxxqqxxxqqqqqqqqxxxxxqqxxqqqxqxqxxqxqqqqxxxqxxqqqqqqxqxqqqxxqqxxxxxxqqqqqxqxqqqqqxxxqxxqqxxxqqxqqxxxxqqxqxxxqxqxxxxqxqxxxqqqqqxqxqxxqqqqqxxqqxqxqxxxqxqqxqqqqxxqqxxqxqxqqqxxqxxqxxxxxxqqqxqxqqqxxqxxqxqqqxxqxxqxqxxxqqxxqxxxqxxqxqxqqxxxxqqqxxxxqqqxqqqxxqxqxxqqqqqxqqqqqxxqqqqqqxqxqqqqqqqxqqqxqqxqqqxxxxqqxxxqqqqqqxxqxxxqqqxqxqqqqxxxqqxqxqxqxxxxxxxxxqxxxxxxxqqqxxxxqqxxqxxxxxqqqqxxqxqxxxxxqxxqxxxxqxqqqxqxqxqxqxxxqqqxxqqqxqxxxxqxqxqxxqqqxxqxqxqqxqqxxxxqxxqqqqxqqqxqxxxxxxxxxqxqxqxxqqxqqxqxqqqqxxxqqxqqxqxxxqqqqqqqxxxxqqxqxxxxqqqxxxxqqxqxxqxqxqqxqxqqqqqxxxqxxqxxqqxqxqxqxxxqqxqqxxqxqxxxqqqqqqqqxxxqxxxxqxxxqqxqqxqqxxqxqqqqqqqqxxxqqxqqqqxqxxxxqqqxqqqxxqqqqqqxxqxxxxqxxxxxxxxxqqqxxxqqqqxqqxqqxqqqqxqxxxqqqqxqxxxxqqqxqxxxqxqqxqqxxxqxqqxqqqxqxxqxqqxqxqqqxqqxqqxqxqxxqqqqxqqxqqxqqxxxxxqxqqxxxxxqxxqxqqxqqxxqxqxqqxqqxqxqxxqxqqqqxqxqqxxqxxqxqqqxqqqqqxxxqxxxxxqqqxqxqxxxxqxqqqqxxqxqqxxxqxxqxqqqqxqqxqxqqqxqxqqqxxxqxxxxqxxxxqxxxxqxqqxxqxxqqxxqqqxxqxqqqqxqxqxxxxqxxxqxxxxqqqxqqxxqqqqqqxxxqqqxqxqxxxxqxxxxqxqqxxxxxxxxxqqxqqxqqqxxxqqqqxqxxxqqxqqqxqxqqxqqxxqqqqqxxxxqxxxqqqxxxqxxxxqxxxxqqqqxqqxqxxxxqqqxxqxqqqqxxxqxxxxxqxqxqxqxxqxxqxxxxxxxqxqxqqqxqxqxxqqqxxqqqxxqqqxqxxxxxqxxxqqxqxqqxqqqqqxxxqxxqxxqxqxxqxxqqxxxqxqxxxxxxxxxqxqxqxxxxxqxxqqxxxxxxqqxqxxqxxqxqxxqqxxxqqxxxxqqxqqqxxxqxqqqqxqxxxqqxxqqqxqxxxxxxxqxqxqqxqqxqqxxxxxxqqxxqxxqxxqqxqxqxqxqxxxxqxqqqxxxxqqqxxxxxxxqxqxqxqqqqqxxxxqxqqxqxxqxqxxqqqqqqxxqqqxxqqxqqqxqxxxxxqxxqqxqqxqqxxxqqqxqqxxqqqxxqqxqxqxxqqqxqqqxqqqqqxxxqxqxqqxxxxqxxxxxqxqxxxqqxqqxxqxqqxxqxxqxqxxxxxqqxqxxqqxxxxxxxxqqxxqxxxqxqxqxqqqqqqqqqqxqxqxqqqxxqqxxxqxxqxxxxqxxxqqxqqqxxxqqxxqxxxxxxxqqqxxxqxqqqqqqxqqxxxqxxxxqqqqxxxxxxqxqqqqqqqxxxxxxqxqxqxxqqxxxqqxqqxxxqxxxxqqqqxxxxxqxqqqxqxxqxqxxxqxqqqxxxxqqxqxqqxqxqqqqqxxxqqxxqxqxqqxqqqxqqqxxxxxqxxxqxxqqqxxxxxxxqqqqqxqqqxxqxqqxxqxxxxxxxxqxxxqxxqqxxxxxqxqxqxxqqxqxqqxxxqxxxxxxqqxqqqqxqxxqxqxxxxxxxqqxqxqqxxxxxxxxxqqqqxqqxqxxxxqxxqqxqxxxqqxqxqqqxqqqxqqqqqxqqxqqqxqxxqxqqxxxxxqqxxqxqqqxqqxqqxxxqqqqqqqxxqxqxxxqxqxxxxxxxqxxqqqqqqxxxqxxxxqqxqqqxxxxqxqqxqqxxqqxxqqqqxxxqxxxqqqxqqqxqqqxqxxqxxqxqxxxqxxxqxqxqqxxqxxxxqxqqqqxqxxqqxqxqqqxqxxxxxqqxxxqxqqqqqqqxqqqqqqqqxxqqqxqxxxxxxqxqqxxxxqqxqxxxxxqxqxxxqxqqqqxqxqqqqxxxxqqqqxxxqxxxqqqxxxxqxqqqxxqxxqqqxqqqqxqxqqxqqqxqqxqqxqqqqxqqqqqxxqqqxxxxqqqxqqxxqqqqxqxqxqqqxqxxqxqxqxxxqxxxqxxxxxxxqqxxqxqxxxqqqqxxxqqqqqxxxxxxxqxxxxqqqqqxxqxqxxqqqqqxxxqqqqxxxxqqxqxxqxxxxxxqxxxxqxqqqxqxxxqxqxqqqxqqxxqxxqqxqxxxxxqxxxqxqqxxqxxxxqxqqxxqxxqxqxxqxqxxqxxqqqqqxxqxqqxxqxxxqxxqqxxqqqqxqxxxqqxxqxxxxqxxxxqqxxxxqxxxqqxxqqqqqqxqqqqxxqxqqqqxqxqqxqqxxqqxqxxxqqxqxxqqxqqqxxxxqqxqqxqqqxqqqqqxxxxxxqqqxxqxqqxxqqqqxqxqxxxxxxqxqqxxxxqxxqxqqqqxqxqqqqxqxxxqxqqxxxqqqxqxqxqxqxxxqqxqxqqxxqqqqqqqqqxqqxxqxxqxqxqxqqxxxqqxxxqxqqqqqqqxxxqqqqqxxxxqxqqqxqqqxxxxxxxxqqxqqxxqqqxxxqxxqqqxxqqxqxqxxxqxqqxxqqqqxqqxqxxxxqxqqxxxxxqqxqxqqqxxxqqxxxqqqxxqxqqqxqqqqqxqqxqqxxxqxqqqxxxqxxqqqxxqqxxqxxxxqqqqqxxqqxqxqqqxxqqqqqxqxxqqqqxxxqqqxqqxqxqqxxxxxqxqxxqqqqqxqxxqqqqqqqxxxqxxxxqqxqxxxxqxqqxxqxqqxqqxqxqqxxqxxqqqxqqqqqxqqxxxxqxqxqxqqxqxxxxxqqqqqqqxxqxxqxqxxqqqxxqxqxxqqqxxqqqqxxqqqqqqxqqxqxxqxxxxqqxxqqqqqxxxqqqqqxxqqxxqxxxxxqqqxqxxqqqxqxxqqxxqxqqqxqqxqqqqqqqqqxqxqxqqqqqxxxxqxxqqqqxqqxxxxxxqxqqxqxxxxqxqxqqqqqxqqxxxqqxqqxqxqqxqxqxqqxxqqqxxqxxxxxxxqqxqxxqqqxqxqxqqxxxxqqxxxxqxxqxxqxqqxqqqxxqqxxxqqqqxxxxxqxqxqqxxqxxqqqxqqxxxqqxqqxxqqxxqxxxqqxxxxqxqqxqxqxxqqqxxqxxqxqxxqqqqxqqqqqqxxqqxxqxqqxqqqqqxqqxxqqxxqxxxqxqqxxxxxxqqqxxxxxxqqxqxqxxqxxxqxqqxqxxxxqqqqqxqxqqxqxxqqxqqxqqxxxqxxxxxqxxxxqqxqxxxqxqqxqqqqqqxxxxqxxqqxxqxqqxxxxxxxxqxqqxxqxqxxxqqqxqxxxqqxxqxxxxxxxxqxqxqxxqxqxxqqqxqxxxqqxxxqxxxqqxxqqqqxqxxxxqxqqqqqxxxqqxqqxqqqxqxxqxxqxxqqxqxqxqxqqxxqxxxxqqqxqqxxxqxxqqxxqxqxxxxxqqxqxxqxxxxxxxxxqqxqqqqxxqqqqxqqqqxqqxxqqqxxxqxxxxqqxxxqxqxxqxqqxxxxqqqxxqqxxxqqxxqqxxxqqqxqqxxxxqqqqxqqxqqxxqxxqqxqqxxxqxxqqqqxqqxxxqqxxxqqqqqqqqqqqxxxqqxqxxxxqxqqxxxxxqqxqqxxxxqqxqxqqqxqqqqqxxqqqxxxxqxqxqxqxqxxqxqxxxqqxxqqxxqqxxqxqxqqqxqqqxxqxqxqxxxxqxqxqqqqxxxxxqxxqqqqxxxxxxqqqxqxqxqqxqqqqqqqqxqxqqxqqqxxqxxqqxxxxxxqxxqxqqqxxqqxxqxxxqqxqqxqxqxqqxxxqqxqqxxqxqxqqxqxxxxxxqxqxxxxqqqxqqqxxqxqxqxxqxxqxxqxxxxxxqxxqxxxqxxqxqqxxqqqxxxqxqxqqxxxxxxxxqxqqxxqqxqxqxqxqxqxqxxqxqqqqxqqqxxqxxqqxxxxqxxqxqqxqqxxqxxqxqxqqxqxqqqqxxqqxqqqqqqxxqxxxqqxqxqxxqxqxqxxqqxqqxxqqxqxxxxqxqxxxxqqxxxqqxxxqqxxqxxqqqxqqxqqxqxxqxxqxxqxqqqqqxqxxxxxqqqqqqxqxqxxqqxxxxxxqqxxxqqqxqxxxqxxqqqqqqxqqxxxqqqxqxqxxqxqxxxqxqqxqxxxxqxxxxqxxxxxqxxqqqxqqxqxqqqqqqxxqxqqxqqxqxxqxxxqxxqqqqqxxqqqxxxqxqxxqqxqxqxxqqxqxqxqxxxxxxqqqxxqqqqxxqqxxqxqxqxxqqqxqqxxqqqqxqxxqxxqqqqqqqqxqxqxqxqqqxqxqxqqxqqxqxxxqxqxqxqxqqxqqqxxqxqxxxxxqxxxqxxxxqxxxxxxxqqxxxxqxxqqxqqqqxqxxxxxxxqxxqxxqxxxxqqqqxqxqqqxxqxqqqxqqqqxqxqxqxqqqqqqqqxqxxxxxxxxxqqxqqxxxxqqqxqqxqxqxqqxqxxxqqqqqqxxxxqqqqqxxqqqxqqxqxxxxqxxxqxxxxqqqqxqqqqqqqqxqqxxxqqxxxxxqxxqxqxqxqqxqqqxqxxxqxxqqqqxxqqxxxqqxqxqxqqxqqxxxqxqqqxxqqxqxxxqxqqqxqxqxxqqqxqxxqqqxxxxqqxxxxqxxqqqqqxxxqqqxqxxxxqxxqxqqqqxqxxqxxxxxxqqxqqqqxxxqxxxqqxqqqqxxxxqqqqqqqqxxxxxxqqqqxxqxqqqxxxqqqxqxxqxxxxqqxqxqqqxxqxxxqxxqqqqqxxxxxqqqqqxxxxqxqqqqqxxqxqqxxxqxqxqxqxqqqqxxxxxxqxxxxqqqxqxqqxqxxqqqqxxqxxxqqqqxqqxxqqqqqqqqqxqxqqxqxqxqxxqqxqqqxqxxqxqxxqxqqxxqqqqqxxqxqxqqqqqqqqxxxqxxxqxqqxqxqxxqqxqqqqxqxxqxxxxxxqxqqqxqxxxxqqxxxqxxxqqxxxqqqxqqxqxxqxxxxqxxxqqxqqqqqxxxxqxxqxxxqqxqqqxqqxqqxqqqqqxxxqxqxxqxxxqqqqxqxxqxxxqqqxxxxxxxxqxqxxxxqxxxxqqqxxxqxqxqxxxxxxqxxxxxxxqxqqxxqxxqqxqqxqxqxqqxqqqxxxxxqqqxxxxxqqqqqxxqxqqqxxxxqxxqxxqxxxxqxqxxxxxxxxxqxqxxxqqxxxxqxqqxxxqqqqxxxxxqxxxxxxqqxqqxqqqxqqxqqqqqqxqqxxxxqqxxqqxxxqxqxqxxxxxxqxqxxxqqqqxqxxqqxxxxqqxxxqqqxqqqqqxqxqqxqxxqxqqxqqxqxqxqqqqqqqqxqxqqxqxxxxqqqqxxxxxqqxqqqxqqqxqqxxqqqxxqqqxqxqqqxxqqqqxxxqqqqxqqqxxxqqqqqxqqqqqqxxqxxxqxxxqxqxxqxxxxxxxqxqxxxqqqxqxxxqxxqqqxxqqxqxxqqqxxxqxqxxxxqqxqqqqqxqxqqqxxqqqxqqqxxxxxxxqxqxqqqxqxqqqqxxqqqxqqxqqqqxxqxqqqxqqxxxqqqqxxqqqxqqxqxqxxqqxqxqxxqxqxqqqxxqxxxqxqqxqqxxxqxqqqqxqxqxqxxqxqxxxxxxxqqxxqxxqqqxxqxxxxqxqxqxqqqqxxxxqxxxxqqqqqqqqqqxqqqxxxqqxqqxxqxxqxqxxxxxqqxxxxxxqxqxqqqqqqxqxqqqxqqqxxqxxqxqxqxqqxqxxxqxxxqqqxxqqqxqxqxxxxxqxxxqqqxqxqxxxxxqxxqxxxxxqqxqqqqqxqxxqxqxqxqxxqxqxqxqxqxqxxxxxxqqxqqxxqxxqxxxxxqqqqxqxxxqqxxxxqxxqqqqqxqqxxqqqxqxqqqxxxqxxxxqqqqqxqxqxxqqxxxxqxxqqqqxxxxxxxqxqqqxqqqqxxqqqqxqxxxxqxxxqxqqqqxqqqxqqxqqqxqqxqxxxxqqxxxqqxxqqxqxxqxxxqxxqxxxqxxxqxxqxqqxqxxxxqxxxxxxxxxxqqxqxqqxqqqxqqxxxqxqxxxxqxqxxqxqxxqxxqqxqxqqqxqxqxxxqxxxxxqxqqqqxqxqxqxxqqxqxxqqqxxqxxxqxqxqqqqxqxxxxqxxxqxqxxqqqqxqxxxqqxqqxqxxqxxxqqqqxxqxxxqxxqqqqxqxqxqxqqxxxxxxqqqxqxqqxqqqxqxqqxqxqxxxqxqxxxxqxxqxqqxqqqxqqqxqqqxqxqxqxqqqxxxqqqqqxqqxxxxxxxqxqxxqxqxqxxqqxqqxqxqqxxxxqqqxqxqqxxqqqxqqxqqxxxxqqqxqxqxxxqqxqqqxqqqqxqqqqqqxqqqxqqqqxxqqqqxqqqqqxqqqqqxqqqxqxxxxqqxxqqqqqqxqqxxqqqxxqxqxxqqqqxxxqqxqqqxxqqxxqxqqqqxqqxqqqqxqxxxxxxqxxqxqqqxqqxxqqxqxqxxxqxqqxxxxqxqqqqqqxxqqxxqxqqxxqxxxxqqxxqqxxqxqqxxxqqxxqqqxqxxqxqxxxxqqxqqqxxxqqxqxxxqqqxqqxqqqqxqxqqqxqxxxqxqqqqqxqxxxxqqxxqqqxqqxqqqqqqqxqqxqqqxqxxqqxxqxxxqxqxxxxqxxxqqqqqqxqxxqxxqqxqxqqxqqqxqqxqqxqxqqxxxxxxqxxxqqxqxqxqxqqxqxxqxxqxqqqxxxqxqqxxqqqqqxxqqqqxxqqxqxxxqqxqxqxxxxqqxqxxqxxxxxqxxqqqqqxqqxqxxxxxqxxxqxqxxqqqqxxqxxxxqxqqxqxqqxxqxxqqxqxqxxqxqxqxqxqqqqqxqxxxxxxxxxxqqxxxxqxxqxxqqqqqxxxqxqxxqqxqqxxqqqqqxxqxqxqxxqxqxqqqqxxxxqxqqqqqxqqqqxqxqqqxqxqqqqxxqxqxqxqxxxqqxqxxxxxxxxqqqqxqxqqxqxqxqqxxxqxqqqxxqxxqqqqqxxqxxqqqqqxqqxqqqxxxqqqqxxxxxqqxxxqqqxqqxqqxqxqqxxqqxxxqxqxqqxxxxqqxqqqxxxqqxxxxqxxxqqqxxxqxqxqqqqqqqxqxqqqqxxxqqxqxxxqqxqxqqqxxqqqqxqxxqxxxqxqxxxqxxqqxxxqqqqqxxxxqqxqqxxqxqqqqxqxxxqqxqxxqqxqqqqqqqxxqxxqxxxxqqxxxxqqxqxxxxqqqqxxqqxxqxxxqxqqqqqqxxqxxxxxxxxqqxqqxxqqqxxqxxxxqxxqqqqxxxqxqxqqxxxqqxqqqxxxqxxxxqxxxqxqxqqxxqqxxxxqxxxqxqqqxxqqxxxqqxqqqqxqqxqqqqxqqxqxqxxqqqqqqxxxqxxxxqqqqxqxxqxqqxxxxqqqqxxxqqxxqqqxqqqxqxxqqxqxxqxqqxqqqqxxxqqxqqqxqxxxqqxqqqqqqxqqqxqxqqqqxxqxqqqxqqxqqqqxqqxxqqqxqxqxqxxxxxqxqqqqqxxqxxxqqxxqxxxxqxqqxxxqxqxxxxqxqqqqxqxqqxqqxxxxqqxqqqqxxxqqqqxqxqxxxqxxxxqqxxqxxqxxxqqxqqqxxxqxxqxxqxqxqqqqqxxxqxxxxxqxxqqqxqxxqqxqxxxxxqqqqxqqxxqxqqqxqxxqqxqqqqqxxxxqqxxxxqqxqqxxqxxqqxxqqxqxxxqqxqqqqqxqqxxqqqxxqxqxqqqqxxqxxxqqqqxxxqqxqqxxqqxqxqxqxqxqxqqxxqqqqxqxqxqqxqqxqqxxxqqxqxxxqqqqxqqqxqxqqxxqxxqxxqqqqqqqqqqxxxxxqxxqqxxqqxxqxxxxxxxqqxqqxxqqqqqxxxqxxxxxxqxqqxqxqqqxxqqqqxqqqxxqqxxqxxxqqqxxxqxqxxxxxxqqxqxxxxqqxxqxxxqqqxxxxqxxxqxqxqqxxqxxxqqqqqqqxxqxxqqqxxqqqqqqxxxqqxqxqxqqqxqqxqxxxqxxqqqqqqxxxxqxqxxxqxqxqqqxqxqxxxqxqqxxqqxqqxqqqqxqxxqqqxxqqqqqqxqqxxxxxxxxxxxxxxqqqqxxxxxqxxqqqxqqqxqxxxqqqqxxqqqxxxqqqxqqxxqxxqqqqxxqqqxqxqxxxqqxxqxxxxxxqxqqqqqxxqqxxqqqxxxxqxqqqqqxqxxqqxqqxxqxxxqxxxqqxxqqxxxqqqqxqqqqqxxxxqxqxxqxqxqxxqxqxqqqxqqqxqqxqqqxxqqxqxqqqxqxqqqxxqxqxqqqxxqxxqxxxxxxqqqqxxqqqqxxxxqxqxxxqxxxqqxqxxxqxqqqxxxqxqxqqqqqxxxqqqqxxxqqqxqqqqxqqqxxqqxqqxqxqqqxxqqqqqqxxqqqqqqqqxqxqxxqxxqqqqxxqqqxqqqqqqxxxqxxqqqxqqxqqqqxxxxxxqxqqqxqxxxxxxxqxxxxqxqxqqxxxxqxxxxxqxxxxqqqxqxxxxxxqxqxqxqxqxqxxqxxqxqxxqxxqxxqxxxqqxqqqxxxqxqqxxxxqqqxxxqxqqxqxxxxxqxqqqqqxqxqxqxxxxxxxxxxxqxqxqqqqxqxqxqxqxxxxqqxqxxqqxxqqqqqqqxqxxqxxqqqxqqxqqxqqqxxqqxxqqxxxxqxqqqxqqqxqxxqxqqxxqxqxqxxxqqxqxxxqxxxxxqqqqxqqqxqxqxxxxqqxxqqxqxxqqxxxxxqqqqqqxxxxxqxqqxqxqqxxqqqqqqqqqqqqqqqqxxxxxxxqqqqqxqxxqqxxxxxqqxxxxqxqqxqqqqxqxxxqxqxxqxqxxqqqxqxqxxqqqxqxxqxxxqxxqqqxqxxqxqqxqqqxqxxxxqxqqxqxxqxqqxxqxqqxqqqqxxxqxqqxxxxxqxxqqqxqqqxxqxqxxqqxxqqxqxqqxqqxqxqxqqxxxxqqxqqqqqqqqqqxqxxqqqxqqqxxxxqxxxxxxqqqxxqxqxxxqqxxqxxqqxxqqxxxqxqxqqxxqqxxxxxxqqqxxxqxxqxqqqqqxxxxqqxxqxqxxqqqqqqxqxqxqxxqxqxqxxxxqqqqqqxxqqqxqxxxxqqqxqxqxxxxqqxxxxxxqqxqxxxqxxqqxqqxqqqxxxxqqqxqxxxqxxxqqxqxqqxxxxxqqqxqqxxqxxxxqqxxxxqxqxxqxxxqxxqqqqqxqxxxxxqqqqxxqqxxxqxqxxxxxqxqqxxqxxqxqqxqxxxxqqxqxqxqxqxqqqqqqxxqqqxxqqqxxxxxxxqqqxxqxqxqqqqqxqxqqxqqqqqxxxqxxqxqqqxxxqqqxqqxxxxqxqxqxqxxxxxqxqqqxqxqqxqqxqqqxxxqxqxxxxxqxqqxxxqqqxqxqxqxqxqxqqqxxqxqxxxqqxqqxxxxxxxqxqxqqqxqqqxxqqxqxqqxxqxqqxxqxxqxxxqxqxxxxxqxqqxxxqqqqxxxxxqxqqqxqxqqxqxxxxxqxqqxqxxqqxxxqqqxqqqxqqqqxqqxqqxqqxxxxxxxxqqxqxxqxxqxqqqxqqxqqxxxqqqqqxqxxqxqqqqqxqqqqqxxxqxqxqxxxxxqxxqxxxxxqxxxqxqxxxqqqqxxqxxqxxxxxqqqqxxqqxxxxxxqqxxqqxqqqxqqxqxqxqqxqqqxqxqqqxqxxqqxqqqxxxqxqqxxxxqxxxqqxxqxqxqqqqqqqxxxxxqqqxxxxxxxxqqqqxqqxxxqxxqxqxqxxqxqxxqxqqqqqqqqxxxxxqxqxxqxxqxxqqxxqqxxxqxqqqqqxqqxqxxqxqqxxqxxqxqxqxqxqqqqqqxqqxxxqqxxqxqxqqxqxqxxxqqqqqqqqqqxqxqxxxqxqxxxqxxqqqxxxqxxxxqqqxxqqqxqqxqqxqqxxxxqxqqqxxxqxxqxxxxxxqxqxxxqqqqqxqqxxqqxqxxxxqxqqqqxqqxxxxxxxqxxxqxqxqxqqxqxqqxxxqqqxqxxqxqxxxxqqxqqxqxxxqqxqxqqxxxqqxqqxqqxxxxqqxxqxxqxqxxxxxxqqxxqxqxqxxqxxqxqxxxxqqqxqqqxqxxqqxqxxxqqxqqqxxqqqxxxxxqxxxqqqxqqqxxxxqxqqxxqxxxqxxxqqxxxxqxxxqqqxqqqxqqqxxxxqqqxxqxxxqxqxqxqxxxxxxxqqqqxqxxxxxxxxxxqxqqxqqxxqqxqqqxxqqqqqxqqqqqqxqqqxqxqqqqxqxqxqxxxxqqxqxxqqxqqxxxqxxxxxxqxxqxqxxxxxxxxqqxqqxqxqxxqxxqxqxxxqqqqxqqxqxxqqqxqqxxxqxqqqqqqqqqxxqxqxqqxqxqqqqxxqxxxxxqxxqqxxqqqqqxqxxxqqqqxxxqxxxqxxxqxqxxxxxxxqxxqxxxxqxxxqxxqxqxqqqxqxxxxxxxqqqxxqqqqqxxqxqqqqxqxqxxqxxqqqxxxqxxqxxqxxxxxxqxxqqqqqqqxqxxxqxqxqqqxqqqxqqxqxxqxxxqxxqxxxxxxxqxxxxxxqqqxxqqxxxqxxxqqxxqxxqqqqqxxqxqqxqqxxxqxxqqxxxqqqxqxxxqqqxxxxxqqxqxqxqxxxxqqxxxqxxqqqqqqxxqqqxxqxqqqxxxxqxxqqxxqqqqxxqxxxqqxqqxxqxxxxxqqxqqxxqqxqqqqxxxxxqxqqxxxqxxqxxqxqqxxqxqqqxxxqxqqqqqxqqqqxqqqqxqxqqqqxqxxqqqxqxxxqqqxqxqxxqqqxxqxqxqqxxxqqqxxqqqqxqxxxqxxqxxqqqxqqxxqqxxqxqqxxxqqqxqxqqqqqxxqqxxqqqxqqxxxxxqxxqqqqqxxxqqqqxqqxqqqqxqxxxqxxqxxqxqqxxqqxqqqqxxxxxxqxxqxxxxqqqxqxqqqxxqxqxxxqqqqqxxxqqxqqqqqxxqxqqxxxxqqqqqqxxxxqqxxxqqqxxxxxqqxqqqqqxqxqxqqqqxqxqxqxqxxqqxqxxxqqqxxqxqxxqxqxxxqqxxxxqxxqxqxqqqqqxqqxxxxxqqxxxxqxxxxxxqxqxqxqqqqqxqqqqqxqxxxqqqqqqqxxqqxqxxxxqxqxqqqqxxxxxqxqqqxqxxxxxxxqxxxqqxxqxqqxqqqxqqxqxxxqxqxqqxqqxqxxqxqxxqqxqqxxqqxxxqqqqqxxqqxxqxxxxxxqqxxxxqqqxqqqqqxxqqqqqxqqxqqxqqqqqqxqxqxxqqxqxqxxqqxqqqqqqqxxxxqqxxqqqqxxxxqqqqqqqqqqqqqxxqqxxqxqxqqxqxxqxqxxqqqqxqqqxqqxxqqqqxxqqqxqxqxxqxxxqqxxqxxqqqqxxqqqqxqxxqxqqxxqqxxxqxxxxqxqxqqxxxqqqxqqqqxxxqqxxqxxqqqxqxxxqqxqxqqxxxxxxqqxqqxxxqxxqxxxqxqqqxqqqxxqxxqqxxqxqqqxqqqqxxqqxqxxqqxxxqxqqqxqxqxqqqxxxxxxqqxqqqqxqxxxqxqqxqxxxxqqqqxxqqqqqqxxqxxxqxxqxxqxxqxqqqxxxxxqqqxqxqxqqxqxxxxqxxxxxxxqqqxqqqxxxqxxxxxqxqqxqxxqxqxqqqxqxqxqxxxqxxxxxqxqqxqxxxxqxqxxxqqxqqxxqqqxqxxxxxqqqqqqqqqxxxxqxqxqqqxxxqxxqxxqqqxqxqxxqqxqqqqqqxqqqxqxxqqxxxqxxxqqxxxqxxqxxxxqxxxxqqxqxqxxqxxxqxqxxxqqqxqqqxqqqqqxqxqqxxxqxqqxxxxqxqxqqqqqxxxqxxqxqqxxqxxqxxqqqxxxqqxqxqqxxxqxxxqqxqxqqqxxqqxqqqxxxxxqxqqxxxqxxqxqqxxqxxxqxxxqqqqqqqxqqqqqxxqxxqxxxqxxxxqqxxxqxxxqxxxxqxxqxqqqxqqqqqxxqqxxxxqqxqqxxqxqxxqxqxxxqqxqqxqxqqqxqxqxqqxxxqqxxqxqxxqxxxqxqxqqqqxxxqxqxqqqxqxxxqxxqqxxqqqxqxqqqxxqqqqxqqqxxqqxqxxxqqqqxxqxxqxxxxqqqxqxqqqqqxqxqxxxxqqqxqqxxqqqxqxxqqxqqqqxqqxxxxxxxqxxxqqqqxqqqxxqqqxqqxqxxxxxqxxxxxxqxqxxqxqxxxqqqxxqqqxxxqqqqqqxqqqxqqxqxqxxxqqqqxqxqxqxqxqxxxxqqxqxqqxxxqxxxqqxxqqqxqxqqxxqxqqxxqxxxxqxxxqqxqxqqqxqqqxxqxqqxxqxqqqxqxxxxqxqxxxqxxxqqqqxxxxqqqxqqxxxqqxxxqxxxxqxxqqxxqqxxqqqqqxqxxxqxqxxqxqqqqxqxxqxxxqqqxqqxqqqxqxqxxqqxxqqxxxxxqxxxqxqxqqqqqqqxqxqqxqxqxqxqxqqxqqxxqxqqxqxxxxxqxxxqxxqqqqxqxqqxqqxqqqqqqxqxqqxqqxqxqqxxqxxxqqqqqxqxxqxqqxxxxxxxxqqqqxxxxqqxxxqxqqxqxxxqqqxxqxqqxxqxxxqxqxqqxxqqxxqxxxqqqqxxxqxqxqxqqxxqqqxqqqxqqqqqxxxxxxxqxqxxxqxqxxxxxqqxqqqqxqxqxxxqxxxxxxxxxqqqxxqqxqqqqxxqxqxqqxxxqxxqqxxxqqxqxqqxxqxxxxqqqqxxxqxqqxqxqqqqqqqqxqxqqqxxxqqqqqqxqxxqxxxxxxxqxxqxxxxqqxxqxxqxqxxqqqxxxqqxqqqxxxqqqxqqxqqqxxqqxqxxxxqxxxqxxqxqqqqxxqqqqxqqxqxqxxxqxxxqxqqxxxxqqqqqqqqqqqxxqqxxqqqqqxqqqqqqqxqxqxxqxqxxxqqqxqqxqqqqqxqxqxqxqqqxqxqqxqxqxxqxqxxxxqqqxqxqxxqqxqxxxxxqqxqxxxxqxxxxxqqqqqxqxqxxxxxqqxqxxqxxxqxxxqqqxqqqxxqxqqqxqqqqxqxxxxxqqqxxxxqqxxxxqqqxqxxxxxxxqqxqxqqqxxqxxxqxxqqqqqxxqqxxqxqqqqxxqqqxqqqxxqxxqxxqqqqxqxxxqqqqqxqxxqqxxqxqqqxqxxxxqqxqqqxqqqqxqqqqxqqqxxqxxqqqqqqxxqqxxqxqqxqxqqxqqqxxxxqqqxqqxqqxxqqqqqxqqxqxqqqxqqqqxxxxxxxqxqqxqxqxxqqxqqqqxqxxqxxxxxxqxqxxxxxqqqqxxxxxxxxqqxxqxqqxqqxqxxqxxxqxxxxqxxqqqqqxqqxxxqqxxxqqxxxqqqxqxqqxxqqqxqqqxxxqqxqxqqqqxqxqqxqxxqxxxqqxxxxqxqxxxxqqxxxxqqqxxxxqxqqxxxqxxxxqxqqxqxqqxxqxxqxxqqxqxqxqqxqqxxxxxxxxqxxxxxqqqxqxqqxqqxxxxxqxxqxqqxqxqqqqxxxqxxxxxqxxxxxxqxxxxxqqxqxxqxxqxxxxxqxqxxxxqqxqqxqqqqxxqqqqqqqqqqxxxxxqxxqqqxqqqqxqxxqxxxqxxxqqxxqxxxxxqqxxxxqqqxxqxqxxqqqqqxqqqqqxxqxxxqqqxqxqqqxxqqqqqxxxxqqqxxxxqqqqqxqqqqqxqqxxqqqqqxxxqqqxxxqqxqxqxxxqqxqqxqxqqqqxxqqxqxxqxqqxqxqqqqxqxxqxqxxxqxqqxxxxxxxxxxxqqxxqqxxqqqqqxqqxxqxqqxqqxqqqxxxqxqxxqxqqxxqqxqxqxxqxxxqqqxqqqxxqxxxqqqxxqqqqqxqqqqxxqqqxqxxqxqqqxxxxqxqqqxxqqqqqqxqxqxqqxqxqqxqqqqqqxqxxqxqqxxqqxxqqqqqqqqxxxxxqqqqxqxqxqxxxxqqxxxxqqqxxqqqxxqqxxqxxxxqxxxxxqqqqxxxqqqqxxqqqxqqqqxqxqxqxxxqqxqqxxqqqxqxxxxxqxqxxqxqxqxqxqqqqqqxqqxqqxqqqxqqxxxxxxqxqqxqqxxxxqxqqqqxxqqxxxxqxqxxqxxxxqqxqxqxxxqxqqxqqqxxxqqxxqqqqxxxqxxqqxqqxxxxqxqxxxqxxxqxxqxqxqqqxxqxxxxxqqqxqqqxqxqqqqxxxxqxxqqqqqxxqxxqqqxxxqqxqxxqqxxxqxqqqxqxqxxqqxxxxxxxqqqxqxxxqxqqxqqqxqxxqxxqqqqxqqxxxqxxqqxqqxqxqxqxqqxqqxxqqxxxxxxqqxqqqxxxqxxqqxqxxxqqxqxxxqqxxqqxqqxqxqqxxxqxxqxxxxxqqxqqqqxqxqqqqxqxqxqxqqxxxqqqxxxqxxxxxxqxxqxqqqxxxxxxxqxxxxxqxqqqqqqqqxqqxqqqqxxqqqxxqqxxqxqxqxqxxxxxqxqxqxqqxxxqqqqqqxxxxqqqxxqqxqxxxqqqxqqqqxxqqxqxqqxqqqqqqxqxxxxxqxqqqxqqxxqqqxqqqqqxxqqxxqxqxxxxqqxqxqqxqqxxqqqxxqqqqxqxqqqqqxqxqxqqxxqqqxxqxxxqxxqxqxxxqxxqxxqqxqxxqxxxxqxxqqqqqxxxqqxqqqqqqxxxqqxxqxqxqxqqxqxqxqqxqxqqqqqqxqqqxqqqxxxxqxqxqqqxxxqxqxqxxxqxxxqqxqqqxqxxxqqxqqxxqqqxxqxqxqqqqqxxxqqxqqqxxqqxqqxqqqxqqqxqqxqxqqxxxxxxxxqxxxxxqxxxqqxqxqxxqqxqxxxxxqxxxxqqqxxqqxqqxqqqxxqxxqqqxxqqqxqxqqxxxqqxxxqqqqxxqxqxxqxqqxqxqxqxqqqqxxqqqqxqqxqqqqxqxqqqxqxqxxxqqqxqxqxxxxqqqqqqxxqqxqqxqxqxxqxxqqqqqqxxqxxqxxqqxxqxqxqxqxqqqxxqxxxqqxxqqxxxxqqxqqxqqqqqxxqqqxxqqxxqxxxqqqqqxqqxxqxqxxqxxqxqqqxxxqxqqqqxqqqxxqxqqqxxqqxxqqqqqxqxqqxxqqqxqxxqxqxxxxxxqqqqqqqqxqxqqxqqxxxqxqxqqqqxxxqxqqxqxqxxqxqqxxqxxqxxqxqxxxqqxqxqqqqqqqqqxxxxqxxxxxqqxxxxqxxqxxqqqqqxxxxxqxxqqxxxqxqqqxqqxqxqqqxxqxqqxqqxqxxxqqqxqxqqqxqqxqxqqqxxxqqqqxqqxqxxxqqxxxqqqxqxxxxxxqxqqxqqqqqqxqqqqxqxqxxqqxqqxxqqqqxqxqxxxqqxqxqqqqqqxxxxqqqxxxxxqqxxxqqxxqqxqxxqxqqxxqqxxxqxqqqqqxqqqqxxqqxqxqqxxqxqxxqqqxxxxqxqqqqqqqqxxxqxqqqqxqqqxqxqxqqxqxxqqxqxxqqxqxxqxqqxxqxqxqxxqqqxqqxqqqxxxxqqqqqxxqqqqqxqqqxxqqxqxxxqxqqxqqqxxxqxxqqxxxqqxqxxqqxxxxxxqqqqxxqqxxqxxxqxqqqqqqqxqxxqxxxqxqqqqqxxqqqxxqxxxxxxxxqqqqxxqxqxqqxxqqqxqqqxqxqxxxxqxxxxxxqxqxxqqxxqxqxxxxxqqxxqxxqxxqxqqqqqxqxqqqqqxqqxqxqxxqqqxxxxxqqxxqxqxxqqqxxxqxqxxqxqxqqxxxqxxxqqxxxxqqqqxqxxqxqqxxqqqxqxqxxxqxqqqxqxqxqqxqqxxqqxxqqxqxqqqqxxxxqqqqqqqxqxqqqqqxqqxxqxqqxqxxxxqxqxqqqxqqxxqqqqxxxqxxqqqxxqxqxqxqxxxxqqqxqxxqqxqqqxxxxqxqqqqqqxxqqqxqxqxxxqxxxqqqxxqxxxqxxqqxqqxxxxqxqqqxqxxqqqqqqxxxqqxxxxqxxqxxxqxxxqxqqxxxxxqxqqqqxxqxqqxqxqxqxqxxqqqxxxxqqxxxqqqxxqqxqxxqqqqqxxqxxxqxxqqqqxqqqxqqqqxqxxqxqqxqxxqxxqqqqqxqqqxxqqqqqqxqxqxqqqqqxqqqxxqqqxqqqqqxxqqxqqqxqqqxqxxxqqxqqqqqxqqqqxxqqxqxxqqxxxqxqqxqxxxxqqxqqqxxxqxqxxxxxxxqqxqqxxqxqqqxxxqxqxxqqqxqqxqqqqqqxqqqqxxqqxxqqxxqxxxxxxxxqqxqxxxqxxqxxxxxqxxqxqxxxxqqqxqxqxxxxxxqxqxxxxxxqxqqxqqqxqxqqxqqqxxxxqxqxqqqqxqxqxqqqxqqxqqxxqxxqxxqqqxxxxxxqxxxqxqxqqqqqxxqqqxxxqxqxxxqqxqqxqxqxqxqxxxqxqqqqxqxqqxqxxqxxxqxxxqxqqxxxxxqqxqxqqqqxqqqqqqxqqxxqqqqxxqqqxqxxxqxxqqxqqxqxxxqqxxxxqqxxxxqxxqqxxqxqxqxqqqxqqxqxqqxqqxqxqxxqxxxqxqqqxqqqxqqxxqqxxqqxqxqxqqqqqxqqxxqxxxqqqqxxxqxxqxxxqqqxqqqqxxxxqqxxqqqqxqqxxqqqqqqxqxxxqqqqqxxxxxxxqxxxqqqxxqxxqqxxxxxqxxxqxxxqqxqqxxxqqxqxxxqqqxqqqqqxqxqqxqqxxqqqqxxxqxqqqqxxxxqxxqxqxqqxqxqqxqxxqxxqqqxxxxxqxxqxxqqqqxxqqqxqxxqqxxxqqqxqqqxqqxqxxxqqxxxqxxqqxxqxxxqqxxqxqqxqqqxqxxxqxqxxxxqqxqxxxqxqqxxxxxqqxxqqxqxqxqxxqxxqqxxxqxqqxxxxxxqqxqxqxxqqqqqxxxxxqqxxqqxxxxqxqqxxxxqqqqqxqxxxqxxxqxqxxqxxqqqxqqqqxxxqxqxqxxqqqqxxxxqqqxxxqqqqxxqxxqxxqqqxqqxqqxqqxxxxqxxqqxxxqqqxqxxqqqxxxxqxqqxxqxqqxqxqxxqqxxqqxxxxqqxqxxqxqqqxqqqxxqqxxqqxqxqqqxqxqxxqqqqqxxxxxqxxxxxqqqqxqxqqqqqxqqxxxqxqqxxqxxxxqqqqxqxxqxxxqxxxqxxxxxxqxxxqqqxxqxxxxqxxqxqxxxxxxqxqxxqqqqxxxqqxxxxxqxxqxqxqqqqxqqqxqqxxqqxqxqqqqqxxqxxqxqxqqqqqxqxqxqqqxxqxqqxqqqxqxqxxqxqxxqqxxqqqqqqxxqqxqqqxxqxqxqqqxxqxqqqqxqqxqxqqqqxxqqqxxxqxqxxqxqqxxxxqxxqxqxqxqqxxxxxqxqxqqxqxqqxxxqxxxqqqqqqxxxqxxqxqqxqqqxxxqqqxqxqxxxqqqxxxqqqqqxxqqqxxxxxxxqqqqqqxqqqxxxxqqqqqxqqxxxxxxqxqxxqxqqxqxqxqxqqqxxxxqqqxqxxqxxxqqqxqxqxxqqqxqqqxxqxxqqxqqxxqxqqxxxxxqqxqqqxxqqxqxxqqqqqxxxxxxxqqqqxxxqxxqqxqxxxxxqxqqxxqxqqxqqxqxqxxqxxqqxxqxxxxqqqqqxxqxqxxxqqxxxxxxxqqqxxxxxxqxqqqxqxqqxqqqqqxxxqqxqxqqxxxxxqqqqqxqqxqqxqqxqqqxqxqxqqqxqqqqxxxxqqqxxxqxqxxxxxqqqqxxxqxqxqxxqqxxxqxqxqxqqxqxqqxqxqxqxqxxxxqqxxqqqxqqxxqqqxqxxqxxqxqqxqqxxxqxqxxqxqqqxqxxqqxxqxxqxxqxqqxxqqxqxqqxxxqqxxqxxqxqxqqqxqqxqqxxqqxqxqqxqqqqqxqxxxxxxxqxxqqqxxxxxqqqxxqqqqqxxxqqqqqqxqqxxxqqqqxxqqqxxxqxqxqqqxqqxqqqxqqqxqxqxxxqqxxxxqqxxqxxqxqxxxxxqqqqqxqqxxxxxxqqqxqqxqqqxqxqxxqxxqxxqqxqxxqqxqxxxqxqqqqqxxxqxxqxqqqqxqqxxxxqxqxqqqqqxxxxxqxxxqxqxxxxxqqqxxqqqxqqxqqqxqxxqxqxxqxqqqqqqqqxqxqqqxqqxqxxxqxqxxxxqxxxqxqqqxqxxqxqxxxqxqxqqxxqqxxqxqqqqxqqqxxxqxxqqxxqxxxxxxqxxxxqqqqqqqqqqqxxxqqxqqqqxxxqxxxqqxqxqxxxxqqxxqqxxqqqxxxxqxqqqqqqqqqqqxqxqqxxqxxxqxxxxqqqxqqxxqxxqxxqxxqqxxqqxxxqqxqxxxxxqxxxqxxxqqqxqqxqqxxxqxxxxqxxxqxxxxxqxqqxqxqxqxxxxqqxxxqqxqqxqqxxxxqqxxqqxxxxxxxqxqqqxxxqqxqxxqxxxqqxxxxqqxxqqxqxxxqqxqxxxqqqqqqxxqqqxxxxxxxqxqqqqxqxqxqxxxqqxxxqxxqqxxqqxxxxxqxqqxxxqqxqqxxxxqqqqqxxqxxxqqqqqxqqxxxqxqqqqqxxxxxxxxqxxqxxqxxqqqqqqxqxqxxxqqqqxqqxqxxxqxqxxqqxxqxqxqxqxxxqqxqqxqqqxxqxqqqxxxxxxxxxxxxxxqxxxxxqqxqqxxxqxxqxqxxxqqxqqqqxxqxqqqxqxxqqxxxxxxqqxqxqxxqxqxqxxxxqxxxxqqxqxxxqxqxxqxxqqqqqxxqxxqqqqqxxxqqxxqxxqqqqxxxxxqxqxxxqxxxqqxxqxxxqqxqxqxxxxqqqxqqqqxxqqqqxxxqqxqqxxxxqxxqxxqxqxqqqxqqxxqqxqxxxxxxqqqqqqqqxxxqxxqxqqqxqxqxqqxqxxxxqxqxxqxxxqxxxqxxxqxxqqqxqqqqxqqxxxqxxxxxxqqxxxqxqxqqxqxqxxxxxxqxxxqqqxqqqxqqqqxqxxqqxqxqxqqxqqxqqxxqxqqqxqqqqxqqxqxxqqqxxqxqqxxxqxqxxqqxqqxxxqqxqqxxqxxqxxqqxxqqxqxxqxqqxqxxqqqqqxqqxqxxxxqxxqxxqxqqqqxxxqqqqqqqqqqqqxxqqxqqqxqqxqqxqxqxqqxxxqqxxxxqxqxqxxqxqxqqxxxqqqxxxqxxxxxxxxqxqxxqqqxqqxqqxxxqxqqxxxqqxxqxqqxxqxxqqxxqqqqqxxqqqqqxxqqqqqxxxqqxqxqqqqqqxxqxxxqqxqqqqxqqqqqqxxqxqqxxqxqqxxqqxxxqqqqqxqxqxxqxxxqxxqqqqxxxqqxxqqqqqxqqxqxxqxqqqqqqxxqxqxxxqqqqxxxxxqxxqqqqqxqxxxqxqqxxxxxqxqxxxqxqqxxqqqxxxxqxxqxqxxxqqxxqxxxxqxxxqqxqqxxqqxxxqqqxxxxqxqqxxxxxqxxxqqqqxxqqxqqxxqxxxxqqxqqxxqxxqxxxxqxxxqqqqxxxqqxxqxxxqxxxqxxqqxqxqqxxqqqqqqqqxqqxxxqqqxxxqxqqxqqxqxxqxxxqqqqxxqqxxxxqxqqxxqqxxqxqxxqxqxxxqqqqxxqqqqqqxqqqxqxxqxxqxqqqqxqqqqqxxqxxxxqxqqqxqqxqqqqxxxxqqxxxxqxxxxxqqxqxxxqqqxqqxqqxxxqqqxxqqqxxqxqxxqqxqxxqqxqqxxqqqqqqqqqqxxqxxxxxxqxxxqxqqqqqxxqqxqxqxxqxqqxxqxxxxqxxxxqxxxqxxxxqqxxxqqqqqxxqxxxxxqqqxqxqxqxxqqqqxxxxxqqqqxqxxxxqqxxxxqxqqqxqxqxxxqxqqxxqqqqqxqxqqqxqqqxxqqqqqxqqqxqqqxqxqqqxxxxxxxxxqqxqxqqxxqqxxqxxqxxqxxxxqqqqqqqxxqxxxqxxxqxqxxqxqqqqqxxxqqxqqxxxxxxqxxxxqxqxxxxxqxqxxqqxxqqxqxxxqqqqxqxxqxqxqxxxxqqxqxxxqqxxxxqqqxxqqxxqxxqxxxxqqxqxqqxqqqxxqqxqqqqqqqqqxqxxxxxxxqqqqqqxxqxqqqqxqxqxxqxxqqqqqqxqqqxqqxqqxxxqxxxxxxqqxqqxxxxxqxqxqqqxqxqxxqxxqqxqxxqxqqxqqqxqqqqxxqxqxxxxqxqqxxxqqqqqqqqqqqxxqxxxqqqxqqxxqxxqqxxqxqqxqxqqqxxxxxxxqxqxxxqxxxqxqxqqxxxxqqqqqxxqqxqxqqqxqqxxqxqxqxqqxqqxxxqxqxqqxxqxxxqxqxxqqxxxqxxxxxxxxqxxqqxxqqqqqxqxqqxxqqxqxxxqxxxqqqqqxqqxqqxxqqxqqqqqxqxxxqqxxxqqqqxqqxxqxxxxxqqxqqxxqxqxqxqqqxqxxqqxqqqxqqqqxxxqxqxxqxxxxxqqxxxqxqxxxqqqqqxqxxqxqxqxxqxqxqqqqqxqxxxxxxqqqxqqqqqxxxqxqqxqxqqqqxqqxxxxxxxqxxqqqxqxqqqxxqqqqqxxxqxqqxqqxxxqqxqxxqqxqqxqqqqqxqqxxxqqqqqqqqqqqqqqqxqxqxxxqxqqxxxqqxqqxqxxqqxqxxqxqxxqqxxqqxqxqxxxqqxxxxqqqxqxxxxqxxqqqxxxqqqqxxqxxxxqqxxqxqqqxxqqxxxxxxxxqqxxqqqxqxqxqqxqqqqxxqxxxqqxqqqxxxqqxxxqxxqxqqqqqxqxqqqqxqqqxqxxqxxqxxxxqqxqqxqqqxqxxqqqqxqqqxqxxxqqxxqxqxqqxqxqqxxxqqxqxqqqqxxqqxqqxxxqqxxqxqxxxqxxxqqxqqqxqqxxqqqqqqqxqqxxqxqqqxqqxxqqxqxxqqxqqqqxqxxqxqqqqxxxxxqqqqqqxqxqqqxxqxxqxqxxqqqxxxqxqxxxxxxxxqxxxqxxxxxxqxxxqqqqxqqxqqxxxqqxxqqxqqqxxqqqqxxxqxxxxqqxxqxqxqqxxxqqxxxxqqxqqqqxxqqxxxqxxxxqqqxxqqxqqqqxxqxqxxqxxxxxqqqxqqqqxqxqxxxqqxxqxqxqqxxqxqqxqqqqqqxqxxxxqqqqqxxxqxqqqxxxxqxqxxxxxxqxqxxqxqqxqxxqqxxxxqqqqqxqxxqqqxxqqqqxxqxqqxxxqxxqqxqqqqxxqxxqxxxxqxxxqqqxxxxxxqqxxqqxxqxxqxxqxqqqqxqqxxqqqxqxxxxxqqqxqxqqqqxqxqqxxqxqxxxqxqxxqxqqqqqqqxxqqxxqxqxxqqxxqqxqqxqxqxxqqqxqqqqqxqxqxqxxxqxxqqxqqqxqxxxqqqqxqqxqxxxxxqqxqxxqxxqqqqxxxqxxxxxqqxqqqxqqqxxqqqxxxxqxqxxqqxxxxxxxqxqxqxxxxqqxqqqqqxxxqxxxxqxqqqqqxxqqxxqxxxqqqqxqqxqxxqxxxxqxxqqqqqqxxxqxqqqxqxqqqxqqqqqxqqxxxxqqxqxxxqqxqqqxqxxqxqxxxxxxxqqqxxxqxxxqxxqxqqqqxxxqxxxxqqqxqqqqxxqqqqqqqqqxqqxqqxqxqqxxqxqqxqxqxxxxqxqxqxxqxqxxqxqqxqqqqqxqxxxxxqqqxxxxxxxxqxqxxqxxxxqqqqxqxqxqqxxxxxxqxxqqxqqqxxxqqxxxqqxxxxqqxqxxqxxxqxqqqxxxxqqxqxqqxqqxxqqqqxxqxxxqqxxqxqxqxxxxqqqqqxqqqxxxxxxqqqqxqqxxxqxqqxxxqxxxxqxxxxxxxqqqxxqxqxxqxqxqxxqqxqxxqxqxqxqxxqqxxqxxxqxqxqqqqxqqqxxxqqqqxxqxxxxqxxxxxxqxqqxqxqqxxqqxqxxqxqqxqxqqxqqqqxqqxxqqxqqqqqqqqxxqxxqqqqqqqqqqqqxxqqxxxxxxqqxxqxxxxqqxxxqxxqqxxxxxxxxqxqqxqqqqxxqxqxxqqqqxqxqxxxqqxqxxxqxxqqxxqqqqqqqxqqqxxxqqxqqqqqxxxxqxqxxxxqxxxqxxqqqxqqxqxqqxqqxxqxqxxqxxqxqxqqqxqqxxqxqqqxqxxqxxxxqqqxxxqxqqqxqxqqqqqqxqqxxqxqqxxqqqxxxxqqxqxxqxqxxxqqxqxqqxqxxqqqqxqqqqqqxqxqqqxxxqxqxxxqxqxqxqqxxxqqxxqqxxxxxxqqqqxqxqqqqqqxqxqxxqqxqqxqqqqqxqxqqxqqxxqxxxqqqxqqxqqxxxqxxqqqqxqxqxxxxxqxxxqqqqxqqqqqxxxxxqxxxxqxxxxqqqqqxqqqqqqqxqxxxqqqxxxxxxqxqqxxxqxxxqqqxqxqxxxqxqqxqxqqqxqxxqxqqxxxqxqqqqqqxqqxxxqxqqqqqxxqqxxqqxqqxqxxxxqxqxqxqxqxxxqxxqxxxxxxqqqqqxqqqqqqqqxxxqqxqxqqxxqqxqqqqxxqxxqxxxqxxqxxqxxxqqqxqqxxxqxqqqxxxqxqxqqqqqxqxxqxxqxxxqxxxqqqqxxxqqxqxxqqxqqqxqxqqqqqqxxqxqqxxxxqqxxqqxxqxqqxxqqxxxxqxxxqqqxqqxqxxxxqqxqqxqxqxqqqqxqxxxxxxxxqxxqqxqqqxxqqxxqqxxqqqqqxxqxxqqqxxqxqqxxxqqxxxqqqqxqxqxqqxqqqqxqxqxxqxqqqxxxqqqxqxqqxqxqxxxxxxqxxqxqqqqxxxqxxxxxqqxxqqqqqqqqqxqqxxxqqqxqqxxxxqxxqxqqqxqxqxqxqqqxqxqqxxxqqxxqqxxxxxqxxqqqxqxxqqqqxqqqqxqqqxqxqxxqqxqqqxxxxqxxqxxqqxqxxqqqqqqqqxqxxxqqxqxqqxxxqqxqxqqxqqxxqqxxxxxqqxqqxqqqqxqqxxqqxqqqqxqqxxxxxxqxqqxqqqxqxxqqxqxxxxxqqqxxqxqxqxxxqxqqqqxqqqxxqqxqxxqxqxqqxqxxqqxxqqxxqqqxxqxqqqxxxqxxqxqqqqqxxxqxxxqqxxqxxxqqxqqqqqxxxxqxqqqxxxxxxxqxqqqqxqqqxxxxqxxxqxqxqqqqxqxqqqxqxxxxxqxqxxxxxqxqxxxqqxqxxqxxqxqqqqxxxqqqxqqxxxxqqxqqxqqxxqqqxxqqxqqqxxqqqqxxqqxxqqxxxxqqqxxxxqxqxqxqqqxxxxqqqqqxqxqqqqxqxxxxxqxqxqxqxqqqqxxqqqxqqqxxxqqqqqqxxqqxxqqxqxxxxxxxxqqqqqxxxxxqxxqxxxqqqxqqqqqqxxxxxxqqxqxxqxxxxqqxqqxxxqqqqxqqqxxqqqxqxqxxqqxqxqqqxqxqxxxqqqqqqqqqxxxxxqqxqqxxxqxqqqxqxqxxqqqqxxqqqqxxqxxqxxxqxqqqqxqqqqqxqqqxxqxqqxqqqxqqxqqqqqxxxxqqqqxxxqxxqqqqqxxqxqxxqxqqxxqqxqxqqqxxqqqqxxqxqxqxxqqxxxxqqqqqxxqxqxqxxxxqqxxqqxxxqxqqxxxqqxxqqxxqxxqqxqqxqqxxxqqxqxqqqxqxxqxxxqxxxqqxxxqxqqqxqxqxxxqqqxqxxqqxqqxqqxxqxxqxqxqqxxqqqxxqqqqqxxqqxqxqqxxxxqqxqqxqqxqqqqqxxxqqqxxxqxxqxqqxxqqxxxqxxqxxxqxqxqxxqqqxqxqqxqxxqqxqxqxxxqxxxxqxqxxxxqxqqqxqxqxxxxqxqqqqxqqqxxxqxqxxqxxqqxqxxxqxqqxqqqqxqqxqqqxxxqqxqqxqqxxqxxqqqqxxxqqqqxxqqqxxqqxqqqxqxqxxqqqxqqqxxxqqxxxqxqxxqxxxxxxxqqxqxxxqqxqxxxqxqqxxqqqqqxxqqxqqxqxqqxxxqxqxxqxxxqxxqxxqxqxxqxxxxxxqqqqxxxxqqqqxxxxqxqqxxxqxxxqqqxqqqqxxxxxqxxxqxxqqxxxqqqxxqqxqqqqqqqqxqxqxqxxxxxxxxqqxxqqxxxqqxxqxqxqqqqxxxxqqxxqxxxqxxqxxqqqqxxxqqxqqxxxqxxqxqqqxqxqqqqxqqxqqqqqxxqqxxqqqqxqqxqxxxxqqqqqqqxxxxqqqqxqqxxqqqqxqqxxqqxxxqqqxqxxqqqqqxxxqxxqqxxqqxqxqxqxxxxxxqxqxxqxqxxqxqxxqxqqqxqqxxxqqxqxqxxxqxxxqqqxxqxxxqqqxqqxxxqqxqqqqqqqqxqqqqxqxxqqqxxxxxqqqxxxqxxxqxqqqxxxxxxqqxqqxqxxqxqxqxqxqxxqqxqqqqqxqxqqxqxxqqxxqxqqqqqxqqxqxqxqqqqqxqqqxqqxqqqxxqxqqxqxqqxxqqqqxxqqqxqqxqqqqqxxxxqqxqxqqqqqxqqxxqqqqqxxqqxxqqqqxxxqxxxqxxxqqxqxxqqqqxxqqxxxxxxxxqxxqxqxxxqqqxxqqqxxqxxxqxqqxxqqxqxxqxxxqqxxqqxqxqqqqxxqqqqxqqqqqqxqxxqqqqxqqxqxxqxxxxxqqqxqqqqxxqxqxxqqxxqxqxxxxqqqqqqqxxqxxxqxqxxxxqxqxxqxxxxxqxqqxxxqqxxxxxxxqqqxxxxqxqxxxqqxqqqqqqqqxxqxxxxqqxxxqqqxxxxxqxqqxxqqqxxxqxqxxxqqxqqxqxqxqxqxqxqxqqqqqqxqqqqxxqxxqqqxxxxqxqxqxqqqqqxxqqxxqqqqqxxxqqxqxqqqqqqqxxxxxqqqqqxqqxqxxqxqxqxxqxxxxqqxxqqxxqxxxqxqqxxqqxxqqqqqqxxxqxqxxxxxxxqqqxqqxqqxxqxqxxqqqqqxqxqqqxqxqxqqxxxqqqxxxqxqxxxxqqxxqqqqxxqxqqqxqqqqxqxxxqqqqqqxxxxqxxxqqxqxxqqxqqxxxqqxxxxxqqxqxxxqxxxqxxqqqxqqqxxqqxqxqxqqqxxqqqqxqqqxxqqxxxxqqxxxqqqqqqxxxxqxqqxxxxqxxxxxxxqxqxxqqxxxxxxqqxqqxqqqqqxxxqxqxxxqxxxqxqxqxqxqxqxxxxqqqxxqxqqqxxqqqqqqxxqqqqxqqqxqxxqqxxxxqxqqxqqxxqxqqxqxqqqqxxqqxqqqqxxxqxxqqxqxqxqqxxxxqqxxxqxqqxqxqxqxxxxxxqqxqqxxxxxxqqxxxxqqqxqxqxxxxqxqqqqxqqxqqqxqqqxqxxqxxqxqxqqqqqqxxxxqqqxxqxxqxxqxqxxxxqqxqxxxqxqqxxxxqqxqxqxxqqqxqxxqqqxxxqxqqqxqxxxqxqxqxxqqxqqxxxxqqxxxxxxxqqqxxqqxqqqqqqxqxxqqxqqxqxxxxxxqxxxqxxqxxxxqqqqxqxqxqxxxqqxxxxxqqxxqqqxxqqqqqqxxqxxxqqqxxxxxxxxqxqxqqxqxqxqxxqxxqxqqqxxxxqqqqxqxqqxxqqqxqxxqxxxqxqxxqqqxqqqxqqxxqxxqxqqqqqxxxqxqxxxqqqqqqqxqxxxqqqqqxqxxqqxqxxqxqqqxxqqxxqxqxqqxqxxxqqqqxxqqxqqqqxqxqxqqxqqqqxqqqqqxqqqxqxqqqxxqxqxxxxxqxxqqqxqqxqxxxxxxxqxqxxqqxqxxxqqxxqqqqxqxxqxxxqxqqxqqqxqxxqqqxxxxqxqqqxxxqqqqqxxxqqqxxxxqxxxqxqqqqqxxxxqqqqxxxxqxqqxqxqxqxxqxxqxqxqxqqqxqxxxqxqqxqxxxxxxxqqxqxqxxxqqxxxqxxqxxqqxqqxxqxqqqxxxqqqxqqqqxqqxqxxqxqxqxxqqqxxxxqqxxxqxxqqxxxxxxqqxqqxqxqqqqqxqqqqxxqxqqqxxxxxxxqqxqxqxqxxxqxqxqxqqqqqqqqqxxxxqxxqqxxxxqqqqqqqqqxqqqxxxqxxxxqxqxqqqxqqxqqxqxqxqqxqxxxqxqxqqqqxxxxxqqxxqxqqxqxxqqqqxqxqqxqqxxxqqxxxxxqxqxqqxxxqqxqxqxqxqqqqqqqxxqxqxqqxxqqqxqxxqqxqqqxqqxxqxqxqxxxxqqqxqxxqqqqqxxxqqqqqqqxqqqxxxxxxxqqqqqqxqqqqqqqxqqxqxxxxqqxxxqqqqqqqxqxqxqxxxqqxqqqxxxxxqqxxxqqqqqxxxqqxxqqxqqqxxqqqqxqxqqxxqqxxqxqqxqqqqxqqqqqxqxqqqxqqxxxxqqxxqqxqqqqxqqxqqqqqxqqxxqxqqqqqxxqqqxqqqxqxxxxxqxxxxxxxxqxxxxxxxxqxxqqqxqqxqqqqxqqqqxxxxxqqqxqqqqqqqxqqqxxxqqqxxxxxqqqxxqqqqxqxqqxxxxqqxqqqxxxxqqxqxqqqxqqqxxqxqxxxqxqxxqxqqqqqxqqqxqxxqqqxxxqxqxqxqqxqxqqxxqxqxqqqqxxqxqxqqxqxxxxxxqqxxqqxqxqxxqqxxqxxqqxqqqxxqxqxxxxqxqqqqxqxqxxxqqxxqqqxxxxqxqqqqqqqqxqqqxqqxxxqxqxxqxqxqqqxqxqxqxqqxxqqqqqxxqqxxxqxqqxxxqqqqqqqxxxqqqxqqqqqqxqqxxxxqxxqxxxxxxqxqxxxxqqqxxxqxxxqxxqqqxxqqxxxxqxxqxqxxxxxqqqqqqxqqxqqxqxxqqxxqqxxxxqqxxqqxqxqxqxqqxqxqqqqxqxxqqqxxqxqxxqxqxqqxqxqxqqxxqxqxxqxxxqqxqqxxqqxqxqqxxxqqxqqxxqxqqxqqxxqxxqxqqqxqxqxxxqxqqqqxqxxxxqxxqxxqxxxxxqxqqqqxqxqqqxqxxqxqxxqxxxqxqxxqqxxqqqxqxqqqxqxxqqqqqxqxqqqqqxxxqqxxxxxxxqxqxxxxxqqqqqxxqqxxqqqxxxqqxqxqxxxqxxqqxqxqxqxxxxxxqqxxxqxxqxxqqxxxqqxxxxqqxxxqxqxxxxqxxqqqqxxxxxxqqqqqxqxqqxqqqxqxqqqxxqqqxqxxxqqxxxqqqxxxxqqqqxxxxxxqqqxqqqqxqqxxxxqxqqxqqxxxxxxqqxxxxqxqqqxqxxqqqqqxxxxxqqqqqxxqqxxqqxqqxxqqqxxqqxqqqxxxxqqqxxqqqxqxxqqxxxqxxqqqqqxqqxqxxqxqxqqxqxxxxxxqxqqxxqqxqxqxqxxxqqxxxqqqqqqxxqqxqxqqxqqqqxxqqqqxqqxxxxqqqxxxxqxqqxqqxqqxxxqxqxxxxqqqxxqqxqqxxqxqxxqqxqxqqxxxqqxqqxqxxqxxqxqqqqqqqqxqqxqxxqxqxxxxxqxqqqqxqxqxqqqqqxqqxqxxqqxqqqxxxxqqxqxqxxqqqxqxxxxxqxqxqxqxxqxqqxqqxxqxxxqxxqxxxqxqxxqxqxqxxqqqqxxqqxqqxxxxqxqqxxxxxqxqqqxqqqxqxxxqqqqqxqqqqqxxqqxqxqqqxqqxqxqqxxxqqxqqqxxxqqqxqxxqxqqxxqxqxqxxqqqxqqxqxqxxxqxqxxxqxxqqqqxxxxxxxqqqxqxqqxqqxqxqqxqqqqxqxqxxqqxqqxxqxqqxxxqqqqxqqxxxxqqqxxxxxxxqxxqxqqxqxqxqxxxxxxxxqqxxxqxxqxxxxqqxqqxxqxxxxqqxxqqqxxxqqxqqxxqxxqxxxxqqxxqqqxqqxxqxxxxqxxxxxxqxxqxxxxqqxxxqqqxxqqqxxxxxxxqqxqqxqqxqxxqqxqqqqqxxqxqqxxxqqxxxxxxqxxqxxqxqqxxxqqqqxxxqqxqxxxxqqqqxqqqqqxqqxxxxxqqqqxxxqqqqqxqqqxqqxxxxxxqxxqxqqqqqqxqxxxqqxqqqxqqxqqqxqxqxqqxxxxqxxxqqqqxqxxxqxqxqqqqqxqxqqqqxqqxxxqxxqqqqxqxxqqxqqxxqqqxqqxqqqxxqxxxqxxqxxqqqqqqqqxxxqxxxqxxqqqqxqqxxxxqxqxxqqxxqxqxxqqxxxqqqqqxxqqxxxxqqqxxqqqxxqqqqxxxxqxqxqqxqxxqxqqxqxqqxqxqqxxqxxxqqxqqxxqxqqxqxqxqxqqqxxqqxqqxqqxxqqqqqqqxxqxxxxxxxqxqxqxqqxxqqxxqxqqqxxxxxxqxqqxqxxqqxxxxxxxqqqxxqxqqxqqxqxqqxqqqxxxxqxxxxxxqqqqxxxqxqqxqqxxqqxqxxqqqqqxqxxxxqxqxxqxqqxqxqqqqqxqxqqqxxqqxqqxqxxqxxqqxqxqqxqqqxqqqxxqqxxxxqxxqxqxqxxxqxqqqxxqxxqqqqqqqqxqqxqqxqqqqxqqqxqqqxqxxxxxxqxxqqqxqqxxxqxqxqxqqqxqxxqqqqxqqxqxqqxqqxqxxxqqqxxqqxqxqxxqqqxxxxqqqqqqqxqqqxxxqqxqxxqqqqxxxxqxxqqqxxxqxqqqqxxxxxxqxqxxxxxqxxqqxqqxxxxqqqqqxxxqxxxxqqxqqqqxxqqqxxqxqqxxxxxqqqxxxqqqqqxqxxqqxqqqxqxxqxxqqxqxqxxqqxxxxqqqxxxqqqqxqxqxxxqxqqxxxqxqxxqqxxqqqxqqxqxqqqxqxxqqqxqqqxqqxxxqxqxqqxqqqqqqxqxqxxxxqqxqxxxqxqqxxxqxxxxqxxxqxqqxqxxxqqxxqqxqqxqqxqxqxqxxqqqxqqqqqxqxxxxxqxqxqxqqqqxxqxxqqxqxqxqqxqqxqqxxqxqxqqxqxqxqxqxxqqqxqxxqqxqqxqqxqxqxqqxxqqxqqxqqqqqxqqqqxqqxqqqqqqqqqqqqqqxqxxxqxqqxxqqqxqqqqxxxxxxxxqxqxxqqxxqqqqxqqxqqxqxxqqxqqxxxqxqxxqxqxxxqxxqxxxxxxqqqqxqxxqqxxqqxxxqxxxxxqxxqqxxqxqxqqxqxqqqqqxqxqqxqqqxxxqqqqxxxqqxqxxqqqqxqqqqqxqxxxxxqxxqxxxxxqxxqqxqqqqxxqqqqxqqqqqxxxxqxxqxqqqqxxxxxqxxqqqxxxqxqxxqxxqqxqxqqxxxqqxxxqqxxqqxqqqxqqxxqqqxqqqxxqxxxqqqqxxqxxqqqqxxqqxqqxqxxxqqxqqqqxxqxqqxxqxqxqqqqqxxqqxqxqxqqqqxxqqxqxxqxxqxxqxxxqxxxxqxxxxxxxxqxqqxqqxxxxxxxqqxqxqxxqqxqxxxqxxqxqqxqqxqqqqxxxqqxxxxqqqqqxqxxqqxxxqxqqqqqqqqqqqqqqqxqqxqqxxqxxxxqqqqqqqqqqxqxxqqqqqqxqxqqxqqxqqxxqxqqqxqxxxxqxqxqxxxxxxxqqxxxqqqqxxxxxqxqxqqxqxxqxxqqqxxxqqxqqxxxxqxqqxqqqqxxqqqqxxxxxxqqxqqxqxqqxqqqxxxqqxxxxxxxxqxxqqxxxqqxqqxqqxqxqxqxxqxxxqqqxqxqqxxxqqqxxqqqqxqxqxqxxqxxqqqxqxxxxqqqqxqqqxqqxxqxqxxqxxxqxqqqxqxqxxqqqxqqxqqxqxxxqqxxxxqxqqqqqqqxqxxqqqxqqxqqqqxqqqqqxxqqxqqqqxxxqxxxxxqqqxxxxqqqxxqqqxxxxxxqqxqxxxqqqxxxxqxqxxqqqxxqxqxxxxqqqxxxqqqxxxqxxqqxxxxxxqqqqxqqxxxxqqxxxqqqqxqqqqxxqqxqqqxqxqqxqqqqqqxqxxxxqxqxqxxxqqxqqqxxxxqxqqqxxxxxqqxxxxqxxqxxxqxqqqxqxxqqxxqqqqxqqqxxxqxxqxxqqqqqqxxxxxxqqqqqxqqxxqxxqxxxqqxxxxqxqqxqxxqxqqqqxxxxxxxxqqqxxxxqxqxqxxxxqxxxqqxqqxqxqqqqxqxxxxqxxxxxqqqxxqqqxxxqqxxxxqxxqxxqxxxqxqqqxqxxqqqqqqxxxqxqqxqqxxxxxxqqxxqqqxqqqxxqqqqqxqxqqqxqxxqqqqqqqxqxqxqqxxqxxxxxqxxxxxxxxqxqxxxqxxqxqqqxxqqxqxxqxxxqxqxxxxxxqqxxqxqqqqqqxqqqxxxqqqqqqqxxxxqxxxxqxqxqqxqxqqxxqqqqqqxxqqxqqxxqxqqxxxqxxqxxqxqxqqqqxxqxxqqxqqqqxqxqxqxqqxxxxxqqqxxqxqxxqqxqxqxxxqqxxxxxxxqxxqxqqqqxxqxqxxqxxqxqxqxxxxxxqxqxqxxqxqqqqxxqxqxqqqxxqxqxqqxxqxxqqqxqxxxxxqxxqxxqqqxqqxqxxqxxqxxxxqxxqxxqqxxxqxxqqxqqxqqqqxxxqqxqqqqqqxxqxqqqxqxqqqqqxqqxxxqxqqxxqqxxxqxqqqxqxqqqxxxqqxxqxqxqxqqqxqqqxqqqqqqqqqqxqxqxqxxxxxqxqxxqqxxqxxxqqqxqxxxqxqqqqxqqxqqxxqqqxqxqxqqxqqxqqxqxqqxxxxqqxqqqxqxxqxqqxqxqxxxxqqqxqxxqxqxqqxqqqqqxqqqqqxxxxqxqqqxqxxqxqqxqqxqqqxqqqqxxxxxqqxxxqxxqxqqxxxxxqqqqqxqxqxxqqxxqqqqqqxxqqxxxqxxqxqxxxqqqqqqxqqxqxqxqqxqxqqqxqqxxqxqqxxxqxqxqxqqqxqqqxxqqxxxqqqqqqqxxqqqqqqqqxxxqxqxqqxxxqxqqqqxxqxxqxqxqxxqqxqqxxqxqxqqqxxqxqqqxxxxxxqqqxqqqqxxqqxxxxxqxxxqxxqqxxxxxqqqxqqqqxxxxqqxqxqxxxqqqxxxxqxxxqqxqqxqxxxqqxxxxxxxxxqqqxqxqxxxxqqxxqxxxxxqqxqqqxxqxxxxqqxqxxxqqxxqqxxqqqxxqqqxqxxqxqxqqxxqqqqxxxqqxxqxqqqxqqqqqqxxqqqxqxxxxqxqqqqxxqqqxqxqqqqxqxqxxxqxxxxqqqqqxxxqxxxxxqqxxqqxxqqxqxqqqqxxqxqqxxxxqxqxxqxxqqxqxqxqqqqqxqxqqxqqqqxxqxxxqxxqxxqxqqqqxqqqxxqqqqqqqqxxxqxqqqxqqqxxxqqqxqxxqqxqxxqqxqqxqxxqxxxqqxqqxqxqxqqqqxqqqxqxxxxxxxxxqxxqqxqqqqxqqxxqxxqxxqxqqxqxxqxqqqqxqxqqqxqxxqxqxxqxqqqxxqxqxxqxxqxqqxqxqqqqqxqxqxqqxqqxqxxxxqxxxxqxxxxxxqxxxqqxxxqqxqxqqxqqxxqxxxxqqxxqqxqqqqxxqqqxxxxqqqqqqxxxxqxqxqqxqxxqqxxxxxxxxqxxqqxqxxxxqxxqqxxxqxqqqxqxxqqxqxxxqqxqqxqqxqxqqqxqxxqqqqxqxxxxxqqqxxqqxxqqqxxqqqqqxqqqqqqxxxxxqqqxxxxxqqxxxxqxqxqqxqqxxxxqqqqqxqxqqqqxqxxxxxxqqxqxxxqqqqxqxqqxqqxqqxqqqqqqxxqxxqxxxxxxxxxxqxxqqqqxxxqqxqxqxqxqqqxqqqqqxxxxxxxqqxqxxqqxxxxqxqxqxxqxxqxqqxqxqqqxqqqqxqqxqxqxqxxxqqxxqqxqqxqqqxxxxxqqxqxxxxqxxqxqqxxxxqqqxxxqqxqqqqxxqxxxqqqqqqxqqqqqxxqqxxqxqqqqxqqqxxqqqqqxxqqqqqqxxxqxqqqxxqxxqqxxqqqxqxxqxxxxqqqxxqxqxxqqxqxqxqqxxxxqqqqqxqqqxqxqxqxxqxqqqqqxxqxqqxxxqqxqxqxqqxxqqxqxxqqqqxqqxxxqqxxqxqqqxxxxxqqqxxxqxqqqxqxqxqxxqqxqqxqqqqqxqxxxqxxqxqxqxxqqqxxxxxqqxqqxqxxxqqxxxxxqxqqxxqxqxqqqxxxqqqqxqqxqqxqqxqxxxxxqxqqxqqxxqqqxqxqqxqqqqxqxxqxxqqxxxqqqxxqqxqxqxqxqqqqxqxxxxxxqxxqqqqqqqqxqqqxxxxxxqqqqxxxqqxqxqqqqxqqqqqqxqxqqqqxxqxxxqqqqqqxxqxqqqxxxqxqxxxxqqqqxxxqxxqqqxqqqxxxqqxqxqxqqxqxxxqxxxqqxqxqxqqxqxxqxxqxxxqqqqxxxqqxqqqqxqxxxqqxqqqxxxqqxqqxxqxqqxqxxxxxxqqxqxxxxqqqqqxxqxxqqxqxqxxqqxxxqqqxxxqxqxxxxqxxqqxxxqqqxxqqxqxqxqqxxxxxqqqxxxxxxxxqxxqqqxxxxqxxqxqxqqqqqxxxxqqxqxqqqxxqxxqqqqxxxqqqqxxxxqxxqxqqqxqxqxxqxqqqxxqqxxxxqxxqxqxqxxxxqxxxqxxqxxqxxxxqxqqqxxxqxqxqxqqqqqqqxxxxxqqxxqqqxqxxxqxxxqxxqqxxqxqqqqxqxxxxqxqxxqxxqqqxxqxqxqxqqqxxxqqxxxxxxqxxqqxxxqxxqxqqqxxqxxxqqxxqqqqqxqxqqqxxxqqqxqxqxqxqqqxxxxqxxqxxqqxxxxxxqqxxqxxxxxxqxqqxxqxxqxxqqqqxxqxqqxqxxxqqxqqxxqqqxqxxqxqxqqxqqxqxqqqxxqqqxxqxqqxqxqxqqqqxqxxqqqxqxxqqxqqxqxqqqxqxqqxqqxxxxqxqqqqxxqqqxxqqqxxqqqxxxxxxqqxxqxqxxqqxqqxqxxxxxxqxxxxqqqqqxqqxxqqxxqxxxqqqqqqqqqqxqqxxxxxxxqxqqqqqqqxxxqxqxxxqqqqxxxxqqqqxqqqqqqqxxxqxqqqxqqqqxxxxqxxqqxxxqqxxxqqxqqqqqxxqxxxqxxxqxxqqqxxxxxxxxqxqqxxxqqxxxxxxqqqqxxxqqxxxxqxqqxqqqqqqxxxqxxxxqqxxxqqqxqxxxxxqqxxqqqxxxxxqxxqqxqqxxxxqqqxqxqxqxxxqqqxxqqqqxxqqqqqqqqxxxxqxqqqxqqqxxqqxxqxqqqxxxqqqqxxqqqxxxxxxxxqqqqqxxqqxxxqxqxqqxqxxxxqqqxqqxxxxxxqxqxxxqqxxqqqqqqxxxxxqxqxxxxxqqqxqqxxqqqxxqxxqqqqxxqxqqqxqxqqqqxqxqqqxxxxxqxqxqqxxxxxqqxxqxqxqqqxqxxqxxxxqqxxqqxqxqxxxqqxqqxqqqqqqxxxqxqxxxqqxqqxqxxxqqxqqxqxqqqxxqqxqqqxqqxqxqxxqqqqxxxqqqqxxxqxxxqqxqxqqxxxxxqxxxxxqqxxxxxxqxqxxxxxxxqxxxqxxqxxxqqqqxxqqqxxxxxxqqxqqqxxxqxqxxxxqqqxxqxqxqxqqqqqqqqqxqqqqqqqxxxqqqqxxqqxqqqqqxxxxqqxqxqqqqqxqqxqqqqxqxxxqxqxqxqxqqqxxxqqxxxqxqqqqxqxqxqqxxxqqxqxqxxqxxqqqqxqqxxxxqxxxqxqqqqqqqqqxqxqxqqxxqxxqxqxxxxqqqxxqxxqxqqqxxxxxxxqqqqxxqxqqqqxxxqqqqxxqxqqxqxqxxqxqxxxxxqqqxqqxqqxxqxqxqxqqqxxqxxqqxqxqqqxxxxxxxxqqqxqqqqxqqqxxqxxqxxqqxqxxxxxxxxqqqxxqxxxxqxqqqqxxxqxxxqqxxxxxxqqxqqqqxqqqqqqqqqxxxqqqxxxxqxxqxxqxxxxqxqqqxxxxqxqqqqxxxqxqqqxqxxqxxqqqxqxxqxxxqxqqxqxxqxqxxxqxxqxxqxqxqqxxxxqxxqxxqxxqqqqqxqxxqqqqqxqqxqxxqxxqqxqxqxxqxxqxqxqqxqxxxxqxqxxqqxqqxqxxxqxxxxxqqqxqqqqqxxxqxqxqqqqxqxxxxqqxqxxqqqxqqxqxxxxqxxqxqxxxqxqxxxqqqxqqqqxqqqqxqqqqxqxxqqxqqxxqqxxxqqxqxxxxqxqxqqqqxqqqxqqqqxxxqxxqqxxxxxxqqqxxxqxqxqqqqxqqqqxqxxqqqqqqqqqxxqxxqxxxqqqxxxxqxqqqxxqxxxqxqxxqxxqqxxxxxqqqqxqqqxxxqqqxqqqqxqqqqxxxxqxxqxqqqqxxxqqxqxxxxqqqxqqqqqxqxqxqxqqxqqxqqqqqqqxqxqxxxqxqxqqxxxqqxxxqqxxxqxqqqqqxqqqxxqxqxxqxxxxxqqqxqqxqqxqxqqxqqxxqqqxqxqqqqqqqqqxqxqxqqqqqxqqxxqqqqqqxxqxqqxqqxqxqqxxqqqxxqqqqxxqxxxqqqxqxxxxqxqqqxxqqxxxqxqqqqqqqxqxqxxqxxqxxqqqqqqxxqqxqqxqqxxqxqxqxqxqqqqxqxxxqqqqxxxqqqqqqqxqxqxqxxxxxqqqqxqxxqxqqxqxqqxxxxxxqqxxxqqxxqxxxqxqqqqqxqqxxqxxqxxqqqxxxqxxqqxxxqqxxqxqxqqxxxqxxxqxxxxxqqqxqxqxxqqqqxqqqqqxqxqqqxxqxxqqxqxxqqxqqxqxqqqqqxxqxqqxxqqqqqqqqxxqqxqqqxqxqxqxxxxxxxxxxqxqxqxxxqqxxqqqxqqxqqqqxqqqxxqxxxqqqxxqqxqqqqqqqxxxqqqxqxxxxxxqxxqqqxqqqqxxxxqqqqqqxqxxxxxxxqqqqqqxqxqxqqxxqqqxxqxxqqqxqqqqxxxxqqqqqxqxxxqxqqxqxqqqxqxxxqqqqxxqxqxxqxqxxxxxqqqxxqqxqxqxxqxxxqxxxqqqqqxqqqxqqxxxqqqqqqqxxxxxqxxxqqxqxxqqxqqqqqqqqxqqqxqqxxqqqqqxqxqxqqxxqxqxxqqqxqqqqqqxxqxxxxqxqqxqxqqqqqqqxxqxqxxqqqqqqqqqxxxxqxxqxqqqqxqqxxqxqqqxxqxqxxxqxxxqxxxxxqxxqxxxqxqqxqxxqqqqqxxqqxqxxxqxxqxxqqqxxxxxxxqqxqxqqqxqxqqqqqqqxqqxxxxxxqqqxqqqqxxqxxxqqqqxqxxqxxqqxxqqxxxxqqqxqqqxxxqxxxqxxxqxqqxqqxqxqqqxqqqxqxqxxqqxqqqqxqxxxxqxqqxxqxqxxxqxqqqqqxxqqqxqxxxxxxxqxxxxxxxxqqxxxqxqqqqqqxqxxqqqqxxqxqqqqqxqxqqqxqxxxxqxqxxxxqqqqxxxxqqqxqqqxxxqqqqxqxxxqqxqqxxxqxxxxqxqxxqxxxqxxqxxqxxxxqxxxxxqqxxxqqqqxxxqxxqqxxxxqxqxqxxxqxqqxqxqxqqqxqqqxqqqqqqqxxqqxqxqqqxxxxqqqxxxxxqqqqqqqxqqqqxxxxxqqxqxqqxxxxxqqqxxxxqqqqxxqxqqxqqqqqqxqqqqxqxxxqxqqqxqxqxxxqxxqqxqqxxqxqqqqqxqqqxqxxqqxqqqqxqxxqqxqqxqxqqxqxqqxqqxxxxxqqxqxxqqxqqqxqqxxqqxxxxqxqqqxxqqxqqqqxqqqqxxqqqqxqqqxxqqxxxxxxqxxxxqqxqxxxxqxqxxqxxqqxxqxqqqxxqxqqxxqxxxqqqqxxqxxqxxxqxxxxxqqqqqqxxxqqxqxxqqxxxxqxqxqqqqqqxqxxqqqqxqqxqxxxxqxqxxxxqxqqqxqxxqqqxxxqxqxqxqxqqqxxqxqxxqqxxxxxxxxxqxxqqxqqxqxqxqxxqqqxxqqqxqxxxxxxxqqqxxxxxqqqqxqxxxqxxxqqqqqqqqxxqxxqqxxxqqqxqqxxxqqxxqxqxqqqxqxxqqxxxxqxxqxqqqqxqxxqqqqqxxqxqxxxqqqxxqqqxxxqqxqxxxqxxxxxqxxqxxqqqxqxxxqqqxqqxxxqqxxqqxqqqqxxxxxqqxxqxqxxxqqxxxxxqxqqxxxxqqqxxxqxxqxqxxqqqqqxqxqqxxxxxqxqqxxxxxxxqqqxqqqqxxqxqqqqxqxxqqxqxxqxxqxqxxqqxqqxxxqxxxxxqxxqqqqxqxqxqxxqxqqqqqxxxxxxxqqxqqxqxqqxxxqqxqxqqxxxqqxxxxqqxxxxxxqxxqxqqxqqqqxxqqxxxxxqqqxxxxxqqxxqqxqqqqqxxxqxqqxxxqxqqxxqqxqxxxqxxqxxxxxxxxxqxqxqxxxxxqqqqxqqxxxxqxxqqqqqqxqxxqxqqqqxqxqxxxxxqxxqqqxxqxxqxqxxqxqxqxxqqxxxqqxqqqqqqqxxqxqqxxxqxqxqxxqqqqxxqqqqxqqxqqxqxxqxxxqqxxqqqxxxxqqqqqxqxqxxqqxqqxxxqxxqqqxxqxxqqxxqqxqqqxxqqqqxqxxqxqxqqxxxqqxqqxqxqqxxxxqxxxxxxqqxxqqxqxxqxxxxxqxxqqxxqqxqqqxqxxqqqqqqxxxqqqqqqxxqxqxqqxqqqxqxxqxqqqqxxxxxqxqxxqxqqxxqxxqxxqqqxqqqqqxqqqqxxqxqqqxqxxqxxxxxxqqqqxqqxxqqxqxxqqqqqqqqxqxxqqxqxqqqxxxqxqqqxxqqxqqqqqqqqxqxqxqqxqxqqxxxqxqqqxxqqqxqqqxxqqxxxxqxqqqqxqxxxxxqqqxxqxxqxxxqxqqxqqxqqxxqxqxqxqxxqqxqqqqxxxqxxqqqxqqxxqqxqxqqqqqxxqxqqxqqqqqqqqqxxqxxxxqqxxxxqxxxxqxxqqxxxqqqxqqqqxxqqqxqxqqxqxxqqqqxxxqqxxqqqxxqqxxqqqxxxqxxqqqqxxxxqxxqxxqqxqqxxqxxqqqxqqxxxxqxxqqqxxqqqxxxxxxxxxxxqqqxxqxqqqqxqxxqqqqqxxqxxqqqqxxqxqxxxqxxxxxqqxxxqqqqxqxqxqxqxqqxqxqqqxxqqxxqqxxqqxqxqxxxqxxxqqxqxqxqqqqxqxqxxxxqqqqqxqqxxxxqqqqqqxxxqxqxqxxqxxxxxxxxqxqxxqxxxqqxqqxxqqqqqqxqqxqxxxqqxxqqxqqqxxqxxqxqxqxxqqqxxqxxqqxqxqxxqxqqqqqqxqxqqqqxxxqxxxqqxqxqxqqxqqxqqxqqqqqqxqqxqqqxqqxqxxqqxxxqqqxqxqxxqqqqqqqqxqxxqqxxqxqxqxqxqxqxqqxqxxxxqxxxqqxqqxxqqqqxqqxqxxqxxqqxqqxqxqxxqxqxxxxqqxxqxxxxxxqqxqqqxxqxqxqqxqxqxqqxxqxxqqxxqxqqqqxqxqqqqxxqqqxxqqqxxqqxqqxxxqxxqxxqxqqxqqxqqxqxxxxxqxqqqqqxxxxxxqxqxqqxxqqqqqqxxqqqxxxqxqqqxqqxxxxxxqxxqqqxxxqxqxqqxqxqqqxqxxqxqqqqxqqqqxqqqqqxqqxxxqxxqxqxxxxxxqqxqxxqxxqxqqxqqqxqqxxxxxqqxxxqqqxqxqqxxqxqxqqxxqxqxqxqqqqqqxxxqqxxxxqqxxqqxqxqxqqxxxqxxqqxxxxqxqqxqqxxxxxxxxqxqxqxqxxxqxqxqxxqxxqxqqqxqxqxqxqxxqxxxqqxqxqqqqqxqqqxqqqqxqqqqqqqxxqqqqxqqxxqxxxxqxqqqqqqqxqqxqqxqqqqxxxxqxqxxxqqxqxxxqxxxxqxqxqxqxxxxxxxxqxqqqqqqqqqxxqxxqqqqxxxqxxqxqxqxxqxqqqxxxxxxqqqqxxxxxqqxxxqxxqxqqqqxqqqxqqqqxxxxqxxxxxxxxqxxqqqxxqqqqqxqqxqxqxqxxqxxxqxqqqxqqxxxxqqxxqqqxxqxqxqxxqxxqqqxqxxxqqxxqxqqqxqxxxqxqxqqxxxqxqqxxxqqqqxxqqqqxqqxxxxxqqqxxxqxqqqqxqqxqxxxxqxqqxqqqqqqxxqxxxxqqqxqqqxxqxxxxqqqqxxxxxxxxqqqqqqxxxxqqxqxxxqqqxxxqxqqxqqqqxxqxqxxxqqxqqqxqqxxxxxqqqqqxxxxxqqqqxqxxxxxqqxqxxqqqxqxqxqxqxxxxqqqqqqxqqqqxxxqxqxxqxqqxxxxqqxqqqxxxxqxxqqxxxxxxxxxqxqxxqxqxqxqqxxqxxxqxqqxqxqqxqxxqqxxxxxqqxqxqxxxxxxxxqqqxqqqxqxxqxqxqqxxqxxxxqxqqxqqqqqqxqxxxqxqqqqxxqqqxqqqxxqqqxxxqxxqxqqxqqqqxqqqxxqxxxxxqqqqxqqxqqqxxqxxxqxxqxxqxxxxxqqqxqxqqxqqqxxxxqxqqxqqqxxxqqqqqqqqxqxqqqqxqqqqxxxqqqxqxqxqqqqqqxqqqqqqqxqxxqqxqqxxqxxqxqxqxxqxxxqqqqqxxxqqqqqxxxxxqqxqxxxqqqqxqqxqqxqqqqxqxqqqqqqqqqxqxqqqxxqqqqxqxxqqqxxxxqqqqqxqqqqqqxxqxxqxxxqxxqxxxxxxqxxqqqqxxqqxxqqqxqxqxqqqqqqxqxqqqxxxxqxqqxxqqqqxxqqqxxxqxxxxxqxqxxqxqqxqxxqxxqxqxqxxxxxxxxqxqxxqxqqqqxxxxqqqqqxxqxxxqxxxqxxqqxxxqqxxxqxqxxxqqxxxxqqqxxxxqxxxqqqxxxxxqxxxxxxqqxqqqxqqqxqxqqxqqqqqqqxqxqqqxxxqxqqqxqqxxxqqxxqxqqxxxqqqxqxqqqqxxqxxxxxqxqxxxqqxxxqxxxqqqqqqqxqxqxxxqxqxxxxqqxxxqxxqxxxxqqxqxxxqxxqqqxxxxqqxxxqxxqxqxqqxxqxqxqqxqxqxxxqqxqqqxqxxqxxqqqxqxxxxqxqxqxqqxqxqqqqqqqxxqqxqqxxxqqxqqqqxqxqxqxxxxqqqqxqqqqxxxxxxxxxxqxxxqqqxxqxxqqxqqxqxqqqqqxxqqqqqqxqxqxxxxxxqxqxxxqxxxqqxqqxqxqxqxxqxqqqxqqqxxxqqxxxqxqxqqqqqxqqqxxxqxqxqqqqqxqqxqqqqqxxqxxxxxqxqqxqxqxqxqqxqxqxqxqxqxqqqqqqxxqxxqqxqqxqqqqqxxxxqxqqqxxqqqqxqqxxxxxqxxqqxxxqxqxxxqqqxqqqqxxxxxqxqxqqxxqqqqxqqxxxxqqqqqqqxqxxxqxxxxqqxxxxqxqqqqxqqqxqxxxxqxxxqxxqxxxqxxqxqqqqxxqqqxxqqxxqxqqxqqqxqqxqqqxqqqxqqxqxxqxqqqqxqqqqqqqqqqxxqxqxxqxxxqxxqqqxqxqqqqxqxqqxqxqqxqqxxqxqxxxqxqxqqqxqqqqqxqxxxxqxqxqxqqxxqxqqxxxqqxqqqxqxqxxxxqxqqqqxqqqxqxqqxxxxqxqqqxxqxxqxqqxqqqxxxxqqxqqqxqqxxxxqxqxqxqxxqqqqqqxxxqxqxxqxxxqxqxxqxqxqqqxqxqqqqxqqxqxxqxxxqxxxqxxxqxqxqxqxxxqqqxxxxxqxxqqqqqqqxqxqqxqxqxqqxxqxxqxqxxqqqqxxxqxqxxqqxxxqxxqxxqqqqxxxqxqxqqqxxqxxxqxxxxqxxxxxxqxxxqxxxxqqxxxxqxxxxxqxxxxxqxxxqxqqqqxxqqxxxxxxqxxqqxxxqqxqxqqxxxxqqqxxqxxxqqxxqqxqxxxxqxxqxxxxqxqqqqqqxqqxqxxxqxxqqxxqxqxqqqxqxxqqqqxqxxxxxxqqxxqqxqxxqqxqqqqxxqqxxqqxqxxqqqxxqqxxxqxqqxqxqqqqxxqxxxqqqxxqxqqqxxxqxxqxxxxqxqxxxqxqqqxqxxxxxqxqqqqxxqqxxxqxxqxxxxxxxqxxqxxxqxqqxxqqxqqqxqxqqqqxqqqxxxxxxqxqqxqqxxqxqxxqxxxqxxqxxqxqxxqqqqqqxqqqxxqxqxqxqxxqxqqxqqxqxxxqqqxqxxqqxxxxxqqxxxxqqxxqxqqqxxqxqxqqqqxxqxqqxqqqqqxqqxxxxxqxxqxqqqqqxqqqxqxqqxxxxqqxqqqqxqxxqxqxxqqxqqxxqxqxqqxqxqxqxqxxxxxqxqqqqqqqqqqxxqqqqxqqxqqxxxxxqqqxqxqqxxqxxqqxxxxxqqxqxqxqqxqxqxxxxqqqqxqxxxxxqxxxxqxqxxxqxqxxxxqqxqxqxqxqqqxxqxqqqqqqqqxxxxqxqxxqxqxqxxqqqxqxxxqqxqqxxxxxqqxqqxxxxxqxxqxxxqqqxxxxqqqqqxxqqqxxxqxxqxxqxqxxqqxxqqqxqxqxxqqqqxxqxxxqqqxxqqqqxqqqxxxqqqxqxqxxxxxxxqxqxxxxqqqxxqxqqqxxqxqxxxqqxxxxqxqqxqqqxqxqqqxqqxxqqqxxxxxqqqqxxqxxqqxqxxxxqxqqqxxqxqqxxqxxxxxxxqqxqqxqqqqxxqqqqxxqxqqqqxxxxqqxxqqxqqqxqxxxxxxqqxqqqqqqqqxxqxxqqxxxqqxqqqqxqqxxxxqqqxqxqxxqqqxxqxxxqqqxqqqqxqqqxqxqxxqqxxqqqqxqqqxqxxxqqxxqqqxxqxxxxqxxqxxxxqxxqxqxqqxxxxxxqqqxqqqqxxxxqxqqxqxxqqqqxxxxqqqxxqqxxxqxxxqxqqxxqxqqxqxxqxxxxqqqxxqxxxqxqqqxxqxxxxxxqxxxqxqxxxxqqxqxxxqxxqxxxxqxxqqxxxqxqxqxqqqqqxqxxxxxqqxqqqxxqqxqqqqxqxxqqqxqxqqqqxqxxxxqxqxxqxxqqqqxxqxxxxqqqxxxxqxqxqqqxqqqqxxqqxqqxqqqxxqxxxqqqxqqxqqxqxqxxxxxqqqxqqqqqxqqxxxqxqqxxqxqqqqqxxxxqxxqqxqxxxqxqqxxqxxxxxqqqqxxqqqqxxqxxqqxqqxxqqxxqxqqqxxqxxxxxqxxqqxxxqqxqxqxxxxqqxqqqxxxxqqqxxqxxqqxxqxqxqxqxqxqxxqqxxxxqxqxqxxqxxqxxqqqxxqxqqqxxxxqxxxqxqxxqqxqqxqqxxxxxxxxxxqqqqqxqqxxqqxxqqxqqqqqqqxxqxxqqxxxxxqqqxqqqqqqxqxxqxqxxxqqxxxxqxxxqqxxqqxqqqxxxqqqxqxqqqqqqxxqxqqqqxxqqxqqqxxxqqqqxqqqxqxqxxqqxqqqxxxxxxxqqxqqxxxqqxxxxxxqqqxxqxqxqxxxqxxqxqqqxqqxxxxxxqqqqxqxqqqxqxqxxxqxqxqqqxqxxqqxxqxxqxxxxqxqqxxxqqxxxxxxqxxqqqqqqqqqqqqqqxxxxqqqqqxqqxxxqxxxqxqqqxxxxqqxxxqqqxxxqxxqqxqqxxxxqqxxxqxqxqqqxxqqxqqqqqqxqxxxxxqqxxqqxxxqqqqxqxxxxxqxqqxxqxxqqxqqqxqqqxxqqxxqqqxxxxqxxxxxqqqqxqxqqxqxqxqqxqxqxxxqxxxqxxqxxxqqxxqxqxxxqxqxxxqqxqxqxxxqqxqqxqqqqqqxxxxqqxxxxqqqqxqxqqqxqqqxxqxqqqxqxxxqqqxqxqxxxxxqqqxxxxqqqxxxqxxxxqxxxqqxxqxxqxqxxxqqxxxxxxqqxxxxxxxxqxqxqqxqqxxxxqqxxxqxxxxxxqqqxqqxxxqxxqxxxxqqqqqqxqxxxqxqqqqqqqxqqqqxqxqxxqqqqxqqqqqxqqqqxxxqxqqqqqqxqxqxqxqxqxqqxqqxqxqqxqqxqqxqqqxxqxxxqqqxqxxqqqqxxxqqqxqxxqxqqqqqxqxxxxxqxqxqxqqqqqqqqqqqxqxqxxxxqxqxqxqxqqqqxxqxqqxxqqxxxxxxxqxqqxqqxxxqxxqxxqxxxqqxxqqxxqqqqxqxxxqxxxqxqqxqxxqqxqxqxqqqxxqxqqqxqqqqqxxxxqxxxqxqxqqqqxxqqxxqxqqxxqqqqqxxxxxxqqqqqxqxxqxqxxqqxxxxxxxxxxxxxxxxqqqqqqqxxxxxqxqqxxqqqqqxxqqqqxqxxqxxxxqxqqqxqxqqxqxqqxxxqxqxqqxxxqxqqxqqqxqqxxxqxqqxqxxqxxxqxqqqqxqxxqxqqxqxxqqxqxxqxxxxqqqxqxxqqqqqxqqxxxqxxxqqxqxqqxxqqxxqxqxxqxxqxqxqxxqqqqxxqxxxxxxxxxxqxqqxxxqxxxqqqqxqqqqqqxxxqqxqxqqqxxqqxqqxxqqxxqqqxqxqxxqqxxqqqqqqxxxqqqxqqxqxxxxxqqqqxxqqxqxqqxxxxxxqxqxqxqqxqxqxqqqqxxxxxxqqxxxqxqqqqxxxqxqxqqqqxxqqqqqqxxqxqqqxqqxxqxxqxxxqqqqxxxqxqqqxqqqxxqxqxxqqqqqxxxqxxqqxqqqqxxqqqqxqxqqxqqqxqqxxxxxqxqqqqqxxxxqqxxqqqxqxqqqqqxqxxqqxqqxqxxqxqqqqxxqxqxqxqxqxxxxxxqqxxxqqxxxqqqqqqqxxxqqxqxqxxxxxqxqxxqxxxxxqqqxqqxqxxxqqqxxxqxxqqqqxqxqxqxqqqqqxqxxxqxqxxqxxqxxxqqqxqxqqqqqxqxxqqqxxxqxqxqxqxqxqxxxqqxqxqqqxxqxxqqqqqqqxqxqxxxqxxxqqxxqxqxxqqxqxxqqxqqxqqqxqxqqqqqxqxxqqqxxxxqqqqqxqxxxqxqxxqxqqqqqxqxxqxqqxxqqqxxxqxxxqxxxxqxxqxxqxxqqqqqqqqxxqxqqxqqxqxxxqxxqxxqqqxxxxxqxqqxqxxxxxqxxxxxqqqxqxqxqqqqqxqqxqqqqqxqqqxqxqqqxxxxqqxqqxqqqqqxxxxqqxxqqqqqqxxqqxxqxxxqxxqxqxqxxqxxxqxqxxxqxqqxxqxxxqqqxqxxqqqqxqqqxxqqxqxqxxxxxxxqqqqqxxxqqqqqqqqxxxxqxxqqqxqqxqxqxqqxqxqqxqxxxxxxxxqqqqqxqxqqxqqxqqxxqqxxqqqxqxxxxxqxxqxqqxqxxqqxqqxqxqxqxqxxxxxxqxxqqqxxqqxqxqxxqxqxqqqxxxxxxxxxxqxqxqqqxqxqqqxqqxxxqqqxqqqqxxxqqxxxqxxqxxqxxqqqqxqxxxqqqxqqxqqqqqqxqxqqqxxxxxqxxqqxxqxqqqqxqxxxxqxxqqqqqqqxqqqxqxqxqxxqxqxxqqqxxxqxqqxqxqqqqxxqxxqxqqqxxqxqxxqqqxxqxxqxxqqqqxxqqxqqxqxqqqqqqxxqqxqxqxqqxqqxqxqqqqxxxqxxxqxqqxxqxqqqxxqxxxqqxxxqqqqqxqqqxxxqxxxqqqqxqxxqqxqqqxqqqxxqqqqxqqqxxxqxxxqxxxqqqqxxxqqxqqqxqxqxqxqqqqqqqxxxxqxqqqqqqqqqqxqxxqxxqqxxqxxxqqxxxxxqxxxxxxqxxxqxqxxxxqxqxqxqqqqxxqxqqxxqxxqqqxqqqqqqxqqxqxqqqqqqqqxxqxxqxqxqqxqqxqxqqqxxxxqxxqxqqxxxqxxqqqxqxxxxxxxxxqqxqxqxxqxqxxxxqqxqqqqqxqqxxqqxxxxxqxqqqxxxxqqqxqqqxqqqxqxqqqqqqqxqqxqqqqxqqqxqqxqxqxxxqxqqqqqqqxxxqqxxxxxqqxqxxxxqxqxqqxqqxxxqqqxqqxqqxqqqqqqxqqxxxxxxxqxqqqxqxqxxxqxxxqxxqxqqxqqqxqqxqqqqqqqxqqqqqqxxxqqxxqqqxqqqxxqqxqqxxxxxqqxqxxqxxqqqxqqxxqqqxxxqxqqqxxxqqqqqxxqxqxqxqqqqxxqqqxqqxxxxxxqqxxxqqxqxxxqqqqxqqxxqqxxxxqqxqqqxxqxxqqxqqqqqxxqxxqqxxqxxxxqqqqqxqxxqqqxqqxqqxqxxqqxqxxxqqqxqxxxxxqxxxxqxxxxqxqxxxxqxqqxxxqxqqqxxxqxqxqqxxxqqxqxqxxqqqxxxqqxxxxqxqqqxqqxqqxxxqxxqqxxqqxqxxqqqxxxqxqxxxxxqqxxqqxxxqxxqqqqqxqqxxxxxqqqxxxxqxxqxxxxqxqqqxqqxqqxqxxqqxxqxxxxqqqqqqxqqxqqqqxxxqxqxxxqqxqxqqqxxxxxqqqxxqxxxxxqqxqxxqqqqxxxxxxqqqqxxqqqxxxqqqqqxxqxxxxxqxqxqxxxxqxqxqxqxqqxxqxqqqxxxqqxqxqqxqxqqqxxqqqqxqqxqxqxxxxxqxxqqqqqxxqqqqxqqqqqqxqxqxqxxxxxqxxxxxqxqqqxxxxxxxqqxxqxqqqqxqxqxxxxqqqqqxqxxxqxqqqqqqqxqqqxxqqxqxxqxxxqxxqxqqqxqxqxxqxxqxqqxqxqqxxqxxqqxxqqqxxxxxqqxxqqxqqqqqqxxqqqqxxxqxxxxxqqxxxxxqxxqxxqxxxxxxqxqxqqxxqxqxqqxxqxxxxxxxqqqqxxqqxxxxqqqqxxxxxxxxxxxxxqqxxqqxqxqxxqxqqxqxqqxxxxqxxxqxxqqxxxxqqxxxqxqxqqxqqqxxqqxqqxxxxqqxxxxqxqqxqxxqqxxqqqxqqqqxqxqxxqqqxxxqxxxxqqqxxqqxqqxxxqxqqqxxqxqxxqqqqqqxxqxxqqqxqqxqqqxqxxxqxxxqqxqqxxqqxqxxxqxxxxqqxxqxqqxxqqqxqxxxqxqxqxxxqqqqqqxxqxxxxqxqqqxqxxqxqqqqxxxxqqxxxxxxqqxqqqxqqxqqxqqxqxxxqqqqqxxxqxqxqxxqxqqqqxqqqqqqqxxxqxxxqqqxqqqqqxqxxqxqqxqxqxxxqxqxqxqqqxqqqqqxqxxqxqqqqxqxqqqxxqxxqqxxxqxqqqqqxxxxxxxxxqqqqxqxqxxxqqqxqqxqqxxxqxqxqqxxqxxxxxxqxxxqxqqxxqqqxqqqxxqqqxqqxqqqqxqqqqxxqxqxqqxqqqxqxqqqxxxqxxxqxxxxxqxqxxqqqxqxxqqqqxqxqxxxxxqqqxqqxqxxqqxqqxqqxxxqqqxxqxqxxqqqxqqqxxqxqxxxqqxxqxxxqqqqqxqxxqqqxqqxqxxqqxqqqxqqqxxxxxxxqxxxxxqqxqqxqqqxqqqqxxqqqxqqqxqqqqxqqxqxxxqxxxxxqqxxqqqqxxqxxqqxqxqqxqxqqqxxqxxqxqxxxqxqxqxxqqqxxqqxqxqqxqqqxqxqxxxxqqqxqxqxxxqxqqqxqqxxqqxxxqxqxxxqqxxxxqxxxqqxxqxqqqxxxxqqxqqxqqqqxxxqxqxxxxxqxqxqqqqxxxqxxqqxxxqxqqxxqxxxxqxxqqqqqqqxqqqxxxxqxxxqqxxxqxxqxqqqqqxqqqqqqxqxqqxqxqqqxxxqqxxxqqqxxxxxxqxxxqxxqxqxqqqxxxxqxqxqxqxqxqqqqxxqxqxxqqqxqqqxxqqxxxqxqxxqqxqxxqqxqqqqxqqqxxqxqxxxqxxxqqxqxxqqxqxxxqxqqqqxqxqqqxqqqxxxxqqqqxxxqxxqqqxxqqqxqqqqxqqxxqqxxqqxxxxxqxqqqxqxqqxqxxxxqxqqxqqqxxxqxxqxxxqxqxqqxxqqxxqqqqqxqqqxqxqxxxxxxxqxqxxqxqxqxqxqxxqxxqqxqxxqxqqqqqxqqqxqqxxxxqxqxxqxxqxxxxxxqxqxxqxxqxqxxqqxqqqxxxxxqxqqxqxxqqqqqqqqxxxxqqqqxxqqqxqxxqxqqqxxxqqxqxxqqxqqqxqxqxxqqxxqqxqqqxxxxqqqxqxqxqxxqqxxxqxxxqxxxxxqqqqqqqxqxqqqxqxqqqqqxxqxxxxqxqxqqqxqqqqqqqqqxxxqqxxqxxxxqqxqxqxxqqqxqqxxqqqxxqxqxxqqxqqqqxxxxqqqxqxxqxqxxxxxxxxqxqxxxqqqxxxxxxqxqqxqqqqqqqxqqxqqqqxxqqxqqxqxqqxxxqqqxxqxxxqqqxxxqxxqxxxqqxxqxqqqqxqqqxqqxqxxxxqqxxxxqxxqxqxqqqxqqqxqxxqqqqxxxxxxxxxxxqqxxqqxxxxxqxxxxxxxqxqxqqxqxqqqxxxqxxqxxxxxqxqxqxqxxxqxqxxqxqxqqxqxqqqqxxxqxqxqqxxqxqqqqqxxqxqqqqxqqqqqxxxxxqxqxqqqqqxxqxqqxqqqxqqqxxxqxxxqqxqxxxqxxxxqxqqqqqxxxqqqqxxqqqqxxxqxqqqqqqqxxqxqxxxqqxqqqxqqxxxxxqqxxqqxqxxxxqqxxxqxxxqqxqqxqqxxxxqxqqqxxxxxqxqqxxqqxqxxxqxqqqqxxqxxxqxxxxqxxxxqxxxqqxqqxxxxxxqqxxqqxqxxqxqxxqxxxqqqqxxxqxxqxxqqxxxxxqxxqxqxxxqxxxxqqqqqqqxqxxqxqxqqxxqxxxxqxqqxqqqqqqxqxqqqqqxxxxqqqqqqqqxxqqxqxxqxxqxqqxqqqxqqqqxqqxxxxxqxxqqqxxqqqxxqqqxxxqxqxxqqxxxqxxxqqqxxqxqxxxxqxqxxqxqqxqqqxxqqqqxqxqqqqxxqqqqxxxqqqqxqxxqqqxqqqqxqxxqxqxxqqxqqxqqxxqxqxqxxqxxqqqqqqqqxqqqqqxxxqxqxxqxxqqqqqxqqxqxxqxqxxxxqqqxqqqqqxqqqqqqxqqqqqxxqxqqxqqxqqqqqxqxqqqqxxqxxqxxxxqqxxxxxxxxxxqqqqqxqqxxxqxxxxqxqqxqqqxqqqxxqqxqqqqqxxqqqqxxxqqxqxqqxxxxxqxxxxxqqxqqqxxxqxqxxxqqxxxxxqqqqxxxqqqqxxxxxqxxxxxqxxqqxxxxxqqqxxxqqqxxqxqxqqqxxqxxqxqxxxxqqxxqxqqxqxxqxqxxxxqxqqxqxqqqxqxxqqqqqqqqqqqxxqqxxqqxxxxxqxxqqxqxxqxxqxxxqqqxqxqqxqxxqqxxqxqxqqxqqqxxxqxxxqqxqqqxxxqqxxxxxqxxxxqqxxxqxqqxqxxxqqqqxqxxxqqxxxxxxqxqxqxxqxqxxqxxxxxxqxqqxqxxqqxxqqxxxxxxxxqqqqqxxxxqxqxqxqqqqxxqqqqxxxqqxxxqqxxqqxqqqqxqqqqqxxxxqqqxxxxqqxxxqxxxxqxqxqxqqqxxqxxqqxxxqxqqqqqxqxqqxqxqxqxqxxxxxxqxxqxxqxxxqxxqqqqqqxqxxqxxqqqqxqxxxxqqxxqqqqxqxqqxqqqqxxqxqxqqqxqxxqxxxqqqxxqqxxxxqqqxqqxxqxxqqqqxqxqqqxqqqxqqxqxqxxxqqxqqqqqxxxqxxxqxqxxxxqqqqxqqxxxxxqqxqqxxxqqqxxqxqqxxqqqxqxxxqxqxqqxxqqqqqqqxxxqxqqqxqxxqxxxqxqqxqqxxxxqxxqqqxqqxxqxxqxqxqxqxxqxxqqxxqqqqqqxxqxxxqqqxqqxxqxqqqxxqxqqqxxqqxxqxxqxqxxqqqxqqxqqqqqxxqxxxxqxqxxxxqxqxqxqxxqqqxxxqqqxqqqqqqxqqxqxxxqqqqqqqxqqqqqxqxxxxxxxxqxxqxxxxqqxxxqqxxqqxqxqxqxqqqqqxqxqxqxxqqqxxxxxxqqqqxxxqqxxqxqqqxxxqxxxxqqxxqxqxxqxxxxxxqxqqqqqxqxxxqxxqqxxxqxxxxxqqxxqqxqxqqqqxxqxqxxqxxqqxxxqqxxxxqxqxxxxxqxqxqxxqqxxxqqxqqqxqqxqxqqqxqqxqqxxqxqqxqqqqxqqxxxxxqqqxxqxxxxxxqqqxxqqxqxqxqxxqxqxqxxqxqxxxxxxqxxxqxxxqqqqxqxqxxxqqqxqxqxqqqxqqqxxqxxxqxqqqxxqxxqqxxxqqxqxqxxxxxqqqxxqxxxqqxxqxxqxxxqxxxqxxqxqxxqqqqqqqqxqqqqqxqqqxxqxqxqqxxqxqqqqqxqqqqxxxqqxxqxxqxxxqqxqqxxxqqxxxqxqxxqqqxxqqqxxxxqqxqxqqxqxxqxqxqxqxxxxqqxxxxqxxqxxxxqxqxxxqxqxqqqxxxqxqxqqqqxxxxxxqqxxqxxqxqxqqxqqxxxxxxqqxqqxqqxxqqxqxqxqxqxxxqqxqqqxxqqxxqqqqxxqxxqxxxxxqqxxxqqxxqqxqqqxxxxxqxxqqxqxqqxqqxqxxxqqqxqxxxxqxxxqqxqxxxqqxxqqxxxxxqxqxxqqxxxqxqqxqxqqqqqqxxxxxxxxqxqxxqxxqqqxqxqxxxxqqqxqxxqxqxqqxqxxqqxqqxqqxqxqqqxxqxqxxxxxxxxxqqqqxqqqqqxxqqqqxqqxqqxxxxxqqqqqxqqxxqqqxqxxxqxxqxqxxxqqxqxxqxxqxqqqxxxqxqxxxqxxqxqxxxqqqxxxxqxxqxqqqxxqqqxxxqxqqqqqqxqxxqxxxxxxqxxxxqxqxqqxxqxxqqxxxxqxqxqqqxxqxqxxxxxxqqqqxxxqqqqqxxqqqxxqqxxqxqqxqxxqqxxqqqxqxxxxxqxxxxqqxxqxqxxqqxqxqqxxxqqqqxqxxxxxxxxqqqxqxxxxqxxxqxqxqxxqxqqxxqxqqxxqxqqxqxxqqxqxqxqqxxxqxxqxxxqqqqxxxxxqqxxxxxqxxxqqxxqxqqqxqxxqxxxqqqxqqxxqqqxxqxqqxxqqqqqqxxxxqqxxqqxqqqxqxxxxxxxqxqqxqqqxqxxxxxqqxxxqqxqqqqqqqqxxxxqqxqxqxxqqxxxqxxxqxqxqqqqxqqqqqqxqxqqxxqqxqxqqqqqxxqqxqqxqqxqxxxxxqxqxxxxxqxxqxqxqqxxxqqqqqxxqqxqxqqxxxqqqxqxqqxqxqxxqqqxqqqxxqqqqxxxxqxqqxqxxqqxxxqxqxqqqxqxxxqxqxqxxqxxqqxxqqxxqxqxxxxqqqqxxxxxxxqxqxxxxxqxxqqxqxxqxqqqqxqxqxxxqxxqqxxxxqqqxqqxxxqqxqxqxqxqqqqxxxqxqqxxqxxxqqqqxqxxxxxxqqxxxqxqxqqqxqqqxxxqqxqqqxqqxxqxxqqqqxqxxxqxqqxxxxxxqqqxxqqqqxqqxqqqxqqqxqxxqqqqqxqxxxxqqxqxxqxqxqxqxqqxxxqqqqxxqqqxxxqqxxqxqqxxxxxqqxqqqxqqxxxxqxxxqxxxxqxqqxqxxqxqqxqqxxxxxqxxxqqxxxxxxqxqxqxxxxxqxxxqqxxxqxxxxxqqxxqxxxqxxxqxqqqxxqxxxxxqxxxxqqxxqxqqxxqqqxqxxqxqqqqxxqxxxqqqxqxqqqqqqqxxqxxqqxqxxxqqqxqxqqxxxqxxqxxxxxxqxxxxqqxxqqxxqqxqqqqqqqqxxqxqqqxqqxqqqqqxqqxqxqqqqxxxqxqxqqqqqqxqxqqqqqqxqxxqxxxqxqxxqxxxqqqqxqxqxxxxqxqxqxxxqxxqxxqqxqqxqqxxxqqqqqqxqqqxqxqxxxxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqqqxqxxxxqxqxxqxqqxqqqxqqqxqxxqqqqqxxqxqxxxxqxxxxxxqxxqqxxxxqqxxxqxqqqxqqxxqxxqxqqqxxqqqqxxqqqqxqqxxqqxqxqxqxxxqxxqxqxxqxxqxqxqqxqqqxqxxxqxxxqxxqqxxqqxxqxqxqxxxxxqxxqqxqqqxxxxqqqxqqxqqqxxxqxxxxqqqqxxqqxxxxqxxqqxxxxxxqxqqqxxxxxqqqqqqqxqqqxxxqqxqqxxqqqqqxqqqxqqqxxqxxqqqxxqxqqqxxxqxxxxxqxqxxqxxqqxxxxqqqxqxxxxqqqqxqqxqxqxxqxqxxqxqqxqqxxxqqqqqxqqxqqxxxxqqxxxqxqqxxqqqxxxqxxxqxxqxqqqxxqqqxqqxxqqxqqqxxqqxqxxqxxxqxqqqxqxqqqqxxqxqqqxqxxqqqqqxxqqxxqxqxqxqqxqqxxqqqxqxxqqqqqqxxqxqxqqxxxxxqqqqqxxqqxxqqqqxqxxqqqqxxxxxqxqqqxqqqxqxqqxqqxxxqxxxxqqqxqxqxqqxxxxqqqqxxxqqqxxxxqqxqqxqqxxxqxxqxxqxxqqqqxqqxxqqqxxxqxqqxxxqqqqxqxxqqxqxxqxqxqqxxqqxxqqqqxxqxqqxqxxxqxxxqqxxqqxxqxqxxxqxqxqqxxxxxqqqqqxqqqqqxxxxqxqxxxxxqxxqqqxqxxqqxqqqqxxxxqxqqxqqqxqqqxqqqqqqxqqqxxxqqxqqqqxqqxqxqqqqqqxqxqqxxxxqqqxxqqqqqxqqxqxqxxxxqxxxqxxqqxxqxqxxxxxqqxqqxqxqxxxxxqxqxqxxxqqxqxxqxxxqxqxqqxqxqqxxqqxxxxxxqqxxqxxxqqxqxqxxxqqxqxxxxqxxqxqxxxxqqxxxqqqxqxqqxqxxqqqqxqqxqxqxqxxqqqqqxqxqxxqxqxxqqqxqqqxxxxxxqqqxqqxqxxqxxxqqqxxxqxqxqqqxxxqqqxxxxxqqxxxqqqqqqqxxxxxxqxxxqqqqxxxxxqxxqqqqqqxqxqqxqxxqxqxqxqxxxqqqqxxxqxqqxqqqxxxqxqxqqxxxqxxxqqxqqxxqxxqqxqxxqqqqqxxqxxxqqxxqxqqxxxxxqqqqqqqxxxxqqqxqqxxqxqqqqqxqxxqqxqxxqxxqxqxqqxqqxxqqxqqqqxxxxxqqxqxqqqxxqqqqqqqxxxqqqqqqxqxxxqxqxxqxxxxxqqqxxqxqxxqqqqqxxxxxqxxqxxqxxqxxxqxqxqxxxqxxxxqqqqxxxqqqxqxqqqqqxxxxqqqxqxqxqqxxqqqxqxqxqxxqxqxxqxqxqxqxqqqqxxqqxxxqxxqqxxxqxqqxqqxqxxqxxqqqxqxqqxqxxxqxqqxxqqxqqxqqxqxxqqxxqxqxxqqqxxqqxqqxqxqxxxqxxqxxqqxxqxqxxqxxxxxqxqqqqqqqxqqxxxqqqqqxxxqqxxxxxqqqxxxxxxqxxqqqxxxxqqxxxqqqxqxqxxxqxxqxxxqxxxqxqxqqqxxqqqqxxqqxqqxqxqqqqqxxxxxqxxqqqqqqxxxqxxqxxxqxqxqqxqqxqqxxqxqqxxqxqqqxqxxxxxqqqxqqxqxxxxqxxqqqqxqxqxxxxxqqqqqxqqqxqxqqqqqxxxqqxxxqxxqxxxqxqqxqxqqxqxxxxxxxxqxqxxxqxxqxqqqxqxqqqqxqqqxqxxxqxqqxqxqqqxqxqxxqqxxqqxqxxxxqxxxqqqxqqxxqqxqqqqqqxqqqqxxxxxxxxxxxqqqxxqxxxxqqqxqqqxxqxqxqqqqxxqqxxqqxxxqqqqxqxxxxxxxxxxxqxqxxqqxqqqxqqqqxxxqxxqqxqqxqqxqqxxqqxxqqqxxqxqqqqqxqqqxqqqxxxqxxqxxqqqxqqqqxqqqxqqqqqxqxxqxqxqxqqqqxxqqqxxqxxqxxqqqqxxqqxxqqqqqqqxqxxxqqqxxqxqqxqqqxxqqqqxxqqxxqxqqqxxqxqqqxxxxxxqqxxxqqqqqqqxqxxxxqxqxqxqqqxxqqqxqqxxqqxxqqqqqxqxxqqqxxqxxqqqqxxxxxqqxqqqxxxxxqxxqqqxqxxxxxqqqqqqqqxqqxqqxqqxxxxxxqxqxqqqxxxxqxxqxqqqxqxqqxxqqxqxqxqxqqqxxqxxqxxxqqxqxxxqqqqqqqqqqqqqqxqqqqqxxqxxqqqxqqxqxqqqxxqxxxxqqxqxxxqxqqxxqqqqqqxxqxqxqqxqxqxqqqqxqqqqxxqxqqqxqxqqxqqxxxxxqqxqqxxxxxqqqxxqqxqqxxxxqqqqqxqxqqqxqqqxxqqxqqqxxqxqxqqqqxxxqxxxxqqxxxxqqqxxqxxqqqqxqqxqqxqxqxxxqxxqqxxqxqqqqqqxxxxxxxxqqqxqqxqxxxqxqxqxxqxqqqqxqxqqxqqqxqqqxqqqxqqxxxqxxxxqxxqqqxqqqqqqxxqqqxqxqxxqxqxqqqqqqxqqqxxxqxxxqxxxxqxqqxxqxqxqxxqxxqxxqqxqxxxqxxxxqxxqxqqxxxqqxqxxqqqxqxqqxxqxxqqqxxqxxqqxqqxqqxxqqxxqxqqxqxxqxqqxxxxxqxxqxqqqqxqqxqqxqxxxxqqqxxxxxxxxxxxxqqxxqxxxqxxqxxqxqxqxxqqqxxqqqqxqxqxqqxqxqxxqqqxxxqqqxqqqqqqqqxqxqqxxxqxxqxxqqqxqxxqqqxxqqxqxxqqxqqxxqqxxxxxqqxxxxxqqxxxxxqqqxxqxqxxxxxxqqxqqqxxqxxxxqxxxxxxqqxqxxqqxqxxqqxxqqqxxxxxqxqxqqxqqqxqqxxxxqqqxxqqxxxxxqxxqxqqxqxxxxxxqqxqxqqqxxxxqqqqqxqqxxxxxqxqqqxqxxqqqqqxqxqqqxqxxqqxxxqqqqxqqxqxqqqxxqqxqqqqxqqqxxqxxqqxxqqqxxxqqqqxqxxqqqqqxqqqxxxxqqxxqxxqqxqqqqxxqxxqqxqqxqqqqxqqqxxxxqqqxxqqxqqqxqqqxqqxxqxqxxqqxxxxxxxxqxxqqqxxxqqqxqxxqxxqxqqxqqqxxxxqqxxqqqqxqxxqqxxqqxqxqqxqxqqqxxxxqqxxxxxxqxxxqxqqxqqxqxxxxqxxxxxqqxqqqqxqxxxqxxqxxxxqqqqxxqqqqxqqqqqxxqxqqqxxxqxxqxxqqqxxxqqxxxqqxqxqqxxqxqqxxqxxqqxxxxxxxxxxqqxqqqqqqxqqqxqxxxxxqqxxqxqxqqxqxxqqxqqqqxqqqqxqqqxqqqqxxqqqxxxxxqqxqqqqqxxxqxqxqxqqxxxxqqqqqxxxxqxqqqqxxqqqqxqxxxqxqxqqqxqxxqqxxxxxqxqxxxqxxxqqxxxxxqxxxqxxxqxqxxxqqqqqqqqqxxqxqxxqqxxqqxqqxqqxqqqqxxxxxxxqqxqqqxqqqxqxqqxqxxxxxqqqxxqxxqqqqqqxqqqqxqxqqqqqxqxqqxxqqxxqxqqqxxxxqxqqxqxqxqqqqxxqxqqqxxqqqqxxxqqxxqqxqqxqqqqxxqxqxxqxxxqqxxqxxxxxxxxxqxqqqqqqqxxxxxxqqxqxxxxqxqxqqxqqxxxxxxqxxxqxxqxxqqqxqqqqqqxxqxxqqqqqxqxqxxxqxqxqqxqqxxqxqqxqxxqxxxqxxxxqqxqxqqqqxqxxqqqxxxxxxxxxxxqqxqqqxxxqxxqqxqqxxqqxqxxqxqxxxqqqqqqqxqxqqqxqqqxqxqxxqqqqxxxxxqqxxqxqxxxqxxqqxqxqxqxxqxxqqqxqxqxxqqxqqqxqxqqxxqqqxqqqqqqqqxqqxxqqxxxxxqxqxxqqxxqxqqqxqqqxxxxxqxxqxxqqxxqxxxxxqxqqqxxqqqxxxxqxxqqxqqqqqxxqxxqqxqxqxqxxxqxqqxxqxxxqxxxxqqqxqxqqxqqqqqxxqqqxqxqqqxxxxxqxqqxqxqxqqxqxqxxxxxqxqqqqqqxxxqxxxxxqqqxqxxqxqxxxxqxxqqqqqqqxqqxxxqxqxxxqqxxxxxqqqxqxxqxxqqqxxqxqqxxqxxqxxxxxqxxqqqxxxxxxxxxxxxxxxqxqxqqqxqxxqqqxxqxxqxqqxxqxqqxqxqqxxqqxxqxqxqqqxxqqqqxxxqxqqqqxqqxxxqqqxxxxqqxqqqqxxqqxqxxxqqxxqqqqqqqqxxqqxxxqxqxqxxqxxxxqqxqqqxxqxxxqqqxxqqqxqqxqxxxxxqxqxxxxqxxxqxqqxqqxqqqqxxqxxqxxxqxqqxxxxqxxxqxqqqxxqqxqxqxxqxqxxqqqxxqxqxxxxqqxxqxxqqqxxqqxqxqqqxqqqxxqxxxqxxqqxxxxxxxqxxqqxqxxxqxxqqxxqxqqxxqxxxxqxqqxqxxxxqqqqqxxxxxxqxqxxxqqxqqxqxqqxxxqqqxqxqqqqqqqqxqqqxqqqqqqxqqqxxxxqxxqxxqqqxxqqxxqxxxqqxxxxqqqxqqqqxxqqxqxqxxqqqxxqqqqxxqxxxxqqxxqqqxqqqqxxxqqxxqxxxxqqxqxqqxqqqqqxxxqxxxxqxqxqqqxxqqxqxqxxqqxqxxqxxxxxxqxqqqqxxxxxqqqxqxxxqqqqxqxqqqqqqxqxqqxqxxqxqqxxqqqqxxxxxqxqqxxxqqxxxxqqxqxxqqqxqqxxqxxxxqqxqqxqqqqxqqqxxxqqqqqqxxqqxxqqxqqxqqxqxxxxqxxqqxxxqxqqqqqxxxqxqxxxxqxqxxqqxqxqqqxqxqqxqxxxxxxxqqxxqqxqxqqxxqqxxqxxqxqxqqxxxqxxxxxqxqxqxqqqxqqxxqxxxqxqqqxxxxqxxqxqqqqqxxqxqqxqqxxxxqqqxqqqqqxxqxxxqxxxqqxxxqqqqxqxqqxxqqqqqqqxqxqxqqqqxxqxxxxxqqqxqqqqxqxxxxxqqxxqqxqqqxxxxqxxqxqqxqqqqxqqxxxxxxqqqxqxxxqxqxxxqxxxxxqxxqqqqxxqxqqqxxqxxxqxqqxqxqqqqqqqxxxqqqxqqqxqqxqxxxxqqqxqqqqxxxqxxxxqqxxxxxxxxxqxxqxxqxqxxqqxqxxqxqxqqqqxqxqxqqxqxqqxqxxqxxxxxqxqqqqqxxxqqqqqqqqxqxqqxqqqqxxxxqxqxqxxqqqqqqxqqxxqxxxqqqxxqqqxxqqqqxxqxqqxqqqxqxxxqqqqxxqxqxxqxxqqxxxxqqxqqqxxqqxqxqxqqqqxxxxxqxxxqqqqqqxxxxqxxqqqxqxxqqqxqqqqxqqqqqqqxxxqqxqxqqxqxqxqqxxqxqqxqxqxqxqqxxqqxqqqxqxqxxxxqxxxqqqxxxxqqxqqqqxqqqqqqxqxxqxqxxqqxxqxqqxqxxqxqxxqxxxxqxxqqxxqxxxxxxxxqqxqqxxxxxxxxxxxxqqxxqqqqqqxxqqxqqqqxxqqqxqqxxqqqqqqqqxqxxqxxxxqqxqxqqxxxxqxqxqqqxxqxqqqxqqxxqqxxxxxxxqxxxqqqxxqxxxxxqqqqxqxqqqqxqqqxqqxxxqxxqxqxxqxxqqxqxqqxqqxqxqxxxqxxqqxqxxxqxqqxqqqqxxxqqqxqxxxqxqxxxxxxqxxqqxqxxqqxxxqqqqxxqxqqxqxqqqxxqxqxxqxqqxxxxqxxxxxxqxqxxxqqqxqxqqqxqxqxqxxqqqxxqqxxqqqqqqxxxxqxqxxxxxxqxqxqqxxqxxqxxxxxqxqxxqxxqqxqqqxxxqxxqxxqqqxqqxxxxqxqxqqqqqxqqqxxxxqxxxxxqqqqqxqqqqxqqqqxxxxxqxxxxxxxqxqqqxxxqqqqqqxqxxqqqxqqqxxxqxqxqqqxqxxqxqxxxqxqqxqxxqqqxqxxxxxxqxxqqqxqxxxxxqqxxqqxxqxxqxqqqqxqxqxqxqxqqqxqqxqqqqqqxxxxxqxxxxxxxxqqqxxqxqxxqqxxqxxxxqqxqqxqqqxqqxqqxqqqxxxqxxqqqxqxxxqqqxqxqxxxxxqxqqxqqxqqqxqqqxxxxqqqxxqxqqxxqxxxqxqxxxxxxqqxqxxqqqqxxqqxxqqxqxxqqxxqqqqxqqqxxxqxxqxqqqqxxqxxqxqxqxxxxqxqqqqqqqqxqqxxqxxxqqxxqqxxqqxxxxxqqxqqxxxqqxqxxqqqxxqqqxxxxqxqxqxxqxxxxqxqxqqxqxxxqqqxxxqxqxxqxqxqqqqqqxqqxqxxxxqqqxqqqqqxxqqxxxxxxxxxqxxqqqxxxqxxqqqqxqqxqxxxqxqxqxqxxxqxqxxqqqxxqqxxqqqqqxqqxxxqxqqxxxxqxxxxqxxxqxqxqqxxqxxxqqqqxqqxqqxxqxqqxxxxxxxxqxqqqxxqxqxxqqqxxqxqxxqxxqqxxqqqqqxxqxxqxxxxqxxqqxxqxxxxqxxqqqqqqxqxxqxxxqxqqxxqxqqqqqxxxqqxqxqxqqqxqxxxxqxxxqqxxqxqqxqxqxxqxqqxxqqxxqqxxxqqxqxxxqqqxqqxqxxxxxqqqxqqqxxqqxqqqxxqxxxxxqqqqxqxxxqqqqqqqxqxxxxqxxxqqqqxqqqxqxqxxxxqxqxxxqxqqqqqxqxqqqqqxqxqqqxxqxqqxqqxqxxxxqqqxxxqxxqqqqxxqxxqxxqqxxxqqxxqxxxqqxxxxqqxxqqxxqqqqxxxqqqqxqxqxqxxxqqqqxxxxxqxqxxxxqxqqqqqxqxqxqxqxxxxqqxxxqxxxqqqxxxxxxqqxxqqxxqxqqqqqqqqxxxxxqqqqqxqqxqqqxxxqxxxxxxqqqqqqxxqxqqxqqqqxxqxxqqqxxxxqxxxqqxxxqxqxqqxxqxqxxxqxqxqqqxxxxxxxxxqqqqqxxqxxqqqxqxxxqxqxqqxxxxqqxxxxqqxqqxqqqxqxxxxqxxxxxqxxxqqxqxxqxxxqxxqxxxxxqqqqxxxxqqqxqqxxxxxqqxqxqqxqxxqqxxqxqxxxqqxxxxqqxqxqxqqxxqqqqxxxxxqqxqxqxqqqqxxqqxxqqqxqxxqqqxxqqxxqqxqqxxqxxqxxqqqxxqxqxxxqxqqxqqqxqqqxxqqqxqxxxqxqxqqqxxxqxqqxxqxxqxxqqxqqxqxqxxqqxxxqqxxxxxqqxxqxqxxqqqqxxqxxqxxqxxxxxqqqxxxqqqxqqxqxxqqxxqqqxqqxqqqxqxqxqqxxxqxqxxqxqqxxqxqxqqqxqqqqxqxqqqqxqxxxqxqxqqqqxqxxxxqxxxqqqxqxqqxqqxxqxqqqxqxxqxxxxqxxqxxxqqqxxqxxqxxqqxqqxxxxqqqxxxxqqxxxqqxxqxxxqxqxqqxxxqxxxqqqxxqqqxqxqqxqqqqqqqxxqxqqqxxqxqqqxqxxqqxxxxxqqxxqxxqxqxxqqqxqxqqxqqqxqqxqqxqxqqxqqqqqqxxxxqqqqxxxxqqqqxqxxqqqxqqqxxxqxxxxqqqqqxqqqxqqxxqqqxxxqqxxqxxxxxxxxqxqxqxqqqqqqqqxxqqxxqqqxxqqxqxqxxxxqqqqxxqqxqqqxqqxqqxxxxqqqxxqxxqqqxqqxqxxxqxqxxxxqxxqxxxxxqqxxqqxxxxqxxqxqqqqxxxxxxxqqqqxxxxqxxqqxxxxqxxqqxxqqqxxxqxqqxxxxxqqqxqqxxqqxxqxqxqxqqqqqqxqxqqxqxqqxqxqqxqxxxqxxqqqxxqxqxqqqxqqqxxxqqxqqqxxxqxxqqqxxqxxxxxxxxqxxxxqxqqxxxqqqqqxxxqqqxqqqxqxxxqqqqqqxxqxxqxqqxqxqxqxqxqqxxqxxxxxqxqxxqxqqxxqqxqxxxxxqxxqxqxqxxxxxqxxxqxxqxxxqqxqxxqxqxxqqxxxxqqxxxqxxqxxxxxqqqqxxqxqxxxxxqxxqqxxxxxqqxxqqxxxxqqqxqqqxqqqxxqxqqxxxxqqxxqqqqqqqqxqqxqxqqqxxxqqxxxqqxqqqxqxxqqxxqxqqxqqqxxqqxxqxqxxxxqqxxxxqxxxxxxqxqqxxxxqxxqxqqxqqqqqxxxqxxxxqqxqxqqxxqqxqxqqqqxxxxxxxqqxqqqxqxqqqqxqxqqxqqqqqxqxxqqqxxqqqqqqqxxxqqqqxqxqqqxxqxxxxxxxxqqxqqqqxxqqqxxxqqqqqxqxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqxqxqxxxxxxqxxxxqqxqqxxxqqqqxqxqxqxxxxxqqxxqqxxxxxqqqxxqxqxxxxxxxqqqqqxxxxxqxxqxqqxqxqxqqxqqqqxxqqxxqqxqqqxqxxqqxxqqxxxxxxqqqxqxqqqqqqqxxxqxxqxxqqxqxqqxxxxxqxqxxxqxqxqxxqqqxxxqqqxqxqqqqxxqqxxxxqqxqxxxqxxxxqxqqqxxxxxxqqqqxqqqxxqxqqxxqxxqqqxxqqqqqxxqxqqqxqqqxqqxxxqxxxqqxxqxqxqxxxqqxxxxqxxxqqxxqqqqxxqqqxxxxxxqqqqxqxxqqqqxqqqqqqqxqxqqxxqqqqqqxxqxxqxxxxxqqqxqxqqqxqqqxqxqxqxqxqxqqqqxxxqqxqxxxqqxxxxxxqqxxxxqxxxqxqqxxqqqqxqxxqxxqqxqxxqxqxxxxqqxxqxxxxqqqxqqxxqxqxqxxqqqqxxqqqxqxxqxqxqxqqqqqqxxqxxqqqqqqxxqqqqxxxqxqxqqqqxqxxxxqxxqxxxqxxxqxqqxqqxqxqxxxxxxqqqqxxxqqxqqxqqxqxqqqqxxqxqqqxqxxqqqqxxqxqxqqxxxqxqqxxxqqqxqxxxqxqqqxqxqxqqxxqxxqqqqxxqqqqqqqxxxqqxxqxxxxxxqxqqxxqxxqxqqqqqqxqqqxqqxqqqqxxxxqxqxqxqqqxxqqqqqxxqqxxxqqxxxxxxqqxqqqxxxqqqqqqqqxqxqxxqxqxqxqqxqqxqxxxqqqqxxxxqxqxxqqxxxqxqqxqqqxqxqqxxxqxxxqxxqqxqqxqxxxxxqqqxqxqqqxxxxxxxqxqqqxxxxxqxqqxxqxqqxqxxxqqxxqqxqxqxxqxqqqxxxxqqxxqxxxxqxqxqxxqxxxxqxxxxxqxxxqxqxxxqqxqxqqqqqxqqxxxqxxqxqqqqqqqxqxqqxxqxqqqxxqqxxxxqxqqxqqqxqxxqxxxqxqqxxxqqqqxqxxxqqqxxxxxqqqxxxqqqqxqqqxqxxxxxqqqqxxxxqqqqxqxxqxqxqxqqxqqxqxqxqxxxqxqqqxqxxqxqqqqqqqxxqxqxqqqxxqqqxqqxqqxxqxxqqxqxxxqqqxxxqxxxxqxxqxqqxqxqxqqxxxqqqqxxqqqxqqxxqqqqqqxxqxxqxqxxxxxqxxxxqqxqxxxqqqqqqqxxqxqxqxqqqxqxqxqxxxxxxxxxqqqqxqqxxqqqqxxxxxxxxxqxxxqqqxqqqqxqxqxxxqxxqxxqxqxqxxqxqqqxqxqxxxxqqqqqxxqqxqxxqxqqxxxxqxqxxqxxqqqxxqqqqqxqxqxxqqqxxqxqxqxqxxxxxxxqqxqxqxxqqxxxqxqqxxqxxxqxxqqxqxqxqqqqxxxqxqqxxxxxqqqxxxxxxxqxxxqqqqqqqxxxxxxqxxxxxxxqxxqxqqqqxxqqqxxxxxxxqxqxqxqqqxxqxxxqqqqqxxqqqxxxxxqqqxxqqxxqxxxqqxxxxqxqxxqqxxqqxqxxqxxxxqxxxxxqxqxxxqxxqqqqxxqqxxqxxxxqxxqxxxxxqxxqqxqxxxxxqqxxxqxxxqxqqqqqxqqqqqqqqxqqqqqqqqxqqxxxqxxqxxxxqxxxxqqqqqxxxqxxxxxxxqxxxqqqxxxqqqqqxxxqqxxxxqxqxxqqqqxxqxxxqqqqxxqxqxxxqxxxqqxqxqqqxqxqqxqxxxxxqxxxqxqqxxxqqqxqxqxqxxqxqxxqqxqxqxxxxqqxqxqxxqxqqqqqqxxqqxxqxqxqqxxqqxqqxxqxxxqqxqxqqqqxqxxxxqxqxqqqxxqqxxxqqqqxqxxxxxxxxqxxxqxxqqqxqxqqxqxqxxxqxqxqxqxxqqxxxxxqqxxqqqxqxxqqqxxxxxxxqqqxxxqxxxxxxqxxqqqqxqqxqqqqqqxqxqqqqxxxqqqxqqqxqqxxxqqxxqqqqxqqxqxqqqqqxxxxxxqxxqxxqxqqxxqqxxqqqqxxqqxxqxqxqxqxxqxqxxxxqxqqxxxqqxqxqqxqxqxxqxqxqxxqqxqxqqxqqqxxqxxqqxxqxqxxqqqxxqxxqqxqxxqxxqqxqqxqxxxqxqxqqqxqxxxxqxqqqqxqqxqqxqqqqqxqxxxxqxqxxxqxqqxqxqqxqqqxqxqqxxqqxxxqxqxxxqxqqxxxxxqxqxxxxxqqqxxqqqqqqqxqxqqqqqxxxxxqqxxqqxxxqqqxxqxqxqqqxqqxxqxqxqxqqqqqqxxqqqxqqxqqxxqqqxxqqqqxxqqqxqxqqqqxqqxxxxqqqqqqxxxxxqxqxxqxxxqxqxxxqqxxxqxqqqxxqqqxxxqqqqxxxxqqqqqqxxxqxxxxqxxqqqqxqxxqxxqqqqqqxxqqqqxqxxxqxqqxxxxxqqqqqxxxxxqqxxqqxxqxxqqxxxqqxxqxxxqqqqxxxqqxxxqxqqxxqqqxqqxxxxxqxxqxqqxqxqxxqxqqqqqqxqxxqqxxqxqxqxqqqxxqqqxxxxxxqqxxqxqxxqxxxxqqxxxxqxxqqqqxxxqqqqxqxxqxxqxxqqqxqxqqqqxxxqqxxqxxqqxqxqqxxqxqxxqqqxxqxxqxqqxqqxqxxxxxxxxqxxqxqqxqxqqqqqxqxxxxqxqxqxxxxxqxxqxqqxxqxxxqqqqxxqxqxqqxxxqxqqqqqxqxqxqxqqxqxxqxxqqxqqqxqqxqqqxqxqqxqxqxqqxxxxqqxxqxxqqqqxqxxqqqqqxqxxxqxxxqxqqqxxxxxqxxxxxqqxxqxqxxxqxxqxqxxqqqxxqxxxqqqxxxqxqqxqxxqqxqxqxqqxxxqxxqxqxqqqxqxqqqxqqxxxxqqqqqqqxxxqxqxxqxxqxqxxqxxxxqxqxqqxxqxxqqxqxxqqqxxxxqxxqqqqxxxqqqqqqqxqqxqxxqxqxqxqqqqqqqqxxqqqxqqxqqqqxxqxxqqxqqqqxxqqxxxqqqxxqxxqqxqqxqqqqxxqqxxxqxxqqxqqqqxqqqqqqxqqxqqqqxxqqqxxxqqxxxqqqqqqqxxqxxqxxqxqqxxqxxxxxqqxqxxqqqxxqqqqqqxqqxqqxqxxqqqxxxxqqqxxqxqqqqxxxxqxxxxxqxxqqqqqxxxxqqqxxxxxqxxxqxxqqqqqqxqqxqxxxxxxqxqqqxxqxxxqxxqxxxqxqxqxxqqqqxqqqxxxxqxqqqxqxqxxxxxqxqxxxxqxxqqqxqqxxxxqxqqxxqxxqqxxxqxxqxxxqqxqqqxqqxqqxxxxxxxxqqqxqqqxqqxxxxqxxqqqqxqxqqxxqqxqxqqxxqqqxxxxxqqxxqqqqxxxqqxxxqqxxxxqqqqxqxqxxqxqqxqxxqxqxxqxqxxqqxqqqxxqxxqqxqxxqxqxqxqxxxqqxxqxxqxxqqxxxxxxxqqxqqqqqqqxqxqxqxxqqxxqqxqxxxqqqqqqxqxxqxqqxxqqqqqqqxxxqqxqxxqxxqxqxxqxxxqqqqxqqqqqqxxxxqqqxqxxqxxqqxxqxqqxxxxxqxqqqqxqxqqxqxxqxqxxxxxqxqxxxqqxxqxxqxqqxqqxxqxqxxqxxxqxxxqqxxqqqqxqqxqxqxqqqxqxxxqqxqqxxxxxxxxqxxqxxqxxxxqxxxqxxxqxqqqqqqxqqxxxqxxqqqxqxqxqxxxqxqqxxxxqxxqxqxxqxxqxqqqxxxqqxxqxqxqqxxxqqqqxxxxxxxqxxxqqqxxqxqqxxxxqqqqxqqxxxqqqxqxxxxqqqqqqxqxqqqqqxqqxxqxxqqqqxxxxxqqqxqqqqxxqxxxxqqxxxqqxqxxqqqqqxxxqqqxxxxxqxqqxxqxxxqxqqxqqxxqxqxqqxxqqqqxxxqqqxxxxqxqxqqqxqxxqqqxqxqqxxqqxxxqxxqxqxxxqxqqxxxqxxxqxxqqqxqxqxxqxxxxxxqxqxqqqqxxqxqqqxqxxqqqxqqqqxqqqxqxxqxqqqxxqqxxqxxqxxqxqxqxqqxxxqxxxxxqxqqqqqxqxqxqxxxxqqxqqxxqxqxqxxqxxqxxqqxqxqxxqxqxqxqxqqxxxqxqqxxqxxqxxqxqxqxxqqxxqxxqxxxxxqxxxxqxxqxxxxxxxxxxxxxxqxqqqxqxxqqxxxqxxxxqqqqqqqqxqxqqxxqqxxxxqxxqxxqxqqxxqxxqqqxqxqqxqxqqqxqqxqqqqqqxxxxqxqqxxqqxxqqqxqqqqqxqqxxqqxqxqxxqxqxxxxxqxqxxqxxxqqqxxxxqqqxxqxqqxxxxqxxxxxqxqqqqqxqqxqqqqqxqqxxqxxxxqqxxxxqxxxxxqqqqxqqxqxxxxqqqqqxqqxxxqqqxqxqqxqqxxqxqxxqqqxxqqqxxqqxxqxxxqxxqqxxxqxxxqqxqqqxxxxqqxqqxxxxqqxxqxxqxqqqxxqxxxxqqxqxxqqxqxqxxxxxqqxxqxqxqxxxxqqxxqxqqxqqxqqxqqqxqqqqxqqqqqqqqxqxxqxxqqqqqqqxxqxqxqqxxqxqqqxqqxqxxqxxqxxxxqqqxxqqqqxxxxxqxqqxxqqqxqxxxxxxxxxxxxxxxqxxqxxqqxqqqqxxxxxxxxxxqxqqxxxxxxqxqxxqxxqxxqqxqxxxqxqqqqxqxqxqqqqqqqxxqqqxxxxqqqqqxqxqxxqxqqxqqxxxqqqxxqxxqqqqxqxxqxxxxqqxxxxqqqqqqxxqxxqxqxxqxxxqqqxxqqqqqqqqxqqxxqqqxxqxxqxxqxqxqxqqxqqqxxxqxqxxqqqxxxqqxxxxqxqxqxqqxqqxxxqxqqqqxxxxqxxxqxxqqxqxqqxqqqxqxxxqxqxqqxxxqxxqxxqxqqqxxqqqqxqxxxxxxxqxqqxxxqxxqxxxxqxxxxxqqxxqxxxxqqqxqqqqqxxxqqqqxxxqqxxxqqqqqqxxqxqqqxxxqqqqxqxqqxxxqqxqxqqqqxxxqqqxxxqqqxqqxxqqqqqqxxxxqxxqqqqxxqqqxxxxqxxxxqqxxqxxxqxqxxqxxxxxxqxqqqqxqxqxqqqxxqxxxqqqqxqxxxqqqqqxxqqqqxqqxqqqxqxxxqxqqxxqqxxxxqxxxqqqxqqxqqxxxxxxqqqqqqxxxxxqxxqqxqqxqqqxxqqqqxqxxqxqqxqxxxxqqqqqqqqxxxqqqqxqxqxqqqqxqqqxxqxxqxqxxxxqxqqqqxqqqqqxxxqqxxxqqqxxqqqqxqqxqqxqqqxqxxxqxqqxxxxxxqqqxqxxqxxqqqqqqxxqqxxxqxxxqqxxxxxqxqxxxqxqqxxxxxxxqxqxqxxqqxqqqqqxqqqqqqqqxqxqqqxqqxqxxxqqxxqxqqxqqqxqxqqqqqqxxqqxqxxxxxxqxxxqqqxxxxxxxqqqqxqqqqxqxqxxqxqxxqqxxxxxxqqxxqxxqqxqxxqqqxqqxqqxqxqxxxxqqxqqxxqxxxxqxqxqxqxxqqqqqxxxqqxqxqqxxqxqxqqqxxqqqqqqqxqqxqxxxxqqxqxqqxqqxqxqxqqqqqqxqxqxqqxqxxxxqqxqxqxxxqqxqxqxxqqxqqxxxqxqqqqqxqqxqqxxxqxxqxqqxqqxqqqqxqqxqqxxqqqxqqxxqxxqxxxxqqqxxqxxxxxxqqxqxxxqxqxxxxxqxxqqqxqxxqqxxqqqxqxxxqxqxxxqqqxxqqxqxqxqxxxqxxxqxxxxxxxxxxqxqxqxqqqqqxqxqqxxqqxqqqxxxqxqqqxqxxxxqxxqxxqqxxxqxqxqxxqxxqxxqxqxxqqqqxxqxxxqxqqxqxxqxqxqqqqxxxqxqqxqxqxxqxxxxxqxxxxxqqqqxqxxxqxqqxqxxqxxqxxxqxxxxqqqqqxxqqqxqqxqxxqqqqqxxxxxqxqxqqxxqqxxxxxxqqxxqqqxqqxqxqqqxxxxxxqxxqxqxqxxqxqxxxqxxqqxqxxqqqxqxqxqxxxqxxxqqxxqqqxxxxxxxqqxxxxxxxxqqqxqxqxxqqqxqxxxxqqxqqxqxqxqqxxqxxqqxqxqxxxqqxqxxxqqqqqqxxxqxxxxqqxxqqqqqxqqqxqqxxqqqqqxxxqxxxxqqqqxxqxqxqqqxxxqqqqxqqqxxqxxqxqqqxxqqqqqqqqqxxxqxqxqqqqxxqqxqqqqqxxqxxxqqxqqqqxxqxqqqxxqqxxqqxxxqqxxxqxqqxqxqxxqqxxxxqqqxxqqxqxxxqxxxxxxqqxxxqxqqqqxqxxxxqqxxxqxqxxxxqxqxqqqxqqqqxxxxxqqqxqqqqqxxqqxxqqxxqxqxxxxqqxqxxqqqqxqxqqxqqxxqxqxqxxxxxqxqxxqxxxxqqxqqqxqqxqqxqxxxxqxxxqqxxxxxxxxqqqxqxxxqxxxqqqxxxqxqqxxqxqqxxqxxqxqqxqqqxxqxxqxqxqxxxxqxxxqxqqqqqqqqqxqqxxqxxxxqxxqqxqqxqqxqxxqxqqxqxxxxqxqxxxqxqqxqxqqxqxxxqqxqxqqxqqxqxxqxqxxxxxqxqxqxxqxxqxqqqqxqqqqxqqqqqqxqqqxxqqqxxqxqxxqxxqqxqqqqxxqqxxqxxxxqqxxxqqqqxxxxxxqqqqxqxqxxqxqqxxqqqqqqqqxqqxxqxqqqqxqqxxqqqxqxxxqxqqxxqxqqqxxqxxqxxqxqxxxqxqqxxxxqxqqqqqxxxqqxxqqxxxqqxxxxxqxxxxxxqqqqqxxxqqqqqxxqqqqxqxqxxqxxqqqqxxxxxqxqxxxxqxqqqqqqxxqxqqqxxxxqxqxxqxxqxxqxxxxxxqqxqqxqqqqqqqqqqxqqxxxxqqqxxqxqxqxqxxxqxxxxxqqqqqqqxxqxqqxxqqqqxqxqxqqxqqxqxxqxqxxxqxxxxqxxqxqxqxqqqxxqqxxqxxqxxxqqqqqxxqxqqqqxqqxqxxqqqqxxxqqqxxqxxxxqqxqqqxxxxxxqxxxxxqqxxqqxqxxxxqxxxqqxxxxxqqxxxxxxqqqxqxxxqqxqqxxqqxxxqxqqxqqqqxxxqqxqxqqxxqxqxqxxqqqqxxxxxqxxxqxqxqxqqxqxxxxxqqxqxxqqqxxqxqxqxxqqxxqxqqxxxxqxxqqqxxqqxqxxxqqqqqxxxqqqxqxxxqxqxqxqqxxqxxqxxxxxqxqqqxqqxqxqxqqxxxqqqqqxxqxxqxqqqxxqqqqqxqxxqqxqxqxxxqqqxxxxqxxqxxqxxqxqqqqqxqxxqxxqqxxxqxqxxqxxxxqxqqxqqxxqqqxxxqqxxqxqxqxqxxxxqxqqqqqqxqqxxxxxxxxqxxxqqqqqqxxxxqqqxxqxqxxxxqxxxxxxqxqxxxxqqxqqqxxxxxxqqxqxxxqqqxqxqqqqxxxxqqqxqqxxxqxxxqqqxxqxqxqxxqxqqqxqqqxxqxqxqxxqxqqxqqxqqqxxxxqqqxxqxxxxqxqqqxxqxxxqqqxxqxxqqxqxxqxqqqqqqxxqxqqqqxxxxxqqxqqxxqxqxqqxxqqqxxxqqqxqxqqqqxqqxxqqqxxxqqxxqxqxqxxqqqqqxxxqqqqqqqqxqqxxxqqqqxqqxqxqxxxxxqqqqxxqxqxxxqqxqqxxxxqqqxxxxqqqqxqqxqxxxqxqxqqxqxxxqqxxqqqqxqqxqxqxqqqqxqqqxqqxqqxqqqqxqxxxqqqxqxqxqxxxxxxxqqqqqxxqqxxxqxqqqxqqqxqqxxqqxqxxxxqxqqqqxqxqqxqqxxxqqxqxqxqxxxqqqxxqqqqqqxqqxxqqqxqqxqxxxqqxqqqxxqqxxxxxqxqxxxqqqxxxqxqxqxqxxxqqqqxqqxqqxxqqqqqqxxqqxqqqqqqxqxxqqxqqxqqxxxxqqxqxxqxqqqxxqxxqqxxxqxqqxqxqxxqxxqxqxxxqqxxxqqxqxxqxqxqxxxxqxqqxxxqxqqxxqxxqxqxxxqxqxxqxxqqqqxqxxxxqqxxxqqxxxqqxxxqqqqqqxxqqxqxqqxxqxxqxqqqqqqxqqqqxxxxxqxxqqxxqqxqqqxxxxxxxxxxqxxqqqqqqqxqxxxxxxxqqqxqxqqqxxxxqqqqxxxxqxxxxxxxqqqxqxxxqxxxxqqqqxqqxxqqqxxqqqxxqxxxxxqqxqqqxqqqxqqxxxqqqqqqqqxqxxqqqxxqqqqqqxxxxqqqxxqqqqxqxxqxxxxxxqqqxqqqqxxqqqxxxqxqqqqqxxqqxxxqqqqqxqqxxqxxqqqqxxxqxqxqxqqqxxxqqxxxxqqxxxxxxxxqqqqxqxxxqxxxqqxxqqxqxxxqqqxxxxqqxxxqqqqqqqqxxxxxqqxxqqqxqxqxxqxqqqqxxxqxxqqqqqqxqxqqqxxqqxxxxxxqqqqqxqxqqqqqxxxqxxqqxxxqqxqqxxxxqqxqxxxqxqxxxxqxqxxxqqqqqxqxqxxqqqqqxxqqxqxqxxxqxqqxqqqqxxqqxxqxqxqqqxxqxxqxxxxxxqqqxqxqqqxxqxxqxqqqxxqxxqxqxxxqqxxqxxxqxxqxqxqqxxxxqqqxxxxqqqxqqqxxqxqxxqqqqqxqqqqqxxqqqqqqxqxqqqqqqqxqqqxqqxqqqxxxxqqxxxqqqqqqxxqxxxqqqxqxqqqqxxxqqxqxqxqxxxxxxxxxqxxxxxxxqqqxxxxqqxxqxxxxxqqqqxxqxqxxxxxqxxqxxxxqxqqqxqxqxqxqxxxqqqxxqqqxqxxxxqxqxqxxqqqxxqxqxqqxqqxxxxqxxqqqqxqqqxqxxxxxxxxxqxqxqxxqqxqqxqxqqqqxxxqqxqqxqxxxqqqqqqqxxxxqqxqxxxxqqqxxxxqqxqxxqxqxqqxqxqqqqqxxxqxxqxxqqxqxqxqxxxqqxqqxxqxqxxxqqqqqqqqxxxqxxxxqxxxqqxqqxqqxxqxqqqqqqqqxxxqqxqqqqxqxxxxqqqxqqqxxqqqqqqxxqxxxxqxxxxxxxxxqqqxxxqqqqxqqxqqxqqqqxqxxxqqqqxqxxxxqqqxqxxxqxqqxqqxxxqxqqxqqqxqxxqxqqxqxqqqxqqxqqxqxqxxqqqqxqqxqqxqqxxxxxqxqqxxxxxqxxqxqqxqqxxqxqxqqxqqxqxqxxqxqqqqxqxqqxxqxxqxqqqxqqqqqxxxqxxxxxqqqxqxqxxxxqxqqqqxxqxqqxxxqxxqxqqqqxqqxqxqqqxqxqqqxxxqxxxxqxxxxqxxxxqxqqxxqxxqqxxqqqxxqxqqqqxqxqxxxxqxxxqxxxxqqqxqqxxqqqqqqxxxqqqxqxqxxxxqxxxxqxqqxxxxxxxxxqqxqqxqqqxxxqqqqxqxxxqqxqqqxqxqqxqqxxqqqqqxxxxqxxxqqqxxxqxxxxqxxxxqqqqxqqxqxxxxqqqxxqxqqqqxxxqxxxxxqxqxqxqxxqxxqxxxxxxxqxqxqqqxqxqxxqqqxxqqqxxqqqxqxxxxxqxxxqqxqxqqxqqqqqxxxqxxqxxqxqxxqxxqqxxxqxqxxxxxxxxxqxqxqxxxxxqxxqqxxxxxxqqxqxxqxxqxqxxqqxxxqqxxxxqqxqqqxxxqxqqqqxqxxxqqxxqqqxqxxxxxxxqxqxqqxqqxqqxxxxxxqqxxqxxqxxqqxqxqxqxqxxxxqxqqqxxxxqqqxxxxxxxqxqxqxqqqqqxxxxqxqqxqxxqxqxxqqqqqqxxqqqxxqqxqqqxqxxxxxqxxqqxqqxqqxxxqqqxqqxxqqqxxqqxqxqxxqqqxqqqxqqqqqxxxqxqxqqxxxxqxxxxxqxqxxxqqxqqxxqxqqxxqxxqxqxxxxxqqxqxxqqxxxxxxxxqqxxqxxxqxqxqxqqqqqqqqqqxqxqxqqqxxqqxxxqxxqxxxxqxxxqqxqqqxxxqqxxqxxxxxxxqqqxxxqxqqqqqqxqqxxxqxxxxqqqqxxxxxxqxqqqqqqqxxxxxxqxqxqxxqqxxxqqxqqxxxqxxxxqqqqxxxxxqxqqqxqxxqxqxxxqxqqqxxxxqqxqxqqxqxqqqqqxxxqqxxqxqxqqxqqqxqqqxxxxxqxxxqxxqqqxxxxxxxqqqqqxqqqxxqxqqxxqxxxxxxxxqxxxqxxqqxxxxxqxqxqxxqqxqxqqxxxqxxxxxxqqxqqqqxqxxqxqxxxxxxxqqxqxqqxxxxxxxxxqqqqxqqxqxxxxqxxqqxqxxxqqxqxqqqxqqqxqqqqqxqqxqqqxqxxqxqqxxxxxqqxxqxqqqxqqxqqxxxqqqqqqqxxqxqxxxqxqxxxxxxxqxxqqqqqqxxxqxxxxqqxqqqxxxxqxqqxqqxxqqxxqqqqxxxqxxxqqqxqqqxqqqxqxxqxxqxqxxxqxxxqxqxqqxxqxxxxqxqqqqxqxxqqxqxqqqxqxxxxxqqxxxqxqqqqqqqxqqqqqqqqxxqqqxqxxxxxxqxqqxxxxqqxqxxxxxqxqxxxqxqqqqxqxqqqqxxxxqqqqxxxqxxxqqqxxxxqxqqqxxqxxqqqxqqqqxqxqqxqqqxqqxqqxqqqqxqqqqqxxqqqxxxxqqqxqqxxqqqqxqxqxqqqxqxxqxqxqxxxqxxxqxxxxxxxqqxxqxqxxxqqqqxxxqqqqqxxxxxxxqxxxxqqqqqxxqxqxxqqqqqxxxqqqqxxxxqqxqxxqxxxxxxqxxxxqxqqqxqxxxqxqxqqqxqqxxqxxqqxqxxxxxqxxxqxqqxxqxxxxqxqqxxqxxqxqxxqxqxxqxxqqqqqxxqxqqxxqxxxqxxqqxxqqqqxqxxxqqxxqxxxxqxxxxqqxxxxqxxxqqxxqqqqqqxqqqqxxqxqqqqxqxqqxqqxxqqxqxxxqqxqxxqqxqqqxxxxqqxqqxqqqxqqqqqxxxxxxqqqxxqxqqxxqqqqxqxqxxxxxxqxqqxxxxqxxqxqqqqxqxqqqqxqxxxqxqqxxxqqqxqxqxqxqxxxqqxqxqqxxqqqqqqqqqxqqxxqxxqxqxqxqqxxxqqxxxqxqqqqqqqxxxqqqqqxxxxqxqqqxqqqxxxxxxxxqqxqqxxqqqxxxqxxqqqxxqqxqxqxxxqxqqxxqqqqxqqxqxxxxqxqqxxxxxqqxqxqqqxxxqqxxxqqqxxqxqqqxqqqqqxqqxqqxxxqxqqqxxxqxxqqqxxqqxxqxxxxqqqqqxxqqxqxqqqxxqqqqqxqxxqqqqxxxqqqxqqxqxqqxxxxxqxqxxqqqqqxqxxqqqqqqqxxxqxxxxqqxqxxxxqxqqxxqxqqxqqxqxqqxxqxxqqqxqqqqqxqqxxxxqxqxqxqqxqxxxxxqqqqqqqxxqxxqxqxxqqqxxqxqxxqqqxxqqqqxxqqqqqqxqqxqxxqxxxxqqxxqqqqqxxxqqqqqxxqqxxqxxxxxqqqxqxxqqqxqxxqqxxqxqqqxqqxqqqqqqqqqxqxqxqqqqqxxxxqxxqqqqxqqxxxxxxqxqqxqxxxxqxqxqqqqqxqqxxxqqxqqxqxqqxqxqxqqxxqqqxxqxxxxxxxqqxqxxqqqxqxqxqqxxxxqqxxxxqxxqxxqxqqxqqqxxqqxxxqqqqxxxxxqxqxqqxxqxxqqqxqqxxxqqxqqxxqqxxqxxxqqxxxxqxqqxqxqxxqqqxxqxxqxqxxqqqqxqqqqqqxxqqxxqxqqxqqqqqxqqxxqqxxqxxxqxqqxxxxxxqqqxxxxxxqqxqxqxxqxxxqxqqxqxxxxqqqqqxqxqqxqxxqqxqqxqqxxxqxxxxxqxxxxqqxqxxxqxqqxqqqqqqxxxxqxxqqxxqxqqxxxxxxxxqxqqxxqxqxxxqqqxqxxxqqxxqxxxxxxxxqxqxqxxqxqxxqqqxqxxxqqxxxqxxxqqxxqqqqxqxxxxqxqqqqqxxxqqxqqxqqqxqxxqxxqxxqqxqxqxqxqqxxqxxxxqqqxqqxxxqxxqqxxqxqxxxxxqqxqxxqxxxxxxxxxqqxqqqqxxqqqqxqqqqxqqxxqqqxxxqxxxxqqxxxqxqxxqxqqxxxxqqqxxqqxxxqqxxqqxxxqqqxqqxxxxqqqqxqqxqqxxqxxqqxqqxxxqxxqqqqxqqxxxqqxxxqqqqqqqqqqqxxxqqxqxxxxqxqqxxxxxqqxqqxxxxqqxqxqqqxqqqqqxxqqqxxxxqxqxqxqxqxxqxqxxxqqxxqqxxqqxxqxqxqqqxqqqxxqxqxqxxxxqxqxqqqqxxxxxqxxqqqqxxxxxxqqqxqxqxqqxqqqqqqqqxqxqqxqqqxxqxxqqxxxxxxqxxqxqqqxxqqxxqxxxqqxqqxqxqxqqxxxqqxqqxxqxqxqqxqxxxxxxqxqxxxxqqqxqqqxxqxqxqxxqxxqxxqxxxxxxqxxqxxxqxxqxqqxxqqqxxxqxqxqqxxxxxxxxqxqqxxqqxqxqxqxqxqxqxxqxqqqqxqqqxxqxxqqxxxxqxxqxqqxqqxxqxxqxqxqqxqxqqqqxxqqxqqqqqqxxqxxxqqxqxqxxqxqxqxxqqxqqxxqqxqxxxxqxqxxxxqqxxxqqxxxqqxxqxxqqqxqqxqqxqxxqxxqxxqxqqqqqxqxxxxxqqqqqqxqxqxxqqxxxxxxqqxxxqqqxqxxxqxxqqqqqqxqqxxxqqqxqxqxxqxqxxxqxqqxqxxxxqxxxxqxxxxxqxxqqqxqqxqxqqqqqqxxqxqqxqqxqxxqxxxqxxqqqqqxxqqqxxxqxqxxqqxqxqxxqqxqxqxqxxxxxxqqqxxqqqqxxqqxxqxqxqxxqqqxqqxxqqqqxqxxqxxqqqqqqqqxqxqxqxqqqxqxqxqqxqqxqxxxqxqxqxqxqqxqqqxxqxqxxxxxqxxxqxxxxqxxxxxxxqqxxxxqxxqqxqqqqxqxxxxxxxqxxqxxqxxxxqqqqxqxqqqxxqxqqqxqqqqxqxqxqxqqqqqqqqxqxxxxxxxxxqqxqqxxxxqqqxqqxqxqxqqxqxxxqqqqqqxxxxqqqqqxxqqqxqqxqxxxxqxxxqxxxxqqqqxqqqqqqqqxqqxxxqqxxxxxqxxqxqxqxqqxqqqxqxxxqxxqqqqxxqqxxxqqxqxqxqqxqqxxxqxqqqxxqqxqxxxqxqqqxqxqxxqqqxqxxqqqxxxxqqxxxxqxxqqqqqxxxqqqxqxxxxqxxqxqqqqxqxxqxxxxxxqqxqqqqxxxqxxxqqxqqqqxxxxqqqqqqqqxxxxxxqqqqxxqxqqqxxxqqqxqxxqxxxxqqxqxqqqxxqxxxqxxqqqqqxxxxxqqqqqxxxxqxqqqqqxxqxqqxxxqxqxqxqxqqqqxxxxxxqxxxxqqqxqxqqxqxxqqqqxxqxxxqqqqxqqxxqqqqqqqqqxqxqqxqxqxqxxqqxqqqxqxxqxqxxqxqqxxqqqqqxxqxqxqqqqqqqqxxxqxxxqxqqxqxqxxqqxqqqqxqxxqxxxxxxqxqqqxqxxxxqqxxxqxxxqqxxxqqqxqqxqxxqxxxxqxxxqqxqqqqqxxxxqxxqxxxqqxqqqxqqxqqxqqqqqxxxqxqxxqxxxqqqqxqxxqxxxqqqxxxxxxxxqxqxxxxqxxxxqqqxxxqxqxqxxxxxxqxxxxxxxqxqqxxqxxqqxqqxqxqxqqxqqqxxxxxqqqxxxxxqqqqqxxqxqqqxxxxqxxqxxqxxxxqxqxxxxxxxxxqxqxxxqqxxxxqxqqxxxqqqqxxxxxqxxxxxxqqxqqxqqqxqqxqqqqqqxqqxxxxqqxxqqxxxqxqxqxxxxxxqxqxxxqqqqxqxxqqxxxxqqxxxqqqxqqqqqxqxqqxqxxqxqqxqqxqxqxqqqqqqqqxqxqqxqxxxxqqqqxxxxxqqxqqqxqqqxqqxxqqqxxqqqxqxqqqxxqqqqxxxqqqqxqqqxxxqqqqqxqqqqqqxxqxxxqxxxqxqxxqxxxxxxxqxqxxxqqqxqxxxqxxqqqxxqqxqxxqqqxxxqxqxxxxqqxqqqqqxqxqqqxxqqqxqqqxxxxxxxqxqxqqqxqxqqqqxxqqqxqqxqqqqxxqxqqqxqqxxxqqqqxxqqqxqqxqxqxxqqxqxqxxqxqxqqqxxqxxxqxqqxqqxxxqxqqqqxqxqxqxxqxqxxxxxxxqqxxqxxqqqxxqxxxxqxqxqxqqqqxxxxqxxxxqqqqqqqqqqxqqqxxxqqxqqxxqxxqxqxxxxxqqxxxxxxqxqxqqqqqqxqxqqqxqqqxxqxxqxqxqxqqxqxxxqxxxqqqxxqqqxqxqxxxxxqxxxqqqxqxqxxxxxqxxqxxxxxqqxqqqqqxqxxqxqxqxqxxqxqxqxqxqxqxxxxxxqqxqqxxqxxqxxxxxqqqqxqxxxqqxxxxqxxqqqqqxqqxxqqqxqxqqqxxxqxxxxqqqqqxqxqxxqqxxxxqxxqqqqxxxxxxxqxqqqxqqqqxxqqqqxqxxxxqxxxqxqqqqxqqqxqqxqqqxqqxqxxxxqqxxxqqxxqqxqxxqxxxqxxqxxxqxxxqxxqxqqxqxxxxqxxxxxxxxxxqqxqxqqxqqqxqqxxxqxqxxxxqxqxxqxqxxqxxqqxqxqqqxqxqxxxqxxxxxqxqqqqxqxqxqxxqqxqxxqqqxxqxxxqxqxqqqqxqxxxxqxxxqxqxxqqqqxqxxxqqxqqxqxxqxxxqqqqxxqxxxqxxqqqqxqxqxqxqqxxxxxxqqqxqxqqxqqqxqxqqxqxqxxxqxqxxxxqxxqxqqxqqqxqqqxqqqxqxqxqxqqqxxxqqqqqxqqxxxxxxxqxqxxqxqxqxxqqxqqxqxqqxxxxqqqxqxqqxxqqqxqqxqqxxxxqqqxqxqxxxqqxqqqxqqqqxqqqqqqxqqqxqqqqxxqqqqxqqqqqxqqqqqxqqqxqxxxxqqxxqqqqqqxqqxxqqqxxqxqxxqqqqxxxqqxqqqxxqqxxqxqqqqxqqxqqqqxqxxxxxxqxxqxqqqxqqxxqqxqxqxxxqxqqxxxxqxqqqqqqxxqqxxqxqqxxqxxxxqqxxqqxxqxqqxxxqqxxqqqxqxxqxqxxxxqqxqqqxxxqqxqxxxqqqxqqxqqqqxqxqqqxqxxxqxqqqqqxqxxxxqqxxqqqxqqxqqqqqqqxqqxqqqxqxxqqxxqxxxqxqxxxxqxxxqqqqqqxqxxqxxqqxqxqqxqqqxqqxqqxqxqqxxxxxxqxxxqqxqxqxqxqqxqxxqxxqxqqqxxxqxqqxxqqqqqxxqqqqxxqqxqxxxqqxqxqxxxxqqxqxxqxxxxxqxxqqqqqxqqxqxxxxxqxxxqxqxxqqqqxxqxxxxqxqqxqxqqxxqxxqqxqxqxxqxqxqxqxqqqqqxqxxxxxxxxxxqqxxxxqxxqxxqqqqqxxxqxqxxqqxqqxxqqqqqxxqxqxqxxqxqxqqqqxxxxqxqqqqqxqqqqxqxqqqxqxqqqqxxqxqxqxqxxxqqxqxxxxxxxxqqqqxqxqqxqxqxqqxxxqxqqqxxqxxqqqqqxxqxxqqqqqxqqxqqqxxxqqqqxxxxxqqxxxqqqxqqxqqxqxqqxxqqxxxqxqxqqxxxxqqxqqqxxxqqxxxxqxxxqqqxxxqxqxqqqqqqqxqxqqqqxxxqqxqxxxqqxqxqqqxxqqqqxqxxqxxxqxqxxxqxxqqxxxqqqqqxxxxqqxqqxxqxqqqqxqxxxqqxqxxqqxqqqqqqqxxqxxqxxxxqqxxxxqqxqxxxxqqqqxxqqxxqxxxqxqqqqqqxxqxxxxxxxxqqxqqxxqqqxxqxxxxqxxqqqqxxxqxqxqqxxxqqxqqqxxxqxxxxqxxxqxqxqqxxqqxxxxqxxxqxqqqxxqqxxxqqxqqqqxqqxqqqqxqqxqxqxxqqqqqqxxxqxxxxqqqqxqxxqxqqxxxxqqqqxxxqqxxqqqxqqqxqxxqqxqxxqxqqxqqqqxxxqqxqqqxqxxxqqxqqqqqqxqqqxqxqqqqxxqxqqqxqqxqqqqxqqxxqqqxqxqxqxxxxxqxqqqqqxxqxxxqqxxqxxxxqxqqxxxqxqxxxxqxqqqqxqxqqxqqxxxxqqxqqqqxxxqqqqxqxqxxxqxxxxqqxxqxxqxxxqqxqqqxxxqxxqxxqxqxqqqqqxxxqxxxxxqxxqqqxqxxqqxqxxxxxqqqqxqqxxqxqqqxqxxqqxqqqqqxxxxqqxxxxqqxqqxxqxxqqxxqqxqxxxqqxqqqqqxqqxxqqqxxqxqxqqqqxxqxxxqqqqxxxqqxqqxxqqxqxqxqxqxqxqqxxqqqqxqxqxqqxqqxqqxxxqqxqxxxqqqqxqqqxqxqqxxqxxqxxqqqqqqqqqqxxxxxqxxqqxxqqxxqxxxxxxxqqxqqxxqqqqqxxxqxxxxxxqxqqxqxqqqxxqqqqxqqqxxqqxxqxxxqqqxxxqxqxxxxxxqqxqxxxxqqxxqxxxqqqxxxxqxxxqxqxqqxxqxxxqqqqqqqxxqxxqqqxxqqqqqqxxxqqxqxqxqqqxqqxqxxxqxxqqqqqqxxxxqxqxxxqxqxqqqxqxqxxxqxqqxxqqxqqxqqqqxqxxqqqxxqqqqqqxqqxxxxxxxxxxxxxxqqqqxxxxxqxxqqqxqqqxqxxxqqqqxxqqqxxxqqqxqqxxqxxqqqqxxqqqxqxqxxxqqxxqxxxxxxqxqqqqqxxqqxxqqqxxxxqxqqqqqxqxxqqxqqxxqxxxqxxxqqxxqqxxxqqqqxqqqqqxxxxqxqxxqxqxqxxqxqxqqqxqqqxqqxqqqxxqqxqxqqqxqxqqqxxqxqxqqqxxqxxqxxxxxxqqqqxxqqqqxxxxqxqxxxqxxxqqxqxxxqxqqqxxxqxqxqqqqqxxxqqqqxxxqqqxqqqqxqqqxxqqxqqxqxqqqxxqqqqqqxxqqqqqqqqxqxqxxqxxqqqqxxqqqxqqqqqqxxxqxxqqqxqqxqqqqxxxxxxqxqqqxqxxxxxxxqxxxxqxqxqqxxxxqxxxxxqxxxxqqqxqxxxxxxqxqxqxqxqxqxxqxxqxqxxqxxqxxqxxxqqxqqqxxxqxqqxxxxqqqxxxqxqqxqxxxxxqxqqqqqxqxqxqxxxxxxxxxxxqxqxqqqqxqxqxqxqxxxxqqxqxxqqxxqqqqqqqxqxxqxxqqqxqqxqqxqqqxxqqxxqqxxxxqxqqqxqqqxqxxqxqqxxqxqxqxxxqqxqxxxqxxxxxqqqqxqqqxqxqxxxxqqxxqqxqxxqqxxxxxqqqqqqxxxxxqxqqxqxqqxxqqqqqqqqqqqqqqqqxxxxxxxqqqqqxqxxqqxxxxxqqxxxxqxqqxqqqqxqxxxqxqxxqxqxxqqqxqxqxxqqqxqxxqxxxqxxqqqxqxxqxqqxqqqxqxxxxqxqqxqxxqxqqxxqxqqxqqqqxxxqxqqxxxxxqxxqqqxqqqxxqxqxxqqxxqqxqxqqxqqxqxqxqqxxxxqqxqqqqqqqqqqxqxxqqqxqqqxxxxqxxxxxxqqqxxqxqxxxqqxxqxxqqxxqqxxxqxqxqqxxqqxxxxxxqqqxxxqxxqxqqqqqxxxxqqxxqxqxxqqqqqqxqxqxqxxqxqxqxxxxqqqqqqxxqqqxqxxxxqqqxqxqxxxxqqxxxxxxqqxqxxxqxxqqxqqxqqqxxxxqqqxqxxxqxxxqqxqxqqxxxxxqqqxqqxxqxxxxqqxxxxqxqxxqxxxqxxqqqqqxqxxxxxqqqqxxqqxxxqxqxxxxxqxqqxxqxxqxqqxqxxxxqqxqxqxqxqxqqqqqqxxqqqxxqqqxxxxxxxqqqxxqxqxqqqqqxqxqqxqqqqqxxxqxxqxqqqxxxqqqxqqxxxxqxqxqxqxxxxxqxqqqxqxqqxqqxqqqxxxqxqxxxxxqxqqxxxqqqxqxqxqxqxqxqqqxxqxqxxxqqxqqxxxxxxxqxqxqqqxqqqxxqqxqxqqxxqxqqxxqxxqxxxqxqxxxxxqxqqxxxqqqqxxxxxqxqqqxqxqqxqxxxxxqxqqxqxxqqxxxqqqxqqqxqqqqxqqxqqxqqxxxxxxxxqqxqxxqxxqxqqqxqqxqqxxxqqqqqxqxxqxqqqqqxqqqqqxxxqxqxqxxxxxqxxqxxxxxqxxxqxqxxxqqqqxxqxxqxxxxxqqqqxxqqxxxxxxqqxxqqxqqqxqqxqxqxqqxqqqxqxqqqxqxxqqxqqqxxxqxqqxxxxqxxxqqxxqxqxqqqqqqqxxxxxqqqxxxxxxxxqqqqxqqxxxqxxqxqxqxxqxqxxqxqqqqqqqqxxxxxqxqxxqxxqxxqqxxqqxxxqxqqqqqxqqxqxxqxqqxxqxxqxqxqxqxqqqqqqxqqxxxqqxxqxqxqqxqxqxxxqqqqqqqqqqxqxqxxxqxqxxxqxxqqqxxxqxxxxqqqxxqqqxqqxqqxqqxxxxqxqqqxxxqxxqxxxxxxqxqxxxqqqqqxqqxxqqxqxxxxqxqqqqxqqxxxxxxxqxxxqxqxqxqqxqxqqxxxqqqxqxxqxqxxxxqqxqqxqxxxqqxqxqqxxxqqxqqxqqxxxxqqxxqxxqxqxxxxxxqqxxqxqxqxxqxxqxqxxxxqqqxqqqxqxxqqxqxxxqqxqqqxxqqqxxxxxqxxxqqqxqqqxxxxqxqqxxqxxxqxxxqqxxxxqxxxqqqxqqqxqqqxxxxqqqxxqxxxqxqxqxqxxxxxxxqqqqxqxxxxxxxxxxqxqqxqqxxqqxqqqxxqqqqqxqqqqqqxqqqxqxqqqqxqxqxqxxxxqqxqxxqqxqqxxxqxxxxxxqxxqxqxxxxxxxxqqxqqxqxqxxqxxqxqxxxqqqqxqqxqxxqqqxqqxxxqxqqqqqqqqqxxqxqxqqxqxqqqqxxqxxxxxqxxqqxxqqqqqxqxxxqqqqxxxqxxxqxxxqxqxxxxxxxqxxqxxxxqxxxqxxqxqxqqqxqxxxxxxxqqqxxqqqqqxxqxqqqqxqxqxxqxxqqqxxxqxxqxxqxxxxxxqxxqqqqqqqxqxxxqxqxqqqxqqqxqqxqxxqxxxqxxqxxxxxxxqxxxxxxqqqxxqqxxxqxxxqqxxqxxqqqqqxxqxqqxqqxxxqxxqqxxxqqqxqxxxqqqxxxxxqqxqxqxqxxxxqqxxxqxxqqqqqqxxqqqxxqxqqqxxxxqxxqqxxqqqqxxqxxxqqxqqxxqxxxxxqqxqqxxqqxqqqqxxxxxqxqqxxxqxxqxxqxqqxxqxqqqxxxqxqqqqqxqqqqxqqqqxqxqqqqxqxxqqqxqxxxqqqxqxqxxqqqxxqxqxqqxxxqqqxxqqqqxqxxxqxxqxxqqqxqqxxqqxxqxqqxxxqqqxqxqqqqqxxqqxxqqqxqqxxxxxqxxqqqqqxxxqqqqxqqxqqqqxqxxxqxxqxxqxqqxxqqxqqqqxxxxxxqxxqxxxxqqqxqxqqqxxqxqxxxqqqqqxxxqqxqqqqqxxqxqqxxxxqqqqqqxxxxqqxxxqqqxxxxxqqxqqqqqxqxqxqqqqxqxqxqxqxxqqxqxxxqqqxxqxqxxqxqxxxqqxxxxqxxqxqxqqqqqxqqxxxxxqqxxxxqxxxxxxqxqxqxqqqqqxqqqqqxqxxxqqqqqqqxxqqxqxxxxqxqxqqqqxxxxxqxqqqxqxxxxxxxqxxxqqxxqxqqxqqqxqqxqxxxqxqxqqxqqxqxxqxqxxqqxqqxxqqxxxqqqqqxxqqxxqxxxxxxqqxxxxqqqxqqqqqxxqqqqqxqqxqqxqqqqqqxqxqxxqqxqxqxxqqxqqqqqqqxxxxqqxxqqqqxxxxqqqqqqqqqqqqqxxqqxxqxqxqqxqxxqxqxxqqqqxqqqxqqxxqqqqxxqqqxqxqxxqxxxqqxxqxxqqqqxxqqqqxqxxqxqqxxqqxxxqxxxxqxqxqqxxxqqqxqqqqxxxqqxxqxxqqqxqxxxqqxqxqqxxxxxxqqxqqxxxqxxqxxxqxqqqxqqqxxqxxqqxxqxqqqxqqqqxxqqxqxxqqxxxqxqqqxqxqxqqqxxxxxxqqxqqqqxqxxxqxqqxqxxxxqqqqxxqqqqqqxxqxxxqxxqxxqxxqxqqqxxxxxqqqxqxqxqqxqxxxxqxxxxxxxqqqxqqqxxxqxxxxxqxqqxqxxqxqxqqqxqxqxqxxxqxxxxxqxqqxqxxxxqxqxxxqqxqqxxqqqxqxxxxxqqqqqqqqqxxxxqxqxqqqxxxqxxqxxqqqxqxqxxqqxqqqqqqxqqqxqxxqqxxxqxxxqqxxxqxxqxxxxqxxxxqqxqxqxxqxxxqxqxxxqqqxqqqxqqqqqxqxqqxxxqxqqxxxxqxqxqqqqqxxxqxxqxqqxxqxxqxxqqqxxxqqxqxqqxxxqxxxqqxqxqqqxxqqxqqqxxxxxqxqqxxxqxxqxqqxxqxxxqxxxqqqqqqqxqqqqqxxqxxqxxxqxxxxqqxxxqxxxqxxxxqxxqxqqqxqqqqqxxqqxxxxqqxqqxxqxqxxqxqxxxqqxqqxqxqqqxqxqxqqxxxqqxxqxqxxqxxxqxqxqqqqxxxqxqxqqqxqxxxqxxqqxxqqqxqxqqqxxqqqqxqqqxxqqxqxxxqqqqxxqxxqxxxxqqqxqxqqqqqxqxqxxxxqqqxqqxxqqqxqxxqqxqqqqxqqxxxxxxxqxxxqqqqxqqqxxqqqxqqxqxxxxxqxxxxxxqxqxxqxqxxxqqqxxqqqxxxqqqqqqxqqqxqqxqxqxxxqqqqxqxqxqxqxqxxxxqqxqxqqxxxqxxxqqxxqqqxqxqqxxqxqqxxqxxxxqxxxqqxqxqqqxqqqxxqxqqxxqxqqqxqxxxxqxqxxxqxxxqqqqxxxxqqqxqqxxxqqxxxqxxxxqxxqqxxqqxxqqqqqxqxxxqxqxxqxqqqqxqxxqxxxqqqxqqxqqqxqxqxxqqxxqqxxxxxqxxxqxqxqqqqqqqxqxqqxqxqxqxqxqqxqqxxqxqqxqxxxxxqxxxqxxqqqqxqxqqxqqxqqqqqqxqxqqxqqxqxqqxxqxxxqqqqqxqxxqxqqxxxxxxxxqqqqxxxxqqxxxqxqqxqxxxqqqxxqxqqxxqxxxqxqxqqxxqqxxqxxxqqqqxxxqxqxqxqqxxqqqxqqqxqqqqqxxxxxxxqxqxxxqxqxxxxxqqxqqqqxqxqxxxqxxxxxxxxxqqqxxqqxqqqqxxqxqxqqxxxqxxqqxxxqqxqxqqxxqxxxxqqqqxxxqxqqxqxqqqqqqqqxqxqqqxxxqqqqqqxqxxqxxxxxxxqxxqxxxxqqxxqxxqxqxxqqqxxxqqxqqqxxxqqqxqqxqqqxxqqxqxxxxqxxxqxxqxqqqqxxqqqqxqqxqxqxxxqxxxqxqqxxxxqqqqqqqqqqqxxqqxxqqqqqxqqqqqqqxqxqxxqxqxxxqqqxqqxqqqqqxqxqxqxqqqxqxqqxqxqxxqxqxxxxqqqxqxqxxqqxqxxxxxqqxqxxxxqxxxxxqqqqqxqxqxxxxxqqxqxxqxxxqxxxqqqxqqqxxqxqqqxqqqqxqxxxxxqqqxxxxqqxxxxqqqxqxxxxxxxqqxqxqqqxxqxxxqxxqqqqqxxqqxxqxqqqqxxqqqxqqqxxqxxqxxqqqqxqxxxqqqqqxqxxqqxxqxqqqxqxxxxqqxqqqxqqqqxqqqqxqqqxxqxxqqqqqqxxqqxxqxqqxqxqqxqqqxxxxqqqxqqxqqxxqqqqqxqqxqxqqqxqqqqxxxxxxxqxqqxqxqxxqqxqqqqxqxxqxxxxxxqxqxxxxxqqqqxxxxxxxxqqxxqxqqxqqxqxxqxxxqxxxxqxxqqqqqxqqxxxqqxxxqqxxxqqqxqxqqxxqqqxqqqxxxqqxqxqqqqxqxqqxqxxqxxxqqxxxxqxqxxxxqqxxxxqqqxxxxqxqqxxxqxxxxqxqqxqxqqxxqxxqxxqqxqxqxqqxqqxxxxxxxxqxxxxxqqqxqxqqxqqxxxxxqxxqxqqxqxqqqqxxxqxxxxxqxxxxxxqxxxxxqqxqxxqxxqxxxxxqxqxxxxqqxqqxqqqqxxqqqqqqqqqqxxxxxqxxqqqxqqqqxqxxqxxxqxxxqqxxqxxxxxqqxxxxqqqxxqxqxxqqqqqxqqqqqxxqxxxqqqxqxqqqxxqqqqqxxxxqqqxxxxqqqqqxqqqqqxqqxxqqqqqxxxqqqxxxqqxqxqxxxqqxqqxqxqqqqxxqqxqxxqxqqxqxqqqqxqxxqxqxxxqxqqxxxxxxxxxxxqqxxqqxxqqqqqxqqxxqxqqxqqxqqqxxxqxqxxqxqqxxqqxqxqxxqxxxqqqxqqqxxqxxxqqqxxqqqqqxqqqqxxqqqxqxxqxqqqxxxxqxqqqxxqqqqqqxqxqxqqxqxqqxqqqqqqxqxxqxqqxxqqxxqqqqqqqqxxxxxqqqqxqxqxqxxxxqqxxxxqqqxxqqqxxqqxxqxxxxqxxxxxqqqqxxxqqqqxxqqqxqqqqxqxqxqxxxqqxqqxxqqqxqxxxxxqxqxxqxqxqxqxqqqqqqxqqxqqxqqqxqqxxxxxxqxqqxqqxxxxqxqqqqxxqqxxxxqxqxxqxxxxqqxqxqxxxqxqqxqqqxxxqqxxqqqqxxxqxxqqxqqxxxxqxqxxxqxxxqxxqxqxqqqxxqxxxxxqqqxqqqxqxqqqqxxxxqxxqqqqqxxqxxqqqxxxqqxqxxqqxxxqxqqqxqxqxxqqxxxxxxxqqqxqxxxqxqqxqqqxqxxqxxqqqqxqqxxxqxxqqxqqxqxqxqxqqxqqxxqqxxxxxxqqxqqqxxxqxxqqxqxxxqqxqxxxqqxxqqxqqxqxqqxxxqxxqxxxxxqqxqqqqxqxqqqqxqxqxqxqqxxxqqqxxxqxxxxxxqxxqxqqqxxxxxxxqxxxxxqxqqqqqqqqxqqxqqqqxxqqqxxqqxxqxqxqxqxxxxxqxqxqxqqxxxqqqqqqxxxxqqqxxqqxqxxxqqqxqqqqxxqqxqxqqxqqqqqqxqxxxxxqxqqqxqqxxqqqxqqqqqxxqqxxqxqxxxxqqxqxqqxqqxxqqqxxqqqqxqxqqqqqxqxqxqqxxqqqxxqxxxqxxqxqxxxqxxqxxqqxqxxqxxxxqxxqqqqqxxxqqxqqqqqqxxxqqxxqxqxqxqqxqxqxqqxqxqqqqqqxqqqxqqqxxxxqxqxqqqxxxqxqxqxxxqxxxqqxqqqxqxxxqqxqqxxqqqxxqxqxqqqqqxxxqqxqqqxxqqxqqxqqqxqqqxqqxqxqqxxxxxxxxqxxxxxqxxxqqxqxqxxqqxqxxxxxqxxxxqqqxxqqxqqxqqqxxqxxqqqxxqqqxqxqqxxxqqxxxqqqqxxqxqxxqxqqxqxqxqxqqqqxxqqqqxqqxqqqqxqxqqqxqxqxxxqqqxqxqxxxxqqqqqqxxqqxqqxqxqxxqxxqqqqqqxxqxxqxxqqxxqxqxqxqxqqqxxqxxxqqxxqqxxxxqqxqqxqqqqqxxqqqxxqqxxqxxxqqqqqxqqxxqxqxxqxxqxqqqxxxqxqqqqxqqqxxqxqqqxxqqxxqqqqqxqxqqxxqqqxqxxqxqxxxxxxqqqqqqqqxqxqqxqqxxxqxqxqqqqxxxqxqqxqxqxxqxqqxxqxxqxxqxqxxxqqxqxqqqqqqqqqxxxxqxxxxxqqxxxxqxxqxxqqqqqxxxxxqxxqqxxxqxqqqxqqxqxqqqxxqxqqxqqxqxxxqqqxqxqqqxqqxqxqqqxxxqqqqxqqxqxxxqqxxxqqqxqxxxxxxqxqqxqqqqqqxqqqqxqxqxxqqxqqxxqqqqxqxqxxxqqxqxqqqqqqxxxxqqqxxxxxqqxxxqqxxqqxqxxqxqqxxqqxxxqxqqqqqxqqqqxxqqxqxqqxxqxqxxqqqxxxxqxqqqqqqqqxxxqxqqqqxqqqxqxqxqqxqxxqqxqxxqqxqxxqxqqxxqxqxqxxqqqxqqxqqqxxxxqqqqqxxqqqqqxqqqxxqqxqxxxqxqqxqqqxxxqxxqqxxxqqxqxxqqxxxxxxqqqqxxqqxxqxxxqxqqqqqqqxqxxqxxxqxqqqqqxxqqqxxqxxxxxxxxqqqqxxqxqxqqxxqqqxqqqxqxqxxxxqxxxxxxqxqxxqqxxqxqxxxxxqqxxqxxqxxqxqqqqqxqxqqqqqxqqxqxqxxqqqxxxxxqqxxqxqxxqqqxxxqxqxxqxqxqqxxxqxxxqqxxxxqqqqxqxxqxqqxxqqqxqxqxxxqxqqqxqxqxqqxqqxxqqxxqqxqxqqqqxxxxqqqqqqqxqxqqqqqxqqxxqxqqxqxxxxqxqxqqqxqqxxqqqqxxxqxxqqqxxqxqxqxqxxxxqqqxqxxqqxqqqxxxxqxqqqqqqxxqqqxqxqxxxqxxxqqqxxqxxxqxxqqxqqxxxxqxqqqxqxxqqqqqqxxxqqxxxxqxxqxxxqxxxqxqqxxxxxqxqqqqxxqxqqxqxqxqxqxxqqqxxxxqqxxxqqqxxqqxqxxqqqqqxxqxxxqxxqqqqxqqqxqqqqxqxxqxqqxqxxqxxqqqqqxqqqxxqqqqqqxqxqxqqqqqxqqqxxqqqxqqqqqxxqqxqqqxqqqxqxxxqqxqqqqqxqqqqxxqqxqxxqqxxxqxqqxqxxxxqqxqqqxxxqxqxxxxxxxqqxqqxxqxqqqxxxqxqxxqqqxqqxqqqqqqxqqqqxxqqxxqqxxqxxxxxxxxqqxqxxxqxxqxxxxxqxxqxqxxxxqqqxqxqxxxxxxqxqxxxxxxqxqqxqqqxqxqqxqqqxxxxqxqxqqqqxqxqxqqqxqqxqqxxqxxqxxqqqxxxxxxqxxxqxqxqqqqqxxqqqxxxqxqxxxqqxqqxqxqxqxqxxxqxqqqqxqxqqxqxxqxxxqxxxqxqqxxxxxqqxqxqqqqxqqqqqqxqqxxqqqqxxqqqxqxxxqxxqqxqqxqxxxqqxxxxqqxxxxqxxqqxxqxqxqxqqqxqqxqxqqxqqxqxqxxqxxxqxqqqxqqqxqqxxqqxxqqxqxqxqqqqqxqqxxqxxxqqqqxxxqxxqxxxqqqxqqqqxxxxqqxxqqqqxqqxxqqqqqqxqxxxqqqqqxxxxxxxqxxxqqqxxqxxqqxxxxxqxxxqxxxqqxqqxxxqqxqxxxqqqxqqqqqxqxqqxqqxxqqqqxxxqxqqqqxxxxqxxqxqxqqxqxqqxqxxqxxqqqxxxxxqxxqxxqqqqxxqqqxqxxqqxxxqqqxqqqxqqxqxxxqqxxxqxxqqxxqxxxqqxxqxqqxqqqxqxxxqxqxxxxqqxqxxxqxqqxxxxxqqxxqqxqxqxqxxqxxqqxxxqxqqxxxxxxqqxqxqxxqqqqqxxxxxqqxxqqxxxxqxqqxxxxqqqqqxqxxxqxxxqxqxxqxxqqqxqqqqxxxqxqxqxxqqqqxxxxqqqxxxqqqqxxqxxqxxqqqxqqxqqxqqxxxxqxxqqxxxqqqxqxxqqqxxxxqxqqxxqxqqxqxqxxqqxxqqxxxxqqxqxxqxqqqxqqqxxqqxxqqxqxqqqxqxqxxqqqqqxxxxxqxxxxxqqqqxqxqqqqqxqqxxxqxqqxxqxxxxqqqqxqxxqxxxqxxxqxxxxxxqxxxqqqxxqxxxxqxxqxqxxxxxxqxqxxqqqqxxxqqxxxxxqxxqxqxqqqqxqqqxqqxxqqxqxqqqqqxxqxxqxqxqqqqqxqxqxqqqxxqxqqxqqqxqxqxxqxqxxqqxxqqqqqqxxqqxqqqxxqxqxqqqxxqxqqqqxqqxqxqqqqxxqqqxxxqxqxxqxqqxxxxqxxqxqxqxqqxxxxxqxqxqqxqxqqxxxqxxxqqqqqqxxxqxxqxqqxqqqxxxqqqxqxqxxxqqqxxxqqqqqxxqqqxxxxxxxqqqqqqxqqqxxxxqqqqqxqqxxxxxxqxqxxqxqqxqxqxqxqqqxxxxqqqxqxxqxxxqqqxqxqxxqqqxqqqxxqxxqqxqqxxqxqqxxxxxqqxqqqxxqqxqxxqqqqqxxxxxxxqqqqxxxqxxqqxqxxxxxqxqqxxqxqqxqqxqxqxxqxxqqxxqxxxxqqqqqxxqxqxxxqqxxxxxxxqqqxxxxxxqxqqqxqxqqxqqqqqxxxqqxqxqqxxxxxqqqqqxqqxqqxqqxqqqxqxqxqqqxqqqqxxxxqqqxxxqxqxxxxxqqqqxxxqxqxqxxqqxxxqxqxqxqqxqxqqxqxqxqxqxxxxqqxxqqqxqqxxqqqxqxxqxxqxqqxqqxxxqxqxxqxqqqxqxxqqxxqxxqxxqxqqxxqqxqxqqxxxqqxxqxxqxqxqqqxqqxqqxxqqxqxqqxqqqqqxqxxxxxxxqxxqqqxxxxxqqqxxqqqqqxxxqqqqqqxqqxxxqqqqxxqqqxxxqxqxqqqxqqxqqqxqqqxqxqxxxqqxxxxqqxxqxxqxqxxxxxqqqqqxqqxxxxxxqqqxqqxqqqxqxqxxqxxqxxqqxqxxqqxqxxxqxqqqqqxxxqxxqxqqqqxqqxxxxqxqxqqqqqxxxxxqxxxqxqxxxxxqqqxxqqqxqqxqqqxqxxqxqxxqxqqqqqqqqxqxqqqxqqxqxxxqxqxxxxqxxxqxqqqxqxxqxqxxxqxqxqqxxqqxxqxqqqqxqqqxxxqxxqqxxqxxxxxxqxxxxqqqqqqqqqqqxxxqqxqqqqxxxqxxxqqxqxqxxxxqqxxqqxxqqqxxxxqxqqqqqqqqqqqxqxqqxxqxxxqxxxxqqqxqqxxqxxqxxqxxqqxxqqxxxqqxqxxxxxqxxxqxxxqqqxqqxqqxxxqxxxxqxxxqxxxxxqxqqxqxqxqxxxxqqxxxqqxqqxqqxxxxqqxxqqxxxxxxxqxqqqxxxqqxqxxqxxxqqxxxxqqxxqqxqxxxqqxqxxxqqqqqqxxqqqxxxxxxxqxqqqqxqxqxqxxxqqxxxqxxqqxxqqxxxxxqxqqxxxqqxqqxxxxqqqqqxxqxxxqqqqqxqqxxxqxqqqqqxxxxxxxxqxxqxxqxxqqqqqqxqxqxxxqqqqxqqxqxxxqxqxxqqxxqxqxqxqxxxqqxqqxqqqxxqxqqqxxxxxxxxxxxxxxqxxxxxqqxqqxxxqxxqxqxxxqqxqqqqxxqxqqqxqxxqqxxxxxxqqxqxqxxqxqxqxxxxqxxxxqqxqxxxqxqxxqxxqqqqqxxqxxqqqqqxxxqqxxqxxqqqqxxxxxqxqxxxqxxxqqxxqxxxqqxqxqxxxxqqqxqqqqxxqqqqxxxqqxqqxxxxqxxqxxqxqxqqqxqqxxqqxqxxxxxxqqqqqqqqxxxqxxqxqqqxqxqxqqxqxxxxqxqxxqxxxqxxxqxxxqxxqqqxqqqqxqqxxxqxxxxxxqqxxxqxqxqqxqxqxxxxxxqxxxqqqxqqqxqqqqxqxxqqxqxqxqqxqqxqqxxqxqqqxqqqqxqqxqxxqqqxxqxqqxxxqxqxxqqxqqxxxqqxqqxxqxxqxxqqxxqqxqxxqxqqxqxxqqqqqxqqxqxxxxqxxqxxqxqqqqxxxqqqqqqqqqqqqxxqqxqqqxqqxqqxqxqxqqxxxqqxxxxqxqxqxxqxqxqqxxxqqqxxxqxxxxxxxxqxqxxqqqxqqxqqxxxqxqqxxxqqxxqxqqxxqxxqqxxqqqqqxxqqqqqxxqqqqqxxxqqxqxqqqqqqxxqxxxqqxqqqqxqqqqqqxxqxqqxxqxqqxxqqxxxqqqqqxqxqxxqxxxqxxqqqqxxxqqxxqqqqqxqqxqxxqxqqqqqqxxqxqxxxqqqqxxxxxqxxqqqqqxqxxxqxqqxxxxxqxqxxxqxqqxxqqqxxxxqxxqxqxxxqqxxqxxxxqxxxqqxqqxxqqxxxqqqxxxxqxqqxxxxxqxxxqqqqxxqqxqqxxqxxxxqqxqqxxqxxqxxxxqxxxqqqqxxxqqxxqxxxqxxxqxxqqxqxqqxxqqqqqqqqxqqxxxqqqxxxqxqqxqqxqxxqxxxqqqqxxqqxxxxqxqqxxqqxxqxqxxqxqxxxqqqqxxqqqqqqxqqqxqxxqxxqxqqqqxqqqqqxxqxxxxqxqqqxqqxqqqqxxxxqqxxxxqxxxxxqqxqxxxqqqxqqxqqxxxqqqxxqqqxxqxqxxqqxqxxqqxqqxxqqqqqqqqqqxxqxxxxxxqxxxqxqqqqqxxqqxqxqxxqxqqxxqxxxxqxxxxqxxxqxxxxqqxxxqqqqqxxqxxxxxqqqxqxqxqxxqqqqxxxxxqqqqxqxxxxqqxxxxqxqqqxqxqxxxqxqqxxqqqqqxqxqqqxqqqxxqqqqqxqqqxqqqxqxqqqxxxxxxxxxqqxqxqqxxqqxxqxxqxxqxxxxqqqqqqqxxqxxxqxxxqxqxxqxqqqqqxxxqqxqqxxxxxxqxxxxqxqxxxxxqxqxxqqxxqqxqxxxqqqqxqxxqxqxqxxxxqqxqxxxqqxxxxqqqxxqqxxqxxqxxxxqqxqxqqxqqqxxqqxqqqqqqqqqxqxxxxxxxqqqqqqxxqxqqqqxqxqxxqxxqqqqqqxqqqxqqxqqxxxqxxxxxxqqxqqxxxxxqxqxqqqxqxqxxqxxqqxqxxqxqqxqqqxqqqqxxqxqxxxxqxqqxxxqqqqqqqqqqqxxqxxxqqqxqqxxqxxqqxxqxqqxqxqqqxxxxxxxqxqxxxqxxxqxqxqqxxxxqqqqqxxqqxqxqqqxqqxxqxqxqxqqxqqxxxqxqxqqxxqxxxqxqxxqqxxxqxxxxxxxxqxxqqxxqqqqqxqxqqxxqqxqxxxqxxxqqqqqxqqxqqxxqqxqqqqqxqxxxqqxxxqqqqxqqxxqxxxxxqqxqqxxqxqxqxqqqxqxxqqxqqqxqqqqxxxqxqxxqxxxxxqqxxxqxqxxxqqqqqxqxxqxqxqxxqxqxqqqqqxqxxxxxxqqqxqqqqqxxxqxqqxqxqqqqxqqxxxxxxxqxxqqqxqxqqqxxqqqqqxxxqxqqxqqxxxqqxqxxqqxqqxqqqqqxqqxxxqqqqqqqqqqqqqqqxqxqxxxqxqqxxxqqxqqxqxxqqxqxxqxqxxqqxxqqxqxqxxxqqxxxxqqqxqxxxxqxxqqqxxxqqqqxxqxxxxqqxxqxqqqxxqqxxxxxxxxqqxxqqqxqxqxqqxqqqqxxqxxxqqxqqqxxxqqxxxqxxqxqqqqqxqxqqqqxqqqxqxxqxxqxxxxqqxqqxqqqxqxxqqqqxqqqxqxxxqqxxqxqxqqxqxqqxxxqqxqxqqqqxxqqxqqxxxqqxxqxqxxxqxxxqqxqqqxqqxxqqqqqqqxqqxxqxqqqxqqxxqqxqxxqqxqqqqxqxxqxqqqqxxxxxqqqqqqxqxqqqxxqxxqxqxxqqqxxxqxqxxxxxxxxqxxxqxxxxxxqxxxqqqqxqqxqqxxxqqxxqqxqqqxxqqqqxxxqxxxxqqxxqxqxqqxxxqqxxxxqqxqqqqxxqqxxxqxxxxqqqxxqqxqqqqxxqxqxxqxxxxxqqqxqqqqxqxqxxxqqxxqxqxqqxxqxqqxqqqqqqxqxxxxqqqqqxxxqxqqqxxxxqxqxxxxxxqxqxxqxqqxqxxqqxxxxqqqqqxqxxqqqxxqqqqxxqxqqxxxqxxqqxqqqqxxqxxqxxxxqxxxqqqxxxxxxqqxxqqxxqxxqxxqxqqqqxqqxxqqqxqxxxxxqqqxqxqqqqxqxqqxxqxqxxxqxqxxqxqqqqqqqxxqqxxqxqxxqqxxqqxqqxqxqxxqqqxqqqqqxqxqxqxxxqxxqqxqqqxqxxxqqqqxqqxqxxxxxqqxqxxqxxqqqqxxxqxxxxxqqxqqqxqqqxxqqqxxxxqxqxxqqxxxxxxxqxqxqxxxxqqxqqqqqxxxqxxxxqxqqqqqxxqqxxqxxxqqqqxqqxqxxqxxxxqxxqqqqqqxxxqxqqqxqxqqqxqqqqqxqqxxxxqqxqxxxqqxqqqxqxxqxqxxxxxxxqqqxxxqxxxqxxqxqqqqxxxqxxxxqqqxqqqqxxqqqqqqqqqxqqxqqxqxqqxxqxqqxqxqxxxxqxqxqxxqxqxxqxqqxqqqqqxqxxxxxqqqxxxxxxxxqxqxxqxxxxqqqqxqxqxqqxxxxxxqxxqqxqqqxxxqqxxxqqxxxxqqxqxxqxxxqxqqqxxxxqqxqxqqxqqxxqqqqxxqxxxqqxxqxqxqxxxxqqqqqxqqqxxxxxxqqqqxqqxxxqxqqxxxqxxxxqxxxxxxxqqqxxqxqxxqxqxqxxqqxqxxqxqxqxqxxqqxxqxxxqxqxqqqqxqqqxxxqqqqxxqxxxxqxxxxxxqxqqxqxqqxxqqxqxxqxqqxqxqqxqqqqxqqxxqqxqqqqqqqqxxqxxqqqqqqqqqqqqxxqqxxxxxxqqxxqxxxxqqxxxqxxqqxxxxxxxxqxqqxqqqqxxqxqxxqqqqxqxqxxxqqxqxxxqxxqqxxqqqqqqqxqqqxxxqqxqqqqqxxxxqxqxxxxqxxxqxxqqqxqqxqxqqxqqxxqxqxxqxxqxqxqqqxqqxxqxqqqxqxxqxxxxqqqxxxqxqqqxqxqqqqqqxqqxxqxqqxxqqqxxxxqqxqxxqxqxxxqqxqxqqxqxxqqqqxqqqqqqxqxqqqxxxqxqxxxqxqxqxqqxxxqqxxqqxxxxxxqqqqxqxqqqqqqxqxqxxqqxqqxqqqqqxqxqqxqqxxqxxxqqqxqqxqqxxxqxxqqqqxqxqxxxxxqxxxqqqqxqqqqqxxxxxqxxxxqxxxxqqqqqxqqqqqqqxqxxxqqqxxxxxxqxqqxxxqxxxqqqxqxqxxxqxqqxqxqqqxqxxqxqqxxxqxqqqqqqxqqxxxqxqqqqqxxqqxxqqxqqxqxxxxqxqxqxqxqxxxqxxqxxxxxxqqqqqxqqqqqqqqxxxqqxqxqqxxqqxqqqqxxqxxqxxxqxxqxxqxxxqqqxqqxxxqxqqqxxxqxqxqqqqqxqxxqxxqxxxqxxxqqqqxxxqqxqxxqqxqqqxqxqqqqqqxxqxqqxxxxqqxxqqxxqxqqxxqqxxxxqxxxqqqxqqxqxxxxqqxqqxqxqxqqqqxqxxxxxxxxqxxqqxqqqxxqqxxqqxxqqqqqxxqxxqqqxxqxqqxxxqqxxxqqqqxqxqxqqxqqqqxqxqxxqxqqqxxxqqqxqxqqxqxqxxxxxxqxxqxqqqqxxxqxxxxxqqxxqqqqqqqqqxqqxxxqqqxqqxxxxqxxqxqqqxqxqxqxqqqxqxqqxxxqqxxqqxxxxxqxxqqqxqxxqqqqxqqqqxqqqxqxqxxqqxqqqxxxxqxxqxxqqxqxxqqqqqqqqxqxxxqqxqxqqxxxqqxqxqqxqqxxqqxxxxxqqxqqxqqqqxqqxxqqxqqqqxqqxxxxxxqxqqxqqqxqxxqqxqxxxxxqqqxxqxqxqxxxqxqqqqxqqqxxqqxqxxqxqxqqxqxxqqxxqqxxqqqxxqxqqqxxxqxxqxqqqqqxxxqxxxqqxxqxxxqqxqqqqqxxxxqxqqqxxxxxxxqxqqqqxqqqxxxxqxxxqxqxqqqqxqxqqqxqxxxxxqxqxxxxxqxqxxxqqxqxxqxxqxqqqqxxxqqqxqqxxxxqqxqqxqqxxqqqxxqqxqqqxxqqqqxxqqxxqqxxxxqqqxxxxqxqxqxqqqxxxxqqqqqxqxqqqqxqxxxxxqxqxqxqxqqqqxxqqqxqqqxxxqqqqqqxxqqxxqqxqxxxxxxxxqqqqqxxxxxqxxqxxxqqqxqqqqqqxxxxxxqqxqxxqxxxxqqxqqxxxqqqqxqqqxxqqqxqxqxxqqxqxqqqxqxqxxxqqqqqqqqqxxxxxqqxqqxxxqxqqqxqxqxxqqqqxxqqqqxxqxxqxxxqxqqqqxqqqqqxqqqxxqxqqxqqqxqqxqqqqqxxxxqqqqxxxqxxqqqqqxxqxqxxqxqqxxqqxqxqqqxxqqqqxxqxqxqxxqqxxxxqqqqqxxqxqxqxxxxqqxxqqxxxqxqqxxxqqxxqqxxqxxqqxqqxqqxxxqqxqxqqqxqxxqxxxqxxxqqxxxqxqqqxqxqxxxqqqxqxxqqxqqxqqxxqxxqxqxqqxxqqqxxqqqqqxxqqxqxqqxxxxqqxqqxqqxqqqqqxxxqqqxxxqxxqxqqxxqqxxxqxxqxxxqxqxqxxqqqxqxqqxqxxqqxqxqxxxqxxxxqxqxxxxqxqqqxqxqxxxxqxqqqqxqqqxxxqxqxxqxxqqxqxxxqxqqxqqqqxqqxqqqxxxqqxqqxqqxxqxxqqqqxxxqqqqxxqqqxxqqxqqqxqxqxxqqqxqqqxxxqqxxxqxqxxqxxxxxxxqqxqxxxqqxqxxxqxqqxxqqqqqxxqqxqqxqxqqxxxqxqxxqxxxqxxqxxqxqxxqxxxxxxqqqqxxxxqqqqxxxxqxqqxxxqxxxqqqxqqqqxxxxxqxxxqxxqqxxxqqqxxqqxqqqqqqqqxqxqxqxxxxxxxxqqxxqqxxxqqxxqxqxqqqqxxxxqqxxqxxxqxxqxxqqqqxxxqqxqqxxxqxxqxqqqxqxqqqqxqqxqqqqqxxqqxxqqqqxqqxqxxxxqqqqqqqxxxxqqqqxqqxxqqqqxqqxxqqxxxqqqxqxxqqqqqxxxqxxqqxxqqxqxqxqxxxxxxqxqxxqxqxxqxqxxqxqqqxqqxxxqqxqxqxxxqxxxqqqxxqxxxqqqxqqxxxqqxqqqqqqqqxqqqqxqxxqqqxxxxxqqqxxxqxxxqxqqqxxxxxxqqxqqxqxxqxqxqxqxqxxqqxqqqqqxqxqqxqxxqqxxqxqqqqqxqqxqxqxqqqqqxqqqxqqxqqqxxqxqqxqxqqxxqqqqxxqqqxqqxqqqqqxxxxqqxqxqqqqqxqqxxqqqqqxxqqxxqqqqxxxqxxxqxxxqqxqxxqqqqxxqqxxxxxxxxqxxqxqxxxqqqxxqqqxxqxxxqxqqxxqqxqxxqxxxqqxxqqxqxqqqqxxqqqqxqqqqqqxqxxqqqqxqqxqxxqxxxxxqqqxqqqqxxqxqxxqqxxqxqxxxxqqqqqqqxxqxxxqxqxxxxqxqxxqxxxxxqxqqxxxqqxxxxxxxqqqxxxxqxqxxxqqxqqqqqqqqxxqxxxxqqxxxqqqxxxxxqxqqxxqqqxxxqxqxxxqqxqqxqxqxqxqxqxqxqqqqqqxqqqqxxqxxqqqxxxxqxqxqxqqqqqxxqqxxqqqqqxxxqqxqxqqqqqqqxxxxxqqqqqxqqxqxxqxqxqxxqxxxxqqxxqqxxqxxxqxqqxxqqxxqqqqqqxxxqxqxxxxxxxqqqxqqxqqxxqxqxxqqqqqxqxqqqxqxqxqqxxxqqqxxxqxqxxxxqqxxqqqqxxqxqqqxqqqqxqxxxqqqqqqxxxxqxxxqqxqxxqqxqqxxxqqxxxxxqqxqxxxqxxxqxxqqqxqqqxxqqxqxqxqqqxxqqqqxqqqxxqqxxxxqqxxxqqqqqqxxxxqxqqxxxxqxxxxxxxqxqxxqqxxxxxxqqxqqxqqqqqxxxqxqxxxqxxxqxqxqxqxqxqxxxxqqqxxqxqqqxxqqqqqqxxqqqqxqqqxqxxqqxxxxqxqqxqqxxqxqqxqxqqqqxxqqxqqqqxxxqxxqqxqxqxqqxxxxqqxxxqxqqxqxqxqxxxxxxqqxqqxxxxxxqqxxxxqqqxqxqxxxxqxqqqqxqqxqqqxqqqxqxxqxxqxqxqqqqqqxxxxqqqxxqxxqxxqxqxxxxqqxqxxxqxqqxxxxqqxqxqxxqqqxqxxqqqxxxqxqqqxqxxxqxqxqxxqqxqqxxxxqqxxxxxxxqqqxxqqxqqqqqqxqxxqqxqqxqxxxxxxqxxxqxxqxxxxqqqqxqxqxqxxxqqxxxxxqqxxqqqxxqqqqqqxxqxxxqqqxxxxxxxxqxqxqqxqxqxqxxqxxqxqqqxxxxqqqqxqxqqxxqqqxqxxqxxxqxqxxqqqxqqqxqqxxqxxqxqqqqqxxxqxqxxxqqqqqqqxqxxxqqqqqxqxxqqxqxxqxqqqxxqqxxqxqxqqxqxxxqqqqxxqqxqqqqxqxqxqqxqqqqxqqqqqxqqqxqxqqqxxqxqxxxxxqxxqqqxqqxqxxxxxxxqxqxxqqxqxxxqqxxqqqqxqxxqxxxqxqqxqqqxqxxqqqxxxxqxqqqxxxqqqqqxxxqqqxxxxqxxxqxqqqqqxxxxqqqqxxxxqxqqxqxqxqxxqxxqxqxqxqqqxqxxxqxqqxqxxxxxxxqqxqxqxxxqqxxxqxxqxxqqxqqxxqxqqqxxxqqqxqqqqxqqxqxxqxqxqxxqqqxxxxqqxxxqxxqqxxxxxxqqxqqxqxqqqqqxqqqqxxqxqqqxxxxxxxqqxqxqxqxxxqxqxqxqqqqqqqqqxxxxqxxqqxxxxqqqqqqqqqxqqqxxxqxxxxqxqxqqqxqqxqqxqxqxqqxqxxxqxqxqqqqxxxxxqqxxqxqqxqxxqqqqxqxqqxqqxxxqqxxxxxqxqxqqxxxqqxqxqxqxqqqqqqqxxqxqxqqxxqqqxqxxqqxqqqxqqxxqxqxqxxxxqqqxqxxqqqqqxxxqqqqqqqxqqqxxxxxxxqqqqqqxqqqqqqqxqqxqxxxxqqxxxqqqqqqqxqxqxqxxxqqxqqqxxxxxqqxxxqqqqqxxxqqxxqqxqqqxxqqqqxqxqqxxqqxxqxqqxqqqqxqqqqqxqxqqqxqqxxxxqqxxqqxqqqqxqqxqqqqqxqqxxqxqqqqqxxqqqxqqqxqxxxxxqxxxxxxxxqxxxxxxxxqxxqqqxqqxqqqqxqqqqxxxxxqqqxqqqqqqqxqqqxxxqqqxxxxxqqqxxqqqqxqxqqxxxxqqxqqqxxxxqqxqxqqqxqqqxxqxqxxxqxqxxqxqqqqqxqqqxqxxqqqxxxqxqxqxqqxqxqqxxqxqxqqqqxxqxqxqqxqxxxxxxqqxxqqxqxqxxqqxxqxxqqxqqqxxqxqxxxxqxqqqqxqxqxxxqqxxqqqxxxxqxqqqqqqqqxqqqxqqxxxqxqxxqxqxqqqxqxqxqxqqxxqqqqqxxqqxxxqxqqxxxqqqqqqqxxxqqqxqqqqqqxqqxxxxqxxqxxxxxxqxqxxxxqqqxxxqxxxqxxqqqxxqqxxxxqxxqxqxxxxxqqqqqqxqqxqqxqxxqqxxqqxxxxqqxxqqxqxqxqxqqxqxqqqqxqxxqqqxxqxqxxqxqxqqxqxqxqqxxqxqxxqxxxqqxqqxxqqxqxqqxxxqqxqqxxqxqqxqqxxqxxqxqqqxqxqxxxqxqqqqxqxxxxqxxqxxqxxxxxqxqqqqxqxqqqxqxxqxqxxqxxxqxqxxqqxxqqqxqxqqqxqxxqqqqqxqxqqqqqxxxqqxxxxxxxqxqxxxxxqqqqqxxqqxxqqqxxxqqxqxqxxxqxxqqxqxqxqxxxxxxqqxxxqxxqxxqqxxxqqxxxxqqxxxqxqxxxxqxxqqqqxxxxxxqqqqqxqxqqxqqqxqxqqqxxqqqxqxxxqqxxxqqqxxxxqqqqxxxxxxqqqxqqqqxqqxxxxqxqqxqqxxxxxxqqxxxxqxqqqxqxxqqqqqxxxxxqqqqqxxqqxxqqxqqxxqqqxxqqxqqqxxxxqqqxxqqqxqxxqqxxxqxxqqqqqxqqxqxxqxqxqqxqxxxxxxqxqqxxqqxqxqxqxxxqqxxxqqqqqqxxqqxqxqqxqqqqxxqqqqxqqxxxxqqqxxxxqxqqxqqxqqxxxqxqxxxxqqqxxqqxqqxxqxqxxqqxqxqqxxxqqxqqxqxxqxxqxqqqqqqqqxqqxqxxqxqxxxxxqxqqqqxqxqxqqqqqxqqxqxxqqxqqqxxxxqqxqxqxxqqqxqxxxxxqxqxqxqxxqxqqxqqxxqxxxqxxqxxxqxqxxqxqxqxxqqqqxxqqxqqxxxxqxqqxxxxxqxqqqxqqqxqxxxqqqqqxqqqqqxxqqxqxqqqxqqxqxqqxxxqqxqqqxxxqqqxqxxqxqqxxqxqxqxxqqqxqqxqxqxxxqxqxxxqxxqqqqxxxxxxxqqqxqxqqxqqxqxqqxqqqqxqxqxxqqxqqxxqxqqxxxqqqqxqqxxxxqqqxxxxxxxqxxqxqqxqxqxqxxxxxxxxqqxxxqxxqxxxxqqxqqxxqxxxxqqxxqqqxxxqqxqqxxqxxqxxxxqqxxqqqxqqxxqxxxxqxxxxxxqxxqxxxxqqxxxqqqxxqqqxxxxxxxqqxqqxqqxqxxqqxqqqqqxxqxqqxxxqqxxxxxxqxxqxxqxqqxxxqqqqxxxqqxqxxxxqqqqxqqqqqxqqxxxxxqqqqxxxqqqqqxqqqxqqxxxxxxqxxqxqqqqqqxqxxxqqxqqqxqqxqqqxqxqxqqxxxxqxxxqqqqxqxxxqxqxqqqqqxqxqqqqxqqxxxqxxqqqqxqxxqqxqqxxqqqxqqxqqqxxqxxxqxxqxxqqqqqqqqxxxqxxxqxxqqqqxqqxxxxqxqxxqqxxqxqxxqqxxxqqqqqxxqqxxxxqqqxxqqqxxqqqqxxxxqxqxqqxqxxqxqqxqxqqxqxqqxxqxxxqqxqqxxqxqqxqxqxqxqqqxxqqxqqxqqxxqqqqqqqxxqxxxxxxxqxqxqxqqxxqqxxqxqqqxxxxxxqxqqxqxxqqxxxxxxxqqqxxqxqqxqqxqxqqxqqqxxxxqxxxxxxqqqqxxxqxqqxqqxxqqxqxxqqqqqxqxxxxqxqxxqxqqxqxqqqqqxqxqqqxxqqxqqxqxxqxxqqxqxqqxqqqxqqqxxqqxxxxqxxqxqxqxxxqxqqqxxqxxqqqqqqqqxqqxqqxqqqqxqqqxqqqxqxxxxxxqxxqqqxqqxxxqxqxqxqqqxqxxqqqqxqqxqxqqxqqxqxxxqqqxxqqxqxqxxqqqxxxxqqqqqqqxqqqxxxqqxqxxqqqqxxxxqxxqqqxxxqxqqqqxxxxxxqxqxxxxxqxxqqxqqxxxxqqqqqxxxqxxxxqqxqqqqxxqqqxxqxqqxxxxxqqqxxxqqqqqxqxxqqxqqqxqxxqxxqqxqxqxxqqxxxxqqqxxxqqqqxqxqxxxqxqqxxxqxqxxqqxxqqqxqqxqxqqqxqxxqqqxqqqxqqxxxqxqxqqxqqqqqqxqxqxxxxqqxqxxxqxqqxxxqxxxxqxxxqxqqxqxxxqqxxqqxqqxqqxqxqxqxxqqqxqqqqqxqxxxxxqxqxqxqqqqxxqxxqqxqxqxqqxqqxqqxxqxqxqqxqxqxqxqxxqqqxqxxqqxqqxqqxqxqxqqxxqqxqqxqqqqqxqqqqxqqxqqqqqqqqqqqqqqxqxxxqxqqxxqqqxqqqqxxxxxxxxqxqxxqqxxqqqqxqqxqqxqxxqqxqqxxxqxqxxqxqxxxqxxqxxxxxxqqqqxqxxqqxxqqxxxqxxxxxqxxqqxxqxqxqqxqxqqqqqxqxqqxqqqxxxqqqqxxxqqxqxxqqqqxqqqqqxqxxxxxqxxqxxxxxqxxqqxqqqqxxqqqqxqqqqqxxxxqxxqxqqqqxxxxxqxxqqqxxxqxqxxqxxqqxqxqqxxxqqxxxqqxxqqxqqqxqqxxqqqxqqqxxqxxxqqqqxxqxxqqqqxxqqxqqxqxxxqqxqqqqxxqxqqxxqxqxqqqqqxxqqxqxqxqqqqxxqqxqxxqxxqxxqxxxqxxxxqxxxxxxxxqxqqxqqxxxxxxxqqxqxqxxqqxqxxxqxxqxqqxqqxqqqqxxxqqxxxxqqqqqxqxxqqxxxqxqqqqqqqqqqqqqqqxqqxqqxxqxxxxqqqqqqqqqqxqxxqqqqqqxqxqqxqqxqqxxqxqqqxqxxxxqxqxqxxxxxxxqqxxxqqqqxxxxxqxqxqqxqxxqxxqqqxxxqqxqqxxxxqxqqxqqqqxxqqqqxxxxxxqqxqqxqxqqxqqqxxxqqxxxxxxxxqxxqqxxxqqxqqxqqxqxqxqxxqxxxqqqxqxqqxxxqqqxxqqqqxqxqxqxxqxxqqqxqxxxxqqqqxqqqxqqxxqxqxxqxxxqxqqqxqxqxxqqqxqqxqqxqxxxqqxxxxqxqqqqqqqxqxxqqqxqqxqqqqxqqqqqxxqqxqqqqxxxqxxxxxqqqxxxxqqqxxqqqxxxxxxqqxqxxxqqqxxxxqxqxxqqqxxqxqxxxxqqqxxxqqqxxxqxxqqxxxxxxqqqqxqqxxxxqqxxxqqqqxqqqqxxqqxqqqxqxqqxqqqqqqxqxxxxqxqxqxxxqqxqqqxxxxqxqqqxxxxxqqxxxxqxxqxxxqxqqqxqxxqqxxqqqqxqqqxxxqxxqxxqqqqqqxxxxxxqqqqqxqqxxqxxqxxxqqxxxxqxqqxqxxqxqqqqxxxxxxxxqqqxxxxqxqxqxxxxqxxxqqxqqxqxqqqqxqxxxxqxxxxxqqqxxqqqxxxqqxxxxqxxqxxqxxxqxqqqxqxxqqqqqqxxxqxqqxqqxxxxxxqqxxqqqxqqqxxqqqqqxqxqqqxqxxqqqqqqqxqxqxqqxxqxxxxxqxxxxxxxxqxqxxxqxxqxqqqxxqqxqxxqxxxqxqxxxxxxqqxxqxqqqqqqxqqqxxxqqqqqqqxxxxqxxxxqxqxqqxqxqqxxqqqqqqxxqqxqqxxqxqqxxxqxxqxxqxqxqqqqxxqxxqqxqqqqxqxqxqxqqxxxxxqqqxxqxqxxqqxqxqxxxqqxxxxxxxqxxqxqqqqxxqxqxxqxxqxqxqxxxxxxqxqxqxxqxqqqqxxqxqxqqqxxqxqxqqxxqxxqqqxqxxxxxqxxqxxqqqxqqxqxxqxxqxxxxqxxqxxqqxxxqxxqqxqqxqqqqxxxqqxqqqqqqxxqxqqqxqxqqqqqxqqxxxqxqqxxqqxxxqxqqqxqxqqqxxxqqxxqxqxqxqqqxqqqxqqqqqqqqqqxqxqxqxxxxxqxqxxqqxxqxxxqqqxqxxxqxqqqqxqqxqqxxqqqxqxqxqqxqqxqqxqxqqxxxxqqxqqqxqxxqxqqxqxqxxxxqqqxqxxqxqxqqxqqqqqxqqqqqxxxxqxqqqxqxxqxqqxqqxqqqxqqqqxxxxxqqxxxqxxqxqqxxxxxqqqqqxqxqxxqqxxqqqqqqxxqqxxxqxxqxqxxxqqqqqqxqqxqxqxqqxqxqqqxqqxxqxqqxxxqxqxqxqqqxqqqxxqqxxxqqqqqqqxxqqqqqqqqxxxqxqxqqxxxqxqqqqxxqxxqxqxqxxqqxqqxxqxqxqqqxxqxqqqxxxxxxqqqxqqqqxxqqxxxxxqxxxqxxqqxxxxxqqqxqqqqxxxxqqxqxqxxxqqqxxxxqxxxqqxqqxqxxxqqxxxxxxxxxqqqxqxqxxxxqqxxqxxxxxqqxqqqxxqxxxxqqxqxxxqqxxqqxxqqqxxqqqxqxxqxqxqqxxqqqqxxxqqxxqxqqqxqqqqqqxxqqqxqxxxxqxqqqqxxqqqxqxqqqqxqxqxxxqxxxxqqqqqxxxqxxxxxqqxxqqxxqqxqxqqqqxxqxqqxxxxqxqxxqxxqqxqxqxqqqqqxqxqqxqqqqxxqxxxqxxqxxqxqqqqxqqqxxqqqqqqqqxxxqxqqqxqqqxxxqqqxqxxqqxqxxqqxqqxqxxqxxxqqxqqxqxqxqqqqxqqqxqxxxxxxxxxqxxqqxqqqqxqqxxqxxqxxqxqqxqxxqxqqqqxqxqqqxqxxqxqxxqxqqqxxqxqxxqxxqxqqxqxqqqqqxqxqxqqxqqxqxxxxqxxxxqxxxxxxqxxxqqxxxqqxqxqqxqqxxqxxxxqqxxqqxqqqqxxqqqxxxxqqqqqqxxxxqxqxqqxqxxqqxxxxxxxxqxxqqxqxxxxqxxqqxxxqxqqqxqxxqqxqxxxqqxqqxqqxqxqqqxqxxqqqqxqxxxxxqqqxxqqxxqqqxxqqqqqxqqqqqqxxxxxqqqxxxxxqqxxxxqxqxqqxqqxxxxqqqqqxqxqqqqxqxxxxxxqqxqxxxqqqqxqxqqxqqxqqxqqqqqqxxqxxqxxxxxxxxxxqxxqqqqxxxqqxqxqxqxqqqxqqqqqxxxxxxxqqxqxxqqxxxxqxqxqxxqxxqxqqxqxqqqxqqqqxqqxqxqxqxxxqqxxqqxqqxqqqxxxxxqqxqxxxxqxxqxqqxxxxqqqxxxqqxqqqqxxqxxxqqqqqqxqqqqqxxqqxxqxqqqqxqqqxxqqqqqxxqqqqqqxxxqxqqqxxqxxqqxxqqqxqxxqxxxxqqqxxqxqxxqqxqxqxqqxxxxqqqqqxqqqxqxqxqxxqxqqqqqxxqxqqxxxqqxqxqxqqxxqqxqxxqqqqxqqxxxqqxxqxqqqxxxxxqqqxxxqxqqqxqxqxqxxqqxqqxqqqqqxqxxxqxxqxqxqxxqqqxxxxxqqxqqxqxxxqqxxxxxqxqqxxqxqxqqqxxxqqqqxqqxqqxqqxqxxxxxqxqqxqqxxqqqxqxqqxqqqqxqxxqxxqqxxxqqqxxqqxqxqxqxqqqqxqxxxxxxqxxqqqqqqqqxqqqxxxxxxqqqqxxxqqxqxqqqqxqqqqqqxqxqqqqxxqxxxqqqqqqxxqxqqqxxxqxqxxxxqqqqxxxqxxqqqxqqqxxxqqxqxqxqqxqxxxqxxxqqxqxqxqqxqxxqxxqxxxqqqqxxxqqxqqqqxqxxxqqxqqqxxxqqxqqxxqxqqxqxxxxxxqqxqxxxxqqqqqxxqxxqqxqxqxxqqxxxqqqxxxqxqxxxxqxxqqxxxqqqxxqqxqxqxqqxxxxxqqqxxxxxxxxqxxqqqxxxxqxxqxqxqqqqqxxxxqqxqxqqqxxqxxqqqqxxxqqqqxxxxqxxqxqqqxqxqxxqxqqqxxqqxxxxqxxqxqxqxxxxqxxxqxxqxxqxxxxqxqqqxxxqxqxqxqqqqqqqxxxxxqqxxqqqxqxxxqxxxqxxqqxxqxqqqqxqxxxxqxqxxqxxqqqxxqxqxqxqqqxxxqqxxxxxxqxxqqxxxqxxqxqqqxxqxxxqqxxqqqqqxqxqqqxxxqqqxqxqxqxqqqxxxxqxxqxxqqxxxxxxqqxxqxxxxxxqxqqxxqxxqxxqqqqxxqxqqxqxxxqqxqqxxqqqxqxxqxqxqqxqqxqxqqqxxqqqxxqxqqxqxqxqqqqxqxxqqqxqxxqqxqqxqxqqqxqxqqxqqxxxxqxqqqqxxqqqxxqqqxxqqqxxxxxxqqxxqxqxxqqxqqxqxxxxxxqxxxxqqqqqxqqxxqqxxqxxxqqqqqqqqqqxqqxxxxxxxqxqqqqqqqxxxqxqxxxqqqqxxxxqqqqxqqqqqqqxxxqxqqqxqqqqxxxxqxxqqxxxqqxxxqqxqqqqqxxqxxxqxxxqxxqqqxxxxxxxxqxqqxxxqqxxxxxxqqqqxxxqqxxxxqxqqxqqqqqqxxxqxxxxqqxxxqqqxqxxxxxqqxxqqqxxxxxqxxqqxqqxxxxqqqxqxqxqxxxqqqxxqqqqxxqqqqqqqqxxxxqxqqqxqqqxxqqxxqxqqqxxxqqqqxxqqqxxxxxxxxqqqqqxxqqxxxqxqxqqxqxxxxqqqxqqxxxxxxqxqxxxqqxxqqqqqqxxxxxqxqxxxxxqqqxqqxxqqqxxqxxqqqqxxqxqqqxqxqqqqxqxqqqxxxxxqxqxqqxxxxxqqxxqxqxqqqxqxxqxxxxqqxxqqxqxqxxxqqxqqxqqqqqqxxxqxqxxxqqxqqxqxxxqqxqqxqxqqqxxqqxqqqxqqxqxqxxqqqqxxxqqqqxxxqxxxqqxqxqqxxxxxqxxxxxqqxxxxxxqxqxxxxxxxqxxxqxxqxxxqqqqxxqqqxxxxxxqqxqqqxxxqxqxxxxqqqxxqxqxqxqqqqqqqqqxqqqqqqqxxxqqqqxxqqxqqqqqxxxxqqxqxqqqqqxqqxqqqqxqxxxqxqxqxqxqqqxxxqqxxxqxqqqqxqxqxqqxxxqqxqxqxxqxxqqqqxqqxxxxqxxxqxqqqqqqqqqxqxqxqqxxqxxqxqxxxxqqqxxqxxqxqqqxxxxxxxqqqqxxqxqqqqxxxqqqqxxqxqqxqxqxxqxqxxxxxqqqxqqxqqxxqxqxqxqqqxxqxxqqxqxqqqxxxxxxxxqqqxqqqqxqqqxxqxxqxxqqxqxxxxxxxxqqqxxqxxxxqxqqqqxxxqxxxqqxxxxxxqqxqqqqxqqqqqqqqqxxxqqqxxxxqxxqxxqxxxxqxqqqxxxxqxqqqqxxxqxqqqxqxxqxxqqqxqxxqxxxqxqqxqxxqxqxxxqxxqxxqxqxqqxxxxqxxqxxqxxqqqqqxqxxqqqqqxqqxqxxqxxqqxqxqxxqxxqxqxqqxqxxxxqxqxxqqxqqxqxxxqxxxxxqqqxqqqqqxxxqxqxqqqqxqxxxxqqxqxxqqqxqqxqxxxxqxxqxqxxxqxqxxxqqqxqqqqxqqqqxqqqqxqxxqqxqqxxqqxxxqqxqxxxxqxqxqqqqxqqqxqqqqxxxqxxqqxxxxxxqqqxxxqxqxqqqqxqqqqxqxxqqqqqqqqqxxqxxqxxxqqqxxxxqxqqqxxqxxxqxqxxqxxqqxxxxxqqqqxqqqxxxqqqxqqqqxqqqqxxxxqxxqxqqqqxxxqqxqxxxxqqqxqqqqqxqxqxqxqqxqqxqqqqqqqxqxqxxxqxqxqqxxxqqxxxqqxxxqxqqqqqxqqqxxqxqxxqxxxxxqqqxqqxqqxqxqqxqqxxqqqxqxqqqqqqqqqxqxqxqqqqqxqqxxqqqqqqxxqxqqxqqxqxqqxxqqqxxqqqqxxqxxxqqqxqxxxxqxqqqxxqqxxxqxqqqqqqqxqxqxxqxxqxxqqqqqqxxqqxqqxqqxxqxqxqxqxqqqqxqxxxqqqqxxxqqqqqqqxqxqxqxxxxxqqqqxqxxqxqqxqxqqxxxxxxqqxxxqqxxqxxxqxqqqqqxqqxxqxxqxxqqqxxxqxxqqxxxqqxxqxqxqqxxxqxxxqxxxxxqqqxqxqxxqqqqxqqqqqxqxqqqxxqxxqqxqxxqqxqqxqxqqqqqxxqxqqxxqqqqqqqqxxqqxqqqxqxqxqxxxxxxxxxxqxqxqxxxqqxxqqqxqqxqqqqxqqqxxqxxxqqqxxqqxqqqqqqqxxxqqqxqxxxxxxqxxqqqxqqqqxxxxqqqqqqxqxxxxxxxqqqqqqxqxqxqqxxqqqxxqxxqqqxqqqqxxxxqqqqqxqxxxqxqqxqxqqqxqxxxqqqqxxqxqxxqxqxxxxxqqqxxqqxqxqxxqxxxqxxxqqqqqxqqqxqqxxxqqqqqqqxxxxxqxxxqqxqxxqqxqqqqqqqqxqqqxqqxxqqqqqxqxqxqqxxqxqxxqqqxqqqqqqxxqxxxxqxqqxqxqqqqqqqxxqxqxxqqqqqqqqqxxxxqxxqxqqqqxqqxxqxqqqxxqxqxxxqxxxqxxxxxqxxqxxxqxqqxqxxqqqqqxxqqxqxxxqxxqxxqqqxxxxxxxqqxqxqqqxqxqqqqqqqxqqxxxxxxqqqxqqqqxxqxxxqqqqxqxxqxxqqxxqqxxxxqqqxqqqxxxqxxxqxxxqxqqxqqxqxqqqxqqqxqxqxxqqxqqqqxqxxxxqxqqxxqxqxxxqxqqqqqxxqqqxqxxxxxxxqxxxxxxxxqqxxxqxqqqqqqxqxxqqqqxxqxqqqqqxqxqqqxqxxxxqxqxxxxqqqqxxxxqqqxqqqxxxqqqqxqxxxqqxqqxxxqxxxxqxqxxqxxxqxxqxxqxxxxqxxxxxqqxxxqqqqxxxqxxqqxxxxqxqxqxxxqxqqxqxqxqqqxqqqxqqqqqqqxxqqxqxqqqxxxxqqqxxxxxqqqqqqqxqqqqxxxxxqqxqxqqxxxxxqqqxxxxqqqqxxqxqqxqqqqqqxqqqqxqxxxqxqqqxqxqxxxqxxqqxqqxxqxqqqqqxqqqxqxxqqxqqqqxqxxqqxqqxqxqqxqxqqxqqxxxxxqqxqxxqqxqqqxqqxxqqxxxxqxqqqxxqqxqqqqxqqqqxxqqqqxqqqxxqqxxxxxxqxxxxqqxqxxxxqxqxxqxxqqxxqxqqqxxqxqqxxqxxxqqqqxxqxxqxxxqxxxxxqqqqqqxxxqqxqxxqqxxxxqxqxqqqqqqxqxxqqqqxqqxqxxxxqxqxxxxqxqqqxqxxqqqxxxqxqxqxqxqqqxxqxqxxqqxxxxxxxxxqxxqqxqqxqxqxqxxqqqxxqqqxqxxxxxxxqqqxxxxxqqqqxqxxxqxxxqqqqqqqqxxqxxqqxxxqqqxqqxxxqqxxqxqxqqqxqxxqqxxxxqxxqxqqqqxqxxqqqqqxxqxqxxxqqqxxqqqxxxqqxqxxxqxxxxxqxxqxxqqqxqxxxqqqxqqxxxqqxxqqxqqqqxxxxxqqxxqxqxxxqqxxxxxqxqqxxxxqqqxxxqxxqxqxxqqqqqxqxqqxxxxxqxqqxxxxxxxqqqxqqqqxxqxqqqqxqxxqqxqxxqxxqxqxxqqxqqxxxqxxxxxqxxqqqqxqxqxqxxqxqqqqqxxxxxxxqqxqqxqxqqxxxqqxqxqqxxxqqxxxxqqxxxxxxqxxqxqqxqqqqxxqqxxxxxqqqxxxxxqqxxqqxqqqqqxxxqxqqxxxqxqqxxqqxqxxxqxxqxxxxxxxxxqxqxqxxxxxqqqqxqqxxxxqxxqqqqqqxqxxqxqqqqxqxqxxxxxqxxqqqxxqxxqxqxxqxqxqxxqqxxxqqxqqqqqqqxxqxqqxxxqxqxqxxqqqqxxqqqqxqqxqqxqxxqxxxqqxxqqqxxxxqqqqqxqxqxxqqxqqxxxqxxqqqxxqxxqqxxqqxqqqxxqqqqxqxxqxqxqqxxxqqxqqxqxqqxxxxqxxxxxxqqxxqqxqxxqxxxxxqxxqqxxqqxqqqxqxxqqqqqqxxxqqqqqqxxqxqxqqxqqqxqxxqxqqqqxxxxxqxqxxqxqqxxqxxqxxqqqxqqqqqxqqqqxxqxqqqxqxxqxxxxxxqqqqxqqxxqqxqxxqqqqqqqqxqxxqqxqxqqqxxxqxqqqxxqqxqqqqqqqqxqxqxqqxqxqqxxxqxqqqxxqqqxqqqxxqqxxxxqxqqqqxqxxxxxqqqxxqxxqxxxqxqqxqqxqqxxqxqxqxqxxqqxqqqqxxxqxxqqqxqqxxqqxqxqqqqqxxqxqqxqqqqqqqqqxxqxxxxqqxxxxqxxxxqxxqqxxxqqqxqqqqxxqqqxqxqqxqxxqqqqxxxqqxxqqqxxqqxxqqqxxxqxxqqqqxxxxqxxqxxqqxqqxxqxxqqqxqqxxxxqxxqqqxxqqqxxxxxxxxxxxqqqxxqxqqqqxqxxqqqqqxxqxxqqqqxxqxqxxxqxxxxxqqxxxqqqqxqxqxqxqxqqxqxqqqxxqqxxqqxxqqxqxqxxxqxxxqqxqxqxqqqqxqxqxxxxqqqqqxqqxxxxqqqqqqxxxqxqxqxxqxxxxxxxxqxqxxqxxxqqxqqxxqqqqqqxqqxqxxxqqxxqqxqqqxxqxxqxqxqxxqqqxxqxxqqxqxqxxqxqqqqqqxqxqqqqxxxqxxxqqxqxqxqqxqqxqqxqqqqqqxqqxqqqxqqxqxxqqxxxqqqxqxqxxqqqqqqqqxqxxqqxxqxqxqxqxqxqxqqxqxxxxqxxxqqxqqxxqqqqxqqxqxxqxxqqxqqxqxqxxqxqxxxxqqxxqxxxxxxqqxqqqxxqxqxqqxqxqxqqxxqxxqqxxqxqqqqxqxqqqqxxqqqxxqqqxxqqxqqxxxqxxqxxqxqqxqqxqqxqxxxxxqxqqqqqxxxxxxqxqxqqxxqqqqqqxxqqqxxxqxqqqxqqxxxxxxqxxqqqxxxqxqxqqxqxqqqxqxxqxqqqqxqqqqxqqqqqxqqxxxqxxqxqxxxxxxqqxqxxqxxqxqqxqqqxqqxxxxxqqxxxqqqxqxqqxxqxqxqqxxqxqxqxqqqqqqxxxqqxxxxqqxxqqxqxqxqqxxxqxxqqxxxxqxqqxqqxxxxxxxxqxqxqxqxxxqxqxqxxqxxqxqqqxqxqxqxqxxqxxxqqxqxqqqqqxqqqxqqqqxqqqqqqqxxqqqqxqqxxqxxxxqxqqqqqqqxqqxqqxqqqqxxxxqxqxxxqqxqxxxqxxxxqxqxqxqxxxxxxxxqxqqqqqqqqqxxqxxqqqqxxxqxxqxqxqxxqxqqqxxxxxxqqqqxxxxxqqxxxqxxqxqqqqxqqqxqqqqxxxxqxxxxxxxxqxxqqqxxqqqqqxqqxqxqxqxxqxxxqxqqqxqqxxxxqqxxqqqxxqxqxqxxqxxqqqxqxxxqqxxqxqqqxqxxxqxqxqqxxxqxqqxxxqqqqxxqqqqxqqxxxxxqqqxxxqxqqqqxqqxqxxxxqxqqxqqqqqqxxqxxxxqqqxqqqxxqxxxxqqqqxxxxxxxxqqqqqqxxxxqqxqxxxqqqxxxqxqqxqqqqxxqxqxxxqqxqqqxqqxxxxxqqqqqxxxxxqqqqxqxxxxxqqxqxxqqqxqxqxqxqxxxxqqqqqqxqqqqxxxqxqxxqxqqxxxxqqxqqqxxxxqxxqqxxxxxxxxxqxqxxqxqxqxqqxxqxxxqxqqxqxqqxqxxqqxxxxxqqxqxqxxxxxxxxqqqxqqqxqxxqxqxqqxxqxxxxqxqqxqqqqqqxqxxxqxqqqqxxqqqxqqqxxqqqxxxqxxqxqqxqqqqxqqqxxqxxxxxqqqqxqqxqqqxxqxxxqxxqxxqxxxxxqqqxqxqqxqqqxxxxqxqqxqqqxxxqqqqqqqqxqxqqqqxqqqqxxxqqqxqxqxqqqqqqxqqqqqqqxqxxqqxqqxxqxxqxqxqxxqxxxqqqqqxxxqqqqqxxxxxqqxqxxxqqqqxqqxqqxqqqqxqxqqqqqqqqqxqxqqqxxqqqqxqxxqqqxxxxqqqqqxqqqqqqxxqxxqxxxqxxqxxxxxxqxxqqqqxxqqxxqqqxqxqxqqqqqqxqxqqqxxxxqxqqxxqqqqxxqqqxxxqxxxxxqxqxxqxqqxqxxqxxqxqxqxxxxxxxxqxqxxqxqqqqxxxxqqqqqxxqxxxqxxxqxxqqxxxqqxxxqxqxxxqqxxxxqqqxxxxqxxxqqqxxxxxqxxxxxxqqxqqqxqqqxqxqqxqqqqqqqxqxqqqxxxqxqqqxqqxxxqqxxqxqqxxxqqqxqxqqqqxxqxxxxxqxqxxxqqxxxqxxxqqqqqqqxqxqxxxqxqxxxxqqxxxqxxqxxxxqqxqxxxqxxqqqxxxxqqxxxqxxqxqxqqxxqxqxqqxqxqxxxqqxqqqxqxxqxxqqqxqxxxxqxqxqxqqxqxqqqqqqqxxqqxqqxxxqqxqqqqxqxqxqxxxxqqqqxqqqqxxxxxxxxxxqxxxqqqxxqxxqqxqqxqxqqqqqxxqqqqqqxqxqxxxxxxqxqxxxqxxxqqxqqxqxqxqxxqxqqqxqqqxxxqqxxxqxqxqqqqqxqqqxxxqxqxqqqqqxqqxqqqqqxxqxxxxxqxqqxqxqxqxqqxqxqxqxqxqxqqqqqqxxqxxqqxqqxqqqqqxxxxqxqqqxxqqqqxqqxxxxxqxxqqxxxqxqxxxqqqxqqqqxxxxxqxqxqqxxqqqqxqqxxxxqqqqqqqxqxxxqxxxxqqxxxxqxqqqqxqqqxqxxxxqxxxqxxqxxxqxxqxqqqqxxqqqxxqqxxqxqqxqqqxqqxqqqxqqqxqqxqxxqxqqqqxqqqqqqqqqqxxqxqxxqxxxqxxqqqxqxqqqqxqxqqxqxqqxqqxxqxqxxxqxqxqqqxqqqqqxqxxxxqxqxqxqqxxqxqqxxxqqxqqqxqxqxxxxqxqqqqxqqqxqxqqxxxxqxqqqxxqxxqxqqxqqqxxxxqqxqqqxqqxxxxqxqxqxqxxqqqqqqxxxqxqxxqxxxqxqxxqxqxqqqxqxqqqqxqqxqxxqxxxqxxxqxxxqxqxqxqxxxqqqxxxxxqxxqqqqqqqxqxqqxqxqxqqxxqxxqxqxxqqqqxxxqxqxxqqxxxqxxqxxqqqqxxxqxqxqqqxxqxxxqxxxxqxxxxxxqxxxqxxxxqqxxxxqxxxxxqxxxxxqxxxqxqqqqxxqqxxxxxxqxxqqxxxqqxqxqqxxxxqqqxxqxxxqqxxqqxqxxxxqxxqxxxxqxqqqqqqxqqxqxxxqxxqqxxqxqxqqqxqxxqqqqxqxxxxxxqqxxqqxqxxqqxqqqqxxqqxxqqxqxxqqqxxqqxxxqxqqxqxqqqqxxqxxxqqqxxqxqqqxxxqxxqxxxxqxqxxxqxqqqxqxxxxxqxqqqqxxqqxxxqxxqxxxxxxxqxxqxxxqxqqxxqqxqqqxqxqqqqxqqqxxxxxxqxqqxqqxxqxqxxqxxxqxxqxxqxqxxqqqqqqxqqqxxqxqxqxqxxqxqqxqqxqxxxqqqxqxxqqxxxxxqqxxxxqqxxqxqqqxxqxqxqqqqxxqxqqxqqqqqxqqxxxxxqxxqxqqqqqxqqqxqxqqxxxxqqxqqqqxqxxqxqxxqqxqqxxqxqxqqxqxqxqxqxxxxxqxqqqqqqqqqqxxqqqqxqqxqqxxxxxqqqxqxqqxxqxxqqxxxxxqqxqxqxqqxqxqxxxxqqqqxqxxxxxqxxxxqxqxxxqxqxxxxqqxqxqxqxqqqxxqxqqqqqqqqxxxxqxqxxqxqxqxxqqqxqxxxqqxqqxxxxxqqxqqxxxxxqxxqxxxqqqxxxxqqqqqxxqqqxxxqxxqxxqxqxxqqxxqqqxqxqxxqqqqxxqxxxqqqxxqqqqxqqqxxxqqqxqxqxxxxxxxqxqxxxxqqqxxqxqqqxxqxqxxxqqxxxxqxqqxqqqxqxqqqxqqxxqqqxxxxxqqqqxxqxxqqxqxxxxqxqqqxxqxqqxxqxxxxxxxqqxqqxqqqqxxqqqqxxqxqqqqxxxxqqxxqqxqqqxqxxxxxxqqxqqqqqqqqxxqxxqqxxxqqxqqqqxqqxxxxqqqxqxqxxqqqxxqxxxqqqxqqqqxqqqxqxqxxqqxxqqqqxqqqxqxxxqqxxqqqxxqxxxxqxxqxxxxqxxqxqxqqxxxxxxqqqxqqqqxxxxqxqqxqxxqqqqxxxxqqqxxqqxxxqxxxqxqqxxqxqqxqxxqxxxxqqqxxqxxxqxqqqxxqxxxxxxqxxxqxqxxxxqqxqxxxqxxqxxxxqxxqqxxxqxqxqxqqqqqxqxxxxxqqxqqqxxqqxqqqqxqxxqqqxqxqqqqxqxxxxqxqxxqxxqqqqxxqxxxxqqqxxxxqxqxqqqxqqqqxxqqxqqxqqqxxqxxxqqqxqqxqqxqxqxxxxxqqqxqqqqqxqqxxxqxqqxxqxqqqqqxxxxqxxqqxqxxxqxqqxxqxxxxxqqqqxxqqqqxxqxxqqxqqxxqqxxqxqqqxxqxxxxxqxxqqxxxqqxqxqxxxxqqxqqqxxxxqqqxxqxxqqxxqxqxqxqxqxqxxqqxxxxqxqxqxxqxxqxxqqqxxqxqqqxxxxqxxxqxqxxqqxqqxqqxxxxxxxxxxqqqqqxqqxxqqxxqqxqqqqqqqxxqxxqqxxxxxqqqxqqqqqqxqxxqxqxxxqqxxxxqxxxqqxxqqxqqqxxxqqqxqxqqqqqqxxqxqqqqxxqqxqqqxxxqqqqxqqqxqxqxxqqxqqqxxxxxxxqqxqqxxxqqxxxxxxqqqxxqxqxqxxxqxxqxqqqxqqxxxxxxqqqqxqxqqqxqxqxxxqxqxqqqxqxxqqxxqxxqxxxxqxqqxxxqqxxxxxxqxxqqqqqqqqqqqqqqxxxxqqqqqxqqxxxqxxxqxqqqxxxxqqxxxqqqxxxqxxqqxqqxxxxqqxxxqxqxqqqxxqqxqqqqqqxqxxxxxqqxxqqxxxqqqqxqxxxxxqxqqxxqxxqqxqqqxqqqxxqqxxqqqxxxxqxxxxxqqqqxqxqqxqxqxqqxqxqxxxqxxxqxxqxxxqqxxqxqxxxqxqxxxqqxqxqxxxqqxqqxqqqqqqxxxxqqxxxxqqqqxqxqqqxqqqxxqxqqqxqxxxqqqxqxqxxxxxqqqxxxxqqqxxxqxxxxqxxxqqxxqxxqxqxxxqqxxxxxxqqxxxxxxxxqxqxqqxqqxxxxqqxxxqxxxxxxqqqxqqxxxqxxqxxxxqqqqqqxqxxxqxqqqqqqqxqqqqxqxqxxqqqqxqqqqqxqqqqxxxqxqqqqqqxqxqxqxqxqxqqxqqxqxqqxqqxqqxqqqxxqxxxqqqxqxxqqqqxxxqqqxqxxqxqqqqqxqxxxxxqxqxqxqqqqqqqqqqqxqxqxxxxqxqxqxqxqqqqxxqxqqxxqqxxxxxxxqxqqxqqxxxqxxqxxqxxxqqxxqqxxqqqqxqxxxqxxxqxqqxqxxqqxqxqxqqqxxqxqqqxqqqqqxxxxqxxxqxqxqqqqxxqqxxqxqqxxqqqqqxxxxxxqqqqqxqxxqxqxxqqxxxxxxxxxxxxxxxxqqqqqqqxxxxxqxqqxxqqqqqxxqqqqxqxxqxxxxqxqqqxqxqqxqxqqxxxqxqxqqxxxqxqqxqqqxqqxxxqxqqxqxxqxxxqxqqqqxqxxqxqqxqxxqqxqxxqxxxxqqqxqxxqqqqqxqqxxxqxxxqqxqxqqxxqqxxqxqxxqxxqxqxqxxqqqqxxqxxxxxxxxxxqxqqxxxqxxxqqqqxqqqqqqxxxqqxqxqqqxxqqxqqxxqqxxqqqxqxqxxqqxxqqqqqqxxxqqqxqqxqxxxxxqqqqxxqqxqxqqxxxxxxqxqxqxqqxqxqxqqqqxxxxxxqqxxxqxqqqqxxxqxqxqqqqxxqqqqqqxxqxqqqxqqxxqxxqxxxqqqqxxxqxqqqxqqqxxqxqxxqqqqqxxxqxxqqxqqqqxxqqqqxqxqqxqqqxqqxxxxxqxqqqqqxxxxqqxxqqqxqxqqqqqxqxxqqxqqxqxxqxqqqqxxqxqxqxqxqxxxxxxqqxxxqqxxxqqqqqqqxxxqqxqxqxxxxxqxqxxqxxxxxqqqxqqxqxxxqqqxxxqxxqqqqxqxqxqxqqqqqxqxxxqxqxxqxxqxxxqqqxqxqqqqqxqxxqqqxxxqxqxqxqxqxqxxxqqxqxqqqxxqxxqqqqqqqxqxqxxxqxxxqqxxqxqxxqqxqxxqqxqqxqqqxqxqqqqqxqxxqqqxxxxqqqqqxqxxxqxqxxqxqqqqqxqxxqxqqxxqqqxxxqxxxqxxxxqxxqxxqxxqqqqqqqqxxqxqqxqqxqxxxqxxqxxqqqxxxxxqxqqxqxxxxxqxxxxxqqqxqxqxqqqqqxqqxqqqqqxqqqxqxqqqxxxxqqxqqxqqqqqxxxxqqxxqqqqqqxxqqxxqxxxqxxqxqxqxxqxxxqxqxxxqxqqxxqxxxqqqxqxxqqqqxqqqxxqqxqxqxxxxxxxqqqqqxxxqqqqqqqqxxxxqxxqqqxqqxqxqxqqxqxqqxqxxxxxxxxqqqqqxqxqqxqqxqqxxqqxxqqqxqxxxxxqxxqxqqxqxxqqxqqxqxqxqxqxxxxxxqxxqqqxxqqxqxqxxqxqxqqqxxxxxxxxxxqxqxqqqxqxqqqxqqxxxqqqxqqqqxxxqqxxxqxxqxxqxxqqqqxqxxxqqqxqqxqqqqqqxqxqqqxxxxxqxxqqxxqxqqqqxqxxxxqxxqqqqqqqxqqqxqxqxqxxqxqxxqqqxxxqxqqxqxqqqqxxqxxqxqqqxxqxqxxqqqxxqxxqxxqqqqxxqqxqqxqxqqqqqqxxqqxqxqxqqxqqxqxqqqqxxxqxxxqxqqxxqxqqqxxqxxxqqxxxqqqqqxqqqxxxqxxxqqqqxqxxqqxqqqxqqqxxqqqqxqqqxxxqxxxqxxxqqqqxxxqqxqqqxqxqxqxqqqqqqqxxxxqxqqqqqqqqqqxqxxqxxqqxxqxxxqqxxxxxqxxxxxxqxxxqxqxxxxqxqxqxqqqqxxqxqqxxqxxqqqxqqqqqqxqqxqxqqqqqqqqxxqxxqxqxqqxqqxqxqqqxxxxqxxqxqqxxxqxxqqqxqxxxxxxxxxqqxqxqxxqxqxxxxqqxqqqqqxqqxxqqxxxxxqxqqqxxxxqqqxqqqxqqqxqxqqqqqqqxqqxqqqqxqqqxqqxqxqxxxqxqqqqqqqxxxqqxxxxxqqxqxxxxqxqxqqxqqxxxqqqxqqxqqxqqqqqqxqqxxxxxxxqxqqqxqxqxxxqxxxqxxqxqqxqqqxqqxqqqqqqqxqqqqqqxxxqqxxqqqxqqqxxqqxqqxxxxxqqxqxxqxxqqqxqqxxqqqxxxqxqqqxxxqqqqqxxqxqxqxqqqqxxqqqxqqxxxxxxqqxxxqqxqxxxqqqqxqqxxqqxxxxqqxqqqxxqxxqqxqqqqqxxqxxqqxxqxxxxqqqqqxqxxqqqxqqxqqxqxxqqxqxxxqqqxqxxxxxqxxxxqxxxxqxqxxxxqxqqxxxqxqqqxxxqxqxqqxxxqqxqxqxxqqqxxxqqxxxxqxqqqxqqxqqxxxqxxqqxxqqxqxxqqqxxxqxqxxxxxqqxxqqxxxqxxqqqqqxqqxxxxxqqqxxxxqxxqxxxxqxqqqxqqxqqxqxxqqxxqxxxxqqqqqqxqqxqqqqxxxqxqxxxqqxqxqqqxxxxxqqqxxqxxxxxqqxqxxqqqqxxxxxxqqqqxxqqqxxxqqqqqxxqxxxxxqxqxqxxxxqxqxqxqxqqxxqxqqqxxxqqxqxqqxqxqqqxxqqqqxqqxqxqxxxxxqxxqqqqqxxqqqqxqqqqqqxqxqxqxxxxxqxxxxxqxqqqxxxxxxxqqxxqxqqqqxqxqxxxxqqqqqxqxxxqxqqqqqqqxqqqxxqqxqxxqxxxqxxqxqqqxqxqxxqxxqxqqxqxqqxxqxxqqxxqqqxxxxxqqxxqqxqqqqqqxxqqqqxxxqxxxxxqqxxxxxqxxqxxqxxxxxxqxqxqqxxqxqxqqxxqxxxxxxxqqqqxxqqxxxxqqqqxxxxxxxxxxxxxqqxxqqxqxqxxqxqqxqxqqxxxxqxxxqxxqqxxxxqqxxxqxqxqqxqqqxxqqxqqxxxxqqxxxxqxqqxqxxqqxxqqqxqqqqxqxqxxqqqxxxqxxxxqqqxxqqxqqxxxqxqqqxxqxqxxqqqqqqxxqxxqqqxqqxqqqxqxxxqxxxqqxqqxxqqxqxxxqxxxxqqxxqxqqxxqqqxqxxxqxqxqxxxqqqqqqxxqxxxxqxqqqxqxxqxqqqqxxxxqqxxxxxxqqxqqqxqqxqqxqqxqxxxqqqqqxxxqxqxqxxqxqqqqxqqqqqqqxxxqxxxqqqxqqqqqxqxxqxqqxqxqxxxqxqxqxqqqxqqqqqxqxxqxqqqqxqxqqqxxqxxqqxxxqxqqqqqxxxxxxxxxqqqqxqxqxxxqqqxqqxqqxxxqxqxqqxxqxxxxxxqxxxqxqqxxqqqxqqqxxqqqxqqxqqqqxqqqqxxqxqxqqxqqqxqxqqqxxxqxxxqxxxxxqxqxxqqqxqxxqqqqxqxqxxxxxqqqxqqxqxxqqxqqxqqxxxqqqxxqxqxxqqqxqqqxxqxqxxxqqxxqxxxqqqqqxqxxqqqxqqxqxxqqxqqqxqqqxxxxxxxqxxxxxqqxqqxqqqxqqqqxxqqqxqqqxqqqqxqqxqxxxqxxxxxqqxxqqqqxxqxxqqxqxqqxqxqqqxxqxxqxqxxxqxqxqxxqqqxxqqxqxqqxqqqxqxqxxxxqqqxqxqxxxqxqqqxqqxxqqxxxqxqxxxqqxxxxqxxxqqxxqxqqqxxxxqqxqqxqqqqxxxqxqxxxxxqxqxqqqqxxxqxxqqxxxqxqqxxqxxxxqxxqqqqqqqxqqqxxxxqxxxqqxxxqxxqxqqqqqxqqqqqqxqxqqxqxqqqxxxqqxxxqqqxxxxxxqxxxqxxqxqxqqqxxxxqxqxqxqxqxqqqqxxqxqxxqqqxqqqxxqqxxxqxqxxqqxqxxqqxqqqqxqqqxxqxqxxxqxxxqqxqxxqqxqxxxqxqqqqxqxqqqxqqqxxxxqqqqxxxqxxqqqxxqqqxqqqqxqqxxqqxxqqxxxxxqxqqqxqxqqxqxxxxqxqqxqqqxxxqxxqxxxqxqxqqxxqqxxqqqqqxqqqxqxqxxxxxxxqxqxxqxqxqxqxqxxqxxqqxqxxqxqqqqqxqqqxqqxxxxqxqxxqxxqxxxxxxqxqxxqxxqxqxxqqxqqqxxxxxqxqqxqxxqqqqqqqqxxxxqqqqxxqqqxqxxqxqqqxxxqqxqxxqqxqqqxqxqxxqqxxqqxqqqxxxxqqqxqxqxqxxqqxxxqxxxqxxxxxqqqqqqqxqxqqqxqxqqqqqxxqxxxxqxqxqqqxqqqqqqqqqxxxqqxxqxxxxqqxqxqxxqqqxqqxxqqqxxqxqxxqqxqqqqxxxxqqqxqxxqxqxxxxxxxxqxqxxxqqqxxxxxxqxqqxqqqqqqqxqqxqqqqxxqqxqqxqxqqxxxqqqxxqxxxqqqxxxqxxqxxxqqxxqxqqqqxqqqxqqxqxxxxqqxxxxqxxqxqxqqqxqqqxqxxqqqqxxxxxxxxxxxqqxxqqxxxxxqxxxxxxxqxqxqqxqxqqqxxxqxxqxxxxxqxqxqxqxxxqxqxxqxqxqqxqxqqqqxxxqxqxqqxxqxqqqqqxxqxqqqqxqqqqqxxxxxqxqxqqqqqxxqxqqxqqqxqqqxxxqxxxqqxqxxxqxxxxqxqqqqqxxxqqqqxxqqqqxxxqxqqqqqqqxxqxqxxxqqxqqqxqqxxxxxqqxxqqxqxxxxqqxxxqxxxqqxqqxqqxxxxqxqqqxxxxxqxqqxxqqxqxxxqxqqqqxxqxxxqxxxxqxxxxqxxxqqxqqxxxxxxqqxxqqxqxxqxqxxqxxxqqqqxxxqxxqxxqqxxxxxqxxqxqxxxqxxxxqqqqqqqxqxxqxqxqqxxqxxxxqxqqxqqqqqqxqxqqqqqxxxxqqqqqqqqxxqqxqxxqxxqxqqxqqqxqqqqxqqxxxxxqxxqqqxxqqqxxqqqxxxqxqxxqqxxxqxxxqqqxxqxqxxxxqxqxxqxqqxqqqxxqqqqxqxqqqqxxqqqqxxxqqqqxqxxqqqxqqqqxqxxqxqxxqqxqqxqqxxqxqxqxxqxxqqqqqqqqxqqqqqxxxqxqxxqxxqqqqqxqqxqxxqxqxxxxqqqxqqqqqxqqqqqqxqqqqqxxqxqqxqqxqqqqqxqxqqqqxxqxxqxxxxqqxxxxxxxxxxqqqqqxqqxxxqxxxxqxqqxqqqxqqqxxqqxqqqqqxxqqqqxxxqqxqxqqxxxxxqxxxxxqqxqqqxxxqxqxxxqqxxxxxqqqqxxxqqqqxxxxxqxxxxxqxxqqxxxxxqqqxxxqqqxxqxqxqqqxxqxxqxqxxxxqqxxqxqqxqxxqxqxxxxqxqqxqxqqqxqxxqqqqqqqqqqqxxqqxxqqxxxxxqxxqqxqxxqxxqxxxqqqxqxqqxqxxqqxxqxqxqqxqqqxxxqxxxqqxqqqxxxqqxxxxxqxxxxqqxxxqxqqxqxxxqqqqxqxxxqqxxxxxxqxqxqxxqxqxxqxxxxxxqxqqxqxxqqxxqqxxxxxxxxqqqqqxxxxqxqxqxqqqqxxqqqqxxxqqxxxqqxxqqxqqqqxqqqqqxxxxqqqxxxxqqxxxqxxxxqxqxqxqqqxxqxxqqxxxqxqqqqqxqxqqxqxqxqxqxxxxxxqxxqxxqxxxqxxqqqqqqxqxxqxxqqqqxqxxxxqqxxqqqqxqxqqxqqqqxxqxqxqqqxqxxqxxxqqqxxqqxxxxqqqxqqxxqxxqqqqxqxqqqxqqqxqqxqxqxxxqqxqqqqqxxxqxxxqxqxxxxqqqqxqqxxxxxqqxqqxxxqqqxxqxqqxxqqqxqxxxqxqxqqxxqqqqqqqxxxqxqqqxqxxqxxxqxqqxqqxxxxqxxqqqxqqxxqxxqxqxqxqxxqxxqqxxqqqqqqxxqxxxqqqxqqxxqxqqqxxqxqqqxxqqxxqxxqxqxxqqqxqqxqqqqqxxqxxxxqxqxxxxqxqxqxqxxqqqxxxqqqxqqqqqqxqqxqxxxqqqqqqqxqqqqqxqxxxxxxxxqxxqxxxxqqxxxqqxxqqxqxqxqxqqqqqxqxqxqxxqqqxxxxxxqqqqxxxqqxxqxqqqxxxqxxxxqqxxqxqxxqxxxxxxqxqqqqqxqxxxqxxqqxxxqxxxxxqqxxqqxqxqqqqxxqxqxxqxxqqxxxqqxxxxqxqxxxxxqxqxqxxqqxxxqqxqqqxqqxqxqqqxqqxqqxxqxqqxqqqqxqqxxxxxqqqxxqxxxxxxqqqxxqqxqxqxqxxqxqxqxxqxqxxxxxxqxxxqxxxqqqqxqxqxxxqqqxqxqxqqqxqqqxxqxxxqxqqqxxqxxqqxxxqqxqxqxxxxxqqqxxqxxxqqxxqxxqxxxqxxxqxxqxqxxqqqqqqqqxqqqqqxqqqxxqxqxqqxxqxqqqqqxqqqqxxxqqxxqxxqxxxqqxqqxxxqqxxxqxqxxqqqxxqqqxxxxqqxqxqqxqxxqxqxqxqxxxxqqxxxxqxxqxxxxqxqxxxqxqxqqqxxxqxqxqqqqxxxxxxqqxxqxxqxqxqqxqqxxxxxxqqxqqxqqxxqqxqxqxqxqxxxqqxqqqxxqqxxqqqqxxqxxqxxxxxqqxxxqqxxqqxqqqxxxxxqxxqqxqxqqxqqxqxxxqqqxqxxxxqxxxqqxqxxxqqxxqqxxxxxqxqxxqqxxxqxqqxqxqqqqqqxxxxxxxxqxqxxqxxqqqxqxqxxxxqqqxqxxqxqxqqxqxxqqxqqxqqxqxqqqxxqxqxxxxxxxxxqqqqxqqqqqxxqqqqxqqxqqxxxxxqqqqqxqqxxqqqxqxxxqxxqxqxxxqqxqxxqxxqxqqqxxxqxqxxxqxxqxqxxxqqqxxxxqxxqxqqqxxqqqxxxqxqqqqqqxqxxqxxxxxxqxxxxqxqxqqxxqxxqqxxxxqxqxqqqxxqxqxxxxxxqqqqxxxqqqqqxxqqqxxqqxxqxqqxqxxqqxxqqqxqxxxxxqxxxxqqxxqxqxxqqxqxqqxxxqqqqxqxxxxxxxxqqqxqxxxxqxxxqxqxqxxqxqqxxqxqqxxqxqqxqxxqqxqxqxqqxxxqxxqxxxqqqqxxxxxqqxxxxxqxxxqqxxqxqqqxqxxqxxxqqqxqqxxqqqxxqxqqxxqqqqqqxxxxqqxxqqxqqqxqxxxxxxxqxqqxqqqxqxxxxxqqxxxqqxqqqqqqqqxxxxqqxqxqxxqqxxxqxxxqxqxqqqqxqqqqqqxqxqqxxqqxqxqqqqqxxqqxqqxqqxqxxxxxqxqxxxxxqxxqxqxqqxxxqqqqqxxqqxqxqqxxxqqqxqxqqxqxqxxqqqxqqqxxqqqqxxxxqxqqxqxxqqxxxqxqxqqqxqxxxqxqxqxxqxxqqxxqqxxqxqxxxxqqqqxxxxxxxqxqxxxxxqxxqqxqxxqxqqqqxqxqxxxqxxqqxxxxqqqxqqxxxqqxqxqxqxqqqqxxxqxqqxxqxxxqqqqxqxxxxxxqqxxxqxqxqqqxqqqxxxqqxqqqxqqxxqxxqqqqxqxxxqxqqxxxxxxqqqxxqqqqxqqxqqqxqqqxqxxqqqqqxqxxxxqqxqxxqxqxqxqxqqxxxqqqqxxqqqxxxqqxxqxqqxxxxxqqxqqqxqqxxxxqxxxqxxxxqxqqxqxxqxqqxqqxxxxxqxxxqqxxxxxxqxqxqxxxxxqxxxqqxxxqxxxxxqqxxqxxxqxxxqxqqqxxqxxxxxqxxxxqqxxqxqqxxqqqxqxxqxqqqqxxqxxxqqqxqxqqqqqqqxxqxxqqxqxxxqqqxqxqqxxxqxxqxxxxxxqxxxxqqxxqqxxqqxqqqqqqqqxxqxqqqxqqxqqqqqxqqxqxqqqqxxxqxqxqqqqqqxqxqqqqqqxqxxqxxxqxqxxqxxxqqqqxqxqxxxxqxqxqxxxqxxqxxqqxqqxqqxxxqqqqqqxqqqxqxqxxxxxqqxxxqqqxqxqqqxxqxxqxqxqxqxqqqxqxxxxqxqxxqxqqxqqqxqqqxqxxqqqqqxxqxqxxxxqxxxxxxqxxqqxxxxqqxxxqxqqqxqqxxqxxqxqqqxxqqqqxxqqqqxqqxxqqxqxqxqxxxqxxqxqxxqxxqxqxqqxqqqxqxxxqxxxqxxqqxxqqxxqxqxqxxxxxqxxqqxqqqxxxxqqqxqqxqqqxxxqxxxxqqqqxxqqxxxxqxxqqxxxxxxqxqqqxxxxxqqqqqqqxqqqxxxqqxqqxxqqqqqxqqqxqqqxxqxxqqqxxqxqqqxxxqxxxxxqxqxxqxxqqxxxxqqqxqxxxxqqqqxqqxqxqxxqxqxxqxqqxqqxxxqqqqqxqqxqqxxxxqqxxxqxqqxxqqqxxxqxxxqxxqxqqqxxqqqxqqxxqqxqqqxxqqxqxxqxxxqxqqqxqxqqqqxxqxqqqxqxxqqqqqxxqqxxqxqxqxqqxqqxxqqqxqxxqqqqqqxxqxqxqqxxxxxqqqqqxxqqxxqqqqxqxxqqqqxxxxxqxqqqxqqqxqxqqxqqxxxqxxxxqqqxqxqxqqxxxxqqq\ngaaagaaaaagaaaaaagaaaaaggagaagaagaaaaagagaaaaggaggaggggaaggggggggggaaaaagaagggaggggagaagaaagaaaggaagaaaaaggaaaagggaagagaagggggagggggaagaaagggagagggaagggggaaaagggaaaagggggagggggaggaagggggaaagggaaaggagagaaaggaggagaggggaaggagaagaggagaggggagaagagaaagaggaaaaaaaaaaaggaaggaagggggaggaagaggaggagggaaagagaagaggaaggagagaagaaagggagggaagaaagggaagggggaggggaagggagaagagggaaaagagggaaggggggagagaggagaggaggggggagaagaggaaggaaggggggggaaaaaggggagagagaaaaggaaaagggaagggaaggaagaaaagaaaaaggggaaaggggaagggaggggagagagaaaggaggaagggagaaaaagagaagagagagaggggggaggaggagggaggaaaaaagaggaggaaaagaggggaaggaaaagagaagaaaaggagagaaagaggagggaaaggaaggggaaagaaggaggaaaagagaaagaaagaagagagggaagaaaaagggagggagaggggaaaagaagggggaagaagggaaaggagaaggaaagagggagagaaggaaaaaaagggagaaagaggagggagaagaaggggaggaaagaaggaggagagagaggaggaaggaaaaaaggagggaaagaaggagaaaggagaaaggaaggaggagaggaaagaagaaaaaggaggggagaggggagagagaggaaagggaaagaaaaaagaagagggaaaaaaagaaaaagaggggggggaggaggggaagggaaggaagagagagaaaaagagagaggaaaggggggaaaagggaaggagaaagggaggggaaggagaggaggggggagaaaaagagggaggaagggagggggaaggaagagaaaaggagaggaggaagggaaggggagagggggagagaggaagggaagaaagaagagaaagaagaaggagaagaaaagaagggggaaaggaggggggaaaggaagagagaggagagaggagaggggggagggagggaaaagagagggaaagagagaaagaaaggagggagaaaggaggaagggaagagagggggaaaggagggaaggaggagggagggaggagaggaaaaaaaagaaaaagaaaggagagaaggagaaaaagaaaagggaaggaggagggaagaagggaagggagaggaaaggaaaggggaagagaagaggagagagaggggaaggggaggaggggagagggagagaaagggagagaaaaggggggaaggaggagagaagaaggggggaagaagaaggaagagagagagggaagaaaggaaggaaaaggaggagggggaagggaaggaagaaagggggaggaagagaagaagagggaaagaggggagggaagagggaaggaagggggagaggaagggagaagagaaaaaaggggggggagaggaggaaagagaggggaaagaggagagaagaggaagaagaagagaaaggagagggggggggaaaagaaaaaggaaaagaagaagggggaaaaagaaggaaagagggaggagagggaagaggaggagaaagggagagggaggagagggaaaggggaggagaaaggaaagggagaaaaaagaggaggggggaggggagagaaggaggaaggggagagaaaggagaggggggaaaagggaaaaaggaaaggaaggagaagaggaaggaaagagggggaggggaaggagaggaagagaagggaaaagaggggggggaaagaggggagggagagaggagaaggagaaggagaagaggaagagagaagggaggagggaaaagggggaagggggagggaaggagaaagaggagggaaagaaggaaaggagaaggaaaaaaggggaaggaagaaagagggggggagaagaaagagggggaagggaagaaaaaaaaggggaagagaggaagggagggagagaaaagaaaaaagagaaggaagagaaaaaggaagaagaagagggggagagggggaggagagaagggaaaaaggaagagaagggaaagagaagagaggaaagaaaggaaaaggggagaagaggaagggagagaaagagggagagaggaggaaggaaggagaggggaaaagggggggagagggggaggaagaggagaaaagagagggaggaaggggaaagaagggaagagagagaaaagggagaaggagggaaaagaggggggaagggagagaaagaaagggaagaaagaaggaggaaaagagggagaaggggggaaaggaaaagaagaaagaaagaggaaaaagaggggaagaggagagagagaagggaaaaggaaagggaaggagaagggggaagaaagaaggggagggaggggagaagaggagaagaagggggagggaaggggggagagagggggagggaagggagggggaaggagggagggagaaaggagggggaggggaaggagaaggaaagaggagaaaaggagggaaagagaaaaaaaggaggaagagggaaagagaagggaggaggggggaggggaaggaaggaagaaaaaaaaggagaaagaagaaaaagaagagaaaagggagagaaaaaagagaaaaaagaggagggagaggagggaaaagagaggggagagagggaggaggaagaagaagggaaaaaagaaagagagggggaagggaaagagaaaggaggagagagagaaagaggggagaggagaagaaagaaagaggaaaaaggagaggggaggggggaggaaggggaagggagaaagaaggaggagaaaggaaaaggaaaagaaggaagagagagggaggagaggaggagagaagaaagagggagggaggaaggaaggagagagggggaggaagaaaggggaaagaagaaagggaggggaaaaggaaggggaggaaggggggagaaagggggaaaaaaagaaagggaagaaggaaaaagaaagaaaggaggaaaggagaaagggagggggagaggaggaaggggaaagaggggaaaagaagagaggagaggagaagaagggaaaaagaagaaggggaagggagaaggaaagggagggaggagaaaggaaagaaggaagaaaggaagaggagggagaaagagaaaaggagaaagaggaaaaaggaaggagagagaagaaggaaagaggaaaaaaggagagaagggggaaaaaggaaggaaaagaggaaaagggggagaaagaaagagaagaagggaggggaaagagagaaggggaaaagggaaaggggaagaagaagggaggaggaggaaaagaaggaaagggagaagggaaaagaggaagaggagagaaggaaggaaaaggagaagagggagggaaggaaggagagggagagaagggggaaaaagaaaaaggggagagggggaggaaagaggaagaaaaggggagaagaaagaaagaaaaaagaaagggaagaaaagaagagaaaaaagagaaggggaaaggaaaaagaagagaggggagggaggaaggagagggggaagaagagagggggagagagggaagaggagggagagaagagaaggaaggggggaaggagggaagagagggaagaggggaggagaggggaagggaaagagaagaggaaaagaagagagaggaaaaagagaggagaggaaagaaaggggggaaagaagaggagggaaagggagagaaagggaaagggggaagggaaaaaaaggggggagggaaaagggggaggaaaaaagagaagaggagagagagggaaaagggagaagaaagggagagaagggagggaagaaggaggaagaggaaaaaggagggaaggagaagggggaaaaaaaggggaaagaaggagaaaaagaggaagaggaggagagaagaaggaagaaaagggggaagagaaaggaaaaaaagggaaaaaagagggagaggagggggaaaggagaggaaaaagggggaggaggaggagggagagagggaggggaaaagggaaagagaaaaaggggaaagagagaaggaaagagagaggagaggagagagagaaaaggaagggaggaagggagaagaagaggaggaaagagaagagggagaaggaagaagaagaggaaggagaggaaaggaagaagagagggaggaggaaggagaggagggggagaaaaaaagaagggaaaaagggaagggggaaaggggggaggaaaggggaagggaaagagagggaggagggagggagagaaaggaaaaggaagaagagaaaaagggggaggaaaaaagggaggagggagagaagaagaaggagaaggagaaagagggggaaagaagaggggaggaaaagagagggggaaaaagaaagagaaaaagggaagggaggagggagaagagaagaggggggggagagggaggagaaagagaaaagaaagagggagaagagaaagagaggaaggaagaggggagggaaagaaggaagaaaaaagaaaagggggggggggaaaggaggggaaagaaaggagagaaaaggaaggaagggaaaagagggggggggggagaggaagaaagaaaagggaggaagaagaagaaggaaggaaaggagaaaaagaaagaaagggaggaggaaagaaaagaaagaaaaagaggagagagaaaaggaaaggaggaggaaaaggaaggaaaaaaagagggaaaggagaagaaaggaaaaggaaggagaaaggagaaaggggggaagggaaaaaaagaggggagagagaaaggaaagaaggaaggaaaaagaggaaaggaggaaaagggggaagaaagggggaggaaagagggggaaaaaaaagaagaagaaggggggagagaaaggggaggagaaagagaaggaagagagagaaaggaggagggaagagggaaaaaaaaaaaaaagaaaaaggaggaaagaagagaaaggaggggaagagggagaaggaaaaaaggagagaagagagaaaagaaaaggagaaagagaagaagggggaagaagggggaaaggaagaaggggaaaaagagaaagaaaggaagaaaggagagaaaagggaggggaaggggaaaggaggaaaagaagaagagagggaggaaggagaaaaaaggggggggaaagaagagggagagaggagaaaagagaagaaagaaagaaagaagggaggggaggaaagaaaaaaggaaagagaggagagaaaaaagaaagggagggaggggagaaggagagaggaggaggaagagggaggggaggagaagggaagaggaaagagaaggaggaaaggaggaagaagaaggaaggagaagaggagaagggggaggagaaaagaagaagaggggaaaggggggggggggaaggagggaggaggagagaggaaaggaaaagagagaagagaggaaagggaaagaaaaaaaagagaagggaggaggaaagaggaaaggaagaggaagaaggaagggggaagggggaagggggaaaggagaggggggaagaaaggaggggaggggggaagaggaagaggaaggaaagggggagagaagaaagaaggggaaaggaagggggaggagaagaggggggaagagaaaggggaaaaagaagggggagaaagaggaaaaagagaaagaggaagggaaaagaagagaaaggaagaaaagaaaggaggaaggaaagggaaaagaggaaaaagaaaggggaaggaggaagaaaaggaggaagaagaaaagaaaggggaaaggaagaaagaaagaaggagaggaaggggggggaggaaagggaaagaggaggagaagaaaggggaaggaaaagaggaaggaagagaagagaaaggggaaggggggagggagaagaagaggggagggggaagaaaagagggaggaggggaaaaggaaaagaaaaaggagaaagggaggaggaaagggaagggaagagaaggagaaggaggaaggggggggggaagaaaaaagaaagagggggaaggagagaagaggaagaaaagaaaagaaagaaaaggaaagggggaagaaaaagggagagagaaggggaaaaaggggagaaaaggaaaagagggagagaaagaggaagggggagagggagggaagggggagggagggagagggaaaaaaaaaggagaggaaggaagaagaagaaaagggggggaagaaagaaagagaagagggggaaaggaggaaaaaagaaaagagaaaaagagaaggaaggagaaaggggagaagagagaaaaggagaaaggaaaagggaaggaagaagaaaaggagaggagggaaggagggggggggagaaaaaaaggggggaagaggggagagaagaaggggggagggaggaggaaagaaaaaaggaggaaaaagagagggagagaagaaggagaagaggagggaggggaagagaaaagaggaaagggggggggggaagaaagggaggaagaaggaagaggagagggaaaaaaagagaaagaaagagaggaaaagggggaaggagagggaggaagagagaggaggaaagagaggaagaaagagaaggaaagaaaaaaaagaaggaagggggagaggaaggagaaagaaagggggaggaggaaggagggggagaaaggaaaggggaggaagaaaaaggaggaagagagagggagaaggagggaggggaaagagaagaaaaaggaaagagaaagggggagaagagagaagagagggggagaaaaaagggagggggaaagaggagaggggaggaaaaaaagaagggagagggaagggggaaagaggaggaaaggagaaggaggagggggaggaaagggggggggggggggagagaaagaggaaaggaggagaaggagaagagaaggaaggagagaaaggaaaagggagaaaagaagggaaaggggaagaaaaggaagagggaaggaaaaaaaaggaagggagagaggaggggaagaaaggagggaaaggaaagaagagggggagaggggagggagaagaagaaaaggaggagggagaaggggagggagaaaggaagagaggagaggaaaggagaggggaaggaggaaaggaagagaaagaaaggagggaggaagggggggaggaagagggaggaaggagaaggaggggagaagaggggaaaaaggggggagagggaagaagagaagggaaagagaaaaaaaagaaagaaaaaagaaaggggaggaggaaaggaaggagggaaggggaaagaaaaggaagagaggaaaggaaaaggaggggaaggaaagaaaagggaaggaggggaagagaagaaaaagggaggggagagaaaggaagagaggaagaggaggggggagaaaagggggaaagagggaaaagagaaaaaagagaagaggagaaggaaaagggggagaagggaaggggaagaggaaagaaggaggggaagaagaaaagaaagggaaaaaaggaaggaagaagaagaggggaggaagggagaaaaagggagaggggagaggaagagaaagagaagagggggggaaggaagagaaggaaggaggagagaagggagggggagagagaaagaaggagggagaaaggggaggagaaaaaggagaagaaggggaaagaaaaaggagggagggaagggaaaagagaaggaaaaaaagagagaaaaggagggggaaagaaaagagggggaaggaagaaaggggaggagaagaaaagaaggggggaaagagggagagggagggggaggaaaaggagaaaggagggagaagagaaaaaaagggaaagaaagaagaggggaaagaaaagggaggggaagggggggggaggaggagaggaagaggagagaaaagagagaagagaagaggagggggagaaaaagggaaaaaaaagagaagaaaaggggagagaggaaaaaagaaggagggaaaggaaaggaaaaggagaagaaagagggaaaaggagaggaggaaggggaagaaaggaagagagaaaagggggagggaaaaaaggggaggaaagaggaaagaaaagaaaaaaagggaagagaagagagaaggagaagagagagaaggaagaaagagaggggagggaaaggggaagaaaagaaaaaagaggagaggaaggagaagaggagaggaggggaggaaggaggggggggaagaaggggggggggggaaggaaaaaaggaagaaaaggaaagaaggaaaaaaaagaggaggggaagagaaggggagagaaaggagaaagaaggaagggggggagggaaaggagggggaaaagagaaaagaaagaagggaggagaggaggaagagaagaagagagggaggaagagggagaagaaaagggaaagagggagaggggggaggaagaggaagggaaaaggagaagagaaaggagaggagaaggggaggggggagagggaaagagaaagagagaggaaaggaaggaaaaaaggggagaggggggagagaaggaggagggggagaggaggaagaaagggaggaggaaagaaggggagagaaaaagaaaggggagggggaaaaagaaaagaaaagggggagggggggagaaagggaaaaaagaggaaagaaagggagagaaagaggagagggagaagaggaaagaggggggaggaaagagggggaaggaaggaggagaaaagagagagagaaagaagaaaaaagggggaggggggggaaaggagaggaaggaggggaagaagaaagaagaagaaagggaggaaagagggaaagagagggggagaagaagaaagaaaggggaaaggagaaggagggagaggggggaagaggaaaaggaaggaagaggaaggaaaagaaagggaggagaaaaggaggagagaggggagaaaaaaaagaaggagggaaggaaggaagggggaagaagggaagaggaaaggaaaggggagagaggaggggagagaagagggaaagggagaggagagaaaaaagaagaggggaaagaaaaaggaagggggggggaggaaagggaggaaaagaagagggagagagagggagaggaaaggaaggaaaaagaagggagaaggggaggggagggagagaaggagggaaaagaagaaggagaaggggggggagaaaggagaggaaaggagaggaggaaggaaaaaggaggaggggaggaaggaggggaggaaaaaagaggagggagaaggagaaaaagggaagagagaaagaggggagggaaggagaagagaggagaaggaaggaagggaagagggaaagaagagggggaaagaaaggaagaaaggagggggaaaagagggaaaaaaagaggggagggaaaagaaagagaggggagagggagaaaaagagaaaaagagaaaggagaagaagaggggaaagggaggaaaaggaggaggaagggaaggagggaaggggaaggaaggaaaagggaaaagagagagggaaaagggggagaggggagaaaaagagagagaggggaagggagggaaaggggggaaggaaggagaaaaaaaagggggaaaaagaagaaagggaggggggaaaaaaggagaagaaaaggaggaaaggggagggaagggagagaaggagagggagagaaagggggggggaaaaaggaggaaagagggagagaaggggaaggggaagaagaaagaggggagggggagggaagaggagggaggagggggaaaaggggaaagaagggggaagagaagaggaaggagagggaaggggaagagagaaggaaaagggggaagagagaaaaggaaggaaagaggaaaggaaggaagaaggaggaggaaaggagagggagaagaaagaaaggaaagagggagagaaagggagaaggaggaggaagaagagaggaagggaagggggaaggagaggaaaaggaggaggagggggaaagggaaagaagaggaaggaaagaagaaagagagaagggagaggagaaggagagaaagaaaagagaaaagagggagagaaaagaggggagggaaagagaagaaggagaaagaggaggggaggagggaaaggaggaggaagaaggggaaaggggaagggaaggagggagagaagggagggaaaggaaagagaagaaaaaaaggagaaaggagaaagaggaagggggaaggaggagaggaaagagaagaaagaagaagagaagaaaaaaggggaaaaggggaaaagaggaaagaaagggaggggaaaaagaaagaaggaaagggaaggaggggggggagagagaaaaaaaaggaaggaaaggaagagaggggaaaaggaagaaagaagaaggggaaaggaggaaagaagagggagaggggaggagggggaaggaaggggaggagaaaagggggggaaaaggggaggaaggggaggaaggaaagggagaagggggaaagaaggaaggagagagaaaaaagagaagagaagagaagagggaggaaaggagagaaagaaagggaagaaagggaggaaaggaggggggggaggggagaagggaaaaagggaaagaaagagggaaaaaaggaggagaagagagagagaaggagggggagaggagaaggaagagggggaggagagagggggagggaggagggaagaggagaggaaggggaagggaggagggggaaaaggagagggggaggaagggggaaggaaggggaaagaaagaaaggagaaggggaaggaaaaaaaagaagagaaagggaagggaagaaagaggaaggagaagaaaggaaggagaggggaaggggaggggggagaaggggaggagaagaaaaagggaggggaagagaaggaagagaaaagggggggaagaaagagaaaagagaagaaaaagaggaaaggaaaaaaagggaaaagagaaaggaggggggggaagaaaaggaaagggaaaaagaggaagggaaagagaaaggaggagagagagagagaggggggaggggaagaagggaaaagagagagggggaaggaagggggaaaggagagggggggaaaaagggggaggagaagagagaagaaaaggaaggaagaaagaggaaggaaggggggaaagagaaaaaaagggaggaggaagagaagggggagagggagagaggaaagggaaagagaaaaggaaggggaagagggaggggagaaaggggggaaaagaaaggagaaggaggaaaggaaaaaggagaaagaaagaagggagggaaggagagagggaaggggagggaaggaaaaggaaaggggggaaaagaggaaaagaaaaaaagagaaggaaaaaaggaggagggggaaagagaaagaaagagagagagagaaaagggaagagggaaggggggaaggggagggagaaggaaaagaggaggaagaggagaggggaaggaggggaaagaaggagagaggaaaaggaaagaggagagagaaaaaaggaggaaaaaaggaaaagggagagaaaagaggggaggagggagggagaagaagagaggggggaaaagggaagaagaagagaaaaggagaaagaggaaaaggagagaagggagaagggaaagagggagaaagagagaaggaggaaaaggaaaaaaagggaaggaggggggagaaggaggagaaaaaagaaagaagaaaaggggagagagaaaggaaaaaggaagggaaggggggaagaaagggaaaaaaaagagaggagagagaagaagagggaaaaggggagaggaagggagaagaaagagaagggagggaggaagaagagggggaaagagaaagggggggagaaagggggagaaggagaagagggaaggaagagaggagaaaggggaaggaggggagagaggaggggagggggagggagagggaagagaaaaagaagggaggagaaaaaaagagaaggagaaaggaaggggagaagaaagaggagggagaagggaaaagagggaaagggggaaagggaaaagaaagagggggaaaaggggaaaagaggagagagaagaagagagagggagaaagaggagaaaaaaaggagagaaaggaaagaagaaggaggaagagggaaagggaggggaggagaagagagaagggaaaaggaaagaaggaaaaaaggaggagagggggaggggaagagggaaaaaaaggagagagaaagagagagggggggggaaaagaaggaaaagggggggggagggaaagaaaagagagggaggaggagagaggagaaagagaggggaaaaaggaagaggagaaggggagaggaggaaaggaaaaagagaggaaaggagagagagggggggaagagaggaagggagaaggagggaggaagagagaaaagggagaagggggaaagggggggagggaaaaaaaggggggagggggggaggagaaaaggaaagggggggagagagaaaggagggaaaaaggaaagggggaaaggaaggagggaaggggagaggaaggaagaggaggggagggggagagggaggaaaaggaaggaggggaggagggggaggaagagggggaagggagggagaaaaagaaaaaaaagaaaaaaaagaagggaggaggggaggggaaaaagggagggggggagggaaagggaaaaagggaaggggagaggaaaaggagggaaaaggagagggagggaagagaaagagaagagggggagggagaagggaaagagagaggagaggaagagaggggaagagaggagaaaaaaggaaggagagaaggaagaaggagggaagagaaaagaggggagagaaaggaagggaaaagaggggggggagggaggaaagagaagagagggagagagaggaagggggaaggaaagaggaaagggggggaaagggaggggggaggaaaagaagaaaaaagagaaaagggaaagaaagaagggaaggaaaagaagagaaaaaggggggaggaggagaaggaaggaaaaggaaggagagagaggagaggggagaagggaagagaagagaggagagaggaagagaagaaaggaggaaggagaggaaaggaggaagaggaggaagaagagggagagaaagaggggagaaaagaagaagaaaaagaggggagagggagaagagaagaaagagaaggaagggagagggagaagggggagagggggaaaggaaaaaaagagaaaaagggggaaggaagggaaaggagagaaagaaggagagagaaaaaaggaaagaagaaggaaaggaaaaggaaagagaaaagaaggggaaaaaagggggagaggagggagagggaagggagaaaggaaagggaaaaggggaaaaaagggaggggaggaaaagaggaggaaaaaaggaaaagagggagaagggggaaaaagggggaaggaaggaggaagggaaggagggaaaagggaagggagaaggaaagaagggggaggagaagagaggagaaaaaagaggaaggagagagaaaggaaaggggggaaggagaggaggggaaggggaggaaaagggaaaagaggaggaggaaagagaaaagggaaggaggaagagaaggagaggaaaggaggagaagaagaggggggggaggagaagagaaaaagaggggagagagggggaggagaaggagggaaaaggagagaagggagaaaaagagagagaagaggaggaagaaagaagaaagagaagagagaaggggaaggaggaaaagaggaaaaagagggagggagaaagggggagggggaaggagagggaggagaggaaaggagggaaagggagaagaggaagagagaagggaggagagaaagagaaagaaggggaaaaaaagggagaggaggagaggaggggagagaaggaggaagaggaaaggggaggaaaagggaaaaaaagaagaggagagagaaaaaaaaggaaagaagaaaaggaggaagaaaaggaagggaaaggaggaagaagaaaaggaagggaggaagaaaagaaaaaagaagaaaaggaaagggaagggaaaaaaaggaggaggagaaggagggggaagaggaaaggaaaaaagaagaagaggaaaggggaaaggagaaaaggggagggggaggaaaaaggggaaagggggagggaggaaaaaagaagaggggggagaaaggagggaggagggagagaggaaaagaaaggggagaaagagagggggagaggggaggaaagaaggggagaaggaggaagggaggagggaagaaagaagaaggggggggaaagaaagaaggggaggaaaagagaaggaagagaaggaaagggggaaggaaaagggaagggaaggggaaaagagaggagaagaggagaggagaggaagaaaggaggaagaggagagagagggaaggaggaggaagggggggaagaaaaaaagagagaggaaggaagagggaaaaaagaggagaaggaaaaaaagggaagaggaggagaggagggaaaagaaaaaaggggaaagaggaggaaggagaagggggagaaaagagaagaggagagggggagagggaaggaggagaagaaggagaggagggagggaaggaaaagaagagagaaagagggaagaaggggggggaggaggaggggagggagggagaaaaaagaagggaggaaagagagagggagaaggggaggagaggaggagaaagggaaggagagaagggaaaagggggggagggaaaggagaaggggaaaagaagggaaagaggggaaaaaagagaaaaagaaggaggaaaagggggaaagaaaaggaggggaagggaagaggaaaaagggaaagggggagaaggagggagaagaaggagagaaggaaaagggaaaggggagagaaagaggaaagagaaggaagggaggagagggagaagggagggaggaaagagaggaggggggagagaaaaggagaaagaggaaagaaaagaaagaggagaaaggaaggaggaggagagagaagggagggggagaaaaagagagaggggaagaaggagagaggaggaggaagagaggagagagagaagggagaaggaggaggagagaggaaggaggagggggaggggaggaggggggggggggggagaaagaggaagggaggggaaaaaaaagagaaggaaggggaggaggagaaggaggaaagagaagagaaagaagaaaaaaggggagaaggaaggaaagaaaaagaaggaagagaggagagggggagaggagggaaaggggaaaggagaaggggagggggagaaaaagaagaaaaagaaggaggggaaggggagggggaaaagaagaggggaaaaagaagggaaagagaagaaggagaggaaaggaaaggaaggagggaggaagggagggaagaaaggggaagaaggggaaggaggagaaaggaggggaagaggaagagagggggaaggagagaggggaaggagaagaagaagaaagaaaagaaaaaaaagaggaggaaaaaaaggagagaaggagaaagaagaggaggaggggaaaggaaaagggggagaaggaaagagggggggggggggggaggaggaagaaaaggggggggggagaaggggggagaggaggaggaagagggagaaaagagagaaaaaaaggaaaggggaaaaagagaggagaagaagggaaaggaggaaaagaggaggggaaggggaaaaaaggaggagaggagggaaaggaaaaaaaagaaggaaaggaggaggagagagaagaaagggagaggaaagggaaggggagagagaagaagggagaaaaggggagggaggaagagaagaaagagggagagaagggaggaggagaaaggaaaagagggggggagaagggaggaggggagggggaaggaggggaaagaaaaagggaaaagggaagggaaaaaaggagaaagggaaaagagaagggaagagaaaagggaaagggaaagaaggaaaaaaggggaggaaaaggaaaggggaggggaaggagggagaggaggggggagaaaagagagaaaggagggaaaagagggaaaaaggaaaagaagaaagagggagaaggaaggggagggaaagaagaaggggggaaaaaagggggaggaagaagaaaggaaaagaggagaagaggggaaaaaaaagggaaaagagagaaaagaaaggaggagaggggagaaaagaaaaagggaagggaaaggaaaagaagaagaaagagggagaaggggggaaagaggaggaaaaaaggaagggagggaagggggagagggagaagggggggagagaggaagaaaaagaaaaaaaagagaaagaagagggaaggagaagaaagagaaaaaaggaagaggggggagggaaagggggggaaaagaaaagagaggagaggaaggggggaaggaggaagaggaaagaagaagagaggggaagaaggaggggagagagaggaaaaagggaagagaaggagagaaaggaaaaaaagaagaggggaagagaagaagagagaaaaaagagagaagaggggaagagagggaagagaggaagaagggagaaaaagaagaagggaggagaagaagaaaagaagaaggaaagaaggaggaggggaaaggaggggggaagagggagagggggaggaaagaggaaggaaagagggagagggaaaggaagagagagggagggaggggggggggagagagaaaaagagaaggaagaaagggagaaagaggggaggaggaagggagagaggaggaggagaggaaaaggagggagaagaggagagaaaagggagaagagaggagggggagggggaaaagagggagaagaggaggagggaggggaaaaaggaaagaagaggaaaaagggggagagaaggaaggggggaaggaaagaagagaaaggggggaggagagaggagagggaggaagaggaaagagagagggagggaaggaaagggggggaaggggggggaaagagaggaaagaggggaagaagagagaaggaggaagagagggaagagggaaaaaagggaggggaaggaaaaagaaagaaggaaaaagggaggggaaaaggagagaaagggaaaagaaaggaggagaaaggaaaaaaaaagggagagaaaaggaagaaaaaggagggaagaaaaggagaaaggaaggaagggaagggagaagagaggaaggggaaaggaagagggaggggggaagggagaaaagaggggaagggagaggggagagaaagaaaagggggaaagaaaaaggaaggaaggagaggggaagaggaaaagagaagaaggagagagggggagaggaggggaagaaagaagaagaggggagggaaggggggggaaagagggagggaaagggagaaggagaaggaggagaagaaaggaggagagaggggagggagaaaaaaaaagaaggaggggaggaagaagaagaggagaagaggggagagggagaagagaagagggaagagaagaagaggagagggggagagaggaggagaaaagaaaagaaaaaagaaaggaaaggagaggaggaagaaaaggaaggaggggaagggaaaaggggggaaaagagaggagaaggaaaaaaaagaaggagaaaagaaggaaagagggagaaggagaaaggaggaggagagggagaaggggagaaaaagggaaggaagggaagggggaggggggaaaaagggaaaaaggaaaagagaggaggaaaagggggagaggggagaaaaaaggagaaaggggagaggaggaggaggggggaagaagaaaaaaaaaagaaggggaaaggagagagagggagggggaaaaaaaggagaaggaaaagagagaagaagaggagagggaggggaggagagagaaaggaaggaggagggaaaaaggagaaaagaagaggaaaagggaaaggaggggaagaaaggggggagggggaaggaagaggggagggaagggggaaggggggaaagagggaagaaggaagggagaagaaaagggaagagaaggagagaggaaaagggggagggagagagaagagggggaagaggaaaggagagaggaaggagaaggggaggaaaggaagagggaaaaagggaaagagggagagagaaggaggagggggagaaagaagagagaagggaaaaaggaggagaaaggaaaaagaggaagagagggaaaggggaggaggaggagaaaaagaggaggaagggagaggaggggagaagaaggaaagggaaggagagagaggggagaaaaaagaaggggggggagggaaaaaaggggaaaggagaggggaggggggagaggggaagaaaggggggaagagggaaagagaaaaggggaaagaagggagggaaaggagagaggagaaagaaaggagagaggagaagaagaaaggggaaaggaggggagaaaggagggaaaggaggaagaggagaaaaaaggagaaaagggggaagaaggagagaaggaaagggaaagagaaaagaaggaaagggaaggagagaggaaaaagggaaaaaaaagaagggaaaagaagagagggggaaaaggagagggaagaaggggaaaggggaaaagaagagggagagaagagggaaggaaaagaagagagaaaagaaagaagaagaaaagagggaaagagagagggggggaaaaaggaagggagaaagaaagaaggaagaggggagaaaagagaagaagggaagagagagggaaaggaaaaaagaaggaaagaagagggaagaaaggaagggggagagggaaagggagagagagggaaaagaagaaggaaaaaaggaagaaaaaagaggaagaagaaggggaagaggagaaaggaggaagggagaagagaggaggagagggaagggaagaggagagaggggagaagggagaaggaggagagggagaggaggaaaagaggggaagggaagggaagggaaaaaaggaagagaaggaggagaaaaaagaaaagggggaggaaggaagaaaggggggggggaggaaaaaaagagggggggaaagagaaaggggaaaaggggagggggggaaagagggaggggaaaagaaggaaaggaaaggagggggaagaaagaaagaagggaaaaaaaagaggaaaggaaaaaaggggaaaggaaaagaggaggggggaaagaaaaggaaagggagaaaaaggaagggaaaaagaaggaggaaaagggagagagaaagggaaggggaaggggggggaaaagagggagggaaggaagagggaaaggggaagggaaaaaaaagggggaaggaaagagaggagaaaagggaggaaaaaagagaaaggaaggggggaaaaagagaaaaagggaggaagggaagaaggggaagagggagaggggagagggaaaaagagaggaaaaaggaagagagggagaagaaaaggaaggagagaaaggaggaggggggaaagagaaaggaggagaaaggaggagagggaaggagggaggagagaaggggaaaggggaaagaaaggagaggaaaaagaaaaaggaaaaaagagaaaaaaagaaagaagaaaggggaagggaaaaaaggagggaaagagaaaagggaagagagagggggggggagggggggaaaggggaaggagggggaaaaggagagggggaggaggggagaaagagagagagggaaaggaaagaggggagagaggaaaggagagaagaaggggaggaaaagaaagagggggggggagagaggaagaagagaaaagggaagaagagggaaaaaaaggggaagaggggaaaggggaagaggagagaagagaaaaagggaggaggaagagagagggaagaaggagagggaaaaaaaagggaggggagggaagaagaaggagaaaaaaaagggaagaaaagaggggaaagaaaggaaaaaaggaggggagggggggggaaagggaaaagaagaagaaaagagggaaaagaggggaaagagggagaagaagggagaagaaagaggagaagagaaagaagaagagaggaaaagaagaagaagggggagaagggggaggagaagaaggagagaagaagagaggagaaaagagaaggaggagaaagaaaaagggagggggaaagagaggggagaaaaggagaagggaggagaaaagaagagaaagagaaagggaggggaggggaggggagaaggaggaaggaaaggagaaaagagaggggagggaggggaaagaaggaaaaaagggaaagagaggggaggggagaagggggggggaagaagaaagggaaaagagggaagaaagagaagaaggaaaaaggggagggaaagggaggggaggggaaaagaagaggggaaaggagaaaagggagggggagagagaggaggagggggggagagaaagagaggaaaggaaaggaaagagggggagggaagagaagaaaaagggaggaggagaggaggaagggagagggggggggagagagggggaggaaggggggaagaggaggagaggaagggaaggggaagaaagggagaaaagagggaaggaaagagggggggagagaagaagaaggggggaaggaggaggaagagagagaggggagaaaggggaaagggggggagagagaaaaaggggagaagaggagaggaaaaaaggaaaggaagaaagagggggaggaagaagaagggaaagaaggaaaggaagagaggaaagaaagaaaaagggagagaaggggagggggagagggaagaaggagaaggaggagagggggaagaggaaggggggggaaggagggagagagaaaaaaaaaagagagaaaggaagggaggaggggagggaagaaagggaaggagggggggaaagggagaaaaaagaagggaggggaaaaggggggagaaaaaaaggggggagagaggaagggaagaagggaggggaaaagggggagaaagaggagagggagaaaggggaagagaagagaaaaagggaaggagagaagaaagaaagggggagggaggaaagggggggaaaaagaaaggagaaggaggggggggagggaggaagggggagagaggaagagaagggaggggggaagaaaagaggagagggggggaagagaagggggggggaaaagaagaggggaggaagagggaagagaaagaaagaaaaagaagaaagaggagaagggggaaggagaaagaagaagggaaaaaaaggagagggagagggggggaggaaaaaagggaggggaagaaaggggagaagaaggaaggaaaagggagggaaagaaagaaagaggaggagagggagggagagaaggaggggagaaaagaggaagagaaagagggggaagggagaaaaaaagaaaaaaaaggaaagaggggggagaaggggaagagggggagagggagaaaagagaaaaggggaaaagggagggaaaggggagaaaggaggaaagaaaagagaagaaagaagaagaaaagaaaaaggaaaggggaaagaaggaaaagagagaaagaggagagagggagggagggggggaaggagagggaaaagggaaaaagggggggaggggaaaaaggagaggaaaaagggaaaaggggaagaggaggggggaggggagaaagagggagagaaagaaggaggaagagggggagggagaaggaggggagaaggaggagaggagaggaggaaaaaggagaaggagggaggaaggaaaagagggaaggaggggaggggaaggggagggaaggaaaaaagaaaaggagaaaagagaagaaggaagagggaagaggaagaaaggggaagaagaaagaaaaaggggggaaaggagaaggaaaagagaggggggagaaggggaggagaaaagagaaaagagggagaagggaaagagagagagggaagagaaggaaaaaaaaagaaggaggagagagaagggaagggagaaaaaaagggaaaaaggggagaaagaaaggggggggaagaaggaaagggaggaaaggaagagagggagaaggaaaagaagaggggagaagggggaagagaaagggaagggaaaggagaaagaaaaagaagaagggagaaagggaggaaaggaaggaggggaaaaaggaagagaaaggaaaaagaggaaaagggaaagaagagaagggggagaggaaaaagaggaaaaaaagggaggggaagaggggagaaggagaagaagagaaggaggaaagaaaaagaaggggagagagaagagggggaaaaaaaggaggagaggaaaggagaggaaaggaaaaggaaaaaagaagaggaggggaaggaaaaagggaaaaaggaaggagggggaaagaggaaagaggaaggagaaagaagaaaaaaaaagagagaaaaaggggaggaaaagaaggggggagaagaggggagagaaaaagaagggaagaagagaagagagaaggaaaggagggggggaagaggaaagagagaaggggaaggggaggaggagaagaaaggaagggaaaagggggagagaaggaggaaagaagggaagaaggaaggagggaaggggagaagagaggaaaggaggagaggaaaagaaaaaaggaaggagaagaaaaagaaggaaggagggagaaggggggaaaggggggaagagaggagggagaagaggggaaaaagagaagaggaagaagaagggagggggaggggaagagggagaagaaaaaaggggaggaaggagaaggggggggagaaggagagggaaagagggaaggaggggggggagagaggagaggaaagagggaagggagggaaggaaaagaggggagaaaaagggaagaagaaagaggaggaggaagagagagaaggaggggaaagaagggaggaaggagagggggaagaggagggggggggaagaaaaggaaaagaaaagaaggaaagggaggggaagggagaggagaaggggaaaggaagggaaggaagggaaagaaggggaaaagaagaaggaggaagaagggaggaaaagaagggaagggaaaaaaaaaaagggaagaggggagaagggggaagaaggggaagagaaagaaaaaggaaaggggagagagagaggagagggaaggaaggaaggagagaaagaaaggagagaggggagagaaaagggggaggaaaaggggggaaagagagaagaaaaaaaagagaagaaaggaggaaggggggaggagaaaggaaggagggaagaagagagaagggaagaaggagagaagaggggggagaggggaaagaaaggagagaggaggaggaggggggaggagggaggagaaggaaagggagagaaggggggggagaaggaagagagagagagaggagaaaagaaaggaggaaggggaggagaagaaggaggagagaagagaaaaggaagaaaaaaggagggaagagaggagagaggaagaaggaagaggggagaggggaagggaagggaaggaggaaagaagaagaggaggaggagaaaaagagggggaaaaaagagaggaaggggggaagggaaagagggaggaaaaaagaagggaaagagaggagagggagaagaggggaggggagggggaggaaagaagagaaaaaaggagaagaagaggagggaggaaaaaggaaagggagaggaagagaggaagagagaggggggaaaggaaaaggaaggagagaggaaagaaggaaaagaggaggaaaaaaaagagagagaaagagagaagaagagggagagagagaagaaaggagagggggagggaggggagggggggaaggggaggaagaaaagagggggggaggaggaggggaaaagagaaaggagaaagaaaagagagagaaaaaaaagagggggggggaagaaggggaaagaagagagaagagggaaaaaaggggaaaaaggaaagaagaggggagggaggggaaaagaaaaaaaagaagggaagggggaggagagagaagaaagagggaggaaaaggaagggaagagagaagaagggagaaaggaagagggagaaagagaggaaagaggaaaggggaaggggaggaaaaagggaaagaggggaggagaaaagaggaggggggaagaaaagggagggaagaaaaggggaaaaaaaaggggggaaaaggagaaagggaaagaggaggggaagagaaaggagggaggaaaaagggggaaaaaggggagaaaaaggagaagggagagagagaaaaggggggaggggaaagagaagaggaaaaggagggaaaagaaggaaaaaaaaagagaagagagaggaagaaagaggagaggagaaggaaaaaggagagaaaaaaaagggagggagaagagaggaagaaaagaggaggggggagaaagaggggaagggagggaagggaaagaagaggaggggagggaagaaaaaggggaggagggaagaaagaagaagaaaaagggagaggagggaaaagaggagggaaaggggggggagaggggaggggaaagggagagaggggggagggggggagaaggaggaagaagagagaagaaagggggaaagggggaaaaaggagaaaggggaggaggaggggagagggggggggagagggaaggggagaagggaaaagggggaggggggaagaagaaagaagaaaaaagaaggggaaggaagggagagaggggggagagggaaaagaggaaggggaagggaaagaaaaagagaagaggagaagaagagagaaaaaaaagagaagaggggaaaagggggaagaaagaaagaaggaaaggaaagagaaaggaaaagggaaaagaaagggaaaaagaaaaaaggagggagggagaggagggggggagagggaaagagggaggaaaggaagaggaaagggagaggggaagaaaaagagaaaggaaagaaagggggggagagaaagagaaaaggaaagaagaaaaggagaaagaagggaaaaggaaagaagagaggaagagaggagagaaaggagggagaagaagggagaaaagagagaggagagggggggaaggaggaaaggaggggagagagaaaaggggaggggaaaaaaaaaagaaagggaagaaggaggagagggggaaggggggagagaaaaaagagaaagaaaggaggagagagaagagggagggaaaggaaagagagggggagggaaagagagggggaggagggggaagaaaaagaggagagagaggagagagagagaggggggaagaaggaggagggggaaaagagggaaggggaggaaaaagaaggaaagagaaagggaggggaaaaagagaggaaggggaggaaaagggggggagaaagaaaaggaaaagaggggagggagaaaagaaagaagaaagaagaggggaagggaaggaagaggagggaggagggagggaggagaagaggggaggggggggggaagagaagaaagaagggagaggggagaggagaggaggaagagaaagagagggagggggagaaaagagagaggaagaggaaaggagggagagaaaagaggggagggagaggaaaagagggaagaagaggagggaaaaggagggaggaaaagagagagaaggggggaaagagaagaaagagaagagagggagaggggaggagaagaaagaaagaaagagagagaaagggaaaaagaagggggggagaggagagaggaagaagagaaggggaaagagaaggaaagaagaaggggaaagagagggaagaaagaaaagaaaaaagaaagaaaaggaaaagaaaaagaaaaagaaagaggggaaggaaaaaagaaggaaaggagaggaaaagggaagaaaggaaggagaaaagaagaaaagaggggggaggagaaagaaggaagagagggagaaggggagaaaaaaggaaggagaaggaggggaaggaaggagaagggaaggaaagaggagaggggaagaaagggaagagggaaagaagaaaagagaaagagggagaaaaagaggggaaggaaagaagaaaaaaagaagaaagaggaaggagggagaggggagggaaaaaagaggaggaagagaagaaagaagaagagaaggggggagggaagagagagaagaggaggagaaagggagaaggaaaaaggaaaaggaagagggaagagaggggaagaggagggggaggaaaaagaagagggggagggagaggaaaaggaggggagaagagaaggaggaagagaggagagagagaaaaagaggggggggggaaggggaggaggaaaaagggagaggaagaaggaaaaaggagagaggagagaaaaggggagaaaaagaaaagagaaagagaaaaggagagagagggaagaggggggggaaaagagaagagagaagggagaaaggaggaaaaaggaggaaaaagaagaaagggaaaagggggaagggaaagaagaagagaaggaagggagagaaggggaagaaagggaaggggagggaaagggagagaaaaaaagagaaaagggaagagggaagagaaaggaaaagaggagggagagggaggaagggaaaaaggggaagaaggagaaaagagggaagaggaagaaaaaaaggaggaggggaaggggaagaggggaaaaggaaggagggagaaaaaaggaggggggggaagaaggaaaggaggggaggaaaagggagagaagggaagaaagggaggggagggagagaaggaaggggagggagaaaggaagggaagaaaagaagaaaagaagagaggaaaaaagggaggggaaaagaggagaaggggaaaagggaaggaaagaaagaggaagaggagaagaaaagggaagaaagagggaagaaaaaagaaagagaaaaggagaaagaagaaaagaaggaaagagagagggggagaaaaaggagggaaggaggggagaagggagaggggagaaaagagaagaaggggaagaaaagggaaaagagagggaggggaaggaggagggaagaaagggaggaggagagaaaaagggagggggaggaaagaggaagagggggaaaagaaggagaaagaggaagaaaaaggggaaggggaagaaggaggaaggaagagggaagaaaaagaaggaaaggagagaaaaggagggaaaagggaagaaggaagagagagagagaaggaaaagagagaagaagaagggaagagggaaaagaaagagaaggaggaggaaaaaaaaaagggggaggaaggaaggagggggggaagaaggaaaaagggaggggggagaagagaaaggaaaagaaaggaaggagggaaagggagaggggggaagaggggaaggagggaaaggggagggagagaaggagggaaaaaaaggaggaaaggaaaaaagggaagagagaaagaagagggaggaaaaaaggggagagggagagaaagagagggagaaggaagaagaaaagaggaaaggaaaaaagaaggggggggggggggaaaagggggaggaaagaaagagggaaaaggaaagggaaagaaggaggaaaaggaaagagagggaaggaggggggagaaaaaggaaggaaaggggagaaaaagaggaagaaggagggagggaaggaagggaaaagaaaaaggggagaggagagaggagagaaagaaagaagaaaggaagagaaagagaaaggagagaaaggaggaggggggaaaaggaaaaggggagagggagggaagagggagaaagggagagaaaaagggaaaagggaaagaaaagaaaggaagaagagaaaggaaaaaaggaaaaaaaagagaggaggaaaaggaaagaaaaaagggaggaaagaagaaaaggggggagaaagagggggggaggggagagaaggggagggggaggggaaagaggggggagagagagagaggaggagaggaggaggagggaagaaagggagaaggggaaagggagaagagggggagaaaaagagagagggggggggggagagaaaagagagagaggggaagaggaaggaaaaaaagaggaggaaagaagaagaaaggaaggaaggggagaaagaaagaggagaaggagagagggaagagggagggggaaaagaaagagaggggaaggaagaggaagggggaaaaaagggggagaagagaaggaaaaaaaaaaaaaaaagggggggaaaaagaggaagggggaaggggagaagaaaagagggagaggagaggaaagagaggaaagaggagggaggaaagaggagaagaaagaggggagaagaggagaaggagaagaaaagggagaagggggaggaaagaaaggagaggaaggaagagaagaagagagaaggggaagaaaaaaaaaagaggaaagaaaggggaggggggaaaggagagggaaggaggaaggaagggagagaaggaaggggggaaagggaggagaaaaaggggaaggagaggaaaaaagagagaggagagaggggaaaaaaggaaagaggggaaagagaggggaaggggggaagagggaggaagaagaaaggggaaagagggagggaagagaagggggaaagaaggaggggaaggggagaggagggaggaaaaagagggggaaaaggaagggagagggggagaaggaggagaagaggggaagagagagagaaaaaaggaaaggaaagggggggaaaggagagaaaaagagaagaaaaagggaggagaaagggaaagaaggggagagagagggggagaaagagaagaagaaagggagagggggagaagggaaagagagagagagaaaggagagggaagaagggggggagagaaagaaaggaagagaaggagaaggaggagggagagggggagaagggaaaagggggagaaagagaagagggggagaagaggaagggaaagaaagaaaagaagaagaaggggggggaagaggaggagaaagaagaagggaaaaagaggagaaaaagaaaaagggagagagggggaggagggggagggagagggaaaaggaggagggggaaaaggaaggggggaaggaagaaagaagagagaagaaagagaaagaggaagaaagggagaaggggagggaaggagagaaaaaaagggggaaaggggggggaaaagaagggaggagagaggagaggagaaaaaaaagggggagaggaggaggaaggaagggagaaaaagaagaggagaaggaggagagagagaaaaaagaagggaaggagagaagagagggaaaaaaaaaagagagggagagggaggaaagggaggggaaaggaaagaagaagaaggggagaaagggaggaggggggagagggaaaaagaaggaagaggggagaaaagaagggggggagggagagagaagagaagggaaagaggagaggggaagaagagggaagagaagggaagaagaaggggaaggaggagaggggggaaggagagaggaggagaggggaaagaaagaggaagagggaagaaaggaaagggggagggaaagaaaggggagaaggagggagggaaggggagggaaagaaagaaaggggaaaggagggagagagagggggggaaaagaggggggggggagaagaaggaagaaaggaaaaagaaaaaagaaagagaaaagagagaggggaagaggaagaagggaggggggaggagaggggggggaagaagagaggaggagagggaaaagaagaggaaagaagggagaaaaaaaaaggagagaagagaaaaggagggggaggaaggaaaaagagggaaaagggagggagggagagggggggaggaggggagggaggagagaaagagggggggaaaggaaaaaggagaaaagagaggaggaaagggaggaggaggggggaggaaaaaaagagggagagaaagaaagaagaggagggaggagggggggaggggggaaaggaagggagggaaggaggaaaaaggagaagaagggaggaagggaaagagggaaagggggaagagagaggggaagggaggaaaaaaggaaaggagaaaggggaggaaggaaaaggagggaagaaggagggggaagaaggaagaaaagggggagaagggaggaggagaaggagaaagggagaaaaagaaaagaaaagagaaaagaggaaagagggaaagagaggaaaggagagaagggaaaggaaaagagggaggaggaaagaaggaaggagaagggaaagagaaaaaggaaggaaagaagggggaggaaaaagggaaaagaagaaaagagggaggaggagaaggaagaaaaggggggaggaggggaaagagaaaggagagggaaaaagggaagaaaaaggagaaggggaaaaaaggggaagggaaagggggaagaaaaagagagaaaagagagagaggaagagggaaaggagaggagagggaaggggaggagagaaaaagaagggggaaggggaggggggagagagaaaaagaaaaagagggaaaaaaaggaagaggggagagaaaagggggagaaagagggggggagggaaggagaagaaagaagagggagagaagaagaggagaggaagaaggaagggaaaaaggaaggaggggggaaggggaaagaaaaaggaaaaagaagaagaaaaaagagaggaagagaggaagaaaaaaaggggaaggaaaaggggaaaaaaaaaaaaaggaaggagagaagaggagaggaaaagaaagaaggaaaaggaaagagaggagggaaggaggaaaaggaaaagaggagaaggaagggaggggagagaagggaaagaaaagggaaggaggaaagagggaagagaaggggggaagaagggaggagggagaaagaaaggaggaaggagaaagaaaaggaagaggaagggagaaagagagaaaggggggaagaaaagagggagaagaggggaaaaggaaaaaaggagggaggaggaggagaaagggggaaagagagaagaggggagggggggaaagaaagggagggggagaagaggagagaaagagagagggagggggagaagaggggagagggaagaaggaaagagggggaaaaaaaaaggggagagaaagggaggaggaaagagaggaagaaaaaagaaagaggaagggagggaagggaggaggggaggggaagagaggagggagagggaaagaaagaaaaagagaagggagaaggggagagaaaaagggaggagaaggaggaggaaagggaagagaagggagggaagagaaaggaagaaagggggagaagggaggagaaggagggagggaaaaaaagaaaaaggaggagggaggggaagggagggaggggaggagaaagaaaaaggaaggggaagaaggagaggagagggaagaagagaaagagagaagggaaggagaggagggagagaaaagggagagaaagagggaggaaggaaagagaaaggaaaagaaaggaagagggaaaaggaggaggggaaagagaaaaagagaggggaaagaaggaaagaggaagaaaagaagggggggagggaaaagaaaggaaagaagagggggaggggggagaggagagggaaaggaaagggaaaaaagaaagaagagagggaaaagagagagagaggggaagagaagggagggaaggaaagagaaggagaaggaggggagggaagagaaagaaaggagaaggagaaagaggggagagggagggaaaaggggaaagaagggaagggaggggaggaaggaaggaaaaagagggagaggagaaaagaggagggaaagaagaaagagaggaaggaagggggagggagagaaaaaaagagaagagagagagaagaaggagaagagggggagggaggaaaagagaagaagaaaaaagagaagaagagaaggagggaaaaagaggagaaggggggggaaaaggggaagggagaagagggaaaggagaaggagggagagaaggaaggagggaaaagggagagagaaggaaagaaagaaaaagggggggagagggagagggggaagaaaagagagggagggggggggaaaggaagaaaaggagagaagggaggaagggaagagaaggaggggaaaagggagaagagaaaaaaaagagaaagggaaaaaagaggagggggggaggaggggaaggaggagaggaaagggaagaaagggaaagaagaaaggaagaggggagggaggagaaaaggaaaagaagagagggagggagaaggggaaaaaaaaaaaggaaggaaaaagaaaaaaagagaggagagggaaagaagaaaaagagagagaaagagaagagaggagaggggaaagagaggaagagggggaagaggggagggggaaaaagagagggggaagaggagggagggaaagaaaggagaaagaaaagagggggaaaggggaaggggaaagagggggggaagagaaaggagggaggaaaaaggaaggagaaaaggaaagaaaggaggaggaaaagagggaaaaagaggaaggagaaagaggggaagaaagaaaagaaaagaaaggaggaaaaaaggaaggagaagagaagaaaggggaaagaagaaggaaaaagaagagaaagaaaagggggggagaagagaggaagaaaagaggaggggggagagggggaaaaggggggggaaggagaagaagaggagggaggggaggaaaaagaagggaagggaagggaaagagaaggaaagaaagggaagagaaaagagaagaggagggaaggggagaggggaaggggaaaggggagaagggaggggagaagagaaggaggaggaagagagaagaaggggggggagggggaaagagaagaagggggaggagaagagaaaagggagggggaggggggagggggaagaggaggagggggagaggggaagaagaaaaggaaaaaaaaaagggggaggaaagaaaagaggagggagggaaggagggggaaggggaaaggagaggaaaaagaaaaaggagggaaagagaaaggaaaaaggggaaaggggaaaaagaaaaagaaggaaaaagggaaagggaagagagggaagaagagaaaaggaagaggagaagagaaaagaggagagggagaagggggggggggaaggaaggaaaaagaaggagaagaagaaagggagaggagaaggaagagaggagggaaagaaaggagggaaaggaaaaagaaaaggaaagaggagaaaggggagaaaggaaaaaagagagaagagaagaaaaaagaggagaaggaaggaaaaaaaagggggaaaagagagaggggaaggggaaaggaaaggaaggaggggagggggaaaagggaaaaggaaagaaaagagagagggaagaaggaaagagggggagaggagagagagaaaaaagaagaagaaagaaggggggagaagaaggggagaaaaggaaggggagaggaggggaagagagggagaagaaagggaaggaaaagggaggaagaaggggagagggagggaggagagaaaggagggggaaagaaagagaaaaggggaggaaaaaggaggaaagggaagaggaagggagaaagagaggaagggggggaaagagggagaagaaagaggaggaaaagaagggaggaagaagagagagaagaaggaaggggggaagaaagggaggaagagggaagagggaaggaagaagagaagggaggagggggaagaaaagagaaaagagagagaagggaaagggaggggggaggagaaagggggggagggggagaaaaaaaagaagaaaaggaaaggaaggagagagagggggagagagaagggaaaaaaggggaaaggaagagggaaagaaaaggaagagaagaaaaaagagggggagaaagaaggaaagaaaaaggaaggagaggggaagagaagaaggaaaggaaaagagaaaaagagagaaggaaaggagggaggagagggaggaggaagaggaggggaggaaaaagggaagaaaaaagggaaggagagagaagagagaagagaaaaaagaaagaaaggggagagaaagggagagagggagggaagaaagagggaagaaggaaaggagagaaaaagggaagaaaggaagaagaaagaaagaagagaaggggggggagggggagggaagagaggaagagggggaggggaaaggaagaagaaaggaggaaaggaaagagaagggaagggaaaaggagaggagaagagagagaaaaggaaaagaagaaaagagaaagagagggaaagagaggggaaaaaaggaagaagagaggaggaaaaaaggaggaggaaggagagagagaaaggagggaaggaaggggaagaagaaaaaggaaaggaaggagggaaaaagaaggagaggaggagaaagggagaaaagaaaggagaaaggaaggaaaaagagaaggaaagaggagaggggggaaaaaaaagagaagaagggagagaaaagggagaagagaggagaaggaggaggagagggaagagaaaaaaaaaggggagggggaaggggaggaggaaaaagggggaggaagggagaaagaagagaaaggagaagaagagggaaagagaaagaagagaaagggaaaagaagagggaagggaaagaggggggagaagaaaaaagaaaagagaggaagaaggaaaagagagggaagagaaaaaaggggaaagggggaagggaaggaagaggagaaggaagggagaaaaagaaaaggaagagaaggagaggaaaggggagaaaaaaaagggagaaaagaaagagagaagaggaagaggaagaggagaaggagagaggaaagaagaaaggggaaaaaggaaaaagaaaggaagagggagaagaaagggaggaagggaagaggaaggggggaaaaggaaggagggagaaaaaaagaggagggagaaaaaggaaaggaggggggggaaaaggagagaaggaaagaaagagaggggaggggggagaggaaggagagggggaaggaggaggagaaaaagagaaaaagaagagaggaaagggggaaggagaggaaagggagaggagagaagggagggaaggggaaaagaggagaaggaaagagagggagaaagagagaagaaggaaggaagagaaaaggggaaaaaaagagaaaaagaaggagaagaggggagagaaagaaggaaaagggaggaaaggagagagaggggaaagaggaagaaaggggagaaaaaaggaaagagagggagggaaaggagggaggaagaaggggagaaagaggaaaaaagggaaggggaggagggagggagaagggggagaaaaggagaagagagagaggaaaggggaagggaaaggaagaggaaaaaggagggaggaaaagaaagaaaagaggagaagaggaggaaaaagaaaggaaaaaagagagaaaaagaaaggaaagaaaaaggaagaaagaaagagggaagaaaaagaaaaggaagaggaagggagaagaggggaagaaagggagagggggggaagaaggagaaagggagaggaaagaagaaaaaagaaaaggaaggaaggaggggggggaagagggaggagggggaggagaggggaaagagaggggggagaggggggagaagaaagagaagaaaggggagagaaaagagagaaagaagaaggaggaggaaaggggggagggagagaaaaaggaaagggagagggaagaagagagagagggagaaaagagaagaggagggagggagaagggggaagagaaaagaaaaaagaaggaaaaggaaagagggaggaagaagagggaaggggaaggggaggaaggagagagaaagaagagaagaagagaggagggagaaagaaagaaggaaggaagagagaaaaagaaggagggaaaagggaggagggaaagaaaaggggaaggaaaagaaggaaaaaagagggaaaaagggggggagggaaaggaggaagggggagggagggaagaagggaagagggaaagaaaaagagaagaaggaaaagggagaaaaggggaggagagaagagaagaggaggaaagggggaggaggaaaaggaaagaggaagggaaagaaagaagagggaagggaggaaggagggaaggagaagaaagagggagaggggaagagggagaagggggaaggaagagagaggaggaagggagaaggggggaagagaggaaaaagggggaaggaaggggagaaggggaaaaagagggagggagaggaggaaagaaaagggagagaggaaaaggggaaagggaaaaggaggaggaaagaagaagaaggggaggaagggaaagaggaaaggggagaaggagaagagaggaaggaaggggaagaggagaaagaaaggaaggaagagaaagagaggaaaaagggggagggggaaaagagaaaaagaagggagaaggaggggaaaagaggagggagggaggggggagggaaaggaggggaggagaggggggagaggaaaagggaagggggaggagagaaaagaaagaaggaagagaaaaaggaggagagaaaaagagagaaaggagaagaaagagaggagaggaaggaaaaaaggaagaaaggagagaaaggagaaaagaagagaaaaggaaagggagaggagaaggggaggagagagaagggggagagaagagaagggagggaaaaaagggaggagaagaaagggaaagagagggaaagggaaaaaggaaagggggggaaaaaagaaaggggaaaaagaaggggggagaggagaagagagagaaaggggaaagaggagggaaagagaggaaagaaaggaggaagaaggagaagggggaagaaaggaagaggaaaaagggggggaaaagggaggaagagggggagaaggagaagaagagaggaggaaggaggggaaaaaggagagggaagggggggaaaggggggagaaagagaagaaaaagggaagagaagggggaaaaagaagaagaagaaagagagaaagaaaaggggaaagggagagggggaaaagggagagaggaagggagagagaagagaagagagagaggggaaggaaagaaggaaagaggaggagaagaagggagaggagaaagaggaaggaggaggagaaggaagagaagggaaggaggagagaaagaagaaggaagagaagaaaaagagggggggaggaaagggggaaaggaaaaagggaaaaaagaagggaaaaggaaagggagagaaagaagaaagaaagagagggaaggggaaggaggagagggggaaaaagaaggggggaaagaagaaagagaggaggaggaagaggaagagggagaaaaagggaggagaaaagaaggggagagaaaaagggggagggagagggggaaaggaaagaagaaagaggagaggagaaaaaaaagagaaagaagagggagaggggagggagaaagaggagagggagagaaggaaggagaaaagaaagggaggaaggaggggggaggggaaaaaaaaaaagggaagaaaagggagggaagagaggggaaggaaggaaaggggagaaaaaaaaaaagagaaggagggaggggaaagaaggaggaggaggaaggaagggaagagggggagggagggaaagaagaagggaggggagggagggggagaagagagaggggaagggaagaagaaggggaaggaagggggggagaaagggaagaggagggaaggggaaggaagagggaagagggaaaaaaggaaagggggggagaaaagagagagggaagggaggaaggaagggggagaagggaagaaggggaaaaaggagggaaaaagaagggagaaaaaggggggggaggaggaggaaaaaagagagggaaaagaagagggagaggaaggagagagagggaagaagaaaggagaaaggggggggggggggagggggaagaagggaggagagggaagaaaaggagaaagaggaaggggggaagagaggagagaggggaggggaagagggagaggaggaaaaaggaggaaaaagggaaggaggaaaagggggagagggagggaaggagggaagagaggggaaagaaaaggaaaagggaagaaggggaggaggagagaaagaaggaagaggggggaaaaaaaagggaggagaaagagagaagaggggagaggagggagggagggaggaaagaaaagaagggaggggggaagggagagaagagaggggggagggaaagaaagaaaagaggaagagagaagaagaaggagaaagaaaagaagaggaaaggagaagggagaggaagaagggaagaaggaggaggaaggaagaggagaagaggaaaaagaagaggggaggaggagaaaagggaaaaaaaaaaaaggaagaaagaagaagagagaagggaaggggagagaggagagaagggaaagggaggggggggagaggaaagaagaagggagaagggaaggagaaggaggaaggaaaaaggaaaaaggaaaaagggaagagaaaaaaggagggaagaaaagaaaaaaggagaaggagaaggaagggaaaaagagaggagggaggaaaagggaaggaaaaagaagaggagaaaaaaggagagggaaaagggggaggaaaaagagggagaagggggagagggagaaggaaaggggaggagagggaaggaggggagggaagaaggaagggaaaggggagaagggggagggaaaaggaagaaggaggggaagaaggaggaggggagggaaaagggaaggagggagggaggaagagaaggaaaaaaaagaagggaaagggagaagaagaggagggaaaaggaaggggagaaggaaggagaggagagggaaaaggaaaaaagaaagaggaggagaaaagaaaaaggaggggagaaagaagaaaaggggaaggggagggggaagagggaaagaagaagggaaaggaaaggagaggaagaggaagaaggaaaaaaaaaaggaggggggagggagaaaaaggaagagaggagaaggaggggaggggagggaggggaagggaaaaaggagggggaaagagagaggaaaagggggaaaagaggggaaggggagaaagagagggagaaggaaaaagagaaagaaaggaaaaagaaagaaagagaaagggggggggaagagaaggaaggaggaggaggggaaaaaaaggagggagggagaggagaaaaagggaagaaggggggaggggagagggggagaggaaggaagagggaaaagaggagagaggggaagagggaaggggaaaggaaggaggaggggaagagaagaaaggaagaaaaaaaaagagggggggaaaaaaggagaaaagagaggaggaaaaaagaaagaagaagggaggggggaagaagggggagagaaagagaggaggaagaggagaagaaagaaaaggagaggggagaagggaaaaaaaaaaaggagggaaagaaggaggaaggagaagagaaagggggggagagggagggagagaaggggaaaaaggaagagaaagaaggagagagaagaagggagagaaggagggagaggaagggaggggggggaggaaggaaaaagagaaggaagagggagggaaaaagaagaaggaagaaaaagagggaagggaaaagaaggagggggaagaaggagagagaaagaggaagaaagaaaagggagaggagggggaagggagagggaaaaagaggagagaggagagaaaaagaggggggaaagaaaaagggagaagagaaaagaagggggggaggaaagagaaaggaaaaagggagaagaagggaagaggaagaagaaaaagaagggaaaaaaaaaaaaaaagagagggagaagggaagaagaggaagaggagaggaaggaagagagggaaggggaaagaggggaggaaagggaaaaggaggggaaggagaaaggaaggggggggaaggaaagagagaagaaaaggagggaagaaagggaagggaggagaaaaagagaaaagaaagaggaggaggggaagaagaaagaggaaaagaaagagggaaggagagaagagaagggaagagaaaaggaagaagggaaggagagggagggaagaaagaaggaaaaaaagaaggagaaagaaggaagaggaagaaaagaggagaaaagggggaaaaaagagaaaggaggagaggaaagggagaggggggggagggaggggggagggaaaagaagaagggaaggaagaaaggaaaagggaggggaaggagagaagggaaggggaagaaaaggaagggaggggaaaggaagaaaaggagaggagggggaaagaaaagagagggaaggagagaaggagaagaaaaaagaggggaaaaagggagaaaggggagaggggggagaggagaagaggaaggggaaaaagaggaaaggaaaaggagaagggaggaagaaaaggaggaggggagggaaaggggggaaggaaggaggaggagaaaagaaggaaagagggggaaagagaaaagagaaggagagggagaggagaaaaaaaggaaggagaggaaggaagaagagaggaaagaaaaagagagagggaggaagaaagagggaaaagaagagggggaagaggaggaaaagggagggggaagaaagaaaggaaaggggagaggaagggggggagagaggggaagaaaaagggaggggagaaaaaggaaggagggaaaagaagaggaggggaggaaaaaagggagaaagagaaagaaaaagaaggggaagagggaagaaagaggagagggggggaaagggagggaggagaaaagggaggggaaagaaaaggaaaaaaaaagaagaagagaaggagaagagaggggagagaggagaggagaagaaaaagagggggaaaggggggggagaggaggggaaaagagagaaggggggaggaagaaagggaagggaaggggaagaggagggagaaaggggaagagaagaaggaaaaggagggaaggagagaggggaaaaagaaaggggggaaaagaagggagaagggaggggagggggggaaaggagaggagagaggaagaggagagagaggaaggagggagagaaaagaaagggaaaaggaggggaggggggagaagagaaggaagaggagaagagaagaaaagaaggaagaaaaaaaaggaggaaaaaaaaaaaaggaaggggggaaggaggggaagggaggaaggggggggagaagaaaaggagaggaaaagagagggaagagggaggaaggaaaaaaagaaagggaagaaaaaggggagaggggagggaggaaagaagagaagaaggagaggaggagagaaagaaggagaaagaggaggggaaagggagaaagagaaaaaagaaggagaaggaaaggggaagaggagagggaagagaagaggaaaagaaaaaagagaaagggagagggagagagaagggaaggaaggggggaaaagagaaaaaagagaggaagaagaaaaagagaagaaggagggaaagaagaagggaggaaaagagagggggagggaaaagaaaaagggggaggggaggggaaaaagaaaaaaagagggaaaggggggagaagggagggaaagagagggagaagagaaagaggagaagggagaaaaaagaagggagaaaaaggaaggaagaagaggggagagagagagggaggaggggggaaaaagaaaaaaaagggaagagaaggaagaaaaggaggagggaggaggagggaaagaagggagaaagggagagaaaaagaggaggagggagggaaaagggaagaggaagaaagagaaaaaaggagaaggggaaggaaggagaaggaaggggagggaaagaagaggggaagaagagagaaaagaggggggggaggaagaaaggaaggaaggaaaaaggaggaaaggagaagggaagggaaaagagagaagaaaagagaggagaaagggaaagagaagagaggggggaggagaaaagggagggggaaggaaaaaaaaagaagggaaagaaggggaggagaaagagagagaaagagaagggaaggaagggggaggaaagaggaaaagaaaagaaagagaggaagaaaggggaggaggaagaggaaaaaaaagagggaagagaagggaagagaagaaggaagggggaagaagaaaagaaggaagaaaagaaggggggagaagaaagaggaagagggggaaaggagagagggagaaaagaaaggaagaggagagaagaggaaggaaggaaaggagaaagggaggagaaaaagggagggaaggagggaagaaaaaggggagaaagggggggagaaaagaaaggggagggagagaaaagagaaagagggggagagggggagagggaagaggaggagaaaagggaaagaaggggaagaagaaggaaaggaagaaaggaaaaggaaggaaggggaaaggggagagagaaaggggaaaaagagaaaagagggggagagagagaaaaggaaagaaagggaaaaaaggaaggaagaggggggggaaaaagggggaggagggaaagaaaaaaggggggaagaggaggggaagaagggaaaagaaaggaaagagaggaagagaaagagagggaaaaaaaaagggggaagaagggagaaagagaggaaaaggaaaaggaggagggagaaaagaaaaagaaaggagaagaaagaagaaaaaggggaaaagggaggaaaaaggagaggagaaggaagagaaaggaaaaggagagaggaaggggaaaaaggagagaggggaaggaagggagaagggaaggaaggaggaagaagaagggaagagaaagaggagggagggaagggagaaagagagggaaagaggaagaagaaggaggagagaaggaaaggaaaaaggaagagaaggggaagaagaagaaaaagggaaagggaggagaaggaagggaggagggagagaggaaagagaagaggaagagagggaggggagaggggagaaagagaggggagaaaagaaagggagaggaggaagagggagaagaaaagaagaaagggaagaagaaggaggaaaagggaaaaggaaaggaagaaagagaggaaagaaagggaagggagaggagggggggaagagggaagagggagaaggaaaaaggaagaagagaagggagaggagggaggaggagaggaggggggaaaaggggaaaaggggagaagggagggaaagaaaagggggagggaggaagggaaaggaagaaaaaaaagagagaggggggggaaggaagggaaggagagaaaaggggaaggagggaggaggaaaagggaagaagggaggagaaagagaaaagaagaaaaaggaaggaaaagaagaggggaaaaaaaggggaaaagaaggaaaagaaggaagggaaagaggaaaaagggaggaaggaagagagaggggggagaggagaggagaggagaaagaagggaagagagggagggaaaggagggaaagaagggaagaaaaaaaagaaaagaggaaagggggaaagggagggagaaaggggggaagaagaggagagagagaggaagaaaaagagaagaggaaggagaaaaagaagagagaaaaagaaagaagaaaggagaagagaaggaaaaggaaagaagaaaaaggggaagagaaaaagaaggaaaaaggaaggaaaagggagggagggaagaggaaaaggaaggggggggaggagagggaaaggaaaggagggagaaggaagaggagggaaggaagagaaaaggaaaagaaaaaagaggaaaagaagaggagggggaaagaaaaggagaggaaggagaggggaaaaaaaggagggagaggggagaggagggggagaagggaagggggggaaaggggagagggaagaaaaaaaaggaggggaagggaaagggggagaaggaaagggagagggaagaagagagagagagagaaaaaagaaaaggaggaaaggggagagagaaaaaggaaggaaaaagggaagagaaaaaaagggggaaaaagaagaggagagaggaggggaaggaaggagggagaaggaaggaaaaaagggagagggggggaaagaagaaggagaggaaaaagagaaagagagaagggaaagggagaggggaaggaaaaggagaaagaaaagagggaaaaaaggggagggaagaggaagaagggaagggggaagagggagggaggaaagaaaggaagagagaaaggaaaagaaaggaaggggaagggaaaaaaggggagaaggggagggggggagaggaaggggggaagaagaaaaagggagagggagggagagagagagaggggaaaggagaaaggaaaaaaggaaaagaaagaggaaggggagaagaaggagaagagaaaaggaagaaaagggaggaagagagaaggggaagggagaagagagaggggggaagaaggggggaaggggaaagagaggggagaaaagaagaaagaaagaggaggagagaaaaaaggggaaaggaggaggagaggggaagagggagaaggggaagagaggaaagaggaaagggagaaagagggagagaggaagaaggggaagggggggaaaggaagaaaaaagaggaagaagaggggggagggaggaggggaaaagagagagggaagggggaaggaaaggaaaaaaggagggaaaggggggggagagaagagagaggaggagaaaggggaaaagagaaggaaagaggagggagaggaaagaaagaaggaggagaaaaagggagagggaaaaaaagagggaaaaagaggaagaggagaaaggaaggagagaagagggaaaaggaagaaaagagagaagaaaagaaaaagaaagagaaaggagagggggaggaaagaagagggggggagaggaagagggaaggaaaagaggagggagaagaaagaggaaaggggagaaagggaaaaagggaaaggggagggagaaaaaggggaaaaggggagaagagagaggaggagagagaaagagggagaagagggggggaagagagggaagggaggaggaagaaggagaaagggaaagaaaagaagaggagagaggaaaggggaagggaggaaggggggaagaagagaaaaagaaaaggagaaagggggggaagagagagggagagagaaaaaaaaaggggaggaaggggaaaaaaaaagaaagggaggggagagaaagaagaagagagaagagggagagaaaagggggaaggagaagaggaaaagagaagaagggaagggggagagaagggaagagagagaaaaaaaggagagaaggaaagaggaagaaagaaggagagaggggaaagaggaaaaagggaaaaaaagaaagggggggaaaaaagaaaaaaagaagaggggaagggaaaaaaagagagagggaagaaagggggaagggaaaaagggaaggaagaaaggaaaagagaaggaaggagaagaaaagaaaaagagaaagaaggggaaggaagaaaagaagaaaaagaaggagaaaaaggaaagaaagagggggaggggggggaggggggggaggaaagaagaaaagaaaagggggaaagaaaaaaagaaagggaaagggggaaaggaaaagagaaggggaagaaaggggaagagaaagaaaggagagggagaggagaaaaagaaagaggaaagggagagagaagagaaggagagaaaaggagagaagaggggggaaggaagagaggaaggaggaagaaaggagaggggagaaaagagagggaaggaaaggggagaaaaaaaagaaagaagggagaggagagaaagagagagaaggaaaaaggaagggagaagggaaaaaaagggaaagaaaaaagaaggggaggaggggggagaggggaaagggagggaggaaaggaaggggaggagagggggaaaaaagaagaagaggaaggaaggggaaggaagagagagaagagaaaagaggaaaggagaggagagaagagagaaggagaggagggaagaaggaagagaagggaagaaggagaagaaggaggagaaagagagggagaaaagaggggaggaggagggggagaaaagagaaagaggagaggagggagaggaaggaaagagaaagaggaaaaagagaaaaagggaagggggggagagggggaaaaaggaaggaaagggaagagagggaggaagagagaggggggaagggaggaggaagggaaggggaagggagaggggaggaaaaggggggaaaaagagaagaaagagaaaggaaagagggaagggaaaggggaaaaggggggaaagaaaagaaggggagaagaaggggggaaggggagaaagaggaaaaagggggaaaaaggaaggaagaaggaaaggaagaaaggggaaaggaaagaggaagggaggaaaaagaagaggagagaagaggggggagaaggaagagagagggaagggaaaaaaggaagagaagaaaaggaaaagaaggggaaaggggagaagaagaagggagaggggaaaggaagaaggagaggaagagaagggaagaagaggaggagaaaaaaaagaagaggagagggggagaaaagagagaaaaagaagaggaagaaaggggaagagaggaaagagggggagagagaggagaagaaggagggaggagggagaggagagaggaaaaggaagaaggggagaagggggagaaagaaagagggaaaaagaaaaaggaagagaaagaagagaagggaagaaagggaaagaggagaaggagagaggaaagaagagagggagagggaggaaaagggggggaaagagaagaagagaagaaaagagaggaagaaggagaagggaaaagaaggggaaagggggggaggagaagagagaggggggggaagggaggaggggaagaaggaggggaaggaaagggaagaaggaggaggggaaggaaagaaggaggggaggggggaggaggggaagggaaaggaaagggggggaagaagaagaggaagaaaaaggagaagggaaggggggaggaggagaagggaaaagggaagaggggaaaagaaaaagaagggggaaaagggaaaaagaaagaaggggggaggagaaaaaagagggaagaaagaagaaagagagaaggggagggaaaagagggagagaaaaagagaaaagaagggaggaaaagaggaagaaggaaagaagaaaggagggaggaggaaaaaaaagggagggaggaaaagaaggggagaggaaggagaggaagggaaaaaggaaggggaaaggaaaggaaaaggggagagaagaggagaagagaagagaaggagggaagaaggagaagagagagaaaggaagaagaaggaaaaaaaggagggggggagagagaaggaaggagaaaggggggagaagaggaagggggggaaaggagaagaagagaagaaaggggaggggggaaaagggagaagaaggaagaggaaaaagaggggagaggagaagagaaaaagagaaaggaagaagaggaggaagagaagaaagaaaggaaggggaggagagagggagaaaggaggaaaaaaaagaagaagaaaagaaagaaagaggggggaggaaagaagggagagagaaagaggaaaagaagagaagaagagggaaaggaagagaggaaaggggaaaaaaagaaagggaagaggaaaaggggaggaaagggagaaaaggggggagagggggaggaagaaggggaaaaagggaggggaagaaaaggaaaggagaagggggaaagggaaaaagaggaagaaagaggaggaagagaggaaggggaaagggaaaagagagggagaagggagaggaaggaaagaagagaaagaggaaagaaagaagggagagaagaaaaaagagaggggaagagggagaagggaggggagggagaagagggaaggaagaagaagagagaggaaagaaaaagagggggagagagaaaaggaggaagagagaagaagaaggagagaagagagagaggaaagaggaagaagaagagagaaggaagaagaaaaagaaaagaagaaaaaaaaaaaaaagagggagaaggaaagaaaaggggggggagaggaaggaaaagaagaagaggaagaagggagaggagagggaggaggggggaaaagaggaaggaagggagggggaggaaggagagaagagaaaaagagaagaaagggaaaagggaagaggaaaagaaaaagagggggaggagggggaggaagaaaaggaaaagaaaaaggggaggagaaaagggggaggaaagggagaggaggaagagaagggaagggaaggaagaaagaaggaaagaaaggagggaaaaggaggaaaaggaagaagagggaagaaaaggagaaggagagaaaaaggaagagagaaaaggaagaggaggaggagggaggggaggggggggagaagaagggggggaagagaggaagagggaggagaagaagaaaagggaaggggaaaaagaggaagggagaaaaaaaaaaaaaaagaagaaggaggggaaaaaaaaaagaggaaaaaagagaagaagaaggagaaagaggggagagagggggggaagggaaaagggggagagaagaggaggaaagggaagaaggggagaagaaaaggaaaaggggggaagaagagaagaaagggaaggggggggaggaagggaagaagaagagagaggagggaaagagaagggaaaggaaaagagagaggaggaaagaggggaaaagaaagaaggagaggagggagaaagagaggaaagaagaagagggaaggggagaaaaaaagaggaaagaagaaaagaaaaaggaagaaaagggagggggaaaggggaaaggaaaggggggaagagggaaaggggagaggaaaggagaggggaaagggaaagggaggaaggggggaaaagaaggggaagggaaaagaaaaggaagaaagagaagaaaaaagaggggagagagggaagaaaggggagaaagggggaaggggaggagggagaaagaggaaggaaaagaaagggaggaggaaaaaaggggggaaaaagaaggaggagggaaggggagaagaggagaaaaggggggggaaaggggagagaggggagggaagaagagaaaagaggggagggggaaaggaaagggaaggggaggaggagggagaaagaggaaaaaagggagaagaaggggggaaggaaagaaaggaaaaagagaaagaggaaaaaaagagagaaggagggggaggggggggagagggaggagaaaggaagaggagggagaggggggaaggagaaaaaagaaagggaaaaaaaggggaggggagagaagagaaggaaaaaaggaagaaggagaagggaggaggagagaaaaggaggaagaaaagagagagaagggggaaaggagaggaagagagggaagggggggaggagaaaaggagaggaggagagaggggggagagaggagaaaaggagagaaaggagagaaggaggaaagagggggaggaggaaagaagaggaggaggggaggaggaagggaggaagaagaaaagggaagaaaaaaggagaaagagaaaaagaagggagaaggaagggagaaagagaaagggaaggagagagaaagaaagaaaaaaaaaagagagagggggagaggaaggagggaaagagggagaaaagaagaaggaaagagagaagaagaagagaaggggaagaaagaggagaagagaggggaaagaggagagaagaaaaagaaaaaggggagaaagaggagaagaagaaagaaaagggggaagggaggagaagggggaaaaagagaggaaggaaaaaaggaagggaggagagggaaaaaagaagagagaagagaaagaaggagaagggagagagaaagaaaggaagggaaaaaaaggaaaaaaaagggagagaagggagaaaaggaggagagaggaagaaggagagaaaggagaaaggggggaaagaaaaggaagggggagggaggaagggggaaagaaaaggggaagagagggaaaggggagggaagaagagggaagggggggggaaagagaggggaaggagggggaagaaaggaggggaagagggaaggaaggaaaggaaagaggagagaaggaaaagggaaggagaaagaaaaaaggaaagaggggagaaaaggaaagagaaaagagagggaggggaaaaagggagggggaaggaaggaagagaaaaggagaaggggagaggaggaagagagaaaaagagaagaaaaggagggaggaggagaaaagaaaggaaaaaaaagggagaaagaaagggaaagaggaagaggaagaagaggagggaagaagagagaaaagaaagagggggggggaggaagaaaagaaggaggaggagaagaggagaaaagagaaagaggagaggagaaaggagaggaggagaagagaaaaagagagaagaagaggggaggggaggggggagggaagggaagagaagaaggaggggaaggaagaaaaggaaaggggaaaaaaggggagagaagaggaaggggggggaggaagaggggaggaagggagaaagaggaagagggaagaagaagagaaagaggaaaagagggggaaaggaaggaaaggaaaaagaaaaaagggggaaagggggaaggggagagaagaaggggaaaaagagaaaagaggggggaagagggaaaagagaagaagaagaaaaaaggaggaggggggggggaggaaaagggaagagagagaaagaaaaagggggggaagaggaaggggagagaggaggagaagagaaagaaaagaagagagagggaaggaagaagaaagggggaagaggggaggagaaggggaaagggaagaaaaggagggaaaaaagaaaaaggaaggagaaaagaaaggaaaaaggaaaaaagggagaaaggaggaaggaaagaggaggggaaaggagaggaagagagaaggggaaaaagaaagagagaggagaaaaaggagaagggaagagagaaggaagaggaaaagaagggaaggagaaagggggaaagggagaaagagagaggaagaagaaaaagagggaggagagaggaaagggggaagaagagggaagggggagaaggagagaaagggaaaagaagaagaagagggggagaagaaggaaagagaagaaaagaggaggaagggaaaggaagagagagaaaagaggggggaggaaaaaaaagaaaggggggaaaagggaagagaaaagaaaaaagagaaaaggagggaaaaaaggagaaagggagaggggaaaagggaggaaagaaagggaagagagaagagggagggaagagagaagaggaggagggaaaagggaagaaaagagggaagaaagggaagaaggagaagaggggggaagaggggaaaaaggaggaagagaggaagggaaagggagaggggaggaagggaaaggaagagagaagggggaaaggggggggaggaaaggggaggagagaaaaaggggaagagaaaggaggaaaagggaaaaggggaggagaaagagaggagaaaggaaggggaggagagaggggagggaggaggaggggagaaagggagagagaaaaaaagggggaaggaaagagggagggaggaaggagaaaagaggggagaggaggaaaggagagagaaagggaaggggggaggaagggaggagaaaggagggaaggaaaaagagaaagggaaagagagagaaaggggaggaggaaggggggaaggaggggggagaaggaggaggaaaaggagaagagggaagaaggaaagaggagagaagaagagaaaggaaaggagaagagagaaaagaggaaagaggaagaagagaaagagaagaaggggagaaaaggaaaggaaaggaaaggggggaaggagaggaagaagaggggggaggggaaaaagaaggaaggagggaaaaaaaaaagaagggggggagaaaaaaagggagagggaaaaggggaaaagaaaaaaagggagaaagaaaaggggaggaagggaagggaagaaaaaggagggagggaggaaaggggggggagaagggaaggggggaaaagggaaggggagaagaaaaaagggaggggaagggaaagagggggaaggaaagggggaggaagaaggggaaagagagagggaaaggaaaaggaaaaaaaaggggagaaagaaaggaaggagaaagggaaaaggaaaggggggggaaaaaggaagggagagaagaggggaaagaaggggggagagggaaggaaaaaagggggagagggggaaagaaggaaaggaggaaaaggagaaagagaaaagagaaagggggagagaagggggaaggagagaaagaggaggggaaggaagagagggaagaagaaaaaagggagagggaagaagagggaagaagagaaaggaagaaagaagagaggaaaagggaaaagggagggaagagaagggggagggggaaggggggagagggggggagggaggagggaaaaggaaaggggggaagaaagggagaggggaaaggagagagaaaaaaaaagaaaaaaagggaaaaggaagaaaaaggggaagagaaaaagaagaaaagagggagagagagaaagggaagggagaaaagagagaagggaagagaggaggaaaagaaggggagggagaaaaaaaaagagagaaggaggagaggggaaaggaggagaaagggggggaaaaggagaaaagggaaaaggagaagagaggagagggggaaagaagaaggagagagaaaggaggaagagaaaggggggggaaagaaaagaaaggaggaggaagaggggggggaaaggaggggagaaaagggagggaaggggggaagaaaagaaaaaaaaagggaaaggggaggaggaggggagaaaggggagaaaagggagaaagaggaggaaagaggagggagaagaggagagggaggaggagagaaggggaggaggaggaaaaagaggaaaaagaagaggaggaagagaggaggagagaagaggggagaggaagaagagggagggggaaagaaaaagggagagaaaagaggggaagaggaaagaagaggggaggagagggagagggaaagaaaagaaaagaaaagaggaagaaggaagggaagaggggagagaaaagaaagaaaagggaggaaggggggaaagggagagaaaagaaaagaggaaaaaaaaaggaggagggaaaggggagaaaggagggagaggaggaagggggaaaagaaagggaaagaaaagaaaaggggaggagaaaagggaagaggggaaagaaaaagagagagaagaagaaaaaaagagagggagagaagggaagggaagggagaaaaagaaaggagaggagggggaaagaagaagagaagaaggaaagagaaaaaaaaagagagaaaaagaaggaaaaaaggagaagaagagaaggaaaggaaaaggagggaaagaggggagaaaggaagggagaaaaaaagagaggaggaggaaaaaaggaagaagaaggagagagagaaaagagggaaaagggaaaaaaagagagagggggaaaagaggagaagagaaggggggaagggaaggagggagaaaaagaaggaggaggaaagggaggaagggaaggagagaagggagggagggggaaagagaggaaaagaaaaagagaaaggaggaagaggaagaagagaaaaaggagaaggaaaaaaaaggaagaaagagagaggggggggggagagagggaaggaaagaagaaaagaaaggagggaaaggaagaaaaaaagggaaagaggggggaggaaagaaaaggggaaaaaagagggggggaaaaaagagagaaggaaaggaggaaagaaaaggggaaaaagagggagaagagaaagagggaaaaggagaggagagggggaaaggaagagaggagggagggaaaaagaaagaagggaaaaaaagggggagggaagaggaagaaaaaaaagaaagaaggaaaaagagagaaggagaggaaagaaaaaaggaggggagaagagaaaaaaaggagaggaaaaaaaaaggggaggagaaaagaaggagaaaggagagggagggagggggaggagggagaagaggaaaaaggaagagggaggaggaaagggggggaagagaaagagaaaaaaagaaggggggaaagaaaaggagggaaaagaggaggaaggaaggggaaagaaagggagggagggagaagaagagaaagaaagagaggaagaaaagaggggagaaggagagggagaaaaaggaaagagggggggaggggggggaagggagaaaaaagaggaaaaggagaaaaagagaaagaggggagaggggaaaaggggaaagaaagggaaaagagggaagaagggaggggagaggagggaggaggaggggagggggaagggaaaagggaggaaggggagagagggagaagagagaaagaaagaaaaaaaggaagagaaaggggaaagggggaaaaaaagaaaagggggaagagaagggggaaaggggaaaaggagaagaaaaaagaaaagagggagaaagagagggaggaagaaggagaaaaagaaagaggaagaaaagaggaagaagagaagagaagaagggggaagaggaagaaagaaggaaggggagaaaggaagaaaagaaaaggaaaagaaaggaaggggggaggggaagaggggagaggaggaaggagaaaggagaaggagggaaaaggaggagggagggggaaaaaagggaagaggaaggggagagaaaaaagaggaaaagaagaggggagaggggagaaagaggaaagggagagagagaaaggagaggaagggggggggaggaagaagagagaggaaaggaaagagggggggaaagggggaaaagagggagggaaaaaaaaggaggaagggaaagaagggaaggagagaaagaggaaggggaggagaaaagaggaaaaaggagagggaaaggaaagggaagagggagggggaggaggaaagagggaaagaagggaaggaagaaaagggggaaggagagggaagggggagaaggggaaagggaggagaggaaaaagagaagggggagaagggggggaaagaaaaggagaaaagaggaagaggaggagaggaagaagggagggggaggaaaagagagaggagaaaaagggggggaagaagagaagggaagagaagggaaggggaaggggggaggagaagaaaaggaagggggaaagggggaaggaagaaaaagggagaagggagaaggaagagggaggagggggggggagagagggggaaaagaaggggaggaaaaaagaggagaaaagagagggggaggaaaggaggagaggagagaggaagggaagaaaaaaaggagaagggagagaggaaaaggaaaagaagaagaggagggaaggaaaggggaaaaagagaggaagaagggaggaaaggaggaaggaagaaaggaaaagaggagagaagggaagaagagaaggggaggggggaaggaagaggagggggaggaaggaagaaagaggaaaaaagggaaaaaaggagagaagaaagaggagaaaagggggagaggagaaggaggaggaaagaaaaagaaaaggagaaagaggaggggggaaaagaaggaagaggaaaaaaaagaggaagagaaagggagaaaggaagaaaaaaaagagagaagagaagggagaaaggaaagaaaggaaggggagaaaagagggggaaaggaggagggagaagaagaaggagagagaggaagaaaagggaggaaagaaggaagagaaaaaggagaagaaaaaaaaaggaggggaaggggaggggaggaagggaaagaaaaggaaagagaagaggaaaagggaaggaaaggaaggaaagggaggaaaaggggaggaggaagaaggaggaaagaaggggaggaaaggaaagggggggggggaaaggagaaaagaggaaaaaggaggaaaaggagagggagggggaagggaaaagagagagagaagagaaaggaaggaaggaagagagggagggaagagagaaaagagaggggaaaaagaaggggaaaaaagggagagaggaggggggggagaggagggaagaaggaaaaaagaagagggaaggaagaaaggaggagagaggaaaggaggaagagaggagaaaaaagagaaaagggagggaagagagaagaagaagaaaaaagaagaaagaagaggaagggaaagagaggaaaaaaaagaggaaggagagagagagagaagaggggagggaagaaggaaaagaagaggaggaagaagagaggagaggggaaggaggggggaagaaaggagagaagagagaaggaggaaggagaaaagagaaaaggaaaggaaaggaagaagggaggaggagaagaagaagagggggagaaaaaggggggagagaaggaaaaaaggaaagggagaaagaaggggggaggaaagggagagaagagaaagaggagaaaagaaaagaaaaagaagggaggagaggggggaagaggaggagaagaaagaagggggaagggaaagagaaggagagaaggagagagaaaaaagggaaggggaaggaagagagaagggaggaaggggagaagaaggggggggagagagagggagagaggaggagaaagagagagaggagggaagagaaaaagaaagaaaagaaaaaaaggaaaagaaggaggggagaaaaaaagaagaagaaaaggggagagggaagagggaggggagagagaggggggggagaaaaaaaaaggaggaaaagggaggagagaggagaaaggggggaaaagggggaagggaggagaaaagaaagaaaaggggaggggggggaggaaaggaaaaagaagagagaggagggagaaagaaggggaaggaaaggagagaggaggaaagagggaaggagaaagagggagagaagggagaagggaaaaggaaaagaagggggaaagggagaaaagaagaggggagaagaaaaaaggaggggaaagaaaggaggggaaaaggggggggaaaaaaggggaagagggaaagggagaagaaaaggagagggaagaaagaagggggaaaaagggggaaaagagggggaagaggaaagagagagaggggaaaaaagaaaagggagaggagaaggggaagaaaggggaggaagggggggggagaggagagagaaggagggagaagagaagaggaagggggaagagaggggggggaaagaaagaggagagaaggaggggagaagaaaaaagagggagaaaaggaaagaaaggaaagggaggagaagaaaagaaaggagggggaaaagaagaaaggagggaggaggagggggaaagagaagaaaggggagaagaaagggaaaaaaaagagaaaagaaaagggaaagagagaaaaaagaaaaaaagaggaagaaggaggagagaggagggaaaaagggaaaaagggggaagagggaaaagaagaagaaaagagaaaaaaaaagagaaaggaaaagaggaaaggggaaaaagaaaaaaggaggagggaggaggggggaggaaaaggaaggaaagagagaaaaaagagaaaggggagaaggaaaaggaaagggagggggagaggagaagaggaggagagaggggggggagaggagaaaaggggaaaaaggagggagggaggaagggaagggagagggaaggggaaaggggagggaaagggggaggggggaagaaagaaagagaagaaaaaaagagaaagggagaaagaagggaaggagaagggaaagagaaaaggagggggagagggaagggagggaaaaaaagagagggagaggggaagggaggaggggaagagggaggaaaggggaagggaggagagaaggagagaagagagggaagaaagaggaggaaagaggggagagagaagagaaaaaaaggaagaagggaagaaaagagagaggggaaaagaaaaggggggggggagggaaaggaggaagaagagaaaaaggaaaaaagagaggggggagagggagggaagaagagagaggagaaagaaagggaagggagagaaaaagaaagggagagaaaaagaagaaaaaggagggggagaagagagagaagagagagagagaaaaaaggaggaagaagaaaaaggggagaaaggaaaagaagggggaggaagggagagggaaagaaaagggggagagaaggaaaagaaggggaaaaaaagagggaggggaaggggagaaaagaaagaggggagggaggagggaggagaaaaggaaaggaaggagaagaaagaagaaagaaagaagaggagaaaagaaaaaaaaaaggagaggagggaggaaagagaaaagagaagagaagaaggagagggagagaaagaaaaagaggggagagagaaggagaagggaagaaagagaggggagaaaagaaagagaaggggagaaaggaggagaagaaaggggaagaaagaaggggagagagaggaaaaaagggagaggagggagaggagagaaagagaaaagaagaggagggagggagggagagagagggaaagggggaggaaaaaaagagaagagagaaggaggagaggaaaagggagaggaagggaggaggaaaagggagagaaaggagggaggggaggggggagggaggggaaggggagggggagggggagggagaaaaggaaggggggaggaagggaagagaaggggaaaggagggaaggaagaggggaggaggggagaaaaaagaagagggaggaaggagagaaagaggaaaagaggggggaaggaagaggaagaaaaggaaggaagaggaaaggaagggagaagagaaaaggagggaaaggagaaagggaggaggggagagggagaaagagggggagaaaaggaagggaggagggggggaggagggagaaggaagaaagagaaaagaaaggggggagaagaaggagaggagggaggaggagaggaaaaaagaaaggagagagaggagaagaagagggaaagaggaagggggaaggggaaggagaaaggagagaaaaggagaagaaaaagaagggggaggagaaaaagaaagagaaggggaagaaaagaggagaggaagaaggagagaagagagagagggggagaaaaaaaaaaggaaaagaagaagggggaaagagaaggaggaagggggaagagagaagagaggggaaaagagggggaggggagagggagaggggaagagagagaaaggagaaaaaaaaggggagaggagagaggaaagagggaagaagggggaagaagggggaggagggaaaggggaaaaaggaaagggaggaggagaggaaggaaagagaggaaaaggagggaaaggaaaagaaagggaaagagagggggggagaggggaaaggagaaaggagagggaaggggagaagaaagagaaagaaggaaagggggaaaaggaggaagaggggagaaaggagaaggagggggggaagaagaaaaggaaaaggagaaaaggggaaggaagaaagaggggggaagaaaaaaaaggaggaagggaagaaaagaaggggaaagagaggaaaggagggaaagaaaagaaagagaggaaggaaaagaaagagggaaggaaaggaggggaggaggggaggagagaaggggggaaagaaaaggggagaagaggaaaaggggaaaggaagggagggagaaggagaagaggaggggaaaggagggagaaaggaggggggagggagaggggaagagggaggaggggaggaagggagagagaaaaagagggggaagaaaggaagaaaagaggaaagagaaaagaggggagaggaggaaaaggaggggaaaggggagagaaagaaaaggaagaagaaaggagggaaagaagaagagagggggaaagaaaaagaagggagaaggagaaaaaggggaggaagagggagaaggagggggaaaaggaaaaggaggaagaaggaaggagaaaggagggggaggaagggaagagaggggaagaaaggggaaaggaggaaggagagagagagaggaaggggagagaggaggaggaaaggagaaaggggagggagaggaagaagaaggggggggggaaaaagaaggaaggaagaaaaaaaggaggaagggggaaagaaaaaagaggagagggaaggggagggaaggaagaaagggaaagagaaaaaaggagaaaaggaagaaagggaaaagaaagagaggaagaaagggggggaagaagggaaggggggaaaggagagagggaggagaaagaaggggggaaaagagaaagagagggagagaaagaggaaggaggaggggagaagggaaggggggaggaaaaaaaaaaaaaaggggaaaaagaagggagggagaaaggggaagggaaagggaggaagaaggggaagggagagaaaggaagaaaaaagagggggaaggaagggaaaagagggggagaaggaggaagaaagaaaggaaggaaaggggagggggaaaagagaagagagaagagagggagggaggagggaaggagagggagagggaagagagggaagaagaaaaaaggggaaggggaaaagagaaagaaaggagaaagagggaaagagagggggaaaggggaaagggaggggagggaaggaggagagggaaggggggaaggggggggagagaagaaggggaagggaggggggaaagaagggaggaggggaaaaaagagggagaaaaaaagaaaagagaggaaaagaaaaagaaaagggagaaaaaagagagagagagaagaagagaagaagaagaaaggagggaaagaggaaaagggaaagaggagaaaaagagggggagagagaaaaaaaaaaagagaggggagagagagaaaaggagaaggaagggggggagaagaagggaggaggagggaaggaaggaaaagagggagggagaagaggaagagagaaaggagaaagaaaaaggggagggagagaaaaggaaggagaaggaaaaaggggggaaaaagaggagaggaaggggggggggggggggaaaaaaagggggagaaggaaaaaggaaaagaggaggggagaaagagaagagaagggagagaagggagaagaaagaagggagaagaggagggagaaaagaggagaagaggaagaggaggggaaagaggaaaaagaagggagggaagagaaggaaggagaggaggagagaggaaaaggaggggggggggagaagggagggaaaagaaaaaagggaagagaaaggaagaaggaaggaaagagaggaaggaaaaaagggaaagaagagggggaaaaggaagagaaggggggagagagaagagagaaaaggggggaagggagaaaagggagagaaaaggaaaaaaggagaaagaaggaggagggaaaagggagaaagaaaggagaggaaaaagggaggaagaaaaggaaaagagaagaaagaagggggagaaaaaggggaaggaaagagaaaaagaggaagaagaggagaaaaggagagagagaggggggaagggaagggaaaaaaagggaagagagggggagaggagggggaaagaagagggaaagggaggaaaagagagagaaaaagagggagaggaggagggaaagagaaaaagaggaaagggagagagagagagggaagagaaaggaggaaaaaaagagagggagggaaggagaggaagaggaagaagaaagagaaaaagaggaaaggggaaaaagagggagaggagaaaaagaggagaaggaaagggagggaggggaggaggaggaaaaaaaaggagaagaagagggaggaggaaagggggagaagagggggagggggaaagagagaaaaagaagaaaaagaaagagaaaggggaagaagaaaaaggggaaggaaaaaaggaaggagggaggagagaggagggagagggagaaggagggaaagaggaaaagaaaggaagagagggggggaaaaagggaaaaaaaaggggaggaaagaagagagaagagaagaggggggggaaaaagagaagaagaaggaaggaaagagggggaggagaagaggaagaagagagagaggggggaggaaaggaagagaggagagaaaggggggggggagagaaagagaaagaagggaaagaaaagggaagggaggaggaggaaaagagggaaagaagaaaaaagagaaagggggaggaaggagaaaagaggggaggaaaaaaagaaagagagaggagaggaaagggagaagagaaaaggaggagaaaggagaggaaaggaggaggaaaaggaagaagagaaaaaaggaagagagaagaagagaaaagggagggagaaggagaaaggagggaagggaaaaagaaagggagggaaaagaggaagaaagaaaggaaaagaaagggagggagggaaaagggaagaaagagagagaaaaaaaggggagaaaaaaaaaagaggaggaaggagggaagggggaggggggagggagaggggagagagaaaaggagaaggaggaaagaaaaaagaagagaaaaaaaaggaggagagaagaagagaaaggggaggagaagggaggaaagagggggggggaagagaggagaggggaagaaaaagaaggaagggggagaaaggggaaagaaagaaagagaaaaaaagaagaaaagaaagaagagagggagaaaaaaagggaagggggaagaggggagagaagaagggaaagaagaagaaaaaagaagggggggagaaagagagggagggaggagaagaaagaagaaaaaaagaaaaaagggaaggaaagaaaggaagaagggggaagaggaggaaagaaggaaagggagaaagggaaaaaggagagagaaaaggaaagaaggggggaagggaagagggaaaagaaggaaggggaagaaaggaggaagaaaaaggaggaaggaggggaaaaagaggaaagaagaagaggaagagggaaagagggggaggggaggggagaggggagaagggagaaagggagagaagggaagagaggaaagggaaggggagaaagaagaagggaggaaggaagaggaaagggagagggggaaggaagggaggaaaaagaagggggaaaggggaggaggggagaaagaagaagaggaaggaggggaaaaaagaagaaaagggagagggaagagaaagggggaaaggagggggaagaggaaaaggggggaaaaggaaagggaaaaaggagggggagagaggggagagagagaaggagaaagggaagagaagagaaaggaaaagaagagagggggaggaaaaaggaaaagaaaaaagagagagggggagggggagaaagggggggaaggagaaaagagaggggaaaaagagggagaaaaaaagaaaggaagaggagggaggagaaagagaggaggagaagagaaggaggaaggaaagggggaaggaagaaaaaaggaaaagggagggggaagggggaggaggaggggggagagaaggagagaaggagggggggaaaaggaaggggaaaagggggggggggggaaggaagagaggagaagagaaggggagggaggaaggggaagggagagaagaaaggaagaaggggaaggggagaagaggaaggaaagaaaagagaggaaagggaggggaaaggaagaagggagaaaggagaggaaaaaaggaggaaagaagaaagagggagggaagaaggaagagggaggggaaggagaaggaaagagggagagagggaaaaaaggaggggagaaagaggagaaaaggggaaggggggaagaaagaagaagaagagggaaaaagggagagaggagaaaagaaaaaaagggagggaaagaaaaagaggagaagagagggagagagaaagaaaaagaggagaaaagagaaaggaggaagggagaaaaagggggggggaaaagagagggaaagaagaagggagagaaggaggggggagggagaaggaaagaaaggaaagaagaaaagaaaaggagagaagaaagagaaagggagggagggggagaggaaagaggaaaagagagggggaaagaagaggaagaagaagggaaaggagaggaaagaaaggagagggaaggagggaaaaagaggaaagaagaggaagaaagaaagggggggagggggaagaagaaagaaaaggaaagaaagaaaagaagagggagggggaaggaaaaggaggaagagaagagaaaggaggagagggagagaggaaaggaagagaagaaagagaggggaaagagagggagaaagaaggaagggagagggaaggggagggaaggagaaaggggaagaagaaaagggagagggggagagaaaagggaggaagggagaaggaggggaggaaaaaaagaaaggggagggaagggaggagaaaaagaaaaaagagaagagaaagggaagggaaaggggggagggaggagagaaaggggagagagagagaaaaggagaggaaagaaaggaagggagaggaagaggaagaaaagaaaggagagggagggaagaggaagagggagaaaagagaaagaaaggggaaaagggaggaaaggaaagaaaagaaggaaggaagggggagaaagagaagaggggagaagaaagggaggagggagagaaggaaggaaaaagaaagagagggggggagaggagagagagaggaggaagaggagaaaaagaaagaaggggagaggaggaggggggagaggaggagaggaagaaagggggagaagaggaaaaaaaaggggaaaaggaaagaggagaaagggaagaggaagaaagagaggaaggaagaaaggggaaagagagaggaagggagggagggggaaaaaaagagaaagagaaaaaggaggggagagaaagaaaaaaaaagggaaggaggggaagagaggaaagaaggaaaggagaggaagaaaaggggaaagaggagaggggggggagagggaaaggggggagaagaaaaaaagaagaaaaggaagaagagaagggaaaggagggaaagggaggagggaaggagaaaagaaagaagaggggaaggggaggagagaaagaaagaggaaaagggggggggggaaggaagggggagggggggagagaagagaaagggaggagggggagagagagggagaggagagaagagaaaagggagagaaggagaaaaaggagaaaagaaaaagggggagagaaaaaggagaagaaagaaagggagggaagagggaggggagaaaaagggaaaaggaaaagggagaaaaaaaggagagggaagaaagaagggggaaggaagaggggaagggagggaagaagaaggggagaaagggggagaaggaagagggagaaaaggagggaggggaggggagggaagaaggggggaaggaagaggagaggagggaaaagggaggaggaagggggaggagagggaggggaaaaaaagaggagagaaggaggggagaagaaaaaagagaaaaaggggaaaaaaaaggaagaggaggagaagaaagaaaagaagggggaggaaaggaaaggaaagggagaggaagggagggaaaggagaggggagaggagaagaaaggaaaagagaaaaggaaaagggaaaagaggaaagaaaagaggagaggaagaagaaggagagaggaggaaaaaaaagaaaaagggagaggaggaaaaagaagaggagaggggaaagaaaaagaaaaaagaaaaaggagaagaagaaaaagagaaaaggaggaggggaaggggggggggaaaaagaagggaggggagaagaaagaaaggaagaaaaaggaaaagggaagagaagggggagggggaagaaagggagagggaagggggaaaagggaaaagggggagggggaggaagggggaaagggaaaggagagaaaggaggagaggggaaggagaagaggagaggggagaagagaaagaggaaaaaaaaaaaggaaggaagggggaggaagaggaggagggaaagagaagaggaaggagagaagaaagggagggaagaaagggaagggggaggggaagggagaagagggaaaagagggaaggggggagagaggagaggaggggggagaagaggaaggaaggggggggaaaaaggggagagagaaaaggaaaagggaagggaaggaagaaaagaaaaaggggaaaggggaagggaggggagagagaaaggaggaagggagaaaaagagaagagagagaggggggaggaggagggaggaaaaaagaggaggaaaagaggggaaggaaaagagaagaaaaggagagaaagaggagggaaaggaaggggaaagaaggaggaaaagagaaagaaagaagagagggaagaaaaagggagggagaggggaaaagaagggggaagaagggaaaggagaaggaaagagggagagaaggaaaaaaagggagaaagaggagggagaagaaggggaggaaagaaggaggagagagaggaggaaggaaaaaaggagggaaagaaggagaaaggagaaaggaaggaggagaggaaagaagaaaaaggaggggagaggggagagagaggaaagggaaagaaaaaagaagagggaaaaaaagaaaaagaggggggggaggaggggaagggaaggaagagagagaaaaagagagaggaaaggggggaaaagggaaggagaaagggaggggaaggagaggaggggggagaaaaagagggaggaagggagggggaaggaagagaaaaggagaggaggaagggaaggggagagggggagagaggaagggaagaaagaagagaaagaagaaggagaagaaaagaagggggaaaggaggggggaaaggaagagagaggagagaggagaggggggagggagggaaaagagagggaaagagagaaagaaaggagggagaaaggaggaagggaagagagggggaaaggagggaaggaggagggagggaggagaggaaaaaaaagaaaaagaaaggagagaaggagaaaaagaaaagggaaggaggagggaagaagggaagggagaggaaaggaaaggggaagagaagaggagagagaggggaaggggaggaggggagagggagagaaagggagagaaaaggggggaaggaggagagaagaaggggggaagaagaaggaagagagagagggaagaaaggaaggaaaaggaggagggggaagggaaggaagaaagggggaggaagagaagaagagggaaagaggggagggaagagggaaggaagggggagaggaagggagaagagaaaaaaggggggggagaggaggaaagagaggggaaagaggagagaagaggaagaagaagagaaaggagagggggggggaaaagaaaaaggaaaagaagaagggggaaaaagaaggaaagagggaggagagggaagaggaggagaaagggagagggaggagagggaaaggggaggagaaaggaaagggagaaaaaagaggaggggggaggggagagaaggaggaaggggagagaaaggagaggggggaaaagggaaaaaggaaaggaaggagaagaggaaggaaagagggggaggggaaggagaggaagagaagggaaaagaggggggggaaagaggggagggagagaggagaaggagaaggagaagaggaagagagaagggaggagggaaaagggggaagggggagggaaggagaaagaggagggaaagaaggaaaggagaaggaaaaaaggggaaggaagaaagagggggggagaagaaagagggggaagggaagaaaaaaaaggggaagagaggaagggagggagagaaaagaaaaaagagaaggaagagaaaaaggaagaagaagagggggagagggggaggagagaagggaaaaaggaagagaagggaaagagaagagaggaaagaaaggaaaaggggagaagaggaagggagagaaagagggagagaggaggaaggaaggagaggggaaaagggggggagagggggaggaagaggagaaaagagagggaggaaggggaaagaagggaagagagagaaaagggagaaggagggaaaagaggggggaagggagagaaagaaagggaagaaagaaggaggaaaagagggagaaggggggaaaggaaaagaagaaagaaagaggaaaaagaggggaagaggagagagagaagggaaaaggaaagggaaggagaagggggaagaaagaaggggagggaggggagaagaggagaagaagggggagggaaggggggagagagggggagggaagggagggggaaggagggagggagaaaggagggggaggggaaggagaaggaaagaggagaaaaggagggaaagagaaaaaaaggaggaagagggaaagagaagggaggaggggggaggggaaggaaggaagaaaaaaaaggagaaagaagaaaaagaagagaaaagggagagaaaaaagagaaaaaagaggagggagaggagggaaaagagaggggagagagggaggaggaagaagaagggaaaaaagaaagagagggggaagggaaagagaaaggaggagagagagaaagaggggagaggagaagaaagaaagaggaaaaaggagaggggaggggggaggaaggggaagggagaaagaaggaggagaaaggaaaaggaaaagaaggaagagagagggaggagaggaggagagaagaaagagggagggaggaaggaaggagagagggggaggaagaaaggggaaagaagaaagggaggggaaaaggaaggggaggaaggggggagaaagggggaaaaaaagaaagggaagaaggaaaaagaaagaaaggaggaaaggagaaagggagggggagaggaggaaggggaaagaggggaaaagaagagaggagaggagaagaagggaaaaagaagaaggggaagggagaaggaaagggagggaggagaaaggaaagaaggaagaaaggaagaggagggagaaagagaaaaggagaaagaggaaaaaggaaggagagagaagaaggaaagaggaaaaaaggagagaagggggaaaaaggaaggaaaagaggaaaagggggagaaagaaagagaagaagggaggggaaagagagaaggggaaaagggaaaggggaagaagaagggaggaggaggaaaagaaggaaagggagaagggaaaagaggaagaggagagaaggaaggaaaaggagaagagggagggaaggaaggagagggagagaagggggaaaaagaaaaaggggagagggggaggaaagaggaagaaaaggggagaagaaagaaagaaaaaagaaagggaagaaaagaagagaaaaaagagaaggggaaaggaaaaagaagagaggggagggaggaaggagagggggaagaagagagggggagagagggaagaggagggagagaagagaaggaaggggggaaggagggaagagagggaagaggggaggagaggggaagggaaagagaagaggaaaagaagagagaggaaaaagagaggagaggaaagaaaggggggaaagaagaggagggaaagggagagaaagggaaagggggaagggaaaaaaaggggggagggaaaagggggaggaaaaaagagaagaggagagagagggaaaagggagaagaaagggagagaagggagggaagaaggaggaagaggaaaaaggagggaaggagaagggggaaaaaaaggggaaagaaggagaaaaagaggaagaggaggagagaagaaggaagaaaagggggaagagaaaggaaaaaaagggaaaaaagagggagaggagggggaaaggagaggaaaaagggggaggaggaggagggagagagggaggggaaaagggaaagagaaaaaggggaaagagagaaggaaagagagaggagaggagagagagaaaaggaagggaggaagggagaagaagaggaggaaagagaagagggagaaggaagaagaagaggaaggagaggaaaggaagaagagagggaggaggaaggagaggagggggagaaaaaaagaagggaaaaagggaagggggaaaggggggaggaaaggggaagggaaagagagggaggagggagggagagaaaggaaaaggaagaagagaaaaagggggaggaaaaaagggaggagggagagaagaagaaggagaaggagaaagagggggaaagaagaggggaggaaaagagagggggaaaaagaaagagaaaaagggaagggaggagggagaagagaagaggggggggagagggaggagaaagagaaaagaaagagggagaagagaaagagaggaaggaagaggggagggaaagaaggaagaaaaaagaaaagggggggggggaaaggaggggaaagaaaggagagaaaaggaaggaagggaaaagagggggggggggagaggaagaaagaaaagggaggaagaagaagaaggaaggaaaggagaaaaagaaagaaagggaggaggaaagaaaagaaagaaaaagaggagagagaaaaggaaaggaggaggaaaaggaaggaaaaaaagagggaaaggagaagaaaggaaaaggaaggagaaaggagaaaggggggaagggaaaaaaagaggggagagagaaaggaaagaaggaaggaaaaagaggaaaggaggaaaagggggaagaaagggggaggaaagagggggaaaaaaaagaagaagaaggggggagagaaaggggaggagaaagagaaggaagagagagaaaggaggagggaagagggaaaaaaaaaaaaaagaaaaaggaggaaagaagagaaaggaggggaagagggagaaggaaaaaaggagagaagagagaaaagaaaaggagaaagagaagaagggggaagaagggggaaaggaagaaggggaaaaagagaaagaaaggaagaaaggagagaaaagggaggggaaggggaaaggaggaaaagaagaagagagggaggaaggagaaaaaaggggggggaaagaagagggagagaggagaaaagagaagaaagaaagaaagaagggaggggaggaaagaaaaaaggaaagagaggagagaaaaaagaaagggagggaggggagaaggagagaggaggaggaagagggaggggaggagaagggaagaggaaagagaaggaggaaaggaggaagaagaaggaaggagaagaggagaagggggaggagaaaagaagaagaggggaaaggggggggggggaaggagggaggaggagagaggaaaggaaaagagagaagagaggaaagggaaagaaaaaaaagagaagggaggaggaaagaggaaaggaagaggaagaaggaagggggaagggggaagggggaaaggagaggggggaagaaaggaggggaggggggaagaggaagaggaaggaaagggggagagaagaaagaaggggaaaggaagggggaggagaagaggggggaagagaaaggggaaaaagaagggggagaaagaggaaaaagagaaagaggaagggaaaagaagagaaaggaagaaaagaaaggaggaaggaaagggaaaagaggaaaaagaaaggggaaggaggaagaaaaggaggaagaagaaaagaaaggggaaaggaagaaagaaagaaggagaggaaggggggggaggaaagggaaagaggaggagaagaaaggggaaggaaaagaggaaggaagagaagagaaaggggaaggggggagggagaagaagaggggagggggaagaaaagagggaggaggggaaaaggaaaagaaaaaggagaaagggaggaggaaagggaagggaagagaaggagaaggaggaaggggggggggaagaaaaaagaaagagggggaaggagagaagaggaagaaaagaaaagaaagaaaaggaaagggggaagaaaaagggagagagaaggggaaaaaggggagaaaaggaaaagagggagagaaagaggaagggggagagggagggaagggggagggagggagagggaaaaaaaaaggagaggaaggaagaagaagaaaagggggggaagaaagaaagagaagagggggaaaggaggaaaaaagaaaagagaaaaagagaaggaaggagaaaggggagaagagagaaaaggagaaaggaaaagggaaggaagaagaaaaggagaggagggaaggagggggggggagaaaaaaaggggggaagaggggagagaagaaggggggagggaggaggaaagaaaaaaggaggaaaaagagagggagagaagaaggagaagaggagggaggggaagagaaaagaggaaagggggggggggaagaaagggaggaagaaggaagaggagagggaaaaaaagagaaagaaagagaggaaaagggggaaggagagggaggaagagagaggaggaaagagaggaagaaagagaaggaaagaaaaaaaagaaggaagggggagaggaaggagaaagaaagggggaggaggaaggagggggagaaaggaaaggggaggaagaaaaaggaggaagagagagggagaaggagggaggggaaagagaagaaaaaggaaagagaaagggggagaagagagaagagagggggagaaaaaagggagggggaaagaggagaggggaggaaaaaaagaagggagagggaagggggaaagaggaggaaaggagaaggaggagggggaggaaagggggggggggggggagagaaagaggaaaggaggagaaggagaagagaaggaaggagagaaaggaaaagggagaaaagaagggaaaggggaagaaaaggaagagggaaggaaaaaaaaggaagggagagaggaggggaagaaaggagggaaaggaaagaagagggggagaggggagggagaagaagaaaaggaggagggagaaggggagggagaaaggaagagaggagaggaaaggagaggggaaggaggaaaggaagagaaagaaaggagggaggaagggggggaggaagagggaggaaggagaaggaggggagaagaggggaaaaaggggggagagggaagaagagaagggaaagagaaaaaaaagaaagaaaaaagaaaggggaggaggaaaggaaggagggaaggggaaagaaaaggaagagaggaaaggaaaaggaggggaaggaaagaaaagggaaggaggggaagagaagaaaaagggaggggagagaaaggaagagaggaagaggaggggggagaaaagggggaaagagggaaaagagaaaaaagagaagaggagaaggaaaagggggagaagggaaggggaagaggaaagaaggaggggaagaagaaaagaaagggaaaaaaggaaggaagaagaagaggggaggaagggagaaaaagggagaggggagaggaagagaaagagaagagggggggaaggaagagaaggaaggaggagagaagggagggggagagagaaagaaggagggagaaaggggaggagaaaaaggagaagaaggggaaagaaaaaggagggagggaagggaaaagagaaggaaaaaaagagagaaaaggagggggaaagaaaagagggggaaggaagaaaggggaggagaagaaaagaaggggggaaagagggagagggagggggaggaaaaggagaaaggagggagaagagaaaaaaagggaaagaaagaagaggggaaagaaaagggaggggaagggggggggaggaggagaggaagaggagagaaaagagagaagagaagaggagggggagaaaaagggaaaaaaaagagaagaaaaggggagagaggaaaaaagaaggagggaaaggaaaggaaaaggagaagaaagagggaaaaggagaggaggaaggggaagaaaggaagagagaaaagggggagggaaaaaaggggaggaaagaggaaagaaaagaaaaaaagggaagagaagagagaaggagaagagagagaaggaagaaagagaggggagggaaaggggaagaaaagaaaaaagaggagaggaaggagaagaggagaggaggggaggaaggaggggggggaagaaggggggggggggaaggaaaaaaggaagaaaaggaaagaaggaaaaaaaagaggaggggaagagaaggggagagaaaggagaaagaaggaagggggggagggaaaggagggggaaaagagaaaagaaagaagggaggagaggaggaagagaagaagagagggaggaagagggagaagaaaagggaaagagggagaggggggaggaagaggaagggaaaaggagaagagaaaggagaggagaaggggaggggggagagggaaagagaaagagagaggaaaggaaggaaaaaaggggagaggggggagagaaggaggagggggagaggaggaagaaagggaggaggaaagaaggggagagaaaaagaaaggggagggggaaaaagaaaagaaaagggggagggggggagaaagggaaaaaagaggaaagaaagggagagaaagaggagagggagaagaggaaagaggggggaggaaagagggggaaggaaggaggagaaaagagagagagaaagaagaaaaaagggggaggggggggaaaggagaggaaggaggggaagaagaaagaagaagaaagggaggaaagagggaaagagagggggagaagaagaaagaaaggggaaaggagaaggagggagaggggggaagaggaaaaggaaggaagaggaaggaaaagaaagggaggagaaaaggaggagagaggggagaaaaaaaagaaggagggaaggaaggaagggggaagaagggaagaggaaaggaaaggggagagaggaggggagagaagagggaaagggagaggagagaaaaaagaagaggggaaagaaaaaggaagggggggggaggaaagggaggaaaagaagagggagagagagggagaggaaaggaaggaaaaagaagggagaaggggaggggagggagagaaggagggaaaagaagaaggagaaggggggggagaaaggagaggaaaggagaggaggaaggaaaaaggaggaggggaggaaggaggggaggaaaaaagaggagggagaaggagaaaaagggaagagagaaagaggggagggaaggagaagagaggagaaggaaggaagggaagagggaaagaagagggggaaagaaaggaagaaaggagggggaaaagagggaaaaaaagaggggagggaaaagaaagagaggggagagggagaaaaagagaaaaagagaaaggagaagaagaggggaaagggaggaaaaggaggaggaagggaaggagggaaggggaaggaaggaaaagggaaaagagagagggaaaagggggagaggggagaaaaagagagagaggggaagggagggaaaggggggaaggaaggagaaaaaaaagggggaaaaagaagaaagggaggggggaaaaaaggagaagaaaaggaggaaaggggagggaagggagagaaggagagggagagaaagggggggggaaaaaggaggaaagagggagagaaggggaaggggaagaagaaagaggggagggggagggaagaggagggaggagggggaaaaggggaaagaagggggaagagaagaggaaggagagggaaggggaagagagaaggaaaagggggaagagagaaaaggaaggaaagaggaaaggaaggaagaaggaggaggaaaggagagggagaagaaagaaaggaaagagggagagaaagggagaaggaggaggaagaagagaggaagggaagggggaaggagaggaaaaggaggaggagggggaaagggaaagaagaggaaggaaagaagaaagagagaagggagaggagaaggagagaaagaaaagagaaaagagggagagaaaagaggggagggaaagagaagaaggagaaagaggaggggaggagggaaaggaggaggaagaaggggaaaggggaagggaaggagggagagaagggagggaaaggaaagagaagaaaaaaaggagaaaggagaaagaggaagggggaaggaggagaggaaagagaagaaagaagaagagaagaaaaaaggggaaaaggggaaaagaggaaagaaagggaggggaaaaagaaagaaggaaagggaaggaggggggggagagagaaaaaaaaggaaggaaaggaagagaggggaaaaggaagaaagaagaaggggaaaggaggaaagaagagggagaggggaggagggggaaggaaggggaggagaaaagggggggaaaaggggaggaaggggaggaaggaaagggagaagggggaaagaaggaaggagagagaaaaaagagaagagaagagaagagggaggaaaggagagaaagaaagggaagaaagggaggaaaggaggggggggaggggagaagggaaaaagggaaagaaagagggaaaaaaggaggagaagagagagagaaggagggggagaggagaaggaagagggggaggagagagggggagggaggagggaagaggagaggaaggggaagggaggagggggaaaaggagagggggaggaagggggaaggaaggggaaagaaagaaaggagaaggggaaggaaaaaaaagaagagaaagggaagggaagaaagaggaaggagaagaaaggaaggagaggggaaggggaggggggagaaggggaggagaagaaaaagggaggggaagagaaggaagagaaaagggggggaagaaagagaaaagagaagaaaaagaggaaaggaaaaaaagggaaaagagaaaggaggggggggaagaaaaggaaagggaaaaagaggaagggaaagagaaaggaggagagagagagagaggggggaggggaagaagggaaaagagagagggggaaggaagggggaaaggagagggggggaaaaagggggaggagaagagagaagaaaaggaaggaagaaagaggaaggaaggggggaaagagaaaaaaagggaggaggaagagaagggggagagggagagaggaaagggaaagagaaaaggaaggggaagagggaggggagaaaggggggaaaagaaaggagaaggaggaaaggaaaaaggagaaagaaagaagggagggaaggagagagggaaggggagggaaggaaaaggaaaggggggaaaagaggaaaagaaaaaaagagaaggaaaaaaggaggagggggaaagagaaagaaagagagagagagaaaagggaagagggaaggggggaaggggagggagaaggaaaagaggaggaagaggagaggggaaggaggggaaagaaggagagaggaaaaggaaagaggagagagaaaaaaggaggaaaaaaggaaaagggagagaaaagaggggaggagggagggagaagaagagaggggggaaaagggaagaagaagagaaaaggagaaagaggaaaaggagagaagggagaagggaaagagggagaaagagagaaggaggaaaaggaaaaaaagggaaggaggggggagaaggaggagaaaaaagaaagaagaaaaggggagagagaaaggaaaaaggaagggaaggggggaagaaagggaaaaaaaagagaggagagagaagaagagggaaaaggggagaggaagggagaagaaagagaagggagggaggaagaagagggggaaagagaaagggggggagaaagggggagaaggagaagagggaaggaagagaggagaaaggggaaggaggggagagaggaggggagggggagggagagggaagagaaaaagaagggaggagaaaaaaagagaaggagaaaggaaggggagaagaaagaggagggagaagggaaaagagggaaagggggaaagggaaaagaaagagggggaaaaggggaaaagaggagagagaagaagagagagggagaaagaggagaaaaaaaggagagaaaggaaagaagaaggaggaagagggaaagggaggggaggagaagagagaagggaaaaggaaagaaggaaaaaaggaggagagggggaggggaagagggaaaaaaaggagagagaaagagagagggggggggaaaagaaggaaaagggggggggagggaaagaaaagagagggaggaggagagaggagaaagagaggggaaaaaggaagaggagaaggggagaggaggaaaggaaaaagagaggaaaggagagagagggggggaagagaggaagggagaaggagggaggaagagagaaaagggagaagggggaaagggggggagggaaaaaaaggggggagggggggaggagaaaaggaaagggggggagagagaaaggagggaaaaaggaaagggggaaaggaaggagggaaggggagaggaaggaagaggaggggagggggagagggaggaaaaggaaggaggggaggagggggaggaagagggggaagggagggagaaaaagaaaaaaaagaaaaaaaagaagggaggaggggaggggaaaaagggagggggggagggaaagggaaaaagggaaggggagaggaaaaggagggaaaaggagagggagggaagagaaagagaagagggggagggagaagggaaagagagaggagaggaagagaggggaagagaggagaaaaaaggaaggagagaaggaagaaggagggaagagaaaagaggggagagaaaggaagggaaaagaggggggggagggaggaaagagaagagagggagagagaggaagggggaaggaaagaggaaagggggggaaagggaggggggaggaaaagaagaaaaaagagaaaagggaaagaaagaagggaaggaaaagaagagaaaaaggggggaggaggagaaggaaggaaaaggaaggagagagaggagaggggagaagggaagagaagagaggagagaggaagagaagaaaggaggaaggagaggaaaggaggaagaggaggaagaagagggagagaaagaggggagaaaagaagaagaaaaagaggggagagggagaagagaagaaagagaaggaagggagagggagaagggggagagggggaaaggaaaaaaagagaaaaagggggaaggaagggaaaggagagaaagaaggagagagaaaaaaggaaagaagaaggaaaggaaaaggaaagagaaaagaaggggaaaaaagggggagaggagggagagggaagggagaaaggaaagggaaaaggggaaaaaagggaggggaggaaaagaggaggaaaaaaggaaaagagggagaagggggaaaaagggggaaggaaggaggaagggaaggagggaaaagggaagggagaaggaaagaagggggaggagaagagaggagaaaaaagaggaaggagagagaaaggaaaggggggaaggagaggaggggaaggggaggaaaagggaaaagaggaggaggaaagagaaaagggaaggaggaagagaaggagaggaaaggaggagaagaagaggggggggaggagaagagaaaaagaggggagagagggggaggagaaggagggaaaaggagagaagggagaaaaagagagagaagaggaggaagaaagaagaaagagaagagagaaggggaaggaggaaaagaggaaaaagagggagggagaaagggggagggggaaggagagggaggagaggaaaggagggaaagggagaagaggaagagagaagggaggagagaaagagaaagaaggggaaaaaaagggagaggaggagaggaggggagagaaggaggaagaggaaaggggaggaaaagggaaaaaaagaagaggagagagaaaaaaaaggaaagaagaaaaggaggaagaaaaggaagggaaaggaggaagaagaaaaggaagggaggaagaaaagaaaaaagaagaaaaggaaagggaagggaaaaaaaggaggaggagaaggagggggaagaggaaaggaaaaaagaagaagaggaaaggggaaaggagaaaaggggagggggaggaaaaaggggaaagggggagggaggaaaaaagaagaggggggagaaaggagggaggagggagagaggaaaagaaaggggagaaagagagggggagaggggaggaaagaaggggagaaggaggaagggaggagggaagaaagaagaaggggggggaaagaaagaaggggaggaaaagagaaggaagagaaggaaagggggaaggaaaagggaagggaaggggaaaagagaggagaagaggagaggagaggaagaaaggaggaagaggagagagagggaaggaggaggaagggggggaagaaaaaaagagagaggaaggaagagggaaaaaagaggagaaggaaaaaaagggaagaggaggagaggagggaaaagaaaaaaggggaaagaggaggaaggagaagggggagaaaagagaagaggagagggggagagggaaggaggagaagaaggagaggagggagggaaggaaaagaagagagaaagagggaagaaggggggggaggaggaggggagggagggagaaaaaagaagggaggaaagagagagggagaaggggaggagaggaggagaaagggaaggagagaagggaaaagggggggagggaaaggagaaggggaaaagaagggaaagaggggaaaaaagagaaaaagaaggaggaaaagggggaaagaaaaggaggggaagggaagaggaaaaagggaaagggggagaaggagggagaagaaggagagaaggaaaagggaaaggggagagaaagaggaaagagaaggaagggaggagagggagaagggagggaggaaagagaggaggggggagagaaaaggagaaagaggaaagaaaagaaagaggagaaaggaaggaggaggagagagaagggagggggagaaaaagagagaggggaagaaggagagaggaggaggaagagaggagagagagaagggagaaggaggaggagagaggaaggaggagggggaggggaggaggggggggggggggagaaagaggaagggaggggaaaaaaaagagaaggaaggggaggaggagaaggaggaaagagaagagaaagaagaaaaaaggggagaaggaaggaaagaaaaagaaggaagagaggagagggggagaggagggaaaggggaaaggagaaggggagggggagaaaaagaagaaaaagaaggaggggaaggggagggggaaaagaagaggggaaaaagaagggaaagagaagaaggagaggaaaggaaaggaaggagggaggaagggagggaagaaaggggaagaaggggaaggaggagaaaggaggggaagaggaagagagggggaaggagagaggggaaggagaagaagaagaaagaaaagaaaaaaaagaggaggaaaaaaaggagagaaggagaaagaagaggaggaggggaaaggaaaagggggagaaggaaagagggggggggggggggaggaggaagaaaaggggggggggagaaggggggagaggaggaggaagagggagaaaagagagaaaaaaaggaaaggggaaaaagagaggagaagaagggaaaggaggaaaagaggaggggaaggggaaaaaaggaggagaggagggaaaggaaaaaaaagaaggaaaggaggaggagagagaagaaagggagaggaaagggaaggggagagagaagaagggagaaaaggggagggaggaagagaagaaagagggagagaagggaggaggagaaaggaaaagagggggggagaagggaggaggggagggggaaggaggggaaagaaaaagggaaaagggaagggaaaaaaggagaaagggaaaagagaagggaagagaaaagggaaagggaaagaaggaaaaaaggggaggaaaaggaaaggggaggggaaggagggagaggaggggggagaaaagagagaaaggagggaaaagagggaaaaaggaaaagaagaaagagggagaaggaaggggagggaaagaagaaggggggaaaaaagggggaggaagaagaaaggaaaagaggagaagaggggaaaaaaaagggaaaagagagaaaagaaaggaggagaggggagaaaagaaaaagggaagggaaaggaaaagaagaagaaagagggagaaggggggaaagaggaggaaaaaaggaagggagggaagggggagagggagaagggggggagagaggaagaaaaagaaaaaaaagagaaagaagagggaaggagaagaaagagaaaaaaggaagaggggggagggaaagggggggaaaagaaaagagaggagaggaaggggggaaggaggaagaggaaagaagaagagaggggaagaaggaggggagagagaggaaaaagggaagagaaggagagaaaggaaaaaaagaagaggggaagagaagaagagagaaaaaagagagaagaggggaagagagggaagagaggaagaagggagaaaaagaagaagggaggagaagaagaaaagaagaaggaaagaaggaggaggggaaaggaggggggaagagggagagggggaggaaagaggaaggaaagagggagagggaaaggaagagagagggagggaggggggggggagagagaaaaagagaaggaagaaagggagaaagaggggaggaggaagggagagaggaggaggagaggaaaaggagggagaagaggagagaaaagggagaagagaggagggggagggggaaaagagggagaagaggaggagggaggggaaaaaggaaagaagaggaaaaagggggagagaaggaaggggggaaggaaagaagagaaaggggggaggagagaggagagggaggaagaggaaagagagagggagggaaggaaagggggggaaggggggggaaagagaggaaagaggggaagaagagagaaggaggaagagagggaagagggaaaaaagggaggggaaggaaaaagaaagaaggaaaaagggaggggaaaaggagagaaagggaaaagaaaggaggagaaaggaaaaaaaaagggagagaaaaggaagaaaaaggagggaagaaaaggagaaaggaaggaagggaagggagaagagaggaaggggaaaggaagagggaggggggaagggagaaaagaggggaagggagaggggagagaaagaaaagggggaaagaaaaaggaaggaaggagaggggaagaggaaaagagaagaaggagagagggggagaggaggggaagaaagaagaagaggggagggaaggggggggaaagagggagggaaagggagaaggagaaggaggagaagaaaggaggagagaggggagggagaaaaaaaaagaaggaggggaggaagaagaagaggagaagaggggagagggagaagagaagagggaagagaagaagaggagagggggagagaggaggagaaaagaaaagaaaaaagaaaggaaaggagaggaggaagaaaaggaaggaggggaagggaaaaggggggaaaagagaggagaaggaaaaaaaagaaggagaaaagaaggaaagagggagaaggagaaaggaggaggagagggagaaggggagaaaaagggaaggaagggaagggggaggggggaaaaagggaaaaaggaaaagagaggaggaaaagggggagaggggagaaaaaaggagaaaggggagaggaggaggaggggggaagaagaaaaaaaaaagaaggggaaaggagagagagggagggggaaaaaaaggagaaggaaaagagagaagaagaggagagggaggggaggagagagaaaggaaggaggagggaaaaaggagaaaagaagaggaaaagggaaaggaggggaagaaaggggggagggggaaggaagaggggagggaagggggaaggggggaaagagggaagaaggaagggagaagaaaagggaagagaaggagagaggaaaagggggagggagagagaagagggggaagaggaaaggagagaggaaggagaaggggaggaaaggaagagggaaaaagggaaagagggagagagaaggaggagggggagaaagaagagagaagggaaaaaggaggagaaaggaaaaagaggaagagagggaaaggggaggaggaggagaaaaagaggaggaagggagaggaggggagaagaaggaaagggaaggagagagaggggagaaaaaagaaggggggggagggaaaaaaggggaaaggagaggggaggggggagaggggaagaaaggggggaagagggaaagagaaaaggggaaagaagggagggaaaggagagaggagaaagaaaggagagaggagaagaagaaaggggaaaggaggggagaaaggagggaaaggaggaagaggagaaaaaaggagaaaagggggaagaaggagagaaggaaagggaaagagaaaagaaggaaagggaaggagagaggaaaaagggaaaaaaaagaagggaaaagaagagagggggaaaaggagagggaagaaggggaaaggggaaaagaagagggagagaagagggaaggaaaagaagagagaaaagaaagaagaagaaaagagggaaagagagagggggggaaaaaggaagggagaaagaaagaaggaagaggggagaaaagagaagaagggaagagagagggaaaggaaaaaagaaggaaagaagagggaagaaaggaagggggagagggaaagggagagagagggaaaagaagaaggaaaaaaggaagaaaaaagaggaagaagaaggggaagaggagaaaggaggaagggagaagagaggaggagagggaagggaagaggagagaggggagaagggagaaggaggagagggagaggaggaaaagaggggaagggaagggaagggaaaaaaggaagagaaggaggagaaaaaagaaaagggggaggaaggaagaaaggggggggggaggaaaaaaagagggggggaaagagaaaggggaaaaggggagggggggaaagagggaggggaaaagaaggaaaggaaaggagggggaagaaagaaagaagggaaaaaaaagaggaaaggaaaaaaggggaaaggaaaagaggaggggggaaagaaaaggaaagggagaaaaaggaagggaaaaagaaggaggaaaagggagagagaaagggaaggggaaggggggggaaaagagggagggaaggaagagggaaaggggaagggaaaaaaaagggggaaggaaagagaggagaaaagggaggaaaaaagagaaaggaaggggggaaaaagagaaaaagggaggaagggaagaaggggaagagggagaggggagagggaaaaagagaggaaaaaggaagagagggagaagaaaaggaaggagagaaaggaggaggggggaaagagaaaggaggagaaaggaggagagggaaggagggaggagagaaggggaaaggggaaagaaaggagaggaaaaagaaaaaggaaaaaagagaaaaaaagaaagaagaaaggggaagggaaaaaaggagggaaagagaaaagggaagagagagggggggggagggggggaaaggggaaggagggggaaaaggagagggggaggaggggagaaagagagagagggaaaggaaagaggggagagaggaaaggagagaagaaggggaggaaaagaaagagggggggggagagaggaagaagagaaaagggaagaagagggaaaaaaaggggaagaggggaaaggggaagaggagagaagagaaaaagggaggaggaagagagagggaagaaggagagggaaaaaaaagggaggggagggaagaagaaggagaaaaaaaagggaagaaaagaggggaaagaaaggaaaaaaggaggggagggggggggaaagggaaaagaagaagaaaagagggaaaagaggggaaagagggagaagaagggagaagaaagaggagaagagaaagaagaagagaggaaaagaagaagaagggggagaagggggaggagaagaaggagagaagaagagaggagaaaagagaaggaggagaaagaaaaagggagggggaaagagaggggagaaaaggagaagggaggagaaaagaagagaaagagaaagggaggggaggggaggggagaaggaggaaggaaaggagaaaagagaggggagggaggggaaagaaggaaaaaagggaaagagaggggaggggagaagggggggggaagaagaaagggaaaagagggaagaaagagaagaaggaaaaaggggagggaaagggaggggaggggaaaagaagaggggaaaggagaaaagggagggggagagagaggaggagggggggagagaaagagaggaaaggaaaggaaagagggggagggaagagaagaaaaagggaggaggagaggaggaagggagagggggggggagagagggggaggaaggggggaagaggaggagaggaagggaaggggaagaaagggagaaaagagggaaggaaagagggggggagagaagaagaaggggggaaggaggaggaagagagagaggggagaaaggggaaagggggggagagagaaaaaggggagaagaggagaggaaaaaaggaaaggaagaaagagggggaggaagaagaagggaaagaaggaaaggaagagaggaaagaaagaaaaagggagagaaggggagggggagagggaagaaggagaaggaggagagggggaagaggaaggggggggaaggagggagagagaaaaaaaaaagagagaaaggaagggaggaggggagggaagaaagggaaggagggggggaaagggagaaaaaagaagggaggggaaaaggggggagaaaaaaaggggggagagaggaagggaagaagggaggggaaaagggggagaaagaggagagggagaaaggggaagagaagagaaaaagggaaggagagaagaaagaaagggggagggaggaaagggggggaaaaagaaaggagaaggaggggggggagggaggaagggggagagaggaagagaagggaggggggaagaaaagaggagagggggggaagagaagggggggggaaaagaagaggggaggaagagggaagagaaagaaagaaaaagaagaaagaggagaagggggaaggagaaagaagaagggaaaaaaaggagagggagagggggggaggaaaaaagggaggggaagaaaggggagaagaaggaaggaaaagggagggaaagaaagaaagaggaggagagggagggagagaaggaggggagaaaagaggaagagaaagagggggaagggagaaaaaaagaaaaaaaaggaaagaggggggagaaggggaagagggggagagggagaaaagagaaaaggggaaaagggagggaaaggggagaaaggaggaaagaaaagagaagaaagaagaagaaaagaaaaaggaaaggggaaagaaggaaaagagagaaagaggagagagggagggagggggggaaggagagggaaaagggaaaaagggggggaggggaaaaaggagaggaaaaagggaaaaggggaagaggaggggggaggggagaaagagggagagaaagaaggaggaagagggggagggagaaggaggggagaaggaggagaggagaggaggaaaaaggagaaggagggaggaaggaaaagagggaaggaggggaggggaaggggagggaaggaaaaaagaaaaggagaaaagagaagaaggaagagggaagaggaagaaaggggaagaagaaagaaaaaggggggaaaggagaaggaaaagagaggggggagaaggggaggagaaaagagaaaagagggagaagggaaagagagagagggaagagaaggaaaaaaaaagaaggaggagagagaagggaagggagaaaaaaagggaaaaaggggagaaagaaaggggggggaagaaggaaagggaggaaaggaagagagggagaaggaaaagaagaggggagaagggggaagagaaagggaagggaaaggagaaagaaaaagaagaagggagaaagggaggaaaggaaggaggggaaaaaggaagagaaaggaaaaagaggaaaagggaaagaagagaagggggagaggaaaaagaggaaaaaaagggaggggaagaggggagaaggagaagaagagaaggaggaaagaaaaagaaggggagagagaagagggggaaaaaaaggaggagaggaaaggagaggaaaggaaaaggaaaaaagaagaggaggggaaggaaaaagggaaaaaggaaggagggggaaagaggaaagaggaaggagaaagaagaaaaaaaaagagagaaaaaggggaggaaaagaaggggggagaagaggggagagaaaaagaagggaagaagagaagagagaaggaaaggagggggggaagaggaaagagagaaggggaaggggaggaggagaagaaaggaagggaaaagggggagagaaggaggaaagaagggaagaaggaaggagggaaggggagaagagaggaaaggaggagaggaaaagaaaaaaggaaggagaagaaaaagaaggaaggagggagaaggggggaaaggggggaagagaggagggagaagaggggaaaaagagaagaggaagaagaagggagggggaggggaagagggagaagaaaaaaggggaggaaggagaaggggggggagaaggagagggaaagagggaaggaggggggggagagaggagaggaaagagggaagggagggaaggaaaagaggggagaaaaagggaagaagaaagaggaggaggaagagagagaaggaggggaaagaagggaggaaggagagggggaagaggagggggggggaagaaaaggaaaagaaaagaaggaaagggaggggaagggagaggagaaggggaaaggaagggaaggaagggaaagaaggggaaaagaagaaggaggaagaagggaggaaaagaagggaagggaaaaaaaaaaagggaagaggggagaagggggaagaaggggaagagaaagaaaaaggaaaggggagagagagaggagagggaaggaaggaaggagagaaagaaaggagagaggggagagaaaagggggaggaaaaggggggaaagagagaagaaaaaaaagagaagaaaggaggaaggggggaggagaaaggaaggagggaagaagagagaagggaagaaggagagaagaggggggagaggggaaagaaaggagagaggaggaggaggggggaggagggaggagaaggaaagggagagaaggggggggagaaggaagagagagagagaggagaaaagaaaggaggaaggggaggagaagaaggaggagagaagagaaaaggaagaaaaaaggagggaagagaggagagaggaagaaggaagaggggagaggggaagggaagggaaggaggaaagaagaagaggaggaggagaaaaagagggggaaaaaagagaggaaggggggaagggaaagagggaggaaaaaagaagggaaagagaggagagggagaagaggggaggggagggggaggaaagaagagaaaaaaggagaagaagaggagggaggaaaaaggaaagggagaggaagagaggaagagagaggggggaaaggaaaaggaaggagagaggaaagaaggaaaagaggaggaaaaaaaagagagagaaagagagaagaagagggagagagagaagaaaggagagggggagggaggggagggggggaaggggaggaagaaaagagggggggaggaggaggggaaaagagaaaggagaaagaaaagagagagaaaaaaaagagggggggggaagaaggggaaagaagagagaagagggaaaaaaggggaaaaaggaaagaagaggggagggaggggaaaagaaaaaaaagaagggaagggggaggagagagaagaaagagggaggaaaaggaagggaagagagaagaagggagaaaggaagagggagaaagagaggaaagaggaaaggggaaggggaggaaaaagggaaagaggggaggagaaaagaggaggggggaagaaaagggagggaagaaaaggggaaaaaaaaggggggaaaaggagaaagggaaagaggaggggaagagaaaggagggaggaaaaagggggaaaaaggggagaaaaaggagaagggagagagagaaaaggggggaggggaaagagaagaggaaaaggagggaaaagaaggaaaaaaaaagagaagagagaggaagaaagaggagaggagaaggaaaaaggagagaaaaaaaagggagggagaagagaggaagaaaagaggaggggggagaaagaggggaagggagggaagggaaagaagaggaggggagggaagaaaaaggggaggagggaagaaagaagaagaaaaagggagaggagggaaaagaggagggaaaggggggggagaggggaggggaaagggagagaggggggagggggggagaaggaggaagaagagagaagaaagggggaaagggggaaaaaggagaaaggggaggaggaggggagagggggggggagagggaaggggagaagggaaaagggggaggggggaagaagaaagaagaaaaaagaaggggaaggaagggagagaggggggagagggaaaagaggaaggggaagggaaagaaaaagagaagaggagaagaagagagaaaaaaaagagaagaggggaaaagggggaagaaagaaagaaggaaaggaaagagaaaggaaaagggaaaagaaagggaaaaagaaaaaaggagggagggagaggagggggggagagggaaagagggaggaaaggaagaggaaagggagaggggaagaaaaagagaaaggaaagaaagggggggagagaaagagaaaaggaaagaagaaaaggagaaagaagggaaaaggaaagaagagaggaagagaggagagaaaggagggagaagaagggagaaaagagagaggagagggggggaaggaggaaaggaggggagagagaaaaggggaggggaaaaaaaaaagaaagggaagaaggaggagagggggaaggggggagagaaaaaagagaaagaaaggaggagagagaagagggagggaaaggaaagagagggggagggaaagagagggggaggagggggaagaaaaagaggagagagaggagagagagagaggggggaagaaggaggagggggaaaagagggaaggggaggaaaaagaaggaaagagaaagggaggggaaaaagagaggaaggggaggaaaagggggggagaaagaaaaggaaaagaggggagggagaaaagaaagaagaaagaagaggggaagggaaggaagaggagggaggagggagggaggagaagaggggaggggggggggaagagaagaaagaagggagaggggagaggagaggaggaagagaaagagagggagggggagaaaagagagaggaagaggaaaggagggagagaaaagaggggagggagaggaaaagagggaagaagaggagggaaaaggagggaggaaaagagagagaaggggggaaagagaagaaagagaagagagggagaggggaggagaagaaagaaagaaagagagagaaagggaaaaagaagggggggagaggagagaggaagaagagaaggggaaagagaaggaaagaagaaggggaaagagagggaagaaagaaaagaaaaaagaaagaaaaggaaaagaaaaagaaaaagaaagaggggaaggaaaaaagaaggaaaggagaggaaaagggaagaaaggaaggagaaaagaagaaaagaggggggaggagaaagaaggaagagagggagaaggggagaaaaaaggaaggagaaggaggggaaggaaggagaagggaaggaaagaggagaggggaagaaagggaagagggaaagaagaaaagagaaagagggagaaaaagaggggaaggaaagaagaaaaaaagaagaaagaggaaggagggagaggggagggaaaaaagaggaggaagagaagaaagaagaagagaaggggggagggaagagagagaagaggaggagaaagggagaaggaaaaaggaaaaggaagagggaagagaggggaagaggagggggaggaaaaagaagagggggagggagaggaaaaggaggggagaagagaaggaggaagagaggagagagagaaaaagaggggggggggaaggggaggaggaaaaagggagaggaagaaggaaaaaggagagaggagagaaaaggggagaaaaagaaaagagaaagagaaaaggagagagagggaagaggggggggaaaagagaagagagaagggagaaaggaggaaaaaggaggaaaaagaagaaagggaaaagggggaagggaaagaagaagagaaggaagggagagaaggggaagaaagggaaggggagggaaagggagagaaaaaaagagaaaagggaagagggaagagaaaggaaaagaggagggagagggaggaagggaaaaaggggaagaaggagaaaagagggaagaggaagaaaaaaaggaggaggggaaggggaagaggggaaaaggaaggagggagaaaaaaggaggggggggaagaaggaaaggaggggaggaaaagggagagaagggaagaaagggaggggagggagagaaggaaggggagggagaaaggaagggaagaaaagaagaaaagaagagaggaaaaaagggaggggaaaagaggagaaggggaaaagggaaggaaagaaagaggaagaggagaagaaaagggaagaaagagggaagaaaaaagaaagagaaaaggagaaagaagaaaagaaggaaagagagagggggagaaaaaggagggaaggaggggagaagggagaggggagaaaagagaagaaggggaagaaaagggaaaagagagggaggggaaggaggagggaagaaagggaggaggagagaaaaagggagggggaggaaagaggaagagggggaaaagaaggagaaagaggaagaaaaaggggaaggggaagaaggaggaaggaagagggaagaaaaagaaggaaaggagagaaaaggagggaaaagggaagaaggaagagagagagagaaggaaaagagagaagaagaagggaagagggaaaagaaagagaaggaggaggaaaaaaaaaagggggaggaaggaaggagggggggaagaaggaaaaagggaggggggagaagagaaaggaaaagaaaggaaggagggaaagggagaggggggaagaggggaaggagggaaaggggagggagagaaggagggaaaaaaaggaggaaaggaaaaaagggaagagagaaagaagagggaggaaaaaaggggagagggagagaaagagagggagaaggaagaagaaaagaggaaaggaaaaaagaaggggggggggggggaaaagggggaggaaagaaagagggaaaaggaaagggaaagaaggaggaaaaggaaagagagggaaggaggggggagaaaaaggaaggaaaggggagaaaaagaggaagaaggagggagggaaggaagggaaaagaaaaaggggagaggagagaggagagaaagaaagaagaaaggaagagaaagagaaaggagagaaaggaggaggggggaaaaggaaaaggggagagggagggaagagggagaaagggagagaaaaagggaaaagggaaagaaaagaaaggaagaagagaaaggaaaaaaggaaaaaaaagagaggaggaaaaggaaagaaaaaagggaggaaagaagaaaaggggggagaaagagggggggaggggagagaaggggagggggaggggaaagaggggggagagagagagaggaggagaggaggaggagggaagaaagggagaaggggaaagggagaagagggggagaaaaagagagagggggggggggagagaaaagagagagaggggaagaggaaggaaaaaaagaggaggaaagaagaagaaaggaaggaaggggagaaagaaagaggagaaggagagagggaagagggagggggaaaagaaagagaggggaaggaagaggaagggggaaaaaagggggagaagagaaggaaaaaaaaaaaaaaaagggggggaaaaagaggaagggggaaggggagaagaaaagagggagaggagaggaaagagaggaaagaggagggaggaaagaggagaagaaagaggggagaagaggagaaggagaagaaaagggagaagggggaggaaagaaaggagaggaaggaagagaagaagagagaaggggaagaaaaaaaaaagaggaaagaaaggggaggggggaaaggagagggaaggaggaaggaagggagagaaggaaggggggaaagggaggagaaaaaggggaaggagaggaaaaaagagagaggagagaggggaaaaaaggaaagaggggaaagagaggggaaggggggaagagggaggaagaagaaaggggaaagagggagggaagagaagggggaaagaaggaggggaaggggagaggagggaggaaaaagagggggaaaaggaagggagagggggagaaggaggagaagaggggaagagagagagaaaaaaggaaaggaaagggggggaaaggagagaaaaagagaagaaaaagggaggagaaagggaaagaaggggagagagagggggagaaagagaagaagaaagggagagggggagaagggaaagagagagagagaaaggagagggaagaagggggggagagaaagaaaggaagagaaggagaaggaggagggagagggggagaagggaaaagggggagaaagagaagagggggagaagaggaagggaaagaaagaaaagaagaagaaggggggggaagaggaggagaaagaagaagggaaaaagaggagaaaaagaaaaagggagagagggggaggagggggagggagagggaaaaggaggagggggaaaaggaaggggggaaggaagaaagaagagagaagaaagagaaagaggaagaaagggagaaggggagggaaggagagaaaaaaagggggaaaggggggggaaaagaagggaggagagaggagaggagaaaaaaaagggggagaggaggaggaaggaagggagaaaaagaagaggagaaggaggagagagagaaaaaagaagggaaggagagaagagagggaaaaaaaaaagagagggagagggaggaaagggaggggaaaggaaagaagaagaaggggagaaagggaggaggggggagagggaaaaagaaggaagaggggagaaaagaagggggggagggagagagaagagaagggaaagaggagaggggaagaagagggaagagaagggaagaagaaggggaaggaggagaggggggaaggagagaggaggagaggggaaagaaagaggaagagggaagaaaggaaagggggagggaaagaaaggggagaaggagggagggaaggggagggaaagaaagaaaggggaaaggagggagagagagggggggaaaagaggggggggggagaagaaggaagaaaggaaaaagaaaaaagaaagagaaaagagagaggggaagaggaagaagggaggggggaggagaggggggggaagaagagaggaggagagggaaaagaagaggaaagaagggagaaaaaaaaaggagagaagagaaaaggagggggaggaaggaaaaagagggaaaagggagggagggagagggggggaggaggggagggaggagagaaagagggggggaaaggaaaaaggagaaaagagaggaggaaagggaggaggaggggggaggaaaaaaagagggagagaaagaaagaagaggagggaggagggggggaggggggaaaggaagggagggaaggaggaaaaaggagaagaagggaggaagggaaagagggaaagggggaagagagaggggaagggaggaaaaaaggaaaggagaaaggggaggaaggaaaaggagggaagaaggagggggaagaaggaagaaaagggggagaagggaggaggagaaggagaaagggagaaaaagaaaagaaaagagaaaagaggaaagagggaaagagaggaaaggagagaagggaaaggaaaagagggaggaggaaagaaggaaggagaagggaaagagaaaaaggaaggaaagaagggggaggaaaaagggaaaagaagaaaagagggaggaggagaaggaagaaaaggggggaggaggggaaagagaaaggagagggaaaaagggaagaaaaaggagaaggggaaaaaaggggaagggaaagggggaagaaaaagagagaaaagagagagaggaagagggaaaggagaggagagggaaggggaggagagaaaaagaagggggaaggggaggggggagagagaaaaagaaaaagagggaaaaaaaggaagaggggagagaaaagggggagaaagagggggggagggaaggagaagaaagaagagggagagaagaagaggagaggaagaaggaagggaaaaaggaaggaggggggaaggggaaagaaaaaggaaaaagaagaagaaaaaagagaggaagagaggaagaaaaaaaggggaaggaaaaggggaaaaaaaaaaaaaggaaggagagaagaggagaggaaaagaaagaaggaaaaggaaagagaggagggaaggaggaaaaggaaaagaggagaaggaagggaggggagagaagggaaagaaaagggaaggaggaaagagggaagagaaggggggaagaagggaggagggagaaagaaaggaggaaggagaaagaaaaggaagaggaagggagaaagagagaaaggggggaagaaaagagggagaagaggggaaaaggaaaaaaggagggaggaggaggagaaagggggaaagagagaagaggggagggggggaaagaaagggagggggagaagaggagagaaagagagagggagggggagaagaggggagagggaagaaggaaagagggggaaaaaaaaaggggagagaaagggaggaggaaagagaggaagaaaaaagaaagaggaagggagggaagggaggaggggaggggaagagaggagggagagggaaagaaagaaaaagagaagggagaaggggagagaaaaagggaggagaaggaggaggaaagggaagagaagggagggaagagaaaggaagaaagggggagaagggaggagaaggagggagggaaaaaaagaaaaaggaggagggaggggaagggagggaggggaggagaaagaaaaaggaaggggaagaaggagaggagagggaagaagagaaagagagaagggaaggagaggagggagagaaaagggagagaaagagggaggaaggaaagagaaaggaaaagaaaggaagagggaaaaggaggaggggaaagagaaaaagagaggggaaagaaggaaagaggaagaaaagaagggggggagggaaaagaaaggaaagaagagggggaggggggagaggagagggaaaggaaagggaaaaaagaaagaagagagggaaaagagagagagaggggaagagaagggagggaaggaaagagaaggagaaggaggggagggaagagaaagaaaggagaaggagaaagaggggagagggagggaaaaggggaaagaagggaagggaggggaggaaggaaggaaaaagagggagaggagaaaagaggagggaaagaagaaagagaggaaggaagggggagggagagaaaaaaagagaagagagagagaagaaggagaagagggggagggaggaaaagagaagaagaaaaaagagaagaagagaaggagggaaaaagaggagaaggggggggaaaaggggaagggagaagagggaaaggagaaggagggagagaaggaaggagggaaaagggagagagaaggaaagaaagaaaaagggggggagagggagagggggaagaaaagagagggagggggggggaaaggaagaaaaggagagaagggaggaagggaagagaaggaggggaaaagggagaagagaaaaaaaagagaaagggaaaaaagaggagggggggaggaggggaaggaggagaggaaagggaagaaagggaaagaagaaaggaagaggggagggaggagaaaaggaaaagaagagagggagggagaaggggaaaaaaaaaaaggaaggaaaaagaaaaaaagagaggagagggaaagaagaaaaagagagagaaagagaagagaggagaggggaaagagaggaagagggggaagaggggagggggaaaaagagagggggaagaggagggagggaaagaaaggagaaagaaaagagggggaaaggggaaggggaaagagggggggaagagaaaggagggaggaaaaaggaaggagaaaaggaaagaaaggaggaggaaaagagggaaaaagaggaaggagaaagaggggaagaaagaaaagaaaagaaaggaggaaaaaaggaaggagaagagaagaaaggggaaagaagaaggaaaaagaagagaaagaaaagggggggagaagagaggaagaaaagaggaggggggagagggggaaaaggggggggaaggagaagaagaggagggaggggaggaaaaagaagggaagggaagggaaagagaaggaaagaaagggaagagaaaagagaagaggagggaaggggagaggggaaggggaaaggggagaagggaggggagaagagaaggaggaggaagagagaagaaggggggggagggggaaagagaagaagggggaggagaagagaaaagggagggggaggggggagggggaagaggaggagggggagaggggaagaagaaaaggaaaaaaaaaagggggaggaaagaaaagaggagggagggaaggagggggaaggggaaaggagaggaaaaagaaaaaggagggaaagagaaaggaaaaaggggaaaggggaaaaagaaaaagaaggaaaaagggaaagggaagagagggaagaagagaaaaggaagaggagaagagaaaagaggagagggagaagggggggggggaaggaaggaaaaagaaggagaagaagaaagggagaggagaaggaagagaggagggaaagaaaggagggaaaggaaaaagaaaaggaaagaggagaaaggggagaaaggaaaaaagagagaagagaagaaaaaagaggagaaggaaggaaaaaaaagggggaaaagagagaggggaaggggaaaggaaaggaaggaggggagggggaaaagggaaaaggaaagaaaagagagagggaagaaggaaagagggggagaggagagagagaaaaaagaagaagaaagaaggggggagaagaaggggagaaaaggaaggggagaggaggggaagagagggagaagaaagggaaggaaaagggaggaagaaggggagagggagggaggagagaaaggagggggaaagaaagagaaaaggggaggaaaaaggaggaaagggaagaggaagggagaaagagaggaagggggggaaagagggagaagaaagaggaggaaaagaagggaggaagaagagagagaagaaggaaggggggaagaaagggaggaagagggaagagggaaggaagaagagaagggaggagggggaagaaaagagaaaagagagagaagggaaagggaggggggaggagaaagggggggagggggagaaaaaaaagaagaaaaggaaaggaaggagagagagggggagagagaagggaaaaaaggggaaaggaagagggaaagaaaaggaagagaagaaaaaagagggggagaaagaaggaaagaaaaaggaaggagaggggaagagaagaaggaaaggaaaagagaaaaagagagaaggaaaggagggaggagagggaggaggaagaggaggggaggaaaaagggaagaaaaaagggaaggagagagaagagagaagagaaaaaagaaagaaaggggagagaaagggagagagggagggaagaaagagggaagaaggaaaggagagaaaaagggaagaaaggaagaagaaagaaagaagagaaggggggggagggggagggaagagaggaagagggggaggggaaaggaagaagaaaggaggaaaggaaagagaagggaagggaaaaggagaggagaagagagagaaaaggaaaagaagaaaagagaaagagagggaaagagaggggaaaaaaggaagaagagaggaggaaaaaaggaggaggaaggagagagagaaaggagggaaggaaggggaagaagaaaaaggaaaggaaggagggaaaaagaaggagaggaggagaaagggagaaaagaaaggagaaaggaaggaaaaagagaaggaaagaggagaggggggaaaaaaaagagaagaagggagagaaaagggagaagagaggagaaggaggaggagagggaagagaaaaaaaaaggggagggggaaggggaggaggaaaaagggggaggaagggagaaagaagagaaaggagaagaagagggaaagagaaagaagagaaagggaaaagaagagggaagggaaagaggggggagaagaaaaaagaaaagagaggaagaaggaaaagagagggaagagaaaaaaggggaaagggggaagggaaggaagaggagaaggaagggagaaaaagaaaaggaagagaaggagaggaaaggggagaaaaaaaagggagaaaagaaagagagaagaggaagaggaagaggagaaggagagaggaaagaagaaaggggaaaaaggaaaaagaaaggaagagggagaagaaagggaggaagggaagaggaaggggggaaaaggaaggagggagaaaaaaagaggagggagaaaaaggaaaggaggggggggaaaaggagagaaggaaagaaagagaggggaggggggagaggaaggagagggggaaggaggaggagaaaaagagaaaaagaagagaggaaagggggaaggagaggaaagggagaggagagaagggagggaaggggaaaagaggagaaggaaagagagggagaaagagagaagaaggaaggaagagaaaaggggaaaaaaagagaaaaagaaggagaagaggggagagaaagaaggaaaagggaggaaaggagagagaggggaaagaggaagaaaggggagaaaaaaggaaagagagggagggaaaggagggaggaagaaggggagaaagaggaaaaaagggaaggggaggagggagggagaagggggagaaaaggagaagagagagaggaaaggggaagggaaaggaagaggaaaaaggagggaggaaaagaaagaaaagaggagaagaggaggaaaaagaaaggaaaaaagagagaaaaagaaaggaaagaaaaaggaagaaagaaagagggaagaaaaagaaaaggaagaggaagggagaagaggggaagaaagggagagggggggaagaaggagaaagggagaggaaagaagaaaaaagaaaaggaaggaaggaggggggggaagagggaggagggggaggagaggggaaagagaggggggagaggggggagaagaaagagaagaaaggggagagaaaagagagaaagaagaaggaggaggaaaggggggagggagagaaaaaggaaagggagagggaagaagagagagagggagaaaagagaagaggagggagggagaagggggaagagaaaagaaaaaagaaggaaaaggaaagagggaggaagaagagggaaggggaaggggaggaaggagagagaaagaagagaagaagagaggagggagaaagaaagaaggaaggaagagagaaaaagaaggagggaaaagggaggagggaaagaaaaggggaaggaaaagaaggaaaaaagagggaaaaagggggggagggaaaggaggaagggggagggagggaagaagggaagagggaaagaaaaagagaagaaggaaaagggagaaaaggggaggagagaagagaagaggaggaaagggggaggaggaaaaggaaagaggaagggaaagaaagaagagggaagggaggaaggagggaaggagaagaaagagggagaggggaagagggagaagggggaaggaagagagaggaggaagggagaaggggggaagagaggaaaaagggggaaggaaggggagaaggggaaaaagagggagggagaggaggaaagaaaagggagagaggaaaaggggaaagggaaaaggaggaggaaagaagaagaaggggaggaagggaaagaggaaaggggagaaggagaagagaggaaggaaggggaagaggagaaagaaaggaaggaagagaaagagaggaaaaagggggagggggaaaagagaaaaagaagggagaaggaggggaaaagaggagggagggaggggggagggaaaggaggggaggagaggggggagaggaaaagggaagggggaggagagaaaagaaagaaggaagagaaaaaggaggagagaaaaagagagaaaggagaagaaagagaggagaggaaggaaaaaaggaagaaaggagagaaaggagaaaagaagagaaaaggaaagggagaggagaaggggaggagagagaagggggagagaagagaagggagggaaaaaagggaggagaagaaagggaaagagagggaaagggaaaaaggaaagggggggaaaaaagaaaggggaaaaagaaggggggagaggagaagagagagaaaggggaaagaggagggaaagagaggaaagaaaggaggaagaaggagaagggggaagaaaggaagaggaaaaagggggggaaaagggaggaagagggggagaaggagaagaagagaggaggaaggaggggaaaaaggagagggaagggggggaaaggggggagaaagagaagaaaaagggaagagaagggggaaaaagaagaagaagaaagagagaaagaaaaggggaaagggagagggggaaaagggagagaggaagggagagagaagagaagagagagaggggaaggaaagaaggaaagaggaggagaagaagggagaggagaaagaggaaggaggaggagaaggaagagaagggaaggaggagagaaagaagaaggaagagaagaaaaagagggggggaggaaagggggaaaggaaaaagggaaaaaagaagggaaaaggaaagggagagaaagaagaaagaaagagagggaaggggaaggaggagagggggaaaaagaaggggggaaagaagaaagagaggaggaggaagaggaagagggagaaaaagggaggagaaaagaaggggagagaaaaagggggagggagagggggaaaggaaagaagaaagaggagaggagaaaaaaaagagaaagaagagggagaggggagggagaaagaggagagggagagaaggaaggagaaaagaaagggaggaaggaggggggaggggaaaaaaaaaaagggaagaaaagggagggaagagaggggaaggaaggaaaggggagaaaaaaaaaaagagaaggagggaggggaaagaaggaggaggaggaaggaagggaagagggggagggagggaaagaagaagggaggggagggagggggagaagagagaggggaagggaagaagaaggggaaggaagggggggagaaagggaagaggagggaaggggaaggaagagggaagagggaaaaaaggaaagggggggagaaaagagagagggaagggaggaaggaagggggagaagggaagaaggggaaaaaggagggaaaaagaagggagaaaaaggggggggaggaggaggaaaaaagagagggaaaagaagagggagaggaaggagagagagggaagaagaaaggagaaaggggggggggggggagggggaagaagggaggagagggaagaaaaggagaaagaggaaggggggaagagaggagagaggggaggggaagagggagaggaggaaaaaggaggaaaaagggaaggaggaaaagggggagagggagggaaggagggaagagaggggaaagaaaaggaaaagggaagaaggggaggaggagagaaagaaggaagaggggggaaaaaaaagggaggagaaagagagaagaggggagaggagggagggagggaggaaagaaaagaagggaggggggaagggagagaagagaggggggagggaaagaaagaaaagaggaagagagaagaagaaggagaaagaaaagaagaggaaaggagaagggagaggaagaagggaagaaggaggaggaaggaagaggagaagaggaaaaagaagaggggaggaggagaaaagggaaaaaaaaaaaaggaagaaagaagaagagagaagggaaggggagagaggagagaagggaaagggaggggggggagaggaaagaagaagggagaagggaaggagaaggaggaaggaaaaaggaaaaaggaaaaagggaagagaaaaaaggagggaagaaaagaaaaaaggagaaggagaaggaagggaaaaagagaggagggaggaaaagggaaggaaaaagaagaggagaaaaaaggagagggaaaagggggaggaaaaagagggagaagggggagagggagaaggaaaggggaggagagggaaggaggggagggaagaaggaagggaaaggggagaagggggagggaaaaggaagaaggaggggaagaaggaggaggggagggaaaagggaaggagggagggaggaagagaaggaaaaaaaagaagggaaagggagaagaagaggagggaaaaggaaggggagaaggaaggagaggagagggaaaaggaaaaaagaaagaggaggagaaaagaaaaaggaggggagaaagaagaaaaggggaaggggagggggaagagggaaagaagaagggaaaggaaaggagaggaagaggaagaaggaaaaaaaaaaggaggggggagggagaaaaaggaagagaggagaaggaggggaggggagggaggggaagggaaaaaggagggggaaagagagaggaaaagggggaaaagaggggaaggggagaaagagagggagaaggaaaaagagaaagaaaggaaaaagaaagaaagagaaagggggggggaagagaaggaaggaggaggaggggaaaaaaaggagggagggagaggagaaaaagggaagaaggggggaggggagagggggagaggaaggaagagggaaaagaggagagaggggaagagggaaggggaaaggaaggaggaggggaagagaagaaaggaagaaaaaaaaagagggggggaaaaaaggagaaaagagaggaggaaaaaagaaagaagaagggaggggggaagaagggggagagaaagagaggaggaagaggagaagaaagaaaaggagaggggagaagggaaaaaaaaaaaggagggaaagaaggaggaaggagaagagaaagggggggagagggagggagagaaggggaaaaaggaagagaaagaaggagagagaagaagggagagaaggagggagaggaagggaggggggggaggaaggaaaaagagaaggaagagggagggaaaaagaagaaggaagaaaaagagggaagggaaaagaaggagggggaagaaggagagagaaagaggaagaaagaaaagggagaggagggggaagggagagggaaaaagaggagagaggagagaaaaagaggggggaaagaaaaagggagaagagaaaagaagggggggaggaaagagaaaggaaaaagggagaagaagggaagaggaagaagaaaaagaagggaaaaaaaaaaaaaaagagagggagaagggaagaagaggaagaggagaggaaggaagagagggaaggggaaagaggggaggaaagggaaaaggaggggaaggagaaaggaaggggggggaaggaaagagagaagaaaaggagggaagaaagggaagggaggagaaaaagagaaaagaaagaggaggaggggaagaagaaagaggaaaagaaagagggaaggagagaagagaagggaagagaaaaggaagaagggaaggagagggagggaagaaagaaggaaaaaaagaaggagaaagaaggaagaggaagaaaagaggagaaaagggggaaaaaagagaaaggaggagaggaaagggagaggggggggagggaggggggagggaaaagaagaagggaaggaagaaaggaaaagggaggggaaggagagaagggaaggggaagaaaaggaagggaggggaaaggaagaaaaggagaggagggggaaagaaaagagagggaaggagagaaggagaagaaaaaagaggggaaaaagggagaaaggggagaggggggagaggagaagaggaaggggaaaaagaggaaaggaaaaggagaagggaggaagaaaaggaggaggggagggaaaggggggaaggaaggaggaggagaaaagaaggaaagagggggaaagagaaaagagaaggagagggagaggagaaaaaaaggaaggagaggaaggaagaagagaggaaagaaaaagagagagggaggaagaaagagggaaaagaagagggggaagaggaggaaaagggagggggaagaaagaaaggaaaggggagaggaagggggggagagaggggaagaaaaagggaggggagaaaaaggaaggagggaaaagaagaggaggggaggaaaaaagggagaaagagaaagaaaaagaaggggaagagggaagaaagaggagagggggggaaagggagggaggagaaaagggaggggaaagaaaaggaaaaaaaaagaagaagagaaggagaagagaggggagagaggagaggagaagaaaaagagggggaaaggggggggagaggaggggaaaagagagaaggggggaggaagaaagggaagggaaggggaagaggagggagaaaggggaagagaagaaggaaaaggagggaaggagagaggggaaaaagaaaggggggaaaagaagggagaagggaggggagggggggaaaggagaggagagaggaagaggagagagaggaaggagggagagaaaagaaagggaaaaggaggggaggggggagaagagaaggaagaggagaagagaagaaaagaaggaagaaaaaaaaggaggaaaaaaaaaaaaggaaggggggaaggaggggaagggaggaaggggggggagaagaaaaggagaggaaaagagagggaagagggaggaaggaaaaaaagaaagggaagaaaaaggggagaggggagggaggaaagaagagaagaaggagaggaggagagaaagaaggagaaagaggaggggaaagggagaaagagaaaaaagaaggagaaggaaaggggaagaggagagggaagagaagaggaaaagaaaaaagagaaagggagagggagagagaagggaaggaaggggggaaaagagaaaaaagagaggaagaagaaaaagagaagaaggagggaaagaagaagggaggaaaagagagggggagggaaaagaaaaagggggaggggaggggaaaaagaaaaaaagagggaaaggggggagaagggagggaaagagagggagaagagaaagaggagaagggagaaaaaagaagggagaaaaaggaaggaagaagaggggagagagagagggaggaggggggaaaaagaaaaaaaagggaagagaaggaagaaaaggaggagggaggaggagggaaagaagggagaaagggagagaaaaagaggaggagggagggaaaagggaagaggaagaaagagaaaaaaggagaaggggaaggaaggagaaggaaggggagggaaagaagaggggaagaagagagaaaagaggggggggaggaagaaaggaaggaaggaaaaaggaggaaaggagaagggaagggaaaagagagaagaaaagagaggagaaagggaaagagaagagaggggggaggagaaaagggagggggaaggaaaaaaaaagaagggaaagaaggggaggagaaagagagagaaagagaagggaaggaagggggaggaaagaggaaaagaaaagaaagagaggaagaaaggggaggaggaagaggaaaaaaaagagggaagagaagggaagagaagaaggaagggggaagaagaaaagaaggaagaaaagaaggggggagaagaaagaggaagagggggaaaggagagagggagaaaagaaaggaagaggagagaagaggaaggaaggaaaggagaaagggaggagaaaaagggagggaaggagggaagaaaaaggggagaaagggggggagaaaagaaaggggagggagagaaaagagaaagagggggagagggggagagggaagaggaggagaaaagggaaagaaggggaagaagaaggaaaggaagaaaggaaaaggaaggaaggggaaaggggagagagaaaggggaaaaagagaaaagagggggagagagagaaaaggaaagaaagggaaaaaaggaaggaagaggggggggaaaaagggggaggagggaaagaaaaaaggggggaagaggaggggaagaagggaaaagaaaggaaagagaggaagagaaagagagggaaaaaaaaagggggaagaagggagaaagagaggaaaaggaaaaggaggagggagaaaagaaaaagaaaggagaagaaagaagaaaaaggggaaaagggaggaaaaaggagaggagaaggaagagaaaggaaaaggagagaggaaggggaaaaaggagagaggggaaggaagggagaagggaaggaaggaggaagaagaagggaagagaaagaggagggagggaagggagaaagagagggaaagaggaagaagaaggaggagagaaggaaaggaaaaaggaagagaaggggaagaagaagaaaaagggaaagggaggagaaggaagggaggagggagagaggaaagagaagaggaagagagggaggggagaggggagaaagagaggggagaaaagaaagggagaggaggaagagggagaagaaaagaagaaagggaagaagaaggaggaaaagggaaaaggaaaggaagaaagagaggaaagaaagggaagggagaggagggggggaagagggaagagggagaaggaaaaaggaagaagagaagggagaggagggaggaggagaggaggggggaaaaggggaaaaggggagaagggagggaaagaaaagggggagggaggaagggaaaggaagaaaaaaaagagagaggggggggaaggaagggaaggagagaaaaggggaaggagggaggaggaaaagggaagaagggaggagaaagagaaaagaagaaaaaggaaggaaaagaagaggggaaaaaaaggggaaaagaaggaaaagaaggaagggaaagaggaaaaagggaggaaggaagagagaggggggagaggagaggagaggagaaagaagggaagagagggagggaaaggagggaaagaagggaagaaaaaaaagaaaagaggaaagggggaaagggagggagaaaggggggaagaagaggagagagagaggaagaaaaagagaagaggaaggagaaaaagaagagagaaaaagaaagaagaaaggagaagagaaggaaaaggaaagaagaaaaaggggaagagaaaaagaaggaaaaaggaaggaaaagggagggagggaagaggaaaaggaaggggggggaggagagggaaaggaaaggagggagaaggaagaggagggaaggaagagaaaaggaaaagaaaaaagaggaaaagaagaggagggggaaagaaaaggagaggaaggagaggggaaaaaaaggagggagaggggagaggagggggagaagggaagggggggaaaggggagagggaagaaaaaaaaggaggggaagggaaagggggagaaggaaagggagagggaagaagagagagagagagaaaaaagaaaaggaggaaaggggagagagaaaaaggaaggaaaaagggaagagaaaaaaagggggaaaaagaagaggagagaggaggggaaggaaggagggagaaggaaggaaaaaagggagagggggggaaagaagaaggagaggaaaaagagaaagagagaagggaaagggagaggggaaggaaaaggagaaagaaaagagggaaaaaaggggagggaagaggaagaagggaagggggaagagggagggaggaaagaaaggaagagagaaaggaaaagaaaggaaggggaagggaaaaaaggggagaaggggagggggggagaggaaggggggaagaagaaaaagggagagggagggagagagagagaggggaaaggagaaaggaaaaaaggaaaagaaagaggaaggggagaagaaggagaagagaaaaggaagaaaagggaggaagagagaaggggaagggagaagagagaggggggaagaaggggggaaggggaaagagaggggagaaaagaagaaagaaagaggaggagagaaaaaaggggaaaggaggaggagaggggaagagggagaaggggaagagaggaaagaggaaagggagaaagagggagagaggaagaaggggaagggggggaaaggaagaaaaaagaggaagaagaggggggagggaggaggggaaaagagagagggaagggggaaggaaaggaaaaaaggagggaaaggggggggagagaagagagaggaggagaaaggggaaaagagaaggaaagaggagggagaggaaagaaagaaggaggagaaaaagggagagggaaaaaaagagggaaaaagaggaagaggagaaaggaaggagagaagagggaaaaggaagaaaagagagaagaaaagaaaaagaaagagaaaggagagggggaggaaagaagagggggggagaggaagagggaaggaaaagaggagggagaagaaagaggaaaggggagaaagggaaaaagggaaaggggagggagaaaaaggggaaaaggggagaagagagaggaggagagagaaagagggagaagagggggggaagagagggaagggaggaggaagaaggagaaagggaaagaaaagaagaggagagaggaaaggggaagggaggaaggggggaagaagagaaaaagaaaaggagaaagggggggaagagagagggagagagaaaaaaaaaggggaggaaggggaaaaaaaaagaaagggaggggagagaaagaagaagagagaagagggagagaaaagggggaaggagaagaggaaaagagaagaagggaagggggagagaagggaagagagagaaaaaaaggagagaaggaaagaggaagaaagaaggagagaggggaaagaggaaaaagggaaaaaaagaaagggggggaaaaaagaaaaaaagaagaggggaagggaaaaaaagagagagggaagaaagggggaagggaaaaagggaaggaagaaaggaaaagagaaggaaggagaagaaaagaaaaagagaaagaaggggaaggaagaaaagaagaaaaagaaggagaaaaaggaaagaaagagggggaggggggggaggggggggaggaaagaagaaaagaaaagggggaaagaaaaaaagaaagggaaagggggaaaggaaaagagaaggggaagaaaggggaagagaaagaaaggagagggagaggagaaaaagaaagaggaaagggagagagaagagaaggagagaaaaggagagaagaggggggaaggaagagaggaaggaggaagaaaggagaggggagaaaagagagggaaggaaaggggagaaaaaaaagaaagaagggagaggagagaaagagagagaaggaaaaaggaagggagaagggaaaaaaagggaaagaaaaaagaaggggaggaggggggagaggggaaagggagggaggaaaggaaggggaggagagggggaaaaaagaagaagaggaaggaaggggaaggaagagagagaagagaaaagaggaaaggagaggagagaagagagaaggagaggagggaagaaggaagagaagggaagaaggagaagaaggaggagaaagagagggagaaaagaggggaggaggagggggagaaaagagaaagaggagaggagggagaggaaggaaagagaaagaggaaaaagagaaaaagggaagggggggagagggggaaaaaggaaggaaagggaagagagggaggaagagagaggggggaagggaggaggaagggaaggggaagggagaggggaggaaaaggggggaaaaagagaagaaagagaaaggaaagagggaagggaaaggggaaaaggggggaaagaaaagaaggggagaagaaggggggaaggggagaaagaggaaaaagggggaaaaaggaaggaagaaggaaaggaagaaaggggaaaggaaagaggaagggaggaaaaagaagaggagagaagaggggggagaaggaagagagagggaagggaaaaaaggaagagaagaaaaggaaaagaaggggaaaggggagaagaagaagggagaggggaaaggaagaaggagaggaagagaagggaagaagaggaggagaaaaaaaagaagaggagagggggagaaaagagagaaaaagaagaggaagaaaggggaagagaggaaagagggggagagagaggagaagaaggagggaggagggagaggagagaggaaaaggaagaaggggagaagggggagaaagaaagagggaaaaagaaaaaggaagagaaagaagagaagggaagaaagggaaagaggagaaggagagaggaaagaagagagggagagggaggaaaagggggggaaagagaagaagagaagaaaagagaggaagaaggagaagggaaaagaaggggaaagggggggaggagaagagagaggggggggaagggaggaggggaagaaggaggggaaggaaagggaagaaggaggaggggaaggaaagaaggaggggaggggggaggaggggaagggaaaggaaagggggggaagaagaagaggaagaaaaaggagaagggaaggggggaggaggagaagggaaaagggaagaggggaaaagaaaaagaagggggaaaagggaaaaagaaagaaggggggaggagaaaaaagagggaagaaagaagaaagagagaaggggagggaaaagagggagagaaaaagagaaaagaagggaggaaaagaggaagaaggaaagaagaaaggagggaggaggaaaaaaaagggagggaggaaaagaaggggagaggaaggagaggaagggaaaaaggaaggggaaaggaaaggaaaaggggagagaagaggagaagagaagagaaggagggaagaaggagaagagagagaaaggaagaagaaggaaaaaaaggagggggggagagagaaggaaggagaaaggggggagaagaggaagggggggaaaggagaagaagagaagaaaggggaggggggaaaagggagaagaaggaagaggaaaaagaggggagaggagaagagaaaaagagaaaggaagaagaggaggaagagaagaaagaaaggaaggggaggagagagggagaaaggaggaaaaaaaagaagaagaaaagaaagaaagaggggggaggaaagaagggagagagaaagaggaaaagaagagaagaagagggaaaggaagagaggaaaggggaaaaaaagaaagggaagaggaaaaggggaggaaagggagaaaaggggggagagggggaggaagaaggggaaaaagggaggggaagaaaaggaaaggagaagggggaaagggaaaaagaggaagaaagaggaggaagagaggaaggggaaagggaaaagagagggagaagggagaggaaggaaagaagagaaagaggaaagaaagaagggagagaagaaaaaagagaggggaagagggagaagggaggggagggagaagagggaaggaagaagaagagagaggaaagaaaaagagggggagagagaaaaggaggaagagagaagaagaaggagagaagagagagaggaaagaggaagaagaagagagaaggaagaagaaaaagaaaagaagaaaaaaaaaaaaaagagggagaaggaaagaaaaggggggggagaggaaggaaaagaagaagaggaagaagggagaggagagggaggaggggggaaaagaggaaggaagggagggggaggaaggagagaagagaaaaagagaagaaagggaaaagggaagaggaaaagaaaaagagggggaggagggggaggaagaaaaggaaaagaaaaaggggaggagaaaagggggaggaaagggagaggaggaagagaagggaagggaaggaagaaagaaggaaagaaaggagggaaaaggaggaaaaggaagaagagggaagaaaaggagaaggagagaaaaaggaagagagaaaaggaagaggaggaggagggaggggaggggggggagaagkagggggggaagagaggaagagggaggagaagaagaaaagggaaggggaaaaagaggaagggagaaaaaaaaaaaaaaagaagaaggaggggaaaaaaaaaagaggaaaaaagagaagaagaaggagaaagaggggagagagggggggaagggaaaagggggagagaagaggaggaaagggaagaaggggagaagaaaaggaaaaggggggaagaagagaagaaagggaaggggggggaggaagggaagaagaagagagaggagggaaagagaagggaaaggaaaagagagaggaggaaagaggggaaaagaaagaaggagaggagggagaaagagaggaaagaagaagagggaaggggagaaaaaaagaggaaagaagaaaagaaaaaggaagaaaagggagggggaaaggggaaaggaaaggggggaagagggaaaggggagaggaaaggagaggggaaagggaaagggaggaaggggggaaaagaaggggaagggaaaagaaaaggaagaaagagaagaaaaaagaggggagagagggaagaaaggggagaaagggggaaggggaggagggagaaagaggaaggaaaagaaagggaggaggaaaaaaggggggaaaaagaaggaggagggaaggggagaagaggagaaaaggggggggaaaggggagagaggggagggaagaagagaaaagaggggagggggaaaggaaagggaaggggaggaggagggagaaagaggaaaaaagggagaagaaggggggaaggaaagaaaggaaaaagagaaagaggaaaaaaagagagaaggagggggaggggggggagagggaggagaaaggaagaggagggagaggggggaaggagaaaaaagaaagggaaaaaaaggggaggggagagaagagaaggaaaaaaggaagaaggagaagggaggaggagagaaaaggaggaagaaaagagagagaagggggaaaggagaggaagagagggaagggggggaggagaaaaggagaggaggagagaggggggagagaggagaaaaggagagaaaggagagaaggaggaaagagggggaggaggaaagaagaggaggaggggaggaggaagggaggaagaagaaaagggaagaaaaaaggagaaagagaaaaagaagggagaaggaagggagaaagagaaagggaaggagagagaaagaaagaaaaaaaaaagagagagggggagaggaaggagggaaagagggagaaaagaagaaggaaagagagaagaagaagagaaggggaagaaagaggagaagagaggggaaagaggagagaagaaaaagaaaaaggggagaaagaggagaagaagaaagaaaagggggaagggaggagaagggggaaaaagagaggaaggaaaaaaggaagggaggagagggaaaaaagaagagagaagagaaagaaggagaagggagagagaaagaaaggaagggaaaaaaaggaaaaaaaagggagagaagggagaaaaggaggagagaggaagaaggagagaaaggagaaaggggggaaagaaaaggaagggggagggaggaagggggaaagaaaaggggaagagagggaaaggggagggaagaagagggaagggggggggaaagagaggggaaggagggggaagaaaggaggggaagagggaaggaaggaaaggaaagaggagagaaggaaaagggaaggagaaagaaaaaaggaaagaggggagaaaaggaaagagaaaagagagggaggggaaaaagggagggggaaggaaggaagagaaaaggagaaggggagaggaggaagagagaaaaagagaagaaaaggagggaggaggagaaaagaaaggaaaaaaaagggagaaagaaagggaaagaggaagaggaagaagaggagggaagaagagagaaaagaaagagggggggggaggaagaaaagaaggaggaggagaagaggagaaaagagaaagaggagaggagaaaggagaggaggagaagagaaaaagagagaagaagaggggaggggaggggggagggaagggaagagaagaaggaggggaaggaagaaaaggaaaggggaaaaaaggggagagaagaggaaggggggggaggaagaggggaggaagggagaaagaggaagagggaagaagaagagaaagaggaaaagagggggaaaggaaggaaaggaaaaagaaaaaagggggaaagggggaaggggagagaagaaggggaaaaagagaaaagaggggggaagagggaaaagagaagaagaagaaaaaaggaggaggggggggggaggaaaagggaagagagagaaagaaaaagggggggaagaggaaggggagagaggaggagaagagaaagaaaagaagagagagggaaggaagaagaaagggggaagaggggaggagaaggggaaagggaagaaaaggagggaaaaaagaaaaaggaaggagaaaagaaaggaaaaaggaaaaaagggagaaaggaggaaggaaagaggaggggaaaggagaggaagagagaaggggaaaaagaaagagagaggagaaaaaggagaagggaagagagaaggaagaggaaaagaagggaaggagaaagggggaaagggagaaagagagaggaagaagaaaaagagggaggagagaggaaagggggaagaagagggaagggggagaaggagagaaagggaaaagaagaagaagagggggagaagaaggaaagagaagaaaagaggaggaagggaaaggaagagagagaaaagaggggggaggaaaaaaaagaaaggggggaaaagggaagagaaaagaaaaaagagaaaaggagggaaaaaaggagaaagggagaggggaaaagggaggaaagaaagggaagagagaagagggagggaagagagaagaggaggagggaaaagggaagaaaagagggaagaaagggaagaaggagaagaggggggaagaggggaaaaaggaggaagagaggaagggaaagggagaggggaggaagggaaaggaagagagaagggggaaaggggggggaggaaaggggaggagagaaaaaggggaagagaaaggaggaaaagggaaaaggggaggagaaagagaggagaaaggaaggggaggagagaggggagggaggaggaggggagaaagggagagagaaaaaaagggggaaggaaagagggagggaggaaggagaaaagaggggagaggaggaaaggagagagaaagggaaggggggaggaagggaggagaaaggagggaaggaaaaagagaaagggaaagagagagaaaggggaggaggaaggggggaaggaggggggagaaggaggaggaaaaggagaagagggaagaaggaaagaggagagaagaagagaaaggaaaggagaagagagaaaagaggaaagaggaagaagagaaagagaagaaggggagaaaaggaaaggaaaggaaaggggggaaggagaggaagaagaggggggaggggaaaaagaaggaaggagggaaaaaaaaaagaagggggggagaaaaaaagggagagggaaaaggggaaaagaaaaaaagggagaaagaaaaggggaggaagggaagggaagaaaaaggagggagggaggaaaggggggggagaagggaaggggggaaaagggaaggggagaagaaaaaagggaggggaagggaaagagggggaaggaaagggggaggaagaaggggaaagagagagggaaaggaaaaggaaaaaaaaggggagaaagaaaggaaggagaaagggaaaaggaaaggggggggaaaaaggaagggagagaagaggggaaagaaggggggagagggaaggaaaaaagggggagagggggaaagaaggaaaggaggaaaaggagaaagagaaaagagaaagggggagagaagggggaaggagagaaagaggaggggaaggaagagagggaagaagaaaaaagggagagggaagaagagggaagaagagaaaggaagaaagaagagaggaaaagggaaaagggagggaagagaagggggagggggaaggggggagagggggggagggaggagggaaaaggaaaggggggaagaaagggagaggggaaaggagagagaaaaaaaaagaaaaaaagggaaaaggaagaaaaaggggaagagaaaaagaagaaaagagggagagagagaaagggaagggagaaaagagagaagggaagagaggaggaaaagaaggggagggagaaaaaaaaagagagaaggaggagaggggaaaggaggagaaagggggggaaaaggagaaaagggaaaaggagaagagaggagagggggaaagaagaaggagagagaaaggaggaagagaaaggggggggaaagaaaagaaaggaggaggaagaggggggggaaaggaggggagaaaagggagggaaggggggaagaaaagaaaaaaaaagggaaaggggaggaggaggggagaaaggggagaaaagggagaaagaggaggaaagaggagggagaagaggagagggaggaggagagaaggggaggaggaggaaaaagaggaaaaagaagaggaggaagagaggaggagagaagaggggagaggaagaagagggagggggaaagaaaaagggagagaaaagaggggaagaggaaagaagaggggaggagagggagagggaaagaaaagaaaagaaaagaggaagaaggaagggaagaggggagagaaaagaaagaaaagggaggaaggggggaaagggagagaaaagaaaagaggaaaaaaaaaggaggagggaaaggggagaaaggagggagaggaggaagggggaaaagaaagggaaagaaaagaaaaggggaggagaaaagggaagaggggaaagaaaaagagagagaagaagaaaaaaagagagggagagaagggaagggaagggagaaaaagaaaggagaggagggggaaagaagaagagaagaaggaaagagaaaaaaaaagagagaaaaagaaggaaaaaaggagaagaagagaaggaaaggaaaaggagggaaagaggggagaaaggaagggagaaaaaaagagaggaggaggaaaaaaggaagaagaaggagagagagaaaagagggaaaagggaaaaaaagagagagggggaaaagaggagaagagaaggggggaagggaaggagggagaaaaagaaggaggaggaaagggaggaagggaaggagagaagggagggagggggaaagagaggaaaagaaaaagagaaaggaggaagaggaagaagagaaaaaggagaaggaaaaaaaaggaagaaagagagaggggggggggagagagggaaggaaagaagaaaagaaaggagggaaaggaagaaaaaaagggaaagaggggggaggaaagaaaaggggaaaaaagagggggggaaaaaagagagaaggaaaggaggaaagaaaaggggaaaaagagggagaagagaaagagggaaaaggagaggagagggggaaaggaagagaggagggagggaaaaagaaagaagggaaaaaaagggggagggaagaggaagaaaaaaaagaaagaaggaaaaagagagaaggagaggaaagaaaaaaggaggggagaagagaaaaaaaggagaggaaaaaaaaaggggaggagaaaagaaggagaaaggagagggagggagggggaggagggagaagaggaaaaaggaagagggaggaggaaagggggggaagagaaagagaaaaaaagaaggggggaaagaaaaggagggaaaagaggaggaaggaaggggaaagaaagggagggagggagaagaagagaaagaaagagaggaagaaaagaggggagaaggagagggagaaaaaggaaagagggggggaggggggggaagggagaaaaaagaggaaaaggagaaaaagagaaagaggggagaggggaaaaggggaaagaaagggaaaagagggaagaagggaggggagaggagggaggaggaggggagggggaagggaaaagggaggaaggggagagagggagaagagagaaagaaagaaaaaaaggaagagaaaggggaaagggggaaaaaaagaaaagggggaagagaagggggaaaggggaaaaggagaagaaaaaagaaaagagggagaaagagagggaggaagaaggagaaaaagaaagaggaagaaaagaggaagaagagaagagaagaagggggaagaggaagaaagaaggaaggggagaaaggaagaaaagaaaaggaaaagaaaggaaggggggaggggaagaggggagaggaggaaggagaaaggagaaggagggaaaaggaggagggagggggaaaaaagggaagaggaaggggagagaaaaaagaggaaaagaagaggggagaggggagaaagaggaaagggagagagagaaaggagaggaagggggggggaggaagaagagagaggaaaggaaagagggggggaaagggggaaaagagggagggaaaaaaaaggaggaagggaaagaagggaaggagagaaagaggaaggggaggagaaaagaggaaaaaggagagggaaaggaaagggaagagggagggggaggaggaaagagggaaagaagggaaggaagaaaagggggaaggagagggaagggggagaaggggaaagggaggagaggaaaaagagaagggggagaagggggggaaagaaaaggagaaaagaggaagaggaggagaggaagaagggagggggaggaaaagagagaggagaaaaagggggggaagaagagaagggaagagaagggaaggggaaggggggaggagaagaaaaggaagggggaaagggggaaggaagaaaaagggagaagggagaaggaagagggaggagggggggggagagagggggaaaagaaggggaggaaaaaagaggagaaaagagagggggaggaaaggaggagaggagagaggaagggaagaaaaaaaggagaagggagagaggaaaaggaaaagaagaagaggagggaaggaaaggggaaaaagagaggaagaagggaggaaaggaggaaggaagaaaggaaaagaggagagaagggaagaagagaaggggaggggggaaggaagaggagggggaggaaggaagaaagaggaaaaaagggaaaaaaggagagaagaaagaggagaaaagggggagaggagaaggaggaggaaagaaaaagaaaaggagaaagaggaggggggaaaagaaggaagaggaaaaaaaagaggaagagaaagggagaaaggaagaaaaaaaagagagaagagaagggagaaaggaaagaaaggaaggggagaaaagagggggaaaggaggagggagaagaagaaggagagagaggaagaaaagggaggaaagaaggaagagaaaaaggagaagaaaaaaaaaggaggggaaggggaggggaggaagggaaagaaaaggaaagagaagaggaaaagggaaggaaaggaaggaaagggaggaaaaggggaggaggaagaaggaggaaagaaggggaggaaaggaaagggggggggggaaaggagaaaagaggaaaaaggaggaaaaggagagggagggggaagggaaaagagagagagaagagaaaggaaggaaggaagagagggagggaagagagaaaagagaggggaaaaagaaggggaaaaaagggagagaggaggggggggagaggagggaagaaggaaaaaagaagagggaaggaagaaaggaggagagaggaaaggaggaagagaggagaaaaaagagaaaagggagggaagagagaagaagaagaaaaaagaagaaagaagaggaagggaaagagaggaaaaaaaagaggaaggagagagagagagaagaggggagggaagaaggaaaagaagaggaggaagaagagaggagaggggaaggaggggggaagaaaggagagaagagagaaggaggaaggagaaaagagaaaaggaaaggaaaggaagaagggaggaggagaagaagaagagggggagaaaaaggggggagagaaggaaaaaaggaaagggagaaagaaggggggaggaaagggagagaagagaaagaggagaaaagaaaagaaaaagaagggaggagaggggggaagaggaggagaagaaagaagggggaagggaaagagaaggagagaaggagagagaaaaaagggaaggggaaggaagagagaagggaggaaggggagaagaaggggggggagagagagggagagaggaggagaaagagagagaggagggaagagaaaaagaaagaaaagaaaaaaaggaaaagaaggaggggagaaaaaaagaagaagaaaaggggagagggaagagggaggggagagagaggggggggagaaaaaaaaaggaggaaaagggaggagagaggagaaaggggggaaaagggggaagggaggagaaaagaaagaaaaggggaggggggggaggaaaggaaaaagaagagagaggagggagaaagaaggggaaggaaaggagagaggaggaaagagggaaggagaaagagggagagaagggagaagggaaaaggaaaagaagggggaaagggagaaaagaagaggggagaagaaaaaaggaggggaaagaaaggaggggaaaaggggggggaaaaaaggggaagagggaaagggagaagaaaaggagagggaagaaagaagggggaaaaagggggaaaagagggggaagaggaaagagagagaggggaaaaaagaaaagggagaggagaaggggaagaaaggggaggaagggggggggagaggagagagaaggagggagaagagaagaggaagggggaagagaggggggggaaagaaagaggagagaaggaggggagaagaaaaaagagggagaaaaggaaagaaaggaaagggaggagaagaaaagaaaggagggggaaaagaagaaaggagggaggaggagggggaaagagaagaaaggggagaagaaagggaaaaaaaagagaaaagaaaagggaaagagagaaaaaagaaaaaaagaggaagaaggaggagagaggagggaaaaagggaaaaagggggaagagggaaaagaagaagaaaagagaaaaaaaaagagaaaggaaaagaggaaaggggaaaaagaaaaaaggaggagggaggaggggggaggaaaaggaaggaaagagagaaaaaagagaaaggggagaaggaaaaggaaagggagggggagaggagaagaggaggagagaggggggggagaggagaaaaggggaaaaaggagggagggaggaagggaagggagagggaaggggaaaggggagggaaagggggaggggggaagaaagaaagagaagaaaaaaagagaaagggagaaagaagggaaggagaagggaaagagaaaaggagggggagagggaagggagggaaaaaaagagagggagaggggaagggaggaggggaagagggaggaaaggggaagggaggagagaaggagagaagagagggaagaaagaggaggaaagaggggagagagaagagaaaaaaaggaagaagggaagaaaagagagaggggaaaagaaaaggggggggggagggaaaggaggaagaagagaaaaaggaaaaaagagaggggggagagggagggaagaagagagaggagaaagaaagggaagggagagaaaaagaaagggagagaaaaagaagaaaaaggagggggagaagagagagaagagagagagagaaaaaaggaggaagaagaaaaaggggagaaaggaaaagaagggggaggaagggagagggaaagaaaagggggagagaaggaaaagaaggggaaaaaaagagggaggggaaggggagaaaagaaagaggggagggaggagggaggagaaaaggaaaggaaggagaagaaagaagaaagaaagaagaggagaaaagaaaaaaaaaaggagaggagggaggaaagagaaaagagaagagaagaaggagagggagagaaagaaaaagaggggagagagaaggagaagggaagaaagagaggggagaaaagaaagagaaggggagaaaggaggagaagaaaggggaagaaagaaggggagagagaggaaaaaagggagaggagggagaggagagaaagagaaaagaagaggagggagggagggagagagagggaaagggggaggaaaaaaagagaagagagaaggaggagaggaaaagggagaggaagggaggaggaaaagggagagaaaggagggaggggaggggggagggaggggaaggggagggggagggggagggagaaaaggaaggggggaggaagggaagagaaggggaaaggagggaaggaagaggggaggaggggagaaaaaagaagagggaggaaggagagaaagaggaaaagaggggggaaggaagaggaagaaaaggaaggaagaggaaaggaagggagaagagaaaaggagggaaaggagaaagggaggaggggagagggagaaagagggggagaaaaggaagggaggagggggggaggagggagaaggaagaaagagaaaagaaaggggggagaagaaggagaggagggaggaggagaggaaaaaagaaaggagagagaggagaagaagagggaaagaggaagggggaaggggaaggagaaaggagagaaaaggagaagaaaaagaagggggaggagaaaaagaaagagaaggggaagaaaagaggagaggaagaaggagagaagagagagagggggagaaaaaaaaaaggaaaagaagaagggggaaagagaaggaggaagggggaagagagaagagaggggaaaagagggggaggggagagggagaggggaagagagagaaaggagaaaaaaaaggggagaggagagaggaaagagggaagaagggggaagaagggggaggagggaaaggggaaaaaggaaagggaggaggagaggaaggaaagagaggaaaaggagggaaaggaaaagaaagggaaagagagggggggagaggggaaaggagaaaggagagggaaggggagaagaaagagaaagaaggaaagggggaaaaggaggaagaggggagaaaggagaaggagggggggaagaagaaaaggaaaaggagaaaaggggaaggaagaaagaggggggaagaaaaaaaaggaggaagggaagaaaagaaggggaaagagaggaaaggagggaaagaaaagaaagagaggaaggaaaagaaagagggaaggaaaggaggggaggaggggaggagagaaggggggaaagaaaaggggagaagaggaaaaggggaaaggaagggagggagaaggagaagaggaggggaaaggagggagaaaggaggggggagggagaggggaagagggaggaggggaggaagggagagagaaaaagagggggaagaaaggaagaaaagaggaaagagaaaagaggggagaggaggaaaaggaggggaaaggggagagaaagaaaaggaagaagaaaggagggaaagaagaagagagggggaaagaaaaagaagggagaaggagaaaaaggggaggaagagggagaaggagggggaaaaggaaaaggaggaagaaggaaggagaaaggagggggaggaagggaagagaggggaagaaaggggaaaggaggaaggagagagagagaggaaggggagagaggaggaggaaaggagaaaggggagggagaggaagaagaaggggggggggaaaaagaaggaaggaagaaaaaaaggaggaagggggaaagaaaaaagaggagagggaaggggagggaaggaagaaagggaaagagaaaaaaggagaaaaggaagaaagggaaaagaaagagaggaagaaagggggggaagaagggaaggggggaaaggagagagggaggagaaagaaggggggaaaagagaaagagagggagagaaagaggaaggaggaggggagaagggaaggggggaggaaaaaaaaaaaaaaggggaaaaagaagggagggagaaaggggaagggaaagggaggaagaaggggaagggagagaaaggaagaaaaaagagggggaaggaagggaaaagagggggagaaggaggaagaaagaaaggaaggaaaggggagggggaaaagagaagagagaagagagggagggaggagggaaggagagggagagggaagagagggaagaagaaaaaaggggaaggggaaaagagaaagaaaggagaaagagggaaagagagggggaaaggggaaagggaggggagggaaggaggagagggaaggggggaaggggggggagagaagaaggggaagggaggggggaaagaagggaggaggggaaaaaagagggagaaaaaaagaaaagagaggaaaagaaaaagaaaagggagaaaaaagagagagagagaagaagagaagaagaagaaaggagggaaagaggaaaagggaaagaggagaaaaagagggggagagagaaaaaaaaaaagagaggggagagagagaaaaggagaaggaagggggggagaagaagggaggaggagggaaggaaggaaaagagggagggagaagaggaagagagaaaggagaaagaaaaaggggagggagagaaaaggaaggagaaggaaaaaggggggaaaaagaggagaggaaggggggggggggggggaaaaaaagggggagaaggaaaaaggaaaagaggaggggagaaagagaagagaagggagagaagggagaagaaagaagggagaagaggagggagaaaagaggagaagaggaagaggaggggaaagaggaaaaagaagggagggaagagaaggaaggagaggaggagagaggaaaaggaggggggggggagaagggagggaaaagaaaaaagggaagagaaaggaagaaggaaggaaagagaggaaggaaaaaagggaaagaagagggggaaaaggaagagaaggggggagagagaagagagaaaaggggggaagggagaaaagggagagaaaaggaaaaaaggagaaagaaggaggagggaaaagggagaaagaaaggagaggaaaaagggaggaagaaaaggaaaagagaagaaagaagggggagaaaaaggggaaggaaagagaaaaagaggaagaagaggagaaaaggagagagagaggggggaagggaagggaaaaaaagggaagagagggggagaggagggggaaagaagagggaaagggaggaaaagagagagaaaaagagggagaggaggagggaaagagaaaaagaggaaagggagagagagagagggaagagaaaggaggaaaaaaagagagggagggaaggagaggaagaggaagaagaaagagaaaaagaggaaaggggaaaaagagggagaggagaaaaagaggagaaggaaagggagggaggggaggaggaggaaaaaaaaggagaagaagagggaggaggaaagggggagaagagggggagggggaaagagagaaaaagaagaaaaagaaagagaaaggggaagaagaaaaaggggaaggaaaaaaggaaggagggaggagagaggagggagagggagaaggagggaaagaggaaaagaaaggaagagagggggggaaaaagggaaaaaaaaggggaggaaagaagagagaagagaagaggggggggaaaaagagaagaagaaggaaggaaagagggggaggagaagaggaagaagagagagaggggggaggaaaggaagagaggagagaaaggggggggggagagaaagagaaagaagggaaagaaaagggaagggaggaggaggaaaagagggaaagaagaaaaaagagaaagggggaggaaggagaaaagaggggaggaaaaaaagaaagagagaggagaggaaagggagaagagaaaaggaggagaaaggagaggaaaggaggaggaaaaggaagaagagaaaaaaggaagagagaagaagagaaaagggagggagaaggagaaaggagggaagggaaaaagaaagggagggaaaagaggaagaaagaaaggaaaagaaagggagggagggaaaagggaagaaagagagagaaaaaaaggggagaaaaaaaaaagaggaggaaggagggaagggggaggggggagggagaggggagagagaaaaggagaaggaggaaagaaaaaagaagagaaaaaaaaggaggagagaagaagagaaaggggaggagaagggaggaaagagggggggggaagagaggagaggggaagaaaaagaaggaagggggagaaaggggaaagaaagaaagagaaaaaaagaagaaaagaaagaagagagggagaaaaaaagggaagggggaagaggggagagaagaagggaaagaagaagaaaaaagaagggggggagaaagagagggagggaggagaagaaagaagaaaaaaagaaaaaagggaaggaaagaaaggaagaagggggaagaggaggaaagaaggaaagggagaaagggaaaaaggagagagaaaaggaaagaaggggggaagggaagagggaaaagaaggaaggggaagaaaggaggaagaaaaaggaggaaggaggggaaaaagaggaaagaagaagaggaagagggaaagagggggaggggaggggagaggggagaagggagaaagggagagaagggaagagaggaaagggaaggggagaaagaagaagggaggaaggaagaggaaagggagagggggaaggaagggaggaaaaagaagggggaaaggggaggaggggagaaagaagaagaggaaggaggggaaaaaagaagaaaagggagagggaagagaaagggggaaaggagggggaagaggaaaaggggggaaaaggaaagggaaaaaggagggggagagaggggagagagagaaggagaaagggaagagaagagaaaggaaaagaagagagggggaggaaaaaggaaaagaaaaaagagagagggggagggggagaaagggggggaaggagaaaagagaggggaaaaagagggagaaaaaaagaaaggaagaggagggaggagaaagagaggaggagaagagaaggaggaaggaaagggggaaggaagaaaaaaggaaaagggagggggaagggggaggaggaggggggagagaaggagagaaggagggggggaaaaggaaggggaaaagggggggggggggaaggaagagaggagaagagaaggggagggaggaaggggaagggagagaagaaaggaagaaggggaaggggagaagaggaaggaaagaaaagagaggaaagggaggggaaaggaagaagggagaaaggagaggaaaaaaggaggaaagaagaaagagggagggaagaaggaagagggaggggaaggagaaggaaagagggagagagggaaaaaaggaggggagaaagaggagaaaaggggaaggggggaagaaagaagaagaagagggaaaaagggagagaggagaaaagaaaaaaagggagggaaagaaaaagaggagaagagagggagagagaaagaaaaagaggagaaaagagaaaggaggaagggagaaaaagggggggggaaaagagagggaaagaagaagggagagaaggaggggggagggagaaggaaagaaaggaaagaagaaaagaaaaggagagaagaaagagaaagggagggagggggagaggaaagaggaaaagagagggggaaagaagaggaagaagaagggaaaggagaggaaagaaaggagagggaaggagggaaaaagaggaaagaagaggaagaaagaaagggggggagggggaagaagaaagaaaaggaaagaaagaaaagaagagggagggggaaggaaaaggaggaagagaagagaaaggaggagagggagagaggaaaggaagagaagaaagagaggggaaagagagggagaaagaaggaagggagagggaaggggagggaaggagaaaggggaagaagaaaagggagagggggagagaaaagggaggaagggagaaggaggggaggaaaaaaagaaaggggagggaagggaggagaaaaagaaaaaagagaagagaaagggaagggaaaggggggagggaggagagaaaggggagagagagagaaaaggagaggaaagaaaggaagggagaggaagaggaagaaaagaaaggagagggagggaagaggaagagggagaaaagagaaagaaaggggaaaagggaggaaaggaaagaaaagaaggaaggaagggggagaaagagaagaggggagaagaaagggaggagggagagaaggaaggaaaaagaaagagagggggggagaggagagagagaggaggaagaggagaaaaagaaagaaggggagaggaggaggggggagaggaggagaggaagaaagggggagaagaggaaaaaaaaggggaaaaggaaagaggagaaagggaagaggaagaaagagaggaaggaagaaaggggaaagagagaggaagggagggagggggaaaaaaagagaaagagaaaaaggaggggagagaaagaaaaaaaaagggaaggaggggaagagaggaaagaaggaaaggagaggaagaaaaggggaaagaggagaggggggggagagggaaaggggggagaagaaaaaaagaagaaaaggaagaagagaagggaaaggagggaaagggaggagggaaggagaaaagaaagaagaggggaaggggaggagagaaagaaagaggaaaagggggggggggaaggaagggggagggggggagagaagagaaagggaggagggggagagagagggagaggagagaagagaaaagggagagaaggagaaaaaggagaaaagaaaaagggggagagaaaaaggagaagaaagaaagggagggaagagggaggggagaaaaagggaaaaggaaaagggagaaaaaaaggagagggaagaaagaagggggaaggaagaggggaagggagggaagaagaaggggagaaagggggagaaggaagagggagaaaaggagggaggggaggggagggaagaaggggggaaggaagaggagaggagggaaaagggaggaggaagggggaggagagggaggggaaaaaaagaggagagaaggaggggagaagaaaaaagagaaaaaggggaaaaaaaaggaagaggaggagaagaaagaaaagaagggggaggaaaggaaaggaaagggagaggaagggagggaaaggagaggggagaggagaagaaaggaaaagagaaaaggaaaagggaaaagaggaaagaaaagaggagaggaagaagaaggagagaggaggaaaaaaaagaaaaagggagaggaggaaaaagaagaggagaggggaaagaaaaagaaaaaagaaaaaggagaagaagaaaaagagaaaaggaggaggggaaggggggggggaaaaagaagggaggggagaagaaagaaaggaagaaaaaggaaaagggaagagaagggggagggggaagaaagggagagggaagggggaaaagggaaaagggggagggggaggaagggggaaagggaaaggagagaaaggaggagaggggaaggagaagaggagaggggagaagagaaagaggaaaaaaaaaaaggaaggaagggggaggaagaggaggagggaaagagaagaggaaggagagaagaaagggagggaagaaagggaagggggaggggaagggagaagagggaaaagagggaaggggggagagaggagaggaggggggagaagaggaaggaaggggggggaaaaaggggagagagaaaaggaaaagggaagggaaggaagaaaagaaaaaggggaaaggggaagggaggggagagagaaaggaggaagggagaaaaagagaagagagagaggggggaggaggagggaggaaaaaagaggaggaaaagaggggaaggaaaagagaagaaaaggagagaaagaggagggaaaggaaggggaaagaaggaggaaaagagaaagaaagaagagagggaagaaaaagggagggagaggggaaaagaagggggaagaagggaaaggagaaggaaagagggagagaaggaaaaaaagggagaaagaggagggagaagaaggggaggaaagaaggaggagagagaggaggaaggaaaaaaggagggaaagaaggagaaaggagaaaggaaggaggagaggaaagaagaaaaaggaggggagaggggagagagaggaaagggaaagaaaaaagaagagggaaaaaaagaaaaagaggggggggaggaggggaagggaaggaagagagagaaaaagagagaggaaaggggggaaaagggaaggagaaagggaggggaaggagaggaggggggagaaaaagagggaggaagggagggggaaggaagagaaaaggagaggaggaagggaaggggagagggggagagaggaagggaagaaagaagagaaagaagaaggagaagaaaagaagggggaaaggaggggggaaaggaagagagaggagagaggagaggggggagggagggaaaagagagggaaagagagaaagaaaggagggagaaaggaggaagggaagagagggggaaaggagggaaggaggagggagggaggagaggaaaaaaaagaaaaagaaaggagagaaggagaaaaagaaaagggaaggaggagggaagaagggaagggagaggaaaggaaaggggaagagaagaggagagagaggggaaggggaggaggggagagggagagaaagggagagaaaaggggggaaggaggagagaagaaggggggaagaagaaggaagagagagagggaagaaaggaaggaaaaggaggagggggaagggaaggaagaaagggggaggaagagaagaagagggaaagaggggagggaagagggaaggaagggggagaggaagggagaagagaaaaaaggggggggagaggaggaaagagaggggaaagaggagagaagaggaagaagaagagaaaggagagggggggggaaaagaaaaaggaaaagaagaagggggaaaaagaaggaaagagggaggagagggaagaggaggagaaagggagagggaggagagggaaaggggaggagaaaggaaagggagaaaaaagaggaggggggaggggagagaaggaggaaggggagagaaaggagaggggggaaaagggaaaaaggaaaggaaggagaagaggaaggaaagagggggaggggaaggagaggaagagaagggaaaagaggggggggaaagaggggagggagagaggagaaggagaaggagaagaggaagagagaagggaggagggaaaagggggaagggggagggaaggagaaagaggagggaaagaaggaaaggagaaggaaaaaaggggaaggaagaaagagggggggagaagaaagagggggaagggaagaaaaaaaaggggaagagaggaagggagggagagaaaagaaaaaagagaaggaagagaaaaaggaagaagaagagggggagagggggaggagagaagggaaaaaggaagagaagggaaagagaagagaggaaagaaaggaaaaggggagaagaggaagggagagaaagagggagagaggaggaaggaaggagaggggaaaagggggggagagggggaggaagaggagaaaagagagggaggaaggggaaagaagggaagagagagaaaagggagaaggagggaaaagaggggggaagggagagaaagaaagggaagaaagaaggaggaaaagagggagaaggggggaaaggaaaagaagaaagaaagaggaaaaagaggggaagaggagagagagaagggaaaaggaaagggaaggagaagggggaagaaagaaggggagggaggggagaagaggagaagaagggggagggaaggggggagagagggggagggaagggagggggaaggagggagggagaaaggagggggaggggaaggagaaggaaagaggagaaaaggagggaaagagaaaaaaaggaggaagagggaaagagaagggaggaggggggaggggaaggaaggaagaaaaaaaaggagaaagaagaaaaagaagagaaaagggagagaaaaaagagaaaaaagaggagggagaggagggaaaagagaggggagagagggaggaggaagaagaagggaaaaaagaaagagagggggaagggaaagagaaaggaggagagagagaaagaggggagaggagaagaaagaaagaggaaaaaggagaggggaggggggaggaaggggaagggagaaagaaggaggagaaaggaaaaggaaaagaaggaagagagagggaggagaggaggagagaagaaagagggagggaggaaggaaggagagagggggaggaagaaaggggaaagaagaaagggaggggaaaaggaaggggaggaaggggggagaaagggggaaaaaaagaaagggaagaaggaaaaagaaagaaaggaggaaaggagaaagggagggggagaggaggaaggggaaagaggggaaaagaagagaggagaggagaagaagggaaaaagaagaaggggaagggagaaggaaagggagggaggagaaaggaaagaaggaagaaaggaagaggagggagaaagagaaaaggagaaagaggaaaaaggaaggagagagaagaaggaaagaggaaaaaaggagagaagggggaaaaaggaaggaaaagaggaaaagggggagaaagaaagagaagaagggaggggaaagagagaaggggaaaagggaaaggggaagaagaagggaggaggaggaaaagaaggaaagggagaagggaaaagaggaagaggagagaaggaaggaaaaggagaagagggagggaaggaaggagagggagagaagggggaaaaagaaaaaggggagagggggaggaaagaggaagaaaaggggagaagaaagaaagaaaaaagaaagggaagaaaagaagagaaaaaagagaaggggaaaggaaaaagaagagaggggagggaggaaggagagggggaagaagagagggggagagagggaagaggagggagagaagagaaggaaggggggaaggagggaagagagggaagaggggaggagaggggaagggaaagagaagaggaaaagaagagagaggaaaaagagaggagaggaaagaaaggggggaaagaagaggagggaaagggagagaaagggaaagggggaagggaaaaaaaggggggagggaaaagggggaggaaaaaagagaagaggagagagagggaaaagggagaagaaagggagagaagggagggaagaaggaggaagaggaaaaaggagggaaggagaagggggaaaaaaaggggaaagaaggagaaaaagaggaagaggaggagagaagaaggaagaaaagggggaagagaaaggaaaaaaagggaaaaaagagggagaggagggggaaaggagaggaaaaagggggaggaggaggagggagagagggaggggaaaagggaaagagaaaaaggggaaagagagaaggaaagagagaggagaggagagagagaaaaggaagggaggaagggagaagaagaggaggaaagagaagagggagaaggaagaagaagaggaaggagaggaaaggaagaagagagggaggaggaaggagaggagggggagaaaaaaagaagggaaaaagggaagggggaaaggggggaggaaaggggaagggaaagagagggaggagggagggagagaaaggaaaaggaagaagagaaaaagggggaggaaaaaagggaggagggagagaagaagaaggagaaggagaaagagggggaaagaagaggggaggaaaagagagggggaaaaagaaagagaaaaagggaagggaggagggagaagagaagaggggggggagagggaggagaaagagaaaagaaagagggagaagagaaagagaggaaggaagaggggagggaaagaaggaagaaaaaagaaaagggggggggggaaaggaggggaaagaaaggagagaaaaggaaggaagggaaaagagggggggggggagaggaagaaagaaaagggaggaagaagaagaaggaaggaaaggagaaaaagaaagaaagggaggaggaaagaaaagaaagaaaaagaggagagagaaaaggaaaggaggaggaaaaggaaggaaaaaaagagggaaaggagaagaaaggaaaaggaaggagaaaggagaaaggggggaagggaaaaaaagaggggagagagaaaggaaagaaggaaggaaaaagaggaaaggaggaaaagggggaagaaagggggaggaaagagggggaaaaaaaagaagaagaaggggggagagaaaggggaggagaaagagaaggaagagagagaaaggaggagggaagagggaaaaaaaaaaaaaagaaaaaggaggaaagaagagaaaggaggggaagagggagaaggaaaaaaggagagaagagagaaaagaaaaggagaaagagaagaagggggaagaagggggaaaggaagaaggggaaaaagagaaagaaaggaagaaaggagagaaaagggaggggaaggggaaaggaggaaaagaagaagagagggaggaaggagaaaaaaggggggggaaagaagagggagagaggagaaaagagaagaaagaaagaaagaagggaggggaggaaagaaaaaaggaaagagaggagagaaaaaagaaagggagggaggggagaaggagagaggaggaggaagagggaggggaggagaagggaagaggaaagagaaggaggaaaggaggaagaagaaggaaggagaagaggagaagggggaggagaaaagaagaagaggggaaaggggggggggggaaggagggaggaggagagaggaaaggaaaagagagaagagaggaaagggaaagaaaaaaaagagaagggaggaggaaagaggaaaggaagaggaagaaggaagggggaagggggaagggggaaaggagaggggggaagaaaggaggggaggggggaagaggaagaggaaggaaagggggagagaagaaagaaggggaaaggaagggggaggagaagaggggggaagagaaaggggaaaaagaagggggagaaagaggaaaaagagaaagaggaagggaaaagaagagaaaggaagaaaagaaaggaggaaggaaagggaaaagaggaaaaagaaaggggaaggaggaagaaaaggaggaagaagaaaagaaaggggaaaggaagaaagaaagaaggagaggaaggggggggaggaaagggaaagaggaggagaagaaaggggaaggaaaagaggaaggaagagaagagaaaggggaaggggggagggagaagaagaggggagggggaagaaaagagggaggaggggaaaaggaaaagaaaaaggagaaagggaggaggaaagggaagggaagagaaggagaaggaggaaggggggggggaagaaaaaagaaagagggggaaggagagaagaggaagaaaagaaaagaaagaaaaggaaagggggaagaaaaagggagagagaaggggaaaaaggggagaaaaggaaaagagggagagaaagaggaagggggagagggagggaagggggagggagggagagggaaaaaaaaaggagaggaaggaagaagaagaaaagggggggaagaaagaaagagaagagggggaaaggaggaaaaaagaaaagagaaaaagagaaggaaggagaaaggggagaagagagaaaaggagaaaggaaaagggaaggaagaagaaaaggagaggagggaaggagggggggggagaaaaaaaggggggaagaggggagagaagaaggggggagggaggaggaaagaaaaaaggaggaaaaagagagggagagaagaaggagaagaggagggaggggaagagaaaagaggaaagggggggggggaagaaagggaggaagaaggaagaggagagggaaaaaaagagaaagaaagagaggaaaagggggaaggagagggaggaagagagaggaggaaagagaggaagaaagagaaggaaagaaaaaaaagaaggaagggggagaggaaggagaaagaaagggggaggaggaaggagggggagaaaggaaaggggaggaagaaaaaggaggaagagagagggagaaggagggaggggaaagagaagaaaaaggaaagagaaagggggagaagagagaagagagggggagaaaaaagggagggggaaagaggagaggggaggaaaaaaagaagggagagggaagggggaaagaggaggaaaggagaaggaggagggggaggaaagggggggggggggggagagaaagaggaaaggaggagaaggagaagagaaggaaggagagaaaggaaaagggagaaaagaagggaaaggggaagaaaaggaagagggaaggaaaaaaaaggaagggagagaggaggggaagaaaggagggaaaggaaagaagagggggagaggggagggagaagaagaaaaggaggagggagaaggggagggagaaaggaagagaggagaggaaaggagaggggaaggaggaaaggaagagaaagaaaggagggaggaagggggggaggaagagggaggaaggagaaggaggggagaagaggggaaaaaggggggagagggaagaagagaagggaaagagaaaaaaaagaaagaaaaaagaaaggggaggaggaaaggaaggagggaaggggaaagaaaaggaagagaggaaaggaaaaggaggggaaggaaagaaaagggaaggaggggaagagaagaaaaagggaggggagagaaaggaagagaggaagaggaggggggagaaaagggggaaagagggaaaagagaaaaaagagaagaggagaaggaaaagggggagaagggaaggggaagaggaaagaaggaggggaagaagaaaagaaagggaaaaaaggaaggaagaagaagaggggaggaagggagaaaaagggagaggggagaggaagagaaagagaagagggggggaaggaagagaaggaaggaggagagaagggagggggagagagaaagaaggagggagaaaggggaggagaaaaaggagaagaaggggaaagaaaaaggagggagggaagggaaaagagaaggaaaaaaagagagaaaaggagggggaaagaaaagagggggaaggaagaaaggggaggagaagaaaagaaggggggaaagagggagagggagggggaggaaaaggagaaaggagggagaagagaaaaaaagggaaagaaagaagaggggaaagaaaagggaggggaagggggggggaggaggagaggaagaggagagaaaagagagaagagaagaggagggggagaaaaagggaaaaaaaagagaagaaaaggggagagaggaaaaaagaaggagggaaaggaaaggaaaaggagaagaaagagggaaaaggagaggaggaaggggaagaaaggaagagagaaaagggggagggaaaaaaggggaggaaagaggaaagaaaagaaaaaaagggaagagaagagagaaggagaagagagagaaggaagaaagagaggggagggaaaggggaagaaaagaaaaaagaggagaggaaggagaagaggagaggaggggaggaaggaggggggggaagaaggggggggggggaaggaaaaaaggaagaaaaggaaagaaggaaaaaaaagaggaggggaagagaaggggagagaaaggagaaagaaggaagggggggagggaaaggagggggaaaagagaaaagaaagaagggaggagaggaggaagagaagaagagagggaggaagagggagaagaaaagggaaagagggagaggggggaggaagaggaagggaaaaggagaagagaaaggagaggagaaggggaggggggagagggaaagagaaagagagaggaaaggaaggaaaaaaggggagaggggggagagaaggaggagggggagaggaggaagaaagggaggaggaaagaaggggagagaaaaagaaaggggagggggaaaaagaaaagaaaagggggagggggggagaaagggaaaaaagaggaaagaaagggagagaaagaggagagggagaagaggaaagaggggggaggaaagagggggaaggaaggaggagaaaagagagagagaaagaagaaaaaagggggaggggggggaaaggagaggaaggaggggaagaagaaagaagaagaaagggaggaaagagggaaagagagggggagaagaagaaagaaaggggaaaggagaaggagggagaggggggaagaggaaaaggaaggaagaggaaggaaaagaaagggaggagaaaaggaggagagaggggagaaaaaaaagaaggagggaaggaaggaagggggaagaagggaagaggaaaggaaaggggagagaggaggggagagaagagggaaagggagaggagagaaaaaagaagaggggaaagaaaaaggaagggggggggaggaaagggaggaaaagaagagggagagagagggagaggaaaggaaggaaaaagaagggagaaggggaggggagggagagaaggagggaaaagaagaaggagaaggggggggagaaaggagaggaaaggagaggaggaaggaaaaaggaggaggggaggaaggaggggaggaaaaaagaggagggagaaggagaaaaagggaagagagaaagaggggagggaaggagaagagaggagaaggaaggaagggaagagggaaagaagagggggaaagaaaggaagaaaggagggggaaaagagggaaaaaaagaggggagggaaaagaaagagaggggagagggagaaaaagagaaaaagagaaaggagaagaagaggggaaagggaggaaaaggaggaggaagggaaggagggaaggggaaggaaggaaaagggaaaagagagagggaaaagggggagaggggagaaaaagagagagaggggaagggagggaaaggggggaaggaaggagaaaaaaaagggggaaaaagaagaaagggaggggggaaaaaaggagaagaaaaggaggaaaggggagggaagggagagaaggagagggagagaaagggggggggaaaaaggaggaaagagggagagaaggggaaggggaagaagaaagaggggagggggagggaagaggagggaggagggggaaaaggggaaagaagggggaagagaagaggaaggagagggaaggggaagagagaaggaaaagggggaagagagaaaaggaaggaaagaggaaaggaaggaagaaggaggaggaaaggagagggagaagaaagaaaggaaagagggagagaaagggagaaggaggaggaagaagagaggaagggaagggggaaggagaggaaaaggaggaggagggggaaagggaaagaagaggaaggaaagaagaaagagagaagggagaggagaaggagagaaagaaaagagaaaagagggagagaaaagaggggagggaaagagaagaaggagaaagaggaggggaggagggaaaggaggaggaagaaggggaaaggggaagggaaggagggagagaagggagggaaaggaaagagaagaaaaaaaggagaaaggagaaagaggaagggggaaggaggagaggaaagagaagaaagaagaagagaagaaaaaaggggaaaaggggaaaagaggaaagaaagggaggggaaaaagaaagaaggaaagggaaggaggggggggagagagaaaaaaaaggaaggaaaggaagagaggggaaaaggaagaaagaagaaggggaaaggaggaaagaagagggagaggggaggagggggaaggaaggggaggagaaaagggggggaaaaggggaggaaggggaggaaggaaagggagaagggggaaagaaggaaggagagagaaaaaagagaagagaagagaagagggaggaaaggagagaaagaaagggaagaaagggaggaaaggaggggggggaggggagaagggaaaaagggaaagaaagagggaaaaaaggaggagaagagagagagaaggagggggagaggagaaggaagagggggaggagagagggggagggaggagggaagaggagaggaaggggaagggaggagggggaaaaggagagggggaggaagggggaaggaaggggaaagaaagaaaggagaaggggaaggaaaaaaaagaagagaaagggaagggaagaaagaggaaggagaagaaaggaaggagaggggaaggggaggggggagaaggggaggagaagaaaaagggaggggaagagaaggaagagaaaagggggggaagaaagagaaaagagaagaaaaagaggaaaggaaaaaaagggaaaagagaaaggaggggggggaagaaaaggaaagggaaaaagaggaagggaaagagaaaggaggagagagagagagaggggggaggggaagaagggaaaagagagagggggaaggaagggggaaaggagagggggggaaaaagggggaggagaagagagaagaaaaggaaggaagaaagaggaaggaaggggggaaagagaaaaaaagggaggaggaagagaagggggagagggagagaggaaagggaaagagaaaaggaaggggaagagggaggggagaaaggggggaaaagaaaggagaaggaggaaaggaaaaaggagaaagaaagaagggagggaaggagagagggaaggggagggaaggaaaaggaaaggggggaaaagaggaaaagaaaaaaagagaaggaaaaaaggaggagggggaaagagaaagaaagagagagagagaaaagggaagagggaaggggggaaggggagggagaaggaaaagaggaggaagaggagaggggaaggaggggaaagaaggagagaggaaaaggaaagaggagagagaaaaaaggaggaaaaaaggaaaagggagagaaaagaggggaggagggagggagaagaagagaggggggaaaagggaagaagaagagaaaaggagaaagaggaaaaggagagaagggagaagggaaagagggagaaagagagaaggaggaaaaggaaaaaaagggaaggaggggggagaaggaggagaaaaaagaaagaagaaaaggggagagagaaaggaaaaaggaagggaaggggggaagaaagggaaaaaaaagagaggagagagaagaagagggaaaaggggagaggaagggagaagaaagagaagggagggaggaagaagagggggaaagagaaagggggggagaaagggggagaaggagaagagggaaggaagagaggagaaaggggaaggaggggagagaggaggggagggggagggagagggaagagaaaaagaagggaggagaaaaaaagagaaggagaaaggaaggggagaagaaagaggagggagaagggaaaagagggaaagggggaaagggaaaagaaagagggggaaaaggggaaaagaggagagagaagaagagagagggagaaagaggagaaaaaaaggagagaaaggaaagaagaaggaggaagagggaaagggaggggaggagaagagagaagggaaaaggaaagaaggaaaaaaggaggagagggggaggggaagagggaaaaaaaggagagagaaagagagagggggggggaaaagaaggaaaagggggggggagggaaagaaaagagagggaggaggagagaggagaaagagaggggaaaaaggaagaggagaaggggagaggaggaaaggaaaaagagaggaaaggagagagagggggggaagagaggaagggagaaggagggaggaagagagaaaagggagaagggggaaagggggggagggaaaaaaaggggggagggggggaggagaaaaggaaagggggggagagagaaaggagggaaaaaggaaagggggaaaggaaggagggaaggggagaggaaggaagaggaggggagggggagagggaggaaaaggaaggaggggaggagggggaggaagagggggaagggagggagaaaaagaaaaaaaagaaaaaaaagaagggaggaggggaggggaaaaagggagggggggagggaaagggaaaaagggaaggggagaggaaaaggagggaaaaggagagggagggaagagaaagagaagagggggagggagaagggaaagagagaggagaggaagagaggggaagagaggagaaaaaaggaaggagagaaggaagaaggagggaagagaaaagaggggagagaaaggaagggaaaagaggggggggagggaggaaagagaagagagggagagagaggaagggggaaggaaagaggaaagggggggaaagggaggggggaggaaaagaagaaaaaagagaaaagggaaagaaagaagggaaggaaaagaagagaaaaaggggggaggaggagaaggaaggaaaaggaaggagagagaggagaggggagaagggaagagaagagaggagagaggaagagaagaaaggaggaaggagaggaaaggaggaagaggaggaagaagagggagagaaagaggggagaaaagaagaagaaaaagaggggagagggagaagagaagaaagagaaggaagggagagggagaagggggagagggggaaaggaaaaaaagagaaaaagggggaaggaagggaaaggagagaaagaaggagagagaaaaaaggaaagaagaaggaaaggaaaaggaaagagaaaagaaggggaaaaaagggggagaggagggagagggaagggagaaaggaaagggaaaaggggaaaaaagggaggggaggaaaagaggaggaaaaaaggaaaagagggagaagggggaaaaagggggaaggaaggaggaagggaaggagggaaaagggaagggagaaggaaagaagggggaggagaagagaggagaaaaaagaggaaggagagagaaaggaaaggggggaaggagaggaggggaaggggaggaaaagggaaaagaggaggaggaaagagaaaagggaaggaggaagagaaggagaggaaaggaggagaagaagaggggggggaggagaagagaaaaagaggggagagagggggaggagaaggagggaaaaggagagaagggagaaaaagagagagaagaggaggaagaaagaagaaagagaagagagaaggggaaggaggaaaagaggaaaaagagggagggagaaagggggagggggaaggagagggaggagaggaaaggagggaaagggagaagaggaagagagaagggaggagagaaagagaaagaaggggaaaaaaagggagaggaggagaggaggggagagaaggaggaagaggaaaggggaggaaaagggaaaaaaagaagaggagagagaaaaaaaaggaaagaagaaaaggaggaagaaaaggaagggaaaggaggaagaagaaaaggaagggaggaagaaaagaaaaaagaagaaaaggaaagggaagggaaaaaaaggaggaggagaaggagggggaagaggaaaggaaaaaagaagaagaggaaaggggaaaggagaaaaggggagggggaggaaaaaggggaaagggggagggaggaaaaaagaagaggggggagaaaggagggaggagggagagaggaaaagaaaggggagaaagagagggggagaggggaggaaagaaggggagaaggaggaagggaggagggaagaaagaagaaggggggggaaagaaagaaggggaggaaaagagaaggaagagaaggaaagggggaaggaaaagggaagggaaggggaaaagagaggagaagaggagaggagaggaagaaaggaggaagaggagagagagggaaggaggaggaagggggggaagaaaaaaagagagaggaaggaagagggaaaaaagaggagaaggaaaaaaagggaagaggaggagaggagggaaaagaaaaaaggggaaagaggaggaaggagaagggggagaaaagagaagaggagagggggagagggaaggaggagaagaaggagaggagggagggaaggaaaagaagagagaaagagggaagaaggggggggaggaggaggggagggagggagaaaaaagaagggaggaaagagagagggagaaggggaggagaggaggagaaagggaaggagagaagggaaaagggggggagggaaaggagaaggggaaaagaagggaaagaggggaaaaaagagaaaaagaaggaggaaaagggggaaagaaaaggaggggaagggaagaggaaaaagggaaagggggagaaggagggagaagaaggagagaaggaaaagggaaaggggagagaaagaggaaagagaaggaagggaggagagggagaagggagggaggaaagagaggaggggggagagaaaaggagaaagaggaaagaaaagaaagaggagaaaggaaggaggaggagagagaagggagggggagaaaaagagagaggggaagaaggagagaggaggaggaagagaggagagagagaagggagaaggaggaggagagaggaaggaggagggggaggggaggaggggggggggggggagaaagaggaagggaggggaaaaaaaagagaaggaaggggaggaggagaaggaggaaagagaagagaaagaagaaaaaaggggagaaggaaggaaagaaaaagaaggaagagaggagagggggagaggagggaaaggggaaaggagaaggggagggggagaaaaagaagaaaaagaaggaggggaaggggagggggaaaagaagaggggaaaaagaagggaaagagaagaaggagaggaaaggaaaggaaggagggaggaagggagggaagaaaggggaagaaggggaaggaggagaaaggaggggaagaggaagagagggggaaggagagaggggaaggagaagaagaagaaagaaaagaaaaaaaagaggaggaaaaaaaggagagaaggagaaagaagaggaggaggggaaaggaaaagggggagaaggaaagagggggggggggggggaggaggaagaaaaggggggggggagaaggggggagaggaggaggaagagggagaaaagagagaaaaaaaggaaaggggaaaaagagaggagaagaagggaaaggaggaaaagaggaggggaaggggaaaaaaggaggagaggagggaaaggaaaaaaaagaaggaaaggaggaggagagagaagaaagggagaggaaagggaaggggagagagaagaagggagaaaaggggagggaggaagagaagaaagagggagagaagggaggaggagaaaggaaaagagggggggagaagggaggaggggagggggaaggaggggaaagaaaaagggaaaagggaagggaaaaaaggagaaagggaaaagagaagggaagagaaaagggaaagggaaagaaggaaaaaaggggaggaaaaggaaaggggaggggaaggagggagaggaggggggagaaaagagagaaaggagggaaaagagggaaaaaggaaaagaagaaagagggagaaggaaggggagggaaagaagaaggggggaaaaaagggggaggaagaagaaaggaaaagaggagaagaggggaaaaaaaagggaaaagagagaaaagaaaggaggagaggggagaaaagaaaaagggaagggaaaggaaaagaagaagaaagagggagaaggggggaaagaggaggaaaaaaggaagggagggaagggggagagggagaagggggggagagaggaagaaaaagaaaaaaaagagaaagaagagggaaggagaagaaagagaaaaaaggaagaggggggagggaaagggggggaaaagaaaagagaggagaggaaggggggaaggaggaagaggaaagaagaagagaggggaagaaggaggggagagagaggaaaaagggaagagaaggagagaaaggaaaaaaagaagaggggaagagaagaagagagaaaaaagagagaagaggggaagagagggaagagaggaagaagggagaaaaagaagaagggaggagaagaagaaaagaagaaggaaagaaggaggaggggaaaggaggggggaagagggagagggggaggaaagaggaaggaaagagggagagggaaaggaagagagagggagggaggggggggggagagagaaaaagagaaggaagaaagggagaaagaggggaggaggaagggagagaggaggaggagaggaaaaggagggagaagaggagagaaaagggagaagagaggagggggagggggaaaagagggagaagaggaggagggaggggaaaaaggaaagaagaggaaaaagggggagagaaggaaggggggaaggaaagaagagaaaggggggaggagagaggagagggaggaagaggaaagagagagggagggaaggaaagggggggaaggggggggaaagagaggaaagaggggaagaagagagaaggaggaagagagggaagagggaaaaaagggaggggaaggaaaaagaaagaaggaaaaagggaggggaaaaggagagaaagggaaaagaaaggaggagaaaggaaaaaaaaagggagagaaaaggaagaaaaaggagggaagaaaaggagaaaggaaggaagggaagggagaagagaggaaggggaaaggaagagggaggggggaagggagaaaagaggggaagggagaggggagagaaagaaaagggggaaagaaaaaggaaggaaggagaggggaagaggaaaagagaagaaggagagagggggagaggaggggaagaaagaagaagaggggagggaaggggggggaaagagggagggaaagggagaaggagaaggaggagaagaaaggaggagagaggggagggagaaaaaaaaagaaggaggggaggaagaagaagaggagaagaggggagagggagaagagaagagggaagagaagaagaggagagggggagagaggaggagaaaagaaaagaaaaaagaaaggaaaggagaggaggaagaaaaggaaggaggggaagggaaaaggggggaaaagagaggagaaggaaaaaaaagaaggagaaaagaaggaaagagggagaaggagaaaggaggaggagagggagaaggggagaaaaagggaaggaagggaagggggaggggggaaaaagggaaaaaggaaaagagaggaggaaaagggggagaggggagaaaaaaggagaaaggggagaggaggaggaggggggaagaagaaaaaaaaaagaaggggaaaggagagagagggagggggaaaaaaaggagaaggaaaagagagaagaagaggagagggaggggaggagagagaaaggaaggaggagggaaaaaggagaaaagaagaggaaaagggaaaggaggggaagaaaggggggagggggaaggaagaggggagggaagggggaaggggggaaagagggaagaaggaagggagaagaaaagggaagagaaggagagaggaaaagggggagggagagagaagagggggaagaggaaaggagagaggaaggagaaggggaggaaaggaagagggaaaaagggaaagagggagagagaaggaggagggggagaaagaagagagaagggaaaaaggaggagaaaggaaaaagaggaagagagggaaaggggaggaggaggagaaaaagaggaggaagggagaggaggggagaagaaggaaagggaaggagagagaggggagaaaaaagaaggggggggagggaaaaaaggggaaaggagaggggaggggggagaggggaagaaaggggggaagagggaaagagaaaaggggaaagaagggagggaaaggagagaggagaaagaaaggagagaggagaagaagaaaggggaaaggaggggagaaaggagggaaaggaggaagaggagaaaaaaggagaaaagggggaagaaggagagaaggaaagggaaagagaaaagaaggaaagggaaggagagaggaaaaagggaaaaaaaagaagggaaaagaagagagggggaaaaggagagggaagaaggggaaaggggaaaagaagagggagagaagagggaaggaaaagaagagagaaaagaaagaagaagaaaagagggaaagagagagggggggaaaaaggaagggagaaagaaagaaggaagaggggagaaaagagaagaagggaagagagagggaaaggaaaaaagaaggaaagaagagggaagaaaggaagggggagagggaaagggagagagagggaaaagaagaaggaaaaaaggaagaaaaaagaggaagaagaaggggaagaggagaaaggaggaagggagaagagaggaggagagggaagggaagaggagagaggggagaagggagaaggaggagagggagaggaggaaaagaggggaagggaagggaagggaaaaaaggaagagaaggaggagaaaaaagaaaagggggaggaaggaagaaaggggggggggaggaaaaaaagagggggggaaagagaaaggggaaaaggggagggggggaaagagggaggggaaaagaaggaaaggaaaggagggggaagaaagaaagaagggaaaaaaaagaggaaaggaaaaaaggggaaaggaaaagaggaggggggaaagaaaaggaaagggagaaaaaggaagggaaaaagaaggaggaaaagggagagagaaagggaaggggaaggggggggaaaagagggagggaaggaagagggaaaggggaagggaaaaaaaagggggaaggaaagagaggagaaaagggaggaaaaaagagaaaggaaggggggaaaaagagaaaaagggaggaagggaagaaggggaagagggagaggggagagggaaaaagagaggaaaaaggaagagagggagaagaaaaggaaggagagaaaggaggaggggggaaagagaaaggaggagaaaggaggagagggaaggagggaggagagaaggggaaaggggaaagaaaggagaggaaaaagaaaaaggaaaaaagagaaaaaaagaaagaagaaaggggaagggaaaaaaggagggaaagagaaaagggaagagagagggggggggagggggggaaaggggaaggagggggaaaaggagagggggaggaggggagaaagagagagagggaaaggaaagaggggagagaggaaaggagagaagaaggggaggaaaagaaagagggggggggagagaggaagaagagaaaagggaagaagagggaaaaaaaggggaagaggggaaaggggaagaggagagaagagaaaaagggaggaggaagagagagggaagaaggagagggaaaaaaaagggaggggagggaagaagaaggagaaaaaaaagggaagaaaagaggggaaagaaaggaaaaaaggaggggagggggggggaaagggaaaagaagaagaaaagagggaaaagaggggaaagagggagaagaagggagaagaaagaggagaagagaaagaagaagagaggaaaagaagaagaagggggagaagggggaggagaagaaggagagaagaagagaggagaaaagagaaggaggagaaagaaaaagggagggggaaagagaggggagaaaaggagaagggaggagaaaagaagagaaagagaaagggaggggaggggaggggagaaggaggaaggaaaggagaaaagagaggggagggaggggaaagaaggaaaaaagggaaagagaggggaggggagaagggggggggaagaagaaagggaaaagagggaagaaagagaagaaggaaaaaggggagggaaagggaggggaggggaaaagaagaggggaaaggagaaaagggagggggagagagaggaggagggggggagagaaagagaggaaaggaaaggaaagagggggagggaagagaagaaaaagggaggaggagaggaggaagggagagggggggggagagagggggaggaaggggggaagaggaggagaggaagggaaggggaagaaagggagaaaagagggaaggaaagagggggggagagaagaagaaggggggaaggaggaggaagagagagaggggagaaaggggaaagggggggagagagaaaaaggggagaagaggagaggaaaaaaggaaaggaagaaagagggggaggaagaagaagggaaagaaggaaaggaagagaggaaagaaagaaaaagggagagaaggggagggggagagggaagaaggagaaggaggagagggggaagaggaaggggggggaaggagggagagagaaaaaaaaaagagagaaaggaagggaggaggggagggaagaaagggaaggagggggggaaagggagaaaaaagaagggaggggaaaaggggggagaaaaaaaggggggagagaggaagggaagaagggaggggaaaagggggagaaagaggagagggagaaaggggaagagaagagaaaaagggaaggagagaagaaagaaagggggagggaggaaagggggggaaaaagaaaggagaaggaggggggggagggaggaagggggagagaggaagagaagggaggggggaagaaaagaggagagggggggaagagaagggggggggaaaagaagaggggaggaagagggaagagaaagaaagaaaaagaagaaagaggagaagggggaaggagaaagaagaagggaaaaaaaggagagggagagggggggaggaaaaaagggaggggaagaaaggggagaagaaggaaggaaaagggagggaaagaaagaaagaggaggagagggagggagagaaggaggggagaaaagaggaagagaaagagggggaagggagaaaaaaagaaaaaaaaggaaagaggggggagaaggggaagagggggagagggagaaaagagaaaaggggaaaagggagggaaaggggagaaaggaggaaagaaaagagaagaaagaagaagaaaagaaaaaggaaaggggaaagaaggaaaagagagaaagaggagagagggagggagggggggaaggagagggaaaagggaaaaagggggggaggggaaaaaggagaggaaaaagggaaaaggggaagaggaggggggaggggagaaagagggagagaaagaaggaggaagagggggagggagaaggaggggagaaggaggagaggagaggaggaaaaaggagaaggagggaggaaggaaaagagggaaggaggggaggggaaggggagggaaggaaaaaagaaaaggagaaaagagaagaaggaagagggaagaggaagaaaggggaagaagaaagaaaaaggggggaaaggagaaggaaaagagaggggggagaaggggaggagaaaagagaaaagagggagaagggaaagagagagagggaagagaaggaaaaaaaaagaaggaggagagagaagggaagggagaaaaaaagggaaaaaggggagaaagaaaggggggggaagaaggaaagggaggaaaggaagagagggagaaggaaaagaagaggggagaagggggaagagaaagggaagggaaaggagaaagaaaaagaagaagggagaaagggaggaaaggaaggaggggaaaaaggaagagaaaggaaaaagaggaaaagggaaagaagagaagggggagaggaaaaagaggaaaaaaagggaggggaagaggggagaaggagaagaagagaaggaggaaagaaaaagaaggggagagagaagagggggaaaaaaaggaggagaggaaaggagaggaaaggaaaaggaaaaaagaagaggaggggaaggaaaaagggaaaaaggaaggagggggaaagaggaaagaggaaggagaaagaagaaaaaaaaagagagaaaaaggggaggaaaagaaggggggagaagaggggagagaaaaagaagggaagaagagaagagagaaggaaaggagggggggaagaggaaagagagaaggggaaggggaggaggagaagaaaggaagggaaaagggggagagaaggaggaaagaagggaagaaggaaggagggaaggggagaagagaggaaaggaggagaggaaaagaaaaaaggaaggagaagaaaaagaaggaaggagggagaaggggggaaaggggggaagagaggagggagaagaggggaaaaagagaagaggaagaagaagggagggggaggggaagagggagaagaaaaaaggggaggaaggagaaggggggggagaaggagagggaaagagggaaggaggggggggagagaggagaggaaagagggaagggagggaaggaaaagaggggagaaaaagggaagaagaaagaggaggaggaagagagagaaggaggggaaagaagggaggaaggagagggggaagaggagggggggggaagaaaaggaaaagaaaagaaggaaagggaggggaagggagaggagaaggggaaaggaagggaaggaagggaaagaaggggaaaagaagaaggaggaagaagggaggaaaagaagggaagggaaaaaaaaaaagggaagaggggagaagggggaagaaggggaagagaaagaaaaaggaaaggggagagagagaggagagggaaggaaggaaggagagaaagaaaggagagaggggagagaaaagggggaggaaaaggggggaaagagagaagaaaaaaaagagaagaaaggaggaaggggggaggagaaaggaaggagggaagaagagagaagggaagaaggagagaagaggggggagaggggaaagaaaggagagaggaggaggaggggggaggagggaggagaaggaaagggagagaaggggggggagaaggaagagagagagagaggagaaaagaaaggaggaaggggaggagaagaaggaggagagaagagaaaaggaagaaaaaaggagggaagagaggagagaggaagaaggaagaggggagaggggaagggaagggaaggaggaaagaagaagaggaggaggagaaaaagagggggaaaaaagagaggaaggggggaagggaaagagggaggaaaaaagaagggaaagagaggagagggagaagaggggaggggagggggaggaaagaagagaaaaaaggagaagaagaggagggaggaaaaaggaaagggagaggaagagaggaagagagaggggggaaaggaaaaggaaggagagaggaaagaaggaaaagaggaggaaaaaaaagagagagaaagagagaagaagagggagagagagaagaaaggagagggggagggaggggagggggggaaggggaggaagaaaagagggggggaggaggaggggaaaagagaaaggagaaagaaaagagagagaaaaaaaagagggggggggaagaaggggaaagaagagagaagagggaaaaaaggggaaaaaggaaagaagaggggagggaggggaaaagaaaaaaaagaagggaagggggaggagagagaagaaagagggaggaaaaggaagggaagagagaagaagggagaaaggaagagggagaaagagaggaaagaggaaaggggaaggggaggaaaaagggaaagaggggaggagaaaagaggaggggggaagaaaagggagggaagaaaaggggaaaaaaaaggggggaaaaggagaaagggaaagaggaggggaagagaaaggagggaggaaaaagggggaaaaaggggagaaaaaggagaagggagagagagaaaaggggggaggggaaagagaagaggaaaaggagggaaaagaaggaaaaaaaaagagaagagagaggaagaaagaggagaggagaaggaaaaaggagagaaaaaaaagggagggagaagagaggaagaaaagaggaggggggagaaagaggggaagggagggaagggaaagaagaggaggggagggaagaaaaaggggaggagggaagaaagaagaagaaaaagggagaggagggaaaagaggagggaaaggggggggagaggggaggggaaagggagagaggggggagggggggagaaggaggaagaagagagaagaaagggggaaagggggaaaaaggagaaaggggaggaggaggggagagggggggggagagggaaggggagaagggaaaagggggaggggggaagaagaaagaagaaaaaagaaggggaaggaagggagagaggggggagagggaaaagaggaaggggaagggaaagaaaaagagaagaggagaagaagagagaaaaaaaagagaagaggggaaaagggggaagaaagaaagaaggaaaggaaagagaaaggaaaagggaaaagaaagggaaaaagaaaaaaggagggagggagaggagggggggagagggaaagagggaggaaaggaagaggaaagggagaggggaagaaaaagagaaaggaaagaaagggggggagagaaagagaaaaggaaagaagaaaaggagaaagaagggaaaaggaaagaagagaggaagagaggagagaaaggagggagaagaagggagaaaagagagaggagagggggggaaggaggaaaggaggggagagagaaaaggggaggggaaaaaaaaaagaaagggaagaaggaggagagggggaaggggggagagaaaaaagagaaagaaaggaggagagagaagagggagggaaaggaaagagagggggagggaaagagagggggaggagggggaagaaaaagaggagagagaggagagagagagaggggggaagaaggaggagggggaaaagagggaaggggaggaaaaagaaggaaagagaaagggaggggaaaaagagaggaaggggaggaaaagggggggagaaagaaaaggaaaagaggggagggagaaaagaaagaagaaagaagaggggaagggaaggaagaggagggaggagggagggaggagaagaggggaggggggggggaagagaagaaagaagggagaggggagaggagaggaggaagagaaagagagggagggggagaaaagagagaggaagaggaaaggagggagagaaaagaggggagggagaggaaaagagggaagaagaggagggaaaaggagggaggaaaagagagagaaggggggaaagagaagaaagagaagagagggagaggggaggagaagaaagaaagaaagagagagaaagggaaaaagaagggggggagaggagagaggaagaagagaaggggaaagagaaggaaagaagaaggggaaagagagggaagaaagaaaagaaaaaagaaagaaaaggaaaagaaaaagaaaaagaaagaggggaaggaaaaaagaaggaaaggagaggaaaagggaagaaaggaaggagaaaagaagaaaagaggggggaggagaaagaaggaagagagggagaaggggagaaaaaaggaaggagaaggaggggaaggaaggagaagggaaggaaagaggagaggggaagaaagggaagagggaaagaagaaaagagaaagagggagaaaaagaggggaaggaaagaagaaaaaaagaagaaagaggaaggagggagaggggagggaaaaaagaggaggaagagaagaaagaagaagagaaggggggagggaagagagagaagaggaggagaaagggagaaggaaaaaggaaaaggaagagggaagagaggggaagaggagggggaggaaaaagaagagggggagggagaggaaaaggaggggagaagagaaggaggaagagaggagagagagaaaaagaggggggggggaaggggaggaggaaaaagggagaggaagaaggaaaaaggagagaggagagaaaaggggagaaaaagaaaagagaaagagaaaaggagagagagggaagaggggggggaaaagagaagagagaagggagaaaggaggaaaaaggaggaaaaagaagaaagggaaaagggggaagggaaagaagaagagaaggaagggagagaaggggaagaaagggaaggggagggaaagggagagaaaaaaagagaaaagggaagagggaagagaaaggaaaagaggagggagagggaggaagggaaaaaggggaagaaggagaaaagagggaagaggaagaaaaaaaggaggaggggaaggggaagaggggaaaaggaaggagggagaaaaaaggaggggggggaagaaggaaaggaggggaggaaaagggagagaagggaagaaagggaggggagggagagaaggaaggggagggagaaaggaagggaagaaaagaagaaaagaagagaggaaaaaagggaggggaaaagaggagaaggggaaaagggaaggaaagaaagaggaagaggagaagaaaagggaagaaagagggaagaaaaaagaaagagaaaaggagaaagaagaaaagaaggaaagagagagggggagaaaaaggagggaaggaggggagaagggagaggggagaaaagagaagaaggggaagaaaagggaaaagagagggaggggaaggaggagggaagaaagggaggaggagagaaaaagggagggggaggaaagaggaagagggggaaaagaaggagaaagaggaagaaaaaggggaaggggaagaaggaggaaggaagagggaagaaaaagaaggaaaggagagaaaaggagggaaaagggaagaaggaagagagagagagaaggaaaagagagaagaagaagggaagagggaaaagaaagagaaggaggaggaaaaaaaaaagggggaggaaggaaggagggggggaagaaggaaaaagggaggggggagaagagaaaggaaaagaaaggaaggagggaaagggagaggggggaagaggggaaggagggaaaggggagggagagaaggagggaaaaaaaggaggaaaggaaaaaagggaagagagaaagaagagggaggaaaaaaggggagagggagagaaagagagggagaaggaagaagaaaagaggaaaggaaaaaagaaggggggggggggggaaaagggggaggaaagaaagagggaaaaggaaagggaaagaaggaggaaaaggaaagagagggaaggaggggggagaaaaaggaaggaaaggggagaaaaagaggaagaaggagggagggaaggaagggaaaagaaaaaggggagaggagagaggagagaaagaaagaagaaaggaagagaaagagaaaggagagaaaggaggaggggggaaaaggaaaaggggagagggagggaagagggagaaagggagagaaaaagggaaaagggaaagaaaagaaaggaagaagagaaaggaaaaaaggaaaaaaaagagaggaggaaaaggaaagaaaaaagggaggaaagaagaaaaggggggagaaagagggggggaggggagagaaggggagggggaggggaaagaggggggagagagagagaggaggagaggaggaggagggaagaaagggagaaggggaaagggagaagagggggagaaaaagagagagggggggggggagagaaaagagagagaggggaagaggaaggaaaaaaagaggaggaaagaagaagaaaggaaggaaggggagaaagaaagaggagaaggagagagggaagagggagggggaaaagaaagagaggggaaggaagaggaagggggaaaaaagggggagaagagaaggaaaaaaaaaaaaaaaagggggggaaaaagaggaagggggaaggggagaagaaaagagggagaggagaggaaagagaggaaagaggagggaggaaagaggagaagaaagaggggagaagaggagaaggagaagaaaagggagaagggggaggaaagaaaggagaggaaggaagagaagaagagagaaggggaagaaaaaaaaaagaggaaagaaaggggaggggggaaaggagagggaaggaggaaggaagggagagaaggaaggggggaaagggaggagaaaaaggggaaggagaggaaaaaagagagaggagagaggggaaaaaaggaaagaggggaaagagaggggaaggggggaagagggaggaagaagaaaggggaaagagggagggaagagaagggggaaagaaggaggggaaggggagaggagggaggaaaaagagggggaaaaggaagggagagggggagaaggaggagaagaggggaagagagagagaaaaaaggaaaggaaagggggggaaaggagagaaaaagagaagaaaaagggaggagaaagggaaagaaggggagagagagggggagaaagagaagaagaaagggagagggggagaagggaaagagagagagagaaaggagagggaagaagggggggagagaaagaaaggaagagaaggagaaggaggagggagagggggagaagggaaaagggggagaaagagaagagggggagaagaggaagggaaagaaagaaaagaagaagaaggggggggaagaggaggagaaagaagaagggaaaaagaggagaaaaagaaaaagggagagagggggaggagggggagggagagggaaaaggaggagggggaaaaggaaggggggaaggaagaaagaagagagaagaaagagaaagaggaagaaagggagaaggggagggaaggagagaaaaaaagggggaaaggggggggaaaagaagggaggagagaggagaggagaaaaaaaagggggagaggaggaggaaggaagggagaaaaagaagaggagaaggaggagagagagaaaaaagaagggaaggagagaagagagggaaaaaaaaaagagagggagagggaggaaagggaggggaaaggaaagaagaagaaggggagaaagggaggaggggggagagggaaaaagaaggaagaggggagaaaagaagggggggagggagagagaagagaagggaaagaggagaggggaagaagagggaagagaagggaagaagaaggggaaggaggagaggggggaaggagagaggaggagaggggaaagaaagaggaagagggaagaaaggaaagggggagggaaagaaaggggagaaggagggagggaaggggagggaaagaaagaaaggggaaaggagggagagagagggggggaaaagaggggggggggagaagaaggaagaaaggaaaaagaaaaaagaaagagaaaagagagaggggaagaggaagaagggaggggggaggagaggggggggaagaagagaggaggagagggaaaagaagaggaaagaagggagaaaaaaaaaggagagaagagaaaaggagggggaggaaggaaaaagagggaaaagggagggagggagagggggggaggaggggagggaggagagaaagagggggggaaaggaaaaaggagaaaagagaggaggaaagggaggaggaggggggaggaaaaaaagagggagagaaagaaagaagaggagggaggagggggggaggggggaaaggaagggagggaaggaggaaaaaggagaagaagggaggaagggaaagagggaaagggggaagagagaggggaagggaggaaaaaaggaaaggagaaaggggaggaaggaaaaggagggaagaaggagggggaagaaggaagaaaagggggagaagggaggaggagaaggagaaagggagaaaaagaaaagaaaagagaaaagaggaaagagggaaagagaggaaaggagagaagggaaaggaaaagagggaggaggaaagaaggaaggagaagggaaagagaaaaaggaaggaaagaagggggaggaaaaagggaaaagaagaaaagagggaggaggagaaggaagaaaaggggggaggaggggaaagagaaaggagagggaaaaagggaagaaaaaggagaaggggaaaaaaggggaagggaaagggggaagaaaaagagagaaaagagagagaggaagagggaaaggagaggagagggaaggggaggagagaaaaagaagggggaaggggaggggggagagagaaaaagaaaaagagggaaaaaaaggaagaggggagagaaaagggggagaaagagggggggagggaaggagaagaaagaagagggagagaagaagaggagaggaagaaggaagggaaaaaggaaggaggggggaaggggaaagaaaaaggaaaaagaagaagaaaaaagagaggaagagaggaagaaaaaaaggggaaggaaaaggggaaaaaaaaaaaaaggaaggagagaagaggagaggaaaagaaagaaggaaaaggaaagagaggagggaaggaggaaaaggaaaagaggagaaggaagggaggggagagaagggaaagaaaagggaaggaggaaagagggaagagaaggggggaagaagggaggagggagaaagaaaggaggaaggagaaagaaaaggaagaggaagggagaaagagagaaaggggggaagaaaagagggagaagaggggaaaaggaaaaaaggagggaggaggaggagaaagggggaaagagagaagaggggagggggggaaagaaagggagggggagaagaggagagaaagagagagggagggggagaagaggggagagggaagaaggaaagagggggaaaaaaaaaggggagagaaagggaggaggaaagagaggaagaaaaaagaaagaggaagggagggaagggaggaggggaggggaagagaggagggagagggaaagaaagaaaaagagaagggagaaggggagagaaaaagggaggagaaggaggaggaaagggaagagaagggagggaagagaaaggaagaaagggggagaagggaggagaaggagggagggaaaaaaagaaaaaggaggagggaggggaagggagggaggggaggagaaagaaaaaggaaggggaagaaggagaggagagggaagaagagaaagagagaagggaaggagaggagggagagaaaagggagagaaagagggaggaaggaaagagaaaggaaaagaaaggaagagggaaaaggaggaggggaaagagaaaaagagaggggaaagaaggaaagaggaagaaaagaagggggggagggaaaagaaaggaaagaagagggggaggggggagaggagagggaaaggaaagggaaaaaagaaagaagagagggaaaagagagagagaggggaagagaagggagggaaggaaagagaaggagaaggaggggagggaagagaaagaaaggagaaggagaaagaggggagagggagggaaaaggggaaagaagggaagggaggggaggaaggaaggaaaaagagggagaggagaaaagaggagggaaagaagaaagagaggaaggaagggggagggagagaaaaaaagagaagagagagagaagaaggagaagagggggagggaggaaaagagaagaagaaaaaagagaagaagagaaggagggaaaaagaggagaaggggggggaaaaggggaagggagaagagggaaaggagaaggagggagagaaggaaggagggaaaagggagagagaaggaaagaaagaaaaagggggggagagggagagggggaagaaaagagagggagggggggggaaaggaagaaaaggagagaagggaggaagggaagagaaggaggggaaaagggagaagagaaaaaaaagagaaagggaaaaaagaggagggggggaggaggggaaggaggagaggaaagggaagaaagggaaagaagaaaggaagaggggagggaggagaaaaggaaaagaagagagggagggagaaggggaaaaaaaaaaaggaaggaaaaagaaaaaaagagaggagagggaaagaagaaaaagagagagaaagagaagagaggagaggggaaagagaggaagagggggaagaggggagggggaaaaagagagggggaagaggagggagggaaagaaaggagaaagaaaagagggggaaaggggaaggggaaagagggggggaagagaaaggagggaggaaaaaggaaggagaaaaggaaagaaaggaggaggaaaagagggaaaaagaggaaggagaaagaggggaagaaagaaaagaaaagaaaggaggaaaaaaggaaggagaagagaagaaaggggaaagaagaaggaaaaagaagagaaagaaaagggggggagaagagaggaagaaaagaggaggggggagagggggaaaaggggggggaaggagaagaagaggagggaggggaggaaaaagaagggaagggaagggaaagagaaggaaagaaagggaagagaaaagagaagaggagggaaggggagaggggaaggggaaaggggagaagggaggggagaagagaaggaggaggaagagagaagaaggggggggagggggaaagagaagaagggggaggagaagagaaaagggagggggaggggggagggggaagaggaggagggggagaggggaagaagaaaaggaaaaaaaaaagggggaggaaagaaaagaggagggagggaaggagggggaaggggaaaggagaggaaaaagaaaaaggagggaaagagaaaggaaaaaggggaaaggggaaaaagaaaaagaaggaaaaagggaaagggaagagagggaagaagagaaaaggaagaggagaagagaaaagaggagagggagaagggggggggggaaggaaggaaaaagaaggagaagaagaaagggagaggagaaggaagagaggagggaaagaaaggagggaaaggaaaaagaaaaggaaagaggagaaaggggagaaaggaaaaaagagagaagagaagaaaaaagaggagaaggaaggaaaaaaaagggggaaaagagagaggggaaggggaaaggaaaggaaggaggggagggggaaaagggaaaaggaaagaaaagagagagggaagaaggaaagagggggagaggagagagagaaaaaagaagaagaaagaaggggggagaagaaggggagaaaaggaaggggagaggaggggaagagagggagaagaaagggaaggaaaagggaggaagaaggggagagggagggaggagagaaaggagggggaaagaaagagaaaaggggaggaaaaaggaggaaagggaagaggaagggagaaagagaggaagggggggaaagagggagaagaaagaggaggaaaagaagggaggaagaagagagagaagaaggaaggggggaagaaagggaggaagagggaagagggaaggaagaagagaagggaggagggggaagaaaagagaaaagagagagaagggaaagggaggggggaggagaaagggggggagggggagaaaaaaaagaagaaaaggaaaggaaggagagagagggggagagagaagggaaaaaaggggaaaggaagagggaaagaaaaggaagagaagaaaaaagagggggagaaagaaggaaagaaaaaggaaggagaggggaagagaagaaggaaaggaaaagagaaaaagagagaaggaaaggagggaggagagggaggaggaagaggaggggaggaaaaagggaagaaaaaagggaaggagagagaagagagaagagaaaaaagaaagaaaggggagagaaagggagagagggagggaagaaagagggaagaaggaaaggagagaaaaagggaagaaaggaagaagaaagaaagaagagaaggggggggagggggagggaagagaggaagagggggaggggaaaggaagaagaaaggaggaaaggaaagagaagggaagggaaaaggagaggagaagagagagaaaaggaaaagaagaaaagagaaagagagggaaagagaggggaaaaaaggaagaagagaggaggaaaaaaggaggaggaaggagagagagaaaggagggaaggaaggggaagaagaaaaaggaaaggaaggagggaaaaagaaggagaggaggagaaagggagaaaagaaaggagaaaggaaggaaaaagagaaggaaagaggagaggggggaaaaaaaagagaagaagggagagaaaagggagaagagaggagaaggaggaggagagggaagagaaaaaaaaaggggagggggaaggggaggaggaaaaagggggaggaagggagaaagaagagaaaggagaagaagagggaaagagaaagaagagaaagggaaaagaagagggaagggaaagaggggggagaagaaaaaagaaaagagaggaagaaggaaaagagagggaagagaaaaaaggggaaagggggaagggaaggaagaggagaaggaagggagaaaaagaaaaggaagagaaggagaggaaaggggagaaaaaaaagggagaaaagaaagagagaagaggaagaggaagaggagaaggagagaggaaagaagaaaggggaaaaaggaaaaagaaaggaagagggagaagaaagggaggaagggaagaggaaggggggaaaaggaaggagggagaaaaaaagaggagggagaaaaaggaaaggaggggggggaaaaggagagaaggaaagaaagagaggggaggggggagaggaaggagagggggaaggaggaggagaaaaagagaaaaagaagagaggaaagggggaaggagaggaaagggagaggagagaagggagggaaggggaaaagaggagaaggaaagagagggagaaagagagaagaaggaaggaagagaaaaggggaaaaaaagagaaaaagaaggagaagaggggagagaaagaaggaaaagggaggaaaggagagagaggggaaagaggaagaaaggggagaaaaaaggaaagagagggagggaaaggagggaggaagaaggggagaaagaggaaaaaagggaaggggaggagggagggagaagggggagaaaaggagaagagagagaggaaaggggaagggaaaggaagaggaaaaaggagggaggaaaagaaagaaaagaggagaagaggaggaaaaagaaaggaaaaaagagagaaaaagaaaggaaagaaaaaggaagaaagaaagagggaagaaaaagaaaaggaagaggaagggagaagaggggaagaaagggagagggggggaagaaggagaaagggagaggaaagaagaaaaaagaaaaggaaggaaggaggggggggaagagggaggagggggaggagaggggaaagagaggggggagaggggggagaagaaagagaagaaaggggagagaaaagagagaaagaagaaggaggaggaaaggggggagggagagaaaaaggaaagggagagggaagaagagagagagggagaaaagagaagaggagggagggagaagggggaagagaaaagaaaaaagaaggaaaaggaaagagggaggaagaagagggaaggggaaggggaggaaggagagagaaagaagagaagaagagaggagggagaaagaaagaaggaaggaagagagaaaaagaaggagggaaaagggaggagggaaagaaaaggggaaggaaaagaaggaaaaaagagggaaaaagggggggagggaaaggaggaagggggagggagggaagaagggaagagggaaagaaaaagagaagaaggaaaagggagaaaaggggaggagagaagagaagaggaggaaagggggaggaggaaaaggaaagaggaagggaaagaaagaagagggaagggaggaaggagggaaggagaagaaagagggagaggggaagagggagaagggggaaggaagagagaggaggaagggagaaggggggaagagaggaaaaagggggaaggaaggggagaaggggaaaaagagggagggagaggaggaaagaaaagggagagaggaaaaggggaaagggaaaaggaggaggaaagaagaagaaggggaggaagggaaagaggaaaggggagaaggagaagagaggaaggaaggggaagaggagaaagaaaggaaggaagagaaagagaggaaaaagggggagggggaaaagagaaaaagaagggagaaggaggggaaaagaggagggagggaggggggagggaaaggaggggaggagaggggggagaggaaaagggaagggggaggagagaaaagaaagaaggaagagaaaaaggaggagagaaaaagagagaaaggagaagaaagagaggagaggaaggaaaaaaggaagaaaggagagaaaggagaaaagaagagaaaaggaaagggagaggagaaggggaggagagagaagggggagagaagagaagggagggaaaaaagggaggagaagaaagggaaagagagggaaagggaaaaaggaaagggggggaaaaaagaaaggggaaaaagaaggggggagaggagaagagagagaaaggggaaagaggagggaaagagaggaaagaaaggaggaagaaggagaagggggaagaaaggaagaggaaaaagggggggaaaagggaggaagagggggagaaggagaagaagagaggaggaaggaggggaaaaaggagagggaagggggggaaaggggggagaaagagaagaaaaagggaagagaagggggaaaaagaagaagaagaaagagagaaagaaaaggggaaagggagagggggaaaagggagagaggaagggagagagaagagaagagagagaggggaaggaaagaaggaaagaggaggagaagaagggagaggagaaagaggaaggaggaggagaaggaagagaagggaaggaggagagaaagaagaaggaagagaagaaaaagagggggggaggaaagggggaaaggaaaaagggaaaaaagaagggaaaaggaaagggagagaaagaagaaagaaagagagggaaggggaaggaggagagggggaaaaagaaggggggaaagaagaaagagaggaggaggaagaggaagagggagaaaaagggaggagaaaagaaggggagagaaaaagggggagggagagggggaaaggaaagaagaaagaggagaggagaaaaaaaagagaaagaagagggagaggggagggagaaagaggagagggagagaaggaaggagaaaagaaagggaggaaggaggggggaggggaaaaaaaaaaagggaagaaaagggagggaagagaggggaaggaaggaaaggggagaaaaaaaaaaagagaaggagggaggggaaagaaggaggaggaggaaggaagggaagagggggagggagggaaagaagaagggaggggagggagggggagaagagagaggggaagggaagaagaaggggaaggaagggggggagaaagggaagaggagggaaggggaaggaagagggaagagggaaaaaaggaaagggggggagaaaagagagagggaagggaggaaggaagggggagaagggaagaaggggaaaaaggagggaaaaagaagggagaaaaaggggggggaggaggaggaaaaaagagagggaaaagaagagggagaggaaggagagagagggaagaagaaaggagaaaggggggggggggggagggggaagaagggaggagagggaagaaaaggagaaagaggaaggggggaagagaggagagaggggaggggaagagggagaggaggaaaaaggaggaaaaagggaaggaggaaaagggggagagggagggaaggagggaagagaggggaaagaaaaggaaaagggaagaaggggaggaggagagaaagaaggaagaggggggaaaaaaaagggaggagaaagagagaagaggggagaggagggagggagggaggaaagaaaagaagggaggggggaagggagagaagagaggggggagggaaagaaagaaaagaggaagagagaagaagaaggagaaagaaaagaagaggaaaggagaagggagaggaagaagggaagaaggaggaggaaggaagaggagaagaggaaaaagaagaggggaggaggagaaaagggaaaaaaaaaaaaggaagaaagaagaagagagaagggaaggggagagaggagagaagggaaagggaggggggggagaggaaagaagaagggagaagggaaggagaaggaggaaggaaaaaggaaaaaggaaaaagggaagagaaaaaaggagggaagaaaagaaaaaaggagaaggagaaggaagggaaaaagagaggagggaggaaaagggaaggaaaaagaagaggagaaaaaaggagagggaaaagggggaggaaaaagagggagaagggggagagggagaaggaaaggggaggagagggaaggaggggagggaagaaggaagggaaaggggagaagggggagggaaaaggaagaaggaggggaagaaggaggaggggagggaaaagggaaggagggagggaggaagagaaggaaaaaaaagaagggaaagggagaagaagaggagggaaaaggaaggggagaaggaaggagaggagagggaaaaggaaaaaagaaagaggaggagaaaagaaaaaggaggggagaaagaagaaaaggggaaggggagggggaagagggaaagaagaagggaaaggaaaggagaggaagaggaagaaggaaaaaaaaaaggaggggggagggagaaaaaggaagagaggagaaggaggggaggggagggaggggaagggaaaaaggagggggaaagagagaggaaaagggggaaaagaggggaaggggagaaagagagggagaaggaaaaagagaaagaaaggaaaaagaaagaaagagaaagggggggggaagagaaggaaggaggaggaggggaaaaaaaggagggagggagaggagaaaaagggaagaaggggggaggggagagggggagaggaaggaagagggaaaagaggagagaggggaagagggaaggggaaaggaaggaggaggggaagagaagaaaggaagaaaaaaaaagagggggggaaaaaaggagaaaagagaggaggaaaaaagaaagaagaagggaggggggaagaagggggagagaaagagaggaggaagaggagaagaaagaaaaggagaggggagaagggaaaaaaaaaaaggagggaaagaaggaggaaggagaagagaaagggggggagagggagggagagaaggggaaaaaggaagagaaagaaggagagagaagaagggagagaaggagggagaggaagggaggggggggaggaaggaaaaagagaaggaagagggagggaaaaagaagaaggaagaaaaagagggaagggaaaagaaggagggggaagaaggagagagaaagaggaagaaagaaaagggagaggagggggaagggagagggaaaaagaggagagaggagagaaaaagaggggggaaagaaaaagggagaagagaaaagaagggggggaggaaagagaaaggaaaaagggagaagaagggaagaggaagaagaaaaagaagggaaaaaaaaaaaaaaagagagggagaagggaagaagaggaagaggagaggaaggaagagagggaaggggaaagaggggaggaaagggaaaaggaggggaaggagaaaggaaggggggggaaggaaagagagaagaaaaggagggaagaaagggaagggaggagaaaaagagaaaagaaagaggaggaggggaagaagaaagaggaaaagaaagagggaaggagagaagagaagggaagagaaaaggaagaagggaaggagagggagggaagaaagaaggaaaaaaagaaggagaaagaaggaagaggaagaaaagaggagaaaagggggaaaaaagagaaaggaggagaggaaagggagaggggggggagggaggggggagggaaaagaagaagggaaggaagaaaggaaaagggaggggaaggagagaagggaaggggaagaaaaggaagggaggggaaaggaagaaaaggagaggagggggaaagaaaagagagggaaggagagaaggagaagaaaaaagaggggaaaaagggagaaaggggagaggggggagaggagaagaggaaggggaaaaagaggaaaggaaaaggagaagggaggaagaaaaggaggaggggagggaaaggggggaaggaaggaggaggagaaaagaaggaaagagggggaaagagaaaagagaaggagagggagaggagaaaaaaaggaaggagaggaaggaagaagagaggaaagaaaaagagagagggaggaagaaagagggaaaagaagagggggaagaggaggaaaagggagggggaagaaagaaaggaaaggggagaggaagggggggagagaggggaagaaaaagggaggggagaaaaaggaaggagggaaaagaagaggaggggaggaaaaaagggagaaagagaaagaaaaagaaggggaagagggaagaaagaggagagggggggaaagggagggaggagaaaagggaggggaaagaaaaggaaaaaaaaagaagaagagaaggagaagagaggggagagaggagaggagaagaaaaagagggggaaaggggggggagaggaggggaaaagagagaaggggggaggaagaaagggaagggaaggggaagaggagggagaaaggggaagagaagaaggaaaaggagggaaggagagaggggaaaaagaaaggggggaaaagaagggagaagggaggggagggggggaaaggagaggagagaggaagaggagagagaggaaggagggagagaaaagaaagggaaaaggaggggaggggggagaagagaaggaagaggagaagagaagaaaagaaggaagaaaaaaaaggaggaaaaaaaaaaaaggaaggggggaaggaggggaagggaggaaggggggggagaagaaaaggagaggaaaagagagggaagagggaggaaggaaaaaaagaaagggaagaaaaaggggagaggggagggaggaaagaagagaagaaggagaggaggagagaaagaaggagaaagaggaggggaaagggagaaagagaaaaaagaaggagaaggaaaggggaagaggagagggaagagaagaggaaaagaaaaaagagaaagggagagggagagagaagggaaggaaggggggaaaagagaaaaaagagaggaagaagaaaaagagaagaaggagggaaagaagaagggaggaaaagagagggggagggaaaagaaaaagggggaggggaggggaaaaagaaaaaaagagggaaaggggggagaagggagggaaagagagggagaagagaaagaggagaagggagaaaaaagaagggagaaaaaggaaggaagaagaggggagagagagagggaggaggggggaaaaagaaaaaaaagggaagagaaggaagaaaaggaggagggaggaggagggaaagaagggagaaagggagagaaaaagaggaggagggagggaaaagggaagaggaagaaagagaaaaaaggagaaggggaaggaaggagaaggaaggggagggaaagaagaggggaagaagagagaaaagaggggggggaggaagaaaggaaggaaggaaaaaggaggaaaggagaagggaagggaaaagagagaagaaaagagaggagaaagggaaagagaagagaggggggaggagaaaagggagggggaaggaaaaaaaaagaagggaaagaaggggaggagaaagagagagaaagagaagggaaggaagggggaggaaagaggaaaagaaaagaaagagaggaagaaaggggaggaggaagaggaaaaaaaagagggaagagaagggaagagaagaaggaagggggaagaagaaaagaaggaagaaaagaaggggggagaagaaagaggaagagggggaaaggagagagggagaaaagaaaggaagaggagagaagaggaaggaaggaaaggagaaagggaggagaaaaagggagggaaggagggaagaaaaaggggagaaagggggggagaaaagaaaggggagggagagaaaagagaaagagggggagagggggagagggaagaggaggagaaaagggaaagaaggggaagaagaaggaaaggaagaaaggaaaaggaaggaaggggaaaggggagagagaaaggggaaaaagagaaaagagggggagagagagaaaaggaaagaaagggaaaaaaggaaggaagaggggggggaaaaagggggaggagggaaagaaaaaaggggggaagaggaggggaagaagggaaaagaaaggaaagagaggaagagaaagagagggaaaaaaaaagggggaagaagggagaaagagaggaaaaggaaaaggaggagggagaaaagaaaaagaaaggagaagaaagaagaaaaaggggaaaagggaggaaaaaggagaggagaaggaagagaaaggaaaaggagagaggaaggggaaaaaggagagaggggaaggaagggagaagggaaggaaggaggaagaagaagggaagagaaagaggagggagggaagggagaaagagagggaaagaggaagaagaaggaggagagaaggaaaggaaaaaggaagagaaggggaagaagaagaaaaagggaaagggaggagaaggaagggaggagggagagaggaaagagaagaggaagagagggaggggagaggggagaaagagaggggagaaaagaaagggagaggaggaagagggagaagaaaagaagaaagggaagaagaaggaggaaaagggaaaaggaaaggaagaaagagaggaaagaaagggaagggagaggagggggggaagagggaagagggagaaggaaaaaggaagaagagaagggagaggagggaggaggagaggaggggggaaaaggggaaaaggggagaagggagggaaagaaaagggggagggaggaagggaaaggaagaaaaaaaagagagaggggggggaaggaagggaaggagagaaaaggggaaggagggaggaggaaaagggaagaagggaggagaaagagaaaagaagaaaaaggaaggaaaagaagaggggaaaaaaaggggaaaagaaggaaaagaaggaagggaaagaggaaaaagggaggaaggaagagagaggggggagaggagaggagaggagaaagaagggaagagagggagggaaaggagggaaagaagggaagaaaaaaaagaaaagaggaaagggggaaagggagggagaaaggggggaagaagaggagagagagaggaagaaaaagagaagaggaaggagaaaaagaagagagaaaaagaaagaagaaaggagaagagaaggaaaaggaaagaagaaaaaggggaagagaaaaagaaggaaaaaggaaggaaaagggagggagggaagaggaaaaggaaggggggggaggagagggaaaggaaaggagggagaaggaagaggagggaaggaagagaaaaggaaaagaaaaaagaggaaaagaagaggagggggaaagaaaaggagaggaaggagaggggaaaaaaaggagggagaggggagaggagggggagaagggaagggggggaaaggggagagggaagaaaaaaaaggaggggaagggaaagggggagaaggaaagggagagggaagaagagagagagagagaaaaaagaaaaggaggaaaggggagagagaaaaaggaaggaaaaagggaagagaaaaaaagggggaaaaagaagaggagagaggaggggaaggaaggagggagaaggaaggaaaaaagggagagggggggaaagaagaaggagaggaaaaagagaaagagagaagggaaagggagaggggaaggaaaaggagaaagaaaagagggaaaaaaggggagggaagaggaagaagggaagggggaagagggagggaggaaagaaaggaagagagaaaggaaaagaaaggaaggggaagggaaaaaaggggagaaggggagggggggagaggaaggggggaagaagaaaaagggagagggagggagagagagagaggggaaaggagaaaggaaaaaaggaaaagaaagaggaaggggagaagaaggagaagagaaaaggaagaaaagggaggaagagagaaggggaagggagaagagagaggggggaagaaggggggaaggggaaagagaggggagaaaagaagaaagaaagaggaggagagaaaaaaggggaaaggaggaggagaggggaagagggagaaggggaagagaggaaagaggaaagggagaaagagggagagaggaagaaggggaagggggggaaaggaagaaaaaagaggaagaagaggggggagggaggaggggaaaagagagagggaagggggaaggaaaggaaaaaaggagggaaaggggggggagagaagagagaggaggagaaaggggaaaagagaaggaaagaggagggagaggaaagaaagaaggaggagaaaaagggagagggaaaaaaagagggaaaaagaggaagaggagaaaggaaggagagaagagggaaaaggaagaaaagagagaagaaaagaaaaagaaagagaaaggagagggggaggaaagaagagggggggagaggaagagggaaggaaaagaggagggagaagaaagaggaaaggggagaaagggaaaaagggaaaggggagggagaaaaaggggaaaaggggagaagagagaggaggagagagaaagagggagaagagggggggaagagagggaagggaggaggaagaaggagaaagggaaagaaaagaagaggagagaggaaaggggaagggaggaaggggggaagaagagaaaaagaaaaggagaaagggggggaagagagagggagagagaaaaaaaaaggggaggaaggggaaaaaaaaagaaagggaggggagagaaagaagaagagagaagagggagagaaaagggggaaggagaagaggaaaagagaagaagggaagggggagagaagggaagagagagaaaaaaaggagagaaggaaagaggaagaaagaaggagagaggggaaagaggaaaaagggaaaaaaagaaagggggggaaaaaagaaaaaaagaagaggggaagggaaaaaaagagagagggaagaaagggggaagggaaaaagggaaggaagaaaggaaaagagaaggaaggagaagaaaagaaaaagagaaagaaggggaaggaagaaaagaagaaaaagaaggagaaaaaggaaagaaagagggggaggggggggaggggggggaggaaagaagaaaagaaaagggggaaagaaaaaaagaaagggaaagggggaaaggaaaagagaaggggaagaaaggggaagagaaagaaaggagagggagaggagaaaaagaaagaggaaagggagagagaagagaaggagagaaaaggagagaagaggggggaaggaagagaggaaggaggaagaaaggagaggggagaaaagagagggaaggaaaggggagaaaaaaaagaaagaagggagaggagagaaagagagagaaggaaaaaggaagggagaagggaaaaaaagggaaagaaaaaagaaggggaggaggggggagaggggaaagggagggaggaaaggaaggggaggagagggggaaaaaagaagaagaggaaggaaggggaaggaagagagagaagagaaaagaggaaaggagaggagagaagagagaaggagaggagggaagaaggaagagaagggaagaaggagaagaaggaggagaaagagagggagaaaagaggggaggaggagggggagaaaagagaaagaggagaggagggagaggaaggaaagagaaagaggaaaaagagaaaaagggaagggggggagagggggaaaaaggaaggaaagggaagagagggaggaagagagaggggggaagggaggaggaagggaaggggaagggagaggggaggaaaaggggggaaaaagagaagaaagagaaaggaaagagggaagggaaaggggaaaaggggggaaagaaaagaaggggagaagaaggggggaaggggagaaagaggaaaaagggggaaaaaggaaggaagaaggaaaggaagaaaggggaaaggaaagaggaagggaggaaaaagaagaggagagaagaggggggagaaggaagagagagggaagggaaaaaaggaagagaagaaaaggaaaagaaggggaaaggggagaagaagaagggagaggggaaaggaagaaggagaggaagagaagggaagaagaggaggagaaaaaaaagaagaggagagggggagaaaagagagaaaaagaagaggaagaaaggggaagagaggaaagagggggagagagaggagaagaaggagggaggagggagaggagagaggaaaaggaagaaggggagaagggggagaaagaaagagggaaaaagaaaaaggaagagaaagaagagaagggaagaaagggaaagaggagaaggagagaggaaagaagagagggagagggaggaaaagggggggaaagagaagaagagaagaaaagagaggaagaaggagaagggaaaagaaggggaaagggggggaggagaagagagaggggggggaagggaggaggggaagaaggaggggaaggaaagggaagaaggaggaggggaaggaaagaaggaggggaggggggaggaggggaagggaaaggaaagggggggaagaagaagaggaagaaaaaggagaagggaaggggggaggaggagaagggaaaagggaagaggggaaaagaaaaagaagggggaaaagggaaaaagaaagaaggggggaggagaaaaaagagggaagaaagaagaaagagagaaggggagggaaaagagggagagaaaaagagaaaagaagggaggaaaagaggaagaaggaaagaagaaaggagggaggaggaaaaaaaagggagggaggaaaagaaggggagaggaaggagaggaagggaaaaaggaaggggaaaggaaaggaaaaggggagagaagaggagaagagaagagaaggagggaagaaggagaagagagagaaaggaagaagaaggaaaaaaaggagggggggagagagaaggaaggagaaaggggggagaagaggaagggggggaaaggagaagaagagaagaaaggggaggggggaaaagggagaagaaggaagaggaaaaagaggggagaggagaagagaaaaagagaaaggaagaagaggaggaagagaagaaagaaaggaaggggaggagagagggagaaaggaggaaaaaaaagaagaagaaaagaaagaaagaggggggaggaaagaagggagagagaaagaggaaaagaagagaagaagagggaaaggaagagaggaaaggggaaaaaaagaaagggaagaggaaaaggggaggaaagggagaaaaggggggagagggggaggaagaaggggaaaaagggaggggaagaaaaggaaaggagaagggggaaagggaaaaagaggaagaaagaggaggaagagaggaaggggaaagggaaaagagagggagaagggagaggaaggaaagaagagaaagaggaaagaaagaagggagagaagaaaaaagagaggggaagagggagaagggaggggagggagaagagggaaggaagaagaagagagaggaaagaaaaagagggggagagagaaaaggaggaagagagaagaagaaggagagaagagagagaggaaagaggaagaagaagagagaaggaagaagaaaaagaaaagaagaaaaaaaaaaaaaagagggagaaggaaagaaaaggggggggagaggaaggaaaagaagaagaggaagaagggagaggagagggaggaggggggaaaagaggaaggaagggagggggaggaaggagagaagagaaaaagagaagaaagggaaaagggaagaggaaaagaaaaagagggggaggagggggaggaagaaaaggaaaagaaaaaggggaggagaaaagggggaggaaagggagaggaggaagagaagggaagggaaggaagaaagaaggaaagaaaggagggaaaaggaggaaaaggaagaagagggaagaaaaggagaaggagagaaaaaggaagagagaaaaggaagaggaggaggagggaggggaggggggggagaagaagggggggaagagaggaagagggaggagaagaagaaaagggaaggggaaaaagaggaagggagaaaaaaaaaaaaaaagaagaaggaggggaaaaaaaaaagaggaaaaaagagaagaagaaggagaaagaggggagagagggggggaagggaaaagggggagagaagaggaggaaagggaagaaggggagaagaaaaggaaaaggggggaagaagagaagaaagggaaggggggggaggaagggaagaagaagagagaggagggaaagagaagggaaaggaaaagagagaggaggaaagaggggaaaagaaagaaggagaggagggagaaagagaggaaagaagaagagggaaggggagaaaaaaagaggaaagaagaaaagaaaaaggaagaaaagggagggggaaaggggaaaggaaaggggggaagagggaaaggggagaggaaaggagaggggaaagggaaagggaggaaggggggaaaagaaggggaagggaaaagaaaaggaagaaagagaagaaaaaagaggggagagagggaagaaaggggagaaagggggaaggggaggagggagaaagaggaaggaaaagaaagggaggaggaaaaaaggggggaaaaagaaggaggagggaaggggagaagaggagaaaaggggggggaaaggggagagaggggagggaagaagagaaaagaggggagggggaaaggaaagggaaggggaggaggagggagaaagaggaaaaaagggagaagaaggggggaaggaaagaaaggaaaaagagaaagaggaaaaaaagagagaaggagggggaggggggggagagggaggagaaaggaagaggagggagaggggggaaggagaaaaaagaaagggaaaaaaaggggaggggagagaagagaaggaaaaaaggaagaaggagaagggaggaggagagaaaaggaggaagaaaagagagagaagggggaaaggagaggaagagagggaagggggggaggagaaaaggagaggaggagagaggggggagagaggagaaaaggagagaaaggagagaaggaggaaagagggggaggaggaaagaagaggaggaggggaggaggaagggaggaagaagaaaagggaagaaaaaaggagaaagagaaaaagaagggagaaggaagggagaaagagaaagggaaggagagagaaagaaagaaaaaaaaaagagagagggggagaggaaggagggaaagagggagaaaagaagaaggaaagagagaagaagaagagaaggggaagaaagaggagaagagaggggaaagaggagagaagaaaaagaaaaaggggagaaagaggagaagaagaaagaaaagggggaagggaggagaagggggaaaaagagaggaaggaaaaaaggaagggaggagagggaaaaaagaagagagaagagaaagaaggagaagggagagagaaagaaaggaagggaaaaaaaggaaaaaaaagggagagaagggagaaaaggaggagagaggaagaaggagagaaaggagaaaggggggaaagaaaaggaagggggagggaggaagggggaaagaaaaggggaagagagggaaaggggagggaagaagagggaagggggggggaaagagaggggaaggagggggaagaaaggaggggaagagggaaggaaggaaaggaaagaggagagaaggaaaagggaaggagaaagaaaaaaggaaagaggggagaaaaggaaagagaaaagagagggaggggaaaaagggagggggaaggaaggaagagaaaaggagaaggggagaggaggaagagagaaaaagagaagaaaaggagggaggaggagaaaagaaaggaaaaaaaagggagaaagaaagggaaagaggaagaggaagaagaggagggaagaagagagaaaagaaagagggggggggaggaagaaaagaaggaggaggagaagaggagaaaagagaaagaggagaggagaaaggagaggaggagaagagaaaaagagagaagaagaggggaggggaggggggagggaagggaagagaagaaggaggggaaggaagaaaaggaaaggggaaaaaaggggagagaagaggaaggggggggaggaagaggggaggaagggagaaagaggaagagggaagaagaagagaaagaggaaaagagggggaaaggaaggaaaggaaaaagaaaaaagggggaaagggggaaggggagagaagaaggggaaaaagagaaaagaggggggaagagggaaaagagaagaagaagaaaaaaggaggaggggggggggaggaaaagggaagagagagaaagaaaaagggggggaagaggaaggggagagaggaggagaagagaaagaaaagaagagagagggaaggaagaagaaagggggaagaggggaggagaaggggaaagggaagaaaaggagggaaaaaagaaaaaggaaggagaaaagaaaggaaaaaggaaaaaagggagaaaggaggaaggaaagaggaggggaaaggagaggaagagagaaggggaaaaagaaagagagaggagaaaaaggagaagggaagagagaaggaagaggaaaagaagggaaggagaaagggggaaagggagaaagagagaggaagaagaaaaagagggaggagagaggaaagggggaagaagagggaagggggagaaggagagaaagggaaaagaagaagaagagggggagaagaaggaaagagaagaaaagaggaggaagggaaaggaagagagagaaaagaggggggaggaaaaaaaagaaaggggggaaaagggaagagaaaagaaaaaagagaaaaggagggaaaaaaggagaaagggagaggggaaaagggaggaaagaaagggaagagagaagagggagggaagagagaagaggaggagggaaaagggaagaaaagagggaagaaagggaagaaggagaagaggggggaagaggggaaaaaggaggaagagaggaagggaaagggagaggggaggaagggaaaggaagagagaagggggaaaggggggggaggaaaggggaggagagaaaaaggggaagagaaaggaggaaaagggaaaaggggaggagaaagagaggagaaaggaaggggaggagagaggggagggaggaggaggggagaaagggagagagaaaaaaagggggaaggaaagagggagggaggaaggagaaaagaggggagaggaggaaaggagagagaaagggaaggggggaggaagggaggagaaaggagggaaggaaaaagagaaagggaaagagagagaaaggggaggaggaaggggggaaggaggggggagaaggaggaggaaaaggagaagagggaagaaggaaagaggagagaagaagagaaaggaaaggagaagagagaaaagaggaaagaggaagaagagaaagagaagaaggggagaaaaggaaaggaaaggaaaggggggaaggagaggaagaagaggggggaggggaaaaagaaggaaggagggaaaaaaaaaagaagggggggagaaaaaaagggagagggaaaaggggaaaagaaaaaaagggagaaagaaaaggggaggaagggaagggaagaaaaaggagggagggaggaaaggggggggagaagggaaggggggaaaagggaaggggagaagaaaaaagggaggggaagggaaagagggggaaggaaagggggaggaagaaggggaaagagagagggaaaggaaaaggaaaaaaaaggggagaaagaaaggaaggagaaagggaaaaggaaaggggggggaaaaaggaagggagagaagaggggaaagaaggggggagagggaaggaaaaaagggggagagggggaaagaaggaaaggaggaaaaggagaaagagaaaagagaaagggggagagaagggggaaggagagaaagaggaggggaaggaagagagggaagaagaaaaaagggagagggaagaagagggaagaagagaaaggaagaaagaagagaggaaaagggaaaagggagggaagagaagggggagggggaaggggggagagggggggagggaggagggaaaaggaaaggggggaagaaagggagaggggaaaggagagagaaaaaaaaagaaaaaaagggaaaaggaagaaaaaggggaagagaaaaagaagaaaagagggagagagagaaagggaagggagaaaagagagaagggaagagaggaggaaaagaaggggagggagaaaaaaaaagagagaaggaggagaggggaaaggaggagaaagggggggaaaaggagaaaagggaaaaggagaagagaggagagggggaaagaagaaggagagagaaaggaggaagagaaaggggggggaaagaaaagaaaggaggaggaagaggggggggaaaggaggggagaaaagggagggaaggggggaagaaaagaaaaaaaaagggaaaggggaggaggaggggagaaaggggagaaaagggagaaagaggaggaaagaggagggagaagaggagagggaggaggagagaaggggaggaggaggaaaaagaggaaaaagaagaggaggaagagaggaggagagaagaggggagaggaagaagagggagggggaaagaaaaagggagagaaaagaggggaagaggaaagaagaggggaggagagggagagggaaagaaaagaaaagaaaagaggaagaaggaagggaagaggggagagaaaagaaagaaaagggaggaaggggggaaagggagagaaaagaaaagaggaaaaaaaaaggaggagggaaaggggagaaaggagggagaggaggaagggggaaaagaaagggaaagaaaagaaaaggggaggagaaaagggaagaggggaaagaaaaagagagagaagaagaaaaaaagagagggagagaagggaagggaagggagaaaaagaaaggagaggagggggaaagaagaagagaagaaggaaagagaaaaaaaaagagagaaaaagaaggaaaaaaggagaagaagagaaggaaaggaaaaggagggaaagaggggagaaaggaagggagaaaaaaagagaggaggaggaaaaaaggaagaagaaggagagagagaaaagagggaaaagggaaaaaaagagagagggggaaaagaggagaagagaaggggggaagggaaggagggagaaaaagaaggaggaggaaagggaggaagggaaggagagaagggagggagggggaaagagaggaaaagaaaaagagaaaggaggaagaggaagaagagaaaaaggagaaggaaaaaaaaggaagaaagagagaggggggggggagagagggaaggaaagaagaaaagaaaggagggaaaggaagaaaaaaagggaaagaggggggaggaaagaaaaggggaaaaaagagggggggaaaaaagagagaaggaaaggaggaaagaaaaggggaaaaagagggagaagagaaagagggaaaaggagaggagagggggaaaggaagagaggagggagggaaaaagaaagaagggaaaaaaagggggagggaagaggaagaaaaaaaagaaagaaggaaaaagagagaaggagaggaaagaaaaaaggaggggagaagagaaaaaaaggagaggaaaaaaaaaggggaggagaaaagaaggagaaaggagagggagggagggggaggagggagaagaggaaaaaggaagagggaggaggaaagggggggaagagaaagagaaaaaaagaaggggggaaagaaaaggagggaaaagaggaggaaggaaggggaaagaaagggagggagggagaagaagagaaagaaagagaggaagaaaagaggggagaaggagagggagaaaaaggaaagagggggggaggggggggaagggagaaaaaagaggaaaaggagaaaaagagaaagaggggagaggggaaaaggggaaagaaagggaaaagagggaagaagggaggggagaggagggaggaggaggggagggggaagggaaaagggaggaaggggagagagggagaagagagaaagaaagaaaaaaaggaagagaaaggggaaagggggaaaaaaagaaaagggggaagagaagggggaaaggggaaaaggagaagaaaaaagaaaagagggagaaagagagggaggaagaaggagaaaaagaaagaggaagaaaagaggaagaagagaagagaagaagggggaagaggaagaaagaaggaaggggagaaaggaagaaaagaaaaggaaaagaaaggaaggggggaggggaagaggggagaggaggaaggagaaaggagaaggagggaaaaggaggagggagggggaaaaaagggaagaggaaggggagagaaaaaagaggaaaagaagaggggagaggggagaaagaggaaagggagagagagaaaggagaggaagggggggggaggaagaagagagaggaaaggaaagagggggggaaagggggaaaagagggagggaaaaaaaaggaggaagggaaagaagggaaggagagaaagaggaaggggaggagaaaagaggaaaaaggagagggaaaggaaagggaagagggagggggaggaggaaagagggaaagaagggaaggaagaaaagggggaaggagagggaagggggagaaggggaaagggaggagaggaaaaagagaagggggagaagggggggaaagaaaaggagaaaagaggaagaggaggagaggaagaagggagggggaggaaaagagagaggagaaaaagggggggaagaagagaagggaagagaagggaaggggaaggggggaggagaagaaaaggaagggggaaagggggaaggaagaaaaagggagaagggagaaggaagagggaggagggggggggagagagggggaaaagaaggggaggaaaaaagaggagaaaagagagggggaggaaaggaggagaggagagaggaagggaagaaaaaaaggagaagggagagaggaaaaggaaaagaagaagaggagggaaggaaaggggaaaaagagaggaagaagggaggaaaggaggaaggaagaaaggaaaagaggagagaagggaagaagagaaggggaggggggaaggaagaggagggggaggaaggaagaaagaggaaaaaagggaaaaaaggagagaagaaagaggagaaaagggggagaggagaaggaggaggaaagaaaaagaaaaggagaaagaggaggggggaaaagaaggaagaggaaaaaaaagaggaagagaaagggagaaaggaagaaaaaaaagagagaagagaagggagaaaggaaagaaaggaaggggagaaaagagggggaaaggaggagggagaagaagaaggagagagaggaagaaaagggaggaaagaaggaagagaaaaaggagaagaaaaaaaaaggaggggaaggggaggggaggaagggaaagaaaaggaaagagaagaggaaaagggaaggaaaggaaggaaagggaggaaaaggggaggaggaagaaggaggaaagaaggggaggaaaggaaagggggggggggaaaggagaaaagaggaaaaaggaggaaaaggagagggagggggaagggaaaagagagagagaagagaaaggaaggaaggaagagagggagggaagagagaaaagagaggggaaaaagaaggggaaaaaagggagagaggaggggggggagaggagggaagaaggaaaaaagaagagggaaggaagaaaggaggagagaggaaaggaggaagagaggagaaaaaagagaaaagggagggaagagagaagaagaagaaaaaagaagaaagaagaggaagggaaagagaggaaaaaaaagaggaaggagagagagagagaagaggggagggaagaaggaaaagaagaggaggaagaagagaggagaggggaaggaggggggaagaaaggagagaagagagaaggaggaaggagaaaagagaaaaggaaaggaaaggaagaagggaggaggagaagaagaagagggggagaaaaaggggggagagaaggaaaaaaggaaagggagaaagaaggggggaggaaagggagagaagagaaagaggagaaaagaaaagaaaaagaagggaggagaggggggaagaggaggagaagaaagaagggggaagggaaagagaaggagagaaggagagagaaaaaagggaaggggaaggaagagagaagggaggaaggggagaagaaggggggggagagagagggagagaggaggagaaagagagagaggagggaagagaaaaagaaagaaaagaaaaaaaggaaaagaaggaggggagaaaaaaagaagaagaaaaggggagagggaagagggaggggagagagaggggggggagaaaaaaaaaggaggaaaagggaggagagaggagaaaggggggaaaagggggaagggaggagaaaagaaagaaaaggggaggggggggaggaaaggaaaaagaagagagaggagggagaaagaaggggaaggaaaggagagaggaggaaagagggaaggagaaagagggagagaagggagaagggaaaaggaaaagaagggggaaagggagaaaagaagaggggagaagaaaaaaggaggggaaagaaaggaggggaaaaggggggggaaaaaaggggaagagggaaagggagaagaaaaggagagggaagaaagaagggggaaaaagggggaaaagagggggaagaggaaagagagagaggggaaaaaagaaaagggagaggagaaggggaagaaaggggaggaagggggggggagaggagagagaaggagggagaagagaagaggaagggggaagagaggggggggaaagaaagaggagagaaggaggggagaagaaaaaagagggagaaaaggaaagaaaggaaagggaggagaagaaaagaaaggagggggaaaagaagaaaggagggaggaggagggggaaagagaagaaaggggagaagaaagggaaaaaaaagagaaaagaaaagggaaagagagaaaaaagaaaaaaagaggaagaaggaggagagaggagggaaaaagggaaaaagggggaagagggaaaagaagaagaaaagagaaaaaaaaagagaaaggaaaagaggaaaggggaaaaagaaaaaaggaggagggaggaggggggaggaaaaggaaggaaagagagaaaaaagagaaaggggagaaggaaaaggaaagggagggggagaggagaagaggaggagagaggggggggagaggagaaaaggggaaaaaggagggagggaggaagggaagggagagggaaggggaaaggggagggaaagggggaggggggaagaaagaaagagaagaaaaaaagagaaagggagaaagaagggaaggagaagggaaagagaaaaggagggggagagggaagggagggaaaaaaagagagggagaggggaagggaggaggggaagagggaggaaaggggaagggaggagagaaggagagaagagagggaagaaagaggaggaaagaggggagagagaagagaaaaaaaggaagaagggaagaaaagagagaggggaaaagaaaaggggggggggagggaaaggaggaagaagagaaaaaggaaaaaagagaggggggagagggagggaagaagagagaggagaaagaaagggaagggagagaaaaagaaagggagagaaaaagaagaaaaaggagggggagaagagagagaagagagagagagaaaaaaggaggaagaagaaaaaggggagaaaggaaaagaagggggaggaagggagagggaaagaaaagggggagagaaggaaaagaaggggaaaaaaagagggaggggaaggggagaaaagaaagaggggagggaggagggaggagaaaaggaaaggaaggagaagaaagaagaaagaaagaagaggagaaaagaaaaaaaaaaggagaggagggaggaaagagaaaagagaagagaagaaggagagggagagaaagaaaaagaggggagagagaaggagaagggaagaaagagaggggagaaaagaaagagaaggggagaaaggaggagaagaaaggggaagaaagaaggggagagagaggaaaaaagggagaggagggagaggagagaaagagaaaagaagaggagggagggagggagagagagggaaagggggaggaaaaaaagagaagagagaaggaggagaggaaaagggagaggaagggaggaggaaaagggagagaaaggagggaggggaggggggagggaggggaaggggagggggagggggagggagaaaaggaaggggggaggaagggaagagaaggggaaaggagggaaggaagaggggaggaggggagaaaaaagaagagggaggaaggagagaaagaggaaaagaggggggaaggaagaggaagaaaaggaaggaagaggaaaggaagggagaagagaaaaggagggaaaggagaaagggaggaggggagagggagaaagagggggagaaaaggaagggaggagggggggaggagggagaaggaagaaagagaaaagaaaggggggagaagaaggagaggagggaggaggagaggaaaaaagaaaggagagagaggagaagaagagggaaagaggaagggggaaggggaaggagaaaggagagaaaaggagaagaaaaagaagggggaggagaaaaagaaagagaaggggaagaaaagaggagaggaagaaggagagaagagagagagggggagaaaaaaaaaaggaaaagaagaagggggaaagagaaggaggaagggggaagagagaagagaggggaaaagagggggaggggagagggagaggggaagagagagaaaggagaaaaaaaaggggagaggagagaggaaagagggaagaagggggaagaagggggaggagggaaaggggaaaaaggaaagggaggaggagaggaaggaaagagaggaaaaggagggaaaggaaaagaaagggaaagagagggggggagaggggaaaggagaaaggagagggaaggggagaagaaagagaaagaaggaaagggggaaaaggaggaagaggggagaaaggagaaggagggggggaagaagaaaaggaaaaggagaaaaggggaaggaagaaagaggggggaagaaaaaaaaggaggaagggaagaaaagaaggggaaagagaggaaaggagggaaagaaaagaaagagaggaaggaaaagaaagagggaaggaaaggaggggaggaggggaggagagaaggggggaaagaaaaggggagaagaggaaaaggggaaaggaagggagggagaaggagaagaggaggggaaaggagggagaaaggaggggggagggagaggggaagagggaggaggggaggaagggagagagaaaaagagggggaagaaaggaagaaaagaggaaagagaaaagaggggagaggaggaaaaggaggggaaaggggagagaaagaaaaggaagaagaaaggagggaaagaagaagagagggggaaagaaaaagaagggagaaggagaaaaaggggaggaagagggagaaggagggggaaaaggaaaaggaggaagaaggaaggagaaaggagggggaggaagggaagagaggggaagaaaggggaaaggaggaaggagagagagagaggaaggggagagaggaggaggaaaggagaaaggggagggagaggaagaagaaggggggggggaaaaagaaggaaggaagaaaaaaaggaggaagggggaaagaaaaaagaggagagggaaggggagggaaggaagaaagggaaagagaaaaaaggagaaaaggaagaaagggaaaagaaagagaggaagaaagggggggaagaagggaaggggggaaaggagagagggaggagaaagaaggggggaaaagagaaagagagggagagaaagaggaaggaggaggggagaagggaaggggggaggaaaaaaaaaaaaaaggggaaaaagaagggagggagaaaggggaagggaaagggaggaagaaggggaagggagagaaaggaagaaaaaagagggggaaggaagggaaaagagggggagaaggaggaagaaagaaaggaaggaaaggggagggggaaaagagaagagagaagagagggagggaggagggaaggagagggagagggaagagagggaagaagaaaaaaggggaaggggaaaagagaaagaaaggagaaagagggaaagagagggggaaaggggaaagggaggggagggaaggaggagagggaaggggggaaggggggggagagaagaaggggaagggaggggggaaagaagggaggaggggaaaaaagagggagaaaaaaagaaaagagaggaaaagaaaaagaaaagggagaaaaaagagagagagagaagaagagaagaagaagaaaggagggaaagaggaaaagggaaagaggagaaaaagagggggagagagaaaaaaaaaaagagaggggagagagagaaaaggagaaggaagggggggagaagaagggaggaggagggaaggaaggaaaagagggagggagaagaggaagagagaaaggagaaagaaaaaggggagggagagaaaaggaaggagaaggaaaaaggggggaaaaagaggagaggaaggggggggggggggggaaaaaaagggggagaaggaaaaaggaaaagaggaggggagaaagagaagagaagggagagaagggagaagaaagaagggagaagaggagggagaaaagaggagaagaggaagaggaggggaaagaggaaaaagaagggagggaagagaaggaaggagaggaggagagaggaaaaggaggggggggggagaagggagggaaaagaaaaaagggaagagaaaggaagaaggaaggaaagagaggaaggaaaaaagggaaagaagagggggaaaaggaagagaaggggggagagagaagagagaaaaggggggaagggagaaaagggagagaaaaggaaaaaaggagaaagaaggaggagggaaaagggagaaagaaaggagaggaaaaagggaggaagaaaaggaaaagagaagaaagaagggggagaaaaaggggaaggaaagagaaaaagaggaagaagaggagaaaaggagagagagaggggggaagggaagggaaaaaaagggaagagagggggagaggagggggaaagaagagggaaagggaggaaaagagagagaaaaagagggagaggaggagggaaagagaaaaagaggaaagggagagagagagagggaagagaaaggaggaaaaaaagagagggagggaaggagaggaagaggaagaagaaagagaaaaagaggaaaggggaaaaagagggagaggagaaaaagaggagaaggaaagggagggaggggaggaggaggaaaaaaaaggagaagaagagggaggaggaaagggggagaagagggggagggggaaagagagaaaaagaagaaaaagaaagagaaaggggaagaagaaaaaggggaaggaaaaaaggaaggagggaggagagaggagggagagggagaaggagggaaagaggaaaagaaaggaagagagggggggaaaaagggaaaaaaaaggggaggaaagaagagagaagagaagaggggggggaaaaagagaagaagaaggaaggaaagagggggaggagaagaggaagaagagagagaggggggaggaaaggaagagaggagagaaaggggggggggagagaaagagaaagaagggaaagaaaagggaagggaggaggaggaaaagagggaaagaagaaaaaagagaaagggggaggaaggagaaaagaggggaggaaaaaaagaaagagagaggagaggaaagggagaagagaaaaggaggagaaaggagaggaaaggaggaggaaaaggaagaagagaaaaaaggaagagagaagaagagaaaagggagggagaaggagaaaggagggaagggaaaaagaaagggagggaaaagaggaagaaagaaaggaaaagaaagggagggagggaaaagggaagaaagagagagaaaaaaaggggagaaaaaaaaaagaggaggaaggagggaagggggaggggggagggagaggggagagagaaaaggagaaggaggaaagaaaaaagaagagaaaaaaaaggaggagagaagaagagaaaggggaggagaagggaggaaagagggggggggaagagaggagaggggaagaaaaagaaggaagggggagaaaggggaaagaaagaaagagaaaaaaagaagaaaagaaagaagagagggagaaaaaaagggaagggggaagaggggagagaagaagggaaagaagaagaaaaaagaagggggggagaaagagagggagggaggagaagaaagaagaaaaaaagaaaaaagggaaggaaagaaaggaagaagggggaagaggaggaaagaaggaaagggagaaagggaaaaaggagagagaaaaggaaagaaggggggaagggaagagggaaaagaaggaaggggaagaaaggaggaagaaaaaggaggaaggaggggaaaaagaggaaagaagaagaggaagagggaaagagggggaggggaggggagaggggagaagggagaaagggagagaagggaagagaggaaagggaaggggagaaagaagaagggaggaaggaagaggaaagggagagggggaaggaagggaggaaaaagaagggggaaaggggaggaggggagaaagaagaagaggaaggaggggaaaaaagaagaaaagggagagggaagagaaagggggaaaggagggggaagaggaaaaggggggaaaaggaaagggaaaaaggagggggagagaggggagagagagaaggagaaagggaagagaagagaaaggaaaagaagagagggggaggaaaaaggaaaagaaaaaagagagagggggagggggagaaagggggggaaggagaaaagagaggggaaaaagagggagaaaaaaagaaaggaagaggagggaggagaaagagaggaggagaagagaaggaggaaggaaagggggaaggaagaaaaaaggaaaagggagggggaagggggaggaggaggggggagagaaggagagaaggagggggggaaaaggaaggggaaaagggggggggggggaaggaagagaggagaagagaaggggagggaggaaggggaagggagagaagaaaggaagaaggggaaggggagaagaggaaggaaagaaaagagaggaaagggaggggaaaggaagaagggagaaaggagaggaaaaaaggaggaaagaagaaagagggagggaagaaggaagagggaggggaaggagaaggaaagagggagagagggaaaaaaggaggggagaaagaggagaaaaggggaaggggggaagaaagaagaagaagagggaaaaagggagagaggagaaaagaaaaaaagggagggaaagaaaaagaggagaagagagggagagagaaagaaaaagaggagaaaagagaaaggaggaagggagaaaaagggggggggaaaagagagggaaagaagaagggagagaaggaggggggagggagaaggaaagaaaggaaagaagaaaagaaaaggagagaagaaagagaaagggagggagggggagaggaaagaggaaaagagagggggaaagaagaggaagaagaagggaaaggagaggaaagaaaggagagggaaggagggaaaaagaggaaagaagaggaagaaagaaagggggggagggggaagaagaaagaaaaggaaagaaagaaaagaagagggagggggaaggaaaaggaggaagagaagagaaaggaggagagggagagaggaaaggaagagaagaaagagaggggaaagagagggagaaagaaggaagggagagggaaggggagggaaggagaaaggggaagaagaaaagggagagggggagagaaaagggaggaagggagaaggaggggaggaaaaaaagaaaggggagggaagggaggagaaaaagaaaaaagagaagagaaagggaagggaaaggggggagggaggagagaaaggggagagagagagaaaaggagaggaaagaaaggaagggagaggaagaggaagaaaagaaaggagagggagggaagaggaagagggagaaaagagaaagaaaggggaaaagggaggaaaggaaagaaaagaaggaaggaagggggagaaagagaagaggggagaagaaagggaggagggagagaaggaaggaaaaagaaagagagggggggagaggagagagagaggaggaagaggagaaaaagaaagaaggggagaggaggaggggggagaggaggagaggaagaaagggggagaagaggaaaaaaaaggggaaaaggaaagaggagaaagggaagaggaagaaagagaggaaggaagaaaggggaaagagagaggaagggagggagggggaaaaaaagagaaagagaaaaaggaggggagagaaagaaaaaaaaagggaaggaggggaagagaggaaagaaggaaaggagaggaagaaaaggggaaagaggagaggggggggagagggaaaggggggagaagaaaaaaagaagaaaaggaagaagagaagggaaaggagggaaagggaggagggaaggagaaaagaaagaagaggggaaggggaggagagaaagaaagaggaaaagggggggggggaaggaagggggagggggggagagaagagaaagggaggagggggagagagagggagaggagagaagagaaaagggagagaaggagaaaaaggagaaaagaaaaagggggagagaaaaaggagaagaaagaaagggagggaagagggaggggagaaaaagggaaaaggaaaagggagaaaaaaaggagagggaagaaagaagggggaaggaagaggggaagggagggaagaagaaggggagaaagggggagaaggaagagggagaaaaggagggaggggaggggagggaagaaggggggaaggaagaggagaggagggaaaagggaggaggaagggggaggagagggaggggaaaaaaagaggagagaaggaggggagaagaaaaaagagaaaaaggggaaaaaaaaggaagaggaggagaagaaagaaaagaagggggaggaaaggaaaggaaagggagaggaagggagggaaaggagaggggagaggagaagaaaggaaaagagaaaaggaaaagggaaaagaggaaagaaaagaggagaggaagaagaaggagagaggaggaaaaaaaagaaaaagggagaggaggaaaaagaagaggagaggggaaagaaaaagaaaaaagaaaaaggagaagaagaaaaagagaaaaggaggaggggaaggggggggggaaaaagaagggaggggagaagaaagaaaggaagaaaaaggaaaagggaagagaagggggagggggaagaaagggagagggaagggggaaaagggaaaagggggagggggaggaagggggaaagggaaaggagagaaaggaggagaggggaaggagaagaggagaggggagaagagaaagaggaaaaaaaaaaaggaaggaagggggaggaagaggaggagggaaagagaagaggaaggagagaagaaagggagggaagaaagggaagggggaggggaagggagaagagggaaaagagggaaggggggagagaggagaggaggggggagaagaggaaggaaggggggggaaaaaggggagagagaaaaggaaaagggaagggaaggaagaaaagaaaaaggggaaaggggaagggaggggagagagaaaggaggaagggagaaaaagagaagagagagaggggggaggaggagggaggaaaaaagaggaggaaaagaggggaaggaaaagagaagaaaaggagagaaagaggagggaaaggaaggggaaagaaggaggaaaagagaaagaaagaagagagggaagaaaaagggagggagaggggaaaagaagggggaagaagggaaaggagaaggaaagagggagagaaggaaaaaaagggagaaagaggagggagaagaaggggaggaaagaaggaggagagagaggaggaaggaaaaaaggagggaaagaaggagaaaggagaaaggaaggaggagaggaaagaagaaaaaggaggggagaggggagagagaggaaagggaaagaaaaaagaagagggaaaaaaagaaaaagaggggggggaggaggggaagggaaggaagagagagaaaaagagagaggaaaggggggaaaagggaaggagaaagggaggggaaggagaggaggggggagaaaaagagggaggaagggagggggaaggaagagaaaaggagaggaggaagggaaggggagagggggagagaggaagggaagaaagaagagaaagaagaaggagaagaaaagaagggggaaaggaggggggaaaggaagagagaggagagaggagaggggggagggagggaaaagagagggaaagagagaaagaaaggagggagaaaggaggaagggaagagagggggaaaggagggaaggaggagggagggaggagaggaaaaaaaagaaaaagaaaggagagaaggagaaaaagaaaagggaaggaggagggaagaagggaagggagaggaaaggaaaggggaagagaagaggagagagaggggaaggggaggaggggagagggagagaaagggagagaaaaggggggaaggaggagagaagaaggggggaagaagaaggaagagagagagggaagaaaggaaggaaaaggaggagggggaagggaaggaagaaagggggaggaagagaagaagagggaaagaggggagggaagagggaaggaagggggagaggaagggagaagagaaaaaaggggggggagaggaggaaagagaggggaaagaggagagaagaggaagaagaagagaaaggagagggggggggaaaagaaaaaggaaaagaagaagggggaaaaagaaggaaagagggaggagagggaagaggaggagaaagggagagggaggagagggaaaggggaggagaaaggaaagggagaaaaaagaggaggggggaggggagagaaggaggaaggggagagaaaggagaggggggaaaagggaaaaaggaaaggaaggagaagaggaaggaaagagggggaggggaaggagaggaagagaagggaaaagaggggggggaaagaggggagggagagaggagaaggagaaggagaagaggaagagagaagggaggagggaaaagggggaagggggagggaaggagaaagaggagggaaagaaggaaaggagaaggaaaaaaggggaaggaagaaagagggggggagaagaaagagggggaagggaagaaaaaaaaggggaagagaggaagggagggagagaaaagaaaaaagagaaggaagagaaaaaggaagaagaagagggggagagggggaggagagaagggaaaaaggaagagaagggaaagagaagagaggaaagaaaggaaaaggggagaagaggaagggagagaaagagggagagaggaggaaggaaggagaggggaaaagggggggagagggggaggaagaggagaaaagagagggaggaaggggaaagaagggaagagagagaaaagggagaaggagggaaaagaggggggaagggagagaaagaaagggaagaaagaaggaggaaaagagggagaaggggggaaaggaaaagaagaaagaaagaggaaaaagaggggaagaggagagagagaagggaaaaggaaagggaaggagaagggggaagaaagaaggggagggaggggagaagaggagaagaagggggagggaaggggggagagagggggagggaagggagggggaaggagggagggagaaaggagggggaggggaaggagaaggaaagaggagaaaaggagggaaagagaaaaaaaggaggaagagggaaagagaagggaggaggggggaggggaaggaaggaagaaaaaaaaggagaaagaagaaaaagaagagaaaagggagagaaaaaagagaaaaaagaggagggagaggagggaaaagagaggggagagagggaggaggaagaagaagggaaaaaagaaagagagggggaagggaaagagaaaggaggagagagagaaagaggggagaggagaagaaagaaagaggaaaaaggagaggggaggggggaggaaggggaagggagaaagaaggaggagaaaggaaaaggaaaagaaggaagagagagggaggagaggaggagagaagaaagagggagggaggaaggaaggagagagggggaggaagaaaggggaaagaagaaagggaggggaaaaggaaggggaggaaggggggagaaagggggaaaaaaagaaagggaagaaggaaaaagaaagaaaggaggaaaggagaaagggagggggagaggaggaaggggaaagaggggaaaagaagagaggagaggagaagaagggaaaaagaagaaggggaagggagaaggaaagggagggaggagaaaggaaagaaggaagaaaggaagaggagggagaaagagaaaaggagaaagaggaaaaaggaaggagagagaagaaggaaagaggaaaaaaggagagaagggggaaaaaggaaggaaaagaggaaaagggggagaaagaaagagaagaagggaggggaaagagagaaggggaaa\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 441,
        "task_id": 4108,
        "test_case_id": 23,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "exeexxxexxexxexxeeeexeexxeeexxxexeexxxeeeexexxeexexxexexeexxeexxeeeexxexeexexxxexxxeexxeexxexexxxexexeexxxxxeeeeexeeeeexxxxexexxxxxexxeeexexxeexeeeexxxxexeexeeexeeexeeeeeexeeexxxeexeeeexeexexeeeeeexexeexxxxeeexxeeeeexeexexexxxxexxxexxeexxexexxxxxeexeexexexxxxxexexexxxeexexxexxxexexeexexeexxeexxxxxxeexxexxxeexexexxxeexexxxxexxexexxxxeexxxeeexexeexexxeeeexeexexexexxeeeeexexexxexexxeeexeeexxxxxxeeexeexexxexxxeeexxxexexeeexxxeeexxxxxeexxxeeeeeeexxxxxxexxxeeeexxxxxexxeeeeeexexeexexxexexexexxxeeeexxxexeexeeexxxexexeexxxexxxeexeexxexxeexexxeeeeexxexxxeexxexeexxxxxeeeeeeexxxxeeexeexxexeeeeexexxeexexxexxexexeexeexxeexeeeexxxxxeexexeeexxeeeeeeexxxeeeeeexexxxexexxexxxxxeeexxexexxeeeeexxxxxexxexxexxexxxexexexxxexxxxeeeexxxeeexexeeeeexxxxeeexexexeexxeeexexexexxexexxexexexexeeeexxeexxxexxeexxxexeexeexexxexxeeexexeexexxxexeexxeexeexeexexxeexxexexxeeexxeexeexexexxxexxexxeexxexexxexxxxxexeeeeeeexeexxxeeeeexxxeexxxxxeeexxxxxxexxeeexxxxeexxxeeexexexxxexxexxxexxxexexeeexxeeeexxeexeexexeeeeexxxxxexxeeeeeexxxexxexxxexexeexeexeexxexeexxexeeexexxxxxeeexeexexxxxexxeeeexexexxxxxeeeeexeeexexeeeeexxxeexxxexxexxxexeexexeexexxxxxxxxexexxxexxexeeexexeeeexeeexexxxexeexexeeexexexxeexxeexexxxxexxxeeexeexxeexeeeeeexeeeexxxxxxxxxxxeeexxexxxxeeexeeexxexexeeeexxeexxeexxxeeeexexxxxxxxxxxxexexxeexeeexeeeexxxexxeexeexeexeexxeexxeeexxexeeeeexeeexeeexxxexxexxeeexeeeexeeexeeeeexexxexexexeeeexxeeexxexxexxeeeexxeexxeeeeeeexexxxeeexxexeexeeexxeeeexxeexxexeeexxexeeexxxxxxeexxxeeeeeeexexxxxexexexeeexxeeexeexxeexxeeeeexexxeeexxexxeeeexxxxxeexeeexxxxxexxeeexexxxxxeeeeeeeexeexeexeexxxxxxexexeeexxxxexxexeeexexeexxeexexexexeeexxexxexxxeexexxxeeeeeeeeeeeeeexeeeeexxexxeeexeexexeeexxexxxxeexexxxexeexxeeeeeexxexexeexexexeeeexeeeexxexeeexexeexeexxxxxeexeexxxxxeeexxeexeexxxxeeeeexexeeexeeexxeexeeexxexexeeeexxxexxxxeexxxxeeexxexxeeeexeexeexexexxxexxeexxexeeeeeexxxxxxxxeeexeexexxxexexexxexeeeexexeexeeexeeexeeexeexxxexxxxexxeeexeeeeeexxeeexexexxexexeeeeeexeeexxxexxxexxxxexeexxexexexxexxexxeexexxxexxxxexxexeexxxeexexxeeexexeexxexxeeexxexxeexeexeexxeexxexeexexxexeexxxxxexxexeeeexeexeexexxxxeeexxxxxxxxxxxxeexxexxxexxexxexexexxeeexxeeeexexexeexexexxeeexxxeeexeeeeeeeexexeexxxexxexxeeexexxeeexxeexexxeexeexxeexxxxxeexxxxxeexxxxxeeexxexexxxxxxeexeeexxexxxxexxxxxxeexexxeexexxeexxeeexxxxxexexeexeeexeexxxxeeexxeexxxxxexxexeexexxxxxxeexexeeexxxxeeeeexeexxxxxexeeexexxeeeeexexeeexexxeexxxeeeexeexexeeexxeexeeeexeeexxexxeexxeeexxxeeeexexxeeeeexeeexxxxeexxexxeexeeeexxexxeexeexeeeexeeexxxxeeexxeexeeexeeexeexxexexxeexxxxxxxxexxeeexxxeeexexxexxexeexeeexxxxeexxeeeexexxeexxeexexeexexeeexxxxeexxxxxxexxxexeexeexexxxxexxxxxeexeeeexexxxexxexxxxeeeexxeeeexeeeeexxexeeexxxexxexxeeexxxeexxxeexexeexxexeexxexxeexxxxxxxxxxeexeeeeeexeeexexxxxxeexxexexeexexxeexeeeexeeeexeeexeeeexxeeexxxxxeexeeeeexxxexexexeexxxxeeeeexxxxexeeeexxeeeexexxxexexeeexexxeexxxxxexexxxexxxeexxxxxexxxexxxexexxxeeeeeeeeexxexexxeexxeexeexeexeeeexxxxxxxeexeeexeeexexeexexxxxxeeexxexxeeeeeexeeeexexeeeeexexeexxeexxexeeexxxxexeexexexeeeexxexeeexxeeeexxxeexxeexeexeeeexxexexxexxxeexxexxxxxxxxxexeeeeeeexxxxxxeexexxxxexexeexeexxxxxxexxxexxexxeeexeeeeeexxexxeeeeexexexxxexexeexeexxexeexexxexxxexxxxeexexeeeexexxeeexxxxxxxxxxxeexeeexxxexxeexeexxeexexxexexxxeeeeeeexexeeexeeexexexxeeeexxxxxeexxexexxxexxeexexexexxexxeeexexexxeexeeexexeexxeeexeeeeeeeexeexxeexxxxxexexxeexxexeeexeeexxxxxexxexxeexxexxxxxexeeexxeeexxxxexxeexeeeeexxexxeexexexexxxexeexxexxxexxxxeeexexeexeeeeexxeeexexeeexxxxxexeexexexeexexexxxxxexeeeeeexxxexxxxxeeexexxexexxxxexxeeeeeeexeexxxexexxxeexxxxxeeexexxexxeeexxexeexxexxexxxxxexxeeexxxxxxxxxxxxxxxexexeeexexxeeexxexxexeexxexeexexeexxeexxexexeeexxeeeexxxexeeeexeexxxeeexxxxeexeeeexxeexexxxeexxeeeeeeeexxeexxxexexexxexxxxeexeeexxexxxeeexxeeexeexexxxxxexexxxxexxxexeexeexeeeexxexxexxxexeexxxxexxxexeeexxeexexexxexexxeeexxexexxxxeexxexxeeexxeexexeeexeeexxexxxexxeexxxxxxxexxeexexxxexxeexxexeexxexxxxexeexexxxxeeeeexxxxxxexexxxeexeexexeexxxeeexexeeeeeeeexeeexeeeeeexeeexxxxexxexxeeexxeexxexxxeexxxxeeexeeeexxeexexexxeeexxeeeexxexxxxeexxeeexeeeexxxeexxexxxxeexexeexeeeeexxxexxxxexexeeexxeexexexxeexexxexxxxxxexeeeexxxxxeeexexxxeeeexexeeeeeexexeexexxexeexxeeeexxxxxexeexxxeexxxxeexexxeeexeexxexxxxeexeexeeeexeeexxxeeeeeexxeexxeexeexeexexxxxexxeexxxexeeeeexxxexexxxxexexxeexexeeexexeexexxxxxxxeexxeexexeexxeexxexxexexeexxxexxxxxexexexeeexeexxexxxexeeexxxxexxexeeeeexxexeexeexxxxeeexeeeeexxexxxexxxeexxxeeeexexeexxeeeeeeexexexeeeexxexxxxxeeexeeeexexxxxxeexxeexeeexxxxexxexeexeeeexeexxxxxxeeexexxxexexxxexxxxxexxeeeexxexeeexxexxxexeexexeeeeeeexxxeeexeeexeexexxxxeeexeeeexxxexxxxeexxxxxxxxxexxexxexexxeexexxexexeeeexexexeexexeexexxexxxxxexeeeeexxxeeeeeeeexexeexeeeexxxxexexexxeeeeeexeexxexxxeeexxeeexxeeeexxexeexeeexexxxeeeexxexexxexxeexxxxeexeeexxeexexexeeeexxxxxexxxeeeeeexxxxexxeeexexxeeexeeeexeeeeeeexxxeexexeexexexeexxexeexexexexeexxeexeeexexexxxxexxxeeexxxxeexeeeexeeeeeexexxexexxeexxexeexexxexexxexxxxexxeexxexxxxxxxxeexeexxxxxxxxxxxxeexxeeeeeexxeexeeeexxeeexeexxeeeeeeeexexxexxxxeexexeexxxxexexeeexxexeeexeexxeexxxxxxxexxxeeexxexxxxxeeeexexeeeexeeexeexxxexxexexxexxeexexeexeexexexxxexxeexexxxexeexeeeexxxeeexexxxexexxxxxxexxeexexxeexxxeeeexxexeexexeeexxexexxexeexxxxexxxxxxexexxxeeexexeeexexexexxeeexxeexxeeeeeexxxxexexxxxxxexexeexxexxexxxxxexexxexxeexeeexxxexxexxeeexeexxxxexexeeeeexeeexxxxexxxxxeeeeexeeeexeeeexxxxxexxxxxxxexeeexxxeeeeeexexxeeexeeexxxexexeeexexxexexxxexeexexxeeexexxxxxxexxeeexexxxxxeexxeexxexxexeeeexexexexexeeexeexeeeeeexxxxxexxxxxxxxeeexxexexxeexxexxxxeexeexeeexeexeexeeexxxexxeeexexxxeeexexexxxxxexeexeexeeexeeexxxxeeexxexeexxexxxexexxxxxxeexexxeeeexxeexxeexexxeexxeeeexeeexxxexxexeeeexxexxexexexxxxexeeeeeeeexeexxexxxeexxeexxeexxxxxeexeexxxeexexxeeexxeeexxxxexexexxexxxxexexeexexxxeeexxxexexxexexeeeeeexeexexxxxeeexeeeeexxeexxxxxxxxxexxeeexxxexxeeeexeexexxxexexexexxxexexxeeexxeexxeeeeexeexxxexeexxxxexxxxexxxexexeexxexxxeeeexeexeexxexeexxxxxxxxexeeexxexexxeeexxexexxexxeexxeeeeexxexxexxxxexxeexxexxxxexxeeeeeexexxexxxexeexxexeeeeexxxeexexexeeexexxxxexxxeexxexeexexexxexeexxeexxeexxxeexexxxeeexeexexxxxxeeexeeexxeexeeexxexxxxxeeeexexxxeeeeeeexexxxxexxxeeeexeeexexexxxxexexxxexeeeeexexeeeeexexeeexxexeexeexexxxxeeexxxexxeeeexxexxexxeexxxeexxexxxeexxxxeexxeexxeeeexxxeeeexexexexxxeeeexxxxxexexxxxexeeeeexexexexexxxxeexxxexxxeeexxxxxxeexxeexxexeeeeeeeexxxxxeeeeexeexeeexxxexxxxxxeeeeeexxexeexeeeexxexxeeexxxxexxxeexxxexexeexxexexxxexexeeexxxxxxxxxeeeeexxexxeeexexxxexexeexxxxeexxxxeexeexeeexexxxxexxxxxexxxeexexxexxxexxexxxxxeeeexxxxeeexeexxxxxeexexeexexxeexxexexxxeexxxxeexexexeexxeeeexxxxxeexexexeeeexxeexxeeexexxeeexxeexxeexeexxexxexxeeexxexexxxexeexeeexeeexxeeexexxxexexeeexxxexeexxexxexxeexeexexexxeexxxeexxxxxeexxexexxeeeexxexxexxexxxxxeeexxxeeexeexexxeexxeeexeexeeexexexeexxxexexxexeexxexexeeexeeeexexeeeexexxxexexeeeexexxxxexxxeeexexeexeexxexeeexexxexxxxexxexxxeeexxexxexxeexeexxxxeeexxxxeexxxeexxexxxexexeexxxexxxeeexxeeexexeexeeeeeeexxexeeexxexeeexexxeexxxxxeexxexxexexxeeexexeexeeexeexeexexeexeeeeeexxxxeeeexxxxeeeexexxeeexeeexxxexxxxeeeeexeeexeexxeeexxxeexxexxxxxxxxexexexeeeeeeeexxeexxeeexxeexexexxxxeeeexxeexeeexeexeexxxxeeexxexxeeexeexexxxexexxxxexxexxxxxeexxeexxxxexxexeeeexxxxxxxeeeexxxxexxeexxxxexxeexxeeexxxexeexxxxxeeexeexxeexxexexexeeeeeexexeexexeexexeexexxxexxeeexxexexeeexeeexxxeexeeexxxexxeeexxexxxxxxxxexxxxexeexxxeeeeexxxeeexeeexexxxeeeeeexxexxexeexexexexexeexxexxxxxexexxexeexxeexexxxxxexxexexexxxxxexxxexxexxxeexexxexexxeexxxxeexxxexxexxxxxeeeexxexexxxxxexxeexxxxxeexxeexxxxeeexeeexeeexxexeexxxxeexxeeeeeeeexeexexeeexxxeexxxeexeeexexxeexxexeexeeexxeexxexexxxxeexxxxexxxxxxexeexxxxexxexeexeeeeexxxexxxxeexexeexxeexexeeeexxxxxxxeexeeexexeeeexexeexeeeeexexxeeexxeeeeeeexxxeeeexexeeexxexxxxxxxxeexeeeexxeeexxxeeeeexexxeexxxeeexexeeexxexxexexexexexexexxxxxxexxxxeexeexxxeeeexexexexxxxxeexxeexxxxxeeexxexexxxxxxxeeeeexxxxxexxexeexexexeexeeeexxeexxeexeeexexxeexxeexxxxxxeeexexeeeeeeexxxexxexxeexexeexxxxxexexxxexexexxeeexxxeeexexeeeexxeexxxxeexexxxexxxxexeeexxxxxxeeeexeeexxexeexxexxeeexxeeeeexxexeeexeeexeexxxexxxeexxexexexxxeexxxxexxxeexxeeeexxeeexxxxxxeeeexexxeeeexeeeeeeexexeexxeeeeeexxexxexxxxxeeexexeeexeeexexexexexexeeeexxxeexexxxeexxxxxxeexxxxexxxexeexxeeeexexxexxeexexxexexxxxeexxexxxxeeexeexxexexexxeeeexxeeexexxexexexeeeeeexxexxeeeeeexxeeeexxxexexeeeexexxxxexxexxxexxxexeexeexexexxxxxxeeeexxxeexeexeexexeeeexxexeeexexxeeeexxexexeexxxexeexxxeeexexxxexeeexexexeexxexxeeeexxeeeeeeexxxeexxexxxxxxexeexxexxexeeeeeexeeexeexeeeexxxxexexexeeexxeeeeexxeexxxeexxxxxxeexeeexxxeeeeeeeexexexxexexexeexeexexxxeeeexxxxexexxeexxxexeexeeexexeexxxexxxexxeexeexexxxxxeeexexeeexxxxxxxexeeexxxxxexeexxexeexexxxeexxeexexexxexeeexxxxeexxexxxxexexexxexxxxexxxxxexxxexexxxeexexeeeeexeexxxexxexeeeeeeexexeexxexeeexxeexxxxexeexeeexexxexxxexeexxxeeeexexxxeeexxxxxeeexxxeeeexeeexexxxxxeeeexxxxeeeexexxexexexeexeexexexexxxexeeexexxexeeeeeeexxexexeeexxeeexeexeexxexxeexexxxeeexxxexxxxexxexeexexexeexxxeeeexxeeexeexxeeeeeexxexxexexxxxxexxxxeexexxxeeeeeeexxexexexeeexexexexxxxxxxxxeeeexeexxeeeexxxxxxxxxexxxeeexeeeexexexxxexxexxexexexxexeeexexexxxxeeeeexxeexexxexeexxxxexexxexxeeexxeeeeexexexxeeexxexexexexxxxxxxeexexexxeexxxexeexxexxxexxeexexexeeeexxxexeexxxxxeeexxxxxxxexxxeeeeeeexxxxxxexxxxxxxexxexeeeexxeeexxxxxxxexexexeeexxexxxeeeeexxeeexxxxxeeexxeexxexxxeexxxxexexxeexxeexexxexxxxexxxxxexexxxexxeeeexxeexxexxxxexxexxxxxexxeexexxxxxeexxxexxxexeeeeexeeeeeeeexeeeeeeeexeexxxexxexxxxexxxxeeeeexxxexxxxxxxexxxeeexxxeeeeexxxeexxxxexexxeeeexxexxxeeeexxexexxxexxxeexexeeexexeexexxxxxexxxexeexxxeeexexexexxexexxeexexexxxxeexexexxexeeeeeexxeexxexexeexxeexeexxexxxeexexeeeexexxxxexexeeexxeexxxeeeexexxxxxxxxexxxexxeeexexeexexexxxexexexexxeexxxxxeexxeeexexxeeexxxxxxxeeexxxexxxxxxexxeeeexeexeeeeeexexeeeexxxeeexeeexeexxxeexxeeeexeexexeeeeexxxxxxexxexxexeexxeexxeeeexxeexxexexexexxexexxxxexeexxxeexexeexexexxexexexxeexexeexeeexxexxeexxexexxeeexxexxeexexxexxeexeexexxxexexeeexexxxxexeeeexeexeexeeeeexexxxxexexxxexeexexeexeeexexeexxeexxxexexxxexeexxxxxexexxxxxeeexxeeeeeeexexeeeeexxxxxeexxeexxxeeexxexexeeexeexxexexexeeeeeexxeeexeexeexxeeexxeeeexxeeexexeeeexeexxxxeeeeeexxxxxexexxexxxexexxxeexxxexeeexxeeexxxeeeexxxxeeeeeexxxexxxxexxeeeexexxexxeeeeeexxeeeexexxxexeexxxxxeeeeexxxxxeexxeexxexxeexxxeexxexxxeeeexxxeexxxexeexxeeexeexxxxxexxexeexexexxexeeeeeexexxeexxexexexeeexxeeexxxxxxeexxexexxexxxxeexxxxexxeeeexxxeeeexexxexxexxeeexexeeeexxxeexxexxeexexeexxexexxeeexxexxexeexeexexxxxxxxxexxexeexexeeeeexexxxxexexexxxxxexxexeexxexxxeeeexxexexeexxxexeeeeexexexexeexexxexxeexeeexeexeeexexeexexexeexxxxeexxexxeeeexexxeeeeexexxxexxxexeeexxxxxexxxxxeexxexexxxexxexexxeeexxexxxeeexxxexeexexxeexexexeexxxexxexexeeexexeeexeexxxxeeeeeeexxxexexxexxexexxexxxxexexeexxexxeexexxeeexxxxexxeeeexxxeeeeeeexeexexxexexexeeeeeeeexxeeexeexeeeexxexxeexeeeexxeexxxeeexxexxeexeexeeeexxeexxxexxeexeeeexeeeeeexeexeeeexxeeexxxeexxxeeeeeeexxexxexxexeexxexxxxxeexexxeeexxeeeeeexeexeexexxeeexxxxeeexxexeeeexxxxexxxxxexxeeeeexxxxeeexxxxxexxxexxeeeeeexeexexxxxxxexeeexxexxxexxexxxexexexxeeeexeeexxxxexeeexexexxxxxexexxxxexxeeexeexxxxexeexxexxeexxxexxexxxeexeeexeexeexxxxxxxxeeexeeexeexxxxexxeeeexexeexxeexexeexxeeexxxxxeexxeeeexxxeexxxeexxxxeeeexexexxexeexexxexexxexexxeexeeexxexxeexexxexexexexxxeexxexxexxeexxxxxxxeexeeeeeeexexexexxeexxeexexxxeeeeeexexxexeexxeeeeeeexxxeexexxexxexexxexxxeeeexeeeeeexxxxeeexexxexxeexxexeexxxxxexeeeexexeexexxexexxxxxexexxxeexxexxexeexeexxexexxexxxexxxeexxeeeexeexexexeeexexxxeexeexxxxxxxxexxexxexxxxexxxexxxexeeeeeexeexxxexxeeexexexexxxexeexxxxexxexexxexxexeeexxxeexxexexeexxxeeeexxxxxxxexxxeeexxexeexxxxeeeexeexxxeeexexxxxeeeeeexexeeeeexeexxexxeeeexxxxxeeexeeeexxexxxxeexxxeexexxeeeeexxxeeexxxxxexeexxexxxexeexeexxexexeexxeeeexxxeeexxxxexexeeexexxeeexexeexxeexxxexxexexxxexeexxxexxxexxeeexexexxexxxxxxexexeeeexxexeeexexxeeexeeeexeeexexxexeeexxeexxexxexxexexexeexxxexxxxxexeeeeexexexexxxxeexeexxexexexxexxexxeexexexxexexexexeexxxexeexxexxexxexexexxeexxexxexxxxxexxxxexxexxxxxxxxxxxxxxexeeexexxeexxxexxxxeeeeeeeexexeexxeexxxxexxexxexeexxexxeeexexeexexeeexeexeeeeeexxxxexeexxeexxeeexeeeeexeexxeexexexxexexxxxxexexxexxxeeexxxxeeexxexeexxxxexxxxxexeeeeexeexeeeeexeexxexxxxeexxxxexxxxxeeeexeexexxxxeeeeexeexxxeeexexeexeexxexexxeeexxeeexxeexxexxxexxeexxxexxxeexeeexxxxeexeexxxxeexxexxexeeexxexxxxeexexxeexexexxxxxeexxexexexxxxeexxexeexeexeexeeexeeeexeeeeeeeexexxexxeeeeeeexxexexeexxexeeexeexexxexxexxxxeeexxeeeexxxxxexeexxeeexexxxxxxxxxxxxxxxexxexxeexeeeexxxxxxxxxxexeexxxxxxexexxexxexxeexexxxexeeeexexexeeeeeeexxeeexxxxeeeeexexexxexeexeexxxeeexxexxeeeexexxexxxxeexxxxeeeeeexxexxexexxexxxeeexxeeeeeeeexeexxeeexxexxexxexexexeexeeexxxexexxeeexxxeexxxxexexexeexeexxxexeeeexxxxexxxexxeexexeexeeexexxxexexeexxxexxexxexeeexxeeeexexxxxxxxexeexxxexxexxxxexxxxxeexxexxxxeeexeeeeexxxeeeexxxeexxxeeeeeexxexeeexxxeeeexexeexxxeexexeeeexxxeeexxxeeexeexxeeeeeexxxxexxeeeexxeeexxxxexxxxeexxexxxexexxexxxxxxexeeeexexexeeexxexxxeeeexexxxeeeeexxeeeexeexeeexexxxexeexxeexxxxexxxeeexeexeexxxxxxeeeeeexxxxxexxeexeexeeexxeeeexexxexeexexxxxeeeeeeeexxxeeeexexexeeeexeeexxexxexexxxxexeeeexeeeeexxxeexxxeeexxeeeexeexeexeeexexxxexeexxxxxxeeexexxexxeeeeeexxeexxxexxxeexxxxxexexxxexeexxxxxxxexexexxeexeeeeexeeeeeeeexexeeexeexexxxeexxexeexeeexexeeeeeexxeexexxxxxxexxxeeexxxxxxxeeeexeeeexexexxexexxeexxxxxxeexxexxeexexxeeexeexeexexexxxxeexeexxexxxxexexexexxeeeeexxxeexexeexxexexeeexxeeeeeeexeexexxxxeexexeexeexexexeeeeeexexexeexexxxxeexexexxxeexexexxeexeexxxexeeeeexeexeexxxexxexeexeexeeeexeexeexxeeexeexxexxexxxxeeexxexxxxxxeexexxxexexxxxxexxeeexexxeexxeeexexxxexexxxeeexxeexexexexxxexxxexxxxxxxxxxexexexeeeeexexeexxeexeeexxxexeeexexxxxexxexxeexxxexexexxexxexxexexxeeeexxexxxexeexexxexexeeeexxxexeexexexxexxxxxexxxxxeeeexexxxexeexexxexxexxxexxxxeeeeexxeeexeexexxeeeeexxxxxexexeexxeexxxxxxeexxeeexeexexeeexxxxxxexxexexexxexexxxexxeexexxeeexexexexxxexxxeexxeeexxxxxxxeexxxxxxxxeeexexexxeeexexxxxeexeexexexeexxexxeexexexxxeexexxxeeeeeexxxexxxxeexxeeeeexeeexeexxeeeeexxxexxxxeeeexxexexeeexxxeeeexeeexxexxexeeexxeeeeeeeeexxxexexeeeexxeexeeeeexxexxxeexeeeexxexeeexxeexxeexxxeexxxexeexexexxeexxxxeeexxeexexxxexxxxxxeexxxexeeeexexxxxeexxxexexxxxexexeeexeeeexxxxxeeexeeeeexxeexxeexxexexxxxeexexxeeeexexeexeexxexexexxxxxexexxexxxxeexeeexeexeexexxxxexxxeexxxxxxxxeeexexxxexxxeeexxxexeexxexeexxexxexeexeeexxexxexexexxxxexxxexeeeeeeeeexeexxexxxxexxeexeexeexexxexeexexxxxexexxxexeexexeexexxxeexexeexeexexxexexxxxxexexexxexxexeeeexeeeexeeeeeexeeexxeeexxexexxexxeexeeeexxeexxexxxxeexxxeeeexxxxxxeeeexexexxexeexxeeeeeeeexeexxexeeeexeexxeeexexxxexeexxexeeexxexxexxexexxxexeexxxxexeeeeexxxeexxeexxxeexxxxxexxxxxxeeeeexxxeeeeexxeeeexexexxexxeeeexxxxxexexxxxexeeeeeexxexeeexxxxexexxexxexxexxxxxxeexeexeeeeeeeeeexeexxxxeeexxexexexexxxexxxxxeeeeeeexxexeexxeeeexexexeexeexexxexexxxexxxxexxexexexeeexxeexxexxexxxeeeeexxexeeeexeexexxeeeexxxeeexxexxxxeexeeexxxxxxexxxxxeexxeexexxxxexxxeexxxxxeexxxxxxeeexexxxeexeexxeexxxexeexeeeexxxeexexeexxexexexxeeeexxxxxexxxexexexeexexxxxxeexexxeeexxexexexxeexxexeexxxxexxeeexxeexexxxeeeeexxxeeexexxxexexexeexxexxexxxxxexeeexeexexexeexxxeeeeexxexxexeeexxeeeeexexxeexexexxxeeexxxxexxexxexxexeeeeexexxexxeexxxexexxexxxxexeexeexxeeexxxeexxexexexexxxxexeeeeeexeexxxxxxxxexxxeeeeeexxxxeeexxexexxxxexxxxxxexexxxxeexeeexxxxxxeexexxxeeexexeeeexxxxeeexeexxxexxxeeexxexexexxexeeexeeexxexexexxexeexeexeeexxxxeeexxexxxxexeeexxexxxeeexxexxeexexxexeeeeeexxexeeeexxxxxeexeexxexexeexxeeexxxeeexexeeeexeexxeeexxxeexxexexexxeeeeexxxeeeeeeeexeexxxeeeexeexexexxxxxeeeexxexexxxeexeexxxxeeexxxxeeeexeexexxxexexeexexxxeexxeeeexeexexexeeeexeeexeexeexeeeexexxxeeexexexexxxxxxxeeeeexxeexxxexeeexeeexeexxeexexxxxexeeeexexeexeexxxeexexexexxxeeexxeeeeeexeexxeeexeexexxxeexeeexxeexxxxxexexxxeeexxxexexexexxxeeeexeexeexxeeeeeexxeexeeeeeexexxeexeexeexxxxeexexxexeeexxexxeexxxexeexexexxexxexexxxeexxxeexexxexexexxxxexeexxxexeexxexxexexxxexexxexxeeeexexxxxeexxxeexxxeexxxeeeeeexxeexexeexxexxexeeeeeexeeeexxxxxexxeexxeexeeexxxxxxxxxxexxeeeeeeexexxxxxxxeeexexeeexxxxeeeexxxxexxxxxxxeeexexxxexxxxeeeexeexxeeexxeeexxexxxxxeexeeexeeexeexxxeeeeeeeexexxeeexxeeeeeexxxxeeexxeeeexexxexxxxxxeeexeeeexxeeexxxexeeeeexxeexxxeeeeexeexxexxeeeexxxexexexeeexxxeexxxxeexxxxxxxxeeeexexxxexxxeexxeexexxxeeexxxxeexxxeeeeeeeexxxxxeexxeeexexexxexeeeexxxexxeeeeeexexeeexxeexxxxxxeeeeexexeeeeexxxexxeexxxeexeexxxxeexexxxexexxxxexexxxeeeeexexexxeeeeexxeexexexxxexeexeeeexxeexxexexeeexxexxexxxxxxeeexexeeexxexxexeeexxexxexexxxeexxexxxexxexexeexxxxeeexxxxeeexeeexxexexxeeeeexeeeeexxeeeeeexexeeeeeeexeeexeexeeexxxxeexxxeeeeeexxexxxeeexexeeeexxxeexexexexxxxxxxxxexxxxxxxeeexxxxeexxexxxxxeeeexxexexxxxxexxexxxxexeeexexexexexxxeeexxeeexexxxxexexexxeeexxexexeexeexxxxexxeeeexeeexexxxxxxxxxexexexxeexeexexeeeexxxeexeexexxxeeeeeeexxxxeexexxxxeeexxxxeexexxexexeexexeeeeexxxexxexxeexexexexxxeexeexxexexxxeeeeeeeexxxexxxxexxxeexeexeexxexeeeeeeeexxxeexeeeexexxxxeeexeeexxeeeeeexxexxxxexxxxxxxxxeeexxxeeeexeexeexeeeexexxxeeeexexxxxeeexexxxexeexeexxxexeexeeexexxexeexexeeexeexeexexexxeeeexeexeexeexxxxxexeexxxxxexxexeexeexxexexeexeexexexxexeeeexexeexxexxexeeexeeeeexxxexxxxxeeexexexxxxexeeeexxexeexxxexxexeeeexeexexeeexexeeexxxexxxxexxxxexxxxexeexxexxeexxeeexxexeeeexexexxxxexxxexxxxeeexeexxeeeeeexxxeeexexexxxxexxxxexeexxxxxxxxxeexeexeeexxxeeeexexxxeexeeexexeexeexxeeeeexxxxexxxeeexxxexxxxexxxxeeeexeexexxxxeeexxexeeeexxxexxxxxexexexexxexxexxxxxxxexexeeexexexxeeexxeeexxeeexexxxxxexxxeexexeexeeeeexxxexxexxexexxexxeexxxexexxxxxxxxxexexexxxxxexxeexxxxxxeexexxexxexexxeexxxeexxxxeexeeexxxexeeeexexxxeexxeeexexxxxxxxexexeexeexeexxxxxxeexxexxexxeexexexexexxxxexeeexxxxeeexxxxxxxexexexeeeeexxxxexeexexxexexxeeeeeexxeeexxeexeeexexxxxxexxeexeexeexxxeeexeexxeeexxeexexexxeeexeeexeeeeexxxexexeexxxxexxxxxexexxxeexeexxexeexxexxexexxxxxeexexxeexxxxxxxxeexxexxxexexexeeeeeeeeeexexexeeexxeexxxexxexxxxexxxeexeeexxxeexxexxxxxxxeeexxxexeeeeeexeexxxexxxxeeeexxxxxxexeeeeeeexxxxxxexexexxeexxxeexeexxxexxxxeeeexxxxxexeeexexxexexxxexeeexxxxeexexeexexeeeeexxxeexxexexeexeeexeeexxxxxexxxexxeeexxxxxxxeeeeexeeexxexeexxexxxxxxxxexxxexxeexxxxxexexexxeexexeexxxexxxxxxeexeeeexexxexexxxxxxxeexexeexxxxxxxxxeeeexeexexxxxexxeexexxxeexexeeexeeexeeeeexeexeeexexxexeexxxxxeexxexeeexeexeexxxeeeeeeexxexexxxexexxxxxxxexxeeeeeexxxexxxxeexeeexxxxexeexeexxeexxeeeexxxexxxeeexeeexeeexexxexxexexxxexxxexexeexxexxxxexeeeexexxeexexeeexexxxxxeexxxexeeeeeeexeeeeeeeexxeeexexxxxxxexeexxxxeexexxxxxexexxxexeeeexexeeeexxxxeeeexxxexxxeeexxxxexeeexxexxeeexeeeexexeexeeexeexeexeeeexeeeeexxeeexxxxeeexeexxeeeexexexeeexexxexexexxxexxxexxxxxxxeexxexexxxeeeexxxeeeeexxxxxxxexxxxeeeeexxexexxeeeeexxxeeeexxxxeexexxexxxxxxexxxxexeeexexxxexexeeexeexxexxeexexxxxxexxxexeexxexxxxexeexxexxexexxexexxexxeeeeexxexeexxexxxexxeexxeeeexexxxeexxexxxxexxxxeexxxxexxxeexxeeeeeexeeeexxexeeeexexeexeexxeexexxxeexexxeexeeexxxxeexeexeeexeeeeexxxxxxeeexxexeexxeeeexexexxxxxxexeexxxxexxexeeeexexeeeexexxxexeexxxeeexexexexexxxeexexeexxeeeeeeeeexeexxexxexexexeexxxeexxxexeeeeeeexxxeeeeexxxxexeeexeeexxxxxxxxeexeexxeeexxxexxeeexxeexexexxxexeexxeeeexeexexxxxexeexxxxxeexexeeexxxeexxxeeexxexeeexeeeeexeexeexxxexeeexxxexxeeexxeexxexxxxeeeeexxeexexeeexxeeeeexexxeeeexxxeeexeexexeexxxxxexexxeeeeexexxeeeeeeexxxexxxxeexexxxxexeexxexeexeexexeexxexxeeexeeeeexeexxxxexexexeexexxxxxeeeeeeexxexxexexxeeexxexexxeeexxeeeexxeeeeeexeexexxexxxxeexxeeeeexxxeeeeexxeexxexxxxxeeexexxeeexexxeexxexeeexeexeeeeeeeeexexexeeeeexxxxexxeeeexeexxxxxxexeexexxxxexexeeeeexeexxxeexeexexeexexexeexxeeexxexxxxxxxeexexxeeexexexeexxxxeexxxxexxexxexeexeeexxeexxxeeeexxxxxexexeexxexxeeexeexxxeexeexxeexxexxxeexxxxexeexexexxeeexxexxexexxeeeexeeeeeexxeexxexeexeeeeexeexxeexxexxxexeexxxxxxeeexxxxxxeexexexxexxxexeexexxxxeeeeexexeexexxeexeexeexxxexxxxxexxxxeexexxxexeexeeeeeexxxxexxeexxexeexxxxxxxxexeexxexexxxeeexexxxeexxexxxxxxxxexexexxexexxeeexexxxeexxxexxxeexxeeeexexxxxexeeeeexxxeexeexeeexexxexxexxeexexexexeexxexxxxeeexeexxxexxeexxexexxxxxeexexxexxxxxxxxxeexeeeexxeeeexeeeexeexxeeexxxexxxxeexxxexexxexeexxxxeeexxeexxxeexxeexxxeeexeexxxxeeeexeexeexxexxeexeexxxexxeeeexeexxxeexxxeeeeeeeeeeexxxeexexxxxexeexxxxxeexeexxxxeexexeeexeeeeexxeeexxxxexexexexexxexexxxeexxeexxeexxexexeeexeeexxexexexxxxexexeeeexxxxxexxeeeexxxxxxeeexexexeexeeeeeeeexexeexeeexxexxeexxxxxxexxexeeexxeexxexxxeexeexexexeexxxeexeexxexexeexexxxxxxexexxxxeeexeeexxexexexxexxexxexxxxxxexxexxxexxexeexxeeexxxexexeexxxxxxxxexeexxeexexexexexexexxexeeeexeeexxexxeexxxxexxexeexeexxexxexexeexexeeeexxeexeeeeeexxexxxeexexexxexexexxeexeexxeexexxxxexexxxxeexxxeexxxeexxexxeeexeexeexexxexxexxexeeeeexexxxxxeeeeeexexexxeexxxxxxeexxxeeexexxxexxeeeeeexeexxxeeexexexxexexxxexeexexxxxexxxxexxxxxexxeeexeexexeeeeeexxexeexeexexxexxxexxeeeeexxeeexxxexexxeexexexxeexexexexxxxxxeeexxeeeexxeexxexexexxeeexeexxeeeexexxexxeeeeeeeexexexexeeexexexeexeexexxxexexexexeexeeexxexexxxxxexxxexxxxexxxxxxxeexxxxexxeexeeeexexxxxxxxexxexxexxxxeeeexexeeexxexeeexeeeexexexexeeeeeeeexexxxxxxxxxeexeexxxxeeexeexexexeexexxxeeeeeexxxxeeeeexxeeexeexexxxxexxxexxxxeeeexeeeeeeeexeexxxeexxxxxexxexexexeexeeexexxxexxeeeexxeexxxeexexexeexeexxxexeeexxeexexxxexeeexexexxeeexexxeeexxxxeexxxxexxeeeeexxxeeexexxxxexxexeeeexexxexxxxxxeexeeeexxxexxxeexeeeexxxxeeeeeeeexxxxxxeeeexxexeeexxxeeexexxexxxxeexexeeexxexxxexxeeeeexxxxxeeeeexxxxexeeeeexxexeexxxexexexexeeeexxxxxxexxxxeeexexeexexxeeeexxexxxeeeexeexxeeeeeeeeexexeexexexexxeexeeexexxexexxexeexxeeeeexxexexeeeeeeeexxxexxxexeexexexxeexeeeexexxexxxxxxexeeexexxxxeexxxexxxeexxxeeexeexexxexxxxexxxeexeeeeexxxxexxexxxeexeeexeexeexeeeeexxxexexxexxxeeeexexxexxxeeexxxxxxxxexexxxxexxxxeeexxxexexexxxxxxexxxxxxxexeexxexxeexeexexexeexeeexxxxxeeexxxxxeeeeexxexeeexxxxexxexxexxxxexexxxxxxxxxexexxxeexxxxexeexxxeeeexxxxxexxxxxxeexeexeeexeexeeeeeexeexxxxeexxeexxxexexexxxxxxexexxxeeeexexxeexxxxeexxxeeexeeeeexexeexexxexeexeexexexeeeeeeeexexeexexxxxeeeexxxxxeexeeexeeexeexxeeexxeeexexeeexxeeeexxxeeeexeeexxxeeeeexeeeeeexxexxxexxxexexxexxxxxxxexexxxeeexexxxexxeeexxeexexxeeexxxexexxxxeexeeeeexexeeexxeeexeeexxxxxxxexexeeexexeeeexxeeexeexeeeexxexeeexeexxxeeeexxeeexeexexexxeexexexxexexeeexxexxxexeexeexxxexeeeexexexexxexexxxxxxxeexxexxeeexxexxxxexexexeeeexxxxexxxxeeeeeeeeeexeeexxxeexeexxexxexexxxxxeexxxxxxexexeeeeeexexeeexeeexxexxexexexeexexxxexxxeeexxeeexexexxxxxexxxeeexexexxxxxexxexxxxxeexeeeeexexxexexexexxexexexexexexxxxxxeexeexxexxexxxxxeeeexexxxeexxxxexxeeeeexeexxeeexexeeexxxexxxxeeeeexexexxeexxxxexxeeeexxxxxxxexeeexeeeexxeeeexexxxxexxxexeeeexeeexeexeeexeexexxxxeexxxeexxeexexxexxxexxexxxexxxexxexeexexxxxexxxxxxxxxxeexexeexeeexeexxxexexxxxexexxexexxexxeexexeeexexexxxexxxxxexeeeexexexexxeexexxeeexxexxxexexeeeexexxxxexxxexexxeeeexexxxeexeexexxexxxeeeexxexxxexxeeeexexexexeexxxxxxeeexexeexeeexexeexexexxxexexxxxexxexeexeeexeeexeeexexexexeeexxxeeeeexeexxxxxxxexexxexexexxeexeexexeexxxxeeexexeexxeeexeexeexxxxeeexexexxxeexeeexeeeexeeeeeexeeexeeeexxeeeexeeeeexeeeeexeeexexxxxeexxeeeeeexeexxeeexxexexxeeeexxxeexeeexxeexxexeeeexeexeeeexexxxxxxexxexeeexeexxeexexexxxexeexxxxexeeeeeexxeexxexeexxexxxxeexxeexxexeexxxeexxeeexexxexexxxxeexeeexxxeexexxxeeexeexeeeexexeeexexxxexeeeeexexxxxeexxeeexeexeeeeeeexeexeeexexxeexxexxxexexxxxexxxeeeeeexexxexxeexexeexeeexeexeexexeexxxxxxexxxeexexexexeexexxexxexeeexxxexeexxeeeeexxeeeexxeexexxxeexexexxxxeexexxexxxxxexxeeeeexeexexxxxxexxxexexxeeeexxexxxxexeexexeexxexxeexexexxexexexexeeeeexexxxxxxxxxxeexxxxexxexxeeeeexxxexexxeexeexxeeeeexxexexexxexexeeeexxxxexeeeeexeeeexexeeexexeeeexxexexexexxxeexexxxxxxxxeeeexexeexexexeexxxexeeexxexxeeeeexxexxeeeeexeexeeexxxeeeexxxxxeexxxeeexeexeexexeexxeexxxexexeexxxxeexeeexxxeexxxxexxxeeexxxexexeeeeeeexexeeeexxxeexexxxeexexeeexxeeeexexxexxxexexxxexxeexxxeeeeexxxxeexeexxexeeeexexxxeexexxeexeeeeeeexxexxexxxxeexxxxeexexxxxeeeexxeexxexxxexeeeeeexxexxxxxxxxeexeexxeeexxexxxxexxeeeexxxexexeexxxeexeeexxxexxxxexxxexexeexxeexxxxexxxexeeexxeexxxeexeeeexeexeeeexeexexexxeeeeeexxxexxxxeeeexexxexeexxxxeeeexxxeexxeeexeeexexxeexexxexeexeeeexxxeexeeexexxxeexeeeeeexeeexexeeeexxexeeexeexeeeexeexxeeexexexexxxxxexeeeeexxexxxeexxexxxxexeexxxexexxxxexeeeexexeexeexxxxeexeeeexxxeeeexexexxxexxxxeexxexxexxxeexeeexxxexxexxexexeeeeexxxexxxxxexxeeexexxeexexxxxxeeeexeexxexeeexexxeexeeeeexxxxeexxxxeexeexxexxeexxeexexxxeexeeeeexeexxeeexxexexeeeexxexxxeeeexxxeexeexxeexexexexexexeexxeeeexexexeexeexeexxxeexexxxeeeexeeexexeexxexxexxeeeeeeeeeexxxxxexxeexxeexxexxxxxxxeexeexxeeeeexxxexxxxxxexeexexeeexxeeeexeeexxeexxexxxeeexxxexexxxxxxeexexxxxeexxexxxeeexxxxexxxexexeexxexxxeeeeeeexxexxeeexxeeeeeexxxeexexexeeexeexexxxexxeeeeeexxxxexexxxexexeeexexexxxexeexxeexeexeeeexexxeeexxeeeeeexeexxxxxxxxxxxxxxeeeexxxxxexxeeexeeexexxxeeeexxeeexxxeeexeexxexxeeeexxeeexexexxxeexxexxxxxxexeeeeexxeexxeeexxxxexeeeeexexxeexeexxexxxexxxeexxeexxxeeeexeeeeexxxxexexxexexexxexexeeexeeexeexeeexxeexexeeexexeeexxexexeeexxexxexxxxxxeeeexxeeeexxxxexexxxexxxeexexxxexeeexxxexexeeeeexxxeeeexxxeeexeeeexeeexxeexeexexeeexxeeeeeexxeeeeeeeexexexxexxeeeexxeeexeeeeeexxxexxeeexeexeeeexxxxxxexeeexexxxxxxxexxxxexexeexxxxexxxxxexxxxeeexexxxxxxexexexexexexxexxexexxexxexxexxxeexeeexxxexeexxxxeeexxxexeexexxxxxexeeeeexexexexxxxxxxxxxxexexeeeexexexexexxxxeexexxeexxeeeeeeexexxexxeeexeexeexeeexxeexxeexxxxexeeexeeexexxexeexxexexexxxeexexxxexxxxxeeeexeeexexexxxxeexxeexexxeexxxxxeeeeeexxxxxexeexexeexxeeeeeeeeeeeeeeeexxxxxxxeeeeexexxeexxxxxeexxxxexeexeeeexexxxexexxexexxeeexexexxeeexexxexxxexxeeexexxexeexeeexexxxxexeexexxexeexxexeexeeeexxxexeexxxxxexxeeexeeexxexexxeexxeexexeexeexexexeexxxxeexeeeeeeeeeexexxeeexeeexxxxexxxxxxeeexxexexxxeexxexxeexxeexxxexexeexxeexxxxxxeeexxxexxexeeeeexxxxeexxexexxeeeeeexexexexxexexexxxxeeeeeexxeeexexxxxeeexexexxxxeexxxxxxeexexxxexxeexeexeeexxxxeeexexxxexxxeexexeexxxxxeeexeexxexxxxeexxxxexexxexxxexxeeeeexexxxxxeeeexxeexxxexexxxxxexeexxexxexeexexxxxeexexexexexeeeeeexxeeexxeeexxxxxxxeeexxexexeeeeexexeexeeeeexxxexxexeeexxxeeexeexxxxexexexexxxxxexeeexexeexeexeeexxxexexxxxxexeexxxeeexexexexexexeeexxexexxxeexeexxxxxxxexexeeexeeexxeexexeexxexeexxexxexxxexexxxxxexeexxxeeeexxxxxexeeexexeexexxxxxexeexexxeexxxeeexeeexeeeexeexeexeexxxxxxxxeexexxexxexeeexeexeexxxeeeeexexxexeeeeexeeeeexxxexexexxxxxexxexxxxxexxxexexxxeeeexxexxexxxxxeeeexxeexxxxxxeexxeexeeexeexexexeexeeexexeeexexxeexeeexxxexeexxxxexxxeexxexexeeeeeeexxxxxeeexxxxxxxxeeeexeexxxexxexexexxexexxexeeeeeeeexxxxxexexxexxexxeexxeexxxexeeeeexeexexxexeexxexxexexexexeeeeeexeexxxeexxexexeexexexxxeeeeeeeeeexexexxxexexxxexxeeexxxexxxxeeexxeeexeexeexeexxxxexeeexxxexxexxxxxxexexxxeeeeexeexxeexexxxxexeeeexeexxxxxxxexxxexexexeexexeexxxeeexexxexexxxxeexeexexxxeexexeexxxeexeexeexxxxeexxexxexexxxxxxeexxexexexxexxexexxxxeeexeeexexxeexexxxeexeeexxeeexxxxxexxxeeexeeexxxxexeexxexxxexxxeexxxxexxxeeexeeexeeexxxxeeexxexxxexexexexxxxxxxeeeexexxxxxxxxxxexeexeexxeexeeexxeeeeexeeeeeexeeexexeeeexexexexxxxeexexxeexeexxxexxxxxxexxexexxxxxxxxeexeexexexxexxexexxxeeeexeexexxeeexeexxxexeeeeeeeeexxexexeexexeeeexxexxxxxexxeexxeeeeexexxxeeeexxxexxxexxxexexxxxxxxexxexxxxexxxexxexexeeexexxxxxxxeeexxeeeeexxexeeeexexexxexxeeexxxexxexxexxxxxxexxeeeeeeexexxxexexeeexeeexeexexxexxxexxexxxxxxxexxxxxxeeexxeexxxexxxeexxexxeeeeexxexeexeexxxexxeexxxeeexexxxeeexxxxxeexexexexxxxeexxxexxeeeeeexxeeexxexeeexxxxexxeexxeeeexxexxxeexeexxexxxxxeexeexxeexeeeexxxxxexeexxxexxexxexeexxexeeexxxexeeeeexeeeexeeeexexeeeexexxeeexexxxeeexexexxeeexxexexeexxxeeexxeeeexexxxexxexxeeexeexxeexxexeexxxeeexexeeeeexxeexxeeexeexxxxxexxeeeeexxxeeeexeexeeeexexxxexxexxexeexxeexeeeexxxxxxexxexxxxeeexexeeexxexexxxeeeeexxxeexeeeeexxexeexxxxeeeeeexxxxeexxxeeexxxxxeexeeeeexexexeeeexexexexexxeexexxxeeexxexexxexexxxeexxxxexxexexeeeeexeexxxxxeexxxxexxxxxxexexexeeeeexeeeeexexxxeeeeeeexxeexexxxxexexeeeexxxxxexeeexexxxxxxxexxxeexxexeexeeexeexexxxexexeexeexexxexexxeexeexxeexxxeeeeexxeexxexxxxxxeexxxxeeexeeeeexxeeeeexeexeexeeeeeexexexxeexexexxeexeeeeeeexxxxeexxeeeexxxxeeeeeeeeeeeeexxeexxexexeexexxexexxeeeexeeexeexxeeeexxeeexexexxexxxeexxexxeeeexxeeeexexxexeexxeexxxexxxxexexeexxxeeexeeeexxxeexxexxeeexexxxeexexeexxxxxxeexeexxxexxexxxexeeexeeexxexxeexxexeeexeeeexxeexexxeexxxexeeexexexeeexxxxxxeexeeeexexxxexeexexxxxeeeexxeeeeeexxexxxexxexxexxexeeexxxxxeeexexexeexexxxxexxxxxxxeeexeeexxxexxxxxexeexexxexexeeexexexexxxexxxxxexeexexxxxexexxxeexeexxeeexexxxxxeeeeeeeeexxxxexexeeexxxexxexxeeexexexxeexeeeeeexeeexexxeexxxexxxeexxxexxexxxxexxxxeexexexxexxxexexxxeeexeeexeeeeexexeexxxexeexxxxexexeeeeexxxexxexeexxexxexxeeexxxeexexeexxxexxxeexexeeexxeexeeexxxxxexeexxxexxexeexxexxxexxxeeeeeeexeeeeexxexxexxxexxxxeexxxexxxexxxxexxexeeexeeeeexxeexxxxeexeexxexexxexexxxeexeexexeeexexexeexxxeexxexexxexxxexexeeeexxxexexeeexexxxexxeexxeeexexeeexxeeeexeeexxeexexxxeeeexxexxexxxxeeexexeeeeexexexxxxeeexeexxeeexexxeexeeeexeexxxxxxxexxxeeeexeeexxeeexeexexxxxxexxxxxxexexxexexxxeeexxeeexxxeeeeeexeeexeexexexxxeeeexexexexexexxxxeexexeexxxexxxeexxeeexexeexxexeexxexxxxexxxeexexeeexeeexxexeexxexeeexexxxxexexxxexxxeeeexxxxeeexeexxxeexxxexxxxexxeexxeexxeeeeexexxxexexxexeeeexexxexxxeeexeexeeexexexxeexxeexxxxxexxxexexeeeeeeexexeexexexexexeexeexxexeexexxxxxexxxexxeeeexexeexeexeeeeeexexeexeexexeexxexxxeeeeexexxexeexxxxxxxxeeeexxxxeexxxexeexexxxeeexxexeexxexxxexexeexxeexxexxxeeeexxxexexexeexxeeexeeexeeeeexxxxxxxexexxxexexxxxxeexeeeexexexxxexxxxxxxxxeeexxeexeeeexxexexeexxxexxeexxxeexexeexxexxxxeeeexxxexeexexeeeeeeeexexeeexxxeeeeeexexxexxxxxxxexxexxxxeexxexxexexxeeexxxeexeeexxxeeexeexeeexxeexexxxxexxxexxexeeeexxeeeexeexexexxxexxxexeexxxxeeeeeeeeeeexxeexxeeeeexeeeeeeexexexxexexxxeeexeexeeeeexexexexeeexexeexexexxexexxxxeeexexexxeexexxxxxeexexxxxexxxxxeeeeexexexxxxxeexexxexxxexxxeeexeeexxexeeexeeeexexxxxxeeexxxxeexxxxeeexexxxxxxxeexexeeexxexxxexxeeeeexxeexxexeeeexxeeexeeexxexxexxeeeexexxxeeeeexexxeexxexeeexexxxxeexeeexeeeexeeeexeeexxexxeeeeeexxeexxexeexexeexeeexxxxeeexeexeexxeeeeexeexexeeexeeeexxxxxxxexeexexexxeexeeeexexxexxxxxxexexxxxxeeeexxxxxxxxeexxexeexeexexxexxxexxxxexxeeeeexeexxxeexxxeexxxeeexexeexxeeexeeexxxeexexeeeexexeexexxexxxeexxxxexexxxxeexxxxeeexxxxexeexxxexxxxexeexexeexxexxexxeexexexeexeexxxxxxxxexxxxxeeexexeexeexxxxxexxexeexexeeeexxxexxxxxexxxxxxexxxxxeexexxexxexxxxxexexxxxeexeexeeeexxeeeeeeeeeexxxxxexxeeexeeeexexxexxxexxxeexxexxxxxeexxxxeeexxexexxeeeeexeeeeexxexxxeeexexeeexxeeeeexxxxeeexxxxeeeeexeeeeexeexxeeeeexxxeeexxxeexexexxxeexeexexeeeexxeexexxexeexexeeeexexxexexxxexeexxxxxxxxxxxeexxeexxeeeeexeexxexeexeexeeexxxexexxexeexxeexexexxexxxeeexeeexxexxxeeexxeeeeexeeeexxeeexexxexeeexxxxexeeexxeeeeeexexexeexexeexeeeeeexexxexeexxeexxeeeeeeeexxxxxeeeexexexexxxxeexxxxeeexxeeexxeexxexxxxexxxxxeeeexxxeeeexxeeexeeeexexexexxxeexeexxeeexexxxxxexexxexexexexeeeeeexeexeexeeexeexxxxxxexeexeexxxxexeeeexxeexxxxexexxexxxxeexexexxxexeexeeexxxeexxeeeexxxexxeexeexxxxexexxxexxxexxexexeeexxexxxxxeeexeeexexeeeexxxxexxeeeeexxexxeeexxxeexexxeexxxexeeexexexxeexxxxxxxeeexexxxexeexeeexexxexxeeeexeexxxexxeexeexexexexeexeexxeexxxxxxeexeeexxxexxeexexxxeexexxxeexxeexeexexeexxxexxexxxxxeexeeeexexeeeexexexexeexxxeeexxxexxxxxxexxexeeexxxxxxxexxxxxexeeeeeeeexeexeeeexxeeexxeexxexexexexxxxxexexexeexxxeeeeeexxxxeeexxeexexxxeeexeeeexxeexexeexeeeeeexexxxxxexeeexeexxeeexeeeeexxeexxexexxxxeexexeexeexxeeexxeeeexexeeeeexexexeexxeeexxexxxexxexexxxexxexxeexexxexxxxexxeeeeexxxeexeeeeeexxxeexxexexexeexexexeexexeeeeeexeeexeeexxxxexexeeexxxexexexxxexxxeexeeexexxxeexeexxeeexxexexeeeeexxxeexeeexxeexeexeeexeeexeexexeexxxxxxxxexxxxxexxxeexexexxeexexxxxxexxxxeeexxeexeexeeexxexxeeexxeeexexeexxxeexxxeeeexxexexxexeexexexexeeeexxeeeexeexeeeexexeeexexexxxeeexexexxxxeeeeeexxeexeexexexxexxeeeeeexxexxexxeexxexexexexeeexxexxxeexxeexxxxeexeexeeeeexxeeexxeexxexxxeeeeexeexxexexxexxexeeexxxexeeeexeeexxexeeexxeexxeeeeexexeexxeeexexxexexxxxxxeeeeeeeexexeexeexxxexexeeeexxxexeexexexxexeexxexxexxexexxxeexexeeeeeeeeexxxxexxxxxeexxxxexxexxeeeeexxxxxexxeexxxexeeexeexexeeexxexeexeexexxxeeexexeeexeexexeeexxxeeeexeexexxxeexxxeeexexxxxxxexeexeeeeeexeeeexexexxeexeexxeeeexexexxxeexexeeeeeexxxxeeexxxxxeexxxeexxeexexxexeexxeexxxexeeeeexeeeexxeexexeexxexexxeeexxxxexeeeeeeeexxxexeeeexeeexexexeexexxeexexxeexexxexeexxexexexxeeexeexeeexxxxeeeeexxeeeeexeeexxeexexxxexeexeeexxxexxeexxxeexexxeexxxxxxeeeexxeexxexxxexeeeeeeexexxexxxexeeeeexxeeexxexxxxxxxxeeeexxexexeexxeeexeeexexexxxxexxxxxxexexxeexxexexxxxxeexxexxexxexeeeeexexeeeeexeexexexxeeexxxxxeexxexexxeeexxxexexxexexeexxxexxxeexxxxeeeexexxexeexxeeexexexxxexeeexexexeexeexxeexxeexexeeeexxxxeeeeeeexexeeeeexeexxexeexexxxxexexeeexeexxeeeexxxexxeeexxexexexexxxxeeexexxeexeeexxxxexeeeeeexxeeexexexxxexxxeeexxexxxexxeexeexxxxexeeexexxeeeeeexxxeexxxxexxexxxexxxexeexxxxxexeeeexxexeexexexexexxeeexxxxeexxxeeexxeexexxeeeeexxexxxexxeeeexeeexeeeexexxexeexexxexxeeeeexeeexxeeeeeexexexeeeeexeeexxeeexeeeeexxeexeeexeeexexxxeexeeeeexeeeexxeexexxeexxxexeexexxxxeexeeexxxexexxxxxxxeexeexxexeeexxxexexxeeexeexeeeeeexeeeexxeexxeexxexxxxxxxxeexexxxexxexxxxxexxexexxxxeeexexexxxxxxexexxxxxxexeexeeexexeexeeexxxxexexeeeexexexeeexeexeexxexxexxeeexxxxxxexxxexexeeeeexxeeexxxexexxxeexeexexexexexxxexeeeexexeexexxexxxexxxexeexxxxxeexexeeeexeeeeeexeexxeeeexxeeexexxxexxeexeexexxxeexxxxeexxxxexxeexxexexexeeexeexexeexeexexexxexxxexeeexeeexeexxeexxeexexexeeeeexeexxexxxeeeexxxexxexxxeeexeeeexxxxeexxeeeexeexxeeeeeexexxxeeeeexxxxxxxexxxeeexxexxeexxxxxexxxexxxeexeexxxeexexxxeeexeeeeexexeexeexxeeeexxxexeeeexxxxexxexexeexexeexexxexxeeexxxxxexxexxeeeexxeeexexxeexxxeeexeeexeexexxxeexxxexxeexxexxxeexxexeexeeexexxxexexxxxeexexxxexeexxxxxeexxeexexexexxexxeexxxexeexxxxxxeexexexxeeeeexxxxxeexxeexxxxexeexxxxeeeeexexxxexxxexexxexxeeexeeeexxxexexexxeeeexxxxeeexxxeeeexxexxexxeeexeexeexeexxxxexxeexxxeeexexxeeexxxxexeexxexeexexexxeexxeexxxxeexexxexeeexeeexxeexxeexexeeexexexxeeeeexxxxxexxxxxeeeexexeeeeexeexxxexeexxexxxxeeeexexxexxxexxxexxxxxxexxxeeexxexxxxexxexexxxxxxexexxeeeexxxeexxxxxexxexexeeeexeeexeexxeexexeeeeexxexxexexeeeeexexexeeexxexeexeeexexexxexexxeexxeeeeeexxeexeeexxexexeeexxexeeeexeexexeeeexxeeexxxexexxexeexxxxexxexexexeexxxxxexexeexexeexxxexxxeeeeeexxxexxexeexeeexxxeeexexexxxeeexxxeeeeexxeeexxxxxxxeeeeeexeeexxxxeeeeexeexxxxxxexexxexeexexexexeeexxxxeeexexxexxxeeexexexxeeexeeexxexxeexeexxexeexxxxxeexeeexxeexexxeeeeexxxxxxxeeeexxxexxeexexxxxxexeexxexeexeexexexxexxeexxexxxxeeeeexxexexxxeexxxxxxxeeexxxxxxexeeexexeexeeeeexxxeexexeexxxxxeeeeexeexeexeexeeexexexeeexeeeexxxxeeexxxexexxxxxeeeexxxexexexxeexxxexexexeexexeexexexexexxxxeexxeeexeexxeeexexxexxexeexeexxxexexxexeeexexxeexxexxexxexeexxeexexeexxxeexxexxexexeeexeexeexxeexexeexeeeeexexxxxxxxexxeeexxxxxeeexxeeeeexxxeeeeeexeexxxeeeexxeeexxxexexeeexeexeeexeeexexexxxeexxxxeexxexxexexxxxxeeeeexeexxxxxxeeexeexeeexexexxexxexxeexexxeexexxxexeeeeexxxexxexeeeexeexxxxexexeeeeexxxxxexxxexexxxxxeeexxeeexeexeeexexxexexxexeeeeeeeexexeeexeexexxxexexxxxexxxexeeexexxexexxxexexeexxeexxexeeeexeeexxxexxeexxexxxxxxexxxxeeeeeeeeeeexxxeexeeeexxxexxxeexexexxxxeexxeexxeeexxxxexeeeeeeeeeeexexeexxexxxexxxxeeexeexxexxexxexxeexxeexxxeexexxxxxexxxexxxeeexeexeexxxexxxxexxxexxxxxexeexexexexxxxeexxxeexeexeexxxxeexxeexxxxxxxexeeexxxeexexxexxxeexxxxeexxeexexxxeexexxxeeeeeexxeeexxxxxxxexeeeexexexexxxeexxxexxeexxeexxxxxexeexxxeexeexxxxeeeeexxexxxeeeeexeexxxexeeeeexxxxxxxxexxexxexxeeeeeexexexxxeeeexeexexxxexexxeexxexexexexxxeexeexeeexxexeeexxxxxxxxxxxxxxexxxxxeexeexxxexxexexxxeexeeeexxexeeexexxeexxxxxxeexexexxexexexxxxexxxxeexexxxexexxexxeeeeexxexxeeeeexxxeexxexxeeeexxxxxexexxxexxxeexxexxxeexexexxxxeeexeeeexxeeeexxxeexeexxxxexxexxexexeeexeexxeexexxxxxxeeeeeeeexxxexxexeeexexexeexexxxxexexxexxxexxxexxxexxeeexeeeexeexxxexxxxxxeexxxexexeexexexxxxxxexxxeeexeeexeeeexexxeexexexeexeexeexxexeeexeeeexeexexxeeexxexeexxxexexxeexeexxxeexeexxexxexxeexxeexexxexeexexxeeeeexeexexxxxexxexxexeeeexxxeeeeeeeeeeeexxeexeeexeexeexexexeexxxeexxxxexexexxexexeexxxeeexxxexxxxxxxxexexxeeexeexeexxxexeexxxeexxexeexxexxeexxeeeeexxeeeeexxeeeeexxxeexexeeeeeexxexxxeexeeeexeeeeeexxexeexxexeexxeexxxeeeeexexexxexxxexxeeeexxxeexxeeeeexeexexxexeeeeeexxexexxxeeeexxxxxexxeeeeexexxxexeexxxxxexexxxexeexxeeexxxxexxexexxxeexxexxxxexxxeexeexxeexxxeeexxxxexeexxxxxexxxeeeexxeexeexxexxxxeexeexxexxexxxxexxxeeeexxxeexxexxxexxxexxeexexeexxeeeeeeeexeexxxeeexxxexeexeexexxexxxeeeexxeexxxxexeexxeexxexexxexexxxeeeexxeeeeeexeeexexxexxexeeeexeeeeexxexxxxexeeexeexeeeexxxxeexxxxexxxxxeexexxxeeexeexeexxxeeexxeeexxexexxeexexxeexeexxeeeeeeeeeexxexxxxxxexxxexeeeeexxeexexexxexeexxexxxxexxxxexxxexxxxeexxxeeeeexxexxxxxeeexexexexxeeeexxxxxeeeexexxxxeexxxxexeeexexexxxexeexxeeeeexexeeexeeexxeeeeexeeexeeexexeeexxxxxxxxxeexexeexxeexxexxexxexxxxeeeeeeexxexxxexxxexexxexeeeeexxxeexeexxxxxxexxxxexexxxxxexexxeexxeexexxxeeeexexxexexexxxxeexexxxeexxxxeeexxeexxexxexxxxeexexeexeeexxeexeeeeeeeeexexxxxxxxeeeeeexxexeeeexexexxexxeeeeeexeeexeexeexxxexxxxxxeexeexxxxxexexeeexexexxexxeexexxexeexeeexeeeexxexexxxxexeexxxeeeeeeeeeeexxexxxeeexeexxexxeexxexeexexeeexxxxxxxexexxxexxxexexeexxxxeeeeexxeexexeeexeexxexexexeexeexxxexexeexxexxxexexxeexxxexxxxxxxxexxeexxeeeeexexeexxeexexxxexxxeeeeexeexeexxeexeeeeexexxxeexxxeeeexeexxexxxxxeexeexxexexexeeexexxeexeeexeeeexxxexexxexxxxxeexxxexexxxeeeeexexxexexexxexexeeeeexexxxxxxeeexeeeeexxxexeexexeeeexeexxxxxxxexxeeexexeeexxeeeeexxxexeexeexxxeexexxeexeexeeeeexeexxxeeeeeeeeeeeeeeexexexxxexeexxxeexeexexxeexexxexexxeexxeexexexxxeexxxxeeexexxxxexxeeexxxeeeexxexxxxeexxexeeexxeexxxxxxxxeexxeeexexexeexeeeexxexxxeexeeexxxeexxxexxexeeeeexexeeeexeeexexxexxexxxxeexeexeeexexxeeeexeeexexxxeexxexexeexexeexxxeexexeeeexxeexeexxxeexxexexxxexxxeexeeexeexxeeeeeeexeexxexeeexeexxeexexxeexeeeexexxexeeeexxxxxeeeeeexexeeexxexxexexxeeexxxexexxxxxxxxexxxexxxxxxexxxeeeexeexeexxxeexxeexeeexxeeeexxxexxxxeexxexexeexxxeexxxxeexeeeexxeexxxexxxxeeexxeexeeeexxexexxexxxxxeeexeeeexexexxxeexxexexeexxexeexeeeeeexexxxxeeeeexxxexeeexxxxexexxxxxxexexxexeexexxeexxxxeeeeexexxeeexxeeeexxexeexxxexxeexeeeexxexxexxxxexxxeeexxxxxxeexxeexxexxexxexeeeexeexxeeexexxxxxeeexexeeeexexeexxexexxxexexxexeeeeeeexxeexxexexxeexxeexeexexexxeeexeeeeexexexexxxexxeexeeexexxxeeeexeexexxxxxeexexxexxeeeexxxexxxxxeexeeexeeexxeeexxxxexexxeexxxxxxxexexexxxxeexeeeeexxxexxxxexeeeeexxeexxexxxeeeexeexexxexxxxexxeeeeeexxxexeeexexeeexeeeeexeexxxxeexexxxeexeeexexxexexxxxxxxeeexxxexxxexxexeeeexxxexxxxeeexeeeexxeeeeeeeeexeexeexexeexxexeexexexxxxexexexxexexxexeexeeeeexexxxxxeeexxxxxxxxexexxexxxxeeeexexexeexxxxxxexxeexeeexxxeexxxeexxxxeexexxexxxexeeexxxxeexexeexeexxeeeexxexxxeexxexexexxxxeeeeexeeexxxxxxeeeexeexxxexeexxxexxxxexxxxxxxeeexxexexxexexexxeexexxexexexexxeexxexxxexexeeeexeeexxxeeeexxexxxxexxxxxxexeexexeexxeexexxexeexexeexeeeexeexxeexeeeeeeeexxexxeeeeeeeeeeeexxeexxxxxxeexxexxxxeexxxexxeexxxxxxxxexeexeeeexxexexxeeeexexexxxeexexxxexxeexxeeeeeeexeeexxxeexeeeeexxxxexexxxxexxxexxeeexeexexeexeexxexexxexxexexeeexeexxexeeexexxexxxxeeexxxexeeexexeeeeeexeexxexeexxeeexxxxeexexxexexxxeexexeexexxeeeexeeeeeexexeeexxxexexxxexexexeexxxeexxeexxxxxxeeeexexeeeeeexexexxeexeexeeeeexexeexeexxexxxeeexeexeexxxexxeeeexexexxxxxexxxeeeexeeeeexxxxxexxxxexxxxeeeeexeeeeeeexexxxeeexxxxxxexeexxxexxxeeexexexxxexeexexeeexexxexeexxxexeeeeeexeexxxexeeeeexxeexxeexeexexxxxexexexexexxxexxexxxxxxeeeeexeeeeeeeexxxeexexeexxeexeeeexxexxexxxexxexxexxxeeexeexxxexeeexxxexexeeeeexexxexxexxxexxxeeeexxxeexexxeexeeexexeeeeeexxexeexxxxeexxeexxexeexxeexxxxexxxeeexeexexxxxeexeexexexeeeexexxxxxxxxexxeexeeexxeexxeexxeeeeexxexxeeexxexeexxxeexxxeeeexexexeexeeeexexexxexeeexxxeeexexeexexexxxxxxexxexeeeexxxexxxxxeexxeeeeeeeeexeexxxeeexeexxxxexxexeeexexexexeeexexeexxxeexxeexxxxxexxeeexexxeeeexeeeexeeexexexxeexeeexxxxexxexxeexexxeeeeeeeexexxxeexexeexxxeexexeexeexxeexxxxxeexeexeeeexeexxeexeeeexeexxxxxxexeexeeexexxeexexxxxxeeexxexexexxxexeeeexeeexxeexexxexexeexexxeexxeexxeeexxexeeexxxexxexeeeeexxxexxxeexxexxxeexeeeeexxxxexeeexxxxxxxexeeeexeeexxxxexxxexexeeeexexeeexexxxxxexexxxxxexexxxeexexxexxexeeeexxxeeexeexxxxeexeexeexxeeexxeexeeexxeeeexxeexxeexxxxeeexxxxexexexeeexxxxeeeeexexeeeexexxxxxexexexexeeeexxeeexeeexxxeeeeeexxeexxeexexxxxxxxxeeeeexxxxxexxexxxeeexeeeeeexxxxxxeexexxexxxxeexeexxxeeeexeeexxeeexexexxeexexeeexexexxxeeeeeeeeexxxxxeexeexxxexeeexexexxeeeexxeeeexxexxexxxexeeeexeeeeexeeexxexeexeeexeexeeeeexxxxeeeexxxexxeeeeexxexexxexeexxeexexeeexxeeeexxexexexxeexxxxeeeeexxexexexxxxeexxeexxxexeexxxeexxeexxexxeexeexeexxxeexexeeexexxexxxexxxeexxxexeeexexexxxeeexexxeexeexeexxexxexexeexxeeexxeeeeexxeexexeexxxxeexeexeexeeeeexxxeeexxxexxexeexxeexxxexxexxxexexexxeeexexeexexxeexexexxxexxxxexexxxxexeeexexexxxxexeeeexeeexxxexexxexxeexexxxexeexeeeexeexeeexxxeexeexeexxexxeeeexxxeeeexxeeexxeexeeexexexxeeexeeexxxeexxxexexxexxxxxxxeexexxxeexexxxexeexxeeeeexxeexeexexeexxxexexxexxxexxexxexexxexxxxxxeeeexxxxeeeexxxxexeexxxexxxeeexeeeexxxxxexxxexxeexxxeeexxeexeeeeeeeexexexexxxxxxxxeexxeexxxeexxexexeeeexxxxeexxexxxexxexxeeeexxxeexeexxxexxexeeexexeeeexeexeeeeexxeexxeeeexeexexxxxeeeeeeexxxxeeeexeexxeeeexeexxeexxxeeexexxeeeeexxxexxeexxeexexexexxxxxxexexxexexxexexxexeeexeexxxeexexexxxexxxeeexxexxxeeexeexxxeexeeeeeeeexeeeexexxeeexxxxxeeexxxexxxexeeexxxxxxeexeexexxexexexexexxeexeeeeexexeexexxeexxexeeeeexeexexexeeeeexeeexeexeeexxexeexexeexxeeeexxeeexeexeeeeexxxxeexexeeeeexeexxeeeeexxeexxeeeexxxexxxexxxeexexxeeeexxeexxxxxxxxexxexexxxeeexxeeexxexxxexeexxeexexxexxxeexxeexexeeeexxeeeexeeeeeexexxeeeexeexexxexxxxxeeexeeeexxexexxeexxexexxxxeeeeeeexxexxxexexxxxexexxexxxxxexeexxxeexxxxxxxeeexxxxexexxxeexeeeeeeeexxexxxxeexxxeeexxxxxexeexxeeexxxexexxxeexeexexexexexexexeeeeeexeeeexxexxeeexxxxexexexeeeeexxeexxeeeeexxxeexexeeeeeeexxxxxeeeeexeexexxexexexxexxxxeexxeexxexxxexeexxeexxeeeeeexxxexexxxxxxxeeexeexeexxexexxeeeeexexeeexexexeexxxeeexxxexexxxxeexxeeeexxexeeexeeeexexxxeeeeeexxxxexxxeexexxeexeexxxeexxxxxeexexxxexxxexxeeexeeexxeexexexeeexxeeeexeeexxeexxxxeexxxeeeeeexxxxexeexxxxexxxxxxxexexxeexxxxxxeexeexeeeeexxxexexxxexxxexexexexexexxxxeeexxexeeexxeeeeeexxeeeexeeexexxeexxxxexeexeexxexeexexeeeexxeexeeeexxxexxeexexexeexxxxeexxxexeexexexexxxxxxeexeexxxxxxeexxxxeeexexexxxxexeeeexeexeeexeeexexxexxexexeeeeeexxxxeeexxexxexxexexxxxeexexxxexeexxxxeexexexxeeexexxeeexxxexeeexexxxexexexxeexeexxxxeexxxxxxxeeexxeexeeeeeexexxeexeexexxxxxxexxxexxexxxxeeeexexexexxxeexxxxxeexxeeexxeeeeeexxexxxeeexxxxxxxxexexeexexexexxexxexeeexxxxeeeexexeexxeeexexxexxxexexxeeexeeexeexxexxexeeeeexxxexexxxeeeeeeexexxxeeeeexexxeexexxexeeexxeexxexexeexexxxeeeexxeexeeeexexexeexeeeexeeeeexeeexexeeexxexexxxxxexxeeexeexexxxxxxxexexxeexexxxeexxeeeexexxexxxexeexeeexexxeeexxxxexeeexxxeeeeexxxeeexxxxexxxexeeeeexxxxeeeexxxxexeexexexexxexxexexexeeexexxxexeexexxxxxxxeexexexxxeexxxexxexxeexeexxexeeexxxeeexeeeexeexexxexexexxeeexxxxeexxxexxeexxxxxxeexeexexeeeeexeeeexxexeeexxxxxxxeexexexexxxexexexeeeeeeeeexxxxexxeexxxxeeeeeeeeexeeexxxexxxxexexeeexeexeexexexeexexxxexexeeeexxxxxeexxexeexexxeeeexexeexeexxxeexxxxxexexeexxxeexexexexeeeeeeexxexexeexxeeexexxeexeeexeexxexexexxxxeeexexxeeeeexxxeeeeeeexeeexxxxxxxeeeeeexeeeeeeexeexexxxxeexxxeeeeeeexexexexxxeexeeexxxxxeexxxeeeeexxxeexxeexeeexxeeeexexeexxeexxexeexeeeexeeeeexexeeexeexxxxeexxeexeeeexeexeeeeexeexxexeeeeexxeeexeeexexxxxxexxxxxxxxexxxxxxxxexxeeexeexeeeexeeeexxxxxeeexeeeeeeexeeexxxeeexxxxxeeexxeeeexexeexxxxeexeeexxxxeexexeeexeeexxexexxxexexxexeeeeexeeexexxeeexxxexexexeexexeexxexexeeeexxexexeexexxxxxxeexxeexexexxeexxexxeexeeexxexexxxxexeeeexexexxxeexxeeexxxxexeeeeeeeexeeexeexxxexexxexexeeexexexexeexxeeeeexxeexxxexeexxxeeeeeeexxxeeexeeeeeexeexxxxexxexxxxxxexexxxxeeexxxexxxexxeeexxeexxxxexxexexxxxxeeeeeexeexeexexxeexxeexxxxeexxeexexexexeexexeeeexexxeeexxexexxexexeexexexeexxexexxexxxeexeexxeexexeexxxeexeexxexeexeexxexxexeeexexexxxexeeeexexxxxexxexxexxxxxexeeeexexeeexexxexexxexxxexexxeexxeeexexeeexexxeeeeexexeeeeexxxeexxxxxxxexexxxxxeeeeexxeexxeeexxxeexexexxxexxeexexexexxxxxxeexxxexxexxeexxxeexxxxeexxxexexxxxexxeeeexxxxxxeeeeexexeexeeexexeeexxeeexexxxeexxxeeexxxxeeeexxxxxxeeexeeeexeexxxxexeexeexxxxxxeexxxxexeeexexxeeeeexxxxxeeeeexxeexxeexeexxeeexxeexeeexxxxeeexxeeexexxeexxxexxeeeeexeexexxexexeexexxxxxxexeexxeexexexexxxeexxxeeeeeexxeexexeexeeeexxeeeexeexxxxeeexxxxexeexeexeexxxexexxxxeeexxeexeexxexexxeexexeexxxeexeexexxexxexeeeeeeeexeexexxexexxxxxexeeeexexexeeeeexeexexxeexeeexxxxeexexexxeeexexxxxxexexexexxexeexeexxexxxexxexxxexexxexexexxeeeexxeexeexxxxexeexxxxxexeeexeeexexxxeeeeexeeeeexxeexexeeexeexexeexxxeexeeexxxeeexexxexeexxexexexxeeexeexexexxxexexxxexxeeeexxxxxxxeeexexeexeexexeexeeeexexexxeexeexxexeexxxeeeexeexxxxeeexxxxxxxexxexeexexexexxxxxxxxeexxxexxexxxxeexeexxexxxxeexxeeexxxeexeexxexxexxxxeexxeeexeexxexxxxexxxxxxexxexxxxeexxxeeexxeeexxxxxxxeexeexeexexxeexeeeeexxexeexxxeexxxxxxexxexxexeexxxeeeexxxeexexxxxeeeexeeeeexeexxxxxeeeexxxeeeeexeeexeexxxxxxexxexeeeeeexexxxeexeeexeexeeexexexeexxxxexxxeeeexexxxexexeeeeexexeeeexeexxxexxeeeexexxeexeexxeeexeexeeexxexxxexxexxeeeeeeeexxxexxxexxeeeexeexxxxexexxeexxexexxeexxxeeeeexxeexxxxeeexxeeexxeeeexxxxexexeexexxexeexexeexexeexxexxxeexeexxexeexexexexeeexxeexeexeexxeeeeeeexxexxxxxxxexexexeexxeexxexeeexxxxxxexeexexxeexxxxxxxeeexxexeexeexexeexeeexxxxexxxxxxeeeexxxexeexeexxeexexxeeeeexexxxxexexxexeexexeeeeexexeeexxeexeexexxexxeexexeexeeexeeexxeexxxxexxexexexxxexeeexxexxeeeeeeeexeexeexeeeexeeexeeexexxxxxxexxeeexeexxxexexexeeexexxeeeexeexexeexeexexxxeeexxeexexexxeeexxxxeeeeeeexeeexxxeexexxeeeexxxxexxeeexxxexeeeexxxxxxexexxxxxexxeexeexxxxeeeeexxxexxxxeexeeeexxeeexxexeexxxxxeeexxxeeeeexexxeexeeexexxexxeexexexxeexxxxeeexxxeeeexexexxxexeexxxexexxeexxeeexeexexeeexexxeeexeeexeexxxexexeexeeeeeexexexxxxeexexxxexeexxxexxxxexxxexeexexxxeexxeexeexeexexexexxeeexeeeeexexxxxxexexexeeeexxexxeexexexeexeexeexxexexeexexexexexxeeexexxeexeexeexexexeexxeexeexeeeeexeeeexeexeeeeeeeeeeeeeexexxxexeexxeeexeeeexxxxxxxxexexxeexxeeeexeexeexexxeexeexxxexexxexexxxexxexxxxxxeeeexexxeexxeexxxexxxxxexxeexxexexeexexeeeeexexeexeeexxxeeeexxxeexexxeeeexeeeeexexxxxxexxexxxxxexxeexeeeexxeeeexeeeeexxxxexxexeeeexxxxxexxeeexxxexexxexxeexexeexxxeexxxeexxeexeeexeexxeeexeeexxexxxeeeexxexxeeeexxeexeexexxxeexeeeexxexeexxexexeeeeexxeexexexeeeexxeexexxexxexxexxxexxxxexxxxxxxxexeexeexxxxxxxeexexexxeexexxxexxexeexeexeeeexxxeexxxxeeeeexexxeexxxexeeeeeeeeeeeeeeexeexeexxexxxxeeeeeeeeeexexxeeeeeexexeexeexeexxexeeexexxxxexexexxxxxxxeexxxeeeexxxxxexexeexexxexxeeexxxeexeexxxxexeexeeeexxeeeexxxxxxeexeexexeexeeexxxeexxxxxxxxexxeexxxeexeexeexexexexxexxxeeexexeexxxeeexxeeeexexexexxexxeeexexxxxeeeexeeexeexxexexxexxxexeeexexexxeeexeexeexexxxeexxxxexeeeeeeexexxeeexeexeeeexeeeeexxeexeeeexxxexxxxxeeexxxxeeexxeeexxxxxxeexexxxeeexxxxexexxeeexxexexxxxeeexxxeeexxxexxeexxxxxxeeeexeexxxxeexxxeeeexeeeexxeexeeexexeexeeeeeexexxxxexexexxxeexeeexxxxexeeexxxxxeexxxxexxexxxexeeexexxeexxeeeexeeexxxexxexxeeeeeexxxxxxeeeeexeexxexxexxxeexxxxexeexexxexeeeexxxxxxxxeeexxxxexexexxxxexxxeexeexexeeeexexxxxexxxxxeeexxeeexxxeexxxxexxexxexxxexeeexexxeeeeeexxxexeexeexxxxxxeexxeeexeeexxeeeeexexeeexexxeeeeeeexexexeexxexxxxxexxxxxxxxexexxxexxexeeexxeexexxexxxexexxxxxxeexxexeeeeeexeeexxxeeeeeeexxxxexxxxexexeexexeexxeeeeeexxeexeexxexeexxxexxexxexexeeeexxexxeexeeeexexexexeexxxxxeeexxexexxeexexexxxeexxxxxxxexxexeeeexxexexxexxexexexxxxxxexexexxexeeeexxexexeeexxexexeexxexxeeexexxxxxexxexxeeexeexexxexxexxxxexxexxeexxxexxeexeexeeeexxxeexeeeeeexxexeeexexeeeeexeexxxexeexxeexxxexeeexexeeexxxeexxexexexeeexeeexeeeeeeeeeexexexexxxxxexexxeexxexxxeeexexxxexeeeexeexeexxeeexexexeexeexeexexeexxxxeexeeexexxexeexexexxxxeeexexxexexeexeeeeexeeeeexxxxexeeexexxexeexeexeeexeeeexxxxxeexxxexxexeexxxxxeeeeexexexxeexxeeeeeexxeexxxexxexexxxeeeeeexeexexexeexexeeexeexxexeexxxexexexeeexeeexxeexxxeeeeeeexxeeeeeeeexxxexexeexxxexeeeexxexxexexexxeexeexxexexeeexxexeeexxxxxxeeexeeeexxeexxxxxexxxexxeexxxxxeeexeeeexxxxeexexexxxeeexxxxexxxeexeexexxxeexxxxxxxxxeeexexexxxxeexxexxxxxeexeeexxexxxxeexexxxeexxeexxeeexxeeexexxexexeexxeeeexxxeexxexeeexeeeeeexxeeexexxxxexeeeexxeeexexeeeexexexxxexxxxeeeeexxxexxxxxeexxeexxeexexeeeexxexeexxxxexexxexxeexexexeeeeexexeexeeeexxexxxexxexxexeeeexeeexxeeeeeeeexxxexeeexeeexxxeeexexxeexexxeexeexexxexxxeexeexexexeeeexeeexexxxxxxxxxexxeexeeeexeexxexxexxexeexexxexeeeexexeeexexxexexxexeeexxexexxexxexeexexeeeeexexexeexeexexxxxexxxxexxxxxxexxxeexxxeexexeexeexxexxxxeexxeexeeeexxeeexxxxeeeeeexxxxexexeexexxeexxxxxxxxexxeexexxxxexxeexxxexeeexexxeexexxxeexeexeexexeeexexxeeeexexxxxxeeexxeexxeeexxeeeeexeeeeeexxxxxeeexxxxxeexxxxexexeexeexxxxeeeeexexeeeexexxxxxxeexexxxeeeexexeexeexeexeeeeeexxexxexxxxxxxxxxexxeeeexxxeexexexexeeexeeeeexxxxxxxeexexxeexxxxexexexxexxexeexexeeexeeeexeexexexexxxeexxeexeexeeexxxxxeexexxxxexxexeexxxxeeexxxeexeeeexxexxxeeeeeexeeeeexxeexxexeeeexeeexxeeeeexxeeeeeexxxexeeexxexxeexxeeexexxexxxxeeexxexexxeexexexeexxxxeeeeexeeexexexexxexeeeeexxexeexxxeexexexeexxeexexxeeeexeexxxeexxexeeexxxxxeeexxxexeeexexexexxeexeexeeeeexexxxexxexexexxeeexxxxxeexeexexxxeexxxxxexeexxexexeeexxxeeeexeexeexeexexxxxxexeexeexxeeexexeexeeeexexxexxeexxxeeexxeexexexexeeeexexxxxxxexxeeeeeeeexeeexxxxxxeeeexxxeexexeeeexeeeeeexexeeeexxexxxeeeeeexxexeeexxxexexxxxeeeexxxexxeeexeeexxxeexexexeexexxxexxxeexexexeexexxexxexxxeeeexxxeexeeeexexxxeexeeexxxeexeexxexeexexxxxxxeexexxxxeeeeexxexxeexexexxeexxxeeexxxexexxxxexxeexxxeeexxeexexexeexxxxxeeexxxxxxxxexxeeexxxxexxexexeeeeexxxxeexexeeexxexxeeeexxxeeeexxxxexxexeeexexexxexeeexxeexxxxexxexexexxxxexxxexxexxexxxxexeeexxxexexexeeeeeeexxxxxeexxeeexexxxexxxexxeexxexeeeexexxxxexexxexxeeexxexexexeeexxxeexxxxxxexxeexxxexxexeeexxexxxeexxeeeeexexeeexxxeeexexexexeeexxxxexxexxeexxxxxxeexxexxxxxxexeexxexxexxeeeexxexeexexxxeexeexxeeexexxexexeexeexexeeexxeeexxexeexexexeeeexexxeeexexxeexeexexeeexexeexeexxxxexeeeexxeeexxeeexxeeexxxxxxeexxexexxeexeexexxxxxxexxxxeeeeexeexxeexxexxxeeeeeeeeeexeexxxxxxxexeeeeeeexxxexexxxeeeexxxxeeeexeeeeeeexxxexeeexeeeexxxxexxeexxxeexxxeexeeeeexxexxxexxxexxeeexxxxxxxxexeexxxeexxxxxxeeeexxxeexxxxexeexeeeeeexxxexxxxeexxxeeexexxxxxeexxeeexxxxxexxeexeexxxxeeexexexexxxeeexxeeeexxeeeeeeeexxxxexeeexeeexxeexxexeeexxxeeeexxeeexxxxxxxxeeeeexxeexxxexexeexexxxxeeexeexxxxxxexexxxeexxeeeeeexxxxxexexxxxxeeexeexxeeexxexxeeeexxexeeexexeeeexexeeexxxxxexexeexxxxxeexxexexeeexexxexxxxeexxeexexexxxeexeexeeeeeexxxexexxxeexeexexxxeexeexexeeexxeexeeexeexexexxeeeexxxeeeexxxexxxeexexeexxxxxexxxxxeexxxxxxexexxxxxxxexxxexxexxxeeeexxeeexxxxxxeexeeexxxexexxxxeeexxexexexeeeeeeeeexeeeeeeexxxeeeexxeexeeeeexxxxeexexeeeeexeexeeeexexxxexexexexeeexxxeexxxexeeeexexexeexxxeexexexxexxeeeexeexxxxexxxexeeeeeeeeexexexeexxexxexexxxxeeexxexxexeeexxxxxxxeeeexxexeeeexxxeeeexxexeexexexxexexxxxxeeexeexeexxexexexeeexxexxeexexeeexxxxxxxxeeexeeeexeeexxexxexxeexexxxxxxxxeeexxexxxxexeeeexxxexxxeexxxxxxeexeeeexeeeeeeeeexxxeeexxxxexxexxexxxxexeeexxxxexeeeexxxexeeexexxexxeeexexxexxxexeexexxexexxxexxexxexexeexxxxexxexxexxeeeeexexxeeeeexeexexxexxeexexexxexxexexeexexxxxexexxeexeexexxxexxxxxeeexeeeeexxxexexeeeexexxxxeexexxeeexeexexxxxexxexexxxexexxxeeexeeeexeeeexeeeexexxeexeexxeexxxeexexxxxexexeeeexeeexeeeexxxexxeexxxxxxeeexxxexexeeeexeeeexexxeeeeeeeeexxexxexxxeeexxxxexeeexxexxxexexxexxeexxxxxeeeexeeexxxeeexeeeexeeeexxxxexxexeeeexxxeexexxxxeeexeeeeexexexexeexeexeeeeeeexexexxxexexeexxxeexxxeexxxexeeeeexeeexxexexxexxxxxeeexeexeexexeexeexxeeexexeeeeeeeeexexexeeeeexeexxeeeeeexxexeexeexexeexxeeexxeeeexxexxxeeexexxxxexeeexxeexxxexeeeeeeexexexxexxexxeeeeeexxeexeexeexxexexexexeeeexexxxeeeexxxeeeeeeexexexexxxxxeeeexexxexeexexeexxxxxxeexxxeexxexxxexeeeeexeexxexxexxeeexxxexxeexxxeexxexexeexxxexxxexxxxxeeexexexxeeeexeeeeexexeeexxexxeexexxeexeexexeeeeexxexeexxeeeeeeeexxeexeeexexexexxxxxxxxxxexexexxxeexxeeexeexeeeexeeexxexxxeeexxeexeeeeeeexxxeeexexxxxxxexxeeexeeeexxxxeeeeeexexxxxxxxeeeeeexexexeexxeeexxexxeeexeeeexxxxeeeeexexxxexeexexeeexexxxeeeexxexexxexexxxxxeeexxeexexexxexxxexxxeeeeexeeexeexxxeeeeeeexxxxxexxxeexexxeexeeeeeeeexeeexeexxeeeeexexexeexxexexxeeexeeeeeexxexxxxexeexexeeeeeeexxexexxeeeeeeeeexxxxexxexeeeexeexxexeeexxexexxxexxxexxxxxexxexxxexeexexxeeeeexxeexexxxexxexxeeexxxxxxxeexexeeexexeeeeeeexeexxxxxxeeexeeeexxexxxeeeexexxexxeexxeexxxxeeexeeexxxexxxexxxexeexeexexeeexeeexexexxeexeeeexexxxxexeexxexexxxexeeeeexxeeexexxxxxxxexxxxxxxxeexxxexeeeeeexexxeeeexxexeeeeexexeeexexxxxexexxxxeeeexxxxeeexeeexxxeeeexexxxeexeexxxexxxxexexxexxxexxexxexxxxexxxxxeexxxeeeexxxexxeexxxxexexexxxexeexexexeeexeeexeeeeeeexxeexexeeexxxxeeexxxxxeeeeeeexeeeexxxxxeexexeexxxxxeeexxxxeeeexxexeexeeeeeexeeeexexxxexeeexexexxxexxeexeexxexeeeeexeeexexxeexeeeexexxeexeexexeexexeexeexxxxxeexexxeexeeexeexxeexxxxexeeexxeexeeeexeeeexxeeeexeeexxeexxxxxxexxxxeexexxxxexexxexxeexxexeeexxexeexxexxxeeeexxexxexxxexxxxxeeeeeexxxeexexxeexxxxexexeeeeeexexxeeeexeexexxxxexexxxxexeeexexxeeexxxexexexexeeexxexexxeexxxxxxxxxexxeexeexexexexxeeexxeeexexxxxxxxeeexxxxxeeeexexxxexxxeeeeeeeexxexxeexxxeeexeexxxeexxexexeeexexxeexxxxexxexeeeexexxeeeeexxexexxxeeexxeeexxxeexexxxexxxxxexxexxeeexexxxeeexeexxxeexxeexeeeexxxxxeexxexexxxeexxxxxexeexxxxeeexxxexxexexxeeeeexexeexxxxxexeexxxxxxxeeexeeeexxexeeeexexxeexexxexxexexxeexeexxxexxxxxexxeeeexexexexxexeeeeexxxxxxxeexeexexeexxxeexexeexxxeexxxxeexxxxxxexxexeexeeeexxeexxxxxeeexxxxxeexxeexeeeeexxxexeexxxexeexxeexexxxexxexxxxxxxxxexexexxxxxeeeexeexxxxexxeeeeeexexxexeeeexexexxxxxexxeeexxexxexexxexexexxeexxxeexeeeeeeexxexeexxxexexexxeeeexxeeeexeexeexexxexxxeexxeeexxxxeeeeexexexxeexeexxxexxeeexxexxeexxeexeeexxeeeexexxexexeexxxeexeexexeexxxxexxxxxxeexxeexexxexxxxxexxeexxeexeeexexxeeeeeexxxeeeeeexxexexeexeeexexxexeeeexxxxxexexxexeexxexxexxeeexeeeeexeeeexxexeeexexxexxxxxxeeeexeexxeexexxeeeeeeeexexxeexexeeexxxexeeexxeexeeeeeeeexexexeexexeexxxexeeexxeeexeeexxeexxxxexeeeexexxxxxeeexxexxexxxexeexeexeexxexexexexxeexeeeexxxexxeeexeexxeexexeeeeexxexeexeeeeeeeeexxexxxxeexxxxexxxxexxeexxxeeexeeeexxeeexexeexexxeeeexxxeexxeeexxeexxeeexxxexxeeeexxxxexxexxeexeexxexxeeexeexxxxexxeeexxeeexxxxxxxxxxxeeexxexeeeexexxeeeeexxexxeeeexxexexxxexxxxxeexxxeeeexexexexexeexexeeexxeexxeexxeexexexxxexxxeexexexeeeexexexxxxeeeeexeexxxxeeeeeexxxexexexxexxxxxxxxexexxexxxeexeexxeeeeeexeexexxxeexxeexeeexxexxexexexxeeexxexxeexexexxexeeeeeexexeeeexxxexxxeexexexeexeexeexeeeeeexeexeeexeexexxeexxxeeexexexxeeeeeeeexexxeexxexexexexexexeexexxxxexxxeexeexxeeeexeexexxexxeexeexexexxexexxxxeexxexxxxxxeexeeexxexexeexexexeexxexxeexxexeeeexexeeeexxeeexxeeexxeexeexxxexxexxexeexeexeexexxxxxexeeeeexxxxxxexexeexxeeeeeexxeeexxxexeeexeexxxxxxexxeeexxxexexeexexeeexexxexeeeexeeeexeeeeexeexxxexxexexxxxxxeexexxexxexeexeeexeexxxxxeexxxeeexexeexxexexeexxexexexeeeeeexxxeexxxxeexxeexexexeexxxexxeexxxxexeexeexxxxxxxxexexexexxxexexexxexxexeeexexexexexxexxxeexexeeeeexeeexeeeexeeeeeeexxeeeexeexxexxxxexeeeeeeexeexeexeeeexxxxexexxxeexexxxexxxxexexexexxxxxxxxexeeeeeeeeexxexxeeeexxxexxexexexxexeeexxxxxxeeeexxxxxeexxxexxexeeeexeeexeeeexxxxexxxxxxxxexxeeexxeeeeexeexexexexxexxxexeeexeexxxxeexxeeexxexexexxexxeeexexxxeexxexeeexexxxexexeexxxexeexxxeeeexxeeeexeexxxxxeeexxxexeeeexeexexxxxexeexeeeeeexxexxxxeeexeeexxexxxxeeeexxxxxxxxeeeeeexxxxeexexxxeeexxxexeexeeeexxexexxxeexeeexeexxxxxeeeeexxxxxeeeexexxxxxeexexxeeexexexexexxxxeeeeeexeeeexxxexexxexeexxxxeexeeexxxxexxeexxxxxxxxxexexxexexexeexxexxxexeexexeexexxeexxxxxeexexexxxxxxxxeeexeeexexxexexeexxexxxxexeexeeeeeexexxxexeeeexxeeexeeexxeeexxxexxexeexeeeexeeexxexxxxxeeeexeexeeexxexxxexxexxexxxxxeeexexeexeeexxxxexeexeeexxxeeeeeeeexexeeeexeeeexxxeeexexexeeeeeexeeeeeeexexxeexeexxexxexexexxexxxeeeeexxxeeeeexxxxxeexexxxeeeexeexeexeeeexexeeeeeeeeexexeeexxeeeexexxeeexxxxeeeeexeeeeeexxexxexxxexxexxxxxxexxeeeexxeexxeeexexexeeeeeexexeeexxxxexeexxeeeexxeeexxxexxxxxexexxexeexexxexxexexexxxxxxxxexexxexeeeexxxxeeeeexxexxxexxxexxeexxxeexxxexexxxeexxxxeeexxxxexxxeeexxxxxexxxxxxeexeeexeeexexeexeeeeeeexexeeexxxexeeexeexxxeexxexeexxxeeexexeeeexxexxxxxexexxxeexxxexxxeeeeeeexexexxxexexxxxeexxxexxexxxxeexexxxexxeeexxxxeexxxexxexexeexxexexeexexexxxeexeeexexxexxeeexexxxxexexexeexexeeeeeeexxeexeexxxeexeeeexexexexxxxeeeexeeeexxxxxxxxxxexxxeeexxexxeexeexexeeeeexxeeeeeexexexxxxxxexexxxexxxeexeexexexexxexeeexeeexxxeexxxexexeeeeexeeexxxexexeeeeexeexeeeeexxexxxxxexeexexexexeexexexexexexeeeeeexxexxeexeexeeeeexxxxexeeexxeeeexeexxxxxexxeexxxexexxxeeexeeeexxxxxexexeexxeeeexeexxxxeeeeeeexexxxexxxxeexxxxexeeeexeeexexxxxexxxexxexxxexxexeeeexxeeexxeexxexeexeeexeexeeexeeexeexexxexeeeexeeeeeeeeeexxexexxexxxexxeeexexeeeexexeexexeexeexxexexxxexexeeexeeeeexexxxxexexexeexxexeexxxeexeeexexexxxxexeeeexeeexexeexxxxexeeexxexxexeexeeexxxxeexeeexeexxxxexexexexxeeeeeexxxexexxexxxexexxexexeeexexeeeexeexexxexxxexxxexxxexexexexxxeeexxxxxexxeeeeeeexexeexexexeexxexxexexxeeeexxxexexxeexxxexxexxeeeexxxexexeeexxexxxexxxxexxxxxxexxxexxxxeexxxxexxxxxexxxxxexxxexeeeexxeexxxxxxexxeexxxeexexeexxxxeeexxexxxeexxeexexxxxexxexxxxexeeeeeexeexexxxexxeexxexexeeexexxeeeexexxxxxxeexxeexexxeexeeeexxeexxeexexxeeexxeexxxexeexexeeeexxexxxeeexxexeeexxxexxexxxxexexxxexeeexexxxxxexeeeexxeexxxexxexxxxxxxexxexxxexeexxeexeeexexeeeexeeexxxxxxexeexeexxexexxexxxexxexxexexxeeeeeexeeexxexexexexxexeexeexexxxeeexexxeexxxxxeexxxxeexxexeeexxexexeeeexxexeexeeeeexeexxxxxexxexeeeeexeeexexeexxxxeexeeeexexxexexxeexeexxexexeexexexexexxxxxexeeeeeeeeeexxeeeexeexeexxxxxeeexexeexxexxeexxxxxeexexexeexexexxxxeeeexexxxxxexxxxexexxxexexxxxeexexexexeeexxexeeeeeeeexxxxexexxexexexxeeexexxxeexeexxxxxeexeexxxxxexxexxxeeexxxxeeeeexxeeexxxexxexxexexxeexxeeexexexxeeeexxexxxeeexxeeeexeeexxxeeexexexxxxxxxexexxxxeeexxexeeexxexexxxeexxxxexeexeeexexeeexeexxeeexxxxxeeeexxexxeexexxxxexeeexxexeexxexxxxxxxeexeexeeeexxeeeexxexeeeexxxxeexxeexeeexexxxxxxeexeeeeeeeexxexxeexxxeexeeeexeexxxxeeexexexxeeexxexxxeeexeeeexeeexexexxeexxeeeexeeexexxxeexxeeexxexxxxexxexxxxexxexexeexxxxxxeeexeeeexxxxexeexexxeeeexxxxeeexxeexxxexxxexeexxexeexexxexxxxeeexxexxxexeeexxexxxxxxexxxexexxxxeexexxxexxexxxxexxeexxxexexexeeeeexexxxxxeexeeexxeexeeeexexxeeexexeeeexexxxxexexxexxeeeexxexxxxeeexxxxexexeeexeeeexxeexeexeeexxexxxeeexeexeexexexxxxxeeexeeeeexeexxxexeexxexeeeeexxxxexxeexexxxexeexxexxxxxeeeexxeeeexxexxeexeexxeexxexeeexxexxxxxexxeexxxeexexexxxxeexeeexxxxeeexxexxeexxexexexexexexxeexxxxexexexxexxexxeeexxexeeexxxxexxxexexxeexeexeexxxxxxxxxxeeeeexeexxeexxeexeeeeeeexxexxeexxxxxeeexeeeeeexexxexexxxeexxxxexxxeexxeexeeexxxeeexexeeeeeexxexeeeexxeexeeexxxeeeexeeexexexxeexeeexxxxxxxeexeexxxeexxxxxxeeexxexexexxxexxexeeexeexxxxxxeeeexexeeexexexxxexexeeexexxeexxexxexxxxexeexxxeexxxxxxexxeeeeeeeeeeeeeexxxxeeeeexeexxxexxxexeeexxxxeexxxeeexxxexxeexeexxxxeexxxexexeeexxeexeeeeeexexxxxxeexxeexxxeeeexexxxxxexeexxexxeexeeexeeexxeexxeeexxxxexxxxxeeeexexeexexexeexexexxxexxxexxexxxeexxexexxxexexxxeexexexxxeexeexeeeeeexxxxeexxxxeeeexexeeexeeexxexeeexexxxeeexexexxxxxeeexxxxeeexxxexxxxexxxeexxexxexexxxeexxxxxxeexxxxxxxxexexeexeexxxxeexxxexxxxxxeeexeexxxexxexxxxeeeeeexexxxexeeeeeeexeeeexexexxeeeexeeeeexeeeexxxexeeeeeexexexexexexeexeexexeexeexeexeeexxexxxeeexexxeeeexxxeeexexxexeeeeexexxxxxexexexeeeeeeeeeeexexexxxxexexexexeeeexxexeexxeexxxxxxxexeexeexxxexxexxexxxeexxeexxeeeexexxxexxxexeexexxeexexexeeexxexeeexeeeeexxxxexxxexexeeeexxeexxexeexxeeeeexxxxxxeeeeexexxexexxeexxxxxxxxxxxxxxxxeeeeeeexxxxxexeexxeeeeexxeeeexexxexxxxexeeexexeexexeexxxexexeexxxexeexeeexeexxxexeexexxexxxexeeeexexxexeexexxeexexxexxxxeeexexxeeeeexeexxxexxxeexexeexxeexxexexxexxexexexxeeeexxexxxxxxxxxxexeexxxexxxeeeexeeeeeexxxeexexeeexxeexeexxeexxeeexexexxeexxeeeeeexxxeeexeexexxxxxeeeexxeexexeexxxxxxexexexeexexexeeeexxxxxxeexxxexeeeexxxexexeeeexxeeeeeexxexeeexeexxexxexxxeeeexxxexeeexeeexxexexxeeeeexxxexxeexeeeexxeeeexexeexeeexeexxxxxexeeeeexxxxeexxeeexexeeeeexexxeexeexexxexeeeexxexexexexexxxxxxeexxxeexxxeeeeeeexxxeexexexxxxxexexxexxxxxeeexeexexxxeeexxxexxeeeexexexexeeeeexexxxexexxexxexxxeeexexeeeeexexxeeexxxexexexexexexxxeexexeeexxexxeeeeeeexexexxxexxxeexxexexxeexexxeexeexeeexexeeeeexexxeeexxxxeeeeexexxxexexxexeeeeexexxexeexxeeexxxexxxexxxxexxexxexxeeeeeeeexxexeexeexexxxexxexxeeexxxxxexeexexxxxxexxxxxeeexexexeeeeexeexeeeeexeeexexeeexxxxeexeexeeeeexxxxeexxeeeeeexxeexxexxxexxexexexxexxxexexxxexeexxexxxeeexexxeeeexeeexxeexexexxxxxxxeeeeexxxeeeeeeeexxxxexxeeexeexexexeexexeexexxxxxxxxeeeeexexeexeexeexxeexxeeexexxxxxexxexeexexxeexeexexexexexxxxxxexxeeexxeexexexxexexeeexxxxxxxxxxexexeeexexeeexeexxxeeexeeeexxxeexxxexxexxexxeeeexexxxeeexeexeeeeeexexeeexxxxxexxeexxexeeeexexxxxexxeeeeeeexeeexexexexxexexxeeexxxexeexexeeeexxexxexeeexxexexxeeexxexxexxeeeexxeexeexexeeeeeexxeexexexeexeexexeeeexxxexxxexeexxexeeexxexxxeexxxeeeeexeeexxxexxxeeeexexxeexeeexeeexxeeeexeeexxxexxxexxxeeeexxxeexeeexexexexeeeeeeexxxxexeeeeeeeeeexexxexxeexxexxxeexxxxxexxxxxxexxxexexxxxexexexeeeexxexeexxexxeeexeeeeeexeexexeeeeeeeexxexxexexeexeexexeeexxxxexxexeexxxexxeeexexxxxxxxxxeexexexxexexxxxeexeeeeexeexxeexxxxxexeeexxxxeeexeeexeeexexeeeeeeexeexeeeexeeexeexexexxxexeeeeeeexxxeexxxxxeexexxxxexexeexeexxxeeexeexeexeeeeeexeexxxxxxxexeeexexexxxexxxexxexeexeeexeexeeeeeeexeeeeeexxxeexxeeexeeexxeexeexxxxxeexexxexxeeexeexxeeexxxexeeexxxeeeeexxexexexeeeexxeeexeexxxxxxeexxxeexexxxeeeexeexxeexxxxeexeeexxexxeexeeeeexxexxeexxexxxxeeeeexexxeeexeexeexexxeexexxxeeexexxxxxexxxxexxxxexexxxxexeexxxexeeexxxexexeexxxeexexexxeeexxxeexxxxexeeexeexeexxxexxeexxeexexxeeexxxexexxxxxeexxeexxxexxeeeeexeexxxxxeeexxxxexxexxxxexeeexeexeexexxeexxexxxxeeeeeexeexeeeexxxexexxxeexexeeexxxxxeeexxexxxxxeexexxeeeexxxxxxeeeexxeeexxxeeeeexxexxxxxexexexxxxexexexexeexxexeeexxxeexexeexexeeexxeeeexeexexexxxxxexxeeeeexxeeeexeeeeeexexexexxxxxexxxxxexeeexxxxxxxeexxexeeeexexexxxxeeeeexexxxexeeeeeeexeeexxeexexxexxxexxexeeexexexxexxexeexexeexxexxeexxeeexxxxxeexxeexeeeeeexxeeeexxxexxxxxeexxxxxexxexxexxxxxxexexeexxexexeexxexxxxxxxeeeexxeexxxxeeeexxxxxxxxxxxxxeexxeexexexxexeexexeexxxxexxxexxeexxxxeexxxexexeexeeexxeexeexxxxeexxxxexeexexxeexxeeexeeeexexexxeeexxxexxxxeeexxeexeexxxexeeexxexexxeeeeeexxexxeeexeexeeexexxxexxxeexeexxeexexxxexxxxeexxexeexxeeexexxxexexexxxeeeeeexxexxxxexeeexexxexeeeexxxxeexxxxxxeexeeexeexeexeexexxxeeeeexxxexexexxexeeeexeeeeeeexxxexxxeeexeeeeexexxexeexexexxxexexexeeexeeeeexexxexeeeexexeeexxexxeexxxexeeeeexxxxxxxxxeeeexexexxxeeexeexeexxxexexeexxexxxxxxexxxexeexxeeexeeexxeeexeexeeeexeeeexxexexeexeeexexeeexxxexxxexxxxxexexxeeexexxeeeexexexxxxxeeexeexexxeexeexeexxxeeexxexexxeeexeeexxexexxxeexxexxxeeeeexexxeeexeexexxeexeeexeeexxxxxxxexxxxxeexeexeeexeeeexxeeexeeexeeeexeexexxxexxxxxeexxeeeexxexxeexexeexexeeexxexxexexxxexexexxeeexxeexexeexeeexexexxxxeeexexexxxexeeexeexxeexxxexexxxeexxxxexxxeexxexeeexxxxeexeexeeeexxxexexxxxxexexeeeexxxexxeexxxexeexxexxxxexxeeeeeeexeeexxxxexxxeexxxexxexeeeeexeeeeeexexeexexeeexxxeexxxeeexxxxxxexxxexxexexeeexxxxexexexexexeeeexxexexxeeexeeexxeexxxexexxeexexxeexeeeexeeexxexexxxexxxeexexxeexexxxexeeeexexeeexeeexxxxeeeexxxexxeeexxeeexeeeexeexxeexxeexxxxxexeeexexeexexxxxexeexeeexxxexxexxxexexeexxeexxeeeeexeeexexexxxxxxxexexxexexexexexxexxeexexxexeeeeexeeexeexxxxexexxexxexxxxxxexexxexxexexxeexeeexxxxxexeexexxeeeeeeeexxxxeeeexxeeexexxexeeexxxeexexxeexeeexexexxeexxeexeeexxxxeeexexexexxeexxxexxxexxxxxeeeeeeexexeeexexeeeeexxexxxxexexeeexeeeeeeeeexxxeexxexxxxeexexexxeeexeexxeeexxexexxeexeeeexxxxeeexexxexexxxxxxxxexexxxeeexxxxxxexeexeeeeeeexeexeeeexxeexeexexeexxxeeexxexxxeeexxxexxexxxeexxexeeeexeeexeexexxxxeexxxxexxexexeeexeeexexxeeeexxxxxxxxxxxeexxeexxxxxexxxxxxxexexeexexeeexxxexxexxxxxexexexexxxexexxexexeexexeeeexxxexexeexxexeeeeexxexeeeexeeeeexxxxxexexeeeeexxexeexeeexeeexxxexxxeexexxxexxxxexeeeeexxxeeeexxeeeexxxexeeeeeeexxexexxxeexeeexeexxxxxeexxeexexxxxeexxxexxxeexeexeexxxxexeeexxxxxexeexxeexexxxexeeeexxexxxexxxxexxxxexxxeexeexxxxxxeexxeexexxexexxexxxeeeexxxexxexxeexxxxxexxexexxxexxxxeeeeeeexexxexexeexxexxxxexeexeeeeeexexeeeeexxxxeeeeeeeexxeexexxexxexeexeeexeeeexeexxxxxexxeeexxeeexxeeexxxexexxeexxxexxxeeexxexexxxxexexxexeexeeexxeeeexexeeeexxeeeexxxeeeexexxeeexeeeexexxexexxeexeexeexxexexexxexxeeeeeeeexeeeeexxxexexxexxeeeeexeexexxexexxxxeeexeeeeexeeeeeexeeeeexxexeexeexeeeeexexeeeexxexxexxxxeexxxxxxxxxxeeeeexeexxxexxxxexeexeeexeeexxeexeeeeexxeeeexxxeexexeexxxxxexxxxxeexeeexxxexexxxeexxxxxeeeexxxeeeexxxxxexxxxxexxeexxxxxeeexxxeeexxexexeeexxexxexexxxxeexxexeexexxexexxxxexeexexeeexexxeeeeeeeeeeexxeexxeexxxxxexxeexexxexxexxxeeexexeexexxeexxexexeexeeexxxexxxeexeeexxxeexxxxxexxxxeexxxexeexexxxeeeexexxxeexxxxxxexexexxexexxexxxxxxexeexexxeexxeexxxxxxxxeeeeexxxxexexexeeeexxeeeexxxeexxxeexxeexeeeexeeeeexxxxeeexxxxeexxxexxxxexexexeeexxexxeexxxexeeeeexexeexexexexexxxxxxexxexxexxxexxeeeeeexexxexxeeeexexxxxeexxeeeexexeexeeeexxexexeeexexxexxxeeexxeexxxxeeexeexxexxeeeexexeeexeeexeexexexxxeexeeeeexxxexxxexexxxxeeeexeexxxxxeexeexxxeeexxexeexxeeexexxxexexeexxeeeeeeexxxexeeexexxexxxexeexeexxxxexxeeexeexxexxexexexexxexxeexxeeeeeexxexxxeeexeexxexeeexxexeeexxeexxexxexexxeeexeexeeeeexxexxxxexexxxxexexexexxeeexxxeeexeeeeeexeexexxxeeeeeeexeeeeexexxxxxxxxexxexxxxeexxxeexxeexexexexeeeeexexexexxeeexxxxxxeeeexxxeexxexeeexxxexxxxeexxexexxexxxxxxexeeeeexexxxexxeexxxexxxxxeexxeexexeeeexxexexxexxeexxxeexxxxexexxxxxexexexxeexxxeexeeexeexexeeexeexeexxexeexeeeexeexxxxxeeexxexxxxxxeeexxeexexexexxexexexxexexxxxxxexxxexxxeeeexexexxxeeexexexeeexeeexxexxxexeeexxexxeexxxeexexexxxxxeeexxexxxeexxexxexxxexxxexxexexxeeeeeeeexeeeeexeeexxexexeexxexeeeeexeeeexxxeexxexxexxxeexeexxxeexxxexexxeeexxeeexxxxeexexeexexxexexexexxxxeexxxxexxexxxxexexxxexexeeexxxexexeeeexxxxxxeexxexxexexeexeexxxxxxeexeexeexxeexexexexexxxeexeeexxeexxeeeexxexxexxxxxeexxxeexxeexeeexxxxxexxeexexeexeexexxxeeexexxxxexxxeexexxxeexxeexxxxxexexxeexxxexeexexeeeeeexxxxxxxxexexxexxeeexexexxxxeeexexxexexeexexxeexeexeexexeeexxexexxxxxxxxxeeeexeeeeexxeeeexeexeexxxxxeeeeexeexxeeexexxxexxexexxxeexexxexxexeeexxxexexxxexxexexxxeeexxxxexxexeeexxeeexxxexeeeeeexexxexxxxxxexxxxexexeexxexxeexxxxexexeeexxexexxxxxxeeeexxxeeeeexxeeexxeexxexeexexxeexxeeexexxxxxexxxxeexxexexxeexexeexxxeeeexexxxxxxxxeeexexxxxexxxexexexxexeexxexeexxexeexexxeexexexeexxxexxexxxeeeexxxxxeexxxxxexxxeexxexeeexexxexxxeeexeexxeeexxexeexxeeeeeexxxxeexxeexeeexexxxxxxxexeexeeexexxxxxeexxxeexeeeeeeeexxxxeexexexxeexxxexxxexexeeeexeeeeeexexeexxeexexeeeeexxeexeexeexexxxxxexexxxxxexxexexeexxxeeeeexxeexexeexxxeeexexeexexexxeeexeeexxeeeexxxxexeexexxeexxxexexeeexexxxexexexxexxeexxeexxexexxxxeeeexxxxxxxexexxxxxexxeexexxexeeeexexexxxexxeexxxxeeexeexxxeexexexexeeeexxxexeexxexxxeeeexexxxxxxeexxxexexeeexeeexxxeexeeexeexxexxeeeexexxxexeexxxxxxeeexxeeeexeexeeexeeexexxeeeeexexxxxeexexxexexexexeexxxeeeexxeeexxxeexxexeexxxxxeexeeexeexxxxexxxexxxxexeexexxexeexeexxxxxexxxeexxxxxxexexexxxxxexxxeexxxexxxxxeexxexxxexxxexeeexxexxxxxexxxxeexxexeexxeeexexxexeeeexxexxxeeexexeeeeeeexxexxeexexxxeeexexeexxxexxexxxxxxexxxxeexxeexxeexeeeeeeeexxexeeexeexeeeeexeexexeeeexxxexexeeeeeexexeeeeeexexxexxxexexxexxxeeeexexexxxxexexexxxexxexxeexeexeexxxeeeeeexeeexexexxxxxeexxxeeexexeeexxexxexexexexeeexexxxxexexxexeexeeexeeexexxeeeeexxexexxxxexxxxxxexxeexxxxeexxxexeeexeexxexxexeeexxeeeexxeeeexeexxeexexexexxxexxexexxexxexexeexeeexexxxexxxexxeexxeexxexexexxxxxexxeexeeexxxxeeexeexeeexxxexxxxeeeexxeexxxxexxeexxxxxxexeeexxxxxeeeeeeexeeexxxeexeexxeeeeexeeexeeexxexxeeexxexeeexxxexxxxxexexxexxeexxxxeeexexxxxeeeexeexexexxexexxexeexeexxxeeeeexeexeexxxxeexxxexeexxeeexxxexxxexxexeeexxeeexeexxeexeeexxeexexxexxxexeeexexeeeexxexeeexexxeeeeexxeexxexexexeexeexxeeexexxeeeeeexxexexeexxxxxeeeeexxeexxeeeexexxeeeexxxxxexeeexeeexexeexeexxxexxxxeeexexexeexxxxeeeexxxeeexxxxeexeexeexxxexxexxexxeeeexeexxeeexxxexeexxxeeeexexxeexexxexexeexxeexxeeeexxexeexexxxexxxeexxeexxexexxxexexeexxxxxeeeeexeeeeexxxxexexxxxxexxeeexexxeexeeeexxxxexeexeeexeeexeeeeeexeeexxxeexeeeexeexexeeeeeexexeexxxxeeexxeeeeexeexexexxxxexxxexxeexxexexxxxxeexeexexexxxxxexexexxxeexexxexxxexexeexexeexxeexxxxxxeexxexxxeexexexxxeexexxxxexxexexxxxeexxxeeexexeexexxeeeexeexexexexxeeeeexexexxexexxeeexeeexxxxxxeeexeexexxexxxeeexxxexexeeexxxeeexxxxxeexxxeeeeeeexxxxxxexxxeeeexxxxxexxeeeeeexexeexexxexexexexxxeeeexxxexeexeeexxxexexeexxxexxxeexeexxexxeexexxeeeeexxexxxeexxexeexxxxxeeeeeeexxxxeeexeexxexeeeeexexxeexexxexxexexeexeexxeexeeeexxxxxeexexeeexxeeeeeeexxxeeeeeexexxxexexxexxxxxeeexxexexxeeeeexxxxxexxexxexxexxxexexexxxexxxxeeeexxxeeexexeeeeexxxxeeexexexeexxeeexexexexxexexxexexexexeeeexxeexxxexxeexxxexeexeexexxexxeeexexeexexxxexeexxeexeexeexexxeexxexexxeeexxeexeexexexxxexxexxeexxexexxexxxxxexeeeeeeexeexxxeeeeexxxeexxxxxeeexxxxxxexxeeexxxxeexxxeeexexexxxexxexxxexxxexexeeexxeeeexxeexeexexeeeeexxxxxexxeeeeeexxxexxexxxexexeexeexeexxexeexxexeeexexxxxxeeexeexexxxxexxeeeexexexxxxxeeeeexeeexexeeeeexxxeexxxexxexxxexeexexeexexxxxxxxxexexxxexxexeeexexeeeexeeexexxxexeexexeeexexexxeexxeexexxxxexxxeeexeexxeexeeeeeexeeeexxxxxxxxxxxeeexxexxxxeeexeeexxexexeeeexxeexxeexxxeeeexexxxxxxxxxxxexexxeexeeexeeeexxxexxeexeexeexeexxeexxeeexxexeeeeexeeexeeexxxexxexxeeexeeeexeeexeeeeexexxexexexeeeexxeeexxexxexxeeeexxeexxeeeeeeexexxxeeexxexeexeeexxeeeexxeexxexeeexxexeeexxxxxxeexxxeeeeeeexexxxxexexexeeexxeeexeexxeexxeeeeexexxeeexxexxeeeexxxxxeexeeexxxxxexxeeexexxxxxeeeeeeeexeexeexeexxxxxxexexeeexxxxexxexeeexexeexxeexexexexeeexxexxexxxeexexxxeeeeeeeeeeeeeexeeeeexxexxeeexeexexeeexxexxxxeexexxxexeexxeeeeeexxexexeexexexeeeexeeeexxexeeexexeexeexxxxxeexeexxxxxeeexxeexeexxxxeeeeexexeeexeeexxeexeeexxexexeeeexxxexxxxeexxxxeeexxexxeeeexeexeexexexxxexxeexxexeeeeeexxxxxxxxeeexeexexxxexexexxexeeeexexeexeeexeeexeeexeexxxexxxxexxeeexeeeeeexxeeexexexxexexeeeeeexeeexxxexxxexxxxexeexxexexexxexxexxeexexxxexxxxexxexeexxxeexexxeeexexeexxexxeeexxexxeexeexeexxeexxexeexexxexeexxxxxexxexeeeexeexeexexxxxeeexxxxxxxxxxxxeexxexxxexxexxexexexxeeexxeeeexexexeexexexxeeexxxeeexeeeeeeeexexeexxxexxexxeeexexxeeexxeexexxeexeexxeexxxxxeexxxxxeexxxxxeeexxexexxxxxxeexeeexxexxxxexxxxxxeexexxeexexxeexxeeexxxxxexexeexeeexeexxxxeeexxeexxxxxexxexeexexxxxxxeexexeeexxxxeeeeexeexxxxxexeeexexxeeeeexexeeexexxeexxxeeeexeexexeeexxeexeeeexeeexxexxeexxeeexxxeeeexexxeeeeexeeexxxxeexxexxeexeeeexxexxeexeexeeeexeeexxxxeeexxeexeeexeeexeexxexexxeexxxxxxxxexxeeexxxeeexexxexxexeexeeexxxxeexxeeeexexxeexxeexexeexexeeexxxxeexxxxxxexxxexeexeexexxxxexxxxxeexeeeexexxxexxexxxxeeeexxeeeexeeeeexxexeeexxxexxexxeeexxxeexxxeexexeexxexeexxexxeexxxxxxxxxxeexeeeeeexeeexexxxxxeexxexexeexexxeexeeeexeeeexeeexeeeexxeeexxxxxeexeeeeexxxexexexeexxxxeeeeexxxxexeeeexxeeeexexxxexexeeexexxeexxxxxexexxxexxxeexxxxxexxxexxxexexxxeeeeeeeeexxexexxeexxeexeexeexeeeexxxxxxxeexeeexeeexexeexexxxxxeeexxexxeeeeeexeeeexexeeeeexexeexxeexxexeeexxxxexeexexexeeeexxexeeexxeeeexxxeexxeexeexeeeexxexexxexxxeexxexxxxxxxxxexeeeeeeexxxxxxeexexxxxexexeexeexxxxxxexxxexxexxeeexeeeeeexxexxeeeeexexexxxexexeexeexxexeexexxexxxexxxxeexexeeeexexxeeexxxxxxxxxxxeexeeexxxexxeexeexxeexexxexexxxeeeeeeexexeeexeeexexexxeeeexxxxxeexxexexxxexxeexexexexxexxeeexexexxeexeeexexeexxeeexeeeeeeeexeexxeexxxxxexexxeexxexeeexeeexxxxxexxexxeexxexxxxxexeeexxeeexxxxexxeexeeeeexxexxeexexexexxxexeexxexxxexxxxeeexexeexeeeeexxeeexexeeexxxxxexeexexexeexexexxxxxexeeeeeexxxexxxxxeeexexxexexxxxexxeeeeeeexeexxxexexxxeexxxxxeeexexxexxeeexxexeexxexxexxxxxexxeeexxxxxxxxxxxxxxxexexeeexexxeeexxexxexeexxexeexexeexxeexxexexeeexxeeeexxxexeeeexeexxxeeexxxxeexeeeexxeexexxxeexxeeeeeeeexxeexxxexexexxexxxxeexeeexxexxxeeexxeeexeexexxxxxexexxxxexxxexeexeexeeeexxexxexxxexeexxxxexxxexeeexxeexexexxexexxeeexxexexxxxeexxexxeeexxeexexeeexeeexxexxxexxeexxxxxxxexxeexexxxexxeexxexeexxexxxxexeexexxxxeeeeexxxxxxexexxxeexeexexeexxxeeexexeeeeeeeexeeexeeeeeexeeexxxxexxexxeeexxeexxexxxeexxxxeeexeeeexxeexexexxeeexxeeeexxexxxxeexxeeexeeeexxxeexxexxxxeexexeexeeeeexxxexxxxexexeeexxeexexexxeexexxexxxxxxexeeeexxxxxeeexexxxeeeexexeeeeeexexeexexxexeexxeeeexxxxxexeexxxeexxxxeexexxeeexeexxexxxxeexeexeeeexeeexxxeeeeeexxeexxeexeexeexexxxxexxeexxxexeeeeexxxexexxxxexexxeexexeeexexeexexxxxxxxeexxeexexeexxeexxexxexexeexxxexxxxxexexexeeexeexxexxxexeeexxxxexxexeeeeexxexeexeexxxxeeexeeeeexxexxxexxxeexxxeeeexexeexxeeeeeeexexexeeeexxexxxxxeeexeeeexexxxxxeexxeexeeexxxxexxexeexeeeexeexxxxxxeeexexxxexexxxexxxxxexxeeeexxexeeexxexxxexeexexeeeeeeexxxeeexeeexeexexxxxeeexeeeexxxexxxxeexxxxxxxxxexxexxexexxeexexxexexeeeexexexeexexeexexxexxxxxexeeeeexxxeeeeeeeexexeexeeeexxxxexexexxeeeeeexeexxexxxeeexxeeexxeeeexxexeexeeexexxxeeeexxexexxexxeexxxxeexeeexxeexexexeeeexxxxxexxxeeeeeexxxxexxeeexexxeeexeeeexeeeeeeexxxeexexeexexexeexxexeexexexexeexxeexeeexexexxxxexxxeeexxxxeexeeeexeeeeeexexxexexxeexxexeexexxexexxexxxxexxeexxexxxxxxxxeexeexxxxxxxxxxxxeexxeeeeeexxeexeeeexxeeexeexxeeeeeeeexexxexxxxeexexeexxxxexexeeexxexeeexeexxeexxxxxxxexxxeeexxexxxxxeeeexexeeeexeeexeexxxexxexexxexxeexexeexeexexexxxexxeexexxxexeexeeeexxxeeexexxxexexxxxxxexxeexexxeexxxeeeexxexeexexeeexxexexxexeexxxxexxxxxxexexxxeeexexeeexexexexxeeexxeexxeeeeeexxxxexexxxxxxexexeexxexxexxxxxexexxexxeexeeexxxexxexxeeexeexxxxexexeeeeexeeexxxxexxxxxeeeeexeeeexeeeexxxxxexxxxxxxexeeexxxeeeeeexexxeeexeeexxxexexeeexexxexexxxexeexexxeeexexxxxxxexxeeexexxxxxeexxeexxexxexeeeexexexexexeeexeexeeeeeexxxxxexxxxxxxxeeexxexexxeexxexxxxeexeexeeexeexeexeeexxxexxeeexexxxeeexexexxxxxexeexeexeeexeeexxxxeeexxexeexxexxxexexxxxxxeexexxeeeexxeexxeexexxeexxeeeexeeexxxexxexeeeexxexxexexexxxxexeeeeeeeexeexxexxxeexxeexxeexxxxxeexeexxxeexexxeeexxeeexxxxexexexxexxxxexexeexexxxeeexxxexexxexexeeeeeexeexexxxxeeexeeeeexxeexxxxxxxxxexxeeexxxexxeeeexeexexxxexexexexxxexexxeeexxeexxeeeeexeexxxexeexxxxexxxxexxxexexeexxexxxeeeexeexeexxexeexxxxxxxxexeeexxexexxeeexxexexxexxeexxeeeeexxexxexxxxexxeexxexxxxexxeeeeeexexxexxxexeexxexeeeeexxxeexexexeeexexxxxexxxeexxexeexexexxexeexxeexxeexxxeexexxxeeexeexexxxxxeeexeeexxeexeeexxexxxxxeeeexexxxeeeeeeexexxxxexxxeeeexeeexexexxxxexexxxexeeeeexexeeeeexexeeexxexeexeexexxxxeeexxxexxeeeexxexxexxeexxxeexxexxxeexxxxeexxeexxeeeexxxeeeexexexexxxeeeexxxxxexexxxxexeeeeexexexexexxxxeexxxexxxeeexxxxxxeexxeexxexeeeeeeeexxxxxeeeeexeexeeexxxexxxxxxeeeeeexxexeexeeeexxexxeeexxxxexxxeexxxexexeexxexexxxexexeeexxxxxxxxxeeeeexxexxeeexexxxexexeexxxxeexxxxeexeexeeexexxxxexxxxxexxxeexexxexxxexxexxxxxeeeexxxxeeexeexxxxxeexexeexexxeexxexexxxeexxxxeexexexeexxeeeexxxxxeexexexeeeexxeexxeeexexxeeexxeexxeexeexxexxexxeeexxexexxxexeexeeexeeexxeeexexxxexexeeexxxexeexxexxexxeexeexexexxeexxxeexxxxxeexxexexxeeeexxexxexxexxxxxeeexxxeeexeexexxeexxeeexeexeeexexexeexxxexexxexeexxexexeeexeeeexexeeeexexxxexexeeeexexxxxexxxeeexexeexeexxexeeexexxexxxxexxexxxeeexxexxexxeexeexxxxeeexxxxeexxxeexxexxxexexeexxxexxxeeexxeeexexeexeeeeeeexxexeeexxexeeexexxeexxxxxeexxexxexexxeeexexeexeeexeexeexexeexeeeeeexxxxeeeexxxxeeeexexxeeexeeexxxexxxxeeeeexeeexeexxeeexxxeexxexxxxxxxxexexexeeeeeeeexxeexxeeexxeexexexxxxeeeexxeexeeexeexeexxxxeeexxexxeeexeexexxxexexxxxexxexxxxxeexxeexxxxexxexeeeexxxxxxxeeeexxxxexxeexxxxexxeexxeeexxxexeexxxxxeeexeexxeexxexexexeeeeeexexeexexeexexeexexxxexxeeexxexexeeexeeexxxeexeeexxxexxeeexxexxxxxxxxexxxxexeexxxeeeeexxxeeexeeexexxxeeeeeexxexxexeexexexexexeexxexxxxxexexxexeexxeexexxxxxexxexexexxxxxexxxexxexxxeexexxexexxeexxxxeexxxexxexxxxxeeeexxexexxxxxexxeexxxxxeexxeexxxxeeexeeexeeexxexeexxxxeexxeeeeeeeexeexexeeexxxeexxxeexeeexexxeexxexeexeeexxeexxexexxxxeexxxxexxxxxxexeexxxxexxexeexeeeeexxxexxxxeexexeexxeexexeeeexxxxxxxeexeeexexeeeexexeexeeeeexexxeeexxeeeeeeexxxeeeexexeeexxexxxxxxxxeexeeeexxeeexxxeeeeexexxeexxxeeexexeeexxexxexexexexexexexxxxxxexxxxeexeexxxeeeexexexexxxxxeexxeexxxxxeeexxexexxxxxxxeeeeexxxxxexxexeexexexeexeeeexxeexxeexeeexexxeexxeexxxxxxeeexexeeeeeeexxxexxexxeexexeexxxxxexexxxexexexxeeexxxeeexexeeeexxeexxxxeexexxxexxxxexeeexxxxxxeeeexeeexxexeexxexxeeexxeeeeexxexeeexeeexeexxxexxxeexxexexexxxeexxxxexxxeexxeeeexxeeexxxxxxeeeexexxeeeexeeeeeeexexeexxeeeeeexxexxexxxxxeeexexeeexeeexexexexexexeeeexxxeexexxxeexxxxxxeexxxxexxxexeexxeeeexexxexxeexexxexexxxxeexxexxxxeeexeexxexexexxeeeexxeeexexxexexexeeeeeexxexxeeeeeexxeeeexxxexexeeeexexxxxexxexxxexxxexeexeexexexxxxxxeeeexxxeexeexeexexeeeexxexeeexexxeeeexxexexeexxxexeexxxeeexexxxexeeexexexeexxexxeeeexxeeeeeeexxxeexxexxxxxxexeexxexxexeeeeeexeeexeexeeeexxxxexexexeeexxeeeeexxeexxxeexxxxxxeexeeexxxeeeeeeeexexexxexexexeexeexexxxeeeexxxxexexxeexxxexeexeeexexeexxxexxxexxeexeexexxxxxeeexexeeexxxxxxxexeeexxxxxexeexxexeexexxxeexxeexexexxexeeexxxxeexxexxxxexexexxexxxxexxxxxexxxexexxxeexexeeeeexeexxxexxexeeeeeeexexeexxexeeexxeexxxxexeexeeexexxexxxexeexxxeeeexexxxeeexxxxxeeexxxeeeexeeexexxxxxeeeexxxxeeeexexxexexexeexeexexexexxxexeeexexxexeeeeeeexxexexeeexxeeexeexeexxexxeexexxxeeexxxexxxxexxexeexexexeexxxeeeexxeeexeexxeeeeeexxexxexexxxxxexxxxeexexxxeeeeeeexxexexexeeexexexexxxxxxxxxeeeexeexxeeeexxxxxxxxxexxxeeexeeeexexexxxexxexxexexexxexeeexexexxxxeeeeexxeexexxexeexxxxexexxexxeeexxeeeeexexexxeeexxexexexexxxxxxxeexexexxeexxxexeexxexxxexxeexexexeeeexxxexeexxxxxeeexxxxxxxexxxeeeeeeexxxxxxexxxxxxxexxexeeeexxeeexxxxxxxexexexeeexxexxxeeeeexxeeexxxxxeeexxeexxexxxeexxxxexexxeexxeexexxexxxxexxxxxexexxxexxeeeexxeexxexxxxexxexxxxxexxeexexxxxxeexxxexxxexeeeeexeeeeeeeexeeeeeeeexeexxxexxexxxxexxxxeeeeexxxexxxxxxxexxxeeexxxeeeeexxxeexxxxexexxeeeexxexxxeeeexxexexxxexxxeexexeeexexeexexxxxxexxxexeexxxeeexexexexxexexxeexexexxxxeexexexxexeeeeeexxeexxexexeexxeexeexxexxxeexexeeeexexxxxexexeeexxeexxxeeeexexxxxxxxxexxxexxeeexexeexexexxxexexexexxeexxxxxeexxeeexexxeeexxxxxxxeeexxxexxxxxxexxeeeexeexeeeeeexexeeeexxxeeexeeexeexxxeexxeeeexeexexeeeeexxxxxxexxexxexeexxeexxeeeexxeexxexexexexxexexxxxexeexxxeexexeexexexxexexexxeexexeexeeexxexxeexxexexxeeexxexxeexexxexxeexeexexxxexexeeexexxxxexeeeexeexeexeeeeexexxxxexexxxexeexexeexeeexexeexxeexxxexexxxexeexxxxxexexxxxxeeexxeeeeeeexexeeeeexxxxxeexxeexxxeeexxexexeeexeexxexexexeeeeeexxeeexeexeexxeeexxeeeexxeeexexeeeexeexxxxeeeeeexxxxxexexxexxxexexxxeexxxexeeexxeeexxxeeeexxxxeeeeeexxxexxxxexxeeeexexxexxeeeeeexxeeeexexxxexeexxxxxeeeeexxxxxeexxeexxexxeexxxeexxexxxeeeexxxeexxxexeexxeeexeexxxxxexxexeexexexxexeeeeeexexxeexxexexexeeexxeeexxxxxxeexxexexxexxxxeexxxxexxeeeexxxeeeexexxexxexxeeexexeeeexxxeexxexxeexexeexxexexxeeexxexxexeexeexexxxxxxxxexxexeexexeeeeexexxxxexexexxxxxexxexeexxexxxeeeexxexexeexxxexeeeeexexexexeexexxexxeexeeexeexeeexexeexexexeexxxxeexxexxeeeexexxeeeeexexxxexxxexeeexxxxxexxxxxeexxexexxxexxexexxeeexxexxxeeexxxexeexexxeexexexeexxxexxexexeeexexeeexeexxxxeeeeeeexxxexexxexxexexxexxxxexexeexxexxeexexxeeexxxxexxeeeexxxeeeeeeexeexexxexexexeeeeeeeexxeeexeexeeeexxexxeexeeeexxeexxxeeexxexxeexeexeeeexxeexxxexxeexeeeexeeeeeexeexeeeexxeeexxxeexxxeeeeeeexxexxexxexeexxexxxxxeexexxeeexxeeeeeexeexeexexxeeexxxxeeexxexeeeexxxxexxxxxexxeeeeexxxxeeexxxxxexxxexxeeeeeexeexexxxxxxexeeexxexxxexxexxxexexexxeeeexeeexxxxexeeexexexxxxxexexxxxexxeeexeexxxxexeexxexxeexxxexxexxxeexeeexeexeexxxxxxxxeeexeeexeexxxxexxeeeexexeexxeexexeexxeeexxxxxeexxeeeexxxeexxxeexxxxeeeexexexxexeexexxexexxexexxeexeeexxexxeexexxexexexexxxeexxexxexxeexxxxxxxeexeeeeeeexexexexxeexxeexexxxeeeeeexexxexeexxeeeeeeexxxeexexxexxexexxexxxeeeexeeeeeexxxxeeexexxexxeexxexeexxxxxexeeeexexeexexxexexxxxxexexxxeexxexxexeexeexxexexxexxxexxxeexxeeeexeexexexeeexexxxeexeexxxxxxxxexxexxexxxxexxxexxxexeeeeeexeexxxexxeeexexexexxxexeexxxxexxexexxexxexeeexxxeexxexexeexxxeeeexxxxxxxexxxeeexxexeexxxxeeeexeexxxeeexexxxxeeeeeexexeeeeexeexxexxeeeexxxxxeeexeeeexxexxxxeexxxeexexxeeeeexxxeeexxxxxexeexxexxxexeexeexxexexeexxeeeexxxeeexxxxexexeeexexxeeexexeexxeexxxexxexexxxexeexxxexxxexxeeexexexxexxxxxxexexeeeexxexeeexexxeeexeeeexeeexexxexeeexxeexxexxexxexexexeexxxexxxxxexeeeeexexexexxxxeexeexxexexexxexxexxeexexexxexexexexeexxxexeexxexxexxexexexxeexxexxexxxxxexxxxexxexxxxxxxxxxxxxxexeeexexxeexxxexxxxeeeeeeeexexeexxeexxxxexxexxexeexxexxeeexexeexexeeexeexeeeeeexxxxexeexxeexxeeexeeeeexeexxeexexexxexexxxxxexexxexxxeeexxxxeeexxexeexxxxexxxxxexeeeeexeexeeeeexeexxexxxxeexxxxexxxxxeeeexeexexxxxeeeeexeexxxeeexexeexeexxexexxeeexxeeexxeexxexxxexxeexxxexxxeexeeexxxxeexeexxxxeexxexxexeeexxexxxxeexexxeexexexxxxxeexxexexexxxxeexxexeexeexeexeeexeeeexeeeeeeeexexxexxeeeeeeexxexexeexxexeeexeexexxexxexxxxeeexxeeeexxxxxexeexxeeexexxxxxxxxxxxxxxxexxexxeexeeeexxxxxxxxxxexeexxxxxxexexxexxexxeexexxxexeeeexexexeeeeeeexxeeexxxxeeeeexexexxexeexeexxxeeexxexxeeeexexxexxxxeexxxxeeeeeexxexxexexxexxxeeexxeeeeeeeexeexxeeexxexxexxexexexeexeeexxxexexxeeexxxeexxxxexexexeexeexxxexeeeexxxxexxxexxeexexeexeeexexxxexexeexxxexxexxexeeexxeeeexexxxxxxxexeexxxexxexxxxexxxxxeexxexxxxeeexeeeeexxxeeeexxxeexxxeeeeeexxexeeexxxeeeexexeexxxeexexeeeexxxeeexxxeeexeexxeeeeeexxxxexxeeeexxeeexxxxexxxxeexxexxxexexxexxxxxxexeeeexexexeeexxexxxeeeexexxxeeeeexxeeeexeexeeexexxxexeexxeexxxxexxxeeexeexeexxxxxxeeeeeexxxxxexxeexeexeeexxeeeexexxexeexexxxxeeeeeeeexxxeeeexexexeeeexeeexxexxexexxxxexeeeexeeeeexxxeexxxeeexxeeeexeexeexeeexexxxexeexxxxxxeeexexxexxeeeeeexxeexxxexxxeexxxxxexexxxexeexxxxxxxexexexxeexeeeeexeeeeeeeexexeeexeexexxxeexxexeexeeexexeeeeeexxeexexxxxxxexxxeeexxxxxxxeeeexeeeexexexxexexxeexxxxxxeexxexxeexexxeeexeexeexexexxxxeexeexxexxxxexexexexxeeeeexxxeexexeexxexexeeexxeeeeeeexeexexxxxeexexeexeexexexeeeeeexexexeexexxxxeexexexxxeexexexxeexeexxxexeeeeexeexeexxxexxexeexeexeeeexeexeexxeeexeexxexxexxxxeeexxexxxxxxeexexxxexexxxxxexxeeexexxeexxeeexexxxexexxxeeexxeexexexexxxexxxexxxxxxxxxxexexexeeeeexexeexxeexeeexxxexeeexexxxxexxexxeexxxexexexxexxexxexexxeeeexxexxxexeexexxexexeeeexxxexeexexexxexxxxxexxxxxeeeexexxxexeexexxexxexxxexxxxeeeeexxeeexeexexxeeeeexxxxxexexeexxeexxxxxxeexxeeexeexexeeexxxxxxexxexexexxexexxxexxeexexxeeexexexexxxexxxeexxeeexxxxxxxeexxxxxxxxeeexexexxeeexexxxxeexeexexexeexxexxeexexexxxeexexxxeeeeeexxxexxxxeexxeeeeexeeexeexxeeeeexxxexxxxeeeexxexexeeexxxeeeexeeexxexxexeeexxeeeeeeeeexxxexexeeeexxeexeeeeexxexxxeexeeeexxexeeexxeexxeexxxeexxxexeexexexxeexxxxeeexxeexexxxexxxxxxeexxxexeeeexexxxxeexxxexexxxxexexeeexeeeexxxxxeeexeeeeexxeexxeexxexexxxxeexexxeeeexexeexeexxexexexxxxxexexxexxxxeexeeexeexeexexxxxexxxeexxxxxxxxeeexexxxexxxeeexxxexeexxexeexxexxexeexeeexxexxexexexxxxexxxexeeeeeeeeexeexxexxxxexxeexeexeexexxexeexexxxxexexxxexeexexeexexxxeexexeexeexexxexexxxxxexexexxexxexeeeexeeeexeeeeeexeeexxeeexxexexxexxeexeeeexxeexxexxxxeexxxeeeexxxxxxeeeexexexxexeexxeeeeeeeexeexxexeeeexeexxeeexexxxexeexxexeeexxexxexxexexxxexeexxxxexeeeeexxxeexxeexxxeexxxxxexxxxxxeeeeexxxeeeeexxeeeexexexxexxeeeexxxxxexexxxxexeeeeeexxexeeexxxxexexxexxexxexxxxxxeexeexeeeeeeeeeexeexxxxeeexxexexexexxxexxxxxeeeeeeexxexeexxeeeexexexeexeexexxexexxxexxxxexxexexexeeexxeexxexxexxxeeeeexxexeeeexeexexxeeeexxxeeexxexxxxeexeeexxxxxxexxxxxeexxeexexxxxexxxeexxxxxeexxxxxxeeexexxxeexeexxeexxxexeexeeeexxxeexexeexxexexexxeeeexxxxxexxxexexexeexexxxxxeexexxeeexxexexexxeexxexeexxxxexxeeexxeexexxxeeeeexxxeeexexxxexexexeexxexxexxxxxexeeexeexexexeexxxeeeeexxexxexeeexxeeeeexexxeexexexxxeeexxxxexxexxexxexeeeeexexxexxeexxxexexxexxxxexeexeexxeeexxxeexxexexexexxxxexeeeeeexeexxxxxxxxexxxeeeeeexxxxeeexxexexxxxexxxxxxexexxxxeexeeexxxxxxeexexxxeeexexeeeexxxxeeexeexxxexxxeeexxexexexxexeeexeeexxexexexxexeexeexeeexxxxeeexxexxxxexeeexxexxxeeexxexxeexexxexeeeeeexxexeeeexxxxxeexeexxexexeexxeeexxxeeexexeeeexeexxeeexxxeexxexexexxeeeeexxxeeeeeeeexeexxxeeeexeexexexxxxxeeeexxexexxxeexeexxxxeeexxxxeeeexeexexxxexexeexexxxeexxeeeexeexexexeeeexeeexeexeexeeeexexxxeeexexexexxxxxxxeeeeexxeexxxexeeexeeexeexxeexexxxxexeeeexexeexeexxxeexexexexxxeeexxeeeeeexeexxeeexeexexxxeexeeexxeexxxxxexexxxeeexxxexexexexxxeeeexeexeexxeeeeeexxeexeeeeeexexxeexeexeexxxxeexexxexeeexxexxeexxxexeexexexxexxexexxxeexxxeexexxexexexxxxexeexxxexeexxexxexexxxexexxexxeeeexexxxxeexxxeexxxeexxxeeeeeexxeexexeexxexxexeeeeeexeeeexxxxxexxeexxeexeeexxxxxxxxxxexxeeeeeeexexxxxxxxeeexexeeexxxxeeeexxxxexxxxxxxeeexexxxexxxxeeeexeexxeeexxeeexxexxxxxeexeeexeeexeexxxeeeeeeeexexxeeexxeeeeeexxxxeeexxeeeexexxexxxxxxeeexeeeexxeeexxxexeeeeexxeexxxeeeeexeexxexxeeeexxxexexexeeexxxeexxxxeexxxxxxxxeeeexexxxexxxeexxeexexxxeeexxxxeexxxeeeeeeeexxxxxeexxeeexexexxexeeeexxxexxeeeeeexexeeexxeexxxxxxeeeeexexeeeeexxxexxeexxxeexeexxxxeexexxxexexxxxexexxxeeeeexexexxeeeeexxeexexexxxexeexeeeexxeexxexexeeexxexxexxxxxxeeexexeeexxexxexeeexxexxexexxxeexxexxxexxexexeexxxxeeexxxxeeexeeexxexexxeeeeexeeeeexxeeeeeexexeeeeeeexeeexeexeeexxxxeexxxeeeeeexxexxxeeexexeeeexxxeexexexexxxxxxxxxexxxxxxxeeexxxxeexxexxxxxeeeexxexexxxxxexxexxxxexeeexexexexexxxeeexxeeexexxxxexexexxeeexxexexeexeexxxxexxeeeexeeexexxxxxxxxxexexexxeexeexexeeeexxxeexeexexxxeeeeeeexxxxeexexxxxeeexxxxeexexxexexeexexeeeeexxxexxexxeexexexexxxeexeexxexexxxeeeeeeeexxxexxxxexxxeexeexeexxexeeeeeeeexxxeexeeeexexxxxeeexeeexxeeeeeexxexxxxexxxxxxxxxeeexxxeeeexeexeexeeeexexxxeeeexexxxxeeexexxxexeexeexxxexeexeeexexxexeexexeeexeexeexexexxeeeexeexeexeexxxxxexeexxxxxexxexeexeexxexexeexeexexexxexeeeexexeexxexxexeeexeeeeexxxexxxxxeeexexexxxxexeeeexxexeexxxexxexeeeexeexexeeexexeeexxxexxxxexxxxexxxxexeexxexxeexxeeexxexeeeexexexxxxexxxexxxxeeexeexxeeeeeexxxeeexexexxxxexxxxexeexxxxxxxxxeexeexeeexxxeeeexexxxeexeeexexeexeexxeeeeexxxxexxxeeexxxexxxxexxxxeeeexeexexxxxeeexxexeeeexxxexxxxxexexexexxexxexxxxxxxexexeeexexexxeeexxeeexxeeexexxxxxexxxeexexeexeeeeexxxexxexxexexxexxeexxxexexxxxxxxxxexexexxxxxexxeexxxxxxeexexxexxexexxeexxxeexxxxeexeeexxxexeeeexexxxeexxeeexexxxxxxxexexeexeexeexxxxxxeexxexxexxeexexexexexxxxexeeexxxxeeexxxxxxxexexexeeeeexxxxexeexexxexexxeeeeeexxeeexxeexeeexexxxxxexxeexeexeexxxeeexeexxeeexxeexexexxeeexeeexeeeeexxxexexeexxxxexxxxxexexxxeexeexxexeexxexxexexxxxxeexexxeexxxxxxxxeexxexxxexexexeeeeeeeeeexexexeeexxeexxxexxexxxxexxxeexeeexxxeexxexxxxxxxeeexxxexeeeeeexeexxxexxxxeeeexxxxxxexeeeeeeexxxxxxexexexxeexxxeexeexxxexxxxeeeexxxxxexeeexexxexexxxexeeexxxxeexexeexexeeeeexxxeexxexexeexeeexeeexxxxxexxxexxeeexxxxxxxeeeeexeeexxexeexxexxxxxxxxexxxexxeexxxxxexexexxeexexeexxxexxxxxxeexeeeexexxexexxxxxxxeexexeexxxxxxxxxeeeexeexexxxxexxeexexxxeexexeeexeeexeeeeexeexeeexexxexeexxxxxeexxexeeexeexeexxxeeeeeeexxexexxxexexxxxxxxexxeeeeeexxxexxxxeexeeexxxxexeexeexxeexxeeeexxxexxxeeexeeexeeexexxexxexexxxexxxexexeexxexxxxexeeeexexxeexexeeexexxxxxeexxxexeeeeeeexeeeeeeeexxeeexexxxxxxexeexxxxeexexxxxxexexxxexeeeexexeeeexxxxeeeexxxexxxeeexxxxexeeexxexxeeexeeeexexeexeeexeexeexeeeexeeeeexxeeexxxxeeexeexxeeeexexexeeexexxexexexxxexxxexxxxxxxeexxexexxxeeeexxxeeeeexxxxxxxexxxxeeeeexxexexxeeeeexxxeeeexxxxeexexxexxxxxxexxxxexeeexexxxexexeeexeexxexxeexexxxxxexxxexeexxexxxxexeexxexxexexxexexxexxeeeeexxexeexxexxxexxeexxeeeexexxxeexxexxxxexxxxeexxxxexxxeexxeeeeeexeeeexxexeeeexexeexeexxeexexxxeexexxeexeeexxxxeexeexeeexeeeeexxxxxxeeexxexeexxeeeexexexxxxxxexeexxxxexxexeeeexexeeeexexxxexeexxxeeexexexexexxxeexexeexxeeeeeeeeexeexxexxexexexeexxxeexxxexeeeeeeexxxeeeeexxxxexeeexeeexxxxxxxxeexeexxeeexxxexxeeexxeexexexxxexeexxeeeexeexexxxxexeexxxxxeexexeeexxxeexxxeeexxexeeexeeeeexeexeexxxexeeexxxexxeeexxeexxexxxxeeeeexxeexexeeexxeeeeexexxeeeexxxeeexeexexeexxxxxexexxeeeeexexxeeeeeeexxxexxxxeexexxxxexeexxexeexeexexeexxexxeeexeeeeexeexxxxexexexeexexxxxxeeeeeeexxexxexexxeeexxexexxeeexxeeeexxeeeeeexeexexxexxxxeexxeeeeexxxeeeeexxeexxexxxxxeeexexxeeexexxeexxexeeexeexeeeeeeeeexexexeeeeexxxxexxeeeexeexxxxxxexeexexxxxexexeeeeexeexxxeexeexexeexexexeexxeeexxexxxxxxxeexexxeeexexexeexxxxeexxxxexxexxexeexeeexxeexxxeeeexxxxxexexeexxexxeeexeexxxeexeexxeexxexxxeexxxxexeexexexxeeexxexxexexxeeeexeeeeeexxeexxexeexeeeeexeexxeexxexxxexeexxxxxxeeexxxxxxeexexexxexxxexeexexxxxeeeeexexeexexxeexeexeexxxexxxxxexxxxeexexxxexeexeeeeeexxxxexxeexxexeexxxxxxxxexeexxexexxxeeexexxxeexxexxxxxxxxexexexxexexxeeexexxxeexxxexxxeexxeeeexexxxxexeeeeexxxeexeexeeexexxexxexxeexexexexeexxexxxxeeexeexxxexxeexxexexxxxxeexexxexxxxxxxxxeexeeeexxeeeexeeeexeexxeeexxxexxxxeexxxexexxexeexxxxeeexxeexxxeexxeexxxeeexeexxxxeeeexeexeexxexxeexeexxxexxeeeexeexxxeexxxeeeeeeeeeeexxxeexexxxxexeexxxxxeexeexxxxeexexeeexeeeeexxeeexxxxexexexexexxexexxxeexxeexxeexxexexeeexeeexxexexexxxxexexeeeexxxxxexxeeeexxxxxxeeexexexeexeeeeeeeexexeexeeexxexxeexxxxxxexxexeeexxeexxexxxeexeexexexeexxxeexeexxexexeexexxxxxxexexxxxeeexeeexxexexexxexxexxexxxxxxexxexxxexxexeexxeeexxxexexeexxxxxxxxexeexxeexexexexexexexxexeeeexeeexxexxeexxxxexxexeexeexxexxexexeexexeeeexxeexeeeeeexxexxxeexexexxexexexxeexeexxeexexxxxexexxxxeexxxeexxxeexxexxeeexeexeexexxexxexxexeeeeexexxxxxeeeeeexexexxeexxxxxxeexxxeeexexxxexxeeeeeexeexxxeeexexexxexexxxexeexexxxxexxxxexxxxxexxeeexeexexeeeeeexxexeexeexexxexxxexxeeeeexxeeexxxexexxeexexexxeexexexexxxxxxeeexxeeeexxeexxexexexxeeexeexxeeeexexxexxeeeeeeeexexexexeeexexexeexeexexxxexexexexeexeeexxexexxxxxexxxexxxxexxxxxxxeexxxxexxeexeeeexexxxxxxxexxexxexxxxeeeexexeeexxexeeexeeeexexexexeeeeeeeexexxxxxxxxxeexeexxxxeeexeexexexeexexxxeeeeeexxxxeeeeexxeeexeexexxxxexxxexxxxeeeexeeeeeeeexeexxxeexxxxxexxexexexeexeeexexxxexxeeeexxeexxxeexexexeexeexxxexeeexxeexexxxexeeexexexxeeexexxeeexxxxeexxxxexxeeeeexxxeeexexxxxexxexeeeexexxexxxxxxeexeeeexxxexxxeexeeeexxxxeeeeeeeexxxxxxeeeexxexeeexxxeeexexxexxxxeexexeeexxexxxexxeeeeexxxxxeeeeexxxxexeeeeexxexeexxxexexexexeeeexxxxxxexxxxeeexexeexexxeeeexxexxxeeeexeexxeeeeeeeeexexeexexexexxeexeeexexxexexxexeexxeeeeexxexexeeeeeeeexxxexxxexeexexexxeexeeeexexxexxxxxxexeeexexxxxeexxxexxxeexxxeeexeexexxexxxxexxxeexeeeeexxxxexxexxxeexeeexeexeexeeeeexxxexexxexxxeeeexexxexxxeeexxxxxxxxexexxxxexxxxeeexxxexexexxxxxxexxxxxxxexeexxexxeexeexexexeexeeexxxxxeeexxxxxeeeeexxexeeexxxxexxexxexxxxexexxxxxxxxxexexxxeexxxxexeexxxeeeexxxxxexxxxxxeexeexeeexeexeeeeeexeexxxxeexxeexxxexexexxxxxxexexxxeeeexexxeexxxxeexxxeeexeeeeexexeexexxexeexeexexexeeeeeeeexexeexexxxxeeeexxxxxeexeeexeeexeexxeeexxeeexexeeexxeeeexxxeeeexeeexxxeeeeexeeeeeexxexxxexxxexexxexxxxxxxexexxxeeexexxxexxeeexxeexexxeeexxxexexxxxeexeeeeexexeeexxeeexeeexxxxxxxexexeeexexeeeexxeeexeexeeeexxexeeexeexxxeeeexxeeexeexexexxeexexexxexexeeexxexxxexeexeexxxexeeeexexexexxexexxxxxxxeexxexxeeexxexxxxexexexeeeexxxxexxxxeeeeeeeeeexeeexxxeexeexxexxexexxxxxeexxxxxxexexeeeeeexexeeexeeexxexxexexexeexexxxexxxeeexxeeexexexxxxxexxxeeexexexxxxxexxexxxxxeexeeeeexexxexexexexxexexexexexexxxxxxeexeexxexxexxxxxeeeexexxxeexxxxexxeeeeexeexxeeexexeeexxxexxxxeeeeexexexxeexxxxexxeeeexxxxxxxexeeexeeeexxeeeexexxxxexxxexeeeexeeexeexeeexeexexxxxeexxxeexxeexexxexxxexxexxxexxxexxexeexexxxxexxxxxxxxxxeexexeexeeexeexxxexexxxxexexxexexxexxeexexeeexexexxxexxxxxexeeeexexexexxeexexxeeexxexxxexexeeeexexxxxexxxexexxeeeexexxxeexeexexxexxxeeeexxexxxexxeeeexexexexeexxxxxxeeexexeexeeexexeexexexxxexexxxxexxexeexeeexeeexeeexexexexeeexxxeeeeexeexxxxxxxexexxexexexxeexeexexeexxxxeeexexeexxeeexeexeexxxxeeexexexxxeexeeexeeeexeeeeeexeeexeeeexxeeeexeeeeexeeeeexeeexexxxxeexxeeeeeexeexxeeexxexexxeeeexxxeexeeexxeexxexeeeexeexeeeexexxxxxxexxexeeexeexxeexexexxxexeexxxxexeeeeeexxeexxexeexxexxxxeexxeexxexeexxxeexxeeexexxexexxxxeexeeexxxeexexxxeeexeexeeeexexeeexexxxexeeeeexexxxxeexxeeexeexeeeeeeexeexeeexexxeexxexxxexexxxxexxxeeeeeexexxexxeexexeexeeexeexeexexeexxxxxxexxxeexexexexeexexxexxexeeexxxexeexxeeeeexxeeeexxeexexxxeexexexxxxeexexxexxxxxexxeeeeexeexexxxxxexxxexexxeeeexxexxxxexeexexeexxexxeexexexxexexexexeeeeexexxxxxxxxxxeexxxxexxexxeeeeexxxexexxeexeexxeeeeexxexexexxexexeeeexxxxexeeeeexeeeexexeeexexeeeexxexexexexxxeexexxxxxxxxeeeexexeexexexeexxxexeeexxexxeeeeexxexxeeeeexeexeeexxxeeeexxxxxeexxxeeexeexeexexeexxeexxxexexeexxxxeexeeexxxeexxxxexxxeeexxxexexeeeeeeexexeeeexxxeexexxxeexexeeexxeeeexexxexxxexexxxexxeexxxeeeeexxxxeexeexxexeeeexexxxeexexxeexeeeeeeexxexxexxxxeexxxxeexexxxxeeeexxeexxexxxexeeeeeexxexxxxxxxxeexeexxeeexxexxxxexxeeeexxxexexeexxxeexeeexxxexxxxexxxexexeexxeexxxxexxxexeeexxeexxxeexeeeexeexeeeexeexexexxeeeeeexxxexxxxeeeexexxexeexxxxeeeexxxeexxeeexeeexexxeexexxexeexeeeexxxeexeeexexxxeexeeeeeexeeexexeeeexxexeeexeexeeeexeexxeeexexexexxxxxexeeeeexxexxxeexxexxxxexeexxxexexxxxexeeeexexeexeexxxxeexeeeexxxeeeexexexxxexxxxeexxexxexxxeexeeexxxexxexxexexeeeeexxxexxxxxexxeeexexxeexexxxxxeeeexeexxexeeexexxeexeeeeexxxxeexxxxeexeexxexxeexxeexexxxeexeeeeexeexxeeexxexexeeeexxexxxeeeexxxeexeexxeexexexexexexeexxeeeexexexeexeexeexxxeexexxxeeeexeeexexeexxexxexxeeeeeeeeeexxxxxexxeexxeexxexxxxxxxeexeexxeeeeexxxexxxxxxexeexexeeexxeeeexeeexxeexxexxxeeexxxexexxxxxxeexexxxxeexxexxxeeexxxxexxxexexeexxexxxeeeeeeexxexxeeexxeeeeeexxxeexexexeeexeexexxxexxeeeeeexxxxexexxxexexeeexexexxxexeexxeexeexeeeexexxeeexxeeeeeexeexxxxxxxxxxxxxxeeeexxxxxexxeeexeeexexxxeeeexxeeexxxeeexeexxexxeeeexxeeexexexxxeexxexxxxxxexeeeeexxeexxeeexxxxexeeeeexexxeexeexxexxxexxxeexxeexxxeeeexeeeeexxxxexexxexexexxexexeeexeeexeexeeexxeexexeeexexeeexxexexeeexxexxexxxxxxeeeexxeeeexxxxexexxxexxxeexexxxexeeexxxexexeeeeexxxeeeexxxeeexeeeexeeexxeexeexexeeexxeeeeeexxeeeeeeeexexexxexxeeeexxeeexeeeeeexxxexxeeexeexeeeexxxxxxexeeexexxxxxxxexxxxexexeexxxxexxxxxexxxxeeexexxxxxxexexexexexexxexxexexxexxexxexxxeexeeexxxexeexxxxeeexxxexeexexxxxxexeeeeexexexexxxxxxxxxxxexexeeeexexexexexxxxeexexxeexxeeeeeeexexxexxeeexeexeexeeexxeexxeexxxxexeeexeeexexxexeexxexexexxxeexexxxexxxxxeeeexeeexexexxxxeexxeexexxeexxxxxeeeeeexxxxxexeexexeexxeeeeeeeeeeeeeeeexxxxxxxeeeeexexxeexxxxxeexxxxexeexeeeexexxxexexxexexxeeexexexxeeexexxexxxexxeeexexxexeexeeexexxxxexeexexxexeexxexeexeeeexxxexeexxxxxexxeeexeeexxexexxeexxeexexeexeexexexeexxxxeexeeeeeeeeeexexxeeexeeexxxxexxxxxxeeexxexexxxeexxexxeexxeexxxexexeexxeexxxxxxeeexxxexxexeeeeexxxxeexxexexxeeeeeexexexexxexexexxxxeeeeeexxeeexexxxxeeexexexxxxeexxxxxxeexexxxexxeexeexeeexxxxeeexexxxexxxeexexeexxxxxeeexeexxexxxxeexxxxexexxexxxexxeeeeexexxxxxeeeexxeexxxexexxxxxexeexxexxexeexexxxxeexexexexexeeeeeexxeeexxeeexxxxxxxeeexxexexeeeeexexeexeeeeexxxexxexeeexxxeeexeexxxxexexexexxxxxexeeexexeexeexeeexxxexexxxxxexeexxxeeexexexexexexeeexxexexxxeexeexxxxxxxexexeeexeeexxeexexeexxexeexxexxexxxexexxxxxexeexxxeeeexxxxxexeeexexeexexxxxxexeexexxeexxxeeexeeexeeeexeexeexeexxxxxxxxeexexxexxexeeexeexeexxxeeeeexexxexeeeeexeeeeexxxexexexxxxxexxexxxxxexxxexexxxeeeexxexxexxxxxeeeexxeexxxxxxeexxeexeeexeexexexeexeeexexeeexexxeexeeexxxexeexxxxexxxeexxexexeeeeeeexxxxxeeexxxxxxxxeeeexeexxxexxexexexxexexxexeeeeeeeexxxxxexexxexxexxeexxeexxxexeeeeexeexexxexeexxexxexexexexeeeeeexeexxxeexxexexeexexexxxeeeeeeeeeexexexxxexexxxexxeeexxxexxxxeeexxeeexeexeexeexxxxexeeexxxexxexxxxxxexexxxeeeeexeexxeexexxxxexeeeexeexxxxxxxexxxexexexeexexeexxxeeexexxexexxxxeexeexexxxeexexeexxxeexeexeexxxxeexxexxexexxxxxxeexxexexexxexxexexxxxeeexeeexexxeexexxxeexeeexxeeexxxxxexxxeeexeeexxxxexeexxexxxexxxeexxxxexxxeeexeeexeeexxxxeeexxexxxexexexexxxxxxxeeeexexxxxxxxxxxexeexeexxeexeeexxeeeeexeeeeeexeeexexeeeexexexexxxxeexexxeexeexxxexxxxxxexxexexxxxxxxxeexeexexexxexxexexxxeeeexeexexxeeexeexxxexeeeeeeeeexxexexeexexeeeexxexxxxxexxeexxeeeeexexxxeeeexxxexxxexxxexexxxxxxxexxexxxxexxxexxexexeeexexxxxxxxeeexxeeeeexxexeeeexexexxexxeeexxxexxexxexxxxxxexxeeeeeeexexxxexexeeexeeexeexexxexxxexxexxxxxxxexxxxxxeeexxeexxxexxxeexxexxeeeeexxexeexeexxxexxeexxxeeexexxxeeexxxxxeexexexexxxxeexxxexxeeeeeexxeeexxexeeexxxxexxeexxeeeexxexxxeexeexxexxxxxeexeexxeexeeeexxxxxexeexxxexxexxexeexxexeeexxxexeeeeexeeeexeeeexexeeeexexxeeexexxxeeexexexxeeexxexexeexxxeeexxeeeexexxxexxexxeeexeexxeexxexeexxxeeexexeeeeexxeexxeeexeexxxxxexxeeeeexxxeeeexeexeeeexexxxexxexxexeexxeexeeeexxxxxxexxexxxxeeexexeeexxexexxxeeeeexxxeexeeeeexxexeexxxxeeeeeexxxxeexxxeeexxxxxeexeeeeexexexeeeexexexexexxeexexxxeeexxexexxexexxxeexxxxexxexexeeeeexeexxxxxeexxxxexxxxxxexexexeeeeexeeeeexexxxeeeeeeexxeexexxxxexexeeeexxxxxexeeexexxxxxxxexxxeexxexeexeeexeexexxxexexeexeexexxexexxeexeexxeexxxeeeeexxeexxexxxxxxeexxxxeeexeeeeexxeeeeexeexeexeeeeeexexexxeexexexxeexeeeeeeexxxxeexxeeeexxxxeeeeeeeeeeeeexxeexxexexeexexxexexxeeeexeeexeexxeeeexxeeexexexxexxxeexxexxeeeexxeeeexexxexeexxeexxxexxxxexexeexxxeeexeeeexxxeexxexxeeexexxxeexexeexxxxxxeexeexxxexxexxxexeeexeeexxexxeexxexeeexeeeexxeexexxeexxxexeeexexexeeexxxxxxeexeeeexexxxexeexexxxxeeeexxeeeeeexxexxxexxexxexxexeeexxxxxeeexexexeexexxxxexxxxxxxeeexeeexxxexxxxxexeexexxexexeeexexexexxxexxxxxexeexexxxxexexxxeexeexxeeexexxxxxeeeeeeeeexxxxexexeeexxxexxexxeeexexexxeexeeeeeexeeexexxeexxxexxxeexxxexxexxxxexxxxeexexexxexxxexexxxeeexeeexeeeeexexeexxxexeexxxxexexeeeeexxxexxexeexxexxexxeeexxxeexexeexxxexxxeexexeeexxeexeeexxxxxexeexxxexxexeexxexxxexxxeeeeeeexeeeeexxexxexxxexxxxeexxxexxxexxxxexxexeeexeeeeexxeexxxxeexeexxexexxexexxxeexeexexeeexexexeexxxeexxexexxexxxexexeeeexxxexexeeexexxxexxeexxeeexexeeexxeeeexeeexxeexexxxeeeexxexxexxxxeeexexeeeeexexexxxxeeexeexxeeexexxeexeeeexeexxxxxxxexxxeeeexeeexxeeexeexexxxxxexxxxxxexexxexexxxeeexxeeexxxeeeeeexeeexeexexexxxeeeexexexexexexxxxeexexeexxxexxxeexxeeexexeexxexeexxexxxxexxxeexexeeexeeexxexeexxexeeexexxxxexexxxexxxeeeexxxxeeexeexxxeexxxexxxxexxeexxeexxeeeeexexxxexexxexeeeexexxexxxeeexeexeeexexexxeexxeexxxxxexxxexexeeeeeeexexeexexexexexeexeexxexeexexxxxxexxxexxeeeexexeexeexeeeeeexexeexeexexeexxexxxeeeeexexxexeexxxxxxxxeeeexxxxeexxxexeexexxxeeexxexeexxexxxexexeexxeexxexxxeeeexxxexexexeexxeeexeeexeeeeexxxxxxxexexxxexexxxxxeexeeeexexexxxexxxxxxxxxeeexxeexeeeexxexexeexxxexxeexxxeexexeexxexxxxeeeexxxexeexexeeeeeeeexexeeexxxeeeeeexexxexxxxxxxexxexxxxeexxexxexexxeeexxxeexeeexxxeeexeexeeexxeexexxxxexxxexxexeeeexxeeeexeexexexxxexxxexeexxxxeeeeeeeeeeexxeexxeeeeexeeeeeeexexexxexexxxeeexeexeeeeexexexexeeexexeexexexxexexxxxeeexexexxeexexxxxxeexexxxxexxxxxeeeeexexexxxxxeexexxexxxexxxeeexeeexxexeeexeeeexexxxxxeeexxxxeexxxxeeexexxxxxxxeexexeeexxexxxexxeeeeexxeexxexeeeexxeeexeeexxexxexxeeeexexxxeeeeexexxeexxexeeexexxxxeexeeexeeeexeeeexeeexxexxeeeeeexxeexxexeexexeexeeexxxxeeexeexeexxeeeeexeexexeeexeeeexxxxxxxexeexexexxeexeeeexexxexxxxxxexexxxxxeeeexxxxxxxxeexxexeexeexexxexxxexxxxexxeeeeexeexxxeexxxeexxxeeexexeexxeeexeeexxxeexexeeeexexeexexxexxxeexxxxexexxxxeexxxxeeexxxxexeexxxexxxxexeexexeexxexxexxeexexexeexeexxxxxxxxexxxxxeeexexeexeexxxxxexxexeexexeeeexxxexxxxxexxxxxxexxxxxeexexxexxexxxxxexexxxxeexeexeeeexxeeeeeeeeeexxxxxexxeeexeeeexexxexxxexxxeexxexxxxxeexxxxeeexxexexxeeeeexeeeeexxexxxeeexexeeexxeeeeexxxxeeexxxxeeeeexeeeeexeexxeeeeexxxeeexxxeexexexxxeexeexexeeeexxeexexxexeexexeeeexexxexexxxexeexxxxxxxxxxxeexxeexxeeeeexeexxexeexeexeeexxxexexxexeexxeexexexxexxxeeexeeexxexxxeeexxeeeeexeeeexxeeexexxexeeexxxxexeeexxeeeeeexexexeexexeexeeeeeexexxexeexxeexxeeeeeeeexxxxxeeeexexexexxxxeexxxxeeexxeeexxeexxexxxxexxxxxeeeexxxeeeexxeeexeeeexexexexxxeexeexxeeexexxxxxexexxexexexexeeeeeexeexeexeeexeexxxxxxexeexeexxxxexeeeexxeexxxxexexxexxxxeexexexxxexeexeeexxxeexxeeeexxxexxeexeexxxxexexxxexxxexxexexeeexxexxxxxeeexeeexexeeeexxxxexxeeeeexxexxeeexxxeexexxeexxxexeeexexexxeexxxxxxxeeexexxxexeexeeexexxexxeeeexeexxxexxeexeexexexexeexeexxeexxxxxxeexeeexxxexxeexexxxeexexxxeexxeexeexexeexxxexxexxxxxeexeeeexexeeeexexexexeexxxeeexxxexxxxxxexxexeeexxxxxxxexxxxxexeeeeeeeexeexeeeexxeeexxeexxexexexexxxxxexexexeexxxeeeeeexxxxeeexxeexexxxeeexeeeexxeexexeexeeeeeexexxxxxexeeexeexxeeexeeeeexxeexxexexxxxeexexeexeexxeeexxeeeexexeeeeexexexeexxeeexxexxxexxexexxxexxexxeexexxexxxxexxeeeeexxxeexeeeeeexxxeexxexexexeexexexeexexeeeeeexeeexeeexxxxexexeeexxxexexexxxexxxeexeeexexxxeexeexxeeexxexexeeeeexxxeexeeexxeexeexeeexeeexeexexeexxxxxxxxexxxxxexxxeexexexxeexexxxxxexxxxeeexxeexeexeeexxexxeeexxeeexexeexxxeexxxeeeexxexexxexeexexexexeeeexxeeeexeexeeeexexeeexexexxxeeexexexxxxeeeeeexxeexeexexexxexxeeeeeexxexxexxeexxexexexexeeexxexxxeexxeexxxxeexeexeeeeexxeeexxeexxexxxeeeeexeexxexexxexxexeeexxxexeeeexeeexxexeeexxeexxeeeeexexeexxeeexexxexexxxxxxeeeeeeeexexeexeexxxexexeeeexxxexeexexexxexeexxexxexxexexxxeexexeeeeeeeeexxxxexxxxxeexxxxexxexxeeeeexxxxxexxeexxxexeeexeexexeeexxexeexeexexxxeeexexeeexeexexeeexxxeeeexeexexxxeexxxeeexexxxxxxexeexeeeeeexeeeexexexxeexeexxeeeexexexxxeexexeeeeeexxxxeeexxxxxeexxxeexxeexexxexeexxeexxxexeeeeexeeeexxeexexeexxexexxeeexxxxexeeeeeeeexxxexeeeexeeexexexeexexxeexexxeexexxexeexxexexexxeeexeexeeexxxxeeeeexxeeeeexeeexxeexexxxexeexeeexxxexxeexxxeexexxeexxxxxxeeeexxeexxexxxexeeeeeeexexxexxxexeeeeexxeeexxexxxxxxxxeeeexxexexeexxeeexeeexexexxxxexxxxxxexexxeexxexexxxxxeexxexxexxexeeeeexexeeeeexeexexexxeeexxxxxeexxexexxeeexxxexexxexexeexxxexxxeexxxxeeeexexxexeexxeeexexexxxexeeexexexeexeexxeexxeexexeeeexxxxeeeeeeexexeeeeexeexxexeexexxxxexexeeexeexxeeeexxxexxeeexxexexexexxxxeeexexxeexeeexxxxexeeeeeexxeeexexexxxexxxeeexxexxxexxeexeexxxxexeeexexxeeeeeexxxeexxxxexxexxxexxxexeexxxxxexeeeexxexeexexexexexxeeexxxxeexxxeeexxeexexxeeeeexxexxxexxeeeexeeexeeeexexxexeexexxexxeeeeexeeexxeeeeeexexexeeeeexeeexxeeexeeeeexxeexeeexeeexexxxeexeeeeexeeeexxeexexxeexxxexeexexxxxeexeeexxxexexxxxxxxeexeexxexeeexxxexexxeeexeexeeeeeexeeeexxeexxeexxexxxxxxxxeexexxxexxexxxxxexxexexxxxeeexexexxxxxxexexxxxxxexeexeeexexeexeeexxxxexexeeeexexexeeexeexeexxexxexxeeexxxxxxexxxexexeeeeexxeeexxxexexxxeexeexexexexexxxexeeeexexeexexxexxxexxxexeexxxxxeexexeeeexeeeeeexeexxeeeexxeeexexxxexxeexeexexxxeexxxxeexxxxexxeexxexexexeeexeexexeexeexexexxexxxexeeexeeexeexxeexxeexexexeeeeexeexxexxxeeeexxxexxexxxeeexeeeexxxxeexxeeeexeexxeeeeeexexxxeeeeexxxxxxxexxxeeexxexxeexxxxxexxxexxxeexeexxxeexexxxeeexeeeeexexeexeexxeeeexxxexeeeexxxxexxexexeexexeexexxexxeeexxxxxexxexxeeeexxeeexexxeexxxeeexeeexeexexxxeexxxexxeexxexxxeexxexeexeeexexxxexexxxxeexexxxexeexxxxxeexxeexexexexxexxeexxxexeexxxxxxeexexexxeeeeexxxxxeexxeexxxxexeexxxxeeeeexexxxexxxexexxexxeeexeeeexxxexexexxeeeexxxxeeexxxeeeexxexxexxeeexeexeexeexxxxexxeexxxeeexexxeeexxxxexeexxexeexexexxeexxeexxxxeexexxexeeexeeexxeexxeexexeeexexexxeeeeexxxxxexxxxxeeeexexeeeeexeexxxexeexxexxxxeeeexexxexxxexxxexxxxxxexxxeeexxexxxxexxexexxxxxxexexxeeeexxxeexxxxxexxexexeeeexeeexeexxeexexeeeeexxexxexexeeeeexexexeeexxexeexeeexexexxexexxeexxeeeeeexxeexeeexxexexeeexxexeeeexeexexeeeexxeeexxxexexxexeexxxxexxexexexeexxxxxexexeexexeexxxexxxeeeeeexxxexxexeexeeexxxeeexexexxxeeexxxeeeeexxeeexxxxxxxeeeeeexeeexxxxeeeeexeexxxxxxexexxexeexexexexeeexxxxeeexexxexxxeeexexexxeeexeeexxexxeexeexxexeexxxxxeexeeexxeexexxeeeeexxxxxxxeeeexxxexxeexexxxxxexeexxexeexeexexexxexxeexxexxxxeeeeexxexexxxeexxxxxxxeeexxxxxxexeeexexeexeeeeexxxeexexeexxxxxeeeeexeexeexeexeeexexexeeexeeeexxxxeeexxxexexxxxxeeeexxxexexexxeexxxexexexeexexeexexexexexxxxeexxeeexeexxeeexexxexxexeexeexxxexexxexeeexexxeexxexxexxexeexxeexexeexxxeexxexxexexeeexeexeexxeexexeexeeeeexexxxxxxxexxeeexxxxxeeexxeeeeexxxeeeeeexeexxxeeeexxeeexxxexexeeexeexeeexeeexexexxxeexxxxeexxexxexexxxxxeeeeexeexxxxxxeeexeexeeexexexxexxexxeexexxeexexxxexeeeeexxxexxexeeeexeexxxxexexeeeeexxxxxexxxexexxxxxeeexxeeexeexeeexexxexexxexeeeeeeeexexeeexeexexxxexexxxxexxxexeeexexxexexxxexexeexxeexxexeeeexeeexxxexxeexxexxxxxxexxxxeeeeeeeeeeexxxeexeeeexxxexxxeexexexxxxeexxeexxeeexxxxexeeeeeeeeeeexexeexxexxxexxxxeeexeexxexxexxexxeexxeexxxeexexxxxxexxxexxxeeexeexeexxxexxxxexxxexxxxxexeexexexexxxxeexxxeexeexeexxxxeexxeexxxxxxxexeeexxxeexexxexxxeexxxxeexxeexexxxeexexxxeeeeeexxeeexxxxxxxexeeeexexexexxxeexxxexxeexxeexxxxxexeexxxeexeexxxxeeeeexxexxxeeeeexeexxxexeeeeexxxxxxxxexxexxexxeeeeeexexexxxeeeexeexexxxexexxeexxexexexexxxeexeexeeexxexeeexxxxxxxxxxxxxxexxxxxeexeexxxexxexexxxeexeeeexxexeeexexxeexxxxxxeexexexxexexexxxxexxxxeexexxxexexxexxeeeeexxexxeeeeexxxeexxexxeeeexxxxxexexxxexxxeexxexxxeexexexxxxeeexeeeexxeeeexxxeexeexxxxexxexxexexeeexeexxeexexxxxxxeeeeeeeexxxexxexeeexexexeexexxxxexexxexxxexxxexxxexxeeexeeeexeexxxexxxxxxeexxxexexeexexexxxxxxexxxeeexeeexeeeexexxeexexexeexeexeexxexeeexeeeexeexexxeeexxexeexxxexexxeexeexxxeexeexxexxexxeexxeexexxexeexexxeeeeexeexexxxxexxexxexeeeexxxeeeeeeeeeeeexxeexeeexeexeexexexeexxxeexxxxexexexxexexeexxxeeexxxexxxxxxxxexexxeeexeexeexxxexeexxxeexxexeexxexxeexxeeeeexxeeeeexxeeeeexxxeexexeeeeeexxexxxeexeeeexeeeeeexxexeexxexeexxeexxxeeeeexexexxexxxexxeeeexxxeexxeeeeexeexexxexeeeeeexxexexxxeeeexxxxxexxeeeeexexxxexeexxxxxexexxxexeexxeeexxxxexxexexxxeexxexxxxexxxeexeexxeexxxeeexxxxexeexxxxxexxxeeeexxeexeexxexxxxeexeexxexxexxxxexxxeeeexxxeexxexxxexxxexxeexexeexxeeeeeeeexeexxxeeexxxexeexeexexxexxxeeeexxeexxxxexeexxeexxexexxexexxxeeeexxeeeeeexeeexexxexxexeeeexeeeeexxexxxxexeeexeexeeeexxxxeexxxxexxxxxeexexxxeeexeexeexxxeeexxeeexxexexxeexexxeexeexxeeeeeeeeeexxexxxxxxexxxexeeeeexxeexexexxexeexxexxxxexxxxexxxexxxxeexxxeeeeexxexxxxxeeexexexexxeeeexxxxxeeeexexxxxeexxxxexeeexexexxxexeexxeeeeexexeeexeeexxeeeeexeeexeeexexeeexxxxxxxxxeexexeexxeexxexxexxexxxxeeeeeeexxexxxexxxexexxexeeeeexxxeexeexxxxxxexxxxexexxxxxexexxeexxeexexxxeeeexexxexexexxxxeexexxxeexxxxeeexxeexxexxexxxxeexexeexeeexxeexeeeeeeeeexexxxxxxxeeeeeexxexeeeexexexxexxeeeeeexeeexeexeexxxexxxxxxeexeexxxxxexexeeexexexxexxeexexxexeexeeexeeeexxexexxxxexeexxxeeeeeeeeeeexxexxxeeexeexxexxeexxexeexexeeexxxxxxxexexxxexxxexexeexxxxeeeeexxeexexeeexeexxexexexeexeexxxexexeexxexxxexexxeexxxexxxxxxxxexxeexxeeeeexexeexxeexexxxexxxeeeeexeexeexxeexeeeeexexxxeexxxeeeexeexxexxxxxeexeexxexexexeeexexxeexeeexeeeexxxexexxexxxxxeexxxexexxxeeeeexexxexexexxexexeeeeexexxxxxxeeexeeeeexxxexeexexeeeexeexxxxxxxexxeeexexeeexxeeeeexxxexeexeexxxeexexxeexeexeeeeexeexxxeeeeeeeeeeeeeeexexexxxexeexxxeexeexexxeexexxexexxeexxeexexexxxeexxxxeeexexxxxexxeeexxxeeeexxexxxxeexxexeeexxeexxxxxxxxeexxeeexexexeexeeeexxexxxeexeeexxxeexxxexxexeeeeexexeeeexeeexexxexxexxxxeexeexeeexexxeeeexeeexexxxeexxexexeexexeexxxeexexeeeexxeexeexxxeexxexexxxexxxeexeeexeexxeeeeeeexeexxexeeexeexxeexexxeexeeeexexxexeeeexxxxxeeeeeexexeeexxexxexexxeeexxxexexxxxxxxxexxxexxxxxxexxxeeeexeexeexxxeexxeexeeexxeeeexxxexxxxeexxexexeexxxeexxxxeexeeeexxeexxxexxxxeeexxeexeeeexxexexxexxxxxeeexeeeexexexxxeexxexexeexxexeexeeeeeexexxxxeeeeexxxexeeexxxxexexxxxxxexexxexeexexxeexxxxeeeeexexxeeexxeeeexxexeexxxexxeexeeeexxexxexxxxexxxeeexxxxxxeexxeexxexxexxexeeeexeexxeeexexxxxxeeexexeeeexexeexxexexxxexexxexeeeeeeexxeexxexexxeexxeexeexexexxeeexeeeeexexexexxxexxeexeeexexxxeeeexeexexxxxxeexexxexxeeeexxxexxxxxeexeeexeeexxeeexxxxexexxeexxxxxxxexexexxxxeexeeeeexxxexxxxexeeeeexxeexxexxxeeeexeexexxexxxxexxeeeeeexxxexeeexexeeexeeeeexeexxxxeexexxxeexeeexexxexexxxxxxxeeexxxexxxexxexeeeexxxexxxxeeexeeeexxeeeeeeeeexeexeexexeexxexeexexexxxxexexexxexexxexeexeeeeexexxxxxeeexxxxxxxxexexxexxxxeeeexexexeexxxxxxexxeexeeexxxeexxxeexxxxeexexxexxxexeeexxxxeexexeexeexxeeeexxexxxeexxexexexxxxeeeeexeeexxxxxxeeeexeexxxexeexxxexxxxexxxxxxxeeexxexexxexexexxeexexxexexexexxeexxexxxexexeeeexeeexxxeeeexxexxxxexxxxxxexeexexeexxeexexxexeexexeexeeeexeexxeexeeeeeeeexxexxeeeeeeeeeeeexxeexxxxxxeexxexxxxeexxxexxeexxxxxxxxexeexeeeexxexexxeeeexexexxxeexexxxexxeexxeeeeeeexeeexxxeexeeeeexxxxexexxxxexxxexxeeexeexexeexeexxexexxexxexexeeexeexxexeeexexxexxxxeeexxxexeeexexeeeeeexeexxexeexxeeexxxxeexexxexexxxeexexeexexxeeeexeeeeeexexeeexxxexexxxexexexeexxxeexxeexxxxxxeeeexexeeeeeexexexxeexeexeeeeexexeexeexxexxxeeexeexeexxxexxeeeexexexxxxxexxxeeeexeeeeexxxxxexxxxexxxxeeeeexeeeeeeexexxxeeexxxxxxexeexxxexxxeeexexexxxexeexexeeexexxexeexxxexeeeeeexeexxxexeeeeexxeexxeexeexexxxxexexexexexxxexxexxxxxxeeeeexeeeeeeeexxxeexexeexxeexeeeexxexxexxxexxexxexxxeeexeexxxexeeexxxexexeeeeexexxexxexxxexxxeeeexxxeexexxeexeeexexeeeeeexxexeexxxxeexxeexxexeexxeexxxxexxxeeexeexexxxxeexeexexexeeeexexxxxxxxxexxeexeeexxeexxeexxeeeeexxexxeeexxexeexxxeexxxeeeexexexeexeeeexexexxexeeexxxeeexexeexexexxxxxxexxexeeeexxxexxxxxeexxeeeeeeeeexeexxxeeexeexxxxexxexeeexexexexeeexexeexxxeexxeexxxxxexxeeexexxeeeexeeeexeeexexexxeexeeexxxxexxexxeexexxeeeeeeeexexxxeexexeexxxeexexeexeexxeexxxxxeexeexeeeexeexxeexeeeexeexxxxxxexeexeeexexxeexexxxxxeeexxexexexxxexeeeexeeexxeexexxexexeexexxeexxeexxeeexxexeeexxxexxexeeeeexxxexxxeexxexxxeexeeeeexxxxexeeexxxxxxxexeeeexeeexxxxexxxexexeeeexexeeexexxxxxexexxxxxexexxxeexexxexxexeeeexxxeeexeexxxxeexeexeexxeeexxeexeeexxeeeexxeexxeexxxxeeexxxxexexexeeexxxxeeeeexexeeeexexxxxxexexexexeeeexxeeexeeexxxeeeeeexxeexxeexexxxxxxxxeeeeexxxxxexxexxxeeexeeeeeexxxxxxeexexxexxxxeexeexxxeeeexeeexxeeexexexxeexexeeexexexxxeeeeeeeeexxxxxeexeexxxexeeexexexxeeeexxeeeexxexxexxxexeeeexeeeeexeeexxexeexeeexeexeeeeexxxxeeeexxxexxeeeeexxexexxexeexxeexexeeexxeeeexxexexexxeexxxxeeeeexxexexexxxxeexxeexxxexeexxxeexxeexxexxeexeexeexxxeexexeeexexxexxxexxxeexxxexeeexexexxxeeexexxeexeexeexxexxexexeexxeeexxeeeeexxeexexeexxxxeexeexeexeeeeexxxeeexxxexxexeexxeexxxexxexxxexexexxeeexexeexexxeexexexxxexxxxexexxxxexeeexexexxxxexeeeexeeexxxexexxexxeexexxxexeexeeeexeexeeexxxeexeexeexxexxeeeexxxeeeexxeeexxeexeeexexexxeeexeeexxxeexxxexexxexxxxxxxeexexxxeexexxxexeexxeeeeexxeexeexexeexxxexexxexxxexxexxexexxexxxxxxeeeexxxxeeeexxxxexeexxxexxxeeexeeeexxxxxexxxexxeexxxeeexxeexeeeeeeeexexexexxxxxxxxeexxeexxxeexxexexeeeexxxxeexxexxxexxexxeeeexxxeexeexxxexxexeeexexeeeexeexeeeeexxeexxeeeexeexexxxxeeeeeeexxxxeeeexeexxeeeexeexxeexxxeeexexxeeeeexxxexxeexxeexexexexxxxxxexexxexexxexexxexeeexeexxxeexexexxxexxxeeexxexxxeeexeexxxeexeeeeeeeexeeeexexxeeexxxxxeeexxxexxxexeeexxxxxxeexeexexxexexexexexxeexeeeeexexeexexxeexxexeeeeexeexexexeeeeexeeexeexeeexxexeexexeexxeeeexxeeexeexeeeeexxxxeexexeeeeexeexxeeeeexxeexxeeeexxxexxxexxxeexexxeeeexxeexxxxxxxxexxexexxxeeexxeeexxexxxexeexxeexexxexxxeexxeexexeeeexxeeeexeeeeeexexxeeeexeexexxexxxxxeeexeeeexxexexxeexxexexxxxeeeeeeexxexxxexexxxxexexxexxxxxexeexxxeexxxxxxxeeexxxxexexxxeexeeeeeeeexxexxxxeexxxeeexxxxxexeexxeeexxxexexxxeexeexexexexexexexeeeeeexeeeexxexxeeexxxxexexexeeeeexxeexxeeeeexxxeexexeeeeeeexxxxxeeeeexeexexxexexexxexxxxeexxeexxexxxexeexxeexxeeeeeexxxexexxxxxxxeeexeexeexxexexxeeeeexexeeexexexeexxxeeexxxexexxxxeexxeeeexxexeeexeeeexexxxeeeeeexxxxexxxeexexxeexeexxxeexxxxxeexexxxexxxexxeeexeeexxeexexexeeexxeeeexeeexxeexxxxeexxxeeeeeexxxxexeexxxxexxxxxxxexexxeexxxxxxeexeexeeeeexxxexexxxexxxexexexexexexxxxeeexxexeeexxeeeeeexxeeeexeeexexxeexxxxexeexeexxexeexexeeeexxeexeeeexxxexxeexexexeexxxxeexxxexeexexexexxxxxxeexeexxxxxxeexxxxeeexexexxxxexeeeexeexeeexeeexexxexxexexeeeeeexxxxeeexxexxexxexexxxxeexexxxexeexxxxeexexexxeeexexxeeexxxexeeexexxxexexexxeexeexxxxeexxxxxxxeeexxeexeeeeeexexxeexeexexxxxxxexxxexxexxxxeeeexexexexxxeexxxxxeexxeeexxeeeeeexxexxxeeexxxxxxxxexexeexexexexxexxexeeexxxxeeeexexeexxeeexexxexxxexexxeeexeeexeexxexxexeeeeexxxexexxxeeeeeeexexxxeeeeexexxeexexxexeeexxeexxexexeexexxxeeeexxeexeeeexexexeexeeeexeeeeexeeexexeeexxexexxxxxexxeeexeexexxxxxxxexexxeexexxxeexxeeeexexxexxxexeexeeexexxeeexxxxexeeexxxeeeeexxxeeexxxxexxxexeeeeexxxxeeeexxxxexeexexexexxexxexexexeeexexxxexeexexxxxxxxeexexexxxeexxxexxexxeexeexxexeeexxxeeexeeeexeexexxexexexxeeexxxxeexxxexxeexxxxxxeexeexexeeeeexeeeexxexeeexxxxxxxeexexexexxxexexexeeeeeeeeexxxxexxeexxxxeeeeeeeeexeeexxxexxxxexexeeexeexeexexexeexexxxexexeeeexxxxxeexxexeexexxeeeexexeexeexxxeexxxxxexexeexxxeexexexexeeeeeeexxexexeexxeeexexxeexeeexeexxexexexxxxeeexexxeeeeexxxeeeeeeexeeexxxxxxxeeeeeexeeeeeeexeexexxxxeexxxeeeeeeexexexexxxeexeeexxxxxeexxxeeeeexxxeexxeexeeexxeeeexexeexxeexxexeexeeeexeeeeexexeeexeexxxxeexxeexeeeexeexeeeeexeexxexeeeeexxeeexeeexexxxxxexxxxxxxxexxxxxxxxexxeeexeexeeeexeeeexxxxxeeexeeeeeeexeeexxxeeexxxxxeeexxeeeexexeexxxxeexeeexxxxeexexeeexeeexxexexxxexexxexeeeeexeeexexxeeexxxexexexeexexeexxexexeeeexxexexeexexxxxxxeexxeexexexxeexxexxeexeeexxexexxxxexeeeexexexxxeexxeeexxxxexeeeeeeeexeeexeexxxexexxexexeeexexexexeexxeeeeexxeexxxexeexxxeeeeeeexxxeeexeeeeeexeexxxxexxexxxxxxexexxxxeeexxxexxxexxeeexxeexxxxexxexexxxxxeeeeeexeexeexexxeexxeexxxxeexxeexexexexeexexeeeexexxeeexxexexxexexeexexexeexxexexxexxxeexeexxeexexeexxxeexeexxexeexeexxexxexeeexexexxxexeeeexexxxxexxexxexxxxxexeeeexexeeexexxexexxexxxexexxeexxeeexexeeexexxeeeeexexeeeeexxxeexxxxxxxexexxxxxeeeeexxeexxeeexxxeexexexxxexxeexexexexxxxxxeexxxexxexxeexxxeexxxxeexxxexexxxxexxeeeexxxxxxeeeeexexeexeeexexeeexxeeexexxxeexxxeeexxxxeeeexxxxxxeeexeeeexeexxxxexeexeexxxxxxeexxxxexeeexexxeeeeexxxxxeeeeexxeexxeexeexxeeexxeexeeexxxxeeexxeeexexxeexxxexxeeeeexeexexxexexeexexxxxxxexeexxeexexexexxxeexxxeeeeeexxeexexeexeeeexxeeeexeexxxxeeexxxxexeexeexeexxxexexxxxeeexxeexeexxexexxeexexeexxxeexeexexxexxexeeeeeeeexeexexxexexxxxxexeeeexexexeeeeexeexexxeexeeexxxxeexexexxeeexexxxxxexexexexxexeexeexxexxxexxexxxexexxexexexxeeeexxeexeexxxxexeexxxxxexeeexeeexexxxeeeeexeeeeexxeexexeeexeexexeexxxeexeeexxxeeexexxexeexxexexexxeeexeexexexxxexexxxexxeeeexxxxxxxeeexexeexeexexeexeeeexexexxeexeexxexeexxxeeeexeexxxxeeexxxxxxxexxexeexexexexxxxxxxxeexxxexxexxxxeexeexxexxxxeexxeeexxxeexeexxexxexxxxeexxeeexeexxexxxxexxxxxxexxexxxxeexxxeeexxeeexxxxxxxeexeexeexexxeexeeeeexxexeexxxeexxxxxxexxexxexeexxxeeeexxxeexexxxxeeeexeeeeexeexxxxxeeeexxxeeeeexeeexeexxxxxxexxexeeeeeexexxxeexeeexeexeeexexexeexxxxexxxeeeexexxxexexeeeeexexeeeexeexxxexxeeeexexxeexeexxeeexeexeeexxexxxexxexxeeeeeeeexxxexxxexxeeeexeexxxxexexxeexxexexxeexxxeeeeexxeexxxxeeexxeeexxeeeexxxxexexeexexxexeexexeexexeexxexxxeexeexxexeexexexexeeexxeexeexeexxeeeeeeexxexxxxxxxexexexeexxeexxexeeexxxxxxexeexexxeexxxxxxxeeexxexeexeexexeexeeexxxxexxxxxxeeeexxxexeexeexxeexexxeeeeexexxxxexexxexeexexeeeeexexeeexxeexeexexxexxeexexeexeeexeeexxeexxxxexxexexexxxexeeexxexxeeeeeeeexeexeexeeeexeeexeeexexxxxxxexxeeexeexxxexexexeeexexxeeeexeexexeexeexexxxeeexxeexexexxeeexxxxeeeeeeexeeexxxeexexxeeeexxxxexxeeexxxexeeeexxxxxxexexxxxxexxeexeexxxxeeeeexxxexxxxeexeeeexxeeexxexeexxxxxeeexxxeeeeexexxeexeeexexxexxeexexexxeexxxxeeexxxeeeexexexxxexeexxxexexxeexxeeexeexexeeexexxeeexeeexeexxxexexeexeeeeeexexexxxxeexexxxexeexxxexxxxexxxexeexexxxeexxeexeexeexexexexxeeexeeeeexexxxxxexexexeeeexxexxeexexexeexeexeexxexexeexexexexexxeeexexxeexeexeexexexeexxeexeexeeeeexeeeexeexeeeeeeeeeeeeeexexxxexeexxeeexeeeexxxxxxxxexexxeexxeeeexeexeexexxeexeexxxexexxexexxxexxexxxxxxeeeexexxeexxeexxxexxxxxexxeexxexexeexexeeeeexexeexeeexxxeeeexxxeexexxeeeexeeeeexexxxxxexxexxxxxexxeexeeeexxeeeexeeeeexxxxexxexeeeexxxxxexxeeexxxexexxexxeexexeexxxeexxxeexxeexeeexeexxeeexeeexxexxxeeeexxexxeeeexxeexeexexxxeexeeeexxexeexxexexeeeeexxeexexexeeeexxeexexxexxexxexxxexxxxexxxxxxxxexeexeexxxxxxxeexexexxeexexxxexxexeexeexeeeexxxeexxxxeeeeexexxeexxxexeeeeeeeeeeeeeeexeexeexxexxxxeeeeeeeeeexexxeeeeeexexeexeexeexxexeeexexxxxexexexxxxxxxeexxxeeeexxxxxexexeexexxexxeeexxxeexeexxxxexeexeeeexxeeeexxxxxxeexeexexeexeeexxxeexxxxxxxxexxeexxxeexeexeexexexexxexxxeeexexeexxxeeexxeeeexexexexxexxeeexexxxxeeeexeeexeexxexexxexxxexeeexexexxeeexeexeexexxxeexxxxexeeeeeeexexxeeexeexeeeexeeeeexxeexeeeexxxexxxxxeeexxxxeeexxeeexxxxxxeexexxxeeexxxxexexxeeexxexexxxxeeexxxeeexxxexxeexxxxxxeeeexeexxxxeexxxeeeexeeeexxeexeeexexeexeeeeeexexxxxexexexxxeexeeexxxxexeeexxxxxeexxxxexxexxxexeeexexxeexxeeeexeeexxxexxexxeeeeeexxxxxxeeeeexeexxexxexxxeexxxxexeexexxexeeeexxxxxxxxeeexxxxexexexxxxexxxeexeexexeeeexexxxxexxxxxeeexxeeexxxeexxxxexxexxexxxexeeexexxeeeeeexxxexeexeexxxxxxeexxeeexeeexxeeeeexexeeexexxeeeeeeexexexeexxexxxxxexxxxxxxxexexxxexxexeeexxeexexxexxxexexxxxxxeexxexeeeeeexeeexxxeeeeeeexxxxexxxxexexeexexeexxeeeeeexxeexeexxexeexxxexxexxexexeeeexxexxeexeeeexexexexeexxxxxeeexxexexxeexexexxxeexxxxxxxexxexeeeexxexexxexxexexexxxxxxexexexxexeeeexxexexeeexxexexeexxexxeeexexxxxxexxexxeeexeexexxexxexxxxexxexxeexxxexxeexeexeeeexxxeexeeeeeexxexeeexexeeeeexeexxxexeexxeexxxexeeexexeeexxxeexxexexexeeexeeexeeeeeeeeeexexexexxxxxexexxeexxexxxeeexexxxexeeeexeexeexxeeexexexeexeexeexexeexxxxeexeeexexxexeexexexxxxeeexexxexexeexeeeeexeeeeexxxxexeeexexxexeexeexeeexeeeexxxxxeexxxexxexeexxxxxeeeeexexexxeexxeeeeeexxeexxxexxexexxxeeeeeexeexexexeexexeeexeexxexeexxxexexexeeexeeexxeexxxeeeeeeexxeeeeeeeexxxexexeexxxexeeeexxexxexexexxeexeexxexexeeexxexeeexxxxxxeeexeeeexxeexxxxxexxxexxeexxxxxeeexeeeexxxxeexexexxxeeexxxxexxxeexeexexxxeexxxxxxxxxeeexexexxxxeexxexxxxxeexeeexxexxxxeexexxxeexxeexxeeexxeeexexxexexeexxeeeexxxeexxexeeexeeeeeexxeeexexxxxexeeeexxeeexexeeeexexexxxexxxxeeeeexxxexxxxxeexxeexxeexexeeeexxexeexxxxexexxexxeexexexeeeeexexeexeeeexxexxxexxexxexeeeexeeexxeeeeeeeexxxexeeexeeexxxeeexexxeexexxeexeexexxexxxeexeexexexeeeexeeexexxxxxxxxxexxeexeeeexeexxexxexxexeexexxexeeeexexeeexexxexexxexeeexxexexxexxexeexexeeeeexexexeexeexexxxxexxxxexxxxxxexxxeexxxeexexeexeexxexxxxeexxeexeeeexxeeexxxxeeeeeexxxxexexeexexxeexxxxxxxxexxeexexxxxexxeexxxexeeexexxeexexxxeexeexeexexeeexexxeeeexexxxxxeeexxeexxeeexxeeeeexeeeeeexxxxxeeexxxxxeexxxxexexeexeexxxxeeeeexexeeeexexxxxxxeexexxxeeeexexeexeexeexeeeeeexxexxexxxxxxxxxxexxeeeexxxeexexexexeeexeeeeexxxxxxxeexexxeexxxxexexexxexxexeexexeeexeeeexeexexexexxxeexxeexeexeeexxxxxeexexxxxexxexeexxxxeeexxxeexeeeexxexxxeeeeeexeeeeexxeexxexeeeexeeexxeeeeexxeeeeeexxxexeeexxexxeexxeeexexxexxxxeeexxexexxeexexexeexxxxeeeeexeeexexexexxexeeeeexxexeexxxeexexexeexxeexexxeeeexeexxxeexxexeeexxxxxeeexxxexeeexexexexxeexeexeeeeexexxxexxexexexxeeexxxxxeexeexexxxeexxxxxexeexxexexeeexxxeeeexeexeexeexexxxxxexeexeexxeeexexeexeeeexexxexxeexxxeeexxeexexexexeeeexexxxxxxexxeeeeeeeexeeexxxxxxeeeexxxeexexeeeexeeeeeexexeeeexxexxxeeeeeexxexeeexxxexexxxxeeeexxxexxeeexeeexxxeexexexeexexxxexxxeexexexeexexxexxexxxeeeexxxeexeeeexexxxeexeeexxxeexeexxexeexexxxxxxeexexxxxeeeeexxexxeexexexxeexxxeeexxxexexxxxexxeexxxeeexxeexexexeexxxxxeeexxxxxxxxexxeeexxxxexxexexeeeeexxxxeexexeeexxexxeeeexxxeeeexxxxexxexeeexexexxexeeexxeexxxxexxexexexxxxexxxexxexxexxxxexeeexxxexexexeeeeeeexxxxxeexxeeexexxxexxxexxeexxexeeeexexxxxexexxexxeeexxexexexeeexxxeexxxxxxexxeexxxexxexeeexxexxxeexxeeeeexexeeexxxeeexexexexeeexxxxexxexxeexxxxxxeexxexxxxxxexeexxexxexxeeeexxexeexexxxeexeexxeeexexxexexeexeexexeeexxeeexxexeexexexeeeexexxeeexexxeexeexexeeexexeexeexxxxexeeeexxeeexxeeexxeeexxxxxxeexxexexxeexeexexxxxxxexxxxeeeeexeexxeexxexxxeeeeeeeeeexeexxxxxxxexeeeeeeexxxexexxxeeeexxxxeeeexeeeeeeexxxexeeexeeeexxxxexxeexxxeexxxeexeeeeexxexxxexxxexxeeexxxxxxxxexeexxxeexxxxxxeeeexxxeexxxxexeexeeeeeexxxexxxxeexxxeeexexxxxxeexxeeexxxxxexxeexeexxxxeeexexexexxxeeexxeeeexxeeeeeeeexxxxexeeexeeexxeexxexeeexxxeeeexxeeexxxxxxxxeeeeexxeexxxexexeexexxxxeeexeexxxxxxexexxxeexxeeeeeexxxxxexexxxxxeeexeexxeeexxexxeeeexxexeeexexeeeexexeeexxxxxexexeexxxxxeexxexexeeexexxexxxxeexxeexexexxxeexeexeeeeeexxxexexxxeexeexexxxeexeexexeeexxeexeeexeexexexxeeeexxxeeeexxxexxxeexexeexxxxxexxxxxeexxxxxxexexxxxxxxexxxexxexxxeeeexxeeexxxxxxeexeeexxxexexxxxeeexxexexexeeeeeeeeexeeeeeeexxxeeeexxeexeeeeexxxxeexexeeeeexeexeeeexexxxexexexexeeexxxeexxxexeeeexexexeexxxeexexexxexxeeeexeexxxxexxxexeeeeeeeeexexexeexxexxexexxxxeeexxexxexeeexxxxxxxeeeexxexeeeexxxeeeexxexeexexexxexexxxxxeeexeexeexxexexexeeexxexxeexexeeexxxxxxxxeeexeeeexeeexxexxexxeexexxxxxxxxeeexxexxxxexeeeexxxexxxeexxxxxxeexeeeexeeeeeeeeexxxeeexxxxexxexxexxxxexeeexxxxexeeeexxxexeeexexxexxeeexexxexxxexeexexxexexxxexxexxexexeexxxxexxexxexxeeeeexexxeeeeexeexexxexxeexexexxexxexexeexexxxxexexxeexeexexxxexxxxxeeexeeeeexxxexexeeeexexxxxeexexxeeexeexexxxxexxexexxxexexxxeeexeeeexeeeexeeeexexxeexeexxeexxxeexexxxxexexeeeexeeexeeeexxxexxeexxxxxxeeexxxexexeeeexeeeexexxeeeeeeeeexxexxexxxeeexxxxexeeexxexxxexexxexxeexxxxxeeeexeeexxxeeexeeeexeeeexxxxexxexeeeexxxeexexxxxeeexeeeeexexexexeexeexeeeeeeexexexxxexexeexxxeexxxeexxxexeeeeexeeexxexexxexxxxxeeexeexeexexeexeexxeeexexeeeeeeeeexexexeeeeexeexxeeeeeexxexeexeexexeexxeeexxeeeexxexxxeeexexxxxexeeexxeexxxexeeeeeeexexexxexxexxeeeeeexxeexeexeexxexexexexeeeexexxxeeeexxxeeeeeeexexexexxxxxeeeexexxexeexexeexxxxxxeexxxeexxexxxexeeeeexeexxexxexxeeexxxexxeexxxeexxexexeexxxexxxexxxxxeeexexexxeeeexeeeeexexeeexxexxeexexxeexeexexeeeeexxexeexxeeeeeeeexxeexeeexexexexxxxxxxxxxexexexxxeexxeeexeexeeeexeeexxexxxeeexxeexeeeeeeexxxeeexexxxxxxexxeeexeeeexxxxeeeeeexexxxxxxxeeeeeexexexeexxeeexxexxeeexeeeexxxxeeeeexexxxexeexexeeexexxxeeeexxexexxexexxxxxeeexxeexexexxexxxexxxeeeeexeeexeexxxeeeeeeexxxxxexxxeexexxeexeeeeeeeexeeexeexxeeeeexexexeexxexexxeeexeeeeeexxexxxxexeexexeeeeeeexxexexxeeeeeeeeexxxxexxexeeeexeexxexeeexxexexxxexxxexxxxxexxexxxexeexexxeeeeexxeexexxxexxexxeeexxxxxxxeexexeeexexeeeeeeexeexxxxxxeeexeeeexxexxxeeeexexxexxeexxeexxxxeeexeeexxxexxxexxxexeexeexexeeexeeexexexxeexeeeexexxxxexeexxexexxxexeeeeexxeeexexxxxxxxexxxxxxxxeexxxexeeeeeexexxeeeexxexeeeeexexeeexexxxxexexxxxeeeexxxxeeexeeexxxeeeexexxxeexeexxxexxxxexexxexxxexxexxexxxxexxxxxeexxxeeeexxxexxeexxxxexexexxxexeexexexeeexeeexeeeeeeexxeexexeeexxxxeeexxxxxeeeeeeexeeeexxxxxeexexeexxxxxeeexxxxeeeexxexeexeeeeeexeeeexexxxexeeexexexxxexxeexeexxexeeeeexeeexexxeexeeeexexxeexeexexeexexeexeexxxxxeexexxeexeeexeexxeexxxxexeeexxeexeeeexeeeexxeeeexeeexxeexxxxxxexxxxeexexxxxexexxexxeexxexeeexxexeexxexxxeeeexxexxexxxexxxxxeeeeeexxxeexexxeexxxxexexeeeeeexexxeeeexeexexxxxexexxxxexeeexexxeeexxxexexexexeeexxexexxeexxxxxxxxxexxeexeexexexexxeeexxeeexexxxxxxxeeexxxxxeeeexexxxexxxeeeeeeeexxexxeexxxeeexeexxxeexxexexeeexexxeexxxxexxexeeeexexxeeeeexxexexxxeeexxeeexxxeexexxxexxxxxexxexxeeexexxxeeexeexxxeexxeexeeeexxxxxeexxexexxxeexxxxxexeexxxxeeexxxexxexexxeeeeexexeexxxxxexeexxxxxxxeeexeeeexxexeeeexexxeexexxexxexexxeexeexxxexxxxxexxeeeexexexexxexeeeeexxxxxxxeexeexexeexxxeexexeexxxeexxxxeexxxxxxexxexeexeeeexxeexxxxxeeexxxxxeexxeexeeeeexxxexeexxxexeexxeexexxxexxexxxxxxxxxexexexxxxxeeeexeexxxxexxeeeeeexexxexeeeexexexxxxxexxeeexxexxexexxexexexxeexxxeexeeeeeeexxexeexxxexexexxeeeexxeeeexeexeexexxexxxeexxeeexxxxeeeeexexexxeexeexxxexxeeexxexxeexxeexeeexxeeeexexxexexeexxxeexeexexeexxxxexxxxxxeexxeexexxexxxxxexxeexxeexeeexexxeeeeeexxxeeeeeexxexexeexeeexexxexeeeexxxxxexexxexeexxexxexxeeexeeeeexeeeexxexeeexexxexxxxxxeeeexeexxeexexxeeeeeeeexexxeexexeeexxxexeeexxeexeeeeeeeexexexeexexeexxxexeeexxeeexeeexxeexxxxexeeeexexxxxxeeexxexxexxxexeexeexeexxexexexexxeexeeeexxxexxeeexeexxeexexeeeeexxexeexeeeeeeeeexxexxxxeexxxxexxxxexxeexxxeeexeeeexxeeexexeexexxeeeexxxeexxeeexxeexxeeexxxexxeeeexxxxexxexxeexeexxexxeeexeexxxxexxeeexxeeexxxxxxxxxxxeeexxexeeeexexxeeeeexxexxeeeexxexexxxexxxxxeexxxeeeexexexexexeexexeeexxeexxeexxeexexexxxexxxeexexexeeeexexexxxxeeeeexeexxxxeeeeeexxxexexexxexxxxxxxxexexxexxxeexeexxeeeeeexeexexxxeexxeexeeexxexxexexexxeeexxexxeexexexxexeeeeeexexeeeexxxexxxeexexexeexeexeexeeeeeexeexeeexeexexxeexxxeeexexexxeeeeeeeexexxeexxexexexexexexeexexxxxexxxeexeexxeeeexeexexxexxeexeexexexxexexxxxeexxexxxxxxeexeeexxexexeexexexeexxexxeexxexeeeexexeeeexxeeexxeeexxeexeexxxexxexxexeexeexeexexxxxxexeeeeexxxxxxexexeexxeeeeeexxeeexxxexeeexeexxxxxxexxeeexxxexexeexexeeexexxexeeeexeeeexeeeeexeexxxexxexexxxxxxeexexxexxexeexeeexeexxxxxeexxxeeexexeexxexexeexxexexexeeeeeexxxeexxxxeexxeexexexeexxxexxeexxxxexeexeexxxxxxxxexexexexxxexexexxexxexeeexexexexexxexxxeexexeeeeexeeexeeeexeeeeeeexxeeeexeexxexxxxexeeeeeeexeexeexeeeexxxxexexxxeexexxxexxxxexexexexxxxxxxxexeeeeeeeeexxexxeeeexxxexxexexexxexeeexxxxxxeeeexxxxxeexxxexxexeeeexeeexeeeexxxxexxxxxxxxexxeeexxeeeeexeexexexexxexxxexeeexeexxxxeexxeeexxexexexxexxeeexexxxeexxexeeexexxxexexeexxxexeexxxeeeexxeeeexeexxxxxeeexxxexeeeexeexexxxxexeexeeeeeexxexxxxeeexeeexxexxxxeeeexxxxxxxxeeeeeexxxxeexexxxeeexxxexeexeeeexxexexxxeexeeexeexxxxxeeeeexxxxxeeeexexxxxxeexexxeeexexexexexxxxeeeeeexeeeexxxexexxexeexxxxeexeeexxxxexxeexxxxxxxxxexexxexexexeexxexxxexeexexeexexxeexxxxxeexexexxxxxxxxeeexeeexexxexexeexxexxxxexeexeeeeeexexxxexeeeexxeeexeeexxeeexxxexxexeexeeeexeeexxexxxxxeeeexeexeeexxexxxexxexxexxxxxeeexexeexeeexxxxexeexeeexxxeeeeeeeexexeeeexeeeexxxeeexexexeeeeeexeeeeeeexexxeexeexxexxexexexxexxxeeeeexxxeeeeexxxxxeexexxxeeeexeexeexeeeexexeeeeeeeeexexeeexxeeeexexxeeexxxxeeeeexeeeeeexxexxexxxexxexxxxxxexxeeeexxeexxeeexexexeeeeeexexeeexxxxexeexxeeeexxeeexxxexxxxxexexxexeexexxexxexexexxxxxxxxexexxexeeeexxxxeeeeexxexxxexxxexxeexxxeexxxexexxxeexxxxeeexxxxexxxeeexxxxxexxxxxxeexeeexeeexexeexeeeeeeexexeeexxxexeeexeexxxeexxexeexxxeeexexeeeexxexxxxxexexxxeexxxexxxeeeeeeexexexxxexexxxxeexxxexxexxxxeexexxxexxeeexxxxeexxxexxexexeexxexexeexexexxxeexeeexexxexxeeexexxxxexexexeexexeeeeeeexxeexeexxxeexeeeexexexexxxxeeeexeeeexxxxxxxxxxexxxeeexxexxeexeexexeeeeexxeeeeeexexexxxxxxexexxxexxxeexeexexexexxexeeexeeexxxeexxxexexeeeeexeeexxxexexeeeeexeexeeeeexxexxxxxexeexexexexeexexexexexexeeeeeexxexxeexeexeeeeexxxxexeeexxeeeexeexxxxxexxeexxxexexxxeeexeeeexxxxxexexeexxeeeexeexxxxeeeeeeexexxxexxxxeexxxxexeeeexeeexexxxxexxxexxexxxexxexeeeexxeeexxeexxexeexeeexeexeeexeeexeexexxexeeeexeeeeeeeeeexxexexxexxxexxeeexexeeeexexeexexeexeexxexexxxexexeeexeeeeexexxxxexexexeexxexeexxxeexeeexexexxxxexeeeexeeexexeexxxxexeeexxexxexeexeeexxxxeexeeexeexxxxexexexexxeeeeeexxxexexxexxxexexxexexeeexexeeeexeexexxexxxexxxexxxexexexexxxeeexxxxxexxeeeeeeexexeexexexeexxexxexexxeeeexxxexexxeexxxexxexxeeeexxxexexeeexxexxxexxxxexxxxxxexxxexxxxeexxxxexxxxxexxxxxexxxexeeeexxeexxxxxxexxeexxxeexexeexxxxeeexxexxxeexxeexexxxxexxexxxxexeeeeeexeexexxxexxeexxexexeeexexxeeeexexxxxxxeexxeexexxeexeeeexxeexxeexexxeeexxeexxxexeexexeeeexxexxxeeexxexeeexxxexxexxxxexexxxexeeexexxxxxexeeeexxeexxxexxexxxxxxxexxexxxexeexxeexeeexexeeeexeeexxxxxxexeexeexxexexxexxxexxexxexexxeeeeeexeeexxexexexexxexeexeexexxxeeexexxeexxxxxeexxxxeexxexeeexxexexeeeexxexeexeeeeexeexxxxxexxexeeeeexeeexexeexxxxeexeeeexexxexexxeexeexxexexeexexexexexxxxxexeeeeeeeeeexxeeeexeexeexxxxxeeexexeexxexxeexxxxxeexexexeexexexxxxeeeexexxxxxexxxxexexxxexexxxxeexexexexeeexxexeeeeeeeexxxxexexxexexexxeeexexxxeexeexxxxxeexeexxxxxexxexxxeeexxxxeeeeexxeeexxxexxexxexexxeexxeeexexexxeeeexxexxxeeexxeeeexeeexxxeeexexexxxxxxxexexxxxeeexxexeeexxexexxxeexxxxexeexeeexexeeexeexxeeexxxxxeeeexxexxeexexxxxexeeexxexeexxexxxxxxxeexeexeeeexxeeeexxexeeeexxxxeexxeexeeexexxxxxxeexeeeeeeeexxexxeexxxeexeeeexeexxxxeeexexexxeeexxexxxeeexeeeexeeexexexxeexxeeeexeeexexxxeexxeeexxexxxxexxexxxxexxexexeexxxxxxeeexeeeexxxxexeexexxeeeexxxxeeexxeexxxexxxexeexxexeexexxexxxxeeexxexxxexeeexxexxxxxxexxxexexxxxeexexxxexxexxxxexxeexxxexexexeeeeexexxxxxeexeeexxeexeeeexexxeeexexeeeexexxxxexexxexxeeeexxexxxxeeexxxxexexeeexeeeexxeexeexeeexxexxxeeexeexeexexexxxxxeeexeeeeexeexxxexeexxexeeeeexxxxexxeexexxxexeexxexxxxxeeeexxeeeexxexxeexeexxeexxexeeexxexxxxxexxeexxxeexexexxxxeexeeexxxxeeexxexxeexxexexexexexexxeexxxxexexexxexxexxeeexxexeeexxxxexxxexexxeexeexeexxxxxxxxxxeeeeexeexxeexxeexeeeeeeexxexxeexxxxxeeexeeeeeexexxexexxxeexxxxexxxeexxeexeeexxxeeexexeeeeeexxexeeeexxeexeeexxxeeeexeeexexexxeexeeexxxxxxxeexeexxxeexxxxxxeeexxexexexxxexxexeeexeexxxxxxeeeexexeeexexexxxexexeeexexxeexxexxexxxxexeexxxeexxxxxxexxeeeeeeeeeeeeeexxxxeeeeexeexxxexxxexeeexxxxeexxxeeexxxexxeexeexxxxeexxxexexeeexxeexeeeeeexexxxxxeexxeexxxeeeexexxxxxexeexxexxeexeeexeeexxeexxeeexxxxexxxxxeeeexexeexexexeexexexxxexxxexxexxxeexxexexxxexexxxeexexexxxeexeexeeeeeexxxxeexxxxeeeexexeeexeeexxexeeexexxxeeexexexxxxxeeexxxxeeexxxexxxxexxxeexxexxexexxxeexxxxxxeexxxxxxxxexexeexeexxxxeexxxexxxxxxeeexeexxxexxexxxxeeeeeexexxxexeeeeeeexeeeexexexxeeeexeeeeexeeeexxxexeeeeeexexexexexexeexeexexeexeexeexeeexxexxxeeexexxeeeexxxeeexexxexeeeeexexxxxxexexexeeeeeeeeeeexexexxxxexexexexeeeexxexeexxeexxxxxxxexeexeexxxexxexxexxxeexxeexxeeeexexxxexxxexeexexxeexexexeeexxexeeexeeeeexxxxexxxexexeeeexxeexxexeexxeeeeexxxxxxeeeeexexxexexxeexxxxxxxxxxxxxxxxeeeeeeexxxxxexeexxeeeeexxeeeexexxexxxxexeeexexeexexeexxxexexeexxxexeexeeexeexxxexeexexxexxxexeeeexexxexeexexxeexexxexxxxeeexexxeeeeexeexxxexxxeexexeexxeexxexexxexxexexexxeeeexxexxxxxxxxxxexeexxxexxxeeeexeeeeeexxxeexexeeexxeexeexxeexxeeexexexxeexxeeeeeexxxeeexeexexxxxxeeeexxeexexeexxxxxxexexexeexexexeeeexxxxxxeexxxexeeeexxxexexeeeexxeeeeeexxexeeexeexxexxexxxeeeexxxexeeexeeexxexexxeeeeexxxexxeexeeeexxeeeexexeexeeexeexxxxxexeeeeexxxxeexxeeexexeeeeexexxeexeexexxexeeeexxexexexexexxxxxxeexxxeexxxeeeeeeexxxeexexexxxxxexexxexxxxxeeexeexexxxeeexxxexxeeeexexexexeeeeexexxxexexxexxexxxeeexexeeeeexexxeeexxxexexexexexexxxeexexeeexxexxeeeeeeexexexxxexxxeexxexexxeexexxeexeexeeexexeeeeexexxeeexxxxeeeeexexxxexexxexeeeeexexxexeexxeeexxxexxxexxxxexxexxexxeeeeeeeexxexeexeexexxxexxexxeeexxxxxexeexexxxxxexxxxxeeexexexeeeeexeexeeeeexeeexexeeexxxxeexeexeeeeexxxxeexxeeeeeexxeexxexxxexxexexexxexxxexexxxexeexxexxxeeexexxeeeexeeexxeexexexxxxxxxeeeeexxxeeeeeeeexxxxexxeeexeexexexeexexeexexxxxxxxxeeeeexexeexeexeexxeexxeeexexxxxxexxexeexexxeexeexexexexexxxxxxexxeeexxeexexexxexexeeexxxxxxxxxxexexeeexexeeexeexxxeeexeeeexxxeexxxexxexxexxeeeexexxxeeexeexeeeeeexexeeexxxxxexxeexxexeeeexexxxxexxeeeeeeexeeexexexexxexexxeeexxxexeexexeeeexxexxexeeexxexexxeeexxexxexxeeeexxeexeexexeeeeeexxeexexexeexeexexeeeexxxexxxexeexxexeeexxexxxeexxxeeeeexeeexxxexxxeeeexexxeexeeexeeexxeeeexeeexxxexxxexxxeeeexxxeexeeexexexexeeeeeeexxxxexeeeeeeeeeexexxexxeexxexxxeexxxxxexxxxxxexxxexexxxxexexexeeeexxexeexxexxeeexeeeeeexeexexeeeeeeeexxexxexexeexeexexeeexxxxexxexeexxxexxeeexexxxxxxxxxeexexexxexexxxxeexeeeeexeexxeexxxxxexeeexxxxeeexeeexeeexexeeeeeeexeexeeeexeeexeexexexxxexeeeeeeexxxeexxxxxeexexxxxexexeexeexxxeeexeexeexeeeeeexeexxxxxxxexeeexexexxxexxxexxexeexeeexeexeeeeeeexeeeeeexxxeexxeeexeeexxeexeexxxxxeexexxexxeeexeexxeeexxxexeeexxxeeeeexxexexexeeeexxeeexeexxxxxxeexxxeexexxxeeeexeexxeexxxxeexeeexxexxeexeeeeexxexxeexxexxxxeeeeexexxeeexeexeexexxeexexxxeeexexxxxxexxxxexxxxexexxxxexeexxxexeeexxxexexeexxxeexexexxeeexxxeexxxxexeeexeexeexxxexxeexxeexexxeeexxxexexxxxxeexxeexxxexxeeeeexeexxxxxeeexxxxexxexxxxexeeexeexeexexxeexxexxxxeeeeeexeexeeeexxxexexxxeexexeeexxxxxeeexxexxxxxeexexxeeeexxxxxxeeeexxeeexxxeeeeexxexxxxxexexexxxxexexexexeexxexeeexxxeexexeexexeeexxeeeexeexexexxxxxexxeeeeexxeeeexeeeeeexexexexxxxxexxxxxexeeexxxxxxxeexxexeeeexexexxxxeeeeexexxxexeeeeeeexeeexxeexexxexxxexxexeeexexexxexxexeexexeexxexxeexxeeexxxxxeexxeexeeeeeexxeeeexxxexxxxxeexxxxxexxexxexxxxxxexexeexxexexeexxexxxxxxxeeeexxeexxxxeeeexxxxxxxxxxxxxeexxeexexexxexeexexeexxxxexxxexxeexxxxeexxxexexeexeeexxeexeexxxxeexxxxexeexexxeexxeeexeeeexexexxeeexxxexxxxeeexxeexeexxxexeeexxexexxeeeeeexxexxeeexeexeeexexxxexxxeexeexxeexexxxexxxxeexxexeexxeeexexxxexexexxxeeeeeexxexxxxexeeexexxexeeeexxxxeexxxxxxeexeeexeexeexeexexxxeeeeexxxexexexxexeeeexeeeeeeexxxexxxeeexeeeeexexxexeexexexxxexexexeeexeeeeexexxexeeeexexeeexxexxeexxxexeeeeexxxxxxxxxeeeexexexxxeeexeexeexxxexexeexxexxxxxxexxxexeexxeeexeeexxeeexeexeeeexeeeexxexexeexeeexexeeexxxexxxexxxxxexexxeeexexxeeeexexexxxxxeeexeexexxeexeexeexxxeeexxexexxeeexeeexxexexxxeexxexxxeeeeexexxeeexeexexxeexeeexeeexxxxxxxexxxxxeexeexeeexeeeexxeeexeeexeeeexeexexxxexxxxxeexxeeeexxexxeexexeexexeeexxexxexexxxexexexxeeexxeexexeexeeexexexxxxeeexexexxxexeeexeexxeexxxexexxxeexxxxexxxeexxexeeexxxxeexeexeeeexxxexexxxxxexexeeeexxxexxeexxxexeexxexxxxexxeeeeeeexeeexxxxexxxeexxxexxexeeeeexeeeeeexexeexexeeexxxeexxxeeexxxxxxexxxexxexexeeexxxxexexexexexeeeexxexexxeeexeeexxeexxxexexxeexexxeexeeeexeeexxexexxxexxxeexexxeexexxxexeeeexexeeexeeexxxxeeeexxxexxeeexxeeexeeeexeexxeexxeexxxxxexeeexexeexexxxxexeexeeexxxexxexxxexexeexxeexxeeeeexeeexexexxxxxxxexexxexexexexexxexxeexexxexeeeeexeeexeexxxxexexxexxexxxxxxexexxexxexexxeexeeexxxxxexeexexxeeeeeeeexxxxeeeexxeeexexxexeeexxxeexexxeexeeexexexxeexxeexeeexxxxeeexexexexxeexxxexxxexxxxxeeeeeeexexeeexexeeeeexxexxxxexexeeexeeeeeeeeexxxeexxexxxxeexexexxeeexeexxeeexxexexxeexeeeexxxxeeexexxexexxxxxxxxexexxxeeexxxxxxexeexeeeeeeexeexeeeexxeexeexexeexxxeeexxexxxeeexxxexxexxxeexxexeeeexeeexeexexxxxeexxxxexxexexeeexeeexexxeeeexxxxxxxxxxxeexxeexxxxxexxxxxxxexexeexexeeexxxexxexxxxxexexexexxxexexxexexeexexeeeexxxexexeexxexeeeeexxexeeeexeeeeexxxxxexexeeeeexxexeexeeexeeexxxexxxeexexxxexxxxexeeeeexxxeeeexxeeeexxxexeeeeeeexxexexxxeexeeexeexxxxxeexxeexexxxxeexxxexxxeexeexeexxxxexeeexxxxxexeexxeexexxxexeeeexxexxxexxxxexxxxexxxeexeexxxxxxeexxeexexxexexxexxxeeeexxxexxexxeexxxxxexxexexxxexxxxeeeeeeexexxexexeexxexxxxexeexeeeeeexexeeeeexxxxeeeeeeeexxeexexxexxexeexeeexeeeexeexxxxxexxeeexxeeexxeeexxxexexxeexxxexxxeeexxexexxxxexexxexeexeeexxeeeexexeeeexxeeeexxxeeeexexxeeexeeeexexxexexxeexeexeexxexexexxexxeeeeeeeexeeeeexxxexexxexxeeeeexeexexxexexxxxeeexeeeeexeeeeeexeeeeexxexeexeexeeeeexexeeeexxexxexxxxeexxxxxxxxxxeeeeexeexxxexxxxexeexeeexeeexxeexeeeeexxeeeexxxeexexeexxxxxexxxxxeexeeexxxexexxxeexxxxxeeeexxxeeeexxxxxexxxxxexxeexxxxxeeexxxeeexxexexeeexxexxexexxxxeexxexeexexxexexxxxexeexexeeexexxeeeeeeeeeeexxeexxeexxxxxexxeexexxexxexxxeeexexeexexxeexxexexeexeeexxxexxxeexeeexxxeexxxxxexxxxeexxxexeexexxxeeeexexxxeexxxxxxexexexxexexxexxxxxxexeexexxeexxeexxxxxxxxeeeeexxxxexexexeeeexxeeeexxxeexxxeexxeexeeeexeeeeexxxxeeexxxxeexxxexxxxexexexeeexxexxeexxxexeeeeexexeexexexexexxxxxxexxexxexxxexxeeeeeexexxexxeeeexexxxxeexxeeeexexeexeeeexxexexeeexexxexxxeeexxeexxxxeeexeexxexxeeeexexeeexeeexeexexexxxeexeeeeexxxexxxexexxxxeeeexeexxxxxeexeexxxeeexxexeexxeeexexxxexexeexxeeeeeeexxxexeeexexxexxxexeexeexxxxexxeeexeexxexxexexexexxexxeexxeeeeeexxexxxeeexeexxexeeexxexeeexxeexxexxexexxeeexeexeeeeexxexxxxexexxxxexexexexxeeexxxeeexeeeeeexeexexxxeeeeeeexeeeeexexxxxxxxxexxexxxxeexxxeexxeexexexexeeeeexexexexxeeexxxxxxeeeexxxeexxexeeexxxexxxxeexxexexxexxxxxxexeeeeexexxxexxeexxxexxxxxeexxeexexeeeexxexexxexxeexxxeexxxxexexxxxxexexexxeexxxeexeeexeexexeeexeexeexxexeexeeeexeexxxxxeeexxexxxxxxeeexxeexexexexxexexexxexexxxxxxexxxexxxeeeexexexxxeeexexexeeexeeexxexxxexeeexxexxeexxxeexexexxxxxeeexxexxxeexxexxexxxexxxexxexexxeeeeeeeexeeeeexeeexxexexeexxexeeeeexeeeexxxeexxexxexxxeexeexxxeexxxexexxeeexxeeexxxxeexexeexexxexexexexxxxeexxxxexxexxxxexexxxexexeeexxxexexeeeexxxxxxeexxexxexexeexeexxxxxxeexeexeexxeexexexexexxxeexeeexxeexxeeeexxexxexxxxxeexxxeexxeexeeexxxxxexxeexexeexeexexxxeeexexxxxexxxeexexxxeexxeexxxxxexexxeexxxexeexexeeeeeexxxxxxxxexexxexxeeexexexxxxeeexexxexexeexexxeexeexeexexeeexxexexxxxxxxxxeeeexeeeeexxeeeexeexeexxxxxeeeeexeexxeeexexxxexxexexxxeexexxexxexeeexxxexexxxexxexexxxeeexxxxexxexeeexxeeexxxexeeeeeexexxexxxxxxexxxxexexeexxexxeexxxxexexeeexxexexxxxxxeeeexxxeeeeexxeeexxeexxexeexexxeexxeeexexxxxxexxxxeexxexexxeexexeexxxeeeexexxxxxxxxeeexexxxxexxxexexexxexeexxexeexxexeexexxeexexexeexxxexxexxxeeeexxxxxeexxxxxexxxeexxexeeexexxexxxeeexeexxeeexxexeexxeeeeeexxxxeexxeexeeexexxxxxxxexeexeeexexxxxxeexxxeexeeeeeeeexxxxeexexexxeexxxexxxexexeeeexeeeeeexexeexxeexexeeeeexxeexeexeexexxxxxexexxxxxexxexexeexxxeeeeexxeexexeexxxeeexexeexexexxeeexeeexxeeeexxxxexeexexxeexxxexexeeexexxxexexexxexxeexxeexxexexxxxeeeexxxxxxxexexxxxxexxeexexxexeeeexexexxxexxeexxxxeeexeexxxeexexexexeeeexxxexeexxexxxeeeexexxxxxxeexxxexexeeexeeexxxeexeeexeexxexxeeeexexxxexeexxxxxxeeexxeeeexeexeeexeeexexxeeeeexexxxxeexexxexexexexeexxxeeeexxeeexxxeexxexeexxxxxeexeeexeexxxxexxxexxxxexeexexxexeexeexxxxxexxxeexxxxxxexexexxxxxexxxeexxxexxxxxeexxexxxexxxexeeexxexxxxxexxxxeexxexeexxeeexexxexeeeexxexxxeeexexeeeeeeexxexxeexexxxeeexexeexxxexxexxxxxxexxxxeexxeexxeexeeeeeeeexxexeeexeexeeeeexeexexeeeexxxexexeeeeeexexeeeeeexexxexxxexexxexxxeeeexexexxxxexexexxxexxexxeexeexeexxxeeeeeexeeexexexxxxxeexxxeeexexeeexxexxexexexexeeexexxxxexexxexeexeeexeeexexxeeeeexxexexxxxexxxxxxexxeexxxxeexxxexeeexeexxexxexeeexxeeeexxeeeexeexxeexexexexxxexxexexxexxexexeexeeexexxxexxxexxeexxeexxexexexxxxxexxeexeeexxxxeeexeexeeexxxexxxxeeeexxeexxxxexxeexxxxxxexeeexxxxxeeeeeeexeeexxxeexeexxeeeeexeeexeeexxexxeeexxexeeexxxexxxxxexexxexxeexxxxeeexexxxxeeeexeexexexxexexxexeexeexxxeeeeexeexeexxxxeexxxexeexxeeexxxexxxexxexeeexxeeexeexxeexeeexxeexexxexxxexeeexexeeeexxexeeexexxeeeeexxeexxexexexeexeexxeeexexxeeeeeexxexexeexxxxxeeeeexxeexxeeeexexxeeeexxxxxexeeexeeexexeexeexxxexxxxeeexexexeexxxxeeeexxxeeexxxxeexeexeexxxexxexxexxeeeexeexxeeexxxexeexxxeeeexexxeexexxexexeexxeexxeeeexxexeexexxxexxxeexxeexxexexxxexexeexxxxxeeeeexeeeeexxxxexexxxxxexxeeexexxeexeeeexxxxexeexeeexeeexeeeeeexeeexxxeexeeeexeexexeeeeeexexeexxxxeeexxeeeeexeexexexxxxexxxexxeexxexexxxxxeexeexexexxxxxexexexxxeexexxexxxexexeexexeexxeexxxxxxeexxexxxeexexexxxeexexxxxexxexexxxxeexxxeeexexeexexxeeeexeexexexexxeeeeexexexxexexxeeexeeexxxxxxeeexeexexxexxxeeexxxexexeeexxxeeexxxxxeexxxeeeeeeexxxxxxexxxeeeexxxxxexxeeeeeexexeexexxexexexexxxeeeexxxexeexeeexxxexexeexxxexxxeexeexxexxeexexxeeeeexxexxxeexxexeexxxxxeeeeeeexxxxeeexeexxexeeeeexexxeexexxexxexexeexeexxeexeeeexxxxxeexexeeexxeeeeeeexxxeeeeeexexxxexexxexxxxxeeexxexexxeeeeexxxxxexxexxexxexxxexexexxxexxxxeeeexxxeeexexeeeeexxxxeeexexexeexxeeexexexexxexexxexexexexeeeexxeexxxexxeexxxexeexeexexxexxeeexexeexexxxexeexxeexeexeexexxeexxexexxeeexxeexeexexexxxexxexxeexxexexxexxxxxexeeeeeeexeexxxeeeeexxxeexxxxxeeexxxxxxexxeeexxxxeexxxeeexexexxxexxexxxexxxexexeeexxeeeexxeexeexexeeeeexxxxxexxeeeeeexxxexxexxxexexeexeexeexxexeexxexeeexexxxxxeeexeexexxxxexxeeeexexexxxxxeeeeexeeexexeeeeexxxeexxxexxexxxexeexexeexexxxxxxxxexexxxexxexeeexexeeeexeeexexxxexeexexeeexexexxeexxeexexxxxexxxeeexeexxeexeeeeeexeeeexxxxxxxxxxxeeexxexxxxeeexeeexxexexeeeexxeexxeexxxeeeexexxxxxxxxxxxexexxeexeeexeeeexxxexxeexeexeexeexxeexxeeexxexeeeeexeeexeeexxxexxexxeeexeeeexeeexeeeeexexxexexexeeeexxeeexxexxexxeeeexxeexxeeeeeeexexxxeeexxexeexeeexxeeeexxeexxexeeexxexeeexxxxxxeexxxeeeeeeexexxxxexexexeeexxeeexeexxeexxeeeeexexxeeexxexxeeeexxxxxeexeeexxxxxexxeeexexxxxxeeeeeeeexeexeexeexxxxxxexexeeexxxxexxexeeexexeexxeexexexexeeexxexxexxxeexexxxeeeeeeeeeeeeeexeeeeexxexxeeexeexexeeexxexxxxeexexxxexeexxeeeeeexxexexeexexexeeeexeeeexxexeeexexeexeexxxxxeexeexxxxxeeexxeexeexxxxeeeeexexeeexeeexxeexeeexxexexeeeexxxexxxxeexxxxeeexxexxeeeexeexeexexexxxexxeexxexeeeeeexxxxxxxxeeexeexexxxexexexxexeeeexexeexeeexeeexeeexeexxxexxxxexxeeexeeeeeexxeeexexexxexexeeeeeexeeexxxexxxexxxxexeexxexexexxexxexxeexexxxexxxxexxexeexxxeexexxeeexexeexxexxeeexxexxeexeexeexxeexxexeexexxexeexxxxxexxexeeeexeexeexexxxxeeexxxxxxxxxxxxeexxexxxexxexxexexexxeeexxeeeexexexeexexexxeeexxxeeexeeeeeeeexexeexxxexxexxeeexexxeeexxeexexxeexeexxeexxxxxeexxxxxeexxxxxeeexxexexxxxxxeexeeexxexxxxexxxxxxeexexxeexexxeexxeeexxxxxexexeexeeexeexxxxeeexxeexxxxxexxexeexexxxxxxeexexeeexxxxeeeeexeexxxxxexeeexexxeeeeexexeeexexxeexxxeeeexeexexeeexxeexeeeexeeexxexxeexxeeexxxeeeexexxeeeeexeeexxxxeexxexxeexeeeexxexxeexeexeeeexeeexxxxeeexxeexeeexeeexeexxexexxeexxxxxxxxexxeeexxxeeexexxexxexeexeeexxxxeexxeeeexexxeexxeexexeexexeeexxxxeexxxxxxexxxexeexeexexxxxexxxxxeexeeeexexxxexxexxxxeeeexxeeeexeeeeexxexeeexxxexxexxeeexxxeexxxeexexeexxexeexxexxeexxxxxxxxxxeexeeeeeexeeexexxxxxeexxexexeexexxeexeeeexeeeexeeexeeeexxeeexxxxxeexeeeeexxxexexexeexxxxeeeeexxxxexeeeexxeeeexexxxexexeeexexxeexxxxxexexxxexxxeexxxxxexxxexxxexexxxeeeeeeeeexxexexxeexxeexeexeexeeeexxxxxxxeexeeexeeexexeexexxxxxeeexxexxeeeeeexeeeexexeeeeexexeexxeexxexeeexxxxexeexexexeeeexxexeeexxeeeexxxeexxeexeexeeeexxexexxexxxeexxexxxxxxxxxexeeeeeeexxxxxxeexexxxxexexeexeexxxxxxexxxexxexxeeexeeeeeexxexxeeeeexexexxxexexeexeexxexeexexxexxxexxxxeexexeeeexexxeeexxxxxxxxxxxeexeeexxxexxeexeexxeexexxexexxxeeeeeeexexeeexeeexexexxeeeexxxxxeexxexexxxexxeexexexexxexxeeexexexxeexeeexexeexxeeexeeeeeeeexeexxeexxxxxexexxeexxexeeexeeexxxxxexxexxeexxexxxxxexeeexxeeexxxxexxeexeeeeexxexxeexexexexxxexeexxexxxexxxxeeexexeexeeeeexxeeexexeeexxxxxexeexexexeexexexxxxxexeeeeeexxxexxxxxeeexexxexexxxxexxeeeeeeexeexxxexexxxeexxxxxeeexexxexxeeexxexeexxexxexxxxxexxeeexxxxxxxxxxxxxxxexexeeexexxeeexxexxexeexxexeexexeexxeexxexexeeexxeeeexxxexeeeexeexxxeeexxxxeexeeeexxeexexxxeexxeeeeeeeexxeexxxexexexxexxxxeexeeexxexxxeeexxeeexeexexxxxxexexxxxexxxexeexeexeeeexxexxexxxexeexxxxexxxexeeexxeexexexxexexxeeexxexexxxxeexxexxeeexxeexexeeexeeexxexxxexxeexxxxxxxexxeexexxxexxeexxexeexxexxxxexeexexxxxeeeeexxxxxxexexxxeexeexexeexxxeeexexeeeeeeeexeeexeeeeeexeeexxxxexxexxeeexxeexxexxxeexxxxeeexeeeexxeexexexxeeexxeeeexxexxxxeexxeeexeeeexxxeexxexxxxeexexeexeeeeexxxexxxxexexeeexxeexexexxeexexxexxxxxxexeeeexxxxxeeexexxxeeeexexeeeeeexexeexexxexeexxeeeexxxxxexeexxxeexxxxeexexxeeexeexxexxxxeexeexeeeexeeexxxeeeeeexxeexxeexeexeexexxxxexxeexxxexeeeeexxxexexxxxexexxeexexeeexexeexexxxxxxxeexxeexexeexxeexxexxexexeexxxexxxxxexexexeeexeexxexxxexeeexxxxexxexeeeeexxexeexeexxxxeeexeeeeexxexxxexxxeexxxeeeexexeexxeeeeeeexexexeeeexxexxxxxeeexeeeexexxxxxeexxeexeeexxxxexxexeexeeeexeexxxxxxeeexexxxexexxxexxxxxexxeeeexxexeeexxexxxexeexexeeeeeeexxxeeexeeexeexexxxxeeexeeeexxxexxxxeexxxxxxxxxexxexxexexxeexexxexexeeeexexexeexexeexexxexxxxxexeeeeexxxeeeeeeeexexeexeeeexxxxexexexxeeeeeexeexxexxxeeexxeeexxeeeexxexeexeeexexxxeeeexxexexxexxeexxxxeexeeexxeexexexeeeexxxxxexxxeeeeeexxxxexxeeexexxeeexeeeexeeeeeeexxxeexexeexexexeexxexeexexexexeexxeexeeexexexxxxexxxeeexxxxeexeeeexeeeeeexexxexexxeexxexeexexxexexxexxxxexxeexxexxxxxxxxeexeexxxxxxxxxxxxeexxeeeeeexxeexeeeexxeeexeexxeeeeeeeexexxexxxxeexexeexxxxexexeeexxexeeexeexxeexxxxxxxexxxeeexxexxxxxeeeexexeeeexeeexeexxxexxexexxexxeexexeexeexexexxxexxeexexxxexeexeeeexxxeeexexxxexexxxxxxexxeexexxeexxxeeeexxexeexexeeexxexexxexeexxxxexxxxxxexexxxeeexexeeexexexexxeeexxeexxeeeeeexxxxexexxxxxxexexeexxexxexxxxxexexxexxeexeeexxxexxexxeeexeexxxxexexeeeeexeeexxxxexxxxxeeeeexeeeexeeeexxxxxexxxxxxxexeeexxxeeeeeexexxeeexeeexxxexexeeexexxexexxxexeexexxeeexexxxxxxexxeeexexxxxxeexxeexxexxexeeeexexexexexeeexeexeeeeeexxxxxexxxxxxxxeeexxexexxeexxexxxxeexeexeeexeexeexeeexxxexxeeexexxxeeexexexxxxxexeexeexeeexeeexxxxeeexxexeexxexxxexexxxxxxeexexxeeeexxeexxeexexxeexxeeeexeeexxxexxexeeeexxexxexexexxxxexeeeeeeeexeexxexxxeexxeexxeexxxxxeexeexxxeexexxeeexxeeexxxxexexexxexxxxexexeexexxxeeexxxexexxexexeeeeeexeexexxxxeeexeeeeexxeexxxxxxxxxexxeeexxxexxeeeexeexexxxexexexexxxexexxeeexxeexxeeeeexeexxxexeexxxxexxxxexxxexexeexxexxxeeeexeexeexxexeexxxxxxxxexeeexxexexxeeexxexexxexxeexxeeeeexxexxexxxxexxeexxexxxxexxeeeeeexexxexxxexeexxexeeeeexxxeexexexeeexexxxxexxxeexxexeexexexxexeexxeexxeexxxeexexxxeeexeexexxxxxeeexeeexxeexeeexxexxxxxeeeexexxxeeeeeeexexxxxexxxeeeexeeexexexxxxexexxxexeeeeexexeeeeexexeeexxexeexeexexxxxeeexxxexxeeeexxexxexxeexxxeexxexxxeexxxxeexxeexxeeeexxxeeeexexexexxxeeeexxxxxexexxxxexeeeeexexexexexxxxeexxxexxxeeexxxxxxeexxeexxexeeeeeeeexxxxxeeeeexeexeeexxxexxxxxxeeeeeexxexeexeeeexxexxeeexxxxexxxeexxxexexeexxexexxxexexeeexxxxxxxxxeeeeexxexxeeexexxxexexeexxxxeexxxxeexeexeeexexxxxexxxxxexxxeexexxexxxexxexxxxxeeeexxxxeeexeexxxxxeexexeexexxeexxexexxxeexxxxeexexexeexxeeeexxxxxeexexexeeeexxeexxeeexexxeeexxeexxeexeexxexxexxeeexxexexxxexeexeeexeeexxeeexexxxexexeeexxxexeexxexxexxeexeexexexxeexxxeexxxxxeexxexexxeeeexxexxexxexxxxxeeexxxeeexeexexxeexxeeexeexeeexexexeexxxexexxexeexxexexeeexeeeexexeeeexexxxexexeeeexexxxxexxxeeexexeexeexxexeeexexxexxxxexxexxxeeexxexxexxeexeexxxxeeexxxxeexxxeexxexxxexexeexxxexxxeeexxeeexexeexeeeeeeexxexeeexxexeeexexxeexxxxxeexxexxexexxeeexexeexeeexeexeexexeexeeeeeexxxxeeeexxxxeeeexexxeeexeeexxxexxxxeeeeexeeexeexxeeexxxeexxexxxxxxxxexexexeeeeeeeexxeexxeeexxeexexexxxxeeeexxeexeeexeexeexxxxeeexxexxeeexeexexxxexexxxxexxexxxxxeexxeexxxxexxexeeeexxxxxxxeeeexxxxexxeexxxxexxeexxeeexxxexeexxxxxeeexeexxeexxexexexeeeeeexexeexexeexexeexexxxexxeeexxexexeeexeeexxxeexeeexxxexxeeexxexxxxxxxxexxxxexeexxxeeeeexxxeeexeeexexxxeeeeeexxexxexeexexexexexeexxexxxxxexexxexeexxeexexxxxxexxexexexxxxxexxxexxexxxeexexxexexxeexxxxeexxxexxexxxxxeeeexxexexxxxxexxeexxxxxeexxeexxxxeeexeeexeeexxexeexxxxeexxeeeeeeeexeexexeeexxxeexxxeexeeexexxeexxexeexeeexxeexxexexxxxeexxxxexxxxxxexeexxxxexxexeexeeeeexxxexxxxeexexeexxeexexeeeexxxxxxxeexeeexexeeeexexeexeeeeexexxeeexxeeeeeeexxxeeeexexeeexxexxxxxxxxeexeeeexxeeexxxeeeeexexxeexxxeeexexeeexxexxexexexexexexexxxxxxexxxxeexeexxxeeeexexexexxxxxeexxeexxxxxeeexxexexxxxxxxeeeeexxxxxexxexeexexexeexeeeexxeexxeexeeexexxeexxeexxxxxxeeexexeeeeeeexxxexxexxeexexeexxxxxexexxxexexexxeeexxxeeexexeeeexxeexxxxeexexxxexxxxexeeexxxxxxeeeexeeexxexeexxexxeeexxeeeeexxexeeexeeexeexxxexxxeexxexexexxxeexxxxexxxeexxeeeexxeeexxxxxxeeeexexxeeeexeeeeeeexexeexxeeeeeexxexxexxxxxeeexexeeexeeexexexexexexeeeexxxeexexxxeexxxxxxeexxxxexxxexeexxeeeexexxexxeexexxexexxxxeexxexxxxeeexeexxexexexxeeeexxeeexexxexexexeeeeeexxexxeeeeeexxeeeexxxexexeeeexexxxxexxexxxexxxexeexeexexexxxxxxeeeexxxeexeexeexexeeeexxexeeexexxeeeexxexexeexxxexeexxxeeexexxxexeeexexexeexxexxeeeexxeeeeeeexxxeexxexxxxxxexeexxexxexeeeeeexeeexeexeeeexxxxexexexeeexxeeeeexxeexxxeexxxxxxeexeeexxxeeeeeeeexexexxexexexeexeexexxxeeeexxxxexexxeexxxexeexeeexexeexxxexxxexxeexeexexxxxxeeexexeeexxxxxxxexeeexxxxxexeexxexeexexxxeexxeexexexxexeeexxxxeexxexxxxexexexxexxxxexxxxxexxxexexxxeexexeeeeexeexxxexxexeeeeeeexexeexxexeeexxeexxxxexeexeeexexxexxxexeexxxeeeexexxxeeexxxxxeeexxxeeeexeeexexxxxxeeeexxxxeeeexexxexexexeexeexexexexxxexeeexexxexeeeeeeexxexexeeexxeeexeexeexxexxeexexxxeeexxxexxxxexxexeexexexeexxxeeeexxeeexeexxeeeeeexxexxexexxxxxexxxxeexexxxeeeeeeexxexexexeeexexexexxxxxxxxxeeeexeexxeeeexxxxxxxxxexxxeeexeeeexexexxxexxexxexexexxexeeexexexxxxeeeeexxeexexxexeexxxxexexxexxeeexxeeeeexexexxeeexxexexexexxxxxxxeexexexxeexxxexeexxexxxexxeexexexeeeexxxexeexxxxxeeexxxxxxxexxxeeeeeeexxxxxxexxxxxxxexxexeeeexxeeexxxxxxxexexexeeexxexxxeeeeexxeeexxxxxeeexxeexxexxxeexxxxexexxeexxeexexxexxxxexxxxxexexxxexxeeeexxeexxexxxxexxexxxxxexxeexexxxxxeexxxexxxexeeeeexeeeeeeeexeeeeeeeexeexxxexxexxxxexxxxeeeeexxxexxxxxxxexxxeeexxxeeeeexxxeexxxxexexxeeeexxexxxeeeexxexexxxexxxeexexeeexexeexexxxxxexxxexeexxxeeexexexexxexexxeexexexxxxeexexexxexeeeeeexxeexxexexeexxeexeexxexxxeexexeeeexexxxxexexeeexxeexxxeeeexexxxxxxxxexxxexxeeexexeexexexxxexexexexxeexxxxxeexxeeexexxeeexxxxxxxeeexxxexxxxxxexxeeeexeexeeeeeexexeeeexxxeeexeeexeexxxeexxeeeexeexexeeeeexxxxxxexxexxexeexxeexxeeeexxeexxexexexexxexexxxxexeexxxeexexeexexexxexexexxeexexeexeeexxexxeexxexexxeeexxexxeexexxexxeexeexexxxexexeeexexxxxexeeeexeexeexeeeeexexxxxexexxxexeexexeexeeexexeexxeexxxexexxxexeexxxxxexexxxxxeeexxeeeeeeexexeeeeexxxxxeexxeexxxeeexxexexeeexeexxexexexeeeeeexxeeexeexeexxeeexxeeeexxeeexexeeeexeexxxxeeeeeexxxxxexexxexxxexexxxeexxxexeeexxeeexxxeeeexxxxeeeeeexxxexxxxexxeeeexexxexxeeeeeexxeeeexexxxexeexxxxxeeeeexxxxxeexxeexxexxeexxxeexxexxxeeeexxxeexxxexeexxeeexeexxxxxexxexeexexexxexeeeeeexexxeexxexexexeeexxeeexxxxxxeexxexexxexxxxeexxxxexxeeeexxxeeeexexxexxexxeeexexeeeexxxeexxexxeexexeexxexexxeeexxexxexeexeexexxxxxxxxexxexeexexeeeeexexxxxexexexxxxxexxexeexxexxxeeeexxexexeexxxexeeeeexexexexeexexxexxeexeeexeexeeexexeexexexeexxxxeexxexxeeeexexxeeeeexexxxexxxexeeexxxxxexxxxxeexxexexxxexxexexxeeexxexxxeeexxxexeexexxeexexexeexxxexxexexeeexexeeexeexxxxeeeeeeexxxexexxexxexexxexxxxexexeexxexxeexexxeeexxxxexxeeeexxxeeeeeeexeexexxexexexeeeeeeeexxeeexeexeeeexxexxeexeeeexxeexxxeeexxexxeexeexeeeexxeexxxexxeexeeeexeeeeeexeexeeeexxeeexxxeexxxeeeeeeexxexxexxexeexxexxxxxeexexxeeexxeeeeeexeexeexexxeeexxxxeeexxexeeeexxxxexxxxxexxeeeeexxxxeeexxxxxexxxexxeeeeeexeexexxxxxxexeeexxexxxexxexxxexexexxeeeexeeexxxxexeeexexexxxxxexexxxxexxeeexeexxxxexeexxexxeexxxexxexxxeexeeexeexeexxxxxxxxeeexeeexeexxxxexxeeeexexeexxeexexeexxeeexxxxxeexxeeeexxxeexxxeexxxxeeeexexexxexeexexxexexxexexxeexeeexxexxeexexxexexexexxxeexxexxexxeexxxxxxxeexeeeeeeexexexexxeexxeexexxxeeeeeexexxexeexxeeeeeeexxxeexexxexxexexxexxxeeeexeeeeeexxxxeeexexxexxeexxexeexxxxxexeeeexexeexexxexexxxxxexexxxeexxexxexeexeexxexexxexxxexxxeexxeeeexeexexexeeexexxxeexeexxxxxxxxexxexxexxxxexxxexxxexeeeeeexeexxxexxeeexexexexxxexeexxxxexxexexxexxexeeexxxeexxexexeexxxeeeexxxxxxxexxxeeexxexeexxxxeeeexeexxxeeexexxxxeeeeeexexeeeeexeexxexxeeeexxxxxeeexeeeexxexxxxeexxxeexexxeeeeexxxeeexxxxxexeexxexxxexeexeexxexexeexxeeeexxxeeexxxxexexeeexexxeeexexeexxeexxxexxexexxxexeexxxexxxexxeeexexexxexxxxxxexexeeeexxexeeexexxeeexeeeexeeexexxexeeexxeexxexxexxexexexeexxxexxxxxexeeeeexexexexxxxeexeexxexexexxexxexxeexexexxexexexexeexxxexeexxexxexxexexexxeexxexxexxxxxexxxxexxexxxxxxxxxxxxxxexeeexexxeexxxexxxxeeeeeeeexexeexxeexxxxexxexxexeexxexxeeexexeexexeeexeexeeeeeexxxxexeexxeexxeeexeeeeexeexxeexexexxexexxxxxexexxexxxeeexxxxeeexxexeexxxxexxxxxexeeeeexeexeeeeexeexxexxxxeexxxxexxxxxeeeexeexexxxxeeeeexeexxxeeexexeexeexxexexxeeexxeeexxeexxexxxexxeexxxexxxeexeeexxxxeexeexxxxeexxexxexeeexxexxxxeexexxeexexexxxxxeexxexexexxxxeexxexeexeexeexeeexeeeexeeeeeeeexexxexxeeeeeeexxexexeexxexeeexeexexxexxexxxxeeexxeeeexxxxxexeexxeeexexxxxxxxxxxxxxxxexxexxeexeeeexxxxxxxxxxexeexxxxxxexexxexxexxeexexxxexeeeexexexeeeeeeexxeeexxxxeeeeexexexxexeexeexxxeeexxexxeeeexexxexxxxeexxxxeeeeeexxexxexexxexxxeeexxeeeeeeeexeexxeeexxexxexxexexexeexeeexxxexexxeeexxxeexxxxexexexeexeexxxexeeeexxxxexxxexxeexexeexeeexexxxexexeexxxexxexxexeeexxeeeexexxxxxxxexeexxxexxexxxxexxxxxeexxexxxxeeexeeeeexxxeeeexxxeexxxeeeeeexxexeeexxxeeeexexeexxxeexexeeeexxxeeexxxeeexeexxeeeeeexxxxexxeeeexxeeexxxxexxxxeexxexxxexexxexxxxxxexeeeexexexeeexxexxxeeeexexxxeeeeexxeeeexeexeeexexxxexeexxeexxxxexxxeeexeexeexxxxxxeeeeeexxxxxexxeexeexeeexxeeeexexxexeexexxxxeeeeeeeexxxeeeexexexeeeexeeexxexxexexxxxexeeeexeeeeexxxeexxxeeexxeeeexeexeexeeexexxxexeexxxxxxeeexexxexxeeeeeexxeexxxexxxeexxxxxexexxxexeexxxxxxxexexexxeexeeeeexeeeeeeeexexeeexeexexxxeexxexeexeeexexeeeeeexxeexexxxxxxexxxeeexxxxxxxeeeexeeeexexexxexexxeexxxxxxeexxexxeexexxeeexeexeexexexxxxeexeexxexxxxexexexexxeeeeexxxeexexeexxexexeeexxeeeeeeexeexexxxxeexexeexeexexexeeeeeexexexeexexxxxeexexexxxeexexexxeexeexxxexeeeeexeexeexxxexxexeexeexeeeexeexeexxeeexeexxexxexxxxeeexxexxxxxxeexexxxexexxxxxexxeeexexxeexxeeexexxxexexxxeeexxeexexexexxxexxxexxxxxxxxxxexexexeeeeexexeexxeexeeexxxexeeexexxxxexxexxeexxxexexexxexxexxexexxeeeexxexxxexeexexxexexeeeexxxexeexexexxexxxxxexxxxxeeeexexxxexeexexxexxexxxexxxxeeeeexxeeexeexexxeeeeexxxxxexexeexxeexxxxxxeexxeeexeexexeeexxxxxxexxexexexxexexxxexxeexexxeeexexexexxxexxxeexxeeexxxxxxxeexxxxxxxxeeexexexxeeexexxxxeexeexexexeexxexxeexexexxxeexexxxeeeeeexxxexxxxeexxeeeeexeeexeexxeeeeexxxexxxxeeeexxexexeeexxxeeeexeeexxexxexeeexxeeeeeeeeexxxexexeeeexxeexeeeeexxexxxeexeeeexxexeeexxeexxeexxxeexxxexeexexexxeexxxxeeexxeexexxxexxxxxxeexxxexeeeexexxxxeexxxexexxxxexexeeexeeeexxxxxeeexeeeeexxeexxeexxexexxxxeexexxeeeexexeexeexxexexexxxxxexexxexxxxeexeeexeexeexexxxxexxxeexxxxxxxxeeexexxxexxxeeexxxexeexxexeexxexxexeexeeexxexxexexexxxxexxxexeeeeeeeeexeexxexxxxexxeexeexeexexxexeexexxxxexexxxexeexexeexexxxeexexeexeexexxexexxxxxexexexxexxexeeeexeeeexeeeeeexeeexxeeexxexexxexxeexeeeexxeexxexxxxeexxxeeeexxxxxxeeeexexexxexeexxeeeeeeeexeexxexeeeexeexxeeexexxxexeexxexeeexxexxexxexexxxexeexxxxexeeeeexxxeexxeexxxeexxxxxexxxxxxeeeeexxxeeeeexxeeeexexexxexxeeeexxxxxexexxxxexeeeeeexxexeeexxxxexexxexxexxexxxxxxeexeexeeeeeeeeeexeexxxxeeexxexexexexxxexxxxxeeeeeeexxexeexxeeeexexexeexeexexxexexxxexxxxexxexexexeeexxeexxexxexxxeeeeexxexeeeexeexexxeeeexxxeeexxexxxxeexeeexxxxxxexxxxxeexxeexexxxxexxxeexxxxxeexxxxxxeeexexxxeexeexxeexxxexeexeeeexxxeexexeexxexexexxeeeexxxxxexxxexexexeexexxxxxeexexxeeexxexexexxeexxexeexxxxexxeeexxeexexxxeeeeexxxeeexexxxexexexeexxexxexxxxxexeeexeexexexeexxxeeeeexxexxexeeexxeeeeexexxeexexexxxeeexxxxexxexxexxexeeeeexexxexxeexxxexexxexxxxexeexeexxeeexxxeexxexexexexxxxexeeeeeexeexxxxxxxxexxxeeeeeexxxxeeexxexexxxxexxxxxxexexxxxeexeeexxxxxxeexexxxeeexexeeeexxxxeeexeexxxexxxeeexxexexexxexeeexeeexxexexexxexeexeexeeexxxxeeexxexxxxexeeexxexxxeeexxexxeexexxexeeeeeexxexeeeexxxxxeexeexxexexeexxeeexxxeeexexeeeexeexxeeexxxeexxexexexxeeeeexxxeeeeeeeexeexxxeeeexeexexexxxxxeeeexxexexxxeexeexxxxeeexxxxeeeexeexexxxexexeexexxxeexxeeeexeexexexeeeexeeexeexeexeeeexexxxeeexexexexxxxxxxeeeeexxeexxxexeeexeeexeexxeexexxxxexeeeexexeexeexxxeexexexexxxeeexxeeeeeexeexxeeexeexexxxeexeeexxeexxxxxexexxxeeexxxexexexexxxeeeexeexeexxeeeeeexxeexeeeeeexexxeexeexeexxxxeexexxexeeexxexxeexxxexeexexexxexxexexxxeexxxeexexxexexexxxxexeexxxexeexxexxexexxxexexxexxeeeexexxxxeexxxeexxxeexxxeeeeeexxeexexeexxexxexeeeeeexeeeexxxxxexxeexxeexeeexxxxxxxxxxexxeeeeeeexexxxxxxxeeexexeeexxxxeeeexxxxexxxxxxxeeexexxxexxxxeeeexeexxeeexxeeexxexxxxxeexeeexeeexeexxxeeeeeeeexexxeeexxeeeeeexxxxeeexxeeeexexxexxxxxxeeexeeeexxeeexxxexeeeeexxeexxxeeeeexeexxexxeeeexxxexexexeeexxxeexxxxeexxxxxxxxeeeexexxxexxxeexxeexexxxeeexxxxeexxxeeeeeeeexxxxxeexxeeexexexxexeeeexxxexxeeeeeexexeeexxeexxxxxxeeeeexexeeeeexxxexxeexxxeexeexxxxeexexxxexexxxxexexxxeeeeexexexxeeeeexxeexexexxxexeexeeeexxeexxexexeeexxexxexxxxxxeeexexeeexxexxexeeexxexxexexxxeexxexxxexxexexeexxxxeeexxxxeeexeeexxexexxeeeeexeeeeexxeeeeeexexeeeeeeexeeexeexeeexxxxeexxxeeeeeexxexxxeeexexeeeexxxeexexexexxxxxxxxxexxxxxxxeeexxxxeexxexxxxxeeeexxexexxxxxexxexxxxexeeexexexexexxxeeexxeeexexxxxexexexxeeexxexexeexeexxxxexxeeeexeeexexxxxxxxxxexexexxeexeexexeeeexxxeexeexexxxeeeeeeexxxxeexexxxxeeexxxxeexexxexexeexexeeeeexxxexxexxeexexexexxxeexeexxexexxxeeeeeeeexxxexxxxexxxeexeexeexxexeeeeeeeexxxeexeeeexexxxxeeexeeexxeeeeeexxexxxxexxxxxxxxxeeexxxeeeexeexeexeeeexexxxeeeexexxxxeeexexxxexeexeexxxexeexeeexexxexeexexeeexeexeexexexxeeeexeexeexeexxxxxexeexxxxxexxexeexeexxexexeexeexexexxexeeeexexeexxexxexeeexeeeeexxxexxxxxeeexexexxxxexeeeexxexeexxxexxexeeeexeexexeeexexeeexxxexxxxexxxxexxxxexeexxexxeexxeeexxexeeeexexexxxxexxxexxxxeeexeexxeeeeeexxxeeexexexxxxexxxxexeexxxxxxxxxeexeexeeexxxeeeexexxxeexeeexexeexeexxeeeeexxxxexxxeeexxxexxxxexxxxeeeexeexexxxxeeexxexeeeexxxexxxxxexexexexxexxexxxxxxxexexeeexexexxeeexxeeexxeeexexxxxxexxxeexexeexeeeeexxxexxexxexexxexxeexxxexexxxxxxxxxexexexxxxxexxeexxxxxxeexexxexxexexxeexxxeexxxxeexeeexxxexeeeexexxxeexxeeexexxxxxxxexexeexeexeexxxxxxeexxexxexxeexexexexexxxxexeeexxxxeeexxxxxxxexexexeeeeexxxxexeexexxexexxeeeeeexxeeexxeexeeexexxxxxexxeexeexeexxxeeexeexxeeexxeexexexxeeexeeexeeeeexxxexexeexxxxexxxxxexexxxeexeexxexeexxexxexexxxxxeexexxeexxxxxxxxeexxexxxexexexeeeeeeeeeexexexeeexxeexxxexxexxxxexxxeexeeexxxeexxexxxxxxxeeexxxexeeeeeexeexxxexxxxeeeexxxxxxexeeeeeeexxxxxxexexexxeexxxeexeexxxexxxxeeeexxxxxexeeexexxexexxxexeeexxxxeexexeexexeeeeexxxeexxexexeexeeexeeexxxxxexxxexxeeexxxxxxxeeeeexeeexxexeexxexxxxxxxxexxxexxeexxxxxexexexxeexexeexxxexxxxxxeexeeeexexxexexxxxxxxeexexeexxxxxxxxxeeeexeexexxxxexxeexexxxeexexeeexeeexeeeeexeexeeexexxexeexxxxxeexxexeeexeexeexxxeeeeeeexxexexxxexexxxxxxxexxeeeeeexxxexxxxeexeeexxxxexeexeexxeexxeeeexxxexxxeeexeeexeeexexxexxexexxxexxxexexeexxexxxxexeeeexexxeexexeeexexxxxxeexxxexeeeeeeexeeeeeeeexxeeexexxxxxxexeexxxxeexexxxxxexexxxexeeeexexeeeexxxxeeeexxxexxxeeexxxxexeeexxexxeeexeeeexexeexeeexeexeexeeeexeeeeexxeeexxxxeeexeexxeeeexexexeeexexxexexexxxexxxexxxxxxxeexxexexxxeeeexxxeeeeexxxxxxxexxxxeeeeexxexexxeeeeexxxeeeexxxxeexexxexxxxxxexxxxexeeexexxxexexeeexeexxexxeexexxxxxexxxexeexxexxxxexeexxexxexexxexexxexxeeeeexxexeexxexxxexxeexxeeeexexxxeexxexxxxexxxxeexxxxexxxeexxeeeeeexeeeexxexeeeexexeexeexxeexexxxeexexxeexeeexxxxeexeexeeexeeeeexxxxxxeeexxexeexxeeeexexexxxxxxexeexxxxexxexeeeexexeeeexexxxexeexxxeeexexexexexxxeexexeexxeeeeeeeeexeexxexxexexexeexxxeexxxexeeeeeeexxxeeeeexxxxexeeexeeexxxxxxxxeexeexxeeexxxexxeeexxeexexexxxexeexxeeeexeexexxxxexeexxxxxeexexeeexxxeexxxeeexxexeeexeeeeexeexeexxxexeeexxxexxeeexxeexxexxxxeeeeexxeexexeeexxeeeeexexxeeeexxxeeexeexexeexxxxxexexxeeeeexexxeeeeeeexxxexxxxeexexxxxexeexxexeexeexexeexxexxeeexeeeeexeexxxxexexexeexexxxxxeeeeeeexxexxexexxeeexxexexxeeexxeeeexxeeeeeexeexexxexxxxeexxeeeeexxxeeeeexxeexxexxxxxeeexexxeeexexxeexxexeeexeexeeeeeeeeexexexeeeeexxxxexxeeeexeexxxxxxexeexexxxxexexeeeeexeexxxeexeexexeexexexeexxeeexxexxxxxxxeexexxeeexexexeexxxxeexxxxexxexxexeexeeexxeexxxeeeexxxxxexexeexxexxeeexeexxxeexeexxeexxexxxeexxxxexeexexexxeeexxexxexexxeeeexeeeeeexxeexxexeexeeeeexeexxeexxexxxexeexxxxxxeeexxxxxxeexexexxexxxexeexexxxxeeeeexexeexexxeexeexeexxxexxxxxexxxxeexexxxexeexeeeeeexxxxexxeexxexeexxxxxxxxexeexxexexxxeeexexxxeexxexxxxxxxxexexexxexexxeeexexxxeexxxexxxeexxeeeexexxxxexeeeeexxxeexeexeeexexxexxexxeexexexexeexxexxxxeeexeexxxexxeexxexexxxxxeexexxexxxxxxxxxeexeeeexxeeeexeeeexeexxeeexxxexxxxeexxxexexxexeexxxxeeexxeexxxeexxeexxxeeexeexxxxeeeexeexeexxexxeexeexxxexxeeeexeexxxeexxxeeeeeeeeeeexxxeexexxxxexeexxxxxeexeexxxxeexexeeexeeeeexxeeexxxxexexexexexxexexxxeexxeexxeexxexexeeexeeexxexexexxxxexexeeeexxxxxexxeeeexxxxxxeeexexexeexeeeeeeeexexeexeeexxexxeexxxxxxexxexeeexxeexxexxxeexeexexexeexxxeexeexxexexeexexxxxxxexexxxxeeexeeexxexexexxexxexxexxxxxxexxexxxexxexeexxeeexxxexexeexxxxxxxxexeexxeexexexexexexexxexeeeexeeexxexxeexxxxexxexeexeexxexxexexeexexeeeexxeexeeeeeexxexxxeexexexxexexexxeexeexxeexexxxxexexxxxeexxxeexxxeexxexxeeexeexeexexxexxexxexeeeeexexxxxxeeeeeexexexxeexxxxxxeexxxeeexexxxexxeeeeeexeexxxeeexexexxexexxxexeexexxxxexxxxexxxxxexxeeexeexexeeeeeexxexeexeexexxexxxexxeeeeexxeeexxxexexxeexexexxeexexexexxxxxxeeexxeeeexxeexxexexexxeeexeexxeeeexexxexxeeeeeeeexexexexeeexexexeexeexexxxexexexexeexeeexxexexxxxxexxxexxxxexxxxxxxeexxxxexxeexeeeexexxxxxxxexxexxexxxxeeeexexeeexxexeeexeeeexexexexeeeeeeeexexxxxxxxxxeexeexxxxeeexeexexexeexexxxeeeeeexxxxeeeeexxeeexeexexxxxexxxexxxxeeeexeeeeeeeexeexxxeexxxxxexxexexexeexeeexexxxexxeeeexxeexxxeexexexeexeexxxexeeexxeexexxxexeeexexexxeeexexxeeexxxxeexxxxexxeeeeexxxeeexexxxxexxexeeeexexxexxxxxxeexeeeexxxexxxeexeeeexxxxeeeeeeeexxxxxxeeeexxexeeexxxeeexexxexxxxeexexeeexxexxxexxeeeeexxxxxeeeeexxxxexeeeeexxexeexxxexexexexeeeexxxxxxexxxxeeexexeexexxeeeexxexxxeeeexeexxeeeeeeeeexexeexexexexxeexeeexexxexexxexeexxeeeeexxexexeeeeeeeexxxexxxexeexexexxeexeeeexexxexxxxxxexeeexexxxxeexxxexxxeexxxeeexeexexxexxxxexxxeexeeeeexxxxexxexxxeexeeexeexeexeeeeexxxexexxexxxeeeexexxexxxeeexxxxxxxxexexxxxexxxxeeexxxexexexxxxxxexxxxxxxexeexxexxeexeexexexeexeeexxxxxeeexxxxxeeeeexxexeeexxxxexxexxexxxxexexxxxxxxxxexexxxeexxxxexeexxxeeeexxxxxexxxxxxeexeexeeexeexeeeeeexeexxxxeexxeexxxexexexxxxxxexexxxeeeexexxeexxxxeexxxeeexeeeeexexeexexxexeexeexexexeeeeeeeexexeexexxxxeeeexxxxxeexeeexeeexeexxeeexxeeexexeeexxeeeexxxeeeexeeexxxeeeeexeeeeeexxexxxexxxexexxexxxxxxxexexxxeeexexxxexxeeexxeexexxeeexxxexexxxxeexeeeeexexeeexxeeexeeexxxxxxxexexeeexexeeeexxeeexeexeeeexxexeeexeexxxeeeexxeeexeexexexxeexexexxexexeeexxexxxexeexeexxxexeeeexexexexxexexxxxxxxeexxexxeeexxexxxxexexexeeeexxxxexxxxeeeeeeeeeexeeexxxeexeexxexxexexxxxxeexxxxxxexexeeeeeexexeeexeeexxexxexexexeexexxxexxxeeexxeeexexexxxxxexxxeeexexexxxxxexxexxxxxeexeeeeexexxexexexexxexexexexexexxxxxxeexeexxexxexxxxxeeeexexxxeexxxxexxeeeeexeexxeeexexeeexxxexxxxeeeeexexexxeexxxxexxeeeexxxxxxxexeeexeeeexxeeeexexxxxexxxexeeeexeeexeexeeexeexexxxxeexxxeexxeexexxexxxexxexxxexxxexxexeexexxxxexxxxxxxxxxeexexeexeeexeexxxexexxxxexexxexexxexxeexexeeexexexxxexxxxxexeeeexexexexxeexexxeeexxexxxexexeeeexexxxxexxxexexxeeeexexxxeexeexexxexxxeeeexxexxxexxeeeexexexexeexxxxxxeeexexeexeeexexeexexexxxexexxxxexxexeexeeexeeexeeexexexexeeexxxeeeeexeexxxxxxxexexxexexexxeexeexexeexxxxeeexexeexxeeexeexeexxxxeeexexexxxeexeeexeeeexeeeeeexeeexeeeexxeeeexeeeeexeeeeexeeexexxxxeexxeeeeeexeexxeeexxexexxeeeexxxeexeeexxeexxexeeeexeexeeeexexxxxxxexxexeeexeexxeexexexxxexeexxxxexeeeeeexxeexxexeexxexxxxeexxeexxexeexxxeexxeeexexxexexxxxeexeeexxxeexexxxeeexeexeeeexexeeexexxxexeeeeexexxxxeexxeeexeexeeeeeeexeexeeexexxeexxexxxexexxxxexxxeeeeeexexxexxeexexeexeeexeexeexexeexxxxxxexxxeexexexexeexexxexxexeeexxxexeexxeeeeexxeeeexxeexexxxeexexexxxxeexexxexxxxxexxeeeeexeexexxxxxexxxexexxeeeexxexxxxexeexexeexxexxeexexexxexexexexeeeeexexxxxxxxxxxeexxxxexxexxeeeeexxxexexxeexeexxeeeeexxexexexxexexeeeexxxxexeeeeexeeeexexeeexexeeeexxexexexexxxeexexxxxxxxxeeeexexeexexexeexxxexeeexxexxeeeeexxexxeeeeexeexeeexxxeeeexxxxxeexxxeeexeexeexexeexxeexxxexexeexxxxeexeeexxxeexxxxexxxeeexxxexexeeeeeeexexeeeexxxeexexxxeexexeeexxeeeexexxexxxexexxxexxeexxxeeeeexxxxeexeexxexeeeexexxxeexexxeexeeeeeeexxexxexxxxeexxxxeexexxxxeeeexxeexxexxxexeeeeeexxexxxxxxxxeexeexxeeexxexxxxexxeeeexxxexexeexxxeexeeexxxexxxxexxxexexeexxeexxxxexxxexeeexxeexxxeexeeeexeexeeeexeexexexxeeeeeexxxexxxxeeeexexxexeexxxxeeeexxxeexxeeexeeexexxeexexxexeexeeeexxxeexeeexexxxeexeeeeeexeeexexeeeexxexeeexeexeeeexeexxeeexexexexxxxxexeeeeexxexxxeexxexxxxexeexxxexexxxxexeeeexexeexeexxxxeexeeeexxxeeeexexexxxexxxxeexxexxexxxeexeeexxxexxexxexexeeeeexxxexxxxxexxeeexexxeexexxxxxeeeexeexxexeeexexxeexeeeeexxxxeexxxxeexeexxexxeexxeexexxxeexeeeeexeexxeeexxexexeeeexxexxxeeeexxxeexeexxeexexexexexexeexxeeeexexexeexeexeexxxeexexxxeeeexeeexexeexxexxexxeeeeeeeeeexxxxxexxeexxeexxexxxxxxxeexeexxeeeeexxxexxxxxxexeexexeeexxeeeexeeexxeexxexxxeeexxxexexxxxxxeexexxxxeexxexxxeeexxxxexxxexexeexxexxxeeeeeeexxexxeeexxeeeeeexxxeexexexeeexeexexxxexxeeeeeexxxxexexxxexexeeexexexxxexeexxeexeexeeeexexxeeexxeeeeeexeexxxxxxxxxxxxxxeeeexxxxxexxeeexeeexexxxeeeexxeeexxxeeexeexxexxeeeexxeeexexexxxeexxexxxxxxexeeeeexxeexxeeexxxxexeeeeexexxeexeexxexxxexxxeexxeexxxeeeexeeeeexxxxexexxexexexxexexeeexeeexeexeeexxeexexeeexexeeexxexexeeexxexxexxxxxxeeeexxeeeexxxxexexxxexxxeexexxxexeeexxxexexeeeeexxxeeeexxxeeexeeeexeeexxeexeexexeeexxeeeeeexxeeeeeeeexexexxexxeeeexxeeexeeeeeexxxexxeeexeexeeeexxxxxxexeeexexxxxxxxexxxxexexeexxxxexxxxxexxxxeeexexxxxxxexexexexexexxexxexexxexxexxexxxeexeeexxxexeexxxxeeexxxexeexexxxxxexeeeeexexexexxxxxxxxxxxexexeeeexexexexexxxxeexexxeexxeeeeeeexexxexxeeexeexeexeeexxeexxeexxxxexeeexeeexexxexeexxexexexxxeexexxxexxxxxeeeexeeexexexxxxeexxeexexxeexxxxxeeeeeexxxxxexeexexeexxeeeeeeeeeeeeeeeexxxxxxxeeeeexexxeexxxxxeexxxxexeexeeeexexxxexexxexexxeeexexexxeeexexxexxxexxeeexexxexeexeeexexxxxexeexexxexeexxexeexeeeexxxexeexxxxxexxeeexeeexxexexxeexxeexexeexeexexexeexxxxeexeeeeeeeeeexexxeeexeeexxxxexxxxxxeeexxexexxxeexxexxeexxeexxxexexeexxeexxxxxxeeexxxexxexeeeeexxxxeexxexexxeeeeeexexexexxexexexxxxeeeeeexxeeexexxxxeeexexexxxxeexxxxxxeexexxxexxeexeexeeexxxxeeexexxxexxxeexexeexxxxxeeexeexxexxxxeexxxxexexxexxxexxeeeeexexxxxxeeeexxeexxxexexxxxxexeexxexxexeexexxxxeexexexexexeeeeeexxeeexxeeexxxxxxxeeexxexexeeeeexexeexeeeeexxxexxexeeexxxeeexeexxxxexexexexxxxxexeeexexeexeexeeexxxexexxxxxexeexxxeeexexexexexexeeexxexexxxeexeexxxxxxxexexeeexeeexxeexexeexxexeexxexxexxxexexxxxxexeexxxeeeexxxxxexeeexexeexexxxxxexeexexxeexxxeeexeeexeeeexeexeexeexxxxxxxxeexexxexxexeeexeexeexxxeeeeexexxexeeeeexeeeeexxxexexexxxxxexxexxxxxexxxexexxxeeeexxexxexxxxxeeeexxeexxxxxxeexxeexeeexeexexexeexeeexexeeexexxeexeeexxxexeexxxxexxxeexxexexeeeeeeexxxxxeeexxxxxxxxeeeexeexxxexxexexexxexexxexeeeeeeeexxxxxexexxexxexxeexxeexxxexeeeeexeexexxexeexxexxexexexexeeeeeexeexxxeexxexexeexexexxxeeeeeeeeeexexexxxexexxxexxeeexxxexxxxeeexxeeexeexeexeexxxxexeeexxxexxexxxxxxexexxxeeeeexeexxeexexxxxexeeeexeexxxxxxxexxxexexexeexexeexxxeeexexxexexxxxeexeexexxxeexexeexxxeexeexeexxxxeexxexxexexxxxxxeexxexexexxexxexexxxxeeexeeexexxeexexxxeexeeexxeeexxxxxexxxeeexeeexxxxexeexxexxxexxxeexxxxexxxeeexeeexeeexxxxeeexxexxxexexexexxxxxxxeeeexexxxxxxxxxxexeexeexxeexeeexxeeeeexeeeeeexeeexexeeeexexexexxxxeexexxeexeexxxexxxxxxexxexexxxxxxxxeexeexexexxexxexexxxeeeexeexexxeeexeexxxexeeeeeeeeexxexexeexexeeeexxexxxxxexxeexxeeeeexexxxeeeexxxexxxexxxexexxxxxxxexxexxxxexxxexxexexeeexexxxxxxxeeexxeeeeexxexeeeexexexxexxeeexxxexxexxexxxxxxexxeeeeeeexexxxexexeeexeeexeexexxexxxexxexxxxxxxexxxxxxeeexxeexxxexxxeexxexxeeeeexxexeexeexxxexxeexxxeeexexxxeeexxxxxeexexexexxxxeexxxexxeeeeeexxeeexxexeeexxxxexxeexxeeeexxexxxeexeexxexxxxxeexeexxeexeeeexxxxxexeexxxexxexxexeexxexeeexxxexeeeeexeeeexeeeexexeeeexexxeeexexxxeeexexexxeeexxexexeexxxeeexxeeeexexxxexxexxeeexeexxeexxexeexxxeeexexeeeeexxeexxeeexeexxxxxexxeeeeexxxeeeexeexeeeexexxxexxexxexeexxeexeeeexxxxxxexxexxxxeeexexeeexxexexxxeeeeexxxeexeeeeexxexeexxxxeeeeeexxxxeexxxeeexxxxxeexeeeeexexexeeeexexexexexxeexexxxeeexxexexxexexxxeexxxxexxexexeeeeexeexxxxxeexxxxexxxxxxexexexeeeeexeeeeexexxxeeeeeeexxeexexxxxexexeeeexxxxxexeeexexxxxxxxexxxeexxexeexeeexeexexxxexexeexeexexxexexxeexeexxeexxxeeeeexxeexxexxxxxxeexxxxeeexeeeeexxeeeeexeexeexeeeeeexexexxeexexexxeexeeeeeeexxxxeexxeeeexxxxeeeeeeeeeeeeexxeexxexexeexexxexexxeeeexeeexeexxeeeexxeeexexexxexxxeexxexxeeeexxeeeexexxexeexxeexxxexxxxexexeexxxeeexeeeexxxeexxexxeeexexxxeexexeexxxxxxeexeexxxexxexxxexeeexeeexxexxeexxexeeexeeeexxeexexxeexxxexeeexexexeeexxxxxxeexeeeexexxxexeexexxxxeeeexxeeeeeexxexxxexxexxexxexeeexxxxxeeexexexeexexxxxexxxxxxxeeexeeexxxexxxxxexeexexxexexeeexexexexxxexxxxxexeexexxxxexexxxeexeexxeeexexxxxxeeeeeeeeexxxxexexeeexxxexxexxeeexexexxeexeeeeeexeeexexxeexxxexxxeexxxexxexxxxexxxxeexexexxexxxexexxxeeexeeexeeeeexexeexxxexeexxxxexexeeeeexxxexxexeexxexxexxeeexxxeexexeexxxexxxeexexeeexxeexeeexxxxxexeexxxexxexeexxexxxexxxeeeeeeexeeeeexxexxexxxexxxxeexxxexxxexxxxexxexeeexeeeeexxeexxxxeexeexxexexxexexxxeexeexexeeexexexeexxxeexxexexxexxxexexeeeexxxexexeeexexxxexxeexxeeexexeeexxeeeexeeexxeexexxxeeeexxexxexxxxeeexexeeeeexexexxxxeeexeexxeeexexxeexeeeexeexxxxxxxexxxeeeexeeexxeeexeexexxxxxexxxxxxexexxexexxxeeexxeeexxxeeeeeexeeexeexexexxxeeeexexexexexexxxxeexexeexxxexxxeexxeeexexeexxexeexxexxxxexxxeexexeeexeeexxexeexxexeeexexxxxexexxxexxxeeeexxxxeeexeexxxeexxxexxxxexxeexxeexxeeeeexexxxexexxexeeeexexxexxxeeexeexeeexexexxeexxeexxxxxexxxexexeeeeeeexexeexexexexexeexeexxexeexexxxxxexxxexxeeeexexeexeexeeeeeexexeexeexexeexxexxxeeeeexexxexeexxxxxxxxeeeexxxxeexxxexeexexxxeeexxexeexxexxxexexeexxeexxexxxeeeexxxexexexeexxeeexeeexeeeeexxxxxxxexexxxexexxxxxeexeeeexexexxxexxxxxxxxxeeexxeexeeeexxexexeexxxexxeexxxeexexeexxexxxxeeeexxxexeexexeeeeeeeexexeeexxxeeeeeexexxexxxxxxxexxexxxxeexxexxexexxeeexxxeexeeexxxeeexeexeeexxeexexxxxexxxexxexeeeexxeeeexeexexexxxexxxexeexxxxeeeeeeeeeeexxeexxeeeeexeeeeeeexexexxexexxxeeexeexeeeeexexexexeeexexeexexexxexexxxxeeexexexxeexexxxxxeexexxxxexxxxxeeeeexexexxxxxeexexxexxxexxxeeexeeexxexeeexeeeexexxxxxeeexxxxeexxxxeeexexxxxxxxeexexeeexxexxxexxeeeeexxeexxexeeeexxeeexeeexxexxexxeeeexexxxeeeeexexxeexxexeeexexxxxeexeeexeeeexeeeexeeexxexxeeeeeexxeexxexeexexeexeeexxxxeeexeexeexxeeeeexeexexeeexeeeexxxxxxxexeexexexxeexeeeexexxexxxxxxexexxxxxeeeexxxxxxxxeexxexeexeexexxexxxexxxxexxeeeeexeexxxeexxxeexxxeeexexeexxeeexeeexxxeexexeeeexexeexexxexxxeexxxxexexxxxeexxxxeeexxxxexeexxxexxxxexeexexeexxexxexxeexexexeexeexxxxxxxxexxxxxeeexexeexeexxxxxexxexeexexeeeexxxexxxxxexxxxxxexxxxxeexexxexxexxxxxexexxxxeexeexeeeexxeeeeeeeeeexxxxxexxeeexeeeexexxexxxexxxeexxexxxxxeexxxxeeexxexexxeeeeexeeeeexxexxxeeexexeeexxeeeeexxxxeeexxxxeeeeexeeeeexeexxeeeeexxxeeexxxeexexexxxeexeexexeeeexxeexexxexeexexeeeexexxexexxxexeexxxxxxxxxxxeexxeexxeeeeexeexxexeexeexeeexxxexexxexeexxeexexexxexxxeeexeeexxexxxeeexxeeeeexeeeexxeeexexxexeeexxxxexeeexxeeeeeexexexeexexeexeeeeeexexxexeexxeexxeeeeeeeexxxxxeeeexexexexxxxeexxxxeeexxeeexxeexxexxxxexxxxxeeeexxxeeeexxeeexeeeexexexexxxeexeexxeeexexxxxxexexxexexexexeeeeeexeexeexeeexeexxxxxxexeexeexxxxexeeeexxeexxxxexexxexxxxeexexexxxexeexeeexxxeexxeeeexxxexxeexeexxxxexexxxexxxexxexexeeexxexxxxxeeexeeexexeeeexxxxexxeeeeexxexxeeexxxeexexxeexxxexeeexexexxeexxxxxxxeeexexxxexeexeeexexxexxeeeexeexxxexxeexeexexexexeexeexxeexxxxxxeexeeexxxexxeexexxxeexexxxeexxeexeexexeexxxexxexxxxxeexeeeexexeeeexexexexeexxxeeexxxexxxxxxexxexeeexxxxxxxexxxxxexeeeeeeeexeexeeeexxeeexxeexxexexexexxxxxexexexeexxxeeeeeexxxxeeexxeexexxxeeexeeeexxeexexeexeeeeeexexxxxxexeeexeexxeeexeeeeexxeexxexexxxxeexexeexeexxeeexxeeeexexeeeeexexexeexxeeexxexxxexxexexxxexxexxeexexxexxxxexxeeeeexxxeexeeeeeexxxeexxexexexeexexexeexexeeeeeexeeexeeexxxxexexeeexxxexexexxxexxxeexeeexexxxeexeexxeeexxexexeeeeexxxeexeeexxeexeexeeexeeexeexexeexxxxxxxxexxxxxexxxeexexexxeexexxxxxexxxxeeexxeexeexeeexxexxeeexxeeexexeexxxeexxxeeeexxexexxexeexexexexeeeexxeeeexeexeeeexexeeexexexxxeeexexexxxxeeeeeexxeexeexexexxexxeeeeeexxexxexxeexxexexexexeeexxexxxeexxeexxxxeexeexeeeeexxeeexxeexxexxxeeeeexeexxexexxexxexeeexxxexeeeexeeexxexeeexxeexxeeeeexexeexxeeexexxexexxxxxxeeeeeeeexexeexeexxxexexeeeexxxexeexexexxexeexxexxexxexexxxeexexeeeeeeeeexxxxexxxxxeexxxxexxexxeeeeexxxxxexxeexxxexeeexeexexeeexxexeexeexexxxeeexexeeexeexexeeexxxeeeexeexexxxeexxxeeexexxxxxxexeexeeeeeexeeeexexexxeexeexxeeeexexexxxeexexeeeeeexxxxeeexxxxxeexxxeexxeexexxexeexxeexxxexeeeeexeeeexxeexexeexxexexxeeexxxxexeeeeeeeexxxexeeeexeeexexexeexexxeexexxeexexxexeexxexexexxeeexeexeeexxxxeeeeexxeeeeexeeexxeexexxxexeexeeexxxexxeexxxeexexxeexxxxxxeeeexxeexxexxxexeeeeeeexexxexxxexeeeeexxeeexxexxxxxxxxeeeexxexexeexxeeexeeexexexxxxexxxxxxexexxeexxexexxxxxeexxexxexxexeeeeexexeeeeexeexexexxeeexxxxxeexxexexxeeexxxexexxexexeexxxexxxeexxxxeeeexexxexeexxeeexexexxxexeeexexexeexeexxeexxeexexeeeexxxxeeeeeeexexeeeeexeexxexeexexxxxexexeeexeexxeeeexxxexxeeexxexexexexxxxeeexexxeexeeexxxxexeeeeeexxeeexexexxxexxxeeexxexxxexxeexeexxxxexeeexexxeeeeeexxxeexxxxexxexxxexxxexeexxxxxexeeeexxexeexexexexexxeeexxxxeexxxeeexxeexexxeeeeexxexxxexxeeeexeeexeeeexexxexeexexxexxeeeeexeeexxeeeeeexexexeeeeexeeexxeeexeeeeexxeexeeexeeexexxxeexeeeeexeeeexxeexexxeexxxexeexexxxxeexeeexxxexexxxxxxxeexeexxexeeexxxexexxeeexeexeeeeeexeeeexxeexxeexxexxxxxxxxeexexxxexxexxxxxexxexexxxxeeexexexxxxxxexexxxxxxexeexeeexexeexeeexxxxexexeeeexexexeeexeexeexxexxexxeeexxxxxxexxxexexeeeeexxeeexxxexexxxeexeexexexexexxxexeeeexexeexexxexxxexxxexeexxxxxeexexeeeexeeeeeexeexxeeeexxeeexexxxexxeexeexexxxeexxxxeexxxxexxeexxexexexeeexeexexeexeexexexxexxxexeeexeeexeexxeexxeexexexeeeeexeexxexxxeeeexxxexxexxxeeexeeeexxxxeexxeeeexeexxeeeeeexexxxeeeeexxxxxxxexxxeeexxexxeexxxxxexxxexxxeexeexxxeexexxxeeexeeeeexexeexeexxeeeexxxexeeeexxxxexxexexeexexeexexxexxeeexxxxxexxexxeeeexxeeexexxeexxxeeexeeexeexexxxeexxxexxeexxexxxeexxexeexeeexexxxexexxxxeexexxxexeexxxxxeexxeexexexexxexxeexxxexeexxxxxxeexexexxeeeeexxxxxeexxeexxxxexeexxxxeeeeexexxxexxxexexxexxeeexeeeexxxexexexxeeeexxxxeeexxxeeeexxexxexxeeexeexeexeexxxxexxeexxxeeexexxeeexxxxexeexxexeexexexxeexxeexxxxeexexxexeeexeeexxeexxeexexeeexexexxeeeeexxxxxexxxxxeeeexexeeeeexeexxxexeexxexxxxeeeexexxexxxexxxexxxxxxexxxeeexxexxxxexxexexxxxxxexexxeeeexxxeexxxxxexxexexeeeexeeexeexxeexexeeeeexxexxexexeeeeexexexeeexxexeexeeexexexxexexxeexxeeeeeexxeexeeexxexexeeexxexeeeexeexexeeeexxeeexxxexexxexeexxxxexxexexexeexxxxxexexeexexeexxxexxxeeeeeexxxexxexeexeeexxxeeexexexxxeeexxxeeeeexxeeexxxxxxxeeeeeexeeexxxxeeeeexeexxxxxxexexxexeexexexexeeexxxxeeexexxexxxeeexexexxeeexeeexxexxeexeexxexeexxxxxeexeeexxeexexxeeeeexxxxxxxeeeexxxexxeexexxxxxexeexxexeexeexexexxexxeexxexxxxeeeeexxexexxxeexxxxxxxeeexxxxxxexeeexexeexeeeeexxxeexexeexxxxxeeeeexeexeexeexeeexexexeeexeeeexxxxeeexxxexexxxxxeeeexxxexexexxeexxxexexexeexexeexexexexexxxxeexxeeexeexxeeexexxexxexeexeexxxexexxexeeexexxeexxexxexxexeexxeexexeexxxeexxexxexexeeexeexeexxeexexeexeeeeexexxxxxxxexxeeexxxxxeeexxeeeeexxxeeeeeexeexxxeeeexxeeexxxexexeeexeexeeexeeexexexxxeexxxxeexxexxexexxxxxeeeeexeexxxxxxeeexeexeeexexexxexxexxeexexxeexexxxexeeeeexxxexxexeeeexeexxxxexexeeeeexxxxxexxxexexxxxxeeexxeeexeexeeexexxexexxexeeeeeeeexexeeexeexexxxexexxxxexxxexeeexexxexexxxexexeexxeexxexeeeexeeexxxexxeexxexxxxxxexxxxeeeeeeeeeeexxxeexeeeexxxexxxeexexexxxxeexxeexxeeexxxxexeeeeeeeeeeexexeexxexxxexxxxeeexeexxexxexxexxeexxeexxxeexexxxxxexxxexxxeeexeexeexxxexxxxexxxexxxxxexeexexexexxxxeexxxeexeexeexxxxeexxeexxxxxxxexeeexxxeexexxexxxeexxxxeexxeexexxxeexexxxeeeeeexxeeexxxxxxxexeeeexexexexxxeexxxexxeexxeexxxxxexeexxxeexeexxxxeeeeexxexxxeeeeexeexxxexeeeeexxxxxxxxexxexxexxeeeeeexexexxxeeeexeexexxxexexxeexxexexexexxxeexeexeeexxexeeexxxxxxxxxxxxxxexxxxxeexeexxxexxexexxxeexeeeexxexeeexexxeexxxxxxeexexexxexexexxxxexxxxeexexxxexexxexxeeeeexxexxeeeeexxxeexxexxeeeexxxxxexexxxexxxeexxexxxeexexexxxxeeexeeeexxeeeexxxeexeexxxxexxexxexexeeexeexxeexexxxxxxeeeeeeeexxxexxexeeexexexeexexxxxexexxexxxexxxexxxexxeeexeeeexeexxxexxxxxxeexxxexexeexexexxxxxxexxxeeexeeexeeeexexxeexexexeexeexeexxexeeexeeeexeexexxeeexxexeexxxexexxeexeexxxeexeexxexxexxeexxeexexxexeexexxeeeeexeexexxxxexxexxexeeeexxxeeeeeeeeeeeexxeexeeexeexeexexexeexxxeexxxxexexexxexexeexxxeeexxxexxxxxxxxexexxeeexeexeexxxexeexxxeexxexeexxexxeexxeeeeexxeeeeexxeeeeexxxeexexeeeeeexxexxxeexeeeexeeeeeexxexeexxexeexxeexxxeeeeexexexxexxxexxeeeexxxeexxeeeeexeexexxexeeeeeexxexexxxeeeexxxxxexxeeeeexexxxexeexxxxxexexxxexeexxeeexxxxexxexexxxeexxexxxxexxxeexeexxeexxxeeexxxxexeexxxxxexxxeeeexxeexeexxexxxxeexeexxexxexxxxexxxeeeexxxeexxexxxexxxexxeexexeexxeeeeeeeexeexxxeeexxxexeexeexexxexxxeeeexxeexxxxexeexxeexxexexxexexxxeeeexxeeeeeexeeexexxexxexeeeexeeeeexxexxxxexeeexeexeeeexxxxeexxxxexxxxxeexexxxeeexeexeexxxeeexxeeexxexexxeexexxeexeexxeeeeeeeeeexxexxxxxxexxxexeeeeexxeexexexxexeexxexxxxexxxxexxxexxxxeexxxeeeeexxexxxxxeeexexexexxeeeexxxxxeeeexexxxxeexxxxexeeexexexxxexeexxeeeeexexeeexeeexxeeeeexeeexeeexexeeexxxxxxxxxeexexeexxeexxexxexxexxxxeeeeeeexxexxxexxxexexxexeeeeexxxeexeexxxxxxexxxxexexxxxxexexxeexxeexexxxeeeexexxexexexxxxeexexxxeexxxxeeexxeexxexxexxxxeexexeexeeexxeexeeeeeeeeexexxxxxxxeeeeeexxexeeeexexexxexxeeeeeexeeexeexeexxxexxxxxxeexeexxxxxexexeeexexexxexxeexexxexeexeeexeeeexxexexxxxexeexxxeeeeeeeeeeexxexxxeeexeexxexxeexxexeexexeeexxxxxxxexexxxexxxexexeexxxxeeeeexxeexexeeexeexxexexexeexeexxxexexeexxexxxexexxeexxxexxxxxxxxexxeexxeeeeexexeexxeexexxxexxxeeeeexeexeexxeexeeeeexexxxeexxxeeeexeexxexxxxxeexeexxexexexeeexexxeexeeexeeeexxxexexxexxxxxeexxxexexxxeeeeexexxexexexxexexeeeeexexxxxxxeeexeeeeexxxexeexexeeeexeexxxxxxxexxeeexexeeexxeeeeexxxexeexeexxxeexexxeexeexeeeeexeexxxeeeeeeeeeeeeeeexexexxxexeexxxeexeexexxeexexxexexxeexxeexexexxxeexxxxeeexexxxxexxeeexxxeeeexxexxxxeexxexeeexxeexxxxxxxxeexxeeexexexeexeeeexxexxxeexeeexxxeexxxexxexeeeeexexeeeexeeexexxexxexxxxeexeexeeexexxeeeexeeexexxxeexxexexeexexeexxxeexexeeeexxeexeexxxeexxexexxxexxxeexeeexeexxeeeeeeexeexxexeeexeexxeexexxeexeeeexexxexeeeexxxxxeeeeeexexeeexxexxexexxeeexxxexexxxxxxxxexxxexxxxxxexxxeeeexeexeexxxeexxeexeeexxeeeexxxexxxxeexxexexeexxxeexxxxeexeeeexxeexxxexxxxeeexxeexeeeexxexexxexxxxxeeexeeeexexexxxeexxexexeexxexeexeeeeeexexxxxeeeeexxxexeeexxxxexexxxxxxexexxexeexexxeexxxxeeeeexexxeeexxeeeexxexeexxxexxeexeeeexxexxexxxxexxxeeexxxxxxeexxeexxexxexxexeeeexeexxeeexexxxxxeeexexeeeexexeexxexexxxexexxexeeeeeeexxeexxexexxeexxeexeexexexxeeexeeeeexexexexxxexxeexeeexexxxeeeexeexexxxxxeexexxexxeeeexxxexxxxxeexeeexeeexxeeexxxxexexxeexxxxxxxexexexxxxeexeeeeexxxexxxxexeeeeexxeexxexxxeeeexeexexxexxxxexxeeeeeexxxexeeexexeeexeeeeexeexxxxeexexxxeexeeexexxexexxxxxxxeeexxxexxxexxexeeeexxxexxxxeeexeeeexxeeeeeeeeexeexeexexeexxexeexexexxxxexexexxexexxexeexeeeeexexxxxxeeexxxxxxxxexexxexxxxeeeexexexeexxxxxxexxeexeeexxxeexxxeexxxxeexexxexxxexeeexxxxeexexeexeexxeeeexxexxxeexxexexexxxxeeeeexeeexxxxxxeeeexeexxxexeexxxexxxxexxxxxxxeeexxexexxexexexxeexexxexexexexxeexxexxxexexeeeexeeexxxeeeexxexxxxexxxxxxexeexexeexxeexexxexeexexeexeeeexeexxeexeeeeeeeexxexxeeeeeeeeeeeexxeexxxxxxeexxexxxxeexxxexxeexxxxxxxxexeexeeeexxexexxeeeexexexxxeexexxxexxeexxeeeeeeexeeexxxeexeeeeexxxxexexxxxexxxexxeeexeexexeexeexxexexxexxexexeeexeexxexeeexexxexxxxeeexxxexeeexexeeeeeexeexxexeexxeeexxxxeexexxexexxxeexexeexexxeeeexeeeeeexexeeexxxexexxxexexexeexxxeexxeexxxxxxeeeexexeeeeeexexexxeexeexeeeeexexeexeexxexxxeeexeexeexxxexxeeeexexexxxxxexxxeeeexeeeeexxxxxexxxxexxxxeeeeexeeeeeeexexxxeeexxxxxxexeexxxexxxeeexexexxxexeexexeeexexxexeexxxexeeeeeexeexxxexeeeeexxeexxeexeexexxxxexexexexexxxexxexxxxxxeeeeexeeeeeeeexxxeexexeexxeexeeeexxexxexxxexxexxexxxeeexeexxxexeeexxxexexeeeeexexxexxexxxexxxeeeexxxeexexxeexeeexexeeeeeexxexeexxxxeexxeexxexeexxeexxxxexxxeeexeexexxxxeexeexexexeeeexexxxxxxxxexxeexeeexxeexxeexxeeeeexxexxeeexxexeexxxeexxxeeeexexexeexeeeexexexxexeeexxxeeexexeexexexxxxxxexxexeeeexxxexxxxxeexxeeeeeeeeexeexxxeeexeexxxxexxexeeexexexexeeexexeexxxeexxeexxxxxexxeeexexxeeeexeeeexeeexexexxeexeeexxxxexxexxeexexxeeeeeeeexexxxeexexeexxxeexexeexeexxeexxxxxeexeexeeeexeexxeexeeeexeexxxxxxexeexeeexexxeexexxxxxeeexxexexexxxexeeeexeeexxeexexxexexeexexxeexxeexxeeexxexeeexxxexxexeeeeexxxexxxeexxexxxeexeeeeexxxxexeeexxxxxxxexeeeexeeexxxxexxxexexeeeexexeeexexxxxxexexxxxxexexxxeexexxexxexeeeexxxeeexeexxxxeexeexeexxeeexxeexeeexxeeeexxeexxeexxxxeeexxxxexexexeeexxxxeeeeexexeeeexexxxxxexexexexeeeexxeeexeeexxxeeeeeexxeexxeexexxxxxxxxeeeeexxxxxexxexxxeeexeeeeeexxxxxxeexexxexxxxeexeexxxeeeexeeexxeeexexexxeexexeeexexexxxeeeeeeeeexxxxxeexeexxxexeeexexexxeeeexxeeeexxexxexxxexeeeexeeeeexeeexxexeexeeexeexeeeeexxxxeeeexxxexxeeeeexxexexxexeexxeexexeeexxeeeexxexexexxeexxxxeeeeexxexexexxxxeexxeexxxexeexxxeexxeexxexxeexeexeexxxeexexeeexexxexxxexxxeexxxexeeexexexxxeeexexxeexeexeexxexxexexeexxeeexxeeeeexxeexexeexxxxeexeexeexeeeeexxxeeexxxexxexeexxeexxxexxexxxexexexxeeexexeexexxeexexexxxexxxxexexxxxexeeexexexxxxexeeeexeeexxxexexxexxeexexxxexeexeeeexeexeeexxxeexeexeexxexxeeeexxxeeeexxeeexxeexeeexexexxeeexeeexxxeexxxexexxexxxxxxxeexexxxeexexxxexeexxeeeeexxeexeexexeexxxexexxexxxexxexxexexxexxxxxxeeeexxxxeeeexxxxexeexxxexxxeeexeeeexxxxxexxxexxeexxxeeexxeexeeeeeeeexexexexxxxxxxxeexxeexxxeexxexexeeeexxxxeexxexxxexxexxeeeexxxeexeexxxexxexeeexexeeeexeexeeeeexxeexxeeeexeexexxxxeeeeeeexxxxeeeexeexxeeeexeexxeexxxeeexexxeeeeexxxexxeexxeexexexexxxxxxexexxexexxexexxexeeexeexxxeexexexxxexxxeeexxexxxeeexeexxxeexeeeeeeeexeeeexexxeeexxxxxeeexxxexxxexeeexxxxxxeexeexexxexexexexexxeexeeeeexexeexexxeexxexeeeeexeexexexeeeeexeeexeexeeexxexeexexeexxeeeexxeeexeexeeeeexxxxeexexeeeeexeexxeeeeexxeexxeeeexxxexxxexxxeexexxeeeexxeexxxxxxxxexxexexxxeeexxeeexxexxxexeexxeexexxexxxeexxeexexeeeexxeeeexeeeeeexexxeeeexeexexxexxxxxeeexeeeexxexexxeexxexexxxxeeeeeeexxexxxexexxxxexexxexxxxxexeexxxeexxxxxxxeeexxxxexexxxeexeeeeeeeexxexxxxeexxxeeexxxxxexeexxeeexxxexexxxeexeexexexexexexexeeeeeexeeeexxexxeeexxxxexexexeeeeexxeexxeeeeexxxeexexeeeeeeexxxxxeeeeexeexexxexexexxexxxxeexxeexxexxxexeexxeexxeeeeeexxxexexxxxxxxeeexeexeexxexexxeeeeexexeeexexexeexxxeeexxxexexxxxeexxeeeexxexeeexeeeexexxxeeeeeexxxxexxxeexexxeexeexxxeexxxxxeexexxxexxxexxeeexeeexxeexexexeeexxeeeexeeexxeexxxxeexxxeeeeeexxxxexeexxxxexxxxxxxexexxeexxxxxxeexeexeeeeexxxexexxxexxxexexexexexexxxxeeexxexeeexxeeeeeexxeeeexeeexexxeexxxxexeexeexxexeexexeeeexxeexeeeexxxexxeexexexeexxxxeexxxexeexexexexxxxxxeexeexxxxxxeexxxxeeexexexxxxexeeeexeexeeexeeexexxexxexexeeeeeexxxxeeexxexxexxexexxxxeexexxxexeexxxxeexexexxeeexexxeeexxxexeeexexxxexexexxeexeexxxxeexxxxxxxeeexxeexeeeeeexexxeexeexexxxxxxexxxexxexxxxeeeexexexexxxeexxxxxeexxeeexxeeeeeexxexxxeeexxxxxxxxexexeexexexexxexxexeeexxxxeeeexexeexxeeexexxexxxexexxeeexeeexeexxexxexeeeeexxxexexxxeeeeeeexexxxeeeeexexxeexexxexeeexxeexxexexeexexxxeeeexxeexeeeexexexeexeeeexeeeeexeeexexeeexxexexxxxxexxeeexeexexxxxxxxexexxeexexxxeexxeeeexexxexxxexeexeeexexxeeexxxxexeeexxxeeeeexxxeeexxxxexxxexeeeeexxxxeeeexxxxexeexexexexxexxexexexeeexexxxexeexexxxxxxxeexexexxxeexxxexxexxeexeexxexeeexxxeeexeeeexeexexxexexexxeeexxxxeexxxexxeexxxxxxeexeexexeeeeexeeeexxexeeexxxxxxxeexexexexxxexexexeeeeeeeeexxxxexxeexxxxeeeeeeeeexeeexxxexxxxexexeeexeexeexexexeexexxxexexeeeexxxxxeexxexeexexxeeeexexeexeexxxeexxxxxexexeexxxeexexexexeeeeeeexxexexeexxeeexexxeexeeexeexxexexexxxxeeexexxeeeeexxxeeeeeeexeeexxxxxxxeeeeeexeeeeeeexeexexxxxeexxxeeeeeeexexexexxxeexeeexxxxxeexxxeeeeexxxeexxeexeeexxeeeexexeexxeexxexeexeeeexeeeeexexeeexeexxxxeexxeexeeeexeexeeeeexeexxexeeeeexxeeexeeexexxxxxexxxxxxxxexxxxxxxxexxeeexeexeeeexeeeexxxxxeeexeeeeeeexeeexxxeeexxxxxeeexxeeeexexeexxxxeexeeexxxxeexexeeexeeexxexexxxexexxexeeeeexeeexexxeeexxxexexexeexexeexxexexeeeexxexexeexexxxxxxeexxeexexexxeexxexxeexeeexxexexxxxexeeeexexexxxeexxeeexxxxexeeeeeeeexeeexeexxxexexxexexeeexexexexeexxeeeeexxeexxxexeexxxeeeeeeexxxeeexeeeeeexeexxxxexxexxxxxxexexxxxeeexxxexxxexxeeexxeexxxxexxexexxxxxeeeeeexeexeexexxeexxeexxxxeexxeexexexexeexexeeeexexxeeexxexexxexexeexexexeexxexexxexxxeexeexxeexexeexxxeexeexxexeexeexxexxexeeexexexxxexeeeexexxxxexxexxexxxxxexeeeexexeeexexxexexxexxxexexxeexxeeexexeeexexxeeeeexexeeeeexxxeexxxxxxxexexxxxxeeeeexxeexxeeexxxeexexexxxexxeexexexexxxxxxeexxxexxexxeexxxeexxxxeexxxexexxxxexxeeeexxxxxxeeeeexexeexeeexexeeexxeeexexxxeexxxeeexxxxeeeexxxxxxeeexeeeexeexxxxexeexeexxxxxxeexxxxexeeexexxeeeeexxxxxeeeeexxeexxeexeexxeeexxeexeeexxxxeeexxeeexexxeexxxexxeeeeexeexexxexexeexexxxxxxexeexxeexexexexxxeexxxeeeeeexxeexexeexeeeexxeeeexeexxxxeeexxxxexeexeexeexxxexexxxxeeexxeexeexxexexxeexexeexxxeexeexexxexxexeeeeeeeexeexexxexexxxxxexeeeexexexeeeeexeexexxeexeeexxxxeexexexxeeexexxxxxexexexexxexeexeexxexxxexxexxxexexxexexexxeeeexxeexeexxxxexeexxxxxexeeexeeexexxxeeeeexeeeeexxeexexeeexeexexeexxxeexeeexxxeeexexxexeexxexexexxeeexeexexexxxexexxxexxeeeexxxxxxxeeexexeexeexexeexeeeexexexxeexeexxexeexxxeeeexeexxxxeeexxxxxxxexxexeexexexexxxxxxxxeexxxexxexxxxeexeexxexxxxeexxeeexxxeexeexxexxexxxxeexxeeexeexxexxxxexxxxxxexxexxxxeexxxeeexxeeexxxxxxxeexeexeexexxeexeeeeexxexeexxxeexxxxxxexxexxexeexxxeeeexxxeexexxxxeeeexeeeeexeexxxxxeeeexxxeeeeexeeexeexxxxxxexxexeeeeeexexxxeexeeexeexeeexexexeexxxxexxxeeeexexxxexexeeeeexexeeeexeexxxexxeeeexexxeexeexxeeexeexeeexxexxxexxexxeeeeeeeexxxexxxexxeeeexeexxxxexexxeexxexexxeexxxeeeeexxeexxxxeeexxeeexxeeeexxxxexexeexexxexeexexeexexeexxexxxeexeexxexeexexexexeeexxeexeexeexxeeeeeeexxexxxxxxxexexexeexxeexxexeeexxxxxxexeexexxeexxxxxxxeeexxexeexeexexeexeeexxxxexxxxxxeeeexxxexeexeexxeexexxeeeeexexxxxexexxexeexexeeeeexexeeexxeexeexexxexxeexexeexeeexeeexxeexxxxexxexexexxxexeeexxexxeeeeeeeexeexeexeeeexeeexeeexexxxxxxexxeeexeexxxexexexeeexexxeeeexeexexeexeexexxxeeexxeexexexxeeexxxxeeeeeeexeeexxxeexexxeeeexxxxexxeeexxxexeeeexxxxxxexexxxxxexxeexeexxxxeeeeexxxexxxxeexeeeexxeeexxexeexxxxxeeexxxeeeeexexxeexeeexexxexxeexexexxeexxxxeeexxxeeeexexexxxexeexxxexexxeexxeeexeexexeeexexxeeexeeexeexxxexexeexeeeeeexexexxxxeexexxxexeexxxexxxxexxxexeexexxxeexxeexeexeexexexexxeeexeeeeexexxxxxexexexeeeexxexxeexexexeexeexeexxexexeexexexexexxeeexexxeexeexeexexexeexxeexeexeeeeexeeeexeexeeeeeeeeeeeeeexexxxexeexxeeexeeeexxxxxxxxexexxeexxeeeexeexeexexxeexeexxxexexxexexxxexxexxxxxxeeeexexxeexxeexxxexxxxxexxeexxexexeexexeeeeexexeexeeexxxeeeexxxeexexxeeeexeeeeexexxxxxexxexxxxxexxeexeeeexxeeeexeeeeexxxxexxexeeeexxxxxexxeeexxxexexxexxeexexeexxxeexxxeexxeexeeexeexxeeexeeexxexxxeeeexxexxeeeexxeexeexexxxeexeeeexxexeexxexexeeeeexxeexexexeeeexxeexexxexxexxexxxexxxxexxxxxxxxexeexeexxxxxxxeexexexxeexexxxexxexeexeexeeeexxxeexxxxeeeeexexxeexxxexeeeeeeeeeeeeeeexeexeexxexxxxeeeeeeeeeexexxeeeeeexexeexeexeexxexeeexexxxxexexexxxxxxxeexxxeeeexxxxxexexeexexxexxeeexxxeexeexxxxexeexeeeexxeeeexxxxxxeexeexexeexeeexxxeexxxxxxxxexxeexxxeexeexeexexexexxexxxeeexexeexxxeeexxeeeexexexexxexxeeexexxxxeeeexeeexeexxexexxexxxexeeexexexxeeexeexeexexxxeexxxxexeeeeeeexexxeeexeexeeeexeeeeexxeexeeeexxxexxxxxeeexxxxeeexxeeexxxxxxeexexxxeeexxxxexexxeeexxexexxxxeeexxxeeexxxexxeexxxxxxeeeexeexxxxeexxxeeeexeeeexxeexeeexexeexeeeeeexexxxxexexexxxeexeeexxxxexeeexxxxxeexxxxexxexxxexeeexexxeexxeeeexeeexxxexxexxeeeeeexxxxxxeeeeexeexxexxexxxeexxxxexeexexxexeeeexxxxxxxxeeexxxxexexexxxxexxxeexeexexeeeexexxxxexxxxxeeexxeeexxxeexxxxexxexxexxxexeeexexxeeeeeexxxexeexeexxxxxxeexxeeexeeexxeeeeexexeeexexxeeeeeeexexexeexxexxxxxexxxxxxxxexexxxexxexeeexxeexexxexxxexexxxxxxeexxexeeeeeexeeexxxeeeeeeexxxxexxxxexexeexexeexxeeeeeexxeexeexxexeexxxexxexxexexeeeexxexxeexeeeexexexexeexxxxxeeexxexexxeexexexxxeexxxxxxxexxexeeeexxexexxexxexexexxxxxxexexexxexeeeexxexexeeexxexexeexxexxeeexexxxxxexxexxeeexeexexxexxexxxxexxexxeexxxexxeexeexeeeexxxeexeeeeeexxexeeexexeeeeexeexxxexeexxeexxxexeeexexeeexxxeexxexexexeeexeeexeeeeeeeeeexexexexxxxxexexxeexxexxxeeexexxxexeeeexeexeexxeeexexexeexeexeexexeexxxxeexeeexexxexeexexexxxxeeexexxexexeexeeeeexeeeeexxxxexeeexexxexeexeexeeexeeeexxxxxeexxxexxexeexxxxxeeeeexexexxeexxeeeeeexxeexxxexxexexxxeeeeeexeexexexeexexeeexeexxexeexxxexexexeeexeeexxeexxxeeeeeeexxeeeeeeeexxxexexeexxxexeeeexxexxexexexxeexeexxexexeeexxexeeexxxxxxeeexeeeexxeexxxxxexxxexxeexxxxxeeexeeeexxxxeexexexxxeeexxxxexxxeexeexexxxeexxxxxxxxxeeexexexxxxeexxexxxxxeexeeexxexxxxeexexxxeexxeexxeeexxeeexexxexexeexxeeeexxxeexxexeeexeeeeeexxeeexexxxxexeeeexxeeexexeeeexexexxxexxxxeeeeexxxexxxxxeexxeexxeexexeeeexxexeexxxxexexxexxeexexexeeeeexexeexeeeexxexxxexxexxexeeeexeeexxeeeeeeeexxxexeeexeeexxxeeexexxeexexxeexeexexxexxxeexeexexexeeeexeeexexxxxxxxxxexxeexeeeexeexxexxexxexeexexxexeeeexexeeexexxexexxexeeexxexexxexxexeexexeeeeexexexeexeexexxxxexxxxexxxxxxexxxeexxxeexexeexeexxexxxxeexxeexeeeexxeeexxxxeeeeeexxxxexexeexexxeexxxxxxxxexxeexexxxxexxeexxxexeeexexxeexexxxeexeexeexexeeexexxeeeexexxxxxeeexxeexxeeexxeeeeexeeeeeexxxxxeeexxxxxeexxxxexexeexeexxxxeeeeexexeeeexexxxxxxeexexxxeeeexexeexeexeexeeeeeexxexxexxxxxxxxxxexxeeeexxxeexexexexeeexeeeeexxxxxxxeexexxeexxxxexexexxexxexeexexeeexeeeexeexexexexxxeexxeexeexeeexxxxxeexexxxxexxexeexxxxeeexxxeexeeeexxexxxeeeeeexeeeeexxeexxexeeeexeeexxeeeeexxeeeeeexxxexeeexxexxeexxeeexexxexxxxeeexxexexxeexexexeexxxxeeeeexeeexexexexxexeeeeexxexeexxxeexexexeexxeexexxeeeexeexxxeexxexeeexxxxxeeexxxexeeexexexexxeexeexeeeeexexxxexxexexexxeeexxxxxeexeexexxxeexxxxxexeexxexexeeexxxeeeexeexeexeexexxxxxexeexeexxeeexexeexeeeexexxexxeexxxeeexxeexexexexeeeexexxxxxxexxeeeeeeeexeeexxxxxxeeeexxxeexexeeeexeeeeeexexeeeexxexxxeeeeeexxexeeexxxexexxxxeeeexxxexxeeexeeexxxeexexexeexexxxexxxeexexexeexexxexxexxxeeeexxxeexeeeexexxxeexeeexxxeexeexxexeexexxxxxxeexexxxxeeeeexxexxeexexexxeexxxeeexxxexexxxxexxeexxxeeexxeexexexeexxxxxeeexxxxxxxxexxeeexxxxexxexexeeeeexxxxeexexeeexxexxeeeexxxeeeexxxxexxexeeexexexxexeeexxeexxxxexxexexexxxxexxxexxexxexxxxexeeexxxexexexeeeeeeexxxxxeexxeeexexxxexxxexxeexxexeeeexexxxxexexxexxeeexxexexexeeexxxeexxxxxxexxeexxxexxexeeexxexxxeexxeeeeexexeeexxxeeexexexexeeexxxxexxexxeexxxxxxeexxexxxxxxexeexxexxexxeeeexxexeexexxxeexeexxeeexexxexexeexeexexeeexxeeexxexeexexexeeeexexxeeexexxeexeexexeeexexeexeexxxxexeeeexxeeexxeeexxeeexxxxxxeexxexexxeexeexexxxxxxexxxxeeeeexeexxeexxexxxeeeeeeeeeexeexxxxxxxexeeeeeeexxxexexxxeeeexxxxeeeexeeeeeeexxxexeeexeeeexxxxexxeexxxeexxxeexeeeeexxexxxexxxexxeeexxxxxxxxexeexxxeexxxxxxeeeexxxeexxxxexeexeeeeeexxxexxxxeexxxeeexexxxxxeexxeeexxxxxexxeexeexxxxeeexexexexxxeeexxeeeexxeeeeeeeexxxxexeeexeeexxeexxexeeexxxeeeexxeeexxxxxxxxeeeeexxeexxxexexeexexxxxeeexeexxxxxxexexxxeexxeeeeeexxxxxexexxxxxeeexeexxeeexxexxeeeexxexeeexexeeeexexeeexxxxxexexeexxxxxeexxexexeeexexxexxxxeexxeexexexxxeexeexeeeeeexxxexexxxeexeexexxxeexeexexeeexxeexeeexeexexexxeeeexxxeeeexxxexxxeexexeexxxxxexxxxxeexxxxxxexexxxxxxxexxxexxexxxeeeexxeeexxxxxxeexeeexxxexexxxxeeexxexexexeeeeeeeeexeeeeeeexxxeeeexxeexeeeeexxxxeexexeeeeexeexeeeexexxxexexexexeeexxxeexxxexeeeexexexeexxxeexexexxexxeeeexeexxxxexxxexeeeeeeeeexexexeexxexxexexxxxeeexxexxexeeexxxxxxxeeeexxexeeeexxxeeeexxexeexexexxexexxxxxeeexeexeexxexexexeeexxexxeexexeeexxxxxxxxeeexeeeexeeexxexxexxeexexxxxxxxxeeexxexxxxexeeeexxxexxxeexxxxxxeexeeeexeeeeeeeeexxxeeexxxxexxexxexxxxexeeexxxxexeeeexxxexeeexexxexxeeexexxexxxexeexexxexexxxexxexxexexeexxxxexxexxexxeeeeexexxeeeeexeexexxexxeexexexxexxexexeexexxxxexexxeexeexexxxexxxxxeeexeeeeexxxexexeeeexexxxxeexexxeeexeexexxxxexxexexxxexexxxeeexeeeexeeeexeeeexexxeexeexxeexxxeexexxxxexexeeeexeeexeeeexxxexxeexxxxxxeeexxxexexeeeexeeeexexxeeeeeeeeexxexxexxxeeexxxxexeeexxexxxexexxexxeexxxxxeeeexeeexxxeeexeeeexeeeexxxxexxexeeeexxxeexexxxxeeexeeeeexexexexeexeexeeeeeeexexexxxexexeexxxeexxxeexxxexeeeeexeeexxexexxexxxxxeeexeexeexexeexeexxeeexexeeeeeeeeexexexeeeeexeexxeeeeeexxexeexeexexeexxeeexxeeeexxexxxeeexexxxxexeeexxeexxxexeeeeeeexexexxexxexxeeeeeexxeexeexeexxexexexexeeeexexxxeeeexxxeeeeeeexexexexxxxxeeeexexxexeexexeexxxxxxeexxxeexxexxxexeeeeexeexxexxexxeeexxxexxeexxxeexxexexeexxxexxxexxxxxeeexexexxeeeexeeeeexexeeexxexxeexexxeexeexexeeeeexxexeexxeeeeeeeexxeexeeexexexexxxxxxxxxxexexexxxeexxeeexeexeeeexeeexxexxxeeexxeexeeeeeeexxxeeexexxxxxxexxeeexeeeexxxxeeeeeexexxxxxxxeeeeeexexexeexxeeexxexxeeexeeeexxxxeeeeexexxxexeexexeeexexxxeeeexxexexxexexxxxxeeexxeexexexxexxxexxxeeeeexeeexeexxxeeeeeeexxxxxexxxeexexxeexeeeeeeeexeeexeexxeeeeexexexeexxexexxeeexeeeeeexxexxxxexeexexeeeeeeexxexexxeeeeeeeeexxxxexxexeeeexeexxexeeexxexexxxexxxexxxxxexxexxxexeexexxeeeeexxeexexxxexxexxeeexxxxxxxeexexeeexexeeeeeeexeexxxxxxeeexeeeexxexxxeeeexexxexxeexxeexxxxeeexeeexxxexxxexxxexeexeexexeeexeeexexexxeexeeeexexxxxexeexxexexxxexeeeeexxeeexexxxxxxxexxxxxxxxeexxxexeeeeeexexxeeeexxexeeeeexexeeexexxxxexexxxxeeeexxxxeeexeeexxxeeeexexxxeexeexxxexxxxexexxexxxexxexxexxxxexxxxxeexxxeeeexxxexxeexxxxexexexxxexeexexexeeexeeexeeeeeeexxeexexeeexxxxeeexxxxxeeeeeeexeeeexxxxxeexexeexxxxxeeexxxxeeeexxexeexeeeeeexeeeexexxxexeeexexexxxexxeexeexxexeeeeexeeexexxeexeeeexexxeexeexexeexexeexeexxxxxeexexxeexeeexeexxeexxxxexeeexxeexeeeexeeeexxeeeexeeexxeexxxxxxexxxxeexexxxxexexxexxeexxexeeexxexeexxexxxeeeexxexxexxxexxxxxeeeeeexxxeexexxeexxxxexexeeeeeexexxeeeexeexexxxxexexxxxexeeexexxeeexxxexexexexeeexxexexxeexxxxxxxxxexxeexeexexexexxeeexxeeexexxxxxxxeeexxxxxeeeexexxxexxxeeeeeeeexxexxeexxxeeexeexxxeexxexexeeexexxeexxxxexxexeeeexexxeeeeexxexexxxeeexxeeexxxeexexxxexxxxxexxexxeeexexxxeeexeexxxeexxeexeeeexxxxxeexxexexxxeexxxxxexeexxxxeeexxxexxexexxeeeeexexeexxxxxexeexxxxxxxeeexeeeexxexeeeexexxeexexxexxexexxeexeexxxexxxxxexxeeeexexexexxexeeeeexxxxxxxeexeexexeexxxeexexeexxxeexxxxeexxxxxxexxexeexeeeexxeexxxxxeeexxxxxeexxeexeeeeexxxexeexxxexeexxeexexxxexxexxxxxxxxxexexexxxxxeeeexeexxxxexxeeeeeexexxexeeeexexexxxxxexxeeexxexxexexxexexexxeexxxeexeeeeeeexxexeexxxexexexxeeeexxeeeexeexeexexxexxxeexxeeexxxxeeeeexexexxeexeexxxexxeeexxexxeexxeexeeexxeeeexexxexexeexxxeexeexexeexxxxexxxxxxeexxeexexxexxxxxexxeexxeexeeexexxeeeeeexxxeeeeeexxexexeexeeexexxexeeeexxxxxexexxexeexxexxexxeeexeeeeexeeeexxexeeexexxexxxxxxeeeexeexxeexexxeeeeeeeexexxeexexeeexxxexeeexxeexeeeeeeeexexexeexexeexxxexeeexxeeexeeexxeexxxxexeeeexexxxxxeeexxexxexxxexeexeexeexxexexexexxeexeeeexxxexxeeexeexxeexexeeeeexxexeexeeeeeeeeexxexxxxeexxxxexxxxexxeexxxeeexeeeexxeeexexeexexxeeeexxxeexxeeexxeexxeeexxxexxeeeexxxxexxexxeexeexxexxeeexeexxxxexxeeexxeeexxxxxxxxxxxeeexxexeeeexexxeeeeexxexxeeeexxexexxxexxxxxeexxxeeeexexexexexeexexeeexxeexxeexxeexexexxxexxxeexexexeeeexexexxxxeeeeexeexxxxeeeeeexxxexexexxexxxxxxxxexexxexxxeexeexxeeeeeexeexexxxeexxeexeeexxexxexexexxeeexxexxeexexexxexeeeeeexexeeeexxxexxxeexexexeexeexeexeeeeeexeexeeexeexexxeexxxeeexexexxeeeeeeeexexxeexxexexexexexexeexexxxxexxxeexeexxeeeexeexexxexxeexeexexexxexexxxxeexxexxxxxxeexeeexxexexeexexexeexxexxeexxexeeeexexeeeexxeeexxeeexxeexeexxxexxexxexeexeexeexexxxxxexeeeeexxxxxxexexeexxeeeeeexxeeexxxexeeexeexxxxxxexxeeexxxexexeexexeeexexxexeeeexeeeexeeeeexeexxxexxexexxxxxxeexexxexxexeexeeexeexxxxxeexxxeeexexeexxexexeexxexexexeeeeeexxxeexxxxeexxeexexexeexxxexxeexxxxexeexeexxxxxxxxexexexexxxexexexxexxexeeexexexexexxexxxeexexeeeeexeeexeeeexeeeeeeexxeeeexeexxexxxxexeeeeeeexeexeexeeeexxxxexexxxeexexxxexxxxexexexexxxxxxxxexeeeeeeeeexxexxeeeexxxexxexexexxexeeexxxxxxeeeexxxxxeexxxexxexeeeexeeexeeeexxxxexxxxxxxxexxeeexxeeeeexeexexexexxexxxexeeexeexxxxeexxeeexxexexexxexxeeexexxxeexxexeeexexxxexexeexxxexeexxxeeeexxeeeexeexxxxxeeexxxexeeeexeexexxxxexeexeeeeeexxexxxxeeexeeexxexxxxeeeexxxxxxxxeeeeeexxxxeexexxxeeexxxexeexeeeexxexexxxeexeeexeexxxxxeeeeexxxxxeeeexexxxxxeexexxeeexexexexexxxxeeeeeexeeeexxxexexxexeexxxxeexeeexxxxexxeexxxxxxxxxexexxexexexeexxexxxexeexexeexexxeexxxxxeexexexxxxxxxxeeexeeexexxexexeexxexxxxexeexeeeeeexexxxexeeeexxeeexeeexxeeexxxexxexeexeeeexeeexxexxxxxeeeexeexeeexxexxxexxexxexxxxxeeexexeexeeexxxxexeexeeexxxeeeeeeeexexeeeexeeeexxxeeexexexeeeeeexeeeeeeexexxeexeexxexxexexexxexxxeeeeexxxeeeeexxxxxeexexxxeeeexeexeexeeeexexeeeeeeeeexexeeexxeeeexexxeeexxxxeeeeexeeeeeexxexxexxxexxexxxxxxexxeeeexxeexxeeexexexeeeeeexexeeexxxxexeexxeeeexxeeexxxexxxxxexexxexeexexxexxexexexxxxxxxxexexxexeeeexxxxeeeeexxexxxexxxexxeexxxeexxxexexxxeexxxxeeexxxxexxxeeexxxxxexxxxxxeexeeexeeexexeexeeeeeeexexeeexxxexeeexeexxxeexxexeexxxeeexexeeeexxexxxxxexexxxeexxxexxxeeeeeeexexexxxexexxxxeexxxexxexxxxeexexxxexxeeexxxxeexxxexxexexeexxexexeexexexxxeexeeexexxexxeeexexxxxexexexeexexeeeeeeexxeexeexxxeexeeeexexexexxxxeeeexeeeexxxxxxxxxxexxxeeexxexxeexeexexeeeeexxeeeeeexexexxxxxxexexxxexxxeexeexexexexxexeeexeeexxxeexxxexexeeeeexeeexxxexexeeeeexeexeeeeexxexxxxxexeexexexexeexexexexexexeeeeeexxexxeexeexeeeeexxxxexeeexxeeeexeexxxxxexxeexxxexexxxeeexeeeexxxxxexexeexxeeeexeexxxxeeeeeeexexxxexxxxeexxxxexeeeexeeexexxxxexxxexxexxxexxexeeeexxeeexxeexxexeexeeexeexeeexeeexeexexxexeeeexeeeeeeeeeexxexexxexxxexxeeexexeeeexexeexexeexeexxexexxxexexeeexeeeeexexxxxexexexeexxexeexxxeexeeexexexxxxexeeeexeeexexeexxxxexeeexxexxexeexeeexxxxeexeeexeexxxxexexexexxeeeeeexxxexexxexxxexexxexexeeexexeeeexeexexxexxxexxxexxxexexexexxxeeexxxxxexxeeeeeeexexeexexexeexxexxexexxeeeexxxexexxeexxxexxexxeeeexxxexexeeexxexxxexxxxexxxxxxexxxexxxxeexxxxexxxxxexxxxxexxxexeeeexxeexxxxxxexxeexxxeexexeexxxxeeexxexxxeexxeexexxxxexxexxxxexeeeeeexeexexxxexxeexxexexeeexexxeeeexexxxxxxeexxeexexxeexeeeexxeexxeexexxeeexxeexxxexeexexeeeexxexxxeeexxexeeexxxexxexxxxexexxxexeeexexxxxxexeeeexxeexxxexxexxxxxxxexxexxxexeexxeexeeexexeeeexeeexxxxxxexeexeexxexexxexxxexxexxexexxeeeeeexeeexxexexexexxexeexeexexxxeeexexxeexxxxxeexxxxeexxexeeexxexexeeeexxexeexeeeeexeexxxxxexxexeeeeexeeexexeexxxxeexeeeexexxexexxeexeexxexexeexexexexexxxxxexeeeeeeeeeexxeeeexeexeexxxxxeeexexeexxexxeexxxxxeexexexeexexexxxxeeeexexxxxxexxxxexexxxexexxxxeexexexexeeexxexeeeeeeeexxxxexexxexexexxeeexexxxeexeexxxxxeexeexxxxxexxexxxeeexxxxeeeeexxeeexxxexxexxexexxeexxeeexexexxeeeexxexxxeeexxeeeexeeexxxeeexexexxxxxxxexexxxxeeexxexeeexxexexxxeexxxxexeexeeexexeeexeexxeeexxxxxeeeexxexxeexexxxxexeeexxexeexxexxxxxxxeexeexeeeexxeeeexxexeeeexxxxeexxeexeeexexxxxxxeexeeeeeeeexxexxeexxxeexeeeexeexxxxeeexexexxeeexxexxxeeexeeeexeeexexexxeexxeeeexeeexexxxeexxeeexxexxxxexxexxxxexxexexeexxxxxxeeexeeeexxxxexeexexxeeeexxxxeeexxeexxxexxxexeexxexeexexxexxxxeeexxexxxexeeexxexxxxxxexxxexexxxxeexexxxexxexxxxexxeexxxexexexeeeeexexxxxxeexeeexxeexeeeexexxeeexexeeeexexxxxexexxexxeeeexxexxxxeeexxxxexexeeexeeeexxeexeexeeexxexxxeeexeexeexexexxxxxeeexeeeeexeexxxexeexxexeeeeexxxxexxeexexxxexeexxexxxxxeeeexxeeeexxexxeexeexxeexxexeeexxexxxxxexxeexxxeexexexxxxeexeeexxxxeeexxexxeexxexexexexexexxeexxxxexexexxexxexxeeexxexeeexxxxexxxexexxeexeexeexxxxxxxxxxeeeeexeexxeexxeexeeeeeeexxexxeexxxxxeeexeeeeeexexxexexxxeexxxxexxxeexxeexeeexxxeeexexeeeeeexxexeeeexxeexeeexxxeeeexeeexexexxeexeeexxxxxxxeexeexxxeexxxxxxeeexxexexexxxexxexeeexeexxxxxxeeeexexeeexexexxxexexeeexexxeexxexxexxxxexeexxxeexxxxxxexxeeeeeeeeeeeeeexxxxeeeeexeexxxexxxexeeexxxxeexxxeeexxxexxeexeexxxxeexxxexexeeexxeexeeeeeexexxxxxeexxeexxxeeeexexxxxxexeexxexxeexeeexeeexxeexxeeexxxxexxxxxeeeexexeexexexeexexexxxexxxexxexxxeexxexexxxexexxxeexexexxxeexeexeeeeeexxxxeexxxxeeeexexeeexeeexxexeeexexxxeeexexexxxxxeeexxxxeeexxxexxxxexxxeexxexxexexxxeexxxxxxeexxxxxxxxexexeexeexxxxeexxxexxxxxxeeexeexxxexxexxxxeeeeeexexxxexeeeeeeexeeeexexexxeeeexeeeeexeeeexxxexeeeeeexexexexexexeexeexexeexeexeexeeexxexxxeeexexxeeeexxxeeexexxexeeeeexexxxxxexexexeeeeeeeeeeexexexxxxexexexexeeeexxexeexxeexxxxxxxexeexeexxxexxexxexxxeexxeexxeeeexexxxexxxexeexexxeexexexeeexxexeeexeeeeexxxxexxxexexeeeexxeexxexeexxeeeeexxxxxxeeeeexexxexexxeexxxxxxxxxxxxxxxxeeeeeeexxxxxexeexxeeeeexxeeeexexxexxxxexeeexexeexexeexxxexexeexxxexeexeeexeexxxexeexexxexxxexeeeexexxexeexexxeexexxexxxxeeexexxeeeeexeexxxexxxeexexeexxeexxexexxexxexexexxeeeexxexxxxxxxxxxexeexxxexxxeeeexeeeeeexxxeexexeeexxeexeexxeexxeeexexexxeexxeeeeeexxxeeexeexexxxxxeeeexxeexexeexxxxxxexexexeexexexeeeexxxxxxeexxxexeeeexxxexexeeeexxeeeeeexxexeeexeexxexxexxxeeeexxxexeeexeeexxexexxeeeeexxxexxeexeeeexxeeeexexeexeeexeexxxxxexeeeeexxxxeexxeeexexeeeeexexxeexeexexxexeeeexxexexexexexxxxxxeexxxeexxxeeeeeeexxxeexexexxxxxexexxexxxxxeeexeexexxxeeexxxexxeeeexexexexeeeeexexxxexexxexxexxxeeexexeeeeexexxeeexxxexexexexexexxxeexexeeexxexxeeeeeeexexexxxexxxeexxexexxeexexxeexeexeeexexeeeeexexxeeexxxxeeeeexexxxexexxexeeeeexexxexeexxeeexxxexxxexxxxexxexxexxeeeeeeeexxexeexeexexxxexxexxeeexxxxxexeexexxxxxexxxxxeeexexexeeeeexeexeeeeexeeexexeeexxxxeexeexeeeeexxxxeexxeeeeeexxeexxexxxexxexexexxexxxexexxxexeexxexxxeeexexxeeeexeeexxeexexexxxxxxxeeeeexxxeeeeeeeexxxxexxeeexeexexexeexexeexexxxxxxxxeeeeexexeexeexeexxeexxeeexexxxxxexxexeexexxeexeexexexexexxxxxxexxeeexxeexexexxexexeeexxxxxxxxxxexexeeexexeeexeexxxeeexeeeexxxeexxxexxexxexxeeeexexxxeeexeexeeeeeexexeeexxxxxexxeexxexeeeexexxxxexxeeeeeeexeeexexexexxexexxeeexxxexeexexeeeexxexxexeeexxexexxeeexxexxexxeeeexxeexeexexeeeeeexxeexexexeexeexexeeeexxxexxxexeexxexeeexxexxxeexxxeeeeexeeexxxexxxeeeexexxeexeeexeeexxeeeexeeexxxexxxexxxeeeexxxeexeeexexexexeeeeeeexxxxexeeeeeeeeeexexxexxeexxexxxeexxxxxexxxxxxexxxexexxxxexexexeeeexxexeexxexxeeexeeeeeexeexexeeeeeeeexxexxexexeexeexexeeexxxxexxexeexxxexxeeexexxxxxxxxxeexexexxexexxxxeexeeeeexeexxeexxxxxexeeexxxxeeexeeexeeexexeeeeeeexeexeeeexeeexeexexexxxexeeeeeeexxxeexxxxxeexexxxxexexeexeexxxeeexeexeexeeeeeexeexxxxxxxexeeexexexxxexxxexxexeexeeexeexeeeeeeexeeeeeexxxeexxeeexeeexxeexeexxxxxeexexxexxeeexeexxeeexxxexeeexxxeeeeexxexexexeeeexxeeexeexxxxxxeexxxeexexxxeeeexeexxeexxxxeexeeexxexxeexeeeeexxexxeexxexxxxeeeeexexxeeexeexeexexxeexexxxeeexexxxxxexxxxexxxxexexxxxexeexxxexeeexxxexexeexxxeexexexxeeexxxeexxxxexeeexeexeexxxexxeexxeexexxeeexxxexexxxxxeexxeexxxexxeeeeexeexxxxxeeexxxxexxexxxxexeeexeexeexexxeexxexxxxeeeeeexeexeeeexxxexexxxeexexeeexxxxxeeexxexxxxxeexexxeeeexxxxxxeeeexxeeexxxeeeeexxexxxxxexexexxxxexexexexeexxexeeexxxeexexeexexeeexxeeeexeexexexxxxxexxeeeeexxeeeexeeeeeexexexexxxxxexxxxxexeeexxxxxxxeexxexeeeexexexxxxeeeeexexxxexeeeeeeexeeexxeexexxexxxexxexeeexexexxexxexeexexeexxexxeexxeeexxxxxeexxeexeeeeeexxeeeexxxexxxxxeexxxxxexxexxexxxxxxexexeexxexexeexxexxxxxxxeeeexxeexxxxeeeexxxxxxxxxxxxxeexxeexexexxexeexexeexxxxexxxexxeexxxxeexxxexexeexeeexxeexeexxxxeexxxxexeexexxeexxeeexeeeexexexxeeexxxexxxxeeexxeexeexxxexeeexxexexxeeeeeexxexxeeexeexeeexexxxexxxeexeexxeexexxxexxxxeexxexeexxeeexexxxexexexxxeeeeeexxexxxxexeeexexxexeeeexxxxeexxxxxxeexeeexeexeexeexexxxeeeeexxxexexexxexeeeexeeeeeeexxxexxxeeexeeeeexexxexeexexexxxexexexeeexeeeeexexxexeeeexexeeexxexxeexxxexeeeeexxxxxxxxxeeeexexexxxeeexeexeexxxexexeexxexxxxxxexxxexeexxeeexeeexxeeexeexeeeexeeeexxexexeexeeexexeeexxxexxxexxxxxexexxeeexexxeeeexexexxxxxeeexeexexxeexeexeexxxeeexxexexxeeexeeexxexexxxeexxexxxeeeeexexxeeexeexexxeexeeexeeexxxxxxxexxxxxeexeexeeexeeeexxeeexeeexeeeexeexexxxexxxxxeexxeeeexxexxeexexeexexeeexxexxexexxxexexexxeeexxeexexeexeeexexexxxxeeexexexxxexeeexeexxeexxxexexxxeexxxxexxxeexxexeeexxxxeexeexeeeexxxexexxxxxexexeeeexxxexxeexxxexeexxexxxxexxeeeeeeexeeexxxxexxxeexxxexxexeeeeexeeeeeexexeexexeeexxxeexxxeeexxxxxxexxxexxexexeeexxxxexexexexexeeeexxexexxeeexeeexxeexxxexexxeexexxeexeeeexeeexxexexxxexxxeexexxeexexxxexeeeexexeeexeeexxxxeeeexxxexxeeexxeeexeeeexeexxeexxeexxxxxexeeexexeexexxxxexeexeeexxxexxexxxexexeexxeexxeeeeexeeexexexxxxxxxexexxexexexexexxexxeexexxexeeeeexeeexeexxxxexexxexxexxxxxxexexxexxexexxeexeeexxxxxexeexexxeeeeeeeexxxxeeeexxeeexexxexeeexxxeexexxeexeeexexexxeexxeexeeexxxxeeexexexexxeexxxexxxexxxxxeeeeeeexexeeexexeeeeexxexxxxexexeeexeeeeeeeeexxxeexxexxxxeexexexxeeexeexxeeexxexexxeexeeeexxxxeeexexxexexxxxxxxxexexxxeeexxxxxxexeexeeeeeeexeexeeeexxeexeexexeexxxeeexxexxxeeexxxexxexxxeexxexeeeexeeexeexexxxxeexxxxexxexexeeexeeexexxeeeexxxxxxxxxxxeexxeexxxxxexxxxxxxexexeexexeeexxxexxexxxxxexexexexxxexexxexexeexexeeeexxxexexeexxexeeeeexxexeeeexeeeeexxxxxexexeeeeexxexeexeeexeeexxxexxxeexexxxexxxxexeeeeexxxeeeexxeeeexxxexeeeeeeexxexexxxeexeeexeexxxxxeexxeexexxxxeexxxexxxeexeexeexxxxexeeexxxxxexeexxeexexxxexeeeexxexxxexxxxexxxxexxxeexeexxxxxxeexxeexexxexexxexxxeeeexxxexxexxeexxxxxexxexexxxexxxxeeeeeeexexxexexeexxexxxxexeexeeeeeexexeeeeexxxxeeeeeeeexxeexexxexxexeexeeexeeeexeexxxxxexxeeexxeeexxeeexxxexexxeexxxexxxeeexxexexxxxexexxexeexeeexxeeeexexeeeexxeeeexxxeeeexexxeeexeeeexexxexexxeexeexeexxexexexxexxeeeeeeeexeeeeexxxexexxexxeeeeexeexexxexexxxxeeexeeeeexeeeeeexeeeeexxexeexeexeeeeexexeeeexxexxexxxxeexxxxxxxxxxeeeeexeexxxexxxxexeexeeexeeexxeexeeeeexxeeeexxxeexexeexxxxxexxxxxeexeeexxxexexxxeexxxxxeeeexxxeeeexxxxxexxxxxexxeexxxxxeeexxxeeexxexexeeexxexxexexxxxeexxexeexexxexexxxxexeexexeeexexxeeeeeeeeeeexxeexxeexxxxxexxeexexxexxexxxeeexexeexexxeexxexexeexeeexxxexxxeexeeexxxeexxxxxexxxxeexxxexeexexxxeeeexexxxeexxxxxxexexexxexexxexxxxxxexeexexxeexxeexxxxxxxxeeeeexxxxexexexeeeexxeeeexxxeexxxeexxeexeeeexeeeeexxxxeeexxxxeexxxexxxxexexexeeexxexxeexxxexeeeeexexeexexexexexxxxxxexxexxexxxexxeeeeeexexxexxeeeexexxxxeexxeeeexexeexeeeexxexexeeexexxexxxeeexxeexxxxeeexeexxexxeeeexexeeexeeexeexexexxxeexeeeeexxxexxxexexxxxeeeexeexxxxxeexeexxxeeexxexeexxeeexexxxexexeexxeeeeeeexxxexeeexexxexxxexeexeexxxxexxeeexeexxexxexexexexxexxeexxeeeeeexxexxxeeexeexxexeeexxexeeexxeexxexxexexxeeexeexeeeeexxexxxxexexxxxexexexexxeeexxxeeexeeeeeexeexexxxeeeeeeexeeeeexexxxxxxxxexxexxxxeexxxeexxeexexexexeeeeexexexexxeeexxxxxxeeeexxxeexxexeeexxxexxxxeexxexexxexxxxxxexeeeeexexxxexxeexxxexxxxxeexxeexexeeeexxexexxexxeexxxeexxxxexexxxxxexexexxeexxxeexeeexeexexeeexeexeexxexeexeeeexeexxxxxeeexxexxxxxxeeexxeexexexexxexexexxexexxxxxxexxxexxxeeeexexexxxeeexexexeeexeeexxexxxexeeexxexxeexxxeexexexxxxxeeexxexxxeexxexxexxxexxxexxexexxeeeeeeeexeeeeexeeexxexexeexxexeeeeexeeeexxxeexxexxexxxeexeexxxeexxxexexxeeexxeeexxxxeexexeexexxexexexexxxxeexxxxexxexxxxexexxxexexeeexxxexexeeeexxxxxxeexxexxexexeexeexxxxxxeexeexeexxeexexexexexxxeexeeexxeexxeeeexxexxexxxxxeexxxeexxeexeeexxxxxexxeexexeexeexexxxeeexexxxxexxxeexexxxeexxeexxxxxexexxeexxxexeexexeeeeeexxxxxxxxexexxexxeeexexexxxxeeexexxexexeexexxeexeexeexexeeexxexexxxxxxxxxeeeexeeeeexxeeeexeexeexxxxxeeeeexeexxeeexexxxexxexexxxeexexxexxexeeexxxexexxxexxexexxxeeexxxxexxexeeexxeeexxxexeeeeeexexxexxxxxxexxxxexexeexxexxeexxxxexexeeexxexexxxxxxeeeexxxeeeeexxeeexxeexxexeexexxeexxeeexexxxxxexxxxeexxexexxeexexeexxxeeeexexxxxxxxxeeexexxxxexxxexexexxexeexxexeexxexeexexxeexexexeexxxexxexxxeeeexxxxxeexxxxxexxxeexxexeeexexxexxxeeexeexxeeexxexeexxeeeeeexxxxeexxeexeeexexxxxxxxexeexeeexexxxxxeexxxeexeeeeeeeexxxxeexexexxeexxxexxxexexeeeexeeeeeexexeexxeexexeeeeexxeexeexeexexxxxxexexxxxxexxexexeexxxeeeeexxeexexeexxxeeexexeexexexxeeexeeexxeeeexxxxexeexexxeexxxexexeeexexxxexexexxexxeexxeexxexexxxxeeeexxxxxxxexexxxxxexxeexexxexeeeexexexxxexxeexxxxeeexeexxxeexexexexeeeexxxexeexxexxxeeeexexxxxxxeexxxexexeeexeeexxxeexeeexeexxexxeeeexexxxexeexxxxxxeeexxeeeexeexeeexeeexexxeeeeexexxxxeexexxexexexexeexxxeeeexxeeexxxeexxexeexxxxxeexeeexeexxxxexxxexxxxexeexexxexeexeexxxxxexxxeexxxxxxexexexxxxxexxxeexxxexxxxxeexxexxxexxxexeeexxexxxxxexxxxeexxexeexxeeexexxexeeeexxexxxeeexexeeeeeeexxexxeexexxxeeexexeexxxexxexxxxxxexxxxeexxeexxeexeeeeeeeexxexeeexeexeeeeexeexexeeeexxxexexeeeeeexexeeeeeexexxexxxexexxexxxeeeexexexxxxexexexxxexxexxeexeexeexxxeeeeeexeeexexexxxxxeexxxeeexexeeexxexxexexexexeeexexxxxexexxexeexeeexeeexexxeeeeexxexexxxxexxxxxxexxeexxxxeexxxexeeexeexxexxexeeexxeeeexxeeeexeexxeexexexexxxexxexexxexxexexeexeeexexxxexxxexxeexxeexxexexexxxxxexxeexeeexxxxeeexeexeeexxxexxxxeeeexxeexxxxexxeexxxxxxexeeexxxxxeeeeeeexeeexxxeexeexxeeeeexeeexeeexxexxeeexxexeeexxxexxxxxexexxexxeexxxxeeexexxxxeeeexeexexexxexexxexeexeexxxeeeeexeexeexxxxeexxxexeexxeeexxxexxxexxexeeexxeeexeexxeexeeexxeexexxexxxexeeexexeeeexxexeeexexxeeeeexxeexxexexexeexeexxeeexexxeeeeeexxexexeexxxxxeeeeexxeexxeeeexexxeeeexxxxxexeeexeeexexeexeexxxexxxxeeexexexeexxxxeeeexxxeeexxxxeexeexeexxxexxexxexxeeeexeexxeeexxxexeexxxeeeexexxeexexxexexeexxeexxeeeexxexeexexxxexxxeexxeexxexexxxexexeexxxxxeeeeexeeeeexxxxexexxxxxexxeeexexxeexeeeexxxxexeexeeexeeexeeeeeexeeexxxeexeeeexeexexeeeeeexexeexxxxeeexxeeeeexeexexexxxxexxxexxeexxexexxxxxeexeexexexxxxxexexexxxeexexxexxxexexeexexeexxeexxxxxxeexxexxxeexexexxxeexexxxxexxexexxxxeexxxeeexexeexexxeeeexeexexexexxeeeeexexexxexexxeeexeeexxxxxxeeexeexexxexxxeeexxxexexeeexxxeeexxxxxeexxxeeeeeeexxxxxxexxxeeeexxxxxexxeeeeeexexeexexxexexexexxxeeeexxxexeexeeexxxexexeexxxexxxeexeexxexxeexexxeeeeexxexxxeexxexeexxxxxeeeeeeexxxxeeexeexxexeeeeexexxeexexxexxexexeexeexxeexeeeexxxxxeexexeeexxeeeeeeexxxeeeeeexexxxexexxexxxxxeeexxexexxeeeeexxxxxexxexxexxexxxexexexxxexxxxeeeexxxeeexexeeeeexxxxeeexexexeexxeeexexexexxexexxexexexexeeeexxeexxxexxeexxxexeexeexexxexxeeexexeexexxxexeexxeexeexeexexxeexxexexxeeexxeexeexexexxxexxexxeexxexexxexxxxxexeeeeeeexeexxxeeeeexxxeexxxxxeeexxxxxxexxeeexxxxeexxxeeexexexxxexxexxxexxxexexeeexxeeeexxeexeexexeeeeexxxxxexxeeeeeexxxexxexxxexexeexeexeexxexeexxexeeexexxxxxeeexeexexxxxexxeeeexexexxxxxeeeeexeeexexeeeeexxxeexxxexxexxxexeexexeexexxxxxxxxexexxxexxexeeexexeeeexeeexexxxexeexexeeexexexxeexxeexexxxxexxxeeexeexxeexeeeeeexeeeexxxxxxxxxxxeeexxexxxxeeexeeexxexexeeeexxeexxeexxxeeeexexxxxxxxxxxxexexxeexeeexeeeexxxexxeexeexeexeexxeexxeeexxexeeeeexeeexeeexxxexxexxeeexeeeexeeexeeeeexexxexexexeeeexxeeexxexxexxeeeexxeexxeeeeeeexexxxeeexxexeexeeexxeeeexxeexxexeeexxexeeexxxxxxeexxxeeeeeeexexxxxexexexeeexxeeexeexxeexxeeeeexexxeeexxexxeeeexxxxxeexeeexxxxxexxeeexexxxxxeeeeeeeexeexeexeexxxxxxexexeeexxxxexxexeeexexeexxeexexexexeeexxexxexxxeexexxxeeeeeeeeeeeeeexeeeeexxexxeeexeexexeeexxexxxxeexexxxexeexxeeeeeexxexexeexexexeeeexeeeexxexeeexexeexeexxxxxeexeexxxxxeeexxeexeexxxxeeeeexexeeexeeexxeexeeexxexexeeeexxxexxxxeexxxxeeexxexxeeeexeexeexexexxxexxeexxexeeeeeexxxxxxxxeeexeexexxxexexexxexeeeexexeexeeexeeexeeexeexxxexxxxexxeeexeeeeeexxeeexexexxexexeeeeeexeeexxxexxxexxxxexeexxexexexxexxexxeexexxxexxxxexxexeexxxeexexxeeexexeexxexxeeexxexxeexeexeexxeexxexeexexxexeexxxxxexxexeeeexeexeexexxxxeeexxxxxxxxxxxxeexxexxxexxexxexexexxeeexxeeeexexexeexexexxeeexxxeeexeeeeeeeexexeexxxexxexxeeexexxeeexxeexexxeexeexxeexxxxxeexxxxxeexxxxxeeexxexexxxxxxeexeeexxexxxxexxxxxxeexexxeexexxeexxeeexxxxxexexeexeeexeexxxxeeexxeexxxxxexxexeexexxxxxxeexexeeexxxxeeeeexeexxxxxexeeexexxeeeeexexeeexexxeexxxeeeexeexexeeexxeexeeeexeeexxexxeexxeeexxxeeeexexxeeeeexeeexxxxeexxexxeexeeeexxexxeexeexeeeexeeexxxxeeexxeexeeexeeexeexxexexxeexxxxxxxxexxeeexxxeeexexxexxexeexeeexxxxeexxeeeexexxeexxeexexeexexeeexxxxeexxxxxxexxxexeexeexexxxxexxxxxeexeeeexexxxexxexxxxeeeexxeeeexeeeeexxexeeexxxexxexxeeexxxeexxxeexexeexxexeexxexxeexxxxxxxxxxeexeeeeeexeeexexxxxxeexxexexeexexxeexeeeexeeeexeeexeeeexxeeexxxxxeexeeeeexxxexexexeexxxxeeeeexxxxexeeeexxeeeexexxxexexeeexexxeexxxxxexexxxexxxeexxxxxexxxexxxexexxxeeeeeeeeexxexexxeexxeexeexeexeeeexxxxxxxeexeeexeeexexeexexxxxxeeexxexxeeeeeexeeeexexeeeeexexeexxeexxexeeexxxxexeexexexeeeexxexeeexxeeeexxxeexxeexeexeeeexxexexxexxxeexxexxxxxxxxxexeeeeeeexxxxxxeexexxxxexexeexeexxxxxxexxxexxexxeeexeeeeeexxexxeeeeexexexxxexexeexeexxexeexexxexxxexxxxeexexeeeexexxeeexxxxxxxxxxxeexeeexxxexxeexeexxeexexxexexxxeeeeeeexexeeexeeexexexxeeeexxxxxeexxexexxxexxeexexexexxexxeeexexexxeexeeexexeexxeeexeeeeeeeexeexxeexxxxxexexxeexxexeeexeeexxxxxexxexxeexxexxxxxexeeexxeeexxxxexxeexeeeeexxexxeexexexexxxexeexxexxxexxxxeeexexeexeeeeexx\nozoozzzozzozzozzoooozoozzooozzzozoozzzoooozozzoozozzozozoozzoozzoooozzozoozozzzozzzoozzoozzozozzzozozoozzzzzooooozooooozzzzozozzzzzozzooozozzoozoooozzzzozoozooozooozoooooozooozzzoozoooozoozozoooooozozoozzzzooozzooooozoozozozzzzozzzozzoozzozozzzzzoozoozozozzzzzozozozzzoozozzozzzozozoozozoozzoozzzzzzoozzozzzoozozozzzoozozzzzozzozozzzzoozzzooozozoozozzoooozoozozozozzooooozozozzozozzooozooozzzzzzooozoozozzozzzooozzzozozooozzzooozzzzzoozzzooooooozzzzzzozzzoooozzzzzozzoooooozozoozozzozozozozzzoooozzzozoozooozzzozozoozzzozzzoozoozzozzoozozzooooozzozzzoozzozoozzzzzooooooozzzzooozoozzozooooozozzoozozzozzozozoozoozzoozoooozzzzzoozozooozzooooooozzzoooooozozzzozozzozzzzzooozzozozzooooozzzzzozzozzozzozzzozozozzzozzzzoooozzzooozozooooozzzzooozozozoozzooozozozozzozozzozozozozoooozzoozzzozzoozzzozoozoozozzozzooozozoozozzzozoozzoozoozoozozzoozzozozzooozzoozoozozozzzozzozzoozzozozzozzzzzozooooooozoozzzooooozzzoozzzzzooozzzzzzozzooozzzzoozzzooozozozzzozzozzzozzzozozooozzoooozzoozoozozooooozzzzzozzoooooozzzozzozzzozozoozoozoozzozoozzozooozozzzzzooozoozozzzzozzoooozozozzzzzooooozooozozooooozzzoozzzozzozzzozoozozoozozzzzzzzzozozzzozzozooozozoooozooozozzzozoozozooozozozzoozzoozozzzzozzzooozoozzoozoooooozoooozzzzzzzzzzzooozzozzzzooozooozzozozoooozzoozzoozzzoooozozzzzzzzzzzzozozzoozooozoooozzzozzoozoozoozoozzoozzooozzozooooozooozooozzzozzozzooozoooozooozooooozozzozozozoooozzooozzozzozzoooozzoozzooooooozozzzooozzozoozooozzoooozzoozzozooozzozooozzzzzzoozzzooooooozozzzzozozozooozzooozoozzoozzooooozozzooozzozzoooozzzzzoozooozzzzzozzooozozzzzzoooooooozoozoozoozzzzzzozozooozzzzozzozooozozoozzoozozozozooozzozzozzzoozozzzoooooooooooooozooooozzozzooozoozozooozzozzzzoozozzzozoozzoooooozzozozoozozozoooozoooozzozooozozoozoozzzzzoozoozzzzzooozzoozoozzzzooooozozooozooozzoozooozzozozoooozzzozzzzoozzzzooozzozzoooozoozoozozozzzozzoozzozoooooozzzzzzzzooozoozozzzozozozzozoooozozoozooozooozooozoozzzozzzzozzooozoooooozzooozozozzozozoooooozooozzzozzzozzzzozoozzozozozzozzozzoozozzzozzzzozzozoozzzoozozzooozozoozzozzooozzozzoozoozoozzoozzozoozozzozoozzzzzozzozoooozoozoozozzzzooozzzzzzzzzzzzoozzozzzozzozzozozozzooozzoooozozozoozozozzooozzzooozoooooooozozoozzzozzozzooozozzooozzoozozzoozoozzoozzzzzoozzzzzoozzzzzooozzozozzzzzzoozooozzozzzzozzzzzzoozozzoozozzoozzooozzzzzozozoozooozoozzzzooozzoozzzzzozzozoozozzzzzzoozozooozzzzooooozoozzzzzozooozozzooooozozooozozzoozzzoooozoozozooozzoozoooozooozzozzoozzooozzzoooozozzooooozooozzzzoozzozzoozoooozzozzoozoozoooozooozzzzooozzoozooozooozoozzozozzoozzzzzzzzozzooozzzooozozzozzozoozooozzzzoozzoooozozzoozzoozozoozozooozzzzoozzzzzzozzzozoozoozozzzzozzzzzoozoooozozzzozzozzzzoooozzoooozooooozzozooozzzozzozzooozzzoozzzoozozoozzozoozzozzoozzzzzzzzzzoozoooooozooozozzzzzoozzozozoozozzoozoooozoooozooozoooozzooozzzzzoozooooozzzozozozoozzzzooooozzzzozoooozzoooozozzzozozooozozzoozzzzzozozzzozzzoozzzzzozzzozzzozozzzooooooooozzozozzoozzoozoozoozoooozzzzzzzoozooozooozozoozozzzzzooozzozzoooooozoooozozooooozozoozzoozzozooozzzzozoozozozoooozzozooozzoooozzzoozzoozoozoooozzozozzozzzoozzozzzzzzzzzozooooooozzzzzzoozozzzzozozoozoozzzzzzozzzozzozzooozoooooozzozzooooozozozzzozozoozoozzozoozozzozzzozzzzoozozoooozozzooozzzzzzzzzzzoozooozzzozzoozoozzoozozzozozzzooooooozozooozooozozozzoooozzzzzoozzozozzzozzoozozozozzozzooozozozzoozooozozoozzooozoooooooozoozzoozzzzzozozzoozzozooozooozzzzzozzozzoozzozzzzzozooozzooozzzzozzoozooooozzozzoozozozozzzozoozzozzzozzzzooozozoozooooozzooozozooozzzzzozoozozozoozozozzzzzozoooooozzzozzzzzooozozzozozzzzozzooooooozoozzzozozzzoozzzzzooozozzozzooozzozoozzozzozzzzzozzooozzzzzzzzzzzzzzzozozooozozzooozzozzozoozzozoozozoozzoozzozozooozzoooozzzozoooozoozzzooozzzzoozoooozzoozozzzoozzoooooooozzoozzzozozozzozzzzoozooozzozzzooozzooozoozozzzzzozozzzzozzzozoozoozoooozzozzozzzozoozzzzozzzozooozzoozozozzozozzooozzozozzzzoozzozzooozzoozozooozooozzozzzozzoozzzzzzzozzoozozzzozzoozzozoozzozzzzozoozozzzzooooozzzzzzozozzzoozoozozoozzzooozozoooooooozooozoooooozooozzzzozzozzooozzoozzozzzoozzzzooozoooozzoozozozzooozzoooozzozzzzoozzooozoooozzzoozzozzzzoozozoozooooozzzozzzzozozooozzoozozozzoozozzozzzzzzozoooozzzzzooozozzzoooozozoooooozozoozozzozoozzoooozzzzzozoozzzoozzzzoozozzooozoozzozzzzoozoozoooozooozzzoooooozzoozzoozoozoozozzzzozzoozzzozooooozzzozozzzzozozzoozozooozozoozozzzzzzzoozzoozozoozzoozzozzozozoozzzozzzzzozozozooozoozzozzzozooozzzzozzozooooozzozoozoozzzzooozooooozzozzzozzzoozzzoooozozoozzooooooozozozoooozzozzzzzooozoooozozzzzzoozzoozooozzzzozzozoozoooozoozzzzzzooozozzzozozzzozzzzzozzoooozzozooozzozzzozoozozooooooozzzooozooozoozozzzzooozoooozzzozzzzoozzzzzzzzzozzozzozozzoozozzozozoooozozozoozozoozozzozzzzzozooooozzzoooooooozozoozoooozzzzozozozzoooooozoozzozzzooozzooozzoooozzozoozooozozzzoooozzozozzozzoozzzzoozooozzoozozozoooozzzzzozzzoooooozzzzozzooozozzooozoooozooooooozzzoozozoozozozoozzozoozozozozoozzoozooozozozzzzozzzooozzzzoozoooozoooooozozzozozzoozzozoozozzozozzozzzzozzoozzozzzzzzzzoozoozzzzzzzzzzzzoozzoooooozzoozoooozzooozoozzoooooooozozzozzzzoozozoozzzzozozooozzozooozoozzoozzzzzzzozzzooozzozzzzzoooozozoooozooozoozzzozzozozzozzoozozoozoozozozzzozzoozozzzozoozoooozzzooozozzzozozzzzzzozzoozozzoozzzoooozzozoozozooozzozozzozoozzzzozzzzzzozozzzooozozooozozozozzooozzoozzoooooozzzzozozzzzzzozozoozzozzozzzzzozozzozzoozooozzzozzozzooozoozzzzozozooooozooozzzzozzzzzooooozoooozoooozzzzzozzzzzzzozooozzzoooooozozzooozooozzzozozooozozzozozzzozoozozzooozozzzzzzozzooozozzzzzoozzoozzozzozoooozozozozozooozoozoooooozzzzzozzzzzzzzooozzozozzoozzozzzzoozoozooozoozoozooozzzozzooozozzzooozozozzzzzozoozoozooozooozzzzooozzozoozzozzzozozzzzzzoozozzoooozzoozzoozozzoozzoooozooozzzozzozoooozzozzozozozzzzozoooooooozoozzozzzoozzoozzoozzzzzoozoozzzoozozzooozzooozzzzozozozzozzzzozozoozozzzooozzzozozzozozoooooozoozozzzzooozooooozzoozzzzzzzzzozzooozzzozzoooozoozozzzozozozozzzozozzooozzoozzooooozoozzzozoozzzzozzzzozzzozozoozzozzzoooozoozoozzozoozzzzzzzzozooozzozozzooozzozozzozzoozzooooozzozzozzzzozzoozzozzzzozzoooooozozzozzzozoozzozooooozzzoozozozooozozzzzozzzoozzozoozozozzozoozzoozzoozzzoozozzzooozoozozzzzzooozooozzoozooozzozzzzzoooozozzzooooooozozzzzozzzoooozooozozozzzzozozzzozooooozozooooozozooozzozoozoozozzzzooozzzozzoooozzozzozzoozzzoozzozzzoozzzzoozzoozzoooozzzoooozozozozzzoooozzzzzozozzzzozooooozozozozozzzzoozzzozzzooozzzzzzoozzoozzozoooooooozzzzzooooozoozooozzzozzzzzzoooooozzozoozoooozzozzooozzzzozzzoozzzozozoozzozozzzozozooozzzzzzzzzooooozzozzooozozzzozozoozzzzoozzzzoozoozooozozzzzozzzzzozzzoozozzozzzozzozzzzzoooozzzzooozoozzzzzoozozoozozzoozzozozzzoozzzzoozozozoozzoooozzzzzoozozozoooozzoozzooozozzooozzoozzoozoozzozzozzooozzozozzzozoozooozooozzooozozzzozozooozzzozoozzozzozzoozoozozozzoozzzoozzzzzoozzozozzoooozzozzozzozzzzzooozzzooozoozozzoozzooozoozooozozozoozzzozozzozoozzozozooozoooozozoooozozzzozozoooozozzzzozzzooozozoozoozzozooozozzozzzzozzozzzooozzozzozzoozoozzzzooozzzzoozzzoozzozzzozozoozzzozzzooozzooozozoozooooooozzozooozzozooozozzoozzzzzoozzozzozozzooozozoozooozoozoozozoozoooooozzzzoooozzzzoooozozzooozooozzzozzzzooooozooozoozzooozzzoozzozzzzzzzzozozozoooooooozzoozzooozzoozozozzzzoooozzoozooozoozoozzzzooozzozzooozoozozzzozozzzzozzozzzzzoozzoozzzzozzozoooozzzzzzzoooozzzzozzoozzzzozzoozzooozzzozoozzzzzooozoozzoozzozozozoooooozozoozozoozozoozozzzozzooozzozozooozooozzzoozooozzzozzooozzozzzzzzzzozzzzozoozzzooooozzzooozooozozzzoooooozzozzozoozozozozozoozzozzzzzozozzozoozzoozozzzzzozzozozozzzzzozzzozzozzzoozozzozozzoozzzzoozzzozzozzzzzoooozzozozzzzzozzoozzzzzoozzoozzzzooozooozooozzozoozzzzoozzoooooooozoozozooozzzoozzzoozooozozzoozzozoozooozzoozzozozzzzoozzzzozzzzzzozoozzzzozzozoozooooozzzozzzzoozozoozzoozozoooozzzzzzzoozooozozoooozozoozooooozozzooozzooooooozzzoooozozooozzozzzzzzzzoozoooozzooozzzooooozozzoozzzooozozooozzozzozozozozozozozzzzzzozzzzoozoozzzoooozozozozzzzzoozzoozzzzzooozzozozzzzzzzooooozzzzzozzozoozozozoozoooozzoozzoozooozozzoozzoozzzzzzooozozooooooozzzozzozzoozozoozzzzzozozzzozozozzooozzzooozozoooozzoozzzzoozozzzozzzzozooozzzzzzoooozooozzozoozzozzooozzooooozzozooozooozoozzzozzzoozzozozozzzoozzzzozzzoozzoooozzooozzzzzzoooozozzoooozooooooozozoozzoooooozzozzozzzzzooozozooozooozozozozozozoooozzzoozozzzoozzzzzzoozzzzozzzozoozzoooozozzozzoozozzozozzzzoozzozzzzooozoozzozozozzoooozzooozozzozozozoooooozzozzoooooozzoooozzzozozoooozozzzzozzozzzozzzozoozoozozozzzzzzoooozzzoozoozoozozoooozzozooozozzoooozzozozoozzzozoozzzooozozzzozooozozozoozzozzoooozzooooooozzzoozzozzzzzzozoozzozzozoooooozooozoozoooozzzzozozozooozzooooozzoozzzoozzzzzzoozooozzzoooooooozozozzozozozoozoozozzzoooozzzzozozzoozzzozoozooozozoozzzozzzozzoozoozozzzzzooozozooozzzzzzzozooozzzzzozoozzozoozozzzoozzoozozozzozooozzzzoozzozzzzozozozzozzzzozzzzzozzzozozzzoozozooooozoozzzozzozooooooozozoozzozooozzoozzzzozoozooozozzozzzozoozzzoooozozzzooozzzzzooozzzoooozooozozzzzzoooozzzzoooozozzozozozoozoozozozozzzozooozozzozooooooozzozozooozzooozoozoozzozzoozozzzooozzzozzzzozzozoozozozoozzzoooozzooozoozzoooooozzozzozozzzzzozzzzoozozzzooooooozzozozozooozozozozzzzzzzzzoooozoozzoooozzzzzzzzzozzzooozoooozozozzzozzozzozozozzozooozozozzzzooooozzoozozzozoozzzzozozzozzooozzooooozozozzooozzozozozozzzzzzzoozozozzoozzzozoozzozzzozzoozozozoooozzzozoozzzzzooozzzzzzzozzzooooooozzzzzzozzzzzzzozzozoooozzooozzzzzzzozozozooozzozzzooooozzooozzzzzooozzoozzozzzoozzzzozozzoozzoozozzozzzzozzzzzozozzzozzoooozzoozzozzzzozzozzzzzozzoozozzzzzoozzzozzzozooooozoooooooozoooooooozoozzzozzozzzzozzzzooooozzzozzzzzzzozzzooozzzooooozzzoozzzzozozzoooozzozzzoooozzozozzzozzzoozozooozozoozozzzzzozzzozoozzzooozozozozzozozzoozozozzzzoozozozzozoooooozzoozzozozoozzoozoozzozzzoozozoooozozzzzozozooozzoozzzoooozozzzzzzzzozzzozzooozozoozozozzzozozozozzoozzzzzoozzooozozzooozzzzzzzooozzzozzzzzzozzoooozoozoooooozozoooozzzooozooozoozzzoozzoooozoozozooooozzzzzzozzozzozoozzoozzoooozzoozzozozozozzozozzzzozoozzzoozozoozozozzozozozzoozozoozooozzozzoozzozozzooozzozzoozozzozzoozoozozzzozozooozozzzzozoooozoozoozooooozozzzzozozzzozoozozoozooozozoozzoozzzozozzzozoozzzzzozozzzzzooozzooooooozozooooozzzzzoozzoozzzooozzozozooozoozzozozozoooooozzooozoozoozzooozzoooozzooozozoooozoozzzzoooooozzzzzozozzozzzozozzzoozzzozooozzooozzzoooozzzzoooooozzzozzzzozzoooozozzozzoooooozzoooozozzzozoozzzzzooooozzzzzoozzoozzozzoozzzoozzozzzoooozzzoozzzozoozzooozoozzzzzozzozoozozozzozoooooozozzoozzozozozooozzooozzzzzzoozzozozzozzzzoozzzzozzoooozzzoooozozzozzozzooozozoooozzzoozzozzoozozoozzozozzooozzozzozoozoozozzzzzzzzozzozoozozooooozozzzzozozozzzzzozzozoozzozzzoooozzozozoozzzozooooozozozozoozozzozzoozooozoozooozozoozozozoozzzzoozzozzoooozozzooooozozzzozzzozooozzzzzozzzzzoozzozozzzozzozozzooozzozzzooozzzozoozozzoozozozoozzzozzozozooozozooozoozzzzooooooozzzozozzozzozozzozzzzozozoozzozzoozozzooozzzzozzoooozzzooooooozoozozzozozozoooooooozzooozoozoooozzozzoozoooozzoozzzooozzozzoozoozoooozzoozzzozzoozoooozoooooozoozoooozzooozzzoozzzooooooozzozzozzozoozzozzzzzoozozzooozzoooooozoozoozozzooozzzzooozzozoooozzzzozzzzzozzooooozzzzooozzzzzozzzozzoooooozoozozzzzzzozooozzozzzozzozzzozozozzoooozooozzzzozooozozozzzzzozozzzzozzooozoozzzzozoozzozzoozzzozzozzzoozooozoozoozzzzzzzzooozooozoozzzzozzoooozozoozzoozozoozzooozzzzzoozzoooozzzoozzzoozzzzoooozozozzozoozozzozozzozozzoozooozzozzoozozzozozozozzzoozzozzozzoozzzzzzzoozooooooozozozozzoozzoozozzzoooooozozzozoozzooooooozzzoozozzozzozozzozzzoooozoooooozzzzooozozzozzoozzozoozzzzzozoooozozoozozzozozzzzzozozzzoozzozzozoozoozzozozzozzzozzzoozzoooozoozozozooozozzzoozoozzzzzzzzozzozzozzzzozzzozzzozoooooozoozzzozzooozozozozzzozoozzzzozzozozzozzozooozzzoozzozozoozzzoooozzzzzzzozzzooozzozoozzzzoooozoozzzooozozzzzoooooozozooooozoozzozzoooozzzzzooozoooozzozzzzoozzzoozozzooooozzzooozzzzzozoozzozzzozoozoozzozozoozzoooozzzooozzzzozozooozozzooozozoozzoozzzozzozozzzozoozzzozzzozzooozozozzozzzzzzozozoooozzozooozozzooozoooozooozozzozooozzoozzozzozzozozozoozzzozzzzzozooooozozozozzzzoozoozzozozozzozzozzoozozozzozozozozoozzzozoozzozzozzozozozzoozzozzozzzzzozzzzozzozzzzzzzzzzzzzzozooozozzoozzzozzzzoooooooozozoozzoozzzzozzozzozoozzozzooozozoozozooozoozoooooozzzzozoozzoozzooozooooozoozzoozozozzozozzzzzozozzozzzooozzzzooozzozoozzzzozzzzzozooooozoozooooozoozzozzzzoozzzzozzzzzoooozoozozzzzooooozoozzzooozozoozoozzozozzooozzooozzoozzozzzozzoozzzozzzoozooozzzzoozoozzzzoozzozzozooozzozzzzoozozzoozozozzzzzoozzozozozzzzoozzozoozoozoozooozoooozoooooooozozzozzooooooozzozozoozzozooozoozozzozzozzzzooozzoooozzzzzozoozzooozozzzzzzzzzzzzzzzozzozzoozoooozzzzzzzzzzozoozzzzzzozozzozzozzoozozzzozoooozozozooooooozzooozzzzooooozozozzozoozoozzzooozzozzoooozozzozzzzoozzzzoooooozzozzozozzozzzooozzoooooooozoozzooozzozzozzozozozoozooozzzozozzooozzzoozzzzozozozoozoozzzozoooozzzzozzzozzoozozoozooozozzzozozoozzzozzozzozooozzoooozozzzzzzzozoozzzozzozzzzozzzzzoozzozzzzooozooooozzzoooozzzoozzzoooooozzozooozzzoooozozoozzzoozozoooozzzooozzzooozoozzoooooozzzzozzoooozzooozzzzozzzzoozzozzzozozzozzzzzzozoooozozozooozzozzzoooozozzzooooozzoooozoozooozozzzozoozzoozzzzozzzooozoozoozzzzzzoooooozzzzzozzoozoozooozzoooozozzozoozozzzzoooooooozzzoooozozozoooozooozzozzozozzzzozoooozooooozzzoozzzooozzoooozoozoozooozozzzozoozzzzzzooozozzozzoooooozzoozzzozzzoozzzzzozozzzozoozzzzzzzozozozzoozooooozoooooooozozooozoozozzzoozzozoozooozozoooooozzoozozzzzzzozzzooozzzzzzzoooozoooozozozzozozzoozzzzzzoozzozzoozozzooozoozoozozozzzzoozoozzozzzzozozozozzooooozzzoozozoozzozozooozzooooooozoozozzzzoozozoozoozozozoooooozozozoozozzzzoozozozzzoozozozzoozoozzzozooooozoozoozzzozzozoozoozoooozoozoozzooozoozzozzozzzzooozzozzzzzzoozozzzozozzzzzozzooozozzoozzooozozzzozozzzooozzoozozozozzzozzzozzzzzzzzzzozozozooooozozoozzoozooozzzozooozozzzzozzozzoozzzozozozzozzozzozozzoooozzozzzozoozozzozozoooozzzozoozozozzozzzzzozzzzzoooozozzzozoozozzozzozzzozzzzooooozzooozoozozzooooozzzzzozozoozzoozzzzzzoozzooozoozozooozzzzzzozzozozozzozozzzozzoozozzooozozozozzzozzzoozzooozzzzzzzoozzzzzzzzooozozozzooozozzzzoozoozozozoozzozzoozozozzzoozozzzoooooozzzozzzzoozzooooozooozoozzooooozzzozzzzoooozzozozooozzzoooozooozzozzozooozzooooooooozzzozozoooozzoozooooozzozzzoozoooozzozooozzoozzoozzzoozzzozoozozozzoozzzzooozzoozozzzozzzzzzoozzzozoooozozzzzoozzzozozzzzozozooozoooozzzzzooozooooozzoozzoozzozozzzzoozozzoooozozoozoozzozozozzzzzozozzozzzzoozooozoozoozozzzzozzzoozzzzzzzzooozozzzozzzooozzzozoozzozoozzozzozoozooozzozzozozozzzzozzzozooooooooozoozzozzzzozzoozoozoozozzozoozozzzzozozzzozoozozoozozzzoozozoozoozozzozozzzzzozozozzozzozoooozoooozoooooozooozzooozzozozzozzoozoooozzoozzozzzzoozzzoooozzzzzzoooozozozzozoozzoooooooozoozzozoooozoozzooozozzzozoozzozooozzozzozzozozzzozoozzzzozooooozzzoozzoozzzoozzzzzozzzzzzooooozzzooooozzoooozozozzozzoooozzzzzozozzzzozoooooozzozooozzzzozozzozzozzozzzzzzoozoozoooooooooozoozzzzooozzozozozozzzozzzzzooooooozzozoozzoooozozozoozoozozzozozzzozzzzozzozozozooozzoozzozzozzzooooozzozoooozoozozzoooozzzooozzozzzzoozooozzzzzzozzzzzoozzoozozzzzozzzoozzzzzoozzzzzzooozozzzoozoozzoozzzozoozoooozzzoozozoozzozozozzoooozzzzzozzzozozozoozozzzzzoozozzooozzozozozzoozzozoozzzzozzooozzoozozzzooooozzzooozozzzozozozoozzozzozzzzzozooozoozozozoozzzooooozzozzozooozzooooozozzoozozozzzooozzzzozzozzozzozooooozozzozzoozzzozozzozzzzozoozoozzooozzzoozzozozozozzzzozoooooozoozzzzzzzzozzzoooooozzzzooozzozozzzzozzzzzzozozzzzoozooozzzzzzoozozzzooozozoooozzzzooozoozzzozzzooozzozozozzozooozooozzozozozzozoozoozooozzzzooozzozzzzozooozzozzzooozzozzoozozzozoooooozzozoooozzzzzoozoozzozozoozzooozzzooozozoooozoozzooozzzoozzozozozzooooozzzoooooooozoozzzoooozoozozozzzzzoooozzozozzzoozoozzzzooozzzzoooozoozozzzozozoozozzzoozzoooozoozozozoooozooozoozoozoooozozzzooozozozozzzzzzzooooozzoozzzozooozooozoozzoozozzzzozoooozozoozoozzzoozozozozzzooozzoooooozoozzooozoozozzzoozooozzoozzzzzozozzzooozzzozozozozzzoooozoozoozzoooooozzoozoooooozozzoozoozoozzzzoozozzozooozzozzoozzzozoozozozzozzozozzzoozzzoozozzozozozzzzozoozzzozoozzozzozozzzozozzozzoooozozzzzoozzzoozzzoozzzoooooozzoozozoozzozzozoooooozoooozzzzzozzoozzoozooozzzzzzzzzzozzooooooozozzzzzzzooozozooozzzzoooozzzzozzzzzzzooozozzzozzzzoooozoozzooozzooozzozzzzzoozooozooozoozzzoooooooozozzooozzoooooozzzzooozzoooozozzozzzzzzooozoooozzooozzzozooooozzoozzzooooozoozzozzoooozzzozozozooozzzoozzzzoozzzzzzzzoooozozzzozzzoozzoozozzzooozzzzoozzzoooooooozzzzzoozzooozozozzozoooozzzozzoooooozozooozzoozzzzzzooooozozooooozzzozzoozzzoozoozzzzoozozzzozozzzzozozzzooooozozozzooooozzoozozozzzozoozoooozzoozzozozooozzozzozzzzzzooozozooozzozzozooozzozzozozzzoozzozzzozzozozoozzzzooozzzzooozooozzozozzooooozooooozzoooooozozooooooozooozoozooozzzzoozzzoooooozzozzzooozozoooozzzoozozozozzzzzzzzzozzzzzzzooozzzzoozzozzzzzoooozzozozzzzzozzozzzzozooozozozozozzzooozzooozozzzzozozozzooozzozozoozoozzzzozzoooozooozozzzzzzzzzozozozzoozoozozoooozzzoozoozozzzooooooozzzzoozozzzzooozzzzoozozzozozoozozooooozzzozzozzoozozozozzzoozoozzozozzzoooooooozzzozzzzozzzoozoozoozzozoooooooozzzoozoooozozzzzooozooozzoooooozzozzzzozzzzzzzzzooozzzoooozoozoozoooozozzzoooozozzzzooozozzzozoozoozzzozoozooozozzozoozozooozoozoozozozzoooozoozoozoozzzzzozoozzzzzozzozoozoozzozozoozoozozozzozoooozozoozzozzozooozooooozzzozzzzzooozozozzzzozoooozzozoozzzozzozoooozoozozooozozooozzzozzzzozzzzozzzzozoozzozzoozzooozzozoooozozozzzzozzzozzzzooozoozzoooooozzzooozozozzzzozzzzozoozzzzzzzzzoozoozooozzzoooozozzzoozooozozoozoozzooooozzzzozzzooozzzozzzzozzzzoooozoozozzzzooozzozoooozzzozzzzzozozozozzozzozzzzzzzozozooozozozzooozzooozzooozozzzzzozzzoozozoozooooozzzozzozzozozzozzoozzzozozzzzzzzzzozozozzzzzozzoozzzzzzoozozzozzozozzoozzzoozzzzoozooozzzozoooozozzzoozzooozozzzzzzzozozoozoozoozzzzzzoozzozzozzoozozozozozzzzozooozzzzooozzzzzzzozozozooooozzzzozoozozzozozzoooooozzooozzoozooozozzzzzozzoozoozoozzzooozoozzooozzoozozozzooozooozooooozzzozozoozzzzozzzzzozozzzoozoozzozoozzozzozozzzzzoozozzoozzzzzzzzoozzozzzozozozoooooooooozozozooozzoozzzozzozzzzozzzoozooozzzoozzozzzzzzzooozzzozoooooozoozzzozzzzoooozzzzzzozooooooozzzzzzozozozzoozzzoozoozzzozzzzoooozzzzzozooozozzozozzzozooozzzzoozozoozozooooozzzoozzozozoozooozooozzzzzozzzozzooozzzzzzzooooozooozzozoozzozzzzzzzzozzzozzoozzzzzozozozzoozozoozzzozzzzzzoozoooozozzozozzzzzzzoozozoozzzzzzzzzoooozoozozzzzozzoozozzzoozozooozooozooooozoozooozozzozoozzzzzoozzozooozoozoozzzooooooozzozozzzozozzzzzzzozzoooooozzzozzzzoozooozzzzozoozoozzoozzoooozzzozzzooozooozooozozzozzozozzzozzzozozoozzozzzzozoooozozzoozozooozozzzzzoozzzozooooooozoooooooozzooozozzzzzzozoozzzzoozozzzzzozozzzozoooozozoooozzzzoooozzzozzzooozzzzozooozzozzooozoooozozoozooozoozoozoooozooooozzooozzzzooozoozzoooozozozooozozzozozozzzozzzozzzzzzzoozzozozzzoooozzzooooozzzzzzzozzzzooooozzozozzooooozzzoooozzzzoozozzozzzzzzozzzzozooozozzzozozooozoozzozzoozozzzzzozzzozoozzozzzzozoozzozzozozzozozzozzooooozzozoozzozzzozzoozzoooozozzzoozzozzzzozzzzoozzzzozzzoozzoooooozoooozzozoooozozoozoozzoozozzzoozozzoozooozzzzoozoozooozooooozzzzzzooozzozoozzoooozozozzzzzzozoozzzzozzozoooozozoooozozzzozoozzzooozozozozozzzoozozoozzooooooooozoozzozzozozozoozzzoozzzozooooooozzzooooozzzzozooozooozzzzzzzzoozoozzooozzzozzooozzoozozozzzozoozzoooozoozozzzzozoozzzzzoozozooozzzoozzzooozzozooozooooozoozoozzzozooozzzozzooozzoozzozzzzooooozzoozozooozzooooozozzoooozzzooozoozozoozzzzzozozzooooozozzooooooozzzozzzzoozozzzzozoozzozoozoozozoozzozzooozooooozoozzzzozozozoozozzzzzooooooozzozzozozzooozzozozzooozzoooozzoooooozoozozzozzzzoozzooooozzzooooozzoozzozzzzzooozozzooozozzoozzozooozoozooooooooozozozooooozzzzozzoooozoozzzzzzozoozozzzzozozooooozoozzzoozoozozoozozozoozzooozzozzzzzzzoozozzooozozozoozzzzoozzzzozzozzozoozooozzoozzzoooozzzzzozozoozzozzooozoozzzoozoozzoozzozzzoozzzzozoozozozzooozzozzozozzoooozoooooozzoozzozoozooooozoozzoozzozzzozoozzzzzzooozzzzzzoozozozzozzzozoozozzzzooooozozoozozzoozoozoozzzozzzzzozzzzoozozzzozoozoooooozzzzozzoozzozoozzzzzzzzozoozzozozzzooozozzzoozzozzzzzzzzozozozzozozzooozozzzoozzzozzzoozzoooozozzzzozooooozzzoozoozooozozzozzozzoozozozozoozzozzzzooozoozzzozzoozzozozzzzzoozozzozzzzzzzzzoozoooozzoooozoooozoozzooozzzozzzzoozzzozozzozoozzzzooozzoozzzoozzoozzzooozoozzzzoooozoozoozzozzoozoozzzozzoooozoozzzoozzzooooooooooozzzoozozzzzozoozzzzzoozoozzzzoozozooozooooozzooozzzzozozozozozzozozzzoozzoozzoozzozozooozooozzozozozzzzozozoooozzzzzozzoooozzzzzzooozozozoozoooooooozozoozooozzozzoozzzzzzozzozooozzoozzozzzoozoozozozoozzzoozoozzozozoozozzzzzzozozzzzooozooozzozozozzozzozzozzzzzzozzozzzozzozoozzooozzzozozoozzzzzzzzozoozzoozozozozozozozzozoooozooozzozzoozzzzozzozoozoozzozzozozoozozoooozzoozoooooozzozzzoozozozzozozozzoozoozzoozozzzzozozzzzoozzzoozzzoozzozzooozoozoozozzozzozzozooooozozzzzzoooooozozozzoozzzzzzoozzzooozozzzozzoooooozoozzzooozozozzozozzzozoozozzzzozzzzozzzzzozzooozoozozoooooozzozoozoozozzozzzozzooooozzooozzzozozzoozozozzoozozozozzzzzzooozzoooozzoozzozozozzooozoozzoooozozzozzoooooooozozozozooozozozoozoozozzzozozozozoozooozzozozzzzzozzzozzzzozzzzzzzoozzzzozzoozoooozozzzzzzzozzozzozzzzoooozozooozzozooozoooozozozozoooooooozozzzzzzzzzoozoozzzzooozoozozozoozozzzoooooozzzzooooozzooozoozozzzzozzzozzzzoooozoooooooozoozzzoozzzzzozzozozozoozooozozzzozzoooozzoozzzoozozozoozoozzzozooozzoozozzzozooozozozzooozozzooozzzzoozzzzozzooooozzzooozozzzzozzozoooozozzozzzzzzoozoooozzzozzzoozoooozzzzoooooooozzzzzzoooozzozooozzzooozozzozzzzoozozooozzozzzozzooooozzzzzooooozzzzozooooozzozoozzzozozozozoooozzzzzzozzzzooozozoozozzoooozzozzzoooozoozzooooooooozozoozozozozzoozooozozzozozzozoozzooooozzozozoooooooozzzozzzozoozozozzoozoooozozzozzzzzzozooozozzzzoozzzozzzoozzzooozoozozzozzzzozzzoozooooozzzzozzozzzoozooozoozoozooooozzzozozzozzzoooozozzozzzooozzzzzzzzozozzzzozzzzooozzzozozozzzzzzozzzzzzzozoozzozzoozoozozozoozooozzzzzooozzzzzooooozzozooozzzzozzozzozzzzozozzzzzzzzzozozzzoozzzzozoozzzoooozzzzzozzzzzzoozoozooozoozoooooozoozzzzoozzoozzzozozozzzzzzozozzzoooozozzoozzzzoozzzooozooooozozoozozzozoozoozozozoooooooozozoozozzzzoooozzzzzoozooozooozoozzooozzooozozooozzoooozzzoooozooozzzooooozoooooozzozzzozzzozozzozzzzzzzozozzzooozozzzozzooozzoozozzooozzzozozzzzoozooooozozooozzooozooozzzzzzzozozooozozoooozzooozoozoooozzozooozoozzzoooozzooozoozozozzoozozozzozozooozzozzzozoozoozzzozoooozozozozzozozzzzzzzoozzozzooozzozzzzozozozoooozzzzozzzzoooooooooozooozzzoozoozzozzozozzzzzoozzzzzzozozoooooozozooozooozzozzozozozoozozzzozzzooozzooozozozzzzzozzzooozozozzzzzozzozzzzzoozooooozozzozozozozzozozozozozozzzzzzoozoozzozzozzzzzoooozozzzoozzzzozzooooozoozzooozozooozzzozzzzooooozozozzoozzzzozzoooozzzzzzzozooozoooozzoooozozzzzozzzozoooozooozoozooozoozozzzzoozzzoozzoozozzozzzozzozzzozzzozzozoozozzzzozzzzzzzzzzoozozoozooozoozzzozozzzzozozzozozzozzoozozooozozozzzozzzzzozoooozozozozzoozozzooozzozzzozozoooozozzzzozzzozozzoooozozzzoozoozozzozzzoooozzozzzozzoooozozozozoozzzzzzooozozoozooozozoozozozzzozozzzzozzozoozooozooozooozozozozooozzzooooozoozzzzzzzozozzozozozzoozoozozoozzzzooozozoozzooozoozoozzzzooozozozzzoozooozoooozoooooozooozoooozzoooozooooozooooozooozozzzzoozzoooooozoozzooozzozozzoooozzzoozooozzoozzozoooozoozoooozozzzzzzozzozooozoozzoozozozzzozoozzzzozoooooozzoozzozoozzozzzzoozzoozzozoozzzoozzooozozzozozzzzoozooozzzoozozzzooozoozoooozozooozozzzozooooozozzzzoozzooozoozooooooozoozooozozzoozzozzzozozzzzozzzoooooozozzozzoozozoozooozoozoozozoozzzzzzozzzoozozozozoozozzozzozooozzzozoozzooooozzoooozzoozozzzoozozozzzzoozozzozzzzzozzooooozoozozzzzzozzzozozzoooozzozzzzozoozozoozzozzoozozozzozozozozooooozozzzzzzzzzzoozzzzozzozzooooozzzozozzoozoozzooooozzozozozzozozoooozzzzozooooozoooozozooozozoooozzozozozozzzoozozzzzzzzzoooozozoozozozoozzzozooozzozzooooozzozzooooozoozooozzzoooozzzzzoozzzooozoozoozozoozzoozzzozozoozzzzoozooozzzoozzzzozzzooozzzozozooooooozozoooozzzoozozzzoozozooozzoooozozzozzzozozzzozzoozzzooooozzzzoozoozzozoooozozzzoozozzoozooooooozzozzozzzzoozzzzoozozzzzoooozzoozzozzzozoooooozzozzzzzzzzoozoozzooozzozzzzozzoooozzzozozoozzzoozooozzzozzzzozzzozozoozzoozzzzozzzozooozzoozzzoozoooozoozoooozoozozozzoooooozzzozzzzoooozozzozoozzzzoooozzzoozzooozooozozzoozozzozoozoooozzzoozooozozzzoozoooooozooozozoooozzozooozoozoooozoozzooozozozozzzzzozooooozzozzzoozzozzzzozoozzzozozzzzozoooozozoozoozzzzoozoooozzzoooozozozzzozzzzoozzozzozzzoozooozzzozzozzozozooooozzzozzzzzozzooozozzoozozzzzzoooozoozzozooozozzoozooooozzzzoozzzzoozoozzozzoozzoozozzzoozooooozoozzooozzozozoooozzozzzoooozzzoozoozzoozozozozozozoozzoooozozozoozoozoozzzoozozzzoooozooozozoozzozzozzoooooooooozzzzzozzoozzoozzozzzzzzzoozoozzooooozzzozzzzzzozoozozooozzoooozooozzoozzozzzooozzzozozzzzzzoozozzzzoozzozzzooozzzzozzzozozoozzozzzooooooozzozzooozzoooooozzzoozozozooozoozozzzozzoooooozzzzozozzzozozooozozozzzozoozzoozoozoooozozzooozzoooooozoozzzzzzzzzzzzzzoooozzzzzozzooozooozozzzoooozzooozzzooozoozzozzoooozzooozozozzzoozzozzzzzzozooooozzoozzooozzzzozooooozozzoozoozzozzzozzzoozzoozzzoooozooooozzzzozozzozozozzozozooozooozoozooozzoozozooozozooozzozozooozzozzozzzzzzoooozzoooozzzzozozzzozzzoozozzzozooozzzozozooooozzzoooozzzooozoooozooozzoozoozozooozzoooooozzoooooooozozozzozzoooozzooozoooooozzzozzooozoozoooozzzzzzozooozozzzzzzzozzzzozozoozzzzozzzzzozzzzooozozzzzzzozozozozozozzozzozozzozzozzozzzoozooozzzozoozzzzooozzzozoozozzzzzozooooozozozozzzzzzzzzzzozozoooozozozozozzzzoozozzoozzooooooozozzozzooozoozoozooozzoozzoozzzzozooozooozozzozoozzozozozzzoozozzzozzzzzoooozooozozozzzzoozzoozozzoozzzzzoooooozzzzzozoozozoozzoooooooooooooooozzzzzzzooooozozzoozzzzzoozzzzozoozoooozozzzozozzozozzooozozozzooozozzozzzozzooozozzozoozooozozzzzozoozozzozoozzozoozoooozzzozoozzzzzozzooozooozzozozzoozzoozozoozoozozozoozzzzoozoooooooooozozzooozooozzzzozzzzzzooozzozozzzoozzozzoozzoozzzozozoozzoozzzzzzooozzzozzozooooozzzzoozzozozzoooooozozozozzozozozzzzoooooozzooozozzzzooozozozzzzoozzzzzzoozozzzozzoozoozooozzzzooozozzzozzzoozozoozzzzzooozoozzozzzzoozzzzozozzozzzozzooooozozzzzzoooozzoozzzozozzzzzozoozzozzozoozozzzzoozozozozozoooooozzooozzooozzzzzzzooozzozozooooozozoozooooozzzozzozooozzzooozoozzzzozozozozzzzzozooozozoozoozooozzzozozzzzzozoozzzooozozozozozozooozzozozzzoozoozzzzzzzozozooozooozzoozozoozzozoozzozzozzzozozzzzzozoozzzoooozzzzzozooozozoozozzzzzozoozozzoozzzooozooozoooozoozoozoozzzzzzzzoozozzozzozooozoozoozzzooooozozzozooooozooooozzzozozozzzzzozzozzzzzozzzozozzzoooozzozzozzzzzoooozzoozzzzzzoozzoozooozoozozozoozooozozooozozzoozooozzzozoozzzzozzzoozzozozooooooozzzzzooozzzzzzzzoooozoozzzozzozozozzozozzozoooooooozzzzzozozzozzozzoozzoozzzozooooozoozozzozoozzozzozozozozoooooozoozzzoozzozozoozozozzzoooooooooozozozzzozozzzozzooozzzozzzzooozzooozoozoozoozzzzozooozzzozzozzzzzzozozzzooooozoozzoozozzzzozoooozoozzzzzzzozzzozozozoozozoozzzooozozzozozzzzoozoozozzzoozozoozzzoozoozoozzzzoozzozzozozzzzzzoozzozozozzozzozozzzzooozooozozzoozozzzoozooozzooozzzzzozzzooozooozzzzozoozzozzzozzzoozzzzozzzooozooozooozzzzooozzozzzozozozozzzzzzzoooozozzzzzzzzzzozoozoozzoozooozzooooozoooooozooozozoooozozozozzzzoozozzoozoozzzozzzzzzozzozozzzzzzzzoozoozozozzozzozozzzoooozoozozzooozoozzzozooooooooozzozozoozozoooozzozzzzzozzoozzooooozozzzoooozzzozzzozzzozozzzzzzzozzozzzzozzzozzozozooozozzzzzzzooozzooooozzozoooozozozzozzooozzzozzozzozzzzzzozzooooooozozzzozozooozooozoozozzozzzozzozzzzzzzozzzzzzooozzoozzzozzzoozzozzooooozzozoozoozzzozzoozzzooozozzzooozzzzzoozozozozzzzoozzzozzoooooozzooozzozooozzzzozzoozzoooozzozzzoozoozzozzzzzoozoozzoozoooozzzzzozoozzzozzozzozoozzozooozzzozooooozoooozoooozozoooozozzooozozzzooozozozzooozzozozoozzzooozzoooozozzzozzozzooozoozzoozzozoozzzooozozooooozzoozzooozoozzzzzozzooooozzzoooozoozoooozozzzozzozzozoozzoozoooozzzzzzozzozzzzooozozooozzozozzzooooozzzoozooooozzozoozzzzoooooozzzzoozzzooozzzzzoozooooozozozoooozozozozozzoozozzzooozzozozzozozzzoozzzzozzozozooooozoozzzzzoozzzzozzzzzzozozozooooozooooozozzzooooooozzoozozzzzozozoooozzzzzozooozozzzzzzzozzzoozzozoozooozoozozzzozozoozoozozzozozzoozoozzoozzzooooozzoozzozzzzzzoozzzzooozooooozzooooozoozoozoooooozozozzoozozozzoozooooooozzzzoozzoooozzzzooooooooooooozzoozzozozoozozzozozzoooozooozoozzoooozzooozozozzozzzoozzozzoooozzoooozozzozoozzoozzzozzzzozozoozzzooozoooozzzoozzozzooozozzzoozozoozzzzzzoozoozzzozzozzzozooozooozzozzoozzozooozoooozzoozozzoozzzozooozozozooozzzzzzoozoooozozzzozoozozzzzoooozzoooooozzozzzozzozzozzozooozzzzzooozozozoozozzzzozzzzzzzooozooozzzozzzzzozoozozzozozooozozozozzzozzzzzozoozozzzzozozzzoozoozzooozozzzzzooooooooozzzzozozooozzzozzozzooozozozzoozoooooozooozozzoozzzozzzoozzzozzozzzzozzzzoozozozzozzzozozzzooozooozooooozozoozzzozoozzzzozozooooozzzozzozoozzozzozzooozzzoozozoozzzozzzoozozooozzoozooozzzzzozoozzzozzozoozzozzzozzzooooooozooooozzozzozzzozzzzoozzzozzzozzzzozzozooozooooozzoozzzzoozoozzozozzozozzzoozoozozooozozozoozzzoozzozozzozzzozozoooozzzozozooozozzzozzoozzooozozooozzoooozooozzoozozzzoooozzozzozzzzooozozooooozozozzzzooozoozzooozozzoozoooozoozzzzzzzozzzoooozooozzooozoozozzzzzozzzzzzozozzozozzzooozzooozzzoooooozooozoozozozzzoooozozozozozozzzzoozozoozzzozzzoozzooozozoozzozoozzozzzzozzzoozozooozooozzozoozzozooozozzzzozozzzozzzoooozzzzooozoozzzoozzzozzzzozzoozzoozzooooozozzzozozzozoooozozzozzzooozoozooozozozzoozzoozzzzzozzzozozooooooozozoozozozozozoozoozzozoozozzzzzozzzozzoooozozoozoozoooooozozoozoozozoozzozzzooooozozzozoozzzzzzzzoooozzzzoozzzozoozozzzooozzozoozzozzzozozoozzoozzozzzoooozzzozozozoozzooozooozooooozzzzzzzozozzzozozzzzzoozoooozozozzzozzzzzzzzzooozzoozoooozzozozoozzzozzoozzzoozozoozzozzzzoooozzzozoozozoooooooozozooozzzoooooozozzozzzzzzzozzozzzzoozzozzozozzooozzzoozooozzzooozoozooozzoozozzzzozzzozzozoooozzoooozoozozozzzozzzozoozzzzooooooooooozzoozzooooozooooooozozozzozozzzooozoozooooozozozozooozozoozozozzozozzzzooozozozzoozozzzzzoozozzzzozzzzzooooozozozzzzzoozozzozzzozzzooozooozzozooozoooozozzzzzooozzzzoozzzzooozozzzzzzzoozozooozzozzzozzooooozzoozzozoooozzooozooozzozzozzoooozozzzooooozozzoozzozooozozzzzoozooozoooozoooozooozzozzoooooozzoozzozoozozoozooozzzzooozoozoozzooooozoozozooozoooozzzzzzzozoozozozzoozoooozozzozzzzzzozozzzzzoooozzzzzzzzoozzozoozoozozzozzzozzzzozzooooozoozzzoozzzoozzzooozozoozzooozooozzzoozozoooozozoozozzozzzoozzzzozozzzzoozzzzooozzzzozoozzzozzzzozoozozoozzozzozzoozozozoozoozzzzzzzzozzzzzooozozoozoozzzzzozzozoozozoooozzzozzzzzozzzzzzozzzzzoozozzozzozzzzzozozzzzoozoozoooozzoooooooooozzzzzozzooozoooozozzozzzozzzoozzozzzzzoozzzzooozzozozzooooozooooozzozzzooozozooozzooooozzzzooozzzzooooozooooozoozzooooozzzooozzzoozozozzzoozoozozoooozzoozozzozoozozoooozozzozozzzozoozzzzzzzzzzzoozzoozzooooozoozzozoozoozooozzzozozzozoozzoozozozzozzzooozooozzozzzooozzooooozoooozzooozozzozooozzzzozooozzoooooozozozoozozoozoooooozozzozoozzoozzoooooooozzzzzoooozozozozzzzoozzzzooozzooozzoozzozzzzozzzzzoooozzzoooozzooozoooozozozozzzoozoozzooozozzzzzozozzozozozozoooooozoozoozooozoozzzzzzozoozoozzzzozoooozzoozzzzozozzozzzzoozozozzzozoozooozzzoozzoooozzzozzoozoozzzzozozzzozzzozzozozooozzozzzzzooozooozozoooozzzzozzooooozzozzooozzzoozozzoozzzozooozozozzoozzzzzzzooozozzzozoozooozozzozzoooozoozzzozzoozoozozozozoozoozzoozzzzzzoozooozzzozzoozozzzoozozzzoozzoozoozozoozzzozzozzzzzoozoooozozoooozozozozoozzzooozzzozzzzzzozzozooozzzzzzzozzzzzozoooooooozoozoooozzooozzoozzozozozozzzzzozozozoozzzoooooozzzzooozzoozozzzooozoooozzoozozoozoooooozozzzzzozooozoozzooozooooozzoozzozozzzzoozozoozoozzooozzoooozozooooozozozoozzooozzozzzozzozozzzozzozzoozozzozzzzozzooooozzzoozoooooozzzoozzozozozoozozozoozozoooooozooozooozzzzozozooozzzozozozzzozzzoozooozozzzoozoozzooozzozozooooozzzoozooozzoozoozooozooozoozozoozzzzzzzzozzzzzozzzoozozozzoozozzzzzozzzzooozzoozoozooozzozzooozzooozozoozzzoozzzoooozzozozzozoozozozozoooozzoooozoozoooozozooozozozzzooozozozzzzoooooozzoozoozozozzozzoooooozzozzozzoozzozozozozooozzozzzoozzoozzzzoozoozooooozzooozzoozzozzzooooozoozzozozzozzozooozzzozoooozooozzozooozzoozzooooozozoozzooozozzozozzzzzzoooooooozozoozoozzzozozoooozzzozoozozozzozoozzozzozzozozzzoozozooooooooozzzzozzzzzoozzzzozzozzooooozzzzzozzoozzzozooozoozozooozzozoozoozozzzooozozooozoozozooozzzoooozoozozzzoozzzooozozzzzzzozoozoooooozoooozozozzoozoozzoooozozozzzoozozoooooozzzzooozzzzzoozzzoozzoozozzozoozzoozzzozooooozoooozzoozozoozzozozzooozzzzozoooooooozzzozoooozooozozozoozozzoozozzoozozzozoozzozozozzooozoozooozzzzooooozzooooozooozzoozozzzozoozooozzzozzoozzzoozozzoozzzzzzoooozzoozzozzzozooooooozozzozzzozooooozzooozzozzzzzzzzoooozzozozoozzooozooozozozzzzozzzzzzozozzoozzozozzzzzoozzozzozzozooooozozooooozoozozozzooozzzzzoozzozozzooozzzozozzozozoozzzozzzoozzzzoooozozzozoozzooozozozzzozooozozozoozoozzoozzoozozoooozzzzooooooozozooooozoozzozoozozzzzozozooozoozzoooozzzozzooozzozozozozzzzooozozzoozooozzzzozoooooozzooozozozzzozzzooozzozzzozzoozoozzzzozooozozzoooooozzzoozzzzozzozzzozzzozoozzzzzozoooozzozoozozozozozzooozzzzoozzzooozzoozozzooooozzozzzozzoooozooozoooozozzozoozozzozzooooozooozzoooooozozozooooozooozzooozooooozzoozooozooozozzzoozooooozoooozzoozozzoozzzozoozozzzzoozooozzzozozzzzzzzoozoozzozooozzzozozzooozoozoooooozoooozzoozzoozzozzzzzzzzoozozzzozzozzzzzozzozozzzzooozozozzzzzzozozzzzzzozoozooozozoozooozzzzozozoooozozozooozoozoozzozzozzooozzzzzzozzzozozooooozzooozzzozozzzoozoozozozozozzzozoooozozoozozzozzzozzzozoozzzzzoozozoooozoooooozoozzoooozzooozozzzozzoozoozozzzoozzzzoozzzzozzoozzozozozooozoozozoozoozozozzozzzozooozooozoozzoozzoozozozooooozoozzozzzoooozzzozzozzzooozoooozzzzoozzoooozoozzoooooozozzzooooozzzzzzzozzzooozzozzoozzzzzozzzozzzoozoozzzoozozzzooozooooozozoozoozzoooozzzozoooozzzzozzozozoozozoozozzozzooozzzzzozzozzoooozzooozozzoozzzooozooozoozozzzoozzzozzoozzozzzoozzozoozooozozzzozozzzzoozozzzozoozzzzzoozzoozozozozzozzoozzzozoozzzzzzoozozozzooooozzzzzoozzoozzzzozoozzzzooooozozzzozzzozozzozzooozoooozzzozozozzoooozzzzooozzzoooozzozzozzooozoozoozoozzzzozzoozzzooozozzooozzzzozoozzozoozozozzoozzoozzzzoozozzozooozooozzoozzoozozooozozozzooooozzzzzozzzzzoooozozooooozoozzzozoozzozzzzoooozozzozzzozzzozzzzzzozzzooozzozzzzozzozozzzzzzozozzoooozzzoozzzzzozzozozoooozooozoozzoozozooooozzozzozozooooozozozooozzozoozooozozozzozozzoozzoooooozzoozooozzozozooozzozoooozoozozoooozzooozzzozozzozoozzzzozzozozozoozzzzzozozoozozoozzzozzzoooooozzzozzozoozooozzzooozozozzzooozzzooooozzooozzzzzzzoooooozooozzzzooooozoozzzzzzozozzozoozozozozooozzzzooozozzozzzooozozozzooozooozzozzoozoozzozoozzzzzoozooozzoozozzooooozzzzzzzoooozzzozzoozozzzzzozoozzozoozoozozozzozzoozzozzzzooooozzozozzzoozzzzzzzooozzzzzzozooozozoozooooozzzoozozoozzzzzooooozoozoozoozooozozozooozoooozzzzooozzzozozzzzzoooozzzozozozzoozzzozozozoozozoozozozozozzzzoozzooozoozzooozozzozzozoozoozzzozozzozooozozzoozzozzozzozoozzoozozoozzzoozzozzozozooozoozoozzoozozoozooooozozzzzzzzozzooozzzzzooozzooooozzzoooooozoozzzoooozzooozzzozozooozoozooozooozozozzzoozzzzoozzozzozozzzzzooooozoozzzzzzooozoozooozozozzozzozzoozozzoozozzzozooooozzzozzozoooozoozzzzozozooooozzzzzozzzozozzzzzooozzooozoozooozozzozozzozoooooooozozooozoozozzzozozzzzozzzozooozozzozozzzozozoozzoozzozoooozooozzzozzoozzozzzzzzozzzzooooooooooozzzoozoooozzzozzzoozozozzzzoozzoozzooozzzzozooooooooooozozoozzozzzozzzzooozoozzozzozzozzoozzoozzzoozozzzzzozzzozzzooozoozoozzzozzzzozzzozzzzzozoozozozozzzzoozzzoozoozoozzzzoozzoozzzzzzzozooozzzoozozzozzzoozzzzoozzoozozzzoozozzzoooooozzooozzzzzzzozoooozozozozzzoozzzozzoozzoozzzzzozoozzzoozoozzzzooooozzozzzooooozoozzzozooooozzzzzzzzozzozzozzoooooozozozzzoooozoozozzzozozzoozzozozozozzzoozoozooozzozooozzzzzzzzzzzzzzozzzzzoozoozzzozzozozzzoozoooozzozooozozzoozzzzzzoozozozzozozozzzzozzzzoozozzzozozzozzooooozzozzooooozzzoozzozzoooozzzzzozozzzozzzoozzozzzoozozozzzzooozoooozzoooozzzoozoozzzzozzozzozozooozoozzoozozzzzzzoooooooozzzozzozooozozozoozozzzzozozzozzzozzzozzzozzooozoooozoozzzozzzzzzoozzzozozoozozozzzzzzozzzooozooozoooozozzoozozozoozoozoozzozooozoooozoozozzooozzozoozzzozozzoozoozzzoozoozzozzozzoozzoozozzozoozozzooooozoozozzzzozzozzozoooozzzoooooooooooozzoozooozoozoozozozoozzzoozzzzozozozzozozoozzzooozzzozzzzzzzzozozzooozoozoozzzozoozzzoozzozoozzozzoozzooooozzooooozzooooozzzoozozoooooozzozzzoozoooozoooooozzozoozzozoozzoozzzooooozozozzozzzozzoooozzzoozzooooozoozozzozoooooozzozozzzoooozzzzzozzooooozozzzozoozzzzzozozzzozoozzooozzzzozzozozzzoozzozzzzozzzoozoozzoozzzooozzzzozoozzzzzozzzoooozzoozoozzozzzzoozoozzozzozzzzozzzoooozzzoozzozzzozzzozzoozozoozzoooooooozoozzzooozzzozoozoozozzozzzoooozzoozzzzozoozzoozzozozzozozzzoooozzoooooozooozozzozzozoooozooooozzozzzzozooozoozoooozzzzoozzzzozzzzzoozozzzooozoozoozzzooozzooozzozozzoozozzoozoozzoooooooooozzozzzzzzozzzozooooozzoozozozzozoozzozzzzozzzzozzzozzzzoozzzooooozzozzzzzooozozozozzoooozzzzzoooozozzzzoozzzzozooozozozzzozoozzooooozozooozooozzooooozooozooozozooozzzzzzzzzoozozoozzoozzozzozzozzzzooooooozzozzzozzzozozzozooooozzzoozoozzzzzzozzzzozozzzzzozozzoozzoozozzzoooozozzozozozzzzoozozzzoozzzzooozzoozzozzozzzzoozozoozooozzoozooooooooozozzzzzzzoooooozzozoooozozozzozzoooooozooozoozoozzzozzzzzzoozoozzzzzozozooozozozzozzoozozzozoozooozoooozzozozzzzozoozzzooooooooooozzozzzooozoozzozzoozzozoozozooozzzzzzzozozzzozzzozozoozzzzooooozzoozozooozoozzozozozoozoozzzozozoozzozzzozozzoozzzozzzzzzzzozzoozzooooozozoozzoozozzzozzzooooozoozoozzoozooooozozzzoozzzoooozoozzozzzzzoozoozzozozozooozozzoozooozoooozzzozozzozzzzzoozzzozozzzooooozozzozozozzozozooooozozzzzzzooozooooozzzozoozozoooozoozzzzzzzozzooozozooozzooooozzzozoozoozzzoozozzoozoozooooozoozzzooooooooooooooozozozzzozoozzzoozoozozzoozozzozozzoozzoozozozzzoozzzzooozozzzzozzooozzzoooozzozzzzoozzozooozzoozzzzzzzzoozzooozozozoozoooozzozzzoozooozzzoozzzozzozooooozozoooozooozozzozzozzzzoozoozooozozzoooozooozozzzoozzozozoozozoozzzoozozoooozzoozoozzzoozzozozzzozzzoozooozoozzooooooozoozzozooozoozzoozozzoozoooozozzozoooozzzzzoooooozozooozzozzozozzooozzzozozzzzzzzzozzzozzzzzzozzzoooozoozoozzzoozzoozooozzoooozzzozzzzoozzozozoozzzoozzzzoozoooozzoozzzozzzzooozzoozoooozzozozzozzzzzooozoooozozozzzoozzozozoozzozoozoooooozozzzzooooozzzozooozzzzozozzzzzzozozzozoozozzoozzzzooooozozzooozzoooozzozoozzzozzoozoooozzozzozzzzozzzooozzzzzzoozzoozzozzozzozoooozoozzooozozzzzzooozozoooozozoozzozozzzozozzozooooooozzoozzozozzoozzoozoozozozzooozooooozozozozzzozzoozooozozzzoooozoozozzzzzoozozzozzoooozzzozzzzzoozooozooozzooozzzzozozzoozzzzzzzozozozzzzoozooooozzzozzzzozooooozzoozzozzzoooozoozozzozzzzozzoooooozzzozooozozooozooooozoozzzzoozozzzoozooozozzozozzzzzzzooozzzozzzozzozoooozzzozzzzooozoooozzooooooooozoozoozozoozzozoozozozzzzozozozzozozzozoozooooozozzzzzooozzzzzzzzozozzozzzzoooozozozoozzzzzzozzoozooozzzoozzzoozzzzoozozzozzzozooozzzzoozozoozoozzoooozzozzzoozzozozozzzzooooozooozzzzzzoooozoozzzozoozzzozzzzozzzzzzzooozzozozzozozozzoozozzozozozozzoozzozzzozozoooozooozzzoooozzozzzzozzzzzzozoozozoozzoozozzozoozozoozoooozoozzoozoooooooozzozzoooooooooooozzoozzzzzzoozzozzzzoozzzozzoozzzzzzzzozoozoooozzozozzoooozozozzzoozozzzozzoozzooooooozooozzzoozooooozzzzozozzzzozzzozzooozoozozoozoozzozozzozzozozooozoozzozooozozzozzzzooozzzozooozozoooooozoozzozoozzooozzzzoozozzozozzzoozozoozozzoooozoooooozozooozzzozozzzozozozoozzzoozzoozzzzzzoooozozoooooozozozzoozoozooooozozoozoozzozzzooozoozoozzzozzoooozozozzzzzozzzoooozooooozzzzzozzzzozzzzooooozooooooozozzzooozzzzzzozoozzzozzzooozozozzzozoozozooozozzozoozzzozoooooozoozzzozooooozzoozzoozoozozzzzozozozozozzzozzozzzzzzooooozoooooooozzzoozozoozzoozoooozzozzozzzozzozzozzzooozoozzzozooozzzozozooooozozzozzozzzozzzoooozzzoozozzoozooozozoooooozzozoozzzzoozzoozzozoozzoozzzzozzzooozoozozzzzoozoozozozoooozozzzzzzzzozzoozooozzoozzoozzooooozzozzooozzozoozzzoozzzoooozozozoozoooozozozzozooozzzooozozoozozozzzzzzozzozoooozzzozzzzzoozzooooooooozoozzzooozoozzzzozzozooozozozozooozozoozzzoozzoozzzzzozzooozozzoooozoooozooozozozzoozooozzzzozzozzoozozzoooooooozozzzoozozoozzzoozozoozoozzoozzzzzoozoozoooozoozzoozoooozoozzzzzzozoozooozozzoozozzzzzooozzozozozzzozoooozooozzoozozzozozoozozzoozzoozzooozzozooozzzozzozooooozzzozzzoozzozzzoozooooozzzzozooozzzzzzzozoooozooozzzzozzzozozoooozozooozozzzzzozozzzzzozozzzoozozzozzozoooozzzooozoozzzzoozoozoozzooozzoozooozzoooozzoozzoozzzzooozzzzozozozooozzzzooooozozoooozozzzzzozozozozoooozzooozooozzzoooooozzoozzoozozzzzzzzzooooozzzzzozzozzzooozoooooozzzzzzoozozzozzzzoozoozzzoooozooozzooozozozzoozozooozozozzzooooooooozzzzzoozoozzzozooozozozzoooozzoooozzozzozzzozoooozooooozooozzozoozooozoozooooozzzzoooozzzozzooooozzozozzozoozzoozozooozzoooozzozozozzoozzzzooooozzozozozzzzoozzoozzzozoozzzoozzoozzozzoozoozoozzzoozozooozozzozzzozzzoozzzozooozozozzzooozozzoozoozoozzozzozozoozzooozzooooozzoozozoozzzzoozoozoozooooozzzooozzzozzozoozzoozzzozzozzzozozozzooozozoozozzoozozozzzozzzzozozzzzozooozozozzzzozoooozooozzzozozzozzoozozzzozoozoooozoozooozzzoozoozoozzozzoooozzzoooozzooozzoozooozozozzooozooozzzoozzzozozzozzzzzzzoozozzzoozozzzozoozzooooozzoozoozozoozzzozozzozzzozzozzozozzozzzzzzoooozzzzoooozzzzozoozzzozzzooozoooozzzzzozzzozzoozzzooozzoozoooooooozozozozzzzzzzzoozzoozzzoozzozozoooozzzzoozzozzzozzozzoooozzzoozoozzzozzozooozozoooozoozooooozzoozzoooozoozozzzzooooooozzzzoooozoozzoooozoozzoozzzooozozzooooozzzozzoozzoozozozozzzzzzozozzozozzozozzozooozoozzzoozozozzzozzzooozzozzzooozoozzzoozoooooooozoooozozzooozzzzzooozzzozzzozooozzzzzzoozoozozzozozozozozzoozooooozozoozozzoozzozooooozoozozozooooozooozoozooozzozoozozoozzoooozzooozoozooooozzzzoozozooooozoozzooooozzoozzoooozzzozzzozzzoozozzoooozzoozzzzzzzzozzozozzzooozzooozzozzzozoozzoozozzozzzoozzoozozoooozzoooozoooooozozzoooozoozozzozzzzzooozoooozzozozzoozzozozzzzooooooozzozzzozozzzzozozzozzzzzozoozzzoozzzzzzzooozzzzozozzzoozoooooooozzozzzzoozzzooozzzzzozoozzooozzzozozzzoozoozozozozozozozoooooozoooozzozzooozzzzozozozooooozzoozzooooozzzoozozooooooozzzzzooooozoozozzozozozzozzzzoozzoozzozzzozoozzoozzoooooozzzozozzzzzzzooozoozoozzozozzooooozozooozozozoozzzooozzzozozzzzoozzoooozzozooozoooozozzzoooooozzzzozzzoozozzoozoozzzoozzzzzoozozzzozzzozzooozooozzoozozozooozzoooozooozzoozzzzoozzzoooooozzzzozoozzzzozzzzzzzozozzoozzzzzzoozoozooooozzzozozzzozzzozozozozozozzzzooozzozooozzoooooozzoooozooozozzoozzzzozoozoozzozoozozoooozzoozoooozzzozzoozozozoozzzzoozzzozoozozozozzzzzzoozoozzzzzzoozzzzooozozozzzzozoooozoozooozooozozzozzozozoooooozzzzooozzozzozzozozzzzoozozzzozoozzzzoozozozzooozozzooozzzozooozozzzozozozzoozoozzzzoozzzzzzzooozzoozoooooozozzoozoozozzzzzzozzzozzozzzzoooozozozozzzoozzzzzoozzooozzoooooozzozzzooozzzzzzzzozozoozozozozzozzozooozzzzoooozozoozzooozozzozzzozozzooozooozoozzozzozooooozzzozozzzooooooozozzzooooozozzoozozzozooozzoozzozozoozozzzoooozzoozoooozozozoozoooozooooozooozozooozzozozzzzzozzooozoozozzzzzzzozozzoozozzzoozzoooozozzozzzozoozooozozzooozzzzozooozzzooooozzzooozzzzozzzozooooozzzzoooozzzzozoozozozozzozzozozozooozozzzozoozozzzzzzzoozozozzzoozzzozzozzoozoozzozooozzzooozoooozoozozzozozozzooozzzzoozzzozzoozzzzzzoozoozozooooozoooozzozooozzzzzzzoozozozozzzozozozooooooooozzzzozzoozzzzooooooooozooozzzozzzzozozooozoozoozozozoozozzzozozoooozzzzzoozzozoozozzoooozozoozoozzzoozzzzzozozoozzzoozozozozooooooozzozozoozzooozozzoozooozoozzozozozzzzooozozzooooozzzooooooozooozzzzzzzoooooozooooooozoozozzzzoozzzooooooozozozozzzoozooozzzzzoozzzooooozzzoozzoozooozzoooozozoozzoozzozoozoooozooooozozooozoozzzzoozzoozoooozoozooooozoozzozooooozzooozooozozzzzzozzzzzzzzozzzzzzzzozzooozoozoooozoooozzzzzooozooooooozooozzzooozzzzzooozzoooozozoozzzzoozooozzzzoozozooozooozzozozzzozozzozooooozooozozzooozzzozozozoozozoozzozozoooozzozozoozozzzzzzoozzoozozozzoozzozzoozooozzozozzzzozoooozozozzzoozzooozzzzozoooooooozooozoozzzozozzozozooozozozozoozzooooozzoozzzozoozzzooooooozzzooozoooooozoozzzzozzozzzzzzozozzzzooozzzozzzozzooozzoozzzzozzozozzzzzoooooozoozoozozzoozzoozzzzoozzoozozozozoozozoooozozzooozzozozzozozoozozozoozzozozzozzzoozoozzoozozoozzzoozoozzozoozoozzozzozooozozozzzozoooozozzzzozzozzozzzzzozoooozozooozozzozozzozzzozozzoozzooozozooozozzooooozozooooozzzoozzzzzzzozozzzzzooooozzoozzooozzzoozozozzzozzoozozozozzzzzzoozzzozzozzoozzzoozzzzoozzzozozzzzozzoooozzzzzzooooozozoozooozozooozzooozozzzoozzzooozzzzoooozzzzzzooozoooozoozzzzozoozoozzzzzzoozzzzozooozozzooooozzzzzooooozzoozzoozoozzooozzoozooozzzzooozzooozozzoozzzozzooooozoozozzozozoozozzzzzzozoozzoozozozozzzoozzzoooooozzoozozoozoooozzoooozoozzzzooozzzzozoozoozoozzzozozzzzooozzoozoozzozozzoozozoozzzoozoozozzozzozoooooooozoozozzozozzzzzozoooozozozooooozoozozzoozooozzzzoozozozzooozozzzzzozozozozzozoozoozzozzzozzozzzozozzozozozzoooozzoozoozzzzozoozzzzzozooozooozozzzooooozooooozzoozozooozoozozoozzzoozooozzzooozozzozoozzozozozzooozoozozozzzozozzzozzoooozzzzzzzooozozoozoozozoozoooozozozzoozoozzozoozzzoooozoozzzzooozzzzzzzozzozoozozozozzzzzzzzoozzzozzozzzzoozoozzozzzzoozzooozzzoozoozzozzozzzzoozzooozoozzozzzzozzzzzzozzozzzzoozzzooozzooozzzzzzzoozoozoozozzoozooooozzozoozzzoozzzzzzozzozzozoozzzoooozzzoozozzzzoooozooooozoozzzzzoooozzzooooozooozoozzzzzzozzozoooooozozzzoozooozoozooozozozoozzzzozzzoooozozzzozozooooozozoooozoozzzozzoooozozzoozoozzooozoozooozzozzzozzozzoooooooozzzozzzozzoooozoozzzzozozzoozzozozzoozzzooooozzoozzzzooozzooozzoooozzzzozozoozozzozoozozoozozoozzozzzoozoozzozoozozozozooozzoozoozoozzooooooozzozzzzzzzozozozoozzoozzozooozzzzzzozoozozzoozzzzzzzooozzozoozoozozoozooozzzzozzzzzzoooozzzozoozoozzoozozzooooozozzzzozozzozoozozooooozozooozzoozoozozzozzoozozoozooozooozzoozzzzozzozozozzzozooozzozzoooooooozoozoozoooozooozooozozzzzzzozzooozoozzzozozozooozozzoooozoozozoozoozozzzooozzoozozozzooozzzzooooooozooozzzoozozzoooozzzzozzooozzzozoooozzzzzzozozzzzzozzoozoozzzzooooozzzozzzzoozoooozzooozzozoozzzzzooozzzooooozozzoozooozozzozzoozozozzoozzzzooozzzoooozozozzzozoozzzozozzoozzooozoozozooozozzooozooozoozzzozozoozoooooozozozzzzoozozzzozoozzzozzzzozzzozoozozzzoozzoozoozoozozozozzooozooooozozzzzzozozozoooozzozzoozozozoozoozoozzozozoozozozozozzooozozzoozoozoozozozoozzoozoozooooozoooozoozoooooooooooooozozzzozoozzooozoooozzzzzzzzozozzoozzoooozoozoozozzoozoozzzozozzozozzzozzozzzzzzoooozozzoozzoozzzozzzzzozzoozzozozoozozooooozozoozooozzzoooozzzoozozzoooozooooozozzzzzozzozzzzzozzoozoooozzoooozooooozzzzozzozoooozzzzzozzooozzzozozzozzoozozoozzzoozzzoozzoozooozoozzooozooozzozzzoooozzozzoooozzoozoozozzzoozoooozzozoozzozozooooozzoozozozoooozzoozozzozzozzozzzozzzzozzzzzzzzozoozoozzzzzzzoozozozzoozozzzozzozoozoozoooozzzoozzzzooooozozzoozzzozooooooooooooooozoozoozzozzzzoooooooooozozzoooooozozoozoozoozzozooozozzzzozozozzzzzzzoozzzoooozzzzzozozoozozzozzooozzzoozoozzzzozoozoooozzoooozzzzzzoozoozozoozooozzzoozzzzzzzzozzoozzzoozoozoozozozozzozzzooozozoozzzooozzoooozozozozzozzooozozzzzoooozooozoozzozozzozzzozooozozozzooozoozoozozzzoozzzzozooooooozozzooozoozoooozooooozzoozoooozzzozzzzzooozzzzooozzooozzzzzzoozozzzooozzzzozozzooozzozozzzzooozzzooozzzozzoozzzzzzoooozoozzzzoozzzoooozoooozzoozooozozoozoooooozozzzzozozozzzoozooozzzzozooozzzzzoozzzzozzozzzozooozozzoozzoooozooozzzozzozzoooooozzzzzzooooozoozzozzozzzoozzzzozoozozzozoooozzzzzzzzooozzzzozozozzzzozzzoozoozozoooozozzzzozzzzzooozzooozzzoozzzzozzozzozzzozooozozzoooooozzzozoozoozzzzzzoozzooozooozzooooozozooozozzooooooozozozoozzozzzzzozzzzzzzzozozzzozzozooozzoozozzozzzozozzzzzzoozzozoooooozooozzzooooooozzzzozzzzozozoozozoozzoooooozzoozoozzozoozzzozzozzozozoooozzozzoozoooozozozozoozzzzzooozzozozzoozozozzzoozzzzzzzozzozoooozzozozzozzozozozzzzzzozozozzozoooozzozozooozzozozoozzozzooozozzzzzozzozzooozoozozzozzozzzzozzozzoozzzozzoozoozoooozzzoozoooooozzozooozozooooozoozzzozoozzoozzzozooozozooozzzoozzozozozooozooozoooooooooozozozozzzzzozozzoozzozzzooozozzzozoooozoozoozzooozozozoozoozoozozoozzzzoozooozozzozoozozozzzzooozozzozozoozooooozooooozzzzozooozozzozoozoozooozoooozzzzzoozzzozzozoozzzzzooooozozozzoozzoooooozzoozzzozzozozzzoooooozoozozozoozozooozoozzozoozzzozozozooozooozzoozzzooooooozzoooooooozzzozozoozzzozoooozzozzozozozzoozoozzozozooozzozooozzzzzzooozoooozzoozzzzzozzzozzoozzzzzooozoooozzzzoozozozzzooozzzzozzzoozoozozzzoozzzzzzzzzooozozozzzzoozzozzzzzoozooozzozzzzoozozzzoozzoozzooozzooozozzozozoozzoooozzzoozzozooozoooooozzooozozzzzozoooozzooozozoooozozozzzozzzzooooozzzozzzzzoozzoozzoozozoooozzozoozzzzozozzozzoozozozooooozozoozoooozzozzzozzozzozoooozooozzoooooooozzzozooozooozzzooozozzoozozzoozoozozzozzzoozoozozozoooozooozozzzzzzzzzozzoozoooozoozzozzozzozoozozzozoooozozooozozzozozzozooozzozozzozzozoozozooooozozozoozoozozzzzozzzzozzzzzzozzzoozzzoozozoozoozzozzzzoozzoozoooozzooozzzzoooooozzzzozozoozozzoozzzzzzzzozzoozozzzzozzoozzzozooozozzoozozzzoozoozoozozooozozzoooozozzzzzooozzoozzooozzooooozoooooozzzzzooozzzzzoozzzzozozoozoozzzzooooozozoooozozzzzzzoozozzzoooozozoozoozoozoooooozzozzozzzzzzzzzzozzoooozzzoozozozozooozooooozzzzzzzoozozzoozzzzozozozzozzozoozozooozoooozoozozozozzzoozzoozoozooozzzzzoozozzzzozzozoozzzzooozzzoozoooozzozzzoooooozooooozzoozzozoooozooozzooooozzoooooozzzozooozzozzoozzooozozzozzzzooozzozozzoozozozoozzzzooooozooozozozozzozooooozzozoozzzoozozozoozzoozozzoooozoozzzoozzozooozzzzzooozzzozooozozozozzoozoozooooozozzzozzozozozzooozzzzzoozoozozzzoozzzzzozoozzozozooozzzoooozoozoozoozozzzzzozoozoozzooozozoozoooozozzozzoozzzooozzoozozozozoooozozzzzzzozzoooooooozooozzzzzzoooozzzoozozoooozoooooozozoooozzozzzoooooozzozooozzzozozzzzoooozzzozzooozooozzzoozozozoozozzzozzzoozozozoozozzozzozzzoooozzzoozoooozozzzoozooozzzoozoozzozoozozzzzzzoozozzzzooooozzozzoozozozzoozzzooozzzozozzzzozzoozzzooozzoozozozoozzzzzooozzzzzzzzozzooozzzzozzozozooooozzzzoozozooozzozzoooozzzoooozzzzozzozooozozozzozooozzoozzzzozzozozozzzzozzzozzozzozzzzozooozzzozozozooooooozzzzzoozzooozozzzozzzozzoozzozoooozozzzzozozzozzooozzozozozooozzzoozzzzzzozzoozzzozzozooozzozzzoozzooooozozooozzzooozozozozooozzzzozzozzoozzzzzzoozzozzzzzzozoozzozzozzoooozzozoozozzzoozoozzooozozzozozoozoozozooozzooozzozoozozozoooozozzooozozzoozoozozooozozoozoozzzzozoooozzooozzooozzooozzzzzzoozzozozzoozoozozzzzzzozzzzooooozoozzoozzozzzoooooooooozoozzzzzzzozooooooozzzozozzzoooozzzzoooozooooooozzzozooozoooozzzzozzoozzzoozzzoozooooozzozzzozzzozzooozzzzzzzzozoozzzoozzzzzzoooozzzoozzzzozoozoooooozzzozzzzoozzzooozozzzzzoozzooozzzzzozzoozoozzzzooozozozozzzooozzoooozzoooooooozzzzozooozooozzoozzozooozzzoooozzooozzzzzzzzooooozzoozzzozozoozozzzzooozoozzzzzzozozzzoozzoooooozzzzzozozzzzzooozoozzooozzozzoooozzozooozozoooozozooozzzzzozozoozzzzzoozzozozooozozzozzzzoozzoozozozzzoozoozoooooozzzozozzzoozoozozzzoozoozozooozzoozooozoozozozzoooozzzoooozzzozzzoozozoozzzzzozzzzzoozzzzzzozozzzzzzzozzzozzozzzoooozzooozzzzzzoozooozzzozozzzzooozzozozozooooooooozooooooozzzoooozzoozooooozzzzoozozooooozoozoooozozzzozozozozooozzzoozzzozoooozozozoozzzoozozozzozzoooozoozzzzozzzozooooooooozozozoozzozzozozzzzooozzozzozooozzzzzzzoooozzozoooozzzoooozzozoozozozzozozzzzzooozoozoozzozozozooozzozzoozozooozzzzzzzzooozoooozooozzozzozzoozozzzzzzzzooozzozzzzozoooozzzozzzoozzzzzzoozoooozooooooooozzzooozzzzozzozzozzzzozooozzzzozoooozzzozooozozzozzooozozzozzzozoozozzozozzzozzozzozozoozzzzozzozzozzooooozozzooooozoozozzozzoozozozzozzozozoozozzzzozozzoozoozozzzozzzzzooozooooozzzozozoooozozzzzoozozzooozoozozzzzozzozozzzozozzzooozoooozoooozoooozozzoozoozzoozzzoozozzzzozozoooozooozoooozzzozzoozzzzzzooozzzozozoooozoooozozzooooooooozzozzozzzooozzzzozooozzozzzozozzozzoozzzzzoooozooozzzooozoooozoooozzzzozzozoooozzzoozozzzzooozooooozozozozoozoozooooooozozozzzozozoozzzoozzzoozzzozooooozooozzozozzozzzzzooozoozoozozoozoozzooozozooooooooozozozooooozoozzoooooozzozoozoozozoozzooozzoooozzozzzooozozzzzozooozzoozzzozooooooozozozzozzozzoooooozzoozoozoozzozozozozoooozozzzoooozzzooooooozozozozzzzzoooozozzozoozozoozzzzzzoozzzoozzozzzozooooozoozzozzozzooozzzozzoozzzoozzozozoozzzozzzozzzzzooozozozzoooozooooozozooozzozzoozozzoozoozozooooozzozoozzoooooooozzoozooozozozozzzzzzzzzzozozozzzoozzooozoozoooozooozzozzzooozzoozooooooozzzooozozzzzzzozzooozoooozzzzoooooozozzzzzzzoooooozozozoozzooozzozzooozoooozzzzooooozozzzozoozozooozozzzoooozzozozzozozzzzzooozzoozozozzozzzozzzooooozooozoozzzooooooozzzzzozzzoozozzoozoooooooozooozoozzooooozozozoozzozozzooozoooooozzozzzzozoozozooooooozzozozzooooooooozzzzozzozoooozoozzozooozzozozzzozzzozzzzzozzozzzozoozozzooooozzoozozzzozzozzooozzzzzzzoozozooozozooooooozoozzzzzzooozoooozzozzzoooozozzozzoozzoozzzzooozooozzzozzzozzzozoozoozozooozooozozozzoozoooozozzzzozoozzozozzzozooooozzooozozzzzzzzozzzzzzzzoozzzozoooooozozzoooozzozooooozozooozozzzzozozzzzoooozzzzooozooozzzoooozozzzoozoozzzozzzzozozzozzzozzozzozzzzozzzzzoozzzoooozzzozzoozzzzozozozzzozoozozozooozooozooooooozzoozozooozzzzooozzzzzooooooozoooozzzzzoozozoozzzzzooozzzzoooozzozoozoooooozoooozozzzozooozozozzzozzoozoozzozooooozooozozzoozoooozozzoozoozozoozozoozoozzzzzoozozzoozooozoozzoozzzzozooozzoozoooozoooozzoooozooozzoozzzzzzozzzzoozozzzzozozzozzoozzozooozzozoozzozzzoooozzozzozzzozzzzzoooooozzzoozozzoozzzzozozoooooozozzoooozoozozzzzozozzzzozooozozzooozzzozozozozooozzozozzoozzzzzzzzzozzoozoozozozozzooozzooozozzzzzzzooozzzzzoooozozzzozzzoooooooozzozzoozzzooozoozzzoozzozozooozozzoozzzzozzozoooozozzooooozzozozzzooozzooozzzoozozzzozzzzzozzozzooozozzzooozoozzzoozzoozoooozzzzzoozzozozzzoozzzzzozoozzzzooozzzozzozozzooooozozoozzzzzozoozzzzzzzooozoooozzozoooozozzoozozzozzozozzoozoozzzozzzzzozzoooozozozozzozooooozzzzzzzoozoozozoozzzoozozoozzzoozzzzoozzzzzzozzozoozoooozzoozzzzzooozzzzzoozzoozooooozzzozoozzzozoozzoozozzzozzozzzzzzzzzozozozzzzzoooozoozzzzozzoooooozozzozoooozozozzzzzozzooozzozzozozzozozozzoozzzoozooooooozzozoozzzozozozzoooozzoooozoozoozozzozzzoozzooozzzzooooozozozzoozoozzzozzooozzozzoozzoozooozzoooozozzozozoozzzoozoozozoozzzzozzzzzzoozzoozozzozzzzzozzoozzoozooozozzoooooozzzoooooozzozozoozooozozzozoooozzzzzozozzozoozzozzozzooozooooozoooozzozooozozzozzzzzzoooozoozzoozozzoooooooozozzoozozooozzzozooozzoozoooooooozozozoozozoozzzozooozzooozooozzoozzzzozoooozozzzzzooozzozzozzzozoozoozoozzozozozozzoozoooozzzozzooozoozzoozozooooozzozoozooooooooozzozzzzoozzzzozzzzozzoozzzooozoooozzooozozoozozzoooozzzoozzooozzoozzooozzzozzoooozzzzozzozzoozoozzozzooozoozzzzozzooozzooozzzzzzzzzzzooozzozoooozozzooooozzozzoooozzozozzzozzzzzoozzzoooozozozozozoozozooozzoozzoozzoozozozzzozzzoozozozoooozozozzzzooooozoozzzzoooooozzzozozozzozzzzzzzzozozzozzzoozoozzoooooozoozozzzoozzoozooozzozzozozozzooozzozzoozozozzozoooooozozoooozzzozzzoozozozoozoozoozoooooozoozooozoozozzoozzzooozozozzoooooooozozzoozzozozozozozozoozozzzzozzzoozoozzoooozoozozzozzoozoozozozzozozzzzoozzozzzzzzoozooozzozozoozozozoozzozzoozzozoooozozoooozzooozzooozzoozoozzzozzozzozoozoozoozozzzzzozooooozzzzzzozozoozzoooooozzooozzzozooozoozzzzzzozzooozzzozozoozozooozozzozoooozoooozooooozoozzzozzozozzzzzzoozozzozzozoozooozoozzzzzoozzzooozozoozzozozoozzozozozoooooozzzoozzzzoozzoozozozoozzzozzoozzzzozoozoozzzzzzzzozozozozzzozozozzozzozooozozozozozzozzzoozozooooozooozoooozooooooozzoooozoozzozzzzozooooooozoozoozoooozzzzozozzzoozozzzozzzzozozozozzzzzzzzozooooooooozzozzoooozzzozzozozozzozooozzzzzzoooozzzzzoozzzozzozoooozooozoooozzzzozzzzzzzzozzooozzooooozoozozozozzozzzozooozoozzzzoozzooozzozozozzozzooozozzzoozzozooozozzzozozoozzzozoozzzoooozzoooozoozzzzzooozzzozoooozoozozzzzozoozoooooozzozzzzooozooozzozzzzoooozzzzzzzzoooooozzzzoozozzzooozzzozoozoooozzozozzzoozooozoozzzzzooooozzzzzoooozozzzzzoozozzooozozozozozzzzoooooozoooozzzozozzozoozzzzoozooozzzzozzoozzzzzzzzzozozzozozozoozzozzzozoozozoozozzoozzzzzoozozozzzzzzzzooozooozozzozozoozzozzzzozoozoooooozozzzozoooozzooozooozzooozzzozzozoozoooozooozzozzzzzoooozoozooozzozzzozzozzozzzzzooozozoozooozzzzozoozooozzzoooooooozozoooozoooozzzooozozozoooooozooooooozozzoozoozzozzozozozzozzzooooozzzooooozzzzzoozozzzoooozoozoozoooozozooooooooozozooozzoooozozzooozzzzooooozoooooozzozzozzzozzozzzzzzozzoooozzoozzooozozozoooooozozooozzzzozoozzoooozzooozzzozzzzzozozzozoozozzozzozozozzzzzzzzozozzozoooozzzzooooozzozzzozzzozzoozzzoozzzozozzzoozzzzooozzzzozzzooozzzzzozzzzzzoozooozooozozoozooooooozozooozzzozooozoozzzoozzozoozzzooozozoooozzozzzzzozozzzoozzzozzzooooooozozozzzozozzzzoozzzozzozzzzoozozzzozzooozzzzoozzzozzozozoozzozozoozozozzzoozooozozzozzooozozzzzozozozoozozooooooozzoozoozzzoozoooozozozozzzzoooozoooozzzzzzzzzzozzzooozzozzoozoozozooooozzoooooozozozzzzzzozozzzozzzoozoozozozozzozooozooozzzoozzzozozooooozooozzzozozooooozoozooooozzozzzzzozoozozozozoozozozozozozoooooozzozzoozoozooooozzzzozooozzoooozoozzzzzozzoozzzozozzzooozoooozzzzzozozoozzoooozoozzzzooooooozozzzozzzzoozzzzozoooozooozozzzzozzzozzozzzozzozoooozzooozzoozzozoozooozoozooozooozoozozzozoooozoooooooooozzozozzozzzozzooozozoooozozoozozoozoozzozozzzozozooozooooozozzzzozozozoozzozoozzzoozooozozozzzzozoooozooozozoozzzzozooozzozzozoozooozzzzoozooozoozzzzozozozozzoooooozzzozozzozzzozozzozozooozozoooozoozozzozzzozzzozzzozozozozzzooozzzzzozzooooooozozoozozozoozzozzozozzoooozzzozozzoozzzozzozzoooozzzozozooozzozzzozzzzozzzzzzozzzozzzzoozzzzozzzzzozzzzzozzzozoooozzoozzzzzzozzoozzzoozozoozzzzooozzozzzoozzoozozzzzozzozzzzozoooooozoozozzzozzoozzozozooozozzoooozozzzzzzoozzoozozzoozoooozzoozzoozozzooozzoozzzozoozozoooozzozzzooozzozooozzzozzozzzzozozzzozooozozzzzzozoooozzoozzzozzozzzzzzzozzozzzozoozzoozooozozoooozooozzzzzzozoozoozzozozzozzzozzozzozozzoooooozooozzozozozozzozoozoozozzzooozozzoozzzzzoozzzzoozzozooozzozozoooozzozoozooooozoozzzzzozzozooooozooozozoozzzzoozoooozozzozozzoozoozzozozoozozozozozzzzzozoooooooooozzoooozoozoozzzzzooozozoozzozzoozzzzzoozozozoozozozzzzoooozozzzzzozzzzozozzzozozzzzoozozozozooozzozoooooooozzzzozozzozozozzooozozzzoozoozzzzzoozoozzzzzozzozzzooozzzzooooozzooozzzozzozzozozzoozzooozozozzoooozzozzzooozzoooozooozzzooozozozzzzzzzozozzzzooozzozooozzozozzzoozzzzozoozooozozooozoozzooozzzzzoooozzozzoozozzzzozooozzozoozzozzzzzzzoozoozoooozzoooozzozoooozzzzoozzoozooozozzzzzzoozoooooooozzozzoozzzoozoooozoozzzzooozozozzooozzozzzooozoooozooozozozzoozzoooozooozozzzoozzooozzozzzzozzozzzzozzozozoozzzzzzooozoooozzzzozoozozzoooozzzzooozzoozzzozzzozoozzozoozozzozzzzooozzozzzozooozzozzzzzzozzzozozzzzoozozzzozzozzzzozzoozzzozozozooooozozzzzzoozooozzoozoooozozzooozozoooozozzzzozozzozzoooozzozzzzooozzzzozozooozoooozzoozoozooozzozzzooozoozoozozozzzzzooozooooozoozzzozoozzozooooozzzzozzoozozzzozoozzozzzzzoooozzoooozzozzoozoozzoozzozooozzozzzzzozzoozzzoozozozzzzoozooozzzzooozzozzoozzozozozozozozzoozzzzozozozzozzozzooozzozooozzzzozzzozozzoozoozoozzzzzzzzzzooooozoozzoozzoozooooooozzozzoozzzzzooozoooooozozzozozzzoozzzzozzzoozzoozooozzzooozozoooooozzozoooozzoozooozzzoooozooozozozzoozooozzzzzzzoozoozzzoozzzzzzooozzozozozzzozzozooozoozzzzzzoooozozooozozozzzozozooozozzoozzozzozzzzozoozzzoozzzzzzozzoooooooooooooozzzzooooozoozzzozzzozooozzzzoozzzooozzzozzoozoozzzzoozzzozozooozzoozoooooozozzzzzoozzoozzzoooozozzzzzozoozzozzoozooozooozzoozzooozzzzozzzzzoooozozoozozozoozozozzzozzzozzozzzoozzozozzzozozzzoozozozzzoozoozoooooozzzzoozzzzoooozozooozooozzozooozozzzooozozozzzzzooozzzzooozzzozzzzozzzoozzozzozozzzoozzzzzzoozzzzzzzzozozoozoozzzzoozzzozzzzzzooozoozzzozzozzzzoooooozozzzozooooooozoooozozozzoooozooooozoooozzzozoooooozozozozozozoozoozozoozoozoozooozzozzzooozozzoooozzzooozozzozooooozozzzzzozozozooooooooooozozozzzzozozozozoooozzozoozzoozzzzzzzozoozoozzzozzozzozzzoozzoozzoooozozzzozzzozoozozzoozozozooozzozooozooooozzzzozzzozozoooozzoozzozoozzooooozzzzzzooooozozzozozzoozzzzzzzzzzzzzzzzooooooozzzzzozoozzooooozzoooozozzozzzzozooozozoozozoozzzozozoozzzozoozooozoozzzozoozozzozzzozoooozozzozoozozzoozozzozzzzooozozzooooozoozzzozzzoozozoozzoozzozozzozzozozozzoooozzozzzzzzzzzzozoozzzozzzoooozoooooozzzoozozooozzoozoozzoozzooozozozzoozzoooooozzzooozoozozzzzzoooozzoozozoozzzzzzozozozoozozozoooozzzzzzoozzzozoooozzzozozoooozzoooooozzozooozoozzozzozzzoooozzzozooozooozzozozzooooozzzozzoozoooozzoooozozoozooozoozzzzzozooooozzzzoozzooozozooooozozzoozoozozzozoooozzozozozozozzzzzzoozzzoozzzooooooozzzoozozozzzzzozozzozzzzzooozoozozzzooozzzozzoooozozozozooooozozzzozozzozzozzzooozozooooozozzooozzzozozozozozozzzoozozooozzozzooooooozozozzzozzzoozzozozzoozozzoozoozooozozooooozozzooozzzzooooozozzzozozzozooooozozzozoozzooozzzozzzozzzzozzozzozzoooooooozzozoozoozozzzozzozzooozzzzzozoozozzzzzozzzzzooozozozooooozoozooooozooozozooozzzzoozoozooooozzzzoozzoooooozzoozzozzzozzozozozzozzzozozzzozoozzozzzooozozzoooozooozzoozozozzzzzzzooooozzzoooooooozzzzozzooozoozozozoozozoozozzzzzzzzooooozozoozoozoozzoozzooozozzzzzozzozoozozzoozoozozozozozzzzzzozzooozzoozozozzozozooozzzzzzzzzzozozooozozooozoozzzooozoooozzzoozzzozzozzozzoooozozzzooozoozoooooozozooozzzzzozzoozzozoooozozzzzozzooooooozooozozozozzozozzooozzzozoozozoooozzozzozooozzozozzooozzozzozzoooozzoozoozozoooooozzoozozozoozoozozoooozzzozzzozoozzozooozzozzzoozzzooooozooozzzozzzoooozozzoozooozooozzoooozooozzzozzzozzzoooozzzoozooozozozozooooooozzzzozoooooooooozozzozzoozzozzzoozzzzzozzzzzzozzzozozzzzozozozoooozzozoozzozzooozoooooozoozozoooooooozzozzozozoozoozozooozzzzozzozoozzzozzooozozzzzzzzzzoozozozzozozzzzoozooooozoozzoozzzzzozooozzzzooozooozooozozooooooozoozoooozooozoozozozzzozooooooozzzoozzzzzoozozzzzozozoozoozzzooozoozoozoooooozoozzzzzzzozooozozozzzozzzozzozoozooozoozooooooozoooooozzzoozzooozooozzoozoozzzzzoozozzozzooozoozzooozzzozooozzzooooozzozozozoooozzooozoozzzzzzoozzzoozozzzoooozoozzoozzzzoozooozzozzoozooooozzozzoozzozzzzooooozozzooozoozoozozzoozozzzooozozzzzzozzzzozzzzozozzzzozoozzzozooozzzozozoozzzoozozozzooozzzoozzzzozooozoozoozzzozzoozzoozozzooozzzozozzzzzoozzoozzzozzooooozoozzzzzooozzzzozzozzzzozooozoozoozozzoozzozzzzoooooozoozoooozzzozozzzoozozooozzzzzooozzozzzzzoozozzoooozzzzzzoooozzooozzzooooozzozzzzzozozozzzzozozozozoozzozooozzzoozozoozozooozzoooozoozozozzzzzozzooooozzoooozoooooozozozozzzzzozzzzzozooozzzzzzzoozzozoooozozozzzzooooozozzzozooooooozooozzoozozzozzzozzozooozozozzozzozoozozoozzozzoozzooozzzzzoozzoozoooooozzoooozzzozzzzzoozzzzzozzozzozzzzzzozozoozzozozoozzozzzzzzzoooozzoozzzzoooozzzzzzzzzzzzzoozzoozozozzozoozozoozzzzozzzozzoozzzzoozzzozozoozooozzoozoozzzzoozzzzozoozozzoozzooozoooozozozzooozzzozzzzooozzoozoozzzozooozzozozzoooooozzozzooozoozooozozzzozzzoozoozzoozozzzozzzzoozzozoozzooozozzzozozozzzoooooozzozzzzozooozozzozoooozzzzoozzzzzzoozooozoozoozoozozzzooooozzzozozozzozoooozooooooozzzozzzooozooooozozzozoozozozzzozozozooozooooozozzozoooozozooozzozzoozzzozooooozzzzzzzzzoooozozozzzooozoozoozzzozozoozzozzzzzzozzzozoozzooozooozzooozoozoooozoooozzozozoozooozozooozzzozzzozzzzzozozzooozozzoooozozozzzzzooozoozozzoozoozoozzzooozzozozzooozooozzozozzzoozzozzzooooozozzooozoozozzoozooozooozzzzzzzozzzzzoozoozooozoooozzooozooozoooozoozozzzozzzzzoozzoooozzozzoozozoozozooozzozzozozzzozozozzooozzoozozoozooozozozzzzooozozozzzozooozoozzoozzzozozzzoozzzzozzzoozzozooozzzzoozoozoooozzzozozzzzzozozoooozzzozzoozzzozoozzozzzzozzooooooozooozzzzozzzoozzzozzozooooozoooooozozoozozooozzzoozzzooozzzzzzozzzozzozozooozzzzozozozozozoooozzozozzooozooozzoozzzozozzoozozzoozoooozooozzozozzzozzzoozozzoozozzzozoooozozooozooozzzzoooozzzozzooozzooozoooozoozzoozzoozzzzzozooozozoozozzzzozoozooozzzozzozzzozozoozzoozzooooozooozozozzzzzzzozozzozozozozozzozzoozozzozooooozooozoozzzzozozzozzozzzzzzozozzozzozozzoozooozzzzzozoozozzoooooooozzzzoooozzooozozzozooozzzoozozzoozooozozozzoozzoozooozzzzooozozozozzoozzzozzzozzzzzooooooozozooozozooooozzozzzzozozooozooooooooozzzoozzozzzzoozozozzooozoozzooozzozozzoozoooozzzzooozozzozozzzzzzzzozozzzooozzzzzzozoozooooooozoozoooozzoozoozozoozzzooozzozzzooozzzozzozzzoozzozoooozooozoozozzzzoozzzzozzozozooozooozozzoooozzzzzzzzzzzoozzoozzzzzozzzzzzzozozoozozooozzzozzozzzzzozozozozzzozozzozozoozozoooozzzozozoozzozooooozzozoooozooooozzzzzozozooooozzozoozooozooozzzozzzoozozzzozzzzozooooozzzoooozzoooozzzozooooooozzozozzzoozooozoozzzzzoozzoozozzzzoozzzozzzoozoozoozzzzozooozzzzzozoozzoozozzzozoooozzozzzozzzzozzzzozzzoozoozzzzzzoozzoozozzozozzozzzoooozzzozzozzoozzzzzozzozozzzozzzzooooooozozzozozoozzozzzzozoozoooooozozooooozzzzoooooooozzoozozzozzozoozooozoooozoozzzzzozzooozzooozzooozzzozozzoozzzozzzooozzozozzzzozozzozoozooozzoooozozoooozzoooozzzoooozozzooozoooozozzozozzoozoozoozzozozozzozzoooooooozooooozzzozozzozzooooozoozozzozozzzzooozooooozoooooozooooozzozoozoozooooozozoooozzozzozzzzoozzzzzzzzzzooooozoozzzozzzzozoozooozooozzoozooooozzoooozzzoozozoozzzzzozzzzzoozooozzzozozzzoozzzzzoooozzzoooozzzzzozzzzzozzoozzzzzooozzzooozzozozooozzozzozozzzzoozzozoozozzozozzzzozoozozooozozzooooooooooozzoozzoozzzzzozzoozozzozzozzzooozozoozozzoozzozozoozooozzzozzzoozooozzzoozzzzzozzzzoozzzozoozozzzoooozozzzoozzzzzzozozozzozozzozzzzzzozoozozzoozzoozzzzzzzzooooozzzzozozozoooozzoooozzzoozzzoozzoozoooozooooozzzzooozzzzoozzzozzzzozozozooozzozzoozzzozooooozozoozozozozozzzzzzozzozzozzzozzoooooozozzozzoooozozzzzoozzoooozozoozoooozzozozooozozzozzzooozzoozzzzooozoozzozzoooozozooozooozoozozozzzoozooooozzzozzzozozzzzoooozoozzzzzoozoozzzooozzozoozzooozozzzozozoozzooooooozzzozooozozzozzzozoozoozzzzozzooozoozzozzozozozozzozzoozzoooooozzozzzooozoozzozooozzozooozzoozzozzozozzooozoozooooozzozzzzozozzzzozozozozzooozzzooozoooooozoozozzzooooooozooooozozzzzzzzzozzozzzzoozzzoozzoozozozozooooozozozozzooozzzzzzoooozzzoozzozooozzzozzzzoozzozozzozzzzzzozooooozozzzozzoozzzozzzzzoozzoozozoooozzozozzozzoozzzoozzzzozozzzzzozozozzoozzzoozooozoozozooozoozoozzozoozoooozoozzzzzooozzozzzzzzooozzoozozozozzozozozzozozzzzzzozzzozzzoooozozozzzooozozozooozooozzozzzozooozzozzoozzzoozozozzzzzooozzozzzoozzozzozzzozzzozzozozzoooooooozooooozooozzozozoozzozooooozoooozzzoozzozzozzzoozoozzzoozzzozozzooozzooozzzzoozozoozozzozozozozzzzoozzzzozzozzzzozozzzozozooozzzozozoooozzzzzzoozzozzozozoozoozzzzzzoozoozoozzoozozozozozzzoozooozzoozzoooozzozzozzzzzoozzzoozzoozooozzzzzozzoozozoozoozozzzooozozzzzozzzoozozzzoozzoozzzzzozozzoozzzozoozozoooooozzzzzzzzozozzozzooozozozzzzooozozzozozoozozzoozoozoozozooozzozozzzzzzzzzoooozooooozzoooozoozoozzzzzooooozoozzooozozzzozzozozzzoozozzozzozooozzzozozzzozzozozzzooozzzzozzozooozzooozzzozoooooozozzozzzzzzozzzzozozoozzozzoozzzzozozooozzozozzzzzzoooozzzooooozzooozzoozzozoozozzoozzooozozzzzzozzzzoozzozozzoozozoozzzoooozozzzzzzzzooozozzzzozzzozozozzozoozzozoozzozoozozzoozozozoozzzozzozzzoooozzzzzoozzzzzozzzoozzozooozozzozzzooozoozzooozzozoozzoooooozzzzoozzoozooozozzzzzzzozoozooozozzzzzoozzzoozoooooooozzzzoozozozzoozzzozzzozozoooozoooooozozoozzoozozooooozzoozoozoozozzzzzozozzzzzozzozozoozzzooooozzoozozoozzzooozozoozozozzooozooozzoooozzzzozoozozzoozzzozozooozozzzozozozzozzoozzoozzozozzzzoooozzzzzzzozozzzzzozzoozozzozoooozozozzzozzoozzzzooozoozzzoozozozozoooozzzozoozzozzzoooozozzzzzzoozzzozozooozooozzzoozooozoozzozzoooozozzzozoozzzzzzooozzoooozoozooozooozozzooooozozzzzoozozzozozozozoozzzoooozzooozzzoozzozoozzzzzoozooozoozzzzozzzozzzzozoozozzozoozoozzzzzozzzoozzzzzzozozozzzzzozzzoozzzozzzzzoozzozzzozzzozooozzozzzzzozzzzoozzozoozzooozozzozoooozzozzzooozozooooooozzozzoozozzzooozozoozzzozzozzzzzzozzzzoozzoozzoozoooooooozzozooozoozooooozoozozoooozzzozozoooooozozoooooozozzozzzozozzozzzoooozozozzzzozozozzzozzozzoozoozoozzzoooooozooozozozzzzzoozzzooozozooozzozzozozozozooozozzzzozozzozoozooozooozozzooooozzozozzzzozzzzzzozzoozzzzoozzzozooozoozzozzozooozzoooozzoooozoozzoozozozozzzozzozozzozzozozoozooozozzzozzzozzoozzoozzozozozzzzzozzoozooozzzzooozoozooozzzozzzzoooozzoozzzzozzoozzzzzzozooozzzzzooooooozooozzzoozoozzooooozooozooozzozzooozzozooozzzozzzzzozozzozzoozzzzooozozzzzoooozoozozozzozozzozoozoozzzooooozoozoozzzzoozzzozoozzooozzzozzzozzozooozzooozoozzoozooozzoozozzozzzozooozozoooozzozooozozzooooozzoozzozozozoozoozzooozozzoooooozzozozoozzzzzooooozzoozzoooozozzoooozzzzzozooozooozozoozoozzzozzzzooozozozoozzzzoooozzzooozzzzoozoozoozzzozzozzozzoooozoozzooozzzozoozzzoooozozzoozozzozozoozzoozzoooozzozoozozzzozzzoozzoozzozozzzozozoozzzzzooooozooooozzzzozozzzzzozzooozozzoozoooozzzzozoozooozooozoooooozooozzzoozoooozoozozoooooozozoozzzzooozzooooozoozozozzzzozzzozzoozzozozzzzzoozoozozozzzzzozozozzzoozozzozzzozozoozozoozzoozzzzzzoozzozzzoozozozzzoozozzzzozzozozzzzoozzzooozozoozozzoooozoozozozozzooooozozozzozozzooozooozzzzzzooozoozozzozzzooozzzozozooozzzooozzzzzoozzzooooooozzzzzzozzzoooozzzzzozzoooooozozoozozzozozozozzzoooozzzozoozooozzzozozoozzzozzzoozoozzozzoozozzooooozzozzzoozzozoozzzzzooooooozzzzooozoozzozooooozozzoozozzozzozozoozoozzoozoooozzzzzoozozooozzooooooozzzoooooozozzzozozzozzzzzooozzozozzooooozzzzzozzozzozzozzzozozozzzozzzzoooozzzooozozooooozzzzooozozozoozzooozozozozzozozzozozozozoooozzoozzzozzoozzzozoozoozozzozzooozozoozozzzozoozzoozoozoozozzoozzozozzooozzoozoozozozzzozzozzoozzozozzozzzzzozooooooozoozzzooooozzzoozzzzzooozzzzzzozzooozzzzoozzzooozozozzzozzozzzozzzozozooozzoooozzoozoozozooooozzzzzozzoooooozzzozzozzzozozoozoozoozzozoozzozooozozzzzzooozoozozzzzozzoooozozozzzzzooooozooozozooooozzzoozzzozzozzzozoozozoozozzzzzzzzozozzzozzozooozozoooozooozozzzozoozozooozozozzoozzoozozzzzozzzooozoozzoozoooooozoooozzzzzzzzzzzooozzozzzzooozooozzozozoooozzoozzoozzzoooozozzzzzzzzzzzozozzoozooozoooozzzozzoozoozoozoozzoozzooozzozooooozooozooozzzozzozzooozoooozooozooooozozzozozozoooozzooozzozzozzoooozzoozzooooooozozzzooozzozoozooozzoooozzoozzozooozzozooozzzzzzoozzzooooooozozzzzozozozooozzooozoozzoozzooooozozzooozzozzoooozzzzzoozooozzzzzozzooozozzzzzoooooooozoozoozoozzzzzzozozooozzzzozzozooozozoozzoozozozozooozzozzozzzoozozzzoooooooooooooozooooozzozzooozoozozooozzozzzzoozozzzozoozzoooooozzozozoozozozoooozoooozzozooozozoozoozzzzzoozoozzzzzooozzoozoozzzzooooozozooozooozzoozooozzozozoooozzzozzzzoozzzzooozzozzoooozoozoozozozzzozzoozzozoooooozzzzzzzzooozoozozzzozozozzozoooozozoozooozooozooozoozzzozzzzozzooozoooooozzooozozozzozozoooooozooozzzozzzozzzzozoozzozozozzozzozzoozozzzozzzzozzozoozzzoozozzooozozoozzozzooozzozzoozoozoozzoozzozoozozzozoozzzzzozzozoooozoozoozozzzzooozzzzzzzzzzzzoozzozzzozzozzozozozzooozzoooozozozoozozozzooozzzooozoooooooozozoozzzozzozzooozozzooozzoozozzoozoozzoozzzzzoozzzzzoozzzzzooozzozozzzzzzoozooozzozzzzozzzzzzoozozzoozozzoozzooozzzzzozozoozooozoozzzzooozzoozzzzzozzozoozozzzzzzoozozooozzzzooooozoozzzzzozooozozzooooozozooozozzoozzzoooozoozozooozzoozoooozooozzozzoozzooozzzoooozozzooooozooozzzzoozzozzoozoooozzozzoozoozoooozooozzzzooozzoozooozooozoozzozozzoozzzzzzzzozzooozzzooozozzozzozoozooozzzzoozzoooozozzoozzoozozoozozooozzzzoozzzzzzozzzozoozoozozzzzozzzzzoozoooozozzzozzozzzzoooozzoooozooooozzozooozzzozzozzooozzzoozzzoozozoozzozoozzozzoozzzzzzzzzzoozoooooozooozozzzzzoozzozozoozozzoozoooozoooozooozoooozzooozzzzzoozooooozzzozozozoozzzzooooozzzzozoooozzoooozozzzozozooozozzoozzzzzozozzzozzzoozzzzzozzzozzzozozzzooooooooozzozozzoozzoozoozoozoooozzzzzzzoozooozooozozoozozzzzzooozzozzoooooozoooozozooooozozoozzoozzozooozzzzozoozozozoooozzozooozzoooozzzoozzoozoozoooozzozozzozzzoozzozzzzzzzzzozooooooozzzzzzoozozzzzozozoozoozzzzzzozzzozzozzooozoooooozzozzooooozozozzzozozoozoozzozoozozzozzzozzzzoozozoooozozzooozzzzzzzzzzzoozooozzzozzoozoozzoozozzozozzzooooooozozooozooozozozzoooozzzzzoozzozozzzozzoozozozozzozzooozozozzoozooozozoozzooozoooooooozoozzoozzzzzozozzoozzozooozooozzzzzozzozzoozzozzzzzozooozzooozzzzozzoozooooozzozzoozozozozzzozoozzozzzozzzzooozozoozooooozzooozozooozzzzzozoozozozoozozozzzzzozoooooozzzozzzzzooozozzozozzzzozzooooooozoozzzozozzzoozzzzzooozozzozzooozzozoozzozzozzzzzozzooozzzzzzzzzzzzzzzozozooozozzooozzozzozoozzozoozozoozzoozzozozooozzoooozzzozoooozoozzzooozzzzoozoooozzoozozzzoozzoooooooozzoozzzozozozzozzzzoozooozzozzzooozzooozoozozzzzzozozzzzozzzozoozoozoooozzozzozzzozoozzzzozzzozooozzoozozozzozozzooozzozozzzzoozzozzooozzoozozooozooozzozzzozzoozzzzzzzozzoozozzzozzoozzozoozzozzzzozoozozzzzooooozzzzzzozozzzoozoozozoozzzooozozoooooooozooozoooooozooozzzzozzozzooozzoozzozzzoozzzzooozoooozzoozozozzooozzoooozzozzzzoozzooozoooozzzoozzozzzzoozozoozooooozzzozzzzozozooozzoozozozzoozozzozzzzzzozoooozzzzzooozozzzoooozozoooooozozoozozzozoozzoooozzzzzozoozzzoozzzzoozozzooozoozzozzzzoozoozoooozooozzzoooooozzoozzoozoozoozozzzzozzoozzzozooooozzzozozzzzozozzoozozooozozoozozzzzzzzoozzoozozoozzoozzozzozozoozzzozzzzzozozozooozoozzozzzozooozzzzozzozooooozzozoozoozzzzooozooooozzozzzozzzoozzzoooozozoozzooooooozozozoooozzozzzzzooozoooozozzzzzoozzoozooozzzzozzozoozoooozoozzzzzzooozozzzozozzzozzzzzozzoooozzozooozzozzzozoozozooooooozzzooozooozoozozzzzooozoooozzzozzzzoozzzzzzzzzozzozzozozzoozozzozozoooozozozoozozoozozzozzzzzozooooozzzoooooooozozoozoooozzzzozozozzoooooozoozzozzzooozzooozzoooozzozoozooozozzzoooozzozozzozzoozzzzoozooozzoozozozoooozzzzzozzzoooooozzzzozzooozozzooozoooozooooooozzzoozozoozozozoozzozoozozozozoozzoozooozozozzzzozzzooozzzzoozoooozoooooozozzozozzoozzozoozozzozozzozzzzozzoozzozzzzzzzzoozoozzzzzzzzzzzzoozzoooooozzoozoooozzooozoozzoooooooozozzozzzzoozozoozzzzozozooozzozooozoozzoozzzzzzzozzzooozzozzzzzoooozozoooozooozoozzzozzozozzozzoozozoozoozozozzzozzoozozzzozoozoooozzzooozozzzozozzzzzzozzoozozzoozzzoooozzozoozozooozzozozzozoozzzzozzzzzzozozzzooozozooozozozozzooozzoozzoooooozzzzozozzzzzzozozoozzozzozzzzzozozzozzoozooozzzozzozzooozoozzzzozozooooozooozzzzozzzzzooooozoooozoooozzzzzozzzzzzzozooozzzoooooozozzooozooozzzozozooozozzozozzzozoozozzooozozzzzzzozzooozozzzzzoozzoozzozzozoooozozozozozooozoozoooooozzzzzozzzzzzzzooozzozozzoozzozzzzoozoozooozoozoozooozzzozzooozozzzooozozozzzzzozoozoozooozooozzzzooozzozoozzozzzozozzzzzzoozozzoooozzoozzoozozzoozzoooozooozzzozzozoooozzozzozozozzzzozoooooooozoozzozzzoozzoozzoozzzzzoozoozzzoozozzooozzooozzzzozozozzozzzzozozoozozzzooozzzozozzozozoooooozoozozzzzooozooooozzoozzzzzzzzzozzooozzzozzoooozoozozzzozozozozzzozozzooozzoozzooooozoozzzozoozzzzozzzzozzzozozoozzozzzoooozoozoozzozoozzzzzzzzozooozzozozzooozzozozzozzoozzooooozzozzozzzzozzoozzozzzzozzoooooozozzozzzozoozzozooooozzzoozozozooozozzzzozzzoozzozoozozozzozoozzoozzoozzzoozozzzooozoozozzzzzooozooozzoozooozzozzzzzoooozozzzooooooozozzzzozzzoooozooozozozzzzozozzzozooooozozooooozozooozzozoozoozozzzzooozzzozzoooozzozzozzoozzzoozzozzzoozzzzoozzoozzoooozzzoooozozozozzzoooozzzzzozozzzzozooooozozozozozzzzoozzzozzzooozzzzzzoozzoozzozoooooooozzzzzooooozoozooozzzozzzzzzoooooozzozoozoooozzozzooozzzzozzzoozzzozozoozzozozzzozozooozzzzzzzzzooooozzozzooozozzzozozoozzzzoozzzzoozoozooozozzzzozzzzzozzzoozozzozzzozzozzzzzoooozzzzooozoozzzzzoozozoozozzoozzozozzzoozzzzoozozozoozzoooozzzzzoozozozoooozzoozzooozozzooozzoozzoozoozzozzozzooozzozozzzozoozooozooozzooozozzzozozooozzzozoozzozzozzoozoozozozzoozzzoozzzzzoozzozozzoooozzozzozzozzzzzooozzzooozoozozzoozzooozoozooozozozoozzzozozzozoozzozozooozoooozozoooozozzzozozoooozozzzzozzzooozozoozoozzozooozozzozzzzozzozzzooozzozzozzoozoozzzzooozzzzoozzzoozzozzzozozoozzzozzzooozzooozozoozooooooozzozooozzozooozozzoozzzzzoozzozzozozzooozozoozooozoozoozozoozoooooozzzzoooozzzzoooozozzooozooozzzozzzzooooozooozoozzooozzzoozzozzzzzzzzozozozoooooooozzoozzooozzoozozozzzzoooozzoozooozoozoozzzzooozzozzooozoozozzzozozzzzozzozzzzzoozzoozzzzozzozoooozzzzzzzoooozzzzozzoozzzzozzoozzooozzzozoozzzzzooozoozzoozzozozozoooooozozoozozoozozoozozzzozzooozzozozooozooozzzoozooozzzozzooozzozzzzzzzzozzzzozoozzzooooozzzooozooozozzzoooooozzozzozoozozozozozoozzozzzzzozozzozoozzoozozzzzzozzozozozzzzzozzzozzozzzoozozzozozzoozzzzoozzzozzozzzzzoooozzozozzzzzozzoozzzzzoozzoozzzzooozooozooozzozoozzzzoozzoooooooozoozozooozzzoozzzoozooozozzoozzozoozooozzoozzozozzzzoozzzzozzzzzzozoozzzzozzozoozooooozzzozzzzoozozoozzoozozoooozzzzzzzoozooozozoooozozoozooooozozzooozzooooooozzzoooozozooozzozzzzzzzzoozoooozzooozzzooooozozzoozzzooozozooozzozzozozozozozozozzzzzzozzzzoozoozzzoooozozozozzzzzoozzoozzzzzooozzozozzzzzzzooooozzzzzozzozoozozozoozoooozzoozzoozooozozzoozzoozzzzzzooozozooooooozzzozzozzoozozoozzzzzozozzzozozozzooozzzooozozoooozzoozzzzoozozzzozzzzozooozzzzzzoooozooozzozoozzozzooozzooooozzozooozooozoozzzozzzoozzozozozzzoozzzzozzzoozzoooozzooozzzzzzoooozozzoooozooooooozozoozzoooooozzozzozzzzzooozozooozooozozozozozozoooozzzoozozzzoozzzzzzoozzzzozzzozoozzoooozozzozzoozozzozozzzzoozzozzzzooozoozzozozozzoooozzooozozzozozozoooooozzozzoooooozzoooozzzozozoooozozzzzozzozzzozzzozoozoozozozzzzzzoooozzzoozoozoozozoooozzozooozozzoooozzozozoozzzozoozzzooozozzzozooozozozoozzozzoooozzooooooozzzoozzozzzzzzozoozzozzozoooooozooozoozoooozzzzozozozooozzooooozzoozzzoozzzzzzoozooozzzoooooooozozozzozozozoozoozozzzoooozzzzozozzoozzzozoozooozozoozzzozzzozzoozoozozzzzzooozozooozzzzzzzozooozzzzzozoozzozoozozzzoozzoozozozzozooozzzzoozzozzzzozozozzozzzzozzzzzozzzozozzzoozozooooozoozzzozzozooooooozozoozzozooozzoozzzzozoozooozozzozzzozoozzzoooozozzzooozzzzzooozzzoooozooozozzzzzoooozzzzoooozozzozozozoozoozozozozzzozooozozzozooooooozzozozooozzooozoozoozzozzoozozzzooozzzozzzzozzozoozozozoozzzoooozzooozoozzoooooozzozzozozzzzzozzzzoozozzzooooooozzozozozooozozozozzzzzzzzzoooozoozzoooozzzzzzzzzozzzooozoooozozozzzozzozzozozozzozooozozozzzzooooozzoozozzozoozzzzozozzozzooozzooooozozozzooozzozozozozzzzzzzoozozozzoozzzozoozzozzzozzoozozozoooozzzozoozzzzzooozzzzzzzozzzooooooozzzzzzozzzzzzzozzozoooozzooozzzzzzzozozozooozzozzzooooozzooozzzzzooozzoozzozzzoozzzzozozzoozzoozozzozzzzozzzzzozozzzozzoooozzoozzozzzzozzozzzzzozzoozozzzzzoozzzozzzozooooozoooooooozoooooooozoozzzozzozzzzozzzzooooozzzozzzzzzzozzzooozzzooooozzzoozzzzozozzoooozzozzzoooozzozozzzozzzoozozooozozoozozzzzzozzzozoozzzooozozozozzozozzoozozozzzzoozozozzozoooooozzoozzozozoozzoozoozzozzzoozozoooozozzzzozozooozzoozzzoooozozzzzzzzzozzzozzooozozoozozozzzozozozozzoozzzzzoozzooozozzooozzzzzzzooozzzozzzzzzozzoooozoozoooooozozoooozzzooozooozoozzzoozzoooozoozozooooozzzzzzozzozzozoozzoozzoooozzoozzozozozozzozozzzzozoozzzoozozoozozozzozozozzoozozoozooozzozzoozzozozzooozzozzoozozzozzoozoozozzzozozooozozzzzozoooozoozoozooooozozzzzozozzzozoozozoozooozozoozzoozzzozozzzozoozzzzzozozzzzzooozzooooooozozooooozzzzzoozzoozzzooozzozozooozoozzozozozoooooozzooozoozoozzooozzoooozzooozozoooozoozzzzoooooozzzzzozozzozzzozozzzoozzzozooozzooozzzoooozzzzoooooozzzozzzzozzoooozozzozzoooooozzoooozozzzozoozzzzzooooozzzzzoozzoozzozzoozzzoozzozzzoooozzzoozzzozoozzooozoozzzzzozzozoozozozzozoooooozozzoozzozozozooozzooozzzzzzoozzozozzozzzzoozzzzozzoooozzzoooozozzozzozzooozozoooozzzoozzozzoozozoozzozozzooozzozzozoozoozozzzzzzzzozzozoozozooooozozzzzozozozzzzzozzozoozzozzzoooozzozozoozzzozooooozozozozoozozzozzoozooozoozooozozoozozozoozzzzoozzozzoooozozzooooozozzzozzzozooozzzzzozzzzzoozzozozzzozzozozzooozzozzzooozzzozoozozzoozozozoozzzozzozozooozozooozoozzzzooooooozzzozozzozzozozzozzzzozozoozzozzoozozzooozzzzozzoooozzzooooooozoozozzozozozoooooooozzooozoozoooozzozzoozoooozzoozzzooozzozzoozoozoooozzoozzzozzoozoooozoooooozoozoooozzooozzzoozzzooooooozzozzozzozoozzozzzzzoozozzooozzoooooozoozoozozzooozzzzooozzozoooozzzzozzzzzozzooooozzzzooozzzzzozzzozzoooooozoozozzzzzzozooozzozzzozzozzzozozozzoooozooozzzzozooozozozzzzzozozzzzozzooozoozzzzozoozzozzoozzzozzozzzoozooozoozoozzzzzzzzooozooozoozzzzozzoooozozoozzoozozoozzooozzzzzoozzoooozzzoozzzoozzzzoooozozozzozoozozzozozzozozzoozooozzozzoozozzozozozozzzoozzozzozzoozzzzzzzoozooooooozozozozzoozzoozozzzoooooozozzozoozzooooooozzzoozozzozzozozzozzzoooozoooooozzzzooozozzozzoozzozoozzzzzozoooozozoozozzozozzzzzozozzzoozzozzozoozoozzozozzozzzozzzoozzoooozoozozozooozozzzoozoozzzzzzzzozzozzozzzzozzzozzzozoooooozoozzzozzooozozozozzzozoozzzzozzozozzozzozooozzzoozzozozoozzzoooozzzzzzzozzzooozzozoozzzzoooozoozzzooozozzzzoooooozozooooozoozzozzoooozzzzzooozoooozzozzzzoozzzoozozzooooozzzooozzzzzozoozzozzzozoozoozzozozoozzoooozzzooozzzzozozooozozzooozozoozzoozzzozzozozzzozoozzzozzzozzooozozozzozzzzzzozozoooozzozooozozzooozoooozooozozzozooozzoozzozzozzozozozoozzzozzzzzozooooozozozozzzzoozoozzozozozzozzozzoozozozzozozozozoozzzozoozzozzozzozozozzoozzozzozzzzzozzzzozzozzzzzzzzzzzzzzozooozozzoozzzozzzzoooooooozozoozzoozzzzozzozzozoozzozzooozozoozozooozoozoooooozzzzozoozzoozzooozooooozoozzoozozozzozozzzzzozozzozzzooozzzzooozzozoozzzzozzzzzozooooozoozooooozoozzozzzzoozzzzozzzzzoooozoozozzzzooooozoozzzooozozoozoozzozozzooozzooozzoozzozzzozzoozzzozzzoozooozzzzoozoozzzzoozzozzozooozzozzzzoozozzoozozozzzzzoozzozozozzzzoozzozoozoozoozooozoooozoooooooozozzozzooooooozzozozoozzozooozoozozzozzozzzzooozzoooozzzzzozoozzooozozzzzzzzzzzzzzzzozzozzoozoooozzzzzzzzzzozoozzzzzzozozzozzozzoozozzzozoooozozozooooooozzooozzzzooooozozozzozoozoozzzooozzozzoooozozzozzzzoozzzzoooooozzozzozozzozzzooozzoooooooozoozzooozzozzozzozozozoozooozzzozozzooozzzoozzzzozozozoozoozzzozoooozzzzozzzozzoozozoozooozozzzozozoozzzozzozzozooozzoooozozzzzzzzozoozzzozzozzzzozzzzzoozzozzzzooozooooozzzoooozzzoozzzoooooozzozooozzzoooozozoozzzoozozoooozzzooozzzooozoozzoooooozzzzozzoooozzooozzzzozzzzoozzozzzozozzozzzzzzozoooozozozooozzozzzoooozozzzooooozzoooozoozooozozzzozoozzoozzzzozzzooozoozoozzzzzzoooooozzzzzozzoozoozooozzoooozozzozoozozzzzoooooooozzzoooozozozoooozooozzozzozozzzzozoooozooooozzzoozzzooozzoooozoozoozooozozzzozoozzzzzzooozozzozzoooooozzoozzzozzzoozzzzzozozzzozoozzzzzzzozozozzoozooooozoooooooozozooozoozozzzoozzozoozooozozoooooozzoozozzzzzzozzzooozzzzzzzoooozoooozozozzozozzoozzzzzzoozzozzoozozzooozoozoozozozzzzoozoozzozzzzozozozozzooooozzzoozozoozzozozooozzooooooozoozozzzzoozozoozoozozozoooooozozozoozozzzzoozozozzzoozozozzoozoozzzozooooozoozoozzzozzozoozoozoooozoozoozzooozoozzozzozzzzooozzozzzzzzoozozzzozozzzzzozzooozozzoozzooozozzzozozzzooozzoozozozozzzozzzozzzzzzzzzzozozozooooozozoozzoozooozzzozooozozzzzozzozzoozzzozozozzozzozzozozzoooozzozzzozoozozzozozoooozzzozoozozozzozzzzzozzzzzoooozozzzozoozozzozzozzzozzzzooooozzooozoozozzooooozzzzzozozoozzoozzzzzzoozzooozoozozooozzzzzzozzozozozzozozzzozzoozozzooozozozozzzozzzoozzooozzzzzzzoozzzzzzzzooozozozzooozozzzzoozoozozozoozzozzoozozozzzoozozzzoooooozzzozzzzoozzooooozooozoozzooooozzzozzzzoooozzozozooozzzoooozooozzozzozooozzooooooooozzzozozoooozzoozooooozzozzzoozoooozzozooozzoozzoozzzoozzzozoozozozzoozzzzooozzoozozzzozzzzzzoozzzozoooozozzzzoozzzozozzzzozozooozoooozzzzzooozooooozzoozzoozzozozzzzoozozzoooozozoozoozzozozozzzzzozozzozzzzoozooozoozoozozzzzozzzoozzzzzzzzooozozzzozzzooozzzozoozzozoozzozzozoozooozzozzozozozzzzozzzozooooooooozoozzozzzzozzoozoozoozozzozoozozzzzozozzzozoozozoozozzzoozozoozoozozzozozzzzzozozozzozzozoooozoooozoooooozooozzooozzozozzozzoozoooozzoozzozzzzoozzzoooozzzzzzoooozozozzozoozzoooooooozoozzozoooozoozzooozozzzozoozzozooozzozzozzozozzzozoozzzzozooooozzzoozzoozzzoozzzzzozzzzzzooooozzzooooozzoooozozozzozzoooozzzzzozozzzzozoooooozzozooozzzzozozzozzozzozzzzzzoozoozoooooooooozoozzzzooozzozozozozzzozzzzzooooooozzozoozzoooozozozoozoozozzozozzzozzzzozzozozozooozzoozzozzozzzooooozzozoooozoozozzoooozzzooozzozzzzoozooozzzzzzozzzzzoozzoozozzzzozzzoozzzzzoozzzzzzooozozzzoozoozzoozzzozoozoooozzzoozozoozzozozozzoooozzzzzozzzozozozoozozzzzzoozozzooozzozozozzoozzozoozzzzozzooozzoozozzzooooozzzooozozzzozozozoozzozzozzzzzozooozoozozozoozzzooooozzozzozooozzooooozozzoozozozzzooozzzzozzozzozzozooooozozzozzoozzzozozzozzzzozoozoozzooozzzoozzozozozozzzzozoooooozoozzzzzzzzozzzoooooozzzzooozzozozzzzozzzzzzozozzzzoozooozzzzzzoozozzzooozozoooozzzzooozoozzzozzzooozzozozozzozooozooozzozozozzozoozoozooozzzzooozzozzzzozooozzozzzooozzozzoozozzozoooooozzozoooozzzzzoozoozzozozoozzooozzzooozozoooozoozzooozzzoozzozozozzooooozzzoooooooozoozzzoooozoozozozzzzzoooozzozozzzoozoozzzzooozzzzoooozoozozzzozozoozozzzoozzoooozoozozozoooozooozoozoozoooozozzzooozozozozzzzzzzooooozzoozzzozooozooozoozzoozozzzzozoooozozoozoozzzoozozozozzzooozzoooooozoozzooozoozozzzoozooozzoozzzzzozozzzooozzzozozozozzzoooozoozoozzoooooozzoozoooooozozzoozoozoozzzzoozozzozooozzozzoozzzozoozozozzozzozozzzoozzzoozozzozozozzzzozoozzzozoozzozzozozzzozozzozzoooozozzzzoozzzoozzzoozzzoooooozzoozozoozzozzozoooooozoooozzzzzozzoozzoozooozzzzzzzzzzozzooooooozozzzzzzzooozozooozzzzoooozzzzozzzzzzzooozozzzozzzzoooozoozzooozzooozzozzzzzoozooozooozoozzzoooooooozozzooozzoooooozzzzooozzoooozozzozzzzzzooozoooozzooozzzozooooozzoozzzooooozoozzozzoooozzzozozozooozzzoozzzzoozzzzzzzzoooozozzzozzzoozzoozozzzooozzzzoozzzoooooooozzzzzoozzooozozozzozoooozzzozzoooooozozooozzoozzzzzzooooozozooooozzzozzoozzzoozoozzzzoozozzzozozzzzozozzzooooozozozzooooozzoozozozzzozoozoooozzoozzozozooozzozzozzzzzzooozozooozzozzozooozzozzozozzzoozzozzzozzozozoozzzzooozzzzooozooozzozozzooooozooooozzoooooozozooooooozooozoozooozzzzoozzzoooooozzozzzooozozoooozzzoozozozozzzzzzzzzozzzzzzzooozzzzoozzozzzzzoooozzozozzzzzozzozzzzozooozozozozozzzooozzooozozzzzozozozzooozzozozoozoozzzzozzoooozooozozzzzzzzzzozozozzoozoozozoooozzzoozoozozzzooooooozzzzoozozzzzooozzzzoozozzozozoozozooooozzzozzozzoozozozozzzoozoozzozozzzoooooooozzzozzzzozzzoozoozoozzozoooooooozzzoozoooozozzzzooozooozzoooooozzozzzzozzzzzzzzzooozzzoooozoozoozoooozozzzoooozozzzzooozozzzozoozoozzzozoozooozozzozoozozooozoozoozozozzoooozoozoozoozzzzzozoozzzzzozzozoozoozzozozoozoozozozzozoooozozoozzozzozooozooooozzzozzzzzooozozozzzzozoooozzozoozzzozzozoooozoozozooozozooozzzozzzzozzzzozzzzozoozzozzoozzooozzozoooozozozzzzozzzozzzzooozoozzoooooozzzooozozozzzzozzzzozoozzzzzzzzzoozoozooozzzoooozozzzoozooozozoozoozzooooozzzzozzzooozzzozzzzozzzzoooozoozozzzzooozzozoooozzzozzzzzozozozozzozzozzzzzzzozozooozozozzooozzooozzooozozzzzzozzzoozozoozooooozzzozzozzozozzozzoozzzozozzzzzzzzzozozozzzzzozzoozzzzzzoozozzozzozozzoozzzoozzzzoozooozzzozoooozozzzoozzooozozzzzzzzozozoozoozoozzzzzzoozzozzozzoozozozozozzzzozooozzzzooozzzzzzzozozozooooozzzzozoozozzozozzoooooozzooozzoozooozozzzzzozzoozoozoozzzooozoozzooozzoozozozzooozooozooooozzzozozoozzzzozzzzzozozzzoozoozzozoozzozzozozzzzzoozozzoozzzzzzzzoozzozzzozozozoooooooooozozozooozzoozzzozzozzzzozzzoozooozzzoozzozzzzzzzooozzzozoooooozoozzzozzzzoooozzzzzzozooooooozzzzzzozozozzoozzzoozoozzzozzzzoooozzzzzozooozozzozozzzozooozzzzoozozoozozooooozzzoozzozozoozooozooozzzzzozzzozzooozzzzzzzooooozooozzozoozzozzzzzzzzozzzozzoozzzzzozozozzoozozoozzzozzzzzzoozoooozozzozozzzzzzzoozozoozzzzzzzzzoooozoozozzzzozzoozozzzoozozooozooozooooozoozooozozzozoozzzzzoozzozooozoozoozzzooooooozzozozzzozozzzzzzzozzoooooozzzozzzzoozooozzzzozoozoozzoozzoooozzzozzzooozooozooozozzozzozozzzozzzozozoozzozzzzozoooozozzoozozooozozzzzzoozzzozooooooozoooooooozzooozozzzzzzozoozzzzoozozzzzzozozzzozoooozozoooozzzzoooozzzozzzooozzzzozooozzozzooozoooozozoozooozoozoozoooozooooozzooozzzzooozoozzoooozozozooozozzozozozzzozzzozzzzzzzoozzozozzzoooozzzooooozzzzzzzozzzzooooozzozozzooooozzzoooozzzzoozozzozzzzzzozzzzozooozozzzozozooozoozzozzoozozzzzzozzzozoozzozzzzozoozzozzozozzozozzozzooooozzozoozzozzzozzoozzoooozozzzoozzozzzzozzzzoozzzzozzzoozzoooooozoooozzozoooozozoozoozzoozozzzoozozzoozooozzzzoozoozooozooooozzzzzzooozzozoozzoooozozozzzzzzozoozzzzozzozoooozozoooozozzzozoozzzooozozozozozzzoozozoozzooooooooozoozzozzozozozoozzzoozzzozooooooozzzooooozzzzozooozooozzzzzzzzoozoozzooozzzozzooozzoozozozzzozoozzoooozoozozzzzozoozzzzzoozozooozzzoozzzooozzozooozooooozoozoozzzozooozzzozzooozzoozzozzzzooooozzoozozooozzooooozozzoooozzzooozoozozoozzzzzozozzooooozozzooooooozzzozzzzoozozzzzozoozzozoozoozozoozzozzooozooooozoozzzzozozozoozozzzzzooooooozzozzozozzooozzozozzooozzoooozzoooooozoozozzozzzzoozzooooozzzooooozzoozzozzzzzooozozzooozozzoozzozooozoozooooooooozozozooooozzzzozzoooozoozzzzzzozoozozzzzozozooooozoozzzoozoozozoozozozoozzooozzozzzzzzzoozozzooozozozoozzzzoozzzzozzozzozoozooozzoozzzoooozzzzzozozoozzozzooozoozzzoozoozzoozzozzzoozzzzozoozozozzooozzozzozozzoooozoooooozzoozzozoozooooozoozzoozzozzzozoozzzzzzooozzzzzzoozozozzozzzozoozozzzzooooozozoozozzoozoozoozzzozzzzzozzzzoozozzzozoozoooooozzzzozzoozzozoozzzzzzzzozoozzozozzzooozozzzoozzozzzzzzzzozozozzozozzooozozzzoozzzozzzoozzoooozozzzzozooooozzzoozoozooozozzozzozzoozozozozoozzozzzzooozoozzzozzoozzozozzzzzoozozzozzzzzzzzzoozoooozzoooozoooozoozzooozzzozzzzoozzzozozzozoozzzzooozzoozzzoozzoozzzooozoozzzzoooozoozoozzozzoozoozzzozzoooozoozzzoozzzooooooooooozzzoozozzzzozoozzzzzoozoozzzzoozozooozooooozzooozzzzozozozozozzozozzzoozzoozzoozzozozooozooozzozozozzzzozozoooozzzzzozzoooozzzzzzooozozozoozoooooooozozoozooozzozzoozzzzzzozzozooozzoozzozzzoozoozozozoozzzoozoozzozozoozozzzzzzozozzzzooozooozzozozozzozzozzozzzzzzozzozzzozzozoozzooozzzozozoozzzzzzzzozoozzoozozozozozozozzozoooozooozzozzoozzzzozzozoozoozzozzozozoozozoooozzoozoooooozzozzzoozozozzozozozzoozoozzoozozzzzozozzzzoozzzoozzzoozzozzooozoozoozozzozzozzozooooozozzzzzoooooozozozzoozzzzzzoozzzooozozzzozzoooooozoozzzooozozozzozozzzozoozozzzzozzzzozzzzzozzooozoozozoooooozzozoozoozozzozzzozzooooozzooozzzozozzoozozozzoozozozozzzzzzooozzoooozzoozzozozozzooozoozzoooozozzozzoooooooozozozozooozozozoozoozozzzozozozozoozooozzozozzzzzozzzozzzzozzzzzzzoozzzzozzoozoooozozzzzzzzozzozzozzzzoooozozooozzozooozoooozozozozoooooooozozzzzzzzzzoozoozzzzooozoozozozoozozzzoooooozzzzooooozzooozoozozzzzozzzozzzzoooozoooooooozoozzzoozzzzzozzozozozoozooozozzzozzoooozzoozzzoozozozoozoozzzozooozzoozozzzozooozozozzooozozzooozzzzoozzzzozzooooozzzooozozzzzozzozoooozozzozzzzzzoozoooozzzozzzoozoooozzzzoooooooozzzzzzoooozzozooozzzooozozzozzzzoozozooozzozzzozzooooozzzzzooooozzzzozooooozzozoozzzozozozozoooozzzzzzozzzzooozozoozozzoooozzozzzoooozoozzooooooooozozoozozozozzoozooozozzozozzozoozzooooozzozozoooooooozzzozzzozoozozozzoozoooozozzozzzzzzozooozozzzzoozzzozzzoozzzooozoozozzozzzzozzzoozooooozzzzozzozzzoozooozoozoozooooozzzozozzozzzoooozozzozzzooozzzzzzzzozozzzzozzzzooozzzozozozzzzzzozzzzzzzozoozzozzoozoozozozoozooozzzzzooozzzzzooooozzozooozzzzozzozzozzzzozozzzzzzzzzozozzzoozzzzozoozzzoooozzzzzozzzzzzoozoozooozoozoooooozoozzzzoozzoozzzozozozzzzzzozozzzoooozozzoozzzzoozzzooozooooozozoozozzozoozoozozozoooooooozozoozozzzzoooozzzzzoozooozooozoozzooozzooozozooozzoooozzzoooozooozzzooooozoooooozzozzzozzzozozzozzzzzzzozozzzooozozzzozzooozzoozozzooozzzozozzzzoozooooozozooozzooozooozzzzzzzozozooozozoooozzooozoozoooozzozooozoozzzoooozzooozoozozozzoozozozzozozooozzozzzozoozoozzzozoooozozozozzozozzzzzzzoozzozzooozzozzzzozozozoooozzzzozzzzoooooooooozooozzzoozoozzozzozozzzzzoozzzzzzozozoooooozozooozooozzozzozozozoozozzzozzzooozzooozozozzzzzozzzooozozozzzzzozzozzzzzoozooooozozzozozozozzozozozozozozzzzzzoozoozzozzozzzzzoooozozzzoozzzzozzooooozoozzooozozooozzzozzzzooooozozozzoozzzzozzoooozzzzzzzozooozoooozzoooozozzzzozzzozoooozooozoozooozoozozzzzoozzzoozzoozozzozzzozzozzzozzzozzozoozozzzzozzzzzzzzzzoozozoozooozoozzzozozzzzozozzozozzozzoozozooozozozzzozzzzzozoooozozozozzoozozzooozzozzzozozoooozozzzzozzzozozzoooozozzzoozoozozzozzzoooozzozzzozzoooozozozozoozzzzzzooozozoozooozozoozozozzzozozzzzozzozoozooozooozooozozozozooozzzooooozoozzzzzzzozozzozozozzoozoozozoozzzzooozozoozzooozoozoozzzzooozozozzzoozooozoooozoooooozooozoooozzoooozooooozooooozooozozzzzoozzoooooozoozzooozzozozzoooozzzoozooozzoozzozoooozoozoooozozzzzzzozzozooozoozzoozozozzzozoozzzzozoooooozzoozzozoozzozzzzoozzoozzozoozzzoozzooozozzozozzzzoozooozzzoozozzzooozoozoooozozooozozzzozooooozozzzzoozzooozoozooooooozoozooozozzoozzozzzozozzzzozzzoooooozozzozzoozozoozooozoozoozozoozzzzzzozzzoozozozozoozozzozzozooozzzozoozzooooozzoooozzoozozzzoozozozzzzoozozzozzzzzozzooooozoozozzzzzozzzozozzoooozzozzzzozoozozoozzozzoozozozzozozozozooooozozzzzzzzzzzoozzzzozzozzooooozzzozozzoozoozzooooozzozozozzozozoooozzzzozooooozoooozozooozozoooozzozozozozzzoozozzzzzzzzoooozozoozozozoozzzozooozzozzooooozzozzooooozoozooozzzoooozzzzzoozzzooozoozoozozoozzoozzzozozoozzzzoozooozzzoozzzzozzzooozzzozozooooooozozoooozzzoozozzzoozozooozzoooozozzozzzozozzzozzoozzzooooozzzzoozoozzozoooozozzzoozozzoozooooooozzozzozzzzoozzzzoozozzzzoooozzoozzozzzozoooooozzozzzzzzzzoozoozzooozzozzzzozzoooozzzozozoozzzoozooozzzozzzzozzzozozoozzoozzzzozzzozooozzoozzzoozoooozoozoooozoozozozzoooooozzzozzzzoooozozzozoozzzzoooozzzoozzooozooozozzoozozzozoozoooozzzoozooozozzzoozoooooozooozozoooozzozooozoozoooozoozzooozozozozzzzzozooooozzozzzoozzozzzzozoozzzozozzzzozoooozozoozoozzzzoozoooozzzoooozozozzzozzzzoozzozzozzzoozooozzzozzozzozozooooozzzozzzzzozzooozozzoozozzzzzoooozoozzozooozozzoozooooozzzzoozzzzoozoozzozzoozzoozozzzoozooooozoozzooozzozozoooozzozzzoooozzzoozoozzoozozozozozozoozzoooozozozoozoozoozzzoozozzzoooozooozozoozzozzozzoooooooooozzzzzozzoozzoozzozzzzzzzoozoozzooooozzzozzzzzzozoozozooozzoooozooozzoozzozzzooozzzozozzzzzzoozozzzzoozzozzzooozzzzozzzozozoozzozzzooooooozzozzooozzoooooozzzoozozozooozoozozzzozzoooooozzzzozozzzozozooozozozzzozoozzoozoozoooozozzooozzoooooozoozzzzzzzzzzzzzzoooozzzzzozzooozooozozzzoooozzooozzzooozoozzozzoooozzooozozozzzoozzozzzzzzozooooozzoozzooozzzzozooooozozzoozoozzozzzozzzoozzoozzzoooozooooozzzzozozzozozozzozozooozooozoozooozzoozozooozozooozzozozooozzozzozzzzzzoooozzoooozzzzozozzzozzzoozozzzozooozzzozozooooozzzoooozzzooozoooozooozzoozoozozooozzoooooozzoooooooozozozzozzoooozzooozoooooozzzozzooozoozoooozzzzzzozooozozzzzzzzozzzzozozoozzzzozzzzzozzzzooozozzzzzzozozozozozozzozzozozzozzozzozzzoozooozzzozoozzzzooozzzozoozozzzzzozooooozozozozzzzzzzzzzzozozoooozozozozozzzzoozozzoozzooooooozozzozzooozoozoozooozzoozzoozzzzozooozooozozzozoozzozozozzzoozozzzozzzzzoooozooozozozzzzoozzoozozzoozzzzzoooooozzzzzozoozozoozzoooooooooooooooozzzzzzzooooozozzoozzzzzoozzzzozoozoooozozzzozozzozozzooozozozzooozozzozzzozzooozozzozoozooozozzzzozoozozzozoozzozoozoooozzzozoozzzzzozzooozooozzozozzoozzoozozoozoozozozoozzzzoozoooooooooozozzooozooozzzzozzzzzzooozzozozzzoozzozzoozzoozzzozozoozzoozzzzzzooozzzozzozooooozzzzoozzozozzoooooozozozozzozozozzzzoooooozzooozozzzzooozozozzzzoozzzzzzoozozzzozzoozoozooozzzzooozozzzozzzoozozoozzzzzooozoozzozzzzoozzzzozozzozzzozzooooozozzzzzoooozzoozzzozozzzzzozoozzozzozoozozzzzoozozozozozoooooozzooozzooozzzzzzzooozzozozooooozozoozooooozzzozzozooozzzooozoozzzzozozozozzzzzozooozozoozoozooozzzozozzzzzozoozzzooozozozozozozooozzozozzzoozoozzzzzzzozozooozooozzoozozoozzozoozzozzozzzozozzzzzozoozzzoooozzzzzozooozozoozozzzzzozoozozzoozzzooozooozoooozoozoozoozzzzzzzzoozozzozzozooozoozoozzzooooozozzozooooozooooozzzozozozzzzzozzozzzzzozzzozozzzoooozzozzozzzzzoooozzoozzzzzzoozzoozooozoozozozoozooozozooozozzoozooozzzozoozzzzozzzoozzozozooooooozzzzzooozzzzzzzzoooozoozzzozzozozozzozozzozoooooooozzzzzozozzozzozzoozzoozzzozooooozoozozzozoozzozzozozozozoooooozoozzzoozzozozoozozozzzoooooooooozozozzzozozzzozzooozzzozzzzooozzooozoozoozoozzzzozooozzzozzozzzzzzozozzzooooozoozzoozozzzzozoooozoozzzzzzzozzzozozozoozozoozzzooozozzozozzzzoozoozozzzoozozoozzzoozoozoozzzzoozzozzozozzzzzzoozzozozozzozzozozzzzooozooozozzoozozzzoozooozzooozzzzzozzzooozooozzzzozoozzozzzozzzoozzzzozzzooozooozooozzzzooozzozzzozozozozzzzzzzoooozozzzzzzzzzzozoozoozzoozooozzooooozoooooozooozozoooozozozozzzzoozozzoozoozzzozzzzzzozzozozzzzzzzzoozoozozozzozzozozzzoooozoozozzooozoozzzozooooooooozzozozoozozoooozzozzzzzozzoozzooooozozzzoooozzzozzzozzzozozzzzzzzozzozzzzozzzozzozozooozozzzzzzzooozzooooozzozoooozozozzozzooozzzozzozzozzzzzzozzooooooozozzzozozooozooozoozozzozzzozzozzzzzzzozzzzzzooozzoozzzozzzoozzozzooooozzozoozoozzzozzoozzzooozozzzooozzzzzoozozozozzzzoozzzozzoooooozzooozzozooozzzzozzoozzoooozzozzzoozoozzozzzzzoozoozzoozoooozzzzzozoozzzozzozzozoozzozooozzzozooooozoooozoooozozoooozozzooozozzzooozozozzooozzozozoozzzooozzoooozozzzozzozzooozoozzoozzozoozzzooozozooooozzoozzooozoozzzzzozzooooozzzoooozoozoooozozzzozzozzozoozzoozoooozzzzzzozzozzzzooozozooozzozozzzooooozzzoozooooozzozoozzzzoooooozzzzoozzzooozzzzzoozooooozozozoooozozozozozzoozozzzooozzozozzozozzzoozzzzozzozozooooozoozzzzzoozzzzozzzzzzozozozooooozooooozozzzooooooozzoozozzzzozozoooozzzzzozooozozzzzzzzozzzoozzozoozooozoozozzzozozoozoozozzozozzoozoozzoozzzooooozzoozzozzzzzzoozzzzooozooooozzooooozoozoozoooooozozozzoozozozzoozooooooozzzzoozzoooozzzzooooooooooooozzoozzozozoozozzozozzoooozooozoozzoooozzooozozozzozzzoozzozzoooozzoooozozzozoozzoozzzozzzzozozoozzzooozoooozzzoozzozzooozozzzoozozoozzzzzzoozoozzzozzozzzozooozooozzozzoozzozooozoooozzoozozzoozzzozooozozozooozzzzzzoozoooozozzzozoozozzzzoooozzoooooozzozzzozzozzozzozooozzzzzooozozozoozozzzzozzzzzzzooozooozzzozzzzzozoozozzozozooozozozozzzozzzzzozoozozzzzozozzzoozoozzooozozzzzzooooooooozzzzozozooozzzozzozzooozozozzoozoooooozooozozzoozzzozzzoozzzozzozzzzozzzzoozozozzozzzozozzzooozooozooooozozoozzzozoozzzzozozooooozzzozzozoozzozzozzooozzzoozozoozzzozzzoozozooozzoozooozzzzzozoozzzozzozoozzozzzozzzooooooozooooozzozzozzzozzzzoozzzozzzozzzzozzozooozooooozzoozzzzoozoozzozozzozozzzoozoozozooozozozoozzzoozzozozzozzzozozoooozzzozozooozozzzozzoozzooozozooozzoooozooozzoozozzzoooozzozzozzzzooozozooooozozozzzzooozoozzooozozzoozoooozoozzzzzzzozzzoooozooozzooozoozozzzzzozzzzzzozozzozozzzooozzooozzzoooooozooozoozozozzzoooozozozozozozzzzoozozoozzzozzzoozzooozozoozzozoozzozzzzozzzoozozooozooozzozoozzozooozozzzzozozzzozzzoooozzzzooozoozzzoozzzozzzzozzoozzoozzooooozozzzozozzozoooozozzozzzooozoozooozozozzoozzoozzzzzozzzozozooooooozozoozozozozozoozoozzozoozozzzzzozzzozzoooozozoozoozoooooozozoozoozozoozzozzzooooozozzozoozzzzzzzzoooozzzzoozzzozoozozzzooozzozoozzozzzozozoozzoozzozzzoooozzzozozozoozzooozooozooooozzzzzzzozozzzozozzzzzoozoooozozozzzozzzzzzzzzooozzoozoooozzozozoozzzozzoozzzoozozoozzozzzzoooozzzozoozozoooooooozozooozzzoooooozozzozzzzzzzozzozzzzoozzozzozozzooozzzoozooozzzooozoozooozzoozozzzzozzzozzozoooozzoooozoozozozzzozzzozoozzzzooooooooooozzoozzooooozooooooozozozzozozzzooozoozooooozozozozooozozoozozozzozozzzzooozozozzoozozzzzzoozozzzzozzzzzooooozozozzzzzoozozzozzzozzzooozooozzozooozoooozozzzzzooozzzzoozzzzooozozzzzzzzoozozooozzozzzozzooooozzoozzozoooozzooozooozzozzozzoooozozzzooooozozzoozzozooozozzzzoozooozoooozoooozooozzozzoooooozzoozzozoozozoozooozzzzooozoozoozzooooozoozozooozoooozzzzzzzozoozozozzoozoooozozzozzzzzzozozzzzzoooozzzzzzzzoozzozoozoozozzozzzozzzzozzooooozoozzzoozzzoozzzooozozoozzooozooozzzoozozoooozozoozozzozzzoozzzzozozzzzoozzzzooozzzzozoozzzozzzzozoozozoozzozzozzoozozozoozoozzzzzzzzozzzzzooozozoozoozzzzzozzozoozozoooozzzozzzzzozzzzzzozzzzzoozozzozzozzzzzozozzzzoozoozoooozzoooooooooozzzzzozzooozoooozozzozzzozzzoozzozzzzzoozzzzooozzozozzooooozooooozzozzzooozozooozzooooozzzzooozzzzooooozooooozoozzooooozzzooozzzoozozozzzoozoozozoooozzoozozzozoozozoooozozzozozzzozoozzzzzzzzzzzoozzoozzooooozoozzozoozoozooozzzozozzozoozzoozozozzozzzooozooozzozzzooozzooooozoooozzooozozzozooozzzzozooozzoooooozozozoozozoozoooooozozzozoozzoozzoooooooozzzzzoooozozozozzzzoozzzzooozzooozzoozzozzzzozzzzzoooozzzoooozzooozoooozozozozzzoozoozzooozozzzzzozozzozozozozoooooozoozoozooozoozzzzzzozoozoozzzzozoooozzoozzzzozozzozzzzoozozozzzozoozooozzzoozzoooozzzozzoozoozzzzozozzzozzzozzozozooozzozzzzzooozooozozoooozzzzozzooooozzozzooozzzoozozzoozzzozooozozozzoozzzzzzzooozozzzozoozooozozzozzoooozoozzzozzoozoozozozozoozoozzoozzzzzzoozooozzzozzoozozzzoozozzzoozzoozoozozoozzzozzozzzzzoozoooozozoooozozozozoozzzooozzzozzzzzzozzozooozzzzzzzozzzzzozoooooooozoozoooozzooozzoozzozozozozzzzzozozozoozzzoooooozzzzooozzoozozzzooozoooozzoozozoozoooooozozzzzzozooozoozzooozooooozzoozzozozzzzoozozoozoozzooozzoooozozooooozozozoozzooozzozzzozzozozzzozzozzoozozzozzzzozzooooozzzoozoooooozzzoozzozozozoozozozoozozoooooozooozooozzzzozozooozzzozozozzzozzzoozooozozzzoozoozzooozzozozooooozzzoozooozzoozoozooozooozoozozoozzzzzzzzozzzzzozzzoozozozzoozozzzzzozzzzooozzoozoozooozzozzooozzooozozoozzzoozzzoooozzozozzozoozozozozoooozzoooozoozoooozozooozozozzzooozozozzzzoooooozzoozoozozozzozzoooooozzozzozzoozzozozozozooozzozzzoozzoozzzzoozoozooooozzooozzoozzozzzooooozoozzozozzozzozooozzzozoooozooozzozooozzoozzooooozozoozzooozozzozozzzzzzoooooooozozoozoozzzozozoooozzzozoozozozzozoozzozzozzozozzzoozozooooooooozzzzozzzzzoozzzzozzozzooooozzzzzozzoozzzozooozoozozooozzozoozoozozzzooozozooozoozozooozzzoooozoozozzzoozzzooozozzzzzzozoozoooooozoooozozozzoozoozzoooozozozzzoozozoooooozzzzooozzzzzoozzzoozzoozozzozoozzoozzzozooooozoooozzoozozoozzozozzooozzzzozoooooooozzzozoooozooozozozoozozzoozozzoozozzozoozzozozozzooozoozooozzzzooooozzooooozooozzoozozzzozoozooozzzozzoozzzoozozzoozzzzzzoooozzoozzozzzozooooooozozzozzzozooooozzooozzozzzzzzzzoooozzozozoozzooozooozozozzzzozzzzzzozozzoozzozozzzzzoozzozzozzozooooozozooooozoozozozzooozzzzzoozzozozzooozzzozozzozozoozzzozzzoozzzzoooozozzozoozzooozozozzzozooozozozoozoozzoozzoozozoooozzzzooooooozozooooozoozzozoozozzzzozozooozoozzoooozzzozzooozzozozozozzzzooozozzoozooozzzzozoooooozzooozozozzzozzzooozzozzzozzoozoozzzzozooozozzoooooozzzoozzzzozzozzzozzzozoozzzzzozoooozzozoozozozozozzooozzzzoozzzooozzoozozzooooozzozzzozzoooozooozoooozozzozoozozzozzooooozooozzoooooozozozooooozooozzooozooooozzoozooozooozozzzoozooooozoooozzoozozzoozzzozoozozzzzoozooozzzozozzzzzzzoozoozzozooozzzozozzooozoozoooooozoooozzoozzoozzozzzzzzzzoozozzzozzozzzzzozzozozzzzooozozozzzzzzozozzzzzzozoozooozozoozooozzzzozozoooozozozooozoozoozzozzozzooozzzzzzozzzozozooooozzooozzzozozzzoozoozozozozozzzozoooozozoozozzozzzozzzozoozzzzzoozozoooozoooooozoozzoooozzooozozzzozzoozoozozzzoozzzzoozzzzozzoozzozozozooozoozozoozoozozozzozzzozooozooozoozzoozzoozozozooooozoozzozzzoooozzzozzozzzooozoooozzzzoozzoooozoozzoooooozozzzooooozzzzzzzozzzooozzozzoozzzzzozzzozzzoozoozzzoozozzzooozooooozozoozoozzoooozzzozoooozzzzozzozozoozozoozozzozzooozzzzzozzozzoooozzooozozzoozzzooozooozoozozzzoozzzozzoozzozzzoozzozoozooozozzzozozzzzoozozzzozoozzzzzoozzoozozozozzozzoozzzozoozzzzzzoozozozzooooozzzzzoozzoozzzzozoozzzzooooozozzzozzzozozzozzooozoooozzzozozozzoooozzzzooozzzoooozzozzozzooozoozoozoozzzzozzoozzzooozozzooozzzzozoozzozoozozozzoozzoozzzzoozozzozooozooozzoozzoozozooozozozzooooozzzzzozzzzzoooozozooooozoozzzozoozzozzzzoooozozzozzzozzzozzzzzzozzzooozzozzzzozzozozzzzzzozozzoooozzzoozzzzzozzozozoooozooozoozzoozozooooozzozzozozooooozozozooozzozoozooozozozzozozzoozzoooooozzoozooozzozozooozzozoooozoozozoooozzooozzzozozzozoozzzzozzozozozoozzzzzozozoozozoozzzozzzoooooozzzozzozoozooozzzooozozozzzooozzzooooozzooozzzzzzzoooooozooozzzzooooozoozzzzzzozozzozoozozozozooozzzzooozozzozzzooozozozzooozooozzozzoozoozzozoozzzzzoozooozzoozozzooooozzzzzzzoooozzzozzoozozzzzzozoozzozoozoozozozzozzoozzozzzzooooozzozozzzoozzzzzzzooozzzzzzozooozozoozooooozzzoozozoozzzzzooooozoozoozoozooozozozooozoooozzzzooozzzozozzzzzoooozzzozozozzoozzzozozozoozozoozozozozozzzzoozzooozoozzooozozzozzozoozoozzzozozzozooozozzoozzozzozzozoozzoozozoozzzoozzozzozozooozoozoozzoozozoozooooozozzzzzzzozzooozzzzzooozzooooozzzoooooozoozzzoooozzooozzzozozooozoozooozooozozozzzoozzzzoozzozzozozzzzzooooozoozzzzzzooozoozooozozozzozzozzoozozzoozozzzozooooozzzozzozoooozoozzzzozozooooozzzzzozzzozozzzzzooozzooozoozooozozzozozzozoooooooozozooozoozozzzozozzzzozzzozooozozzozozzzozozoozzoozzozoooozooozzzozzoozzozzzzzzozzzzooooooooooozzzoozoooozzzozzzoozozozzzzoozzoozzooozzzzozooooooooooozozoozzozzzozzzzooozoozzozzozzozzoozzoozzzoozozzzzzozzzozzzooozoozoozzzozzzzozzzozzzzzozoozozozozzzzoozzzoozoozoozzzzoozzoozzzzzzzozooozzzoozozzozzzoozzzzoozzoozozzzoozozzzoooooozzooozzzzzzzozoooozozozozzzoozzzozzoozzoozzzzzozoozzzoozoozzzzooooozzozzzooooozoozzzozooooozzzzzzzzozzozzozzoooooozozozzzoooozoozozzzozozzoozzozozozozzzoozoozooozzozooozzzzzzzzzzzzzzozzzzzoozoozzzozzozozzzoozoooozzozooozozzoozzzzzzoozozozzozozozzzzozzzzoozozzzozozzozzooooozzozzooooozzzoozzozzoooozzzzzozozzzozzzoozzozzzoozozozzzzooozoooozzoooozzzoozoozzzzozzozzozozooozoozzoozozzzzzzoooooooozzzozzozooozozozoozozzzzozozzozzzozzzozzzozzooozoooozoozzzozzzzzzoozzzozozoozozozzzzzzozzzooozooozoooozozzoozozozoozoozoozzozooozoooozoozozzooozzozoozzzozozzoozoozzzoozoozzozzozzoozzoozozzozoozozzooooozoozozzzzozzozzozoooozzzoooooooooooozzoozooozoozoozozozoozzzoozzzzozozozzozozoozzzooozzzozzzzzzzzozozzooozoozoozzzozoozzzoozzozoozzozzoozzooooozzooooozzooooozzzoozozoooooozzozzzoozoooozoooooozzozoozzozoozzoozzzooooozozozzozzzozzoooozzzoozzooooozoozozzozoooooozzozozzzoooozzzzzozzooooozozzzozoozzzzzozozzzozoozzooozzzzozzozozzzoozzozzzzozzzoozoozzoozzzooozzzzozoozzzzzozzzoooozzoozoozzozzzzoozoozzozzozzzzozzzoooozzzoozzozzzozzzozzoozozoozzoooooooozoozzzooozzzozoozoozozzozzzoooozzoozzzzozoozzoozzozozzozozzzoooozzoooooozooozozzozzozoooozooooozzozzzzozooozoozoooozzzzoozzzzozzzzzoozozzzooozoozoozzzooozzooozzozozzoozozzoozoozzoooooooooozzozzzzzzozzzozooooozzoozozozzozoozzozzzzozzzzozzzozzzzoozzzooooozzozzzzzooozozozozzoooozzzzzoooozozzzzoozzzzozooozozozzzozoozzooooozozooozooozzooooozooozooozozooozzzzzzzzzoozozoozzoozzozzozzozzzzooooooozzozzzozzzozozzozooooozzzoozoozzzzzzozzzzozozzzzzozozzoozzoozozzzoooozozzozozozzzzoozozzzoozzzzooozzoozzozzozzzzoozozoozooozzoozooooooooozozzzzzzzoooooozzozoooozozozzozzoooooozooozoozoozzzozzzzzzoozoozzzzzozozooozozozzozzoozozzozoozooozoooozzozozzzzozoozzzooooooooooozzozzzooozoozzozzoozzozoozozooozzzzzzzozozzzozzzozozoozzzzooooozzoozozooozoozzozozozoozoozzzozozoozzozzzozozzoozzzozzzzzzzzozzoozzooooozozoozzoozozzzozzzooooozoozoozzoozooooozozzzoozzzoooozoozzozzzzzoozoozzozozozooozozzoozooozoooozzzozozzozzzzzoozzzozozzzooooozozzozozozzozozooooozozzzzzzooozooooozzzozoozozoooozoozzzzzzzozzooozozooozzooooozzzozoozoozzzoozozzoozoozooooozoozzzooooooooooooooozozozzzozoozzzoozoozozzoozozzozozzoozzoozozozzzoozzzzooozozzzzozzooozzzoooozzozzzzoozzozooozzoozzzzzzzzoozzooozozozoozoooozzozzzoozooozzzoozzzozzozooooozozoooozooozozzozzozzzzoozoozooozozzoooozooozozzzoozzozozoozozoozzzoozozoooozzoozoozzzoozzozozzzozzzoozooozoozzooooooozoozzozooozoozzoozozzoozoooozozzozoooozzzzzoooooozozooozzozzozozzooozzzozozzzzzzzzozzzozzzzzzozzzoooozoozoozzzoozzoozooozzoooozzzozzzzoozzozozoozzzoozzzzoozoooozzoozzzozzzzooozzoozoooozzozozzozzzzzooozoooozozozzzoozzozozoozzozoozoooooozozzzzooooozzzozooozzzzozozzzzzzozozzozoozozzoozzzzooooozozzooozzoooozzozoozzzozzoozoooozzozzozzzzozzzooozzzzzzoozzoozzozzozzozoooozoozzooozozzzzzooozozoooozozoozzozozzzozozzozooooooozzoozzozozzoozzoozoozozozzooozooooozozozozzzozzoozooozozzzoooozoozozzzzzoozozzozzoooozzzozzzzzoozooozooozzooozzzzozozzoozzzzzzzozozozzzzoozooooozzzozzzzozooooozzoozzozzzoooozoozozzozzzzozzoooooozzzozooozozooozooooozoozzzzoozozzzoozooozozzozozzzzzzzooozzzozzzozzozoooozzzozzzzooozoooozzooooooooozoozoozozoozzozoozozozzzzozozozzozozzozoozooooozozzzzzooozzzzzzzzozozzozzzzoooozozozoozzzzzzozzoozooozzzoozzzoozzzzoozozzozzzozooozzzzoozozoozoozzoooozzozzzoozzozozozzzzooooozooozzzzzzoooozoozzzozoozzzozzzzozzzzzzzooozzozozzozozozzoozozzozozozozzoozzozzzozozoooozooozzzoooozzozzzzozzzzzzozoozozoozzoozozzozoozozoozoooozoozzoozoooooooozzozzoooooooooooozzoozzzzzzoozzozzzzoozzzozzoozzzzzzzzozoozoooozzozozzoooozozozzzoozozzzozzoozzooooooozooozzzoozooooozzzzozozzzzozzzozzooozoozozoozoozzozozzozzozozooozoozzozooozozzozzzzooozzzozooozozoooooozoozzozoozzooozzzzoozozzozozzzoozozoozozzoooozoooooozozooozzzozozzzozozozoozzzoozzoozzzzzzoooozozoooooozozozzoozoozooooozozoozoozzozzzooozoozoozzzozzoooozozozzzzzozzzoooozooooozzzzzozzzzozzzzooooozooooooozozzzooozzzzzzozoozzzozzzooozozozzzozoozozooozozzozoozzzozoooooozoozzzozooooozzoozzoozoozozzzzozozozozozzzozzozzzzzzooooozoooooooozzzoozozoozzoozoooozzozzozzzozzozzozzzooozoozzzozooozzzozozooooozozzozzozzzozzzoooozzzoozozzoozooozozoooooozzozoozzzzoozzoozzozoozzoozzzzozzzooozoozozzzzoozoozozozoooozozzzzzzzzozzoozooozzoozzoozzooooozzozzooozzozoozzzoozzzoooozozozoozoooozozozzozooozzzooozozoozozozzzzzzozzozoooozzzozzzzzoozzooooooooozoozzzooozoozzzzozzozooozozozozooozozoozzzoozzoozzzzzozzooozozzoooozoooozooozozozzoozooozzzzozzozzoozozzoooooooozozzzoozozoozzzoozozoozoozzoozzzzzoozoozoooozoozzoozoooozoozzzzzzozoozooozozzoozozzzzzooozzozozozzzozoooozooozzoozozzozozoozozzoozzoozzooozzozooozzzozzozooooozzzozzzoozzozzzoozooooozzzzozooozzzzzzzozoooozooozzzzozzzozozoooozozooozozzzzzozozzzzzozozzzoozozzozzozoooozzzooozoozzzzoozoozoozzooozzoozooozzoooozzoozzoozzzzooozzzzozozozooozzzzooooozozoooozozzzzzozozozozoooozzooozooozzzoooooozzoozzoozozzzzzzzzooooozzzzzozzozzzooozoooooozzzzzzoozozzozzzzoozoozzzoooozooozzooozozozzoozozooozozozzzooooooooozzzzzoozoozzzozooozozozzoooozzoooozzozzozzzozoooozooooozooozzozoozooozoozooooozzzzoooozzzozzooooozzozozzozoozzoozozooozzoooozzozozozzoozzzzooooozzozozozzzzoozzoozzzozoozzzoozzoozzozzoozoozoozzzoozozooozozzozzzozzzoozzzozooozozozzzooozozzoozoozoozzozzozozoozzooozzooooozzoozozoozzzzoozoozoozooooozzzooozzzozzozoozzoozzzozzozzzozozozzooozozoozozzoozozozzzozzzzozozzzzozooozozozzzzozoooozooozzzozozzozzoozozzzozoozoooozoozooozzzoozoozoozzozzoooozzzoooozzooozzoozooozozozzooozooozzzoozzzozozzozzzzzzzoozozzzoozozzzozoozzooooozzoozoozozoozzzozozzozzzozzozzozozzozzzzzzoooozzzzoooozzzzozoozzzozzzooozoooozzzzzozzzozzoozzzooozzoozoooooooozozozozzzzzzzzoozzoozzzoozzozozoooozzzzoozzozzzozzozzoooozzzoozoozzzozzozooozozoooozoozooooozzoozzoooozoozozzzzooooooozzzzoooozoozzoooozoozzoozzzooozozzooooozzzozzoozzoozozozozzzzzzozozzozozzozozzozooozoozzzoozozozzzozzzooozzozzzooozoozzzoozoooooooozoooozozzooozzzzzooozzzozzzozooozzzzzzoozoozozzozozozozozzoozooooozozoozozzoozzozooooozoozozozooooozooozoozooozzozoozozoozzoooozzooozoozooooozzzzoozozooooozoozzooooozzoozzoooozzzozzzozzzoozozzoooozzoozzzzzzzzozzozozzzooozzooozzozzzozoozzoozozzozzzoozzoozozoooozzoooozoooooozozzoooozoozozzozzzzzooozoooozzozozzoozzozozzzzooooooozzozzzozozzzzozozzozzzzzozoozzzoozzzzzzzooozzzzozozzzoozoooooooozzozzzzoozzzooozzzzzozoozzooozzzozozzzoozoozozozozozozozoooooozoooozzozzooozzzzozozozooooozzoozzooooozzzoozozooooooozzzzzooooozoozozzozozozzozzzzoozzoozzozzzozoozzoozzoooooozzzozozzzzzzzooozoozoozzozozzooooozozooozozozoozzzooozzzozozzzzoozzoooozzozooozoooozozzzoooooozzzzozzzoozozzoozoozzzoozzzzzoozozzzozzzozzooozooozzoozozozooozzoooozooozzoozzzzoozzzoooooozzzzozoozzzzozzzzzzzozozzoozzzzzzoozoozooooozzzozozzzozzzozozozozozozzzzooozzozooozzoooooozzoooozooozozzoozzzzozoozoozzozoozozoooozzoozoooozzzozzoozozozoozzzzoozzzozoozozozozzzzzzoozoozzzzzzoozzzzooozozozzzzozoooozoozooozooozozzozzozozoooooozzzzooozzozzozzozozzzzoozozzzozoozzzzoozozozzooozozzooozzzozooozozzzozozozzoozoozzzzoozzzzzzzooozzoozoooooozozzoozoozozzzzzzozzzozzozzzzoooozozozozzzoozzzzzoozzooozzoooooozzozzzooozzzzzzzzozozoozozozozzozzozooozzzzoooozozoozzooozozzozzzozozzooozooozoozzozzozooooozzzozozzzooooooozozzzooooozozzoozozzozooozzoozzozozoozozzzoooozzoozoooozozozoozoooozooooozooozozooozzozozzzzzozzooozoozozzzzzzzozozzoozozzzoozzoooozozzozzzozoozooozozzooozzzzozooozzzooooozzzooozzzzozzzozooooozzzzoooozzzzozoozozozozzozzozozozooozozzzozoozozzzzzzzoozozozzzoozzzozzozzoozoozzozooozzzooozoooozoozozzozozozzooozzzzoozzzozzoozzzzzzoozoozozooooozoooozzozooozzzzzzzoozozozozzzozozozooooooooozzzzozzoozzzzooooooooozooozzzozzzzozozooozoozoozozozoozozzzozozoooozzzzzoozzozoozozzoooozozoozoozzzoozzzzzozozoozzzoozozozozooooooozzozozoozzooozozzoozooozoozzozozozzzzooozozzooooozzzooooooozooozzzzzzzoooooozooooooozoozozzzzoozzzooooooozozozozzzoozooozzzzzoozzzooooozzzoozzoozooozzoooozozoozzoozzozoozoooozooooozozooozoozzzzoozzoozoooozoozooooozoozzozooooozzooozooozozzzzzozzzzzzzzozzzzzzzzozzooozoozoooozoooozzzzzooozooooooozooozzzooozzzzzooozzoooozozoozzzzoozooozzzzoozozooozooozzozozzzozozzozooooozooozozzooozzzozozozoozozoozzozozoooozzozozoozozzzzzzoozzoozozozzoozzozzoozooozzozozzzzozoooozozozzzoozzooozzzzozoooooooozooozoozzzozozzozozooozozozozoozzooooozzoozzzozoozzzooooooozzzooozoooooozoozzzzozzozzzzzzozozzzzooozzzozzzozzooozzoozzzzozzozozzzzzoooooozoozoozozzoozzoozzzzoozzoozozozozoozozoooozozzooozzozozzozozoozozozoozzozozzozzzoozoozzoozozoozzzoozoozzozoozoozzozzozooozozozzzozoooozozzzzozzozzozzzzzozoooozozooozozzozozzozzzozozzoozzooozozooozozzooooozozooooozzzoozzzzzzzozozzzzzooooozzoozzooozzzoozozozzzozzoozozozozzzzzzoozzzozzozzoozzzoozzzzoozzzozozzzzozzoooozzzzzzooooozozoozooozozooozzooozozzzoozzzooozzzzoooozzzzzzooozoooozoozzzzozoozoozzzzzzoozzzzozooozozzooooozzzzzooooozzoozzoozoozzooozzoozooozzzzooozzooozozzoozzzozzooooozoozozzozozoozozzzzzzozoozzoozozozozzzoozzzoooooozzoozozoozoooozzoooozoozzzzooozzzzozoozoozoozzzozozzzzooozzoozoozzozozzoozozoozzzoozoozozzozzozoooooooozoozozzozozzzzzozoooozozozooooozoozozzoozooozzzzoozozozzooozozzzzzozozozozzozoozoozzozzzozzozzzozozzozozozzoooozzoozoozzzzozoozzzzzozooozooozozzzooooozooooozzoozozooozoozozoozzzoozooozzzooozozzozoozzozozozzooozoozozozzzozozzzozzoooozzzzzzzooozozoozoozozoozoooozozozzoozoozzozoozzzoooozoozzzzooozzzzzzzozzozoozozozozzzzzzzzoozzzozzozzzzoozoozzozzzzoozzooozzzoozoozzozzozzzzoozzooozoozzozzzzozzzzzzozzozzzzoozzzooozzooozzzzzzzoozoozoozozzoozooooozzozoozzzoozzzzzzozzozzozoozzzoooozzzoozozzzzoooozooooozoozzzzzoooozzzooooozooozoozzzzzzozzozoooooozozzzoozooozoozooozozozoozzzzozzzoooozozzzozozooooozozoooozoozzzozzoooozozzoozoozzooozoozooozzozzzozzozzoooooooozzzozzzozzoooozoozzzzozozzoozzozozzoozzzooooozzoozzzzooozzooozzoooozzzzozozoozozzozoozozoozozoozzozzzoozoozzozoozozozozooozzoozoozoozzooooooozzozzzzzzzozozozoozzoozzozooozzzzzzozoozozzoozzzzzzzooozzozoozoozozoozooozzzzozzzzzzoooozzzozoozoozzoozozzooooozozzzzozozzozoozozooooozozooozzoozoozozzozzoozozoozooozooozzoozzzzozzozozozzzozooozzozzoooooooozoozoozoooozooozooozozzzzzzozzooozoozzzozozozooozozzoooozoozozoozoozozzzooozzoozozozzooozzzzooooooozooozzzoozozzoooozzzzozzooozzzozoooozzzzzzozozzzzzozzoozoozzzzooooozzzozzzzoozoooozzooozzozoozzzzzooozzzooooozozzoozooozozzozzoozozozzoozzzzooozzzoooozozozzzozoozzzozozzoozzooozoozozooozozzooozooozoozzzozozoozoooooozozozzzzoozozzzozoozzzozzzzozzzozoozozzzoozzoozoozoozozozozzooozooooozozzzzzozozozoooozzozzoozozozoozoozoozzozozoozozozozozzooozozzoozoozoozozozoozzoozoozooooozoooozoozoooooooooooooozozzzozoozzooozoooozzzzzzzzozozzoozzoooozoozoozozzoozoozzzozozzozozzzozzozzzzzzoooozozzoozzoozzzozzzzzozzoozzozozoozozooooozozoozooozzzoooozzzoozozzoooozooooozozzzzzozzozzzzzozzoozoooozzoooozooooozzzzozzozoooozzzzzozzooozzzozozzozzoozozoozzzoozzzoozzoozooozoozzooozooozzozzzoooozzozzoooozzoozoozozzzoozoooozzozoozzozozooooozzoozozozoooozzoozozzozzozzozzzozzzzozzzzzzzzozoozoozzzzzzzoozozozzoozozzzozzozoozoozoooozzzoozzzzooooozozzoozzzozooooooooooooooozoozoozzozzzzoooooooooozozzoooooozozoozoozoozzozooozozzzzozozozzzzzzzoozzzoooozzzzzozozoozozzozzooozzzoozoozzzzozoozoooozzoooozzzzzzoozoozozoozooozzzoozzzzzzzzozzoozzzoozoozoozozozozzozzzooozozoozzzooozzoooozozozozzozzooozozzzzoooozooozoozzozozzozzzozooozozozzooozoozoozozzzoozzzzozooooooozozzooozoozoooozooooozzoozoooozzzozzzzzooozzzzooozzooozzzzzzoozozzzooozzzzozozzooozzozozzzzooozzzooozzzozzoozzzzzzoooozoozzzzoozzzoooozoooozzoozooozozoozoooooozozzzzozozozzzoozooozzzzozooozzzzzoozzzzozzozzzozooozozzoozzoooozooozzzozzozzoooooozzzzzzooooozoozzozzozzzoozzzzozoozozzozoooozzzzzzzzooozzzzozozozzzzozzzoozoozozoooozozzzzozzzzzooozzooozzzoozzzzozzozzozzzozooozozzoooooozzzozoozoozzzzzzoozzooozooozzooooozozooozozzooooooozozozoozzozzzzzozzzzzzzzozozzzozzozooozzoozozzozzzozozzzzzzoozzozoooooozooozzzooooooozzzzozzzzozozoozozoozzoooooozzoozoozzozoozzzozzozzozozoooozzozzoozoooozozozozoozzzzzooozzozozzoozozozzzoozzzzzzzozzozoooozzozozzozzozozozzzzzzozozozzozoooozzozozooozzozozoozzozzooozozzzzzozzozzooozoozozzozzozzzzozzozzoozzzozzoozoozoooozzzoozoooooozzozooozozooooozoozzzozoozzoozzzozooozozooozzzoozzozozozooozooozoooooooooozozozozzzzzozozzoozzozzzooozozzzozoooozoozoozzooozozozoozoozoozozoozzzzoozooozozzozoozozozzzzooozozzozozoozooooozooooozzzzozooozozzozoozoozooozoooozzzzzoozzzozzozoozzzzzooooozozozzoozzoooooozzoozzzozzozozzzoooooozoozozozoozozooozoozzozoozzzozozozooozooozzoozzzooooooozzoooooooozzzozozoozzzozoooozzozzozozozzoozoozzozozooozzozooozzzzzzooozoooozzoozzzzzozzzozzoozzzzzooozoooozzzzoozozozzzooozzzzozzzoozoozozzzoozzzzzzzzzooozozozzzzoozzozzzzzoozooozzozzzzoozozzzoozzoozzooozzooozozzozozoozzoooozzzoozzozooozoooooozzooozozzzzozoooozzooozozoooozozozzzozzzzooooozzzozzzzzoozzoozzoozozoooozzozoozzzzozozzozzoozozozooooozozoozoooozzozzzozzozzozoooozooozzoooooooozzzozooozooozzzooozozzoozozzoozoozozzozzzoozoozozozoooozooozozzzzzzzzzozzoozoooozoozzozzozzozoozozzozoooozozooozozzozozzozooozzozozzozzozoozozooooozozozoozoozozzzzozzzzozzzzzzozzzoozzzoozozoozoozzozzzzoozzoozoooozzooozzzzoooooozzzzozozoozozzoozzzzzzzzozzoozozzzzozzoozzzozooozozzoozozzzoozoozoozozooozozzoooozozzzzzooozzoozzooozzooooozoooooozzzzzooozzzzzoozzzzozozoozoozzzzooooozozoooozozzzzzzoozozzzoooozozoozoozoozoooooozzozzozzzzzzzzzzozzoooozzzoozozozozooozooooozzzzzzzoozozzoozzzzozozozzozzozoozozooozoooozoozozozozzzoozzoozoozooozzzzzoozozzzzozzozoozzzzooozzzoozoooozzozzzoooooozooooozzoozzozoooozooozzooooozzoooooozzzozooozzozzoozzooozozzozzzzooozzozozzoozozozoozzzzooooozooozozozozzozooooozzozoozzzoozozozoozzoozozzoooozoozzzoozzozooozzzzzooozzzozooozozozozzoozoozooooozozzzozzozozozzooozzzzzoozoozozzzoozzzzzozoozzozozooozzzoooozoozoozoozozzzzzozoozoozzooozozoozoooozozzozzoozzzooozzoozozozozoooozozzzzzzozzoooooooozooozzzzzzoooozzzoozozoooozoooooozozoooozzozzzoooooozzozooozzzozozzzzoooozzzozzooozooozzzoozozozoozozzzozzzoozozozoozozzozzozzzoooozzzoozoooozozzzoozooozzzoozoozzozoozozzzzzzoozozzzzooooozzozzoozozozzoozzzooozzzozozzzzozzoozzzooozzoozozozoozzzzzooozzzzzzzzozzooozzzzozzozozooooozzzzoozozooozzozzoooozzzoooozzzzozzozooozozozzozooozzoozzzzozzozozozzzzozzzozzozzozzzzozooozzzozozozooooooozzzzzoozzooozozzzozzzozzoozzozoooozozzzzozozzozzooozzozozozooozzzoozzzzzzozzoozzzozzozooozzozzzoozzooooozozooozzzooozozozozooozzzzozzozzoozzzzzzoozzozzzzzzozoozzozzozzoooozzozoozozzzoozoozzooozozzozozoozoozozooozzooozzozoozozozoooozozzooozozzoozoozozooozozoozoozzzzozoooozzooozzooozzooozzzzzzoozzozozzoozoozozzzzzzozzzzooooozoozzoozzozzzoooooooooozoozzzzzzzozooooooozzzozozzzoooozzzzoooozooooooozzzozooozoooozzzzozzoozzzoozzzoozooooozzozzzozzzozzooozzzzzzzzozoozzzoozzzzzzoooozzzoozzzzozoozoooooozzzozzzzoozzzooozozzzzzoozzooozzzzzozzoozoozzzzooozozozozzzooozzoooozzoooooooozzzzozooozooozzoozzozooozzzoooozzooozzzzzzzzooooozzoozzzozozoozozzzzooozoozzzzzzozozzzoozzoooooozzzzzozozzzzzooozoozzooozzozzoooozzozooozozoooozozooozzzzzozozoozzzzzoozzozozooozozzozzzzoozzoozozozzzoozoozoooooozzzozozzzoozoozozzzoozoozozooozzoozooozoozozozzoooozzzoooozzzozzzoozozoozzzzzozzzzzoozzzzzzozozzzzzzzozzzozzozzzoooozzooozzzzzzoozooozzzozozzzzooozzozozozooooooooozooooooozzzoooozzoozooooozzzzoozozooooozoozoooozozzzozozozozooozzzoozzzozoooozozozoozzzoozozozzozzoooozoozzzzozzzozooooooooozozozoozzozzozozzzzooozzozzozooozzzzzzzoooozzozoooozzzoooozzozoozozozzozozzzzzooozoozoozzozozozooozzozzoozozooozzzzzzzzooozoooozooozzozzozzoozozzzzzzzzooozzozzzzozoooozzzozzzoozzzzzzoozoooozooooooooozzzooozzzzozzozzozzzzozooozzzzozoooozzzozooozozzozzooozozzozzzozoozozzozozzzozzozzozozoozzzzozzozzozzooooozozzooooozoozozzozzoozozozzozzozozoozozzzzozozzoozoozozzzozzzzzooozooooozzzozozoooozozzzzoozozzooozoozozzzzozzozozzzozozzzooozoooozoooozoooozozzoozoozzoozzzoozozzzzozozoooozooozoooozzzozzoozzzzzzooozzzozozoooozoooozozzooooooooozzozzozzzooozzzzozooozzozzzozozzozzoozzzzzoooozooozzzooozoooozoooozzzzozzozoooozzzoozozzzzooozooooozozozozoozoozooooooozozozzzozozoozzzoozzzoozzzozooooozooozzozozzozzzzzooozoozoozozoozoozzooozozooooooooozozozooooozoozzoooooozzozoozoozozoozzooozzoooozzozzzooozozzzzozooozzoozzzozooooooozozozzozzozzoooooozzoozoozoozzozozozozoooozozzzoooozzzooooooozozozozzzzzoooozozzozoozozoozzzzzzoozzzoozzozzzozooooozoozzozzozzooozzzozzoozzzoozzozozoozzzozzzozzzzzooozozozzoooozooooozozooozzozzoozozzoozoozozooooozzozoozzoooooooozzoozooozozozozzzzzzzzzzozozozzzoozzooozoozoooozooozzozzzooozzoozooooooozzzooozozzzzzzozzooozoooozzzzoooooozozzzzzzzoooooozozozoozzooozzozzooozoooozzzzooooozozzzozoozozooozozzzoooozzozozzozozzzzzooozzoozozozzozzzozzzooooozooozoozzzooooooozzzzzozzzoozozzoozoooooooozooozoozzooooozozozoozzozozzooozoooooozzozzzzozoozozooooooozzozozzooooooooozzzzozzozoooozoozzozooozzozozzzozzzozzzzzozzozzzozoozozzooooozzoozozzzozzozzooozzzzzzzoozozooozozooooooozoozzzzzzooozoooozzozzzoooozozzozzoozzoozzzzooozooozzzozzzozzzozoozoozozooozooozozozzoozoooozozzzzozoozzozozzzozooooozzooozozzzzzzzozzzzzzzzoozzzozoooooozozzoooozzozooooozozooozozzzzozozzzzoooozzzzooozooozzzoooozozzzoozoozzzozzzzozozzozzzozzozzozzzzozzzzzoozzzoooozzzozzoozzzzozozozzzozoozozozooozooozooooooozzoozozooozzzzooozzzzzooooooozoooozzzzzoozozoozzzzzooozzzzoooozzozoozoooooozoooozozzzozooozozozzzozzoozoozzozooooozooozozzoozoooozozzoozoozozoozozoozoozzzzzoozozzoozooozoozzoozzzzozooozzoozoooozoooozzoooozooozzoozzzzzzozzzzoozozzzzozozzozzoozzozooozzozoozzozzzoooozzozzozzzozzzzzoooooozzzoozozzoozzzzozozoooooozozzoooozoozozzzzozozzzzozooozozzooozzzozozozozooozzozozzoozzzzzzzzzozzoozoozozozozzooozzooozozzzzzzzooozzzzzoooozozzzozzzoooooooozzozzoozzzooozoozzzoozzozozooozozzoozzzzozzozoooozozzooooozzozozzzooozzooozzzoozozzzozzzzzozzozzooozozzzooozoozzzoozzoozoooozzzzzoozzozozzzoozzzzzozoozzzzooozzzozzozozzooooozozoozzzzzozoozzzzzzzooozoooozzozoooozozzoozozzozzozozzoozoozzzozzzzzozzoooozozozozzozooooozzzzzzzoozoozozoozzzoozozoozzzoozzzzoozzzzzzozzozoozoooozzoozzzzzooozzzzzoozzoozooooozzzozoozzzozoozzoozozzzozzozzzzzzzzzozozozzzzzoooozoozzzzozzoooooozozzozoooozozozzzzzozzooozzozzozozzozozozzoozzzoozooooooozzozoozzzozozozzoooozzoooozoozoozozzozzzoozzooozzzzooooozozozzoozoozzzozzooozzozzoozzoozooozzoooozozzozozoozzzoozoozozoozzzzozzzzzzoozzoozozzozzzzzozzoozzoozooozozzoooooozzzoooooozzozozoozooozozzozoooozzzzzozozzozoozzozzozzooozooooozoooozzozooozozzozzzzzzoooozoozzoozozzoooooooozozzoozozooozzzozooozzoozoooooooozozozoozozoozzzozooozzooozooozzoozzzzozoooozozzzzzooozzozzozzzozoozoozoozzozozozozzoozoooozzzozzooozoozzoozozooooozzozoozooooooooozzozzzzoozzzzozzzzozzoozzzooozoooozzooozozoozozzoooozzzoozzooozzoozzooozzzozzoooozzzzozzozzoozoozzozzooozoozzzzozzooozzooozzzzzzzzzzzooozzozoooozozzooooozzozzoooozzozozzzozzzzzoozzzoooozozozozozoozozooozzoozzoozzoozozozzzozzzoozozozoooozozozzzzooooozoozzzzoooooozzzozozozzozzzzzzzzozozzozzzoozoozzoooooozoozozzzoozzoozooozzozzozozozzooozzozzoozozozzozoooooozozoooozzzozzzoozozozoozoozoozoooooozoozooozoozozzoozzzooozozozzoooooooozozzoozzozozozozozozoozozzzzozzzoozoozzoooozoozozzozzoozoozozozzozozzzzoozzozzzzzzoozooozzozozoozozozoozzozzoozzozoooozozoooozzooozzooozzoozoozzzozzozzozoozoozoozozzzzzozooooozzzzzzozozoozzoooooozzooozzzozooozoozzzzzzozzooozzzozozoozozooozozzozoooozoooozooooozoozzzozzozozzzzzzoozozzozzozoozooozoozzzzzoozzzooozozoozzozozoozzozozozoooooozzzoozzzzoozzoozozozoozzzozzoozzzzozoozoozzzzzzzzozozozozzzozozozzozzozooozozozozozzozzzoozozooooozooozoooozooooooozzoooozoozzozzzzozooooooozoozoozoooozzzzozozzzoozozzzozzzzozozozozzzzzzzzozooooooooozzozzoooozzzozzozozozzozooozzzzzzoooozzzzzoozzzozzozoooozooozoooozzzzozzzzzzzzozzooozzooooozoozozozozzozzzozooozoozzzzoozzooozzozozozzozzooozozzzoozzozooozozzzozozoozzzozoozzzoooozzoooozoozzzzzooozzzozoooozoozozzzzozoozoooooozzozzzzooozooozzozzzzoooozzzzzzzzoooooozzzzoozozzzooozzzozoozoooozzozozzzoozooozoozzzzzooooozzzzzoooozozzzzzoozozzooozozozozozzzzoooooozoooozzzozozzozoozzzzoozooozzzzozzoozzzzzzzzzozozzozozozoozzozzzozoozozoozozzoozzzzzoozozozzzzzzzzooozooozozzozozoozzozzzzozoozoooooozozzzozoooozzooozooozzooozzzozzozoozoooozooozzozzzzzoooozoozooozzozzzozzozzozzzzzooozozoozooozzzzozoozooozzzoooooooozozoooozoooozzzooozozozoooooozooooooozozzoozoozzozzozozozzozzzooooozzzooooozzzzzoozozzzoooozoozoozoooozozooooooooozozooozzoooozozzooozzzzooooozoooooozzozzozzzozzozzzzzzozzoooozzoozzooozozozoooooozozooozzzzozoozzoooozzooozzzozzzzzozozzozoozozzozzozozozzzzzzzzozozzozoooozzzzooooozzozzzozzzozzoozzzoozzzozozzzoozzzzooozzzzozzzooozzzzzozzzzzzoozooozooozozoozooooooozozooozzzozooozoozzzoozzozoozzzooozozoooozzozzzzzozozzzoozzzozzzooooooozozozzzozozzzzoozzzozzozzzzoozozzzozzooozzzzoozzzozzozozoozzozozoozozozzzoozooozozzozzooozozzzzozozozoozozooooooozzoozoozzzoozoooozozozozzzzoooozoooozzzzzzzzzzozzzooozzozzoozoozozooooozzoooooozozozzzzzzozozzzozzzoozoozozozozzozooozooozzzoozzzozozooooozooozzzozozooooozoozooooozzozzzzzozoozozozozoozozozozozozoooooozzozzoozoozooooozzzzozooozzoooozoozzzzzozzoozzzozozzzooozoooozzzzzozozoozzoooozoozzzzooooooozozzzozzzzoozzzzozoooozooozozzzzozzzozzozzzozzozoooozzooozzoozzozoozooozoozooozooozoozozzozoooozoooooooooozzozozzozzzozzooozozoooozozoozozoozoozzozozzzozozooozooooozozzzzozozozoozzozoozzzoozooozozozzzzozoooozooozozoozzzzozooozzozzozoozooozzzzoozooozoozzzzozozozozzoooooozzzozozzozzzozozzozozooozozoooozoozozzozzzozzzozzzozozozozzzooozzzzzozzooooooozozoozozozoozzozzozozzoooozzzozozzoozzzozzozzoooozzzozozooozzozzzozzzzozzzzzzozzzozzzzoozzzzozzzzzozzzzzozzzozoooozzoozzzzzzozzoozzzoozozoozzzzooozzozzzoozzoozozzzzozzozzzzozoooooozoozozzzozzoozzozozooozozzoooozozzzzzzoozzoozozzoozoooozzoozzoozozzooozzoozzzozoozozoooozzozzzooozzozooozzzozzozzzzozozzzozooozozzzzzozoooozzoozzzozzozzzzzzzozzozzzozoozzoozooozozoooozooozzzzzzozoozoozzozozzozzzozzozzozozzoooooozooozzozozozozzozoozoozozzzooozozzoozzzzzoozzzzoozzozooozzozozoooozzozoozooooozoozzzzzozzozooooozooozozoozzzzoozoooozozzozozzoozoozzozozoozozozozozzzzzozoooooooooozzoooozoozoozzzzzooozozoozzozzoozzzzzoozozozoozozozzzzoooozozzzzzozzzzozozzzozozzzzoozozozozooozzozoooooooozzzzozozzozozozzooozozzzoozoozzzzzoozoozzzzzozzozzzooozzzzooooozzooozzzozzozzozozzoozzooozozozzoooozzozzzooozzoooozooozzzooozozozzzzzzzozozzzzooozzozooozzozozzzoozzzzozoozooozozooozoozzooozzzzzoooozzozzoozozzzzozooozzozoozzozzzzzzzoozoozoooozzoooozzozoooozzzzoozzoozooozozzzzzzoozoooooooozzozzoozzzoozoooozoozzzzooozozozzooozzozzzooozoooozooozozozzoozzoooozooozozzzoozzooozzozzzzozzozzzzozzozozoozzzzzzooozoooozzzzozoozozzoooozzzzooozzoozzzozzzozoozzozoozozzozzzzooozzozzzozooozzozzzzzzozzzozozzzzoozozzzozzozzzzozzoozzzozozozooooozozzzzzoozooozzoozoooozozzooozozoooozozzzzozozzozzoooozzozzzzooozzzzozozooozoooozzoozoozooozzozzzooozoozoozozozzzzzooozooooozoozzzozoozzozooooozzzzozzoozozzzozoozzozzzzzoooozzoooozzozzoozoozzoozzozooozzozzzzzozzoozzzoozozozzzzoozooozzzzooozzozzoozzozozozozozozzoozzzzozozozzozzozzooozzozooozzzzozzzozozzoozoozoozzzzzzzzzzooooozoozzoozzoozooooooozzozzoozzzzzooozoooooozozzozozzzoozzzzozzzoozzoozooozzzooozozoooooozzozoooozzoozooozzzoooozooozozozzoozooozzzzzzzoozoozzzoozzzzzzooozzozozozzzozzozooozoozzzzzzoooozozooozozozzzozozooozozzoozzozzozzzzozoozzzoozzzzzzozzoooooooooooooozzzzooooozoozzzozzzozooozzzzoozzzooozzzozzoozoozzzzoozzzozozooozzoozoooooozozzzzzoozzoozzzoooozozzzzzozoozzozzoozooozooozzoozzooozzzzozzzzzoooozozoozozozoozozozzzozzzozzozzzoozzozozzzozozzzoozozozzzoozoozoooooozzzzoozzzzoooozozooozooozzozooozozzzooozozozzzzzooozzzzooozzzozzzzozzzoozzozzozozzzoozzzzzzoozzzzzzzzozozoozoozzzzoozzzozzzzzzooozoozzzozzozzzzoooooozozzzozooooooozoooozozozzoooozooooozoooozzzozoooooozozozozozozoozoozozoozoozoozooozzozzzooozozzoooozzzooozozzozooooozozzzzzozozozooooooooooozozozzzzozozozozoooozzozoozzoozzzzzzzozoozoozzzozzozzozzzoozzoozzoooozozzzozzzozoozozzoozozozooozzozooozooooozzzzozzzozozoooozzoozzozoozzooooozzzzzzooooozozzozozzoozzzzzzzzzzzzzzzzooooooozzzzzozoozzooooozzoooozozzozzzzozooozozoozozoozzzozozoozzzozoozooozoozzzozoozozzozzzozoooozozzozoozozzoozozzozzzzooozozzooooozoozzzozzzoozozoozzoozzozozzozzozozozzoooozzozzzzzzzzzzozoozzzozzzoooozoooooozzzoozozooozzoozoozzoozzooozozozzoozzoooooozzzooozoozozzzzzoooozzoozozoozzzzzzozozozoozozozoooozzzzzzoozzzozoooozzzozozoooozzoooooozzozooozoozzozzozzzoooozzzozooozooozzozozzooooozzzozzoozoooozzoooozozoozooozoozzzzzozooooozzzzoozzooozozooooozozzoozoozozzozoooozzozozozozozzzzzzoozzzoozzzooooooozzzoozozozzzzzozozzozzzzzooozoozozzzooozzzozzoooozozozozooooozozzzozozzozzozzzooozozooooozozzooozzzozozozozozozzzoozozooozzozzooooooozozozzzozzzoozzozozzoozozzoozoozooozozooooozozzooozzzzooooozozzzozozzozooooozozzozoozzooozzzozzzozzzzozzozzozzoooooooozzozoozoozozzzozzozzooozzzzzozoozozzzzzozzzzzooozozozooooozoozooooozooozozooozzzzoozoozooooozzzzoozzoooooozzoozzozzzozzozozozzozzzozozzzozoozzozzzooozozzoooozooozzoozozozzzzzzzooooozzzoooooooozzzzozzooozoozozozoozozoozozzzzzzzzooooozozoozoozoozzoozzooozozzzzzozzozoozozzoozoozozozozozzzzzzozzooozzoozozozzozozooozzzzzzzzzzozozooozozooozoozzzooozoooozzzoozzzozzozzozzoooozozzzooozoozoooooozozooozzzzzozzoozzozoooozozzzzozzooooooozooozozozozzozozzooozzzozoozozoooozzozzozooozzozozzooozzozzozzoooozzoozoozozoooooozzoozozozoozoozozoooozzzozzzozoozzozooozzozzzoozzzooooozooozzzozzzoooozozzoozooozooozzoooozooozzzozzzozzzoooozzzoozooozozozozooooooozzzzozoooooooooozozzozzoozzozzzoozzzzzozzzzzzozzzozozzzzozozozoooozzozoozzozzooozoooooozoozozoooooooozzozzozozoozoozozooozzzzozzozoozzzozzooozozzzzzzzzzoozozozzozozzzzoozooooozoozzoozzzzzozooozzzzooozooozooozozooooooozoozoooozooozoozozozzzozooooooozzzoozzzzzoozozzzzozozoozoozzzooozoozoozoooooozoozzzzzzzozooozozozzzozzzozzozoozooozoozooooooozoooooozzzoozzooozooozzoozoozzzzzoozozzozzooozoozzooozzzozooozzzooooozzozozozoooozzooozoozzzzzzoozzzoozozzzoooozoozzoozzzzoozooozzozzoozooooozzozzoozzozzzzooooozozzooozoozoozozzoozozzzooozozzzzzozzzzozzzzozozzzzozoozzzozooozzzozozoozzzoozozozzooozzzoozzzzozooozoozoozzzozzoozzoozozzooozzzozozzzzzoozzoozzzozzooooozoozzzzzooozzzzozzozzzzozooozoozoozozzoozzozzzzoooooozoozoooozzzozozzzoozozooozzzzzooozzozzzzzoozozzoooozzzzzzoooozzooozzzooooozzozzzzzozozozzzzozozozozoozzozooozzzoozozoozozooozzoooozoozozozzzzzozzooooozzoooozoooooozozozozzzzzozzzzzozooozzzzzzzoozzozoooozozozzzzooooozozzzozooooooozooozzoozozzozzzozzozooozozozzozzozoozozoozzozzoozzooozzzzzoozzoozoooooozzoooozzzozzzzzoozzzzzozzozzozzzzzzozozoozzozozoozzozzzzzzzoooozzoozzzzoooozzzzzzzzzzzzzoozzoozozozzozoozozoozzzzozzzozzoozzzzoozzzozozoozooozzoozoozzzzoozzzzozoozozzoozzooozoooozozozzooozzzozzzzooozzoozoozzzozooozzozozzoooooozzozzooozoozooozozzzozzzoozoozzoozozzzozzzzoozzozoozzooozozzzozozozzzoooooozzozzzzozooozozzozoooozzzzoozzzzzzoozooozoozoozoozozzzooooozzzozozozzozoooozooooooozzzozzzooozooooozozzozoozozozzzozozozooozooooozozzozoooozozooozzozzoozzzozooooozzzzzzzzzoooozozozzzooozoozoozzzozozoozzozzzzzzozzzozoozzooozooozzooozoozoooozoooozzozozoozooozozooozzzozzzozzzzzozozzooozozzoooozozozzzzzooozoozozzoozoozoozzzooozzozozzooozooozzozozzzoozzozzzooooozozzooozoozozzoozooozooozzzzzzzozzzzzoozoozooozoooozzooozooozoooozoozozzzozzzzzoozzoooozzozzoozozoozozooozzozzozozzzozozozzooozzoozozoozooozozozzzzooozozozzzozooozoozzoozzzozozzzoozzzzozzzoozzozooozzzzoozoozoooozzzozozzzzzozozoooozzzozzoozzzozoozzozzzzozzooooooozooozzzzozzzoozzzozzozooooozoooooozozoozozooozzzoozzzooozzzzzzozzzozzozozooozzzzozozozozozoooozzozozzooozooozzoozzzozozzoozozzoozoooozooozzozozzzozzzoozozzoozozzzozoooozozooozooozzzzoooozzzozzooozzooozoooozoozzoozzoozzzzzozooozozoozozzzzozoozooozzzozzozzzozozoozzoozzooooozooozozozzzzzzzozozzozozozozozzozzoozozzozooooozooozoozzzzozozzozzozzzzzzozozzozzozozzoozooozzzzzozoozozzoooooooozzzzoooozzooozozzozooozzzoozozzoozooozozozzoozzoozooozzzzooozozozozzoozzzozzzozzzzzooooooozozooozozooooozzozzzzozozooozooooooooozzzoozzozzzzoozozozzooozoozzooozzozozzoozoooozzzzooozozzozozzzzzzzzozozzzooozzzzzzozoozooooooozoozoooozzoozoozozoozzzooozzozzzooozzzozzozzzoozzozoooozooozoozozzzzoozzzzozzozozooozooozozzoooozzzzzzzzzzzoozzoozzzzzozzzzzzzozozoozozooozzzozzozzzzzozozozozzzozozzozozoozozoooozzzozozoozzozooooozzozoooozooooozzzzzozozooooozzozoozooozooozzzozzzoozozzzozzzzozooooozzzoooozzoooozzzozooooooozzozozzzoozooozoozzzzzoozzoozozzzzoozzzozzzoozoozoozzzzozooozzzzzozoozzoozozzzozoooozzozzzozzzzozzzzozzzoozoozzzzzzoozzoozozzozozzozzzoooozzzozzozzoozzzzzozzozozzzozzzzooooooozozzozozoozzozzzzozoozoooooozozooooozzzzoooooooozzoozozzozzozoozooozoooozoozzzzzozzooozzooozzooozzzozozzoozzzozzzooozzozozzzzozozzozoozooozzoooozozoooozzoooozzzoooozozzooozoooozozzozozzoozoozoozzozozozzozzoooooooozooooozzzozozzozzooooozoozozzozozzzzooozooooozoooooozooooozzozoozoozooooozozoooozzozzozzzzoozzzzzzzzzzooooozoozzzozzzzozoozooozooozzoozooooozzoooozzzoozozoozzzzzozzzzzoozooozzzozozzzoozzzzzoooozzzoooozzzzzozzzzzozzoozzzzzooozzzooozzozozooozzozzozozzzzoozzozoozozzozozzzzozoozozooozozzooooooooooozzoozzoozzzzzozzoozozzozzozzzooozozoozozzoozzozozoozooozzzozzzoozooozzzoozzzzzozzzzoozzzozoozozzzoooozozzzoozzzzzzozozozzozozzozzzzzzozoozozzoozzoozzzzzzzzooooozzzzozozozoooozzoooozzzoozzzoozzoozoooozooooozzzzooozzzzoozzzozzzzozozozooozzozzoozzzozooooozozoozozozozozzzzzzozzozzozzzozzoooooozozzozzoooozozzzzoozzoooozozoozoooozzozozooozozzozzzooozzoozzzzooozoozzozzoooozozooozooozoozozozzzoozooooozzzozzzozozzzzoooozoozzzzzoozoozzzooozzozoozzooozozzzozozoozzooooooozzzozooozozzozzzozoozoozzzzozzooozoozzozzozozozozzozzoozzoooooozzozzzooozoozzozooozzozooozzoozzozzozozzooozoozooooozzozzzzozozzzzozozozozzooozzzooozoooooozoozozzzooooooozooooozozzzzzzzzozzozzzzoozzzoozzoozozozozooooozozozozzooozzzzzzoooozzzoozzozooozzzozzzzoozzozozzozzzzzzozooooozozzzozzoozzzozzzzzoozzoozozoooozzozozzozzoozzzoozzzzozozzzzzozozozzoozzzoozooozoozozooozoozoozzozoozoooozoozzzzzooozzozzzzzzooozzoozozozozzozozozzozozzzzzzozzzozzzoooozozozzzooozozozooozooozzozzzozooozzozzoozzzoozozozzzzzooozzozzzoozzozzozzzozzzozzozozzoooooooozooooozooozzozozoozzozooooozoooozzzoozzozzozzzoozoozzzoozzzozozzooozzooozzzzoozozoozozzozozozozzzzoozzzzozzozzzzozozzzozozooozzzozozoooozzzzzzoozzozzozozoozoozzzzzzoozoozoozzoozozozozozzzoozooozzoozzoooozzozzozzzzzoozzzoozzoozooozzzzzozzoozozoozoozozzzooozozzzzozzzoozozzzoozzoozzzzzozozzoozzzozoozozoooooozzzzzzzzozozzozzooozozozzzzooozozzozozoozozzoozoozoozozooozzozozzzzzzzzzoooozooooozzoooozoozoozzzzzooooozoozzooozozzzozzozozzzoozozzozzozooozzzozozzzozzozozzzooozzzzozzozooozzooozzzozoooooozozzozzzzzzozzzzozozoozzozzoozzzzozozooozzozozzzzzzoooozzzooooozzooozzoozzozoozozzoozzooozozzzzzozzzzoozzozozzoozozoozzzoooozozzzzzzzzooozozzzzozzzozozozzozoozzozoozzozoozozzoozozozoozzzozzozzzoooozzzzzoozzzzzozzzoozzozooozozzozzzooozoozzooozzozoozzoooooozzzzoozzoozooozozzzzzzzozoozooozozzzzzoozzzoozoooooooozzzzoozozozzoozzzozzzozozoooozoooooozozoozzoozozooooozzoozoozoozozzzzzozozzzzzozzozozoozzzooooozzoozozoozzzooozozoozozozzooozooozzoooozzzzozoozozzoozzzozozooozozzzozozozzozzoozzoozzozozzzzoooozzzzzzzozozzzzzozzoozozzozoooozozozzzozzoozzzzooozoozzzoozozozozoooozzzozoozzozzzoooozozzzzzzoozzzozozooozooozzzoozooozoozzozzoooozozzzozoozzzzzzooozzoooozoozooozooozozzooooozozzzzoozozzozozozozoozzzoooozzooozzzoozzozoozzzzzoozooozoozzzzozzzozzzzozoozozzozoozoozzzzzozzzoozzzzzzozozozzzzzozzzoozzzozzzzzoozzozzzozzzozooozzozzzzzozzzzoozzozoozzooozozzozoooozzozzzooozozooooooozzozzoozozzzooozozoozzzozzozzzzzzozzzzoozzoozzoozoooooooozzozooozoozooooozoozozoooozzzozozoooooozozoooooozozzozzzozozzozzzoooozozozzzzozozozzzozzozzoozoozoozzzoooooozooozozozzzzzoozzzooozozooozzozzozozozozooozozzzzozozzozoozooozooozozzooooozzozozzzzozzzzzzozzoozzzzoozzzozooozoozzozzozooozzoooozzoooozoozzoozozozozzzozzozozzozzozozoozooozozzzozzzozzoozzoozzozozozzzzzozzoozooozzzzooozoozooozzzozzzzoooozzoozzzzozzoozzzzzzozooozzzzzooooooozooozzzoozoozzooooozooozooozzozzooozzozooozzzozzzzzozozzozzoozzzzooozozzzzoooozoozozozzozozzozoozoozzzooooozoozoozzzzoozzzozoozzooozzzozzzozzozooozzooozoozzoozooozzoozozzozzzozooozozoooozzozooozozzooooozzoozzozozozoozoozzooozozzoooooozzozozoozzzzzooooozzoozzoooozozzoooozzzzzozooozooozozoozoozzzozzzzooozozozoozzzzoooozzzooozzzzoozoozoozzzozzozzozzoooozoozzooozzzozoozzzoooozozzoozozzozozoozzoozzoooozzozoozozzzozzzoozzoozzozozzzozozoozzzzzooooozooooozzzzozozzzzzozzooozozzoozoooozzzzozoozooozooozoooooozooozzzoozoooozoozozoooooozozoozzzzooozzooooozoozozozzzzozzzozzoozzozozzzzzoozoozozozzzzzozozozzzoozozzozzzozozoozozoozzoozzzzzzoozzozzzoozozozzzoozozzzzozzozozzzzoozzzooozozoozozzoooozoozozozozzooooozozozzozozzooozooozzzzzzooozoozozzozzzooozzzozozooozzzooozzzzzoozzzooooooozzzzzzozzzoooozzzzzozzoooooozozoozozzozozozozzzoooozzzozoozooozzzozozoozzzozzzoozoozzozzoozozzooooozzozzzoozzozoozzzzzooooooozzzzooozoozzozooooozozzoozozzozzozozoozoozzoozoooozzzzzoozozooozzooooooozzzoooooozozzzozozzozzzzzooozzozozzooooozzzzzozzozzozzozzzozozozzzozzzzoooozzzooozozooooozzzzooozozozoozzooozozozozzozozzozozozozoooozzoozzzozzoozzzozoozoozozzozzooozozoozozzzozoozzoozoozoozozzoozzozozzooozzoozoozozozzzozzozzoozzozozzozzzzzozooooooozoozzzooooozzzoozzzzzooozzzzzzozzooozzzzoozzzooozozozzzozzozzzozzzozozooozzoooozzoozoozozooooozzzzzozzoooooozzzozzozzzozozoozoozoozzozoozzozooozozzzzzooozoozozzzzozzoooozozozzzzzooooozooozozooooozzzoozzzozzozzzozoozozoozozzzzzzzzozozzzozzozooozozoooozooozozzzozoozozooozozozzoozzoozozzzzozzzooozoozzoozoooooozoooozzzzzzzzzzzooozzozzzzooozooozzozozoooozzoozzoozzzoooozozzzzzzzzzzzozozzoozooozoooozzzozzoozoozoozoozzoozzooozzozooooozooozooozzzozzozzooozoooozooozooooozozzozozozoooozzooozzozzozzoooozzoozzooooooozozzzooozzozoozooozzoooozzoozzozooozzozooozzzzzzoozzzooooooozozzzzozozozooozzooozoozzoozzooooozozzooozzozzoooozzzzzoozooozzzzzozzooozozzzzzoooooooozoozoozoozzzzzzozozooozzzzozzozooozozoozzoozozozozooozzozzozzzoozozzzoooooooooooooozooooozzozzooozoozozooozzozzzzoozozzzozoozzoooooozzozozoozozozoooozoooozzozooozozoozoozzzzzoozoozzzzzooozzoozoozzzzooooozozooozooozzoozooozzozozoooozzzozzzzoozzzzooozzozzoooozoozoozozozzzozzoozzozoooooozzzzzzzzooozoozozzzozozozzozoooozozoozooozooozooozoozzzozzzzozzooozoooooozzooozozozzozozoooooozooozzzozzzozzzzozoozzozozozzozzozzoozozzzozzzzozzozoozzzoozozzooozozoozzozzooozzozzoozoozoozzoozzozoozozzozoozzzzzozzozoooozoozoozozzzzooozzzzzzzzzzzzoozzozzzozzozzozozozzooozzoooozozozoozozozzooozzzooozoooooooozozoozzzozzozzooozozzooozzoozozzoozoozzoozzzzzoozzzzzoozzzzzooozzozozzzzzzoozooozzozzzzozzzzzzoozozzoozozzoozzooozzzzzozozoozooozoozzzzooozzoozzzzzozzozoozozzzzzzoozozooozzzzooooozoozzzzzozooozozzooooozozooozozzoozzzoooozoozozooozzoozoooozooozzozzoozzooozzzoooozozzooooozooozzzzoozzozzoozoooozzozzoozoozoooozooozzzzooozzoozooozooozoozzozozzoozzzzzzzzozzooozzzooozozzozzozoozooozzzzoozzoooozozzoozzoozozoozozooozzzzoozzzzzzozzzozoozoozozzzzozzzzzoozoooozozzzozzozzzzoooozzoooozooooozzozooozzzozzozzooozzzoozzzoozozoozzozoozzozzoozzzzzzzzzzoozoooooozooozozzzzzoozzozozoozozzoozoooozoooozooozoooozzooozzzzzoozooooozzzozozozoozzzzooooozzzzozoooozzoooozozzzozozooozozzoozzzzzozozzzozzzoozzzzzozzzozzzozozzzooooooooozzozozzoozzoozoozoozoooozzzzzzzoozooozooozozoozozzzzzooozzozzoooooozoooozozooooozozoozzoozzozooozzzzozoozozozoooozzozooozzoooozzzoozzoozoozoooozzozozzozzzoozzozzzzzzzzzozooooooozzzzzzoozozzzzozozoozoozzzzzzozzzozzozzooozoooooozzozzooooozozozzzozozoozoozzozoozozzozzzozzzzoozozoooozozzooozzzzzzzzzzzoozooozzzozzoozoozzoozozzozozzzooooooozozooozooozozozzoooozzzzzoozzozozzzozzoozozozozzozzooozozozzoozooozozoozzooozoooooooozoozzoozzzzzozozzoozzozooozooozzzzzozzozzoozzozzzzzozooozzooozzzzozzoozooooozzozzoozozozozzzozoozzozzzozzzzooozozoozooooozzooozozooozzzzzozoozozozoozozozzzzzozoooooozzzozzzzzooozozzozozzzzozzooooooozoozzzozozzzoozzzzzooozozzozzooozzozoozzozzozzzzzozzooozzzzzzzzzzzzzzzozozooozozzooozzozzozoozzozoozozoozzoozzozozooozzoooozzzozoooozoozzzooozzzzoozoooozzoozozzzoozzoooooooozzoozzzozozozzozzzzoozooozzozzzooozzooozoozozzzzzozozzzzozzzozoozoozoooozzozzozzzozoozzzzozzzozooozzoozozozzozozzooozzozozzzzoozzozzooozzoozozooozooozzozzzozzoozzzzzzzozzoozozzzozzoozzozoozzozzzzozoozozzzzooooozzzzzzozozzzoozoozozoozzzooozozoooooooozooozoooooozooozzzzozzozzooozzoozzozzzoozzzzooozoooozzoozozozzooozzoooozzozzzzoozzooozoooozzzoozzozzzzoozozoozooooozzzozzzzozozooozzoozozozzoozozzozzzzzzozoooozzzzzooozozzzoooozozoooooozozoozozzozoozzoooozzzzzozoozzzoozzzzoozozzooozoozzozzzzoozoozoooozooozzzoooooozzoozzoozoozoozozzzzozzoozzzozooooozzzozozzzzozozzoozozooozozoozozzzzzzzoozzoozozoozzoozzozzozozoozzzozzzzzozozozooozoozzozzzozooozzzzozzozooooozzozoozoozzzzooozooooozzozzzozzzoozzzoooozozoozzooooooozozozoooozzozzzzzooozoooozozzzzzoozzoozooozzzzozzozoozoooozoozzzzzzooozozzzozozzzozzzzzozzoooozzozooozzozzzozoozozooooooozzzooozooozoozozzzzooozoooozzzozzzzoozzzzzzzzzozzozzozozzoozozzozozoooozozozoozozoozozzozzzzzozooooozzzoooooooozozoozoooozzzzozozozzoooooozoozzozzzooozzooozzoooozzozoozooozozzzoooozzozozzozzoozzzzoozooozzoozozozoooozzzzzozzzoooooozzzzozzooozozzooozoooozooooooozzzoozozoozozozoozzozoozozozozoozzoozooozozozzzzozzzooozzzzoozoooozoooooozozzozozzoozzozoozozzozozzozzzzozzoozzozzzzzzzzoozoozzzzzzzzzzzzoozzoooooozzoozoooozzooozoozzoooooooozozzozzzzoozozoozzzzozozooozzozooozoozzoozzzzzzzozzzooozzozzzzzoooozozoooozooozoozzzozzozozzozzoozozoozoozozozzzozzoozozzzozoozoooozzzooozozzzozozzzzzzozzoozozzoozzzoooozzozoozozooozzozozzozoozzzzozzzzzzozozzzooozozooozozozozzooozzoozzoooooozzzzozozzzzzzozozoozzozzozzzzzozozzozzoozooozzzozzozzooozoozzzzozozooooozooozzzzozzzzzooooozoooozoooozzzzzozzzzzzzozooozzzoooooozozzooozooozzzozozooozozzozozzzozoozozzooozozzzzzzozzooozozzzzzoozzoozzozzozoooozozozozozooozoozoooooozzzzzozzzzzzzzooozzozozzoozzozzzzoozoozooozoozoozooozzzozzooozozzzooozozozzzzzozoozoozooozooozzzzooozzozoozzozzzozozzzzzzoozozzoooozzoozzoozozzoozzoooozooozzzozzozoooozzozzozozozzzzozoooooooozoozzozzzoozzoozzoozzzzzoozoozzzoozozzooozzooozzzzozozozzozzzzozozoozozzzooozzzozozzozozoooooozoozozzzzooozooooozzoozzzzzzzzzozzooozzzozzoooozoozozzzozozozozzzozozzooozzoozzooooozoozzzozoozzzzozzzzozzzozozoozzozzzoooozoozoozzozoozzzzzzzzozooozzozozzooozzozozzozzoozzooooozzozzozzzzozzoozzozzzzozzoooooozozzozzzozoozzozooooozzzoozozozooozozzzzozzzoozzozoozozozzozoozzoozzoozzzoozozzzooozoozozzzzzooozooozzoozooozzozzzzzoooozozzzooooooozozzzzozzzoooozooozozozzzzozozzzozooooozozooooozozooozzozoozoozozzzzooozzzozzoooozzozzozzoozzzoozzozzzoozzzzoozzoozzoooozzzoooozozozozzzoooozzzzzozozzzzozooooozozozozozzzzoozzzozzzooozzzzzzoozzoozzozoooooooozzzzzooooozoozooozzzozzzzzzoooooozzozoozoooozzozzooozzzzozzzoozzzozozoozzozozzzozozooozzzzzzzzzooooozzozzooozozzzozozoozzzzoozzzzoozoozooozozzzzozzzzzozzzoozozzozzzozzozzzzzoooozzzzooozoozzzzzoozozoozozzoozzozozzzoozzzzoozozozoozzoooozzzzzoozozozoooozzoozzooozozzooozzoozzoozoozzozzozzooozzozozzzozoozooozooozzooozozzzozozooozzzozoozzozzozzoozoozozozzoozzzoozzzzzoozzozozzoooozzozzozzozzzzzooozzzooozoozozzoozzooozoozooozozozoozzzozozzozoozzozozooozoooozozoooozozzzozozoooozozzzzozzzooozozoozoozzozooozozzozzzzozzozzzooozzozzozzoozoozzzzooozzzzoozzzoozzozzzozozoozzzozzzooozzooozozoozooooooozzozooozzozooozozzoozzzzzoozzozzozozzooozozoozooozoozoozozoozoooooozzzzoooozzzzoooozozzooozooozzzozzzzooooozooozoozzooozzzoozzozzzzzzzzozozozoooooooozzoozzooozzoozozozzzzoooozzoozooozoozoozzzzooozzozzooozoozozzzozozzzzozzozzzzzoozzoozzzzozzozoooozzzzzzzoooozzzzozzoozzzzozzoozzooozzzozoozzzzzooozoozzoozzozozozoooooozozoozozoozozoozozzzozzooozzozozooozooozzzoozooozzzozzooozzozzzzzzzzozzzzozoozzzooooozzzooozooozozzzoooooozzozzozoozozozozozoozzozzzzzozozzozoozzoozozzzzzozzozozozzzzzozzzozzozzzoozozzozozzoozzzzoozzzozzozzzzzoooozzozozzzzzozzoozzzzzoozzoozzzzooozooozooozzozoozzzzoozzoooooooozoozozooozzzoozzzoozooozozzoozzozoozooozzoozzozozzzzoozzzzozzzzzzozoozzzzozzozoozooooozzzozzzzoozozoozzoozozoooozzzzzzzoozooozozoooozozoozooooozozzooozzooooooozzzoooozozooozzozzzzzzzzoozoooozzooozzzooooozozzoozzzooozozooozzozzozozozozozozozzzzzzozzzzoozoozzzoooozozozozzzzzoozzoozzzzzooozzozozzzzzzzooooozzzzzozzozoozozozoozoooozzoozzoozooozozzoozzoozzzzzzooozozooooooozzzozzozzoozozoozzzzzozozzzozozozzooozzzooozozoooozzoozzzzoozozzzozzzzozooozzzzzzoooozooozzozoozzozzooozzooooozzozooozooozoozzzozzzoozzozozozzzoozzzzozzzoozzoooozzooozzzzzzoooozozzoooozooooooozozoozzoooooozzozzozzzzzooozozooozooozozozozozozoooozzzoozozzzoozzzzzzoozzzzozzzozoozzoooozozzozzoozozzozozzzzoozzozzzzooozoozzozozozzoooozzooozozzozozozoooooozzozzoooooozzoooozzzozozoooozozzzzozzozzzozzzozoozoozozozzzzzzoooozzzoozoozoozozoooozzozooozozzoooozzozozoozzzozoozzzooozozzzozooozozozoozzozzoooozzooooooozzzoozzozzzzzzozoozzozzozoooooozooozoozoooozzzzozozozooozzooooozzoozzzoozzzzzzoozooozzzoooooooozozozzozozozoozoozozzzoooozzzzozozzoozzzozoozooozozoozzzozzzozzoozoozozzzzzooozozooozzzzzzzozooozzzzzozoozzozoozozzzoozzoozozozzozooozzzzoozzozzzzozozozzozzzzozzzzzozzzozozzzoozozooooozoozzzozzozooooooozozoozzozooozzoozzzzozoozooozozzozzzozoozzzoooozozzzooozzzzzooozzzoooozooozozzzzzoooozzzzoooozozzozozozoozoozozozozzzozooozozzozooooooozzozozooozzooozoozoozzozzoozozzzooozzzozzzzozzozoozozozoozzzoooozzooozoozzoooooozzozzozozzzzzozzzzoozozzzooooooozzozozozooozozozozzzzzzzzzoooozoozzoooozzzzzzzzzozzzooozoooozozozzzozzozzozozozzozooozozozzzzooooozzoozozzozoozzzzozozzozzooozzooooozozozzooozzozozozozzzzzzzoozozozzoozzzozoozzozzzozzoozozozoooozzzozoozzzzzooozzzzzzzozzzooooooozzzzzzozzzzzzzozzozoooozzooozzzzzzzozozozooozzozzzooooozzooozzzzzooozzoozzozzzoozzzzozozzoozzoozozzozzzzozzzzzozozzzozzoooozzoozzozzzzozzozzzzzozzoozozzzzzoozzzozzzozooooozoooooooozoooooooozoozzzozzozzzzozzzzooooozzzozzzzzzzozzzooozzzooooozzzoozzzzozozzoooozzozzzoooozzozozzzozzzoozozooozozoozozzzzzozzzozoozzzooozozozozzozozzoozozozzzzoozozozzozoooooozzoozzozozoozzoozoozzozzzoozozoooozozzzzozozooozzoozzzoooozozzzzzzzzozzzozzooozozoozozozzzozozozozzoozzzzzoozzooozozzooozzzzzzzooozzzozzzzzzozzoooozoozoooooozozoooozzzooozooozoozzzoozzoooozoozozooooozzzzzzozzozzozoozzoozzoooozzoozzozozozozzozozzzzozoozzzoozozoozozozzozozozzoozozoozooozzozzoozzozozzooozzozzoozozzozzoozoozozzzozozooozozzzzozoooozoozoozooooozozzzzozozzzozoozozoozooozozoozzoozzzozozzzozoozzzzzozozzzzzooozzooooooozozooooozzzzzoozzoozzzooozzozozooozoozzozozozoooooozzooozoozoozzooozzoooozzooozozoooozoozzzzoooooozzzzzozozzozzzozozzzoozzzozooozzooozzzoooozzzzoooooozzzozzzzozzoooozozzozzoooooozzoooozozzzozoozzzzzooooozzzzzoozzoozzozzoozzzoozzozzzoooozzzoozzzozoozzooozoozzzzzozzozoozozozzozoooooozozzoozzozozozooozzooozzzzzzoozzozozzozzzzoozzzzozzoooozzzoooozozzozzozzooozozoooozzzoozzozzoozozoozzozozzooozzozzozoozoozozzzzzzzzozzozoozozooooozozzzzozozozzzzzozzozoozzozzzoooozzozozoozzzozooooozozozozoozozzozzoozooozoozooozozoozozozoozzzzoozzozzoooozozzooooozozzzozzzozooozzzzzozzzzzoozzozozzzozzozozzooozzozzzooozzzozoozozzoozozozoozzzozzozozooozozooozoozzzzooooooozzzozozzozzozozzozzzzozozoozzozzoozozzooozzzzozzoooozzzooooooozoozozzozozozoooooooozzooozoozoooozzozzoozoooozzoozzzooozzozzoozoozoooozzoozzzozzoozoooozoooooozoozoooozzooozzzoozzzooooooozzozzozzozoozzozzzzzoozozzooozzoooooozoozoozozzooozzzzooozzozoooozzzzozzzzzozzooooozzzzooozzzzzozzzozzoooooozoozozzzzzzozooozzozzzozzozzzozozozzoooozooozzzzozooozozozzzzzozozzzzozzooozoozzzzozoozzozzoozzzozzozzzoozooozoozoozzzzzzzzooozooozoozzzzozzoooozozoozzoozozoozzooozzzzzoozzoooozzzoozzzoozzzzoooozozozzozoozozzozozzozozzoozooozzozzoozozzozozozozzzoozzozzozzoozzzzzzzoozooooooozozozozzoozzoozozzzoooooozozzozoozzooooooozzzoozozzozzozozzozzzoooozoooooozzzzooozozzozzoozzozoozzzzzozoooozozoozozzozozzzzzozozzzoozzozzozoozoozzozozzozzzozzzoozzoooozoozozozooozozzzoozoozzzzzzzzozzozzozzzzozzzozzzozoooooozoozzzozzooozozozozzzozoozzzzozzozozzozzozooozzzoozzozozoozzzoooozzzzzzzozzzooozzozoozzzzoooozoozzzooozozzzzoooooozozooooozoozzozzoooozzzzzooozoooozzozzzzoozzzoozozzooooozzzooozzzzzozoozzozzzozoozoozzozozoozzoooozzzooozzzzozozooozozzooozozoozzoozzzozzozozzzozoozzzozzzozzooozozozzozzzzzzozozoooozzozooozozzooozoooozooozozzozooozzoozzozzozzozozozoozzzozzzzzozooooozozozozzzzoozoozzozozozzozzozzoozozozzozozozozoozzzozoozzozzozzozozozzoozzozzozzzzzozzzzozzozzzzzzzzzzzzzzozooozozzoozzzozzzzoooooooozozoozzoozzzzozzozzozoozzozzooozozoozozooozoozoooooozzzzozoozzoozzooozooooozoozzoozozozzozozzzzzozozzozzzooozzzzooozzozoozzzzozzzzzozooooozoozooooozoozzozzzzoozzzzozzzzzoooozoozozzzzooooozoozzzooozozoozoozzozozzooozzooozzoozzozzzozzoozzzozzzoozooozzzzoozoozzzzoozzozzozooozzozzzzoozozzoozozozzzzzoozzozozozzzzoozzozoozoozoozooozoooozoooooooozozzozzooooooozzozozoozzozooozoozozzozzozzzzooozzoooozzzzzozoozzooozozzzzzzzzzzzzzzzozzozzoozoooozzzzzzzzzzozoozzzzzzozozzozzozzoozozzzozoooozozozooooooozzooozzzzooooozozozzozoozoozzzooozzozzoooozozzozzzzoozzzzoooooozzozzozozzozzzooozzoooooooozoozzooozzozzozzozozozoozooozzzozozzooozzzoozzzzozozozoozoozzzozoooozzzzozzzozzoozozoozooozozzzozozoozzzozzozzozooozzoooozozzzzzzzozoozzzozzozzzzozzzzzoozzozzzzooozooooozzzoooozzzoozzzoooooozzozooozzzoooozozoozzzoozozoooozzzooozzzooozoozzoooooozzzzozzoooozzooozzzzozzzzoozzozzzozozzozzzzzzozoooozozozooozzozzzoooozozzzooooozzoooozoozooozozzzozoozzoozzzzozzzooozoozoozzzzzzoooooozzzzzozzoozoozooozzoooozozzozoozozzzzoooooooozzzoooozozozoooozooozzozzozozzzzozoooozooooozzzoozzzooozzoooozoozoozooozozzzozoozzzzzzooozozzozzoooooozzoozzzozzzoozzzzzozozzzozoozzzzzzzozozozzoozooooozoooooooozozooozoozozzzoozzozoozooozozoooooozzoozozzzzzzozzzooozzzzzzzoooozoooozozozzozozzoozzzzzzoozzozzoozozzooozoozoozozozzzzoozoozzozzzzozozozozzooooozzzoozozoozzozozooozzooooooozoozozzzzoozozoozoozozozoooooozozozoozozzzzoozozozzzoozozozzoozoozzzozooooozoozoozzzozzozoozoozoooozoozoozzooozoozzozzozzzzooozzozzzzzzoozozzzozozzzzzozzooozozzoozzooozozzzozozzzooozzoozozozozzzozzzozzzzzzzzzzozozozooooozozoozzoozooozzzozooozozzzzozzozzoozzzozozozzozzozzozozzoooozzozzzozoozozzozozoooozzzozoozozozzozzzzzozzzzzoooozozzzozoozozzozzozzzozzzzooooozzooozoozozzooooozzzzzozozoozzoozzzzzzoozzooozoozozooozzzzzzozzozozozzozozzzozzoozozzooozozozozzzozzzoozzooozzzzzzzoozzzzzzzzooozozozzooozozzzzoozoozozozoozzozzoozozozzzoozozzzoooooozzzozzzzoozzooooozooozoozzooooozzzozzzzoooozzozozooozzzoooozooozzozzozooozzooooooooozzzozozoooozzoozooooozzozzzoozoooozzozooozzoozzoozzzoozzzozoozozozzoozzzzooozzoozozzzozzzzzzoozzzozoooozozzzzoozzzozozzzzozozooozoooozzzzzooozooooozzoozzoozzozozzzzoozozzoooozozoozoozzozozozzzzzozozzozzzzoozooozoozoozozzzzozzzoozzzzzzzzooozozzzozzzooozzzozoozzozoozzozzozoozooozzozzozozozzzzozzzozooooooooozoozzozzzzozzoozoozoozozzozoozozzzzozozzzozoozozoozozzzoozozoozoozozzozozzzzzozozozzozzozoooozoooozoooooozooozzooozzozozzozzoozoooozzoozzozzzzoozzzoooozzzzzzoooozozozzozoozzoooooooozoozzozoooozoozzooozozzzozoozzozooozzozzozzozozzzozoozzzzozooooozzzoozzoozzzoozzzzzozzzzzzooooozzzooooozzoooozozozzozzoooozzzzzozozzzzozoooooozzozooozzzzozozzozzozzozzzzzzoozoozoooooooooozoozzzzooozzozozozozzzozzzzzooooooozzozoozzoooozozozoozoozozzozozzzozzzzozzozozozooozzoozzozzozzzooooozzozoooozoozozzoooozzzooozzozzzzoozooozzzzzzozzzzzoozzoozozzzzozzzoozzzzzoozzzzzzooozozzzoozoozzoozzzozoozoooozzzoozozoozzozozozzoooozzzzzozzzozozozoozozzzzzoozozzooozzozozozzoozzozoozzzzozzooozzoozozzzooooozzzooozozzzozozozoozzozzozzzzzozooozoozozozoozzzooooozzozzozooozzooooozozzoozozozzzooozzzzozzozzozzozooooozozzozzoozzzozozzozzzzozoozoozzooozzzoozzozozozozzzzozoooooozoozzzzzzzzozzzoooooozzzzooozzozozzzzozzzzzzozozzzzoozooozzzzzzoozozzzooozozoooozzzzooozoozzzozzzooozzozozozzozooozooozzozozozzozoozoozooozzzzooozzozzzzozooozzozzzooozzozzoozozzozoooooozzozoooozzzzzoozoozzozozoozzooozzzooozozoooozoozzooozzzoozzozozozzooooozzzoooooooozoozzzoooozoozozozzzzzoooozzozozzzoozoozzzzooozzzzoooozoozozzzozozoozozzzoozzoooozoozozozoooozooozoozoozoooozozzzooozozozozzzzzzzooooozzoozzzozooozooozoozzoozozzzzozoooozozoozoozzzoozozozozzzooozzoooooozoozzooozoozozzzoozooozzoozzzzzozozzzooozzzozozozozzzoooozoozoozzoooooozzoozoooooozozzoozoozoozzzzoozozzozooozzozzoozzzozoozozozzozzozozzzoozzzoozozzozozozzzzozoozzzozoozzozzozozzzozozzozzoooozozzzzoozzzoozzzoozzzoooooozzoozozoozzozzozoooooozoooozzzzzozzoozzoozooozzzzzzzzzzozzooooooozozzzzzzzooozozooozzzzoooozzzzozzzzzzzooozozzzozzzzoooozoozzooozzooozzozzzzzoozooozooozoozzzoooooooozozzooozzoooooozzzzooozzoooozozzozzzzzzooozoooozzooozzzozooooozzoozzzooooozoozzozzoooozzzozozozooozzzoozzzzoozzzzzzzzoooozozzzozzzoozzoozozzzooozzzzoozzzoooooooozzzzzoozzooozozozzozoooozzzozzoooooozozooozzoozzzzzzooooozozooooozzzozzoozzzoozoozzzzoozozzzozozzzzozozzzooooozozozzooooozzoozozozzzozoozoooozzoozzozozooozzozzozzzzzzooozozooozzozzozooozzozzozozzzoozzozzzozzozozoozzzzooozzzzooozooozzozozzooooozooooozzoooooozozooooooozooozoozooozzzzoozzzoooooozzozzzooozozoooozzzoozozozozzzzzzzzzozzzzzzzooozzzzoozzozzzzzoooozzozozzzzzozzozzzzozooozozozozozzzooozzooozozzzzozozozzooozzozozoozoozzzzozzoooozooozozzzzzzzzzozozozzoozoozozoooozzzoozoozozzzooooooozzzzoozozzzzooozzzzoozozzozozoozozooooozzzozzozzoozozozozzzoozoozzozozzzoooooooozzzozzzzozzzoozoozoozzozoooooooozzzoozoooozozzzzooozooozzoooooozzozzzzozzzzzzzzzooozzzoooozoozoozoooozozzzoooozozzzzooozozzzozoozoozzzozoozooozozzozoozozooozoozoozozozzoooozoozoozoozzzzzozoozzzzzozzozoozoozzozozoozoozozozzozoooozozoozzozzozooozooooozzzozzzzzooozozozzzzozoooozzozoozzzozzozoooozoozozooozozooozzzozzzzozzzzozzzzozoozzozzoozzooozzozoooozozozzzzozzzozzzzooozoozzoooooozzzooozozozzzzozzzzozoozzzzzzzzzoozoozooozzzoooozozzzoozooozozoozoozzooooozzzzozzzooozzzozzzzozzzzoooozoozozzzzooozzozoooozzzozzzzzozozozozzozzozzzzzzzozozooozozozzooozzooozzooozozzzzzozzzoozozoozooooozzzozzozzozozzozzoozzzozozzzzzzzzzozozozzzzzozzoozzzzzzoozozzozzozozzoozzzoozzzzoozooozzzozoooozozzzoozzooozozzzzzzzozozoozoozoozzzzzzoozzozzozzoozozozozozzzzozooozzzzooozzzzzzzozozozooooozzzzozoozozzozozzoooooozzooozzoozooozozzzzzozzoozoozoozzzooozoozzooozzoozozozzooozooozooooozzzozozoozzzzozzzzzozozzzoozoozzozoozzozzozozzzzzoozozzoozzzzzzzzoozzozzzozozozoooooooooozozozooozzoozzzozzozzzzozzzoozooozzzoozzozzzzzzzooozzzozoooooozoozzzozzzzoooozzzzzzozooooooozzzzzzozozozzoozzzoozoozzzozzzzoooozzzzzozooozozzozozzzozooozzzzoozozoozozooooozzzoozzozozoozooozooozzzzzozzzozzooozzzzzzzooooozooozzozoozzozzzzzzzzozzzozzoozzzzzozozozzoozozoozzzozzzzzzoozoooozozzozozzzzzzzoozozoozzzzzzzzzoooozoozozzzzozzoozozzzoozozooozooozooooozoozooozozzozoozzzzzoozzozooozoozoozzzooooooozzozozzzozozzzzzzzozzoooooozzzozzzzoozooozzzzozoozoozzoozzoooozzzozzzooozooozooozozzozzozozzzozzzozozoozzozzzzozoooozozzoozozooozozzzzzoozzzozooooooozoooooooozzooozozzzzzzozoozzzzoozozzzzzozozzzozoooozozoooozzzzoooozzzozzzooozzzzozooozzozzooozoooozozoozooozoozoozoooozooooozzooozzzzooozoozzoooozozozooozozzozozozzzozzzozzzzzzzoozzozozzzoooozzzooooozzzzzzzozzzzooooozzozozzooooozzzoooozzzzoozozzozzzzzzozzzzozooozozzzozozooozoozzozzoozozzzzzozzzozoozzozzzzozoozzozzozozzozozzozzooooozzozoozzozzzozzoozzoooozozzzoozzozzzzozzzzoozzzzozzzoozzoooooozoooozzozoooozozoozoozzoozozzzoozozzoozooozzzzoozoozooozooooozzzzzzooozzozoozzoooozozozzzzzzozoozzzzozzozoooozozoooozozzzozoozzzooozozozozozzzoozozoozzooooooooozoozzozzozozozoozzzoozzzozooooooozzzooooozzzzozooozooozzzzzzzzoozoozzooozzzozzooozzoozozozzzozoozzoooozoozozzzzozoozzzzzoozozooozzzoozzzooozzozooozooooozoozoozzzozooozzzozzooozzoozzozzzzooooozzoozozooozzooooozozzoooozzzooozoozozoozzzzzozozzooooozozzooooooozzzozzzzoozozzzzozoozzozoozoozozoozzozzooozooooozoozzzzozozozoozozzzzzooooooozzozzozozzooozzozozzooozzoooozzoooooozoozozzozzzzoozzooooozzzooooozzoozzozzzzzooozozzooozozzoozzozooozoozooooooooozozozooooozzzzozzoooozoozzzzzzozoozozzzzozozooooozoozzzoozoozozoozozozoozzooozzozzzzzzzoozozzooozozozoozzzzoozzzzozzozzozoozooozzoozzzoooozzzzzozozoozzozzooozoozzzoozoozzoozzozzzoozzzzozoozozozzooozzozzozozzoooozoooooozzoozzozoozooooozoozzoozzozzzozoozzzzzzooozzzzzzoozozozzozzzozoozozzzzooooozozoozozzoozoozoozzzozzzzzozzzzoozozzzozoozoooooozzzzozzoozzozoozzzzzzzzozoozzozozzzooozozzzoozzozzzzzzzzozozozzozozzooozozzzoozzzozzzoozzoooozozzzzozooooozzzoozoozooozozzozzozzoozozozozoozzozzzzooozoozzzozzoozzozozzzzzoozozzozzzzzzzzzoozoooozzoooozoooozoozzooozzzozzzzoozzzozozzozoozzzzooozzoozzzoozzoozzzooozoozzzzoooozoozoozzozzoozoozzzozzoooozoozzzoozzzooooooooooozzzoozozzzzozoozzzzzoozoozzzzoozozooozooooozzooozzzzozozozozozzozozzzoozzoozzoozzozozooozooozzozozozzzzozozoooozzzzzozzoooozzzzzzooozozozoozoooooooozozoozooozzozzoozzzzzzozzozooozzoozzozzzoozoozozozoozzzoozoozzozozoozozzzzzzozozzzzooozooozzozozozzozzozzozzzzzzozzozzzozzozoozzooozzzozozoozzzzzzzzozoozzoozozozozozozozzozoooozooozzozzoozzzzozzozoozoozzozzozozoozozoooozzoozoooooozzozzzoozozozzozozozzoozoozzoozozzzzozozzzzoozzzoozzzoozzozzooozoozoozozzozzozzozooooozozzzzzoooooozozozzoozzzzzzoozzzooozozzzozzoooooozoozzzooozozozzozozzzozoozozzzzozzzzozzzzzozzooozoozozoooooozzozoozoozozzozzzozzooooozzooozzzozozzoozozozzoozozozozzzzzzooozzoooozzoozzozozozzooozoozzoooozozzozzoooooooozozozozooozozozoozoozozzzozozozozoozooozzozozzzzzozzzozzzzozzzzzzzoozzzzozzoozoooozozzzzzzzozzozzozzzzoooozozooozzozooozoooozozozozoooooooozozzzzzzzzzoozoozzzzooozoozozozoozozzzoooooozzzzooooozzooozoozozzzzozzzozzzzoooozoooooooozoozzzoozzzzzozzozozozoozooozozzzozzoooozzoozzzoozozozoozoozzzozooozzoozozzzozooozozozzooozozzooozzzzoozzzzozzooooozzzooozozzzzozzozoooozozzozzzzzzoozoooozzzozzzoozoooozzzzoooooooozzzzzzoooozzozooozzzooozozzozzzzoozozooozzozzzozzooooozzzzzooooozzzzozooooozzozoozzzozozozozoooozzzzzzozzzzooozozoozozzoooozzozzzoooozoozzooooooooozozoozozozozzoozooozozzozozzozoozzooooozzozozoooooooozzzozzzozoozozozzoozoooozozzozzzzzzozooozozzzzoozzzozzzoozzzooozoozozzozzzzozzzoozooooozzzzozzozzzoozooozoozoozooooozzzozozzozzzoooozozzozzzooozzzzzzzzozozzzzozzzzooozzzozozozzzzzzozzzzzzzozoozzozzoozoozozozoozooozzzzzooozzzzzooooozzozooozzzzozzozzozzzzozozzzzzzzzzozozzzoozzzzozoozzzoooozzzzzozzzzzzoozoozooozoozoooooozoozzzzoozzoozzzozozozzzzzzozozzzoooozozzoozzzzoozzzooozooooozozoozozzozoozoozozozoooooooozozoozozzzzoooozzzzzoozooozooozoozzooozzooozozooozzoooozzzoooozooozzzooooozoooooozzozzzozzzozozzozzzzzzzozozzzooozozzzozzooozzoozozzooozzzozozzzzoozooooozozooozzooozooozzzzzzzozozooozozoooozzooozoozoooozzozooozoozzzoooozzooozoozozozzoozozozzozozooozzozzzozoozoozzzozoooozozozozzozozzzzzzzoozzozzooozzozzzzozozozoooozzzzozzzzoooooooooozooozzzoozoozzozzozozzzzzoozzzzzzozozoooooozozooozooozzozzozozozoozozzzozzzooozzooozozozzzzzozzzooozozozzzzzozzozzzzzoozooooozozzozozozozzozozozozozozzzzzzoozoozzozzozzzzzoooozozzzoozzzzozzooooozoozzooozozooozzzozzzzooooozozozzoozzzzozzoooozzzzzzzozooozoooozzoooozozzzzozzzozoooozooozoozooozoozozzzzoozzzoozzoozozzozzzozzozzzozzzozzozoozozzzzozzzzzzzzzzoozozoozooozoozzzozozzzzozozzozozzozzoozozooozozozzzozzzzzozoooozozozozzoozozzooozzozzzozozoooozozzzzozzzozozzoooozozzzoozoozozzozzzoooozzozzzozzoooozozozozoozzzzzzooozozoozooozozoozozozzzozozzzzozzozoozooozooozooozozozozooozzzooooozoozzzzzzzozozzozozozzoozoozozoozzzzooozozoozzooozoozoozzzzooozozozzzoozooozoooozoooooozooozoooozzoooozooooozooooozooozozzzzoozzoooooozoozzooozzozozzoooozzzoozooozzoozzozoooozoozoooozozzzzzzozzozooozoozzoozozozzzozoozzzzozoooooozzoozzozoozzozzzzoozzoozzozoozzzoozzooozozzozozzzzoozooozzzoozozzzooozoozoooozozooozozzzozooooozozzzzoozzooozoozooooooozoozooozozzoozzozzzozozzzzozzzoooooozozzozzoozozoozooozoozoozozoozzzzzzozzzoozozozozoozozzozzozooozzzozoozzooooozzoooozzoozozzzoozozozzzzoozozzozzzzzozzooooozoozozzzzzozzzozozzoooozzozzzzozoozozoozzozzoozozozzozozozozooooozozzzzzzzzzzoozzzzozzozzooooozzzozozzoozoozzooooozzozozozzozozoooozzzzozooooozoooozozooozozoooozzozozozozzzoozozzzzzzzzoooozozoozozozoozzzozooozzozzooooozzozzooooozoozooozzzoooozzzzzoozzzooozoozoozozoozzoozzzozozoozzzzoozooozzzoozzzzozzzooozzzozozooooooozozoooozzzoozozzzoozozooozzoooozozzozzzozozzzozzoozzzooooozzzzoozoozzozoooozozzzoozozzoozooooooozzozzozzzzoozzzzoozozzzzoooozzoozzozzzozoooooozzozzzzzzzzoozoozzooozzozzzzozzoooozzzozozoozzzoozooozzzozzzzozzzozozoozzoozzzzozzzozooozzoozzzoozoooozoozoooozoozozozzoooooozzzozzzzoooozozzozoozzzzoooozzzoozzooozooozozzoozozzozoozoooozzzoozooozozzzoozoooooozooozozoooozzozooozoozoooozoozzooozozozozzzzzozooooozzozzzoozzozzzzozoozzzozozzzzozoooozozoozoozzzzoozoooozzzoooozozozzzozzzzoozzozzozzzoozooozzzozzozzozozooooozzzozzzzzozzooozozzoozozzzzzoooozoozzozooozozzoozooooozzzzoozzzzoozoozzozzoozzoozozzzoozooooozoozzooozzozozoooozzozzzoooozzzoozoozzoozozozozozozoozzoooozozozoozoozoozzzoozozzzoooozooozozoozzozzozzoooooooooozzzzzozzoozzoozzozzzzzzzoozoozzooooozzzozzzzzzozoozozooozzoooozooozzoozzozzzooozzzozozzzzzzoozozzzzoozzozzzooozzzzozzzozozoozzozzzooooooozzozzooozzoooooozzzoozozozooozoozozzzozzoooooozzzzozozzzozozooozozozzzozoozzoozoozoooozozzooozzoooooozoozzzzzzzzzzzzzzoooozzzzzozzooozooozozzzoooozzooozzzooozoozzozzoooozzooozozozzzoozzozzzzzzozooooozzoozzooozzzzozooooozozzoozoozzozzzozzzoozzoozzzoooozooooozzzzozozzozozozzozozooozooozoozooozzoozozooozozooozzozozooozzozzozzzzzzoooozzoooozzzzozozzzozzzoozozzzozooozzzozozooooozzzoooozzzooozoooozooozzoozoozozooozzoooooozzoooooooozozozzozzoooozzooozoooooozzzozzooozoozoooozzzzzzozooozozzzzzzzozzzzozozoozzzzozzzzzozzzzooozozzzzzzozozozozozozzozzozozzozzozzozzzoozooozzzozoozzzzooozzzozoozozzzzzozooooozozozozzzzzzzzzzzozozoooozozozozozzzzoozozzoozzooooooozozzozzooozoozoozooozzoozzoozzzzozooozooozozzozoozzozozozzzoozozzzozzzzzoooozooozozozzzzoozzoozozzoozzzzzoooooozzzzzozoozozoozzoooooooooooooooozzzzzzzooooozozzoozzzzzoozzzzozoozoooozozzzozozzozozzooozozozzooozozzozzzozzooozozzozoozooozozzzzozoozozzozoozzozoozoooozzzozoozzzzzozzooozooozzozozzoozzoozozoozoozozozoozzzzoozoooooooooozozzooozooozzzzozzzzzzooozzozozzzoozzozzoozzoozzzozozoozzoozzzzzzooozzzozzozooooozzzzoozzozozzoooooozozozozzozozozzzzoooooozzooozozzzzooozozozzzzoozzzzzzoozozzzozzoozoozooozzzzooozozzzozzzoozozoozzzzzooozoozzozzzzoozzzzozozzozzzozzooooozozzzzzoooozzoozzzozozzzzzozoozzozzozoozozzzzoozozozozozoooooozzooozzooozzzzzzzooozzozozooooozozoozooooozzzozzozooozzzooozoozzzzozozozozzzzzozooozozoozoozooozzzozozzzzzozoozzzooozozozozozozooozzozozzzoozoozzzzzzzozozooozooozzoozozoozzozoozzozzozzzozozzzzzozoozzzoooozzzzzozooozozoozozzzzzozoozozzoozzzooozooozoooozoozoozoozzzzzzzzoozozzozzozooozoozoozzzooooozozzozooooozooooozzzozozozzzzzozzozzzzzozzzozozzzoooozzozzozzzzzoooozzoozzzzzzoozzoozooozoozozozoozooozozooozozzoozooozzzozoozzzzozzzoozzozozooooooozzzzzooozzzzzzzzoooozoozzzozzozozozzozozzozoooooooozzzzzozozzozzozzoozzoozzzozooooozoozozzozoozzozzozozozozoooooozoozzzoozzozozoozozozzzoooooooooozozozzzozozzzozzooozzzozzzzooozzooozoozoozoozzzzozooozzzozzozzzzzzozozzzooooozoozzoozozzzzozoooozoozzzzzzzozzzozozozoozozoozzzooozozzozozzzzoozoozozzzoozozoozzzoozoozoozzzzoozzozzozozzzzzzoozzozozozzozzozozzzzooozooozozzoozozzzoozooozzooozzzzzozzzooozooozzzzozoozzozzzozzzoozzzzozzzooozooozooozzzzooozzozzzozozozozzzzzzzoooozozzzzzzzzzzozoozoozzoozooozzooooozoooooozooozozoooozozozozzzzoozozzoozoozzzozzzzzzozzozozzzzzzzzoozoozozozzozzozozzzoooozoozozzooozoozzzozooooooooozzozozoozozoooozzozzzzzozzoozzooooozozzzoooozzzozzzozzzozozzzzzzzozzozzzzozzzozzozozooozozzzzzzzooozzooooozzozoooozozozzozzooozzzozzozzozzzzzzozzooooooozozzzozozooozooozoozozzozzzozzozzzzzzzozzzzzzooozzoozzzozzzoozzozzooooozzozoozoozzzozzoozzzooozozzzooozzzzzoozozozozzzzoozzzozzoooooozzooozzozooozzzzozzoozzoooozzozzzoozoozzozzzzzoozoozzoozoooozzzzzozoozzzozzozzozoozzozooozzzozooooozoooozoooozozoooozozzooozozzzooozozozzooozzozozoozzzooozzoooozozzzozzozzooozoozzoozzozoozzzooozozooooozzoozzooozoozzzzzozzooooozzzoooozoozoooozozzzozzozzozoozzoozoooozzzzzzozzozzzzooozozooozzozozzzooooozzzoozooooozzozoozzzzoooooozzzzoozzzooozzzzzoozooooozozozoooozozozozozzoozozzzooozzozozzozozzzoozzzzozzozozooooozoozzzzzoozzzzozzzzzzozozozooooozooooozozzzooooooozzoozozzzzozozoooozzzzzozooozozzzzzzzozzzoozzozoozooozoozozzzozozoozoozozzozozzoozoozzoozzzooooozzoozzozzzzzzoozzzzooozooooozzooooozoozoozoooooozozozzoozozozzoozooooooozzzzoozzoooozzzzooooooooooooozzoozzozozoozozzozozzoooozooozoozzoooozzooozozozzozzzoozzozzoooozzoooozozzozoozzoozzzozzzzozozoozzzooozoooozzzoozzozzooozozzzoozozoozzzzzzoozoozzzozzozzzozooozooozzozzoozzozooozoooozzoozozzoozzzozooozozozooozzzzzzoozoooozozzzozoozozzzzoooozzoooooozzozzzozzozzozzozooozzzzzooozozozoozozzzzozzzzzzzooozooozzzozzzzzozoozozzozozooozozozozzzozzzzzozoozozzzzozozzzoozoozzooozozzzzzooooooooozzzzozozooozzzozzozzooozozozzoozoooooozooozozzoozzzozzzoozzzozzozzzzozzzzoozozozzozzzozozzzooozooozooooozozoozzzozoozzzzozozooooozzzozzozoozzozzozzooozzzoozozoozzzozzzoozozooozzoozooozzzzzozoozzzozzozoozzozzzozzzooooooozooooozzozzozzzozzzzoozzzozzzozzzzozzozooozooooozzoozzzzoozoozzozozzozozzzoozoozozooozozozoozzzoozzozozzozzzozozoooozzzozozooozozzzozzoozzooozozooozzoooozooozzoozozzzoooozzozzozzzzooozozooooozozozzzzooozoozzooozozzoozoooozoozzzzzzzozzzoooozooozzooozoozozzzzzozzzzzzozozzozozzzooozzooozzzoooooozooozoozozozzzoooozozozozozozzzzoozozoozzzozzzoozzooozozoozzozoozzozzzzozzzoozozooozooozzozoozzozooozozzzzozozzzozzzoooozzzzooozoozzzoozzzozzzzozzoozzoozzooooozozzzozozzozoooozozzozzzooozoozooozozozzoozzoozzzzzozzzozozooooooozozoozozozozozoozoozzozoozozzzzzozzzozzoooozozoozoozoooooozozoozoozozoozzozzzooooozozzozoozzzzzzzzoooozzzzoozzzozoozozzzooozzozoozzozzzozozoozzoozzozzzoooozzzozozozoozzooozooozooooozzzzzzzozozzzozozzzzzoozoooozozozzzozzzzzzzzzooozzoozoooozzozozoozzzozzoozzzoozozoozzozzzzoooozzzozoozozoooooooozozooozzzoooooozozzozzzzzzzozzozzzzoozzozzozozzooozzzoozooozzzooozoozooozzoozozzzzozzzozzozoooozzoooozoozozozzzozzzozoozzzzooooooooooozzoozzooooozooooooozozozzozozzzooozoozooooozozozozooozozoozozozzozozzzzooozozozzoozozzzzzoozozzzzozzzzzooooozozozzzzzoozozzozzzozzzooozooozzozooozoooozozzzzzooozzzzoozzzzooozozzzzzzzoozozooozzozzzozzooooozzoozzozoooozzooozooozzozzozzoooozozzzooooozozzoozzozooozozzzzoozooozoooozoooozooozzozzoooooozzoozzozoozozoozooozzzzooozoozoozzooooozoozozooozoooozzzzzzzozoozozozzoozoooozozzozzzzzzozozzzzzoooozzzzzzzzoozzozoozoozozzozzzozzzzozzooooozoozzzoozzzoozzzooozozoozzooozooozzzoozozoooozozoozozzozzzoozzzzozozzzzoozzzzooozzzzozoozzzozzzzozoozozoozzozzozzoozozozoozoozzzzzzzzozzzzzooozozoozoozzzzzozzozoozozoooozzzozzzzzozzzzzzozzzzzoozozzozzozzzzzozozzzzoozoozoooozzoooooooooozzzzzozzooozoooozozzozzzozzzoozzozzzzzoozzzzooozzozozzooooozooooozzozzzooozozooozzooooozzzzooozzzzooooozooooozoozzooooozzzooozzzoozozozzzoozoozozoooozzoozozzozoozozoooozozzozozzzozoozzzzzzzzzzzoozzoozzooooozoozzozoozoozooozzzozozzozoozzoozozozzozzzooozooozzozzzooozzooooozoooozzooozozzozooozzzzozooozzoooooozozozoozozoozoooooozozzozoozzoozzoooooooozzzzzoooozozozozzzzoozzzzooozzooozzoozzozzzzozzzzzoooozzzoooozzooozoooozozozozzzoozoozzooozozzzzzozozzozozozozoooooozoozoozooozoozzzzzzozoozoozzzzozoooozzoozzzzozozzozzzzoozozozzzozoozooozzzoozzoooozzzozzoozoozzzzozozzzozzzozzozozooozzozzzzzooozooozozoooozzzzozzooooozzozzooozzzoozozzoozzzozooozozozzoozzzzzzzooozozzzozoozooozozzozzoooozoozzzozzoozoozozozozoozoozzoozzzzzzoozooozzzozzoozozzzoozozzzoozzoozoozozoozzzozzozzzzzoozoooozozoooozozozozoozzzooozzzozzzzzzozzozooozzzzzzzozzzzzozoooooooozoozoooozzooozzoozzozozozozzzzzozozozoozzzoooooozzzzooozzoozozzzooozoooozzoozozoozoooooozozzzzzozooozoozzooozooooozzoozzozozzzzoozozoozoozzooozzoooozozooooozozozoozzooozzozzzozzozozzzozzozzoozozzozzzzozzooooozzzoozoooooozzzoozzozozozoozozozoozozoooooozooozooozzzzozozooozzzozozozzzozzzoozooozozzzoozoozzooozzozozooooozzzoozooozzoozoozooozooozoozozoozzzzzzzzozzzzzozzzoozozozzoozozzzzzozzzzooozzoozoozooozzozzooozzooozozoozzzoozzzoooozzozozzozoozozozozoooozzoooozoozoooozozooozozozzzooozozozzzzoooooozzoozoozozozzozzoooooozzozzozzoozzozozozozooozzozzzoozzoozzzzoozoozooooozzooozzoozzozzzooooozoozzozozzozzozooozzzozoooozooozzozooozzoozzooooozozoozzooozozzozozzzzzzoooooooozozoozoozzzozozoooozzzozoozozozzozoozzozzozzozozzzoozozooooooooozzzzozzzzzoozzzzozzozzooooozzzzzozzoozzzozooozoozozooozzozoozoozozzzooozozooozoozozooozzzoooozoozozzzoozzzooozozzzzzzozoozoooooozoooozozozzoozoozzoooozozozzzoozozoooooozzzzooozzzzzoozzzoozzoozozzozoozzoozzzozooooozoooozzoozozoozzozozzooozzzzozoooooooozzzozoooozooozozozoozozzoozozzoozozzozoozzozozozzooozoozooozzzzooooozzooooozooozzoozozzzozoozooozzzozzoozzzoozozzoozzzzzzoooozzoozzozzzozooooooozozzozzzozooooozzooozzozzzzzzzzoooozzozozoozzooozooozozozzzzozzzzzzozozzoozzozozzzzzoozzozzozzozooooozozooooozoozozozzooozzzzzoozzozozzooozzzozozzozozoozzzozzzoozzzzoooozozzozoozzooozozozzzozooozozozoozoozzoozzoozozoooozzzzooooooozozooooozoozzozoozozzzzozozooozoozzoooozzzozzooozzozozozozzzzooozozzoozooozzzzozoooooozzooozozozzzozzzooozzozzzozzoozoozzzzozooozozzoooooozzzoozzzzozzozzzozzzozoozzzzzozoooozzozoozozozozozzooozzzzoozzzooozzoozozzooooozzozzzozzoooozooozoooozozzozoozozzozzooooozooozzoooooozozozooooozooozzooozooooozzoozooozooozozzzoozooooozoooozzoozozzoozzzozoozozzzzoozooozzzozozzzzzzzoozoozzozooozzzozozzooozoozoooooozoooozzoozzoozzozzzzzzzzoozozzzozzozzzzzozzozozzzzooozozozzzzzzozozzzzzzozoozooozozoozooozzzzozozoooozozozooozoozoozzozzozzooozzzzzzozzzozozooooozzooozzzozozzzoozoozozozozozzzozoooozozoozozzozzzozzzozoozzzzzoozozoooozoooooozoozzoooozzooozozzzozzoozoozozzzoozzzzoozzzzozzoozzozozozooozoozozoozoozozozzozzzozooozooozoozzoozzoozozozooooozoozzozzzoooozzzozzozzzooozoooozzzzoozzoooozoozzoooooozozzzooooozzzzzzzozzzooozzozzoozzzzzozzzozzzoozoozzzoozozzzooozooooozozoozoozzoooozzzozoooozzzzozzozozoozozoozozzozzooozzzzzozzozzoooozzooozozzoozzzooozooozoozozzzoozzzozzoozzozzzoozzozoozooozozzzozozzzzoozozzzozoozzzzzoozzoozozozozzozzoozzzozoozzzzzzoozozozzooooozzzzzoozzoozzzzozoozzzzooooozozzzozzzozozzozzooozoooozzzozozozzoooozzzzooozzzoooozzozzozzooozoozoozoozzzzozzoozzzooozozzooozzzzozoozzozoozozozzoozzoozzzzoozozzozooozooozzoozzoozozooozozozzooooozzzzzozzzzzoooozozooooozoozzzozoozzozzzzoooozozzozzzozzzozzzzzzozzzooozzozzzzozzozozzzzzzozozzoooozzzoozzzzzozzozozoooozooozoozzoozozooooozzozzozozooooozozozooozzozoozooozozozzozozzoozzoooooozzoozooozzozozooozzozoooozoozozoooozzooozzzozozzozoozzzzozzozozozoozzzzzozozoozozoozzzozzzoooooozzzozzozoozooozzzooozozozzzooozzzooooozzooozzzzzzzoooooozooozzzzooooozoozzzzzzozozzozoozozozozooozzzzooozozzozzzooozozozzooozooozzozzoozoozzozoozzzzzoozooozzoozozzooooozzzzzzzoooozzzozzoozozzzzzozoozzozoozoozozozzozzoozzozzzzooooozzozozzzoozzzzzzzooozzzzzzozooozozoozooooozzzoozozoozzzzzooooozoozoozoozooozozozooozoooozzzzooozzzozozzzzzoooozzzozozozzoozzzozozozoozozoozozozozozzzzoozzooozoozzooozozzozzozoozoozzzozozzozooozozzoozzozzozzozoozzoozozoozzzoozzozzozozooozoozoozzoozozoozooooozozzzzzzzozzooozzzzzooozzooooozzzoooooozoozzzoooozzooozzzozozooozoozooozooozozozzzoozzzzoozzozzozozzzzzooooozoozzzzzzooozoozooozozozzozzozzoozozzoozozzzozooooozzzozzozoooozoozzzzozozooooozzzzzozzzozozzzzzooozzooozoozooozozzozozzozoooooooozozooozoozozzzozozzzzozzzozooozozzozozzzozozoozzoozzozoooozooozzzozzoozzozzzzzzozzzzooooooooooozzzoozoooozzzozzzoozozozzzzoozzoozzooozzzzozooooooooooozozoozzozzzozzzzooozoozzozzozzozzoozzoozzzoozozzzzzozzzozzzooozoozoozzzozzzzozzzozzzzzozoozozozozzzzoozzzoozoozoozzzzoozzoozzzzzzzozooozzzoozozzozzzoozzzzoozzoozozzzoozozzzoooooozzooozzzzzzzozoooozozozozzzoozzzozzoozzoozzzzzozoozzzoozoozzzzooooozzozzzooooozoozzzozooooozzzzzzzzozzozzozzoooooozozozzzoooozoozozzzozozzoozzozozozozzzoozoozooozzozooozzzzzzzzzzzzzzozzzzzoozoozzzozzozozzzoozoooozzozooozozzoozzzzzzoozozozzozozozzzzozzzzoozozzzozozzozzooooozzozzooooozzzoozzozzoooozzzzzozozzzozzzoozzozzzoozozozzzzooozoooozzoooozzzoozoozzzzozzozzozozooozoozzoozozzzzzzoooooooozzzozzozooozozozoozozzzzozozzozzzozzzozzzozzooozoooozoozzzozzzzzzoozzzozozoozozozzzzzzozzzooozooozoooozozzoozozozoozoozoozzozooozoooozoozozzooozzozoozzzozozzoozoozzzoozoozzozzozzoozzoozozzozoozozzooooozoozozzzzozzozzozoooozzzoooooooooooozzoozooozoozoozozozoozzzoozzzzozozozzozozoozzzooozzzozzzzzzzzozozzooozoozoozzzozoozzzoozzozoozzozzoozzooooozzooooozzooooozzzoozozoooooozzozzzoozoooozoooooozzozoozzozoozzoozzzooooozozozzozzzozzoooozzzoozzooooozoozozzozoooooozzozozzzoooozzzzzozzooooozozzzozoozzzzzozozzzozoozzooozzzzozzozozzzoozzozzzzozzzoozoozzoozzzooozzzzozoozzzzzozzzoooozzoozoozzozzzzoozoozzozzozzzzozzzoooozzzoozzozzzozzzozzoozozoozzoooooooozoozzzooozzzozoozoozozzozzzoooozzoozzzzozoozzoozzozozzozozzzoooozzoooooozooozozzozzozoooozooooozzozzzzozooozoozoooozzzzoozzzzozzzzzoozozzzooozoozoozzzooozzooozzozozzoozozzoozoozzoooooooooozzozzzzzzozzzozooooozzoozozozzozoozzozzzzozzzzozzzozzzzoozzzooooozzozzzzzooozozozozzoooozzzzzoooozozzzzoozzzzozooozozozzzozoozzooooozozooozooozzooooozooozooozozooozzzzzzzzzoozozoozzoozzozzozzozzzzooooooozzozzzozzzozozzozooooozzzoozoozzzzzzozzzzozozzzzzozozzoozzoozozzzoooozozzozozozzzzoozozzzoozzzzooozzoozzozzozzzzoozozoozooozzoozooooooooozozzzzzzzoooooozzozoooozozozzozzoooooozooozoozoozzzozzzzzzoozoozzzzzozozooozozozzozzoozozzozoozooozoooozzozozzzzozoozzzooooooooooozzozzzooozoozzozzoozzozoozozooozzzzzzzozozzzozzzozozoozzzzooooozzoozozooozoozzozozozoozoozzzozozoozzozzzozozzoozzzozzzzzzzzozzoozzooooozozoozzoozozzzozzzooooozoozoozzoozooooozozzzoozzzoooozoozzozzzzzoozoozzozozozooozozzoozooozoooozzzozozzozzzzzoozzzozozzzooooozozzozozozzozozooooozozzzzzzooozooooozzzozoozozoooozoozzzzzzzozzooozozooozzooooozzzozoozoozzzoozozzoozoozooooozoozzzooooooooooooooozozozzzozoozzzoozoozozzoozozzozozzoozzoozozozzzoozzzzooozozzzzozzooozzzoooozzozzzzoozzozooozzoozzzzzzzzoozzooozozozoozoooozzozzzoozooozzzoozzzozzozooooozozoooozooozozzozzozzzzoozoozooozozzoooozooozozzzoozzozozoozozoozzzoozozoooozzoozoozzzoozzozozzzozzzoozooozoozzooooooozoozzozooozoozzoozozzoozoooozozzozoooozzzzzoooooozozooozzozzozozzooozzzozozzzzzzzzozzzozzzzzzozzzoooozoozoozzzoozzoozooozzoooozzzozzzzoozzozozoozzzoozzzzoozoooozzoozzzozzzzooozzoozoooozzozozzozzzzzooozoooozozozzzoozzozozoozzozoozoooooozozzzzooooozzzozooozzzzozozzzzzzozozzozoozozzoozzzzooooozozzooozzoooozzozoozzzozzoozoooozzozzozzzzozzzooozzzzzzoozzoozzozzozzozoooozoozzooozozzzzzooozozoooozozoozzozozzzozozzozooooooozzoozzozozzoozzoozoozozozzooozooooozozozozzzozzoozooozozzzoooozoozozzzzzoozozzozzoooozzzozzzzzoozooozooozzooozzzzozozzoozzzzzzzozozozzzzoozooooozzzozzzzozooooozzoozzozzzoooozoozozzozzzzozzoooooozzzozooozozooozooooozoozzzzoozozzzoozooozozzozozzzzzzzooozzzozzzozzozoooozzzozzzzooozoooozzooooooooozoozoozozoozzozoozozozzzzozozozzozozzozoozooooozozzzzzooozzzzzzzzozozzozzzzoooozozozoozzzzzzozzoozooozzzoozzzoozzzzoozozzozzzozooozzzzoozozoozoozzoooozzozzzoozzozozozzzzooooozooozzzzzzoooozoozzzozoozzzozzzzozzzzzzzooozzozozzozozozzoozozzozozozozzoozzozzzozozoooozooozzzoooozzozzzzozzzzzzozoozozoozzoozozzozoozozoozoooozoozzoozoooooooozzozzoooooooooooozzoozzzzzzoozzozzzzoozzzozzoozzzzzzzzozoozoooozzozozzoooozozozzzoozozzzozzoozzooooooozooozzzoozooooozzzzozozzzzozzzozzooozoozozoozoozzozozzozzozozooozoozzozooozozzozzzzooozzzozooozozoooooozoozzozoozzooozzzzoozozzozozzzoozozoozozzoooozoooooozozooozzzozozzzozozozoozzzoozzoozzzzzzoooozozoooooozozozzoozoozooooozozoozoozzozzzooozoozoozzzozzoooozozozzzzzozzzoooozooooozzzzzozzzzozzzzooooozooooooozozzzooozzzzzzozoozzzozzzooozozozzzozoozozooozozzozoozzzozoooooozoozzzozooooozzoozzoozoozozzzzozozozozozzzozzozzzzzzooooozoooooooozzzoozozoozzoozoooozzozzozzzozzozzozzzooozoozzzozooozzzozozooooozozzozzozzzozzzoooozzzoozozzoozooozozoooooozzozoozzzzoozzoozzozoozzoozzzzozzzooozoozozzzzoozoozozozoooozozzzzzzzzozzoozooozzoozzoozzooooozzozzooozzozoozzzoozzzoooozozozoozoooozozozzozooozzzooozozoozozozzzzzzozzozoooozzzozzzzzoozzooooooooozoozzzooozoozzzzozzozooozozozozooozozoozzzoozzoozzzzzozzooozozzoooozoooozooozozozzoozooozzzzozzozzoozozzoooooooozozzzoozozoozzzoozozoozoozzoozzzzzoozoozoooozoozzoozoooozoozzzzzzozoozooozozzoozozzzzzooozzozozozzzozoooozooozzoozozzozozoozozzoozzoozzooozzozooozzzozzozooooozzzozzzoozzozzzoozooooozzzzozooozzzzzzzozoooozooozzzzozzzozozoooozozooozozzzzzozozzzzzozozzzoozozzozzozoooozzzooozoozzzzoozoozoozzooozzoozooozzoooozzoozzoozzzzooozzzzozozozooozzzzooooozozoooozozzzzzozozozozoooozzooozooozzzoooooozzoozzoozozzzzzzzzooooozzzzzozzozzzooozoooooozzzzzzoozozzozzzzoozoozzzoooozooozzooozozozzoozozooozozozzzooooooooozzzzzoozoozzzozooozozozzoooozzoooozzozzozzzozoooozooooozooozzozoozooozoozooooozzzzoooozzzozzooooozzozozzozoozzoozozooozzoooozzozozozzoozzzzooooozzozozozzzzoozzoozzzozoozzzoozzoozzozzoozoozoozzzoozozooozozzozzzozzzoozzzozooozozozzzooozozzoozoozoozzozzozozoozzooozzooooozzoozozoozzzzoozoozoozooooozzzooozzzozzozoozzoozzzozzozzzozozozzooozozoozozzoozozozzzozzzzozozzzzozooozozozzzzozoooozooozzzozozzozzoozozzzozoozoooozoozooozzzoozoozoozzozzoooozzzoooozzooozzoozooozozozzooozooozzzoozzzozozzozzzzzzzoozozzzoozozzzozoozzooooozzoozoozozoozzzozozzozzzozzozzozozzozzzzzzoooozzzzoooozzzzozoozzzozzzooozoooozzzzzozzzozzoozzzooozzoozoooooooozozozozzzzzzzzoozzoozzzoozzozozoooozzzzoozzozzzozzozzoooozzzoozoozzzozzozooozozoooozoozooooozzoozzoooozoozozzzzooooooozzzzoooozoozzoooozoozzoozzzooozozzooooozzzozzoozzoozozozozzzzzzozozzozozzozozzozooozoozzzoozozozzzozzzooozzozzzooozoozzzoozoooooooozoooozozzooozzzzzooozzzozzzozooozzzzzzoozoozozzozozozozozzoozooooozozoozozzoozzozooooozoozozozooooozooozoozooozzozoozozoozzoooozzooozoozooooozzzzoozozooooozoozzooooozzoozzoooozzzozzzozzzoozozzoooozzoozzzzzzzzozzozozzzooozzooozzozzzozoozzoozozzozzzoozzoozozoooozzoooozoooooozozzoooozoozozzozzzzzooozoooozzozozzoozzozozzzzooooooozzozzzozozzzzozozzozzzzzozoozzzoozzzzzzzooozzzzozozzzoozoooooooozzozzzzoozzzooozzzzzozoozzooozzzozozzzoozoozozozozozozozoooooozoooozzozzooozzzzozozozooooozzoozzooooozzzoozozooooooozzzzzooooozoozozzozozozzozzzzoozzoozzozzzozoozzoozzoooooozzzozozzzzzzzooozoozoozzozozzooooozozooozozozoozzzooozzzozozzzzoozzoooozzozooozoooozozzzoooooozzzzozzzoozozzoozoozzzoozzzzzoozozzzozzzozzooozooozzoozozozooozzoooozooozzoozzzzoozzzoooooozzzzozoozzzzozzzzzzzozozzoozzzzzzoozoozooooozzzozozzzozzzozozozozozozzzzooozzozooozzoooooozzoooozooozozzoozzzzozoozoozzozoozozoooozzoozoooozzzozzoozozozoozzzzoozzzozoozozozozzzzzzoozoozzzzzzoozzzzooozozozzzzozoooozoozooozooozozzozzozozoooooozzzzooozzozzozzozozzzzoozozzzozoozzzzoozozozzooozozzooozzzozooozozzzozozozzoozoozzzzoozzzzzzzooozzoozoooooozozzoozoozozzzzzzozzzozzozzzzoooozozozozzzoozzzzzoozzooozzoooooozzozzzooozzzzzzzzozozoozozozozzozzozooozzzzoooozozoozzooozozzozzzozozzooozooozoozzozzozooooozzzozozzzooooooozozzzooooozozzoozozzozooozzoozzozozoozozzzoooozzoozoooozozozoozoooozooooozooozozooozzozozzzzzozzooozoozozzzzzzzozozzoozozzzoozzoooozozzozzzozoozooozozzooozzzzozooozzzooooozzzooozzzzozzzozooooozzzzoooozzzzozoozozozozzozzozozozooozozzzozoozozzzzzzzoozozozzzoozzzozzozzoozoozzozooozzzooozoooozoozozzozozozzooozzzzoozzzozzoozzzzzzoozoozozooooozoooozzozooozzzzzzzoozozozozzzozozozooooooooozzzzozzoozzzzooooooooozooozzzozzzzozozooozoozoozozozoozozzzozozoooozzzzzoozzozoozozzoooozozoozoozzzoozzzzzozozoozzzoozozozozooooooozzozozoozzooozozzoozooozoozzozozozzzzooozozzooooozzzooooooozooozzzzzzzoooooozooooooozoozozzzzoozzzooooooozozozozzzoozooozzzzzoozzzooooozzzoozzoozooozzoooozozoozzoozzozoozoooozooooozozooozoozzzzoozzoozoooozoozooooozoozzozooooozzooozooozozzzzzozzzzzzzzozzzzzzzzozzooozoozoooozoooozzzzzooozooooooozooozzzooozzzzzooozzoooozozoozzzzoozooozzzzoozozooozooozzozozzzozozzozooooozooozozzooozzzozozozoozozoozzozozoooozzozozoozozzzzzzoozzoozozozzoozzozzoozooozzozozzzzozoooozozozzzoozzooozzzzozoooooooozooozoozzzozozzozozooozozozozoozzooooozzoozzzozoozzzooooooozzzooozoooooozoozzzzozzozzzzzzozozzzzooozzzozzzozzooozzoozzzzozzozozzzzzoooooozoozoozozzoozzoozzzzoozzoozozozozoozozoooozozzooozzozozzozozoozozozoozzozozzozzzoozoozzoozozoozzzoozoozzozoozoozzozzozooozozozzzozoooozozzzzozzozzozzzzzozoooozozooozozzozozzozzzozozzoozzooozozooozozzooooozozooooozzzoozzzzzzzozozzzzzooooozzoozzooozzzoozozozzzozzoozozozozzzzzzoozzzozzozzoozzzoozzzzoozzzozozzzzozzoooozzzzzzooooozozoozooozozooozzooozozzzoozzzooozzzzoooozzzzzzooozoooozoozzzzozoozoozzzzzzoozzzzozooozozzooooozzzzzooooozzoozzoozoozzooozzoozooozzzzooozzooozozzoozzzozzooooozoozozzozozoozozzzzzzozoozzoozozozozzzoozzzoooooozzoozozoozoooozzoooozoozzzzooozzzzozoozoozoozzzozozzzzooozzoozoozzozozzoozozoozzzoozoozozzozzozoooooooozoozozzozozzzzzozoooozozozooooozoozozzoozooozzzzoozozozzooozozzzzzozozozozzozoozoozzozzzozzozzzozozzozozozzoooozzoozoozzzzozoozzzzzozooozooozozzzooooozooooozzoozozooozoozozoozzzoozooozzzooozozzozoozzozozozzooozoozozozzzozozzzozzoooozzzzzzzooozozoozoozozoozoooozozozzoozoozzozoozzzoooozoozzzzooozzzzzzzozzozoozozozozzzzzzzzoozzzozzozzzzoozoozzozzzzoozzooozzzoozoozzozzozzzzoozzooozoozzozzzzozzzzzzozzozzzzoozzzooozzooozzzzzzzoozoozoozozzoozooooozzozoozzzoozzzzzzozzozzozoozzzoooozzzoozozzzzoooozooooozoozzzzzoooozzzooooozooozoozzzzzzozzozoooooozozzzoozooozoozooozozozoozzzzozzzoooozozzzozozooooozozoooozoozzzozzoooozozzoozoozzooozoozooozzozzzozzozzoooooooozzzozzzozzoooozoozzzzozozzoozzozozzoozzzooooozzoozzzzooozzooozzoooozzzzozozoozozzozoozozoozozoozzozzzoozoozzozoozozozozooozzoozoozoozzooooooozzozzzzzzzozozozoozzoozzozooozzzzzzozoozozzoozzzzzzzooozzozoozoozozoozooozzzzozzzzzzoooozzzozoozoozzoozozzooooozozzzzozozzozoozozooooozozooozzoozoozozzozzoozozoozooozooozzoozzzzozzozozozzzozooozzozzoooooooozoozoozoooozooozooozozzzzzzozzooozoozzzozozozooozozzoooozoozozoozoozozzzooozzoozozozzooozzzzooooooozooozzzoozozzoooozzzzozzooozzzozoooozzzzzzozozzzzzozzoozoozzzzooooozzzozzzzoozoooozzooozzozoozzzzzooozzzooooozozzoozooozozzozzoozozozzoozzzzooozzzoooozozozzzozoozzzozozzoozzooozoozozooozozzooozooozoozzzozozoozoooooozozozzzzoozozzzozoozzzozzzzozzzozoozozzzoozzoozoozoozozozozzooozooooozozzzzzozozozoooozzozzoozozozoozoozoozzozozoozozozozozzooozozzoozoozoozozozoozzoozoozooooozoooozoozoooooooooooooozozzzozoozzooozoooozzzzzzzzozozzoozzoooozoozoozozzoozoozzzozozzozozzzozzozzzzzzoooozozzoozzoozzzozzzzzozzoozzozozoozozooooozozoozooozzzoooozzzoozozzoooozooooozozzzzzozzozzzzzozzoozoooozzoooozooooozzzzozzozoooozzzzzozzooozzzozozzozzoozozoozzzoozzzoozzoozooozoozzooozooozzozzzoooozzozzoooozzoozoozozzzoozoooozzozoozzozozooooozzoozozozoooozzoozozzozzozzozzzozzzzozzzzzzzzozoozoozzzzzzzoozozozzoozozzzozzozoozoozoooozzzoozzzzooooozozzoozzzozooooooooooooooozoozoozzozzzzoooooooooozozzoooooozozoozoozoozzozooozozzzzozozozzzzzzzoozzzoooozzzzzozozoozozzozzooozzzoozoozzzzozoozoooozzoooozzzzzzoozoozozoozooozzzoozzzzzzzzozzoozzzoozoozoozozozozzozzzooozozoozzzooozzoooozozozozzozzooozozzzzoooozooozoozzozozzozzzozooozozozzooozoozoozozzzoozzzzozooooooozozzooozoozoooozooooozzoozoooozzzozzzzzooozzzzooozzooozzzzzzoozozzzooozzzzozozzooozzozozzzzooozzzooozzzozzoozzzzzzoooozoozzzzoozzzoooozoooozzoozooozozoozoooooozozzzzozozozzzoozooozzzzozooozzzzzoozzzzozzozzzozooozozzoozzoooozooozzzozzozzoooooozzzzzzooooozoozzozzozzzoozzzzozoozozzozoooozzzzzzzzooozzzzozozozzzzozzzoozoozozoooozozzzzozzzzzooozzooozzzoozzzzozzozzozzzozooozozzoooooozzzozoozoozzzzzzoozzooozooozzooooozozooozozzooooooozozozoozzozzzzzozzzzzzzzozozzzozzozooozzoozozzozzzozozzzzzzoozzozoooooozooozzzooooooozzzzozzzzozozoozozoozzoooooozzoozoozzozoozzzozzozzozozoooozzozzoozoooozozozozoozzzzzooozzozozzoozozozzzoozzzzzzzozzozoooozzozozzozzozozozzzzzzozozozzozoooozzozozooozzozozoozzozzooozozzzzzozzozzooozoozozzozzozzzzozzozzoozzzozzoozoozoooozzzoozoooooozzozooozozooooozoozzzozoozzoozzzozooozozooozzzoozzozozozooozooozoooooooooozozozozzzzzozozzoozzozzzooozozzzozoooozoozoozzooozozozoozoozoozozoozzzzoozooozozzozoozozozzzzooozozzozozoozooooozooooozzzzozooozozzozoozoozooozoooozzzzzoozzzozzozoozzzzzooooozozozzoozzoooooozzoozzzozzozozzzoooooozoozozozoozozooozoozzozoozzzozozozooozooozzoozzzooooooozzoooooooozzzozozoozzzozoooozzozzozozozzoozoozzozozooozzozooozzzzzzooozoooozzoozzzzzozzzozzoozzzzzooozoooozzzzoozozozzzooozzzzozzzoozoozozzzoozzzzzzzzzooozozozzzzoozzozzzzzoozooozzozzzzoozozzzoozzoozzooozzooozozzozozoozzoooozzzoozzozooozoooooozzooozozzzzozoooozzooozozoooozozozzzozzzzooooozzzozzzzzoozzoozzoozozoooozzozoozzzzozozzozzoozozozooooozozoozoooozzozzzozzozzozoooozooozzoooooooozzzozooozooozzzooozozzoozozzoozoozozzozzzoozoozozozoooozooozozzzzzzzzzozzoozoooozoozzozzozzozoozozzozoooozozooozozzozozzozooozzozozzozzozoozozooooozozozoozoozozzzzozzzzozzzzzzozzzoozzzoozozoozoozzozzzzoozzoozoooozzooozzzzoooooozzzzozozoozozzoozzzzzzzzozzoozozzzzozzoozzzozooozozzoozozzzoozoozoozozooozozzoooozozzzzzooozzoozzooozzooooozoooooozzzzzooozzzzzoozzzzozozoozoozzzzooooozozoooozozzzzzzoozozzzoooozozoozoozoozoooooozzozzozzzzzzzzzzozzoooozzzoozozozozooozooooozzzzzzzoozozzoozzzzozozozzozzozoozozooozoooozoozozozozzzoozzoozoozooozzzzzoozozzzzozzozoozzzzooozzzoozoooozzozzzoooooozooooozzoozzozoooozooozzooooozzoooooozzzozooozzozzoozzooozozzozzzzooozzozozzoozozozoozzzzooooozooozozozozzozooooozzozoozzzoozozozoozzoozozzoooozoozzzoozzozooozzzzzooozzzozooozozozozzoozoozooooozozzzozzozozozzooozzzzzoozoozozzzoozzzzzozoozzozozooozzzoooozoozoozoozozzzzzozoozoozzooozozoozoooozozzozzoozzzooozzoozozozozoooozozzzzzzozzoooooooozooozzzzzzoooozzzoozozoooozoooooozozoooozzozzzoooooozzozooozzzozozzzzoooozzzozzooozooozzzoozozozoozozzzozzzoozozozoozozzozzozzzoooozzzoozoooozozzzoozooozzzoozoozzozoozozzzzzzoozozzzzooooozzozzoozozozzoozzzooozzzozozzzzozzoozzzooozzoozozozoozzzzzooozzzzzzzzozzooozzzzozzozozooooozzzzoozozooozzozzoooozzzoooozzzzozzozooozozozzozooozzoozzzzozzozozozzzzozzzozzozzozzzzozooozzzozozozooooooozzzzzoozzooozozzzozzzozzoozzozoooozozzzzozozzozzooozzozozozooozzzoozzzzzzozzoozzzozzozooozzozzzoozzooooozozooozzzooozozozozooozzzzozzozzoozzzzzzoozzozzzzzzozoozzozzozzoooozzozoozozzzoozoozzooozozzozozoozoozozooozzooozzozoozozozoooozozzooozozzoozoozozooozozoozoozzzzozoooozzooozzooozzooozzzzzzoozzozozzoozoozozzzzzzozzzzooooozoozzoozzozzzoooooooooozoozzzzzzzozooooooozzzozozzzoooozzzzoooozooooooozzzozooozoooozzzzozzoozzzoozzzoozooooozzozzzozzzozzooozzzzzzzzozoozzzoozzzzzzoooozzzoozzzzozoozoooooozzzozzzzoozzzooozozzzzzoozzooozzzzzozzoozoozzzzooozozozozzzooozzoooozzoooooooozzzzozooozooozzoozzozooozzzoooozzooozzzzzzzzooooozzoozzzozozoozozzzzooozoozzzzzzozozzzoozzoooooozzzzzozozzzzzooozoozzooozzozzoooozzozooozozoooozozooozzzzzozozoozzzzzoozzozozooozozzozzzzoozzoozozozzzoozoozoooooozzzozozzzoozoozozzzoozoozozooozzoozooozoozozozzoooozzzoooozzzozzzoozozoozzzzzozzzzzoozzzzzzozozzzzzzzozzzozzozzzoooozzooozzzzzzoozooozzzozozzzzooozzozozozooooooooozooooooozzzoooozzoozooooozzzzoozozooooozoozoooozozzzozozozozooozzzoozzzozoooozozozoozzzoozozozzozzoooozoozzzzozzzozooooooooozozozoozzozzozozzzzooozzozzozooozzzzzzzoooozzozoooozzzoooozzozoozozozzozozzzzzooozoozoozzozozozooozzozzoozozooozzzzzzzzooozoooozooozzozzozzoozozzzzzzzzooozzozzzzozoooozzzozzzoozzzzzzoozoooozooooooooozzzooozzzzozzozzozzzzozooozzzzozoooozzzozooozozzozzooozozzozzzozoozozzozozzzozzozzozozoozzzzozzozzozzooooozozzooooozoozozzozzoozozozzozzozozoozozzzzozozzoozoozozzzozzzzzooozooooozzzozozoooozozzzzoozozzooozoozozzzzozzozozzzozozzzooozoooozoooozoooozozzoozoozzoozzzoozozzzzozozoooozooozoooozzzozzoozzzzzzooozzzozozoooozoooozozzooooooooozzozzozzzooozzzzozooozzozzzozozzozzoozzzzzoooozooozzzooozoooozoooozzzzozzozoooozzzoozozzzzooozooooozozozozoozoozooooooozozozzzozozoozzzoozzzoozzzozooooozooozzozozzozzzzzooozoozoozozoozoozzooozozooooooooozozozooooozoozzoooooozzozoozoozozoozzooozzoooozzozzzooozozzzzozooozzoozzzozooooooozozozzozzozzoooooozzoozoozoozzozozozozoooozozzzoooozzzooooooozozozozzzzzoooozozzozoozozoozzzzzzoozzzoozzozzzozooooozoozzozzozzooozzzozzoozzzoozzozozoozzzozzzozzzzzooozozozzoooozooooozozooozzozzoozozzoozoozozooooozzozoozzoooooooozzoozooozozozozzzzzzzzzzozozozzzoozzooozoozoooozooozzozzzooozzoozooooooozzzooozozzzzzzozzooozoooozzzzoooooozozzzzzzzoooooozozozoozzooozzozzooozoooozzzzooooozozzzozoozozooozozzzoooozzozozzozozzzzzooozzoozozozzozzzozzzooooozooozoozzzooooooozzzzzozzzoozozzoozoooooooozooozoozzooooozozozoozzozozzooozoooooozzozzzzozoozozooooooozzozozzooooooooozzzzozzozoooozoozzozooozzozozzzozzzozzzzzozzozzzozoozozzooooozzoozozzzozzozzooozzzzzzzoozozooozozooooooozoozzzzzzooozoooozzozzzoooozozzozzoozzoozzzzooozooozzzozzzozzzozoozoozozooozooozozozzoozoooozozzzzozoozzozozzzozooooozzooozozzzzzzzozzzzzzzzoozzzozoooooozozzoooozzozooooozozooozozzzzozozzzzoooozzzzooozooozzzoooozozzzoozoozzzozzzzozozzozzzozzozzozzzzozzzzzoozzzoooozzzozzoozzzzozozozzzozoozozozooozooozooooooozzoozozooozzzzooozzzzzooooooozoooozzzzzoozozoozzzzzooozzzzoooozzozoozoooooozoooozozzzozooozozozzzozzoozoozzozooooozooozozzoozoooozozzoozoozozoozozoozoozzzzzoozozzoozooozoozzoozzzzozooozzoozoooozoooozzoooozooozzoozzzzzzozzzzoozozzzzozozzozzoozzozooozzozoozzozzzoooozzozzozzzozzzzzoooooozzzoozozzoozzzzozozoooooozozzoooozoozozzzzozozzzzozooozozzooozzzozozozozooozzozozzoozzzzzzzzzozzoozoozozozozzooozzooozozzzzzzzooozzzzzoooozozzzozzzoooooooozzozzoozzzooozoozzzoozzozozooozozzoozzzzozzozoooozozzooooozzozozzzooozzooozzzoozozzzozzzzzozzozzooozozzzooozoozzzoozzoozoooozzzzzoozzozozzzoozzzzzozoozzzzooozzzozzozozzooooozozoozzzzzozoozzzzzzzooozoooozzozoooozozzoozozzozzozozzoozoozzzozzzzzozzoooozozozozzozooooozzzzzzzoozoozozoozzzoozozoozzzoozzzzoozzzzzzozzozoozoooozzoozzzzzooozzzzzoozzoozooooozzzozoozzzozoozzoozozzzozzozzzzzzzzzozozozzzzzoooozoozzzzozzoooooozozzozoooozozozzzzzozzooozzozzozozzozozozzoozzzoozooooooozzozoozzzozozozzoooozzoooozoozoozozzozzzoozzooozzzzooooozozozzoozoozzzozzooozzozzoozzoozooozzoooozozzozozoozzzoozoozozoozzzzozzzzzzoozzoozozzozzzzzozzoozzoozooozozzoooooozzzoooooozzozozoozooozozzozoooozzzzzozozzozoozzozzozzooozooooozoooozzozooozozzozzzzzzoooozoozzoozozzoooooooozozzoozozooozzzozooozzoozoooooooozozozoozozoozzzozooozzooozooozzoozzzzozoooozozzzzzooozzozzozzzozoozoozoozzozozozozzoozoooozzzozzooozoozzoozozooooozzozoozooooooooozzozzzzoozzzzozzzzozzoozzzooozoooozzooozozoozozzoooozzzoozzooozzoozzooozzzozzoooozzzzozzozzoozoozzozzooozoozzzzozzooozzooozzzzzzzzzzzooozzozoooozozzooooozzozzoooozzozozzzozzzzzoozzzoooozozozozozoozozooozzoozzoozzoozozozzzozzzoozozozoooozozozzzzooooozoozzzzoooooozzzozozozzozzzzzzzzozozzozzzoozoozzoooooozoozozzzoozzoozooozzozzozozozzooozzozzoozozozzozoooooozozoooozzzozzzoozozozoozoozoozoooooozoozooozoozozzoozzzooozozozzoooooooozozzoozzozozozozozozoozozzzzozzzoozoozzoooozoozozzozzoozoozozozzozozzzzoozzozzzzzzoozooozzozozoozozozoozzozzoozzozoooozozoooozzooozzooozzoozoozzzozzozzozoozoozoozozzzzzozooooozzzzzzozozoozzoooooozzooozzzozooozoozzzzzzozzooozzzozozoozozooozozzozoooozoooozooooozoozzzozzozozzzzzzoozozzozzozoozooozoozzzzzoozzzooozozoozzozozoozzozozozoooooozzzoozzzzoozzoozozozoozzzozzoozzzzozoozoozzzzzzzzozozozozzzozozozzozzozooozozozozozzozzzoozozooooozooozoooozooooooozzoooozoozzozzzzozooooooozoozoozoooozzzzozozzzoozozzzozzzzozozozozzzzzzzzozooooooooozzozzoooozzzozzozozozzozooozzzzzzoooozzzzzoozzzozzozoooozooozoooozzzzozzzzzzzzozzooozzooooozoozozozozzozzzozooozoozzzzoozzooozzozozozzozzooozozzzoozzozooozozzzozozoozzzozoozzzoooozzoooozoozzzzzooozzzozoooozoozozzzzozoozoooooozzozzzzooozooozzozzzzoooozzzzzzzzoooooozzzzoozozzzooozzzozoozoooozzozozzzoozooozoozzzzzooooozzzzzoooozozzzzzoozozzooozozozozozzzzoooooozoooozzzozozzozoozzzzoozooozzzzozzoozzzzzzzzzozozzozozozoozzozzzozoozozoozozzoozzzzzoozozozzzzzzzzooozooozozzozozoozzozzzzozoozoooooozozzzozoooozzooozooozzooozzzozzozoozoooozooozzozzzzzoooozoozooozzozzzozzozzozzzzzooozozoozooozzzzozoozooozzzoooooooozozoooozoooozzzooozozozoooooozooooooozozzoozoozzozzozozozzozzzooooozzzooooozzzzzoozozzzoooozoozoozoooozozooooooooozozooozzoooozozzooozzzzooooozoooooozzozzozzzozzozzzzzzozzoooozzoozzooozozozoooooozozooozzzzozoozzoooozzooozzzozzzzzozozzozoozozzozzozozozzzzzzzzozozzozoooozzzzooooozzozzzozzzozzoozzzoozzzozozzzoozzzzooozzzzozzzooozzzzzozzzzzzoozooozooozozoozooooooozozooozzzozooozoozzzoozzozoozzzooozozoooozzozzzzzozozzzoozzzozzzooooooozozozzzozozzzzoozzzozzozzzzoozozzzozzooozzzzoozzzozzozozoozzozozoozozozzzoozooozozzozzooozozzzzozozozoozozooooooozzoozoozzzoozoooozozozozzzzoooozoooozzzzzzzzzzozzzooozzozzoozoozozooooozzoooooozozozzzzzzozozzzozzzoozoozozozozzozooozooozzzoozzzozozooooozooozzzozozooooozoozooooozzozzzzzozoozozozozoozozozozozozoooooozzozzoozoozooooozzzzozooozzoooozoozzzzzozzoozzzozozzzooozoooozzzzzozozoozzoooozoozzzzooooooozozzzozzzzoozzzzozoooozooozozzzzozzzozzozzzozzozoooozzooozzoozzozoozooozoozooozooozoozozzozoooozoooooooooozzozozzozzzozzooozozoooozozoozozoozoozzozozzzozozooozooooozozzzzozozozoozzozoozzzoozooozozozzzzozoooozooozozoozzzzozooozzozzozoozooozzzzoozooozoozzzzozozozozzoooooozzzozozzozzzozozzozozooozozoooozoozozzozzzozzzozzzozozozozzzooozzzzzozzooooooozozoozozozoozzozzozozzoooozzzozozzoozzzozzozzoooozzzozozooozzozzzozzzzozzzzzzozzzozzzzoozzzzozzzzzozzzzzozzzozoooozzoozzzzzzozzoozzzoozozoozzzzooozzozzzoozzoozozzzzozzozzzzozoooooozoozozzzozzoozzozozooozozzoooozozzzzzzoozzoozozzoozoooozzoozzoozozzooozzoozzzozoozozoooozzozzzooozzozooozzzozzozzzzozozzzozooozozzzzzozoooozzoozzzozzozzzzzzzozzozzzozoozzoozooozozoooozooozzzzzzozoozoozzozozzozzzozzozzozozzoooooozooozzozozozozzozoozoozozzzooozozzoozzzzzoozzzzoozzozooozzozozoooozzozoozooooozoozzzzzozzozooooozooozozoozzzzoozoooozozzozozzoozoozzozozoozozozozozzzzzozoooooooooozzoooozoozoozzzzzooozozoozzozzoozzzzzoozozozoozozozzzzoooozozzzzzozzzzozozzzozozzzzoozozozozooozzozoooooooozzzzozozzozozozzooozozzzoozoozzzzzoozoozzzzzozzozzzooozzzzooooozzooozzzozzozzozozzoozzooozozozzoooozzozzzooozzoooozooozzzooozozozzzzzzzozozzzzooozzozooozzozozzzoozzzzozoozooozozooozoozzooozzzzzoooozzozzoozozzzzozooozzozoozzozzzzzzzoozoozoooozzoooozzozoooozzzzoozzoozooozozzzzzzoozoooooooozzozzoozzzoozoooozoozzzzooozozozzooozzozzzooozoooozooozozozzoozzoooozooozozzzoozzooozzozzzzozzozzzzozzozozoozzzzzzooozoooozzzzozoozozzoooozzzzooozzoozzzozzzozoozzozoozozzozzzzooozzozzzozooozzozzzzzzozzzozozzzzoozozzzozzozzzzozzoozzzozozozooooozozzzzzoozooozzoozoooozozzooozozoooozozzzzozozzozzoooozzozzzzooozzzzozozooozoooozzoozoozooozzozzzooozoozoozozozzzzzooozooooozoozzzozoozzozooooozzzzozzoozozzzozoozzozzzzzoooozzoooozzozzoozoozzoozzozooozzozzzzzozzoozzzoozozozzzzoozooozzzzooozzozzoozzozozozozozozzoozzzzozozozzozzozzooozzozooozzzzozzzozozzoozoozoozzzzzzzzzzooooozoozzoozzoozooooooozzozzoozzzzzooozoooooozozzozozzzoozzzzozzzoozzoozooozzzooozozoooooozzozoooozzoozooozzzoooozooozozozzoozooozzzzzzzoozoozzzoozzzzzzooozzozozozzzozzozooozoozzzzzzoooozozooozozozzzozozooozozzoozzozzozzzzozoozzzoozzzzzzozzoooooooooooooozzzzooooozoozzzozzzozooozzzzoozzzooozzzozzoozoozzzzoozzzozozooozzoozoooooozozzzzzoozzoozzzoooozozzzzzozoozzozzoozooozooozzoozzooozzzzozzzzzoooozozoozozozoozozozzzozzzozzozzzoozzozozzzozozzzoozozozzzoozoozoooooozzzzoozzzzoooozozooozooozzozooozozzzooozozozzzzzooozzzzooozzzozzzzozzzoozzozzozozzzoozzzzzzoozzzzzzzzozozoozoozzzzoozzzozzzzzzooozoozzzozzozzzzoooooozozzzozooooooozoooozozozzoooozooooozoooozzzozoooooozozozozozozoozoozozoozoozoozooozzozzzooozozzoooozzzooozozzozooooozozzzzzozozozooooooooooozozozzzzozozozozoooozzozoozzoozzzzzzzozoozoozzzozzozzozzzoozzoozzoooozozzzozzzozoozozzoozozozooozzozooozooooozzzzozzzozozoooozzoozzozoozzooooozzzzzzooooozozzozozzoozzzzzzzzzzzzzzzzooooooozzzzzozoozzooooozzoooozozzozzzzozooozozoozozoozzzozozoozzzozoozooozoozzzozoozozzozzzozoooozozzozoozozzoozozzozzzzooozozzooooozoozzzozzzoozozoozzoozzozozzozzozozozzoooozzozzzzzzzzzzozoozzzozzzoooozoooooozzzoozozooozzoozoozzoozzooozozozzoozzoooooozzzooozoozozzzzzoooozzoozozoozzzzzzozozozoozozozoooozzzzzzoozzzozoooozzzozozoooozzoooooozzozooozoozzozzozzzoooozzzozooozooozzozozzooooozzzozzoozoooozzoooozozoozooozoozzzzzozooooozzzzoozzooozozooooozozzoozoozozzozoooozzozozozozozzzzzzoozzzoozzzooooooozzzoozozozzzzzozozzozzzzzooozoozozzzooozzzozzoooozozozozooooozozzzozozzozzozzzooozozooooozozzooozzzozozozozozozzzoozozooozzozzooooooozozozzzozzzoozzozozzoozozzoozoozooozozooooozozzooozzzzooooozozzzozozzozooooozozzozoozzooozzzozzzozzzzozzozzozzoooooooozzozoozoozozzzozzozzooozzzzzozoozozzzzzozzzzzooozozozooooozoozooooozooozozooozzzzoozoozooooozzzzoozzoooooozzoozzozzzozzozozozzozzzozozzzozoozzozzzooozozzoooozooozzoozozozzzzzzzooooozzzoooooooozzzzozzooozoozozozoozozoozozzzzzzzzooooozozoozoozoozzoozzooozozzzzzozzozoozozzoozoozozozozozzzzzzozzooozzoozozozzozozooozzzzzzzzzzozozooozozooozoozzzooozoooozzzoozzzozzozzozzoooozozzzooozoozoooooozozooozzzzzozzoozzozoooozozzzzozzooooooozooozozozozzozozzooozzzozoozozoooozzozzozooozzozozzooozzozzozzoooozzoozoozozoooooozzoozozozoozoozozoooozzzozzzozoozzozooozzozzzoozzzooooozooozzzozzzoooozozzoozooozooozzoooozooozzzozzzozzzoooozzzoozooozozozozooooooozzzzozoooooooooozozzozzoozzozzzoozzzzzozzzzzzozzzozozzzzozozozoooozzozoozzozzooozoooooozoozozoooooooozzozzozozoozoozozooozzzzozzozoozzzozzooozozzzzzzzzzoozozozzozozzzzoozooooozoozzoozzzzzozooozzzzooozooozooozozooooooozoozoooozooozoozozozzzozooooooozzzoozzzzzoozozzzzozozoozoozzzooozoozoozoooooozoozzzzzzzozooozozozzzozzzozzozoozooozoozooooooozoooooozzzoozzooozooozzoozoozzzzzoozozzozzooozoozzooozzzozooozzzooooozzozozozoooozzooozoozzzzzzoozzzoozozzzoooozoozzoozzzzoozooozzozzoozooooozzozzoozzozzzzooooozozzooozoozoozozzoozozzzooozozzzzzozzzzozzzzozozzzzozoozzzozooozzzozozoozzzoozozozzooozzzoozzzzozooozoozoozzzozzoozzoozozzooozzzozozzzzzoozzoozzzozzooooozoozzzzzooozzzzozzozzzzozooozoozoozozzoozzozzzzoooooozoozoooozzzozozzzoozozooozzzzzooozzozzzzzoozozzoooozzzzzzoooozzooozzzooooozzozzzzzozozozzzzozozozozoozzozooozzzoozozoozozooozzoooozoozozozzzzzozzooooozzoooozoooooozozozozzzzzozzzzzozooozzzzzzzoozzozoooozozozzzzooooozozzzozooooooozooozzoozozzozzzozzozooozozozzozzozoozozoozzozzoozzooozzzzzoozzoozoooooozzoooozzzozzzzzoozzzzzozzozzozzzzzzozozoozzozozoozzozzzzzzzoooozzoozzzzoooozzzzzzzzzzzzzoozzoozozozzozoozozoozzzzozzzozzoozzzzoozzzozozoozooozzoozoozzzzoozzzzozoozozzoozzooozoooozozozzooozzzozzzzooozzoozoozzzozooozzozozzoooooozzozzooozoozooozozzzozzzoozoozzoozozzzozzzzoozzozoozzooozozzzozozozzzoooooozzozzzzozooozozzozoooozzzzoozzzzzzoozooozoozoozoozozzzooooozzzozozozzozoooozooooooozzzozzzooozooooozozzozoozozozzzozozozooozooooozozzozoooozozooozzozzoozzzozooooozzzzzzzzzoooozozozzzooozoozoozzzozozoozzozzzzzzozzzozoozzooozooozzooozoozoooozoooozzozozoozooozozooozzzozzzozzzzzozozzooozozzoooozozozzzzzooozoozozzoozoozoozzzooozzozozzooozooozzozozzzoozzozzzooooozozzooozoozozzoozooozooozzzzzzzozzzzzoozoozooozoooozzooozooozoooozoozozzzozzzzzoozzoooozzozzoozozoozozooozzozzozozzzozozozzooozzoozozoozooozozozzzzooozozozzzozooozoozzoozzzozozzzoozzzzozzzoozzozooozzzzoozoozoooozzzozozzzzzozozoooozzzozzoozzzozoozzozzzzozzooooooozooozzzzozzzoozzzozzozooooozoooooozozoozozooozzzoozzzooozzzzzzozzzozzozozooozzzzozozozozozoooozzozozzooozooozzoozzzozozzoozozzoozoooozooozzozozzzozzzoozozzoozozzzozoooozozooozooozzzzoooozzzozzooozzooozoooozoozzoozzoozzzzzozooozozoozozzzzozoozooozzzozzozzzozozoozzoozzooooozooozozozzzzzzzozozzozozozozozzozzoozozzozooooozooozoozzzzozozzozzozzzzzzozozzozzozozzoozooozzzzzozoozozzoooooooozzzzoooozzooozozzozooozzzoozozzoozooozozozzoozzoozooozzzzooozozozozzoozzzozzzozzzzzooooooozozooozozooooozzozzzzozozooozooooooooozzzoozzozzzzoozozozzooozoozzooozzozozzoozoooozzzzooozozzozozzzzzzzzozozzzooozzzzzzozoozooooooozoozoooozzoozoozozoozzzooozzozzzooozzzozzozzzoozzozoooozooozoozozzzzoozzzzozzozozooozooozozzoooozzzzzzzzzzzoozzoozzzzzozzzzzzzozozoozozooozzzozzozzzzzozozozozzzozozzozozoozozoooozzzozozoozzozooooozzozoooozooooozzzzzozozooooozzozoozooozooozzzozzzoozozzzozzzzozooooozzzoooozzoooozzzozooooooozzozozzzoozooozoozzzzzoozzoozozzzzoozzzozzzoozoozoozzzzozooozzzzzozoozzoozozzzozoooozzozzzozzzzozzzzozzzoozoozzzzzzoozzoozozzozozzozzzoooozzzozzozzoozzzzzozzozozzzozzzzooooooozozzozozoozzozzzzozoozoooooozozooooozzzzoooooooozzoozozzozzozoozooozoooozoozzzzzozzooozzooozzooozzzozozzoozzzozzzooozzozozzzzozozzozoozooozzoooozozoooozzoooozzzoooozozzooozoooozozzozozzoozoozoozzozozozzozzoooooooozooooozzzozozzozzooooozoozozzozozzzzooozooooozoooooozooooozzozoozoozooooozozoooozzozzozzzzoozzzzzzzzzzooooozoozzzozzzzozoozooozooozzoozooooozzoooozzzoozozoozzzzzozzzzzoozooozzzozozzzoozzzzzoooozzzoooozzzzzozzzzzozzoozzzzzooozzzooozzozozooozzozzozozzzzoozzozoozozzozozzzzozoozozooozozzooooooooooozzoozzoozzzzzozzoozozzozzozzzooozozoozozzoozzozozoozooozzzozzzoozooozzzoozzzzzozzzzoozzzozoozozzzoooozozzzoozzzzzzozozozzozozzozzzzzzozoozozzoozzoozzzzzzzzooooozzzzozozozoooozzoooozzzoozzzoozzoozoooozooooozzzzooozzzzoozzzozzzzozozozooozzozzoozzzozooooozozoozozozozozzzzzzozzozzozzzozzoooooozozzozzoooozozzzzoozzoooozozoozoooozzozozooozozzozzzooozzoozzzzooozoozzozzoooozozooozooozoozozozzzoozooooozzzozzzozozzzzoooozoozzzzzoozoozzzooozzozoozzooozozzzozozoozzooooooozzzozooozozzozzzozoozoozzzzozzooozoozzozzozozozozzozzoozzoooooozzozzzooozoozzozooozzozooozzoozzozzozozzooozoozooooozzozzzzozozzzzozozozozzooozzzooozoooooozoozozzzooooooozooooozozzzzzzzzozzozzzzoozzzoozzoozozozozooooozozozozzooozzzzzzoooozzzoozzozooozzzozzzzoozzozozzozzzzzzozooooozozzzozzoozzzozzzzzoozzoozozoooozzozozzozzoozzzoozzzzozozzzzzozozozzoozzzoozooozoozozooozoozoozzozoozoooozoozzzzzooozzozzzzzzooozzoozozozozzozozozzozozzzzzzozzzozzzoooozozozzzooozozozooozooozzozzzozooozzozzoozzzoozozozzzzzooozzozzzoozzozzozzzozzzozzozozzoooooooozooooozooozzozozoozzozooooozoooozzzoozzozzozzzoozoozzzoozzzozozzooozzooozzzzoozozoozozzozozozozzzzoozzzzozzozzzzozozzzozozooozzzozozoooozzzzzzoozzozzozozoozoozzzzzzoozoozoozzoozozozozozzzoozooozzoozzoooozzozzozzzzzoozzzoozzoozooozzzzzozzoozozoozoozozzzooozozzzmozzzoozozzzoozzoozzzzzozozzoozzzozoozozoooooozzzzzzzzozozzozzooozozozzzzooozozzozozoozozzoozoozoozozooozzozozzzzzzzzzoooozooooozzoooozoozoozzzzzooooozoozzooozozzzozzozozzzoozozzozzozooozzzozozzzozzozozzzooozzzzozzozooozzooozzzozoooooozozzozzzzzzozzzzozozoozzozzoozzzzozozooozzozozzzzzzoooozzzooooozzooozzoozzozoozozzoozzooozozzzzzozzzzoozzozozzoozozoozzzoooozozzzzzzzzooozozzzzozzzozozozzozoozzozoozzozoozozzoozozozoozzzozzozzzoooozzzzzoozzzzzozzzoozzozooozozzozzzooozoozzooozzozoozzoooooozzzzoozzoozooozozzzzzzzozoozooozozzzzzoozzzoozoooooooozzzzoozozozzoozzzozzzozozoooozoooooozozoozzoozozooooozzoozoozoozozzzzzozozzzzzozzozozoozzzooooozzoozozoozzzooozozoozozozzooozooozzoooozzzzozoozozzoozzzozozooozozzzozozozzozzoozzoozzozozzzzoooozzzzzzzozozzzzzozzoozozzozoooozozozzzozzoozzzzooozoozzzoozozozozoooozzzozoozzozzzoooozozzzzzzoozzzozozooozooozzzoozooozoozzozzoooozozzzozoozzzzzzooozzoooozoozooozooozozzooooozozzzzoozozzozozozozoozzzoooozzooozzzoozzozoozzzzzoozooozoozzzzozzzozzzzozoozozzozoozoozzzzzozzzoozzzzzzozozozzzzzozzzoozzzozzzzzoozzozzzozzzozooozzozzzzzozzzzoozzozoozzooozozzozoooozzozzzooozozooooooozzozzoozozzzooozozoozzzozzozzzzzzozzzzoozzoozzoozoooooooozzozooozoozooooozoozozoooozzzozozoooooozozoooooozozzozzzozozzozzzoooozozozzzzozozozzzozzozzoozoozoozzzoooooozooozozozzzzzoozzzooozozooozzozzozozozozooozozzzzozozzozoozooozooozozzooooozzozozzzzozzzzzzozzoozzzzoozzzozooozoozzozzozooozzoooozzoooozoozzoozozozozzzozzozozzozzozozoozooozozzzozzzozzoozzoozzozozozzzzzozzoozooozzzzooozoozooozzzozzzzoooozzoozzzzozzoozzzzzzozooozzzzzooooooozooozzzoozoozzooooozooozooozzozzooozzozooozzzozzzzzozozzozzoozzzzooozozzzzoooozoozozozzozozzozoozoozzzooooozoozoozzzzoozzzozoozzooozzzozzzozzozooozzooozoozzoozooozzoozozzozzzozooozozoooozzozooozozzooooozzoozzozozozoozoozzooozozzoooooozzozozoozzzzzooooozzoozzoooozozzoooozzzzzozooozooozozoozoozzzozzzzooozozozoozzzzoooozzzooozzzzoozoozoozzzozzozzozzoooozoozzooozzzozoozzzoooozozzoozozzozozoozzoozzoooozzozoozozzzozzzoozzoozzozozzzozozoozzzzzooooozooooozzzzozozzzzzozzooozozzoozoooozzzzozoozooozooozoooooozooozzzoozoooozoozozoooooozozoozzzzooozzooooozoozozozzzzozzzozzoozzozozzzzzoozoozozozzzzzozozozzzoozozzozzzozozoozozoozzoozzzzzzoozzozzzoozozozzzoozozzzzozzozozzzzoozzzooozozoozozzoooozoozozozozzooooozozozzozozzooozooozzzzzzooozoozozzozzzooozzzozozooozzzooozzzzzoozzzooooooozzzzzzozzzoooozzzzzozzoooooozozoozozzozozozozzzoooozzzozoozooozzzozozoozzzozzzoozoozzozzoozozzooooozzozzzoozzozoozzzzzooooooozzzzooozoozzozooooozozzoozozzozzozozoozoozzoozoooozzzzzoozozooozzooooooozzzoooooozozzzozozzozzzzzooozzozozzooooozzzzzozzozzozzozzzozozozzzozzzzoooozzzooozozooooozzzzooozozozoozzooozozozozzozozzozozozozoooozzoozzzozzoozzzozoozoozozzozzooozozoozozzzozoozzoozoozoozozzoozzozozzooozzoozoozozozzzozzozzoozzozozzozzzzzozooooooozoozzzooooozzzoozzzzzooozzzzzzozzooozzzzoozzzooozozozzzozzozzzozzzozozooozzoooozzoozoozozooooozzzzzozzoooooozzzozzozzzozozoozoozoozzozoozzozooozozzzzzooozoozozzzzozzoooozozozzzzzooooozooozozooooozzzoozzzozzozzzozoozozoozozzzzzzzzozozzzozzozooozozoooozooozozzzozoozozooozozozzoozzoozozzzzozzzooozoozzoozoooooozoooozzzzzzzzzzzooozzozzzzooozooozzozozoooozzoozzoozzzoooozozzzzzzzzzzzozozzoozooozoooozzzozzoozoozoozoozzoozzooozzozooooozooozooozzzozzozzooozoooozooozooooozozzozozozoooozzooozzozzozzoooozzoozzooooooozozzzooozzozoozooozzoooozzoozzozooozzozooozzzzzzoozzzooooooozozzzzozozozooozzooozoozzoozzooooozozzooozzozzoooozzzzzoozooozzzzzozzooozozzzzzoooooooozoozoozoozzzzzzozozooozzzzozzozooozozoozzoozozozozooozzozzozzzoozozzzoooooooooooooozooooozzozzooozoozozooozzozzzzoozozzzozoozzoooooozzozozoozozozoooozoooozzozooozozoozoozzzzzoozoozzzzzooozzoozoozzzzooooozozooozooozzoozooozzozozoooozzzozzzzoozzzzooozzozzoooozoozoozozozzzozzoozzozoooooozzzzzzzzooozoozozzzozozozzozoooozozoozooozooozooozoozzzozzzzozzooozoooooozzooozozozzozozoooooozooozzzozzzozzzzozoozzozozozzozzozzoozozzzozzzzozzozoozzzoozozzooozozoozzozzooozzozzoozoozoozzoozzozoozozzozoozzzzzozzozoooozoozoozozzzzooozzzzzzzzzzzzoozzozzzozzozzozozozzooozzoooozozozoozozozzooozzzooozoooooooozozoozzzozzozzooozozzooozzoozozzoozoozzoozzzzzoozzzzzoozzzzzooozzozozzzzzzoozooozzozzzzozzzzzzoozozzoozozzoozzooozzzzzozozoozooozoozzzzooozzoozzzzzozzozoozozzzzzzoozozooozzzzooooozoozzzzzozooozozzooooozozooozozzoozzzoooozoozozooozzoozoooozooozzozzoozzooozzzoooozozzooooozooozzzzoozzozzoozoooozzozzoozoozoooozooozzzzooozzoozooozooozoozzozozzoozzzzzzzzozzooozzzooozozzozzozoozooozzzzoozzoooozozzoozzoozozoozozooozzzzoozzzzzzozzzozoozoozozzzzozzzzzoozoooozozzzozzozzzzoooozzoooozooooozzozooozzzozzozzooozzzoozzzoozozoozzozoozzozzoozzzzzzzzzzoozoooooozooozozzzzzoozzozozoozozzoozoooozoooozooozoooozzooozzzzzoozooooozzzozozozoozzzzooooozzzzozoooozzoooozozzzozozooozozzoozzzzzozozzzozzzoozzzzzozzzozzzozozzzooooooooozzozozzoozzoozoozoozoooozzzzzzzoozooozooozozoozozzzzzooozzozzoooooozoooozozooooozozoozzoozzozooozzzzozoozozozoooozzozooozzoooozzzoozzoozoozoooozzozozzozzzoozzozzzzzzzzzozooooooozzzzzzoozozzzzozozoozoozzzzzzozzzozzozzooozoooooozzozzooooozozozzzozozoozoozzozoozozzozzzozzzzoozozoooozozzooozzzzzzzzzzzoozooozzzozzoozoozzoozozzozozzzooooooozozooozooozozozzoooozzzzzoozzozozzzozzoozozozozzozzooozozozzoozooozozoozzooozoooooooozoozzoozzzzzozozzoozzozooozooozzzzzozzozzoozzozzzzzozooozzooozzzzozzoozooooozzozzoozozozozzzozoozzozzzozzzzooozozoozooooozz\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 442,
        "task_id": 4108,
        "test_case_id": 24,
        "question": "You are given strings S and T consisting of lowercase English letters.\nYou can perform the following operation on S any number of times:\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\n-----Constraints-----\n - 1 \\leq |S| \\leq 2 \\times 10^5\n - |S| = |T|\n - S and T consists of lowercase English letters.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\nT\n\n-----Output-----\nIf S and T can be made equal, print Yes; otherwise, print No.\n\n-----Sample Input-----\nazzel\napple\n\n-----Sample Output-----\nYes\n\nazzel can be changed to apple, as follows:\n - Choose e as c_1 and l as c_2. azzel becomes azzle.\n - Choose z as c_1 and p as c_2. azzle becomes apple.",
        "solutions": "[\"S = input()\\nT = input()\\n\\ns = [[] for i in range(26)]\\nt = [[] for i in range(26)]\\n\\nfor i in range(len(S)):\\n    s[ord(S[i])-97].append(i)\\n    t[ord(T[i])-97].append(i)\\n\\ns = sorted(s)\\nt = sorted(t)\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nd=[[] for i in range(26)]\\nfor i,c in enumerate(S):\\n    d[ord(c)-ord('a')].append(i)\\nd2=[[]for i in range(26)]\\nfor i,c in enumerate(T):\\n    d2[ord(c)-ord('a')].append(i)\\nprint(['No','Yes'][set((tuple(x) for x in d))==set((tuple(x) for x in d2))])\", \"S = input()\\nT = input()\\n\\nchk1 = [[] for _ in range(26)]\\nchk2 = [[] for _ in range(26)]\\nfor i in range(len(S)):\\n    s1 = ord(S[i]) - 97\\n    s2 = ord(T[i]) - 97\\n    if len(chk1[s1]) == 0:\\n        chk1[s1].append(T[i])\\n    else:\\n        if chk1[s1][0] == T[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    if len(chk2[s2]) == 0:\\n        chk2[s2].append(S[i])\\n    else:\\n        if chk2[s2][0] == S[i]:\\n            pass\\n        else:\\n            print('No')\\n            return    \\nprint('Yes')\", \"from collections import Counter\\nS = str(input())\\nT = str(input())\\n\\ns = Counter(S)\\nt = Counter(T)\\n\\nif sorted(s.values()) == sorted(t.values()):\\n  print('Yes')\\nelse:\\n  print('No')\", \"import sys\\nfrom collections import Counter\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    s_count = [0]*26\\n    t_count = [0]*26\\n    for i in range(ord(\\\"a\\\"), ord(\\\"z\\\")+1):\\n        s_count[i-97] = s.count(chr(i))\\n        t_count[i-97] = t.count(chr(i))\\n    s_count.sort()\\n    t_count.sort()\\n    if s_count == t_count:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\n\\nsl = list(s)\\ntl = list(t)\\n\\nfrom collections import Counter\\nsc = Counter(sl)\\ntc = Counter(tl)\\n\\nsp =[]\\ntp =[]\\n\\nalp = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\nfor i in alp:\\n    sp.append(sc[i])\\n    tp.append(tc[i])\\n\\nsps =sorted(sp)\\ntps = sorted(tp)\\n\\nfor i,j in zip (sps,tps):\\n    if i ==j:\\n        pass\\n    else:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u304c\\u4e00\\u5bfe\\u4e00\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u308c\\u3070\\u826f\\u3044\\nds = {}\\ndt = {}\\n\\nans = 'Yes'\\nfor S,T in zip(s,t):\\n    if S in ds:\\n        if ds[S] != T:\\n            ans = 'No'\\n            break\\n    else:\\n        ds[S] = T\\n    \\n    if T in dt:\\n        if dt[T] != S:\\n            ans = 'No'\\n            break\\n    else:\\n        dt[T] = S\\n\\nprint(ans)\", \"from collections import Counter\\ns = list(input())\\nt = list(input())\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\n\\n# s,t\\u305d\\u308c\\u305e\\u308c\\u306e\\u5404\\u6587\\u5b57\\u306e\\u51fa\\u73fe\\u56de\\u6570\\u304c\\u540c\\u3058\\u3067\\u3042\\u308c\\u3070\\u4e00\\u81f4\\u3055\\u305b\\u3089\\u308c\\u308b\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nl_s = [[] for _ in range(26)]\\n\\nfor i, x in enumerate(s):\\n    l_s[ord(x) - 97].append(i)\\n\\nl_t = [[] for _ in range(26)]\\nfor i, x in enumerate(t):\\n    l_t[ord(x) - 97].append(i)\\n\\nfor l in l_s:\\n    if len(l) > 0:\\n        if l_t[ord(t[l[0]]) - 97] != l:\\n            print('No')\\n            return\\n\\nprint('Yes')\", \"from collections import Counter\\ns = [i for i in str(input())]\\nt = [h for h in str(input())]\\ns1 = Counter(s).most_common()\\nt1 = Counter(t).most_common()\\nif len(s1) != len(t1):\\n    print('No')\\nelse:\\n    z = 'Yes'\\n    for j in range(len(s1)):\\n        if s1[j][1] != t1[j][1]:\\n            z = 'No'\\n            break\\n    print(z)\", \"import collections\\n\\nA = input()\\nB = input()\\n\\nA_c = collections.Counter(A)\\nB_c = collections.Counter(B)\\nA_c = list(A_c.values())\\nB_c = list(B_c.values())\\n\\nA_c = list(A_c)\\nB_c = list(B_c)\\nA_c.sort()\\nB_c.sort()\\nif A_c == B_c:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\nfor i in range(n):\\n    for j in range(i):\\n        if s[i] == s[j]:\\n            s_par[i] = s_par[j]\\n            break\\n            \\nfor i in range(n):\\n    for j in range(i):\\n        if t[i] == t[j]:\\n            t_par[i] = t_par[j]\\n            break\\n            \\nif s_par == t_par:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n#\\n#\\n# @stop_watch\\ndef solve(S, T):\\n    alp = 'abcdefghijklmnopqrstuvwxyz'\\n    N = len(S)\\n    S_same = [[] for _ in range(N)]\\n    S_alphabet = {s: [] for s in alp}\\n    T_same = [[] for _ in range(N)]\\n    T_alphabet = {s: [] for s in alp}\\n    for i in range(N):\\n        S_alphabet[S[i]].append(i)\\n        T_alphabet[T[i]].append(i)\\n    for s in alp:\\n        stmp = S_alphabet[s]\\n        ttmp = T_alphabet[s]\\n        if len(stmp) > 0:\\n            S_same[stmp[0]] = stmp.copy()\\n        if len(ttmp) > 0:\\n            T_same[ttmp[0]] = ttmp.copy()\\n    for i in range(N):\\n        if len(S_same[i]) > 1:\\n            for ss in S_same[i][1:]:\\n                if T[S_same[i][0]] != T[ss]:\\n                    print('No')\\n                    return\\n        if len(T_same[i]) > 1:\\n            for tt in T_same[i][1:]:\\n                if S[T_same[i][0]] != S[tt]:\\n                    print('No')\\n                    return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # solve()\\n\\n__starting_point()\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().rstrip()\\n\\n\\ndef main():\\n    S = input()\\n    T = input()\\n    dictS =dict()\\n    dictT =dict()\\n\\n    for i in range(len(S)):\\n        if S[i] in dictS:\\n            if dictS[S[i]] !=T[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictS[S[i]] =T[i]\\n\\n        if T[i] in dictT:\\n            if dictT[T[i]] !=S[i]:\\n                print(\\\"No\\\")\\n                return\\n        else:\\n            dictT[T[i]] =S[i]\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# chokudai\\u3092redcorder\\u306b\\u3059\\u308b\\u306e\\u306f\\u306a\\u3093\\u3068\\u306a\\u304f\\u3067\\u304d\\u305d\\u3046\\u306a\\u304d\\u304c\\u3059\\u308b\\u304c\\u306a\\u3093\\u3067\\u3067\\u304d\\u306a\\u3044\\u306e\\u3060\\u308d\\u3046\\u304b\\n# c->r, r->c = rhokudai\\n# i->r, r->I = ihokudar\\n# \\u305f\\u3057\\u304b\\u306b\\u51fa\\u6765\\u306a\\u304b\\u3063\\u305f\\n# \\u3064\\u307e\\u308a\\u76ee\\u7684\\u306e\\u6587\\u5b57\\u306b\\u3067\\u304d\\u308b\\u306e\\u306f\\u305b\\u3044\\u305c\\u30441\\u56de\\u307e\\u3067\\n# \\uff082\\u56de\\u76ee\\u4ee5\\u964d\\u306f\\u305d\\u308c\\u3088\\u308a\\u524d\\u306b\\u5909\\u5316\\u3055\\u305b\\u305f\\u6587\\u5b57\\u306b\\u5f71\\u97ff\\u304c\\u51fa\\u308b\\uff09\\n# \\u306a\\u306e\\u3067\\u3001\\u5404\\u6587\\u5b57\\u306e\\u767b\\u5834\\u56de\\u6570\\u3092\\u51fa\\u3057\\u3001\\u305d\\u306e\\u6570\\u3060\\u3051\\u3067\\u6bd4\\u8f03\\u3059\\u308b\\ns, t = list(input()), list(input())\\nsd, td = {}, {}\\nfor sv in s:\\n    if sv not in sd:\\n        sd[sv] = 1\\n    else:\\n        sd[sv] += 1\\nfor tv in t:\\n    if tv not in td:\\n        td[tv] = 1\\n    else:\\n        td[tv] += 1\\nss, ts = sorted(sd.values()), sorted(td.values())\\nif ss == ts:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections \\ns = input()\\nt = input()\\nsc = sorted(collections.Counter(s).values())\\ntc = sorted(collections.Counter(t).values())\\n\\n\\nfor i in range(len(sc)):\\n  if sc[i] != tc[i]:\\n    print(\\\"No\\\")\\n    return\\nprint(\\\"Yes\\\")\\n\", \"S=list(input())\\nT=list(input())\\nprint(\\\"Yes\\\" if len(set(S))==len(set(T))==len(set(zip(S,T))) else \\\"No\\\")\", \"S = input()\\nT = input()\\ns = sorted(map(S.count, set(S)))\\nt = sorted(map(T.count, set(T)))\\nprint((\\\"Yes\\\" if(s == t) else \\\"No\\\"))\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S=input()\\nT=input()\\nN=len(S)\\nd=dict()\\nfor i in range(N):\\n    if S[i] not in list(d.keys()):\\n        if T[i] in list(d.values()):\\n            print(\\\"No\\\")\\n            break\\n        d[S[i]]=T[i]\\n    else:\\n        if d[S[i]]!=T[i]:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"s = input()\\nt = input()\\n\\ncycle_to = [''] * 26\\ncycle_from = [''] * 26\\n\\nfor i in range(len(s)):\\n    if cycle_to[ord(s[i]) - 97] == t[i]:\\n        continue\\n    if cycle_to[ord(s[i]) - 97] == '':\\n        cycle_to[ord(s[i]) - 97] = t[i]\\n    else:\\n        print('No')\\n        break\\n    \\n    if cycle_from[ord(t[i]) - 97] == s[i]:\\n        continue\\n    if cycle_from[ord(t[i]) - 97] == '':\\n        cycle_from[ord(t[i]) - 97] = s[i]\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"S = input()\\nT = input()\\nS_cnt = sorted(S.count(c) for c in set(S))\\nT_cnt = sorted(T.count(c) for c in set(T))\\nprint(\\\"Yes\\\") if S_cnt == T_cnt else print(\\\"No\\\")\\n\", \"import collections\\nS = list(input())\\nT = list(input())\\n \\ncntS = collections.Counter(S)\\ncntT = collections.Counter(T)\\n \\nif len(cntS) != len(cntT):\\n    print('No')\\n    return\\nelse:\\n    valS = list(cntS.values())\\n    valT = list(cntT.values())\\n\\n    if valS != valT:\\n            print('No')\\n            return\\nprint('Yes')\", \"import collections\\nS = list(input())\\nT = list(input())\\ncounterS = collections.Counter(S)\\ncounterT = collections.Counter(T)\\nScou = list(counterS.values())\\nTcou = list(counterT.values())\\nScou.sort()\\nTcou.sort()\\nif Scou == Tcou:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    import string\\n\\n    l = string.ascii_lowercase\\n\\n    for i in l:\\n        trial = set()\\n        for k,j in enumerate(s):\\n            if i == j:\\n                trial.add(t[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n        trial = set()\\n        for k,j in enumerate(t):\\n            if i == j:\\n                trial.add(s[k])\\n                if len(trial) > 1:\\n                    print(\\\"No\\\")\\n                    return\\n\\n    print(\\\"Yes\\\")\\n\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"S = input()\\nT = input()\\nlength = len(S)\\nkeep_S = [[] for i in range(26)]  # ord(T[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b S \\u3092\\u683c\\u7d0d\\nkeep_T = [[] for i in range(26)]  # ord(S[i])\\u306b\\u5bfe\\u5fdc\\u3059\\u308b T \\u3092\\u683c\\u7d0d\\n\\nfor i in range(length):\\n\\n    num_S = ord(T[i]) - ord('a')\\n    num_T = ord(S[i]) - ord('a')\\n\\n    if S[i] in keep_S[num_S]:\\n        continue\\n    else:\\n        keep_S[num_S].append(S[i])\\n\\n    if T[i] in keep_T[num_T]:\\n        continue\\n    else:\\n        keep_T[num_T].append(T[i])\\n\\n\\nfor i in range(26):\\n    if (len(keep_T[i]) > 1) | (len(keep_S[i]) > 1):\\n        print('No')\\n        return\\nprint('Yes')\\n\", \"import bisect,collections,copy,itertools,math,string\\nimport sys\\ndef I(): return int(sys.stdin.readline().rstrip())\\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\\ndef S(): return sys.stdin.readline().rstrip()\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\ndef main():\\n\\n\\n    s = S()\\n    t = S()\\n    \\n    dic1 = collections.defaultdict(str)\\n    dic2 = collections.defaultdict(str)\\n    \\n    for i in range(len(s)):\\n        if dic1[t[i]] == \\\"\\\":\\n            dic1[t[i]] = s[i]\\n        else:\\n            if dic1[t[i]] != s[i]:\\n                print(\\\"No\\\")\\n                return\\n\\n        if dic2[s[i]] == \\\"\\\":\\n            dic2[s[i]] = t[i]\\n        else:\\n            if dic2[s[i]] != t[i]:\\n                print(\\\"No\\\")\\n                return\\n        \\n    print(\\\"Yes\\\")\\n\\nmain()\\n\", \"import sys\\nfrom collections import Counter\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n\\n    c_S = Counter(S)\\n    c_T = Counter(T)\\n    count_S = list(c_S.values())\\n    count_T = list(c_T.values())\\n    count_S.sort()\\n    count_T.sort()\\n    is_same = True\\n    for s, t in zip(count_S, count_T):\\n        if s != t:\\n            is_same = False\\n            break\\n\\n    ans = \\\"Yes\\\" if is_same else \\\"No\\\"\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\nc1 = Counter(s).most_common()\\nc2 = Counter(t).most_common()\\n\\nfor x, y in zip(c1, c2):\\n    if x[1] != y[1]:\\n        print(\\\"No\\\")\\n        break\\nelse:\\n    print(\\\"Yes\\\")\", \"import sys\\n\\n\\nstdin = sys.stdin\\ndef ns(): return stdin.readline().rstrip()\\ndef ni(): return int(stdin.readline().rstrip())\\ndef nm(): return list(map(int, stdin.readline().split()))\\ndef nl(): return list(map(int, stdin.readline().split()))\\n\\n\\ndef main():\\n    s = input()\\n    t = input()\\n    S = sorted(map(s.count, set(s)))\\n    T = sorted(map(t.count, set(t)))\\n    print((\\\"Yes\\\" if S == T else \\\"No\\\"))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s=list(input())\\nt=list(input())\\n\\nn=len(s)\\nch=0\\nch1=0\\nans=0\\n\\nd={}\\nd1={}\\n\\nst=1\\nst1=1\\n\\ns_new=[]\\nt_new=[]\\n\\nfor i in range(n):\\n  if s[i] not in d:\\n    d[s[i]]=st\\n    st+=1\\n    \\nfor g in range(n):\\n  if t[g] not in d1:\\n    d1[t[g]]=st1\\n    st1+=1\\n    \\nfor h in range(n):\\n  s_new.append(d[s[h]])\\n  t_new.append(d1[t[h]])\\n  \\nif s_new==t_new:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"S = input()\\nT = input()\\n\\nalph = ['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\\nS_counter = []\\nT_counter = []\\nfor i in alph:\\n    S_counter.append(S.count(i))\\n    T_counter.append(T.count(i))\\n\\nS_counter.sort()\\nT_counter.sort()\\n\\nif S_counter == T_counter:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import collections\\n\\nS = input()\\nT = input()\\n\\nS_c = sorted(list(collections.Counter(S).values()))\\nT_c = sorted(list(collections.Counter(T).values()))\\n\\nprint(\\\"Yes\\\" if S_c == T_c else \\\"No\\\")\", \"import collections\\nS = list(input())\\nT = list(input())\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"S = input()\\nT = input()\\n\\nC_S = [None for _ in range(26)]\\nC_T = [None for _ in range(26)]\\n\\nok = True\\nfor i in range(len(S)):\\n    if not C_S[ord(S[i]) - ord('a')]:\\n        C_S[ord(S[i]) - ord('a')] = T[i]\\n    else:\\n        if C_S[ord(S[i]) - ord('a')] != T[i]:\\n            ok = False\\n            break\\n    if not C_T[ord(T[i]) - ord('a')]:\\n        C_T[ord(T[i]) - ord('a')] = S[i]\\n    else:\\n        if C_T[ord(T[i]) - ord('a')] != S[i]:\\n            ok = False\\n            break\\nif ok:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"def p(S):\\n    D={}\\n    for i in range(len(S)):\\n        a=S[i]\\n        if a in D:\\n            D[a].add(i)\\n        else:\\n            D[a]={i}\\n    return D\\nS=input()\\nT=input()\\n\\nA=sorted(p(S).values())\\nB=sorted(p(T).values())\\n\\nif A==B:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import collections\\nS = input()\\nT = input()\\nif sorted(collections.Counter(S).values()) == sorted(collections.Counter(T).values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\n\\ns = list(input())\\nt = list(input())\\n\\nsc = Counter(s).values()\\ntc = Counter(t).values()\\n\\nsl = Counter(sc)\\ntl = Counter(tc)\\n\\nif sl == tl:\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\ncount = 0\\nR_1 = [-1 for i in range(26)]\\nR_2 = [-1 for i in range(26)]\\n\\nanswer = \\\"Yes\\\"\\nfor i in range(N):\\n    r1 = ord(S[i]) - 97\\n    r2 = ord(T[i]) - 97\\n    if R_1[r1] >= 0:\\n        if r2 != R_1[r1]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_2[r2] >= 0:\\n        if r1 != R_2[r2]:\\n            answer = \\\"No\\\"\\n            break\\n    if R_1[r1] < 0:\\n        R_1[r1] = r2\\n    if R_2[r2] < 0:\\n        R_2[r2] = r1\\nprint(answer)\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n# s\\u3068t\\u306e\\u6587\\u5b57\\u5217\\u3092\\u30ab\\u30a6\\u30f3\\u30c8\\u3057\\u3066\\u6607\\u9806\\u306b\\u30bd\\u30fc\\u30c8\\nss = sorted(Counter(s).values())\\nst = sorted(Counter(t).values())\\n# \\u30a2\\u30eb\\u30d5\\u30a1\\u30d9\\u30c3\\u30c8\\u306e\\u7a2e\\u985e\\u6570\\u3068\\u8981\\u7d20\\u6570\\u304c\\u540c\\u3058\\u306a\\u3089Yes\\nprint(\\\"Yes\\\") if ss == st else print(\\\"No\\\")\\n\", \"S = input()\\nT = input()\\nU = [[i,j] for i,j in zip(S,T)]\\nU.sort()\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if  i != s:\\n        s = i\\n        t = j\\n    elif j != t:\\n        print(\\\"No\\\")\\n        return\\nU.sort(key=lambda x:x[1])\\ns = U[0][0]\\nt = U[0][1]\\nfor i,j in U:\\n    if j != t:\\n        s = i\\n        t = j\\n    elif i != s:\\n        print(\\\"No\\\")\\n        return\\nprint(\\\"Yes\\\")\", \"import sys\\n\\nread = sys.stdin.read\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nsys.setrecursionlimit(10 ** 9)\\nINF = 1 << 60\\nMOD = 1000000007\\n\\n\\ndef solve(S, T):\\n    d = dict()\\n    for s, t in zip(S, T):\\n        if s in d and d[s] != t:\\n            return False\\n        else:\\n            d[s] = t\\n\\n    return True\\n\\n\\ndef main():\\n    S = readline().strip()\\n    T = readline().strip()\\n\\n    if solve(S, T) and solve(T, S):\\n        print('Yes')\\n    else:\\n        print('No')\\n\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nt = input()\\ncs = []\\nct = []\\nfor i in range(97,97+26):\\n  cs.append(s.count(chr(i)))\\n  ct.append(t.count(chr(i)))\\nif sorted(cs) == sorted(ct):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"from collections import Counter\\n\\ns = input()\\nt = input()\\n\\na = Counter(s)\\nb = Counter(t)\\n\\nc = list(a.values())\\nd = list(b.values())\\n\\nprint('Yes') if c == d else print('No')\", \"import collections\\na = list(input())\\nb = list(input())\\nA = collections.Counter(a)\\nB = collections.Counter(b)\\nAlist = list(A.values())\\nBlist = list(B.values())\\nAsort = sorted(Alist)\\nBsort = sorted(Blist)\\nif Asort == Bsort:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"\\\"\\\"\\\"\\n\\u5fc5\\u8981\\u5341\\u5206\\u6761\\u4ef6\\n\\uff11\\uff09S\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001T\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\uff12\\uff09T\\u306e\\u4e2d\\u306e\\u540c\\u3058\\u6587\\u5b57\\u304c\\u3001S\\u306e\\u5225\\u306e\\u6587\\u5b57\\u306b\\u5bfe\\u5fdc\\u3057\\u3066\\u3044\\u306a\\u3044\\n\\\"\\\"\\\"\\n\\ns = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print('No')\\n            break\\n    \\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print('No')\\n            break\\nelse:\\n    print('Yes')\\n\", \"S = input()\\nT = input()\\n\\nconvert = dict()\\n\\n# \\u5909\\u63db\\u5143\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\uff1f\\nflg = True\\nfor s, t in zip(S, T):\\n    if s in convert and convert[s] != t:\\n        flg = False\\n        break\\n    convert[s] = t\\n\\n# \\u5909\\u63db\\u5148\\u306e\\u91cd\\u8907\\u30c1\\u30a7\\u30c3\\u30af\\nafter = list(convert.values())\\nif len(after) != len(set(after)):\\n    flg = False\\n\\nif flg:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"s = input()\\nt = input()\\n\\ndef char_list(s):\\n    l = [0] * 26\\n    for x in s:\\n        i = ord(x) - ord(\\\"a\\\")\\n        l[i] += 1\\n    l.sort()\\n    return l\\n\\nl1 = char_list(s)\\nl2 = char_list(t)\\n\\nif l1 == l2:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import Counter\\ns = Counter(input())\\nt = Counter(input())\\n\\nans = \\\"Yes\\\"\\nfor x,y in zip(s.items(), t.items()):\\n    if x[1] != y[1]:\\n        ans = \\\"No\\\"\\nprint(ans)\", \"S = input()\\nT = input()\\nans = 'Yes'\\ndic1,dic2 = {},{}\\n\\nfor i,j in zip(S,T):\\n    if i in dic1:\\n        if dic1[i] != j:\\n            ans = 'No'\\n    else:\\n        dic1[i] = j\\n        \\n    if j in dic2:\\n        if dic2[j] != i:\\n            ans = 'No'\\n    else:\\n        dic2[j] = i\\n\\n#print(dic1)\\n#print(dic2)\\nprint(ans)\", \"S = input()\\nT = input()\\nN = len(S)\\n# S\\u304b\\u3089T\\u306e\\u5909\\u63db\\nd1 = {}\\n# T\\u304b\\u3089S\\u306e\\u5909\\u63db\\nd2 = {}\\n\\nfor i in range(N):\\n    if S[i] not in d1:\\n        d1[S[i]] = T[i]\\n    else:\\n        if d1[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\n\\n    if T[i] not in d2:\\n        d2[T[i]] = S[i]\\n    else:\\n        if d2[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n        else:\\n            pass\\nprint(\\\"Yes\\\")\\n\", \"s=list(input())\\nt=list(input())\\ncnt1=[[] for _ in range(26)]\\ncnt2=[[] for _ in range(26)]\\nfor i in range(len(s)):\\n    num1=ord(s[i])-97\\n    num2=ord(t[i])-97\\n    if t[i] not in cnt1[num1]:\\n        cnt1[num1].append(t[i])\\n    if s[i] not in cnt2[num2]:\\n        cnt2[num2].append(s[i])\\nans=0\\nfor i in range(26):\\n    if len(cnt1[i])>1:\\n        ans=1\\n        break\\n    if len(cnt2[i])>1:\\n        ans=1\\n        break\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\nS    = np.array(list(input()))\\nT    = np.array(list(input()))\\nN    = len(S)\\nSSrt = np.sort(S)\\nTSrt = np.sort(T)\\nSArg = np.argsort(S)\\nTArg = np.argsort(T)\\nSAgT = S[TArg]\\nTAgS = T[SArg]\\n\\nSBef = ''\\nTBef = ''\\nSFlag = True\\nfor ST in range(0,N):\\n    SNow = SSrt[ST]\\n    TNow = TAgS[ST]\\n    if SBef==SNow:\\n        if TBef!=TNow:\\n            SFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nSBef = ''\\nTBef = ''\\nTFlag = True\\nfor TT in range(0,N):\\n    SNow = SAgT[TT]\\n    TNow = TSrt[TT]\\n    if TBef==TNow:\\n        if SBef!=SNow:\\n            TFlag = False\\n            break\\n    SBef = SNow\\n    TBef = TNow\\n        \\nif SFlag and TFlag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"from collections import defaultdict\\n\\ns = input()\\nt = input()\\n\\ndicts = defaultdict(int)\\ndictt = defaultdict(int)\\n\\ncs = []\\nct = []\\n\\nfor i in range(len(s)):\\n    dicts[s[i]] += 1\\n    dictt[t[i]] += 1\\n    cs.append(dicts[s[i]])\\n    ct.append(dictt[t[i]])\\n\\n\\nif cs == ct:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\n\\n\\ndef IN_I(): return int(sys.stdin.readline().rstrip())\\ndef IN_LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\\ndef IN_S(): return sys.stdin.readline().rstrip()\\ndef IN_LS(): return list(sys.stdin.readline().rstrip().split())\\n\\n\\nS = IN_S()\\nT = IN_S()\\n\\nd1 = dict()\\nd2 = dict()\\n\\nlen_s = len(S)\\n\\nfor i in range(len_s):\\n    a = S[i]\\n    b = T[i]\\n    if (a in d1 and d1[a] != b) or (b in d2 and d2[b] != a):\\n        print('No')\\n        return\\n    d1[a] = b\\n    d2[b] = a\\n\\nprint('Yes')\\n\", \"from collections import Counter\\ns=input()\\nt=input()\\nlist_S=Counter(s)\\nlist_T=Counter(t)\\n\\nif sorted(list_S.values()) == sorted(list_T.values()):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from collections import defaultdict\\ns = input()\\nt = input()\\nn = len(s)\\n\\nd = defaultdict(str)\\n# \\u30c0\\u30e1\\u306a\\u5834\\u5408\\n# 1. \\u540c\\u3058t\\u304c\\u9055\\u3046s\\u306b\\u5bfe\\u5fdc\\n# 2. \\u540c\\u3058s\\u304c\\u9055\\u3046t\\u306b\\u5bfe\\u5fdc\\nfor i in range(n):\\n    if d[t[i]] == \\\"\\\":\\n        d[t[i]] = s[i]\\n    elif d[t[i]] != s[i]:\\n        print(\\\"No\\\")\\n        return\\nd.clear()\\nfor i in range(n):\\n    if d[s[i]] == \\\"\\\":\\n        d[s[i]] = t[i]\\n    elif d[s[i]] != t[i]:\\n        print(\\\"No\\\")\\n        return\\n\\nprint(\\\"Yes\\\")\\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n#\\u6587\\u5b57\\u306e\\u9806\\u756a\\u5165\\u308c\\u66ff\\u3048\\u306f\\u53ef\\u80fd\\n#\\u6587\\u5b57\\u306e\\u500b\\u6570\\u306f\\u5897\\u3084\\u305b\\u306a\\u3044\\n#\\u7d50\\u5c40\\u306faabbb\\u306a\\u30892,3\\u306b\\u306a\\u308b\\n#abcdb\\u306a\\u3089a:1,b:2,c:1,d:1\\ns_dict = Counter(s)\\nt_dict = Counter(t)\\ns_val = list(s_dict.values())\\nt_val = list(t_dict.values())\\ns_val.sort()\\nt_val.sort()\\nif s_val == t_val:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"import sys\\nimport math\\nfrom collections import defaultdict\\nfrom collections import deque\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\ninput = lambda: sys.stdin.readline().strip()\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\n\\ndef main():\\n    S = SI()\\n    T = SI()\\n    D = defaultdict(str)\\n    for s, t in zip(S, T):\\n        if D[s] == \\\"\\\":\\n            D[s] = t\\n        if D[s] != t:\\n            print(\\\"No\\\")\\n            return\\n    if len(set(D.keys())) != len(set(D.values())):\\n        print(\\\"No\\\")\\n    else:\\n        print(\\\"Yes\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Wed Sep 30 03:40:29 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\nA = list()\\nB = list()\\nfor i in range(26):\\n    A.append(list())\\n    B.append(list())\\nS = input()\\nT = input()\\ndef solve():\\n    for i in range(len(S)):\\n            index = ord(S[i]) - ord(\\\"a\\\")\\n            A[index].append(i)\\n            \\n    for a_lis in A:\\n        flag = False\\n        if a_lis:\\n            tmp = T[a_lis[0]]\\n        for t in a_lis:\\n            if T[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n        \\n    for i in range(len(T)):\\n            index = ord(T[i]) - ord(\\\"a\\\")\\n            B[index].append(i)\\n   \\n    for b_lis in B :\\n        flag = False\\n        if b_lis:\\n            tmp = S[b_lis[0]]\\n        for t in b_lis:\\n            if S[t] != tmp:\\n                flag = True\\n        if flag:\\n            print(\\\"No\\\")\\n            return\\n    \\n    print(\\\"Yes\\\")\\n    #print(B)\\n    return \\n\\nsolve()\", \"s = input()\\nt = input()\\ns = sorted(map(s.count,set(s)))\\nt = sorted(map(t.count,set(t)))\\nprint(\\\"Yes\\\" if s==t else \\\"No\\\")\", \"S=input()\\nT=input()\\n\\nD1={}\\nD2={}\\n\\nans=1\\nfor s,t in zip(S,T):\\n    x=D1.get(t, '')\\n    if x=='':\\n        D1[t]=s\\n    else:\\n        if x!=s:\\n            ans=0\\n            break\\n            \\n    x=D2.get(s, '')\\n    if x=='':\\n        D2[s]=t\\n    else:\\n        if x!=t:\\n            ans=0\\n            break\\n\\nprint('Yes' if ans else 'No')\", \"s = input()\\nt = input()\\n\\ns_map = [[] for i in range(26)]\\nt_map = [[] for i in range(26)]\\nn = len(s)\\n\\nfor i in range(n):\\n    si = ord(s[i]) - ord(\\\"a\\\")\\n    ti = ord(t[i]) - ord(\\\"a\\\")\\n    \\n    s_map[si].append(i)\\n    t_map[ti].append(i)\\n\\ns_map = sorted(s_map)\\nt_map = sorted(t_map)\\n\\nif s_map == t_map:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n# print(s_map)\\n# print(t_map)\\n\", \"s = input()\\nt = input()\\n\\ndef f(x):\\n    dic = {}\\n    for c in x:\\n        if c in dic:\\n            dic[c] += 1\\n        else:\\n            dic[c] = 1\\n    return dic\\n\\nd1 = f(s)\\nd2 = f(t)\\nl1 = [i for i in d1.values()]\\nl2 = [i for i in d2.values()]\\nl1.sort()\\nl2.sort()\\n\\nif l1 == l2:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = list(input())\\nt = list(input())\\nn = len(s)\\n\\ns_par = [i for i in range(n + 1)]\\nt_par = [i for i in range(n + 1)]\\n\\ndef operation(x, par):\\n    for i in range(n):\\n        for j in range(i):\\n            if x[i] == x[j]:\\n                par[i] = par[j]\\n                break\\n    return par\\n\\nif operation(s, s_par) == operation(t, t_par):\\n    print('Yes')\\nelse:\\n    print('No')\", \"S = input()\\nT = input()\\nN = len(S)\\n\\nchr_from = {}\\nchr_to = {}\\n\\nflg = True\\n\\nfor i in range(N):\\n    if T[i] in chr_to:\\n        if S[i] not in chr_from:\\n            chr_to[T[i]] += 1\\n    else:\\n        chr_to[T[i]] = 1\\n    \\n    if S[i] in chr_from:\\n        if chr_from[S[i]] != T[i]:\\n            flg = False\\n    else:\\n        chr_from[S[i]] = T[i]\\n\\nfor val in chr_to.values():\\n    if val > 1:\\n        flg = False\\n\\n\\nprint(['No', 'Yes'][flg])\", \"from collections import Counter\\ns=Counter(list(input()))\\nt=Counter(list(input()))\\ns1,t1=sorted(list(s.values())),sorted(list(t.values()))\\nprint(\\\"Yes\\\" if s1==t1 else \\\"No\\\")\", \"import sys\\n \\ninput = sys.stdin.readline\\nS = input().strip()\\nT = input().strip()\\n \\n# S -> T\\nindex_s = {}\\n# T -> S\\nindex_t = {}\\nfor i in range(len(S)):\\n    if T[i] in index_t:\\n        if index_t[T[i]] != S[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_t[T[i]] = S[i]\\n\\n    if S[i] in index_s:\\n        if index_s[S[i]] != T[i]:\\n            print(\\\"No\\\")\\n            return\\n    else:\\n        index_s[S[i]] = T[i]\\n \\nprint(\\\"Yes\\\")\", \"s = input()\\nt = input()\\nn = len(s)\\nx = []\\ny = []\\n\\nfor i in range(n):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\n\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nprint('Yes' if s == t else 'No')\", \"from collections import defaultdict\\n\\nS = input()\\nT = input()\\n\\ndictS = defaultdict(int)\\ndictT = defaultdict(int)\\ndictS[S[0]] = dictT[T[0]] = 1\\nn = 2\\n\\nfor i in range(1, len(S)):\\n    if dictS[S[i]] == dictT[T[i]]:\\n        if dictS[S[i]] == 0:\\n            dictS[S[i]] = dictT[T[i]] = n\\n            n += 1\\n    else:\\n        print('No')\\n        break\\nelse:\\n    print('Yes')\", \"s = input()\\nt = input()\\nd = []\\nfor l in [s, t]:\\n    ptr = 0\\n    dct = dict()\\n    for c in l:\\n        if c not in list(dct.keys()):\\n            dct[c] = chr(ord(\\\"A\\\")+ptr)\\n            ptr += 1\\n    d.append([dct[c] for c in l])\\n\\nprint((\\\"Yes\\\" if \\\"\\\".join(d[0]) == \\\"\\\".join(d[1]) else \\\"No\\\"))\\n\", \"import sys\\ns = list(input())\\nt = list(input())\\na = [-1 for _ in range(26)]\\nb = [-1 for _ in range(26)]\\n\\nfor i in range(len(s)):\\n    num0, num1 = a[ord(s[i])-97], b[ord(t[i])-97]\\n    if num0 >= 0:\\n        if chr(num0+97) != t[i]:\\n            print('No')\\n            return\\n    else:\\n        a[ord(s[i])-97] = ord(t[i])-97\\n        \\n    if num1 >= 0:\\n        if chr(num1+97) != s[i]:\\n            print('No')\\n            return\\n    else:\\n        b[ord(t[i])-97] = ord(s[i])-97\\n            \\nprint('Yes')\\n\", \"s = input()\\nt = input()\\nx = []\\ny = []\\nfor i in range(len(s)):\\n    if s[i] not in x:\\n        x.append(s[i])\\n    if t[i] not in y:\\n        y.append(t[i])\\nfor i in range(len(x)):\\n    s = s.replace(x[i], str(i))\\nfor i in range(len(y)):\\n    t = t.replace(y[i], str(i))\\nif s == t:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\na=[s.count(chr(97+i)) for i in range(26)]\\nb=[t.count(chr(97+i)) for i in range(26)]\\nif all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"def solve():\\n    S=input()\\n    n=len(S)\\n    S1=[1]\\n    k=1\\n    for i in range(1,n):\\n        if S[i] not in S[:i]:\\n            k+=1\\n            S1.append(k)\\n        else:\\n            num=S1[S.find(S[i])]\\n            S1.append(num)\\n    return S1\\n\\nS1=solve()\\nT1=solve()\\n\\nif S1==T1:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s = input()\\nt = input()\\n\\ndict_st = {}\\ndict_ts = {}\\n\\nfor x, y in zip(s, t):\\n    if x not in dict_st:\\n        dict_st[x] = y\\n    else:\\n        if dict_st[x] != y:\\n            print(\\\"No\\\")\\n            break\\n\\n    if y not in dict_ts:\\n        dict_ts[y] = x\\n    else:\\n        if dict_ts[y] != x:\\n            print(\\\"No\\\")\\n            break\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"S,T = input(),input()\\n\\nd = [None]*26\\nflag = True\\nfor s,t in zip(S,T):\\n    s = ord(s)-ord('a')\\n    t = ord(t)-ord('a')\\n    if d[s] is None:\\n        d[s] = t\\n    elif d[s] != t:\\n        flag = False\\n        break\\n\\nif not flag:\\n    print('No')\\nelif len(set(v for v in d if v is not None)) != sum(int(v is not None) for v in d):\\n    print('No')\\nelse:\\n    print('Yes')\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom fractions import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\n#import bisect\\n#\\n#    d = m - k[i] - k[j]\\n#    if kk[bisect.bisect_right(kk,d) - 1] == d:\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\ndef readInts():\\n  return list(map(int,input().split()))\\ndef I():\\n  return int(input())\\ndics = defaultdict(str)\\ndict = defaultdict(str)\\ns = input()\\nt = input()\\nfor i in range(len(s)):\\n    if dics[s[i]]:\\n        if dics[s[i]] == t[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dics[s[i]] = t[i]\\n    if dict[t[i]]:\\n        if dict[t[i]] == s[i]:\\n            pass\\n        else:\\n            print('No')\\n            return\\n    else:\\n        dict[t[i]] = s[i]\\nprint('Yes')\\n\", \"S = input()\\nT = input()\\ns_let = [0]*26\\nt_let = [0]*26\\nans = \\\"Yes\\\"\\n\\nfor i in range(len(S)):\\n  s_let[ord(S[i])-ord(\\\"a\\\")] += 1\\nfor j in range(len(T)):\\n  t_let[ord(T[j])-ord(\\\"a\\\")] += 1\\n\\ns_let.sort()\\nt_let.sort()\\n\\nfor k in range(26):\\n  if s_let[k] != t_let[k]:\\n    ans = \\\"No\\\"\\n\\nprint(ans)\", \"s=input()\\nt=input()\\nsset=set()\\ntset=set()\\nj=1\\nalp={}\\nds=[0]*len(s)\\nfor i in range(len(s)):\\n  if not s[i] in sset:\\n    alp[s[i]]=j\\n    ds[i]=j\\n    sset.add(s[i])\\n    j+=1\\n  else:\\n    ds[i]=alp[s[i]]\\nj=1\\nalp={}\\ndt=[0]*len(t)\\nfor i in range(len(t)):\\n  if not t[i] in tset:\\n    alp[t[i]]=j\\n    dt[i]=j\\n    tset.add(t[i])\\n    j+=1\\n  else:\\n    dt[i]=alp[t[i]]\\nfor i in range(len(s)):\\n  if ds[i]!=dt[i]:\\n    print('No')\\n    return\\nprint('Yes')\", \"# import sys\\n# sys.setrecursionlimit(10 ** 6)\\n# import bisect\\n# from collections import deque\\n# from decorator import stop_watch\\n# \\n# \\n# @stop_watch\\ndef solve(S, T):\\n    N = len(S)\\n    S_check = [0] * N\\n    T_check = [0] * N\\n    for i in range(N):\\n        if S_check[i] == 0:\\n            S_check[i] = 1\\n            for j in range(i + 1, N):\\n                if S[i] == S[j]:\\n                    S_check[j] = 1\\n                    if T[i] != T[j]:\\n                        print('No')\\n                        return\\n        if T_check[i] == 0:\\n            T_check[i] = 1\\n            for j in range(i + 1, N):\\n                if T[i] == T[j]:\\n                    T_check[j] = 1\\n                    if S[i] != S[j]:\\n                        print('No')\\n                        return\\n    print('Yes')\\n\\n\\ndef __starting_point():\\n    S = input()\\n    T = input()\\n    solve(S, T)\\n\\n    # # test\\n    # from random import randint\\n    # from func import random_str\\n    # S = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # T = 'abcdefghijklmnopqrstuvwxyz' * (2 * 10 ** 5 // 26 + 1)\\n    # solve(S, T)\\n\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nS = input()\\nS = S.replace('\\\\n','')\\ns_list = list(S)\\n\\nT = input()\\nT = T.replace('\\\\n','')\\nt_list = list(T)\\n\\nalpha_dict = {}\\nt_diff_count = [0 for i in range(27)]\\ns_diff_count = [0 for i in range(27)]\\n\\nfor i,c in enumerate(range(ord('a'),ord('z')+1)):\\n    alpha_dict[chr(c)] = i \\n\\nfor i,s in enumerate(s_list):\\n    #if not s == t_list[i]:\\n    number = alpha_dict[s_list[i]]\\n    s_diff_count[number] += 1\\n    number = alpha_dict[t_list[i]]\\n    t_diff_count[number] += 1\\n\\nfor i,s in enumerate(s_list):\\n    number = alpha_dict[s_list[i]]\\n    s_count = s_diff_count[number] \\n    number = alpha_dict[t_list[i]]\\n    t_count = t_diff_count[number]\\n    if not s_count == t_count:\\n        if t_count >= 2:\\n            print(\\\"No\\\")\\n            return\\n        if s_count >= 2:\\n            print(\\\"No\\\")\\n            return\\nprint(\\\"Yes\\\")    \\n\", \"from collections import Counter\\ns = input()\\nt = input()\\n\\ns_count = Counter(s)\\nt_count = Counter(t)\\nif sorted(s_count.values()) == sorted(t_count.values()): print(\\\"Yes\\\")\\nelse: print(\\\"No\\\")\", \"S=input()\\nT=input()\\n\\ndict_S={}\\ndict_T={}\\n\\nfor x, y in zip(S, T):\\n    if x not in dict_S:\\n        dict_S[x] = y\\n    else:\\n        if dict_S[x] != y:\\n            print(\\\"No\\\")\\n            return\\n\\n    if y not in dict_T:\\n        dict_T[y] = x\\n    else:\\n        if dict_T[y] != x:\\n            print(\\\"No\\\")\\n            return\\n\\n\\nprint(\\\"Yes\\\")\", \"s=input()\\nt=input()\\nn=len(s)\\nf=0\\na=[[] for i in range(26)]\\nfor i in range(n):\\n    \\n    if len(a[ord(s[i])-97])==0:\\n        a[ord(s[i])-97].append(t[i])\\n    else:\\n        if a[ord(s[i])-97][0]!=t[i]:\\n            f=1\\nx=[a[i][0] for i in range(26) if len(a[i])==1]\\nif len(x)!=len(set(x)):\\n    f=1\\nprint((\\\"Yes\\\" if f==0 else \\\"No\\\"))\\n\\n    \\n\", \"s = input()\\nt = input()\\n\\nsc = {}\\ntc = {}\\n\\nfor i in range(len(s)):\\n    if s[i] in sc:\\n        sc[s[i]].append(i)\\n    else:\\n        sc[s[i]] = [i]\\n\\n    if t[i] in tc:\\n        tc[t[i]].append(i)\\n    else:\\n        tc[t[i]] = [i]\\n\\nsc = list(sc.values())\\ntc = list(tc.values())\\n\\nprint(\\\"Yes\\\" if sc == tc else \\\"No\\\")\", \"s = input()\\nt = input()\\nsl = len(s)\\nss = \\\"\\\"\\nused = [False]*26\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(s[i])-97)%26]:\\n        ss += str(used[(ord(s[i])-97)%26])\\n    else:\\n        cnt += 1\\n        ss += str(cnt)\\n        used[(ord(s[i])-97)%26] = cnt\\n\\nused = [False]*26\\ntt = \\\"\\\"\\ncnt = 0\\nfor i in range(sl):\\n    if used[(ord(t[i])-97)%26]:\\n        tt += str(used[(ord(t[i])-97)%26])\\n    else:\\n        cnt += 1\\n        tt += str(cnt)\\n        used[(ord(t[i])-97)%26] = cnt\\n\\nif ss==tt:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"import sys\\nimport math\\nfrom collections import defaultdict, deque, Counter\\nfrom copy import deepcopy\\nfrom bisect import bisect, bisect_right, bisect_left\\nfrom heapq import heapify, heappop, heappush\\n    \\ninput = sys.stdin.readline\\ndef RD(): return input().rstrip()\\ndef F(): return float(input().rstrip())\\ndef I(): return int(input().rstrip())\\ndef MI(): return map(int, input().split())\\ndef MF(): return map(float,input().split())\\ndef LI(): return list(map(int, input().split()))\\ndef TI(): return tuple(map(int, input().split()))\\ndef LF(): return list(map(float,input().split()))\\ndef Init(H, W, num): return [[num for i in range(W)] for j in range(H)]\\n    \\n    \\ndef main():\\n    S = input().rstrip()\\n    T = input().rstrip()\\n    L = [[S[i],T[i]] for i in range(len(S))]\\n    L.sort(key = lambda x: x[0])\\n    D = defaultdict(int)\\n    D2 = defaultdict(int)\\n    for a, b in L:\\n        if (D[a] == 0 or D[a] == b) and (D2[b] == 0 or D2[b] == a):\\n            D[a]=b\\n            D2[b]=a\\n        else:\\n            print(\\\"No\\\")\\n            return\\n    print(\\\"Yes\\\")\\n    \\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"#!/usr/bin/env python3\\nfrom collections import Counter\\nx = lambda : sorted(Counter(input()).values())\\nprint(('YNeos'[x()!=x()::2]))\\n\", \"s = input()\\nt = input()\\nmemo = {}\\nans = 'Yes'\\nfor i in range(len(s)):\\n    if s[i] in memo:\\n        if t[i] != memo[s[i]]:\\n            ans = 'No'\\n            break\\n    else:\\n        memo[s[i]] = t[i]\\na = list(memo.values())\\nb = list(set(a))\\nif len(b) != len(a):\\n    ans = 'No'\\nprint(ans)\", \"from collections import Counter\\nS = list(input())\\nT = list(input())\\nchange = [-1]*27\\nans = \\\"Yes\\\"\\nfor i in range(len(S)):\\n    s = ord(S[i])-97\\n    if S[i] == T[i]:\\n        change[s] = s\\n    elif change[s] == -1:\\n        change[s] = ord(T[i])-97\\n    else:\\n        t = ord(T[i])-97\\n        if change[s] != t:\\n            ans = \\\"No\\\"\\n            break\\nchange=Counter(change)\\ndel change[-1]\\nfor i in change.values():\\n    if i==1:\\n        continue\\n    else:\\n        ans=\\\"No\\\"\\nprint(ans)\", \"s=list(input())\\nt=list(input())\\nn=len(s)\\ndef get_count_list(s):\\n    alphabets=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n    ans={}\\n    for alphabet in alphabets:\\n        ans[alphabet]=[]\\n    for i in range(n):\\n        ans[s[i]].append(i)\\n    return ans\\n\\n\\ndef get_index2alpha(s):\\n    ans={}\\n    for i in range(n):\\n        ans[i]=s[i]\\n    return ans\\n\\ns_count=get_count_list(s)\\nt_count=get_count_list(t)\\ns_index=get_index2alpha(s)\\nt_index=get_index2alpha(t)\\n\\nans=0\\n\\ns_set=set(s)\\n\\n\\nfor i in range(n):\\n    s_alpha=s_index[i]\\n    t_alpha = t_index[i]\\n    if s_alpha in s_set:\\n        s_set.remove(s_alpha)\\n        if not s_count[s_alpha]==t_count[t_alpha]:\\n            ans+=1\\n\\nif ans==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\nt = input()\\n\\nsc = [0] * 26\\ntc = [0] * 26\\n\\nfor i in range(len(s)):\\n    sc[ord(s[i]) - ord('a')] += 1\\n    tc[ord(t[i]) - ord('a')] += 1\\n\\nsc.sort()\\ntc.sort()\\n\\nif tuple(sc) == tuple(tc):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"import sys\\n# import math\\n# import bisect\\n# import numpy as np\\n# from decimal import Decimal\\n# from numba import njit, i8, u1, b1 #JIT compiler\\n# from itertools import combinations, product\\nfrom collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)\\ndef LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)\\n\\ndef Main():\\n    s = read_str()\\n    t = read_str()\\n\\n    s_lis = sorted(Counter(s).values())\\n    t_lis = sorted(Counter(t).values())\\n    \\n    if s_lis == t_lis:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    Main()\\n__starting_point()\", \"S = input()\\nT = input()\\n\\ntrans_dict = {}\\n\\nfor i in range(len(S)):\\n    s = S[i]\\n    t = T[i]\\n\\n    if s in trans_dict:\\n        if not trans_dict[s] == t:\\n            print('No')\\n            return\\n    else:\\n        trans_dict[s] = t\\n\\nif len(list(trans_dict.values())) == len(set(trans_dict.values())):\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[16]:\\n\\n\\nS = input()\\nT = input()\\n\\n\\n# In[20]:\\n\\n\\nmydict = {}\\nfor i in range(len(S)):\\n    if S[i] in mydict:\\n        if T[i] != mydict[S[i]]:\\n            ans = \\\"No\\\"\\n            break\\n    else:\\n        mydict[S[i]] = T[i]\\nelse:\\n    a = list(mydict.values())\\n    b = list(set(a))\\n    if len(b) != len(a):\\n        ans = \\\"No\\\"\\n    else:\\n        ans = \\\"Yes\\\"\\nprint(ans)\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\"]",
        "difficulty": "introductory",
        "input": "aaa\nxxy\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc110/tasks/abc110_c"
    },
    {
        "id": 443,
        "task_id": 4193,
        "test_case_id": 9,
        "question": "We have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\n-----Constraints-----\n - All values in input are integers.\n - 1 \\leq A_{i, j} \\leq 100\n - A_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n - 1 \\leq N \\leq 10\n - 1 \\leq b_i \\leq 100\n - b_i \\neq b_j (i \\neq j)\n\n-----Input-----\nInput is given from Standard Input in the following format:\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\n-----Output-----\nIf we will have a bingo, print Yes; otherwise, print No.\n\n-----Sample Input-----\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\n-----Sample Output-----\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.",
        "solutions": "[\"a = list(list(map(int,input().split())) for _ in range(3))\\nn = int(input())\\nb = list(int(input()) for _ in range(n))\\n\\nfor i in range(3):\\n    for j in range(3):\\n        if a[i][j] in b:\\n            a[i][j] = 0\\n\\nfor i in range(3):\\n    if a[i][0] == a[i][1] == a[i][2] or a[0][i] == a[1][i] == a[2][i] or a[0][0] == a[1][1] == a[2][2] or a[2][0] == a[1][1] == a[0][2]:\\n        print(\\\"Yes\\\")\\n        break\\nelse:\\n     print(\\\"No\\\")\", \"import sys\\nread = sys.stdin.readline\\nimport time\\nfrom heapq import heappush, heappop, heapify\\nimport math\\nfrom math import gcd\\nimport itertools as it\\nfrom collections import deque \\n\\n\\ndef inp():\\n    return int(input())\\ndef inpl():\\n    return list(map(int, input().split()))\\nstart_time = time.perf_counter()\\n# ------------------------------\\n\\n# bingo = [[0] * 3 for i in range(3)]\\n# bingo[0][0] = 1\\n# print(bingo)\\n\\nbingo = []\\nfor i in range(3):\\n    ls = inpl()\\n    bingo.append(ls)\\nN = inp()\\nfor i in range(N):\\n    a = inp()\\n    for i in range(3):\\n        for j in range(3):\\n            if bingo[i][j] == a:\\n                bingo[i][j] = -1\\n\\nbl = False\\nfor i in range(3):\\n    if bingo[i][0] == -1 and bingo[i][1] == -1 and bingo[i][2] == -1:\\n        bl = True\\n    if bingo[0][i] == -1 and bingo[1][i] == -1 and bingo[2][i] == -1:\\n        bl = True\\n         \\nif bingo[0][0] == -1 and bingo[1][1] == -1 and bingo[2][2] == -1:\\n        bl = True\\n\\nif bingo[0][2] == -1 and bingo[1][1] == -1 and bingo[2][0] == -1:\\n        bl = True\\n \\nprint('Yes' if bl else 'No')\\n\\n\\n# -----------------------------\\nend_time = time.perf_counter()\\nprint('time:', end_time-start_time, file=sys.stderr)\\n\\n\", \"A = [list(map(int, input().split())) for i in range(3)]\\nN = int(input())\\nB = [0 for i in range(8)]\\nfor i in range(N):\\n    b = int(input())\\n    if b == A[0][0] or b == A[1][0] or b == A[2][0]:\\n        B[0] += 1\\n    if b == A[0][1] or b == A[1][1] or b == A[2][1]:\\n        B[1] += 1\\n    if b == A[0][2] or b == A[1][2] or b == A[2][2]:\\n        B[2] += 1\\n    if b == A[0][0] or b == A[0][1] or b == A[0][2]:\\n        B[3] += 1\\n    if b == A[1][0] or b == A[1][1] or b == A[1][2]:\\n        B[4] += 1\\n    if b == A[2][0] or b == A[2][1] or b == A[2][2]:\\n        B[5] += 1\\n    if b == A[0][0] or b == A[1][1] or b == A[2][2]:\\n        B[6] += 1\\n    if b == A[0][2] or b == A[1][1] or b == A[2][0]:\\n        B[7] += 1\\nif 3 in B:\\n    ans = 'Yes'\\nelse:\\n    ans = 'No'\\nprint(ans)\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\n\\nbingo = []\\nfor i in range(3):\\n    x = a[i]\\n    for j in range(3):\\n        bingo.append(x[j])\\n\\nfor i in b:\\n    for j in range(0,9):\\n        if i == bingo[j]:\\n            bingo[j] = 0\\n\\nif bingo[0]==0 and bingo[1]==0 and bingo[2]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[3]==0 and bingo[4]==0 and bingo[5]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[6]==0 and bingo[7]==0 and bingo[8]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[0]==0 and bingo[3]==0 and bingo[6]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[1]==0 and bingo[4]==0 and bingo[7]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[2]==0 and bingo[5]==0 and bingo[8]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[0]==0 and bingo[4]==0 and bingo[8]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[2]==0 and bingo[4]==0 and bingo[6]==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"Bingo_1 = list(map(int, input().split()))\\nBingo_2 = list(map(int, input().split()))\\nBingo_3 = list(map(int, input().split()))\\n\\nnumber_table = []\\nnumber_count = int(input())\\nfor i in range(number_count):\\n    number_table.append(int(input()))\\n\\nfor j in range(number_count):\\n    if number_table[j] == Bingo_1[0]:\\n        Bingo_1[0] = 0\\n    elif number_table[j] == Bingo_1[1]:\\n        Bingo_1[1] = 0\\n    elif number_table[j] == Bingo_1[2]:\\n        Bingo_1[2] = 0\\n    elif number_table[j] == Bingo_2[0]:\\n        Bingo_2[0] = 0\\n    elif number_table[j] == Bingo_2[1]:\\n        Bingo_2[1] = 0\\n    elif number_table[j] == Bingo_2[2]:\\n        Bingo_2[2] = 0\\n    elif number_table[j] == Bingo_3[0]:\\n        Bingo_3[0] = 0\\n    elif number_table[j] == Bingo_3[1]:\\n        Bingo_3[1] = 0\\n    elif number_table[j] == Bingo_3[2]:\\n        Bingo_3[2] = 0\\n\\nif Bingo_1[0] == 0 and Bingo_1[1] == 0 and Bingo_1[2] == 0:\\n    print('Yes')\\nelif Bingo_2[0] == 0 and Bingo_2[1] == 0 and Bingo_2[2] == 0:\\n    print('Yes')\\nelif Bingo_3[0] == 0 and Bingo_3[1] == 0 and Bingo_3[2] == 0:\\n    print('Yes')\\nelif Bingo_1[0] == 0 and Bingo_2[0] == 0 and Bingo_3[0] == 0:\\n    print('Yes')\\nelif Bingo_1[1] == 0 and Bingo_2[1] == 0 and Bingo_3[1] == 0:\\n    print('Yes')\\nelif Bingo_1[2] == 0 and Bingo_2[2] == 0 and Bingo_3[2] == 0:\\n    print('Yes')\\nelif Bingo_1[0] == 0 and Bingo_2[1] == 0 and Bingo_3[2] == 0:\\n    print('Yes')\\nelif Bingo_1[2] == 0 and Bingo_2[1] == 0 and Bingo_3[0] == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"a=[input().split()for _ in range(3)]\\nn=int(input())\\nb= [input() for _ in range(n)]\\na1=[]\\nfor i in range(3):\\n    a1.append(a[0][i])\\nfor i in range(3):\\n    a1.append(a[1][i])\\nfor i in range(3):\\n    a1.append(a[2][i])\\nfor i in range(n):\\n    if b[i] in a1:\\n        w=a1.index(b[i])\\n        a1[w]=\\\"a\\\"\\n    else:\\n        pass\\n\\nif a1[0]==a1[1]==a1[2]==\\\"a\\\" or a1[3]==a1[4]==a1[5]==\\\"a\\\" or a1[6]==a1[7]==a1[8]==\\\"a\\\":\\n    print(\\\"Yes\\\")\\nelse:\\n    if a1[0]==a1[3]==a1[6]==\\\"a\\\" or a1[1]==a1[4]==a1[7]==\\\"a\\\" or a1[2]==a1[5]==a1[8]==\\\"a\\\":\\n        print(\\\"Yes\\\")\\n    else:\\n        if a1[0]==a1[4]==a1[8]==\\\"a\\\" or a1[2]==a1[4]==a1[6]==\\\"a\\\":\\n            print(\\\"Yes\\\")\\n        else:\\n            print(\\\"No\\\")\", \"a = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n\\nfor i in range(n):\\n  for j in range(3):\\n    for k in range(3):\\n      if b[i] == a[j][k]:\\n        a[j][k] = 0\\n\\ndef bingo(board):\\n  if board[0][0] == board[0][1] == board[0][2]:\\n    return True\\n  if board[1][0] == board[1][1] == board[1][2]:\\n    return True\\n  if board[2][0] == board[2][1] == board[2][2]:\\n    return True\\n  if board[0][0] == board[1][0] == board[2][0]:\\n    return True\\n  if board[0][1] == board[1][1] == board[2][1]:\\n    return True\\n  if board[0][2] == board[1][2] == board[2][2]:\\n    return True\\n  if board[0][0] == board[1][1] == board[2][2]:\\n    return True\\n  if board[0][2] == board[1][1] == board[0][2]:\\n    return True\\n  return False\\n\\nif bingo(a):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"l=[]\\nA,B,C=map(int,input().split());l.append(A);l.append(B);l.append(C)\\nD,E,F=map(int,input().split());l.append(D);l.append(E);l.append(F)\\nG,H,I=map(int,input().split());l.append(G);l.append(H);l.append(I)\\nN= int(input())\\nb={0}\\n\\nfor i in range(N):\\n  c=int(input())\\n  if c in l:b.add(c)\\nb.discard(0)\\n\\n\\nfor i in b:\\n  l[l.index(i)]=0\\n\\nif l[0]+l[1]+l[2]==0 or l[3]+l[4]+l[5]==0 or l[6]+l[7]+l[8]==0:print('Yes');return\\nif l[0]+l[3]+l[6]==0 or l[1]+l[4]+l[7]==0 or l[2]+l[5]+l[8]==0:print('Yes');return\\nif l[0]+l[4]+l[8]==0 or l[2]+l[4]+l[6]==0:print('Yes');return\\nprint('No')\", \"#!/usr/bin/env python3\\nimport sys\\n\\nYES = \\\"Yes\\\"  # type: str\\nNO = \\\"No\\\"  # type: str\\n\\n\\ndef solve(A: \\\"List[List[int]]\\\", N: int, b: \\\"List[int]\\\"):\\n    A_ = []\\n    for a_ in A:\\n        A_ += [[a__, False] for a__ in a_]\\n    for b_ in b:\\n        for a__ in A_:\\n            if a__[0] == b_:\\n                a__[1] = True\\n    if (A_[0][1] and ((A_[1][1] and A_[2][1]) or \\\\\\n                        (A_[3][1] and A_[6][1]) or \\\\\\n                        (A_[4][1] and A_[8][1]))) or \\\\\\n            (A_[1][1] and A_[4][1] and A_[7][1]) or \\\\\\n            (A_[2][1] and A_[5][1] and A_[8][1]) or \\\\\\n            (A_[3][1] and A_[4][1] and A_[5][1]) or \\\\\\n            (A_[6][1] and A_[7][1] and A_[8][1]) or \\\\\\n            (A_[2][1] and A_[4][1] and A_[6][1]):\\n        print(YES)\\n    else:\\n        print(NO)\\n    return\\n\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    A = [[int(next(tokens)) for _ in range(3)] for _ in range(3)]  # type: \\\"List[List[int]]\\\"\\n    N = int(next(tokens))  # type: int\\n    b = [int(next(tokens)) for _ in range(N)]  # type: \\\"List[int]\\\"\\n    solve(A, N, b)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\n\\nfor i in b:\\n    for j in range(0,3):\\n        for k in range(0,3):\\n            if i == a[j][k]:\\n                a[j][k] = 0\\n\\n\\nif a[0][0]==0 and a[0][1]==0 and a[0][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[1][0]==0 and a[1][1]==0 and a[1][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[2][0]==0 and a[2][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][0]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][1]==0 and a[1][1]==0 and a[2][1]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][2]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][1]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"a=[[x for x in map(int,input().split())] for _ in range(3)]\\nn=int(input())\\nbingo=[[0]*3 for _ in range(3)]\\nfor k in range(n):\\n  x=int(input())\\n  for i in range(3):\\n    for j in range(3):\\n      if a[i][j]==x:\\n        bingo[i][j]=1\\nfor i in range(3):\\n  if bingo[i]==[1,1,1]:\\n    print('Yes')\\n    return\\n  if [row[i] for row in bingo]==[1,1,1]:\\n    print('Yes')\\n    return\\nif [bingo[i][i] for i in range(3)]==[1,1,1]:\\n  print('Yes')\\n  return\\nif [bingo[i][2-i] for i in range(3)]==[1,1,1]:\\n  print('Yes')\\n  return\\nprint('No')\", \"def main():\\n    A = [list(map(int,input().split())) for i in range(3)]\\n    N = int(input())\\n    b = [int(input()) for _ in range(N)]\\n\\n    for i in range(N):\\n        for j in range(3):\\n            for h in range(3):\\n                if A[j][h] == b[i]:\\n                    A[j][h] = 0\\n\\n    if A[0][0]==0 and A[0][1]==0 and A[0][2]==0:\\n        return 'Yes'\\n    elif A[1][0]==0 and A[1][1]==0 and A[1][2]==0:\\n        return 'Yes'\\n    elif A[2][0]==0 and A[2][1]==0 and A[2][2]==0:\\n        return 'Yes'\\n    elif A[0][0]==0 and A[1][0]==0 and A[2][0]==0:\\n        return 'Yes'\\n    elif A[0][1]==0 and A[1][1]==0 and A[2][1]==0:\\n        return 'Yes'\\n    elif A[0][2]==0 and A[1][2]==0 and A[2][2]==0:\\n        return 'Yes'\\n    elif A[0][0]==0 and A[1][1]==0 and A[2][2]==0:\\n        return 'Yes'\\n    elif A[0][2]==0 and A[1][1]==0 and A[2][0]==0:\\n        return 'Yes'\\n\\n    return ('No')\\n\\nprint((main()))\\n\", \"def ck_bingo(lis):\\n  flg=False\\n  for i in range(0,3):\\n    if lis[i][0]+lis[i][1]+lis[i][2]==3:\\n      flg=True\\n      break\\n    \\n  for j in range(0,3):\\n    if lis[0][j]+lis[1][j]+lis[2][j]==3:\\n      flg=True\\n      break\\n\\n  if lis[0][0]+lis[1][1]+lis[2][2]==3 \\\\\\n  or lis[0][2]+lis[1][1]+lis[2][0]==3:\\n    flg=True\\n  \\n  return flg\\n\\n\\nBingo=[[0] for _ in range(3)]\\nfor b in range(3):\\n  Bingo[b]=list(map(int,input().split()))\\n\\nN=int(input())\\nA=[[0,0,0] for _ in range(3)]\\nAns='No'\\n\\nfor i in range(N):\\n  ball=int(input())\\n  for j in range(3):\\n    for k in range(3):\\n      if ball==Bingo[j][k]:\\n        A[j][k]=1\\n        if ck_bingo(A):\\n          Ans='Yes'\\n          #break\\n    \\nprint(Ans)\\n\", \"def LIHW(h):\\n    return [list(map(int, input().split())) for _ in range(h)]\\n\\n\\ndef LIH(h):\\n    return [int(input()) for _ in range(h)]\\n\\n\\ncard = LIHW(3)\\nN = int(input())\\nnum = LIH(N)\\nbingo = [[0, 0, 0] for _ in range(3)]\\nfor i in num:\\n    for a in range(3):\\n        for b in range(3):\\n            if i == card[a][b]:\\n                bingo[a][b] = 1\\n                break\\nans = \\\"No\\\"\\nfor i in range(3):\\n    if bingo[i][0] == 1 and bingo[i][1] == 1 and bingo[i][2] == 1:\\n        ans = \\\"Yes\\\"\\nfor i in range(3):\\n    if bingo[0][i] == 1 and bingo[1][i] == 1 and bingo[2][i] == 1:\\n        ans = \\\"Yes\\\"\\nif bingo[0][0] == 1 and bingo[1][1] == 1 and bingo[2][2] == 1:\\n    ans = \\\"Yes\\\"\\nif bingo[0][2] == 1 and bingo[1][1] == 1 and bingo[2][0] == 1:\\n    ans = \\\"Yes\\\"\\nprint(ans)\\n\", \"A11,A12,A13 = list(map(int,input().split()))\\nA21,A22,A23 = list(map(int,input().split()))\\nA31,A32,A33 = list(map(int,input().split()))\\n\\nAlist = []\\nAlist.append(A11)\\nAlist.append(A12)\\nAlist.append(A13)\\nAlist.append(A21)\\nAlist.append(A22)\\nAlist.append(A23)\\nAlist.append(A31)\\nAlist.append(A32)\\nAlist.append(A33)\\nbingolist =[0]*9\\n\\nN = int(input())\\n#print (N)\\nfor i in range(N):\\n  b = int(input())\\n  #print (b)\\n  for j in range(len(bingolist)):\\n    if b ==Alist[j]:\\n      bingolist[j] = 1\\n\\nif sum(bingolist[0:3])==3 or sum(bingolist[3:6])==3 or sum(bingolist[6:9])==3 or (bingolist[0]+bingolist[3]+bingolist[6])==3 or (bingolist[1]+bingolist[4]+bingolist[7])==3 or (bingolist[2]+bingolist[5]+bingolist[8])==3 or (bingolist[0]+bingolist[4]+bingolist[8])==3 or (bingolist[2]+bingolist[4]+bingolist[6])==3:\\n  print (\\\"Yes\\\")\\nelse :\\n  print (\\\"No\\\")\\n#print (bingolist[0:3])\\n#print (bingolist[3:6])\\n#print (bingolist[6:9])\\n#print (bingolist)\\n\", \"A = [list(map(int, input().split())) for i in range(3)]\\nN = int(input())\\nB = [int(input())for i in range(N)]\\nsheet = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\n\\nfor i in range(N):\\n  for j in range(3):\\n    for k in range(3):\\n      if B[i] == A[j][k]:\\n        sheet[j][k] = 1\\nif sheet[0][0] == 1 and sheet[0][1] == 1 and sheet[0][2] == 1:\\n  print('Yes')\\nelif sheet[1][0] == 1 and sheet[1][1] == 1 and sheet[1][2] == 1:\\n  print('Yes')\\nelif sheet[2][0] == 1 and sheet[2][1] == 1 and sheet[2][2] == 1:\\n  print('Yes')\\nelif sheet[0][0] == 1 and sheet[1][0] == 1 and sheet[2][0] == 1:\\n  print('Yes')\\nelif sheet[0][1] == 1 and sheet[1][1] == 1 and sheet[2][1] == 1:\\n  print('Yes')\\nelif sheet[0][2] == 1 and sheet[1][2] == 1 and sheet[2][2] == 1:\\n  print('Yes')\\nelif sheet[0][0] == 1 and sheet[1][1] == 1 and sheet[2][2] == 1:\\n  print('Yes')\\nelif sheet[2][0] == 1 and sheet[1][1] == 1 and sheet[0][2] == 1:\\n  print('Yes')\\nelse:\\n  print('No')\", \"a_3_3 = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb_n = [int(input()) for _ in range(n)]\\n\\n\\nclass Info:\\n    def __init__(self, a_3_3, n, b_n):\\n        self.a_3_3 = a_3_3\\n        self.n = n\\n        self.b_n = b_n\\n\\n    @staticmethod\\n    def setting():\\n        for num in b_n:\\n            for line in a_3_3:\\n                if num in line:\\n                    line[line.index(num)] = 0\\n        return a_3_3\\n\\n    @staticmethod\\n    def result():\\n        diagonal_lurd = a_3_3[0][0] + a_3_3[1][1] + a_3_3[2][2]\\n        diagonal_ldru = a_3_3[2][0] + a_3_3[1][1] + a_3_3[0][2]\\n\\n        for index, line in enumerate(a_3_3):\\n            row_sum = sum(line)\\n            col_sum = a_3_3[0][index] + a_3_3[1][index] + a_3_3[2][index]\\n            if diagonal_lurd == 0 or diagonal_ldru == 0 or row_sum == 0 or col_sum == 0:\\n                print('Yes')\\n                return\\n\\n        print('No')\\n\\n\\ninfo = Info(a_3_3, n, b_n)\\ninfo.setting()\\ninfo.result()\\n\", \"a = [list(map(int,input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n\\nc = [[0]*3 for _ in range(3)]\\n\\nfor k in range(n):\\n  for i in range(3):\\n    for j in range(3):\\n      if a[i][j] == b[k]:\\n        c[i][j] += 1\\n        \\nfor i in range(3):\\n  if c[0][i] == c[1][i] == c[2][i] == 1:\\n    print(\\\"Yes\\\")\\n    return\\nfor j in range(3):\\n  if c[j][0] == c[j][1] == c[j][2] == 1:\\n    print(\\\"Yes\\\")\\n    return\\nif c[0][0] == c[1][1] == c[2][2] == 1:\\n  print(\\\"Yes\\\")\\n  return\\nif c[0][2] == c[1][1] == c[2][0] == 1:\\n  print(\\\"Yes\\\")\\n  return\\nprint(\\\"No\\\")\", \"A_11,A_12,A_13=list(map(int,input().split()))\\nA_21,A_22,A_23=list(map(int,input().split()))\\nA_31,A_32,A_33=list(map(int,input().split()))\\nN=int(input())\\nLi=[A_11,A_12,A_13,A_21,A_22,A_23,A_31,A_32,A_33]\\nfor i in range(N):\\n  b=int(input())\\n  if b in Li:\\n    Num=Li.index(b)\\n    Li[Num]=0\\n\\nif Li[0]==Li[1]==Li[2]==0 or Li[3]==Li[4]==Li[5]==0 or Li[6]==Li[7]==Li[8]:\\n  print(\\\"Yes\\\")\\nelif Li[0]==Li[3]==Li[6]==0 or Li[1]==Li[4]==Li[7]==0 or Li[2]==Li[5]==Li[8]:\\n  print(\\\"Yes\\\")\\nelif Li[0]==Li[4]==Li[8]==0 or Li[2]==Li[4]==Li[6]==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nfor j in range(3): A.append([A[i][j] for i in range(3)])\\nA.append([A[0][0], A[1][1], A[2][2]])\\nA.append([A[2][0], A[1][1], A[0][2]])\\nd = {int(input()): 0 for _ in range(int(input()))}\\nprint(\\\"YNeos\\\"[all(any(d.get(v, 1) for v in r) for r in A)::2])\", \"def main():\\n    card = [[int(j) for j in input().split()] for i in range(3)]\\n    n = int(input())\\n    def punch(v):\\n        for i in range(len(card)):\\n            for j in range(len(card[i])):\\n                if card[i][j] == v:\\n                    card[i][j] = True\\n        return card\\n\\n    def check(board):\\n        for i in range(len(board)):\\n            l = list(set(board[i]))\\n            if len(l)==1 and l[0] ==True:\\n                return True\\n        for i in range(len(board[0])):\\n            if board[0][i] == board[1][i]==board[2][i] == True:\\n                return True\\n        if board[0][0] == board[1][1]==board[2][2] == True:\\n            return True\\n        if board[0][2] == board[1][1]==board[2][0] == True:\\n            return True\\n\\n    for _ in range(n):\\n        num = int(input())\\n        if check(punch(num)):\\n            return \\\"Yes\\\"\\n    return \\\"No\\\"\\n\\n\\n    print(card)\\n\\ndef __starting_point():\\n    print(main())\\n__starting_point()\", \"import numpy as np\\n\\nCARD_SIZE = 3\\n\\n\\ndef solve(card, called_numbers):\\n    checked_card = np.vectorize(lambda n: n in called_numbers)(card)\\n\\n    for l in checked_card:\\n        if all(l):\\n            return True\\n\\n    for l in zip(*checked_card):\\n        if all(l):\\n            return True\\n\\n    if all([checked_card[n][n] for n in range(CARD_SIZE)]):\\n        return True\\n    if all([checked_card[n][CARD_SIZE - n - 1] for n in range(CARD_SIZE)]):\\n        return True\\n\\n    return False\\n\\n\\ndef resolve():\\n    card = [[int(row) for row in input().split()] for _ in range(CARD_SIZE)]\\n\\n    N = int(input())\\n    called_numbers = {int(input()) for n in range(N)}\\n\\n    ret = solve(card, called_numbers)\\n\\n    print(\\\"Yes\\\" if ret else \\\"No\\\")\\n\\n\\ndef __starting_point():\\n    resolve()\\n__starting_point()\", \"A = [[int(i) for i in input().split()] for j in range(3)]\\nN = int(input())\\nb = [int(input()) for i in range(N)]\\nfor i in range(N):\\n    for j in range(3):\\n        for k in range(3):\\n            if(b[i] == A[j][k]):\\n                A[j][k] = 0\\nfor i in range(3):\\n    if(A[i][0] == A[i][1] and A[i][1] == A[i][2]):\\n        print(\\\"Yes\\\")\\n        return\\n    if(A[0][i] == A[1][i] and A[1][i] == A[2][i]):\\n        print(\\\"Yes\\\")\\n        return\\nif(A[0][0] == A[1][1] and A[1][1] == A[2][2]):\\n    print(\\\"Yes\\\")\\n    return\\nif(A[0][2] == A[1][1] and A[1][1] == A[2][0]):\\n    print(\\\"Yes\\\")\\n    return\\nprint(\\\"No\\\")\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\n\\nfor i in b:\\n    for j in range(0,3):\\n        for k in range(0,3):\\n            if i == a[j][k]:\\n                a[j][k] = 0\\n\\n\\nif a[0][0]==0 and a[0][1]==0 and a[0][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[1][0]==0 and a[1][1]==0 and a[1][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[2][0]==0 and a[2][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][0]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][1]==0 and a[1][1]==0 and a[2][1]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][2]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][1]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"from typing import List\\n\\n\\ndef answer(a: List[List[int]], n: int, b: List[int]) -> str:\\n    bingo_card = list([i[j] in b for i in a] for j in range(3))\\n    for i in range(2):\\n        for j in bingo_card:\\n            if all(j):\\n                return 'Yes'\\n        if i == 0:\\n            bingo_card = list(zip(*bingo_card))\\n\\n    if bingo_card[0][0] and bingo_card[1][1] and bingo_card[2][2]:\\n        return 'Yes'\\n    if bingo_card[0][2] and bingo_card[1][1] and bingo_card[2][0]:\\n        return 'Yes'\\n\\n    return 'No'\\n\\n\\ndef main():\\n    a = [list(map(int, input().split())) for _ in range(3)]\\n    n = int(input())\\n    b = list(int(input()) for _ in range(n))\\n    print(answer(a, n, b))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def check(arr):\\n    # \\u6a2a\\u30c1\\u30a7\\u30c3\\u30af\\n    for i in range(len(arr)):\\n        if arr[i] == [\\\"x\\\", \\\"x\\\", \\\"x\\\"]:\\n            return True\\n\\n    # \\u7e26\\u30c1\\u30a7\\u30c3\\u30af\\n    for i in range(3):\\n        if arr[0][i] == \\\"x\\\" and arr[1][i] == \\\"x\\\" and arr[2][i] == \\\"x\\\":\\n            return True\\n\\n    # \\u659c\\u3081\\u30c1\\u30a7\\u30c3\\u30af\\n    if arr[0][0] == \\\"x\\\" and arr[1][1] == \\\"x\\\" and arr[2][2] == \\\"x\\\":\\n        return True\\n    elif arr[0][2] == \\\"x\\\" and arr[1][1] == \\\"x\\\" and arr[2][0] == \\\"x\\\":\\n        return True\\n\\n    return False\\n\\narr = []\\nfor _ in range(3):\\n    arr.append(list(map(int, input().split(' '))))\\n\\nn = int(input())\\nfor _ in range(n):\\n    b = int(input())\\n    for i in range(len(arr)):\\n        tmp_arr = []\\n        for ele in arr[i]:\\n            if b == ele:\\n                tmp_arr.append(\\\"x\\\")\\n            else:\\n                tmp_arr.append(ele)\\n        arr[i] = tmp_arr\\n\\nif check(arr) == True:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"A = [0 for i in range(9)]\\nfor i in range(3):\\n  A[3*i], A[3*i+1], A[3*i+2] = map(int, input().split())\\nN = int(input())\\nb = [0 for i in range(N)]\\nfor i in range(N):\\n  b[i] = int(input())\\n\\n#Check matching numbers\\nfor i in range(9):\\n  for j in range(N):\\n    if A[i] == b[j]:\\n      A[i] = 1\\n\\n# Check bingo or not\\nflag = 0\\n# Check rows\\nfor i in [0, 3, 6]:\\n  if A[i]==A[i+1] and A[i+1]==A[i+2]:\\n    flag += 1\\n# Check colums\\nfor j in range(3):\\n  if A[j]==A[j+3] and A[j+3]==A[j+6]:\\n    flag += 1\\n# Check naname?\\nif (A[0]==A[4] and A[4]==A[8]) or (A[2]==A[4] and A[4]==A[6]):\\n  flag += 1\\n\\nif flag >= 1:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"A = {}\\nfor i in range(3) :\\n    a1,a2,a3 = map(int, input().split())\\n    A[a1] = (i,0)\\n    A[a2] = (i,1)\\n    A[a3] = (i,2)\\n\\nN = int(input())\\nA2 = [[False,False,False] for i in range(3)]\\n\\nfor i in range(N):\\n    b = int(input())\\n    if(b not in A) :\\n        continue\\n    r,c = map(int,A[b])\\n    A2[r][c] = True\\n\\ndef isBingo(table) :\\n    for r in range(3) :\\n        if(table[r][0] and table[r][1] and table[r][2]) :\\n            return True\\n    for c in range(3) :\\n        if(table[0][c] and table[1][c] and table[2][c]) :\\n            return True\\n    if(table[0][0] and table[1][1] and table[2][2]) :\\n        return True\\n    if(table[0][2] and table[1][1] and table[2][0]) :\\n        return True\\n    return False\\n\\nif(isBingo(A2)) :\\n    print(\\\"Yes\\\")\\nelse :\\n    print(\\\"No\\\")\", \"A = [list(map(int,input().split())) for _ in range(3)]\\nN = int(input())\\nb = [int(input()) for _ in range(N)]\\nc = [[0]*3 for _ in range(3)]\\nfor x in b:\\n  for i in range(3):\\n    for j in range(3):\\n      if A[i][j] == x:\\n        c[i][j] = 1\\n\\nif c[0] == [1,1,1] or c[1] == [1,1,1] or c[2] == [1,1,1]:\\n  print(\\\"Yes\\\")\\nelif [c[0][0], c[1][0], c[2][0]] == [1,1,1] or [c[0][1], c[1][1], c[2][1]] == [1,1,1] or [c[0][2], c[1][2], c[2][2]] == [1,1,1]:\\n  print(\\\"Yes\\\")\\nelif [c[0][0], c[1][1], c[2][2]] == [1,1,1] or [c[2][0], c[1][1], c[0][2]] == [1,1,1]:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"A=[list(map(int,input().split())) for i in range(3)]\\nn=int(input())\\nb=[int(input()) for i in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(n):\\n            if A[i][j]==b[k]:\\n                A[i][j]=-1\\nif A[0][0]==-1 and A[1][1]==-1 and A[2][2]==-1:\\n    print(\\\"Yes\\\")\\n    return\\nelif A[0][2]==-1 and A[1][1]==-1 and A[2][0]==-1:\\n    print(\\\"Yes\\\")\\n    return\\nfor i in range(3):\\n    total=0\\n    if A[i].count(-1)==3:\\n        print(\\\"Yes\\\")\\n        return\\n    for j in range(3):\\n        if A[j][i]==-1:\\n            total+=1\\n    if total==3:\\n        print(\\\"Yes\\\")\\n        return\\nprint(\\\"No\\\")\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn =int(input())\\n\\nfor k in range(n):\\n    b = int(input())\\n    for i in range(3):\\n        for j in range(3):\\n            if a[i][j] == b:\\n                a[i][j] = 0\\n    row0 = a[0] == [0, 0, 0]\\n    row1 = a[1] == [0, 0, 0]\\n    row2 = a[2] == [0, 0, 0]\\n    colum0 = [a[0][0], a[1][0], a[2][0]] == [0, 0, 0]\\n    colum1 = [a[0][1], a[1][1], a[2][1]] == [0, 0, 0]\\n    colum2 = [a[0][2], a[1][2], a[2][2]] == [0, 0, 0]\\n    diag0 = [a[0][0], a[1][1], a[2][2]] == [0, 0, 0]\\n    diag1 = [a[2][0], a[1][1], a[0][2]] == [0, 0, 0]\\n    if row0 or row1 or row2 or colum0 or colum1 or colum2 or diag0 or diag1:\\n        print('Yes')\\n        break\\nelse:\\n    print('No')\", \"def main():\\n  A = []\\n  C = [False] * 9\\n  for i in range(3):\\n    a0, a1, a2 = map(int, input().split())\\n    A.append(a0)\\n    A.append(a1)\\n    A.append(a2)\\n    \\n  N = int(input())\\n  for i in range(N):\\n    b = int(input())\\n    if b in A:\\n      C[A.index(b)] = True\\n\\n  for i in range(3):\\n    if C[0+3*i] and C[1+3*i] and C[2+3*i]:\\n      print(\\\"Yes\\\")\\n      return\\n\\n  for i in range(3):\\n    if C[i] and C[i+3] and C[i+6]:\\n      print(\\\"Yes\\\")\\n      return\\n\\n  if C[0] and C[4] and C[8]:\\n    print(\\\"Yes\\\")\\n    return\\n\\n  if C[2] and C[4] and C[6]:\\n    print(\\\"Yes\\\")\\n    return\\n\\n  print(\\\"No\\\")\\n\\n    \\nmain()\", \"a = [list(map(int,input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n#\\u884c\\u306e\\u5224\\u5b9a\\nfor i in range(3):\\n  for j in range(3):\\n    if a[i][j] not in b:\\n      break\\n    elif j == 2:\\n      print(\\\"Yes\\\")\\n      return\\n#\\u5217\\u306e\\u5224\\u5b9a\\nfor i in range(3):\\n  for j in range(3):\\n    if a[j][i] not in b:\\n      break\\n    elif j == 2:\\n      print(\\\"Yes\\\")\\n      return\\n#\\u306a\\u306a\\u3081\\u306e\\u5224\\u5b9a\\nif a[0][0] in b and a[1][1] in b and a[2][2] in b:\\n  print(\\\"Yes\\\")\\n  return\\nif a[0][2] in b and a[1][1] in b and a[2][0] in b:\\n  print(\\\"Yes\\\")\\n  return\\nprint(\\\"No\\\")\", \"l = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\ns = set([int(input()) for j in range(n)])\\n\\nans = \\\"No\\\"\\n\\nfor i in range(3):\\n    if l[i][0] in s and l[i][1] in s and l[i][2] in s:\\n        ans = \\\"Yes\\\"\\n\\nfor i in range(3):\\n    if l[0][i] in s and l[1][i] in s and l[2][i] in s:\\n        ans = \\\"Yes\\\"\\n\\nif l[0][0] in s and l[1][1] in s and l[2][2] in s:\\n    ans = \\\"Yes\\\"\\nelif l[0][2] in s and l[1][1] in s and l[2][0] in s:\\n    ans = \\\"Yes\\\"\\n\\nprint(ans)\", \"import math\\ndef i_input(): return int(input())\\n\\n\\ndef i_map(): return map(int, input().split())\\n\\n\\ndef i_list(): return list(map(int, input().split()))\\n\\n\\ndef i_row(N): return [int(input()) for _ in range(N)]\\n\\n\\ndef i_row_list(N): return [list(map(int, input().split())) for _ in range(N)]\\n\\naaa= i_row_list(3)\\nn=i_input()\\nb=i_row(n)\\nans='No'\\nfor i in range(3):\\n    for j in range(3):\\n        if aaa[i][j] in b:\\n            aaa[i][j]=0\\nxlos1=0\\nxlos2=0\\nfor i in range(3):\\n    colm=0\\n    rows=0\\n\\n    for j in range(3):\\n        colm+=aaa[i][j]\\n        rows+=aaa[j][i]\\n    xlos1+=aaa[i][i]\\n    xlos2+=aaa[2-i][i]\\n    if colm==0 or rows==0:\\n        ans='Yes'\\n        break\\nif ans!='Yes':\\n    if xlos1==0 or xlos2==0:\\n        ans='Yes'\\n\\n\\nprint(ans)\", \"def Judge(a):\\n  col=[]\\n  diag1=0\\n  diag2=0\\n\\n  for i in range(3):\\n    if(a[i].count(0)==3):\\n      return 1\\n      break\\n    if(a[i][0]==0):\\n      col.append(0)\\n    if(a[i][1]==0):\\n      col.append(1)\\n    if(a[i][2]==0):\\n      col.append(2)\\n    if(a[i][i]==0):\\n      diag1+=1\\n    if(a[i][-(i+1)]==0):\\n      diag2+=1\\n  if(diag1==3 or diag2==3):\\n    return 1\\n  if(col.count(0)==3 or col.count(1)==3 or col.count(2)==3):\\n    return 1\\n  return 0\\n\\n\\na=[]\\nfor i in range(3):\\n  a.append(list(map(int,input().split())))\\nn=int(input())\\nfor i in range(n):\\n  b=int(input())\\n  for j in range(3):\\n    for k in range(3):\\n      if(b==a[j][k]):\\n        a[j][k]=0\\njudge=Judge(a)\\nif(judge==1):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\ncdl = 0\\ncdr = 0\\nfor i in range(3):\\n    cr = 0\\n    cc = 0\\n    for j in range(3):\\n        if A[i][j] in b:\\n            cr += 1\\n        if A[j][i] in b:\\n            cc += 1\\n        if i == j and A[i][j] in b:\\n            cdl += 1\\n        if i+j==2 and A[i][j] in b:\\n            cdr += 1\\n\\n    if cr == 3 or cc == 3 or cdl == 3 or cdr ==3:\\n        print('Yes')\\n        return\\nprint('No')\", \"def resolve():\\n\\ta = []\\n\\tbingo = [(0,3,6),(1,4,7),(2,5,8),(0,1,2),(3,4,5)\\n\\t\\t\\t ,(6,7,8),(0,4,8),(2,4,6)]\\n\\tfor _ in range(3):\\n\\t\\ta += list(map(int,input().split()))\\n\\tfor i in range(int(input())):\\n\\t\\tr = int(input())\\n\\t\\tif r in a:\\n\\t\\t\\ta[a.index(r)]=0\\n\\tans = 'No'\\n\\tfor i in bingo:\\n\\t\\tif a[i[0]] == 0 and a[i[1]]==0 and a[i[2]]==0:\\n\\t\\t\\tans ='Yes'\\n\\tprint(ans)\\nresolve()\", \"# coding=utf-8\\nimport sys\\n\\ndef __starting_point():\\n    bingo = [[0] * 3 for i in range(3)]\\n\\n    ans = [[0] * 3 for i in range(3)]\\n    for i in range(3):\\n        temp = list(map(int, input().split()))\\n        for j in range(3):\\n            bingo[i][j] = temp[j]\\n\\n    N = int(input())\\n\\n    for i in range(N):\\n        b = int(input())\\n        for j in range(3):\\n            for k in range(3):\\n                if bingo[j][k] == b:\\n                    ans[j][k] = 1\\n\\n    #print(bingo, ans)\\n\\n\\n    for i in range(3):\\n        if (ans[0][i] + ans[1][i] + ans[2][i]) == 3:\\n            print(\\\"Yes\\\")\\n            return\\n\\n    for i in range(3):\\n        if (ans[i][0] + ans[i][1] + ans[i][2]) == 3:\\n            print(\\\"Yes\\\")\\n            return\\n\\n    #naname\\n    if (ans[0][0] + ans[1][1] + ans[2][2]) == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\n    if (ans[0][2] + ans[1][1] + ans[2][0]) == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\n    print('No')\\n\\n__starting_point()\", \"a = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        if (a[i][j] in b):\\n            a[i][j] = 0\\n#print(a)\\ntnp = 0\\nfor i in range(3):\\n    if (sum(a[i])==0):\\n        tnp += 1\\nfor i in range(3):\\n    if (a[0][i]+a[1][i]+a[2][i]==0):\\n        tnp += 1\\nif (a[0][0]+a[1][1]+a[2][2]==0):\\n    tnp += 1\\nif (a[0][2] + a[1][1] + a[2][0]==0):\\n    tnp += 1\\nif (tnp>0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def main():\\n    a = [list(map(int, input().split())) for _ in range(3)]\\n    n = int(input())\\n    b = [int(input()) for _ in range(n)]\\n    if a[0][0] in b and a[0][1] in b and a[0][2] in b or \\\\\\n        a[1][0] in b and a[1][1] in b and a[1][2] in b or \\\\\\n            a[2][0] in b and a[2][1] in b and a[2][2] in b or \\\\\\n                a[0][0] in b and a[1][0] in b and a[2][0] in b or \\\\\\n                    a[0][1] in b and a[1][1] in b and a[2][1] in b or \\\\\\n                        a[0][2] in b and a[1][2] in b and a[2][2] in b or \\\\\\n                            a[0][0] in b and a[1][1] in b and a[2][2] in b or \\\\\\n                                a[0][2] in b and a[1][1] in b and a[2][0] in b:\\n                                    print('Yes')\\n    else:\\n        print('No')\\n        \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"a = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\nfor i in range(3):\\n  for j in range(3):\\n    if a[i][j] in b:\\n      a[i][j] = \\\"o\\\"\\nfor i in range(3):\\n  if a[i][0] == a[i][1] == a[i][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][i] == a[1][i] == a[2][i]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][0] == a[1][1] == a[2][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][2] == a[1][1] == a[2][0]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif i == 2:\\n    print(\\\"No\\\")\", \"a = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\nfor i in range(3):\\n  for j in range(3):\\n    if a[i][j] in b:\\n      a[i][j] = \\\"o\\\"\\nfor i in range(3):\\n  if a[i][0] == a[i][1] == a[i][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][i] == a[1][i] == a[2][i]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][0] == a[1][1] == a[2][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][2] == a[1][1] == a[2][0]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif i == 2:\\n    print(\\\"No\\\")\", \"arr1 = list(map(int, input().split()))\\narr2 = list(map(int, input().split()))\\narr3 = list(map(int, input().split()))\\nn = int(input())\\nfor _ in range(n):\\n    x = int(input())\\n    if x in arr1:\\n        arr1[arr1.index(x)] -= x\\n    elif x in arr2:\\n        arr2[arr2.index(x)] -= x\\n    elif x in arr3:\\n        arr3[arr3.index(x)] -= x\\n    if _ >= 3:\\n        if arr1[0] == arr1[1] and arr1[1] == arr1[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        if arr2[0] == arr2[1] and arr2[1] == arr2[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        if arr3[0] == arr3[1] and arr3[1] == arr3[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        for jj in range(3):\\n            if arr1[jj] == arr2[jj] and arr2[jj] == arr3[jj]:\\n                print(\\\"Yes\\\")\\n                return\\n        if arr1[0] == arr2[1] and arr2[1] == arr3[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        if arr1[2] == arr2[1] and arr2[1] == arr3[0]:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"a = input()\\na = a.split()\\nb = input()\\nb = b.split()\\nc = input()\\nc = c.split()\\nd = [a[0],b[0],c[0]]\\ne = [a[1],b[1],c[1]]\\nf = [a[2],b[2],c[2]]\\ng = [a[0],b[1],c[2]]\\nh = [a[2],b[1],c[0]]\\nn = int(input())\\nfor i in range(n):\\n    j = int(input())\\n    for k in range(3):\\n        if int(a[k])==j:\\n            a.pop(k)\\n            a.insert(k,0)\\n        if int(b[k])==j:\\n            b.pop(k)\\n            b.insert(k,0)\\n        if int(c[k])==j:\\n            c.pop(k)\\n            c.insert(k,0)\\n        if int(d[k])==j:\\n            d.pop(k)\\n            d.insert(k,0)\\n        if int(e[k])==j:\\n            e.pop(k)\\n            e.insert(k,0)\\n        if int(f[k])==j:\\n            f.pop(k)\\n            f.insert(k,0)\\n        if int(g[k])==j:\\n            g.pop(k)\\n            g.insert(k,0)\\n        if int(h[k])==j:\\n            h.pop(k)\\n            h.insert(k,0)\\nif a == [0,0,0] or b == [0,0,0] or c == [0,0,0] or d == [0,0,0] or e == [0,0,0] or f == [0,0,0] or g == [0,0,0] or h == [0,0,0]:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"A = [list(map(int,input().split())) for i in range(3)]\\nN = int(input())\\nfor i in range(N):\\n    b = int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if A[j][k] == b:\\n                A[j][k] = 0\\nans = \\\"No\\\"\\nfor i in range(3):\\n    if A[i] == [0,0,0]:\\n        ans = \\\"Yes\\\"\\n        break\\n    for j in range(3):\\n        if A[j][i] != 0:\\n            break\\n    else:\\n        ans = \\\"Yes\\\"\\n        break\\nfor i in range(3):\\n    if A[i][i] != 0:\\n        break\\nelse:\\n    ans = \\\"Yes\\\"\\nif A[0][2] == 0 and A[1][1] == 0 and A[2][0] == 0:\\n    ans = \\\"Yes\\\"\\nprint(ans)\", \"A = []\\nP = ['o']*9\\nfor i in range(3):\\n    a = [int(i) for i in input().split()]\\n    for j in range(3):\\n        A.append(a[j])\\n\\nN = int(input())\\nfor i in range(N):\\n    b = int(input())\\n    for j in range(9):\\n        if A[j] == b:\\n            P[j] = 'x'\\n\\nt = 0\\nfor i in range(3):\\n    if (P[i] == P[i+3] == P[i+6] == 'x') or (P[3*i] == P[3*i+1] == P[3*i+2] == 'x'):\\n        t += 1\\n        break\\nif (P[0] == P[4] == P[8] == 'x') or (P[2] == P[4] == P[6] == 'x'):\\n    t += 1\\n\\nif t == 0:\\n    print('No')\\nelse:\\n    print('Yes')\", \"import numpy as np\\n\\narr = np.array([list(map(int, input().split())) for _ in range(3)])\\n\\n\\nn = int(input())\\n\\nfor _ in range(n):\\n    b = int(input())\\n    arr[np.where(arr == b)] = 0\\n\\nans1 = (np.sum(arr, axis=0) == 0).sum() >= 1\\nans2 = (np.sum(arr, axis=1) == 0).sum() >= 1\\nans3 = (np.diag(arr) == 0).sum() == 3\\nans4 = (np.diag(np.rot90(arr)) == 0).sum() == 3\\n\\nprint(\\\"Yes\\\" if ans1 or ans2 or ans3 or ans4 else \\\"No\\\")\", \"A11,A12,A13 = list(map(int,input().split()))\\nA21,A22,A23 = list(map(int,input().split()))\\nA31,A32,A33 = list(map(int,input().split()))\\nA = [[A11,A12,A13],[A21,A22,A23],[A31,A32,A33]]\\n\\nN = int(input())\\nb = [int(input()) for _ in range(N)]\\n\\nfor i in range(3):\\n    for j in range(3):\\n        if A[i][j] in b:\\n            A[i][j] = 'YES'\\n\\n\\nif A[1][1]=='YES':\\n    if A[1][0]==A[1][2]=='YES' or A[0][1]==A[2][1]=='YES' or A[0][0]==A[2][2]=='YES' or A[0][2]==A[2][0]=='YES':\\n        print('Yes')\\n    else:\\n        print('No')\\n\\nelse:\\n    if A[0][0]==A[0][1]==A[0][2]=='YES' or A[0][0]==A[1][0]==A[2][0]=='YES' or A[2][0]==A[2][1]==A[2][2]=='YES' or A[0][2]==A[1][2]==A[2][2]=='YES':\\n        print('Yes')\\n\\n    else:\\n        print('No')\\n\\n\\n\", \"l = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = list(int(input()) for _ in range(n))\\nfor i in range(3) :\\n    for j in range(3) :\\n        for k in range(n) :\\n            if l[i][j] == b[k] :\\n                l[i][j] = 0\\n\\nfor i in range(3) :\\n    if l[i][0] + l[i][1] + l[i][2] == 0 :\\n        print('Yes')\\n        return\\n    if l[0][i] + l[1][i] + l[2][i] == 0 :\\n        print('Yes')\\n        return\\n    if l[0][0] + l[1][1] + l[2][2] == 0 :\\n        print('Yes')\\n        return\\n    if  l[0][2] + l[1][1] + l[2][0] == 0 :\\n        print('Yes')\\n        return\\nprint('No')\", \"bingo = []\\nkiroku = [[0,0,0] for i in range(3)]\\nfor i in range(3):\\n    a,b,c = map(int,input().split())\\n    bingo.append([a,b,c])\\n\\nn =  int(input())\\nfor j in range(n):\\n    num = int(input())\\n    for k in range(3):\\n        for l in range(3):\\n            if bingo[k][l] == num:\\n                kiroku[k][l] = 1\\nans = 0\\n\\nfor i in range(3):\\n    if (kiroku[i][0] == kiroku[i][1] == kiroku[i][2] == 1) or (kiroku[0][i] == kiroku[1][i] == kiroku[2][i] == 1):\\n        ans = 1\\n        break\\nif (kiroku[0][0] == kiroku[1][1] == kiroku[2][2] == 1) or (kiroku[0][2] == kiroku[1][1] == kiroku[2][0] == 1):\\n    ans = 1\\n\\n\\nif ans == 1:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"a=[list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))]\\nN=int(input())\\nb=list()\\nfor i in range(0,N):\\n    b.append(int(input()))\\nfor j in range(0,3):\\n    for k in range(0,3):\\n        for i in range(0,N):\\n            if a[j][k]==b[i]:\\n                a[j][k]=0\\nfor i in range(0,3):\\n    if a[i][0]==a[i][1] and a[i][1]==a[i][2]:\\n        print(\\\"Yes\\\")\\n        break\\n    elif a[0][i]==a[1][i] and a[1][i]==a[2][i]:\\n        print(\\\"Yes\\\")\\n        break\\n    elif a[0][0]==a[1][1] and a[1][1]==a[2][2]:\\n        print(\\\"Yes\\\")\\n        break\\n    elif a[2][0]==a[1][1] and a[1][1]==a[0][2]:\\n        print(\\\"Yes\\\")\\n        break\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"l = [ list(map(int,input().split(\\\" \\\"))) for i in range(3)]\\nn=int(input())\\nfor i in range(n):\\n    b=int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if l[j][k]==b:\\n                l[j][k]=-1\\nif l[0][0]==-1 and l[0][1]==-1 and l[0][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[1][0]==-1 and l[1][1]==-1 and l[1][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[2][0]==-1 and l[2][1]==-1 and l[2][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][0]==-1 and l[1][0]==-1 and l[2][0]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][1]==-1 and l[1][1]==-1 and l[2][1]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][2]==-1 and l[1][2]==-1 and l[2][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][0]==-1 and l[1][1]==-1 and l[2][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][2]==-1 and l[1][1]==-1 and l[2][0]==-1:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nbingo = []\\nfor _ in range(3):\\n    bingo.append(list(map(int, input().split())))\\n\\nN = int(input())\\nnums = []\\nfor _ in range(N):\\n    nums.append(int(input()))\\n\\nfor num in nums:\\n    for i in range(3):\\n        for j in range(3):\\n            if bingo[i][j] == num:\\n                bingo[i][j] = -1\\n\\nfor i in range(3):\\n    if sum(bingo[i]) == -3:\\n        print(\\\"Yes\\\")\\n        return\\n    tmp = 0\\n    for j in range(3):\\n        tmp += bingo[j][i]\\n    if tmp == -3:\\n        print(\\\"Yes\\\")\\n        return\\nif bingo[0][0] == -1 and bingo[1][1] == -1 and bingo[2][2] == -1:\\n    print(\\\"Yes\\\")\\n    return\\nif bingo[0][2] == -1 and bingo[1][1] == -1 and bingo[0][2] == -1:\\n    print(\\\"Yes\\\")\\n    return\\n\\nprint(\\\"No\\\")\", \"A11,A12,A13 = map(int,input().split())\\nA21,A22,A23 = map(int,input().split())\\nA31,A32,A33 = map(int,input().split())\\nA =[[A11,A12,A13],[A21,A22,A23],[A31,A32,A33]]\\nN =int(input())\\nb = []\\nfor x in range(N):\\n    b.append(int(input()))\\n    for i in range(3):\\n        for j in range(3):\\n            A[i][j] = 'YES' if b[x] == A[i][j] else A[i][j]\\nif A[0][0]==A[0][1]==A[0][2]=='YES' or A[1][0]==A[1][1]==A[1][2]=='YES' or A[2][0]==A[2][1]==A[2][2]=='YES' or \\\\\\nA[0][0]==A[1][0]==A[2][0]=='YES' or A[0][1]==A[1][1]==A[2][1]=='YES' or A[0][2]==A[1][2]==A[2][2]=='YES' or \\\\\\nA[0][0]==A[1][1]==A[2][2]=='YES' or A[0][2]==A[1][1]==A[2][0]=='YES' :\\n    print('Yes')\\nelse :\\n    print('No')\", \"table=[[0]*3 for _ in range(3)]\\nA=[list(map(int,input().split())) for _ in range(3)]\\nA=sum(A,[])\\nN=int(input())\\nB=[int(input()) for _ in range(N)]\\n\\nfor b in B:\\n    tmp=[i for i,x in enumerate(A) if x==b]\\n    for t in tmp:\\n        table[t//3][t%3]=1\\n\\nflag=False\\nn1,n2=0,0\\nfor i in range(3):\\n    if sum(table[i])==3: flag=True\\n    if sum([table[j][i] for j in range(3)])==3: flag=True\\n    n1+=table[i][i]\\n    n2+=table[i][2-i]\\nif n1==3 or n2==3: flag=True\\nif flag: print('Yes')\\nelse: print('No')\\n\", \"a,b,c = list(map(int,input().split()))\\nd,e,f = list(map(int,input().split()))\\ng,h,i = list(map(int,input().split()))\\n\\nx = []\\ny = [a,b,c,d,e,f,g,h,i]\\n\\nn = int(input())\\nfor s in range(n):\\n  x.append(int(input()))\\n\\nfor m in range(9):\\n  if y[m] in x:\\n      y[m] = 0\\n\\nif y[0] == y[1] == y[2] == 0:\\n    print(\\\"Yes\\\")\\nelif y[3] == y[4] == y[5] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[6] == y[7] == y[8] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[0] == y[3] == y[6] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[1] == y[4] == y[7] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[2] == y[5] == y[8] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[0] == y[4] == y[8] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[2] == y[4] == y[6] == 0:\\n    print(\\\"Yes\\\")\\n\\nelse:\\n\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\n\\nA1=np.array(list(map(int,input().split())))\\nA2=np.array(list(map(int,input().split())))\\nA3=np.array(list(map(int,input().split())))\\nA=np.concatenate([A1,A2,A3]).reshape(3,3)\\n\\nN=int(input())\\n\\nfor i in range(N):\\n    b=int(input())\\n    A[np.where(A==b)] = 0\\n\\nif np.all(A[0,:]==0) or np.all(A[1,:]==0) or np.all(A[2,:]==0) or np.all(A[:,0]==0) or np.all(A[:,1]==0) \\\\\\n    or np.all(A[:,2]==0) or A[0,0]**2+A[1,1]**2+A[2,2]**2==0 or A[0,2]**2+A[1,1]**2+A[2,0]**2==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"a = []\\nfor i in range(3):\\n    a.extend(list(map(int,input().split())))\\nn = int(input())\\nb = []\\n\\ncnt=[]\\npattern=[[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,7],[2,5,8],[0,4,8],[2,4,6]]\\n\\nfor i in range(n):\\n    b.append(int(input()))\\n    for j , x in enumerate(a):\\n        if x == b[i]:\\n            cnt.append(j)\\n\\nfor q,w,e in pattern:\\n    if q in cnt and w in cnt and e in cnt:\\n        print('Yes')\\n        break\\nelse:\\n    print('No')\", \"L = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nB = list(int(input()) for _ in range(n))\\nans = 'No'\\nfor i in range(3):\\n  for j in range(3):\\n    for b in B:\\n      if L[i][j] == b:\\n        L[i][j] = 0\\n        \\nfor i in range(3):\\n  if L[i][0] == L[i][1] == L[i][2] == 0: ans = 'Yes' #\\u6a2a\\n  if L[0][i] == L[1][i] == L[2][i] == 0: ans = 'Yes' #\\u7e26\\nif L[0][0] == L[1][1] == L[2][2] == 0: ans = 'Yes'\\nif L[0][2] == L[1][1] == L[2][0] == 0: ans = 'Yes'\\n  \\nprint(ans)\", \"rows = []\\nfor _ in range(3):\\n    A = list(map(int, input().split()))\\n    rows.append(A)\\n\\nN = int(input())\\n\\nfor _ in range(N):\\n    b = int(input())\\n    for i in range(3):\\n        for j in range(3):\\n            if rows[i][j] == b:\\n                rows[i][j] = 0\\n\\nif rows[0][0]+rows[0][1]+rows[0][2] == 0 or rows[1][0]+rows[1][1]+rows[1][2] == 0 or rows[2][0]+rows[2][1]+rows[2][2] == 0 \\\\\\n    or rows[0][0]+rows[1][0]+rows[2][0] == 0 or rows[0][1]+rows[1][1]+rows[2][1] == 0 or rows[0][2]+rows[1][2]+rows[2][2] == 0 \\\\\\n    or rows[0][0]+rows[1][1]+rows[2][2] == 0 or rows[0][2]+rows[1][1]+rows[2][0] == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nN = int(input())\\nb = [int(input()) for _ in range(N)]\\n\\nfor i in range(N):\\n    for j in range(3):\\n        for k in range(3):\\n            if b[i] == A[j][k]:\\n                A[j][k] = 0\\nans = 'No'\\nfor i in range(3):\\n    if all(c == 0 for c in [A[i][0], A[i][1], A[i][2]]):\\n        ans = 'Yes'\\nfor i in range(3):\\n    if all(c == 0 for c in [A[0][i], A[1][i], A[2][i]]):\\n        ans = 'Yes'\\nif all(c == 0 for c in [A[0][0], A[1][1], A[2][2]]):\\n    ans = 'Yes'\\nif all(c == 0 for c in [A[0][2], A[1][1], A[2][0]]):\\n    ans = 'Yes'\\nprint(ans)\\n\", \"A = []\\nfor i in range(3):\\n  A += list(map(int,input().split()))\\n\\ncalled = [False] * 9\\n\\nbingo = ((0,1,2),(3,4,5),(6,7,8),(0,3,6),(1,4,7),(2,5,8),(0,4,8),(2,4,6))\\n\\nN = int(input())\\nfor i in range(N):\\n  target = int(input())\\n  if target in A:\\n    called[A.index(target)] = True\\n  \\nfor a,b,c in bingo:\\n  if called[a] and called[b] and called[c]:\\n    print(\\\"Yes\\\")\\n    break\\nelse:\\n  print(\\\"No\\\")\\n\", \"n=3\\nnum_list = []\\nfor i in range(n):\\n    num_list.append(list(map(int,input().split())))\\n\\nN=int(input())\\n\\nlist1=[int(input()) for _ in range(N)]\\n\\nlist2=[]\\ni=0\\nwhile i<=2:\\n    j=0\\n    while j<=2:\\n        list2.append(num_list[i][j])\\n        j=j+1\\n    i=i+1\\n\\ns=0\\nfor k in list2:\\n    if list1.count(k)==1:\\n        list2[s]=101\\n        s=s+1\\n    else:\\n        s=s+1\\n        continue\\n\\nif list2[0]+list2[1]+list2[2]==303:\\n    print('Yes')\\nelif list2[3]+list2[4]+list2[5]==303:\\n    print('Yes')\\nelif list2[6]+list2[7]+list2[8]==303:\\n    print('Yes')\\nelif list2[0]+list2[3]+list2[6]==303:\\n    print('Yes')\\nelif list2[1]+list2[4]+list2[7]==303:\\n    print('Yes')\\nelif list2[2]+list2[5]+list2[8]==303:\\n    print('Yes')\\nelif list2[0]+list2[4]+list2[8]==303:\\n    print('Yes')\\nelif list2[2]+list2[4]+list2[6]==303:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"def bingo(board):\\n    if board[0][0] == board[0][1] == board[0][2]:\\n        return True\\n    if board[1][0] == board[1][1] == board[1][2]:\\n        return True\\n    if board[2][0] == board[2][1] == board[2][2]:\\n        return True\\n    if board[0][0] == board[1][0] == board[2][0]:\\n        return True\\n    if board[0][1] == board[1][1] == board[2][1]:\\n        return True\\n    if board[0][2] == board[1][2] == board[2][2]:\\n        return True\\n    if board[0][0] == board[1][1] == board[2][2]:\\n        return True\\n    if board[0][2] == board[1][1] == board[0][2]:\\n        return True\\n\\n\\nA = []\\nb = []\\nfor _ in range(3):\\n    A.append(list(map(int, input().split())))\\nn = int(input())\\nfor _ in range(n):\\n    b.append(int(input()))\\n\\nfor i in range(n):\\n    for j in range(3):\\n        for k in range(3):\\n            if b[i] == A[j][k]:\\n                A[j][k] = 0\\n\\nans = bingo(A)\\nif ans:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"a=[[*map(int,input().split())] for _ in range(3)]\\nb=[int(input()) for _ in range(int(input()))]\\nfor i in b:\\n  for j in range(3):\\n    if i in a[j]:\\n      a[j][a[j].index(i)]=-1\\nif a[0][0]+a[1][1]+a[2][2]==-3 or a[0][2]+a[1][1]+a[2][0]==-3:\\n  print('Yes')\\nelse:\\n  for i,j in zip(a,[*zip(*a)]):\\n    if sum(i)==-3 or sum(j)==-3:\\n      print('Yes');break\\n  else:\\n    print('No')\", \"a1 = list(map(int, input().split()))\\na2 = list(map(int, input().split()))\\na3 = list(map(int, input().split()))\\nn = int(input())\\nflag = 0\\nfor _ in range(n):\\n    b = int(input())\\n    for i in range(3):\\n        if b == a1[i]:\\n            a1[i] = 0\\n        elif b == a2[i]:\\n            a2[i] = 0\\n        elif b == a3[i]:\\n            a3[i] = 0\\n    for i in range(3):\\n        if a1[i] == a2[i] == a3[i]:\\n            flag = 1\\n        if sum(a1) == 0:\\n            flag = 1\\n        if sum(a2) == 0:\\n            flag = 1\\n        if sum(a3) == 0:\\n            flag = 1\\n        if a1[0] == a2[1] == a3[2]:\\n            flag = 1\\n        if a1[2] == a2[1] == a3[0]:\\n            flag = 1\\n    if flag == 1:\\n        print(\\\"Yes\\\")\\n        break\\nif flag == 0:\\n    print(\\\"No\\\")\", \"li = list(map(int,input().split()))\\nli1 = list(map(int,input().split()))\\nli2 = list(map(int,input().split()))\\n\\nn = int(input())\\nli3 = []\\nfor i in range(n):\\n    li3.append(int(input()))\\n\\nfor i in range(3):\\n    if li[i] in li3:\\n        li[i] = 0\\n    if li1[i] in li3:\\n        li1[i] = 0\\n    if li2[i] in li3:\\n        li2[i] = 0\\nsu = li[0] + li1[0] + li2[0]\\nsu1 = li[1] + li1[1] + li2[1]\\nsu2 = li[2] + li1[2] + li2[2]\\nsu3 = li[0] + li1[1] + li2[2]\\nsu4 = li[2] + li1[1] + li2[0]\\nif sum(li)==0 or sum(li1)==0 or sum(li2)==0:\\n    print('Yes')\\nelif su == 0 or su1 == 0 or su2 == 0:\\n    print('Yes')\\nelif su3 == 0 or su4 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ninput = sys.stdin.readline\\nins = lambda: input().rstrip()\\nini = lambda: int(input().rstrip())\\ninm = lambda: map(int, input().rstrip().split())\\ninl = lambda: list(map(int, input().split()))\\nout = lambda x, s='\\\\n': print(s.join(map(str, x)))\\n\\na = inl()\\nb = inl()\\nc = inl()\\nn = ini()\\nbingo = []\\nfor _ in range(n):\\n    bingo.append(ini())\\nct = [0] * 9\\nfor i in bingo:\\n    if i in a:\\n        ct[a.index(i)] = 1\\n    if i in b:\\n        ct[b.index(i) + 3] = 1\\n    if i in c:\\n        ct[c.index(i) + 6] = 1\\nif sum(ct[:3]) == 3 or sum(ct[3:6]) == 3 or sum(ct[6:9]) == 3:\\n    print(\\\"Yes\\\")\\nelif (ct[0] + ct[4] + ct[8]) == 3 or (ct[2] + ct[4] + ct[6]) == 3:\\n    print(\\\"Yes\\\")\\nelif (ct[0] + ct[3] + ct[6]) == 3 or (ct[1] + ct[4] + ct[7]) == 3 or (ct[2] + ct[5] + ct[8]) == 3:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")    \", \"A = [[],[],[]]\\nA[0] = [int(s) for s in input().split(' ')]\\nA[1] = [int(s) for s in input().split(' ')]\\nA[2] = [int(s) for s in input().split(' ')]\\nN = int(input())\\nB = []\\nfor n in range(N):\\n    b = int(input())\\n    B.append(b)\\nB = set(B)\\nlines = []\\nlines.append(set(A[0]))\\nlines.append(set(A[1]))\\nlines.append(set(A[2]))\\nlines.append(set(A[i][i] for i in range(3)))\\nlines.append(set(A[2 - i][i] for i in range(3)))\\nlines.append(set(A[i][0] for i in range(3)))\\nlines.append(set(A[i][1] for i in range(3)))\\nlines.append(set(A[i][2] for i in range(3)))\\nfor line in lines:\\n    if len(line & B) == 3:\\n        print('Yes')\\n        return\\nprint('No')\\n\", \"def main():\\n    A = [list(map(int, input().split())) for _ in range(3)]\\n    n = int(input())\\n\\n    for _ in range(n):\\n        b = int(input())\\n\\n        for i in range(3):\\n            for j in range(3):\\n                if A[i][j] == b:\\n                    A[i][j] = 0\\n\\n    ans = 'No'\\n    for i in range(3):\\n        if any(A[i]) == 0:\\n            ans = 'Yes'\\n    for i in range(3):\\n        if any([A[0][i], A[1][i], A[2][i]]) == 0:\\n            ans = 'Yes'\\n    if any([A[0][0], A[1][1], A[2][2]]) == 0:\\n        ans = 'Yes'\\n    if any([A[0][2], A[1][1], A[2][0]]) == 0:\\n        ans = 'Yes'\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = [list(map(int ,input().split())) for _ in range(3)]\\nn = int(input())\\n\\nans = [[0] * 3 for _ in range(3)]\\n\\nfor i in range(n):\\n    b = int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if a[j][k] ==  b:\\n                ans[j][k] = 1\\n\\nstate = False\\nfor i in range(3):\\n    num = 0\\n    for j in range(3):\\n        num += ans[i][j]\\n    \\n    if num == 3:\\n        state = True\\n\\nfor i in range(3):\\n    num = 0\\n    for j in range(3):\\n        num += ans[j][i]\\n    \\n    if num == 3:\\n        state = True\\n\\nif ans[0][0] + ans[1][1] + ans[2][2] == 3:\\n    state = True\\n\\nif ans[0][2] + ans[1][1] + ans[2][0] == 3:\\n    state = True\\n\\nif state:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"#!/usr/local/bin/python3\\n# https://atcoder.jp/contests/abc157/tasks/abc157_b\\nimport numpy as np\\n\\ndef check(A, b):\\n    A = np.where(A == b, -1, A)\\n    return A\\n\\ndef bingo(A):\\n    for a in A:\\n        if a[0] == a[1] == a[2] == -1:\\n            return True\\n    for a in A.T:\\n        if a[0] == a[1] == a[2] == -1:\\n            return True\\n    if A[0][0] == A[1][1] == A[2][2] == -1:\\n        return True\\n    if A[0][2] == A[1][1] == A[2][0] == -1:\\n        return True\\n    return False\\n\\n\\n\\nA = []\\nfor _ in range(3):\\n    A.append(list(map(int, input().split())))\\nA = np.array(A)\\nN = int(input())\\nfor _ in range(N):\\n    b = int(input())\\n    A = check(A, b)\\n\\n# for i in range(3):\\n#     for j in range(3):\\n#         print(f\\\"{A[i][j]} \\\", end=\\\"\\\")\\n#     print(\\\"\\\")\\n\\nif bingo(A):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"#!/usr/bin/env python3\\nimport sys\\n\\nYES = \\\"Yes\\\"  # type: str\\nNO = \\\"No\\\"  # type: str\\n\\n\\ndef solve(A: \\\"List[List[int]]\\\", N: int, b: \\\"List[int]\\\"):\\n    A_ = []\\n    for a_ in A:\\n        A_ += [[a__, False] for a__ in a_]\\n    for b_ in b:\\n        for a__ in A_:\\n            if a__[0] == b_:\\n                a__[1] = True\\n    if (A_[0][1] and ((A_[1][1] and A_[2][1]) or \\\\\\n                        (A_[3][1] and A_[6][1]) or \\\\\\n                        (A_[4][1] and A_[8][1]))) or \\\\\\n            (A_[1][1] and A_[4][1] and A_[7][1]) or \\\\\\n            (A_[2][1] and A_[5][1] and A_[8][1]) or \\\\\\n            (A_[3][1] and A_[4][1] and A_[5][1]) or \\\\\\n            (A_[6][1] and A_[7][1] and A_[8][1]) or \\\\\\n            (A_[2][1] and A_[4][1] and A_[6][1]):\\n        print(YES)\\n    else:\\n        print(NO)\\n    return\\n\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    A = [[int(next(tokens)) for _ in range(3)] for _ in range(3)]  # type: \\\"List[List[int]]\\\"\\n    N = int(next(tokens))  # type: int\\n    b = [int(next(tokens)) for _ in range(N)]  # type: \\\"List[int]\\\"\\n    solve(A, N, b)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A = [[]]*3\\nfor row in range(3):\\n    A[row] = list(map(int, input().split()))\\nn = int(input())\\nB = [0]*n\\nfor i in range(n):\\n    B[i] = int(input())\\nflag = False\\n\\n\\ndef check_bingo(A, B):\\n    for row in range(3):\\n        if A[row][0] and A[row][1] and A[row][2]:\\n            return True\\n\\n    for col in range(3):\\n        if A[0][col] and A[1][col] and A[2][col]:\\n            return True\\n\\n    if A[0][0] and A[1][1] and A[2][2]:\\n        return True\\n    if A[0][2] and A[1][1] and A[2][0]:\\n        return True\\n    return False\\n\\n\\nfor row in range(3):\\n    for col in range(3):\\n        if A[row][col] in B:\\n            A[row][col] = True\\n        else:\\n            A[row][col] = False\\n\\nprint(\\\"Yes\\\" if check_bingo(A, B) else \\\"No\\\")\", \"a_str = [input().split() for _ in range(3)]\\na = [[0,0,0],[0,0,0],[0,0,0]]\\nfor i in range(3):\\n    for j in range(3):\\n        a[i][j] = int(a_str[i][j])\\n\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n\\nfor m in range(n):\\n    for i in range(3):\\n        for j in range(3):\\n            if b[m] == a[i][j]:\\n                a[i][j] = 0\\n\\n#\\u6a2a\\u306e\\u30d3\\u30f3\\u30b4\\u5224\\u5b9a\\nfor i in range(3):\\n    if a[i][0] == a[i][1] == a[i][2] == 0:\\n        print('Yes')\\n        return\\n\\n#\\u7e26\\u306e\\u30d3\\u30f3\\u30b4\\u5224\\u5b9a\\nfor i in range(3):\\n    if a[0][i] == a[1][i] == a[2][i] == 0:\\n        print('Yes')\\n        return\\n\\n#\\u659c\\u3081\\u306e\\u30d3\\u30f3\\u30b4\\u5224\\u5b9a\\nif a[0][0] == a[1][1] == a[2][2] == 0:\\n    print('Yes')\\n    return\\nif a[0][2] == a[1][1] == a[2][0] == 0:\\n    print('Yes')\\n    return\\n\\nprint('No')\", \"import numpy as np\\n\\na = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\n\\nfor i in range(n):\\n    b = int(input())\\n\\n    for j in range(3):\\n        if b in a[j]:\\n            idx = a[j].index(b)\\n            a[j][idx] = 0\\n\\nnp_a = np.array(a)\\nnp_t = np_a.T\\nd = 0\\nu = 0\\n\\nfor i in range(3):\\n    r = np_a[i]\\n    c = np_t[i]\\n    d += r[i]\\n    u += r[2-i]\\n\\n    if r.sum() and c.sum():\\n        continue\\n\\n    print(\\\"Yes\\\")\\n    return\\n\\n\\nif d and u:\\n    print(\\\"No\\\")\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"l=[]\\nfor i in range(3):\\n    l += list(map(int,input().split()))\\nN= int(input())\\nb=set()\\nfor i in range(N):\\n  c=int(input())\\n  if c in l:b.add(c)\\nfor i in b:\\n  l[l.index(i)]=0\\nif l[0]+l[1]+l[2]==0 or l[3]+l[4]+l[5]==0 or l[6]+l[7]+l[8]==0:print('Yes');return\\nif l[0]+l[3]+l[6]==0 or l[1]+l[4]+l[7]==0 or l[2]+l[5]+l[8]==0:print('Yes');return\\nif l[0]+l[4]+l[8]==0 or l[2]+l[4]+l[6]==0:print('Yes');return\\nprint('No')\", \"#-*-coding:utf-8-*-\\nimport sys\\ninput=sys.stdin.readline\\n\\ndef bingo_check(card):\\n    #\\u6a2a\\u30c1\\u30a7\\u30c3\\u30af\\n    for low in card:\\n        if sum(low)==0:\\n            print(\\\"Yes\\\")\\n            return\\n    #\\u7e26\\u30c1\\u30a7\\u30c3\\u30af\\n    column1=0\\n    column2=0\\n    column3=0\\n    for low in card:\\n        column1+=low[0]\\n        column2+=low[1]\\n        column3+=low[2]\\n    if column1 == 0 or column2 == 0 or column3==0:\\n        print(\\\"Yes\\\")\\n        return\\n    #\\u659c\\u3081\\u30c1\\u30a7\\u30c3\\u30af\\n    diagonal1=card[0][0]+card[1][1]+card[2][2]\\n    diagonal2=card[0][2]+card[1][1]+card[2][0]\\n    if diagonal1 == 0 or diagonal2 == 0:\\n        print(\\\"Yes\\\")\\n        return\\n    print(\\\"No\\\")\\n\\ndef main():\\n    bingo=[]\\n    use_card=[]\\n    bingo=[list(map(int,input().split())) for _ in range(3)]\\n    use_card=bingo\\n    n = int(input())\\n\\n    for idx in range(n):\\n        number=int(input())\\n        for i in range(3):\\n            for j in range(3):\\n                if number==use_card[i][j]:\\n                    use_card[i][j]=0\\n                else:\\n                    continue\\n    bingo_check(use_card)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"a, b, c = list(map(int, input().split()))\\ne, f, g = list(map(int, input().split()))\\nh, i, j = list(map(int, input().split()))\\n\\nbingo_list = [[a, b, c], [e, f, g], [h, i, j], [a, e, h], [b, f, i], [c, g, j], [a, f, j], [c, f, h]]\\n\\nn = int(input())\\n\\nn_list = [int(input()) for _ in range(n)]\\ncount = 0\\nans = 'No'\\n\\nfor i in bingo_list:\\n    for j in n_list:\\n        if j in i:\\n            count += 1\\n        if count == 3:\\n            ans = 'Yes'\\n            break\\n    if ans == 'Yes':\\n        break\\n\\n    count = 0\\n\\nprint(ans)\\n\", \"a=[input().split() for _ in range(3)]\\nn=int(input())\\nb=[input() for _ in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(n):\\n            if a[i][j]==b[k]:\\n                a[i][j]='0'\\nans=\\\"No\\\"\\nfor i in range(3):\\n    if a[i][0]==a[i][1]==a[i][2]:\\n        ans=\\\"Yes\\\"\\n    if a[0][i]==a[1][i]==a[2][i]:\\n        ans=\\\"Yes\\\"\\nif a[0][0]==a[1][1]==a[2][2]:\\n    ans=\\\"Yes\\\"\\nif a[0][2]==a[1][1]==a[2][0]:\\n    ans=\\\"Yes\\\"\\nprint(ans)\", \"lst = [ [ int(i) for i in input().split() ] for j in range(3) ]\\n\\nn = int(input())\\n\\nfor _ in range(n):\\n  x = int(input())\\n  for d in lst:\\n    if d[0] == x:\\n      d[0] = -1\\n    elif d[1] == x:\\n      d[1] = -1\\n    elif d[2] == x:\\n      d[2] = -1\\n\\nfor d in lst:\\n  if d[0] == d[1] == d[2] == -1:\\n    print('Yes')\\n    return\\nfor i in range(3):\\n  if lst[0][i] == lst[1][i] == lst[2][i] == -1:\\n    print('Yes')\\n    return\\nfor i in range(3):\\n  if lst[i][0] == lst[i][1] == lst[i][2] == -1:\\n    print('Yes')\\n    return\\nif lst[0][0] == lst[1][1] == lst[2][2] == -1:\\n  print('Yes')\\n  return\\nif lst[0][2] == lst[1][1] == lst[2][0] == -1:\\n  print('Yes')\\n  return\\nprint('No')\\n\", \"A = [0 for i in range(9)]\\nfor i in range(3):\\n  A[3*i], A[3*i+1], A[3*i+2] = map(int, input().split())\\nN = int(input())\\nb = [0 for i in range(N)]\\nfor i in range(N):\\n  b[i] = int(input())\\n\\n#Check matching numbers\\nfor i in range(9):\\n  for j in range(N):\\n    if A[i] == b[j]:\\n      A[i] = 0\\n\\n# Check bingo or not\\nflag = 0\\n# Check rows\\nfor i in [0, 3, 6]:\\n  if A[i]==A[i+1] and A[i+1]==A[i+2]:\\n    flag += 1\\n# Check colums\\nfor j in range(3):\\n  if A[j]==A[j+3] and A[j+3]==A[j+6]:\\n    flag += 1\\n# Check naname?\\nif (A[0]==A[4] and A[4]==A[8]) or (A[2]==A[4] and A[4]==A[6]):\\n  flag += 1\\n\\nif flag >= 1:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"ls = []\\nfor i in range(3):\\n    ls += list(map(int,input().split()))\\nN = int(input())\\nlsb = [int(input()) for i in range(N)]\\nfor i in range(N):\\n    if lsb[i] in ls:\\n        ls[ls.index(lsb[i])] = '#'\\nans = 'No'\\nfor i in range(3):  \\n    if ls[0+i] == '#' and ls[3+i] == '#' and ls[6+i] == '#':\\n        ans = 'Yes'\\nfor i in range(3):  \\n    if ls[3*i] == '#' and ls[3*i+1] == '#' and ls[3*i+2] == '#':\\n        ans = 'Yes'\\nif ls[0] == '#' and ls[4] == '#' and ls[8] == '#':\\n        ans = 'Yes'\\nif ls[2] == '#' and ls[4] == '#' and ls[6] == '#':\\n        ans = 'Yes'\\nprint(ans)\", \"a = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\nvisited = [[False for i in range(3)] for j in range(3)]\\nfor i in b:\\n    for j in range(3):\\n        for k in range(3):\\n            if i==a[j][k]:\\n                visited[j][k] = True\\n\\nans = \\\"No\\\"\\nfor i in visited:\\n    if i==[True,True,True]:\\n        ans = \\\"Yes\\\"\\n\\nfor i in range(3):\\n    flag = True\\n    for j in range(3):\\n        if visited[j][i]==False:\\n            flag = False\\n            break\\n    if flag:\\n        ans = \\\"Yes\\\"\\n\\nif visited[0][0] and visited[1][1] and visited[2][2]:\\n    ans = \\\"Yes\\\"\\nif visited[2][0] and visited[1][1] and visited[0][2]:\\n    ans = \\\"Yes\\\"\\nprint(ans)\", \"A = [list(map(int,input().split())) for i in range(3)]\\nN = int(input())\\nsheet = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\nfor i in range(N):\\n    b = int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if b == A[j][k]:\\n                sheet[j][k] = 1\\n                break\\n            else:\\n                continue\\n\\nfor i in range(3):\\n    if sheet[0][i] == sheet[1][i] == sheet[2][i] == 1:\\n        print('Yes')\\n        return\\n\\nfor i in range(3):\\n    if sheet[i][0] == sheet[i][1] == sheet[i][2] == 1:\\n        print('Yes')\\n        return\\n\\nif sheet[0][0] == sheet[1][1] == sheet[2][2] == 1:\\n        print('Yes')\\n        return\\nif sheet[0][2] == sheet[1][1] == sheet[2][0] == 1:\\n        print('Yes')\\n        return\\nelse:\\n    print('No')\", \"mat = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\n\\nfor i in range(3):\\n  x, y, z = map(int, input().split())\\n  mat[i][0] = x\\n  mat[i][1] = y\\n  mat[i][2] = z\\n\\nn = int(input())\\n\\nfor i in range(n):\\n  x = int(input())\\n  for j in range(3):\\n    for k in range(3):\\n      if mat[j][k] == x:\\n        mat[j][k] = -1\\n        break\\n\\nif mat[0][0] == -1 and mat[0][1] == -1 and mat[0][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[1][0] == -1 and mat[1][1] == -1 and mat[1][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[2][0] == -1 and mat[2][1] == -1 and mat[2][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][0] == -1 and mat[1][0] == -1 and mat[2][0] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][1] == -1 and mat[1][1] == -1 and mat[2][1] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][2] == -1 and mat[1][2] == -1 and mat[2][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][0] == -1 and mat[1][1] == -1 and mat[2][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[2][0] == -1 and mat[1][1] == -1 and mat[0][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelse:\\n  print(\\\"No\\\")\", \"sheet = []\\nfor i in range(3):\\n    sheet.append([int(x) for x in input().split()])\\nbingo = [[False] * 3 for _ in range(3)]\\n\\nN = int(input())\\nfor i in range(N):\\n    a = int(input())\\n    for x in range(3):\\n        for y in range(3):\\n            if sheet[x][y] == a:\\n                bingo[x][y] = True\\n\\nfor i in range(3):\\n    if bingo[i][0] and bingo[i][1] and bingo[i][2]:\\n        print('Yes')\\n        return\\n    if bingo[0][i] and bingo[1][i] and bingo[2][i]:\\n        print('Yes')\\n        return\\nif bingo[0][0] and bingo[1][1] and bingo[2][2]:\\n    print('Yes')\\n    return\\nif bingo[2][0] and bingo[1][1] and bingo[0][2]:\\n    print('Yes')\\n    return\\n\\nprint('No')\\n\", \"import numpy as np\\nA = [list(map(int, input().split())) for _ in range(3)]\\nN = int(input())\\nB = [int(input()) for _ in range(N)]\\na = [[False]*3 for _ in range(3)]\\nfor i in range(3):\\n    for j in range(3):\\n        for b in B:\\n            if A[i][j] == b:\\n                a[i][j] = True\\nbingo = False\\nfor i in range(3):\\n    if a[i][0] and a[i][1] and a[i][2]:\\n        bingo =True\\nfor j in range(3):\\n    if a[0][j] and a[1][j] and a[2][j]:\\n        bingo = True\\nif a[0][0] and a[1][1] and a[2][2]:\\n    bingo = True\\nif a[0][2] and a[1][1] and a[2][0]:\\n    bingo = True\\nprint(('Yes' if bingo else 'No'))\\n\\n\", \"A1 = list(map(str,input().split()))\\nA2 = list(map(str,input().split()))\\nA3 = list(map(str,input().split()))\\nN = int(input())\\nfor k in range(N):\\n  i = str(input())  \\n  if i == A1[0]:\\n    A1[0] = 'OK'\\n  if i == A1[1]:\\n    A1[1] = 'OK'\\n  if i == A1[2]:\\n    A1[2] = 'OK'\\n  if i == A2[0]:\\n    A2[0] = 'OK' \\n  if i == A2[1]:\\n    A2[1] = 'OK'\\n  if i == A2[2]:\\n    A2[2] = 'OK'\\n  if i == A3[0]:\\n    A3[0] = 'OK'\\n  if i == A3[1]:\\n    A3[1] = 'OK'\\n  if i == A3[2]:\\n    A3[2] = 'OK'\\nif A1 == ['OK','OK','OK'] or A2 == ['OK','OK','OK'] or A3 == ['OK','OK','OK']:\\n  print('Yes')\\n  return\\nfor i in range(3):\\n  if A1[i] == 'OK' and A2[i] == 'OK' and A3[i]== 'OK':\\n    print('Yes')\\n    return\\nif A1[0] == 'OK' and A2[1] == 'OK' and A3[2]== 'OK':\\n    print('Yes')\\n    return\\nif A1[2] == 'OK' and A2[1] == 'OK' and A3[0]== 'OK':\\n    print('Yes')\\n    return\\nprint('No')\\n\\n\\n\", \"a1 = list(map(int,input().split()))\\na2 = list(map(int,input().split()))\\na3 = list(map(int,input().split()))\\nn = int(input())\\nfor i in range(n):\\n    b = int(input())\\n    if b in a1:\\n        a1[a1.index(b)] = 0\\n    if b in a2:\\n        a2[a2.index(b)] = 0\\n    if b in a3:\\n        a3[a3.index(b)] = 0\\nif (sum(a1) != 0) and (sum(a2) != 0) and (sum(a3) != 0) and (a1[0] + a2[0] + a3[0] != 0) and (a1[1] + a2[1] + a3[1] != 0) and (a1[2] + a2[2] + a3[2] != 0) and a1[0] + a2[1] + a3[2] != 0 and a1[2] + a2[1] + a3[0] != 0:\\n    print('No')\\nelse:\\n    print('Yes')\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nB = [int(input()) for _ in range(n)]\\n\\nfor i in range(3):\\n    for j in range(3):\\n        if A[i][j] in B:\\n            A[i][j] = -1\\n\\nfor i in range(3):\\n    ans1, ans2 = 0, 0\\n    for j in range(3):\\n        if A[i][j] == -1:\\n            ans1 += 1\\n        if A[j][i] == -1:\\n            ans2 += 1\\n    if ans1 == 3 or ans2 == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\nif (A[0][0] == -1 and A[1][1] == -1 and A[2][2] == -1) or \\\\\\n        (A[0][2] == -1 and A[1][1] == -1 and A[2][0] == -1):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"sheet = []\\nlines = [[0, 1, 2], [3, 4, 5], [6, 7, 8],\\n        [0, 3, 6], [1, 4, 7], [2, 5, 8],\\n        [0, 4, 8], [2, 4, 6]]\\nsai = []\\nfor i in range(3):\\n\\tsheet += [int(j) for j in input().split()]\\nn = int(input())\\nfor i in range(n):\\n\\tsai.append(int(input()))\\nret = 'No'\\nfor line in lines:\\n\\tbingo = True\\n\\tfor l in line:\\n\\t\\tif sheet[l] not in sai:\\n\\t\\t\\tbingo = False\\n\\tif bingo:\\n\\t\\tret = 'Yes'\\nprint(ret)\", \"a=[input().split() for _ in range(3)]\\nn=int(input())\\nb=[input() for _ in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(n):\\n            if a[i][j]==b[k]:\\n                a[i][j]='0'\\nans=\\\"No\\\"\\nfor i in range(3):\\n    if a[i][0]==a[i][1]==a[i][2]:\\n        ans=\\\"Yes\\\"\\n    if a[0][i]==a[1][i]==a[2][i]:\\n        ans=\\\"Yes\\\"\\nif a[0][0]==a[1][1]==a[2][2]:\\n    ans=\\\"Yes\\\"\\nif a[0][2]==a[1][1]==a[2][0]:\\n    ans=\\\"Yes\\\"\\nprint(ans)\", \"import sys\\na = 3\\nA = [list(map(int,input().split())) for c in range(a)]\\nN = int(input())\\nb = [int(input()) for c in range(N)]\\n#print(A)\\n#print(b)\\nC = [[0,0,0],[0,0,0],[0,0,0]]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(N):\\n            if b[k] == A[i][j]:\\n                C[i][j] = 1\\n\\nfor i in range(3):\\n    if sum(C[i]) == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\nfor j in range(3):\\n    if C[0][j]+C[1][j]+C[2][j] == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\nif C[0][0]+C[1][1]+C[2][2] == 3 or C[0][2]+C[1][1]+C[2][0] == 3:\\n    print(\\\"Yes\\\")\\n    return\\n\\nprint(\\\"No\\\")\\n\", \"# coding: utf-8\\n\\ndef main():\\n    A = []\\n    num = [1 for _ in range(101)]\\n    C = [\\n        [0, 1, 2],\\n        [3, 4, 5],\\n        [6, 7, 8],\\n        [0, 3, 6],\\n        [1, 4, 7],\\n        [2, 5, 8],\\n        [0, 4, 8],\\n        [2, 4, 6],\\n    ]\\n    ans = 'No'\\n    \\n    for _ in range(3):\\n        for i in list(map(int, input().split())):\\n            A.append(i)\\n        \\n\\n    N = int(input())\\n\\n    for _ in range(N):\\n        num[int(input())] -= 1\\n\\n    for c in C:\\n        if num[A[c[0]]] == 0 and num[A[c[1]]] == 0 and num[A[c[2]]] == 0:\\n            ans = 'Yes'\\n            break\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nB = [int(input()) for i in range(n)]\\nC = [[0,0,0] for _ in range(3)]\\n\\nfor b in B:\\n    for i in range(3):\\n        for j in range(3):\\n            if(A[i][j] == b):\\n                C[i][j] = 1\\n\\nfor i in range(3):\\n    if(C[i][0] == 1 and C[i][1] == 1 and C[i][2] == 1):\\n        print(\\\"Yes\\\")\\n        return\\n    elif(C[0][i] == 1 and C[1][i] == 1 and C[2][i] == 1):\\n        print(\\\"Yes\\\")\\n        return\\nif(C[0][0] == 1 and C[1][1] == 1 and C[2][2] == 1):\\n    print(\\\"Yes\\\")\\n    return\\nelif(C[0][2] == 1 and C[1][1] == 1 and C[2][0] == 1):\\n    print(\\\"Yes\\\")\\n    return\\nprint(\\\"No\\\")\\nreturn\\n\", \"import os, sys, re, math\\n\\nA = []\\n\\nfor i in range(3):\\n    A += [int(n) for n in input().split()]\\n\\nN = int(input())\\nfor i in range(N):\\n    b = int(input())\\n    A = [0 if a == b else a for a in A]\\n\\nbingo = 'No'\\nfor x in range(3):\\n    if A[x * 3] == A[x * 3 + 1] == A[x * 3 + 2] == 0:\\n        bingo = 'Yes'\\nfor y in range(3):\\n    if A[y] == A[y + 3] == A[y + 3 * 2] == 0:\\n        bingo = 'Yes'\\nif (A[0] == A[4] == A[8] == 0) or (A[2] == A[4] == A[6] == 0):\\n    bingo = 'Yes'\\n\\nprint(bingo)\\n\", \"board = [list(map(int,input().split())) for i in range(3)]\\nnum = int(input())\\nfor n in range(num):\\n    bi = int(input())\\n    for i in range(3):\\n        for j in range(3):\\n            if board[i][j] == bi:\\n                board[i][j] = 0\\n\\n#\\u6a2a\\nfor i in range(3):\\n    if board[i][0] == board[i][1] == board[i][2] == 0:\\n        print(\\\"Yes\\\")\\n        return\\n#\\u7e26\\nfor i in range(3):\\n    if board[0][i] == board[1][i] == board[2][i] == 0:\\n        print(\\\"Yes\\\")\\n        return\\n\\nif board[0][0] == board[1][1] == board[2][2] == 0:\\n    print(\\\"Yes\\\")\\n    return\\nif board[0][2] == board[1][1] == board[2][0] == 0:\\n    print(\\\"Yes\\\")\\n    return\\n\\nprint(\\\"No\\\")\"]",
        "difficulty": "introductory",
        "input": "3 37 21\n5 85 57\n35 13 67\n5\n3\n67\n56\n35\n5\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc157/tasks/abc157_b"
    },
    {
        "id": 444,
        "task_id": 4193,
        "test_case_id": 13,
        "question": "We have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\n-----Constraints-----\n - All values in input are integers.\n - 1 \\leq A_{i, j} \\leq 100\n - A_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n - 1 \\leq N \\leq 10\n - 1 \\leq b_i \\leq 100\n - b_i \\neq b_j (i \\neq j)\n\n-----Input-----\nInput is given from Standard Input in the following format:\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\n-----Output-----\nIf we will have a bingo, print Yes; otherwise, print No.\n\n-----Sample Input-----\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\n-----Sample Output-----\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.",
        "solutions": "[\"a = list(list(map(int,input().split())) for _ in range(3))\\nn = int(input())\\nb = list(int(input()) for _ in range(n))\\n\\nfor i in range(3):\\n    for j in range(3):\\n        if a[i][j] in b:\\n            a[i][j] = 0\\n\\nfor i in range(3):\\n    if a[i][0] == a[i][1] == a[i][2] or a[0][i] == a[1][i] == a[2][i] or a[0][0] == a[1][1] == a[2][2] or a[2][0] == a[1][1] == a[0][2]:\\n        print(\\\"Yes\\\")\\n        break\\nelse:\\n     print(\\\"No\\\")\", \"import sys\\nread = sys.stdin.readline\\nimport time\\nfrom heapq import heappush, heappop, heapify\\nimport math\\nfrom math import gcd\\nimport itertools as it\\nfrom collections import deque \\n\\n\\ndef inp():\\n    return int(input())\\ndef inpl():\\n    return list(map(int, input().split()))\\nstart_time = time.perf_counter()\\n# ------------------------------\\n\\n# bingo = [[0] * 3 for i in range(3)]\\n# bingo[0][0] = 1\\n# print(bingo)\\n\\nbingo = []\\nfor i in range(3):\\n    ls = inpl()\\n    bingo.append(ls)\\nN = inp()\\nfor i in range(N):\\n    a = inp()\\n    for i in range(3):\\n        for j in range(3):\\n            if bingo[i][j] == a:\\n                bingo[i][j] = -1\\n\\nbl = False\\nfor i in range(3):\\n    if bingo[i][0] == -1 and bingo[i][1] == -1 and bingo[i][2] == -1:\\n        bl = True\\n    if bingo[0][i] == -1 and bingo[1][i] == -1 and bingo[2][i] == -1:\\n        bl = True\\n         \\nif bingo[0][0] == -1 and bingo[1][1] == -1 and bingo[2][2] == -1:\\n        bl = True\\n\\nif bingo[0][2] == -1 and bingo[1][1] == -1 and bingo[2][0] == -1:\\n        bl = True\\n \\nprint('Yes' if bl else 'No')\\n\\n\\n# -----------------------------\\nend_time = time.perf_counter()\\nprint('time:', end_time-start_time, file=sys.stderr)\\n\\n\", \"A = [list(map(int, input().split())) for i in range(3)]\\nN = int(input())\\nB = [0 for i in range(8)]\\nfor i in range(N):\\n    b = int(input())\\n    if b == A[0][0] or b == A[1][0] or b == A[2][0]:\\n        B[0] += 1\\n    if b == A[0][1] or b == A[1][1] or b == A[2][1]:\\n        B[1] += 1\\n    if b == A[0][2] or b == A[1][2] or b == A[2][2]:\\n        B[2] += 1\\n    if b == A[0][0] or b == A[0][1] or b == A[0][2]:\\n        B[3] += 1\\n    if b == A[1][0] or b == A[1][1] or b == A[1][2]:\\n        B[4] += 1\\n    if b == A[2][0] or b == A[2][1] or b == A[2][2]:\\n        B[5] += 1\\n    if b == A[0][0] or b == A[1][1] or b == A[2][2]:\\n        B[6] += 1\\n    if b == A[0][2] or b == A[1][1] or b == A[2][0]:\\n        B[7] += 1\\nif 3 in B:\\n    ans = 'Yes'\\nelse:\\n    ans = 'No'\\nprint(ans)\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\n\\nbingo = []\\nfor i in range(3):\\n    x = a[i]\\n    for j in range(3):\\n        bingo.append(x[j])\\n\\nfor i in b:\\n    for j in range(0,9):\\n        if i == bingo[j]:\\n            bingo[j] = 0\\n\\nif bingo[0]==0 and bingo[1]==0 and bingo[2]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[3]==0 and bingo[4]==0 and bingo[5]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[6]==0 and bingo[7]==0 and bingo[8]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[0]==0 and bingo[3]==0 and bingo[6]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[1]==0 and bingo[4]==0 and bingo[7]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[2]==0 and bingo[5]==0 and bingo[8]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[0]==0 and bingo[4]==0 and bingo[8]==0:\\n    print(\\\"Yes\\\")\\nelif bingo[2]==0 and bingo[4]==0 and bingo[6]==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"Bingo_1 = list(map(int, input().split()))\\nBingo_2 = list(map(int, input().split()))\\nBingo_3 = list(map(int, input().split()))\\n\\nnumber_table = []\\nnumber_count = int(input())\\nfor i in range(number_count):\\n    number_table.append(int(input()))\\n\\nfor j in range(number_count):\\n    if number_table[j] == Bingo_1[0]:\\n        Bingo_1[0] = 0\\n    elif number_table[j] == Bingo_1[1]:\\n        Bingo_1[1] = 0\\n    elif number_table[j] == Bingo_1[2]:\\n        Bingo_1[2] = 0\\n    elif number_table[j] == Bingo_2[0]:\\n        Bingo_2[0] = 0\\n    elif number_table[j] == Bingo_2[1]:\\n        Bingo_2[1] = 0\\n    elif number_table[j] == Bingo_2[2]:\\n        Bingo_2[2] = 0\\n    elif number_table[j] == Bingo_3[0]:\\n        Bingo_3[0] = 0\\n    elif number_table[j] == Bingo_3[1]:\\n        Bingo_3[1] = 0\\n    elif number_table[j] == Bingo_3[2]:\\n        Bingo_3[2] = 0\\n\\nif Bingo_1[0] == 0 and Bingo_1[1] == 0 and Bingo_1[2] == 0:\\n    print('Yes')\\nelif Bingo_2[0] == 0 and Bingo_2[1] == 0 and Bingo_2[2] == 0:\\n    print('Yes')\\nelif Bingo_3[0] == 0 and Bingo_3[1] == 0 and Bingo_3[2] == 0:\\n    print('Yes')\\nelif Bingo_1[0] == 0 and Bingo_2[0] == 0 and Bingo_3[0] == 0:\\n    print('Yes')\\nelif Bingo_1[1] == 0 and Bingo_2[1] == 0 and Bingo_3[1] == 0:\\n    print('Yes')\\nelif Bingo_1[2] == 0 and Bingo_2[2] == 0 and Bingo_3[2] == 0:\\n    print('Yes')\\nelif Bingo_1[0] == 0 and Bingo_2[1] == 0 and Bingo_3[2] == 0:\\n    print('Yes')\\nelif Bingo_1[2] == 0 and Bingo_2[1] == 0 and Bingo_3[0] == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"a=[input().split()for _ in range(3)]\\nn=int(input())\\nb= [input() for _ in range(n)]\\na1=[]\\nfor i in range(3):\\n    a1.append(a[0][i])\\nfor i in range(3):\\n    a1.append(a[1][i])\\nfor i in range(3):\\n    a1.append(a[2][i])\\nfor i in range(n):\\n    if b[i] in a1:\\n        w=a1.index(b[i])\\n        a1[w]=\\\"a\\\"\\n    else:\\n        pass\\n\\nif a1[0]==a1[1]==a1[2]==\\\"a\\\" or a1[3]==a1[4]==a1[5]==\\\"a\\\" or a1[6]==a1[7]==a1[8]==\\\"a\\\":\\n    print(\\\"Yes\\\")\\nelse:\\n    if a1[0]==a1[3]==a1[6]==\\\"a\\\" or a1[1]==a1[4]==a1[7]==\\\"a\\\" or a1[2]==a1[5]==a1[8]==\\\"a\\\":\\n        print(\\\"Yes\\\")\\n    else:\\n        if a1[0]==a1[4]==a1[8]==\\\"a\\\" or a1[2]==a1[4]==a1[6]==\\\"a\\\":\\n            print(\\\"Yes\\\")\\n        else:\\n            print(\\\"No\\\")\", \"a = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n\\nfor i in range(n):\\n  for j in range(3):\\n    for k in range(3):\\n      if b[i] == a[j][k]:\\n        a[j][k] = 0\\n\\ndef bingo(board):\\n  if board[0][0] == board[0][1] == board[0][2]:\\n    return True\\n  if board[1][0] == board[1][1] == board[1][2]:\\n    return True\\n  if board[2][0] == board[2][1] == board[2][2]:\\n    return True\\n  if board[0][0] == board[1][0] == board[2][0]:\\n    return True\\n  if board[0][1] == board[1][1] == board[2][1]:\\n    return True\\n  if board[0][2] == board[1][2] == board[2][2]:\\n    return True\\n  if board[0][0] == board[1][1] == board[2][2]:\\n    return True\\n  if board[0][2] == board[1][1] == board[0][2]:\\n    return True\\n  return False\\n\\nif bingo(a):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"l=[]\\nA,B,C=map(int,input().split());l.append(A);l.append(B);l.append(C)\\nD,E,F=map(int,input().split());l.append(D);l.append(E);l.append(F)\\nG,H,I=map(int,input().split());l.append(G);l.append(H);l.append(I)\\nN= int(input())\\nb={0}\\n\\nfor i in range(N):\\n  c=int(input())\\n  if c in l:b.add(c)\\nb.discard(0)\\n\\n\\nfor i in b:\\n  l[l.index(i)]=0\\n\\nif l[0]+l[1]+l[2]==0 or l[3]+l[4]+l[5]==0 or l[6]+l[7]+l[8]==0:print('Yes');return\\nif l[0]+l[3]+l[6]==0 or l[1]+l[4]+l[7]==0 or l[2]+l[5]+l[8]==0:print('Yes');return\\nif l[0]+l[4]+l[8]==0 or l[2]+l[4]+l[6]==0:print('Yes');return\\nprint('No')\", \"#!/usr/bin/env python3\\nimport sys\\n\\nYES = \\\"Yes\\\"  # type: str\\nNO = \\\"No\\\"  # type: str\\n\\n\\ndef solve(A: \\\"List[List[int]]\\\", N: int, b: \\\"List[int]\\\"):\\n    A_ = []\\n    for a_ in A:\\n        A_ += [[a__, False] for a__ in a_]\\n    for b_ in b:\\n        for a__ in A_:\\n            if a__[0] == b_:\\n                a__[1] = True\\n    if (A_[0][1] and ((A_[1][1] and A_[2][1]) or \\\\\\n                        (A_[3][1] and A_[6][1]) or \\\\\\n                        (A_[4][1] and A_[8][1]))) or \\\\\\n            (A_[1][1] and A_[4][1] and A_[7][1]) or \\\\\\n            (A_[2][1] and A_[5][1] and A_[8][1]) or \\\\\\n            (A_[3][1] and A_[4][1] and A_[5][1]) or \\\\\\n            (A_[6][1] and A_[7][1] and A_[8][1]) or \\\\\\n            (A_[2][1] and A_[4][1] and A_[6][1]):\\n        print(YES)\\n    else:\\n        print(NO)\\n    return\\n\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    A = [[int(next(tokens)) for _ in range(3)] for _ in range(3)]  # type: \\\"List[List[int]]\\\"\\n    N = int(next(tokens))  # type: int\\n    b = [int(next(tokens)) for _ in range(N)]  # type: \\\"List[int]\\\"\\n    solve(A, N, b)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\n\\nfor i in b:\\n    for j in range(0,3):\\n        for k in range(0,3):\\n            if i == a[j][k]:\\n                a[j][k] = 0\\n\\n\\nif a[0][0]==0 and a[0][1]==0 and a[0][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[1][0]==0 and a[1][1]==0 and a[1][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[2][0]==0 and a[2][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][0]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][1]==0 and a[1][1]==0 and a[2][1]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][2]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][1]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"a=[[x for x in map(int,input().split())] for _ in range(3)]\\nn=int(input())\\nbingo=[[0]*3 for _ in range(3)]\\nfor k in range(n):\\n  x=int(input())\\n  for i in range(3):\\n    for j in range(3):\\n      if a[i][j]==x:\\n        bingo[i][j]=1\\nfor i in range(3):\\n  if bingo[i]==[1,1,1]:\\n    print('Yes')\\n    return\\n  if [row[i] for row in bingo]==[1,1,1]:\\n    print('Yes')\\n    return\\nif [bingo[i][i] for i in range(3)]==[1,1,1]:\\n  print('Yes')\\n  return\\nif [bingo[i][2-i] for i in range(3)]==[1,1,1]:\\n  print('Yes')\\n  return\\nprint('No')\", \"def main():\\n    A = [list(map(int,input().split())) for i in range(3)]\\n    N = int(input())\\n    b = [int(input()) for _ in range(N)]\\n\\n    for i in range(N):\\n        for j in range(3):\\n            for h in range(3):\\n                if A[j][h] == b[i]:\\n                    A[j][h] = 0\\n\\n    if A[0][0]==0 and A[0][1]==0 and A[0][2]==0:\\n        return 'Yes'\\n    elif A[1][0]==0 and A[1][1]==0 and A[1][2]==0:\\n        return 'Yes'\\n    elif A[2][0]==0 and A[2][1]==0 and A[2][2]==0:\\n        return 'Yes'\\n    elif A[0][0]==0 and A[1][0]==0 and A[2][0]==0:\\n        return 'Yes'\\n    elif A[0][1]==0 and A[1][1]==0 and A[2][1]==0:\\n        return 'Yes'\\n    elif A[0][2]==0 and A[1][2]==0 and A[2][2]==0:\\n        return 'Yes'\\n    elif A[0][0]==0 and A[1][1]==0 and A[2][2]==0:\\n        return 'Yes'\\n    elif A[0][2]==0 and A[1][1]==0 and A[2][0]==0:\\n        return 'Yes'\\n\\n    return ('No')\\n\\nprint((main()))\\n\", \"def ck_bingo(lis):\\n  flg=False\\n  for i in range(0,3):\\n    if lis[i][0]+lis[i][1]+lis[i][2]==3:\\n      flg=True\\n      break\\n    \\n  for j in range(0,3):\\n    if lis[0][j]+lis[1][j]+lis[2][j]==3:\\n      flg=True\\n      break\\n\\n  if lis[0][0]+lis[1][1]+lis[2][2]==3 \\\\\\n  or lis[0][2]+lis[1][1]+lis[2][0]==3:\\n    flg=True\\n  \\n  return flg\\n\\n\\nBingo=[[0] for _ in range(3)]\\nfor b in range(3):\\n  Bingo[b]=list(map(int,input().split()))\\n\\nN=int(input())\\nA=[[0,0,0] for _ in range(3)]\\nAns='No'\\n\\nfor i in range(N):\\n  ball=int(input())\\n  for j in range(3):\\n    for k in range(3):\\n      if ball==Bingo[j][k]:\\n        A[j][k]=1\\n        if ck_bingo(A):\\n          Ans='Yes'\\n          #break\\n    \\nprint(Ans)\\n\", \"def LIHW(h):\\n    return [list(map(int, input().split())) for _ in range(h)]\\n\\n\\ndef LIH(h):\\n    return [int(input()) for _ in range(h)]\\n\\n\\ncard = LIHW(3)\\nN = int(input())\\nnum = LIH(N)\\nbingo = [[0, 0, 0] for _ in range(3)]\\nfor i in num:\\n    for a in range(3):\\n        for b in range(3):\\n            if i == card[a][b]:\\n                bingo[a][b] = 1\\n                break\\nans = \\\"No\\\"\\nfor i in range(3):\\n    if bingo[i][0] == 1 and bingo[i][1] == 1 and bingo[i][2] == 1:\\n        ans = \\\"Yes\\\"\\nfor i in range(3):\\n    if bingo[0][i] == 1 and bingo[1][i] == 1 and bingo[2][i] == 1:\\n        ans = \\\"Yes\\\"\\nif bingo[0][0] == 1 and bingo[1][1] == 1 and bingo[2][2] == 1:\\n    ans = \\\"Yes\\\"\\nif bingo[0][2] == 1 and bingo[1][1] == 1 and bingo[2][0] == 1:\\n    ans = \\\"Yes\\\"\\nprint(ans)\\n\", \"A11,A12,A13 = list(map(int,input().split()))\\nA21,A22,A23 = list(map(int,input().split()))\\nA31,A32,A33 = list(map(int,input().split()))\\n\\nAlist = []\\nAlist.append(A11)\\nAlist.append(A12)\\nAlist.append(A13)\\nAlist.append(A21)\\nAlist.append(A22)\\nAlist.append(A23)\\nAlist.append(A31)\\nAlist.append(A32)\\nAlist.append(A33)\\nbingolist =[0]*9\\n\\nN = int(input())\\n#print (N)\\nfor i in range(N):\\n  b = int(input())\\n  #print (b)\\n  for j in range(len(bingolist)):\\n    if b ==Alist[j]:\\n      bingolist[j] = 1\\n\\nif sum(bingolist[0:3])==3 or sum(bingolist[3:6])==3 or sum(bingolist[6:9])==3 or (bingolist[0]+bingolist[3]+bingolist[6])==3 or (bingolist[1]+bingolist[4]+bingolist[7])==3 or (bingolist[2]+bingolist[5]+bingolist[8])==3 or (bingolist[0]+bingolist[4]+bingolist[8])==3 or (bingolist[2]+bingolist[4]+bingolist[6])==3:\\n  print (\\\"Yes\\\")\\nelse :\\n  print (\\\"No\\\")\\n#print (bingolist[0:3])\\n#print (bingolist[3:6])\\n#print (bingolist[6:9])\\n#print (bingolist)\\n\", \"A = [list(map(int, input().split())) for i in range(3)]\\nN = int(input())\\nB = [int(input())for i in range(N)]\\nsheet = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\n\\nfor i in range(N):\\n  for j in range(3):\\n    for k in range(3):\\n      if B[i] == A[j][k]:\\n        sheet[j][k] = 1\\nif sheet[0][0] == 1 and sheet[0][1] == 1 and sheet[0][2] == 1:\\n  print('Yes')\\nelif sheet[1][0] == 1 and sheet[1][1] == 1 and sheet[1][2] == 1:\\n  print('Yes')\\nelif sheet[2][0] == 1 and sheet[2][1] == 1 and sheet[2][2] == 1:\\n  print('Yes')\\nelif sheet[0][0] == 1 and sheet[1][0] == 1 and sheet[2][0] == 1:\\n  print('Yes')\\nelif sheet[0][1] == 1 and sheet[1][1] == 1 and sheet[2][1] == 1:\\n  print('Yes')\\nelif sheet[0][2] == 1 and sheet[1][2] == 1 and sheet[2][2] == 1:\\n  print('Yes')\\nelif sheet[0][0] == 1 and sheet[1][1] == 1 and sheet[2][2] == 1:\\n  print('Yes')\\nelif sheet[2][0] == 1 and sheet[1][1] == 1 and sheet[0][2] == 1:\\n  print('Yes')\\nelse:\\n  print('No')\", \"a_3_3 = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb_n = [int(input()) for _ in range(n)]\\n\\n\\nclass Info:\\n    def __init__(self, a_3_3, n, b_n):\\n        self.a_3_3 = a_3_3\\n        self.n = n\\n        self.b_n = b_n\\n\\n    @staticmethod\\n    def setting():\\n        for num in b_n:\\n            for line in a_3_3:\\n                if num in line:\\n                    line[line.index(num)] = 0\\n        return a_3_3\\n\\n    @staticmethod\\n    def result():\\n        diagonal_lurd = a_3_3[0][0] + a_3_3[1][1] + a_3_3[2][2]\\n        diagonal_ldru = a_3_3[2][0] + a_3_3[1][1] + a_3_3[0][2]\\n\\n        for index, line in enumerate(a_3_3):\\n            row_sum = sum(line)\\n            col_sum = a_3_3[0][index] + a_3_3[1][index] + a_3_3[2][index]\\n            if diagonal_lurd == 0 or diagonal_ldru == 0 or row_sum == 0 or col_sum == 0:\\n                print('Yes')\\n                return\\n\\n        print('No')\\n\\n\\ninfo = Info(a_3_3, n, b_n)\\ninfo.setting()\\ninfo.result()\\n\", \"a = [list(map(int,input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n\\nc = [[0]*3 for _ in range(3)]\\n\\nfor k in range(n):\\n  for i in range(3):\\n    for j in range(3):\\n      if a[i][j] == b[k]:\\n        c[i][j] += 1\\n        \\nfor i in range(3):\\n  if c[0][i] == c[1][i] == c[2][i] == 1:\\n    print(\\\"Yes\\\")\\n    return\\nfor j in range(3):\\n  if c[j][0] == c[j][1] == c[j][2] == 1:\\n    print(\\\"Yes\\\")\\n    return\\nif c[0][0] == c[1][1] == c[2][2] == 1:\\n  print(\\\"Yes\\\")\\n  return\\nif c[0][2] == c[1][1] == c[2][0] == 1:\\n  print(\\\"Yes\\\")\\n  return\\nprint(\\\"No\\\")\", \"A_11,A_12,A_13=list(map(int,input().split()))\\nA_21,A_22,A_23=list(map(int,input().split()))\\nA_31,A_32,A_33=list(map(int,input().split()))\\nN=int(input())\\nLi=[A_11,A_12,A_13,A_21,A_22,A_23,A_31,A_32,A_33]\\nfor i in range(N):\\n  b=int(input())\\n  if b in Li:\\n    Num=Li.index(b)\\n    Li[Num]=0\\n\\nif Li[0]==Li[1]==Li[2]==0 or Li[3]==Li[4]==Li[5]==0 or Li[6]==Li[7]==Li[8]:\\n  print(\\\"Yes\\\")\\nelif Li[0]==Li[3]==Li[6]==0 or Li[1]==Li[4]==Li[7]==0 or Li[2]==Li[5]==Li[8]:\\n  print(\\\"Yes\\\")\\nelif Li[0]==Li[4]==Li[8]==0 or Li[2]==Li[4]==Li[6]==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nfor j in range(3): A.append([A[i][j] for i in range(3)])\\nA.append([A[0][0], A[1][1], A[2][2]])\\nA.append([A[2][0], A[1][1], A[0][2]])\\nd = {int(input()): 0 for _ in range(int(input()))}\\nprint(\\\"YNeos\\\"[all(any(d.get(v, 1) for v in r) for r in A)::2])\", \"def main():\\n    card = [[int(j) for j in input().split()] for i in range(3)]\\n    n = int(input())\\n    def punch(v):\\n        for i in range(len(card)):\\n            for j in range(len(card[i])):\\n                if card[i][j] == v:\\n                    card[i][j] = True\\n        return card\\n\\n    def check(board):\\n        for i in range(len(board)):\\n            l = list(set(board[i]))\\n            if len(l)==1 and l[0] ==True:\\n                return True\\n        for i in range(len(board[0])):\\n            if board[0][i] == board[1][i]==board[2][i] == True:\\n                return True\\n        if board[0][0] == board[1][1]==board[2][2] == True:\\n            return True\\n        if board[0][2] == board[1][1]==board[2][0] == True:\\n            return True\\n\\n    for _ in range(n):\\n        num = int(input())\\n        if check(punch(num)):\\n            return \\\"Yes\\\"\\n    return \\\"No\\\"\\n\\n\\n    print(card)\\n\\ndef __starting_point():\\n    print(main())\\n__starting_point()\", \"import numpy as np\\n\\nCARD_SIZE = 3\\n\\n\\ndef solve(card, called_numbers):\\n    checked_card = np.vectorize(lambda n: n in called_numbers)(card)\\n\\n    for l in checked_card:\\n        if all(l):\\n            return True\\n\\n    for l in zip(*checked_card):\\n        if all(l):\\n            return True\\n\\n    if all([checked_card[n][n] for n in range(CARD_SIZE)]):\\n        return True\\n    if all([checked_card[n][CARD_SIZE - n - 1] for n in range(CARD_SIZE)]):\\n        return True\\n\\n    return False\\n\\n\\ndef resolve():\\n    card = [[int(row) for row in input().split()] for _ in range(CARD_SIZE)]\\n\\n    N = int(input())\\n    called_numbers = {int(input()) for n in range(N)}\\n\\n    ret = solve(card, called_numbers)\\n\\n    print(\\\"Yes\\\" if ret else \\\"No\\\")\\n\\n\\ndef __starting_point():\\n    resolve()\\n__starting_point()\", \"A = [[int(i) for i in input().split()] for j in range(3)]\\nN = int(input())\\nb = [int(input()) for i in range(N)]\\nfor i in range(N):\\n    for j in range(3):\\n        for k in range(3):\\n            if(b[i] == A[j][k]):\\n                A[j][k] = 0\\nfor i in range(3):\\n    if(A[i][0] == A[i][1] and A[i][1] == A[i][2]):\\n        print(\\\"Yes\\\")\\n        return\\n    if(A[0][i] == A[1][i] and A[1][i] == A[2][i]):\\n        print(\\\"Yes\\\")\\n        return\\nif(A[0][0] == A[1][1] and A[1][1] == A[2][2]):\\n    print(\\\"Yes\\\")\\n    return\\nif(A[0][2] == A[1][1] and A[1][1] == A[2][0]):\\n    print(\\\"Yes\\\")\\n    return\\nprint(\\\"No\\\")\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\n\\nfor i in b:\\n    for j in range(0,3):\\n        for k in range(0,3):\\n            if i == a[j][k]:\\n                a[j][k] = 0\\n\\n\\nif a[0][0]==0 and a[0][1]==0 and a[0][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[1][0]==0 and a[1][1]==0 and a[1][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[2][0]==0 and a[2][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][0]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][1]==0 and a[1][1]==0 and a[2][1]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][2]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][0]==0 and a[1][1]==0 and a[2][2]==0:\\n    print(\\\"Yes\\\")\\nelif a[0][2]==0 and a[1][1]==0 and a[2][0]==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"from typing import List\\n\\n\\ndef answer(a: List[List[int]], n: int, b: List[int]) -> str:\\n    bingo_card = list([i[j] in b for i in a] for j in range(3))\\n    for i in range(2):\\n        for j in bingo_card:\\n            if all(j):\\n                return 'Yes'\\n        if i == 0:\\n            bingo_card = list(zip(*bingo_card))\\n\\n    if bingo_card[0][0] and bingo_card[1][1] and bingo_card[2][2]:\\n        return 'Yes'\\n    if bingo_card[0][2] and bingo_card[1][1] and bingo_card[2][0]:\\n        return 'Yes'\\n\\n    return 'No'\\n\\n\\ndef main():\\n    a = [list(map(int, input().split())) for _ in range(3)]\\n    n = int(input())\\n    b = list(int(input()) for _ in range(n))\\n    print(answer(a, n, b))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def check(arr):\\n    # \\u6a2a\\u30c1\\u30a7\\u30c3\\u30af\\n    for i in range(len(arr)):\\n        if arr[i] == [\\\"x\\\", \\\"x\\\", \\\"x\\\"]:\\n            return True\\n\\n    # \\u7e26\\u30c1\\u30a7\\u30c3\\u30af\\n    for i in range(3):\\n        if arr[0][i] == \\\"x\\\" and arr[1][i] == \\\"x\\\" and arr[2][i] == \\\"x\\\":\\n            return True\\n\\n    # \\u659c\\u3081\\u30c1\\u30a7\\u30c3\\u30af\\n    if arr[0][0] == \\\"x\\\" and arr[1][1] == \\\"x\\\" and arr[2][2] == \\\"x\\\":\\n        return True\\n    elif arr[0][2] == \\\"x\\\" and arr[1][1] == \\\"x\\\" and arr[2][0] == \\\"x\\\":\\n        return True\\n\\n    return False\\n\\narr = []\\nfor _ in range(3):\\n    arr.append(list(map(int, input().split(' '))))\\n\\nn = int(input())\\nfor _ in range(n):\\n    b = int(input())\\n    for i in range(len(arr)):\\n        tmp_arr = []\\n        for ele in arr[i]:\\n            if b == ele:\\n                tmp_arr.append(\\\"x\\\")\\n            else:\\n                tmp_arr.append(ele)\\n        arr[i] = tmp_arr\\n\\nif check(arr) == True:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"A = [0 for i in range(9)]\\nfor i in range(3):\\n  A[3*i], A[3*i+1], A[3*i+2] = map(int, input().split())\\nN = int(input())\\nb = [0 for i in range(N)]\\nfor i in range(N):\\n  b[i] = int(input())\\n\\n#Check matching numbers\\nfor i in range(9):\\n  for j in range(N):\\n    if A[i] == b[j]:\\n      A[i] = 1\\n\\n# Check bingo or not\\nflag = 0\\n# Check rows\\nfor i in [0, 3, 6]:\\n  if A[i]==A[i+1] and A[i+1]==A[i+2]:\\n    flag += 1\\n# Check colums\\nfor j in range(3):\\n  if A[j]==A[j+3] and A[j+3]==A[j+6]:\\n    flag += 1\\n# Check naname?\\nif (A[0]==A[4] and A[4]==A[8]) or (A[2]==A[4] and A[4]==A[6]):\\n  flag += 1\\n\\nif flag >= 1:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"A = {}\\nfor i in range(3) :\\n    a1,a2,a3 = map(int, input().split())\\n    A[a1] = (i,0)\\n    A[a2] = (i,1)\\n    A[a3] = (i,2)\\n\\nN = int(input())\\nA2 = [[False,False,False] for i in range(3)]\\n\\nfor i in range(N):\\n    b = int(input())\\n    if(b not in A) :\\n        continue\\n    r,c = map(int,A[b])\\n    A2[r][c] = True\\n\\ndef isBingo(table) :\\n    for r in range(3) :\\n        if(table[r][0] and table[r][1] and table[r][2]) :\\n            return True\\n    for c in range(3) :\\n        if(table[0][c] and table[1][c] and table[2][c]) :\\n            return True\\n    if(table[0][0] and table[1][1] and table[2][2]) :\\n        return True\\n    if(table[0][2] and table[1][1] and table[2][0]) :\\n        return True\\n    return False\\n\\nif(isBingo(A2)) :\\n    print(\\\"Yes\\\")\\nelse :\\n    print(\\\"No\\\")\", \"A = [list(map(int,input().split())) for _ in range(3)]\\nN = int(input())\\nb = [int(input()) for _ in range(N)]\\nc = [[0]*3 for _ in range(3)]\\nfor x in b:\\n  for i in range(3):\\n    for j in range(3):\\n      if A[i][j] == x:\\n        c[i][j] = 1\\n\\nif c[0] == [1,1,1] or c[1] == [1,1,1] or c[2] == [1,1,1]:\\n  print(\\\"Yes\\\")\\nelif [c[0][0], c[1][0], c[2][0]] == [1,1,1] or [c[0][1], c[1][1], c[2][1]] == [1,1,1] or [c[0][2], c[1][2], c[2][2]] == [1,1,1]:\\n  print(\\\"Yes\\\")\\nelif [c[0][0], c[1][1], c[2][2]] == [1,1,1] or [c[2][0], c[1][1], c[0][2]] == [1,1,1]:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"A=[list(map(int,input().split())) for i in range(3)]\\nn=int(input())\\nb=[int(input()) for i in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(n):\\n            if A[i][j]==b[k]:\\n                A[i][j]=-1\\nif A[0][0]==-1 and A[1][1]==-1 and A[2][2]==-1:\\n    print(\\\"Yes\\\")\\n    return\\nelif A[0][2]==-1 and A[1][1]==-1 and A[2][0]==-1:\\n    print(\\\"Yes\\\")\\n    return\\nfor i in range(3):\\n    total=0\\n    if A[i].count(-1)==3:\\n        print(\\\"Yes\\\")\\n        return\\n    for j in range(3):\\n        if A[j][i]==-1:\\n            total+=1\\n    if total==3:\\n        print(\\\"Yes\\\")\\n        return\\nprint(\\\"No\\\")\", \"a = [list(map(int, input().split())) for i in range(3)]\\nn =int(input())\\n\\nfor k in range(n):\\n    b = int(input())\\n    for i in range(3):\\n        for j in range(3):\\n            if a[i][j] == b:\\n                a[i][j] = 0\\n    row0 = a[0] == [0, 0, 0]\\n    row1 = a[1] == [0, 0, 0]\\n    row2 = a[2] == [0, 0, 0]\\n    colum0 = [a[0][0], a[1][0], a[2][0]] == [0, 0, 0]\\n    colum1 = [a[0][1], a[1][1], a[2][1]] == [0, 0, 0]\\n    colum2 = [a[0][2], a[1][2], a[2][2]] == [0, 0, 0]\\n    diag0 = [a[0][0], a[1][1], a[2][2]] == [0, 0, 0]\\n    diag1 = [a[2][0], a[1][1], a[0][2]] == [0, 0, 0]\\n    if row0 or row1 or row2 or colum0 or colum1 or colum2 or diag0 or diag1:\\n        print('Yes')\\n        break\\nelse:\\n    print('No')\", \"def main():\\n  A = []\\n  C = [False] * 9\\n  for i in range(3):\\n    a0, a1, a2 = map(int, input().split())\\n    A.append(a0)\\n    A.append(a1)\\n    A.append(a2)\\n    \\n  N = int(input())\\n  for i in range(N):\\n    b = int(input())\\n    if b in A:\\n      C[A.index(b)] = True\\n\\n  for i in range(3):\\n    if C[0+3*i] and C[1+3*i] and C[2+3*i]:\\n      print(\\\"Yes\\\")\\n      return\\n\\n  for i in range(3):\\n    if C[i] and C[i+3] and C[i+6]:\\n      print(\\\"Yes\\\")\\n      return\\n\\n  if C[0] and C[4] and C[8]:\\n    print(\\\"Yes\\\")\\n    return\\n\\n  if C[2] and C[4] and C[6]:\\n    print(\\\"Yes\\\")\\n    return\\n\\n  print(\\\"No\\\")\\n\\n    \\nmain()\", \"a = [list(map(int,input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n#\\u884c\\u306e\\u5224\\u5b9a\\nfor i in range(3):\\n  for j in range(3):\\n    if a[i][j] not in b:\\n      break\\n    elif j == 2:\\n      print(\\\"Yes\\\")\\n      return\\n#\\u5217\\u306e\\u5224\\u5b9a\\nfor i in range(3):\\n  for j in range(3):\\n    if a[j][i] not in b:\\n      break\\n    elif j == 2:\\n      print(\\\"Yes\\\")\\n      return\\n#\\u306a\\u306a\\u3081\\u306e\\u5224\\u5b9a\\nif a[0][0] in b and a[1][1] in b and a[2][2] in b:\\n  print(\\\"Yes\\\")\\n  return\\nif a[0][2] in b and a[1][1] in b and a[2][0] in b:\\n  print(\\\"Yes\\\")\\n  return\\nprint(\\\"No\\\")\", \"l = [list(map(int, input().split())) for i in range(3)]\\nn = int(input())\\ns = set([int(input()) for j in range(n)])\\n\\nans = \\\"No\\\"\\n\\nfor i in range(3):\\n    if l[i][0] in s and l[i][1] in s and l[i][2] in s:\\n        ans = \\\"Yes\\\"\\n\\nfor i in range(3):\\n    if l[0][i] in s and l[1][i] in s and l[2][i] in s:\\n        ans = \\\"Yes\\\"\\n\\nif l[0][0] in s and l[1][1] in s and l[2][2] in s:\\n    ans = \\\"Yes\\\"\\nelif l[0][2] in s and l[1][1] in s and l[2][0] in s:\\n    ans = \\\"Yes\\\"\\n\\nprint(ans)\", \"import math\\ndef i_input(): return int(input())\\n\\n\\ndef i_map(): return map(int, input().split())\\n\\n\\ndef i_list(): return list(map(int, input().split()))\\n\\n\\ndef i_row(N): return [int(input()) for _ in range(N)]\\n\\n\\ndef i_row_list(N): return [list(map(int, input().split())) for _ in range(N)]\\n\\naaa= i_row_list(3)\\nn=i_input()\\nb=i_row(n)\\nans='No'\\nfor i in range(3):\\n    for j in range(3):\\n        if aaa[i][j] in b:\\n            aaa[i][j]=0\\nxlos1=0\\nxlos2=0\\nfor i in range(3):\\n    colm=0\\n    rows=0\\n\\n    for j in range(3):\\n        colm+=aaa[i][j]\\n        rows+=aaa[j][i]\\n    xlos1+=aaa[i][i]\\n    xlos2+=aaa[2-i][i]\\n    if colm==0 or rows==0:\\n        ans='Yes'\\n        break\\nif ans!='Yes':\\n    if xlos1==0 or xlos2==0:\\n        ans='Yes'\\n\\n\\nprint(ans)\", \"def Judge(a):\\n  col=[]\\n  diag1=0\\n  diag2=0\\n\\n  for i in range(3):\\n    if(a[i].count(0)==3):\\n      return 1\\n      break\\n    if(a[i][0]==0):\\n      col.append(0)\\n    if(a[i][1]==0):\\n      col.append(1)\\n    if(a[i][2]==0):\\n      col.append(2)\\n    if(a[i][i]==0):\\n      diag1+=1\\n    if(a[i][-(i+1)]==0):\\n      diag2+=1\\n  if(diag1==3 or diag2==3):\\n    return 1\\n  if(col.count(0)==3 or col.count(1)==3 or col.count(2)==3):\\n    return 1\\n  return 0\\n\\n\\na=[]\\nfor i in range(3):\\n  a.append(list(map(int,input().split())))\\nn=int(input())\\nfor i in range(n):\\n  b=int(input())\\n  for j in range(3):\\n    for k in range(3):\\n      if(b==a[j][k]):\\n        a[j][k]=0\\njudge=Judge(a)\\nif(judge==1):\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\ncdl = 0\\ncdr = 0\\nfor i in range(3):\\n    cr = 0\\n    cc = 0\\n    for j in range(3):\\n        if A[i][j] in b:\\n            cr += 1\\n        if A[j][i] in b:\\n            cc += 1\\n        if i == j and A[i][j] in b:\\n            cdl += 1\\n        if i+j==2 and A[i][j] in b:\\n            cdr += 1\\n\\n    if cr == 3 or cc == 3 or cdl == 3 or cdr ==3:\\n        print('Yes')\\n        return\\nprint('No')\", \"def resolve():\\n\\ta = []\\n\\tbingo = [(0,3,6),(1,4,7),(2,5,8),(0,1,2),(3,4,5)\\n\\t\\t\\t ,(6,7,8),(0,4,8),(2,4,6)]\\n\\tfor _ in range(3):\\n\\t\\ta += list(map(int,input().split()))\\n\\tfor i in range(int(input())):\\n\\t\\tr = int(input())\\n\\t\\tif r in a:\\n\\t\\t\\ta[a.index(r)]=0\\n\\tans = 'No'\\n\\tfor i in bingo:\\n\\t\\tif a[i[0]] == 0 and a[i[1]]==0 and a[i[2]]==0:\\n\\t\\t\\tans ='Yes'\\n\\tprint(ans)\\nresolve()\", \"# coding=utf-8\\nimport sys\\n\\ndef __starting_point():\\n    bingo = [[0] * 3 for i in range(3)]\\n\\n    ans = [[0] * 3 for i in range(3)]\\n    for i in range(3):\\n        temp = list(map(int, input().split()))\\n        for j in range(3):\\n            bingo[i][j] = temp[j]\\n\\n    N = int(input())\\n\\n    for i in range(N):\\n        b = int(input())\\n        for j in range(3):\\n            for k in range(3):\\n                if bingo[j][k] == b:\\n                    ans[j][k] = 1\\n\\n    #print(bingo, ans)\\n\\n\\n    for i in range(3):\\n        if (ans[0][i] + ans[1][i] + ans[2][i]) == 3:\\n            print(\\\"Yes\\\")\\n            return\\n\\n    for i in range(3):\\n        if (ans[i][0] + ans[i][1] + ans[i][2]) == 3:\\n            print(\\\"Yes\\\")\\n            return\\n\\n    #naname\\n    if (ans[0][0] + ans[1][1] + ans[2][2]) == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\n    if (ans[0][2] + ans[1][1] + ans[2][0]) == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\n    print('No')\\n\\n__starting_point()\", \"a = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        if (a[i][j] in b):\\n            a[i][j] = 0\\n#print(a)\\ntnp = 0\\nfor i in range(3):\\n    if (sum(a[i])==0):\\n        tnp += 1\\nfor i in range(3):\\n    if (a[0][i]+a[1][i]+a[2][i]==0):\\n        tnp += 1\\nif (a[0][0]+a[1][1]+a[2][2]==0):\\n    tnp += 1\\nif (a[0][2] + a[1][1] + a[2][0]==0):\\n    tnp += 1\\nif (tnp>0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def main():\\n    a = [list(map(int, input().split())) for _ in range(3)]\\n    n = int(input())\\n    b = [int(input()) for _ in range(n)]\\n    if a[0][0] in b and a[0][1] in b and a[0][2] in b or \\\\\\n        a[1][0] in b and a[1][1] in b and a[1][2] in b or \\\\\\n            a[2][0] in b and a[2][1] in b and a[2][2] in b or \\\\\\n                a[0][0] in b and a[1][0] in b and a[2][0] in b or \\\\\\n                    a[0][1] in b and a[1][1] in b and a[2][1] in b or \\\\\\n                        a[0][2] in b and a[1][2] in b and a[2][2] in b or \\\\\\n                            a[0][0] in b and a[1][1] in b and a[2][2] in b or \\\\\\n                                a[0][2] in b and a[1][1] in b and a[2][0] in b:\\n                                    print('Yes')\\n    else:\\n        print('No')\\n        \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"a = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\nfor i in range(3):\\n  for j in range(3):\\n    if a[i][j] in b:\\n      a[i][j] = \\\"o\\\"\\nfor i in range(3):\\n  if a[i][0] == a[i][1] == a[i][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][i] == a[1][i] == a[2][i]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][0] == a[1][1] == a[2][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][2] == a[1][1] == a[2][0]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif i == 2:\\n    print(\\\"No\\\")\", \"a = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\nfor i in range(3):\\n  for j in range(3):\\n    if a[i][j] in b:\\n      a[i][j] = \\\"o\\\"\\nfor i in range(3):\\n  if a[i][0] == a[i][1] == a[i][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][i] == a[1][i] == a[2][i]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][0] == a[1][1] == a[2][2]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif a[0][2] == a[1][1] == a[2][0]:\\n    print(\\\"Yes\\\")\\n    return\\n  elif i == 2:\\n    print(\\\"No\\\")\", \"arr1 = list(map(int, input().split()))\\narr2 = list(map(int, input().split()))\\narr3 = list(map(int, input().split()))\\nn = int(input())\\nfor _ in range(n):\\n    x = int(input())\\n    if x in arr1:\\n        arr1[arr1.index(x)] -= x\\n    elif x in arr2:\\n        arr2[arr2.index(x)] -= x\\n    elif x in arr3:\\n        arr3[arr3.index(x)] -= x\\n    if _ >= 3:\\n        if arr1[0] == arr1[1] and arr1[1] == arr1[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        if arr2[0] == arr2[1] and arr2[1] == arr2[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        if arr3[0] == arr3[1] and arr3[1] == arr3[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        for jj in range(3):\\n            if arr1[jj] == arr2[jj] and arr2[jj] == arr3[jj]:\\n                print(\\\"Yes\\\")\\n                return\\n        if arr1[0] == arr2[1] and arr2[1] == arr3[2]:\\n            print(\\\"Yes\\\")\\n            return\\n        if arr1[2] == arr2[1] and arr2[1] == arr3[0]:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"a = input()\\na = a.split()\\nb = input()\\nb = b.split()\\nc = input()\\nc = c.split()\\nd = [a[0],b[0],c[0]]\\ne = [a[1],b[1],c[1]]\\nf = [a[2],b[2],c[2]]\\ng = [a[0],b[1],c[2]]\\nh = [a[2],b[1],c[0]]\\nn = int(input())\\nfor i in range(n):\\n    j = int(input())\\n    for k in range(3):\\n        if int(a[k])==j:\\n            a.pop(k)\\n            a.insert(k,0)\\n        if int(b[k])==j:\\n            b.pop(k)\\n            b.insert(k,0)\\n        if int(c[k])==j:\\n            c.pop(k)\\n            c.insert(k,0)\\n        if int(d[k])==j:\\n            d.pop(k)\\n            d.insert(k,0)\\n        if int(e[k])==j:\\n            e.pop(k)\\n            e.insert(k,0)\\n        if int(f[k])==j:\\n            f.pop(k)\\n            f.insert(k,0)\\n        if int(g[k])==j:\\n            g.pop(k)\\n            g.insert(k,0)\\n        if int(h[k])==j:\\n            h.pop(k)\\n            h.insert(k,0)\\nif a == [0,0,0] or b == [0,0,0] or c == [0,0,0] or d == [0,0,0] or e == [0,0,0] or f == [0,0,0] or g == [0,0,0] or h == [0,0,0]:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"A = [list(map(int,input().split())) for i in range(3)]\\nN = int(input())\\nfor i in range(N):\\n    b = int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if A[j][k] == b:\\n                A[j][k] = 0\\nans = \\\"No\\\"\\nfor i in range(3):\\n    if A[i] == [0,0,0]:\\n        ans = \\\"Yes\\\"\\n        break\\n    for j in range(3):\\n        if A[j][i] != 0:\\n            break\\n    else:\\n        ans = \\\"Yes\\\"\\n        break\\nfor i in range(3):\\n    if A[i][i] != 0:\\n        break\\nelse:\\n    ans = \\\"Yes\\\"\\nif A[0][2] == 0 and A[1][1] == 0 and A[2][0] == 0:\\n    ans = \\\"Yes\\\"\\nprint(ans)\", \"A = []\\nP = ['o']*9\\nfor i in range(3):\\n    a = [int(i) for i in input().split()]\\n    for j in range(3):\\n        A.append(a[j])\\n\\nN = int(input())\\nfor i in range(N):\\n    b = int(input())\\n    for j in range(9):\\n        if A[j] == b:\\n            P[j] = 'x'\\n\\nt = 0\\nfor i in range(3):\\n    if (P[i] == P[i+3] == P[i+6] == 'x') or (P[3*i] == P[3*i+1] == P[3*i+2] == 'x'):\\n        t += 1\\n        break\\nif (P[0] == P[4] == P[8] == 'x') or (P[2] == P[4] == P[6] == 'x'):\\n    t += 1\\n\\nif t == 0:\\n    print('No')\\nelse:\\n    print('Yes')\", \"import numpy as np\\n\\narr = np.array([list(map(int, input().split())) for _ in range(3)])\\n\\n\\nn = int(input())\\n\\nfor _ in range(n):\\n    b = int(input())\\n    arr[np.where(arr == b)] = 0\\n\\nans1 = (np.sum(arr, axis=0) == 0).sum() >= 1\\nans2 = (np.sum(arr, axis=1) == 0).sum() >= 1\\nans3 = (np.diag(arr) == 0).sum() == 3\\nans4 = (np.diag(np.rot90(arr)) == 0).sum() == 3\\n\\nprint(\\\"Yes\\\" if ans1 or ans2 or ans3 or ans4 else \\\"No\\\")\", \"A11,A12,A13 = list(map(int,input().split()))\\nA21,A22,A23 = list(map(int,input().split()))\\nA31,A32,A33 = list(map(int,input().split()))\\nA = [[A11,A12,A13],[A21,A22,A23],[A31,A32,A33]]\\n\\nN = int(input())\\nb = [int(input()) for _ in range(N)]\\n\\nfor i in range(3):\\n    for j in range(3):\\n        if A[i][j] in b:\\n            A[i][j] = 'YES'\\n\\n\\nif A[1][1]=='YES':\\n    if A[1][0]==A[1][2]=='YES' or A[0][1]==A[2][1]=='YES' or A[0][0]==A[2][2]=='YES' or A[0][2]==A[2][0]=='YES':\\n        print('Yes')\\n    else:\\n        print('No')\\n\\nelse:\\n    if A[0][0]==A[0][1]==A[0][2]=='YES' or A[0][0]==A[1][0]==A[2][0]=='YES' or A[2][0]==A[2][1]==A[2][2]=='YES' or A[0][2]==A[1][2]==A[2][2]=='YES':\\n        print('Yes')\\n\\n    else:\\n        print('No')\\n\\n\\n\", \"l = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = list(int(input()) for _ in range(n))\\nfor i in range(3) :\\n    for j in range(3) :\\n        for k in range(n) :\\n            if l[i][j] == b[k] :\\n                l[i][j] = 0\\n\\nfor i in range(3) :\\n    if l[i][0] + l[i][1] + l[i][2] == 0 :\\n        print('Yes')\\n        return\\n    if l[0][i] + l[1][i] + l[2][i] == 0 :\\n        print('Yes')\\n        return\\n    if l[0][0] + l[1][1] + l[2][2] == 0 :\\n        print('Yes')\\n        return\\n    if  l[0][2] + l[1][1] + l[2][0] == 0 :\\n        print('Yes')\\n        return\\nprint('No')\", \"bingo = []\\nkiroku = [[0,0,0] for i in range(3)]\\nfor i in range(3):\\n    a,b,c = map(int,input().split())\\n    bingo.append([a,b,c])\\n\\nn =  int(input())\\nfor j in range(n):\\n    num = int(input())\\n    for k in range(3):\\n        for l in range(3):\\n            if bingo[k][l] == num:\\n                kiroku[k][l] = 1\\nans = 0\\n\\nfor i in range(3):\\n    if (kiroku[i][0] == kiroku[i][1] == kiroku[i][2] == 1) or (kiroku[0][i] == kiroku[1][i] == kiroku[2][i] == 1):\\n        ans = 1\\n        break\\nif (kiroku[0][0] == kiroku[1][1] == kiroku[2][2] == 1) or (kiroku[0][2] == kiroku[1][1] == kiroku[2][0] == 1):\\n    ans = 1\\n\\n\\nif ans == 1:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"a=[list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))]\\nN=int(input())\\nb=list()\\nfor i in range(0,N):\\n    b.append(int(input()))\\nfor j in range(0,3):\\n    for k in range(0,3):\\n        for i in range(0,N):\\n            if a[j][k]==b[i]:\\n                a[j][k]=0\\nfor i in range(0,3):\\n    if a[i][0]==a[i][1] and a[i][1]==a[i][2]:\\n        print(\\\"Yes\\\")\\n        break\\n    elif a[0][i]==a[1][i] and a[1][i]==a[2][i]:\\n        print(\\\"Yes\\\")\\n        break\\n    elif a[0][0]==a[1][1] and a[1][1]==a[2][2]:\\n        print(\\\"Yes\\\")\\n        break\\n    elif a[2][0]==a[1][1] and a[1][1]==a[0][2]:\\n        print(\\\"Yes\\\")\\n        break\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"l = [ list(map(int,input().split(\\\" \\\"))) for i in range(3)]\\nn=int(input())\\nfor i in range(n):\\n    b=int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if l[j][k]==b:\\n                l[j][k]=-1\\nif l[0][0]==-1 and l[0][1]==-1 and l[0][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[1][0]==-1 and l[1][1]==-1 and l[1][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[2][0]==-1 and l[2][1]==-1 and l[2][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][0]==-1 and l[1][0]==-1 and l[2][0]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][1]==-1 and l[1][1]==-1 and l[2][1]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][2]==-1 and l[1][2]==-1 and l[2][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][0]==-1 and l[1][1]==-1 and l[2][2]==-1:\\n    print(\\\"Yes\\\")\\nelif l[0][2]==-1 and l[1][1]==-1 and l[2][0]==-1:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nbingo = []\\nfor _ in range(3):\\n    bingo.append(list(map(int, input().split())))\\n\\nN = int(input())\\nnums = []\\nfor _ in range(N):\\n    nums.append(int(input()))\\n\\nfor num in nums:\\n    for i in range(3):\\n        for j in range(3):\\n            if bingo[i][j] == num:\\n                bingo[i][j] = -1\\n\\nfor i in range(3):\\n    if sum(bingo[i]) == -3:\\n        print(\\\"Yes\\\")\\n        return\\n    tmp = 0\\n    for j in range(3):\\n        tmp += bingo[j][i]\\n    if tmp == -3:\\n        print(\\\"Yes\\\")\\n        return\\nif bingo[0][0] == -1 and bingo[1][1] == -1 and bingo[2][2] == -1:\\n    print(\\\"Yes\\\")\\n    return\\nif bingo[0][2] == -1 and bingo[1][1] == -1 and bingo[0][2] == -1:\\n    print(\\\"Yes\\\")\\n    return\\n\\nprint(\\\"No\\\")\", \"A11,A12,A13 = map(int,input().split())\\nA21,A22,A23 = map(int,input().split())\\nA31,A32,A33 = map(int,input().split())\\nA =[[A11,A12,A13],[A21,A22,A23],[A31,A32,A33]]\\nN =int(input())\\nb = []\\nfor x in range(N):\\n    b.append(int(input()))\\n    for i in range(3):\\n        for j in range(3):\\n            A[i][j] = 'YES' if b[x] == A[i][j] else A[i][j]\\nif A[0][0]==A[0][1]==A[0][2]=='YES' or A[1][0]==A[1][1]==A[1][2]=='YES' or A[2][0]==A[2][1]==A[2][2]=='YES' or \\\\\\nA[0][0]==A[1][0]==A[2][0]=='YES' or A[0][1]==A[1][1]==A[2][1]=='YES' or A[0][2]==A[1][2]==A[2][2]=='YES' or \\\\\\nA[0][0]==A[1][1]==A[2][2]=='YES' or A[0][2]==A[1][1]==A[2][0]=='YES' :\\n    print('Yes')\\nelse :\\n    print('No')\", \"table=[[0]*3 for _ in range(3)]\\nA=[list(map(int,input().split())) for _ in range(3)]\\nA=sum(A,[])\\nN=int(input())\\nB=[int(input()) for _ in range(N)]\\n\\nfor b in B:\\n    tmp=[i for i,x in enumerate(A) if x==b]\\n    for t in tmp:\\n        table[t//3][t%3]=1\\n\\nflag=False\\nn1,n2=0,0\\nfor i in range(3):\\n    if sum(table[i])==3: flag=True\\n    if sum([table[j][i] for j in range(3)])==3: flag=True\\n    n1+=table[i][i]\\n    n2+=table[i][2-i]\\nif n1==3 or n2==3: flag=True\\nif flag: print('Yes')\\nelse: print('No')\\n\", \"a,b,c = list(map(int,input().split()))\\nd,e,f = list(map(int,input().split()))\\ng,h,i = list(map(int,input().split()))\\n\\nx = []\\ny = [a,b,c,d,e,f,g,h,i]\\n\\nn = int(input())\\nfor s in range(n):\\n  x.append(int(input()))\\n\\nfor m in range(9):\\n  if y[m] in x:\\n      y[m] = 0\\n\\nif y[0] == y[1] == y[2] == 0:\\n    print(\\\"Yes\\\")\\nelif y[3] == y[4] == y[5] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[6] == y[7] == y[8] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[0] == y[3] == y[6] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[1] == y[4] == y[7] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[2] == y[5] == y[8] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[0] == y[4] == y[8] == 0:\\n    print(\\\"Yes\\\")\\n\\nelif y[2] == y[4] == y[6] == 0:\\n    print(\\\"Yes\\\")\\n\\nelse:\\n\\n    print(\\\"No\\\")\\n\", \"import numpy as np\\n\\nA1=np.array(list(map(int,input().split())))\\nA2=np.array(list(map(int,input().split())))\\nA3=np.array(list(map(int,input().split())))\\nA=np.concatenate([A1,A2,A3]).reshape(3,3)\\n\\nN=int(input())\\n\\nfor i in range(N):\\n    b=int(input())\\n    A[np.where(A==b)] = 0\\n\\nif np.all(A[0,:]==0) or np.all(A[1,:]==0) or np.all(A[2,:]==0) or np.all(A[:,0]==0) or np.all(A[:,1]==0) \\\\\\n    or np.all(A[:,2]==0) or A[0,0]**2+A[1,1]**2+A[2,2]**2==0 or A[0,2]**2+A[1,1]**2+A[2,0]**2==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"a = []\\nfor i in range(3):\\n    a.extend(list(map(int,input().split())))\\nn = int(input())\\nb = []\\n\\ncnt=[]\\npattern=[[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,7],[2,5,8],[0,4,8],[2,4,6]]\\n\\nfor i in range(n):\\n    b.append(int(input()))\\n    for j , x in enumerate(a):\\n        if x == b[i]:\\n            cnt.append(j)\\n\\nfor q,w,e in pattern:\\n    if q in cnt and w in cnt and e in cnt:\\n        print('Yes')\\n        break\\nelse:\\n    print('No')\", \"L = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nB = list(int(input()) for _ in range(n))\\nans = 'No'\\nfor i in range(3):\\n  for j in range(3):\\n    for b in B:\\n      if L[i][j] == b:\\n        L[i][j] = 0\\n        \\nfor i in range(3):\\n  if L[i][0] == L[i][1] == L[i][2] == 0: ans = 'Yes' #\\u6a2a\\n  if L[0][i] == L[1][i] == L[2][i] == 0: ans = 'Yes' #\\u7e26\\nif L[0][0] == L[1][1] == L[2][2] == 0: ans = 'Yes'\\nif L[0][2] == L[1][1] == L[2][0] == 0: ans = 'Yes'\\n  \\nprint(ans)\", \"rows = []\\nfor _ in range(3):\\n    A = list(map(int, input().split()))\\n    rows.append(A)\\n\\nN = int(input())\\n\\nfor _ in range(N):\\n    b = int(input())\\n    for i in range(3):\\n        for j in range(3):\\n            if rows[i][j] == b:\\n                rows[i][j] = 0\\n\\nif rows[0][0]+rows[0][1]+rows[0][2] == 0 or rows[1][0]+rows[1][1]+rows[1][2] == 0 or rows[2][0]+rows[2][1]+rows[2][2] == 0 \\\\\\n    or rows[0][0]+rows[1][0]+rows[2][0] == 0 or rows[0][1]+rows[1][1]+rows[2][1] == 0 or rows[0][2]+rows[1][2]+rows[2][2] == 0 \\\\\\n    or rows[0][0]+rows[1][1]+rows[2][2] == 0 or rows[0][2]+rows[1][1]+rows[2][0] == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nN = int(input())\\nb = [int(input()) for _ in range(N)]\\n\\nfor i in range(N):\\n    for j in range(3):\\n        for k in range(3):\\n            if b[i] == A[j][k]:\\n                A[j][k] = 0\\nans = 'No'\\nfor i in range(3):\\n    if all(c == 0 for c in [A[i][0], A[i][1], A[i][2]]):\\n        ans = 'Yes'\\nfor i in range(3):\\n    if all(c == 0 for c in [A[0][i], A[1][i], A[2][i]]):\\n        ans = 'Yes'\\nif all(c == 0 for c in [A[0][0], A[1][1], A[2][2]]):\\n    ans = 'Yes'\\nif all(c == 0 for c in [A[0][2], A[1][1], A[2][0]]):\\n    ans = 'Yes'\\nprint(ans)\\n\", \"A = []\\nfor i in range(3):\\n  A += list(map(int,input().split()))\\n\\ncalled = [False] * 9\\n\\nbingo = ((0,1,2),(3,4,5),(6,7,8),(0,3,6),(1,4,7),(2,5,8),(0,4,8),(2,4,6))\\n\\nN = int(input())\\nfor i in range(N):\\n  target = int(input())\\n  if target in A:\\n    called[A.index(target)] = True\\n  \\nfor a,b,c in bingo:\\n  if called[a] and called[b] and called[c]:\\n    print(\\\"Yes\\\")\\n    break\\nelse:\\n  print(\\\"No\\\")\\n\", \"n=3\\nnum_list = []\\nfor i in range(n):\\n    num_list.append(list(map(int,input().split())))\\n\\nN=int(input())\\n\\nlist1=[int(input()) for _ in range(N)]\\n\\nlist2=[]\\ni=0\\nwhile i<=2:\\n    j=0\\n    while j<=2:\\n        list2.append(num_list[i][j])\\n        j=j+1\\n    i=i+1\\n\\ns=0\\nfor k in list2:\\n    if list1.count(k)==1:\\n        list2[s]=101\\n        s=s+1\\n    else:\\n        s=s+1\\n        continue\\n\\nif list2[0]+list2[1]+list2[2]==303:\\n    print('Yes')\\nelif list2[3]+list2[4]+list2[5]==303:\\n    print('Yes')\\nelif list2[6]+list2[7]+list2[8]==303:\\n    print('Yes')\\nelif list2[0]+list2[3]+list2[6]==303:\\n    print('Yes')\\nelif list2[1]+list2[4]+list2[7]==303:\\n    print('Yes')\\nelif list2[2]+list2[5]+list2[8]==303:\\n    print('Yes')\\nelif list2[0]+list2[4]+list2[8]==303:\\n    print('Yes')\\nelif list2[2]+list2[4]+list2[6]==303:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"def bingo(board):\\n    if board[0][0] == board[0][1] == board[0][2]:\\n        return True\\n    if board[1][0] == board[1][1] == board[1][2]:\\n        return True\\n    if board[2][0] == board[2][1] == board[2][2]:\\n        return True\\n    if board[0][0] == board[1][0] == board[2][0]:\\n        return True\\n    if board[0][1] == board[1][1] == board[2][1]:\\n        return True\\n    if board[0][2] == board[1][2] == board[2][2]:\\n        return True\\n    if board[0][0] == board[1][1] == board[2][2]:\\n        return True\\n    if board[0][2] == board[1][1] == board[0][2]:\\n        return True\\n\\n\\nA = []\\nb = []\\nfor _ in range(3):\\n    A.append(list(map(int, input().split())))\\nn = int(input())\\nfor _ in range(n):\\n    b.append(int(input()))\\n\\nfor i in range(n):\\n    for j in range(3):\\n        for k in range(3):\\n            if b[i] == A[j][k]:\\n                A[j][k] = 0\\n\\nans = bingo(A)\\nif ans:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"a=[[*map(int,input().split())] for _ in range(3)]\\nb=[int(input()) for _ in range(int(input()))]\\nfor i in b:\\n  for j in range(3):\\n    if i in a[j]:\\n      a[j][a[j].index(i)]=-1\\nif a[0][0]+a[1][1]+a[2][2]==-3 or a[0][2]+a[1][1]+a[2][0]==-3:\\n  print('Yes')\\nelse:\\n  for i,j in zip(a,[*zip(*a)]):\\n    if sum(i)==-3 or sum(j)==-3:\\n      print('Yes');break\\n  else:\\n    print('No')\", \"a1 = list(map(int, input().split()))\\na2 = list(map(int, input().split()))\\na3 = list(map(int, input().split()))\\nn = int(input())\\nflag = 0\\nfor _ in range(n):\\n    b = int(input())\\n    for i in range(3):\\n        if b == a1[i]:\\n            a1[i] = 0\\n        elif b == a2[i]:\\n            a2[i] = 0\\n        elif b == a3[i]:\\n            a3[i] = 0\\n    for i in range(3):\\n        if a1[i] == a2[i] == a3[i]:\\n            flag = 1\\n        if sum(a1) == 0:\\n            flag = 1\\n        if sum(a2) == 0:\\n            flag = 1\\n        if sum(a3) == 0:\\n            flag = 1\\n        if a1[0] == a2[1] == a3[2]:\\n            flag = 1\\n        if a1[2] == a2[1] == a3[0]:\\n            flag = 1\\n    if flag == 1:\\n        print(\\\"Yes\\\")\\n        break\\nif flag == 0:\\n    print(\\\"No\\\")\", \"li = list(map(int,input().split()))\\nli1 = list(map(int,input().split()))\\nli2 = list(map(int,input().split()))\\n\\nn = int(input())\\nli3 = []\\nfor i in range(n):\\n    li3.append(int(input()))\\n\\nfor i in range(3):\\n    if li[i] in li3:\\n        li[i] = 0\\n    if li1[i] in li3:\\n        li1[i] = 0\\n    if li2[i] in li3:\\n        li2[i] = 0\\nsu = li[0] + li1[0] + li2[0]\\nsu1 = li[1] + li1[1] + li2[1]\\nsu2 = li[2] + li1[2] + li2[2]\\nsu3 = li[0] + li1[1] + li2[2]\\nsu4 = li[2] + li1[1] + li2[0]\\nif sum(li)==0 or sum(li1)==0 or sum(li2)==0:\\n    print('Yes')\\nelif su == 0 or su1 == 0 or su2 == 0:\\n    print('Yes')\\nelif su3 == 0 or su4 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ninput = sys.stdin.readline\\nins = lambda: input().rstrip()\\nini = lambda: int(input().rstrip())\\ninm = lambda: map(int, input().rstrip().split())\\ninl = lambda: list(map(int, input().split()))\\nout = lambda x, s='\\\\n': print(s.join(map(str, x)))\\n\\na = inl()\\nb = inl()\\nc = inl()\\nn = ini()\\nbingo = []\\nfor _ in range(n):\\n    bingo.append(ini())\\nct = [0] * 9\\nfor i in bingo:\\n    if i in a:\\n        ct[a.index(i)] = 1\\n    if i in b:\\n        ct[b.index(i) + 3] = 1\\n    if i in c:\\n        ct[c.index(i) + 6] = 1\\nif sum(ct[:3]) == 3 or sum(ct[3:6]) == 3 or sum(ct[6:9]) == 3:\\n    print(\\\"Yes\\\")\\nelif (ct[0] + ct[4] + ct[8]) == 3 or (ct[2] + ct[4] + ct[6]) == 3:\\n    print(\\\"Yes\\\")\\nelif (ct[0] + ct[3] + ct[6]) == 3 or (ct[1] + ct[4] + ct[7]) == 3 or (ct[2] + ct[5] + ct[8]) == 3:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")    \", \"A = [[],[],[]]\\nA[0] = [int(s) for s in input().split(' ')]\\nA[1] = [int(s) for s in input().split(' ')]\\nA[2] = [int(s) for s in input().split(' ')]\\nN = int(input())\\nB = []\\nfor n in range(N):\\n    b = int(input())\\n    B.append(b)\\nB = set(B)\\nlines = []\\nlines.append(set(A[0]))\\nlines.append(set(A[1]))\\nlines.append(set(A[2]))\\nlines.append(set(A[i][i] for i in range(3)))\\nlines.append(set(A[2 - i][i] for i in range(3)))\\nlines.append(set(A[i][0] for i in range(3)))\\nlines.append(set(A[i][1] for i in range(3)))\\nlines.append(set(A[i][2] for i in range(3)))\\nfor line in lines:\\n    if len(line & B) == 3:\\n        print('Yes')\\n        return\\nprint('No')\\n\", \"def main():\\n    A = [list(map(int, input().split())) for _ in range(3)]\\n    n = int(input())\\n\\n    for _ in range(n):\\n        b = int(input())\\n\\n        for i in range(3):\\n            for j in range(3):\\n                if A[i][j] == b:\\n                    A[i][j] = 0\\n\\n    ans = 'No'\\n    for i in range(3):\\n        if any(A[i]) == 0:\\n            ans = 'Yes'\\n    for i in range(3):\\n        if any([A[0][i], A[1][i], A[2][i]]) == 0:\\n            ans = 'Yes'\\n    if any([A[0][0], A[1][1], A[2][2]]) == 0:\\n        ans = 'Yes'\\n    if any([A[0][2], A[1][1], A[2][0]]) == 0:\\n        ans = 'Yes'\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = [list(map(int ,input().split())) for _ in range(3)]\\nn = int(input())\\n\\nans = [[0] * 3 for _ in range(3)]\\n\\nfor i in range(n):\\n    b = int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if a[j][k] ==  b:\\n                ans[j][k] = 1\\n\\nstate = False\\nfor i in range(3):\\n    num = 0\\n    for j in range(3):\\n        num += ans[i][j]\\n    \\n    if num == 3:\\n        state = True\\n\\nfor i in range(3):\\n    num = 0\\n    for j in range(3):\\n        num += ans[j][i]\\n    \\n    if num == 3:\\n        state = True\\n\\nif ans[0][0] + ans[1][1] + ans[2][2] == 3:\\n    state = True\\n\\nif ans[0][2] + ans[1][1] + ans[2][0] == 3:\\n    state = True\\n\\nif state:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\\n\", \"#!/usr/local/bin/python3\\n# https://atcoder.jp/contests/abc157/tasks/abc157_b\\nimport numpy as np\\n\\ndef check(A, b):\\n    A = np.where(A == b, -1, A)\\n    return A\\n\\ndef bingo(A):\\n    for a in A:\\n        if a[0] == a[1] == a[2] == -1:\\n            return True\\n    for a in A.T:\\n        if a[0] == a[1] == a[2] == -1:\\n            return True\\n    if A[0][0] == A[1][1] == A[2][2] == -1:\\n        return True\\n    if A[0][2] == A[1][1] == A[2][0] == -1:\\n        return True\\n    return False\\n\\n\\n\\nA = []\\nfor _ in range(3):\\n    A.append(list(map(int, input().split())))\\nA = np.array(A)\\nN = int(input())\\nfor _ in range(N):\\n    b = int(input())\\n    A = check(A, b)\\n\\n# for i in range(3):\\n#     for j in range(3):\\n#         print(f\\\"{A[i][j]} \\\", end=\\\"\\\")\\n#     print(\\\"\\\")\\n\\nif bingo(A):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"#!/usr/bin/env python3\\nimport sys\\n\\nYES = \\\"Yes\\\"  # type: str\\nNO = \\\"No\\\"  # type: str\\n\\n\\ndef solve(A: \\\"List[List[int]]\\\", N: int, b: \\\"List[int]\\\"):\\n    A_ = []\\n    for a_ in A:\\n        A_ += [[a__, False] for a__ in a_]\\n    for b_ in b:\\n        for a__ in A_:\\n            if a__[0] == b_:\\n                a__[1] = True\\n    if (A_[0][1] and ((A_[1][1] and A_[2][1]) or \\\\\\n                        (A_[3][1] and A_[6][1]) or \\\\\\n                        (A_[4][1] and A_[8][1]))) or \\\\\\n            (A_[1][1] and A_[4][1] and A_[7][1]) or \\\\\\n            (A_[2][1] and A_[5][1] and A_[8][1]) or \\\\\\n            (A_[3][1] and A_[4][1] and A_[5][1]) or \\\\\\n            (A_[6][1] and A_[7][1] and A_[8][1]) or \\\\\\n            (A_[2][1] and A_[4][1] and A_[6][1]):\\n        print(YES)\\n    else:\\n        print(NO)\\n    return\\n\\n\\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)\\ndef main():\\n    def iterate_tokens():\\n        for line in sys.stdin:\\n            for word in line.split():\\n                yield word\\n    tokens = iterate_tokens()\\n    A = [[int(next(tokens)) for _ in range(3)] for _ in range(3)]  # type: \\\"List[List[int]]\\\"\\n    N = int(next(tokens))  # type: int\\n    b = [int(next(tokens)) for _ in range(N)]  # type: \\\"List[int]\\\"\\n    solve(A, N, b)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A = [[]]*3\\nfor row in range(3):\\n    A[row] = list(map(int, input().split()))\\nn = int(input())\\nB = [0]*n\\nfor i in range(n):\\n    B[i] = int(input())\\nflag = False\\n\\n\\ndef check_bingo(A, B):\\n    for row in range(3):\\n        if A[row][0] and A[row][1] and A[row][2]:\\n            return True\\n\\n    for col in range(3):\\n        if A[0][col] and A[1][col] and A[2][col]:\\n            return True\\n\\n    if A[0][0] and A[1][1] and A[2][2]:\\n        return True\\n    if A[0][2] and A[1][1] and A[2][0]:\\n        return True\\n    return False\\n\\n\\nfor row in range(3):\\n    for col in range(3):\\n        if A[row][col] in B:\\n            A[row][col] = True\\n        else:\\n            A[row][col] = False\\n\\nprint(\\\"Yes\\\" if check_bingo(A, B) else \\\"No\\\")\", \"a_str = [input().split() for _ in range(3)]\\na = [[0,0,0],[0,0,0],[0,0,0]]\\nfor i in range(3):\\n    for j in range(3):\\n        a[i][j] = int(a_str[i][j])\\n\\nn = int(input())\\nb = [int(input()) for _ in range(n)]\\n\\nfor m in range(n):\\n    for i in range(3):\\n        for j in range(3):\\n            if b[m] == a[i][j]:\\n                a[i][j] = 0\\n\\n#\\u6a2a\\u306e\\u30d3\\u30f3\\u30b4\\u5224\\u5b9a\\nfor i in range(3):\\n    if a[i][0] == a[i][1] == a[i][2] == 0:\\n        print('Yes')\\n        return\\n\\n#\\u7e26\\u306e\\u30d3\\u30f3\\u30b4\\u5224\\u5b9a\\nfor i in range(3):\\n    if a[0][i] == a[1][i] == a[2][i] == 0:\\n        print('Yes')\\n        return\\n\\n#\\u659c\\u3081\\u306e\\u30d3\\u30f3\\u30b4\\u5224\\u5b9a\\nif a[0][0] == a[1][1] == a[2][2] == 0:\\n    print('Yes')\\n    return\\nif a[0][2] == a[1][1] == a[2][0] == 0:\\n    print('Yes')\\n    return\\n\\nprint('No')\", \"import numpy as np\\n\\na = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\n\\nfor i in range(n):\\n    b = int(input())\\n\\n    for j in range(3):\\n        if b in a[j]:\\n            idx = a[j].index(b)\\n            a[j][idx] = 0\\n\\nnp_a = np.array(a)\\nnp_t = np_a.T\\nd = 0\\nu = 0\\n\\nfor i in range(3):\\n    r = np_a[i]\\n    c = np_t[i]\\n    d += r[i]\\n    u += r[2-i]\\n\\n    if r.sum() and c.sum():\\n        continue\\n\\n    print(\\\"Yes\\\")\\n    return\\n\\n\\nif d and u:\\n    print(\\\"No\\\")\\nelse:\\n    print(\\\"Yes\\\")\\n\", \"l=[]\\nfor i in range(3):\\n    l += list(map(int,input().split()))\\nN= int(input())\\nb=set()\\nfor i in range(N):\\n  c=int(input())\\n  if c in l:b.add(c)\\nfor i in b:\\n  l[l.index(i)]=0\\nif l[0]+l[1]+l[2]==0 or l[3]+l[4]+l[5]==0 or l[6]+l[7]+l[8]==0:print('Yes');return\\nif l[0]+l[3]+l[6]==0 or l[1]+l[4]+l[7]==0 or l[2]+l[5]+l[8]==0:print('Yes');return\\nif l[0]+l[4]+l[8]==0 or l[2]+l[4]+l[6]==0:print('Yes');return\\nprint('No')\", \"#-*-coding:utf-8-*-\\nimport sys\\ninput=sys.stdin.readline\\n\\ndef bingo_check(card):\\n    #\\u6a2a\\u30c1\\u30a7\\u30c3\\u30af\\n    for low in card:\\n        if sum(low)==0:\\n            print(\\\"Yes\\\")\\n            return\\n    #\\u7e26\\u30c1\\u30a7\\u30c3\\u30af\\n    column1=0\\n    column2=0\\n    column3=0\\n    for low in card:\\n        column1+=low[0]\\n        column2+=low[1]\\n        column3+=low[2]\\n    if column1 == 0 or column2 == 0 or column3==0:\\n        print(\\\"Yes\\\")\\n        return\\n    #\\u659c\\u3081\\u30c1\\u30a7\\u30c3\\u30af\\n    diagonal1=card[0][0]+card[1][1]+card[2][2]\\n    diagonal2=card[0][2]+card[1][1]+card[2][0]\\n    if diagonal1 == 0 or diagonal2 == 0:\\n        print(\\\"Yes\\\")\\n        return\\n    print(\\\"No\\\")\\n\\ndef main():\\n    bingo=[]\\n    use_card=[]\\n    bingo=[list(map(int,input().split())) for _ in range(3)]\\n    use_card=bingo\\n    n = int(input())\\n\\n    for idx in range(n):\\n        number=int(input())\\n        for i in range(3):\\n            for j in range(3):\\n                if number==use_card[i][j]:\\n                    use_card[i][j]=0\\n                else:\\n                    continue\\n    bingo_check(use_card)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"a, b, c = list(map(int, input().split()))\\ne, f, g = list(map(int, input().split()))\\nh, i, j = list(map(int, input().split()))\\n\\nbingo_list = [[a, b, c], [e, f, g], [h, i, j], [a, e, h], [b, f, i], [c, g, j], [a, f, j], [c, f, h]]\\n\\nn = int(input())\\n\\nn_list = [int(input()) for _ in range(n)]\\ncount = 0\\nans = 'No'\\n\\nfor i in bingo_list:\\n    for j in n_list:\\n        if j in i:\\n            count += 1\\n        if count == 3:\\n            ans = 'Yes'\\n            break\\n    if ans == 'Yes':\\n        break\\n\\n    count = 0\\n\\nprint(ans)\\n\", \"a=[input().split() for _ in range(3)]\\nn=int(input())\\nb=[input() for _ in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(n):\\n            if a[i][j]==b[k]:\\n                a[i][j]='0'\\nans=\\\"No\\\"\\nfor i in range(3):\\n    if a[i][0]==a[i][1]==a[i][2]:\\n        ans=\\\"Yes\\\"\\n    if a[0][i]==a[1][i]==a[2][i]:\\n        ans=\\\"Yes\\\"\\nif a[0][0]==a[1][1]==a[2][2]:\\n    ans=\\\"Yes\\\"\\nif a[0][2]==a[1][1]==a[2][0]:\\n    ans=\\\"Yes\\\"\\nprint(ans)\", \"lst = [ [ int(i) for i in input().split() ] for j in range(3) ]\\n\\nn = int(input())\\n\\nfor _ in range(n):\\n  x = int(input())\\n  for d in lst:\\n    if d[0] == x:\\n      d[0] = -1\\n    elif d[1] == x:\\n      d[1] = -1\\n    elif d[2] == x:\\n      d[2] = -1\\n\\nfor d in lst:\\n  if d[0] == d[1] == d[2] == -1:\\n    print('Yes')\\n    return\\nfor i in range(3):\\n  if lst[0][i] == lst[1][i] == lst[2][i] == -1:\\n    print('Yes')\\n    return\\nfor i in range(3):\\n  if lst[i][0] == lst[i][1] == lst[i][2] == -1:\\n    print('Yes')\\n    return\\nif lst[0][0] == lst[1][1] == lst[2][2] == -1:\\n  print('Yes')\\n  return\\nif lst[0][2] == lst[1][1] == lst[2][0] == -1:\\n  print('Yes')\\n  return\\nprint('No')\\n\", \"A = [0 for i in range(9)]\\nfor i in range(3):\\n  A[3*i], A[3*i+1], A[3*i+2] = map(int, input().split())\\nN = int(input())\\nb = [0 for i in range(N)]\\nfor i in range(N):\\n  b[i] = int(input())\\n\\n#Check matching numbers\\nfor i in range(9):\\n  for j in range(N):\\n    if A[i] == b[j]:\\n      A[i] = 0\\n\\n# Check bingo or not\\nflag = 0\\n# Check rows\\nfor i in [0, 3, 6]:\\n  if A[i]==A[i+1] and A[i+1]==A[i+2]:\\n    flag += 1\\n# Check colums\\nfor j in range(3):\\n  if A[j]==A[j+3] and A[j+3]==A[j+6]:\\n    flag += 1\\n# Check naname?\\nif (A[0]==A[4] and A[4]==A[8]) or (A[2]==A[4] and A[4]==A[6]):\\n  flag += 1\\n\\nif flag >= 1:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"ls = []\\nfor i in range(3):\\n    ls += list(map(int,input().split()))\\nN = int(input())\\nlsb = [int(input()) for i in range(N)]\\nfor i in range(N):\\n    if lsb[i] in ls:\\n        ls[ls.index(lsb[i])] = '#'\\nans = 'No'\\nfor i in range(3):  \\n    if ls[0+i] == '#' and ls[3+i] == '#' and ls[6+i] == '#':\\n        ans = 'Yes'\\nfor i in range(3):  \\n    if ls[3*i] == '#' and ls[3*i+1] == '#' and ls[3*i+2] == '#':\\n        ans = 'Yes'\\nif ls[0] == '#' and ls[4] == '#' and ls[8] == '#':\\n        ans = 'Yes'\\nif ls[2] == '#' and ls[4] == '#' and ls[6] == '#':\\n        ans = 'Yes'\\nprint(ans)\", \"a = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nb = [int(input()) for i in range(n)]\\nvisited = [[False for i in range(3)] for j in range(3)]\\nfor i in b:\\n    for j in range(3):\\n        for k in range(3):\\n            if i==a[j][k]:\\n                visited[j][k] = True\\n\\nans = \\\"No\\\"\\nfor i in visited:\\n    if i==[True,True,True]:\\n        ans = \\\"Yes\\\"\\n\\nfor i in range(3):\\n    flag = True\\n    for j in range(3):\\n        if visited[j][i]==False:\\n            flag = False\\n            break\\n    if flag:\\n        ans = \\\"Yes\\\"\\n\\nif visited[0][0] and visited[1][1] and visited[2][2]:\\n    ans = \\\"Yes\\\"\\nif visited[2][0] and visited[1][1] and visited[0][2]:\\n    ans = \\\"Yes\\\"\\nprint(ans)\", \"A = [list(map(int,input().split())) for i in range(3)]\\nN = int(input())\\nsheet = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\nfor i in range(N):\\n    b = int(input())\\n    for j in range(3):\\n        for k in range(3):\\n            if b == A[j][k]:\\n                sheet[j][k] = 1\\n                break\\n            else:\\n                continue\\n\\nfor i in range(3):\\n    if sheet[0][i] == sheet[1][i] == sheet[2][i] == 1:\\n        print('Yes')\\n        return\\n\\nfor i in range(3):\\n    if sheet[i][0] == sheet[i][1] == sheet[i][2] == 1:\\n        print('Yes')\\n        return\\n\\nif sheet[0][0] == sheet[1][1] == sheet[2][2] == 1:\\n        print('Yes')\\n        return\\nif sheet[0][2] == sheet[1][1] == sheet[2][0] == 1:\\n        print('Yes')\\n        return\\nelse:\\n    print('No')\", \"mat = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\\n\\nfor i in range(3):\\n  x, y, z = map(int, input().split())\\n  mat[i][0] = x\\n  mat[i][1] = y\\n  mat[i][2] = z\\n\\nn = int(input())\\n\\nfor i in range(n):\\n  x = int(input())\\n  for j in range(3):\\n    for k in range(3):\\n      if mat[j][k] == x:\\n        mat[j][k] = -1\\n        break\\n\\nif mat[0][0] == -1 and mat[0][1] == -1 and mat[0][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[1][0] == -1 and mat[1][1] == -1 and mat[1][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[2][0] == -1 and mat[2][1] == -1 and mat[2][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][0] == -1 and mat[1][0] == -1 and mat[2][0] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][1] == -1 and mat[1][1] == -1 and mat[2][1] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][2] == -1 and mat[1][2] == -1 and mat[2][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[0][0] == -1 and mat[1][1] == -1 and mat[2][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelif mat[2][0] == -1 and mat[1][1] == -1 and mat[0][2] == -1:\\n  print(\\\"Yes\\\")\\n  return\\nelse:\\n  print(\\\"No\\\")\", \"sheet = []\\nfor i in range(3):\\n    sheet.append([int(x) for x in input().split()])\\nbingo = [[False] * 3 for _ in range(3)]\\n\\nN = int(input())\\nfor i in range(N):\\n    a = int(input())\\n    for x in range(3):\\n        for y in range(3):\\n            if sheet[x][y] == a:\\n                bingo[x][y] = True\\n\\nfor i in range(3):\\n    if bingo[i][0] and bingo[i][1] and bingo[i][2]:\\n        print('Yes')\\n        return\\n    if bingo[0][i] and bingo[1][i] and bingo[2][i]:\\n        print('Yes')\\n        return\\nif bingo[0][0] and bingo[1][1] and bingo[2][2]:\\n    print('Yes')\\n    return\\nif bingo[2][0] and bingo[1][1] and bingo[0][2]:\\n    print('Yes')\\n    return\\n\\nprint('No')\\n\", \"import numpy as np\\nA = [list(map(int, input().split())) for _ in range(3)]\\nN = int(input())\\nB = [int(input()) for _ in range(N)]\\na = [[False]*3 for _ in range(3)]\\nfor i in range(3):\\n    for j in range(3):\\n        for b in B:\\n            if A[i][j] == b:\\n                a[i][j] = True\\nbingo = False\\nfor i in range(3):\\n    if a[i][0] and a[i][1] and a[i][2]:\\n        bingo =True\\nfor j in range(3):\\n    if a[0][j] and a[1][j] and a[2][j]:\\n        bingo = True\\nif a[0][0] and a[1][1] and a[2][2]:\\n    bingo = True\\nif a[0][2] and a[1][1] and a[2][0]:\\n    bingo = True\\nprint(('Yes' if bingo else 'No'))\\n\\n\", \"A1 = list(map(str,input().split()))\\nA2 = list(map(str,input().split()))\\nA3 = list(map(str,input().split()))\\nN = int(input())\\nfor k in range(N):\\n  i = str(input())  \\n  if i == A1[0]:\\n    A1[0] = 'OK'\\n  if i == A1[1]:\\n    A1[1] = 'OK'\\n  if i == A1[2]:\\n    A1[2] = 'OK'\\n  if i == A2[0]:\\n    A2[0] = 'OK' \\n  if i == A2[1]:\\n    A2[1] = 'OK'\\n  if i == A2[2]:\\n    A2[2] = 'OK'\\n  if i == A3[0]:\\n    A3[0] = 'OK'\\n  if i == A3[1]:\\n    A3[1] = 'OK'\\n  if i == A3[2]:\\n    A3[2] = 'OK'\\nif A1 == ['OK','OK','OK'] or A2 == ['OK','OK','OK'] or A3 == ['OK','OK','OK']:\\n  print('Yes')\\n  return\\nfor i in range(3):\\n  if A1[i] == 'OK' and A2[i] == 'OK' and A3[i]== 'OK':\\n    print('Yes')\\n    return\\nif A1[0] == 'OK' and A2[1] == 'OK' and A3[2]== 'OK':\\n    print('Yes')\\n    return\\nif A1[2] == 'OK' and A2[1] == 'OK' and A3[0]== 'OK':\\n    print('Yes')\\n    return\\nprint('No')\\n\\n\\n\", \"a1 = list(map(int,input().split()))\\na2 = list(map(int,input().split()))\\na3 = list(map(int,input().split()))\\nn = int(input())\\nfor i in range(n):\\n    b = int(input())\\n    if b in a1:\\n        a1[a1.index(b)] = 0\\n    if b in a2:\\n        a2[a2.index(b)] = 0\\n    if b in a3:\\n        a3[a3.index(b)] = 0\\nif (sum(a1) != 0) and (sum(a2) != 0) and (sum(a3) != 0) and (a1[0] + a2[0] + a3[0] != 0) and (a1[1] + a2[1] + a3[1] != 0) and (a1[2] + a2[2] + a3[2] != 0) and a1[0] + a2[1] + a3[2] != 0 and a1[2] + a2[1] + a3[0] != 0:\\n    print('No')\\nelse:\\n    print('Yes')\", \"A = [list(map(int, input().split())) for _ in range(3)]\\nn = int(input())\\nB = [int(input()) for _ in range(n)]\\n\\nfor i in range(3):\\n    for j in range(3):\\n        if A[i][j] in B:\\n            A[i][j] = -1\\n\\nfor i in range(3):\\n    ans1, ans2 = 0, 0\\n    for j in range(3):\\n        if A[i][j] == -1:\\n            ans1 += 1\\n        if A[j][i] == -1:\\n            ans2 += 1\\n    if ans1 == 3 or ans2 == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\nif (A[0][0] == -1 and A[1][1] == -1 and A[2][2] == -1) or \\\\\\n        (A[0][2] == -1 and A[1][1] == -1 and A[2][0] == -1):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"sheet = []\\nlines = [[0, 1, 2], [3, 4, 5], [6, 7, 8],\\n        [0, 3, 6], [1, 4, 7], [2, 5, 8],\\n        [0, 4, 8], [2, 4, 6]]\\nsai = []\\nfor i in range(3):\\n\\tsheet += [int(j) for j in input().split()]\\nn = int(input())\\nfor i in range(n):\\n\\tsai.append(int(input()))\\nret = 'No'\\nfor line in lines:\\n\\tbingo = True\\n\\tfor l in line:\\n\\t\\tif sheet[l] not in sai:\\n\\t\\t\\tbingo = False\\n\\tif bingo:\\n\\t\\tret = 'Yes'\\nprint(ret)\", \"a=[input().split() for _ in range(3)]\\nn=int(input())\\nb=[input() for _ in range(n)]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(n):\\n            if a[i][j]==b[k]:\\n                a[i][j]='0'\\nans=\\\"No\\\"\\nfor i in range(3):\\n    if a[i][0]==a[i][1]==a[i][2]:\\n        ans=\\\"Yes\\\"\\n    if a[0][i]==a[1][i]==a[2][i]:\\n        ans=\\\"Yes\\\"\\nif a[0][0]==a[1][1]==a[2][2]:\\n    ans=\\\"Yes\\\"\\nif a[0][2]==a[1][1]==a[2][0]:\\n    ans=\\\"Yes\\\"\\nprint(ans)\", \"import sys\\na = 3\\nA = [list(map(int,input().split())) for c in range(a)]\\nN = int(input())\\nb = [int(input()) for c in range(N)]\\n#print(A)\\n#print(b)\\nC = [[0,0,0],[0,0,0],[0,0,0]]\\nfor i in range(3):\\n    for j in range(3):\\n        for k in range(N):\\n            if b[k] == A[i][j]:\\n                C[i][j] = 1\\n\\nfor i in range(3):\\n    if sum(C[i]) == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\nfor j in range(3):\\n    if C[0][j]+C[1][j]+C[2][j] == 3:\\n        print(\\\"Yes\\\")\\n        return\\n\\nif C[0][0]+C[1][1]+C[2][2] == 3 or C[0][2]+C[1][1]+C[2][0] == 3:\\n    print(\\\"Yes\\\")\\n    return\\n\\nprint(\\\"No\\\")\\n\", \"# coding: utf-8\\n\\ndef main():\\n    A = []\\n    num = [1 for _ in range(101)]\\n    C = [\\n        [0, 1, 2],\\n        [3, 4, 5],\\n        [6, 7, 8],\\n        [0, 3, 6],\\n        [1, 4, 7],\\n        [2, 5, 8],\\n        [0, 4, 8],\\n        [2, 4, 6],\\n    ]\\n    ans = 'No'\\n    \\n    for _ in range(3):\\n        for i in list(map(int, input().split())):\\n            A.append(i)\\n        \\n\\n    N = int(input())\\n\\n    for _ in range(N):\\n        num[int(input())] -= 1\\n\\n    for c in C:\\n        if num[A[c[0]]] == 0 and num[A[c[1]]] == 0 and num[A[c[2]]] == 0:\\n            ans = 'Yes'\\n            break\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A = [list(map(int,input().split())) for i in range(3)]\\nn = int(input())\\nB = [int(input()) for i in range(n)]\\nC = [[0,0,0] for _ in range(3)]\\n\\nfor b in B:\\n    for i in range(3):\\n        for j in range(3):\\n            if(A[i][j] == b):\\n                C[i][j] = 1\\n\\nfor i in range(3):\\n    if(C[i][0] == 1 and C[i][1] == 1 and C[i][2] == 1):\\n        print(\\\"Yes\\\")\\n        return\\n    elif(C[0][i] == 1 and C[1][i] == 1 and C[2][i] == 1):\\n        print(\\\"Yes\\\")\\n        return\\nif(C[0][0] == 1 and C[1][1] == 1 and C[2][2] == 1):\\n    print(\\\"Yes\\\")\\n    return\\nelif(C[0][2] == 1 and C[1][1] == 1 and C[2][0] == 1):\\n    print(\\\"Yes\\\")\\n    return\\nprint(\\\"No\\\")\\nreturn\\n\", \"import os, sys, re, math\\n\\nA = []\\n\\nfor i in range(3):\\n    A += [int(n) for n in input().split()]\\n\\nN = int(input())\\nfor i in range(N):\\n    b = int(input())\\n    A = [0 if a == b else a for a in A]\\n\\nbingo = 'No'\\nfor x in range(3):\\n    if A[x * 3] == A[x * 3 + 1] == A[x * 3 + 2] == 0:\\n        bingo = 'Yes'\\nfor y in range(3):\\n    if A[y] == A[y + 3] == A[y + 3 * 2] == 0:\\n        bingo = 'Yes'\\nif (A[0] == A[4] == A[8] == 0) or (A[2] == A[4] == A[6] == 0):\\n    bingo = 'Yes'\\n\\nprint(bingo)\\n\", \"board = [list(map(int,input().split())) for i in range(3)]\\nnum = int(input())\\nfor n in range(num):\\n    bi = int(input())\\n    for i in range(3):\\n        for j in range(3):\\n            if board[i][j] == bi:\\n                board[i][j] = 0\\n\\n#\\u6a2a\\nfor i in range(3):\\n    if board[i][0] == board[i][1] == board[i][2] == 0:\\n        print(\\\"Yes\\\")\\n        return\\n#\\u7e26\\nfor i in range(3):\\n    if board[0][i] == board[1][i] == board[2][i] == 0:\\n        print(\\\"Yes\\\")\\n        return\\n\\nif board[0][0] == board[1][1] == board[2][2] == 0:\\n    print(\\\"Yes\\\")\\n    return\\nif board[0][2] == board[1][1] == board[2][0] == 0:\\n    print(\\\"Yes\\\")\\n    return\\n\\nprint(\\\"No\\\")\"]",
        "difficulty": "introductory",
        "input": "31 28 30\n70 90 84\n86 68 69\n6\n84\n52\n12\n69\n30\n68\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc157/tasks/abc157_b"
    },
    {
        "id": 445,
        "task_id": 4356,
        "test_case_id": 3,
        "question": "You are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.  \nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).  \nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.  \n\n-----Constraints-----\n - 1≦M≦N≦50 \n - A_i is a string of length N consisting of # and ..\n - B_i is a string of length M consisting of # and ..\n\n-----Input-----\nThe input is given from Standard Input in the following format:\nN M\nA_1\nA_2\n:  \nA_N\nB_1\nB_2\n:  \nB_M\n\n-----Output-----\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\n-----Sample Input-----\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\n-----Sample Output-----\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.",
        "solutions": "[\"n, m = map(int, input().split())\\na = [\\\"\\\" for _ in range(n)]\\nb = [\\\"\\\" for _ in range(m)]\\nfor i in range(n):\\n    a[i] = str(input())\\nfor i in range(m):\\n    b[i] = str(input())\\ndef check(ini_x, ini_y):\\n    nonlocal n, m, a, b\\n    for x in range(m):\\n        for y in range(m):\\n            if a[ini_x + x][ini_y + y] != b[x][y]:\\n                return False\\n    return True\\nfor i in range(n - m + 1):\\n    for j in range(n - m + 1):\\n        if check(i, j):\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"n, m = map(int, input().split())\\na, b = [], []\\nfor i in range(n):\\n  a.append(input())\\nfor i in range(m):\\n  b.append(input())\\n  \\nans = False\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    flag = True\\n    for k in range(m):\\n      if a[i+k][j:j+m] != b[k]:\\n        flag = False\\n    if flag:\\n      ans = True\\n\\nif ans:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\nN,M = (int(T) for T in input().split())\\nA = np.zeros((N,N),dtype=bool)\\nB = np.zeros((M,M),dtype=bool)\\nfor TN in range(0,N):\\n    A[TN,:] = [True if T=='.' else False for T in input()]\\nfor TM in range(0,M):\\n    B[TM,:] = [True if T=='.' else False for T in input()]\\nMatchFlag = False\\nfor TR in range(0,N-M+1):\\n    for TC in range(0,N-M+1):\\n        if np.sum(A[TR:TR+M,TC:TC+M]^B)==0:\\n            MatchFlag = True\\nprint(['No','Yes'][MatchFlag])\", \"def main():\\n    n,m = list(map(int,input().split()))\\n    a,b = [], []\\n    for i in range(n):\\n        a.append(input())\\n    for i in range(m):\\n        b.append(input())\\n    for i in range(n-m+1):\\n        for j in range(n-m+1):\\n            a_ = []\\n            for k in range(m):\\n                a_.append(a[i+k][j:j+m])\\n            if a_==b:\\n                print('Yes')\\n                return\\n    print('No')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N, M = map(int, input().split())\\nA = [''] * N\\nB = [''] * M\\nfor i in range(N):\\n    A[i] = input()\\nfor i in range(M):\\n    B[i] = input()\\n\\nmatch_cnt = 0\\nfor i in range(N - M + 1):\\n    for j in range(N - M + 1):\\n        flag = True\\n        for y in range(M):\\n            if A[y + i][j:j + M] != B[y]:\\n                flag = False\\n        if flag:\\n            match_cnt += 1\\n\\nif match_cnt > 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import math\\nN, M = list(map(int, input().split()))\\nA = [list(input()) for _ in range(N)]\\nB = [list(input()) for _ in range(M)]\\n\\nfor i in range(0, math.ceil(N/M)):\\n    for j in range(0, math.ceil(N/M)):\\n        # \\u7573\\u307f\\u8fbc\\u307f\\n        flag = True\\n        for l in range(0, M):\\n            for m in range(0, M):\\n                if A[l+i][m+j] != B[l][m]:\\n                    flag = False\\n                    break\\n        if flag == True:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\\n\", \"N,M = map(int,input().split())\\nA = list(input() for _ in range(N))\\nB = list(input() for _ in range(M))\\nans = \\\"No\\\"\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        if list(k[j:j+M] for k in A[i:i+M]) == B:\\n            ans = \\\"Yes\\\"\\nprint(ans)\", \"\\n\\ndef main():\\n    n, m = list(map(int, input().split()))\\n    a = ['' for i in range(n)]\\n    b = ['' for i in range(m)]\\n    for i in range(n):\\n        a[i] = input()\\n    for i in range(m):\\n        b[i] = input()\\n    for i1 in range(n - m + 1):\\n        for i2 in range(n - m + 1):\\n            fl = True\\n            for j in range(m):\\n                for k in range(m):\\n                    if a[i1 + j][i2 + k] != b[j][k]:\\n                        fl = False\\n            if fl:\\n                print(\\\"Yes\\\")\\n                return\\n    print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n, m = map(int, input().split())\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        if b[0][0] == a[i][j]:\\n            cnt = 0\\n            for x in range(m):\\n                flag = True\\n                if flag == False:\\n                    break\\n                for y in range(m):\\n                    if b[x][y] == a[i+x][j+y]:\\n                        cnt += 1\\n                        pass\\n                    else:\\n                        flag = False\\n                        break\\n                    if cnt == m**2:\\n                        print(\\\"Yes\\\")\\n                        return\\nprint(\\\"No\\\")\", \"import sys\\nn,m = map(int,input().split())\\nla = [input() for _ in range(n)]\\nlb = [input() for _ in range(m)]\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        cnt = 0\\n        for k in range(m):\\n            for l in range(m):\\n                if la[i+k][j+l] == lb[k][l]:\\n                    cnt += 1\\n        if cnt == m**2:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"n, m = map(int, input().split())\\na_lst = [str(input()) for _ in range(n)]\\nb_lst = [str(input()) for _ in range(m)]\\n\\nflag = False\\nfor i in range(n - m + 1):\\n    for j in range(n - m + 1):\\n\\n        count = 0\\n        if a_lst[i][j] == b_lst[0][0]:\\n            for k in range(m):\\n                for l in range(m):\\n                    if a_lst[i + k][j + l] == b_lst[k][l]:\\n                        count += 1\\n\\n            if count == m ** 2:\\n                flag = True\\n\\nif flag:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n,m=map(int,input().split())\\na=[list(input()) for _ in range(n)]\\nb=[list(input()) for _ in range(m)]\\nr=n-m+1\\nprint('Yes' if any([all([a[x//r+y//m][x%r+y%m]==b[y//m][y%m] for y in range(m**2)]) for x in range(r**2)]) else 'No')\", \"N, M = list(map(int, input().split()))\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\nR = list(range(N-M+1))\\n\\nfor i in R:\\n    for j in R:\\n        for k in range(M):\\n            if A[j+k][i:i+M] != B[k]:\\n                break\\n        else:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"N, M = list(map(int, input().split()))\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\nfor y in range(N - M + 1):\\n    for x in range(N - M + 1):\\n        matched = True\\n        for yy in range(y, y + M):\\n            for xx in range(x, x + M):\\n                if A[yy][xx] != B[yy - y][xx - x]:\\n                    matched = False\\n                if not matched:\\n                    break\\n            if not matched:\\n                break\\n        if matched:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"n,m = map(int,input().split())\\nA = [input() for i in range(n)]\\nB = [input() for i in range(m)]\\n \\nflag = False\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        flag = True\\n        for k in range(m):\\n            if B[k] != A[i+k][j:j+m]:\\n                flag = False\\n        if flag:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"n,m = list(map(int,input().split()))\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\n\\nflag = False\\nfor i in range(n-m+1):\\n\\n    for s in range(n-m+1):\\n        if b[0]==a[i][s:s+m]:\\n            index = s\\n            cnt = 1\\n            for j in range(1,m):\\n                if not a[i+j][index:index+m]==b[j]:\\n                    break\\n                cnt+=1\\n            if cnt==m:\\n                flag = True\\n                break\\n\\n\\nprint((\\\"Yes\\\" if flag else \\\"No\\\"))\\n\", \"n,m = map(int,input().split())\\nA=[]\\nB=[]\\nfor i in range(n):\\n    A.append(input())\\nfor i in range(m):\\n    B.append(input())\\ncnt=0\\nflag = False\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        ans = 'Yes'\\n        for k in range(m):\\n            for l in range(m):\\n                if A[i+k][j+l]!=B[k][l]:\\n                    ans = 'No'\\n        else:\\n            if ans == 'Yes':\\n                print(ans)\\n                return\\nprint(ans)\", \"import sys\\nN, M = list(map(int, input().split()))\\nA = []\\nB = []\\nfor _ in range(N):\\n    A.append(input())\\nfor _ in range(M):\\n    B.append(input())\\n\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        for k in range(M):\\n            #print(A[i+k][j:j+M])\\n            #print(B[k])\\n            if A[i+k][j:j+M] != B[k]:\\n                break\\n        else:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\\n\\n\", \"n,m=map(int,input().split())\\nA = [list(input()) for i in range(n)]\\nB = [list(input()) for i in range(m)]\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    flag = True\\n    for k in range(m):\\n      if A[k+j][i:i+m] != B[k][:]:\\n        flag = False\\n        break\\n    if flag:\\n      print(\\\"Yes\\\")\\n      return\\nelse:\\n  print(\\\"No\\\")\", \"n,m = [int(x) for x in input().split()]\\na = []\\nfor i in range(n):\\n  a.append(list(input()))\\nb = []\\nfor i in range(m):\\n  b.append(list(input()))\\n\\nres = \\\"No\\\"\\n\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    flag = True\\n    for k in range(m):\\n      for l in range(m):\\n        if a[k+i][l+j] != b[k][l]:\\n          flag = False\\n    if flag:\\n      res = \\\"Yes\\\"\\n\\nprint(res)\", \"n,m=map(int,input().split())\\na=[list(input()) for _ in range(n)]\\nb=[list(input()) for _ in range(m)]\\nfor i in range(0,n-m+1):\\n    for j in range(0,n-m+1):\\n        p=[a[x][i:i+m] for x in range(j,j+m)]\\n        ok=0\\n        for h in range(m):\\n            x,y=p[h],b[h]\\n            for k in range(m):\\n                if x[k]!=y[k]:\\n                    ok+=1\\n        if ok==0:\\n            print('Yes')\\n            return\\nprint('No')\", \"import sys, math\\nfrom itertools import combinations as c, product as p\\nfrom collections import deque\\nsys.setrecursionlimit(10**9)\\n\\n\\ndef si(): return input()\\ndef ii(): return int(input())\\ndef fi(): return float(input())\\ndef lstr(): return input().split()\\ndef lint(): return list(map(int, input().split()))\\ndef lint_dec(): return list(map(lambda x:int(x) - 1, input().split()))\\ndef lnstr(n): return [input() for _ in range(n)]\\ndef lnint(n): return [int(input()) for _ in range(n)]\\ndef lint_list(n): return [lint() for _ in range(n)]\\n\\n\\n\\n############################################################\\nN, M = lint()\\nA = lnstr(N)\\nB = lnstr(M)\\nFLG = False\\n\\nfor i in range(N - M + 1):\\n    for k in range(N - M + 1):\\n        if [A[j + k][i:i + M] for j in range(M)] == B:\\n            FLG = True\\n            break\\n    if FLG:\\n        break\\nprint('Yes' if FLG else 'No')\", \"n,m = map(int, input().split(\\\" \\\"))\\na = [list(input()) for i in range(n)]\\nb = [list(input()) for i in range(m)]\\nch = m**2\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    if a[i][j] == b[0][0]:\\n      count = 0\\n      for k in range(m):\\n        for l in range(m):\\n          #print(i+k, j+l)\\n          if a[i+k][j+l] == b[k][l]:\\n            count += 1\\n      if count == ch:\\n        print(\\\"Yes\\\")\\n        break\\n  else:\\n    continue\\n  break\\nelse:\\n  print(\\\"No\\\")\", \"N, M = list(map(int, input().split()))\\nA = []\\nB = []\\nfor i in range(N):\\n    A.append(input())\\nfor i in range(M):\\n    B.append(input())\\n\\nfor i in range(N-M+1):\\n    if B[0] in A[i]:\\n        k = A[i].index(B[0])\\n        points = 1\\n        for j in range(1,M):\\n            if B[j] == A[i+j][k:k+M]:\\n                points += 1\\n        if points == M:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"def f():\\n    n, m = map(int, input().split())\\n    a = [list(input()) for i in range(n)]\\n    b = [list(input()) for j in range(m)]\\n    for p in range(n - m + 1):\\n        for q in range(n - m + 1):\\n            cnt = 0\\n            for x in range(m):\\n                for y in range(m):\\n                    if a[x+p][y+q] == b[x][y]:\\n                        cnt += 1\\n                        if cnt == m*m:\\n                            return \\\"Yes\\\"\\n                    else:\\n                        break\\n    return \\\"No\\\"\\nprint(f())\", \"#!/usr/bin/env python3\\n\\n# input = stdin.readline\\n\\ndef solve(n,m,original,temp):\\n  def judge(sy,sx):\\n    for i in range(m):\\n      for j in range(m):\\n        if original[sy+i][sx+j] != temp[i][j]:\\n          return False\\n    return True\\n  \\n\\n  sy = 0\\n  while sy + m - 1 < n:\\n    sx = 0\\n    while sx + m - 1 < n:\\n      if judge(sy,sx):\\n        return True\\n      sx += 1\\n    sy += 1\\n\\n  return False\\n\\ndef main():\\n  N,M = list(map(int,input().split()))\\n  a = [input() for _ in range(N)]\\n  b = [input() for _ in range(M)]\\n  print((\\\"Yes\\\" if solve(N,M,a,b) else \\\"No\\\"))\\n  return\\n\\ndef __starting_point():\\n  main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    n, m = list(map(int, input().split()))\\n    A = [input() for i in range(n)]\\n    B = [input() for i in range(m)]\\n    for i in range(n):\\n        C = []\\n        p = A[i].find(B[0])\\n        if p != -1:\\n            for j in range(m):\\n                if i + j < n and p + len(B[0]) <= n:\\n                    C.append(A[i + j][p:p + len(B[0])])\\n            if C == B:\\n                break\\n\\n    print(('Yes' if C == B else 'No'))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N, M = map(int, input().split())\\nA = [input() for i in range(N)]\\nB = [input() for i in range(M)]\\nfor i in range(N - M + 1):\\n  pos = -1\\n  for j in range(A[i].count(B[0])):\\n    pos = A[i].find(B[0], pos + 1)\\n    for k in range(1, M):\\n      if A[i + k].find(B[k], pos) != pos:\\n        break\\n    else:\\n      print('Yes')\\n      break\\n  else:\\n    continue\\n  break\\nelse:\\n  print('No')\", \"n, m = list(map(int, input().split()))\\nA = [input() for _ in range(n)]\\nB = [input() for _ in range(m)]\\nfor x, a in enumerate(A):\\n    if x > n - m + 1:\\n        break\\n    for i in range(n - m + 1):\\n        if a[i: i + m] == B[0]:\\n            for j in range(m):\\n                if A[x + j][i: i + m] != B[j]:\\n                    break\\n            else:\\n                print(\\\"Yes\\\")\\n                return\\nprint(\\\"No\\\")\\n\", \"n,m = map(int,input().split())\\na = []\\nb = []\\nans = 0\\nfor i in range(n):\\n    a.append(list(input()))\\nfor i in range(m):\\n    b.append(list(input()))\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        cnt = 0\\n        for s in range(m):\\n            for t in range(m):\\n                if b[s][t] == a[s+i][t+j]:\\n                    cnt += 1\\n        if cnt == m*m:\\n            ans = 1\\nif ans == 0:\\n    print(\\\"No\\\")\\nelse:\\n    print(\\\"Yes\\\")\", \"N,M=list(map(int,input().split()))\\nA=list(list(input()) for _ in range(N))\\nB=list(list(input()) for _ in range(M))\\nflag=False\\nfor i in range(0,N-M+1):\\n    for j in range(0,N-M+1):\\n        sub=True\\n        for x in range(0,M):\\n            for y in range(0,M):\\n                if A[i+x][j+y]!=B[x][y]:\\n                    sub=False\\n        flag=flag or sub\\nif flag:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N,M = map(int,input().split())\\nAls = []\\nBls = []\\nans = 'No'\\nif Bls == Als:\\n    ans = 'Yes'\\nfor i in range(N):\\n    Als.append(input())\\nfor i in range(M):\\n    Bls.append(input())\\nfor i in range(N-M):\\n    for j in range(0,N-M):\\n        for k in range(M):\\n            if Bls[k] == Als[i+k][j:M+j]:\\n                ans = 'Yes'\\n            else:\\n                ans = 'No'\\n                break\\n        if ans == 'Yes':\\n            break\\n    if ans == 'Yes':\\n        break\\nprint(ans)\", \"import re\\nimport sys\\nimport math\\nimport itertools\\nimport bisect\\nfrom copy import copy\\nfrom collections import deque,Counter\\nfrom decimal import Decimal\\nimport functools\\ndef v(): return input()\\ndef k(): return int(input())\\ndef S(): return input().split()\\ndef I(): return list(map(int,input().split()))\\ndef X(): return list(input())\\ndef L(): return list(input().split())\\ndef l(): return list(map(int,input().split()))\\ndef lcm(a,b): return a*b//math.gcd(a,b)\\nsys.setrecursionlimit(10 ** 9)\\nmod = 10**9+7\\ncnt = 0\\nans = 0\\ninf = float(\\\"inf\\\")\\nal = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nAL = al.upper()\\n\\nn,m = I()\\na = []\\nb = []\\n\\nfor _ in range(n):\\n    a += [list(input())]\\nfor _ in range(m):\\n    b += [list(input())]\\n\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        if [k[j:m+j] for k in a[i:m+i]] == b:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"import math\\nfrom math import gcd,pi,sqrt\\nINF = float(\\\"inf\\\")\\n\\nimport sys\\nsys.setrecursionlimit(10**6)\\nimport itertools\\nfrom collections import Counter,deque\\ndef i_input(): return int(input())\\ndef i_map(): return list(map(int, input().split()))\\ndef i_list(): return list(i_map())\\ndef i_row(N): return [i_input() for _ in range(N)]\\ndef i_row_list(N): return [i_list() for _ in range(N)]\\ndef s_input(): return input()\\ndef s_map(): return input().split()\\ndef s_list(): return list(s_map())\\ndef s_row(N): return [s_input for _ in range(N)]\\ndef s_row_str(N): return [s_list() for _ in range(N)]\\ndef s_row_list(N): return [list(s_input()) for _ in range(N)]\\n\\nimport string\\n\\ndef main():\\n    N,M = i_map()\\n    a = [s_input() for _ in range(N)]\\n    b = [s_input() for _ in range(M)]\\n\\n    for i in range(N-M+1):\\n        for j in range(N-M+1):\\n            flg = True\\n\\n            for x in range(M):\\n                for y in range(M):\\n                    if b[x][y] != a[i+x][j+y]:\\n                        flg = False\\n                        break\\n                if flg == False:\\n                    break\\n            if flg == True:\\n                print(\\\"Yes\\\")\\n                return\\n    print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N,M = map(int,input().split())\\nA = list(input() for _ in range(N))\\nB = list(input() for _ in range(M))\\nans = \\\"No\\\"\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        if [k[j:j+M] for k in A[i:i+M]] == B:\\n            ans = \\\"Yes\\\"\\n            \\\"\\\"\\\"\\n        for k in A[i:i + M]:\\n            if k[j:j + M]  == B:\\n                ans = \\\"Yes\\\"\\n        \\\"\\\"\\\"\\nprint(ans)\", \"import sys\\nN,M=map(int,input().split())\\nA=[]\\nfor i in range(N):\\n  a=input()\\n  A.append(a)\\nB=[]\\nfor j in range(M):\\n  b=input()\\n  B.append(b)\\nfor k in range(N-M+1):\\n  for l in range(N-M+1):\\n    z=0\\n    for m in range(M):\\n      try:\\n        if B[m]==A[k+m][l:l+M]:\\n          z+=1\\n      except:\\n        sys.stderr.write(f\\\"{k,l,m}\\\")\\n        pass\\n    if z==M:\\n      print(\\\"Yes\\\")\\n      return\\nprint(\\\"No\\\")\", \"N,M = map(int,input().split())\\nA=[input() for _ in range(N)]\\nB=[input() for _ in range(M)]\\n\\nans=\\\"No\\\"\\n\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        flag = True\\n        for k in range(M):\\n            for l in range(M):\\n                if A[i+k][j+l]!=B[k][l]:\\n                    flag = False\\n                    break\\n                    \\n        if flag:\\n            ans=\\\"Yes\\\"\\n            break\\n\\nprint(ans)\", \"n, m = map(int, input().split())\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        ans = True\\n        for k in range(m):\\n            if b[k] != a[i+k][j:j+m]:\\n                ans = False\\n        if ans:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"N,M = map(int,input().split())\\nA = [list(input()) for _ in range(N)]\\nB = [list(input()) for _ in range(M)]\\n\\ncheck = False\\n\\nfor i in range(N-M+1):\\n  for j in range(N-M+1):\\n    if A[i][j:j+M] == B[0]:\\n      flag = True\\n      for k in range(1,M):\\n        if A[i+k][j:j+M] != B[k]:\\n          flag = False\\n      if flag:\\n        check = True\\n\\nprint(\\\"Yes\\\" if check else \\\"No\\\")\", \"n,m=map(int,input().split())\\na=[list(input()) for _ in range(n)]\\nb=[list(input()) for _ in range(m)]\\n\\neq = False\\nfind = False\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    for p in range(m):\\n      for q in range(m):\\n        if a[p+i][q+j] == b[p][q]:\\n          eq = True\\n        else:\\n          eq = False\\n          break\\n      if not eq:\\n        break\\n    if eq:\\n      find = True\\n      break\\n  if find:\\n    break\\nif find:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n,m=map(int,input().split())\\n\\nalist=[input() for _ in range(n)]\\nblist=[input() for _ in range(m)]\\n\\ndef match(i,j):\\n    for di in range(m):\\n        for dj in range(m):\\n            if alist[i+di][j+dj]!=blist[di][dj]:\\n                return False \\n    return True\\n\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        if match(i,j):\\n            print(\\\"Yes\\\")\\n            return\\n\\nprint(\\\"No\\\")\", \"n,m=map(int,input().split())\\na=[list(input()) for i in range(n)]\\nb=[list(input()) for i in range(m)]\\nexist=False\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    match=True\\n    for k in range(m):\\n      for l in range(m):\\n        if a[i+k][j+l]!=b[k][l]:\\n          match=False\\n    if match:\\n      exist=True\\nprint(\\\"Yes\\\" if exist else \\\"No\\\")\", \"import sys\\nstdin=sys.stdin\\n\\nip=lambda: int(sp())\\nfp=lambda: float(sp())\\nlp=lambda:list(map(int,stdin.readline().split()))\\nsp=lambda:stdin.readline().rstrip()\\nyp=lambda:print('Yes')\\nnp=lambda:print('No')\\n\\nn,m=lp()\\nans=[]\\nfor _ in range(n):\\n  s=list(sp())\\n  ans.append(s)\\n\\nnext=[]\\nfor _ in range(m):\\n  p=list(sp())\\n  next.append(p)\\n  \\nok=0\\ncount=0\\nfor x in range(n-m+1):\\n  for y in range(n-m+1):\\n    ch=0\\n    for e in range(m):\\n      for f in range(m):\\n        if ans[x+e][y+f]==next[e][f]:\\n          ch+=1\\n        if ch==m*m:\\n          ok+=1\\n  \\nif ok==0:\\n  print('No')\\nelse:\\n  print('Yes')\\n        \\n  \", \"N,M=map(int,input().split())\\nA=[[] for i in range(N)]\\nB=[[] for i in range(M)]\\nfor i in range(N):\\n  L=list(input())\\n  A[i]=L\\nfor i in range(M):\\n  L=list(input())\\n  B[i]=L\\nfor i in range(N-M+1):\\n  for j in range(N-M+1):\\n    ans=0\\n    for k in range(M):\\n      for s in range(M):\\n        #i,j\\u3092\\u59cb\\u70b9\\u3068\\u3057\\u305f\\n        if B[k][s]!=A[i+k][j+s]:\\n          ans=-1\\n        if k==M-1 and s==M-1:\\n          if ans==0:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"import sys\\n\\n\\nN, M = [int(x) for x in input().split()]\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\n\\nfor i in range(N - M + 1):\\n    for j in range(N - M + 1):\\n        found = True\\n        for _i in range(M):\\n            for _j in range(M):\\n                if A[i + _i][j + _j] != B[_i][_j]:\\n                    found = False\\n                    break\\n            if not found:\\n                break\\n        if found:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"N,M=map(int,input().split())\\nA=[input() for i in range(N)]\\nB=''.join([input() for i in range(M)])\\nf=0\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        if ''.join([A[l][j:j+M] for l in range(i,i+M)])==B:\\n            f=1\\nprint(['No','Yes'][f])\", \"N,M = [int(a) for a in input().split()]\\nA = []\\nB = []\\nfor i in range(N):\\n  A.append(input())\\nfor i in range(M):\\n  B.append(input())  \\n\\nwa = len(A[0])\\nwb = len(B[0])\\n  \\nmatched = False\\nfor i1 in range(N - M + 1):\\n  for j1 in range(wa - wb +1):\\n    cnt = 0\\n    for i2 in range(M):\\n      #print(B[i2],\\\" vs \\\", A[i1+i2][j1:j1+wb])\\n      if B[i2] == A[i1+i2][j1:j1+wb]:\\n        cnt += 1\\n    if cnt == M:\\n      matched = True\\n      break\\n          \\n\\nif matched:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"import bisect, collections, copy, heapq, itertools, math, string, sys\\ninput = lambda: sys.stdin.readline().rstrip() \\nsys.setrecursionlimit(10**7)\\nINF = float('inf')\\ndef I(): return int(input())\\ndef F(): return float(input())\\ndef SS(): return input()\\ndef LI(): return [int(x) for x in input().split()]\\ndef LI_(): return [int(x)-1 for x in input().split()]\\ndef LF(): return [float(x) for x in input().split()]\\ndef LSS(): return input().split()\\n\\ndef resolve():\\n    N, M = LI()\\n    A = [SS() for _ in range(N)]\\n    B = [SS() for _ in range(M)]\\n\\n    is_ok = False\\n    for i, j in itertools.product(list(range(N - M + 1)), repeat=2):\\n        tmp = True\\n        for k in range(M):\\n            if B[k] != A[i+k][j:j+M]:\\n                tmp = False\\n                break\\n        if tmp:\\n            is_ok = True\\n            break\\n\\n    if is_ok:\\n        print('Yes')\\n    else:\\n        print('No')\\n\\ndef __starting_point():\\n    resolve()\\n\\n__starting_point()\", \"from typing import List\\n\\n\\ndef answer(n: int, m: int, a: List[str], b: List[str]) -> str:\\n    for i in range(n - m + 1):\\n        for j in range(n - m + 1):\\n            if a[i][j:j + m] == b[0]:\\n                matched_lines = 1\\n                for k in range(1, m):\\n                    if a[i + k][j:j + m] == b[k]:\\n                        matched_lines += 1\\n                    else:\\n                        break\\n                if matched_lines == m:\\n                    return 'Yes'\\n\\n    return 'No'\\n\\n\\ndef main():\\n    n, m = map(int, input().split())\\n    a = [input() for _ in range(n)]\\n    b = [input() for _ in range(m)]\\n    print(answer(n, m, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# B - Template Matching\\ndef main():\\n    n, m = map(int, input().split())\\n\\n    a_l = [input() for i in range(n)]\\n    b_l = [input() for i in range(m)]\\n\\n    for i in range(n-m+1):\\n        for j in range(n-m+1):\\n            ans = 'Yes'\\n            for k in range(m):\\n                for l in range(m):\\n                    if a_l[i+k][j+l] != b_l[k][l]:\\n                        ans = 'No'\\n            else:\\n                if ans == 'Yes':\\n                    print(ans)\\n                    return\\n    print(ans)\\n\\n  \\n        \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n, m = list(map(int, input().split()))\\na = [list(input()) for _ in range(n)]\\nb = [list(input()) for _ in range(m)]\\nflag = True\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        flag = True\\n        for k in range(m):\\n            for l in range(m):\\n                if b[k][l] != a[i+k][j+l]:\\n                    flag = False\\n                    break\\n        if flag:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"import numpy\\n\\ndef main():\\n    n,m=map(int,input().split())\\n    a=numpy.array([list(input()) for _ in range(n)])\\n    b=numpy.array([list(input()) for _ in range(m)])\\n    for i in range(n-m+1):\\n        for j in range(n-m+1):\\n            if numpy.all(a[i: i+m, j: j+m] == b):\\n                print(\\\"Yes\\\")\\n                return\\n    print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"N, M = list(map(int, input().split()))\\nA = [input() for i in range(N)]\\nB = [input() for i in range(M)]\\n\\nfor i in range(N - M + 1):  # tate\\n    for j in range(N - M + 1):  # yoko\\n        ans = 1\\n        for k in range(M):\\n            if B[k] != A[i + k][j:j+M]:\\n                ans = 0\\n        if ans == 1:\\n            print('Yes')\\n            return\\nprint('No')\\n\", \"n,m = map(int,input().split())\\na = [input() for i in range(n)]\\nb = [input() for j in range(m)]\\nfor i in range(n):\\n  for j in range(n-m+1):\\n    tf = 0\\n    if a[i][j:j+m]==b[0] and i+m<=n:\\n      tf = 1\\n      for k in range(i+1,i+m):\\n        if a[k][j:j+m]!=b[k-i]:\\n          tf = 0\\n    if tf:\\n      print('Yes')\\n      return\\nelse:\\n  print('No')\", \"lst = input().split()\\nN = int(lst[0])\\nM = int(lst[1])\\n\\nA = []\\nB = []\\n\\nfor i in range(N):\\n   A.append(input())\\n\\nfor i in range(M):\\n   B.append(input())\\n\\nif A == B:\\n   print('Yes')\\n   return\\n\\nfor x in range(N-M):\\n   for y in range(N-M):\\n      count = 1\\n      for i in range(M):\\n         if A[y+i][x:x+M] != B[i]:\\n            count = 0\\n      if count == 1:\\n         print('Yes')\\n         return\\n\\nprint('No')\", \"import numpy\\n\\nn,m = map(int,input().split())\\na = numpy.zeros([n,n], dtype=int)\\nb = numpy.zeros([m,m], dtype=int)\\nfor i in range(n):\\n    s = input()\\n    for j in range(n):\\n        if s[j] == \\\"#\\\":\\n            a[i,j] = 1\\nfor i in range(m):\\n    s = input()\\n    for j in range(m):\\n        if s[j] == \\\"#\\\":\\n            b[i,j] = 1\\n\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        if numpy.all(a[i:i+m, j:j+m] == b):\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"n,m=map(int,input().split())\\na=[input() for i in range(n)]\\nb=[input() for j in range(m)]\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        for k in range(m):\\n            if a[k+i][0+j:m+j]!=b[k]:\\n                break\\n        else:\\n            print(\\\"Yes\\\")\\n            break\\n    else:\\n        continue\\n    break\\nelse:\\n    print(\\\"No\\\")\", \"N, M = map(int, input().split())\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        flg = True\\n        for k in range(M):\\n            for l in range(M):\\n                flg = flg & (B[k][l] == A[i+k][j+l])\\n        \\n        if flg:\\n            ans = 'Yes'\\n            print(ans)\\n            return\\n\\nans = 'No'\\nprint(ans)\", \"n, m = map(int, input().split())\\nA = [input() for _ in range(n)]\\nB = [input() for _ in range(m)]\\n\\nans = 'No'\\nfor i in range(n - m + 1):\\n    for j in range(n - m + 1):\\n        if all([A[i + k][j:j + m] == B[k] for k in range(m)]):\\n            ans = 'Yes'\\nprint(ans)\", \"n, m = list(map(int, input().split()))\\nA = [list(input()) for _ in range(n)]\\nB = [list(input()) for _ in range(m)]\\nok = False\\nfor ai in range(n-m+1):\\n    for aj in range(n-m+1):\\n        match = True\\n        for bi in range(m):\\n            for bj in range(m):\\n                b = B[bi][bj]\\n                a = A[ai+bi][aj+bj]\\n                if a == b:\\n                    continue\\n                else:\\n                    match = False\\n                    break\\n            if not match:\\n                break\\n        else:\\n            ok = True\\n        if ok:\\n            break\\n    if ok:\\n        break\\nprint(('Yes' if ok else 'No'))\\n\", \"#\\n# abc054 b\\n#\\nimport sys\\nfrom io import StringIO\\nimport unittest\\n\\n\\nclass TestClass(unittest.TestCase):\\n    def assertIO(self, input, output):\\n        stdout, stdin = sys.stdout, sys.stdin\\n        sys.stdout, sys.stdin = StringIO(), StringIO(input)\\n        resolve()\\n        sys.stdout.seek(0)\\n        out = sys.stdout.read()[:-1]\\n        sys.stdout, sys.stdin = stdout, stdin\\n        self.assertEqual(out, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_1(self):\\n        input = \\\"\\\"\\\"3 2\\n#.#\\n.#.\\n#.#\\n#.\\n.#\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"Yes\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_2(self):\\n        input = \\\"\\\"\\\"4 1\\n....\\n....\\n....\\n....\\n#\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"No\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n\\ndef resolve():\\n    N, M = list(map(int, input().split()))\\n    A = [list(input()) for _ in range(N)]\\n    B = [list(input()) for _ in range(M)]\\n\\n    ans = \\\"No\\\"\\n    for i in range(N-M+1):\\n        for j in range(N-M+1):\\n            ans = \\\"Yes\\\"\\n            for k in range(M):\\n                if ans == \\\"No\\\":\\n                    break\\n                for l in range(M):\\n                    if A[i+k][j+l] != B[k][l]:\\n                        ans = \\\"No\\\"\\n                        break\\n            if ans == \\\"Yes\\\":\\n                break\\n        if ans == \\\"Yes\\\":\\n            break\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    # unittest.main()\\n    resolve()\\n\\n__starting_point()\", \"N,M=map(int,input().split())\\nA=[input() for i in range(N)]\\nB=[input() for i in range(M)]\\nans = \\\"Yes\\\"\\nfor i in A:\\n  for j in B:\\n    if j not in i:\\n      ans = \\\"No\\\"\\nprint(ans)\", \"n, m = list(map(int, input().split()))\\na = [input() for i in range(n)]\\nb = [input() for i in range(m)]\\nans = \\\"Yes\\\"\\nfor i in a:\\n  for j in b:\\n    if j not in i:\\n      ans = \\\"No\\\"\\nprint(ans)\\n\", \"N, M = map(int, input().split())\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\nfor i in range(N-M+1):\\n  for j in range(N-M+1):\\n    flag = True\\n    AA = [a[j:j+M] for a in A[i:i+M]]\\n    for a, b in zip(AA, B):\\n      if a != b:\\n        flag = False\\n    if flag:\\n      print(\\\"Yes\\\")\\n      return\\nprint(\\\"No\\\")\", \"N, M = list(map(int, input().split()))\\nA = []\\nfor _ in range(N):\\n    a = input()\\n    A.append(a)\\n\\nB = []\\nfor _ in range(M):\\n    b = input()\\n    B.append(b)\\n\\nidx = [0, 0]\\nwhile True:\\n    if idx[0] == N - 1 and idx[1] == N - 1:\\n        break\\n    if A[idx[0]][idx[1]] == B[0][0]:\\n        check = False\\n        for i in range(M):\\n            for j in range(M):\\n                if 0 <= idx[0] + i < N and 0 <= idx[1] + j < N:\\n                    if A[idx[0] + i][idx[1] + j] != B[i][j]:\\n                        check = True\\n                        break\\n                else:\\n                    check = True\\n                    break\\n            if check:\\n                break\\n\\n        if not check:\\n            print('Yes')\\n            return\\n    if idx[1] < N - 1:\\n        idx[1] += 1\\n        continue\\n    else:\\n        idx[0] += 1\\n        idx[1] = 1\\n        continue\\n\\nif A[-1][-1] == B[0][0] and M == 1:\\n    print('Yes')\\n    return\\n\\nprint('No')\\n\", \"n,m=map(int,input().split())\\na=[input() for i in range(n)]\\nb=[input() for i in range(m)]\\nans=False\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        part_a=[a[y][j:j+m] for y in range(i,i+m)]\\n        cnt=0\\n        for k in range(m):\\n            for l in range(n-m+1):\\n                if (part_a[k][l:m+l]==b[k]):\\n                    cnt+=1\\n        if (cnt==m):\\n            ans=True\\n\\nif (ans):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n,m = map(int,input().split())\\na = []\\nfor i in range(n):\\n  a.append(input())\\nb = []\\nfor i in range(m):\\n  b.append(input())\\nflag = 0\\njudge = []\\nfor i in range(n-m+1):\\n  judge = []\\n  for j in range(n-m+1):\\n    judge = []\\n    for k in range(m):\\n      judge.append(a[i+k][j:j+m])\\n    if judge == b:\\n      flag += 1\\nif flag == 0:\\n  print(\\\"No\\\")\\nelse:\\n  print(\\\"Yes\\\")\", \"import numpy as np\\nn, m =map(int, input().split())\\naa =[list(input()) for i in range(n)]\\nbb = [list(input())for i in range(m)]\\na = np.array(aa)\\nb = np.array(bb)\\nfor i  in range(n-m+1):\\n  for j in range(n-m+1):\\n    \\n    if (a[i:i+m, j:j+m]==b).all():\\n      print('Yes')\\n      return\\nprint('No')\", \"import sys\\n#import string\\n#from collections import defaultdict, deque, Counter\\n#import bisect\\n#import heapq\\n#import math\\n#from itertools import accumulate\\n#from itertools import permutations as perm\\n#from itertools import combinations as comb\\n#from itertools import combinations_with_replacement as combr\\n#from fractions import gcd\\n#import numpy as np\\n\\nstdin = sys.stdin\\nsys.setrecursionlimit(10 ** 7)\\nMIN = -10 ** 9\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\nIINF = 10 ** 18\\n\\ndef solve():\\n    n,m = list(map(int, stdin.readline().rstrip().split()))\\n    #l = list(map(int, stdin.readline().rstrip().split()))\\n    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]\\n    a = [stdin.readline().rstrip() for _ in range(n)]\\n    b = [stdin.readline().rstrip() for _ in range(m)]\\n\\n    for i in range(n-m+1):\\n        for j in range(n-m+1):\\n            flag = True\\n            for h in range(m):\\n                if a[i+h][j:j+m] != b[h]:\\n                    flag = False\\n                    break\\n            if flag == True:\\n                print(\\\"Yes\\\")\\n                return\\n    print(\\\"No\\\")\\n\\n\\n\\n\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"N,M=map(int,input().split())\\nA=[input() for _ in range(N)]\\nB=[input() for _ in range(M)]\\nfor i in range(N-M+1):\\n  for j in range(N-M+1):\\n    flag=1\\n    for k in range(M):\\n      if A[i+k][j:j+M]!=B[k]:\\n        flag=0\\n    if flag:\\n      print(\\\"Yes\\\")\\n      return\\nprint(\\\"No\\\")\", \"n, m = map(int, input().split())\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\n\\nsuccess = 0\\nfor i in range(n - m + 1):\\n    fail = 0\\n    for j in range(n - m + 1):\\n        fail = 0\\n        for ii in range(m):\\n            for jj in range(m):\\n                if b[ii][jj] == a[i + ii][j + jj]:\\n                    continue\\n                else:\\n                    fail = 1\\n                    break\\n            if fail == 1:\\n                break\\n        else:\\n            success = 1\\n            print('Yes')\\n            break\\n    if success == 1:\\n        break\\nelse:\\n    if fail == 1:\\n        print('No')\", \"n,m = map(int, input().split())\\na = [input() for i in range(n)]\\nb = [input() for j in range(m)]\\nres = \\\"No\\\"\\n\\nif m == 1:\\n    for i in a:\\n        if b[0] in i:\\n            res = \\\"Yes\\\"\\nelse:\\n    for k in range(n-m+1): # (0,1) \\u203ba\\u306e\\u9577\\u3055\\u3092\\u4e0a\\u9650\\u306bb\\u304c\\u7e26\\u306b\\u79fb\\u52d5\\u3067\\u304d\\u308b\\u7bc4\\u56f2\\n        if b[0] in a[k]: # \\u3082\\u3057a[0]\\u304ba[1]\\u306bb[0]\\u304c\\u542b\\u307e\\u308c\\u308b\\u306a\\u3089\\n            for l in range(n-m+1): # (0,1) \\u203ba\\u306e\\u9577\\u3055\\u3092\\u4e0a\\u9650\\u306bb\\u304c\\u6a2a\\u306b\\u79fb\\u52d5\\u3067\\u304d\\u308b\\u7bc4\\u56f2\\n                if b[0] == a[k][l:m+l]: # \\u3082\\u3057\\u3001b[0]\\u304ca[0/1][0:2]\\u304ba[0/1][1:3]\\u3068\\u4e00\\u81f4\\u3059\\u308b\\u306a\\u3089\\n                    cnt = 0\\n                    for o in range(m-1): # (0,1) b[0]\\u306f\\u4e00\\u3057\\u305f\\u306e\\u3067\\u305d\\u308c\\u4ee5\\u5916\\n                        if b[o+1] == a[k+o+1][l:m+l]: # b[1/2]\\u304ca[]\\n                            cnt += 1\\n                    if cnt == m-1:\\n                        res = \\\"Yes\\\"\\n        \\nprint(res)\", \"n, m = map(int, input().split())\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\nfor i in a:\\n    for j in b:\\n        if j not in i:\\n            print('No')\\n            return\\nprint('Yes')\", \"N, M = map(int, input().split())\\nA, B = [''] * N, [''] * M\\nfor i in range(N):\\n    A[i] = input()\\nfor i in range(M):\\n    B[i] = input()\\n\\ndef check(x, y):\\n    if x + M > N or y + M > N: return False\\n    for i in range(M):\\n        for j in range(M):\\n            if A[x + i][y + j] != B[i][j]: return False\\n    return True\\n\\nfor i in range(N):\\n    for j in range(N):\\n        if check(i, j):\\n            print('Yes')\\n            return\\nprint('No')\", \"import numpy as np\\nn, m = map(int, input().split())\\nA = np.array([list(input()) for i in range(n)])\\nB = np.array([list(input()) for j in range(m)])\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        if np.all(B == A[i:i+m, j:j+m]):\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"N,M=map(int, input().split())\\nA = [input() for i in range(N)]\\nB = [input() for i in range(M)]\\n \\nfor i in range(N-M+1):\\n  for j in range(N-M+1):\\n    t = True\\n    for k in range(M):\\n      if B[k] != A[i+k][j:j+M]:\\n        t = False\\n    if t:\\n      print(\\\"Yes\\\")\\n      return\\nprint(\\\"No\\\")\", \"n, m=map(int,input().split())\\nA=[input() for _ in range(n)]\\nB=[input() for _ in range(m)]\\n\\ndef dfs(y, x):\\n    for Y in range(m):\\n        for X in range(m):\\n            if A[y+Y][x+X]!=B[Y][X]:\\n                return False\\n    return True\\n\\nans=\\\"No\\\"\\nfor y in range(n-m+1):\\n    for x in range(n-m+1):\\n        if A[y][x]==B[0][0]:\\n            if dfs(y,x):\\n                ans=\\\"Yes\\\"\\n                break\\n    else:\\n        continue\\n    break\\n\\nprint(ans)\", \"n,m = map(int,input().split())\\na = [\\\"\\\" for _ in range(n)]\\nb = [\\\"\\\" for _ in range(m)]\\nfor i in range(n):\\n  ai = str(input())\\n  a[i] = ai\\nfor i in range(m):\\n  bi = str(input())\\n  b[i] = bi\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    flag = False\\n    for k in range(m):\\n      for l in range(m):\\n        if a[i+k][j+l] != b[k][l]:\\n          flag = True\\n          break\\n      if flag:\\n        break\\n    if not flag:\\n      print(\\\"Yes\\\")\\n      return\\nprint(\\\"No\\\")\", \"n ,m = list(map(int, input().split()))\\nln = []\\nlm = []\\n\\nfor i in range(n):\\n    ln.append(input())\\nfor i in range(m):\\n    lm.append(input())\\n\\nlim = n - m + 1\\nfor i in range(lim):\\n    for j in range(lim):\\n        l = 0\\n        for k in ln[i:i+m]:\\n            if k[j:j+m] != lm[l]:\\n                break\\n            l += 1\\n        else:\\n            print(\\\"Yes\\\")\\n            break\\n    else:\\n        continue\\n    break\\n\\nelse:\\n    print(\\\"No\\\")\\n\", \"n,m=list(map(int,input().split()))\\na=[list(input()) for _ in range(n)]\\nb=[list(input()) for _ in range(m)]\\nr=n-m+1\\nfor x in range(r**2):\\n  for y in range(m**2):\\n    if a[x//r+y//m][x%r+y%m]!=b[y//m][y%m]:\\n      break\\n  else:\\n    print('Yes')\\n    break\\nelse:\\n  print('No')\\n\\n\", \"n,m = map(int,input().split())\\nA = [input() for i in range(n)]\\nB = [input() for i in range(m)]\\n\\nflag = False\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        flag = True\\n        for k in range(m):\\n            if B[k] != A[i+k][j:j+m]:\\n                flag = False\\n        if flag:\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"N,M = map(int, input().split())\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\n\\nans = \\\"No\\\"\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        flag = True\\n        for k in range(M):\\n            for l in range(M):\\n                if A[i+k][j+l] != B[k][l]:\\n                    flag = False\\n                    break\\n        if flag:\\n            ans = \\\"Yes\\\"\\n            break\\nprint(ans)\", \"import sys\\nn, m = list(map(int, input().split()))\\na, b = [], []\\n\\nfor _ in range(n):\\n    a.append(input())\\nfor _ in range(m):\\n    b.append(input())\\n\\nfor i in range(0, n-m+1):\\n    for j in range(0, n-m+1):\\n        for k in range(m*m):\\n            if a[i+k//m][j+k%m] != b[k//m][k%m]:\\n                break\\n            elif k == m*m-1:\\n                print('Yes')\\n                return\\nprint('No')\\n\", \"n, m = list(map(int, input().split()))\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\n\\nans = False\\nfor y in range(n-m+1):\\n    for x in range(n-m+1):\\n        sol = True\\n        for h in range(m):\\n            if a[y+h][x:x+m] != b[h]:\\n                sol = False\\n                break\\n\\n        if sol:\\n            ans = True\\n            break\\n    if ans:\\n        break\\n\\nprint(\\\"Yes\\\" if ans else \\\"No\\\")\", \"N, M = map(int, input().split())\\nif N < M:\\n  print('No')\\nelse:\\n  A = [input() for _ in range(N)]\\n  B = ''\\n  cnt = 0\\n  for _ in range(M):\\n    B += input().rstrip()\\n  for i in range(N-M+1):\\n    if cnt==1:\\n      break\\n    for j in range(N-M+1):\\n      judge = ''\\n      for k in range(M):\\n        judge += A[i+k][j:j+M]\\n      if judge == B:\\n        cnt += 1\\n        break\\n  if cnt == 1:\\n    print('Yes')\\n  else:\\n    print('No')\", \"N, M = list(map(int, input().split()))\\nA = [input() for _ in range(N)]\\nB = [input() for _ in range(M)]\\nflag = 0\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        if [line[j:j+M] for line in A[i:i+M]] == B:\\n            flag = 1\\nprint(('Yes' if flag == 1 else 'No'))\\n\\n\", \"n, m=list(map(int,input().split()))\\npic_a = [input() for _ in range(n)]\\npic_b = [input() for _ in range(m)]\\ntop = pic_b[0][0]\\nif m==1:\\n    for line_a in pic_a:\\n        for chr_a in line_a:\\n            if top==chr_a:\\n                print('Yes')\\n                return\\n    print('No')\\n    return\\nfor i, line_a in enumerate(pic_a[:-m+1]):\\n    for j, chr_a in enumerate(line_a[:-m+1]):\\n        if top == chr_a:\\n            for k, line_b in enumerate(pic_b):\\n                if line_b != pic_a[i+k][j:j+m]:\\n                    break\\n            else:\\n                print('Yes')\\n                return\\nprint('No')\\n\", \"N, M = map(int,input().split())\\n\\nA = []\\nfor i in range(N):\\n    A.append(input())\\n\\nB = []\\nfor i in range(M):\\n    B.append(input())\\n\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        for k in range(M):\\n            if A[i+k][j:j+M] != B[k]:\\n                break\\n            if k == M-1:\\n                print(\\\"Yes\\\")\\n                return\\n\\nprint(\\\"No\\\")\", \"N, M = map(int, input().split())\\nA = [input() for i in range(N)]\\nB = [input() for i in range(M)]\\n \\nfor i in range(N - M + 1):  # tate\\n    for j in range(N - M + 1):  # yoko\\n        ans = 1\\n        for k in range(M):\\n            if B[k] != A[i + k][j:j+M]:\\n                ans = 0\\n        if ans == 1:\\n            print('Yes')\\n            return\\nprint('No')\", \"n,m = map(int,input().split())\\nA=[]\\nB=[]\\nfor i in range(n):\\n    A.append(input())\\nfor i in range(m):\\n    B.append(input())\\ncnt=0\\nflag = False\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        ans = 'Yes'\\n        for k in range(m):\\n            for l in range(m):\\n                if A[i+k][j+l]!=B[k][l]:\\n                    ans = 'No'\\n        else:\\n            if ans == 'Yes':\\n                print(ans)\\n                return\\nprint(ans)\", \"N, M = map(int, input().split())\\nA = [''] * N\\nB = [''] * M\\nfor i in range(N):\\n    A[i] = input()\\nfor i in range(M):\\n    B[i] = input()\\n\\nmatch_cnt = 0\\nfor i in range(N - M + 1):\\n    for j in range(N - M + 1):\\n        flag = True\\n        for y in range(M):\\n            for x in range(M):\\n                if A[y + i][x + j] != B[y][x]:\\n                    flag = False\\n        if flag:\\n            match_cnt += 1\\n\\nif match_cnt > 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N,M = map(int,input().split())\\nA = []\\nfor i in range(N):\\n    a = list(input())\\n    A.append(a)\\nB = []\\nfor i in range(M):\\n    b = list(input())\\n    B.append(b)\\nans = \\\"No\\\"\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        if A[i][j] == B[0][0]:\\n            count = 0\\n            for k in range(M):\\n                for l in range(M):\\n                    if A[i+k][j+l] == B[k][l]:\\n                        count += 1\\n            if count == M*M:\\n                ans = \\\"Yes\\\"\\n                break\\nprint(ans)\", \"n,m = map(int, input().split())\\na = [input() for _ in range(n)]\\nb = [input() for _ in range(m)]\\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        tnp = 0\\n        for k in range(m):\\n            for l in range(m):\\n                if (a[i+k][j+l]!=b[k][l]):\\n                    tnp += 1\\n        if (tnp==0):\\n            print(\\\"Yes\\\")\\n            return\\nprint(\\\"No\\\")\", \"import numpy as np\\n\\nN,M=map(int,input().split())\\nA=np.array([list(str(input())) for i in range(N)])\\nB=np.array([list(str(input())) for j in range(M)])\\nans=\\\"No\\\"\\n\\nfor i in range(N-M+1):\\n    for j in range(N-M+1):\\n        x=[s[j:M+j] for s in A[i:M+i]]\\n        if np.count_nonzero((x==B)==0) == 0:\\n            ans=\\\"Yes\\\"\\n\\nprint(ans)\", \"N, M = map(int, input().split())\\nA = []\\nB = \\\"\\\"\\nfor _ in range(N):\\n  A.append(input())\\nfor _ in range(M):\\n  B += input()\\nfor row in range(N-M+1):\\n  for col in range(N-M+1):\\n    tmp = \\\"\\\"\\n    for p in range(M):\\n      tmp += A[row+p][col:col+M]\\n    if tmp == B:\\n      print(\\\"Yes\\\")\\n      return\\nprint(\\\"No\\\")\", \"n,m = list(map(int, input().split()))\\nma = []\\nfor i in range(n):\\n  ma.append(input())\\n\\nt = []\\nfor i in range(m):\\n  t.append(input())\\n\\nans = False\\nfor i in range(n - m + 1):\\n  for j in range(n - m + 1):\\n    for k in range(m):\\n      ll = ma[i + k][j : j + m]\\n      if ll != t[k]:\\n        break\\n    else:\\n      ans = True\\n\\nif ans:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n,m = map(int, input().split())\\na = [[] for _ in range(n)]\\nb = \\\"\\\"\\nc = \\\"\\\"\\nans = 0\\nfor i in range(n):\\n  a[i] = list(input())\\nfor j in range(m):\\n  b += input()\\nfor i in range(n-m+1):\\n  for j in range(n-m+1):\\n    for k in range(i,i+m):\\n      for l in range(j,j+m):\\n        c += a[k][l]\\n    if c == b:\\n      ans += 1\\n      break\\n    c = \\\"\\\"\\nprint(\\\"Yes\\\" if ans > 0 else \\\"No\\\")\", \"N, M = list(map(int, input().split()))\\nA = []\\nB = []\\nclear = 0\\nsame = 0\\nfor i in range(N):\\n    A.append(str(input()))\\nfor i in range(M):\\n    B.append(str(input()))\\n\\nfor i in range(N - M + 1):\\n    for j in range(N - M + 1):\\n        same = 0\\n        for k in range(M):\\n            if A[i + k][j: j + M] == B[k]:\\n                same += 1\\n            else:\\n                break\\n        if same == M:\\n            clear = 1\\n            break\\n\\nif clear == 1:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n        \\n\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nimport heapq\\nimport re\\nimport numpy as np\\nfrom functools import reduce\\n\\nrr = lambda: sys.stdin.readline().rstrip()\\nrs = lambda: sys.stdin.readline().split()\\nri = lambda: int(sys.stdin.readline())\\nrm = lambda: list(map(int, sys.stdin.readline().split()))\\nrl = lambda: list(map(int, sys.stdin.readline().split()))\\ninf = float('inf')\\nmod = 10**9 + 7\\n\\n\\nn, m = rm()\\na = [rr() for _ in range(n)]\\nb = [rr() for _ in range(m)] \\nfor i in range(n-m+1):\\n    for j in range(n-m+1):\\n        c = [s[j:j+m] for s in a[i:i+m]]\\n        if c == b:\\n            print('Yes')\\n            return\\nprint('No')\\n\\n\\n\\n\", \"n,m = map(int,input().split())\\na = []\\nb = []\\nfor _ in range(n):\\n  a.append(input())\\nfor _ in range(m):\\n  b.append(input())\\nfor i in range(n-m+1):\\n  if b[i] in a[i]:\\n    for x in range(m-1):\\n      if b[i+x] not in a[i+x]:\\n        print(\\\"No\\\")\\n        return\\n    print(\\\"Yes\\\")\\n    return\\n  else:\\n    print(\\\"No\\\")\\n    return\"]",
        "difficulty": "introductory",
        "input": "1 1\n.\n.\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc054/tasks/abc054_b"
    },
    {
        "id": 446,
        "task_id": 4699,
        "test_case_id": 1,
        "question": "Iroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\nFind the amount of money that she will hand to the cashier.\n\n-----Constraints-----\n -  1 ≦ N < 10000\n -  1 ≦ K < 10\n -  0 ≦ D_1 < D_2 < … < D_K≦9\n - \\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\n-----Input-----\nThe input is given from Standard Input in the following format:\nN K\nD_1 D_2 … D_K\n\n-----Output-----\nPrint the amount of money that Iroha will hand to the cashier.\n\n-----Sample Input-----\n1000 8\n1 3 4 5 6 7 8 9\n\n-----Sample Output-----\n2000\n\nShe dislikes all digits except 0 and 2.\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.",
        "solutions": "[\"import itertools\\n\\ndef cal(N, target_num, keta):\\n    answer = float('inf')\\n    for p in itertools.product(target_num, repeat=keta):\\n        temp = 0\\n        for i, num in enumerate(p):\\n            temp += num * 10**i\\n            \\n        if temp >= N:\\n            answer = min(answer, temp)\\n\\n    return answer\\n\\ndef __starting_point():\\n    N, K = map(int, input().split()) # N\\u5186\\u306e\\u54c1\\u7269\\u3001K\\u500b\\u306e\\u5acc\\u3044\\u306a\\u6570\\u5b57\\n    D = set(list(map(int, input().split()))) # \\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u30ea\\u30b9\\u30c8\\n    base = set(range(10))\\n\\n    target_num = base - D\\n    keta = len(str(N))\\n\\n    answer = min(cal(N, target_num, keta), cal(N, target_num, keta+1))\\n\\n    print(answer)\\n__starting_point()\", \"import sys\\nimport numpy as np\\nread = sys.stdin.readline\\n\\n\\ndef main(n, k, a):\\n    for i in np.arange(n, 100000):\\n        ok = True\\n        j = i\\n        while j:\\n            ok &= j % 10 not in a\\n            j //= 10\\n        if ok:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    n, k = np.fromstring(read(), dtype=np.int32, sep=' ')\\n    a = np.fromstring(read(), dtype=np.int32, sep=' ')\\n    main(n, k, a)\\n\\n__starting_point()\", \"N, K = map(int, input().split())\\nunlike_list = set(map(str, input().split()))\\n\\ndef judge(num):\\n    for i in str(num):\\n        if i in unlike_list:\\n            return False\\n    return True\\n\\nans = False\\nwhile not ans:\\n    if judge(N):\\n        ans = True\\n    else:\\n        N += 1\\n\\nprint(N)\", \"n, k = list(map(int,input().split()))\\nd = list(map(int,input().split()))\\n\\nwhile n < 10**5:\\n    x = str(n)\\n    if all(int(i) not in d for i in x):\\n        print(n)\\n        return\\n    n += 1\\n\", \"n, k = list(map(int, input().split()))\\nd = list(input().split())\\nans = n\\nfind = False\\nwhile find == False:\\n    p = str(ans)\\n    find = True\\n    for i in range(len(p)):\\n        if p[i] in d:\\n            find = False\\n            break\\n    if find == False:\\n        ans += 1\\n\\nprint(ans)\\n\", \"import sys\\n\\nN,K=list(map(int,input().split()))\\nD=list(map(int,input().split()))\\n\\n\\nwhile True:\\n  for x in [int(n) for n in str(N)]:\\n    if x in D:\\n      break\\n  else:\\n    print(N)\\n    return\\n  N+=1\\n\", \"total, k = list(map(int, input().split()))\\n\\nd = list(map(int, input().split()))\\n\\ndef total_to_digits(total):\\n    return list(map(int, list(str(total))))\\n\\ndef find_lowest_denomination(total, d):\\n    res = None\\n    for i in range(total, 99999):\\n        digits = list(total_to_digits(i))\\n        if not (set(digits) & set(d)):\\n            print(i)\\n            return\\n\\n\\nfind_lowest_denomination(total, d)\\n\", \"n, k = list(map(int,input().split()))\\na = list(map(str,input().split()))\\n\\n\\nwhile True:\\n    \\n    for j in str(n):\\n        \\n        if j in a:\\n            break\\n    else:\\n        break\\n    n += 1        \\n    \\nprint(n)\", \"def dfs(A: list):\\n    if len(A) > len(str(n))+1:\\n        return\\n    if len(A) and (x := int(\\\"\\\".join(A))) >= n and ans[0] > x:\\n        ans[0] = x\\n        return\\n\\n    for v in d:\\n        if v == \\\"0\\\" and len(A) == 0:\\n            next\\n        A.append(v)\\n        dfs(A)\\n        A.pop()\\n\\n\\nn, k = list(map(int, input().split()))\\nd = sorted(list(set([str(i) for i in range(10)]) - set(input().split())))\\nans = [10**10]\\ndfs([])\\nprint((ans[0]))\\n\", \"n, k= input().split()\\nl = list(map(int,input().split()))\\ncheckNum=[i for i in range(11)]\\n\\ndef find(x):\\n    while x!=checkNum[x]:\\n        checkNum[x]=checkNum[checkNum[x]]\\n        x=checkNum[x]\\n    return x\\n\\nfor i in l:\\n    checkNum[find(i)]=checkNum[find(i+1)]\\n\\nfin=\\\"\\\"\\nfor i in range(len(n)):\\n    first=int(n[i])\\n    k=find(first)\\n    if k==first:\\n        fin+=str(k)\\n    else:\\n        if k!=10:\\n            fin=str(k)+str(find(0))*(len(n)-i-1)\\n        else:\\n            fin=str(find(1))+str(find(0))*len(n)\\n        break\\n\\nprint(fin)\\n\", \"N,K=list(map(int,input().split()))\\nD=[int(x) for x in input().split()]\\nD=set(D)\\nkouho=N\\nwhile(1):\\n    lenkouho=len(str(kouho))\\n    flag=1\\n    for i in range(lenkouho):\\n        if int(str(kouho)[i]) in D:\\n            flag=0\\n    if flag==1:\\n        print(kouho)\\n        break\\n    kouho+=1\\n\", \"#\\n# abc042 c\\n#\\n\\nimport sys\\nfrom io import StringIO\\nimport unittest\\n\\n\\nclass TestClass(unittest.TestCase):\\n    def assertIO(self, input, output):\\n        stdout, stdin = sys.stdout, sys.stdin\\n        sys.stdout, sys.stdin = StringIO(), StringIO(input)\\n        resolve()\\n        sys.stdout.seek(0)\\n        out = sys.stdout.read()[:-1]\\n        sys.stdout, sys.stdin = stdout, stdin\\n        self.assertEqual(out, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_1(self):\\n        input = \\\"\\\"\\\"1000 8\\n1 3 4 5 6 7 8 9\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"2000\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_2(self):\\n        input = \\\"\\\"\\\"9999 1\\n0\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"9999\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n\\ndef resolve():\\n    N, K = list(map(int, input().split()))\\n    D = list(input().split())\\n\\n    for i in range(N, 10*N+1):\\n        for d in D:\\n            if str(i).count(d) != 0:\\n                break\\n        else:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    # unittest.main()\\n    resolve()\\n\\n__starting_point()\", \"N, K = map(int, input().split())\\nD = list(map(int, input().split()))\\nnum = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\\nnum = str(list(set(num) ^ set(D)))\\n\\nans = str(N)\\nclear = 0\\n\\nwhile clear == 0:\\n    for i in range(len(ans)):\\n        if not ans[i] in num:\\n            break\\n        if i == len(ans) - 1:\\n            clear += 1  \\n    ans = str(int(ans) + 1)\\n\\nprint(int(ans) - 1)\", \"N, K = map(int, input().split())\\nD = list(input().split())\\n\\nwhile True:\\n    n = str(N)\\n    for i in range(K):\\n        f = 0\\n        if D[i] in n:\\n            N += 1\\n            f = 1\\n            break\\n    if f == 0:\\n        break\\n\\nprint(N)\", \"N, K = map(int, input().split())\\nD = list(map(int, input().split()))\\n\\n\\ndef f(n, x):\\n    if n==0:\\n        if x >= N:\\n            print(x)\\n            return\\n        return\\n    \\n    for i in range(10):\\n        if i in D:\\n            continue\\n        f(n-1, x*10+i)\\n\\nf(len(str(N)), 0)\\nans = \\\"\\\"\\nfor i in range(1, 10):\\n    if i not in D:\\n        ans = str(i)\\n        break\\nfor i in range(10):\\n    if i not in D:\\n        ans += str(i)*len(str(N))\\n        break\\nprint(ans)\", \"#\\u5024\\u6bb5\\u3001\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u6570\\nN, K = map(int, input().split())\\n#\\u5acc\\u3044\\u306a\\u6570\\u5b57\\nhate_num = list(map(int, input().split()))\\n#\\u30eb\\u30fc\\u30d7\\u7528\\ni = N\\n\\nwhile 1:\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5165\\u3063\\u3066\\u3044\\u308b\\u6570\\u5b57\\u306e\\u629c\\u304d\\u51fa\\u3057\\n    ans = list({int(i) for i in list(str(i))})\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u5165\\u3063\\u3066\\u3044\\u306a\\u3044\\u304b\\u78ba\\u8a8d\\n    for j in ans:\\n        #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u3042\\u3063\\u305f\\u6642\\n        if j in hate_num: \\n            break\\n    #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u306a\\u304b\\u3063\\u305f\\u6642\\n    else:\\n        print(i)\\n        break\\n    i += 1\", \"n, k = input().split()\\nd = list(map(int, input().split()))\\n\\na = []\\n\\nfor i in range(10):\\n    if i not in d:\\n        a.append(i)\\n\\nn = list(map(int, list(n)))\\n\\nfor i in range(len(n)):\\n    if n[i] in d:\\n        ind = i\\n\\n        done = False\\n        while not done:\\n            for j in range(n[ind]+1, 10):\\n                if j in a:\\n                    n[ind] = j\\n                    done = True\\n                    break\\n\\n            if not done:\\n                ind -= 1\\n\\n                if ind < 0:\\n                    n.insert(0, a[1] if a[0] == 0 else a[0])\\n                    ind = 0\\n                    done = True\\n\\n        for j in range(ind+1, len(n)):\\n            n[j] = a[0]\\n\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, n))))\", \"n,k = list(map(int,input().split()))\\nif k == 0:\\n  print(n)\\n  return\\ndislike = list(input().split())\\n \\nans = n-1\\nflag = 1\\nwhile flag == 1:\\n  ans+=1\\n  flag = 0\\n  for i in str(ans):\\n    if i in dislike:\\n      flag = 1\\n      break\\nprint(ans)\\n\", \"def testa(n,d):\\n    for i in d:\\n        if str(i) in str(n): return 0\\n    return 1\\n\\nn,k = [int(i) for i in input().split()]\\nd = [int(i) for i in input().split()]\\n\\nwhile not testa(n,d): n+=1\\nprint(n)\\n\", \"N, K = map(int, input().split())\\nbl = set(input().split())\\n\\nwhile True:\\n  if len(set(str(N)) & bl) != 0:\\n    N += 1\\n  else:\\n    print(N)\\n    break\", \"N, K = list(map(int,input().split()))\\nD = set(input().split())\\n\\nfor k in range(N,10**9):\\n    f = 1\\n    for e in str(k):\\n        if e in D:\\n            f = 0\\n            break\\n    if f == 1:\\n        print(k)\\n        return\\n\", \"def dfs(i,num_str):\\n    nonlocal ans_list\\n    if i==len(str(n)):\\n        ans_list.append(int(num_str))\\n        if len(num_list)==1:\\n            ans_list.append(int(num_list[0]+num_str))\\n        else:\\n            if num_list[0]=='0':\\n                ans_list.append(int(num_list[1]+num_str))\\n            else:    \\n                ans_list.append(int(num_list[0]+num_str))\\n        return\\n    else:\\n        for j in num_list:\\n            dfs(i+1,num_str+j)\\n\\nn,k = map(int,input().split())\\nd = list(map(int,input().split()))\\n\\nans_list = []\\nnum_list = []\\nfor i in range(10):\\n    if i not in d:\\n        num_list.append(str(i))\\n        \\n#print(num_list)\\n\\ndfs(0,'')\\nsort_list = sorted(ans_list)\\n#print(sort_list[10:])\\n\\nfor i in sort_list:\\n    if n<=i:\\n        print(int(i))\\n        break\", \"n, k = map(int, input().split())\\nD = set(input())\\nfor i in range(n, 10**5):\\n  if set(str(i)) & D == set():\\n    print(i)\\n    return\", \"#\\u5024\\u6bb5\\u3001\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u6570\\nN, K = map(int, input().split())\\n#\\u5acc\\u3044\\u306a\\u6570\\u5b57\\nhate_num = list(map(int, input().split()))\\n#\\u30eb\\u30fc\\u30d7\\u7528\\ni = N\\n\\nwhile 1:\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5165\\u3063\\u3066\\u3044\\u308b\\u6570\\u5b57\\u306e\\u629c\\u304d\\u51fa\\u3057\\n    ans = list({int(x) for x in list(str(i))})\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u5165\\u3063\\u3066\\u3044\\u306a\\u3044\\u304b\\u78ba\\u8a8d\\n    for j in ans:\\n        #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u3042\\u3063\\u305f\\u6642\\n        if j in hate_num: \\n            break\\n    #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u306a\\u304b\\u3063\\u305f\\u6642\\n    else:\\n        print(i)\\n        break\\n    i += 1\", \"i3=lambda : map(int,input().split())\\n\\nN,K=i3()\\n*D,=i3()\\n\\nD=set(D)\\n\\nfor i in range(N,10**5):\\n    ans=1\\n    for s in str(i):\\n        if int(s) in D:\\n            ans=0\\n            break\\n    if ans : break\\nprint(i)\", \"import sys\\n\\n\\ndef check(pay, like):\\n    str_pay = str(pay)\\n    like = ''.join(like)\\n    for p in str_pay:\\n        for lk in like:\\n            if p == lk:\\n                return False\\n\\n    return True\\n\\nN, K = list(map(int, input().split()))\\n\\nD = []\\nD = list(map(int, input().split()))\\nstr_D = []\\n\\nfor s in D:\\n    str_D.append(str(s))\\n\\npay = N\\n\\nwhile True:\\n    if check(pay, str_D):\\n        print(pay)\\n        return\\n    pay += 1\\n\", \"def dfs(A: list):\\n    if len(A) > nn:\\n        return\\n    if len(A) and (x := int(\\\"\\\".join(A))) >= n and ans[0] > x:\\n        ans[0] = x\\n        return\\n\\n    for v in d:\\n        if v == \\\"0\\\" and len(A) == 0:\\n            next\\n        A.append(v)\\n        dfs(A)\\n        A.pop()\\n\\n\\nn, k = list(map(int, input().split()))\\nd = sorted(list(set([str(i) for i in range(10)]) - set(input().split())))\\nnn = len(str(n))+1\\nans = [10**7]\\ndfs([])\\nprint((ans[0]))\\n\", \"n, k = list(map(int, input().split()))\\nd = list(input().split())\\n#n = 1000\\nflag = True\\nwhile flag:\\n    flag2 = True\\n    for si in str(n):\\n        if si in d:\\n            n += 1\\n            flag2 = False\\n            break\\n    if flag2:\\n        break\\n    else:\\n        flag = True\\n            \\nprint(n)\\n\", \"def check(n, D):\\n    N = []\\n    while n != 0:\\n        N.append(n % 10)\\n        n //= 10\\n    for d in D:\\n        if d in N:\\n            return False\\n    return True\\n\\ndef __starting_point():\\n    n, k = [int(x) for x in input().split(' ')]\\n    D = [int(x) for x in input().split(' ')]\\n    res = n\\n    while True:\\n        if check(res, D):\\n            break\\n        else:\\n            res += 1\\n    print(res)\\n\\n__starting_point()\", \"def is_dislike(N, ds):\\n  num = N\\n  while(True):\\n    if (num % 10) in ds:\\n      return True\\n    else:\\n      num = int(num / 10)\\n      if num == 0:\\n        break\\n  return False\\n\\n\\nnk = list(map(int,input().split()))\\nN = nk[0]\\nK = nk[1]\\nds = list(map(int,input().split()))\\nwhile(True):\\n  if is_dislike(N, ds):\\n    N = N+1\\n  else:\\n    print(N)\\n    break\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\n#mod = 998244353\\nINF = float('inf')\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\n\\n#dic = defaultdict(int)\\nn,k = readInts()\\nD = Counter(readInts())\\ndef ok(n):\\n    while n:\\n        v = n%10\\n        if D[v]:\\n            return False\\n        n //= 10\\n    return True\\nans = n\\nfor i in range(n, 100000):\\n    if ok(i):\\n        ans = i\\n        break\\nprint(ans)\\n\", \"import sys\\nimport numpy as np\\nread = sys.stdin.readline\\n\\n\\ndef main(n, k, a):\\n    for i in range(n, 100000):\\n        s = np.array(list(map(int, str(i))), dtype=np.int64)\\n        ok = True\\n        for j in s:\\n            ok &= j not in a\\n        if ok:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    n, k = np.fromstring(read(), dtype=np.int64, sep=' ')\\n    a = np.fromstring(read(), dtype=np.int64, sep=' ')\\n    main(n, k, a)\\n\\n__starting_point()\", \"n, k = map(int, input().split())\\narr = list(map(int, input().split()))\\n\\ninf = float('inf')\\nmin_cost = inf\\nfor amount in range(n, 100000):\\n    for i, e in enumerate(arr):\\n        if str(e) in str(amount):\\n            break\\n        if i == len(arr)-1:\\n            min_cost = min(min_cost, amount)\\n\\nprint(min_cost)\", \"#\\n# abc042 c\\n#\\n\\nimport sys\\nfrom io import StringIO\\nimport unittest\\n\\n\\nclass TestClass(unittest.TestCase):\\n    def assertIO(self, input, output):\\n        stdout, stdin = sys.stdout, sys.stdin\\n        sys.stdout, sys.stdin = StringIO(), StringIO(input)\\n        resolve()\\n        sys.stdout.seek(0)\\n        out = sys.stdout.read()[:-1]\\n        sys.stdout, sys.stdin = stdout, stdin\\n        self.assertEqual(out, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_1(self):\\n        input = \\\"\\\"\\\"1000 8\\n1 3 4 5 6 7 8 9\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"2000\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_2(self):\\n        input = \\\"\\\"\\\"9999 1\\n0\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"9999\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n\\ndef resolve():\\n    N, K = list(map(int, input().split()))\\n    D = list(input().split())\\n\\n    for i in range(100000):\\n        if i < N:\\n            continue\\n        for d in D:\\n            if str(i).count(d) != 0:\\n                break\\n        else:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    # unittest.main()\\n    resolve()\\n\\n__starting_point()\", \"n,k = input().split()\\nhate = list(input().split())\\nexi = True\\nt = True\\n\\nwhile True:\\n    for c in hate:\\n        t = True\\n        if c in list(n):\\n            t = False\\n            break\\n    if t:\\n        print(n)\\n        break\\n\\n    intN = int(n) + 1\\n    n = str(intN)\", \"import itertools\\n\\ndef main():\\n\\tN, K = [int(n) for n in input().split(\\\" \\\")]\\n\\tD = [1] * 10\\n\\tfor d in input().split(\\\" \\\"):\\n\\t\\tD[int(d)] = 0\\n\\tL = [str(i) for i, v in enumerate(D) if v == 1]\\n\\n\\tdigit = len(str(N))\\n\\tcand = []\\n\\tfor n in list(itertools.product(L, repeat=digit)):\\n\\t\\tp = int(\\\"\\\".join(list(n)))\\n\\t\\tif p >= N:\\n\\t\\t\\tcand.append(p)\\n\\tif len(cand):\\n\\t\\tprint(min(cand))\\n\\telse:\\n\\t\\tif L[0] == \\\"0\\\":\\n\\t\\t\\tprint(str(L[1]) + \\\"0\\\" * digit)\\n\\t\\telse:\\n\\t\\t\\tprint(str(L[0]) * (digit + 1))\\n\\n\\nmain()\", \"import sys\\ninput = sys.stdin.readline\\n\\ndef find_ok( x , Oks ):\\n    for i in Oks:\\n        if int(i) > int(x):\\n            break\\n    return i\\n\\ndef main():\\n    n,k = map( int , input().split() )\\n    Nos = set(map( int , input().split() ))\\n    while(1):\\n        x = str(n)\\n        set_n= set()\\n        for digit in x:\\n            set_n.add( int(digit) )\\n        if len(set_n & Nos) == 0:\\n            break\\n        n += 1\\n    print(n)\\n\\n\\n\\nmain()\", \"n,k=list(map(int,input().split()))\\nd=set(input().split())\\n\\nwhile True:\\n  if len(set(str(n))&d) != 0:\\n    n+=1\\n    \\n  else:\\n    print(n)\\n    break\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[21]:\\n\\n\\nimport itertools\\n\\ndef main():\\n\\tN, K = [int(n) for n in input().split(\\\" \\\")]\\n\\tD = [1] * 10\\n\\tfor d in input().split(\\\" \\\"):\\n\\t\\tD[int(d)] = 0\\n\\tL = [str(i) for i, v in enumerate(D) if v == 1]\\n\\n\\tdigit = len(str(N))\\n\\tcand = []\\n\\tfor n in list(itertools.product(L, repeat=digit)):\\n\\t\\tp = int(\\\"\\\".join(list(n)))\\n\\t\\tif p >= N:\\n\\t\\t\\tcand.append(p)\\n\\tif len(cand):\\n\\t\\tprint((min(cand)))\\n\\telse:\\n\\t\\tif L[0] == \\\"0\\\":\\n\\t\\t\\tprint((str(L[1]) + \\\"0\\\" * digit))\\n\\t\\telse:\\n\\t\\t\\tprint((str(L[0]) * (digit + 1)))\\n\\n\\nmain()\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\", \"N,K = map(int,input().split())\\nD = list(map(int,input().split()))\\nE = []\\nfor i in range(10):\\n    if i not in D:\\n        E.append(i)\\nE = sorted(E)\\nN = str(N)\\nind = len(N)\\nfor i in range(len(N)):\\n    if int(N[i]) not in E:\\n        ind = i\\n        break\\nif ind==len(N):\\n    print(N)\\nelse:\\n    flag = 0\\n    x = \\\"\\\"\\n    for i in range(ind,-1,-1):\\n        n = int(N[i])\\n        for e in E:\\n            if e>n:\\n                x = N[:i]+str(e)+str(E[0])*(len(N)-i-1)\\n                flag = 1\\n                break\\n        if flag==1:break\\n    if flag==0:\\n        if E[0]>0:\\n            a = E[0]\\n        else:\\n            a = E[1]\\n        x = str(a)+str(E[0])*len(N)\\n    print(x)\", \"n, k = map(int, input().split())\\nds = [d for d in input().split()]\\nwhile any(c in ds for c in str(n)): n += 1\\nprint(n)\", \"n,k = map(int,input().split())\\nd = list(input().split())\\nflg = True\\nwhile flg:\\n    flg = False\\n    m = list(str(n))\\n    for i in m:\\n        if i in d:\\n            flg = True\\n            break\\n    if flg:\\n        n += 1\\nprint(n)\", \"n,k = map(int,input().split())\\na = list(map(int,input().split()))\\nb = set()\\nfor i in range(10):\\n  if i in a:\\n    b.add(str(i))\\nwhile n > 0:\\n  c = set(list(str(n)))\\n  if c.isdisjoint(b):\\n    print(n)\\n    return\\n  n += 1\", \"# coding:UTF-8\\nimport sys\\n\\n\\ndef resultSur97(x):\\n    return x % (10 ** 9 + 7)\\n\\ndef __starting_point():\\n    # ------ \\u5165\\u529b ------#\\n    nk = list(map(int, input().split()))     # \\u30b9\\u30da\\u30fc\\u30b9\\u533a\\u5207\\u308a\\u9023\\u7d9a\\u6570\\u5b57\\n\\n    x = nk[1]\\n    dList = list(map(int, input().split()))     # \\u30b9\\u30da\\u30fc\\u30b9\\u533a\\u5207\\u308a\\u9023\\u7d9a\\u6570\\u5b57\\n\\n    # ------ \\u51e6\\u7406 ------#\\n    f = 0\\n    n = nk[0]\\n    while f == 0:\\n        nList = [int(c) for c in str(n)]  # \\u6570\\u5b57\\u2192\\u5358\\u6570\\u5b57\\u30ea\\u30b9\\u30c8\\u5909\\u63db\\n        b = 1\\n        for i in nList:\\n            for j in dList:\\n                if i == j:\\n                    b = 0\\n                    break\\n        if b == 1:\\n            break\\n        else:\\n            n += 1\\n\\n    # ------ \\u51fa\\u529b ------#\\n    print((\\\"{}\\\".format(n)))\\n    # if flg == 0:\\n    #     print(\\\"YES\\\")\\n    # else:\\n    #     print(\\\"NO\\\")\\n\\n__starting_point()\", \"import re\\nimport sys\\nimport math\\nimport itertools\\nimport bisect\\nfrom copy import copy\\nfrom collections import deque,Counter\\nfrom decimal import Decimal\\nimport functools\\ndef v(): return input()\\ndef k(): return int(input())\\ndef S(): return input().split()\\ndef I(): return list(map(int,input().split()))\\ndef X(): return list(input())\\ndef L(): return list(input().split())\\ndef l(): return list(map(int,input().split()))\\ndef lcm(a,b): return a*b//math.gcd(a,b)\\nsys.setrecursionlimit(10 ** 9)\\nmod = 10**9+7\\ncnt = 0\\nans = 0\\ninf = float(\\\"inf\\\")\\nal = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nAL = al.upper()\\n\\nn,k = I()\\nd = l()\\nuse = [i for i in range(11) if i not in d ]\\na = True\\nprice = n\\n\\nwhile a:\\n    cnt = 0\\n    for i in str(price):\\n        a = len(str(price))\\n        if int(i) not in d:\\n            cnt += 1\\n        else:\\n            cnt = inf\\n        if a == cnt:\\n            print(price)\\n            return\\n    price += 1\\n    \\n    \\n    \\n\\n\", \"n,k=map(int,input().split())\\nd=list(map(str,input().split()))\\ne=set(d)\\nfor i in range(n,100001):\\n  v = set(str(i))&e\\n  if len(v)== 0:\\n    print(i);return\", \"import itertools\\nn,k = map(int, input().split())\\nd = list(map(int, input().split()))\\nsafe = [i for i in range(10) if i not in d]\\n\\nn_l = list(map(int, list(str(n))))\\nif len(set(safe)&set(n_l)) == len(set(n_l)):\\n    print(n)\\n    return\\n\\nfor v in itertools.product(safe, repeat=len(str(n))):\\n    if v[0] == 0: continue\\n    x = int(\\\"\\\".join(list(map(str, v))))\\n    if int(x) >= n:\\n        print(x)\\n        return\\n\\nfor v in itertools.product(safe, repeat=len(str(n))+1):\\n    if v[0] == 0: continue\\n    x = int(\\\"\\\".join(list(map(str, v))))\\n    if int(x) >= n:\\n        print(x)\\n        return\", \"import sys\\nimport numpy as np\\nread = sys.stdin.readline\\n\\n\\ndef main(n, k, a):\\n    for i in np.arange(n, 100000):\\n        ok = True\\n        for j in str(i):\\n            ok &= j not in a\\n        if ok:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    n, k = np.fromstring(read(), dtype=np.int32, sep=' ')\\n    a = set(read().split())\\n    main(n, k, a)\\n\\n__starting_point()\", \"n,k=map(int,input().split())\\nd=set(input().split())\\n \\nwhile True:\\n  if len(set(str(n))&d) != 0:\\n    n+=1\\n    \\n  else:\\n    print(n)\\n    break\", \"N, K = map(int, input().split())\\nD = set(input().split())\\n\\nfor i in range(N, 100001):\\n    for d in str(i):\\n        if d in D:\\n            break\\n    else:\\n        print(i)\\n        break\", \"n, k = list(map(int, input().split()))\\nd = list(map(int, input().split()))\\n\\nv = n\\nwhile True:\\n    f = True\\n    for t in list(str(v)):\\n        if int(t) in d:\\n            f = False\\n            continue\\n    if f:\\n        print(v)\\n        return\\n    v+=1\\n\", \"n,k = [int(x) for x in input().split()]\\na = input().split()\\n\\ndef check(p):\\n  p = list(str(p))\\n  for i in range(len(p)):\\n    if p[i] in a:\\n      return False\\n  return True\\n\\nfor i in range(n,n * 10000):\\n  if check(i):\\n    print(i)\\n    break\", \"N,K=map(int,input().split())\\n*D,=input().split()\\nok=1\\nwhile ok:\\n    ans=list(str(N))\\n    ok=0\\n    for a in ans:\\n        if a in D:\\n            ok=1\\n    N+=1\\nprint(''.join(ans))\", \"n, k = map(int, input().split())\\nD = list(map(int, input().split()))\\n\\nfor i in range(n, 100000):\\n  m = str(i)\\n  count = 0\\n  for j in range(len(m)):\\n    if int(m[j]) in D:\\n      break\\n    else:\\n      count += 1\\n    if count == len(m):\\n      print(i)\\n      return\\n      \\nprint(0)\", \"n,k=list(map(int,input().split()))\\nl=list(map(int,input().split()))\\nfor v in range(n,10**5):\\n    for c in str(v):\\n        if int(c) in l:\\n            break\\n    else:\\n        print(v)\\n        return\\n\", \"N, K = map(int,input().split())\\nmat = input().split()\\nwhile True:\\n  FIN = 0\\n  for i in range(len(str(N))):\\n    for j in range(K):\\n      if mat[j] == str(N)[i]:\\n        FIN += 1\\n        break\\n  if FIN == 0:\\n    break \\n  else:\\n    N += 1\\nprint(N)\", \"n,k = [int(x) for x in input().split()]\\nds = {int(x) for x in input().split()}\\nns = {0,1,2,3,4,5,6,7,8,9} -ds\\n#print(ds)\\n#print(ns-ds)\\ntemp=0\\nd ={}\\na=1\\nb = {}\\nm = len(str(n)) +1 \\nover=False\\nwhile(a<=m and not over ):\\n  c = []\\n  d = 10**(a-1) \\n  for v in ns:\\n    if a>1:\\n      for bv in b[a-1]:\\n        t = v*d + bv\\n        c += [t]\\n        if t >= n:\\n          print(t)\\n          over=True\\n          break\\n      if over:\\n        break\\n    else:\\n      t = v*d\\n      c += [t]\\n      if t >= n:\\n          print(t)\\n          over=True\\n          break\\n      \\n  b[a] = c\\n  a+=1\\n  \\n#for j in b:    \\n#    print(j,b[j])\\n\\n\", \"# N, K\\u306e\\u5165\\u529b\\u53d7\\u4ed8\\nN, K = map(int, input().split())\\n# D\\u306e\\u5165\\u529b\\u53d7\\u4ed8\\nD = set(input().split())\\n# 0-9\\u3068D\\u306e\\u5dee\\u96c6\\u5408\\u4f5c\\u6210\\u3001\\u30ea\\u30b9\\u30c8\\u5316\\u3057\\u3066E\\u306b\\u4ee3\\u5165\\nE = {\\\"0\\\", \\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\", \\\"7\\\", \\\"8\\\", \\\"9\\\"} - D\\n# N\\u306b1\\u305a\\u3064\\u8db3\\u3057\\u3066\\u6761\\u4ef6\\u306b\\u5408\\u3046\\u6700\\u521d\\u306e\\u6570\\u5b57\\u3092\\u7279\\u5b9a\\u3059\\u308b\\nresult = False\\nwhile result == False:\\n    for i in str(N):\\n        if not i in E:\\n            N = N + 1\\n            result = False\\n            break\\n        else:\\n            result = True\\nprint(N)\", \"n, k = map(int,input().split())\\na = list(input().split())\\n\\nfor i in range(n, 100001):\\n    flg = True\\n    s = str(i)\\n    for j in range(len(s)):\\n        if s[j] in a:\\n            flg = False\\n            break\\n    if flg:\\n        break\\nprint(i)\", \"# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\\n# import math\\n# from itertools import *\\n# import random\\n# import calendar\\nimport datetime\\n# import webbrowser\\n\\n# f = open(\\\"input.txt\\\", 'r')\\n# g = open(\\\"output.txt\\\", 'w')\\n# n, m = map(int, f.readline().split())\\n\\nn, k = list(map(int, input().split()))\\ndislike = list(map(int, input().split()))\\nwhile True:\\n    for i in str(n):\\n        if int(i) not in dislike:\\n            continue\\n        else:\\n            break\\n    else:\\n        break\\n    n += 1\\nprint(n)\\n\", \"n,k=list(map(int,input().split()))\\nd = list(map(int,input().split()))\\n#print(d)\\nfor i in range(n,10**5):\\n    count=0\\n    for j in range(k):\\n        u = str(d[j])\\n        if(str(i).count(u)==0):\\n            count+=1\\n    #print(\\\"count:\\\"+str(count))\\n    if(count==k):\\n        print(i)\\n        break\\n\", \"def is_bad_nums(j: int, d: []) -> bool:\\n    while j:\\n        if j % 10 in d:\\n            return True\\n        j //= 10\\n    return False\\n\\n\\ndef answer(n: int, k: int, d: []) -> int:\\n    for i in range(n, 100000):\\n        if is_bad_nums(i, d):\\n            continue\\n        return i\\n\\n\\ndef main():\\n    n, k = map(int, input().split())\\n    d = list(map(int, input().split()))\\n    print(answer(n, k, d))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"N, K = map(int, input().split())\\nD = list(map(int, input().split()))\\ns = set(D)\\n\\nfor i in range(N, 10**6+1):\\n  l = [j for j in str(i)]\\n  flag = True\\n  for n in l:\\n    if int(n) in s:\\n      flag = False\\n      break\\n  if flag:\\n    ans = i\\n    break\\nprint(ans)\", \"n, k = map(int, input().split())\\nd = list(input().split())\\nwhile True:\\n    flag2 = True\\n    for si in str(n):\\n        if si in d:\\n            n += 1\\n            flag2 = False\\n            break\\n    if flag2:\\n        break            \\nprint(n)\", \"def price(N,K):\\n    Kn = input().split()\\n    Flag = False\\n\\n    for i in range(N,10*N,1):\\n        value = str(i)\\n        for j in range(K):\\n            if(Kn[j] not in value):\\n                Flag = True\\n            elif(Kn[j] in value):\\n                Flag = False\\n                break\\n\\n        if(Flag == True):\\n            print(i)\\n            break\\n\\nN,K = (int(x) for x in input().split())\\nprice(N,K)\", \"n, k = list(map(int, input().split()))\\ndl = list(map(int, input().split()))\\n\\ni = n\\nwhile True:\\n    money = list(map(int, str(i)))\\n    for m in money:\\n        if dl.count(m) != 0:\\n            break\\n    else:\\n        print(i)\\n        break\\n    i += 1\\n    \\n\", \"import sys\\nsys.setrecursionlimit(10**7)\\narr = [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\nsavelis = [0]*10\\ndef main():\\n   N,K = list(map(int,input().split()))\\n   Flis = list(map(int,input().split()))\\n   Tlis = [i for i in range(10)]\\n   Tlis = [i for i in Tlis if i not in Flis]\\n   str_flis = [str(i) for i in Flis]\\n   ANS = []\\n   for i in range(N*10):\\n      stri = str(i)\\n      TF = True\\n      for j in stri:\\n         if j in str_flis:\\n            TF = False\\n            break\\n      if(TF):ANS.append(i)\\n   for item in ANS:\\n      if(item>=N):\\n         print(item)\\n         break\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import itertools\\n\\nN, K = map(int, input().split()) # N\\u5186\\u306e\\u54c1\\u7269\\u3001K\\u500b\\u306e\\u5acc\\u3044\\u306a\\u6570\\u5b57\\nD = set(list(map(int, input().split()))) # \\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u30ea\\u30b9\\u30c8\\nbase = set(range(10))\\n\\ntarget_num = base - D\\nketa = len(str(N))\\n\\nanswer = float('inf')\\nfor p in itertools.product(target_num, repeat=keta):\\n    temp = 0\\n    for i, num in enumerate(p):\\n        temp += num * 10**i\\n        \\n    if temp >= N:\\n        answer = min(answer, temp)\\n\\nfor p in itertools.product(target_num, repeat=keta+1):\\n    temp = 0\\n    for i, num in enumerate(p):\\n        temp += num * 10**i\\n        \\n    if temp >= N:\\n        answer = min(answer, temp)\\n\\nprint(answer)\", \"n,k = list(map(int,input().split()))\\n\\na = list(input().split())\\n\\nwhile  not set(list(str(n)[0:k])).isdisjoint(a):\\n\\tn += 1\\n\\nprint(n)\\n\", \"n, k = map(int, input().split())\\nD = list(input().split())\\n\\nans = str(n)\\nwhile not all([c not in D for c in ans]) and int(ans) >= n:\\n    ans = str(int(ans) + 1)\\nprint(ans)\", \"n, k = map(int, input().split())\\nd = list(map(int, input().split()))\\nng = [False] * 10\\nfor i in d:\\n    ng[i] = True\\ndef ok(n):\\n    nonlocal ng\\n    while n > 0:\\n        if ng[n%10]:\\n            return False\\n        n //= 10\\n    return True\\nwhile not ok(n):\\n    n += 1\\nprint(n)\", \"n, k = list(map(int, input().split()))\\nd = set(map(int, input().split()))\\n\\nwhile True:\\n    tmp_str = set(str(n))\\n    for i in tmp_str:\\n        if int(i) in d:\\n            n += 1\\n            break\\n    else:\\n        print(n)\\n        break\\n\", \"n,k=map(int,input().split())\\nd=list(map(int,input().split()))\\nx=list(range(1,100001))\\ny=[0]*100000\\nfor i in range(100000):\\n    s=str(i)\\n    S=len(s)\\n    for j in range(S):\\n        if int(s[j]) in d:\\n            y[i-1]=1\\n            break\\nfor i in range(100000):\\n    if i>=n-1:\\n        if y[i]==0:\\n            print(i+1)\\n            break\", \"n, k = map(int, input().split())\\nD = set(map(int, input().split()))\\nfrom itertools import count\\nfor ans in count(n,1):\\n    for c in str(ans):\\n        if int(c) in D:\\n            break\\n    else:\\n        print(ans)\\n        break\", \"def iparse():\\n    return list(map(int, input().split()))\\n\\nn, k = iparse()\\nd = iparse()\\n\\nfor i in range(n, 5000000):\\n    tmp = i\\n    f = True\\n    while tmp > 0:\\n        x = tmp % 10\\n        if x in d:\\n            f = False\\n            break\\n        tmp //= 10\\n    if f:\\n        print(i)\\n        return\\n\\n\", \"from sys import stdin\\ninput = stdin.readline\\n\\nN, K = map(int, input().split())\\nD = set(map(int, input().split()))\\n\\nwhile True:\\n    tmp = set(str(N))\\n    b = True\\n    for x in tmp:\\n        if int(x) in D:\\n            b = False\\n            break \\n    if b == True:\\n        break\\n    else:\\n        N += 1\\n\\nprint(N)\", \"N,K = input().split()\\nD =list(map(int,input().split()))\\nans = []\\na = int(N[0])\\nx = 0\\nb = 0\\nwhile b in D:\\n    b += 1\\nc = 2\\nwhile c in D:\\n    c += 1\\ny = 0\\nwhile a == int(N[x]) and x <= len(N)-1:\\n    while a in D and a <= 9:\\n        a += 1\\n    if  a == 10:\\n        y = x\\n        if 0 in D:\\n            a += b\\n        if 1 in D:\\n            if b != 0:\\n                a += (b-1)*10\\n            else:\\n                a += (c-1)*10\\n    ans.append(str(a))\\n    if a != int(N[x]):\\n        for i in range(len(N)-1-x):\\n            ans.append(str(b))\\n    elif x <= len(N)-2:\\n        x += 1\\n        a = int(N[x])\\n    else:\\n        a = int(N[x])-1\\nwhile y > 0:\\n    s = ans[y][0]\\n    t = ans[y][1]\\n    r = ans[y]\\n    ans[y] = t\\n    ans[y-1] = str(int(ans[y-1]) + 1)\\n    if int(ans[y-1]) in D:\\n        u = int(ans[y-1])\\n        while u in D:\\n            u += 1\\n            ans[y-1] = str(u)\\n    if ans[y-1] != \\\"10\\\":\\n        y = 0\\n    else:\\n        y -= 1\\n        ans[y] = r\\nprint(\\\"\\\".join(ans))\", \"n, k = map(int, input().split())\\nd = list(input().split())\\nnum = [str(i) for i in range(10)]\\nfor i in range(k):\\n    num.remove(d[i])\\n    \\nimport itertools, heapq\\nans = []\\nheapq.heapify(ans)\\nfor i in itertools.product(num, repeat=len(str(n))):\\n    s = int(''.join(i))\\n    if s >= n:\\n        heapq.heappush(ans, s)\\n        \\nif len(ans) == 0:\\n    for i in itertools.product(num, repeat=len(str(n)) + 1):\\n        s = int(''.join(i))\\n        if s >= n:\\n            heapq.heappush(ans, s)\\n    print(heapq.heappop(ans))\\n    \\nelse:\\n    print(heapq.heappop(ans))\", \"n, k = list(map(int, input().split()))\\nd = list(map(int, input().split()))\\ns = {'0','1','2','3','4','5','6','7','8','9'} - set(str(d))\\nans = n\\n\\nwhile (s >= set(str(n))) == False:\\n  n += 1\\n  if (s >= set(str(n))) == True:\\n    ans = n\\n    break\\n    \\nprint(ans)\\n\", \"def main():\\n    N, K = map(int, input().split())\\n    A_list = list(map(str, input().split()))\\n    use_list = [\\\"0\\\",\\\"1\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\",\\\"5\\\",\\\"6\\\",\\\"7\\\",\\\"8\\\",\\\"9\\\"]\\n    list_A = list(set(use_list) - set(A_list))\\n    #print(\\\"list_A\\\", list_A)\\n    for i in range(100000) :\\n        ans = N + i\\n        #print(\\\"ans\\\", ans)\\n        ans_str = str(ans)\\n        frag = 0\\n        for val in ans_str :\\n            #print(\\\"val\\\", val)\\n            if str(val) in list_A :\\n                pass\\n                #print(\\\"frag\\\", frag)\\n            else :\\n                frag = 1\\n                break\\n\\n        if frag == 0 :\\n            break\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    N, K = list(map(int, input().split()))\\n    D = set(map(int, input().split()))\\n    numset = set(range(0,10))\\n    d = numset.difference(D)\\n\\n    for n in range(N, pow(10, 6) + 10):\\n        check = set(list(str(n)))\\n        ngflag = False\\n        for i in check:\\n            if int(i) in D:\\n                ngflag = True\\n                break\\n        if not ngflag:\\n            break\\n    print(n)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N, K = [int(x) for x in input().split()]\\nD = input().split()\\n\\nfor payment in range(N, 10*N+1):\\n    if all(char not in D for char in str(payment)):\\n        print(payment)\\n        break\", \"n, k = map(int, input().split())\\nd = list(input().split())\\nnum = [str(i) for i in range(10)]\\nfor i in range(k):\\n    num.remove(d[i])\\n    \\nimport itertools\\nans = []\\nfor i in itertools.product(num, repeat=len(str(n))):\\n    s = int(''.join(i))\\n    if s >= n:\\n        ans.append(s)\\n        \\nif len(ans) == 0:\\n    for i in itertools.product(num, repeat=len(str(n)) + 1):\\n        s = int(''.join(i))\\n        if s >= n:\\n            ans.append(s)\\n    print(min(ans))\\n    \\nelse:\\n  print(min(ans))\", \"N, K = map(int, input().split())\\nS = set(input().split())\\nwhile True:\\n    L = list(str(N))\\n    for i in L:\\n        if i in S:\\n            break\\n    else:\\n        break\\n    N += 1\\nprint(N)\", \"n, k = map(int, input().split())\\nd = list(map(int, input().split()))\\n\\nwhile True:\\n    for i in str(n):\\n        if int(i) in d:\\n            n += 1\\n            break\\n    \\n    else:\\n        print(n)\\n        break\", \"N, K, *D = list(map(int, open(0).read().split()))\\nD = set(str(d) for d in D)\\nfor i in range(N, 100_000):\\n    if set(str(i)) & D:\\n        continue\\n    print(i)\\n    break\\n\", \"n,t = [int(x) for x in input().split()]\\nd = [int(x) for x in input().split()]\\n\\ndef check(x) -> bool:\\n    while x>0:\\n        a = x%10\\n        if a in d:\\n            return False\\n        x//=10\\n    return True\\n\\nwhile check(n)==False:\\n    n+=1\\nprint(n)\", \"n,k = map(int,input().split())\\nd=set(input().split())\\nwhile True:\\n    if len(set(str(n))&d)!=0:\\n        n+=1\\n    else:\\n        break\\nprint(n)\", \"def minN(N:int, usable:list, restrict=True):\\n    usable.sort()\\n    keta = False\\n    if restrict:\\n        for i in usable:\\n            if i >= N:\\n                return str(i)\\n        # \\u6841\\u304c\\u5897\\u3048\\u308b\\n        return '1'+str(usable[0])\\n    else:\\n        return str(usable[0])\\n\\ndef rote(N:list, D:set, d:set):\\n    ans = []\\n    flag = True\\n    lenNstr = len(N)\\n    for i, n in enumerate(N):\\n        n = int(n)\\n        keta = 10**(len(N) - i - 1)\\n        if flag:\\n            if n in D:\\n                ans.append(int(minN(n, d)) * keta)\\n                flag = False\\n            else:\\n                ans.append(keta * n)\\n        else:\\n            ans.append(keta * min(d))\\n    return sum(ans)\\n\\ndef main():\\n    N, K = list(map(int, input().split()))\\n    D = set(map(int, input().split()))\\n    numset = set(range(0,10))\\n    d = list(numset.difference(D))\\n    d.sort()\\n    for _ in range(10):\\n        Nstr = list(str(N))\\n        ans = rote(Nstr, D, d)\\n        N = ans    \\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N,K = list(map(int,input().split()))\\n\\nD = list(map(int,input().split()))\\n\\ndef ok(x):\\n    while x:\\n        if x % 10 in D:\\n            return False\\n        x //= 10\\n    return True\\n\\nfor i in range(N,100000):\\n    if ok(i):\\n        print(i)\\n        return\\n\", \"N,K=map(int,input().split())\\nD=list(map(int,input().split()))\\n\\nwhile True:\\n  S=str(N)\\n  flag=True\\n  for x in S:\\n    if int(x) in D:\\n      flag=False\\n  if flag==True:\\n    break;\\n  N+=1\\nprint(N)\", \"n,k=map(int,input().split());a=set(input().split())\\nwhile True:\\n  if not set(str(n))&a: print(n);break\\n  n+=1\", \"N, K = list(map(int, input().split()))\\nkirai = list(map(int, input().split()))\\nwhile True:\\n  bara = [int(x) for x in list(str(N))]\\n  diff = set(kirai) & set(bara)\\n  if diff == set():\\n    print(N)\\n    break\\n  else:\\n    N = N + 1\\n\"]",
        "difficulty": "introductory",
        "input": "1000 8\n1 3 4 5 6 7 8 9\n",
        "output": "2000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc042/tasks/arc058_a"
    },
    {
        "id": 447,
        "task_id": 4699,
        "test_case_id": 2,
        "question": "Iroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\nFind the amount of money that she will hand to the cashier.\n\n-----Constraints-----\n -  1 ≦ N < 10000\n -  1 ≦ K < 10\n -  0 ≦ D_1 < D_2 < … < D_K≦9\n - \\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\n-----Input-----\nThe input is given from Standard Input in the following format:\nN K\nD_1 D_2 … D_K\n\n-----Output-----\nPrint the amount of money that Iroha will hand to the cashier.\n\n-----Sample Input-----\n1000 8\n1 3 4 5 6 7 8 9\n\n-----Sample Output-----\n2000\n\nShe dislikes all digits except 0 and 2.\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.",
        "solutions": "[\"import itertools\\n\\ndef cal(N, target_num, keta):\\n    answer = float('inf')\\n    for p in itertools.product(target_num, repeat=keta):\\n        temp = 0\\n        for i, num in enumerate(p):\\n            temp += num * 10**i\\n            \\n        if temp >= N:\\n            answer = min(answer, temp)\\n\\n    return answer\\n\\ndef __starting_point():\\n    N, K = map(int, input().split()) # N\\u5186\\u306e\\u54c1\\u7269\\u3001K\\u500b\\u306e\\u5acc\\u3044\\u306a\\u6570\\u5b57\\n    D = set(list(map(int, input().split()))) # \\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u30ea\\u30b9\\u30c8\\n    base = set(range(10))\\n\\n    target_num = base - D\\n    keta = len(str(N))\\n\\n    answer = min(cal(N, target_num, keta), cal(N, target_num, keta+1))\\n\\n    print(answer)\\n__starting_point()\", \"import sys\\nimport numpy as np\\nread = sys.stdin.readline\\n\\n\\ndef main(n, k, a):\\n    for i in np.arange(n, 100000):\\n        ok = True\\n        j = i\\n        while j:\\n            ok &= j % 10 not in a\\n            j //= 10\\n        if ok:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    n, k = np.fromstring(read(), dtype=np.int32, sep=' ')\\n    a = np.fromstring(read(), dtype=np.int32, sep=' ')\\n    main(n, k, a)\\n\\n__starting_point()\", \"N, K = map(int, input().split())\\nunlike_list = set(map(str, input().split()))\\n\\ndef judge(num):\\n    for i in str(num):\\n        if i in unlike_list:\\n            return False\\n    return True\\n\\nans = False\\nwhile not ans:\\n    if judge(N):\\n        ans = True\\n    else:\\n        N += 1\\n\\nprint(N)\", \"n, k = list(map(int,input().split()))\\nd = list(map(int,input().split()))\\n\\nwhile n < 10**5:\\n    x = str(n)\\n    if all(int(i) not in d for i in x):\\n        print(n)\\n        return\\n    n += 1\\n\", \"n, k = list(map(int, input().split()))\\nd = list(input().split())\\nans = n\\nfind = False\\nwhile find == False:\\n    p = str(ans)\\n    find = True\\n    for i in range(len(p)):\\n        if p[i] in d:\\n            find = False\\n            break\\n    if find == False:\\n        ans += 1\\n\\nprint(ans)\\n\", \"import sys\\n\\nN,K=list(map(int,input().split()))\\nD=list(map(int,input().split()))\\n\\n\\nwhile True:\\n  for x in [int(n) for n in str(N)]:\\n    if x in D:\\n      break\\n  else:\\n    print(N)\\n    return\\n  N+=1\\n\", \"total, k = list(map(int, input().split()))\\n\\nd = list(map(int, input().split()))\\n\\ndef total_to_digits(total):\\n    return list(map(int, list(str(total))))\\n\\ndef find_lowest_denomination(total, d):\\n    res = None\\n    for i in range(total, 99999):\\n        digits = list(total_to_digits(i))\\n        if not (set(digits) & set(d)):\\n            print(i)\\n            return\\n\\n\\nfind_lowest_denomination(total, d)\\n\", \"n, k = list(map(int,input().split()))\\na = list(map(str,input().split()))\\n\\n\\nwhile True:\\n    \\n    for j in str(n):\\n        \\n        if j in a:\\n            break\\n    else:\\n        break\\n    n += 1        \\n    \\nprint(n)\", \"def dfs(A: list):\\n    if len(A) > len(str(n))+1:\\n        return\\n    if len(A) and (x := int(\\\"\\\".join(A))) >= n and ans[0] > x:\\n        ans[0] = x\\n        return\\n\\n    for v in d:\\n        if v == \\\"0\\\" and len(A) == 0:\\n            next\\n        A.append(v)\\n        dfs(A)\\n        A.pop()\\n\\n\\nn, k = list(map(int, input().split()))\\nd = sorted(list(set([str(i) for i in range(10)]) - set(input().split())))\\nans = [10**10]\\ndfs([])\\nprint((ans[0]))\\n\", \"n, k= input().split()\\nl = list(map(int,input().split()))\\ncheckNum=[i for i in range(11)]\\n\\ndef find(x):\\n    while x!=checkNum[x]:\\n        checkNum[x]=checkNum[checkNum[x]]\\n        x=checkNum[x]\\n    return x\\n\\nfor i in l:\\n    checkNum[find(i)]=checkNum[find(i+1)]\\n\\nfin=\\\"\\\"\\nfor i in range(len(n)):\\n    first=int(n[i])\\n    k=find(first)\\n    if k==first:\\n        fin+=str(k)\\n    else:\\n        if k!=10:\\n            fin=str(k)+str(find(0))*(len(n)-i-1)\\n        else:\\n            fin=str(find(1))+str(find(0))*len(n)\\n        break\\n\\nprint(fin)\\n\", \"N,K=list(map(int,input().split()))\\nD=[int(x) for x in input().split()]\\nD=set(D)\\nkouho=N\\nwhile(1):\\n    lenkouho=len(str(kouho))\\n    flag=1\\n    for i in range(lenkouho):\\n        if int(str(kouho)[i]) in D:\\n            flag=0\\n    if flag==1:\\n        print(kouho)\\n        break\\n    kouho+=1\\n\", \"#\\n# abc042 c\\n#\\n\\nimport sys\\nfrom io import StringIO\\nimport unittest\\n\\n\\nclass TestClass(unittest.TestCase):\\n    def assertIO(self, input, output):\\n        stdout, stdin = sys.stdout, sys.stdin\\n        sys.stdout, sys.stdin = StringIO(), StringIO(input)\\n        resolve()\\n        sys.stdout.seek(0)\\n        out = sys.stdout.read()[:-1]\\n        sys.stdout, sys.stdin = stdout, stdin\\n        self.assertEqual(out, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_1(self):\\n        input = \\\"\\\"\\\"1000 8\\n1 3 4 5 6 7 8 9\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"2000\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_2(self):\\n        input = \\\"\\\"\\\"9999 1\\n0\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"9999\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n\\ndef resolve():\\n    N, K = list(map(int, input().split()))\\n    D = list(input().split())\\n\\n    for i in range(N, 10*N+1):\\n        for d in D:\\n            if str(i).count(d) != 0:\\n                break\\n        else:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    # unittest.main()\\n    resolve()\\n\\n__starting_point()\", \"N, K = map(int, input().split())\\nD = list(map(int, input().split()))\\nnum = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\\nnum = str(list(set(num) ^ set(D)))\\n\\nans = str(N)\\nclear = 0\\n\\nwhile clear == 0:\\n    for i in range(len(ans)):\\n        if not ans[i] in num:\\n            break\\n        if i == len(ans) - 1:\\n            clear += 1  \\n    ans = str(int(ans) + 1)\\n\\nprint(int(ans) - 1)\", \"N, K = map(int, input().split())\\nD = list(input().split())\\n\\nwhile True:\\n    n = str(N)\\n    for i in range(K):\\n        f = 0\\n        if D[i] in n:\\n            N += 1\\n            f = 1\\n            break\\n    if f == 0:\\n        break\\n\\nprint(N)\", \"N, K = map(int, input().split())\\nD = list(map(int, input().split()))\\n\\n\\ndef f(n, x):\\n    if n==0:\\n        if x >= N:\\n            print(x)\\n            return\\n        return\\n    \\n    for i in range(10):\\n        if i in D:\\n            continue\\n        f(n-1, x*10+i)\\n\\nf(len(str(N)), 0)\\nans = \\\"\\\"\\nfor i in range(1, 10):\\n    if i not in D:\\n        ans = str(i)\\n        break\\nfor i in range(10):\\n    if i not in D:\\n        ans += str(i)*len(str(N))\\n        break\\nprint(ans)\", \"#\\u5024\\u6bb5\\u3001\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u6570\\nN, K = map(int, input().split())\\n#\\u5acc\\u3044\\u306a\\u6570\\u5b57\\nhate_num = list(map(int, input().split()))\\n#\\u30eb\\u30fc\\u30d7\\u7528\\ni = N\\n\\nwhile 1:\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5165\\u3063\\u3066\\u3044\\u308b\\u6570\\u5b57\\u306e\\u629c\\u304d\\u51fa\\u3057\\n    ans = list({int(i) for i in list(str(i))})\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u5165\\u3063\\u3066\\u3044\\u306a\\u3044\\u304b\\u78ba\\u8a8d\\n    for j in ans:\\n        #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u3042\\u3063\\u305f\\u6642\\n        if j in hate_num: \\n            break\\n    #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u306a\\u304b\\u3063\\u305f\\u6642\\n    else:\\n        print(i)\\n        break\\n    i += 1\", \"n, k = input().split()\\nd = list(map(int, input().split()))\\n\\na = []\\n\\nfor i in range(10):\\n    if i not in d:\\n        a.append(i)\\n\\nn = list(map(int, list(n)))\\n\\nfor i in range(len(n)):\\n    if n[i] in d:\\n        ind = i\\n\\n        done = False\\n        while not done:\\n            for j in range(n[ind]+1, 10):\\n                if j in a:\\n                    n[ind] = j\\n                    done = True\\n                    break\\n\\n            if not done:\\n                ind -= 1\\n\\n                if ind < 0:\\n                    n.insert(0, a[1] if a[0] == 0 else a[0])\\n                    ind = 0\\n                    done = True\\n\\n        for j in range(ind+1, len(n)):\\n            n[j] = a[0]\\n\\n        break\\n\\nprint(\\\"\\\".join(list(map(str, n))))\", \"n,k = list(map(int,input().split()))\\nif k == 0:\\n  print(n)\\n  return\\ndislike = list(input().split())\\n \\nans = n-1\\nflag = 1\\nwhile flag == 1:\\n  ans+=1\\n  flag = 0\\n  for i in str(ans):\\n    if i in dislike:\\n      flag = 1\\n      break\\nprint(ans)\\n\", \"def testa(n,d):\\n    for i in d:\\n        if str(i) in str(n): return 0\\n    return 1\\n\\nn,k = [int(i) for i in input().split()]\\nd = [int(i) for i in input().split()]\\n\\nwhile not testa(n,d): n+=1\\nprint(n)\\n\", \"N, K = map(int, input().split())\\nbl = set(input().split())\\n\\nwhile True:\\n  if len(set(str(N)) & bl) != 0:\\n    N += 1\\n  else:\\n    print(N)\\n    break\", \"N, K = list(map(int,input().split()))\\nD = set(input().split())\\n\\nfor k in range(N,10**9):\\n    f = 1\\n    for e in str(k):\\n        if e in D:\\n            f = 0\\n            break\\n    if f == 1:\\n        print(k)\\n        return\\n\", \"def dfs(i,num_str):\\n    nonlocal ans_list\\n    if i==len(str(n)):\\n        ans_list.append(int(num_str))\\n        if len(num_list)==1:\\n            ans_list.append(int(num_list[0]+num_str))\\n        else:\\n            if num_list[0]=='0':\\n                ans_list.append(int(num_list[1]+num_str))\\n            else:    \\n                ans_list.append(int(num_list[0]+num_str))\\n        return\\n    else:\\n        for j in num_list:\\n            dfs(i+1,num_str+j)\\n\\nn,k = map(int,input().split())\\nd = list(map(int,input().split()))\\n\\nans_list = []\\nnum_list = []\\nfor i in range(10):\\n    if i not in d:\\n        num_list.append(str(i))\\n        \\n#print(num_list)\\n\\ndfs(0,'')\\nsort_list = sorted(ans_list)\\n#print(sort_list[10:])\\n\\nfor i in sort_list:\\n    if n<=i:\\n        print(int(i))\\n        break\", \"n, k = map(int, input().split())\\nD = set(input())\\nfor i in range(n, 10**5):\\n  if set(str(i)) & D == set():\\n    print(i)\\n    return\", \"#\\u5024\\u6bb5\\u3001\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u6570\\nN, K = map(int, input().split())\\n#\\u5acc\\u3044\\u306a\\u6570\\u5b57\\nhate_num = list(map(int, input().split()))\\n#\\u30eb\\u30fc\\u30d7\\u7528\\ni = N\\n\\nwhile 1:\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5165\\u3063\\u3066\\u3044\\u308b\\u6570\\u5b57\\u306e\\u629c\\u304d\\u51fa\\u3057\\n    ans = list({int(x) for x in list(str(i))})\\n    #\\u652f\\u6255\\u3046\\u91d1\\u984d\\u306b\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u5165\\u3063\\u3066\\u3044\\u306a\\u3044\\u304b\\u78ba\\u8a8d\\n    for j in ans:\\n        #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u3042\\u3063\\u305f\\u6642\\n        if j in hate_num: \\n            break\\n    #\\u5acc\\u3044\\u306a\\u6570\\u5b57\\u304c\\u306a\\u304b\\u3063\\u305f\\u6642\\n    else:\\n        print(i)\\n        break\\n    i += 1\", \"i3=lambda : map(int,input().split())\\n\\nN,K=i3()\\n*D,=i3()\\n\\nD=set(D)\\n\\nfor i in range(N,10**5):\\n    ans=1\\n    for s in str(i):\\n        if int(s) in D:\\n            ans=0\\n            break\\n    if ans : break\\nprint(i)\", \"import sys\\n\\n\\ndef check(pay, like):\\n    str_pay = str(pay)\\n    like = ''.join(like)\\n    for p in str_pay:\\n        for lk in like:\\n            if p == lk:\\n                return False\\n\\n    return True\\n\\nN, K = list(map(int, input().split()))\\n\\nD = []\\nD = list(map(int, input().split()))\\nstr_D = []\\n\\nfor s in D:\\n    str_D.append(str(s))\\n\\npay = N\\n\\nwhile True:\\n    if check(pay, str_D):\\n        print(pay)\\n        return\\n    pay += 1\\n\", \"def dfs(A: list):\\n    if len(A) > nn:\\n        return\\n    if len(A) and (x := int(\\\"\\\".join(A))) >= n and ans[0] > x:\\n        ans[0] = x\\n        return\\n\\n    for v in d:\\n        if v == \\\"0\\\" and len(A) == 0:\\n            next\\n        A.append(v)\\n        dfs(A)\\n        A.pop()\\n\\n\\nn, k = list(map(int, input().split()))\\nd = sorted(list(set([str(i) for i in range(10)]) - set(input().split())))\\nnn = len(str(n))+1\\nans = [10**7]\\ndfs([])\\nprint((ans[0]))\\n\", \"n, k = list(map(int, input().split()))\\nd = list(input().split())\\n#n = 1000\\nflag = True\\nwhile flag:\\n    flag2 = True\\n    for si in str(n):\\n        if si in d:\\n            n += 1\\n            flag2 = False\\n            break\\n    if flag2:\\n        break\\n    else:\\n        flag = True\\n            \\nprint(n)\\n\", \"def check(n, D):\\n    N = []\\n    while n != 0:\\n        N.append(n % 10)\\n        n //= 10\\n    for d in D:\\n        if d in N:\\n            return False\\n    return True\\n\\ndef __starting_point():\\n    n, k = [int(x) for x in input().split(' ')]\\n    D = [int(x) for x in input().split(' ')]\\n    res = n\\n    while True:\\n        if check(res, D):\\n            break\\n        else:\\n            res += 1\\n    print(res)\\n\\n__starting_point()\", \"def is_dislike(N, ds):\\n  num = N\\n  while(True):\\n    if (num % 10) in ds:\\n      return True\\n    else:\\n      num = int(num / 10)\\n      if num == 0:\\n        break\\n  return False\\n\\n\\nnk = list(map(int,input().split()))\\nN = nk[0]\\nK = nk[1]\\nds = list(map(int,input().split()))\\nwhile(True):\\n  if is_dislike(N, ds):\\n    N = N+1\\n  else:\\n    print(N)\\n    break\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n#\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n#mod = 9982443453\\n#mod = 998244353\\nINF = float('inf')\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\n\\n#dic = defaultdict(int)\\nn,k = readInts()\\nD = Counter(readInts())\\ndef ok(n):\\n    while n:\\n        v = n%10\\n        if D[v]:\\n            return False\\n        n //= 10\\n    return True\\nans = n\\nfor i in range(n, 100000):\\n    if ok(i):\\n        ans = i\\n        break\\nprint(ans)\\n\", \"import sys\\nimport numpy as np\\nread = sys.stdin.readline\\n\\n\\ndef main(n, k, a):\\n    for i in range(n, 100000):\\n        s = np.array(list(map(int, str(i))), dtype=np.int64)\\n        ok = True\\n        for j in s:\\n            ok &= j not in a\\n        if ok:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    n, k = np.fromstring(read(), dtype=np.int64, sep=' ')\\n    a = np.fromstring(read(), dtype=np.int64, sep=' ')\\n    main(n, k, a)\\n\\n__starting_point()\", \"n, k = map(int, input().split())\\narr = list(map(int, input().split()))\\n\\ninf = float('inf')\\nmin_cost = inf\\nfor amount in range(n, 100000):\\n    for i, e in enumerate(arr):\\n        if str(e) in str(amount):\\n            break\\n        if i == len(arr)-1:\\n            min_cost = min(min_cost, amount)\\n\\nprint(min_cost)\", \"#\\n# abc042 c\\n#\\n\\nimport sys\\nfrom io import StringIO\\nimport unittest\\n\\n\\nclass TestClass(unittest.TestCase):\\n    def assertIO(self, input, output):\\n        stdout, stdin = sys.stdout, sys.stdin\\n        sys.stdout, sys.stdin = StringIO(), StringIO(input)\\n        resolve()\\n        sys.stdout.seek(0)\\n        out = sys.stdout.read()[:-1]\\n        sys.stdout, sys.stdin = stdout, stdin\\n        self.assertEqual(out, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_1(self):\\n        input = \\\"\\\"\\\"1000 8\\n1 3 4 5 6 7 8 9\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"2000\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n    def test_\\u5165\\u529b\\u4f8b_2(self):\\n        input = \\\"\\\"\\\"9999 1\\n0\\\"\\\"\\\"\\n        output = \\\"\\\"\\\"9999\\\"\\\"\\\"\\n        self.assertIO(input, output)\\n\\n\\ndef resolve():\\n    N, K = list(map(int, input().split()))\\n    D = list(input().split())\\n\\n    for i in range(100000):\\n        if i < N:\\n            continue\\n        for d in D:\\n            if str(i).count(d) != 0:\\n                break\\n        else:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    # unittest.main()\\n    resolve()\\n\\n__starting_point()\", \"n,k = input().split()\\nhate = list(input().split())\\nexi = True\\nt = True\\n\\nwhile True:\\n    for c in hate:\\n        t = True\\n        if c in list(n):\\n            t = False\\n            break\\n    if t:\\n        print(n)\\n        break\\n\\n    intN = int(n) + 1\\n    n = str(intN)\", \"import itertools\\n\\ndef main():\\n\\tN, K = [int(n) for n in input().split(\\\" \\\")]\\n\\tD = [1] * 10\\n\\tfor d in input().split(\\\" \\\"):\\n\\t\\tD[int(d)] = 0\\n\\tL = [str(i) for i, v in enumerate(D) if v == 1]\\n\\n\\tdigit = len(str(N))\\n\\tcand = []\\n\\tfor n in list(itertools.product(L, repeat=digit)):\\n\\t\\tp = int(\\\"\\\".join(list(n)))\\n\\t\\tif p >= N:\\n\\t\\t\\tcand.append(p)\\n\\tif len(cand):\\n\\t\\tprint(min(cand))\\n\\telse:\\n\\t\\tif L[0] == \\\"0\\\":\\n\\t\\t\\tprint(str(L[1]) + \\\"0\\\" * digit)\\n\\t\\telse:\\n\\t\\t\\tprint(str(L[0]) * (digit + 1))\\n\\n\\nmain()\", \"import sys\\ninput = sys.stdin.readline\\n\\ndef find_ok( x , Oks ):\\n    for i in Oks:\\n        if int(i) > int(x):\\n            break\\n    return i\\n\\ndef main():\\n    n,k = map( int , input().split() )\\n    Nos = set(map( int , input().split() ))\\n    while(1):\\n        x = str(n)\\n        set_n= set()\\n        for digit in x:\\n            set_n.add( int(digit) )\\n        if len(set_n & Nos) == 0:\\n            break\\n        n += 1\\n    print(n)\\n\\n\\n\\nmain()\", \"n,k=list(map(int,input().split()))\\nd=set(input().split())\\n\\nwhile True:\\n  if len(set(str(n))&d) != 0:\\n    n+=1\\n    \\n  else:\\n    print(n)\\n    break\\n\", \"#!/usr/bin/env python\\n# coding: utf-8\\n\\n# In[21]:\\n\\n\\nimport itertools\\n\\ndef main():\\n\\tN, K = [int(n) for n in input().split(\\\" \\\")]\\n\\tD = [1] * 10\\n\\tfor d in input().split(\\\" \\\"):\\n\\t\\tD[int(d)] = 0\\n\\tL = [str(i) for i, v in enumerate(D) if v == 1]\\n\\n\\tdigit = len(str(N))\\n\\tcand = []\\n\\tfor n in list(itertools.product(L, repeat=digit)):\\n\\t\\tp = int(\\\"\\\".join(list(n)))\\n\\t\\tif p >= N:\\n\\t\\t\\tcand.append(p)\\n\\tif len(cand):\\n\\t\\tprint((min(cand)))\\n\\telse:\\n\\t\\tif L[0] == \\\"0\\\":\\n\\t\\t\\tprint((str(L[1]) + \\\"0\\\" * digit))\\n\\t\\telse:\\n\\t\\t\\tprint((str(L[0]) * (digit + 1)))\\n\\n\\nmain()\\n\\n\\n# In[ ]:\\n\\n\\n\\n\\n\", \"N,K = map(int,input().split())\\nD = list(map(int,input().split()))\\nE = []\\nfor i in range(10):\\n    if i not in D:\\n        E.append(i)\\nE = sorted(E)\\nN = str(N)\\nind = len(N)\\nfor i in range(len(N)):\\n    if int(N[i]) not in E:\\n        ind = i\\n        break\\nif ind==len(N):\\n    print(N)\\nelse:\\n    flag = 0\\n    x = \\\"\\\"\\n    for i in range(ind,-1,-1):\\n        n = int(N[i])\\n        for e in E:\\n            if e>n:\\n                x = N[:i]+str(e)+str(E[0])*(len(N)-i-1)\\n                flag = 1\\n                break\\n        if flag==1:break\\n    if flag==0:\\n        if E[0]>0:\\n            a = E[0]\\n        else:\\n            a = E[1]\\n        x = str(a)+str(E[0])*len(N)\\n    print(x)\", \"n, k = map(int, input().split())\\nds = [d for d in input().split()]\\nwhile any(c in ds for c in str(n)): n += 1\\nprint(n)\", \"n,k = map(int,input().split())\\nd = list(input().split())\\nflg = True\\nwhile flg:\\n    flg = False\\n    m = list(str(n))\\n    for i in m:\\n        if i in d:\\n            flg = True\\n            break\\n    if flg:\\n        n += 1\\nprint(n)\", \"n,k = map(int,input().split())\\na = list(map(int,input().split()))\\nb = set()\\nfor i in range(10):\\n  if i in a:\\n    b.add(str(i))\\nwhile n > 0:\\n  c = set(list(str(n)))\\n  if c.isdisjoint(b):\\n    print(n)\\n    return\\n  n += 1\", \"# coding:UTF-8\\nimport sys\\n\\n\\ndef resultSur97(x):\\n    return x % (10 ** 9 + 7)\\n\\ndef __starting_point():\\n    # ------ \\u5165\\u529b ------#\\n    nk = list(map(int, input().split()))     # \\u30b9\\u30da\\u30fc\\u30b9\\u533a\\u5207\\u308a\\u9023\\u7d9a\\u6570\\u5b57\\n\\n    x = nk[1]\\n    dList = list(map(int, input().split()))     # \\u30b9\\u30da\\u30fc\\u30b9\\u533a\\u5207\\u308a\\u9023\\u7d9a\\u6570\\u5b57\\n\\n    # ------ \\u51e6\\u7406 ------#\\n    f = 0\\n    n = nk[0]\\n    while f == 0:\\n        nList = [int(c) for c in str(n)]  # \\u6570\\u5b57\\u2192\\u5358\\u6570\\u5b57\\u30ea\\u30b9\\u30c8\\u5909\\u63db\\n        b = 1\\n        for i in nList:\\n            for j in dList:\\n                if i == j:\\n                    b = 0\\n                    break\\n        if b == 1:\\n            break\\n        else:\\n            n += 1\\n\\n    # ------ \\u51fa\\u529b ------#\\n    print((\\\"{}\\\".format(n)))\\n    # if flg == 0:\\n    #     print(\\\"YES\\\")\\n    # else:\\n    #     print(\\\"NO\\\")\\n\\n__starting_point()\", \"import re\\nimport sys\\nimport math\\nimport itertools\\nimport bisect\\nfrom copy import copy\\nfrom collections import deque,Counter\\nfrom decimal import Decimal\\nimport functools\\ndef v(): return input()\\ndef k(): return int(input())\\ndef S(): return input().split()\\ndef I(): return list(map(int,input().split()))\\ndef X(): return list(input())\\ndef L(): return list(input().split())\\ndef l(): return list(map(int,input().split()))\\ndef lcm(a,b): return a*b//math.gcd(a,b)\\nsys.setrecursionlimit(10 ** 9)\\nmod = 10**9+7\\ncnt = 0\\nans = 0\\ninf = float(\\\"inf\\\")\\nal = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nAL = al.upper()\\n\\nn,k = I()\\nd = l()\\nuse = [i for i in range(11) if i not in d ]\\na = True\\nprice = n\\n\\nwhile a:\\n    cnt = 0\\n    for i in str(price):\\n        a = len(str(price))\\n        if int(i) not in d:\\n            cnt += 1\\n        else:\\n            cnt = inf\\n        if a == cnt:\\n            print(price)\\n            return\\n    price += 1\\n    \\n    \\n    \\n\\n\", \"n,k=map(int,input().split())\\nd=list(map(str,input().split()))\\ne=set(d)\\nfor i in range(n,100001):\\n  v = set(str(i))&e\\n  if len(v)== 0:\\n    print(i);return\", \"import itertools\\nn,k = map(int, input().split())\\nd = list(map(int, input().split()))\\nsafe = [i for i in range(10) if i not in d]\\n\\nn_l = list(map(int, list(str(n))))\\nif len(set(safe)&set(n_l)) == len(set(n_l)):\\n    print(n)\\n    return\\n\\nfor v in itertools.product(safe, repeat=len(str(n))):\\n    if v[0] == 0: continue\\n    x = int(\\\"\\\".join(list(map(str, v))))\\n    if int(x) >= n:\\n        print(x)\\n        return\\n\\nfor v in itertools.product(safe, repeat=len(str(n))+1):\\n    if v[0] == 0: continue\\n    x = int(\\\"\\\".join(list(map(str, v))))\\n    if int(x) >= n:\\n        print(x)\\n        return\", \"import sys\\nimport numpy as np\\nread = sys.stdin.readline\\n\\n\\ndef main(n, k, a):\\n    for i in np.arange(n, 100000):\\n        ok = True\\n        for j in str(i):\\n            ok &= j not in a\\n        if ok:\\n            print(i)\\n            break\\n\\n\\ndef __starting_point():\\n    n, k = np.fromstring(read(), dtype=np.int32, sep=' ')\\n    a = set(read().split())\\n    main(n, k, a)\\n\\n__starting_point()\", \"n,k=map(int,input().split())\\nd=set(input().split())\\n \\nwhile True:\\n  if len(set(str(n))&d) != 0:\\n    n+=1\\n    \\n  else:\\n    print(n)\\n    break\", \"N, K = map(int, input().split())\\nD = set(input().split())\\n\\nfor i in range(N, 100001):\\n    for d in str(i):\\n        if d in D:\\n            break\\n    else:\\n        print(i)\\n        break\", \"n, k = list(map(int, input().split()))\\nd = list(map(int, input().split()))\\n\\nv = n\\nwhile True:\\n    f = True\\n    for t in list(str(v)):\\n        if int(t) in d:\\n            f = False\\n            continue\\n    if f:\\n        print(v)\\n        return\\n    v+=1\\n\", \"n,k = [int(x) for x in input().split()]\\na = input().split()\\n\\ndef check(p):\\n  p = list(str(p))\\n  for i in range(len(p)):\\n    if p[i] in a:\\n      return False\\n  return True\\n\\nfor i in range(n,n * 10000):\\n  if check(i):\\n    print(i)\\n    break\", \"N,K=map(int,input().split())\\n*D,=input().split()\\nok=1\\nwhile ok:\\n    ans=list(str(N))\\n    ok=0\\n    for a in ans:\\n        if a in D:\\n            ok=1\\n    N+=1\\nprint(''.join(ans))\", \"n, k = map(int, input().split())\\nD = list(map(int, input().split()))\\n\\nfor i in range(n, 100000):\\n  m = str(i)\\n  count = 0\\n  for j in range(len(m)):\\n    if int(m[j]) in D:\\n      break\\n    else:\\n      count += 1\\n    if count == len(m):\\n      print(i)\\n      return\\n      \\nprint(0)\", \"n,k=list(map(int,input().split()))\\nl=list(map(int,input().split()))\\nfor v in range(n,10**5):\\n    for c in str(v):\\n        if int(c) in l:\\n            break\\n    else:\\n        print(v)\\n        return\\n\", \"N, K = map(int,input().split())\\nmat = input().split()\\nwhile True:\\n  FIN = 0\\n  for i in range(len(str(N))):\\n    for j in range(K):\\n      if mat[j] == str(N)[i]:\\n        FIN += 1\\n        break\\n  if FIN == 0:\\n    break \\n  else:\\n    N += 1\\nprint(N)\", \"n,k = [int(x) for x in input().split()]\\nds = {int(x) for x in input().split()}\\nns = {0,1,2,3,4,5,6,7,8,9} -ds\\n#print(ds)\\n#print(ns-ds)\\ntemp=0\\nd ={}\\na=1\\nb = {}\\nm = len(str(n)) +1 \\nover=False\\nwhile(a<=m and not over ):\\n  c = []\\n  d = 10**(a-1) \\n  for v in ns:\\n    if a>1:\\n      for bv in b[a-1]:\\n        t = v*d + bv\\n        c += [t]\\n        if t >= n:\\n          print(t)\\n          over=True\\n          break\\n      if over:\\n        break\\n    else:\\n      t = v*d\\n      c += [t]\\n      if t >= n:\\n          print(t)\\n          over=True\\n          break\\n      \\n  b[a] = c\\n  a+=1\\n  \\n#for j in b:    \\n#    print(j,b[j])\\n\\n\", \"# N, K\\u306e\\u5165\\u529b\\u53d7\\u4ed8\\nN, K = map(int, input().split())\\n# D\\u306e\\u5165\\u529b\\u53d7\\u4ed8\\nD = set(input().split())\\n# 0-9\\u3068D\\u306e\\u5dee\\u96c6\\u5408\\u4f5c\\u6210\\u3001\\u30ea\\u30b9\\u30c8\\u5316\\u3057\\u3066E\\u306b\\u4ee3\\u5165\\nE = {\\\"0\\\", \\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\", \\\"7\\\", \\\"8\\\", \\\"9\\\"} - D\\n# N\\u306b1\\u305a\\u3064\\u8db3\\u3057\\u3066\\u6761\\u4ef6\\u306b\\u5408\\u3046\\u6700\\u521d\\u306e\\u6570\\u5b57\\u3092\\u7279\\u5b9a\\u3059\\u308b\\nresult = False\\nwhile result == False:\\n    for i in str(N):\\n        if not i in E:\\n            N = N + 1\\n            result = False\\n            break\\n        else:\\n            result = True\\nprint(N)\", \"n, k = map(int,input().split())\\na = list(input().split())\\n\\nfor i in range(n, 100001):\\n    flg = True\\n    s = str(i)\\n    for j in range(len(s)):\\n        if s[j] in a:\\n            flg = False\\n            break\\n    if flg:\\n        break\\nprint(i)\", \"# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\\n# import math\\n# from itertools import *\\n# import random\\n# import calendar\\nimport datetime\\n# import webbrowser\\n\\n# f = open(\\\"input.txt\\\", 'r')\\n# g = open(\\\"output.txt\\\", 'w')\\n# n, m = map(int, f.readline().split())\\n\\nn, k = list(map(int, input().split()))\\ndislike = list(map(int, input().split()))\\nwhile True:\\n    for i in str(n):\\n        if int(i) not in dislike:\\n            continue\\n        else:\\n            break\\n    else:\\n        break\\n    n += 1\\nprint(n)\\n\", \"n,k=list(map(int,input().split()))\\nd = list(map(int,input().split()))\\n#print(d)\\nfor i in range(n,10**5):\\n    count=0\\n    for j in range(k):\\n        u = str(d[j])\\n        if(str(i).count(u)==0):\\n            count+=1\\n    #print(\\\"count:\\\"+str(count))\\n    if(count==k):\\n        print(i)\\n        break\\n\", \"def is_bad_nums(j: int, d: []) -> bool:\\n    while j:\\n        if j % 10 in d:\\n            return True\\n        j //= 10\\n    return False\\n\\n\\ndef answer(n: int, k: int, d: []) -> int:\\n    for i in range(n, 100000):\\n        if is_bad_nums(i, d):\\n            continue\\n        return i\\n\\n\\ndef main():\\n    n, k = map(int, input().split())\\n    d = list(map(int, input().split()))\\n    print(answer(n, k, d))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"N, K = map(int, input().split())\\nD = list(map(int, input().split()))\\ns = set(D)\\n\\nfor i in range(N, 10**6+1):\\n  l = [j for j in str(i)]\\n  flag = True\\n  for n in l:\\n    if int(n) in s:\\n      flag = False\\n      break\\n  if flag:\\n    ans = i\\n    break\\nprint(ans)\", \"n, k = map(int, input().split())\\nd = list(input().split())\\nwhile True:\\n    flag2 = True\\n    for si in str(n):\\n        if si in d:\\n            n += 1\\n            flag2 = False\\n            break\\n    if flag2:\\n        break            \\nprint(n)\", \"def price(N,K):\\n    Kn = input().split()\\n    Flag = False\\n\\n    for i in range(N,10*N,1):\\n        value = str(i)\\n        for j in range(K):\\n            if(Kn[j] not in value):\\n                Flag = True\\n            elif(Kn[j] in value):\\n                Flag = False\\n                break\\n\\n        if(Flag == True):\\n            print(i)\\n            break\\n\\nN,K = (int(x) for x in input().split())\\nprice(N,K)\", \"n, k = list(map(int, input().split()))\\ndl = list(map(int, input().split()))\\n\\ni = n\\nwhile True:\\n    money = list(map(int, str(i)))\\n    for m in money:\\n        if dl.count(m) != 0:\\n            break\\n    else:\\n        print(i)\\n        break\\n    i += 1\\n    \\n\", \"import sys\\nsys.setrecursionlimit(10**7)\\narr = [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\nsavelis = [0]*10\\ndef main():\\n   N,K = list(map(int,input().split()))\\n   Flis = list(map(int,input().split()))\\n   Tlis = [i for i in range(10)]\\n   Tlis = [i for i in Tlis if i not in Flis]\\n   str_flis = [str(i) for i in Flis]\\n   ANS = []\\n   for i in range(N*10):\\n      stri = str(i)\\n      TF = True\\n      for j in stri:\\n         if j in str_flis:\\n            TF = False\\n            break\\n      if(TF):ANS.append(i)\\n   for item in ANS:\\n      if(item>=N):\\n         print(item)\\n         break\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import itertools\\n\\nN, K = map(int, input().split()) # N\\u5186\\u306e\\u54c1\\u7269\\u3001K\\u500b\\u306e\\u5acc\\u3044\\u306a\\u6570\\u5b57\\nD = set(list(map(int, input().split()))) # \\u5acc\\u3044\\u306a\\u6570\\u5b57\\u306e\\u30ea\\u30b9\\u30c8\\nbase = set(range(10))\\n\\ntarget_num = base - D\\nketa = len(str(N))\\n\\nanswer = float('inf')\\nfor p in itertools.product(target_num, repeat=keta):\\n    temp = 0\\n    for i, num in enumerate(p):\\n        temp += num * 10**i\\n        \\n    if temp >= N:\\n        answer = min(answer, temp)\\n\\nfor p in itertools.product(target_num, repeat=keta+1):\\n    temp = 0\\n    for i, num in enumerate(p):\\n        temp += num * 10**i\\n        \\n    if temp >= N:\\n        answer = min(answer, temp)\\n\\nprint(answer)\", \"n,k = list(map(int,input().split()))\\n\\na = list(input().split())\\n\\nwhile  not set(list(str(n)[0:k])).isdisjoint(a):\\n\\tn += 1\\n\\nprint(n)\\n\", \"n, k = map(int, input().split())\\nD = list(input().split())\\n\\nans = str(n)\\nwhile not all([c not in D for c in ans]) and int(ans) >= n:\\n    ans = str(int(ans) + 1)\\nprint(ans)\", \"n, k = map(int, input().split())\\nd = list(map(int, input().split()))\\nng = [False] * 10\\nfor i in d:\\n    ng[i] = True\\ndef ok(n):\\n    nonlocal ng\\n    while n > 0:\\n        if ng[n%10]:\\n            return False\\n        n //= 10\\n    return True\\nwhile not ok(n):\\n    n += 1\\nprint(n)\", \"n, k = list(map(int, input().split()))\\nd = set(map(int, input().split()))\\n\\nwhile True:\\n    tmp_str = set(str(n))\\n    for i in tmp_str:\\n        if int(i) in d:\\n            n += 1\\n            break\\n    else:\\n        print(n)\\n        break\\n\", \"n,k=map(int,input().split())\\nd=list(map(int,input().split()))\\nx=list(range(1,100001))\\ny=[0]*100000\\nfor i in range(100000):\\n    s=str(i)\\n    S=len(s)\\n    for j in range(S):\\n        if int(s[j]) in d:\\n            y[i-1]=1\\n            break\\nfor i in range(100000):\\n    if i>=n-1:\\n        if y[i]==0:\\n            print(i+1)\\n            break\", \"n, k = map(int, input().split())\\nD = set(map(int, input().split()))\\nfrom itertools import count\\nfor ans in count(n,1):\\n    for c in str(ans):\\n        if int(c) in D:\\n            break\\n    else:\\n        print(ans)\\n        break\", \"def iparse():\\n    return list(map(int, input().split()))\\n\\nn, k = iparse()\\nd = iparse()\\n\\nfor i in range(n, 5000000):\\n    tmp = i\\n    f = True\\n    while tmp > 0:\\n        x = tmp % 10\\n        if x in d:\\n            f = False\\n            break\\n        tmp //= 10\\n    if f:\\n        print(i)\\n        return\\n\\n\", \"from sys import stdin\\ninput = stdin.readline\\n\\nN, K = map(int, input().split())\\nD = set(map(int, input().split()))\\n\\nwhile True:\\n    tmp = set(str(N))\\n    b = True\\n    for x in tmp:\\n        if int(x) in D:\\n            b = False\\n            break \\n    if b == True:\\n        break\\n    else:\\n        N += 1\\n\\nprint(N)\", \"N,K = input().split()\\nD =list(map(int,input().split()))\\nans = []\\na = int(N[0])\\nx = 0\\nb = 0\\nwhile b in D:\\n    b += 1\\nc = 2\\nwhile c in D:\\n    c += 1\\ny = 0\\nwhile a == int(N[x]) and x <= len(N)-1:\\n    while a in D and a <= 9:\\n        a += 1\\n    if  a == 10:\\n        y = x\\n        if 0 in D:\\n            a += b\\n        if 1 in D:\\n            if b != 0:\\n                a += (b-1)*10\\n            else:\\n                a += (c-1)*10\\n    ans.append(str(a))\\n    if a != int(N[x]):\\n        for i in range(len(N)-1-x):\\n            ans.append(str(b))\\n    elif x <= len(N)-2:\\n        x += 1\\n        a = int(N[x])\\n    else:\\n        a = int(N[x])-1\\nwhile y > 0:\\n    s = ans[y][0]\\n    t = ans[y][1]\\n    r = ans[y]\\n    ans[y] = t\\n    ans[y-1] = str(int(ans[y-1]) + 1)\\n    if int(ans[y-1]) in D:\\n        u = int(ans[y-1])\\n        while u in D:\\n            u += 1\\n            ans[y-1] = str(u)\\n    if ans[y-1] != \\\"10\\\":\\n        y = 0\\n    else:\\n        y -= 1\\n        ans[y] = r\\nprint(\\\"\\\".join(ans))\", \"n, k = map(int, input().split())\\nd = list(input().split())\\nnum = [str(i) for i in range(10)]\\nfor i in range(k):\\n    num.remove(d[i])\\n    \\nimport itertools, heapq\\nans = []\\nheapq.heapify(ans)\\nfor i in itertools.product(num, repeat=len(str(n))):\\n    s = int(''.join(i))\\n    if s >= n:\\n        heapq.heappush(ans, s)\\n        \\nif len(ans) == 0:\\n    for i in itertools.product(num, repeat=len(str(n)) + 1):\\n        s = int(''.join(i))\\n        if s >= n:\\n            heapq.heappush(ans, s)\\n    print(heapq.heappop(ans))\\n    \\nelse:\\n    print(heapq.heappop(ans))\", \"n, k = list(map(int, input().split()))\\nd = list(map(int, input().split()))\\ns = {'0','1','2','3','4','5','6','7','8','9'} - set(str(d))\\nans = n\\n\\nwhile (s >= set(str(n))) == False:\\n  n += 1\\n  if (s >= set(str(n))) == True:\\n    ans = n\\n    break\\n    \\nprint(ans)\\n\", \"def main():\\n    N, K = map(int, input().split())\\n    A_list = list(map(str, input().split()))\\n    use_list = [\\\"0\\\",\\\"1\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\",\\\"5\\\",\\\"6\\\",\\\"7\\\",\\\"8\\\",\\\"9\\\"]\\n    list_A = list(set(use_list) - set(A_list))\\n    #print(\\\"list_A\\\", list_A)\\n    for i in range(100000) :\\n        ans = N + i\\n        #print(\\\"ans\\\", ans)\\n        ans_str = str(ans)\\n        frag = 0\\n        for val in ans_str :\\n            #print(\\\"val\\\", val)\\n            if str(val) in list_A :\\n                pass\\n                #print(\\\"frag\\\", frag)\\n            else :\\n                frag = 1\\n                break\\n\\n        if frag == 0 :\\n            break\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"def main():\\n    N, K = list(map(int, input().split()))\\n    D = set(map(int, input().split()))\\n    numset = set(range(0,10))\\n    d = numset.difference(D)\\n\\n    for n in range(N, pow(10, 6) + 10):\\n        check = set(list(str(n)))\\n        ngflag = False\\n        for i in check:\\n            if int(i) in D:\\n                ngflag = True\\n                break\\n        if not ngflag:\\n            break\\n    print(n)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N, K = [int(x) for x in input().split()]\\nD = input().split()\\n\\nfor payment in range(N, 10*N+1):\\n    if all(char not in D for char in str(payment)):\\n        print(payment)\\n        break\", \"n, k = map(int, input().split())\\nd = list(input().split())\\nnum = [str(i) for i in range(10)]\\nfor i in range(k):\\n    num.remove(d[i])\\n    \\nimport itertools\\nans = []\\nfor i in itertools.product(num, repeat=len(str(n))):\\n    s = int(''.join(i))\\n    if s >= n:\\n        ans.append(s)\\n        \\nif len(ans) == 0:\\n    for i in itertools.product(num, repeat=len(str(n)) + 1):\\n        s = int(''.join(i))\\n        if s >= n:\\n            ans.append(s)\\n    print(min(ans))\\n    \\nelse:\\n  print(min(ans))\", \"N, K = map(int, input().split())\\nS = set(input().split())\\nwhile True:\\n    L = list(str(N))\\n    for i in L:\\n        if i in S:\\n            break\\n    else:\\n        break\\n    N += 1\\nprint(N)\", \"n, k = map(int, input().split())\\nd = list(map(int, input().split()))\\n\\nwhile True:\\n    for i in str(n):\\n        if int(i) in d:\\n            n += 1\\n            break\\n    \\n    else:\\n        print(n)\\n        break\", \"N, K, *D = list(map(int, open(0).read().split()))\\nD = set(str(d) for d in D)\\nfor i in range(N, 100_000):\\n    if set(str(i)) & D:\\n        continue\\n    print(i)\\n    break\\n\", \"n,t = [int(x) for x in input().split()]\\nd = [int(x) for x in input().split()]\\n\\ndef check(x) -> bool:\\n    while x>0:\\n        a = x%10\\n        if a in d:\\n            return False\\n        x//=10\\n    return True\\n\\nwhile check(n)==False:\\n    n+=1\\nprint(n)\", \"n,k = map(int,input().split())\\nd=set(input().split())\\nwhile True:\\n    if len(set(str(n))&d)!=0:\\n        n+=1\\n    else:\\n        break\\nprint(n)\", \"def minN(N:int, usable:list, restrict=True):\\n    usable.sort()\\n    keta = False\\n    if restrict:\\n        for i in usable:\\n            if i >= N:\\n                return str(i)\\n        # \\u6841\\u304c\\u5897\\u3048\\u308b\\n        return '1'+str(usable[0])\\n    else:\\n        return str(usable[0])\\n\\ndef rote(N:list, D:set, d:set):\\n    ans = []\\n    flag = True\\n    lenNstr = len(N)\\n    for i, n in enumerate(N):\\n        n = int(n)\\n        keta = 10**(len(N) - i - 1)\\n        if flag:\\n            if n in D:\\n                ans.append(int(minN(n, d)) * keta)\\n                flag = False\\n            else:\\n                ans.append(keta * n)\\n        else:\\n            ans.append(keta * min(d))\\n    return sum(ans)\\n\\ndef main():\\n    N, K = list(map(int, input().split()))\\n    D = set(map(int, input().split()))\\n    numset = set(range(0,10))\\n    d = list(numset.difference(D))\\n    d.sort()\\n    for _ in range(10):\\n        Nstr = list(str(N))\\n        ans = rote(Nstr, D, d)\\n        N = ans    \\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N,K = list(map(int,input().split()))\\n\\nD = list(map(int,input().split()))\\n\\ndef ok(x):\\n    while x:\\n        if x % 10 in D:\\n            return False\\n        x //= 10\\n    return True\\n\\nfor i in range(N,100000):\\n    if ok(i):\\n        print(i)\\n        return\\n\", \"N,K=map(int,input().split())\\nD=list(map(int,input().split()))\\n\\nwhile True:\\n  S=str(N)\\n  flag=True\\n  for x in S:\\n    if int(x) in D:\\n      flag=False\\n  if flag==True:\\n    break;\\n  N+=1\\nprint(N)\", \"n,k=map(int,input().split());a=set(input().split())\\nwhile True:\\n  if not set(str(n))&a: print(n);break\\n  n+=1\", \"N, K = list(map(int, input().split()))\\nkirai = list(map(int, input().split()))\\nwhile True:\\n  bara = [int(x) for x in list(str(N))]\\n  diff = set(kirai) & set(bara)\\n  if diff == set():\\n    print(N)\\n    break\\n  else:\\n    N = N + 1\\n\"]",
        "difficulty": "introductory",
        "input": "9999 1\n0\n",
        "output": "9999\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc042/tasks/arc058_a"
    },
    {
        "id": 448,
        "task_id": 4852,
        "test_case_id": 1,
        "question": "In many programming languages, the “plus” symbol (‘+’) has at least two standard meanings:\n - arithmetic addition\n - string concatenation\n\nInspired by the old adage, “Variety is the spice of life,” the designers of the Doubleplusgood (DPG) language (launched to great fanfare in 1984 by the Ministry of Truth Tables) decided that, in certain contexts, the meaning of the plus symbol would be decided dynamically and randomly at run time. In particular, for expressions consisting of alternating integers and plus symbols, every time the same program is executed, the meaning of each plus symbol is randomly chosen to be either addition or string concatenation. It follows that a single expression of this form can potentially evaluate to many different integers. For example, consider\\[ 1+9+8+4 \\]\n\nFor clarity, we’ll use $\\boxplus $ to denote a plus symbol that the DPG runtime environment decides to interpret as string concatenation, which, it is important to note, has higher precedence than addition in DPG. Then $1+9+8+4$ can evaluate to $7$ distinct values:\\begin{align*} 1\\boxplus 9 \\boxplus 8 \\boxplus 4 & =1984\\\\ 1 \\boxplus 9 \\boxplus 8 + 4 & =198 + 4 =202\\\\ 1 \\boxplus 9 + 8 \\boxplus 4 & =19 + 84 =103\\\\ 1 \\boxplus 9 + 8 + 4 & =19 + 8 + 4 =31\\\\ 1 + 9 \\boxplus 8 \\boxplus 4 & =1 + 984 =985\\\\ 1 + 9 \\boxplus 8 + 4 & =1 + 98 + 4 =103\\\\ 1 + 9 + 8 \\boxplus 4 & =1 + 9 + 84 =94\\\\ 1 + 9 + 8 + 4 & =22 \\end{align*}\n\n(Note that $103$ was formed in two different ways.) Given a sequence of alternating integers and plus symbols, your task is to determine the number of distinct integers to which the expression can evaluate.\n\n-----Input-----\nThe input is a single line consisting of alternating positive integers and plus symbols. The line begins and ends with a positive integer, and is guaranteed to contain at least one plus symbol. The maximum number of digits in the input is $18$.\n\n-----Output-----\nOutput the number of distinct integers to which the input expression can evaluate in DPG.\n\n-----Examples-----\nSample Input 1:\n1+9+8+4\nSample Output 1:\n7\n\nSample Input 2:\n1+2+3+4+5+6+7+8+9\nSample Output 2:\n188",
        "solutions": "",
        "difficulty": "introductory",
        "input": "1+9+8+4\n",
        "output": "7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/doubleplusgood"
    },
    {
        "id": 449,
        "task_id": 4852,
        "test_case_id": 2,
        "question": "In many programming languages, the “plus” symbol (‘+’) has at least two standard meanings:\n - arithmetic addition\n - string concatenation\n\nInspired by the old adage, “Variety is the spice of life,” the designers of the Doubleplusgood (DPG) language (launched to great fanfare in 1984 by the Ministry of Truth Tables) decided that, in certain contexts, the meaning of the plus symbol would be decided dynamically and randomly at run time. In particular, for expressions consisting of alternating integers and plus symbols, every time the same program is executed, the meaning of each plus symbol is randomly chosen to be either addition or string concatenation. It follows that a single expression of this form can potentially evaluate to many different integers. For example, consider\\[ 1+9+8+4 \\]\n\nFor clarity, we’ll use $\\boxplus $ to denote a plus symbol that the DPG runtime environment decides to interpret as string concatenation, which, it is important to note, has higher precedence than addition in DPG. Then $1+9+8+4$ can evaluate to $7$ distinct values:\\begin{align*} 1\\boxplus 9 \\boxplus 8 \\boxplus 4 & =1984\\\\ 1 \\boxplus 9 \\boxplus 8 + 4 & =198 + 4 =202\\\\ 1 \\boxplus 9 + 8 \\boxplus 4 & =19 + 84 =103\\\\ 1 \\boxplus 9 + 8 + 4 & =19 + 8 + 4 =31\\\\ 1 + 9 \\boxplus 8 \\boxplus 4 & =1 + 984 =985\\\\ 1 + 9 \\boxplus 8 + 4 & =1 + 98 + 4 =103\\\\ 1 + 9 + 8 \\boxplus 4 & =1 + 9 + 84 =94\\\\ 1 + 9 + 8 + 4 & =22 \\end{align*}\n\n(Note that $103$ was formed in two different ways.) Given a sequence of alternating integers and plus symbols, your task is to determine the number of distinct integers to which the expression can evaluate.\n\n-----Input-----\nThe input is a single line consisting of alternating positive integers and plus symbols. The line begins and ends with a positive integer, and is guaranteed to contain at least one plus symbol. The maximum number of digits in the input is $18$.\n\n-----Output-----\nOutput the number of distinct integers to which the input expression can evaluate in DPG.\n\n-----Examples-----\nSample Input 1:\n1+9+8+4\nSample Output 1:\n7\n\nSample Input 2:\n1+2+3+4+5+6+7+8+9\nSample Output 2:\n188",
        "solutions": "",
        "difficulty": "introductory",
        "input": "1+2+3+4+5+6+7+8+9\n",
        "output": "188\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/doubleplusgood"
    },
    {
        "id": 450,
        "task_id": 4852,
        "test_case_id": 3,
        "question": "In many programming languages, the “plus” symbol (‘+’) has at least two standard meanings:\n - arithmetic addition\n - string concatenation\n\nInspired by the old adage, “Variety is the spice of life,” the designers of the Doubleplusgood (DPG) language (launched to great fanfare in 1984 by the Ministry of Truth Tables) decided that, in certain contexts, the meaning of the plus symbol would be decided dynamically and randomly at run time. In particular, for expressions consisting of alternating integers and plus symbols, every time the same program is executed, the meaning of each plus symbol is randomly chosen to be either addition or string concatenation. It follows that a single expression of this form can potentially evaluate to many different integers. For example, consider\\[ 1+9+8+4 \\]\n\nFor clarity, we’ll use $\\boxplus $ to denote a plus symbol that the DPG runtime environment decides to interpret as string concatenation, which, it is important to note, has higher precedence than addition in DPG. Then $1+9+8+4$ can evaluate to $7$ distinct values:\\begin{align*} 1\\boxplus 9 \\boxplus 8 \\boxplus 4 & =1984\\\\ 1 \\boxplus 9 \\boxplus 8 + 4 & =198 + 4 =202\\\\ 1 \\boxplus 9 + 8 \\boxplus 4 & =19 + 84 =103\\\\ 1 \\boxplus 9 + 8 + 4 & =19 + 8 + 4 =31\\\\ 1 + 9 \\boxplus 8 \\boxplus 4 & =1 + 984 =985\\\\ 1 + 9 \\boxplus 8 + 4 & =1 + 98 + 4 =103\\\\ 1 + 9 + 8 \\boxplus 4 & =1 + 9 + 84 =94\\\\ 1 + 9 + 8 + 4 & =22 \\end{align*}\n\n(Note that $103$ was formed in two different ways.) Given a sequence of alternating integers and plus symbols, your task is to determine the number of distinct integers to which the expression can evaluate.\n\n-----Input-----\nThe input is a single line consisting of alternating positive integers and plus symbols. The line begins and ends with a positive integer, and is guaranteed to contain at least one plus symbol. The maximum number of digits in the input is $18$.\n\n-----Output-----\nOutput the number of distinct integers to which the input expression can evaluate in DPG.\n\n-----Examples-----\nSample Input 1:\n1+9+8+4\nSample Output 1:\n7\n\nSample Input 2:\n1+2+3+4+5+6+7+8+9\nSample Output 2:\n188",
        "solutions": "",
        "difficulty": "introductory",
        "input": "42+42+8+8+8+1+10+100\n",
        "output": "100\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/doubleplusgood"
    },
    {
        "id": 451,
        "task_id": 4992,
        "test_case_id": 1,
        "question": "Linda is giving an exam. When the exam is over, Linda will redistribute the exams among the students for a peer review, so they may grade each other’s answers and assign preliminary scores.\n\nThe students are split up in several rooms of varying sizes. Linda has devised the following scheme for redistributing the exams:\n - Linda visits the first room, picks up all exams written there, and places them in a pile.\n - In each subsequent room Linda takes exams from the top of her pile and randomly distributes them to the students in the room. She then picks up all exams written in that room and adds them to the bottom of her pile.\n - After having visited each room exactly once, Linda returns to the first room, and distributes the remaining exams from her pile there.\n\nNaturally, it is imperative that no student receives their own exam to review, and that Linda does not run out of exams in her pile while doing the redistribution (i.e., that when entering a room after the first one, Linda’s pile contains at least as many exams as there are students in the room). Whether or not this is the case depends on the order in which the rooms are visited. We say that an ordering of the rooms is safe if Linda will not run out of exams in her pile when visiting rooms in that order, and that there is no chance that any student receives their own exam to review.\n\nCan you find a safe order in which to visit the rooms (or determine that no safe order exists)?\n\n-----Input-----\nThe input consists of:\n - one line containing an integer $n$ ($2 \\le n \\le 30$), the number of rooms.\n - one line containing $n$ integers $s_1, \\ldots , s_ n$ ($1 \\le s_ i \\le 100$ for each $i$), where $s_ i$ is the number of students in room $i$.\n\n-----Output-----\nIf it is impossible to redistribute the exams safely, output “impossible”. Otherwise, output a safe order in which to visit the rooms. If there are multiple safe orders, you may give any of them.\n\n-----Examples-----\nSample Input:\n4\n2 3 3 1\nSample Output:\n2 3 4 1",
        "solutions": "",
        "difficulty": "introductory",
        "input": "4\n2 3 3 1\n",
        "output": "2 3 4 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/redistribution"
    },
    {
        "id": 452,
        "task_id": 2887,
        "test_case_id": 1,
        "question": "Ash like soup very much! So, on the Raksha Bandhan day, his sister gave him a soup maker as a gift. Soup maker in the ith hour will make volume  Vi liters of soup and pours it in a bowl.\nEach hour, the Volume of soup in every bowl is reduced due to evaporation. More precisely, when the temperature on a given hour is Ti, the Volume of soup in every bowl will reduce its volume by Ti. If this would reduce the volume of soup to or below zero, Bowl gets empty. All bowls are independent of each other.\nNote that the Volume of soup in every bowl made in an hour i already lose part of its volume at the same hour. In an extreme case, this may mean that there is no soup left in the bowl at the end of a particular hour.\nYou are given the initial volumes of soup in bowls and the temperature on each hour. Determine the total volume of soup evaporated in each hour.\nInput\nThe first line contains a single integer N (1 ≤ N ≤ 10^5) — the number of hours.\nThe second line contains N integers V 1, V 2, …, V N (0 ≤ V i ≤ 10^9), where V i is the initial volume of soup made in an hour i.\nThe third line contains N integers T 1, T 2, …, T N (0 ≤ T i ≤ 10^9), where T i is the temperature in an hour i.\nOutput\nOutput a single line with N integers, where the i-th integer represents the total volume of soup melted in an hour i.\nExamples\nInput\n3\n10 10 5\n5 7 2\nOutput\n5 12 4\nInput\n5\n30 25 20 15 10\n9 10 12 4 13\nOutput\n9 20 35 11 25\nNote\nIn the first sample, In the first hour, 10 liters of soup is prepared, which evaporates to the size of 5 at the same hour. In the second hour, another 10 liters of soup is made. Since it is a bit warmer than the hour before, the first bowl gets empty while the second bowl shrinks to 3. At the end of the second hour, only one bowl with 3 liters soup is left. In the third hour, another bowl with less volume of soup is made, but as the temperature dropped too, both bowls survive till the end of the hour.",
        "solutions": "[\"def solve():\\r\\n\\tn=int(input())\\r\\n\\tl1=list(map(int,input().split()))\\r\\n\\tl2=list(map(int,input().split()))\\r\\n\\tans=[]\\r\\n\\tfor i in range (n):\\r\\n\\t\\tc=0\\r\\n\\t\\tfor j in range (i+1):\\r\\n\\t\\t\\tif l1[j]<=l2[i]:\\r\\n\\t\\t\\t\\tc+=l1[j]\\r\\n\\t\\t\\t\\tl1[j]=0\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tl1[j]-=l2[i]\\r\\n\\t\\t\\t\\tc+=l2[i]\\r\\n\\t\\tans.append(c)\\r\\n\\tprint(*ans)\\r\\nsolve()\", \"# cook your dish here\\nn=int(input())\\nv=[int(x) for x in input().split()]\\nt=[int(x) for x in input().split()]\\na=[]\\nfor i in range(n):\\n    a.append(v[i])\\n    c=0\\n    for j in range(len(a)):\\n        k=a[j]-t[i]\\n        if k>=0:\\n            c+=t[i]\\n            a[j]=k\\n        else: \\n            c+=a[j]\\n            a[j]=0\\n    print(c,end=\\\" \\\")        \\n    \\n    \", \"# cook your dish here\\nx=int(input())\\n\\nsop=[int(i) for i in input().split()]\\ntem=[int(j) for j in input().split()]\\nfor i in range(x):\\n    sm=0\\n    for j in range(i+1):\\n        if (sop[j] >= tem[i]):\\n            sm+=tem[i]\\n            sop[j]-=tem[i]\\n        else:\\n            sm+=sop[j]\\n            sop[j]=0\\n    print(sm,end=\\\" \\\")\", \"# cook your dish here\\nt=int(input())\\ns=list(map(int,input().split()))\\ne=list(map(int,input().split()))\\nif t==0 or t==1:\\n    print(0)\\nelse:\\n    for i in range(t):\\n        c=0\\n        p=s[0:i+1]\\n        for j in range(len(p)):\\n            if p[j]>=e[i]:\\n                c+=e[i]\\n                s[j]-=e[i]\\n            else:\\n                c+=p[j]\\n                s[j]=0\\n        print(c,end=\\\" \\\")\", \"# cook your dish here\\nn=int(input())\\ns=[int(j) for j in input().split()]\\nt=[int(j) for j in input().split()]\\nl=[]\\nfor i in range(n):\\n  te=t[i]\\n  l.append(s[i])\\n  l1=[]\\n  ans=0\\n  for i in l:\\n      if(i>te):\\n          ans+=te\\n          l1.append(i-te)\\n      else:\\n          ans+=i\\n  l=l1\\n  print(ans,end=\\\" \\\")  \", \"n=int(input())\\r\\nvol = list(map(int,input().split()))\\r\\ntemp = list(map(int,input().split()))\\r\\n\\r\\ni=0\\r\\ncount=0\\r\\n\\r\\nwhile i < len(temp):\\r\\n    j = i\\r\\n    count = 0\\r\\n    while j>=0 and i<len(temp):\\r\\n        \\r\\n        if vol[j] < temp[i] and vol[j] != 0:\\r\\n            count += vol[j]\\r\\n            vol[j] = 0\\r\\n            #print(count,end= ' ')\\r\\n            \\r\\n        elif vol[j] >= temp[i] and vol[j] != 0:\\r\\n            vol[j] = vol[j] - temp[i]\\r\\n            count += temp[i]\\r\\n        j -= 1\\r\\n    print(count, end=\\\" \\\")\\r\\n    \\r\\n    i+=1\\r\\n\\r\\n\\r\\n\\r\\n\", \"# cook your dish here\\nn=int(input())\\nv=[int(x) for x in input().split()]\\nt=[int(x) for x in input().split()]\\na=[]\\nfor i in range(n):\\n    a.append(v[i])\\n    c=0\\n    for j in range(len(a)):\\n        k=a[j]-t[i]\\n        if k>=0:\\n            c+=t[i]\\n            a[j]=k\\n        else: \\n            c+=a[j]\\n            a[j]=0\\n    print(c,end=\\\" \\\")        \\n    \\n    \", \"n=int(input())\\nv=list(map(int,input().split()))\\nt=list(map(int,input().split()))\\nfor i in range(n):\\n    ans=0\\n    for j in range(0,i+1):\\n        if v[j]<=0:\\n            continue\\n        if t[i]<=v[j]:\\n            ans+=t[i]\\n            v[j]=v[j]-t[i]\\n        else:\\n            ans+=v[j]\\n            v[j]=0\\n    print(ans,end=' ')\\n    \\n\", \"# cook your dish here\\nimport sys\\n\\nlist_of_lists = []\\n\\nfor line in sys.stdin:\\n    new_list = [int(elem) for elem in line.split()]\\n    list_of_lists.append(new_list)\\n    \\n\\nvolume = list_of_lists[1]\\ntemperature = list_of_lists[2]\\n\\nafter_volume = []\\ntemp_deduction = 0\\ntotal_reduction = []\\n\\nfor i in range(list_of_lists[0][0]):\\n    for x in range(len(after_volume)):\\n        if (after_volume[x] - temperature[i] < 0):\\n            temp_deduction += after_volume[x]\\n            after_volume[x] = 0\\n        else:\\n            temp_deduction += temperature[i]\\n            after_volume[x] = after_volume[x] - temperature[i]\\n    if (volume[i] - temperature[i] < 0):\\n        temp_deduction += volume[i]\\n        after_volume[x] = 0\\n    else:\\n        # print(i)\\n        temp_deduction += temperature[i]\\n        after_volume.append(volume[i] - temperature[i])\\n        # print(after_volume)\\n       \\n    total_reduction.append(temp_deduction)\\n    temp_deduction = 0\\n  \\n    # print(after_volume)\\nprint(*total_reduction)\", \"n=int(input())\\r\\nv=list(map(int,input().split()))\\r\\nt=list(map(int,input().split()))\\r\\nfor i in range(len(t)):\\r\\n    vap=0\\r\\n    for j in range(0,i+1):\\r\\n        if v[j]<=0:\\r\\n            continue\\r\\n        if v[j]-t[i]<=0:\\r\\n            vap+=v[j]\\r\\n            v[j]=0\\r\\n        else:\\r\\n            vap+=t[i]\\r\\n            v[j]-=t[i]\\r\\n    print(vap,end=\\\" \\\")\\r\\n            \\r\\n        \\r\\n        \\r\\n        \\r\\n\", \"# cook your dish here\\nt=1\\nfor t_cases in range(t):\\n    n=int(input())\\n    v=list(map(int,input().split()))\\n    t=list(map(int,input().split()))\\n    for i in range(0,n):\\n        temp=0\\n        for j in range(0,i+1):\\n            if(v[j]>=t[i]):\\n                temp+=t[i]\\n            else:\\n                temp+=v[j]\\n            v[j]=max(0,v[j]-t[i])\\n        print(temp,end=' ')\", \"n=int(input())\\r\\nB=[int(i) for i in input().split()]\\r\\nt=[int(i) for i in input().split()]\\r\\no=[]\\r\\nfor i in range(n):\\r\\n     x=t[i]\\r\\n     s=0\\r\\n     for j in range(i+1):\\r\\n          if(B[j]>x):\\r\\n               B[j]=B[j]-x\\r\\n               s+=x\\r\\n          else:\\r\\n               s+=B[j]\\r\\n               B[j]=0\\r\\n     o.append(s)\\r\\nfor i in o:\\r\\n     print(i,end=\\\" \\\")\\r\\n               \\r\\n          \\r\\n          \\r\\n          \\r\\n     \\r\\n\\r\\n\", \"# cook your dish here\\nn=int(input())\\ns=[int(j) for j in input().split()]\\nt=[int(j) for j in input().split()]\\nl=[]\\nfor i in range(n):\\n  te=t[i]\\n  l.append(s[i])\\n  l1=[]\\n  ans=0\\n  for i in l:\\n      if(i>te):\\n          ans+=te\\n          l1.append(i-te)\\n      else:\\n          ans+=i\\n  l=l1\\n  print(ans,end=\\\" \\\")  \", \"# cook your dish here\\nn=int(input())\\nv=list(map(int,input().split()))\\nt=list(map(int,input().split()))\\nm=[]\\nfor i in range(n):\\n    s=0\\n    for j in range(i+1):\\n        e=v[j]\\n        v[j]=v[j]-t[i]\\n        if(v[j]<0):\\n            v[j]=0\\n        loss=e-v[j]\\n        s=s+loss\\n    m.append(s)\\nprint(*m)\\n        \\n            \\n\", \"n=int(input())\\nv=list(map(int,input().split()))\\nt=list(map(int,input().split()))\\nfor i in range(n):\\n    ans=0\\n    for j in range(0,i+1):\\n        if t[i]<=v[j]:\\n            ans+=t[i]\\n            v[j]=v[j]-t[i]\\n        else:\\n            ans+=v[j]\\n            v[j]=0\\n    print(ans,end=' ')\\n    \\n\", \"def __starting_point():\\r\\n\\tn = int(input())\\r\\n\\tv = list(map(int, input().split()))\\r\\n\\tt = list(map(int, input().split()))\\r\\n\\tl = []\\r\\n\\tans = []\\r\\n\\tfor i in range (n):\\r\\n\\t\\tcancel = 0\\r\\n\\t\\tif i == 0:\\r\\n\\t\\t\\tif v[i] <= t[i]:\\r\\n\\t\\t\\t\\tcancel+=v[i]\\r\\n\\t\\t\\t\\tv[i]-=v[i]\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tcancel +=t[i]\\r\\n\\t\\t\\t\\tv[i]-=t[i]\\r\\n\\t\\t\\tl.append(v[i])\\r\\n\\t\\t\\tans.append(cancel)\\r\\n\\t\\telse:\\r\\n\\t\\t\\tl.append(v[i])\\r\\n\\t\\t\\tj = 0\\r\\n\\t\\t\\twhile j < len(l):\\r\\n\\t\\t\\t\\tif l[j] == 0:\\r\\n\\t\\t\\t\\t\\tl.pop(j)\\r\\n\\t\\t\\t\\t\\tj-=1\\r\\n\\t\\t\\t\\telif l[j] <= t[i]:\\r\\n\\t\\t\\t\\t\\tcancel += l[j]\\r\\n\\t\\t\\t\\t\\tl[j]-=l[j]\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\tcancel+=t[i]\\r\\n\\t\\t\\t\\t\\tl[j]-=t[i]\\r\\n\\t\\t\\t\\tj+=1\\r\\n\\t\\t\\tans.append(cancel)\\r\\n\\tprint(*ans)\\n__starting_point()\", \"# cook your dish here\\r\\nimport sys\\r\\n\\r\\nlist_of_lists = []\\r\\n\\r\\nfor line in sys.stdin:\\r\\n    new_list = [int(elem) for elem in line.split()]\\r\\n    list_of_lists.append(new_list)\\r\\n    \\r\\n\\r\\nvolume = list_of_lists[1]\\r\\ntemperature = list_of_lists[2]\\r\\n\\r\\nafter_volume = []\\r\\ntemp_deduction = 0\\r\\ntotal_reduction = []\\r\\n\\r\\nfor i in range(list_of_lists[0][0]):\\r\\n    for x in range(len(after_volume)):\\r\\n        if (after_volume[x] - temperature[i] < 0):\\r\\n            temp_deduction += after_volume[x]\\r\\n            after_volume[x] = 0\\r\\n        else:\\r\\n            temp_deduction += temperature[i]\\r\\n            after_volume[x] = after_volume[x] - temperature[i]\\r\\n    if (volume[i] - temperature[i] < 0):\\r\\n        temp_deduction += volume[i]\\r\\n        after_volume[x] = 0\\r\\n    else:\\r\\n        # print(i)\\r\\n        temp_deduction += temperature[i]\\r\\n        after_volume.append(volume[i] - temperature[i])\\r\\n        # print(after_volume)\\r\\n       \\r\\n    total_reduction.append(temp_deduction)\\r\\n    temp_deduction = 0\\r\\n  \\r\\n    # print(after_volume)\\r\\nprint(*total_reduction)\\r\\n        \\r\\n    \\r\\n    \", \"# cook your dish here\\nt=int(input())\\ns=list(map(int,input().split()))\\ne=list(map(int,input().split()))\\nif t==0 or t==1:\\n    print(0)\\nelse:\\n    for i in range(t):\\n        c=0\\n        p=s[0:i+1]\\n        for j in range(len(p)):\\n            if p[j]>=e[i]:\\n                c+=e[i]\\n                s[j]-=e[i]\\n            else:\\n                c+=p[j]\\n                s[j]=0\\n        print(c,end=\\\" \\\")\", \"'''\\r\\nName: Devansh\\r\\nUsername: singhdevansh\\r\\nGithub: https://github.com/Devansh3712\\r\\n'''\\r\\n\\r\\nimport os\\r\\nimport sys\\r\\nimport math\\r\\nfrom itertools import *\\r\\nfrom io import BytesIO, IOBase\\r\\nfrom collections import *\\r\\n\\r\\n#<fast I/O>\\r\\nBUFSIZE = 8192\\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\\n#</fast I/O>\\r\\n\\r\\n#<template>\\r\\nmod=(10**9)+7\\r\\npi=3.14159265358979323846264338327950\\r\\n\\r\\ndef i1():\\t#int(input())\\r\\n\\treturn int(sys.stdin.readline())\\r\\n\\r\\ndef sf():\\t#input()\\r\\n\\treturn sys.stdin.readline()\\r\\n\\r\\ndef mi():\\t#map(int(input()))\\r\\n\\treturn map(int,sys.stdin.readline().split())\\r\\n\\r\\ndef arr():\\t#list(map(int,input().split()))\\r\\n\\treturn list(map(int,sys.stdin.readline().split()))\\r\\n\\r\\ndef pf(ans): #print(x)\\r\\n\\treturn sys.stdout.write(str(ans)+\\\"\\\\n\\\")\\r\\n\\r\\ndef gcd(a,b):\\r\\n\\tif a==0:\\r\\n\\t\\treturn b\\r\\n\\telif b==0:\\r\\n\\t\\treturn a\\r\\n\\tif a>b:\\r\\n\\t\\treturn gcd(a%b,b)\\r\\n\\telse:\\r\\n\\t\\treturn gcd(a,b%a)\\r\\n\\r\\ndef lcm(a,b):\\r\\n\\treturn (a*b)//gcd(a,b)\\r\\n\\r\\ndef LogN(a,b):\\r\\n\\treturn math.log(a)/math.log(b)\\r\\n\\r\\ndef fpow(a,b):\\r\\n\\tres=1\\r\\n\\twhile (b>0):\\r\\n\\t\\tif b&1:\\r\\n\\t\\t\\tres=res*a \\r\\n\\t\\ta=a*a\\r\\n\\t\\tb>>=1\\r\\n\\treturn res\\r\\n\\r\\ndef sieve(n):\\r\\n    m=(n-1)//2\\r\\n    b=[True]*m\\r\\n    i,p,ps = 0,3,[2]\\r\\n    while p*p < n:\\r\\n        if b[i]:\\r\\n            ps.append(p)\\r\\n            j = 2*i*i + 6*i + 3\\r\\n            while j < m:\\r\\n                b[j] = False\\r\\n                j = j + 2*i + 3\\r\\n        i+=1; p+=2\\r\\n    while i < m:\\r\\n        if b[i]:\\r\\n            ps.append(p)\\r\\n        i+=1; p+=2\\r\\n    return ps\\r\\n#</template>\\r\\n\\r\\n#<solve>\\r\\ndef solve():\\r\\n\\tn=i1()\\r\\n\\tl1=arr()\\r\\n\\tl2=arr()\\r\\n\\tans=[]\\r\\n\\tfor i in range (n):\\r\\n\\t\\tc=0\\r\\n\\t\\tfor j in range (i+1):\\r\\n\\t\\t\\tif l1[j]<=l2[i]:\\r\\n\\t\\t\\t\\tc+=l1[j]\\r\\n\\t\\t\\t\\tl1[j]=0\\r\\n\\t\\t\\telse:\\r\\n\\t\\t\\t\\tl1[j]-=l2[i]\\r\\n\\t\\t\\t\\tc+=l2[i]\\r\\n\\t\\tans.append(c)\\r\\n\\tprint(*ans)\\r\\nsolve()\\r\\n#</solve>\\r\\n\\r\\n#<solution>\\r\\n# tc=i1()\\r\\n# for t in range (tc):\\r\\n# \\tsolve()\\r\\n#<solution>\", \"t=int(input())\\nlst=list(map(int,input().split()))\\nlst1=list(map(int,input().split()))\\nfor i in range(len(lst)):\\n    q=0\\n    for j in range(i+1):\\n        if lst[j]<=lst1[i]:\\n            q+=lst[j]\\n            lst[j]=0\\n        else:\\n            q+=lst1[i]\\n            lst[j]-=lst1[i]\\n    print(q,end=\\\" \\\")\", \"# cook your dish here\\nn=int(input())\\nv=list(map(int,input().split()))\\nt=list(map(int,input().split()))\\nm=[]\\nfor i in range(n):\\n    s=0\\n    for j in range(i+1):\\n        e=v[j]\\n        v[j]=v[j]-t[i]\\n        if(v[j]<0):\\n            v[j]=0\\n        loss=e-v[j]\\n        s=s+loss\\n    m.append(s)\\nprint(*m)\\n        \\n            \\n\", \"# cook your dish here\\nn = int(input())\\nsoup = list(map(int , input().split()))\\nevap = list(map(int , input().split()))\\nfor i in range(n) :\\n    summ= 0\\n    for j in range(i+1) :\\n        if(soup[j]>=evap[i]) :\\n            summ+=evap[i]\\n            soup[j]-=evap[i]\\n        else :\\n            summ +=soup[j]\\n            soup[j] = 0\\n    print(summ , end =\\\" \\\")\", \"n = int(input())\\n \\nimport heapq as hq\\n \\nheap = []\\n\\ntemp = 0\\n \\nans = [-1 for _ in range(n)]\\n \\nV = [int(x) for x in input().split()]\\nT = [int(x) for x in input().split()]\\n \\n\\nfor i in range(n):\\n    \\n \\n    prevtemp = temp\\n    temp += T[i]\\n \\n    hq.heappush(heap, V[i] + prevtemp)\\n \\n \\n    curr = 0\\n    while len(heap) and heap[0] <= temp:\\n        m = hq.heappop(heap)\\n        curr += m - prevtemp\\n    curr += (len(heap) * T[i])\\n    ans[i] = curr\\n \\nprint(' '.join([str(x) for x in ans]))\", \"# cook your dish here\\nimport sys\\n\\nlist_of_lists = []\\n\\nfor line in sys.stdin:\\n    new_list = [int(elem) for elem in line.split()]\\n    list_of_lists.append(new_list)\\n    \\n\\nvolume = list_of_lists[1]\\ntemperature = list_of_lists[2]\\n\\nafter_volume = []\\ntemp_deduction = 0\\ntotal_reduction = []\\n\\nfor i in range(list_of_lists[0][0]):\\n    for x in range(len(after_volume)):\\n        if (after_volume[x] - temperature[i] < 0):\\n            temp_deduction += after_volume[x]\\n            after_volume[x] = 0\\n        else:\\n            temp_deduction += temperature[i]\\n            after_volume[x] = after_volume[x] - temperature[i]\\n    if (volume[i] - temperature[i] < 0):\\n        temp_deduction += volume[i]\\n        after_volume[x] = 0\\n    else:\\n        # print(i)\\n        temp_deduction += temperature[i]\\n        after_volume.append(volume[i] - temperature[i])\\n        # print(after_volume)\\n       \\n    total_reduction.append(temp_deduction)\\n    temp_deduction = 0\\n  \\n    # print(after_volume)\\nprint(*total_reduction)\\n        \\n    \\n    \", \"n=int(input())\\nv=list(map(int,input().split()))\\nt=list(map(int,input().split()))\\nfor i in range(n):\\n    ans=0\\n    for j in range(0,i+1):\\n        if t[i]<=v[j]:\\n            ans+=t[i]\\n            v[j]=v[j]-t[i]\\n        else:\\n            ans+=v[j]\\n            v[j]=0\\n    print(ans,end=' ')\\n    \\n\"]",
        "difficulty": "interview",
        "input": [
            "s",
            "Input",
            "3",
            "10 10 5",
            "5 7 2"
        ],
        "output": [
            "5 12 4"
        ],
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://www.codechef.com/GACE2020/problems/CCH1"
    },
    {
        "id": 453,
        "task_id": 2570,
        "test_case_id": 1,
        "question": "You are given two arrays $a$ and $b$, each consisting of $n$ positive integers, and an integer $x$. Please determine if one can rearrange the elements of $b$ so that $a_i + b_i \\leq x$ holds for each $i$ ($1 \\le i \\le n$).\n\n\n-----Input-----\n\nThe first line of input contains one integer $t$ ($1 \\leq t \\leq 100$) — the number of test cases. $t$ blocks follow, each describing an individual test case.\n\nThe first line of each test case contains two integers $n$ and $x$ ($1 \\leq n \\leq 50$; $1 \\leq x \\leq 1000$) — the length of arrays $a$ and $b$, and the parameter $x$, described in the problem statement.\n\nThe second line of each test case contains $n$ integers $a_1, a_2, \\ldots, a_n$ ($1 \\leq a_1 \\le a_2 \\le \\dots \\le a_n \\leq x$) — the elements of array $a$ in non-descending order.\n\nThe third line of each test case contains $n$ integers $b_1, b_2, \\ldots, b_n$ ($1 \\leq b_1 \\le b_2 \\le \\dots \\le b_n \\leq x$) — the elements of array $b$ in non-descending order.\n\nTest cases are separated by a blank line.\n\n\n-----Output-----\n\nFor each test case print Yes if one can rearrange the corresponding array $b$ so that $a_i + b_i \\leq x$ holds for each $i$ ($1 \\le i \\le n$) or No otherwise.\n\nEach character can be printed in any case.\n\n\n-----Example-----\nInput\n4\n3 4\n1 2 3\n1 1 2\n\n2 6\n1 4\n2 5\n\n4 4\n1 2 3 4\n1 2 3 4\n\n1 5\n5\n5\n\nOutput\nYes\nYes\nNo\nNo\n\n\n\n-----Note-----\n\nIn the first test case, one can rearrange $b$ so it'll look like $[1, 2, 1]$. In this case, $1 + 1 \\leq 4$; $2 + 2 \\leq 4$; $3 + 1 \\leq 4$.\n\nIn the second test case, one can set $b$ to $[5, 2]$, then $1 + 5 \\leq 6$; $4 + 2 \\leq 6$.\n\nIn the third test case, no matter how one shuffles array $b$, $a_4 + b_4 = 4 + b_4 > 4$.\n\nIn the fourth test case, there is only one rearrangement of array $b$ and it doesn't satisfy the condition since $5 + 5 > 5$.",
        "solutions": "[\"def testcase():\\n\\n    n, x = list(map(int, input().split()))\\n    arr = list(map(int, input().split()))\\n    brr = list(map(int, input().split()))\\n    arr.sort()\\n    brr.sort(reverse=True)\\n    for i in range(n):\\n        if arr[i] + brr[i] > x:\\n            print('No')\\n            return\\n    print('Yes')\\n    return\\n\\n\\nimport sys, os\\nif os.path.exists('input.txt'):\\n    sys.stdin = open('input.txt', 'r')\\nsys.setrecursionlimit(10 ** 5)\\nt = int(input())\\nfor _ in range(t - 1):\\n    testcase()\\n    input()\\ntestcase()\", \"import sys\\nimport itertools as it\\nimport math as mt\\nimport bisect as bi\\nimport collections as cc\\nI=lambda:list(map(int,input().split()))\\nfor tc in range(int(input())):\\n    n,x=I()\\n    a=I()\\n    b=I()\\n    a.sort()\\n    b.sort(reverse=True)\\n    tf=1\\n    for i in range(n):\\n        if a[i]+b[i]>x:\\n            tf=0\\n    if tf:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n    try:\\n        input()\\n    except:\\n        pass\\n\", \"import sys\\nimport math\\ndef II():\\n\\treturn int(sys.stdin.readline())\\n \\ndef LI():\\n\\treturn list(map(int, sys.stdin.readline().split()))\\n \\ndef MI():\\n\\treturn map(int, sys.stdin.readline().split())\\n \\ndef SI():\\n\\treturn sys.stdin.readline().strip()\\nt = II()\\nfor q in range(t):\\n\\tn,x = MI()\\n\\ta = LI()\\n\\tb = LI()\\n\\ta.sort()\\n\\tboo = True\\n\\tb.sort(reverse=True)\\n\\tfor i in range(n):\\n\\t\\tif a[i]+b[i]>x:\\n\\t\\t\\tboo = False\\n\\t\\t\\tbreak\\n\\tprint(\\\"Yes\\\" if boo else \\\"No\\\")\\n\\tif q!=t-1:\\n\\t\\ta = input()\", \"# map(int, input().split())\\ndef main():\\n    n, x = list(map(int, input().split()))\\n    a = list(map(int, input().split()))\\n    b = list(map(int, input().split()))\\n\\n    a.sort()\\n    b.sort()\\n    b.reverse()\\n    t = True\\n    for i in range(n):\\n        if a[i] + b[i] > x:\\n            t = False\\n            break\\n    if t:\\n        print('Yes')\\n    else:\\n        print('No')\\n    if wewq != rw - 1:\\n        input()\\nrw = int(input())\\nfor wewq in range(rw):\\n    main()\\n\"]",
        "difficulty": "interview",
        "input": "4\n3 4\n1 2 3\n1 1 2\n\n2 6\n1 4\n2 5\n\n4 4\n1 2 3 4\n1 2 3 4\n\n1 5\n5\n5\n",
        "output": "Yes\nYes\nNo\nNo\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1445/A"
    },
    {
        "id": 454,
        "task_id": 2695,
        "test_case_id": 1,
        "question": "Gotham City is again under attack. This time Joker has given an open challenge to solve the following problem in order to save Gotham. Help Batman in protecting Gotham by solving the problem.\nYou are given two strings A and B composed of lowercase letters of Latin alphabet. B can be obtained by removing some characters from A(including 0). You are given an array containing any random permutation of numbers $1$ to $N$, where $N$ is the length of the string A. You have to remove the letters of A in the given order of indices. Note that after removing one letter, the indices of other letters do not change. Return the maximum number of indices you can remove in the given order such that B is still obtainable from A.\n\n-----Input:-----\n- First two lines contains the strings A and B respectively.\n- The third line contains a random permutation of numbers from $1$ to $N$ representing some order of indices of string A.\n\n-----Output:-----\nPrint a single number denoting the maximum number of indices you can remove in the given order such that B is still obtainable from A.\n\n-----Constraints-----\n- $1 \\leq |B| \\leq |A| \\leq 200000$\n\n-----Sample Input #1:-----\nxxyxxy\nxyy\n1 5 4 6 3 2\n\n-----Sample Output #1:-----\n3\n\n-----Sample Input #2:-----\njphokenixr\njoker\n2 9 3 7 8 1 6 5 4 10\n\n-----Sample Output #2:-----\n5\n\n-----EXPLANATION:-----\nFor the first example removing characters in order,\nxxyxxy => _xyxxy => _xyx_y => _xy__y.\nIf we remove any other element now then we can not obtain 'xxy'. So the ans is 3.",
        "solutions": "[\"# cook your dish here\\ntry:\\n    a,b,da=list(input()),input(),list(map(int,input().split()))\\n    print(len(a)-len(b))\\nexcept:\\n    pass\", \"try:\\n    A,B,data = list(input()),input(),list(map(int,input().split()))\\n    print(len(A)-len(B))\\nexcept:\\n    pass\"]",
        "difficulty": "interview",
        "input": [
            "#1:",
            "xxyxxy",
            "xyy",
            "1 5 4 6 3 2"
        ],
        "output": [
            "3"
        ],
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://www.codechef.com/COSQ2020/problems/PRGOTHAM"
    },
    {
        "id": 455,
        "task_id": 4842,
        "test_case_id": 1,
        "question": "While mostly known for the programs she wrote for Charles Babbage’s Analytic Engine, Augusta Ada King-Noel, Countess of Lovelace, described how the method of finite differences could be used to solve all types of problems involving number sequences and series. These techniques were implemented in Babbage’s Difference Engine.\n\nThe algorithm: If we compute the difference between consecutive values in a numeric sequence, we will obtain a new sequence which is related to the derivative of the function implied by the original sequence. For sequences generated from first-order polynomials (linear functions) the successive differences will be a list of identical values, (i.e., a constant difference). For second-order polynomial functions the lists of differences will be a new sequence whose values change linearly. In turn, the list of differences of the values in this generated list (i.e., the finite differences of the list of differences) will be constant, and so on for higher-order polynomials. In general the $n^{\\text {th}}$ row of differences will be constant for an $n^{\\text {th}}$ degree polynomial.\n\nFor example, the first-order polynomial $3x + 3$ produces the sequence below at $x=0,1,2,3,4$, and the first differences are shown on the following line.\n\n3     6     9    12    15   3     3     3     3\n\nAs another example, the polynomial $x^2$, if evaluated at inputs $x=3, 5, 7, 9,$ produces the sequence below.\n\n9    25    49    81\n  16    24    32 8     8\n\nFurthermore, if we consider a minimum-order polynomial that produces the original sequence, its value at the next regularly spaced input can be predicted by extending the difference table.\n\n-----Input-----\nThe input consists of a value $n$, designating the number of polynomial evaluations given with $2 \\leq n \\leq 10$, follwed by $n$ values $v_1, v_2, \\ldots , v_{n}$ which represent the value of a polynomial when evaluated at $n$ regularly spaced input values. Each $v_ j$ will satisfy $-2000000 \\leq v_ j \\leq 2000000$ and at least two of those values will differ from each other.\n\n-----Output-----\nOutput two integer values $d$ and $v_{n+1}$, separated by a space. The value $d$ must be the degree of a minimal-degree polynomial producing the original sequence, and $v_{n+1}$ must be the value of the polynomial if evaluated at the next regularly spaced input value.\n\n-----Examples-----\nSample Input 1:\n5 3 6 9 12 15\nSample Output 1:\n1 18\n\nSample Input 2:\n4 9 25 49 81\nSample Output 2:\n2 121",
        "solutions": "",
        "difficulty": "introductory",
        "input": "5 3 6 9 12 15\n",
        "output": "1 18\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ada"
    },
    {
        "id": 456,
        "task_id": 4842,
        "test_case_id": 2,
        "question": "While mostly known for the programs she wrote for Charles Babbage’s Analytic Engine, Augusta Ada King-Noel, Countess of Lovelace, described how the method of finite differences could be used to solve all types of problems involving number sequences and series. These techniques were implemented in Babbage’s Difference Engine.\n\nThe algorithm: If we compute the difference between consecutive values in a numeric sequence, we will obtain a new sequence which is related to the derivative of the function implied by the original sequence. For sequences generated from first-order polynomials (linear functions) the successive differences will be a list of identical values, (i.e., a constant difference). For second-order polynomial functions the lists of differences will be a new sequence whose values change linearly. In turn, the list of differences of the values in this generated list (i.e., the finite differences of the list of differences) will be constant, and so on for higher-order polynomials. In general the $n^{\\text {th}}$ row of differences will be constant for an $n^{\\text {th}}$ degree polynomial.\n\nFor example, the first-order polynomial $3x + 3$ produces the sequence below at $x=0,1,2,3,4$, and the first differences are shown on the following line.\n\n3     6     9    12    15   3     3     3     3\n\nAs another example, the polynomial $x^2$, if evaluated at inputs $x=3, 5, 7, 9,$ produces the sequence below.\n\n9    25    49    81\n  16    24    32 8     8\n\nFurthermore, if we consider a minimum-order polynomial that produces the original sequence, its value at the next regularly spaced input can be predicted by extending the difference table.\n\n-----Input-----\nThe input consists of a value $n$, designating the number of polynomial evaluations given with $2 \\leq n \\leq 10$, follwed by $n$ values $v_1, v_2, \\ldots , v_{n}$ which represent the value of a polynomial when evaluated at $n$ regularly spaced input values. Each $v_ j$ will satisfy $-2000000 \\leq v_ j \\leq 2000000$ and at least two of those values will differ from each other.\n\n-----Output-----\nOutput two integer values $d$ and $v_{n+1}$, separated by a space. The value $d$ must be the degree of a minimal-degree polynomial producing the original sequence, and $v_{n+1}$ must be the value of the polynomial if evaluated at the next regularly spaced input value.\n\n-----Examples-----\nSample Input 1:\n5 3 6 9 12 15\nSample Output 1:\n1 18\n\nSample Input 2:\n4 9 25 49 81\nSample Output 2:\n2 121",
        "solutions": "",
        "difficulty": "introductory",
        "input": "4 9 25 49 81\n",
        "output": "2 121\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ada"
    },
    {
        "id": 457,
        "task_id": 4842,
        "test_case_id": 3,
        "question": "While mostly known for the programs she wrote for Charles Babbage’s Analytic Engine, Augusta Ada King-Noel, Countess of Lovelace, described how the method of finite differences could be used to solve all types of problems involving number sequences and series. These techniques were implemented in Babbage’s Difference Engine.\n\nThe algorithm: If we compute the difference between consecutive values in a numeric sequence, we will obtain a new sequence which is related to the derivative of the function implied by the original sequence. For sequences generated from first-order polynomials (linear functions) the successive differences will be a list of identical values, (i.e., a constant difference). For second-order polynomial functions the lists of differences will be a new sequence whose values change linearly. In turn, the list of differences of the values in this generated list (i.e., the finite differences of the list of differences) will be constant, and so on for higher-order polynomials. In general the $n^{\\text {th}}$ row of differences will be constant for an $n^{\\text {th}}$ degree polynomial.\n\nFor example, the first-order polynomial $3x + 3$ produces the sequence below at $x=0,1,2,3,4$, and the first differences are shown on the following line.\n\n3     6     9    12    15   3     3     3     3\n\nAs another example, the polynomial $x^2$, if evaluated at inputs $x=3, 5, 7, 9,$ produces the sequence below.\n\n9    25    49    81\n  16    24    32 8     8\n\nFurthermore, if we consider a minimum-order polynomial that produces the original sequence, its value at the next regularly spaced input can be predicted by extending the difference table.\n\n-----Input-----\nThe input consists of a value $n$, designating the number of polynomial evaluations given with $2 \\leq n \\leq 10$, follwed by $n$ values $v_1, v_2, \\ldots , v_{n}$ which represent the value of a polynomial when evaluated at $n$ regularly spaced input values. Each $v_ j$ will satisfy $-2000000 \\leq v_ j \\leq 2000000$ and at least two of those values will differ from each other.\n\n-----Output-----\nOutput two integer values $d$ and $v_{n+1}$, separated by a space. The value $d$ must be the degree of a minimal-degree polynomial producing the original sequence, and $v_{n+1}$ must be the value of the polynomial if evaluated at the next regularly spaced input value.\n\n-----Examples-----\nSample Input 1:\n5 3 6 9 12 15\nSample Output 1:\n1 18\n\nSample Input 2:\n4 9 25 49 81\nSample Output 2:\n2 121",
        "solutions": "",
        "difficulty": "introductory",
        "input": "6 39 6 -3 0 3 -6\n",
        "output": "3 -39\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ada"
    },
    {
        "id": 458,
        "task_id": 2310,
        "test_case_id": 1,
        "question": "Polycarp is flying in the airplane. Finally, it is his favorite time — the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that means, he will be the m-th person to get food.\n\nThe flight menu has k dishes in total and when Polycarp boarded the flight, he had time to count the number of portions of each dish on board. Thus, he knows values a_1, a_2, ..., a_{k}, where a_{i} is the number of portions of the i-th dish.\n\nThe stewardess has already given food to m - 1 passengers, gave Polycarp a polite smile and asked him what he would prefer. That's when Polycarp realized that they might have run out of some dishes by that moment. For some of the m - 1 passengers ahead of him, he noticed what dishes they were given. Besides, he's heard some strange mumbling from some of the m - 1 passengers ahead of him, similar to phrase 'I'm disappointed'. That happened when a passenger asked for some dish but the stewardess gave him a polite smile and said that they had run out of that dish. In that case the passenger needed to choose some other dish that was available. If Polycarp heard no more sounds from a passenger, that meant that the passenger chose his dish at the first try.\n\nHelp Polycarp to find out for each dish: whether they could have run out of the dish by the moment Polyarp was served or that dish was definitely available.\n\n\n-----Input-----\n\nEach test in this problem consists of one or more input sets. First goes a string that contains a single integer t (1 ≤ t ≤ 100 000) — the number of input data sets in the test. Then the sets follow, each set is preceded by an empty line.\n\nThe first line of each set of the input contains integers m, k (2 ≤ m ≤ 100 000, 1 ≤ k ≤ 100 000) — the number of Polycarp's seat and the number of dishes, respectively.\n\nThe second line contains a sequence of k integers a_1, a_2, ..., a_{k} (1 ≤ a_{i} ≤ 100 000), where a_{i} is the initial number of portions of the i-th dish.\n\nThen m - 1 lines follow, each line contains the description of Polycarp's observations about giving food to a passenger sitting in front of him: the j-th line contains a pair of integers t_{j}, r_{j} (0 ≤ t_{j} ≤ k, 0 ≤ r_{j} ≤ 1), where t_{j} is the number of the dish that was given to the j-th passenger (or 0, if Polycarp didn't notice what dish was given to the passenger), and r_{j} — a 1 or a 0, depending on whether the j-th passenger was or wasn't disappointed, respectively.\n\nWe know that sum a_{i} equals at least m, that is,Polycarp will definitely get some dish, even if it is the last thing he wanted. It is guaranteed that the data is consistent.\n\nSum m for all input sets doesn't exceed 100 000. Sum k for all input sets doesn't exceed 100 000.\n\n\n-----Output-----\n\nFor each input set print the answer as a single line. Print a string of k letters \"Y\" or \"N\". Letter \"Y\" in position i should be printed if they could have run out of the i-th dish by the time the stewardess started serving Polycarp.\n\n\n-----Examples-----\nInput\n2\n\n3 4\n2 3 2 1\n1 0\n0 0\n\n5 5\n1 2 1 3 1\n3 0\n0 0\n2 1\n4 0\n\nOutput\nYNNY\nYYYNY\n\n\n\n-----Note-----\n\nIn the first input set depending on the choice of the second passenger the situation could develop in different ways:  If he chose the first dish, then by the moment the stewardess reaches Polycarp, they will have run out of the first dish;  If he chose the fourth dish, then by the moment the stewardess reaches Polycarp, they will have run out of the fourth dish;  Otherwise, Polycarp will be able to choose from any of the four dishes. \n\nThus, the answer is \"YNNY\".\n\nIn the second input set there is, for example, the following possible scenario. First, the first passenger takes the only third dish, then the second passenger takes the second dish. Then, the third passenger asks for the third dish, but it is not available, so he makes disappointed muttering and ends up with the second dish. Then the fourth passenger takes the fourth dish, and Polycarp ends up with the choice between the first, fourth and fifth dish.\n\nLikewise, another possible scenario is when by the time the stewardess comes to Polycarp, they will have run out of either the first or the fifth dish (this can happen if one of these dishes is taken by the second passenger). It is easy to see that there is more than enough of the fourth dish, so Polycarp can always count on it. Thus, the answer is \"YYYNY\".",
        "solutions": "[\"t = int(input())\\nfor i in range(t):\\n    input()\\n    m,k = map(int,input().split())\\n    ak = list(map(int,input().split()))\\n    ak2 = [0]*k\\n    tjrj = [list(map(int,input().split())) for j in range(m-1)]\\n    num = 0\\n    num2 = 0\\n    num3 = 100002\\n    for j in range(m-1):\\n        if num2 == 1 or tjrj[j][1] == 0:\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n        else:\\n            for z in range(k):\\n                    if ak[z] - num < 1:\\n                        ak2[z] = 1\\n            num2 = 1\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n            for f in range(j,m-1):\\n                if tjrj[f][0] != 0:\\n                    ak2[tjrj[f][0]-1] = 0\\n            for f in range(k):\\n                if ak2[f] == 1:\\n                    if num3 > ak[f]:\\n                        num3 = ak[f]\\n            num -= num3\\n    for z in range(k):\\n        if ak[z] - num < 1 or ak2[z] == 1:\\n            print(\\\"Y\\\",end=\\\"\\\")\\n        else:\\n            print(\\\"N\\\",end=\\\"\\\")\\n    print()\\n\", \"import sys\\n\\ntest_count = int(sys.stdin.readline())\\nfor test in range(test_count):\\n    sys.stdin.readline()\\n    m, k = list(map(int, sys.stdin.readline().split()))\\n    counts = list(map(int, sys.stdin.readline().split()))\\n    took = []\\n    unhappy = []\\n    for i in range(m - 1):\\n        t, r = list(map(int, sys.stdin.readline().split()))\\n        t -= 1 # -1 means unknown\\n        took.append(t)\\n        unhappy.append(r)\\n\\n    took_in_total = [0 for dish_count in counts]\\n    for i in range(m - 1):\\n        if took[i] != -1:\\n            took_in_total[took[i]] += 1\\n\\n    took_already = [0 for dish_count in counts]\\n    left = [dish_count for dish_count in counts]\\n    answer = [False for dish_count in counts]\\n    unknown = 0\\n    all_present = True\\n    for i in range(m - 1):\\n        if unhappy[i] == 1 and all_present:\\n            could_exhaust = []\\n            for j in range(k):\\n                if took_already[j] < took_in_total[j]:\\n                    continue\\n                if left[j] > unknown:\\n                    continue\\n                could_exhaust.append(j)\\n\\n            if len(could_exhaust) == 0:\\n                raise AssertionError\\n\\n            for j in could_exhaust:\\n                answer[j] = True\\n\\n            unknown -= min([left[j] for j in could_exhaust])\\n            all_present = False\\n\\n        if took[i] != -1:\\n            left[took[i]] -= 1\\n            took_already[took[i]] += 1\\n            if left[took[i]] == 0:\\n                all_present = False\\n        else:\\n            unknown += 1\\n\\n    for j in range(k):\\n        if left[j] <= unknown:\\n            answer[j] = True\\n\\n    sys.stdout.write(\\n        ''.join(['Y' if x else 'N' for x in answer]) + '\\\\n'\\n    )\\n\", \"n=int(input())\\nfor i in range(n):\\n    input().strip()\\n    q,w=map(int,input().strip().split())\\n    kol=list(map(int,input().strip().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,input().strip().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    print(''.join(map(lambda x:'Y' if x else 'N',rez)))\", \"import sys\\nn=int(input())\\nfor i in range(n):\\n    sys.stdin.readline()\\n    q,w=map(int,sys.stdin.readline().split())\\n    kol=list(map(int,sys.stdin.readline().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,sys.stdin.readline().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    sys.stdout.write(''.join(map(lambda x:'Y' if x else 'N',rez))+'\\\\n')\", \"t = int(input())\\nfor j in range(t):\\n    e = input()\\n    m, k = map(int, input().split())\\n    arr = [int(i) for i in input().split()]\\n    sum, bfail = [0] * k, [0] * k\\n    ffail, undef = -1, 0\\n    used = [False] * k\\n    ubfail = 0\\n    for i in range(m - 1):\\n        c, ns = map(int, input().split())\\n        if c == 0:\\n            undef += 1\\n            if ns == 0 and ffail == -1:\\n                ubfail += 1\\n        else:\\n            sum[c - 1] += 1\\n            if ns == 0 and ffail == -1:\\n                bfail[c - 1] += 1\\n        if ns and ffail == -1:\\n            ffail = i\\n        if ffail != -1 and c > 0:\\n            used[c - 1] = True\\n    if ffail == -1:\\n        for i in range(k):\\n            if sum[i] + undef >= arr[i]:\\n                print('Y', end = '')\\n            else:\\n                print('N', end = '')\\n        print()\\n        continue\\n    minu = 10 ** 6\\n    for i in range(k):\\n        if not used[i] and arr[i] - bfail[i] < minu:\\n            minu = arr[i] - bfail[i]\\n            best = i\\n    for i in range(k):\\n        if i == best or undef - minu + sum[i] >= arr[i]:\\n            print('Y', end = '')\\n        elif bfail[i] + ubfail >= arr[i] and not used[i]:\\n            print('Y', end = '')\\n        else:\\n            print('N', end = '')\\n    print()\\n\", \"import sys\\n\\nt = int(input())\\n\\nfor i in range(t):\\n    remove_from_all = 0\\n    input()\\n    m, k = (int(x) for x in input().split())\\n    dishes = [int(x) for x in input().split()]\\n    inputs = []\\n    for j in range(m - 1):\\n        t, r = (int(x) for x in input().split())\\n        inputs.append((t - 1, r))\\n    seen_upset = False\\n    for i, v in enumerate(inputs):\\n        t, r = v\\n        if r == 1 and not seen_upset:\\n            impossible = set()\\n            for j in range(i, len(inputs)):\\n                _t, _r = inputs[j]\\n                impossible.add(_t)\\n            for j in range(len(dishes)):\\n                if dishes[j] > remove_from_all:\\n                    impossible.add(j)\\n            minimal = float(\\\"inf\\\")\\n            for j in range(len(dishes)):\\n                if j not in impossible:\\n                    minimal = min(dishes[j], minimal)\\n                    dishes[j] = 0\\n            remove_from_all -= minimal\\n            seen_upset = True\\n        if t == -1:\\n            remove_from_all += 1\\n        else:\\n            dishes[t] -= 1\\n    for j in dishes:\\n        sys.stdout.write(\\\"Y\\\" if j - remove_from_all <= 0 else \\\"N\\\")\\n    print(\\\"\\\")\\n\", \"def ris():\\n    return map(int, input().split())\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set(filter(lambda x: a[x] <= q, range(k))))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min(map(lambda x: a[x], tmp))\\n    print(\\\"\\\".join(list(map(lambda x: 'Y' if a[x] - q <= 0 or x in tmp else 'N', range(len(a))))))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\", \"t = int(input())\\n\\nfor i in range(t):\\n    input()\\n    m, k = [int(l) for l in input().split()]\\n    a = [int(j) for j in input().split()]\\n    upset = -1\\n    unknown = 0\\n    unknownBeforeUpset = 0\\n    ti, r = [], []\\n    for i1 in range(m-1):\\n        n = input().split()\\n        ti.append(int(n[0]))\\n        r.append(int(n[1]))\\n        ti[i1] -= 1\\n\\n        if r[i1] == 1 and upset == -1:\\n            upset = i1\\n\\n        if ti[i1] != -1:\\n            a[ti[i1]] -= 1\\n        else:\\n            unknown+=1\\n            if upset == -1:\\n                unknownBeforeUpset+=1\\n\\n    st = [\\\"N\\\" for j in range(k)]\\n    if upset == -1:\\n        for j in range(k):\\n            if a[j] <= unknown:\\n                st[j] = \\\"Y\\\"\\n    else:\\n        usedAfter = [False for i in range(k)]\\n        for j in range(upset, m-1):\\n            if ti[j] != -1:\\n                usedAfter[ti[j]] = True\\n        minFirstFinished = -1\\n        for j in range(k):\\n            if not usedAfter[j] and unknownBeforeUpset >= a[j]:\\n                st[j] = 'Y'\\n                if minFirstFinished == -1 or a[minFirstFinished] > a[j]:\\n                    minFirstFinished = j\\n        if minFirstFinished != -1:\\n            restUnknown = unknown - a[minFirstFinished]\\n            for j in range(k):\\n                if a[j] <= restUnknown:\\n                    st[j] = 'Y'\\n\\n    print(\\\"\\\".join(st))\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n\\n    return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef testCase():\\n\\n    m, k = ris()\\n\\n    q = 0\\n\\n    a = list(ris())\\n\\n    some_is_out = False\\n\\n    tmp = set()\\n\\n    for i in range(m - 1):\\n\\n        t, r = ris()\\n\\n        t -= 1\\n\\n        if r == 1 and not some_is_out:\\n\\n            some_is_out = True\\n\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n\\n        if t == -1:\\n\\n            q += 1\\n\\n        else:\\n\\n            if t in tmp:\\n\\n                tmp.remove(t)\\n\\n            a[t] -= 1\\n\\n            if a[t] < 0:\\n\\n                a[t] = 0\\n\\n                q += 1\\n\\n    if tmp:\\n\\n        q -= min([a[x] for x in tmp])\\n\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\n\\n\\n\\nfor i in range(int(input())):\\n\\n    input()\\n\\n    testCase()\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "interview",
        "input": "2\n\n3 4\n2 3 2 1\n1 0\n0 0\n\n5 5\n1 2 1 3 1\n3 0\n0 0\n2 1\n4 0\n",
        "output": "YNNY\nYYYNY\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/522/C"
    },
    {
        "id": 459,
        "task_id": 2310,
        "test_case_id": 2,
        "question": "Polycarp is flying in the airplane. Finally, it is his favorite time — the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that means, he will be the m-th person to get food.\n\nThe flight menu has k dishes in total and when Polycarp boarded the flight, he had time to count the number of portions of each dish on board. Thus, he knows values a_1, a_2, ..., a_{k}, where a_{i} is the number of portions of the i-th dish.\n\nThe stewardess has already given food to m - 1 passengers, gave Polycarp a polite smile and asked him what he would prefer. That's when Polycarp realized that they might have run out of some dishes by that moment. For some of the m - 1 passengers ahead of him, he noticed what dishes they were given. Besides, he's heard some strange mumbling from some of the m - 1 passengers ahead of him, similar to phrase 'I'm disappointed'. That happened when a passenger asked for some dish but the stewardess gave him a polite smile and said that they had run out of that dish. In that case the passenger needed to choose some other dish that was available. If Polycarp heard no more sounds from a passenger, that meant that the passenger chose his dish at the first try.\n\nHelp Polycarp to find out for each dish: whether they could have run out of the dish by the moment Polyarp was served or that dish was definitely available.\n\n\n-----Input-----\n\nEach test in this problem consists of one or more input sets. First goes a string that contains a single integer t (1 ≤ t ≤ 100 000) — the number of input data sets in the test. Then the sets follow, each set is preceded by an empty line.\n\nThe first line of each set of the input contains integers m, k (2 ≤ m ≤ 100 000, 1 ≤ k ≤ 100 000) — the number of Polycarp's seat and the number of dishes, respectively.\n\nThe second line contains a sequence of k integers a_1, a_2, ..., a_{k} (1 ≤ a_{i} ≤ 100 000), where a_{i} is the initial number of portions of the i-th dish.\n\nThen m - 1 lines follow, each line contains the description of Polycarp's observations about giving food to a passenger sitting in front of him: the j-th line contains a pair of integers t_{j}, r_{j} (0 ≤ t_{j} ≤ k, 0 ≤ r_{j} ≤ 1), where t_{j} is the number of the dish that was given to the j-th passenger (or 0, if Polycarp didn't notice what dish was given to the passenger), and r_{j} — a 1 or a 0, depending on whether the j-th passenger was or wasn't disappointed, respectively.\n\nWe know that sum a_{i} equals at least m, that is,Polycarp will definitely get some dish, even if it is the last thing he wanted. It is guaranteed that the data is consistent.\n\nSum m for all input sets doesn't exceed 100 000. Sum k for all input sets doesn't exceed 100 000.\n\n\n-----Output-----\n\nFor each input set print the answer as a single line. Print a string of k letters \"Y\" or \"N\". Letter \"Y\" in position i should be printed if they could have run out of the i-th dish by the time the stewardess started serving Polycarp.\n\n\n-----Examples-----\nInput\n2\n\n3 4\n2 3 2 1\n1 0\n0 0\n\n5 5\n1 2 1 3 1\n3 0\n0 0\n2 1\n4 0\n\nOutput\nYNNY\nYYYNY\n\n\n\n-----Note-----\n\nIn the first input set depending on the choice of the second passenger the situation could develop in different ways:  If he chose the first dish, then by the moment the stewardess reaches Polycarp, they will have run out of the first dish;  If he chose the fourth dish, then by the moment the stewardess reaches Polycarp, they will have run out of the fourth dish;  Otherwise, Polycarp will be able to choose from any of the four dishes. \n\nThus, the answer is \"YNNY\".\n\nIn the second input set there is, for example, the following possible scenario. First, the first passenger takes the only third dish, then the second passenger takes the second dish. Then, the third passenger asks for the third dish, but it is not available, so he makes disappointed muttering and ends up with the second dish. Then the fourth passenger takes the fourth dish, and Polycarp ends up with the choice between the first, fourth and fifth dish.\n\nLikewise, another possible scenario is when by the time the stewardess comes to Polycarp, they will have run out of either the first or the fifth dish (this can happen if one of these dishes is taken by the second passenger). It is easy to see that there is more than enough of the fourth dish, so Polycarp can always count on it. Thus, the answer is \"YYYNY\".",
        "solutions": "[\"t = int(input())\\nfor i in range(t):\\n    input()\\n    m,k = map(int,input().split())\\n    ak = list(map(int,input().split()))\\n    ak2 = [0]*k\\n    tjrj = [list(map(int,input().split())) for j in range(m-1)]\\n    num = 0\\n    num2 = 0\\n    num3 = 100002\\n    for j in range(m-1):\\n        if num2 == 1 or tjrj[j][1] == 0:\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n        else:\\n            for z in range(k):\\n                    if ak[z] - num < 1:\\n                        ak2[z] = 1\\n            num2 = 1\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n            for f in range(j,m-1):\\n                if tjrj[f][0] != 0:\\n                    ak2[tjrj[f][0]-1] = 0\\n            for f in range(k):\\n                if ak2[f] == 1:\\n                    if num3 > ak[f]:\\n                        num3 = ak[f]\\n            num -= num3\\n    for z in range(k):\\n        if ak[z] - num < 1 or ak2[z] == 1:\\n            print(\\\"Y\\\",end=\\\"\\\")\\n        else:\\n            print(\\\"N\\\",end=\\\"\\\")\\n    print()\\n\", \"import sys\\n\\ntest_count = int(sys.stdin.readline())\\nfor test in range(test_count):\\n    sys.stdin.readline()\\n    m, k = list(map(int, sys.stdin.readline().split()))\\n    counts = list(map(int, sys.stdin.readline().split()))\\n    took = []\\n    unhappy = []\\n    for i in range(m - 1):\\n        t, r = list(map(int, sys.stdin.readline().split()))\\n        t -= 1 # -1 means unknown\\n        took.append(t)\\n        unhappy.append(r)\\n\\n    took_in_total = [0 for dish_count in counts]\\n    for i in range(m - 1):\\n        if took[i] != -1:\\n            took_in_total[took[i]] += 1\\n\\n    took_already = [0 for dish_count in counts]\\n    left = [dish_count for dish_count in counts]\\n    answer = [False for dish_count in counts]\\n    unknown = 0\\n    all_present = True\\n    for i in range(m - 1):\\n        if unhappy[i] == 1 and all_present:\\n            could_exhaust = []\\n            for j in range(k):\\n                if took_already[j] < took_in_total[j]:\\n                    continue\\n                if left[j] > unknown:\\n                    continue\\n                could_exhaust.append(j)\\n\\n            if len(could_exhaust) == 0:\\n                raise AssertionError\\n\\n            for j in could_exhaust:\\n                answer[j] = True\\n\\n            unknown -= min([left[j] for j in could_exhaust])\\n            all_present = False\\n\\n        if took[i] != -1:\\n            left[took[i]] -= 1\\n            took_already[took[i]] += 1\\n            if left[took[i]] == 0:\\n                all_present = False\\n        else:\\n            unknown += 1\\n\\n    for j in range(k):\\n        if left[j] <= unknown:\\n            answer[j] = True\\n\\n    sys.stdout.write(\\n        ''.join(['Y' if x else 'N' for x in answer]) + '\\\\n'\\n    )\\n\", \"n=int(input())\\nfor i in range(n):\\n    input().strip()\\n    q,w=map(int,input().strip().split())\\n    kol=list(map(int,input().strip().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,input().strip().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    print(''.join(map(lambda x:'Y' if x else 'N',rez)))\", \"import sys\\nn=int(input())\\nfor i in range(n):\\n    sys.stdin.readline()\\n    q,w=map(int,sys.stdin.readline().split())\\n    kol=list(map(int,sys.stdin.readline().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,sys.stdin.readline().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    sys.stdout.write(''.join(map(lambda x:'Y' if x else 'N',rez))+'\\\\n')\", \"t = int(input())\\nfor j in range(t):\\n    e = input()\\n    m, k = map(int, input().split())\\n    arr = [int(i) for i in input().split()]\\n    sum, bfail = [0] * k, [0] * k\\n    ffail, undef = -1, 0\\n    used = [False] * k\\n    ubfail = 0\\n    for i in range(m - 1):\\n        c, ns = map(int, input().split())\\n        if c == 0:\\n            undef += 1\\n            if ns == 0 and ffail == -1:\\n                ubfail += 1\\n        else:\\n            sum[c - 1] += 1\\n            if ns == 0 and ffail == -1:\\n                bfail[c - 1] += 1\\n        if ns and ffail == -1:\\n            ffail = i\\n        if ffail != -1 and c > 0:\\n            used[c - 1] = True\\n    if ffail == -1:\\n        for i in range(k):\\n            if sum[i] + undef >= arr[i]:\\n                print('Y', end = '')\\n            else:\\n                print('N', end = '')\\n        print()\\n        continue\\n    minu = 10 ** 6\\n    for i in range(k):\\n        if not used[i] and arr[i] - bfail[i] < minu:\\n            minu = arr[i] - bfail[i]\\n            best = i\\n    for i in range(k):\\n        if i == best or undef - minu + sum[i] >= arr[i]:\\n            print('Y', end = '')\\n        elif bfail[i] + ubfail >= arr[i] and not used[i]:\\n            print('Y', end = '')\\n        else:\\n            print('N', end = '')\\n    print()\\n\", \"import sys\\n\\nt = int(input())\\n\\nfor i in range(t):\\n    remove_from_all = 0\\n    input()\\n    m, k = (int(x) for x in input().split())\\n    dishes = [int(x) for x in input().split()]\\n    inputs = []\\n    for j in range(m - 1):\\n        t, r = (int(x) for x in input().split())\\n        inputs.append((t - 1, r))\\n    seen_upset = False\\n    for i, v in enumerate(inputs):\\n        t, r = v\\n        if r == 1 and not seen_upset:\\n            impossible = set()\\n            for j in range(i, len(inputs)):\\n                _t, _r = inputs[j]\\n                impossible.add(_t)\\n            for j in range(len(dishes)):\\n                if dishes[j] > remove_from_all:\\n                    impossible.add(j)\\n            minimal = float(\\\"inf\\\")\\n            for j in range(len(dishes)):\\n                if j not in impossible:\\n                    minimal = min(dishes[j], minimal)\\n                    dishes[j] = 0\\n            remove_from_all -= minimal\\n            seen_upset = True\\n        if t == -1:\\n            remove_from_all += 1\\n        else:\\n            dishes[t] -= 1\\n    for j in dishes:\\n        sys.stdout.write(\\\"Y\\\" if j - remove_from_all <= 0 else \\\"N\\\")\\n    print(\\\"\\\")\\n\", \"def ris():\\n    return map(int, input().split())\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set(filter(lambda x: a[x] <= q, range(k))))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min(map(lambda x: a[x], tmp))\\n    print(\\\"\\\".join(list(map(lambda x: 'Y' if a[x] - q <= 0 or x in tmp else 'N', range(len(a))))))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\", \"t = int(input())\\n\\nfor i in range(t):\\n    input()\\n    m, k = [int(l) for l in input().split()]\\n    a = [int(j) for j in input().split()]\\n    upset = -1\\n    unknown = 0\\n    unknownBeforeUpset = 0\\n    ti, r = [], []\\n    for i1 in range(m-1):\\n        n = input().split()\\n        ti.append(int(n[0]))\\n        r.append(int(n[1]))\\n        ti[i1] -= 1\\n\\n        if r[i1] == 1 and upset == -1:\\n            upset = i1\\n\\n        if ti[i1] != -1:\\n            a[ti[i1]] -= 1\\n        else:\\n            unknown+=1\\n            if upset == -1:\\n                unknownBeforeUpset+=1\\n\\n    st = [\\\"N\\\" for j in range(k)]\\n    if upset == -1:\\n        for j in range(k):\\n            if a[j] <= unknown:\\n                st[j] = \\\"Y\\\"\\n    else:\\n        usedAfter = [False for i in range(k)]\\n        for j in range(upset, m-1):\\n            if ti[j] != -1:\\n                usedAfter[ti[j]] = True\\n        minFirstFinished = -1\\n        for j in range(k):\\n            if not usedAfter[j] and unknownBeforeUpset >= a[j]:\\n                st[j] = 'Y'\\n                if minFirstFinished == -1 or a[minFirstFinished] > a[j]:\\n                    minFirstFinished = j\\n        if minFirstFinished != -1:\\n            restUnknown = unknown - a[minFirstFinished]\\n            for j in range(k):\\n                if a[j] <= restUnknown:\\n                    st[j] = 'Y'\\n\\n    print(\\\"\\\".join(st))\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n\\n    return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef testCase():\\n\\n    m, k = ris()\\n\\n    q = 0\\n\\n    a = list(ris())\\n\\n    some_is_out = False\\n\\n    tmp = set()\\n\\n    for i in range(m - 1):\\n\\n        t, r = ris()\\n\\n        t -= 1\\n\\n        if r == 1 and not some_is_out:\\n\\n            some_is_out = True\\n\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n\\n        if t == -1:\\n\\n            q += 1\\n\\n        else:\\n\\n            if t in tmp:\\n\\n                tmp.remove(t)\\n\\n            a[t] -= 1\\n\\n            if a[t] < 0:\\n\\n                a[t] = 0\\n\\n                q += 1\\n\\n    if tmp:\\n\\n        q -= min([a[x] for x in tmp])\\n\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\n\\n\\n\\nfor i in range(int(input())):\\n\\n    input()\\n\\n    testCase()\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "interview",
        "input": "4\n\n2 1\n42\n0 0\n\n2 1\n2\n0 0\n\n2 1\n42\n1 0\n\n2 1\n2\n1 0\n",
        "output": "N\nN\nN\nN\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/522/C"
    },
    {
        "id": 460,
        "task_id": 2310,
        "test_case_id": 3,
        "question": "Polycarp is flying in the airplane. Finally, it is his favorite time — the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that means, he will be the m-th person to get food.\n\nThe flight menu has k dishes in total and when Polycarp boarded the flight, he had time to count the number of portions of each dish on board. Thus, he knows values a_1, a_2, ..., a_{k}, where a_{i} is the number of portions of the i-th dish.\n\nThe stewardess has already given food to m - 1 passengers, gave Polycarp a polite smile and asked him what he would prefer. That's when Polycarp realized that they might have run out of some dishes by that moment. For some of the m - 1 passengers ahead of him, he noticed what dishes they were given. Besides, he's heard some strange mumbling from some of the m - 1 passengers ahead of him, similar to phrase 'I'm disappointed'. That happened when a passenger asked for some dish but the stewardess gave him a polite smile and said that they had run out of that dish. In that case the passenger needed to choose some other dish that was available. If Polycarp heard no more sounds from a passenger, that meant that the passenger chose his dish at the first try.\n\nHelp Polycarp to find out for each dish: whether they could have run out of the dish by the moment Polyarp was served or that dish was definitely available.\n\n\n-----Input-----\n\nEach test in this problem consists of one or more input sets. First goes a string that contains a single integer t (1 ≤ t ≤ 100 000) — the number of input data sets in the test. Then the sets follow, each set is preceded by an empty line.\n\nThe first line of each set of the input contains integers m, k (2 ≤ m ≤ 100 000, 1 ≤ k ≤ 100 000) — the number of Polycarp's seat and the number of dishes, respectively.\n\nThe second line contains a sequence of k integers a_1, a_2, ..., a_{k} (1 ≤ a_{i} ≤ 100 000), where a_{i} is the initial number of portions of the i-th dish.\n\nThen m - 1 lines follow, each line contains the description of Polycarp's observations about giving food to a passenger sitting in front of him: the j-th line contains a pair of integers t_{j}, r_{j} (0 ≤ t_{j} ≤ k, 0 ≤ r_{j} ≤ 1), where t_{j} is the number of the dish that was given to the j-th passenger (or 0, if Polycarp didn't notice what dish was given to the passenger), and r_{j} — a 1 or a 0, depending on whether the j-th passenger was or wasn't disappointed, respectively.\n\nWe know that sum a_{i} equals at least m, that is,Polycarp will definitely get some dish, even if it is the last thing he wanted. It is guaranteed that the data is consistent.\n\nSum m for all input sets doesn't exceed 100 000. Sum k for all input sets doesn't exceed 100 000.\n\n\n-----Output-----\n\nFor each input set print the answer as a single line. Print a string of k letters \"Y\" or \"N\". Letter \"Y\" in position i should be printed if they could have run out of the i-th dish by the time the stewardess started serving Polycarp.\n\n\n-----Examples-----\nInput\n2\n\n3 4\n2 3 2 1\n1 0\n0 0\n\n5 5\n1 2 1 3 1\n3 0\n0 0\n2 1\n4 0\n\nOutput\nYNNY\nYYYNY\n\n\n\n-----Note-----\n\nIn the first input set depending on the choice of the second passenger the situation could develop in different ways:  If he chose the first dish, then by the moment the stewardess reaches Polycarp, they will have run out of the first dish;  If he chose the fourth dish, then by the moment the stewardess reaches Polycarp, they will have run out of the fourth dish;  Otherwise, Polycarp will be able to choose from any of the four dishes. \n\nThus, the answer is \"YNNY\".\n\nIn the second input set there is, for example, the following possible scenario. First, the first passenger takes the only third dish, then the second passenger takes the second dish. Then, the third passenger asks for the third dish, but it is not available, so he makes disappointed muttering and ends up with the second dish. Then the fourth passenger takes the fourth dish, and Polycarp ends up with the choice between the first, fourth and fifth dish.\n\nLikewise, another possible scenario is when by the time the stewardess comes to Polycarp, they will have run out of either the first or the fifth dish (this can happen if one of these dishes is taken by the second passenger). It is easy to see that there is more than enough of the fourth dish, so Polycarp can always count on it. Thus, the answer is \"YYYNY\".",
        "solutions": "[\"t = int(input())\\nfor i in range(t):\\n    input()\\n    m,k = map(int,input().split())\\n    ak = list(map(int,input().split()))\\n    ak2 = [0]*k\\n    tjrj = [list(map(int,input().split())) for j in range(m-1)]\\n    num = 0\\n    num2 = 0\\n    num3 = 100002\\n    for j in range(m-1):\\n        if num2 == 1 or tjrj[j][1] == 0:\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n        else:\\n            for z in range(k):\\n                    if ak[z] - num < 1:\\n                        ak2[z] = 1\\n            num2 = 1\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n            for f in range(j,m-1):\\n                if tjrj[f][0] != 0:\\n                    ak2[tjrj[f][0]-1] = 0\\n            for f in range(k):\\n                if ak2[f] == 1:\\n                    if num3 > ak[f]:\\n                        num3 = ak[f]\\n            num -= num3\\n    for z in range(k):\\n        if ak[z] - num < 1 or ak2[z] == 1:\\n            print(\\\"Y\\\",end=\\\"\\\")\\n        else:\\n            print(\\\"N\\\",end=\\\"\\\")\\n    print()\\n\", \"import sys\\n\\ntest_count = int(sys.stdin.readline())\\nfor test in range(test_count):\\n    sys.stdin.readline()\\n    m, k = list(map(int, sys.stdin.readline().split()))\\n    counts = list(map(int, sys.stdin.readline().split()))\\n    took = []\\n    unhappy = []\\n    for i in range(m - 1):\\n        t, r = list(map(int, sys.stdin.readline().split()))\\n        t -= 1 # -1 means unknown\\n        took.append(t)\\n        unhappy.append(r)\\n\\n    took_in_total = [0 for dish_count in counts]\\n    for i in range(m - 1):\\n        if took[i] != -1:\\n            took_in_total[took[i]] += 1\\n\\n    took_already = [0 for dish_count in counts]\\n    left = [dish_count for dish_count in counts]\\n    answer = [False for dish_count in counts]\\n    unknown = 0\\n    all_present = True\\n    for i in range(m - 1):\\n        if unhappy[i] == 1 and all_present:\\n            could_exhaust = []\\n            for j in range(k):\\n                if took_already[j] < took_in_total[j]:\\n                    continue\\n                if left[j] > unknown:\\n                    continue\\n                could_exhaust.append(j)\\n\\n            if len(could_exhaust) == 0:\\n                raise AssertionError\\n\\n            for j in could_exhaust:\\n                answer[j] = True\\n\\n            unknown -= min([left[j] for j in could_exhaust])\\n            all_present = False\\n\\n        if took[i] != -1:\\n            left[took[i]] -= 1\\n            took_already[took[i]] += 1\\n            if left[took[i]] == 0:\\n                all_present = False\\n        else:\\n            unknown += 1\\n\\n    for j in range(k):\\n        if left[j] <= unknown:\\n            answer[j] = True\\n\\n    sys.stdout.write(\\n        ''.join(['Y' if x else 'N' for x in answer]) + '\\\\n'\\n    )\\n\", \"n=int(input())\\nfor i in range(n):\\n    input().strip()\\n    q,w=map(int,input().strip().split())\\n    kol=list(map(int,input().strip().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,input().strip().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    print(''.join(map(lambda x:'Y' if x else 'N',rez)))\", \"import sys\\nn=int(input())\\nfor i in range(n):\\n    sys.stdin.readline()\\n    q,w=map(int,sys.stdin.readline().split())\\n    kol=list(map(int,sys.stdin.readline().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,sys.stdin.readline().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    sys.stdout.write(''.join(map(lambda x:'Y' if x else 'N',rez))+'\\\\n')\", \"t = int(input())\\nfor j in range(t):\\n    e = input()\\n    m, k = map(int, input().split())\\n    arr = [int(i) for i in input().split()]\\n    sum, bfail = [0] * k, [0] * k\\n    ffail, undef = -1, 0\\n    used = [False] * k\\n    ubfail = 0\\n    for i in range(m - 1):\\n        c, ns = map(int, input().split())\\n        if c == 0:\\n            undef += 1\\n            if ns == 0 and ffail == -1:\\n                ubfail += 1\\n        else:\\n            sum[c - 1] += 1\\n            if ns == 0 and ffail == -1:\\n                bfail[c - 1] += 1\\n        if ns and ffail == -1:\\n            ffail = i\\n        if ffail != -1 and c > 0:\\n            used[c - 1] = True\\n    if ffail == -1:\\n        for i in range(k):\\n            if sum[i] + undef >= arr[i]:\\n                print('Y', end = '')\\n            else:\\n                print('N', end = '')\\n        print()\\n        continue\\n    minu = 10 ** 6\\n    for i in range(k):\\n        if not used[i] and arr[i] - bfail[i] < minu:\\n            minu = arr[i] - bfail[i]\\n            best = i\\n    for i in range(k):\\n        if i == best or undef - minu + sum[i] >= arr[i]:\\n            print('Y', end = '')\\n        elif bfail[i] + ubfail >= arr[i] and not used[i]:\\n            print('Y', end = '')\\n        else:\\n            print('N', end = '')\\n    print()\\n\", \"import sys\\n\\nt = int(input())\\n\\nfor i in range(t):\\n    remove_from_all = 0\\n    input()\\n    m, k = (int(x) for x in input().split())\\n    dishes = [int(x) for x in input().split()]\\n    inputs = []\\n    for j in range(m - 1):\\n        t, r = (int(x) for x in input().split())\\n        inputs.append((t - 1, r))\\n    seen_upset = False\\n    for i, v in enumerate(inputs):\\n        t, r = v\\n        if r == 1 and not seen_upset:\\n            impossible = set()\\n            for j in range(i, len(inputs)):\\n                _t, _r = inputs[j]\\n                impossible.add(_t)\\n            for j in range(len(dishes)):\\n                if dishes[j] > remove_from_all:\\n                    impossible.add(j)\\n            minimal = float(\\\"inf\\\")\\n            for j in range(len(dishes)):\\n                if j not in impossible:\\n                    minimal = min(dishes[j], minimal)\\n                    dishes[j] = 0\\n            remove_from_all -= minimal\\n            seen_upset = True\\n        if t == -1:\\n            remove_from_all += 1\\n        else:\\n            dishes[t] -= 1\\n    for j in dishes:\\n        sys.stdout.write(\\\"Y\\\" if j - remove_from_all <= 0 else \\\"N\\\")\\n    print(\\\"\\\")\\n\", \"def ris():\\n    return map(int, input().split())\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set(filter(lambda x: a[x] <= q, range(k))))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min(map(lambda x: a[x], tmp))\\n    print(\\\"\\\".join(list(map(lambda x: 'Y' if a[x] - q <= 0 or x in tmp else 'N', range(len(a))))))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\", \"t = int(input())\\n\\nfor i in range(t):\\n    input()\\n    m, k = [int(l) for l in input().split()]\\n    a = [int(j) for j in input().split()]\\n    upset = -1\\n    unknown = 0\\n    unknownBeforeUpset = 0\\n    ti, r = [], []\\n    for i1 in range(m-1):\\n        n = input().split()\\n        ti.append(int(n[0]))\\n        r.append(int(n[1]))\\n        ti[i1] -= 1\\n\\n        if r[i1] == 1 and upset == -1:\\n            upset = i1\\n\\n        if ti[i1] != -1:\\n            a[ti[i1]] -= 1\\n        else:\\n            unknown+=1\\n            if upset == -1:\\n                unknownBeforeUpset+=1\\n\\n    st = [\\\"N\\\" for j in range(k)]\\n    if upset == -1:\\n        for j in range(k):\\n            if a[j] <= unknown:\\n                st[j] = \\\"Y\\\"\\n    else:\\n        usedAfter = [False for i in range(k)]\\n        for j in range(upset, m-1):\\n            if ti[j] != -1:\\n                usedAfter[ti[j]] = True\\n        minFirstFinished = -1\\n        for j in range(k):\\n            if not usedAfter[j] and unknownBeforeUpset >= a[j]:\\n                st[j] = 'Y'\\n                if minFirstFinished == -1 or a[minFirstFinished] > a[j]:\\n                    minFirstFinished = j\\n        if minFirstFinished != -1:\\n            restUnknown = unknown - a[minFirstFinished]\\n            for j in range(k):\\n                if a[j] <= restUnknown:\\n                    st[j] = 'Y'\\n\\n    print(\\\"\\\".join(st))\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n\\n    return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef testCase():\\n\\n    m, k = ris()\\n\\n    q = 0\\n\\n    a = list(ris())\\n\\n    some_is_out = False\\n\\n    tmp = set()\\n\\n    for i in range(m - 1):\\n\\n        t, r = ris()\\n\\n        t -= 1\\n\\n        if r == 1 and not some_is_out:\\n\\n            some_is_out = True\\n\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n\\n        if t == -1:\\n\\n            q += 1\\n\\n        else:\\n\\n            if t in tmp:\\n\\n                tmp.remove(t)\\n\\n            a[t] -= 1\\n\\n            if a[t] < 0:\\n\\n                a[t] = 0\\n\\n                q += 1\\n\\n    if tmp:\\n\\n        q -= min([a[x] for x in tmp])\\n\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\n\\n\\n\\nfor i in range(int(input())):\\n\\n    input()\\n\\n    testCase()\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "interview",
        "input": "5\n\n3 3\n1 1 1\n0 0\n0 1\n\n3 3\n1 1 1\n1 0\n2 1\n\n3 3\n1 1 1\n1 0\n0 1\n\n3 3\n1 1 1\n0 0\n1 0\n\n3 3\n1 1 1\n0 0\n1 1\n",
        "output": "YYY\nYYN\nYYY\nYYY\nYYY\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/522/C"
    },
    {
        "id": 461,
        "task_id": 2310,
        "test_case_id": 4,
        "question": "Polycarp is flying in the airplane. Finally, it is his favorite time — the lunchtime. The BerAvia company stewardess is giving food consecutively to all the passengers from the 1-th one to the last one. Polycarp is sitting on seat m, that means, he will be the m-th person to get food.\n\nThe flight menu has k dishes in total and when Polycarp boarded the flight, he had time to count the number of portions of each dish on board. Thus, he knows values a_1, a_2, ..., a_{k}, where a_{i} is the number of portions of the i-th dish.\n\nThe stewardess has already given food to m - 1 passengers, gave Polycarp a polite smile and asked him what he would prefer. That's when Polycarp realized that they might have run out of some dishes by that moment. For some of the m - 1 passengers ahead of him, he noticed what dishes they were given. Besides, he's heard some strange mumbling from some of the m - 1 passengers ahead of him, similar to phrase 'I'm disappointed'. That happened when a passenger asked for some dish but the stewardess gave him a polite smile and said that they had run out of that dish. In that case the passenger needed to choose some other dish that was available. If Polycarp heard no more sounds from a passenger, that meant that the passenger chose his dish at the first try.\n\nHelp Polycarp to find out for each dish: whether they could have run out of the dish by the moment Polyarp was served or that dish was definitely available.\n\n\n-----Input-----\n\nEach test in this problem consists of one or more input sets. First goes a string that contains a single integer t (1 ≤ t ≤ 100 000) — the number of input data sets in the test. Then the sets follow, each set is preceded by an empty line.\n\nThe first line of each set of the input contains integers m, k (2 ≤ m ≤ 100 000, 1 ≤ k ≤ 100 000) — the number of Polycarp's seat and the number of dishes, respectively.\n\nThe second line contains a sequence of k integers a_1, a_2, ..., a_{k} (1 ≤ a_{i} ≤ 100 000), where a_{i} is the initial number of portions of the i-th dish.\n\nThen m - 1 lines follow, each line contains the description of Polycarp's observations about giving food to a passenger sitting in front of him: the j-th line contains a pair of integers t_{j}, r_{j} (0 ≤ t_{j} ≤ k, 0 ≤ r_{j} ≤ 1), where t_{j} is the number of the dish that was given to the j-th passenger (or 0, if Polycarp didn't notice what dish was given to the passenger), and r_{j} — a 1 or a 0, depending on whether the j-th passenger was or wasn't disappointed, respectively.\n\nWe know that sum a_{i} equals at least m, that is,Polycarp will definitely get some dish, even if it is the last thing he wanted. It is guaranteed that the data is consistent.\n\nSum m for all input sets doesn't exceed 100 000. Sum k for all input sets doesn't exceed 100 000.\n\n\n-----Output-----\n\nFor each input set print the answer as a single line. Print a string of k letters \"Y\" or \"N\". Letter \"Y\" in position i should be printed if they could have run out of the i-th dish by the time the stewardess started serving Polycarp.\n\n\n-----Examples-----\nInput\n2\n\n3 4\n2 3 2 1\n1 0\n0 0\n\n5 5\n1 2 1 3 1\n3 0\n0 0\n2 1\n4 0\n\nOutput\nYNNY\nYYYNY\n\n\n\n-----Note-----\n\nIn the first input set depending on the choice of the second passenger the situation could develop in different ways:  If he chose the first dish, then by the moment the stewardess reaches Polycarp, they will have run out of the first dish;  If he chose the fourth dish, then by the moment the stewardess reaches Polycarp, they will have run out of the fourth dish;  Otherwise, Polycarp will be able to choose from any of the four dishes. \n\nThus, the answer is \"YNNY\".\n\nIn the second input set there is, for example, the following possible scenario. First, the first passenger takes the only third dish, then the second passenger takes the second dish. Then, the third passenger asks for the third dish, but it is not available, so he makes disappointed muttering and ends up with the second dish. Then the fourth passenger takes the fourth dish, and Polycarp ends up with the choice between the first, fourth and fifth dish.\n\nLikewise, another possible scenario is when by the time the stewardess comes to Polycarp, they will have run out of either the first or the fifth dish (this can happen if one of these dishes is taken by the second passenger). It is easy to see that there is more than enough of the fourth dish, so Polycarp can always count on it. Thus, the answer is \"YYYNY\".",
        "solutions": "[\"t = int(input())\\nfor i in range(t):\\n    input()\\n    m,k = map(int,input().split())\\n    ak = list(map(int,input().split()))\\n    ak2 = [0]*k\\n    tjrj = [list(map(int,input().split())) for j in range(m-1)]\\n    num = 0\\n    num2 = 0\\n    num3 = 100002\\n    for j in range(m-1):\\n        if num2 == 1 or tjrj[j][1] == 0:\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n        else:\\n            for z in range(k):\\n                    if ak[z] - num < 1:\\n                        ak2[z] = 1\\n            num2 = 1\\n            if tjrj[j][0] != 0:\\n                ak[tjrj[j][0]-1] -= 1\\n            else:\\n                num += 1\\n            for f in range(j,m-1):\\n                if tjrj[f][0] != 0:\\n                    ak2[tjrj[f][0]-1] = 0\\n            for f in range(k):\\n                if ak2[f] == 1:\\n                    if num3 > ak[f]:\\n                        num3 = ak[f]\\n            num -= num3\\n    for z in range(k):\\n        if ak[z] - num < 1 or ak2[z] == 1:\\n            print(\\\"Y\\\",end=\\\"\\\")\\n        else:\\n            print(\\\"N\\\",end=\\\"\\\")\\n    print()\\n\", \"import sys\\n\\ntest_count = int(sys.stdin.readline())\\nfor test in range(test_count):\\n    sys.stdin.readline()\\n    m, k = list(map(int, sys.stdin.readline().split()))\\n    counts = list(map(int, sys.stdin.readline().split()))\\n    took = []\\n    unhappy = []\\n    for i in range(m - 1):\\n        t, r = list(map(int, sys.stdin.readline().split()))\\n        t -= 1 # -1 means unknown\\n        took.append(t)\\n        unhappy.append(r)\\n\\n    took_in_total = [0 for dish_count in counts]\\n    for i in range(m - 1):\\n        if took[i] != -1:\\n            took_in_total[took[i]] += 1\\n\\n    took_already = [0 for dish_count in counts]\\n    left = [dish_count for dish_count in counts]\\n    answer = [False for dish_count in counts]\\n    unknown = 0\\n    all_present = True\\n    for i in range(m - 1):\\n        if unhappy[i] == 1 and all_present:\\n            could_exhaust = []\\n            for j in range(k):\\n                if took_already[j] < took_in_total[j]:\\n                    continue\\n                if left[j] > unknown:\\n                    continue\\n                could_exhaust.append(j)\\n\\n            if len(could_exhaust) == 0:\\n                raise AssertionError\\n\\n            for j in could_exhaust:\\n                answer[j] = True\\n\\n            unknown -= min([left[j] for j in could_exhaust])\\n            all_present = False\\n\\n        if took[i] != -1:\\n            left[took[i]] -= 1\\n            took_already[took[i]] += 1\\n            if left[took[i]] == 0:\\n                all_present = False\\n        else:\\n            unknown += 1\\n\\n    for j in range(k):\\n        if left[j] <= unknown:\\n            answer[j] = True\\n\\n    sys.stdout.write(\\n        ''.join(['Y' if x else 'N' for x in answer]) + '\\\\n'\\n    )\\n\", \"n=int(input())\\nfor i in range(n):\\n    input().strip()\\n    q,w=map(int,input().strip().split())\\n    kol=list(map(int,input().strip().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,input().strip().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    print(''.join(map(lambda x:'Y' if x else 'N',rez)))\", \"import sys\\nn=int(input())\\nfor i in range(n):\\n    sys.stdin.readline()\\n    q,w=map(int,sys.stdin.readline().split())\\n    kol=list(map(int,sys.stdin.readline().split()))\\n    r=[]\\n    e=[]\\n    for ii in range(q-1):\\n        a,s=map(int,sys.stdin.readline().split())\\n        a-=1\\n        r.append(a)\\n        e.append(s)\\n    rw=[0 for uu in kol]\\n    for ii in range(q-1):\\n        if r[ii]!=-1:\\n            rw[r[ii]]+=1\\n    nd=[0 for uu in kol]\\n    l=[uu for uu in kol]\\n    rez=[False for uu in kol]\\n    qw=0\\n    tr=True\\n    for ii in range(q-1):\\n        if e[ii]==1 and tr:\\n            su=[]\\n            for iii in range(w):\\n                if nd[iii]<rw[iii]:\\n                    continue\\n                if l[iii]>qw:\\n                    continue\\n                su.append(iii)\\n            if len(su)==0:\\n                raise AssertionError\\n            for iii in su:\\n                rez[iii]=True\\n            qw-=min(map(lambda iii:l[iii],su))\\n            tr=False\\n        if r[ii]!=-1:\\n            l[r[ii]]-=1\\n            nd[r[ii]]+=1\\n            if l[r[ii]]==0:\\n                tr=False\\n        else:\\n            qw+=1\\n    for iii in range(w):\\n        if l[iii]<=qw:\\n            rez[iii]=True\\n    sys.stdout.write(''.join(map(lambda x:'Y' if x else 'N',rez))+'\\\\n')\", \"t = int(input())\\nfor j in range(t):\\n    e = input()\\n    m, k = map(int, input().split())\\n    arr = [int(i) for i in input().split()]\\n    sum, bfail = [0] * k, [0] * k\\n    ffail, undef = -1, 0\\n    used = [False] * k\\n    ubfail = 0\\n    for i in range(m - 1):\\n        c, ns = map(int, input().split())\\n        if c == 0:\\n            undef += 1\\n            if ns == 0 and ffail == -1:\\n                ubfail += 1\\n        else:\\n            sum[c - 1] += 1\\n            if ns == 0 and ffail == -1:\\n                bfail[c - 1] += 1\\n        if ns and ffail == -1:\\n            ffail = i\\n        if ffail != -1 and c > 0:\\n            used[c - 1] = True\\n    if ffail == -1:\\n        for i in range(k):\\n            if sum[i] + undef >= arr[i]:\\n                print('Y', end = '')\\n            else:\\n                print('N', end = '')\\n        print()\\n        continue\\n    minu = 10 ** 6\\n    for i in range(k):\\n        if not used[i] and arr[i] - bfail[i] < minu:\\n            minu = arr[i] - bfail[i]\\n            best = i\\n    for i in range(k):\\n        if i == best or undef - minu + sum[i] >= arr[i]:\\n            print('Y', end = '')\\n        elif bfail[i] + ubfail >= arr[i] and not used[i]:\\n            print('Y', end = '')\\n        else:\\n            print('N', end = '')\\n    print()\\n\", \"import sys\\n\\nt = int(input())\\n\\nfor i in range(t):\\n    remove_from_all = 0\\n    input()\\n    m, k = (int(x) for x in input().split())\\n    dishes = [int(x) for x in input().split()]\\n    inputs = []\\n    for j in range(m - 1):\\n        t, r = (int(x) for x in input().split())\\n        inputs.append((t - 1, r))\\n    seen_upset = False\\n    for i, v in enumerate(inputs):\\n        t, r = v\\n        if r == 1 and not seen_upset:\\n            impossible = set()\\n            for j in range(i, len(inputs)):\\n                _t, _r = inputs[j]\\n                impossible.add(_t)\\n            for j in range(len(dishes)):\\n                if dishes[j] > remove_from_all:\\n                    impossible.add(j)\\n            minimal = float(\\\"inf\\\")\\n            for j in range(len(dishes)):\\n                if j not in impossible:\\n                    minimal = min(dishes[j], minimal)\\n                    dishes[j] = 0\\n            remove_from_all -= minimal\\n            seen_upset = True\\n        if t == -1:\\n            remove_from_all += 1\\n        else:\\n            dishes[t] -= 1\\n    for j in dishes:\\n        sys.stdout.write(\\\"Y\\\" if j - remove_from_all <= 0 else \\\"N\\\")\\n    print(\\\"\\\")\\n\", \"def ris():\\n    return map(int, input().split())\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set(filter(lambda x: a[x] <= q, range(k))))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min(map(lambda x: a[x], tmp))\\n    print(\\\"\\\".join(list(map(lambda x: 'Y' if a[x] - q <= 0 or x in tmp else 'N', range(len(a))))))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\", \"t = int(input())\\n\\nfor i in range(t):\\n    input()\\n    m, k = [int(l) for l in input().split()]\\n    a = [int(j) for j in input().split()]\\n    upset = -1\\n    unknown = 0\\n    unknownBeforeUpset = 0\\n    ti, r = [], []\\n    for i1 in range(m-1):\\n        n = input().split()\\n        ti.append(int(n[0]))\\n        r.append(int(n[1]))\\n        ti[i1] -= 1\\n\\n        if r[i1] == 1 and upset == -1:\\n            upset = i1\\n\\n        if ti[i1] != -1:\\n            a[ti[i1]] -= 1\\n        else:\\n            unknown+=1\\n            if upset == -1:\\n                unknownBeforeUpset+=1\\n\\n    st = [\\\"N\\\" for j in range(k)]\\n    if upset == -1:\\n        for j in range(k):\\n            if a[j] <= unknown:\\n                st[j] = \\\"Y\\\"\\n    else:\\n        usedAfter = [False for i in range(k)]\\n        for j in range(upset, m-1):\\n            if ti[j] != -1:\\n                usedAfter[ti[j]] = True\\n        minFirstFinished = -1\\n        for j in range(k):\\n            if not usedAfter[j] and unknownBeforeUpset >= a[j]:\\n                st[j] = 'Y'\\n                if minFirstFinished == -1 or a[minFirstFinished] > a[j]:\\n                    minFirstFinished = j\\n        if minFirstFinished != -1:\\n            restUnknown = unknown - a[minFirstFinished]\\n            for j in range(k):\\n                if a[j] <= restUnknown:\\n                    st[j] = 'Y'\\n\\n    print(\\\"\\\".join(st))\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n    return list(map(int, input().split()))\\n\\n\\ndef testCase():\\n    m, k = ris()\\n    q = 0\\n    a = list(ris())\\n    some_is_out = False\\n    tmp = set()\\n    for i in range(m - 1):\\n        t, r = ris()\\n        t -= 1\\n        if r == 1 and not some_is_out:\\n            some_is_out = True\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n        if t == -1:\\n            q += 1\\n        else:\\n            if t in tmp:\\n                tmp.remove(t)\\n            a[t] -= 1\\n            if a[t] < 0:\\n                a[t] = 0\\n                q += 1\\n    if tmp:\\n        q -= min([a[x] for x in tmp])\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\nfor i in range(int(input())):\\n    input()\\n    testCase()\\n\", \"def ris():\\n\\n    return list(map(int, input().split()))\\n\\n\\n\\n\\n\\ndef testCase():\\n\\n    m, k = ris()\\n\\n    q = 0\\n\\n    a = list(ris())\\n\\n    some_is_out = False\\n\\n    tmp = set()\\n\\n    for i in range(m - 1):\\n\\n        t, r = ris()\\n\\n        t -= 1\\n\\n        if r == 1 and not some_is_out:\\n\\n            some_is_out = True\\n\\n            tmp = tmp.union(set([x for x in range(k) if a[x] <= q]))\\n\\n        if t == -1:\\n\\n            q += 1\\n\\n        else:\\n\\n            if t in tmp:\\n\\n                tmp.remove(t)\\n\\n            a[t] -= 1\\n\\n            if a[t] < 0:\\n\\n                a[t] = 0\\n\\n                q += 1\\n\\n    if tmp:\\n\\n        q -= min([a[x] for x in tmp])\\n\\n    print(\\\"\\\".join(list(['Y' if a[x] - q <= 0 or x in tmp else 'N' for x in range(len(a))])))\\n\\n\\n\\n\\n\\nfor i in range(int(input())):\\n\\n    input()\\n\\n    testCase()\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "interview",
        "input": "1\n\n4 2\n2 2\n0 0\n0 0\n1 1\n",
        "output": "NY\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/522/C"
    },
    {
        "id": 462,
        "task_id": 3498,
        "test_case_id": 1,
        "question": "Real-time software in the Mars Pathfinder spacecraft suffered from an issue known as priority inversion. One technique to address this issue is to use the Priority Ceiling Protocol.\n\nIn this problem, you will simulate the execution of multiple tasks according to this protocol. The tasks share a collection of resources, each of which can be used by only one task at a time. To ensure this, resources must be locked before use and unlocked after use. Each task is defined by a start time, a unique base priority, and a sequence of instructions. Each task also has a current priority, which may change during execution. Instructions come in three types:\n - compute – perform a computation for one microsecond\n - lock $k$ – lock resource $k$ (which takes no processor time)\n - unlock $k$ – unlock resource $k$ (which takes no processor time)\n\nAfter locking a resource, a task is said to own the resource until the task unlocks it. A task will unlock only the owned resource it most recently locked, will not lock a resource it already owns, and will complete with no owned resources.\n\nEach resource has a fixed priority ceiling, which is the highest base priority of any task that contains an instruction to lock that resource.\n\nThere is a single processor that executes the tasks. When the processor starts, it initializes its clock to zero and then runs an infinite loop with the following steps:Step 1.\n\nIdentify running tasks. A task is running if its start time is less than or equal to the current processor clock and not all of its instructions have been executed.Step 2.\n\nDetermine the current priorities of the running tasks and which of the running tasks are blocked. A running task $T$ is blocked if the next instruction in $T$ is to lock resource $k$ and either resource $k$ is already owned or at least one other task owns a resource $\\ell $ whose priority ceiling is greater than or equal to the current priority of $T$. If $T$ is blocked, it is said to be blocked by every task owning such $k$ or $\\ell $. The current priority of a task $T$ is the maximum of $T$’s base priority and the current priorities of all tasks that $T$ blocks.Step 3.\n\nExecute the next instruction of the non-blocked running task (if any) with the highest current priority. If there was no such task or if a compute instruction was executed, increment the processor clock by one microsecond. If a lock or unlock instruction was executed, do not increment the clock.\n\nThe Priority Ceiling Protocol defined above has the following properties:\n - Current priority is defined in terms of current priority and blocking, and blocking is defined in terms of current priority. While this may appear circular, there will always be a unique set of current priorities that satisfy the definitions.\n - All tasks will eventually complete.\n - There will never be a tie in step 3.\n\n-----Input-----\nThe first line of the input contains two integers $t$ $(1 \\leq t \\leq 20)$, which is the number of tasks, and $r$ ($1 \\leq r \\leq 20$), which is the number of resources. This is followed by $t$ lines, where the $i^\\text {th}$ of these lines describes task $i$. The description of a task begins with three integers: the task’s start time $s$ ($1 \\leq s \\leq 10000$), its base priority $b$ ($1 \\leq b \\leq t$), and an integer $a$ ($1 \\leq a \\leq 100$). A task description is concluded by a sequence of $a$ strings describing the instructions. Each string is a letter (C or L or U) followed by an integer. The string C$n$ ($1 \\leq n \\leq 100$) indicates a sequence of $n$ compute instructions. The strings L$k$ and U$k$ ($1 \\leq k \\leq r$) indicate instructions locking and unlocking resource $k$ respectively.\n\nNo two tasks have the same base priority.\n\n-----Output-----\nFor each task, display the time it completes execution, in the same order that the tasks are given in the input.\n\n-----Examples-----\nSample Input:\n3 1\n50 2 5 C1 L1 C1 U1 C1\n1 1 5 C1 L1 C100 U1 C1\n70 3 1 C1\nSample Output:\n106\n107\n71",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1\n50 2 5 C1 L1 C1 U1 C1\n1 1 5 C1 L1 C100 U1 C1\n70 3 1 C1\n",
        "output": "106\n107\n71\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/mars"
    },
    {
        "id": 463,
        "task_id": 4939,
        "test_case_id": 2,
        "question": "Daenerys frequently invents games to help teach her second grade Computer Science class about various aspects of the discipline. For this week’s lesson she has the children form a circle and (carefully) throw around a petrified dragon egg.\n\nThe $n$ children are numbered from $0$ to $n - 1$ (it is a Computer Science class after all) clockwise around the circle. Child $0$ always starts with the egg. Daenerys will call out one of two things:\n - a number $t$, indicating that the egg is to be thrown to the child who is $t$ positions clockwise from the current egg holder, wrapping around if necessary. If $t$ is negative, then the throw is to the counter-clockwise direction.\n - the phrase undo $m$, indicating that the last $m$ throws should be undone. Note that undo commands never undo other undo commands; they just undo commands described in item $1$ above.\n\nFor example, if there are $5$ children, and the teacher calls out the four throw commands 8 -2 3 undo 2, the throws will start from child $0$ to child $3$, then from child $3$ to child $1$, then from child $1$ to child $4$. After this, the undo 2 instructions will result in the egg being thrown back from child $4$ to child $1$ and then from child $1$ back to child $3$. If Daenerys calls out $0$ (or $n, -n, 2n, -2n$, etc.) then the child with the egg simply throws it straight up in the air and (carefully) catches it again.\n\nDaenerys would like a little program that determines where the egg should end up if her commands are executed correctly. Don’t ask what happens to the children if this isn’t the case.\n\n-----Input-----\nInput consists of two lines. The first line contains two positive integers $n$$k$ ($1\\leq n \\leq 30$, $1 \\leq k \\leq 100$) indicating the number of students and how many throw commands Daenerys calls out, respectively. The following line contains the $k$ throw commands. Each command is either an integer $p$ ($-10000 \\leq p \\leq 10000$) indicating how many positions to throw the egg clockwise or undo $m$ ($m \\geq 1$) indicating that the last $m$ throws should be undone. Daenerys never has the kids undo beyond the start of the game.\n\n-----Output-----\nDisplay the number of the child with the egg at the end of the game.\n\n-----Examples-----\nSample Input:\n5 4\n8 -2 3 undo 2\nSample Output:\n3",
        "solutions": "",
        "difficulty": "introductory",
        "input": "5 10\n7 -3 undo 1 4 3 -9 5 undo 2 undo 1 6\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/throwns"
    },
    {
        "id": 464,
        "task_id": 2529,
        "test_case_id": 1,
        "question": "Pooja would like to withdraw X $US from an ATM. The cash machine will only accept the transaction if X is a multiple of 5, and Pooja's account balance has enough cash to perform the withdrawal transaction (including bank charges).  For each successful withdrawal the bank charges 0.50 $US.\n\nCalculate Pooja's account balance after an attempted transaction.  \n\n-----Input-----\nPositive integer 0 < X <= 2000 - the amount of cash which Pooja wishes to withdraw.\n\nNonnegative number 0<= Y <= 2000 with two digits of precision - Pooja's initial account balance.\n\n-----Output-----\nOutput the account balance after the attempted transaction, given as a number with two digits of precision.  If there is not enough money in the account to complete the transaction, output the current bank balance.\n\n-----Example - Successful Transaction-----\nInput:\n30 120.00\n\nOutput:\n89.50\n\n-----Example - Incorrect Withdrawal Amount (not multiple of 5)-----\nInput:\n42 120.00\n\nOutput:\n120.00\n\n-----Example - Insufficient Funds-----\nInput:\n300 120.00\n\nOutput:\n120.00",
        "solutions": "[\"x = list(map(float, input(\\\" \\\").split()))\\r\\namount=int(x[0])\\r\\nbal=float(x[1])\\r\\nif amount+0.5 > bal or amount % 5 != 0:\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\nelse:\\r\\n    bal = bal - amount-0.5\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\n\\r\\n\", \"x = list(map(float, input(\\\" \\\").split()))\\r\\namount=int(x[0])\\r\\nbal=float(x[1])\\r\\nif amount+0.5 > bal or amount % 5 != 0:\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\nelse:\\r\\n    bal = bal - amount-0.5\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\n\\r\\n\", \"# cook your dish here\\ninputs=input().split()\\namount=int(inputs[0])\\naccount=float(inputs[1])\\nif amount%5==0 and account>=amount+0.50:\\n    balance=account-amount-0.50\\n    print('%.2f'%balance)\\nelse:\\n    print('%.2f'%account)\", \"# cook your dish here\\n\\nx, y = input().split()\\nx=int(x)\\ny=float(y)\\n\\nif x%5==0 and y-x>=0.5 :\\n    y = y - x - 0.5\\nprint(y)\", \"# cook your dish here\\nreq, total = map(float, input().split())\\nans = total\\nif req >= total:\\n    ans = total\\nelif req % 5 != 0:\\n    ans = total\\nelse:\\n    ans = total - req - 0.5\\nans = total if ans < 0 else ans \\nprint(ans)\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif (x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint(('%.2f'%(bal)))# cook your dish here\\n\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif (x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint(('%.2f'%(bal)))# cook your dish here\\n\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5 == 0 and y-x>=0.5:\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%(bal))\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5 == 0 and y-x>=0.5:\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%bal)\", \"x,y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5==0 and y>=x+0.5:\\r\\n\\tbal = y-x-0.5\\r\\n\\t\\r\\nelse:\\r\\n\\tbal = y\\r\\n\\t\\r\\nprint('%.2f'%bal)\\r\\n\\r\\n\", \"x,y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5==0 and y-x>=0.5:\\r\\n\\tbal = y-x-0.5\\r\\n\\t\\r\\nelse:\\r\\n\\tbal = y\\r\\n\\t\\r\\nprint('%.2f'%bal)\\r\\n\\r\\n\", \"\\r\\namount, balance=list(map(float,input().strip().split()))\\r\\nif balance>=amount+0.50 and amount%5==0 and amount!=0:\\r\\n    final=balance-amount-0.5\\r\\n    print(\\\"{0:.2f}\\\".format(final))\\r\\n\\r\\nelse:\\r\\n    print(\\\"{0:.2f}\\\".format(balance))\\r\\n\\r\\n#a,b = map(float,input().strip().split())\\r\\n#if a%5==0 and b>=a+0.50:\\r\\n #   print(\\\"{:.2f}\\\".format(b-a-0.50))\\r\\n#else:\\r\\n #   print(\\\"{:.2f}\\\".format(b))\\n\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif(x%5 == 0 and y-x>=0.5):\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%bal)\", \"\\r\\namount, balance=list(map(float,input().strip().split()))\\r\\nif balance>=amount+0.50 and amount%5==0 and amount!=0:\\r\\n    final=balance-amount-0.5\\r\\n    print(\\\"{0:.2f}\\\".format(final))\\r\\n\\r\\nelse:\\r\\n    print(\\\"{0:.2f}\\\".format(balance))\\r\\n\\r\\n#a,b = map(float,input().strip().split())\\r\\n#if a%5==0 and b>=a+0.50:\\r\\n #   print(\\\"{:.2f}\\\".format(b-a-0.50))\\r\\n#else:\\r\\n #   print(\\\"{:.2f}\\\".format(b))\\n\", \"# cook your dish here\\namount,balance=list(map(float,input().split()))\\nif(amount+0.5<=balance):\\n    if(amount%5==0):\\n        print(balance-amount-0.5)\\n    else:\\n        print(balance)\\nelse:\\n    print(balance)\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif(x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint('%.2f'%bal)\\n\", \"a,b = map(float,input().strip().split())\\nif a%5==0 and b>=a+0.50:\\n    print(\\\"{:.2f}\\\".format(b-a-0.50))\\nelse:\\n    print(\\\"{:.2f}\\\".format(b))\", \"# cook your dish here\\r\\nx,y= map(float,input().split())\\r\\nif(x%5==0 ):\\r\\n    x=x+0.5\\r\\n    if(x<=y):\\r\\n        y=y-x\\r\\nprint(\\\"%.2f\\\"%y)\", \"a,b = map(float,input().strip().split())\\nif a%5==0 and b>=a+0.50:\\n    print(\\\"{:.2f}\\\".format(b-a-0.50))\\nelse:\\n    print(\\\"{:.2f}\\\".format(b))\", \"try:\\n    a,b = map(float,input().strip().split())\\n    if a%5==0 and b>=a+0.50:\\n        print(\\\"{:.2f}\\\".format(b-a-0.50))\\n    else:\\n        print(\\\"{:.2f}\\\".format(b))\\nexcept:\\n    pass\", \"wd,bal=map(float,input().split())\\nif wd%5==0 and wd+0.50<=bal:\\n    bal=bal-wd-0.5\\n    print(f'{bal:.2f}')\\nelse:\\n    print(f'{bal:.2f}')\", \"wd,bal=map(float,input().split())\\nif(wd%5==0 and wd+0.50<=bal):\\n    bal=bal-wd-0.5\\n    print(f'{bal:.2f}')\\nelse:\\n    print(f'{bal:.2f}')\", \"a, b = map(float,input().split())\\nif a%5 == 0:\\n    if (a+0.50)<=b:\\n      b=b-(a+0.50)\\nprint(b)\", \"\\n\\nx,y= map(float,input().split())\\nif(x%5==0):\\n    x=x+0.5\\n    if(x<=y):\\n        y=y-x\\nprint(y)\", \"# cook your dish here\\n\\nx,y= map(float,input().split())\\nif(x%5==0):\\n    x=x+0.5\\n    if(x<=y):\\n        y=y-x\\nprint(y)\"]",
        "difficulty": "interview",
        "input": [
            "30 120.00",
            "",
            ""
        ],
        "output": [
            "89.50"
        ],
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://www.codechef.com/problems/ATM"
    },
    {
        "id": 465,
        "task_id": 2529,
        "test_case_id": 2,
        "question": "Pooja would like to withdraw X $US from an ATM. The cash machine will only accept the transaction if X is a multiple of 5, and Pooja's account balance has enough cash to perform the withdrawal transaction (including bank charges).  For each successful withdrawal the bank charges 0.50 $US.\n\nCalculate Pooja's account balance after an attempted transaction.  \n\n-----Input-----\nPositive integer 0 < X <= 2000 - the amount of cash which Pooja wishes to withdraw.\n\nNonnegative number 0<= Y <= 2000 with two digits of precision - Pooja's initial account balance.\n\n-----Output-----\nOutput the account balance after the attempted transaction, given as a number with two digits of precision.  If there is not enough money in the account to complete the transaction, output the current bank balance.\n\n-----Example - Successful Transaction-----\nInput:\n30 120.00\n\nOutput:\n89.50\n\n-----Example - Incorrect Withdrawal Amount (not multiple of 5)-----\nInput:\n42 120.00\n\nOutput:\n120.00\n\n-----Example - Insufficient Funds-----\nInput:\n300 120.00\n\nOutput:\n120.00",
        "solutions": "[\"x = list(map(float, input(\\\" \\\").split()))\\r\\namount=int(x[0])\\r\\nbal=float(x[1])\\r\\nif amount+0.5 > bal or amount % 5 != 0:\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\nelse:\\r\\n    bal = bal - amount-0.5\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\n\\r\\n\", \"x = list(map(float, input(\\\" \\\").split()))\\r\\namount=int(x[0])\\r\\nbal=float(x[1])\\r\\nif amount+0.5 > bal or amount % 5 != 0:\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\nelse:\\r\\n    bal = bal - amount-0.5\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\n\\r\\n\", \"# cook your dish here\\ninputs=input().split()\\namount=int(inputs[0])\\naccount=float(inputs[1])\\nif amount%5==0 and account>=amount+0.50:\\n    balance=account-amount-0.50\\n    print('%.2f'%balance)\\nelse:\\n    print('%.2f'%account)\", \"# cook your dish here\\n\\nx, y = input().split()\\nx=int(x)\\ny=float(y)\\n\\nif x%5==0 and y-x>=0.5 :\\n    y = y - x - 0.5\\nprint(y)\", \"# cook your dish here\\nreq, total = map(float, input().split())\\nans = total\\nif req >= total:\\n    ans = total\\nelif req % 5 != 0:\\n    ans = total\\nelse:\\n    ans = total - req - 0.5\\nans = total if ans < 0 else ans \\nprint(ans)\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif (x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint(('%.2f'%(bal)))# cook your dish here\\n\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif (x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint(('%.2f'%(bal)))# cook your dish here\\n\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5 == 0 and y-x>=0.5:\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%(bal))\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5 == 0 and y-x>=0.5:\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%bal)\", \"x,y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5==0 and y>=x+0.5:\\r\\n\\tbal = y-x-0.5\\r\\n\\t\\r\\nelse:\\r\\n\\tbal = y\\r\\n\\t\\r\\nprint('%.2f'%bal)\\r\\n\\r\\n\", \"x,y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5==0 and y-x>=0.5:\\r\\n\\tbal = y-x-0.5\\r\\n\\t\\r\\nelse:\\r\\n\\tbal = y\\r\\n\\t\\r\\nprint('%.2f'%bal)\\r\\n\\r\\n\", \"\\r\\namount, balance=list(map(float,input().strip().split()))\\r\\nif balance>=amount+0.50 and amount%5==0 and amount!=0:\\r\\n    final=balance-amount-0.5\\r\\n    print(\\\"{0:.2f}\\\".format(final))\\r\\n\\r\\nelse:\\r\\n    print(\\\"{0:.2f}\\\".format(balance))\\r\\n\\r\\n#a,b = map(float,input().strip().split())\\r\\n#if a%5==0 and b>=a+0.50:\\r\\n #   print(\\\"{:.2f}\\\".format(b-a-0.50))\\r\\n#else:\\r\\n #   print(\\\"{:.2f}\\\".format(b))\\n\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif(x%5 == 0 and y-x>=0.5):\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%bal)\", \"\\r\\namount, balance=list(map(float,input().strip().split()))\\r\\nif balance>=amount+0.50 and amount%5==0 and amount!=0:\\r\\n    final=balance-amount-0.5\\r\\n    print(\\\"{0:.2f}\\\".format(final))\\r\\n\\r\\nelse:\\r\\n    print(\\\"{0:.2f}\\\".format(balance))\\r\\n\\r\\n#a,b = map(float,input().strip().split())\\r\\n#if a%5==0 and b>=a+0.50:\\r\\n #   print(\\\"{:.2f}\\\".format(b-a-0.50))\\r\\n#else:\\r\\n #   print(\\\"{:.2f}\\\".format(b))\\n\", \"# cook your dish here\\namount,balance=list(map(float,input().split()))\\nif(amount+0.5<=balance):\\n    if(amount%5==0):\\n        print(balance-amount-0.5)\\n    else:\\n        print(balance)\\nelse:\\n    print(balance)\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif(x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint('%.2f'%bal)\\n\", \"a,b = map(float,input().strip().split())\\nif a%5==0 and b>=a+0.50:\\n    print(\\\"{:.2f}\\\".format(b-a-0.50))\\nelse:\\n    print(\\\"{:.2f}\\\".format(b))\", \"# cook your dish here\\r\\nx,y= map(float,input().split())\\r\\nif(x%5==0 ):\\r\\n    x=x+0.5\\r\\n    if(x<=y):\\r\\n        y=y-x\\r\\nprint(\\\"%.2f\\\"%y)\", \"a,b = map(float,input().strip().split())\\nif a%5==0 and b>=a+0.50:\\n    print(\\\"{:.2f}\\\".format(b-a-0.50))\\nelse:\\n    print(\\\"{:.2f}\\\".format(b))\", \"try:\\n    a,b = map(float,input().strip().split())\\n    if a%5==0 and b>=a+0.50:\\n        print(\\\"{:.2f}\\\".format(b-a-0.50))\\n    else:\\n        print(\\\"{:.2f}\\\".format(b))\\nexcept:\\n    pass\", \"wd,bal=map(float,input().split())\\nif wd%5==0 and wd+0.50<=bal:\\n    bal=bal-wd-0.5\\n    print(f'{bal:.2f}')\\nelse:\\n    print(f'{bal:.2f}')\", \"wd,bal=map(float,input().split())\\nif(wd%5==0 and wd+0.50<=bal):\\n    bal=bal-wd-0.5\\n    print(f'{bal:.2f}')\\nelse:\\n    print(f'{bal:.2f}')\", \"a, b = map(float,input().split())\\nif a%5 == 0:\\n    if (a+0.50)<=b:\\n      b=b-(a+0.50)\\nprint(b)\", \"\\n\\nx,y= map(float,input().split())\\nif(x%5==0):\\n    x=x+0.5\\n    if(x<=y):\\n        y=y-x\\nprint(y)\", \"# cook your dish here\\n\\nx,y= map(float,input().split())\\nif(x%5==0):\\n    x=x+0.5\\n    if(x<=y):\\n        y=y-x\\nprint(y)\"]",
        "difficulty": "interview",
        "input": [
            "42 120.00",
            "",
            ""
        ],
        "output": [
            "120.00"
        ],
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://www.codechef.com/problems/ATM"
    },
    {
        "id": 466,
        "task_id": 2529,
        "test_case_id": 3,
        "question": "Pooja would like to withdraw X $US from an ATM. The cash machine will only accept the transaction if X is a multiple of 5, and Pooja's account balance has enough cash to perform the withdrawal transaction (including bank charges).  For each successful withdrawal the bank charges 0.50 $US.\n\nCalculate Pooja's account balance after an attempted transaction.  \n\n-----Input-----\nPositive integer 0 < X <= 2000 - the amount of cash which Pooja wishes to withdraw.\n\nNonnegative number 0<= Y <= 2000 with two digits of precision - Pooja's initial account balance.\n\n-----Output-----\nOutput the account balance after the attempted transaction, given as a number with two digits of precision.  If there is not enough money in the account to complete the transaction, output the current bank balance.\n\n-----Example - Successful Transaction-----\nInput:\n30 120.00\n\nOutput:\n89.50\n\n-----Example - Incorrect Withdrawal Amount (not multiple of 5)-----\nInput:\n42 120.00\n\nOutput:\n120.00\n\n-----Example - Insufficient Funds-----\nInput:\n300 120.00\n\nOutput:\n120.00",
        "solutions": "[\"x = list(map(float, input(\\\" \\\").split()))\\r\\namount=int(x[0])\\r\\nbal=float(x[1])\\r\\nif amount+0.5 > bal or amount % 5 != 0:\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\nelse:\\r\\n    bal = bal - amount-0.5\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\n\\r\\n\", \"x = list(map(float, input(\\\" \\\").split()))\\r\\namount=int(x[0])\\r\\nbal=float(x[1])\\r\\nif amount+0.5 > bal or amount % 5 != 0:\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\nelse:\\r\\n    bal = bal - amount-0.5\\r\\n    print(\\\"{:.2f}\\\".format(bal))\\r\\n\\r\\n\", \"# cook your dish here\\ninputs=input().split()\\namount=int(inputs[0])\\naccount=float(inputs[1])\\nif amount%5==0 and account>=amount+0.50:\\n    balance=account-amount-0.50\\n    print('%.2f'%balance)\\nelse:\\n    print('%.2f'%account)\", \"# cook your dish here\\n\\nx, y = input().split()\\nx=int(x)\\ny=float(y)\\n\\nif x%5==0 and y-x>=0.5 :\\n    y = y - x - 0.5\\nprint(y)\", \"# cook your dish here\\nreq, total = map(float, input().split())\\nans = total\\nif req >= total:\\n    ans = total\\nelif req % 5 != 0:\\n    ans = total\\nelse:\\n    ans = total - req - 0.5\\nans = total if ans < 0 else ans \\nprint(ans)\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif (x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint(('%.2f'%(bal)))# cook your dish here\\n\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif (x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint(('%.2f'%(bal)))# cook your dish here\\n\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5 == 0 and y-x>=0.5:\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%(bal))\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5 == 0 and y-x>=0.5:\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%bal)\", \"x,y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5==0 and y>=x+0.5:\\r\\n\\tbal = y-x-0.5\\r\\n\\t\\r\\nelse:\\r\\n\\tbal = y\\r\\n\\t\\r\\nprint('%.2f'%bal)\\r\\n\\r\\n\", \"x,y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif x%5==0 and y-x>=0.5:\\r\\n\\tbal = y-x-0.5\\r\\n\\t\\r\\nelse:\\r\\n\\tbal = y\\r\\n\\t\\r\\nprint('%.2f'%bal)\\r\\n\\r\\n\", \"\\r\\namount, balance=list(map(float,input().strip().split()))\\r\\nif balance>=amount+0.50 and amount%5==0 and amount!=0:\\r\\n    final=balance-amount-0.5\\r\\n    print(\\\"{0:.2f}\\\".format(final))\\r\\n\\r\\nelse:\\r\\n    print(\\\"{0:.2f}\\\".format(balance))\\r\\n\\r\\n#a,b = map(float,input().strip().split())\\r\\n#if a%5==0 and b>=a+0.50:\\r\\n #   print(\\\"{:.2f}\\\".format(b-a-0.50))\\r\\n#else:\\r\\n #   print(\\\"{:.2f}\\\".format(b))\\n\", \"x, y = input().split()\\r\\nx=int(x)\\r\\ny=float(y)\\r\\nif(x%5 == 0 and y-x>=0.5):\\r\\n    bal = y-x-0.5\\r\\nelse:\\r\\n    bal = y\\r\\nprint('%.2f'%bal)\", \"\\r\\namount, balance=list(map(float,input().strip().split()))\\r\\nif balance>=amount+0.50 and amount%5==0 and amount!=0:\\r\\n    final=balance-amount-0.5\\r\\n    print(\\\"{0:.2f}\\\".format(final))\\r\\n\\r\\nelse:\\r\\n    print(\\\"{0:.2f}\\\".format(balance))\\r\\n\\r\\n#a,b = map(float,input().strip().split())\\r\\n#if a%5==0 and b>=a+0.50:\\r\\n #   print(\\\"{:.2f}\\\".format(b-a-0.50))\\r\\n#else:\\r\\n #   print(\\\"{:.2f}\\\".format(b))\\n\", \"# cook your dish here\\namount,balance=list(map(float,input().split()))\\nif(amount+0.5<=balance):\\n    if(amount%5==0):\\n        print(balance-amount-0.5)\\n    else:\\n        print(balance)\\nelse:\\n    print(balance)\", \"x, y = input().split()\\nx=int(x)\\ny=float(y)\\nif(x%5 == 0 and y-x>=0.5):\\n    bal = y-x-0.5\\nelse:\\n    bal = y\\nprint('%.2f'%bal)\\n\", \"a,b = map(float,input().strip().split())\\nif a%5==0 and b>=a+0.50:\\n    print(\\\"{:.2f}\\\".format(b-a-0.50))\\nelse:\\n    print(\\\"{:.2f}\\\".format(b))\", \"# cook your dish here\\r\\nx,y= map(float,input().split())\\r\\nif(x%5==0 ):\\r\\n    x=x+0.5\\r\\n    if(x<=y):\\r\\n        y=y-x\\r\\nprint(\\\"%.2f\\\"%y)\", \"a,b = map(float,input().strip().split())\\nif a%5==0 and b>=a+0.50:\\n    print(\\\"{:.2f}\\\".format(b-a-0.50))\\nelse:\\n    print(\\\"{:.2f}\\\".format(b))\", \"try:\\n    a,b = map(float,input().strip().split())\\n    if a%5==0 and b>=a+0.50:\\n        print(\\\"{:.2f}\\\".format(b-a-0.50))\\n    else:\\n        print(\\\"{:.2f}\\\".format(b))\\nexcept:\\n    pass\", \"wd,bal=map(float,input().split())\\nif wd%5==0 and wd+0.50<=bal:\\n    bal=bal-wd-0.5\\n    print(f'{bal:.2f}')\\nelse:\\n    print(f'{bal:.2f}')\", \"wd,bal=map(float,input().split())\\nif(wd%5==0 and wd+0.50<=bal):\\n    bal=bal-wd-0.5\\n    print(f'{bal:.2f}')\\nelse:\\n    print(f'{bal:.2f}')\", \"a, b = map(float,input().split())\\nif a%5 == 0:\\n    if (a+0.50)<=b:\\n      b=b-(a+0.50)\\nprint(b)\", \"\\n\\nx,y= map(float,input().split())\\nif(x%5==0):\\n    x=x+0.5\\n    if(x<=y):\\n        y=y-x\\nprint(y)\", \"# cook your dish here\\n\\nx,y= map(float,input().split())\\nif(x%5==0):\\n    x=x+0.5\\n    if(x<=y):\\n        y=y-x\\nprint(y)\"]",
        "difficulty": "interview",
        "input": [
            "300 120.00",
            "",
            ""
        ],
        "output": [
            "120.00"
        ],
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://www.codechef.com/problems/ATM"
    },
    {
        "id": 467,
        "task_id": 2699,
        "test_case_id": 1,
        "question": "Rashmi loves the festival of Diwali as she gets to spend time with family and enjoy the festival. Before she can fully enjoy the festival she needs to complete the homework assigned by her teacher. Since Rashmi is smart , she has solved all the problems but is struck at one tricky pattern question.\nYour Task is to help Rashmi solve the problem so that she can enjoy the festival with her family.\nThe Problem she is struck on is defined like this:\nGiven an integer N you need to generate the pattern according to following example:\nExample:\n\nInput:\n\n3  \nOutput:\n\n1 4 10\n\n2 5 11\n\n4 10 22\n\n3 6 12  \n\n-----Input:-----\nThe first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.\nThe next line of each contains T space separated integers N.\n\n-----Output:-----\nFor each N print the required pattern.\n\n-----Constraints:-----\n$1 \\leq T \\leq 10^5$\n$1 \\leq N \\leq 30$\n\n-----Sample Input:-----\n2\n3 5\n\n-----Sample Output:-----\n1 4 10\n\n2 5 11\n\n4 10 22\n\n3 6 12\n\n1 4 10 22 46\n\n2 5 11 23 47\n\n4 10 22 46 94\n\n3 6 12 24 48  \n\n-----Sample Input:-----\n1\n\n4  \n\n-----Sample Output:-----\n1 4 10 22\n\n2 5 11 23\n\n4 10 22 46\n\n3 6 12 24",
        "solutions": "[\"# cook your dish here\\na=int(input())\\np=list(map(int,input().split()))\\nfor n in p:\\n    # n=int(input())\\n    a=[1]\\n    b=[2]\\n    c=[4]\\n    d=[3]\\n    j=1\\n    k=1\\n    for i in range(n-1):\\n        a.append(a[i]+3*(j))\\n        b.append(b[i]+3*(j))\\n        c.append(c[i]+6*(j))\\n        d.append(d[i]+3*(j))\\n        j*=2\\n        # k+\\n    print(*a)\\n    print(*b)\\n    print(*c)\\n    print(*d)\", \"t = int(input())\\nnlist = [int(x) for x in input().split(\\\" \\\") if x != \\\"\\\"]\\n\\nnums = [1, 2, 4, 3]\\nadd = 3\\n\\nfor flag in range(t):\\n  n = nlist[flag]\\n  \\n  for num in nums:\\n    x = num\\n    for a in range(n):\\n      print(x, end = \\\" \\\")\\n      if(num == 4):\\n        x = x+(add*pow(2,a+1))\\n      else:\\n        x = x+(add*pow(2,a))\\n    print(\\\"\\\")\", \"# cook your dish here\\ndef first_row(n):\\n    l=[1]\\n    s=[2]\\n    t=[4]\\n    f=[3]\\n    d=3\\n    for i in range(n-1):\\n        l.append(l[-1]+d)\\n        s.append(l[-1]+1)\\n        t.append(s[-1]*2)\\n        f.append(s[-1]+1)\\n        d=d*2\\n    for i in range(len(l)):\\n        print(l[i],end=\\\" \\\")\\n    print(\\\"\\\")\\n    for i in range(len(s)):\\n        print(s[i],end=\\\" \\\")\\n    print(\\\"\\\")\\n    for i in range(len(t)):\\n        print(t[i],end=\\\" \\\")\\n    print(\\\"\\\")\\n    for i in range(len(f)):\\n        print(f[i],end=\\\" \\\")\\n    print(\\\"\\\")\\nt=int(input())\\nl=list(map(int,input().split()))\\nfor i in range(len(l)):\\n    first_row(l[i])\", \"t=0\\ntry:\\n    t=int(input())\\nexcept:\\n    pass\\nfor _ in range (t):\\n    try:\\n        l=list(map(int,input().split()))\\n    except:\\n        pass\\nfor n in l:\\n    if n in range (1,31):\\n        a,b,c,d=1,2,4,3\\n        print(\\\"1\\\",end=' ')\\n        for _ in range (n-1):\\n            a=(a+1)*2\\n            print(a,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"2\\\",end=' ')\\n        for _ in range (n-1):\\n            b=(b*2)+1\\n            print(b,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"4\\\",end=' ')\\n        for _ in range (n-1):\\n            c=(c*2)+2\\n            print(c,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"3\\\",end=' ')\\n        for _ in range (n-1):\\n            d=d*2\\n            print(d,end=' ')\\n        print(\\\"\\\")\", \"t=0\\ntry:\\n    t=int(input())\\nexcept:\\n    pass\\nfor _ in range (t):\\n    try:\\n        l=list(map(int,input().split()))\\n    except:\\n        pass\\nfor n in l:\\n    if n in range (1,31):\\n        a,b,c,d=1,2,4,3\\n        print(\\\"1\\\",end=' ')\\n        for _ in range (n-1):\\n            a=(a+1)*2\\n            print(a,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"2\\\",end=' ')\\n        for _ in range (n-1):\\n            b=(b*2)+1\\n            print(b,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"4\\\",end=' ')\\n        for _ in range (n-1):\\n            c=(c*2)+2\\n            print(c,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"3\\\",end=' ')\\n        for _ in range (n-1):\\n            d=d*2\\n            print(d,end=' ')\\n        print(\\\"\\\")\\n\", \"t=0\\ntry:\\n    t=int(input())\\nexcept:\\n    pass\\nfor _ in range (t):\\n    try:\\n        l=list(map(int,input().split()))\\n    except:\\n        pass\\nfor n in l:\\n    if n in range (1,31):\\n        a,b,c,d=1,2,4,3\\n        print(\\\"1\\\",end=' ')\\n        for _ in range (n-1):\\n            a=(a+1)*2\\n            print(a,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"2\\\",end=' ')\\n        for _ in range (n-1):\\n            b=(b*2)+1\\n            print(b,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"4\\\",end=' ')\\n        for _ in range (n-1):\\n            c=(c*2)+2\\n            print(c,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"3\\\",end=' ')\\n        for _ in range (n-1):\\n            d=d*2\\n            print(d,end=' ')\\n        print(\\\"\\\")\", \"# cook your dish here\\nt = int(input())\\nar = list(map(int, input().split()))\\nfor i in ar:\\n    z = 3\\n    a = 1\\n    for j in range(i):\\n        print(str(a),end=' ')\\n        a = a+z\\n        z = 2*z\\n    print('\\\\r')\\n    z = 3\\n    a = 2\\n    for j in range(i):\\n        print(str(a),end=' ')\\n        a = a+z\\n        z = 2*z\\n    print('\\\\r')\\n    z = 6\\n    a = 4\\n    for j in range(i):\\n        print(str(a),end=' ')\\n        a = a+z\\n        z = 2*z\\n    print('\\\\r')\\n    z = 3\\n    a = 3\\n    for j in range(i):\\n        print(str(a),end=' ')\\n        a = a+z\\n        z = 2*z\\n    print('\\\\r')\", \"t=0\\ntry:\\n    t=int(input())\\nexcept:\\n    pass\\nfor _ in range (t):\\n    try:\\n        l=list(map(int,input().split()))\\n    except:\\n        pass\\nfor n in l:\\n    if n in range (1,31):\\n        a,b,c,d=1,2,4,3\\n        print(\\\"1\\\",end=' ')\\n        for _ in range (n-1):\\n            a=(a+1)*2\\n            print(a,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"2\\\",end=' ')\\n        for _ in range (n-1):\\n            b=(b*2)+1\\n            print(b,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"4\\\",end=' ')\\n        for _ in range (n-1):\\n            c=(c*2)+2\\n            print(c,end=' ')\\n        print(\\\"\\\")\\n        print(\\\"3\\\",end=' ')\\n        for _ in range (n-1):\\n            d=d*2\\n            print(d,end=' ')\\n        print(\\\"\\\")\", \"n=int(input())\\na=[int(i) for i in input().split()]\\nfor av in a:\\n    temp=[]\\n    temp.append(1)\\n    for j in range(av-1):\\n        temp.append(3*2**j+temp[-1])\\n    for v in temp:\\n        print(v,end=\\\" \\\")\\n    print(\\\"\\\\n\\\",end=\\\"\\\")\\n    temp1=[i+1 for i in temp]\\n    for v in temp1:\\n        print(v,end=\\\" \\\")\\n    print(\\\"\\\\n\\\",end=\\\"\\\")\\n    temp2=[2*i for i in temp1]\\n    for v in temp2:\\n        print(v,end=\\\" \\\")\\n    print(\\\"\\\\n\\\",end=\\\"\\\")\\n    dummy=[]\\n    for k in range(len(temp)):\\n        dummy.append(temp2[k]-temp[k])\\n    for v in dummy:\\n        print(v,end=\\\" \\\")\\n    print(\\\"\\\\n\\\",end=\\\"\\\")\\n\", \"totIts = int(input())\\ncolCts = list(map(int, input().split()))\\n\\nfor i in range(totIts):\\n    currColCt = colCts[i]\\n    for j in [1,2,4,3]:\\n        c = j\\n        if c != 4:\\n            print(c, end=\\\" \\\")\\n            for k in range(0,currColCt-1):\\n                res = c + 3*(2**k)\\n                print(res, end=\\\" \\\")\\n                c = res\\n        else:\\n            print(c, end=\\\" \\\")\\n            for k in range(0,currColCt-1):\\n                res = c + 6*(2**k)\\n                print(res, end=\\\" \\\")\\n                c = res\\n        print(\\\"\\\")\", \"\\nt = int(input())\\nnums = list(map(int,input().split()))\\n\\nfor i in nums:\\n    for row in range(1,5):\\n        if row == 3:\\n            y = row + 1\\n            x = 3*2\\n        elif row == 4:\\n            y = row-1   \\n            x = 3\\n        else:\\n            y = row\\n            x = 3\\n\\n        for col in range(1,i+1):\\n            print(y, end=\\\" \\\")\\n            y += x\\n            x *= 2\\n        \\n        print()\\n            \", \"l=[1]\\nfor i in range(32):\\n    l.append(l[-1]+(3*(2**i)))\\nm=[]\\nfor i in range(33):\\n    m.append(l[i]+1)\\n\\nn=[]\\nfor i in range(33):\\n    n.append(m[i]*2)\\n    \\no=[]\\nfor i in range(33):\\n    o.append(m[i]+1)\\n\\n\\nt=int(input())\\ninp=[int(i) for i in input().split()]\\nfor j in range(t):\\n    y=inp[j]\\n    for i in range(y):\\n        print(l[i],end=\\\" \\\")\\n    print()\\n    for i in range(y):\\n        print(m[i],end=\\\" \\\")\\n    print()\\n    for i in range(y):\\n        print(n[i],end=\\\" \\\")\\n    print()\\n    for i in range(y):\\n        print(o[i],end=\\\" \\\")\\n    print()\\n    # cook your dish here\\n\", \"try:\\n    t=int(input())\\n    mlist=list(map(int,input().split()))\\n    \\n   \\n    for i in range(0,len(mlist)):\\n        slist=[[1],[2],[4],[3]]\\n        # print(11111)\\n        for j in range(0,len(slist)):\\n            # print(4332)\\n            for k in range(0,mlist[i]-1):\\n                \\n                if(j==0):\\n                    # print(1)\\n                    slist[0].append(((slist[0][-1]*2)+2))\\n                if(j==1):\\n                    # print(2)\\n                    slist[1].append(((slist[1][-1]*2)+1))\\n                if(j==2):\\n                    # print(3)\\n                    slist[2].append(((slist[2][-1]*2)+2))\\n                if(j==3):\\n                    # print(4)\\n                    slist[3].append(((slist[3][-1]*2)))\\n                    \\n        for j in range(0,len(slist)):\\n            # print(5)\\n            for k in range(0,len(slist[j])):\\n                print(slist[j][k],end=\\\" \\\")\\n            print()    \\nexcept:\\n    pass\\n\", \"totIts = int(input())\\ncolCts = list(map(int, input().split()))\\n\\nfor i in range(totIts):\\n    currColCt = colCts[i]\\n    for j in [1,2,4,3]:\\n        c = j\\n        if c != 4:\\n            print(c, end=\\\" \\\")\\n            for k in range(0,currColCt-1):\\n                print(c + 3*(2**k), end=\\\" \\\")\\n                c = c + 3*(2**k)\\n        else:\\n            print(c, end=\\\" \\\")\\n            for k in range(0,currColCt-1):\\n                print(c + 6*(2**k), end=\\\" \\\")\\n                c = c + 6*(2**k)\\n        print(\\\"\\\")\", \"n=int(input())\\r\\nns=list(map(int,input().split()))\\r\\n\\r\\nfor i in range(n):\\r\\n    lst=[[1],[2],[4],[3]]\\r\\n    for j in range(1,ns[i]):\\r\\n        lst[0].append(lst[0][j-1]*2+2)\\r\\n        lst[1].append(lst[1][j-1]*2+1)\\r\\n        lst[2].append(lst[2][j-1]*2+2)\\r\\n        lst[3].append(lst[3][j-1]*2)\\r\\n        \\r\\n    for k in range(4):\\r\\n        for p in range(len(lst[0])):\\r\\n            print(lst[k][p],end=\\\" \\\")\\r\\n        print()\", \"t=int(input())\\r\\nns=list(map(int,input().split()))\\r\\nfor n in ns:\\r\\n     a=[[1],[2],[4],[3]]\\r\\n     for i in range(n-1):\\r\\n          d=a[0][-1]*2+2\\r\\n          a[0].append(d)\\r\\n          d=a[1][-1]*2+1\\r\\n          a[1].append(d)\\r\\n          d=a[2][-1]*2+2\\r\\n          a[2].append(d)\\r\\n          d=a[3][-1]*2\\r\\n          a[3].append(d)\\r\\n     for i in a:\\r\\n          for j in i:\\r\\n               print(j,end=\\\" \\\")\\r\\n          print()\", \"def op(n):\\n    m = 3\\n    l = [[1], [2], [4], [3]]\\n    \\n    for _ in range(n-1):\\n        for row in l:\\n            if row == l[2]:\\n                row.append(row[-1] + 2 * m)\\n            else:\\n                row.append(row[-1] + m)\\n        m = m * 2\\n        \\n       \\n    for row in l:\\n        for elem in row:\\n            print(elem, end=\\\" \\\")\\n        print(\\\"\\\\n\\\")\\n        \\nt = int(input())\\nns = list(map(int, input().split()))\\nfor n in ns:\\n    op(n)\\n    \", \"t = int(input())\\r\\nlist1 = []\\r\\narr = list(map(int,input().split()))\\r\\nfor i in range(t):\\r\\n    for j in range(4):\\r\\n        if j==0:\\r\\n            list1.append(1)\\r\\n            print(list1[-1],end = \\\" \\\")\\r\\n            for x in range(1,arr[i]):\\r\\n                list1.append((list1[-1]*2)+2)\\r\\n                print(list1[-1],end = \\\" \\\")\\r\\n            print()\\r\\n        elif j==1:\\r\\n            list1.append(2)\\r\\n            print(list1[-1],end = \\\" \\\")\\r\\n            for x in range(1,arr[i]):\\r\\n                list1.append((list1[-1]*2)+1)\\r\\n                print(list1[-1],end = \\\" \\\")\\r\\n            print()\\r\\n        elif j==2:\\r\\n            list1.append(4)\\r\\n            print(list1[-1],end = \\\" \\\")\\r\\n            for x in range(1,arr[i]):\\r\\n                list1.append((list1[-1]*2)+2)\\r\\n                print(list1[-1],end = \\\" \\\")\\r\\n            print()\\r\\n        elif j==3:\\r\\n            list1.append(3)\\r\\n            print(list1[-1],end = \\\" \\\")\\r\\n            for x in range(1,arr[i]):\\r\\n                list1.append(list1[-1]*2)\\r\\n                print(list1[-1],end = \\\" \\\")\\r\\n            print()\\r\\n               \\r\\n\", \"import sys\\r\\nimport math\\r\\nimport bisect\\r\\nfrom sys import stdin,stdout\\r\\nfrom math import gcd,floor,sqrt,log\\r\\nfrom collections import defaultdict as dd\\r\\nfrom bisect import bisect_left as bl,bisect_right as br\\r\\n\\r\\nsys.setrecursionlimit(100000000)\\r\\n\\r\\nii     =lambda: int(input())\\r\\nsi     =lambda: input()\\r\\njn     =lambda x,l: x.join(map(str,l))\\r\\nsl     =lambda: list(map(str,input().strip()))\\r\\nmi     =lambda: map(int,input().split())\\r\\nmif    =lambda: map(float,input().split())\\r\\nlii    =lambda: list(map(int,input().split()))\\r\\n\\r\\nceil   =lambda x: int(x) if(x==int(x)) else int(x)+1\\r\\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\\r\\n\\r\\nflush  =lambda: stdout.flush()\\r\\nstdstr =lambda: stdin.readline()\\r\\nstdint =lambda: int(stdin.readline())\\r\\nstdpr  =lambda x: stdout.write(str(x))\\r\\n\\r\\nmod=1000000007\\r\\n\\r\\n\\r\\n#main code\\r\\nn=ii()\\r\\narr=lii()\\r\\nfor i in range(n):\\r\\n    for j in range(4):\\r\\n        if j==0:\\r\\n            val=1\\r\\n        elif j==1:\\r\\n            val=2\\r\\n        elif j==2:\\r\\n            val=4\\r\\n        elif j==3:\\r\\n            val=3\\r\\n        for k in range(arr[i]):\\r\\n            ans=0\\r\\n            if k>0:\\r\\n                ans=2**(k-1)\\r\\n            if j==3:\\r\\n                val+=3*ans\\r\\n                \\r\\n                print(val,end=' ')\\r\\n            elif j==0 or j==1:\\r\\n                val+=3*ans\\r\\n                print(val,end=' ')\\r\\n            else:\\r\\n                val+=6*ans\\r\\n                print(val,end=' ')\\r\\n            \\r\\n        print()\\r\\n\\r\\n                \\r\\n                \\r\\n                \\r\\n                \\r\\n            \", \"t=int(input())\\r\\nl=list(map(int,input().split()))\\r\\nfor i in range(t):\\r\\n\\ta=1\\r\\n\\tk=3\\r\\n\\tfor j in range(l[i]):\\r\\n\\t\\tprint(a,end=\\\" \\\")\\r\\n\\t\\ta=a+k\\r\\n\\t\\tk=k+k\\r\\n\\tprint()\\r\\n\\t\\r\\n\\ta=2\\r\\n\\tk=3\\r\\n\\tfor j in range(l[i]):\\r\\n\\t\\tprint(a,end=\\\" \\\")\\r\\n\\t\\ta=a+k\\r\\n\\t\\tk=k+k\\r\\n\\tprint()\\r\\n\\t\\r\\n\\ta=4\\r\\n\\tk=6\\r\\n\\tfor j in range(l[i]):\\r\\n\\t\\tprint(a,end=\\\" \\\")\\r\\n\\t\\ta=a+k\\r\\n\\t\\tk=k+k\\r\\n\\tprint()\\r\\n\\t\\r\\n\\ta=3\\r\\n\\tk=3\\r\\n\\tfor j in range(l[i]):\\r\\n\\t\\tprint(a,end=\\\" \\\")\\r\\n\\t\\ta=a+k\\r\\n\\t\\tk=k+k\\r\\n\\tprint()\\r\\n\\t\\r\\n\\t\\t \", \"T = int(input())\\nn = list(map(int, input().split()))\\n\\nfor i in n:\\n    l1 = [1]\\n    l2 = [2]\\n    l3 = [4]\\n    l4 = [3]\\n    for t in range(1, i):\\n        l1.append(l1[-1] + 3*2**(t-1))\\n        l2.append(l1[-1] + 1)\\n        l3.append(l3[-1] + 6*2**(t-1))\\n        l4.append(l4[-1]*2)\\n    l1 = list(map(str, l1))\\n    l2 = list(map(str, l2))\\n    l3 = list(map(str, l3))\\n    l4 = list(map(str, l4))\\n        \\n    print(' '.join(l1))\\n    print(' '.join(l2))\\n    print(' '.join(l3))\\n    print(' '.join(l4))\", \"def pattern(n):\\r\\n    first = [0]*n\\r\\n    second = [0]*n\\r\\n    third = [0]*n\\r\\n    forth = [0]*n\\r\\n\\r\\n    first[0] = 1\\r\\n    second[0] = 2\\r\\n    third[0] = 4\\r\\n    forth[0] = 3\\r\\n\\r\\n    if n>1:\\r\\n        for i in range(1, n):\\r\\n            first[i] = first[i-1] + second[i-1] + 1\\r\\n            second[i] = first[i-1] + second[i-1] + 2\\r\\n            third[i] = second[i] * 2\\r\\n            forth[i] = second[i] + 1\\r\\n\\r\\n    for a in first:\\r\\n        print(a, end=' ')\\r\\n    print(\\\"\\\")\\r\\n\\r\\n    for b in second:\\r\\n        print(b, end=' ')\\r\\n    print(\\\"\\\")\\r\\n\\r\\n    for c in third:\\r\\n        print(c, end=' ')\\r\\n    print(\\\"\\\")\\r\\n\\r\\n    for d in forth:\\r\\n        print(d, end=' ')\\r\\n    print(\\\"\\\")\\r\\n    \\r\\nT = int(input())\\r\\nN = list(map(int, input().split()))\\r\\n\\r\\nfor n in N:\\r\\n    pattern(n)\", \"# cook your dish here\\ndef print_pattern(n):\\n    a = [1]\\n    b = []\\n    c = []\\n    d = []\\n    for i in range(n):\\n        if i != 0:\\n            a.append((a[i-1]+1)*2)\\n    for i in range(n):\\n        b.append(a[i]+1)\\n    for i in range(n-1):\\n        c.append(a[i+1])\\n    c.append((a[n-1]+1)*2) \\n    for i in range(n):\\n        d.append(a[i]+2)\\n    for i in range(n):\\n        print(a[i], end = \\\" \\\")\\n    print()\\n    for i in range(n):\\n        print(b[i], end = \\\" \\\")\\n    print()\\n    for i in range(n):\\n        print(c[i], end = \\\" \\\")\\n    print()\\n    for i in range(n):\\n        print(d[i], end = \\\" \\\")\\n    print()\\n    return\\nt = int(input())\\nn = [int(x) for x in input().split()]\\nfor i in n:\\n    m = print_pattern(int(i))\\n\", \"# cook your dish here\\nt=int(input())\\nn=list(map(int,input().split()[:t]))\\nfor i in n:\\n    li=[3]\\n    li1=3\\n    list1=[1]\\n    list2=[2]\\n    list3=[4]\\n    list4=[3]\\n    l1=1\\n    l2=2\\n    l3=4\\n    l4=3\\n    for j in range(i-1):\\n        li.append(li1*2)\\n        li1=li1*2\\n    for i in range(i-1):\\n        list1.append(l1+li[i])\\n        l1=l1+li[i]\\n\\n        list2.append(l2+li[i])\\n        l2=l2+li[i]\\n\\n        list3.append(l3+li[i+1])\\n        l3=l3+li[i+1]\\n        list4.append(l4+li[i])\\n        l4=l4+li[i]\\n    for i in (list1):\\n        print(i,end=\\\" \\\")\\n    print()\\n    for i in (list2):\\n        print(i,end=\\\" \\\")\\n    print()\\n    for i in (list3):\\n        print(i,end=\\\" \\\")\\n    print()\\n    \\n    for i in (list4):\\n        print(i,end=\\\" \\\")\\n    print()\\n\\n\", \"t=int(input())\\r\\nlst=list(map(int,input().split()))\\r\\nfor _ in range(len(lst)):\\r\\n    n=lst[_]\\r\\n    l=[[0]*n,[0]*n,[0]*n,[0]*n]\\r\\n    \\r\\n    c=1\\r\\n    \\r\\n    for i in range(n):\\r\\n        for j in range(4):\\r\\n            if j==2:\\r\\n                continue\\r\\n            else:\\r\\n                l[j][i] = c\\r\\n                c+=1\\r\\n        l[2][i] = l[3][i] + l[0][i]\\r\\n        c = l[2][i]\\r\\n        \\r\\n    for i in range(4):\\r\\n        for j in range(n):\\r\\n            if(j!=3):\\r\\n                print(l[i][j],end=' ')\\r\\n            else:\\r\\n                print(l[i][j],end=' ')\\r\\n        print()\"]",
        "difficulty": "interview",
        "input": [
            "2",
            "3 5"
        ],
        "output": [
            "1 4 10",
            "2 5 11",
            "4 10 22",
            "3 6 12",
            "1 4 10 22 46",
            "2 5 11 23 47",
            "4 10 22 46 94",
            "3 6 12 24 48"
        ],
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://www.codechef.com/CHLG2020/problems/PATTE1"
    },
    {
        "id": 468,
        "task_id": 2729,
        "test_case_id": 1,
        "question": "Dividing two numbers and computing the decimals is an extremely difficult task. Luckily, dividing a number by a “special” number is very easy (at least for us humans)!\n\nWe will define the set of “special” numbers $S=\\{ 10^K\\} $ for all non-negative integers $K$, i.e. $\\{ 1,10,100,\\ldots \\} $.\n\nGiven a large numbers $N$ and a “special” large number $M$, what does the decimal representation of\\[ \\frac{N}{M} \\]\n\nlook like?\n\n-----Input-----\nThe first line of input contains 2 integers $N$, $M$, where $1\\leq N, M\\leq 10^{10^6}$, and $M\\in S$.\n\n-----Output-----\nPrint the exact decimal preresentation of $\\frac{N}{M}$, i.e. every digit, without trailing zeroes; if the quotient is less than $1$, print one leading zero (see sample input).\n\n-----Examples-----\nSample Input 1:\n92746237\n100000\nSample Output 1:\n927.46237\n\nSample Input 2:\n100000\n100\nSample Output 2:\n1000\n\nSample Input 3:\n1234500\n10000\nSample Output 3:\n123.45",
        "solutions": "",
        "difficulty": "interview",
        "input": "92746237\n100000\n",
        "output": "927.46237\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/divideby100"
    },
    {
        "id": 469,
        "task_id": 2729,
        "test_case_id": 2,
        "question": "Dividing two numbers and computing the decimals is an extremely difficult task. Luckily, dividing a number by a “special” number is very easy (at least for us humans)!\n\nWe will define the set of “special” numbers $S=\\{ 10^K\\} $ for all non-negative integers $K$, i.e. $\\{ 1,10,100,\\ldots \\} $.\n\nGiven a large numbers $N$ and a “special” large number $M$, what does the decimal representation of\\[ \\frac{N}{M} \\]\n\nlook like?\n\n-----Input-----\nThe first line of input contains 2 integers $N$, $M$, where $1\\leq N, M\\leq 10^{10^6}$, and $M\\in S$.\n\n-----Output-----\nPrint the exact decimal preresentation of $\\frac{N}{M}$, i.e. every digit, without trailing zeroes; if the quotient is less than $1$, print one leading zero (see sample input).\n\n-----Examples-----\nSample Input 1:\n92746237\n100000\nSample Output 1:\n927.46237\n\nSample Input 2:\n100000\n100\nSample Output 2:\n1000\n\nSample Input 3:\n1234500\n10000\nSample Output 3:\n123.45",
        "solutions": "",
        "difficulty": "interview",
        "input": "100000\n100\n",
        "output": "1000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/divideby100"
    },
    {
        "id": 470,
        "task_id": 2729,
        "test_case_id": 3,
        "question": "Dividing two numbers and computing the decimals is an extremely difficult task. Luckily, dividing a number by a “special” number is very easy (at least for us humans)!\n\nWe will define the set of “special” numbers $S=\\{ 10^K\\} $ for all non-negative integers $K$, i.e. $\\{ 1,10,100,\\ldots \\} $.\n\nGiven a large numbers $N$ and a “special” large number $M$, what does the decimal representation of\\[ \\frac{N}{M} \\]\n\nlook like?\n\n-----Input-----\nThe first line of input contains 2 integers $N$, $M$, where $1\\leq N, M\\leq 10^{10^6}$, and $M\\in S$.\n\n-----Output-----\nPrint the exact decimal preresentation of $\\frac{N}{M}$, i.e. every digit, without trailing zeroes; if the quotient is less than $1$, print one leading zero (see sample input).\n\n-----Examples-----\nSample Input 1:\n92746237\n100000\nSample Output 1:\n927.46237\n\nSample Input 2:\n100000\n100\nSample Output 2:\n1000\n\nSample Input 3:\n1234500\n10000\nSample Output 3:\n123.45",
        "solutions": "",
        "difficulty": "interview",
        "input": "1234500\n10000\n",
        "output": "123.45\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/divideby100"
    },
    {
        "id": 471,
        "task_id": 2729,
        "test_case_id": 4,
        "question": "Dividing two numbers and computing the decimals is an extremely difficult task. Luckily, dividing a number by a “special” number is very easy (at least for us humans)!\n\nWe will define the set of “special” numbers $S=\\{ 10^K\\} $ for all non-negative integers $K$, i.e. $\\{ 1,10,100,\\ldots \\} $.\n\nGiven a large numbers $N$ and a “special” large number $M$, what does the decimal representation of\\[ \\frac{N}{M} \\]\n\nlook like?\n\n-----Input-----\nThe first line of input contains 2 integers $N$, $M$, where $1\\leq N, M\\leq 10^{10^6}$, and $M\\in S$.\n\n-----Output-----\nPrint the exact decimal preresentation of $\\frac{N}{M}$, i.e. every digit, without trailing zeroes; if the quotient is less than $1$, print one leading zero (see sample input).\n\n-----Examples-----\nSample Input 1:\n92746237\n100000\nSample Output 1:\n927.46237\n\nSample Input 2:\n100000\n100\nSample Output 2:\n1000\n\nSample Input 3:\n1234500\n10000\nSample Output 3:\n123.45",
        "solutions": "",
        "difficulty": "interview",
        "input": "1\n10\n",
        "output": "0.1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/divideby100"
    },
    {
        "id": 472,
        "task_id": 3091,
        "test_case_id": 1,
        "question": "KenKen is a popular logic puzzle developed in Japan in 2004. It consists of an $n \\times n$ grid divided up into various non-overlapping sections, where each section is labeled with an integer target value and an arithmetic operator. The object is to fill in the entire grid with the numbers in the range 1 to $n$ such that\n - no number appears more than once in any row or column\n - in each section you must be able to reach the section’s target using the numbers in the section and the section’s arithmetic operator\n\nFor this problem we are only interested in single sections of a KenKen puzzle, not the entire puzzle. Two examples of sections from an $8 \\times 8$ KenKen puzzle are shown below along with some of their possible assignments of digits.\n\n Figure C.1 \n\nNote that while sections labeled with a subtraction or division operator can consist of only two grid squares, those labeled with addition or multiplication can have any number. Also note that in a $9 \\times 9$ puzzle the first example would have two more solutions, each involving the numbers $9$ and $2$. Finally note that in the first solution of the second section you could not swap the $1$ and $4$ in the first row, since that would result in two $1$’s in the same column.\n\nYou may be wondering: for a given size KenKen puzzle and a given section in the puzzle, how many valid ways are there to fill in the section? Well, stop wondering and start programming!\n\n\n\n-----Input-----\nThe input will start with a single line of the form $n$ $m$ $t$ $op$, where $n$ is the size of the KenKen puzzle containing the section to be described, $m$ is the number of grid squares in the section, $t$ is the target value and $op$ is either ‘+’, ‘-’, ‘*’ or ‘/’ indicating the arithmetic operator to use for the section.\n\nNext will follow $m$ grid locations of the form $r$ $c$, indicating the row and column number of the grid square. These grid square locations will take up one or more lines.\n\nAll grid squares in a given section will be connected so that you can move from any one square in the section to any other by crossing shared lines between grid squares.\n\nThe values of $n$, $m$ and $t$ will satisfy $4\\leq n\\leq 9$, $2 \\leq m \\leq 10$, $0 < t \\le 3 \\cdot 10^8$ and $1 \\leq r,c \\leq n$.\n\n-----Output-----\nOutput the number of valid ways in which the section could be filled in for a KenKen puzzle of the given size.\n\n-----Examples-----\nSample Input 1:\n8 2 7 -\n1 1 1 2\nSample Output 1:\n2\n\nSample Input 2:\n9 2 7 -\n1 1 1 2\nSample Output 2:\n4",
        "solutions": "",
        "difficulty": "competition",
        "input": "8 2 7 -\n1 1 1 2\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/kenken"
    },
    {
        "id": 473,
        "task_id": 3091,
        "test_case_id": 2,
        "question": "KenKen is a popular logic puzzle developed in Japan in 2004. It consists of an $n \\times n$ grid divided up into various non-overlapping sections, where each section is labeled with an integer target value and an arithmetic operator. The object is to fill in the entire grid with the numbers in the range 1 to $n$ such that\n - no number appears more than once in any row or column\n - in each section you must be able to reach the section’s target using the numbers in the section and the section’s arithmetic operator\n\nFor this problem we are only interested in single sections of a KenKen puzzle, not the entire puzzle. Two examples of sections from an $8 \\times 8$ KenKen puzzle are shown below along with some of their possible assignments of digits.\n\n Figure C.1 \n\nNote that while sections labeled with a subtraction or division operator can consist of only two grid squares, those labeled with addition or multiplication can have any number. Also note that in a $9 \\times 9$ puzzle the first example would have two more solutions, each involving the numbers $9$ and $2$. Finally note that in the first solution of the second section you could not swap the $1$ and $4$ in the first row, since that would result in two $1$’s in the same column.\n\nYou may be wondering: for a given size KenKen puzzle and a given section in the puzzle, how many valid ways are there to fill in the section? Well, stop wondering and start programming!\n\n\n\n-----Input-----\nThe input will start with a single line of the form $n$ $m$ $t$ $op$, where $n$ is the size of the KenKen puzzle containing the section to be described, $m$ is the number of grid squares in the section, $t$ is the target value and $op$ is either ‘+’, ‘-’, ‘*’ or ‘/’ indicating the arithmetic operator to use for the section.\n\nNext will follow $m$ grid locations of the form $r$ $c$, indicating the row and column number of the grid square. These grid square locations will take up one or more lines.\n\nAll grid squares in a given section will be connected so that you can move from any one square in the section to any other by crossing shared lines between grid squares.\n\nThe values of $n$, $m$ and $t$ will satisfy $4\\leq n\\leq 9$, $2 \\leq m \\leq 10$, $0 < t \\le 3 \\cdot 10^8$ and $1 \\leq r,c \\leq n$.\n\n-----Output-----\nOutput the number of valid ways in which the section could be filled in for a KenKen puzzle of the given size.\n\n-----Examples-----\nSample Input 1:\n8 2 7 -\n1 1 1 2\nSample Output 1:\n2\n\nSample Input 2:\n9 2 7 -\n1 1 1 2\nSample Output 2:\n4",
        "solutions": "",
        "difficulty": "competition",
        "input": "9 2 7 -\n1 1 1 2\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/kenken"
    },
    {
        "id": 474,
        "task_id": 3091,
        "test_case_id": 3,
        "question": "KenKen is a popular logic puzzle developed in Japan in 2004. It consists of an $n \\times n$ grid divided up into various non-overlapping sections, where each section is labeled with an integer target value and an arithmetic operator. The object is to fill in the entire grid with the numbers in the range 1 to $n$ such that\n - no number appears more than once in any row or column\n - in each section you must be able to reach the section’s target using the numbers in the section and the section’s arithmetic operator\n\nFor this problem we are only interested in single sections of a KenKen puzzle, not the entire puzzle. Two examples of sections from an $8 \\times 8$ KenKen puzzle are shown below along with some of their possible assignments of digits.\n\n Figure C.1 \n\nNote that while sections labeled with a subtraction or division operator can consist of only two grid squares, those labeled with addition or multiplication can have any number. Also note that in a $9 \\times 9$ puzzle the first example would have two more solutions, each involving the numbers $9$ and $2$. Finally note that in the first solution of the second section you could not swap the $1$ and $4$ in the first row, since that would result in two $1$’s in the same column.\n\nYou may be wondering: for a given size KenKen puzzle and a given section in the puzzle, how many valid ways are there to fill in the section? Well, stop wondering and start programming!\n\n\n\n-----Input-----\nThe input will start with a single line of the form $n$ $m$ $t$ $op$, where $n$ is the size of the KenKen puzzle containing the section to be described, $m$ is the number of grid squares in the section, $t$ is the target value and $op$ is either ‘+’, ‘-’, ‘*’ or ‘/’ indicating the arithmetic operator to use for the section.\n\nNext will follow $m$ grid locations of the form $r$ $c$, indicating the row and column number of the grid square. These grid square locations will take up one or more lines.\n\nAll grid squares in a given section will be connected so that you can move from any one square in the section to any other by crossing shared lines between grid squares.\n\nThe values of $n$, $m$ and $t$ will satisfy $4\\leq n\\leq 9$, $2 \\leq m \\leq 10$, $0 < t \\le 3 \\cdot 10^8$ and $1 \\leq r,c \\leq n$.\n\n-----Output-----\nOutput the number of valid ways in which the section could be filled in for a KenKen puzzle of the given size.\n\n-----Examples-----\nSample Input 1:\n8 2 7 -\n1 1 1 2\nSample Output 1:\n2\n\nSample Input 2:\n9 2 7 -\n1 1 1 2\nSample Output 2:\n4",
        "solutions": "",
        "difficulty": "competition",
        "input": "8 3 6 +\n5 2 6 2 5 1\n",
        "output": "7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/kenken"
    },
    {
        "id": 475,
        "task_id": 3354,
        "test_case_id": 1,
        "question": "Maj loves pickled cucumber (also known as pickles). However, her partner is not as keen on filling a sandwich with pickles. Maj would like to maximize the amount of pickles on a sandwich, while still avoiding being judged by her partner. \n\nBoth Maj’s sandwich and the pickles have a circular shape. The sandwich has radius $s$ cm and the pickles have radius $r$ cm.\n\nMaj has exactly $n$ pickles. She wants to place as many of them as possible on her sandwich, as long as:\n - at most $z \\% $ of the area of the sandwich is covered by pickles.\n - no two pickles overlap (but they are allowed to touch).\n\nHow many pickles can Maj place on her sandwich?\n\n-----Input-----\nThe input consists of:\n - one line with the decimal numbers $s$ and $r$ ($1 \\le s \\le 10$, $0.5 \\le r \\le s$, at most $6$ digits after the decimal point), the radius of the sandwich and the radius of a pickle, in centimetres.\n - one line with the integers $n$ and $z$ ($1 \\le n \\le 7$, $0 \\le z \\le 100$), the number of pickles Maj have, and the maximum area she may cover with them, in percent.\n\n-----Output-----\nOutput the maximum number of pickles Maj can place on her sandwich. The input will always be constructed such that this number does not change if the radius of the sandwich increases or decreases by $10^{-6}$.\n\n-----Examples-----\nSample Input:\n3 1 4 40\nSample Output:\n3",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1 4 40\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/cucumberconundrum"
    },
    {
        "id": 476,
        "task_id": 3354,
        "test_case_id": 2,
        "question": "Maj loves pickled cucumber (also known as pickles). However, her partner is not as keen on filling a sandwich with pickles. Maj would like to maximize the amount of pickles on a sandwich, while still avoiding being judged by her partner. \n\nBoth Maj’s sandwich and the pickles have a circular shape. The sandwich has radius $s$ cm and the pickles have radius $r$ cm.\n\nMaj has exactly $n$ pickles. She wants to place as many of them as possible on her sandwich, as long as:\n - at most $z \\% $ of the area of the sandwich is covered by pickles.\n - no two pickles overlap (but they are allowed to touch).\n\nHow many pickles can Maj place on her sandwich?\n\n-----Input-----\nThe input consists of:\n - one line with the decimal numbers $s$ and $r$ ($1 \\le s \\le 10$, $0.5 \\le r \\le s$, at most $6$ digits after the decimal point), the radius of the sandwich and the radius of a pickle, in centimetres.\n - one line with the integers $n$ and $z$ ($1 \\le n \\le 7$, $0 \\le z \\le 100$), the number of pickles Maj have, and the maximum area she may cover with them, in percent.\n\n-----Output-----\nOutput the maximum number of pickles Maj can place on her sandwich. The input will always be constructed such that this number does not change if the radius of the sandwich increases or decreases by $10^{-6}$.\n\n-----Examples-----\nSample Input:\n3 1 4 40\nSample Output:\n3",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1 4 100\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/cucumberconundrum"
    },
    {
        "id": 477,
        "task_id": 3498,
        "test_case_id": 2,
        "question": "Real-time software in the Mars Pathfinder spacecraft suffered from an issue known as priority inversion. One technique to address this issue is to use the Priority Ceiling Protocol.\n\nIn this problem, you will simulate the execution of multiple tasks according to this protocol. The tasks share a collection of resources, each of which can be used by only one task at a time. To ensure this, resources must be locked before use and unlocked after use. Each task is defined by a start time, a unique base priority, and a sequence of instructions. Each task also has a current priority, which may change during execution. Instructions come in three types:\n - compute – perform a computation for one microsecond\n - lock $k$ – lock resource $k$ (which takes no processor time)\n - unlock $k$ – unlock resource $k$ (which takes no processor time)\n\nAfter locking a resource, a task is said to own the resource until the task unlocks it. A task will unlock only the owned resource it most recently locked, will not lock a resource it already owns, and will complete with no owned resources.\n\nEach resource has a fixed priority ceiling, which is the highest base priority of any task that contains an instruction to lock that resource.\n\nThere is a single processor that executes the tasks. When the processor starts, it initializes its clock to zero and then runs an infinite loop with the following steps:Step 1.\n\nIdentify running tasks. A task is running if its start time is less than or equal to the current processor clock and not all of its instructions have been executed.Step 2.\n\nDetermine the current priorities of the running tasks and which of the running tasks are blocked. A running task $T$ is blocked if the next instruction in $T$ is to lock resource $k$ and either resource $k$ is already owned or at least one other task owns a resource $\\ell $ whose priority ceiling is greater than or equal to the current priority of $T$. If $T$ is blocked, it is said to be blocked by every task owning such $k$ or $\\ell $. The current priority of a task $T$ is the maximum of $T$’s base priority and the current priorities of all tasks that $T$ blocks.Step 3.\n\nExecute the next instruction of the non-blocked running task (if any) with the highest current priority. If there was no such task or if a compute instruction was executed, increment the processor clock by one microsecond. If a lock or unlock instruction was executed, do not increment the clock.\n\nThe Priority Ceiling Protocol defined above has the following properties:\n - Current priority is defined in terms of current priority and blocking, and blocking is defined in terms of current priority. While this may appear circular, there will always be a unique set of current priorities that satisfy the definitions.\n - All tasks will eventually complete.\n - There will never be a tie in step 3.\n\n-----Input-----\nThe first line of the input contains two integers $t$ $(1 \\leq t \\leq 20)$, which is the number of tasks, and $r$ ($1 \\leq r \\leq 20$), which is the number of resources. This is followed by $t$ lines, where the $i^\\text {th}$ of these lines describes task $i$. The description of a task begins with three integers: the task’s start time $s$ ($1 \\leq s \\leq 10000$), its base priority $b$ ($1 \\leq b \\leq t$), and an integer $a$ ($1 \\leq a \\leq 100$). A task description is concluded by a sequence of $a$ strings describing the instructions. Each string is a letter (C or L or U) followed by an integer. The string C$n$ ($1 \\leq n \\leq 100$) indicates a sequence of $n$ compute instructions. The strings L$k$ and U$k$ ($1 \\leq k \\leq r$) indicate instructions locking and unlocking resource $k$ respectively.\n\nNo two tasks have the same base priority.\n\n-----Output-----\nFor each task, display the time it completes execution, in the same order that the tasks are given in the input.\n\n-----Examples-----\nSample Input:\n3 1\n50 2 5 C1 L1 C1 U1 C1\n1 1 5 C1 L1 C100 U1 C1\n70 3 1 C1\nSample Output:\n106\n107\n71",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 3\n5 3 5 C1 L1 C1 U1 C1\n3 2 9 C1 L2 C1 L3 C1 U3 C1 U2 C1\n1 1 9 C1 L3 C3 L2 C1 U2 C1 U3 C1\n",
        "output": "8\n15\n16\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/mars"
    },
    {
        "id": 478,
        "task_id": 3560,
        "test_case_id": 1,
        "question": "Nowadays, there are a lot of unusual people. We won’t go into details, but instead focus on a certain type, to us personally the most interesting people. Of course, we’re talking about barbarians!\n\nThere are a lot of barbarians, but only a few of them are truly important. This story has $N$ important barbarians, denoted with integers from $1$ to $N$. Each of them has their own stone tablet with their word written on it, consisting of only lowercase letters of the English alphabet.\n\nOur barbarians are playing an interesting game with their good friend Tarzan.\n\nThe game is played in $Q$ rounds. There are two round types and each is determined by Tarzan:1st type:\n\nTarzan shows the word $P$ to the barbarians.2nd type:\n\nTarzan asks the barbarian denoted with $S$ the following question: “Out of all the words I’ve shown you so far, how many of them have the word on your stone tablet as a consecutive substring?”\n\nGiven the fact that the barbarians go wild a lot and aren’t really able to pay attention and keep up with what’s happening in the game, they need your help. Help the barbarians answer each of Tarzan’s questions correctly.\n\n-----Input-----\nThe first line of input contains the integer $N$ ($1 \\leq N \\leq 10^5$), the number of barbarians.\n\nEach of the following $N$ lines contains a single word consisting of only lowercase letters of the English alphabet, the $i$-th word corresponding to the word on the stone tablet of barbarian denoted with $i$.\n\nAfter that, the integer $Q$ ($1 \\leq Q \\leq 10^5$) follows, the number of rounds in the game.\n\nThe following $Q$ lines describe the round of the game, the $i$-th line describing the $i$-th round of the game. Each line will contain the integer $T$. In the case when $T$ is equal to 1, it denotes the first type of round and the shown word $P$ follows in the same line, consisting of only lowercase letters of the English alphabet.\n\nIn the case when $T$ is equal to 2, it denotes the second type of round and the number $S$ ($1 \\leq S \\leq N$) follows in the same line, the label of the barbarian whom Tarzan asked the question.\n\nThe total length of all words written on the barbarians’ stone tablets will not exceed $2 \\cdot 10^6$.\n\nThe total length of all words that Tarzan shows the barbarians will not exceed $2 \\cdot 10^6$.\n\n-----Output-----\nFor each round of the second form, output a single line. The $i$-th line must contain the correct answer to Tarzan’s question in the $i$-th round of type 2.\n\n-----Examples-----\nSample Input:\n3\na\nbc\nabc\n3\n1 abca\n2 1\n2 3\nSample Output:\n1\n1",
        "solutions": "",
        "difficulty": "competition",
        "input": "3\na\nbc\nabc\n3\n1 abca\n2 1\n2 3\n",
        "output": "1\n1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/divljak"
    },
    {
        "id": 479,
        "task_id": 3560,
        "test_case_id": 2,
        "question": "Nowadays, there are a lot of unusual people. We won’t go into details, but instead focus on a certain type, to us personally the most interesting people. Of course, we’re talking about barbarians!\n\nThere are a lot of barbarians, but only a few of them are truly important. This story has $N$ important barbarians, denoted with integers from $1$ to $N$. Each of them has their own stone tablet with their word written on it, consisting of only lowercase letters of the English alphabet.\n\nOur barbarians are playing an interesting game with their good friend Tarzan.\n\nThe game is played in $Q$ rounds. There are two round types and each is determined by Tarzan:1st type:\n\nTarzan shows the word $P$ to the barbarians.2nd type:\n\nTarzan asks the barbarian denoted with $S$ the following question: “Out of all the words I’ve shown you so far, how many of them have the word on your stone tablet as a consecutive substring?”\n\nGiven the fact that the barbarians go wild a lot and aren’t really able to pay attention and keep up with what’s happening in the game, they need your help. Help the barbarians answer each of Tarzan’s questions correctly.\n\n-----Input-----\nThe first line of input contains the integer $N$ ($1 \\leq N \\leq 10^5$), the number of barbarians.\n\nEach of the following $N$ lines contains a single word consisting of only lowercase letters of the English alphabet, the $i$-th word corresponding to the word on the stone tablet of barbarian denoted with $i$.\n\nAfter that, the integer $Q$ ($1 \\leq Q \\leq 10^5$) follows, the number of rounds in the game.\n\nThe following $Q$ lines describe the round of the game, the $i$-th line describing the $i$-th round of the game. Each line will contain the integer $T$. In the case when $T$ is equal to 1, it denotes the first type of round and the shown word $P$ follows in the same line, consisting of only lowercase letters of the English alphabet.\n\nIn the case when $T$ is equal to 2, it denotes the second type of round and the number $S$ ($1 \\leq S \\leq N$) follows in the same line, the label of the barbarian whom Tarzan asked the question.\n\nThe total length of all words written on the barbarians’ stone tablets will not exceed $2 \\cdot 10^6$.\n\nThe total length of all words that Tarzan shows the barbarians will not exceed $2 \\cdot 10^6$.\n\n-----Output-----\nFor each round of the second form, output a single line. The $i$-th line must contain the correct answer to Tarzan’s question in the $i$-th round of type 2.\n\n-----Examples-----\nSample Input:\n3\na\nbc\nabc\n3\n1 abca\n2 1\n2 3\nSample Output:\n1\n1",
        "solutions": "",
        "difficulty": "competition",
        "input": "7\nabba\nbbaa\nb\nbbaa\nabba\na\nba\n7\n1 aaabbabbaab\n2 7\n1 baabaaa\n1 aabbbab\n2 3\n1 aabba\n2 3\n",
        "output": "1\n3\n4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/divljak"
    },
    {
        "id": 480,
        "task_id": 4939,
        "test_case_id": 1,
        "question": "Daenerys frequently invents games to help teach her second grade Computer Science class about various aspects of the discipline. For this week’s lesson she has the children form a circle and (carefully) throw around a petrified dragon egg.\n\nThe $n$ children are numbered from $0$ to $n - 1$ (it is a Computer Science class after all) clockwise around the circle. Child $0$ always starts with the egg. Daenerys will call out one of two things:\n - a number $t$, indicating that the egg is to be thrown to the child who is $t$ positions clockwise from the current egg holder, wrapping around if necessary. If $t$ is negative, then the throw is to the counter-clockwise direction.\n - the phrase undo $m$, indicating that the last $m$ throws should be undone. Note that undo commands never undo other undo commands; they just undo commands described in item $1$ above.\n\nFor example, if there are $5$ children, and the teacher calls out the four throw commands 8 -2 3 undo 2, the throws will start from child $0$ to child $3$, then from child $3$ to child $1$, then from child $1$ to child $4$. After this, the undo 2 instructions will result in the egg being thrown back from child $4$ to child $1$ and then from child $1$ back to child $3$. If Daenerys calls out $0$ (or $n, -n, 2n, -2n$, etc.) then the child with the egg simply throws it straight up in the air and (carefully) catches it again.\n\nDaenerys would like a little program that determines where the egg should end up if her commands are executed correctly. Don’t ask what happens to the children if this isn’t the case.\n\n-----Input-----\nInput consists of two lines. The first line contains two positive integers $n$$k$ ($1\\leq n \\leq 30$, $1 \\leq k \\leq 100$) indicating the number of students and how many throw commands Daenerys calls out, respectively. The following line contains the $k$ throw commands. Each command is either an integer $p$ ($-10000 \\leq p \\leq 10000$) indicating how many positions to throw the egg clockwise or undo $m$ ($m \\geq 1$) indicating that the last $m$ throws should be undone. Daenerys never has the kids undo beyond the start of the game.\n\n-----Output-----\nDisplay the number of the child with the egg at the end of the game.\n\n-----Examples-----\nSample Input:\n5 4\n8 -2 3 undo 2\nSample Output:\n3",
        "solutions": "",
        "difficulty": "introductory",
        "input": "5 4\n8 -2 3 undo 2\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/throwns"
    },
    {
        "id": 481,
        "task_id": 1429,
        "test_case_id": 1,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4 AGCT\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 482,
        "task_id": 1429,
        "test_case_id": 2,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4 ATAT\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 483,
        "task_id": 1429,
        "test_case_id": 3,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "10 AAATACCGCG\n",
        "output": "6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 484,
        "task_id": 1429,
        "test_case_id": 4,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "5000 GCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGC\n",
        "output": "6250000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 485,
        "task_id": 1429,
        "test_case_id": 5,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4964 CGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCGCG\n",
        "output": "6160324\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 486,
        "task_id": 1429,
        "test_case_id": 6,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4986 TAGCCATCCATCGTTTACCGCGCGCGATTGCGGGCCAGTCGATCATCAGCGCATATACGCTACCAGCGCGAGCGATGGCTTACGCGTGATGCCGCGCTTAGGCCTTAGCGCTATAGTCGTGCGACAATGCCGCTGCGGCGAGCGCAAATGGTATCGCGCTAGATAGGCTACGCGCGCGACGCGGGATGCGATATAACATCCGGCGTATCGCGCTCTGCTGCATAACATCATACGCGTGTAGCCTATTATAAATATACTGCGCGATTACCTACCGCGCGTATGATTATAAATTTACGCGGTGGATCCGATGCGTCACCTATACGCTATATAGCGGGGCGGGTCGAACGCCCGAACGCGATACGTTACTATTATACGGCGCGATATATCGCGATGCGGACGATACACGCGCATATATATGATTGTATATCGCCCCTATAGCGAGAGCTCTTCGCATGCCGCGCTATCGCTTTGTTATAGCGCCGCGCGTATTTACGCGTAGTACATATTTCGGCCGTATATGGCGCCGCGCGCTGCGCACGATTCTGATGTACATATAGACGATATAGCGGTATCTATGTACCTATGCCTGCTTGTTATATAAGAGCGTCTAAGGAGGTCATCGCGATAGCCCGGAGCGATGCCGGGCGCTCCTTCAACCAGGATCGCCGATTCGCATAGGAATATAATATATACTGCGATAGGGCCCAAATATCCGCGACGCCGTCGCGATATCCCCCGCGGTTAGGGGTATATAAATTTGTAGTATAGCATTAATACGACTGGCATAGCGCGCGGATAGTCTGTTATGCGCATGGAACATTAGCATATATTATAGTTTATGCGTATAATGCTGGCGCCCGCTTCTATGCATATGATGATCCATCCGCGTAAATACGATATAGTGCCTACGCGATACTCTATCGGCACTAGGGATTGGCGGCTATAAAATATACTAGCCACAGTAAGTAAGTAATAGGGCTACCCTGCGCGCCAGCGCGAATAATAGGTAGTACCATATATATATAAGCGCTGCGCGGCGCCCGCTATATCTCGGGGGAGAGTACGTAGCTGATTCCGAGCTTTTAATACTATTTAATAATCGCGCGCTTTCGCGTTCCGATATTCTCTATAAGTATTGCGGCTAATGTATCTCTATATACAACCAGATATAGATATATTATCCGCAGATCCGCTAGCTTGATATAAATTCCAGCCGCGCGTATATGCGCTTCGCCGCGGAGTATAAGCGATATAATTGGCTAGCATAGCGCATAGTGAAGTATATATCGCAAAGATATATGATATCGCTAATGGCGCGCATTATGGCCGCGTCGCTATACTACTATATCGCTAATATGATATTACGCGCGGCGATCGCTATTCGTATAATACGAATAGGAGCGGCTATGACGCATGCGGCGCTATAATTATAGTTTAGCGTTATAGATCGCGCCGCGGCGCAATCGCGCGCGGAGGACGATATCATACGCATAATAATCGCGCGCTCGATAGTATGTATATCGAAGCGCGGCGTATTCCTGTGCTAGCTGTAGTTATGCCCGTGCGATTAGCCTAGCATATATTCATCGGCCGCGCGTACGAAGCGATAAGTGGTGCGCCTATATTACGCAGTGCTAATCAACGATCGCGATAGCGATATTATTTATGCACGGCTTGCGGCGGCAGGGGCACAATCTCTACGTATATCGAGCATTATTCGTATAAAAAGCCCTATAGTTAGGCGCATACCTGCGAGATAAGTACCTAGTATGCCTATTATCGCGCTCGGCGCTCCTGGGTTTACAGATAGAATAGCGAGCATGCCACTGATATAGAATTATATGCGCGACGGTAATAGGTTAGCGATATCTAGGCCGCAATACCTAGCGCGCCCCGAATTAATCGCGCTTATTAGCGATAATAGAGTAGGCCGGAAGAAGGCAAAGCGCACGCCCGCTAAACGCTATCGTATAATGCGGCTTATTTACGCATATAAATAGGATCGAACGGCTAGCCAGCGGGCGCATATGCCGGCAATCCGTATTGTGGCATACGCTAAATAATATCAGCGGGCGAACGCGCTATATAATACCCGGCACGCGTATATAGGATAGGCGCGCCTATTTCGCGTGATTATTTAGCGCATTGCTGCGTATACGCATAGGCACGGCGTATATAAGCATAACACGTATATATCGAAATGCTCGGGCATATCGCCGCGCTAGCGATTCCGCGTAATATAGTGTTACGGGGCGTATAGTCCGCTCAATACAAATATATAGCGCGCGCGCATATTGGGTGATATACGTCATGCGCATAGCAGAGCATATTAGCGATCATTCTTTATATCCGCGCGTATATACGGATGAGACGCCTTATTCGGGCTTTATCCACGACGCTCGACATGATGGCATGCGATATAGATTTCTCTTTACAGTCTGCCATATGTTATGCCTATTTTTATGCGTATATGATGCAACGCGCCATACGTCAGGAAAAGCGTACTCCGCGAATGAAATACCGCCGTAATTAGCTATTATATCCTATAGCCATAACATCACCACGCGTGCATGCCATTACCATATGCGATATGCCGCGCGCGGCGGTTCTCGAGCCGTATATAAATAGCTTTATCGCCGCGGATTGGGTGGAGATCATCGAGCCCGTGCCACGCGCATTAACGCCGAACATAGCTCGAAGCGGATAGCCCGCGCGCGCAGGATATGCGGCTAATAAGTAAGTACTATCGCGCGTAACTGCGCTGCACGGCGTTAGCACGGTATTTTATTAATTATGCATTTATATGCAAATAAATTATATGAGCCTGCGCCTCGCGCTTTTCGCTATTGGCGCTATAATATATATATACGCTGTTCGGCTTCGGCGATACGTGCTCCCACATATAGCGGCATTTATATATAATATAGGATATTGTCGTCGGCGGGATTGCGATTATCAGCTTGCATAATCCTATCCGGCGCGCGCGTATCGCCCGCGCGGGCTAGTCGGCATATCCTTTCGCGCCGCGTAGGCGTGATCTGAACGCTTAGCGATAGAACGCGACTATTATAGTAGGCGCTGCCAAGCGCATATATATGTCTTGTAGTCGCGCGGTCATAGCCCGCGCGGCGACAAAGCGCGCGTGCCTGCGTAGTCCGTTCTGCAGCGTGCGCGATCCCCGATCGCGATTCGCCGCGGCATTCACTCGCCAAGAATATCGCGAGCGCTGATAATATAGGCGCGCGCGCGCGCGATTAGCTCATATCGCGCGATACCGGTATATAAGGTACGCGGCCGCGCGTCTAGCCTATTATCGCATGTGAACAATATATATGCGATAAATATACACTAGATACAGCGGATTAGCGCTATGTCCGATATCGGCGCGATATTATGGAATCGCAATCTAGACATGCGATTCTCGCATTTATATAATACGAAGTATTGCCCGCCGTGGTTAATTATAAGCGATTGCGGATAGGCGATGCTCCATTTCCGCGTGATAGCACCGGTAATAGCAGGCGTGGAGCGATATAAGGCGATTATGACAAGCGCAGATATAAAATCCGGATATAATACATGCGATACCGAACGGCGGTGATGACGGATTATAATAGCCGCGCGGCGGCTATAATATTGGTCGCGATATGCGTACAATAATTCTTACGCGTCTATCGCTAATATCGCGAAATGATAACAAGTGTACGCGTAATACGCGCGCATATAGCGATCGATCCGGCAGTATTCGCGTAGCGGTGGCTATCTCGCGCGCCTTGCATGGCGATGGCACCCGCCGCCTCGCGCGCGTAATGATTAGAGGCAGCGCTAGCGCAGGGATTATCGCCGGCGCACGTATTATGCCTTCGTTAGCCAGCGCGCGGCGCATATATGCGGCTCCCGCGCAGTTGCCTCTCGCGCCGGTCGGCCTCCATCCTTATAATAATGAATCCCAGCTCTAATACATCGACCCGGGGATACGGATAATATGCTGTACCTCGCACTAATACCGCGCCGTAAGATCGATAAATATATATTATTAGGACGCTATATATGATCAAAACGCTTAATCTATATCGCGCTACGGCATAAATCCGAAGCTATATGCTGCAAACGTATACCGCGCATTAATGGATCGCCTGGTATAATGCGGCGCGCTAAATCGGTATGCGTAATATAAGCATAGGGGTCTCGGCGCAGTCGGCGCACGCGCGGCGCGTATCGCGCAGCCGAGTGCGATACGCAAATACGGTACGCGTCGCGTCTAAATCGCGCATACGCGCGGCGCTCACGCGCCTAGATCGCGATGATCGCCCTCGCGCGAGCGCTCGCGAGGGGCAATGCTATATAATATATATGCGTCGAGATTTAGTATAACGCGCGCCGCGCCTATTTAAGGCCGCGGCCATATAATATAGTCAATGTATTATGGCGCGAGATCCGATTGCTCGAGACGGAAGTTCAGCCGCGCTTATAATAATCTAACGGGTAATGGCAATATCTACGTACGCCTAGTGATATCGGGTAGCGATTATGAATATCCGACCGTATATAAGCATGCCGATAGCTAAAGCAATTTTATTTATCCGGCAACGGAGTATAGCGCAACCCGATACGCGGTAAGCATGCATCTAATGCTCATCGCCACAAGGACTATTCTCGACATATGTCGCGGATGTATCATGCACTGGCTACGGTTTCCGACGGCCGCGCGGCGGTATATATAGCCGCGCTACTAGCAATTATCGTAACTCTCGATTAATCGGGCTCGCGATATCTCTATAATATATATATACTATATCTGATACCTAACCCGATTAACGCCCGTACTGTATATAGCTATTATACAGGATTGCGGACGCGGCGCAATCAGTTATACATAGGCCGCATCAGTCCATAGTAGAATAGCTAATATCGTTGTCTTAACGATGCCGTTGTAGCGACGGCGATATTATGCACGGATGCATATGGTTAACGCTATCGATATGT\n",
        "output": "19561\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 487,
        "task_id": 1429,
        "test_case_id": 7,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4903 TTCGGGCGCCGTGCGAAGGGGGCCGTTCGATGGCTAACGCTTGTTATAGCCGGCTTATTAACTTCGCGTATAACGCGCAAATGTATAATTCGCCCCCTGCACGCGCGTATCGATGTATAAATAACTGCGGTTAACATATTAATATACATAGAGCGAGTGCGTATGCAGCAGCGTAGTAGACGATATATGTTATACACATCGGCTCGCCGCGCTCGTACTATATATCATACCGCTGATATGCAGCGTATAATATCGCCGCGCGCTCGTAATCGCATATATACGCGAGAGGTTAATTATGAGCACGCGCGCAGTATACACGTAGCGCCGCGGGGGCTAAGCGAATGAATATAGACTAATATATATTATAACGCGTAGATCGTATTACTAAGATATCGTACCATTAATGCGCTATAATTATGGTGTACGTATCGCTGCGGCGTATGCGGTCGCTGGGCGTACGTTCGAGCGAATACGCCGCGTATATTAGCGTTACTGTACGATTGAGCGATATTCATGCGATTTATTATCCTTTTGCTCGCAACGCGTTAGCTAAATACGGCTGCTGTCAGCGCGCCATATTAATGCGTATATATGCGAGCTGTAGATATATTGATACGCATGGCGCCTATTTGCCCGCCCGCGTATGCATTTTTTATACGTAGCCGGGGTAGCGGCTAGCCGCGCAGCGTGTGCGAGTATAGCGGGATACACGTTTAGGTAGTAGTATAGCGGGGTCGTCAAGCAAAGCCCGCGAATATTTCATAGCGCGAGCTAACAGCGTAAACGCGCTTAACGCGCTTTCGACTCGTAATATATGCGCTGGCCCTAATAATATTGCCGCGCGCGCGCCGCGCGCGCGCGGCCCGTGACTATCTCACAATGTCTCACATATATTGTATGAATTGCGGCGCGCTGGATCCCGATTGAGGCGGCCGTATTACGCGCGCTATAATCCGCGTATGCGTATCGATATGCCGGCGCGTTAAATGTTGTATGCTAGCCACGGGCTTGTCCGTACGGTCTTTTTAAATGCGATACGAGCGCGCGCCGGGTGCCTGCGCTTTGGCGATAGAGGAGAATATAATCCGCGTCGAATATATGGATGGCAAATTAGTGTTGTAGGGTATAGCGAGCGTATTCAAATTACGACTGTCTATGCCGCCGCGGTAGGTATTATCCGCTCGAGCATCGTTATATAGCGAAAAATTAATACTCATTCCGCATAATCCCTACGTATCGACGATAATATTATACCATTCGCTGCGACGCCGTTATTACGTACATTCGGCGCCGATAAATAATAATATATATAACCTAGCTAATACCGCGGCGGCCGTCATACGAGACTAACCTAGTATCGGCGCAGGCGAGCAGCTCCATCGTATTGCTTGCCCTTAAATATATAATATAAAGAATTATATAATATATTGGCGCCGCGGGCATGGTGCTATTGGCTATGCGGACGCAGCGGCGATAACCCGATACGCGCCGATCGCGCCTGATTAGCCGCGCCGTGCTACACGCTAGCCTTTCCATTTTCTCAATCGCTATGAGCTCCGTAATATGAAGCGGGTGCTAGAATGCGCCTCAGTATTGCGCCTACGCGATATATTGCTATGTGTGACCTATAAATCGTCTATTTAATCGCGCGGACCTCCGTCATAATATATGCTAAGCGGAAGTATCGCCACGCGGCGGGTGCACCCGCAGGCGCTCCGCAGCATATGAATATATAGCATATATGCGTCTATCGCGCGGGCTATGCCGCCGGGCGTAACCATGCCCGCGTATATATATGCCTATGTATAAATAGATTAGCGCGCCAGATAGCCGCCTATTGCGCGCCTATAACGGCGCATCGATATACGGACGCATCGCTGTCGCGCGCGAGATATCATTATGGGATAACTGCAATTCGATCGTAATGTAACGCGATATTGATCCGCGTATTAGCGCTCATGACATGAACGCTTTATAGCCGAATATTGCGGCGCAGCGCATATATGGCGCGATATTAACCGTCCTTATCCGGGATATTACTCTTACCGGGGCATATTAACGCGAGCGTTACGGCGCGCTATATATAGCGATCGGCGCGATCGCGCCAGGTGCGGGCGTATAGCCGTGAGCAGAGCGCGCGTTTGCGCGATAGGCTATGCCGGGGTGACGTGGCCGCATATTGGCGAGCAATATAGACTAATCTATTTAGGCTACTAATACGCGCGTCCCGCTGTTATCAAAATTATGTATCGCATTAGCCATTATATAGCGAACGCTAATATATACCCGCTGAGCCATGCATTGCGCCTATCCGCGCGTTTCGCGAGTTGATAAATACTCATATGATAAGCCATAAGTCCATCACGTAGCGCGCGCACCTAATATACGGCTCAATATATGCCTAACGACGTATTATCGTATAATCATCGCGGTGCGCCATGATCGGCATAGCACCGCCGCGCTTATATAGCGCGCGGCGAATGTAGTAATGAATCGTCCGTCTGCAGTATATTTCATTAGTGTCGTCCGATCTACGCTATATCGCCCCGCGGCGATGTTGGCTAGCATGAAGATATATATCGCTAAATCGCATTGGCGTGCCGGTGCCGCGATTCGCCGCTAGATTAGCTTATAGCGCGCGCCCGCGCCATGCTCGCCGCTAGTGCCCTACGATACGGTTATATAATACAACGCGGTTCGCATAATATAAAATCTATGGCGGAGTGCCGGGCGCACGCTGTATATAGATCATATTTGCGCCTGAAGCACGTTAATGGCTCGCAATATATATGCAAAAAGCGCGCGGGCATCCGTATATCACTATTATATATCGCCTTTAGACGCGCGTAATATACCGCGCATTATAGGCACGCGCGATTATTGCATCTATACATAATATGCTTATTCCGCGCAATAATTTAATTTACCGCCGTTGAGGTCGGATAATCATTTACCTCGCGCCGTCGGCACGCAGGTTCGCGACATATAGCAATATTTACTTAGTATCGAGCAGCGGATTAAAAACCACGCACACGTGCGCTGCGCGTAACTCTAATATATCATATATATAGTTACGCGCGCGATCGCGCCATCCGTGCGTATATCGCTAGCAGGGCGACGAATCCGTAGACTCGTAATATATGGCATTGCGCATGTACATATAGCCGCGCATGATCTGCCGCATATTCTACCCATACCGAGCGCATTCTTGCGCGCTAATATTCGATACCTATATAAGCAAGCATATAACTCCATGTATATATAATGCCGCGTTATATTATTGAACAATATCGATATAGCCCTATCGTTTACGAAATTATTTGCGCGACGCGGCCCTTTTTATAGGGAACGCCATCAATATAGTTACGCGATATTCGCCAGATGCGTACGATTACTCAATATGATTGCAATTAAATATATAAATAAATCGATAGGGCATGTTATGCTCGCAATAGCGGCTCTTATATCACTCGCGCGCCATGGCACGGTGCGCTCCCGATCGCGGCGCTTCCGAGCTATGCGCTAGTAGGGCGCGCGCCTTACGCTACCGTATGCATTGGTGGCGATAACGGCGCTAGTACGCGTATAGAGGGCACATAGCCCGATTATGAGAGCTATTTATGACCCCACCGGCGCGCGCTAACGTGCGCCCGATAGGCAGCGATCGCGCGTAGAACCTGTGTGAGTCGAGATCCGCGCGCATTTAGGCGCGTATATCTCGCATGTCGCAGCGATATAACCCTGGGCCGCCACCCATCAGTCCGAGGCGCCTCGCGCGGCATCCCGTAATTATTTCCGTTAATATGCATCAACGCATAGACGCAGACATTAGGCGTGATCGCGCGGCGCCGCCGCGCGAGCGGATGCGCACGTATATAAGACGGAAGAGCGCAATATTAATATTGCATGCGCCACCCACAGAAGACGTTACGCGTCATCGCGGCCCCCCTAGTCTATATACGTTATGATTAATGTTACGTATCTAATATCGCTCACATATCGGGGAATAATACTTATATGATATAGGGCCCCCATTAATATATTAGAACGATCCTACTATCTGCGCCATGAATCGGGGCTGTGGCTAGCAGATCGTTTCTAAGAGTATCGCTACGCTAATTAACTATTGCGTATATTCATCATTACTGTAATACTATACATATAGCGCACTTGATGATGCGATATAAGCGATACGCATACGGCCGCGGGCTAAGACTAAGAAACGCGCGTAGGATTATTCGCCGTATAATTTTCCGTAGTGTCGCATAACGTAGATTGCCCGTATTATATACGCGAGATCCAAGATATATGCGATGCCTCGCGCTACTAGGCAATGCCGTATCGGCGCTCGCCGCGAACGCCGCATTTTAATATCCGAACGATGCCGCGCCTTAGCGCGCCGCAGCCTGCATACGCTGGCGCGATAGGTATCGCCGTAGACGCGTATGCGCGCGAAATCGCGTAAACCTTCCCCGTAGCGTCCCCGTCTAAATCAATGAAGCTGCCCCGCGCTCGCCGCGCGCATCCGGCATGGAGCCACGATATCGCGGGCGTCGCGCTAGCCCGTCGCGCATATAGTCGCCCGCGTAAACGTCGAATCATGAATCGCGCGAGAAGGAATACGACTAATACACGCGTACCTATTATCCTATCGTATATGCCCATATCGTATGTCAAATATATACGCATTAAAAGGCGCTATACGCTACTAATCGCTACATGCTATAGCATATTCCTAAGCGTAGCGTGATGCGTAAATTGTAGCGCGGATTATACGTATCGCCTATCCGAACTACTACGTCTATTATATCGCGCTACTATTATCCGTCGCGCCCTCTCAATATATTATTATATCGCCGGTAAACGTACTAGGAGTGATCGCGACTATAACGTACGGAACGCC\n",
        "output": "21693\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 488,
        "task_id": 1429,
        "test_case_id": 8,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4995 TATGCCCCATATCTTCGCCAGCCGGATTGTCGTAGAATACTCTTTAGCGTTGATTTAGTGATATATGATGACATACATCGGCTTCATATGCGCGTTAGTCTATAGCCATTAATCTAATGAGAATATAGTTAACCAGTATTCTTTCGATTATACACGTTCTGGATATCGCCCATTTACTACCCCGCGTTTACACGAGTATTTGAAGGCGAGCACTGCGGGTCATGACGCTATCCAGAGCATGCGGTTGGACGCTCGCTCTCGCCGTGAGCCGATTCCTAATGCTGGCCGGCATACGAGACATAACGAGTATCTACGCTAAATATATGAAAGGCAAATGATCGCGCGGATCGGCCCCTGATATATACGACGAGAATATTATAAGAGGCGTACGCTATCGACATGGCTTGTCGCGCCTTTGTGTCCCCTAGCTGTATAGCGGAAACTACGCCTACCGCTGCATTATCTTGGTATATGACTGGAATATACTTTAAGCGAGTTATATATATTGCGCATGCGCGACGTATGCAGTCTATATCATGCTAGGTGGATAGTTACTCATCCTATATACAGAATTCATAATATTATTGCTGGCTGCTGGGAGGCATTATGCTACGCAGCATACGCGTTATTAGCAGCCTCACGCTCGTTCGGTGCTACTGCCGCGCGCAGCAAAACACCCTCGGCATAATAGCCCAGGATAAGGGCGACTTTTATACGCGAGAAGCATTTATTCAAAGGAATCTACTAAGATATGCGCGCCGAATCCCTCGCGGCAGCACTGACGATTATAAATATGATAAGCGCTCTATAAGCCTCACAGATCGACTACTCAGTAGCAATAATAGCGTTAGCTTTATTTATTATTCGTAAAGCGACCATCAGTATACCCAATGTACTGGCTTTCGCTCCTCATCTTACCCTCCTAATGATCGTTCACTACGCTATAGCATGGCCATTCATGTGCTTTCTCTAGATTCGCGCTATGCTGTATCCGCTGCTGATCCGGGCCGGTCGCGATTACGTAAGCTTGCCGCTCCATCCGCCGCATCGCGTCTCGCATGACGCGTCGTTATGGGTACTAGCCCTTTCGCGCCGACGCGGTCGTCCATTCGTCAGTTTACGCCGTGATCGCGCGTGACCTCGAAATCGACGCGGCATGTATCGGGCGACGATACGGCCTTTGCGATCATGGGAGGTATTCTGCATCGACGGCGCCCATGCAATCTCATGTAGTAATCTAATATTACCAGCGCACGGGCTGCGTCGTTCGCGACCACTCACGGGCGGTAGGCACGTACCCTGTACACGGAATAGCGGATGCCGGCGCCGCGCGCCGCGCCGCGCGATGCCATTGCACAGAGGCATGCTACACTTATCGCACGCTCGCGGACTAAGTACTATATATCACAGTATTGATACAACGAATATGGACGGCGGGCGCGGTATGGCTTGAGTAGCGCGCGACAGCAGGTACTTTAGTGGTATAATATACATGGATATCGCACGCGCCTAGCCAACCGTTCGAGATATTTCGTGCTCACCGCTTATGTGCCGTGTCAGTCCGCTTATCGGCGGTATAATAAATCATATCGTTATCGACAGTTCGATGTCCGCGATGTCTCACGTACTATTAGAAGCCCGATACATAATCGCGGTGCGCCCGTGCCTTATCCTCGCCGCGCGCGGCGCTAACGGCCGTCGCGCATGAGATGCGATGATCGAGATTATTACGCGTGAGGTCCAGACCACTAGCCTGCGCGATAGCTTGTTAGCGCTATTAAGAGCGCGCCCGTTCTAGCATTCGCGTCAACATACGTATGCCTAGCTATAGAGCCCATTATATTTTCTGCTAATCGGTTGGTAGATATGGGCACACGATGCGGTCGCATTCGCCGAGAATAAGGCTCATATACCAGACGTGGCGATATATAGACGCTCACGAAAGCAACTACTCCGTAACCTTGACTAATTCCGTAGTGTACGTTGTATGATTGCTATTTTACTGTATGTGGTGCTTCGCTTGGCAGTAATTATGCCCGATCGAGCGCATATTTCGCGGAGCCTATACTATCCGTCTAGTAGCGATTTCCCGCGAGCGGTATCATTTACCCGGCAGAACAGAATCTTCTAAATTGCGAGATCATACTAGTCAATAGTGCGCCCTTAATGTTTACGTATTGCGAGCCGAATATATCGTATTTGAGGTAAAATGATATCCAGAGCACCGAATTAATGCAAATAAGCGACGAACGCGGCTAGCCGGTCGTATTCGCTTAGCAGCGCCATCTACCTATGTATGGTCGCAGGCAGAATAATTATATAGATATGAGGTAGCATATTAACCTGCGCATCGTCGAGCTATCAGTCATAGCCCTATGATGCGAAGTATGGGTTATGCAATAATAGCGCATCGCTAAGCGAGCCTTGCGCATCAATCCTCTATAATACAGTATAGTGAGTATCGGCATCGCGACCACCATCGCGGGTAGCTGATGAGTGTATACATATTGGAACGTTAATGGCTCCGCGCGATATTGCGATCGCGCCTGACGGGCAGCGGATCAACTGGGTGCATTACATAAACCGCCGCATTAGCCGTCATCGTATAGTTAATATATCGGCTACTAGCCGCGGCGCGAGCTTATCGCATCTATCTAGAGATATGATGATTTTACCACGCGGCGATATGTTAAGGTTATATATAGTGCGTTGCTGCAGGATAAACGCGGAAATGCGCGTCGGGATATATGCCCGACATAGAATACGTATAGAGCTTATATGTACGGCTCAGCGGGCGATGGCATATCTGCGCGGGCGCCAAAAATTCCCTGTGCATTTAGATATCCGTAAGCCGTGCGACGCGCTGCGGGCATCTAGTAATAAGGTAGCAGTATAGTATGACTCGGGAGGCCTACGCTGAGCGTGAATCAATAGTAGTTGATATAGAGAATTAGCACCTGCGAGAGGCGGTACGCGGCCTCGTAGCGACATATTACGGCAACCACGAATGCTCATGCTAACGGATAACTCTCCGAAGCCTATGCGGCCATTGAAGTTGATTAGTGAAGCGTTACGCACGACGTTAATATATTGCGTACGGATAAGCATAAATTCTCGCGGGTTACCGTAGATCAGAGACTACGGCATGAGCGAAGCCAACCGGAATCGACCGCGCGACGCCGTGTAGTCAACGCGGGTGGAAATGCGGGCAAATTGCTTAGCGCAGTAGCCATACGTAACTATGCCGGCGTGCTGAAAAGCTAACAGCTACGCATTATATTACGCGCAAGGCGATTATACCGGGCGCCGCATATTCGCCGACCGAATGAGATAAAATAATAGGCTATGCGGCAGGGGCAGGATCCCGAACCAGCCACTACCTATGTTGGGTACGGGCTTAATTTAGGCACTAGATCGGGTCCGGCGAAGAAGCCTCGTACATATGCAATAACGCGGTATATTACGTAATTATATACGCGCCATATGCCGTCAATTAAGCCGTATACGCGACCTCATCGTTACCATAGCGCGGATCTGCGCTACGCGTTATAATACTATAATTAGCCGCGCAAACTGCATCTCATGCCTGACTCATAACGGTAGGCGTGCGCAGACAGCGATGTTGCCCGGGCCGCTTCGGGCGGGCGGGCGGGCACGGTATGATCTACCACACGGGTATGGAGAATGACCGAGGCAGGCATGATAGCGCGCGTGACACAATAGTCTATATATAGGCGCGCATGCCTCCGAGGTGAGCTATGTGGATTATAATGGCCGTTTCGCTCATTCGAGCATATATGGCAACTGCGGGTAATATAGACTTTGTCGCCGGCGCGACGGAGCGTAGCGCCTGGCGCGCATGTGGCATTATCAAGCAGGAGGCGCATCGGATTGGCGCGCTATATAGTACCGGGAGCGGTTAGGCGATCTAGACATAGCCAGCTCATGTAGGCGCGGTTCCGGATGGATATTCTGCCCGAATGTGCTGCGATCCGCACTTATGACGATCTATATGAACCGCGGTTTATATCACGTGCTAGTATGATCGCTCGCCATATACCCGCGTCAACCATATTGGCCGTGCAGCAGTCCGCTTTGGCACTCAGTTATAGCGATTACTCCGGCGCGATGTATCGGCTAGGGACGCGGTATTCGGCGTTTGGGGAGGTTCGCGGCACTCTAAGCTATTACCGAGGTACATTACGAATGGCCGAATCATGAGAGTATATATTAGCATAATAGATGGCAGCGCTTACGCGGCATTACCCGAGAGTTACGCGAGCGATGTCACGCCTAACGCAGGCGCAAACGGCGTTCGCGCCATCAATAGCCAACGCTATAGTATGGATGCGGGCGTGCATGCCGCGAAACCCTAGGAAAGTGCCGCTACCGTTTTCGAACGCCTGCAGAATGCCCAATATACAGCCAGACCTTATATCCACTGCCCTAGGTGGAGATATTTGGCATCGGCGCGGCGCCCCGTGCCTGCATGTCGCCGATGACATATGTAATGTCTCGACCACTATGGCCCGAGCTTATTTATCTGCAGTTCTACGCATTACCAATATACAGCGCTTACGGCAGCAGGACTGCGCTCCGGGAGTACGTTATATCGGGAGCGCTGCGTCGGTCGGCGTCGTACCGCTATAATACGAAGGTATATACGCAACGACCGCAAATCTTAATGAACGTCATCCGCTGCCGATATGATCGAGCGCTGCGCGAGGCGCATCAATACGACACGGCGCGTAACCCGGGATTCGCCGCGCTAGATAATGAGGGTTATACAGCTGATCATAGCTATGCAGGCGGCCCCCTCACGCATGCGTAAGCGACGAATTACGTAATATATAATGTAGGGGTACGGTATTCTTACGAAGGGCCTCTATGCCTCACGCCCTGGAGTTTACGTTGGATGCGCGAGAACACGCGCATATACGGATGCGGGGGCTATATAACGCATGCCAACGAGAATTATGTAACGAAGCGACGCGG\n",
        "output": "13632\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 489,
        "task_id": 1429,
        "test_case_id": 9,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4979 ACCCAGGCACATCGGTCAGATCTAGACAGCGTGGAACGATACGTCTCGCGACATCAATATATTGGCATACATACCATGTGGTCGGGCGATGACGCGCGGCGCGCGGGCGCCCGTAGTGTGAATGTGCAATATATCACCGCAAACCCGCCCACGCTCGATTTTGCGTTTTGGCGGCACGCATCCGTCTATGACGATGATCGCCGGATGGATCGCCTATCCGGAGCATTTATGGTTCCGCTATAACTTAGCGGATATAGCGCACTAATAGTCGCGGTACGGTTACGCTGTACTCGCTAATGATCCCGGGTAGGTTAGTGTCCGATATATATGCGCCCCTGAGTATGGGTAGTGCGTTGGATCGCGCTAGTACACCCGCATAGATAATCGGCATAGTCGCGTATGCCGTATACGCGATATCTATTTACTACGCCAGTGGAGCCGGGCAATAGATCGCAGACGATCATATCGTGACGCCCATTCATGATTGCCTGGTGCCATATACGCGCATGCTTAATTGACTATCGAGCATCTATCGCTTCGCGGCACCATGCGGTATATATAGGCCCAGCCAGCTCCCGGCCGTCTGGTATTCATACTTTACAGAATATGAATGCAATGAGCGCCAATGCTCATCATATTTGCGCGCCTGGCGCGCGCTGCTTGCACGCGGAATATCTATGGTGTTGGCGATCTGTCGGCCCGATTATAGCCAACGGCGGTTAGTTCACTTGGGGCGACCTTAACGGGCGCCGCCGCAGTACGGCATAAGAATGTAAAACAGATCTCATCACGGTTCGATATTCGCAGCGCGTATGCGCCCGTAACGCGATCCGGCAGTGTCCCATTATATCTACGCGAAGATCTATTAGCGCGCCGCGCGTATTGTATTTATTTACATTGAGAGAATGACGAATGCGACGCTTGACATTGACGGATAAGGCTGAGACCTTTGCAAGGTAATATTCACTTCAATAGGGGGGACCATGCCAGCCAAGACCGTTCAGTATCGTGTATAACGCAATGCGCGCTCCGCTAGATTTTAATCTTACTTCTAATATATGCAGCCATAAGTTCGGATCGGTTATATCGCTCGATATATATAGCGTATTCGACGCGCCTTATATGTGCTGCGGCGCGGCGCGAGTCGTGCATTATCGACAAAACGGCATTCTGTGGGATAGGGTTCCTCAGCCTTCAGTCTGTGCGCGTGTATATCAACTTAGGCGGCGCACAAATCGTATAGGCGACTAGAGGGCAAGCGGATCATTTGCACACGATACTTCCGTCAGCGAAATGGAGAATACCAACTACATAACATTAGCTATATCACACGATATCGACTTCTTCGGTGCCAGCGTCGTCGGCGCCAGGTTTGATATTTAGGAGTATTTGTGCTCATCCACCTGCTTACATATGCATTAGCTTTAGTCGATATTAGGCGAATATGCGTTAACGCACGTCGCTTACCACGATGAGCGGTATGAGTTACCGCTAGAACTATAGTTGTACGCATCTGACGACTAGGCTGAGCTCCTCGCGCGAATTCACGCTCCTGGACCCGCCTGTACCGTAGCTCGCATCTACTCGCCTCTTTTCTAGCCCAGTATAGCAAATCTAAAGTGGGCGCCGGCATGGTTAGTTGCCTGCGCGCAGAGTATTAGTCCCAATAATACACGGTGACGATCATCCAATTCGATAATGGGCATCTTTACTTGTACCACGGCCATACAGTTAGCTTCGCCCCGTATGATACAAATACCGGGCGCTTGCCGCGCTCAGGCTTTAATATGATCGCGTATGAGCGGCGCACATATATCGTGCTCTTATAGCGAACAGCATACTAGCATTCGCGGAAGGCAAAGTTTGCGCGTATATAATAGCGCAATGACCAACAGCCTTCAACCGAATGGAGGACTCGATCGGGAATCACAATCAGGATTGCACCCTTCCGCGGTCTCGCGATTCCCGCTCCGATTTATAGTATACGACTTGGCCCCTAACGAATAATACCGCGACGCTCCACAAGATCGCGCATTAGCTATAGCGGTGTCGAGCAAACGGTCTGTGAAAGGGCGGCGCTGCGCGCATTCCTCATGTATCGCTCAAGTCTACGTTTTAATATATGGGCGAGCCGGCGATGCCCCGTCAGGGATAATGCATTCGTAATTATTAATTGAGGTGACGGCTATAATTACATTATGTTTAATTCCGGCCAGGCCAACGCGTGTGGCAACGCACGTAGAAACACCGCGCTCGACGAGGTGGCGTACTATTCGTCGATTAGCTAATGGCTTGTATGCGTCCGTCTAATGGCGCGCCATCGTAAGATAGTGGTCACGCTTTTAAGATGCAACACTTCATCTTTCTCGATTTACGCCCGATATTCCTTTGTTCGCTTGCTCAGTTGGTTCGGCCGGGCCTAGGCACAAACCGTTGTGCCAGATTATTTTAGCCAATACGACGGGACTACGCTAATCGTGCGCGCGGCCAATAGCGTACGGAATCGCGCCGCGTCATGTACCCACGCTGATACGTACCCGCTCTTAGAGTAGTCGATTACATTACTACGGCCGCCTTGCTTCGTAGCGAGCATGCATATACGCTCTTTTCCACCTAGTCCAGATGATGCAAATACGTGCGTATAGAGTACCGGCGGCGTCTATTTATCAACGGAATTTTAATATGTAGTAGGGGCTGGATAAGCATTCTACGGAAGGTGCAACTTATTGCTGCCCGTTCGTACGAAGCATAATGACCGCTCGAGCTTACCGGGCACGCGTATATATACGATGCGCGCAGCCGCGATTCCCACGCGCACGTGCATCCCGCCCATGGGTTTATGGCGGCTTAGCCCTATCCTATTAGCTACTCGGTAGCTCCGAGAGCCATGCGTAGTGCACGGTCCGCCCTGAGACTAATAAAGCATGCGCAGCAGTAGCACAGGCTATACCCTCGATAATGTATGGTCGCCCTGCACGCGCTATGCGCCCGCCGTCGACGTGAAGCGAGCATATTTCCAAGCGGACCCGCGCAGAATACGTCTATTAAACGCTGCGTAGCCTTAACATAGGATGGTTATTGTCGCCGCAATTACAAACGGGCAGCGGCGCGCCTATAATTTAATCGGCCGGCGCCATTCAACGGCGCGCCCGCGATACGGCGATTTAATCTTTTAAGTTGACTCGATCCTGTAGTCTAAGTCGCGGTGAAAGAGTTTAAGATAGATCGTTCGACGAGAGCTCGGATAAGATGAACTAACGGCATTACATGGACTCGTTGTGCGTTCCCTCTCAAATGCCTGTGCGCCTGTTACGCGTGTACGACGCTGTATCCTGTGCCTTAAACTGCCGGCGACCGTTAGGCAAAAAGAGGTCATAACGCAGGTCTCGTTATACGTAGCGAACTTTCTAACGGGAACATAAGGGGAGATGTCGCGGCAGTGCAATCCCGCCGATATACCTTAAGGTTCGTAGTATTATTTATGCATCTCCCGCATTATACGTAGTCGCTAAGTGCGGGCCTCTTATCGTCCCACGAGCATTATGCCGTCGCTATGCCGGAGTTAATATAAGCGCTTGCTATACATTGTACGGAATGCCAATTAGTTCTCAAGTGACCCGTGCTGATACCCTCTTTGCCCGGGGTTAATATCGATCGCTGCCGTCCAAAAATGAGCAGTACGCACCGTGGCGGTGCGATTTAGCATTACAATATATATACTATCCTGTCGGGGCGCAGCCGCACGCGCGCTCCTATAATAACCGCGCGCGAAGACGGCGCATGTTCCATATGCGAAGAAGCGGCCACTTGCCCGCGGCAGCGCTCCATACGTATCTGACAGTACGCTGTATTATCGACGATATACCTAAGCGCGGTTCATAATAAACGCAGCTGCGCGGAAAGCTGCCCGGGTGGTGCGGGGCTCGGGCATATATTATAGCTACGTACGTAGTGTATGTGTGGGTTCATGCGCTCAACGCATATCGCCGGCCGCGCGCACGGGCTGTTTATTATACGCCTATACTGACTGAACGCGTCGCACATTCGCGCGTTAATCAAACACGCACGAGATACACCTTAAAATTCGATTCGCTTATTAAGGATCCGACTGCGCAGACCATCGCTGAGATATCCAGGGGCGAACGCGATATTTTTCGCTGGATTACGCGTTACATATATGGCTGTTCGCCAAAAGCGGGTGGTGTCTCTATCCTCCGCTGGGATATGCAACGCGTTAGTACGAAATTTTAACGTTATCATTAACAGCGCAAAAAATCAACTTTTTCAGATCATCGCAGCCAAACCGGAGAACTTCGGGCCTACAATAAAATAGCGCGAAAGAAAATTCAAACGTGGATTATATTATGCTATTTCTTGAGTAGCAATTAAGTATTCGCGGTGCGATCGAAGCTAATATCGTCTAGGGATCGCTTACGCGCGCTCGCACGATGGGATAATGAGGCCTTCATATGGATTCTATGTTAATATGGTACTGCGGCTATCCGAGCTCGTAGAATCTAAGGTGCTGCTCTATGGGATCAGCTAAATACCAGCGCGTTTCATAACGAAAATTCCGGCTGCTAGGGCATTGGCCATCTAGTAATCCGCGAGCCCTCATTCGTTACCGCGCGCGTGTTTGTGCGCGACGATAGGACGCGTCCGGGCAATATCATCGAGGTAGTACCATATCGTAAAGCCCGGAGCTGATCACGCCGCGATCACGATAAATAATCGATATAGCGGTTCATCGCCGGGCCGATTAGCCGGATTAGGCGTATGGTAGGGTCCGTCCATTTACGCCTATTTGGACTTTGCGTGTAGTTACGCCGCGATTAAGTCACGGAGCGCGACTATCTGCAACGGCGGCGTGCATTTGACAGACCGTCTCGCAACATGGGCGGATTCCTAGTCTGGCATATACGTCTAGATACCGCCGCACGTTAATGGTCACCGCATCATACGGTGGCCATTGGAATTCG\n",
        "output": "17427\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 490,
        "task_id": 1429,
        "test_case_id": 10,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4978 ATTAGCGCGCGTTTAATATACGCGCGCGTGTATACGCATATGCGCCGCGCGGTAAGGCGAAAGCGCGCGTGAATCCGCGTCTATATACGATCGATATAGCTATACACGCGCGCACATAATATATAGTCGGCTATATAGACTACCATAGCATATGCGTAATAGCTAGATATATATATCGCGGCGCGCATATAGTTTCGCGTCGCGTATATAGCTATATATATATATATAGCGCGCACGCATAACATATAGCGCGGCTGAAATATACGCGCACCGCCAGCGGCGTGCGCGGCGCGTTCTATATATGTATATATGTACCCACGCTGCCTATCCTACGAATCGCTCGGAGGAATATAACGGCGTACCAGATCGCATGCTTATATATCGGATATATAGCGTATAGCGTACTATAGCGCGTTTTATGGATAGCGCGATGCCTATGCGAGCGCGCCGCGCGTAAAATATTATATACGGTATAGCTATATGCTGTACGTCGTATACGCCATACGCATAGATTATATATATGCTGCGCGCGCATGCGTATAACGGCTATATAGCGCGCTTATTATATATGCGCACGAGCGCGCAGCATGCTGCGCCGCGCGCGCATCATATTATGTGTATTTGCTGCGCGCGCGCGCCAATCTATACGCCGCGATATGCGTATATATTATGCATATAACTTCGCGCTCGCGGCTTAGCGCATACATATATATTACGCGGGCATATTATTAGTATTTACTATAGCATACGCGAGCGCTGCGATATAATCTTATAAGTATCGTATAACGATATAGGAAATAGGGCATATATATAGATATATACTCGCTGATCATGAGCTTTACGACCCGCGGCATATTTATATCTATCGGCGATATCGCGTATACGCGTATATATATAGCGCTGCGCTATATATCAGATAATAATCGCGCGAAACTTCGGCGGCGCGCATCGATGCGGCGACTCGTGCGATGGCAGTACATATACCGCGCGCGTATGCATATACGCGGCGCGCGCGCGCGCGTTAGGCGCTAGCGGCCGCCGCGATCGTGATATATATATCACGCGCGCTCGCGAATATCACTCTTATATATTTAACGCCGCGCTGCTATATCATACGCGATATATAGCGGATATTTATAGAATCGCGCACTATGCGATATATGCATGCGGATAGTTACGCATACGCCCGCGCGCGCGATAATATTCAGCGCTCGCGCCGCGCATGCGACGGCGTCTGCGCGCGCATCGCGCATGTATTATATATATATATATCTCGAGAGTGCGCGAACCGCGTATATTACATATACGGCGGATAGATATATCGCATCGCGTAGGCGCCGTATATTGGCGCCGCACGGCCGCGGCGCGCATATATATGCACCGCGCGCGACGCGTGGACGATACTATATTTAATATCGCATGACCCCTGGCCCATAACGCGCATATGCGCGATATATATTATATATATATTATCGGCGCGGACTGCGCGCGAACCGATAATAGATATATCGCGCGCGTGCGCGCGCCGGCTACAGCGGCGGCGCTATACGCTATATTAAGATAGCTGCCGTATGCGAGCGCGCGCGGTTTAGCGGTATACGCATATTATATATATTCCCGTAATATAATGGCCGCCATATATATAGCGCCATAAGCGTATATATTACCTATACTATATGATATATATATAGCGGCGTGCGCTCGTATAGCGAATATATATATTATATAGCGGCGATATGGCGCATATTACCGAATGCGAGCTATATCGCGCCCATCGCTATAGACTACGTATATCGCGTATGGATATATACAGCGCTATTATCGCGCGCCGCGTGGCGCGCGCCGTTATATATATATATTAATATAATATTATATCGCACGTCCGGCGCATATCGCATCCTTATATATACAATATCGCGACGCGGTGGCTAGTATAGCGCTTAATATAGGCCGAATAAGTATAGCGGATTTAGGCAGCATATTCCGCGATTATCGATGCGCAATATCGTACGTTATATCTCGCATATATAGCGCGGGCGCCTATAGGCGCATGCCGTTATTCTATATATGCGGCGATATATCGATTAAGCTTCGCATATAATACGCGCCCCATTATGTATACGCGACGCGCGCCGCGCATATCGCTTATGCGCGCTGTATATATTAATATGCGCCTACGTGCGGGACGGCGCGCGCCCGCGCAGCTATATACGATCTCCGCGCGCTCGTATAGTAGCGCGCGCGCATGGCGCCGGCCACGCGAATATACGTATATTATCGCGCGGCGGCTACGGTCTATAATATATATATATGGGGGGCTACGTAATATATACGCGCGCTGTCCGCGTATATATGCGATTATATATGATGATAGCGCGCGCGGAATATAGCCGTAATAAGCGCGATGCGGCCGATTAATCGATTATATGGATTATGCGTCGCCTACGATATCGGATATATGTATTATATATTATATATATGCGCGCTATATAATAATGCACGGCTATCGCATATATCATATATTTATATTATTTATCGGCTGCCTAATATCGCTCGATTTGGCGCCGCTATCGCATAATCGGCTCGTAATATTATATAGCATATATATATACTAATTATCAGCGCGCTAGCGCGCGCAGGCGCGGCGCTCGCGTATATCTATATATATATTATGCCATTATTCATATATAGCCGATTACAATTATATGTGCGCAATGCGCGCGAGCTGTATGCGCGCGCAAATACGCGCGTATATCGCTGCGAGCGGGCGATGATATATATATATACGCGCGCTAGCGCGCGCCATATAGGATAAAGCGCGCTATCGCGGCGCGGCCGCGTACGTATATAGTACCTATTACACGGCGCCGCCGTATAGCCCGACGCGCGCCGATGACGCATGCCAGGCAATATCGCGGATCGCGCCGCATAACGCGCGCGCGTAACATGTACCGGGTTATAGCGCGCATCAGCCTTATGCGCGAATACGCGCGCATATGGCTAGCGCATGCGCGCGTATAAATATTATAATATGCTATGATTGCATGCTATATCGCGCGCGTATATGCTTATTTTAATTAGTATATATTATCATATATATAGCGCCATCGGCGCCGATATGAACGCATGCGCGCGCGCATATATACAGCATAAGCGCGGTTGCGCGCGCCGGGCCGACGCGTATATATATATATATAATCGCTATCATATATATATAACGGGCGGCTACGAGCGATAATTACGGATACGATATGCACGCCGATAGCCACGCGCGCGCCGCGGCGCGTGAATATCGCAATATCTATATATGCGATATGCGCGTGCGCGCGTAGCCGATATGATATTAGGCGCGATATATTATCCGCCCCGCGCCGCGACGCGCTTGGTTAGCGCGATTAAATATCGGCGCATAATGCTATACCTACATATATTAATTGATCGCTATATCGCATATTATGCGCGCGATTATATATGGCATCGTTATAGCTATATATATATACGTATATGTAGCGCGATATAGCGCGGCGTATACATAATTATATATATACGCCGCGGTTTATCTAGTATAACGCCGCGCGCGCGCGCGATAGGATTTATATACGTAGAGATTATGATCGCGCGGCGATACCGCTAGGATATATATTATATATCTGATATAATCTCATGCGCATAGGCACGCTTTATTATATATATAAGCGGCTGCTGCGCATATATAGGGCGCATATATATATACGGCGCATAATCATTATAGCGCGGATTATAATATACTATAGCCGCGCGCGCGCGCGCCGTAGCGATCGCGCGTTTACTAGTATAGCGACGTTCGCGGCAGGCCCGCCCGTTACGCAATAAATATACTGCCGTGTATATATATACGCGCCCGAATCGCTATATAATACAGCCCGCATATAAATAGCGCGTATGCGCTAATGCGTACCGCCGGTACGCGCGACGCTATATATAATTAATATATATATATAGTATATATTTATATCGCCGCATATATTAGCGCGCGCGACGCGCGCTACGCGCGGCGGCACGTATTAGAGCGCGATATATAAGCGCGGCGCGTATATCTGGCGCGCGATAGGGGCGCGAAATAGGCGCGCGATACATAAATATTTCGCCGCGGCAATTATTAACGCCGCGCGGCATATATATGCCCCGTATACTATACGCGGCCGTAGCGATTATCGCCATATATATGCAATATATGATGCGCGCTAATTATAGCATAGCCTCATAACTTATTAAGAGCGCGATATAGCGATATGCGTGGCGCGCCGCGCCAGCGCGCAGCTAACGCTGGATCGCGATCGTCGATATATATATATCAGCCGCGCGCGCGCGACGGCGATTATAGCGCCGCGCGTATTATATACATTATCTTCACGCGTACATAGTATATATAGCGCCATTATTGTATATATCATACCGACGGAAATTAGTGCTATTATATATATATTTTATTATAGCGCGGATATAATGCTGCATATATAATATGCTAAATTACGATTAACCAGCCGGCGCCTAGGTTATTGGCTACGCGTACGCACGCTATGCATATTATGCGCAGCTATAATTCGATGACGCCTAGTATATATGATATATACCCGCATTAGGGCCGCGCCGCGATATGCTATGCGGCGCGTATGCTCATATCGATAGCGCGTCATCATTAGCGAGGCTTGGAAAATGCGGATATCGAACTAATATATATATTCGCGTAGGCGTAATATATCATTGGGCGCGCTGTATACGATAAAATTAACGCCGGGTAGCGAGCGAATATATGCGCATTACATGCGCGCGCGCATATATGCGTATAGATAATTAATAGATCCATCGGCGGATATGGTATATTATTGCATATTACGTAGGCGCTATATACCGCATATCGCGGGGCCTATATAATTATATTCGCGTATATACATATGCGCTTTAAAAAGCGCGCTATACGCGCGCTATATATTATTTG\n",
        "output": "47950\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 491,
        "task_id": 1429,
        "test_case_id": 11,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4917 ATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATATA\n",
        "output": "6044222\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 492,
        "task_id": 1429,
        "test_case_id": 12,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4915 ATAGCTATAGCTGCGCGTCGATTGCCGTGGCAGTGCGCCCGTACATCGCGGCTGACGCGGCTAGGCTGCGGCATAACTAAATATGGCTAGGCGCGCATGAGACGCGTATGTAGCATCGTGCTTATGCCTAAGCGATTGCGCCACATTGGGTATCGGTATTGCCGGCGGCGCGCGCCCGCTATATATTATCATTATTACTTACTTTAAAGCGTCGTATCAATCCGAAGGCTGGCATTAACATTCCGTATAGATCTACGATAGCGTCAGCAACGCGCGCATAGCGCCGTATATTCGGGGGGCGTGTATACTATTATTATCGTATAGCTGCGCTTAGCGGATGGCAAGCGTACCTACCGTCGGGGGCGCTAGCATATGCCGCTCGTATTAGCGCCTATCGCGCCGTGCATAATCTAGGCCGGGCTAGCCGTCCGGCTACGCCGACACGCCGGCGCGTCCGCCTGTATCTCAATCGTCGGAGAAATACTTAGGCTCGCACAGTCGGCGGCTACCGACGCGGATTAGCATAAAGTTATATTGCGATGTCGCGTGCGACGTAATAGATAGTAAAACGTAGCCCGGCCGTGCTTAGAGCCGATACGGTAATGGTATCTACACTCGCCTCATACGCCGATTACTTTTTCGACCCGCGCGAGTCCGACATACGAGACCGCTCTGCCGGTATTATACCCATTGATATTCCGCGCATATCGCGGCACGTATCGCCGTAACTTAATTACGCGTCGAGACCATTATAGCGCTTGCGCTAGCGCGGTAGCATAGCGACTGCGATATTACTATTGCGTATATAGCGTGCGCCAATAGCCGTACACTATGGCTTTAAGGATTATCTCAGCGACTTACGGTTTGTGAGATGCATAGACCATAGGCGTAAAGCTATAGCTCCGCAACAGGGCTTATTCATCGGCGTAGTGATAAATCGGTCATGGCGTGATATGCGTATGCGTGCTATCCACTACGTCGTGCCGATTGCGTATAGATTCTGAAATACGATTTAACGTATTCGCATCATATATATACTCCTATTTACTAAGCGAGGTATAATCATCGCGCGCATCGTGTCCAGGCAAGTCGCGAATTGAGCGCGCCATAGCCGCTGGTCCCGCAGCTGACAACCCAATTGCGCTATCGCAATATAACGCTATAGCATAATTGCCGTTATATATATACTATACATTTCGCGCGCCCAGTGCGCGGGCCGCATCATTACATATAGCCCGACCGGGGTTGACTACTATGAGGAAGCGCATGCGTCGCAACGGATGCTCGAACGTGCTGAGCCCGGAATACGTTGTATTCGAATTAGATAATCGCTGGCGCTAGCTTTAGCGCCTACCCCCGATTTCGGGATATGGCGAGGCGACATACGACACGCGCTTATAACGCCACAAGCTAACGCATGCATAGGCAATATTCGCGCGCAATAATTTGGAGGCTGCAATGTATATTAAAGATTATAATATATACTTACCGCGGCAATATATTATGCCCATTTCGTAACCTAGATGGACCCTATATTATAGTAGCCTATGCGTATGCTAGGCGCGCTATAATGACTAGTCTGGCGCGCGGGTGCTACCTATAAACCAGATCATATACGTGCGGCGCCTATATGCAATCCACTCATACGCGTGAATAACGCCACGGATAGTTGCCGCGCGCGACGTATAATGCATACGCAACGAAGCATCACGGCCGTAATAAGTATCAATTCGTATATATAATCACTACTCGTAGCTCATTCCGGACTCAGGAAGCGGCAACGAAATGCGCCTCGTGTCTAGCGATCATTTAATACCCTATCCATAATTATTATTTATCTGTTATGTATGCGAGATTGCGCAATTAGATAGCGTGGCGCGATATGTAATTTCCAATAACAGCCGATATGCAATTTATAGCGGGCGCGTGTTTACGCGCCTATATAGCTCAATCTGCGTCGCTGCAACTGATAGTACATAGCCGATTCAACATCGCTATAAAGTCCGTACTTCGCAGCGTGTAATTACGGATGTCTATATCTGCAGACGTATATTCGGCGCGCTATATCAACGCGCGGGATCTACCGTATATATGCCGTGCCCGCTAAAACTACCATATTCGATAGCCCATACTATCGCATTAGCCGACATGGTAGTTATATACGCGCGCCGCTTCAGCACGCGGCGGCGCTTCGCGCCGTCGCCTTCCAGATTTAGAATAAACGCACGCACTCGATTCGTAGAGCTCGTAATAATCATACAGCTGATATGGCCGCGTGCACATATGCAATAAATTAGTATTATTTATTACGATTATATCGATATGCCGTATCGCGGATGCGCGATCTATACCCTCGCAGTAAGGAAGTGTTGAAATAGATCTAGGCATTGGTCACTCTATCGCCCTTTCGCACGCCGGACCCCGCATCGACGGTAATACCCGCTATGCCTGATAGCGATGCCGGCAATATCGCGATAAGATCCGCTATTTACTGATAGCATATTAAGCGCTACCGACAGTCGAGCATAGATACTATAATATCTTATATATGCGAGTATATACTACATAGCCCGATTGCTAATTATACGCGGATGCGCGAATTAAGCGCGATTTTGCCGTACCGCGTCAGCTACGTATTAATGAGACGCGGTGCTAGATCGCATAGCGCATAACCTTTGTACATCCTACGGAGCTAAGGTCCTGCGTTACGCTCTATGCACGAGGACGTGCGCACCTAGCTATCCCGAATTATATTATGCCCATATTACATATGGCCCCGCTTGCATATGTTGCGCCGGGCCAGTAGCAGTGATCGGTCGCGCATGCAAGCGAATGTACGTAGCGACCGGTACATTACCGACGATGAGCATAATCTATCCAAGCCGCATGACATACATTATAGGCGTTTCGCGTATGCATAACTAAGCTAAACGATGCGCAGCTGTAGCACGTGCAGCGTATATGTTACTCTTAGGGGCCGTATCTATATCTTCGGTATGGAGATGATTAGTGCGCACGCAGTCGCTGTCTCGGTGGCTTCCAACGTTCCAGTAGGATTGACCTATAGCATGCGTAATTATATATTAGCGATATAATTACTCATATGCGGTGCTGAATGCGCGTACCTCCGGTTACCATGCGGAAAACTATGGCGATAATTCTGGCGTTGCGCGCCTTTATTGGAATATATGTATGTATCGGCGCCGCGGCCATTACCATTTAGCAGCATCATGCCGCGTCGTATATAGGCGCGCGCGGATACTATGACGCTGCGGACGTAGCGCGTCCGTTGACATATGCCGACCTGCCCGGTCGCGTGGGCAGCGCTTATCTGAGTGACGCTTCCGATCAATATATATAGACGATGATACGTGCCCCCAGAGTTAGCGTGCGCGACATGATCCGTATAACTGATGCTATGCTCGCCCCTCGATCAGATCAAGGTATGTGCGTTATAGCGGTGCCTTATATCGAAAGCATCGCGCGATCCCAGCCATCGTAGCCGCCAGGAATGTATAGCTAACATCATATAACTTATGGATGTCGGCGGCGTTACGCCATATCCGCCTAGTCAATTATTACGCTGGAGCGCCGAGTAATTATGCTATAGGTAGCGTCGGACCAAGAGTCATTCGCTACCTGCTGCTACGATAGGTCCCATGAGCCAAGTTTAGCTAGATAATTATTAACGACGTATGAAAAGGTTGCATGTCAGAGCGTCGTAGCGCGCCGCGCGTCTAGCGCATATATATCGGTATGATTATTCGAACCATATATCGCCTGCCTTCGGCATTAATGGGAGATAATTGCATCCGGCCACGGGCATCTATATTGTAAGTACGAATAGCCGCTACAATAAAATGTATTGTATTATGCTCCCGGGCTTCGTTCGGCTGTATAGCGCCTATCGCGGTATATCGCATCCCGATATGAATCGTATAATCGTCCCCCGCTATAGGAGTATAGGCTACCGCACGAGGTTATTGCGCTATCGGGGAATATGAGGAGTAGGCGTATATCGCTGTAACGAATGCGCGCGATACTGGAACCATTAATTATAGATTATCTTAACGATCTATGCTTATCGATAAGTACCGCAGCGAGGTCAATCGCGCTATACGGCGATACACATATGAGGCCGGTTGATATAGCAGGGGAATACCCGTCGTAATAATGAAATAGCCGCTTAGTAAGTAAATCGTATACGGACTAATATATAGCCGTGGATCGGTAGCCGCCAGATGCTATGCATCGTATCGGGTTAGCGTAATATGGCCTCCGGGGCATAGCAGCGGCTCCTGTAACGCTGATGATTATCCGATCCGCTGTCATGATATCCTGGATTATCCCAGCTCCAGATCGGCGACTATCATATGGGCGTAGCTCTCTACCAATAAAGCTAACTATAAACAGGGTCGCTCGCGCCGCTATGGCGCCATGCGCGATATATCTCCGATTTTTTAACGGCTTATAATGCGCATGGGCGCATGCCGATATACGTGCTAAACGGGCTATGGGCATCTCACGGCCTAGTTTAATGAGCGATATATTCACCCCGGCCGGTTTAGCGCATTTCATCGTTAAAAGCTATAGCCTCGGCGCGCAATGCGTCGTCCACGCCATTTAGCGATATATATGTCGACTATGATGTATTCTACGAATGTCATACGACACCCCCGCGATCGCAGCATATAATGTAATACACGCAGGCGTATCGTATAGAGCTCCTATATACGCTATACTGCGCGCGCGTATGGGCCGCTACTGCGACTCGAACAGCTAGGCGTAGGCGGTCTAGCGACGGTAGCACGCGGGGCGGCCTATGGTTATATAGACTACATCTAGTTCGCGGCCCTACCAGCTATAGGATGCTTACAACGCGCTATGGCTCCGATTAAGCGTTAGCTATTGCAAT\n",
        "output": "18144\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 493,
        "task_id": 1429,
        "test_case_id": 13,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4992 ACGTCGAACTCCATACGACAAGATAAGCGTAACCTTATGCCTGAGTCTATCGAAACGTATCGTCGGGCTTTTGAGCGCAAATACGTGATTACAGACGTTGGTAAACGATAGTCCGGCGATACCTGCGCGTCAACGAATCAGTACTGGTTACGATTAGGGATGCGTTGGACTCCATAGTATGCTGCCTGGATGCCTGCTCAGCACAGACTACTCATCGCATACGATTTCTGGCCCACTTAGCCTATGGGCCCAGGGATCCACGACTTTATTCCGGGTACAGTTCTGTAGTTTCTATCCGAAGGTCACAGGTTCGAAGGTGAGACGAATGCTTAAAACTACGAGAAAGCGTTAATATCATTATTAAATCGATACGAGGCCGCGCCTACGCAAAGGCGAGAGCTCCGGCGATCCCACTCTTTGATATACCTTACACGCGGATTTGTTGCGATCAAGGTATACATACGCGATCATCAAGGTTAGTGCTTACCTTATGGCTCAATGCCTTCATTAGTCGATAACGTTAGCTAGCTTAAAATTAGCTTCTCTTCGTACGATCCGTCGATATGACCGGGTACCGTAGATGTACTAGCAAATAGGTAAACACGGATCGGGAAGCCGCGTTATTCTCCGAGGGACGGACCATTATGCGAGACGCTCTAAAGCGGCTGAACCACTACGACACGATCAGGCTGAGACGGCGAATAACGGGTATAGGTTTACACTATTACCCACATATTAACCCAGCCGCAACTTGTAGGTGCGTTTCGAGAACTCAACGGGTATCACCCGAACGCATATAGCGATCGCTTATTTCGTGGCTCGCTATACAGTTTAATTTAATTTTATAACAAACTGACTATCGGGAAATCCAAGCATACCCCGCTTGAAGGCGCAATACGGCATCGCGACGCATTCATAGACAGCGGTATATGTGGTATAAGTATGGCCGTCCGCATTGCCGTCGGGTATAGGGCCTGATGCGAATGTTCACGTTGCGCGCTTCGCGCCACTAAGTGTGAGTTACTTATGCAGGTTAGATTATTCCTCGGTATACCGCGTTATACCATATAAATTAATGTCTTACACACCGGGTCGAGGGCAGATTTTCGTTTCAAAGTAAACCGTTTTATAAGGTATGCGCTCCGCACATAAGTATGTGGAATGCCCAATCCCCATACTACTCGCTCGCGGGATTGTTTGTTAGGATCCGCGCCAACGGGCGCCTAGCGCCGTGCTTCGCCATGGGAAGGTTGAGTCGTGGTAGCGCGCGGTATGCGAACTTCGCGGAGCTCGGTCTCGCGCAGGTGGTCAAGATTCTGATAGCGAATTAAGTCATTGGGAACGTACTCCCGATGAGCATAGCAGCCGGATGATATGCGTTACCAACGTCAAGCAACTCCACTCTTACGCGGCGCGCCTTAGCAGTAGGGTAATAGCTACAGGCGATGCATCCAAGCGCTCGGAATACGTGAGCCATTGCTCTCATGACCTAACTCGATTAGCCATACGAGATACGGCTGCCTTCGGCCTAGCATCGCCAGTCGCATAATTTGTAGGACATTTAAAATATTTATGTCTTCGATACCTTAGAAAGATTGGATACGGCAACGCATTCCGGATATGGGAAACCGATTGCAAATGATCAGGGTCGGGGTTAGAATTAAATCCATAAGATAGTGACGCACACTACACGATGCCGTGCGCGGGCCAGTTAGGAGGATACCATCATATAATTTGAATGGTCTGGTTCGAACCCCGCTAGTGAGTGCGAATGTTGCATAGTCAACAACACGTACTATTACGGCGTACCGCCGTGGCGGTGCCGAAGGTCCGACGCGCTCTTATAGGCTAATGAAGTCTAGGGCCAGAACCCGGGGCTGTAGAACAACTGCGCCGAAAACGCTATTCGATAAGCGCCTCCGCGTTTTTGTTGAGACGCCGAGCAGGAAACATTCTAGTGATGAGATCATGGGGTCTGTGAAGCACAGCGGAGGCGTCAGTTCGATTTCTCGTTTACGTTATTGCCATAAGCGTAGGGTTTGGCCTAGAAGCAAGGCTTTCGAGTATTCCCAATGGTAGTTGTACTTCGACCAATAGTGACTTAACCCAGTGCGATACGGCGCGTAATGTATATACGATTTCAATATAGCGTAATCCAAGATTCTCTGCGCCTTACTACCCGCGGTGGACACGGCGAGTACAAGTTTTTAGGAACTTTGTACTAAGTTTAGTGTACTAACAAATTTGACCCTGGCTGGGTAACGGCTTCAGTTAAAGGACCAGCACGCCAAGACCAAGTCGGTCAAATAGACATCATGTACATACTGCCCCGCCATGGCGATTACGAAGTCATGCTCTTTATTACCATAAGGAAACAGCTATCGCTTATTACGCTAATAACGCGATCCTCGTCTTATCATTAATTCTAGCGAATTGCTCCCGTCGCTTGAAAGTCTTAGTGGTTCTTAATGCGCGTACCGTTAGAGTAGCTGCGCAATCATTAACGGTCCCGTAGCATCACACTGCCTGGCCTTTCTAGCGCATCGCATGGATGAGCGCTTATAAGCTACGGTCCCACCGTTCGTTGCGTGGGTGCTCCGTGTATGTAGTCGGAGCGAAGGCCAACGACCTGTCACCACGATTTACTAAATAAGGCGATTTGATATATATCCCTGTGGCCGTGATCCCTGATTCATGAACGCCGAGGCTCTCAGTATCGCCTCACACATACGCATCTTCCTGCAATAATCCCGTAACGCCGGTTTTATGCTATAGTGCTGGATATACCACGTCTCCCGAAATAATGCATGAAAGGCGTAACAACTAAGACGCGCGTTTACTCGCGGATTCTTTTCGGCCCGGAGGGAACCCGGATTGGGTATATATAGAGGGTCCGCCAGGGGCGTCGTTCATTCCAGCTATAGAACGGCCCGCATAGCAGTACGCCGGAGCAGCTACAGTAGCCGGACGCAGGTCGCACGGCTATTATGACCTCCGGTTTCTTGTGGCATAACTAACACCGTATATATTAACGTGTAGATGGTGTAAATCGTATTAGGGCATTATTCGACAGTGGGATGATGTCTGACCTGGGGCGATCACTTCGTCGTCGTCTACTCTCGTGCATCCGAATCTATCTAACCATATAACGATGACCATGAAACACATCGTATATATTCGTAGGCTTCTAAAGCGAACGGGTATCGGAGCAAATATGTAAGCAGCCAACTCATGTCCACTGGTCGAGATTAGCGTCGTAGTTAATCTATTATTAATCGCGGGCATGAAGGCGGCTTATCATGTGCCAAACATTGGAACGTTGCAAATAGGCCCGTATATTAGTCAATTTCGATGGCTACCCAAGATAGGTCGCTTTCTGCTGCTCTATCCGGAGTCCGGCGGTCCGAACGCATACTTATCTTTGGTCGCTTAAGGCTTCATCATTTTACAGCCGAATTACGCGACGGGCCTTTACCGTTAGATGCCTCATACGCGTCGCACCAGCAATTTTCCACAGGCGCGGTGAGAAGGCCCGTCCTATAGCGCCCGCTGCACAGATTCCCATAGCGTAGATCGGCGTTATAGATTAGGCACGAGATACGAATGCGGTGAATGTGTATTGGGCACTACAGTGTACTTTGCAGCGAACTTAGATTTGCTATAACGCTAATGATCCTAAACGCACGCGTGGCTCCTCAACGCGTCGGCAGCCACGCCACGATATGTATATCCCGGAGAATCAAGAAGCGTCTCTCCTGCGCCTGCACCCGTTAGGAAGTAGCAGCTGCTACCCGGGGGTACTAGCCGACAGTTAAAGTACAGCGCCGAGTTTATGGATCAGGCGCAATATTTCGGCTAGCGATATCGAATCCTAAAGTCTATAGTCTCTCGTAGCTACAGCAGAGCCCGATGCGAGCGTGGCCGCGATGCGTAAAACCTGATCGGGCGGTGCTCCTCCTTATAGCTGCGCGGATATGCCCCCGAAGATTTTATGTCCGTTCACTCCTGACCGCGGCGGAAGACGTATTTTATATTAGTCCCATCCGCGTGTCCCCATCGATGTCGATCGGAAAGATAGTAGGCGTAATCGCGTCAACCTGTTGACAGTGCAGCGGCTAACGGAAGCCGATAGCTAAGGTATACGCAGACGGCCTTTACGCTTACAGTCTAGGACCCTCAATTACGGGTCCTGGCTTTTTTTTTGAAACTAGAATAGATGAGTTGCCCAAGGCCGGGGATAGATAATGGAATAGTATATTTGCGCCTAAGGTGCAGCTAAATCGGGTAGCAGAACAGCAGGATCGGTATGTCGCGACTACGGGTACCCCATTGCATTAACCAGAGTGCGCGGAACTTCCGATAGATCAGACCTATGCGGCGAAGAGTCTGACAGTATTGATGCGATGCCTGATATCTCGATAATTATGCGCCTAGCATATAAAGCAAGATCGTTACGGCGCATACAGAAGAGCAAGTTTACGTATATTTATATTAACCCGTAGCTATGCTCATATAATAGTCGGGCCGAAGATAAGTATAGACTAGCCACGATCCCTGTGCTTGATGGTCAACGAACGGCTCCGGCGTACCATGACCCATCCAGGTAATCTGCAGTCGGGATCGACCTGCTGGTCAACGGAGACATGGCTCATCGGTTATCCCACCCGACGTAGTACTTATACCATCGCGCACCAAATACAGCAGCAAAGTACCTATGTACATTATCACATGCAGGTATCGTGCACCCCAATGCGGGACGGCACGTCATAAACTTAGTATAGCAGTTTCTTTCCGATTTAGTGTGTATGACAGCAACGACAGAATACCACCCGCGTGTTCTCGGGATTAGGTTCGTAGGATTAGGCTTTATGCAAGTGGGATACCGGCCTTGCAGCGTACCAACACAGTAATAGCGTATATGCGTGTTTCCGTGCACTAGAAGCCCCGGACACGACGCCATCTATTTAGCATAGGAGCGAAGCCGTCGATTAG\n",
        "output": "17699\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 494,
        "task_id": 1429,
        "test_case_id": 14,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "1 A\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 495,
        "task_id": 1429,
        "test_case_id": 15,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4917 GCCGGCCGGCCCGCGGCGCGGCCGCGCGGCGCGGGGCCCCGCGGGCGGCGGCCGGGCCGGGCCGCCGCGCCCGCCGCGGCGCGGGGGCCGGCCCCGGCCGGGGGGCGGCGCCGCGCCCGCCGGCGCGGGCCGCCGGGCGGGGGCCGGGCGCCGCCGCCCGGGGGGCCCGGCCCGCGGCGGCCGGGGGCGCGCGGGGGGGGCCGGGGGGGGCGCCGCCCGCGGCCCGCGGCGGGCCCCGCGCCGGGGGGCCGGCGGCCGCGCCCCGCGCGCCGCGCCGCGGCGGCGCCGGGGCGGCGCCGGCCGCCGCGGCGCGCCGGCCCGCGGGCGCCGCCCGGGCCCCCGGCCGCGGCGGGGCCCGCGGGGGCGGGGCCCGGGCCGGGGGGGGCCCGCGCGCCCGCGCCGCCCGCCGGGCCCGGGGCCCGCCCCGGCGCGGCGCGGGCCCGCCCGCGCCCCGCCGCGCCCGGGCCGGGCCCCCGCCCCGGGCGCCCCGCCGCCGGCGGCGGGGCCGGGCGGGCCGGCGCGCGCCGCGCGGCCGGCCCCGCGGCGCGCCCGCGGGCCCCGGCGGCGGGGGGCGGGCGGCGCCGGGCCGGGGGGCCGCCCGGCGCCCCCCGCGGCGCGGGCCGCGGCCGCCCCCCCCGCCGGCCCGCCCCGCCCCCGGGGCCGCCCGCCGGGCCCCGCCCGGGCGCCCGCGGGGGGCCGGCCGGCCCGGGCCGGGGCGGGCCCCCCGCCCCCGGGCGGGCGCCGGGGCCGGCGGGCGCGGCGCGCCCGCCGGGGCCGGCCCCGCCGGGCCGCGGCCGCGCGCCGGCGCGCGCCCCGGGGGGCGCCCCCCCGGCGCCCGCGGGCCGGGGCGCCGGCCGGCGGCGGCCCGGGCCCCCGGGGGCCCGGCCGCGGGCGGGGCGCCGGCCCCGGCCCGGGCGCCGCGGGGCGGCGGGCGCGGCCCGCCGCGCGGGCCGGGGCGGCGGCGCGGGCCCGGGCCCGGCCCCGGCCGCCCGGGGCCGCCGCGCGGGCCCGCCGGCGGCGGCGGCGCGCGGCGCGCGGCGCCCCCCCGCGGGCGGCGGGGCGCCGGCCCCCCCGGGGGCCCCCCCCCGCCGGGCCGCCGGGCGGGCGCGGGGGGGCGGGCGGGGCCGCCGCCGCCCCCGCGGGGCGGGCCCCGGCGCCGCGCGGGGCCCGGCCGGGGGCGCGGCGCCCGCCCGCGCGGGGGCCGGGGCCGCCGCCCGCCGCCCCGGCGCGCGGGGCGCCCGGGCCGGGCGGGCCCCGCCGGGGCGGGCCCGGCGCCGCCCCCGCGGGGCCCGGGGGGGGCGCGCCGGCCCCGGGCGGCGCCGGCCCGCGGGGGCCCCCGCCCCCGGGCCCGGGGGGCGGCCGGCGCCCCGCCCCGGCCGGCGCGGGGCCCCGGCCGGGGCGCGGCGCGGGGGCCCGGGGGGCCGCGGCCGCCCCCCGCGGGGCCCGCCCCGGCCCGGGGCGGGGCGCCCGCCGCCCGCGCCGGCGGGGCGCCGGCCGCGGGGCGCCCGGGCGCCCCCGCCCGCGCCCGGCCCGCCCCCCGGCCCGCGCGGGCCCCGCCCGGGGCGCCCCGGCGGCGCGCCCCCGCGGGCCGCCCCGCGCCCGCGGGGCCGCGCGCCCGCGCGGGGCGCGGCGGGGCCGGGCGGGGCCGGGCGGGGGGCCGGCGGCGCCCCGCGGCCGCCCGCCCCGCGGCGCCGGGCCCGCCGCGCCCCCCGGGCCCCGGGGGGCGGCCGCCGGGCCGCGGGCCGCCGCCCGGGGCCCGCCGCCGGGGGGGCCCCGGGCCGGCCGGCCCCGGGCGGCCGGGGGGGGCCCGCGCGGCGCGCGGCGCCCCCGGGCCGCCCGCGGGGCGGCGCCCCGGGGGGCGGCCGGGCCGCCCGCGGCGGCCCGGCCCCGCCGGCCGGGCGGCGGGGGCCCCCGCCCCCCCGCGCCCGCCCCCCGGCGCGCGGGCGCGGCCCGCCGGGCCGGGCGGCCGCCGCCGGGCGCCCGCGGGCGGCGCGGCCCGCCCCCGCGGCGGGCCGGCCCCCGGGCGCGCGGGCGCCCGGCGGGCGGGGCCCCGCGGCCGCCGCCGGCGGCCCGGCGGCGCGCCCCCCGCGCGGGCCCGCGCGGCGCCGCGGGCCCGCCGCCCCGGGCCGCCGGCCGCCGCCCCCCCGCGCCGCGGCCGGGGGCGGGCCGGGGGCCGCGGGCGCCCGGCGCCGCCGCCCGCGGCGGGCCGGGCGGGCCGGCGGGGGGCCGCCGCCGCGCCCCCCCCCCCCGCCGCCGGCGCCCCGGCCCCCCGGGCCCGGCCGGCCGCGGGCGCCCCCGCCCGGGCCCGGGCCCCCGCGCGCGGGGCCCCGGCCCGGGGGGGCGGCGGCCCCGCCCGCGCCCGCCCCGGCCCCGGGCCGCGCGCGCGGGGCGGGGGGGGCGGCGGCGGCCCCGCGCCGGGCCGGCGGCCGCGGGGCGCCGGCGGGGCCCGGGCCGGGCCCGCCGCCCCCCGGGCGCCGGCGCCCGCGCCCGCGGCCCGCCGCGCCGCCGCCGGCGGCCCCCCGCGCGGCGGGGGCCGCCGGGCCGCCGCGGGGGGGCCCGCGCGGGGGCGCGCCGCCCCCGCCCCCGGCCGCCCCGGCGGCGGCCGGCGCGCGGGCGGGCCGGCCGGCGGCCGCGCCCGGGCCGGCCGCCCCCGCCCCCGGCCGCCCGCCCCGCCCCCCGCGGGGGCGCGGGCGGGGGGGCCGCGCCGCCGGGGCCGCCGCCGCCCCCCCCCCCGCGCCCCCCGCGGGCGCGCCCCCCGGCCCGGGGCGCGCGGGCCGCGGCGCCCGGCCGCCCGGGCGGCGCCGCGGGGGGCGCCCGGGCCGCCCGGGGGGGCGCGCGCGGGGGCCCGGGGGGCCGGGCCCGGCGGCGCCGCGCGGGCGCGGCGGCCCGGCGCGCCCCGCGCCCCGCCCCGCCCCCCCCCGGGGGCCGCCGCCCGGCCCGGGCCGCGGGCGGCGGCGCCGCCGGCGGGGCGGGCGCGGCGCGCGCGCGCGGGGGCCGGCGGGGCCGCCCCCCCGCGCCGGCGGCCGGCGGCCGGCGGGGCGGGCGGGCGCGCGGCGGGCGGCGGGGGCGGGCGCGCCGCCCCCCCGCCGGGGGGGGCGGCCCGGCCCCCCGGCGCGCCGCGGGCGGCCCCGGGCGCCGCGCCCCGGCCCGGGGCCGCGGCGCCGGCGCGGGGCGCCGCGGGGGGGCCCCCGGCCGCCCGCGGGCGGCGGCGGGGGGCCCGGGGGCGGGCCCGCCGCCGCCCCCGCCGGCGCGCCGCGGCGCGCCGCCCGCGCGCCGCCCGCGCGCGCGGGGGCCGGCGGGCGGGGGCGGGCGCGCCGGGCCCGGCGCCGCGGCCCCCGCCGCCGCCGGGGGCGCCCCCCGGGCGGCCCCGCGCGCCCGCCGCCCGGCGGGCCGCCCCGCCGCGCCCGGGCCCCCCGCGGGCCGGGCGGCCGCCGCCCGGGGCGCGCGGCGCCCGCGCCGGCGCGGGGGCGGGGCGGCCCCGGGGGCCGCCCCCCGCCCCCCCCGCGGGCCGGGCCGGGGGGGGCGCGCGGGCGGCGCCGCCCGGGCGCGCGCCCCCCCGCCCGCCCCCGGGCCCGGGCCCGGGCCGGCGCGGCCCGCCCCCGCGCCGGGCGGGCCCGCGGCGCCGGCCCCCGCCCGCCGGGGGCGGCGCCCCCCGCCGCGGCCGGGGGGGCCGCGCCCGCGCCGGCCGGCCCGCGGCGCCCGCGCGCCCCGGGCGGGGGGGGCCGGGGCCCCGGCGGGGCCCGCCGCCGGCGGGGGCCCGCCCCCCGGGCGCCGCGCGGCCCCGGGGGGGGCCCCCGCCCGGGCGCCGCCCGCCGGGCCGGCCCGGGGCCCGGGGCCCCCCGCCCCCGGCGCGCCCGCGGGGGGCCCCCCCCCGCCCCGGGCCCGGCGGGCGCGCGCGGCCGGGCCCGGCGCGCGCCCGGCGCGGCCGGCGGGGCCGCGCGGCGCGCCCCCGCCCCGCCGGCGGCCCCGGGGGGCCGCCGGCGGCGGCCGGCGGCGGGGGCCGGCCCCCGGCGGCCCCGGCCGGCCCCGCCGCGGGGCCCCGCCGCCGGGGCGGGCGGGGCGGCCGCCCCGGGCGCGCGCGGGGGCCGCGGGGGCGCGCCCCGCCCGCCGGCCGCGCGGCCCGCGGCGGGCGCCGGGGCCGCCGGCGGGCGCCGCGCCGGGCGGCGCCCGCCCCGCCCCCGCCGGCCGCGCGGGGCCGGGGGCGGGCCCGGGGCCCGCCCGCCCGGGGCCCCGCCCCGGCGCGCCGGGCCCGCGGCCGGGCCCGGCCGGGCGCCGCGGGGCCGCCCGCGCGGGGCGCCGGCGCGGCCGCGGCGCGCCGGCCGGGGGGCCCCCCGGGCCGGGGGCCGGCCCCCCGCGGGGGCGGGGCCGCCGGGGCCCGCCGCGGCCCCCGCGGGGCCGCCGCGGCCCGGCGGCCCGGCCGGGGGCGCCGGCGCGGCGGCGGGGCGGGGGCGCGGCGCGGGGCGCCGGCCGGCGGGGCGGGGGCGCGGCGCGCGCGCCCCGCGCCGCCCCCCGCGCGGCGCCGCCGGCCGCGCCGGGGGCCCGGGCGGCGGCCCCCGCCCGCGGGGCGCCCCCGGGGCCGCGCCGGGGGCCCGCCCGGGGCCCCGCGGGGGCCCCCCGGCGGGCGGCCGGCCCGGGGCCCCCGGCCGCGCCGCCGGCCGCGGCCGCCGGGGGCCGCGGGCGGGGCGCGGCGGCGGGGGCCCCGCCGGCGCCCGCCCGGCCGGGGCCGCGGGCGCGCGCCGCCGGGGCGCGGCGGCGCCCGCGGGCCCGCGCCCGCGCCCCCGGGCCCGCGGGGGCGGCGGGGGCGCCCGCCCCCGGCGCCGCCGCCGGCCGCCGGGCCCCGGGCCCGGCCGCGGCCCCCGCGCGCGGCGCGCGGCCGGCCGCCGCCGGCCGGCCCCGGCCGGCGGCGCGGGCCGCGGC\n",
        "output": "174283\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 496,
        "task_id": 1429,
        "test_case_id": 16,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4941 ATTAATTATATTAATTATAAAAAAAATATATATTTTATATATTTTTATTTAATTATTAAATTATAATATTAATAATTTAATTATATATATATAATAAAAAAAAATATAATTATTAAAAAAATATTTAAAATATATATAATTATATTTAAATAATTAATTTAAATTAATAATTTAATTAAAAATATTTAATATAATTAAAATTTATATAATATATTAATATAATTTATTTTTTATAAATATATAATAAATTTATTTTAAAAATTTTATTAAATAAATTTAATTTTTATAATTTATTATTTAATAATTATTAAATATATTTAAATATTATTTTTATATTAATTATATTTTATATATATTATATTTAATTTATAAATTAAAATTAAAATTTTAAATTATTTATAAATTATTAATATATAAATAAATATTATTTTAAATAAATTTATTATAAATAATATTTATATTTATATAAAATTTTATAAAATATAATTTATTATTTAATTAAATTTTATATAAATAATTATTTTTAAAAAAATAATTATAAAATATAATAATATAATATTAAATTAAAATTTAAATTAAATATTTTTTATATTATTAATAATAAATTATTATTTTATTAAATTTTTTATTATTAATTTTTAATAAATAATAAATTAATAAAAAAAATAAATTTTAAAAAAAAATTATTATATAATTTTTATTTTTTATTTAATAAAATTATTTTTATATTTTAATAAAATAATTTTTAAATTAAAATTTTTTTTTTTTTTTTAATTATAAAATTATTTATATAAATTTTTTTTTAATTTTATTAATAATAATAAATTTTAATATTAATATTTATAAAAAATTTAAATTAAAATTATTAAATATTATATAATTATTTTTTAATTTTATATTATAAAATTATAAATATATTTAAAAATAAAAAAAATTTTATTATTATAAAATTATTAATAATTTATATAAAAAAATAATTATAAATAATTAAAATATTTATTATTAATTAAATTATTATAATTATAATATTAATATATTTTTTTTATTTTAAATAAAATTATAATTTAAATTTAATTTATAATTAAAATTATTAATAAAAATTTTTATTTAATAATTATTTATTATATTAAAAAATTTAAATTTTAAATTAATTTTTATAATTAAAATATATATAATTATTTATTTTATAATTTATTATTATATTTTTATAAATTTTATTAAAAATATAAAAATTAAAATTTTATATATATAATAATATTTAATTAAAATAATAATTTTATATTAATATTAAATTTATATTTTATAATTATAAAATAATAATAAAAATTATTAAATTTATTTTTTTTATTATAATAATTTTTTAATAAAATATTTTATTTATATTTTTATTTAAATAAAAATTAAAAATTAATTTTAAAATTAATTTTAAATTAAAATATATAAAATTAATATAAATTTTTATATATTATTTTTATAAAATTTAATTAATATATATATAAATATTTTAAAAAATATAAATAATATTTTTATTATTAATAATTTTTTATATATATAAATATTTAAATATATTAAAAATTAATATATTAAAATTATTTAAATAATTATATATTTAAATTATATTATTTAATTAAATAAAATTTTATTTTATTATTAAATATAATTTTTATTAATTATTATAATAAATTAAATTATAATATTATATTAAAATTATATAAAAATATATTTATATTAATTTATATTAAATTTAAATTAATAAATATTAAATAAATTTAATTAATAAAATAATTTTTTATAAATTTAATAATAAATTATAATAATAAATATTTAATTTATATAATAAATTAATAATAATTTATAATATATAAATAATAATTTTTTTAATTATAATTAAATTAAAAAAAAAATTATAAATTTAATTTTATTATTAAAATTAAATATTTTATTATATTATATAAAAAATAATTTAATATTTAAATATATAATAATTTATTATTATAATAATATATTTAAAAATATATAAATTAATAATTATATATTTATAATAATTTATTTAATTTAAATTAATTAAAATAATATATAATTAATATTAAATAAAATTTAAAAATTATAAATAAATTTATTTATTTTTAAATTAAATTTTTAATAATATATTATTTAAAAAATTTTATTTATTAAAATTAAATAATAATAAAATTTAATAATTTATATTATAAAAAAAATAAAATAATAAAATAATAAATTTTAATTTTTTATTTTAATTATATTTTATATTATATATTAAATTAATATTATAATATATTATAAAAATTTAAAATTAATAAATTTAAAAATTTTAATTATTTTTTTAATAAATTAATAATTAATATATAATAATTTATATAATATATTATTTTTATAAATTAAAATTTTTTAAAAAATATAATTTAAAATTATTATAAAATTTTTAAAAAAAATTTAAATTATTATATTTTAAAAAAATTTTTTAATAATTATTTTTTAAATTATAAAATTTTTTAAATATTTAAATTAAATTATTTAATAATTTAAATAATAAAATTTTAAAATATTATATTATTTTATTTATTTATTTATAATTTTTAATAATATTTTAAATTTATATAAATATATAATTAATTTTTAAATTTATTAAATAAATAAAATTTAAATTTAATTTTAATTATTATAAATTATTATATATATTATTAATATAAATTTATAATATTAATATAAAAATTAAAAAAAAAATATATTTAATTTATAATTTTTTATATAATTATAAAATTAATTTTTAATAAAATTATTTAAATTTTATTAAAAAATTATATATATAATTTTTATAATATAAATTTATAAAATTTTAAATAATATTTAAATATATTTAAAAAAAATTTATATTATAATTTATTATTATAAATATAATATAAAAAATATAATATTTAAAAATATAAATTTAATAAAAAATTTAAAAATAATTATATTATATAAATATATAAAAAATTTAATATATATTATATTAATTTTAAATAAAAAATTATTTAATTTTAAAAAAATTAAAAAATTAATTATAATAATAATTTTATATTAAAAAAAAAAATTAATAATAAATTAAATTTTTAATTATAAATATATTTTTAAAAAATTTTATAATTATTTATATTAATTATATTTATATAATTTATTAAAATATTAAATTATTTTTTTAATAAAAAAATATAAAATTTTTTTATAAATAAATTTTTATTTTATTTAATATAATATTAATATAATTAATAATTATATTAATTAATAATTTATTATATATAAATTTAAATAATTTTATTATTTTTATAATAAAATTTAATAAAATATTAAATATTAAATATATTAATAATATTTAAAAATAAATTTTTAATATAATTTATTTTATTTTATAATTTTAATAATTTTAATTTATTTATAATAATATTAATAATTTATATTTAATTAAAAATAAATATAAAAATTATAATATTTTTAAATTTATATAAAAAATTTAATTAATATATATAAATATATATAATTTAAATTATTTATAAATATTAATAATTAATAAAAATAATATATATAAATAATTAAATATTTTTTTTTAATTTAATTTTTATTTAAAATTTTAAAAATTAAATAATATTATTTTTATAAAAAATATTTTTTATATAATTAATTTAAAAAATAATATAAATAATAATAATAAATATAATATATATTTTAATTAAATTTTAATATAAATATAATAATTTTAAATTATAATTAATAAAATATTAAATAATATAATTAAATTTTAAAATTATTAAAAATTATTTTAATAAAATTATTTAATAAATTTTATATTATTAAAAATTAAAATTTTTTAATTTTATAATTTAATTATAAAAATTATAATTTTAAAAATAATATTTTAAATATAAAATATAATTTATTTTTAAAAAATAATTTAAAATTTATAAATATATATAAATTATAAAAAATTATTTTTAAATAAAAAATTTTTATATATAATATTATTTTAATTAATTAAATATAATAATTTAATAAAAATTTAATAATTATTAATTTTTTTATAATTAAAATTATAATTTATTTATTTTAATTATTAAAATTAATTTTATTTTTATTTAATTATTTTAAATTATAATAATAAATTATAATTTATATAAAAATAATATATAAATTTAATATTTATAAAAAATATATTAAATTAAAATATATAATTTAAATTTAATATAAATAATATTTATAATATTTTATAAAATATAAATAATAAATTTATAAATATAATTATTATTAAAAATAATAATTAAAAAATATTAATATATAATATATATATATTAATATAAATAATAATATATTTTTTTAATAAATATTTATTAATATTTTATTATAAATTAAATTTATTTAAAAAAAATTAATTTAAAAATATTTTAAAATAATTTTATTTTATTATAATATTATTAAATAAAAAATTATAAAAATAATTTAATATATTTTTAAAAAATAATAAATAATTATATTAATTTAATTTAATATAAATTATATTTTAATTAATTTAATTTATTTATTTTAATAATTTTAATATTAAAAATAAATTTTATTATTATAATATAAATAAAAAATTTATTATATTAAATTTAAAAAAATTTAAATATTAATAAAAAAATTATTATATATATTTAATTATAATTATTATAAAATTTTATATAATAAATTATAATTTATAATTAAATATAATATAAATATTATTATTTATATATTAATAATATTATTTTTTAAATTAATTATATATTTTATTAATATAAAAATTATAATTTAAATTAATATAAATATTAATAAAAATATTATATAATTTTTTAATATTTTTAAATTAAATTTAATTAATATTTATATTTTATATTTTAAAAAAAATTTAATTATAAAATTTTTTTTAAT\n",
        "output": "135697\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 497,
        "task_id": 1429,
        "test_case_id": 17,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4974 CCCCGCGGGCCCCCCGCCGGCCCGGGCCCCCCCGGGGGGCCCGGCGCCGCGGGGGCGGGCGCCCGGGCCGCGCCCGCCCGGGCCCCGCCGCGCGCGGGGGCGCCGGCGCGGCGGCGCCGCCCGGCCGCGCGGGCGCGCGCCGGGGCGCGCCCCGCCGCGGCCGGCCCCGGGCGGGCCGGCGCCCGCGGCCGGCCCGGGGGGCCGCGGCCCGGGGGCGGGCCGGCGCGGGGCGCGGGCGCCCCGCCCGCGCGCCGGGCGCGCCCCCGCGGCCCCCGCCGGCGGGCGGCCGGGCCCCCCCCCCGCCCCGCCCGGCGGGGCCGGCCCCGCCGGCGGGGCGCGGCCCCGGCCCGCCCCGCCCGCCGGGCCCGGCGCGCGCCCCGGCGCGCGGGCCCCCGGGGCCGGGCGCCGCCGGGGCCGGCCCCGGCCCCCGCGCCCCCGGGGCGGCCCCCGCGCGGCCGGGCCCGGGCGGCCCGGCCCCGGGCGGCCGCGCGCCCGCGCGCCGGCCCGCCCCGCCGCCGCGCGGGCGCGGGGCGCCGGGCCGCGGGGCCGGCGCCCCGCGCCCGCGCGCCGGCGCCGGGCGCCGCCCGCCCCCGCGGGGGGGGCGGGGGCCCCCCGGCGCGCGCGCGCGGGCCCCCCCCCGGGCCCCCCCCCCGCGCCGCGGCGCCCCGCGGCGGCGGGCGCGCGCCGCGGGGCCGGCCGCGGCGCCGGCCGCCGGGCCCCCGGGGCCCCGCCCGGCCCGGCGGGCCGCGCGGCGGGCCCGCGGCCGGCCGGCCCGCCGCGGGCGCGGCGCCCCCCGCCCGCCCCCCCCGGCCCGGGGGGCGGGCCGGGGCGCCGCCCGCCCCGGGGGGCCCCCGGCCGGGCCGGGGCCGGGGCCCCGCCCCGGCGGGGCGGCCCCCGCGGCCCCCGCCGGGGGGCCCCGCGGGCCGCCGCGGCCCGCGGGGCGCCGCGCCCGCCCCCCGCGCGCCGGGCGCCGGGCGGGCCGGGGCGGGGGGCGGGGCCGCCCCCGCCCGGGCGGGCGCGGGGGGCGCCGCGCCGCCCGCCGCCCGGCCCGGCGCCGGCGCCGCGCGGCCCCGCGGGCCGCGGGGGCCGCCCCCGCGGGGGCGGCGCGGGCGCCCGCCCCCGGCGGGGGGCGCCGGCGGCGGCCCGGCCGGCGCGCGCCGCCGGGGCCGGCCGGGCGCGGGCCGGCGGCCCCCCCCGCCGGGGGCCGGGGGCGGCCGCGCGCCGGCGGGGGCCCGCCCCCCGCGCCGGCCGCGGCCGCCCCGCGCCCGGGGGCGCGCCGGGCCCCGCGGCGGGGCGGGCCGGGCCGGGCCGGCGGCCCGGGCGGCCCCCCGCCGGCCGCCGGCCGCGCGGGGGCCGCGCCCCCGCCCGCCCCGGCGCGGCCCCCCGCCCCGGCGCCGCCCCCGGCGCGGCCGCGGCGGGCCCCGGCCGCCCCGGGGGGGGCCCCCGGCGGGGGGCGCCGGCGCGGCGCCCGCGCCGCCCGGCGCCGCGCCCGGCCCGGCGGGCGGGGCCGCCCCCCCCGGGGGGGGGGCGCGCCCCCCCGCGCCGCCGGCCGGGCCGGGGCCCCGGGGCCCCCGCCCGGCGCGCGCGCGCCGCGGGGCCGCCCGCCCCGCGGGCGCCGGCCGCCGGCCCCCGCCGCCCCCCGCCGGGGGGCCGCGGGCCGGGCCCGCCCGCCCGCCCCCCCCCGCGGCCGGGGCCGGGGCCCCCGGGCCGCGCGCCCGCCCGCGGCGGGGCCGGCCGGCGGGCGCGGCCGGGCCGCGGCGCGGGGGGCGCCCGCCGGCCGGGCCGGCGGCGCGCCCGCCGCCGCGGGCCCCCCCCCGCCGCGGGGCCGCCCCGCGCCGCCCCCGGGGGCGCGGCCCGCGGGCGCGGGGGCGCCGCGCCGCCGGGCGGGGGCGCCGCCCGCGCCGCCGGGGCGGCGCCGGCCCGGGGGCCCCCCGGCCGCGGCGCCCGGCCCGCGGCGCCGGGGGCGCGGGCCCGGGCCCGGGCGCCGCCCCGCGCGGCCGCGGCCGCGCCGCCGCCCCCGCGGGGGCGGGGCGGCGCGCCCCGGCCGCGGCGCCGCCCCCGCGCCGCGGCCGGGGCGCCCGGCCGCCGCGCCCCCGGCCGGGGGCGGGGGGCGGCCGCGGCGCGGCGCGGGCCCCCCGGCCGCCGCCGGCCCGCGCCCGCCCGGGGCCGGGGGCCCCGCCCCGCCCGCCCCCGCGCGCCGGCGGCCCGCGGCCCGGCCGCCCCCCGGCGCGGGCGGCGGCGGCCCGGGCGGGGCGCGCGGCGCGCGGGCGGGCGCCGGCCCCCCGCCGGGCCGCGGCGGGCCGCCGGGGGCCCCCCGCCGGGCCCCGGGCGCCGGGCGCCGGCGGCGGCCGCGGGCCGCGCGCCCGCGCCGGGGCCCCGCCGGCGCGCGCCCGCCGCCGCGGGGGCGGGCGGCCCGCCGGCGCCGGGGCGCCGCGGCGCCCGGGCGCCGCCCCCGCGCCCGGGGCCGCGCCCGGGGGCGCGCCCGGCGGCCGCCCGCGCGCCGGGCGGCCCGCGGCCGGGCCGGGGCCCGCCCGGCCGCGCGGCGGCGCCGGCCGCCCGGGGGCGGGCGGGCCGGCCGGCGGCGCCGCGCGGGGCGGCGGGGCGCCCCCGCGGGGGGGCCCGCCCGCCGGCCCCGGGCGGCGGGGGGGCCCCGCCCCCGGGGCGGCGGGGGGCCGCCCCGCGGCGGGGCCCCCCCCGGCGCGCGGCCGCGGCCGGCCGGGCCGGCGGGCGCGCCCGGCCGGGGGGCGCGCGGCGGGCCCCCGGGCCGCGCGCCGCGGGGGCGCGCCCGGGGCCGCGCCGCGCCCCGGCGGCCGGGCCGGGCGCCGGGGCGCCGCCGCCCCCGGCCCGGGCGGGCGCGGGCCCCGGGCCCGGCCCCCCGGGGCGGGCGGGGGGGGGCGGCGGGCCCGGGCGCGGGCGCCGCGCGGGGCGGCGCCCCCCCCCCGGCGCCGCGGGCGGGGCGGCGGGGGGGCGCGCCCGGCCGCCGCGGCGCCGGCGGGGGCCGGGCGCGGGCCCCGGGGGGGCGGGCCCGCCGGGCCGCCCGGCCGGGGGCCCCCCCCGGGGCCGCCGGGGGGGGGCCCGCCGGCGCGCCGCGCCCCCGCCGCCGGCGCGCCGCCGGCGGGCGGGCCGCCGCGCGGCCCGGGGCGGCGGGCCGCGCCGCCGGGCGGGGCGGCGCGCCCCGCGGCCGCCGGGCGGCCGCGCCGCGCCCCGGGGGCGGCGCGGGCGGCGCGCCCGCCCCGGCGGGCGCGGCCCCCCCGCGGCCCCGCGGCCGGCCCGGCGGCGGGCCCCCGCGGGGCGGCGGCCCGCGCGCCGCGCGCCCCGCGCGGGGCGGCGGGGGGGCCGCCCGGGCGGCGGGCGCCGGGGCCCGGCCCCCCGGGGCGCCCCCCGGCCCCGGCGGCCCGCCCGCCGCCCGGCCCCGGGGCCGGGGGCGCGCGCCGGGGGGGGCCCCCCCCGCGGGGGCGGCGCGCCCCGCCCGCGGCGGGGCCCCGGGCCCCCCGGGGCCCGCGGCCGGCCGCGCGCCCCGCGCGCCCGCGCCCCCCGCCCCGCGCCCGCCCCGGGGCCGCGCGGGGGCGCGGGGGGGCCGGGGCGCGCGGCCGGGGCGGGCCCCCGCGCGCGGGGCCGGCGCCCGCGCGGGGCCCCCCCCCCGGCGCCGCGGGGGGGGCGCGGCCCGGCCCGGCCCGCCCGGGCCCGGCCCCCCGCCGCGCGGGCGGGCCCCGGCCCCCCGCCCCCCGGGCGCGGGCCCCGCCGCGGCCCGGCCCGCGGCCCGCGCCCGCGCCGGCGCCCGCCCGCGGCCCCCCCGCCGGCGCCCCGCCCCGCGCGCCCGCGGGCGCCCGGGCGGGGCCCGGCCCCGGCGCGCCGGGCCCGGGCGCCCCGGGCCCGCGGGGCGCGCCGGGCGGGGCGCCCGGGGGCGCGCGCGCCGGGGGGGCGGCGCCCGCGGGCCGCCCCGCCGGCCCGCCGCCCGGCCGCCCCCGCCGCGGCCCGGCCCGGCGGGGGGCCGGGGCCGCGGGCCCGCGGCCGCCGGGCGCCCGCGGGGGGCGCCCGGCGGGCGCGGGGGGGCCCCCGCCCGGGGGGCCGCCCCGCGCGCGGGGGGCCGGCGGCCCGCGGGCCGGCCCCCGCGCGGCGGCGGGGCGGGGGGGCCGGGGCGCCGGGCCGGCGGGCCCCCGCGCCCGCCGCGCCGGCCGGGCGCCGGCCGGCGCCCGGCCGCCCCCCGGGGCGGCCCGCCGCCCGCCGGCGCGCGGGCGGGGCGCCGGCCGCCCGCGCGGGCGGCCGGGCGCGCCGCGGCCGGCCGCGGGCCCCGCGGGGCCCCGCGCGGGCCCGCGGCGCGGCGCGCGCGCGGGCCCGGGCCCGGGCGGCCCCGGCCGGGCGGGCGGCCCGCGGCGCCCCGGCGCCGCCGCCGGCGCGCGGCGCGCCCGGCGCGCCCGCCCCCGCGCGGGGCCGCGGCGGCGGCCGCGCGGCGCCGCCCGCCCCGGGCCGCCCCGCCCCGCCGCGGGCGCGCCCCCCCCCCCGGCGGCGCGGCCGCCGGGGCGCGCGCGGCGCGGGCGGGCCGCCGGGCGCGCGGGCCCGGGGCGGCGCGCCGGGCCGCCGGCGGCGGGGCCGCCGCCGGCGGGCCGGCGGGGGCGGGCCCCCGGGGGGGGGCGGCCGCGCCCGGGGGCCGCCGGGCGCCGGGGGCCCCGCCCCGGGGGCGCCGGCGGCGCCCCCCCCGCCCGGGCCCGGCGCGGCGCCGCGCCGGGGCCCCGCGGGCCCGGCCGGGGCGCGCGGCGGGCGCCGCCGGCGCGGGGGGCGCGCCCCCCCCGGCCGGGCCGGGCCGGCCGCCCCGCGCCGCCCCCGCCGCGGGCGGGGGCCGGGCGGCCGGCCGGCCGCCCCCGCGGGGCGGGGGGCCGGCCGGCGCCCCCCCGGCGGCGCGGCGGCGCGGCGGGGCGCCCGCCCCCCCGCCGCGCCGCCCGCGGGCGGCCGCCCCCGCCGGGCGGGCCCCGGCCG\n",
        "output": "166672\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 498,
        "task_id": 1429,
        "test_case_id": 18,
        "question": "We have a string S of length N consisting of A, T, C, and G.\nStrings T_1 and T_2 of the same length are said to be complementary when, for every i (1 \\leq i \\leq l), the i-th character of T_1 and the i-th character of T_2 are complementary. Here, A and T are complementary to each other, and so are C and G.\nFind the number of non-empty contiguous substrings T of S that satisfies the following condition:\n - There exists a string that is a permutation of T and is complementary to T.\nHere, we distinguish strings that originate from different positions in S, even if the contents are the same.\n\n-----Constraints-----\n - 1 \\leq N \\leq 5000\n - S consists of A, T, C, and G.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN S\n\n-----Output-----\nPrint the number of non-empty contiguous substrings T of S that satisfies the condition.\n\n-----Sample Input-----\n4 AGCT\n\n-----Sample Output-----\n2\n\nThe following two substrings satisfy the condition:\n - GC (the 2-nd through 3-rd characters) is complementary to CG, which is a permutation of GC.\n - AGCT (the 1-st through 4-th characters) is complementary to TCGA, which is a permutation of AGCT.",
        "solutions": "[\"import sys\\n\\nsys.setrecursionlimit(10 ** 6)\\nINF = float(\\\"inf\\\")\\nMOD = 10 ** 9 + 7\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    ans = 0\\n\\n    for i in range(N):\\n        a = 0\\n        c = 0\\n        for j in range(i, N):\\n            if S[j] == \\\"A\\\":\\n                a += 1\\n            elif S[j] == \\\"T\\\":\\n                a -= 1\\n            elif S[j] == \\\"C\\\":\\n                c += 1\\n            else:\\n                c -= 1\\n\\n            if a == c == 0:\\n                ans += 1\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\n\\ncnt = {}\\nat = 0\\ngc = 0\\nans = 0\\ncnt[(0,0)] = 1\\n\\nfor si in s:\\n    if si == \\\"A\\\":\\n        at += 1\\n    elif si==\\\"T\\\":\\n        at -= 1\\n    elif si==\\\"G\\\":\\n        gc += 1\\n    else:\\n        gc -= 1\\n    if (at,gc) in cnt:\\n        ans += cnt[(at,gc)]\\n        cnt[(at,gc)] += 1\\n    else:\\n        cnt[(at,gc)] = 1\\nprint(ans)\", \"import sys\\ndef LS(): return list(sys.stdin.readline().rstrip().split())\\n\\nN,S = LS()\\nans = 0\\nfor i in range(int(N)):\\n    S1 = S[i:]\\n    a,g = 0,0\\n    for s in S1:\\n        if s=='A':\\n            a+= 1\\n        elif s=='G':\\n            g += 1\\n        elif s=='C':\\n            g -= 1\\n        elif s=='T':\\n            a-=1\\n        if a==g==0:\\n            ans += 1\\nprint(ans)\\n\", \"import itertools\\nN,S = input().split()\\nN = int(N)\\nAT = [0]*N\\nCG = [0]*N\\nfor i in  range(N):\\n    if S[i]=='A':\\n        AT[i]=1\\n    if S[i]=='T':\\n        AT[i]=-1\\n    if S[i]=='C':\\n        CG[i]=1\\n    if S[i]=='G':\\n        CG[i]=-1\\nAT = [0] + AT\\nCG = [0] + CG\\nATC = list(itertools.accumulate(AT))\\nCGC = list(itertools.accumulate(CG))\\nans = 0\\nfor i in range(N):\\n    for j in range(i+1,N):\\n        if ATC[i]==ATC[j+1] and CGC[i]==CGC[j+1]:\\n            ans+=1\\nprint(ans)\\n\", \"def main():\\n    n,s = input().split()\\n\\n    ans = 0\\n\\n    # \\u6587\\u5b57\\u5217\\u306e\\u30b9\\u30bf\\u30fc\\u30c8\\u4f4d\\u7f6e\\n    for i in range(int(n)):\\n        at_cnt = 0\\n        gc_cnt = 0\\n        for si in s[i:int(n)]:\\n            if si == 'A':\\n                at_cnt+=1\\n            elif si == 'T':\\n                at_cnt-=1\\n            elif si == 'C':\\n                gc_cnt+=1\\n            elif si == 'G':\\n                gc_cnt-=1\\n\\n            if at_cnt == 0 and gc_cnt == 0:\\n                ans += 1\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"# \\u5404\\u533a\\u753bT\\u304c\\u81ea\\u5206\\u81ea\\u8eab\\u3092\\u4e26\\u3079\\u66ff\\u3048\\u305f\\u6587\\u5b57\\u5217\\u3068\\u76f8\\u88dc\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u8abf\\u3079\\u3066\\u3044\\u304f\\u3002\\n\\nn,s=input().split()\\nN=int(n)\\nS=list(s)\\nA=[0 for _ in range(N)]\\nG=[0 for _ in range(N)]\\nC=[0 for _ in range(N)]\\nT=[0 for _ in range(N)]\\n\\nfor i in range(N):\\n    if S[i]==\\\"A\\\":\\n        A[i]=1\\n    elif S[i]==\\\"G\\\":\\n        G[i]=1\\n    elif S[i]==\\\"C\\\":\\n        C[i]=1\\n    elif S[i]==\\\"T\\\":\\n        T[i]=1\\n\\n\\nans=0\\nfor i in range(N):\\n    Asum=0\\n    Gsum=0\\n    Tsum=0\\n    Csum=0\\n    for j in range(i,N):\\n        Asum+=A[j]\\n        Gsum+=G[j]\\n        Csum+=C[j]\\n        Tsum+=T[j]\\n        if Asum==Tsum and Csum==Gsum:\\n            ans+=1\\n\\nprint(ans)\\n\\n\", \"from collections import defaultdict\\nN, S = input().split()\\nN = int(N)\\n\\ncnt = defaultdict(int)\\nanswer = 0\\nfor i in range(N):\\n    for s in \\\"AGCT\\\":\\n        cnt[s] = 0\\n    for j in range(i + 1, N, 2):\\n        cnt[S[j - 1]] += 1\\n        cnt[S[j]] += 1\\n        if cnt[\\\"A\\\"] == cnt[\\\"T\\\"] and cnt[\\\"C\\\"] == cnt[\\\"G\\\"]: answer += 1\\n        #print(cnt)\\n        \\nprint(answer)\", \"N,S=input().split()\\nN=int(N)\\nleft_AT_number=[0]*(N+1)\\nleft_CG_number=[0]*(N+1)\\nAT=0\\nCG=0\\nfor j in range(N):\\n    if S[j]==\\\"A\\\":\\n        AT+=1\\n    elif S[j]==\\\"T\\\":\\n        AT-=1\\n    elif S[j]==\\\"C\\\":\\n        CG+=1\\n    else:\\n        CG-=1\\n    left_AT_number[j+1]=AT\\n    left_CG_number[j+1]=CG\\nans=0\\ni_CG=0\\ni_AT=0\\nfor i in range(N):\\n    i_CG=left_CG_number[i]\\n    i_AT=left_AT_number[i]\\n    for k in range(i+1,N+1):\\n        if i_CG-left_CG_number[k]==0 and i_AT-left_AT_number[k]==0:\\n            #print(i,k)\\n            ans+=1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import *\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\nprint(r)\", \"# \\u554f\\u984c\\u6587\\u306e\\u610f\\u5473\\u306f\\u307e\\u3063\\u305f\\u304f\\u308f\\u304b\\u3089\\u3093\\u304c\\u3001\\u3068\\u308a\\u3042\\u3048\\u305a\\u90e8\\u5206\\u5217\\u3067A\\u3068T\\u306e\\u6570\\u304a\\u3088\\u3073C\\u3068G\\u306e\\u6570\\u304c\\u540c\\u3058\\u3068\\u3053\\u308d\\u306e\\u6570\\u3001\\u3063\\u3066\\u3053\\u3068\\uff1f\\nline = input().split()\\nn, s = int(line[0]), list(line[1])\\nans = 0\\nfor i in range(n - 1):\\n    d = {\\\"A\\\": 0, \\\"T\\\": 0, \\\"C\\\": 0, \\\"G\\\": 0}\\n    d[s[i]] += 1\\n    for j in range(i + 1, n):\\n        d[s[j]] += 1\\n        if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"C\\\"] == d[\\\"G\\\"]:\\n            ans += 1\\nprint(ans)\\n\", \"n,s = input().split()\\nn = int(n)\\n\\nans = 0\\n\\nfor i in range(n):\\n  d = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0,}\\n  for j in range(i,n):\\n    d[s[j]] += 1\\n    \\n    if d[\\\"A\\\"] == d[\\\"T\\\"] and d[\\\"G\\\"] == d[\\\"C\\\"]:\\n      ans += 1\\n      \\nprint(ans)\", \"from collections import defaultdict\\nN,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic=defaultdict(int)\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"def main():\\n    n,s = input().split()\\n    n = int(n)\\n    ans = 0\\n    for i in range(n):\\n        at=gc=0\\n        for si in s[i:]:\\n            if si==\\\"A\\\":\\n                at += 1\\n            elif si==\\\"T\\\":\\n                at -= 1\\n            elif si==\\\"C\\\":\\n                gc -= 1\\n            else:\\n                gc += 1\\n            if at==0 and gc==0:\\n                ans += 1\\n    print(ans)\\n\\nmain()\", \"from itertools import combinations,permutations,combinations_with_replacement,product,accumulate\\nn,s=input().split()\\nn=int(n)\\na=[0]*n\\nt=[0]*n\\ng=[0]*n\\nc=[0]*n\\nfor i in range(n):\\n    if s[i]==\\\"A\\\":\\n        a[i]+=1\\n    elif s[i]==\\\"T\\\":\\n        t[i]+=1\\n    elif s[i]==\\\"G\\\":\\n        g[i]+=1\\n    else:\\n        c[i]+=1\\na=[0]+list(accumulate(a))\\nt=[0]+list(accumulate(t))\\ng=[0]+list(accumulate(g))\\nc=[0]+list(accumulate(c))\\nans=0\\nfor i in range(1,n+1):\\n    for j in range(i+1,n+1,2):\\n        if (a[j]-a[i-1] == t[j]-t[i-1]) and (g[j]-g[i-1] == c[j]-c[i-1]):\\n            ans+=1\\nprint(ans)\", \"from collections import defaultdict as dd\\nn,s = (i for i in input().split())\\nn,ans = int(n),0\\nx,d = [[0]*2 for i in range(n+1)],dd(int)\\nfor i in range(n):\\n    for j in range(2): x[i+1][j] = x[i][j]\\n    if s[i]==\\\"A\\\": x[i+1][0] = x[i][0]+1\\n    elif s[i]==\\\"T\\\": x[i+1][0] = x[i][0]-1\\n    elif s[i]==\\\"C\\\": x[i+1][1] = x[i][1]+1\\n    else: x[i+1][1] = x[i][1]-1\\nfor i,j in x:\\n    z = str(i)+\\\" \\\"+str(j)\\n    d[z]+=1\\nfor i in d.values(): ans+=i*(i-1)//2\\nprint(ans)\", \"N,S=list(map(str,input().split()))\\nN=int(N)\\n\\nans=0\\nfor i in range(N):\\n  A = {\\\"A\\\":0,\\\"T\\\":0,\\\"G\\\":0,\\\"C\\\":0}\\n  for j in range(i,N):\\n    A[S[j]]+=1\\n    if A[\\\"A\\\"]==A[\\\"T\\\"] and A[\\\"G\\\"]==A[\\\"C\\\"]:\\n      ans+=1\\nprint(ans)\\n\", \"N, S = input().split()\\nN = int(N)\\n\\nAT = [0] * (N+1)\\nCG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        AT[n+1] = 1\\n    if S[n] == \\\"T\\\":\\n        AT[n+1] = -1\\n    if S[n] == \\\"C\\\":\\n        CG[n+1] = 1\\n    if S[n] == \\\"G\\\":\\n        CG[n+1] = -1\\n\\n\\nfor n in range(1, N+1):\\n    AT[n] += AT[n-1]\\n    CG[n] += CG[n-1]\\n\\nans = 0\\n\\nfor i in range(N):\\n    for j in range(i+2, N+1, 2):\\n        at = AT[j] - AT[i]\\n        cg = CG[j] - CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,s=input().split()\\nn=int(N)\\n\\nans=0\\nfor i in range(n):\\n    dic={'A':0,'T':0,'G':0,'C':0}\\n    for j in range(i,n):\\n        dic[s[j]]+=1\\n        if dic['A']==dic['T'] and dic['G']==dic['C']:\\n            ans+=1\\n\\nprint(ans)\", \"N,S=input().split()\\nN=int(N)\\nans=0\\nt={}\\nt[(0,0)]=1\\na,b=0,0\\nfor c in S:\\n  if c == 'A':\\n    a+=1\\n  elif c == 'T':\\n    a-=1\\n  elif c == 'C':\\n    b+=1\\n  else:\\n    b-=1\\n  if (a,b) in t:\\n    ans+=t[(a,b)]\\n    t[(a,b)]+=1\\n  else:\\n    t[(a,b)]=1\\nprint(ans)\", \"#region Header\\n#!/usr/bin/env python3\\n# from typing import *\\n\\nimport sys\\nimport io\\nimport math\\nimport collections\\nimport decimal\\nimport itertools\\nfrom queue import PriorityQueue\\nimport bisect\\n\\ndef input():\\n    return sys.stdin.readline()[:-1]\\n\\nsys.setrecursionlimit(1000000)\\n#endregion\\n\\n# _INPUT = \\\"\\\"\\\"10 AAATACCGCG\\n# \\\"\\\"\\\"\\n# sys.stdin = io.StringIO(_INPUT)\\n\\n\\n\\n# def solve(N: int, S: str) -> int:\\ndef solve(N, S):\\n    # count_a = [0 for _ in range(N+1)]\\n    # count_g = [0 for _ in range(N+1)]\\n    # count_c = [0 for _ in range(N+1)]\\n    # count_t = [0 for _ in range(N+1)]\\n    # for i in range(1, N + 1):\\n    #     count_a[i] = count_a[i-1]\\n    #     count_g[i] = count_g[i-1]\\n    #     count_c[i] = count_c[i-1]\\n    #     count_t[i] = count_t[i-1]\\n    #     if S[i-1] == 'A':\\n    #         count_a[i] += 1\\n    #     elif S[i-1] == 'G':\\n    #         count_g[i] += 1\\n    #     elif S[i-1] == 'C':\\n    #         count_c[i] += 1\\n    #     elif S[i-1] == 'T':\\n    #         count_t[i] += 1\\n\\n    # i\\u6587\\u5b57\\u76ee\\u304b\\u3089j\\u6587\\u5b57\\u76ee\\u307e\\u3067\\u306e\\uff08A\\u306e\\u6570\\uff09=\\uff08T\\u306e\\u6570\\uff09and\\uff08C\\u306e\\u6570\\uff09=\\uff08G\\u306e\\u6570\\uff09\\u3068\\u306a\\u308b (i,j)\\n    n = 0\\n    for i in range(-1, N-1):\\n        count_a = 0\\n        count_g = 0\\n        count_c = 0\\n        count_t = 0\\n        for j in range(i+1, N):\\n            if S[j] == 'A':\\n                count_a += 1\\n            elif S[j] == 'G':\\n                count_g += 1\\n            elif S[j] == 'C':\\n                count_c += 1\\n            elif S[j] == 'T':\\n                count_t += 1\\n            if (count_a == count_t) and (count_c == count_g):\\n                n += 1\\n\\n    return n\\n\\n\\ndef main():\\n    N, S = input().split()\\n    N = int(N)\\n    a = solve(N, S)\\n    print(a)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,s = input().split()\\nn = int(n)\\nans = 0\\n\\nfor i in range(n):\\n    AT,GC=0,0\\n    for j in range(i,n):\\n        if s[j]=='A':\\n            AT+=1\\n        if s[j]=='T':\\n            AT-=1 \\n        if s[j]=='G':\\n            GC+=1  \\n        if s[j]=='C':\\n            GC-=1\\n        if AT==0 and GC==0:\\n            ans+=1\\nprint(ans) \\n\", \"n, s = input().split()\\nn = int(n)\\nans = 0\\nAT, GC = 0, 0\\ncnt = {}\\ncnt[(0, 0)] = 1\\nfor i in s:\\n\\n    if i == \\\"A\\\":\\n        AT += 1\\n    elif i == \\\"T\\\":\\n        AT -= 1\\n    elif i == \\\"G\\\":\\n        GC += 1\\n    elif i == \\\"C\\\":\\n        GC -= 1\\n    if (AT, GC) in cnt:\\n        ans += cnt[(AT, GC)]\\n        cnt[(AT, GC)] += 1\\n    else:\\n        cnt[(AT, GC)] = 1\\n    #print(cnt, ans)\\nprint(ans)\\n\", \"from collections import Counter\\nn, s = input().split()\\nn = int(n)\\n\\nd = {'A': (0, +1), 'T': (0, -1), 'G': (+1, 0), 'C': (-1, 0)}\\n\\ncs = [(0, 0)] * (n + 1)\\nfor i in range(n):\\n    a1, b1 = cs[i]\\n    a2, b2 = d[s[i]]\\n    cs[i + 1] = (a1 + a2, b1 + b2)\\n\\ncnt = Counter(cs)\\nans = sum(m * (m - 1) // 2 for m in list(cnt.values()))\\nprint(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\n# sys.setrecursionlimit(10**6)\\n\\ndef inp():\\n    return int(input())\\ndef inps():\\n    return input().rstrip()\\ndef inpl():\\n    return list(map(int, input().split()))\\ndef inpls():\\n    return list(map(str, input().split()))\\n\\n# import decimal\\n# from decimal import Decimal\\n# decimal.getcontext().prec = 10\\n\\n# from heapq import heappush, heappop, heapify\\n# import math\\nfrom math import gcd, floor, ceil, factorial\\nimport itertools as it\\nfrom collections import deque, defaultdict\\nfrom collections import Counter\\n\\ndef lcd(a, b):\\n    return a * b // gcd(a, b)\\n\\ndef chmin(dp, i, x):\\n    if x < dp[i]: dp[i] = x; return True\\n    return False\\n\\ndef chmax(dp, i, x): \\n    if x > dp[i]: dp[i] = x; return True\\n    return False\\n\\n# ---------------------------------------\\n\\nN, S = input().split()\\nN = int(N)\\nS = S.rstrip()\\n\\nA = [0] * (N + 1)\\nT = [0] * (N + 1)\\nC = [0] * (N + 1)\\nG = [0] * (N + 1)\\nfor i in range(N):\\n    s = S[i]\\n    A[i+1] = A[i] + (1 if s == \\\"A\\\" else 0)  \\n    T[i+1] = T[i] + (1 if s == \\\"T\\\" else 0)\\n    C[i+1] = C[i] + (1 if s == \\\"C\\\" else 0)\\n    G[i+1] = G[i] + (1 if s == \\\"G\\\" else 0)\\n\\nans = 0\\nfor i in range(N):\\n    j = i + 2\\n    while j <= N:\\n        if A[j] - A[i] == T[j] - T[i] and C[j] - C[i] == G[j] - G[i]:\\n            ans += 1\\n        j += 2\\n            \\nprint(ans)\\n\", \"def hoge():\\n  N,S = input().split()\\n  N = int(N)\\n  ans = 0\\n  for i in range(N):\\n    at,cg = 0,0\\n    for j in range(i,N):\\n      X = S[j]\\n      if X == 'A':\\n        at += 1\\n      elif X == 'T':\\n        at -= 1\\n      elif X == 'C':\\n        cg += 1\\n      else:\\n        cg -= 1\\n      if at == 0 and cg == 0:\\n        ans += 1\\n  print(ans)\\nhoge()\", \"n,s=input().split()\\nn=int(n)\\n\\nans=0\\nfor i in range(n):\\n  c1,c2=0,0\\n  for j in range(i,n):\\n    if s[j]=='A':\\n      c1+=1\\n    elif s[j]=='T':\\n      c1-=1\\n    elif s[j]=='C':\\n      c2+=1\\n    elif s[j]=='G':\\n      c2-=1\\n    if c1==c2==0:\\n      ans+=1\\nprint(ans)\", \"from collections import Counter\\n\\nn, s = input().split()\\nn = int(n)\\n\\nd = Counter()\\n\\nat, cg = 0, 0\\nd[(at, cg)] = 1\\nans = 0\\n\\nfor x in s:\\n    if x == \\\"A\\\":\\n        at += 1\\n    elif x == \\\"T\\\":\\n        at -= 1\\n    elif x == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    ans += d[(at, cg)]\\n    d[(at, cg)] += 1\\nprint(ans)\", \"import collections\\n\\nn,s = map(str, input().split())\\n\\nans = 0\\nfor i in range(int(n)):\\n    cnt = {'A': 0, 'T': 0, 'G': 0, 'C': 0}\\n    cnt[s[i]] += 1\\n    for j in range(i+1, int(n)):\\n        cnt[s[j]] += 1\\n        if cnt['A'] == cnt['T'] and cnt['C'] == cnt['G']:\\n            ans += 1\\nprint(ans)\", \"# editorial\\n\\nn, s = input().split()\\nn = int(n)\\n\\nans = 0\\nfor start_ind in range(n):\\n    a_vs_t = 0\\n    g_vs_c = 0\\n    for endInd in range(start_ind, n):\\n        # print(start_ind, endInd)\\n\\n        if s[endInd] == 'A':\\n            a_vs_t += 1\\n        elif s[endInd] == 'T':\\n            a_vs_t -= 1\\n        elif s[endInd] == 'G':\\n            g_vs_c += 1\\n        else:\\n            g_vs_c -= 1\\n\\n        if a_vs_t == 0 and g_vs_c == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"N,S=input().split()\\nN=int(N)\\nresult=0\\nfor i in range(N):\\n  a,b=0,0\\n  for c in S[i:]:\\n    if c == 'A':\\n      a += 1\\n    elif c == 'T':\\n      a -= 1\\n    elif c== 'C':\\n      b += 1\\n    else:\\n      b -= 1\\n    if a==0 and b==0:\\n      result += 1\\nprint(result)    \", \"N, S = input().split()\\nN = int(N)\\n\\ncount = 0\\nfor i in range(N):\\n    num_A = num_T = num_C = num_G = 0\\n    for char in S[i:N]:\\n        if char == \\\"A\\\":\\n            num_A += 1\\n        elif char == \\\"T\\\":\\n            num_T += 1\\n        elif char == \\\"C\\\":\\n            num_C += 1\\n        else:\\n            num_G += 1\\n        if num_A == num_T and num_C == num_G:\\n            count += 1\\n\\nprint(count)\\n\", \"import collections\\ng = input().split()\\nN = int(g[0])\\nl = g[1]\\nS = [[0,0,0,0] for i in range(N+1)]\\ndic = {\\\"A\\\":0,\\\"T\\\":1,\\\"C\\\":2,\\\"G\\\":3}\\nX = [[0,0] for i in range(N+1)]\\nX[0] = tuple(X[0])\\nfor i in range(1,N+1):\\n    S[i] = S[i-1].copy()\\n    S[i][dic[l[i-1]]] += 1\\n    X[i][0] = S[i][0]-S[i][1]\\n    X[i][1] = S[i][2]-S[i][3]\\n    X[i] = tuple(X[i])\\n    #print(str(S[i]) + \\\" \\\" + str(X[i]))\\nD = collections.Counter(X)\\n#print(D)\\nans = 0\\nfor v in D.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"N,S = list(map(str,input().split()))\\nN = int(N)\\nans = 0\\n\\nfor i in range(N):\\n  c1 = 0\\n  c2 = 0\\n  for j in range(i,N):\\n    if S[j] == \\\"A\\\":\\n      c1+=1\\n    elif S[j] == \\\"T\\\":\\n      c1-=1\\n    elif S[j] == \\\"G\\\":\\n      c2+=1\\n    else:\\n      c2-=1\\n    if c1 == 0 and c2 == 0:\\n      ans += 1\\nprint(ans)\\n\", \"n, sl = map(str,input().split())\\nsl = list(sl)\\nn = int(n)\\natl = [0]\\ncgl = [0]\\nat = 0\\ncg = 0\\nfor s in sl:\\n    if s == \\\"A\\\":\\n        at += 1\\n    elif s == \\\"T\\\":\\n        at -= 1\\n    elif s == \\\"C\\\":\\n        cg += 1\\n    else:\\n        cg -= 1\\n    atl.append(at)\\n    cgl.append(cg)\\n\\nans = 0\\nfor i in range(n+1):\\n    for j in range(i+1, n+1):\\n        if atl[j] == atl[i] and cgl[j] == cgl[i]:\\n            ans += 1\\n\\nprint(ans)\", \"_,S = input().split()\\nN = len(S)\\n\\nans = 0\\nfor i in range(0,N-1):\\n    AT = 0\\n    CG = 0\\n    if S[i] == 'A':\\n        AT += 1\\n    elif S[i] == 'T':\\n        AT -= 1\\n    elif S[i] == 'C':\\n        CG += 1\\n    elif S[i] == 'G':\\n        CG -= 1\\n    # print(AT,CG)\\n    for j in range(i+1,N):\\n        if S[j] == 'A':\\n            AT += 1\\n        elif S[j] == 'T':\\n            AT -= 1\\n        elif S[j] == 'C':\\n            CG += 1\\n        elif S[j] == 'G':\\n            CG -= 1\\n        if AT == 0 and CG == 0:\\n            ans += 1\\n        # print(S[i:j+1],AT,CG,ans)\\n            \\nprint(ans)\", \"n,s=input().split()\\nn=int(n)\\nans=0\\nfor i in range(n):\\n    a,t,g,c=0,0,0,0\\n    for j in range(i,n):\\n        if s[j]==\\\"A\\\":\\n            a+=1\\n        elif s[j]==\\\"T\\\":\\n            t+=1\\n        elif s[j]==\\\"G\\\":\\n            g+=1\\n        else:\\n            c+=1\\n        if a==t and g==c:\\n            ans+=1\\nprint(ans)\", \"n,s = input().split()\\nn = (int)(n)\\nat = [0] * (n + 1)\\ncg = [0] * (n + 1)\\nfor i in range(n):\\n    AT = 0\\n    CG = 0\\n    if s[i] == 'A':\\n        AT = 1\\n    elif s[i] == 'T':\\n        AT = -1\\n    elif s[i] == 'C':\\n        CG = 1\\n    else:\\n        CG = -1\\n    at[i + 1] = at[i] + AT\\n    cg[i + 1] = cg[i] + CG\\nans = 0\\nfor i in range(n):\\n    for j in range(i + 1,n + 1):\\n        AT = at[j] - at[i]\\n        CG = cg[j] - cg[i]\\n        if AT == 0 and CG == 0:\\n            ans += 1\\nprint(ans)\", \"#def main\\u3067\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u6271\\u3048\\u3070\\u65e9\\u304f\\u306a\\u308b\\u3089\\u3057\\u3044\\n#\\u30a4\\u30f3\\u30c7\\u30f3\\u30c8\\u30df\\u30b9\\u3057\\u307e\\u304f\\u308a\\u307e\\u3057\\u305f\\n\\ndef main():\\n    l = list(input().split())\\n    word = list(l[1])\\n    count = 0\\n    for i in range(int(l[0])):\\n        at_num = 0\\n        cg_num = 0\\n        for j in word[i:int(l[0])]:\\n            if j == \\\"A\\\":\\n                at_num += 1\\n            elif j == \\\"T\\\":\\n                at_num -= 1\\n            elif j == \\\"G\\\":\\n                cg_num += 1\\n            elif j == \\\"C\\\":\\n                cg_num -= 1\\n            \\n            if at_num == 0 and cg_num == 0:\\n                count += 1\\n    print(count)\\n        \\n        \\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\nfrom collections import *\\ninput = sys.stdin.readline\\n\\nn, s = input().split()\\nx = y = r = 0\\nd = Counter()\\nfor c in s:\\n    d[x,y] += 1\\n    if c == 'A':\\n        x += 1\\n    elif c == 'T':\\n        x -= 1\\n    elif c == 'C':\\n        y += 1\\n    elif c == 'G':\\n        y -= 1\\n    r += d[x,y]\\n    \\nprint(r)\\n\", \"N, S = input().split()\\nN = int(N) + 1\\nans = 0\\nfor i in range(N):\\n    counts = {base: 0 for base in \\\"ATGC\\\"}\\n    for j in range(i + 2, N, 2):\\n        counts[S[j - 2]] += 1\\n        counts[S[j - 1]] += 1\\n        if counts[\\\"A\\\"] == counts[\\\"T\\\"] and counts[\\\"G\\\"] == counts[\\\"C\\\"]:\\n            ans += 1\\nprint(ans)\", \"n, s = input().split()\\nans = 0\\nfor j in range(int(n)):\\n    c1, c2 = 0, 0\\n    for i in range(j, int(n)):\\n        if s[i] == 'T': c1 += 1\\n        elif s[i] == 'A': c1 -= 1\\n        elif s[i] == 'C': c2 += 1\\n        else: c2 -= 1\\n        if c1 == 0 and c2 == 0: ans += 1\\nprint(ans)\", \"N, S = map(str, input().split())\\nN = int(N)\\n\\nans = 0\\nfor i in range(N):\\n    a = 0\\n    t = 0\\n    c = 0\\n    g = 0\\n    for j in range(i, N):\\n        if S[j] == \\\"A\\\":\\n            a += 1\\n        elif S[j] == \\\"T\\\":\\n            t += 1\\n        elif S[j] == \\\"C\\\":\\n            c += 1\\n        else:\\n            g += 1\\n\\n        if a == t and c == g:\\n            ans += 1\\n\\nprint(ans)\", \"n, s = list(map(str, input().split()))\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at, cg = 0, 0\\n    for j in range(i, n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\\n\", \"n, s = map(str, input().split())\\nn = int(n)\\nans = 0\\nfor i in range(n):\\n    at = 0\\n    cg = 0\\n    for j in range(i,n):\\n        if s[j] == 'A':\\n            at += 1\\n        elif s[j] == 'T':\\n            at -= 1\\n        elif s[j] == 'C':\\n            cg += 1\\n        else:\\n            cg -= 1\\n        if at == 0 and cg == 0:\\n            ans += 1\\nprint(ans)\", \"N, S = input().split()\\nN, a = int(N), 0\\n\\nfor i in range(N):\\n    c1, c2 = 0, 0\\n    for s in S[i:]:\\n        if s == 'A':\\n            c1 += 1\\n        if s == 'T':\\n            c1 -= 1\\n        if s == 'C':\\n            c2 += 1\\n        if s == 'G':\\n            c2 -= 1\\n        if c1 == 0 and c2 == 0:\\n            a += 1\\nprint(a)\\n\", \"#from statistics import median\\n#import collections\\n#aa = collections.Counter(a) # list to list || .most_common(2)\\u3067\\u6700\\u5927\\u306e2\\u500b\\u3068\\u308a\\u3060\\u305b\\u308b\\u304a a[0][0]\\nfrom math import gcd\\nfrom itertools import combinations,permutations,accumulate, product, combinations_with_replacement # (string,3) 3\\u56de\\n#from collections import deque\\nfrom collections import deque,defaultdict,Counter\\nimport decimal\\nimport re\\nimport math\\nimport bisect\\nimport heapq\\n#\\n# set\\u578b\\u3060\\u3068\\u3001 | \\u3068 & \\u304c\\u4f7f\\u3048\\u308b\\u3088\\n#\\n# python\\u3067\\u7121\\u7406\\u306a\\u3068\\u304d\\u306f\\u3001pypy\\u3067\\u3084\\u308b\\u3068\\u6b63\\u89e3\\u3059\\u308b\\u304b\\u3082\\uff01\\uff01\\n#\\n#\\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\\n# \\u56db\\u6368\\u4e94\\u5165g\\n#\\n# \\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7cfb\\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\\n#\\n#\\nimport sys\\nsys.setrecursionlimit(10000000)\\nmod = 10**9 + 7\\n# mod = 9982443453\\n# mod = 998244353\\nINF = float('inf')\\ndx = [0,1,0,-1]\\ndy = [1,0,-1,0]\\nfrom sys import stdin\\nreadline = stdin.readline\\ndef readInts():\\n  return list(map(int,readline().split()))\\ndef readTuples():\\n    return tuple(map(int,readline().split()))\\ndef I():\\n    return int(readline())\\nN, S = input().split()\\nN = int(N)\\nans = 0\\nfor i in range(N):\\n    a = 0;t = 0;c = 0;g = 0;\\n    for j in range(i,N):\\n        if S[j] == 'A':\\n            a += 1\\n        elif S[j] == 'T':\\n            t += 1\\n        elif S[j] == 'C':\\n            c += 1\\n        else:\\n            g += 1\\n        if a == t and c == g:\\n            ans += 1\\nprint(ans)\\n\", \"n, S = map(str, input().rstrip().split(\\\" \\\"))\\n\\nn = int(n)\\nS = list(S)\\ncnt = 0\\n\\nac = 0\\ncg = 0\\n\\ndef nC2(num):\\n    ret = num * (num - 1) // 2\\n    return ret\\n\\nSum = []\\nfor i, s in enumerate(S):\\n    if(s == \\\"A\\\"):\\n        ac += 1\\n    elif(s == \\\"T\\\"):\\n        ac -= 1\\n    elif(s == \\\"C\\\"):\\n        cg += 1\\n    elif(s == \\\"G\\\"):\\n        cg -= 1\\n    \\n    Sum.append((ac, cg))\\n\\ncnt = 0\\nTable = {}\\nfor t in Sum:\\n    if(t == (0, 0)):\\n        cnt += 1\\n        \\n    if(t in Table):\\n        Table[t] += 1\\n    else:\\n        Table[t] = 1\\n\\nfor table in Table:\\n    tmp = Table[table]\\n    tmp = nC2(tmp)\\n    cnt += tmp\\nprint(cnt)\", \"N, S = input().split()\\nN = int(N)\\n\\ncnt_AT = [0] * (N+1)\\ncnt_CG = [0] * (N+1)\\n\\nfor n in range(N):\\n    if S[n] == \\\"A\\\":\\n        cnt_AT[n+1] = cnt_AT[n] + 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"T\\\":\\n        cnt_AT[n+1] = cnt_AT[n] - 1\\n        cnt_CG[n+1] = cnt_CG[n]\\n    if S[n] == \\\"C\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] + 1\\n    if S[n] == \\\"G\\\":\\n        cnt_AT[n+1] = cnt_AT[n]\\n        cnt_CG[n+1] = cnt_CG[n] - 1\\n\\nans = 0\\n\\nfor i in range(N-1):\\n    for j in range(i+2, N+1, 2):\\n        at = cnt_AT[j] - cnt_AT[i]\\n        cg = cnt_CG[j] - cnt_CG[i]\\n        if at == 0 and cg == 0:\\n            ans += 1\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN,S = input().split()\\nN = int(N)\\nAT,CG = 0,0\\nd = Counter()\\nd[AT,CG] = 1\\nans = 0\\nfor i in range(N):\\n    if S[i] == \\\"A\\\":\\n        AT += 1\\n    elif S[i] == \\\"T\\\":\\n        AT -= 1\\n    elif S[i] == \\\"C\\\":\\n        CG += 1\\n    else:\\n        CG -= 1\\n    ans += d[AT,CG]\\n    d[AT,CG] += 1\\nprint(ans)\", \"n, s = input().split()\\nn = int(n)\\n\\ns_l = list(s)\\nc = 0\\nfor i in range(n - 1):\\n    d = {'A': 0, 'T': 0, 'C': 0, 'G': 0}\\n    for j in range(i + 2, n + 1, 2):\\n        d[s[j - 1]] += 1\\n        d[s[j - 2]] += 1\\n        if d['A'] == d['T'] and d['C'] == d['G']:\\n            c += 1\\nprint(c)\\n\"]",
        "difficulty": "interview",
        "input": "4980 TTATTAAAAATATTTTTATTAAAATAATATAATTTTATTAATTATATTATTTTTATTATTTAATTAAAAATATAAAATTTTAAAATATTATTTAAAAAATTTTATAATATAATATATTAATTATTATTTTAATTTAAATTTAATATTTATTAATTTTAATAAATAATAATAAATTAATTTTTTTTTTATAAATTTTATTAATATAAAAAATTATATATTTTTATAAAAAAAATAAAATTTTAATTAATTATTAAATTAAATTTTTTATTTATTTATATAATAAAAATATTAAATTAAAATTTTTAATATATTAATTATTTTAATTATATTAATTTATAATATATTAATATTTTTTAAATTAAATTTATTTATTTTAAAATTTATATAATAAATTAATTTAAAAATTTTATTATTTAAAAAATTATTAATATTTAAAATAAAAATATTAATAATTATATTATTTTAATATTTATTTTTTTAATATTTTTTATAAAATTAATATAATTAAAATAAATATAATATTAAAAAATATATTTTAATTTTTTATTATTTTAAAAATTTTTATAATTATAATATTTTTTAATAATTAAATAATATATATTAAAAAATAAAATTTTAAATTTAATTTAATTATTTTTTTATAATTTATATTATTAATTAATTTTAATAAATATTTAATATAATAAAAAAATAAAAATATTAAAATAATTTAATTATATTATTTAATTTAAATTATTTATAAATATTATAATTAATTAATAAATATAAAATATAATTATTAATAATAAAAAAATAAAATTTTTAAAAAAAAATATAAAAAATTTATTAAAAAATAATAATATATAAATATAATTAATATTATTAAAATAATTTTTTTATTTTAAAAATTAAATTAATTTATAATTTTATAATAATTTATTTTTTAATATAATTTTTTTATTATTTAATATTTAAAAAATATATTATATATTTAAAAATAATAATTATAATTATTATAATATTATTATAAAATAAATTTAAATTAATATAATTTTTAATTTATATAATTTTAAATAAATTAATAAAAATTAAATTATAAAATTAAAAATTTTTATTATTAAATATATAATTTATTTTATAAATTTTAATAAATTTTAATATTTAAAAATTTTAATAATATTTATATTAATTTATTTATTTTTTAAATTTAATAAATTAAATTTTATAAAAATAAATTTTTTAAATTATAAATAAAATTTATAAAAATTATATTTTTATTAAAATTTATTTAATATTTTATTAAATAATTTTTTAATATTAATATAATTAATTTATATTTAATTTTTTAAAATATATTTAATAAATAAATATTTTTATATTTTTATAAAATTTATATTAAAATTATAATATTTAATAAATATATTAATTATTAAATTATTTAAAATTAATTATAAAAATTATATTAAAAATAATTATTTTATTTATTTATTTTATAATTAATTAAAATAAATATATTAAATTTTTAATAATTATAAAAATTTTTTTTTTAAATATTATTTATAAATTAATTTAAATAAAATAAAATATAATTTTAAAAATTTTAAAATATAATTATATAATTATTTATAAATATTATTATAAATTAAATAATTTAAATTTAATTTTATAAATTAATAATTTTTATTAAATTATTTTATTTTAATAAATTTTAATAATTAAAATAATATATATTATAATATATAAATTAAATAAATATTTATTATTAAAATATATATTTTAAAAATTTTTATAAAATAAATATTAATATAAAATAAATTAATATTATATTATTTAAAATTATAAAAATAAATAAATAAAATATAATTATTATAAAATATATTTAAATTATTTAATATATATTATTTTATAAATAATATAAAAATAATATAATAATATTTATTTAATATTTTTAAATTAATTAATAATTTAAAAATATAATTTATTTAAATAATATTTATTATATTTAAATTTAATAATAAAATATTTTTATATTTATATATTTAAAAATTAATATTATTTTAAAAATTTTATATAATTATATTTATATTAATTAAAAATTTAAATTTAAAATAATTATATATTTTATTAAAATTAATTAATTAATTATATATATATTTTTAATATATAATAAATAAAAATTATTATTTAAATTTAATAATTTTTTAAAATTTAAATTTTATTTATTTATAATAATTATATAAAAATAAATATATATTATAATTATTAATTTTATTTTAAATTAATTTATTATTTAATTATTTTTATTAAAATTAATTATATTATTATAAATAATTATATAAATTTATTTATATTTAAATAATATATATTTAAATTTTTAATTTATTTTTTTTAATTATTTTTAAATTTTATTAAATAATAATATTTAAATAAAATATTAATTAATTAAATATTATTTTATTAAAAAAAAAAATTTTATATTATATTTTTATTTTATTAATATAATATTAAAATTTTTTAATAATTAAATAATATTTTATATAATAAATATAATTATTAATATAATAAAAAATTATTTATTTAAATTATAATTAATAATTATATTATTAATTTATTTATTAATATATTATTTATTAATAAAATTAATTATTATAATTTTTTAAAATAATTATTTTTAAAAATATAATATTTATTATTATATTTTAAATTAATATATAAAAATATATAAATAATATAAATAAATAATATTAATAATAAAAATATTAATTATTATATAATAAATTATTAATTTTTATATAATAATAATTATTAATAATATTATAATTAAAATATTTTAATAATTTTTTTAAATATTTAATATAAATATTTAATTTAATAAAATATAAAATATATTAAAATTTAAAATTTTTTAATAAAAATTTTTATTATATTATTTATTAAAATATTAAATTTATATATAAATTAATAATATTTTTAATTTTTTTTATAAAATATTATTATTAATTATTAAAAAAAATAATATTTAATAATAATATTTATTATTTATATATAATTAAATAATATTAAATTTAATAATTTTTATAAAAAATAATTAATATTTAAAATTAAATATTAATTTAAAATATTTAATTAATATTATTAAAATAATTAATAAATAATATAAATTATAAAAAATATATAATATTAAATTTAAATAATTTAATTTTAAAAAAAAATTAAATTTAAATTATAAAAAATATATATTTATAAAATTTTAATAATATATATTTAATATTAATATTTAATTTAAATAATAAATTATTATAATTTATAATTTAAATTATTTTAAAAATTAAATATATTAATAAATATAAAAAAATTAAAAAAAATTTAAATTATATAATAAAAATTTTATTTTTATTATTTAAATTTATATAATAATTTAAATTTATTTTTTTTTAATTTAATTTATTTTATTTATTAATTTTTATAATTAATTTATTTTATATATTTTATATTAATAATTAAATATTTTAATTATATATAAAATAAATATTTTATTTAATTTATATTAATAAAAATAATATATAAATTAAATAATAATTATATTTTTTATTTAATATAAAAAAATTTAAATTTTTTAATATATAAATATTAATATTATAATAAAATTTATTTTAAAATTTATTTTTAAAATAAAATAAATAAAAAAATTAATTAATTTTTATTTTTTAATATTTTTATAATATATATAAATTAAATAATAAATAATATTTAAAAAATTTATTTAATTATTAATATTAATTTTAAAATATTTTTAAATTTATATATATTATATTTATAATTATATAATATAAAAAAAATTTTTATAATTTAAAATATTAAATTTTTAATAATATATATAAATATATAATTTAATTTAAATATAATAATTTTTAATTTTTAAATTATAATATAATAATTATTAATTTAAAAAATTATAATTTAAAAAAATATAAATTTTTATAAATAATTAAATTTTTATTTAAAAATTTATTTTATATTTTTTAATAATAAAATTAATAAAAATATATTATTTTATTTTTATATATATAAAAAATTTAAAATTAAATAATATTAAAATTTATTAAATTTTAAAATATATTTAATTTTTTTATATTTTATATTTATTATATTAATAATTTATATTATAAATTTTTTTAAATATTATAATAAAAATTTAAATAAATTATTAATTAAATTAAAAATTTAATAAATTTTTTTTTATTTAAAATTTTAAATAAATAAAAATAAAAAAATAAAAATTTTTATAATATATTAAAAAATTTAATTTTTAAATTTTATATTTTTAATTATATTAATAATATAATTAAATTTATTATTAATTTTAAAATTTTATATTTATTTTTTATAATTATTTATTTAAATAATTAAAAATAAAAAATAAAAAATATAAATATTTAATTTTTATAATAAAATATTATTTTTAATATTTAATTATATTTAATTAAATATTTTTATAAATTTAATAATAAAAAAAATTATTAATATAATTTATATATTTTAATAAAATAAATAAATTTAAATATAAATTTAATTTAAATTTATATTAAATATATTTTTTAAAATTTATATTTAATTATAAATATATTAAAATTAATATTAATATAATAAAATTTATTTAATTTTAAAATTAATATTATTTTAATTATAATAATAAAAAAAAAATTAAAAAAATATATTTTTTTTATAAATTTATTTAAAAAATATTATATAAATTAATATAATAATAAATATTAAAATTATAATTTAAATAAAAAATAATTATTTTTATAATTATTTTTAATTATAAATTTTATAAATATTTTAAATTTTATTAATATTATTTTTAATTTTTAATATTTTATAAATATTAAATTATTTTATATATAAAATATATAATTTAAATTAAAATAATTATATATAATTAATATATAAAAAAAAATTATATTTATAATTTAATAAAAAAATTAATTAATTTATTAA\n",
        "output": "314139\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/arc104/tasks/arc104_b"
    },
    {
        "id": 499,
        "task_id": 2396,
        "test_case_id": 1,
        "question": "The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyperspace. In order to spread the fleet, the captain of each ship has independently come up with the coordinate to which that ship will jump. In the obsolete navigation system used by the Rebels, this coordinate is given as the value of an arithmetic expression of the form $\\frac{a + b}{c}$.\n\nTo plan the future of the resistance movement, Princess Heidi needs to know, for each ship, how many ships are going to end up at the same coordinate after the jump. You are her only hope!\n\n\n-----Input-----\n\nThe first line of the input contains a single integer m (1 ≤ m ≤ 200 000) – the number of ships. The next m lines describe one jump coordinate each, given as an arithmetic expression. An expression has the form (a+b)/c. Namely, it consists of: an opening parenthesis (, a positive integer a of up to two decimal digits, a plus sign +, a positive integer b of up to two decimal digits, a closing parenthesis ), a slash /, and a positive integer c of up to two decimal digits.\n\n\n-----Output-----\n\nPrint a single line consisting of m space-separated integers. The i-th integer should be equal to the number of ships whose coordinate is equal to that of the i-th ship (including the i-th ship itself).\n\n\n-----Example-----\nInput\n4\n(99+98)/97\n(26+4)/10\n(12+33)/15\n(5+1)/7\n\nOutput\n1 2 2 1 \n\n\n-----Note-----\n\nIn the sample testcase, the second and the third ship will both end up at the coordinate 3.\n\nNote that this problem has only two versions – easy and hard.",
        "solutions": "[\"n=int(input())\\ndict1={}\\ndict2={}\\nfor i in range(n):\\n    s=input()\\n    s=s.split('/')\\n    c=int(s[1])\\n    s=s[0].strip('(').strip(')').split('+')\\n    a=int(s[0])\\n    b=int(s[1])\\n    ans=(a+b)/c\\n    try:\\n        dict2[ans] += 1\\n    except:\\n        dict2[ans] = 1\\n    dict1[i] = ans\\nfor i in range(n):\\n    print(dict2[dict1[i]],end=' ')\\n\", \"while True:\\n    try:\\n        mp=dict()\\n        a=list()\\n        n=int(input())\\n        for i in range(n):\\n            s=input()\\n            num=eval(s)\\n            a.append(num)\\n            if num in mp:\\n                mp[num]=mp[num]+1\\n            else:\\n                mp[num]=1\\n        for i in a:\\n            print(mp[i],end=' ')\\n        print()\\n    except EOFError:\\n        break\", \"from collections import Counter\\n\\ndef getList(l, m):\\n  r = []\\n  cnt = Counter(l)\\n  for i in l:\\n    r.extend([cnt[i]])\\n  return r\\n    \\n\\nm = int(input())\\nres = []\\nfor i in range(m):\\n  a, b = [i for i in input().split(\\\"/\\\")]\\n  a = a.split(\\\"+\\\")\\n  aux1 = a[0].replace(\\\"(\\\", \\\"\\\")\\n  aux2 = a[len(a) - 1].replace(\\\")\\\", \\\"\\\")\\n  a = [aux1, aux2]\\n  a = list(map(lambda x: int(x), a))\\n  b = float(b)\\n  res.extend([sum(a)/b])\\n  \\noutput = getList(res, m)\\nfor i in range(len(output)):\\n  if i == len(output) - 1: print(output[i])\\n  else: print(str(output[i]) + \\\" \\\", end = \\\"\\\")\", \"x = int(input())\\na = []\\nb = dict()\\nfor i in range(x):\\n\\ts = input()\\n\\ta.append(eval(s))\\n\\tif(a[i] not in b):\\n\\t\\tb[a[i]] = 1\\n\\telse:\\n\\t\\tb[a[i]] += 1\\n\\nfor i in range(x):\\n\\tprint(\\\"%d \\\"%b[a[i]], end = '')\\nprint()\", \"n = int(input())\\n\\nccnt = {}\\nsn = {}\\n\\nfor i in range(1, n+1):\\n\\ts = input()\\n\\tres = eval(s)\\n\\tres = str(format(res, '.6f'))\\n\\tif (res in ccnt):\\n\\t\\tccnt[res] += 1\\n\\telse:\\n\\t\\tccnt[res] = 1\\n\\tsn[i] = res\\n\\nfor i in range(1, n+1):\\n\\tprint(str(ccnt[sn[i]]) + \\\" \\\", end='')\\n\\nprint()\", \"table = {}\\ncur = 1\\n\\n\\ndef gcd(a, b):\\n\\tif b == 0:\\n\\t\\treturn a\\n\\treturn gcd(b, a%b)\\n\\n\\ndef read():\\n\\tnonlocal cur\\n\\tnonlocal table\\n\\ts = input().split('/')\\n\\tnom = eval(s[0])\\n\\tden = int(s[1])\\n\\tg = gcd(nom, den)\\n\\tnom //= g\\n\\tden //= g\\n\\th_code = nom * 1000 + den\\n\\tif h_code in table:\\n\\t\\ttable[h_code].append(cur)\\n\\telse:\\n\\t\\ttable[h_code] = [cur]\\n\\tcur += 1\\n\\n\\nm = int(input())\\nfor i in range(m):\\n\\tread()\\nans = [0] * 213456\\n\\nfor key, val in table.items():\\n\\tfor idx in val:\\n\\t\\tans[idx] = len(val)\\n\\nfor i in range(1, m+1):\\n\\tprint(ans[i], end = \\\" \\\")\", \"import re\\nfrom collections import defaultdict\\n\\nP = re.compile(r'\\\\((\\\\d+)\\\\+(\\\\d+)\\\\)/(\\\\d+)')\\n\\nm = int(input())\\ns = defaultdict(int)\\nxs = []\\n\\nfor _ in range(m):\\n    a, b, c = list(map(int, P.match(input()).groups()))\\n    x = (a + b) / c\\n    s[x] += 1\\n    xs.append(x)\\n\\nprint(' '.join(str(s[x]) for x in xs))\\n\", \"n = int(input())\\nlst = []\\nd = dict()\\nfor temp in range(n):\\n  input_str, z = input().split('/')\\n  x, y = input_str.split('+')\\n  x = x [1:]\\n  y = y [:len(y)-1]\\n  x = int(x)\\n  y = int(y)\\n  z = int(z)\\n  ans = (x+y)/z\\n  if(ans in d.keys()) : d[ans]+=1\\n  else : d[ans]=1\\n  lst.append(ans)\\nfor i in lst:\\n  print(d[i], end=\\\" \\\")\", \"from fractions import gcd\\n\\nans = []\\ndic = {}\\n\\nn = int(input())\\nfor i in range(n):\\n  word = input()\\n  word = word.replace('(',',')\\n  word = word.replace('+',',')\\n  word = word.replace(')/',',')\\n  w = word.split(',')\\n  a = int(w[1])\\n  b = int(w[2])\\n  numerator = a + b\\n  denumerator = int(w[3])\\n  x = numerator // gcd(numerator, denumerator)\\n  y = denumerator // gcd(numerator, denumerator)\\n  ans.append((x, y))\\n  if (x, y) in dic:\\n    dic[(x, y)] += 1\\n  else:\\n    dic[(x, y)] = 1\\nfor i in range(n):\\n  if i > 0:\\n    print(' ', end='')\\n  print(dic[ans[i]], end='')\\nprint(\\\"\\\\n\\\", end='')\", \"n=int(input())\\nct = {}\\nctx = []\\nfor ni in range(0, n):\\n\\tst = input().strip()[1:]\\n\\tp1 = st.index('+')\\n\\ta = int(st[:p1])\\n\\tst = st[p1+1:]\\n\\tp2 = st.index(')')\\n\\tb = int(st[:p2])\\n\\tc = int(st[p2+2:])\\n\\tv = ((a+b)/c)\\n\\tif v in ct: ct[v]+=1\\n\\telse: ct[v]=1\\n\\tctx.append(v)\\nst = []\\nfor cti in ctx: st.append(str(ct[cti]))\\nprint(\\\" \\\".join(st))\\n\\n\\n\", \"n=int(input())\\ndicti={}\\nL=[]\\nfor i in range(n):\\n  s=input()\\n  a=''\\n  b=''\\n  c=''\\n  i=1\\n  while s[i]!='+':\\n    a+=s[i]\\n    i=i+1 \\n  i=i+1 \\n  while s[i]!=')':\\n    b+=s[i]\\n    i=i+1\\n  c=s[i+2:]\\n  \\n  a,b,c=int(a),int(b),int(c)\\n  res=(a+b)/c \\n  if res in dicti:\\n    dicti[res]+=1\\n  else:\\n    dicti[res]=1\\n  L.append(res)\\n  \\nfor i in range(len(L)):\\n  print(dicti[L[i]],end=' ')\\n  \\n  \\n  \", \"_ = int(input())\\nx = []\\nfor __ in range(_) :\\n    s = input()\\n    a = s.split('/')\\n    c = int(a[1])\\n    a = a[0]\\n    a = a.split(')')\\n    a = a[0]\\n    a = a.split('+')\\n    b = int(a[1])\\n    a = a[0]\\n    a = a.split('(')\\n    a = int(a[1])\\n    x.append((a+b)/c)\\nd = {}\\nfor i in x:\\n    d[i] = 0\\nfor i in x :\\n    d[i]+=1\\nfor i in x :\\n    print(d[i],end=\\\" \\\")\", \"n=int(input())\\nd={}\\nfor i in range(n):\\n    s=input()\\n    s=s.replace('(','')\\n    s=s.replace(')','')\\n    s=s.split('/')\\n    c=float(s[-1])\\n    s=s[0]\\n    s=s.split('+')\\n    a=float(s[0])\\n    b=float(s[1])\\n    ans=(a+b)/c\\n    if ans in d:\\n        d[ans].append(i)\\n    else:\\n        d[ans]=[i]\\nl=[0]*n\\nfor k in list(d.keys()):\\n    for i in d[k]:\\n        l[i]=str(len(d[k]))\\nprint(' '.join(l))\\n\", \"import re\\n\\nmath = re.compile('\\\\((\\\\d+)\\\\+(\\\\d+)\\\\)\\\\/(\\\\d+)')\\nd1 = dict()\\nd2 = dict()\\n\\ndef main():\\n\\tn = int(input())\\n\\n\\tfor i in range(n):\\n\\t\\tstring = input()\\n\\t\\tmatch = math.match(string)\\n\\t\\ta = int(match.group(1))\\n\\t\\tb = int(match.group(2))\\n\\t\\tc = int(match.group(3))\\n\\t\\td2[i+1]=((a+b)/c)\\n\\t\\ttry :\\n\\t\\t\\td1[((a+b)/c)]+=1\\n\\t\\texcept:\\n\\t\\t\\td1[((a+b)/c)]=1\\n\\n\\tlis = []\\n\\n\\tfor i in range(n):\\n\\t\\tlis.append(str(d1[d2[i+1]]))\\n\\n\\tprint(' '.join(lis))\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"from fractions import Fraction\\nn = int(input())\\narr = []\\ncc = {}\\nfor i in range(n):\\n\\tline = input()\\n\\tab, c = line.split('/')\\n\\tab = ab[1:-1]\\n\\ta, b = ab.split('+')\\n\\ta, b, c = [int(x) for x in (a, b, c)]\\n\\tp = (a + b) / c\\n\\tarr.append(p)\\n\\tif p not in cc:\\n\\t\\tcc[p] = 1\\n\\telse:\\n\\t\\tcc[p] += 1\\nfor i in range(n):\\n\\tif i > 0:\\n\\t\\tprint(' ', end=\\\"\\\")\\n\\tprint(cc[arr[i]], end=\\\"\\\")\\n\", \"n = int (input ())\\nl=[]\\nd={}\\nfor i in range (n) :\\n    ch = input()\\n    c= eval(ch)\\n    l.append(c)\\n    if (c in d ) :\\n        d[c]+=1\\n    else :\\n        d[c]=1\\nfor i in range ( n) :\\n    print (d[l[i]] ,end=\\\" \\\")\\n\", \"import re\\n\\nm=int(input())\\nlis=list()\\n\\nfor i in range(m):\\n    s=input()\\n    lis+=[re.split('\\\\W+', s)]\\n\\nd=dict()\\n\\nfor i in range(m):\\n    ans=int(lis[i][1])+int(lis[i][2])\\n    ans=ans/int(lis[i][3])\\n    lis[i][0]=ans\\n    if ans in d:\\n        d[ans]+=1\\n    else: d[ans]=1\\n\\nfor i in range(m):\\n    print(d[lis[i][0]],end=' ')\\n\", \"n=int(input())\\nd={}\\naaa=[]\\nfor ii in range(n):\\n    s=input().strip()\\n    arr=list(s)\\n    for i in range(len(arr)):\\n        if arr[i] is \\\"(\\\" or arr[i] is \\\"+\\\" or arr[i] is \\\")\\\" or arr[i] is \\\"/\\\":\\n            if arr[i] is \\\"/\\\":\\n                arr[i]=\\\"\\\"\\n            else:\\n                arr[i]=\\\" \\\"\\n    a,b,c=map(int,(\\\"\\\".join(arr)).split())\\n    ans=(a+b)/c \\n    if ans in d.keys():\\n        d[ans][0]+=1\\n        d[ans][1].append(ii)\\n    else:\\n        d[ans]=[1,[ii]]\\n    aaa.append(ans)\\narr1={}\\nfor i in d.keys():\\n    for j in d[i][1]:\\n        arr1[j]=d[i][0]\\nfor i in range(n):\\n    print(arr1[i],end=\\\" \\\")\\nprint(\\\"\\\")\\n        \\n    \", \"#codeforces.com/contest/958/problem/D1\\n\\nm=int(input())\\npositions=[]\\nposcount={}\\nfor i in range(m):\\n    crew=list(input())\\n    n=len(crew)\\n    i=1\\n    a=''\\n    while crew[i]!='+':\\n        a+=crew[i]\\n        i+=1\\n    b=''\\n    i+=1\\n    while crew[i]!=')':\\n        b+=crew[i]\\n        i+=1\\n    c=''\\n    i+=2\\n    while i<n:\\n        c+=crew[i]\\n        i+=1\\n    a=int(a)\\n    b=int(b)\\n    c=int(c)\\n    res=(a+b)/c\\n    positions.append(res)\\n    if res in poscount:\\n        poscount[res]+=1\\n    else:\\n        poscount[res]=1\\n\\nans=[]\\nfor i in range(m):\\n    ans.append(poscount[positions[i]])\\nprint(*ans,sep=' ')\", \"from collections import defaultdict\\n\\nm = int(input())\\nvalue = {}\\ncount = defaultdict(int)\\n\\nfor i in range(m):\\n    s = input()\\n    ans = 0\\n    z = \\\"\\\"\\n    n = len(s)\\n    for j in range(1,n):\\n        if s[j]=='+':\\n            ans = int(z)\\n            z = \\\"\\\"\\n            continue\\n        elif s[j]==')':\\n            ans +=int(z)\\n            z = \\\"\\\"\\n            j+=2\\n            while j<n:\\n                z+=s[j]\\n                j+=1\\n            ans = ans/int(z)\\n            count[ans]+=1\\n            value[i] = ans\\n        else:\\n            z = z+s[j]\\n\\nfor i in range(m):\\n    print(count[value[i]],end=\\\" \\\")\\nprint()\\n\"]",
        "difficulty": "interview",
        "input": "4\n(99+98)/97\n(26+4)/10\n(12+33)/15\n(5+1)/7\n",
        "output": "1 2 2 1 ",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/958/D1"
    },
    {
        "id": 500,
        "task_id": 2396,
        "test_case_id": 2,
        "question": "The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyperspace. In order to spread the fleet, the captain of each ship has independently come up with the coordinate to which that ship will jump. In the obsolete navigation system used by the Rebels, this coordinate is given as the value of an arithmetic expression of the form $\\frac{a + b}{c}$.\n\nTo plan the future of the resistance movement, Princess Heidi needs to know, for each ship, how many ships are going to end up at the same coordinate after the jump. You are her only hope!\n\n\n-----Input-----\n\nThe first line of the input contains a single integer m (1 ≤ m ≤ 200 000) – the number of ships. The next m lines describe one jump coordinate each, given as an arithmetic expression. An expression has the form (a+b)/c. Namely, it consists of: an opening parenthesis (, a positive integer a of up to two decimal digits, a plus sign +, a positive integer b of up to two decimal digits, a closing parenthesis ), a slash /, and a positive integer c of up to two decimal digits.\n\n\n-----Output-----\n\nPrint a single line consisting of m space-separated integers. The i-th integer should be equal to the number of ships whose coordinate is equal to that of the i-th ship (including the i-th ship itself).\n\n\n-----Example-----\nInput\n4\n(99+98)/97\n(26+4)/10\n(12+33)/15\n(5+1)/7\n\nOutput\n1 2 2 1 \n\n\n-----Note-----\n\nIn the sample testcase, the second and the third ship will both end up at the coordinate 3.\n\nNote that this problem has only two versions – easy and hard.",
        "solutions": "[\"n=int(input())\\ndict1={}\\ndict2={}\\nfor i in range(n):\\n    s=input()\\n    s=s.split('/')\\n    c=int(s[1])\\n    s=s[0].strip('(').strip(')').split('+')\\n    a=int(s[0])\\n    b=int(s[1])\\n    ans=(a+b)/c\\n    try:\\n        dict2[ans] += 1\\n    except:\\n        dict2[ans] = 1\\n    dict1[i] = ans\\nfor i in range(n):\\n    print(dict2[dict1[i]],end=' ')\\n\", \"while True:\\n    try:\\n        mp=dict()\\n        a=list()\\n        n=int(input())\\n        for i in range(n):\\n            s=input()\\n            num=eval(s)\\n            a.append(num)\\n            if num in mp:\\n                mp[num]=mp[num]+1\\n            else:\\n                mp[num]=1\\n        for i in a:\\n            print(mp[i],end=' ')\\n        print()\\n    except EOFError:\\n        break\", \"from collections import Counter\\n\\ndef getList(l, m):\\n  r = []\\n  cnt = Counter(l)\\n  for i in l:\\n    r.extend([cnt[i]])\\n  return r\\n    \\n\\nm = int(input())\\nres = []\\nfor i in range(m):\\n  a, b = [i for i in input().split(\\\"/\\\")]\\n  a = a.split(\\\"+\\\")\\n  aux1 = a[0].replace(\\\"(\\\", \\\"\\\")\\n  aux2 = a[len(a) - 1].replace(\\\")\\\", \\\"\\\")\\n  a = [aux1, aux2]\\n  a = list(map(lambda x: int(x), a))\\n  b = float(b)\\n  res.extend([sum(a)/b])\\n  \\noutput = getList(res, m)\\nfor i in range(len(output)):\\n  if i == len(output) - 1: print(output[i])\\n  else: print(str(output[i]) + \\\" \\\", end = \\\"\\\")\", \"x = int(input())\\na = []\\nb = dict()\\nfor i in range(x):\\n\\ts = input()\\n\\ta.append(eval(s))\\n\\tif(a[i] not in b):\\n\\t\\tb[a[i]] = 1\\n\\telse:\\n\\t\\tb[a[i]] += 1\\n\\nfor i in range(x):\\n\\tprint(\\\"%d \\\"%b[a[i]], end = '')\\nprint()\", \"n = int(input())\\n\\nccnt = {}\\nsn = {}\\n\\nfor i in range(1, n+1):\\n\\ts = input()\\n\\tres = eval(s)\\n\\tres = str(format(res, '.6f'))\\n\\tif (res in ccnt):\\n\\t\\tccnt[res] += 1\\n\\telse:\\n\\t\\tccnt[res] = 1\\n\\tsn[i] = res\\n\\nfor i in range(1, n+1):\\n\\tprint(str(ccnt[sn[i]]) + \\\" \\\", end='')\\n\\nprint()\", \"table = {}\\ncur = 1\\n\\n\\ndef gcd(a, b):\\n\\tif b == 0:\\n\\t\\treturn a\\n\\treturn gcd(b, a%b)\\n\\n\\ndef read():\\n\\tnonlocal cur\\n\\tnonlocal table\\n\\ts = input().split('/')\\n\\tnom = eval(s[0])\\n\\tden = int(s[1])\\n\\tg = gcd(nom, den)\\n\\tnom //= g\\n\\tden //= g\\n\\th_code = nom * 1000 + den\\n\\tif h_code in table:\\n\\t\\ttable[h_code].append(cur)\\n\\telse:\\n\\t\\ttable[h_code] = [cur]\\n\\tcur += 1\\n\\n\\nm = int(input())\\nfor i in range(m):\\n\\tread()\\nans = [0] * 213456\\n\\nfor key, val in table.items():\\n\\tfor idx in val:\\n\\t\\tans[idx] = len(val)\\n\\nfor i in range(1, m+1):\\n\\tprint(ans[i], end = \\\" \\\")\", \"import re\\nfrom collections import defaultdict\\n\\nP = re.compile(r'\\\\((\\\\d+)\\\\+(\\\\d+)\\\\)/(\\\\d+)')\\n\\nm = int(input())\\ns = defaultdict(int)\\nxs = []\\n\\nfor _ in range(m):\\n    a, b, c = list(map(int, P.match(input()).groups()))\\n    x = (a + b) / c\\n    s[x] += 1\\n    xs.append(x)\\n\\nprint(' '.join(str(s[x]) for x in xs))\\n\", \"n = int(input())\\nlst = []\\nd = dict()\\nfor temp in range(n):\\n  input_str, z = input().split('/')\\n  x, y = input_str.split('+')\\n  x = x [1:]\\n  y = y [:len(y)-1]\\n  x = int(x)\\n  y = int(y)\\n  z = int(z)\\n  ans = (x+y)/z\\n  if(ans in d.keys()) : d[ans]+=1\\n  else : d[ans]=1\\n  lst.append(ans)\\nfor i in lst:\\n  print(d[i], end=\\\" \\\")\", \"from fractions import gcd\\n\\nans = []\\ndic = {}\\n\\nn = int(input())\\nfor i in range(n):\\n  word = input()\\n  word = word.replace('(',',')\\n  word = word.replace('+',',')\\n  word = word.replace(')/',',')\\n  w = word.split(',')\\n  a = int(w[1])\\n  b = int(w[2])\\n  numerator = a + b\\n  denumerator = int(w[3])\\n  x = numerator // gcd(numerator, denumerator)\\n  y = denumerator // gcd(numerator, denumerator)\\n  ans.append((x, y))\\n  if (x, y) in dic:\\n    dic[(x, y)] += 1\\n  else:\\n    dic[(x, y)] = 1\\nfor i in range(n):\\n  if i > 0:\\n    print(' ', end='')\\n  print(dic[ans[i]], end='')\\nprint(\\\"\\\\n\\\", end='')\", \"n=int(input())\\nct = {}\\nctx = []\\nfor ni in range(0, n):\\n\\tst = input().strip()[1:]\\n\\tp1 = st.index('+')\\n\\ta = int(st[:p1])\\n\\tst = st[p1+1:]\\n\\tp2 = st.index(')')\\n\\tb = int(st[:p2])\\n\\tc = int(st[p2+2:])\\n\\tv = ((a+b)/c)\\n\\tif v in ct: ct[v]+=1\\n\\telse: ct[v]=1\\n\\tctx.append(v)\\nst = []\\nfor cti in ctx: st.append(str(ct[cti]))\\nprint(\\\" \\\".join(st))\\n\\n\\n\", \"n=int(input())\\ndicti={}\\nL=[]\\nfor i in range(n):\\n  s=input()\\n  a=''\\n  b=''\\n  c=''\\n  i=1\\n  while s[i]!='+':\\n    a+=s[i]\\n    i=i+1 \\n  i=i+1 \\n  while s[i]!=')':\\n    b+=s[i]\\n    i=i+1\\n  c=s[i+2:]\\n  \\n  a,b,c=int(a),int(b),int(c)\\n  res=(a+b)/c \\n  if res in dicti:\\n    dicti[res]+=1\\n  else:\\n    dicti[res]=1\\n  L.append(res)\\n  \\nfor i in range(len(L)):\\n  print(dicti[L[i]],end=' ')\\n  \\n  \\n  \", \"_ = int(input())\\nx = []\\nfor __ in range(_) :\\n    s = input()\\n    a = s.split('/')\\n    c = int(a[1])\\n    a = a[0]\\n    a = a.split(')')\\n    a = a[0]\\n    a = a.split('+')\\n    b = int(a[1])\\n    a = a[0]\\n    a = a.split('(')\\n    a = int(a[1])\\n    x.append((a+b)/c)\\nd = {}\\nfor i in x:\\n    d[i] = 0\\nfor i in x :\\n    d[i]+=1\\nfor i in x :\\n    print(d[i],end=\\\" \\\")\", \"n=int(input())\\nd={}\\nfor i in range(n):\\n    s=input()\\n    s=s.replace('(','')\\n    s=s.replace(')','')\\n    s=s.split('/')\\n    c=float(s[-1])\\n    s=s[0]\\n    s=s.split('+')\\n    a=float(s[0])\\n    b=float(s[1])\\n    ans=(a+b)/c\\n    if ans in d:\\n        d[ans].append(i)\\n    else:\\n        d[ans]=[i]\\nl=[0]*n\\nfor k in list(d.keys()):\\n    for i in d[k]:\\n        l[i]=str(len(d[k]))\\nprint(' '.join(l))\\n\", \"import re\\n\\nmath = re.compile('\\\\((\\\\d+)\\\\+(\\\\d+)\\\\)\\\\/(\\\\d+)')\\nd1 = dict()\\nd2 = dict()\\n\\ndef main():\\n\\tn = int(input())\\n\\n\\tfor i in range(n):\\n\\t\\tstring = input()\\n\\t\\tmatch = math.match(string)\\n\\t\\ta = int(match.group(1))\\n\\t\\tb = int(match.group(2))\\n\\t\\tc = int(match.group(3))\\n\\t\\td2[i+1]=((a+b)/c)\\n\\t\\ttry :\\n\\t\\t\\td1[((a+b)/c)]+=1\\n\\t\\texcept:\\n\\t\\t\\td1[((a+b)/c)]=1\\n\\n\\tlis = []\\n\\n\\tfor i in range(n):\\n\\t\\tlis.append(str(d1[d2[i+1]]))\\n\\n\\tprint(' '.join(lis))\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"from fractions import Fraction\\nn = int(input())\\narr = []\\ncc = {}\\nfor i in range(n):\\n\\tline = input()\\n\\tab, c = line.split('/')\\n\\tab = ab[1:-1]\\n\\ta, b = ab.split('+')\\n\\ta, b, c = [int(x) for x in (a, b, c)]\\n\\tp = (a + b) / c\\n\\tarr.append(p)\\n\\tif p not in cc:\\n\\t\\tcc[p] = 1\\n\\telse:\\n\\t\\tcc[p] += 1\\nfor i in range(n):\\n\\tif i > 0:\\n\\t\\tprint(' ', end=\\\"\\\")\\n\\tprint(cc[arr[i]], end=\\\"\\\")\\n\", \"n = int (input ())\\nl=[]\\nd={}\\nfor i in range (n) :\\n    ch = input()\\n    c= eval(ch)\\n    l.append(c)\\n    if (c in d ) :\\n        d[c]+=1\\n    else :\\n        d[c]=1\\nfor i in range ( n) :\\n    print (d[l[i]] ,end=\\\" \\\")\\n\", \"import re\\n\\nm=int(input())\\nlis=list()\\n\\nfor i in range(m):\\n    s=input()\\n    lis+=[re.split('\\\\W+', s)]\\n\\nd=dict()\\n\\nfor i in range(m):\\n    ans=int(lis[i][1])+int(lis[i][2])\\n    ans=ans/int(lis[i][3])\\n    lis[i][0]=ans\\n    if ans in d:\\n        d[ans]+=1\\n    else: d[ans]=1\\n\\nfor i in range(m):\\n    print(d[lis[i][0]],end=' ')\\n\", \"n=int(input())\\nd={}\\naaa=[]\\nfor ii in range(n):\\n    s=input().strip()\\n    arr=list(s)\\n    for i in range(len(arr)):\\n        if arr[i] is \\\"(\\\" or arr[i] is \\\"+\\\" or arr[i] is \\\")\\\" or arr[i] is \\\"/\\\":\\n            if arr[i] is \\\"/\\\":\\n                arr[i]=\\\"\\\"\\n            else:\\n                arr[i]=\\\" \\\"\\n    a,b,c=map(int,(\\\"\\\".join(arr)).split())\\n    ans=(a+b)/c \\n    if ans in d.keys():\\n        d[ans][0]+=1\\n        d[ans][1].append(ii)\\n    else:\\n        d[ans]=[1,[ii]]\\n    aaa.append(ans)\\narr1={}\\nfor i in d.keys():\\n    for j in d[i][1]:\\n        arr1[j]=d[i][0]\\nfor i in range(n):\\n    print(arr1[i],end=\\\" \\\")\\nprint(\\\"\\\")\\n        \\n    \", \"#codeforces.com/contest/958/problem/D1\\n\\nm=int(input())\\npositions=[]\\nposcount={}\\nfor i in range(m):\\n    crew=list(input())\\n    n=len(crew)\\n    i=1\\n    a=''\\n    while crew[i]!='+':\\n        a+=crew[i]\\n        i+=1\\n    b=''\\n    i+=1\\n    while crew[i]!=')':\\n        b+=crew[i]\\n        i+=1\\n    c=''\\n    i+=2\\n    while i<n:\\n        c+=crew[i]\\n        i+=1\\n    a=int(a)\\n    b=int(b)\\n    c=int(c)\\n    res=(a+b)/c\\n    positions.append(res)\\n    if res in poscount:\\n        poscount[res]+=1\\n    else:\\n        poscount[res]=1\\n\\nans=[]\\nfor i in range(m):\\n    ans.append(poscount[positions[i]])\\nprint(*ans,sep=' ')\", \"from collections import defaultdict\\n\\nm = int(input())\\nvalue = {}\\ncount = defaultdict(int)\\n\\nfor i in range(m):\\n    s = input()\\n    ans = 0\\n    z = \\\"\\\"\\n    n = len(s)\\n    for j in range(1,n):\\n        if s[j]=='+':\\n            ans = int(z)\\n            z = \\\"\\\"\\n            continue\\n        elif s[j]==')':\\n            ans +=int(z)\\n            z = \\\"\\\"\\n            j+=2\\n            while j<n:\\n                z+=s[j]\\n                j+=1\\n            ans = ans/int(z)\\n            count[ans]+=1\\n            value[i] = ans\\n        else:\\n            z = z+s[j]\\n\\nfor i in range(m):\\n    print(count[value[i]],end=\\\" \\\")\\nprint()\\n\"]",
        "difficulty": "interview",
        "input": "10\n(44+98)/19\n(36+58)/47\n(62+74)/68\n(69+95)/82\n(26+32)/29\n(32+46)/39\n(32+24)/28\n(47+61)/54\n(39+13)/26\n(98+98)/98\n",
        "output": "1 9 9 9 9 9 9 9 9 9 ",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/958/D1"
    },
    {
        "id": 501,
        "task_id": 2396,
        "test_case_id": 3,
        "question": "The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyperspace. In order to spread the fleet, the captain of each ship has independently come up with the coordinate to which that ship will jump. In the obsolete navigation system used by the Rebels, this coordinate is given as the value of an arithmetic expression of the form $\\frac{a + b}{c}$.\n\nTo plan the future of the resistance movement, Princess Heidi needs to know, for each ship, how many ships are going to end up at the same coordinate after the jump. You are her only hope!\n\n\n-----Input-----\n\nThe first line of the input contains a single integer m (1 ≤ m ≤ 200 000) – the number of ships. The next m lines describe one jump coordinate each, given as an arithmetic expression. An expression has the form (a+b)/c. Namely, it consists of: an opening parenthesis (, a positive integer a of up to two decimal digits, a plus sign +, a positive integer b of up to two decimal digits, a closing parenthesis ), a slash /, and a positive integer c of up to two decimal digits.\n\n\n-----Output-----\n\nPrint a single line consisting of m space-separated integers. The i-th integer should be equal to the number of ships whose coordinate is equal to that of the i-th ship (including the i-th ship itself).\n\n\n-----Example-----\nInput\n4\n(99+98)/97\n(26+4)/10\n(12+33)/15\n(5+1)/7\n\nOutput\n1 2 2 1 \n\n\n-----Note-----\n\nIn the sample testcase, the second and the third ship will both end up at the coordinate 3.\n\nNote that this problem has only two versions – easy and hard.",
        "solutions": "[\"n=int(input())\\ndict1={}\\ndict2={}\\nfor i in range(n):\\n    s=input()\\n    s=s.split('/')\\n    c=int(s[1])\\n    s=s[0].strip('(').strip(')').split('+')\\n    a=int(s[0])\\n    b=int(s[1])\\n    ans=(a+b)/c\\n    try:\\n        dict2[ans] += 1\\n    except:\\n        dict2[ans] = 1\\n    dict1[i] = ans\\nfor i in range(n):\\n    print(dict2[dict1[i]],end=' ')\\n\", \"while True:\\n    try:\\n        mp=dict()\\n        a=list()\\n        n=int(input())\\n        for i in range(n):\\n            s=input()\\n            num=eval(s)\\n            a.append(num)\\n            if num in mp:\\n                mp[num]=mp[num]+1\\n            else:\\n                mp[num]=1\\n        for i in a:\\n            print(mp[i],end=' ')\\n        print()\\n    except EOFError:\\n        break\", \"from collections import Counter\\n\\ndef getList(l, m):\\n  r = []\\n  cnt = Counter(l)\\n  for i in l:\\n    r.extend([cnt[i]])\\n  return r\\n    \\n\\nm = int(input())\\nres = []\\nfor i in range(m):\\n  a, b = [i for i in input().split(\\\"/\\\")]\\n  a = a.split(\\\"+\\\")\\n  aux1 = a[0].replace(\\\"(\\\", \\\"\\\")\\n  aux2 = a[len(a) - 1].replace(\\\")\\\", \\\"\\\")\\n  a = [aux1, aux2]\\n  a = list(map(lambda x: int(x), a))\\n  b = float(b)\\n  res.extend([sum(a)/b])\\n  \\noutput = getList(res, m)\\nfor i in range(len(output)):\\n  if i == len(output) - 1: print(output[i])\\n  else: print(str(output[i]) + \\\" \\\", end = \\\"\\\")\", \"x = int(input())\\na = []\\nb = dict()\\nfor i in range(x):\\n\\ts = input()\\n\\ta.append(eval(s))\\n\\tif(a[i] not in b):\\n\\t\\tb[a[i]] = 1\\n\\telse:\\n\\t\\tb[a[i]] += 1\\n\\nfor i in range(x):\\n\\tprint(\\\"%d \\\"%b[a[i]], end = '')\\nprint()\", \"n = int(input())\\n\\nccnt = {}\\nsn = {}\\n\\nfor i in range(1, n+1):\\n\\ts = input()\\n\\tres = eval(s)\\n\\tres = str(format(res, '.6f'))\\n\\tif (res in ccnt):\\n\\t\\tccnt[res] += 1\\n\\telse:\\n\\t\\tccnt[res] = 1\\n\\tsn[i] = res\\n\\nfor i in range(1, n+1):\\n\\tprint(str(ccnt[sn[i]]) + \\\" \\\", end='')\\n\\nprint()\", \"table = {}\\ncur = 1\\n\\n\\ndef gcd(a, b):\\n\\tif b == 0:\\n\\t\\treturn a\\n\\treturn gcd(b, a%b)\\n\\n\\ndef read():\\n\\tnonlocal cur\\n\\tnonlocal table\\n\\ts = input().split('/')\\n\\tnom = eval(s[0])\\n\\tden = int(s[1])\\n\\tg = gcd(nom, den)\\n\\tnom //= g\\n\\tden //= g\\n\\th_code = nom * 1000 + den\\n\\tif h_code in table:\\n\\t\\ttable[h_code].append(cur)\\n\\telse:\\n\\t\\ttable[h_code] = [cur]\\n\\tcur += 1\\n\\n\\nm = int(input())\\nfor i in range(m):\\n\\tread()\\nans = [0] * 213456\\n\\nfor key, val in table.items():\\n\\tfor idx in val:\\n\\t\\tans[idx] = len(val)\\n\\nfor i in range(1, m+1):\\n\\tprint(ans[i], end = \\\" \\\")\", \"import re\\nfrom collections import defaultdict\\n\\nP = re.compile(r'\\\\((\\\\d+)\\\\+(\\\\d+)\\\\)/(\\\\d+)')\\n\\nm = int(input())\\ns = defaultdict(int)\\nxs = []\\n\\nfor _ in range(m):\\n    a, b, c = list(map(int, P.match(input()).groups()))\\n    x = (a + b) / c\\n    s[x] += 1\\n    xs.append(x)\\n\\nprint(' '.join(str(s[x]) for x in xs))\\n\", \"n = int(input())\\nlst = []\\nd = dict()\\nfor temp in range(n):\\n  input_str, z = input().split('/')\\n  x, y = input_str.split('+')\\n  x = x [1:]\\n  y = y [:len(y)-1]\\n  x = int(x)\\n  y = int(y)\\n  z = int(z)\\n  ans = (x+y)/z\\n  if(ans in d.keys()) : d[ans]+=1\\n  else : d[ans]=1\\n  lst.append(ans)\\nfor i in lst:\\n  print(d[i], end=\\\" \\\")\", \"from fractions import gcd\\n\\nans = []\\ndic = {}\\n\\nn = int(input())\\nfor i in range(n):\\n  word = input()\\n  word = word.replace('(',',')\\n  word = word.replace('+',',')\\n  word = word.replace(')/',',')\\n  w = word.split(',')\\n  a = int(w[1])\\n  b = int(w[2])\\n  numerator = a + b\\n  denumerator = int(w[3])\\n  x = numerator // gcd(numerator, denumerator)\\n  y = denumerator // gcd(numerator, denumerator)\\n  ans.append((x, y))\\n  if (x, y) in dic:\\n    dic[(x, y)] += 1\\n  else:\\n    dic[(x, y)] = 1\\nfor i in range(n):\\n  if i > 0:\\n    print(' ', end='')\\n  print(dic[ans[i]], end='')\\nprint(\\\"\\\\n\\\", end='')\", \"n=int(input())\\nct = {}\\nctx = []\\nfor ni in range(0, n):\\n\\tst = input().strip()[1:]\\n\\tp1 = st.index('+')\\n\\ta = int(st[:p1])\\n\\tst = st[p1+1:]\\n\\tp2 = st.index(')')\\n\\tb = int(st[:p2])\\n\\tc = int(st[p2+2:])\\n\\tv = ((a+b)/c)\\n\\tif v in ct: ct[v]+=1\\n\\telse: ct[v]=1\\n\\tctx.append(v)\\nst = []\\nfor cti in ctx: st.append(str(ct[cti]))\\nprint(\\\" \\\".join(st))\\n\\n\\n\", \"n=int(input())\\ndicti={}\\nL=[]\\nfor i in range(n):\\n  s=input()\\n  a=''\\n  b=''\\n  c=''\\n  i=1\\n  while s[i]!='+':\\n    a+=s[i]\\n    i=i+1 \\n  i=i+1 \\n  while s[i]!=')':\\n    b+=s[i]\\n    i=i+1\\n  c=s[i+2:]\\n  \\n  a,b,c=int(a),int(b),int(c)\\n  res=(a+b)/c \\n  if res in dicti:\\n    dicti[res]+=1\\n  else:\\n    dicti[res]=1\\n  L.append(res)\\n  \\nfor i in range(len(L)):\\n  print(dicti[L[i]],end=' ')\\n  \\n  \\n  \", \"_ = int(input())\\nx = []\\nfor __ in range(_) :\\n    s = input()\\n    a = s.split('/')\\n    c = int(a[1])\\n    a = a[0]\\n    a = a.split(')')\\n    a = a[0]\\n    a = a.split('+')\\n    b = int(a[1])\\n    a = a[0]\\n    a = a.split('(')\\n    a = int(a[1])\\n    x.append((a+b)/c)\\nd = {}\\nfor i in x:\\n    d[i] = 0\\nfor i in x :\\n    d[i]+=1\\nfor i in x :\\n    print(d[i],end=\\\" \\\")\", \"n=int(input())\\nd={}\\nfor i in range(n):\\n    s=input()\\n    s=s.replace('(','')\\n    s=s.replace(')','')\\n    s=s.split('/')\\n    c=float(s[-1])\\n    s=s[0]\\n    s=s.split('+')\\n    a=float(s[0])\\n    b=float(s[1])\\n    ans=(a+b)/c\\n    if ans in d:\\n        d[ans].append(i)\\n    else:\\n        d[ans]=[i]\\nl=[0]*n\\nfor k in list(d.keys()):\\n    for i in d[k]:\\n        l[i]=str(len(d[k]))\\nprint(' '.join(l))\\n\", \"import re\\n\\nmath = re.compile('\\\\((\\\\d+)\\\\+(\\\\d+)\\\\)\\\\/(\\\\d+)')\\nd1 = dict()\\nd2 = dict()\\n\\ndef main():\\n\\tn = int(input())\\n\\n\\tfor i in range(n):\\n\\t\\tstring = input()\\n\\t\\tmatch = math.match(string)\\n\\t\\ta = int(match.group(1))\\n\\t\\tb = int(match.group(2))\\n\\t\\tc = int(match.group(3))\\n\\t\\td2[i+1]=((a+b)/c)\\n\\t\\ttry :\\n\\t\\t\\td1[((a+b)/c)]+=1\\n\\t\\texcept:\\n\\t\\t\\td1[((a+b)/c)]=1\\n\\n\\tlis = []\\n\\n\\tfor i in range(n):\\n\\t\\tlis.append(str(d1[d2[i+1]]))\\n\\n\\tprint(' '.join(lis))\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"from fractions import Fraction\\nn = int(input())\\narr = []\\ncc = {}\\nfor i in range(n):\\n\\tline = input()\\n\\tab, c = line.split('/')\\n\\tab = ab[1:-1]\\n\\ta, b = ab.split('+')\\n\\ta, b, c = [int(x) for x in (a, b, c)]\\n\\tp = (a + b) / c\\n\\tarr.append(p)\\n\\tif p not in cc:\\n\\t\\tcc[p] = 1\\n\\telse:\\n\\t\\tcc[p] += 1\\nfor i in range(n):\\n\\tif i > 0:\\n\\t\\tprint(' ', end=\\\"\\\")\\n\\tprint(cc[arr[i]], end=\\\"\\\")\\n\", \"n = int (input ())\\nl=[]\\nd={}\\nfor i in range (n) :\\n    ch = input()\\n    c= eval(ch)\\n    l.append(c)\\n    if (c in d ) :\\n        d[c]+=1\\n    else :\\n        d[c]=1\\nfor i in range ( n) :\\n    print (d[l[i]] ,end=\\\" \\\")\\n\", \"import re\\n\\nm=int(input())\\nlis=list()\\n\\nfor i in range(m):\\n    s=input()\\n    lis+=[re.split('\\\\W+', s)]\\n\\nd=dict()\\n\\nfor i in range(m):\\n    ans=int(lis[i][1])+int(lis[i][2])\\n    ans=ans/int(lis[i][3])\\n    lis[i][0]=ans\\n    if ans in d:\\n        d[ans]+=1\\n    else: d[ans]=1\\n\\nfor i in range(m):\\n    print(d[lis[i][0]],end=' ')\\n\", \"n=int(input())\\nd={}\\naaa=[]\\nfor ii in range(n):\\n    s=input().strip()\\n    arr=list(s)\\n    for i in range(len(arr)):\\n        if arr[i] is \\\"(\\\" or arr[i] is \\\"+\\\" or arr[i] is \\\")\\\" or arr[i] is \\\"/\\\":\\n            if arr[i] is \\\"/\\\":\\n                arr[i]=\\\"\\\"\\n            else:\\n                arr[i]=\\\" \\\"\\n    a,b,c=map(int,(\\\"\\\".join(arr)).split())\\n    ans=(a+b)/c \\n    if ans in d.keys():\\n        d[ans][0]+=1\\n        d[ans][1].append(ii)\\n    else:\\n        d[ans]=[1,[ii]]\\n    aaa.append(ans)\\narr1={}\\nfor i in d.keys():\\n    for j in d[i][1]:\\n        arr1[j]=d[i][0]\\nfor i in range(n):\\n    print(arr1[i],end=\\\" \\\")\\nprint(\\\"\\\")\\n        \\n    \", \"#codeforces.com/contest/958/problem/D1\\n\\nm=int(input())\\npositions=[]\\nposcount={}\\nfor i in range(m):\\n    crew=list(input())\\n    n=len(crew)\\n    i=1\\n    a=''\\n    while crew[i]!='+':\\n        a+=crew[i]\\n        i+=1\\n    b=''\\n    i+=1\\n    while crew[i]!=')':\\n        b+=crew[i]\\n        i+=1\\n    c=''\\n    i+=2\\n    while i<n:\\n        c+=crew[i]\\n        i+=1\\n    a=int(a)\\n    b=int(b)\\n    c=int(c)\\n    res=(a+b)/c\\n    positions.append(res)\\n    if res in poscount:\\n        poscount[res]+=1\\n    else:\\n        poscount[res]=1\\n\\nans=[]\\nfor i in range(m):\\n    ans.append(poscount[positions[i]])\\nprint(*ans,sep=' ')\", \"from collections import defaultdict\\n\\nm = int(input())\\nvalue = {}\\ncount = defaultdict(int)\\n\\nfor i in range(m):\\n    s = input()\\n    ans = 0\\n    z = \\\"\\\"\\n    n = len(s)\\n    for j in range(1,n):\\n        if s[j]=='+':\\n            ans = int(z)\\n            z = \\\"\\\"\\n            continue\\n        elif s[j]==')':\\n            ans +=int(z)\\n            z = \\\"\\\"\\n            j+=2\\n            while j<n:\\n                z+=s[j]\\n                j+=1\\n            ans = ans/int(z)\\n            count[ans]+=1\\n            value[i] = ans\\n        else:\\n            z = z+s[j]\\n\\nfor i in range(m):\\n    print(count[value[i]],end=\\\" \\\")\\nprint()\\n\"]",
        "difficulty": "interview",
        "input": "30\n(89+76)/87\n(81+78)/18\n(60+97)/32\n(41+14)/48\n(55+65)/27\n(29+15)/95\n(64+13)/96\n(78+30)/75\n(43+6)/60\n(69+34)/48\n(62+2)/97\n(85+42)/3\n(4+97)/42\n(1+18)/39\n(46+55)/76\n(22+59)/24\n(62+81)/98\n(64+8)/51\n(9+59)/48\n(47+2)/80\n(33+74)/76\n(61+83)/44\n(86+4)/51\n(65+41)/49\n(53+36)/45\n(6+19)/15\n(51+21)/68\n(98+36)/86\n(92+65)/86\n(27+58)/78\n",
        "output": "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/958/D1"
    },
    {
        "id": 502,
        "task_id": 2746,
        "test_case_id": 1,
        "question": "Compare two version numbers version1 and version2.\nIf version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0.\n\nYou may assume that the version strings are non-empty and contain only digits and the . character.\nThe . character does not represent a decimal point and is used to separate number sequences.\nFor instance, 2.5 is not \"two and a half\" or \"half way to version three\", it is the fifth second-level revision of the second first-level revision.\n\nExample 1:\n\n\nInput: version1 = \"0.1\", version2 = \"1.1\"\nOutput: -1\n\nExample 2:\n\n\nInput: version1 = \"1.0.1\", version2 = \"1\"\nOutput: 1\n\nExample 3:\n\n\nInput: version1 = \"7.5.2.4\", version2 = \"7.5.3\"\nOutput: -1",
        "solutions": "[\"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         while version1 and version2:\\n             result1 = version1.split('.', 1)\\n             if len(result1) == 2:\\n                 digit1, version1 = result1[0], result1[1]\\n             else:\\n                 digit1 = result1[0]\\n                 version1 = \\\"\\\"\\n             result2 = version2.split('.', 1)\\n             if len(result2) == 2:\\n                 digit2, version2 = result2[0], result2[1]\\n             else:\\n                 digit2 = result2[0]\\n                 version2 = \\\"\\\"\\n             if int(digit1) > int(digit2):\\n                 return 1\\n             elif int(digit1) < int(digit2):\\n                 return -1\\n \\n         if version1 and sum(map(lambda x: int(x), version1.split('.'))) != 0:\\n             return 1\\n         if version2 and sum(map(lambda x: int(x), version2.split('.'))) != 0:\\n             return -1\\n         return 0\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         v1, v2 = [int(i) for i in version1.split('.')], [int(i) for i in version2.split('.')]\\n         if len(v1) > len(v2): v2 += [0] * (len(v1) - len(v2))\\n         if len(v1) < len(v2): v1 += [0] * (len(v2) - len(v1))   \\n         for i in range(len(v1)):\\n             if v1[i] > v2[i]: return 1\\n             if v1[i] < v2[i]: return -1\\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         l1 = [int(x) for x in version1.split('.')]\\n         l2 = [int(x) for x in version2.split('.')]\\n         \\n         max_len = max(len(l1), len(l2))\\n         l1 += [0] * (max_len - len(l1))\\n         l2 += [0] * (max_len - len(l2))\\n         \\n         for i in range(0, max_len):\\n             if l1[i] > l2[i]:\\n                 return 1\\n             elif l1[i] < l2[i]:\\n                 return -1\\n         \\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         v1 = version1.split(\\\".\\\")\\n         v2 = version2.split(\\\".\\\")\\n         for i in range(max(len(v1), len(v2))):\\n             a = int(v1[i]) if len(v1) > i else 0\\n             b = int(v2[i]) if len(v2) > i else 0\\n             if a > b:\\n                 return 1\\n             elif a < b:\\n                 return -1\\n         return 0\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         \\n         \\n         if version1 == version2:\\n             return 0\\n         else:\\n             version1_nums = version1.split('.')\\n             version2_nums = version2.split('.')\\n             len1, len2 = len(version1_nums), len(version2_nums)\\n             end = max(len1, len2 )\\n             version1_nums.extend([0]*(end - len1))\\n             version2_nums.extend([0]*(end - len2))\\n             for i in range(end):\\n                 if int(version1_nums[i]) < int(version2_nums[i]):\\n                     return -1\\n                 elif int(version1_nums[i]) > int(version2_nums[i]):\\n                     return 1\\n             return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         a,b=[int(i) for i in version1.split('.')],[int(i) for i in version2.split('.')]\\n         for i in range(max(len(a),len(b))):\\n             if i==len(a):a.append(0)\\n             if i==len(b):b.append(0)\\n             if a[i]>b[i]:\\n                 return 1\\n             elif a[i]<b[i]:\\n                 return -1\\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         \\n         v1 = version1.split('.')\\n         v2 = version2.split('.')\\n         \\n         len1 = len(v1)\\n         len2 = len(v2)\\n         \\n         for i in range(min(len1, len2)):\\n             if int(v1[i]) != int(v2[i]):\\n                 return 1 if int(v1[i]) > int(v2[i]) else -1\\n             \\n         (v,t) = (v1,1) if len1 > len2 else (v2,-1)\\n         for j in v[min(len1,len2):]:\\n             if int(j) > 0:\\n                 return t\\n             \\n         return 0\\n         \\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         v1 = [int(n) for n in version1.split('.')]\\n         v2 = [int(n) for n in version2.split('.')]\\n         for i in range(max(len(v1), len(v2))):\\n             x1 = v1[i] if i < len(v1) else 0\\n             x2 = v2[i] if i < len(v2) else 0\\n             if x1 > x2:\\n                 return 1\\n             if x1 < x2:\\n                 return -1\\n             \\n         return 0\", \"from itertools import zip_longest\\n class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         rs = None\\n         for x in zip_longest(\\n                 (int(x) for x in version1.split('.')),\\n                 (int(x) for x in version2.split('.')),\\n                 fillvalue=0):\\n             if x[0] == x[1]:\\n                 pass\\n             else:\\n                 rs = x[0] > x[1]\\n                 break\\n \\n         return {None: 0, True: 1, False: -1}[rs]\"]",
        "difficulty": "interview",
        "input": [
            "\"1.01\"",
            "\"1.001\""
        ],
        "output": 0,
        "halu_type": "Data Compliance Hallucination",
        "fn_name": "compareVersion",
        "starter_code": "\nclass Solution:\n    def compareVersion(self, version1: str, version2: str) -> int:\n        ",
        "url": "https://leetcode.com/problems/compare-version-numbers/"
    },
    {
        "id": 503,
        "task_id": 2746,
        "test_case_id": 2,
        "question": "Compare two version numbers version1 and version2.\nIf version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0.\n\nYou may assume that the version strings are non-empty and contain only digits and the . character.\nThe . character does not represent a decimal point and is used to separate number sequences.\nFor instance, 2.5 is not \"two and a half\" or \"half way to version three\", it is the fifth second-level revision of the second first-level revision.\n\nExample 1:\n\n\nInput: version1 = \"0.1\", version2 = \"1.1\"\nOutput: -1\n\nExample 2:\n\n\nInput: version1 = \"1.0.1\", version2 = \"1\"\nOutput: 1\n\nExample 3:\n\n\nInput: version1 = \"7.5.2.4\", version2 = \"7.5.3\"\nOutput: -1",
        "solutions": "[\"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         while version1 and version2:\\n             result1 = version1.split('.', 1)\\n             if len(result1) == 2:\\n                 digit1, version1 = result1[0], result1[1]\\n             else:\\n                 digit1 = result1[0]\\n                 version1 = \\\"\\\"\\n             result2 = version2.split('.', 1)\\n             if len(result2) == 2:\\n                 digit2, version2 = result2[0], result2[1]\\n             else:\\n                 digit2 = result2[0]\\n                 version2 = \\\"\\\"\\n             if int(digit1) > int(digit2):\\n                 return 1\\n             elif int(digit1) < int(digit2):\\n                 return -1\\n \\n         if version1 and sum(map(lambda x: int(x), version1.split('.'))) != 0:\\n             return 1\\n         if version2 and sum(map(lambda x: int(x), version2.split('.'))) != 0:\\n             return -1\\n         return 0\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         v1, v2 = [int(i) for i in version1.split('.')], [int(i) for i in version2.split('.')]\\n         if len(v1) > len(v2): v2 += [0] * (len(v1) - len(v2))\\n         if len(v1) < len(v2): v1 += [0] * (len(v2) - len(v1))   \\n         for i in range(len(v1)):\\n             if v1[i] > v2[i]: return 1\\n             if v1[i] < v2[i]: return -1\\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         l1 = [int(x) for x in version1.split('.')]\\n         l2 = [int(x) for x in version2.split('.')]\\n         \\n         max_len = max(len(l1), len(l2))\\n         l1 += [0] * (max_len - len(l1))\\n         l2 += [0] * (max_len - len(l2))\\n         \\n         for i in range(0, max_len):\\n             if l1[i] > l2[i]:\\n                 return 1\\n             elif l1[i] < l2[i]:\\n                 return -1\\n         \\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         v1 = version1.split(\\\".\\\")\\n         v2 = version2.split(\\\".\\\")\\n         for i in range(max(len(v1), len(v2))):\\n             a = int(v1[i]) if len(v1) > i else 0\\n             b = int(v2[i]) if len(v2) > i else 0\\n             if a > b:\\n                 return 1\\n             elif a < b:\\n                 return -1\\n         return 0\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         \\n         \\n         if version1 == version2:\\n             return 0\\n         else:\\n             version1_nums = version1.split('.')\\n             version2_nums = version2.split('.')\\n             len1, len2 = len(version1_nums), len(version2_nums)\\n             end = max(len1, len2 )\\n             version1_nums.extend([0]*(end - len1))\\n             version2_nums.extend([0]*(end - len2))\\n             for i in range(end):\\n                 if int(version1_nums[i]) < int(version2_nums[i]):\\n                     return -1\\n                 elif int(version1_nums[i]) > int(version2_nums[i]):\\n                     return 1\\n             return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         a,b=[int(i) for i in version1.split('.')],[int(i) for i in version2.split('.')]\\n         for i in range(max(len(a),len(b))):\\n             if i==len(a):a.append(0)\\n             if i==len(b):b.append(0)\\n             if a[i]>b[i]:\\n                 return 1\\n             elif a[i]<b[i]:\\n                 return -1\\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         \\n         v1 = version1.split('.')\\n         v2 = version2.split('.')\\n         \\n         len1 = len(v1)\\n         len2 = len(v2)\\n         \\n         for i in range(min(len1, len2)):\\n             if int(v1[i]) != int(v2[i]):\\n                 return 1 if int(v1[i]) > int(v2[i]) else -1\\n             \\n         (v,t) = (v1,1) if len1 > len2 else (v2,-1)\\n         for j in v[min(len1,len2):]:\\n             if int(j) > 0:\\n                 return t\\n             \\n         return 0\\n         \\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         v1 = [int(n) for n in version1.split('.')]\\n         v2 = [int(n) for n in version2.split('.')]\\n         for i in range(max(len(v1), len(v2))):\\n             x1 = v1[i] if i < len(v1) else 0\\n             x2 = v2[i] if i < len(v2) else 0\\n             if x1 > x2:\\n                 return 1\\n             if x1 < x2:\\n                 return -1\\n             \\n         return 0\", \"from itertools import zip_longest\\n class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         rs = None\\n         for x in zip_longest(\\n                 (int(x) for x in version1.split('.')),\\n                 (int(x) for x in version2.split('.')),\\n                 fillvalue=0):\\n             if x[0] == x[1]:\\n                 pass\\n             else:\\n                 rs = x[0] > x[1]\\n                 break\\n \\n         return {None: 0, True: 1, False: -1}[rs]\"]",
        "difficulty": "interview",
        "input": [
            "\"1.0\"",
            "\"1.0.0\""
        ],
        "output": 0,
        "halu_type": "Data Compliance Hallucination",
        "fn_name": "compareVersion",
        "starter_code": "\nclass Solution:\n    def compareVersion(self, version1: str, version2: str) -> int:\n        ",
        "url": "https://leetcode.com/problems/compare-version-numbers/"
    },
    {
        "id": 504,
        "task_id": 2746,
        "test_case_id": 3,
        "question": "Compare two version numbers version1 and version2.\nIf version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0.\n\nYou may assume that the version strings are non-empty and contain only digits and the . character.\nThe . character does not represent a decimal point and is used to separate number sequences.\nFor instance, 2.5 is not \"two and a half\" or \"half way to version three\", it is the fifth second-level revision of the second first-level revision.\n\nExample 1:\n\n\nInput: version1 = \"0.1\", version2 = \"1.1\"\nOutput: -1\n\nExample 2:\n\n\nInput: version1 = \"1.0.1\", version2 = \"1\"\nOutput: 1\n\nExample 3:\n\n\nInput: version1 = \"7.5.2.4\", version2 = \"7.5.3\"\nOutput: -1",
        "solutions": "[\"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         while version1 and version2:\\n             result1 = version1.split('.', 1)\\n             if len(result1) == 2:\\n                 digit1, version1 = result1[0], result1[1]\\n             else:\\n                 digit1 = result1[0]\\n                 version1 = \\\"\\\"\\n             result2 = version2.split('.', 1)\\n             if len(result2) == 2:\\n                 digit2, version2 = result2[0], result2[1]\\n             else:\\n                 digit2 = result2[0]\\n                 version2 = \\\"\\\"\\n             if int(digit1) > int(digit2):\\n                 return 1\\n             elif int(digit1) < int(digit2):\\n                 return -1\\n \\n         if version1 and sum(map(lambda x: int(x), version1.split('.'))) != 0:\\n             return 1\\n         if version2 and sum(map(lambda x: int(x), version2.split('.'))) != 0:\\n             return -1\\n         return 0\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         v1, v2 = [int(i) for i in version1.split('.')], [int(i) for i in version2.split('.')]\\n         if len(v1) > len(v2): v2 += [0] * (len(v1) - len(v2))\\n         if len(v1) < len(v2): v1 += [0] * (len(v2) - len(v1))   \\n         for i in range(len(v1)):\\n             if v1[i] > v2[i]: return 1\\n             if v1[i] < v2[i]: return -1\\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         l1 = [int(x) for x in version1.split('.')]\\n         l2 = [int(x) for x in version2.split('.')]\\n         \\n         max_len = max(len(l1), len(l2))\\n         l1 += [0] * (max_len - len(l1))\\n         l2 += [0] * (max_len - len(l2))\\n         \\n         for i in range(0, max_len):\\n             if l1[i] > l2[i]:\\n                 return 1\\n             elif l1[i] < l2[i]:\\n                 return -1\\n         \\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         v1 = version1.split(\\\".\\\")\\n         v2 = version2.split(\\\".\\\")\\n         for i in range(max(len(v1), len(v2))):\\n             a = int(v1[i]) if len(v1) > i else 0\\n             b = int(v2[i]) if len(v2) > i else 0\\n             if a > b:\\n                 return 1\\n             elif a < b:\\n                 return -1\\n         return 0\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         \\n         \\n         if version1 == version2:\\n             return 0\\n         else:\\n             version1_nums = version1.split('.')\\n             version2_nums = version2.split('.')\\n             len1, len2 = len(version1_nums), len(version2_nums)\\n             end = max(len1, len2 )\\n             version1_nums.extend([0]*(end - len1))\\n             version2_nums.extend([0]*(end - len2))\\n             for i in range(end):\\n                 if int(version1_nums[i]) < int(version2_nums[i]):\\n                     return -1\\n                 elif int(version1_nums[i]) > int(version2_nums[i]):\\n                     return 1\\n             return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         a,b=[int(i) for i in version1.split('.')],[int(i) for i in version2.split('.')]\\n         for i in range(max(len(a),len(b))):\\n             if i==len(a):a.append(0)\\n             if i==len(b):b.append(0)\\n             if a[i]>b[i]:\\n                 return 1\\n             elif a[i]<b[i]:\\n                 return -1\\n         return 0\\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         \\n         v1 = version1.split('.')\\n         v2 = version2.split('.')\\n         \\n         len1 = len(v1)\\n         len2 = len(v2)\\n         \\n         for i in range(min(len1, len2)):\\n             if int(v1[i]) != int(v2[i]):\\n                 return 1 if int(v1[i]) > int(v2[i]) else -1\\n             \\n         (v,t) = (v1,1) if len1 > len2 else (v2,-1)\\n         for j in v[min(len1,len2):]:\\n             if int(j) > 0:\\n                 return t\\n             \\n         return 0\\n         \\n\", \"class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         v1 = [int(n) for n in version1.split('.')]\\n         v2 = [int(n) for n in version2.split('.')]\\n         for i in range(max(len(v1), len(v2))):\\n             x1 = v1[i] if i < len(v1) else 0\\n             x2 = v2[i] if i < len(v2) else 0\\n             if x1 > x2:\\n                 return 1\\n             if x1 < x2:\\n                 return -1\\n             \\n         return 0\", \"from itertools import zip_longest\\n class Solution:\\n     def compareVersion(self, version1, version2):\\n         \\\"\\\"\\\"\\n         :type version1: str\\n         :type version2: str\\n         :rtype: int\\n         \\\"\\\"\\\"\\n         rs = None\\n         for x in zip_longest(\\n                 (int(x) for x in version1.split('.')),\\n                 (int(x) for x in version2.split('.')),\\n                 fillvalue=0):\\n             if x[0] == x[1]:\\n                 pass\\n             else:\\n                 rs = x[0] > x[1]\\n                 break\\n \\n         return {None: 0, True: 1, False: -1}[rs]\"]",
        "difficulty": "interview",
        "input": [
            "\"1.0.1\"",
            "\"1\""
        ],
        "output": 1,
        "halu_type": "Data Compliance Hallucination",
        "fn_name": "compareVersion",
        "starter_code": "\nclass Solution:\n    def compareVersion(self, version1: str, version2: str) -> int:\n        ",
        "url": "https://leetcode.com/problems/compare-version-numbers/"
    },
    {
        "id": 505,
        "task_id": 2876,
        "test_case_id": 3,
        "question": "Today you are doing your calculus homework, and you are tasked with finding a Lipschitz constant for a function f(x), which is defined for $N$ integer numbers $x$ and produces real values. Formally, the Lipschitz constant for a function f is the smallest real number $L$ such that for any $x$ and $y$ with f(x) and f(y) defined we have:\\[ |f(x) - f(y)| \\leq L \\cdot |x - y|. \\]\n\n-----Input-----\nThe first line contains $N$ – the number of points for which f is defined. The next $N$ lines each contain an integer $x$ and a real number $z$, which mean that $f(x) = z$. Input satisfies the following constraints:\n - $2 \\leq N \\leq 200000$.\n - All $x$ and $z$ are in the range $-10^9 \\leq x,z \\leq 10^9$.\n - All $x$ in the input are distinct.\n\n-----Output-----\nPrint one number – the Lipschitz constant. The result will be considered correct if it is within an absolute error of $10^{-4}$ from the jury’s answer.\n\n-----Examples-----\nSample Input 1:\n3\n1 1\n2 2\n3 4\nSample Output 1:\n2\n\nSample Input 2:\n2\n1 4\n2 2\nSample Output 2:\n2",
        "solutions": "",
        "difficulty": "interview",
        "input": "4\n-10 6.342\n-7 3\n46 18.1\n2 -34\n",
        "output": "4.111111111\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/lipschitzconstant"
    },
    {
        "id": 506,
        "task_id": 2904,
        "test_case_id": 1,
        "question": "At some point or another, most computer science students have written a standard Sudoku solving program. This is yet another “put numbers in a grid” puzzle.\n\nNumbers are placed in the grid so that each outlined region contains the numbers $1$ to $n$, where $n$ is the number of squares in the region. The same number can never touch itself, not even diagonally.\n\n\n\nIncomplete Grid\n\nSolution Grid\n\nFor this problem, you will write a program that takes as input an incomplete puzzle grid and outputs the puzzle solution grid.\n\n-----Input-----\nThe input consists of a single data set. This data set starts with a line containing the number of rows in the input grid $R$, ($1 \\le R \\le 7$), and the number of columns in the input grid $C$, ($1 \\le C \\le 7$), separated by spaces. The next $R$ lines contain a representation of the incomplete input grid, one row per line. Each row has $C$ characters, representing the digits in each cell. The value in each cell is represented by either the digit already in that cell or a ‘-’ for an initially empty cell.\n\nThis grid is followed by a description of the separate regions in the grid. The first of these lines specifies the total number of regions. This is followed by one line for each region that specifies the cells contained in that region. Each region description consists of a decimal number $N$, specifying the number of cells in the region, followed by $N$ cell descriptions separated by spaces. Each cell description consists of a left parenthesis, followed the cell’s row index, followed by a comma, followed by the cell’s row number, followed by a right parenthesis. Regions do not overlap.\n\n-----Output-----\nOutput $R$ lines containing $C$ digits (separated by single spaces) showing the solution grid for the corresponding input data set. You are guaranteed that there is a unique solution.\n\n-----Examples-----\nSample Input:\n3 5\n- - - - -\n- - - - -\n4 - - - 1\n5\n1 (1,1)\n2 (1,2) (1,3)\n5 (2,1) (2,2) (3,1) (3,2) (3,3)\n4 (2,3) (2,4) (1,4) (1,5)\n3 (3,4) (3,5) (2,5)\nSample Output:\n1 2 1 2 1\n3 5 3 4 3\n4 2 1 2 1",
        "solutions": "",
        "difficulty": "interview",
        "input": "3 5\n- - - - -\n- - - - -\n4 - - - 1\n5\n1 (1,1)\n2 (1,2) (1,3)\n5 (2,1) (2,2) (3,1) (3,2) (3,3)\n4 (2,3) (2,4) (1,4) (1,5)\n3 (3,4) (3,5) (2,5)\n",
        "output": "1 2 1 2 1\n3 5 3 4 3\n4 2 1 2 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/capsules"
    },
    {
        "id": 507,
        "task_id": 2904,
        "test_case_id": 2,
        "question": "At some point or another, most computer science students have written a standard Sudoku solving program. This is yet another “put numbers in a grid” puzzle.\n\nNumbers are placed in the grid so that each outlined region contains the numbers $1$ to $n$, where $n$ is the number of squares in the region. The same number can never touch itself, not even diagonally.\n\n\n\nIncomplete Grid\n\nSolution Grid\n\nFor this problem, you will write a program that takes as input an incomplete puzzle grid and outputs the puzzle solution grid.\n\n-----Input-----\nThe input consists of a single data set. This data set starts with a line containing the number of rows in the input grid $R$, ($1 \\le R \\le 7$), and the number of columns in the input grid $C$, ($1 \\le C \\le 7$), separated by spaces. The next $R$ lines contain a representation of the incomplete input grid, one row per line. Each row has $C$ characters, representing the digits in each cell. The value in each cell is represented by either the digit already in that cell or a ‘-’ for an initially empty cell.\n\nThis grid is followed by a description of the separate regions in the grid. The first of these lines specifies the total number of regions. This is followed by one line for each region that specifies the cells contained in that region. Each region description consists of a decimal number $N$, specifying the number of cells in the region, followed by $N$ cell descriptions separated by spaces. Each cell description consists of a left parenthesis, followed the cell’s row index, followed by a comma, followed by the cell’s row number, followed by a right parenthesis. Regions do not overlap.\n\n-----Output-----\nOutput $R$ lines containing $C$ digits (separated by single spaces) showing the solution grid for the corresponding input data set. You are guaranteed that there is a unique solution.\n\n-----Examples-----\nSample Input:\n3 5\n- - - - -\n- - - - -\n4 - - - 1\n5\n1 (1,1)\n2 (1,2) (1,3)\n5 (2,1) (2,2) (3,1) (3,2) (3,3)\n4 (2,3) (2,4) (1,4) (1,5)\n3 (3,4) (3,5) (2,5)\nSample Output:\n1 2 1 2 1\n3 5 3 4 3\n4 2 1 2 1",
        "solutions": "",
        "difficulty": "interview",
        "input": "7 7\n- - - - - - -\n4 - - - - 5 -\n- - - - - - -\n- - - 3 - - -\n- - - - - - -\n- - - - - - -\n- - - - - - -\n14\n5 (1,1) (2,1) (3,1) (2,2) (2,3)\n4 (2,4) (1,2) (1,3) (1,4)\n2 (1,5) (1,6)\n1 (1,7)\n4 (4,1) (5,1) (6,1) (5,2)\n1 (7,1)\n4 (3,2) (4,2) (4,3) (5,3)\n3 (7,3) (7,2) (6,2)\n4 (6,3) (6,4) (7,4) (7,5)\n6 (2,5) (3,5) (4,5) (3,6) (2,6) (2,7)\n4 (3,7) (4,7) (4,6) (5,6)\n1 (5,7)\n5 (7,7) (7,6) (6,7) (6,6) (6,5)\n5 (3,3) (3,4) (4,4) (5,4) (5,5)\n",
        "output": "3 1 4 2 1 2 1\n4 2 5 3 6 5 4\n1 3 1 4 2 3 1\n2 4 2 3 1 4 2\n1 3 1 5 2 3 1\n4 2 4 3 4 5 2\n1 3 1 2 1 3 1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/capsules"
    },
    {
        "id": 508,
        "task_id": 2916,
        "test_case_id": 1,
        "question": "Trouble has come to the remote group of islands known as Insumulia. Due to an unfortunate combination of over-consumption, natural climate variations, and generally difficult conditions, the island of Incunabula has run out of trees. Because several other Insumulian islands depended on trees from Incunabula through trade, its collapse will have repercussions all over Insumulia. In this problem, we’ll simulate a (highly oversimplified) model of the situation to determine the effects of the collapse of Incunabula. \n\nWe model the situation as follows. Each island has a threshold $T_ i$ on the amount of incoming goods (for simplicity we assume that there is only a single commodity of goods) it needs to receive per lunar cycle in order for the society of the island to sustain itself. If the amount of incoming goods drops below the threshold, society on the island will collapse and die out, and the island will no longer provide goods to other islands, thereby potentially causing them to collapse as well. Each island provides some amount of goods to a number of other islands. If an island collapses, we assume that goods that would have been delivered to that island is effectively lost; it does not get redistributed and delivered to other islands instead. Also, once an island dies out it is not repopulated (until possibly long after the ongoing collapses have finished).\n\nYour job is to write a program to compute the number of islands that survive after the potential chain reaction of collapses that is caused by the collapse of Incunabula.\n\n-----Input-----\nThe first line of input contains an integer $N$ ($1 \\le N \\le 100000$), the number of islands in Insumulia.\n\nThen follow $N$ lines, describing each island. The $i$’th such description starts with two integers $T_ i$, $K_ i$, where $0 \\le T_ i \\le 50000$ is the amount of goods the $i$’th island needs to receive in order to survive, and $0 \\le K_ i \\le N-1$ is the number of other islands the $i$’th islands receives goods from. The remainder of the description of the $i$’th island is a list of $K_ i$ pairs of integers. The $j$’th such pair, $S_{ij}$, $V_{ij}$, indicates that island $i$ receives $V_{ij}$ units of goods from island $S_{ij}$ each lunar cycle. You may assume that the $S_{ij}$’s are distinct and between $1$ and $N$ (inclusive), and that none of them equals $i$. The values $V_{ij}$ satisfy $1 \\le V_{ij} \\le 1000$ and their sum is at least $T_ i$. The sum of all the $K_ i$’s for all the $N$ islands is at most $500000$.\n\nIslands are numbered from $1$ to $N$, and Incunabula is island number $1$.\n\n-----Output-----\nOutput a single integer, the number of islands surviving the collapses.\n\n-----Examples-----\nSample Input:\n4\n0 0\n25 3 1 10 3 10 4 10\n10 1 2 10\n10 1 2 10\nSample Output:\n0",
        "solutions": "",
        "difficulty": "interview",
        "input": "4\n0 0\n25 3 1 10 3 10 4 10\n10 1 2 10\n10 1 2 10\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/collapse"
    },
    {
        "id": 509,
        "task_id": 2916,
        "test_case_id": 2,
        "question": "Trouble has come to the remote group of islands known as Insumulia. Due to an unfortunate combination of over-consumption, natural climate variations, and generally difficult conditions, the island of Incunabula has run out of trees. Because several other Insumulian islands depended on trees from Incunabula through trade, its collapse will have repercussions all over Insumulia. In this problem, we’ll simulate a (highly oversimplified) model of the situation to determine the effects of the collapse of Incunabula. \n\nWe model the situation as follows. Each island has a threshold $T_ i$ on the amount of incoming goods (for simplicity we assume that there is only a single commodity of goods) it needs to receive per lunar cycle in order for the society of the island to sustain itself. If the amount of incoming goods drops below the threshold, society on the island will collapse and die out, and the island will no longer provide goods to other islands, thereby potentially causing them to collapse as well. Each island provides some amount of goods to a number of other islands. If an island collapses, we assume that goods that would have been delivered to that island is effectively lost; it does not get redistributed and delivered to other islands instead. Also, once an island dies out it is not repopulated (until possibly long after the ongoing collapses have finished).\n\nYour job is to write a program to compute the number of islands that survive after the potential chain reaction of collapses that is caused by the collapse of Incunabula.\n\n-----Input-----\nThe first line of input contains an integer $N$ ($1 \\le N \\le 100000$), the number of islands in Insumulia.\n\nThen follow $N$ lines, describing each island. The $i$’th such description starts with two integers $T_ i$, $K_ i$, where $0 \\le T_ i \\le 50000$ is the amount of goods the $i$’th island needs to receive in order to survive, and $0 \\le K_ i \\le N-1$ is the number of other islands the $i$’th islands receives goods from. The remainder of the description of the $i$’th island is a list of $K_ i$ pairs of integers. The $j$’th such pair, $S_{ij}$, $V_{ij}$, indicates that island $i$ receives $V_{ij}$ units of goods from island $S_{ij}$ each lunar cycle. You may assume that the $S_{ij}$’s are distinct and between $1$ and $N$ (inclusive), and that none of them equals $i$. The values $V_{ij}$ satisfy $1 \\le V_{ij} \\le 1000$ and their sum is at least $T_ i$. The sum of all the $K_ i$’s for all the $N$ islands is at most $500000$.\n\nIslands are numbered from $1$ to $N$, and Incunabula is island number $1$.\n\n-----Output-----\nOutput a single integer, the number of islands surviving the collapses.\n\n-----Examples-----\nSample Input:\n4\n0 0\n25 3 1 10 3 10 4 10\n10 1 2 10\n10 1 2 10\nSample Output:\n0",
        "solutions": "",
        "difficulty": "interview",
        "input": "4\n0 0\n20 3 1 10 3 10 4 10\n10 1 2 10\n10 1 2 10\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/collapse"
    },
    {
        "id": 510,
        "task_id": 2941,
        "test_case_id": 1,
        "question": "You work at a clinic. The clinic factors in the waiting time when selecting patients to treat next. This approach was adopted to prevent patients from having to wait too long before being treated. Your task is to help the clinic perform $3$ types of queries:\n - Process a patient arrival to the clinic. The patient will have an arrival time $T$, a name $M$, and a severity $S$ that is accessed automatically by scanners at the entrance.\n - At time $T$, the doctor is ready to treat a patient. Every time this happens, the clinic will calculate priority values for every patient waiting in the clinic, and the patient with the highest priority value will be treated first. The priority value is computed as the following sum\\[ S + K \\cdot W \\]\n\nwhere $S$ is the severity value of the patient, $K$ is the constant that the clinic uses, and $W$ is the total time the patient has been waiting in the clinic. If there are multiple patients with that value, the patient with the lexicographically smallest name is treated next. Your program will announce the name of that patient.\n - At time $T$, the clinic receives a notification stating that, due to unfortunate circumstances, a patient with name $M$ has left the queue permanently. If no patient with name $M$ exists in the queue, it is always a false alarm and will be ignored by the clinic. Otherwise, the notification is guaranteed to be valid and should be processed accordingly.\n\n-----Input-----\nThe first line of the input contains $2$ integers, $1 \\leq N \\leq 200000$, the number of queries to be processed, and $0 \\leq K \\leq 10000000$, the constant for the clinic. $N$ lines follow, each line beginning with an integer $Q$ where $Q$ = $1$, $2$ or $3$. $Q = 1$ denotes a query of the first type and will be followed by an integer $T$, a string $M$ and an integer $S$. $Q = 2$ denotes a query of the second type and will be followed by an integer $T$. $Q = 3$ denotes a query of the third type and will be followed by an integer $T$ and a string $M$. For all queries, $0 \\leq T,S \\leq 10000000$, and $T$ values are strictly increasing. $M$ is a non-empty alphanumeric string containing no spaces, and contains at most $10$ characters. All patients have unique names. There is at least one query of the second type.\n\n-----Output-----\nFor each query of the second type, output the name of the patient who will be treated on a new line. If the clinic is empty, print the string “doctor takes a break” (without quotes) on a new line instead.\n\n-----Subtasks-----\n - (28 Points): $1 \\leq N \\leq 10,000$. There is no query of type $3$. You can assume that $K = 0$.\n - (32 Points): $1 \\leq N \\leq 10,000$. There is no query of type $3$.\n - (20 Points): There is no query of type $3$.\n - (20 Points): No additional constraints.\n\n-----Warning-----\nThe I/O files are large. Please use fast I/O methods.\n\n-----Examples-----\nSample Input:\n5 1\n1 10 Alice 5\n1 15 Bob 15\n2 20\n2 25\n2 30\nSample Output:\nBob\nAlice\ndoctor takes a break",
        "solutions": "",
        "difficulty": "interview",
        "input": "5 1\n1 10 Alice 5\n1 15 Bob 15\n2 20\n2 25\n2 30\n",
        "output": "Bob\nAlice\ndoctor takes a break\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/clinic"
    },
    {
        "id": 511,
        "task_id": 2941,
        "test_case_id": 2,
        "question": "You work at a clinic. The clinic factors in the waiting time when selecting patients to treat next. This approach was adopted to prevent patients from having to wait too long before being treated. Your task is to help the clinic perform $3$ types of queries:\n - Process a patient arrival to the clinic. The patient will have an arrival time $T$, a name $M$, and a severity $S$ that is accessed automatically by scanners at the entrance.\n - At time $T$, the doctor is ready to treat a patient. Every time this happens, the clinic will calculate priority values for every patient waiting in the clinic, and the patient with the highest priority value will be treated first. The priority value is computed as the following sum\\[ S + K \\cdot W \\]\n\nwhere $S$ is the severity value of the patient, $K$ is the constant that the clinic uses, and $W$ is the total time the patient has been waiting in the clinic. If there are multiple patients with that value, the patient with the lexicographically smallest name is treated next. Your program will announce the name of that patient.\n - At time $T$, the clinic receives a notification stating that, due to unfortunate circumstances, a patient with name $M$ has left the queue permanently. If no patient with name $M$ exists in the queue, it is always a false alarm and will be ignored by the clinic. Otherwise, the notification is guaranteed to be valid and should be processed accordingly.\n\n-----Input-----\nThe first line of the input contains $2$ integers, $1 \\leq N \\leq 200000$, the number of queries to be processed, and $0 \\leq K \\leq 10000000$, the constant for the clinic. $N$ lines follow, each line beginning with an integer $Q$ where $Q$ = $1$, $2$ or $3$. $Q = 1$ denotes a query of the first type and will be followed by an integer $T$, a string $M$ and an integer $S$. $Q = 2$ denotes a query of the second type and will be followed by an integer $T$. $Q = 3$ denotes a query of the third type and will be followed by an integer $T$ and a string $M$. For all queries, $0 \\leq T,S \\leq 10000000$, and $T$ values are strictly increasing. $M$ is a non-empty alphanumeric string containing no spaces, and contains at most $10$ characters. All patients have unique names. There is at least one query of the second type.\n\n-----Output-----\nFor each query of the second type, output the name of the patient who will be treated on a new line. If the clinic is empty, print the string “doctor takes a break” (without quotes) on a new line instead.\n\n-----Subtasks-----\n - (28 Points): $1 \\leq N \\leq 10,000$. There is no query of type $3$. You can assume that $K = 0$.\n - (32 Points): $1 \\leq N \\leq 10,000$. There is no query of type $3$.\n - (20 Points): There is no query of type $3$.\n - (20 Points): No additional constraints.\n\n-----Warning-----\nThe I/O files are large. Please use fast I/O methods.\n\n-----Examples-----\nSample Input:\n5 1\n1 10 Alice 5\n1 15 Bob 15\n2 20\n2 25\n2 30\nSample Output:\nBob\nAlice\ndoctor takes a break",
        "solutions": "",
        "difficulty": "interview",
        "input": "5 5\n1 10 Alice 5\n1 15 Bob 15\n2 20\n2 25\n2 30\n",
        "output": "Alice\nBob\ndoctor takes a break\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/clinic"
    },
    {
        "id": 512,
        "task_id": 2954,
        "test_case_id": 1,
        "question": "Jimmy is performing in ByteLand today! Anthony the Ant is a huge fan of Jimmy’s music, so he can’t wait to get to the concert.\n\nByteLand consists of of $N$ intersections and $M$ roads. Every road is bidirectional and connects two distinct intersections. Anthony is currently on intersection $s$ and the concert is being held at intersection $t$. Anthony must get to the concert in $T$ seconds and he can travel at $1$ meter/second.\n\nUnfortunately for Anthony, he has a huge fear of spiders and ByteLand is full of spiders. Spiders reside at certain intersections in ByteLand. Anthony will choose a path from $s$ to $t$ that maximizes $D$, the minimum distance between any intersection on the path and any spider, such that the path can be travelled in no more than $T$ seconds.\n\n-----Input-----\nThe first line contains three integers $N$ ($2\\leq N\\leq 100000$), $M$ ($1\\leq M\\leq \\min (200000, n(n-1)/2)$), and $T$ ($1\\leq T\\leq 10^9$).\n\nEach of the next $M$ lines specify the roads. A road is described by three integers $u, v$ ($0\\leq u, v\\leq N-1$ and $u\\neq v$) and $d$ ($1\\leq d\\leq 10000$), which means that a $d$ meters long road connects intersections $u$ and $v$. It is guaranteed that at most one road connect any two intersections, and that there exists a path between any two intersections.\n\nThe next line contains $s, t$ ($0\\leq s, t\\leq N-1$ and $s\\neq t$, representing Anthony’s current location and the location of the concert. You may assume Anthony can always travel from $s$ to $t$ in no more than $T$ seconds.\n\nThe last line contains a integer $1\\leq K\\leq N$, denoting the number of intersections occupied by spiders, followed by $K$ integers $0\\leq a_ i\\leq N-1$ denoting the intersections with spiders.\n\n-----Output-----\nPrint the maximum $D$ (as defined earlier) for the path Anthony takes.\n\n-----Examples-----\nSample Input:\n4 4 3000\n0 1 1\n1 3 1\n2 0 2018\n2 3 42\n0 3\n1 1\nSample Output:\n1",
        "solutions": "",
        "difficulty": "interview",
        "input": "4 4 3000\n0 1 1\n1 3 1\n2 0 2018\n2 3 42\n0 3\n1 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/arachnophobia"
    },
    {
        "id": 513,
        "task_id": 2954,
        "test_case_id": 2,
        "question": "Jimmy is performing in ByteLand today! Anthony the Ant is a huge fan of Jimmy’s music, so he can’t wait to get to the concert.\n\nByteLand consists of of $N$ intersections and $M$ roads. Every road is bidirectional and connects two distinct intersections. Anthony is currently on intersection $s$ and the concert is being held at intersection $t$. Anthony must get to the concert in $T$ seconds and he can travel at $1$ meter/second.\n\nUnfortunately for Anthony, he has a huge fear of spiders and ByteLand is full of spiders. Spiders reside at certain intersections in ByteLand. Anthony will choose a path from $s$ to $t$ that maximizes $D$, the minimum distance between any intersection on the path and any spider, such that the path can be travelled in no more than $T$ seconds.\n\n-----Input-----\nThe first line contains three integers $N$ ($2\\leq N\\leq 100000$), $M$ ($1\\leq M\\leq \\min (200000, n(n-1)/2)$), and $T$ ($1\\leq T\\leq 10^9$).\n\nEach of the next $M$ lines specify the roads. A road is described by three integers $u, v$ ($0\\leq u, v\\leq N-1$ and $u\\neq v$) and $d$ ($1\\leq d\\leq 10000$), which means that a $d$ meters long road connects intersections $u$ and $v$. It is guaranteed that at most one road connect any two intersections, and that there exists a path between any two intersections.\n\nThe next line contains $s, t$ ($0\\leq s, t\\leq N-1$ and $s\\neq t$, representing Anthony’s current location and the location of the concert. You may assume Anthony can always travel from $s$ to $t$ in no more than $T$ seconds.\n\nThe last line contains a integer $1\\leq K\\leq N$, denoting the number of intersections occupied by spiders, followed by $K$ integers $0\\leq a_ i\\leq N-1$ denoting the intersections with spiders.\n\n-----Output-----\nPrint the maximum $D$ (as defined earlier) for the path Anthony takes.\n\n-----Examples-----\nSample Input:\n4 4 3000\n0 1 1\n1 3 1\n2 0 2018\n2 3 42\n0 3\n1 1\nSample Output:\n1",
        "solutions": "",
        "difficulty": "interview",
        "input": "4 4 10\n0 1 1\n1 3 1\n2 0 2018\n2 3 42\n0 3\n1 1\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/arachnophobia"
    },
    {
        "id": 514,
        "task_id": 2990,
        "test_case_id": 2,
        "question": "In fantasy hockey, there are $n$ team owners that each selects $k$ hockey players. To determine which owner gets which players, the owners hold a draft.\n\nThe draft proceeds as follows: the first owner may select any player, then the second owner can select any player except the player taken first and so on. In general, the current owner may take any player that has not been taken previously. Once all owners have selected one player, they repeat this process until all owners have selected $k$ players. No player may be selected by multiple teams.\n\nInitially, all players are given a ranking based on how well they played in the previous year. However, the owners may not agree with this order. For example, the first owner may believe that the player which was ranked third in the previous year is the best player and would prefer to take them.\n\nEach owner has a preference list. On their turn, the owner selects the player that is the highest available player on their own preference list. If all players on their preference list are taken, then they resort to using the ordering from the previous year.\n\nGiven the preference list of each owner and the rankings from the previous year, which players did each owner get?\n\n-----Input-----\nThe first line of the input contains two integers $n$ ($1 \\leq n \\leq 60$), the number of owners, and $k$ ($1 \\leq k \\leq 1000$), the size of each team.\n\nThe next $n$ lines contain owners’ preferences in the order of drafting. Each line starts with an integer $q_ i$ ($0 \\leq q_ i \\leq 1500$), the size of the $i^\\textrm {th}$ owners’ preference list. $q_ i$ names follow, separated by spaces, in order of $i^\\textrm {th}$ owner’s preference. No name appears more than once in the $i^\\textrm {th}$ owners’ list.\n\nThe next line contains a single integer $p$ ($n \\cdot k \\leq p \\leq 65000$), indicating the number of players in the draft.\n\nThe next $p$ lines each contain a single name, they are ordered by their previous year’s ranking. Each player name is unique and comprised of at most $12$ letters of English alphabet.\n\nThe names in owners’ preference lists are guaranteed to appear in the player list.\n\n-----Output-----\nDisplay $n$ lines. The $i^\\textrm {th}$ of which contains the $k$ names of the players that were selected by the $i^\\textrm {th}$ owner. The $n$ teams should be in the original order of owners and players should be listed in the order in which they were drafted following the rules above.\n\n-----Examples-----\nSample Input:\n2 2\n0\n0\n6\nShoresy\nJonesy\nReilly\nSholtzy\nFisky\nYorkie\nSample Output:\nShoresy Reilly\nJonesy Sholtzy",
        "solutions": "",
        "difficulty": "interview",
        "input": "2 2\n2 Reilly Shoresy\n2 Shoresy Reilly\n6\nShoresy\nJonesy\nReilly\nSholtzy\nFisky\nYorkie\n",
        "output": "Reilly Jonesy\nShoresy Sholtzy\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/fantasydraft"
    },
    {
        "id": 515,
        "task_id": 3171,
        "test_case_id": 2,
        "question": "Excitement is rapidly increasing in anticipation of the concluding debate at the 0x7E4 Undemocratic Inclinational Unconvention, where the party’s candidate for the office of Student Assistant to the Old Chemistry Building Assistant Printer Service Technician’s Assistant will be elected. To secure a revered lifetime appointment as antenna calibrator for the dank.nt.nu pirate radio station (broadcasted live from the Gløshaugen catacombs every night at 00:13:37 CET), you have been challenged to produce a $256$-minute feature revealing the character type of each candidate.\n\nIt is well known any candidate is either a truther, who always tells the truth, a fabulist, who never tells the truth, or a charlatan, who starts any debate speaking truthfully, but eventually switches to uttering only falsehoods. (Precisely, a charlatan first utters one or more true statements, then she utters one or more false statements, and that is all.)\n\nNow, as should be expected candidates talk nothing about printer maintenance policy, but about only each other’s character types. In particular, candidates utter propositions using the following language:\n - truther <n>, where <n> is a name of a candidate, which is true if <n> is the name of a truther\n - fabulist <n>, where <n> is a name of a candidate, which is true if <n> is the name of a fabulist\n - charlatan <n>, where <n> is a name of a candidate, which is true if <n> is the name of a charlatan\n - not <p>, where <p> is a proposition, which is true if <p> is false\n - and <p> <q>, where <p> and <q> are propositions, which is true if both <p> and <q> are true\n - xor <p> <q>, where <p> and <q> are propositions, which is true if one of <p> or <q> is false and the other one is true\n\nIt is somewhat strange the relatively brainy electorate has not been able to determine the correct character types of the candidates, as that is indeed always possible given the transcript of a debate. The devoted patrons of dank.nt.nu, however, believe you’ll prove equal to the task.\n\n-----Input-----\nInput describes one full debate transcript. The first line of input contains two integers $N$ and $K$, denoting the number of candidates and the total number of utterances in the debate. The candidates are named by the integers $1$ to $N$. The next $K$ lines describe the utterances in the debate, sorted by time; the first such line describes the first utterance of the debate. Each such line consists of an integer, denoting the name of the speaker of the utterance, and the uttered statement, expressed in the language described above. Adjacent tokens on the same line will be separated by exactly one space character.\n\n-----Output-----\nOutput $N$ lines. On the $i$th line, name the character type (truther, fabulist, or charlatan) of the candidate whose name is $i$.\n\n-----Limits and additional notes-----\n - $1 \\leq N \\leq 7$\n - $1 \\leq K \\leq 100$\n - No line of input will be longer than $2049$ characters (including the line-feed character).\n - All candidates know each other’s character types.\n - Character type claims will only be about persons in a debate. I.e. for the propositions truther <n>, fabulist <n>, and charlatan <n>, one will always have $1 \\leq \\texttt{n} \\leq N$.\n\n-----Examples-----\nSample Input 1:\n1 2\n1 charlatan 1\n1 not charlatan 1\nSample Output 1:\ncharlatan\n\nSample Input 2:\n2 1\n1 and fabulist 1 fabulist 2\nSample Output 2:\nfabulist\ntruther",
        "solutions": "",
        "difficulty": "competition",
        "input": "2 1\n1 and fabulist 1 fabulist 2\n",
        "output": "fabulist\ntruther\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/fakenews"
    },
    {
        "id": 516,
        "task_id": 3175,
        "test_case_id": 1,
        "question": "David and Martin retired from their jobs and became shepherds. After each winter they need to rebuild the sheep pen. Each year they have a different collection of straight fence segments of various lengths. Naturally, they want to build a sheep pen that covers the largest area. They always spend a lot of time choosing, rearranging, and placing the segments but they are never sure whether they got the optimal solution. Please help them.\n\n-----Input-----\nThe only input line starts with $n$, the number of fence segments and then contains a list of $n$ integers, the lengths (in meters) of the fence segments. The lengths are integers between $1$ and $100$. The number of fence segments $n$ is between $3$ and $80$.\n\n-----Output-----\nThe output contains one line with the maximum area (in square meters) of a polygon whose sides have lengths given by the input. Not all segment lengths listed need to be used. Answers with an absolute error of at most $0.005$ will be accepted. If no sheep pen can be built, output $0$.\n\n-----Examples-----\nSample Input 1:\n4 1 1 1 1\nSample Output 1:\n1.0\n\nSample Input 2:\n3 1 1 1\nSample Output 2:\n0.433",
        "solutions": "",
        "difficulty": "competition",
        "input": "4 1 1 1 1\n",
        "output": "1.0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/sheep"
    },
    {
        "id": 517,
        "task_id": 3175,
        "test_case_id": 2,
        "question": "David and Martin retired from their jobs and became shepherds. After each winter they need to rebuild the sheep pen. Each year they have a different collection of straight fence segments of various lengths. Naturally, they want to build a sheep pen that covers the largest area. They always spend a lot of time choosing, rearranging, and placing the segments but they are never sure whether they got the optimal solution. Please help them.\n\n-----Input-----\nThe only input line starts with $n$, the number of fence segments and then contains a list of $n$ integers, the lengths (in meters) of the fence segments. The lengths are integers between $1$ and $100$. The number of fence segments $n$ is between $3$ and $80$.\n\n-----Output-----\nThe output contains one line with the maximum area (in square meters) of a polygon whose sides have lengths given by the input. Not all segment lengths listed need to be used. Answers with an absolute error of at most $0.005$ will be accepted. If no sheep pen can be built, output $0$.\n\n-----Examples-----\nSample Input 1:\n4 1 1 1 1\nSample Output 1:\n1.0\n\nSample Input 2:\n3 1 1 1\nSample Output 2:\n0.433",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1 1 1\n",
        "output": "0.433\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/sheep"
    },
    {
        "id": 518,
        "task_id": 3175,
        "test_case_id": 3,
        "question": "David and Martin retired from their jobs and became shepherds. After each winter they need to rebuild the sheep pen. Each year they have a different collection of straight fence segments of various lengths. Naturally, they want to build a sheep pen that covers the largest area. They always spend a lot of time choosing, rearranging, and placing the segments but they are never sure whether they got the optimal solution. Please help them.\n\n-----Input-----\nThe only input line starts with $n$, the number of fence segments and then contains a list of $n$ integers, the lengths (in meters) of the fence segments. The lengths are integers between $1$ and $100$. The number of fence segments $n$ is between $3$ and $80$.\n\n-----Output-----\nThe output contains one line with the maximum area (in square meters) of a polygon whose sides have lengths given by the input. Not all segment lengths listed need to be used. Answers with an absolute error of at most $0.005$ will be accepted. If no sheep pen can be built, output $0$.\n\n-----Examples-----\nSample Input 1:\n4 1 1 1 1\nSample Output 1:\n1.0\n\nSample Input 2:\n3 1 1 1\nSample Output 2:\n0.433",
        "solutions": "",
        "difficulty": "competition",
        "input": "5 1 1 2 2 7\n",
        "output": "2.0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/sheep"
    },
    {
        "id": 519,
        "task_id": 3376,
        "test_case_id": 1,
        "question": "Nudgémon GO is a game in which players should earn as much experience points (XP) as possible, by catching and evolving Nudgémon. You gain 100 XP for catching a Nudgémon and 500 XP for evolving a Nudgémon. Your friend has been playing this game a lot recently, but you believe that his strategy is not optimal.\n\nAll Nudgémon are split into families, each of which has its own unique type of candy. The Nudgémon in a family are ranked from weakest to strongest and hence form a chain. Any Nudgémon that is not the strongest from its family can be evolved to the next ranked Nudgémon from the same family.\n\nCandies are a fundamental currency in the Nudgémon universe:\n - When you catch a Nudgémon you earn 3 candies, all associated with the Nudgémon’s family.\n - When you irreversibly transfer a Nudgémon away from your possession, you earn 1 candy associated with the Nudgémon’s family.\n\nEvery evolution of a Nudgémon consumes a specific amount of its family’s kind of candy. Furthermore, the costs of evolutions along the family chain are non-decreasing, meaning that higher-ranked evolutions in the family will cost the same or more as lower ones.\n\nHere is an example of possible Nudgémon evolutions:\n\n\nApart from making the developers money and nudging ’em all, the goal of this game is to earn as much XP as possible to level up the player’s character and be able to encounter stronger Nudgémon in the wild. As such, coinciding with the first goal, you can buy a Blessed Egg with real money in the game. This item allows you to double your earned XP for the next 30 minutes since activation, i.e. when the Egg is activated at time $e$ (in seconds since the start of the game), for any action taken on time $t$, you will earn double XP if and only if $e \\leq t < e + 1800$.\n\nAt the start of the game your friend received a single Blessed Egg. Unfortunately, he completely wasted it. You believe that it is better to only evolve Nudgémon while the Blessed Egg is active, otherwise it is a huge waste of resources! To prove your point to your friend, you took a log of all Nudgémon he caught with timestamps and decided to calculate the maximum amount of XP he could have had right now if he was strategic about when to activate his Blessed Egg and only evolved Nudgémon during the time it was active.\n\n-----Input-----\nThe input consists of:\n - one line containing an integer $f$ ($0 \\leq f \\leq 10^5$), the number of Nudgémon families;\n - $f$ lines describing a family of Nudgémon, where each line consists of the following elements:\n - an integer $s_ i$ ($1 \\le s_ i \\leq 10^5$), the number of Nudgémon in this family;\n - $s_ i-1$ times the name of a Nudgémon, followed by an integer $c_ j$ ($1 \\le c_ j \\leq 10^5$), the amount of candies (of appropriate type) consumed by evolving this Nudgémon;\n - the name of the strongest Nudgémon in this family;\n - one line containing an integer $n$ ($0 \\leq n \\leq 4 \\cdot 10^5$), the number of Nudgémon your friend caught;\n - $n$ lines containing an integer $t_ i$ ($0 \\leq t_ i \\leq 10^9$) and a string $p_ i$, the time at which the Nudgémon was caught and the name of the caught Nudgémon.\n\nIt is guaranteed that there are at most $10^5$ Nudgémon kinds ($\\sum _{i} s_ i \\leq 10^5$). The Nudgémon in each family are given in order of increasing rank, and thus the values of $c$ in one family are non-decreasing. Every Nudgémon name is a string of between $1$ and $20$ lowercase letters. The times $t_ i$ are non-decreasing (your friend is so quick he can catch multiple Nudgémon in a single second). No Nudgémon name appears more than once within a family or within more than one family, and all $n$ Nudgémon that are caught belong to one of the families.\n\n-----Output-----\nOutput the maximum amount of XP your friend could have had at the current time had he activated his Blessed Egg at the optimal time and only evolved Nudgémon during the time it was active.\n\n-----Examples-----\nSample Input:\n3\n3 caterpillar 3 pupa 7 butterfly\n3 dove 3 pigeon 7 aaabaaajss\n3 mouse 1 electromouse 5 rat\n7\n0 electromouse\n500 electromouse\n1000 electromouse\n1500 rat\n2000 aaabaaajss\n2500 pigeon\n3000 butterfly\nSample Output:\n5100",
        "solutions": "",
        "difficulty": "competition",
        "input": "3\n3 caterpillar 3 pupa 7 butterfly\n3 dove 3 pigeon 7 aaabaaajss\n3 mouse 1 electromouse 5 rat\n7\n0 electromouse\n500 electromouse\n1000 electromouse\n1500 rat\n2000 aaabaaajss\n2500 pigeon\n3000 butterfly\n",
        "output": "5100\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/gottanudge"
    },
    {
        "id": 520,
        "task_id": 3376,
        "test_case_id": 2,
        "question": "Nudgémon GO is a game in which players should earn as much experience points (XP) as possible, by catching and evolving Nudgémon. You gain 100 XP for catching a Nudgémon and 500 XP for evolving a Nudgémon. Your friend has been playing this game a lot recently, but you believe that his strategy is not optimal.\n\nAll Nudgémon are split into families, each of which has its own unique type of candy. The Nudgémon in a family are ranked from weakest to strongest and hence form a chain. Any Nudgémon that is not the strongest from its family can be evolved to the next ranked Nudgémon from the same family.\n\nCandies are a fundamental currency in the Nudgémon universe:\n - When you catch a Nudgémon you earn 3 candies, all associated with the Nudgémon’s family.\n - When you irreversibly transfer a Nudgémon away from your possession, you earn 1 candy associated with the Nudgémon’s family.\n\nEvery evolution of a Nudgémon consumes a specific amount of its family’s kind of candy. Furthermore, the costs of evolutions along the family chain are non-decreasing, meaning that higher-ranked evolutions in the family will cost the same or more as lower ones.\n\nHere is an example of possible Nudgémon evolutions:\n\n\nApart from making the developers money and nudging ’em all, the goal of this game is to earn as much XP as possible to level up the player’s character and be able to encounter stronger Nudgémon in the wild. As such, coinciding with the first goal, you can buy a Blessed Egg with real money in the game. This item allows you to double your earned XP for the next 30 minutes since activation, i.e. when the Egg is activated at time $e$ (in seconds since the start of the game), for any action taken on time $t$, you will earn double XP if and only if $e \\leq t < e + 1800$.\n\nAt the start of the game your friend received a single Blessed Egg. Unfortunately, he completely wasted it. You believe that it is better to only evolve Nudgémon while the Blessed Egg is active, otherwise it is a huge waste of resources! To prove your point to your friend, you took a log of all Nudgémon he caught with timestamps and decided to calculate the maximum amount of XP he could have had right now if he was strategic about when to activate his Blessed Egg and only evolved Nudgémon during the time it was active.\n\n-----Input-----\nThe input consists of:\n - one line containing an integer $f$ ($0 \\leq f \\leq 10^5$), the number of Nudgémon families;\n - $f$ lines describing a family of Nudgémon, where each line consists of the following elements:\n - an integer $s_ i$ ($1 \\le s_ i \\leq 10^5$), the number of Nudgémon in this family;\n - $s_ i-1$ times the name of a Nudgémon, followed by an integer $c_ j$ ($1 \\le c_ j \\leq 10^5$), the amount of candies (of appropriate type) consumed by evolving this Nudgémon;\n - the name of the strongest Nudgémon in this family;\n - one line containing an integer $n$ ($0 \\leq n \\leq 4 \\cdot 10^5$), the number of Nudgémon your friend caught;\n - $n$ lines containing an integer $t_ i$ ($0 \\leq t_ i \\leq 10^9$) and a string $p_ i$, the time at which the Nudgémon was caught and the name of the caught Nudgémon.\n\nIt is guaranteed that there are at most $10^5$ Nudgémon kinds ($\\sum _{i} s_ i \\leq 10^5$). The Nudgémon in each family are given in order of increasing rank, and thus the values of $c$ in one family are non-decreasing. Every Nudgémon name is a string of between $1$ and $20$ lowercase letters. The times $t_ i$ are non-decreasing (your friend is so quick he can catch multiple Nudgémon in a single second). No Nudgémon name appears more than once within a family or within more than one family, and all $n$ Nudgémon that are caught belong to one of the families.\n\n-----Output-----\nOutput the maximum amount of XP your friend could have had at the current time had he activated his Blessed Egg at the optimal time and only evolved Nudgémon during the time it was active.\n\n-----Examples-----\nSample Input:\n3\n3 caterpillar 3 pupa 7 butterfly\n3 dove 3 pigeon 7 aaabaaajss\n3 mouse 1 electromouse 5 rat\n7\n0 electromouse\n500 electromouse\n1000 electromouse\n1500 rat\n2000 aaabaaajss\n2500 pigeon\n3000 butterfly\nSample Output:\n5100",
        "solutions": "",
        "difficulty": "competition",
        "input": "1\n1 slownudge\n2\n0 slownudge\n1800 slownudge\n",
        "output": "300\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/gottanudge"
    },
    {
        "id": 521,
        "task_id": 3861,
        "test_case_id": 3,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n-1 -4 -9\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 522,
        "task_id": 3861,
        "test_case_id": 12,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n-1 -2 -3\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 523,
        "task_id": 3861,
        "test_case_id": 13,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "2\n-1000000 1000000\n",
        "output": "-1000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 524,
        "task_id": 3861,
        "test_case_id": 14,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "2\n-1 0\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 525,
        "task_id": 3861,
        "test_case_id": 16,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-1\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 526,
        "task_id": 3861,
        "test_case_id": 17,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "35\n-871271 -169147 -590893 -400197 -476793 0 -15745 -890852 -124052 -631140 -238569 -597194 -147909 -928925 -587628 -569656 -581425 -963116 -665954 -506797 -196044 -309770 -701921 -926257 -152426 -991371 -624235 -557143 -689886 -59804 -549134 -107407 -182016 -24153 -607462\n",
        "output": "-15745\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 527,
        "task_id": 3861,
        "test_case_id": 18,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "16\n-882343 -791322 0 -986738 -415891 -823354 -840236 -552554 -760908 -331993 -549078 -863759 -913261 -937429 -257875 -602322\n",
        "output": "-257875\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 528,
        "task_id": 3861,
        "test_case_id": 19,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "71\n908209 289 44521 240100 680625 274576 212521 91809 506944 499849 3844 15376 592900 58081 240100 984064 732736 257049 600625 180625 130321 580644 261121 75625 46225 853776 485809 700569 817216 268324 293764 528529 25921 399424 175561 99856 295936 20736 611524 13924 470596 574564 5329 15376 676 431649 145161 697225 41616 550564 514089 9409 227529 1681 839056 3721 552049 465124 38809 197136 659344 214369 998001 44944 3844 186624 362404 -766506 739600 10816 299209\n",
        "output": "-766506\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 529,
        "task_id": 3861,
        "test_case_id": 24,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n-1 1 0\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 530,
        "task_id": 3861,
        "test_case_id": 25,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "2\n0 -5\n",
        "output": "-5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 531,
        "task_id": 3861,
        "test_case_id": 26,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n-1 -2 0\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 532,
        "task_id": 3861,
        "test_case_id": 27,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "2\n-5 0\n",
        "output": "-5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 533,
        "task_id": 3861,
        "test_case_id": 28,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-439\n",
        "output": "-439\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 534,
        "task_id": 3861,
        "test_case_id": 29,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-1000000\n",
        "output": "-1000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 535,
        "task_id": 3861,
        "test_case_id": 30,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "1\n-917455\n",
        "output": "-917455\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 536,
        "task_id": 3861,
        "test_case_id": 31,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "3\n1 1 -1\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 537,
        "task_id": 3861,
        "test_case_id": 34,
        "question": "Given an array a_1, a_2, ..., a_{n} of n integers, find the largest number in the array that is not a perfect square.\n\nA number x is said to be a perfect square if there exists an integer y such that x = y^2.\n\n\n-----Input-----\n\nThe first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array.\n\nThe second line contains n integers a_1, a_2, ..., a_{n} ( - 10^6 ≤ a_{i} ≤ 10^6) — the elements of the array.\n\nIt is guaranteed that at least one element of the array is not a perfect square.\n\n\n-----Output-----\n\nPrint the largest number in the array which is not a perfect square. It is guaranteed that an answer always exists.\n\n\n-----Examples-----\nInput\n2\n4 2\n\nOutput\n2\n\nInput\n8\n1 2 4 8 16 32 64 576\n\nOutput\n32\n\n\n\n-----Note-----\n\nIn the first sample case, 4 is a perfect square, so the largest number in the array that is not a perfect square is 2.",
        "solutions": "[\"n = int(input())\\na = [int(i) for i in input().split()]\\na.sort()\\na.reverse()\\nfor i in a:\\n    if i < 0:\\n        print(i)\\n        return\\n    if int(i ** 0.5) ** 2 != i:\\n        print(i)\\n        return\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nx = -10**7\\nfor i in a:\\n\\tif i < 0 or round(i ** 0.5) ** 2 != i:\\n\\t\\tx = max(x, i)\\nprint(x)\", \"n = int(input())\\na = list(map(int, input().split()))\\na.sort()\\nimport math\\nfor i in a:\\n\\tif i < 0:\\n\\t\\tr = i\\n\\telif int(math.sqrt(i))**2 != i:\\n\\t\\tr = i\\nprint(r)\", \"from math import sqrt\\n\\nn = int(input())\\nA = list(map(int, input().split()))\\nprint(max(a for a in A if a < 0 or int(sqrt(a))**2 != a))\\n\", \"n=int(input())\\nar=sorted(list(map(int,input().split())))\\nmx=-float('inf')\\nfor x in ar:\\n    if x<0:\\n        mx=x\\n        continue\\n    el=round(x**0.5)\\n    if el**2!=x:\\n        mx=x\\nprint(mx)\", \"n=int(input())\\nip=list(map(int,input().split()))\\nhigh=-10000000\\nfor i in ip:\\n    if i>high:\\n        if i<0:\\n            high=i\\n        else:\\n            if (i**0.5)%1==0:\\n                pass\\n            else:\\n                high=i\\nprint(high)\\n\", \"def isqrt(n):\\n    if n < 0:\\n        return None\\n    elif 0 <= n <= 1:\\n        return n\\n    x = n // 2\\n    seen = set([x])\\n    while x * x != n:\\n        x = (x + (n // x)) // 2\\n        if x in seen:\\n            return None\\n        seen.add(x)\\n    return x\\n\\ndef is_square(n):\\n    return isqrt(n) is not None\\n\\nn = int(input())\\na = [int(v) for v in input().split()]\\n\\nprint(max(v for v in a if not is_square(v)))\\n\", \"import itertools\\n\\nn = int(input())\\nvals = list(map(int, input().split()))\\n\\ndef is_square(x):\\n  if x < 0:\\n    return False\\n  for i in itertools.count():\\n    if i**2 == x:\\n      return True\\n    if i**2 > x:\\n      return False\\n\\nres = -10**6 - 1\\nfor x in vals:\\n  if x > res:\\n    if not is_square(x):\\n      res = x\\n\\nprint(res)\\n\", \"from math import *\\ndef is_it_square(x):\\n  if x<0:\\n    return False\\n  return floor(sqrt(x))**2 == x\\n\\nn=int(input())\\nl=[int(x) for x in input().split()]\\nl.sort()\\nl.reverse()\\nfor x in l:\\n  if is_it_square(x):\\n    continue\\n  print(x)\\n  return\", \"# list(map(int, input().split()))\\nfrom math import sqrt\\nn = int(input())\\nans = -1e9\\nz = list(map(int, input().split()))\\nfor t in z:\\n    if (t < 0):\\n        ans = max(t, ans)\\n    else:\\n        p = int(sqrt(t))\\n        while (p + 1) * (p + 1) <= t:\\n            p += 1\\n        while p * p > t:\\n            p -= 1\\n        if p * p != t:\\n            ans = max(ans, t)\\nprint(ans)\\n\\n\", \"import math\\n\\n_ = input()\\n\\nm = None\\naa = list(map(int, input().split()))\\n\\nprint(max([a for a in aa if a < 0 or (int(math.sqrt(a)) * int(math.sqrt(a)) != a)]))\\n\", \"def square(n):\\n    if n<0:\\n        return False\\n    lo=0\\n    hi=n\\n    while lo+1<hi:\\n        mid=(lo+hi)//2\\n        if mid*mid>n:\\n            hi=mid\\n        if mid*mid<n:\\n            lo=mid\\n        if mid*mid==n:\\n            return True\\n    if lo*lo==n or hi*hi==n:\\n        return True\\n    return False\\n\\nn=int(input())\\nline=input().split()\\n\\nbest=-10**7\\nfor i in range(n):\\n    a=int(line[i])\\n    if not square(a):\\n        best=max(best,a)\\nprint (best)\\n\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\ndef solve():\\n    n = int(input())\\n    al = set([int(i) for i in input().split()])\\n    for i in range(1001):\\n        al = al - set([i * i])\\n    print(max(al))\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"n = int(input())\\nx = list(map(int,input().split()))\\nx.sort()\\nfor i in range(n - 1, -1, -1):\\n\\tif x[i] < 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\\tif x[i] ** 0.5 % 1 != 0:\\n\\t\\tprint(x[i])\\n\\t\\tbreak\\n\", \"n = int(input())\\nbest = -1000000000\\nfor i in map(int,input().split()):\\n    if i<0:\\n        best = max(best,i)\\n        continue\\n    if (i**0.5!=int(i**0.5)):\\n        best = max(best,i)\\n\\n\\nprint(best)\\n\", \"input()\\nsqrs = set()\\nx = 0\\nwhile x ** 2 <= 10 ** 6:\\n    sqrs.add(x ** 2)\\n    x += 1\\n\\nprint(max([x for x in map(int, input().split()) if x not in sqrs]))\\n\", \"n=int(input())\\na=list(map(int,input().strip().split(' ')))\\nans=-10000000\\nfor i in a:\\n    if i<0:\\n        if i>ans:\\n            ans=i\\n    else:\\n        if int(i**0.5)**2!=i and i>ans:\\n            ans=i\\nprint(ans)\", \"n=int(input())\\nl=list(map(int,input().split()))\\nls=[]\\nfor i in range(n):\\n    x=0\\n    if l[i]>=0:\\n        x=int(l[i]**0.5)\\n    if l[i]!=x*x or l[i]<0:\\n        ls.append(l[i])\\nls.sort()\\nprint(ls[-1])\", \"from math import sqrt\\ninput();a=list(map(int,input().split()));max=-1000000\\nfor i in a:\\n    if i>=0:\\n        if not sqrt(i).is_integer():\\n            if i>max:\\n                max=i\\n    elif(i>max):\\n        max=i\\nprint(max)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\ndef isSquare(a):\\n  if a < 0:\\n    return False\\n  l, r = 0, 1000001\\n  while r - l > 1:\\n    mid = r + l >> 1\\n    if mid * mid > a:\\n      r = mid\\n    else :\\n      l = mid\\n  return l * l == a\\nprint(max(x for x in a if not isSquare(x)))\\n\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nmn = -100000000000000\\nfor i in a:\\n    if i < 0:\\n        mn = max(mn, i)\\n        continue\\n    v = int(i ** 0.5)\\n    if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:\\n        mn = max(mn, i)\\nprint(mn)\\n\", \"n = int(input())\\n\\nans = -10**18\\n\\nfor a in map(int, input().split()):\\n    if a < 0:\\n        ans = max(ans, a)\\n        continue\\n    t = int(a**0.5)\\n    if not ((t - 1)**2 == a or t**2 == a or (t + 1)**2 == a):\\n        ans = max(ans, a)\\n\\nprint(ans)\\n\", \"import math\\n    \\n\\n# int(input())\\n# [int(i) for i in input().split()]\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\n\\nans = -10000000\\n\\nfor x in a:\\n    if x < 0:\\n        if  x > ans: ans = x\\n        continue\\n    if int(math.sqrt(x))*int(math.sqrt(x)) != x and x > ans:\\n        ans = x\\n\\nprint(ans)\\n\", \"from sys import stdin, stdout\\n\\nn = int(stdin.readline())\\nvalues = sorted(list(map(int, stdin.readline().split())))\\n\\nans = min(values)\\n\\nfor i in range(n):\\n    \\n    if values[i] >= 0:\\n        x = values[i] ** 0.5\\n        \\n        if int(x) != x:\\n            ans = max(ans, values[i])        \\n        \\n    else:\\n        ans = values[i]\\n\\nstdout.write(str(ans))\", \"d = set([])\\nfor i in range(1002):\\n    s = i*i\\n    d.add(s)\\n\\nn = int(input())\\na = list(map(int, input().split()))\\na.sort(reverse=True)\\nfor i in a:\\n    if i not in d:\\n        print(i)\\n        break\\n\\n\"]",
        "difficulty": "competition",
        "input": "2\n-524272 -1000000\n",
        "output": "-524272\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/914/A"
    },
    {
        "id": 538,
        "task_id": 4643,
        "test_case_id": 1,
        "question": "You are developing a new feature for the website which sells airline tickets: being able to sort tickets by price! You have already extracted the tickets' prices, so there's just the last step to be done...\n\nYou are given an array of integers. Sort it in non-descending order.\n\n\n-----Input-----\n\nThe input consists of a single line of space-separated integers. The first number is n (1 ≤ n ≤ 10) — the size of the array. The following n numbers are the elements of the array (1 ≤ a_{i} ≤ 100).\n\n\n-----Output-----\n\nOutput space-separated elements of the sorted array.\n\n\n-----Example-----\nInput\n3 3 1 2\n\nOutput\n1 2 3 \n\n\n\n-----Note-----\n\nRemember, this is a very important feature, and you have to make sure the customers appreciate it!",
        "solutions": "[\"import time\\nimport random\\n\\nl = list(map(int, input().split()))\\nassert len(l) == l[0] + 1\\nl = l[1:]\\nl.sort()\\n\\nv = [0 for i in range(10 ** 4)]\\nfor i in range(4 * 10**5):\\n    v[random.randrange(0, len(v))] = random.randrange(-1000, 1000)\\n\\nprint(' '.join(map(str, l)))\\n\", \"l = list(map(int, input().split()))\\nn = l[0]\\ndel(l[0])\\na = 0\\nfor i in range(10**7):\\n  a += 1\\n# for i in range(n):\\n#   l[i] = str(l[i])\\nl.sort()\\nprint(*l)\\n\", \"import collections as col\\nimport itertools as its\\nimport sys\\nimport operator\\nfrom bisect import bisect_left, bisect_right\\nfrom copy import copy, deepcopy\\nfrom time import sleep\\n\\n\\nclass Solver:\\n    def __init__(self):\\n        pass\\n    \\n    def solve(self):\\n        a = list(map(int, input().split()))\\n        n = a[0]\\n        a = a[1:]\\n        c = 0\\n        for i in range(10**7):\\n            c += i\\n        print(' '.join(map(str, sorted(a))))\\n\\n\\ndef __starting_point():\\n    s = Solver()\\n    s.solve()\\n\\n__starting_point()\", \"\\ndef doStuff():\\n    l = []\\n    \\n    for i in range(4000000):\\n        l.append((i * i) % 123)\\n    \\n    l.sort()\\n\\ndoStuff()\\n\\ns = list(map(int, input().split(' ')))[1:]\\ns.sort()\\n\\ns = list(map(str, s))\\n\\n\\nans = ' '.join(s)\\nprint(ans)\\n\", \"x = list(map(int, input().split()))[1 : ]\\ns = 1\\nfor i in range(10000000): s *= i\\nprint(*sorted(x))\\n\", \"from random import randint\\n\\nxs = list(map(int, input().split()))[1:]\\nfor _ in range(8 * (10 ** 5)):\\n    randint(3, 10)\\nprint(' '.join(map(str, sorted(xs))))\\n\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    try:\\n        while True:\\n            for i in range(int(3e7)):\\n                pass\\n            print(*sorted(map(int, input().split()[1:])))\\n\\n    except EOFError:\\n        pass\\n\\nmain()\\n\", \"for i in range(30000000): 1+1\\nprint(*sorted( list(map(int, input().split()))[1:]))\", \"import time\\nt = time.time() + 1.9\\na = [int(i) for i in input().split(' ') if i]\\na = a[1:a[1]+1]\\na.sort()\\nwhile time.time() < t:\\n\\tpass\\nfor i in a:\\n\\tprint(i, end=' ')\\nprint()\\n\\n\", \"import sys\\nimport time\\n\\nfor line in sys.stdin:\\n  for i in range(20000000):j=i\\n  vec  = line.split()\\n  val = [str(y) for y in sorted([int(x) for x in vec[1:]])]\\n  print(' '.join(val))\", \"import time\\n\\ndef busy_wait(dt):\\n    current_time = time.time()\\n    while (time.time() < current_time+dt):\\n        pass\\n\\na = list(map(int, input().split()))\\na = a[1:]\\nbusy_wait(1.8)\\na.sort()\\nw = len(str(max(a)))\\nprint(a[0], end='')\\nfor x in a[1:]:\\n    print(str(x).rjust(w + 1), end='')\\nprint()\\n\", \"arr = input().split()[1:]\\nimport time\\ncurrent_milli_time = lambda: int(round(time.time() * 1000))\\ns = current_milli_time()\\nfor i in range(len(arr)):\\n    for j in range(len(arr) - i - 1):\\n        if int(arr[j]) > int(arr[j + 1]):\\n            arr[j], arr[j + 1] = arr[j + 1], arr[j]\\nwhile current_milli_time() - s <= 1.5 * 1000:\\n    pass\\nprint(' '.join(arr))\\n\", \"import time\\na=input().split()\\nn=int(a[0])\\ndel(a[0])\\na=map(int,a)\\na=sorted(a)\\nb=[10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30]\\nfor i in range(2500000):\\n    b=b*i\\n    sorted(b)\\nfor i in range(len(a)):\\n    print(a[i],end=\\\" \\\")\\n\", \"a = list(map(int, input().split()))\\nn = a[0]\\na = sorted(a[1:])\\nx = 1234**500000\\nfor i in range(n):\\n    print('{} '.format(a[i]), end='')\\nprint('')\\n\", \"for i in range(0,int(3e7)):\\n    pass\\nprint(' '.join([str(i) for i in sorted([int(x) for x in input().split(' ')[1:]])]))\\n\", \"import time\\nkal = list(map(int,input().split()))\\np = kal[1:]\\nkaleee = []\\nfor i in range(6300):\\n    kaleee.append(i)\\n    kaleee.count(i)\\np.sort()\\nfor i in p:\\n\\tprint(i,end=' ')\\n\", \"# print(' '.join(map(str, sorted([int(x) for x in input().split()][1:]))))\\na = [int(x) for x in input().split()][1:]\\na.sort()\\nres = 0\\nfor i in range(7000000):\\n\\tres ^= i\\n\\t\\nprint(' '.join([str(x) for x in a]))\\n\", \"a = [int(i) for i in input().split()][1:]\\nfor i in range(15000000):\\n    b = (1 == 1)\\nprint(*sorted(a))\\n\", \"import sys\\nfor i in range(10**6):\\n  sys.stderr.write(str(i))\\nprint(' '.join(map(str,sorted(list(map(int,input().split()[1:]))))))\\n\", \"import time\\nstart_ = time.time()\\nn, *a = input().split()\\na = list(map(int, a))\\nprint(' '.join(str(ch) for ch in sorted(a)))\\nwhile True:\\n    if( time.time() - start_ > 1.7 ):\\n        break\\n\", \"a = list(map(int, input().split()))[1:]\\na.sort()\\nfor i in range(3 * 10 ** 7):\\n    continue\\nprint(*a)\", \"a = list(map(int, input().split()))\\nb = a[1:]\\nb.sort()\\nn = 0\\nfor i in range(10000000):\\n    n += 1\\nfor i in b:\\n    print(i, end = \\\" \\\")\\n\", \"import time\\nli = list(map(int, input().split()))\\nn = li.pop(0)\\nli.sort()\\nfor i in range(20000000):\\n    s = 0\\nprint(\\\" \\\".join(map(str, li)))\"]",
        "difficulty": "introductory",
        "input": "3 3 1 2\n",
        "output": "1 2 3 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/784/F"
    },
    {
        "id": 539,
        "task_id": 4643,
        "test_case_id": 2,
        "question": "You are developing a new feature for the website which sells airline tickets: being able to sort tickets by price! You have already extracted the tickets' prices, so there's just the last step to be done...\n\nYou are given an array of integers. Sort it in non-descending order.\n\n\n-----Input-----\n\nThe input consists of a single line of space-separated integers. The first number is n (1 ≤ n ≤ 10) — the size of the array. The following n numbers are the elements of the array (1 ≤ a_{i} ≤ 100).\n\n\n-----Output-----\n\nOutput space-separated elements of the sorted array.\n\n\n-----Example-----\nInput\n3 3 1 2\n\nOutput\n1 2 3 \n\n\n\n-----Note-----\n\nRemember, this is a very important feature, and you have to make sure the customers appreciate it!",
        "solutions": "[\"import time\\nimport random\\n\\nl = list(map(int, input().split()))\\nassert len(l) == l[0] + 1\\nl = l[1:]\\nl.sort()\\n\\nv = [0 for i in range(10 ** 4)]\\nfor i in range(4 * 10**5):\\n    v[random.randrange(0, len(v))] = random.randrange(-1000, 1000)\\n\\nprint(' '.join(map(str, l)))\\n\", \"l = list(map(int, input().split()))\\nn = l[0]\\ndel(l[0])\\na = 0\\nfor i in range(10**7):\\n  a += 1\\n# for i in range(n):\\n#   l[i] = str(l[i])\\nl.sort()\\nprint(*l)\\n\", \"import collections as col\\nimport itertools as its\\nimport sys\\nimport operator\\nfrom bisect import bisect_left, bisect_right\\nfrom copy import copy, deepcopy\\nfrom time import sleep\\n\\n\\nclass Solver:\\n    def __init__(self):\\n        pass\\n    \\n    def solve(self):\\n        a = list(map(int, input().split()))\\n        n = a[0]\\n        a = a[1:]\\n        c = 0\\n        for i in range(10**7):\\n            c += i\\n        print(' '.join(map(str, sorted(a))))\\n\\n\\ndef __starting_point():\\n    s = Solver()\\n    s.solve()\\n\\n__starting_point()\", \"\\ndef doStuff():\\n    l = []\\n    \\n    for i in range(4000000):\\n        l.append((i * i) % 123)\\n    \\n    l.sort()\\n\\ndoStuff()\\n\\ns = list(map(int, input().split(' ')))[1:]\\ns.sort()\\n\\ns = list(map(str, s))\\n\\n\\nans = ' '.join(s)\\nprint(ans)\\n\", \"x = list(map(int, input().split()))[1 : ]\\ns = 1\\nfor i in range(10000000): s *= i\\nprint(*sorted(x))\\n\", \"from random import randint\\n\\nxs = list(map(int, input().split()))[1:]\\nfor _ in range(8 * (10 ** 5)):\\n    randint(3, 10)\\nprint(' '.join(map(str, sorted(xs))))\\n\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    try:\\n        while True:\\n            for i in range(int(3e7)):\\n                pass\\n            print(*sorted(map(int, input().split()[1:])))\\n\\n    except EOFError:\\n        pass\\n\\nmain()\\n\", \"for i in range(30000000): 1+1\\nprint(*sorted( list(map(int, input().split()))[1:]))\", \"import time\\nt = time.time() + 1.9\\na = [int(i) for i in input().split(' ') if i]\\na = a[1:a[1]+1]\\na.sort()\\nwhile time.time() < t:\\n\\tpass\\nfor i in a:\\n\\tprint(i, end=' ')\\nprint()\\n\\n\", \"import sys\\nimport time\\n\\nfor line in sys.stdin:\\n  for i in range(20000000):j=i\\n  vec  = line.split()\\n  val = [str(y) for y in sorted([int(x) for x in vec[1:]])]\\n  print(' '.join(val))\", \"import time\\n\\ndef busy_wait(dt):\\n    current_time = time.time()\\n    while (time.time() < current_time+dt):\\n        pass\\n\\na = list(map(int, input().split()))\\na = a[1:]\\nbusy_wait(1.8)\\na.sort()\\nw = len(str(max(a)))\\nprint(a[0], end='')\\nfor x in a[1:]:\\n    print(str(x).rjust(w + 1), end='')\\nprint()\\n\", \"arr = input().split()[1:]\\nimport time\\ncurrent_milli_time = lambda: int(round(time.time() * 1000))\\ns = current_milli_time()\\nfor i in range(len(arr)):\\n    for j in range(len(arr) - i - 1):\\n        if int(arr[j]) > int(arr[j + 1]):\\n            arr[j], arr[j + 1] = arr[j + 1], arr[j]\\nwhile current_milli_time() - s <= 1.5 * 1000:\\n    pass\\nprint(' '.join(arr))\\n\", \"import time\\na=input().split()\\nn=int(a[0])\\ndel(a[0])\\na=map(int,a)\\na=sorted(a)\\nb=[10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30,10,30]\\nfor i in range(2500000):\\n    b=b*i\\n    sorted(b)\\nfor i in range(len(a)):\\n    print(a[i],end=\\\" \\\")\\n\", \"a = list(map(int, input().split()))\\nn = a[0]\\na = sorted(a[1:])\\nx = 1234**500000\\nfor i in range(n):\\n    print('{} '.format(a[i]), end='')\\nprint('')\\n\", \"for i in range(0,int(3e7)):\\n    pass\\nprint(' '.join([str(i) for i in sorted([int(x) for x in input().split(' ')[1:]])]))\\n\", \"import time\\nkal = list(map(int,input().split()))\\np = kal[1:]\\nkaleee = []\\nfor i in range(6300):\\n    kaleee.append(i)\\n    kaleee.count(i)\\np.sort()\\nfor i in p:\\n\\tprint(i,end=' ')\\n\", \"# print(' '.join(map(str, sorted([int(x) for x in input().split()][1:]))))\\na = [int(x) for x in input().split()][1:]\\na.sort()\\nres = 0\\nfor i in range(7000000):\\n\\tres ^= i\\n\\t\\nprint(' '.join([str(x) for x in a]))\\n\", \"a = [int(i) for i in input().split()][1:]\\nfor i in range(15000000):\\n    b = (1 == 1)\\nprint(*sorted(a))\\n\", \"import sys\\nfor i in range(10**6):\\n  sys.stderr.write(str(i))\\nprint(' '.join(map(str,sorted(list(map(int,input().split()[1:]))))))\\n\", \"import time\\nstart_ = time.time()\\nn, *a = input().split()\\na = list(map(int, a))\\nprint(' '.join(str(ch) for ch in sorted(a)))\\nwhile True:\\n    if( time.time() - start_ > 1.7 ):\\n        break\\n\", \"a = list(map(int, input().split()))[1:]\\na.sort()\\nfor i in range(3 * 10 ** 7):\\n    continue\\nprint(*a)\", \"a = list(map(int, input().split()))\\nb = a[1:]\\nb.sort()\\nn = 0\\nfor i in range(10000000):\\n    n += 1\\nfor i in b:\\n    print(i, end = \\\" \\\")\\n\", \"import time\\nli = list(map(int, input().split()))\\nn = li.pop(0)\\nli.sort()\\nfor i in range(20000000):\\n    s = 0\\nprint(\\\" \\\".join(map(str, li)))\"]",
        "difficulty": "introductory",
        "input": "10 54 100 27 1 33 27 80 49 27 6\n",
        "output": "1 6 27 27 27 33 49 54 80 100 \n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/784/F"
    },
    {
        "id": 540,
        "task_id": 4733,
        "test_case_id": 1,
        "question": "Most of you have played card games (and if you haven’t, why not???) in which the deck of cards is randomized by shuffling it one or more times.\n\nA perfect shuffle  is a type of shuffle where the initial deck is divided exactly in half, and the two halves are perfectly interleaved. For example, a deck consisting of eight cards ABCDEFGH (where A is the top card of the deck) would be divided into two halves ABCD and EFGH and then interleaved to get AEBFCGDH. Note that in this shuffle the original top card (A) stays on top — this type of perfect shuffle is called an out-shuffle. An equally valid perfect shuffle would start with the first card from the second half and result in EAFBGCHD — this is known as an in-shuffle.\n\nWhile normal shuffling does a good job at randomizing a deck, perfect shuffles result in only a small number of possible orderings. For example, if we perform multiple out-shuffles on the deck above, we obtain the following: ABCDEFGH $\\rightarrow $ AEBFCGDH $\\rightarrow $ ACEGBDFH $\\rightarrow $ ABCDEFGH $\\rightarrow \\cdots $\n\nSo after 3 out-shuffles, the deck is returned to its original state. A similar thing happens if we perform multiple in-shuffles on an 8-card deck, though in this case it would take 6 shuffles before we get back to where we started. With a standard 52 card deck, only 8 out-shuffles are needed before the deck is returned to its original order (talented magicians can make use of this result in many of their tricks). These shuffles can also be used on decks with an odd number of cards, but we have to be a little careful: for out-shuffles, the first half of the deck must have 1 more card than the second half; for in-shuffles, it’s the exact opposite. For example, an out-shuffle on the deck ABCDE results in ADBEC, while an in-shuffle results in CADBE.\n\nFor this problem you will be given the size of a deck and must determine how many in- or out-shuffles it takes to return the deck to its pre-shuffled order.\n\n-----Input-----\nThe input consists of one line containing a positive integer $n \\leq 1000$ (the size of the deck) followed by either the word in or out, indicating whether you should perform in-shuffles or out-shuffles.\n\n-----Output-----\nFor each test case, output the case number followed by the number of in- or out-shuffles required to return the deck to its original order.\n\n-----Examples-----\nSample Input 1:\n8 out\nSample Output 1:\n3\n\nSample Input 2:\n8 in\nSample Output 2:\n6\n\nSample Input 3:\n52 out\nSample Output 3:\n8",
        "solutions": "",
        "difficulty": "introductory",
        "input": "8 out\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/shuffling"
    },
    {
        "id": 541,
        "task_id": 4733,
        "test_case_id": 2,
        "question": "Most of you have played card games (and if you haven’t, why not???) in which the deck of cards is randomized by shuffling it one or more times.\n\nA perfect shuffle  is a type of shuffle where the initial deck is divided exactly in half, and the two halves are perfectly interleaved. For example, a deck consisting of eight cards ABCDEFGH (where A is the top card of the deck) would be divided into two halves ABCD and EFGH and then interleaved to get AEBFCGDH. Note that in this shuffle the original top card (A) stays on top — this type of perfect shuffle is called an out-shuffle. An equally valid perfect shuffle would start with the first card from the second half and result in EAFBGCHD — this is known as an in-shuffle.\n\nWhile normal shuffling does a good job at randomizing a deck, perfect shuffles result in only a small number of possible orderings. For example, if we perform multiple out-shuffles on the deck above, we obtain the following: ABCDEFGH $\\rightarrow $ AEBFCGDH $\\rightarrow $ ACEGBDFH $\\rightarrow $ ABCDEFGH $\\rightarrow \\cdots $\n\nSo after 3 out-shuffles, the deck is returned to its original state. A similar thing happens if we perform multiple in-shuffles on an 8-card deck, though in this case it would take 6 shuffles before we get back to where we started. With a standard 52 card deck, only 8 out-shuffles are needed before the deck is returned to its original order (talented magicians can make use of this result in many of their tricks). These shuffles can also be used on decks with an odd number of cards, but we have to be a little careful: for out-shuffles, the first half of the deck must have 1 more card than the second half; for in-shuffles, it’s the exact opposite. For example, an out-shuffle on the deck ABCDE results in ADBEC, while an in-shuffle results in CADBE.\n\nFor this problem you will be given the size of a deck and must determine how many in- or out-shuffles it takes to return the deck to its pre-shuffled order.\n\n-----Input-----\nThe input consists of one line containing a positive integer $n \\leq 1000$ (the size of the deck) followed by either the word in or out, indicating whether you should perform in-shuffles or out-shuffles.\n\n-----Output-----\nFor each test case, output the case number followed by the number of in- or out-shuffles required to return the deck to its original order.\n\n-----Examples-----\nSample Input 1:\n8 out\nSample Output 1:\n3\n\nSample Input 2:\n8 in\nSample Output 2:\n6\n\nSample Input 3:\n52 out\nSample Output 3:\n8",
        "solutions": "",
        "difficulty": "introductory",
        "input": "8 in\n",
        "output": "6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/shuffling"
    },
    {
        "id": 542,
        "task_id": 4733,
        "test_case_id": 3,
        "question": "Most of you have played card games (and if you haven’t, why not???) in which the deck of cards is randomized by shuffling it one or more times.\n\nA perfect shuffle  is a type of shuffle where the initial deck is divided exactly in half, and the two halves are perfectly interleaved. For example, a deck consisting of eight cards ABCDEFGH (where A is the top card of the deck) would be divided into two halves ABCD and EFGH and then interleaved to get AEBFCGDH. Note that in this shuffle the original top card (A) stays on top — this type of perfect shuffle is called an out-shuffle. An equally valid perfect shuffle would start with the first card from the second half and result in EAFBGCHD — this is known as an in-shuffle.\n\nWhile normal shuffling does a good job at randomizing a deck, perfect shuffles result in only a small number of possible orderings. For example, if we perform multiple out-shuffles on the deck above, we obtain the following: ABCDEFGH $\\rightarrow $ AEBFCGDH $\\rightarrow $ ACEGBDFH $\\rightarrow $ ABCDEFGH $\\rightarrow \\cdots $\n\nSo after 3 out-shuffles, the deck is returned to its original state. A similar thing happens if we perform multiple in-shuffles on an 8-card deck, though in this case it would take 6 shuffles before we get back to where we started. With a standard 52 card deck, only 8 out-shuffles are needed before the deck is returned to its original order (talented magicians can make use of this result in many of their tricks). These shuffles can also be used on decks with an odd number of cards, but we have to be a little careful: for out-shuffles, the first half of the deck must have 1 more card than the second half; for in-shuffles, it’s the exact opposite. For example, an out-shuffle on the deck ABCDE results in ADBEC, while an in-shuffle results in CADBE.\n\nFor this problem you will be given the size of a deck and must determine how many in- or out-shuffles it takes to return the deck to its pre-shuffled order.\n\n-----Input-----\nThe input consists of one line containing a positive integer $n \\leq 1000$ (the size of the deck) followed by either the word in or out, indicating whether you should perform in-shuffles or out-shuffles.\n\n-----Output-----\nFor each test case, output the case number followed by the number of in- or out-shuffles required to return the deck to its original order.\n\n-----Examples-----\nSample Input 1:\n8 out\nSample Output 1:\n3\n\nSample Input 2:\n8 in\nSample Output 2:\n6\n\nSample Input 3:\n52 out\nSample Output 3:\n8",
        "solutions": "",
        "difficulty": "introductory",
        "input": "52 out\n",
        "output": "8\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/shuffling"
    },
    {
        "id": 543,
        "task_id": 4733,
        "test_case_id": 4,
        "question": "Most of you have played card games (and if you haven’t, why not???) in which the deck of cards is randomized by shuffling it one or more times.\n\nA perfect shuffle  is a type of shuffle where the initial deck is divided exactly in half, and the two halves are perfectly interleaved. For example, a deck consisting of eight cards ABCDEFGH (where A is the top card of the deck) would be divided into two halves ABCD and EFGH and then interleaved to get AEBFCGDH. Note that in this shuffle the original top card (A) stays on top — this type of perfect shuffle is called an out-shuffle. An equally valid perfect shuffle would start with the first card from the second half and result in EAFBGCHD — this is known as an in-shuffle.\n\nWhile normal shuffling does a good job at randomizing a deck, perfect shuffles result in only a small number of possible orderings. For example, if we perform multiple out-shuffles on the deck above, we obtain the following: ABCDEFGH $\\rightarrow $ AEBFCGDH $\\rightarrow $ ACEGBDFH $\\rightarrow $ ABCDEFGH $\\rightarrow \\cdots $\n\nSo after 3 out-shuffles, the deck is returned to its original state. A similar thing happens if we perform multiple in-shuffles on an 8-card deck, though in this case it would take 6 shuffles before we get back to where we started. With a standard 52 card deck, only 8 out-shuffles are needed before the deck is returned to its original order (talented magicians can make use of this result in many of their tricks). These shuffles can also be used on decks with an odd number of cards, but we have to be a little careful: for out-shuffles, the first half of the deck must have 1 more card than the second half; for in-shuffles, it’s the exact opposite. For example, an out-shuffle on the deck ABCDE results in ADBEC, while an in-shuffle results in CADBE.\n\nFor this problem you will be given the size of a deck and must determine how many in- or out-shuffles it takes to return the deck to its pre-shuffled order.\n\n-----Input-----\nThe input consists of one line containing a positive integer $n \\leq 1000$ (the size of the deck) followed by either the word in or out, indicating whether you should perform in-shuffles or out-shuffles.\n\n-----Output-----\nFor each test case, output the case number followed by the number of in- or out-shuffles required to return the deck to its original order.\n\n-----Examples-----\nSample Input 1:\n8 out\nSample Output 1:\n3\n\nSample Input 2:\n8 in\nSample Output 2:\n6\n\nSample Input 3:\n52 out\nSample Output 3:\n8",
        "solutions": "",
        "difficulty": "introductory",
        "input": "53 out\n",
        "output": "52\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/shuffling"
    },
    {
        "id": 544,
        "task_id": 4853,
        "test_case_id": 1,
        "question": "Graphical calculators have become popular among high school students. They allow functions to be plotted on screen with minimal efforts by the students. These calculators generally do not possess very fast processors. In this problem, you are asked to implement a method to speed up the plotting of a polynomial.\n\nGiven a polynomial $p(x) = a_ n x^n + ... + a_1 x + a_0$ of degree $n$, we wish to plot this polynomial at the $m$ integer points $x = 0, 1, \\ldots , m-1$. A straightforward evaluation at these points requires $mn$ multiplications and $mn$ additions.\n\nOne way to speed up the computation is to make use of results computed previously. For example, if $p(x) = a_1 x + a_0$ and $p(i)$ has already been computed, then $p(i+1) = p(i) + a_1$. Thus, each successive value of $p(x)$ can be computed with one addition each.\n\nIn general, we can compute $p(i+1)$ from $p(i)$ with $n$ additions, after the appropriate initialization has been done. If we initialize the constants $C_0$, $C_1$, $\\ldots $, $C_ n$ appropriately, one can compute $p(i)$ using the following pseudocode:\n\n  p(0) = C_0; t_1 = C_1; ... t_n = C_n;\n  for i from 1 to m-1 do p(i)    = p(i-1)  + t_1; t_1     = t_1     + t_2; t_2     = t_2     + t_3; : : t_(n-1) = t_(n-1) + t_n;\n  end\n\nFor example, if $p(x) = a_1 x + a_0$, we can initialize $C_0 = a_0$ and $C_1 = a_1$.\n\nYour task is to compute the constants $C_0, C_1, \\ldots , C_ n$ for the above pseudocode to give the correct values for $p(i)$ at $i = 0, \\ldots , m-1$.\n\n-----Input-----\nThe input consists of one case specified on a single line. The first integer is $n$, where $1 \\leq n \\leq 6$. This is followed by $n+1$ integer coefficients $a_ n, \\ldots , a_1, a_0$. You may assume that $|a_ i| \\leq 50$ for all $i$, and $a_ n \\neq 0$.\n\n-----Output-----\nPrint the integers $C_0$, $C_1$, …, $C_ n$, separated by spaces.\n\n-----Examples-----\nSample Input 1:\n1 5 2\nSample Output 1:\n2 5\n\nSample Input 2:\n2 2 -4 5\nSample Output 2:\n5 -2 4",
        "solutions": "",
        "difficulty": "introductory",
        "input": "1 5 2\n",
        "output": "2 5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/plot"
    },
    {
        "id": 545,
        "task_id": 4853,
        "test_case_id": 2,
        "question": "Graphical calculators have become popular among high school students. They allow functions to be plotted on screen with minimal efforts by the students. These calculators generally do not possess very fast processors. In this problem, you are asked to implement a method to speed up the plotting of a polynomial.\n\nGiven a polynomial $p(x) = a_ n x^n + ... + a_1 x + a_0$ of degree $n$, we wish to plot this polynomial at the $m$ integer points $x = 0, 1, \\ldots , m-1$. A straightforward evaluation at these points requires $mn$ multiplications and $mn$ additions.\n\nOne way to speed up the computation is to make use of results computed previously. For example, if $p(x) = a_1 x + a_0$ and $p(i)$ has already been computed, then $p(i+1) = p(i) + a_1$. Thus, each successive value of $p(x)$ can be computed with one addition each.\n\nIn general, we can compute $p(i+1)$ from $p(i)$ with $n$ additions, after the appropriate initialization has been done. If we initialize the constants $C_0$, $C_1$, $\\ldots $, $C_ n$ appropriately, one can compute $p(i)$ using the following pseudocode:\n\n  p(0) = C_0; t_1 = C_1; ... t_n = C_n;\n  for i from 1 to m-1 do p(i)    = p(i-1)  + t_1; t_1     = t_1     + t_2; t_2     = t_2     + t_3; : : t_(n-1) = t_(n-1) + t_n;\n  end\n\nFor example, if $p(x) = a_1 x + a_0$, we can initialize $C_0 = a_0$ and $C_1 = a_1$.\n\nYour task is to compute the constants $C_0, C_1, \\ldots , C_ n$ for the above pseudocode to give the correct values for $p(i)$ at $i = 0, \\ldots , m-1$.\n\n-----Input-----\nThe input consists of one case specified on a single line. The first integer is $n$, where $1 \\leq n \\leq 6$. This is followed by $n+1$ integer coefficients $a_ n, \\ldots , a_1, a_0$. You may assume that $|a_ i| \\leq 50$ for all $i$, and $a_ n \\neq 0$.\n\n-----Output-----\nPrint the integers $C_0$, $C_1$, …, $C_ n$, separated by spaces.\n\n-----Examples-----\nSample Input 1:\n1 5 2\nSample Output 1:\n2 5\n\nSample Input 2:\n2 2 -4 5\nSample Output 2:\n5 -2 4",
        "solutions": "",
        "difficulty": "introductory",
        "input": "2 2 -4 5\n",
        "output": "5 -2 4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/plot"
    },
    {
        "id": 546,
        "task_id": 4853,
        "test_case_id": 3,
        "question": "Graphical calculators have become popular among high school students. They allow functions to be plotted on screen with minimal efforts by the students. These calculators generally do not possess very fast processors. In this problem, you are asked to implement a method to speed up the plotting of a polynomial.\n\nGiven a polynomial $p(x) = a_ n x^n + ... + a_1 x + a_0$ of degree $n$, we wish to plot this polynomial at the $m$ integer points $x = 0, 1, \\ldots , m-1$. A straightforward evaluation at these points requires $mn$ multiplications and $mn$ additions.\n\nOne way to speed up the computation is to make use of results computed previously. For example, if $p(x) = a_1 x + a_0$ and $p(i)$ has already been computed, then $p(i+1) = p(i) + a_1$. Thus, each successive value of $p(x)$ can be computed with one addition each.\n\nIn general, we can compute $p(i+1)$ from $p(i)$ with $n$ additions, after the appropriate initialization has been done. If we initialize the constants $C_0$, $C_1$, $\\ldots $, $C_ n$ appropriately, one can compute $p(i)$ using the following pseudocode:\n\n  p(0) = C_0; t_1 = C_1; ... t_n = C_n;\n  for i from 1 to m-1 do p(i)    = p(i-1)  + t_1; t_1     = t_1     + t_2; t_2     = t_2     + t_3; : : t_(n-1) = t_(n-1) + t_n;\n  end\n\nFor example, if $p(x) = a_1 x + a_0$, we can initialize $C_0 = a_0$ and $C_1 = a_1$.\n\nYour task is to compute the constants $C_0, C_1, \\ldots , C_ n$ for the above pseudocode to give the correct values for $p(i)$ at $i = 0, \\ldots , m-1$.\n\n-----Input-----\nThe input consists of one case specified on a single line. The first integer is $n$, where $1 \\leq n \\leq 6$. This is followed by $n+1$ integer coefficients $a_ n, \\ldots , a_1, a_0$. You may assume that $|a_ i| \\leq 50$ for all $i$, and $a_ n \\neq 0$.\n\n-----Output-----\nPrint the integers $C_0$, $C_1$, …, $C_ n$, separated by spaces.\n\n-----Examples-----\nSample Input 1:\n1 5 2\nSample Output 1:\n2 5\n\nSample Input 2:\n2 2 -4 5\nSample Output 2:\n5 -2 4",
        "solutions": "",
        "difficulty": "introductory",
        "input": "6 1 -20 4 30 0 -1 2\n",
        "output": "2 14 -302 -2136 -3144 -600 720\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/plot"
    },
    {
        "id": 547,
        "task_id": 170,
        "test_case_id": 1,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n2 1 3\n2 4 2\n",
        "output": "6 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 548,
        "task_id": 170,
        "test_case_id": 2,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n2 1 3\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 549,
        "task_id": 170,
        "test_case_id": 3,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 5 3 2 4\n1 1\n",
        "output": "1 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 550,
        "task_id": 170,
        "test_case_id": 4,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n2 6 5\n4 1 2 3 4\n",
        "output": "6 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 551,
        "task_id": 170,
        "test_case_id": 5,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "7\n6 6 5 2 7 4 1\n1 3\n",
        "output": "1 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 552,
        "task_id": 170,
        "test_case_id": 6,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "8\n7 2 3 1 5 6 4 8\n1 7\n",
        "output": "15 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 553,
        "task_id": 170,
        "test_case_id": 7,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "9\n2 3 6\n7 9 7 8 5 2 1 4\n",
        "output": "2 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 554,
        "task_id": 170,
        "test_case_id": 8,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n3 7 10 8\n7 4 6 9 2 5 1 3\n",
        "output": "25 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 555,
        "task_id": 170,
        "test_case_id": 9,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 2 1\n1 3\n",
        "output": "2 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 556,
        "task_id": 170,
        "test_case_id": 10,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 3 2\n1 1\n",
        "output": "1 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 557,
        "task_id": 170,
        "test_case_id": 11,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 3\n2 2 1\n",
        "output": "2 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 558,
        "task_id": 170,
        "test_case_id": 12,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 1\n2 3 2\n",
        "output": "1 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 559,
        "task_id": 170,
        "test_case_id": 13,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 2\n2 3 1\n",
        "output": "1 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 560,
        "task_id": 170,
        "test_case_id": 14,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 3 1\n1 2\n",
        "output": "1 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 561,
        "task_id": 170,
        "test_case_id": 15,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n1 3\n2 1 2\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 562,
        "task_id": 170,
        "test_case_id": 16,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 1 3\n1 2\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 563,
        "task_id": 170,
        "test_case_id": 17,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 1 2\n1 3\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 564,
        "task_id": 170,
        "test_case_id": 19,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n2 2 1\n2 4 3\n",
        "output": "2 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 565,
        "task_id": 170,
        "test_case_id": 20,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 2\n3 3 4 1\n",
        "output": "1 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 566,
        "task_id": 170,
        "test_case_id": 21,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n3 3 2 1\n1 4\n",
        "output": "3 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 567,
        "task_id": 170,
        "test_case_id": 22,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n3 2 3 1\n1 4\n",
        "output": "7 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 568,
        "task_id": 170,
        "test_case_id": 23,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n3 1 4 2\n1 3\n",
        "output": "7 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 569,
        "task_id": 170,
        "test_case_id": 24,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "4\n3 1 3 2\n1 4\n",
        "output": "5 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 570,
        "task_id": 170,
        "test_case_id": 25,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n2 2 1\n3 4 5 3\n",
        "output": "2 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 571,
        "task_id": 170,
        "test_case_id": 26,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 4\n4 5 2 3 1\n",
        "output": "1 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 572,
        "task_id": 170,
        "test_case_id": 27,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 2\n4 5 1 4 3\n",
        "output": "1 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 573,
        "task_id": 170,
        "test_case_id": 28,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n2 2 4\n3 3 1 5\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 574,
        "task_id": 170,
        "test_case_id": 29,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 2 4 3 1\n1 5\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 575,
        "task_id": 170,
        "test_case_id": 30,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 1 3 4 2\n1 5\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 576,
        "task_id": 170,
        "test_case_id": 31,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 3 2 5 1\n1 4\n",
        "output": "7 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 577,
        "task_id": 170,
        "test_case_id": 32,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 4\n4 3 2 5 1\n",
        "output": "7 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 578,
        "task_id": 170,
        "test_case_id": 33,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 4 1 3 2\n1 5\n",
        "output": "6 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 579,
        "task_id": 170,
        "test_case_id": 34,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 1 4 3 2\n1 5\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 580,
        "task_id": 170,
        "test_case_id": 35,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "5\n4 1 5 3 2\n1 4\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 581,
        "task_id": 170,
        "test_case_id": 36,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n3 2 4 1\n3 3 6 5\n",
        "output": "3 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 582,
        "task_id": 170,
        "test_case_id": 37,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n1 4\n5 2 5 6 3 1\n",
        "output": "3 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 583,
        "task_id": 170,
        "test_case_id": 38,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 1 5 4 6 2\n1 3\n",
        "output": "3 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 584,
        "task_id": 170,
        "test_case_id": 39,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n2 4 6\n4 1 3 2 5\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 585,
        "task_id": 170,
        "test_case_id": 40,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n4 2 1 6 4\n2 5 3\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 586,
        "task_id": 170,
        "test_case_id": 41,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n1 6\n5 1 3 2 5 4\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 587,
        "task_id": 170,
        "test_case_id": 42,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 4 6 3 2 1\n1 5\n",
        "output": "19 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 588,
        "task_id": 170,
        "test_case_id": 43,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n1 5\n5 4 6 3 2 1\n",
        "output": "19 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 589,
        "task_id": 170,
        "test_case_id": 44,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 1 5 4 3 2\n1 6\n",
        "output": "17 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 590,
        "task_id": 170,
        "test_case_id": 45,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 1 4 3 5 2\n1 6\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 591,
        "task_id": 170,
        "test_case_id": 46,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 1 4 2 5 3\n1 6\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 592,
        "task_id": 170,
        "test_case_id": 47,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "6\n5 1 3 4 5 2\n1 6\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 593,
        "task_id": 170,
        "test_case_id": 48,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "7\n1 1\n6 5 6 3 2 7 4\n",
        "output": "1 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 594,
        "task_id": 170,
        "test_case_id": 49,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "7\n6 5 1 2 6 4 3\n1 7\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 595,
        "task_id": 170,
        "test_case_id": 50,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "7\n6 3 5 2 1 6 4\n1 7\n",
        "output": "14 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 596,
        "task_id": 170,
        "test_case_id": 51,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "7\n1 6\n6 1 2 5 4 7 3\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 597,
        "task_id": 170,
        "test_case_id": 52,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "8\n1 4\n7 3 8 6 1 5 7 2\n",
        "output": "3 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 598,
        "task_id": 170,
        "test_case_id": 53,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "8\n7 3 1 5 4 7 6 2\n1 8\n",
        "output": "41 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 599,
        "task_id": 170,
        "test_case_id": 54,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "9\n8 3 1 4 5 2 6 9 8\n1 7\n",
        "output": "11 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 600,
        "task_id": 170,
        "test_case_id": 55,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "9\n7 6 5 9 2 1 3 8\n2 7 4\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 601,
        "task_id": 170,
        "test_case_id": 56,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "9\n8 7 4 3 1 6 5 9 2\n1 8\n",
        "output": "25 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 602,
        "task_id": 170,
        "test_case_id": 57,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "9\n8 4 8 5 6 3 2 7 1\n1 9\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 603,
        "task_id": 170,
        "test_case_id": 58,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n2 9 3\n8 10 4 1 8 6 2 7 5\n",
        "output": "2 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 604,
        "task_id": 170,
        "test_case_id": 59,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n2 7 1\n8 8 2 4 3 5 6 10 9\n",
        "output": "2 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 605,
        "task_id": 170,
        "test_case_id": 60,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n1 5\n9 3 2 8 7 1 9 10 6 4\n",
        "output": "7 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 606,
        "task_id": 170,
        "test_case_id": 61,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 6 2 1 4 8 7 3 10 5\n1 9\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 607,
        "task_id": 170,
        "test_case_id": 62,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n1 10\n9 9 4 7 8 5 2 6 3 1\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 608,
        "task_id": 170,
        "test_case_id": 63,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n5 1 2 7 9 6\n5 3 4 10 8 5\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 609,
        "task_id": 170,
        "test_case_id": 64,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 8 7 6 2 3 5 4 9 1\n1 10\n",
        "output": "105 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 610,
        "task_id": 170,
        "test_case_id": 65,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n1 10\n9 5 7 6 1 2 3 9 8 4\n",
        "output": "105 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 611,
        "task_id": 170,
        "test_case_id": 66,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 8 7 6 2 3 5 4 10 1\n1 9\n",
        "output": "103 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 612,
        "task_id": 170,
        "test_case_id": 67,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 4 6 5 3 1 8 9 7 2\n1 10\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 613,
        "task_id": 170,
        "test_case_id": 68,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 4 6 5 3 1 8 10 7 2\n1 9\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 614,
        "task_id": 170,
        "test_case_id": 69,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 4 9 6 5 8 3 2 7 1\n1 10\n",
        "output": "-1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 615,
        "task_id": 170,
        "test_case_id": 70,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n3 8 4 10\n7 1 2 6 7 3 9 5\n",
        "output": "37 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 616,
        "task_id": 170,
        "test_case_id": 71,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n4 6 2 7 1\n6 3 8 10 9 5 4\n",
        "output": "10 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 617,
        "task_id": 170,
        "test_case_id": 72,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n2 7 8\n8 3 5 2 10 4 9 1 6\n",
        "output": "12 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 618,
        "task_id": 170,
        "test_case_id": 73,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n2 7 5\n8 9 3 2 4 6 8 1 10\n",
        "output": "10 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 619,
        "task_id": 170,
        "test_case_id": 74,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n3 4 9 2\n7 5 1 6 8 3 7 10\n",
        "output": "7 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 620,
        "task_id": 170,
        "test_case_id": 75,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n5 4 9 1 8 7\n5 6 10 3 5 2\n",
        "output": "21 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 621,
        "task_id": 170,
        "test_case_id": 76,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n3 4 5 1\n7 9 10 3 2 6 7 8\n",
        "output": "3 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 622,
        "task_id": 170,
        "test_case_id": 77,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n3 5 9 8\n7 2 3 7 10 1 6 4\n",
        "output": "19 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 623,
        "task_id": 170,
        "test_case_id": 78,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n1 5\n9 4 9 1 7 2 6 10 3 8\n",
        "output": "7 2",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 624,
        "task_id": 170,
        "test_case_id": 79,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n4 3 10 8 7\n6 4 2 5 6 1 9\n",
        "output": "8 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 625,
        "task_id": 170,
        "test_case_id": 80,
        "question": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. \n\nThe rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. \n\nYou have to calculate how many fights will happen and who will win the game, or state that game won't end.\n\n\n-----Input-----\n\nFirst line contains a single integer n (2 ≤ n ≤ 10), the number of cards.\n\nSecond line contains integer k_1 (1 ≤ k_1 ≤ n - 1), the number of the first soldier's cards. Then follow k_1 integers that are the values on the first soldier's cards, from top to bottom of his stack.\n\nThird line contains integer k_2 (k_1 + k_2 = n), the number of the second soldier's cards. Then follow k_2 integers that are the values on the second soldier's cards, from top to bottom of his stack.\n\nAll card values are different.\n\n\n-----Output-----\n\nIf somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won.\n\nIf the game won't end and will continue forever output  - 1.\n\n\n-----Examples-----\nInput\n4\n2 1 3\n2 4 2\n\nOutput\n6 2\nInput\n3\n1 2\n2 1 3\n\nOutput\n-1\n\n\n-----Note-----\n\nFirst sample:  [Image] \n\nSecond sample:  [Image]",
        "solutions": "[\"n = int(input())\\nk1 = list(map(int, input().split()[1:]))\\nk2 = list(map(int, input().split()[1:]))\\n\\ni = 0\\nwhile True:\\n    if len(k1) == 0 or len(k2) == 0:\\n        break\\n    if i > 10000:\\n        break\\n    if k1[0] > k2[0]:\\n        k1 = k1[1:] + k2[0:1] + k1[0:1]\\n        k2 = k2[1:]\\n    else:\\n        k2 = k2[1:] + k1[0:1] + k2[0:1]\\n        k1 = k1[1:]\\n    i += 1\\n\\nif i > 10000:\\n    print(-1)\\nelse:\\n    winner = 1\\n    if len(k1) == 0:\\n        winner = 2\\n    print(i, winner)\\n\", \"__author__ = 'Andrey'\\nimport collections\\nimport time\\nstart = time.time()\\nn = int(input())\\ncards_1 = collections.deque(list(map(int, input().split()))[1:])\\ncards_2 = collections.deque(list(map(int, input().split()))[1:])\\nc = 0\\nbad = False\\nwhile cards_1 and cards_2:\\n    end = time.time()\\n    if end - start > 1.85:\\n        bad = True\\n        break\\n    n_1 = cards_1.popleft()\\n    n_2 = cards_2.popleft()\\n    c += 1\\n    if n_1 > n_2:\\n        cards_1.append(n_2)\\n        cards_1.append(n_1)\\n    else:\\n        cards_2.append(n_1)\\n        cards_2.append(n_2)\\nelse:\\n    print(c, 1 if cards_1 else 2)\\nif bad:\\n    print(-1)\\n\", \"n = int(input())\\na = list(map(int, input().split()))[1:]\\nb = list(map(int, input().split()))[1:]\\n\\nused = set()\\ncnt = 0\\nwhile len(a) != 0 and len(b) != 0:\\n    if (tuple(a), tuple(b)) not in used:\\n        used.add((tuple(a), tuple(b)))\\n    else:\\n        print(-1)\\n        return\\n    x, y = a.pop(0), b.pop(0)\\n    if x > y:\\n        a.append(y)\\n        a.append(x)\\n    else:\\n        b.append(x)\\n        b.append(y)\\n    cnt += 1\\nprint(cnt, '1' if len(b) == 0 else '2')\\n\", \"N = input()\\ns1 = input().split(' ')[1:]\\ns2 = input().split(' ')[1:]\\n\\ns1 = tuple(map(int, s1))\\ns2 = tuple(map(int, s2))\\n\\nalready_seen = set()\\nnum_fights = 0\\n\\nwhile len(s1) > 0 and len(s2) > 0:\\n\\n    num_fights += 1\\n\\n    if (s1, s2) in already_seen:\\n        break\\n    else:\\n        already_seen.add((s1, s2))\\n\\n    if s1[0] < s2[0]:\\n        s2 = s2[1:] + (s1[0], s2[0])\\n        s1 = s1[1:]\\n    else:\\n        s1 = s1[1:] + (s2[0], s1[0])\\n        s2 = s2[1:]\\n\\nif len(s1) == 0:\\n    print(str(num_fights) + ' 2')\\nelif len(s2) == 0:\\n    print(str(num_fights) + ' 1')\\nelse:\\n    print(-1)\", \"n=int(input())\\ns1=list(map(int, input().split()))\\ns1.pop(0)\\ns2=list(map(int, input().split()))\\ns2.pop(0)\\n#print(s1, s2, n)\\nc=0\\nwhile s1 and s2 and c<10**5:\\n    if s1[0]>s2[0]:\\n        s1.append(s2[0])\\n        s1.append(s1[0])\\n    else:\\n        s2.append(s1[0])\\n        s2.append(s2[0])\\n    s1.pop(0)\\n    s2.pop(0)\\n    c+=1\\nif not(s1):\\n    print(c, 2)\\nelif not(s2):\\n    print(c, 1)\\nelse:\\n    print(-1)\", \"n = int(input())\\nsol_1 = list(map(int, input().split()))\\nl1 = sol_1[0]\\ns1 = l1\\nsol_1 = sol_1[1:]\\nsol_2 = list(map(int, input().split()))\\nl2 = sol_2[0]\\ns2 = l2\\nsol_2 = sol_2[1:]\\ni = 0\\nj = 0\\nsol_11 = []\\nsol_22 = []\\np = 10000\\nc = 0\\nwhile s1 != 0 and s2 != 0 and p > 0:\\n    if i == len(sol_1):\\n        i = 0\\n        sol_1 = sol_11[:]\\n        sol_11 = []\\n    if j == len(sol_2):\\n        j = 0\\n        sol_2 = sol_22[:]\\n        sol_22 = []    \\n    if sol_1[i] > sol_2[j]:\\n        sol_11.append(sol_2[j])\\n        sol_11.append(sol_1[i])\\n        s1 += 1\\n        s2 -= 1\\n    else:\\n        sol_22.append(sol_1[i])\\n        sol_22.append(sol_2[j])    \\n        s2 += 1\\n        s1 -= 1\\n    i += 1\\n    j += 1\\n    c += 1\\n    p -= 1\\nif p == 0:\\n    print(-1)\\nelse:\\n    if s1 == 0:\\n        print(c, '2')\\n    else:\\n        print(c, '1')\", \"import sys\\nimport collections\\n\\n\\ndef get_code(first_cards, second_cards):\\n    c1 = 0\\n    for i, card in enumerate(first_cards):\\n        c1 += (card - 1) * 10**i\\n    c2 = 0\\n    for i, card in enumerate(second_cards):\\n        c2 += (card - 1) * 10**i\\n    return (c1, c2)\\n\\n\\ndef main():\\n    n = int(sys.stdin.readline())\\n    first_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n    second_cards = collections.deque(reversed(list(map(int, sys.stdin.readline().split()))[1:]))\\n\\n\\n    existing_states = set()\\n    number_of_fights = 0\\n\\n    while first_cards and second_cards:\\n        # code = get_code(first_cards, second_cards)\\n        code = (tuple(first_cards), tuple(second_cards))\\n        if code in existing_states:\\n            print (-1)\\n            return\\n        existing_states.add(code)\\n\\n        if first_cards[-1] > second_cards[-1]:\\n            first_cards.appendleft(second_cards.pop())\\n            first_cards.appendleft(first_cards.pop())\\n        else:\\n            second_cards.appendleft(first_cards.pop())\\n            second_cards.appendleft(second_cards.pop())\\n        number_of_fights += 1\\n\\n    print ('%d %d' % (number_of_fights, 1 if not second_cards else 2))\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"\\nn = int(input())\\nl1 = [int(i) for i in input().split()]\\nk1 = l1.pop(0)\\n#print (k1, l1)\\nl1.reverse()\\nl2 = [int(i) for i in input().split()]\\nk2 = l2.pop(0)\\nl2.reverse()\\n#print(k1, k2, l1, l2)\\ni = 0\\ndup = set()\\nwhile len(l1) > 0 and len(l2) > 0:\\n    c = tuple(l1 + [0.5] + l2)\\n    #print (c)\\n    if c in dup:\\n        break\\n    dup.add(c) \\n    a = l1.pop()\\n    b = l2.pop()\\n    if a>b:\\n        l1.insert(0,b)\\n        l1.insert(0,a)\\n    else:\\n        l2.insert(0,a)\\n        l2.insert(0,b)\\n    #print(l1,l2)\\n    i+=1\\nif len(l1) == 0:\\n    print (i, 2)\\nelif len(l2) == 0:\\n    print (i,1)\\nelse:\\n    print(-1)\", \"import sys\\n\\nn = int(input())\\nd1 = list(map(int, input().split(\\\" \\\")))\\nd2 = list(map(int, input().split(\\\" \\\")))\\nk1 = d1[0]\\nk2 = d2[0]\\nd1.remove(d1[0])\\nd2.remove(d2[0])\\n\\nmoves = 0\\n\\nwhile True:\\n    if moves > 500000:\\n        print(-1)\\n        return\\n    a = d1[0]\\n    d1.remove(d1[0])\\n    b = d2[0]\\n    d2.remove(d2[0])\\n    if a > b:\\n        moves += 1\\n        d1.append(b)\\n        d1.append(a)\\n        if len(d2) == 0:\\n            print(str(moves) + \\\" 1\\\")\\n            return\\n    if b > a:\\n        moves +=1\\n        d2.append(a)\\n        d2.append(b)\\n        if len(d1) == 0:\\n            print(str(moves) + \\\" 2\\\")\\n            return\", \"n = int(input())\\ns1 = [int(x) for x in input().split()]\\ns1.pop(0)\\ns2 = [int(x) for x in input().split()]\\ns2.pop(0)\\nc = 0\\nchk = [[False for x in range(11)] for x in range(11)]\\nwhile(True):\\n\\tif(c > 1000):\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\t\\n\\tif(not s1 or not s2):\\n\\t\\tprint(c,1 if not s2 else 2)\\n\\t\\treturn\\n\\telse:\\n\\t\\tchk[s1[0]][s2[0]] = True\\n\\t\\tif(s1[0] > s2[0]):\\n\\t\\t\\ts1.append(s2[0])\\n\\t\\t\\ts1.append(s1[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\telse:\\n\\t\\t\\ts2.append(s1[0])\\n\\t\\t\\ts2.append(s2[0])\\n\\t\\t\\ts1.pop(0)\\n\\t\\t\\ts2.pop(0)\\n\\t\\tc += 1\\n\", \"n = int(input())\\ns1 = [int(i) for i in input().split()]\\ns1.pop(0)\\ns2 = [int(i) for i in input().split()]\\ns2.pop(0)\\nt = 0\\nwhile s1 and s2:\\n    t += 1\\n    a = s1.pop(0)\\n    b = s2.pop(0)\\n    if a > b:\\n        s1.append(b)\\n        s1.append(a)\\n    else:\\n        s2.append(a)\\n        s2.append(b)\\n    if t>1000:\\n        break\\nif t>1000:\\n    print(-1)\\nelse:\\n    if s1:\\n        print(t, 1)\\n    else:\\n        print(t, 2)\\n\", \"def comp(a,b):\\n\\tif(len(a) != len(b)):\\n\\t\\treturn False\\n\\tn = len(a)\\n\\tfor i in range(n):\\n\\t\\tif(a[i] != b[i]):\\n\\t\\t\\treturn False\\n\\treturn True\\n\\nn = int(input())\\n\\na = []\\nb = []\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nk1 = a[0]\\nk2 = b[0]\\n\\ndel a[0]\\ndel b[0]\\n\\np = []\\nq = []\\n\\nfor i in a:\\n\\tp.append(i)\\n\\nfor i in b:\\n\\tq.append(i)\\n\\n#print(a)\\n#print(b)\\n\\ntotal = 0\\nflag = True\\n\\nwhile(True):\\n\\tx = a[0]\\n\\ty = b[0]\\n\\tif(x > y):\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\ta.append(y)\\n\\t\\ta.append(x)\\n\\telse:\\n\\t\\ta.pop(0)\\n\\t\\tb.pop(0)\\n\\t\\tb.append(x)\\n\\t\\tb.append(y)\\n\\t#print(a,b)\\n\\ttotal += 1\\n\\tif((p == a and q == b) or total >= 100000):\\n\\t\\tflag = False\\n\\t\\tbreak\\n\\tif(len(a) == 0 or len(b) == 0):\\n\\t\\tbreak\\n\\nif(flag == False):\\n\\tprint(-1)\\nelse:\\n\\tif(a == []):\\n\\t\\tprint(total,2)\\n\\telse:\\n\\t\\tprint(total,1)\", \"# coding:utf-8\\n\\nn = int(input())\\nf_deck = list(map(int, input().split(' ')))[1:]\\ns_deck = list(map(int, input().split(' ')))[1:]\\n\\n# print('- - - - -')\\nidx = 0\\nrec = []\\nwhile 1:\\n    # print('-')\\n    # print(f_deck)\\n    # print(s_deck)\\n    rec.append(''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))))\\n    if f_deck[0] > s_deck[0]:\\n        f_deck.append(s_deck.pop(0))\\n        f_deck.append(f_deck.pop(0))\\n    else:\\n        s_deck.append(f_deck.pop(0))\\n        s_deck.append(s_deck.pop(0))\\n    idx += 1\\n    if ''.join(list(map(str,f_deck))) +'_'+ ''.join(list(map(str,s_deck))) in rec:\\n        break\\n    if len(f_deck) == 0 or len(s_deck) == 0:\\n        break\\n    # if idx>5000000:\\n    #     break\\nif len(f_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,2))\\nelif len(s_deck) == 0:\\n    print(\\\"{} {}\\\".format(idx,1))\\nelse:\\n    print(-1)\\n\\n'''\\nInput\\n4\\n2 1 3\\n2 4 2\\nOutput\\n6 2\\n\\nInput\\n3\\n1 2\\n2 1 3\\nOutput\\n-1\\n'''\", \"from collections import deque\\nfrom copy import deepcopy\\nn = int(input())\\nA = deque(list(map(int, input().split()))[1:])\\nB = deque(list(map(int, input().split()))[1:])\\nstate = []\\nstate.append((deepcopy(A), deepcopy(B)))\\ncnt = 0\\nwhile len(A) > 0 and len(B) > 0:\\n    if A[0] > B[0]:\\n        A.append(B.popleft())\\n        A.append(A.popleft())\\n    else:\\n        B.append(A.popleft())\\n        B.append(B.popleft())\\n    if (A, B) in state:\\n        print(-1)\\n        break\\n    state.append((deepcopy(A), deepcopy(B)))\\n    cnt += 1\\nelse:\\n    print(cnt, 1 if len(B) == 0 else 2)\\n\", \"def fight(k1, k2):\\n    l = k1.pop(0)\\n    r = k2.pop(0)\\n    if l < r:\\n        k2.extend([l, r])\\n    else:\\n        k1.extend([r, l])\\n\\n\\nn = int(input())\\nk1 = list(map(int, input().split()))\\nk1.pop(0)\\nk2 = list(map(int, input().split()))\\nk2.pop(0)\\n\\ncombs = set()\\nfights = 0\\nwhile k1 and k2:\\n    topcomb = (''.join(map(str, k1)), ''.join(map(str, k2)))\\n    if topcomb in combs:\\n#        print(fights)\\n        fights = -1\\n        break\\n    combs.add(topcomb)\\n    fight(k1, k2)\\n    fights += 1\\n\\n\\nprint(fights, end=' ')\\nif fights > -1:\\n    print(1 if k1 else 2)\", \"n=int(input())\\na=list(map(int,input().split()))\\nk1=a[0]\\ns1=a[1:]\\na=list(map(int,input().split()))\\nk2=a[0]\\ns2=a[1:]\\nflag=0\\nfights=0\\ncount=0\\nwhile(len(s1)!=0 and len(s2)!=0):\\n    count+=1\\n    if count>1000000:\\n        flag=1\\n        break\\n    t=s1.pop(0)\\n    p=s2.pop(0)\\n    if t>p:\\n        s1.append(p)\\n        s1.append(t)\\n    else:\\n        s2.append(t)\\n        s2.append(p)\\n    fights+=1\\nif flag==1:\\n    print(\\\"-1\\\")\\nelse:\\n    if len(s1)==0:\\n        won=\\\"2\\\"\\n    else :\\n        won=\\\"1\\\"\\n    print(fights,won,sep=\\\" \\\")\\n\\n\\n\", \"a = int(input())\\n\\nx = list(map(int, input().split(' ')))[1:]\\ny = list(map(int, input().split(' ')))[1:]\\n\\nnum = 0\\nstates = []\\nwhile len(x)>0 and len(y)>0:\\n\\ttx = x[0]\\n\\tty = y[0]\\n\\tif tx > ty:\\n\\t\\tx = x[1:] + [ty] + [tx]\\n\\t\\ty = y[1:]\\n\\telse:\\n\\t\\ty = y[1:] + [tx] + [ty]\\n\\t\\tx = x[1:]\\n\\tnum += 1\\n\\t\\n\\tstates.append([x, y])\\n\\t\\n\\tif num > 10**5:\\n\\t\\tif [x, y] in states:\\n\\t\\t\\tprint(-1)\\n\\t\\t\\tquit()\\n\\t\\nif x == []:\\n\\tprint(num, 2)\\nelse:\\n\\tprint(num, 1)\\n\", \"n = int(input())\\na = list((map(int,input().split())))\\nb = list((map(int,input().split())))\\nk,l = a[0],b[0]\\na.pop(0)\\nb.pop(0)\\ncnt = 0\\nwhile len(a)>0 and len(b)>0 and cnt<1000:\\n    if a[0]>b[0]:\\n        a.append(b[0])\\n        a.append(a[0])\\n\\n    if b[0]>a[0]:\\n        b.append(a[0])\\n        b.append(b[0])\\n\\n    cnt+=1\\n    a.pop(0)\\n    b.pop(0)\\nif len(a)==0: #or i==len(b)-1:\\n        print(cnt,2)\\n        quit()\\nif len(b)==0:\\n        print(cnt,1)\\n        quit()\\nif len(a)>0 and len(b)>0:\\n    print(-1)\\nelse:\\n    print(cnt)\", \"n = int(input())\\nlist1 = list(map(int, input().split()))\\nlist2 = list(map(int, input().split()))\\nk1 = list1[0]\\ndel list1[0]\\nk2 = list2[0]\\ndel list2[0]\\ni = 0\\ncount = 0\\nwhile(len(list1) != 0 and len(list2) != 0):\\n    if(list1[i] < list2[i]):\\n        list2.append(list1[i])\\n        list2.append(list2[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    elif(list2[i] < list1[i]):\\n        list1.append(list2[i])\\n        list1.append(list1[i])\\n        del list1[i]\\n        del list2[i]\\n        count += 1\\n    else:\\n        del list1[i]\\n        del list2[i]\\n    if count == n**2+10:\\n        print(\\\"-1\\\")\\n        break\\nif len(list1) == 0:\\n    print(\\\"{} 2\\\".format(count))\\nif len(list2) == 0:\\n    print(\\\"{} 1\\\".format(count))\", \"n = int(input())\\n\\ns1 = [ int(card) for card in input().split() ]\\ns2 = [ int(card) for card in input().split() ]\\n\\ns1 = s1[1:]\\ns2 = s2[1:]\\n\\nmagic = 1000000\\n\\nfights = 0\\nflag = False\\nwhile True:\\n\\tcard1, card2 = s1.pop(0), s2.pop(0)\\n\\n\\tfights += 1\\n\\tif fights > magic:\\n\\t\\tflag = True\\n\\t\\tbreak\\n\\n\\tif card1 > card2:\\n\\t\\ts1.append(card2)\\n\\t\\ts1.append(card1)\\n\\telse:\\n\\t\\ts2.append(card1)\\n\\t\\ts2.append(card2)\\n\\n\\tif s1 == []:\\n\\t\\twinner = 2\\n\\t\\tbreak\\n\\tif s2 == []:\\n\\t\\twinner = 1\\n\\t\\tbreak\\n\\nif flag:\\n\\tprint(-1)\\nelse:\\n\\tprint(fights, winner)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nn = int(input())\\nc1 = list(map(int,input().split()))[1:]\\nc2 = list(map(int,input().split()))[1:]\\n\\ndef check(c1,c2):\\n    t1,t2 = c1.pop(0),c2.pop(0)\\n    if t1 < t2:\\n        c2 += [t1,t2]\\n    else:\\n        c1 += [t2,t1]\\n\\ncount = 0\\nwhile c1 != [] and c2 != []:\\n    prev_c1,prev_c2 = c1[:],c2[:]\\n    check(c1,c2)\\n    if count > 10000:\\n        break\\n    count += 1\\nelse:\\n    print(count, 2 if c1 == [] else 1)\\n    quit()\\nprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\nif state==10000:\\n\\tprint(-1)\\n\", \"x=int(input())\\nA=list(map(int,input().split()))\\nA=A[1:]\\n#print(A)\\nD=A\\n#print(D)\\nB=list(map(int,input().split()))\\nB=B[1:]\\nE=B\\nC=[]\\n#print(A)\\n#print(B)\\ncount=0\\nnum=1000\\nwhile(num>0):\\n\\tif count==999:\\n\\t\\tstate=10000\\n\\t\\tbreak\\n\\t#print(D)\\n\\tstate=-100\\n\\tif A==C:\\n\\t\\tstate=10\\n\\t\\tbreak\\n\\tif B==C:\\n\\t\\tstate=100\\n\\t\\tbreak\\n\\tif A[0]>B[0]:\\n\\t\\tA.append(B[0])\\n\\t\\tA.append(A[0])\\n\\t\\tA=A[1:]\\n\\t\\tB=B[1:]\\n\\t\\tcount=count+1\\n\\t\\t#print(A,B)\\n\\t\\tstate=0\\n\\t\\tnum=num-1\\n\\tif state!=0:\\t\\n\\t\\tif B[0]>A[0]:\\n\\t\\t\\tB.append(A[0])\\n\\t\\t\\tB.append(B[0])\\n\\t\\t\\tB=B[1:]\\n\\t\\t\\tA=A[1:]\\n\\t\\t\\tcount=count+1\\n\\t\\t\\t#print(A,B)\\n\\t\\t\\tnum=num-1\\n\\t#if A==D:\\n\\t#\\tif B==E:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\n\\t#if A==E:\\n\\t#\\tif B==D:\\n\\t#\\t\\tstate=1000\\n\\t#\\t\\tbreak\\nif state==10:\\n\\tprint(count,2)\\nif state==100:\\n\\tprint(count,1)\\n#CODE BASED ON THE TEST CASES\\n#MAHESH JASTI\\n#IIIT HYDERABAD\\nif state==10000:\\n\\tprint(-1)\\n\"]",
        "difficulty": "interview",
        "input": "10\n8 1 6 5 3 8 7 10 4\n2 9 2\n",
        "output": "40 1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/546/C"
    },
    {
        "id": 626,
        "task_id": 1164,
        "test_case_id": 1,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "chipsy48.32televizor12.390\n",
        "output": "12.438.32\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 627,
        "task_id": 1164,
        "test_case_id": 2,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "a1b2c3.38\n",
        "output": "6.38\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 628,
        "task_id": 1164,
        "test_case_id": 3,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "aa0.01t0.03\n",
        "output": "0.04\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 629,
        "task_id": 1164,
        "test_case_id": 4,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "test0.50test0.50\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 630,
        "task_id": 1164,
        "test_case_id": 6,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "tcjbjlbtjf329.910\n",
        "output": "329.910",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 631,
        "task_id": 1164,
        "test_case_id": 7,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "iwpcfsmzen297.618.42ff585.209.84\n",
        "output": "882.828.26\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 632,
        "task_id": 1164,
        "test_case_id": 8,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "dpinb27.277fwxpdbfg709.917vocemjru16.491ade860.722tvb870.469.51wrpgy565.046gddrwv202.271.28\n",
        "output": "3.252.193.79\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 633,
        "task_id": 1164,
        "test_case_id": 9,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "vayscqiwpc686.919.75bwyudkz759.174kgqq444.563.54feupje806.486.78vojngmlc385.668.02jrkzbsa819.334b32.509wmjg980.332yh894.786hw356.243oiuueu662.016ychbsklfln21.860.87p836.999.94huhiiqlqoc596.917.99\n",
        "output": "8.283.810.89\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 634,
        "task_id": 1164,
        "test_case_id": 10,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "amhppqxei543.370.32o544.196nocwgxticn776.562nm212.195dcftrrg635.773n646.814.94vrfmjjsgoi405.114k821.983.12rb749.955.62jifmdlgs615.101hg42.083.41gdqififg908.729qrrgopyn684.451avcjul727.150s864.068bcd196.732.37jd349.984.25ghn379.763.11dw881.650.19eysthrm790.534.68gilg546.048qs648.876pdudevipn986.325jcwqq376.669.92qp169.861qyjguum254.785.35kcxgl820.940adtenavaj279.104naaxcl531.444.02jh478.042.53\n",
        "output": "16.868.306.83\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 635,
        "task_id": 1164,
        "test_case_id": 11,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "aasf0.01egfr0.50edfasdf0.99rwer999.999.99\n",
        "output": "1.000.001.49\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 636,
        "task_id": 1164,
        "test_case_id": 14,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "r0.30q0.10\n",
        "output": "0.40\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 637,
        "task_id": 1164,
        "test_case_id": 15,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "asd0.03sgbgfh0.27\n",
        "output": "0.30\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 638,
        "task_id": 1164,
        "test_case_id": 16,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "sadfa4.44f0.56\n",
        "output": "5",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 639,
        "task_id": 1164,
        "test_case_id": 17,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "tr999.999.99r0.01\n",
        "output": "1.000.000",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 640,
        "task_id": 1164,
        "test_case_id": 18,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "f999.999.99fsdf0.01wef1.10dfs2.90\n",
        "output": "1.000.004",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 641,
        "task_id": 1164,
        "test_case_id": 23,
        "question": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name_1price_1name_2price_2...name_{n}price_{n}\", where name_{i} (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and price_{i} (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:  \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,  \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid. \n\nWrite a program that will find the total price of all purchases in the given bill.\n\n\n-----Input-----\n\nThe only line of the input contains a non-empty string s with length not greater than 1000 — the content of the bill.\n\nIt is guaranteed that the bill meets the format described above. It is guaranteed that each price in the bill is not less than one cent and not greater than 10^6 dollars.\n\n\n-----Output-----\n\nPrint the total price exactly in the same format as prices given in the input.\n\n\n-----Examples-----\nInput\nchipsy48.32televizor12.390\n\nOutput\n12.438.32\n\nInput\na1b2c3.38\n\nOutput\n6.38\n\nInput\naa0.01t0.03\n\nOutput\n0.04",
        "solutions": "[\"3\\n\\ns = input()\\nalph = ''.join([chr(ord('a') + x) for x in range(26)])\\nl = [[]]\\nfor x in s:\\n    if x not in alph:\\n        l[-1].append(x)\\n    else:\\n        if len(l[-1]):\\n            l.append([])\\nl = list([''.join(x) for x in l])\\nansa = 0\\nansb = 0\\nfor t in l:\\n    if len(t) > 2 and t[-3] == '.':\\n        ansb += int(t[-2:])\\n        t = t[:-3]\\n    ansa += int(''.join(t.split('.')))\\nansa += ansb // 100\\nansb %= 100\\nansa = str(ansa)\\nans = []\\nlast = len(ansa)\\nfor x in range(len(ansa) - 3, -1, -3):\\n    ans.append(ansa[x:last])\\n    last = x\\nif last != 0:\\n    ans.append(ansa[:last])\\nans.reverse()\\nif ansb != 0:\\n    ans.append(\\\"%02d\\\" % ansb)\\nprint(\\\".\\\".join(ans))\\n\", \"s = input()\\nl = ''.join(list((map(lambda x : x if ord('0') <= ord(x) <= ord('9') or x == '.' else ' ', list(s)))))\\n\\ndef readnum(s):\\n    if len(s) >= 3 and s[-3] == '.':\\n        a = s[:-3]\\n        b = s[-2:]\\n    else:\\n        a = s\\n        b = '00'\\n    a = ''.join(list(filter(lambda x : x != '.', a)))\\n    return (a,b)\\nl = list(map(readnum,l.split()))\\na,b = (0,0)\\nfor (x,y) in l:\\n    a += int(x)\\n    b += int(y)\\na += b//100\\nb = b%100\\n\\na = str(a)\\n\\nna = ''\\nnd = 0\\nfor c in a[::-1]:\\n    if nd % 3 == 0 and len(na) != 0:\\n        na = '.' + na\\n    na = c + na\\n    nd += 1\\n\\nprint(na, end='')\\nif b:\\n    print('.%02d' % b)\\n\", \"# You lost the game.\\ns = str(input())\\nn = len(s)\\ni = 0\\nr = 0\\nA = \\\"0123456789.\\\"\\nwhile i < n:\\n    while A.count(s[i]) == 0:\\n        i += 1\\n    p = \\\"\\\"\\n    while i < n and A.count(s[i]):\\n        p += s[i]\\n        i += 1\\n    E = list(p.split(\\\".\\\"))\\n    #print(p,E)\\n    e = len(E)\\n    if len(E[e-1]) == 2:\\n        v = 0\\n        for j in range(e-1):\\n            v = v*1000 + int(E[j])\\n        v = v*100 + int(E[e-1]) \\n    else:\\n        v = 0\\n        for j in range(e):\\n            v = v*1000 + int(E[j])\\n        v *= 100\\n    r += v\\n#print(r)\\nR = str(r)\\nm = len(R)-2\\nres = \\\"\\\"\\nif m > 0:\\n    res = R[:m%3]\\n    for i in range(m%3,m,3):\\n        if i>0:\\n            res += \\\".\\\"+R[i:i+3]\\n        else:\\n            res += R[i:i+3]\\nif m <= 0:\\n    res += \\\"0\\\"\\nif m == -1:\\n    res += \\\".0\\\"+R[m+1]\\nelif R[m:m+2] != \\\"00\\\":\\n    res += \\\".\\\" + R[m:m+2]\\n\\nprint(res)\\n\\n    \\n\\n\", \"s = input()\\ncurnum = 0\\nans = 0\\ndr = 0\\nn = len(s)\\ns += 'aaa'\\ni = 0\\nwhile i < n:\\n    #print(i, curnum)\\n    if '0' <= s[i] <= '9':\\n        curnum = 10 * curnum + int(s[i])\\n    elif s[i] == '.':\\n        if ('0' <= s[i + 1] <= '9') and ('0' <= s[i + 2] <= '9') and not('0' <= s[i + 3] <= '9'):\\n            dr += (10 * int(s[i + 1]) + int(s[i + 2]))\\n            i = i + 2\\n    else:\\n        ans += curnum\\n        curnum = 0\\n    i += 1\\nans += curnum\\nans += dr // 100\\nans2 = dr % 100\\nif ans2 == 0:\\n    ans2 = ''\\nelif ans2 < 10:\\n    ans2 = '.0' + str(ans2)\\nelse:\\n    ans2 = '.' + str(ans2)\\nans = int(ans)\\nans = str(ans)\\nnans = ''\\nfor i in range(len(ans)):\\n    if i % 3 == 0 and i != 0:\\n        nans += '.'\\n    nans += ans[len(ans) - 1 - i]\\nprint(nans[::-1] + ans2)\\n\\n\", \"s = input()\\nname = False\\ns2 = '0'\\ncnt = 0\\npointsPresent = False\\nsum = 0\\nfor i in range(len(s)):\\n    if s[i] in \\\"1234567890.\\\":\\n        name = False\\n    else:\\n        name = True\\n    if name:\\n        if cnt == 3 or not pointsPresent:\\n            sum += int(s2) * 100\\n        else:\\n            sum += int(s2)\\n        s2 = \\\"0\\\"\\n        cnt = 0\\n        pointsPresent = False\\n    else:\\n        if s[i] != '.':\\n            s2 += s[i]\\n            cnt += 1\\n        else:\\n            cnt = 0\\n            pointsPresent = True\\nif cnt == 3 or not pointsPresent:\\n    sum += int(s2) * 100\\nelse:\\n    sum += int(s2)\\n\\nif sum < 10:\\n    print(\\\"0.0\\\" + str(sum))\\nelif sum < 100:\\n    print(\\\"0.\\\" + str(sum))\\nelse:\\n    if sum % 100 == 0:\\n        sum //= 100\\n        c = -1\\n    else:\\n        c = 0\\n    s3 = str(sum)\\n    for i in range(len(s3) - 1, -1, -1):\\n        c += 1\\n        if c == 3:\\n            c = 0\\n            s3 = s3[:i + 1] + '.' + s3[i + 1:]\\n    print(s3)\", \"import sys, math\\ns = input()\\ngg = 0\\ni = 0\\ndbl = 0\\nwhile i < len(s):\\n    if 'a' <= s[i] <= 'z':\\n        i += 1\\n        continue\\n    h = '000'\\n    while i < len(s) and  not 'a' <= s[i] <= 'z':\\n        h += s[i]\\n        i += 1\\n    ans = ''\\n    if h[-3] == '.':\\n        dbl += int(h[-2:])\\n        h = h[:-3] \\n    for z in h:\\n        if z != '.':\\n            ans += z\\n    gg += int(ans)\\n#print(gg, dbl)\\ndd = []\\ngg += dbl // 100\\ndbl = dbl % 100\\ngg = gg\\nif dbl != 0:\\n    dbl = str(dbl)\\n    while len(dbl) < 2:\\n        dbl = '0' + dbl\\n    dd.append(dbl)\\n#print(dd)\\nif gg == 0:\\n    dd.append(0)\\nwhile gg != 0:\\n    dd.append(str(gg % 1000))\\n    if (gg >= 1000):\\n        while len(dd[-1]) < 3:\\n            dd[-1] = '0' + dd[-1]\\n    gg //= 1000\\ndd.reverse()\\nprint(*dd, sep = '.')\\n    \\n\\n    \\n            \\n        \\n\", \"s = input().strip()\\ndc = set()\\n\\nfor i in range(ord('0'), ord('9') + 1):\\n    dc.add(chr(i))\\n\\ndc.add('.')\\n\\ns1 = \\\"\\\"\\nfor i in range(1, len(s)):\\n    if s[i] in dc and s[i - 1] not in dc:\\n        s1 += \\\" \\\"\\n    if s[i] in dc:\\n        s1 += s[i]\\n\\na = []\\ns = s1.split(' ')\\nrub = 0\\ncop = 0\\nfor i in s:\\n    if i != \\\"\\\":\\n        left = \\\"00\\\"\\n        right = \\\"\\\"\\n        if len(i) >= 4 and i[-3] == '.':\\n            left = i[-2:]\\n            right = i[:-3]\\n        else:\\n            right = i\\n        rt = \\\"\\\"\\n        for j in right:\\n            if j != '.':\\n                rt += j\\n        rub += int(rt)\\n        cop += int(left)\\n\\nrub += cop // 100\\ncop -= (cop // 100) * 100\\nanss = \\\"\\\"\\nrubs = str(rub)\\ncnt = 1\\nfor i in range(len(rubs) - 1, -1, -1):\\n    anss += rubs[i]\\n    if cnt % 3 == 0:\\n        anss += '.'\\n    cnt += 1\\nanss = list(anss)\\nanss.reverse()\\nif anss[0] == '.':\\n    anss = anss[1:]\\nanss = ''.join(anss)\\nprint(anss, end='')\\nif cop != 0:\\n    print('.', end='')\\n    if cop < 10:\\n        print(0, end='')\\n    print(cop, end='')\\n\", \"#!/usr/bin/env python3\\n\\nimport decimal\\nimport itertools\\n\\n\\ndef is_digit_or_dot(char):\\n    return char.isdigit() or char == \\\".\\\"\\n\\n\\ndef compute(bill):\\n    prices = []\\n    for k, v in itertools.groupby(bill, is_digit_or_dot):\\n        if not k:\\n            continue\\n        segments = \\\"\\\".join(v).split(\\\".\\\")\\n        if len(segments[-1]) == 2:\\n            cent = decimal.Decimal(\\\".\\\" + segments[-1])\\n            dollar = decimal.Decimal(\\\"\\\".join(segments[:-1]))\\n            price = cent + dollar\\n        else:\\n            price = decimal.Decimal(\\\"\\\".join(segments))\\n        prices.append(price)\\n    amount = sum(prices)\\n    dollar, cent = divmod(amount, 1)\\n    ans = \\\"{:,d}\\\".format(int(dollar)).replace(\\\",\\\", \\\".\\\")\\n    if cent > 0:\\n        ans += str(cent)[1:]\\n    return ans\\n\\n\\ndef main():\\n    print(compute(input()))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def f(t):\\n    if t == '':\\n        return 0\\n    m = len(t)\\n    if '.' not in t:\\n        return int(t) * 100\\n    if t[-3] != '.':\\n        t += '00'\\n    t2 = ''.join([i for i in t if i != '.'])\\n    return int(t2)\\n\\ndef wr(x):\\n    if x < 100:\\n        res = '0.'\\n        if x < 10: res += '0'\\n        res += str(x)\\n        return res\\n    x = str(x)\\n    m = len(x)\\n    res = x[-2:]\\n    for i in range(m - 2, 2, -3):\\n        res = x[i - 3:i] + '.' + res\\n    res = x[0: (m - 2) % 3] + '.' + res\\n    if res[0] == '.': res = res[1:]\\n    if res[-2:] == '00': res = res[:-3]\\n    return res\\n\\ns = input() + '_'\\nnum = '1234567890.'\\nans = 0\\nn = len(s)\\ncur = ''\\nfor i in range(n):\\n    if s[i] not in num:\\n        ans += f(cur)\\n        cur = ''\\n    else:\\n        cur += s[i]\\nprint(wr(ans))\\n\", \"s = input()\\nans = 0\\nd = \\\"\\\"\\nfor i in range(len(s)):\\n    if s[i] in \\\"0123456789.\\\":\\n        d += s[i]\\n    else:\\n        si = \\\"\\\"\\n        if len(d):\\n            for j in range(len(d)):\\n                if d[j] != \\\".\\\":\\n                    si += d[j]\\n            si1 = int(si)\\n            if (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n                si1 *= 100\\n            #print(si1)\\n            ans += si1\\n        d = \\\"\\\"\\nsi = \\\"\\\"\\nfor j in range(len(d)):\\n    if d[j] != \\\".\\\":\\n        si += d[j]\\n    si1 = int(si)\\nif (len(d) >= 3 and d[-3] != \\\".\\\") or len(d) < 3:\\n    si1 *= 100\\nans += si1\\nif ans < 10:\\n    print(\\\"0.0{}\\\".format(ans))\\nelif ans < 100:\\n    print(\\\"0.{}\\\".format(ans))\\nelse:\\n    ansl = str(ans)[::-1]\\n    ansi = ansl[0] + ansl[1] + \\\".\\\"\\n    for i in range(2, len(ansl)):\\n        if i % 3 == 2 and i != 2:\\n            ansi += \\\".\\\"\\n        ansi += ansl[i]\\n    if ans % 100 == 0:\\n        a = ansi[::-1]\\n        print(a[:-3])\\n    else:\\n        print(ansi[::-1])\", \"\\nlat='qwertyuiopasdfghjklzxcvbnm'\\nlats=[]\\nlats+=lat\\nc=str(input())\\nfor i in lats:\\n    c=c.replace(i,' ')\\nc=c.split()\\n#print(c)\\n\\nk=0\\nfor i in c:\\n    j=int(i.replace('.',''))\\n    i=i.replace('.',' ')\\n    \\n    i=i.split()\\n    if len(i[len(i)-1])!=2 or len(i)==1:\\n        j*=100\\n    #print(j)\\n    k+=j\\n#print(k)\\nprint(format(k//100,',d').replace(',','.'),end='')\\nif k%100!=0:\\n    print(\\\".%02d\\\" % (k%100))\\n\", \"s = input().strip()\\ni = 0\\nalph = 'abcdefjhigklmnopqrstuwvxyz'\\nans = 0\\nwhile i < len(s):\\n    if s[i] in alph:\\n        i += 1\\n    else:\\n        j = i\\n        while j < len(s) and (s[j] in '1234567890' or s[j] == '.'):\\n            j += 1\\n        c = s[i:j]\\n        fl = False\\n        for k in range(len(c) - 1, -1, -1):\\n            if c[k] == '.':\\n                fl = True\\n                if len(c) - k - 1 == 3:\\n                    c += '00'\\n                break\\n        if not fl:\\n            c += '00'\\n        a = ''\\n        for k in c:\\n            if k != '.':\\n                a = a + k\\n        #print(a)\\n        ans += int(a)\\n        i = j\\nan = str(ans)\\na = ''\\nif len(an) < 3:\\n    an = '0' * (3 - len(an)) + an\\na += an[-1]\\na += an[-2]\\na += '.'\\ni = 0\\n#print(an)\\nfor k in range(len(an) - 3, -1, -1):\\n    a += an[k]\\n    i += 1\\n    if i == 3 and k > 0:\\n        a += '.'\\n        i = 0\\nfl = False\\nif ans % 100 == 0:\\n    fl = True\\n\\nfor i in range(len(a) - 1, -1, -1):\\n    if not fl or i > 2:\\n        print(a[i], end='')\\n\\n\\n\", \"s = input().rstrip()\\nfor i in range(ord('a'), ord('z') + 1):\\n    s = 'z'.join(s.split(chr(i)))\\ns = list(s.split('z'))\\nans = 0\\nans2 = 0\\nfor i in s:\\n    if len(i) == 0:\\n        continue\\n    q = i.split('.')\\n    if len(q) == 1 or len(q[-1]) == 3:\\n        ans += int(''.join(q))\\n    else:\\n        ans += int(''.join(q[:len(q)-1]))\\n        ans2 += int(q[-1])\\nans += ans2 // 100\\nans2 %= 100\\nd = ''\\nif ans2 != 0:\\n    d = str(ans2)\\n    d = '.' + '0' * (2 - len(d)) + d\\na = []\\nans = int(ans)\\nwhile ans >= 1000:\\n    a.append('.' + '0' * (3 - len(str(ans % 1000))) + str(ans % 1000))\\n    ans //= 1000\\na.append(str(ans))\\na.reverse()\\nprint(''.join(a) + d)\\n\", \"from decimal import *\\n\\n# newstr = oldstr.replace(\\\"M\\\", \\\"\\\")\\n\\ndef add(l):\\n\\tnum = list()\\n\\tfor v in l:\\n\\t\\tif v != '.':\\n\\t\\t\\tnum.append(v)\\n\\tnum = int(''.join(num))\\n\\tif len(l) >= 3 and l[-3] == '.':\\n\\t\\treturn num\\n\\treturn num * 100\\n\\ndef solve():\\n\\ts = input()\\n\\tres = 0\\n\\tl = list()\\n\\tfor c in s:\\n\\t\\tif c.islower():\\n\\t\\t\\tif len(l) > 0: res += add(l)\\n\\t\\t\\tl = list()\\n\\t\\telse:\\n\\t\\t\\tl.append(c)\\n\\tif len(l) > 0: res += add(l)\\n\\treturn res\\n\\ndef prt(n):\\n\\tn = str(n)\\n\\tn = n[::-1]\\n\\tfirst = True\\n\\tres = \\\"\\\"\\n\\twhile len(n) > 0:\\n\\t\\tif first:\\n\\t\\t\\ts = n[:2][::1] if len(n) >= 2 else n[:1] + '0'\\n\\t\\t\\tres += s\\n\\t\\t\\tres += '.'\\n\\t\\t\\tn = n[len(s) :]\\n\\t\\telse:\\n\\t\\t\\ttmp = \\\"\\\"\\n\\t\\t\\tfor i in range(3):\\n\\t\\t\\t\\tif len(n) == 0:\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ttmp += n[0]\\n\\t\\t\\t\\tn = n[1:]\\n\\t\\t\\ttmp += '.'\\n\\t\\t\\tres += tmp\\n\\n\\t\\tfirst = False\\n\\n\\tres = res[::-1]\\n\\n\\tif len(res) == 3:\\n\\t\\tres = '0' + res\\n\\telse:\\n\\t\\tif res[0] == '.':\\n\\t\\t\\tres = res[1:]\\n\\tif len(res) >= 3 and res[-1] == '0' and res[-2] == '0' and res[-3] == '.':\\n\\t\\tres = res[:-3]\\n\\treturn res\\n\\nprint(prt(solve()))\", \"q=input()\\na=[]\\nw=len(q)\\ni=w-1\\nwhile i>0:\\n\\tif '0'<=q[i]<='9':\\n\\t\\tj=i-1\\n\\t\\twhile not('a'<=q[j]<='z'):\\n\\t\\t\\tj-=1\\n\\t\\ta.append(q[j+1:i+1])\\n\\t\\ti=j\\n\\ti-=1\\ns=0\\nfor i in a:\\n\\tl=len(i)\\n\\tif l>2:\\n\\t\\tif i[l-3]=='.':\\n\\t\\t\\ts+=int(i[l-2:])\\n\\t\\t\\ti=i[:l-3]\\n\\t\\ti=i.replace('.','')\\n\\ts+=int(i)*100\\nd=''\\nr=s\\nif s%100!=0:\\n\\td='.'+str(s%100)\\nif len(d)==2:\\n\\td=d[0]+'0'+d[1]\\ns//=100\\nrt=s\\ntr=d\\nwhile s//1000!=0:\\n\\tt=str(s%1000)\\n\\tif len(t)==1:\\n\\t\\tt='.00'+t\\n\\telif len(t)==2:\\n\\t\\tt='.0'+t\\n\\telse:\\n\\t\\tt='.'+t\\n\\td=t+d\\n\\ts//=1000\\nif s!=0:\\n\\tt=str(s%1000)\\n\\td=t+d\\nelse:\\n\\td=d[1:]\\nif len(d)==2:\\n\\td='0.'+d\\nelif d=='':\\n\\td='0'\\nprint(d)\", \"s = input()\\nrub = 0\\nkop = 0\\ncur = 0\\nlen_cur = 0\\nfor i in range(len(s)):\\n    if 122 >= ord(s[i]) >= 97:\\n        if len_cur == 2:\\n            kop += cur - cur // 100 * 100\\n            rub += cur // 100\\n        else:\\n            rub += cur\\n        cur = 0\\n        len_cur = 0\\n    elif 57 >= ord(s[i]) >= 48:\\n        cur = 10 * cur + int(s[i])\\n        len_cur += 1\\n    elif s[i] == '.':\\n        len_cur = 0\\n        \\nif len_cur == 2:\\n    kop += cur - cur // 100 * 100\\n    rub += cur // 100\\nelse:\\n    rub += cur\\n    \\nrub += kop // 100\\nkop = kop - kop // 100 * 100\\n\\nif kop < 10: kop = '0' + str(kop)\\nkop = str(kop)\\nsrub = ''\\nif len(str(rub)) % 3 != 0:\\n    srub += str(str(rub)[:len(str(rub)) % 3]) + '.'\\n   \\nc = 0\\nfor i in range(len(str(rub)) % 3, len(str(rub))):\\n    c += 1\\n    srub += str(rub)[i]\\n    if c == 3:\\n        srub += '.'\\n        c = 0\\n\\nif kop == '00':\\n    print(srub[:-1])\\nelse:\\n    print(srub + kop)\", \"from math import *\\n\\ndef remd(x):\\n    y = []\\n    for i in x:\\n        if i != '.':\\n            y.append(i)\\n    return ''.join(y)\\n\\ndef parse(x):\\n    if '.' not in x:\\n        return int(x)\\n    i = len(x) - 1\\n    cnt = 0\\n    while x[i] != '.':\\n        i -= 1\\n        cnt += 1\\n    if cnt == 2:\\n        x1 = int(remd(x[:i]))\\n        x2 = int(x[i + 1:])\\n        return x1 + x2 / 100\\n    else:\\n        return int(remd(x))\\n\\ndef format(y):\\n    y1 = int(y)\\n    y2 = round((y - y1) * 100)\\n\\n    y1 = str(y1)\\n    yy = []\\n    for i in range(len(y1)):\\n        yy.append(y1[len(y1) - 1 - i])\\n        if i % 3 == 2 and i != len(y1) - 1:\\n            yy.append('.')\\n    yy.reverse()\\n    yy = ''.join(yy)\\n\\n    if y2 != 0:\\n        yy += '.'\\n        yy += ('%02d' % y2)\\n    return yy\\n\\ns = input()\\npr = []\\ncur = []\\nfor i in s:\\n    if '0' <= i <= '9' or i == '.':\\n        cur.append(i)\\n    else:\\n        if len(cur) > 0:\\n            pr.append(''.join(cur))\\n            cur = []\\nif len(cur) > 0:\\n    pr.append(''.join(cur))\\n\\nsm = 0\\nfor i in pr:\\n    sm += parse(i)\\nprint(format(sm))\", \"def fr(s):\\n    ans = 0\\n    was = False\\n    s = s.split('.')\\n    if len(s[-1]) == 2 and len(s) != 1:\\n        ans += int(s[-1]) / 100\\n        was = True\\n    \\n    s = s[::-1]\\n    for i in range(was, len(s)):\\n        ans += int(s[i]) * (10 ** (3 * (i - was)))\\n       \\n    return ans\\n\\n\\ndef to(n):\\n    ans =  []\\n    was = False\\n    if int(n) != n:\\n        tmp = str(n - int(n))\\n        tmp = tmp[2:]\\n        try:\\n            if tmp[2]:\\n                if tmp[2] >= \\\"5\\\":\\n                    tmp = tmp[0] + str(int(tmp[1]) + 1)\\n                else:\\n                    tmp = tmp[:2]\\n        except:\\n            pass\\n        if len(tmp) == 1:\\n            tmp += '0'\\n        ans.append(tmp)\\n        was = True\\n    n = int(n)\\n    \\n    while n > 0:\\n        tmp = str(n % 1000)\\n        if len(tmp) < 3 and n >= 1000:\\n            tmp = '0' * (3 - len(tmp)) + tmp\\n        ans.append(tmp)\\n        \\n        n //= 1000\\n    ans = ans[::-1]\\n    if was and len(ans) == 1:\\n        ans = [\\\"0\\\"] + ans\\n    \\n    return \\\".\\\".join(ans)\\n\\n\\n\\ns = input() + \\\"a\\\"\\n\\ndata = []\\nlast = 0\\nnumber = False\\nfor i in range(len(s)):\\n    if \\\"a\\\" <= s[i] and s[i] <= \\\"z\\\":\\n        if number:\\n            number = False\\n            data.append(s[last:i])\\n        continue\\n    if not number:\\n        last = i\\n        number = True\\n        \\nnums = [fr(i) for i in data]\\n\\nprint(to(sum(nums)))\", \"def get_down(i):\\n    if len(i) > 3 and i[-3] == '.':\\n        return int(i[-2:])\\n    return 0\\n\\n\\ndef get_up(ans):\\n    if len(ans) > 3 and i[-3] == '.':\\n        ans = ans[:-3]\\n    ans = ans.replace('.', '')\\n    return int(ans)\\n\\n\\ndef modify(up, down=0):\\n    ans = ''\\n    f = (up == 0)\\n    while up != 0:\\n        ans = str(up % 1000).rjust(3, '0') + '.' + ans\\n        up //= 1000\\n    ans = ans.lstrip('0')\\n    if down == 0:\\n        ans = ans[:-1]\\n    else:\\n        down = str(down).rjust(2, '0')\\n        ans += down\\n    if (f):\\n        ans = '0.' + ans\\n    return ans\\n\\ns = input().strip()\\nnumb = []\\ncur = ''\\nf = 0\\nfor i in s:\\n    if '0' <= i <= '9':\\n        f = 1\\n        cur += i\\n    elif i == '.':\\n        cur += i\\n    elif 'a' <= i <= 'z' or 'A' <= i <= 'Z':\\n        f = 0\\n        if (cur):\\n            numb.append(cur)\\n            cur = ''\\nif cur:\\n    numb.append(cur)\\n    cur = ''\\nans_up = 0\\nans_down = 0\\nfor i in numb:\\n    #print(i, get_up(i), get_down(i))\\n    ans_up += get_up(i)\\n    ans_down += get_down(i)\\nans_up += ans_down // 100\\nans_down %= 100\\nprint(modify(ans_up, ans_down))\\n\", \"s = input()\\nc = set()\\nc.add('1')\\nc.add('2')\\nc.add('3')\\nc.add('4')\\nc.add('5')\\nc.add('6')\\nc.add('7')\\nc.add('8')\\nc.add('9')\\nc.add('0')\\nc.add('.')\\n\\nans = []\\nj = 0\\nst = ''\\nfor i in range(len(s)):\\n    if s[i] in c:\\n        st += s[i]\\n    elif len(st) > 0:\\n        ans.append(st)\\n        st = ''\\nx = 0\\nans.append(st)\\nfor i in range(len(ans)):\\n    if len(ans[i]) < 3:\\n        ans[i] += '.00'\\n    if ans[i][-3] != '.':\\n        ans[i] += '.00'\\ncc = set()\\ncc.add('1')\\ncc.add('2')\\ncc.add('3')\\ncc.add('4')\\ncc.add('5')\\ncc.add('6')\\ncc.add('7')\\ncc.add('8')\\ncc.add('9')\\ncc.add('0')\\npp =''\\npk = 0\\npr = 0\\nfor i in range(len(ans)):\\n    for j in range(len(ans[i]) - 1, - 1, -1):\\n        if ans[i][j] == '.':\\n            x = j\\n            break\\n    p1 = ans[i][:x]\\n    p2 = ans[i][x + 1:]\\n    for ii in range(len(p1)):\\n        if p1[ii] in cc:\\n            pp += p1[ii]\\n    pr += int(pp)\\n    pp = ''\\n    pk += int(p2)\\nwhile pk > 99:\\n    pk -= 100\\n    pr += 1\\npk = str(pk)\\nif len(pk) < 2:\\n    pk = '0' + pk\\nanswer = str(pr) + '.' + pk\\nj = answer.index('.')\\nq = 0\\nfor i in range(j, -1, -1):\\n    if q == 2:\\n        answer = answer[:i] + '.' + answer[i:]\\n        q = 0\\n    elif answer[i] != '.':\\n        q += 1\\nif answer[-1] == '0' and answer[-2] == '0' and answer[-3] == '.':\\n    answer = answer[:-3]\\nif answer[0] == '.':\\n    answer = answer[1:]\\nprint(answer)\\n    \\n\\\"\\\"\\\"\\n        ans[j] = ans[j] * 10 + int(s[i])\\n    elif s[i] == '.':\\n        ans[j] *= 100\\\"\\\"\\\"\", \"s = input()\\nms = ['']\\ndct = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.'}\\np = 0\\nfor i in s:\\n    if i in dct:\\n        ms[-1] += i\\n        p = 1\\n    else:\\n        if p:\\n            ms.append('')\\n            p = 0\\nrub = 0\\nkop = 0\\nif ms[0] == '':\\n    ms = []\\nfor i in ms:\\n    box = i.split('.')\\n    l = len(box)\\n    a = 0\\n    b = 0\\n    p = 0\\n    for j in range(l - 1, -1, -1):\\n        if len(box[j]) == 2 and j == l - 1:\\n            b = int(box[j])\\n            p = 1\\n        else:\\n            a += int(box[j]) * (1000 ** (l - 1 - j - p))\\n    rub += a\\n    kop += b\\nrub += kop // 100\\nkop %= 100\\n\\ns = str(rub)\\nl = len(s)\\nd = l % 3\\nret = ''\\nind = 0\\nif d:\\n    ind = d\\n    for i in range(d):\\n        ret += s[i]\\n    ret += '.'\\ncnt = 0\\nfor i in range(ind, l):\\n    ret += s[i]\\n    cnt += 1\\n    cnt %= 3\\n    if not cnt:\\n        ret += '.'\\nif kop:\\n    if kop < 10:\\n        ret += '0'\\n    ret += str(kop)\\n    print(ret)\\nelse:\\n    l = len(ret)\\n    for i in range(0, l - 1, 1):\\n        print(ret[i], end = '')\\n\\n    \\n    \\n            \\n        \", \"from decimal import Decimal\\ncheck = input()\\ncheck = check + 'a'\\nbukvi = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'a', 's', 'd', 'f' ,'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\\nflag = 0\\nnumber = []\\nnumbers = []\\nfor symvol in check:\\n    if flag == 0:\\n        if symvol not in bukvi:\\n            flag = 1\\n    if flag == 1:\\n        if symvol not in bukvi:\\n            number += symvol\\n        else:\\n            numbers += [number]\\n            number = []\\n            flag = 0\\nans = 0\\nfor num in numbers:\\n    integ = []\\n    for i in range(len(num)):\\n        if num[i] != '.':\\n            integ += num[i]\\n        else:\\n            if i == len(num) - 3:\\n                integ += [num[i]]\\n    ans += Decimal(''.join(integ))\\nans = str(ans)\\nif len(ans) >3 and ans[-1] == ans[-2] == '0' and ans[-3] == '.':\\n    ans = ans[:-3]\\nres = []\\ncnt = 0\\nif len(ans) > 3 and ans[-3] == '.':\\n    for i in range(len(ans) - 4, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\n    res += ans[-3:]\\nelse:\\n    for i in range(len(ans) - 1, -1, -1):\\n        if cnt == 3:\\n            res += ['.']\\n            cnt = 0\\n        res += ans[i]\\n        cnt += 1\\n    res.reverse()\\nprint(''.join(res))\\n           \\n\", \"def num(a):\\n    if len(a) < 4:\\n        return int(a) * 100\\n    q = 1\\n    if a[-3] != '.':\\n        q = 100\\n    b = ''\\n    for i in a:\\n        if i != '.':\\n            b += i\\n    print\\n    return int(b) * q\\n\\na = input()\\nb = 0\\nnn = ''\\nq = 2\\nfor i in a:\\n    if i not in '1234567890.':\\n        if len(nn) > 0:\\n            b += num(nn)\\n        nn = ''\\n    else:\\n        nn += i\\nif len(nn) > 0:\\n    b += num(nn)\\na = [b % 100]\\nb //= 100\\nwhile b != 0:\\n    a = [b % 1000] + a\\n    b //= 1000\\nif len(a) == 1:\\n    print(0, end='')\\n    if a[0] != 0:\\n        print('.', a[0] // 10, a[0] % 10, sep='')\\nelse:\\n    if a[-1] == 0:\\n        for i in range(1, len(a)):\\n            a[i] = str(a[i]).zfill(3)\\n        a[0] = str(a[0])\\n        print('.'.join(a[:-1]))\\n    else:\\n        for i in range(1, len(a) - 1):\\n            a[i] = str(a[i]).zfill(3)\\n        a[-1] = str(a[-1]).zfill(2)\\n        a[0] = str(a[0])\\n        print('.'.join(a))\", \"import re\\no=input\\nC=len\\nE=float\\nF=int\\nd=print\\nU=sum\\nS=re.findall\\nl=o()\\ne=S(\\\"[\\\\d\\\\.]+\\\",l)\\ndef p(u):\\n u=u.split('.')\\n if C(u[-1])==2 and C(u)>1:\\n  G=u[-1]\\n  return E(\\\"\\\".join(u[:-1])+\\\".\\\"+G)\\n else:\\n  return F(\\\"\\\".join(u))\\ndef V(flo):\\n if F(flo)==flo:\\n  return '{:,}'.format(F(flo)).replace(',','.')\\n else:\\n  return '{:,.2f}'.format(flo).replace(',','.')\\ne=[p(num)for num in e]\\nd(V(U(e)))\\n\", \"s = str(input())\\ns = s[::-1]\\n\\ncurrent = \\\"\\\"\\nanswer = 0\\n\\nfor el in s:\\n    if '9' >= el >= '0':\\n        current += el\\n    elif el == '.':\\n        if len(current) == 2:\\n            current += '.'\\n    else:\\n        if current != '':\\n            answer += float(current[::-1])\\n            current = ''\\n\\ntemp = \\\"%.2f\\\" % answer\\nif temp[len(temp) - 2:] != '00':\\n    temp_2 = temp[:len(temp) - 3][::-1]\\n    temp = temp[len(temp) - 2:]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.', end='.')\\n    print(temp)\\n\\nelse:\\n    temp_2 = str(int(answer))[::-1]\\n    parts = []\\n    current = \\\"\\\"\\n    for i in range(len(temp_2)):\\n        current += temp_2[i]\\n        if len(current) == 3:\\n            parts.append(current[::-1])\\n            current = ''\\n    if current != '':\\n        parts.append(current[::-1])\\n    print(*parts[::-1], sep='.')\"]",
        "difficulty": "interview",
        "input": "kapusta123.456\n",
        "output": "123.456",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/727/B"
    },
    {
        "id": 642,
        "task_id": 1737,
        "test_case_id": 6,
        "question": "Polycarp is currently developing a project in Vaja language and using a popular dependency management system called Vamen. From Vamen's point of view both Vaja project and libraries are treated projects for simplicity.\n\nA project in Vaja has its own uniqie non-empty name consisting of lowercase latin letters with length not exceeding 10 and version — positive integer from 1 to 10^6. Each project (keep in mind that it is determined by both its name and version) might depend on other projects. For sure, there are no cyclic dependencies.\n\nYou're given a list of project descriptions. The first of the given projects is the one being developed by Polycarp at this moment. Help Polycarp determine all projects that his project depends on (directly or via a certain chain). \n\nIt's possible that Polycarp's project depends on two different versions of some project. In this case collision resolving is applied, i.e. for each such project the system chooses the version that minimizes the distance from it to Polycarp's project. If there are several options, the newer (with the maximum version) is preferred. This version is considered actual; other versions and their dependencies are ignored.\n\nMore formal, choose such a set of projects of minimum possible size that the following conditions hold:   Polycarp's project is chosen;  Polycarp's project depends (directly or indirectly) on all other projects in the set;  no two projects share the name;  for each project x that some other project in the set depends on we have either x or some y with other version and shorter chain to Polycarp's project chosen. In case of ties the newer one is chosen. \n\nOutput all Polycarp's project's dependencies (Polycarp's project itself should't be printed) in lexicographical order.\n\n\n-----Input-----\n\nThe first line contains an only integer n (1 ≤ n ≤ 1 000) — the number of projects in Vaja.\n\nThe following lines contain the project descriptions. Each project is described by a line consisting of its name and version separated by space. The next line gives the number of direct dependencies (from 0 to n - 1) and the dependencies themselves (one in a line) in arbitrary order. Each dependency is specified by its name and version. The projects are also given in arbitrary order, but the first of them is always Polycarp's. Project descriptions are separated by one empty line. Refer to samples for better understanding.\n\nIt's guaranteed that there are no cyclic dependencies. \n\n\n-----Output-----\n\nOutput all Polycarp's project's dependencies in lexicographical order.\n\n\n-----Examples-----\nInput\n4\na 3\n2\nb 1\nc 1\n \nb 2\n0\n \nb 1\n1\nb 2\n \nc 1\n1\nb 2\n\nOutput\n2\nb 1\nc 1\n\nInput\n9\ncodehorses 5\n3\nwebfrmk 6\nmashadb 1\nmashadb 2\n \ncommons 2\n0\n \nmashadb 3\n0\n \nwebfrmk 6\n2\nmashadb 3\ncommons 2\n \nextra 4\n1\nextra 3\n \nextra 3\n0\n \nextra 1\n0\n \nmashadb 1\n1\nextra 3\n \nmashadb 2\n1\nextra 1\n\nOutput\n4\ncommons 2\nextra 1\nmashadb 2\nwebfrmk 6\n\nInput\n3\nabc 1\n2\nabc 3\ncba 2\n\nabc 3\n0\n\ncba 2\n0\n\nOutput\n1\ncba 2\n\n\n\n-----Note-----\n\nThe first sample is given in the pic below. Arrow from A to B means that B directly depends on A. Projects that Polycarp's project «a» (version 3) depends on are painted black. [Image] \n\nThe second sample is again given in the pic below. Arrow from A to B means that B directly depends on A. Projects that Polycarp's project «codehorses» (version 5) depends on are paint it black. Note that «extra 1» is chosen instead of «extra 3» since «mashadb 1» and all of its dependencies are ignored due to «mashadb 2». [Image]",
        "solutions": "[\"from collections import defaultdict\\n\\nn=int(input())\\nd=defaultdict(dict)\\nfor i in range(n):\\n    x=input()\\n    x=x.split()\\n    if i==0:\\n        P = x\\n    q=int(input())\\n    Con=[]\\n    for j in range(q):\\n        Con.append(input().split())\\n    if i!=n-1:\\n        input()\\n    d[x[0]][x[1]]=Con\\nver=[P]\\nans={}\\nwhile ver:\\n    next_ans = {}\\n    for v in ver:\\n        C=d[v[0]][v[1]]\\n        for n_v in C:\\n            if n_v[0] not in ans and n_v[0]!=P[0]:\\n                if n_v[0] in next_ans:\\n                    if int(n_v[1])>int(next_ans[n_v[0]]):\\n                        next_ans[n_v[0]]=n_v[1]\\n                else:\\n                    next_ans[n_v[0]]=n_v[1]\\n    ans.update(next_ans)\\n    ver=list(next_ans.items())\\nl=list(ans.items())\\nprint(len(l))\\nl.sort()\\nfor k,v in l:\\n    print(k,v)\\n\", \"from queue import Queue\\n\\n\\ndef BFS(v):\\n    nonlocal ans\\n\\n    stack = Queue()\\n    stack.put(v)\\n\\n    used = {p[0]: False for p in list(graph.keys())}\\n    used[v[0]] = True\\n\\n    while True:\\n        set_ = dict()\\n        st = Queue()\\n\\n        while not stack.empty():\\n            v = stack.get()\\n\\n            for u in graph[v]:\\n                n_ = u[0]\\n                if not used[n_]:\\n                    try:\\n                        set_[n_] = max(set_[n_], u[1])\\n                    except KeyError:\\n                        set_[n_] = u[1]\\n\\n        for el in list(set_.items()):\\n            ans.append(el)\\n            st.put(el)\\n            used[el[0]] = True\\n\\n        if st.empty():\\n            break\\n\\n        while not st.empty():\\n            stack.put(st.get())\\n\\n\\nn = int(input())\\ngraph = dict()\\n\\nfor i in range(n):\\n    name, ver = input().split()\\n    k = int(input())\\n    temp = set()\\n\\n    for j in range(k):\\n        name_, ver_ = input().split()\\n        temp.add((name_, int(ver_)))\\n\\n    tup = (name, int(ver))\\n    graph[tup] = temp\\n\\n    if i == 0:\\n        PP = tup\\n\\n    if i + 1 != n:\\n        input()\\n\\nans = list()\\n\\nBFS(PP)\\n\\nprint(len(ans))\\nprint('\\\\n'.join([' '.join(map(str, el)) for el in sorted(ans, key=lambda x: x[0])]))\\n\", \"# f = open(\\\"input.txt\\\")\\n# def readline():\\n    # return f.readline().strip()\\n\\ndef readline():\\n    return input()\\n\\ndef read_project():\\n    project = readline().split(\\\" \\\")\\n    project[1] = int(project[1])\\n    dep_num = int(readline())\\n    deps = {}\\n    for _ in range(0, dep_num):\\n        (proj, version) = readline().split(\\\" \\\")\\n        version = int(version)\\n        if proj in deps:\\n            deps[proj] = max(deps[proj], version)\\n        else:\\n            deps[proj] = version\\n    \\n    return (tuple(project), deps)\\n    \\ndef make_like_buck():\\n    projects_num = int(readline())\\n\\n    projects = {}\\n    polikarp_proj = None\\n    for ind in range(0, projects_num):\\n        (proj, deps) = read_project()\\n        if ind == 0:\\n            polikarp_proj = proj\\n        projects[proj] = deps\\n        if ind != projects_num - 1:\\n            readline()\\n\\n    RESULT_DEPS = {polikarp_proj[0]: polikarp_proj[1]}\\n\\n    curr_proj = [polikarp_proj]\\n    while len(curr_proj) > 0:\\n        curr_deps = {}\\n        for proj in curr_proj:\\n            new_deps = projects[proj]\\n            for proj in new_deps:\\n                if proj in RESULT_DEPS:\\n                    continue\\n                if proj in curr_deps:\\n                    curr_deps[proj] = max(curr_deps[proj], new_deps[proj])\\n                else:\\n                    curr_deps[proj] = new_deps[proj]\\n\\n        RESULT_DEPS = {**RESULT_DEPS, **curr_deps}\\n\\n        curr_proj = list(curr_deps.items())\\n\\n    RESULT_DEPS.pop(polikarp_proj[0])\\n    \\n    print(len(RESULT_DEPS))\\n    items = [\\\"%s %s\\\" % x for x in sorted(list(RESULT_DEPS.items()))]\\n    print(\\\"\\\\n\\\".join(items))\\n\\nmake_like_buck()\", \"from queue import Queue\\n\\n\\ndef main():\\n    n = int(input())\\n    d = {}\\n    res = {}\\n    start = None\\n    for i in range(n):\\n        project, version = input().split()\\n        version = int(version)\\n        if i == 0:\\n            start = project, version\\n        k = int(input())\\n        if project not in d:\\n            d[project] = {}\\n        if version not in d[project]:\\n            d[project][version] = []\\n        for j in range(k):\\n            p, v = input().split()\\n            v = int(v)\\n            d[project][version].append((p, v))\\n        if i != n-1:\\n            input()\\n    q = Queue()\\n    q.put(start)\\n    k = 1\\n    while not q.empty():\\n        append = {}\\n        for i in range(k):\\n            s_p, s_v = q.get()\\n            for (p, v) in d[s_p][s_v]:\\n                if p == start[0]:\\n                    continue\\n                if p in res:\\n                    continue\\n                if p not in append or append[p] < v:\\n                    append[p] = v\\n        k = len(append)\\n        for p in append:\\n            res[p] = append[p]\\n            q.put((p, append[p]))\\n\\n    ans = []\\n    for p in res:\\n        v = res[p]\\n        ans.append((p, v))\\n\\n    ans = sorted(ans, key= lambda z: z[0])\\n    print(len(ans))\\n    for (p, v) in ans:\\n        print(p, v)\\n\\n\\nmain()\\n\", \"n = int(input())\\n\\nnames_set = set()\\ns = {}\\nnames = []\\narr = [[] for j in range(n)]\\ng = 0\\nfor i in range(n):\\n    el = input()\\n    names_set.add(el.split()[0])\\n    ind = 0\\n    if s.get(el) is None:\\n        s[el] = g\\n        names.append(el)\\n        g += 1\\n    k = int(input())\\n    for j in range(k):\\n        el2 = input()\\n        if s.get(el2) is None:\\n            s[el2] = g\\n            names.append(el2)\\n            g += 1\\n        arr[s.get(el)].append(s.get(el2))\\n    if i != n - 1:\\n        r = input()\\n\\nres = []\\nq = []\\nq.append(0)\\nsp = {}\\nwhile len(q):\\n    el = q[0]\\n    del q[0]\\n    name, vers = names[el].split()\\n    if name in names_set:\\n        try:\\n            sp[name] = max(int(vers), sp[name])\\n        except:\\n            sp[name] = int(vers)\\n    if not len(q):\\n        for i in sp:\\n            names_set.remove(i)\\n            new_el = []\\n            new_el.append(i)\\n            new_el.append(sp[i])\\n            res.append(new_el[:])\\n            ind = s[str(new_el[0]) + \\\" \\\" + str(new_el[1])]\\n            for j in range(len(arr[ind])):\\n                p = arr[ind][j]\\n                q.append(p)\\n        sp = {}\\n\\nres = res[1:]\\nres.sort()\\nprint(len(res))\\nfor i in res:\\n    print(i[0], i[1])\", \"n = int(input())\\nprojects = {}\\nroot = None\\n\\nfor i in range(n):\\n    name, v = input().split()\\n    v = int(v)\\n    projects[ (name, v) ] = []\\n    m = int(input())\\n    \\n    for j in range(m):\\n        nn, vv = input().split()\\n        vv = int(vv)\\n        projects[ (name, v) ].append( (nn, vv) )\\n        \\n    if i < n - 1:\\n        input()\\n        \\n    if not i:\\n        root = (name, v)\\n        \\nq = set( [root, ] )\\nans = {}\\n\\nwhile q:\\n    temp = {}\\n    \\n    for u in q:\\n        for v in projects[u]:\\n            if v[0] not in ans and v[0] != root[0]:\\n                if v[0] not in temp:\\n                    temp[v[0]] = v[1]\\n                else:\\n                    temp[v[0]] = max(temp[v[0]], v[1])\\n    \\n    ans.update( temp.items() ) \\n    q = set( temp.items() )\\n    \\nprint(len(ans))\\nprint('\\\\n'.join( list( map(lambda x: ' '.join(str(c) for c in x), sorted( list(ans.items()), key = lambda item: item[0] )))))\", \"N=int(input())\\nSlide=dict()\\nSlideList=[list()]*N\\nItogInformation=set()\\nGoodNameTags=set()\\n\\nNewName,NewVer=input().split()\\nNewVer=int(NewVer)\\n\\nGoodNameTags.add(NewName)\\n\\nSlide[0]=NewName+' '+str(NewVer)\\nSlide[NewName+' '+str(NewVer)]=0\\nNewNum=int(input())\\nSlideList[0]=[0]*(NewNum+2)\\nSlideList[0][1]=NewNum\\n\\nfor i in range(1,NewNum+1):\\n    Name,Ver=input().split()\\n    SlideList[0][i+1]=Name+' '+Ver\\n    \\nfor j in range(1,N):\\n    input()\\n    NewName,NewVer=input().split()\\n    NewVer=int(NewVer)\\n    Slide[j]=NewName+' '+str(NewVer)\\n    Slide[NewName+' '+str(NewVer)]=j\\n    NewNum=int(input())\\n    SlideList[j]=[0]*(NewNum+2)\\n    SlideList[j][1]=NewNum\\n    for i in range(1,NewNum+1):\\n        Name,Ver=input().split()\\n        SlideList[j][i+1]=Name+' '+Ver\\n\\nListOfNeed=set()\\nListOfRead=set()\\nListOfRead.add(Slide[0])\\n\\nwhile len(ListOfRead)!=0:\\n    ListOfNeed=ListOfRead.copy()\\n    ListOfRead=set()\\n    found=dict()\\n    for i in ListOfNeed:\\n        for j in range(SlideList[Slide[i]][1]):\\n            Name,Ver=SlideList[Slide[i]][j+2].split()\\n            Ver=int(Ver)\\n            key=found.pop(Name, -1)\\n            if key==-1 or key<Ver:\\n                found[Name]=Ver\\n            else:\\n                found[Name]=key\\n    for i in list(found.keys()):\\n        if not (i in GoodNameTags):\\n            GoodNameTags.add(i)\\n            ListOfRead.add(i+' '+str(found[i]))\\n            ItogInformation.add(i+' '+str(found[i]))\\n    \\nOtvet=list(ItogInformation)\\nOtvet.sort()            \\n\\nprint(len(Otvet))\\nfor i in range(len(Otvet)):\\n    print(Otvet[i])\\n\\n\", \"n = int(input())\\n\\nd = {}\\n\\nfor x in range(n):\\n    if x == 0:\\n        L, R = map(str, input().split())\\n        R = int(R)\\n        l = L\\n        r = R\\n        if not (l, int(r)) in d:\\n            d[(l, int(r))] = []\\n        m = int(input())\\n        for y in range(m):\\n            l1, r1 = map(str, input().split())\\n            d[(l, int(r))].append((l1, int(r1)))\\n        if x != n - 1:\\n            s = input()\\n    else:\\n        l, r = map(str, input().split())\\n        if not (l, int(r)) in d:\\n            d[(l, int(r))] = []\\n        m = int(input())\\n        for y in range(m):\\n            l1, r1 = map(str, input().split())\\n            d[(l, int(r))].append((l1, int(r1)))\\n        if x != n - 1:\\n            s = input()\\n\\nlst = []\\narray = [L]\\n\\n#print(d)\\ntemp1 = [(L, R)]\\ntemp2 = []\\nk1 = 0\\nk2 = 1\\nwhile k1 < len(temp1) or k2 < len(temp2):\\n    if k2 > len(temp2):\\n        while k1 < len(temp1):\\n            for (a, b) in d[temp1[k1]]:\\n                temp2.append((a, -b))\\n            k1 += 1\\n        temp2.sort()\\n        temp = []\\n        for (a, b) in temp2:\\n            if not a in array:\\n                array.append(a)\\n                lst.append((a, -b))\\n                temp.append((a, -b))\\n        temp2 = temp[:]\\n        temp1 = []\\n        k1 = 1\\n        k2 = 0\\n    elif k1 > len(temp1):\\n        while k2 < len(temp2):\\n            for (a, b) in d[temp2[k2]]:\\n                temp1.append((a, -b))\\n            k2 += 1\\n        temp1.sort()\\n        temp = []\\n        for (a, b) in temp1:\\n            if not a in array:\\n                array.append(a)\\n                lst.append((a, -b))\\n                temp.append((a, -b))\\n        temp1 = temp[:]\\n        temp2 = []\\n        k2 = 1\\n        k1 = 0        \\n\\nprint(len(lst))\\nlst.sort()\\nfor (a, b) in lst:\\n    print(a, b)\", \"levels = []\\n\\nconnect = dict()\\n\\nn = int(input())\\nk = input().split()\\nlevels.append({k[0]: int(k[1])})\\nconnect[k[0]+' '+str(k[1])] = []\\nd = int(input())\\n\\nfor i in range(d):\\n    connect[k[0]+' '+str(k[1])].append(input())\\n\\n\\nfor i in range(n-1):\\n    s = input()\\n    s = input()\\n    connect[s] = []\\n    k = int(input())\\n    for j in range(k):\\n        connect[s].append(input())\\n\\nlev = 0\\nwhile len(levels[len(levels)-2]):\\n    levels.append(dict())\\n    for projname in levels[lev]:\\n        listing = connect[projname + ' ' + str(levels[lev][projname])]\\n        for i in listing:\\n            name = i.split()\\n            gov = True\\n            #\\u043f\\u0440\\u043e\\u0432\\u0435\\u0440\\u043a\\u0430, \\u0435\\u0441\\u0442\\u044c \\u043b\\u0438 \\u044d\\u0442\\u043e\\u0442 \\u043f\\u0440\\u043e\\u0435\\u043a\\u0442 \\u0432 \\u043f\\u0440\\u0435\\u0434\\u044b\\u0434\\u0443\\u0449\\u0438\\u0445 \\u0443\\u0440\\u043e\\u0432\\u043d\\u044f\\u0445\\n            for j in range(lev+1):\\n                if name[0] in levels[j]:\\n                    gov = False\\n                    break\\n            #\\u043f\\u0440\\u043e\\u0432\\u0435\\u0440\\u043a\\u0430, \\u0435\\u0441\\u0442\\u044c \\u043b\\u0438 \\u044d\\u0442\\u043e\\u0442 \\u043f\\u0440\\u043e\\u0435\\u043a\\u0442 \\u0432 \\u0442\\u0435\\u043a\\u0443\\u0449\\u0435\\u043c \\u0443\\u0440\\u043e\\u0432\\u043d\\u0435\\n            if gov:\\n                if name[0] not in levels[lev+1]:\\n                    levels[lev + 1][name[0]] = int(name[1])\\n                else:\\n                    found = levels[lev + 1][name[0]]\\n                    levels[lev+1][name[0]] = max(int(name[1]), found)\\n    lev += 1\\n\\nres = {}\\nfor i in range(1, len(levels)-2):\\n    res.update(levels[i])\\nkeys = list(res.keys())\\nkeys.sort()\\nprint(len(keys))\\nfor i in keys:\\n    print(i+' '+ str(res[i]))\", \"# python3\\n\\ndef read_project_name():\\n    name, version = input().split()\\n    return (name, int(version))\\n\\n\\ndef read_project():\\n    project = read_project_name()\\n    deps_size = int(input())\\n\\n    deps = [read_project_name() for __ in range(deps_size)]\\n\\n    return (project, deps)\\n\\n\\ndef main():\\n    dependencies = dict()\\n    n = int(input()) - 1\\n\\n    main_project, deps = read_project()\\n    dependencies[main_project] = deps\\n    queue = (main_project,)\\n\\n    while n:\\n        n -= 1\\n        input()\\n        project, deps = read_project()\\n        dependencies[project] = deps\\n\\n    selected = dict()\\n    while queue:\\n        new_selected = dict()\\n        for (name, version) in queue:\\n            if name not in selected:\\n                old = new_selected.get(name, -1)\\n                new_selected[name] = max(old, version)\\n\\n        queue = list()\\n        for project in list(new_selected.items()):\\n            queue.extend(dependencies[project])\\n\\n        selected.update(new_selected)\\n\\n    del selected[main_project[0]]\\n    print(len(selected))\\n    for (name, version) in sorted(selected.items()):\\n        print(name, version)\\n\\n\\nmain()\\n\", \"# python3\\n\\ndef read_project_name():\\n    name, version = input().split()\\n    return (name, int(version))\\n\\n\\ndef read_project():\\n    project = read_project_name()\\n    deps = list()\\n\\n    dependencies = int(input())\\n    while(dependencies):\\n        dependencies -= 1\\n        deps.append(read_project_name())\\n\\n    return (project, tuple(deps))\\n\\n\\ndef main():\\n    dependencies = dict()\\n    n = int(input()) - 1\\n\\n    main_project, deps = read_project()\\n    dependencies[main_project] = deps\\n    queue = (main_project, )\\n\\n    while n:\\n        n -= 1\\n        input()\\n        project, deps = read_project()\\n        dependencies[project] = deps\\n\\n    selected = dict()\\n    while queue:\\n        new_selected = dict()\\n        for (name, version) in queue:\\n            if name not in selected:\\n                old = new_selected.get(name, -1)\\n                new_selected[name] = max(old, version)\\n\\n        queue = list()\\n        for project in new_selected.items():\\n            queue.extend(dependencies[project])\\n\\n        selected.update(new_selected)\\n\\n    del selected[main_project[0]]\\n    print(len(selected))\\n    for (project, ver) in sorted(selected.items()):\\n        print(project, ver)\\n\\n\\nmain()\", \"# python3\\n\\ndef read_project_name():\\n    name, version = input().split()\\n    return (name, int(version))\\n\\n\\ndef read_project():\\n    project = read_project_name()\\n\\n    deps_size = int(input())\\n    deps = [read_project_name() for __ in range(deps_size)]\\n\\n    return (project, deps)\\n\\n\\ndef main():\\n    dependencies = dict()\\n    n = int(input()) - 1\\n\\n    main_project, deps = read_project()\\n    dependencies[main_project] = deps\\n    queue = (main_project,)\\n\\n    for __ in range(n):\\n        input()\\n        project, deps = read_project()\\n        dependencies[project] = deps\\n\\n    selected = dict()\\n    while queue:\\n        new_selected = dict()\\n        for (name, version) in queue:\\n            if name not in selected:\\n                old = new_selected.get(name, 0)\\n                new_selected[name] = max(old, version)\\n\\n        queue = list()\\n        for project in list(new_selected.items()):\\n            queue.extend(dependencies[project])\\n\\n        selected.update(new_selected)\\n\\n    del selected[main_project[0]]\\n    print(len(selected))\\n    for (name, version) in sorted(selected.items()):\\n        print(name, version)\\n\\n\\nmain()\\n\", \"def read_pack():\\n    name, ver = input().strip().split()\\n    return (name, int(ver))\\n\\nn = int(input())\\ndeps = dict()\\nfor i in range(n):\\n    pack = read_pack()\\n    if not i:\\n        root = pack\\n    dep_n = int(input())\\n    deps[pack] = [read_pack() for _ in range(dep_n)]\\n    if i != n - 1:\\n        input()\\n\\nqueue = [(root, 0)]\\ntaken = {root[0]: (root[1], 0)}\\nfor pack, level in queue:\\n    # pack_deps = sorted(deps[pack], key=lambda x: x[1], reverse=True)\\n    for dep in deps[pack]:\\n        if dep[0] not in taken:\\n            taken[dep[0]] = (dep[1], level + 1)\\n            queue.append((dep, level + 1))\\n        elif taken[dep[0]][1] == level + 1 and taken[dep[0]][0] < dep[1]:\\n            index = queue.index(((dep[0], taken[dep[0]][0]), level + 1))\\n            taken[dep[0]] = (dep[1], level + 1)\\n            queue[index] = (dep, level + 1)\\n\\ndel taken[root[0]]\\n\\nprint(len(taken))\\n\\nfor d in sorted(taken):\\n    print(d, taken[d][0])\", \"def read_pack():\\n    name, ver = input().split()\\n    return (name, int(ver))\\n\\nn = int(input())\\ndeps = dict()\\nfor i in range(n):\\n    pack = read_pack()\\n    if not i:\\n        root = pack\\n    dep_n = int(input())\\n    deps[pack] = [read_pack() for _ in range(dep_n)]\\n    if i != n - 1:\\n        input()\\n\\nqueue = [(root, 0)]\\ntaken = {root[0]: (root[1], 0)}\\nfor pack, level in queue:\\n    # pack_deps = sorted(deps[pack], key=lambda x: x[1], reverse=True)\\n    for dep in deps[pack]:\\n        if dep[0] not in taken:\\n            taken[dep[0]] = (dep[1], level + 1)\\n            queue.append((dep, level + 1))\\n        elif taken[dep[0]][1] == level + 1 and taken[dep[0]][0] < dep[1]:\\n            index = queue.index(((dep[0], taken[dep[0]][0]), level + 1))\\n            taken[dep[0]] = (dep[1], level + 1)\\n            queue[index] = (dep, level + 1)\\n\\ndel taken[root[0]]\\n\\nprint(len(taken))\\n\\nfor d in sorted(taken):\\n    print(d, taken[d][0])\", \"def read_pack():\\n    name, ver = input().strip().split()\\n    return (name, int(ver))\\n\\nn = int(input())\\ndeps = dict()\\nfor i in range(n):\\n    pack = read_pack()\\n    if not i:\\n        root = pack\\n    dep_n = int(input())\\n    deps[pack] = [read_pack() for _ in range(dep_n)]\\n    if i != n - 1:\\n        input()\\n\\nqueue = [(root, 0)]\\ntaken = {root[0]: (root[1], 0)}\\nfor pack, level in queue:\\n    if pack[0] in taken and pack[1] != taken[pack[0]][0]:\\n        continue\\n    for dep in deps[pack]:\\n        if dep[0] not in taken or taken[dep[0]][1] == level + 1 and taken[dep[0]][0] < dep[1]:\\n            taken[dep[0]] = (dep[1], level + 1)\\n            queue.append((dep, level + 1))\\n\\ndel taken[root[0]]\\n\\nprint(len(taken))\\n\\nfor d in sorted(taken):\\n    print(d, taken[d][0])\", \"def bfs(polycarp, all_projects, existed_projects):\\n    # print(polycarp)\\n    # print(all_projects)\\n    # print(existed_projects)\\n\\n    queue0 = {polycarp[0]: polycarp[1]}\\n    queue1 = {}\\n\\n    while queue0:\\n        for p in list(queue0.items()):\\n            existed_projects[p[0]] = p[1]\\n\\n        for pp in list(queue0.items()):\\n            for p in all_projects[pp]:\\n                if p[0] not in existed_projects:\\n                    if p[0] not in queue1:\\n                        queue1[p[0]] = p[1]\\n                    else:\\n                        queue1[p[0]] = max(queue1[p[0]], p[1])\\n                else:\\n                    continue\\n\\n        queue0, queue1 = queue1, {}\\n\\n\\ndef main():\\n    n = int(input())\\n    all_projects = {}\\n    for _ in range(n):\\n        name, version = input().split()\\n        version = int(version)\\n        if _ == 0:\\n            polycarp = (name, version)\\n        nn = int(input())\\n        all_projects[(name, version)] = []\\n        for _2 in range(nn):\\n            name2, version2 = input().split()\\n            version2 = int(version2)\\n            all_projects[(name, version)].append((name2, version2))\\n        if _ != n - 1:\\n            input()\\n\\n    existed_projects = {}\\n    bfs(polycarp, all_projects, existed_projects)\\n\\n    print(len(existed_projects) - 1)\\n    for name in sorted(existed_projects.keys()):\\n        if name != polycarp[0]:\\n            print(name, existed_projects[name])\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = int(input())\\n\\nd = {}\\n\\nfor x in range(n):\\n    l, r = list(map(str, input().split()))\\n    r = int(r)\\n    if x == 0:\\n        L = l\\n        R = r\\n    if not (l, r) in d:\\n        d[(l, r)] = []\\n    m = int(input())\\n    for y in range(m):\\n        l1, r1 = list(map(str, input().split()))\\n        d[(l, r)].append((l1, int(r1)))\\n    if x != n - 1:\\n        s = input()\\n\\nlst = []\\narray = [L]\\ntemp1 = [(L, R)]\\ntemp2 = []\\nk1 = 0\\nk2 = 1\\nwhile k1 < len(temp1) or k2 < len(temp2):\\n    if k2 > len(temp2):\\n        while k1 < len(temp1):\\n            for (a, b) in d[temp1[k1]]:\\n                temp2.append((a, -b))\\n            k1 += 1\\n        temp2.sort()\\n        temp = []\\n        for (a, b) in temp2:\\n            if not a in array:\\n                array.append(a)\\n                lst.append((a, -b))\\n                temp.append((a, -b))\\n        temp2 = temp[:]\\n        temp1 = []\\n        k1 = 1\\n        k2 = 0\\n    elif k1 > len(temp1):\\n        while k2 < len(temp2):\\n            for (a, b) in d[temp2[k2]]:\\n                temp1.append((a, -b))\\n            k2 += 1\\n        temp1.sort()\\n        temp = []\\n        for (a, b) in temp1:\\n            if not a in array:\\n                array.append(a)\\n                lst.append((a, -b))\\n                temp.append((a, -b))\\n        temp1 = temp[:]\\n        temp2 = []\\n        k2 = 1\\n        k1 = 0\\n        \\nlst.sort()\\nprint(len(lst))\\nfor (a, b) in lst:\\n    print(a, b)\\n\", \"from collections import defaultdict\\n\\n\\ndef rp():\\n    s = input().split()\\n    return (s[0], int(s[1]))\\n\\nps = {}\\nn = int(input())\\n\\nfor i in range(n):\\n    p = rp()\\n    d = []\\n    for _ in range(int(input())):\\n        d += [rp()]\\n    ps[p] = d\\n    if i != n - 1:\\n        input()\\n\\nroot = list(ps.keys())[0]\\nq = [(root, 0)]\\nu = {root[0]: (root[1], 0)}\\n\\nfor i, l in q:\\n    isp = i\\n    if isp[0] in u and isp[1] != u[isp[0]][0]:\\n        continue\\n    for p in ps[i]:\\n        psp = p\\n        if psp[0] not in u or u[psp[0]][1] == l + 1 and u[psp[0]][0] < psp[1]:\\n            u[psp[0]] = (psp[1], l + 1)\\n            q.append((psp, l + 1))\\n\\ndel u[root[0]]\\n\\nprint(len(u))\\nfor i in sorted(u):\\n    print(i, u[i][0])\\n\", \"from collections import defaultdict\\n\\ndef rp():\\n    s = input().split()\\n    return (s[0], int(s[1]))\\n\\nps = {}\\nn = int(input())\\n\\nfor i in range(n):\\n    p = rp()\\n    d = []\\n    for _ in range(int(input())):\\n        d += [rp()]\\n    ps[p] = d\\n    if i != n - 1:\\n        input()\\n\\nroot = list(ps.keys())[0]\\nq = [(root, 0)]\\nu = {root[0]: (root[1], 0)}\\n\\nfor i, l in q:\\n    isp = i\\n    if isp[0] in u and isp[1] != u[isp[0]][0]:\\n        continue\\n    for p in ps[i]:\\n        psp = p\\n        if psp[0] not in u or u[psp[0]][1] == l + 1 and u[psp[0]][0] < psp[1]:\\n            u[psp[0]] = (psp[1], l + 1)\\n            q.append((psp, l + 1))\\n\\ndel u[root[0]]\\n\\nprint(len(u))\\nfor i in sorted(u):\\n    print(i, u[i][0])\", \"from collections import defaultdict\\n\\n\\n\\ndef rp():\\n\\n    s = input().split()\\n\\n    return (s[0], int(s[1]))\\n\\n\\n\\nps = {}\\n\\nn = int(input())\\n\\n\\n\\nfor i in range(n):\\n\\n    p = rp()\\n\\n    d = []\\n\\n    for _ in range(int(input())):\\n\\n        d += [rp()]\\n\\n    ps[p] = d\\n\\n    if i != n - 1:\\n\\n        input()\\n\\n\\n\\nroot = list(ps.keys())[0]\\n\\nq = [(root, 0)]\\n\\nu = {root[0]: (root[1], 0)}\\n\\n\\n\\nfor i, l in q:\\n\\n    isp = i\\n\\n    if isp[0] in u and isp[1] != u[isp[0]][0]:\\n\\n        continue\\n\\n    for p in ps[i]:\\n\\n        psp = p\\n\\n        if psp[0] not in u or u[psp[0]][1] == l + 1 and u[psp[0]][0] < psp[1]:\\n\\n            u[psp[0]] = (psp[1], l + 1)\\n\\n            q.append((psp, l + 1))\\n\\n\\n\\ndel u[root[0]]\\n\\n\\n\\nprint(len(u))\\n\\nfor i in sorted(u):\\n\\n    print(i, u[i][0])\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"def scan_project():\\n    name, version_str = input().split()\\n    return (name, int(version_str))\\n\\nn = int(input())\\nprojects, depends = [], {}\\nfor i in range(n):\\n    if i > 0:\\n        input()\\n    project = scan_project()\\n    projects.append(project)\\n    depends[project] = [scan_project() for j in range(int(input()))]\\n\\nroot_name, root_version = projects[0]\\nlevel_depends = [projects[0]]\\nall_depends = {root_name : root_version}\\nwhile level_depends:\\n    level_depends = list(set([(name, version) for project in level_depends\\n        for name, version in depends[project] if name not in all_depends]))\\n    for name, version in sorted(level_depends):\\n        all_depends[name] = version\\n    level_depends = [(name, version) for name, version in level_depends\\n                     if all_depends[name] == version]\\n\\nall_depends.pop(root_name)\\nprint(len(all_depends))\\nfor name in sorted(all_depends):\\n    print(name, all_depends[name])\\n\", \"def scan_project():\\n    name, version_str = input().split()\\n    return (name, int(version_str))\\n\\nn = int(input())\\nprojects, depends = [], {}\\nfor i in range(n):\\n    if i > 0:\\n        input()\\n    project = scan_project()\\n    projects.append(project)\\n    depends[project] = [scan_project() for j in range(int(input()))]\\n\\nroot_name, root_version = projects[0]\\nlevel_depends = [projects[0]]\\nall_depends = {root_name : root_version}\\nwhile level_depends:\\n    level_depends = list(sorted(set([(name, version) for proj in level_depends\\n            for name, version in depends[proj] if name not in all_depends])))\\n    for name, version in sorted(level_depends):\\n        all_depends[name] = version\\n    level_depends = [(name, version) for name, version in level_depends\\n                     if all_depends[name] == version]\\n\\nall_depends.pop(root_name)\\nprint(len(all_depends))\\nfor name in sorted(all_depends):\\n    print(name, all_depends[name])\\n\", \"def scan_project():\\n    name, version_str = input().split()\\n    return (name, int(version_str))\\n\\nn = int(input())\\nprojects, depends = [], {}\\nfor i in range(n):\\n    if i > 0:\\n        input()\\n    project = scan_project()\\n    projects.append(project)\\n    depends[project] = [scan_project() for j in range(int(input()))]\\n\\nroot_name, root_version = projects[0]\\nlevel_depends = [projects[0]]\\nall_depends = {root_name : root_version}\\nwhile level_depends:\\n    level_depends = list(sorted(set([(name, version) for proj in level_depends\\n            for name, version in depends[proj] if name not in all_depends])))\\n    for name, version in level_depends:\\n        all_depends[name] = version\\n    level_depends = [(name, version) for name, version in level_depends\\n                     if all_depends[name] == version]\\n\\nall_depends.pop(root_name)\\nprint(len(all_depends))\\nfor name in sorted(all_depends):\\n    print(name, all_depends[name])\\n\", \"def scan_project():\\n    name, version_str = input().split()\\n    return (name, int(version_str))\\n\\nn = int(input())\\nprojects, depends = [], {}\\nfor i in range(n):\\n    if i > 0:\\n        input()\\n    project = scan_project()\\n    projects.append(project)\\n    depends[project] = [scan_project() for j in range(int(input()))]\\n\\nroot_name, root_version = projects[0]\\nlevel_depends = [projects[0]]\\nall_depends = {root_name : root_version}\\nwhile level_depends:\\n    level_depends = list(set((name, version) for project in level_depends\\n            for name, version in depends[project] if name not in all_depends))\\n    for name, version in sorted(level_depends):\\n        all_depends[name] = version\\n    level_depends = [(name, version) for name, version in level_depends\\n                     if all_depends[name] == version]\\n\\nall_depends.pop(root_name)\\nprint(len(all_depends))\\nfor name in sorted(all_depends):\\n    print(name, all_depends[name])\\n\"]",
        "difficulty": "interview",
        "input": "5\nabbzzz 646068\n0\n\nzabza 468048\n2\nbb 902619\nzabza 550912\n\nzabza 217401\n2\nabbzzz 646068\nbb 902619\n\nzabza 550912\n1\nzabza 217401\n\nbb 902619\n1\nabbzzz 646068\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/928/C"
    },
    {
        "id": 643,
        "task_id": 2083,
        "test_case_id": 1,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "1 1 2.000000\n1\n1\n1\n",
        "output": "1.000000 0.500000 0.500000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 644,
        "task_id": 2083,
        "test_case_id": 2,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n",
        "output": "8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 645,
        "task_id": 2083,
        "test_case_id": 3,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n",
        "output": "3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 646,
        "task_id": 2083,
        "test_case_id": 4,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "1 1 2.000000\n4\n1\n1\n",
        "output": "4.000000 2.000000 0.500000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 647,
        "task_id": 2083,
        "test_case_id": 5,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "1 1 2.000000\n1121\n1\n1\n",
        "output": "1121.000000 560.500000 0.500000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 648,
        "task_id": 2083,
        "test_case_id": 6,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "1 1 2.000000\n758432\n1\n1\n",
        "output": "758432.000000 379216.000000 0.500000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 649,
        "task_id": 2083,
        "test_case_id": 7,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "3 1 2.000000\n8 25 21\n3\n1 2 3\n",
        "output": "8.000000 4.000000 0.500000\n25.000000 14.500000 0.420000\n21.000000 17.750000 0.154762\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 650,
        "task_id": 2083,
        "test_case_id": 8,
        "question": "In this problem you will have to deal with a real algorithm that is used in the VK social network.\n\nAs in any other company that creates high-loaded websites, the VK developers have to deal with request statistics regularly. An important indicator reflecting the load of the site is the mean number of requests for a certain period of time of T seconds (for example, T = 60 seconds = 1 min and T = 86400 seconds = 1 day). For example, if this value drops dramatically, that shows that the site has access problem. If this value grows, that may be a reason to analyze the cause for the growth and add more servers to the website if it is really needed.\n\nHowever, even such a natural problem as counting the mean number of queries for some period of time can be a challenge when you process the amount of data of a huge social network. That's why the developers have to use original techniques to solve problems approximately, but more effectively at the same time.\n\nLet's consider the following formal model. We have a service that works for n seconds. We know the number of queries to this resource a_{t} at each moment of time t (1 ≤ t ≤ n). Let's formulate the following algorithm of calculating the mean with exponential decay. Let c be some real number, strictly larger than one.\n\n// setting this constant value correctly can adjust   \n\n// the time range for which statistics will be calculated\n\ndouble c = some constant value; \n\n\n\n// as the result of the algorithm's performance this variable will contain \n\n// the mean number of queries for the last \n\n// T seconds by the current moment of time\n\ndouble mean = 0.0; \n\n\n\nfor t = 1..n: // at each second, we do the following:\n\n    // a_{t} is the number of queries that came at the last second;\n\n    mean = (mean + a_{t} / T) / c;\n\n\n\nThus, the mean variable is recalculated each second using the number of queries that came at that second. We can make some mathematical calculations and prove that choosing the value of constant c correctly will make the value of mean not very different from the real mean value a_{x} at t - T + 1 ≤ x ≤ t. \n\nThe advantage of such approach is that it only uses the number of requests at the current moment of time and doesn't require storing the history of requests for a large time range. Also, it considers the recent values with the weight larger than the weight of the old ones, which helps to react to dramatic change in values quicker.\n\nHowever before using the new theoretical approach in industrial programming, there is an obligatory step to make, that is, to test its credibility practically on given test data sets. Your task is to compare the data obtained as a result of the work of an approximate algorithm to the real data. \n\nYou are given n values a_{t}, integer T and real number c. Also, you are given m moments p_{j} (1 ≤ j ≤ m), where we are interested in the mean value of the number of queries for the last T seconds. Implement two algorithms. The first one should calculate the required value by definition, i.e. by the formula $\\frac{a_{p_{j} - T + 1} + a_{p_{j}} - T + 2 + \\ldots + a_{p_{j}}}{T}$. The second algorithm should calculate the mean value as is described above. Print both values and calculate the relative error of the second algorithm by the formula $\\frac{|\\text{approx-real}|}{\\text{real}}$, where approx is the approximate value, obtained by the second algorithm, and real is the exact value obtained by the first algorithm.\n\n\n-----Input-----\n\nThe first line contains integer n (1 ≤ n ≤ 2·10^5), integer T (1 ≤ T ≤ n) and real number c (1 < c ≤ 100) — the time range when the resource should work, the length of the time range during which we need the mean number of requests and the coefficient c of the work of approximate algorithm. Number c is given with exactly six digits after the decimal point.\n\nThe next line contains n integers a_{t} (1 ≤ a_{t} ≤ 10^6) — the number of queries to the service at each moment of time.\n\nThe next line contains integer m (1 ≤ m ≤ n) — the number of moments of time when we are interested in the mean number of queries for the last T seconds.\n\nThe next line contains m integers p_{j} (T ≤ p_{j} ≤ n), representing another moment of time for which we need statistics. Moments p_{j} are strictly increasing.\n\n\n-----Output-----\n\nPrint m lines. The j-th line must contain three numbers real, approx and error, where:  [Image] is the real mean number of queries for the last T seconds;  approx is calculated by the given algorithm and equals mean at the moment of time t = p_{j} (that is, after implementing the p_{j}-th iteration of the cycle);  $\\text{error} = \\frac{|\\text{approx-real}|}{\\text{real}}$ is the relative error of the approximate algorithm. \n\nThe numbers you printed will be compared to the correct numbers with the relative or absolute error 10^{ - 4}. It is recommended to print the numbers with at least five digits after the decimal point.\n\n\n-----Examples-----\nInput\n1 1 2.000000\n1\n1\n1\n\nOutput\n1.000000 0.500000 0.500000\n\nInput\n11 4 1.250000\n9 11 7 5 15 6 6 6 6 6 6\n8\n4 5 6 7 8 9 10 11\n\nOutput\n8.000000 4.449600 0.443800\n9.500000 6.559680 0.309507\n8.250000 6.447744 0.218455\n8.000000 6.358195 0.205226\n8.250000 6.286556 0.237993\n6.000000 6.229245 0.038207\n6.000000 6.183396 0.030566\n6.000000 6.146717 0.024453\n\nInput\n13 4 1.250000\n3 3 3 3 3 20 3 3 3 3 3 3 3\n10\n4 5 6 7 8 9 10 11 12 13\n\nOutput\n3.000000 1.771200 0.409600\n3.000000 2.016960 0.327680\n7.250000 5.613568 0.225715\n7.250000 5.090854 0.297813\n7.250000 4.672684 0.355492\n7.250000 4.338147 0.401635\n3.000000 4.070517 0.356839\n3.000000 3.856414 0.285471\n3.000000 3.685131 0.228377\n3.000000 3.548105 0.182702",
        "solutions": "[\"def main():\\n    s = input().split()\\n    n,T,c = int(s[0]), int(s[1]), float(s[2])\\n    a = list(map(int, input().split()))\\n    m = int(input())\\n    q = list(map(int, input().split()))\\n    sumA, approx, mean = [0], [],  0.\\n    for i in range(1, n+1):\\n        mean = (mean+a[i-1]/T)/c\\n        approx.append(mean)\\n        sumA.append(a[i-1] + sumA[i-1])\\n    ans = [(sumA[q[i]]-sumA[q[i]-T])/T for i in range(m)]\\n    for i in range(m):\\n        print('%.6f' % ans[i], '%.6f' % approx[q[i]-1], '%.6f' % (abs(approx[q[i]-1]- ans[i])/ans[i]))        \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"a = list(input().split())\\nn, T, c = int(a[0]), int(a[1]), float(a[2])\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\n\\nsum_a = sum(a[:T - 1])\\nmean = 0\\nfor t in range(T - 1):\\n    mean = (mean + a[t]/T) / c\\n\\ni = 0\\nfor t in range(T - 1, p[-1]):\\n    sum_a += a[t]\\n    mean = (mean + a[t]/T) / c\\n    if t == p[i] - 1:\\n        real = sum_a / T\\n        print('%0.6f %0.6f %0.6f' % (real, mean, abs(real - mean) / real))\\n        i += 1\\n        if i == len(p) : break\\n    sum_a -= a[t - T + 1]\\n\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"n, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\", \"3.5\\nimport math\\nmean=[0.0]*200010\\nreal=[0.0]*200010\\nn,T,c=input().split()\\nn=int(n)\\nT=int(T)\\nc=float(c)\\nt=T\\na=[0]+[int(x) for x in input().split()]\\nfor i in range(1,n+1):\\n    mean[i]=(mean[i-1]+(a[i]/T))/c\\n    real[i]=real[i-1]+a[i]\\n\\nm=int(input())\\nq=[int(x) for x in input().split()]\\nfor i in range(m):\\n    r=(real[q[i]]-real[q[i]-t])/T\\n    ap=mean[q[i]]\\n    print('{:.6f} {:.6f} {:.6f}'.format(r,ap,math.fabs(ap-r)/r))\\n\", \"import math\\n\\ns=input().split(' ')\\nn,tm,k=int(s[0]),int(s[1]),float(s[2])\\nrq=[int(c) for c in input().split(' ')]\\nm=int(input())\\ncr={int(c) for c in input().split(' ')}\\nsr,ma=0,0\\nalv=[]\\nfor c,t in enumerate(rq):\\n    ma=(ma+t/tm)/k\\n    sr+=t\\n    l=c-tm\\n    l=rq[l] if l>=0 else 0\\n    sr-=l\\n    if (c+1) in cr:\\n    \\tmr=sr/tm\\n    \\tdf=abs((ma-mr)/mr)\\n    \\talv.append((mr,ma,df))\\nfor c in alv:\\n    print(c[0],c[1],c[2])\", \"__author__ = 'ruckus'\\nn, T, c = input().split()\\nn = int(n)\\nT = int(T)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\nq = list(map(int, input().split()))\\nres_a = 0\\nreal = 0\\nmaxi_q = max(q)\\nq_n = 0\\nfor i in range(q[-1]):\\n    res_a = (res_a + a[i] / T) / c\\n    real += a[i]\\n    if i >= T:\\n        real -= a[i-T]\\n    if q[q_n] == i+1:\\n        q_n += 1\\n        r = real/T\\n        print(r, res_a, abs(r-res_a)/r)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"n, t, c = input().split()\\nn = int(n)\\nt = int(t)\\nc = float(c)\\na = list(map(int, input().split()))\\nm = int(input())\\np = list(map(int, input().split()))\\nsums = [a[0]]\\nfor i in range(1, n):\\n    sums.append(sums[i - 1] + a[i])\\napprox = [a[0] / (t * c)]\\nfor i in range(1, n):\\n    approx.append((approx[i - 1] + a[i] / t) / c)\\n\\nfor i in range(m):\\n    real = (sums[p[i] - 1] - (0 if p[i] == t else sums[p[i] - t - 1])) / t\\n    appr = (approx[p[i] - 1]) # - (0 if p[i] == t else approx[p[i] - t - 1] / (c ** t)))\\n    print(real, appr, abs(real - appr) / real)\\n\"]",
        "difficulty": "interview",
        "input": "19 3 1.333333\n12 15 11 10 16 4 9 2 24 3 6 3 21 21 2 16 13 12 2\n17\n3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19\n",
        "output": "12.666667 7.250003 0.427631\n12.000000 7.937505 0.338541\n12.333333 9.953131 0.192989\n10.000000 8.464850 0.153515\n9.666667 8.598640 0.110486\n5.000000 6.948982 0.389796\n11.666667 11.211739 0.038994\n9.666667 9.158807 0.052537\n11.000000 8.369107 0.239172\n4.000000 7.026832 0.756708\n10.000000 10.520127 0.052013\n15.000000 13.140098 0.123993\n14.666667 10.355076 0.293972\n13.000000 11.766310 0.094899\n10.333333 12.074736 0.168523\n13.666667 12.056055 0.117850\n9.000000 9.542043 0.060227\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/523/B"
    },
    {
        "id": 651,
        "task_id": 2242,
        "test_case_id": 4,
        "question": "Given is a string S consisting of digits from 1 through 9.\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\n-----Constraints-----\n - 1 ≤ |S| ≤ 200000\n - S is a string consisting of digits from 1 through 9.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\n\n-----Output-----\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\n-----Sample Input-----\n1817181712114\n\n-----Sample Output-----\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.",
        "solutions": "[\"s=input()[::-1]\\nalist=[0]*2019\\nnum1=0\\nnum2=1/10\\nlens=len(s)\\nfor i in range(lens):\\n  num2=int(((num2)*10)%2019)\\n  num1=(num1+int(s[i])*(num2))%2019\\n  alist[num1]+=1\\nalist[0]+=1\\nans=0\\nfor i in range(2019):\\n  ans+=alist[i]*(alist[i]-1)//2\\nprint(ans)\", \"ans=0\\nS=input()\\na=len(S)\\nk=0\\nc=dict()\\nmod=2019\\ns=1\\nc[0]=1\\nfor i in range(a):\\n  k+=(s*int(S[a-i-1]))\\n  k%=mod\\n  s*=10\\n  s%=mod\\n  if k in c:\\n    c[k]+=1\\n  else:\\n    c[k]=1\\nfor i in c:\\n  ans+=c[i]*(c[i]-1)//2\\nprint(ans)\", \"S = input()\\nN = len(S)\\nA = [int(S[i]) for i in range(N)]\\nA = A[::-1]\\n\\nMOD = 2019\\n\\np10 = [1] * N\\nfor i in range(1, N):\\n\\tp10[i] = (p10[i - 1] * 10) % MOD\\n\\nfor i in range(N):\\n\\tA[i] = (A[i] * p10[i]) % MOD\\n\\ncumsum = [A[0]] * N\\nfor i in range(1, N):\\n\\tcumsum[i] = (cumsum[i - 1] + A[i]) % MOD\\n\\ncnt = [0] * MOD\\ncnt[0] = 1\\nfor i in range(N):\\n\\tcnt[cumsum[i]] += 1\\n\\nans = 0\\nfor i in range(MOD):\\n\\tans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\\n\", \"S = input()\\nN = len(S)\\nq = [0]\\ncount = [0 for i in range(2019)]\\nans = 0\\ncount[0] = 1\\nm10 = 1\\n\\nfor i in range(1,N+1):\\n  a = int(S[-i])\\n  #print(a, a*(10**(N-i-1)), q)\\n  q.append((a*m10+q[i-1])%2019)\\n  m10 *= 10\\n  m10 %= 2019\\n  count[q[-1]] += 1\\n\\n#print(q)\\n\\nfor i in range(2019):\\n  c = count[i]\\n  ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"import sys;      from decimal import Decimal\\nimport math;     from itertools import combinations, product\\nimport bisect;   from collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)\\n\\nimport numpy as np\\n\\ndef Main():\\n    s = read_str()\\n    dp = np.zeros(2019, dtype=np.int64)\\n    dp[0] = 1\\n\\n    cur = 0\\n    digit = 1\\n\\n    for i in reversed(s):\\n        cur = (cur + int(i) * digit) % 2019\\n        dp[cur] += 1\\n        digit = digit * 10 % 2019\\n    \\n    print(np.sum([x * (x - 1) // 2 for x in dp]))\\n\\nif __name__ ==  '__main__':\\n    Main()\", \"import copy\\n\\ns = list(input())\\n\\ns.reverse()\\nn = len(s)\\nMOD = 2019\\nm = [0] * n\\nmsum = [0] * (n+1)\\ncnt = [0] * (MOD)\\ncnt[0] = 1\\nt = 1\\nfor i in range(n):\\n    m[i] = int(s[i]) * t % MOD\\n    msum[i+1] = (msum[i] + m[i]) % MOD\\n    cnt[msum[i+1]] += 1\\n    t = t * 10 % MOD\\n\\nans = 0\\nfor i in range(MOD):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nl[0] = 1\\n\\ntmp = 0\\nz = 1\\n\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tz = z*10%2019\\n\\tl[tmp%2019] += 1\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\n\\nprint(ans)\", \"\\ndef solve():\\n    s=input().split()[0]\\n    cnt=[0]*2020\\n    cnt[0]=1\\n    m=0\\n    t=1\\n    for d in map(int,s[-1::-1]) :\\n        m=(m+d*t)%2019\\n        t=(t*10)%2019\\n        cnt[m]+=1\\n    return sum([ k*(k-1)//2 for k in cnt])\\n\\nprint((solve()))\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import Counter\\ndef main():\\n    s = input()\\n    n = len(s)\\n\\n    amari = [0] * n\\n    ketaamari = 1\\n    t = 0\\n    for i1 in range(n):\\n        t = (t + ketaamari * int(s[-i1 -1])) % 2019\\n        amari[-i1-1] = t\\n        ketaamari = (ketaamari * 10) % 2019\\n    amari.append(0)\\n    ac = Counter(amari)\\n    r = 0\\n    for v in ac.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\n\\nS=input()\\n\\nrlist=[0]\\nfor i in range(len(S)):\\n  rlist.append((rlist[-1]+int(S[-i-1])*pow(10,i,2019))%2019)\\n  \\nc = Counter(rlist)\\nc[0] -= 1\\n\\ndef nC2(n):\\n  return n*(n-1)//2\\n  \\nans = c[0]\\nfor k in c.keys():\\n  if c[k] >= 2:\\n    ans += nC2(c[k])\\n    \\nprint(ans)\", \"from collections import Counter\\n\\nS = input()\\n# S = \\\"12345\\\"*40000\\nN = len(S)\\n\\nl = [0]*(N+1)\\nfor i in range(N-1, -1, -1):\\n    l[i] = (l[i+1] + pow(10, N-i, 2019) * int(S[i])) % 2019\\n    # if i%10000 == 0:\\n    #     print(i)\\n\\n# print(list(Counter(l).values()))\\n\\nr = sum(m*(m-1)//2 for m in Counter(l).values())\\nprint(r)\", \"s = input()\\nt = s[::-1]\\nn = len(s)\\nresid = [0] * 2019\\nresid[0] = 1\\ncsum = 0\\npowoften = 1\\nfor i in range(n):\\n    csum = (csum + int(t[i]) * powoften) % 2019\\n    powoften = (10 * powoften) % 2019\\n    resid[csum] += 1\\nans = 0\\nfor i in range(2019):\\n    ans += resid[i] * (resid[i] - 1) // 2\\nprint(ans)\", \"s = input()\\nmod = 2019\\ndic = [0] * mod\\ndic[0] += 1\\n\\ntmp = 0\\nd = 1\\nfor i in reversed(range(len(s))):\\n    tmp += int(s[i]) * d\\n    tmp %= mod\\n    d *= 10\\n    d %= mod\\n    dic[tmp] += 1\\n\\nans = [i * (i-1) / 2 for i in dic]\\nprint(int(sum(ans)))\", \"s = input()\\n\\nl = len(s)\\nnum = 0\\ncount = 0\\ndic = {0: 1}\\nfor i in range(l - 1, -1, -1):\\n  num = (num + int(s[i]) * pow(10, l - i - 1, 2019)) % 2019\\n  #print(num)\\n  #print(r)\\n  if num not in dic:\\n    dic[num] = 1\\n  else:\\n    dic[num] += 1\\nfor ele in list(dic.values()):\\n  count += ele * (ele - 1) // 2\\nprint(count)\\n\", \"from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf\\nfrom itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement\\nfrom collections import deque,defaultdict,Counter\\nfrom bisect import bisect_left,bisect_right\\nfrom operator import itemgetter\\nfrom heapq import heapify,heappop,heappush\\nfrom queue import Queue,LifoQueue,PriorityQueue\\nfrom copy import deepcopy\\nfrom time import time\\nfrom functools import reduce, lru_cache\\nimport string\\nimport sys\\nsys.setrecursionlimit(10 ** 7)\\ndef input() : return sys.stdin.readline().strip()\\ndef INT()   : return int(input())\\ndef MAP()   : return map(int,input().split())\\ndef MAP1()  : return map(lambda x:int(x)-1,input().split())\\ndef LIST()  : return list(MAP())\\ndef LIST1() : return list(MAP1())\\n\\ns = input()\\n\\n@lru_cache(None)\\ndef F(s, k):\\n    # s\\u306e\\u5de6\\u304b\\u3089k\\u6587\\u5b57\\u76ee\\u4ee5\\u964d\\u3092\\u6574\\u6570\\u3068\\u898b\\u306a\\u3057\\u305f\\u3068\\u304d\\u3001\\n    # 2019\\u3067\\u5272\\u3063\\u305f\\u4f59\\u308a\\u3092\\u8fd4\\u3059\\n    if k == len(s)-1:\\n        return int(s[k])\\n    ret = F(s, k+1) + int(s[k])*pow(10, len(s)-1-k, 2019)\\n    ret %= 2019\\n    return ret\\n\\na = [0]*2020\\nfor i in range(len(s)):\\n    a[F(s, i)] += 1\\n\\nans = a[0]\\nfor i in range(2020):\\n    ans += a[i] * (a[i]-1) // 2\\n\\nprint(ans)\", \"S=input()\\nMOD=2019\\ndp=[0]*MOD\\ndp[0]=1\\nr=0\\nt=1\\nfor c in reversed(S):\\n    r+=int(c)*t\\n    r%=MOD\\n    t*=10\\n    t%=MOD\\n    dp[r]+=1\\nprint(sum(i*(i-1)//2 for i in dp))\", \"S = input()\\ndp = [0]*(len(S)+1)\\ncur = int(S[len(S)-1])\\nmod_10 = 1\\ncount_num = [0]*2019\\ncount_num[0] += 1\\nfor i in range(len(S)):\\n    dp[len(S)-i-1] = cur\\n    count_num[cur] += 1\\n    mod_10 = (mod_10*10)%2019\\n    if i <= len(S)-2:\\n        cur = (cur+int(S[len(S)-i-2])*(mod_10))%2019\\nans = 0\\nfor i in range(2019):\\n    ans += (count_num[i]*(count_num[i]-1))//2\\nprint(ans)\\n\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in S[::-1]:\\n  s=(s+int(i)*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    # print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum + x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    # \\u5834\\u5408\\u5206\\u3051\\u306e\\u6570\\u3092\\u8db3\\u3057\\u5408\\u308f\\u305b\\u308b\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num - 1)) // 2  # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import collections\\n\\ns=list(input())\\na=[0]\\n\\ns.reverse()\\n\\nmod=2019\\n\\nmod10=1\\n\\nfor i in range(len(s)):\\n  x=int(s[i])\\n  y=a[-1]\\n  ans=(x*mod10+y)%mod\\n  a.append(ans)\\n  mod10=(mod10*10)%mod\\n  \\nans1=0\\n\\nc = collections.Counter(a)\\nd=list(c.values())\\n\\nfor r in d:\\n  if r>=2:\\n    ans1+=(r*(r-1))//2\\n    \\nprint(ans1)\", \"s = input()\\ns = s[::-1]\\n\\nL = [0]\\ncnt = 1\\nfor i in range(len(s)):\\n    L.append((L[-1]+(int(s[i])*cnt))%2019)\\n    cnt *= 10\\n    cnt %= 2019\\n\\nD = dict()\\nfor j in L:\\n    if j in D:\\n        D[j] += 1\\n    else:\\n        D[j] = 1\\nans = 0\\nfor k in D.values():\\n    ans += k * (k-1) //2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\ncnts=[0]*2019\\ncnts[0]=1\\nnum=0\\nfor i in range(n):\\n  num+=int(s[i])*pow(10,i,2019)\\n  num%=2019\\n  cnts[num]+=1\\n\\nans=0\\nfor cnt in cnts:\\n  ans+=cnt*(cnt-1)//2\\n  \\nprint(ans)\\n\", \"s = list(input())\\n\\nMOD = 2019\\n\\ntemp = 0\\nd = 1\\n\\nm = [0] * MOD\\nm[0] = 1\\n\\nfor x in reversed(s):\\n    temp += int(x) * d\\n    temp %= MOD\\n    m[temp] += 1\\n    d = (d * 10) % MOD\\n\\nans = 0\\nfor x in m:\\n    ans += x * (x-1) // 2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\np=2019\\nS=[0 for i in range(n+1)]\\nans=[0]*p\\n\\nx10=1\\nfor j, i in enumerate(s):\\n  S[j+1]=(S[j]+(x10*int(i)))%p\\n  x10*=10\\n  x10%=p\\n  ans[S[j+1]]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\n\\nmod = 2019\\ncnt = [0] * 2019\\ncur = 0  # \\u73fe\\u5728\\u691c\\u8a0e\\u4e2d\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\ncnt[cur] = 1\\nd = 1   # \\u6841\\n\\nfor s in S[::-1]:\\n    cur += int(s) * d\\n    cur %= mod\\n    cnt[cur] += 1\\n    d *= 10\\n    d %= mod\\n\\nans = 0\\nfor c in cnt:\\n    ans += c * (c-1) // 2\\n\\nprint(ans)\", \"#!/usr/bin/env python3\\ndef main():\\n    S = input()[::-1]\\n\\n    counts = [0] * 2019\\n    counts[0] = 1\\n    res, digit = 0, 1\\n    for i in S:\\n        res += int(i) * digit\\n        res %= 2019\\n        digit *= 10\\n        digit %= 2019\\n        counts[res] += 1\\n\\n    ans = 0\\n    for i in counts:\\n        ans += i * (i - 1) // 2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nn = len(s)\\nmod = 2019\\n\\nt = [0]*n\\ndp = [0]*2020\\nt[0] = int(s[-1])\\ndp[t[0]] += 1\\nfor i in range(n-1):\\n    t[i+1] = t[i] + int(s[-2-i])*pow(10, i+1, mod)\\n    t[i+1] %= mod\\n    dp[t[i+1]] += 1\\nans = 0\\nfor D in dp[1:]:\\n    ans += D*(D-1)//2\\nprint((ans+(dp[0]+1)*(dp[0])//2))\\n\\n\\n\", \"#!/usr/bin/env python3\\nimport sys\\nimport numpy as np\\n\\ninput = sys.stdin.readline\\n\\n\\ndef ST():\\n    return input().rstrip()\\n\\n\\ndef I():\\n    return int(input())\\n\\n\\ndef MI():\\n    return list(map(int, input().split()))\\n\\n\\ndef LI():\\n    return list(MI())\\n\\n\\nS = ST()\\n\\ncnt = np.zeros(2019)\\ncnt[0] = 1\\nres = 0\\ntmp = 1\\nfor s in S[::-1]:\\n    res += int(s) * tmp\\n    res %= 2019\\n    cnt[res] += 1\\n    tmp *= 10\\n    tmp %= 2019\\n\\nans = 0\\nfor c in cnt[cnt >= 2]:\\n    ans += c * (c - 1) // 2\\n\\nprint((int(ans)))\\n\", \"def main():\\n    import collections\\n\\n    S = input()\\n\\n    mod_list = [0]\\n\\n    for i in range(len(S)):\\n        index = len(S) - i - 1\\n        num = int(S[index])\\n\\n        mod_list.append((mod_list[-1] + num * pow(10, i, 2019)) % 2019)\\n\\n    CTR_mod_list = collections.Counter(mod_list).most_common()\\n    cnt = 0\\n\\n    for i in range(len(CTR_mod_list)):\\n        n = CTR_mod_list[i][1]\\n\\n        if (n == 1):\\n            break\\n\\n        cnt += n * (n - 1) // 2\\n\\n    print(cnt)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"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\\n# \\u7d2f\\u7a4d\\u548c\\u306e\\u66f8\\u304d\\u65b9\\u304c\\u3088\\u304f\\u306a\\u3044\\u3084\\u3064\\ndef main():\\n  s=S()\\n  n=len(s)\\n\\n  l=[]\\n  mul=1\\n  for x in s[::-1]:\\n    l.append(mul*int(x)%2019)\\n    mul*=10\\n    mul%=2019\\n\\n  for i in range(n-1):\\n    l[i+1]+=l[i]\\n    l[i+1]%=2019\\n\\n  sl=summarizeList(l)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    if x==0:\\n      ans+=c\\n    if c>1:\\n      ans+=c*(c-1)//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Mon Sep  7 00:38:11 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n\\uff1cD - Multiple of 2019>\\n\\u3010\\u65b9\\u91dd\\u3011\\na = b(mod2019) => a - b \\u306f\\u30002019\\u306e\\u500d\\u6570\\n\\u4f59\\u308a\\u304c\\u7b49\\u3057\\u3044\\u30b0\\u30eb\\u30fc\\u30d7\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u306e\\u7dcf\\u6570\\u304c\\u89e3\\u306b\\u306a\\u308b\\u3002\\n\\u65e2\\u306b2019\\u306e\\u500d\\u6570\\u3067\\u3042\\u308b\\u3082\\u306e\\u306f\\u5358\\u4f53\\u3067\\u6210\\u7acb\\u3059\\u308b\\u305f\\u3081\\u3001[0]\\u306e\\u30ab\\u30a6\\u30f3\\u30c8\\u3092\\u4e00\\u3064\\u3042\\u3052\\u3066\\u304a\\u304f\\n\\n\\n\\uff1c\\u7d2f\\u7a4d\\u548c\\uff1e\\n\\u3010\\u8a08\\u7b97\\u91cf\\u524a\\u6e1b\\u3011\\n\\u5927\\u304d\\u306a\\u6570\\u3092\\u4f7f\\u308f\\u306a\\u3044\\u3000\\u21d2\\u3000mod \\u3092\\u4f7f\\u3046\\ntmp += 7 * 100000000  => 7 * ( 2019*N + \\u03b1) => 7 * \\u03b1\\u3000\\u3068\\u540c\\u3058\\n\\u3000\\u3000\\u21d2\\u3000\\u7d2f\\u4e57(10**N) \\u306b  mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n\\n100000000 + \\u03b3 => (2019*N + \\u03b2) + \\u03b3 => \\u03b2 + \\u03b3 \\u3068\\u540c\\u3058\\n\\u3000\\u21d2\\u3000\\u7d2f\\u7a4d\\u548c\\u3000\\u306b\\u3000mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n \\n for\\u6587\\u3067\\uff11\\u6587\\u5b57\\u305a\\u3064\\u8db3\\u3057\\u7b97\\u3057\\u3066\\u3044\\u304f\\u3053\\u3068\\u3067\\u5b9f\\u88c5\\u53ef\\u80fd\\n \\n reversed() : \\u9006\\u9806\\u306b\\u4e26\\u3079\\u66ff\\u3048\\n reversed(input()) : \\u5165\\u529b\\u3092\\u9006\\u9806\\u306b\\u53d6\\u308a\\u51fa\\u3059\\n \\n\\\"\\\"\\\"\\nS = input()\\n\\nMOD = 2019 \\n\\ncounter = [0] * 2019\\ncounter[0] = 1\\nt = 1\\ntmp = 0\\nfor i in reversed(S):\\n    tmp += int(i)*t\\n    tmp %= MOD #\\u7d2f\\u7a4d\\u548c\\u3092\\u52b9\\u7387\\u5316\\n    t *= 10\\n    t %= MOD   #\\u7d2f\\u4e57\\u3092\\u52b9\\u7387\\u5316 \\n    #print(tmp)\\n    counter[tmp] += 1\\n\\nans = sum( i*(i-1)//2 for i in counter)\\nprint(ans)\", \"s = list(input())\\n# s = list(str(10**200000))\\nn = len(s)\\nans = 0\\ns.reverse()\\n# print(s)\\nx = 1\\ntot = 0\\ncount = [0]*2019\\nfor i in range(n):\\n    count[tot]+=1\\n    tot += int(s[i])*x\\n    # print(tot)\\n    tot %= 2019\\n    ans += count[tot]\\n    x = x*10%2019\\nprint(ans)\", \"S = input()[::-1]\\nans = 0\\nmods = [0] * 2019\\nmods[0] = 1\\ncurrent = 0\\nx = 1\\nfor s in S:\\n  current = (current + x * int(s)) % 2019\\n  ans += mods[current % 2019]\\n  mods[current % 2019] += 1\\n  x = x * 10 % 2019\\nprint(ans)\", \"s = list(map(int,input()))\\ns.reverse()\\nt = len(s)\\nmod = 2019\\n\\narr = [0] * (t+1)\\narr[-2] = s[0]\\nfor i in range(1,t):\\n    arr[t-i-1] = (arr[t-i] + s[i]*pow(10,i,mod)) % mod\\n\\nfrom collections import Counter\\narr = Counter(arr)\\n\\nans = 0\\nfor i in arr:\\n    ans += (arr[i] - 1) * arr[i] // 2\\n\\nprint(ans)\", \"import sys\\nimport heapq\\nimport math\\nimport fractions\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\nfrom collections import deque\\nfrom operator import itemgetter\\ndef input(): return sys.stdin.readline().strip()\\ndef mp(): return map(int,input().split())\\ndef lmp(): return list(map(int,input().split()))\\n\\ns=input()[::-1]\\nn=len(s)\\na=[0]*2019\\na[0]=1\\nc,d=0,1\\nfor i in s:\\n    c+=int(i)*d\\n    c%=2019\\n    d*=10\\n    d%=2019\\n    a[c]+=1\\nans=0\\nfor i in a:\\n    ans+=i*(i-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()[::-1]\\nMOD = 2019\\nX = [0]\\nfor i,s in enumerate(S):\\n    X.append((X[-1]+int(s)*pow(10,i,MOD))%MOD)\\nC = Counter(X)\\nprint(sum([v*(v-1)//2 for v in C.values()]))\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in range(1,n+1):\\n  s=(s+int(S[-i])*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"n = input()\\np = 2019\\nt = 1\\ny = 0\\nc = p*[0]\\n\\nfor x in map(int,n[::-1]):\\n  y+=t*x\\n  y%=p\\n  c[y]+=1\\n  t*=10\\n  t%=p\\n\\nprint(sum(i*(i-1)//2 for i in c)+c[0])\", \"def main():\\n    def modpow(x, n, mod):\\n        res = 1\\n        while n:\\n            if n % 2:\\n                res *= x % mod\\n            x *= x % mod\\n            n >>= 1\\n        return res\\n\\n    s = input()\\n    s = s[::-1]\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in range(s_len):\\n        rev_num += int(s[i]) * int(modpow(10, i, mod))\\n        rev_num %= mod\\n        d[rev_num] += 1\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S = input()\\ns_rev = S[::-1]\\n\\nr_list = [0] * 2019\\nr_list[0] = 1\\nnum, d = 0, 1\\nfor i in range(len(S)):\\n    num += d*int(s_rev[i])\\n    num %= 2019\\n    r_list[num] += 1\\n    d *= 10\\n    d %= 2019\\n\\nans = 0\\nfor i in range(2019):\\n        ans += r_list[i]*(r_list[i]-1)//2\\n\\nprint(ans)\\n\", \"s=input()\\np=2019\\nans=0\\nM=[0]*p\\nM[0]=1\\ntmp=0\\nfor i in range(len(s)):\\n    tmp+=(int(s[-i-1])*pow(10,i,p))\\n    tmp%=p\\n    ans+=M[tmp]\\n    M[tmp]+=1\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common()[::-1]:\\n#  if k > 1 and k%2 == 0:\\n#    ans += n\\n#  else:break\\n#print(ans)\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#https://mirucacule.hatenablog.com/entry/2020/04/27/090908\\n#https://drken1215.hatenablog.com/entry/2020/04/29/171300\\n\\nS=str(input())[::-1]#\\u9006\\u9806\\u3067\\u683c\\u7d0d\\nN=len(S)\\ncounter=[0]*2019\\ncounter[0]=1\\nans=0\\nnum,d=0,1\\nfor c in S:\\n    num += int(c) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counter[num]+=1\\nfor i in counter:\\n    ans += i*(i-1)//2\\nprint(ans)\", \"from collections import defaultdict\\n\\nS = input()\\n\\nd = defaultdict(int)\\n\\nd[0] += 1\\n\\nmod = 0\\nR = 1\\nfor i in range(len(S)):\\n    mod = (mod + R * int(S[len(S) - i - 1])) % 2019\\n    R = R * 10 % 2019\\n    d[mod] += 1\\nans = 0\\nfor i in list(d.values()):\\n    if i > 1:\\n        ans += i * (i - 1) / 2\\n\\nprint((int(ans)))\\n\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"S = input()\\nmod = 2019\\n\\narray = []\\nfor i in range(len(S)):\\n    x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod\\n    array.append(x)\\narray2 = [0]\\ny = 0\\nfor i in range(len(S)):\\n    y = (y+array[i])%mod\\n    array2.append(y)\\narray3 = [0] * 2019\\nans = 0\\nfor i in range(len(array2)):\\n    z = array2[i]\\n    ans += array3[z]\\n    array3[z] += 1\\nprint(ans)\\n#3*673\\n\", \"s=input()\\nn=len(s)\\nrui=[0]\\njuu=[1]\\nfor i in range(n+5):\\n  juu.append(juu[-1]*10%2019)  \\nfor i in range(n):\\n  rui.append((rui[-1]+int(s[n-1-i])*juu[i])%2019)\\nama=[0]*2019\\nfor i in range(len(rui)):\\n  ama[rui[i]]+=1\\nans=0\\ndef ui(n):\\n  return max(0,n*(n-1)//2)\\nfor i in range(2019):\\n  ans+=ui(ama[i])\\nprint(ans)  \", \"def MultipleOf2019():\\n    S = input()\\n    s = int(S)\\n    num, mod, ans = len(S), 2019, 0\\n    c = [0 for _ in range(num+1)]\\n    d = [0 for _ in range(mod)]\\n    d[0] = 1\\n    s = int(S)\\n    \\n    for i in range(num):\\n        c[i+1] = (c[i]+int(S[-i-1])*pow(10, i, mod))%mod\\n        d[c[i+1]] += 1\\n\\n    for i in range(mod):\\n        ans += d[i]*(d[i]-1)//2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    MultipleOf2019()\\n    \\n\\n__starting_point()\", \"S = input()\\nN = len(S)\\n \\ncounter = [0] * 2019\\ncounter[0] = 1\\nT = 0\\nR = 1\\nfor i in range(N):\\n    T = (T + R * int(S[N - i - 1])) % 2019\\n    R = 10 * R % 2019\\n    counter[T] += 1\\n \\nans = 0\\nfor i in range(2019):\\n    m = counter[i]\\n    ans += m * (m - 1) // 2\\n \\nprint(ans)\", \"def inN():\\n    return int(input())\\ndef inL():\\n    return list(map(int,input().split()))\\ndef inNL(n):\\n    return [list(map(int,input().split())) for i in range(n)]\\n\\ns = input()\\nn = int(s)\\nl = len(s)\\ncnt = 0\\nmod = [0]*2019\\nm = 0\\nfor i in range(l):\\n    m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019\\n    mod[m] += 1\\n\\ncnt += mod[0]\\n\\nfor i in range(2019):\\n    if mod[i] > 1:\\n        cnt += (mod[i]*(mod[i]-1))/2\\n        #print(i)\\nprint((int(cnt)))\\n\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nA = [0]\\nfor i, s in enumerate(S[::-1]):\\n    A.append((A[-1] + s * pow(10, i, 2019)) % 2019)\\nprint((sum([v * (v - 1) // 2 for v in list(Counter(A).values())])))\\n\", \"S = reversed(input())\\nresiduelist = [0]\\npower = 1\\nresidue = 0\\nfor i in S:\\n    digit = int(i)\\n    residue = (residue+power*digit)%2019\\n    residuelist.append(residue)\\n    power = (power*10)%2019\\nfrom collections import Counter\\nval = Counter(residuelist).values()\\nans = 0\\nfor j in val:\\n    ans += j*(j-1)//2\\nprint(ans)\", \"# coding: utf-8\\n# Your code here!\\n\\nS=list(input())\\nS=list(map(int,S))[::-1]\\n\\n\\nmod=[0]*2019\\nmod[0]+=1\\n\\nans=0\\ntemp=0\\np=1\\nfor i in range(len(S)):\\n    temp+=S[i]*p\\n    p=p*10%2019\\n    temp%=2019\\n    ans+=mod[temp]\\n    mod[temp]+=1\\n\\nprint(ans)\\n\", \"s=input()\\n\\ns=s[::-1]\\n\\ncounts = [0] * 2019\\ncounts[0] = 1\\n\\nnum=0\\nd = 1\\n\\n\\nfor char in s:\\n    num += int(char) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counts[num] += 1\\n    \\nans = 0\\nfor cnt in counts:\\n    ans += cnt * (cnt - 1) // 2\\n\\nprint(ans) # \\u7b54\\u3048\\u306e\\u51fa\\u529b   \\n\\n\", \"from collections import Counter\\ns = input()\\n\\nls = len(s)\\nt = [0]\\nj = 1\\nfor i in range(ls):\\n    u = (int(s[ls-1-i])*j + t[-1]) % 2019\\n    t.append(u)\\n    j = (j * 10) % 2019\\nc = Counter(t)\\nk = list(c.keys())\\nans = 0\\nfor i in k:\\n    ans += c[i]*(c[i]-1)/2\\nprint(int(ans))\", \"from collections import Counter\\nimport sys\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nmod = 2019\\n\\n\\ns = readline().decode().rstrip()\\ns = s[::-1]\\nn = len(s)\\nd = [0] * (n)\\nd[0] = int(s[0]) % mod\\n\\nfor i in range(1, n):\\n    d[i] = (d[i - 1] + int(s[i]) * pow(10, i, mod)) % mod\\n\\nd = [0] + d\\n\\nc = Counter(d)\\nans = 0\\nfor v in c.values():\\n    ans += v * (v - 1) // 2\\nprint(ans)\", \"def main():\\n  n, mods = 0, [1]+[0]*2019\\n  d = 1\\n  for i in reversed(input()):\\n    n = (n+int(i)*d)%2019\\n    d = d*10%2019\\n    mods[n] += 1\\n  print(sum([i*(i-1)//2 for i in mods]))\\nmain()\", \"S=input()\\ns=int(S)\\nmod=2019\\nc=[0]*(len(S)+1)\\nd=[0]*2019\\n\\n\\nc[0]=0\\nd[0]=1\\nfor i in range(len(S)):\\n  c[i+1]=(c[i]+int(S[-i-1])*pow(10,i,mod))%mod\\n  d[c[i+1]]+=1\\n  \\nm=0\\nfor i in range(2019):\\n  m+=d[i]*(d[i]-1)//2\\n\\nprint(m)\", \"# -*- coding: utf-8 -*-\\n\\nS = input().strip()\\n#-----\\nnum = 0\\ncnt_mod = {0:1}  # type {int: int} , contents {remainder : count}\\nmod = 2019\\nbase_pow = 1\\n\\nfor i in range(len(S)):\\n    digit = int( S[len(S)-1-i] )\\n    \\n    num += (digit * base_pow) % mod\\n    num %= mod\\n    \\n    base_pow = (base_pow * 10) % mod\\n    \\n    cnt_mod.setdefault(num, 0)\\n    cnt_mod[num] += 1\\n\\n\\nans = 0\\n\\nfor r,c in list(cnt_mod.items()):\\n    # r: remainder\\n    # c: count\\n    if c >= 2:\\n        ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\n# pow(a,b,c)\\u306f\\u666e\\u901a\\u306bMOD\\u3059\\u308b\\u3088\\u308a\\u901f\\u3044\\n# \\u666e\\u901a\\u306b\\u3084\\u3063\\u305f\\u3089TLE\\u3060\\u3063\\u305f\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN = list(input())\\nM = [0]\\nS = 0\\nK = 1\\nans = 0\\n\\nfor i in range(len(N)):\\n    S += int(N[-i-1])*K\\n    S %= 2019\\n\\n    K *= 10\\n    K %= 2019\\n    M.append(S)\\n\\nP = Counter(M)\\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\\nprint(ans)\\n\", \"import sys\\nimport collections\\n\\n\\ndef resolve(in_):\\n    s = next(in_).strip()\\n    mod = 2019\\n    dp = [0] * (len(s) + 1)\\n    ch0 = ord(b'0')\\n    for i, b in enumerate(reversed(s), 1):\\n        dp[i] = (dp[i - 1] + (b - ch0) * pow(10, i, mod)) % mod\\n\\n    return sum(v * (v - 1) // 2 for v in list(collections.Counter(dp).values()))\\n\\n\\ndef main():\\n    answer = resolve(sys.stdin.buffer)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#import numpy as np\\n#import math\\n#from decimal import *\\n#from numba import njit\\nfrom collections import Counter\\n\\n#@njit\\ndef main():\\n    S = input()\\n    A = list(map(int, S))[::-1]\\n    mod = []\\n    ten = 10\\n    for i in range(len(A)):\\n        if i == 0:\\n            mod += A[i],\\n        else:\\n            mod += (mod[i-1]+ten*A[i])%2019,\\n            ten = (ten*10)%2019\\n    mod += 0,\\n\\n    C = Counter(mod)\\n    print(sum([c*(c-1)//2 for c in C.values()]))\\n\\nmain()\", \"S = input()\\n\\ncs = [0]\\nr = 1\\nfor c in S[::-1]:\\n    cs.append((cs[-1] + r*int(c)) % 2019)\\n    r *= 10\\n    r %= 2019\\n\\nfrom collections import Counter\\nctr = Counter(cs)\\nans = 0\\nfor v in ctr.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [-1] * len(S)\\nr = 0\\nd = 1\\nfor i,s in enumerate(S[::-1]):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[i] = r\\n\\nans = 0\\nc = Counter(p)\\nfor k,n in c.most_common():\\n  if n > 1:\\n    ans += n*(n-1)//2\\n  else:break\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"def main():\\n    s = input()\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    t = 1\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in reversed(s):\\n        rev_num += int(i) * t\\n        rev_num %= mod\\n        d[rev_num] += 1\\n        t *= 10\\n        t %= mod\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ns=input()\\nn=len(s)\\nans=0\\narr=[0]*(n+1)\\nif s=='0':\\n    print(1)\\n    return\\nelif n==1:\\n    print(0)\\n    return\\nfor i in reversed(range(n)):\\n    arr[i]=(arr[i+1]+int(s[i])*pow(10,n-i-1,2019))%2019\\nm=Counter(arr)\\nfor j in m.keys():\\n    ans+=m[j]*(m[j]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"s = input()\\n\\nlen_s = len(s)\\n\\ncurrent = 0\\nmod_dict = dict()\\nmod_dict[0] = 1\\nfor i in range(len_s-1,-1,-1):\\n    c = s[i]\\n    current = (current+pow(10,len_s-i-1,2019)*int(c)) % 2019\\n    if current in mod_dict:\\n        mod_dict[current] += 1\\n    else:\\n        mod_dict[current] = 1\\n\\ncount = 0\\nfor key in mod_dict:\\n    count+= (mod_dict[key]*(mod_dict[key]-1))//2\\n\\nprint(count)\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nfrom collections import deque\\nfrom collections import defaultdict\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\nMOD2 = 998244353\\nINF = float('inf')\\ninput = lambda: sys.stdin.readline().strip()\\n\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\ndef combinations_count(n, r):\\n    if n == 1:\\n        return 0\\n    else:\\n        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\ndef main():\\n    S = SI()\\n    \\n    ls = []\\n    len_S = len(S)\\n    rem = 0\\n\\n    for s in range(len_S-1,-1,-1):\\n        rem = (rem+int(S[s])* pow(10, len_S-s-1, 2019))%2019\\n        ls.append(rem)\\n    \\n    import collections\\n\\n    cls = collections.Counter(ls)\\n    clsv= list(cls.values())\\n\\n    ans = 0\\n\\n    for p in clsv:\\n        ans += combinations_count(p,2)\\n    ans += cls[0]\\n    print(ans)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ndef main():\\n    S = input()\\n    A = [0] * ((n := len(S)) + 1)\\n    A[1] = (a := int(S[-1])) % 2019\\n    for i in range(2, n + 1):\\n        a += pow(10, i - 1, 2019) * int(S[-i])\\n        A[i] = a % 2019\\n    c = Counter(A)\\n    ans = 0\\n    for v in list(c.values()):\\n        ans += v * (v - 1) // 2\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = str(input())\\nMOD = 2019\\nm = 0\\ndigit = 1\\nmods = [1] + [0] * 2018\\nfor a in s[::-1]:\\n    m = (m + digit * int(a)) % MOD\\n    mods[m] += 1\\n    digit = digit * 10 % MOD\\nans = 0\\nfor x in mods:\\n    ans += x * (x - 1) // 2\\nprint(ans)\", \"from collections import Counter\\n\\ns = input()\\nn = len(s)\\ndigits = [int(c) for c in s[::-1]]\\na = [0] * (n + 1)\\np = 2019\\n\\nfor i, digit in enumerate(digits):\\n    a[i + 1] = (digit * pow(10, i, p) + a[i]) % p\\n\\ncounter = Counter(a)\\nans = 0\\nfor count in counter.values():\\n    ans += count * (count - 1) // 2\\n\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Sun Sep  6 23:39:24 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n#from scipy.special import comb\\n\\ncounter = [0]*2019\\ncounter[0] = 1 # 0 = 0 (mod 2019)\\n\\nS = input()\\ntmp = 0\\n\\\"\\\"\\\"\\n#\\u5927\\u304d\\u3044\\u6570\\u3092\\u4e00\\u6c17\\u306b\\u639b\\u3051\\u306a\\u3044\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*10**(i-1)    #\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u65b9\\u304c\\u65e9\\u3044\\uff08\\u3051\\u3069\\u3001\\u6f38\\u5316\\u5f0f\\u7684\\u306b\\u7d2f\\u7a4d\\u548c\\u3092\\u51fa\\u305b\\uff09\\n    #print(tmp%2019)\\n    tmp %= 2019                    #\\u5927\\u304d\\u3044\\u6570\\u3092\\u5272\\u308b\\u306a\\n    counter[tmp%2019] += 1\\n\\nans = 0\\nfor i in range(2019):\\n    if counter[i] >= 2:\\n        #ans += comb(counter[i], 2, exact=True)\\n        ans += counter[i]*(counter[i]-1)//2\\nprint(ans)\\n\\\"\\\"\\\"\\nMOD = 2019\\n#reversed(s) ?\\nt = 1\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*t\\n    #print(\\\"A\\\", tmp)\\n    tmp %= MOD \\n    t *= 10\\n    #print(\\\"B\\\", tmp)\\n    t %= MOD\\n    #print(tmp)\\n    counter[tmp] += 1\\n    \\nprint((sum(i*(i-1)//2 for i in counter)))\\n\", \"S = list(map(int, list(input())))\\n\\npops = 0\\ndigi = 1\\ncnt = [0] * 2019\\ncnt[0] = 1\\n\\nwhile S:\\n    s = S.pop()\\n\\n    pops = (pops + s * digi) % 2019\\n    digi = (10 * digi) % 2019\\n\\n    cnt[pops] += 1\\n\\nans = 0\\n\\nfor i in range(2019):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\", \"S = str(input())\\nN = len(S)\\nb = [0] * 2019\\ncount = 0\\nb[0] = 1\\nt = 0\\nk = 1\\n\\nif len(S) < 4:\\n    print(0)\\nelse:\\n    t = int(S[-1])\\n    b[t] += 1\\n    for i in range(1,N):\\n        k = k * 10 % 2019\\n        t = (k * int(S[-i-1]) + t) % 2019 \\n        b[t] += 1\\n\\n    for i in b:\\n        count += i*(i-1)//2\\n\\n    print(count)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nz = 1\\ntmp = 0\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tl[tmp%2019] += 1\\n\\tz = z*10%2019\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\nans += l[0]\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nC = Counter()\\nMOD = 2019\\n\\nn = 0\\nfor i, s in enumerate(S[::-1]):\\n    s = int(s)\\n    n += pow(10, i, MOD) * s % MOD\\n    C[n % MOD] += 1\\n\\nC[0] += 1\\nans = 0\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"s=[int(x) for x in reversed(list(input()))]\\nn=len(s)\\nx=[0]*2019\\ndp = 0\\ndim = 1\\nfor si in s:\\n  dp = (dp + si*dim) % 2019\\n  x[dp] += 1\\n  dim = dim * 10 % 2019\\nans = x[0]\\nfor i in range(2019):\\n  ans += x[i]*(x[i]-1)//2\\nprint(ans)\", \"S = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    #print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum+x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num-1)) // 2   # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for i1 in range(1, lens+1):\\n        ss += (int(s[-i1]) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"s=input()[::-1]\\np=2019\\nans=[0]*p\\n\\nx10, S=1, 0\\nfor i in s:\\n  S+=x10*int(i)\\n  S%=p\\n  x10*=10\\n  x10%=p\\n  ans[S]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\nmod = 2019\\n\\nt = len(S)\\nl = [0] * (t + 1)\\nfor i in range(t-1, -1, -1):\\n    l[i] = (l[i+1] + int(S[i]) * pow(10, t-i-1, mod)) % mod\\n\\nfrom collections import Counter\\n\\ndef nC2(n):\\n    return n * (n - 1) // 2\\n\\nl = list(Counter(l).values())\\n\\nans = 0\\nfor i in l:\\n    ans += nC2(i)\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nP = [0] * (len(S)+1)\\nmod = 2019\\nd = 1\\nfor i in range(len(S), 0, -1):\\n    P[i-1] = int(S[i-1])*d + P[i]\\n    P[i-1] = P[i-1] % mod\\n    d *= 10\\n    d = d % mod\\n\\nP = Counter(P)\\nans = 0\\nfor p in P.values():\\n    ans += p*(p-1)//2\\nprint(ans)\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for se in s[::-1]:\\n        ss += (int(se) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S=input()\\nN=len(S)\\n\\nT=[0]\\nfor i in range(N):\\n    p = int(S[-1-i])\\n    T.append( (T[-1]+ pow(10,i,2019)*p)%2019 )\\n    \\nfrom collections import Counter\\nans=0\\nU=dict(Counter(T))\\nfor num in U:\\n    ans += U[num]*(U[num]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nMOD = 2019\\n\\nacc_mod = [0]\\nfor i, s in enumerate(S[::-1]):\\n    acc_mod.append((acc_mod[-1] + s * pow(10, i, MOD)) % MOD)\\n\\nans = 0\\nfor v in list(Counter(acc_mod).values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"from itertools import accumulate\\nfrom collections import Counter\\n\\n\\ndef solve(n):\\n    return n * (n - 1) // 2\\n\\n\\ns = input()[::-1]\\nMOD = 2019\\n\\n# \\u4e8b\\u524d\\u8a08\\u7b97\\nrest = []\\nfor i, x in enumerate(s):\\n    # 1, 10, 100, 1000...\\u306e\\u5270\\u4f59\\u3092\\u9806\\u306b\\u8a08\\u7b97\\u3057\\u3001\\u5404\\u6841\\u307e\\u3067\\u306e\\u5270\\u4f59\\u3092\\u8a08\\u7b97\\n    if i == 0:\\n        tmp = 1\\n    else:\\n        tmp = tmp * 10 % MOD\\n    rest.append(int(x) * tmp % MOD)\\n\\nresult = [x % MOD for x in list(accumulate(rest))]\\n\\n# 0\\u306f\\u5358\\u72ec\\u30672019\\u306e\\u500d\\u6570\\nzero = result.count(0)\\n\\n# \\u4ed6\\u306f\\u30b3\\u30f3\\u30d3\\u30cd\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7d50\\u679c\\nc = Counter(result)\\nc = list(c.values())\\n\\n# \\u8db3\\u3057\\u3066\\u51fa\\u529b\\nprint(sum([solve(x) for x in c if x >= 2]) + zero)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = input()\\nn = len(S)\\ns = [0]\\nfor i, x in enumerate(S):\\n\\ts.append(int(S[i])*pow(10, n-i-1, 2019)%2019)\\n\\ntmp = 0\\nt = []\\nfor x in s:\\n\\ttmp = (tmp+x)%2019\\n\\tt.append(tmp)\\n\\nans = 0\\nfor v in Counter(t).values():\\n\\tans += v*(v-1)//2\\nprint(ans)\", \"MOD = 2019\\n\\\"\\\"\\\"\\ndef part_count(S):\\n  B = [0 for _ in range(MOD)]\\n  C = [0 for _ in range(MOD)]\\n  L = [0 for _ in range(MOD)]\\n  R = [0 for _ in range(MOD)]\\n  \\n  if len(S) == 1:\\n    s = S[0]\\n    B[s] = 1 \\n    return (B, L, R, C)\\n  S_L = S[:len(S)//2]\\n  S_R = S[len(S)//2:]\\n  \\n  B1, L1, R1, C1 = part_count(S_L)\\n  B2, L2, R2, C2 = part_count(S_R)\\n    \\n  for j in range(MOD):\\n    C[j] += C1[j] + C2[j]\\n    L[j] += L1[j]\\n    R[j] += R2[j]\\n    for i in range(MOD):\\n      B[j] += B1[i] * B2[(-i + j)%MOD]\\n      L[j] += B1[i] * L2[(-i + j)%MOD]\\n      R[j] += B2[i] * R1[(-i + j)%MOD]\\n      C[j] += R1[i] * L2[(-i + j)%MOD]\\n  \\n  return (B, L, R, C) #\\u4e21\\u5074\\u96a3\\u63a5\\u3001\\u5de6\\u96a3\\u63a5\\u3001\\u53f3\\u96a3\\u63a5\\u3001\\u96a3\\u63a5\\u306a\\u3057\\u306e\\u500b\\u6570\\n\\\"\\\"\\\"\\n\\nS = list(input())\\nS.reverse()\\nN = len(S)\\nS = [int(S[i]) for i in range(N)]\\nMOD = 2019\\n\\na = 1\\nfor i in range(N): \\n  S[i] *= a\\n  S[i] %= MOD\\n  a *= 10 \\n  a %= MOD\\n  \\n#B, L, R, C = part_count(S)\\n#print(B[0] + L[0] + R[0] + C[0])\\nT = [0 for _ in range(N+1)]\\nfor i in range(1,N+1):\\n  T[i] += S[i-1] + T[i-1]\\n  T[i] %= MOD\\n\\n#print(T)\\n\\nC = [0 for i in range(MOD)]  \\nfor i in range(N+1):\\n  C[T[i]] += 1\\n\\n#print(C)\\n\\nans = 0\\nfor i in range(MOD):\\n  ans += C[i]*(C[i]-1)//2\\n  \\nprint(ans)\\n\", \"s=input()\\nls=len(s)\\nm=[0]*(2019)\\nm[0]+=1\\n\\ncnt = 0\\nb = 0\\nfor i in range(ls):\\n  a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019\\n  m[a] += 1\\n  b = a\\n  cnt += 1\\n\\nans = 0\\nfor i in m:\\n  if i <= 1:\\n    continue\\n  ans += i*(i-1)//2\\n\\nprint(ans)\\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\\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  s=S()\\n  n=len(s)\\n  s=s[::-1]\\n\\n  rl=[0]*(n+1)\\n  for i,x in enumerate(s):\\n    rl[i+1]=(int(x)*pow(10,i,2019))%2019\\n\\n  for i in range(n):\\n    rl[i+1]+=rl[i]\\n    rl[i+1]%=2019\\n\\n\\n  sl=summarizeList(rl)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    ans+=(c*(c-1))//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"from itertools import accumulate\\n\\nS = input()\\n\\nR = [1]\\nfor _ in range(len(S)-1):\\n    R.append(R[-1]*10%2019)\\n\\nL = [int(s)*r for s, r in zip(reversed(S), R)]\\nZ = list(accumulate(L, func=lambda a, b: (a+b)%2019))\\n\\nT = [1]+[0]*2018\\nfor z in Z:\\n    T[z] += 1\\n\\nf = lambda n: n*(n-1)//2\\nprint(sum(f(t) for t in T))\", \"import sys\\nreadline = sys.stdin.readline\\n\\nS = readline().rstrip()\\nDIV = 2019\\n\\ncur = 0\\nfrom collections import defaultdict\\ndic = defaultdict(int)\\nfor i in range(len(S) - 1, -1, -1):\\n  cur += ((int(S[i]) % DIV) * pow(10, (len(S) - 1 - i), DIV)) % DIV\\n  cur %= DIV\\n  dic[cur] += 1\\n\\nans = 0\\n# 0\\u306f\\u5358\\u72ec\\u3067\\u3082\\u3088\\u3044\\nfor key, val in dic.items():\\n  if key == 0:\\n    ans += val\\n  ans += (val * (val - 1)) // 2\\n\\nprint(ans)\", \"# \\u89e3\\u8aacAC\\nimport math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\\n#from operator import itemgetter\\n#from heapq import heappush, heappop\\n#import numpy as np\\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\\n#from scipy.sparse import csr_matrix\\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\nmod = 10**9 + 7\\n\\nstdin = sys.stdin\\n\\nni = lambda: int(ns())\\nnf = lambda: float(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nnb = lambda: list(map(float, stdin.readline().split()))\\nns = lambda: stdin.readline().rstrip()  # ignore trailing spaces\\n\\nS = ns()\\nn = len(S)\\nT = [0] * (n+1)\\nd = {0: 1}\\nfor k in range(n-1, -1, -1):\\n    tmp = (T[k+1] + pow(10, n - k - 1, 2019) * int(S[k])) % 2019\\n    T[k] = tmp\\n    if tmp not in list(d.keys()):\\n        d[tmp] = 1\\n    else:\\n        d[tmp] += 1\\nans = 0\\nfor k, v in list(d.items()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"S=input()\\nS=list(reversed(S))\\n\\nm=2019\\ncnt=[0 for i in range(m)]\\n\\nlen_S=len(S)\\nx=1\\ntot=0\\nans=0\\n\\nfor i in range(len(S)):\\n    cnt[tot]+=1\\n    tot+=(ord(S[i])-ord('0'))*x\\n    tot %= m\\n    ans+=cnt[tot]\\n    x=x*10%m\\n\\nprint(ans)\"]",
        "difficulty": "interview",
        "input": "48242591665331734699675685242294285199582865862911584513574599786866566257382116596774131528448481312953496624362971561414216476877355619357873435875949915166478227515726671289989636918617249177973221474674954123664345947967719423598193667874664479685356698785315324113726497514825299811688316866441724329323552625586455513573844661573358652434746497781272357365751453338549761328689833215864363597552473645444161345749134432294417532464967354887963397684548243943469234442943162417785195415177413625189383637974542938517182858319645763561563399114972283748735939449335138765727294246673151543862181872864866171265488293486915274748882868365179221277917988379171424464225488239892884746273976643168951233132896633557512163188255878546516677843266723889541865874496297827653655126866211279996484747789483125286637166138424393611489256876935251823529164442665757695954264755824635265869946889267385421964128912272854234775162142546385315529376586237336338849987393391323535253296778993815679762457942144736173417488522158921439529728595963974576492385587865778963928721644155715388982579824818484988757745573751769614482657893146416387369887617297996641315953491786916632874712875544194613243414877439138784365116165942332211887269713533647613895815167161116493689773263356587837449939142669158525911179861787641574267857692292464666859163696754774878496322226696973954123823717827356579659437185168968664956396387664883337458858957575148595472347279231522621465545951293327274881551388651761574318124384792649344712186271721438754128497795265697553954746624589894567384783594891593975227689956223578479361835398423215599997158936427559888952265869424931497632334574185412953585286942578922563429128347277589574253426527367517176931796116924663878414969323622735731435374825511527487643982979459189463681968865614676939229916789767792891236978784912354175837495937443151899543866183939933526133514983679971425633292361979139372829178315262584774344411853596959755889437764569295664366588357326921847764617382872695265763591487158378487922598661432543255718324865288619169293177231681699555321556856229786784368254116319656891852147363352158622296143165625661428731925969519852388449479722952613876191835634171146721957965617818141478421578981197576544397477463946378556375755551822997212733768923474657626928793119174533967564896337413894375954925126541686823359319553934877591937968464787865988314957345238414857534164211913649339357231197989217475985948114665312843263822869528839113623537216432349695823237627659578614999389359389867725751783675426579871798985565239446379422937958562446192546483854651891783781275655431376856214596451177542381594879571236476361661875997269986769442645177588278363576743388543788183543587914122634539719638587266724439464795918659995631837217495757184711843163487442769211956973582584913928271859218383623877832929492728647159839683826511686276178655836796267611627745293194375265173747422786874194929484368627288757637178733112518441856389446598664898861746475366538328922254665476527489798622873164867587547899234173736364572446158558616872871572482362536913488282585956848459677412444379266612763731338924326153881397455245438458557184478965648114674818894422981212462282854177917723445418886979375599915366758321974249668757469414112974985183579373749754923415524947942486278233146784911138279475294288124716223582949966168895943258653716319451381963682914822557666684819994878218359614763956244589278635816461197731281621613962473337851736365676356587256541665614169197322112151215967453636371242394781313458965941289284558223129888113617696384257258329439558277366337189458173535994732663634384369272664499255561177165418783572266656349111927944761483973772774163151599389866243616228695915219913789386915245918661795537335468467852489173536757934933262716122865688229452672739845961877749363881625134326258979167251661547325113592684653274316284139133787742919783217648326363147692778796794959493928219396163646891448834861317662452594978187722484158578161878787476141846681934632236851331497844488586369468792543774417275833146313819385365947716156379846716383778852566419155989658293534893271769647954978161426388437396684799872511697891617834877821423334196291244277768984543785556482424545662932211714992427765167961137183567362766339221291696632952378879954897369961683584189546249216282562365485428173251628786575127493218152632632519976712255992481867737335258696115134157651248515924611871789319516464395486384279541137451247765695169586974865869537228279662334983583275324822382451221298533543675584367548147387541961129392874917376513458264941668517838294938576923665128298138241343211952568511926815486188287128167787629792364399689386332539498382339196816837273279562662992925144577586545498498811234991735934546767161556815736559414463659997932959975878956144187566163995648532394987355628419581921247493359917543156944865573415293833496484384143742916694988677979318124143728916968515713619392921357239823849281578537712668472578262682366479312391218672297678286867634734645458429236919251698192553614798598685361485793228966379921888668428466519512487815218849194118566928697872651499999466472889184691418346648443545219976635839212472373471712391673689281725925661877867865279346636865983657954274135116944694654313288877579956371487249577185285397997784516814778196965467253351264413828129836595633128568278326797477768165837149256293525617271256321868189169763746997195435226647835898567153244771151766828637739868186417539221716735257934811572353288958838215311635164733227194525563278392175846629336346628838428558995986757483624439473453198555864272271118278166591747186622416428263563911735925617965863573941241417892781913484559913844239118286435858165775968767318464345988145388893657722878699971794161832358849574962814592376691667743213285839415232982986438563458239139185516749281193576825397632684976454817634132221553117725898474468464795774957766556721426681175589722781148683419683522891338142267276185454357353755318729126756559233789346779149595635716861676672749836463535637417622428928266914299848748575866937522675265924827939813984952266697744565183162256265234345646242971766331224156772178813523456835454469492518559449666662613569644973826469749951563364996311868696286269134978336982795764276499929521565532737248289675163851534784329464425489235961163455547536786464896773857446266851632526283336654913764227858627984226474746553694797938137857989199382966327961413933292679829372512916187418776728116322437433753998235513961439515463682373271469189611747682367353225799673433155689126442367548967194762351959523264915251527841242619853951232161512221366344281541268981948925629148446433425991576946737682766243464779892541144637981544829854946884428882477717788366353724718936855495265218218417712265161644841824946761572939364963665669477869493963726916772437528842251355942896167967583259985362592241675788983864617386932881858355147629873134529843138292161236435335796584192843952863116941518716458444915259343636217294126242839345866353364349386651638843975476913878558566558567974893143772828593425215133123162839377543376568556576617712433132578674168968542471337831757238762749683463312846246367618588686949178497872952953374931876565737718311237772987187988318925128861156143778223274245983687358421923121942343655154212943885293458179827563521133645298588168625228339769612533665282164769291378443947389531411271486623881643258922799626899175826313471919447473551639225784994954298913612988573314119994351782899753579697315665148767418339237148732732113742681912617659131624355574872547962721769957294642197448216236337745444214462591247148373864696256114247769784496998253222177468232993347311744246656773269656254759366913715448817283844384111853316794237818935645364418474691632533141962988295119325822842944449558986842136136831466658358149558574158935915196658727994165574366937797359689822786615718782848192474963175937761982133195686611834868563717133769161215231294232187417263774992231287133567381943266596698428581817769856919591165759845158149355593851889698264763562775992744145638285724885948958412796865283159482332826688389579569842146131315448374519662668958118896569455132959555956827889263811734449196177857273339623879867875774519298916982322811352176929458854181718625274194636369831267517616782397337885891482752489333581135998477578667658628851372773163921344619152759536831211939787925731594563384767752347491261116294967897336642273545844511313132656934833696154258252349393192762364963833636191654984245965991267129479753446684113525893632615174693525343464731786728543794724462353139645658162599418357915944449396158913763531732928223931238614449721589382553781574423356949142252733498196534636994228249615266672381326145167229654524585188722686541325621973447279388879496454282794685376169172258631372238741774369745139742573236682149511419433471841962165467132732668788465228126587256962516265493475378796887675185792232317222678295131862867366736244321895286751375154255323275659215857242554495287286915229921912645654319519315554717436457437817187862998525874717619817433955525714753356934954343832489267681531513948863415454432217327421858874213348374113492361816879536755954532343835237376979632128137519291465657832922691964571442173483412965255114125994453218343484795847822746581243734748792728855338181118654333171268398657582982974136932827818843436121226531919919395389396927542549223928173898276694359691578817311326117882976183543888489884416378756479748653933397538876637426169963317131395832736852184927886883933344398889824129848562561268654292129619948153273448391568868951892723563527834642684315191268215939619868822965254845296355919841532112619841757621843452626363726512638452764699453217735367388277249136459776165757531529457237591159639773728132948563272659913149762184124113929861925453185337974393977734865432228897698815419175543372169526563236694738348892923153394719859153527641542546615265366596453849869312782274875313173883635759374441845399646378895695785578977394295372532615383262575358267936652512793237163691692153716149691679534838972527953279244536196626226212865185133118135275631761663937978165119326917434421323221956367986385281763961749414464249829441962183896257513119529527698677494394228772518698484664884533314266861859516418938275853452883143294899457345384266357741817234929373457737452994461853413314577367338413887258265916199178247544252353211142611149493442717973913758871226256188339115562873643469834795624427651312512679328781751461891465797732143152128277542779939922258252424462579611941575357669426292441588855242694545185952178972799649879673171887199348123237162256419124879588513916418418187228699369452914146984577681198479665462132492777385957175586332662865135761347828411368928522736484739167348783165867766362498876127154925915213437687832338852113986114246987489387545225834637651583162899599897853984369857121326222544531917953794251424344221575682935832584296575767865844254581511246282418181597251477239217846659249655382762797685198665322443915563992433911354997334449497971195351734251318514934825261289319827236458942258896361245819853846716696523381471513516149341295797835836323996472667866656186123412644937126194893664168599381635984515373446873235124625475229454588328471523773232138212836122765332296634565551671193234314343264642453765231128811685157346377769872883956871657732445687887546855594321393458581593389582281631839164924849184819674243651311361846711972566677132182437341555981738285924747929497676156859613161453586479143137773598892659582441687999277188455947296835668565428271861928915645427446969288846428876354536556614281446244478486346669778626432557771645377743536561757691233993536685186232624846714877214252919819747638211693965176769784449275675558727548698392866557953982421145943979919912739441835899483345675698426827527461371821422936865228549566621699494987417262791161173328592862188567467319723713917839263388792789476673195427978596542625739112745991578664933588772667494654919816585945776146785638764524942792349993298383974466634238878548361177588355219221775238511268569174945247915924261153415275726217524665776924348631191615893524879531838632941314246364159122817256844497615257896783198496167975343166742554231473717534433927193114467411735886684278714438132766478896217626549145227784766468851418322465755912977934139116142115624931293367687549181948338676671239894228436689173564196238826528239191532999218977596744591226938257462695994613881618485622396629383243599945446799786433247297625451869748919882665857729425349678978218582723515622468735779161266772756726216957425264697812587933558828665332898952357937213451822792576386239922766129545624526489388339559382475962587724845825869154753845368292957759253228552485847838754949368329669976466152994815456149893677655538128767476599687432222115312668826992321946714196332769623939275174841681599533677925979464696941249838521553737686895339324632639188619468737459598471527725398897694898132523753811114711636547855896159686622538439878417427474126656755485978932295789989994669835436927562628948665373818787482315664582892171168951341275496666888762232556266765146194498813716845845661382729752787656253748379515577692662234784641638356424795654196622567563153412895983376146439838179912733166746814459238652261182623531454523927563194452355569933685133474781527133396969929265493395783129345485197749995924883132141215291779249469732768944125645292319561592621634673373352622623954898348527752936734172122538931796578198245988611882575664772511193881739355126976215678632876715654231192322292589774793122797639742548721215895286633553558856571473989435984264552436717985184277165944524863116573476149278411489451625276387688318356824833692881863521832771198949381739778464292361629368361297788754561392389872592961573234655124856854632243855867411182774383382482524998747361871928132353482645619333474812411537547619229315972534223523366461429914186417157513596224553235636445955335127218867297569564765466262747344839495663688622326234264633513489422716921291182629135384213644511729997619421961226576575146862462777383317659729177856589221595827265711149979153343554257527872484511468481659743391227853531448478365293664638166952481694257317539627251583264543928228497459727286848789714145427933788595854526182613946242366472741333263422954849825296236484134176392623385568714854833898851211283622899195381372969729395995778817618453965329285312115182228913365171924256934958545744919446236186647192369812618811291172122983169184127259729312722916827612765545848643915966151941119894567599165536891429694596634953582194259583868315476834838133541169695832463323949684655728581191495229734114561214556463532431983486858992682599313411261582557998497265651514757173366389627791589777581476733417144628437918659254715486982333985495795257381327179316838317559325745943474297679179471864232296592743634443271547552343673962223229754158272988864173369398183122141818714989188717287293277423391587763321738894164744227789529336348822682818141462923447552473742725182769355485838352681112584923994819874757722423174775323667118796666635413621987693412165159398869351116161467297421116565691649885448511532592865961366176734216328935669579565288371999666357533528549549125393765644578646352749193317553515612365298438667458145343682428369324971898415621541578473918418248479685736783838368215273777893666345894423843927477841973852929677633774542789684971717772226185345754589853339136273745339377795147381489879315264374665473481179441163763247653953254368249454163551755125416644845283442891466634878195996438685478532812477628347823361666787529555274186128672377724996591729361777764718889292846763763582341637716973378913942456966135555493593237631139691493672897493872822512967874789397547436129948123817972749847995593678988955912698583216765535194953939242552834155579217542232384885843435782958279832536698136212171711814327656421616396393214819448752652496561214269295571335645996192867582661377219568551698141396993357743364197776964334658123297393758762931727646974768373877748487699489116977433479981817538434349388979228364399525968753129315776527957888418719346165655193332266936352445891933254674257663538853563657828189562192167369284927938321924377232854753283814768645684186943127729473379576372792175684157171885576119725127352516283955984716194461511769118428337237777722353721744991226526565329242389626987628334742667569693297541966169544435131515528861614469565722418369158344496867582322729263431187488428192178679833361121133858294364865977643659162175453578836485613351691925967494128767554574718166417549818494882794943828964247468883766848989226799687233527399878184381612935238481134425937392665658818387497423371735792511661946557924465154839426129854684456581647341229468263262982524544687791836568278979146112136511252438994752729986419951749746431773669361779171852217377676431365632178895185184191279654876763888948353234492221839441254171342494576482231475189525661521383687237716736284721469853484157756432636667158664669247148392969244169392742316635954519695322588146764283525456427737654353878295557694479357538281869662768712421837971589563263556323823367296983273276994553316877332886617863978321262119399941986454979369832783745732653693463594422327767457536629325953269467729794791754829154671967166547422543294542535733635965846195234885279683947764538289181498869242284772228181149698877947663162595612789421651694746859947567349232617634818378765765749266459573427877481168699264567615531697436276649697983653689759677351311212291125883247474427418355138722395294464671233483697137438181681845745234336828327665642228957445956811893982696763331835448394568133179355757613446686918658359246767676882332365417435551453931359765711722791372666749321842199894553446839958523668397845189715481963592255596182179568976477923789532382218536672897188963853995559575227197791277665762127792581942635818629532125157616159489763722952892916765657638884949112243183443153483337954535253349516376314279542739191342378168896286892664623857645525528871269322498167651281737689772839964893224781277397387795675319857172372911652793925841149533666665949874531431874453353633497428175737867177185276248974627777458363742784864848631675883775681231245289623354958435437251568527178833891892552326172427661766686966133143811791317437777323896491168411179525571365745672733332324634193842236833561626824349641395195622614187228678854426815177389727545168734714273865593325986338765483196983815834452612346883732133233491348789742474357453727957651115948494796119741394622699177246256687676544831826374253823237676497327171584951878688814283844239668555317425743235444258698937932963455816741942452869699597218328535691255489879142831229272543396245522655662459962919319339921252521292571586977251745951523385187311957915971179131476966794594689285466654691733163124418179185837813762558737498687197752629817664289811589381824314338169682715749579131162198559736914262323492361864613722593346445489223125336416147911987789683352176244113531342493825747338522875476319531214695776433842238394347795658613671542865896552341616229341416589788744432247828111324497546337797834177364159576235282127234779182126566271149391485444517613742795836443246562716699838561645511136363623259121853952332386219887282437981342657621812727213523739177275564791843843315959864257943678899417383728264827916825978551542638934861445934451392718881466598497866697518648798478953943254137319977329933686298475285537816111596732616257662651386159123634477245215154148192456219174798193826883971147625747159127787249494658886952414145329922534335688819576723437337154146441863789199436277318162512678288981582631989244472176644568253531891331549775642162763313796179275261762876134276111259932629999867126113577266439211123191518163923454854368555192818615125952132733759733439629242644772645663755219414621446457192148463677488345613532767825898929643183585636533771677883941992898869557291893926982276394448751457822933493537785518647718642983228874396377335783843436113298535419338937182915583258432187428559941466123125193811124539325764948636775398626992796346649356977923133819723974349864171749351523456699926756623923935393715415345318172945467921875436142986661754522425213631437952516464496272159262924856539462296523239296136297788651875434569643268694793379132674318785784829262186669224871489344739457882385351758317957854283232867156857238272169366363191789882344944412572495116235263449286793877917738183493514464222157713383729424682614988265483389184464695487294977128884241669415991627422263196181586369827314287985372224575438181121122297199696745524139383167542946983377222238936912513527277899837595751382894398597354493272835191771919633841833729756565947887579515117994318328794358841287818415214692695731732416639445171666271934333859481242895177311346567147882491341111375933855195618518929193174859596293232996866651632458943178323317325976872529467985239361982833522831826249477541953545921953455917647623887656353659167432177491545272827481765249859242435964587396675197514834739522659418139145718978363246137263882832831154663639616581123343686565466232233879978463125956556814779325411544774136925297115112895921252772429123381472375298896512655667943881643435429555912657869249881482779294279255524221953593714177591925394893759892352692819616721997628672865519445273357739923155513615925967411397955687582371317595925628487113322587196517646339312528523539634983538782687641226255542721643193553697742226263837381515435481827237914776966919933991228311491244712432339338673793736715988245272888788579732481569245497643327818719743831391975279842751364631763251398153682692893726122516479477345376246499594641936974269898217396775518663434813573424617699913268622113448323264519846573952512839497154312568375758754135528295646323628998987527565933958897715971747211223485995255593394191249482778569745997935651322341147683528651252372859971734771574466898763279586829978856947993964739139469397837679557615717591455748121231749499765126235733621471138912413488655829229862343866263814436789552858551569795445257999226679298144395815133393416374112119365272153867765856555968877837338469994713665465579425512548859498857931986529469646999271315437542848712792163395251443385291189743197574157422799868981285857853528482888322749884392944117675543952712815213655824635743493629188112741542473123981746332733662214953326392641751699754528452254747649297968288547428452971146315891293582977325282646514627368431448648314578193928657319361465811242224362279628756297426613566346197691828476216663395875982863827954397661892747155756416576192696896367241817868681187882784493475564391155371255649887535781561377326577375977998586429279448548123212584779148347685519477363386293835788574413499867952391299884795741728535957782242792345547662551357174847343545829234451544828337361572643762275989888531283672581491394194313329515681426823746921526787727323754462126685914527174534545629539718282568957381595126666737382427464637113194552672877578662171575747195712656181192444733848468591418492544434188864123917683774699472353737917288833177767249154994272796416152429864434495286455577177834222331174481275912414698671253282337186829999274495626379412631967831449112781774164645883926262541988241158997936142472875132748322624886791743468859232772934326851729238348228256249727796383781453799431811375999332249595618522767938372498638888157414832794558462388317665451449143259987426451937356281643771518783962418751455886572746883171528928392851668683139137162751613868986348232179296345883291989688824492141193773976931888886721995124236445373669842778861242694878914238847219579436916698528749192485338898155343956741436915141237458264149362769191857488127117356592516342862547611662499382134298796894443732677316283424668349177723293974357764576427446593416828483921681832428918281169847673654883297497794975799929381475599247739216432518729183676469441563699654173231133376396587487419117368817117192836888173534796857113567752223375897245771279363116682477131217672538417124832553655484859883817629245282561393128862553635913516324887945477112667774123773469487365376286873831244894157531847692463835582294637886814831984548296179647737621235546138396495764884877296712543811727258526951776831132143676152766559678187466958247752373559538243756317984422643632193912949348419794933187664999871164646118315352219163866229297426122217739538436779294432171659861392685535635146682722372752762117543466666124737869786186952471945543191848452443965759341869813583495724967572831862885283443796596566975931475952582267231366297124662662122111282722716292271453692182593454765399126846182652927165493575513984956493722346764264651855165629177741537315421949683589581758265474851744197562543155911969519742753363819753835582637913125515694738648252977368575946168477969854344767748188298823462829314389296665739433112648244515453247487381324894615255671765466419315868952435622259488372596825785531843235759996171942169495186554759188895294869957272757678189349424662195495514794433569492651197914693773747141529919458969555116739117212556492815859731912656313441489417241875944217928785139874142156149317311641916767942199381731282473119946844357587751964561877953565447678443771544816437736371438452233667149931178139517555559533423371527219859244545924519367848349732773278724579531656249711122242767252265124251748817165727547219678757819945488866199382445512569476686291586932887993228236816342929856336313531946781866716473342646179138384581583184963558683258594854851312576665542153856748244768215843655888676582487741197369516779572729865978847928329946987198941935884725829284145644512577847366195569734434868551264897438151274674434617842381947366382592462422188799894879946192831629277678751267959424664395994695114334478852574767993611286117128658952826446532126922585436983139299314242965145852147557778571113251227567545385792264783167377831398676853886872539186259357248524625465577756969948784595328978559418723731489298172822995598568366272975234848987622979954131388282394692688429755987322773886694561516557127527324813936123771539163677476785198939268892731191323973614567783751143152295752538366152146367393282214244373192497739519236779525321625348234124793944753778892349695992844963973341327857953942781672368912299223181591626969126781852183582662946584386278268667712184838484125963741822255481615433949323932258734692397881881537293161954763141584878626461846567995357255893263957758384379482576888691949438254959576935263594792873691181355574732557785594123433677173927514183628339369249356784462411292885243844495246878844379282271294338595262648381359981332594987287372976626841392773544698481223779893892836732531541627847286342745627585969547511811414566738235393186916375115723615525354266457288846327499137873526595911412267263558988376862264316958888742847783991282677817635194513252764735763395566578268829348216799252287928272257422894171438178313785358674625377777261772728442821228695193478587684545578381854914676346737293719695858992636812422885726994488266948264796572115373213177267228962273913216527783688672527389852156427583317772355529167785345342566623959657687343958468666367688537383962168217371656362994961329594656829223127137228629668963634273471762432265997538317623398683494542281751526648265328923539883615434448992471522316638893885881777412596124793559357275773834638722945383838586514756827687182197656287835171548731763217695586986345252656939666427295681339362381947768547282433698678733267353648668418151365641183295426527194483612996912867136943686516211553695955999288264158655817875936383861367242999274949557338485937658385976489854832634218699266212798571177321954575431498712171191768467772272837928254995893254682346455849556442186519957569362494753369568678588656187858335489432474786243114295719674736649925594882388631662481878637381612811195198147873766435387256784331476939735279642747252523661567336347335322263643538645565967619922595144134925999518451481572396277532851995433442588282554328977127296284289279845529622335247517292673226497672783343245354746675943174149576826632944932324753692412612743479248992415945638596853194656884522643465421596786284971355791523257878129765927352174414381166534779193682981617634311741281359422359544129473938753342644211129244415953465624669753987915822471715124324112753212155138833882992387575533619771288367374667678445957969366937337437399799487494231393339695723456587219327969119666818363727271378872341539242822184288125541685275949713141147718267853743382561554657433251281844731353873682528727913633814227549931262549886579474862356599625837497679141181967873659259798855396285494879885181452318535827236912734797852845568531256543919776141823851498681836178926429339921623912549845949869844245968878448534364316391454992367667348421283287742472239612549272364762277813815188555568521573254589622298779195591447567564917229577482918683677866688826512277971253572731896133297517787622695195636277738257958539581119956269252619356376486193375369192668481563935838776412683236543481735478248556852399529231228971632519454261921774956114545626766482541293948295645581896691389128513635882835398725897946334338399659633323422235769267412545589922316673869857652454891356756346313786163252611492347251356219188675273336236727219938555581496687914419233161356347548133527647616557992213989215286548817835253779573199499519696354128765387723826169452813445549366341826637812732881731913149738377685538274342722121932345292141455426985639517798112489325456321172831132632132883273651736429295795754893933599642681983776182878129186319812389573413714178941672223952527662455112891362769397369649431419714199183685752684664566481261891179529958576886728387693912359888251784983472258833771771672886449858691632653831832242747194228827779282813281546799988197223643374915385151911279363492968337389792485771577958234716818944764262613723657553764138911257783844383262621356422354155915936723515917735555175481439159365111224975885934874533131346928794217467648653427967857751463394542587674949445569171191623842551664134945459811372938866845643548591783161561389129627844594668788862158126957739891154126899918978876784397234653234446581475679182752576638823442648964644771457396777688951684725583898725883325489877332667168442341384561212594414985237248792885167328499559722442267472283676671185915941248516859226244391334497385536965373191219549778114161769488738486339763188337426449195623522372576543878194627256861918991116868865148974399244476737521749794153816525327617229575963115766983395183977621643241281795565737321454797276619681227691915313175918792645248474727126316851957467157232697376153957645451692985743688379135425568677449475598626696241576412182242214987318551751796381115831347949779845368492349755855683343775279866712193581729539678476527986448385974586552449965911543336783483669657155756771149723536751555891827927392932123367869627986292764943175288329328333349724389818727358286384293211136831756611865547632471754322183953686468154263273752719414838757196587152788618124796987346777212921389267691924797768943975541742496211358598277793273929129896853275468917559147361977191456247627498142139899278863358884584282735624815711851824162897675375396569287245122821613426345513146339165638363173382311195974186389764695874411148769186395241711655392695917474711119291593133817232291843669125762384475356947414577975771648268311643863932984516371876569182257271237361624156293412825276364978482818938338625176765482531995398726445714228874815388138134489736377516517493342279613413558231111983251519737859373576218332968397865855736729344293861876296456424437489272542215653173913745764661499328426641493192498166495255241845179463696646225961411796449271638958958623117161781759527385714278245231227914314316493499639126329391782499951614124789549543225783337788188459186543681919154569146967582127631679565121388711198921649627826851111865768299992498835155491525199731345374274576655568278723116313781812176853174823812153693373547834933449172141181246779894551334519817645256968751836299713729914328834122126435221729153811226612814832226576848584767141919996462165532556242512374321314733736753864164432229118669642952232597633256348393441458423315273453611995827896613556135443966964736434441519573737662157728578592384653587965727615184233318189676966135157781695886851793116729237649199823412485558147889755571948182967845618892246885463746876913333558685598253819381476287841733529285227813785648789168736134326841326434349312575918619582344573824827785315497721789831523789112246539281328929686247591814719334948937943122792113487422153327342524394871964293343425739548533628674975399258299254925924569863685357387524924289298588761797868419658127411969794146951481851236943158753499348445348256946211278261277459565832373774442999557518174454947242946752217794247842271142277195358857157129994223827856738312327538436333877369448827295764469756929543883719862254722435168381841749452415377328515727955357823212976761952519285191924155679729865166462882387166257487754382718942564821585553521118839844177548352345416888847375622949792797355447856811633762966858439427358161925347895478555943827834217593345653585198618539219824936398553225786447616194128219697889258638564426876291327893973311394365275835972628517545339671175272641663633854329979854625477646622934463473115221418443958756461647978146398361876819443742162346184599192261651799635297295684543952741425141387183458966974489165255773988827178343511347283423558943228179313829834749272487113786537781676872527512921658989732819711743593298818872121745853886575111718895364529616935418781595127199744221475361914559724723621688748322224469945525864299386644993517842938129785887655511394361956429367385827968382316564988245613363162576732571586464482162435846651436599784977469465276649934861465589487398378269697586924468285399491347814767832766865653625872181859112846368111339946512576383174679439786127388318179799485652631855328321868365354384483613466485167267825392839733739616852693896744767216627188437761556761294447922414541157632251884551697384718362115144467811527812291484186435937385318349579354343173763272756833617598227567412842528143595176247117828833638846488634119192447863882118171741819999944253853518217336648983683867623152133434636954824516818621882522792283144238964496871473864331656272235754792758212794291993116733581357799467496594387618716973936175711182846493197398171299212711894652962477533914993261258749189482479446335339964952427975936921432593844698942264934248917552886111134547833977291942261267478529692238379792734743789135863898178461958913558111968468375639599378417234153476148945943629913358874323529747927912682787543951555987213855822198622246615868759255149396479252378989782738769358929877867995343518825912714919871419984422527773597884453846122199356122412317292657163345814787717711669924291535263933643432881764164546731724538224784197352956529266486956291438588785248879659577189616932936116199822144665154228269252137435174378493713716451187578347435214142338659623127515646887527545482782686813924353121796935982536718817689195442683884338911729484445629826957683811737269716493951195233319815915359767428861491523171847549495479328338457465328813879391649278149125411427117972137627943725939511827419927165815593759884587393417587349971382182154664291422641173316932419429551719543247485837941517993728423849545997463711916251953729841332117447927221126539834557698318526977545713844491863774845326888863683756927257456233564859949629689124342963286562587832232329598682262621845438778569298123742237837294492994625882435837389757936636775621189321271242777729342616381544144962489547612658799321651447673941971364258194154972962483429748468933458881668638866419321733658679583382682612388112571215667565635921781851117682277328512971226543768617488626357199165596738315695957893625115554612553554168524432947388487564516747724863677717379355565482458447284713274247777992328881677573785942732983428896117184742971597457592968947472745262666317632791541497323744814749542485556293317643937559679241319389584145777431711844853156864738876575355514927685366726626575964725786421319185538818855656478942845927843842977436715168555759174342281731173132698862872733688558521293654938839251787283152383138747844984962911448126731584339358887523384235362462299637187267853274147241485346838238413253773257577229969634373541683692416276522987519759688493491195289997225918672769663761394267745721698681523276265612624622136433134867678552734331188428597878312571313749849742858338469677665131534531567185478311826697969884262984928226339467475271955389614666985982952455537719363451127915269185325555344871282512838717846385911573616285171441522257547173591965344798414952724327239542676967611351664512318526146913155976817287334954177944139461225167973414216729453837715561549495344855353189921178741159222373694629614147561287659468647247255182366951985283568451263993925724865187392369135589719389379272214876813992782555223999826736527461422287772713893929986831623233356484593773213631492557513574554919238222956618521219441352544228873721982783421975536177391523355978836892736956456144633468167249789197816111468119646591245877314126111716522769134765432429494377614981152759667539354897349728179122949859339477279667533517455454761584354746766329593524862316187139988886258742471239318563579883447454674818262198853687576873455622957476889446573921789184859189453416318346753157345363745384334116552165349127877898348818455294687841926175378275877325281388719917954113724164286454837258568765688379279968297443779432141891542695921335673188983755793839434512816134126521571258888814853533668791475152313611323977518738541215642963845792324849969669568628643764858136643523118688287524424289157665757822782478164587272168994799217242272724983136381689424727268713835584723837966467493767896687481586314967845459155583953938624117649188948795937969798622688982751882168783236248275187131843229736591352941461782117141946856154686897796911812876449839292383936913521371583665272452815977466773223719562436195577155943449354375295737523389765788379115976646959376522753865369898221589785735797945851818427587973686633131125686434829865838113444693916857657133541497184426731712386555771439581929868415156118512452533554756673763154988137675386233553783531691955517967223288839839843127783372375653724838332562366933133517581531665581377681244564342177611264187768599761135795719549836232351656961148127827846336348389552818554218761836323145481977261999767836869158541846159966317378524727249153283241898192173579122745383915925287432162656387389554934517446564134378785439154447664353473849431892423437465826947343442279815938377293467128692927153179616454615737447731935899515237955895291688791393449161913693218166693925778529123325134742349447287794847292878285722291445176449121586697857273423785186563363781517933467267863414199798935978874292418879668261267587749326549156558933432435855719488218142335978486986425216826581647516957979551887247672725989998825946422683294716771627198384597421269985467468386648495833428866273772373711582538193731365975247112181889442511989426444333147636192825965234277729957898697611432156737364832285644413669115947791933517164958812174241947386438588262233412597659632494798629172141352825444952753174985863214938162416175181731553139964921599884961622899749477311693698333621197676694655771436536214462121266158255592481413887294452799852549982463288936164886991463589942835846243632154938416786382882819832682469359545235214746935981541569327787554857442766186786378323878227911369636718433895698953932614987342357944348811671391557847954337377569672664372398395936993774439511321955173769647151678234712691946137482871723526417337238489634368317781972349989727622999869612233285445231555197549622754118145378486937772542138239774154558387816797613789374386182211681751766785715655382151838346756498245194334523164173374597978277355929747735269323547867511935719386628957778916367791372286588473531343282973359632121825259223752291964944554815743299347574245289932732398738566731429966541117335181999469751495213293421461215798863867834118648184265665413365519596477157969412183587478747156667782584228198519476992357879757858125194121992965511518194787846471924779222549261185663218545579416794654494326428753753612619135467353524729295326823117996895173926946923858399828723867182243549524657345243413163245112723557715447447362793681555383381551691854671179548192955228824353746863722747876831577788754345522828941268217125722843597379834777874646294274789282433363729883399346516389877672169829594326946347594837656494448578214688214891349588798776445732815364577512959784521593482988236395677718689442774563785937681938414766783582421726385176296964329182728545259637471779976217677215261861997584117567272467969847772117584375385937642871572124291695465522792147435291371377557143332225786858141626616997751461615227268486269386312893121393125391155982597427532525945423593321955433466924577119281365353146694898558351322641183278288555337414263226338696367267897845221242624947768194552696821443414918951356155818238239269727575779451364244724313155422933512784762487771316572932711521572864418717443898483928899214315285448347594341121238221364784826899779337876695732244968691329447811668879694599116267896171875323391255499873626469595321498789593875722153682247281835481784579587573499652832496595734399285585992115626273467586516327369553855614675963342638272473543262585434152671694377193329549265564576493973676438161811778712559774875122922666873425917578975358994316963137199967698279854527498416393496727951413549669894939589758586579543867726922342188412526514824333841239788579657665499553778858143323412166991331313227815862765679853538737965647685757688965763973629494279287814661874615254286622136188113979765921328558811665821425592769694698332915984655659524258118353371275368961288238768854346728738712723662353138144393975321895532217447171732915498737726176545685668987816348833483991964294363573398831311497543976445323291847149251116478511388458687269363218827372992544764141862297682923774831326254761232863532774896949759596232713365637798167971267897478236277819355881723872824291682893296486272314497454264314735697241189465628451284458189562431936923859386134347458877698897833778588275142267476384792897982511522439668629424699162475572653771982813171357937938547553581572777978947569573718885314591322761653532256873653247616299799515987886574442394983347368553243176431613295883887635629483128997883236154894125786847297567686538125385519246131212435664162893316531935728233813974145126412458879948928991563362511251568322135885679323287939336327376765464859146855125633516366237411519814248879231625322982264894594364428498775474384979264951539719222154498795684548965162972818739486128197671126698483691322932355432791987189516729183289552895953127287925614689847824328985438674151282865614186487957755424464758752941871436188123536685399758827478655887538774762951124916679188639244865645828865948793426676114213536381458912125759965362564693995614245655289885423143263154551449766261948179455287839827386942158128825452519886934672153529984754439632164795654991739536985944684373448487872355279481338748155471923274575729133198495671625985642575914217361165398955229517685768983495218783881128258477639773555286115347393786163796292647696169737139967878553685712379575539393544797147138345218185877783651816629733995836417986191542554384443525173249327593434939739471433476191242581898515667837393225563927571573147652733124659981598915454261774323148545738632475216575722516118378568789895654353936718368546924551168937977336629811237992229818293384682698393244141963634813466281695362338342752668886618863214847832788135863893816924811169175838922851296188392431266754245735237767795662523294416547548199247956932427999617149913211525593747752536695717388543486434738942328366867847599316317536822994323926333418413793644741146517811849521773462127666248936485337181673676671954124968299365861184891491659595557894641117194853281347381115382687133418448619737919124743554828935779911233365252353796241324749378517544925654587832672117353779754668214758757218442982666732646985872931372577722432395831992878326622727945576715862899785568777523653363434244844649354587625227171776613843846633591649268863794236244282869332257667279337795713522736197439247478461293151612539265788469144611124978575387759717662944814525914875173337687719887435893632529242648438331782598794528453272957358387582613925584728195732318431371865811289874339559961832582525623131156548916585613436168671457647551865722186462927163614945889365471585549843777275331645618727654479964329513376592449927477483544535331115376435625833531189179642331293879651827889135568246732539943635814915528741413187333655764648499378455232165774255617759331367177167396677898775945279424773772182372957343512181347251422963968835233232499259198438474336674437922858317816362439756831358784294112758952971917421187325159423477612834119742864837398761435544331614976887784731294568471191681957522737813857266355723125821228649824388796699494487945884442532753578311615233657276514865819698449729141456696452878914792347677318265698818585817586136772239625488197561312399598842496521611547586698718964242793272878915436839726115885193367379644588629236994528532937919714777328612791112555657799611428815945127487956839383364699856768569644388992538144123772153792415962648456535878977785416378644884447826878133848524479983637416644169936858468355731727529164755912582349677335378478625587542996691873166464482466684688428777625251921788894119196124759253988431589799824525298717166935592456989359286989328337814782638696789429938345864258721361566918835125117123314745556973478239925369171611484939466993313618878259766773236713515661846388224753245743171771633851386572429945659411583711778832525487422499873373459291614881491454278713896817343213955613238485533464759428471875723962627172224358684278164927868664742379373969218986721546185613571875742915376121733315895292599985892879794567116479688295372899693661792225181153833282468516134458788643744854393797992447681496813647788244734443215676413946872292234177293246794164192239625432628345153784295414853339514669163814714187219461635452123228482477582874992715869998685991826644876265138695627394484962732768527324819774989754713856357437236644452731716353341687347668626318556138948497716138532879738183871376864183984951499737525844514679249991396232754132881924681759185461386548373515495798555423591646167853468464143724391343788675594158874614646869816797135653879543226538464415353464378487594183658551311748346927693131649553994148655569829156398481117212935575312238886925235277283444299183219224196832745934165268137896256148812634212796347997578832252255772625497925847794158698939781333863874668347927668138747132553157346865522533714399298531339484158673434821965456793781275912163679546148672425999976925948544718382695671955394875589747176849748353765459185543743227253844489659646545724925324699573233937639341831271265428193813691596643175911938813357322529295679252455859591519554342717685867626876825299116594483822647328332584918613187212481248151482964928711847597329755741831529195715122261798894953564548225828489448717728119336555913712556928345943353144641352374471798414299864726764976853686347296526825114763494687686472645235735117287975171165584879153385218415681941495868478882995556454954873225197546718956968218879138979169398842486513928738822762877735458762572463866489749329189112872797598926251451242566858426233897395796589488536686124243679822964735223948348634233813978873381258564434896984753673533692127724781626737341234434668119896691381773241129967317293667737389422597859127374789699933771488738444594687961287727331519134664668593379389415643294972413451156238214233221371251945382919659681577732379435731562638647593289592543534659431843472168168471559722926753923924619954364694149838169981348512896396721714651662567824533483461835211283643552969913987314978955491618779876724936658263253492545834645832693277662816334196712747613872323851621996289624618581912735852876872358519711284313764387854666414677943167245513984514491823599138684939619686119381358788493542789759881161515814114396933888632415864871487738235459665538711825546647612721149489459349722159357475192581585194747833817776937212139828646958473451213627327151869624125728797778641949772974476315515635312183495829535394571968618796544686698687248897436938923662394168629839166389898465543248948664291356976423446843317321891174221187924115662564993329532331167451153384291269264261549411744791299478936459456641987319166877167565678495149573945426118129617482485287141656944716465794389927823592487199189647971937685845524316515678538732457913323152124417339156285384363974126225587592743897955825599576839488414696194241358799887713643664948269773265632278574145841591845657296391531165218372659876648881639884743344962378621397827694888679422751237455444265537861871766634466728257894942713897847528935515841441579673341387212724361981463447277167697559876842158534318335232954126253389449428422483665646881185316184261161341619646543998171658912556245615421736252964918847684618892288512726376711565753891254486442891628832492932395721173742525958754544715543223585628491633735611956898721143559537334181677424359471387638837175988616164792621888398316128553641868844693561231958918749961131581553346469611471518889746354292198987565781199258683777318692131785811465172851726825327798233379425927976956588334358871153983396163296812572241523217593597923417932612589558466142666335449756171167644975447453489385444821925867636315366676239447432798816794731599252694961797163728228854728231386486331624792649223542748777465926637711389495828811631122142888375618839555877184227465144259723112641845626254336128635651638823275172261569681585957116722255579831784873987124553288439735281379389933168443387458931721625641938449432813426481134783996732255696711849883893556434995888693915611224866255216514516576682764944499491612383649751334344462647466318474637414617766241831151349424693578731615449134128327548824713425122639929386411383618916624689945957856349867151633563292425544726779883158186252622327789777559641221379935626561985629825679871379841269793687766195725945116988998764963475542231797989791121521916874898495119547268554828441676348291322463667212274696911677298141199624876571473852578829999466588636793922514575181632257994287553894997378586681482153286976972278942779399414391892387814157561926834426932829479966289325713358214827665274247449288421257524264447666261266731862223776856567188748682669751272961874892275512181235944415363516673169611522375867983594887999944395997239213151273555226329165186364145634872111257241136962641398883111777991287294139518591619354127919978728531787787766353157825945735427776974952796963741621158141656148981653574575954289641718444773938629617245429852352382411658269593912328656251886663431142133225889377143336183174919864492414741134287882149246563495285598897284472783174653658633123166612158155488626819573219764867567646191285335112317731985191967996736316575449119832419469128733177446583247168317153762879998231187484744121657199735429847684168876534385951718847113885577327691362313444399594563132924276716542251479885998158557897684237972825585911742971396528914165335845872788169978715524679716467673461815423776172946369674427536823286219832799856289976473199976963759712148363389657772174296835615149452786112665444924569333654926397581279867987283858312788486427184183579379552218881874559573179847156868781873241766123591968828484351685115797588548221853627181394173385377773542443423745585982992812742186235968678738517332925499714116244147382511627971619561955574744347667623192659622295134862417926934443616534368555839396464112172316796174245151569898143597893638772431295176434619933988871886193822212679535375659888625767943828712881276714474393214476821959325463267727313856171691539858694543236981926577555441899357892737532377482786321488666518487325582695231278812151334491561138548129875157874596611396125936959853299463774295439949951412278544396456596237918555954192561429272982364427341714766166414152477552659478216534985872197246193797193863158897436945142696494543952887599827449759997811879381862585458549694612682162148552638573819466814275229643129355813322621435848943996116673231613697538556983239396348975672519648654891438674332875893126572435479548481663618573159898377471742385766863563559875359668556732132338944718573947716879981788196264746577775432854932436717622289634355668134576119211439648981324734955179422217926431194855622531272497488592364394328911255761428644381974688958585837879769352559934353237894727151534297194113688891775139114287867447934313186262478828144519424577857441644325888351119263471234532597468845847596268439264558914555974121744117186438594634239753214983948784911841775371431155112725482667263139153441816282866895914193852958514588572842922146731986128629947519112354951331329788325637998989931957995228995737819163582246736567833156778238938742853646554928967421211382843143794323637887713331817835766734211954395599139321253665269959616136186721944494158899859728954326993168527181179894761861578599538264111379643672332846387145261213877919845819455318866992267587752645649197764429994318112625319846616735788722143995668312158416987513958549566895883675275457244984341981418881787344313296696495343494784684991312499398851732912458651161119989892935322112112921565999441514234431856917683858355269289297639548163786819222327667936845987649736975995668219262216186453749142897778784877583737772889225122796286318262454468722728126486333737349768743811645879847686797717314286667133642268661855877882698437324247732996542149258532713221673185777381417542448867848515945622647364142147165446567968961661868145392735843949397751183255688276885541447325328263727766969919911957324837459315122584754862777383285531781758115348618268218668115479873623416568484766347843731581766848945441764691288174635487459146977274557266845475347291457553161727783392382399134339352758248419765621123889457514364545341683928918828364662464747918267713228646386123953879824168815163815381992515951666658225662898237197399126841931779714778551557229267444622443137669742457436482922864962384499114446915832962428393926245244234783385797358411164238423445714886599712184464235528693964396292678659724633291845826744969845791338975474327787969686446697557471169497757779522454745558699432169728495769618183437576351764932277567136127922567983169442847655597356629966718589679327279277995256966115993233656411163974555533762745372855254765674457169344254448567212452266628938169718943272716925364328626932634636538341441768392384649721843175494516886582312994532421457433864273385611439651867497779397283463325599985835746216175375138264182583249164499181355521736715881357636924434686788536589798238719841828453871972414938256184154229112365193327317441842623227288518683394413725427189217192987483547946374388494824871515395838758523343761626164186129444778493166668981799427986757351883524672539388337385849612679844212733831467966215219337581911937936248311223868135181954982753987812591582546568327117855747554633421375588436217643415122914739263763467538562554637676192834538651255439766763934592629332335118345278287157715669215152233971687175986143214448642748548827876858693365313267532644697961245444855185836973734227369199792317345813421461198532618487184386758546568567234928652419878775985975869979567271771115642116819323933883243222398313217827363566333642731394291782868583365452944276468567493141374133662747617845653286172539958456479119221528534964348377266149259139441587485896292391168537777919158523532688788362453664524172359435829123723442686875835423936934827888883966291492445487617612331134262424642653424158665249565714819475225952767871662238534164259226399851915185645459535725658884791997295448239834344289558486762888657244799844264172114819595652138655666449455131888257254982754658954335132743671339219369362627826546472528318587766398334272715373751962571481916581666888343864381163335754899229893343476825872136348798164518735956292137236854397858213411646399784329777154766991499674724934998131348849135384749977579717194929996577673662733561553976793792269135146372736637724245889586152913764621538731928849648184178415665416496824716433334233645797821934462635262961365571582126991994516451293994392799199664889876268621845218399214618314398144997224617131287893844571242126791999542576416171795875663597614294769179281368652936885789869518341483629529296624597869191136296783123495795719242411314395476489598272218269126916647231287273776391466429473613125792851352573773117834152124339758319337133176751141278454948256357374566145376138577811348854492421537984691162864183137286532658673541227532572858689222324318913328761469969752265854688731434898433366137147268556939151956698747822526248547333448966862727571121319711665483695346879433671539183732434249357652447163112493779391776375871321766533647156543993847826344568763698749127874459569413686676476866464353437463746559331985498992335363473363374136156826247835513863678741949279733989963523976115226711127137156488664491358238774975658278357545286869224287979457711439215176876112966155694472978153651199828373996782166231486793326798182198413619334463711214269254281615761714857961565558971547627826568598721112183231419869985167779161424336775326797516239293963728854839986938634473648694173697854397851157651999925982111173268943653724226454647645789227698484865112712184829534733145285699159821628597322177374131771821211684311174124393428362635812969545642365886816613694537673243787153577213798799622479949865834475389458129711998591111791675546966196528891249854269388615834146963128685254334352594653231247896765258945287448216261376656772393831915743958486323739243214598139922192474418221311239673163955244525256951199734787115538838639888482725381595348886811337841932115427934782223538985562256759419293447432546559511762298695928221828434811163732558459752844996925168291341659447238284553781293323925721651597843982653749718374112876556979112867471135295822947472531464481248846445597123928226574432758898628588681757162219651671582163355884974474564311743371346693482183531359592111761493119323264739121592573893312737294239741248241498737256826822538994546573821746888645135771569322621383841453616429485641841391865162122194437367757852154245552392856737789941351341685718898386916833134321159927214421696136839286426221777299454189211687466932348387471676138343591697193967175397234622513519482267268771223978679474917612811354851348827241145222537973948938271558721387155871197731685265395749478694653198214971993556363342183234327963426856655125642619493628479996459975353224611818574416177832212326751451146121783262941837726553358123589777283492912178666992658658997992744676142172289994178838324751484645219956168457834956554657721454741657413451754246598638532912249438615836636828987967272253136647772861546878383897685764822773568586452177617843587522512377267865817463143655724846577318583866216958326415562851642143238369622743579662452994274842983295858517413126796165462785364422795939837557936976167318815679847526471714637277154963445488544696166779514858313776995643562287777843436988452742126898643339397689336615951964629236285134843989537412544174494816252781882967289268344511949968199695267279676374184881979367536419443834868177539813785776565143649124422512934261737578694344596387452675676577566531564326592557352941231155271167693327169822229516472828438912647166332447368779575467112698234679628571399138291716116535169623256716291597273221926911573421545559394972589316378255721939559329822977366943181942517311648697745536981821814611847731326736568998198557487563728937844442335881293365528264577963938853426499253146564694935144247165913728956118413861821951595221133198789412275342914575221858489142869423141727435772887363722672755962463317159432661611626788767459146913712273228682978535933849976317372719527531315389245838918222252556471662468254317689256157363398159846224464737323242669978973975249694621458971782195488153132352998248599263112687929584854262792547896213165459123528573757267959573185118156375479867837698831263296411159581292916644398618182173374325549478439819813599523758954539744693295954985957727179941418163373763488425777116776437743226468978932316949342236692292253926398782771244724697563269741347668861679284744225183432284862397194868562722467873362345973521666598424352727646285393134114269774946598539624137945286924599685567282457844152266725615317899135227388775772197994312487276166755257961588415857132658641264735619431426633393172873947175388291371191184618334385192737529224322251393547528412114243872565625428678531248812837995541862481428296475412179599921761171636252556296658951922868949668841433658265499288373917931557451972139623796579992213887681991736877631849346767211655953964331397292337592578312323654973878397885483488476263252697898319199492969873456641575869635691314898767499245875291619158119369557389629447567211375435162591925142542749371118188616247897987999167841486715318723136236789422789623929249993683498744279587866318737624837188292617313963948774539521164417258364163649229526283174375652252363536519654769281755674274926391338852225712714489428741625979264971678557422869419559775225225832799518755543625538387866894128249955237432876415473976883295742233418788875116926323946172915475659184527122375867399366668487428367494128991317444533746597746224873929566615157685789987354884257513813457218919638632924754211969821294462421892326475316289872736613941416638845616483111891548495426276211488878196743263345343778268973381975241566873565957995495989252314481464214527667513378313522482663313926735312352921643112563537942378536237356336856248464683844276654518195435863528892326217662979989348548572217142343781236739284197791265743174366893991383775258584498462721322418533718223661615684514657946761719561718572372181479821524239121371735611231115529223736765627322756977955657355635539139377214782775916346419691273259932191465846259998615468575472435545799754525111447856641515756211374852575178127551542341941367163945243875929312943459681858111918819168576598688286289981448845885746513556671632347787238934148637148425498819197921139624773842376837872684239664972278116798791762871368531284884935829384731655819726849184564749627827634536121461943615394113667941972227617437682469127267662112326882995826147295357697247856911514446878717698212913948112234211816474839847736752185576184362952651916381276974594777417412328256968664839398565921548246394352193988552393645198612964151685677164416193999818557295568923729129412877261348888324348659452222351758171541484443199163115563155968678926473788255827945363946885279393862542537574772992724922247659754433133492171785115873613311443741444122164288921941156578965828138886182126672419821845531726616738264544528421737474648196753784862255162794574192119974789429939284553769357742915953345183213296662934977648814168953736998289471262412855285853884963423115565181419861611197425585118793584455717143758841162344126755911315391918467865625433219385223218688559717175553657327912245884798954332727789851423524592271741198657963779643679337922585937372231758634724371562397879163729162986842492667993338315236711889188752785723321949969554563617434253452761221858989881539751757472312137696279615331388962972364743976243159957632369521371576325495887483822278619514883447162842753753384623461963435822389383479446343396339254167865354164683761874591293523325491982483923117695191888267521819558113689239241463844311321344551857684154371813812839714132946999621241442379174847421856956237554634551371136126236645589734169211127879748193568965546672849417193765828182295367791866825559338785798222485764426924421351944282525749814574478439456322151638537177534986534967757714938234925651576166389228164724442718785998487422744483856217396179381415718741895636929715827367246673775116948599111675314554531247495257899391333184157665948463289493124314929946342383647336773766221554512137656755578952911544239626624182743938353724561462643348445318411641872483196476477112828225175943181527888629935622274287465767136616299553933786831166572374856764259885664767315794628336195678484622581115539157186374292794529323784591617767984685618146235648645327886292799163613524423544244375466471447418113797143192716237421769661794924424294227439699552637635657828365745723714174556977779831924771584534339928615794623611124381559491381921236226739488795999258753268432414367324736168198995335197113736696362373987327185178244512328377712296615962525759326932972618973581898579392969937565856849496888895769798854947722727426988678494176522179923769784383928236358186347199436787352457772972638319632513132381897737995721653475715772752773751245656665277667433514528995489265394723823592525496865183724198945865672398813291791673289613712581988167762722199456352253549148394459699251649319243318342492862247542651387467348621252337198121641221636485143282874936411831698746681596226514112138746422163784391137561864562636855862612111828972162256525199822774284465193721718766331867873764779957159782225965498172875572165255836258244982328379914387868563813165279812379868848665733218815325123147427785675663765767343588471844885944879833381218751553232948398223115435528865217711936652687979375721466287713941598835652519611917499614729683728221617938197157324734347654572271184338563418917573867869856873839426356938361418257386284125361169592657184321122148487269447395169978264446134637723133993411638885656895797886358332981135468914924848837168772245696664987991285528449486878577859299792282587346818689172332998498697657651569813395914341263915348381988598511668627385396567528252863288473322727446779734434633969533482281375291452784912136332866356196218361855565823697974328174362575982617379824666819913428556615361626236426756569614526418891495699373283241813481946294567776465915818887471787527599266229433466572177122572318576327275683824343791526534587822727597367568867119539342173539847613166457763385267774671932197738866469395485147981743578919256794164883624623365931354655675127668535733826863883642937787714138497486644585875261945811798887744798889187436358757927151583141467486976939676729522975584363612194334462251423574447419577153589147799767355829952656523962563697578138115971699251573783545267665737661232744324535964614325677323653938419839242283945486861879998914472364681349654587888216116147546879657271994852535712141176668221384576934337544955642871469873179368223568421352537731278426865453365692158278159511618156389964238423398198569453898865913474688585151898612385833939187889362834356139886934399144185436618672485719219874625818611294833635646134221561423691549937687987681599899887335437498375894579734982292122571397721279954775443122275869749618989982226796456865835131736589619661964721776462531445144915439675368427493988418538853871951721932919834216922146639262128142218866641429726789989375134383252828231254595342889343679812319457841326814927329812714992921241592374522812683897751652134316477141457411799941968641225744713718215215361448546516994286265594773967428577322965925596897997965161471379654442733563368679414478962388899345373484887952684366469585115837927176754296391357978111448749877287546349754497627931649799925941371418974494415424858729851111362928255943541452494868592466964112361619458934363931862258437323518729424631841819159513269672965776873486381212828919893686442651427694997822276666782495393279336776365748829478637638849767864852487966969146349464538578523675845556585934214628322355889168562553914232167357695562287522122731225138564835113243555891817534195523423199645439857283622776564883765524969982936259657267586871441178448748911649314136484761972624454588835189641349326715293579853741989485489882985558694324496335696634412151272268546828121846244873932986432674935241754982638143259594175496562827537342761382511921931851251661588166584971996546227233928151138288959738374395117224848327162167672578659592655584289263888716632546656793493487471346249455893318458444984777582429967563229238913764583822637864153981948326441856476411384692538342652275736679292533484394648568885352191922756922926614166816518917317622882544977787849733414413127158927375359616769936384376448399444868916252943422674283823321965999468155169565766991126983297213852195817442998631127854256937354324161546198369125622745658342736281593683936927894558463598597958637862458374344512417984967254842232456421577753269154663728853852785152641725598197361475314671675655117573178835362793329197669576757395465385183124962444942784681293196511857898133556412294827337756731225587556291566771591588851326613421175783753442261419556745497185928474283218635141189665578644538359499583119157466996131881242172572747153943924919673139656574954796957382823416975716475415561349618187483353994893118289421982435985291188566577156319365914756766212169386337734754378982213796158357393617111656414373765453324451478491938587889227141861495915472434674759952442782366925337123827762853549714226361551744719331488743489869667796348334214279937647488498537386423412184281127561776888574279496793188937615218411438862515979468563614535393529763396415277614251682342389835972239752914695169541228722392214943967691689539222617919332973778343588855946337397591438337561142544934649197197161943324733377911697834112895181929834252911235823817477758426451512425959351483148533227974225544961712338995314946544658571532771136291844777933261173576518951275683873154828821354645635617717763893458714769564211964846335393251224788254824769795512942937316824959848747478766364455311129855223183328665274913791114424528569134149679924784553889923889436746611659421646433634475535565969933463375363972977923313693236241735545295358326428699569466377399445159785285376358962738233752624387112958351261354628659429561479843453418568159421858811441977284572516667886851649711761262546969993785178686644462241239936141927737456225694392614117488521169988795477866773437471653434779212788694892193222937118523726749631482498171342383253324632759511138877961558543997211541229517884241127924884417663412427527288467633464981127932986181551224936796475174766926187955233894439237364655455681937415593918511682218234719687229378535396921149635485256691648892221435672277546772156883324637927319131494958137254923166112578669628936737658482379216736438791781965894783194845121926554378589293936151311334117582555677518612985865645415968844741448795423548133528588817174862756581577665923261768358147296862254726914142986252981113252994412667432299753313524791463621132629858848772266346339897556899424378137356878694144851394223949533111326191938214112221933536783282515393839356157966684286377372312447491548436171558682686773553216179738332843631175389766194677469193882393967453135556463395596631845921261237315824781126185919969254572149651766119856759948118115975356288647547353125976898339322937893457238949648128212215749252244724123647386114279392128354768581194644312172748846867164493518774296128721279198894198845576312712546583987988818622822321964373743315534284971174742983528648853776688676168292231235261951826827243931687865462831339551127837853775774495319674975799876944433873239141556244142272642745639361975253742932914111597989292824779471558147214418443437286922581734654984857745417676857744622724246994863358478944928232457118493175117331167541841896236942899171435431438369435374158912674587943842516838624374589393859679219654967797932417785462348791544214664192966829117729121126269219473968594217236757895552544688559379696761773312998587892669753194281648917446739462521671121681834213844115549989385915847677492843315341883638297919436785634152488592796135615452985641579918677926169616521475488274463189817749378662292881918375155612371986678322333594935189955816446314429248985519684187277693698332788632321587883739871139284471578689116224653864195729171579342894363625118365917379511799613166287674788439921472923152476172731783988297465815248442798212195192296875534482597923747727167884524179819328891166595771768417624575142754932563465954547516556384634826989686975414143691172743779664798145558226333726242835991665461446364991727124575773673675851335754217973294398215442614736168493434897293658859446695764237832593843381233996347738616232613994555684595973962716916167915481262899329129385598297825551455687156924875396444188817653783593221466768598422823822972923544945146597441688222922198322623774535945895428777556912328895941385335176354719945825781275556566384724659126542242793271342194587375786729439785685937998867223428512116636746481963663582179443816468631158575772349679442731837426327985648723689759161683416668485564916276869928887164617653799129436313573939984283649979759761173529455926911961684638681631715434411834723969328115122394546375953762562547576892441815977693778278445933187664273774938998968262724327473815631179622396177772114326121265245563573161878872373475751629717646615875599365967978212421473691582856261641919727875652149945592214287186974599262591667786863897616347116191473766685673612975929195933663122436264851753865498384279344676642134765151458264924578931625942761226196976411846497729567525745828569741494641225483657751515445967191913857991222721998734858545166788762138652267268114186681226395552912398545255254672171214854724141291844398417236891463112854355874464366233659294629863438663926168778178865416346368726576179221348656995781631489824414633499675826729754932723558294599271895649436246362816691441826732889748178421856489427994845321934543666865453594466821719924593912326488125512811674696695473635467468726978495893525235739873263876417987345257956613955951754233263791814954529839292698639432666226486536444117745319733769953244213581868962694327313114319254298988419615762487751299934139533826935923851296982798962342377124127159774756515761411679828411671661176936375397769224833974825534922546146292146631384885245537922723963563178492831348561449675657955969762649177547617182294536975829135192888331633314772845997239183327627264372549478112889169652141281281139229752247528131517993635819284756362787216216661576796525485887138853216395626983618658855445811755212884739464696584781945747827741781787136423713629726244328751666784525421823639676999559277521461594987942319713566277862518444596773719659157658833317574179445323894533189638782918274114562458221669642985426892193537917417179914851682125295498672579665458538361845693241156168135946246146313328683648834854215434746815865129658137571922938212985745619941449625986575337736364643596481125783878615922125635671915172111178332532934328687912144465322673319931474515832472513758366522828327262121294727452166715356961817886154139266391439913422639682424222381171272492626718698599472156981985397881112776952552455457723353444667252226717837344994698245765214231731867223795248849837998199495512655328988973968748816933557413485617958917168391186894766155194146727589693969814547232271722382514313377536276615347633356165433348439445794125478525457472496858772538652531749458469579812522433775516172677298965886649571283444794746848114749298935616117888158728638531448682588578364468677733679189766754875481881616793585794491892873885578212861219234456316287893236263753929252181483383834952932327366532463757465815327439577261493361344536778785929638465367324699511828849197123691379153334323227546842623116467436763342162367619553494622487139439298981992945655566972158533631925869293862565294399937329226145126653832898664831891656698913659922882174916384632595267744552292521434394981344258828449856823164241396647538422327294697687632184833311536683236451697985885791584612475649331472918217676913627436335741731819757576472414253815361579422354855481246786422572119346363781448674989933958432875744432253836489748145622922411852154835144528545276112152412713465318232532199822453481174462321374382245224628247942572896949243641583719778814888558119556989799475778388629533713595565667724927898193183926819488777572225317863274349394473615767679447134128865368687468417278141219272142124887473947774675717547387775948264643493215713142993848442721729959233457977152785311569597187333692734247947939682197926569421979344881646993377731337839868842636158513162785927635274266262455411369881234926327945617694117237758222656248862669575687167369539598547131275998221985648767332877916442224847262317192348981796376641323743627964988683592967248651831477851293577367557436792264248921239768685452615889661766862286245719191943928268739388925667242387671521639184958264459442493911547115522393168743446275433997576189874799814624579693674845226118116631984393389384613313615375874589888298532452418316154428773182162116449568281752993424116727148336635283992221914889376919428455627648919617424175131831371474988513949893727389213645618515159515826618757795922359368477742223972497571932317145123652945464736278935349183411655991963249361668318938512251388487352611255877344977363834425945851136137312834624262947813138872451669615994486645522324856739288426844185145556942818278879893918786261684374556854393224492281337269816131123586122188386855434375491951781863253728185924474414952366733136221322737884839419474834941579682564655984972279493378481189955749424581388468812549796585889167724571138642274312234897562564593994381767229421148558536657828321757121895528374985769464588343618544235278671964396215759984875737818111632116756247879124773197588529912932721739938569963812366855259588499691491837577419821429733387571341834442824715976443768966155518341518277483264748985247428768397748278265387589934465662431676469717521728568781694954819251532342798263741988331585444322492459968722364178927973875361624644241497477733285677345523527948585676292753468755422453775761793646545741874993542181942113715737381116973677872523548178593193947538252443412393138532477162236426431152965271122321626883153359372125644293714432752854157779432597897249787199116227875184346877529559311993478691967623323788397199683926727627228191615881552437694848536674973713964962562381835754893243361772131243421882592561113359456762374647699416999386938491225424568584925279274136214333271172893547128943775169259112974592715913779596343687469327898225182653555318371192438649698461589923622367551361846831179588149694461757217549233243785397426737232798198333586732675664354446956421944598989562763585867366789936242417524172996821782981593116237275932658311815375782999891394897939145734632657311752246628368863942113287595398945883457213859514369828965568967129461632458573615212275443261558897381974433577364342822371216936176163367243967624797544744894641442918484456637233161164246151735441136249834679573135552665579115661156816558597391239365475948833316677727638782439512232856227767899952281825719374663285224289615178388423316662131476475113753557748964357759919263937214266168488119999992256666187967385233313533356148247317385349178637128559564272973386463339313473266172226141753896655919423233669258617542516197924652944131529946471485154812133672178873678312733661667916195386985877619691265735211374777696379276456724652742167294843784153916176721699516748349245981215797753499271441498267885627856783593353118144689449356292384543659943754637161732378188365946873457233796673325344413771415736692594768151958458787288413379686654597598832755951756456776391825226278795587154646985479125971611725626857714487367875735637719516195546719546871238897679179413294833864225473725974974315681526329595856311224942979489992953321992527441458333872357658198879852255297398263344912413164476395714557319863114279121431322378645661616647771158628283182291898665892523613416238768653475526376348721514655522784442952672984253216747132312193295893557211436381963514541351153627964459559982594979675698485477959718757586578835896897511536771237939623144457631287782265843436167119122763723552417855324931576422238771651787224357832677474229594681165671624928626687218872918791724631478742749691713538916144782814716145185434124825554689846539966115868818551295289946883568988431497733979444343457366767269887738936529462122874177317455283352366876434865977957524931287447265218956542368675327522285828856921429173439947657399725181511571189384167414889339932716549227337533921879638757448741149464525144464846522859987753784833327889367411931558187368525133243322681244399576855767517963457633719537872514397484335113376268337296862161738288298518687529436976181552315969873828926749112441478297375961394453458426381394319328129987467719854591854221112975759741785613229369445156258391745773234267855458672464298339288562829213134596557792533584956729945319691926332886387965664375896748578361951722674926734474378314421876954162295641493566437689147714382933135539728456144196942671716676253296446358699273643471882455572416353988257335219629969934461825537726773363719478523477984559875981748552634686715457496531313974895416946537256274177268549485977624357965118893512324616586449583426643417399914447596848683543622251666637924565729553458179866572389727735674651718647621681215872757579762414635377248558427481456653714712972841965949576513519594436915171428987275339631372878778318742799554722765582961748147369768912666691963611424856964395727764997333443743952784127434869144182887564253487255149585923734133295894174393712599552253922856672499416932266818366963995275121789268469423815319162398222186519745554985295264491762126342763452339166297864635877762845444244134286992682779832646173573435534319665746715191588614297189134677449859719486756734526698325894997978169423123458846397286844235945787723779784271543311247115575927746788337425983811341911419865417671468476529312837892868218815396495167686487567923323839472414489683711134765247618912874683622495667496494535766178651182751177158698546588281485983688789213873427776979391633579836388821169448423948312751693884646195698322887481951579855965153595387873869739853911412754929283125122931264472358923795283835742684373538531833894716383145222167293267442554752533676525314451115133162127578846952493457378353741348223668736574161121855417484159783527379476547374558491939641978847692893247449268944942944719955819472811949156493618656965764884995891371356265738318185851294643491328636498847753381161694163719646119338779133868455485653353815126735632425638651755714362291264391264228918712918294811417185251213756478144769431339116544696566613826192187322259123724644197456669747399492311771696518968728996649217725127742876295782467413176246136665542374313353942544333514339774231876183953813242522824436149289915577436224338743529751392968919279469564678145333547235425314364529167464598159291513181281899346321485587316639365662761659133876183558332628778632413583483312526576448685773317695192318673533428499779496175659768379738451138419943564677146988196175949691377424246849453342629865541828613296674769779374668211551358961857653663421676588237761939412236794921654257114251436432814233439246219665376558162338557421532941836311324231536771453322645144274369565736263222952837332155769676272736972816265744794793152444512446154934146544866243383674299185448779916629848748455128751217999574555993929338378747321551655463311762393323632617571324697482111591562758139248965596173425263171115594564539384321493587125385629583716682559341229941492577634643338297928966497596244652215771784655955416238916346935235952854988314977679662764192634257881727925484669383936228196225583519169567652625757896575548578111325443186585546516872245514716335483795166143253965931134891199355755649774212163322755149285527433992537697141593468983417227698824124447435773579461339866778827988412327338545294699512767738599517566486948421126541466288641124325147886928265764927737591512555931132112758866859679599615912192832323313463463116597598222693666686253237972885454146659172494274823981271166179524628848531494915493257379366659876182821353318258835953631573224576832719728266876679267792297994252788822244589333628134331728572427932417427953742772544957167433243884118941625783185373387173996137749493592676522726639443413287857185122897244166489894628321395998574385553936914583446992586719286696131244192444139925475991779497816916355355434559118441888577978497792932491711613249838368766915534367213932935612159338582687692534491982862385487789953418378947197182353114628393998329827954332995651873839829219427551528125224216491938488397649874414114215119715547867229343923512311298658714229524296432484131664711561521987273294179628694853184367416354515943852914551782975264399995972754217621535723256976197829237369767825259915218838196658957949656351247631496899878856482895595811741915372839759294118754192869578311387685393526183488692114463341153567218872151536145933255938663249617481461217966867686788181672415898292429573747956436825228475424374584836399826378381117677574642935633377877552972259561311873585619923371511265684764913211146779682293772993665944681536653334421884513117367237611119742828877383362837168245619276328858174562714651437587366458752228485847959816674293761686981165182392393285219952534672695896729445419964423313231299317961595238492431392841899928398272655675342186435364244257197596586622614242387577423676978497167968997121617884988492589523795682644677188676449243941287933313613278876296115731982946974781255778356662861858852595479932442394134386492147828437951717958314182854621129876856512186756521859414168194712299937677483279878623461688769481453695274412551395254492393621496864535555365412413392148133367459538633956586451379561619954671677898883349356318963885233419337227893843613578178427917231227584557333326493347783672126981332585664716293175433249177193389413799216958657513343429142696399284587463688342854925359176885981997764526823896121432365677995255848492465758479865529219339132795384369496343131757799672657123399253922331612769775875165938319778652493897218644233374676957291626997717284118727384251483678482439397348171884454592973553696327598687938926281186612189228661687533215817974486843577236549411485184298387644459161577148485329919669885452733491166917966565323879615555943176438483598831216695758928381959513239725146287771481351165964576256665278461748115433469419158561665997459268643145446441351417524339582597819711765193337158918849382783826323297664287844433884798495232429259191464741113483474633182993293748543999682456399248479972529156761721123954941169247136772534363945588679562559787744154241578577499264853935634426829771135249836945288615868928995279266338589319662332957859222258785231937766295914335916147243149116423936173723852414645824439831618855416298198846216294658823417624153455521284569529636746658142566173666413912327285329953823618253385985755799537291349491719719371949388667754321518874788968231759382483562983965949295947225367467373129756865736491625793915426414815913385925671151813836159999712311181874532155519195943283153466962397863712425847973145916798874857174155357935126489146226975456842578426912733946135754523899555842375868184752842152873175671198227386991519647356277727628394441672545354123549834646969331145837263943914311184834243577235721928126552244635676413589466728776521533493812555162353526992638263944917914516823634219715696756192896756482912895786373759435186271225491371549187639462617661168531983828453246399962948245487578573418913656866967183489551644524152827525247981728485862471343348981929577444283519636212635895482498392518357142293363573719219969834547131675328884784427621888954252366199483199145473726314124232672586188311157225144662683543252339959694134688972724456931876847866786964559741931751517382342464248432617485373142884638118384658191642311982679426396913892773113336315521916816553593725722619469118743837783475786779578961662165814916455867516924599857423429452954363568233328621716629643434527684766187363553228795524771244753726389756276423231935944834958794243436299396173328783199178992458778333351229327824868138151799358331571412352192429444635358863499637245417433362263915229137226389564587289624425512676876131249379244354483165211344772626263192792542714462369491792582943592679229836499653448125155165823292317599462732575461753413659277861148454516656447454313432889999479435986952245744656572675662437858268537373743737885615842876194541519728752136841727224818281696611254733279268556565965874261744339369877624752964131224751478419831965268977119888398783854531131962228666958217561743463849672222595332862699534484978334376577285928229911237374744344914314274696241476215877778928975177835572346311141988265246969741792662924919611889416276854722718858895729675695426948869724336666833971142428648587922278627978829547758191745987339763273196269392158572469372965857724496817178338447646985739858939167642534262445939819928337458814416965611341764415615157221527933257729395485987325251292742287659596543211776759989988471313716366131956699517416183811619184592619197655365527552983779262783662592179622546795736156859161411581223691522774352375764657678722783458418348328374313266849768166691438263498537255575575766899286654215393839237134429842161943652589384927266474468482335574683423632411214126618764645268798331843848576428815539126219397446464161635157523949876541355488711415434581875179168338494318462869872655557645954419451297317735234382231517569288349444313714298697459952852479187435441568891634961357364712186351446938417162734457619465833194961179461435163136493487892518934387675223395559117879168584613368431731852191769796965724889215127451253788172152446444643469771417972674963823622772133589777771392596582468154371952523647676116685166894948186266625635494588566861939489182262951667621217246949234651282172373461436328212258885231451231164131293758612588919558142313689892726451591743363224444823437886427887293918692265766745441438816379217985585527141548778634137758624583237268172423161474445858581575416895938991383895395443737519869359622561683938794333639761511988123889749574448774131318618586239731774284152755585583995742439898485322644155228791222257976667517363285576445251496823372166945814417727553599258459519513822258897673668553568316851485494383573211513574429299768852966623322793987684256653982874189674614446422825356797522626569342988292772394441369843194598792498637551699245438883936346684296427889689283971291891861796134858417975174423146175131836644336864782234964699228292288496441926531294152355348183215176455758315226849217537846593596214511491255876421612398653776422258584383951462671834727623273124729772556414726925799765223335767657469495361719551893922897617817354199157867534852875547254495969393853346131312499191348877137817776663275111357532623491551196991249194866121276268665442384765553983483592391266962495346395221657973321484993676456181933676538664791566197234196666743131716355982834416887471113386188297546652382188928659664755997558624242426587723971332978871425412734436849252145799546321296713355966938778181497673393475165694744356654514237298416889641459588691595179731978734462499423619175849615215773956279143419984899878614113434973157338896142473667214238344329222781416424387625949384267815951334642811853929744463687144431374558135314619925852232383314975445748355471969978134198942571368542652221779184911835289595813238578564317121533644229926392699485278725226473549728595887667992969167993128321677193139269337497117747448655122849158966198611221684631215251811746856967747658559312327433888511352417718575441444349168188175482223267821568672479161197816599124167373375752565984993276992424472678667454639679673875562322282897543341143361651331848687573724571512998213134812796465795662196358567573329482231128745796992783168778761949514988424676681248662351157949114442639733671127853756161381591269825118465442531784298631762495721376989359455473821774929854963712227428443287728446245143716937631668871191282926891897989382229452754255972417797917622416676761184153391557773983773919465557559396957911975361168856892639573817519132134668245745447951377114886481275369635614394569797959524917324264229472124336611261761497735151841856423232635846221598869539425888969679617168663915192383561739842134992872895462262798279564913153755888247599179821346499426575141993982445695992653321574325368132326164443287838727688161853182485532875653551844526722539795638555828516455857869518685682251952899344786978567854284135854272169818599532993433789933836191651187511326498376643294663468426845228634473638172987211522442634383243228712412141217145789571124428447622144819536187256628145927399397649971247523997334911252822725781973583776471722468262215135291851159712466645769717948678614748723731542172597544459911963782378996463882771163889763785651772584591586844956618224932934294215374846351958648269862439496948123986919659163368845765482479684226263776961733763934991791843799981276771612219352311617321571258375447294875993821913856227954177384175939416991723947132837419994825966758361486192445254579349248194171352234259393838784942649836865897225686499247934737472791576447837242989497826525856654248759548761951882471626219179633591182851323164547889982619575995159645554598844731568282554473829288776282888577759647499298381163433569857119597739275117854392836314943233892866783558564511389994531325838826378142374581468971945922799338133632851146129894517871647942943221943741623116117423736784863741727396754799766349148812974592379125738899798664411692661268218643755243431883592353359517695694371345124667569324395272898836863732393546396434991752464946547126762142718459956722954659835433949347686737631531846635141838314877292498334331264197965652186227429386263938578735848887112374355431218528133711992434227596866615769226997796893688786967424246454184929253258428918936573677513591489272545412453647653339789524867388754972919118653395268399571897489263187754538841753733548736194993442854525577734989113642656644418425497215484384298799626476154864342129296127244659964285675851437339533727124416586486681942186759736725654774347439598115287467972833975731895461252938647574444793984659415632499954454938255955737768119544335693961594634612733613555188664781512765543928129727622749676837976713797484425826775812814684945337648741355429641811259236554917727863996584119896613225173635386665693941991997959631168829626833156481693947214121198718637912839152637873698451275642898556847219591936783157448547268476975833785347938175347687853687773578518135479283135726467723435539369144819541436771324815528723394197832968184132381762183968752233496478732988377994492195385946754965422564466839271187841297924476636787431687965619442795112413724226561673621766375115159662957572118966589196874597797429257678827631752646648433661827122635588849933444159271945415116484157687896725394658954722752391766463326937719996733952336486635322653157743592237339673751532112969896497143591268921657652778778263258986887945255466311794949738196275984617837343746246523443917182531463224665145882217368813641144952252111815243131476624494596979238789735261527438126887945536347547934628599694447878675683723395291494414124648821392382676726395994988579246789965765765622594942889316341173345417365954738411849943258949399983113997769428371962183967584431378235297915144643992972962718446431731147893496953572575387649774477142195453951732969162119963357112764182491469168724281211562469812285176238779912982627816179349224396835889489992428185398964289975339764833798959284822844376876155768742245577363763986749847628219225877984513628633578171563144248833566191168149457767626376696775195498419345638697212179527623659121648426926315629893456179578121271264582476851666163447756289979596823276527468396535968862439624155867573519282192526359536213576311182488186211791836275146154756225493276765184227237873353873496258693881672452137858811559111523173222383381227764155468151496465518189994749157558849723852613132656187524681999641292875934769995539536964317849895274764127976478613134989365312825179926397371691261191145416238324524756112615439713689342533926477196149165751887671836221658365733387784522155133239659897935549735445662814487572877516254246264395438297817943897319668227387653532264177476942836736329284453687687648483977129138382319788796112358265811324346493528292395413833915867734727223921568186284856276356145113174163925148291793161425239628728551545189571585978511138374917329535846368541457931343659682213449144784574131355824339183215853969184269891251777839824255539364558979315672723162658598815551782291353478213594557566563324889649525618893879668583115678972714882111119146476847479576888933769567944714421199332697796876985912493819495615646267961876198231964992559934899765912227511414492882158814866898149267595186359262817121665377828482877665953697711162987435264169778674125751547989149811783996937444746257754541213932697819453984535516699869696747867644842289363585193667449326764449714195976774163994679489735481882886591964844976397131239923938732757122642932984144485262612847214616448552929952114124733557121876324385664425184443292519317871243952626341736942698892385578331654765195634498828584946846542171134725425121817745358544977681139822199957394149949474727137281278418118514344782762965938378365949934531784562493196489892428653974427774139886838225147556559819888638743666345363179939137315525874266823855233716964429376797871928558118381181463815233363381513732611771257868323729825691396184265844181446575425245366731826325617776574531686786263665577688232753477173427125293895817325721717297747914872852792696888879362578254913253997711163422384784889377833843976453941526449192438949787546437557846776154485391393513182991773182978821954479557415196798568229235285659744954649233712567519185854852134876329951681848794538238294625537759511599229452326669554718421785114846138292321543173363678198647651462553877521739377837935175493557455691515185843635236378753335462657427443626681386187932865631437948439322236223222337716693922396259835958324427388979917392852479587896749673768751547777956484783274341633454272965289754939331585829538898847757527277988781288297887751267141784849733562566834855235545993152895296446649632317786199286867972963616262634121488382778666726678568784582225224145184116558953582853837392553816628498734693138432748951338722286592141417836616842891952667757757937111896887744956886824654758841672544465833389948712267894669618755224664765841624156916525185324877336416391444526528238359891733264286446766155614263742434318773558681317478738752769637831311854856485288767987252225717782571722715236523743335874286399481738571767557174391413761512231179677149611731522565728154628236318475443116428343933184814323161458752547419229443581657755323159352378481283286116266842487188429842576121331999879498916516533981545693816456944967967976858692523874652966641597715732848629649385129669225689553819825917356833568159553756734155749894547395398131634478124211243953429846684198898471517478814689886833836163445167859542155721497745911621954554112338589676852811888496459797852181569359443233919439471893975415298274174568479191371418374274313168996991121782558469124556381538437498499629217294556327784351165172773854954331281656143296623664872745424838544721629289243335666712816532567225121423688554169414219748321899663317736634189115935985279152528128355473717485694286924433356866434747841724844854828459434764699888913816741698972195166236588886984739389288797183658644161552951332658886394859232414269786262424863837264627886897117969725135625723639911484923914858847696676366475659782655874327496359879138576648974789239634977988716127381647322545339567819771731875149726392384464595974686213359351278139472615289613411586592713582756988715631747991378125225193599822587153681917174676946727188487285514347872586953992437158921584345579918578291617757862336881144514238974386473333929444996984841948177756155972667625314158479547886733821145283785381398712245741284582276961944424233832989842345277719349479184958515924955247941737962416274711217593996677623599256757628642756454696956235774167111951635431432979175252732477222566311346683562715729839597936877565484418416611742455273449817539276446274877687677756917312765384175326646528923186421491466362113739545744338544679118276365396231661636615449539581551217549888133256212486394846984867432978217172663713239741655529192262978288463431294457987882651969881822329567147242335174576184458722381483371686786891683313452652465716887983366929647136411382873316732263822977866492157338197249834526518187814867795559828181479262714558698152579955284447277979932761171489256519569286398463353311673382737762647819239857941749324159871994567657979589823784916151438781192272549988312337835272427665365484876582758486991238942348872414152857565693289912852626714825482385464619855253231964394928559833146211762237179392199812831564186882322625271264979986684936189461732539369527133887674569992513344364217929957283619779428885774829615368141863828318357164669537125891664498278824823489376667617892586895516466831824918561347888785219966441996331143816212533415949995221445317711528413227982676435945572235239227444849228283912383619185656656153428913468184154245788658534423954712989717473531312563264118793119776292698612675334838965621574277375438614278689499566774741376226866653528821261271225939891553914465992882231631984723226871451367571564433386875128126353284568327827259825831157339633812132897741151947389597634245499688447879767386444972149495612124441238355275555883745161983965663356429578485195595394817965452181249377594425184445397679338447123966687322593395885777263532133362438299687721398148723283793357684457454313269744317689871541421292871173254518129332748956168187752816675761877881817796419955283146723781277897475493426315698798772236564296466533288678469163712643231594685362615158731772665331185984633424285927238565139644539173335645158215736822466345656387493351424626867342231756399147554951148388151383646125382963149445992823475698777456571719962239582558768425412975644317874315767689867914966221489682252637781328135515371933661664715131664272916859424424387289344213894685266578611144942297517264717213861771959111925776195568146678669137443215178619811573133386131848718617747239788934826222457284325615648158752673473841882871348482413875572251293361395364455329318941366471717666136324129395262715591148499325732417196637933753625893113649478619911571624199551522987481178464881915214979975592865937896891615261414648158533125757393624354228554869147368251635192611393512691799936638941448388743447657854268349772353251977182472154196953123452766114142959492684262267719346249238966493861944336839659541585287454356837186183331129564767119226442598972593976383123713623948344692541724666985333388466385277743454389166778791669598326284251151266647413496689762377795942936334276817284295415486825382517489359693334363694725139715576871943599139852114297776853984848669495429253972939459376144461743151146559444255612276319792753824236773885458872691526452355384854929777932483676438542114993196373912597286813215561647341477954333347856547321535551498186995874213831869626916351426714779954428533591718416223722669633569194538955781614116533884454943148797159291571945439812179298283416378734596868381267475947932464414399752694495234782594479352261545787947439919595112126522359797456291633738725147863453563358151956143266513126975927573335889559339187324971735814392551858349397882454987873434128661494258997537987484627486712937541785273299868288464977172627289487914857336888529458545788686661775985822618943141639296444394782637447246881863489741118972162291654627658463188982247971252568334264143853586985242564994327618412588264375333859681126353121271775174573436941259154321838432397772935663391725567599485585524552674948968615836529296143672135699913594385953879867141786539382731345548797895118523581954374935663539826485449374564144214566148234316725435581578157398944553154755787263164832189654873263792637788673889349968455767921631692557957478438253165316669997776189932143692455179764627161766677515999416479197873588582153557263279414864337644379838365543528961688412359349294335667384336248618914533475196863831376773433741137545346169989985349232389745583446891778869378994373465532592488886155993991193462912512635368563819792755753336788373728522733529137211564798749414146662391176763788257824238413733697479962711491881925296126113113299365258453362193319381712827264339813134325913615574573915929825279747827371115429785761262947943513131167934383718361511473422799469894879884823144586425811565257628195956569889939541265462947284257373798985979224296586479659614227729368573238198643335996934435266977269635469612622824846669966311923232571759682366559898976751763285531433361963281698374181324236437291655415875814572428855215468254518954811622541752754277313656871218522393189841776836218863849296662879323837964123165826521474858674719554361521962162299246262731129961666469592447434766552788553463453879441956994761957285894679874125897414485165365699459891736772114667389327579213427146967516538451227928746619257689939394475499182649817798571618977865397614123363111464943795772444963976857964631338854351295572377863356872974389458825975977356974456356313839226834219311425644915974872175827445662126754955782998865815313589667162958826241782278732821434528797624249696938187712146241953678213717956224685223386478729393588626731414579173638965743256141348769733647415852415815619927736341765172811182288196673479917492222148957672572587133658721974275843923372383216615126445869111323877969245937988567337639733565332763556365826863974363553953623525434741826696235896282177844569556354118213658422713849111939318276486899616857644423934735132976178924121699753425866859798749726698536322441239357334948983971512867462472753319547566165695924375278124282282576748685111993745573977271393776255277626186619182684772447665931787437965598877784651411284285547168929284983536943876146269263735334712143655252293762217381696774836575399259723687119777262597459283199389689569552456813996953664429147847378595567318628212488941711915759516288521267387738134826695261783594149851151992166394194184978831353288782143854842855645383911923276377991564323645233719811495854133269616835273516967639925386857313745614974213832355743896858943765944444337128828735991167245572652988818546185246253519617319524526599983284722175828932394354892643521635114212331877949434434112456959578936671785631362295157651372639955715884242359913243345182859267538585766741113417643656249753734759542264764157111955766289775762893932481123876392721982844934236539957136659949655215953189447639886677432856458343911545279527693437897678378255368661955653697459217248241374779783557651345151276485375994533537114532521177878355575527276972175911771996165274723243228267778647822698765159683284739618734659413464439734477499674869814328214578437425498589262818346419916992399779433731291928674963115462566628593173951629862652257844493944354936672283869862983429984182445823571552432343374854733981338977239264835818941167472324188894133837752837342758626777622734417166266734537217929918137533966395173547868643774697239263367744814627549898727511677241491859856856465266292657589394135645357566959224863957559787171235157259612326791831191247863532373425971622123765778318368956934211945193564658262665129333586523131599248793121622962942366378554267456519191771887331566754725445529674329546834271674757345849675719359464942483684469478585293624354867227868399891772632839459784896256657853335981989962912872545286179668172483675365163192943392513981325988548476927939711465531614568999265484977416727429792459152975257672631562127255426173528697795117635343496674937463267888493258669637475253144239981393988594219117868917526912398259111768353625415155628839925531644118417735149181233749519871952755357585166517485297339121448331965969674815928166437974539958937625997528621793458691765879353981562163319432558841595227894628227525247153796839238263547665327813119998447172522713247347443451617531855571476466759738163379653345552236315125321335921313691339524694276729424972256744854529818236578978551441497514861451229192613599935424218843543522767333313634335211425964689121898937954179175779543888878779887879294297687448818316252458796936799644761757166275664141927319287437612992276669239182873214395193499856452184278419978793419595363512156355313241347552958661894235371717593498816367623212196773758414988754158436474259336659462514183398831849658289772184475683726353848231651827995922879613595692698752711181727522118899184955767624133288188449872643971599825566296419123329162555418479813285285377787274169123135687994393594315791844363865339229746298235468759448424364957386859688632223619398699495475753354959258893359935818745184824155767251123757161674264473577343979993798499189744864576434977627923787812725393156446667813391236395722967652295651879173717272858957681478442266219136662769112454944839768935272951825467576175823723834786823821838481584749861958915931925364181166864359957153417878828778868295988785589435548391782953898953655832251874919571382389742548141758957961631772284938896713416744127788289796294357397868467742488155444223341519344153292698453798336185439676645436993151426531487346498639665742226834734281774412642866187993487744277937568183414122736666289228589815791179625229765573334837287371313853119121715264734964425272747748845355278333896251317625186178219642517597439544227984836999482874137688798287517685514716241311439183895611162288495891712846738476858369839354664477963398883394858853588753169171811873243986574535927321616326919596883553697863518755679928688657767787645444344358293235172471147992491819949148686515757985176511714522368132215181279734451261997667475853149146693614483718392625349496213438197649751265541867991125466618361592915678523821367274824817122338948582242517939731758871397819463361946627115512842828353495979334527138846716429936924248623858433798926199365483192925948938754929556867567579671725346715488661169212593396651684338354288297574768811994133966711165613567157397325299763287545141558856263254162319941468378189882536129393956737855962183873946927941597144615438235829398644451688528273985963913444417759446259438296843481988272621678383186718117969288912296972986481596587812365832543835277817249198452553111642778625463949212673476496132914362561323656245479127756545863612427643853989264774119487924118857448247974168684775937687313686147346146499854854292152123735857168937384642263291136922525155967863319374745694289496314794333714193569565223273545765693757277149921238327949815189767346328642272232674498463446735557151164826946316246373816799179782756323199629993269761166997994118117718864139529396892945881427656587367148481639597289962112864954516775879297653436498348662598424496421554533268476684175166649621914657579156948291742565439556932626437621667271659395325429525814177631241684426946475967994985352921411911496452911436652231654911238655326688712429893441168782466827877872593972456325994358757292981776998276128896447211887813225183836962348529728889698961183718847557975431746652297424832831269467914225175685636142379633518111644226127754952125945587231995952829846187293951949112894938749137735567978163711584888247968247168566918823934747994876676218382168598943812412158235323551688182378437834742471338311346273715731652933215613339479783341941669445867798321832735942947597218717273823619599625381715124793485816219632965669522368185817926242959537247997785252982611372948743363913657898473443894929183665351552425822445593867727633419198234143118522865613263144161978567256271952868867247245688138254514867342378164888126655239935316982329479314889481841746713444528338693252949413776319117252352676871223448429751282553478856247629495114396291247317494521623888786239641363771433383612113846263588692787865327917247466771843928461647693486544851367115243395252846819918388654398559474789716414211947959589447172548328655241378741299266622818312364329532387272392153444885482632846746868622584523565734623422175498592571753187494384377154882638561416685249295191492858746118931917869861986468282234178231388246788591119127432768763383738555884898516619223659944498728479214656191986281236974739474881193889522414915379573333417874557937695566663353114578899832985343199184888444528824592517328162276686165976672956428525343475484714877197638429432562857759344275984248674263597112623561338965562991849686376916517835297144517767521637436574673744389532251492576649324927878372584882188731626983759433994216339156179853688485755842727236398726791773494597251297522291567677285337637225153428883715394538173835875473833741273329353728293799256139585645117176788762944337131896683397561626867786769835372284789897283338838756924927384997374245496592429216556259659933795392918555395934778268733881147572286384254972674488176643138252748128278931665419512597979373257365529655167316269156963993395625595622724817255469526378396747453476859134891858162817811841598129845218351527455681878954882292637559994943146792347731249916932652677426442586848491537473422876425136896491728473635196854551271159457186249148292455239724221595678527186777945352452213858978797396935386262449966246656252694863391847142723357167452777636953548991375713726435865468237176485296172331425234728746924933973577245968317717777891768694312613141466234675574615371168991191514272115334516646944192537218482133595486977988666477645691828934677128282247558842852534119589977785869793622884937773734189423494197137151262622334296541273772469678272277338577776448427193733621225917223696418925312642443936544234446134621936655236535219671855718811828529855459652822817319268499983476337964256866441538196538967155461194776593866492598848552122638873757674694936883664792298965461393627655257228469984678682786884798541873992445933995823549391557929884186255218218812594815722327724523567542126674127263512981111669316977278328993896893225847825344516133118116351431215634637859687897812266522387771859165742122429316173693855818484771185824411794415646761585249922464179579538283519681144267173632383696376334475562935557982475272742596968141492941686232282512398837362883437871456388476252233527568486923621491144337558865771457123728715759532178558896997528161159789255131652399818565443919219454273775656711793286563573762272874577575514577733951987369926999288827725134711389598765116452198842544958634693515231698218861932881912386474314776474672995786631337246479851681787762894799667514398783642795284813319511541287363929513431997167453495265795645673948478589416254946848584774964565736879793697571794877643918167249868167953649431193442568651726971971516226765496682527312124947929787653287777551363339881619914914942411611691973684138866645661679822261196115626224633878517835775685819433516629115263454597655732643235386854923764194654956542198134322857663835562691275743528686347244171776249279779385227477725995695918186889525954355993357772122611987476834941853263327499628564466646457815574114273988553176177333497672524494364734771717464111698643995647178737834631738691492585482197391964664491672952891423614488515491525177448681697135289613243861225931857832328624418195667283285829995284146373458697765833413892333781523182238927612235576951958832272875273549555224753532474114743626781669614635685123411535121727181149225425961212793121226876599813163684688894438311494772147297648838771976927494486933527772967296571652778275823913188318639917885423112293795335364295615134416914188476713291456454193243112392412627327488419437839625526494233449499385894227243342547669817644297972996541727976375984583618325218712166741263142445326848687986911533685244451279142237556519989822151759852245198894336811999139852199934194542858215949881729531199343851744836382194199134636746871534745492449913648842482972419759934599378668494758289967726457161515658411347655236192416625684165413747585792463777241291558894989471154446147272811254298269677829638387132336171938922747367819111776887485142382691928314212658951673466661263269985524545872486147843581441833787556228666377843139878143965152742621219967395633938746637481576564489766221646584517676498537676115575931245556291945423185444834646999787171592281519632833911523396844291755566458722666876673214654675742948678895961252295753553135146248511533519372851824296339559736596555697518648481591411194687221972812836169251254219832571893347388318311794369428847991993367866796749542352792468928533439372759328694833739741849897365146666757537546627721517849232144363222875148594846366379328211724675859543161168552396715655838281243682683896991926338521752822567681257842175758148722857294481774333672777754156955758718274523174121785222314145334963466999982543213687372487228622274467632499238212265937397881879795767289812958294463497719675534711237995229239816816485766198865213312595888267838658544557686389387993113632674895788464268547388886758765338734752614411692177236439492295899719982274686546472143488546822762337521441768295977369774199864993933253578632234217333457157667283392386451967873599892495783616351599124473593138814245337297821856654637224489277142149713455956776774361132854751391916887437286949211969985678492864877431199776654473295123189437648456189548741395352938831312468478131416594785612435789847455442162789573496749533349325443897461767389168321679811941779552518253598943147198284242393783357374571526655528861534668545725218436677984751961577479494852798251846881141998424437722263282397592331239145594959633279567385741437819643766859259373746448777435329145892168356923275245759379763484428547983156682746547292384882145345787122429192938948673383871273185611523938931566388595989295423986257738882319186986662289683988947357588569412326661873521362595792993159534892228734666155932723961392271882213277579334521612899213916637388365298737941357677298443447442714237474246313486521855969187464181418599864336888829629354535446744747113233396912632247997613241769796486477611222292421474436461468915179985281122533674352885265455965983482122833276843261647814244926449532546426373272524379677369393273112651998168346376499973821886787953249699727397465214977625649331245852665348161198935176284633249211854318497924221897481977969899534827255469381512979183928619575239879874688724275436494671316617218697911363384345121264331471555961837534364668529587574626168513212995316198893827337945553264718887847916379372774179651829544668915916717613443252556873275218752371718456266546935468937514768248645689948541949624452858146891666784687684659355865475633857728643572282433227441899593385679136446538965142885641469844958215828445649943198872829856951653817329675567618383931472335912919547739349322563743115766133794626274855936872924614335359319677228947625225466232857329973368422536536353458484861448763382172619587782393552641975158839135583933889483551729283382658857168678375416157961242586456125342219997945416471995297596487262182339128141276315199126812335337177426517599744572288787687417726279299744326733662554948673858157286971883685983445853227475514697945864585446428843418313464318183883352954228421838191748526467269717178851469893671795866394925499812614975665642456589894442624917813428198171722174791741756474112295725248575186628685597424438763576475753958675536372736269542751861329814789222469682859191637376423931834498319637989741774319612794426615638587941233121911667823417431574239318177269841322155614443724566812464136189126516436776599752699821666116792557691614661874675819975441571124538622462792131294739511644795437961261778683932994672912591538328285355121778124973569834341346426499615925697812154362853277492997262424816937887468789663922123427123116826977219921358259415736827166947519925323751765886864746448487265675552365141784124145775395197536728167648784591994374934237381453793833846615116412152141291681463684911823519262599786538146324931818247145232786392992765565416877985576797256376199546659257395857237771812463727587164177394448494478247989546999659112491326889247631249541452245594688919761933548632594436388863621169373522515886312615936163983545242551359754592911524931456661437526382991294247825442813751215189438952567488973884862474746364932567889331988643831524844561381557773655675661619688611313939866326491361432772292392386153236496275555239359459865746888274932282718517765942244679566464641448498611284791579991522791288813526387922833923638278568426438786923784195239698737551265675995965369276743995343694217178264739378684186271131919286312661956557545944418226943134564887723139174237719788953575642398558725376212585163462491387899227632725819316217129584947151682899587619369967849751748629422732148226311322558827833237514621978134375116816393951129344117769191361499933352342547894474134679222823167953112375315545837729251591929798275421147124785788521997726856167758456328644457869929727814629854994787773397511624322145927469416796717577886651323123935965512698886842589464497172128638251191849225937771777788531514794791671359165449355768649437762222387993485935161364228522369826159694688776483689484653362285738916619265619586167674193139689449273997447573316787941241999152193681913149717243182548353792635838996252619781714342182733398592262515129846391475268835689787723175891221164751333433568617481632748775171896583131211964992725392992562375888725377343532872719186768296893194338171966145771991379682263458637488786962597437746326621819156958335753848432429796691836546412313625763863882221985942323257316624195583418866535492546147815112534482921235249762543155225344788222177326756635959231291724755543829883841969317944356986284378587851159439677814669265467752989323818886559393675675983743159793853957461224396613438921111382819412435745474674473443849552756662923136421795875593193155518858592581614342427351538876513469837341435145865154587437135528782537761265151335715868811919979924186944175763227465423885636633727621741562227485363427317297591124149741265827692481167777519317515472941887866665374492683293916394749948397568567692456956768615449358446327179252188749986287853196413273699675716783272188914548191924728662516578628764335476243133452676483791287764432849953648219482482349621241187187398949413968677147552161228488636365396314982571286835547479674516836975457222656119518921537191798544199518543486822671269213637566382533396134154664626788155976493141217312241564756459588423737166225233652466213153962613937999833364569517438114872421654689194632423575733757871395166345851216833546194442426537268451842635837531132743556859668137391474259448198998661585396363457258662454643439782384265819295714662346543143779667125879632961557149877288241114977931932954956665726683966385466677351845521443561756494881543976639357172225378795852656763731619582626228544969397637633255771892525315981737283772873961343556475418657751872876365976166382436498377361266582879232252494211264418967287353628756548421675763378597461977141919257423265353318335924428626437624433381765452646861249863688912683231853388865764196583351118855561655883976487794896996472761395973817623224298758982862112242362164397964978989221533726937793237167186647185967886963739223423153578185297262325991472942111961927667675913455283374499727651374337432797228616143184627678319543357267879586175192696512446681541587571971141664325814185489856531241746939922882697434911647845328882173828748974876148995175244536726434194323382854571366358531413387113514519339997743279216556158454553745184227797248388789278363251122965121893448886151697492746771398936633828154885439558739613135499245971721317352539882113363758519372434314895953683825728968265228819398251453758123669267755521367383345811518782531167431234319525697268852935187495357896369188331164997793276833286972679297666557826178583988876262165137522143614256389249471614286796116691927473494218189838178664938822373566297942758189121989244295571355473197343328127721883947836552615615398283593656951589858259677925797568625629524678978146938765375491985134113675927533613172974625479639291945119131997843188518661775637424251346192193533215623222958577194498971374764873535421245647252686696427257872497925466861279563281167572157924132118443848393656871755139879994245175669432652768158742426419932715687246254858213635364858343825142454737551612731723549225327499962181328342159644877977719223144297414492642469497611597154727777264984644944872719921578921293479845287481135457272436852664386852158476456419915379563327892742179429368885379693739622328251795972918183298749259276321854224117997314469386259789797549314284281434617563572947873616529423656133327974836275231337281919185769896167489332338479722871939368992217412562398995184612478272191267558565918135669429117743125776415247644321999691845928256684177825481777451134328631583339869135861475812111545264674345979457263574725975415914164283597176993656769166341561741821477666366456628794882455899383574774724552615137961689181138222293945669841264149297441548235822787124387441934947499425263922867811679685569459465182572443194774172324599536236544583627429466259363134225445478272454294786283625578856498617983116963527782643772843377922269254653716383986184543361754449233473185155443136381532526746445651331991635599259479559448929418362972638754975277837279487348682255573743827635631623493349868577653293997189375139481949526469285751398361677954251178636824555321247785146178843823984574944874615458135713668659367239222777822486495623779882727177212579922933991935847392932336818818844775958738729195559331795312647335797452646839613483872592433336323512598868532354928168862394346688415337467386888678716675348929528413982466247943255464826186497528992949841514344539613245551618221229514657725565924978631544661928427611881232982289477125934494633145536792534869165213212111622172818833943443234579457458121836668376791173171549373611664383962858328937298119686476497168593338383639238921354361921119395796664751822457812155555287667725518413933641399757827166349632993744478798634893319229929997438449715544555566846919673137716639292114226195787963182169789183927698886788441586882976585284135491662497857582698721796277936833363666327441871728884227928768926624352658977673275921783325257632874775617382422498449861747626563322153673887967372628274192373362852732162169169573153357355291379839919799441129794169833499563438228423338883811514296294839962533655648663289473572479117252346737312822146685314684525966193523325844322826166895696973465647445316714311152126926789228352761941496444656614273339916573275163586187189598371936589289715297333644825765961471514865553534454978536778143578843465791358999699655141368756358585184389423795464668938612125912479532173933165565747778539368722214541332386271917541225531239182786275359131846221399738373826298897717345914296692775966194192563844996128194184959545698947372945546329127577663925168736629515616555796941579412465169256228961475433138395326337127651763532572962339993821477396733397292437678496497862833384257238293388459866535256668156152315199676156838331429236336747345934867118538228855865464341677452831427668458594592419865449391798643782475937377452754698677459835184744826362737681322555527563265932227951789655293746113918467815574455519891399534557337679732133219628776764111333669936473561648756836595231799276294513762318194313796627459517566454977271212236531856589654279562644739149998525519367862191348874154595287131855265698254178694183784872434657257911393766313194273747341393954321963843828136737754529934794592391547326314725643278595468643388295296937468368138786226564857434296444945568175898771566877845883198615853213778895978536772745668387245373533331482972118483881137352513911732142742952822386782559278444931134998535482543541378417719369973536624748423822232198645935875541722178259543336454576645572429527197849158845545465884317818635599526913661938331959325147968262843576596822629673184959913531484922324863372129534741372748825378345343127774914328371478112348288854241349679226769956526172288927162691296276594151322984254799743328423967668853278175148367313673456428474955552293878239813494762873493567972987934439941331725154581221526287828711249295644238157965299922596214417573748735969273452924988826652639558588517646292279938322172264123226199485385921917764647983594418542774464486331615913688164445494258836771633411112724812836914248585913118356263725477384743427591168673853534251331468918265626884158977198123645848256245534973245969227717358796747523647219994479886475815526263991335985974147511566393192787991389154119715986624653443737611635762653674922167821764943495792767337368514628959595611445325647843855499628411897966414315753248437929418837169117459462297698185578597328148938318892624379496458637838166556667589549116355662217446256316856386161745918967298211223338456749193883954591265133187553738793937148242184852379596476249573144347895837217289357225264495981699891249171786788431499154281776627273199814826371313725736242571727966342794478379256457352468754618238598264943182811814834924254196224981241382737144772565373678194285922144829351651327447559282537184914458322659498498829941825926751471124128618992214824163815438154727198359942579287527334857651517875473912532698777938775396139385863216573621224632781934188379825463864983436725134155226228198334825571291329979637411758885787725426477457826659929489338723838394227881672329471161575577433728833784917221636483128317944945791745288668955529244645129633186788992918371564895981242128211491173522281335496353238492539575399534269472412111196858973829958589516335968755452922667526639111486873913941446912296425887793156153289667313856628926842531193386274661789812241162642189553857612966865448153957684644183558938455398998359964453567161519631968844957237599949698954897773235258299566212688469928856688311738688436179824263967773231881788669726574752485471444937179722296435616946887631111181314734441775292927424558996312544764683454735927296777672216432167675563787821548364563751478217539267329255289666979958472237448534983374276311273863255748875839924465686961938632441117918347955116136141882958844689176915336581365663227554433771167753834265158385672658598448938674833697555212331558553371835415794322794368976812171553765819643911864849726785826631215156997176886962887819213792725879422155783548327217538869643832783654561566822356526446976924289834898999352182176487157284841498261933478333549399242192861352321489629188861316946255739125739451594169549542521545511163123919212116146126748578543337635917355875629221147488697959167437423132238288599574872778546555229874427583965164989988324465941187875624198862849798952384848457786382483486653777885729345741822389312892715792852351789249564352881572192894532424365738759757625718876559645969853369631195974395543997254348675148818269773837239228366577872519365941331179971746744539612584568231796871787347676399976929423564421467474371861192144243843571144487783249371982253163368713896349346189339675311886711857936691263349967133953782981415965868311584715579763679118314351887815942825885722315472784199921767118663361556613221212143456886377758782586697916473856261673254577962738262248663142993766688981654268586857167824935364143118732466484728846353158182493848214249636366669814571344153369616296626352736395758437391144347545719399679771518114887742722811631634474252231456746955141966728134982943299197315745869488587882178766986926465133124414276157145858892793851585353195814134941237496669511362269791939611532286337165195356196585813132544283861652737624643386297387858432221263498979196626937916862271939438182823755366519581369753118548363838155526676651746345473671429949147362756436112232588429512919538929373839815799966968964113642362565727768697579422883297255819715174436559533879738524922279692812863524639316369478335535634587785293786172691997869713425378381593217168434453418886323571332163473564946111989947823623428781625364583291668883476974663516718448567737933144696376837438283421297865288594239794456456959396958663125123123726283327882526467416931678113881782324898131153947235913891953483658465279358219535332191983659395895335876366947662858997155298618677858383729535921831816344455987318268466272864316263884189836329596688264334116972495875126984815515776411265276587773842455362327368961764457363658395929848748819649356947786889158274768176559811617248247432969181417854439761212246411178729239835568446611644515766245248993158472229487178934793128641227432294885459831514777541432939125465254579171654959336982338584877798397369797144615725798146924344688835753435894771325374839567989111988664251865713359274831748565688739887322429267727983124514594942664833369677514413717925142473591678234245872376859582546225435686271859764322242382513849498633151158797657782152515678497633132887612651777915619118591995458729875924962433934372446743586555629319164917922658246151428516251749279239859774987496893953915432363148872192295538247333979277797197978934782426663297161749746885857431243674163481432853633166797634131433791168459116996691992728218512438612122646864528367999982184386344294194188742745896782627595574662847635264658444565935175331827179463372543963478936967918119817129851751917499833725662979192575633369786443626291485348734751844333663698338956487418236466948787865899594186951546888475964148859798224935368849633296476723238826898679444722912965485999492622689515866114197313137786554452396231855854147333235873568199888662427653623674832793845335881166238292521277547641723791726985472424863294975555672767937444278396459786981168587169318518575432162541145724623479931784716911651156474212539162138437956481439462155469923928637585925943743811538812356432421553183947188436663649475667336359884143337165275767523598564467345621211171527941892737127414737294153398547598981321566881779157333525494157697112322471119426656167824475897152231272372685466354495849897267241646664217727851535273128942596869463699633398558729555476285968181111961452787993373658611446546327227417652698939374574365144438851715126432323926472861586265813279912562368184585567747623849588183681151168659272714981936582723945344671839728177484482241118851869853131338567294655736485366977242842996216784756686899359194282358744485366333269497411539225471596694164735679949372628956926269672146381731269315276663714925133981425422443653524647186313424892689112149889779352548768198997994557287837915333274982566771272396193267722627351234281398971898675984135597731856983348376544449171858978955529337785959676532346618534867268438491891223795261399419861876161966279666814153585276852399863649583541534497729135574498235231536346786557983313968618165213496443773839325628615246698982726925371584875437976544587595282764176934733913131835898795854772162668916489734586179329812525681644916491157576378669496795722563862732322832463243452586841437822216591433387742776616128599811422168837313844263755952725882223875335837665995381573455553962774162299396921643419576754784471225386323932342845247972116966652698426838974327183887265765582143615247255784866511813636893624823823669348811291583164495225694548957649685126498516459383819831167452576169759918758671917552186857446357122339458599974452122991493366279881785357743538663219536445154428215236513953928646681185984596678789386631942554941838637367148766917241968964778395736433253864569216585372694171691927925629385343488152453238596434321752712278555429141193163956834263145257929573832877329168561938665197123493163972977917635939967964376777766661767134756827617582617481738739482324554389225975326749399434967345734586541455612196989525991732853555217962848316732836593354544673753119638116382272148187231569921831134961253892187753637989617263843159423296275321699175926157816425465686843445137361439635382297123734642659713626333866687719966775979621783643559551961449112211451763298699337345249251753188719939813399685635698428662951211536675358731214327969923819992519185877293462228878737254219917761288947193692294379379842666735733866128562269951867988989394386642389254388619426684813667864344654853573869152396485669711949664742165174766485169487987164815631318682374161833919959817543766836955379457711194426819915484872758419143587837252658454785526856621248957258193643196531538232319361863517996658123858686521467332169586975987799368846879345142253654436258948965175229961519141422751824354946124985673422155752395381593834251594935479319758774225645119339992452871593945954563984911714755747853183611272885961657232721687896374266371659342262682364573827797335632583117849741732427623781618751658893931397897749178269327957647768833777326361663479582896646932692444498515258621461211456626422763628418337621992768935434552161325959251366937166621732143224371895172491918214958872336516728966851129336292495532363695879738888419983738728362546358977323988252769439665521399752944527216656248728951749573348336358975463131352814441351595674659286895796234262643945779844487391643791942167436688157887237136422651476316236788276466259771226651694231422281336966418325867382755773291441425874836845815197925579157951592279677989832385458214951581579616994311466969952718219674875414453856627896816365427749491793565786938111545644228839875589259821623832961668553718295564761378637367889564318912294561259877579624675123496894846441383221576158525678433462436334633322289214411245324711857232441914937353119941193748482528156392871922968751545498369652135823512384764695853571921832877651427135277649294249911777742221133983258334723519594265289128613679499215653657696844965118292646945381915394594311498726968546577522468761638828161451388681176456497552245832837568332297845148993771683735693763897361786831468828291884421261279498335736282999787766747377647474711161973427184833344986574297342841583549851347617515198937413461534197217563972815588671561165498339214933124181159427518347312864495699977873941421433539823213966679834552816581662574586891143253539317181595269161362289981228264188578733451628837829115492935396475639629382821233483287646861491228548224464342954415654756184676542473551888689185545834115674352873765231537286259543593427236329131639186338328866387666144132732787122914351577612397845144452558393946567885597812371522191731698972315673237655574985136597365443512246232867742223198967482636197197783894492378171826131183843186614121559111154764799752586321931999651939495468292755467834364496393673163149942786877274551779263778341295722863163767788761421751485853156165117693633357339974539835229596883176164522266422558472783642424833349867153472417154217375913896346953743748944761431498858683987482852248467371311588277234876718927153739114175218146991617415372813812881455174161517728846941719545135967155881194584213785755389762721971467196481341337985833779447383834125837748995619359167867866936611128519132636957246394767534783421442233772311225587985734897417567529385293941274855723657638914695649438488843438278879692592833771121483249232113385255229779143574352898211388429667882334769229713234419324121586348127655842421536866325119868941268712815519238272792625498982876676751616118445485848963425415963873569591224952769665549598491128569342411765516277236839171781477789675535526488472214749716535392372591987414571541176298475417937474727716416337438969145747937627299187495868461389894149347764787711356571643495376239791459269823831924346183327289942576849789281576288312667994432432179845937229548414977719734415375436716181316271938727216257882374383233775842332447189872755546231738719625491387618225744597569896775294387362685817847673568337144135554859659281328484498814584686877677828192899794197127889775217573129993925753484767317155273384423914195345852643412537631281282352254891629513183634618948567567935951111174375617119133175653742715258714186945356759491914717442339439661985385995938562656377699651344686181314947811142371742628159693943527498435455593339614275421617712173426328215918432349399311173263444276519655468459554717411238731851784488667316454878889984584388948291124399566119698443145865566288162137587772359499922833216349169684612596418298841985458841521663482714784627263414195544553814631325369357366588523138777741748375985329324833278167219999612842168972337625437542489881464198428292263269978791181142968419677566798557438878365351245538931313134182718943511544228922759868321534248417685661991653569836238795551721463766732981967938231844295849422843697734639785333416577244812871222726416943946127796179754154438744215886423956934593286883749136348235661635594375943222191225529192932869981282719149165767261532712488944336615226783155852868196674374478246378515527621465588969751695883779934886679469518834748266612651878764485597662277969128373746775154921434155986647717453158551662562536648553843414164275741818414726831114982576339582781198723975974222124238393972815226694924381861998961465644724698638539386632449617943424644727538649535814162657691668942346324823713437961341915558816884931379863426669447594714472852543189217224963387155848576875947238447462598686292141992735939412648183331491581264791883798573744195847736931696849853732341548588865191198741135429525462577562738391358152769962161385637738724731859224214923546822852225873188882394981358516969475232639814211437767397484491271163884733314675542758296485579323341241961357926364596456843489853928666544378197784133515531715172897261251244766439547827414793433271355849135939653199826592343865147433985264988216319474969264858242617853482848698786521157251441226886165829965483179358477816241156877996225264624767449352422579829756763866276653989356693322793477457721522272922617383612264158655864634421216732873579394972944718891241426631816997133268494963534855513569174527396118252944234563957276695343813657632987486243564376814961692996628767654849162716595359275889622452389191994431218254659959137639158448992765619414597118262784997634793361292535276863937121264528614796812275894863753781643639873129733368617583871864539947323766834414788172243366197364318545823648498757477518114489652824986436495637857473673617164181397335683237483814318492653748933513428184977924616478691827986899364991386357242139272113484346376234799631357478521456374556637352576679641597736933466348498272899325559369725452742926513617449897789522791619793858381668794196889297929645675826916456284559832749175129976661578385935991645223154874481574966985792843552291698863258138815838877211632874299262946598732869383991275813672224618527272591183765131362442762437397794632382486443624175975957576863484776893495629842617525342353874358679185333199276734923329394931636489224293611461749788875529617284152438652963233783961764635379867289467656121446897145471849476189427491143781519842924121162458157917296215871964961653869956553577228628638329338714463469458961384812124819862643363475215686871697375614814128699521358525698989367246364997677967629474654496116931598626237551622753241299717868696777591872357867744928637424144768231336613474419717179767762187183431997426699582864726428628744154563466174824118244668775374217974348984955591459833829988752188829898177361862347443427574868815868492821678323326851191179444554239556582335967649565711818941277881373433277182719265793834215346879914666657368915318462672857811698364382811653235248326497928587358247384334881197336157259167989576353497592828987888959774276134365544798923194493631528282325682954222778819551423854341218285371417321244792625657247185633354635386959941997354697734379258397453773429172455775428421975185372764493153431829963841237146989641438564129417477742628799348139151296356743425475916299243466523128535335372816496445654144125245223561587274893683373445262664661781133265229224174415964417378524722332646917512152594552782848266214541648165753838184929676196599149524825721163694534693979278852462361572755742292853879653325348131359692668187364454615168532722135494141894854213941455786547561176786714187246794153741584434471774732919799226879524865719912623864832499219741695771562492852669581671272295228157315875351177367823197364829996948836334627891668512154623678788567231791878366787921892561474691445992952697883817279427427371692682636748189632317575426679577632785685394287138966752263623653885195531397699112181914846243287181864323423617371633253736748532785648315142544218945817531879112221549156578636446866416789356842759125544154764437483222469594662644781497461248559238257741481857995763715163634952343452291345576735137837463433123775223314689925318825818453363173881653746784274659159479353539763388952374815392141788963114954593733814672776769978972532719259477651879891528198348625296682777593487686313177144257215115475346211659456379157451117179681225256452541924285516551281661132786411672641975126779265342524157676219287236135456985784889583962189242714272332156418618478934172383488995732415133892972831637797551348851414129394378789594799322193639563641488788576884764551818853189531323663615526417393525746888574824645848568791246763524853398421325985854313785151473755552567488482518623169696331729672415138176862335789771314553382623958997189521857791321997271681486147762969996733583191551625165819814832617875569233216698935766245246395574536475411711422246722612571263873485848697198966886837236191436768386316645232573575597119381513547887349127273481663898814457176543237662468421568762273227421952538137133352383889515439788545823736768669929274762466813925168724417612774789562889236841525489688118228391724653929263883939663991169412376284576696151812445523749562589266975486965987124312242636315271663563948325613412589713926499352728256422913239679231872216872199636686161611957464295461618584899287613268479932377687521848542836711982318815596879357675444731216698765159222679835692584654777694266581152775762361787432638615831383364354792394879239381271312592672697816696674238695648129326759631337344441169567998835179237772329887911254868854671178875183144242875197257899761124273832485321694141745417864249519187245254949859485122555368483236951282265186282883438493591858871884736756961475228835243793394564165362581742322442214567368893527996364754625278681784322117422856366587161761956173923282667166189523911311182758984364577227471154822263954914262253199949173765714973947992597652228534965296664621468243393488982422321412968928565545776681177336111124995994385411968753429857135753456495399672367631369891256122979373314525788746316767542586238486171585555499176557991689476954926866761254788674124451637279667491992682499547917239368227961371623447878666384942822853656968956921249926357439584711564491111345575672332276866162151197223381657687477836887774718331625186121176253134866188129213185276469311263266229472269396575534695236218565885521216512886888127768814153191642781579293317276392531928576322692864286394587364552325183655572351227399855237938517778287973393162513223985147982157884916556476722144577841615155456451871757431761877374654166483389883825911855627664435371536545842728899341387399945782846766166831138572453929623244153684486572298619926162687699252894969777896273244856646981973174544692643433613626657526182378846613281442218957368281263321391693235853818869536218888749221371711563788887244351143442999297458494442643817753899514765739661439694778114529159344322174667126913166939748525349195361845533142238129593875535613153295434185879299733199122187489545558942967396692427972614988185531155928429441738481481561762165569134974241862973259558886114369219825188718142912969732133135121358446817853855552939643739583683797883317649214525715556128628572356261462411832324599444331361648746712229952229853259666789274455749895986522382512252269839535566689741788146373756962792333647263514444185167646652345635634194916938891589624937936454281965791992377422162768722863895825328773976327872787856836193721238244568631125831562423845231837154386271361926449553695178336677779943878179322525712513621273892538934332287246874919611254327563264699763776964955343158682737531911771858535538745133834154757742879929718823939749834393153745216983943783564939794375378745393819228823432237962919565289532524816754521546758839558484783886329369484765547815548985165289314282494364714249357774731611346353299162827335291631182695659171971567394573928297378519969642177273262426844599747822199592272331475767142776813637877596372397161597594148652724635774374895269969556244595379158322572181355522585319265442229744675778112797487315753171866855545972142535297487591561989752343725791549813996861112529462589846885974561374233892829199741697399476122145166679136253731992618775767657518117441566966786914731611745218566238347242544837471513293811479278887924139897432386543337452195963856747969344289471225291556971159974855895443718127144976183922951283774536687817144588855227546336838797243429927818595256831873793848918587757964623229873859699893662654748418719977916265656159914974273579991557374823231663556327162253687968773866858525381964417995549924875212811796846114577838527294978276474582875591732268419482532189429844865214598652172548442437712315573341754158253788475688644286647712626544914439411878589759681688846815654898164191838469942344927275612323238835465275666773685529596762248389519827284667727648139539514254168452697961125417595629444633477517434482984688499169395666616219855749176952869167492635164456132585759527396929318128944357318897439542725256184435575416656387981541428282273716733837565822771737766949225957911957482313796726934554718396718598582277715951859166924295125689532394248834766525847422323315614485862658119362696765759449461979263764548511764717788271172446315842787833128862484929626723681163376486888926431937943164491949591962168846192653874495443214518732216775577535437889415333357451576787267871118953823757289629524352286294229467236233637598847322329825356723371123677938481571367971416522535873915464261148935182497534988933147552572514186235399121177249696938293669835258163594693961836497333381534299488152882815571318859389469718917838744194662294897833267422537194973917711829331333193855583282747951744599155934979419626137321779682898737854334465326349816234947872371911271949825943841848337371986342139513661276169575593784565682521353948971721465178271665386256852164769162516838785421687134351363142731944684114737429851353586662539677815965779786381934527153754163126764841229922885326479449741691221662235548313986757916559931792177623164876833975864187459919855717555258826325179178398759923914852579672354941337216547761377595158326966862528398635335792521213422646557461225837271645351177575932424647126567612887583133255766653516344124187182653655792733324344291244294163855814231292172578698271326135934666147938448969613122585226426573345897795633522922695357368357487134232411319688983846555663634288728143528473922349941923381953797541839699136722218595574768171543257585479571326256841263255483816323459957675699624692182897712722553826621631742385892344848214745874727122133241899514428166422123195817367825931776171845387746167555823359652296239373629914228153932422143715333268939224517428299368358389858381999585155793329256727378632249299156931421425387457584214561165425831316942416626472116262641572277615528499577775192528348867453629339612926986323745178879791835623331263659222872121617777263126345123623536224499263251989244533396965749418759293389164754151427771689468494924494845448271287688587516741791224812379198243554613471284799718294554526456899855563869188624683894841535239868612167986386488111225818617736614249357687993725437786347759169644634352228611194474761591273512171927655238528783893913573411857884952158738315412259324249158342588173599871497711912975226738753969118566338624534259711965757186317892819116121316155145646983334173853751522552617721728896465532565132711218527417417259953871177164143765118454539357313128141332332811461321397869995757341225842542382955513853787834485929739835826852662855633973282432433712442488761786243254395394189587641585313774161669883598987516395562474291226589432511559321554456361281658134593361985829874447741316998972633652822997374438951964555288344477483397263153962774547618837647539329535658538686345417959547625445229147457638695964527942314859548294867769934378771847234423448486142598172124697854519487621725486479971724612762331639344287242435971596619957415216623878569855191634787162816726418833581125376176391299389378464682592545662692525853123166485525247449646151414723611287361156764176457767516918587387559624324796377595547668295665372496879783319244569282644347732618885471634326718668869879235797432838698333553551192335463299129521199436891616193498549192919344895337556293864948186412593128818594517548418276841153671896667234634389468725825762268179998923984497483487984883537322556984621543284713992468412697758813368621528635488877232647318677114931263693468319149514628413717671367666147943314848216249978725384737977588179645248923791266841677473832396375918962854231493717765322389746664542262937934229183987445197935545197364292785669846976398726383927968477661577499119266246279776456842554142185785454784373242779341684369752963828497941552171752826136421741495452465568175227487247568931298892492511276719868166742578448767366551197694758543763264456125136288148993472191361377379872537738728667376163854893518929491387571165744468389259282568924491263668668467132623183236382441146958722896927496988979159269942956564374526115897229784442686723576527334485354577254315428257724121879962194271645547139739422613833775573258173172866969886511829725339564739686952191238862451538766937658552625457252351486297254749589831528794219916578683586432619452435266644995762565121469342543121844973574912323888975157438588427664815136131261723176625639519679431593449377614784113266699964741561289258997553996384168567258764772662765839513988954275354874219478474539196976577386626768666373248254419987398519866776515219287824763255467268263372279589712991745486579842648657912875282468962948889688398242883164995459147584352147979142345661319174893932693947126533139349489916481413751752888658926283774155224397734593562761875348971996836682675535798454293292145287688422956351228489529213573326855796893571831717137731982756986753256784899215766829721988952465579173259821559718314757232479958891479567891548455961289678884557169388673754151217236699425165224115172173763698688549249892169638251654811232557126452899577687763486821915645331722996221737248586549279632387646729784569568894787219633453939861196941179167367868174129171797671575635228261447811218182648788369679834978552425513436115989436537925933664296477819416913963352395559133113278695862197487987271398642583864587474778922816881384478637656373974939693166533139483781699385394488496551674121174819111237686254245587934394892236974335148747453447865312823685782928699517472977973577168244357119456485724113556816736726729343894472318814627456772355383519929848638457599423521712685272489496712559945287388658658773321538642579181494376953237883633595721673849775383638255215346918421469593379141184497385772612344884282212817945549691485983154835967128144229546183813886539326619416711582442262495686144656767166426956483667686683919452387323455333694672666856944465925469394356712144663693589743511321988476482673463642489622953249871323751497587469324214282569449231252964956698716993796755167591676543747663612175428617564942954284348566722798712769749912281444264979298535691791233934465916868348468652936118413611944479996481884517176435457971219483952495483957899525236722882374254261359337922773199585931152748615351213541799841412916529861156495546765195849132287486619833419228394234659616585822348791556468673245899247344812983757413845781379247471954333527496362954474451722337284359421485367282632688972381715243653331755899439658882417313412631462557126779469585831791572351834176161249666934544849744881974632739497279639586813383212738263245642579994967236488149616728987578982761756538648224571466945451121626232484927476612677275282232172851535989152913328469595423363812861574965327862896726549248116521735444925745836831539777718674767462776673922995471582916718292297211435288514428918747788185483945984378232534934932252127616832419368842915972897213825879466735867718418768272524586377443493128146565994224519833248929673657494413245673436956173136415952865721133873589577367432619342957514783764949236318684211482214163261993912321491795123964215363412692648369326912358887644923858428257896737231865625444893664666839262571486135166272638172893385677499164232515526126464216939524536164954167734543849682115526672298628269411815944329259781239818596448487881485515727792971618271619764412127665278981286667833436468149595293862227452367921891137855239922986375423249127658282155559761697536473437754381347346933528463432817147317143969478577319815227976578345111479661213314828888335646534922388892885977327658837481977173389361419538992294492958838154182635617161558393996735868613589272164626955251997531462849581118884137863342729131135951742847741285684241193492912476986269591871992577672431423729931217959573985771471895346181879559745215597575854296256985364215823328916512531357775533832465676612418562989943428454692698847171315749573461981785275369252497685451938946924833372855186841124572912828965159776359557747535549618444727869615578213552177892774392869522455827169192536583871637587982423193616847765695531264744974596565512998127269544113431118913633194866527563262486581852392113315146812412369362268529847475171527471698464347716375291983393367918145223496593818438953679886726469627663421632987357793624897323729362584176753362162889566983791665755347187957756854539585937711375569341117587882366165325967327131289764882467274891486893132616751181612584549748168189856932913853169673583371649931223438561379474971789182562829277952978416579935777383463342937733278656126762381421984444143578227919236738443598269378733242816436987446449566894825259632343623258298815117671789891954565834682252737184236168636779476994931267969796866662589853667372596549154971199939994126414735429127569151599572827426337252375878556837521792282133688828673958856911339173547549712254897749924834483759559458729437776222849394136258657157723984857635293674853398176962584555293715137968118773961195714317153164695246814357868223334922254675364422766928981235518871336535868431192872685268539422937139742492198458154827555244635863642652659955852926731438854479299517327924639459713295756878865371764468812389724924898755565642748916849479556964825916341535669363447723336653583536846856972194884727519979939349583681832384256593261225419944799313161395153913976866141385439645253675134789661258896778921247435538943423942229121686556253289857495198949221196562585611136727257736135972219558669935898467649735916383133856198795573648688777511238942488863585999998544645533892536517553557715551461956223685954121762829254812937464123555472917651717438167752213736568546624799671846865341682745859172839827517943431942896946931777428735776816263558983297172319412963682794373821923674269116132717284624625243244773152857363399136499943893387351721223343779643283764141142576938251984641873451456965199926779244221721526651697586979657332744198485317338754713414392623837534614426276714674958824525153738615189358627114297929469756359365645152869294665498674199882639629916625935896383742781394692583338924547336631956676893971714463644878736512244496693374296678683749688313642154827684911535445455541296566513286861775178449415642835477427873645768556625268628535198787221387596232222968496766995371334696253246763316118529769873691986728638864884678574736616295493876939521946313639552518669148929281853593294396814862727325279724547455418247578917776711739971984731963158145295338276393721328839575112351937551926598538722369764229432716463678878287883447373216666615321613161222613947381196858621265686344816964415573431679915589752656664124454524488149614398145815445729181653569132517655669512221724478879956497871968712115914668683267411478231764422956397231197615586996714383934847874683363594279527698816674141382916937556361537557336265613526455657677493649131798238835815127817221234972721152194148237784575276714594296785178329729612153461942968197698161511197335737111979347729752656197219123999591324535217478766927941335154587629953633383771584139265633469736453344783842497681457279874497277523353462678834315487635887389725397463962995963126385968398991858497531864257439414349678154519444824156259626991142641427148153998339193838842798353218676232498926554318225736452458124669882279191783236961589292482478648983884966133831773334333744132479378984786358419262353944461771731876274274138933853344587529863519132378625656339481761617876157437687489521532582665741835421335469713532827231536372114428148556128662833547688441163956235988812175995742568328778863237737259973786654766858997652247589242594368549361853622657867132932981233225525468387181615754439753623644599535175319567678944543648674375527429388754591932462878533267754859238347265619534374354199887412791645491498432347661572212525117193196365885117638177286674481939487511341722628573984622466124219191919926161542923581798284494824481747377572562536823394955243267329667341777519195435938723291949386489655173988688419899365235826175525225254529879884453289481813832258372788954162158932913374126736739552911616895241453545635779123614586573611221697269816934764467937235661517189726949797546182854973278247523772549157155523818718523873899732938453596868412798171317219875886363683321596641839116715553115432128367392574541598997834443962616353431555467249944441373248446488522911163355465733666982682495638615635973163851744887497875662595222346691717871652671973429468283142764114926996137133474535276824915998246927925356466988146617241383423451266372937821951222388882169764936384962966169692318526616895122739828513935398774287948134686562143952929411361469245421224449269999497315144615852831536114792157695265127985126521621618531648619923821229626699856858443585882161573633263715544249861528913179362136679787718821943728353747875345965853131751233268496575868477888197645636534294826416434528739742163147584756595611656996682493371577149548518677596537744632554946729169548515928448936855942614236628876682461858689266781959871724248583885893353411463492963253484923714368212678917688711127584886949224312133344648975831452897573274181425547335318797158999734415148727849344598448585616745117711762766453813635128968785219527454168583974569287238365846333241812848196761895787136558953538321788599988756767727981695781824128316682213251343795232269229179187184145726641857695313126986672769396789435253379277791896386237135452489433813194178693736316685948533686928644823752518124785146879524337744364344597135191286396343634259663776589744568699884211712164423526488618697976852858671233115449127337533594535834963191523844713697281454942797792196988693716483984618594584771589393748236676475736829957979455534576137371762718522846443132217161983271296945897754166557954994919686572267816751439583293178137555946714739479225538375261489741193748596261199931995616965364617824318651632949297969547523381291118424588796522191413147383925561581761674265197814151752175346965562868142438123195265313434629544178978284286272456227188793812745152121654728614238514768319422845118994988321722279995263662448367615128468664784349144446972912698234377551372431294941555651349373674463589759756636379227498895182132326118171598233534359812892772189873536539977562712718197551468273983933772782736997434893699479362497819697985257272562295969974973698789358956765281681727348598779336899865787722367296869453335266853643969252734357938853647648111537965389617813713126784998386941391619626934314777971559266958172888814973955188319619351357237826693429548731547637454176399982541759639991389225632237624245621782722947425563899746444842614956622964458584996632783279232921934183959582493984936155742154268778673698437999351365779226942693544633172122794191692169315297433796599335844216111188897277726554891538296849649661759544954413834838582369183637672156631156757121417776755379224786178117544872197325538664837694748395288972647632211982479782268524634615446251497339222655529937858636731238722626658631552834886341387699998959662324956429283761281337134416399679792793649618733795445688493566418755481348148874298559712422546835864174447133586195249518366928164929213841513494481769711926888846599752455119227391941467149425654944275857263242822816573563265779492835141416192825565464792497195362759135458987596935849581939989376642182825162744638543211824472487881692882145517348435472837618366242449147198161932521347582928223275268289487163845112728528859389962197919597964667178521443665774463127977564271811377474845165874314983678457792977398222894787174214325726737754129188245956383691169557524969738775223231726912298193755166863224537934394836566846877383666219116374124127271215148156624119352874921587669883286152286591467923141434587368678895757294939572585438347918245825682639864545633547496318847359726197283432917289556412833584281267227112923527384627238173633163589987798965493385534622798676557373743338744167426859197349871235283259169389591217829712558973669877224456424648639648611567694718399638415656224698642155232775944353415438956332759725764415282885428799844362514291961732592823578879764554188665976185612351581945279767271499767253167423572968373539681199777214772335437661869471137536681925343432766642895722826373592296574876573412726177347483445759856811282429529789573841856866613846143668921616417323323977998542275221257557812116388562375388717366663277958396915928173181724161533292612633235331949379931437489338517699715127937688991358189273726743866649761636571177924785945776578213927373233523519379922789824699826516117863416825644789556891289631298273749475745421734844855766974791161172958984638416133216747722543315494638167241891323227819528175279361897929383997389277769485984257226318146561382953821753858286759184718286623386212864838582666375773595286988767927281281923938224377738783711496196793581563829777291868781891981547479639781326271788726582398527829773238187959642121758371457187758289714626924838698895844312662321542927842894579322556362234571657195674643243578224268133964315726746821656244212133743791844121727424514667298223258921148989757391335659978839613493466335837958369812591662239395243644379499866492945524151926527731757314744931553221687569182563953487833665866549864753928477396163997417269795674237914739635152421336174981985735121415326444634235171632848491587825177671642161532373489942143782982359161299486249141536588964979198251915648419972139799177647335856769517376293683671961375139943679832997322498625925677459944369288527935546252428889644834212179482137657713546737698247339883756534318987311719827345198224579814387288388646848918545378798292679389958889348859159359691738418911275364795375825227684725553965914747142933166632584368373368213162568958561235334653533181331579997376548673817393948298812696595151878691154563458249268643911421947384112138841714977914181381253887555348575643498711393823464496692749469559161147218241312155681644712659551594633892258956963952982396126767833745172486547698898343734272425247774751578646799734822917643487782857561718887571962597249741555724258963188166616852199788591483471553429881561354767927573871952337161435788557948258865419489147463489649295149596185568149576187798769998675265629223818185584763629886151297712624318317564296283557287469241695977944738725252676488399665168192835342829282218852884636568411594722129466124977253323842646851758876571736328356532953669381569331562977593212783448891225749385725749438352792725134637729529524483254219857863176481161277449695646974429465658753121239914687372892579651328293276469726798471923712699258365443494932147649866241824188149463172293632443595899291794425967796926428968791269147395269362687588344226173737345575449643535746656359526477988446439763418149267258684779543594157228531497184981956328841745774546587286896741813235277312721836186871538322298481836195566118666794761581868695845129117877356233989553362589391817512361451519587167925337143229646246585593311253712194778229181685628785994718116685222588578717977842494662977123639327116168833794215724566343982716892632583899966839128899887958474153286179169438439319739375448442712784363949393571422482323442318445843939197279772785968331666712942273479773783338845431667477524464257532518463118781995587136158584915661213225989275666437683859686831775633186934784518927418586897966686684968742153929396838323165329286228131792793852934376247215455446149422657329131196923438672856766428959781424324863454926221913855346668828267678313755315213799355362313326123643821522877494556993631444785877488577465867644777457368133969224691283935364138497622862621287737475426369885218884734157989612442535546861774553911481711772578182574868366625627257559661563419714663486568882365832472526899679836792518231194784567414498865357947971863179642747437466854213283251895161511572423392791411463429572673723213772938464119451447351984552997295428753525835881349524641127871418777688258872834897595817752689122535744231212491584467451464928522729352247242578235143239252492624557196189231298687112579653756789536863939636768525831553352128665263915353724997579537259381321464141365744735931877438219356976357519891512638161527749254189123359222738757538155811315256469333551362955462596893352821139841851465524153953347433393631672152623629946363342422275827973829913431438881635824841546756682993623669375796549367327633825267132317959279349285285519689389211942678235957979356268981445751187226586332917433829544173715416476222423556314112533589769858672632479391545348758475869225731884948296169937376733444965656221291375683817466686511171814422572385427757476294148796435917224532157154266482165995172425978297739776623994465758727438758516728892542988488164594479148179537278121788126974296518186493798131125479519472874883574854792735677432832459246816739172624558147839288195392146233555928962615135734583594599384767645918928446325721824974778847991579783542818593559751888359889678564184952544671292371773698543522199119714435399969422659651157278229985327775363458933213195228392385212526348224344476253884732352417292671968737762257569163995538738987457271114522399198139352326659227884663893891982163938548187331969733233384966412375687537724475265569794914629898424552898922325149553899131433353842818445882586455254522956972379935338763269261271123637194515372545779564495258671129789634978585684387653188774213834672326283678323597386614689111492999948937495825136734658435396273793643781544931296164824414295836436761916598857852689291828585965975198625581176298389371863991482346932129321279752532519297112581244731524481765182735687671842849242685793969257662959352338326273135438362527497795163779421872448946333922656475512485983746227618388268416845658799672394592237886547279319688268878746937793337944678365293984862144449915674484442444449562442932381893132192356917856898846652698299612186133685713794372367183764898318746353436866288785991321567868695891449972113979937515884116793374654656463327625424189956824135679337385972775116925811998768963594937958527687436576735637574412115213569342969397257415499566197133986593251578739159546478582947157685363465349883122594598883914685363984448129996714958298136136617328922696939372361643318238125773843615882791369837277594533251272433714365979434367134783986243286652498614895584829277358347935842424814514157262631543929281143198121391378717794114165243451744726899859322883416875554815412542531637469546378558867195318731176731631139236379616979448196725985673618899629432357332719736992873685585297784589223762721887498838584869432924487572152136169344353453144538541667553275249395621454237376291335661123234246426622126457632563471431146779261352221569386986196799292215171388576137183713873697751594321333411255882273448739669829155161918223844211227597555762348352953993693526645541718822145191535456387498238628987855559648993852567982551525957279323796413121843926516676541975215143429774259424831739386557741686295626682578414666489316947852586739194227534621134928135581975867849231334328538832128629936478985355589949872667311918532975855948815464772866423887934428488919274243388254366816568272613879639992427983575145934947955276629622942764395635321695118914186861283477179965877695835554817796926588951264468626917744163579327765886196858194776656938798688184149319787135218778421354914563961377365248491796594248816862483817689148831547894284997627123975462786719772222345238622979735665858225751384511122365268992742154533289375926955667398511729326262234267625555855333827132718914626355277641982111958144533699891545235889258747448874969745359992232994628844862332483822799943326875464243377993396399524915888526666475644761141583642854973654244333163275555286888178457656237969121793341763131837422172917642633565499384277321369873438136463615776144934223197242245652357443137789423662848877723174194916633759398776888195361399679212719891666846165854687421524188141756347723749659282133569376595161543775953915297492283711632342398277952219778381462577715514449527394716692955231331584221257281543177757194819431158456948265821261649571887855776386574464238777635237258676615697798874698229528673951247878359275718219385653118195536677192155216627679167439218191813864778696785817762866315965796764576254696669947517898566967767931113649385313584216968792443662185518385718954929792179297874538736886929151152192982274595418248157794682633926368299926959938197538826163498255635514834149798264669373196658573586247678451841745621163766325726592896992177387127796199382134231468969171573375239388563396718861666443886414281335944871933923757997143348181721789472883587496691834357411927822339366833283363375988322661558211459337252699316183672273146334417427825766566435973857388791198951558146563274852851419341793144761533185851688868857686399741868233133439352917114458697812916681167151648776392973781321141552736485826621638854185999283739616977657627225541521337318393287799438726836497187156288854838835891496912266972345345166612767652423369797621463761881192242216765342389165235478727572812757778626373792531873249569311356844179472361368873461149911699382288551327553629539114616839748784822428144255681751523738394161338352598664596452634174349685876967331723272759119581445389153923876925853284987228887971654459641573545559469291861236419184648822811693524366331344152313697788986423129931821586395524291994145473467855815364526141671164642234154765222269235524516823841515314337551743326159845168583935353133263453452382832513382892972984541158596666768937328533693166356695416889266386783458187322736964635441256667971731668372924919217222413325899953352213463232932372485329521245843883727442965198341432116619825571496723447726629713594898339638492783451365365691849481771725295626759221346217531221729862368727686854116588618591191337857498954334656311118911464963972238873439963316439182157743532572176893225233396983255522194942846435439731575671824212651935815782234622939223971623218693437114528363671923674819171696156535585451769254719854988751914562861523774662645382784174524689525748769828163144366814647312752448425332919238332436916143257548787675738125656138158769574585469824199518654983443214322769369574492726723923671984773342772429995723717162716269312341237318695926737471893448272227867313145457656772425577668992345917721182337811873273136752539378825591661843828899396633871537875692783169797815688316579435585341815689344341823272251529526716987725671186433161676188883431145884597361818815828613225116976955115447778621796512183419398486588294355296161117617629362828334139732716292872841261713661696592683167123687387347497889783474779898426275569218261812781967516615165912144515958116735338286841717169958865174981433654818184884866595674253764295117691319354562717667328194475841416498492824715416645277733582448258597393918487833486245818832535858269857193648293448699294319837656793178657776392617366581772175252214321129241988595419628965867767869965514491448356797363727711399695176757292896977389475128811178476123319646578651577428464689998399562896584722291713126816761677755298774433882829145999218298768179624484166396868641447592598257691259545869229922361975752617282719662289853894854666717399397462981736933934888835869462672788296673616533554633513443373773284754793452885394467137276123572779873678813966457883292511911782759158648476832554811733228546233748192836885815861569985241471395782832433928683931288759684646537988387694127166663226467153484861185652696163295792977436132799532893828659343734294636131616525793716943485772587229497434941279385263534416675237593936884945928525481833336487653863358559782841366448651791943534523296913933929418288588152374364521676343982629918874512448295386899423554998776855132124781131483333783311997413477634391673413428496918174239166518259326258224967289572863123554446444411448445659245829472295192267286866323934392249857126116699277788625812325714839331783556729237395547595833968994831428698115613783774274159583285314522855799883441532986133374865467588679495757486699267617257933975673475242614525569676317469219918858533856325814688776442258525961134295324126475818244434916592613246659595159152122392558376871122236443164734981198189998816321447897383448514655625767754641194314198955135675118571626922374546946481835916912698265755275149998263842494727968994918651532836326662381256948776816279272245761322359668356889549855446286537199735394578575673337339342497642124786349264259525457284483484496153983658853234579389123474532582895141837657786785732231121649617423267119466358485391311119599553834877988742672232822649225887377132658443982412711237323742334342639127398696256758172429872791958311123298725914292256852629146838147838686238433338745811287782176943378436817741189362578824114778198375198813829746736528768163995872587497384195841695214469356991765862719669813737934932451924917785477294913731912155517561835617289858923886888972337543488315536575999892534544152137917821233415361128911442144567795148128464874535138367812223827735181964419668211143738848433845575421974168571484679843731474393798774545812742459727236555589464481276536942554952423629292676595297745614465725594367664462384246239938916129435633967916847157813764674191745963419988227373471749163543475759147657197248441388214312267257821168177455722977491782348767459732468869138554888371355895721472421867556389677754557659787576169569841854748729162916631751994213259967814768733484643486483979913933444718143731147283633177363874959111512346138243464475137357383613552715365323311994313277898586978743169638817152271649512394889572596831278399635134835546896985238424379564365518315139375636265538611552314223121612668823998664271355514593784647284694651544831919537529649357173899794951644499366546977294266776663856588945928796373985468898666439329917981475775772329266558823213741941738997289447376718373989187217161278333727587834729245539996614589893236745568197673135598237552256969325616145498471694883555913857829273385382686722271378839275347251314777267151712754428185377878923695797695941957488235362443826674657386694964717532411412943317396572119699516738379226127595683472697666991419319979951733575387471337821676566625665941817342557847192964619165741178442793871735391194251697418135484433191893261648469326277389728276464167552457135619545679485825334784559322615269923826723599934439842136417499196833217651666413781142538538287668139984926731796435161266897294335324814572516457484991744235917639393624149265927555892265126226862632459131443883942949212814687514474178964497299895431513776357425555518741444713875333942629816337879766916562938253213644151645548897581967728286639898362157473883475349313216338936758739456545975492635899351168948491553484145237953281648472346236882518746848858269871397361239751573459139379859546919646461363661253577575919334937791111857686485881425861314135351163921527953882584316273697165493487533482466449375151472715697852489728817983359589852177829172823464267468191367657661141664844126652787584732722187127139757326877311451424517826125315144792717616565845174964485635269868627759259861671945264582961892881138913126135921173124523189668235634218734459935835883951666864828634241653151675731419667268639853336728363346298155434321352337542876448667778612367794365523945453753656656175622944258239788668613393293925534754396997644994194128711824514272979388214737392661281423955774579172675162684875284281337366812324693424139117397397767526624347715358877578465783468491149746575823143265171756783763375769193416284323326977164616284271258657156975498658221916735481784223525642964586428466624551313871798486745943431921357743731785765886862496435697416275768929726711648782635697515836123678953335762445996896338719587997112447289456847552445354147258813368669367981755623637895137599291118199418277434267993349944626481892545266765621775925663955655564452968414245587736826351619125338765172298678869578292891765957299637799492939234324142521944396721973741167385666742492316287915812154858891537815543556412974577561384572677298919996239935435375149439231236647395379745127692644582293643225552279363841149987456339392627669753839753115673497954671555627131993664539874669156295828661249256389563867255153637559799725525654834568452562997282578173239333777762921181745491345225697228755453757367498956234475863761751269546519892887738775828314821848279251773469594194328343461769333265889482873462657592649425771554424325216728982634626389324825276636214329985682617856353479924569213438445541247144446585183163725784184123894741512183493857391141255764417369787778111639523689768411398637659424413224327928424324874152219834717166656389915474878763384729798519689812393197283723975443372129272241955159764764554721834116456677899231831467757173245727433362976232388162384717377927213788544796516342398254149798886721236993412655564613616113468934216234488943446198184145227159893977921788644882278514172545828823342932834916653495631734557148754624525435262495941521423287688157937114789995783878212237511886154536753662916611348998699797342491364974578518733847413276785256564666787723181349751599179349766665633284845315685267397211372749369248862135922462461692364859951767124198946741154167871913621394533811711813591722129189469677361825777267662162384545579948549191258329857444297586882234724796688531429487226258132571692897473723746487394981722342794892578664682688179287163694784295273313353612755216778641379931478631233144751571382749639822197399249271159389643533579918194858197359351532715297168824533717152648785457928476173638838215784424767218162184513955355781864262965648299447827825289933524261517415733819992353693639439679581816614923567931223485977314521362464532665645268388182427559764685836258468587147117882942595725393226175976659323422627294288242179128654873561639454529989332279164647215585698263627959263247492431223597328158192464727283491121599794576811364532638843348449495292642691754556752194274948658293251167623291636165219499557865766714564147744838424422362167394366471547292915679693749316688835694419634569567467691859595253697154866399281836429162643688245979779469185332416354376184146714732932366127226658667296373566562166644474226429152477896439367227226867752946339684742895458453246116167298916114996561639779197881513435375864862443988324376511755978589925398124472578736649459932774194474477733478419481922332288611179639387891519528816978847483272552836619392375648413365669659339451376627956967918327631714325977522784926851728184618129181959215585661736759352717767413415889853272511137741967295685121828941685756147261575123974921946125215242924547142413534773397688696671394114442214734219966337346211343652567183784681591784833354721632148961165849416672191292964941264469446399939727517469883843482725237639357259751663874488142417729831748578989994282926453429193627367789627688113791621868281945582117138685914362915242282263475661348972125384888228772244718537688986154387429136747122557233281553559628864637628616922535343249177199577958585269236458624211416948193594977811177292483562598447428276465635793455932441463521668236923284691261881567668647972557752523422327464886884737664253463379961985669197961872186644924992834535669748552738916693526152537397872468917342941763688938526421689635999885175993914418899133215692717911495556632978812947154675646746494767618715487238666252791986727291571299839339788587184472352238919444229285141377578556993971666976383888335712953175189195235114194735464275439785773773274272494634441732955531511852223154129267648283897365587781276529849264356289289138479532678663797713115932527136383347569484535642561485643653921373159392948344581127163431574845943347863421158777295159717548442694848468473293966891958627859229696966267247159212595663231982395981945647433269298466466532644552751581496151387375845995281423771221155693243273279646729896761424929268766653689852276367559715855562973274363353312518433835279798298161193477463627532391684694729895667682673246797173861557393484763381498738497857472456226635868156165374265264884372794316224221873838428765691853711413942429871753665823921891814341552812574766944565154953291925681618786359514815311451672146556241559173758514113472283436133887986621142973736132356943199842916132913587691738964765424632367774555513495959371845258535891623682995972797255289367283354839465997475793588962517823388674291515799782939193328845939635496233282265665543724944943121159178671522298116462255533481679179293771948545776425974856586159113547185229863357942297999813567186224456356536946139957319831267652712915891838368764358432297725936769787914637157222972949125824366473428113774199739775791675398854488461163361732276533695666947784775416834738711845591642647999357639579881676572491453224178822922442127419365143565316474616143327589249314859548598183971258364256321213794382132757116487689922253386853626931994515452269938981954961881971766187211413735248572898598483913717275944159666154746847142894143954445513124753381897555517818257693137882353412626638414957258154928187146457784937413135875843791596117189154419627348216329935333714477656983516595723236581361584511187127726774365282959876657892658184895696362435531628565231335519821458736527879829745261953361864926468713739778225951945137363556465715989389858174836291354564494765469471989338456986941479371686784946937918511188621593624883642846164643967464117452546249477339182218314417371613579124183463752459775325914892557918329546945156829993759267597611946972442118873926378172321954236867283254245487946622623457376575545493752487696888895462477685195599733842151824924438771966132235133373932986112852536997615528317538548149323973671659963328589955196475127371588243711879331639838875985851513875227894477323515126754599918623265762847581494539369733697311632395318796433529491336578348658667144228383655237634334932168591645187929193276567179148976974235354177755982724582638625577114935279749735264997851927124681149295293461376595549641767219171814288677786215542174113827697692726125996462887774533636756292225137454198381951458149819712197836646129128418143429589881876837266911284119946649768226872458479968114371845999977696217459248463585252777581373279635539444777679766915572162335831463881894732899668454328553137474369786164794864128998813936226994825763417176667387325777358176864153197243429669823557585263944792357557335397576682492526919763614944447253671698938485245556716341594981299194693879449952665513922264744123469963328783495429669969878443666617836677953834888593794397554576428788185282847644419837565475484678348294265326822187749649551695314237849412896522111476736688349355383317275718116543315176135946858797272333741155622696534873922977784723221137658342371168587658817952387489237742597346999839179261983533323789477397948954976697663341812453746642356195919378152331821148772592178414393627276533644912771127421251349744486162594646391921339854386112185176926749185568669593765654588277717969694631615133557364395922865638425364147292492718584278698372484293773333877648566183231732741131619114543352796199531628464478754419256713629445663257163388431252173543741432411164179331355416769432713952973379649638958748481193973948526518769343699431872433346997311189924154328332369124479681278572775592634639437479824585133223491364936796432424177676542974711272369541736327772695211931917485436825558422892762972285767555686248472484822724312594223984351129451475745314283974256666225468143644757371798151278275346562436894596436245262655879479925513622888939674912727146346766581634235462926675497582297654152515216535548997818153578838958345883758376591667269615327228168595597563641389422391164197937154849185379837716585416453282745848851668787646864974297773486918216763719325751335857495642547559764823221999114616662246223299316994281294975233855526752783119248765186435549281974244249573632291382574565933888464548251176815446185464271846858114361398531292415726437525114896515252946584659425659495477214756711528576929675645378397489192238491286481571872398662574274586264433673526537767316218893456446566148845877223968819285733898299698733362879958742181362883546899389652546543224931258648476332662473947491414641568564334343363826939963792648642722796886499722541775796563679177816329922386332629712542782647764449717377558539894129494661354748553236767477612646835322451744553233819726825773277492868343597589736931633689767947131427911519688982918331129684719696154637153879313893971324299842672356776776614531499322237469825354939981554452745122541773177164415347772389174849518363229755627969895786368647515368218119861147587975714522519861772338936991431185492295615544263978365373184634194539793312667343728225882597485243164124312963213834332683615356246613749593851751974761331337566739139521311795819352683245429497381494662525384253598447994291997428378256377543383482116746237585353933639942615642263779331469467177576266779651242788344874438911261112186856832971695827677666277154399323391344343798896574344699665572681376259616412975198834493214853392937559573743982489558822694434498599914326979613828756185158174847824713652226176846189394633923944516765333146921951692654266354285676749129547463314715791768392434716443921177551181395735173324447627539781527978922212762986228959536536912258486612942567347165939762482791877669466616299878454126645165618587642625412296939113156913493448828815292178114948959625535873791699339896792715499736938432633552456675498764687372722499695432481595486811455549842445693829687447782797961962948342811749696969999761998462634283826791487891695781683423422436684998943415741539385523782116529555774463546848477562987181227195163277185487282929387458339114524274984311451175915557619524697677297187762629119524279117975385224629156712598936525566386876861497634564556314756677773367931487888851168622878538423281467686114288223157564821843495711232493496473324995892217473467664575487599876594176126963466482328489931916231161263579658253812142961584551734566651166146189971554538346222171243322468828155785998514664912659677133872833112657698357786811393612285444533422993591242281561574235463873166961855646859393551624672137898229921962821591567917695835653577281541239944199737598785382483781983751115799529743573741967665973435378375665648767132728962388385158587448278193264732965615222212472715281884267861466237979381289755633227485671992983553697697545677641765682631419924376185368559251986155183869165718943875875676132578143247118419155342527942733992749774418419676522641268417775466513857294632852489375326454465368975282172913695268887549517213467728144571399792951552287742394832323316262351779667387478322443713284573938742399127584383479851337292118634871961276635998236429964141116624855697625849231165315333917152566137414147597912344383828574285664569636558728433434274544376758216327567264822373854787775821269311727151588143397812553566591743977624246791268244381655965341424933916973554261282652126164895163244744217162776369471961621614787541919517981718764363338128545976158454956161348249562387223194469395927879793518755527182218926979428381423634486816918187179517149236176639372131228149691248954498523676892148522978331576921342591476752779656699644877112912722561793782473781371596595841931734528753434127357361666475333324848899984228185184687224281654751922984134826131334949115451371648178886816354727964919493985417235146999765695315842789227458418137222246863679586563289559673729429467477942764961255168479886236211865818499291155328352893559587728565512423976416165763324565557494775447546515375785417986153577692168711468854547857719991275883976886213766943761469932749119778438873435122283542643863411377614987341159371113447114733269828544147668787773516422138353819666429191365218519669816261836299643136634316817547142571748498647798547356989987821656718763591983334325961354649832622183288998137838671836669716365298921977465917486983437979527777471989736815146123774784776654689183359179546686613116341162693593488327623554938917334994199469285765928168556981667853846825944564567687883272851786651816636543382122353668833177529295529387648945683554261976147319638459871431824334142333346363728141227533825873675487377198834717872358793281834912194624838632557155712674722573475352336916786324826656985354315227282672977861441147124262324729248516551488411565611873987552382673389968891552811775471697495763789552145195849961341988196841292887317782574215868534919534699881762377999288142865635127739392969956623463597793197339148225463866739439674143769439132284141575463238621986853274634151354666814984752238656391821427125392967455339893353723557384636272874137342268671645692464991526268697839624639436626285257942278661496881834937751484236242534481679771592985863742348588673291956711846891974124423394599662855785449713574587482961192986737434475799141544189668395589194321128961915452533336917784963271616829814374897357378124295436158873792418497112598269487376485174921528452484421846581588851178849283484837318769765466382236287414771844532115436614879391644682475857234969359543449158658872387852133737852645861799797289726699269152475983594291148247433344446365951532972867864184949134598775716262555749361727332899733638453381698887945787598772214993845453789594433327149469214454389717671439196937278512874799815251481642238774512564423213326958921691421795127261966198631294467994777593342544324237728772625244947872427489484779273496455767597726863548835775395376225713584456297144988271474269793422294189626663281986568154762991491184154963859899655774436564767189857249681724136178898499832718734772233818444688378482756358368915748191284449386991677657417787774911943483287739868226152835688724937231238524298556993475778435477612338478268984239671681585161922443739747884188773354223711716421556157168973857114411456287977983259632456193592833224987794823984213364479835915822333529478318194373827582389994791999287657247728196321117919452345238727434172561254691494814918363811453518751181525481737871529641135612664844574691634616346755294443676374718234495645882859465889166598379454999597987372226712281588413445869384676182511198872984265281591945229837682135635671149156788764168583691376741826978548383651497911661834114715143659665679483251881882838266169489262331761626644575119146964631492414159215361598981772724847551371173597483344767141814699145365415333178516862987365194841737916345152864365811219138267348835277643185664385937912183149478174923472324771492293737555282122849673198797357326554423174562942589535839885239726596819124614261997965862664975811628339123167929951236815832249784332243893795677652891461295278471844383655778274171645345136686216693262524551836691118353993148625951554929635691655563455637737132253921485766674836437987786447931796151491769456125496143147662448648328449174879991442915623369764247883787183597784958426529634561152263338446441482224251666969777371157329661858841593899571812115237557792895559257316517687298779392124952873516643362628891983699588653211571479675576336543391329591651887373482615924458791847894473319469391347957874426394343692148218399265233632919651178823736841472997631236765597869659325188938231993814434775211641535242159874543532839326392367813388396139684252826458645717118841234542833244225759637924232645712668668987284232254173985741926735734213487285634853852393918359639539862428316811485549941771263553474597379674228429321627576945837796756895367413941726993382191569999359688988611481748426298339618591516982963136261114559936612943917272714514734249287577723733525561194779626836569461211561275618359551492969699265973949278335221316395652327563713825411197422542737621148899222534763471618458174951138244943987262588139768674545915285789857552177951526255264792255347398329342853121388193719795829833627637224192749983366354686994348246753147666215314329856928438661214499421869867833579826169667317577623851375285542487471339557352171738684997493132714779239972216347819841544877212852884852639663538897859754496781998922584295793231972955597639645642776846824434428986715261819827492677181236695335946251448442956868891866826356121942414833186238274636972297838573555544744547889846745174473279465197517376351623613433963636252249282526555519133725356156688778228618698351668355254553791772565367353535389195626329941429379857982557424326921479952611685577733554187696559137212417627597543994446442559723228138885179792475675162583798787246778667422684155214941777489793558152999827596335158518764629724672142456665775663459148464358644696314558892453897858926755641816122555459934279265836933127569446492286425517979114583935151385381592695994388282718876728861653643544968984243213716917724122312323414393222514269444641285763671265921387923653168649429692878382724229685631437513772566564382916786296171345537981837952897362758417162146962585327977374517768736516714796334273941192472615882775684756285369652551716267176768439219923432374351667671225269535163244363235243555459527832827889136363181289778971532421459273718135167452625786311392436984615897966222384877413418882818944459762256737427987958112881968153971642737898152193496476916147452996913625952297915359664886942662942651942765336823539383879522443431376634164613218669841618251235523217469988287493113679318935482942743249679123937884961284337717419619824567592564142919632736758762242423965987476668425614616636448314837953411566612873897844883162854955442213562531521487245946243752549718227597474521845229798843165361917271622864299425558755718236933867234356162868669994269743761498957828313735968466446289497996685175696816549258554675121281469947768243169595429299982641575799933981456643854199414391495374489551635566617445934868924644938431694133546891419442715272135242574394975725637121787849994886986654185492147347895367387432934747135225322335335452766322372883277758788868994444899436842516381593317797322167384312143246922447919852338746185985183598839777761583794755826569989755824897333556842158887933532763378371855853437251488566185658459876377399732183971197341369258988412561162122725568523495147678357335231437848988235383391554167742125926111193269449141293897794339188496946277635729177296968646316185589148165733929371696449912954235878781632337228244261457766787565145731972732273196868125628383541\n",
        "output": "9905681\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc164/tasks/abc164_d"
    },
    {
        "id": 652,
        "task_id": 2242,
        "test_case_id": 5,
        "question": "Given is a string S consisting of digits from 1 through 9.\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\n-----Constraints-----\n - 1 ≤ |S| ≤ 200000\n - S is a string consisting of digits from 1 through 9.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\n\n-----Output-----\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\n-----Sample Input-----\n1817181712114\n\n-----Sample Output-----\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.",
        "solutions": "[\"s=input()[::-1]\\nalist=[0]*2019\\nnum1=0\\nnum2=1/10\\nlens=len(s)\\nfor i in range(lens):\\n  num2=int(((num2)*10)%2019)\\n  num1=(num1+int(s[i])*(num2))%2019\\n  alist[num1]+=1\\nalist[0]+=1\\nans=0\\nfor i in range(2019):\\n  ans+=alist[i]*(alist[i]-1)//2\\nprint(ans)\", \"ans=0\\nS=input()\\na=len(S)\\nk=0\\nc=dict()\\nmod=2019\\ns=1\\nc[0]=1\\nfor i in range(a):\\n  k+=(s*int(S[a-i-1]))\\n  k%=mod\\n  s*=10\\n  s%=mod\\n  if k in c:\\n    c[k]+=1\\n  else:\\n    c[k]=1\\nfor i in c:\\n  ans+=c[i]*(c[i]-1)//2\\nprint(ans)\", \"S = input()\\nN = len(S)\\nA = [int(S[i]) for i in range(N)]\\nA = A[::-1]\\n\\nMOD = 2019\\n\\np10 = [1] * N\\nfor i in range(1, N):\\n\\tp10[i] = (p10[i - 1] * 10) % MOD\\n\\nfor i in range(N):\\n\\tA[i] = (A[i] * p10[i]) % MOD\\n\\ncumsum = [A[0]] * N\\nfor i in range(1, N):\\n\\tcumsum[i] = (cumsum[i - 1] + A[i]) % MOD\\n\\ncnt = [0] * MOD\\ncnt[0] = 1\\nfor i in range(N):\\n\\tcnt[cumsum[i]] += 1\\n\\nans = 0\\nfor i in range(MOD):\\n\\tans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\\n\", \"S = input()\\nN = len(S)\\nq = [0]\\ncount = [0 for i in range(2019)]\\nans = 0\\ncount[0] = 1\\nm10 = 1\\n\\nfor i in range(1,N+1):\\n  a = int(S[-i])\\n  #print(a, a*(10**(N-i-1)), q)\\n  q.append((a*m10+q[i-1])%2019)\\n  m10 *= 10\\n  m10 %= 2019\\n  count[q[-1]] += 1\\n\\n#print(q)\\n\\nfor i in range(2019):\\n  c = count[i]\\n  ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"import sys;      from decimal import Decimal\\nimport math;     from itertools import combinations, product\\nimport bisect;   from collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)\\n\\nimport numpy as np\\n\\ndef Main():\\n    s = read_str()\\n    dp = np.zeros(2019, dtype=np.int64)\\n    dp[0] = 1\\n\\n    cur = 0\\n    digit = 1\\n\\n    for i in reversed(s):\\n        cur = (cur + int(i) * digit) % 2019\\n        dp[cur] += 1\\n        digit = digit * 10 % 2019\\n    \\n    print(np.sum([x * (x - 1) // 2 for x in dp]))\\n\\nif __name__ ==  '__main__':\\n    Main()\", \"import copy\\n\\ns = list(input())\\n\\ns.reverse()\\nn = len(s)\\nMOD = 2019\\nm = [0] * n\\nmsum = [0] * (n+1)\\ncnt = [0] * (MOD)\\ncnt[0] = 1\\nt = 1\\nfor i in range(n):\\n    m[i] = int(s[i]) * t % MOD\\n    msum[i+1] = (msum[i] + m[i]) % MOD\\n    cnt[msum[i+1]] += 1\\n    t = t * 10 % MOD\\n\\nans = 0\\nfor i in range(MOD):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nl[0] = 1\\n\\ntmp = 0\\nz = 1\\n\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tz = z*10%2019\\n\\tl[tmp%2019] += 1\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\n\\nprint(ans)\", \"\\ndef solve():\\n    s=input().split()[0]\\n    cnt=[0]*2020\\n    cnt[0]=1\\n    m=0\\n    t=1\\n    for d in map(int,s[-1::-1]) :\\n        m=(m+d*t)%2019\\n        t=(t*10)%2019\\n        cnt[m]+=1\\n    return sum([ k*(k-1)//2 for k in cnt])\\n\\nprint((solve()))\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import Counter\\ndef main():\\n    s = input()\\n    n = len(s)\\n\\n    amari = [0] * n\\n    ketaamari = 1\\n    t = 0\\n    for i1 in range(n):\\n        t = (t + ketaamari * int(s[-i1 -1])) % 2019\\n        amari[-i1-1] = t\\n        ketaamari = (ketaamari * 10) % 2019\\n    amari.append(0)\\n    ac = Counter(amari)\\n    r = 0\\n    for v in ac.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\n\\nS=input()\\n\\nrlist=[0]\\nfor i in range(len(S)):\\n  rlist.append((rlist[-1]+int(S[-i-1])*pow(10,i,2019))%2019)\\n  \\nc = Counter(rlist)\\nc[0] -= 1\\n\\ndef nC2(n):\\n  return n*(n-1)//2\\n  \\nans = c[0]\\nfor k in c.keys():\\n  if c[k] >= 2:\\n    ans += nC2(c[k])\\n    \\nprint(ans)\", \"from collections import Counter\\n\\nS = input()\\n# S = \\\"12345\\\"*40000\\nN = len(S)\\n\\nl = [0]*(N+1)\\nfor i in range(N-1, -1, -1):\\n    l[i] = (l[i+1] + pow(10, N-i, 2019) * int(S[i])) % 2019\\n    # if i%10000 == 0:\\n    #     print(i)\\n\\n# print(list(Counter(l).values()))\\n\\nr = sum(m*(m-1)//2 for m in Counter(l).values())\\nprint(r)\", \"s = input()\\nt = s[::-1]\\nn = len(s)\\nresid = [0] * 2019\\nresid[0] = 1\\ncsum = 0\\npowoften = 1\\nfor i in range(n):\\n    csum = (csum + int(t[i]) * powoften) % 2019\\n    powoften = (10 * powoften) % 2019\\n    resid[csum] += 1\\nans = 0\\nfor i in range(2019):\\n    ans += resid[i] * (resid[i] - 1) // 2\\nprint(ans)\", \"s = input()\\nmod = 2019\\ndic = [0] * mod\\ndic[0] += 1\\n\\ntmp = 0\\nd = 1\\nfor i in reversed(range(len(s))):\\n    tmp += int(s[i]) * d\\n    tmp %= mod\\n    d *= 10\\n    d %= mod\\n    dic[tmp] += 1\\n\\nans = [i * (i-1) / 2 for i in dic]\\nprint(int(sum(ans)))\", \"s = input()\\n\\nl = len(s)\\nnum = 0\\ncount = 0\\ndic = {0: 1}\\nfor i in range(l - 1, -1, -1):\\n  num = (num + int(s[i]) * pow(10, l - i - 1, 2019)) % 2019\\n  #print(num)\\n  #print(r)\\n  if num not in dic:\\n    dic[num] = 1\\n  else:\\n    dic[num] += 1\\nfor ele in list(dic.values()):\\n  count += ele * (ele - 1) // 2\\nprint(count)\\n\", \"from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf\\nfrom itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement\\nfrom collections import deque,defaultdict,Counter\\nfrom bisect import bisect_left,bisect_right\\nfrom operator import itemgetter\\nfrom heapq import heapify,heappop,heappush\\nfrom queue import Queue,LifoQueue,PriorityQueue\\nfrom copy import deepcopy\\nfrom time import time\\nfrom functools import reduce, lru_cache\\nimport string\\nimport sys\\nsys.setrecursionlimit(10 ** 7)\\ndef input() : return sys.stdin.readline().strip()\\ndef INT()   : return int(input())\\ndef MAP()   : return map(int,input().split())\\ndef MAP1()  : return map(lambda x:int(x)-1,input().split())\\ndef LIST()  : return list(MAP())\\ndef LIST1() : return list(MAP1())\\n\\ns = input()\\n\\n@lru_cache(None)\\ndef F(s, k):\\n    # s\\u306e\\u5de6\\u304b\\u3089k\\u6587\\u5b57\\u76ee\\u4ee5\\u964d\\u3092\\u6574\\u6570\\u3068\\u898b\\u306a\\u3057\\u305f\\u3068\\u304d\\u3001\\n    # 2019\\u3067\\u5272\\u3063\\u305f\\u4f59\\u308a\\u3092\\u8fd4\\u3059\\n    if k == len(s)-1:\\n        return int(s[k])\\n    ret = F(s, k+1) + int(s[k])*pow(10, len(s)-1-k, 2019)\\n    ret %= 2019\\n    return ret\\n\\na = [0]*2020\\nfor i in range(len(s)):\\n    a[F(s, i)] += 1\\n\\nans = a[0]\\nfor i in range(2020):\\n    ans += a[i] * (a[i]-1) // 2\\n\\nprint(ans)\", \"S=input()\\nMOD=2019\\ndp=[0]*MOD\\ndp[0]=1\\nr=0\\nt=1\\nfor c in reversed(S):\\n    r+=int(c)*t\\n    r%=MOD\\n    t*=10\\n    t%=MOD\\n    dp[r]+=1\\nprint(sum(i*(i-1)//2 for i in dp))\", \"S = input()\\ndp = [0]*(len(S)+1)\\ncur = int(S[len(S)-1])\\nmod_10 = 1\\ncount_num = [0]*2019\\ncount_num[0] += 1\\nfor i in range(len(S)):\\n    dp[len(S)-i-1] = cur\\n    count_num[cur] += 1\\n    mod_10 = (mod_10*10)%2019\\n    if i <= len(S)-2:\\n        cur = (cur+int(S[len(S)-i-2])*(mod_10))%2019\\nans = 0\\nfor i in range(2019):\\n    ans += (count_num[i]*(count_num[i]-1))//2\\nprint(ans)\\n\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in S[::-1]:\\n  s=(s+int(i)*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    # print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum + x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    # \\u5834\\u5408\\u5206\\u3051\\u306e\\u6570\\u3092\\u8db3\\u3057\\u5408\\u308f\\u305b\\u308b\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num - 1)) // 2  # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import collections\\n\\ns=list(input())\\na=[0]\\n\\ns.reverse()\\n\\nmod=2019\\n\\nmod10=1\\n\\nfor i in range(len(s)):\\n  x=int(s[i])\\n  y=a[-1]\\n  ans=(x*mod10+y)%mod\\n  a.append(ans)\\n  mod10=(mod10*10)%mod\\n  \\nans1=0\\n\\nc = collections.Counter(a)\\nd=list(c.values())\\n\\nfor r in d:\\n  if r>=2:\\n    ans1+=(r*(r-1))//2\\n    \\nprint(ans1)\", \"s = input()\\ns = s[::-1]\\n\\nL = [0]\\ncnt = 1\\nfor i in range(len(s)):\\n    L.append((L[-1]+(int(s[i])*cnt))%2019)\\n    cnt *= 10\\n    cnt %= 2019\\n\\nD = dict()\\nfor j in L:\\n    if j in D:\\n        D[j] += 1\\n    else:\\n        D[j] = 1\\nans = 0\\nfor k in D.values():\\n    ans += k * (k-1) //2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\ncnts=[0]*2019\\ncnts[0]=1\\nnum=0\\nfor i in range(n):\\n  num+=int(s[i])*pow(10,i,2019)\\n  num%=2019\\n  cnts[num]+=1\\n\\nans=0\\nfor cnt in cnts:\\n  ans+=cnt*(cnt-1)//2\\n  \\nprint(ans)\\n\", \"s = list(input())\\n\\nMOD = 2019\\n\\ntemp = 0\\nd = 1\\n\\nm = [0] * MOD\\nm[0] = 1\\n\\nfor x in reversed(s):\\n    temp += int(x) * d\\n    temp %= MOD\\n    m[temp] += 1\\n    d = (d * 10) % MOD\\n\\nans = 0\\nfor x in m:\\n    ans += x * (x-1) // 2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\np=2019\\nS=[0 for i in range(n+1)]\\nans=[0]*p\\n\\nx10=1\\nfor j, i in enumerate(s):\\n  S[j+1]=(S[j]+(x10*int(i)))%p\\n  x10*=10\\n  x10%=p\\n  ans[S[j+1]]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\n\\nmod = 2019\\ncnt = [0] * 2019\\ncur = 0  # \\u73fe\\u5728\\u691c\\u8a0e\\u4e2d\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\ncnt[cur] = 1\\nd = 1   # \\u6841\\n\\nfor s in S[::-1]:\\n    cur += int(s) * d\\n    cur %= mod\\n    cnt[cur] += 1\\n    d *= 10\\n    d %= mod\\n\\nans = 0\\nfor c in cnt:\\n    ans += c * (c-1) // 2\\n\\nprint(ans)\", \"#!/usr/bin/env python3\\ndef main():\\n    S = input()[::-1]\\n\\n    counts = [0] * 2019\\n    counts[0] = 1\\n    res, digit = 0, 1\\n    for i in S:\\n        res += int(i) * digit\\n        res %= 2019\\n        digit *= 10\\n        digit %= 2019\\n        counts[res] += 1\\n\\n    ans = 0\\n    for i in counts:\\n        ans += i * (i - 1) // 2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nn = len(s)\\nmod = 2019\\n\\nt = [0]*n\\ndp = [0]*2020\\nt[0] = int(s[-1])\\ndp[t[0]] += 1\\nfor i in range(n-1):\\n    t[i+1] = t[i] + int(s[-2-i])*pow(10, i+1, mod)\\n    t[i+1] %= mod\\n    dp[t[i+1]] += 1\\nans = 0\\nfor D in dp[1:]:\\n    ans += D*(D-1)//2\\nprint((ans+(dp[0]+1)*(dp[0])//2))\\n\\n\\n\", \"#!/usr/bin/env python3\\nimport sys\\nimport numpy as np\\n\\ninput = sys.stdin.readline\\n\\n\\ndef ST():\\n    return input().rstrip()\\n\\n\\ndef I():\\n    return int(input())\\n\\n\\ndef MI():\\n    return list(map(int, input().split()))\\n\\n\\ndef LI():\\n    return list(MI())\\n\\n\\nS = ST()\\n\\ncnt = np.zeros(2019)\\ncnt[0] = 1\\nres = 0\\ntmp = 1\\nfor s in S[::-1]:\\n    res += int(s) * tmp\\n    res %= 2019\\n    cnt[res] += 1\\n    tmp *= 10\\n    tmp %= 2019\\n\\nans = 0\\nfor c in cnt[cnt >= 2]:\\n    ans += c * (c - 1) // 2\\n\\nprint((int(ans)))\\n\", \"def main():\\n    import collections\\n\\n    S = input()\\n\\n    mod_list = [0]\\n\\n    for i in range(len(S)):\\n        index = len(S) - i - 1\\n        num = int(S[index])\\n\\n        mod_list.append((mod_list[-1] + num * pow(10, i, 2019)) % 2019)\\n\\n    CTR_mod_list = collections.Counter(mod_list).most_common()\\n    cnt = 0\\n\\n    for i in range(len(CTR_mod_list)):\\n        n = CTR_mod_list[i][1]\\n\\n        if (n == 1):\\n            break\\n\\n        cnt += n * (n - 1) // 2\\n\\n    print(cnt)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"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\\n# \\u7d2f\\u7a4d\\u548c\\u306e\\u66f8\\u304d\\u65b9\\u304c\\u3088\\u304f\\u306a\\u3044\\u3084\\u3064\\ndef main():\\n  s=S()\\n  n=len(s)\\n\\n  l=[]\\n  mul=1\\n  for x in s[::-1]:\\n    l.append(mul*int(x)%2019)\\n    mul*=10\\n    mul%=2019\\n\\n  for i in range(n-1):\\n    l[i+1]+=l[i]\\n    l[i+1]%=2019\\n\\n  sl=summarizeList(l)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    if x==0:\\n      ans+=c\\n    if c>1:\\n      ans+=c*(c-1)//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Mon Sep  7 00:38:11 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n\\uff1cD - Multiple of 2019>\\n\\u3010\\u65b9\\u91dd\\u3011\\na = b(mod2019) => a - b \\u306f\\u30002019\\u306e\\u500d\\u6570\\n\\u4f59\\u308a\\u304c\\u7b49\\u3057\\u3044\\u30b0\\u30eb\\u30fc\\u30d7\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u306e\\u7dcf\\u6570\\u304c\\u89e3\\u306b\\u306a\\u308b\\u3002\\n\\u65e2\\u306b2019\\u306e\\u500d\\u6570\\u3067\\u3042\\u308b\\u3082\\u306e\\u306f\\u5358\\u4f53\\u3067\\u6210\\u7acb\\u3059\\u308b\\u305f\\u3081\\u3001[0]\\u306e\\u30ab\\u30a6\\u30f3\\u30c8\\u3092\\u4e00\\u3064\\u3042\\u3052\\u3066\\u304a\\u304f\\n\\n\\n\\uff1c\\u7d2f\\u7a4d\\u548c\\uff1e\\n\\u3010\\u8a08\\u7b97\\u91cf\\u524a\\u6e1b\\u3011\\n\\u5927\\u304d\\u306a\\u6570\\u3092\\u4f7f\\u308f\\u306a\\u3044\\u3000\\u21d2\\u3000mod \\u3092\\u4f7f\\u3046\\ntmp += 7 * 100000000  => 7 * ( 2019*N + \\u03b1) => 7 * \\u03b1\\u3000\\u3068\\u540c\\u3058\\n\\u3000\\u3000\\u21d2\\u3000\\u7d2f\\u4e57(10**N) \\u306b  mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n\\n100000000 + \\u03b3 => (2019*N + \\u03b2) + \\u03b3 => \\u03b2 + \\u03b3 \\u3068\\u540c\\u3058\\n\\u3000\\u21d2\\u3000\\u7d2f\\u7a4d\\u548c\\u3000\\u306b\\u3000mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n \\n for\\u6587\\u3067\\uff11\\u6587\\u5b57\\u305a\\u3064\\u8db3\\u3057\\u7b97\\u3057\\u3066\\u3044\\u304f\\u3053\\u3068\\u3067\\u5b9f\\u88c5\\u53ef\\u80fd\\n \\n reversed() : \\u9006\\u9806\\u306b\\u4e26\\u3079\\u66ff\\u3048\\n reversed(input()) : \\u5165\\u529b\\u3092\\u9006\\u9806\\u306b\\u53d6\\u308a\\u51fa\\u3059\\n \\n\\\"\\\"\\\"\\nS = input()\\n\\nMOD = 2019 \\n\\ncounter = [0] * 2019\\ncounter[0] = 1\\nt = 1\\ntmp = 0\\nfor i in reversed(S):\\n    tmp += int(i)*t\\n    tmp %= MOD #\\u7d2f\\u7a4d\\u548c\\u3092\\u52b9\\u7387\\u5316\\n    t *= 10\\n    t %= MOD   #\\u7d2f\\u4e57\\u3092\\u52b9\\u7387\\u5316 \\n    #print(tmp)\\n    counter[tmp] += 1\\n\\nans = sum( i*(i-1)//2 for i in counter)\\nprint(ans)\", \"s = list(input())\\n# s = list(str(10**200000))\\nn = len(s)\\nans = 0\\ns.reverse()\\n# print(s)\\nx = 1\\ntot = 0\\ncount = [0]*2019\\nfor i in range(n):\\n    count[tot]+=1\\n    tot += int(s[i])*x\\n    # print(tot)\\n    tot %= 2019\\n    ans += count[tot]\\n    x = x*10%2019\\nprint(ans)\", \"S = input()[::-1]\\nans = 0\\nmods = [0] * 2019\\nmods[0] = 1\\ncurrent = 0\\nx = 1\\nfor s in S:\\n  current = (current + x * int(s)) % 2019\\n  ans += mods[current % 2019]\\n  mods[current % 2019] += 1\\n  x = x * 10 % 2019\\nprint(ans)\", \"s = list(map(int,input()))\\ns.reverse()\\nt = len(s)\\nmod = 2019\\n\\narr = [0] * (t+1)\\narr[-2] = s[0]\\nfor i in range(1,t):\\n    arr[t-i-1] = (arr[t-i] + s[i]*pow(10,i,mod)) % mod\\n\\nfrom collections import Counter\\narr = Counter(arr)\\n\\nans = 0\\nfor i in arr:\\n    ans += (arr[i] - 1) * arr[i] // 2\\n\\nprint(ans)\", \"import sys\\nimport heapq\\nimport math\\nimport fractions\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\nfrom collections import deque\\nfrom operator import itemgetter\\ndef input(): return sys.stdin.readline().strip()\\ndef mp(): return map(int,input().split())\\ndef lmp(): return list(map(int,input().split()))\\n\\ns=input()[::-1]\\nn=len(s)\\na=[0]*2019\\na[0]=1\\nc,d=0,1\\nfor i in s:\\n    c+=int(i)*d\\n    c%=2019\\n    d*=10\\n    d%=2019\\n    a[c]+=1\\nans=0\\nfor i in a:\\n    ans+=i*(i-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()[::-1]\\nMOD = 2019\\nX = [0]\\nfor i,s in enumerate(S):\\n    X.append((X[-1]+int(s)*pow(10,i,MOD))%MOD)\\nC = Counter(X)\\nprint(sum([v*(v-1)//2 for v in C.values()]))\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in range(1,n+1):\\n  s=(s+int(S[-i])*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"n = input()\\np = 2019\\nt = 1\\ny = 0\\nc = p*[0]\\n\\nfor x in map(int,n[::-1]):\\n  y+=t*x\\n  y%=p\\n  c[y]+=1\\n  t*=10\\n  t%=p\\n\\nprint(sum(i*(i-1)//2 for i in c)+c[0])\", \"def main():\\n    def modpow(x, n, mod):\\n        res = 1\\n        while n:\\n            if n % 2:\\n                res *= x % mod\\n            x *= x % mod\\n            n >>= 1\\n        return res\\n\\n    s = input()\\n    s = s[::-1]\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in range(s_len):\\n        rev_num += int(s[i]) * int(modpow(10, i, mod))\\n        rev_num %= mod\\n        d[rev_num] += 1\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S = input()\\ns_rev = S[::-1]\\n\\nr_list = [0] * 2019\\nr_list[0] = 1\\nnum, d = 0, 1\\nfor i in range(len(S)):\\n    num += d*int(s_rev[i])\\n    num %= 2019\\n    r_list[num] += 1\\n    d *= 10\\n    d %= 2019\\n\\nans = 0\\nfor i in range(2019):\\n        ans += r_list[i]*(r_list[i]-1)//2\\n\\nprint(ans)\\n\", \"s=input()\\np=2019\\nans=0\\nM=[0]*p\\nM[0]=1\\ntmp=0\\nfor i in range(len(s)):\\n    tmp+=(int(s[-i-1])*pow(10,i,p))\\n    tmp%=p\\n    ans+=M[tmp]\\n    M[tmp]+=1\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common()[::-1]:\\n#  if k > 1 and k%2 == 0:\\n#    ans += n\\n#  else:break\\n#print(ans)\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#https://mirucacule.hatenablog.com/entry/2020/04/27/090908\\n#https://drken1215.hatenablog.com/entry/2020/04/29/171300\\n\\nS=str(input())[::-1]#\\u9006\\u9806\\u3067\\u683c\\u7d0d\\nN=len(S)\\ncounter=[0]*2019\\ncounter[0]=1\\nans=0\\nnum,d=0,1\\nfor c in S:\\n    num += int(c) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counter[num]+=1\\nfor i in counter:\\n    ans += i*(i-1)//2\\nprint(ans)\", \"from collections import defaultdict\\n\\nS = input()\\n\\nd = defaultdict(int)\\n\\nd[0] += 1\\n\\nmod = 0\\nR = 1\\nfor i in range(len(S)):\\n    mod = (mod + R * int(S[len(S) - i - 1])) % 2019\\n    R = R * 10 % 2019\\n    d[mod] += 1\\nans = 0\\nfor i in list(d.values()):\\n    if i > 1:\\n        ans += i * (i - 1) / 2\\n\\nprint((int(ans)))\\n\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"S = input()\\nmod = 2019\\n\\narray = []\\nfor i in range(len(S)):\\n    x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod\\n    array.append(x)\\narray2 = [0]\\ny = 0\\nfor i in range(len(S)):\\n    y = (y+array[i])%mod\\n    array2.append(y)\\narray3 = [0] * 2019\\nans = 0\\nfor i in range(len(array2)):\\n    z = array2[i]\\n    ans += array3[z]\\n    array3[z] += 1\\nprint(ans)\\n#3*673\\n\", \"s=input()\\nn=len(s)\\nrui=[0]\\njuu=[1]\\nfor i in range(n+5):\\n  juu.append(juu[-1]*10%2019)  \\nfor i in range(n):\\n  rui.append((rui[-1]+int(s[n-1-i])*juu[i])%2019)\\nama=[0]*2019\\nfor i in range(len(rui)):\\n  ama[rui[i]]+=1\\nans=0\\ndef ui(n):\\n  return max(0,n*(n-1)//2)\\nfor i in range(2019):\\n  ans+=ui(ama[i])\\nprint(ans)  \", \"def MultipleOf2019():\\n    S = input()\\n    s = int(S)\\n    num, mod, ans = len(S), 2019, 0\\n    c = [0 for _ in range(num+1)]\\n    d = [0 for _ in range(mod)]\\n    d[0] = 1\\n    s = int(S)\\n    \\n    for i in range(num):\\n        c[i+1] = (c[i]+int(S[-i-1])*pow(10, i, mod))%mod\\n        d[c[i+1]] += 1\\n\\n    for i in range(mod):\\n        ans += d[i]*(d[i]-1)//2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    MultipleOf2019()\\n    \\n\\n__starting_point()\", \"S = input()\\nN = len(S)\\n \\ncounter = [0] * 2019\\ncounter[0] = 1\\nT = 0\\nR = 1\\nfor i in range(N):\\n    T = (T + R * int(S[N - i - 1])) % 2019\\n    R = 10 * R % 2019\\n    counter[T] += 1\\n \\nans = 0\\nfor i in range(2019):\\n    m = counter[i]\\n    ans += m * (m - 1) // 2\\n \\nprint(ans)\", \"def inN():\\n    return int(input())\\ndef inL():\\n    return list(map(int,input().split()))\\ndef inNL(n):\\n    return [list(map(int,input().split())) for i in range(n)]\\n\\ns = input()\\nn = int(s)\\nl = len(s)\\ncnt = 0\\nmod = [0]*2019\\nm = 0\\nfor i in range(l):\\n    m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019\\n    mod[m] += 1\\n\\ncnt += mod[0]\\n\\nfor i in range(2019):\\n    if mod[i] > 1:\\n        cnt += (mod[i]*(mod[i]-1))/2\\n        #print(i)\\nprint((int(cnt)))\\n\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nA = [0]\\nfor i, s in enumerate(S[::-1]):\\n    A.append((A[-1] + s * pow(10, i, 2019)) % 2019)\\nprint((sum([v * (v - 1) // 2 for v in list(Counter(A).values())])))\\n\", \"S = reversed(input())\\nresiduelist = [0]\\npower = 1\\nresidue = 0\\nfor i in S:\\n    digit = int(i)\\n    residue = (residue+power*digit)%2019\\n    residuelist.append(residue)\\n    power = (power*10)%2019\\nfrom collections import Counter\\nval = Counter(residuelist).values()\\nans = 0\\nfor j in val:\\n    ans += j*(j-1)//2\\nprint(ans)\", \"# coding: utf-8\\n# Your code here!\\n\\nS=list(input())\\nS=list(map(int,S))[::-1]\\n\\n\\nmod=[0]*2019\\nmod[0]+=1\\n\\nans=0\\ntemp=0\\np=1\\nfor i in range(len(S)):\\n    temp+=S[i]*p\\n    p=p*10%2019\\n    temp%=2019\\n    ans+=mod[temp]\\n    mod[temp]+=1\\n\\nprint(ans)\\n\", \"s=input()\\n\\ns=s[::-1]\\n\\ncounts = [0] * 2019\\ncounts[0] = 1\\n\\nnum=0\\nd = 1\\n\\n\\nfor char in s:\\n    num += int(char) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counts[num] += 1\\n    \\nans = 0\\nfor cnt in counts:\\n    ans += cnt * (cnt - 1) // 2\\n\\nprint(ans) # \\u7b54\\u3048\\u306e\\u51fa\\u529b   \\n\\n\", \"from collections import Counter\\ns = input()\\n\\nls = len(s)\\nt = [0]\\nj = 1\\nfor i in range(ls):\\n    u = (int(s[ls-1-i])*j + t[-1]) % 2019\\n    t.append(u)\\n    j = (j * 10) % 2019\\nc = Counter(t)\\nk = list(c.keys())\\nans = 0\\nfor i in k:\\n    ans += c[i]*(c[i]-1)/2\\nprint(int(ans))\", \"from collections import Counter\\nimport sys\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nmod = 2019\\n\\n\\ns = readline().decode().rstrip()\\ns = s[::-1]\\nn = len(s)\\nd = [0] * (n)\\nd[0] = int(s[0]) % mod\\n\\nfor i in range(1, n):\\n    d[i] = (d[i - 1] + int(s[i]) * pow(10, i, mod)) % mod\\n\\nd = [0] + d\\n\\nc = Counter(d)\\nans = 0\\nfor v in c.values():\\n    ans += v * (v - 1) // 2\\nprint(ans)\", \"def main():\\n  n, mods = 0, [1]+[0]*2019\\n  d = 1\\n  for i in reversed(input()):\\n    n = (n+int(i)*d)%2019\\n    d = d*10%2019\\n    mods[n] += 1\\n  print(sum([i*(i-1)//2 for i in mods]))\\nmain()\", \"S=input()\\ns=int(S)\\nmod=2019\\nc=[0]*(len(S)+1)\\nd=[0]*2019\\n\\n\\nc[0]=0\\nd[0]=1\\nfor i in range(len(S)):\\n  c[i+1]=(c[i]+int(S[-i-1])*pow(10,i,mod))%mod\\n  d[c[i+1]]+=1\\n  \\nm=0\\nfor i in range(2019):\\n  m+=d[i]*(d[i]-1)//2\\n\\nprint(m)\", \"# -*- coding: utf-8 -*-\\n\\nS = input().strip()\\n#-----\\nnum = 0\\ncnt_mod = {0:1}  # type {int: int} , contents {remainder : count}\\nmod = 2019\\nbase_pow = 1\\n\\nfor i in range(len(S)):\\n    digit = int( S[len(S)-1-i] )\\n    \\n    num += (digit * base_pow) % mod\\n    num %= mod\\n    \\n    base_pow = (base_pow * 10) % mod\\n    \\n    cnt_mod.setdefault(num, 0)\\n    cnt_mod[num] += 1\\n\\n\\nans = 0\\n\\nfor r,c in list(cnt_mod.items()):\\n    # r: remainder\\n    # c: count\\n    if c >= 2:\\n        ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\n# pow(a,b,c)\\u306f\\u666e\\u901a\\u306bMOD\\u3059\\u308b\\u3088\\u308a\\u901f\\u3044\\n# \\u666e\\u901a\\u306b\\u3084\\u3063\\u305f\\u3089TLE\\u3060\\u3063\\u305f\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN = list(input())\\nM = [0]\\nS = 0\\nK = 1\\nans = 0\\n\\nfor i in range(len(N)):\\n    S += int(N[-i-1])*K\\n    S %= 2019\\n\\n    K *= 10\\n    K %= 2019\\n    M.append(S)\\n\\nP = Counter(M)\\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\\nprint(ans)\\n\", \"import sys\\nimport collections\\n\\n\\ndef resolve(in_):\\n    s = next(in_).strip()\\n    mod = 2019\\n    dp = [0] * (len(s) + 1)\\n    ch0 = ord(b'0')\\n    for i, b in enumerate(reversed(s), 1):\\n        dp[i] = (dp[i - 1] + (b - ch0) * pow(10, i, mod)) % mod\\n\\n    return sum(v * (v - 1) // 2 for v in list(collections.Counter(dp).values()))\\n\\n\\ndef main():\\n    answer = resolve(sys.stdin.buffer)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#import numpy as np\\n#import math\\n#from decimal import *\\n#from numba import njit\\nfrom collections import Counter\\n\\n#@njit\\ndef main():\\n    S = input()\\n    A = list(map(int, S))[::-1]\\n    mod = []\\n    ten = 10\\n    for i in range(len(A)):\\n        if i == 0:\\n            mod += A[i],\\n        else:\\n            mod += (mod[i-1]+ten*A[i])%2019,\\n            ten = (ten*10)%2019\\n    mod += 0,\\n\\n    C = Counter(mod)\\n    print(sum([c*(c-1)//2 for c in C.values()]))\\n\\nmain()\", \"S = input()\\n\\ncs = [0]\\nr = 1\\nfor c in S[::-1]:\\n    cs.append((cs[-1] + r*int(c)) % 2019)\\n    r *= 10\\n    r %= 2019\\n\\nfrom collections import Counter\\nctr = Counter(cs)\\nans = 0\\nfor v in ctr.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [-1] * len(S)\\nr = 0\\nd = 1\\nfor i,s in enumerate(S[::-1]):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[i] = r\\n\\nans = 0\\nc = Counter(p)\\nfor k,n in c.most_common():\\n  if n > 1:\\n    ans += n*(n-1)//2\\n  else:break\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"def main():\\n    s = input()\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    t = 1\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in reversed(s):\\n        rev_num += int(i) * t\\n        rev_num %= mod\\n        d[rev_num] += 1\\n        t *= 10\\n        t %= mod\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ns=input()\\nn=len(s)\\nans=0\\narr=[0]*(n+1)\\nif s=='0':\\n    print(1)\\n    return\\nelif n==1:\\n    print(0)\\n    return\\nfor i in reversed(range(n)):\\n    arr[i]=(arr[i+1]+int(s[i])*pow(10,n-i-1,2019))%2019\\nm=Counter(arr)\\nfor j in m.keys():\\n    ans+=m[j]*(m[j]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"s = input()\\n\\nlen_s = len(s)\\n\\ncurrent = 0\\nmod_dict = dict()\\nmod_dict[0] = 1\\nfor i in range(len_s-1,-1,-1):\\n    c = s[i]\\n    current = (current+pow(10,len_s-i-1,2019)*int(c)) % 2019\\n    if current in mod_dict:\\n        mod_dict[current] += 1\\n    else:\\n        mod_dict[current] = 1\\n\\ncount = 0\\nfor key in mod_dict:\\n    count+= (mod_dict[key]*(mod_dict[key]-1))//2\\n\\nprint(count)\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nfrom collections import deque\\nfrom collections import defaultdict\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\nMOD2 = 998244353\\nINF = float('inf')\\ninput = lambda: sys.stdin.readline().strip()\\n\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\ndef combinations_count(n, r):\\n    if n == 1:\\n        return 0\\n    else:\\n        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\ndef main():\\n    S = SI()\\n    \\n    ls = []\\n    len_S = len(S)\\n    rem = 0\\n\\n    for s in range(len_S-1,-1,-1):\\n        rem = (rem+int(S[s])* pow(10, len_S-s-1, 2019))%2019\\n        ls.append(rem)\\n    \\n    import collections\\n\\n    cls = collections.Counter(ls)\\n    clsv= list(cls.values())\\n\\n    ans = 0\\n\\n    for p in clsv:\\n        ans += combinations_count(p,2)\\n    ans += cls[0]\\n    print(ans)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ndef main():\\n    S = input()\\n    A = [0] * ((n := len(S)) + 1)\\n    A[1] = (a := int(S[-1])) % 2019\\n    for i in range(2, n + 1):\\n        a += pow(10, i - 1, 2019) * int(S[-i])\\n        A[i] = a % 2019\\n    c = Counter(A)\\n    ans = 0\\n    for v in list(c.values()):\\n        ans += v * (v - 1) // 2\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = str(input())\\nMOD = 2019\\nm = 0\\ndigit = 1\\nmods = [1] + [0] * 2018\\nfor a in s[::-1]:\\n    m = (m + digit * int(a)) % MOD\\n    mods[m] += 1\\n    digit = digit * 10 % MOD\\nans = 0\\nfor x in mods:\\n    ans += x * (x - 1) // 2\\nprint(ans)\", \"from collections import Counter\\n\\ns = input()\\nn = len(s)\\ndigits = [int(c) for c in s[::-1]]\\na = [0] * (n + 1)\\np = 2019\\n\\nfor i, digit in enumerate(digits):\\n    a[i + 1] = (digit * pow(10, i, p) + a[i]) % p\\n\\ncounter = Counter(a)\\nans = 0\\nfor count in counter.values():\\n    ans += count * (count - 1) // 2\\n\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Sun Sep  6 23:39:24 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n#from scipy.special import comb\\n\\ncounter = [0]*2019\\ncounter[0] = 1 # 0 = 0 (mod 2019)\\n\\nS = input()\\ntmp = 0\\n\\\"\\\"\\\"\\n#\\u5927\\u304d\\u3044\\u6570\\u3092\\u4e00\\u6c17\\u306b\\u639b\\u3051\\u306a\\u3044\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*10**(i-1)    #\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u65b9\\u304c\\u65e9\\u3044\\uff08\\u3051\\u3069\\u3001\\u6f38\\u5316\\u5f0f\\u7684\\u306b\\u7d2f\\u7a4d\\u548c\\u3092\\u51fa\\u305b\\uff09\\n    #print(tmp%2019)\\n    tmp %= 2019                    #\\u5927\\u304d\\u3044\\u6570\\u3092\\u5272\\u308b\\u306a\\n    counter[tmp%2019] += 1\\n\\nans = 0\\nfor i in range(2019):\\n    if counter[i] >= 2:\\n        #ans += comb(counter[i], 2, exact=True)\\n        ans += counter[i]*(counter[i]-1)//2\\nprint(ans)\\n\\\"\\\"\\\"\\nMOD = 2019\\n#reversed(s) ?\\nt = 1\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*t\\n    #print(\\\"A\\\", tmp)\\n    tmp %= MOD \\n    t *= 10\\n    #print(\\\"B\\\", tmp)\\n    t %= MOD\\n    #print(tmp)\\n    counter[tmp] += 1\\n    \\nprint((sum(i*(i-1)//2 for i in counter)))\\n\", \"S = list(map(int, list(input())))\\n\\npops = 0\\ndigi = 1\\ncnt = [0] * 2019\\ncnt[0] = 1\\n\\nwhile S:\\n    s = S.pop()\\n\\n    pops = (pops + s * digi) % 2019\\n    digi = (10 * digi) % 2019\\n\\n    cnt[pops] += 1\\n\\nans = 0\\n\\nfor i in range(2019):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\", \"S = str(input())\\nN = len(S)\\nb = [0] * 2019\\ncount = 0\\nb[0] = 1\\nt = 0\\nk = 1\\n\\nif len(S) < 4:\\n    print(0)\\nelse:\\n    t = int(S[-1])\\n    b[t] += 1\\n    for i in range(1,N):\\n        k = k * 10 % 2019\\n        t = (k * int(S[-i-1]) + t) % 2019 \\n        b[t] += 1\\n\\n    for i in b:\\n        count += i*(i-1)//2\\n\\n    print(count)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nz = 1\\ntmp = 0\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tl[tmp%2019] += 1\\n\\tz = z*10%2019\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\nans += l[0]\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nC = Counter()\\nMOD = 2019\\n\\nn = 0\\nfor i, s in enumerate(S[::-1]):\\n    s = int(s)\\n    n += pow(10, i, MOD) * s % MOD\\n    C[n % MOD] += 1\\n\\nC[0] += 1\\nans = 0\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"s=[int(x) for x in reversed(list(input()))]\\nn=len(s)\\nx=[0]*2019\\ndp = 0\\ndim = 1\\nfor si in s:\\n  dp = (dp + si*dim) % 2019\\n  x[dp] += 1\\n  dim = dim * 10 % 2019\\nans = x[0]\\nfor i in range(2019):\\n  ans += x[i]*(x[i]-1)//2\\nprint(ans)\", \"S = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    #print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum+x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num-1)) // 2   # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for i1 in range(1, lens+1):\\n        ss += (int(s[-i1]) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"s=input()[::-1]\\np=2019\\nans=[0]*p\\n\\nx10, S=1, 0\\nfor i in s:\\n  S+=x10*int(i)\\n  S%=p\\n  x10*=10\\n  x10%=p\\n  ans[S]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\nmod = 2019\\n\\nt = len(S)\\nl = [0] * (t + 1)\\nfor i in range(t-1, -1, -1):\\n    l[i] = (l[i+1] + int(S[i]) * pow(10, t-i-1, mod)) % mod\\n\\nfrom collections import Counter\\n\\ndef nC2(n):\\n    return n * (n - 1) // 2\\n\\nl = list(Counter(l).values())\\n\\nans = 0\\nfor i in l:\\n    ans += nC2(i)\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nP = [0] * (len(S)+1)\\nmod = 2019\\nd = 1\\nfor i in range(len(S), 0, -1):\\n    P[i-1] = int(S[i-1])*d + P[i]\\n    P[i-1] = P[i-1] % mod\\n    d *= 10\\n    d = d % mod\\n\\nP = Counter(P)\\nans = 0\\nfor p in P.values():\\n    ans += p*(p-1)//2\\nprint(ans)\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for se in s[::-1]:\\n        ss += (int(se) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S=input()\\nN=len(S)\\n\\nT=[0]\\nfor i in range(N):\\n    p = int(S[-1-i])\\n    T.append( (T[-1]+ pow(10,i,2019)*p)%2019 )\\n    \\nfrom collections import Counter\\nans=0\\nU=dict(Counter(T))\\nfor num in U:\\n    ans += U[num]*(U[num]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nMOD = 2019\\n\\nacc_mod = [0]\\nfor i, s in enumerate(S[::-1]):\\n    acc_mod.append((acc_mod[-1] + s * pow(10, i, MOD)) % MOD)\\n\\nans = 0\\nfor v in list(Counter(acc_mod).values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"from itertools import accumulate\\nfrom collections import Counter\\n\\n\\ndef solve(n):\\n    return n * (n - 1) // 2\\n\\n\\ns = input()[::-1]\\nMOD = 2019\\n\\n# \\u4e8b\\u524d\\u8a08\\u7b97\\nrest = []\\nfor i, x in enumerate(s):\\n    # 1, 10, 100, 1000...\\u306e\\u5270\\u4f59\\u3092\\u9806\\u306b\\u8a08\\u7b97\\u3057\\u3001\\u5404\\u6841\\u307e\\u3067\\u306e\\u5270\\u4f59\\u3092\\u8a08\\u7b97\\n    if i == 0:\\n        tmp = 1\\n    else:\\n        tmp = tmp * 10 % MOD\\n    rest.append(int(x) * tmp % MOD)\\n\\nresult = [x % MOD for x in list(accumulate(rest))]\\n\\n# 0\\u306f\\u5358\\u72ec\\u30672019\\u306e\\u500d\\u6570\\nzero = result.count(0)\\n\\n# \\u4ed6\\u306f\\u30b3\\u30f3\\u30d3\\u30cd\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7d50\\u679c\\nc = Counter(result)\\nc = list(c.values())\\n\\n# \\u8db3\\u3057\\u3066\\u51fa\\u529b\\nprint(sum([solve(x) for x in c if x >= 2]) + zero)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = input()\\nn = len(S)\\ns = [0]\\nfor i, x in enumerate(S):\\n\\ts.append(int(S[i])*pow(10, n-i-1, 2019)%2019)\\n\\ntmp = 0\\nt = []\\nfor x in s:\\n\\ttmp = (tmp+x)%2019\\n\\tt.append(tmp)\\n\\nans = 0\\nfor v in Counter(t).values():\\n\\tans += v*(v-1)//2\\nprint(ans)\", \"MOD = 2019\\n\\\"\\\"\\\"\\ndef part_count(S):\\n  B = [0 for _ in range(MOD)]\\n  C = [0 for _ in range(MOD)]\\n  L = [0 for _ in range(MOD)]\\n  R = [0 for _ in range(MOD)]\\n  \\n  if len(S) == 1:\\n    s = S[0]\\n    B[s] = 1 \\n    return (B, L, R, C)\\n  S_L = S[:len(S)//2]\\n  S_R = S[len(S)//2:]\\n  \\n  B1, L1, R1, C1 = part_count(S_L)\\n  B2, L2, R2, C2 = part_count(S_R)\\n    \\n  for j in range(MOD):\\n    C[j] += C1[j] + C2[j]\\n    L[j] += L1[j]\\n    R[j] += R2[j]\\n    for i in range(MOD):\\n      B[j] += B1[i] * B2[(-i + j)%MOD]\\n      L[j] += B1[i] * L2[(-i + j)%MOD]\\n      R[j] += B2[i] * R1[(-i + j)%MOD]\\n      C[j] += R1[i] * L2[(-i + j)%MOD]\\n  \\n  return (B, L, R, C) #\\u4e21\\u5074\\u96a3\\u63a5\\u3001\\u5de6\\u96a3\\u63a5\\u3001\\u53f3\\u96a3\\u63a5\\u3001\\u96a3\\u63a5\\u306a\\u3057\\u306e\\u500b\\u6570\\n\\\"\\\"\\\"\\n\\nS = list(input())\\nS.reverse()\\nN = len(S)\\nS = [int(S[i]) for i in range(N)]\\nMOD = 2019\\n\\na = 1\\nfor i in range(N): \\n  S[i] *= a\\n  S[i] %= MOD\\n  a *= 10 \\n  a %= MOD\\n  \\n#B, L, R, C = part_count(S)\\n#print(B[0] + L[0] + R[0] + C[0])\\nT = [0 for _ in range(N+1)]\\nfor i in range(1,N+1):\\n  T[i] += S[i-1] + T[i-1]\\n  T[i] %= MOD\\n\\n#print(T)\\n\\nC = [0 for i in range(MOD)]  \\nfor i in range(N+1):\\n  C[T[i]] += 1\\n\\n#print(C)\\n\\nans = 0\\nfor i in range(MOD):\\n  ans += C[i]*(C[i]-1)//2\\n  \\nprint(ans)\\n\", \"s=input()\\nls=len(s)\\nm=[0]*(2019)\\nm[0]+=1\\n\\ncnt = 0\\nb = 0\\nfor i in range(ls):\\n  a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019\\n  m[a] += 1\\n  b = a\\n  cnt += 1\\n\\nans = 0\\nfor i in m:\\n  if i <= 1:\\n    continue\\n  ans += i*(i-1)//2\\n\\nprint(ans)\\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\\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  s=S()\\n  n=len(s)\\n  s=s[::-1]\\n\\n  rl=[0]*(n+1)\\n  for i,x in enumerate(s):\\n    rl[i+1]=(int(x)*pow(10,i,2019))%2019\\n\\n  for i in range(n):\\n    rl[i+1]+=rl[i]\\n    rl[i+1]%=2019\\n\\n\\n  sl=summarizeList(rl)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    ans+=(c*(c-1))//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"from itertools import accumulate\\n\\nS = input()\\n\\nR = [1]\\nfor _ in range(len(S)-1):\\n    R.append(R[-1]*10%2019)\\n\\nL = [int(s)*r for s, r in zip(reversed(S), R)]\\nZ = list(accumulate(L, func=lambda a, b: (a+b)%2019))\\n\\nT = [1]+[0]*2018\\nfor z in Z:\\n    T[z] += 1\\n\\nf = lambda n: n*(n-1)//2\\nprint(sum(f(t) for t in T))\", \"import sys\\nreadline = sys.stdin.readline\\n\\nS = readline().rstrip()\\nDIV = 2019\\n\\ncur = 0\\nfrom collections import defaultdict\\ndic = defaultdict(int)\\nfor i in range(len(S) - 1, -1, -1):\\n  cur += ((int(S[i]) % DIV) * pow(10, (len(S) - 1 - i), DIV)) % DIV\\n  cur %= DIV\\n  dic[cur] += 1\\n\\nans = 0\\n# 0\\u306f\\u5358\\u72ec\\u3067\\u3082\\u3088\\u3044\\nfor key, val in dic.items():\\n  if key == 0:\\n    ans += val\\n  ans += (val * (val - 1)) // 2\\n\\nprint(ans)\", \"# \\u89e3\\u8aacAC\\nimport math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\\n#from operator import itemgetter\\n#from heapq import heappush, heappop\\n#import numpy as np\\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\\n#from scipy.sparse import csr_matrix\\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\nmod = 10**9 + 7\\n\\nstdin = sys.stdin\\n\\nni = lambda: int(ns())\\nnf = lambda: float(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nnb = lambda: list(map(float, stdin.readline().split()))\\nns = lambda: stdin.readline().rstrip()  # ignore trailing spaces\\n\\nS = ns()\\nn = len(S)\\nT = [0] * (n+1)\\nd = {0: 1}\\nfor k in range(n-1, -1, -1):\\n    tmp = (T[k+1] + pow(10, n - k - 1, 2019) * int(S[k])) % 2019\\n    T[k] = tmp\\n    if tmp not in list(d.keys()):\\n        d[tmp] = 1\\n    else:\\n        d[tmp] += 1\\nans = 0\\nfor k, v in list(d.items()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"S=input()\\nS=list(reversed(S))\\n\\nm=2019\\ncnt=[0 for i in range(m)]\\n\\nlen_S=len(S)\\nx=1\\ntot=0\\nans=0\\n\\nfor i in range(len(S)):\\n    cnt[tot]+=1\\n    tot+=(ord(S[i])-ord('0'))*x\\n    tot %= m\\n    ans+=cnt[tot]\\n    x=x*10%m\\n\\nprint(ans)\"]",
        "difficulty": "interview",
        "input": "56644555278352287119976968766594349686737181528526958976541128749187634182952387375762928837337894789698931755626671113484289556793516788852224767922811713495434733662165926376621187915623682377313166766349814932152617353915582924871417986676456833977168741896893334291684182765448392655649477245895247879552299996582942562614919238289662233186922741427278128592117657724253983546139694937618842833391347233914628961533744758139352329352899184647779727985651695589357345853875414923611568536356514759226467581117796943746828369728698183228658474752657628691671935456275744327946926657558662273344456558273684731374759766733519811144374521314956422992783396898448516694349658191581395572899169242227499827585668197321413913444476215149781321984869186375545427765856156588131994925365255972372373195393827289118249344912747875292234639152614845997777421453124831123124146568467282948338599691942722523899268455295675392342238395811632329266358716581258911344774552887954493917846165329276696139396227644287998541739181278579964542934984123341739557976718775854642456471978852937939757349638499227595594187487229419762985433716951546729985553573989417221327949329365494629153546615562985341879789267531458516195653618571144938161829728167956877869727333598218277239597976851573914681971523755334498397372967795122137338169841766638268334485522121314239873462132532919784514363544378921474219412145666987786946474343648771313282229527778988789489158759596722752891873487262643523651886147534484186587976511537279379478248161444832736375734729217586633723134617714678119725975676463554915273821976923899192597778978681128417978627816821833576368153385845294118496537484169415861274763455745475437623218274449786339635515341492229935165993499132824677548849253113752488613855187275613289856369751945595555965672967716215683243784115114833531954399281389759217293415177618982337877261634952686623936881484425693866363784898227995938593633863321613923794286924135935697582625857149915299448713693651718244352996654358736871356134777627949811256446382756697781992489633459659641758745915776329982741819145147961911966169716867713283737125462998776249213528961198135832162184687665695949415334682156977917789416789936768854661644214722856436758757312551418576454146841662162991751338138787234972971799614372674364882315136825165114942259191545562289839857942777847883341223427148769641782928342644293413653678296658336454265156417999441558862447281661782711447173387292535597984317678978125546648353968861628437619139759494733745421859429791766828678176918616365752669862223422942429347146836421736851299419855247182866318173358363755669635259872735811958576733619476377528858463642761582269539128279598687823593661928551226919275972399924842684644156467253953833244966888942921795364288431584684496134515816153916966491896178445152824361936931332661244571256575527126668717718776824138878834318353368727336414886987856833898629565482781736598538845744856619552289259623296175667242455431331857821827712593417694415495336971932648597963698399671835178349491942944795952969887477841134849566424368349599864533317297973357254344445794889493257949682512751339785628795594246229555792293512949292787889926299165235779799362478669194156387551822411221339231373173454911668914256966258718563239255572377797786754516534487672745486168278932679423386433662594113858164421618858872529222826582987644554647292815697576772936188573133426815647663536926743834265281652763573466536686155923618844177755497948915467324217866163994925623766428651213974921634864165781631771913489481124999335223978577295183716451351516961948661518239312148299564878185265748115592581663394443577318566228597898922276533686617593312275226877664354414824322845799746493841879192187673132393412151641521619262959665757672657783567686836843426198592326687414649347353186242985241836789571121462784566535483174196353352556158844945415419993394132373617721615375691395224854948537116229633359258577262458326114468493933914392274569282587672432694172457827723262763975824552979648565429976334725473894518122447546895933598885131792545195695665778113191972641221521887948249368148822547475147552837263385339526174118459132977328931415398992167213816785498128987621444941438729772442524895385186234173621648927464768884697615228127886355446124767733615232785626485684939914389348964896471557622813544181431376652933946232916466241145159153475532576313266157474529711729612684287558951831459737858846388857284777175159614186831123345164535764629687637374722745449459458889718729624162924619888591343991113856848871951538756462593325957434251584146289159863949423298734111583534549957792644476323491278251589728345376949998988429663744999537167791582654793819432168628645347822433139213373795763592832748628764845765231267253933764461824452694642688474738848492883781495585136538444839338525464153314187324695527226133192678584563358959154342667374851318779775632493669155156154163423452891313742397615313895725182824117664842245358443939214961587159897284649839428764345813647341269652788251685516586227535465668543532215279115315637127779925284535415587341318582856995757641817577622494171813931524761294469536949283936826484883143739486483874789931669145451446262482727885766443197124258641672375541992241555584325816919553596949956728813388688586296831314699812825369428747519363778317353721797552914712711236284697674448248226489947689731987145197623238422239162845252377221728259649776363762974975629277578768865899137726662845265224195551737375733496128333788347891795617217188973391733355559678289646714655418884194324352433299787762953269624129287621256178679338452392894218341698673318228942692368819919551586582768961877321227148534688153625596845887128152451481559555434467894282683624828839724656271391178785362161335486555574645132926281451966525264654227467365198847885581946526678859857427252889397876859932918148534265634478973927629756345361514658667834683845562423163557692993347624813641445348759599849967913644749247973193684365482849145942731629268318851119322962836429519643148161512854985694692836777637176161289623143952895184717592194747315711647645314438928457267879888242312575457785832996773377839934971876766642439645233928975443365187689435184481642237939841159787425613195424315942649994674666856248892612159298927735424212241211967887331849971828495729359964851146612769586437341972292776332258697519243575415219614375172173651196155138826335999541899926585456231238593116111756983781949766716582642742941813799873416329259179857186472893719695496984323684333579514183733415384439719161686834412271637288747731291414272651339174459526443598533425797625667852557645558528355724539736399621391449283118413774726445998194174622251858392243421497878769866484137181836472399492225639135429889358652361719557869647175652457235597722155238717797796776287179613688349864897613247663157924371552411481859564614915858826745177151715849653845166643854591221358857621796159289191743283268354928925567948919175996251859374681787799461676783726982522561769979851692421652632796325641524963975672724299614171393961362213463772637615448463559233841443916175867392717742541164739937163659317311918594911999919176958537363952629911358271332169478765577787859918535319586966864147648613255497436793286255134326866541137237255663924938788771935773793177914383854989472287467297442256237653955141923812353521217659328798759861682569128737724274337561222856717327935345266627599742774554641219914153425956597862211527494617752983794737394394811298881528826513954873117774799924862282889982399326364831222982396779434647638463582442292195182877965645147927418645495258534144963615424135266346775854119841811412593714521214445426636628362611799981826225128229551827488654146333787913552388422699697454296536359965336815858924539989126654976372291913457238769824921378742662763417158912781863461667863655816591424367975463169762742172529328817341966872849266699987991232619494741494245832169215341326222123789357621535294829416761456343439895514912251949452953838935551374519231228326814829391288446764713162995633846487642528736435192582325216965172854397258621242283787428297691453664128755278545496556874683466624848155598494922432353755185939971684737166355483417125374352446258341941187114492245756997978471383556834846854528111513345214424875289359396941234514797856973241286686145912476667423911762149956148648224615398598936889594732693771428964682858481761587895665694986823851515933931426155911119832854851258577345494396466376433761869922915644132969626851291899646727284625533161845192937652927323576321434332939995516527323422617949985821614642851745715423975227433522466178928395494682997962729264666537978711695585937968514654659422549535418536198991368632832839217287586339291581246542474648599959392491348554537353178588667253239871775213211969474914797355882177681889957624495851641832339116755142496513143583949141511957637249518295798619592561719423651618355795628629631266728619382457346812137389581388654641797489494886494222367788879872689295469844859171461416198985465638747763991884835446945619351276689599569595684425177418349782255477925364773683185675396467656294391944331754946132851885618243249462748454934818948681573825864481199111171273242255443754874766719847465421492577389845781713656446436122838628187684271624334217252515349846953842875964766877285671425296314922839618627188242464447159372792882557949651697135129287424792519349531565271826665815458545247743742934154586637981194692667619944156953274691858997451717869214828998527734744288652994164386254962863139257941156955475596393195581392895187677742167195295438343967121333643599837863564456991554392549153137498888925297417419232961129457419969917143664668326529353969212173175486719162371588959452971935691589895785853439852146726757263579155589373353228227261153524831146214616588928661969441154772223466391221711769135298978747933337926224633647676457922168752416575269897786113314811813912783941611378498186219714238895359153657185489716439916598837466238886739163656631418235114237282376252438379577417781653613853763219511783746131813648211836159459335162765127934596374964767559298112925275115983529268791851441171345763115273397457488841826731188948538452631669677851416919211973793678563546333471133245225912283995689572986358357886666562527438444417473535161872152549739824238528875656469681148843585925411991925983632965918739926929889453269117583833772217698864723898741524538892296515981983441561387198168597835388779262478721892411219826856653785425269923215153767876551835612346155586679958764548147352162525878424893849286737999751253294918222531286267974644924239383346378239234267243527561771745345285972936955363733462983341599211143828796488834351687515833512461545513855735316472796722943454168726483318225362126348172387394472684353658876861395276647189719832382485414557455582646461788249844787877151743652168325784124549584856369339432473521335388642697921549946913914255638635256515788674857255898192436874298719469492313118878156776432361866266543761433726469997732241175565458122239992443595887626795546541521872651313369686952738767784877945432385532771563967481777132715656972739352295422837537126757395492627151964669361254618237428879484443684396941144637385821291516366681225428827531517798219931111972196774754751878135982784636437552659376357843171586379751175296886414265513838713783938939546339923932876766983114323451529231494586314256749464648919575821779561414664872536496269346416557824598136791988583993698546743565243341867964557148811119295923861533373834887272892242937674541968846489342988516562995844693937823914662979482768615797989345865561286233712992356436575467184564722424644755313794471991599952445938982247861435818287393517223417324452625927412626564985261561768825332858627338558966626115369961448133585785757144689293531834989595682431114241283324816147117561948449287399448366737857827766724838629611288487339692167372834299854581528614297549733321178297194322886271264432137425426949769968358215485526282797621278652919139948198141593972231493141642958468332575875954128696244195555696461188582943994364612344189439791918798644821517964556685657871448243817632462465863687878884498229457687837696919479117775813939978668283641989698648885865443135995573442976983634137979876355695141915829785634449555153234416157435242873765193396938166381174824252986358674616364142567834981611666852374577479867782788238943886922759621394519551695293661736176542516286279892378771218799718776454774549735146146683524976574277381216767983518756752887256275492572673182536599969111373889662639498569832642948353355178879978721294331689587419694614797422379659364895538953284481753558894584386567285844668871377296391278552126656538686538224321339649816669646788685257789161532346274975765632961653727192291894611851536778792762998147386334959621948483944188445893897124959751939816225813516298374979764897848154175712625186335979583483911776413639281597199788917381461938323424136436777281348995823951934832998941577186515519692569963482286426113465249526388597817819746292818611241375884817656223565815866884794261553654249879614774663968357984333476681639249456814727796962192216295548442918184797197679837842964137929991278116749817588881288945234337929816116271417754283656153362362341973692852752757156291274796726527674297865464739686368394449434272251769883594118469367781935469761757334647449929215589811927557114663426894536789658133775665829568779769625351146978212659865199439346393643197476666799216527628545993653883982944193651312729734284937118869341411146799159664143873938737581568413767791574126618552143636487827276668488157177214341893519588689794894387827158527692516317556336699142251956118866287529747657215897458364638188682612826233377155578544231935381159449545893699529547245771293625453129695314653721311829898621955726823182455173564524279624371467929474217768478787496639518388493319747411223688457337635479279699455934462994881741217491155329259547146923217869886831821132958911933611243689674142249889154589769935878375777682896386814431257589718578148968738141421847629531228923512516596442727872167898142297135632859771882857229633126195231341969785167364965358723143524961981647182196281696187222373869115449218451364445353534636818783915164532326937665795564972676349873949899616331139583792146626524681476293896511236336814139874129474254633639766862457895985274679939795123726223818547484752741651648882731157148846216875293161575561528784411594195389534183692694129843562333991997864287445982566382817973242512162182736865979593857585743621329187473685378577167158534596241193851687436249728665419635496932198541319186683225658715511391114959654198546262353965875253198131246358124364638855239426593286739778672872231546532538935758261467519946473431477725923214123955768294369726738666343373775645462347873932114927212272253879829471589955967798262845373539739986272986541548198724483726658244227677831489494563241455736576199197878737851147535444286745378964962974253427241347641749261132656995381428267945927974236752623745529557138475917543695184823719179498145947816371174757639134421448119497972431465499774121698326995941842471559278883539464777662274376337282396746842978482262148991654791721981233831965171357439368246566947198739655171553439795893314838698114417755762541225674597581788257925732566134248932652341899967697958247981416298639945266314638738847935916161919185973171535223596178534655314996414814737764246818138559175477598335136757119555899145789445572379786553571788714647433552584981882341313925691435932813292469475734892361671474136519731887588911132785624559113382423881389526785916444746628115894923778743245862467322756575923438391961256593468291221374277139849656714254947676179556235956889995189355456839515239592915356524763953811845751893376998837454442713688746418485443746533138935827145827947984248564545719487746146518398881717412398984371423886837268116861475419325931426157876651198111953532949686933483549485737888845461539147715154464282975532251482973422851252271283635112885553556482737321947163839872278111975948379739869297155839273712167924616558284363812712254651131823658793469124389358643524815484195652849662943258446566658153614476824371545574365588433385328979388376797672613876583248497713313558478211854949171973414983438171188465867667134916316357952886324795525316334629451256819174133276654239165992593887555698938433755354679415243957473892357866181759738244522797229978999855253345889983316275843882731719462845822198554289631229812943674637183673658366593835278183375359679982349946865961239381463832817541653979143464726583649949522659866335113631129866168958687628382962345777472769886172582399768169234411852959651733768761421532757596183693684198526553681989569573782868532116529834278962352219845416747274798894837474985184349946559134642871276751913857696436672213955159646785122565925319387736347476239116199153294957966694887665841134415754364729122735378222193985793386699117795555548514112111737395995779831382838754541582828642469373696495455511782393464463553819738625242883531519794463528786399714224277776613479222342279679345782645528116478374412727882518241862915282294298812573694463172477286362523857966697575939354786363663929986816387292394777282814912977552622487326585627375893361588258711778771712265612126838195595862784166531787363674671478295835859894518475519349344171579221675554255659199562241875636965776621524166287388242974732259368566556581768831463111948613757972298899912633324583769264569877717973448211245291672789875598113758491459366731234292838563141767183394264431297893826138648481548821739525364314172639256311567636261381698773749319549649746211311996551355426742127436658392477186665646416233419813421166154483377897729991913446174455893912555222193617184995329167281685752484793116651949452115914263482178889459331713936975346873673441262666445893791669586969337449193513718795572523971632511578414828792716531454711228438469874373515921812776985931678812249758119244363122679682949117937834651235323178919625269434431458329187582362138928341558567564573478872148649769148887319286474449796996181323157852672269786984581832527572656133329358655928818571758155826117665899743239745315199565291116868552598551115392868973988843747796572519314999375782274766242782533417256742723222348585844996663654163228539112779674669826567294473634768421955498247316935494439152156792987563821829544968977157666882722499939978295713469611372345821779161976642529792837153345678457234788322814562933556181411791887215873463952726291337418413677992838598745995583644285498623939322393549283618526761398854951665346323676324494933378662151968477533275654942364222339139916997946245523133864299321233594192523183392964837852384626279898659924591132258761968811182172815236599318954416652428565868394682648825535495257297384377157357579519254211812577927218365216799274487135749916626852278369859851616694625185556126596913919511172392133645294388812679411576575196498592292167586985836661185221563595127595563121946844844197575219254488828117945518895527992569183218954497551211216993115714968224444318942734169852578927163834476272817335274223898387172438552867585544299117419678775665796159335948693834538625458245612356483298632113936477856517552289439435572385874323217378223935351774229448877565532471224748318568855427966374924329984689138495724282237732623386187362693934175479771511137726181773836935374572436242722719653145869257971925776317382511668918228434971135321629992421694913847687921335226171437331578498719693122329485133889611555223269533394275624546423892641489538483447596845596527318562349255287494131229325433261896352896343533169943379955141276481216598647797879124438399593522814147981575314124913725681886386134832756492542325921238917517776551256131479345913436843133492741668996551287319847997777681222253517651189344128312179766152356317211288849143947747114636976545737962743782323964762669477359716321959383276284551893653733169811834852312624475341278573218814418614492175856369168136532541736857646221143366513941978236936599458557124211475582481535155243274125513983329766358898155315911928814732815522866916729117692733149658552264617657229857151454127874697869121623957155115952467383129837188323882461719463928215815792995573648946521526457754283333392784797998536848994476873813451446872856112963116488868415342658133498173222988477118398394277769426978524971981324416817678189155611466168226228491453625322414311417858916775857537119439985949325684515627916881182587432111586749382326787485514889781813479668873623654543866587725341612827222134124831671276697927336571696543712657341168433745954978245998181393277999325855164624671715595244674577532991915687214342823726318667688429212963677297296485639291322754737231816387699938854967257414915734744329893469435922177451742221467211846699873396799298393333726629711735928153983365487441779168996435856683397545168137974925644944431552362185811931449996723249111389975253787152113141488582676313185263466717667519655863865466124139783153899175451435634566667729731249435233645321869348325516894296265915339418574533682427516158226576131773176114524652595499286622924441526779259734469186397721584563111252316137977357624454352185686918519696286387444114871421894699468962796133423272629446261531429635716952688163526792748246673221471396787929991231878224975985887867655685726747638956687991438411738437392594483864728761752664896746573264469547444751995178551198157349818792396961742217997275143674554864595184853825632157828589399953886526492858831646545345518924295983699326842558646995691957362847825377838919569945228188714425787438966788517593567897232462361521451811717575717549625395656521544215279867823381575163118934576428168251147132366145716957445933289836251598543768729435284862171496956638759886519188999373673371247587935321258633199961699635335697215952815933618894945418961161416353224839577749281897168121435758781582482119966193897737533963126443775711655832749178983693998149447427633735494856165842493214242568382245222514788643588631139524457974469542749771967821845979116497359747626563947375761433317118123941557472464157645239694417878953679774944116879144866177611834244527152322684571429784187523383366552153272652681752362639382443144382299434334528512457552696138849321738858585618453414234762579566795873877516124215657218775857678652725966976758863727257922898799717262253743916557931137258212641568791845516541719485284184932799945351669585857229951767389462399955881221297317796172897336764722693195419643429389487632158815782323783428226718226696271174865792647289374218394379685529419896932299778864446319865488441298782647111816668984759674826152334948119377384544818752333761325634417291387143667141146899472675287117511243477585697922283337129865289468261358887957613742788875523577766899233272345164991553211378564313383715414245612652331172245496455662136922276956696389649226163327839145827772578364216794245784459636546796254494438753573181541156844532916733442617656383141391266851652146821246659847132516744749427246499257379278635193394321663138121159242576991192714771131393712723278858618518439974346532428987533688147983767985894883517911552192915977984171282344968462982446218813875469453789685888631418931219814297828475773638559598623953274534791575431484334918111328119157541255614351131738651557986553678338451363853223271367495221354838763834291443895514447918571122756584371952941886147194284542324554664177196116396889974856146583735218224745798224864913483239641177421127457745785869429372826537757785338965192325562345614365935952566857824125918831376273426571179442887751999957372562994479584762945426238857856643896325134161966636881748428827318333256394443214517855161569991657225585381268535473624528613324314134692263873868579315987539267717339293996971399261246394993439368674975965249874772288948883147239364726996867653286242835353842441111399735939219784962873793347999521343364768977763886597169271646858316396515189476927728179977681887577591874489753925545819745898594991374577816952723262235818765121613162335748949174872331473565356195792981736816652697557285397487736912589143846133148675167449487676865742133495341335867831512253392812624776799952291173332561171639214335549679386415795892965791122321329251955856694363236914899194128482576536684496681337229729525282117416662756647789185961896173127749466885584477939172497561114258145126467149262497323149259155366534143684793117987217166527553712262532316726243947568117816166765758547788564139362758224367613977926541423733578851667916375486472548861692979583189345593877676965932759972979794829143697834291436522585618491545521225797351557997411121227264966551228555931833872984144855866697425725975196169971614839169336256383969669895974454259919559723214717699722933892647124218369477239252591886279174586922233716664651588147492234171215573929438437498194442336526893257935487656943785662249834576413563549764811362329549152588856931844921992664921213521824229825235923375191543949365262899673379161115583534714917429364747164318817622359638185919774667636286821986694974782952631451662157947153124337223892152941249335938114198948372269226935284582522533164249817726139419199376485228619122488516487721336229171295686997841865246685971144116645923457847776717364173999992872153724175135699969312476399949486849249711558855316443984275767623227978436937841378974413875156971529943646381324948149522951444326451474522445462432345786256452936396712981788396454656555569572617728586494663481331243325465657286227737895544739144369744587619865678698866475384761169783278252387738863683643928159353427465956895341622635167119953145187196515486426376515831675841989554873982912967373124843244458451384543153212963668359537254199179719796587162144365657959823121361145618821562221618369941138958887589662791274885964453468559159767555251222831299657218832977354411388399854875979333349537375283317886959763747468658922617555133133293615122855971655115232173862259824171151832125144697739415552277231631241146552228612552181623566431848121835784746613877961512142852121387216416423871959884645596984931386424765343113181896863421338545386521538925468761416997735693552735686648867948398218474822323831111796845199818999672198915489569266294379654496981214276865543691634346324731883449214413829429418649534415672444695517268187626144187862255617197713624629784323836857752563361684332362952314742715156623715181835551735875192417164127885498662961671961663345327116761213838841488972642494614247213925821997521985161145358882952336388646851546157464521469897642153985932965728123271993333119514162824593159557473394594736234526796622532194942257944464112283443562431169143297893888255194453129342543963616458653498321568695618927416248514322529725487995551665962752561657312541284455221412735343184519114319853728965885329436836373464753186278996287495727914489217215169468246994351287538585737954568553916328543358491386194385957269613794888923257312669238767311664912788691654797273582787639692586898564594696519593372646636669132969627454836946473684626938826587699191138745596265859433155246631528315724965451699346157771651222128916183561964721269683636866745494735718871229641257638488514258197125173757972965549156177331747467473975583674634372277832318752735554843991957713576625857676162875821135427192533395935514849752165649161537713957523942615484227261542692551934768736765659848959193268824322769462586315645888971323588989198365829321677434697824183326875579792816446758737741797242376381299457716318954751846748486566126553373451364335384229493886399279572332542642428298565744617664647726776373637374272591238758923564644832533385815529881276686959359142997616236893456738758897428386592993373372852839263887677343293351144343688675242824241114757213142175647772879756587483521199342887149694382454617896326421576294869322397371524329539559524913316321261262541187621185249336246568624223192737461255668636851327484241997752918588728828485426884253541933421852867544585299114184211738547776315758589795654366332187819868293221555411696148835683372546549436481236351823298759529196237647476488731119575636643396859279562969977646463955314324759151152295611764295343168797866872393245175181911588899871962789486113713296379724474379981934969366935894834195539756317311247954691211841771472133637242165772232869923385686134479736453392677732439597282431574525594455165683928369163298977587659546244753917334697414287397318655754465426391689963166458741968226445518187585283584479212846119879768473136677966473388982888514746671435592886126113359578435389823263265184649169774419994884471661372562522763288461495869774345737583127272295449783167786379459843288483336844779115229617895172554795946222419443897435984889499223343152695343232723742298313839551962177358371525736817724678269435288497185262952694219164157256616436166315647945868413557476854618917512511832846455373553695125373476732132479889927349395776568863783813384661896591348782947769134347453495498479619778967378721992939422289772821152975642935747244289311166794138561387812169854358535939551864442145878716166688987352982696176587155927178175498538313229731249558239865887356825548618168417159789567318718867548195733114393357998727877723377434423559446599912867465647252171975921256224954591333552638622267924534856782267498659922833747583973673874922517994947817958819197943811987521471841482259117789762737279252589864255647117298897898865458397895141634145314596959953455294676578859219178812533338662271431774277748179694439588572299576522241873545132587671459277125722484855928428877136676254658932216591569993158813521336959762452266649719423556572736361213796867724777635772439414833434141162363836774694497671363317631467933916651261351324326549279686953626994392423822861161396313879628395295126334711827216562426311238733246829198395513334153452812164622213959919967558428293233748788222494564835745684249819474599695424586899374795199987681719465395847797653495368675141976575224995967195681868599122122834431631918912919758183243273499733725914311821627976334121713324718977256859895695934869731726685997118926892427754132956593511938737854496638153965286699121551478283258244316759568371653894147944871368816668797568131421941827195475684489739618127128452825592832529578128813433465753172136591823478311726312934994862175314312989296614335438958876566654589153166969819467854685771729991281111964481587942762272493164712973391885539742923875979694834311686727777786285825782139813743472694839542613595697999583197869738361832232428149861756549219951244793788468218139243434482726198719582945112133454431833374344726522881673428624164963775582468365866572156699133848693266187464985783946882957224819353612189941737667224522856131817185263439323355331519114811376344954778286124262981211218665411671222763488396721229574492618934979828781288617241283615843125291615726185479293674811788132266633661358212349658622782798649432793164177633385394937745928836397361168582873719196593616139981839236777137865181355554432468113142888853569642598313544461355112553677891289926843434752736916326341325738955383724662497124596983988451313382343697531385698883662793164269872832787988419862246467223548482669824495838897211872289228847819715664868216883178443575674267713514378268581752285485185718472912775646686419467897158643272387726481674651965483245182419641581449899911521122632833279648243788331382272495931137525531731641881829863552481231553464175319368884727244487137278895336491795367864233274747389179394176771522925111138655214622988312219183622295167292745369573329279794562787881141842276536275576696459559633211453549287466693281983141277378951664971868868254562469877981946923264551693667742949582669396598143281934118923293738448513886192195872153786125248469257917268185732998999718652138651213778711796661967851882874197967689334395888971529684368298424272195466484922254383581982736541387988433464571985534216537255238493439166951157846657371615872176778894426361779385867141146114757854767432564981459629346685984967147181244561978799664638654858698483429372447748948633586169834238244971776133343378431183749459896536812653785243595878431699588884273699373169355129198116324334347974246455268432297739814826834685976898687714247989134667722395563946191751715545655692948377188794693884332424756947951177747257839151955882637546166955853746328492976581475781185834467774683874147183924837598513394431412497958285699365263358119437631232324359453789963672915349484127674462974856574516651838631274913922497334497895712934888934392393794663845835157364957264715667448867192463996189229177598729393231349665279777973779167552522183414481169828597554948751363567545758687941493846956398644369614267118489427816598915563847158254986728149295232487762125112923455158477858949746582748964658676296253124964725278341823563431333519457824531443329853856993292465477659276575994969286291648745218121625686725227176987711613135966311178922481975928729477784429819894546356542173146397438432175877199573639644511872186458362767154738884871869619627952721633731792228851365549511971857328147822342218991664653224258619795739335846938637363294387428572998737227382144329856984749843627237612539248499621795629723151928875867732687398533868823967694483371873686218362186431612286498828571868694372122286881217877491689311866796718429894391314711656858318455183961557137983962516483625867173352596451519466718244742296168682919554767751721259521368284753348451688582888673884967785452769666174515339166567628958385667226947299631923362197195687151684923763534891115821667985988481686937929699251918245961746385963147741516641669469455698777443397193951216395587918914611972725688971829835243536958551955113616584413668943461613667683613253248983545277449197159156249745974318516387983622479915746872558996412319266534567164955332229985842523947889941542975151186943888185267143393946699449718449869782237257163536479359415172521496688588357985799739532533789846828926677468739557489785226275869572757186549814345865857261545853276586271686317497521928442153776467249366587896593188745981773799419369417921136498811589298911876965196269655872362962762738555375922767711222564718569358552419947728731161615683412739924687412883651698571282218823616472263762344924424363799753463862796344143528166931526443529924148156685798386989378211969783428421853398223411572611818256548868447594546491926237512226758394961375729459862932293772393615697438469611178445241275221189215386536194292885662946112627465161787884288428931595887273834942419612728199826719943914548491366637659452484811556981439625569526116978724877226282442461582859575332468185367492151962868619755984776634583919685864742152693344157141217233882579588698258897539349996622795723193223359287242281559979117999117368861995866655126579223659915851276521798929658855551229623895549957654612973762155944146955555136127729439293227238866237376751793995967395666819688788962651738537824889463387734169945722426533563673194916565985521297124813333389719341933516811541438482621474621817388797261419569344784569352162296939486112731922956544614299252655468921541178141144691982676451672599277599254643449814843734212194715872647391959948261241717861591414519726426585955524684885546969449164721882164772841599675122359146462564935483549674379169243587233775282369539117867714659189452423692837844368286953162333143923975381772349467939358647633141329293781745442261395869616523835967117182362768246468419156778986665217893735289437465928419223423435976434459986318131962111911123258432582811259736998868123568362118231347167168799674531643221492669172313922835816824652213524122484485656488117679572583625533519157443828935991839757865588872529649612426971788853721945192883646476982751394479386241565877837675961486785429359629738523859271532368312768188529674364881299696472763688363187243326296315892494846265179254242591457663393846375531267116224416758464743667661338171436257555463362541442661345438628759842916268759588273262746551271437127416385978987448798915865118434571685359623885658131199442978618917373732795862397283124796427896327369896755839349121799347221535776274143862791696616329991646242216557831879191463984738181838483123991231479981419592681369293575241351849362237793621578846868537337364296328887498719215293728574428176994253681919371288913724311968963781946262451433625799512824139349415537896392275635662211714564442111757631842535444813659488665662675867325383629168619245545473261637497235259146655673365311228869477955548848241417315345133279372299568497194939298571878178387558928132822325759523218947551916728483555556276373381647492256593346289159628357523631426521721527987729534964424641189868354613527391862147558769313577832943219761536563934775398326659854993398537188457229421754694923596934197764774911624625585619333384995599495844764915781935322439999732173315699718171319992544228524858249452649815448713954922588549733753353445795185731372231239757363842872691899926945479471512799733197569495261529823194995162736951514337636377535433721532621993459933722254922156495922531658972891667715637828945628817717753869962538173997268857716134986824337617336392864825351262551943511983642848981292551684536368112215778367975325966815568682994693444611151459554527644885176596891256457952964191515394831731617451478869393798144499911591426365283627483573845878623197657754696619471649692694224176241981775259535233716286359575698328463786355738875387625655445284217468536336635916434342856565467342448217615929827438253338295481467475623639966932257141943373681194124643598485354141814736272672158633584793191613948262515876747276332455758166991642197355356412623432488368728293919873668547454888559791513378554675457491148458832458891644551395952258318781223527956522151689179924359668333622177154732949957275178945164598188789877115678428523597855646242641715731224663615313699274521394222392643366632179331897625485783733125857797681626441846754854452514396397116416893347111597165821296121439397929515987722569786539351627856337774933152352491162644537194655883887239157941271278229575771519711764788575655587937416925534918995399839315566882915459888245771175845375913328568782612182196675559444235741794575191185255211233242234212289299734485623275366586154676734666428756292284641867388193573729882726812299495481652148519295735963443623826428888264248373823626244877847723551732547593335146546859484271168772331264878972274854716425343795426362982712573668422882179651649492645461337735939771646246117782895272468399637985739472754558886588389153272183443359421283927188878492872282897849447432461791673523576433948819612163321391651177917479397836646868413566437112714756818113994176939576448732882742295772335233243237791879964155955796121328361776393273117184389139886481164566292677119919571746218589749649632681891599512999659172933612122669652349612284526773354722727756877687583397748882986922427495825153385661139186335462884247458384754279667365861884556367877382953244393275988137567365427965971934966474382722452844883967856548352558867258848493897835331343857193248391592361414928351557723522817486947791419846222174342879937627834216619788926162783726832319231586572544465249593349484888535663464681672417575488398139579129679562387837817661247165582656481617276354721352894169894963951862535367175653813679965628984811648925161389956729335834946667747145515845366668166126933799717327718863699447878972193929438351145541256867587571633436699282272513117238621656221562425265513149795573595853952659837889277394174975242477759595923884859629344572437872413777692411658721195938324727279467123554632813889659256687967979417172718197971561795684783331822942284364747286683488833644991748246177419921912324245617194217227644939237865345957238251637859367923613159815475225427341744741192166316349142829221244391631328644669715856876724775352924985496147129387376286754156311685429527741547583154917346937152216121198598997659255185759764718836716887797769463519911399111764575427115954185696385341641198546842763384424231312932482671746836382112118276632536284969168421244543466782479881765558947784333248577171657599148115756451586319615495538243564952767755181187123476896415383551341857654492433177513567823262841322194255257475946453159193561237643757611447766948133883115693382726396482337788756454577332475598963348138234499928194893318628339372851951441676973329535384223884153383494223632816325688599325699963262258365316221382148346762773447285988333677448993423538262496925475918539479896983523841564955331814957838788113971352628242452312981914686431942771432922728727194369285944288195324514688361435226717179998689752213691148716653268137666293587812224592588238788664916457555984795465921454478775393896889631764645684222685839367145386743258489148988683917527422254197274267987384117387659236655472367575799171634613875838539943249399685231472823425289291624128887582972914532473333997375735455815921485768311283325552253554162269538526593683772699983273769657291296529798175479815698332285582672577845731752486393881736359587678692972887461679192332585934532278489639568554395925764755693812437719874582199326926487559414868869637981281347435552322418912351188415444329869849794557868222294599632553876773227619152251144319774794491888652894948668118971214482697879476586731763876882258649659159241857383629279894579262758571967599937515882363553119139449671932511146437632273495866671535183816756344647363254951264224919821771948588577684138237523342814566931449674156511153165833465465712562827713591291963412135677435173911922343131932816332656333522518912619948628782663836811259837723837155369592228867624335638314136172778382157541163595265883948898624333651836592515766172346522863586536534488649712452716116144144182673913282217392753655686253477159623215478642939228383965779182578449575581517199485798875472135982997842859119669497492693549914649911771411127724114796412311943721522643337137281216142427375842524139469878742414957639491918524364958819216271787681375674411767238658949341917125654514213783379951345358563184353687162583939254898656228758141188412781115352457463559545237359694212268217115678222456466593491981223118946588922478819682983971655235761574824874248186968544327755614725342162289971379825416418424142922188518974299448297173667521581937242316748484967887714462946633442876659146919857884166912884933994285595184266341119981225783226196181428438659687427227736984124566525521163917683737192166367627745933595184872121279959196185846894444137854959342334176435886159878574688896551117948758714313976689877845854536871939994874149679318116524647331786118441186962688213773382693686741421439427294436484628783467416133851412613591933826832751811324228598914313355721187844345544689964299928487334565277268147289922523228877814199143658119867853582681992952496182426348246911478441642775212862147392378923129425723533488629341314787989648971557511932697671418126695888326751189264598867978563686688356918255734295612657523917562924685432355999962811818569324571462346135411249781926851725225574936575242347771488824119956317145394118497894537231883813358272165147553552598192122617623683841346265371629533835383714921635461421766517989599931221811627634471365169642131139386349646318272735482567877279953886665856437275948389338823692858351547337564741319839737499594976183982917976942529538642866839628922312965659799239493572865783395953279544181377485873736583936927728276549789393474651158972133887143173954913322781983452546332351334582537947219989278286816947764228592965744671494779225549644612222579694415994111624876344843726257315155597777426363622863643559793349726743238215593942325234488696279916628649818969463965219885625411589148856782273738728312313721368448875484411639699538246891884319569253843936868782337855311543612748942316559398272493229474766283651916391921596683369633771937843838681192283972762479353693324834519996539615793691462327869732983371522295663653169327355479537864176658364479498159288866445623635623565195785538345516883693452138218669796834484288162834178332912165427179725532867338149566166124259761659275697118459366439996211756151832747579345355414428618793138282774339417957434157799564937733549488963983992985976717769274645169291439862538669471471966596797717631855788992222516265495233196792381896929467692483956361685111316927677362418431994196456836627299841238244157742355369885347422898121838511935184247383274147794594453246456921814414643811175253479941725383339534474459875141772419245849545336612673119977822923462148353431573441967925891278122479866962112338649569641758417852471582547558876623517153288451846536159686272741241211151585937211244222887188715515223931726239959755773482876888392141115945152896288361175982633354624517436297423431999579234963211182648876169743329381161256419517956895245964446488421643372356482162618891168556449938946497993783271963599215494374344798991667629871648867722561994164158775937176843528225931697552971637972999674611637861448553682639774625161974977672322871784692588927123234594725966695812698866867291235811931928525255558747983454483792287299139583447395419512814352395256281248143292423538672744225338632458341153143737694794751871129236291981822184327232554558444117648226649414936865658619617296222365717638816236283768964195324765262165492189974617443298524761467957238846766387656989493472393298599548666419256365982381249869584445776558619659593448239547114419596714646412954992456814231147112539363122442142111441256641769427425316468593381446722769619348929485466571872394234925692665949876498926911653518399664816727415269828774497467154622367347819576839942313253174825256552258844375387959365825182334647431347689254799441952717286666816936233655584628461542381825128438737867955343644563219776949771587164337884336385398236893264649449934814531468769638215179191921438742443669927721686536321341432575138912553151877634988634216491192516364527788186179981312364277486252781355681486611578766631632176427234453116496643673959483197532173212463893789722538334181928761361228755117722347138225879256664861692365566871571434855261759892658879325763149851664941818643597386444412486655981674292896878398656349745155257681948755661461656696942265182316439964922126893442155136548812344984953836792922297371779168536262284798967449534776152617189523472487121533368888134596453413386826753573643882927792475766481127274131629411593689947114322296974615469221242699736263925429233937214144534131228197899354858271247274947916363173465714166413852797824388166616157997973324969575837361421377777527836794283445716257976494935685523256999464562126275386195762186664733669349953584891591851131496842279493956313637151339287489865153866335357358243546567728469796688475179587728895674825863461178167915643367694792469649963829221797377622436814184281659961276167487673874122274415125815625912318279695216297926173119841138497195478993493526818422511594493271769892533367398969292716739961142857771571152899965425781364946535454835212916715225349477559765431535694796834592675489649536158194382352144741225737446824842654835372541277347993171484151463217712329771299722292832693249537584267922986751277152517344157373585469151252739461828253388897496489186633629218175852245127564376731923864865686381424247488559973399715975223622835475253964978583192497887933611353918477579643166564229938792399214714541148968383842545465593155232974439656467676645456532552479256812352297441877453334918669791687352379641357859692274547834454592172722823814163913367965182775432752611173833884691133785845934669731182342616763624567652234877852261692964676423853836545226138391587679818526924126568142443735941963469312819937418121285444492788544749418656528386279379188221827761316277614519859561487223664839211779219296553627226528376997473226755338925272139445114257564872695416128466377246348129513565462325184266216422163649529417665452185489548148573162267246131923926277219495366238544378819826345648735466523513594242677756874954848837388956687672825586299167921877328792841837554692432649586275217667339742916622952171121946499793147755229593226686156174119774785294475515144124352681916351921221146272353945621367682725246256718392131946753164229516474251911224645293255196341836732156713256449121386334452519689373529464897692521844999636615469276571598598692753524998919849552972642174357589568477723821636575757936925683137727692848448761161385344288436719388887696959631397947471428565812623295528892819814354777156462888841863613321995811972449219586318791923111283721412976151138725595129374485556471241574447343641984898147988742995585875428847432233834972284226865185615825492523817783651139199579687298949898981521399429835685541431992228615589262689341333647641848147349714154212443341342153484552948499692289255862129471342713329134458312811318762813559385813861984239644196323857963595358894989441294284829479535437737663794588282731974576692625991333559355343121488111136872798783246659122859184218975746912744157977693863898186328216228755961439899554383114641491934871326597917869212345658473264524568949865972418489357136938976194585976494957191237481774762329826595616526575924181676574448142949898775726587554277267972634711226174571376465899522763652897553883174566696662869226538467864145133995768447145592846113883321443258915458817454963841821152716254261853982275514788291521877994759935378997477369844952331919419372453987595452918558733674824396423116197592295247544258484344235753867342654614894221368568955857314241921419991235684343341764929797214958392795932298549579765527716687199652446558394659452756528494427242865299367641989438462384647232476634655847352864912559387281697547618512696558526373895912883259681533615235771215537167874152642935532741966614426229165955466914276367649114457193352117929527928677367249644468867665985516677765618837369358713645732781785617473688242563285861528442971253164638166689714287581412215699132151652597394477519641195643679897622734655376845155519423741168178739936813826529968179375476436762132468778811483968269198692745324267911356591434687324719517414613266792879628632394381793657777974613497793235581238147568551118137933287714423435826162578596448885222128429949258845771878284648966634386437284474441165631567785828351811894764928579734686877191118552121564641534539414925578842655523649117921432966333269652748384847569459687799999378821339229797763687144125342518888393641629874591379126788454651241949585712885538843935341829783457532842723743278372959823988791897585273648313977824653943244689334725395184136841395422675788723674494444463114841439761851228747797775565852781522763123176456371672184611758795839977117576926862248399624967596831377277211127743872667871334263835467368887283356237114222897893724376535155933975242493688671365143833277176623264499381155548197592524577762627552261596167595619997325287927323325193883537535881954662234952238397151383249392537319224357439926227218726699596845496947673443579576423773823459571231186779716596842614557151723495254613221424427796634325527477639539722273595613868647495525662667431379686389745188622346844272588597836548687361939559698576476846273527955872188593572458243989243483831887282666593937659145161216492537969648593314787625474862249935576685735965465674861197854515244489488521781234783248111469136285367417514485381522679626459311735192474642963297883138197843331612167219463683354658191632154736156295654227972874182135658815691964279292762886572195979183429412795384272915449214451675246592691524365497183144685351678352114438184542747742354236892181752595333224981841685461969162368818732584295654897113313949821992482957798162692443751497269633811499259919947153265462618238475689581566941497569459112915626743954563982926816123863593228191475775392983536457526377177497114152128559963627439744591636856355126183932964876385987799641379247617959663211912665312836967414222745263564173753958468756432794919674233854518438839731498115114641825766774153755532763496132753748979939577197585463689347729713445986767963852561899264838264849196156468927673991549558477895632348121825587894936933898626117831139425266851219249871287932577246751428111914583618582221687552787964916196949692161876881645524438911621946735442815637283527631134187325625638899535747549529493794996728193978281946478957196461966645527218993639587513867793257175661627656611461785127291637951717484432831369458185591424619128963383199365488779486724659845318795483483349674256484993668991419953862595418252856766427136862835137184493674641865937737438868559952269869215891481297495554231981642633842395421997152146876752424973915251732896913664799433154894484758714242532213225568427118969666742848566442834796839639735927854791961965613199822462314943929154634355296196713619238224856627937442856983574156994472423621436467322855362868531991555382651258751288429563844484672153992923337364647311959391289884659732444235382774844954729994813146153694585228138632542247971673852128279694165325988733846414448279226884221796224756444276934425683537213156364731489172288947252262777238964464527445423843977216633666659715951847698753453832671749669375954122121811285179538234417882935663728161363285743713729113582892188419651677297716773253524818243312391657565115563536757777299873149492518756522989452816674545952656614569738254219538349533334629696825683646481192723324185818885739636871126676669413636761428474373933163281572528732786946561271997755299619819147433741696426522776743962118589388564251549234815148254386761136677666236263211489842384833566515648296688955281223786334715912445321566839389821597712499672745998787246519984557422671312991963278595295348523418371529483218883312299297785894165452488219229777666131876716865747222969795457778137562932633719386959919586597666824664636291987537835429264896178925884788184459717341649951964357537619923575619276794535996266367233373326181273481761374682389994365313979336647423978719246379718315998373496941871348274113353365671992631244834698981289993674697711372643814212849889334225467185145127179167582887714177641585731879567648958227467526368543697499737931221453157954277925786961444855816661987457242866581873862435667458635379566232434647221399273936441154618882167119539944264422195162995449227538594767522796812798847862214729898169713893298545464892871767927742422441827659335561389766381149519943171145989367924763986974676715367117365616454855872637987551232239635263663428275813711137896968562853255955811817458692711332352523277283514323973372265727414768764696288298875558326516411418663539475337576242414138727723871364276855187518883724967986162731621814978534112968222686735983945151291397895947428317557194613578738328314791145112292242966497231789895869827459656113853298739323211384858876849115626553426949897947781461494323361647273932343362778968159711969751421959488669827531244873176927284189547452141663891769673229593653922889836747413342336386288176722117313113685119664463179738684358768297599993553277363867427422519651918633261888912164728981744951716192825411636125522117542564425248777615666315511424634862381744475472673578847577682419381683932655769125854765742428431995859451881982737288768648338756796665918728832849695963321692783936247928198294182273953772179416238114243378475671632697591426792547417251144228584682296728378718714773558323465954352896156985495666854724412117187396632517689799357792868569931451524171271188841136733135532855219114631334938859564793417149849489919514797422222359573796923127536583557485544284477321568924282231361695432466794547791787643654582483548545233769629962132457783976231793275496933324596467645252965881374577598568249477319891383732716633655721488837451669571224841813433993928832756594411753789769626377125761175851875896149647639999532947141795233335917442933754433971848123464884499912644158693295968418956698196532172118431346235117649858271633135136765592118565582347814937657297555537248855631615878523862785648552271522672371514337859564175947121253127334992279914317659925822893568368148591645221529648959553146538931329215184563456447489189217498629683586641656457647181777287269635362587673654164931332612737916865661921958512179245624227165351244148129216981429827725324768419278183248278398339525863526234999867238994566858292656942619659324481712223144415692519946955489579852796375271748228783188164699274982948937583845637964292262913138622846677576955932974913913918978568741152798258661356519996328691345616429218257746536731159139363413589821946699918594515945432442512347173169368183642458754115561551625119779993843581347589531954991714949557988723554648247817893697724581374618171591266878253147994286277226355234669338488928889733926911963384774769544477562931684344542966126466219867479326752626463374623797428247724889519954266426817914133233713653679562332147997545811522565871938469245994995243282985888333893877871414921124824464968446197967837176791651684814536837545618878482136463386523158917142894265116195485341633886287293698783678472132831313719881239513541241245856179182748967484559242782476351517721818133884427679856557332293867468976455752937186798439446356729884664316342863151292996437322962994333168874379166139388413896357963647945381296748499856533955684796746124949887587277461241582619831524793757518835418367753232217475953528258138375885785942842968782789377574161728181843199499829934525858358492645734984386459163443894696717478385259159356212525792961993888257665891168695321596843433616862615793461145483965715344727918993986698152824313928311458925611656649286138823921469685626268666561635393564864622393447727987652641991576556524428323613737392354229157197475121562177286445655149819365757165776399114526165826247868328292253585468473165153955394227637644782939748365975289475977359974314133198352266753656389872926956776495235994875973421984888861355329389957841582757864381353597116924656771588791465431418998639199791175196943353766582243459763325582666999772999688896125166972133417661444567325822111133979975627713596217214449518912676671486749152864497734253896471568425337179572936634823355296539122792624519824694698924313928912137656757524655612291168541722844513287922919625315224637486583245896738618823767734131277467568544665884572321712562371894933237382924149322118173141246138998813514223127541791326584479794148586566612629982662532654513552857348786218886346156581853445881327129379571463515717474967897994672477387741523265658851296823973278465451795698352689278777952583913135774556745526183644884249621797786532932873119978567954499834475431744937971697159758611882623991887633947134842343862393925541195116432856989586448924117737979627428494943165237226121284322615294212153532722516751425399124575855481441786693355676334844722639553332362545989558937462955538351445755938622763311556349534619388476826888529656717192485964979886881358286961417888388837811382175688227653193161416378929348349416924638274935135467246818929492867998415693835528515774884651198949182434841932279996316972999587673393714328989582711747546558738334512266674658498622181726853984318682645692459788915262889513941799458569879438364313614162662967288877357421979538814543219382228664618838176362734689863212112981315984993768156887342989947322539388143778111932818387266434122511817649255582449484119972543778723548558389437893676761232199919892563963156692742791483991777672189883951755751797722771168381547245437226988374524783871861639659896886264695453769145499343492597415471927964737868591717348474427444961574291356795136793787637725543149565763241925875883141123174445658331733158695298453671989441497154582181668757425275972114261315318161438798126332631581119589241122714923129358456422546138533686558289157417631122752615424134891284614485967756392793212636596238652688478773817415958976937725521458262513619743353451861648775541869182631825747668173862954535765232745318399449956996436378162281987192695895866895753839433512348689442312636792767395757554994424867265251718544962273597326947259756921894662945392794566453487562614526422183984643916968841183827828475483563694314189337395151731137729795378674875473476462996844238268311139313578919585145772465332962918662322154695797283249335812684497644955827117749328618173893611217635485745459575937673545339265468685973974822187264381511842842664523525437874317858393591166357687454149383953937797853225812282677328871984939651712614582427145573537133952826248856918224476541862943254232114558572251919669834391361832527333593588214245936289578753116586584585934281293724884958532872757885386596273739778553835511447513753924847348386799639465112228391481926366668114854667319593518374643829853529138719154922745555829821198855389354963457146168925962626929746969788898431146153692781142724853178766659148553232477783159187759572913226813679379266355585841765835472556713572549155214254756753854637226732737898243976124926389668737259341349664465549566466277766168762264977581922763497498857692533989264861554812786676189483466942772823563291488821183311664219695463561458455442965776698728539869711962513585794791945765995717732333821133363629264583976598735222527419123537289675569387423259383782482935488892969477274938974663521665833192882764753627654865774512517211769867173841346334942938864122663523381841793383583869356766749751927828234343585118148696791978935579941691445789818998414155211284265762915646748752956822232585289718932568393217494345349947759555574248236658226431466711135778353287832994476327536674715872955494327812994329369481526773233474734188641433391118741996483473312458115985733152974143924671198683728458939296243653289963777525521112792815636538335112921153914357877134367883834415568687351284178678793216214273894216816619818672568159211974971692148946721574279133288896333953782592563771682926449792672593132511614958693163953528538361338549377739619536977234256866566244872594649135472716138364882874918291672857138928459555272858932271168966713274638874662292516927838514183835664957657672133874371843623181495825979375761279581833392744441633555792752984955143773378623988647521334669252731557772243678236115526634465632519332479832171283658617127625239973745778511775881215368359589155415854382557697922887827828463232852799114178272623576716985497533763544956982417898915835818931351375288441644189399968257292259598163796693451532256975598931412843348118243944833343797548148451343555188246225715234512732916572921186325573993674863273598452632319936352925573319838958462221975645652166593962999581584999827217748422745124751518451985946834116434885246735445955429818955535576155384161324674248752947364689316747524125776556551815512185155191373152839891416797945834236192881298416294194879583354627855453723854249655355984626387534534363423624892321183326145648449615145743667515239246543133275834621267686661554356269347127539661825511242427378133953447333425948855834596635865653558251744954633678613294316971774793719217415311127232191952997655723668365544272878656121599967446768691519772892743763926186724287958181969238189429745863895715135746957684825781729224297933978699117794678178434282465423629681855186783128631526934636154383587788484619266334581935722174863783264474167865361432782246424895156176481324318839236165781925917228446197969152955553733335715676732619926419441811841118152593584653277688826987497239661333919515725442525379389759867815819245526682228393679748832934342464241158964363847528981769571861765833778968285529561395222554551273952591998571519162328452366394627756917538137859993485585587191618355835653755687842564612331752751852158123665283995596426743696589379316156973433182911623348858682134121548566126748944695543792937183826464433314634725963177873113372615863996921374275454353284288828884368427353144163237693362179748519516196588976351134856884533781535243396459333523646682187886368435499237123838669915861671771758826792374883478865448991334959722492218494235175747899978853789322395937964188467343194144847649117727317681633539152867195453962813342936369254272377444626468265176833178528483114612446475313917481128157445213923683638266778947723658373333228191648469578631265267483316864911425755366757553339433596354312517128714948411971954295928577622398185684586113598975242515142194588672512947446678468368714318938923271844624826383843537859438652922995836671546819452344625561841126113588325782542255468225162758538686947186781685483452645319793348857223495159669299527217627633719567668126965579629353319273745163743785447979848826141844876697173722437318738469452232264686972557314294771979852797998927914462586849891482256712711872491121912497457393621956939418132493334857351378764364729785285242891589141734465481777415893696983274293649751671171436866767388637135892673116744553685528262691377892159995488768564918689539442149894652522837984716343282994376745714321525334388914326531964377588584656789195531872839736428161973568471121393452448725277729546285355685449186772618271679714259989863813364725951959195132682548353473923531853113356459399731637971875611994851996655954961622122119225286387613167733683662291286212115722454293665937393777576945397728986278574129927539515762679526397763118973721182286289168545972251281526484683474221397164535863696234858493792491698775832528557543599342869518241712997325751664155474965671974993751388295971815125791626851786485183173722716557786383179568177645462891524823671242572739252884391646767643714227375185211843294649836481423575633514145415579186792626514453864977587484288792871249823839186722736921727862595126124766333546567351277824686642983315594514252193795117195719165491477876244574592918262181938973835111776329791289411121187345263197722222427528572775988953776348918275228612123275535383536953325543673377354726727696427821951632116314473292896281841436298775366416451771393624932546443533249332269428174274643367268891217928255943598423286168382736956498612679891116454987222844175291875555268246511787356465697592473682278821212387139398372416866662293966186687868333975361672151754195297615432619661646213341249766382677335193246171173941895376496885613941753455724935764431563615852819752532388336775774698666129223166388532185371651733169187714796769727239368499277597338559676889272634347923734599112147333458644314631694216791117491692973361674561538816314824656925783895425724876765349847946441324191633392111147962424232525768768639845688618295332329593128348937273735466338528494434815936516281344717926713235538967118766253742585996323325255425526256486198686645885919917478731548229932914148429789469114855728649789223967735318932656916515966143517233281563466243334179564117677613584117539347176498774127434559511964588295175631179232495238674199649937889414579313435175761934721526287457394743412628964463934968538792337521465527615455746932833682161197327376544668919972247259255983754292646572472652152159289554633985382118757219156541167859457296782397272317592264218576955158758646492418684598436819734824222318816556471735378229548465866866389619789612172633748243456635648146887411652896145758974563849766647777378491231876931716696257149962313778575841671137274917713267913978732758994869361291173272332429741141824195955828666493114195265673536223171643912234222462393487531935125383593495752436148321391311524599741972131786151487581923552431799548194874456593152553114647978485132424627221554291678641448754319487976881463395195624287489187718654561349837847786995194531388869492241694269559448715218155726461119446586129145133728216146325457327378159263926298995699987654154455118663851258569566292266514246893313545717267145963327352212935991519636127868319332397793599754731514298667811739453435172286561348743934946788221112793499342671114632916647956817914961883166916777193954329379699131823924974374677848857723255141212259344962554781582771634312754313977752843728646155288119371595673127541864213958285495878888244915742246694313449868857538673834517878413617174636875978232119724227945731648424676315272412441668363755585857984276991957286161892398758397716958987344155265154465319412859117931479799538117944752431225347421124215982238999621117227175778964483275982444249741528195795785336941912649518472842146943696413972245983861953534466934439251681679368763546835512461923932416678151999482218891941382833164693855918928951779166613294621236124327286187466427547391761534946347483117944246553871913645516138979743375584951489563389715328835643558569642585378834148619359758397877515192457465464788955274579716948223386169957668128338815842318263468923612894126913379656943599642836297834876917957832847785187163967147419121191943479477268311759382927257986576774592844716956824749361444971237745778721913251583329633899697721775585769625956336538841856252875467795615996775481355943557316295753973514791345392337186877312328243338461991635636184235935795848657394367449899744526737464379943374734553466334923473287128677399627725727283192577827949351698918897275363774953568687477125358328596266337179174545814876358184169271919694371965987396475656184536957738411792977793554471168341246869545618398122274993671352173159714723678166228722985233229369197233526571752868939937425345953173696776617632966479462336296349125719162858165365713739823298981324868765127631296322797853815272192115715477629777468434228733828842686226149592983684591633343647433138323487786425395665898894622591875257456659674779654422733323952651738515646446819321489571467257334617275153337653192465931253986986993893395484786221793518771711932526397185244795934867556846347235242637631275175897799843374132555111897565126819951943664382417719698522527299779552184161735364427987299528935394725928852856514581415442785225161316213587431275928753222532429369258491761948865479335233437211432955128946231145196599965221423171971971128644794731317227549782226968775837676819835746427118721972569433855736173373751824991471897611775513793884285553226551343193688411278382293585858586894281814652273349316619324859166256899976874469736344958663989773635333956342918892368455987923786395382375739495639693614517827275169224761561789684988234646353391917715944996393355966558939667241352631288249816819938115249281745772546553255294872427894583912838537896537548986243562382817749536294623476159432587425315773467258558696455993929868483341883336974933924268611324358938125583883698917291177247235215835337581285576249116757313966681614361382388151379662317652594571398199422427237246962966199151951352554375375248279151678546984795321365528989664695627958718148288731927767396822357199444821296889324935344732779252593433731627425598247668352841247272471482386341882746531489797686733733377318597563879771515988796877189491742912852291642476879451419111221328411238386575166797354583155587579227138255947481739214256715927542827142835478237891665329619255495678888688383877995288453864511514226392719891741361181216117119644699578523589287813521656718558253421139679948414416341482588771323881117993856643216638648542372197335385639694544358451382797955159872787773475846763933259241777388717348696837585523178281621658249526411661118424935677515883275549642473175256715491329439639459134957259147673438121717281656624165728362533682826744486337351542336961535343347127244973568384836464536531866184837224367837619658857262762154268427951597392228194138372258633127759366735377289934634164342672325698711849362848958223988616432625973476243445173792711882734517533967725137884939863767459175915377364813711949749342189739442988178257791448216171758926165562878481956379823173885691985368223613114261866796511996771744968834524213691622561332532834291787873871956727641431356779878686397947927828189312126651581146193143649548853923844256554463446519347242552482163845559767348184188278279384132618353441933413743733544112967956751773387253321644827962124436984295839141575553963168993211243583451661429226848456491579365257122746364372515657629935869597589764455263282399526216959136295135132356293463723396892248336683321958766112443398739653545539785412813883325274159173829736976996526985844957427891955389518688163567285258529444178338521856163394362518261863718957494765915741972564954999791738673667749385437946249291295565633949374444771938444387946629374629699627375895282996967658645642767814215896751659337577625336799481493898945666686519948727957258527431733329758443581978781735777178125288191468682932244528962989228752177329837762387971689187346741928877541333933411181694768884737786921492342231852666729338288931192218693961412197799135743239375932533613993552738428636121562349297458382721984354759155165799547478747256115467165353875678624278394568683964419248142473158396471351649639563718575189987274985113691176361779445916889436166527954537322427456556669345814418999712276458228575497876261511948992292933482656944333412215437624543642522723815428638429993338347396166299752256382921848582662614453696231571246699827494516189884119832363441671762618755698313867887241289676675164561426396277416513472714879792693417852479314312274124867152625445295836852559572592634792944576627266819759169986872367833781194386971339572935687773615527237595422229496765325219435692296891176214116414614937545737323427469641555828722797586372635338541444532432722164358498179375834276928232894528416488465514584345575475277229168633197733528444282272643239983241544918342928699779711718269258695113327465912832423758259671447197894449214536327887377212239482377249987811675484633863984882987535231176695659699179319229638626624455174617649794723681888711793158255599734127943892712787854563925454226218162237436794376664419744746826129565929963185417953666472195811726145857529779761151512343754868415152343435945364785747194626622838837468131189837774719146548887534552376795533428564636452341231463272432875171214371238968846767751968271856468193944564498196687365931138394982111652828223556787661676341757347864761924112446999162319567456532892596822384253279445487729411393869555369218581572592311684893824563414729876215316482644261884184515195518429589599741981499934772171558321361416838427533437614237396967168235378843313961212311413291463715653588987323532362872678655561313143553133119464283878666691455723694194711194673291628681228612542218186787878449893162626163371853518184596423296828532125935185486466981224367713333574154277998375438669234952418545268719952363361363926933916161435618836978126725695511943947153769194639922699375976726923476484382539537249475763534238521553417277549893912739988832482687467742166356596349732929844449652491146848976226768192164948413939781148746661619948342823724525599467328245464135141377332882316314691951753427821844252858918578866726495141618815522239157511143396214237485615618799925492193877773362475964593614749494383171546868185773646594149144845887165852192654726294663458445727262344863376511894482699538793628137557624985648114328965271381491738652743817512115118392296986142171666271331215486625444796238531143371976391478128154231534681394757895563637962191568959345478895324958814314641485652451844395814165571514758291918332491516268488722874112264652885249414125811775174566371289989721897463316216447967519972231897438516639815329955959162995347153732884118911178526843941252349537646342752534454362457312514633962283663977815834851874422394769918419844695957517292648987979945194448727219587222349171843225847815996831552974339292372139687938824572513767245242293985186818879338237622277635417995684339693484629421665384384576592257253154877246295396535528558882545678427833188825111172256871355992416644719935181464529179267951882497563526247899275341276514441514883747972238771313947167257495928879234197346679137884867616488497749345654628197715875719537522257971766745376821923152699657174553712299212192742996268438558931663412654591965659532251126245184517556331722934529171246293616486119417691198762917822449777679797219495272136283848616779895267949591423872826816954116987625968812273987875947664189639834338116867265267221513834779996982738651161236544575357578967872847876244691191824853756929355257135146876348253315333344996928678242878953216632912963871733692713228161672534597674174955442682939792452997144544389246931479133515644123347343568149512776229994786251984279264931518137319849244817732132145712747825639921298387323674815278328127225793756165391567471571842927363421397413729952824928969455756369866968479895296468961657786893128558846196435624485944339473279269428974875141745981867469754548884774119822588724222163369487532724569677342227194911193763184483621239872365979742331811277412148517265542735659959826346346168328552368261688851369446583963276734598746767911674671164611144848212532872364699626674365125176772597665253927327128248273312219788397427348965847964983421898146933384549188871238179497786971712898337668945415539178734764182484516121187124784633322413885545651795193289358349527819971171977547392248864723839277468165626214196231564237213131289445544479596226788916524925715272397845427825634294879328934742815185583354829725739479751543299462417584582244191681714181145522633776759441727897891772446596181747375873942119147731726871632471653978713874395257691174657188226217953658124581132631916488494764392794949782638425896272986294427989521871516711275219734599494336383145499424856921774142923423646879486252881996757554149858829896789825947346123352457945395456484948715227752514665333571715693495291559235316933628811636616619564176431681992862197589985969314353214734673842898496567634865131981211674447942844786319847835641868186835416426665526649741637744336424482793735581991964332295683397846438476247451632152612871271123978991977945666589851692261889363312667554586118742361614564851538848945636817349798499111727113262516776778852997433255431317341323968118725625284429682584979885548964892143687641823992163722315194275717652717594613575435394226235787713222341721245899846885895826627375894856289568732522655481231515437235739725158851171256888182824136117768132933167847447277545812861965991534796641881483246882254255861828541342199176376363315275451753717258865675313437637468788331764353815531672679693432481686577769469758638928479992983817864857973143674644916555632488826347529941312535221865459892337951479371464998611398354265293855852785649756637592119442267118911276975183465943646851466219376994217295789514248235394649472423934956294841729263449657117397825332851762235332123767166429688468355361444466296493726643985661758499999695927561141199592245874113673166348136636862535396864912249889786461663867582339952881625478398887936823274442319677229425581911192482668816466795936227746724155344927184147111581618642811899653157554756816629383498374454256791844662819132121478692264734761548584438961169961654778495154553369893891441981221923385747928256493883462621515963226149636474818617979565966343483279651268617767386927849747613248915826363236511361643845655521225966559592465468247649353398247131968498719514856175689594445613994441751959762889649153634321769461761853625935124235595195392967259817988226517933276484679954511429952214751966149453172919367545974682498577778421962511498458467533621836135442128977549323451756886489925111932447748346352925676814729992379167826914342987858875497191529236741968486947345958238653568156749311217464427893248541924376171762839877865151276792279952966626784347635699316631294939513176456917479343586225696772283522649172125343789168223524135899829348527861763281946583952535924383647229858863319213925741164789877289542398924342365481417788979238524392151827127564825779396849578635149858562114576871163934737895711363154968155138663131818116834675953413392126571946818526431989336169939933183638665441268891715471637787532936382234299484887424811756984383778518371499119222343611447962811561258688439851743937683981646255266485222726676145476391284485891325597135537323548827534887276219465362921418151877247377438912988894745687762144943581518652647223118994971246929537739267927411553288141965466425134526487857675984325466873317911311297819422337752384771331952962772167173486585493131242251352269541183722331439952969534882952761532313321751612324836477446299865571999316172838294145135812488328431684236215849116773321533788414111543992181358411154359991814788733889131865164439695476251437622181892358127943171656392655476712622443135474265282953727651675786866228164449333145912719866831155997859481583924428646548729488687515935116335683114719217886662565722674775622559936752353941835127226183229434851983227483115431782645551661566988686268797718643123558565668515824322281821965796453189948156789975534596227821636765574678735171317463231968341874876372471718734513618247583891892933818249132437816344273355544884482975315433548543473525547757556862811817734394231145572316393541792161985467759145352375788547498754751877892516122897592757864433688257412561423317161837641721967536715122949543837437962379312192489969475254315633636657334454748762947123374353197459963895674718712538156738177563234677397426641934962628617988385111426749557768465789818474699925938833484844335679153767189884687464824445778726829717185977965349544462137997831893752353667622614852356181954793632367297832199769811927349451368191377244723746621953484426888151884431513588955781113623376674383418639987959113152636739157548947655859483759916772751432229688166947976843476919821639569715898762128111553441182788989349441125226339695825962266211428179491356142899498683952132244223437976363159527122613455571135231229924812663824971273637287429184547587564787594935129236863713299573298181746275529724911613316276621386125517913416429612174163269295387638964482813517286969152317316624745795935811983229336618397563839719615447235782973984489633847451122261781951466881965146878714245156334628683513233344776419969517429182946426357354659598717451819186669451672484958728719587967715727212463412637399736467654934946925272835151543777637394757876789519229969159788412525267893386957462579223787796114354131799319166365592956112787275957119242568692383349821883941966364275335223954899841811469597971625978969197393233123543186161725556719681221336169776378246837562635521843423743589453941376922866132183237612212456556812496571544693483619414934978842374265321265984583916141536617949533695857886132443355724199794577925325537481447562137284434222887965819272733339511775632538159886599849482861239923942572919263537349323329651993263157656892754429418428241496614117128633851187198394372122291319687159317885625178112466295556333637675669736665426597128651762454588326964672786734359117292857464852782995495154921229892395287728719784947486261334633385713652412823951616678787376456149983597353868865175343492223396897244775216377992422352557724388189715922234387287388916926683989571619854187187429138429233264857389845386699297242513118261413278544685269853241865536885448854537875784624461113699511194777559834727372752232136656787925833579232637467874687485484239717672183289431661511228214389445657722956564895157845976519885844438238185755419578194984742181658851377615657248138885851792425554612692555794573717492818481242498437141293289114739748114488356824643722594147953899784135754918244957426474639231765471761851794964294163253647585431536338489863498295884997221785296875616818634469667885427319574715577122222556226193194192166532917497715166256275673676717914513526951592746945686666822198116364567327438413232439287561827427313192183286759774216851815775743945193228167368797615949699636351338585737822359737611881929967291749991211789775392883465323939886332471656569328548274918873766615127177957372512118843877919954783898328964887413274163913521525721733251269139795863224419223262895434732827356312835651876326574443926452357145233569727267457318119783263297348714494976737967443746459321524315259429613399295817871729322195981619341434787163267787267518671552285741832527926699541871157246374565249578211755173688176912817184512211849975356322152392495576918912592997172457733853668372392495127453134822724816392134462333129399879665452835558982342885189562411679183176115234198332671315613988224862744578933762369992987639225546683511536971249794316176641939545188617984953254874289977446462749376729283588679732138378517631658996539617689455648266254737918527927714353195379831528134682246763324323713888848662261698171137899574734386512785473818645656183462725615367511956488731333483935883588449929474163466758387517856525694972795433693927219198443666774327974194485963462745716131512972671617891331889289166958223212941482676664343578741765673252425457548246795529665245815942158478916472252255887971476748495599472242851598888564541129579166198152773395135688723615621495225437796185769914137186491417789935866823846642293452337764258127245815876375933785232893693922247782594837817992629862266246776592928846933626785595945779872513267111969964764779786343233568712374846754633578756438642361271978346398488832948937228651166519446815981537822973992484546782968427226376344355727229142162138835318694296459419124778718567456183332676181988648269882165591461763797147286864564415839129999941857132833312864624372943117666775636554368522754625498156138911455361261159972974173295716185915966395519622885916517242576757842581793278439785584259441446332646363288222742499234627814566769843632491413726832118634956958582818417585149291462646147243445229872231886726539611554964816485188822713287552245415418658192569121234446346486116981732747814478586411456775368286517654366296531691929688838684465457682425339125728742356657243243393343957487933664886291385254769111412792336921562981645967317477784576388631721215117652126467941568249522384653858395435778289595618711836131966429789236478312661363268725616742612667523812755911282814953759383611288272962849531812835578153361369917171686417121714944161954292213572934139813294819892944493512993414327889176262689743917577147415359115946818571641178111833576915217186527319897175696668553781893889297561336348368435615751713396835787332139579859547812541559842681595299867879697119475119649613955772844457762153593319763749218651988711973534848423612738226273718344885436473141225194954985298626982899952976611424675932674343991329579842176542932916737523337672143225996165586928768758175983669281748354331958451259941484151684764451726544861835112647435665384926165281756781484426313748799679637268677218129245315863657452726735755797995734139244737629528163559678153733686926193631697763752252992231424462368515922344241898258236786739236442515763396556724932191232225942614983785853172635414541598519329899457467442145671563479924534856166362566818367444579122178282635747498642459451326111813448862891686573652453634864511643912375331579574219686336355914622653254315132283312879695721458969895233173624584194711621937363576775236337269512484987266913519867334825635595725233827474289856955757451146559781657292896622775298662657979773177516467491648785242832283726792364351774611337827118741517754542234864554842616369294295454785218891397379981729669164149624955811152431382868731692519282332661753656625992623198278935341415599818845348473263664879959354934232596365947247152617355855942828498587373956923131388817245626337529258866872769154749355599584556476371488597298753661523836578761936155938888598818648559236771194624186455517512358585375341181484271883849941999818823948238859684362263323746368189885767827142554822825696427286316922379411137879772349547623537751749615494157263266746382964224621368239887346823548816822149811956561611285626188157466333529845614571589456254126535139154735367397732648229881278311276166834179264711385671916711586446723882639181191536852912417946498293243134177772542613698786111793878754794581285832541448142673266882116872363624887675349523638659425593361523157837668791336294445319961891695551761927711639125729431873614229941397473982227124912627818866745737123761295241593975683969388532178283571657342125726289367736168941913287425456247222963523687421816474665273157382113499135669323281679592382486892815351473181397346652663588941163813373475234933214115135933691644828775252432636657124896122235671696255425554632859896116549117567213119568547516246137248357157518176724513565225278491716733423258747644426987929334975636917361796377875513748949248741832246455587751951387777884488498828746374156577752182752736983465466316697792668335452851158131396645665752684182591646628685696936348148238596729668633893655283649822388672383989584753167376214115794295614748239295931535425254438216742596624637336378832127726813558173514877628979137838258746851147668259625329123483365316415499923589263257141844367114877844342664148274554246553741231223716549691599293159889839197417996511846555562234896763377361328258253654586611187728456995485338688577585566418469911552944446825347814874648634765357913581274833377534874998944113422157713412235512742345294591595393297158167667497867216341658438985234774479687935728559255682921562914732351928719479435258386328738378622478533737217242646478995525976454632754867156552941765992937518155331858311783398476724654734784471129963419816136431239749514246945775199462189582767331729516352748965198237745451773933979541686599522363334452597569516554978274793758366868988942371198683551119743382262648746577813829665118222258366865672374213649846924667918976839268632944564629884121297324453742787592935262213964883593989816279511121644821693442948161729799392355188673374387645169949684419885629337532765189755986244281744738489771734622548698496258951922682993896317581515826881654667587738195492879482477998567437835293835497457448675692139899249472578118873563536944979661481813551473695267189833442918568259528471217193286158556552873385217911544651597287879783115437422179237482141894774673236732847656237835596328978581396477125257889894738544875912952798699538649264943832394566627415548417519555516132369433156435569445712253581531569465734368929784698527995472611394744319733794281734786816219913239588111616143754412564855739866669264597434877834792124599976894267398477986545667618699558154423913728448185159654672952951842892241788889495616599238156985335592463567553994341834755859346235392116894697636648768235925574747984769533213896352214362475918424837738431681432264934591237685568561634811624789329298682945194925973938215412759844179752179367366936922959365448671471371324581233453875523738265714353477122315634756134414831715697139976787375141255139411155951882735633515673512892578538574875222671751966964872964187849361477569363117851528564488991466847317321599961434817321958615993268667182318493651282476524734239194599775257528294323361179362748217861477358896161119391672692875896626651619611539837374691637191682336736993133595717677218436379768922662558892517275991199564934965461876487661895931874346195584149742482988674793867398791518565369657462195641447641586193291628862995397163174324493791883938669972685739786166432284983456357291594179175872197418715199297376291139154339362363523138154659854524157616562817598329547817236155788111737977653747848866994757348961496753292745323672996242574891199219888594328521545734454451158673156677253266848337223539598122656648888267175587275656355488174221772144741724274544719934445927331918112349651417623246182231758718328137252123555667529652564855726415322736379251532794129511725276492115769255424378733331713315275175755896866339277282163377829655966695964242652415417277718489986145912771522837153656373941485543138463798658977175942942742162834529765228475981572949328297497746886952288356431313259368999316967431594329942871738819544566913637511314787327815924456881151717625534929415171666669697886719679391423686318174284776519336148711446565337298819257377635583181638317741492565455459664926555546888546755299982218337591328487832731975166897381513159934376949772474871669429456593593672738931234498263166628512885198245523269887128199326745399558738568791638816247119567336199712641696646596381933863524895337259276215275242166293529129199959399938437628694326288962571626868179566512526584374968761153723116736768711139689221382445459548256464775699688317426493581129971467251121731198854951291677611692965983541186112134444464739622129142616815881877671866764375299353285361136388432719196933567253471199267649846648921942618881413993326967592542515531749599148255843986365415143664424419432782497428958976353241687258848389113669654758235895357561286571259581251939114921337633735745912794374159921556853237311371335373939923468459624489691159255586379986671242793595416282131915872759627946535261349338269799939484996877468594317825913339865563352243492472341539457951331544575772591882266973489483343114683791347933192268912488726741518429754276573632625917212228393813666827777224328798917451618136155825729378863258326977143676414846874278993289328518551238434395678419756145318886822482163989519127669793562899775269873438964751313671631782182369858916175228856135926169965331931248176475977958427411262714696335475165125619517682555731968499211342798649597963816915792188949344913888147536497582884345966192895878725114841267354511144617855397762744578511723865149216918189546259762234496511628341753486994768958598797835897842431886559944433251491657345161879183379789981666137414191552929767959879171788594526818751668152687673815317226853625859368237946919647876417467581985214137947127662726159711734446729797968872274427879125154271183893569634124755211415825498368466447327692764362277711195991429911767253971114879965341178246516938899415571459831174716263653911697871986983876679438589614656725599721142599115587614197614474493367219121925886485968197372861918221857217993257668799746842496213516393786226619654694124967341338196193739546618464372256227585768446784287418269419196237456137638672324999891698117982618473132447235758389153789296693246984988115621978452425614858366989916369673326662912118582373719568984628546716199572486488297935691837429538293777938435198167533566157767536938226813113754763377475451416885195686221795129246629827261753495563331768148312367388338366321589984387915249572247899996298434255927199211423771344459659189877432163979579767247991911936985348759232529281312849488115583442468246563127951881373569318889753456823762631331547119392856771297285548522866692284137589688736698691954669231439511334929513325458872866553272163666418734564746534114844693984723339728532291658418319852348985228158674166123852819334984423659921234341654173338819659186235349975757478285224355592911976432257919973814866649714646535583256989671784895439253292882392134635874359462768566491819884863328448929942523263528194759194381774934955561736144619256776418484272725343786151259548254798287337263971364176838827899583597628912833246632282433697663971592633927634971328714759183424211711684379127539816711866688153829458851141274584764252396426462218461122881717925932428391267565277939392388534378736222172827263452718559881351999277943449647418615115561758287542142421328449644151247362335854849542986939551528614572169489242417728894645532961962471419142949328162115191658386551782255184862568499481733199567229851481872865381966633615538584669172928831421646856819624245238894133438173993829483855244634893981729491426362438447617956597957914419652865681834712557416141956562233689452558475283885218971539483822171893738616988224647362125379568715455219237511912329386576944665326138235573814144884494714343683399356589278649179712492561875964781333666821813842495111338394515862419853112213472293479796664362522944687871873676941662976832575613183791223276449756719583869663713983488151371886344613915631317869631937643223651171388745554416991726568759517938384275832962144487519662824448451847767538479318967768126396322124552372361853998474581333274689575164787617834247216951277211418817216691393479219651144799672149731694554562797165472893934844971257499834962992777712297494527877652499195196432463215742124672951272156944386711523676613943625694358241723866124854786328824479515313988778261416112676572326727291298372477759658339787928852693731369693669235427958565241499164113773798419354584615171563564985896644997451463195842326454151726413986874454614493446478314283639525662714737554624164658113522227157943927263591411827175675386565649795365286592454585213547237981643771882575737342763488457246879879148475462552955966579266769368537173573931119435698199252614117847694814456536915867897372327657888516125455955815716848979769398557952879615198729663224261956381917556154114165311728176455695885317915615279969936831812426422891593376843675359791443619123824785567647693475115866618777989114854848934415749538361749316327398358267735268794883332613594682636657269367487889541121213892855641429365616133483884548937937377374277639218292849644295949341926777153296393152531111441527578368538547835538328763564642478379266148749837475675571335557974358597449263456759214175776192296381467227662534514995173559477494988745435951795121965779348766626427919846297584764591884584356893118839827414741199277922796237425178686453897564771415458946361541267971293615444485757575921853495428517923934741798876283342499877385454295345429173987158783566317423581215757186685963831555987786593665483972635927254799562477422411441294784933185815948285479716778932537726433954426518929378193938359265572816817577474363269462262175981248644158467647822379517255328715168781871862285471951119547672539977468998869712169731778759941372856341279211291497622234223379378827329517783248968113548366446289783514231761821263136394164528292687996151712582888313781943186797255784481833475189493813867141732219427595622834272664353499617117249844896524981453327886572674533527652862591952336686589215885612323312163178793923316115722585947273689481353754464896915838731438414121935983362413589466225648157657685713695382959339931247241733951961126758733467192249379889147728348225377735945176971457843387755495527412133969194944555749178638123836329973321157944722163848255323278992212111466857371864237886448478544156689132273234934862788498891325756432275251321421179684587888235842242968531467318521643731372225813288567925455181679675917989813776796956114581146332896891918627334416759361435914376131763891916257924228435742781148468782279458395921172138111383729941997183972134221471224937414565139419412471599687516655489227144321782755856757243952618734549922166817796379964543359672483977113978827441397658442283634859361832494129514359985934499772889489956629411286135393712391254444439534578487353374543816794349891471715835856337694842257345544376582542821923248762812564742197858228758927586992344678777176983769977723683848549423783311846978265417531341397286472624985193839155195624664194117385648253156888327889114695896918858267614575697646273765396616981826951112155814568433651262352622149843451862496847147786379674569791545833262651244384511539498818557373717416728233631369561149863445316823525392741992817632954597624944921146649131373113385578484429649796785627849746919938239144673513232388825481618321789197732573928855232694355562177261942797545165249265148293562527855559229413355312494954813712417542712774295938677129551267297239913399989391325918145418244792587138254443628432813495287647681479994787196459413541411941233464921962549915619523847328343843746389944571998818531121114369441647389298457613123343442124124242274543289751165551395563673276666297524139222591353761359833277338881626141377614848648218331594856164464118752674915339667932393727854132474948474163296254233753675629148557655946121165417857351249135853282758583344196153149527534723731771487464889393262323711536989759524143914723462284189556244133252759127698583455847191163232299956443292982384433854589561486948438534275454428441331451262157883528761785469566974335245141617799833572424418247654479616169146789726432868281689559451298218977119441385637359639396754884434313674431353934873379756625774922679886428992744593152724294968277214942679229811565689959739491269349784758784729254337446132351915442547264628386317412678411365239165689386612295766634992746488719814466255414594722294988754799698588284865467416977993652963557935879864793498553888139842261864179461895213391929958434437319514387496333911774924812249635942123967324844292213887374797424394929218332912375197219264783513228664998184264793253562599583446418861245356718517265314962487769174248112348365127638719688532433921693383895832676899926631773643115272122491848949684598268242345587261378113778316667269148778248468818775657963534959611959368855938922955427318437517698332756498474983288119633232981936765987518613346758121258871247498857564426942682624833524485263315584311896272599166848174321152771157481573783223336114394392275159586174736365629641343468514672427351868489436998287721142211927932311635197183788524761417929441623857367527898969389443175122433997136766326629327164829372217853672915341763499498842615661183379958878611686324713532768778871476886385413684457292435843551742373816396835929687798243628844748363257845264631932938579736999961537599984297849928942969335231529887911439559933295977796497153379843317746938435227116666635353393182897468873153989796885767471541127281765534382941982398128849235433688724987861637769297852662885797196372694797597264674688586319867376564478379441498774638513961881557949567794261767347467249492929671954398631489146325969357412771211562553336495727954827995116262588329586476275848496662529315984122939964483276377927276557991911257929767764852926963217139689381461192268247341314649221683574268478977134731198162627257872635862276965274847873126619726377272497418446935312229143215799728357963881322595228115486516835475596749795146736327284599747335875649866119264665434443191741329476714164779947615334151532976353834262177391737583565147538144145329369329163728732197177512387464258889897341876749213183933123253499152837565677785375286926285549241822232953343133549621632398184312328577633871822223557956769561545778774315376858942667527659742619569896472988817781772935466475565667372474776663375282965187268897467491478537451592746447343186382934141325675591917735916367439398425235335912863288637252492484111189354818797718258816432268797924171118327574827652342673666557813293215635789774735611512237585816552691677192213156861165788382429137338584765639659969511925118859176376856829231532861122137227461286228458811891697376616673399556113942748587393446297978881386926332153986543174194333533135994488764711611968865771699827424911918147197674731227977144268873122449289836328772528232533875962768599857324281953334275193511515782769292314285494888655421458541165719254411867357354136885991576815235495334616331922153381297523627428755964711481396557597587658411878622159112925231676355352734597777781418941722173169771787144192211212694675782261425381134225944813241966917582179247659916497585982814717771868793151595688268138261557773839158862692531854719721738911947423525361252277118539159772822354788117825996334372276133496737988765329942843237848527637256945568125756782966583823218977482715869359468469311391962293994848939424929825474123543849215998154982497477717736953818127885884887487964762768467178575487973511617465532811843654972333358767394756398823963861678874298836367586169982775216439488454386776353959796297149835662899885334176758439247116728476188469662424726888214575955118176232886251346648359339461339343493847655497918944586574813622268194231497322851829857212375326377212498769888552687958387327661557628952623646284461199871528381385597128568424947961363111313542559834961897523632832786429732955315271935333296573955444495319323865755822263551886225632197535571323715446784354585334985648557696954896679682676393579262785689227953794998286376172995855483894354866979565142933247475858291315434546831851944938116886436638797597166636553292922165344639744676678783993281677171343861745353121867848143653898427947934468261342883369486933414692141333689531656619362964791755855962936598561585728229386852527594958435859375269357564283733776415327551546781444534779663443117615727453547669443175366988719532543686521222159778259849537669656882777415489339852869332455645693381431537937975532735745755744932725615477777934915322512496852883966772683369767385115755799136297798212655831757933528191173157836516682242179186475354935549864621113586779635149324465426853428655866342269716847831448869368585656864361512172432635964722487188895521145486792758721456665444947852128974153513894193562647636732917427677976694956592365474993788545633346273876923252681225578151488897714196961894111239183269831591646611341553842544883167851763925726778714377288716885545518981113378772475461341656948425139699758247161273564277662152789328116272832992318549664356237185869922767663299357528645513792656468844869239836228425966417268613467874823798559912563785658887371514269123923391774227949562946374967171475811263515511571545236854112559532452778478215397678935645941391551686423913288154173263982662472433258123195217617365115732241282784239566385474552611419466477524122432715157337594913597764397645728934453133529524657634877697883477851696891747288569133436689918663512521844294277475633895513765471629692962744217675147454388673141849459258482826684991131773319539138568382686696394636589927778493742271756442466728333826582355635423651567549595369918975327832366615138977629799968998962558736384342817855356492771177324814872876331331792484728674865244961297151162526333443524548189129728787264543237437778138191831169455645296183484177741396683321559287887446248866494747751279947217359317438857817664679949338618192519937477311464514943279357914945591778138866875274892638745964866931198459626428917992356152413282968481236561966526696628366221344984229266595877124534533797514372714854522472796714475575921828438635136224176699773159898615269823758398597115239199835886262195699468583342377178315618413741975939198255382739644347192444252866173459285699718139569683298831212537965687468722749585457289181844172839289155792614176564862513195577687917729414885197996995516236465854234382993617956157776187572978636417486869851399158561777192722915318215444968285732836872465511366297837837123893841755979886648184131859495843865667915573299437127167438287962451724818527367422151552664742821642777513441935713267612826967516945759159169367284841357983875784784849979839965587464931768573886533123878132174457258143355422675637266469381124264479351575682194396555891314245392616935388317116514936864364946542493577447249755358328125566282289399527535287718382727646987367726261693133797988495219293727198855585256752979889897594744515443155981487944771614282843248619448868623848728455662389153371539972334446923746315669138148435753669531988615115771198845894391968728986948487882436547665637834271367948982321615867293495692261697577455816755382621259188561974785837211743593475644361162255754822587577161269399817715593284862263383357531821995997757136473571873867159131446137355795341771584163573793378723375565565577165458377368427986682939455984133869791468291856271499852143913181952454194845549513278722888294464388195778838247594963768432945776795914458967117499637311687549129547576673953379681431975379182735645974129764488629164949389439639666884646756576874494412486158761462587471391199387458975527724518866667783589736622912612675999358938154382242945226123739825282157249228281954236113961647659493997419193254136566164732888513194238239436291375889297396646833153521676315528515425486518131131397217486153347324349971316917578484725693776979472755917416678897381718599855143753438561767989519261654118655714869358711169714788285134651764613232893514153132646685911325458231925785522199356465124438825732552865214138664923232849887148769666529254278187799782519231463633528239449332697159736395554561173378295315189955912732324957483235668772219293713768281253721549994261472589592348764278668961311439965957298828317123497271663274684473285591364842671917583835831179647999574852489938926975423114283396665486289874675652621742423178378664948948165376753879781218814122944711629382573684368193347281664675264721689242968398296869571461697583843442338982646419977758611235168987972881389851768385123844195989858277159718236922734477718958491954178441147191595547399819343831457167692281319317756436426942494653394176142216868632778934356829235214221482239795893625437392438595183835946544247169521522195813756996611443315893481588283613248451232372262657684877786432391623161794528522749945231963218856317549878199588664474827231179959836318314562234318737613546141524856393811144262724869243189261825752678249439763215987573512316937628721254183866472348121484244981947761463427322734217925298363839722617462379919268796855974956486855699988189775653175585139889292697899329447977441916223699624145682389238994152444167356385485831366233341572314243545659398345413883566843826589633594298354912998813692449828698861834432328313493791343868579692856984619864469923727557743144514165254641864361568563796621145788215565721521232291822125677363183663927216139398534341482698868342983882526842487699863241137434757913433464919832873876615686916612934362679229445619665239317854976747786242962642259249117353883979766437746475626618259328615648194188823623751779773688857289725112438924337395875564799849415956954912565347776618574888279773487219245354691485638574753246654947644755319129771833356675267454321763887362863638154675415346666198438226176253345245886477543963855114481693759628393447748839763873914537746662196592493356919323252272613393451315242781687676882593128964466915943364877351823765957493743831824191312871371275288941626565459327721349696396929257469183182716918531527963766293358558632792528158698931843663732334547735969429869165919611268315828735373417586126422135485763789315358613987136754334366643852396919245647425677145412373763231397557125813116457287291689791436972515528424159946669851766587433269417152794166574798833132768912241986299435317547242494762899191719354625795469696368224115313985273529748541149928871469512586645133565441855845986127754515742932559253497532533948145796432185754722977764559267351698318537325539572182755954972843212493492718793737434828651629893251511565679182798911535192453723252376433539811996767456327852159277449331812695713424473783254273914578429552589548573735127712116333722794325333895327864323317165293171421326338599965952842772326721885279692957848611513246817278423411386537462284517834717376523354938164229814627688397818695112672438285767497556215767364484812274543771427714726137798766949793448631257992193966638525613225591115635915936986596355839681976114712241539744767243894642497411445219981473329861714567149863431147557141263639972364593976783838828415392611611148372788827456832794198166666875799444118228415757527761199358548613198633551443657338527142685279745599283824234564253244691294236352841919514392459589883893416781945418551237149379464329125223371369348335842945381485173954525296147972727337198197643347243963224469178978147321563645134331323781455744371552586442261432142985688653824461391915522855484486832215971113962574379733386442193992756397944736385972669826285351913616132566479323774943553131648313694137278423989544976938815559239879825494914433137249639293961885927371566622566513589536385868118425465412489126287149775966831342529464785535649461786957694495588311457762293171619982278445995933275964359481561855484976951572542996962521825748515133421261646837578581834149339224984947955976371694939818916211571595737981376251992151438694396574216989296663193482444273856416682748622257117861233279664745438882778111444798743696598119727725568759244935479231617548299851424432798817159686291118457891425987784819598913694819983795735355579817618235599188132482473892992537596182925478811318953796385322611955211192264632372757939689568526171337762152786749279676816952223799344811611824475949572731827779465311671348314976642584267144731368839349182423576963772312613116125565325739888641469558548274794246678477662341878634511869578214154777318698157472222933852915967547774992655967395291539356478461757518715882277852516464391813199154233998473826218534769566911681524168169348146862585797445425329288959828815749217338394986113379695785697838755176897678499758161934448144556342571499928789867233331461497312534257474148284587733838437897165932571982716439946851657629413987752525832836547863851176758884972914438447444215133426694344365584134338181375151549171527665761592842687588579129448481253516951459247729341526197837928976345758824844254179143424215983531617645761686839835484917131728546495573513869526629434819715178543231958141536219484492996858233935444297431289683694435595657421548715197386889881315838871578852369488618173244717764575178793257638351389794312554721549753339995736975271747246219663824998662213271287874777254635497266249231872398589673471531147178659819512399355643232687224492884734132283424863561431194755328633259486188159931926966172223166653914862731613641381987792354587135528872544772397754371829483867222664647631331289177595791269317778638765896237555534915842823231483683148172463173239242335731168978799164443363647778255681263134833586124142236941616727792532552184524839883418135416346331699563316952371721839298125612892587216353933462787298574859144373614818328143664617111742251497372828578795782824265741196164855344175331251544895254616919696954632889821339626336991716464187657728871274747395352849722466457732132828285683376262846571864233624752668584123138357473855678669526435795171828463755699364446185511493427591742284182682463915562744554982124462521717665625296877879642145249858949539258676771871965559313138189291537133155899451545531433322389248696952619525788487696529861797793632179629352715278743337364514732132624127175328113911386379234999798261256829593554451632616622133985459533871442835429977726797393125427166465339629784665813568994373338447533635839832962643552894825896484652757118951449771643128462248958573724463183813849664616898433943113311772187836942514515198243349168935484388367765972133141622837832443468443318132185243393119892783448287543961955789516124927258995756471945256713347157334458871227923137615547122525442762979917421784888462742573941811731193226116164485424673726278364432176246865565817221426371579353162494158389584855728795288669472228521227582916339989257266352372882635779383215681589821785795847477335435974513585769625615999526193488672871285554185271331447372739697867878823417592222257631737225381599399863227756551583519316671369764575765597531344121594542365838726826467796363877724983692563662728352713879772123787469121794875789979886329459554263884524211654736563254279858288117811327694718317667861522136359539353285456174623588931569933585289559511313484927793238177992757349319517577918827565641188677191283388283355644219358194629259823276158574218295957778934478374114478751524388478782934533646186635523155534588363782875723569519772941193552524829289696542563665184646932359186532834935871487122279556473182491473488851637625994369627846492581998726856499696374499264987391152383682195157335974274585346321363559737733863868488536172444288223776148656497612296315883496625949674914844549171844148696949331232965524767533969348647989242318799574754246574569952953275149887336667325639187411812821829125571814545679175777225387564825137646878215956528485141881447878359326934454951624827385162479844333555526492829435295139255186624861384219841993543643875166347357997674821311683471624229674349965356345752234893869966372427546455784249173515877353682398141346331838845618291866755847246793335435839134179398487833688352654858984579528251663114841852618365271628339811564386539813347652252433684726118488889894126195464498775954935727939194815566529787963174743699217863293388442595784767489631785334245298798336793654398878294536512597389838597673179748136986163851464236716769189245573719258116865193591527396964969989175534541646237239761348122542217573868359861398657281493994688179525231651153363157666529328766849174224317777777231672551978737723756637284749584334275835189128745683755239935576295734736136351946421286322361254734717669381272796495292351718865266878393253412917193254262548743477295645622926718561849668936222555427974399824327299311228814545939213544594324781582193565863287671935456671279865495784146351779187845853855538594245367551156116187278795533331849663484122951974467185969754659644788969828326769589287777841282496337735627494466414125372253995131332727861421684681271496226496822637497923359815953333162393871784227349156689787849652153419123225482319938737538518687445429263539495223332419349344242811259454366545293158642137885232194282533646744676337868668485746761317235816964711248847232847145951746811772341471925374951423467882949841434675214142665482562756459358562136135912918348546329967788824658987898586389776952748147672643352311211284657285671525372837499254266251459853962349621973438341157496797636821827243972853158563548735572182666784532647839572799188361945645668155548437446578647468186413548245962659233632411942565891763856937671825891975315696656917711222515741815774529918141817118441937416439284659672314396133328195289269696429629213125472263513153271992873164275152343431265369749619272198418792681911616773418837569596375514525712277362964469864215871186251355184898832153991476859611189448718997553555754166791333538456471319173626927126155317958162239829882978494487421417569575719789183756156458864728823765998857746418418778384527771684996489584291584417794888985714735852752643178394687795463199991731537362461219433433435682452326356132267378653195739935312544474845336191374133878266692249583253281373138546414215143854792381725952347931155814644485612325112795821924794455311751919315555285193998419735124153536463256534554734792142994354797561924874695916878141559232887266515493545928178551447654497793477945768788814722344892395182436742344237188185342963773676973984614851279333119989552313159689538471639788723493294467523136748581294966192531547898619626533928476669638938328963575998521456643476736839721158562132251785229347396131596118491597537793458782514872747865674823996858945238836572621683355874183861694345539831534987296797533426324634148285784444974552656177932897224243888564571218147844954383271578595373376535137422456838669589772156445417274873324782318432182591347183464823431945698375666323455613452598126998776232937577418588188159812645167639595828855464259331495793212289993253812258224565523624418266732319631473369324927454575284172735164868534943987425228529438543653436414126635312243753617656948177762219995638355958894543923244257826774133469157249184961573577797293918982675627448653319784922346379822613717198488172532647279139565844819885726257461463948519484769263535764271184646183171271386837569786761466369458548826732315133312358411197441624555682598794195567252829719724459164947336468247347433861681677185562694291811512943525971189395235686755113374133637159134427322275147747321383549781588471255997161229217725726897247334186888138296761241729657622912875342949753986788898393992385177869717621952828111121927928833547779297524992568914414877518252663682718989877336595581423361423492636797841884938168466972273895783264254618681191547335934162544379395673414914141674537652155842592178669223835151117221422879479262837371952895513782153945298746924656512393567569875161425749748834376386663556936273188283875379161731982859935298387293742435699388769936547465179485193483641292228813784212558744679418337174489179529133345111428431254246542881757772344345961591814788194717649976296958765292633555533691562266255318652552216832567444993935683937921621793378227152224256681126498186915139347884767166154939648188933811513339674669891883518742874921442659725446517472477193451649514725155434296726329498517322369388925717973446938415327762419125241921886595513186712627919841343568947186642418598728263784242226692738591125948981589449432218666478122485791741954735246422323349851454531649298261894966142784544521287946885216583619981638774589558237813323634489713778593988163959288549592679373998212684531951553377199175265569862248377293591944559257748893249778665584676182714114971339784245618794555117765933123292672869892725749286158928568363863221715517228136754665375398835548914133325232999156265163821266716983115197372526933893442555843972879919651587824617988158941757469666344829281799177273529349286287691861244641241354365672925513679756932475113574177425151716554128556167779844151722443431573478266883478669172853749426961972559388281143764129948556999738592782152888591648661157363583931724421239758364432433139287822784169622879979477317931522574162411262999492794865732858583982115864332351278995366787947587253234514525611853541379868311944336776139844272941478553524392946694733865195269424651294136593513698474452242211268656491387295862695165644573991635616636313217742185812633939916444712229331857336595633491344258814636267364945257851189415164772112241991327537447413491772674898964496472468321315691459874369679983752675239462219978524266239753762891434915439132743973838332761289669369491396551612354145626521764827127462594526431192989133479135463297396752975113519394653961219425691474943891729816146439981241839153764217716887794786251821588179175925297874318576664567569894131898674449492946313213199352943498418513248643519645941813915241975866883592299313971856568419769782315179479786656579929686778478916383547667535944698966354492165435173474112635573397451242676189598344115675743929486581336982586279239267177889247251786953985224741196899323379972128656711662328618474988535465618942164592494418945461836549546173657836458357833739497847854539267296524792169534398167368819374542417182442167988888667386332675788443786637137583298288552158357194252192181967768369423115473655373524891949955979158167726551487653247429726659665718144652537315676634589374158655443618726744956544919681576745817274939882453629781247467887575538888543738677747192949269881385945662882747539649882962898895263528146735812762166125264929971981631942593865266552184814795471381443466665728744612247623688884561138183389868284581529461656427997926292719491413316994912969568821142823741174161846723682672873717465668242116127759831784198592741888735612548221163399477282551539127537975341766962953873578864812371971178699774641787564295743386593386673276558196565148115857382888846575938939615843425221688397455747248651622799248217344356892779912562322819922347384783228819354387342895792515226394558324552943351571676269539439444362256133939287276588986172649354437438629391937858469828779682484653114127416694684351841781845525755278616612619681448789487197996935353914772781124161341579587942332547538171474187858135833322778465955295421381261387793431619181881556183894746798775936217328768567122884138719867493237119564524551627857226967132537624711588598623476822783699624432491159487536361148577513353864882798915295591296823743927244138555688673828839356981695296674473522283392623213293272692647662615996563452557699298471685764864333525139534378658278168879257124175216646265777779529491174183854284565522814791258763788677957715937238525678915123881958748586195184737328845457866933475977427536515954233979191586615715832836714596116244581687462376989479246235338271599248799189959863253813786149625688551612848723822941384317459493892944414492221755746417392626628873682642998176181714292885632223185732243861331391323981956721666885769586328613194186294338833723422596874714376229851225461675523473782326271424324465553387362128521368795312297493383552931761684339984377866463815649653875182397461894892521628216954782487969361747766229657286626892289898612979569654848122835149385235631236398619955359963337679244718219168413789664469436817235929289188143884395716789591474862597493263615737281293787862522934985455322421271995332896634271151655667247654479523256272537876574496163369699849326923793241418829647918668583363951233727397782514228945474382862669541857375116814259889146337399287472738325643911215585847176491227778245346225698754353436112247841491525656518421736824559724745899133311277657958523189146125674254869762295468721649834562949781775813655663492841626972995431312876767365288928745178933898691695191592961541521763659872533374993124222566171524886239553878565843523585787447517586471473182512665191562678772384934569776989358939382462423189643685642637974212125823672425537719614792331374634363535392325577164362791467115391884129493591956156526291253421213338572835724789573962657775587471276512549127573923656761986882784427713818318162841975842565775313772288946645516965577395774972863928813513165229124816172836823651881389377815347397589757754347922284876952144876676674623995993268546837273619381577666789547927824118783192781415542294418372817826994611424415241837938815937892798958163591196282688317436466332626849688267711128682489465441721692611582157591398498137739421799168539235319644691882184721283914733725323558911238764759229546968267517854321937453129829449447877131939487167778839128932864837154279535976123135214761242493936878428437389747624851612813763564372895714133627867971389334475668927364336123888836361231887975182653815749119915915521356535687362353934814346241336735619777983138289968169263617434158589461873983487917782614697551734811463582687689271864755917888485214935791888122222572512774234624746341514822295379369325269838495292685134822183487983211752318431983235424764437164126714346648389424579318443378123357748882683284164619187371221449152127458962717947143111162869713476433365824186555624356451865544231323639779274487715981229826698779399224883762199594819573661431672743427767599237532792967278179899551378233413558541727564742615143653169133272364932485979652439928222528686937623517115693464415531143278975654794383996858813261839944335743196341424268322839461878882699466364233883327729227123645641554381651533362452382838714414248813295384439739549637782362576757184422484331314763265854981376875278187267718651997287994412185284466288344556268481999732129651394816683282153114995536499442967589238444244163768989338977335692666487298738817384635125571218961357995814934683155724499494327628287579455187248235568975863595759583131952943458338379234212387569882885472266783827392786521485883736457844951915118326513795735671963849618152228576176589742417762759639998877197231434445939563684284337985826386438565226189325217228688856133582849158699543646796627819173258445788664431893955772277198721158224852564511536937185279841463442132788145146147618221769143915326391248758533975698788453335445636124273573875597896277359666977187858318987257253929985411686913427735686271255628735383277736833746537965716287727723347953877546125547454784921761335694253255699869652921461127757948539584982643817737582982972659233418684539493394445876899426922266568959944321421714956268545531993871268848663891277967489269584341456357754366556328175975231121893894165141129992429516746346228314178914284728442188739659784645488447877241377163547813616176181959875753194631361167946584854927276293641212621174644692398636723114955823696187874979343179937298675594529656214436934452979422874688462296959399661868426632587625923223512149335932228398769251184523827455158149544754634796362463557622439498493445987941442396893735173397685725796662927786244698111323522634135185716889439333393877237234641159196494682329889315296299556899728936543857242978462211136652232268552694487251783261594646525823521283885978686549522651693418152558862493866144135463142126212461227514357923728273637132362689424471929962565655773795932857318132757123775829461877121671831647993167793474623634121869984363625298413463328989277925699861779939336229599476555956742668951244534297496346895118219455895982373869451378793498695691273799464284559521222599662268844767559799356995196452612698222624724198762137874419361159567761988914163676471716628183195264717395269171859318639726124996911781958631872985526278692225487687881544278114661685599769113985492574882257789656642341791287866797289723659625111966141374267579398386759445674549678519876471269884473765176874162614392725773223568478267889932656316553396824241132173676617414752717986131418677498233111927856394395719597725995487167526298773138282115728442385258927147638117355678297153334589751656442834667429612193648139667379295636956889934959987568388628796545752724796351562787482942778821134425268411763839631443798644992854959823648939418934924244152935117627921368736649421478658591986465425314422718885839428267674588679227856519398898413365249731218725397751411715846541563936381787168786352212792267596127383434261764127162529588951473457444121898914667964291548982747924278779345512274997495284615976145731723961487113322754915255466263656555143455938366719353737717344734661324379797813187926349695933542125786149535625849868772373835677457754183597445884823584176891186691986681714353879339284796585851713899668638635138568692765534521189681719473741244517238956932294531587969152639789162847331514334821229353179823322839471465974777445955889558959377388981951985924862417457955256442652318539724497725681317219243374415641339481857374985657326173433712837586493438123121445773954245495571982787698227254548997199543698915762775446337461866747218616169861994436386963552168966583153841173242918227757192261318216979344546414511496388663556458836998453856319962931965853319878442991527252958799829675328241381215994575225117638773187436816123283159618733556154845961177783277969831773696425872345653118981246741419672675615689188584174618643596687922261736212444186156831316177895457835891482989249289344358292135998546126675614338329545113571297723149546633246632547711957181436535512342658214673354912344815352359759252616367335628461284841787582117258331487565772565124485854222456714564557321954217833256754162395542922793339254951253312322169763458839726944112994979915421836274384185765423721894833773341682921483282439238159995695372313914339446169967111319957179772775468893653933462579546539568593458276445334928112564437863586139368273381297453255217923639117476283998411486377592328283564369872726551616284412175474377878865254316479949857345277512622213441419168292317162421835712234834551332627469867792476364187219455389462389671686954148952185349369331145879877213752129875923196937654854878246571616355344461775399889761513757671339279175223578896623182924163636287612918639189434857763349165272775352841179982346738353556385521239525835818734666877193715675963556712333169883746252141329613115715642792625111843429132858481349294121558143774184857924659521315483316714876423979252724284623811954524214286933241765626374851817987314696235654472747619624343419846659396586131299355785611745951477666659959871743976569358853893248776688261599569616464249867629253945985226214499534935297588371647367987677849342232728889564494978856922856261799186857622531322252569321342754745321266759617655777224398214494753794382897587778432896377694929814636169954726868596692554831662274814471267571211766827984439812416542814622864253224623296211532677923277949271558655572359249567399699894841267765547485886892743852312344587585962594383251531982798951351564584538448129637291995798968519832896423457388837297191935847751863717572653445487319862287868657966615333635292612163217974874528468282621612194345264469649365728445342147293641375593459782182743826614283865747411252141211147772348652924238342531682257787848479543555297378484851977749588482455649564924953381792376243374284512868936376874897916329683369928362352833478743481985383358571498484762837548518573288737918649423386411274512392431121243761938176562551546299275383965775252889446579157646715443788769621125759286733711169614664997528735352645287797873985969735277314286332181686563494679843361432732742138499195176422117822684881481174252829347367341281289269281915364322496234364342792524293738744957696865497221334948565694352581311936794844836417972192344351578245522948951359214259176516953833632465398318583857878767895436557692449744877196643565891734967964959934338359179128645816354114243741375838716442882899625973769252327668265221339525977584394541613699948919616828396697829846127958345378897168629722581837724587563629524518692587563937326395462692378655594885699656351875727185643112267525612674515299538263942356155657436417126491398275493793878759915168432977691998123581561497139878352876467773375858927889191439667411646424387654444745672994473634986591344485584478682163875985563964555165643288221715393489811218686564374533749642433996183366558957182822213533544343339482898644822481194211276551121616799867866715317631567249222224455264654942638639676938568176195123936438881622258914421223794552577815972891572389384378312453544156513266725451998375229936636724791785156426873538674894219866368583562837691563479394465686482766248532842661913393855189271964746672929939434169484587737252995527259216471638869273791543718343635361965362177278169324723292783989454357269113549685731851475663132122357518325129322735549828276569611961647255427347293144533471919781475852757848236796223868135479651413867678947361839821249144974944413936542276726944413356332927441853173395785911746771431846612913793838525139434637165765824793746632632717298218187728844951459924651126558572625744149551342446812485289594697166485916392335231265234283961683499789271137896221963572858733281914346538184443631798463868798852379488267849661635419451912662993567746654969382913927972757891499996542341272889897263792797763756857995694268199185441921418792422718878288694955673776676122723729117651397975259884185388584158895285398438718251545232386947833385886585484315697115525948133536324852987646736762121841145554636263734232488623184273275922891763979934567713587817348479649718175993524346996797613728268996172168611223562992529145463511616756588414256117536937115649927388672838261421893529659134382232726894325814186315437725143557862316551964829456772365241559471213626741126411798576427293556915334439212451269268961669949963754576787254532897567654471978839393947168363774878987125855383226915884336346594914995737479695531596558716875466969466126612165991986729966895832663441144963166372262228178195946885699974513367546233711454727327165117314368134468328878398685338673371149217435158744962435462719162132473147997799178123442911361215942521137722268662881739368779484816784778261553661761367244313356864129271423949329699348137466261422262464762765245864562475689984352134184986247698616485366441757138938881161343528336227786918724132133255197312791617631171148213379795194219459923918555742126727994347814715124845463548233847954669116925491152698355586511861113994744329384829184153416473222632183145372145333712941788733214998451248144313384628699579465186966389587979895244219574248213263911445235159974733753979497312563636583969114697642538114183647553943179347273668531171465355176438198881129128398432987664828255598692952531942991216665211124299423964988683997749775875123377911433373181586934779952281977739694884699992533285654114267192923573972681685285649588739587422648844134682454548947751588721227795541214331664993428923437728856277723923345485916431657547469317129719975117945543199658217175643597914653682968752994442459267391764472147959912324822581711661373678513931982851937787748732131332448878812484716119389745119716193799396817234271463872389376942554829671248681447827272666576477639991359852558813459682418115512547951113759147363783537674582237447335316582162975682532878173877148873628398378366137676366894491162234623175425957626222659842244383791124446811614499554963511744255166522278189827941746351134835362125196935458426941724219366891596776678893362721972959489197711674638789111424989578148235946454532332213777476279889165443352687314393293635242772879783842856743327827946364879877576355982794336185995766419672565584166728489692177455468525465294445647243838516412378421164114782552762525937518554281521879154681415179694935453938748769966372588976484564852562157827332467219647464747732167286671815382532899379747276698459275177163579872486932838531581388968629546555648662855254694732133994499999689744715895133543839778783566611536178642617472574539374731777378214833135562735757435244779225317571865642314957748349727656348122649396154969411194437582553999323667525684515629793295453536315953488457499136484238194223682162729458591841224569664826828311512625625829482146777151875329946589965683741791695599124381194737416598821862874933289465465299257932648887759688699678422246335178945141693797923417363326274118168582453994278625323889586898727755675861424436853617724869926289867285241345688828194119182795658387695484469744342642811124247454229533999324878595437554689598531449366761677827773283948334797437563112635839457742484144143657287682417748536383485818465486955871326884921783381242167942519935652982115833355765567933678679941877964119958314737623469977692479639168679824938533229146712499594127898372355677698568426985543259888215549287242125435317884112371336192991131882733543681254522559175316827362913244988181845674617438535985351532553249894778674599517971539835456832789921815278345369573961678981886312282723722443254515671319287939111778286831959951416966319614648397536355532452187915594223624959525562278989651781184386963467439315288135376511956427336152961972986297752194399528899614848432334196846739347489516967494859881925569173442657941154118877415259987192686751836869232163575872412483629743323817244614166553393576597426156221147331349889111636918841323397622541772139464383227318116277754624479178831191616392493211919214677167428745353113374789139151667432672299769632766532448883583378924951488135363415437126812377717727496552967429326179332245317516232852475352821735475779272113759181464316368577456142511936493972276323881269293338344936193117979313642667772257373868558792972864452545281233628188399351878731336316227718761744844277315254196339518385383487772333636153147647927437357351913885365874454166913129549221126822251174729731272618834728568392719574328812714393994388732474748536744681631897352962121141738241582979189165674539617537224644684777683392831244727523212159177344738276152383913991251589632626686428847662513232443783589154272179986354484282591894815767491949269425885259644841578286533992749243737822216326548992563492597415954521167499295168479991525157558272932223945398217938931747186766276948157966587971332431195812133686272651491694635764576249413672997135421177112173125211964924873298679416839392598277847557223466941562943874513674575594416867671432556329931773558569555988924844794711973794576846836256956989427645635442691481967986262823541328961978992354847246872766181244859952388666848116139255579734518249523627994451329198598359793924352157192713872887326668279779947253919258867287369822768494161845284558162429648389536351633874991312723241635573657324918552662641398632878425854624457928576892943817897914481661184917438755466785599951433515141333417942774759637988373454443121999155583258836725915212398573762951361524711111424761641115965641729987363169727436934846547251332462172117124222655862123124651177352481692653244148452163446368588661876982762721124541657472135193726555196994366598534381312274495433953894459166288668795335185783454384731186662745141758869217129319395192326464845466718849635619822829199643212371572927217731645276244216338269592232149847257591875119575881454333414831172698617259295649535553981123774528347974544175124695444324525414926449415466566773557123853499422888664816882274383428817967693346624864335162449742598446261587746356771843161586757651579619689677886816453448525469572531944966958214167868125376717425292536744439653751273383414867642969898339548614431693232166586852558921214875929198579541774339169787748863116255826872894733995527253426764154863523666347532822376729572785629184665556677292388141579559942832767423258669735577544932549444424856616969346853963299871468361241611112746\n",
        "output": "4854625\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc164/tasks/abc164_d"
    },
    {
        "id": 653,
        "task_id": 2242,
        "test_case_id": 7,
        "question": "Given is a string S consisting of digits from 1 through 9.\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\n-----Constraints-----\n - 1 ≤ |S| ≤ 200000\n - S is a string consisting of digits from 1 through 9.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\n\n-----Output-----\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\n-----Sample Input-----\n1817181712114\n\n-----Sample Output-----\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.",
        "solutions": "[\"s=input()[::-1]\\nalist=[0]*2019\\nnum1=0\\nnum2=1/10\\nlens=len(s)\\nfor i in range(lens):\\n  num2=int(((num2)*10)%2019)\\n  num1=(num1+int(s[i])*(num2))%2019\\n  alist[num1]+=1\\nalist[0]+=1\\nans=0\\nfor i in range(2019):\\n  ans+=alist[i]*(alist[i]-1)//2\\nprint(ans)\", \"ans=0\\nS=input()\\na=len(S)\\nk=0\\nc=dict()\\nmod=2019\\ns=1\\nc[0]=1\\nfor i in range(a):\\n  k+=(s*int(S[a-i-1]))\\n  k%=mod\\n  s*=10\\n  s%=mod\\n  if k in c:\\n    c[k]+=1\\n  else:\\n    c[k]=1\\nfor i in c:\\n  ans+=c[i]*(c[i]-1)//2\\nprint(ans)\", \"S = input()\\nN = len(S)\\nA = [int(S[i]) for i in range(N)]\\nA = A[::-1]\\n\\nMOD = 2019\\n\\np10 = [1] * N\\nfor i in range(1, N):\\n\\tp10[i] = (p10[i - 1] * 10) % MOD\\n\\nfor i in range(N):\\n\\tA[i] = (A[i] * p10[i]) % MOD\\n\\ncumsum = [A[0]] * N\\nfor i in range(1, N):\\n\\tcumsum[i] = (cumsum[i - 1] + A[i]) % MOD\\n\\ncnt = [0] * MOD\\ncnt[0] = 1\\nfor i in range(N):\\n\\tcnt[cumsum[i]] += 1\\n\\nans = 0\\nfor i in range(MOD):\\n\\tans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\\n\", \"S = input()\\nN = len(S)\\nq = [0]\\ncount = [0 for i in range(2019)]\\nans = 0\\ncount[0] = 1\\nm10 = 1\\n\\nfor i in range(1,N+1):\\n  a = int(S[-i])\\n  #print(a, a*(10**(N-i-1)), q)\\n  q.append((a*m10+q[i-1])%2019)\\n  m10 *= 10\\n  m10 %= 2019\\n  count[q[-1]] += 1\\n\\n#print(q)\\n\\nfor i in range(2019):\\n  c = count[i]\\n  ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"import sys;      from decimal import Decimal\\nimport math;     from itertools import combinations, product\\nimport bisect;   from collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)\\n\\nimport numpy as np\\n\\ndef Main():\\n    s = read_str()\\n    dp = np.zeros(2019, dtype=np.int64)\\n    dp[0] = 1\\n\\n    cur = 0\\n    digit = 1\\n\\n    for i in reversed(s):\\n        cur = (cur + int(i) * digit) % 2019\\n        dp[cur] += 1\\n        digit = digit * 10 % 2019\\n    \\n    print(np.sum([x * (x - 1) // 2 for x in dp]))\\n\\nif __name__ ==  '__main__':\\n    Main()\", \"import copy\\n\\ns = list(input())\\n\\ns.reverse()\\nn = len(s)\\nMOD = 2019\\nm = [0] * n\\nmsum = [0] * (n+1)\\ncnt = [0] * (MOD)\\ncnt[0] = 1\\nt = 1\\nfor i in range(n):\\n    m[i] = int(s[i]) * t % MOD\\n    msum[i+1] = (msum[i] + m[i]) % MOD\\n    cnt[msum[i+1]] += 1\\n    t = t * 10 % MOD\\n\\nans = 0\\nfor i in range(MOD):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nl[0] = 1\\n\\ntmp = 0\\nz = 1\\n\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tz = z*10%2019\\n\\tl[tmp%2019] += 1\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\n\\nprint(ans)\", \"\\ndef solve():\\n    s=input().split()[0]\\n    cnt=[0]*2020\\n    cnt[0]=1\\n    m=0\\n    t=1\\n    for d in map(int,s[-1::-1]) :\\n        m=(m+d*t)%2019\\n        t=(t*10)%2019\\n        cnt[m]+=1\\n    return sum([ k*(k-1)//2 for k in cnt])\\n\\nprint((solve()))\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import Counter\\ndef main():\\n    s = input()\\n    n = len(s)\\n\\n    amari = [0] * n\\n    ketaamari = 1\\n    t = 0\\n    for i1 in range(n):\\n        t = (t + ketaamari * int(s[-i1 -1])) % 2019\\n        amari[-i1-1] = t\\n        ketaamari = (ketaamari * 10) % 2019\\n    amari.append(0)\\n    ac = Counter(amari)\\n    r = 0\\n    for v in ac.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\n\\nS=input()\\n\\nrlist=[0]\\nfor i in range(len(S)):\\n  rlist.append((rlist[-1]+int(S[-i-1])*pow(10,i,2019))%2019)\\n  \\nc = Counter(rlist)\\nc[0] -= 1\\n\\ndef nC2(n):\\n  return n*(n-1)//2\\n  \\nans = c[0]\\nfor k in c.keys():\\n  if c[k] >= 2:\\n    ans += nC2(c[k])\\n    \\nprint(ans)\", \"from collections import Counter\\n\\nS = input()\\n# S = \\\"12345\\\"*40000\\nN = len(S)\\n\\nl = [0]*(N+1)\\nfor i in range(N-1, -1, -1):\\n    l[i] = (l[i+1] + pow(10, N-i, 2019) * int(S[i])) % 2019\\n    # if i%10000 == 0:\\n    #     print(i)\\n\\n# print(list(Counter(l).values()))\\n\\nr = sum(m*(m-1)//2 for m in Counter(l).values())\\nprint(r)\", \"s = input()\\nt = s[::-1]\\nn = len(s)\\nresid = [0] * 2019\\nresid[0] = 1\\ncsum = 0\\npowoften = 1\\nfor i in range(n):\\n    csum = (csum + int(t[i]) * powoften) % 2019\\n    powoften = (10 * powoften) % 2019\\n    resid[csum] += 1\\nans = 0\\nfor i in range(2019):\\n    ans += resid[i] * (resid[i] - 1) // 2\\nprint(ans)\", \"s = input()\\nmod = 2019\\ndic = [0] * mod\\ndic[0] += 1\\n\\ntmp = 0\\nd = 1\\nfor i in reversed(range(len(s))):\\n    tmp += int(s[i]) * d\\n    tmp %= mod\\n    d *= 10\\n    d %= mod\\n    dic[tmp] += 1\\n\\nans = [i * (i-1) / 2 for i in dic]\\nprint(int(sum(ans)))\", \"s = input()\\n\\nl = len(s)\\nnum = 0\\ncount = 0\\ndic = {0: 1}\\nfor i in range(l - 1, -1, -1):\\n  num = (num + int(s[i]) * pow(10, l - i - 1, 2019)) % 2019\\n  #print(num)\\n  #print(r)\\n  if num not in dic:\\n    dic[num] = 1\\n  else:\\n    dic[num] += 1\\nfor ele in list(dic.values()):\\n  count += ele * (ele - 1) // 2\\nprint(count)\\n\", \"from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf\\nfrom itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement\\nfrom collections import deque,defaultdict,Counter\\nfrom bisect import bisect_left,bisect_right\\nfrom operator import itemgetter\\nfrom heapq import heapify,heappop,heappush\\nfrom queue import Queue,LifoQueue,PriorityQueue\\nfrom copy import deepcopy\\nfrom time import time\\nfrom functools import reduce, lru_cache\\nimport string\\nimport sys\\nsys.setrecursionlimit(10 ** 7)\\ndef input() : return sys.stdin.readline().strip()\\ndef INT()   : return int(input())\\ndef MAP()   : return map(int,input().split())\\ndef MAP1()  : return map(lambda x:int(x)-1,input().split())\\ndef LIST()  : return list(MAP())\\ndef LIST1() : return list(MAP1())\\n\\ns = input()\\n\\n@lru_cache(None)\\ndef F(s, k):\\n    # s\\u306e\\u5de6\\u304b\\u3089k\\u6587\\u5b57\\u76ee\\u4ee5\\u964d\\u3092\\u6574\\u6570\\u3068\\u898b\\u306a\\u3057\\u305f\\u3068\\u304d\\u3001\\n    # 2019\\u3067\\u5272\\u3063\\u305f\\u4f59\\u308a\\u3092\\u8fd4\\u3059\\n    if k == len(s)-1:\\n        return int(s[k])\\n    ret = F(s, k+1) + int(s[k])*pow(10, len(s)-1-k, 2019)\\n    ret %= 2019\\n    return ret\\n\\na = [0]*2020\\nfor i in range(len(s)):\\n    a[F(s, i)] += 1\\n\\nans = a[0]\\nfor i in range(2020):\\n    ans += a[i] * (a[i]-1) // 2\\n\\nprint(ans)\", \"S=input()\\nMOD=2019\\ndp=[0]*MOD\\ndp[0]=1\\nr=0\\nt=1\\nfor c in reversed(S):\\n    r+=int(c)*t\\n    r%=MOD\\n    t*=10\\n    t%=MOD\\n    dp[r]+=1\\nprint(sum(i*(i-1)//2 for i in dp))\", \"S = input()\\ndp = [0]*(len(S)+1)\\ncur = int(S[len(S)-1])\\nmod_10 = 1\\ncount_num = [0]*2019\\ncount_num[0] += 1\\nfor i in range(len(S)):\\n    dp[len(S)-i-1] = cur\\n    count_num[cur] += 1\\n    mod_10 = (mod_10*10)%2019\\n    if i <= len(S)-2:\\n        cur = (cur+int(S[len(S)-i-2])*(mod_10))%2019\\nans = 0\\nfor i in range(2019):\\n    ans += (count_num[i]*(count_num[i]-1))//2\\nprint(ans)\\n\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in S[::-1]:\\n  s=(s+int(i)*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    # print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum + x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    # \\u5834\\u5408\\u5206\\u3051\\u306e\\u6570\\u3092\\u8db3\\u3057\\u5408\\u308f\\u305b\\u308b\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num - 1)) // 2  # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import collections\\n\\ns=list(input())\\na=[0]\\n\\ns.reverse()\\n\\nmod=2019\\n\\nmod10=1\\n\\nfor i in range(len(s)):\\n  x=int(s[i])\\n  y=a[-1]\\n  ans=(x*mod10+y)%mod\\n  a.append(ans)\\n  mod10=(mod10*10)%mod\\n  \\nans1=0\\n\\nc = collections.Counter(a)\\nd=list(c.values())\\n\\nfor r in d:\\n  if r>=2:\\n    ans1+=(r*(r-1))//2\\n    \\nprint(ans1)\", \"s = input()\\ns = s[::-1]\\n\\nL = [0]\\ncnt = 1\\nfor i in range(len(s)):\\n    L.append((L[-1]+(int(s[i])*cnt))%2019)\\n    cnt *= 10\\n    cnt %= 2019\\n\\nD = dict()\\nfor j in L:\\n    if j in D:\\n        D[j] += 1\\n    else:\\n        D[j] = 1\\nans = 0\\nfor k in D.values():\\n    ans += k * (k-1) //2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\ncnts=[0]*2019\\ncnts[0]=1\\nnum=0\\nfor i in range(n):\\n  num+=int(s[i])*pow(10,i,2019)\\n  num%=2019\\n  cnts[num]+=1\\n\\nans=0\\nfor cnt in cnts:\\n  ans+=cnt*(cnt-1)//2\\n  \\nprint(ans)\\n\", \"s = list(input())\\n\\nMOD = 2019\\n\\ntemp = 0\\nd = 1\\n\\nm = [0] * MOD\\nm[0] = 1\\n\\nfor x in reversed(s):\\n    temp += int(x) * d\\n    temp %= MOD\\n    m[temp] += 1\\n    d = (d * 10) % MOD\\n\\nans = 0\\nfor x in m:\\n    ans += x * (x-1) // 2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\np=2019\\nS=[0 for i in range(n+1)]\\nans=[0]*p\\n\\nx10=1\\nfor j, i in enumerate(s):\\n  S[j+1]=(S[j]+(x10*int(i)))%p\\n  x10*=10\\n  x10%=p\\n  ans[S[j+1]]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\n\\nmod = 2019\\ncnt = [0] * 2019\\ncur = 0  # \\u73fe\\u5728\\u691c\\u8a0e\\u4e2d\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\ncnt[cur] = 1\\nd = 1   # \\u6841\\n\\nfor s in S[::-1]:\\n    cur += int(s) * d\\n    cur %= mod\\n    cnt[cur] += 1\\n    d *= 10\\n    d %= mod\\n\\nans = 0\\nfor c in cnt:\\n    ans += c * (c-1) // 2\\n\\nprint(ans)\", \"#!/usr/bin/env python3\\ndef main():\\n    S = input()[::-1]\\n\\n    counts = [0] * 2019\\n    counts[0] = 1\\n    res, digit = 0, 1\\n    for i in S:\\n        res += int(i) * digit\\n        res %= 2019\\n        digit *= 10\\n        digit %= 2019\\n        counts[res] += 1\\n\\n    ans = 0\\n    for i in counts:\\n        ans += i * (i - 1) // 2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nn = len(s)\\nmod = 2019\\n\\nt = [0]*n\\ndp = [0]*2020\\nt[0] = int(s[-1])\\ndp[t[0]] += 1\\nfor i in range(n-1):\\n    t[i+1] = t[i] + int(s[-2-i])*pow(10, i+1, mod)\\n    t[i+1] %= mod\\n    dp[t[i+1]] += 1\\nans = 0\\nfor D in dp[1:]:\\n    ans += D*(D-1)//2\\nprint((ans+(dp[0]+1)*(dp[0])//2))\\n\\n\\n\", \"#!/usr/bin/env python3\\nimport sys\\nimport numpy as np\\n\\ninput = sys.stdin.readline\\n\\n\\ndef ST():\\n    return input().rstrip()\\n\\n\\ndef I():\\n    return int(input())\\n\\n\\ndef MI():\\n    return list(map(int, input().split()))\\n\\n\\ndef LI():\\n    return list(MI())\\n\\n\\nS = ST()\\n\\ncnt = np.zeros(2019)\\ncnt[0] = 1\\nres = 0\\ntmp = 1\\nfor s in S[::-1]:\\n    res += int(s) * tmp\\n    res %= 2019\\n    cnt[res] += 1\\n    tmp *= 10\\n    tmp %= 2019\\n\\nans = 0\\nfor c in cnt[cnt >= 2]:\\n    ans += c * (c - 1) // 2\\n\\nprint((int(ans)))\\n\", \"def main():\\n    import collections\\n\\n    S = input()\\n\\n    mod_list = [0]\\n\\n    for i in range(len(S)):\\n        index = len(S) - i - 1\\n        num = int(S[index])\\n\\n        mod_list.append((mod_list[-1] + num * pow(10, i, 2019)) % 2019)\\n\\n    CTR_mod_list = collections.Counter(mod_list).most_common()\\n    cnt = 0\\n\\n    for i in range(len(CTR_mod_list)):\\n        n = CTR_mod_list[i][1]\\n\\n        if (n == 1):\\n            break\\n\\n        cnt += n * (n - 1) // 2\\n\\n    print(cnt)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"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\\n# \\u7d2f\\u7a4d\\u548c\\u306e\\u66f8\\u304d\\u65b9\\u304c\\u3088\\u304f\\u306a\\u3044\\u3084\\u3064\\ndef main():\\n  s=S()\\n  n=len(s)\\n\\n  l=[]\\n  mul=1\\n  for x in s[::-1]:\\n    l.append(mul*int(x)%2019)\\n    mul*=10\\n    mul%=2019\\n\\n  for i in range(n-1):\\n    l[i+1]+=l[i]\\n    l[i+1]%=2019\\n\\n  sl=summarizeList(l)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    if x==0:\\n      ans+=c\\n    if c>1:\\n      ans+=c*(c-1)//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Mon Sep  7 00:38:11 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n\\uff1cD - Multiple of 2019>\\n\\u3010\\u65b9\\u91dd\\u3011\\na = b(mod2019) => a - b \\u306f\\u30002019\\u306e\\u500d\\u6570\\n\\u4f59\\u308a\\u304c\\u7b49\\u3057\\u3044\\u30b0\\u30eb\\u30fc\\u30d7\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u306e\\u7dcf\\u6570\\u304c\\u89e3\\u306b\\u306a\\u308b\\u3002\\n\\u65e2\\u306b2019\\u306e\\u500d\\u6570\\u3067\\u3042\\u308b\\u3082\\u306e\\u306f\\u5358\\u4f53\\u3067\\u6210\\u7acb\\u3059\\u308b\\u305f\\u3081\\u3001[0]\\u306e\\u30ab\\u30a6\\u30f3\\u30c8\\u3092\\u4e00\\u3064\\u3042\\u3052\\u3066\\u304a\\u304f\\n\\n\\n\\uff1c\\u7d2f\\u7a4d\\u548c\\uff1e\\n\\u3010\\u8a08\\u7b97\\u91cf\\u524a\\u6e1b\\u3011\\n\\u5927\\u304d\\u306a\\u6570\\u3092\\u4f7f\\u308f\\u306a\\u3044\\u3000\\u21d2\\u3000mod \\u3092\\u4f7f\\u3046\\ntmp += 7 * 100000000  => 7 * ( 2019*N + \\u03b1) => 7 * \\u03b1\\u3000\\u3068\\u540c\\u3058\\n\\u3000\\u3000\\u21d2\\u3000\\u7d2f\\u4e57(10**N) \\u306b  mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n\\n100000000 + \\u03b3 => (2019*N + \\u03b2) + \\u03b3 => \\u03b2 + \\u03b3 \\u3068\\u540c\\u3058\\n\\u3000\\u21d2\\u3000\\u7d2f\\u7a4d\\u548c\\u3000\\u306b\\u3000mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n \\n for\\u6587\\u3067\\uff11\\u6587\\u5b57\\u305a\\u3064\\u8db3\\u3057\\u7b97\\u3057\\u3066\\u3044\\u304f\\u3053\\u3068\\u3067\\u5b9f\\u88c5\\u53ef\\u80fd\\n \\n reversed() : \\u9006\\u9806\\u306b\\u4e26\\u3079\\u66ff\\u3048\\n reversed(input()) : \\u5165\\u529b\\u3092\\u9006\\u9806\\u306b\\u53d6\\u308a\\u51fa\\u3059\\n \\n\\\"\\\"\\\"\\nS = input()\\n\\nMOD = 2019 \\n\\ncounter = [0] * 2019\\ncounter[0] = 1\\nt = 1\\ntmp = 0\\nfor i in reversed(S):\\n    tmp += int(i)*t\\n    tmp %= MOD #\\u7d2f\\u7a4d\\u548c\\u3092\\u52b9\\u7387\\u5316\\n    t *= 10\\n    t %= MOD   #\\u7d2f\\u4e57\\u3092\\u52b9\\u7387\\u5316 \\n    #print(tmp)\\n    counter[tmp] += 1\\n\\nans = sum( i*(i-1)//2 for i in counter)\\nprint(ans)\", \"s = list(input())\\n# s = list(str(10**200000))\\nn = len(s)\\nans = 0\\ns.reverse()\\n# print(s)\\nx = 1\\ntot = 0\\ncount = [0]*2019\\nfor i in range(n):\\n    count[tot]+=1\\n    tot += int(s[i])*x\\n    # print(tot)\\n    tot %= 2019\\n    ans += count[tot]\\n    x = x*10%2019\\nprint(ans)\", \"S = input()[::-1]\\nans = 0\\nmods = [0] * 2019\\nmods[0] = 1\\ncurrent = 0\\nx = 1\\nfor s in S:\\n  current = (current + x * int(s)) % 2019\\n  ans += mods[current % 2019]\\n  mods[current % 2019] += 1\\n  x = x * 10 % 2019\\nprint(ans)\", \"s = list(map(int,input()))\\ns.reverse()\\nt = len(s)\\nmod = 2019\\n\\narr = [0] * (t+1)\\narr[-2] = s[0]\\nfor i in range(1,t):\\n    arr[t-i-1] = (arr[t-i] + s[i]*pow(10,i,mod)) % mod\\n\\nfrom collections import Counter\\narr = Counter(arr)\\n\\nans = 0\\nfor i in arr:\\n    ans += (arr[i] - 1) * arr[i] // 2\\n\\nprint(ans)\", \"import sys\\nimport heapq\\nimport math\\nimport fractions\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\nfrom collections import deque\\nfrom operator import itemgetter\\ndef input(): return sys.stdin.readline().strip()\\ndef mp(): return map(int,input().split())\\ndef lmp(): return list(map(int,input().split()))\\n\\ns=input()[::-1]\\nn=len(s)\\na=[0]*2019\\na[0]=1\\nc,d=0,1\\nfor i in s:\\n    c+=int(i)*d\\n    c%=2019\\n    d*=10\\n    d%=2019\\n    a[c]+=1\\nans=0\\nfor i in a:\\n    ans+=i*(i-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()[::-1]\\nMOD = 2019\\nX = [0]\\nfor i,s in enumerate(S):\\n    X.append((X[-1]+int(s)*pow(10,i,MOD))%MOD)\\nC = Counter(X)\\nprint(sum([v*(v-1)//2 for v in C.values()]))\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in range(1,n+1):\\n  s=(s+int(S[-i])*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"n = input()\\np = 2019\\nt = 1\\ny = 0\\nc = p*[0]\\n\\nfor x in map(int,n[::-1]):\\n  y+=t*x\\n  y%=p\\n  c[y]+=1\\n  t*=10\\n  t%=p\\n\\nprint(sum(i*(i-1)//2 for i in c)+c[0])\", \"def main():\\n    def modpow(x, n, mod):\\n        res = 1\\n        while n:\\n            if n % 2:\\n                res *= x % mod\\n            x *= x % mod\\n            n >>= 1\\n        return res\\n\\n    s = input()\\n    s = s[::-1]\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in range(s_len):\\n        rev_num += int(s[i]) * int(modpow(10, i, mod))\\n        rev_num %= mod\\n        d[rev_num] += 1\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S = input()\\ns_rev = S[::-1]\\n\\nr_list = [0] * 2019\\nr_list[0] = 1\\nnum, d = 0, 1\\nfor i in range(len(S)):\\n    num += d*int(s_rev[i])\\n    num %= 2019\\n    r_list[num] += 1\\n    d *= 10\\n    d %= 2019\\n\\nans = 0\\nfor i in range(2019):\\n        ans += r_list[i]*(r_list[i]-1)//2\\n\\nprint(ans)\\n\", \"s=input()\\np=2019\\nans=0\\nM=[0]*p\\nM[0]=1\\ntmp=0\\nfor i in range(len(s)):\\n    tmp+=(int(s[-i-1])*pow(10,i,p))\\n    tmp%=p\\n    ans+=M[tmp]\\n    M[tmp]+=1\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common()[::-1]:\\n#  if k > 1 and k%2 == 0:\\n#    ans += n\\n#  else:break\\n#print(ans)\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#https://mirucacule.hatenablog.com/entry/2020/04/27/090908\\n#https://drken1215.hatenablog.com/entry/2020/04/29/171300\\n\\nS=str(input())[::-1]#\\u9006\\u9806\\u3067\\u683c\\u7d0d\\nN=len(S)\\ncounter=[0]*2019\\ncounter[0]=1\\nans=0\\nnum,d=0,1\\nfor c in S:\\n    num += int(c) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counter[num]+=1\\nfor i in counter:\\n    ans += i*(i-1)//2\\nprint(ans)\", \"from collections import defaultdict\\n\\nS = input()\\n\\nd = defaultdict(int)\\n\\nd[0] += 1\\n\\nmod = 0\\nR = 1\\nfor i in range(len(S)):\\n    mod = (mod + R * int(S[len(S) - i - 1])) % 2019\\n    R = R * 10 % 2019\\n    d[mod] += 1\\nans = 0\\nfor i in list(d.values()):\\n    if i > 1:\\n        ans += i * (i - 1) / 2\\n\\nprint((int(ans)))\\n\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"S = input()\\nmod = 2019\\n\\narray = []\\nfor i in range(len(S)):\\n    x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod\\n    array.append(x)\\narray2 = [0]\\ny = 0\\nfor i in range(len(S)):\\n    y = (y+array[i])%mod\\n    array2.append(y)\\narray3 = [0] * 2019\\nans = 0\\nfor i in range(len(array2)):\\n    z = array2[i]\\n    ans += array3[z]\\n    array3[z] += 1\\nprint(ans)\\n#3*673\\n\", \"s=input()\\nn=len(s)\\nrui=[0]\\njuu=[1]\\nfor i in range(n+5):\\n  juu.append(juu[-1]*10%2019)  \\nfor i in range(n):\\n  rui.append((rui[-1]+int(s[n-1-i])*juu[i])%2019)\\nama=[0]*2019\\nfor i in range(len(rui)):\\n  ama[rui[i]]+=1\\nans=0\\ndef ui(n):\\n  return max(0,n*(n-1)//2)\\nfor i in range(2019):\\n  ans+=ui(ama[i])\\nprint(ans)  \", \"def MultipleOf2019():\\n    S = input()\\n    s = int(S)\\n    num, mod, ans = len(S), 2019, 0\\n    c = [0 for _ in range(num+1)]\\n    d = [0 for _ in range(mod)]\\n    d[0] = 1\\n    s = int(S)\\n    \\n    for i in range(num):\\n        c[i+1] = (c[i]+int(S[-i-1])*pow(10, i, mod))%mod\\n        d[c[i+1]] += 1\\n\\n    for i in range(mod):\\n        ans += d[i]*(d[i]-1)//2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    MultipleOf2019()\\n    \\n\\n__starting_point()\", \"S = input()\\nN = len(S)\\n \\ncounter = [0] * 2019\\ncounter[0] = 1\\nT = 0\\nR = 1\\nfor i in range(N):\\n    T = (T + R * int(S[N - i - 1])) % 2019\\n    R = 10 * R % 2019\\n    counter[T] += 1\\n \\nans = 0\\nfor i in range(2019):\\n    m = counter[i]\\n    ans += m * (m - 1) // 2\\n \\nprint(ans)\", \"def inN():\\n    return int(input())\\ndef inL():\\n    return list(map(int,input().split()))\\ndef inNL(n):\\n    return [list(map(int,input().split())) for i in range(n)]\\n\\ns = input()\\nn = int(s)\\nl = len(s)\\ncnt = 0\\nmod = [0]*2019\\nm = 0\\nfor i in range(l):\\n    m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019\\n    mod[m] += 1\\n\\ncnt += mod[0]\\n\\nfor i in range(2019):\\n    if mod[i] > 1:\\n        cnt += (mod[i]*(mod[i]-1))/2\\n        #print(i)\\nprint((int(cnt)))\\n\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nA = [0]\\nfor i, s in enumerate(S[::-1]):\\n    A.append((A[-1] + s * pow(10, i, 2019)) % 2019)\\nprint((sum([v * (v - 1) // 2 for v in list(Counter(A).values())])))\\n\", \"S = reversed(input())\\nresiduelist = [0]\\npower = 1\\nresidue = 0\\nfor i in S:\\n    digit = int(i)\\n    residue = (residue+power*digit)%2019\\n    residuelist.append(residue)\\n    power = (power*10)%2019\\nfrom collections import Counter\\nval = Counter(residuelist).values()\\nans = 0\\nfor j in val:\\n    ans += j*(j-1)//2\\nprint(ans)\", \"# coding: utf-8\\n# Your code here!\\n\\nS=list(input())\\nS=list(map(int,S))[::-1]\\n\\n\\nmod=[0]*2019\\nmod[0]+=1\\n\\nans=0\\ntemp=0\\np=1\\nfor i in range(len(S)):\\n    temp+=S[i]*p\\n    p=p*10%2019\\n    temp%=2019\\n    ans+=mod[temp]\\n    mod[temp]+=1\\n\\nprint(ans)\\n\", \"s=input()\\n\\ns=s[::-1]\\n\\ncounts = [0] * 2019\\ncounts[0] = 1\\n\\nnum=0\\nd = 1\\n\\n\\nfor char in s:\\n    num += int(char) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counts[num] += 1\\n    \\nans = 0\\nfor cnt in counts:\\n    ans += cnt * (cnt - 1) // 2\\n\\nprint(ans) # \\u7b54\\u3048\\u306e\\u51fa\\u529b   \\n\\n\", \"from collections import Counter\\ns = input()\\n\\nls = len(s)\\nt = [0]\\nj = 1\\nfor i in range(ls):\\n    u = (int(s[ls-1-i])*j + t[-1]) % 2019\\n    t.append(u)\\n    j = (j * 10) % 2019\\nc = Counter(t)\\nk = list(c.keys())\\nans = 0\\nfor i in k:\\n    ans += c[i]*(c[i]-1)/2\\nprint(int(ans))\", \"from collections import Counter\\nimport sys\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nmod = 2019\\n\\n\\ns = readline().decode().rstrip()\\ns = s[::-1]\\nn = len(s)\\nd = [0] * (n)\\nd[0] = int(s[0]) % mod\\n\\nfor i in range(1, n):\\n    d[i] = (d[i - 1] + int(s[i]) * pow(10, i, mod)) % mod\\n\\nd = [0] + d\\n\\nc = Counter(d)\\nans = 0\\nfor v in c.values():\\n    ans += v * (v - 1) // 2\\nprint(ans)\", \"def main():\\n  n, mods = 0, [1]+[0]*2019\\n  d = 1\\n  for i in reversed(input()):\\n    n = (n+int(i)*d)%2019\\n    d = d*10%2019\\n    mods[n] += 1\\n  print(sum([i*(i-1)//2 for i in mods]))\\nmain()\", \"S=input()\\ns=int(S)\\nmod=2019\\nc=[0]*(len(S)+1)\\nd=[0]*2019\\n\\n\\nc[0]=0\\nd[0]=1\\nfor i in range(len(S)):\\n  c[i+1]=(c[i]+int(S[-i-1])*pow(10,i,mod))%mod\\n  d[c[i+1]]+=1\\n  \\nm=0\\nfor i in range(2019):\\n  m+=d[i]*(d[i]-1)//2\\n\\nprint(m)\", \"# -*- coding: utf-8 -*-\\n\\nS = input().strip()\\n#-----\\nnum = 0\\ncnt_mod = {0:1}  # type {int: int} , contents {remainder : count}\\nmod = 2019\\nbase_pow = 1\\n\\nfor i in range(len(S)):\\n    digit = int( S[len(S)-1-i] )\\n    \\n    num += (digit * base_pow) % mod\\n    num %= mod\\n    \\n    base_pow = (base_pow * 10) % mod\\n    \\n    cnt_mod.setdefault(num, 0)\\n    cnt_mod[num] += 1\\n\\n\\nans = 0\\n\\nfor r,c in list(cnt_mod.items()):\\n    # r: remainder\\n    # c: count\\n    if c >= 2:\\n        ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\n# pow(a,b,c)\\u306f\\u666e\\u901a\\u306bMOD\\u3059\\u308b\\u3088\\u308a\\u901f\\u3044\\n# \\u666e\\u901a\\u306b\\u3084\\u3063\\u305f\\u3089TLE\\u3060\\u3063\\u305f\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN = list(input())\\nM = [0]\\nS = 0\\nK = 1\\nans = 0\\n\\nfor i in range(len(N)):\\n    S += int(N[-i-1])*K\\n    S %= 2019\\n\\n    K *= 10\\n    K %= 2019\\n    M.append(S)\\n\\nP = Counter(M)\\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\\nprint(ans)\\n\", \"import sys\\nimport collections\\n\\n\\ndef resolve(in_):\\n    s = next(in_).strip()\\n    mod = 2019\\n    dp = [0] * (len(s) + 1)\\n    ch0 = ord(b'0')\\n    for i, b in enumerate(reversed(s), 1):\\n        dp[i] = (dp[i - 1] + (b - ch0) * pow(10, i, mod)) % mod\\n\\n    return sum(v * (v - 1) // 2 for v in list(collections.Counter(dp).values()))\\n\\n\\ndef main():\\n    answer = resolve(sys.stdin.buffer)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#import numpy as np\\n#import math\\n#from decimal import *\\n#from numba import njit\\nfrom collections import Counter\\n\\n#@njit\\ndef main():\\n    S = input()\\n    A = list(map(int, S))[::-1]\\n    mod = []\\n    ten = 10\\n    for i in range(len(A)):\\n        if i == 0:\\n            mod += A[i],\\n        else:\\n            mod += (mod[i-1]+ten*A[i])%2019,\\n            ten = (ten*10)%2019\\n    mod += 0,\\n\\n    C = Counter(mod)\\n    print(sum([c*(c-1)//2 for c in C.values()]))\\n\\nmain()\", \"S = input()\\n\\ncs = [0]\\nr = 1\\nfor c in S[::-1]:\\n    cs.append((cs[-1] + r*int(c)) % 2019)\\n    r *= 10\\n    r %= 2019\\n\\nfrom collections import Counter\\nctr = Counter(cs)\\nans = 0\\nfor v in ctr.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [-1] * len(S)\\nr = 0\\nd = 1\\nfor i,s in enumerate(S[::-1]):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[i] = r\\n\\nans = 0\\nc = Counter(p)\\nfor k,n in c.most_common():\\n  if n > 1:\\n    ans += n*(n-1)//2\\n  else:break\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"def main():\\n    s = input()\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    t = 1\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in reversed(s):\\n        rev_num += int(i) * t\\n        rev_num %= mod\\n        d[rev_num] += 1\\n        t *= 10\\n        t %= mod\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ns=input()\\nn=len(s)\\nans=0\\narr=[0]*(n+1)\\nif s=='0':\\n    print(1)\\n    return\\nelif n==1:\\n    print(0)\\n    return\\nfor i in reversed(range(n)):\\n    arr[i]=(arr[i+1]+int(s[i])*pow(10,n-i-1,2019))%2019\\nm=Counter(arr)\\nfor j in m.keys():\\n    ans+=m[j]*(m[j]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"s = input()\\n\\nlen_s = len(s)\\n\\ncurrent = 0\\nmod_dict = dict()\\nmod_dict[0] = 1\\nfor i in range(len_s-1,-1,-1):\\n    c = s[i]\\n    current = (current+pow(10,len_s-i-1,2019)*int(c)) % 2019\\n    if current in mod_dict:\\n        mod_dict[current] += 1\\n    else:\\n        mod_dict[current] = 1\\n\\ncount = 0\\nfor key in mod_dict:\\n    count+= (mod_dict[key]*(mod_dict[key]-1))//2\\n\\nprint(count)\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nfrom collections import deque\\nfrom collections import defaultdict\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\nMOD2 = 998244353\\nINF = float('inf')\\ninput = lambda: sys.stdin.readline().strip()\\n\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\ndef combinations_count(n, r):\\n    if n == 1:\\n        return 0\\n    else:\\n        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\ndef main():\\n    S = SI()\\n    \\n    ls = []\\n    len_S = len(S)\\n    rem = 0\\n\\n    for s in range(len_S-1,-1,-1):\\n        rem = (rem+int(S[s])* pow(10, len_S-s-1, 2019))%2019\\n        ls.append(rem)\\n    \\n    import collections\\n\\n    cls = collections.Counter(ls)\\n    clsv= list(cls.values())\\n\\n    ans = 0\\n\\n    for p in clsv:\\n        ans += combinations_count(p,2)\\n    ans += cls[0]\\n    print(ans)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ndef main():\\n    S = input()\\n    A = [0] * ((n := len(S)) + 1)\\n    A[1] = (a := int(S[-1])) % 2019\\n    for i in range(2, n + 1):\\n        a += pow(10, i - 1, 2019) * int(S[-i])\\n        A[i] = a % 2019\\n    c = Counter(A)\\n    ans = 0\\n    for v in list(c.values()):\\n        ans += v * (v - 1) // 2\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = str(input())\\nMOD = 2019\\nm = 0\\ndigit = 1\\nmods = [1] + [0] * 2018\\nfor a in s[::-1]:\\n    m = (m + digit * int(a)) % MOD\\n    mods[m] += 1\\n    digit = digit * 10 % MOD\\nans = 0\\nfor x in mods:\\n    ans += x * (x - 1) // 2\\nprint(ans)\", \"from collections import Counter\\n\\ns = input()\\nn = len(s)\\ndigits = [int(c) for c in s[::-1]]\\na = [0] * (n + 1)\\np = 2019\\n\\nfor i, digit in enumerate(digits):\\n    a[i + 1] = (digit * pow(10, i, p) + a[i]) % p\\n\\ncounter = Counter(a)\\nans = 0\\nfor count in counter.values():\\n    ans += count * (count - 1) // 2\\n\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Sun Sep  6 23:39:24 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n#from scipy.special import comb\\n\\ncounter = [0]*2019\\ncounter[0] = 1 # 0 = 0 (mod 2019)\\n\\nS = input()\\ntmp = 0\\n\\\"\\\"\\\"\\n#\\u5927\\u304d\\u3044\\u6570\\u3092\\u4e00\\u6c17\\u306b\\u639b\\u3051\\u306a\\u3044\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*10**(i-1)    #\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u65b9\\u304c\\u65e9\\u3044\\uff08\\u3051\\u3069\\u3001\\u6f38\\u5316\\u5f0f\\u7684\\u306b\\u7d2f\\u7a4d\\u548c\\u3092\\u51fa\\u305b\\uff09\\n    #print(tmp%2019)\\n    tmp %= 2019                    #\\u5927\\u304d\\u3044\\u6570\\u3092\\u5272\\u308b\\u306a\\n    counter[tmp%2019] += 1\\n\\nans = 0\\nfor i in range(2019):\\n    if counter[i] >= 2:\\n        #ans += comb(counter[i], 2, exact=True)\\n        ans += counter[i]*(counter[i]-1)//2\\nprint(ans)\\n\\\"\\\"\\\"\\nMOD = 2019\\n#reversed(s) ?\\nt = 1\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*t\\n    #print(\\\"A\\\", tmp)\\n    tmp %= MOD \\n    t *= 10\\n    #print(\\\"B\\\", tmp)\\n    t %= MOD\\n    #print(tmp)\\n    counter[tmp] += 1\\n    \\nprint((sum(i*(i-1)//2 for i in counter)))\\n\", \"S = list(map(int, list(input())))\\n\\npops = 0\\ndigi = 1\\ncnt = [0] * 2019\\ncnt[0] = 1\\n\\nwhile S:\\n    s = S.pop()\\n\\n    pops = (pops + s * digi) % 2019\\n    digi = (10 * digi) % 2019\\n\\n    cnt[pops] += 1\\n\\nans = 0\\n\\nfor i in range(2019):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\", \"S = str(input())\\nN = len(S)\\nb = [0] * 2019\\ncount = 0\\nb[0] = 1\\nt = 0\\nk = 1\\n\\nif len(S) < 4:\\n    print(0)\\nelse:\\n    t = int(S[-1])\\n    b[t] += 1\\n    for i in range(1,N):\\n        k = k * 10 % 2019\\n        t = (k * int(S[-i-1]) + t) % 2019 \\n        b[t] += 1\\n\\n    for i in b:\\n        count += i*(i-1)//2\\n\\n    print(count)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nz = 1\\ntmp = 0\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tl[tmp%2019] += 1\\n\\tz = z*10%2019\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\nans += l[0]\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nC = Counter()\\nMOD = 2019\\n\\nn = 0\\nfor i, s in enumerate(S[::-1]):\\n    s = int(s)\\n    n += pow(10, i, MOD) * s % MOD\\n    C[n % MOD] += 1\\n\\nC[0] += 1\\nans = 0\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"s=[int(x) for x in reversed(list(input()))]\\nn=len(s)\\nx=[0]*2019\\ndp = 0\\ndim = 1\\nfor si in s:\\n  dp = (dp + si*dim) % 2019\\n  x[dp] += 1\\n  dim = dim * 10 % 2019\\nans = x[0]\\nfor i in range(2019):\\n  ans += x[i]*(x[i]-1)//2\\nprint(ans)\", \"S = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    #print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum+x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num-1)) // 2   # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for i1 in range(1, lens+1):\\n        ss += (int(s[-i1]) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"s=input()[::-1]\\np=2019\\nans=[0]*p\\n\\nx10, S=1, 0\\nfor i in s:\\n  S+=x10*int(i)\\n  S%=p\\n  x10*=10\\n  x10%=p\\n  ans[S]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\nmod = 2019\\n\\nt = len(S)\\nl = [0] * (t + 1)\\nfor i in range(t-1, -1, -1):\\n    l[i] = (l[i+1] + int(S[i]) * pow(10, t-i-1, mod)) % mod\\n\\nfrom collections import Counter\\n\\ndef nC2(n):\\n    return n * (n - 1) // 2\\n\\nl = list(Counter(l).values())\\n\\nans = 0\\nfor i in l:\\n    ans += nC2(i)\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nP = [0] * (len(S)+1)\\nmod = 2019\\nd = 1\\nfor i in range(len(S), 0, -1):\\n    P[i-1] = int(S[i-1])*d + P[i]\\n    P[i-1] = P[i-1] % mod\\n    d *= 10\\n    d = d % mod\\n\\nP = Counter(P)\\nans = 0\\nfor p in P.values():\\n    ans += p*(p-1)//2\\nprint(ans)\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for se in s[::-1]:\\n        ss += (int(se) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S=input()\\nN=len(S)\\n\\nT=[0]\\nfor i in range(N):\\n    p = int(S[-1-i])\\n    T.append( (T[-1]+ pow(10,i,2019)*p)%2019 )\\n    \\nfrom collections import Counter\\nans=0\\nU=dict(Counter(T))\\nfor num in U:\\n    ans += U[num]*(U[num]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nMOD = 2019\\n\\nacc_mod = [0]\\nfor i, s in enumerate(S[::-1]):\\n    acc_mod.append((acc_mod[-1] + s * pow(10, i, MOD)) % MOD)\\n\\nans = 0\\nfor v in list(Counter(acc_mod).values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"from itertools import accumulate\\nfrom collections import Counter\\n\\n\\ndef solve(n):\\n    return n * (n - 1) // 2\\n\\n\\ns = input()[::-1]\\nMOD = 2019\\n\\n# \\u4e8b\\u524d\\u8a08\\u7b97\\nrest = []\\nfor i, x in enumerate(s):\\n    # 1, 10, 100, 1000...\\u306e\\u5270\\u4f59\\u3092\\u9806\\u306b\\u8a08\\u7b97\\u3057\\u3001\\u5404\\u6841\\u307e\\u3067\\u306e\\u5270\\u4f59\\u3092\\u8a08\\u7b97\\n    if i == 0:\\n        tmp = 1\\n    else:\\n        tmp = tmp * 10 % MOD\\n    rest.append(int(x) * tmp % MOD)\\n\\nresult = [x % MOD for x in list(accumulate(rest))]\\n\\n# 0\\u306f\\u5358\\u72ec\\u30672019\\u306e\\u500d\\u6570\\nzero = result.count(0)\\n\\n# \\u4ed6\\u306f\\u30b3\\u30f3\\u30d3\\u30cd\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7d50\\u679c\\nc = Counter(result)\\nc = list(c.values())\\n\\n# \\u8db3\\u3057\\u3066\\u51fa\\u529b\\nprint(sum([solve(x) for x in c if x >= 2]) + zero)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = input()\\nn = len(S)\\ns = [0]\\nfor i, x in enumerate(S):\\n\\ts.append(int(S[i])*pow(10, n-i-1, 2019)%2019)\\n\\ntmp = 0\\nt = []\\nfor x in s:\\n\\ttmp = (tmp+x)%2019\\n\\tt.append(tmp)\\n\\nans = 0\\nfor v in Counter(t).values():\\n\\tans += v*(v-1)//2\\nprint(ans)\", \"MOD = 2019\\n\\\"\\\"\\\"\\ndef part_count(S):\\n  B = [0 for _ in range(MOD)]\\n  C = [0 for _ in range(MOD)]\\n  L = [0 for _ in range(MOD)]\\n  R = [0 for _ in range(MOD)]\\n  \\n  if len(S) == 1:\\n    s = S[0]\\n    B[s] = 1 \\n    return (B, L, R, C)\\n  S_L = S[:len(S)//2]\\n  S_R = S[len(S)//2:]\\n  \\n  B1, L1, R1, C1 = part_count(S_L)\\n  B2, L2, R2, C2 = part_count(S_R)\\n    \\n  for j in range(MOD):\\n    C[j] += C1[j] + C2[j]\\n    L[j] += L1[j]\\n    R[j] += R2[j]\\n    for i in range(MOD):\\n      B[j] += B1[i] * B2[(-i + j)%MOD]\\n      L[j] += B1[i] * L2[(-i + j)%MOD]\\n      R[j] += B2[i] * R1[(-i + j)%MOD]\\n      C[j] += R1[i] * L2[(-i + j)%MOD]\\n  \\n  return (B, L, R, C) #\\u4e21\\u5074\\u96a3\\u63a5\\u3001\\u5de6\\u96a3\\u63a5\\u3001\\u53f3\\u96a3\\u63a5\\u3001\\u96a3\\u63a5\\u306a\\u3057\\u306e\\u500b\\u6570\\n\\\"\\\"\\\"\\n\\nS = list(input())\\nS.reverse()\\nN = len(S)\\nS = [int(S[i]) for i in range(N)]\\nMOD = 2019\\n\\na = 1\\nfor i in range(N): \\n  S[i] *= a\\n  S[i] %= MOD\\n  a *= 10 \\n  a %= MOD\\n  \\n#B, L, R, C = part_count(S)\\n#print(B[0] + L[0] + R[0] + C[0])\\nT = [0 for _ in range(N+1)]\\nfor i in range(1,N+1):\\n  T[i] += S[i-1] + T[i-1]\\n  T[i] %= MOD\\n\\n#print(T)\\n\\nC = [0 for i in range(MOD)]  \\nfor i in range(N+1):\\n  C[T[i]] += 1\\n\\n#print(C)\\n\\nans = 0\\nfor i in range(MOD):\\n  ans += C[i]*(C[i]-1)//2\\n  \\nprint(ans)\\n\", \"s=input()\\nls=len(s)\\nm=[0]*(2019)\\nm[0]+=1\\n\\ncnt = 0\\nb = 0\\nfor i in range(ls):\\n  a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019\\n  m[a] += 1\\n  b = a\\n  cnt += 1\\n\\nans = 0\\nfor i in m:\\n  if i <= 1:\\n    continue\\n  ans += i*(i-1)//2\\n\\nprint(ans)\\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\\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  s=S()\\n  n=len(s)\\n  s=s[::-1]\\n\\n  rl=[0]*(n+1)\\n  for i,x in enumerate(s):\\n    rl[i+1]=(int(x)*pow(10,i,2019))%2019\\n\\n  for i in range(n):\\n    rl[i+1]+=rl[i]\\n    rl[i+1]%=2019\\n\\n\\n  sl=summarizeList(rl)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    ans+=(c*(c-1))//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"from itertools import accumulate\\n\\nS = input()\\n\\nR = [1]\\nfor _ in range(len(S)-1):\\n    R.append(R[-1]*10%2019)\\n\\nL = [int(s)*r for s, r in zip(reversed(S), R)]\\nZ = list(accumulate(L, func=lambda a, b: (a+b)%2019))\\n\\nT = [1]+[0]*2018\\nfor z in Z:\\n    T[z] += 1\\n\\nf = lambda n: n*(n-1)//2\\nprint(sum(f(t) for t in T))\", \"import sys\\nreadline = sys.stdin.readline\\n\\nS = readline().rstrip()\\nDIV = 2019\\n\\ncur = 0\\nfrom collections import defaultdict\\ndic = defaultdict(int)\\nfor i in range(len(S) - 1, -1, -1):\\n  cur += ((int(S[i]) % DIV) * pow(10, (len(S) - 1 - i), DIV)) % DIV\\n  cur %= DIV\\n  dic[cur] += 1\\n\\nans = 0\\n# 0\\u306f\\u5358\\u72ec\\u3067\\u3082\\u3088\\u3044\\nfor key, val in dic.items():\\n  if key == 0:\\n    ans += val\\n  ans += (val * (val - 1)) // 2\\n\\nprint(ans)\", \"# \\u89e3\\u8aacAC\\nimport math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\\n#from operator import itemgetter\\n#from heapq import heappush, heappop\\n#import numpy as np\\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\\n#from scipy.sparse import csr_matrix\\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\nmod = 10**9 + 7\\n\\nstdin = sys.stdin\\n\\nni = lambda: int(ns())\\nnf = lambda: float(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nnb = lambda: list(map(float, stdin.readline().split()))\\nns = lambda: stdin.readline().rstrip()  # ignore trailing spaces\\n\\nS = ns()\\nn = len(S)\\nT = [0] * (n+1)\\nd = {0: 1}\\nfor k in range(n-1, -1, -1):\\n    tmp = (T[k+1] + pow(10, n - k - 1, 2019) * int(S[k])) % 2019\\n    T[k] = tmp\\n    if tmp not in list(d.keys()):\\n        d[tmp] = 1\\n    else:\\n        d[tmp] += 1\\nans = 0\\nfor k, v in list(d.items()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"S=input()\\nS=list(reversed(S))\\n\\nm=2019\\ncnt=[0 for i in range(m)]\\n\\nlen_S=len(S)\\nx=1\\ntot=0\\nans=0\\n\\nfor i in range(len(S)):\\n    cnt[tot]+=1\\n    tot+=(ord(S[i])-ord('0'))*x\\n    tot %= m\\n    ans+=cnt[tot]\\n    x=x*10%m\\n\\nprint(ans)\"]",
        "difficulty": "interview",
        "input": "48456164346655724418473851827195177268213951291512231496674831828146377583182898123411932298499993331351978626884791843347178681517464355935868661515855116515425976241326483886341248337192814513385971322445355344146175614314711334559158693491662616313521239666125178172624512679321845366182113829477438966715122318984553876481578858827799489316616371215438183325282173317888341685865767221187172163135241995211851534118761778739183123314758893391921998811911993182113852897875914416131811673751161923815849151627314211995145368629928742992228147155664941187684394225237514799271867575811638847986137768621133573631938241348692134465477731533515445831384596119483353957246682899812341512231345249892398167173213527366627795486942873736935195843621852973158124976178741184334715566496884791197267823752127197176662565819491258816676945491681522326684441152838316858656864631294518433471691922184334799132963396658147218292147571257853911417338171615524943977431251781483965141733861579538361337173492636142137618655561431471184738524228142137617464355935862362231479927191199315566495895481552611172422611891911986696494655761163134667314617561768644656175129619862387135938216131811132659179691625898641327672213446543735152584321217457113871656128212134191566744143752818776741591417787398419233593827914481928145163337114617562866981843347172422656128211972674825411411281147387514845173634125178581472759144155463377553124976114516611455699991329189382259358612941794825411712112184536637351591864516939411681827742992936816724821944892194227818413281837291395129912588152838314233951712112997386125178152232656532191199318675751796919812341885746157683915243451461756446199145973797113965213719967911873632143349112256417585497369355511879549871526364417933167778968847918776711245836642513634211326597672217625871948335169797914274331465794195843456294185546133717356532761163179287245427519523735895481112469458313831828633966139311989311998818257712422819725635855119261266844411754511228147182719517868154885981897867692391883727716745252375166163715324217874118271951261875194833516999981397148157683979952433919217787396258936947713648441221495615795123966612174571249761512826252375692517345249164548583384717666258318282483373391929327781358787131235282663836198729155724492672115566491368882162529512396661823157278622952968298812182719531698318372924429915485732422866425113385978378859428738116385915676985741992753167375116737511639428835866155261155926356935812194761819119122351497517712154382281471671732983253146983223824215828965289785976241427433757125946911178479623622388432211245831415319161923818534426198331483965143752812578377853911197267187565111629441829214777315188776516919221786815141935773693511326595713771294179198265882375238764815687634583131451661496674912588136484414819468742271469832946911551187199477215142525237515788581697979166163771876414173381213419179892939976291864512558181241685143752812921612497611756539267213634215243451433499913293694775754155612821821138199275366223268646186555687422741389511185263472689489312679321427433154857315869341294179186353761377644619918635376783848338471221495125178126389414556991439547182719536947734121119442971584915146983212396666622321136697189786783372777315152434565819493883579952488634188634198729144216113951291784796187968916999986965558923981239666312945288717129821714597371992753123562897517761983318655566662716596186319471645485442161936816116698215384787288591582896666273694771229571288717823752918645146983257945312537991893822543111165356189441713385978843225269591643466892398738954145368892398761163139512914395474946551746435932778791448583491413895145166112739893472688237524159141451661162327614254141368882136282511286213856291911993567339835866545138439426783842644891267932145368633966821733135878716333716581941433491887765198669616273141189191162327613931119281451399167141733894489211548681831233185546117464351962468186353799334825237518271955733969529688762463714961827195991329122351417141311425414823752133254993348114477379346737351512982177571251419357674346946911438123171413118695946319471332541372921152849134263577125865819441187616676949731581134678135878769857454916865415612497612967931821138167375111912184798153847816818271516269145166114334981567612982176359858964361483965161525976241829214698574458313183729226128242281629333173634244299452256158895316495239529681938243674581619238591567171615175249234121118171246318155664951888318191191683846158693413648444118761746435359382143752834726815889537894298358669832531522326197256317242263452494825413735151819119284679886341373515944892147588914758891288122952968122553319685259226831827195185949918796896864643812344418825771682422417933188776586615117726824583138843221687884769239119928678337215768391251781241685864132163135226852711528491364844831828472446615795571377496674111246912275529186454179339691249869313789776299286783841259856395724365439198265881769513749391875651312945258432154655435736313446541411281134667318978612719794893343237187648782651136697115486881971416353916252951592991789429383611633371184132897315815768391885746444183391928237527773151526364767224724469771969549873674581467813773277189786126995175914457137739168618372918635371336578583491165759997719617787391964487187968971674544821851484584798583491147588934524991864516838468782651397148118717224429915324211835271145368155261117343217591442967931928145421971196448799536718352711273989161116277529612558181411281476484664251183123315566491338597157482122351412477421869594113467819463168277968444136342135676812881221819119672327197458216293334885986622321245723114881115182886218521798929145166128871713931133313517363417423976157951768644136484412618759953671324464183325212396661649523625899973861469832769239896436148396516697131538478114477315364591861518175653122351478337211811151895841387648944892977196129216183729894417168586517524921996791162933314112811994772113265912679327833727813531199286819714492636579453183123317928721619238113265941793315546316293337611635148456864613365788499995552254845648859816878841687884228147137493919584312315934928736543912114192814526852712376471617219738954113871614496421899879188372738966718675757833721197267569358194227819846775673391548573264489294774186959417767258147213587871792872575415835866942873144762355724461983388634111488111649523738954136888227458413789771926126163135277731548859841793319887151459737916626791448154453513931114516619469116561758762461566744761163162933357541511366971699998763182135878717343211195248121745766828916656751193229597624139714814294521324464147185118312337853911798929127398981567661781456128212356286622327167454865798479819725637692394764841669713343231627314625891718169142945286211347446517242261197267165154295498742399121745728871712315917726828863411873632185546112921616192381122564167173214314711239666148598495498717484541397148928742988122887177853919691214698321364844254394186757512214951831233769239187968918938223391925834911911993771258888366218525249418292141217457148194613789775128266157959973861253799494655113871618271957631821685865345249135878737149692268342399194227857339612517813486929166266299281217457658194127398968646183123311912116697131825176835866498693156876317767215889531851423831828164548518292143896671162944656175952968472446343231112469884322831828174239784999918978618332526965558742273169839893116777891473871582896166769416252959691284596118574878337275914416636561695961554639893119321831954392589548526959133657838966752695916273141623276164952314597373311169771961952373397743367458195439215324216783841528383115688717666251259856119121379572187767938835198467719947721332541273989135474948456151626928467918675751455699119726711871729893115344415546373491615445351316388134667366627126187517121121443585118111527256514395473169839731581342635172624581365712154381938243674581726245557244144762317545119913292927551859499118919118453663714961827195182517615384785491681641447944892825771415914146579419947724219711316388119726734726811912118554612887171467813476484153847818191196682892261281449642111246914193573311161413312396669933481481946169192297113978135345427517767216596181524345825771173835988836528978274584162933329679318332526743461778739815676124168511124691229571589548131638863194714839652927552846791683846177672115688741187613769581524345757125122755213466731778739196448768646692517516864143147129275535736311992861619238482541876246593586154453591662673289713143691514257268472482118695945552259125881193229121543813123515586682523759852727954861984677156876317464351984677555225423991992753579453153242193681617686441655585128261667694591567122149511488111645485124774257137766828917383592947744946551134678472446599643246318987291186353735332586211344619911185261968525151425114477313527318453661362825282661578858656175142541412235145915677571251932183341211114477315586681378977166769476318215465541534441568763621852184738561579519463161288122526959561282389667817695158693494691114556992745847995249287416878842321851346673353325696555656175187968989643659762412679326642511841328142945214718511873632696555625891685865312945133254387648121543811528498318288136572988121841328763182163539438123123562812376471643466375534543111742992188372746437789429154857397113934121172684559263142137629881277933418695945451311447731526364166365667232786817484563876485269591526364492636232185186959414314711237647187363213547497995241675771663656147185115546348254119887151964487198669611144885754151853442886341866151193622172885917282647874127256554714995498717121121322445492636181719933481681827355344129417952494769239526959938835524941324464244299583491175451143812312295718681761175733515486211317363426448914435851271973876481982658779334148194614698323694777591441621257524941986696183527118897841726245726846299287611638257711296198516864369477143954759964316555896912195843146781313729216858651776727631822442991665675128812238159117161516273146844416682891948335682422135273168586519866968782651586934228147385629136888266828986413262589256413355344111448814637751968525656175167778912941793149641185153357363169192293681618736321859499591567688479415914121543861579512214951728264188372756733919463161215438333135896436936816843942165154267232769857454714912295712463181841328156876377529612941791782777162731487624649667481567633717316232766662712275521738359112256499536713325429679314375281189191615795192814516313527631823331351114488184536612174573593826622322947746783842988121122564158895327256512921656128213789771843347154857316394281667694115486872684163942844821815788581655582442995249468242217787398358667752961368882178883413991671859499122957133717317464355168641546554486579194631659358667232719988112638948378851869594486579726841227552187161312558181162944142945214738719382484394225843218877651342635165961812416853169831843347278622763182111246977933498931167577141935718796891419357585517187646763651485984121543818857465713779125881837293755341397148121145188834138951962468375534147588912699511651542573396165961818292141992753115284913143691245723125783734121162589781353571377118111512457235774342564137187641364844156472548456121947616535611885746694536182113815263646359859731581461756228147126591313385971273989145368841923226128167375116777891742397184738515364591257837179287217161513264838742271996791151626912982175855157339627256516111621211447648418554615431111538478118919118655562483371998811314369282665673399125888257719166266682897773151332541429452121947616999981183134131436918716135693581556649179287263194751484519967911247742337173165356175712517948916723271663656615795166567578135319543921776727874172684977196579453896436186151865819415828963916861393111948335176662584596163194712457231861518476484458313195439273289718978697921544216115828964219719751771481946684441198871517989294421611185153152838319584312598561148811557244195843114679213244647288591411281185748874227799524262471899879197256314839651267932716745635985599643684441387648993348666273795728378851516269726841962468165759912537991625295196852548859836745865617572885919564113916863573634865791883727298812142137615849153735158419233492875188831588953183729242281247742912588169596738954152434518171375534171211214496421251781257837282663674581859499456294173634145166172482183182852897839774318695947874115162691659618133254226128141531911185261344654119121167375135534412961981827195137292413895557244182517617565316737511653561143349989315511876743467611639388351786815137493983182814233954744659347971522326145368154655411548681861518666271841328182315772885916999981693941172422682577144216166223279346747648414819463412111754511183123316737511344654147588912416858358661245723446199147387985272482541625895935861522326621852156674495498798123416131817248218439429832531336578196448754513827794482187389541146792379572182113873491639774347446518756513169831427433111448865617534323355344973158819714682422147387954987134869216212571576839194429714213761441566127197119726719382419362211629333194429761175711932296299287631821883727567339166365672684168586541995211649633412111352731413347244612578371566744195237317181696198331996791173835914133395724476484161721916172191766625242281645485516864112256418796899287456532183527112659133694771187172662232726841611162335154151828815445357147261754511139714811912128669839774349465593479716515421231591996791185142393681697113918332527147266178141788834694536769239162731495498798123424228997386623871186353717767217625876945361873632419952256413815676161525653217444161455699126389445831369655551484518574818271951526364631947458313482541141531915667445552258378858419231877671633371158491513769582463188681715243458358661726245195439212982171457718121543867434676722124168514375288923986824221544535121341912295711372921546554696555831828993348617814446199172422658551161528883618211388944171861518367458164144717989291528383236223187968992874122553312961981346673112458349667417363449667424429986817179287261175717242262725652725654885981564725113871669453682779995367171816931698318938221376958793467162731414133682422688479936816456294771258118515319119933674581267932173835919321831877671292166157951639428837885631947118313418211382442991413378337237553462185262185252494524946723271988715484563876481441566187968916656751411281192814517383591841328672327395724199881335154456294464371522326147387145166149667416575993149641221495153444156472514314711778739114275439168687422717585491253799589548121947687826519927532281474138956299281471851162125711245831588953121947625439417686441265913918645176662516838466763651952373129821719119935875291465794135676816232769469114421611837295128261639428186757514678131364844236223124572313446541427433684441363427712581538478438123135474919523731197267133254134667312134195895481762587421971129821767434659358641793361781468444113345596238711399167146377515263641479927973158742992124976118292142967936117571984677175249222612813931118716136985741786815194429756935813365781778739199679113789779933481524345182315715929913916861889784197862178277733919216454851235628789429587529146983217484541144773365439674346185344258551129216121947618191193876489166261166982142541411185262786221899879186353754916876722125783716394288944171197267771258942873144358513385978358669731584118766783848944174885981621257165154224429979548613628251522326845961135676825439455118793681624228389667549168188574614274332846792321851738359971139997386476484347268163337197719631294513971482523756319471681827843942791448153242161579562387111225641734321141128114314713149641154868158895312396661191211138716682422179287254714976923961579513446541566744292755148396569251719463168964361835271847982846791752492178277713446547934671421376198265882173315828961534441342635928748156761288122148194619564117288594421616359853997621851423154453512638948843221853442132446416959619947723553441532421494655413895466389121543819422781152849813657395724145771812961981358787135474916152819714197256317423973452497248211443585175451128467917161519543927874183384749869313729217484541584915122957119826584583131829214181911934121158551158491563396619382499334831698368242291662616414471746435166365693277811326595289783634293681669453698325362589173835986211316333711475889815676146175615647251895841178883423824218312331665675413895121745747244618655561423395973158171816917181699166265855115324211338597112862111225647591441893822118919112457231946316176864412114131638813749391837296723272442995269595794531625295783372278622623871172826466627773277617814367458158693417827778338476218528661515148451235628337173173835949263644619938764833717381163819947721576839559263785391496674734916151425496674179691583491168384634726814678131219476145771814133177873969453612376472382421889784686468883613163881619238119726799334818433471292161613181163337116232765915676581941926126168788417989294663891288122847981855461158693412961985875291643466185949997113912255331554636541561374939458313131436916757771674517948911229571975177411876272565125379937149619947721413315465541421376134465413244641974582597624799524294774161923813931183182884596114678137773151986696176864415344414617561419357417933298812421971118717217726829953679953671516269165759968444114213761288122244299124774213264838782658439421439547148194616575991132659121341982173319119931122564143954733111618372961579512921615667441475889137695815849155996435471491621257187363214738719927531419357196246815546311871727954866137765996439751771267932769239347268111246957339628871711972679893111225646743469489361377619988116676941954392569358573396226128946911114679277731526247652137526959577434124572366425145427584798724821597624128812258954816858651996791866151389667155664978942918756514966741166982492636115486817868151944297161721969251779952441187634121193479768646187968917383591675771253799813657757125516864195439212638943351541217457357363134667316858651786815811638194227818372936947766828919745821296198777315134465416575994239982779121745799334818554611964487339192492636946911811638347268817695148396519261264885989428738923985754158782658944176763653129451837299691213931129679315142589845516172194219715814721136697116294417282641687884119726716212571992753132244538966716232762281474744651421376141935716131811376958187767172624513466734885987328972422812497611667694888361393111397148146781338562959156712315912114466389153847898325318332521348692948931437528165961817666251118526312945145368134465417161586817658194155664997113916858659832531988715438123128812249465563396695498718938225592634966741782777633966147588948657948657915849151564725164346616919229489318635371273989114275412275527874144418153847872482177125815142516212571241685135878714718511566744498693178681516717321195248163135267838414254141261875793467135474951686445831319119935471491744416815676185748167778912214959428737954864825412463181756531964487876246195843492636126591314637757429921847385613776442161135474919261265431111552611111448891864512255331665675337173385629714726155866813789777874116777893169833432327256524631898931167173267434616979795976243957241845366119322981769513688821982658174441611811159852728661511112469331116191199314233959489314415668499998843221714131178883419745821554631643466876246137695828266789429555225779334171211218655561992753175451168242216737518621139186455693581847385147185113587877894294986931911993112458326448952695913789772786224663894441815929917248211649523173835918857467712585976241861518166971313325415667441118526167778915122316682899529687349165774341221495696555969124986934583135592638197141479927168182773693555926319866966945364239919988117787391425414387648284679151626915929911744416132244516394283553449852727389548338478197141871613771258147387827794421615229211758549995367173835914617561544535187968915465541255818175653419952946911278622134869289845537149667838493681649869387826518736321261875714726139714829881218675757813531475889192612638361177672163135219119936198339125881294179466389629928183325266828911185266258917888341316388197256367434615384785713771528383444189691212416855168641871613172826444619913789778863411742397524941483965194227883788513123515283838641325491687833721952373164548518271954441813446541786815172422638159115142516131813311161433491665675119928618635371524345187767444187389541946316198871527862265213786211394691176722932778286698738954166365628669817484541526364156472511629441817111811151942278244299115284911286211831233587529131436915869341853442189382299132956935835534477731519543922644891332546359851189191193218365617566425166425112376471978626319471831233164952358752913688821964487242289166269388358358668197147793345814721623276139512912699511871613167577898455189786314964819714126793278337234323411876147387137292312945579453137493918574819725631427433178681541591428467936342736935198265818837275612821685865144964286615116616374219711756531461756623871789429112458392874163337119866961449642124774218413282685271613181185344213365781835271349287148598449263661983315324216763651548573122755216575991564725577434125178611757226128172826415243451611162195843417933474465444181744416184738589643637957214133815676952968194833539774311488111292161288122186757517585491752492817695135273573396878265365439664251163942833515473693593479713143691447623783372135474947244615566491296198193622119119931421376198467718372911427541865556173634174239718413281584915194227871876415828961617219672327167577141531912416854482188459616763651742397142137618372957743482173312154381552611682422199679111225641582896183123316535611271971657599178681562387111366971417338339192716745172422689845567434613345598499991699998167778914678135168645128265471496622325168641223514168788417888341788834135474959156773491641591486817387648197862164548519584312982171122564169596843942496674282661526364942873112256416919221843347183123394489277529619826581588953173432193277816353934323152838314112811974582169192216313521742397151828857743414657946359851776721772682292755561282516864198871511387161195248112458395498722814716979797248211772682185748163135278539186413214758891821138115688773289711649637611631653561286698585516339666319471338597177672369477835866161318116737514421618499995814721657599775296155261116353917726821368882379572866151143752877529659358658551623871164548513264831269951119121134869214193571582896742992154453529881212881221641447373515152636463396647446559156754714917444166945361867575167375117969119321832725652967931889784845961148194616959614698321825176174239787624669655515687636198335814721261875179287216939411855461118313484798892398371496845961139311415914175451183182886817135676842399153847817282649913291463775134667312517815586681996791178681575914499132911871721645485143752812275521136697111246997315824631856532775296152232676318229679318231573735156763651998811554638136571794891696555767226662716737512967936319471324464176258714657941338597597624126591311185261592991122553315263641191215249477125814819469691212174576662761175777125897921518312331518288688479146377566828912194766521371893822121341931496415263644381231817118675751988715182921481769513951297934671288122158895315122311819119831828559263298812631947242283674581425414123159135474913224455148451879689191199367434616919223149649792159771961253799512826198669618191191574821641447385629189987924833712255336238711239666555225156876373289713325419644874946559428738217333553445188832826616777891738359129417911912165819416656758923981451661625891952373194631619584369655586413219564111227552948931245723137493939572413163881683846179489116878841229571175451118251768499996319477571258661519812343896671556649294774296793494655193622158349116434661584915122957115263647268414758891851423417933811638183527117423978964361516269629928183325269857412295717853911199286526959154655413426359388351576839272565199881155261112396667954861213419892398146377513123575914497517716454851992753156472591864514112811485984932778288717339192934797183325211286211617219123562811912171472692874146983249869335736316394281189191668289682422932778678384145368823752926721111852637957214395471544535188574616192387429921554631443585134263519866961522326811638193218325843212114373515488598126591369453618998791441566569358228147115284918756511342635458313154251611346787389541823157835866164346696912369477385629164346686413213951291449642268527286698178479616555895498719382418372919745823836116596181479927164548586615146437197458242399161116252695912638944623511978625148451334559159299113971483755343331353755343634246235113123534323197256391864548859846235158147248859873491612114111448891662677933456532815676187767567339119524856935814758891699998316983125783766828918352716783842362231758549121543893681618716138358661663656185344275914416434669771961762587254394197862123159597624194429779952416697131635394663899469113533251231596561758378851784796119726745831318857462927556824222564131225533417933244299934797169999817948918661511439547133455913971488661516864676722458313337173466389165558686467187647712581867575942873185344216434661421376188372718292141193229724821892398995367187161314657942927551352731956411161521451661244299198265882577189643667636516656751734321292755983253775296193218339976259358681567651282618372912396662261285976241217457843942347268119322937149678942915788585754156763659448923492874643712114174643513426354825411938249529683856291619238821733161923871674599536713789776642511215438476484169394116313521554636198331437528173634111852624228343231166982682422122351411124691772682587529581472195843793467789429769239944892827791471851698574121947619988113991675653213123583788512598565148451326483119322916575991154868183325262992818998791768644183123372684246318724821993348464378277961175757541516878841148811198467786615116575991162944522921975177174239716616371344654183325268242211649633916864643736745813264831736341885746496674581472577434122957115546389845514133168384618635371132659146377563598514799271669713127398943812337149681163824833723218572684195641197517717423971982658587529186555617625871124583128812287624619846773432319866965673391185153343231546554167173224429914637751748454174845418171163942861781419362211441566186757512699512362231225533146579434323125178119524827458415929911621257148396514314711415319769239125581882577117121121413328669833717313688821899879182315713789778843221831233888361659618549168168182754916817686449771961235628161318175712518938228984552564134724468358667833721819119129821717767212578374219716985741469832157885814496428257716763656682893755343634213426355754151714131182315786615114859841782777757125146579452292165617512517811346781669713894417118515312961985794533856291548573815676977196164144719887151586934116496372684146781378135316131815834919792159872911231591875651132446459358612659135168641841328516864375534781353137292831828621852196852589441778539111992861124583186757551686416232761417338155866817363411185261181115985272193218351282638764873289711972671437528185142319866961778739183325247244631496478539117625871697979136686367636538361866151335154262479327784179337349163755341865556413895341211264489821733115486811326591998811261875144964219584377933412578374138951485984196852544418151223112618751978621623276399762452256137493915425161716151294179182315776318219281451946316678384199275379346712517878135316717321455699258432158491584999944619976722152636418796891926126115688783384717524921463775111852662185214839657369353775531338597121543811286215653216636561893822549168888362846791144773547149177672977196464371889784171211219725631225533666273432314193571954392742992132648315283832321855875297248219711391633371159299115828961312351645485658194143954752494166163712214958479813426351768644154453512558181857482927558479816838468863411865556189786116294411932294885981221495849999162933316454851629333115688715344415324219933488338476339661667694182113815344459964312396661865556763182139311969129448921142754118111536745882779849999134667312376471875651446199193622158349122814784999962387115283838621131415319419952488598179489159964313466735774341257837888363714961522326154251611528497773151437528186555617948917288591928145337173146983217686443533251164963158289626247186757576318211871721225533148598416676941429452187363257339659762418756516844418338476319473492871316388141531916959612921695498713729284192313567681829214114881128266163539944892236223159299163396681971434928718352711548573621852458313757125187161314395477591441877676218521833252174643517969117121121784796175854915768397853911128621177672163539129821752695934524966425127256582577178135315344416676948156761786815387648668289176258713385971645485162125717161597517775712518776788634112315916717325915676178148136571825176817695133657865213756532244299732897186959411286211241685448218154655417989291251783634237755379346798931162731452494763182928741483965163942831294512174576662718978692268316979791615254916897113938562934524915768391552611118919169655516172198459611134678175249224228161528742271249761926721742992172422616394284219711645485189382211548681397148125379951484513143699751779226831875651472446472446783372417933571377395724198871517989291241685129216122149518635371148811825771399762561282718764161529166267874179144878135344619914819463351542644893977431334559874227973158125581811124691659618162933341591422814722612812477421378977128812298123488634151686414657943412111516269314964791448189382286211315384781425414286698833847165961813527367232712598561742397189786514845611757154453539976218473859388356824221825176898455339192347268938835783372164548552494154251616131812786223432311467921229571573396387648813657823752167778967232718796891859499186151878741198669619382417343213694771712112771258387648864132116294413466732523757732774764841481946155866898325314718516925171944297954987123562867838458752986817993348652137357363833847135474915546315485734966749529681788834868171643466199679114395476884791294179116496344821862387118231573553444482181982658134667317948911257837524945128261467813399762147588984596123824287826516757719947721794891611757724821228147118111518473851378977156472516454851154868777315141128111225641718169363423331351122564383611241685349287136282517948911748454177873955522535332512941794764841223514355344672327991329151626987826516252956662738562992672113749391239666146377512699515653214496421362825146983257541515889531853442115486876923989441715889535592633129451548573135878718231571413378942986615111669821756532866988318281835271142945217666251356768154453545629428467913527313486927914481552611194227845831344216158349116616371332541465794198467763598518231579489313486928479854916819523731247742129216785391987291165759919967917813537167451714131156674418857461183134155261115566491471851175451159358618211381586934575415179691884322189786124572344821812154381883727171211212376471185153458313179691268527168384614516613634245225616172199489361983317767297921511366971413315788581356768676365815676775296876246127398995498713688823311161193229284679192814516616373412111691922389667843942385629131638816353925439452695911144883916867187647894291358787169394128467918554613351542685271215438132446418554611558668153645952494168788413628251512231148396515384785289781296198144964216515421469832272565331116944892736935512826124572343812316495231271971829214466389182315718938221926126464378964361798929314964115284976116386615114294521423395238242421971124168511932291718169196448719422787672237149616979791469832133657848657915283834239911286211475889133455956532419952847982988123472681968525821733199679113446541229571142743355522511871721413334726812457237389547874137957236543994489279346715122311532421654156187767387648716745153444172826411669821431471182921418978612578376319471364844757125125379968242295296813729218796896561755935861974582625897611635895489872916561754966741978621528383123562817141311653561195641193479719745821376958278622635985199881474465969128681715223266844418378851574824219717934671738359543111134263579144879346713688821875651123562817827771623276198871579952418978619685258237528863411982658159299113365785754153957241645485186353717666251566744136484438361158895324631861377661175712174571699998373515127197133254417933942873118919119584315546352897814556991485984179892998931617814162327679346737553414536818413286157957752961685865316983188372739572415788589428738176951825176524941788834286698119928617141315572441871613116496324429912921645225657339612517882375214698321419357912588178277734524916818271611162112458316999984219714926366299281746435367458163337112982176541569166266864611891911316388175653118111511952489731581633371888361778739168182712982172725653714961526364183527111326591455699696555113669719362215471492281471518288912588866151121141376958254394165154219543924946551671732121141485984849999198871514193579287416818275875298318288964361877671996791791448151425226128256413167375114294528641321942278442161166163745831335534418655561195248833847174441614173388742271911993199477217847962644891964487625891114488591567969121958434744651687884165356114718518883613688826844411786815169192216434661623276575415813657169797912982176359859812341671732359382918645121142786226359851455699682422518883353325196448717767217565339168633717346638995296837553441591413547491118526148194654311131294555926316313529691213729288634113244641651542387648187363291662648456144156615243453694771926126139714815243451831233545131867575928747328976824221455699158895313668631827195738954172422649869395498784999913345591368882139916736947719644879792151223514577434987291128812213688821964487165759918615181342635151828817928721691922383611253799411876181717288591645485183527115243451867575183123349869312477421273989148396595296812719767232798325317444161871613169596613776114881116878841249761155261113931155522512416851362825312945146377599132939572478942938159197517719261261972563969121229571122351457945319866961996791184334737755311851531794891151425518883182517648456799524688479698574172624515243451984677975177658194876246172826449465511568871675771833252585511263894589548165356158752961781415182881619238932778147185158954844619925439414819467712581853442815676228147114477398931195439284192329477462992899536723218537149659964315687631393111665675664251387648333135155866812638945612826258963396617686441564725979215162327623218515445351651542112458319564111879689161318115687638782656117571271971259856132244518514236642514986931241685182113877125813668633492871459737678384581472125783719685259448921819119152838383586614193579812341675776319471899879174845474299214799271899879177873977529683384719866961982658195237312961981195248163539123764726852717423971185153559263178277712457231861518161116294893419952694536152838339168633313583586693277833919235736315768394663894219711833252144358516919227894299973864199528217335451314395471261875379572228147118111593277872482121199513567686844411944297148396513668631829214113669763396616212571885746136282558954814839653997624764841875651163942824833719543921867575165558777315124168513547491566744355344611757116294418716136884792543947954866541564542751215438186959418695941437528625891788834763182492636111852611568872725651641447365439118919196912462351156876318877651895841158895394893192612682577115465543694771457718153847849667433515487422752695915162698863419852721112469135474993277812982171699998148194695296819967914946551336578337173139311696555145973777327716757717787391576839934797125985612982171451661164952314213761861518944892139916726247821733198467715526119913295855119644871827195985272254394589548819714145368129417976318249263613789771683846137292187565111952481744416688479143752812376471716151223514274584565325491683452491534448358661958432261282685271538478819714484567712584845679346711528491247742633966629928662232142743317989291784796934797146579478135334524991864511811151665675186151813244641395129134667318675751685865118313416818271566744164346626247146983211952481948335288717129417919584312618751639428119726713385977672218695949125885168645814721788834819714936816876246159299169453611568871136697413895132244557945361579559964318655561235628182517617383595834919489314375281651542466389147185126852711144881623276177873984192311952481132659113669733111611891911417338123966695498712396664421611685865183729152838319644871342635171211213527313345591651542726848257711342635591567795486145368133859735534423218517242262261285996431193229188372765213762992862589159299187826533313513951291766625292755193622141389512275521895841141531913567681568763987291196246814133141531919725631766625131638812719772482111932293331354986931247742589548163135212174576561751245723139311175451177731534726815526115229211249761174441648456125178983253157482621852292755599643672327188978452897814536845629415243451712112198265814496425653284394218998793553444764843876481998811948335876246158289691662646437771258377553187968945225616131811633371123764713163885612825289781724226985272183527119523731926126367458345249555225144156615687633331351475889122149556935819321833896679812341748454948932442991734321197256365415611387168318289186451746435886341843942874227415914286698979215181711932183785391664251179287278942913385971485984113669714193571132659337173135474919745822362231259856185142313325414112816682896723278176958843221681827111448839774389845511629448116381817176116315546394287311932292947741677789135676817666251938243129451146792989311669713783372141531916111622523758338471136697125178151828872885961175741793328266136484497719612699516743463856291837296622325148451831233121341911932294219716319474482184986931786815184536657541511488117692392786221685865569358144762363194718514231667694528978779334174239713789771144773617814371496168384619826581619238167173252292114173384441818857461768644147992756128223218512719714294529691265617523622317969116535611146792189786142743314395479166268459614239918372916737514966741954392282665431111714131728859682422583491146781312679326117576339669166261782777184132812497613492871156887146377593479786413217625871457718156876315384788378851699998174239713466731332541685865399762316983199679135534433717315586681352738237521944297581472146175697921581567613426358176951685865142339518695941481946196852514718518964361417338176864415384781259856652137141338499992463184381231271978621133149641978621756531859499864132256413567339129417923824215788581582896133455924429911185267914482584325733961534441221495916626464374865791441566121543871674517767247446517847967187641726245136484411286215693581693941197458218191198358665612821639428635985771258126187513244648197141156887133657813527317565317969118675751128621111852681567677125817585495875295128261948335116294413143696541561649523119928618635371728264833847183123313163885148455451316212571687884168182793277895296818473851441566114881112699511439547199881191199371472617928721845366196246816838461269951989311681827182315725843298729161781415223261364844135878771472651282616434664118761269951599643724821187968997113916515421251781564725874227126793215445351118526143349186353714213764562941364844153242118716133735151227552155664911427541879689133455914718511992753163135216838465491681744416184738519988192268317767211851531532421892398732897172624525237535938213365781992753181911914516616945364421616824221726245119928663598548657911972671829214783372112862168242245831314718518923981988715192814518554611942278583491938835674346575415524941524345116294417585497894291847385121745713244641189191134869218191192846791651542573396141935762992812214955188834865799327781271972927551964487195641115546313991671841328111448825843214193572644891294179621852115688757339613163888964369388351952373944892121141643466142541441995215223264583131223514577434448218135878714415666581943533259186459973861657599167778956128278337217343214199521411281162327614799277248218338471671732171413161983312881221338597146983218372914133488598371496987291898455141331687884141531939774381769516252951631352728859129216349287413895175653728859173835915324211376958179892993277819988112457231926126781353164346639976288634158954816555815485731819119193824922683621852238242252375146579439572439168617363419362216541561623276288717134465416212575511871241685946911989311273989476484987291456294136484413527333717371876418473853836194489288836682422716745185748179287279548638361199881526959136484446638918938225612825834911469832922683767221215438126591391864556733951484512517848254111124692826615182887853914724461948335987291122957115243456258921199512174571479927583491118313498325318615181667694137695811851531879689157482143954735938218837271576839347268954987143147118897846218528197141716159832536965551677789151425111852613123515425161455699936816795486522921134869258954816697132786226238716642511271976521371738359676365585513694771235628136282518554612483371683846156674437149684394238361294774674346132648318433474562941671732124572393681689441758349111851531112469777315167375115263641661637183325283182888634186211386211312376471465794179892913244641883727472446155261111185261762587545131348692154655414254147692395713773674586884791374939211995688479472446714726113871615687639893114476231475889732897884322714726126591311225646662762387184192378337287422716353917948913694778338473775537167458116381936221189987917545117874152897893883555926317484541712112133657818171121745752494198265883788589441717948911968525862113985272811638143752833919215546359156742399672327183527168646115486812578371334559282661782777145973724429919826589388351754511153242119584318958417813531138716494655142137626852713466731671732172826478135318534426218521873632942873121341988634169857414395471938248843221784796198467715263642725652463181869594458313187767835866121947613143691728264886341339192187968915223261114488415914115688715828961231595895481863537169596144964287826526852778741129216791448353325188574619624684845651282616232767934673997628156768762463149643593822422855926311387169691234726812497611269951152232617181691221495621852264489143349146579429477489643671674533515462387198931145368462351482541148396573895416394281197267847981358787113669714678131968525121745776116389239817524927429924482184724465713771671732621852141531925237511387167429921655581851423132446471674511629449166261657599498693144358516616379388351118526654156444183533251364844817695172826411346783977433169831778739787411259856954987112256416858654966743876481675776662714435858499991134678185748163942814597371269951494655125178151223127256571674516555883384711649636561758883698325312457231183134141128111528491267932139311573396593586549168565327874117363418635371223514154857367636519786255724414395471714131121947617847964885981397148169999838159193883517585491296198195237325843213729212618751857481461756181911977529618978611952483351541136697133859778135373289733919281163818251764663891249761155463143954712214951166982738954182719547446566828914718512826614112811526364264489177873986615152897843812356532668289357363629928156674455926313486921348692118919115445353836118998791972563694536272565146983278942916777895935861257837819714185344277731561377613587873553448156766985749893157945317141311938248197141447623119121187767159299111326592988129327784583137268479346724631817787391611162347268194429733515413789776157959711391978621419357142945215586688378852261288156765754151611162163942813486927995241245723176258773693556733919967911118526516864189584137957229275541187613567681897861932183161923839168616999982442997631822362231439547192612692672117726821536459142541463598515425162584321352731978621873632288717171816992874343231296198164346614415668944171857481352737954861996791369477162933335938214233953412113311161362825343235431111823157135474916515421465794122553361175781769511488111544535716745977196823752954987522921813657991329488598652137761163347268734916918645948933371731334559934797152434514213761885746565321336578288717158491516111621845366158491516777893553448661515289787914481354749353325732897833847292755621852738954991329599643187968925439446437244299154655434524976318259964313224451259856153242113688825612821148811185142327862233313528467917969119382444418172826417464353654391657599773277274584674346244299248337137292581472137493961377612154381546554187363212275527571251362825179691198467719988154916825843216636568217335754153149642442998459611786815252375444181736341271977752967672216454857167457914481399167813657165558355344168586582375259156747446515526112261282947741156887198467779144868444111568877167459428734926361568763458313199881979215175854942399159299119685251193229252375185748184132897921516757715828961883727132648337755368646694536123159771258316983171615488598375534196448773491634928715828961748454162933318332525673391627314114679219442978237521556649131235466389498693184334713729218796891558668174441616293338762463795721338597197862139916711831346541561932183132446416152174643516959678539119826581691922112458362992812194765148453977439267211548573167577862113141531931294518271951376958194227814556998499997813539812343634299536789845515849151661637183527117121129347975693588338474199521415319773277522921182315714738712416851681827139714811831341344654593586526959194227818998793815911893822763182151425371496912588173432115889531259856166769417625871776721187172476484173432111831348217331768644522921476484151828852897817888344825411469832161923818171125178123159492636146579417282649327783735151423395165154219564115673391728264156472599334819442971136697167778913769581962468185142312396669792151485984143349168182758147261377649263614536856935811427541726245369477339192142743375712514375282846791738359157482135273114881128467939572419463168923981627314694536167375199738651282613971487328974885981784796518883158289618655561823157144762312497611768644189382222612882173315647251467813143147111225645875293755349186451348692155866896912286698196246894691179144893277893681618433475289781368882611757171615163539692517912588146579418231571619238371496184738512396661441566573396135878719644878863419428736359851362825123159146579495296892874147387136484463194737553451282616495231576839512826954987174643558551619833688479114881118877651714131942873211995162529572482133515434323742992118313412275521296198771258169797917726821259856144156615869341538478284679168384612739896985741762587114679278337219119935794531623276141935725439472684452256341211145973716939411322445115486813426351524345161318114738772885917827774219711453688217331932183547149716745411876954987143954711185261144773678384158289614657941986696474465187161358752916495231835271849999898455158895312517813325419866967712586238711251781586934153645944216114617561146792131235115688718514231451661182113834323119524819119931522326347268113669713163884239968646228147165759927458418615181619238571377175653189382214133571377114881167838498527211568879731586561751378977121947619281451843347141531941389586211345427513547499731581528383492636165154225641366425119624684118761726245862113115486842399195843343231189191172422616535618277976116318938221651542526959623871864132238242421971337173133657811568871542516789429635985146377512982171378977142743316353955522513385977268411124695794532947741576839164548513951297732771138716185949955724416212571817176923916596188277994489217444163795724482181984677417933528978599643133254124976197517714678131136697819714444182543941447623773277198467718796895713773472683896671728264456294391686357363316983174845416999981221495357363146175619261268419237995243412111825176182921417383594239924228413895189786163337162387162185214758895471493856291411281119322914112814542751691922155463166365674299216858651247742123562838966714799271681827161923812457231611162168788434928787826579346716232762362231714131121543812618751821138944892617814397743126793271472652695967232712457231887765666271223514783372874227524941437528157482187767184334711669821617219191199315849155875291461756188978411972671724226121543813466731354749118515319685256662766627141331697979619833696555122755279952423824259156724833737755356935817444168843221695961437528177873926448918978619826581112469896436938835125379919685251112469143147111851536925173876484461998176958964368136571156887198871516313524421613916861645485134263518716136541561752492359382825771143954718635371776721639428137695816757777327756733911629441659618922683169394119947721663656152232618453661611162185344257541593479714859841479927373515144964212659139832531651542166769423622313264831152849186959478942981971417868151631352129216169797977529654714914193579448921265913133455987826568444118655566561756541561213419171816999334814415661292161861518161116211972671691922188978411245838984554583131334559158491517383594159144926363735157934671514251516269581472868171932183146377519523731778739476484585519489375914434928717161514698321736341475889547149894417886341111246942197162387175712586615114213761823157146377516596185269591449642448218135878777529628467916212571269951678384151425154251693681656128252897811669821183134132648318372916535611819119145368194429713527329477411245831899879286698577434761163142945278942915445351471851452256678384262473957241889784112862139572413668631118526172422614819469186454138951338597133254355344178681514193576339661433495431111582896187161382577111387161996791143147123622315869344482185289783553449711399287416495239913291267932134465434928728669815243451461756187565117948911528383116294413486921124583599643652137119726797719698527233111614597371314369878265166971311124696622325491686642514522563654391122564123764798729118372913385978621131134678678384813657561282694536142339517989291516269946911615795526959484561635392584321952373985272462351188372766627896436148598414476231259856161521665675742992178883449869319261261972563111246913486921453681514256238716157953755341699998127197371496161721912315947648428669817868151586934135676818231575855119119931893822631947833847148598437755341591488432218958411522326167577623871162933317524921219476246318385629779334113265916293331996791146781335332519584316838464583131261875152636416656753815911659618569358153444195641116636561758549331116164952312941793169831292161118526125783746235119119933714963492873533252786223977431245723686469267218944175249419947721625295142137691258811992861633371694536121947616172191185153738954124774215142511932294865791944297496674142945275712536947711447732442991792872194429734323696555121341918171167173212982171112469189382287624612396661548573183729843942684441124774245427513244649549871457718142137668444127458415667449832531792872135878791662618171139512945629444821811932291528383696555969125754151837291659618232185119121985272196448719745825511871191211859499182921418372962185291864515263641986696343231788834339192129619856935816878841653561771258549168179892979144817383591926126672327141128154311116979791421376995367248337186353719967919953674421619428731627314282661475889116294465415617969191258835332515748214476236925171978621255818129216199679192874995367347268813657151626912679321148811163942811286215289781425414617814688479136282516656752644891833252196448754311169857416919229186456218521451661256413226128121745715586689428736824228116384744651752492619833991329146175615223261859499946911198871513143694764847692391853442147387557244145771811225641673751187161341793318594993311161768644151828816596181968525171211292672128669812376471411281116496382173316777891758549264489162125718857467349167288591128621127398944216193681613345596198339388351792872331116898455112256417181691191214583134441811871723351549267216137761395129111852618655561867575444181831233145368991329198467716818271215438121144159141469832165356112255331334559159299119362211479927298812188776533515416919221986696268527125379986211315223261475889118515311185263755346925171873632597624168788418251761366863151828861781412558189428734583131566744458313174643531294517827778621132483372624718413281693941158289616333719832538681714112819469111968525262474199521217457335154122957111346787712583432319463161899879985272742992178681549465552695912255337611636258939774317847969691238562912194761344654143147114213761661637242281588953256413211995195439246235117585491425414656175932778177672198871511649631292161417338446199246318126793218857462483371724226146579456733929679317181696662713264835289781845366198871526247137292773277143954712477429388351522326199275316535611631352381591773277486579294774125581816212571193229985272168788414334913244648136573775531322445621852781353559263125985613789771532421156472516878845733969872917389548257715128261144773146175612941799368167712581225533169797958752962185217989295976244118762786226662738159111831343997627187648964362967935229211395129298812183325215445351263894377553187161384394281971423218518473853634293681618312339529685935867914481538478296793121543818635371294179187767668289123764714274331687884191199392672175914417484541564725849999178277717242261837297752961586934577434423996157954482185128261296198112256411366971669713125581813769587672218433471623276785391442161841923886341147992714415668136573775531974582166769425843217969115182889832537752961574821437528347268417933666275572441766625333135153444151828836543915566491911993589548123159767228984551338597148194614859841138716298812113669716313527429925289781994772122149581971416999982786221667694573396876246518883172826411225646319473553442826613931111286211536459168788483586661377633313519927531885746194429711387163634214597375612829448928681762185213123514698321574824118763412111326483347268823752172624515263641354749169596152838348657952897833111658954814577182947742261281677789127398926247419952668289162529519644871643466147185118796891877671772682119726752897887624697113922612813547497914486824226238711629333168182781567618271954986935693588923986218521417338191199325237513789773492876884796117579287412699511728264167375117767214213763331351746435236223771258545131871613767225572443634213244641685865132244529477415849151332541193229146579484596141793338764814819461352731378977377553112256417242261415319186959452494118111516676944199521588953128812214496421853442377553178681548859818251763896671257837141128113486929267211231597672216919221245723187565178337238966714678131463775672327896436145973718776773289713931114435857732773674581631352791448118313418716131683846139512912598561954392154251615687639166268621131229571619833183729123764766425158349161983316394281928145186555618554617631821746435113669716192381455699187968916777891851423197256363194717161514597371471851151828814193573472682523759792157369351191217389546319471316388113467816737513714961544535167375118897843492878782658863414421614159144885983957241162944136282577125826852784394218796891459737716745656175585516945361362825139714814476231162944656175126389444216166425118534421837291471851375534192814519523731926126716745274584191199336543969251714617568156766622321758549121543854513557244134667318473851926126987291123562835534473491681163816414471199286182719569453626247143752897719616878841911993126591312356289469111978628762465733961368882158491516596181217457163539164346678337216838465855191662616515429933487894298863416561751657599232185617814126995117969133515415425161439547141531933515418453661714131134263514395471225533187767918645773277841923162529514859841239666133859711144881219476785391379572115284922814725439462992886615165213713991671752492886341438123868171871613139916765213765819479952438562918211381546554847984724461956411114275455724412921699334816656754381237611631556649134869214799277853913654391221495975177154251646638911366976884794199522584324381233815911187172314964383612624714738754513177672155664916212575996431475889286698162933319786213749391189191184132813628259549873412111837291621257126389414839651352738762464482187773152564137874165213716818277813531185153162327619745824643749465593479725641386817116496314133296793112256416515428621131861518573396131235593586168384665617514274337571257268414435851122564785391197256395296817383591972563169394194893155261119442974138953371731942278656175161521851423128812229881252897819584386817466389167375119463163533256824221219476767221792872146175668242241591415586685148451883727395724345249195237311891911429452571377175653155664988634143812336342128812217928725269597813531641447896436162125775914416535611455699946911714726736935312945954987512826126995117282641344654397743144358538562967838414334918453669166263775536157953755347591443977431185153184334784596114536813628251716151427433143147186211398931173835916596181142754189786876246932778472446124774215788587389541512231813657147387166769417282641954392128812229679371876416979793391921877671136697518883194429726852777731528266129821711185268782651728264152232694287362992811811159832531829214131436965415611932293654391552611164548598325348657927458417989292887175794538479893277812558181221495512826113265919362211292163836165819478741155866847446516737511461756458313197458219967918984556945366218521253799912588194429729275571876411366971619238135474911851531752492134263518191191447623387648199477215122315996431691922188372728467913991672564139872919953671932183587529763182162125719786216697131241685343231479927124168515425161431471131638818514231633371696555158491519362211697979343231574825249414153191827195143752816878841643466116698214496423472681938243957246258916959687624616515429812342442991399167176864411245831841328143954749667412457231988715773277144762355522567434698931314964183325219826585834911756531334559174643511932298762461443585549168122957122814716111629125882483373533251659618365439189987989239838966741187645225615526114138951742397169192247446516757718251761964487736935156674447648435938265617569251752695952695913224458923984724461366863236223419952488598331116139916756733916737511124583341211126389448456613776119524819826588782652543941792872175653843942793467179287214839657571251259856692517656175153444189786186151854311162185219947721255818811638133657896912718764132244517928729428731744416419952811638615795896436421971148194672684119121182921419927534926361869594142743312578371516269136686313547499872911619238389667716745175451193277816858651825176347268124774216979797773159933481322445791448161528944171459737137897748254148657913143697389545855188634113769581683846188372714617561227552377553543111684441292755118313498931242284159147793341255818122351414617563694771948335155463182315713749391356768192612629679312134196238719125881237647454275125379911992861376958417933615795246318121543818756511756531362825195843973158734916185142361377644619911225641148811258432312945888364724465794531958431241685135676812679326339661639428157482623871734916122149567636517545111136697172422688634169251711932298923982483371524345178277761377613668631746435167375111669821259856158895397517711387166925174461991554638318285653271674511972679812341861518357363147387145569915445359832538499997611631932183296793492636335154349287166971367232718514231249761195843545131948335684441559263581472133657816858655814721231591294179876246791448148194618453669469111397148365439926721341211785391413895472446975177133254119121623871186151812255337934677672227862263396647244692874896436184738516858651144773139714812679321986696952968194833512114732897194429715687631419357343235875291166982847981978621714131248337341211194227831496416293331851423139311698574868171784796567339175653176258712235141695961546554716745799524918645369477476484333135131235365439549168417933462351186757514395471911993126995115263647813536783849751778479814678136743461897867147261483965145166122612839168681971497113999536757137755118716777891938246642518964361762587144762331496415687631217457662232134465413325413769585128261433493391921554631936221884322512826173634294774674346462351969121683846111448898123411447731877676299288156768277915182889226831411281111448814476231827195345249771258296793985272126793254916812659131267932187767142945215283839428731867575314964892398185344272482178942991662617989291114488575415498693936816494655152232667636519725631786815728859173835913325487422716596181397148864132575415166971318695942624717666254159141316388569358154857319745821516269716745591567775296148598461377614233955976243836163194713951294663891332543714968923985834911889784888361229571171211212739891825176985272141935778135317484543533251298217151828819846771326483135676815122311538478199477224228141331817137149617484541718169154655412315998123413648448378851223514189584118413288863411992753349287254394395724888365976248843227732771695964159148176951526364379572886341169797971674592874153645956532129216686469287498527214415661447623486579623871997386143349153444526959118313468646674346174239715283833836198931849999359382783372139714816555811932291225533868171861518494655179892915364591831233948931994772696555169394198931179489152897888634115929911724226186959416535611675774623511221495183729734916189584148456446199878265565322927559711394845613729215828968984551538478789429314964981234115688794489286413286615116212571677789155463148194637553478942911286211118526815676111448882779157885815182881213419153645914233951962468331116543111131235164952316394287894291433492119953795728863415895481899879153847813163881431471143147166828984999978942916353915283835673391574821619238773277144156619988113385979792151181115157885814435851425414589548148396581769561983377529611467921156887815676823752678384676365176864431496461781488836379572928741833252662232172422641187661377639572431496434121141995215546313749391994772876246254394163942813446541734321761163944892268527969128641329812341437528896436129821715869348944171986696129821744821815485731288122125379919442979872911588953734916197862173432136947718171286698589548454275528978759144185949913365785834915774349226831744416127197139916711891914542758237522988121766625625891471851177672196852514819466965556137761514251146792125178991329314964866151631947482541672327137493999334819281451972563137897786615113789771982658423992382421869594121543819887153997627914481554637853919852721681827585513169831792872195641115768393876481659618196852511528491845366835866421971773277129216918645973158134465415122311681827185546115889536945361397148238242664251294774113669717121128923983735155976247833721829214185344267232722612819442973391925229211483965799524476484143954778337214758899186451714131196246889845516999985249462185216515421344654125379916394284643752695911185263694772543943815919691218231571762587969121964487314964118313417686441443585742992975177971139894417666271433499691282173391864549869311831345814725572441112469134263514173385168649812341239666868173634218514236319479711391635391372923149641548573728859134263597921573491683788512275521794891168384616878849347971895841121142261281431471284679193218316273141758549482541928741798929136686373289713991673735158984551825176144156621199515526119852721942278194227883788516131819549871988715174845415243457914487248211621257142743313123512961981615273895452695914395473331356198331146792462351847984583131697979128812274299218453661136697819714198669615465548419231413316555812618754845622814713385977369351124583195237392874417933868171326483171816973289771876417625871267932817695189786849999633966195439215929917833723371738479812699511134678167173291662612618751417338573396371496122351418594991871613847989469111889784676365166769468847955724417666251845366579453989311819119165961811528493391921667694454275161923811669827248217752961356768124168516555819725636642511996791759144938835156472545427518433478742278923981227552171615165356118332521271979812348439421798929177268291258816212571877671578858728859369477174441612356281213419174643518473851932183133455993479768646379572587529811638188372718514231697979678384597624452256159299113486922261286985749953677328971996791116698279548678135397315823218514314711837291411281411876189382216414471952373189786161116224833711952481413319362211261875892398195641111467921112469981234183325218938221972563188776566223262387197113912295711332541221495516864787415249413628253836173895461983312982171524345666273533252543945693581162944158693449465534323156472551282627862213991671798929894417148396537351512114141128117282641948335186151813446544381231154868122351417847961734321587529175249218736321164963125581816575991744416658194189786187363213325415425162826618312331645485862113514845555225182113815283831421376153444176864418776728669881971434524969453616676941473871645485145973736745818998799287445629494691111972671784796142945214274337692391546554587529183123335736396912262479267218762461552611238242462351186959448456124168513991677874137957219543921631352147992774299218675757389541413312134191938241667694143349611757575415793467153645912699511671732543111159299194691119988116697132281478459616258941793372482118171815676791448176864419442972725651734321742992181714986931556649561282971139884322164346693681618433471249761714726621852294774987291124168514395472685271217457176258798325317282641156887979215167173217888348661511132659343235653255724418796891257837272565567339139916769857428669842197117484543472684764847389541829214759144133254191199318231571582896184536612114211995154453511811158883614112811699998136686355522519685251792872736935147387399762118515316414476319475673391271977934671378977172624525843226247162327613163883977434724469125881354749112256414415661819119114275498931139512916434661695961542516118111559156746437164548593277817121121617219143349492636545136178148116381617219662232759144522921383613694771964487152232659964319988155926317948911728264292755152232681567693479716515425754152866981364844133657817868151798929288717981234363422624754714933111618211381449642192814524833716939414583133735151946316145368787416359855572443472684966741786815197256344216114799271766625176258747648417847961273989169999816131811994772942873166971315788585229211344654892398175653182517616999986884791225533775296168586542197114536815647251744416193824183325263598518655569933481358787912588444181261875133455988836123764716293331617219113871611952481251781954392178277759358619564111974582163539184132819543926945363836123218511851531215438926721926721296793476484188574615869341942278583491787411996791161116291864511548681249761132244567232761579512598561582896888366238711772682571377143147119321831518288111448877933415122311669713472446912588512826123562813628252644899771961433491655581552611127197567339991329116698212416852866981835271934797793467399762122553335534418211382624778135381163814698327429921237647177672448218185949916616371956411162933397315817343211754511773277585511312351338597928741754511518883476484189786189382212457236864645225644619917686441972563312945168182717484548863411617219894417111448855522544216193883514597376743463593821893822975177118111525843249869319483351475889272565167173215223265168641217457179489111225641685865187565133919223622315889535552254926369913291661637114477348859818453663412118277989643644216141187658954813769588641327611631582896125581838159169453686615144418133254162731415425168499991334559164548549465546638918211387954865188831665675557244561282876246127398934121195296825237544418363421162944413895197862116294445831316757794287363598511286211911993191199312497613492873896671873632161527349164138955996439327785653262992818514235269592927553391925754151332543735151932183167173213264839953671312351651542884322129821713789778621131124583242281649523155261116919221368882684441292755561282144358519947726218521667694581472849999312945179892915445351889784821733188978462589993348783372174239787826513971481835271163539454275375534684441183123312194768863413977431855461132446417847961847385114679246638971674512174574138959711398782656783841332541294179158693497719631496418514231895841264489761163847981544535417933119322917868154421617147261758549728859547149136282537351558752917484548883681769534323127197498693272565845961133657816333714885981362825559263123966644619918453661782777268527196852512275528237521766625676365178681587624614375281191211213419397743126793269655514254141249761371496167173212255331197267172422615647251691922395724135878718998793795728459616299281724226124774278135314314711895841676365111246913466735592631485984165961812235141734321175653164346618271951368882173835998123461579549465512477421415319954987121341914718513694777369357894292442997833721544535547149314964823752175249277327711245838944176743463311161342635183325216676947752961227552135273187565113991678984554926367611639953671195248573396171615147588914738726448945225616939416682897611631514255814722382421292161122564151626995498733717317524929691211286214744651441566152636415869341887765124774219442971734321512826141733895498792268315344498123415687637914484138951324464684441143147127458417686441845366244299942873583491446199166365615687631411281119322912255338782651653561125379956935816737511968525199477218271958681719422788237523533251736349852728499991146792139916714133763182198265877731534121119422781399167113669715445352523751185153192814511568871544535395724268527862113129821741591412699511162944189987917383593311168782651661637146175616737519751771748454559263185344216636568762461645485169999812457232745841441566171413111932291433491229571119121383616945369751771463775167173216636562463181548573298812734916629928181716218521754511799524114881112578377591441199286153847894287315849155996432826616656751633371819714111852618171129216154251616838463856291473871651542188372711932291453681796911833252862113847981582896118515377529615526117389541288122135676817969147446511427546117571419357157482199881357363185949918554614663891253799129417934323162731411851531162944837885442161151223118675751665675135474916414478762461944297498693783372118919181567696912133254981234134263597113911629448742271124583168182775712517565376318234524925843283788577731577731515889534986931956411971139124168529679319442977732772321853735151485984198265818998791199286162933318897842119957914481441566379572383616258999132937553411225641451661172422619685251415319187363268444191662658954833717399536792268318251761183134514845635985512826169192218554618641327328971461756732897781353442161183123394691168847955926358551763182122553316717323795726945361189191452256137493986211367838413628258237527914481742397192814516495231378977599643119121331116577434196448768242215263644643741389554513246318176864478942937755335736317121121465794152232619988116273141691922391686252375773277129417944216159762425843215223261661637119726748456282666561751223514874227736935769239973158898455184738518635371366863195237314173385875291627314272565692517189382218635374643776318297517713466731972563184738514556996359851897865673399691219988111811157571259388351964487123562813486925693587369351128621991329115486818312335895485754158378851998811356768359382256413146983214536816636567752965289782584321354749175451118716138681711669821441566369477258432193622154714917686441998811336578162125711346785128261453684179331514252887171619238658194496674136484419725631899879189786997386142339582577145225617121121536459892398167778936745868847919745821483965472446153645929477411488117752965693588661511211461983381365712982171691922123764713587874583138156761762587823752819714121543817423971718169158693415748249667484192314698324865797328971576839193824115688762992813123514294521134678419952142541413345593169831869594137292186555647648415929911956411716745122149511811152523752261281215438337173156674424833741389536543915344497719615828961229571188372736745826247169797997719615869341649523189584173895418857469832533634255724426852717827772846791314369163942815647251582896246318185344269251744821812497612745848237523149645754151144773165558135676837351514657943149641524345129216141935737149612154385612821734321137493916575991796911522326176258752897819362211752492526959135273662232174845418796891675777389541823157238242133254442161288717141331374939143954717585491215438985272166971315849151794891199881119524813264837773151942278199679117242269226834845611629441772682635985164952318292147591447349161928145843942183123331496412174571873632182517617444161568763188978413365781429452135273456294126793211811153311161552611189584187422713123593479769251718574814173381548573165356113163884159148318284764846541568217331471851124168515122319469118338479125881181115194833578942913527351282618695948883616717327833721425414127398916596181465794555225125985615546312881222988121954392136686313486921627314199477236947716434661166982144762316555816999985895481298217379572122149518796899852721742397973158124976198729197113912214951395129139916719564115976245269597248211251788742276622321613181129417913931146638961983373491611851531655589751779893112537993169831833252252375795486183123345629413668631742397375534112862157137754513349287698574559263186353716757719967918923981374939118515383788518978615122311411281175451117121124845645225694489215546361781479346712881221457718288717152232614496421578858184536611124691633371163337134928786413214758891748454141128197921558349138966725843278135366425118736321247742182719562185215182889893198325311144886561751817135534435938215243453573634138951746435183325212255331187172169999815142518372938562922814715465542967938742275491681481946111246979346734928718534428197141465794656175874227119726716818271748454391686948931962468174441676318289845518998791958439731581136697187565115647257752961136697178883495296859964347446514556991685865121543818191199893112638941728264172624516535619731584926361768644458313385629339192464371183134238242165154211366971984677126995118837277429925673391994772559263182921415182881366863278622472446876246789429144156618958415572446258934928781769534323268527686467874157541575914418271955673391465794611757148194656128229881218372934524915889539953671269951182113818776712638941298217143752815748233515487826519725638237521861518656175597624122149517989291897861451661126591349263615667446319475471493533251312351364844738954198871516737511661637912588172826414233951829214892398862113178883411144881829214124168576722476484127398954311113446544946558318286743461671732129619813789771714131514845189584119442971134678189987913345591988715611757912588565329125888641321156887454275516864183325272482117282645653235534444619916737511538478728859141338742271473871352735693581944297369477113871619988114112815855112194765511877611632866981334559369477454275145166118473853654398621135592636985743351544118761514256319476642511879689175451152897883384714536884999913466738843226541561564725178277794893932778151626913587878318286642516945361245723151425124976173491658147213244642927551714131135273154655489239816192381681827413895157683914395471259856969122483371629333268527629928333135835866399762916626738954171211261983317524928338471366863198871568646936816488598912588133657812598562846798116387349161883727111246933919251686417888341859499954987153444137897768444166223213668631393113896671269951442161189382214698321332541984677182921416555877125818372917847961217457415914926721482541633966658194158693418191196763651294179916626153242116818271134678169797916636561716151352732442992463181643466516864991329168182784999913628251241685115688715324211122564674346145569982173318695948964364219715653213628259872911617219197256357743486211348456587529161523795721199286458313969121348692198265816152194833518837274663891847385126591384798349287292755512826121341941793393479717343211693941127197666271292161316388761163171211218372926448914859841358787421971141331162944837885147588915425166561751875651862113185949917545111992753188372751686416353971674513385976864644619911912114657949933481344654187363223622365617512517878539189441799132958551136484483384713951291399167165154218615181681827118515394489288432236745837149615263641823157995367122553315243451183134167375149263644216117423977611638883619826581954392179691631947339192454275815676728859183527162589781353363426218521623276228147185546187826554916818958411193229456294146377576923918635373533251899879199477289441711932297914481554631625295767221433491661637186555629881216232767874142197114758895814721627314183729617814688479118111516818271223514186757516555827862294287316414474583135168649448924623518681748657914516611223514559263831828127197126793218372955522552292112235144522561693941385629987291145166161377617524921857481883727131436977529618958411564725274584684441182315783182825237558752957541512477423351543755341655581298217577434132648378942927458459762488836389667121947616959627862212598568762461459737116698212477421136697387648144156613951291211418433479347971877671417338145368145569939572417484541631352111852618958417752962321851257837518883164952324833711528491716153492871584915177873961781486817579453143147116575991463775298812141733811669821655583452493735151794891446199163337166223214516617894291326483464371895841954987179287295296837351516697131897869953671617219179691161116235736379548612719719483353916861154868162933319463161538478686469731585834911195248172826448657919483352644897611631946316142743326247122351418554615249413123536745818292145834911114488248337154857375914415788588923981857481635391768644186353713446548439427268417444169893178741579453162933381567686413233515416495232725658964361968525157885811932293331351655581964487174441673491619685253492877268437553447446599132965819413729216353937149641187666223213143694583138964362967939872911255818454275125581815324211835271155866831496418453661166982821733623871189584183788598729118695941249761171211283788579346716434661255818718764164548538966714536837755348657915223266178141588953583491141531916353914233956662729477411669823836119119937692391744416369477367458124976177731519967911629333981234593586284679333135971139339192153444197256358349118675751451661168182719422781635395794536117571875651454275179489112638941784796417933363421241685177672417933652137173634629928134465415849155572447571251677789343236884791288122345249718764179287277327714375281871613121745786817375534147387349287343233593821219476694536888361841328145166144619913345594542753371731241685526959135273169797954916833717358954816252951984677121543816656752422813971482644891451661124168519887153674581485984732897559263557244615795165558884322936816168384618534423957241473871584915633966151828859964379144816535611259856142945218695942584327934671724226569358397743136686313325489643631294593681674299216858655754151948335211995591567399762989318156767369351825176193824672327769239333135981234341211121947613971481552611688479171816916131818116381294179793467623871135676849263613668632463181227552192612694287324833713628258358667248214845618615181166982137292156876312214951673751118111519422785834918883614375289186454179334199523634291662618877651148811652137987291142137652292114597371332542644891972563199477234726876722182113854916868242272684676365161318116818273533251221495168384684798864132196246819442975875291164963125783712537991657599115688786413297113917969114718517853911247742555225975177969129327784885981546554152434535736388836335154135878779548649667413688821251783836148859854916856935848456158693413971488762464522561217457726844623515834911221495157683939976215344417948913957245188835511877732772927551332541144773777315169192214536865213711326597793344583131326483373515154251644619918574817363417363419523731536459179489176116312719719463167268418736321512231488598139311116496318938222745847752961259856371496132648318292148197148883628669839976298325312982176178149428737793347429928116381978626925171271971265913841923199275323824215687631936221143954734121118978624228658194114679271876419745821348692193824573396399762115486854311142197113789771136697268527134465416293333472689347971191211956411975177183729146579473693525439413426351712112928747954861877678762465895481417338166971339572419382481567611366976763657591441615219261261479927884322196246818352711292161718169118313435736357137713668637874111225643553445915671766625884322182113826448944216118271951841328789429182517615223268681717524921695961673751714726197256318998791825176498693153242198325315849158944173573631431471262475289781926126629928175854958954854714958954826852791864546437177268213466731253799145368122351462185216878841734321178681517948911861518977196843942296793567339188978483586642197187826572482118352713391924845617181694744656157952564131677789126793283182811387161716159731588863417692393351541338597145166134121116656751469832577434335154164144784798119524813527329881219543922261281617219716745896436146579434928718251761855461232185134869216535616581941817114274339832531635391772682142541412295712866981879689178277776923919523731756531819119983253456294145569948254112739891213419983253714726134869261781413325434121181163868847912659131348692417933199477217262451962468793467153242179144826852744418587529112458315182882281471247742132648316858651855461123562841591418857462523751197267732897979215126389437957215324211296198274584472446698574567339162933354311186413287422772885988432211972671447623172422624833712235145612828318281952373629928486579363421851423125985656532129619819685251312351356768168384611326592846792422818574819442971263894182315718171633966188978411124691183134823752454275793467359382137292166163715586684583137167451415319134869281567674299255118714375281548573272565171413111629442483371911993189786492636143349367458975177825771993348137493986211311891911522326137292373515166971312578379872911124583954987633966613776189382217847965552251758549171816916616371463775298812154453513769584724468923988237527874154513211995355344158491581971481769514738784798134263512679323311161629333363421661637198265854513528978135676815889535128261471851296793122755274299215929917167452685271187172132648312699511869594137493916535611988715146579486615117262451772682133859716919221837292119951986696122957154513126591319119931352735915677995241754511482541188776516838461746435177873937149613567681292161552611611757864132391686486579122553316757797517715828966198335875291257837146377593479748657987826538966787624698123416172196198331621257113467815243453472681455699232185188574616313528439422523756763653997628197142947741926126157885854916817686443593826541561378977155664972684158491515263641675775592631643466137897778135376318298123416131813775534583131877671441566183123315263645249415182882927554966741673751169999812376477813531187172981234569358934797557244488598137292145368581472166567517363413486926581941544535187363226247123966683788524228191199314819462422816757797113913426351181115146579419644878843221324464136484419988117464354663892281476985747349162543943553449267219347971833252187161384596117383591211412457231288122133859756733931496416939411825176952968168182712477421853442193622166425176318217565312235147874116636563735151273989773277157683914193573169833331351481946946911446199597624182517681163819543924946556238711124583156674498931581472112256484798166971317726828681728266411876226128395724143349367458498693387648282661984677139916786615112679321142754178681519624687894291592991123764717847961944297148396518211381118526347268589548888361772682635985512826169797951686423824231294518998799973861823157112458317484541649523139311458313571377134465461175746437174441644619912315913244647874123218523622329679368444156935815182888944176824224744659428733916861928145168788411346788984559469117631827631825148451833252116294433515477327711144881772682198265851282639572418796894562941219476189382215485736945361794891462351488598111448813446541298217112256499738627862269655562387131698318372997921513971481247742115688787624625237589239819463163795723916861213419353325252375694536165154214375281855461128812214678131453681187172134869224429916939411528383152838319624681239666684441181911912154381532421171413187422714213763694771231591443585126389467636515425168378851164963136282593277852695956733912396661397148157885814597371782777383611574821322445152232651484518473851429452178277781567631496493883534726878135394691111548681823157171816978741127398994893164144717464356682891827195167173251686412457238479812235142523759771968863412644892866981393111734321561282664251152636415828961926126438123154857334928722814718675751312359691218877657187641536459136282533717324429993479791258866425177125834524998527219382416192381556649171615125379912517815869343331353694776137769893178135314718511857481677789678384442161464371819119111246915425161974582153242116192381697979148194611831341534445774347429924138955774341996791718764124168513365782564137813531556649187565152494385629236223312945952968195439286615141591481971436342763182176258713345597369351221495514845175854922814734323272565145368176258713769582866981653561194429712295711617219549168849999113871678337212114543111482541314964831828547149172624511972671526364182113811871723391921326483146579475914491258896912246318977196116294466627142945218958411197267526959121341955724418473858237525431116561751512231148396514314711393115592631825176172422667434619321831118526496674185344265819419442977692392483374744651346673141935719685251623276886341164952357137718594993573631665675166971318292141946316188372751888313426351627314492636183325219866962261282725651164963862113181718176951134678375534948931516269795486573396126793211851531152849139512919988116575991625295187767161116263194777529633717391258859762418594991162944114275412598565754151455699182719533111619624681778739115486812457231255818145166133111614718511657599125581891864517242261338597131638813931136947712578371621257169394199334812679321859499175249214577187591441766625417933177873914597371556649656175175653185344228266948931776721439547567339141128117545117813539792152846794421611938241415319198467714617561292169771961411281158895316152173432182173378741577434833847391686912588147387169192244216146235124833768242267232762992814577186965552927555471491324464555225135474919442971972563973158226128466389144156689643615546319584317141311621257153444379572662232152636416959686817111448836543916838462887177793345814724643719846771885746589548922683462351111852617969115465545915671582896173835914415665653255522534323169999897315872684148194613426351453681667694173634156674419685259872916561753957241191211758549195843593586177268287624618372913365784138955431111956411775296147185152494522921126591315788581639428177873921199512961981231591829214143752882173362185295296882375217868151148811278622274584337173656175154857357945325237528266864132656175129821777529611225641954392112458311669821964487633966549168112862111568871635391247742196448769857452695914375281475889165558196246815162691984677113265994691114758891195248172422655118759156718958411592991174643513224451911993121947638764883788513264831588953282661627314114679271674544821884192325237587624614859846541566299283896671782777126793216192389792155592631128621136686357945352897877125854714998931123966614193573674581893822789429123159146377519725634885988499992725656844411362825147992718554611427433569358167778919564115774348419235289781784796164952317444161166982147992728467934121186211315566498984558176955471496218524845612457231653561185748341211143349122149513365781453681215438288717619833125985615869348136571697979165356117565319988117585494986931693941186151819584313244641641447197862114275414193571938241552611187363233313565819416333711534448237521893822934797169797949263614556991619238862113115688714375286622324179333593821827195124168551484518615181453684744659812341798929198669694489255118719927531794891166769436947718231571746435373515158693488432221199516697133735151685865363426238711758549611757175854915465541631352969121584915185546112255332382426258913143691536459188372712517842197197315886413219362213593821796919448925814721225533145166111124691346673654156194227811992861469832112862129275511629446137765269592261287874118877656561756319474159141249761587529147185112921616838461512231184738511871724885981235628116496397921586211337755311366977389547369358641321754511658194658194159299115445351673751423991932183174239724228264489811638166567521199582577143812323622316959619584318453661112469182517655118752897835938235938217545111461756145368476484125178124168576923912396669529683916865774343533251954392585511926126123562816394281988715284679185748421971938835868171166982189987954714916353954513775296635985139311118313418615187248211364844823752118515376318218695944522561643466153444577434985272167375145831319422789489316636565148451635391235628732897151223113123518736328257711582896144762324429918635375188831433491162944136282534323113871614536817928721879689144156669655594287354513122755217666257672216212573896671873632419952162933361579518191198621131758549417933244299166365614496426783841461756126995137755314334936543915425161552611121947644821816454853997621354749133657815182881459737189584145427514314711762587522921312945189987958752976318231698339572414476231447623813657173835917181691859499817695139714812881221897861378977165356187826516858651225533113467819745821871613688479193824343231469832194429718675751431471143752816515421853442843942135474982577111629441112469164346629881214698328621131465794226128166769412134191348692142743319321831879689166365624228874227123764716131815572441211415465541748454173835961175716676941548573359382151626911366971193229145368155463799524355344181713593821782777284679775296423998661511213419129821724429912679321332541782777115688782577111851536824221124583145973798729118372915182886743465693581352732826613749391546554165154218453669711392644891938243735159549871334559787418863412988121768644585511338597164346662992816212571134678197256339572418594991643466145569917262451928145152434517423973351548217331699998187565117585495491684583131237647668289168788456532971139147185119967911617219187363214213761885746116496316313521211499132912941793573631683846187767454275545135895481421376674346182517613971487389541762587133455912598565491683735151554631772682228147135474971674515869349469117611632745849166261522326654156417933954987168788471876415748216333711633371732897918645452256165558728859983253113265919685251817198729171472614859841617219178277712356285794531974582878265837885238242165961811387163836116495236319473836113547494381231766625141531917343213795724138954441893479716757719866968923981215438156674414133124572344216111548683149641752492256413781353165558549168666279771964583131132659387648569358134263515283831792872143349676365898455189987917969112477421994772173634375534157482314964841923184738583384799738617121123391921142754198467712396661962468181911916252956783841578858168384618776714294529852721938241217457314964188574634928718332521752492932778942873238242175451119786214314713755341372921691922182719526852712275524724461724226186555611912117383595289781754511377553125379915344422814771674516515429327781786815888361994772795486757125182921434928789643611326591657599821733163539162327615344416273141944297195641115546313789771558668379572421971118919163598534323365439179691316983112458314133682422147992718271951255818726847773151851423936816182315735736315546311144881148811973158314964357363142339516131812362231237647194227888634186817353325183325293883531496416333711899879196246813325418372911447731185153182113881971456733946437195641116838469812341199286177873912114122957112497615471497369352442998439428257711748454118111516353919564111728264173835958147248254112578371665675337173172624515243453573631411281119524813365783714961712112188372716152736935635985163539154453576923928266876246161923817363416697131778739472446155261117989293714963916861378977779334785391696555946911979215124168579144838562914314719711399327784764841261875139714868847997315818231576743461752492813657995367136282518554611992753128812215748271876476722152232624833767838423824281365741793317161511568871578858171615185949966828952494113265911427541691922162125726247658194674346335154179691142339556935843812394691118514231952373176864428266769239228147286698912588492636278622147992716131811221495129821718655561875651658194664251188372794691118453661667694785391141331693941934797151828844619913567681784796142945212941797248214522566117575269591548573186151897921551888396912226128113669793883554513734916136888218978681365711952481663656153444133254831828134869214476231211498729194287311528491134678188574618251761695961253799189786835866549168142339512214956965551393111548573198467715223261655581528383118717216555899536711871726824221548573597624341211228147178277778539111932292967934138953371731334559482541811638118717259358618594992644891768644161524138951316388182113814637756884791554631889784167778916333716359851399167155664918756518197142564135572441146792194429761175763598517444167591441792872258432387648714726876246132446433515414617563452491748454482541178883412638941663656258432188776539774315263641451661118515319261263896677874115566491798929112862116454859812349893115263641142754147992715283831393112866981926126168788473289781769533717314536813224453654395148451887765698574767221861518248337827791483965339192168182736543911992861948335126995152494155866887624671674524833745831328467912921611831346157954239919564111526364153847819846773634216616371669713494655359382113669724833712174571728264835866132244557743418897845511871873632174441681567687826534928735736355926313769581821138446199118515314435851267932129216196852513123516434667631821463775948931619238119322915384781865556142137612114186555648859813648441251781471851169596345249199477213466737389541164963196448716939417692394885981871613985272928741744416452256391686178277799738684394274299213668631368882837885176662529477452695913244641273989113871617141311863537135273934797948931994772415914179892915768393573631936221262478641324825411857487571251211416858651665675198265811831341271971895841134465415364596218521356768184738547648419422789711395148451831233122149518877653573631261875472446189786173432157137781365727256514213761479927186353718655565148451548573122755275712511568871211413163881962468761163557244193622115485731677789175451112275521659618132244513567681211418756511588953399762189987918877655834918883624228593586932778144964218655569913295168641485984199679193277818635378843221231591314369484561166982194833539774345427516838461857481841328987291775296448218153847835332517141318136571183134163135244418575415164346618514232564139771961185153156472512295713815911195248171816997113917484541467813373515139714891662618675751867575145368182315716293331288122143752811548682483371825176167173259964319382415324217692391447623182719517181693371731669713462351137292134465419826581229571158895312982176763657672211932298479818574884192324631812699514583131132659169394115667443916861827195155463181711114488155866877529616737511415319262478257717248211865556196246877529615445357954869226832745841758549666271592991254394174239763396625641314496421734321714726154857319725631853442688479775296115284913991672846791821138359382142339519422789448921479927164144714819464825414845695498717585491215438934797421971821733522921298812894417158693455724448657962387141793315122311691922654156448218176864489239857743412275521899879188978414617561641447113669748859857339651888358147223218518251765249414819461199286125581898527224429912114874227726841257837668289125379927458415122311754511195237316212578459611942278176662586211316313524643719685251154868631947115486854916892672119422781825176155261188836126591351888326448911811152988121314369379572391686137695839774312679321534441425414759144166365698123451686478741886341163135212114617814825771193622155926376722169999818958411253799815676182113816616371166982128812214435851657599668289119121123764719523731788834145166116333711712112819714158693416818271736341112469769239246318339192248337841923623871934797141331784796296793184132838562999738616596181558668162933312255339973862846791554632543943634219442971249761438123492636783372496674124572382375215324215754151742397145368565322382424441896912183527119624681419357559263987291169192248657914435858782651296198268527168586542197137351592874981234174643584192318473854542752866981451661182113813769586299281439547196448724833712537991148811916626811638333135284679132244514657941693941282669388351259856946911175249266223217343214724463977431649523625891479927184334757945388634198123438159113224451152849115486818574818211381643466759144116294414496421481946136686311286216642518459611235628456294369477993348136888234928711225641655581996791819714169999856128262589565323795723876487369353391927752961619238557244926721152232611629442422861175717141312362239973861154868166769416394281225533767221181115152232612699511946316158895349667433717314758891124583146377538159114294526763651738359518883162933317666251936221185748195439215344419119938984551752492769239182113814112811185153124976116757718796891532421131235242281144773141336137763775531193229815676119928622612871674592672117625871148811189382211891912644893371733533251356768144156614819461798929119322913224451988715345249168788474299217161515526117995241148811294774162327659156755522513163881687884514845194227817242265855144216181769592874813657151223169857419483351366863918645845961698574112256428669819988112114292755192612617484547248211427433581472113669711124697874117585495653217868155592638742277914481453687369354643767232736947719584319261263432365213718756519549876117573856298479816555852292118938221734321169797965617517464351528383176662529477477731556128213224451724226458313666279832531651542472446767221738359676365629928178277714839651322445163539662232888361712112165558363421296198248337692517286698167778915243453674581946316397743153847823824263194795296814435851376958888361191215693582967932463181522326166971319564111138716168586598123459358611811159691236745849869382779185344215647251798929174441699536713729213628251352731538478133657811185261292163634217847961124583181714583136319471819119127398945629434121118372927458481971449263658752998325314213761683846684441355344516864142541416111621221495567339112458379548657137712497612846797187649226836884791821138866151113871661175713729217565311346781417338847981928145365439169394163396668847951282611629448237521437528185546171472617726822967931346673898455186959415162691657599168788417363413769583371735653219442978156764623514239928669824833713729216454851825176125178142339516333711189191864132686468621131865556199881154857381365717242263654391699998785391127197763182884322421971121149691284999917827771984677195439212174576884796198336824221742397172422615526111312351889784136484454311117363413688821142754862113199679118251761514251229571145368385629623871126591312114177873949869316919226117575552251189191148598469251792672115586683957248681719382437755357541528669857945386817154453572482134524984798178479657339618978619786219543926218529832531613181339192122149519745823573631548573543111742992189584117242268782652887171324464286698195641117464351449642282661354749158895365819411669821215438383611825176198871511488111257837177268216919226581941358787186353782375223622347648412275522866986218521162944454275147992716979791439547131235124774287422757339627862252292118958411399167124976144619958349117121121433491566744789429833847153444127398935938266828948859881971496912664251183527116333713371731112469835866654156143752818433471972563761163419952115688789441797921513325419786258551147588928871729275516596182866981825176111448896912125379955118712921642197118251765996431312353311162947743836119887151586934135474937957233717311891911625295654156365439831828176662518271956238713452496743467732777631821185153518883367458789429184738517242263331351544535187767769239115284924228464371623276385629145771857339612941791162944464371332541114488141531915445356763658257718156764441883384714799277833722846798358661437528196246818897841831233122149534928718897846581941225533849999155261114254143694773896671847385843942759144399762131638871876417121121124583874227587529121745715889536783844159141829214165356166425118776714577181659618355344113871614112816844412321851433496521371453687328971683846121147571251185153198871588432214133156472524228174441614294521736341843347347268591567154251615647258419233755341968525185546112961984926361829214331116186757599334898527214496423533256299288257711128621599643678384371496813657932778176662577933413244641667694154857315566491871613153444946911298812182719513385971635391623276716745163539579453843942186757523824219543922261281138716142137619947725289781427433579453177873919523731217457514845115688738361144762316717323553441673751163135214657942947741851423918645121341912659135289781259856192814573289718171971139114275412558182422811932297369351187172373515146781313264831568763926721296793983253928741627314189786125581815142574299276116312235141471851371496144156614112817288591372925229212927553371731756531298217145166137755314254144461998338471356768827796157951138716684441152636418857462887171683846783372575415845961658194672327599643161923813385973795721895841486579676365145973717181694865791516269421971274584192612619362216238711314369157885866828977327711548685754154583131356768144964214758891712112122351478539112638946642511744416876246183325211629441588953154655434524912315916979791479927121745719119931748454492636316983718764189382216697131554639933487752961296198591567155261112881221978621241685619833167375133111683384799132911972671675771336578187968918998792463182442999529681734321292755226128191199317423971219476167173242197114254141691922116698216858651566744137897711225649872911138716575415154655412921669251761983318695944663892725659751771239666312945185344212134191996791561282944892726841122564188776565617517383593311161255818163539678384918645153242114617568641325148459812345653214415661841328345249484561227552391686316983876246698574841923164346615526117369353169833452496783847389544926363755342483375976241738359121341967636595296813971488277927862281971412659131746435486579186555617868159166268641321693941169999815485731267932474465173432115364591118526165759935332511871721817146437122755276116399738614738724228355344892398845961133254482541154655481365784999913466735431111358787932778173634155664936947716999981269951716745132446411346787793342967931726245133254732897126389449667448254193277831496428266565329731584623511219476274584282661241685163337166627973158734916528978843942629928127197126995119745821952373157683965617512517814516611673751777315151425145973716636564986931288122555225314964274584545133674586198333573633391923876484966748277949263619382474299267838462992812679321195248268527133657893277812457232927551794891122351478942914556991433496965551183134452256144156661983314799276682891132659176258794489225641378741175451117141313755341651542162529562185293479719846778459611558668868176541561744416178277717767271876414859845754156783842463188984551994772134869225641327862283182838159177933463396617827773492871568763186757584798161521675771746435946911198265816616371718169123966622612894287316131811645485155261115869341568763166567565213718675751867575783372124572386211382375219725633957246682892826635938217161514233951734321292755347268294774184334768444124228187363217767292874155664917686441942278118313416434666945361748454151425833847166365678942919947721861518813657413895133254182315736745844418795486111448814536854714928871712477421691922172826429477416838467833724441819261269893172482113446544724461742397137292163135218837278964363129451191213714964562947752964199525511874926363371731461756134465416838461356768843942795486167778912174571978624623512523759832537793343694774885984482181673751182719545427518332528439421756531522326194227812315913971481843347157683998123458551183123312416852644891332541766625191199384999911932291522326134263518514231782777129417961983316555817383596844419711391481946166769454916815283839711391986696171211211891915774341138716176258727862211952481411281658194155463175451188634116293334764848742271655585673391273989124168516535611782777799524133455922612899132931294518251764381236622329125883432331698339168614254142382421697979413895787411253799177873924833717767216535619287414435856662712376477167451835271183527116737519489314657948479816999981247742492636876246516864142743381567682375257137772684482541122553338562913527316131816238715471491439547345249248337125581817585499751771958431875651286698781353363423836188634177327746437169596158895312376471247742391686132648317868153452491223514163135212194766178141485984623871559263187161317444161429452122755213345596238711378977185142312982175653213567681926126176662513991677894291263894118919184394218978671674571674597921575712581769516818276925176541561346673188776534524981163814536816777896157951669713135474925843241187673491618756511841328143147166223225843245225628467957743414133847983775533654391962468462351391686148396517181694381236864616697134946551998811354749185546128266866151167778934726844619934928718736327147265733961112469256413898455192612624429971472614415667773152624712941791453681726245162327646235182375226247189382215485733169831512231137695898123419584318574879346714112815713779529687712586965551552611494655164548539774386413211245831132659161318119846771241685145166112376474159143169839771961358787172422615526118459611615212457231354749448218444181415319124572312396663472681736341463775146983268847916192381554637167451625295196448726852714698321584915172624565819414597377692391419357811638819714158693415586681574828217331788834339192464371122564118111519564113149641948335228147349287811638193824121141465794674346143752812477423331351746435831828484561413319261261754511173835911952483694771762587876246119524815687631691922194227876923913345591685865163539282661265913119322915384789267219186451677789152636449869331496417787391948335991329194631617464359368161475889464371958431413312598568843223149641522326177672181911992874122553328266137493918675757248218439427672265213715162691623276121341911811151776721449642137493911346781653561156472573491615344498325316152158895339774381567613628256178143149642826615425161671732135878716152142945213163881358787724821555225177672114275488836462351187767135676886817296793811638771258183527114395471928145151223182173311952481376958144156671472612739891189191172422628467999536738764854916849465557743499132936543913426357732775673391938242927551417338178681517545117833721263894119928655118717464355269595612821213419391686145166118211381197267144964217928721475889623871381591569358383618358665148451247742888364381231314369114881111447731124583438123147992776923949869399536729881219463161661637151425652137635985123562815929911443585662232944892141531915849151368882152232696912188574612961982745841621257153242114536815142511488118944171986696726841463775125581835332524833776923913668638217338217331615244619981567619846772483371584915116698256935819442971962468144156649667484999919947729832536339661823157417933135676814698326844411463775462351567339182719562992816757792874161923866425159358633919212517816697135996431788834684441514845623871146579492672126247189584114112814522567187641378977197458294893127197143349146983217423976884799973865814722685271229571165961825439425843217464359327781485984175653146983214819461249761359382136282581769582173315647251651542197458214657946783841455699413895156876378741516864184738595296813345591633371136686311952487167457853911677789119928669251741389515546344821812194761746435172624537755318998791712112837885278622771258162933363598514153193957243129453634257743411366976783847874188836411876979215286698126995119947723169834926363977433573632119956137765915671457718773277167173216878847147261395129168182765819415465545188831984677116496311225641294179174239786615118958411457718137695833313569857416858651296198993348134465415929911217457137493929275518594991697979312945413895952968162125794691165415648456763182423991423395192612611346781146792125783712517844418936816186757512659131288122228147168384615869347349161752492194833511871726581941887765157885859762444619983586694893686461742397181911997517712517869453645225618473851419357567339825771168788419261261677789162529518514231189191142743319281455976241853442995367168788468847917585497288596178142725651346673438123195843147992792874686461582896188776557339619947721897861481946155261151484516394281619238936816692517146983297315888836121148116381294179148396552292111891918944179549871146792312945761163184334718796891427433294774118919112578374966747732777369351942278979215134667391864547446518655563977439327782422811286211556649248337145973766223213385971288122452256147992718837271263894236223292755488598734916121141251787934673634233919216192382362231118526171615878265129821765213797517765819418271951263894194631617161569453613729282375246235117989291223514182719516676941651542162125769857449667419422781195248413895169394119866961314369983253133657814577181471851164346617726829771962523756319475713771433491514251847385543111565321449642122957115889539852722786225855119826585915671298217198871517484545592633896671758549119121144762356935816717321461756173432141591495296887826525237529881213446545592638217331847385184536655118755118718897841247742125379924429961983347446515162697914481655581649523773277145569992874122957165213767636546638915324216743461675771627314621852121947617888347853911627314585516783841453681461756141935713143697611634764843876481863537182315713789771683846111448812679321423395189382254916892672113628251546554116294457743418171169797982375218191191443585718764122957116111628136571413317625871148811141531919644871316388151626917969113567681825176125985689441714637751251786925171185153126187517484541534441253799132244515283831187172158693417141314138952786221833252543111688479169999816939411582896188776512477421669713184334786413247244671674565819414112817591441221495672327111448812659131485984111246968847971876458752912537991368882674346983253182719518716137147261798929148396515182881142754139311113265934323169394119119932846792119955855111871721338597157482183325211912175712511932291883727132244512638941578858821733189786226128157885819543921728264137292557244145973754714947648415182881613181167375112416851312359913294986931833252179691129417937957274299213264838499995491681316388122553383586641389515828965431117288591235628585518459611154868161318116757712235141754511268527944892365439163135218413283331351974582973158458313197256315425161861518472446121543873289728871715748226448957137749465593479763598534323878265886341141935798325314274338419231219476987291975177168586516939413654397147265511875996431871613232185593586118919118857461621257119726718897841639428185748166567516878848419235794536178141191211576839142137611649631677789492636195843526959423996198331641447825771187767146983218635371772682528978122755281769579952416858651845366868171998811738359182315779548618857466218521475889146781336947718211381451661186555616676941893822141128118837274663891459737997386137493957541526448951888317383591292165814728479818837271756531336578946911143954717343214239916434665168641629333973158164346652695915929919489313365781873632674346139512911952482866981447623864132187767122553348859859964333717388432214799271621257119121817695124572311225644199529489316172193694779832534966741526364452256652137771258152838319947721211469857414233951251781996791337173133254823752583491124976182375216596187167455491681936221146175671876418716135229211675771132659498693835866129619815687631239666692517124774265819416515426178141263894452256761163878265142541461377614133391686112256447648416212579852728176952564136945365915671675776682897954861152849153444119322919523731869594421971152434592874137897712235141475889168586517423979125881627314186959413547491245723771258114477314435858378851855461631947171615664251146781312214951136697123159163539145166113325489643618251767369351972563579453144964215364591954392139714818998791893822124572314496421768644783372395724134869261781465819416192381574821197267995367164952315263645188831697979146781312275524885981378977151425178883414133864132169596165558161923811891911683846892398148598462992815324211576839159299193277877529686817173835959964314395471887765975177148194618271958883617423973169835673391691922185949911649631546554151828818978613587871219476288717716745423996137761655582624714415661687884676365112458316717322967931124583484561566744672327849999817695139311145569915869341334559492636148194616454851954392161521187172775296189786186959412719712659131118526198871556128299738658551633966395724847984946555188838378851142754184132812638941352731368882161923816555811528491354749123562851484595498792874119726711447731669713773277264489126389412275521875651845961991329141531918594991671732619833177873917888341792872141128116939411998816258919362217288591857481485984143954777125834928737553417121125229211122564161521574824744657591444643719786229679368847934323185546114233951479927146175617343215996431191211948335194227816676941223514565321974582142137618938221978621471851696555172826418534423997628843221352734865791623276158491522814711649634461991835271256413132446412194766218528984551861518333135494655185344213567681635392119958499991193229133455944619913648441663656211995157885892268314799273654394542757853916339661152849264489488598156674441389517726825269591112469288717128812213931118554615269598419235976246541563755341522326367458862113415914186353716394284643712154386359851736347853911958438217336541563654391584915169797914657941833252391686573396125783745831348456167375176318257137716454851294179674346182719544619945629437755377125847648489441793883535534416111621962468373515157482187363254714911891911657599946911985272732897162933399132918978681971413163889953677349164764844239916616371889784135273971139793467182113889441728467912578371835271789429167375112235141463775985272196448715425161473871227552165961814718511687884524945996431213419122957119887151766625151828835736329275515122314421613634217383591332541926126575415274584662232139512918312332644893593821342635111246965617525641319261261273989377553118717212517814738719967911962468157482155866813325493681617989295976241835271383611992753171413117666251629333125379913244641928145419952114679284798492636294774175451186211352292178741184132813567681695961928145936816123159146781363598516575997914481645485397743195237318433476581941819119464371322445175854929477412982175855127458445629411366979953675289781946316152434571876448657999536717242265834911336578125379916939411227552171615312945111448846235123824211366971522326194429711467921348692162125752695911286214199521944297189382211568878782657793341413313971489792155693581942278136888216131815693581312351996791185142319543921994772557244944892775296187565111952481288122543111184536649667438764872885968242279144881567642399698574115688718574873895477125829477456128211811155855166627718764676365946911128812282577116919221982658236223781353183527171876444821839976271472613628251217457335154613776145569947244619483351534441758549228147124168513123558349167232749667478741128812299132915263641994772141128116697131871613194833593883516878841851423886341185748151828815243451261875183325214657942584322887174199525491682745848217331344654129417955522538159184999912638941552611526959757125137695866425155118783384762589158491518534421544535129821734524917464351683846169394116333712422812154381245723922683179489117423978944178661511524345134465462387136543916979791138716484563533251798929246318912588119524812134198378853997621229571166971312174571413393479716737512826614334911366971393111324464166567519786287826568242216152111246912659131475889397743157683962589143147148456115486884798121947617888341441566583491156876314839651465794134667318897841219476589548172422618897841453688136573432316939415289784522561215438248337119524842399611757918645137695833717326448983586612578371152849411876186757516838466622321197267868175289781183134146781314133188574612255333836112578371772682173432115586689751771986696934797256413132648315929915128269812343452498499991611162815676121149549875693581879689625896925174138952624789441715485731619238119726717484541393111677789284679195641152695918514231138716621852135878712578371154868625891899879981234139311831828174239745629418191191776721124583819714391686168182737957217888341193229141338197141271971829214111246916878842543947853915572441122564129619813931114334955522554916811528491512231845961193218312659137853915996438116384643749869362387117969115384781859499254394145166198123476116324228197458261781414839654461991829214314964347268656175119524817121124885981326483153242116777896157956561751978621514257853911623276629928199275393681619523731576839157683917161514637751942278154857317383591683846161923813244641895841678384173634152434538764825843214435851556649738954163942855926394489214718518439429933489469113351542382421796915653297921512235141415319635985894417886341145166167434654916883586669251771472683384718473851738359114275479144867838468444157339616999984724468136574885987914481657599183527152897818271951784796197862195843827791657599954987288717168586511366972422819927534966741762587557244196448715869342725651322445148194613547493472681629333294774258432369477258432137897733111617969115263649388351695961823157268527583491161521673751688479143147119725631372921124583166163734928711548681156887124976115849155733961376958726847833721871613528978147387175451163598519644877732774623515249419988137755337755329477414435855612821134678183123389239862589173432118938221869594486579184738579952413628251926126186151815263649852721938245451363194771472614556995491684744659388353412111627314389667198265884596112679329812344421611635391255818114679219826584199529267211875651162529513628255895481639428155664984999937149614698321718169146175666425113587879489316414471261875151626911831346218521744416123966652897815526118641321938249469118136579469119792156884794764846763651239666791448161721918857466682898923981968525133455917868151344654928742261281376958176864419745821776721877671241685133455925843258147237755311952481187172345249141733813971487995241948335161523371731728264981234124572311427548217331718169878265474465122957117686447894291358787142137682779757125494655141935729679316999981964487197256318897841479927761163157885811528499347971162944156674415344417262451827195163337156935835332512961981928145119726724228196246891864547648411225648762461423395617814168788411972673492872543941221495177268215647251673751167778918938221588953155866848456987291119322911669821661637134465417948914239911185261911993135474915344466223217282641211426852716939411189191185949916535611148811345249357363847981685865174239712517817262451661637164952377933459964358147213123514718511673751456294126187555724413527312477422685271853442938835146579495296817827771837291322445185546116858652846793432315122311649523118515355522565617517888341524345864132874227129619817969158752919685251449642175249252292117141311699998139512943812317423971191215673391439547692517146175635534459762483788511912117141311992753316983165154279548618655561263894151223177125846638988836154453515526111631352837885127398917948911132659129619818211381193229682422827791225533165154219463161986696164548528669813163887954869287481769514274332725651611162769239122553319745822685274138951746435148194612214951538478123562819382416394281938248217337591442624761983378942919866969792156581941518288353325135273143954738966713688822543941639428175854917484547934676945363856291663656173432118473852887171788834118717211326592463181429452652137969121962468617814898455195641177327793479799132991864518231576137763533251451661577434186353718292141693941948936945367268483182812719713264831978627187641544535115284915223261296198577434147185187422712416852947741239666152434528669846638916858655794534138951187172197256318514231996791172826463598537553462589448218188574615586687268479346747648414819461911993116294489845514395471974582734916674346113265918756511225533142541495296833111618695941635396864657743469251716172192644891728264581472174643511225647752961566744139311129821786413219543929893169857431294514213761534441152849981234195439272885989643615748213749394865791437528144156655926393681611144881455699371496147185162589175249212881221938244562949347978782651829214136686312598566783841132659154655469857415263641578858379572579453169797914758893735151197267196852511467921433493694771393114845612941791181115135676829477439976216777891419357128812283586623824212719718857461988715355344174845415768396884791566744141935718332526642517288599388351661637236223175854941591498325316353918998791883727571377196448761983377327778135316757711649638641326137761255818156472591864568847912618753957246137761261875761163252375236223514845359382898455119524889239846235113628259913291544535159299117868151366863185949915748283788516212575935864199523997621746435482541948935148451467813738954123764717242262564131643466264489359382787411623276198265816818271964487186959412356283492876238713593821425414274584158895382577157541538764838562919846777692399267211996791278622114881186615187826517181696258954916812537994744656945361621257244299161116212941793472681726245127197139916737351517787391984677783372952968169999813628253755344219711673751629928136484414556991195248125379924631815849156359851512231179287267232798527224631871674512134192564135653219725639347971514251683846678384193218311851533997621758549178277738966718251768338471419357518883199679192874134667375914414738719422781796915229211653561172422676722199881186757516353979144815485734482184219711449642162933316212571415319124976117565314314715774341378977166365642399385629178681584394272684892398113669719422785471497995249469111588953141935714799277732771687884676365177873929679319463163472683876481219476438123154857346638917989297591441629333312945866151159299114637751322445236223162529514577181485984928749529687248211665675182517671472618473851451661119524811346789812347692397793341185153174845413789777369351352733977431271971439547116698279144812235141833252294774165759913365783412111669713177268212214951251783957241512231141935779346711467923371736561759771961833252492636153847814334993883511548681968525188574631496419382435534445831366425118938221889784827791611162118515369251717383591629333167375111427547672281971412537991441566124168524833715788589973865491681625295686461136697166769499334845427513971489771961298217769239116698215566496743461968525152232631294514738711851533735159691213123519483351463775841923389667158693416152173432186413211124691362825585511132659343231185153698574516864734916171413111366973856291124583182921492874183527127862272885918271951786815442161165154289845516152244299199679125439418796891655581516269133657869857413123514395471736341183134141128112961984179331332542644891395129115486819422783997629226831554631366863549168141128144821819584384596119564115431112483371837291798929629928143954711932291675771516269825771662232793467676365144156636745845427515768391655588984553472684542756864611144881451661446199167778912477424199523694771128621175451118554618742271221495411876916626181711821138173432117444161756534461999469113593827894291681827573396892398298812763182161318114496421831233166567571472614133198467784798458313167577922683817695164548533515456733914233955976241142754484561699998399762948931635391358787122149518756511928145843942162529547648421199581163891864514516616743461191211516269122553317827778459615733964381231762587454275678384983253162125722814717423971742397167778997921519281451433491865556633966587529688479292755158693412679326359854744653311165814721429452488598143147115788587934678863411699998135273973158196246895498712941791447623196448718473851786815874227815676423993593823836157339641389526448969655588836165558168384612578371235628136888217343217268499536741995216252951778739371496118313415869341181115629928124976157339616838461746435176864484798164548518938221469832162933316152528978228147815676169797983384797719612659131485984672327153847838361184738518837271831233165356119119931568763339192716745773277113467865617513446546117571726245154251614859841778739922683662232258432112256419321831471851187565135938226852749869312376472483379388351273989528978143954728467918372984798938835278622129619819382419927531956411246318184536689845512941794724461699998194227848859849667494489241389548456121149872911617219555225176864415869341534447995241798929288717185344219927531768644821733946911666271952373763182154857311568871356768823752615795146579414476231875651837885569358357363177873995498776923934524919564111213419341211153242116212579448921899879658194559263662232114679259964398729111912112679326965558742275794538419236137761738359116698215162693492876763651889784134869287422713264836117571225533389667152636479548661781496912668289169394116777895128266157955754151152849111246916858658621133977431164963438123122755226247211995256413599643192612669857412396668257711138716615795938835942873278622142541498325399334813123515586681223514195843666279347971393116965551663656292755847981374939635985146175626448919321831558668985272682422977196185142318554618197144744651586934831828658194125783799738616777891431471573396116496328467997315814556992483371954392635985179287213486925552252887171954392175653181911919463162584321928145166971314112811469832391686613776759144187565116454855572441586934952968442161575415185949997517746235171876438159115526111968525175854912194761772682141935718736326198336299282543941197267573396559263126389419887157167451835271171816915768398156761542516112458321199511811152927552382421112469198265814274331736341348692118313423824295296815748258147268242211992866521371156887573396171615815676129619818938221794891151626991864512881228964361211412416858742273815917349168621135814721338597174643588432281567679144816353914375281847385123966692268314375281926126162731417242261869594379572132648341591498325334726813486921235628226128944892292755197458213365782463181938245693581556649148194645225651282614294521554631397148141531917787396258916979791449642314964932778417933172422668847931496411124691691922126187587422756935854513121745714577189368161683846165154269251756128288836156472516596181675771522326124572314738762387155724415465545653298729117423977914481443585186757548456178883424833768646787415552253714966743461374939167173298931169596997386892398464373492878459619893158551145973745831378135326247716745146377514859841566744736935145368353325179489112719762992845225662589155866877933454311111669824643781163851484549465512517848657986817139714817969144216112295711653561498693254394165759991258883788516596181528383448218623871127197162125717767214254146743462866981423395466389571377126591314859842866985915671191215976241514251859499252375415914134263513345591833252379572244299522921184334711891911437528557244682422162125763598519422783533258762461459737728859165154214738752292193681618675754219717692391152849168788483788519442974744651425414385629136282518837271217457118111515566491512231977196264489916626591567177873998123418776737149684999969857411124696844412281478277934726848456165558161318119523731352731152849167778955724486211318574849263634323111448898931938835131436934323186959435736318171757125184334712982174764841895841187565194893141935715748212699511837292321851871613113871628266811638198265872885918897841643466678384353325783372635985264489296793791448111852617343215875296561753714961687884141531912255331948335125178129216118111556935814153191413319887159489315788581863537763182131235979215272565845961178681561377616172191978624542751516269135676812961981665675698574611757335154373515571377119322916737511475889369477131638818756518136572624714577181251781697979125178686467874134524937149693277814799272887177328971683846121745717545112826644821819967913856298197141653561122553316313521853442294774543111146781349667418635371827195157683911427541782777589548678384195843791448579453194227818978612719716131819812341372926178148923981982658232185823752171413141995213365785612821863537896436593586718764162529518756511988715123159156876399536712497611617219888364583131615252292159762498325311811157349162927554199524381231485984587529112862116111628984551439547174441616919226299289933482321853452492321851756535713775511879226831522326124572361175717363472684124976113123518271954441814334958147257743414698326723271429452134263514839651641447156674416777891552611559263738954629928144156619321831926126369477833847413895172624516939417692391413327458418231576157951645485194833552897818473857894292463181376958126995169251716273141146792365439442161177268266223217363447244645427518675751368882184536613971481724226189382218453664219713957243492876178147914481677789454275174845427458416555818857461994772298812732897296793146377579952413385973533255511871938241338597954987147185166627112862118473854179331273989147387122553315364591821138599643113265912154387874112598569953677954865653216777891889784952968565321964487154857316232766561751964487144156669655511568871441566296793181911918897841948335183729942873238242187363215869343896671312351782777185142315324214482181938243775531378977163135237149633111618655563735154845652292119119932523751958433553441988715777315347268381591132648318413288439423876481895841793467114477359762414556991752492175854934323195843833847146983288432237553423622319119938964361461756121543836543913688827712589388355834911697979942873167577831828152434519321835148458863412543947874166223218332521199286526959791448666279529681542516182113878539112699511152849184738517383591621257696555183123393681612578373553441831233771258599643256413187565161983312214952321851366863185546197517713769581372928944178843221972563571377395724167577514845591567248337423991994772934797155866815263641475889458313167577178277713951291873632114881144418355344718764139311379572136484478942918211383674581829214954987111246911245831544535452256154251672885911972671532421119121912588391686579453193622115364593149641237647113669739168611346787369351619238528978476484139714841793322612894691115465549792152321851346673734916987291159299119846775168645229211845366492636178277754311111851535229211338597282669368161952373122351482577113527356935813325444418264489155664935938219725631576839264489147387129417914496421195248177672175249212416856299281334559635985152434516878847793348944172786227752961984677116496311932291994772716745118111518998797672214698321946316781353633966135878747244618635379731581645485452256369477146377595498749465519422781542516172624573895419624685431118176951768644196246815869341128621516864545134845637351557743412679323674588136576743465814725774341227552969127732779327788419231645485139512915364597631821962468371496172826482779174643554513995367197256392874662232114275437553418938224764844542751978621865556116294481769511649633149641611162516864514845142137672482151484514314711348692387648162933362992889845545427539774315122311451661145973717686442866981453683755343795721366863256413163337116515423351544583131986696446199126389414738711366974482182119955128261118526944892131235894417849999333135438123734916575415146377515182881548573656175345249178277716394286581945733964219713492879872916359851623276496674132446468444145225659156712961981865556194631693479768444115889531631352189786195843125783711366977672211528496541566642511768644617814367458417933112458358954812679327853917934671237647148396576116334524919281451629333878265446199811638131436949869313668635693581429452187968918958416157951778739694536185949914819461778739125985657743416596186299287773157914486965553775531193229333135146579413668638257711261875112458369655517121123149641316388446199781353113871618211388661515431119872915249413123539976295498724833714657941843347952968164346622814767434633919228669817464351655581615215142514254149751771485984298812274584615795896436178883419887159469115895481659618888361558668163135213325487624619947721683846528978248337168586512214951235628543111734916569358714726187161316596181439547716745486579167173214415663916861261875819714189382211548681823157928743714961419357565321687884169192218756511344654125581812739892947741756535572441136697154453518897847611639327781181115876246389667983253419952938835174441652897812558181728264136888217989291946316944892278622178479661377634524913789771316388199881492636466389585511459737488598133455993479714758891483965146175616979791413366627186151812154385935861326483111852612598561265913172624515586682685278156761879689862113122957113668639893119745821738359442161567339124774236947714799271324464145771814435851592991133254365439985272157482987291916626187161312881221417338174239718332521895841172624512376471536459175854966627161923831698315425168883612134198459615148451322445615795174441697921544216199132978942996912718764169999854916833313598123452292119866961267932335154971139256413761163134869213991674421616541565693581865556121341919463161746435145368341211476484692517335154176864413426354522561841328189382265213782779145569918332525794536642512564131132659171816912961981861518174643515526113129451259856173634144156619866961271971455699182113854311116495231821138161318112537993311161439547718764167173216999981364844734916175854912961983351544159141863537573396151425162933326852714799278176959226831726245118111515869341451661126995112194761332541352732382421219476688479154655458551676365571377196852516353984394289845519745821399167189786145166111871729913291217457242282826617444163311161778739187161313486921417338167375117726821752492738954172624514415661372921853442611757183123376318216152188978489845514294523452495471494663896238712463181183134512826187565118635371972563121341912114983253167375192672137149625439427862212396661235628115284917666251653561375534625891485984143349272565458313136484412659139771966319475188839812341653561264489357363845961884322278622399762345249676365187565117767216939416541562866986359857995241296198143147152494165961819685251358787171413156935861983317787398459611288122136888214738713385971986696159299115384781928145971139182517617989291885746154857399738617242261249761387648664251498693397743188776576116315263641245723153444349287415914114881112396669529689226839489381769518211381213419182113818292148661516218522523751566744516864144156669655513567681229571631947312945118515316495236218527813535754151956411878265694536466389111448818796893472683755341899879153847829881238562998527271674513789771346673472446147588912275521831233174845468242214718511463775268527472446168182711851538318281475889153444983253139916717847961621257155261118211384199523876481946316254394997386112458316697134381232382425693581154868195237311144881615249465512194766824228378851944297187363283586619745826824225814721554638318287147269691219887152281476319471465794898455143349238242423991199286666271431471196852597315812659135754153876481819119161923852292116394289751771984677157885821199554916822814713345591699998724821188574684798166365614193571437528139916718433472927551451661195843168788439774315425161851423174239711185267631821687884165759984192331496478741144156619624681469832169394111871724663894724462725651538478174643514233953876481326483561282155866833717313123519866961463775174643536947712457231631352397743185949912699519469119529681938248742271592991488598174239779346794893547149122553311548687631826178141362825165154257339661175715283833795726178141255818698574134465419321838843224966741712112178479619826581516269579453167577119121116294415768391857485996435935861778739121947682577189239818514231118526142137618655561633371244299446199696555165558353325399762918645195237366627932778142541423622357541534726881567624833713729268444116596189792151263894146579471472614233959731581427433156674447244616152187161315768391817119564111526364248337238242195237316636566581949166261376958144156673289793277845831357137717524921546554143349122755265415613749397692399428731633371114477317121129751771837295431111819119488598178277713547497591441972563144156654513312945934797555225182113816919221241685379572139311211995682422112458376923917383591267932161923876923981769552292152494197862186959411346786157951867575188574642197154714938159114193571677789783372161521829214161721914839651865556163539136888212214951695968883643812344619911992861576839635985134869212982171354749773277137292136484473895445831394893579453684441141935723218546638979548611811151144773114881181971475914475914498123449465515445355552253896671346673599643174239712659139226831538478821733161116214678131316388182517615929911483965164952339168635534415324211554631154868141733834726862992834121112134198863411481946153645997719695296884596117847961621257567339658194482541397743248337186959465415637755356128217363413749391128621187161316313521879689168182715566493977435733969347975733965289789953671837291364844228147115486818453663856295976243775536743467712583371735289781538478577434119121518883397743793467692517119726786211383788522814723622316656751259856147588936543911467929125881142754187767345249147588911286218176951889784172826413143691825176151425692517488598985272124168512537991225533262471758549161923811326598136574663891322445156674466627129821741793331496418453661683846165759952292152897814839651346673496674547149147992794893126995112941791788834152636444821897517712961981265913185344218413281675771944297124168518413281393119448927914481199286567339944892146781367232744418139916725843235938268847911548681411281124572373693562185217161517686441433497995242564137712585128261514257712585915671883727975177258432134465481567651888314213763573634441897921517282648641321649523799524341211146579414556996137766622329327783169837732771524345178883441591416737513856291992753775296211995397743423991883727146983249869362387119786238159116757715768393311168338473775531867575181911915869344966743674581867575168384677327714738711811154926361217457674346147185115849151968525724821284679152232657541551282651484516111621835271146983212921615869342624718655565471494663891437528331116147387182315738159113143693977431324464167375112537994946551663656154857376923956532728859284679119928618736321724226129619816757712174571742397456294172826465819418695946622329267211344654122149589845555522557339641793316979794845656532331116186555616656755188839469111633371355344178277716273141837294482181532421333135186353715324215451341995268242212497611611162154251611891914724469347974482188318286218521958431166982742992866151179287298931284679561282345249133657818796891788834181711288122847989186451465794973158365439799524126187518171186757579144867636514193577692396662716858658984551316388177873914435856137763775531611162118515379952471472611871721984677912588288717692517129619819988189845524228134869218574818554616884798499996945368419231247742615795581472113871613789771956411128812252695955926312194761825176133455918635374239986615167636597517713345591514259953676258914678138419236339661344654142137687422791864519281457248217571251463775177268222612891662687826512194761843347155866827862215768391629333662232168586548859817666258237528863413553444219719933481677789597624114881138159112578371954392197256365415681971413426353755342947743896671166982183527148859817141314219711449642991329938835264489375534187767137695856733998527298729144418464378923981463775288717415914825771423996743465451317565311649635733961693941164548518231571259856181711453681332541463775177672126187516616377752961441566549168932778444186258961175783586611932292321851744416278622486579185546116697138742272382421467813236223783372198467716535611792872134667316293333129451554632119958217332947743694771183134146983228669813587871847385516864169394152292184596115748227862219523731128621125985689441712477429691219119931526364193218315566491972563718764148396514476231865556184132815768391853442272565161521271979469111817112941791693941129821714738714758893472688843224219715451345831319967911124583676365129417918352711788834132446417343211154868847981798929769239162529595296857541563194731294583788517242261431471153645915344484596151686427256568646545135653216616371453681847385134465412416851837299327785269591619238178277781971493681627862291258839774311851531532421146579454513823752182113815929911687884458313164548516232761952373125985617787398944171685865823752144762352897814213761292161823157119322917282641249761141531911366971193229371496698574633966757125141733893277883384716575998378851788834736935571377948931938249287417383597147265653235938249465542399162933398527215667445673391223514164952316818271255818621852575415581472286698164144717262459872914138951833252716745514845142541486413214516611978622786221288122185546181567612497611316388186757518716131857489852723129451879689119524816838461342635141733819543921873632757125172826486211318271959731581716151298217157885816878841471851864132419952121543816535611582896155866819543926925172644891641447672327176258715828961661637129821718675751265913813657181718641322422811912113547491368882975177158895321199516212571532421389667763182288717118313416313521148811666271463775365439153444571377169192213224457732773876483916861229571987291137897715768391992753146579451888349667437957284394272885965819445629418857461473871267932345249198265892874169394118655565976241213419198871513749392362234562941738359678384359382631947139916711144882846795491682947741738359845961199275339976211649637672211387166521371475889196448718857461617219716745169192241995218897848923981885746688479141128152695958147219846778358661796911687884157885838361387648264489631947126995111467922866987429921766625482541177873916192388964367732778197141653561238242686466117576178143492873997629549871469832355344656175188776518695941984677161318115425165511873351541942278161521554634744657995241257837179489123218512255334239913486925552251235628195237318312331623276579453474465775296151425196448711124691459737184334722612863194717242261742397771258192814577933475914479952411548682523751397148985272194631645225614859847712581193229148396556532389667144156611891913714961675773371731193229187968915465541376958134869212235141166982165961858954865819458551168182718998795653238562968646156674481365714819463452491554632725651748454763182845961129417912255331835271694536114881129881218998791425414134667341793333919217989297187641758549524941766625185344261781425237519786213688826622327752963452495673391669713282663714961356768152434558752915566491138716625891166982188776516878845269594623519469111968525186555613567688176951796911223514164144718534421766625391686944892294774136888277731515667443775531794891178681519927531423395183123314153191883727868171263894158289668242211124698923981879689272565182517634524981971414516611419357174239756128274299217161514133157683994691138764856935825439417121121867575819714175653118717286211357743419281459852723694779832531645485589548165961818594997369352523751316388567339694536298812122149516394287349161162944145166114133124572313345594562941784796345249528978367458125379926247377553163539551187112256444418161116217282641663656143752848859816212573472687853911558668314964254394161318113264834199521112469158895363194712194761681827773277886341122957117423971354749821733417933126187511326592119956339661887765954987137897768444118635371693941383615855177529694489248859821199535938214254141752492174845418978612214951235628165759914233951665675658194286698242281766625188574618191195511871681827195641112194769368161683846188978494489254513162731417868151122564995367169596458313579453367458134465422814794691111992861461756154453551888345427598527282779135878718211381554638843224482181471851488598359382164346613123569453619382415142557137784999923622313668637692391788834151828815283831728264164144713749391312355572441859499174643534928718292141346673196246815586681215438167375194893148194689845515223261845366195237327458414738734524981365719846771683846152838327256513385978378852442991191211936221656175845961169394111972672866981659618952968175451118312331712112314964726841817112719712537991613181189786113467824228242287268481971467838444418892398514845292755619833367458163539678384623871167577177672118313414536828467914799278782651229571118515314718511998811877671415319623871781353583491658194164548518372938159119887156561758358661661637258432144762316515422826616535614542751552611343231354749662232192612611286211217457131436938966769655583182814133922683146377525237514657942261284542758863413815913694774926362927553755344159141879689835866932778726841124583868178661519792151193229652137156674471876417464351657599112862136543918877651128621189987934323575415561282196852512618754461991742397389667256413343231154868837885181911939572414435853129451425414444187268475712519967911978621213419141935715162691146792413895125581814415669852721536459831828197458213971481199286178277714213764643731294515263641245723565327369354562941399167264489136686315647259872911867575825771567339115284919988115283835612822927551627314973158349287147185111326597288591181115179892962387124631824228194833512255338944171397148185142317141316783844744651714131977196134869237957267434624228122957116878841239666148194615748212194761518288194833593479711346783553441354749194429798729118191194845683384791258844821873289725439433313514516611366863192814598123414193578277918514231423395112458393479754311115182881714131113265941389523218519947727833721893822611757121341934524919362218318288116384482181294179126389445629442197194691119584335736375712522612833313524833739168614839657813536965557934671411281555225444186763651635391439547371496115284917787391548573918645182921445831386817262471342635759144151223116152413895438123182113817161529477441793366425158349162992855926314597377369351112469811638146579486211363598515364595612823916861875651813657187767898455599643165759912396664663891213419397743946911129417926247736935738954868171641447942873146983251484512154381223514136888258349114718511857481883727157482189987914193579368161532421112256414617561859499199679116737511128621278622185949914314711441566458313494655282662442995289781788834141331548573769239686467692391639428128812213365781162944137493919483354825411134678193622149263618938221867575193824134465499536714415661556649472446716745129216192814531496429679324631816697134461997167457631828419231831233423991534441986696192814515344483182812396668742279913291128621196448762589195843113265969857415344452292158551912588153444139512919422785289781461756139311133859718857461944297132446415324215794534825414663893977435915671164963635985197256357945324228498693294774186959435938211427547429922685272523751716151128621171413137755318615181544535228147246318167778916434661978621229571142945211912118332524421611427433242281429452738954148598416293331512231151626958551928741542516118717277327776318219382412174571778739136888241591429881218736322261287591442644896319474865791756531257837767225996431292161825176316983158289612618753856292826616979791568763173634993348155261114859844724461786815171615175854972684864132133254977196129417919887152442996339666642511395129466389581472157683946437789429111852649869324833737755312638941516269454275488598946911125985642399662232115486814133141331439547161318119119931631352331116256413486579114881119463162463181897861819119484561259856182719593883577731516939411253799458313198871595498719543921296198767221443585199477236947711831341869594162327614698321142754178883419321831419357183123393479715828963412113876485612821162944143954746437167577591567742992146781311629441833252371496547149145771833919283182877125844216199738646437153242184999918615181613181833847526959419952193218318675751748454155866817787391869594942873557244173835957945379144897113915566491253799179287216818271152849168586513547491932183114477368444115142512295715996431336578133254714726971139161721915869341156887121543861377616333711895841577434849999789429442161954987561282176662512497611344654518883172422652695919564111528383981234799524847981948335165356112699511338597161923825237524228944892126995118655566198338762468621131118526118717233515491864511992865693581372924865798843221734321125783756935888634111548681187172165356166223282779284679111852651282634928759358614254141673751987291262474885981251789953679731581342635981234676365115486829881217363435534491864513264833533251645485144358519725634986932745845895481514251681827732897825771264489131436915243451556649926721157683915546346437942873335154199679117383598621131691922176662511831347369351875651153847892672118271953533251782777498693144762313991671766625115284919887151833252452256474465561282916626619833724821153444115486825641317282641156887195843656175194429714758891249761837885118919158551389667922683565321249761196852551282617585496925171673751145771877933493883517868158621134199524461991532421381591145973763396659358618877655128264381231958431332541346673993348162529515344414637751578858866151516864268527178479612578371197267583491158693414657941425414817695545131677789122957178337254714918736328318285269598621131263894565321964487152232616636561768644119121161529731588762461867575137695845831317464351574823573631366863565329792151195248486579997386154453526247167173213991677429921431471191199319786282577169857498931228147492636153645917726821625295156674416999988479813224456864624429913587871635391978626561751623276135474961377683788521199512396663795721223514158491569857479346719866967793341946316676365144358519826581772682161923812255336985744219718499991322445399762785391134667319725636925175592635148451419357141334179338883669453652897812517812578376218521974582161521162944347268916626316983375534175653162731414617563714966965551358787395724268527178681518877656521379913296359851621257186757512659131461756171615246318159299157541598527225641388432219119934542752725651625295674346124572327458419786216596183795721938247248211255818137292123562888634119523734179331673751141733877933419786278741658194127197987291118111518352715814722624719543921996791186151811568871316388742992728859164548515748219261267631821399167555225969121544535116294416858652382421217457597624161721916515421677789196852518211385148451861518918645312945142541416596181776721437528132446434928793277855118799334886413293883562387177529618413281615218171157683914556991776722119951778739312945811638926721123764762185262992815162691463775177873979144897113911185265451316878846884791439547874227446199168788414274331227552121543856733917625871742397472446389667123159152232616535611649523894417132648316252959872911473879771961861518484561691922171816918695941114488135273172826413951291659618629928175653166971378135327256567232737553419523731611162391686171816958147212235141748454187161312214952947741954392357363171615166163712638941893822164144726247686469489319685254421619469111623276771258466389795486728859514845157683936947776923915122311336578874227833847196448717767283788511447734138951911993561282884322482541585511211479144843812317969161781416313526622327732771314369133455917686441312353856297167459812344885981461756152434577529613527374299212275523492877813533815911847385518883124168541187671674514476231693941146983215344472482116596187429921831233164548519745821524345549168983253411876278622166365616131811558668559263815676158895361175718231571451661928743593821273989196448751484548859844821826448969453612537993957241974582129417918897843533251183134133657828871733919243812315465541655581938242261288116381827195438123176258712517852897815142512578371148811787414845615828963593821411281611757761163599643173634672327983253146781349263618332528439425794531235628912588166971317262451114488773277162327699132994489216434665774341366863155866834524919442973674584926363533251911993672327688479162529518372917383591298217192814515283832422838159176318268444113991673452491118526187767162327625641315647251326483114275482375227458414799276581948964361152849175653815676185748162327618271951312351249761496674136484414496421675771928145186959457743415324216299287692398156763492871889784952968143147123622318514231439547163539167577113265915344411669821633371922683125985639774317726829327781288122423995188831326483153242119382486211397315816737512564137389541463775131235484564179331988715162731472684981234182517692874373515922683157885861377633313513345591778739126591319281457167459832533674581859499118919117767251484519281458863412119951879689688479244299264489168384611225641164963462351167173215869342483371251783573631324464164548573895425843215162698237523694777369351865556565321699998185546148859823824247446516777894159144764846137761641447162933358752937149611851531653561397743886341363422523751526364771258246318934797191199317161591662612235147328979448921195248522921181713795721657599886341549168561282757125167778919947725976241651542484564381235188831988715197458249465516232761298217732897781353193824316983154453515929911544535184334792268359358612679321263894165356116293332321851998811348692981234444183351541996791162933317787391219476948932483371427433168384648859863598583182816212574421614764845774341237647888367328979125881322445196448745831319866961899879162125758752939774349263682375215546377125814738733111611488111542516145368652137813657442161185949911649634138954744654199521134678141128118958411576839178479675712518897841611162423997429921617219122957113547491269951169999818857465976241461756543111156472596912815676654156799524141128117141314724462644891219476849999952968676365635985486579155261135736355724478741186959469655517141311982658165759913143691621257819714549168526959166163717726821578858158693413971481536459983253163135219362211685865195439215485735673391728264631947152636486413218857466561751629333144156659964316838461483965726844764841427433124774278942983384738764818756511231593634211245832382423795729711398217331758549942873793467187363241187675914418695941582896125985673895417767255724413587871265913278622926721144964219685256985741788834524941586934615795184132818191192584321699998165154234323162731413163881136697847987853911459737734916496674977196494655142339511548681425414124976115182881314369122351494287318332521794891837885464371833252164952316434661183134446199122351412416851857483371731154868123159145973755118737149698325373289719927531267932161721912618756339669872911393119549873977431247742837885174643517343211734321775296381591232185264489142945211387163977434219716925172483373149642463188257711522326184536619967917773159388354623511952373157885814577186359852463181675771681827148194661175712921613729273895466425168242217242261845366791448118111578741158693471472649667418716131978621427433248337127398915465541564725547149512826147185139774317847965148451156887841923133859777125818716139267211518288488598162529539168661983315445351685865154857312376473815911748454162327616878841661637874227198669614314719812341118526153242165415646638912558181623276232185928741728264126995129275524228775296997386169797918776725439424833713486923795721845366164346611447734381231857482826614718511122564198871525237518312337571258237521217457561282166163714738718413281471851662232111246917363462992814637754199526299281413376923913688821463775199679117847961831233557244629928997386476484158491512578371199286654156194631615283834764847773156783845168641827195122957117524921417338187363214153191625295147992734726811427548762469469111869594125178156472518615188984551471851141128169251749869316757735534416757715142513325413567681225533284679189987948859817726821166982353325175451187422718796891895841989311956411264489168788417565382779486579133254169394114839651833252111448847648414254141336578179691165759913587872463184118766359851726245147992762185226448986817767221994772718764144964235736311225647732776622327793346359851473871358787579453476484942873296793339192125985611811153553441154868126995112154385733961425414724821197256319745821128621678384122149518191193836166425112659131195248682422129417912416851378977355344195237315768391128621442161633966163135292268313729278741783372783372316983173634985272932778168384616353913688821261875126389417888341225533191199338764848254176923923622344216135938211972672463181845366185949934121117161517787394179331239666658194169999887826561377627458451282689845562992818615181156887179287231496435534437149681971411851531378977126793218675751889784298812111246912457231776723593821998813755341514251536459896436198265897113929679325843218292143169838661511631352159299166223229275519624681261875278622116294488836134667358752999132913547491928145654156171413163194712941793129451879689817695399762133455969857483788549869313163885269591457718567339199881369477488598169394154311134726852897898123437755312618751982658411876757125194429719624689287477529617524924461991419357139311162125716495231255818228147696555143954784999914274331728264823752124774216535611833252421971617814742992333135188574612578374179337611637187641847385124168586211312295711883727656175189382215122311362825112256439976224631816999983755341453681716151459737369477125379914637754885981889784137292194833512982173169831859499823752169394168242214334984596154513728859176864414617561312359751771253799767221938241483965656175888361336578133657812416858479865819417948911114488119726717565312941791245723714726781353185142315849151417338565327288592119957611631189191757125155866865415661579511225641227552119322928266585511984677171816926247164346622612871472615788589731581316388174845417383593553444441844418246318442161718764182921417969116414471249761136484467434616232766642511257837892398136888268646167173216172191255818779334775296121341913486926198339691276923999738614395472967931827195833847144964219261263129451582896126591323622317625871352737248212483377914481267932171211281365717545111227552173835938966772684543111188574662992817847961877678318289448929731581742397815676136282519887157914486763651964487672327375534274584124572319321833714961926126474465629928151828813749398621139792155733961439547387648417933141531981163819483358984551895841179489172482114617561271971633371173634195843888367147261516269131235123562812416851417338168182715788581621257161318116596188237521786815112862197921577933444821857945318231571429452989311724226141128115465544583131623276232185167778977933419281451576839142945218978613991674946553896671736346258986413267838418191195855118574816919229731589973861229571166567552494843942142137658752948456886341371496545135895487288591683846787418358669933481269951446199135878739168663194736745868847917484541263894472446127398916757724228296793188372746638918292141455699186757586211357945312376478136571249761139714811427541211411548681451661154857365617537957216596182866985996431817118796891512231196852566223211811158439421483965242281617219165154219382416555883788589441737957211144881716151128621128812292268313547497853912584329731581665675146781318594991671732571377148194697315889845519927531841328995367157482166163775914486615111891915552251877671425414633966254394123159936816174643538764819382417141311257837128812237553448859899738657137777933477731525641312739891181115153242158349115344413951291425414114477311972671798929894417161521516269932778176662522814716838467914489186451425414135676841995211871727954865935862846791978621132659946911125581893681681365716414471978624825411754511158289638361143349894417684441654156282667268419564111837291415319718764991329158895313143693795724764845653217868156258919483351241685242289691216555884192311366979933481712112144358557743462387168646148598495296818251767833728318281962468197458218716131481946411876165558182719517827775774341873632357363173634122553331496411144881465794587529116496316717328419231675771972563916626389667126793267434612679328883656128215223265471491397148357363161116219826588257719549874522569852721443585146983213365783634262185255118784394258147219685251944297286698139916791864518897841556649868171865556124572319967911926126187968945225646638955522525439425641311488119913298257715653292672128266154251613446548358661253799157885814395471122564757125143147116273141871613179691198467798527219523737853911675771229571613776456294922683114679252494146377517121121185153421971143147115425161788834997386662232155866877529672684395724139916779952482577117686442119952281476339661548573547149167375116596183593821463775912588171413115788581673751152636415445359267211522326186757512114165759914314714744656965551219476193622134726812396669913291621257184738581163813244648479816858651675771782777244299823752837885143954718554612624715929919549875572441778739186959415485734583131554631736347328971259856187161397921514536815283836581941245723545131982658353325163135213123512578371586934126187513345597833721823157134667363598541389511528491974582625891183134162327616454856117571112469137493918655565693588964361869594119928687826511467921229571197256317423979832535511871653561157482194429713547491669713193824143954718837275713775491689125881199286125581819725632745841546554168182713587871611162182921417787391267932242287429921449642169596171413139976268444115384788338471199286123159123966617161561983398325311488111988715162529514153195794535471493573631221495124168518332521911993417933557244934797262471362825343231623276179489152897812517828871713971487894291223514146781314415661661637174845412699519347971312352119951554637429921893822561282143349166163718594992261281118526932778158693437351518594998197145673394986938197144583131227552173634152838315142511467925148453452499913291869594174441677529684192316838463351545269591227552166971315142561579542399934797164548519826585693581372921695961772682112458313264831453689872911417338151223184596169251782577115828961873632516864141128155522517363416697131451661186555614193572967937773151354749698574238242114275419624681421376886341718764124976114799271568763932778171413114678131227552347268178883418857461516269126591318534421766625331116157683918716131996791932778173432117262452927551362825423991132659118717213749392927557571256682893916861633371488598516864161521859499726847288591431471781353182921481971412396661786815684441118111562992823622311245831378977129619814395477631821423395843942143954711144884623512281471516269168182718292142745841544535199275319988119523735592633129459347971958436198333331352725651752492987291236223171816993479718877654381231883727134667315283834138951449642781353111448898931454275664251545138661511669713129417913486921843347139512911568871615213325489441718453661865556173432117282641257837196246847446518332525754154845616818271265913166769477529694489213385971372921267932135273133657816979791871613187968998527266425148657914476234825411181115335154111448898123497517765617511871722846799893124833795498751282611467926743461734321163539118313418171188776519967912644891429452137897714516611534441267932161318192268315384781344654446199146579412558188277917181691784796333135166365616858651865556146175654916825237512396664219711427433169596178883415647251265913183325255118735534419422781431471888369388353634298931188978427256514173384138951356768928741263894314964482541145771882779144156693681661377672482114738724429954311142197137755311568878217336763652866981669713119121177672952968144964277125862589662232952968987291841923156674424429914597372564131326483188574614254141651542849999178883436342274584187968919786244619981971416717324845614233951473871968525126995116535612281472362232624714395478782655188831744416512826629928664251369477262471691922462351783372145166111387164239972684193218317524927571251257837125783797315829679311528494724468681717121123573633129459913295572446945365774341946316172422678337216656751962468559263127197122351447648434928794287328669867838419584312699511796911986696773277188574616818271514258621131865556771258333135175451119927531166982139714818776765617581971413143691629333195843164952357541515647251132659153242112356281734321126793256935898729184192316273141417338165356158954814637752584321883727196852558349138159129477458349112679329529681374939115688763194717787391843347182921412416858338471469832724821167173219725632362231419357141935761781414859843432389845526852788836146579417242261556649133859712558187995245592631629333591567938835236223383611728264211995113669712114146781317948911584915181712826633919219523739347979711398156769933481239666813657345249169797911326594118761619238583491944892633966512826133657865819484394215526111423395141733841389514617561631352472446122149563194718473851546554136888216979791189191349287143147125439455926365617512659131843347391686152636414799271685865549168845961137493911488114764843432316818271613181118313414153191211481365737149693479787826541793317767216878841259856795486375534357363135878714637751861518171615169596194429749869319543929327781269951147185111548681516269122755287624616252957672213668633977431742397419952242288944173412116521371189191121147692391651542118313415526111132659738954177672169192245225613931179346713385971869594164346617524921752492155866856733945225619119936662714233951463775876246166365611185266743461536459379572371496155866895498734726816596185875299771967874112982175774341366863147185114597371431471448218172422615566491146792484567248212644896299281568763942873397743146175614133125985662387112214959812344825417833721956411185142317545116137761144773165759918231573795729368167672286413216535611312351469832864132132244515344437553425641339976218514235431111536459178277786211316838461954392337173115284942197118171189987952494516864292755163135215425169428733916869489311225641675771752492111448845629411144881195248153847893883525237511912119584336342577434613776175249215566491859499585512321851544535783372549168185344218554614421611716153896672382421693941145771854916889643631294513426355713774764849489319281456925171948335845961147387185142377933477529659358684999913385971758549146175641793319382414112811273989184536676923912416855249458954819786235332569655524228335154115688719584334928738764846235118615183129459812343452497571251417338133455961579517666251693941171816916616377954861833252198871513325434524916999981522326932778165154215324219327789852725915677672263598519119931548573199477214133591567152838383788516273144583137954863876481267932232185179489115929911132659226128486579127398913628251197267569358242281528383698574987291175653196448711952483553441665675161116238361161721942197116495237773151417338162125712235141944297954987155261188432231698312699511742397862113343238237521926126185748654156387648476484186353745629415566492543945511874199521259856183527145427557541554916811245831645485186353712315914859847914481185153189987913426359691216596183836173693519543921851423444181263894194227837351554513153645911427541459737381591718764178479666425139774311124691219476258432847981471851868174219713694774663891998816945361697979188574613547491368882186959418998791623276373515587529119726755522512558181292161556649555225133859734121117726821189191355344193218316212571728264115486819422789751772543941146792714726912588133657812679321195248698574147588917565311629441829214166163756935817827777631828197147833721996791446199179287219988111952488419231837291253799163539969121792872773277151425154857347244624631816555812598562725657268411891917732771263894997386113669717524927732771288122118919126852715263641241685129216158491514657946178143735151667694143954726247272565615795187767192814544821811932291314369167173217262451699998126995141591415142578135314334999738613971481665675813657133455917141313311169267211669713779334163337194287328467917726821825176126793214193571342635199275318372917868154926361968525262471245723389667166567583384714133821733938835284679142137616616371582896158491515223263735151459737123159111448859964316999986965553654391944297288717613776359382129619812194763452491144773629928183123337755312114363427571251423395413895211995995367154857331698318352711984677119121115688797921513385971483965144358516131817429926682891542516152838345629486211397315816434669872915774341794891248337144156671876466828918514239893112315999738619584318372917585491794891118717259358613991671982658135676839774328871715445351851423371496156472544216114233951627314185546114213761269951188372749263618615181841328141128112537996824221794891119524881971418776714678131122564148396514294521865556152636413527373491619281451189191139916751686412578372584325673396299286642511673751136484428266835866821733516864113265919786217666251292161895841193824615795178681517383592382424643758147211912118453661469832811638186555619927534159141619238175249214254143391921726245139714811972671441566178681516273141368882148194659156791662635332513547491681827991329734916147588911669828923988782651952373878265676365146175642399187363216111624643759762411548681257837165961837957216676941944297189584118171169394193479712315981365752494577434174441619119931411281248337365439381591182315723622383384754513124774297719613143691516269114881184596155724413587878681799132918473851879689165961867838452897883182812961986622325875297793348318281162944185142329477448657991258876923997315813648441154868125379918271959549879166261348692112862176318214577186541567672211932293351541613181158895327458499132982173337755349667419967918499991865556286698146579452695918271951558668823752615795152636437351526247694536815676662232169797959358652897841389511851536945361463775189786367458163942858752969655511286215875291835271486579184132861579566828916777891954392395724152232617363469857458349124228464371453688621131512231385629118515329881248657945629461781416353967232715344414415661483965181717187641294179187767153847815324211336578169797955118788836167375117565318796895754151996791136888271674513951293149648338478358661897866824226137762362231354749615795168586599334899334817625879872911794891118919113971487732775673391657599742992152232616515421542516142541416515421166982198669679952412235146642511342635682422178883429275554513585511122564696555991329155261113749391988715456294476484124774266425115546311185263815919812343371731617219133657899738613547498782657692391899879349287123966689239816717321877671863537136282514476235491681433492281473311161249761151626912416858479849263624228631947194833569251719685257833721265913518883174643561983318514234441873289736342585511762587122755212214951627314114679218776715425168277969453619261269549871122564189584119281451128621668289185142319745821122564137292145368174643514375281354749696555187363215546333717319644876622329448921223514779334186959415748239168611366971796911627314886341686461183134143147115929911166982141531919826581124583472446845961555225171211214718511538478619833178479616535618964364482189893177125886211316535611762587145166169857462387112659133714964461991112469146175616757714375281231591673751174441618433471724226926721178277711831341956411134667349263615243458338474542752463187167453331351431471813657132648315324217833728499991964487189786174239744821852494194227881163816394288318284421613391926178141756531459737161521112469367458141531911851531586934189584116939416884796561751641447181716844411457718168788414496421134678167577122755283788581365718615181534441415319482541113669765819457945399536714617568641321514253795721536459585511566744129821766828912477423452493533254865791873632156472531294513385971796919388351861518652137166769416777891316388181716541562382421712112619833415914111852661781466223269655565819494893367458286698132244522814784798141128178942918473857934671372921423395169394129679348456686466965551485984557244171211294287329275517363411831342927554482181645485189786415914896436187968913688821451661175653158693426247631947119928695296815263641237647185748128812272482114274333876481992753193824167375157743451686454311112214959731585693583169831193229985272194833514556992261283977437954861716156238718964361191211514252624718312331269951652137452256174441616212578116381265913294774123764719988115526119428731124583676365144156683586652494232185391686272565678384789429155261137149662185225641318473851522326119121167173218574816737511221495175451197517739976218292141378977126995119644871152849186959417343212543943674583553449731585855112881225592631364844787411241685579453127398911932296218526178141229571159299189239812255331354749122957151686447244617423971657599339192119928612114126389412376472644898984551831233375534516864116496315263641532421152636469857457541531496496912144358594287382577156532193824698574973158526959292755411876136484482173362992838562919442971726245545135592631574823169831164963593586111852694489251686454714979952412941799327781843347522921166971351686417524921625295169596155664918877651485984158895377933451484516212571419357254394484561221495298812593586674346183527118837271548573333135175653975177395724196246812235141843347196448744619911992869388351374939142743312739891314369156876378539166223214597371677789916626926721163135255724411932291364844862113813657184334759762498325378539147648419321831296198161521621257738954995367379572694536174845456128219463163169834986933735151875651111852652897813951292947741132659187363287624617726821625295868174926366258918695941413331496418877659832531623276849999359382125178111852614395477369351554631677789975177296793884322868171746435134263516676949852721473871253799615795137493917484541655589549871685865178479617888341978624381239731584663893472681718169625891823157125379914314714966741548573613776528978561282161318115667449125887429927349163351542624757945317484547672237351567232747648486615117868151736341378977732897115688773289783384713587871794891143752876116324429916717321911993155261131698311629447591448197141825176193218368646192612618978619745821938241437528593586196448711568873129453654394825418762461443585162529556733918695946218521621257169797912194763856291837292846797712581413315748262992817787391823157152434525237556532373515684441193218376722662232734916547149118919191864516737511443585971139197458272482111467928843221952373197862593586115486814314711948335189382216313521964487121543866223216454858863411592991143752814213761615278539194287312174576521371342635611757484561368882196852515344417868151263894761163113265913527314395471538478164952313769581294179173835916697139893144418571377878265391686129619877529618534425168641718169623871124774236342442161163135219321835915674239918998791736348237522846791265913734916116698212214951324464198871596912167375114819461885746365439211995377553148598416172192321851625295916626298812169797917121121473871354749589548189786125581827256545629411387165875297369351564725575415155664913264834219711449642183729597624421971126187518554617571251643466178681513567681586934561282165558133657898123415122312543941199286146377525641319947726925174744652624717686448338471556649389667625892281471413311669821512231139512923824214738789441784394224228585511255818528978181711433498499991734321696555143954716596181114488922683173432121199536543919584313668631267932971139154251616212571247742145771819988197315813749392988121617219142137683788516313523129453452494643749263668444134726819483351956411734916188372726852784999945629477731519826587268491662618191191122564383614219715855119362211879689518883577434411876688479514845912588811638688479365439787412988121552611452256184536638361144762369655515263646581945693582786225431113129451532421369477894417195843145973751888393681618756517853919549871156887145368194429719261269691216252952624719745823311161792872228147672327696555152434519543921453684885981522326983253849999168788419261268641321354749438123161116294489274299213466737631821962468115284946638997921512134191635391473876642511568763145973774299219927532442997813531819119116294454916884192314294521239666187161314859841772682115284938764815182888257711443585168586556128238159149465582779482541151223198729111326591752492258432819714989315653216757724228492636132648315667447894296723271453681512231199881194833548859813769581673751831828183123337957259156758349117847961841328146579415667447187641873632196246817625873472681358787724821662232258432161318144216152494114477315828962442998378851621257373515672327182315736543944418194227897719633919227256566627781353335154728859113467814678131273989154655454916827256519786217948912967931181115137292484567732776339662261281996791134667314173381459737143752811245831948335125581817363415526115148459933488984551873632158491559358612679329751771185153135273528978194833545225617847961772682652137145771811811151128621791448119524814718519691213224454239913971481867575555225196852513688821336578573396183123357339638966718736321429452726848419238499991362825167577811638153645933919226852718877658843221584915676365157885897517716979791271977389541411281292755152232611185261932183176662517161512376471512231335154676365678384498693156472525439435938277529661579514213763916865875291756535996435128266723271538478561282589548179691119524817787395491681798929166971311891911467813197862193218372885913789776198331469832522921167375137553416737516178146117578217336299281576839126793254714981769546638912517888432216757712638941972563155866838966719584335332518554611861518987291345249136686377933418635371273989167173227862213264835451387826516858651485984113467891258861781412114371496137695862589278622178681577933413648449913291199286793467137897734928713446546844415188831734321111852617383599872914764841352731798929195237338764811871721314369268527175653135676815324214986935289781938249731587288591798929156674418292141728264123159164346625439465213745629425641327256514516611449642849999551187884322989318116381164963936816896436775296779334113871662185213749391847385126995112719711952489792151851423831828615795736935817695147185116394281199286581472193824591567133455951282614819464239917464355794531835271189786888366137761292161944297654156123562879952447648412477424926365451313143693876481411281771258168182737149649263614859849792157167451974582154655418433471962468154857314556994946551514251897866844411564725137897716394283331351823157114477367838431698314233955855144619928266732897175451169251711124691122564165154216313521873632395724742992134263575914415344415889537833724825415915672846799166261552611198871581769515465541332545693581213419172624527862289239813648441942278442161391686118515319362216763651893822173432111932291259856129619814334917989291213419182517635534417444161211415425161633371892398162327616212571366863339192817695187767694536115486862387148859812154381332543391921714131198265873693514294521932183613776118717216959616293331181115286698134869239976215667441817179548614536811669827167451213419118515389441718756511827195177873913244649711394946551613181118111584798936816551187864132126187516333711897869469111342635763182128812218231571249761811638353325258432185748524941136697795486118313419281455976243351541273989118111568847988634155522557743416919227187641546554128812216697135895481879689611757146781331294523218515788583149641269951124168572482118695947853917631821257837119726782779781353121141928145397743143147181971416656756581948136576844412564131469832339192395724674346896436145973712315983788568646159299111124693815911247742154857382779115688752897818594991451661993348119524886413216131814845679952435332512174573735151532421172826425237592672144418164346611972671249761264489452256652137549168165558153645916232769166261861518365439158491597315815384784138955875291962468113467897517711366971136697983253185949952695918433471255818187968918574867232761175772482116717321895841169394118897841823157197256315546314536888634181163867232718594997571254482181613181347268335154466389136484459762459156712679321411281112862112356289973868237525289781144773977196555225716745983253172624579548619584351282631294566425112618755612823836165213746235113486921558668122957159964311992861457718912588124572318716131887765199477238361142137612881224865791213419692517142339536342146781313143698116382725651778739199881165558119928617141311821138862113184334719564111615241995214133167778992874181718681778337261377617585497248211112469166163718594991211447244694893166769414153196985745552257995241691922528978189786154453514415668459611847385146377561175754916812982171425414134869279144814597371675771378977567339158491517444161651542198265824631814738715748217524921786815522921114881162185219584368646175653446199494655135676871674512578371324464993348118111512517815667441635391724226486579137493949465517242261887765174643517282644663891465794126995118554615935863977431744416528978113871614738718635371831233151626938764816172191855461192612668242237351513486924138951221495157683944216112235141768644122149514254141532421936816684441878265589548438123716745111246917989291782777268527916626125783716979794946551235628674346195237315384789751771524345177268218312335289781231597995245653213547498338473149641645485134667366223216555813749391681827783372168384628871719321836137761546554799524831828193824773277492636763182989313714961376958597624162125712457231617219353325184334788836195843175854916737519428731695968459615733962826678337293681619947725491683735151368882145771822612899334811629441429452345249849999666271681827119524818332525713778257711772682228147111246949263612537999691245427563194714556991453681613181125379916212571758549126389415748212497618156764724465814721716155188831312351273989169192212154381269951186151813527328266736935141935714577181582896176258729477456532847981691922973158611757119121197862777315119322961781416636567631821269951769239371496264489146377563598559358618897843876481237647757125672327656175146579418716139368164562946743461235628154251611972671485984134465438562941389515647251786815769239421971114477349667481163814536811185269226831546554514845126793213951292463184199521372922584323795721518288268527769239123966619947723391926763659691244216177529642197197113914738748657951484531496419624681467813184738517989291522326316983187565111568873169835572445572441738359122957168242217383591461756833847122553316293333735151298217129216155261118251768257718338478439421853442172826417625873371731746435385629339192668289232185811638547149135474925439417827771592991246318197458216495231821138942873145166118211388742276642511146792135474911346782644891883727133455948456617814147185111992861857481231598156761267932833847238242182719559762412174577248212463181162944171615438123668289147992713951291629333168788412638942745841568763629928825771761163666271899879569358777315184536612356285895481215438147992717242261859499119121148396515283833795728641321819119168384641793368646125581893681614375281122564244299896436136282517161514496421481946547149127398961377611528491518288551187118313412154389792151714131555225845961379572678384174643578337213486921441566147387171816977125869857414577181942278492636995367167778917181691968525232185438123131235186151811912118191191441566198669633111686413284394217161562992815869343452491181115166567535736346638912214951249761371496458313482541799524178681516818271292161746435331116153242134928734726811286216682891716159489359156767232792268326247188574663194725237514678131932183232185934797147588992672169857417484541453685148451942278166971312638945188831118526413895345249185142317121121334559294774314964113669718473855612824461991643466162529515122318197142564131459737189382214799274421611635396178141316388252375997386353325166365617928725431117914481716151831233153444246318166163716575998358661855461199881118919168646492636569358573396415914194429797113911124691294179196246819826582483371419357395724174643519967912644891576839139916711811155269591344654171615167173217625871322445111852614738738966759358661175718695941485984486579331116668289125178145973717868151584915369477157683912416851974582145973712699511952373114881112356284946552463181734321172826415526116945361851423111448811972671183134761163121745748657919261261548573178277729881218534428176951181115811638126793226247139512913729245831317565345629418191191851423119928618655569448921447623114679217242261352731372922564133856295612828681712235141346673516864831828157683913628251342635189987937755373895499536714112811687884145771816616371267932656175232185381591133455956532118515366627125783714556991213419193824377553371496171413112356287813538277991864512174571245723789429252375174441613688821643466143349783372672327194429718292141136697823752136888216757776722142137638966715384787369353856298964361134678132648316192384461991928145375534466389129619819786216818271443585164144719725631718169126995165617578942918958411857487429921439547179489167838412376478499991754511172624516172191865556736935316983168182752494139311116294413264831716151213419589548116496389643613527354513615795188372791258817363498729159156744418587529133254132446418615181728264482541121745711326591821138129619855522567636513628251621257583491199275359964319786214112813876483432314314711671732147185124429918998791191216117571762587162327616777894946551984677696555194631618554613977431978621798929397743126793214556991197267163135245629419887151659618163337169251713264831114488367458189382282577124228518883757125969121974582587529987291199881153242112194768621131863537187363215263641655581853442211995623871123562817625871288122131638819967911756531978625834911738359944892169596952968114881167232718312339267211825176288717154655414657941534441712112154857316111626561751241685158895314516616743463997621699998175451134524955118748657913365781461756164548527458465415628467925439412477421752492126591362387189239819321831251781481946144762348254115142516838461766625337173242281261875492636111852614859843856291152849153645951484512699519953671611162151626986211358954825843268847917868151518288819714226128122351465819441591413486922786221718169482541177268211669822685279913297934676521371677789973158343231342635183729154857335534416858651829214199679118857469529681485984113871614657941413311387168156762887171429452156472512356281124583174441644619912497611247742178681511891911855461188978461781411649633714961215438121147712581556649185344213648443856291316388331116573396124976127256563396658954813587871691922198265814133813657569358171211215223267268499738611629441829214896436274584182113815182881952373182517682779171211254916848456244299979215178479613244641225533757125795486165558133254122149517686441778739162933318574879952418998791469832129821714375287752961342635194631617686445451349263619786269857414758895188835895481358787132648363194728467925843288432277933412416853391928479865617519725638217331393111641447178681516676943714961532421555225684441137493983586618332525491681691922163539777315185748125379911649631617219985272124976111346781294179282663836118695945188831972563599643849999193622112416856319476864616717321461756163135218675751611162158895316596181962468843942621852164144715122311257837246318928741938245693581954392623871173835925641376722347268135273182315718695941225533155866816495232483371962468157885813567681528383182315714294527147261837291213419147185118594995289782564131837292483375814721374939193622113769586339661697979141733818372998729131294571876497113944619912679321423395716745181717672214415661156887162529568847911387164744657813532887171453681449642166163736947794893571377597624172826413931112517834928719523731528383188574616616371292161259856182719566828914213761869594122553313486921665675359382134869226247173432123622324429917888341437528886341686461574822826673491618413281655581144773124572316656751554631837298863412523751954392199679134323158289637351516737518964361893822182517668242214375285592633654393452491956411211995184536628871718413281639428133859798527277933479952455724476116314415669549871514253533258358668944175673398237528681718271956642519428735875291485984573396113871614657948136571122564264489363427692395996437349161265913113467819826581156887783372264489165759919564119448921665675652137498693188776535938215849157248211665675148396579548657339619463161332548176951887765165356184798122957119442971189191154251662185248456153444948933492871374939912588635985173432111124693815918237521338597789429158491514597378681716676941342635619833757125188372715929914865798964369529681623276196852516131811354749864132551187141331883727182517668444195296869857498123417767213224456258987422783586693479711992861897861237647194429763396641389558147244821871876445427582779123764718635372543943129457631821358787789429876246145166189845512638948641324562941217457168182717363473895428467935736354714971876418554619327785895483573631669713587529113871617666251528383152838318211382624712154381183134179892937957294893188372731496489441712275521681827573396672327666277349161451661119121599643131235145166112356285733961134678163135218756511869594769239156876311488116985741677789686465168646137761251789428736723271667694771258787411714131169394115283833795729448926864612154381294179152838339572476116311851531453681578858377553111852659964392874676365178277763194797113912255331324464343234421619448921467813194227862387111326591938243452491576839498693165356197517714213761875651186757583586612941791433496985741449642379572185142311124699166261534441768644274584343231191211853442518883692517181911968444158752976318281365712881221988715973158178883415384782846797328971261875139916716777891518288159299141187686615116596185814721744416137897712497614522561681827177672176864473693518554611875651971139183123314476231334559363421738359183729162327612295713997621633371252375188372719442971829214146377512457231524345989311944297113669799738665415684999973289799536717121121554631974582161923878337219543922947746238714179331859499821733115284957743462185211366971437528184132833717313385973492871655586238715269593836124228892398155664938764814476231376958298812492636876246116294412921694287318837276581943755343896671655581742397113871615142516555818837274946551134678126187514678131395129193622159964398527215889534179331112469417933736935144156614819461578858157482162327657541582577127862213365781229571938835133859718958419751771653561133254125581817787393977434138951481946918645587529112458313163884138951984677522921948939186453412117732771237647121341976923912537991936221314964845961123966618534421251781423395121745794287376318277933414274335229211623276199679118615184138958944171332542564132725651415319199275397517724833766223212416853472681964487172624511488111183134187363282779123159167173271876446638915122311197267186353719988146235154311144619918594997248212321851817147446557743412497613492879771961475889126591378337211286215653267636519564115572441138716158289615142518615181433496157956541561869594127398917161512114916626145973711548681142754141331255818613776339192173432118332521683846615795954987116698213123511447731166982989311128621126591325641389643622814716152343231992753137695871876412457231257837147992712174571736349731584623511112469131436928871768847973693514254141611162347268343231528383993348167375155522512961987833726662712275523997621417338135878759358611851531687884198871514173381863537195237311387168843227894291485984113265915142545831313486921588953129821777125812114142743356128212659131695961199286175451118211381512231579453156472582375217464352523751146792181714239919564111532421176662591662613951291911993672327191199349263678942929275561175723218517282641516269197256317121121326483674346172826415849156319471754511168384655522573289778942981567683788526448914698322887174663894623513957241322445167173268444168242293479715526118156768257711397148178479658954897315812396665976248197141112469125581814314716319477389547692391429452188372769453628669815788586198336965551895841122957133717319584316858651942278191199313365784118761463775876246154251656532166769414233951744416164952386413216333711554631873632131436917121126884791778739118919165213779952425641398123411932299731587369351536459522921183325211286218681765617558551162327617625871526364199679112982171714131335154236223163135215546316838464926361399167171816917666251542516577434198265812315937149617686442463181697979345249399762516864264489355344599643498693337173512826133859746638912497618923981617219942873581472884322621852244299118919138562997921511467927611634643713951293452491471851242286178142644891817128669825237548657916495238136572786222382425996431269951188978478741355344112256419382412275523351541134678131235151828816616375491681411281192814513527317868157732779489311286211752492139512917181697934673714966178144623511189191142541418433475814721195248161521796911643466148396548859818433471374939977196129216886341597624164548512941791673751144964216737511231599469111362825948931661637666274159141659618115688712275521399167127398937957217989291181115942873383619186451887765196448755118754916819119931926126164144715445351738359694536125379965819415889531821138298812188574612659131564725132446495498787422766223275914417545111786815484567328977631822927552644891697979168182767434634524913365781734321148194625843217868151948335111448811831345269591821138162529568444189239818837271883727147387154655416515421439547815676186555669655586615115182881441566169999817767235938239168619624685996431524345761163136484417726824825415754151928145561282146175616818275653294489276722413895148598416535611314369165558819714141333694775249419523731211473289715849151237647187161361983397921599132912295711782777188776512194761635395834919792151294179579453692517161318117989291784796162125774299217868154583137894291118526153242154916816959618857469267214219713997624562941952373932778621852155261144418195641118716131675771643466144762318251766925171992753193622113123513587871459737185748658194178277711649631645485864132193622119463161227552757125145569912194761154868162125716131811429452146781319644879166261352738621131144773226128144156657541546235116131814482182463186137761621257141935715849151889784185949912719717363418756511411281936816194833519362211855461121141413368444113749391225533143349294774142137648254118433471241685192612611528499327781576839339192176258714375282846791421376133859771876415182881326483464373856291425414171615183527173289787422711912119463161429452148396582173337351587826516676941362825118515314274332725651871613151223118655561439547188372715586684966743957241584915135474916737511728264888361152849136282512982177147261659618664251462351347268363421185153197862121341917948911514251118526438123146377559156712578378176957187641988715522921199275342197125439472684119928611952482543942584321823157395724157683959156784192326448945225676923966425163194714254141483965118111517343215673391239666397743119322981365757541515828961532421118515393883589643614556999469115895481461756454275183325218695941784796146983217767212598563654397712587571251782777557244876246185949949465538159119584316273142523751873632884322787411514258883666828915162695552251998813331356864668444116656755855118615181399167795486151626952494397743164144717464355431111613181159299144418179287292672149667417726829388356884791199286129417972885987624623218511185266743461259856165356123824247648437553416293331415319617814184738535736378942914637753351541429452156472515929917752962866987187641871613182517622612812982171548573942873184334715566498318282281471263894193622166828987624687422716757717181691441566593586359382198871563396671472613729213446543714968156761556649736935146175644216114859841592991599643163539369477793467292755579453381591182113811891911294179377553194833529881271876418796895855163396614698321946316197458214516618762466137769549875168644159145229211312351742397157885876116319988169655518756511641447132446412578371185153815676177672171413118554617995241348692151223133313512477427268414617561986696246318152838318574847244616939411197267159299115768393553441566744742992417933162933312174571865556391686357363148396515384787692393533251758549518883158289645831383384716313526238716763655229214381231926126188574638562987826512537991873632147992767434616636566299281695969287461983317423971225533545135713771431471168384658752991258814254146339667914483997621582896583491244299512826787419388351344654182315719725633169831437528979215187767143954731496451484516596183654391237647158895313567681968525363421352737692393129451829214579453148598499738656935819281453795726198331827195864132181718358669711393856293775536783841223514171816917121125733965794531584915186757513749398479817888341582896196448781163815748216596186521371772682688479716745193218319927538217331362825242281954392114881181163813971481768644662232825771391686732897158895315324211865556771258738954359382154655463396619523731954392349287141331338597194429784192319927531978629812347288591235628137695815647251768644134465413345591292161154868182921418756511956411849999198467717363431698346437168586557743416939416965552382426925177813531292161835271581472175653185142374299218716131938241185153591567116496312578374542755855112315984394218352719428732846791225533126591319947727692394926361611162868177349161663656123562818453662422817444163412111213419337173131638813325413365781322445785391191199395296879144813648441475889114679218312331193229185142335332533919255522584798389667181714926366178144522561532421625891639428158491598123422814767434616636567773155572441655589792151659618115486865415617888344482181663656411876438123587529486579845961381591139916786817942873143954738764811427541978628277973895412982171231595451319967919792151837291526364144358515445351827195821733476484146781383788513749391415319163539127197892398188978417363411528492483371675777349161847385134667317121121756531742397122957159964328871712477428358661958438641323553441132659256413355344189382216172194966749812347349169973866117571548573143752852494192612656733915546318796894179331946316118717249869341187616939411429452777315585517752964421615471495511879388351219476264489417933158895346437142743328669813931112881221461756139714839168614213761899879284679381591142137612396661421376734916151828814536895498759156717383591877671984677163337111811151397148932778971139133657815849151332541645485174239716232761623276932778777315126793214213766723274159141191219731581718169813657189382214819461574823795721829214194631616939415673391483965121745717464351611162157885813325446235114819461223514189987914254143836145831329881219685251334559274584526959575415387648137292357363411876198467781163889441716394284663896783847591441352731532421599643613776579453153444282664542751419357146983218897849852721691922599643444184724461522326118313416676941885746194429716999983876482543941344654886341793467144762339572493883519624689368161189191198467791662619988112719752695983384722814716414472362235552256581941726245369477736935162125716495235754151766625252375129821718534424926365572441885746139311184738519281451441566831828194227858147211912149465514577181695965269591629333397743131235185142377529615566491657599121142644899893119442979691214173386642514583131946316125581891864565213751686415162691332542321851873632246318785391123764716454851677789353325775296165356124228147185114334958752915122311685865932778977196124572312356281992753192612661579523824219564111431471154857362992889441759964358954815687631984677113669749869319725635754152947745289781485984989311988715662232145973738764872885931496417565359358616656751584915724821136484433515416919229731581972563198871557137716777899489371472636745838966748657979548663598516919221831233983253888367571251663656787411124583186555623218531496411932291199286438123133254164346611185266763651835271111448811912117666252826683182813729237755311851531221495312945783372888363674581897861148811171615948931994772116496398527212356286682891191217429921465794377553492636498693114881119523731514255935861716151271971128621113669714415665289781429452817695178883437351513628259792153997625955221614\n",
        "output": "494160708\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc164/tasks/abc164_d"
    },
    {
        "id": 654,
        "task_id": 2242,
        "test_case_id": 8,
        "question": "Given is a string S consisting of digits from 1 through 9.\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\n-----Constraints-----\n - 1 ≤ |S| ≤ 200000\n - S is a string consisting of digits from 1 through 9.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\n\n-----Output-----\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\n-----Sample Input-----\n1817181712114\n\n-----Sample Output-----\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.",
        "solutions": "[\"s=input()[::-1]\\nalist=[0]*2019\\nnum1=0\\nnum2=1/10\\nlens=len(s)\\nfor i in range(lens):\\n  num2=int(((num2)*10)%2019)\\n  num1=(num1+int(s[i])*(num2))%2019\\n  alist[num1]+=1\\nalist[0]+=1\\nans=0\\nfor i in range(2019):\\n  ans+=alist[i]*(alist[i]-1)//2\\nprint(ans)\", \"ans=0\\nS=input()\\na=len(S)\\nk=0\\nc=dict()\\nmod=2019\\ns=1\\nc[0]=1\\nfor i in range(a):\\n  k+=(s*int(S[a-i-1]))\\n  k%=mod\\n  s*=10\\n  s%=mod\\n  if k in c:\\n    c[k]+=1\\n  else:\\n    c[k]=1\\nfor i in c:\\n  ans+=c[i]*(c[i]-1)//2\\nprint(ans)\", \"S = input()\\nN = len(S)\\nA = [int(S[i]) for i in range(N)]\\nA = A[::-1]\\n\\nMOD = 2019\\n\\np10 = [1] * N\\nfor i in range(1, N):\\n\\tp10[i] = (p10[i - 1] * 10) % MOD\\n\\nfor i in range(N):\\n\\tA[i] = (A[i] * p10[i]) % MOD\\n\\ncumsum = [A[0]] * N\\nfor i in range(1, N):\\n\\tcumsum[i] = (cumsum[i - 1] + A[i]) % MOD\\n\\ncnt = [0] * MOD\\ncnt[0] = 1\\nfor i in range(N):\\n\\tcnt[cumsum[i]] += 1\\n\\nans = 0\\nfor i in range(MOD):\\n\\tans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\\n\", \"S = input()\\nN = len(S)\\nq = [0]\\ncount = [0 for i in range(2019)]\\nans = 0\\ncount[0] = 1\\nm10 = 1\\n\\nfor i in range(1,N+1):\\n  a = int(S[-i])\\n  #print(a, a*(10**(N-i-1)), q)\\n  q.append((a*m10+q[i-1])%2019)\\n  m10 *= 10\\n  m10 %= 2019\\n  count[q[-1]] += 1\\n\\n#print(q)\\n\\nfor i in range(2019):\\n  c = count[i]\\n  ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"import sys;      from decimal import Decimal\\nimport math;     from itertools import combinations, product\\nimport bisect;   from collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)\\n\\nimport numpy as np\\n\\ndef Main():\\n    s = read_str()\\n    dp = np.zeros(2019, dtype=np.int64)\\n    dp[0] = 1\\n\\n    cur = 0\\n    digit = 1\\n\\n    for i in reversed(s):\\n        cur = (cur + int(i) * digit) % 2019\\n        dp[cur] += 1\\n        digit = digit * 10 % 2019\\n    \\n    print(np.sum([x * (x - 1) // 2 for x in dp]))\\n\\nif __name__ ==  '__main__':\\n    Main()\", \"import copy\\n\\ns = list(input())\\n\\ns.reverse()\\nn = len(s)\\nMOD = 2019\\nm = [0] * n\\nmsum = [0] * (n+1)\\ncnt = [0] * (MOD)\\ncnt[0] = 1\\nt = 1\\nfor i in range(n):\\n    m[i] = int(s[i]) * t % MOD\\n    msum[i+1] = (msum[i] + m[i]) % MOD\\n    cnt[msum[i+1]] += 1\\n    t = t * 10 % MOD\\n\\nans = 0\\nfor i in range(MOD):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nl[0] = 1\\n\\ntmp = 0\\nz = 1\\n\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tz = z*10%2019\\n\\tl[tmp%2019] += 1\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\n\\nprint(ans)\", \"\\ndef solve():\\n    s=input().split()[0]\\n    cnt=[0]*2020\\n    cnt[0]=1\\n    m=0\\n    t=1\\n    for d in map(int,s[-1::-1]) :\\n        m=(m+d*t)%2019\\n        t=(t*10)%2019\\n        cnt[m]+=1\\n    return sum([ k*(k-1)//2 for k in cnt])\\n\\nprint((solve()))\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import Counter\\ndef main():\\n    s = input()\\n    n = len(s)\\n\\n    amari = [0] * n\\n    ketaamari = 1\\n    t = 0\\n    for i1 in range(n):\\n        t = (t + ketaamari * int(s[-i1 -1])) % 2019\\n        amari[-i1-1] = t\\n        ketaamari = (ketaamari * 10) % 2019\\n    amari.append(0)\\n    ac = Counter(amari)\\n    r = 0\\n    for v in ac.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\n\\nS=input()\\n\\nrlist=[0]\\nfor i in range(len(S)):\\n  rlist.append((rlist[-1]+int(S[-i-1])*pow(10,i,2019))%2019)\\n  \\nc = Counter(rlist)\\nc[0] -= 1\\n\\ndef nC2(n):\\n  return n*(n-1)//2\\n  \\nans = c[0]\\nfor k in c.keys():\\n  if c[k] >= 2:\\n    ans += nC2(c[k])\\n    \\nprint(ans)\", \"from collections import Counter\\n\\nS = input()\\n# S = \\\"12345\\\"*40000\\nN = len(S)\\n\\nl = [0]*(N+1)\\nfor i in range(N-1, -1, -1):\\n    l[i] = (l[i+1] + pow(10, N-i, 2019) * int(S[i])) % 2019\\n    # if i%10000 == 0:\\n    #     print(i)\\n\\n# print(list(Counter(l).values()))\\n\\nr = sum(m*(m-1)//2 for m in Counter(l).values())\\nprint(r)\", \"s = input()\\nt = s[::-1]\\nn = len(s)\\nresid = [0] * 2019\\nresid[0] = 1\\ncsum = 0\\npowoften = 1\\nfor i in range(n):\\n    csum = (csum + int(t[i]) * powoften) % 2019\\n    powoften = (10 * powoften) % 2019\\n    resid[csum] += 1\\nans = 0\\nfor i in range(2019):\\n    ans += resid[i] * (resid[i] - 1) // 2\\nprint(ans)\", \"s = input()\\nmod = 2019\\ndic = [0] * mod\\ndic[0] += 1\\n\\ntmp = 0\\nd = 1\\nfor i in reversed(range(len(s))):\\n    tmp += int(s[i]) * d\\n    tmp %= mod\\n    d *= 10\\n    d %= mod\\n    dic[tmp] += 1\\n\\nans = [i * (i-1) / 2 for i in dic]\\nprint(int(sum(ans)))\", \"s = input()\\n\\nl = len(s)\\nnum = 0\\ncount = 0\\ndic = {0: 1}\\nfor i in range(l - 1, -1, -1):\\n  num = (num + int(s[i]) * pow(10, l - i - 1, 2019)) % 2019\\n  #print(num)\\n  #print(r)\\n  if num not in dic:\\n    dic[num] = 1\\n  else:\\n    dic[num] += 1\\nfor ele in list(dic.values()):\\n  count += ele * (ele - 1) // 2\\nprint(count)\\n\", \"from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf\\nfrom itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement\\nfrom collections import deque,defaultdict,Counter\\nfrom bisect import bisect_left,bisect_right\\nfrom operator import itemgetter\\nfrom heapq import heapify,heappop,heappush\\nfrom queue import Queue,LifoQueue,PriorityQueue\\nfrom copy import deepcopy\\nfrom time import time\\nfrom functools import reduce, lru_cache\\nimport string\\nimport sys\\nsys.setrecursionlimit(10 ** 7)\\ndef input() : return sys.stdin.readline().strip()\\ndef INT()   : return int(input())\\ndef MAP()   : return map(int,input().split())\\ndef MAP1()  : return map(lambda x:int(x)-1,input().split())\\ndef LIST()  : return list(MAP())\\ndef LIST1() : return list(MAP1())\\n\\ns = input()\\n\\n@lru_cache(None)\\ndef F(s, k):\\n    # s\\u306e\\u5de6\\u304b\\u3089k\\u6587\\u5b57\\u76ee\\u4ee5\\u964d\\u3092\\u6574\\u6570\\u3068\\u898b\\u306a\\u3057\\u305f\\u3068\\u304d\\u3001\\n    # 2019\\u3067\\u5272\\u3063\\u305f\\u4f59\\u308a\\u3092\\u8fd4\\u3059\\n    if k == len(s)-1:\\n        return int(s[k])\\n    ret = F(s, k+1) + int(s[k])*pow(10, len(s)-1-k, 2019)\\n    ret %= 2019\\n    return ret\\n\\na = [0]*2020\\nfor i in range(len(s)):\\n    a[F(s, i)] += 1\\n\\nans = a[0]\\nfor i in range(2020):\\n    ans += a[i] * (a[i]-1) // 2\\n\\nprint(ans)\", \"S=input()\\nMOD=2019\\ndp=[0]*MOD\\ndp[0]=1\\nr=0\\nt=1\\nfor c in reversed(S):\\n    r+=int(c)*t\\n    r%=MOD\\n    t*=10\\n    t%=MOD\\n    dp[r]+=1\\nprint(sum(i*(i-1)//2 for i in dp))\", \"S = input()\\ndp = [0]*(len(S)+1)\\ncur = int(S[len(S)-1])\\nmod_10 = 1\\ncount_num = [0]*2019\\ncount_num[0] += 1\\nfor i in range(len(S)):\\n    dp[len(S)-i-1] = cur\\n    count_num[cur] += 1\\n    mod_10 = (mod_10*10)%2019\\n    if i <= len(S)-2:\\n        cur = (cur+int(S[len(S)-i-2])*(mod_10))%2019\\nans = 0\\nfor i in range(2019):\\n    ans += (count_num[i]*(count_num[i]-1))//2\\nprint(ans)\\n\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in S[::-1]:\\n  s=(s+int(i)*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    # print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum + x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    # \\u5834\\u5408\\u5206\\u3051\\u306e\\u6570\\u3092\\u8db3\\u3057\\u5408\\u308f\\u305b\\u308b\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num - 1)) // 2  # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import collections\\n\\ns=list(input())\\na=[0]\\n\\ns.reverse()\\n\\nmod=2019\\n\\nmod10=1\\n\\nfor i in range(len(s)):\\n  x=int(s[i])\\n  y=a[-1]\\n  ans=(x*mod10+y)%mod\\n  a.append(ans)\\n  mod10=(mod10*10)%mod\\n  \\nans1=0\\n\\nc = collections.Counter(a)\\nd=list(c.values())\\n\\nfor r in d:\\n  if r>=2:\\n    ans1+=(r*(r-1))//2\\n    \\nprint(ans1)\", \"s = input()\\ns = s[::-1]\\n\\nL = [0]\\ncnt = 1\\nfor i in range(len(s)):\\n    L.append((L[-1]+(int(s[i])*cnt))%2019)\\n    cnt *= 10\\n    cnt %= 2019\\n\\nD = dict()\\nfor j in L:\\n    if j in D:\\n        D[j] += 1\\n    else:\\n        D[j] = 1\\nans = 0\\nfor k in D.values():\\n    ans += k * (k-1) //2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\ncnts=[0]*2019\\ncnts[0]=1\\nnum=0\\nfor i in range(n):\\n  num+=int(s[i])*pow(10,i,2019)\\n  num%=2019\\n  cnts[num]+=1\\n\\nans=0\\nfor cnt in cnts:\\n  ans+=cnt*(cnt-1)//2\\n  \\nprint(ans)\\n\", \"s = list(input())\\n\\nMOD = 2019\\n\\ntemp = 0\\nd = 1\\n\\nm = [0] * MOD\\nm[0] = 1\\n\\nfor x in reversed(s):\\n    temp += int(x) * d\\n    temp %= MOD\\n    m[temp] += 1\\n    d = (d * 10) % MOD\\n\\nans = 0\\nfor x in m:\\n    ans += x * (x-1) // 2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\np=2019\\nS=[0 for i in range(n+1)]\\nans=[0]*p\\n\\nx10=1\\nfor j, i in enumerate(s):\\n  S[j+1]=(S[j]+(x10*int(i)))%p\\n  x10*=10\\n  x10%=p\\n  ans[S[j+1]]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\n\\nmod = 2019\\ncnt = [0] * 2019\\ncur = 0  # \\u73fe\\u5728\\u691c\\u8a0e\\u4e2d\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\ncnt[cur] = 1\\nd = 1   # \\u6841\\n\\nfor s in S[::-1]:\\n    cur += int(s) * d\\n    cur %= mod\\n    cnt[cur] += 1\\n    d *= 10\\n    d %= mod\\n\\nans = 0\\nfor c in cnt:\\n    ans += c * (c-1) // 2\\n\\nprint(ans)\", \"#!/usr/bin/env python3\\ndef main():\\n    S = input()[::-1]\\n\\n    counts = [0] * 2019\\n    counts[0] = 1\\n    res, digit = 0, 1\\n    for i in S:\\n        res += int(i) * digit\\n        res %= 2019\\n        digit *= 10\\n        digit %= 2019\\n        counts[res] += 1\\n\\n    ans = 0\\n    for i in counts:\\n        ans += i * (i - 1) // 2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nn = len(s)\\nmod = 2019\\n\\nt = [0]*n\\ndp = [0]*2020\\nt[0] = int(s[-1])\\ndp[t[0]] += 1\\nfor i in range(n-1):\\n    t[i+1] = t[i] + int(s[-2-i])*pow(10, i+1, mod)\\n    t[i+1] %= mod\\n    dp[t[i+1]] += 1\\nans = 0\\nfor D in dp[1:]:\\n    ans += D*(D-1)//2\\nprint((ans+(dp[0]+1)*(dp[0])//2))\\n\\n\\n\", \"#!/usr/bin/env python3\\nimport sys\\nimport numpy as np\\n\\ninput = sys.stdin.readline\\n\\n\\ndef ST():\\n    return input().rstrip()\\n\\n\\ndef I():\\n    return int(input())\\n\\n\\ndef MI():\\n    return list(map(int, input().split()))\\n\\n\\ndef LI():\\n    return list(MI())\\n\\n\\nS = ST()\\n\\ncnt = np.zeros(2019)\\ncnt[0] = 1\\nres = 0\\ntmp = 1\\nfor s in S[::-1]:\\n    res += int(s) * tmp\\n    res %= 2019\\n    cnt[res] += 1\\n    tmp *= 10\\n    tmp %= 2019\\n\\nans = 0\\nfor c in cnt[cnt >= 2]:\\n    ans += c * (c - 1) // 2\\n\\nprint((int(ans)))\\n\", \"def main():\\n    import collections\\n\\n    S = input()\\n\\n    mod_list = [0]\\n\\n    for i in range(len(S)):\\n        index = len(S) - i - 1\\n        num = int(S[index])\\n\\n        mod_list.append((mod_list[-1] + num * pow(10, i, 2019)) % 2019)\\n\\n    CTR_mod_list = collections.Counter(mod_list).most_common()\\n    cnt = 0\\n\\n    for i in range(len(CTR_mod_list)):\\n        n = CTR_mod_list[i][1]\\n\\n        if (n == 1):\\n            break\\n\\n        cnt += n * (n - 1) // 2\\n\\n    print(cnt)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"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\\n# \\u7d2f\\u7a4d\\u548c\\u306e\\u66f8\\u304d\\u65b9\\u304c\\u3088\\u304f\\u306a\\u3044\\u3084\\u3064\\ndef main():\\n  s=S()\\n  n=len(s)\\n\\n  l=[]\\n  mul=1\\n  for x in s[::-1]:\\n    l.append(mul*int(x)%2019)\\n    mul*=10\\n    mul%=2019\\n\\n  for i in range(n-1):\\n    l[i+1]+=l[i]\\n    l[i+1]%=2019\\n\\n  sl=summarizeList(l)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    if x==0:\\n      ans+=c\\n    if c>1:\\n      ans+=c*(c-1)//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Mon Sep  7 00:38:11 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n\\uff1cD - Multiple of 2019>\\n\\u3010\\u65b9\\u91dd\\u3011\\na = b(mod2019) => a - b \\u306f\\u30002019\\u306e\\u500d\\u6570\\n\\u4f59\\u308a\\u304c\\u7b49\\u3057\\u3044\\u30b0\\u30eb\\u30fc\\u30d7\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u306e\\u7dcf\\u6570\\u304c\\u89e3\\u306b\\u306a\\u308b\\u3002\\n\\u65e2\\u306b2019\\u306e\\u500d\\u6570\\u3067\\u3042\\u308b\\u3082\\u306e\\u306f\\u5358\\u4f53\\u3067\\u6210\\u7acb\\u3059\\u308b\\u305f\\u3081\\u3001[0]\\u306e\\u30ab\\u30a6\\u30f3\\u30c8\\u3092\\u4e00\\u3064\\u3042\\u3052\\u3066\\u304a\\u304f\\n\\n\\n\\uff1c\\u7d2f\\u7a4d\\u548c\\uff1e\\n\\u3010\\u8a08\\u7b97\\u91cf\\u524a\\u6e1b\\u3011\\n\\u5927\\u304d\\u306a\\u6570\\u3092\\u4f7f\\u308f\\u306a\\u3044\\u3000\\u21d2\\u3000mod \\u3092\\u4f7f\\u3046\\ntmp += 7 * 100000000  => 7 * ( 2019*N + \\u03b1) => 7 * \\u03b1\\u3000\\u3068\\u540c\\u3058\\n\\u3000\\u3000\\u21d2\\u3000\\u7d2f\\u4e57(10**N) \\u306b  mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n\\n100000000 + \\u03b3 => (2019*N + \\u03b2) + \\u03b3 => \\u03b2 + \\u03b3 \\u3068\\u540c\\u3058\\n\\u3000\\u21d2\\u3000\\u7d2f\\u7a4d\\u548c\\u3000\\u306b\\u3000mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n \\n for\\u6587\\u3067\\uff11\\u6587\\u5b57\\u305a\\u3064\\u8db3\\u3057\\u7b97\\u3057\\u3066\\u3044\\u304f\\u3053\\u3068\\u3067\\u5b9f\\u88c5\\u53ef\\u80fd\\n \\n reversed() : \\u9006\\u9806\\u306b\\u4e26\\u3079\\u66ff\\u3048\\n reversed(input()) : \\u5165\\u529b\\u3092\\u9006\\u9806\\u306b\\u53d6\\u308a\\u51fa\\u3059\\n \\n\\\"\\\"\\\"\\nS = input()\\n\\nMOD = 2019 \\n\\ncounter = [0] * 2019\\ncounter[0] = 1\\nt = 1\\ntmp = 0\\nfor i in reversed(S):\\n    tmp += int(i)*t\\n    tmp %= MOD #\\u7d2f\\u7a4d\\u548c\\u3092\\u52b9\\u7387\\u5316\\n    t *= 10\\n    t %= MOD   #\\u7d2f\\u4e57\\u3092\\u52b9\\u7387\\u5316 \\n    #print(tmp)\\n    counter[tmp] += 1\\n\\nans = sum( i*(i-1)//2 for i in counter)\\nprint(ans)\", \"s = list(input())\\n# s = list(str(10**200000))\\nn = len(s)\\nans = 0\\ns.reverse()\\n# print(s)\\nx = 1\\ntot = 0\\ncount = [0]*2019\\nfor i in range(n):\\n    count[tot]+=1\\n    tot += int(s[i])*x\\n    # print(tot)\\n    tot %= 2019\\n    ans += count[tot]\\n    x = x*10%2019\\nprint(ans)\", \"S = input()[::-1]\\nans = 0\\nmods = [0] * 2019\\nmods[0] = 1\\ncurrent = 0\\nx = 1\\nfor s in S:\\n  current = (current + x * int(s)) % 2019\\n  ans += mods[current % 2019]\\n  mods[current % 2019] += 1\\n  x = x * 10 % 2019\\nprint(ans)\", \"s = list(map(int,input()))\\ns.reverse()\\nt = len(s)\\nmod = 2019\\n\\narr = [0] * (t+1)\\narr[-2] = s[0]\\nfor i in range(1,t):\\n    arr[t-i-1] = (arr[t-i] + s[i]*pow(10,i,mod)) % mod\\n\\nfrom collections import Counter\\narr = Counter(arr)\\n\\nans = 0\\nfor i in arr:\\n    ans += (arr[i] - 1) * arr[i] // 2\\n\\nprint(ans)\", \"import sys\\nimport heapq\\nimport math\\nimport fractions\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\nfrom collections import deque\\nfrom operator import itemgetter\\ndef input(): return sys.stdin.readline().strip()\\ndef mp(): return map(int,input().split())\\ndef lmp(): return list(map(int,input().split()))\\n\\ns=input()[::-1]\\nn=len(s)\\na=[0]*2019\\na[0]=1\\nc,d=0,1\\nfor i in s:\\n    c+=int(i)*d\\n    c%=2019\\n    d*=10\\n    d%=2019\\n    a[c]+=1\\nans=0\\nfor i in a:\\n    ans+=i*(i-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()[::-1]\\nMOD = 2019\\nX = [0]\\nfor i,s in enumerate(S):\\n    X.append((X[-1]+int(s)*pow(10,i,MOD))%MOD)\\nC = Counter(X)\\nprint(sum([v*(v-1)//2 for v in C.values()]))\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in range(1,n+1):\\n  s=(s+int(S[-i])*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"n = input()\\np = 2019\\nt = 1\\ny = 0\\nc = p*[0]\\n\\nfor x in map(int,n[::-1]):\\n  y+=t*x\\n  y%=p\\n  c[y]+=1\\n  t*=10\\n  t%=p\\n\\nprint(sum(i*(i-1)//2 for i in c)+c[0])\", \"def main():\\n    def modpow(x, n, mod):\\n        res = 1\\n        while n:\\n            if n % 2:\\n                res *= x % mod\\n            x *= x % mod\\n            n >>= 1\\n        return res\\n\\n    s = input()\\n    s = s[::-1]\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in range(s_len):\\n        rev_num += int(s[i]) * int(modpow(10, i, mod))\\n        rev_num %= mod\\n        d[rev_num] += 1\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S = input()\\ns_rev = S[::-1]\\n\\nr_list = [0] * 2019\\nr_list[0] = 1\\nnum, d = 0, 1\\nfor i in range(len(S)):\\n    num += d*int(s_rev[i])\\n    num %= 2019\\n    r_list[num] += 1\\n    d *= 10\\n    d %= 2019\\n\\nans = 0\\nfor i in range(2019):\\n        ans += r_list[i]*(r_list[i]-1)//2\\n\\nprint(ans)\\n\", \"s=input()\\np=2019\\nans=0\\nM=[0]*p\\nM[0]=1\\ntmp=0\\nfor i in range(len(s)):\\n    tmp+=(int(s[-i-1])*pow(10,i,p))\\n    tmp%=p\\n    ans+=M[tmp]\\n    M[tmp]+=1\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common()[::-1]:\\n#  if k > 1 and k%2 == 0:\\n#    ans += n\\n#  else:break\\n#print(ans)\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#https://mirucacule.hatenablog.com/entry/2020/04/27/090908\\n#https://drken1215.hatenablog.com/entry/2020/04/29/171300\\n\\nS=str(input())[::-1]#\\u9006\\u9806\\u3067\\u683c\\u7d0d\\nN=len(S)\\ncounter=[0]*2019\\ncounter[0]=1\\nans=0\\nnum,d=0,1\\nfor c in S:\\n    num += int(c) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counter[num]+=1\\nfor i in counter:\\n    ans += i*(i-1)//2\\nprint(ans)\", \"from collections import defaultdict\\n\\nS = input()\\n\\nd = defaultdict(int)\\n\\nd[0] += 1\\n\\nmod = 0\\nR = 1\\nfor i in range(len(S)):\\n    mod = (mod + R * int(S[len(S) - i - 1])) % 2019\\n    R = R * 10 % 2019\\n    d[mod] += 1\\nans = 0\\nfor i in list(d.values()):\\n    if i > 1:\\n        ans += i * (i - 1) / 2\\n\\nprint((int(ans)))\\n\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"S = input()\\nmod = 2019\\n\\narray = []\\nfor i in range(len(S)):\\n    x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod\\n    array.append(x)\\narray2 = [0]\\ny = 0\\nfor i in range(len(S)):\\n    y = (y+array[i])%mod\\n    array2.append(y)\\narray3 = [0] * 2019\\nans = 0\\nfor i in range(len(array2)):\\n    z = array2[i]\\n    ans += array3[z]\\n    array3[z] += 1\\nprint(ans)\\n#3*673\\n\", \"s=input()\\nn=len(s)\\nrui=[0]\\njuu=[1]\\nfor i in range(n+5):\\n  juu.append(juu[-1]*10%2019)  \\nfor i in range(n):\\n  rui.append((rui[-1]+int(s[n-1-i])*juu[i])%2019)\\nama=[0]*2019\\nfor i in range(len(rui)):\\n  ama[rui[i]]+=1\\nans=0\\ndef ui(n):\\n  return max(0,n*(n-1)//2)\\nfor i in range(2019):\\n  ans+=ui(ama[i])\\nprint(ans)  \", \"def MultipleOf2019():\\n    S = input()\\n    s = int(S)\\n    num, mod, ans = len(S), 2019, 0\\n    c = [0 for _ in range(num+1)]\\n    d = [0 for _ in range(mod)]\\n    d[0] = 1\\n    s = int(S)\\n    \\n    for i in range(num):\\n        c[i+1] = (c[i]+int(S[-i-1])*pow(10, i, mod))%mod\\n        d[c[i+1]] += 1\\n\\n    for i in range(mod):\\n        ans += d[i]*(d[i]-1)//2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    MultipleOf2019()\\n    \\n\\n__starting_point()\", \"S = input()\\nN = len(S)\\n \\ncounter = [0] * 2019\\ncounter[0] = 1\\nT = 0\\nR = 1\\nfor i in range(N):\\n    T = (T + R * int(S[N - i - 1])) % 2019\\n    R = 10 * R % 2019\\n    counter[T] += 1\\n \\nans = 0\\nfor i in range(2019):\\n    m = counter[i]\\n    ans += m * (m - 1) // 2\\n \\nprint(ans)\", \"def inN():\\n    return int(input())\\ndef inL():\\n    return list(map(int,input().split()))\\ndef inNL(n):\\n    return [list(map(int,input().split())) for i in range(n)]\\n\\ns = input()\\nn = int(s)\\nl = len(s)\\ncnt = 0\\nmod = [0]*2019\\nm = 0\\nfor i in range(l):\\n    m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019\\n    mod[m] += 1\\n\\ncnt += mod[0]\\n\\nfor i in range(2019):\\n    if mod[i] > 1:\\n        cnt += (mod[i]*(mod[i]-1))/2\\n        #print(i)\\nprint((int(cnt)))\\n\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nA = [0]\\nfor i, s in enumerate(S[::-1]):\\n    A.append((A[-1] + s * pow(10, i, 2019)) % 2019)\\nprint((sum([v * (v - 1) // 2 for v in list(Counter(A).values())])))\\n\", \"S = reversed(input())\\nresiduelist = [0]\\npower = 1\\nresidue = 0\\nfor i in S:\\n    digit = int(i)\\n    residue = (residue+power*digit)%2019\\n    residuelist.append(residue)\\n    power = (power*10)%2019\\nfrom collections import Counter\\nval = Counter(residuelist).values()\\nans = 0\\nfor j in val:\\n    ans += j*(j-1)//2\\nprint(ans)\", \"# coding: utf-8\\n# Your code here!\\n\\nS=list(input())\\nS=list(map(int,S))[::-1]\\n\\n\\nmod=[0]*2019\\nmod[0]+=1\\n\\nans=0\\ntemp=0\\np=1\\nfor i in range(len(S)):\\n    temp+=S[i]*p\\n    p=p*10%2019\\n    temp%=2019\\n    ans+=mod[temp]\\n    mod[temp]+=1\\n\\nprint(ans)\\n\", \"s=input()\\n\\ns=s[::-1]\\n\\ncounts = [0] * 2019\\ncounts[0] = 1\\n\\nnum=0\\nd = 1\\n\\n\\nfor char in s:\\n    num += int(char) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counts[num] += 1\\n    \\nans = 0\\nfor cnt in counts:\\n    ans += cnt * (cnt - 1) // 2\\n\\nprint(ans) # \\u7b54\\u3048\\u306e\\u51fa\\u529b   \\n\\n\", \"from collections import Counter\\ns = input()\\n\\nls = len(s)\\nt = [0]\\nj = 1\\nfor i in range(ls):\\n    u = (int(s[ls-1-i])*j + t[-1]) % 2019\\n    t.append(u)\\n    j = (j * 10) % 2019\\nc = Counter(t)\\nk = list(c.keys())\\nans = 0\\nfor i in k:\\n    ans += c[i]*(c[i]-1)/2\\nprint(int(ans))\", \"from collections import Counter\\nimport sys\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nmod = 2019\\n\\n\\ns = readline().decode().rstrip()\\ns = s[::-1]\\nn = len(s)\\nd = [0] * (n)\\nd[0] = int(s[0]) % mod\\n\\nfor i in range(1, n):\\n    d[i] = (d[i - 1] + int(s[i]) * pow(10, i, mod)) % mod\\n\\nd = [0] + d\\n\\nc = Counter(d)\\nans = 0\\nfor v in c.values():\\n    ans += v * (v - 1) // 2\\nprint(ans)\", \"def main():\\n  n, mods = 0, [1]+[0]*2019\\n  d = 1\\n  for i in reversed(input()):\\n    n = (n+int(i)*d)%2019\\n    d = d*10%2019\\n    mods[n] += 1\\n  print(sum([i*(i-1)//2 for i in mods]))\\nmain()\", \"S=input()\\ns=int(S)\\nmod=2019\\nc=[0]*(len(S)+1)\\nd=[0]*2019\\n\\n\\nc[0]=0\\nd[0]=1\\nfor i in range(len(S)):\\n  c[i+1]=(c[i]+int(S[-i-1])*pow(10,i,mod))%mod\\n  d[c[i+1]]+=1\\n  \\nm=0\\nfor i in range(2019):\\n  m+=d[i]*(d[i]-1)//2\\n\\nprint(m)\", \"# -*- coding: utf-8 -*-\\n\\nS = input().strip()\\n#-----\\nnum = 0\\ncnt_mod = {0:1}  # type {int: int} , contents {remainder : count}\\nmod = 2019\\nbase_pow = 1\\n\\nfor i in range(len(S)):\\n    digit = int( S[len(S)-1-i] )\\n    \\n    num += (digit * base_pow) % mod\\n    num %= mod\\n    \\n    base_pow = (base_pow * 10) % mod\\n    \\n    cnt_mod.setdefault(num, 0)\\n    cnt_mod[num] += 1\\n\\n\\nans = 0\\n\\nfor r,c in list(cnt_mod.items()):\\n    # r: remainder\\n    # c: count\\n    if c >= 2:\\n        ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\n# pow(a,b,c)\\u306f\\u666e\\u901a\\u306bMOD\\u3059\\u308b\\u3088\\u308a\\u901f\\u3044\\n# \\u666e\\u901a\\u306b\\u3084\\u3063\\u305f\\u3089TLE\\u3060\\u3063\\u305f\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN = list(input())\\nM = [0]\\nS = 0\\nK = 1\\nans = 0\\n\\nfor i in range(len(N)):\\n    S += int(N[-i-1])*K\\n    S %= 2019\\n\\n    K *= 10\\n    K %= 2019\\n    M.append(S)\\n\\nP = Counter(M)\\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\\nprint(ans)\\n\", \"import sys\\nimport collections\\n\\n\\ndef resolve(in_):\\n    s = next(in_).strip()\\n    mod = 2019\\n    dp = [0] * (len(s) + 1)\\n    ch0 = ord(b'0')\\n    for i, b in enumerate(reversed(s), 1):\\n        dp[i] = (dp[i - 1] + (b - ch0) * pow(10, i, mod)) % mod\\n\\n    return sum(v * (v - 1) // 2 for v in list(collections.Counter(dp).values()))\\n\\n\\ndef main():\\n    answer = resolve(sys.stdin.buffer)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#import numpy as np\\n#import math\\n#from decimal import *\\n#from numba import njit\\nfrom collections import Counter\\n\\n#@njit\\ndef main():\\n    S = input()\\n    A = list(map(int, S))[::-1]\\n    mod = []\\n    ten = 10\\n    for i in range(len(A)):\\n        if i == 0:\\n            mod += A[i],\\n        else:\\n            mod += (mod[i-1]+ten*A[i])%2019,\\n            ten = (ten*10)%2019\\n    mod += 0,\\n\\n    C = Counter(mod)\\n    print(sum([c*(c-1)//2 for c in C.values()]))\\n\\nmain()\", \"S = input()\\n\\ncs = [0]\\nr = 1\\nfor c in S[::-1]:\\n    cs.append((cs[-1] + r*int(c)) % 2019)\\n    r *= 10\\n    r %= 2019\\n\\nfrom collections import Counter\\nctr = Counter(cs)\\nans = 0\\nfor v in ctr.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [-1] * len(S)\\nr = 0\\nd = 1\\nfor i,s in enumerate(S[::-1]):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[i] = r\\n\\nans = 0\\nc = Counter(p)\\nfor k,n in c.most_common():\\n  if n > 1:\\n    ans += n*(n-1)//2\\n  else:break\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"def main():\\n    s = input()\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    t = 1\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in reversed(s):\\n        rev_num += int(i) * t\\n        rev_num %= mod\\n        d[rev_num] += 1\\n        t *= 10\\n        t %= mod\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ns=input()\\nn=len(s)\\nans=0\\narr=[0]*(n+1)\\nif s=='0':\\n    print(1)\\n    return\\nelif n==1:\\n    print(0)\\n    return\\nfor i in reversed(range(n)):\\n    arr[i]=(arr[i+1]+int(s[i])*pow(10,n-i-1,2019))%2019\\nm=Counter(arr)\\nfor j in m.keys():\\n    ans+=m[j]*(m[j]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"s = input()\\n\\nlen_s = len(s)\\n\\ncurrent = 0\\nmod_dict = dict()\\nmod_dict[0] = 1\\nfor i in range(len_s-1,-1,-1):\\n    c = s[i]\\n    current = (current+pow(10,len_s-i-1,2019)*int(c)) % 2019\\n    if current in mod_dict:\\n        mod_dict[current] += 1\\n    else:\\n        mod_dict[current] = 1\\n\\ncount = 0\\nfor key in mod_dict:\\n    count+= (mod_dict[key]*(mod_dict[key]-1))//2\\n\\nprint(count)\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nfrom collections import deque\\nfrom collections import defaultdict\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\nMOD2 = 998244353\\nINF = float('inf')\\ninput = lambda: sys.stdin.readline().strip()\\n\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\ndef combinations_count(n, r):\\n    if n == 1:\\n        return 0\\n    else:\\n        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\ndef main():\\n    S = SI()\\n    \\n    ls = []\\n    len_S = len(S)\\n    rem = 0\\n\\n    for s in range(len_S-1,-1,-1):\\n        rem = (rem+int(S[s])* pow(10, len_S-s-1, 2019))%2019\\n        ls.append(rem)\\n    \\n    import collections\\n\\n    cls = collections.Counter(ls)\\n    clsv= list(cls.values())\\n\\n    ans = 0\\n\\n    for p in clsv:\\n        ans += combinations_count(p,2)\\n    ans += cls[0]\\n    print(ans)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ndef main():\\n    S = input()\\n    A = [0] * ((n := len(S)) + 1)\\n    A[1] = (a := int(S[-1])) % 2019\\n    for i in range(2, n + 1):\\n        a += pow(10, i - 1, 2019) * int(S[-i])\\n        A[i] = a % 2019\\n    c = Counter(A)\\n    ans = 0\\n    for v in list(c.values()):\\n        ans += v * (v - 1) // 2\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = str(input())\\nMOD = 2019\\nm = 0\\ndigit = 1\\nmods = [1] + [0] * 2018\\nfor a in s[::-1]:\\n    m = (m + digit * int(a)) % MOD\\n    mods[m] += 1\\n    digit = digit * 10 % MOD\\nans = 0\\nfor x in mods:\\n    ans += x * (x - 1) // 2\\nprint(ans)\", \"from collections import Counter\\n\\ns = input()\\nn = len(s)\\ndigits = [int(c) for c in s[::-1]]\\na = [0] * (n + 1)\\np = 2019\\n\\nfor i, digit in enumerate(digits):\\n    a[i + 1] = (digit * pow(10, i, p) + a[i]) % p\\n\\ncounter = Counter(a)\\nans = 0\\nfor count in counter.values():\\n    ans += count * (count - 1) // 2\\n\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Sun Sep  6 23:39:24 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n#from scipy.special import comb\\n\\ncounter = [0]*2019\\ncounter[0] = 1 # 0 = 0 (mod 2019)\\n\\nS = input()\\ntmp = 0\\n\\\"\\\"\\\"\\n#\\u5927\\u304d\\u3044\\u6570\\u3092\\u4e00\\u6c17\\u306b\\u639b\\u3051\\u306a\\u3044\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*10**(i-1)    #\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u65b9\\u304c\\u65e9\\u3044\\uff08\\u3051\\u3069\\u3001\\u6f38\\u5316\\u5f0f\\u7684\\u306b\\u7d2f\\u7a4d\\u548c\\u3092\\u51fa\\u305b\\uff09\\n    #print(tmp%2019)\\n    tmp %= 2019                    #\\u5927\\u304d\\u3044\\u6570\\u3092\\u5272\\u308b\\u306a\\n    counter[tmp%2019] += 1\\n\\nans = 0\\nfor i in range(2019):\\n    if counter[i] >= 2:\\n        #ans += comb(counter[i], 2, exact=True)\\n        ans += counter[i]*(counter[i]-1)//2\\nprint(ans)\\n\\\"\\\"\\\"\\nMOD = 2019\\n#reversed(s) ?\\nt = 1\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*t\\n    #print(\\\"A\\\", tmp)\\n    tmp %= MOD \\n    t *= 10\\n    #print(\\\"B\\\", tmp)\\n    t %= MOD\\n    #print(tmp)\\n    counter[tmp] += 1\\n    \\nprint((sum(i*(i-1)//2 for i in counter)))\\n\", \"S = list(map(int, list(input())))\\n\\npops = 0\\ndigi = 1\\ncnt = [0] * 2019\\ncnt[0] = 1\\n\\nwhile S:\\n    s = S.pop()\\n\\n    pops = (pops + s * digi) % 2019\\n    digi = (10 * digi) % 2019\\n\\n    cnt[pops] += 1\\n\\nans = 0\\n\\nfor i in range(2019):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\", \"S = str(input())\\nN = len(S)\\nb = [0] * 2019\\ncount = 0\\nb[0] = 1\\nt = 0\\nk = 1\\n\\nif len(S) < 4:\\n    print(0)\\nelse:\\n    t = int(S[-1])\\n    b[t] += 1\\n    for i in range(1,N):\\n        k = k * 10 % 2019\\n        t = (k * int(S[-i-1]) + t) % 2019 \\n        b[t] += 1\\n\\n    for i in b:\\n        count += i*(i-1)//2\\n\\n    print(count)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nz = 1\\ntmp = 0\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tl[tmp%2019] += 1\\n\\tz = z*10%2019\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\nans += l[0]\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nC = Counter()\\nMOD = 2019\\n\\nn = 0\\nfor i, s in enumerate(S[::-1]):\\n    s = int(s)\\n    n += pow(10, i, MOD) * s % MOD\\n    C[n % MOD] += 1\\n\\nC[0] += 1\\nans = 0\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"s=[int(x) for x in reversed(list(input()))]\\nn=len(s)\\nx=[0]*2019\\ndp = 0\\ndim = 1\\nfor si in s:\\n  dp = (dp + si*dim) % 2019\\n  x[dp] += 1\\n  dim = dim * 10 % 2019\\nans = x[0]\\nfor i in range(2019):\\n  ans += x[i]*(x[i]-1)//2\\nprint(ans)\", \"S = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    #print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum+x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num-1)) // 2   # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for i1 in range(1, lens+1):\\n        ss += (int(s[-i1]) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"s=input()[::-1]\\np=2019\\nans=[0]*p\\n\\nx10, S=1, 0\\nfor i in s:\\n  S+=x10*int(i)\\n  S%=p\\n  x10*=10\\n  x10%=p\\n  ans[S]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\nmod = 2019\\n\\nt = len(S)\\nl = [0] * (t + 1)\\nfor i in range(t-1, -1, -1):\\n    l[i] = (l[i+1] + int(S[i]) * pow(10, t-i-1, mod)) % mod\\n\\nfrom collections import Counter\\n\\ndef nC2(n):\\n    return n * (n - 1) // 2\\n\\nl = list(Counter(l).values())\\n\\nans = 0\\nfor i in l:\\n    ans += nC2(i)\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nP = [0] * (len(S)+1)\\nmod = 2019\\nd = 1\\nfor i in range(len(S), 0, -1):\\n    P[i-1] = int(S[i-1])*d + P[i]\\n    P[i-1] = P[i-1] % mod\\n    d *= 10\\n    d = d % mod\\n\\nP = Counter(P)\\nans = 0\\nfor p in P.values():\\n    ans += p*(p-1)//2\\nprint(ans)\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for se in s[::-1]:\\n        ss += (int(se) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S=input()\\nN=len(S)\\n\\nT=[0]\\nfor i in range(N):\\n    p = int(S[-1-i])\\n    T.append( (T[-1]+ pow(10,i,2019)*p)%2019 )\\n    \\nfrom collections import Counter\\nans=0\\nU=dict(Counter(T))\\nfor num in U:\\n    ans += U[num]*(U[num]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nMOD = 2019\\n\\nacc_mod = [0]\\nfor i, s in enumerate(S[::-1]):\\n    acc_mod.append((acc_mod[-1] + s * pow(10, i, MOD)) % MOD)\\n\\nans = 0\\nfor v in list(Counter(acc_mod).values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"from itertools import accumulate\\nfrom collections import Counter\\n\\n\\ndef solve(n):\\n    return n * (n - 1) // 2\\n\\n\\ns = input()[::-1]\\nMOD = 2019\\n\\n# \\u4e8b\\u524d\\u8a08\\u7b97\\nrest = []\\nfor i, x in enumerate(s):\\n    # 1, 10, 100, 1000...\\u306e\\u5270\\u4f59\\u3092\\u9806\\u306b\\u8a08\\u7b97\\u3057\\u3001\\u5404\\u6841\\u307e\\u3067\\u306e\\u5270\\u4f59\\u3092\\u8a08\\u7b97\\n    if i == 0:\\n        tmp = 1\\n    else:\\n        tmp = tmp * 10 % MOD\\n    rest.append(int(x) * tmp % MOD)\\n\\nresult = [x % MOD for x in list(accumulate(rest))]\\n\\n# 0\\u306f\\u5358\\u72ec\\u30672019\\u306e\\u500d\\u6570\\nzero = result.count(0)\\n\\n# \\u4ed6\\u306f\\u30b3\\u30f3\\u30d3\\u30cd\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7d50\\u679c\\nc = Counter(result)\\nc = list(c.values())\\n\\n# \\u8db3\\u3057\\u3066\\u51fa\\u529b\\nprint(sum([solve(x) for x in c if x >= 2]) + zero)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = input()\\nn = len(S)\\ns = [0]\\nfor i, x in enumerate(S):\\n\\ts.append(int(S[i])*pow(10, n-i-1, 2019)%2019)\\n\\ntmp = 0\\nt = []\\nfor x in s:\\n\\ttmp = (tmp+x)%2019\\n\\tt.append(tmp)\\n\\nans = 0\\nfor v in Counter(t).values():\\n\\tans += v*(v-1)//2\\nprint(ans)\", \"MOD = 2019\\n\\\"\\\"\\\"\\ndef part_count(S):\\n  B = [0 for _ in range(MOD)]\\n  C = [0 for _ in range(MOD)]\\n  L = [0 for _ in range(MOD)]\\n  R = [0 for _ in range(MOD)]\\n  \\n  if len(S) == 1:\\n    s = S[0]\\n    B[s] = 1 \\n    return (B, L, R, C)\\n  S_L = S[:len(S)//2]\\n  S_R = S[len(S)//2:]\\n  \\n  B1, L1, R1, C1 = part_count(S_L)\\n  B2, L2, R2, C2 = part_count(S_R)\\n    \\n  for j in range(MOD):\\n    C[j] += C1[j] + C2[j]\\n    L[j] += L1[j]\\n    R[j] += R2[j]\\n    for i in range(MOD):\\n      B[j] += B1[i] * B2[(-i + j)%MOD]\\n      L[j] += B1[i] * L2[(-i + j)%MOD]\\n      R[j] += B2[i] * R1[(-i + j)%MOD]\\n      C[j] += R1[i] * L2[(-i + j)%MOD]\\n  \\n  return (B, L, R, C) #\\u4e21\\u5074\\u96a3\\u63a5\\u3001\\u5de6\\u96a3\\u63a5\\u3001\\u53f3\\u96a3\\u63a5\\u3001\\u96a3\\u63a5\\u306a\\u3057\\u306e\\u500b\\u6570\\n\\\"\\\"\\\"\\n\\nS = list(input())\\nS.reverse()\\nN = len(S)\\nS = [int(S[i]) for i in range(N)]\\nMOD = 2019\\n\\na = 1\\nfor i in range(N): \\n  S[i] *= a\\n  S[i] %= MOD\\n  a *= 10 \\n  a %= MOD\\n  \\n#B, L, R, C = part_count(S)\\n#print(B[0] + L[0] + R[0] + C[0])\\nT = [0 for _ in range(N+1)]\\nfor i in range(1,N+1):\\n  T[i] += S[i-1] + T[i-1]\\n  T[i] %= MOD\\n\\n#print(T)\\n\\nC = [0 for i in range(MOD)]  \\nfor i in range(N+1):\\n  C[T[i]] += 1\\n\\n#print(C)\\n\\nans = 0\\nfor i in range(MOD):\\n  ans += C[i]*(C[i]-1)//2\\n  \\nprint(ans)\\n\", \"s=input()\\nls=len(s)\\nm=[0]*(2019)\\nm[0]+=1\\n\\ncnt = 0\\nb = 0\\nfor i in range(ls):\\n  a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019\\n  m[a] += 1\\n  b = a\\n  cnt += 1\\n\\nans = 0\\nfor i in m:\\n  if i <= 1:\\n    continue\\n  ans += i*(i-1)//2\\n\\nprint(ans)\\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\\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  s=S()\\n  n=len(s)\\n  s=s[::-1]\\n\\n  rl=[0]*(n+1)\\n  for i,x in enumerate(s):\\n    rl[i+1]=(int(x)*pow(10,i,2019))%2019\\n\\n  for i in range(n):\\n    rl[i+1]+=rl[i]\\n    rl[i+1]%=2019\\n\\n\\n  sl=summarizeList(rl)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    ans+=(c*(c-1))//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"from itertools import accumulate\\n\\nS = input()\\n\\nR = [1]\\nfor _ in range(len(S)-1):\\n    R.append(R[-1]*10%2019)\\n\\nL = [int(s)*r for s, r in zip(reversed(S), R)]\\nZ = list(accumulate(L, func=lambda a, b: (a+b)%2019))\\n\\nT = [1]+[0]*2018\\nfor z in Z:\\n    T[z] += 1\\n\\nf = lambda n: n*(n-1)//2\\nprint(sum(f(t) for t in T))\", \"import sys\\nreadline = sys.stdin.readline\\n\\nS = readline().rstrip()\\nDIV = 2019\\n\\ncur = 0\\nfrom collections import defaultdict\\ndic = defaultdict(int)\\nfor i in range(len(S) - 1, -1, -1):\\n  cur += ((int(S[i]) % DIV) * pow(10, (len(S) - 1 - i), DIV)) % DIV\\n  cur %= DIV\\n  dic[cur] += 1\\n\\nans = 0\\n# 0\\u306f\\u5358\\u72ec\\u3067\\u3082\\u3088\\u3044\\nfor key, val in dic.items():\\n  if key == 0:\\n    ans += val\\n  ans += (val * (val - 1)) // 2\\n\\nprint(ans)\", \"# \\u89e3\\u8aacAC\\nimport math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\\n#from operator import itemgetter\\n#from heapq import heappush, heappop\\n#import numpy as np\\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\\n#from scipy.sparse import csr_matrix\\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\nmod = 10**9 + 7\\n\\nstdin = sys.stdin\\n\\nni = lambda: int(ns())\\nnf = lambda: float(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nnb = lambda: list(map(float, stdin.readline().split()))\\nns = lambda: stdin.readline().rstrip()  # ignore trailing spaces\\n\\nS = ns()\\nn = len(S)\\nT = [0] * (n+1)\\nd = {0: 1}\\nfor k in range(n-1, -1, -1):\\n    tmp = (T[k+1] + pow(10, n - k - 1, 2019) * int(S[k])) % 2019\\n    T[k] = tmp\\n    if tmp not in list(d.keys()):\\n        d[tmp] = 1\\n    else:\\n        d[tmp] += 1\\nans = 0\\nfor k, v in list(d.items()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"S=input()\\nS=list(reversed(S))\\n\\nm=2019\\ncnt=[0 for i in range(m)]\\n\\nlen_S=len(S)\\nx=1\\ntot=0\\nans=0\\n\\nfor i in range(len(S)):\\n    cnt[tot]+=1\\n    tot+=(ord(S[i])-ord('0'))*x\\n    tot %= m\\n    ans+=cnt[tot]\\n    x=x*10%m\\n\\nprint(ans)\"]",
        "difficulty": "interview",
        "input": "132446413264831972563175653113669719543926783841376958654156141935717787391449642187767186151819988114274337328977672214173388338471433491576839115688711932291857481948335139916724631818837271724226294774191199341793313325419927536824225976241164963333135161116258752981567665819413143699125881817111992861663656179691133859726852714839658358669852727429921427433777315196852573491659156712194766137762947742523754825411825176799524397743146175617827771193229194833525641311548682584321621257124774289441716232761554638499998237521633371987291995367389667664251123966618897844744651784796121745712235141455699896436629928417933121341918534427692398742273735151124583169596142541418554611932183115284912558183169831645485122755217585491253799122957126448999536768646242281867575179489116515428863411748454294774419952518883144156616616371938241798929938835157885815283834845655724414819467429923149649792152947741263894728859153847816333719691236342197862888368156764159141887765154655436543911912146638994893146781381971459762476923913688821693941166971394287371876425641394489231698373693598931163942826852761377626852734726811326591786815621852177873918372986211312154381823157143752819826582988121471851815676593586155261125641391662612134192826615849155269591423395167577593586954987144358549667477529618554611756538217337853911586934385629129821738159113789771265913496674193218392672127862214133114477315162695552257611632564134623511829214282662463187187641869594139512954916811952483129457349161998811851423621852343231752492154251658147211831345491688479819523731695964219713977437692391627314194429798527213143699166265269591154868995367166365618352718136571972563192612662589132446497113986615114617561183134195641119382456128244619935938218251761195248312945144964218877651889784113871699536717989291251788782651546554868179812347914481651542484564744653492871479927133859798527216737511187172129216413895157482116698221199525237512739891512231898455164144717161551484513385976824224946552321851465794593586141128199738618271951193229631947187767154655497113913486929125881346673179892914395474461991124583242289731585713771611162195843656175438123979215165961856733984798148396534524923622319584317888348358661265913787411974582155664983182812941799469111516269819714115486884798186555665213713628251411281298812113871628266355344182113886413286615175712514819461461756942873664251377553916626236223122957118958411734321126793213547493714964219719852728237527389543391921187172975177145569919725631296198161923814839653169831798929152232614476232846792564136642511663656585512523755713771768644387648577434165154236947783788582173377933411144883371735491681522326111448817383591625295174239719644871261875147185139976254916814738717343215612824239952695988836264489514845145166119281456743462826695296813385971368882119726713264831758549991329952968195237376318219644877813531475889783372163539526959181911929881254513171211218857461986696115688714435859327787833721443585835866254394284679171211247446518857463815915612826682897672248657914738713931113628251889784248337178479613244647813536359851122564116496318998791528383989311948335187363278942963598593277833111619321833149641576839341211157683984596119866964986931536459122553311669822846791516269912588133859768242216697131164963488598821733621852161923852897819362211193229115284914213761342635549168194631619523733311161752492181713916861685865147992715344411225641146792845961185748146983216394281241685115284912477423654391231591534441439547133254165759916111621245723187565112376479448925431114764844865791554638843221419357148396517363417767216212575491681443585448218162327618594991265913177873911488111195248123966657541598729156733919483351471851171211247446531698322612889643631294558551825771116496319745826925174926361225533144762341389512558181342635174441677529649263615384781142754194227846235142399193824759144472446692517156674413244641528383621852116698211528495733967248211568763174643573289711649637389545471498217339832539388354199521623276154655417565313123515162691225533761163761163977196152636467636563194712457231621257387648119928616959617423972786226622327591441542516145368172422644216186413257541516717321441566155463154857387422735736395296814395471964487543111129619831294516676941528383286698381591172826411629441423395182921439572434121193883537957212154381778739559263166971314597371611162162327627862218998798742276299287328971124583125178773277989315693583634213688821845366118919117444164138954159149872911675771712112127398919442978459611718169936816254394152636439572481567615687635572441661637922683662232573396179489119281459529687268416676941558668133657812578371338597264489121141756531162944142137613628251425414258432134465415162697813534865796218526662712416851994772182315723824212214951552611462351183729625891483965197256316434669792151643466423995148456763651455699633966178277723622319786266627118717216131811156887252375597624793467593586991329664251153242199132919745825754151366863118919144418365439845961793467141531946235192268339976215546328266254394795486732897158289625439478539112558181875651157683917989292564139448928782651954392183325298729114233951253799312945292755785391272565682422186555613668636218523755348176952887176965551251781259856995367983253831828135676818554611362825298812587529294774121141237647549168156674415344417363414314716783846218521938249186451221495997386615795167778911528491273989678384452256118515326247288717115284943812344216115263641673751185142336342175653186151879346712235141992753821733174643517121122725651534441376958169192217141311556649339192188776525843269857413729269857413244648257711986696918645446199171615734916664251115284919644871298217274584186555683384714294521611162159299124429912376471748454194833572885994691117989291132659813657954987668289123764794287367636511124691932183114275418938225935869428732947741292161697979379572819714161923835938217161517383592927551982658195843922683112256445427518675758217336925179731581885746185142312396666642511269951114881113628251752492147185114597371683846421971189786115284913991679751775431118459617349165935861762587168788416818273836199536726247337173349287987291157885824228181713331351431471175854912921656733969251712537991871613198467716232761267932139714818453669852721936221182719514718511368882823752399762274584198467762589169999811568876561751942278983253472446383611413347648438361173634125783713486921259856763182189382278741571377236223156876318796898742274724469691288836158895311326591627314849999411876938835169797918211381798929142541416454851956411168384686615118796891978622119951241685337173936816159299114294521399167179287213224453977433412115451315364595229215673391861518423997712587591441859499211995732897173634678384282665774345653268242215869348923984482183432311124691148811759144718764162125715324211526364172422639572455118793277812154381366863466389948938641321794891179287229275591662672885918695942927555491681867575419952779334411876381591133254175451127458435736371674579144863194787422772885945225616192388944171322445187161361377611811151954392162327671674531496461579511467923533252644891671732454275178681591662611467925188831714131159299117928723634212275527712581996791169596975177113669762992882173314375286581941843347175653577434183729294774462351133455944418573396514845932778165759989239814577181889784874227668289123764719624681251781825176599643181711566744365439759144896436734916146983262589163539124774217948918641329186454159141483965262471378977359382442161162933312194769852721128621331116118515382375289845536342127398916838461485984769239617814199275319483353755344461991926126119322991662619584316152118313416172191772682284679199275315364596662717686443573637732778459611645485163337116878841629333153444837885161116297719644216119584327458417827771883727153645976318213729265213729679315849151619238246318635985258432199275319927534724468257719347971675771756531845366557244163337119866961837291542516184738512134191659618347268357363187767658194761163158693419119938479818776727862218171561282121947634121117928723169831796911187172898455182113854513383611225533124168519523731267932377553163135216656758964361875651136888254714917141311443585129619816252951312354663894926363654392382421142754128812212537996339663856293533251623276144156684596114395471796914441841995213951291677789199881363421479927159299117928721136697185748184132872684178479619725634562941962468886341918645969121821138314964166567562992811124695148459226835895489792151613181123764711326591875651922683178479651282618433471219476847981332541427433912588126389427256512315968444127458414799279973861742397411876126793214819461221495169394114476231685865545137773151867575112862161781411972671788834369477132648316535611411281918645192612612396661823157171816958954863598583182859156767838448456182113882577181769588634162589184132811488111338597144964212214951875651182921484394257137748657989239873693518271953492874623511195248353325119928617363472885912517812295718156761756531372921183134188372713446543714966339661419357188574613365781544535129821719745821534449973861938241342635163135297517718312331776729267212786225572447248211982658177672184132813163881366863559263151425162125716131811356768781353112458318372949263654916887422717868157833727389541187172918645559263141128118352711754511272565888365915671298217559263496674141935769857482577118413281962468135878712235145431117793341821138143752819442975713771825176133254185142391662611871721518288123764718372945225637755311649631449642948931823157458313122755217625873795726359854421618459611469832168384611992861461756195843114477312174571861518726841996791118313463396658752949667411286215592637773156884795269596642517914481691922411876946911153242117141313674581443585236223454275462351813657135878715788581574821536459197256334121117827773149643997621225533236223526959561282171615139916769655522814798123424833741995213567681857482846791457718169596819714156472517383592543944885986178143654397187641788834292755845961666278277913143698883698729189239888836167778912659131899879312945188776568847917686446218528984557874198527213729218857461554635915671548573462351732897124774213567689771961635391273989615795946911381591198467712214958661511744416131638814395471225533466389194227868242216777891483965162529515223262584325168648338479125881352731738359136888224833767838449465524228591567971139345249928745693587752961459737898455827792362231197267142945214294522523751643466118111554714973289773693515647251568763115284921199597719621199512719716656754461999428731582896195439218554611273989124572324228448218134263515485731699998147185155522542197112881221758549817695177873911366977429921522326127197118313416616371465794195641111427541443585256413182719563396651282662589122553392672111629441138716391686185142399536717969111548681823157188776517161516676942967931932183174845413325417827771873632268527579453991329127398914395471776721867575195237312537991778739631947952968133254159299118413281685865123966698931148598412194766117571867575179691177672183325216414471225533164346645831345831314274335431115612821191213412111326483623871128812259156723824279952413163881193229161923813325471876413264836662757743482779371496146377535938216394284926365471493755343169831296198837885837885613776831828333135629928165961845831338361162529549263612154381627314148396517524924764841681827494655111448831294518897841556649997386187363218211381526364169394117161524631812416857692397288591211496912825771153242118897841467813177268297113916676941887765831828144964212598561411281127398991662613345591639428631947151828858147211528499913291681827186353718231571334559155261141591414617564381231835271256413862113161318124631813587871298217862113199477269453689845519463161191213755341683846186757557339654311111225647833721576839112256491258819988118271954583136521371265913155664933717319543928116381823157526959142743339572417161513789771465794154857381567692672184394219947721451661136484413244647429928499997954864421616299281425414767221582896183527134323111852693681649667414556997349167692399388356844411819119888361586934365439133254147387113871677933416131819469112442997853915148451455699444188782651853442173432138562997921551282613668636622325855117726821615211649635552251469832658194162327669857411488111223514181911958147277933414153191685865114679291662689845519947721189191337173654156145569967838455926333111614678135976241241685357363244299486579167577164144759156716333715431117833727591441833252464378217331932183115284913951291441566514845174643518514231479927894417184738516353916999981772682124976182577136947761175716111627954862261281253799985272189786577434284679522921444181393116763652927552281475128261443585613776835866184536661579517969116959682375216333711415319179691162529518655561469832199679116656756218521166982423996743461344654341211197862587529151828879346714799271843347452256742992139311512826783372175653167173233111615243451623276886341171816916596181928145185546186211313729215142595498759762412214952644891552611119121133455967434615929913593823694775653214678131843347137493912598566824221994772197862686461728264154655493681615566493311161992753136282513991673169834643791864583788556532831828254394199275341995252494526959164346646638941389582173337755357743418776765213715849151249761827791653561119524842399129821717969188432231698312941798923988459615148451938249489313951295289781326483122553318171169999814476231643466147588917625878176954764841267932944892761163199477218998795814721219476198467739976216777891112469686461528383146579412154381522326163942819382418958411568763114477316535614845669857411447736339661558668847981938241316388294774159299116555845225617787391469832143147118716137268425843216192381451661185546118352711756533735152362235552255269592866981481946168182719988159762439976219685251865556415914183729139512915687631875651122957117484541984677185748171211216999981332541376958284679371496118717216777891873632165961822612811669821978621148811154453558752954916841591468444154513462351124572317686446299285713776117571534441978621148811142137684596133313515687634441811831341187172732897142743333515461781411851531821138177873915768394179336157955128263553442463189529685511871219476158289651686499738643812316414471399167183325249869317161516212571699998166769418716131411281169394158551145973716777891649523175854919967912947746218521615214758891229571161923871876411467922745841766625787418782652382421451661954987175451114476231397148165759944619998729116838466723275733961883727991329133657815768391972563112458399334816979794159144724461782777316983113669714314718964361162944111448818675754966745774347631829549871823157194833518695941324464922683252375942873174239719564116844417934676925179751771586934256413148194655118738966756532894417133254174845413143691364844152838317282647187641649523134263518171761163682422169596122351435332577529616818271847385179691462351211995942873526959129821715889531417338845961165154218231578843221889784135676812961984643717343219771961944297742992173634658194577434934797172826466223216676941528383991329199275317161562185295296818514234986931869594175854926247152434559762429679319422781164963121745799738613628251673751197862389667121745711649638116388116388197146925171879689122755284192331496411548686844414865791617219182921414738717464357752968984551451661114881137149654311112719715445351411281454275146377512679323371731653561122957194287357137769453611891911788834268527166365691864572885963396689239815485731697979244299337173165759963194794691198325316979794865791239666152232618231571144773161721916616378883616394288358661455699589548611757981234599643144762313951298116382523751417338137897784798549168898455165356116414477389541879689166163716777891348692182921458147246437147185118211388176959287418231571869594462351172826416999987268416454851677789113871679144817666251425414987291524941114488773277759144197458218857461336578272565193218372885911669821718169286698178883497517715869341716159267211132659932778195237319866961582896799524571377347268514845133455914112811936221122149513668631863537918645165154236342112862131698337957299334829477412356283876481726245122351425237588836692517182517636342864132151626965213711548681439547286698656175152838398527215142563598513527313486928358661782777163337112295711372923876481118526133254343231611162476484114275418352711433491235628152434566828911144881584915186353743812328467914213761112469179287215122313371733472688923985431113149647389546985748338471241685165558635985142541415828961879689462351726841368882288717179892982577136342995367211995147185134726844418514845133455912416851459737199477233515418796891851423355344148194641995283586659762466223291662661983312356281512231518883367458631947119726714698326238711524345111246918514231972563178883469453618332521334559163337111952481419357795486591567938835876246171816959156767232711629441794891144156676722226128284679188978459964319483357349161467813498693369477126995184798122351418958411199286169999811952481257837184536623622357945397921519564111877678681759762489441715889531336578145569914698324825411712112581472143752826448918473851479927593586385629151425137292226128152232612679321784796827797611638277917282641889784135878771674516717322846791518288892398165154215788583896671994772952968486579173835937755316979791841328742992185344217423971564725114477344619929275578539146437163135273693515748217343214522561712112172826415788589448921485984565321855461666271659618165961839168628871781971462992852695938361177268247244613224453634218514234199521417338464371643466175451111467923452494926361552611472446686461241685843942182113815748272684494655172826444821841793313466731542516783372161116254513128812212497617288593836112679327591441251785269591368882139311983253369477198871518251761467813158289617989294865798944171817111649639973869832531958431191214421611417338454275619833132648349869315828963674581528383359382189786894417193622138159117545111635391784796167577656175169596411876462351795486823752395724124572328871716454851697979137695818453661861518184132828871719725631974582121341987422715243451419357148396518938221546554696555184132883788558147214839652967938217331447623192612614678133775535733968197141263894114881183788546638912235147571259448922988127914481847385124168546235113385973997621667694193218356935877327765213759762418352711956411543111187565166425117888347732773775531465794335154116698292672196912151223116273141374939157683918695941522326118919113769581223514476484375534164548537553411346781584915813657246318682422666273836112154386117576238715976249125886198338923983432316939411627314121341915546362387114233953815911691922182315719866961847385165154294489238159111245831211417969111649631166982799524565329691215445352826615364597773159953671439547177672371496127398912416851441566161923879144813789771356768195843381591684441179691868171867575573396155261118251764482181673751113871679548684798543111153444763182488598187767547149688479136888218271951744416154453519866962745841821138543111175653113871612982174825411651542268527482541837885363425168646965555693585188831245723166567514153197571258984551221495565321433491451661688479122351457339624429912255331835271528978141128118716138782651542516119928673491618312331617219121141374939985272357363184334752695911811151524345166769439168689643619281451819119115688752292156733924833727458457339615526114138951324464377553236223379572278622166971368847912396661831233142945213143691312354946559792151994772123764711387161193229337173246318118111514556997631821463775153847862589156674424228581472371496238242819714357363934797686462826612497611944297112862114556991994772142945266828927458478337218857461712112122957118877651653561143147168847946638984798549168188776514738714375281796911661637198669611387164724461718169189786686461552611129619849667474299219281451255818423997187641817117484541865556547149363421584915363421788834185344212638946925171615245629413123558954898325314698321467813126995136947735534418716131978621932183593586411876198467787624618594991467813516864198669676116352897819988118675751326483512826196852515142519281451364844787413351541621257583491444187591445754156884792887171481946121341994691116293331292161998813957241845366153444672327664251118111512679321443585585518479818635378378858843221736341948335156472559358697113918534426521373654391592991144156617181691582896975177995367476484147185126448929275555118715889531784796132446418837271988715144156625237514536816111621837291461756946911476484161318126448918615183492874239914193571964487169999849869311225641231596965551586934122957148859861983315182887369351768644148194617444167934671998814663895552256925171364844799524166567565617518352714623519489313628258257713836119846771538478383611879689835866164548569251719119931128621779334121341911669826844412543949166267672213426352564136763651251787571251429452545131564725155463183527118938221586934238242248337575415619833166365634928718958411766625119928617948918378851253799155261178539151686455118718332522281471946316131436991258816555888836192814528669859762414153191419357522921158895321199533515455118781567682375219483353412111837291623276139512949869377327714334982577112598564219717288591219476993348678384252375135273118313416596181294179878265158895319826589893158349115889531152849135474965415613325413345591136697197862151223116434661756531911993357363125379955118711831348156761164963155463896436119928615485731118526668289991329981234134263518514231588953391686165558137695818574818534427349164724465451338966715142567636511932291128621349287714726165356114375281453681263894682422118717236543916979799347971471851172422613991671734321161526945361352739872911415319156876312457231716151776724724461354749187565148657982577112558181312351968525144762331698329477414133158491513749396723271334559793467129417984394283182816111628358667773152119952442995895482422857137734928717686441413313769583149645431111659618936816385629161923817565316959654714916454851833252143954712517816394281928145874227129216343236117574744657833721667694118313415243451792872172422616252951114488474465123562812961981346673268527264489124572338562952695918574819947727429921855461777315795486133455927458415263642119951992753662232288717591567989311181115254394115688711427546178147389542866981532421132648313527355724455724466425118211381932183198467719947721485984373515763182162529565415661983381567696912173432112578374764842988121429452152636493681612638949852721273989442161166769418756511578858922683367458514845152636412517813729282173317686441294179158693433313514577181952373143349187161313163881582896347268464371273989892398158693441389514153191249761977196173432111871729226831718169131436916697131697979196246868444143812339572413486921718169835866192612658752916697131928145182719511427541251781536459142945219745821584915736935151828841187657339683384787624614334982375228669816697135733961138716133254139512918534421144773193622156532486579186151811912188432294691116858651512231581472833847185949941591426852714617561819119141935784394245427551484515384784239947446571472659762418332525814728984552866985774341911993121341945629457137716858651619238115486894489217948911225533153242152494827791843347997386152838313931117161599132916495231936221194833554513199275312174571314369126793249869316555815283836238711374939244299389667373515184738515526114926361185153113467851484562992813587871298217623871185142311629443714961817147648416172191695961782777559263827795794531691922111448857137745629413345597328971393113169831467813252375886341476484438123189786577434936816623871244299178479677327734726814476236561759792151362825932778345249847985491689933481619238264489981234438123143147144418188776586817193622116414471298217142945235736319927534562947571251415319528978419952476484799524113871618978627458454916814415669953678136571467813147185116394281663656373515456294194429716656751697979187565112659131338597922683165558121543844619999132925843273895418756515814723412111122564561282185748133657811669827389541219476716745886341757125268527567339789429494655888361873632421971163337133111655118714678133916868782651817168847911992861534446157959771968338475128261534441193229379572144964274299217666251883727258432147387122553362387118857461911993779334174845426852759964321199525843216293331352731146792143954714819461697979147185117767227862215586687853911437528178277718736321766625145368194631614213761879689139512916959612941791146792571377187767121745755118719463166299283815916299289428731352738499991524345111852612941794845683788512699515552251136697196246878135315788581988715981234166365673693515687631142754781353868171677789192612667434684394298527211851531869594112256444418176864417423971544535139512981163812477421786815341211115486826852715384787773155451311124691911993973158181713129451588953183729157683916676941273989143147117363412396667732771653561123966617545116319471847385827791631352995367813657172624516737511199286383611845366139714872482117625872584324441811912113789771895841381591187968919261261621257593586357363189987914839651754511415914174441627458466223242197118998798984554219714441817242261235628993348143752852897812558182786221972563448218153847829679312638942523751463775187161359156714435851942278161116217383591423395355344724821892398137292145569918998791592991195641112396665834915733967268419382412537995511871259856373515122755219988124833711992861833252137695815869349368162786221875651112862195498716192383331351651542577434769239113669718736321629333116496397113924631811851531827195668289184536616636561899879876246162731416919226198332866983815911627314195843135474962185212235141255818172826414233951364844242282846791847385698574121148964361512231136888215263641639428146983265213712679321942278131235124774293681617948915148451473871847385119121555225155866878741114477311831341972563151425258432835866165961818837273735159751771897869226831871613874227944892123562886817173634415914989316299289893118655561342635159299187422715364591663656175854957339619362212866986157954562944522561417338188776578135352494134667311972671415319567339168182769857482779476484175451184798781353196448711528491592991288717183527162992812618753977436198331972563132446412457231215438186757512578371778739494655194833515768398318281215438172826411467923714961724226174643512517811326591936221298812186353717524921288122371496188372711871725289788782651431471167577811638716745444181419357591567168586519745821619238298812167173215869341744416682422189987912214951669713874227716745862113629928119121474465593586151425142743314435851768644179892911488111867575575415373515682422942873189382212659131336578164548519846773916862826613648441344654886341141128114617562826619281451586934742992446199146377516999981962468162529536947792268379952412497611875651158895315122311469832163337186211316273141823157119322913668637894297389547389541455699185748193622116252951247742153444365439199275313244641671732932778111246914698321368882567339132446416273141996791228147926721121745774299286211384999952897818736321865556185546113729284192317989291847385775296597624165558125581861983311912116414471411281922683125581819483351441566825771466389337173561282148396552695917928721253799142137646235154311144216171876448254113325412679325774348156766561751794891912588619833127197176662513426351298217139311585515269591988715466389543111185546194893268527154453511447737833721926126625891784796111246918695944239917928727752966178141118526148194672482117787391857482382429973861485984178681515586688661519549875289781574823896671397148373515193622111548681586934757125144964259156715263641263894175653777315188574618231571817116394285148451617219268527176258713648441629333312945198467741995212114177672252375178277777933444216179952479346714597371372921144773144964215526111845366894417156472517686441661637165356119281454542751657599153847888836591567129417911387161568763353325353325168788418372946235117948913492872624793883591258813789771518288193622198527217948919469117813531215438144762331294511871721819119464378984554179331851423294774199275312356281738359581472198669613951297773151613181995367144964218231579347971825176167173247446552897815667445713779832531835271371496129821718271958661512463187692391829214136282517726824986931138716942873113467813466733169831241685825771156472568646163942819947723472685572441671732734916333135125581814678131714131686461189191688479773277448218674346823752132244518796895774348257711883727182517613789779792155673396642511835271142945218877651984677145368969121354749555225129821712739895612821879689113669712941791344654175653158289698325319846771271971368882198669658147262387151686454513868177954861421376121543811346781859499411876724821168384645831346638938562958147276318216273145693588217333311164542753775531968525421971113871693681611891911356768112862117282645229219529681667694184536699738611891915976241548573199275314536878135369655511871721296198187161317565341995276116342399934797345249581472296793153645967636586413242197114657941481946815676137695816454851142754195843587529144964213729219927531998817187648378851726245664251878265494655126793215566499287419846777773151324464954987238242448218452256169797976722133859728871719725633735155653277933417726825491689549871613181264489555225246318997386168788412376477349161122564143147163598573895473289714678131213419119928617383591443585145569917242261728264734916811638132648315384788257711255818357363193622128871719685251134678367458555225168586518615182119951657599672327171615666275471491897861857488762461657599567339833847524941516269155463163942811952481164963728859186959466425146638939168618514231356768912588165558134263511972676258969857419745821631352143349147387118111517827771958435834919711398358661346673155664938361759144135273174643547244646235118352711861518874227543111633966668289155261114193579327781988715617814419952134465412982171199286226128199275333515422612818554619388353815917167453311169125881691922298812197256351888318191197429929852727732771542516472446191199316757712719765819463598565415615364591338597983253121141724226791448543111161318118736321582896936816442161337173874227383611728264298812174239781971414173384461998358668277915828964724461758549145368932778494655179489112537991592991395724912588793467367458143752812295715693581556649184334717969135332513123546235137149612275521857481195248166769439976257541539774379952412214951821138166163754714944216197719613143694239968444115768395128265875291926126198467712134191271971877671463775438123783372654156421971181911911932296581942523754865799469115451339774313244641457718524941265913133254121341929477413668638136571223514383618378851114488339192492636121745745629454311192874545133492875774344623511148811179287216172193674588277915687631292166723271716153755349287436342918645262471766625191199312598566622324946552725651627314165558488598121143149647167453452491671732395724975177169192241793312558181199286188978489845565213716152474465888361185153813657555225466389936816199881419952199881154453581971456128259762441591415889533452491946316456294197458213729277933416111621746435973158654156971139866151125581813345591677789184132819725633593828883674299284798192814573895414637757752961659618118111583586686413211427549327781415319734916196448749869313688825814728237529428731451661938835979215375534112862144619917969111467921459737672327252375258432922683132446489441713668631861518183123317969177731513163886359859327789226836178143492878883627458482577144821811831341613181868174441812457231185153896436198265818655561395129147185116596181675771586934184334715526116642511338597551187383612786221693941151626918312336884796521373412111467813593586116294417444163492871419357198467718413281895841151626986615115122315289786178141229571174441616737511645485567339141531916333713391925592636581947752963997621964487686461397148198871598527266223291258818473851548573898455153242177125816878841655587248218661511467813114477319866962463181633371236223168182719927536238711322445119928639168631294513527318574816919221352731213419837885123764713567681653561896436151828819967911352731592991114275456532274584524949832531863537357363141733837351517181695673391835271296793182315713587874885984461996178141546554561282617814147387339192196852519927532584321223514154453531496411992866763653977436844419347975451318837276359858843221518288182113816495231673751391686236223173432113123535332519321837692394764841292161875651142137617161519826581114488145368183729135676884798189786625891566744835866718764126187567838418554611685865154453514516618923981661637142541437351517181691819119383611865556543111278622141733816919221463775944892162125718877656541569893118675759428739792151663656123966616858651978622685271582896248337124774215223264522567853918459611586934184334766223236543918231577914487328975794531592991166769416212571459737181911916838463634215384781247742472446444181788834121543812114567339166163712921629275518332521873632248337185142319281451639428787411225533678384868177914481294179686461538478194833518554614986933533251863537129821734928719725637248211447623153847835736354311112618751453681998811639428811638559263353325167577448218383611251781845366333135162327627458413668631928145446199121947618514234946559973861255818114477312739891536459456294187161393277844619916979791475889284679389667496674123764712618754946551893822183729113669773491614678139347971584915186555616394281483965162125711528491138716126995118695944724461461756353325135474919967912927556299284421611893822137897717948913351549327785875291142754152838329275519826581417338194227899132916414471611162143349415914775296175451144821812517899334817989297389541197267144156612174571869594165154212235141964487125379917242261697979446199175249233515461781475712518372968646742992456294312945123562816111621986696181718883615142521199518332529327784179334542751754511262478742271671732995367248337197862158491511548681728264815676177873935736318857468237521857481193229182719598123415889534239979548646235181163883788519866961619238115486816818279731584643719644878176951879689775296129619861781416172193815917631822584321619238462351847981231591324464198265816999982967938439424663891568763284679423993775537894297672212537991978621273989184334712477421819119137695835534498325315828961132659123562814233951954392196448758349118615187692399832531566744148194675914413971484159141362825169596767228944171972563847984482184623513977431691922125379976722166567552292199132945629476722112862112396665128261641447262476238711621257161523755341542516163337177933418594991463775124572311488117692391699998769239167173259762476116341187617262458237522463181358787926721124774215526111778739981234129417937351514839651835271391686347268391686128812257945344418377553165356141187695296835736319725633472689388358136571728264995367335154186959427862217444161423395196246812719714819461889784123562817847961643466975177142137613648441162944148598465617529275526247464371641447175854967434611427541625295192814558752977327761579518736326884791193229183527167636518857467934671518288152232654916815223261693941136484411366976642511144773176662517827776359851298217176258711912117181692786221229571811638167173225237578337288836938835359382383615249495498714536812881227874113426351356768585511211416313528984556662716878841748454868171471851147588918352717611631213419884322179892924631873289768847971674514556991269951518883188978414617561986696139916799334814173389226839812346783841463775174239762992849667415828962826613345591649523652137134667376722985272375534182719594691113628252887171784796134667328669826852752292173693514839658641324724463775531578858254394193824169192291662615384781956411161116213648448217331249761724821228147981234136282512497612564131374939724821714726787411354749452256452256132648329679389845511548686521378641323573631469832446199512826514845162529517363416333715693581213419811638199477212941791867575613776148194649869337351516838463573631627314284679777315158289614133125178769239116294417423977853911449642268527985272145569915445351845366148194619564117773151342635171615153847811144881823157112458329881217343211479927514845195641116273141221495438123175854912134198419233735153331357853916258914536813991671415319111246986615179952411447733876482523758681761175715667441259856811638173432111467921437528516864114679238159115647251118526894417173432124833766223217141311817125641318554611948335862113154857386211333717318716131617219896436894417573396121947619685251734321134263525439418776741187633515415425161851423113467888634116636561162944621852119726711568871768644181911916616371346673597624185949959762419947725693581663656122957144216119382498729112941795128261988715152434519483353997621447623567339977196178479615667441835271995367615795113467817423971124583126591311548687995248499991645485111246938764816152197256316959633919245831316878841556649169192215667441677789169596375534151828823824219483351992753898455165356115768394381236359852846791831233625898883616717321724226526959811638286698172422611467928197142947748863411326483258432159299199738687624618695941752492168182771876468444111387161738359155664949263617969177327716414471691922168182711972671187172991329454275118717216919221223514363421776725511871259856152636442399195439224833798931494655815676183729126793265819416434661962468179489116697133896675794531524345178479613789771455699878265355344144964213729213385974118761221495864132415914894417153242184596113244641536459119121236223472446186353719281451669713199881419952696555189584187422718191191683846142137614233951461756193622112255331542516119322915243457712581819119359382182517658954812598566319473391927631821239666151626911427543836117989291996791121947613365781556649125379913567681825176199477245427518837279691289845518271951364844989315491682725651415319136282519261264381231467813152838318897841697979175451117282641956411349287187363217121121189191185949948657971472668242241187616757794287318897846561759226831358787188776544216112659131742397151828814274333311161564725131436916495236965559812349691217888344926362523751546554135878778337241187669453651282655926317464355552253169836682891397148419952153242119967911253799144964214839651235628153847852897818171145771845427548859815828961988715777315177268214112811221495143752826852717242263533251227552181711899879146175635332512396661395129387648173432116333711227552482541258432991329377553118111569857428266466389438123134667317625874885982362231368882692517156876313446541847385142945217787393573631798929154251678135389845599738652695973289723622317262451245723199477217363456733919725631461756593586767225168643775531962468997386145771861579517464351461756664251591567167577145973712114545131481946952968573396115486816535615592631724226121543899334837755319786266425114819467349161574821546554168788414193571265913845961767221663656182921413244641877671142754991329184738513648441859499193622115324215491686198331358787188978411891915188831611162359382898455167173217888345289781393111189191167375118675753876481667694785391122755231698315869341639428113669713527333919252695914496423977431643466678384985272549168193824198467738764866627567339383611746435123159139714815748276318276116386413215283831831233549168714726175249262185211286215511878782652523751883727779334512826189786183123348456139714815647251217457692517335154831828654156462351555225169394113971481889784613776164346618675751996791526959341211357363125985661579514375285592631296198144156615384783694771534447672216434661867575166769414839651215438118919117989291665675129821766223213385975229211457718282661148811569358411876298812252375198467788432293681677529614213761748454194833572684193218384394244619911952481166982129417969453659358651686416676941354749197862337173593586156876319988113264831166982115688741389519967915229211342635268527123764716454851734321948931356768131436917585493755341792872187565172885912174575976241138716381591841923197256397113917847961352736662741995213547499852722119951378977894417168788419119938863411193229767221134678617814181715814721798929114477319624682826612255331223514779334161524199521271979933486925171215438147588915122315673391132659284679157482168788477731516273141395129179489193479737553414698323371739489359762413688825552251425414161923816737511215438185949982577113466732988123775531211411366971124583734916176258712457231118526518883114881114597379186456945361863537165356187422763396612659131697979118717212578377692391718169196448713789771756531219476187161313688828358661528383166971369251762387138764815869341518288118515335736316515423957243371738358667187641453687248219691219564114663899751774199521374939413895147992772684129821773289741591411831344583131265913135474915263644966741932183458313155866833313518635371841328175653123966611488114482181578858171211217282643957241118526377553196852568847912497617147261784796122149548657989239815263649731581195248773277116294414415661996791177268215344414112811958431378977162529511932291223514169596878265654156144762316676941334559282661213419476484181911996912119928682375226448967636597719619564114441811811151588953494655168788467232717686444643715889531964487185949928871797113916495231663656121947676923926852712537991239666312945125783724631813325413749397914482685278944179832531538478135878772885914334912659139226839711391948335166567517363478942917161576722248337454275123562841389511992861538478894417178277716394286884791128621674346197458213466731348692171615585511378977133254415914593586589548946911367458827797954866743461588953121947637553412275528843222826631294578741128812218534421699998399762135676831698399738617666254663893815911459737168384625641314314718661513553441877671992753163539888361455699462351918645969121665675146983215162691794891188776598325314193575976246925176925171467813142945217423975269591663656187565114294521629333144964215546318938223694772866987591441865556488598226128127398915546339774329275512497611348692391686518883494655284679551187153645911144887773151673751415914125178163942825641315324211841328892398716745163337146437454275114881114133728859194227817666251288122112862166425134726812174575552259913297369358197141863537155463126793273693531294516495235976244623511399167555225557244488598262479549875148455491681326483369477868176824221451661589548182113816697139469111928145125581861983368847914415666137765188833412111627314791448112458328467958752969251717161512618751538478298812199477217242263553442745848681751484514698327712581334559154655498729189239879952469251777529616212571433495572447147261994772387648545131633371153645949465514435858621131481946716745613776198467716656757328975249479548616212571928145153645963598516273146844415168646299282644892422815445351746435123159569358111448884192312457231782777167778919927531613181173432119523732523757853914441857945317969117161519281451449642171211216555815566498318286662748859817888341461756981234182113831294529881215889531871613593586565321536459983253185344278337214556992967939751771829214176258712881221124583177268218695946662714435851324464125581889441788634117666251267932164952334323154857335332512356281697979696555171816915566496339666218529852721425414262471776726763651883727494655143349125581887624612396661998817268428266153242143812319382434121187422791258844216177933413345591861518268527787415128263311161223514134667312194764946551154868152838315485738499991393111431471415914244299164548517847968136571217457136888267636557743419927531225533174643547446526448915828963957241716153674581825176158491514213761485984226128142137683586625641393883512578371853442166567518514234562942584321433491366863152636429477418352713997621136697736935761163111852611467921691922123966684192316313521219476997386132446418796899832538459612362233836114173381623276674346152838316353967434612194761621257199881296793757125166163716414471358787874227113871686211312719776722777315896436162731414133165558934797186555629881281567612578376258912194764946551621257292755599643726845168649368162119951485984415914119121163539787417732776985741681827926721143954716737514159141879689114881187624614758896258914153191261875363429872911552611143954721199544418161318169655512517894893165558176258714375288217331199286664251139311112458313345591576839165154279144848859892672154513181718237528156765855116273143674582624715283831788834973158147185118514231336578179691298812256413179287287422712881227813531213419127197155866816313521855461142743395498786817458313922683567339118515349869312699511734321633966488598799524357363199477259762436745837755319362213129457167455673398681719321832846791988715188978416757719826588479838159123622311447734562941794891182719516979791875651668289565327914481641447738954355344186555639168616414471449642135273175249298527216535611865556115284935332514415665693586884791748454692517153645972885911649637248213533253977431312357571252988121657599136686312275525915671712112165961897921557945312638941675771162944131235186353713587877248219347975471492564138237521393111241685146983241591413527381163814516614825411875651345249118919143812317363465617533313514718519711391433491578858878265545134845634524981769514395472442991734321162125713466734663891181115119928614637759489318312338984558944171415319142743312194761911993156876376116312719713587871199286113467817484541189191831828179691799524129417944418698574868172119951298217134667312558181267932896436143752817969119463161669713383611316388143954719947725128264381232321851481946144156619261261841328162125786615115243459125881821138845961164144759358613486928459611938241144773127197136686359762425843214738777529616434661191212362231437528292755823752171211298729161377615788584522567328971227552148598438562912315919422781958431639428623871611757122957173693597719611225649529682362232624716596189186451899879995367123159144762369251799536713244646622321978626561751459737395724194833547244654916813385979893112497611419357113467897719611992861853442345249183527134121117888341748454757125122149583788511952483997627187641255818188776557743486615123622318231571217457119524813325458349154916812416851467813112458318978626448931698314516611627314662232125178446199132648319523731354749132446415344446437973158155664922814714738727862218615184159141996791884322121947686615141591412739891427433185142345427514334924631816999981883727125178111246978337212618755713771441566736935417933122553324631818958418338471296198136888212457235935867328971326483597624123764716999981992753472446118515351888378135315526111667694158693438562976722365439163539494655127398915445358621131726245353325411876464376178141974582476484181711625295174845477731514496421623276171413118978642197117161566828917121121617219698574464371841328193218318978614516611798929458313198669618191191681827862113163942884596189845513729238562986211314213763472685148453916869711398277915869341699998163135212679321316388148396516676941255818162125729275539572413931198729128871736745814718513694776359859731581118526155463898455172422669857416394281481946113467813123555926319543921257837191199334928711972671221495147992717726821887765543111187968952897836947715465541326483194429781769517423971362825171413114859841128621682422151223124228514845771258177873912275521863537133657814193578156761958438923983674584663891324464169596123159821733381591613776918645196246816757749869351282616878846117571885746194429798527224228122755295498777529619725634179331146792152636434726876318212194769166266561751516269716745125581865213757743418675751415319979215169394192874181711843347161318114859841641447139512917141311473878419238197141263894189987988432217545114926361251783795729287418191191728264144156624429911488111786815581472121947659964348456692517124572357945352897812961981221495169999813971481225533694536292755164144754513898455664251125985633313516293337793343129456743465128264926361191211697979454275135474911124699691217868151449642176258711326591522326123159415914177672158693416313524522561148811142945213163886945365592631798929365439186353716535611968525113871698527219725631996791242281526364187767111448818292141865556462351567339186353714173384239918796891986696589548593586184334749869382577144418118515376923918453661191211877671374939934797122351446235117928725976241546554369477114275411245832281477712581835271528978793467549168555225145771818473851796919428738439421948335175249214496421358787181711245723452256124168513123513527338159115223261229571482541371496127398911932296178141112469116496352897814556991336578166567523824254513813657375534876246688479178681531698386817333135141733876318219321832119951199286125379937755317948912685279872917389541635391538478188574615243451237647236223973158944892129216185949989441794489265415613931116232766642514825411197267551187492636912588981234188574619826587954868136571768644787411118526423995733962866981471851785391518883298812153847863598569453666223212295711374939114477313527337149634121118231576642511441566188978411932291326483186959418716138499992564131942278167173262992813971481835271244299183325216313525269598318285128261292161831233136888212315969251733515417585491366863666271568763194227825439446437484563815915693581823157333135187767835866195237312961988378851124583175854918574831496415162695592633371735754151911993157683924833717444161267932152838319685251354749134465412255333331351237647145973737553426852715788587712581895841135878712154381189191156472519846774663891984677815676316983954987184738562387113729211992861166982129417918332528116389327781374939123159156674419967918843221825176157885838159199738612457231298217125783718958411148811494655658194763182198669663598516737513634294893466389892398172422614698321889784258432621852264489171615157683962387171876415243457773158843228237521185153672327152434518978616293337732773432317686445976241528383524941144773524946622321667694169797919543921239666146377512739899347971744416775296152434512598565612821938246258915162692887171217457122553316555845225647244613789771897861124583188776542399876246652137189584111488111348692823752526959845961462351187767178479614334915667447712581261875773277167577165154299132919745821746435971139137695818655561524345282661578858193218319786288836114477312174571124583357363115284925237511366971332541524345143349573396337173125783748456116496317726821611162668289135474914173381863537779334194631625641318413283775531683846831828186151876318219725634159144482189388351768644987291168384618615181324464166971328871747446538159181567641793338361775296146377557339639168612295713492871342635114275412659139388351841328462351926721118717251484578135319281451255818545137833721411281172826483788544418166769435736377731515182884482181253799849999171211214435851524345597624153444153645944418175249215384784138951324464381591444181734321682422316983547149442161997386121141548573557244174845419967911574829287415263641475889114679273693511891912846799226831227552133455981769512921682173314839657248211112469488598514845668289718764183123317565311366971362825359382874227111852681567649263619725631558668587529522921395724952968232185498693674346314964516864847983391921613181811638936816147992786413278135365415625843217141315673391782777161318119887151253799139512966425115869341465794198265852292138361623871123764718897841996791185142341187614254141962468188978498527213325486211317383591673751128812213547491522326173835992268314133159299137149694489219947725431111485984652137823752167778918756511944297757125165961835736327256513163885895481873632522921773277274584843942114477344216116676942786221948335567339615795199679117181695673391124583116496314819464159141485984823752153847815142513385976218526359857611639448928176954421611857481261875484561164963575415173634132244517444165552251524345139512916616371425414549168186959413123577125813991671132659672327135676839976236543911427541635396359853836111185265148451473876723271453681843347173432119523731574821665675158693411891911197267932778666274179336844411421376156674454714912699516925173654396642511166982615795179892915364598156765935863836117141311453681122564585511334559922683726841189191185546155522586615128266121745713446541748454178479612638941683846474465734916144762319866966723271288122385629197458213749399771966682899469111463775694536522921134465417686443856299812345188831625295195237315849152543944441838764813345593674581875651162125794489215768391962468157885815929911819119174441616515421754511119121444181425414244299672327189584136543913749399731581217457363429267214522561122564825771164144728669811387161942278282661427433888365915677793343634299132919382416192381148811633966122553318716131748454196852579548615647251453681245723199679195296812295711897867268449667446437141531916717321138716415914171211218453669327781374939226128157482118515318352711691922763182174441625237536745828669882577146638963598516737511417338672327121141897861798929187565111871721875651153242116212571827195926721166365634121116232761685865145771868646162933369251731698314516611788834316983163942866627886341987291314964795486144358577731581567611912171876417444165996431798929131436914799271217457389667191199313951298318288641321728264188372744619918655564219711728264182315745427513749396763651393111332541548573492636666271988715658194512826158895318695945774347692391352731619238864132198871519745825289783533254724461899879264489672327195843119322994691139976224429962185212739892988121393111193229199477221199584596111124691835271114275448657918897842584321964487147185194489219483356925174663898964361332541142754866151423992846791847385738954892398129216448218823752194227898527269857482779114477317444161134678783372874227199881129417913789771128621133657814839651532421399762193824111852618554611334559139916717827771326483187968913648441368882591567187767581472189786898455446199446199385629134263511366971986696492636292755137695841389511811151695961629333256413845961494655143349728859585511288122557244197256386413217585492786221451661111246958551198669663396636342866151274584381591124168519644871162944137292359382918645579453132244541995219564111586934498693129417993479747648414556996743461374939545136682891336578151425163135228467937957272885916313521889784195641144821836947718594997712585249416333711558668585511372921457718567339331116169797915768394946554219717732771847385119524811346781217457165961812517881365715788582786221526364652137121543814415661754511115284912699519893199334813143699812348358668883616172195431119973861183134773277912588181711855461676365199679196912694536952968823752884322236223143349825771155664916273141734321155866817343211189191182517619281453371731823157165961816979791685865123562856935811326591249761843942136888217948912988121655581273989585511621257599643169394155522516838461223514197862144156614819461742397184132812174579893115485732543941695969529681819119116294416293338479817989291164963124976155926311568878459613533254199521738359514845264489168182773491647446511286211342635157482238242133455918615181685865571377498693118515313587876561758499991253799133859769857417242261518288137493937957259762417524922786221441566565327672258147219422785289784724464159141338597686467268438361268527886341174441634323819714522921165759934928766627242281926126172624571472687624617827778459611122564452256278622484561736349469112442991883727926721522921114275482173359762484798494655454275789429162933362992812739896359851796914623517793341255818116496334121111649631273989182719594489217423972624716212577349161677789122149518372944418587529151223147446586413298123415526111455699543111813657573396112256415828961817137351519483357328975249437755319119936359851395129888363654391786815995367165356152695912295713634244216118211381134678164952323622392874367458146781391662671674593277873693593277812295713331351659618166567558551635985545138661511639428182315762589145166145831341793339976291662638966762387118171137695868242268646236223163135219786298931162529572482139774341995223622361579512982174825412624738562913567681393111239666181711861518246318365439789429168182713143697813537894296238711762587152434518453661681827238242454275878265142541411891917934671558668119121246318124168536342831828194833556532189382217161511488111193229187161315142572885961175717868151348692197862724821176864415243453553446884791845366114881179952471674517585498136571253799139916718332521625295125985629679315748248254117242266864611346788944171439547187565127458413789771227552174239724429911811151629333116496316111623391921336578363427833722422815344473289733111614435854744651748454112862111932294421611756531518288153847865819411387161778739898455664251133254131638882577152292169857493883545225614274331695961695961417338111448817363411346787732771847385623871132648314819465814723896673815911411281367458175653226128195439217827771483965419952147185167838412356281417338912588182719583182889643651484538562916495231154868625891132659474465682422145973763396613789772745841429452136888261579562387119745827389541978621853442773277157683912376471734321442161167778929679319119931183134662232187968991864513244649913299973861181115518883119928644619911629441657599129216164952316818273836112154385491681249761187161312537991465794114679238764812315982577179952451686415667444482189792154179331588953676365164952311447731417338135676827256597113956935839976217666258277911952481429452494655387648262478661515491681899879185546116333711427433184334782375278539158147213446541734321948931564725162731455118777731518332521427433611757763182122957112558181154868244299969121443585864132113871672482183182859358613264831693941115688716394288479839976212598561154868114275418574818211381762587167173256935814678131948335452256199477212275523593827429921726245152838372482115425166945362564131683846116496317181691693941162125748657929275512537991695961219476698574179287219119933391921619238934797952968131436962387183182813426359691233515418514233755341413352494171816995296862387126247696555126389414314714482187672213466731661637157482195843698574145569911346781746435171413178539114395476157955572441514251762587894417192612631496463396678135336947722814714112818923981857483977431831233135676817444166258934726849263619523731231595996433553441249761189584163396633717337553412255331772682124774219644871443585391686199275315828961742397164548551888318796899489371472617181697793347874114314715431118843221734321775296385629674346177672173835919543921865556134263516656751411281126389497315813688829448921992753728859377553144762314617564138953573631956411147992712255333916862584321154868387648147387174239748657989845555926391662611851533331355188831855461397743143147116353917161559762458954811871721346673111852611629441956411621852132648336947735332518635371271976965555834913412116541561823157781353121341916232767833723412111368882178883484999918978616959692874454275143752814819461156887136686313991671726245779334126995133717373693591662687826523218545831314274334966742362231576839129417916111624744654421611619238132244517282641374939258432878265181911918655567268416858651984677175451182577177731516273143755341853442862113151425171211281769513587879812348499991635391312358863411734321142945283384714597371269951114477314577181415319124572338361147992711932299287411387161738359738954894417161923868847951686475712588836916626724821795486161318118695941863537195439212315931698311185261534441183134133859794893773277573396363421942278268527148396552292141389511912178942915243451138716371496583491718764156876314597371883727126591315929919549871893822162125796912128812212396665996431554631271971221495125783784394218938228762466178141843347195843153847815223269267218459617631827672229275516252958742275511871996791785391825771591567151223179952414718517914481766625268527779334845961186757577327715364598923987894297349161372921336578971139341211811638371496211995817695815676841923114881169251735736324429911447731621257823752197256342197113385971871613182315714294521978624381236339666945369691218251762362231677789151223119866969852729711393654391441566363421744416892398156472513527312881221889784178681518574858954873491678337218352711199286168586516737512463181483965179287236745812134196258912114898455442161127197145368761163922683157885815425164764841988715175451133919282173311851533432311811157692392564136218521699998126591316515426137761786815682422767225875291447623142945214839651645485166971316172191459737886341115284915647254461991829214157482127197135273183325213567681471851446199182315746638961377615344495296868847915687631683846119322954513188776514577181225533682422698574146781313264831699998371496155463474465272565177268239572436543912517812497611825176268527486579136484415324211796911358787827791156887258432129821711891911776729489392268394489212174571653561464371479927658194543111135474915364593795726258918292148358665733964421617692391871613137897716656752523754623511231591455699111448852292113567682543945713772644891627314168586514395479711391986696195439259762459156771472682173316818271199286617814343231819119421971119524818191191292165471493674581833252175854916131811893822835866183527115889539731581784796476484981234718764113669713991671467813179691464371142754969126117573856293714964179331219476114275413244649832534138951613181625891461756696555165558617814331116316983124774214294529933481437528371496179287255724413527327256549667412114146377518554611197267383615713771835271162731418655568742271744416156472524631818171256413579453176662512477421728264728859115688716858651982658197862126793217625871197267528978278622985272112862137149671876415526111348692152232644418373515898455771258367458462351114477311528491245723335154742992583491182921415869341911993157482993348339192983253399762732897131638814637751372923694777672242197145427586413215182881431471152232617383591235628528978166769469655511185261294179236223845961164952334928751686454513144156617928725431111873632391686274584154453518352711853442383617934677328971633371417933181911976116345629495498799738635736398729117625876561751217457154857316111623836122612884798112458318251767773151667694165154214678137389542866981841328129821727458493277862185294489215162698257716844411181115587529462351248337137695873289717444165289781421376694536197862171615173432114738714274334643771876413931138562912517892268316131815895482624769655513729212315914254149953671257837145973749869316676947369351873632137695812295716965551738359684441185344214859841237647458313177268276722115688719624681928145158289647648412457231621257226128371496242288338471683846116294411831341372921229571726845451342399168788412275529489314294527672213244644744651439547185546194893411876526959783372159299127256514678131738359139916715566491187172183123315344457137718776716636566642511338597579453134263514657941312353674584542751968525122351417262451181115179489118675751473871734321147387866151331116164144729881252494132648323218544216155522514617569832533674581346673813657593586196448754513464373412112382421411281141733865819437957212517858752967636558349159964316717321956411357363134263516555859964398729151282675914491662613244643149647571253694771748454676365168586535736317282641326483876246619833884322543111369477169192276318273491617121121693941518883799524413895482541516864164548512396661867575155866812578371429452145771895498715687634179331522326167173219866961788834884322199477241591444418126995142399125178154655435534416232761988715668289692517779334113265912174576985741332541948335161721956532166769481365728669839976216111621376958158895316858652644897288596178141744416395724118919111811158863416925171336578157683957137712558181348692288717979215142945247446576923941995219846772624766828927458494489252695946638913951291754511547149296793135273793467775296187767146983256935817868154138951643466298812198265873693548456662232411876171615169394156733928266991329759144892398179287214395473553441538478446199136686311427541936221349287119928612537992786221928145145973725641311811151984677137292111852612941792988121659618135273163337157743411568876198339529681417338171211217464351431471176258717989291195248347268555225734916165961814233956137761718169282669226832523751221495158289636543912921615788581742397136484415828963149641251781253799184738555522581163861781452897894287351484536947794893139512917262451667694783372476484125783717625871356768118919113668634966745875295713773896671261875176258778741236223122351476318215647251796919933482644891887765282662422872684226128172422658147217928723432313567683957248883641187614173384724461215438734916175451112477428197145915671899879331116142137614334999334813749397248216541568176951956411734916146175618796895289781699998763182617814126187515142515142578539144619914233956359858479816575994179331673751284679813657166769413931118615181518288113467897921513244641514251449642146983215223264421611996791145166136543915929911677789373515124976119826589489347648417868151962468662232181911976722274584759144146377514718516561751358787892398484561485984129619867434616999983795729448921847385714726179287281163826247175854992874135474917363414556991932183415914246318631947158895397113944216115849151211419483353311165693587147269711395733965148452947741267932147387143752819422781346673115486895498786817115688716333711356768742992868171746435815676819714876246337173139512914395477914489388358843229771961754511185748339192589548518883228147466389186151834323152434528467933919214617561675771269951177672161318114476236682895188832321851181115175653189584163396619463167672217242261199286335154156876318312335612821819119199881127197458313163942865819413426358257711479927124168516495231288122156472514839651911993989316581943371737773151788834156876356733917767216152174643517262451483965561282111246914678137571251522326185748371496146579435534419988141187616414471984677726841843347779334174441616979797853919731581362825421971186959491258813466731716151697979154453512114197862331116128812291258833717397315813426356581941984677928741421376977196119928642197186615117868155451377731538764819846776965553916862463185794536117571267932995367113669719685259953671372922947741324464991329656175163337122612811972671199286167778913729237755335534456532126793294893169596944892118919195296811811151635396137768479814758891512231417933565327389545693581857482442998176951267932111852612659131582896142137695498719624682887172382421635391942278164952352695962387178135333717387422713264831247742165356193277815526119327781427433162125783586654513593586125178884322178277798123411185261288122188978438159194893363428197143472685733967712581695963755341879689668289288717174441617242263351541817119543921451661985272168384656128212961981998818782656157954583131726245139916718191191245723252375139714835332593681698123497517711811151926126835866118111542399286698157885812921687826512356281673751417933186757517484541938241829214593586122755233111618776719644871166982199477211972671393118419231748454151223117484543391921199286391686114477315182888156761738359186555618998791473871439547141733895296816152942873876246125178143954711326591794891199679155926367232771674514577183876481998811181115164952366627121947651888312921611346781393111461756419952122755275914455118715263641661637186757516596187732774724461582896165558119121413895565321263894171816941591418857463896679125881187172827792543949327781669713121745717585495855177125814193576218521322445181711348692166769435534411669821485984827791697979726841429452198669614254144885989731585875291649523163135272684181911937553438966713365781544535692517347268171413119281455814721653561458313997386178479618514238217331772682115486814496421142754179892913769581187172156876315647251399167133455919988112558181427433192612648859895296813486928883616212574663891671732258432125178349287777315666276238711433491613181119121161721974299228871715142514274332786221181115363421766625611757148194636543917888343634211245831447623142945219422781613181167375112679328742271629333569358167375111427548237527995241974582143954724833788432293277839572494893843942912588199275314334936543913648441376958198871513789777712581885746522921662232555225143147114496421485984199477279346719382458752979346749667481971411488115491681259856122957118554611726245146983262185291864512457231366863119121151828822612889643676722163337116939419327783795725612821393111215438795486167577133657878337219564111271971889784155866859358612739891968525866151186959469655512558188358662846791631352143954719382411144881893822173835938361194833511669825713771821138312945526959193218315162693331351895841152434513527316353911144881972563549168918645144156612457239852721376958195641113325465617518776712982171617219186959437149619261266178141738359159299157743479548667838416232763997621358787154453515425161738359186757565415645427544619993277814314717631821362825169394151282618453661738359294774864132375534952968486579167375128266862113114275434121115223261879689333135111852616616371344654194227816959688836162125719685256824222261281142754246318815676946911134465411245831942278736935228147184132848254112416851827195888366864616717321461756146175658752917343212442991659618791448186757597113993277811366971292161217457113467815485731699998166365613527382779142339535736317888341821138155664914375282564131314369763182162125719685251877674118761296198294774129216167173234928755926318695943674581411281156472586615117383595612821883727732897347268198669619523731421376688479518883113467824833751888357339618716131427433161721917262452584327874152494185142317444161239666171211212255331752492146579418978678337249465538764899536716515422725658419231877671996791156674411871726339669731581544535194833525843218332521865556423996521371744416182113813628251235628139512947244614314713795721273989168182759156798931294774341211333135183123314193571423395482541181911917888341776721827195134465415283831742397131235121341918958411827195288717123764713264833553441215438132446415324212685275693581449642133657819564118782651758549119928617423977429929448921421376124168516838463755344986932745841314369185748438123178883424833717948911358787228147581472841923116294431698313325437553434323862113171816994691158147212134192483371974582122755218615181362825194429738562912537997995248217331788834926721228147174845416273149933489125881978621695961867575633966186757578741166971389441713567683735151118526163942813971481766625179691896436411876866151161318158954814274331156887116496319463161538478258432189382216959668242276318212719714637751322445141332866986581941433492927554542751465794458313726845471491253799112458342399611757184132891662633515423622312578372725651655588318281796914986939125882967932564135814721156887272565127197282661635391691922377553185546115889531712112111246935332518271951124583242283795722624744216192672111891911271971348692779334124572348254137957217565369655519826581322445228147139714813688821576839775296718764133859773289744619918837277995241534443775531437528456294184132818716139953678944171429452528978185949938159111811151926126617814545131762587264489777315175249216878844219711427433127197134667315687631629333182921412982172826615223268197145289781352731473879973861726245126793215687632644897934676218521651542161721966627195641161579514476231187172866151565329166261714131179691335154952968189987937553419947721972563738954357363183527195296856733958752916939413371737167458661513795721948335146781341793335938254916815889538479877125817181691128621187968999132918756513755342745841332548358661677789177672724821116294461579518978662387175914417827777732771794891184738515384783856299529681861518197256318837271419357456294162933338966715546314254141183134128812216777897349161629333975177159299187422747648429679358551823752162327613749391998811514254239982173361377615869349872913856291677789155463176662517585491437528654156633966817695143349888361576839894417162731484596113587871524345173432179548669453618312339287419543921871613136282531496416293338621136642517591447853915431112463181665675823752611757122149593277817121121613181123159355344926721971139775296155261116979791736341397148795486159299116777891211481567697517751686413587871469832629928926721668289178883412154385935865733961534441843347423991118526185142334323896436116496318736321734321164548522814712739891193229268527575415888366985741183134591567847981437528286698161721976923917847961677789946911147992718877653331351845366635985115284937149613123531496497517719564111615211528491784796878265615795698574182113813123528467915546314597371298217115688769251787422752494146579414698322967936642514118761366863173835977125835332518716131578858118515341995271472617868157833726925171879689134869283182817484541229571819714153242115162691827195557244446199189584118433471659618971139116698216737511114488676365134465413244641998811992753166163719947721853442444181843347143147148859858752915889531471851133859763194738159116838465754151259856141128148657947648418594991447623932778191199365617541995274299217686441181115148396516697134966741714131142743313931199738682173316777899711391399167466389133859713325417464354946551413315384781322445164952393681663598545629416434661653561129417916131811681827876246156876316192385895481294179985272942873298812183325216838461292166339667793341871613928746864612618756178146723271219476757125841923189584124228892398193218311629442483375754152846796137766258937351567232718352711534447631821314369154251615465541467813136686351888372482138562955724411326598116387692391457718175249261781492874355344141331776726965554179331673751188574687422716273141827195296793676365482541268527664251294774692517142743318796891978621362825184536697517768646171615629928498693168788466223281769516737518499998358666218521784796169192248657994691115828961366863119121815676769239141128111992861467813152434519382413567681249761177873911649631968525164952313951291451661345249146377536342137493975914414496425552251833252152838371876418191199711391762587868173654394845615768391197267133254144358536745819564111469832192814555522512659132988121968525254394126389434524917484547631826137761651542186757587826528467915364591778739581472184334793479783384767232784596131294517928727672299132914415661645485187363291258819866968358661374939144964211286219852726561752281479368164583131576839868179327781152849183729518883312945114275411467923977431166982162933314657945855112719716596183997621449642514845254394168586517444163351541183134833847143954712659131267932145368617814186151812598561776723149641974582175249251686437755313527311649631877671526364157885811871727268417686449953671887765145973784596124631888836357363769239843942132446415344454714915586681623276611757169192216515421677789187968917484546723278681711144884461991197267162125755118711912192672128669825439428871724228989312119951661637125178164144716757713789771586934165356115182882119955592631588953151223111629443714968439421316388482541783372115688778539138562916232766985741465794413895151626916939414118764966741714131874227228147148598412719711871721185153153444159299118998791473871972563862113184132812315942399512826197862662232135474916192381219476282662967931298217121745778539137351541995212941791685865498693168788414334951686423622355926344418528978146781377125898123415889534461991338597142339515485735249416232766258918191193149642442997874114476238964366218521782777682422186959412275527349161334559284679377553944892868174825418156761453681322445168788411649631534447732778116381744416126995114233951148811777315148396538764811992861582896154857316454851879689316983165759912537997268411952484865794239945629469251772885914395472745843452491627314158895398325363194711629441746435119121987291559263198467752292199738618473859933481887765847981794891142137613769583452498641328338472422838361577434112256435938214213766359851251784663896541561855461165356177327711649631847385125379911831341657599179691166163711669827934671255818442161161116216333718439421314369139311575415135474913244648964362644895976241754511335154125178795486827791578858165961855724494893474465124976116273148116381441566312945185142355926336947713668639691214274338883615364599893125843211629444482186581948136571778739151626912921619523731249761825771178681589643622612841591411447732947741399167763182811638421971696555134465424631813931112598564421611225533862113118919124631818594991465794145569913769583371731112469728859134869296912172624518736321871613684441518883175653178277755926383788562589182719529275511447733432316192383735157712581534441782777189786349287144358584999915687635693581657599862113176662598527215748211568871512231599643912588175249295296816434661425414896436163539169596244299345249182113825439441793316454858459618176951724226518883486579183123336745881365717686441861518167778914617561326483133657818594991528383195237331294558551783372123764777125814698322745846218521419357121745714758891166982122351412739894461991578858977196581472187968912497611756531348692415914211995316983165558158289617989296339661889784166365611629447833721796911453686763651673751183325274299248859818433471681827488598151223181769517969117625871342635179489118655569731581766625186757548859829881241793326247133657891864518554611162944182517614173381253799246318676365629928454275158693412315914133244299167577674346178681592672139976236947711548681397148113265913143691427433185344288432219786251686416838466743468318281877671738359987291369477168384637351576923914254141397148136888216596181827195129619813244641946316165154211447731736342685271821138791448124976111831348984553795722685276622321364844192612617545112442991899879162731465415614516611152849383611651542146983219382454311118716137147269792151267932195439213486925673392725654159141314369171413118312331522326847981455699122957137553418675751691922817695116698275914414758892846793149641526364165356119564115673395935868419231911993146377538562911568873836116172191348692613776575415126591333313518837271134678922683337173694536823752112256463194711831348439421152849397743652137385629226128194227842197182173384596128669886413217989297147268176957389546178141954392139311116698212154381617219142339519967916238715148451437528153645913345591673751932778569358835866365439137493916414478439421215438123764728669848859829679318251767813533331351661637599643154453517524921887765189584117444161958439751771734321975177985272196448716878841766625111852611346787954866117571984677165961831294514375288923981334559488598759144126187552897823824265617581163883384769251777933416515425976244562945249488634115344419866961861518452256173432163194737553413224457692391542516187968955724416818271544535898455133657872684174845418756511122564163135215586681784796185142312941791853442413895228147179892988836141331376958157683917343218843226117571193229115688714496424421616218521296198232185195237314314711578858133455918594998176956359853977431229571132648318998791827195952968116698248254111831344199523331354825414744651427433236223498693876246136686314314711685865171816916353941591411528491237647129417913163883957241889784197256313648444583134179331144773134263555118781163835332514294528479818473851528383296793166971344619935938212659131211415768391437528228147458313367458176662557137717585491354749975177175854912416858863411255818147387355344145569954916812659131475889365439116496351484541591477327729477411912111568871124583198669628467915748238966717484548499996622321691922167173237957274299225843213163881613181137292151828816192381556649182517619463161433491829214145368126187566425113486921677789183123325641343812338562998729171472615586685249416777897793341191211853442573396189584162589129417915768391718169337173176258731496437149627256518554611669713591567456294129821711851531229571167577135273549168668289144156682375256532123966696912165759945427555926368847944418124168518978655724483384717181691883727185344216757728467917827771336578126389433919241389571674516313521324464674346114881163598518998791393111294179112862114698321887765166971325237512396661534441417338122351418776713729229881215425166157952866981952373377553969129872911344654991329599643827791635391469832158289636543916757738361345249144762316616371197267421971156674412174572362231938241724226742992874227932778571377551187116698217767272885913426351574827631821411281136888212881221956411868178378853533251368882357363444182119951576839278622694536232185446199151828814395478257711845366196246812679328419231592991125985611528491833252799524547149196246834323124168598527217524926258911144881714131176662534121117464357914481928145162529519422781786815163539579453195843145771842197119261261411281698574182921497719644619935938289239846437268527732897347268188574615324219832535511877369351255818456294395724666273714961879689845961129619817787391514252685271215438551187126591335938218978614173381219476113265916777891847385843942143752886211311932291869594154453527458428871767636518231571665675613776174441618796899913291453681968525193824274584186757517625871631352757125482541458313122553382779623871142541414415661148811169999862992815546393681613446549226834865791726245126793217585498661519549871356768132648348859813163888277954916811447731778739593586197862888363412119428731481946954987494655154453516939411613181242281683846126793265819415869346157951512231133455919422786743461742397145368294774557244567339438123946911121543817666251148811123764718211381237647569358164548511185261988715121543813931187826514758891629333166971312194761294179112458323218519927537874158954818998791829214153847812618751526364635985981234841923126389484394237755317625875249414314711461756757125312945918645423991772682165356123622318655562564131273989333135734916111852659156762992811871721269951587529199679118534428863413795721245723286698413895121543813446541978621235628268527526959194833518473854482184583139973867712581469832116496367232788836147387155463111448813668631334559144156651484527458418675751219476188978472482115647251687884142945216535611752492841923894417121141899879135676819564111441566193824258432464371368882795486165558411876985272169797912537999832531439547176662579346737755312154386985747429921364844141128156935814617561746435147387823752134263551888317868151742397282667288591122564163337186211316495231134678127197886341129619816111623856291271971835271474465932778194227816111628964368378851134678134667318736325612829711391265913926721146175616697131354749178277795296825237552897863194724631818332521215438791448146579448859816697133371738237527611639812347167451237647312945124572313123512739891255818196246813971486723271574821378977256413817695147588923622338966716697138197144461991885746591567577434399762157482147992712638941996791819714494655987291423992624714718511146792124168518554614885981653561258432458313153847815485731146792575415132446414173381627314248337145973715788588116382543941847385157683963194762992845427514133371496119726718594995451314233955289785491681712112145569911427541241685112458317565323824213648441219476158693491258819887151481946335154698574246318136484415142515869341221495119524814375282624711912189441718857463432317363444619945629414577181861518143349194429717948915289781273989154251614819467268438966712154383856291342635196246874299211387161748454197256311811151944297446199114881131698313729216697131861518246318262474845617121121322445116698217827771215438134263582375251282677327731294571674583586619119938984551324464656175599643165558847982887171148811198871594287312235141336578145166115142512719768242215344438159193479719119939347971524345193622113769584522567853912584321895841131436933919286817171413118695941136697482541977196452256246318347268174845414758891734321135273238242173634132446417666254179331742397242286925178237523714961657599932778763182345249375534516864154251618231578439423997622967932543941336578122957111387169166264542751673751611757121745719442971962468524945128261748454486579555225193824734916144762371472612638941427433124976114496421467813184132817726823331356137761833252163135239774397113917242261269951163135268646198265814738712154381998812685271294179716745995367813657199881175451176923997719618211381235628143349179892916575996783841861518114881114375285612821132659492636526959143147113345591142754114679268242219947722988121681827516864186555669857412194761522326164548578337298931286698165759912699511627314599643843942121543819442971189191387648662232127398975712544821849667416919221534441324464575415179489118554611546554476484184334716273148843221166982143752812194764825411461756152838378942916394281128621415914742992126793298325344619912881221138716122553313345591762587197458214233951465794173634185344298527212941791611162676365164952354916812235143694779267216743462463184623511417338817695123764724833718231573573635895483533255128261473871395129884322438123488598151425874227232185192612613628255552251148811162327657137761377619786219362216178141649523176258712578371251781794891194833514556991312352523751265913779334197862589548197458281769581365713123515182881681827121543877529619483351649523948931718169112862186211358349111669826985746844411564725781353472446123966619745825491681651542136484413264838944171772682126995139774319846773553444199524159149448928459611122564264489969123371731352731467813211995864132597624151223177125811528492745843735154542757995241267932121543827862247648419281455552251413398123489239817464351718169543111122755241591415283832685271528383142743371472612921611548686198331437528192814519584318716136682894138951851423559263155866857743457339615465546218524623517672213991672584327349165875291742397159299127862254714958147289643616394288621131399167176662548456162327673693513789771269951821733177268215243459267211699998565321352731782777162327682173326852717545119933481758549167577199679118776713224459872916178142261286258977731531698311831344239998123419624681869594158289655926398729161781425641314516613331358217331968525112458349869324228579453175653184334755926325439459762415647258459614663891847385512826135273195843771258156876312618755895486884792745842119951465794395724211995617814625891718169837885166769418635375693581788834187968918171188776591864511124697631828217335188831635391247742119121152636481567612497617328971376958162933316838461667694171211272684742992126995114375287389541249761115688714859841639428738954284679827791219476145368979215162125712235145653237553416454856218521235628152636417767212739891354749187767252375841923868171112469143752814516611588953116698215889533331351843347567339126591315324212927551926126134869247446544216111649631611162789429131436989441738159178135315768391942278264489144156684394214415668217331911993141128124429991864533515434121149667411871721625295118515314536868242218695941641447985272132244517928721885746365439176864419786217181691738359462351178479623218573693512457231265913189786545131294179134869236543917989297248211255818188776575914457339673491651888316878841253799789429198871515768394118761473877389542382421378977827798419231467813367458148194611366971288122815676186555612659131219476841923129619819321831867575119726751484511568871231596359851411281387648165558147992768646155866867434611225642119953957241956411171615121745773895411831347894291326483169999866828915223261819119198265816293331423395158289614617562967935915671788834174643517484541645485134263594893549168137493915768391592991971139181911948657919624681473871294179139311785391391686142137612356281322445734916474465526959185546113769581362825294774981234199275316172191837291744416845961244299134465411286211883727155463163539163135268847967636516535611974582115284917868154159141459737178883436342134263598931272565176864449465599132917161512457231136697132446457743488836131638811992866561751568763115486819988176722133455923824227458416858658641325794531851423789429676365122755217585491185153415914113265919685251536459565326299281968525464378237524441862387114133141935715324211641447122553379144811245831411281262475168646359851879689892398698574456294232185141935751484514334916353952695912255334461991239666181911938159111427541342635813657462351158491511669821754511629928789429151425111246979144824833713466737813531443585152636418978617565316111621199286129417913688827732774643711225641798929474465189786254394811638686461699998589548246318126389455118719564111136697125783717565319523737874116172191219476187161395498726448989441711427541334559256413134869214476236117571829214827792321856743461538478827798419238883678942919543929711391633371139311142541456532456294145166199334812376471697979135474987624613123512416851344654815676579453184738543812384394214617561376958123562816676945895481366863894417142137644216119866968641322584327571255511871665675112256491258812255331665675496674126591314133113871616414471356768912588585518338471358787134667318514238944172321858863415754151185153189786884322118313415162696723271148811779334545131512231129821718292141118526181911919846771134678199275355724412558186743463654393432312961981964487547149183527179346768847933515452695971876416939411821138339192298812121543833717372482179952412275526178142281473432312558181625295187161318615185713771324464522921993348115688724631818594991223514116496311225641877671996791194227815748218756514643761377672885991864517625875451394893611757189786125783797517714334917928728197141865556954987139714814738714133199275352695986413216818277288591463775166163718251761259856696555195237318594991936221154655419624681532421153645914496421397148629928125581814678136299281661637165759911447739347971673751272565137292195237387422726448913729212961981314369178681518938229166261879689496674164952316333711665675833847173835916212571376958177672494655353325113467898729177125845225611548681714131187968911669821241685688479633966888364885981675771556649464378116389852721683846442161831828139512915223261928145898455373515154251612638942786221166982165558162731427862218776712497611138716167375117181692967936339663452491156887118717243812316111621835271385629185344213123517423977429921443585345249141935748859812194763412114825411661637232185446199282663553441259856775296781353152636484192373693512214956541566783841841328166365619119931744416769239182719531698313264837167453714968681796912678384156674416616373351541962468163135258349116293336965551568763312945199881154251678539117787391461756188574616111626965551948335589548122957117262451142754167375195498784394244821815425166682896541561962468282661657599125581811427541944297183527112416852442991459737248337139916754311116152151425164144748859816939411241685874227438123977196196448717444167288591457718125581815546319644871512231173634126793299536714657941582896166971318473855895481528383118111519382465213714133775296363421576839151626941793373895436947712214956258913951292442991974582199275392672199536719685254421616682891972563184132888432246638919321831835271179691413895282661124583165558139916715828961794891785391492636166567587826559358633515416434662786226783841421376833847185344214617565713771691922981234154655425439446437349287781353423991615214536815344466223219281452564132362236864615586685572443432318796891261875613776827791461756337173783372162933315687634441822612815485731152849337173345249656175118313491864513123568847916172197631821554631368882148396541591425641363194781365715465541712112151626976923918958411734321147588946638912659133674581483965189987934323153444341211157683954916816454853311161516269122957112941791857485915671183134197458214758891296198166163717726821699998161318117181691245723135676866627171211214859841516269123764714254141479927196852519261264845619826584421615168647853912685273149649489359358624631897315812921612255331982658136686318413281189191815676791448476484176258712356284986932866989388351352738419231461756864132165356149667445629418796891645485732897198669686211317827771463775353325811638196852514738717847961542516773277561282343231641447172422681769558954819947723593821974582192814517242261461756168586596912154857318857463916861788834125581812416851673751813657876246122957197113911326591423395185344214738717161519846773331351122564133657831294557743498123418453661851423944892113265982577113264831639428151425236223161524946551538478164144715889537853916682891819119769239122351478135316293332463189549878762461817199132984596118594999852729893196912662232178681515425168762461936221934797837885139714818675758964361754511866151124572319463166561758641329529681346673135878736543978337223824261781497517754311112396661461756284679199477217161517888342846798136578176951669713423994986931693941668289189584166828919422787853918883615243451588953226128196448713385973149641855461143954716495238621136117572422819119931457718164144763396636543918716131986696125783717726825188832584328742274482181372923957241574821899879146175616676946864619422781128621196852548456147992763194714819467773151247742272565153645918938221249761476484668289113669714577181239666528978125178841923878265597624633966775296126389454916845427558147211326595693581798929194429772885913729281163826852716111624562943593827268417141316642511772682623871154857344216162992844619995498716152767223452494482181251783896671859499154453572684143147116979797672211932291483965132244565213716454851742397411876154453518514231457718188776571472611629441538478129821713688821794891559263162731419745829893111811151514255855198123413365781465794179489174299241793315425161344654696555399762252375692517163337178942944216116596181986696165154226852713244644845617464351344654256413898455195641116212571827195189584111245839388351364844165558132648369655512982173795721893822162529516454857187646985741778739119524823622318372916717325693582887171611162163942865213715122313997623654391685865126995111568878984559953671653561355344736935179287212497611776721742397141531934524919745826541568479818675751451661182719592874137897719523732261281397148866151454275111246914738739774315526113573635451367434611366971699998183729165961814274338661511988715164952368242213951295168641393119812342644891346673178681555724427862234323912588732897142339537957211366976965557894291532421347268738954662232164144718615181683846168586519947723351541522326543111835866518883524941879689178681579346715445351166982454275783372137695837755317423971227552353325189382277933413688821744416498693122351415566499529681857486178141738359181715774341221495187767119928619745821459737371496129821738562918554617995241863537115486813163881368882191199315667446642511984677163135216152144964269655519967911479927262471366863112862161781412517819887151946316888361316388395724993348512826377553658194557244173432191662618837272887171986696736935575415194429715869341522326177672185949913325441389514395476157958237527147261463775131436916737511734321133455974299214678131461756583491166971333313511992861469832142945241995217989291796911271978984551857481734321847985128267429924623511629333399762119928698325312679329751771271979469114885981621257177873915445351324464178277711447739347979893113325416858657268499536711952481251781683846158693414516611463775172826419927531986696153645987422711144881794891169999811811151847385296793379572193622116777891788834316983126591378741123764729275515445359933487288591792872142339512295712442993916868176955814723957242523751869594198669682779175854958752911932291843347184536616616371413323218534928715889531433491716151142754716745123966616434665834918681713163881574824986935572447732771267932158491554714955724413264831817198729111245831962468192612619523737954861716151829214728859767221465794152636481163811629441663656365439613776466389185546144619919624689731581885746258432349287296793666271193229126389446437128812252897837553481567665213716172191994772192814513769581118526666277611639953671695965471491954392922683248337464371255818246318164144713446541625295918645145368294774876246139916738764838562916152134263516273141889784912588154857312194769771961354749296793168586592268361983359156762992862387165213724833719362217611635612825713771845366116698269655522814716858657571258762467732771663656662232112862116212571683846847981827195145771816454855249417363439168617827773755341273989189786482541154655413325472684164548514496421245723159299116515428176951421376115688712376478237525188831247742528978196246812376471627314185142316454851617219466389862113337173135878717464351219476142137617888341485984167173265819415788586238716157957389541986696518883124572387826567636593479726852713325411629448237521225533948931451661151425112256414133236223116294435332551484533717312315973693561175716252952523759428731695964381238479817787399933484461991776721526364113265914859841962468296793158895319988115929911522326186555618433471615219584379144879346747648469453616919221546554169394124429946437142137662992813163886359859347974461991372922463181199286977196118313468444192672118473851467813134263549263663598557541579952413426351221495785391167778918675751471851775296155866814233951754511938835161721913385971998819913299792151419357847981358787742992152232635736339976217686448439424926361479927114881113264831871613142743368847916434661429452256413864132131638816111624946559751771659618162125745831319826581746435147588939976221199521199598123418352711294179948931883727971139154655418231579529682947741449642121341933717319261261235628126591347446524429934121116656751542516132446457137799132988836132648313163887611633391929125881653561666271455699934797617814442161185546119321831699998155261148859824429948254111286219913291857481366863166567561175765415619725639469119812344885983674589368166925171883727262475431114845679144818332521829214389667169394114476231443585795486152434514334911912113385977611634421611324464197256316152268527371496355344199275316273147268418514234562941712112474465593586668289583491226128152434538159195296818211381936221118313418695941564725187767156876335938265819418312336783841322445773277849999316983125379916333711187172292755182921415364596218521867575148194671876413668631546554969121441566849999849999162327676116315566491677789732897164952314314711421376817695189987937755319988199536774299287624651484567838414839651776725935865168641338597157885835534449869379144815162691728264118919117847961554637853911851423182517618292141247742161721911932291296198112256419967915572444825411675771443585126187513648443997628863411699998147387183729926721888369166261411281458313559263146377515283835289784199522321851164963177268211851536218526359854663896359856299281738359172826486211368847982375235534412679321227552565321461756421971591567288717795486878265734916163942817726821312351578858171413112114714726787411897861425414674346684441193622118716132442991213419141339327782624715485731928145167375194691158954812315915384782927551465794125581889239873289787624612699511613181975177123764782577112982171522326121947658954866627185142318716134744651261875791448135273736935137493999738668444199738617948911758549126793217121127995241164963971139184738514314712947746743461869594621852191199345831312719713628258641327288593795721336578916626845961188776537351541389541995212477421928145353325114275417343216157958459618843222281475915671397148165356115485731655584986938237521623276492636177672171211216878841821138195843411876166567511629446581941195248126793212982171132659916626198467711649631665675761163666276157952483378277913769582362231413318958411441566763182864132135273152838393479717827772321851871613131235144156615929911512231199275319866961447623732897442161126389419442972442992846791744416391686985272155866863598519826588742279731585754151655585653214213764643718413281968525662232159299125237511286211992753518883111448815849154522562947741227552153242114375281181115172826415667441861518159299117141311522326411876182113811669821552611567339152232611669821271971752492157885814698321269951864132397743169596238242131235547149185344263598518534421288122286698186151882577119362211348692198265814718511267932866151123966684596169251717423971667694146983214395477692391693941196246849667411568871376958819714129417994287313789778277914254146662716434665431112119951673751175653152232616818271738359769239153645919382412154389832531926126793467193218313688824986931271971669713775296134465458752915566498479847446589441712154381786815179892912114666271944297385629168384612457231556649184738554513196852551686416676941296198125178158895373289719362211742397183325211427541984677133657812134193331356945361574823735153533251197267294774137897713547491665675452256148598494893168788427458492874186151852695978135316959617585492866986581943997628681715425162442991744416193622156733977731545831317524921655589388351784796119726716353917464353775531841328182517613729216212574219711417338444188257711988715114881111568878176951683846169394118675751336578189786714726862113183527115485731544535188776515566499691272684123562819422786642511433491376958193824129417918736321588953954987799524335154866151137897735332516111621617219987291254394133657839976273693576318212396661617219162933316353945427519523731136697442161448218379572692517137897712214951413316293337187641857481996791158491537755319281456299281467813115284916414471639428116698248859812941791667694892398119121184738594893462351736935528978145771816596186864692268384596133313511144881352738984551526364512826983253589548163539246318118919118534421657599296793522921172624565819411144881235628314964991329151626987422716636561968525484566642515794531538478494655116698282577189441719483351875651918645198467736543916757724631877933445831357541533919214698321221495591567174239784596111144881726245565327995243795721483965686461633371979215124572311952489368164583136925174179331936221888361645485884322793467195641157945345225658349162185219321831433491296198163942876116315667443533251128621165356198123416818271481946176662558147211366971734321116496317827779953677349162564138358664865791439547116496318776719927537672237149617181691235628158693415869341699998932778821733226128971139132648314536877125812558181897861298217111448811649639327784663891726245173835968242217181692887171736341675776682891972563174845412618751958431546554184738516697135552251693941114275414274331582896125783733111615788581134678674346169596973158127197248337169999812376473654396541561936221143147197921535736323824234726877933472885917383591241685122957138562972885912719719725633129451187172494655567339716745188978491864517928721576839144964212376478318281241685114477316353911467927429921255818146579412174571136697123159391686198467716252958136571431471795486759144918645161116214698323815911259856175854916575999368169428738843221693941466389157482793467163337113628251962468516864196852561377615364591292161758549174239798325315667441156887569358172826424429927862241793352292151888325439437351511225648176951968525164144757137757945335332556128281163814597376238711823157654156148396554311122814718514231926126114477367232718978611649634744651481946173634147387262474744651724226121341913345591665675162529516333719812341875651619833143752819866961249761633966118313411528491122564472446125379917888341869594147588924429918756516541561223514175249215929911954392125379918615181447623333135121141653561182517612659131992753184334735938233717379548637149623824212598562786228479814153191992753831828516864183325211447731784796179892915182889872911542516462351258432575415155463193622118958411794891113467816939417187642927551193229874227761163156472513648442947746662716555882577115243453412111992753547149716745142541433515424429918433477591441869594188372712275523694771393112866981378977199477216939414562943573631142754773277145771831496418655565996433654399731581756531853442114881112679326864618514231964487155664931294519967911911993169394119947728116381574821544535611757442161121947613385973674581578858131235146377569857415788581112469565321156887979215112256417363414314713129451259856163942815647255915671522326192612689643693883539976212719716192381249761198871513951295754159953671582896176662556532656175365439121745719119931219476124572393681676923924228144156662589555225199477212921665617565819411245831195248155866882577111225641298217569358152838333919217847964441817121121772682837885771258446199199881122553319725637288593775531663656199275317726821675771261875896436375534163539474465172826418958419771963836116697131522326142541413244644623511166982399762252375789429635985833847252375652137359382193824129216168788411629443957243634212497611298217124572317625873876487813537248218217331259856922683938835759144847981225533186353726247284679399762849999162125765415677933472482118231571649523662232112458319543929731581663656926721186353715465543694771128621438123936816191199312517817444165471498499991316388157683911891917429929469111576839898455174239718514231522326781353153242131698325237516152676365184738565819488836989314482188964361415319341211163337195296839572419362211574821191211447623898455442161119726712174577833723412111726245918645128812227256519584311649631314369284679195641118372977933412618751439547296793569358179691946911166971311488112463187793341568763182315791662666828914334983384716757718796891251781819119952968288717498693179489122814711972671148811139916724631819261265976242644894159141152849161318113527367434676318213587879893118514231728264732897472446145771812739891455699124168512618752483371845366946911421971165154283182882577155926313547491837293432321199518292141752492183527175712518312331191212564132947741691922292755278622135273142945215384781552611486579184334711427543553449448929751771546554335154549168113265951282617767299334867232783384734524917565317181692543941473874461991193229736935172624513143691536459185949911245839327782543941843347579453292755136686367232717989293412111582896438123114881111568876521371691922175451177933493277817625879428736763657248216622321399167825771946911172624516414479448921574821352736642519872911893822156674411629441152849543111682422724821438123137897715566499711391431471145771877933416818277167451823157125985657339618897841645485126995183384716515421415319371496146377511447731296198155261183384714254146137762584328358662887171376958952968169999818332521292168964361465794726844562947672235938287422719826587611632685271649523118111512255333876481685865916626551187526959345249316983264489714726154251613365789347971132659417933134263515586681879689654156151223172885961377612396661326483821733823752145368775296559263174845489643657743499738614314715592635915671617219474465918645341211118717245831386817771258165356162387189441793277851282648859816878842887171619238831828417933186959416959617666256985745289781346673522921591567343238621131473871655585592631336578137695868444119321834522561362825164346646235119321833674586541564744657429921364844997386363427793341475889528978196448762589178479618695941875651171816918877651687884232185928741619238547149188978413325414435857672223218517989291453687995247288593815915128265572445269594845612114789429367458129216155463333135583491171816915243455451337957213547491932183617814678384137493997719656935824631891258818251761336578135676815788581625295187363273693562185213466732644892624718332525168649953678459615229211118526123562813567681421376161525855118271953755341972563547149726845794531819119228147569358163135249465541187615142518594991746435123966673693549465518433476662716838461251781239666165356116212571996791623871272565146781389239814839659751771461756831828411876516864819714187161349667449465529477492672114415666682893492877813531166982124168561983314698327571251657599791448136888241995218635378136574239987624683788514698321411281168788416636568358661948335696555122351429477416313527773151431471137292187968916333714421616723274522561778739197256316616371629333444183876481845366113871678135349667472482113143691136697799524284679454275194429765415618877653391922362231998812463187853912786221697979196246818958419549875774341831233472446121341916495231358787123764768847914193571395129135878752695965617512255331821138157885816454853553443452498459611514251146792189786371496397743148194611972675188831528383817695817695142137665617518473854966747954861724226528978122755219321839872911395129114477328266158289636745811387167389541421376131436918554611772682977196186757516838461128621136484452897861175761175778539112315945427576116311346786945363311163129451962468666271695963169836299284179335713779953671617219236223682422154857316676944219713169831766625761163228147137292886341524941473877793342927551766625168788493277855926349667414294521843347184132813426351566744171211217625871613181169797912961981524345316983199881587529377553922683292755799524367458718764123159112862128266876246158491546235177529613264836925174138951197267118717219321831237647114679211488111249761165154212114522921167778917444161578858898455167778965213778539112194761483965123562836745811649631857481447623583491621852365439142541443812351282616454851697979119726742197118938221756531847385115688752897814233951378977162125714112813634215384786198331833252387648132446418271958378854441848859819463165895485249433717334928781567661175711851538782651544535888369428733775536258912921619887151257837369477175451119644878338474663891736348923981265913155866818655561718169662232144762379346717343211762587282663311161128621151828813587873654398681719261261566744183729264489133455919745821655581942278172624514375281796911338597849999785391298812197458216353917181693977431261875118515314678132786227813531673751166365614233951792872236223938835115284994893952968161528116382261281247742617814145368153242133111612618751889784187565118332521554631546554438123785391144156618171728859113265958954884394231294513951291352731411281166971315748212659131829214438123165759965213758349111124695148451984677133657819483356743465935862786221873632383612846791556649166365611286219691215566495229211833252896436111246929477415485731358787759144175451119564112281471926126194833554513178479671876411144881863537462351172422683586613991671419357164144715142541389514274331859499674346164144718271956642519428731986696178681588634116313526258912315917484541451661692517333135183527118756511185153111448894489213325418877651417338256413262475552251879689147588914859844138951368882833847118717238562916152178277715344483384783788582173317827772442995875291225533139714869857411548685168641185153194429711144884643718271951831233178681558349145427513143696521371431471144358518413287793341473871378977549168121543817928721867575118919139976211851531421376894417154453551888312699513391924643784394215929911344654198467711326591592991124976117141319812341538478112862136947714133171615771258565321712112131235136484418211384966741154868413895196448712174571443585381591157482991329718764399762696555526959763182238242166365619947728641325471494623515148451825176166163711528491451661137695814516618883618574818998791641447182719534726818271951399167113265916495231665675226128125379916959691662675914498325314758892846793432367434684798137292176864448456183123318372993883534323173835911669821873632127398983586612497617914483755341241685252375228147462351195641111528491978622624714758891542516379572633966724821349287577434777315849999122957116333712725651185153125783713688821118526169596341211312945142137611811152442991588953153847867838414859849771961152849112256412638943755341114488985272345249262471288122175854917888341399167413895684441694536633966162529511366971592991692517296793926721718764147185197517717585491261875119121177268218998798257711437528134263528669811286211625295179287211811155976249913296238712947748843221667694114477335332536745814375288923985935861699998151828811346787995243331355996438419237429929448921475889946911139916713143691154868843942512826178883412477421766625524944825411261875158491548456148396559156712214951148811777315113669774299245629414415661988715161923897517713163881746435174441615223261681827144156634726811528497389544966744522561221495125379955522598931498693174239736947721199518312336561751768644189786793467995367161521193229155866839976219685251516269793467476484143752818857461114488981234139714839572411185261227552528978144964212699519913295774341651542188574616353914496429691212638941164963161116257339668444124631849869341793359358651282639976215647258197149448923331359448921425414575415195641111629442988121229571799524421971131436918453661134678118313413668634461991187172549168145368147387353325128812279144813668635168641536459136888279346715223261114488141128166828935736313991671326483357363316983178883482577116434661996791694536944892353325676365126793219422781578858569358123966614476234926361778739183729389667144762312295715653233515497113919786216152827794461992725656238711251781889784833847174441616212579347975592638176951267932126389417888342281475875299368161845366837885159299118736324199529388351996791254394444181439547514845166971377529618796891772682116698262387192268324429912659138277916454853977439469111788834413895198467716252951544535876246195237352695951282686211363396645629416353997113981163898729126852714334967636511346781463775187968919422781356768373515164144717423975774346521374482181817151888338361169596119524811932291235628161923829679318655561485984884322785391825771944892143147198729176318283788512699516884791237647736935898455167577551187182719516172191231591465794186757516333713412113674581352731136697153847815869346985744239943812365415612154381114488179489114637751992753847989489311669823412119711393714961544535692517866151119928624228124774257541514556992988121522326898455112458359762436947717868154764841734321166971316575991629333781353918645724821113265913648441574824482183815915128265168641778739165154298527252897816979791154868971139146983224228135474914617561889784991329134667314213761742397122957118938221344654613776196246856733912679323351548136571199286486579146781313466733735151183134559263694536692517345249147588912497611663656165759915647257248214179331132659936816121745794489218938221227552169797999132914657946864627256577731571674523622335332513264831623276135676855118743812318574814819461944297144358569655519261261374939155261138764819887151623276652137448218734916835866145973783182813991671213419182719576318218191191994772494655672327355344551187168586539168615546323218534726814516611558668635985175653154857337957218453662967931653561114881113628255128261421376696555187968916737514542757369351665675438123363421261875864132456294179691262479166261829214119322965617518191191181115166163735938214294525855158147274299215586689913291588953518883187767158895347446513931165415615768391372921948335147588981163814254141748454111448811669821821138113871615243451542516193824868171552611185748423991653561118313472482127862218756514239913587873836113264836723278338471768644126591386817793467944892186353712255333351541534441526364157482119726729275578539179548637755315586684179337712581899879194429715889532382421712112922683736935137493918352711657599194429718574816656755148453815911843347312945486579112458316636563957248439428419231586934635985678384635985236223983253178479613244647328971542516118111522612888634176318234928733313516172192281479267219388357914485168641185153345249716745314964767226117579125881195248161116219543921851423585514865794643777125818211381782777781353763182833847179489172885915788583169831512231178277711568871734321198467733515449667411629441742397187363218897841336578496674136888251484586615117928721128621462351145166119786219725635895481841328633966142339549869314274337631828338472786227429921395129995367983253246318198669615344458954893277812255336743461782777158289618251761617219585511853442135474913264831716151439547121745716111621617219985272528978252375912588496674162125715223268439423795726157958782651344654369477182517638562916676941181115615795989318277962387152292116293331162944591567174845456128215142527862212537991871613831828194833575914416131819792153977431554631554631948335123159833847272565391686454275591567153242139774387624618473851835271125581839168618716131825176187363296912391686878265161318155926329477413163881195248773277166163759762418837278499991362825692517118313416192381245723864132763182168384681769568646141128116495231162944569358171211212214956238711152849357363115284955522513143691659618674346339192232185781353199679187624645225657743427458425439416636565491685855118998795471493795721459737195843184334797517783384711124691556649274584411876141733811467921481946246318569358567339135273977196946911114679276923959964357137742197161579557743412497611986696732897151626913951297369351926126926721228147142137662589757125189786179489125237571674517726821154868349287385629192814598729175914445427511124697914488338476945363836148657914274331889784158895316636561964487121543812719782779165961814859847288591219476771258343231978623492871219476971139121141641447462351131638851888316232761794891189786134869265213711811153836138562947648415283831962468918645355344819714522921369477168384611871721342635811638526959728859682422813657124572399334818635379529684159141534441726245896436198467714819461695969549878439424542755673393755341193229167577488598196246877327778942919483351673751761163726845895481312351447623395724154251695498712537998499991528383182719512982171227552226128759144156472544821813486929125881229571228147452256997386137897715788581136697694536268527456294118919124429911548684118764825417793341998811863537192612677529684394297113973289756128245629416293337793341397148969121798929195237367636515526111964487175653132446446638914375288197142927551768644164144716515426864693277824429989441734524916737511857481794891734916561282244299189786847981229571157683912497611742397547149486579526959167778962387118958416884794885981249761516864131638823622359156712194769347971669713163337115384781292161821138672327183325217888349226833149641372921518288185949914859841453685895481425414286698129619818594994421611415319139916715586682887171528383837885125581893883516575991625295145569955724411952488338471655581544535575415399762242289933481831233211995136282516212571613181151425656175248337122957115182881132659143349395724728859918645148194615182881554636965551312351837291978626682892483371427433137493918675754159145713777389541376958557244892398597624763182154857348859888836452256121543841995217827771271971855461195439217181691588953131638818191191185153185142316979794744655269596783841217457198669611891911734321158895312315911871721714131124976138361952968141331374939136686319947725612825471491437528124168515142511912111669826884794219712261281796911221495123562813224458217333472685693581697979139512916273141615278337224631815384781726245165154218796894966741633371771258189786353325196852511528497914482564134381234219715774341451661528978157683918897843896675996431142754175249231294513951291962468278622189987958752989239858349198325314678131627314668289835866585511738359164548514153191847385161721923218511366975249457743416959618433477631827369351187172769239862113172422616999981615229275518716138661511124583579453192612689239818716131778739119121112862192874668289171615147992729679313163881512231173835912618759913293533251187172498693156876313123517888341374939154251614133714726182921425641314314711142754238242126793216152397743166769446235138361122957115586681152849185949957743449263629477413769587874115445351691922258432177672136484418211382382422745844522561659618147992774299219281451633371173634126995119584397113979952473895413547499327781231597248218762461586934189786242282947741481946164548535736317524929388351247742833847811638172826437755315849151221495183527111185261423395142541419624686844416682891439547167375122814729881223218556532148194618958411687884345249154655417484547268416575991845366888361887765121341991258816939419711391162944767223815911221495458313298812557244619833129417915425164138951485984114679241793316999989226831366863157683918473852261281241685125379917444161936221173835978539169857468847936342139512923824213688821195248182315718231579913291952373158895394893179691286698155261117545111871613573396153847813729215889536238718782651152849617814993348176662574299216394281419357492636198669616192381847385146377545225618615189267213331354542751326483187968969251763194717686443412112362231776726642511166982821733843942977196496674146983284596117565381567662387116838461189191142945266223248456174643583788512739896299289368168176958762464138951544535187968912537992745846561757328973815911538478182315714556991356768177268218857465733961615276722139714819463161823157381591381591878265793467411876262473856291938245713771859499759144488598353325152232657743416777897692394865791449642167375115344413345598479811185261267932161923849869367838483384786211312881221514251883727136282517969142399154251676923997315816919229872911851423995367565329711391744416126995112477426763651356768135273141331522326385629112458319967912887171354749995367122553315788581423395977196773277172624511952489933481841328169797944418621852153645913688821691922181712988121762587666271148811139916773491666828959156712638941294179258432262471376958228147133859769453643812338159111387161316388195237338764813668634825411833252136484451888394287394893492636442161114275458147282375233111617363419523731724226196246817625871972563184132897921581567668847915344466425117726821584915373515791448187363217888341288122169596111246917242269448921712112156674423218513365781988715662232112458361983339774397517768242276318211488111185153438123165356181163812941791449642115486813769589549875693581162944147185115788587611634966741879689419952785391118717271472636342135676815788586864673289716818271554631231591578858194833519261266339663714961592991175249297315815122313331351883727183729652137121947616818276763651334559567339528978168182715526111372929428731841328173634185344216737515713771271975491681368882121745746437442161154857315889537147264542756339662624716515421183134771258668289196852512517815748268242224631892672119624681578858381591157885819483352362231956411195843571377198871512659131928145337173197458218514231627314135676813648444159142119951346673512826127197147588917383595855117989293714961643466795486134667341389599334883586614577181211483788534121118897849812341166982993348165558126793225237517565393479717928721348692129821711811154461997187641128621141733819281451714131155463742992819714133657814516611877678419231546554192612617989294441811387161798929617814181911917383591512231184738516495231625295946911174845419624681843347189584114173387187641142754112862115586681819119543111141733899536724833718574836947737755312497617894296561754179334986933997621354749182113823622318897843997624764844441829679371876479144815687633977432362231641447189786153242117161514274331669713438123952968144156618554614744651992753194833582779189584115283831869594155463262477429927954868176951164963176662554311116697139226836985741582896862113182113817161591258854513164144734726818635371946316123966691662617767213345593593821716156642518176951183134167375149667445831312618751986696381591161521271971817111225641841328142137693681648859851686417545111399167148194686211334524913264839792151455699335154991329198871512275521932183621852573396129216116496317666251938244381231724226567339152232615324211544535625893634221199594287331698314577181669713813657122755274299214678131643466862113122351488432251282612315913527319786216959619846772624717464351251785552252725653432361983389239859964311629441796916339666763657995242362231584915896436158491554513118111581567616676949327787712581322445876246175854931496418574822612849263618615188782651152849387648185546141187616131811518288379572335154654156142541461175792268312517814657941699998841923981234136484415485735733966642511693941922683952968194631649667414597371962468983253199477277731557945316777897752965148451358787154251616495231859499928747591449448923836118716133836114698321841328635985186959457339623824218534425693581364844989311657599153444114679215889531926126211995135878713224458257711911993565326642511479927187363215788582927559792156178141887765146579428669812881228257711984677148396525641397113963194717726821443585258432163539139714884192341591412235141661637112458315667441754511633966777315113669749869311851536521371558668167173261377682577145427556935817121121592991131436947446538159193479718352711225533178883419382417242261768644633966458313193824126389489441715586682826618635371211411629441867575494655172422692874456294383613755345188831136697139512914274331994772793467543111194631614476236339661623276472446142339519947722321851697979181911914233951873632369477345249113467879144813648443896671738359969121241685399762623871183527116757777327717262451576839977196189584114556993432319523731136697174845468847997921552897819119935511877894296198335229211645485385629819714759144125581817242265148451986696132446419786211427545592631843347137695814334912618758782657934671419357244299759144375534113265913385977712581845366141331364844195843115284913224451825176129619888634112194767369354724461554631693941146579481567655118733717319887151156887154655429477418978645225615425161621257484563795721257837178479652897842197188432274299248254114839655855119523731261875163539698574166769414738776116383586629679315828961378977165558118313455118795296819321831471851173432116999985612821253799258432133859741995215182887934671982658757125198467718998791368882118313445225669857416212571756536763651885746123764777731547244618251761687884142945216454853916861273989849999155664949869313264831831233112458316454859529689872916662711972671861518131436937957217585495491685895481271971833252331116918645981234167173216353918615181831233248337161116256128217625871544535171413115889531225533484561821138142137614112811239666132446489845518413281665675145973748657916131811794891129619818877651483965383612866983977431524345114679216212571631352569358282667712583775536581947692391833252143752891258819564111548573371496122957183384762185214112819529682846791798929142945215667443492872927557248217328971825176522921182113819584318473851782777147588969655558551142137655118717625871263894166365617868155976242362231451661139311156674416919221114488141531972684658194152636424833795296881567671876439168649465513688821185153775296462351512826135474913385977288591461756136686348456526959166163716777896581942362231756531223514516864119928666828945629414839651948335195641118372958954813991671263894112458318857469125882685276783843957249489312739893957245168641419357635985155866897921517262453876483977435511873836118332521655581873632795486833847165558268527969122362231399167126389486211383384794893769239549168666278641329953674138951926126456294197862238242314964199477217625875612821512231137695842197138159128669813224451528383144964272885968444128669876318299334858349134524999738615667444643719866966319471419357158895318978612517856128252897811467921294179922683133254157885851282613224457369351841328864132668289561282522921114679214233951425414569358156674414516612119952988129489377327725439477327719281452826631294571472645831318776766425173491665213751686492874438123182719576722132244511952488459611213419164548568242214516611237647375534115486845225611952482967939368161928145129417941389517423973997621673751345249783372934797133254272565349287864132141935718756512362239751771124583528978456294979215184536612638948217331687884522921158693455522538361799524139916758349115566497874118332527591441639428395724228147156472513991677833729287413466737773151972563115688773491625641367636597921589441718938229388355552251899879161923836342116698219786286615116818271342635196246892874185344297315863598562589163135217726826824228923987389541885746331116126793216737517328971776721899879145166151888318372914597372745841114488176258715929915996431433499125888419238621131231591782777383611443585676365971139129619846437178681516656751738359188372716273142826619543928661518277961983317484548843227369351213419178479646437316983163942815889533533256985743997621655581183134123966615546315182881255818137897717868151653561573396383611554631443585198669616717325794532564133654391334559343236743461859499169394158752917827777813531778739169394189845528467916939411962468694536118717211326591372922483371235628183527118372919988116293331685865129821718756514946551294179559263185748142339524429994691193479773693518635371946316155664959762417585491469832458313337173186959414496429327782947741292164421611699998724821169596876246684441466389141531958954817787391685865176864415324211191219327782422839976212982171738359789429256413926721115688712295711342635573396575415282661855461197862825771886341118313429679311629445491682725651718169118111519644875491687429921128621183729585511415319419952355344135273183729191199316131811312356824221162944831828114881116293331298217111448811912112558181831233682422199881132446413971481859499148396514839659973862119951877671962468173634629928116294417888341338597448218144964216979791461756785391171615496674825771726841421376115688714859841954392126995121199515889537692395935861895841141331397148242284542751621257357363125379918615181887765938835186757511891913836137351588432255118712598569933481893822621852726846925174583131754511583491125985648657929679314314711744416413895121543812396661265913125581811932298217336581947328979226835168646359851215438183527148254115243451225533678384124168578135345225656935817262451429452187565114193579973868621131437528193824184334786615118736321831233286698288717896436316983175451117444161788834192612613769581378977888361132659494655193824147185113466731534441948335165356116434663957249792151994772862113141733819745821837291978628197141974582187363261781439774381163825843223622394691178337213466737995249792152685278621131988715166971352292114738714536817847967712581263894131638865819429477436947757743414395474542751219476997386176662547648436342168586511891913351545431112947741552611585519166261417338185748112256418352711338597724821979215785391175451194893161116287624615849151552611127398918615184724465148451397148593586147185184192356733976722389667946911411876395724114679286817139714818978619927531669713171211217343211782777175451144619913648441889784122553339976217282646137761138716116496356733917343213775537288592584321237647193824146983214839651372928277921199518938223331351582896159299199738615748212739896985749166261887765181713533251877673755346238711269951252375123764799132952695911366972685271239666195237336342186555657541537149618473851718169492636843942142339551686498931763182112458314496421823157773277456294125783718251769973861227552188372712921655118795498716596185188831366863664251296793132648314153191181115969121267932162125733111683384767636535332515546352292112174571938248499993856291651542785391177672151425146983217484545996438197147954861762587892398522921524941423395151425658194977196168384611467921942278286698599643258432116496314112811227552399762528978189382218978616333711189191623871113871625843218171825771381591993348742992942873599643789429298812155261139572417161518473851724226129216763182268527543111995367168182721199582173365213714597377894291693941129417935534454513157885828266383611344654954987159299169857419584333111618897847894299771961574821687884188574633515476722135878716636561556649129821766425112881221631352736935345249367458666276218521687884367458112256416596188237521625295134667358551813657166769415182881986696125985688634155926378337214637757167451974582189786549168162529514334934928716414472119951431471126793214334999334815243451512231187767199881579453668289817695952968833847551187187968916737512442991746435975177166163715364598277982779676365111246969857414334968646373515256413142945213143691928145178681513385971697979112862144216115162694461991586934158693418695941681827498693189584112618753351541911993195237386817579453528978549168134263513547492564131473874522561156887781353152232625439415384783533258217336218526945361199286187565112679322786221994772114477398527219725631185153484569771966157955289786662714637751691922597624168384616656756622321952373936816316983993348272565734916177873916495231821138837885488598399762131235113265918231571776724138957874117565367232767434616353911124691875651365439174845419463163129451298217146983256733965819414516611574822564131788834769239337173421971973158345249126389417989294199521946316825771171615145166122814717969117989291219476197256316959644619911326591524345185344261983318776713345594643762992813143695431111685865989313654391423395714726151425145771814435851439547775296187363276722514845458313593586442161193622134121145831399334854916817565315566491782777579453884322819714165759913486927752961191219469111322445196852573491619362211215438136484499132916313521883727528978114679212598563634252292163396635938229881234323878265613776157885839572417625871673751738954868174562941958431475889137695814395471411281118919118594991326483142541447648411185261122564347268171615155261184798153242118978617383591592991147185114678137813531376958122957195296837149621199556128215869341298217161318114254142362231578858736935228147658194126793299334894893125581816515429186459711391974582395724147387125581881567617868151988715113669763194717262451588953894417423991845366619833763182144762313527318574814213761936221148598415384787591441211416515424219711823157115688799536716232761512231674346262477813535188831148811199679138764815788581261875518883526959148194672482113789772584328419239327781364844514845183123311629444764844138952826691662641591423622315889531972563194227844418142743315223269852725168641962468136888257339616939411798929175854959964376318215526114138951356768365439144156671876486615129275512699517954864583139852729287455926342399125783713345593876481982658668289894417714726159299115566493654391994772357363484561259856166567541995212578373674581447623282669186451546554331116157885893277889643665617518292148217331635399125881754511197256384394214597371994772112256424631817888349973861746435583491181711255818825771183729864132343237268476318212699517611635976245895481332541798929153444254394296793363422483376218521982658738954174643522814786615116777891241685167577365439133254192814544418561282581472154453516212571877674583135289782362231417338146377548456146377516676941223514672327192612619786273895415485733654391372926763658116381241685171615726843432315929915511871332542261281362825551187164548516394281576839787416925179186451346673179287258147216111626137761144773246318973158123966638159117948915471491552611686462988121415319118313413143691687884133859783182867232773693515344414839651651542494655121543849465583182814314714583131514251528383995367658194835866177672973158183325286413229477488432213385972887178499995996431378977664251666278984551843347114881199738629679316656751762587164548577327781971416979791693941726842543941417338199477252292145831315828961817113264831344654518883148194635938211488116137761984677171413118554611257837827791693941143954773693517262459166268479892672176116314274332826637957217888342564138156761316388157885851888317969145225624429999536735534422814749869315748236745813143698217331372921948335793467611757128812241793319685253694775754158661511633371112862136745815546381365794893454275133254136888215182889267218923983311161199286726841227552185748161721926448926247159299197719613325414213767167458277919644871534441532421254394188776558349135736318271951823157423996258975914498527298325384394212921649667445831319786215546313789771928145165558335154199477287826515526114926366359856299288863412846796965559933481685865286698199881148396577327716939411586934176662512982171695961259856141733844418125178111448825439488634111891911288122172422619483353452496682891231591964487113265918938221568763769239763182148396518292144986931865556169192259358662387114112814825415249414657949125887389549893135534478942918453669388354118761859499129619811669821288122274584139311884322171615474465129417941793323218539976224429967232716414471911993811638547149387648876246759144357363365439131638865415618897841447623196448725237536543969251765415623622351282617161512315911245839388351574824199525673393856291665675148396523218512982171675771122564621852211995176258794691144418654156421971625899448921199286817695198871511528496723271893822161318122612829477488432219866961742397359382177873914193577732777874111891919711391978623634218453661257837115688715869346157951831233625891312351827195185546118171165558633966821733845961164548512416851267932625893815915451314375281893822391686238242129417965415669857414536814839651461756528978662232591567841923119121573396375534347268115284977529611891911354749454275168586514698324966741936221186959414536811669822725651132659694536577434894417113669723622317363427458498931379572932778387648514845981234353325152232662992898123418554613735158277965617578942913365781354749383611473871217457182921415647251651542331116155261129275529881215182881861518194833561983315768393452491164963164952348456182315712517881769538966725843214617561413312638941627314896436773277662232132648316979795875296945361142754165356181971444216118938221437528385629144358558752918716131984677452256395724385629198265889239812598563472682745841148811825771193622112921635332552494676365171615142945233313514556991288122333135174441625843216172191429452194833528467973289777327713385971772682565329226836581941558668876246989312887178318281823157197862132648316858659933481825176345249484561332541992753383611223514783372184132814233951697979131436992874119524818433471867575474465181911938966712275521641447113265982779114275415566491556649466389312945142945216596183634247244661781411992861483965442161573396186353738361182921415828962826698729113789774764848883618312331657599137493968242214173383654391819119134465441995212537991726245136686356935814294521219476163942854916811346785229214583131443585423998257711187172196246816838461627314625892523751756531459737171413143812346437145368926721496674813657121947687422718655561356768367458118313426247161318131294581163836543916555824833794893169797957137718756512564131342635312945198669646235111912115788585794531615211811151611162179892941187625843218574815526118257711633371184132877327729477491258886211324228196852548254124228652137787415935863472681259856165961812497611887765182113818776719281455572441213419169596116294415546339168676116316878843331351245723496674599643161116218332524865791994772399762184738511568871247742133254153847814678131742397136484422814728266514845131235119322914657947268497921512255339852721144773292755496674137695816414477268495498717262454441813325469453676923977529614395476299281633371171413115425161225533785391178479613567684199521118526147387849999591567615795179489142399142743357339677125852292113244641118526177672189987978539176116383182813486927793341776729489398123427256574299211427541738359157885866828999334819584327256516575995128269751771926126635985876246248337152434517524921251785693581235628666271716151142754165558173432111447733129452483376824221431471126591316394289933481358787143752819261261946316413895167577718764664251613776585511639428985272179691124572314334911467921641447692517926721375534359382136686381365717423971187172125783784394277125899334818413281649523186353718332521128621189584165819414617561128621164346612921616959629275593277815122318439421193229278622448218833847268527132648352897812881222786223634213769589812341187172164346616111629711391835271153242116454851124583177268297517733717319826581229571132244569453682375211185261326483187161365617523218517545111564725444181683846167778914435851288122175653144762318857461992753371496936816551187682422167173213224451665675462351347268194833516979791542516145368575415152838318271958964361885746132244516999981231598621133997624461991691922153847811851532362231611162165961814536817262451796914986935229216238717914481685865383616622321964487335154118919118594994845616495231788834192814516636568197141534448197148641321714131175249211851531237647125985613466731154868131235264489779334383611877674138954461995491685552254482181883727185949931698369857482779282662927551792872174239787826551282652494111852611912112275529973861776723714961851423161318178741194833514274332685271831233137292928744724461734321143752849465537755314556991584915126389411528496965551968525113467876722777315196246892672187422718312331687884183729193824785391151425973158567339171615528978385629156472519564118277993681615546381769534121116394286521371574821548573126389413163881887765936816476484156472533717333313597315893479777125815162695653225641312235141112469145166114556992887171758549787411439547369477169394165617514254141253799146377517141311778739448218341211878265494655137695897315816555818877654825411784796938835142541412921615768391245723946911199477213224451288122571377155261177731577529637149611912138159176923914839656965552866989549879529681871613119524819786212578377813531663656151828813345591821138154453514536849263617181691316388185546112578371845366664251171615183325279346717121127631828156766622321954392144762386211315929911582896795486192612618695941712112288717162529516172197712581879689136888216919221889784144762366223213547491191213755341296198192814586615117948911958439711391738359141128114173381958435673391697979194429793479789643618958412382421399167825771131235171211251484528467916495234986937773155915679872918439421463775157885819846771211415768393472688237521843347817695171816912497611893822126793214637758136572725651467813575415137695887624616111621756536238712988121324464183527118231571162944186959418433471657599123159843942282665673391439547178883419846771417338825771175854917423971568763145569914799272725651195248146377518372926852722814754513148194699132916131813634251282662992814415661843347936816141531914314719125881465794821733987291146579425439413264835875292988129226834663891712112158491513648445653215828961712112185949949263618655561746435763182545131356768199679117444165733966642519731585188833977431427433918645629928587529118717292672111972671124583186757516596181296198777315296793198871513991678964361314369177268214133343231776729711391984677391686353325153444561282419952621852944892995367114275466828945427515324211366863874227934797357363587529136686379346718251767712587288598499991691922112458369857416838465754158984551181115156472522814717787391978621413316313527793349812349812349267211889784118919111891915269595733962261281164963163539551187952968176662517363421199562387161377633111615869347389541851423179892963194714193577147261112469125379923824249667488836345249163337172684126995113325461377618998791134678146983252292117989297712581911993757125971139114881116697131964487146983218695945673391455699186151817585491187172129821716939414381237853914865798782659529681453683916861823157981234143954746235112638943452491716151514257752962786221994772193824335154193218315546315344434121119745825269595572447793341267932194833516252956581941138716123159934797343231457718189584112214951992753146781358954863194713931141187617928727732771746435244299111448862589633966166163719261261364844664251134667312416854381231879689823752151626915768391314369337173133254635985155664925641338764818473854663895491681431471152838316717321427433142137666828962185211992861342635347268145973773895416697131845366185344254916863598599132984798793467146579412638947914481986696171211218292141191211946316186151814375282382425653212941791641447157482162731437755315546317343211237647288717152232618433471144773136484479952448456837885417933971139559263143349799524843942983253145166117524921191211512231161318112194768237521358787174441683182813547491433491516269486579938835777315569358125985612214951538478161318181163817161597315819846771754511672327831828411876615795946911452256126187586211316495235733964461995572441457718763182143349178681582577118837278136578499991294179157683994489212174577672252292119745823412115188831968525197862139512912275521336578188574649869312396669287498527258752918453663371731312357712581819119167375187826597719671674517545118782657833728923981558668242284199521453685935864179331443585769239761163164346613446547773151237647145771848657916636561447623155463795486732897987291192814544619912416856299285895488358661946316187363243812313648449913295471491231593391927147261756537773151536459841923821733692517176864436342385629734916522921132446411972671699998226128345249187968917989291237647694536126187511326591334559989315249482779125379933111612578379872918217331316388151425153645918938221869594736935126793211185261211419463161754511268527194631616232763533251211444619955724416111626662733111619543925188831536459819714466389155664917383591786815122755215122311784796174441618231571542516182517647648418433471122564549168942873171211215768397995241825176164144714254146581941643466337173894417128812216555816838467389541455699141531912457231653561161116213365781788834114881188836156472517545111251781833252165558189786985272514845137695825237518837272826644216131698336745851888334524966425158551179489116131814663891623276161318177933437957218292141245723793467589548195641112921646437182315714375283896671794891189382211992867167456238716238711269951173432116818271592991189786178479614718513815917631823169831837297934675592632321859751779529681667694141128113769581356768726841776721641447423997793341724226139311139714816454858964361865556182921419119931534445996431635391952373345249134869269251714334918837275612829973867328979731583896677349161778739312945196448715526119267212947741429452165154295296855926358147219866968742271661637136484448254138966717787394724461524345488598118515311144881465794137695815586687288591417338118717218675751451661442161928743896671738359123764714294521564725183729166567589845556733983182819685259226834199529832531823157841923194833561377611447731431471619833813657936816156674428467914859841217457696555189382218211383351547773151992753148598419362211397148611757876246181911934928768646975177158289686413211851532463181334559163135218211383533251292168641321635396622325148451441566162731481163886211339976297517712517868444116212576299281752492176864414839651534441219476183123387826587624687624615586687692391154868115486816273141837291998811354749512826761163864132162933389845512941791936221151626919382412659138661511245723997386246318114679234726814112811138716438123156674411286211261875143752816434661372921124583843942615795197458217282648964367874134524911245831671732599643124774214314713351545673398156762362231615214274335188831459737997386147185115283831738359111448818352715168647288591724226452256194833555926319927534461991619238716745452256157885816454852463186178146238717954861687884177672197256315546397517763598518615181552611157885818473855431117672299536718574811467921245723148598412537997752961752492486579129619819442977591441514251334559194631682577144418141334986931875651664251168182714334989239812376475128261734321147588915828961526364148194615748227862254311118251767995243472681699998111448815667441576839811638734916114275499536715122311245723486579177268291864518938226642515693583553446743463916866157951772682625895289781588953371496146579417282641877675794531164963171816913587874522568681767838417787392362236258917787395733969489384798492636134465497315866627696555633966151828869857435534417444161288122664251162327614698321552611874227127197732897458313195641111124691128621137897739976214758891433491558668268527874227141733814718512745841324464197862767221893822569358174239715162691459737248337116698219866961332545592632483371134678734916312945141331241685118717263194759762413527337755368242211366979469111825176946911161116266425115223269287425439417928721744416145368197256341793316939411762587175249226448913244641968525611757182113815768391138716896436198265814415662281471865556518883142137658349117928721932183383611378977163942846235188432218413281984677179691522921411876147185119543929489315142514334918352711324464136484418837271728264952968442161176662561175715425162846798681719281451259856864132314964761163728859157683918736321239666148396524228199275368646167778988634115364593553441835271152838315142586211384999919584351686412457231241685151425114679252897817565319382413325457137712941792422815849151564725161525572441449642182113822814738966781769516636561992753825771256413757125676365555225331116464371148811169192214274331625295118111535736311225641911993575415123562815929913755344663893169834926361611162347268787411798929143954789441734121111932291314369141331649523184132811447733331351146792278622135273189584112396661885746246318199881118111512598567268437755315667441819119724821423995592635976247288593553441748454623871189584117948916723273674581132659159299118958411334559132648318473851718169178883434524954311112941791191211938241962468161721911548681229571268527242281857481263894148598488432216939417288591851423161721993479719119932745848621132422817262454118761413351888311851531897869973861263894133859783788518413281574821946316377553182921419483351851423142743323824215647253916865491681827195375534268527198265813749395653278741165961833919284192315647251972563121543818615182382421449642997386781353714726186757567838493479743812397113959762479144898527216111621847385112862118695941853442587529835866122149567232798325317484546844413916862422873693512921616596181691922813657169596936816165154238562917969113567681235628199477297315866425117868153553446319477692391613181359382162529587624637957284596114133115284913325413951297429923654395188837712582685274946551342635168586518877657752961859499191199312235147248211786815886341186555625843213628257833723876484542756925174926366561751425414173835955118718978614233951344654977196129619847648418473851465794262478176951479927163135224228194833516636564744655511877268483586641187612517833313512941796884791352731544535948931873632146579492672117625871633371926721125985612477423694772745841425414119524884394284394219382417383598378851796911417338837885139916714637759953671827195197256348859815768391788834111852613648448318284461991631352186959428266411876154453516414471199286399762849999162529514314716561751663656164144735736318534425229214118762523755733965572443977432644891546554125379917121127167451752492163135298325339774311992861443585163135219564111738359135878741389543812312618751857488277919281458439427268499132928669816454851441566157482133657818756511368882268527514845169192224631811427549792151592991732897827797793341467813894417139916718231571292162624715182884118768197145471499953679933489751774986931443585728859238242528978583491124168561983382577176923965213714173381415319734916136282591864546235117464357349168923981419357139916712739891322445498693162529518978634726819362212119951837291657599347268137292686461191216581941633371156674489441711185265855184798163942814637757571251546554129619825439416515421851423157885816172198944171669713464371522326182517615384782442991633371154251683788598729179144811669821734321137493917383591792872172422614476232786229388355229211518288183729177873917625871623276167778916192385693589428731211473289717524926117571251781397148159299113123524631881567611144887672213264831671732163539143147118473851845366142137666828912295717147261586934166365675914413446541425414147992718716131712112886341236223591567136686317928721996791977196678384124774259964315929911566744785391248337345249226128189584113446541952373143349244299181911936543995498718837271483965496674112256499738645225612235149973861958431526364373515674346888367954861183134116496341793379346776923998123445225645831358147212174571944297121947619523731574821378977172826462387117161518433474542751354749169192272885918776736745817444166238711332544239937351513668631926126365439716745173432158349126852717242261358787139714812315941187611669821877673331351889784613776236223161721917686441393117672212214959327785289788237521788834189382267636516252958782651681827528978131436992672169251777529636947713729223218551888318655561221495162529513749391433491978628116383997626157951443585179691446199132244584798141331667694147387264489129216172826425237516555852695925439473289773693511669821875651262471114488684441121143593821772682145569914395472463184966749529686238711128621199679112558187328971296198146579438562918534421334559183527113345591994772158895318271951659618167375125237512699519549871958431926126122351462387165415618271951837295673391823157884322187565112134191651542783372194227814294527389549368161871613228147113669777125838159112982171364844565323634242399164548517989299287417423971411281171615724821163942866627164952371876414476231166982169394113789771229571139714834928767636515748212638941675776238711661637456294282661237647114275458349182779125985612961982261289852729388356682893755342543948358661831233173432119887151469832125379915586681899879113265917565313466731112469186151814112811837291259856129821719887151954392134869214839651195248143752856128212517819463169287419321834482181568763761163164952318877651728264656175684441155866813729218837278863411847385514845569358179489117989291225533799524759144129216184536621199515445357288591211412315918312331619238769239142541437755315445355935861956411282665128266137763593827571251988715874227145166119382461781498931866151178681515929911576839122957156128256128277529645629473895489845549263613466733553445612821469832166567511245831998811857482523751455699142137628871737553419786211952484461991181115296793579453985272194429718978637149615748212719798123496912136484418372989441719119931657599557244813657761163278622182315712618751972563928743957241514253815917914481821138385629121141348692862113171615158289619745821148811177672133657819887151825176147588919846779428731996791167173279952433313515283832119951235628777315164548511932295269599731583573634482182321851346673169999819281452967937712581621257781353128812245427516697132988121429452158895313749396662712154389751772685271461756137292484564926366925173755347934673654391298217147588986211311346781946316948931348692623871183123318716138358661582896355344421971113871618271951352731752492375534137695815344412114168586556128217565397921514657941782777395724777315162327644216117827779226836864686615117383598318289731587732771645485122755219685251273989162529524228116294419745828661519872911796911754511125581814334938764812295711336578196448759358676722195843264489166163735736311185265592631253799172826412982175754156258917545112644895733964724461754511926721135676811185268277941995241187681163881769538764836543944216179346713648442523757187647268416676941964487174239765819491662614556993432316636561982658135878734121117989291726245874227171211211528491617219199477256532335154482541165759979144817444165875291744416652137339192656175526959164548576923955118712255331869594147387181911912497611833252779334166365665617557945348254111387162947745976241429452787412947744885983452495875298439427631825733961548573484561552611176662599334819685251831233395724157482183729119524872885914254141911993448218145771844418182517612194761968525194227815828966521371786815139714888634116777894542751296198145166135534416636563856293836151282683182816838469832539549871257837161721919564114865796945368479828467913264838661511879689549168146377517666251393112786221972563192814516979792947748782656682893997621338597189987916333711124583528978581472569358878265139714862387116454855148451358787666278984556117579125881534441635391649523152636466828969251799132995498715384781227552773277135474919644871348692162933315182881687884121745775712561377689239837553458954815324211439547482541142339537149616636562543941338597446199827793331351617219135474916656751334559714726611757862113154251611952481873632272565123764718998796783841344654371496589548182315779548672885919725637187647813531974582494655835866591567123159112256416131811788834341211161923814617562826614476234522561889784932778114275429679396912174239717545111336578236223161721919967912119951746435119726786413213587871255818381591183729954987575415938835184536677125817121129731581528383496674126187513163881895841115688771472615788589549871152849944892163942817969116152783372188574616535611883727952968373515154857345831318372917141311833252238242484568257711944297666276622321724226184738514294522463185713771992753172422625439479346782779989311251781625295666271994772114477329679313668633169831322445585511911993114679219483357369359388359893117666252261284522561788834474465934797742992134667314819464482181437528157683965415637149617262451461756169999881163816999988459618176955552251271977248214845696912139311228147236223122351415384787369351273989769239791448288717353325147185134121113729277125898729148859833717336947736947748657994489233111674299229679317888341259856132244511871721823157827791215438294774718764195641149263616353915889532362231974582195843182517616152165759915748284999972684484561621257124774217524922846791162944825771129417963396616596181794891173835969655575914484394297113983384726852752897815445351746435174441612638941189191793467987291773277575415498693186151811629441516269187968944418116294433111614415663129453472681972563666271823157349287136282562992828266114275416555837755316131811397148977196129619816414471675774179331748454635985161523593821366863144964211932291152849516864583491728859127197188776557137737755312356281148811133254264489981234126793216414474926361211491662619321835269598176959872911845366135878718796891972563331116211995987291129216195237311124691992753599643496674169596825771167778916737517328971393111453681863537196246812537991554631231591247742476484238242866151446199155463187767357363133455954311113991671326483169596874227135273196246841995213547491187172187363217383599347971992753184536616858651742397379572145771812356284421618843226925178419231237647166365634726813628256319472967931134678359382184132818897845774343472681788834357363162933377125813729293681613547491267932182719519382412194767934671439547734916148194663598536745818897841629333112862183384717948911734321892398155463345249186959416232762321851748454482541357363339192238242121341944418482541969121221495185142327862212416856137766339661453684764847571251197267785391137493965819454311115465545592638944173634217423975814721936221654156341211121745719988119644876925175733964966742786224118766965553351541784796379572577434143349182113812114488598143147151282614738755522517989291758549633966118111517989292967933896671189191168788417827777752967328978217334825419186451366863133455952292148859818655561853442161526581941584915161923825843257137733919226852725439436543911932298116384865798176957914481217457177268216959618514236824226157951776724663894482181899879126389414173385249445831316656751625295779334128812211387165168642826661377638966756532466389274584385629154251645225678741196852526448984999911952482483379893114415661659618134465416757773693511488113775531756531667694444181471851186353728467919988119947721639428773277954987464378923981617219357363381591157683912275525653256128218857461225533182113816252952644896319471944297286698134667388432214738714536857137723824243812383384769655576318218675758762465895481425414946911892398135474935332586211367636518574812295715814725269591952373146377556935898729119119934522567429926359851663656125178353325819714162327619523731996791129216236223936816153242112517811387161193229482541191199319988113951291867575164548569655516454856541567187641649523182315789239887624672885911912116333711134678946911236223232185734916144358515586681326483154453518312331859499714726121745718372912679325552251298217278622349287179892927256576722734916142541447648488836151828818776728669818958411623276987291494655112862168847928266144358554714917666251756531831233172624531496419826586521371982658173634121141473871853442112862113224454946551449642153444868178176955653224631861983361579525237515344416192383472688358663634212517817181691199286379572284679987291154857315263641112469238242918645952968196448761983313648441772682183729145771817262451514252442996258913486921847385391686113871612578371134678169394116353911891915693583977431227552629928482541888362745841974582119726718796891251781166982494655125379915263641554631395129379572738954946911789429198467749263619725631782777864132545133492877147264482182927556359851946316135878713951295976241413339572414859841267932593586173634171211216737511568763252375686468742279893118695941546554232185173835911891911526364333135111448814173386359851461756168384615889536521377611632321851619238892398163135258551132446427862218251761261875486579135474913163881625295466389137897718978618332521645485163539196246897921512457231197267139311196448786211317625879287446437619833161923816959652897873693578741174239719442971326483169192212255331875651126591388432215889539469111378977176662541995218594998197141627314767225673399913295289786218521411281345249157683917847961974582112256418998791324464989311978621952373781353498693186959415263647833725774341558668438123666277631824865795552251556649152434563396625439448657917141311683846122957114476231336578193824122957147446519846771938241378977122957189845554311162992834121166627152434517242265673391374939119322911488117429921734321115284981567619564114522561792872395724165154291864512376471576839167778956935842197114314715471491128621696555119121211995954987333135896436133657813648445875299388352725651455699151223176923915768396925171972563488598165558613776577434387648492636186959417343215612823533257268458752918655561879689111448886817928741528383145166113749391853442193824179287212537991786815169394184798159299115122311128621813657714726176864418312331754511573396184738597113917847963755341936221512826161923814395471326483185344212497611788834168586576923959762426448911811158419231712112166567539774312194761663656815676171816918534421358787112256478741111246925237536947782577112396665935865895481342635198871588836165759918372912921618473851296198623871151223149667444821846235118615183634212396669226832422827256565415655522518433471152849864132652137619833135878711932291984677381591174441667636533515411811151677789189987945629413648442725652119955572441998816743461994772718764444181998811449642472446182921415142518433477773159267211556649274584454275119322939168697921558954816858653674586723276258957541548456182113811528491197267197458234121124228114881115445356178141889784183729565324825417288594239917423971372921439547121745717969114375281611162173835914233951988715133859715243454966741726245228147151223176722946911186353779548614395475592633634217282646743469469119226831421376127398955724413426351138716121141867575124774279952497113997113912396666561756581941879689724821139916716212579388355754151833252732897379572199881286698176662517444163714968681735332517545114482181825176185546125237592268371472617726821227552579453252375185344233919241187611427541237647168384612679325976245612821358787421971168586512477421994772969125754156258914657941336578163337141995218332528439421657599118717255724481163811144881928145187767787419347971675772644896682891853442125985617383591443585188574692672161175731294514395471992753178681583384782779226128119524867232769453611225641936221153444684441274584118313412396661251781944297278622121141994772662232791448115284917989291314369343234562941861518242282442996137761768644734916135676818776712315912659131584915162529516959671674529477417161517847963735153149647369359852723977431467813995367159299115768391211498729144619918796898641328318284865796319477571251623276137897714678131344654157482821733145569944619916111621114488133657863396663194784394281163813527392268317343211463775571377188372712739897995241512231577434575415185748122755214738717383591465794484561627314339192817695121745744619916454851665675567339175854914193577995241964487112862177327744619913749396965558358669731584239915223261665675141935715364591885746125783715384782988121641447179892952494115486824631838361617814938835387648559263268527188776568646294774113467812416857389541164963142339517423975733961582896183123312315919927531613181462351197862139916765213714859848318284461991469832767228661513371731875651185748174643514294523412111887765922683381591121947625439484596171674517888341259856199275311467921451661496674141335188831667694355344127398981163811972671841328896436571377141531919887151871613175451192268312315916555898931168384616596181193229112862198325312174577349163634212214951554634118769125881611162559263177672115688789643613769583977431421376417933623871194631619362211936221355344183527184596112618751534441988715155866816697139469111459737549168864132163337147648436543924833714738711427541782777186757519463161344654124976177125872684113265913749395572444441819442974421612887176198334562944199521659618185344219483351744416498693158491515526111437528139916797113933717376923916777891962468678384795486862113118919118312331166982161721914698326844411716151245723144156616858652483371936221186959418958415128265511871223514375534119928614738797315819564111649523843942151223181163824429992672126448998325335332514637751744416125379961983325237536745886615138764817242268479816111629893111387161483965152838311932299812341114488716745615795124572383788577731586817977196196246813224451191211556649942873156674418332526642511273989619833116496377125818352711629333815676385629131235122351414799271889784179489199536749667418716137752961449642148194686211317282641524345134869293681612174571263894179691878265248337684441347268146579419483356258918554615814725915678338471431471248337177672142541491864598325315263646824228378851982658795486161923811851531748454125581812295711748454894417631947591567166567546235115667441374939843942686463169831625295185344248657912921655724417767211467923916861667694142945212961983169839327783533256662729275519725634522567248211193229821733793467124774233717316535611556649142339518352711697979587529188978499536783788512174571639428137292397743787411974582456294163135289239813769581417338154251697517757743414698327631826561753412117248213371734724468883683788581567678942918352716925171843347238242192612629679358349115344446638917726825875294542751181115954987199275316939416137761657599787411431471123966616131813129453351545148458479818332522927551455699126995122612814133183729732897168384618837274118766359851928145341211567339248337823752181911918675753149641514251455699158895314698325188831972563357363123966616535611344654151626956733954513157482123764765213717868151655581411281121947618938221259856184738513264831984677524945612821366863226128652137169797911144881718169415914133254918645171615698574896436196448782577146235115546358752911871729267219792151564725115486817161517242261455699183325246235113789775693581576839199881874227126389413385971746435884322169797962992869857465819416838461271971887765162933345427591258844619918837271253799314964164952366425141187613143692543941265913195237315465549973863331351736347187641267932182719511649631122564415914248337157482716745145771846235172684137292182719538562915849151368882985272983253124774249667491662616414471263894417933258432174239723824235938219685252261281817165819457945312558184845657945319846771819119116294442197165819456532456294932778678384131638812315924631816596183351541653561316983114477312376475511873876482543941261875125379955724415425161162944172624549667415748217969118635374946551294179114275486211335332518897841833252369477119524855724418756511467813123966614213765128264885981154868182719514233951251785733961419357146377512356281726245169999813749391187172111852683182814375289287497517755118711185267914481994772244299656175156674418736321514259751771257837118515381971416394289771967611631225533189786146377574299219463161998811681827557244129619838966739572415344417545114542751259856757125166971315364591481946145368944892123159726841441566137695811245831518288167778998527215889534623512422869453684999936947717625871332543856294381231449642866151577434188372713143691423395363421251787147265168641776721954392486579185142311528491843347112458399132915364591467813131638854311116212571681827391686494655161116211629443452492564132422819866961835271591567331116244299162529513567686521371423395142137677327718594996824221766625144762312558181362825146579454513597624987291135676866627167778911831344946551364844866151148598428266162327614536833717374299261175711871723856293452497248211778739228147153645941793382173314496424219719428731845366514845698574125178849999238242757125942873174643516999987369358984556258914435851665675164346616131819186453371731241685184738511992861378977129619819422781215438488598135273171211219584334121171674511912151484556532825771144358533717316535611316388166769418695941776721817119119931798929821733363423654392422839976219422789287412558181695968439424441818211381431471112256415384781245723198669618635373755341865556121947619624689893182375211568878782656561751875651787418964361265913165154237957214334913769581714131444181417338345249625899388359771961742397389667312945145166112194763977435915671485984466389161116219947721352735229211475889197862694536122351435534452292116273149125881475889126389476116316737519973861887765684441187565168242257339616878847591445451312558183573631269951168182717787397732778984556541562382423593823795721554637934671156887141935712558185511874663897833721568763349287599643113467815364591554631344654155866868242258349123622319826581528383153847818857466682891742397188776548456197862314964736935975177118515389239841389512275521326483167577444181257837732897137292196448788836194227875712518998799731581191218762469368161665675115486869857416172191863537195237318332525875291288122589548353325142541451686477933411649634885981257837983253894417165558119524827256539976291258816434663694775168642786221415319155664918453661564725528978196448712477421738359121341917989294986931514251136697196246865213714536855118713547493755341112469114679211286211877671558668791448995367113265946235113587871792872811638168788411669824421611193229896436944892666271292166945367591441245723199275346437169596688479585511542516179691128812234524918716136682891423395119322997315818433471237647799524162731416313527349166218521114488256413113265948859816555818958419973865229216864637755318958411683846557244617814983253139916716959614476231792872399762682422793467187767635985166163718695941738359423991316388726843391926339661875651122553341389516535617571251887765126995113466732826613688829529681659618413895145569917383598197141861518196852566425118332523412111748454167778969857412275521114488981234185546168847916636561542516629928161923812497611992753686461344654474465162125761781417121121425414183729142945235938276318213163884421611346673151223111326591346673629928114477313143691473871423395113265917888341346673621852633966148194618716131118526177873916535611166982862113385629185344248456831828611757187161329477417847961675771475889771258567339131235161721919119937874184596133515437149618332524643713446546117577288591393115774341687884157482129417954714971472659762416979798237523876488257715875298439421118526944892672327186959458752929275558147263598512719711548681653561112862193479731698351888316555841591428467966627918645573396583491331116165961816293331421376166971311649637914487954861681827178883414193576743461584915821733991329835866357363195439213991678944171148811946911248337169999818857466137767328977712581718169121543813446545552256319471867575415914183729365439119322969655576722169797963194719725636238713412114381231516269143349124572338764894489218574883788595498716999981166982147992771674515243455612821889784134465496912633966973158898455698574161721969453641995221199555118779144816959618756516743466561751338597141531912174571788834142743388634119745823593821534447954868419231463775724821129619814274331837291288122116496351686496912331116113467863194714597371128621444184825411122564333135176258716232765754151526364165558132244519119931134678827799448923856291199286557244119726712537991473877328972685271235628126389413143697591448621131584915115486815586688681714213762463181716152887176521379327781453682887171611162411876118717217484541554633129451296198166769465415663396679346717423973634298325391258813365781847385977196162327612376471695968217331623276264489464373553441887765111448815768391669713294774981234147992766425113587871817114496428762465794531756531187172785391946911942873166163729881211245834219711661637112256455118726247126187573693551686414536811326597954861556649186151875914413688829812344724465875294724461324464676365182719535332517363411488119388357712581132659983253157683913264831249761171211218231574482182725651197267199881186959417666256965553634213931119624685168641677789631947195641191864536543911932295552251792872114881152695976116312517814678139267215511877833721261875912588142541416737512261288318288923983694772786228197143331351584915837885132244516555819422781154868153645919725631863537173634111246914395474461991665675357363113871648859857339616919226945363795725269591292164724461162944153645916616371273989312945343231114488662232155664977529633515414314715834916743463371734381231978624381235552257167451397148161116213244645168641239666194631691864516575992543941645485379572728859678384284679173634139916745629416515423977438782657147268338471219476161721948456718764918645145569911467921897861728264383615895482826619442979489325237511225641746435258432157683915364591231592442991358787734916172422659358616333719186451231594381235511871415319151223118554619953671364844761163286698158289615546333313511144881471851145368179287235736315929911683846137292182315716353931496446437296793196448716858651556649153242112295716945361342635413895286698158895362185283788513769585229211893822122351416737514643714516614744651514256723271413314173384441819382418292143391921962468156472533717398729115889531883727983253367458193824625897732776359851475889141531913224456117571118526155261131294514415661865556387648373515847984946551134678454275185748174239716999985855112255331625295158491511952481199286143954718857461417338381591728859153242187826545831386413283586677125819543921223514133254152232611467921455699583491589548674346286698187363211912198527218292141982658126995146437248337522921395724571377686461114488615795148194617444161841328137493913163888621131255818146983241793313769581453681269951918645192612618271951536459474465123159898455799524169999882577115384784219718883614738763194711629446864613688821378977825771126995114758891619238635985799524211995131235526959129216172826487624617262451526364175451113587871378977625891296198145973718776789441741389517565314657945269595249456935857339611548684643754311173693514758891552611173634773277611757131235173432152695923824219624687874114435856157951932183185748928749731588217331148811152636492268313345594744651863537186757569453618413283634214597371413318211381716156339663755341239666898455492636559263156472565213735736357945314254141685865189382211568871514253997628217334724463169835249412578371354749174845418776747244611811151372924542755976248156761942278571377845961789429113871618978615667441588953137493919584316596181952373172826493277882779773277619833163337118998791752492413895916626987291438123173835919745821695961911993369477193824841923314964126995119786226852717141311397148118111578135382779847981136697192612614294521817117868156945361887765387648314964114275413365781859499341211312945724821147992733313519644871538478813657125379911286211974582122149522612872482118554619388356864654714988432214395472281471778739174845474299213587871744416777315868171467813112862177731524833754916829477413769582866981734321126389415647252745841726245411876349287122351416838461611162189382214698326137761841328134465412356281786815771258585512382428843223856291112469177268256128275712517989291542516395724258432987291133455923824216313521649523847984583137167456178144663899287478539114577181655586561758277915647251768644151626918251764562949368161431471182921489845581163819483354986931271973573634865791669713177672454275167173254714914233951984677341211682422135273144358554714914294521326483272565184536611346789469111617219456294145771888836162125711811157187641457718977196142743317767218796891794891827791142754158491524833713749391215438151626915445356521371629333997386161721928669834121116172196662741995217827771463775454275682422585511699998258432252375182315735938267232713567681716151455699389667199679115182884239984999991662617767217545111788834254394862113557244115688718938225168641742397522921652137184334712941791756531956411142743316495231453688277986413213547496299281578858184536676116314133199881158693482779177672112862187624618938223573631128621395724589548337173157885816575997167459448921643466345249767228499991867575179892912941797288592261281938248964361532421916626195439217262451655588742271837291675771316388835866987291194631613587871376958573396728859163337111912134121179144816555894691142399629928141128112235145431118439421778739118313417767288836178277719543921249761551187783372158693418271955552254138957874115364597752962543941954392228147145973715344413567682745845895481685865383613593821829214144156617686441778739197458219442973129454522563896671746435143954725843211548689226839448926965551835271173835917181691615213123513951296783849549876117571481946112862117847963755341645485268527545136682896359853351541972563238242113871618352711861518611757417933569358113265911972675713772927551463775248337153444172826481769517141316339667591442685271195248174643557945319422789388352281478358661936221395724167173257339613426351441566111246911972673694775976247611631869594164346618352714845611447731136697837885337173615795166365619543927147261978624764841136697147992748456892398186757519119931645485795486113467813668638782659186451342635314964165961818554619872911122564862113136888243812366223216777899448926218521946316942873698574916626316983136282518857461879689188372713547491552611631947152838311548686925171641447164952315929911843347282662261281869594199881333135174845469655576318272885933919214698321449642349287545139751771586934111448813971489731581738359789429118717212921612659137773151419357726841938245431118742271978621798929793467773277198265817868151362825154655414859849347975935861255818316983423991183134175249281769524631826247139311137292164548566627154453511366976561751449642153645933515456128282577112537998338479711393755341443585183527194691114839651411281783372169797955926317282643755341625295152434523218519725633836111387161185153813657155866878942919745821851423486579137695816717321958435713771522326866151135878723824218534423714961829214391686144358534928781365719422781556649337173926721551187413895413895795486165961841995216293333452493714961257837159299112719761579561175761175717969112881221267932176864416434669529681788834135878749263615344445427512194761395129113265911932291374939296793123562841389551686416555814254148883613668633916861437528545136864616818271298217199275313264831566744144964225439457945318514235128263735158257711584915113669758752992874194833518655563432318514232523751619238189382261175759762471674515324218338471457718862113194631652292118756511552611194227818675751831233815676369477152434545629481971416878847833721962468821733399762173835919685253593821483965918645187968918292141457718777315173835948859859964314738717141315451386817177873931294587624618958413694777389541467813242281926126476484148194655926312497619913299489317524921712112124168513648443371731956411174643514415661395129191199363396612719716252951558668119524813123549263611528495491681215438153242111811157631825188831873632178883451888315546376318226247164952319624681568763184334746235145629429275584999951888356935862185218514233792\n",
        "output": "400340256\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc164/tasks/abc164_d"
    },
    {
        "id": 655,
        "task_id": 2242,
        "test_case_id": 9,
        "question": "Given is a string S consisting of digits from 1 through 9.\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\n-----Constraints-----\n - 1 ≤ |S| ≤ 200000\n - S is a string consisting of digits from 1 through 9.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\n\n-----Output-----\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\n-----Sample Input-----\n1817181712114\n\n-----Sample Output-----\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.",
        "solutions": "[\"s=input()[::-1]\\nalist=[0]*2019\\nnum1=0\\nnum2=1/10\\nlens=len(s)\\nfor i in range(lens):\\n  num2=int(((num2)*10)%2019)\\n  num1=(num1+int(s[i])*(num2))%2019\\n  alist[num1]+=1\\nalist[0]+=1\\nans=0\\nfor i in range(2019):\\n  ans+=alist[i]*(alist[i]-1)//2\\nprint(ans)\", \"ans=0\\nS=input()\\na=len(S)\\nk=0\\nc=dict()\\nmod=2019\\ns=1\\nc[0]=1\\nfor i in range(a):\\n  k+=(s*int(S[a-i-1]))\\n  k%=mod\\n  s*=10\\n  s%=mod\\n  if k in c:\\n    c[k]+=1\\n  else:\\n    c[k]=1\\nfor i in c:\\n  ans+=c[i]*(c[i]-1)//2\\nprint(ans)\", \"S = input()\\nN = len(S)\\nA = [int(S[i]) for i in range(N)]\\nA = A[::-1]\\n\\nMOD = 2019\\n\\np10 = [1] * N\\nfor i in range(1, N):\\n\\tp10[i] = (p10[i - 1] * 10) % MOD\\n\\nfor i in range(N):\\n\\tA[i] = (A[i] * p10[i]) % MOD\\n\\ncumsum = [A[0]] * N\\nfor i in range(1, N):\\n\\tcumsum[i] = (cumsum[i - 1] + A[i]) % MOD\\n\\ncnt = [0] * MOD\\ncnt[0] = 1\\nfor i in range(N):\\n\\tcnt[cumsum[i]] += 1\\n\\nans = 0\\nfor i in range(MOD):\\n\\tans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\\n\", \"S = input()\\nN = len(S)\\nq = [0]\\ncount = [0 for i in range(2019)]\\nans = 0\\ncount[0] = 1\\nm10 = 1\\n\\nfor i in range(1,N+1):\\n  a = int(S[-i])\\n  #print(a, a*(10**(N-i-1)), q)\\n  q.append((a*m10+q[i-1])%2019)\\n  m10 *= 10\\n  m10 %= 2019\\n  count[q[-1]] += 1\\n\\n#print(q)\\n\\nfor i in range(2019):\\n  c = count[i]\\n  ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"import sys;      from decimal import Decimal\\nimport math;     from itertools import combinations, product\\nimport bisect;   from collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)\\n\\nimport numpy as np\\n\\ndef Main():\\n    s = read_str()\\n    dp = np.zeros(2019, dtype=np.int64)\\n    dp[0] = 1\\n\\n    cur = 0\\n    digit = 1\\n\\n    for i in reversed(s):\\n        cur = (cur + int(i) * digit) % 2019\\n        dp[cur] += 1\\n        digit = digit * 10 % 2019\\n    \\n    print(np.sum([x * (x - 1) // 2 for x in dp]))\\n\\nif __name__ ==  '__main__':\\n    Main()\", \"import copy\\n\\ns = list(input())\\n\\ns.reverse()\\nn = len(s)\\nMOD = 2019\\nm = [0] * n\\nmsum = [0] * (n+1)\\ncnt = [0] * (MOD)\\ncnt[0] = 1\\nt = 1\\nfor i in range(n):\\n    m[i] = int(s[i]) * t % MOD\\n    msum[i+1] = (msum[i] + m[i]) % MOD\\n    cnt[msum[i+1]] += 1\\n    t = t * 10 % MOD\\n\\nans = 0\\nfor i in range(MOD):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nl[0] = 1\\n\\ntmp = 0\\nz = 1\\n\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tz = z*10%2019\\n\\tl[tmp%2019] += 1\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\n\\nprint(ans)\", \"\\ndef solve():\\n    s=input().split()[0]\\n    cnt=[0]*2020\\n    cnt[0]=1\\n    m=0\\n    t=1\\n    for d in map(int,s[-1::-1]) :\\n        m=(m+d*t)%2019\\n        t=(t*10)%2019\\n        cnt[m]+=1\\n    return sum([ k*(k-1)//2 for k in cnt])\\n\\nprint((solve()))\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import Counter\\ndef main():\\n    s = input()\\n    n = len(s)\\n\\n    amari = [0] * n\\n    ketaamari = 1\\n    t = 0\\n    for i1 in range(n):\\n        t = (t + ketaamari * int(s[-i1 -1])) % 2019\\n        amari[-i1-1] = t\\n        ketaamari = (ketaamari * 10) % 2019\\n    amari.append(0)\\n    ac = Counter(amari)\\n    r = 0\\n    for v in ac.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\n\\nS=input()\\n\\nrlist=[0]\\nfor i in range(len(S)):\\n  rlist.append((rlist[-1]+int(S[-i-1])*pow(10,i,2019))%2019)\\n  \\nc = Counter(rlist)\\nc[0] -= 1\\n\\ndef nC2(n):\\n  return n*(n-1)//2\\n  \\nans = c[0]\\nfor k in c.keys():\\n  if c[k] >= 2:\\n    ans += nC2(c[k])\\n    \\nprint(ans)\", \"from collections import Counter\\n\\nS = input()\\n# S = \\\"12345\\\"*40000\\nN = len(S)\\n\\nl = [0]*(N+1)\\nfor i in range(N-1, -1, -1):\\n    l[i] = (l[i+1] + pow(10, N-i, 2019) * int(S[i])) % 2019\\n    # if i%10000 == 0:\\n    #     print(i)\\n\\n# print(list(Counter(l).values()))\\n\\nr = sum(m*(m-1)//2 for m in Counter(l).values())\\nprint(r)\", \"s = input()\\nt = s[::-1]\\nn = len(s)\\nresid = [0] * 2019\\nresid[0] = 1\\ncsum = 0\\npowoften = 1\\nfor i in range(n):\\n    csum = (csum + int(t[i]) * powoften) % 2019\\n    powoften = (10 * powoften) % 2019\\n    resid[csum] += 1\\nans = 0\\nfor i in range(2019):\\n    ans += resid[i] * (resid[i] - 1) // 2\\nprint(ans)\", \"s = input()\\nmod = 2019\\ndic = [0] * mod\\ndic[0] += 1\\n\\ntmp = 0\\nd = 1\\nfor i in reversed(range(len(s))):\\n    tmp += int(s[i]) * d\\n    tmp %= mod\\n    d *= 10\\n    d %= mod\\n    dic[tmp] += 1\\n\\nans = [i * (i-1) / 2 for i in dic]\\nprint(int(sum(ans)))\", \"s = input()\\n\\nl = len(s)\\nnum = 0\\ncount = 0\\ndic = {0: 1}\\nfor i in range(l - 1, -1, -1):\\n  num = (num + int(s[i]) * pow(10, l - i - 1, 2019)) % 2019\\n  #print(num)\\n  #print(r)\\n  if num not in dic:\\n    dic[num] = 1\\n  else:\\n    dic[num] += 1\\nfor ele in list(dic.values()):\\n  count += ele * (ele - 1) // 2\\nprint(count)\\n\", \"from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf\\nfrom itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement\\nfrom collections import deque,defaultdict,Counter\\nfrom bisect import bisect_left,bisect_right\\nfrom operator import itemgetter\\nfrom heapq import heapify,heappop,heappush\\nfrom queue import Queue,LifoQueue,PriorityQueue\\nfrom copy import deepcopy\\nfrom time import time\\nfrom functools import reduce, lru_cache\\nimport string\\nimport sys\\nsys.setrecursionlimit(10 ** 7)\\ndef input() : return sys.stdin.readline().strip()\\ndef INT()   : return int(input())\\ndef MAP()   : return map(int,input().split())\\ndef MAP1()  : return map(lambda x:int(x)-1,input().split())\\ndef LIST()  : return list(MAP())\\ndef LIST1() : return list(MAP1())\\n\\ns = input()\\n\\n@lru_cache(None)\\ndef F(s, k):\\n    # s\\u306e\\u5de6\\u304b\\u3089k\\u6587\\u5b57\\u76ee\\u4ee5\\u964d\\u3092\\u6574\\u6570\\u3068\\u898b\\u306a\\u3057\\u305f\\u3068\\u304d\\u3001\\n    # 2019\\u3067\\u5272\\u3063\\u305f\\u4f59\\u308a\\u3092\\u8fd4\\u3059\\n    if k == len(s)-1:\\n        return int(s[k])\\n    ret = F(s, k+1) + int(s[k])*pow(10, len(s)-1-k, 2019)\\n    ret %= 2019\\n    return ret\\n\\na = [0]*2020\\nfor i in range(len(s)):\\n    a[F(s, i)] += 1\\n\\nans = a[0]\\nfor i in range(2020):\\n    ans += a[i] * (a[i]-1) // 2\\n\\nprint(ans)\", \"S=input()\\nMOD=2019\\ndp=[0]*MOD\\ndp[0]=1\\nr=0\\nt=1\\nfor c in reversed(S):\\n    r+=int(c)*t\\n    r%=MOD\\n    t*=10\\n    t%=MOD\\n    dp[r]+=1\\nprint(sum(i*(i-1)//2 for i in dp))\", \"S = input()\\ndp = [0]*(len(S)+1)\\ncur = int(S[len(S)-1])\\nmod_10 = 1\\ncount_num = [0]*2019\\ncount_num[0] += 1\\nfor i in range(len(S)):\\n    dp[len(S)-i-1] = cur\\n    count_num[cur] += 1\\n    mod_10 = (mod_10*10)%2019\\n    if i <= len(S)-2:\\n        cur = (cur+int(S[len(S)-i-2])*(mod_10))%2019\\nans = 0\\nfor i in range(2019):\\n    ans += (count_num[i]*(count_num[i]-1))//2\\nprint(ans)\\n\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in S[::-1]:\\n  s=(s+int(i)*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    # print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum + x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    # \\u5834\\u5408\\u5206\\u3051\\u306e\\u6570\\u3092\\u8db3\\u3057\\u5408\\u308f\\u305b\\u308b\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num - 1)) // 2  # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import collections\\n\\ns=list(input())\\na=[0]\\n\\ns.reverse()\\n\\nmod=2019\\n\\nmod10=1\\n\\nfor i in range(len(s)):\\n  x=int(s[i])\\n  y=a[-1]\\n  ans=(x*mod10+y)%mod\\n  a.append(ans)\\n  mod10=(mod10*10)%mod\\n  \\nans1=0\\n\\nc = collections.Counter(a)\\nd=list(c.values())\\n\\nfor r in d:\\n  if r>=2:\\n    ans1+=(r*(r-1))//2\\n    \\nprint(ans1)\", \"s = input()\\ns = s[::-1]\\n\\nL = [0]\\ncnt = 1\\nfor i in range(len(s)):\\n    L.append((L[-1]+(int(s[i])*cnt))%2019)\\n    cnt *= 10\\n    cnt %= 2019\\n\\nD = dict()\\nfor j in L:\\n    if j in D:\\n        D[j] += 1\\n    else:\\n        D[j] = 1\\nans = 0\\nfor k in D.values():\\n    ans += k * (k-1) //2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\ncnts=[0]*2019\\ncnts[0]=1\\nnum=0\\nfor i in range(n):\\n  num+=int(s[i])*pow(10,i,2019)\\n  num%=2019\\n  cnts[num]+=1\\n\\nans=0\\nfor cnt in cnts:\\n  ans+=cnt*(cnt-1)//2\\n  \\nprint(ans)\\n\", \"s = list(input())\\n\\nMOD = 2019\\n\\ntemp = 0\\nd = 1\\n\\nm = [0] * MOD\\nm[0] = 1\\n\\nfor x in reversed(s):\\n    temp += int(x) * d\\n    temp %= MOD\\n    m[temp] += 1\\n    d = (d * 10) % MOD\\n\\nans = 0\\nfor x in m:\\n    ans += x * (x-1) // 2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\np=2019\\nS=[0 for i in range(n+1)]\\nans=[0]*p\\n\\nx10=1\\nfor j, i in enumerate(s):\\n  S[j+1]=(S[j]+(x10*int(i)))%p\\n  x10*=10\\n  x10%=p\\n  ans[S[j+1]]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\n\\nmod = 2019\\ncnt = [0] * 2019\\ncur = 0  # \\u73fe\\u5728\\u691c\\u8a0e\\u4e2d\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\ncnt[cur] = 1\\nd = 1   # \\u6841\\n\\nfor s in S[::-1]:\\n    cur += int(s) * d\\n    cur %= mod\\n    cnt[cur] += 1\\n    d *= 10\\n    d %= mod\\n\\nans = 0\\nfor c in cnt:\\n    ans += c * (c-1) // 2\\n\\nprint(ans)\", \"#!/usr/bin/env python3\\ndef main():\\n    S = input()[::-1]\\n\\n    counts = [0] * 2019\\n    counts[0] = 1\\n    res, digit = 0, 1\\n    for i in S:\\n        res += int(i) * digit\\n        res %= 2019\\n        digit *= 10\\n        digit %= 2019\\n        counts[res] += 1\\n\\n    ans = 0\\n    for i in counts:\\n        ans += i * (i - 1) // 2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nn = len(s)\\nmod = 2019\\n\\nt = [0]*n\\ndp = [0]*2020\\nt[0] = int(s[-1])\\ndp[t[0]] += 1\\nfor i in range(n-1):\\n    t[i+1] = t[i] + int(s[-2-i])*pow(10, i+1, mod)\\n    t[i+1] %= mod\\n    dp[t[i+1]] += 1\\nans = 0\\nfor D in dp[1:]:\\n    ans += D*(D-1)//2\\nprint((ans+(dp[0]+1)*(dp[0])//2))\\n\\n\\n\", \"#!/usr/bin/env python3\\nimport sys\\nimport numpy as np\\n\\ninput = sys.stdin.readline\\n\\n\\ndef ST():\\n    return input().rstrip()\\n\\n\\ndef I():\\n    return int(input())\\n\\n\\ndef MI():\\n    return list(map(int, input().split()))\\n\\n\\ndef LI():\\n    return list(MI())\\n\\n\\nS = ST()\\n\\ncnt = np.zeros(2019)\\ncnt[0] = 1\\nres = 0\\ntmp = 1\\nfor s in S[::-1]:\\n    res += int(s) * tmp\\n    res %= 2019\\n    cnt[res] += 1\\n    tmp *= 10\\n    tmp %= 2019\\n\\nans = 0\\nfor c in cnt[cnt >= 2]:\\n    ans += c * (c - 1) // 2\\n\\nprint((int(ans)))\\n\", \"def main():\\n    import collections\\n\\n    S = input()\\n\\n    mod_list = [0]\\n\\n    for i in range(len(S)):\\n        index = len(S) - i - 1\\n        num = int(S[index])\\n\\n        mod_list.append((mod_list[-1] + num * pow(10, i, 2019)) % 2019)\\n\\n    CTR_mod_list = collections.Counter(mod_list).most_common()\\n    cnt = 0\\n\\n    for i in range(len(CTR_mod_list)):\\n        n = CTR_mod_list[i][1]\\n\\n        if (n == 1):\\n            break\\n\\n        cnt += n * (n - 1) // 2\\n\\n    print(cnt)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"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\\n# \\u7d2f\\u7a4d\\u548c\\u306e\\u66f8\\u304d\\u65b9\\u304c\\u3088\\u304f\\u306a\\u3044\\u3084\\u3064\\ndef main():\\n  s=S()\\n  n=len(s)\\n\\n  l=[]\\n  mul=1\\n  for x in s[::-1]:\\n    l.append(mul*int(x)%2019)\\n    mul*=10\\n    mul%=2019\\n\\n  for i in range(n-1):\\n    l[i+1]+=l[i]\\n    l[i+1]%=2019\\n\\n  sl=summarizeList(l)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    if x==0:\\n      ans+=c\\n    if c>1:\\n      ans+=c*(c-1)//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Mon Sep  7 00:38:11 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n\\uff1cD - Multiple of 2019>\\n\\u3010\\u65b9\\u91dd\\u3011\\na = b(mod2019) => a - b \\u306f\\u30002019\\u306e\\u500d\\u6570\\n\\u4f59\\u308a\\u304c\\u7b49\\u3057\\u3044\\u30b0\\u30eb\\u30fc\\u30d7\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u306e\\u7dcf\\u6570\\u304c\\u89e3\\u306b\\u306a\\u308b\\u3002\\n\\u65e2\\u306b2019\\u306e\\u500d\\u6570\\u3067\\u3042\\u308b\\u3082\\u306e\\u306f\\u5358\\u4f53\\u3067\\u6210\\u7acb\\u3059\\u308b\\u305f\\u3081\\u3001[0]\\u306e\\u30ab\\u30a6\\u30f3\\u30c8\\u3092\\u4e00\\u3064\\u3042\\u3052\\u3066\\u304a\\u304f\\n\\n\\n\\uff1c\\u7d2f\\u7a4d\\u548c\\uff1e\\n\\u3010\\u8a08\\u7b97\\u91cf\\u524a\\u6e1b\\u3011\\n\\u5927\\u304d\\u306a\\u6570\\u3092\\u4f7f\\u308f\\u306a\\u3044\\u3000\\u21d2\\u3000mod \\u3092\\u4f7f\\u3046\\ntmp += 7 * 100000000  => 7 * ( 2019*N + \\u03b1) => 7 * \\u03b1\\u3000\\u3068\\u540c\\u3058\\n\\u3000\\u3000\\u21d2\\u3000\\u7d2f\\u4e57(10**N) \\u306b  mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n\\n100000000 + \\u03b3 => (2019*N + \\u03b2) + \\u03b3 => \\u03b2 + \\u03b3 \\u3068\\u540c\\u3058\\n\\u3000\\u21d2\\u3000\\u7d2f\\u7a4d\\u548c\\u3000\\u306b\\u3000mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n \\n for\\u6587\\u3067\\uff11\\u6587\\u5b57\\u305a\\u3064\\u8db3\\u3057\\u7b97\\u3057\\u3066\\u3044\\u304f\\u3053\\u3068\\u3067\\u5b9f\\u88c5\\u53ef\\u80fd\\n \\n reversed() : \\u9006\\u9806\\u306b\\u4e26\\u3079\\u66ff\\u3048\\n reversed(input()) : \\u5165\\u529b\\u3092\\u9006\\u9806\\u306b\\u53d6\\u308a\\u51fa\\u3059\\n \\n\\\"\\\"\\\"\\nS = input()\\n\\nMOD = 2019 \\n\\ncounter = [0] * 2019\\ncounter[0] = 1\\nt = 1\\ntmp = 0\\nfor i in reversed(S):\\n    tmp += int(i)*t\\n    tmp %= MOD #\\u7d2f\\u7a4d\\u548c\\u3092\\u52b9\\u7387\\u5316\\n    t *= 10\\n    t %= MOD   #\\u7d2f\\u4e57\\u3092\\u52b9\\u7387\\u5316 \\n    #print(tmp)\\n    counter[tmp] += 1\\n\\nans = sum( i*(i-1)//2 for i in counter)\\nprint(ans)\", \"s = list(input())\\n# s = list(str(10**200000))\\nn = len(s)\\nans = 0\\ns.reverse()\\n# print(s)\\nx = 1\\ntot = 0\\ncount = [0]*2019\\nfor i in range(n):\\n    count[tot]+=1\\n    tot += int(s[i])*x\\n    # print(tot)\\n    tot %= 2019\\n    ans += count[tot]\\n    x = x*10%2019\\nprint(ans)\", \"S = input()[::-1]\\nans = 0\\nmods = [0] * 2019\\nmods[0] = 1\\ncurrent = 0\\nx = 1\\nfor s in S:\\n  current = (current + x * int(s)) % 2019\\n  ans += mods[current % 2019]\\n  mods[current % 2019] += 1\\n  x = x * 10 % 2019\\nprint(ans)\", \"s = list(map(int,input()))\\ns.reverse()\\nt = len(s)\\nmod = 2019\\n\\narr = [0] * (t+1)\\narr[-2] = s[0]\\nfor i in range(1,t):\\n    arr[t-i-1] = (arr[t-i] + s[i]*pow(10,i,mod)) % mod\\n\\nfrom collections import Counter\\narr = Counter(arr)\\n\\nans = 0\\nfor i in arr:\\n    ans += (arr[i] - 1) * arr[i] // 2\\n\\nprint(ans)\", \"import sys\\nimport heapq\\nimport math\\nimport fractions\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\nfrom collections import deque\\nfrom operator import itemgetter\\ndef input(): return sys.stdin.readline().strip()\\ndef mp(): return map(int,input().split())\\ndef lmp(): return list(map(int,input().split()))\\n\\ns=input()[::-1]\\nn=len(s)\\na=[0]*2019\\na[0]=1\\nc,d=0,1\\nfor i in s:\\n    c+=int(i)*d\\n    c%=2019\\n    d*=10\\n    d%=2019\\n    a[c]+=1\\nans=0\\nfor i in a:\\n    ans+=i*(i-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()[::-1]\\nMOD = 2019\\nX = [0]\\nfor i,s in enumerate(S):\\n    X.append((X[-1]+int(s)*pow(10,i,MOD))%MOD)\\nC = Counter(X)\\nprint(sum([v*(v-1)//2 for v in C.values()]))\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in range(1,n+1):\\n  s=(s+int(S[-i])*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"n = input()\\np = 2019\\nt = 1\\ny = 0\\nc = p*[0]\\n\\nfor x in map(int,n[::-1]):\\n  y+=t*x\\n  y%=p\\n  c[y]+=1\\n  t*=10\\n  t%=p\\n\\nprint(sum(i*(i-1)//2 for i in c)+c[0])\", \"def main():\\n    def modpow(x, n, mod):\\n        res = 1\\n        while n:\\n            if n % 2:\\n                res *= x % mod\\n            x *= x % mod\\n            n >>= 1\\n        return res\\n\\n    s = input()\\n    s = s[::-1]\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in range(s_len):\\n        rev_num += int(s[i]) * int(modpow(10, i, mod))\\n        rev_num %= mod\\n        d[rev_num] += 1\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S = input()\\ns_rev = S[::-1]\\n\\nr_list = [0] * 2019\\nr_list[0] = 1\\nnum, d = 0, 1\\nfor i in range(len(S)):\\n    num += d*int(s_rev[i])\\n    num %= 2019\\n    r_list[num] += 1\\n    d *= 10\\n    d %= 2019\\n\\nans = 0\\nfor i in range(2019):\\n        ans += r_list[i]*(r_list[i]-1)//2\\n\\nprint(ans)\\n\", \"s=input()\\np=2019\\nans=0\\nM=[0]*p\\nM[0]=1\\ntmp=0\\nfor i in range(len(s)):\\n    tmp+=(int(s[-i-1])*pow(10,i,p))\\n    tmp%=p\\n    ans+=M[tmp]\\n    M[tmp]+=1\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common()[::-1]:\\n#  if k > 1 and k%2 == 0:\\n#    ans += n\\n#  else:break\\n#print(ans)\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#https://mirucacule.hatenablog.com/entry/2020/04/27/090908\\n#https://drken1215.hatenablog.com/entry/2020/04/29/171300\\n\\nS=str(input())[::-1]#\\u9006\\u9806\\u3067\\u683c\\u7d0d\\nN=len(S)\\ncounter=[0]*2019\\ncounter[0]=1\\nans=0\\nnum,d=0,1\\nfor c in S:\\n    num += int(c) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counter[num]+=1\\nfor i in counter:\\n    ans += i*(i-1)//2\\nprint(ans)\", \"from collections import defaultdict\\n\\nS = input()\\n\\nd = defaultdict(int)\\n\\nd[0] += 1\\n\\nmod = 0\\nR = 1\\nfor i in range(len(S)):\\n    mod = (mod + R * int(S[len(S) - i - 1])) % 2019\\n    R = R * 10 % 2019\\n    d[mod] += 1\\nans = 0\\nfor i in list(d.values()):\\n    if i > 1:\\n        ans += i * (i - 1) / 2\\n\\nprint((int(ans)))\\n\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"S = input()\\nmod = 2019\\n\\narray = []\\nfor i in range(len(S)):\\n    x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod\\n    array.append(x)\\narray2 = [0]\\ny = 0\\nfor i in range(len(S)):\\n    y = (y+array[i])%mod\\n    array2.append(y)\\narray3 = [0] * 2019\\nans = 0\\nfor i in range(len(array2)):\\n    z = array2[i]\\n    ans += array3[z]\\n    array3[z] += 1\\nprint(ans)\\n#3*673\\n\", \"s=input()\\nn=len(s)\\nrui=[0]\\njuu=[1]\\nfor i in range(n+5):\\n  juu.append(juu[-1]*10%2019)  \\nfor i in range(n):\\n  rui.append((rui[-1]+int(s[n-1-i])*juu[i])%2019)\\nama=[0]*2019\\nfor i in range(len(rui)):\\n  ama[rui[i]]+=1\\nans=0\\ndef ui(n):\\n  return max(0,n*(n-1)//2)\\nfor i in range(2019):\\n  ans+=ui(ama[i])\\nprint(ans)  \", \"def MultipleOf2019():\\n    S = input()\\n    s = int(S)\\n    num, mod, ans = len(S), 2019, 0\\n    c = [0 for _ in range(num+1)]\\n    d = [0 for _ in range(mod)]\\n    d[0] = 1\\n    s = int(S)\\n    \\n    for i in range(num):\\n        c[i+1] = (c[i]+int(S[-i-1])*pow(10, i, mod))%mod\\n        d[c[i+1]] += 1\\n\\n    for i in range(mod):\\n        ans += d[i]*(d[i]-1)//2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    MultipleOf2019()\\n    \\n\\n__starting_point()\", \"S = input()\\nN = len(S)\\n \\ncounter = [0] * 2019\\ncounter[0] = 1\\nT = 0\\nR = 1\\nfor i in range(N):\\n    T = (T + R * int(S[N - i - 1])) % 2019\\n    R = 10 * R % 2019\\n    counter[T] += 1\\n \\nans = 0\\nfor i in range(2019):\\n    m = counter[i]\\n    ans += m * (m - 1) // 2\\n \\nprint(ans)\", \"def inN():\\n    return int(input())\\ndef inL():\\n    return list(map(int,input().split()))\\ndef inNL(n):\\n    return [list(map(int,input().split())) for i in range(n)]\\n\\ns = input()\\nn = int(s)\\nl = len(s)\\ncnt = 0\\nmod = [0]*2019\\nm = 0\\nfor i in range(l):\\n    m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019\\n    mod[m] += 1\\n\\ncnt += mod[0]\\n\\nfor i in range(2019):\\n    if mod[i] > 1:\\n        cnt += (mod[i]*(mod[i]-1))/2\\n        #print(i)\\nprint((int(cnt)))\\n\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nA = [0]\\nfor i, s in enumerate(S[::-1]):\\n    A.append((A[-1] + s * pow(10, i, 2019)) % 2019)\\nprint((sum([v * (v - 1) // 2 for v in list(Counter(A).values())])))\\n\", \"S = reversed(input())\\nresiduelist = [0]\\npower = 1\\nresidue = 0\\nfor i in S:\\n    digit = int(i)\\n    residue = (residue+power*digit)%2019\\n    residuelist.append(residue)\\n    power = (power*10)%2019\\nfrom collections import Counter\\nval = Counter(residuelist).values()\\nans = 0\\nfor j in val:\\n    ans += j*(j-1)//2\\nprint(ans)\", \"# coding: utf-8\\n# Your code here!\\n\\nS=list(input())\\nS=list(map(int,S))[::-1]\\n\\n\\nmod=[0]*2019\\nmod[0]+=1\\n\\nans=0\\ntemp=0\\np=1\\nfor i in range(len(S)):\\n    temp+=S[i]*p\\n    p=p*10%2019\\n    temp%=2019\\n    ans+=mod[temp]\\n    mod[temp]+=1\\n\\nprint(ans)\\n\", \"s=input()\\n\\ns=s[::-1]\\n\\ncounts = [0] * 2019\\ncounts[0] = 1\\n\\nnum=0\\nd = 1\\n\\n\\nfor char in s:\\n    num += int(char) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counts[num] += 1\\n    \\nans = 0\\nfor cnt in counts:\\n    ans += cnt * (cnt - 1) // 2\\n\\nprint(ans) # \\u7b54\\u3048\\u306e\\u51fa\\u529b   \\n\\n\", \"from collections import Counter\\ns = input()\\n\\nls = len(s)\\nt = [0]\\nj = 1\\nfor i in range(ls):\\n    u = (int(s[ls-1-i])*j + t[-1]) % 2019\\n    t.append(u)\\n    j = (j * 10) % 2019\\nc = Counter(t)\\nk = list(c.keys())\\nans = 0\\nfor i in k:\\n    ans += c[i]*(c[i]-1)/2\\nprint(int(ans))\", \"from collections import Counter\\nimport sys\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nmod = 2019\\n\\n\\ns = readline().decode().rstrip()\\ns = s[::-1]\\nn = len(s)\\nd = [0] * (n)\\nd[0] = int(s[0]) % mod\\n\\nfor i in range(1, n):\\n    d[i] = (d[i - 1] + int(s[i]) * pow(10, i, mod)) % mod\\n\\nd = [0] + d\\n\\nc = Counter(d)\\nans = 0\\nfor v in c.values():\\n    ans += v * (v - 1) // 2\\nprint(ans)\", \"def main():\\n  n, mods = 0, [1]+[0]*2019\\n  d = 1\\n  for i in reversed(input()):\\n    n = (n+int(i)*d)%2019\\n    d = d*10%2019\\n    mods[n] += 1\\n  print(sum([i*(i-1)//2 for i in mods]))\\nmain()\", \"S=input()\\ns=int(S)\\nmod=2019\\nc=[0]*(len(S)+1)\\nd=[0]*2019\\n\\n\\nc[0]=0\\nd[0]=1\\nfor i in range(len(S)):\\n  c[i+1]=(c[i]+int(S[-i-1])*pow(10,i,mod))%mod\\n  d[c[i+1]]+=1\\n  \\nm=0\\nfor i in range(2019):\\n  m+=d[i]*(d[i]-1)//2\\n\\nprint(m)\", \"# -*- coding: utf-8 -*-\\n\\nS = input().strip()\\n#-----\\nnum = 0\\ncnt_mod = {0:1}  # type {int: int} , contents {remainder : count}\\nmod = 2019\\nbase_pow = 1\\n\\nfor i in range(len(S)):\\n    digit = int( S[len(S)-1-i] )\\n    \\n    num += (digit * base_pow) % mod\\n    num %= mod\\n    \\n    base_pow = (base_pow * 10) % mod\\n    \\n    cnt_mod.setdefault(num, 0)\\n    cnt_mod[num] += 1\\n\\n\\nans = 0\\n\\nfor r,c in list(cnt_mod.items()):\\n    # r: remainder\\n    # c: count\\n    if c >= 2:\\n        ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\n# pow(a,b,c)\\u306f\\u666e\\u901a\\u306bMOD\\u3059\\u308b\\u3088\\u308a\\u901f\\u3044\\n# \\u666e\\u901a\\u306b\\u3084\\u3063\\u305f\\u3089TLE\\u3060\\u3063\\u305f\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN = list(input())\\nM = [0]\\nS = 0\\nK = 1\\nans = 0\\n\\nfor i in range(len(N)):\\n    S += int(N[-i-1])*K\\n    S %= 2019\\n\\n    K *= 10\\n    K %= 2019\\n    M.append(S)\\n\\nP = Counter(M)\\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\\nprint(ans)\\n\", \"import sys\\nimport collections\\n\\n\\ndef resolve(in_):\\n    s = next(in_).strip()\\n    mod = 2019\\n    dp = [0] * (len(s) + 1)\\n    ch0 = ord(b'0')\\n    for i, b in enumerate(reversed(s), 1):\\n        dp[i] = (dp[i - 1] + (b - ch0) * pow(10, i, mod)) % mod\\n\\n    return sum(v * (v - 1) // 2 for v in list(collections.Counter(dp).values()))\\n\\n\\ndef main():\\n    answer = resolve(sys.stdin.buffer)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#import numpy as np\\n#import math\\n#from decimal import *\\n#from numba import njit\\nfrom collections import Counter\\n\\n#@njit\\ndef main():\\n    S = input()\\n    A = list(map(int, S))[::-1]\\n    mod = []\\n    ten = 10\\n    for i in range(len(A)):\\n        if i == 0:\\n            mod += A[i],\\n        else:\\n            mod += (mod[i-1]+ten*A[i])%2019,\\n            ten = (ten*10)%2019\\n    mod += 0,\\n\\n    C = Counter(mod)\\n    print(sum([c*(c-1)//2 for c in C.values()]))\\n\\nmain()\", \"S = input()\\n\\ncs = [0]\\nr = 1\\nfor c in S[::-1]:\\n    cs.append((cs[-1] + r*int(c)) % 2019)\\n    r *= 10\\n    r %= 2019\\n\\nfrom collections import Counter\\nctr = Counter(cs)\\nans = 0\\nfor v in ctr.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [-1] * len(S)\\nr = 0\\nd = 1\\nfor i,s in enumerate(S[::-1]):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[i] = r\\n\\nans = 0\\nc = Counter(p)\\nfor k,n in c.most_common():\\n  if n > 1:\\n    ans += n*(n-1)//2\\n  else:break\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"def main():\\n    s = input()\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    t = 1\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in reversed(s):\\n        rev_num += int(i) * t\\n        rev_num %= mod\\n        d[rev_num] += 1\\n        t *= 10\\n        t %= mod\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ns=input()\\nn=len(s)\\nans=0\\narr=[0]*(n+1)\\nif s=='0':\\n    print(1)\\n    return\\nelif n==1:\\n    print(0)\\n    return\\nfor i in reversed(range(n)):\\n    arr[i]=(arr[i+1]+int(s[i])*pow(10,n-i-1,2019))%2019\\nm=Counter(arr)\\nfor j in m.keys():\\n    ans+=m[j]*(m[j]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"s = input()\\n\\nlen_s = len(s)\\n\\ncurrent = 0\\nmod_dict = dict()\\nmod_dict[0] = 1\\nfor i in range(len_s-1,-1,-1):\\n    c = s[i]\\n    current = (current+pow(10,len_s-i-1,2019)*int(c)) % 2019\\n    if current in mod_dict:\\n        mod_dict[current] += 1\\n    else:\\n        mod_dict[current] = 1\\n\\ncount = 0\\nfor key in mod_dict:\\n    count+= (mod_dict[key]*(mod_dict[key]-1))//2\\n\\nprint(count)\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nfrom collections import deque\\nfrom collections import defaultdict\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\nMOD2 = 998244353\\nINF = float('inf')\\ninput = lambda: sys.stdin.readline().strip()\\n\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\ndef combinations_count(n, r):\\n    if n == 1:\\n        return 0\\n    else:\\n        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\ndef main():\\n    S = SI()\\n    \\n    ls = []\\n    len_S = len(S)\\n    rem = 0\\n\\n    for s in range(len_S-1,-1,-1):\\n        rem = (rem+int(S[s])* pow(10, len_S-s-1, 2019))%2019\\n        ls.append(rem)\\n    \\n    import collections\\n\\n    cls = collections.Counter(ls)\\n    clsv= list(cls.values())\\n\\n    ans = 0\\n\\n    for p in clsv:\\n        ans += combinations_count(p,2)\\n    ans += cls[0]\\n    print(ans)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ndef main():\\n    S = input()\\n    A = [0] * ((n := len(S)) + 1)\\n    A[1] = (a := int(S[-1])) % 2019\\n    for i in range(2, n + 1):\\n        a += pow(10, i - 1, 2019) * int(S[-i])\\n        A[i] = a % 2019\\n    c = Counter(A)\\n    ans = 0\\n    for v in list(c.values()):\\n        ans += v * (v - 1) // 2\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = str(input())\\nMOD = 2019\\nm = 0\\ndigit = 1\\nmods = [1] + [0] * 2018\\nfor a in s[::-1]:\\n    m = (m + digit * int(a)) % MOD\\n    mods[m] += 1\\n    digit = digit * 10 % MOD\\nans = 0\\nfor x in mods:\\n    ans += x * (x - 1) // 2\\nprint(ans)\", \"from collections import Counter\\n\\ns = input()\\nn = len(s)\\ndigits = [int(c) for c in s[::-1]]\\na = [0] * (n + 1)\\np = 2019\\n\\nfor i, digit in enumerate(digits):\\n    a[i + 1] = (digit * pow(10, i, p) + a[i]) % p\\n\\ncounter = Counter(a)\\nans = 0\\nfor count in counter.values():\\n    ans += count * (count - 1) // 2\\n\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Sun Sep  6 23:39:24 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n#from scipy.special import comb\\n\\ncounter = [0]*2019\\ncounter[0] = 1 # 0 = 0 (mod 2019)\\n\\nS = input()\\ntmp = 0\\n\\\"\\\"\\\"\\n#\\u5927\\u304d\\u3044\\u6570\\u3092\\u4e00\\u6c17\\u306b\\u639b\\u3051\\u306a\\u3044\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*10**(i-1)    #\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u65b9\\u304c\\u65e9\\u3044\\uff08\\u3051\\u3069\\u3001\\u6f38\\u5316\\u5f0f\\u7684\\u306b\\u7d2f\\u7a4d\\u548c\\u3092\\u51fa\\u305b\\uff09\\n    #print(tmp%2019)\\n    tmp %= 2019                    #\\u5927\\u304d\\u3044\\u6570\\u3092\\u5272\\u308b\\u306a\\n    counter[tmp%2019] += 1\\n\\nans = 0\\nfor i in range(2019):\\n    if counter[i] >= 2:\\n        #ans += comb(counter[i], 2, exact=True)\\n        ans += counter[i]*(counter[i]-1)//2\\nprint(ans)\\n\\\"\\\"\\\"\\nMOD = 2019\\n#reversed(s) ?\\nt = 1\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*t\\n    #print(\\\"A\\\", tmp)\\n    tmp %= MOD \\n    t *= 10\\n    #print(\\\"B\\\", tmp)\\n    t %= MOD\\n    #print(tmp)\\n    counter[tmp] += 1\\n    \\nprint((sum(i*(i-1)//2 for i in counter)))\\n\", \"S = list(map(int, list(input())))\\n\\npops = 0\\ndigi = 1\\ncnt = [0] * 2019\\ncnt[0] = 1\\n\\nwhile S:\\n    s = S.pop()\\n\\n    pops = (pops + s * digi) % 2019\\n    digi = (10 * digi) % 2019\\n\\n    cnt[pops] += 1\\n\\nans = 0\\n\\nfor i in range(2019):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\", \"S = str(input())\\nN = len(S)\\nb = [0] * 2019\\ncount = 0\\nb[0] = 1\\nt = 0\\nk = 1\\n\\nif len(S) < 4:\\n    print(0)\\nelse:\\n    t = int(S[-1])\\n    b[t] += 1\\n    for i in range(1,N):\\n        k = k * 10 % 2019\\n        t = (k * int(S[-i-1]) + t) % 2019 \\n        b[t] += 1\\n\\n    for i in b:\\n        count += i*(i-1)//2\\n\\n    print(count)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nz = 1\\ntmp = 0\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tl[tmp%2019] += 1\\n\\tz = z*10%2019\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\nans += l[0]\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nC = Counter()\\nMOD = 2019\\n\\nn = 0\\nfor i, s in enumerate(S[::-1]):\\n    s = int(s)\\n    n += pow(10, i, MOD) * s % MOD\\n    C[n % MOD] += 1\\n\\nC[0] += 1\\nans = 0\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"s=[int(x) for x in reversed(list(input()))]\\nn=len(s)\\nx=[0]*2019\\ndp = 0\\ndim = 1\\nfor si in s:\\n  dp = (dp + si*dim) % 2019\\n  x[dp] += 1\\n  dim = dim * 10 % 2019\\nans = x[0]\\nfor i in range(2019):\\n  ans += x[i]*(x[i]-1)//2\\nprint(ans)\", \"S = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    #print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum+x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num-1)) // 2   # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for i1 in range(1, lens+1):\\n        ss += (int(s[-i1]) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"s=input()[::-1]\\np=2019\\nans=[0]*p\\n\\nx10, S=1, 0\\nfor i in s:\\n  S+=x10*int(i)\\n  S%=p\\n  x10*=10\\n  x10%=p\\n  ans[S]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\nmod = 2019\\n\\nt = len(S)\\nl = [0] * (t + 1)\\nfor i in range(t-1, -1, -1):\\n    l[i] = (l[i+1] + int(S[i]) * pow(10, t-i-1, mod)) % mod\\n\\nfrom collections import Counter\\n\\ndef nC2(n):\\n    return n * (n - 1) // 2\\n\\nl = list(Counter(l).values())\\n\\nans = 0\\nfor i in l:\\n    ans += nC2(i)\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nP = [0] * (len(S)+1)\\nmod = 2019\\nd = 1\\nfor i in range(len(S), 0, -1):\\n    P[i-1] = int(S[i-1])*d + P[i]\\n    P[i-1] = P[i-1] % mod\\n    d *= 10\\n    d = d % mod\\n\\nP = Counter(P)\\nans = 0\\nfor p in P.values():\\n    ans += p*(p-1)//2\\nprint(ans)\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for se in s[::-1]:\\n        ss += (int(se) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S=input()\\nN=len(S)\\n\\nT=[0]\\nfor i in range(N):\\n    p = int(S[-1-i])\\n    T.append( (T[-1]+ pow(10,i,2019)*p)%2019 )\\n    \\nfrom collections import Counter\\nans=0\\nU=dict(Counter(T))\\nfor num in U:\\n    ans += U[num]*(U[num]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nMOD = 2019\\n\\nacc_mod = [0]\\nfor i, s in enumerate(S[::-1]):\\n    acc_mod.append((acc_mod[-1] + s * pow(10, i, MOD)) % MOD)\\n\\nans = 0\\nfor v in list(Counter(acc_mod).values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"from itertools import accumulate\\nfrom collections import Counter\\n\\n\\ndef solve(n):\\n    return n * (n - 1) // 2\\n\\n\\ns = input()[::-1]\\nMOD = 2019\\n\\n# \\u4e8b\\u524d\\u8a08\\u7b97\\nrest = []\\nfor i, x in enumerate(s):\\n    # 1, 10, 100, 1000...\\u306e\\u5270\\u4f59\\u3092\\u9806\\u306b\\u8a08\\u7b97\\u3057\\u3001\\u5404\\u6841\\u307e\\u3067\\u306e\\u5270\\u4f59\\u3092\\u8a08\\u7b97\\n    if i == 0:\\n        tmp = 1\\n    else:\\n        tmp = tmp * 10 % MOD\\n    rest.append(int(x) * tmp % MOD)\\n\\nresult = [x % MOD for x in list(accumulate(rest))]\\n\\n# 0\\u306f\\u5358\\u72ec\\u30672019\\u306e\\u500d\\u6570\\nzero = result.count(0)\\n\\n# \\u4ed6\\u306f\\u30b3\\u30f3\\u30d3\\u30cd\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7d50\\u679c\\nc = Counter(result)\\nc = list(c.values())\\n\\n# \\u8db3\\u3057\\u3066\\u51fa\\u529b\\nprint(sum([solve(x) for x in c if x >= 2]) + zero)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = input()\\nn = len(S)\\ns = [0]\\nfor i, x in enumerate(S):\\n\\ts.append(int(S[i])*pow(10, n-i-1, 2019)%2019)\\n\\ntmp = 0\\nt = []\\nfor x in s:\\n\\ttmp = (tmp+x)%2019\\n\\tt.append(tmp)\\n\\nans = 0\\nfor v in Counter(t).values():\\n\\tans += v*(v-1)//2\\nprint(ans)\", \"MOD = 2019\\n\\\"\\\"\\\"\\ndef part_count(S):\\n  B = [0 for _ in range(MOD)]\\n  C = [0 for _ in range(MOD)]\\n  L = [0 for _ in range(MOD)]\\n  R = [0 for _ in range(MOD)]\\n  \\n  if len(S) == 1:\\n    s = S[0]\\n    B[s] = 1 \\n    return (B, L, R, C)\\n  S_L = S[:len(S)//2]\\n  S_R = S[len(S)//2:]\\n  \\n  B1, L1, R1, C1 = part_count(S_L)\\n  B2, L2, R2, C2 = part_count(S_R)\\n    \\n  for j in range(MOD):\\n    C[j] += C1[j] + C2[j]\\n    L[j] += L1[j]\\n    R[j] += R2[j]\\n    for i in range(MOD):\\n      B[j] += B1[i] * B2[(-i + j)%MOD]\\n      L[j] += B1[i] * L2[(-i + j)%MOD]\\n      R[j] += B2[i] * R1[(-i + j)%MOD]\\n      C[j] += R1[i] * L2[(-i + j)%MOD]\\n  \\n  return (B, L, R, C) #\\u4e21\\u5074\\u96a3\\u63a5\\u3001\\u5de6\\u96a3\\u63a5\\u3001\\u53f3\\u96a3\\u63a5\\u3001\\u96a3\\u63a5\\u306a\\u3057\\u306e\\u500b\\u6570\\n\\\"\\\"\\\"\\n\\nS = list(input())\\nS.reverse()\\nN = len(S)\\nS = [int(S[i]) for i in range(N)]\\nMOD = 2019\\n\\na = 1\\nfor i in range(N): \\n  S[i] *= a\\n  S[i] %= MOD\\n  a *= 10 \\n  a %= MOD\\n  \\n#B, L, R, C = part_count(S)\\n#print(B[0] + L[0] + R[0] + C[0])\\nT = [0 for _ in range(N+1)]\\nfor i in range(1,N+1):\\n  T[i] += S[i-1] + T[i-1]\\n  T[i] %= MOD\\n\\n#print(T)\\n\\nC = [0 for i in range(MOD)]  \\nfor i in range(N+1):\\n  C[T[i]] += 1\\n\\n#print(C)\\n\\nans = 0\\nfor i in range(MOD):\\n  ans += C[i]*(C[i]-1)//2\\n  \\nprint(ans)\\n\", \"s=input()\\nls=len(s)\\nm=[0]*(2019)\\nm[0]+=1\\n\\ncnt = 0\\nb = 0\\nfor i in range(ls):\\n  a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019\\n  m[a] += 1\\n  b = a\\n  cnt += 1\\n\\nans = 0\\nfor i in m:\\n  if i <= 1:\\n    continue\\n  ans += i*(i-1)//2\\n\\nprint(ans)\\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\\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  s=S()\\n  n=len(s)\\n  s=s[::-1]\\n\\n  rl=[0]*(n+1)\\n  for i,x in enumerate(s):\\n    rl[i+1]=(int(x)*pow(10,i,2019))%2019\\n\\n  for i in range(n):\\n    rl[i+1]+=rl[i]\\n    rl[i+1]%=2019\\n\\n\\n  sl=summarizeList(rl)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    ans+=(c*(c-1))//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"from itertools import accumulate\\n\\nS = input()\\n\\nR = [1]\\nfor _ in range(len(S)-1):\\n    R.append(R[-1]*10%2019)\\n\\nL = [int(s)*r for s, r in zip(reversed(S), R)]\\nZ = list(accumulate(L, func=lambda a, b: (a+b)%2019))\\n\\nT = [1]+[0]*2018\\nfor z in Z:\\n    T[z] += 1\\n\\nf = lambda n: n*(n-1)//2\\nprint(sum(f(t) for t in T))\", \"import sys\\nreadline = sys.stdin.readline\\n\\nS = readline().rstrip()\\nDIV = 2019\\n\\ncur = 0\\nfrom collections import defaultdict\\ndic = defaultdict(int)\\nfor i in range(len(S) - 1, -1, -1):\\n  cur += ((int(S[i]) % DIV) * pow(10, (len(S) - 1 - i), DIV)) % DIV\\n  cur %= DIV\\n  dic[cur] += 1\\n\\nans = 0\\n# 0\\u306f\\u5358\\u72ec\\u3067\\u3082\\u3088\\u3044\\nfor key, val in dic.items():\\n  if key == 0:\\n    ans += val\\n  ans += (val * (val - 1)) // 2\\n\\nprint(ans)\", \"# \\u89e3\\u8aacAC\\nimport math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\\n#from operator import itemgetter\\n#from heapq import heappush, heappop\\n#import numpy as np\\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\\n#from scipy.sparse import csr_matrix\\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\nmod = 10**9 + 7\\n\\nstdin = sys.stdin\\n\\nni = lambda: int(ns())\\nnf = lambda: float(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nnb = lambda: list(map(float, stdin.readline().split()))\\nns = lambda: stdin.readline().rstrip()  # ignore trailing spaces\\n\\nS = ns()\\nn = len(S)\\nT = [0] * (n+1)\\nd = {0: 1}\\nfor k in range(n-1, -1, -1):\\n    tmp = (T[k+1] + pow(10, n - k - 1, 2019) * int(S[k])) % 2019\\n    T[k] = tmp\\n    if tmp not in list(d.keys()):\\n        d[tmp] = 1\\n    else:\\n        d[tmp] += 1\\nans = 0\\nfor k, v in list(d.items()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"S=input()\\nS=list(reversed(S))\\n\\nm=2019\\ncnt=[0 for i in range(m)]\\n\\nlen_S=len(S)\\nx=1\\ntot=0\\nans=0\\n\\nfor i in range(len(S)):\\n    cnt[tot]+=1\\n    tot+=(ord(S[i])-ord('0'))*x\\n    tot %= m\\n    ans+=cnt[tot]\\n    x=x*10%m\\n\\nprint(ans)\"]",
        "difficulty": "interview",
        "input": "173634115486818372951282614153195673397813531768644496674118111514375282382421544535912588573396316983136484439168612235141631352674346125985614254141671732991329991329124774265213783788575712519988144216138361174441618756512523751393116541561395129136888226852768444111245831459737514845298812143954716919225834911613181194429715869341312354825411181115115486871472689845567232782375254513952968462351738954164346625641391662619988197315826852717484541655581138716593586577434118313412477421972563579453793467126995111568871766625146175616858651716154482185249418554611455699298812155261118695941738359199881847981213419615795987291484561362825694536187161397517744619915929912786227813533634217767212961985269591481946126187573895411669824542759913291653561187363211912111225641675771485984825771111448811629441873632337173524941928145189382211427542786221873632831828184132816979791895841419952387648357363142137611871721148811993348694536284679164346691662612537991635391578858172826456532124976118332522866982362231728264385629185142314718511358787186959417969131294526448919382428669813688821461756254394258432123562814698321893822878265134465472885919624681746435589548516864163337183384731294592874119928615182881112469387648134667316636561877671346673187767129417974299214254145794532382425511871292161766625161721926448944216178135318211381336578296793264489199275361377636745819786211932291845366124774214395471263894133657892268383182829881234726829679311427549469114583136238711514252624713729261175738159118352712967937631829832531942278119726733515415869341649523199881952968144358515263641877671376958184536612154383674587914481542516379572181911958551167375173289715384781138716456294672327155664911649631568763161521118526579453575415912588496674575415714726716745357363738954131638816535611181115189382215384781665675952968195843383611326483114679283182846235112477427328971851423462351918645139311954987849999357363176258735736318453663331351699998198467717686441368882189584115748271674511488111146792775296526959114881118352711366863587529174239717282648641321756531982658126187518716137389543916868479819725633674588479817161534928772482117868151552611476484983253171615167778919523731893822625891378977146983213426351645485383612624746235113668631469832124572315667441899879115486876318214415663775537349165128261889784146175617625871322445288717886341728859125379912679321873632172826419321831481946122351418372912214951754511146377575712575712578942913769581762587166971366627597624932778115486828871767636519644871372921944297175451135736312921611346781356768141128118534421661637123764765213756532813657847981675771623276152838319846777833721136697585512745841292161911993442161153645918594991294179142945289239882577186817183123317948911584915126793262589413895186757599132951888318776712275521366863164952315283831782777692517186151868847934726861579523824211427545552251554636985741548573125178168384684394217524921718169494655173835988836391686843942341211847986178149751777369359711391972563173432169453669453684596113264831617219195641113163881651542333135298812246318692517922683175249227862239168619483351615215384784744651827195833847182315713668637813531768644137695877327714294521538478195237357743416434668479828467918514236622326965551338597168182742399991329892398161116233515417524926299283412111574821625295793467767221718169567339714726633966458313629928373515194227848254154513367458787416662763598512881228459611968525716745113669721199514819461633371129216179691561282189786188372799536717928721564725621852179287244821815586682584321485984148194612558185713772624712154381958431623276355344153645976722136484414758892463182362231796912846791847385111246918413281699998115486868847919725636844415733964461994461996178141411281387648769239161923883788537149611346781441566619833228147181911916414471156887118111518615181211425641312679327752968742273694772442996783841784796652137134869274299257137748657915384781152849127398913567681873632874227545137874114839654825417349161588953242281796911754511345249621852189584113688821911993141531919967911449642587529524941869594785391771258168182761579511124691568763131638859358671876414496422947741114488158491528467915586685148455451317847965289782261284159141261875186959414274331554631211417161516333713654398944177995241114488187363267434619846775612821451661119524813991678318281463775827791695966662777731511467929852721752492866151152434511387162422854916819382417262457732771566744714726339192979215192612615384789852721887765171211218736321395129528978417933112862115384781796911843347187968912497616178141574827712588782656157951944297141531916152175249214859843391921728264195641117666254845619826581481946522921631947476484176864466828913749391223514194631684192318433475673393391926561752281471322445286698545136945362725651649523123159876246153645917524926319472866987934671772682131638811568871336578119121122957158551623871179892979144895498714435853331351653561139916714112811334559629928116294458147214254141744416543111278622177873972885916717321259856482541462351946911184738583586699334858349176318218635371588953119121573396363422745844966741829214111246937149618756517389541122564343231623276672327652137148194616495231952373262475935861471851619833157683918615188237526561751231596521371986696343231584915991329115284948657971674584192315122311879689817695375534188372758551254394113669716656751463775565321471851182719519281457349161326483262471346673195843359382158693433515412941791544535783372654156864132172826416212577934671665675152636449869314153199933481956411151223119725631378977954987179892928266189987957541513163885794531946316195641118171524943432318211381859499179892967434639976239572416535617793341512231557244551187125783719786282375219846773896677591444138955673392826659358655926381971488432219685255552257591441617219168384652897816737511144773129216144762337351537149665617551484593883511366971712112387648635985161721983788541591417383596642511181115946911621852187767413895178479618716131425414171211218756515168647672216777894239915283831564725294774125783714233956622321627314831828159299194287329679318473859125881249761175653133859748456142339517767243812324429994893182517617121121887765131638836342183527112194761469832178681584798157683933313512921637553482173352292124833729881241995225439414213761467813516864613776516864145368186555694287349263624631898527219321831451661133455965415636543919887151586934166163715364591958436238711255818678384486579333135129821719422785794531296198145166126448915687635612821415319137292357363134465488836833847288717878265262479327783694775996431968525284679672327116294416858655774341114488773277298812585517167451421376175249216818273331351183134341211698574918645543111135273573396165961887422714193574381232463187611632967931762587131638839976278942913244641734321176258725237511124691154868183325218312331932183145166114274331592991381591154251699738648657913244649489311225647429921114488176258734323114679226448919261261944297173835935938283182811811151837291651542936816613776169192213365781762587194429719442971584915154453515384785774341265913868176258946638977529614173381568763878265164548515929911792872189786199679151484545831315566491683846472446189382256733915546311185261629333355344195641117787391998813876481932183132446412578374724469731581316388147387147992716293337248217732771619238128812219988191864518655562422844216119826581479927164346613547491344654775296126187516131811146792991329819714146175618372936342936816771258575415126995112174571263894144358518877655834911522326197458236745834323316983136888216575991629333561282155866817262451576839187968976116318534423735151829214174441618433471514257934671578858164144711912116939411413318433471346673189786162327615586681772682573396112862113547494764841249761415914141733839572413567681431471498693119928651282679346722814716757773491698123477125828266262471714131154857392268319947721411281977196182921479548612699511185153116496328669815283836824221144773132648341793397921517464351348692169999815889531397148157482175451111851537793344885981239666185748132446489239812235141984677825771143349833847969127894296541561326483837885938835116294415162691883727121341917363452695956733915485736359851899879482541143752828871712315992874179892914294521617219714726575415736935524944643712356284199524219716945364542751992753896436779334448218137695888634116353945629449667476116345629417928721661637182315717666251972563728859168182718312334966741641447186959419543921841328122957165415616515426662719584314193571724226246318186757513224454724461659618133859736947715182881265913123159181911997113984192358551197458218413288782657672213769586157951423395156674467434628266438123188978413729266828957137712921667434635938265213717282646198337288591427433153444952968178681515445352927554381238923981132659316983787411195248162933367434671876416212573472681164963757125165961897517717524921588953163337114274339973861292166985741427433115486855724459964315768392463185249493883512739891546554182517614375283634213426355249419564117813531659618124168535938263194716979793896671845366121745784798181715915671439547799524333135157885811346781417338557244188776514839651263894621852559263946911171211216999984663897611634138951728264252375524946682898964368338471938241796918176959529684724462927552967934159141245723623871168182716111621671732179892919119932362234482181451661142339511387163856291681827197256315465545996431413312194769469112988121423395787413735151936221175854916737511366863148598414294521742397357363125985615324215451311346785895481516269615795198265812961988116388964362261289913291786815199275316596183311163714961164963543111143752812719716636563735159973861897861611162196448748859815849155713777773151288122547149198467712235141453681397148194227815889531794891139512993883517161511185261219476145166115243459751771366863193218313224451675771253799567339139916714839659953675471495875293876481887765137695812941792725651982658152434566627543111188574615445351613181151828812214951526364197458212719792672113567681621257142541415667446339666238711267932173634153645936543915647258338477571251457718785391152838329477419422787167459368161181115166163716616373674589267218964361752492516864819714983253167173224631814637751893822141733817444169953671423395134667313729239168617686441114488156674416192386339661643466187161318271951625295421971759144174845492268378942917989296137761538478692517121543824429955118799536738562914577181459737484561893822154857314637751453681128621187161313931145831317524929549875188831314369185949962589141935731496486817912588196448716192381819119793467153847811488111788834182113815526113977431877677773158782651265913134667344216115384783533251673751779334156674491258813466731665675355344114477372684821733134465477933487624612659131479927369477199679112295711538478736935174643525439459762428266112862163194718171179892918191191986696577434236223144358511871721522326163942818978619826583775533977432523751164963331116169596181911948254117565335736321199511669825834913977437833727995241213419165759915526115794531887765185546183384774299279144891258877731514698325552256622321296198176662531698372482173491616495231326483413895125178876246161721915324219125886925171871613181711245723111246927256597517714274331548573134869235332518574888432252292178942914294521873632121543812214957389546622326319477672257137717444162442995834911336578131235112256411891912866986561751744416658194132648336543914516613957241827195559263141531948657915122311788834144156615768391461756977196144964246638973895418292141948335167577551187174643511629449448921475889864132111852672684575415349287182517623622311952481354749654156615795916626161318158752917444161237647126995111871721267932179691146579413446541677789258432139714842399997386177268211932298277913365781635392685271257837157683911225642483371877671613181763182152636484596152292115929911526364847981273989555225868171269951147588912356283896671875651399762367458145166111225641954392162125715364599347976985741522326179691165154212982171342635166365636543965819471472614577182362235229211114488129417967838418574815445355552251366863193824791448714726193824135676812315919261261683846185546119543921134678341211246318151223139976295498754311162387117464357773151831233195439219947721875651926721114881184999911811151358787466389777315787411641447157683939572434323918645134667313729246437179287276722184132842399549168825771187565174299219422788237521251785834918863411265913833847688479146175615142514758891223514918645146781329275515142593883517363417726821114488128812217767246437827794764841762587631947928744482181546554148598417888341512231125178486579349287146983214435859953676642513876481397148178883467838416999981956411162529519261261649523133657819644871687884164952317787396157957833723694771782777385629898455726841334559197256387826515748216858658358662826673895461983347648425439459156782375233919214577185693581288122597624379572662232658194161116298527224429918776713143698782651166982847989893113325417181693533251528383254394153847884192371674545225651282689441731698311891919953679347973957249448921247742195439211932299691283182812537997874113931117161512416854199521162944112862113163882362231639428518883692517193824171615192612611932291413399132972885913648449287418675751294179154251667434616636563391924885987995249448921334559172826455724413486921546554124774215849152281477591441994772559263244299123966614375281714131482541389667154251666627169999891864584596155926365415616172194482181974582484564421617954861417338514845134263568444186413281769552695919866961861518195641169251714758891522326165356186615115546317161515162691776721845366498693363421338597141935718796893755341433499448921552611421971936816599643736935543111934797155261122612852695983182838562918453668318281962468769239922683187968918958415552254845688634149869397921588836182719547446577731513628251944297136484411871728378855592635471496178142725657429921823157133254143954717585491835271195843153645965415638764897113966828931496416979791768644444181469832179691696555155261128669858954836543913991678176952483371197267514845363421271978378852261283129451255818121543815445351621257174441615526118681711245831253799142541414435853593826763651659618244299181711786815874227228147813657194429714819461778739156472578539121199586413228266187161317686441798929114477382173352897817666251653561387648178883422612859762417262451193229143954721199515647251768644174643512235149812341936221573396111246916111621875651115688711992861195248118515345225613163888358666561751645485524943714961843347874227146579416333714562945188836743465693581288122684441119524813244648237521265913148194699738616838468136571817159762495296881567625439434524938764883182814193571996791466389122351412719718191194946551823157186757529477438562915667441635391958432584322281474542759953671633371335154169596119726778539112921666627684441142339552695917686442967933735151851423123159188574617625871479927298812198265811568879852727833721332541869594619833847981261875123764712134197571251819119182517637755348657912134191564725141733845225644821878539111366971288122111246911851537894298358661875651995367156876375712597315813365781423395135676814799271249761843942619833114881117524926299281397148777315162125754714927256566627791448179489178741813657718764575415126389494691163598594287318554611986696421971145166179952455118713385971986696132648372885956532316983286698156876312255331869594161528439421288122716745132446433515481971411912118837271994772835866898455183527173895411488115188831239666254394686461372926198336945361827195129821724833715485731245723591567123562817686441895841133254559263147387184738512214951265913674346585513452496359853957243674586925174179339186454421611794891158491542197113345591447623156876313325412255334441818292141211438764817242261695961263894181719388351433491417338954987928747672215223261564725189987918271951516269728859724821771258174643524631813628251681827916626119322912558188378855895481958431558668183729166769415889531433498217338782652422817787391197267199881186151888836785391151223117585491227552126793218171171211297113918211381358787591567134465411124691948335126187542197165819418594991926126472446167173248456113265912457233311161366863133254821733989311665675159299116676941475889174239755118724631818332525592631687884357363656175763182147992712154382543941271971699998175653981234124572316152151425888361512231125379965415658349171876413688821683846678384284679155866817767219422781346673248337246318365439185748874227977196195641177731536745847648437149655522516858651948335583491181713169831863537187161316152783372147588915364591841328718764178681565819419119931469832192814554916874299212517818292143674581962468177873937957219261261798929862113446199113871657339617282641879689591567193622119745821368882165961819967911994772161923818372979144817969174299263598517565314435853129451782777169596379572185142352494113871619988113729217868151411281936816264489157683917585494562941831233186757516333711712112164346612315918938221366863545134159141237647734916182315712356281629333387648154655468847984999935938213163882967931683846795486518883547149189987911871721699998773277811638726841271971356768831828835866184536612416858681737755389643644418623871185949917423971827195164346614274331911993154655418211386319472927551673751353325146175659762429881218594996844417732771566744343238358666965551728264569358161923811811151425414133859758954848456146579413244649771961615218615186258919584363194749869354311113931136745811427543714961393115552251162944734916365439385629827791592991146579473693572482114435857288592786221762587442161145166193479717242261463775819714448218189786337173121341935736318251769852721451661187161323622322612815748217969113466731667694926721186959416999989691218514237995244421616662761983338966714173385269597752969125881996791142945293883517141311641447341211132244586413218554619347971114488112862111245835774342826616616375996438863416763651463775119121823752874227296793583491163539195843878265187161312295713856294623517732776723271863537593586178681557541544619951282611124695229214926369125884764841655588661511316388123966672885989845512921616535611271971728264126793217181695834911788834339192155866899132916555873491669453614173381899879111246917868155188839388355895481877674199521524345363421996791821733169192249869333919215667441956411442161169596154857314577181556649232185184334731496416878845431116682896218523351546763651376958345249573396156674413628258964361851423936816166567518796891358787199881148396538764833515411831345491685188831786815114881183384736342288717583491845961232185157683976923914758894219711457718125985636947718958414583133836116757747244618574817868151463775134869211225644845676318287422711488111768644112256419725632281471649523152636415425161685865123159134263537755311528495289786884799448921566744696555184738517181696642511758549125985612235141267932557244122755252695918897845168641768644569358172826451888352494282664562949953671724226599643494655139714818756511479927228147815676579453179489182375213688823351546319471336578591567161116293479741187656128216858651851423112862117545111613181173634381591162327684596186615112558181197267135474989845518776714597374966748762461926126171413115566491469832666278944178641323997621368882264489133254195439297113919725631954392198265811669826642511526364684441397743189584181365797113914657943169834179331817112739891817112295713795721542516545131219476678384187767197458219644877793347732771542516112458319463161677789122957113365782947741817114314713371731257837123159179489118332521784796173432118695943977436258913143691253799123562812719715162698257715673391263894186353725439419321831932183371496668289581472777315242281568763926721175249215263643492871766625528978171816992268311629441483965296793122149533111695296816858658156769792152624716515421144773162731441591419786257743416414471714131476484345249151425724821969121249761575415597624163942887624614334965819415243451191215693588762465834917672252695918554613997621427433837885161116212537991871613993348254394132446417161512982179691289643612881221643466184536641591455522556532158895316737511199286122755218352714986933876485713777954869893112739894583131782777862113868177894291875651884322347268196448712416851653561573396587529331116185949977125815425167995241641447411876343232725654159142846797631821433491889784189786714726137695822612899132972684133657813688821936221732897154655415445353169836198331639428787417369351479927262471772682363421485984757125114679296912162731426852713668631788834165759912275521344654954987185142319745821744416133455946638912679327874114758893452495794531619238183325216333711734321876246878265335154795486585511393113331357874112315941389583384718736321754511185344215485739812343654393573631114488617814718764122957178741599643144964293277812174576218521869594492636198265818433476157953311161538478353325954987119322918413281843347164144718615181948335155463472446942873148598416717325592632463181673751547149157482179489138159156733912295717147265148451516269141935737553418251768116381655581459737413895174441613143697793342947741972563165558442161121947611366974845659964331496412295711667694244299785391164952319321831821138143954788836141733814556991653561158289684394213325413951291342635121543814516615511871358787175854913264831932183635985621852146579415364591681827134465418534421265913116294418514234885987954861257837528978125985614193571219476926721187161316212571457718884322244299115688715223261269951977196176662514415668378851372921657599381591841923597624585511978621584915652137115688712638946137761195248278622811638172826484999986211318352711471851652137155866837957216333711156887179691121543819321831847385169192216818271653561635985726841395129353325159299116313521762587115486883586611548681288122111852699132914334916818277954866137761944297178277719584393681658954859964326448926247371496678384151828812679329125881479927585518217332584321962468732897115486851686416575996178142564134825411265913936816124572311447731522326164144737351516454857914483492871911993126187514314715834911479927268527581472353325589548179287257541518897841263894365439385629983253156876377731513769581841328349287268527179287279144818211381546554166971312558183735152483371245723825771835866139714816454851845366157482389667126591341187617928721651542413895169394111548681978622584327793341164963134263518292141344654198669611952489226833412115915673432341389511629441348692177268213567681619238294774228147122351411811151443585157683927862215566491665675168586536947716676943896671691922116698214496421992753278622199881168384616636564138957752965511878499991479927182315772482118776714193571661637369477288717969121449642161721911346785592639388351397148133657815667444522567833728197141992753184536656935818716131439547173432111144881841328195641119866961845366385629759144452256389667112256469251713789771142754474465132446459964315344412416856178141473875451361175716777891235628113265913426351249761377553785391184536617161514637759913296783847187643391921399167135878746638969453654513163942811568871885746113669717666259913293412111944297179691162327659762415324212967935855115243458358661972563182719588836161522321857752967248215774344623514623516581945269591885746188978411629443876481782777194833566627979215125581819624682624758349114799272947749448929489341187624631814153191552611876246898455186555645831323622349465528669818433471667694179287215122319226831223514878265172422619685253149641255818188574673693519523734522568459611342635979215165154292268312154381681827171615187161313466731395129946911195237314678139832531229571165961813668631193229157885817847961576839139311185546114193574118762685274159148197141823157383618863418237521425414182113818473857732773351541833252419952678384773277391686932778464371718169128812217686447752961552611492636158895317686442866986319475269591322445492636111448813264831944297383614643716757716818276682891217457631947936816148396586615112134196137761142754349287181911936543919624681437528954987116294466425176722823752785391599643195641119685258923987914481651542979215272565896436199679148456837885456294128812219887151645485492636444181746435178277746437199477212497611166982124976193681649263649869361579514274339771961156887167375116394281352731889784143752817141311417338136282586211361781433111612114211995353325228147196246851888314516616622321649523242284966745814725713776561756198336723273412111467813446199127398967434665415667838415546316273141673751811638678384154453524228126995111811153694771657599135878716717321619238571377934797135676812659131397148142339517242265693583714962321854623517672282375282779124774292874226128166163727862214173381887765997386152434518736328964361144773187363218312333311161326483896436137695817948915814721883727121543833717311811151467813166769472885989845581365739168617524922745841269951969129327789287461983393479745831356935826448917121125431115229211954392161721915526115612828338475592639832531825176118515319624684461991768644821733155664917282641261875162125716495233573631895841184738577125812921681971419927532523753634216717322786221691922186353783788559964368646456294135676818534425713771342635153645968242212961981768644136282528467935736339976215929911552611833847118515315485731762587123966615546319463167813531778739611757862113196852548657935736318594997429923331351938241766625133859758551355344993348142339518271951269951631947815676355344991329248337163942812356281417338718764165558417933161721916858651962468185748625891825176411876198669633515425439473289717121123351545733966844413573639549876157951419357134869219119935713771728264619833142541435938217343214865791221495339192121341968646143954713224451437528129821717666256299281231591271971251781875651147588911447731641447916626979215114679213789774926368176954946551522326268527184536613789777349166985741431471395724692517262471419357995367182113811932296238711998811932183983253161721916252951956411121947611912116313521483965193218387624615182886763656884794461995834912887171433491142754993348189382213648446339661897868318281968525119322936947712416854118761588953165759912214951611162187968959156717787392624736543941995268847919261265875291437528187161311488111865556141331294179169797913931155724419261261693941144762313264836662716172191124583442161359382779334134869215223263331358257714522569529681124583472446125581873289782375212679324199529448921954392174643515768391665675148194617666251776721625295141935716515426137762624718231571669713127197635985193824122755217242261659618843942226128131235113467846638981769587422718615181855461926721975177147387571377131638852695917888341986696682422188574617524929489318796891221495512826716745922683876246111852611447738661511528383971139656175125783765617516515428338473896671835271363421259856139512959762414375285269593169831314369198871511488111372927712581334559178681598729189845514415667611631449642165759928467941995212295714482181843347496674179691676365484565915675269591887765942873827797773151316388369477183729298812543111417933178681535534417928722887171988715197256348456177873919422785128262321851782777152636466425114334911346781843347119121629928143954718736321899879991329191199318655568964365693582644894239915828961625295134263511568871851423886341132648315687635249415142595498798729133313583182844418928741625295922683793467353325363421948335139311894417142541417827774885981895841177672543111188372769453618958415229211437528284679187767942873169596619833187565199334841793377933429477419321833755341463775419952868172382421566744186151817686441215438166769412638942927559812347288591411281183123316131813896671853442122351457945312598563391921548573147992783788579548694489288836837885912588518883186959442399252375345249165558151425192612661377619866961142754575415158693415586682988121461756579453139916779952477125847648414718511451661244299185344288432213325415122311219476912588142339516172195834911471851155866817161562992816636561548573716745948931193229775296185344272885999738616414471758549136484411568871942278714726264489811638115486813951291528383195439213123517585491792872161116214476235976241518288728859547149934797226128615795186353714415661635393573631122564421971126389412638941851423125783711245831782777198871518655561334559991329823752189786142743314233951463775175653196246862589145569968242217565388634133919217928721754511559263126187531698314334952695912537998459619933481982658413895367458912588952968121341923824263194713931116555814678131649523339192175854991662636745811932293714961213419155261119119932725651932183922683173835913567689428733634282375214112818762461817113648445431111342635795486629928734916171413116616371148811421971187968915384783775531431471975177178681514657949852728156761514251429452155463357363155261117726825814723492877813531576839446199125581889441717484548621131631352132446491662621199518453663149641534441926126926721188978416293333351541716151938241253799174239733515416818279893169251718473856117578782651528383264489123159166163743812314395475733961453686965551346673954987258432185142386615163598516172191227552631947189987914758891217457759144148396515828961346673819714472446635985194631684394267838418716131942278118313417181691556649559263184738598931397743561282188574616939418681788432217787395754151413319321839852725976248439421514253593821584915187363218514231213419969121271975875291241685132648346638913486925249414173381667694163942815162691187172387648189987915748261983319846776581949832538197143775531574827328971259856979215186353719321831869594137493912356281336578161318123622351484529275519927531156887664251169394116353916818276157951229571942873164346633313516737514583131556649343231897868863411187172454275492636512826399762656175169394145831394893126187514112811374939985272198669638764817121121245723825771129417912154387853911835271654156886341456294589548194429751888313325413264831441566178883493883582779163337149667412558181669713543111182517616454851514251621257979215173835916575991853442298812175854911952481621257112862186211328871716434666884796662718635371449642122553316131811984677143954719463161324464482541182113815768391944297186151816737511431471718764198669631294519422781964487143147169857412214951873632183123315546372885919624681962468131235198265839168615445351546554136888214819461261875175854914496422362237874112356282826612961981255818993348345249178479667636579548612941791855461121341986615116353933717314415661768644341211162327616111628843221522326476484197862174239711366971162944845961139714898325339168661377641793319927531439547199275369251711286217429921986696168384612154381483965894417551187139714882779696555419952182315711851531473872887178358669368161485984166769412134198964361364844157885867838419261261316388169999839168671472612598561911993353325137695884596189845535938282173312235141558668179287218171918645571377615795448218629928981234186353771674511992866824221623276989311885746567339155664918837271166982161923867636516273148318281195248942873181911918211381962468236223831828162731416737511613181182517615647252523757712581342635121147187641893822158491519927534764841465794168384687624661781417726829125883977438641321425414623871164548571674515869341938249529685612823755341542516365439162731412174571877679529688681761377659762415324211681827391686196448751282613143696198331425414849999168788481163835938215929913371733634217565317726821677789524947187649973861247742759144878265278622983253989317894299267217752968176951588953187767199881114881114516617571251964487474465189382217363496912166971327862212497615471491423395353325127197199881676365118919114859841667694543111127398912194761726245121745751282613426356945361211416192381833252189786153847869857418635371261875185949912961981544535146579481163811427546359859469111994772151425148598415445354764843977436137769731585552251699998191199378539114496421617219989318883674299217161519725631952373195237316252952261281138716526959128812214173381655581322445177268219988116252951473871835271135878714193576178142261285572441524345587529918645136282515445351395129163942812194769893167838484394279346716273145653217464357732771782777185142312719729679317282643836151686498527212659131693941583491886341133455911124691429452975177355344154655466627119322916152153242118433475229211861518866151591567154251652897819927531528383298812841923169192235332516737512745843977431752492118515317343211857481889784167778984798837885197862126591313325414657941869594486579989311855461549168464373836116192388338479852723876481152849147185118635374381234643789643666828914274338883615889531346673692517114275413345593876486479144493\n",
        "output": "13279582\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc164/tasks/abc164_d"
    },
    {
        "id": 656,
        "task_id": 2242,
        "test_case_id": 10,
        "question": "Given is a string S consisting of digits from 1 through 9.\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\n-----Constraints-----\n - 1 ≤ |S| ≤ 200000\n - S is a string consisting of digits from 1 through 9.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nS\n\n-----Output-----\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\n-----Sample Input-----\n1817181712114\n\n-----Sample Output-----\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.",
        "solutions": "[\"s=input()[::-1]\\nalist=[0]*2019\\nnum1=0\\nnum2=1/10\\nlens=len(s)\\nfor i in range(lens):\\n  num2=int(((num2)*10)%2019)\\n  num1=(num1+int(s[i])*(num2))%2019\\n  alist[num1]+=1\\nalist[0]+=1\\nans=0\\nfor i in range(2019):\\n  ans+=alist[i]*(alist[i]-1)//2\\nprint(ans)\", \"ans=0\\nS=input()\\na=len(S)\\nk=0\\nc=dict()\\nmod=2019\\ns=1\\nc[0]=1\\nfor i in range(a):\\n  k+=(s*int(S[a-i-1]))\\n  k%=mod\\n  s*=10\\n  s%=mod\\n  if k in c:\\n    c[k]+=1\\n  else:\\n    c[k]=1\\nfor i in c:\\n  ans+=c[i]*(c[i]-1)//2\\nprint(ans)\", \"S = input()\\nN = len(S)\\nA = [int(S[i]) for i in range(N)]\\nA = A[::-1]\\n\\nMOD = 2019\\n\\np10 = [1] * N\\nfor i in range(1, N):\\n\\tp10[i] = (p10[i - 1] * 10) % MOD\\n\\nfor i in range(N):\\n\\tA[i] = (A[i] * p10[i]) % MOD\\n\\ncumsum = [A[0]] * N\\nfor i in range(1, N):\\n\\tcumsum[i] = (cumsum[i - 1] + A[i]) % MOD\\n\\ncnt = [0] * MOD\\ncnt[0] = 1\\nfor i in range(N):\\n\\tcnt[cumsum[i]] += 1\\n\\nans = 0\\nfor i in range(MOD):\\n\\tans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\\n\", \"S = input()\\nN = len(S)\\nq = [0]\\ncount = [0 for i in range(2019)]\\nans = 0\\ncount[0] = 1\\nm10 = 1\\n\\nfor i in range(1,N+1):\\n  a = int(S[-i])\\n  #print(a, a*(10**(N-i-1)), q)\\n  q.append((a*m10+q[i-1])%2019)\\n  m10 *= 10\\n  m10 %= 2019\\n  count[q[-1]] += 1\\n\\n#print(q)\\n\\nfor i in range(2019):\\n  c = count[i]\\n  ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"import sys;      from decimal import Decimal\\nimport math;     from itertools import combinations, product\\nimport bisect;   from collections import Counter, deque, defaultdict\\n\\n# sys.setrecursionlimit(10 ** 6)\\nMOD = 10 ** 9 + 7\\nINF = 10 ** 9\\nPI = 3.14159265358979323846\\n\\ndef read_str():      return sys.stdin.readline().strip()\\ndef read_int():      return int(sys.stdin.readline().strip())\\ndef read_ints():     return map(int, sys.stdin.readline().strip().split())\\ndef read_str_list(): return list(sys.stdin.readline().strip().split())\\ndef read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))\\ndef lcm(a: int, b: int) -> int: return (a * b) // math.gcd(a, b)\\n\\nimport numpy as np\\n\\ndef Main():\\n    s = read_str()\\n    dp = np.zeros(2019, dtype=np.int64)\\n    dp[0] = 1\\n\\n    cur = 0\\n    digit = 1\\n\\n    for i in reversed(s):\\n        cur = (cur + int(i) * digit) % 2019\\n        dp[cur] += 1\\n        digit = digit * 10 % 2019\\n    \\n    print(np.sum([x * (x - 1) // 2 for x in dp]))\\n\\nif __name__ ==  '__main__':\\n    Main()\", \"import copy\\n\\ns = list(input())\\n\\ns.reverse()\\nn = len(s)\\nMOD = 2019\\nm = [0] * n\\nmsum = [0] * (n+1)\\ncnt = [0] * (MOD)\\ncnt[0] = 1\\nt = 1\\nfor i in range(n):\\n    m[i] = int(s[i]) * t % MOD\\n    msum[i+1] = (msum[i] + m[i]) % MOD\\n    cnt[msum[i+1]] += 1\\n    t = t * 10 % MOD\\n\\nans = 0\\nfor i in range(MOD):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nl[0] = 1\\n\\ntmp = 0\\nz = 1\\n\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tz = z*10%2019\\n\\tl[tmp%2019] += 1\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\n\\nprint(ans)\", \"\\ndef solve():\\n    s=input().split()[0]\\n    cnt=[0]*2020\\n    cnt[0]=1\\n    m=0\\n    t=1\\n    for d in map(int,s[-1::-1]) :\\n        m=(m+d*t)%2019\\n        t=(t*10)%2019\\n        cnt[m]+=1\\n    return sum([ k*(k-1)//2 for k in cnt])\\n\\nprint((solve()))\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import Counter\\ndef main():\\n    s = input()\\n    n = len(s)\\n\\n    amari = [0] * n\\n    ketaamari = 1\\n    t = 0\\n    for i1 in range(n):\\n        t = (t + ketaamari * int(s[-i1 -1])) % 2019\\n        amari[-i1-1] = t\\n        ketaamari = (ketaamari * 10) % 2019\\n    amari.append(0)\\n    ac = Counter(amari)\\n    r = 0\\n    for v in ac.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\n\\nS=input()\\n\\nrlist=[0]\\nfor i in range(len(S)):\\n  rlist.append((rlist[-1]+int(S[-i-1])*pow(10,i,2019))%2019)\\n  \\nc = Counter(rlist)\\nc[0] -= 1\\n\\ndef nC2(n):\\n  return n*(n-1)//2\\n  \\nans = c[0]\\nfor k in c.keys():\\n  if c[k] >= 2:\\n    ans += nC2(c[k])\\n    \\nprint(ans)\", \"from collections import Counter\\n\\nS = input()\\n# S = \\\"12345\\\"*40000\\nN = len(S)\\n\\nl = [0]*(N+1)\\nfor i in range(N-1, -1, -1):\\n    l[i] = (l[i+1] + pow(10, N-i, 2019) * int(S[i])) % 2019\\n    # if i%10000 == 0:\\n    #     print(i)\\n\\n# print(list(Counter(l).values()))\\n\\nr = sum(m*(m-1)//2 for m in Counter(l).values())\\nprint(r)\", \"s = input()\\nt = s[::-1]\\nn = len(s)\\nresid = [0] * 2019\\nresid[0] = 1\\ncsum = 0\\npowoften = 1\\nfor i in range(n):\\n    csum = (csum + int(t[i]) * powoften) % 2019\\n    powoften = (10 * powoften) % 2019\\n    resid[csum] += 1\\nans = 0\\nfor i in range(2019):\\n    ans += resid[i] * (resid[i] - 1) // 2\\nprint(ans)\", \"s = input()\\nmod = 2019\\ndic = [0] * mod\\ndic[0] += 1\\n\\ntmp = 0\\nd = 1\\nfor i in reversed(range(len(s))):\\n    tmp += int(s[i]) * d\\n    tmp %= mod\\n    d *= 10\\n    d %= mod\\n    dic[tmp] += 1\\n\\nans = [i * (i-1) / 2 for i in dic]\\nprint(int(sum(ans)))\", \"s = input()\\n\\nl = len(s)\\nnum = 0\\ncount = 0\\ndic = {0: 1}\\nfor i in range(l - 1, -1, -1):\\n  num = (num + int(s[i]) * pow(10, l - i - 1, 2019)) % 2019\\n  #print(num)\\n  #print(r)\\n  if num not in dic:\\n    dic[num] = 1\\n  else:\\n    dic[num] += 1\\nfor ele in list(dic.values()):\\n  count += ele * (ele - 1) // 2\\nprint(count)\\n\", \"from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf\\nfrom itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement\\nfrom collections import deque,defaultdict,Counter\\nfrom bisect import bisect_left,bisect_right\\nfrom operator import itemgetter\\nfrom heapq import heapify,heappop,heappush\\nfrom queue import Queue,LifoQueue,PriorityQueue\\nfrom copy import deepcopy\\nfrom time import time\\nfrom functools import reduce, lru_cache\\nimport string\\nimport sys\\nsys.setrecursionlimit(10 ** 7)\\ndef input() : return sys.stdin.readline().strip()\\ndef INT()   : return int(input())\\ndef MAP()   : return map(int,input().split())\\ndef MAP1()  : return map(lambda x:int(x)-1,input().split())\\ndef LIST()  : return list(MAP())\\ndef LIST1() : return list(MAP1())\\n\\ns = input()\\n\\n@lru_cache(None)\\ndef F(s, k):\\n    # s\\u306e\\u5de6\\u304b\\u3089k\\u6587\\u5b57\\u76ee\\u4ee5\\u964d\\u3092\\u6574\\u6570\\u3068\\u898b\\u306a\\u3057\\u305f\\u3068\\u304d\\u3001\\n    # 2019\\u3067\\u5272\\u3063\\u305f\\u4f59\\u308a\\u3092\\u8fd4\\u3059\\n    if k == len(s)-1:\\n        return int(s[k])\\n    ret = F(s, k+1) + int(s[k])*pow(10, len(s)-1-k, 2019)\\n    ret %= 2019\\n    return ret\\n\\na = [0]*2020\\nfor i in range(len(s)):\\n    a[F(s, i)] += 1\\n\\nans = a[0]\\nfor i in range(2020):\\n    ans += a[i] * (a[i]-1) // 2\\n\\nprint(ans)\", \"S=input()\\nMOD=2019\\ndp=[0]*MOD\\ndp[0]=1\\nr=0\\nt=1\\nfor c in reversed(S):\\n    r+=int(c)*t\\n    r%=MOD\\n    t*=10\\n    t%=MOD\\n    dp[r]+=1\\nprint(sum(i*(i-1)//2 for i in dp))\", \"S = input()\\ndp = [0]*(len(S)+1)\\ncur = int(S[len(S)-1])\\nmod_10 = 1\\ncount_num = [0]*2019\\ncount_num[0] += 1\\nfor i in range(len(S)):\\n    dp[len(S)-i-1] = cur\\n    count_num[cur] += 1\\n    mod_10 = (mod_10*10)%2019\\n    if i <= len(S)-2:\\n        cur = (cur+int(S[len(S)-i-2])*(mod_10))%2019\\nans = 0\\nfor i in range(2019):\\n    ans += (count_num[i]*(count_num[i]-1))//2\\nprint(ans)\\n\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in S[::-1]:\\n  s=(s+int(i)*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    # print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum + x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    # \\u5834\\u5408\\u5206\\u3051\\u306e\\u6570\\u3092\\u8db3\\u3057\\u5408\\u308f\\u305b\\u308b\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num - 1)) // 2  # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import collections\\n\\ns=list(input())\\na=[0]\\n\\ns.reverse()\\n\\nmod=2019\\n\\nmod10=1\\n\\nfor i in range(len(s)):\\n  x=int(s[i])\\n  y=a[-1]\\n  ans=(x*mod10+y)%mod\\n  a.append(ans)\\n  mod10=(mod10*10)%mod\\n  \\nans1=0\\n\\nc = collections.Counter(a)\\nd=list(c.values())\\n\\nfor r in d:\\n  if r>=2:\\n    ans1+=(r*(r-1))//2\\n    \\nprint(ans1)\", \"s = input()\\ns = s[::-1]\\n\\nL = [0]\\ncnt = 1\\nfor i in range(len(s)):\\n    L.append((L[-1]+(int(s[i])*cnt))%2019)\\n    cnt *= 10\\n    cnt %= 2019\\n\\nD = dict()\\nfor j in L:\\n    if j in D:\\n        D[j] += 1\\n    else:\\n        D[j] = 1\\nans = 0\\nfor k in D.values():\\n    ans += k * (k-1) //2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\ncnts=[0]*2019\\ncnts[0]=1\\nnum=0\\nfor i in range(n):\\n  num+=int(s[i])*pow(10,i,2019)\\n  num%=2019\\n  cnts[num]+=1\\n\\nans=0\\nfor cnt in cnts:\\n  ans+=cnt*(cnt-1)//2\\n  \\nprint(ans)\\n\", \"s = list(input())\\n\\nMOD = 2019\\n\\ntemp = 0\\nd = 1\\n\\nm = [0] * MOD\\nm[0] = 1\\n\\nfor x in reversed(s):\\n    temp += int(x) * d\\n    temp %= MOD\\n    m[temp] += 1\\n    d = (d * 10) % MOD\\n\\nans = 0\\nfor x in m:\\n    ans += x * (x-1) // 2\\n\\nprint(ans)\", \"s=input()[::-1]\\nn=len(s)\\np=2019\\nS=[0 for i in range(n+1)]\\nans=[0]*p\\n\\nx10=1\\nfor j, i in enumerate(s):\\n  S[j+1]=(S[j]+(x10*int(i)))%p\\n  x10*=10\\n  x10%=p\\n  ans[S[j+1]]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\n\\nmod = 2019\\ncnt = [0] * 2019\\ncur = 0  # \\u73fe\\u5728\\u691c\\u8a0e\\u4e2d\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\ncnt[cur] = 1\\nd = 1   # \\u6841\\n\\nfor s in S[::-1]:\\n    cur += int(s) * d\\n    cur %= mod\\n    cnt[cur] += 1\\n    d *= 10\\n    d %= mod\\n\\nans = 0\\nfor c in cnt:\\n    ans += c * (c-1) // 2\\n\\nprint(ans)\", \"#!/usr/bin/env python3\\ndef main():\\n    S = input()[::-1]\\n\\n    counts = [0] * 2019\\n    counts[0] = 1\\n    res, digit = 0, 1\\n    for i in S:\\n        res += int(i) * digit\\n        res %= 2019\\n        digit *= 10\\n        digit %= 2019\\n        counts[res] += 1\\n\\n    ans = 0\\n    for i in counts:\\n        ans += i * (i - 1) // 2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = input()\\nn = len(s)\\nmod = 2019\\n\\nt = [0]*n\\ndp = [0]*2020\\nt[0] = int(s[-1])\\ndp[t[0]] += 1\\nfor i in range(n-1):\\n    t[i+1] = t[i] + int(s[-2-i])*pow(10, i+1, mod)\\n    t[i+1] %= mod\\n    dp[t[i+1]] += 1\\nans = 0\\nfor D in dp[1:]:\\n    ans += D*(D-1)//2\\nprint((ans+(dp[0]+1)*(dp[0])//2))\\n\\n\\n\", \"#!/usr/bin/env python3\\nimport sys\\nimport numpy as np\\n\\ninput = sys.stdin.readline\\n\\n\\ndef ST():\\n    return input().rstrip()\\n\\n\\ndef I():\\n    return int(input())\\n\\n\\ndef MI():\\n    return list(map(int, input().split()))\\n\\n\\ndef LI():\\n    return list(MI())\\n\\n\\nS = ST()\\n\\ncnt = np.zeros(2019)\\ncnt[0] = 1\\nres = 0\\ntmp = 1\\nfor s in S[::-1]:\\n    res += int(s) * tmp\\n    res %= 2019\\n    cnt[res] += 1\\n    tmp *= 10\\n    tmp %= 2019\\n\\nans = 0\\nfor c in cnt[cnt >= 2]:\\n    ans += c * (c - 1) // 2\\n\\nprint((int(ans)))\\n\", \"def main():\\n    import collections\\n\\n    S = input()\\n\\n    mod_list = [0]\\n\\n    for i in range(len(S)):\\n        index = len(S) - i - 1\\n        num = int(S[index])\\n\\n        mod_list.append((mod_list[-1] + num * pow(10, i, 2019)) % 2019)\\n\\n    CTR_mod_list = collections.Counter(mod_list).most_common()\\n    cnt = 0\\n\\n    for i in range(len(CTR_mod_list)):\\n        n = CTR_mod_list[i][1]\\n\\n        if (n == 1):\\n            break\\n\\n        cnt += n * (n - 1) // 2\\n\\n    print(cnt)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"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\\n# \\u7d2f\\u7a4d\\u548c\\u306e\\u66f8\\u304d\\u65b9\\u304c\\u3088\\u304f\\u306a\\u3044\\u3084\\u3064\\ndef main():\\n  s=S()\\n  n=len(s)\\n\\n  l=[]\\n  mul=1\\n  for x in s[::-1]:\\n    l.append(mul*int(x)%2019)\\n    mul*=10\\n    mul%=2019\\n\\n  for i in range(n-1):\\n    l[i+1]+=l[i]\\n    l[i+1]%=2019\\n\\n  sl=summarizeList(l)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    if x==0:\\n      ans+=c\\n    if c>1:\\n      ans+=c*(c-1)//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Mon Sep  7 00:38:11 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n\\n\\\"\\\"\\\"\\n\\uff1cD - Multiple of 2019>\\n\\u3010\\u65b9\\u91dd\\u3011\\na = b(mod2019) => a - b \\u306f\\u30002019\\u306e\\u500d\\u6570\\n\\u4f59\\u308a\\u304c\\u7b49\\u3057\\u3044\\u30b0\\u30eb\\u30fc\\u30d7\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u306e\\u7dcf\\u6570\\u304c\\u89e3\\u306b\\u306a\\u308b\\u3002\\n\\u65e2\\u306b2019\\u306e\\u500d\\u6570\\u3067\\u3042\\u308b\\u3082\\u306e\\u306f\\u5358\\u4f53\\u3067\\u6210\\u7acb\\u3059\\u308b\\u305f\\u3081\\u3001[0]\\u306e\\u30ab\\u30a6\\u30f3\\u30c8\\u3092\\u4e00\\u3064\\u3042\\u3052\\u3066\\u304a\\u304f\\n\\n\\n\\uff1c\\u7d2f\\u7a4d\\u548c\\uff1e\\n\\u3010\\u8a08\\u7b97\\u91cf\\u524a\\u6e1b\\u3011\\n\\u5927\\u304d\\u306a\\u6570\\u3092\\u4f7f\\u308f\\u306a\\u3044\\u3000\\u21d2\\u3000mod \\u3092\\u4f7f\\u3046\\ntmp += 7 * 100000000  => 7 * ( 2019*N + \\u03b1) => 7 * \\u03b1\\u3000\\u3068\\u540c\\u3058\\n\\u3000\\u3000\\u21d2\\u3000\\u7d2f\\u4e57(10**N) \\u306b  mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n\\n100000000 + \\u03b3 => (2019*N + \\u03b2) + \\u03b3 => \\u03b2 + \\u03b3 \\u3068\\u540c\\u3058\\n\\u3000\\u21d2\\u3000\\u7d2f\\u7a4d\\u548c\\u3000\\u306b\\u3000mod \\u3092\\u304b\\u3051\\u308b\\u3068\\u826f\\u3044\\n \\n for\\u6587\\u3067\\uff11\\u6587\\u5b57\\u305a\\u3064\\u8db3\\u3057\\u7b97\\u3057\\u3066\\u3044\\u304f\\u3053\\u3068\\u3067\\u5b9f\\u88c5\\u53ef\\u80fd\\n \\n reversed() : \\u9006\\u9806\\u306b\\u4e26\\u3079\\u66ff\\u3048\\n reversed(input()) : \\u5165\\u529b\\u3092\\u9006\\u9806\\u306b\\u53d6\\u308a\\u51fa\\u3059\\n \\n\\\"\\\"\\\"\\nS = input()\\n\\nMOD = 2019 \\n\\ncounter = [0] * 2019\\ncounter[0] = 1\\nt = 1\\ntmp = 0\\nfor i in reversed(S):\\n    tmp += int(i)*t\\n    tmp %= MOD #\\u7d2f\\u7a4d\\u548c\\u3092\\u52b9\\u7387\\u5316\\n    t *= 10\\n    t %= MOD   #\\u7d2f\\u4e57\\u3092\\u52b9\\u7387\\u5316 \\n    #print(tmp)\\n    counter[tmp] += 1\\n\\nans = sum( i*(i-1)//2 for i in counter)\\nprint(ans)\", \"s = list(input())\\n# s = list(str(10**200000))\\nn = len(s)\\nans = 0\\ns.reverse()\\n# print(s)\\nx = 1\\ntot = 0\\ncount = [0]*2019\\nfor i in range(n):\\n    count[tot]+=1\\n    tot += int(s[i])*x\\n    # print(tot)\\n    tot %= 2019\\n    ans += count[tot]\\n    x = x*10%2019\\nprint(ans)\", \"S = input()[::-1]\\nans = 0\\nmods = [0] * 2019\\nmods[0] = 1\\ncurrent = 0\\nx = 1\\nfor s in S:\\n  current = (current + x * int(s)) % 2019\\n  ans += mods[current % 2019]\\n  mods[current % 2019] += 1\\n  x = x * 10 % 2019\\nprint(ans)\", \"s = list(map(int,input()))\\ns.reverse()\\nt = len(s)\\nmod = 2019\\n\\narr = [0] * (t+1)\\narr[-2] = s[0]\\nfor i in range(1,t):\\n    arr[t-i-1] = (arr[t-i] + s[i]*pow(10,i,mod)) % mod\\n\\nfrom collections import Counter\\narr = Counter(arr)\\n\\nans = 0\\nfor i in arr:\\n    ans += (arr[i] - 1) * arr[i] // 2\\n\\nprint(ans)\", \"import sys\\nimport heapq\\nimport math\\nimport fractions\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\nfrom collections import deque\\nfrom operator import itemgetter\\ndef input(): return sys.stdin.readline().strip()\\ndef mp(): return map(int,input().split())\\ndef lmp(): return list(map(int,input().split()))\\n\\ns=input()[::-1]\\nn=len(s)\\na=[0]*2019\\na[0]=1\\nc,d=0,1\\nfor i in s:\\n    c+=int(i)*d\\n    c%=2019\\n    d*=10\\n    d%=2019\\n    a[c]+=1\\nans=0\\nfor i in a:\\n    ans+=i*(i-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()[::-1]\\nMOD = 2019\\nX = [0]\\nfor i,s in enumerate(S):\\n    X.append((X[-1]+int(s)*pow(10,i,MOD))%MOD)\\nC = Counter(X)\\nprint(sum([v*(v-1)//2 for v in C.values()]))\", \"S=input()\\nans,n=0,len(S)\\ndp=[0]*(2019)\\ns,dp[0],k=0,1,1\\nfor i in range(1,n+1):\\n  s=(s+int(S[-i])*k)%2019\\n  k=(k*10)%2019\\n  ans+=dp[s]\\n  dp[s]+=1\\nprint(ans)\", \"n = input()\\np = 2019\\nt = 1\\ny = 0\\nc = p*[0]\\n\\nfor x in map(int,n[::-1]):\\n  y+=t*x\\n  y%=p\\n  c[y]+=1\\n  t*=10\\n  t%=p\\n\\nprint(sum(i*(i-1)//2 for i in c)+c[0])\", \"def main():\\n    def modpow(x, n, mod):\\n        res = 1\\n        while n:\\n            if n % 2:\\n                res *= x % mod\\n            x *= x % mod\\n            n >>= 1\\n        return res\\n\\n    s = input()\\n    s = s[::-1]\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in range(s_len):\\n        rev_num += int(s[i]) * int(modpow(10, i, mod))\\n        rev_num %= mod\\n        d[rev_num] += 1\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S = input()\\ns_rev = S[::-1]\\n\\nr_list = [0] * 2019\\nr_list[0] = 1\\nnum, d = 0, 1\\nfor i in range(len(S)):\\n    num += d*int(s_rev[i])\\n    num %= 2019\\n    r_list[num] += 1\\n    d *= 10\\n    d %= 2019\\n\\nans = 0\\nfor i in range(2019):\\n        ans += r_list[i]*(r_list[i]-1)//2\\n\\nprint(ans)\\n\", \"s=input()\\np=2019\\nans=0\\nM=[0]*p\\nM[0]=1\\ntmp=0\\nfor i in range(len(s)):\\n    tmp+=(int(s[-i-1])*pow(10,i,p))\\n    tmp%=p\\n    ans+=M[tmp]\\n    M[tmp]+=1\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common()[::-1]:\\n#  if k > 1 and k%2 == 0:\\n#    ans += n\\n#  else:break\\n#print(ans)\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#https://mirucacule.hatenablog.com/entry/2020/04/27/090908\\n#https://drken1215.hatenablog.com/entry/2020/04/29/171300\\n\\nS=str(input())[::-1]#\\u9006\\u9806\\u3067\\u683c\\u7d0d\\nN=len(S)\\ncounter=[0]*2019\\ncounter[0]=1\\nans=0\\nnum,d=0,1\\nfor c in S:\\n    num += int(c) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counter[num]+=1\\nfor i in counter:\\n    ans += i*(i-1)//2\\nprint(ans)\", \"from collections import defaultdict\\n\\nS = input()\\n\\nd = defaultdict(int)\\n\\nd[0] += 1\\n\\nmod = 0\\nR = 1\\nfor i in range(len(S)):\\n    mod = (mod + R * int(S[len(S) - i - 1])) % 2019\\n    R = R * 10 % 2019\\n    d[mod] += 1\\nans = 0\\nfor i in list(d.values()):\\n    if i > 1:\\n        ans += i * (i - 1) / 2\\n\\nprint((int(ans)))\\n\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in S[::-1]:\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"S = input()\\nmod = 2019\\n\\narray = []\\nfor i in range(len(S)):\\n    x = (int(S[len(S)-1-i])*pow(10,i,mod))%mod\\n    array.append(x)\\narray2 = [0]\\ny = 0\\nfor i in range(len(S)):\\n    y = (y+array[i])%mod\\n    array2.append(y)\\narray3 = [0] * 2019\\nans = 0\\nfor i in range(len(array2)):\\n    z = array2[i]\\n    ans += array3[z]\\n    array3[z] += 1\\nprint(ans)\\n#3*673\\n\", \"s=input()\\nn=len(s)\\nrui=[0]\\njuu=[1]\\nfor i in range(n+5):\\n  juu.append(juu[-1]*10%2019)  \\nfor i in range(n):\\n  rui.append((rui[-1]+int(s[n-1-i])*juu[i])%2019)\\nama=[0]*2019\\nfor i in range(len(rui)):\\n  ama[rui[i]]+=1\\nans=0\\ndef ui(n):\\n  return max(0,n*(n-1)//2)\\nfor i in range(2019):\\n  ans+=ui(ama[i])\\nprint(ans)  \", \"def MultipleOf2019():\\n    S = input()\\n    s = int(S)\\n    num, mod, ans = len(S), 2019, 0\\n    c = [0 for _ in range(num+1)]\\n    d = [0 for _ in range(mod)]\\n    d[0] = 1\\n    s = int(S)\\n    \\n    for i in range(num):\\n        c[i+1] = (c[i]+int(S[-i-1])*pow(10, i, mod))%mod\\n        d[c[i+1]] += 1\\n\\n    for i in range(mod):\\n        ans += d[i]*(d[i]-1)//2\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    MultipleOf2019()\\n    \\n\\n__starting_point()\", \"S = input()\\nN = len(S)\\n \\ncounter = [0] * 2019\\ncounter[0] = 1\\nT = 0\\nR = 1\\nfor i in range(N):\\n    T = (T + R * int(S[N - i - 1])) % 2019\\n    R = 10 * R % 2019\\n    counter[T] += 1\\n \\nans = 0\\nfor i in range(2019):\\n    m = counter[i]\\n    ans += m * (m - 1) // 2\\n \\nprint(ans)\", \"def inN():\\n    return int(input())\\ndef inL():\\n    return list(map(int,input().split()))\\ndef inNL(n):\\n    return [list(map(int,input().split())) for i in range(n)]\\n\\ns = input()\\nn = int(s)\\nl = len(s)\\ncnt = 0\\nmod = [0]*2019\\nm = 0\\nfor i in range(l):\\n    m = (int(s[l-1-i])*pow(10,i,2019) + m)%2019\\n    mod[m] += 1\\n\\ncnt += mod[0]\\n\\nfor i in range(2019):\\n    if mod[i] > 1:\\n        cnt += (mod[i]*(mod[i]-1))/2\\n        #print(i)\\nprint((int(cnt)))\\n\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nA = [0]\\nfor i, s in enumerate(S[::-1]):\\n    A.append((A[-1] + s * pow(10, i, 2019)) % 2019)\\nprint((sum([v * (v - 1) // 2 for v in list(Counter(A).values())])))\\n\", \"S = reversed(input())\\nresiduelist = [0]\\npower = 1\\nresidue = 0\\nfor i in S:\\n    digit = int(i)\\n    residue = (residue+power*digit)%2019\\n    residuelist.append(residue)\\n    power = (power*10)%2019\\nfrom collections import Counter\\nval = Counter(residuelist).values()\\nans = 0\\nfor j in val:\\n    ans += j*(j-1)//2\\nprint(ans)\", \"# coding: utf-8\\n# Your code here!\\n\\nS=list(input())\\nS=list(map(int,S))[::-1]\\n\\n\\nmod=[0]*2019\\nmod[0]+=1\\n\\nans=0\\ntemp=0\\np=1\\nfor i in range(len(S)):\\n    temp+=S[i]*p\\n    p=p*10%2019\\n    temp%=2019\\n    ans+=mod[temp]\\n    mod[temp]+=1\\n\\nprint(ans)\\n\", \"s=input()\\n\\ns=s[::-1]\\n\\ncounts = [0] * 2019\\ncounts[0] = 1\\n\\nnum=0\\nd = 1\\n\\n\\nfor char in s:\\n    num += int(char) * d\\n    num %= 2019\\n    d *= 10\\n    d %= 2019\\n    counts[num] += 1\\n    \\nans = 0\\nfor cnt in counts:\\n    ans += cnt * (cnt - 1) // 2\\n\\nprint(ans) # \\u7b54\\u3048\\u306e\\u51fa\\u529b   \\n\\n\", \"from collections import Counter\\ns = input()\\n\\nls = len(s)\\nt = [0]\\nj = 1\\nfor i in range(ls):\\n    u = (int(s[ls-1-i])*j + t[-1]) % 2019\\n    t.append(u)\\n    j = (j * 10) % 2019\\nc = Counter(t)\\nk = list(c.keys())\\nans = 0\\nfor i in k:\\n    ans += c[i]*(c[i]-1)/2\\nprint(int(ans))\", \"from collections import Counter\\nimport sys\\nread = sys.stdin.buffer.read\\nreadline = sys.stdin.buffer.readline\\nreadlines = sys.stdin.buffer.readlines\\nmod = 2019\\n\\n\\ns = readline().decode().rstrip()\\ns = s[::-1]\\nn = len(s)\\nd = [0] * (n)\\nd[0] = int(s[0]) % mod\\n\\nfor i in range(1, n):\\n    d[i] = (d[i - 1] + int(s[i]) * pow(10, i, mod)) % mod\\n\\nd = [0] + d\\n\\nc = Counter(d)\\nans = 0\\nfor v in c.values():\\n    ans += v * (v - 1) // 2\\nprint(ans)\", \"def main():\\n  n, mods = 0, [1]+[0]*2019\\n  d = 1\\n  for i in reversed(input()):\\n    n = (n+int(i)*d)%2019\\n    d = d*10%2019\\n    mods[n] += 1\\n  print(sum([i*(i-1)//2 for i in mods]))\\nmain()\", \"S=input()\\ns=int(S)\\nmod=2019\\nc=[0]*(len(S)+1)\\nd=[0]*2019\\n\\n\\nc[0]=0\\nd[0]=1\\nfor i in range(len(S)):\\n  c[i+1]=(c[i]+int(S[-i-1])*pow(10,i,mod))%mod\\n  d[c[i+1]]+=1\\n  \\nm=0\\nfor i in range(2019):\\n  m+=d[i]*(d[i]-1)//2\\n\\nprint(m)\", \"# -*- coding: utf-8 -*-\\n\\nS = input().strip()\\n#-----\\nnum = 0\\ncnt_mod = {0:1}  # type {int: int} , contents {remainder : count}\\nmod = 2019\\nbase_pow = 1\\n\\nfor i in range(len(S)):\\n    digit = int( S[len(S)-1-i] )\\n    \\n    num += (digit * base_pow) % mod\\n    num %= mod\\n    \\n    base_pow = (base_pow * 10) % mod\\n    \\n    cnt_mod.setdefault(num, 0)\\n    cnt_mod[num] += 1\\n\\n\\nans = 0\\n\\nfor r,c in list(cnt_mod.items()):\\n    # r: remainder\\n    # c: count\\n    if c >= 2:\\n        ans += c*(c-1)//2\\n\\nprint(ans)\\n\", \"from collections import Counter\\n\\n# for\\u3092\\u9006\\u304b\\u3089\\u56de\\u3057\\u3066\\u4e0b\\u304b\\u3089\\u7d20\\u76f4\\u306bmod\\u3092\\u53d6\\u308b\\u3068TLE\\u3060\\u3063\\u305f\\n# \\u7d2f\\u7a4d\\u548c\\u7684\\u306a\\u8a08\\u7b97\\u3067\\u9ad8\\u901f\\u5316\\u3001\\u3084\\u308a\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306breverse\\nS = input()[::-1]\\n# ex. 1817181712114 \\u2192 4112171817181\\n# print(S)\\n\\n# 0\\u6841\\u76ee\\u307e\\u3067\\u306eMOD\\u30920\\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\n# 1\\u6841\\u76ee\\u3092\\u542b\\u3080\\u6570\\u304c2019\\u306e\\u500d\\u6570\\u306e\\u6642\\u306b\\u90fd\\u5408\\u304c\\u826f\\u304f\\u306a\\u308b\\nX = [0]\\n\\n# 4,14,114,2114,12114,...\\u306emod2019\\u3092\\u8a08\\u7b97\\n\\n# pow(a,b,c)\\u306f\\u666e\\u901a\\u306bMOD\\u3059\\u308b\\u3088\\u308a\\u901f\\u3044\\n# \\u666e\\u901a\\u306b\\u3084\\u3063\\u305f\\u3089TLE\\u3060\\u3063\\u305f\\nfor i, s in enumerate(S):\\n    X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)\\n# print(X)\\n\\n\\nC = Counter(X)\\n# print(C)\\n\\nans = 0\\n# X\\u304c\\u540c\\u3058\\u306b\\u306a\\u3063\\u305f\\u3068\\u3053\\u308d\\u30922\\u3064\\u9078\\u3079\\u3070\\u984c\\u610f\\u3092\\u6e80\\u305f\\u3059\\n# v_C_2\\u306e\\u8a08\\u7b97\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\n\\nprint(ans)\\n\", \"from collections import Counter\\nN = list(input())\\nM = [0]\\nS = 0\\nK = 1\\nans = 0\\n\\nfor i in range(len(N)):\\n    S += int(N[-i-1])*K\\n    S %= 2019\\n\\n    K *= 10\\n    K %= 2019\\n    M.append(S)\\n\\nP = Counter(M)\\nfor i in range(2020):ans+=P[i]*(P[i]-1)//2\\nprint(ans)\\n\", \"import sys\\nimport collections\\n\\n\\ndef resolve(in_):\\n    s = next(in_).strip()\\n    mod = 2019\\n    dp = [0] * (len(s) + 1)\\n    ch0 = ord(b'0')\\n    for i, b in enumerate(reversed(s), 1):\\n        dp[i] = (dp[i - 1] + (b - ch0) * pow(10, i, mod)) % mod\\n\\n    return sum(v * (v - 1) // 2 for v in list(collections.Counter(dp).values()))\\n\\n\\ndef main():\\n    answer = resolve(sys.stdin.buffer)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#import numpy as np\\n#import math\\n#from decimal import *\\n#from numba import njit\\nfrom collections import Counter\\n\\n#@njit\\ndef main():\\n    S = input()\\n    A = list(map(int, S))[::-1]\\n    mod = []\\n    ten = 10\\n    for i in range(len(A)):\\n        if i == 0:\\n            mod += A[i],\\n        else:\\n            mod += (mod[i-1]+ten*A[i])%2019,\\n            ten = (ten*10)%2019\\n    mod += 0,\\n\\n    C = Counter(mod)\\n    print(sum([c*(c-1)//2 for c in C.values()]))\\n\\nmain()\", \"S = input()\\n\\ncs = [0]\\nr = 1\\nfor c in S[::-1]:\\n    cs.append((cs[-1] + r*int(c)) % 2019)\\n    r *= 10\\n    r %= 2019\\n\\nfrom collections import Counter\\nctr = Counter(cs)\\nans = 0\\nfor v in ctr.values():\\n    ans += v*(v-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [-1] * len(S)\\nr = 0\\nd = 1\\nfor i,s in enumerate(S[::-1]):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[i] = r\\n\\nans = 0\\nc = Counter(p)\\nfor k,n in c.most_common():\\n  if n > 1:\\n    ans += n*(n-1)//2\\n  else:break\\nprint(ans)\", \"N = str(input())\\nn,mods = 0,[1]+[0]*2018\\nd = 1\\nfor i in reversed(N):\\n  n = (n+int(i)*d)%2019\\n  mods[n] += 1\\n  d = (d*10)%2019\\n\\nprint(sum([i*(i-1)//2 for i in mods]))\", \"def main():\\n    s = input()\\n    s_len = len(s)\\n    mod = 2019\\n    d = [0] * mod\\n    d[0] = 1\\n    rev_num = 0\\n    t = 1\\n    # 2\\u4ee5\\u4e0a\\u306a\\u3089\\u5171\\u901a\\u3059\\u308bmod\\u304c\\u3042\\u3063\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u306b\\u306a\\u308b\\n    for i in reversed(s):\\n        rev_num += int(i) * t\\n        rev_num %= mod\\n        d[rev_num] += 1\\n        t *= 10\\n        t %= mod\\n    # 2\\u4ee5\\u4e0a\\u540c\\u3058mod\\u304c\\u3042\\u3063\\u305f\\u3089\\u305d\\u3053\\u304b\\u30892\\u3064\\u9078\\u3076\\u9078\\u3073\\u65b9\\n    # \\u305d\\u308c\\u3092\\u5168\\u3066\\u306emod\\u3067\\n    print(sum(i*(i-1)//2 for i in d))\\n \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ns=input()\\nn=len(s)\\nans=0\\narr=[0]*(n+1)\\nif s=='0':\\n    print(1)\\n    return\\nelif n==1:\\n    print(0)\\n    return\\nfor i in reversed(range(n)):\\n    arr[i]=(arr[i+1]+int(s[i])*pow(10,n-i-1,2019))%2019\\nm=Counter(arr)\\nfor j in m.keys():\\n    ans+=m[j]*(m[j]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\n#p.append(0)\\n#ans = 0\\n#c = Counter(p)\\n#for k,n in c.most_common():\\n#  if n > 1:\\n#    ans += 1\\n#  else:break\\n  \\nprint(sum([i*(i-1)//2 for i in p]))\", \"s = input()\\n\\nlen_s = len(s)\\n\\ncurrent = 0\\nmod_dict = dict()\\nmod_dict[0] = 1\\nfor i in range(len_s-1,-1,-1):\\n    c = s[i]\\n    current = (current+pow(10,len_s-i-1,2019)*int(c)) % 2019\\n    if current in mod_dict:\\n        mod_dict[current] += 1\\n    else:\\n        mod_dict[current] = 1\\n\\ncount = 0\\nfor key in mod_dict:\\n    count+= (mod_dict[key]*(mod_dict[key]-1))//2\\n\\nprint(count)\", \"import sys\\nimport math\\nimport itertools\\nimport collections\\nfrom collections import deque\\nfrom collections import defaultdict\\n\\nsys.setrecursionlimit(1000000)\\nMOD = 10 ** 9 + 7\\nMOD2 = 998244353\\nINF = float('inf')\\ninput = lambda: sys.stdin.readline().strip()\\n\\nNI = lambda: int(input())\\nNMI = lambda: map(int, input().split())\\nNLI = lambda: list(NMI())\\nSI = lambda: input()\\n\\ndef combinations_count(n, r):\\n    if n == 1:\\n        return 0\\n    else:\\n        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\\n\\ndef main():\\n    S = SI()\\n    \\n    ls = []\\n    len_S = len(S)\\n    rem = 0\\n\\n    for s in range(len_S-1,-1,-1):\\n        rem = (rem+int(S[s])* pow(10, len_S-s-1, 2019))%2019\\n        ls.append(rem)\\n    \\n    import collections\\n\\n    cls = collections.Counter(ls)\\n    clsv= list(cls.values())\\n\\n    ans = 0\\n\\n    for p in clsv:\\n        ans += combinations_count(p,2)\\n    ans += cls[0]\\n    print(ans)\\n\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from collections import Counter\\ndef main():\\n    S = input()\\n    A = [0] * ((n := len(S)) + 1)\\n    A[1] = (a := int(S[-1])) % 2019\\n    for i in range(2, n + 1):\\n        a += pow(10, i - 1, 2019) * int(S[-i])\\n        A[i] = a % 2019\\n    c = Counter(A)\\n    ans = 0\\n    for v in list(c.values()):\\n        ans += v * (v - 1) // 2\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"s = str(input())\\nMOD = 2019\\nm = 0\\ndigit = 1\\nmods = [1] + [0] * 2018\\nfor a in s[::-1]:\\n    m = (m + digit * int(a)) % MOD\\n    mods[m] += 1\\n    digit = digit * 10 % MOD\\nans = 0\\nfor x in mods:\\n    ans += x * (x - 1) // 2\\nprint(ans)\", \"from collections import Counter\\n\\ns = input()\\nn = len(s)\\ndigits = [int(c) for c in s[::-1]]\\na = [0] * (n + 1)\\np = 2019\\n\\nfor i, digit in enumerate(digits):\\n    a[i + 1] = (digit * pow(10, i, p) + a[i]) % p\\n\\ncounter = Counter(a)\\nans = 0\\nfor count in counter.values():\\n    ans += count * (count - 1) // 2\\n\\nprint(ans)\", \"# -*- coding: utf-8 -*-\\n\\\"\\\"\\\"\\nCreated on Sun Sep  6 23:39:24 2020\\n\\n@author: liang\\n\\\"\\\"\\\"\\n#from scipy.special import comb\\n\\ncounter = [0]*2019\\ncounter[0] = 1 # 0 = 0 (mod 2019)\\n\\nS = input()\\ntmp = 0\\n\\\"\\\"\\\"\\n#\\u5927\\u304d\\u3044\\u6570\\u3092\\u4e00\\u6c17\\u306b\\u639b\\u3051\\u306a\\u3044\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*10**(i-1)    #\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u65b9\\u304c\\u65e9\\u3044\\uff08\\u3051\\u3069\\u3001\\u6f38\\u5316\\u5f0f\\u7684\\u306b\\u7d2f\\u7a4d\\u548c\\u3092\\u51fa\\u305b\\uff09\\n    #print(tmp%2019)\\n    tmp %= 2019                    #\\u5927\\u304d\\u3044\\u6570\\u3092\\u5272\\u308b\\u306a\\n    counter[tmp%2019] += 1\\n\\nans = 0\\nfor i in range(2019):\\n    if counter[i] >= 2:\\n        #ans += comb(counter[i], 2, exact=True)\\n        ans += counter[i]*(counter[i]-1)//2\\nprint(ans)\\n\\\"\\\"\\\"\\nMOD = 2019\\n#reversed(s) ?\\nt = 1\\nfor i in range(1,len(S)+1):\\n    tmp += int(S[-i])*t\\n    #print(\\\"A\\\", tmp)\\n    tmp %= MOD \\n    t *= 10\\n    #print(\\\"B\\\", tmp)\\n    t %= MOD\\n    #print(tmp)\\n    counter[tmp] += 1\\n    \\nprint((sum(i*(i-1)//2 for i in counter)))\\n\", \"S = list(map(int, list(input())))\\n\\npops = 0\\ndigi = 1\\ncnt = [0] * 2019\\ncnt[0] = 1\\n\\nwhile S:\\n    s = S.pop()\\n\\n    pops = (pops + s * digi) % 2019\\n    digi = (10 * digi) % 2019\\n\\n    cnt[pops] += 1\\n\\nans = 0\\n\\nfor i in range(2019):\\n    ans += cnt[i] * (cnt[i] - 1) // 2\\n\\nprint(ans)\", \"S = str(input())\\nN = len(S)\\nb = [0] * 2019\\ncount = 0\\nb[0] = 1\\nt = 0\\nk = 1\\n\\nif len(S) < 4:\\n    print(0)\\nelse:\\n    t = int(S[-1])\\n    b[t] += 1\\n    for i in range(1,N):\\n        k = k * 10 % 2019\\n        t = (k * int(S[-i-1]) + t) % 2019 \\n        b[t] += 1\\n\\n    for i in b:\\n        count += i*(i-1)//2\\n\\n    print(count)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = list(map(int, list(input())))[::-1]\\n\\nl = [0]*2019\\nz = 1\\ntmp = 0\\nfor i, s in enumerate(S):\\n\\ttmp += s*z\\n\\tl[tmp%2019] += 1\\n\\tz = z*10%2019\\n\\nans = 0\\nfor v in l:\\n\\tans += v*(v-1)//2\\nans += l[0]\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nC = Counter()\\nMOD = 2019\\n\\nn = 0\\nfor i, s in enumerate(S[::-1]):\\n    s = int(s)\\n    n += pow(10, i, MOD) * s % MOD\\n    C[n % MOD] += 1\\n\\nC[0] += 1\\nans = 0\\nfor v in list(C.values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"s=[int(x) for x in reversed(list(input()))]\\nn=len(s)\\nx=[0]*2019\\ndp = 0\\ndim = 1\\nfor si in s:\\n  dp = (dp + si*dim) % 2019\\n  x[dp] += 1\\n  dim = dim * 10 % 2019\\nans = x[0]\\nfor i in range(2019):\\n  ans += x[i]*(x[i]-1)//2\\nprint(ans)\", \"S = input()\\nS = S + '0'\\nmod = 2019\\np = [0] * mod\\nr = 0\\nd = 1\\nfor s in reversed(S):\\n  t = int(s)%mod\\n  r += t*d\\n  r %= mod\\n  d = d*10%mod\\n  p[r] += 1\\n\\nprint(sum([i*(i-1)//2 for i in p]))\", \"#!/usr/bin/env python3\\n\\nimport numpy as np\\nfrom collections import Counter\\n\\nYEAR = 2019\\n\\n\\ndef solve(S: str):\\n    # S \\u306e\\u5404\\u6841\\u3092 modYear \\u8a08\\u306b\\u4fee\\u6b63\\u3059\\u308b\\n    mod_year = np.arange(1, 10)\\n    mod_s = []\\n    for Si in map(int, reversed(S)):\\n        mod_s.append(mod_year[Si - 1])\\n        mod_year = (mod_year * 10) % YEAR\\n    #print(mod_s)\\n    # mod_s \\u3092\\u7d2f\\u7a4d\\u548c\\u306b\\u3059\\u308b\\n    cum_sum = 0\\n    cum_sums = [cum_sum]\\n    for x in mod_s:\\n        cum_sum = (cum_sum+x) % YEAR\\n        cum_sums.append(cum_sum)\\n\\n    answer = 0\\n    for _, num in list(Counter(cum_sums).items()):\\n        answer += (num * (num-1)) // 2   # 1 \\u306e\\u66420\\u306a\\u306e\\u3067\\u5834\\u5408\\u5206\\u3051\\u306f\\u3044\\u3089\\u306a\\u3044\\n    return answer\\n\\n\\ndef main():\\n    S = input().strip()\\n    answer = solve(S)\\n    print(answer)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for i1 in range(1, lens+1):\\n        ss += (int(s[-i1]) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"s=input()[::-1]\\np=2019\\nans=[0]*p\\n\\nx10, S=1, 0\\nfor i in s:\\n  S+=x10*int(i)\\n  S%=p\\n  x10*=10\\n  x10%=p\\n  ans[S]+=1\\n\\ncnt=ans[0]\\nfor a in ans:\\n  cnt+=(a*(a-1))//2\\n  \\nprint(cnt)\\n\", \"S = input()\\nmod = 2019\\n\\nt = len(S)\\nl = [0] * (t + 1)\\nfor i in range(t-1, -1, -1):\\n    l[i] = (l[i+1] + int(S[i]) * pow(10, t-i-1, mod)) % mod\\n\\nfrom collections import Counter\\n\\ndef nC2(n):\\n    return n * (n - 1) // 2\\n\\nl = list(Counter(l).values())\\n\\nans = 0\\nfor i in l:\\n    ans += nC2(i)\\n\\nprint(ans)\", \"from collections import Counter\\nS = input()\\nP = [0] * (len(S)+1)\\nmod = 2019\\nd = 1\\nfor i in range(len(S), 0, -1):\\n    P[i-1] = int(S[i-1])*d + P[i]\\n    P[i-1] = P[i-1] % mod\\n    d *= 10\\n    d = d % mod\\n\\nP = Counter(P)\\nans = 0\\nfor p in P.values():\\n    ans += p*(p-1)//2\\nprint(ans)\", \"import sys\\nread = sys.stdin.read\\nreadlines = sys.stdin.readlines\\nfrom collections import defaultdict\\ndef main():\\n    s = tuple(map(int, input()))\\n    lens = len(s)\\n\\n    d1 = defaultdict(int)\\n    ss = 0\\n    num10 = 1\\n    for se in s[::-1]:\\n        ss += (int(se) * num10) % 2019\\n        ss = ss % 2019\\n        d1[ss] += 1\\n        num10 = (num10 * 10) % 2019\\n    r = d1[0]\\n    for v in d1.values():\\n        r += v * (v - 1) // 2\\n    print(r)\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"S=input()\\nN=len(S)\\n\\nT=[0]\\nfor i in range(N):\\n    p = int(S[-1-i])\\n    T.append( (T[-1]+ pow(10,i,2019)*p)%2019 )\\n    \\nfrom collections import Counter\\nans=0\\nU=dict(Counter(T))\\nfor num in U:\\n    ans += U[num]*(U[num]-1)//2\\nprint(ans)\", \"from collections import Counter\\nS = list(map(int, list(input())))\\nMOD = 2019\\n\\nacc_mod = [0]\\nfor i, s in enumerate(S[::-1]):\\n    acc_mod.append((acc_mod[-1] + s * pow(10, i, MOD)) % MOD)\\n\\nans = 0\\nfor v in list(Counter(acc_mod).values()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"from itertools import accumulate\\nfrom collections import Counter\\n\\n\\ndef solve(n):\\n    return n * (n - 1) // 2\\n\\n\\ns = input()[::-1]\\nMOD = 2019\\n\\n# \\u4e8b\\u524d\\u8a08\\u7b97\\nrest = []\\nfor i, x in enumerate(s):\\n    # 1, 10, 100, 1000...\\u306e\\u5270\\u4f59\\u3092\\u9806\\u306b\\u8a08\\u7b97\\u3057\\u3001\\u5404\\u6841\\u307e\\u3067\\u306e\\u5270\\u4f59\\u3092\\u8a08\\u7b97\\n    if i == 0:\\n        tmp = 1\\n    else:\\n        tmp = tmp * 10 % MOD\\n    rest.append(int(x) * tmp % MOD)\\n\\nresult = [x % MOD for x in list(accumulate(rest))]\\n\\n# 0\\u306f\\u5358\\u72ec\\u30672019\\u306e\\u500d\\u6570\\nzero = result.count(0)\\n\\n# \\u4ed6\\u306f\\u30b3\\u30f3\\u30d3\\u30cd\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7d50\\u679c\\nc = Counter(result)\\nc = list(c.values())\\n\\n# \\u8db3\\u3057\\u3066\\u51fa\\u529b\\nprint(sum([solve(x) for x in c if x >= 2]) + zero)\", \"import sys, re\\nfrom collections import deque, defaultdict, Counter\\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\\nfrom operator import itemgetter, mul\\nfrom copy import deepcopy\\nfrom string import ascii_lowercase, ascii_uppercase, digits\\nfrom bisect import bisect, bisect_left, insort, insort_left\\nfrom heapq import heappush, heappop\\nfrom functools import reduce\\ndef input(): return sys.stdin.readline().strip()\\ndef INT(): return int(input())\\ndef MAP(): return map(int, input().split())\\ndef LIST(): return list(map(int, input().split()))\\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\\nsys.setrecursionlimit(10 ** 9)\\nINF = float('inf')\\nmod = 10 ** 9 + 7 \\n#mod = 998244353\\nfrom decimal import *\\n#import numpy as np\\n#decimal.getcontext().prec = 10\\n\\nS = input()\\nn = len(S)\\ns = [0]\\nfor i, x in enumerate(S):\\n\\ts.append(int(S[i])*pow(10, n-i-1, 2019)%2019)\\n\\ntmp = 0\\nt = []\\nfor x in s:\\n\\ttmp = (tmp+x)%2019\\n\\tt.append(tmp)\\n\\nans = 0\\nfor v in Counter(t).values():\\n\\tans += v*(v-1)//2\\nprint(ans)\", \"MOD = 2019\\n\\\"\\\"\\\"\\ndef part_count(S):\\n  B = [0 for _ in range(MOD)]\\n  C = [0 for _ in range(MOD)]\\n  L = [0 for _ in range(MOD)]\\n  R = [0 for _ in range(MOD)]\\n  \\n  if len(S) == 1:\\n    s = S[0]\\n    B[s] = 1 \\n    return (B, L, R, C)\\n  S_L = S[:len(S)//2]\\n  S_R = S[len(S)//2:]\\n  \\n  B1, L1, R1, C1 = part_count(S_L)\\n  B2, L2, R2, C2 = part_count(S_R)\\n    \\n  for j in range(MOD):\\n    C[j] += C1[j] + C2[j]\\n    L[j] += L1[j]\\n    R[j] += R2[j]\\n    for i in range(MOD):\\n      B[j] += B1[i] * B2[(-i + j)%MOD]\\n      L[j] += B1[i] * L2[(-i + j)%MOD]\\n      R[j] += B2[i] * R1[(-i + j)%MOD]\\n      C[j] += R1[i] * L2[(-i + j)%MOD]\\n  \\n  return (B, L, R, C) #\\u4e21\\u5074\\u96a3\\u63a5\\u3001\\u5de6\\u96a3\\u63a5\\u3001\\u53f3\\u96a3\\u63a5\\u3001\\u96a3\\u63a5\\u306a\\u3057\\u306e\\u500b\\u6570\\n\\\"\\\"\\\"\\n\\nS = list(input())\\nS.reverse()\\nN = len(S)\\nS = [int(S[i]) for i in range(N)]\\nMOD = 2019\\n\\na = 1\\nfor i in range(N): \\n  S[i] *= a\\n  S[i] %= MOD\\n  a *= 10 \\n  a %= MOD\\n  \\n#B, L, R, C = part_count(S)\\n#print(B[0] + L[0] + R[0] + C[0])\\nT = [0 for _ in range(N+1)]\\nfor i in range(1,N+1):\\n  T[i] += S[i-1] + T[i-1]\\n  T[i] %= MOD\\n\\n#print(T)\\n\\nC = [0 for i in range(MOD)]  \\nfor i in range(N+1):\\n  C[T[i]] += 1\\n\\n#print(C)\\n\\nans = 0\\nfor i in range(MOD):\\n  ans += C[i]*(C[i]-1)//2\\n  \\nprint(ans)\\n\", \"s=input()\\nls=len(s)\\nm=[0]*(2019)\\nm[0]+=1\\n\\ncnt = 0\\nb = 0\\nfor i in range(ls):\\n  a = (b + pow(10,cnt,2019)*int(s[ls - i -1])) % 2019\\n  m[a] += 1\\n  b = a\\n  cnt += 1\\n\\nans = 0\\nfor i in m:\\n  if i <= 1:\\n    continue\\n  ans += i*(i-1)//2\\n\\nprint(ans)\\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\\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  s=S()\\n  n=len(s)\\n  s=s[::-1]\\n\\n  rl=[0]*(n+1)\\n  for i,x in enumerate(s):\\n    rl[i+1]=(int(x)*pow(10,i,2019))%2019\\n\\n  for i in range(n):\\n    rl[i+1]+=rl[i]\\n    rl[i+1]%=2019\\n\\n\\n  sl=summarizeList(rl)\\n  # print(sl)\\n\\n  ans=0\\n  for x,c in sl:\\n    ans+=(c*(c-1))//2\\n\\n  return ans\\n\\n# main()\\nprint((main()))\\n\", \"from itertools import accumulate\\n\\nS = input()\\n\\nR = [1]\\nfor _ in range(len(S)-1):\\n    R.append(R[-1]*10%2019)\\n\\nL = [int(s)*r for s, r in zip(reversed(S), R)]\\nZ = list(accumulate(L, func=lambda a, b: (a+b)%2019))\\n\\nT = [1]+[0]*2018\\nfor z in Z:\\n    T[z] += 1\\n\\nf = lambda n: n*(n-1)//2\\nprint(sum(f(t) for t in T))\", \"import sys\\nreadline = sys.stdin.readline\\n\\nS = readline().rstrip()\\nDIV = 2019\\n\\ncur = 0\\nfrom collections import defaultdict\\ndic = defaultdict(int)\\nfor i in range(len(S) - 1, -1, -1):\\n  cur += ((int(S[i]) % DIV) * pow(10, (len(S) - 1 - i), DIV)) % DIV\\n  cur %= DIV\\n  dic[cur] += 1\\n\\nans = 0\\n# 0\\u306f\\u5358\\u72ec\\u3067\\u3082\\u3088\\u3044\\nfor key, val in dic.items():\\n  if key == 0:\\n    ans += val\\n  ans += (val * (val - 1)) // 2\\n\\nprint(ans)\", \"# \\u89e3\\u8aacAC\\nimport math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect\\n#from operator import itemgetter\\n#from heapq import heappush, heappop\\n#import numpy as np\\n#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson\\n#from scipy.sparse import csr_matrix\\n#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\\nimport sys\\n\\nsys.setrecursionlimit(10**7)\\ninf = 10**20\\nmod = 10**9 + 7\\n\\nstdin = sys.stdin\\n\\nni = lambda: int(ns())\\nnf = lambda: float(ns())\\nna = lambda: list(map(int, stdin.readline().split()))\\nnb = lambda: list(map(float, stdin.readline().split()))\\nns = lambda: stdin.readline().rstrip()  # ignore trailing spaces\\n\\nS = ns()\\nn = len(S)\\nT = [0] * (n+1)\\nd = {0: 1}\\nfor k in range(n-1, -1, -1):\\n    tmp = (T[k+1] + pow(10, n - k - 1, 2019) * int(S[k])) % 2019\\n    T[k] = tmp\\n    if tmp not in list(d.keys()):\\n        d[tmp] = 1\\n    else:\\n        d[tmp] += 1\\nans = 0\\nfor k, v in list(d.items()):\\n    ans += v * (v - 1) // 2\\nprint(ans)\\n\", \"S=input()\\nS=list(reversed(S))\\n\\nm=2019\\ncnt=[0 for i in range(m)]\\n\\nlen_S=len(S)\\nx=1\\ntot=0\\nans=0\\n\\nfor i in range(len(S)):\\n    cnt[tot]+=1\\n    tot+=(ord(S[i])-ord('0'))*x\\n    tot %= m\\n    ans+=cnt[tot]\\n    x=x*10%m\\n\\nprint(ans)\"]",
        "difficulty": "interview",
        "input": "18171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817181718171817\n",
        "output": "59424499\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc164/tasks/abc164_d"
    },
    {
        "id": 657,
        "task_id": 2825,
        "test_case_id": 1,
        "question": "A group of friends snuck away from their school campus, but now they must return from the main campus gate to their dorm while remaining undetected by the many teachers who patrol the campus. Fortunately, they have an invisibility cloak, but it is only large enough to cover two people at a time. They will take turns as individuals or pairs traveling across campus under the cloak (and by necessity, returning the cloak to the gate if others remain). Each student has a maximum pace at which he or she is able to travel, yet if a pair of students are walking under the cloak together, they will have to travel at the pace of the slower of the two. Their goal is to have everyone back at the dorm as quickly as possible.\n\nAs an example, assume that there are four people in the group, with person A able to make the trip in $1$ minute, person B able to travel in $2$ minutes, person C able to travel in $7$ minutes, and person D able to travel in $10$ minutes. It is possible to get everyone to the dorm in $17$ minutes with the following plan:\n\n\n– A and B go from the gate to the dorm together\n\n(taking $2$ minutes)\n\n– A returns with the cloak to the gate\n\n(taking $1$ minute)\n\n– C and D go from the gate to the dorm together\n\n(taking $10$ minutes)\n\n– B returns with the cloak to the gate\n\n(taking $2$ minutes)\n\n– A and B go from the gate to the dorm together\n\n(taking $2$ minutes)\n\n-----Input-----\nThe input is a single line beginning with an integer, $2 \\leq N \\leq 15$. Following that are $N$ positive integers that respectively represent the minimum time in which each person is able to cross the campus if alone; these times are measured in minutes, with each being at most $5000$. (It is a very large campus!)\n\n-----Output-----\nOutput the minimum possible time it takes to get the entire group from the gate to the dorm.\n\n-----Examples-----\nSample Input 1:\n2 15 5\nSample Output 1:\n15\n\nSample Input 2:\n4 1 2 7 10\nSample Output 2:\n17",
        "solutions": "",
        "difficulty": "interview",
        "input": "2 15 5\n",
        "output": "15\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/safepassage"
    },
    {
        "id": 658,
        "task_id": 2825,
        "test_case_id": 2,
        "question": "A group of friends snuck away from their school campus, but now they must return from the main campus gate to their dorm while remaining undetected by the many teachers who patrol the campus. Fortunately, they have an invisibility cloak, but it is only large enough to cover two people at a time. They will take turns as individuals or pairs traveling across campus under the cloak (and by necessity, returning the cloak to the gate if others remain). Each student has a maximum pace at which he or she is able to travel, yet if a pair of students are walking under the cloak together, they will have to travel at the pace of the slower of the two. Their goal is to have everyone back at the dorm as quickly as possible.\n\nAs an example, assume that there are four people in the group, with person A able to make the trip in $1$ minute, person B able to travel in $2$ minutes, person C able to travel in $7$ minutes, and person D able to travel in $10$ minutes. It is possible to get everyone to the dorm in $17$ minutes with the following plan:\n\n\n– A and B go from the gate to the dorm together\n\n(taking $2$ minutes)\n\n– A returns with the cloak to the gate\n\n(taking $1$ minute)\n\n– C and D go from the gate to the dorm together\n\n(taking $10$ minutes)\n\n– B returns with the cloak to the gate\n\n(taking $2$ minutes)\n\n– A and B go from the gate to the dorm together\n\n(taking $2$ minutes)\n\n-----Input-----\nThe input is a single line beginning with an integer, $2 \\leq N \\leq 15$. Following that are $N$ positive integers that respectively represent the minimum time in which each person is able to cross the campus if alone; these times are measured in minutes, with each being at most $5000$. (It is a very large campus!)\n\n-----Output-----\nOutput the minimum possible time it takes to get the entire group from the gate to the dorm.\n\n-----Examples-----\nSample Input 1:\n2 15 5\nSample Output 1:\n15\n\nSample Input 2:\n4 1 2 7 10\nSample Output 2:\n17",
        "solutions": "",
        "difficulty": "interview",
        "input": "4 1 2 7 10\n",
        "output": "17\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/safepassage"
    },
    {
        "id": 659,
        "task_id": 2825,
        "test_case_id": 3,
        "question": "A group of friends snuck away from their school campus, but now they must return from the main campus gate to their dorm while remaining undetected by the many teachers who patrol the campus. Fortunately, they have an invisibility cloak, but it is only large enough to cover two people at a time. They will take turns as individuals or pairs traveling across campus under the cloak (and by necessity, returning the cloak to the gate if others remain). Each student has a maximum pace at which he or she is able to travel, yet if a pair of students are walking under the cloak together, they will have to travel at the pace of the slower of the two. Their goal is to have everyone back at the dorm as quickly as possible.\n\nAs an example, assume that there are four people in the group, with person A able to make the trip in $1$ minute, person B able to travel in $2$ minutes, person C able to travel in $7$ minutes, and person D able to travel in $10$ minutes. It is possible to get everyone to the dorm in $17$ minutes with the following plan:\n\n\n– A and B go from the gate to the dorm together\n\n(taking $2$ minutes)\n\n– A returns with the cloak to the gate\n\n(taking $1$ minute)\n\n– C and D go from the gate to the dorm together\n\n(taking $10$ minutes)\n\n– B returns with the cloak to the gate\n\n(taking $2$ minutes)\n\n– A and B go from the gate to the dorm together\n\n(taking $2$ minutes)\n\n-----Input-----\nThe input is a single line beginning with an integer, $2 \\leq N \\leq 15$. Following that are $N$ positive integers that respectively represent the minimum time in which each person is able to cross the campus if alone; these times are measured in minutes, with each being at most $5000$. (It is a very large campus!)\n\n-----Output-----\nOutput the minimum possible time it takes to get the entire group from the gate to the dorm.\n\n-----Examples-----\nSample Input 1:\n2 15 5\nSample Output 1:\n15\n\nSample Input 2:\n4 1 2 7 10\nSample Output 2:\n17",
        "solutions": "",
        "difficulty": "interview",
        "input": "5 12 1 3 8 6\n",
        "output": "29\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/safepassage"
    },
    {
        "id": 660,
        "task_id": 2905,
        "test_case_id": 1,
        "question": " “It’s like how hot dogs come in packs of ten, and buns come in packs of eight or twelve — you have to buy nine packs to make it come out even.” \n\nThis is a quote from the 1986 movie, “True Stories”, and it’s true; well, almost true. You could buy four packs of $10$ hotdogs and five packs of $8$ buns. That would give you exactly $40$ of each. However, you can make things even with fewer packs if you buy two packs of $10$ hotdogs, along with a pack of $8$ buns and another pack of $12$ buns. That would give you $20$ of each, using only $4$ total packs.\n\nFor this problem, you’ll determine the fewest packs you need to buy to make hotdogs and buns come out even, given a selection of different bun and hotdog packs available for purchase.\n\n-----Input-----\nThe first input line starts with an integer, $H$, the number of hotdog packs available. This is followed by $H$ integers, $h_1 \\ldots h_ H$, the number of hotdogs in each pack. The second input line starts with an integer, $B$, giving the number of bun packs available. This is followed by $B$ integers, $b_1 \\ldots b_ B$, indicating the number of buns in each pack. The values $H$ and $B$ are between $0$ and $100$, inclusive, and the sizes of the packs are between $1$ and $1000$, inclusive. Every available pack is listed individually. For example, if there were five eight-bun packs available for purchase, the list of bun packs would contain five copies of the number eight.\n\n-----Output-----\nIf it’s not possible to purchase an equal number of one or more hotdogs and buns, just output “impossible”. Otherwise, output the smallest number of total packs you can buy (counting both hotdog and bun packs) to get exactly the same number of hotdogs and buns.\n\n-----Examples-----\nSample Input:\n4 10 10 10 10\n10 8 8 8 12 12 12 8 8 12 12\nSample Output:\n4",
        "solutions": "",
        "difficulty": "interview",
        "input": "4 10 10 10 10\n10 8 8 8 12 12 12 8 8 12 12\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ninepacks"
    },
    {
        "id": 661,
        "task_id": 2905,
        "test_case_id": 2,
        "question": " “It’s like how hot dogs come in packs of ten, and buns come in packs of eight or twelve — you have to buy nine packs to make it come out even.” \n\nThis is a quote from the 1986 movie, “True Stories”, and it’s true; well, almost true. You could buy four packs of $10$ hotdogs and five packs of $8$ buns. That would give you exactly $40$ of each. However, you can make things even with fewer packs if you buy two packs of $10$ hotdogs, along with a pack of $8$ buns and another pack of $12$ buns. That would give you $20$ of each, using only $4$ total packs.\n\nFor this problem, you’ll determine the fewest packs you need to buy to make hotdogs and buns come out even, given a selection of different bun and hotdog packs available for purchase.\n\n-----Input-----\nThe first input line starts with an integer, $H$, the number of hotdog packs available. This is followed by $H$ integers, $h_1 \\ldots h_ H$, the number of hotdogs in each pack. The second input line starts with an integer, $B$, giving the number of bun packs available. This is followed by $B$ integers, $b_1 \\ldots b_ B$, indicating the number of buns in each pack. The values $H$ and $B$ are between $0$ and $100$, inclusive, and the sizes of the packs are between $1$ and $1000$, inclusive. Every available pack is listed individually. For example, if there were five eight-bun packs available for purchase, the list of bun packs would contain five copies of the number eight.\n\n-----Output-----\nIf it’s not possible to purchase an equal number of one or more hotdogs and buns, just output “impossible”. Otherwise, output the smallest number of total packs you can buy (counting both hotdog and bun packs) to get exactly the same number of hotdogs and buns.\n\n-----Examples-----\nSample Input:\n4 10 10 10 10\n10 8 8 8 12 12 12 8 8 12 12\nSample Output:\n4",
        "solutions": "",
        "difficulty": "interview",
        "input": "4 7 7 14 7\n3 11 22 11\n",
        "output": "impossible\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ninepacks"
    },
    {
        "id": 662,
        "task_id": 2980,
        "test_case_id": 1,
        "question": "Arthur and his sister Carol have been playing a game called Nim for some time now. Nim is played as follows:\n - The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.\n - The players take turns chosing a heap and removing a positive number of beads from it.\n - The first player not able to make a move, loses.\n\nArthur and Carol really enjoyed playing this simple game until they recently learned an easy way to always be able to find the best move:\n - Xor the number of beads in the heaps in the current position (i.e., if we have $2$, $4$ and $7$ the xor-sum will be $1$ since $2\\ \\mathbf{xor}\\ 4\\ \\mathbf{xor}\\ 7 = 1$).\n - If the xor-sum is $0$, too bad, you will lose.\n - Otherwise, move such that the xor-sum becomes $0$. This is always possible.\n\nIt is quite easy to convince oneself that this works. Consider these facts:\n - The player that takes the last bead wins.\n - After the winning player’s last move the xor-sum will be $0$.\n - The xor-sum will change after every move.\n\nWhich means that if you make sure that the xor-sum always is $0$ when you have made your move, your opponent will never be able to win, and, thus, you will win.\n\nUnderstandably it is no fun to play a game when both players know how to play perfectly (ignorance is bliss). Fortunately, Arthur and Carol soon came up with a similar game, $S$-Nim, that seemed to solve this problem. Each player is now only allowed to remove a number of beads in some predefined set $S$, e.g. if we have $S = \\{ 2, 5\\} $ each player is only allowed to remove $2$ or $5$ beads. Now it is not always possible to make the xor-sum $0$ and, thus, the strategy above is useless. Or is it?\n\nYour job is to write a program that determines if a position of $S$-Nim is a losing or a winning position. A position is a winning position if there is at least one move to a losing position. A position is a losing position if there are no moves to a losing position. This means, as expected, that a position with no legal moves is a losing position.\n\n-----Input-----\nThe first line of input contains a number $k$ ($1 \\le k \\le 100$) describing the size of $S$, followed by $k$ numbers $s_ i$ ($1 \\le s_ i \\le 10000$) describing $S$. The second line contains a number $m$ ($1 \\le m \\le 100$) describing the number of positions to evaluate. The next $m$ lines each contain a number $l$ ($1 \\le l \\le 100$) describing the number of heaps and $l$ numbers $h_ i$ ($0 \\le h_ i \\le 10000$) describing the number of beads in the heaps.\n\n-----Output-----\nFor each position:\n - If the described position is a winning position print a ‘W’.\n - If the described position is a losing position print an ‘L’.\n\n-----Examples-----\nSample Input:\n2 2 5\n3\n2 5 12\n3 2 4 7\n4 2 3 7 12\nSample Output:\nLWW",
        "solutions": "",
        "difficulty": "interview",
        "input": "2 2 5\n3\n2 5 12\n3 2 4 7\n4 2 3 7 12\n",
        "output": "LWW\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/snim"
    },
    {
        "id": 663,
        "task_id": 2980,
        "test_case_id": 2,
        "question": "Arthur and his sister Carol have been playing a game called Nim for some time now. Nim is played as follows:\n - The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.\n - The players take turns chosing a heap and removing a positive number of beads from it.\n - The first player not able to make a move, loses.\n\nArthur and Carol really enjoyed playing this simple game until they recently learned an easy way to always be able to find the best move:\n - Xor the number of beads in the heaps in the current position (i.e., if we have $2$, $4$ and $7$ the xor-sum will be $1$ since $2\\ \\mathbf{xor}\\ 4\\ \\mathbf{xor}\\ 7 = 1$).\n - If the xor-sum is $0$, too bad, you will lose.\n - Otherwise, move such that the xor-sum becomes $0$. This is always possible.\n\nIt is quite easy to convince oneself that this works. Consider these facts:\n - The player that takes the last bead wins.\n - After the winning player’s last move the xor-sum will be $0$.\n - The xor-sum will change after every move.\n\nWhich means that if you make sure that the xor-sum always is $0$ when you have made your move, your opponent will never be able to win, and, thus, you will win.\n\nUnderstandably it is no fun to play a game when both players know how to play perfectly (ignorance is bliss). Fortunately, Arthur and Carol soon came up with a similar game, $S$-Nim, that seemed to solve this problem. Each player is now only allowed to remove a number of beads in some predefined set $S$, e.g. if we have $S = \\{ 2, 5\\} $ each player is only allowed to remove $2$ or $5$ beads. Now it is not always possible to make the xor-sum $0$ and, thus, the strategy above is useless. Or is it?\n\nYour job is to write a program that determines if a position of $S$-Nim is a losing or a winning position. A position is a winning position if there is at least one move to a losing position. A position is a losing position if there are no moves to a losing position. This means, as expected, that a position with no legal moves is a losing position.\n\n-----Input-----\nThe first line of input contains a number $k$ ($1 \\le k \\le 100$) describing the size of $S$, followed by $k$ numbers $s_ i$ ($1 \\le s_ i \\le 10000$) describing $S$. The second line contains a number $m$ ($1 \\le m \\le 100$) describing the number of positions to evaluate. The next $m$ lines each contain a number $l$ ($1 \\le l \\le 100$) describing the number of heaps and $l$ numbers $h_ i$ ($0 \\le h_ i \\le 10000$) describing the number of beads in the heaps.\n\n-----Output-----\nFor each position:\n - If the described position is a winning position print a ‘W’.\n - If the described position is a losing position print an ‘L’.\n\n-----Examples-----\nSample Input:\n2 2 5\n3\n2 5 12\n3 2 4 7\n4 2 3 7 12\nSample Output:\nLWW",
        "solutions": "",
        "difficulty": "interview",
        "input": "5 1 2 3 4 5\n3\n2 5 12\n3 2 4 7\n4 2 3 7 12\n",
        "output": "WWL\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/snim"
    },
    {
        "id": 664,
        "task_id": 3016,
        "test_case_id": 1,
        "question": "Baby Timmy has a pool of balls that he plays with. The pool is made up of balls with $n$ different colors with a certain number of each color. Baby Timmy finds it interesting to order these balls in a line given certain conditions he made. Timmy has two conditions when playing his own game:\n - Balls of certain colors may not be next to each other\n - One particular sequence of colors which Timmy likes most must appear as many times as possible\n\nCan you compute the total number of different ways in which Timmy can arrange his balls?\n\nFor instance, suppose Timmy has $2$ red, $1$ yellow, $2$ green, and $1$ blue ball(s). He doesn’t like for red or yellow balls to be next to each other, and his favorite sequence is “green blue.” The following six arrangements meet the requirements:\n\nred green blue red green yellow \nred green blue yellow green red \nred green red green blue yellow \nred green yellow green blue red \nyellow green blue red green red \nyellow green red green blue red \n\nThis arrangement corresponds to Sample Input 1.\n\nNote that Timmy insists on including his favorite sequence as often as the available balls allow, even if that means not being able to complete the arrangement of balls at all.\n\n-----Input-----\nThe input consists of a single test case with three lines. The first line contains an integer $n$ ($2 \\le n \\le 50$), which describe the number of different colors. The remaining $n$ integers on that line denote how many balls Timmy has of each color (colors are numbered $1$ through $n$ and their frequencies appear in order). The number of balls he has of each color is between $1$ and $50$, inclusive.\n\nThe second line of input describes which colors Timmy does not want next to each other. The first integer $k$ ($0 \\le k \\le n$) gives the number of colors. This is followed by $k$ integers $c_ i$ ($1 \\le c_ i \\le n$) denoting the colors that prevent balls having any of these colors from being next to each other. Each $c_ i$ is unique.\n\nThe third line of input describes the sequence Timmy likes most. This first integer $l$ ($0 \\le l \\le n$) describes the length of this sequence, and the following $l$ integers $s_ i$ ($1 \\le s_ i \\le n$) describe the sequence that must appear as often as possible in the arrangement. Each $s_ i$ is unique and the sets $\\{ c_ i \\} $ and $\\{ s_ i \\} $ do not intersect.\n\n-----Output-----\nOutput the number of arrangements Timmy can make that satisfy the given conditions. Since the number can be large, output its value modulo $1000000007$.\n\n-----Examples-----\nSample Input 1:\n4 2 1 2 1\n2 1 2\n2 3 4\nSample Output 1:\n6\n\nSample Input 2:\n3 3 1 1\n1 1\n2 2 3\nSample Output 2:\n0\n\nSample Input 3:\n3 2 2 3\n1 1\n2 2 3\nSample Output 3:\n18\n\nSample Input 4:\n3 1 2 3\n2 1 2\n0\nSample Output 4:\n12",
        "solutions": "",
        "difficulty": "competition",
        "input": "4 2 1 2 1\n2 1 2\n2 3 4\n",
        "output": "6\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ballcolors"
    },
    {
        "id": 665,
        "task_id": 3016,
        "test_case_id": 2,
        "question": "Baby Timmy has a pool of balls that he plays with. The pool is made up of balls with $n$ different colors with a certain number of each color. Baby Timmy finds it interesting to order these balls in a line given certain conditions he made. Timmy has two conditions when playing his own game:\n - Balls of certain colors may not be next to each other\n - One particular sequence of colors which Timmy likes most must appear as many times as possible\n\nCan you compute the total number of different ways in which Timmy can arrange his balls?\n\nFor instance, suppose Timmy has $2$ red, $1$ yellow, $2$ green, and $1$ blue ball(s). He doesn’t like for red or yellow balls to be next to each other, and his favorite sequence is “green blue.” The following six arrangements meet the requirements:\n\nred green blue red green yellow \nred green blue yellow green red \nred green red green blue yellow \nred green yellow green blue red \nyellow green blue red green red \nyellow green red green blue red \n\nThis arrangement corresponds to Sample Input 1.\n\nNote that Timmy insists on including his favorite sequence as often as the available balls allow, even if that means not being able to complete the arrangement of balls at all.\n\n-----Input-----\nThe input consists of a single test case with three lines. The first line contains an integer $n$ ($2 \\le n \\le 50$), which describe the number of different colors. The remaining $n$ integers on that line denote how many balls Timmy has of each color (colors are numbered $1$ through $n$ and their frequencies appear in order). The number of balls he has of each color is between $1$ and $50$, inclusive.\n\nThe second line of input describes which colors Timmy does not want next to each other. The first integer $k$ ($0 \\le k \\le n$) gives the number of colors. This is followed by $k$ integers $c_ i$ ($1 \\le c_ i \\le n$) denoting the colors that prevent balls having any of these colors from being next to each other. Each $c_ i$ is unique.\n\nThe third line of input describes the sequence Timmy likes most. This first integer $l$ ($0 \\le l \\le n$) describes the length of this sequence, and the following $l$ integers $s_ i$ ($1 \\le s_ i \\le n$) describe the sequence that must appear as often as possible in the arrangement. Each $s_ i$ is unique and the sets $\\{ c_ i \\} $ and $\\{ s_ i \\} $ do not intersect.\n\n-----Output-----\nOutput the number of arrangements Timmy can make that satisfy the given conditions. Since the number can be large, output its value modulo $1000000007$.\n\n-----Examples-----\nSample Input 1:\n4 2 1 2 1\n2 1 2\n2 3 4\nSample Output 1:\n6\n\nSample Input 2:\n3 3 1 1\n1 1\n2 2 3\nSample Output 2:\n0\n\nSample Input 3:\n3 2 2 3\n1 1\n2 2 3\nSample Output 3:\n18\n\nSample Input 4:\n3 1 2 3\n2 1 2\n0\nSample Output 4:\n12",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 3 1 1\n1 1\n2 2 3\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ballcolors"
    },
    {
        "id": 666,
        "task_id": 3016,
        "test_case_id": 3,
        "question": "Baby Timmy has a pool of balls that he plays with. The pool is made up of balls with $n$ different colors with a certain number of each color. Baby Timmy finds it interesting to order these balls in a line given certain conditions he made. Timmy has two conditions when playing his own game:\n - Balls of certain colors may not be next to each other\n - One particular sequence of colors which Timmy likes most must appear as many times as possible\n\nCan you compute the total number of different ways in which Timmy can arrange his balls?\n\nFor instance, suppose Timmy has $2$ red, $1$ yellow, $2$ green, and $1$ blue ball(s). He doesn’t like for red or yellow balls to be next to each other, and his favorite sequence is “green blue.” The following six arrangements meet the requirements:\n\nred green blue red green yellow \nred green blue yellow green red \nred green red green blue yellow \nred green yellow green blue red \nyellow green blue red green red \nyellow green red green blue red \n\nThis arrangement corresponds to Sample Input 1.\n\nNote that Timmy insists on including his favorite sequence as often as the available balls allow, even if that means not being able to complete the arrangement of balls at all.\n\n-----Input-----\nThe input consists of a single test case with three lines. The first line contains an integer $n$ ($2 \\le n \\le 50$), which describe the number of different colors. The remaining $n$ integers on that line denote how many balls Timmy has of each color (colors are numbered $1$ through $n$ and their frequencies appear in order). The number of balls he has of each color is between $1$ and $50$, inclusive.\n\nThe second line of input describes which colors Timmy does not want next to each other. The first integer $k$ ($0 \\le k \\le n$) gives the number of colors. This is followed by $k$ integers $c_ i$ ($1 \\le c_ i \\le n$) denoting the colors that prevent balls having any of these colors from being next to each other. Each $c_ i$ is unique.\n\nThe third line of input describes the sequence Timmy likes most. This first integer $l$ ($0 \\le l \\le n$) describes the length of this sequence, and the following $l$ integers $s_ i$ ($1 \\le s_ i \\le n$) describe the sequence that must appear as often as possible in the arrangement. Each $s_ i$ is unique and the sets $\\{ c_ i \\} $ and $\\{ s_ i \\} $ do not intersect.\n\n-----Output-----\nOutput the number of arrangements Timmy can make that satisfy the given conditions. Since the number can be large, output its value modulo $1000000007$.\n\n-----Examples-----\nSample Input 1:\n4 2 1 2 1\n2 1 2\n2 3 4\nSample Output 1:\n6\n\nSample Input 2:\n3 3 1 1\n1 1\n2 2 3\nSample Output 2:\n0\n\nSample Input 3:\n3 2 2 3\n1 1\n2 2 3\nSample Output 3:\n18\n\nSample Input 4:\n3 1 2 3\n2 1 2\n0\nSample Output 4:\n12",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 2 2 3\n1 1\n2 2 3\n",
        "output": "18\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ballcolors"
    },
    {
        "id": 667,
        "task_id": 3016,
        "test_case_id": 4,
        "question": "Baby Timmy has a pool of balls that he plays with. The pool is made up of balls with $n$ different colors with a certain number of each color. Baby Timmy finds it interesting to order these balls in a line given certain conditions he made. Timmy has two conditions when playing his own game:\n - Balls of certain colors may not be next to each other\n - One particular sequence of colors which Timmy likes most must appear as many times as possible\n\nCan you compute the total number of different ways in which Timmy can arrange his balls?\n\nFor instance, suppose Timmy has $2$ red, $1$ yellow, $2$ green, and $1$ blue ball(s). He doesn’t like for red or yellow balls to be next to each other, and his favorite sequence is “green blue.” The following six arrangements meet the requirements:\n\nred green blue red green yellow \nred green blue yellow green red \nred green red green blue yellow \nred green yellow green blue red \nyellow green blue red green red \nyellow green red green blue red \n\nThis arrangement corresponds to Sample Input 1.\n\nNote that Timmy insists on including his favorite sequence as often as the available balls allow, even if that means not being able to complete the arrangement of balls at all.\n\n-----Input-----\nThe input consists of a single test case with three lines. The first line contains an integer $n$ ($2 \\le n \\le 50$), which describe the number of different colors. The remaining $n$ integers on that line denote how many balls Timmy has of each color (colors are numbered $1$ through $n$ and their frequencies appear in order). The number of balls he has of each color is between $1$ and $50$, inclusive.\n\nThe second line of input describes which colors Timmy does not want next to each other. The first integer $k$ ($0 \\le k \\le n$) gives the number of colors. This is followed by $k$ integers $c_ i$ ($1 \\le c_ i \\le n$) denoting the colors that prevent balls having any of these colors from being next to each other. Each $c_ i$ is unique.\n\nThe third line of input describes the sequence Timmy likes most. This first integer $l$ ($0 \\le l \\le n$) describes the length of this sequence, and the following $l$ integers $s_ i$ ($1 \\le s_ i \\le n$) describe the sequence that must appear as often as possible in the arrangement. Each $s_ i$ is unique and the sets $\\{ c_ i \\} $ and $\\{ s_ i \\} $ do not intersect.\n\n-----Output-----\nOutput the number of arrangements Timmy can make that satisfy the given conditions. Since the number can be large, output its value modulo $1000000007$.\n\n-----Examples-----\nSample Input 1:\n4 2 1 2 1\n2 1 2\n2 3 4\nSample Output 1:\n6\n\nSample Input 2:\n3 3 1 1\n1 1\n2 2 3\nSample Output 2:\n0\n\nSample Input 3:\n3 2 2 3\n1 1\n2 2 3\nSample Output 3:\n18\n\nSample Input 4:\n3 1 2 3\n2 1 2\n0\nSample Output 4:\n12",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1 2 3\n2 1 2\n0\n",
        "output": "12\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ballcolors"
    },
    {
        "id": 668,
        "task_id": 3016,
        "test_case_id": 5,
        "question": "Baby Timmy has a pool of balls that he plays with. The pool is made up of balls with $n$ different colors with a certain number of each color. Baby Timmy finds it interesting to order these balls in a line given certain conditions he made. Timmy has two conditions when playing his own game:\n - Balls of certain colors may not be next to each other\n - One particular sequence of colors which Timmy likes most must appear as many times as possible\n\nCan you compute the total number of different ways in which Timmy can arrange his balls?\n\nFor instance, suppose Timmy has $2$ red, $1$ yellow, $2$ green, and $1$ blue ball(s). He doesn’t like for red or yellow balls to be next to each other, and his favorite sequence is “green blue.” The following six arrangements meet the requirements:\n\nred green blue red green yellow \nred green blue yellow green red \nred green red green blue yellow \nred green yellow green blue red \nyellow green blue red green red \nyellow green red green blue red \n\nThis arrangement corresponds to Sample Input 1.\n\nNote that Timmy insists on including his favorite sequence as often as the available balls allow, even if that means not being able to complete the arrangement of balls at all.\n\n-----Input-----\nThe input consists of a single test case with three lines. The first line contains an integer $n$ ($2 \\le n \\le 50$), which describe the number of different colors. The remaining $n$ integers on that line denote how many balls Timmy has of each color (colors are numbered $1$ through $n$ and their frequencies appear in order). The number of balls he has of each color is between $1$ and $50$, inclusive.\n\nThe second line of input describes which colors Timmy does not want next to each other. The first integer $k$ ($0 \\le k \\le n$) gives the number of colors. This is followed by $k$ integers $c_ i$ ($1 \\le c_ i \\le n$) denoting the colors that prevent balls having any of these colors from being next to each other. Each $c_ i$ is unique.\n\nThe third line of input describes the sequence Timmy likes most. This first integer $l$ ($0 \\le l \\le n$) describes the length of this sequence, and the following $l$ integers $s_ i$ ($1 \\le s_ i \\le n$) describe the sequence that must appear as often as possible in the arrangement. Each $s_ i$ is unique and the sets $\\{ c_ i \\} $ and $\\{ s_ i \\} $ do not intersect.\n\n-----Output-----\nOutput the number of arrangements Timmy can make that satisfy the given conditions. Since the number can be large, output its value modulo $1000000007$.\n\n-----Examples-----\nSample Input 1:\n4 2 1 2 1\n2 1 2\n2 3 4\nSample Output 1:\n6\n\nSample Input 2:\n3 3 1 1\n1 1\n2 2 3\nSample Output 2:\n0\n\nSample Input 3:\n3 2 2 3\n1 1\n2 2 3\nSample Output 3:\n18\n\nSample Input 4:\n3 1 2 3\n2 1 2\n0\nSample Output 4:\n12",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 1 4 1\n1 2\n1 3\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/ballcolors"
    },
    {
        "id": 669,
        "task_id": 3171,
        "test_case_id": 3,
        "question": "Excitement is rapidly increasing in anticipation of the concluding debate at the 0x7E4 Undemocratic Inclinational Unconvention, where the party’s candidate for the office of Student Assistant to the Old Chemistry Building Assistant Printer Service Technician’s Assistant will be elected. To secure a revered lifetime appointment as antenna calibrator for the dank.nt.nu pirate radio station (broadcasted live from the Gløshaugen catacombs every night at 00:13:37 CET), you have been challenged to produce a $256$-minute feature revealing the character type of each candidate.\n\nIt is well known any candidate is either a truther, who always tells the truth, a fabulist, who never tells the truth, or a charlatan, who starts any debate speaking truthfully, but eventually switches to uttering only falsehoods. (Precisely, a charlatan first utters one or more true statements, then she utters one or more false statements, and that is all.)\n\nNow, as should be expected candidates talk nothing about printer maintenance policy, but about only each other’s character types. In particular, candidates utter propositions using the following language:\n - truther <n>, where <n> is a name of a candidate, which is true if <n> is the name of a truther\n - fabulist <n>, where <n> is a name of a candidate, which is true if <n> is the name of a fabulist\n - charlatan <n>, where <n> is a name of a candidate, which is true if <n> is the name of a charlatan\n - not <p>, where <p> is a proposition, which is true if <p> is false\n - and <p> <q>, where <p> and <q> are propositions, which is true if both <p> and <q> are true\n - xor <p> <q>, where <p> and <q> are propositions, which is true if one of <p> or <q> is false and the other one is true\n\nIt is somewhat strange the relatively brainy electorate has not been able to determine the correct character types of the candidates, as that is indeed always possible given the transcript of a debate. The devoted patrons of dank.nt.nu, however, believe you’ll prove equal to the task.\n\n-----Input-----\nInput describes one full debate transcript. The first line of input contains two integers $N$ and $K$, denoting the number of candidates and the total number of utterances in the debate. The candidates are named by the integers $1$ to $N$. The next $K$ lines describe the utterances in the debate, sorted by time; the first such line describes the first utterance of the debate. Each such line consists of an integer, denoting the name of the speaker of the utterance, and the uttered statement, expressed in the language described above. Adjacent tokens on the same line will be separated by exactly one space character.\n\n-----Output-----\nOutput $N$ lines. On the $i$th line, name the character type (truther, fabulist, or charlatan) of the candidate whose name is $i$.\n\n-----Limits and additional notes-----\n - $1 \\leq N \\leq 7$\n - $1 \\leq K \\leq 100$\n - No line of input will be longer than $2049$ characters (including the line-feed character).\n - All candidates know each other’s character types.\n - Character type claims will only be about persons in a debate. I.e. for the propositions truther <n>, fabulist <n>, and charlatan <n>, one will always have $1 \\leq \\texttt{n} \\leq N$.\n\n-----Examples-----\nSample Input 1:\n1 2\n1 charlatan 1\n1 not charlatan 1\nSample Output 1:\ncharlatan\n\nSample Input 2:\n2 1\n1 and fabulist 1 fabulist 2\nSample Output 2:\nfabulist\ntruther",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 2\n1 fabulist 3\n3 and truther 1 truther 2\n",
        "output": "truther\nfabulist\nfabulist\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/fakenews"
    },
    {
        "id": 670,
        "task_id": 3426,
        "test_case_id": 1,
        "question": "In the year 2120 there is a vast subway network under all of Lund, consisting of $N$ stations and $M$ tunnels. Each tunnel connects two stations and the stations are numbered $1$, $\\ldots $, $N$.\n\nErik has had enough of Skånetrafiken’s terrible route planning software and plans to build his own. To do this, he needs to know the length of each of the tunnels, but the subway map is incomplete in this regard. By looking out the window, Erik has noticed that some tunnels have special cables running alongside them, probably for providing power to the stations. The cables connect the stations so that every station is connected to the central station (the station numbered $1$). Knowing how greedy Skånetrafiken is, he is certain that the cables are placed so that the total length of cable is minimized.\n\nErik knows the precise length of some tunnels, and which tunnels contain cables. Using this information he wants to find the minimum possible length for each tunnel with unknown length. Unfortunately, Erik’s algorithm isn’t efficient enough to process the enormous size of Lund’s subway network. Can you help him by implementing a more efficient algorithm?\n\n-----Input-----\nThe first line of input contains two integers $N$ and $M$, where $2 \\leq N \\leq 10^5$ and $N - 1 \\leq M \\leq 2 \\cdot 10^5$, the number of stations and the number of tunnels, respectively. Each of the next $M$ lines contains the values $a_ i$, $b_ i$, $l_ i$ and $c_ i$. The integers $a_ i$ and $b_ i$, with $1 \\leq a_ i, b_ i \\leq N$ and $a_ i\\neq b_ i$, denote the two stations connected by the $i$th tunnel. The value $l_ i$ is either an integer satisfying $1 \\leq l_ i \\leq 10^9$, the length of the $i$th tunnel if it is known, or a question mark “?”. Finally, $c_ i$ is $1$ if the $i$th tunnel contains a cable, and $0$ if not.\n\nIt is guaranteed that there is at most one tunnel connecting the same pair of stations, and that it is possible to travel between any pair of stations using the subway. It is also guaranteed that there exists a path between any station and station number $1$ using only tunnels where $c_ i = 1$.\n\n-----Output-----\nFor each tunnel with $l_ i=\\texttt{?}$, output one line with a single integer, the minimum possible length for that tunnel. Tunnel lengths should be output in the same order as the tunnels are listed in the input.\n\n-----Sample Description-----\nIn the first sample case, the minimal distance for the unknown tunnel (between stations $3$ and $1$) is $5$. This is because, if the length were less than $5$, it would be more efficient for Skånetrafiken to run cables through the second and third tunnels.\n\n-----Examples-----\nSample Input:\n3 3\n1 2 5 1\n2 3 3 1\n3 1 ? 0\nSample Output:\n5",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 3\n1 2 5 1\n2 3 3 1\n3 1 ? 0\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/subwaymap"
    },
    {
        "id": 671,
        "task_id": 3426,
        "test_case_id": 2,
        "question": "In the year 2120 there is a vast subway network under all of Lund, consisting of $N$ stations and $M$ tunnels. Each tunnel connects two stations and the stations are numbered $1$, $\\ldots $, $N$.\n\nErik has had enough of Skånetrafiken’s terrible route planning software and plans to build his own. To do this, he needs to know the length of each of the tunnels, but the subway map is incomplete in this regard. By looking out the window, Erik has noticed that some tunnels have special cables running alongside them, probably for providing power to the stations. The cables connect the stations so that every station is connected to the central station (the station numbered $1$). Knowing how greedy Skånetrafiken is, he is certain that the cables are placed so that the total length of cable is minimized.\n\nErik knows the precise length of some tunnels, and which tunnels contain cables. Using this information he wants to find the minimum possible length for each tunnel with unknown length. Unfortunately, Erik’s algorithm isn’t efficient enough to process the enormous size of Lund’s subway network. Can you help him by implementing a more efficient algorithm?\n\n-----Input-----\nThe first line of input contains two integers $N$ and $M$, where $2 \\leq N \\leq 10^5$ and $N - 1 \\leq M \\leq 2 \\cdot 10^5$, the number of stations and the number of tunnels, respectively. Each of the next $M$ lines contains the values $a_ i$, $b_ i$, $l_ i$ and $c_ i$. The integers $a_ i$ and $b_ i$, with $1 \\leq a_ i, b_ i \\leq N$ and $a_ i\\neq b_ i$, denote the two stations connected by the $i$th tunnel. The value $l_ i$ is either an integer satisfying $1 \\leq l_ i \\leq 10^9$, the length of the $i$th tunnel if it is known, or a question mark “?”. Finally, $c_ i$ is $1$ if the $i$th tunnel contains a cable, and $0$ if not.\n\nIt is guaranteed that there is at most one tunnel connecting the same pair of stations, and that it is possible to travel between any pair of stations using the subway. It is also guaranteed that there exists a path between any station and station number $1$ using only tunnels where $c_ i = 1$.\n\n-----Output-----\nFor each tunnel with $l_ i=\\texttt{?}$, output one line with a single integer, the minimum possible length for that tunnel. Tunnel lengths should be output in the same order as the tunnels are listed in the input.\n\n-----Sample Description-----\nIn the first sample case, the minimal distance for the unknown tunnel (between stations $3$ and $1$) is $5$. This is because, if the length were less than $5$, it would be more efficient for Skånetrafiken to run cables through the second and third tunnels.\n\n-----Examples-----\nSample Input:\n3 3\n1 2 5 1\n2 3 3 1\n3 1 ? 0\nSample Output:\n5",
        "solutions": "",
        "difficulty": "competition",
        "input": "4 3\n1 2 ? 1\n1 3 ? 1\n2 4 ? 1\n",
        "output": "1\n1\n1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/subwaymap"
    },
    {
        "id": 672,
        "task_id": 3546,
        "test_case_id": 1,
        "question": "David is writing an article for the Bulletin of the Association of Proof Completions. In his article, he proves several theorems. For every theorem, David came up with a proof. Since David is a very eager student, he even came up with multiple proofs for some of the theorems. As usual, a proof for a theorem may depend on a number of other theorems.\n\nThe article has to be as short as possible to publish it, and David only really cares about the main theorem, Theorem $0$. In order to achieve this, he has estimated the number of words he will need for every proof. Can you help David find the shortest possible length of his article?\n\n-----Input-----\n - A single line containing $1\\leq n\\leq 20$, the number of theorems.\n - For each theorem:\n - A single line containing $1\\leq p_ i\\leq 10$, the number of proofs for the $i$th theorem.\n - $p_ i$ lines, each of the form $l$, $k$, $d_0,\\dots ,d_{k-1}$, where $0\\leq l\\leq 10^6$ is the length of the proof, $0\\leq k\\leq n-1$ is the number of theorems the proof depends on, and the $0\\leq d_ i\\leq n-1$ are the numbers of the theorems the proof depends on.\n\n-----Output-----\nPrint one line with a single integer, the shortest possible length of David’s article.\n\n-----Examples-----\nSample Input:\n2\n2\n10 0\n3 1 1\n1\n4 1 0\nSample Output:\n10",
        "solutions": "",
        "difficulty": "competition",
        "input": "2\n2\n10 0\n3 1 1\n1\n4 1 0\n",
        "output": "10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/journalediting"
    },
    {
        "id": 673,
        "task_id": 3546,
        "test_case_id": 2,
        "question": "David is writing an article for the Bulletin of the Association of Proof Completions. In his article, he proves several theorems. For every theorem, David came up with a proof. Since David is a very eager student, he even came up with multiple proofs for some of the theorems. As usual, a proof for a theorem may depend on a number of other theorems.\n\nThe article has to be as short as possible to publish it, and David only really cares about the main theorem, Theorem $0$. In order to achieve this, he has estimated the number of words he will need for every proof. Can you help David find the shortest possible length of his article?\n\n-----Input-----\n - A single line containing $1\\leq n\\leq 20$, the number of theorems.\n - For each theorem:\n - A single line containing $1\\leq p_ i\\leq 10$, the number of proofs for the $i$th theorem.\n - $p_ i$ lines, each of the form $l$, $k$, $d_0,\\dots ,d_{k-1}$, where $0\\leq l\\leq 10^6$ is the length of the proof, $0\\leq k\\leq n-1$ is the number of theorems the proof depends on, and the $0\\leq d_ i\\leq n-1$ are the numbers of the theorems the proof depends on.\n\n-----Output-----\nPrint one line with a single integer, the shortest possible length of David’s article.\n\n-----Examples-----\nSample Input:\n2\n2\n10 0\n3 1 1\n1\n4 1 0\nSample Output:\n10",
        "solutions": "",
        "difficulty": "competition",
        "input": "4\n2\n1 2 1 3\n5 1 2\n1\n2 0\n1\n0 0\n2\n2 0\n1 1 1\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/journalediting"
    },
    {
        "id": 674,
        "task_id": 3563,
        "test_case_id": 1,
        "question": "Dezider is making a game board for the game of Convexity. He drilled a bunch of holes in a piece of wood. As the name of the game suggests the holes were on the boundary of a convex polygon. After turning over the piece of wood, Dezider froze—he had damaged the famous Picasso lithograph—The Bull No. 8. Now the question is: how to fix the damage? Drawing a bunch of straight lines to cover the holes seems like a good repair method but, of course, Dezider would like to draw as few lines as possible. He needs your help. Write a program that, given the positions of the holes, finds the smallest number of straight lines that can cover the holes.\n\n-----Input-----\nThe only input line starts with $n$, the number of holes. Then $2n$ numbers, the coordinates of the holes, follow. You can assume that $3 \\leq n \\leq 1000$ and the coordinates are integers between $-1000000$ and $1000000$. The holes lie on the boundary of a convex polygon.\n\n-----Output-----\nThe output contains one line with the smallest number $\\ell $, such that $\\ell $ straight lines can cover the holes.\n\n-----Examples-----\nSample Input:\n4 0 0 1 1 1 0 0 1\nSample Output:\n2",
        "solutions": "",
        "difficulty": "competition",
        "input": "4 0 0 1 1 1 0 0 1\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/coverup"
    },
    {
        "id": 675,
        "task_id": 3563,
        "test_case_id": 2,
        "question": "Dezider is making a game board for the game of Convexity. He drilled a bunch of holes in a piece of wood. As the name of the game suggests the holes were on the boundary of a convex polygon. After turning over the piece of wood, Dezider froze—he had damaged the famous Picasso lithograph—The Bull No. 8. Now the question is: how to fix the damage? Drawing a bunch of straight lines to cover the holes seems like a good repair method but, of course, Dezider would like to draw as few lines as possible. He needs your help. Write a program that, given the positions of the holes, finds the smallest number of straight lines that can cover the holes.\n\n-----Input-----\nThe only input line starts with $n$, the number of holes. Then $2n$ numbers, the coordinates of the holes, follow. You can assume that $3 \\leq n \\leq 1000$ and the coordinates are integers between $-1000000$ and $1000000$. The holes lie on the boundary of a convex polygon.\n\n-----Output-----\nThe output contains one line with the smallest number $\\ell $, such that $\\ell $ straight lines can cover the holes.\n\n-----Examples-----\nSample Input:\n4 0 0 1 1 1 0 0 1\nSample Output:\n2",
        "solutions": "",
        "difficulty": "competition",
        "input": "8 0 0 2 2 0 2 2 0 1 0 1 2 0 1 2 1\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/coverup"
    },
    {
        "id": 676,
        "task_id": 3580,
        "test_case_id": 1,
        "question": "The problem is simple. You are given a long sequence of integers $a_1, a_2, \\ldots , a_ n$. Then you are given a query consisting of a start index $i$ and a subset of integers $B$. What is the longest consecutive subsequence of the given sequence that starts at position $i$ and contains only integers in $B$?\n\nSimple, right?\n\n-----Input-----\nThe first line of input contains a single integer $1 \\leq n \\leq 10^5$. The second line contains $n$ integers $a_1, \\ldots , a_ n$. Each integer $a_ j$ lies between 0 and $2^{31}-1$.\n\nThe third line contains a single integer $q \\geq 1$ indicating the number of queries to process. Then $q$ lines follow, each starting with two integers $1 \\leq i \\leq n$ and $1 \\leq m \\leq 10^5$, followed by $m$ distinct integers $b_1, \\ldots , b_ m$. Each integer $b_ j$ lies between 0 and $2^{31}-1$.\n\nFinally, you are guaranteed the sum of all values $m$ over all queries is at most $10^5$.\n\n-----Output-----\nFor each query, output a single line with the length of the longest prefix of $a_ i, a_{i+1}, \\ldots , a_ n$ that only contains integers from $B$.\n\n-----Examples-----\nSample Input:\n7\n1 2 3 1 2 1 1\n5\n1 3 1 2 3\n1 2 1 2\n2 2 2 3\n3 2 1 2\n4 2 1 2\nSample Output:\n7\n2\n2\n0\n4",
        "solutions": "",
        "difficulty": "competition",
        "input": "7\n1 2 3 1 2 1 1\n5\n1 3 1 2 3\n1 2 1 2\n2 2 2 3\n3 2 1 2\n4 2 1 2\n",
        "output": "7\n2\n2\n0\n4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/maximalsequences"
    },
    {
        "id": 677,
        "task_id": 3580,
        "test_case_id": 2,
        "question": "The problem is simple. You are given a long sequence of integers $a_1, a_2, \\ldots , a_ n$. Then you are given a query consisting of a start index $i$ and a subset of integers $B$. What is the longest consecutive subsequence of the given sequence that starts at position $i$ and contains only integers in $B$?\n\nSimple, right?\n\n-----Input-----\nThe first line of input contains a single integer $1 \\leq n \\leq 10^5$. The second line contains $n$ integers $a_1, \\ldots , a_ n$. Each integer $a_ j$ lies between 0 and $2^{31}-1$.\n\nThe third line contains a single integer $q \\geq 1$ indicating the number of queries to process. Then $q$ lines follow, each starting with two integers $1 \\leq i \\leq n$ and $1 \\leq m \\leq 10^5$, followed by $m$ distinct integers $b_1, \\ldots , b_ m$. Each integer $b_ j$ lies between 0 and $2^{31}-1$.\n\nFinally, you are guaranteed the sum of all values $m$ over all queries is at most $10^5$.\n\n-----Output-----\nFor each query, output a single line with the length of the longest prefix of $a_ i, a_{i+1}, \\ldots , a_ n$ that only contains integers from $B$.\n\n-----Examples-----\nSample Input:\n7\n1 2 3 1 2 1 1\n5\n1 3 1 2 3\n1 2 1 2\n2 2 2 3\n3 2 1 2\n4 2 1 2\nSample Output:\n7\n2\n2\n0\n4",
        "solutions": "",
        "difficulty": "competition",
        "input": "10\n1 2 3 4 5 6 7 8 9 10\n5\n1 10 1 2 3 4 5 6 7 8 9 10\n7 10 1 2 3 4 5 6 7 8 9 10\n5 5 1 14 7 6 5\n2 6 6 3 4 2 7 5\n1 1 1\n",
        "output": "10\n4\n3\n6\n1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/maximalsequences"
    },
    {
        "id": 678,
        "task_id": 3627,
        "test_case_id": 1,
        "question": "Peter is attempting to deep-water solo a rock climbing cliff over the ocean. Deep-water soloing (DWS) is a form of solo rock climbing that relies solely upon the presence of water at the base of the climb to protect against injury from falling.\n\nRock climbing is very exhausting and takes lots of energy. Since Peter is not very flexible, he can only move $1$ unit in any of the four directions: Up, Down, Left, and Right. Traveling to a different square will decrease Peter’s energy by the amount on that square. Note that the amount of energy on a square can be negative. In this case, Peter will gain energy.\n\nIf Peter’s energy is negative, he will fall into the water.\n\nPeter doesn’t want to get wet, so he asks you to compute the minimum amount of energy he needs to complete the climb, assuming he takes an optimal route.\n\n-----Input-----\nThe first line of the input will contain two integers, $R$, $C$ ($1 \\leq R, C \\leq 15$). The second line of input will consist of a row of $C$E characters, separated by spaces, representing the top of the cliff. These take $0$ units of energy to enter. Peter can choose any of them.\n\nNext, there will be $R$ rows of $C$ columns of numbers $X_{r,c}$, where ($-9 \\leq X_{r,c} \\leq 9$), the energy required to enter that section of cliff. The final line of input will consist of a row of $C$ S characters, representing the possible start points of the climb. These take $0$ units of energy to enter. Peter may return to any field, including the starting position, as often as he likes.\n\n-----Output-----\nOutput a single integer, the minimum initial amount of energy necessary to complete the climb without falling.\n\n-----Examples-----\nSample Input:\n5 5\nE E E E E\n1 2 3 4 5\n5 4 3 2 1\n-2 -2 -2 -2 -2\n8 8 8 8 8\n9 9 9 9 9\nS S S S S\nSample Output:\n17",
        "solutions": "",
        "difficulty": "competition",
        "input": "5 5\nE E E E E\n1 2 3 4 5\n5 4 3 2 1\n-2 -2 -2 -2 -2\n8 8 8 8 8\n9 9 9 9 9\nS S S S S\n",
        "output": "17\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/rockclimbing"
    },
    {
        "id": 679,
        "task_id": 3627,
        "test_case_id": 2,
        "question": "Peter is attempting to deep-water solo a rock climbing cliff over the ocean. Deep-water soloing (DWS) is a form of solo rock climbing that relies solely upon the presence of water at the base of the climb to protect against injury from falling.\n\nRock climbing is very exhausting and takes lots of energy. Since Peter is not very flexible, he can only move $1$ unit in any of the four directions: Up, Down, Left, and Right. Traveling to a different square will decrease Peter’s energy by the amount on that square. Note that the amount of energy on a square can be negative. In this case, Peter will gain energy.\n\nIf Peter’s energy is negative, he will fall into the water.\n\nPeter doesn’t want to get wet, so he asks you to compute the minimum amount of energy he needs to complete the climb, assuming he takes an optimal route.\n\n-----Input-----\nThe first line of the input will contain two integers, $R$, $C$ ($1 \\leq R, C \\leq 15$). The second line of input will consist of a row of $C$E characters, separated by spaces, representing the top of the cliff. These take $0$ units of energy to enter. Peter can choose any of them.\n\nNext, there will be $R$ rows of $C$ columns of numbers $X_{r,c}$, where ($-9 \\leq X_{r,c} \\leq 9$), the energy required to enter that section of cliff. The final line of input will consist of a row of $C$ S characters, representing the possible start points of the climb. These take $0$ units of energy to enter. Peter may return to any field, including the starting position, as often as he likes.\n\n-----Output-----\nOutput a single integer, the minimum initial amount of energy necessary to complete the climb without falling.\n\n-----Examples-----\nSample Input:\n5 5\nE E E E E\n1 2 3 4 5\n5 4 3 2 1\n-2 -2 -2 -2 -2\n8 8 8 8 8\n9 9 9 9 9\nS S S S S\nSample Output:\n17",
        "solutions": "",
        "difficulty": "competition",
        "input": "13 5\nE E E E E\n1 1 1 1 1\n1 1 1 2 1\n9 9 9 9 1\n1 1 1 9 1\n1 9 1 1 1\n1 9 9 9 9\n1 2 3 4 5\n2 3 4 5 6\n3 4 5 6 7\n4 5 6 7 8\n9 6 7 8 9\n-5 9 -7 9 -5\n6 0 7 0 5\nS S S S S\n",
        "output": "32\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/rockclimbing"
    },
    {
        "id": 680,
        "task_id": 4238,
        "test_case_id": 5,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "84541068614413651176687085977592280947096737540914066303434904014012518865117241393731892001966466795329507821314483681499781968709528409477647190873323453115721690047493916292895264812805469269138540786977462276657678105380772424205639930398138656685401133087813629696752490425520303853085428632583632569588803239369123839145402492523364039644325431082016207277504360778367189581740616805375317340850543319215050010725715835037448459702398447104144140955687640317730826237040225815773529131947908393249916406237754677775005438980848005933206734117306271520651209228320146406301261670539022669463583270808876842398466052907159198055439663805963458586340846735576115578717794484917551812558404443750867572034962764040470525028526867962347838937746364405540767653297581725557583730637589518744039025111469888463053824694746797475929112609644999728827879105150631553885644282809930354634288691204630495231230192103540374593834552314949134146309062212004312018982620927025870781586030790222251530080721878510483648480288402947054934029314263526417231654555800138831312855186906162043237269715809672033419993453192812722712995339391865354024562221663311737266432491246197283069259684518889099868022778404395341946088367824673685556931847537878897816645148623056961352631176846532746842446552044797706936069455508147097548238140507305538436658198749806371155872579844657028692762333369685031458465161682285050708572066104075836719734780231600292380736232203101182014306512933865492419059534564225287772088009710938605053377265937229863526392666072264861368542602505092927849717351434396333244803303602387543702878106489939968521230237652516239357931202003410263654642895487100989987411506792121241294430628548097956184164438440984996377472988763804993006117962711869651374201692887606068056059150066112333201922445531233750668740455906237771945910954720290371650710151786780270255054200342392655226603198933863427045153652391907961918846625241459252088418780071589141016997781645104437069331716993285992847603298759283136342022714291088091980829537402372251965663058565423105277545705503865542450792160717014878802174418386896128169632059882776100367151384048919931377266093240556258901152749889913890784057235283621345395759255725190567533836893341328200099265813561702423829810465939108502196679687367996337488223309959776506604520092847434368420781914471220461171249482481261942611857734145905954028240077125012029063607948903202998325580665374629934291094990262055100749472766134923649096382191557650229220005736396368550500243488017203816495333898341436896370755241861778957245192839872412539055558138603679815684389072614207352260956428150243452410991739328441414469142953063639697868528698373063590702312245097468780994128438114399293243683532478246905723549993521108424636893159113837793675175951612040124123732999783258834370875221127468142908304156394429107446653094572015510357575101672250517529067795635254828813801639832217763261601671409356206710008635353362311649047914798836007828289308185397514356795087651094471191541362852248769946284234786594152677269186648397772676055625653452900856194737294549171453649570547301448864133753218740674854085543692752087669332911915775844718302204456338970170383902026295792966421933699591140014985859629656228127188464755559931163036353577529124192362926445712254391907865493877431968259084767500808529338806520928687465937180606680128056968711400279531529064735905806194837946766322952535357944015299496263235642102842114350220112202287829570605327779949852985969655486888404493620116172546364529149301712549752821529326094965301656869762935621113753659832098567644054495886570140012812822834803945148838620728038369380584919915851474368612132680200821894228831391091154481697840548698877614416595691780989928290968488531822727844596664958393544656756019164615573434649731014534079725953064050100516543777890851429454038507093630560194725939142120841335126950880270065088088631460965890524761818839222590592125886712659529683572424848703941906088776093470510389566014144046962995562581140478489299223961017581024905796637532896500969461235036475085061988529162998421709432973380301016360821334444499205630288554073594942546706970345430531260670813078696756270587639133003632141833283716621171374391623087684947140954412820642718339270137350119562233990073467540843172104569232471793442309614149527343854436642656412002373674228596071345872198829790111340122392429964881042923422367722332383737801101556239163771126224209828095498418722929956616340486436115510673003083665255017434397881594340215808461639617608520112982654173212892568596158607009479223867855081137813255176260521644711126414749525507556412583630950415551662427197929698163118619706755052777073177345814915564768287281823019468317823931511843538610922700143465836739998395768523642775984677313273428601947450109938282869926543733408649061405649712900294094494599032963761076145513610883045985685347835240879824241423809775644511526067232710268727317848149568686475263457593212880139164414379905956713121539972443613763317010940690545683759929058670186129497698120969106771281445176887710763800242420009915624519827732726544952696951735569941983135571799885564851592410571977601530639401332342195129916525692510855831170546080454198604280055868242160869434013508467048314760005227731881088074236252934164868011540658518777971817182741816424663141209885481637630528644374903206925597443735424039599604134859534285470928294998753900083492477963793079888389781038654843098985308028663501563792296571008326653972865906191843098004311627586588857980869236090279287234913568368915659728456412657051552762433071182453422922898793726841996893026769354953818174355348859845137969648737314515380316004545031080669885687709383546110478443328898885771142829625786009920948642562156385479743054124596615172136916967886454201879826890176965996758123859039660457685782723590338889046345789751872514055138582479258610158611460875884326121809940395346051558520366204480071068041116445251739149743108395156328616293705141833147313835671341404379577928531149227107152786443809858136946141053981916236254699161342094013042080957698708380487165860224870014819287417763919988979906123606377841114668899395330671212385075755327629251615067584838926786101922968961220036829521233937764225292808745822366196774683075653487119106649658592921482068951252713281819538615790944112547597999378644939822822223429725609006314155943921879151448548882707112624109330552769385311859926974073617627361452186693284701014245268341298525176885419736042772515381818806604120255969783085742263621010489711513913225632993189736707911124977518445409246997340504492417272336642624619618935989307052017850659046255792784352767757919020346378915535400643812601730756256416087112136229600090332487265189062082858327851198277224834017336446187503113654871700257928186011748876679353439480738095275067235781105211811467571242810874309401263454963253121526735127956383369997413778286140212496843512979708834413026252527557060438258263642004736767395861200638283410262947977801312700027787668868522360371548763910253082995869714990675277843940513408755289339427799760187141786862367109685582064567127081949709228246331145553755126430223002647123893288098359740139703226429926888488248157206869887006966754475337669415019465129964750732085414548412473472418724862256154538624998501063079149882431988284682870544048433396705201465490971087528026079965923884697813720670364336161658955218866073560499213810736666917174443841642346449118638455358030248490032316808931501423246609631152105002404691609778085716230406869475977456048819385481013013146875103626216729529999545997517135987559543992483739449074815557739719790560336061425834232621565310917410279865047637911102899118661221752757617872637132959625442633919436462704592922895643767760417652807051474163890458444940708782058699909555906307963196373387016847345308861178243667598268469456492153770669168330731371156264870956590113974600516139444489038551299272333631069765583990661275459459695989730507648633642272907833743624624459865173765899195621490197282965532064017180988103611069853279015227813799675163828977454965788066266990285032053468030701056128842769163665160389454881739657621900713083449401693660881264566795679390141217413342858419928429547066845494770514979408418180712453571564900464380184116541654320897650763404168361653794853151475089763231081840824070330798049997198367582988676272075665696193492911691183334167490722699016677217642754001061767796010719275192977770680162991002162541088981069459382669906779899607388375376911502164160579089564681024532977785553321713212540251888901174467152599536450512490689149582284079096287513203683758461626412798979523799420400272701086901670658743642675250353506971025769009847424318705188967944858223952103565485891251413052477333678594502755603221140564543010390633704248554160018571007132682796870515796325694986775332901437757951946964187382010709400866316417744679928425280778463762908715931593450611662222333521958513585515076324241046150617768554616398769528966095400467903593815648878143053725527965496001442690632884332694867052169402743690199726674105802259595919759369541039558865490715117424492909923358239325336177373715725647067844391547663237849572941356114625809416524090318381805782249903114210265643286251092195268534248920850425716179981586802383714453256945003745787767340893780569048738390234560566619564523198467386291001021949459805633915485227496103636884277936958515743151015130188971823745962463949040753496397464522615826560457582788249249980025235969047092779912725685268035324787939745836362319559535480086989436952568152474192553498510946398190338039980513289259086760373365140579774983818791739480245531497589021382230149419899916514559410089886740348456006222336879774902985634748994507077534320008576927291702238071874444287738784099335386579389292092345627841228310908407291097728591607614584551887869353100105076037357636226342789712865323342679305886209637947535124798936298141841233102088204134589126250396072337486425676751882607333797242526279825108739331740655662758051372300981307820982540692302750937201907701277779715610007251918269916256385168139304308665157483749977513906834047137750196598207863561405438900373339893268981069395371121849243100762161967973069618597657063746736291876418534160345482051613013134100602757934448467027523803448179833402474190122027291355661682227940286347299664188036510807243648962063753123457280482614963541877368076314310575481400426652461317746862011608669940645695709658579814138723828733304401147783343896977008293854533989873291380892181275568423556312967757750709719542647048351445914322599218917235878715623149906622486636880601795644618426872980975537023807451585224460604007367835014236331747448159482941512609653834065648653535569010085268325855229554032934895280932329571079770274309327371640150449305240885436812353067746088493259414783178290259178008350407541095826653811530600164780237526718154195287080027584613258106245133114574368274526881131554309043142013345110578546814274384585399284062607010860485949567887471440076240696698674511248825219621438743985934490582077327034375292987452085529359157971130346755418765166800623374643751406392280916254914339550149930753884166892875801140190510062001815113108803843019456045557796700207804746669050809333950487409224156713273563826099331767962718068820841094392971358638636249894930813911523540406981429700263599226721325742588722580237036048457412545994861754178322018716134196475980780781775423027066957797267196137376105017954676555902306426777755909759012472282127922320209970891521531648220912408498150441026071043469710187075494395167676222156973151353944225656723272789852038379089979165971639373670998510518628780899090908095387991739832778307630368992023703348406867873087921397438205701714959984162925849180346631420936188598312134834043259731395152310418371312501140329026141834626520441078361095887223654091656727424439058781336261376959212283572334042519094094660799108889834728615620191644168014756090316282174697038489827037838927883694334498708104216349107332612953363941722040491287858071496935653011343335460012981757473796304282885562074528304918750485063374460564412434472549982680308980913278121853502081100765978704477284621006516701521630211284904008236306717238768726699238964727859311542401139103391295196795488676477732676430703175279065273856919246435817093680263863712869597542899964722334799176505084802964677657868972034871475508472066938604701421800350822056374637251306689612701433566564057876895559835053182713273375131142013972025862886640150582023660971518575345474902192858282667465365482302389245512515137266769223604746340615312559993690643191265623149370427427469201324224999827955234621449103611896158832345427032577430715461561160588741227183083857240199172345453412038475548482209889475509674095776843379544026887858508033008056849860521108988765030603611933337993343343975550724430658526856762470176787129874064073836300308766720331516223228753326981772708191025302930734887835425397924843474331857939050827066528787072346907424254522281903024805149690111177039705005577263597521231811018805521654582904551427761643045274972046979152206154656787569204439947895900424890915092207402001052268295134527825686159120972345345722735940788412595316109191333502328588486974990255177809888760110366310168429906903203554685584460510835002823015206248160456141270219277258015551996075036350595463783708543145773422811353990254355705547745269552679379793427360972870353232624434260246974508899928706309923583925065896927320095527381942560265205773170450131793402659881094753008844284117701337061121407387930927341862671530688324559799913726748255632885640173589295970518254313594716686566370813004267327410639833661450100803271984746789691815349566207090099898575282334833038147672786314887698266636262212698165797822856000360971665437242770055770307521935595959462570984530127258238186294148802105223788799148978119136773135522002525894439019024372025024941790077385731151224458098258292188294677196483960666988610507322536988987383612239689233854403691092839601041869256115033108847866695604458929269536377409139690825786532042344120470422180295474264634537826768847667120005957088711934562373362824098979908798772676378320628212499237542446238693875798719788200696972594100129315170354299302080848720862002822951308457881948299131232668475698657082247866283351111663544950433757892742379947488739087163127182934357577237934321796794892627189497440521830687924866020301711669648334785909084883428152732252169431638371439762736853846546200807566997058164961056629464933864203656402140470416962509700636530611403641318701282597253596565457588804748237726036382448615156685238613833635007559100569667482117187390659735280888629989838446164234342206130204259351729436428076793421613604883137579686094883584566875457497807171888876834634160700685194090004220593173223896482812693091577622654125185095392055869761703469996638145400098223515159487699536234042040209666475265192375146387139076668375756149648636303468706561490067076245394981555074205125095589888022197606182435020010881856211188535079452940794648231239857129434563193474832399542387550026504447100661331261402970580825124480949122747669976150618685504548235805578245126374021365085384058255398661752043580976777552024556385004425128195069380176140747175277774095572840288282833505955975015067108922244554560864395988199596999418966579987504538070853703874701103700601684131932015927868772607063413352145181670108673466828801349404987731409811690125452719737388832311025562409361104320177564864517338225990536030670816363159487675494229354806401436436518252821466729129183321853353929799851432697267295374825180020305005681254225968825987396301740075657977634864217253553042729080285820319390687549032920374892148046002644750842542224902168555605604460581775414696963744523670261183260468402533067929540620202771686537225624430543270013044058311001969854847397354771680959032128380385081830263615833738650423304152138977743502716486778533160889901123535364902765524878533321128990149216801373255814624295803606385353606849968882715190454584121915179911284416106645761200988743547821626063820982450907349761355551138088680515774433180042002040449780650845214128039850584352170182824909395485401661698043521245597825026908243980374775771565971477442171414405135548709393483165617602145663500940917999169867243979150382524705402726243285284992562207751364526822604014856934425359816595619804447234397570376330831445070072620854175912572544734615204069428505927723901915359096001239380026172344382847751451625275236464834045954086882179658971204179969211470637463962984633234693627615018853512703415321194145591805746600903744531681623084799047294564934998680199134747923338996727826438348518277382895532524619362540644447869769211358609749916059738931103513028881300131011872081764853958035416427594584555715901549209002282335280384371939361726158109103435812597571317083447443921765621979166429462254318643597748919576725430277692571586540359374663319973764414380812032403872916000078549058480802375711933273858185773606519342391486115704162275688573530054266267937397959110662142215020841866248325569933031228255296818892992188877451152780504183743565696938425358787713098662110335601364184453111272528976847860322519930379393342742804882507999024229117152066170350077160704919042466252867878302749987721384328345153019200438309804599164743658765484594953120737345696411275683347978005188420582064122219277302102289510175558705493736656963352708224170312206156233192088897612137787646333662637328317447225806231141526842807765755272122633781653408462106156965186840872284967300147705801096402659683699453113738339748738756906040193573610005925058840022107809775979430194340373248186190444883330932367922390198055295018206011808932174196363808977661166088596558663167992598775064754600465919116405481523586530356985245231297637267979221960355529458511510811418773783309212185455706845719970652202293026913888750831000924972377231094714364065827658285781705192415351112011394714275187831728093165969028962809577884861879295930002835794740373019241973511344126292958315016830371587261198951614091986919014936290681573789514053514338562445916563696378952068382120805398797868310418928889146734179010917842103534265462806228965427367824895106941664699384866894555642087280106291288371357704628038074509303577953067433622064985884319885940469242729001163274779929945646305868823877142110824882881092655144001175417223206291119064118245975709802903153796229885437536232822870681720775471714733912581845078157538679873767902777109460067237287271710122933670987410652872687165137965373140090039741629359506389321310169879801894624906695301440105794726415239576799427008861067801935599251543298113147695699720760086304054195979450181940312791201436265647974208164548834945108605737316649191814596614544100867561101221794779245157120105216418282448511854465976286910218670165965703864327666894041742524945523493097251467154317602320026651235983022871196958939541312973213790304358410513225417212946813252426018712534780547021027064774541778372693461758870156669387109156515819494959506842851774096412809662346052179001971868108996762785430171288348268510136117625123584606707187460511059349696813919675059949884580888903971692035895324163591005052129890408974002962564010074033451144732549906512602247294877332233870490844318661474445335924730561387970219260935585098456311574165665804508052500573382070915583445920624433961934369212129689369735706458783950296583514821610219064011611061787050459488832940537510587306237528727520884473158357971417205216175622660972332506602031708204238836287074734754306819172205187006287388414404896502745263665083734177234014606560568437365776364364993520493460581440711982999905006873147653807582360416163441348242562169792214744422278890545675042294342801280887622486101921808585080139234261880717663504762149360460142095454929250370853231522632333255820160898225278629342083814716352924740771291949332252318184898453405023022086089958037370356458846710955186126605957591533666907443683166235647234301453545246142052933153451463178548146196081295290986848757121677515863524406905579894777854415563053040657543103477199569192222498409324519204124706821930887126553395151309505183822208603880058985243741243260283858233959949789315216450358796405155380491310261072431994525358934709949105394861026575748108600932655305551941730028956229455849337531795814085300870252117728258754018142604041528996320828600338546597425083891846492960627221523857476081198601665816955165276621152458759126972112852044450283939718508196941910859662205468058009802655166984543392851895398475805472873703484777161538117229617404315030288738445601982864273860328315925171970218907729738448050664747741730628611459957407769390095163321491269465970261321784774744056217942887261084927399732162434040342565544914152037142337039646302129665330097830237106486946616179744492916758332969243283833646628119957263073715342905747528965760953661726408960242550953259810537006513176607194226976787193152625143764053666310644842239403611472013130533274744128703042535467232514334190414564654927214825468330634594495335983896611321001629889613741762587958021601305199937547102112366751870767482785933192160838861885462320991303266072205241925271284901576214959421974105426561336857907644337470215428988866168838083062236937133549143221596707231155006420091735515081672092155997422462954977835587416147608243988876956799720871380748902524898217980402851008015995166538128933819028149415563023171389957918363570077033013321688190963877853245383975180739064855421485262051973544976662141332792524686345186938138275585575314679710973022693133139155094170182433563264545516168221322390977683042800652096644217914001809962564174752887635902418780461646113739161805753424051794938884309008206041361491141523620564848070018695208477087770570467125579906179659646629988870847781282194734767622080056391785875866207608279649681214669414786851761651191979911843294109638179621079756680888425128014487279174181368824005469606736828365699694357518727643583584800931195900277061202868333170269433509323804061709300409291368826886857901633279017071655677660870754911909779098189712576456144355279662921289473921225680728127324587959089013731547363899059844109512930479287269419318770094293544439814622771607757679066049906572215020937322269012020390022205455395052200930298890043691399411884107230771975217841744038340560891808075839150600965350870242657835141821517989718001137067949313040893465762249651227551588631334000648162907730986821292030366929636706537306352938662921080845114788264056295302717041734169851323754777572180651987154478983404135983314198713088821285486657142334255707352139417472570307407751879451915358313533389557760308450870996900311452397319565703034911956029047954584389771578337942568831353832064266505249401947881766620584123975345798822013842486953925308173270754529340280125288269840038615110037886802321298571599394062553583406958451076085606562467533619565405210315381495991537172295895608211085251984828389979342143939482829123760166335709039959165115493421668234481934633811540354904355440700155566734356621855170409958141178437926112835329015869653923432906443873148821402323335318226586431241079469148077586155408265557650419311071187446942977040083316270636538936206158963164813318055713511222576519552514343178367737377693097446759953163870537654538295118749642213293240617796434969408218403013710253129597156397483104152015168169631114553484093108125539094602746407015308350107134962943659236502200292965774159945842374717801082741416388460033941470480111280915972096947280734370937304056347385509553626397338978683465595878360090680286584654027768379746851938958202727737896637328298852035307772838760803483631844078950889076258529266365717340383797525970066166319315431689389324355588411057965167368013114391358928252324755285259023694797627883445578517315377480638435696169210603037260895944213010025375993774950794076321913320884000423106184332547813568025332551630403968768339323779228832839889514418094037548551940071108363635478082613086575387479931942587543337949299240615451103158297982428176248888774010068082944360348454428912928515252058404577878856630102422423857125703125110302164397924985130764802966579132220082091551148919770969060656511261180734339184759454345766264450844410691934911631016173971859807943150441243241166425590015382744011511264801447177220890994721584029785791795516794184070044922607283741489171304040175164245101532723184829949931172205049723100082449872550350947524151156306216674373505215666579591838697738803151061379281713047983633480060324967205407841696797613233595743756055421154883497646582820307002369386123475124670638714911566136063305235711177553774603063598403630661170194322667610969067941491677865264387964413231361525218541280184209586355954508437244662641314589306212791358733782602607998998720896729579070076073742753885415904456108198381567344785082033908908776626497080928409395560171749108197688710040219082295166656230762604321345323957158065473756485644000916940740325883252846828447083549584126466908132121177577814856581236775664113251102023692792330173478899188488933337638737688431936811114298446346232430958828666045249546114299126784945380325026553777125796249177237557994626886663797739182821219404792126359705721074195400053232239018311736087033119544324005375412253826614982884833878630660929562315013240490574777501736700008656446686756585960733842613359320286218174437817208914610178381916810564094714588162185550135920213227078631127310883158581596162510094254213858381610433241105132311940741958551113559689984084599749655866519143858833894758822151716078954379879404058573603539524126732187255454459382393107773222755833149948824621665556660797084715388260864162991951673938286158580585473227233221527247146400074656955092654179492076287411986108684757356627050270263305230507089372172604946390230292772346099081496643015836861746770614634133992405766659995954189425701230046283918399429813179631129369965962732820326586485964142746761220565888393753494036841630026587543027769906334302880797694927076232027192495423973118877801681258432933881141883362818508450266086096408462056421327922371412082702572117892987735662567622311750798495291495047756027480212759097914820459397227588023237635794440338457606493319387254134554270412690771525038727074259058524194190233018843792135896303125571496435329349990766831023677634656563124001701689016953367607931513242835994543232792223810492667523196949018742305026093167887391052102354643120010707112325706989546863465908536750761591676394437379293342272926787596013207527153900139152891173128589390992608956787367252001895353837762515087008277529154771583826420913533074614563520844131949843747462495444861246911561195873431723503998485739859600939374266874524282696842829604685998313284485734142208057685544837873319325503748146642627462354425042661045442658916380530670312483374034016816449899583949662535170101107490562395775416085448629872673632390317064906761326434643976076104545256615153254421113398841152611814438735826339754485633817726337298938529702008189486538483838398791699024789079043424331822023811866242296915293856687987221211492867059924232276077699767103779730234163495435043305242024872849713370859323037616255675120086339518573943974694876481689083168388268172124234025934978431876092805386521177339830289799665487589293642487011467287192397762766205899221296282714464523091306437059073752570019053057889328730553944312017011691891403013401612272124541563221392282930870653847961241373202767271263295056521786572719438997366853831964145960503870078552272307874446325381806774671446958255580119180796968674416202312993531500322655572826884725751690358202381637204850080765921489699543517967252898953975108513933119409549674112801319459253531584513842317375273037352905363304789859135804297808590678028130644775594281442389174966536209556760121779047773968651199615063757688936524114930867072979103075912345985551020095167383455319412042401950547576983090369360101736724938304115356078341353473824115929009397919625083954951033898897624792947632610456670451325680248867394898711515462129575099278508854806454679287152468837390855378227259207190124235766054579281538385960820556591896806521061992422116196705423438033713157081394029439586553277369291238464980638165683271244566525490984668458717011546132761132650951342635166490087464822595740165839394749775014527996976785199749277242428762124883467975632899124048491406667926011646016962630682903940878647877412184496321230265874278832400320567825355462614242607707815564372061825650173542097094974897934366852137199722412459608945725445791693539153620655459276246815047925033811723479364219807868440113857395547635126825430794690124034620151402775876783795677170558763480865742506189796091612628345622900834409604838408896619674815380582114617245590998880172450555064712546675041479942828164204599721735627783986015027308704242009326053338870318462531691222160798515374126848459089071716756718453870184493552629463073278940308809253037824410102313452823399259863475495741599797835918514266240135520838545507548134446589624534479315419008938727040308121979322991968439450858722058713362144951003562813191595047139183231672012228348139652738979278589204864264859050737591347450185504873903610040242143639465121925529745446760938758215560795054104209388721035472605628723837700864252553410489563269512622591954605909982926245134362199672082605099811934618068646989618035057704178723937518019055963558272666686923605172383872425327909259820984765812836020689936218498547688384412905111808373045392662503530176357118731007864737133761785020292930854576013643554319280124704954305110103732954845445352349770216340880229013442264338829694825703121580092540741069533388838654415172312372232093582172992631886250320375836606409207400491983886825766828258199624340599641399400699339038795679574401908720656852875700821390690153579457606822949870688737216316279542267915949988903818560921431715367680477085916466548244399744457044010410075851022298459700966795255768174330239212164787615019542799883783477911780034356084562981702376815749156521895025943286251515739179937378963549837262103345927567952471770164081188612283381304607853190464762771044162937905816663151708540999511322752351082274017915294032780263270722401207211374878213940985640218029424019144115242268157782305212104192398674444813628506901864184504328229656948342202281465746141094030437633885149306795936086576873509331188509199623711782630709353970171907409421175909667231256111903967413887136949474836601481230591600926371627533442869633276126815617557663855527579826959579149428358567395153815598192617034743043175824087635430095722070759367615876172765082052806361471439380367511680524530765218492065447367679777102308058500974605422780276354309117598199696826483181969933193826753637648541068061643694596785724765401149806824000063724468787910198537673713415192082468315189702832508713328385694203002838636798397447427352389154579709032262442998239146546064726639155038063994712321661807236322508703979743979958445253402911588187036317690992624866311484101709311037891074259176787479468559967059969008002128066231685209739201944362691012440654758001221470778326739928468144644009693178477307438873348806649623376876158922311196246273534657425073651540570010439040735859022377007343336806894754303665639586171677043414591123820167187952079532850487336114427691075542600447446554609571688656872863646240356068156567284855004808601182157802150978668021704446800823429970383974263646575089111376650509069820301477417087819421191406909448186620502101288284802551411244170709488088529903497557982288043220937105621786418335578918583029602321014680862036646543305498604940158757217617399201581483756065084864798856355716498144288392336150040954161629859981057587906265438078365182238392547264464622139200908474057304605261652431829812946554791232155317743465545858891361117898105376826623670904663988816390518214406014470374792521735065204221728755865842628639707074687219433226409474941907444085807444666043931899203230662615765015199727559203887943966372622596863814481003397317979700916712001527830907968714279873196738487895341920015179827141034517097284893386199881338255783278582028792680567060025960408300809877235105616062260835824536576293739355992271391110170713594227730518313174831239198687035276218351933581746364726112856448656808190371136618372119468497253957466228973895831583193316463495179654883148618185406753554493147619161280847239230679667033315427454377088761157062691768970523847081419203774841559718030724025749304380564250430990833732417169020525048522741348582227306721472965379633067884419529320866037718149098662714633154361274959293810053946263160084081211784157116080102545540255341567006780578306971983027588855482743404206163275707826831433409591457727761746290918910449133891069836164554411519923086454810435259987762887985669503276275073386716765085361137074963450142951921626326767400369735434968379867310983865399231701240532976452182728186131833584266088335230362003441053832102049829441759866176291706950574796445561916020891391441779985844002340864306576869580659357602011608821189896191551328883358072060319608791405941174334155734309121812267579921364145637199631336055799678544028615289847545364167856530791372222878462038628633110260865272679179182259364213856516115311438103596173502916941472204338131902538767405646546984608926297420504830571029586285129593987085333890394409242500697541196420579969866700295804685389771953522638639491735487197035287047210294982154698221030874214948470390323555873974451090119338367329670302353834891519028653370547456639101311351751750503418495748835320395681001898869194417640059222194336137943427982489329633427886081208871410112236442204405766691792135903982640481951477283532823147741885170651761843395934239998642924975550505997821780036247348681251889213324119385814368011824637138874511931754053136880798853165428754583064977212178902146811233652874181370668423030821797621919834550240901563281699142907193101230596459152351223292888250955261153096778051811982760513078596816481901453805482498757787188891399928658271785468661942643583948352237175673119126112355970327818329764660081814050249553560325130588902999470155542604958163897843012611420466645513721617767099977067920538146783446332838921901835891134553280432516359893154792694445690592761196603778846992829963402093943699761337137459626613570430089722179728445664457578151004599266882580652414955078629696032060178575431465895932592671223117126870009785103564447658808140306217597929183667215153492357840982505252480907508733425122860494609326297387167812807702092553532857023355480177128687950653886767965672767184747646342500925760155694010136281017615536477492155678998101675027996498912544800917538844286625975269738275272502056969546683612557221029103588366888047624988232944261495248108595777861703420160911361349495168424156314455047728508010409177726126628416399974999277383072753930968617843177342483745157523706999407626050566904493535333082301839707527582772107954494524719586697746873023296295195262972941890556010923101292156200065851983317980072618312432995521575485103659020265872349419852098243723948236447144293281655276447000018673963087467174567035875946213714657536693989839892440268355161611500738889107863025512753212849706890994437721465976150896151496276641289709940255697914544340906204944519595439620624885062845262468041415970530546890608507637630235067128541552796516334290697748561911487876497888272884404167699056002105740041081251119203127085879022983745563229906011730259959880000954005925344454637275547115364916106266872618805505869639680662948177233194104773793278958852075689922751918620031497489189825654371474678289272524427827928232540567959738646865270993695897744521030417301322810808404401532634751939614236014436542575733062676173944685082620955030309041147233534180755954842006488589838084242768130476750957362077058264967309467221446995483332522791152726891556390199103702484979599376139230132425539260048767330684145716279048194552352810608800931847681077769887378971572878657136873951961984857702984626361234528927223111551731665750254416150594564164782830126031108566911692928943497748312687704486429421015872347597255245918894399013833537471122186335675772937838506954192640481469298315492475197595721679599664803244439789461992159631069417632863862150168971492171354245350923172437132630442115456439826791062669293308625856215868726607971094590450368225895645305611674363883454336612766662338713504480752419391851183375359865990147298374709235461556210476929338233686143122455117316526308171996615265894278580995076173758752466196968557219367881360365880501578546055660075216538581785007459865763368332760592633560785230826774589630139726697373227767419314611642458798910314658561470449757693405459892675632907622403569070527265368813340800652667309983552948934659477537714858609816606470822357286473869346715902850598749071208601932907252504768565075093977855495534805031396835882325030233568872886550598895380757709114169118588156896944609540940651666760802393335741171087037432336586813652531173498880257063143187785887405416467742012731687371909845407912534836557050089839678732856417965143665143129461740287229882895354929912860739432342144766499852145614257082063111946048981010328637604518041036847282802967432686110193101505325201356069164660045384613276792398989525294620616600714509338480313284883465717302987878124417755560998746063715927145387186030115613099452025272148785894942221237325362503506147485937407177327989380005974406137329292259330300803756380177999849709442601235792860333272082168214464986220833725882926645634397898181580428169417012914903067412556906518669123780835706634367351775975148263532041526410530570291210286804968988988446026227924355840677454664405920871627324856114406922650161256671645040296357755070453575919403551172359581653246757345912212715521146441561591651257236810511379460799498698622427440936123875511128501321585543883814733596012901714962009726645917468621796291082093587654531258818202315167837842144209021752966741819477761210142517579142582524215652685138175086671304976681925615158245988970139064971125857873241587892860990138865862135819255447606674137641424159047358311052048713520457021772526852245030230040955867566604969990662296822776831198123203559969327922180502132273475766335259524268953163742771166590573732730078981400367034372053680092692814381957499109825155896416126852454321421241739463924332702092097121318500982247050257444436117443613870653423931865550574905764150068579028010914713939737223333182411583808240126564930088616733431866786525826368401445840525992888862950268109966708610357507923078678710781440564699479631442340575295261733156865232534953324109913311891473027369684108086332066716961534247100893777244864839041216349642868541787245483944971074712152946514156305173073104941044606955763097154563132198650879547849403340844193125814090143779974005494881105222095846876750036508002280079398605559157129944789185378072224744565804083572775730728237930908050616948306661846750219669247148103258757201914761255927592187230568411545820817976454208941017739194719880304503900315547161035388048860861503432006504034526880372080017181581576682336355619605232473317515645834604360329815661639641919482836718898780008229532134450606405959983695384858079495459708696655785971010637141902747991971856145604811007539837806217774508968605031646773084974953840799255006843223332233083401363486508765045283706021777099692163147705852343646140350282306252588528605400619310139015439564072020537091603737412186265919497819923799134412946829303135273163815918104645348030511782983171798354514444518906015487110687142250899087401984576645354049146449320064350106586113576164549528939176762945782308345537514800760808222357239125959748141405795454448354042729113384119555777758243177105301572994457448225785829843306988734610055703670739299005833612973397050474053736616701347002707377888595993755614359513486612389389147892863922395755044962547557845200533498336890347610081855931426977807087652893136266871527525172573388833415224075417195219658857318006529747953103260274163371753207166259360617073733325042867279731664787149823042935202721559450568982808360024248460528282728431780261107837444040220266454130299365169231095568966818005235203525541882860797222479983320616263685057444434841745137442469693572556052371243382126153809299965889434703471817554534796157837802944800158104924432064341095982984171140671745524433959505695832282097160370210800406433933610870010622055952232285991705810241881830627041304108508293501047663607426968438367135025951030947224505911357041702606149480267965296087530340219357088550756981607761865801043189004807006765976641494306117391192097585479665375272765894797354986383986994163657308869481964512605149767783029519747932550825848652183241026917853040159342369735967078056296667719436914013202828398135390134132672721236959265098525798994523646695602629861702521041589397991018658215526688430522992991675451823541058867470605866746858389850315483891823863396493567502946813872263648870844237194516003930174585138967587400773164992607807106512086656608912350130445344937905774432242784080562447018791665932746615502876064277434635851364728759157267855100867943500051967933412056462506423913939816589794943017670565175823834604338641764381167707914276722510386571697746430500369705869867661671828643296816592605789508358152549216471060799116818335216029702819974691254066836529834910280238103866062484558954922759896185559534279600755602133181592031766518938866282423697225119716482504450062126647610599747110479000514231216834744392335207917524146683445539696141402124128365217703133653671596477637527030785354589876868353234383713428202086806782903462875381438040661951810766164877648142698446208486363945929174806721327429944212960436053927181470555092874947928315746366451473723903751603892025572075130731857928298280926755394304095883696167328526122540571246578725330452031830736373882996328271128779269503184701269787282441987129258323095119448878852828106665424696592687146344179900567196461878863934395009358775262534717321962517109602985525210044476705581139622138784486921894158824226087731396369454416750895056234465690032178452414457880592447925805512198860724552666230147694446869799380049620121568331014787463286494658423675149174156515639395170613204672952583238712214909602898793930478129406551093601079179344238595264626712026149039494729703967512852917321449848998469365812994425749320808136569491406045619194938360255540762173868505733763664182284392210637276389309448575395796678764593890053238647553783652205397346842865956351485542732846646399003774475868872152148109778350937650310690483908784189000682065837965008877906477270942994848138117788009920500282204595299760840436076619307344385745232134620845649178385140864206543105320738772562964203967216429463540376819261413258072172583777821449080216555314606077719101902543707356209627199872834133147228089927519104175518743483374711850631385547954779542406385481375597872722147422559896410094803905111197231144640951533461753344537787664741812067058238725390444157786562300329274621513863030260787205420139472303028777928652272502688450326426713707176803340876954065212825641018683384900137775137493399300487753835911890798026861161505860569915719137526363081813456862903774429356146011543047051587393404808565431363778743847306691252091029154472744203824279654542706241170675924985991341833410001708757359601403638106299051202475152035146125265771843442017370510953482518290632005565399104933069812533348884210474173814513984688450743162515266346894258791891270178386449131311123497735704320521309445157053911693493254643993769883329856780788233634535080783414661032709017308786866082846476392221076104159717564693548847576439938695672214642858768850643774975097687980974470299751523866680355305941087015722282014519541778713327611588406059507903538456485828529999200602784176073799793125252834248079815473569234219688444306731934387348373162229396306984356978316195881871575861072386493506650096795094094874077206116158500605581709176284445968252846030303608853078864754513132286862904881213417736388732379364477084924603335154631195656673907557229785506634361423412620785495176030246088600153547014521276125835418645508200146601808029458454878691338793889038955006142864681456072527052398255186900373775141401304704869835984124050604394776921766990591025138214914830678431611141664028664478471298262858948956947390385477172393365878167205965981659805694701377629010162271380274061211142616833576449099695576040331349454399287936405718595632479494417378295063273587769085894965943234413038158137892164520631638486566588319557847963631049014867481082368087153256982645860830357551904559090710710072095747788237314995273279654944713990170790045810965202177986138322014117063397923938296964127875205312931773430998285010732337425432378981860626135742404966283086630647333657024093655050526807481349643414041553203449083999529702657984046315242934974814206418149353754371221407792237055867040991251718837990107141716413339232455025040959703432985042394195869697480821223028730425448466060713422295701939973110812799383396466492460569854916279059199365306103718998783506030208601594369303510316793060896064807433566823989562568835107547547922759590003548683473787902763827470871492527103254047090407560362154756729188523343685590208818983205293039240977531947125600963815264431122806555399909454151405973051185554702776190721695123602068026060588342682298795631812199810153290872362767075339447458732554590518280035149774266730902896190063162952498017325621322282535787214427820041075509178352521858596141517030753906141953342723418880487202749702403928442585805665231368507874316930409924349901705010877954842899712877036984781733606967666131153238449813361995909271955484234549349358404310876128168934604134995050446874524468246510990997754296413268885925758354678378452319744312147166699948595952293227375303483713992991054947837603201895600488633629854656667364748930588962823537622642899498480988104123764493202628401960178499034265059115855955554270195440718358300708904981589614786577602164160196755341920064453490664447139041125452883975799378802106021524749326144458588563753220611310154284662044178399405633145978022967224238811058486074277550174673487751388985831669407709054517505042150750323645208566557783613805456807370053463858529630318497505271171833319817258946241111015552170087163003958435882816748500020842663994436534638741079896797692179358307780194802556056886218020800739310925871021429738253743136502073684106466061791471097075416979413866871364711550955492706110816552924521415067783269617103021235265327941969674627640771149979487197694385946630423588863851186112237956596797299534773043611733892285914537701766713564669594004092318640975715274684358850897018296737535659001484355575895885484076086993191030058676530360668632053824773931170595371131958868111421900191046005831739089431269751167773326206407380790877028067474936664943778863120944324172470004645662278702252473035380167627178981299728155957974146407525576638786747739967930692679472563261230841008934471207312119157948992403472954161271347152425535169675174191273892772348757892417627545504054721936463240456387848771116759202951890937519400217569277643643685504642718947341714408940013660221133795944741877310719650957770473971206428761477319094885543887797568626645193411982114373003883681946683735237819232752177542635831733916446201789657333693249062289331652526961884679641748526709942617856385339217742042603547244893653311177321519009740898068558142281037550088436983973094921558714127899183897726032922667251122349460745151976041318339621971079525671666754287209652190495917625805486501614360085655090264196568079138975324339780663369110612313924315158324356301160272219877108776597463966811342778673306387304333679082071724215742352850848619576430529351544776229586918498396946021804073868095179755771804584482443289100558375774494379992882750024298685896150622120998439017422329872722384713925714248091804525550877949987026272382183018551823131359162103596700843589607694947618064880599438083306311102728330554444553194446611988838619631671878526001389683071968051337727677830433057147112162988180761042264180285409433827161246297382193378361721329657964913566760294500397803402263419579009062627336947993143532004833986583216576075454557995151772837592137710350950689583975512780289837630960178141433128345373955774827542984197155172201376269721993456969693441713234489126549217388000870085510045838172952923521851165007882851077348934652496220540574619558674686711580742724224732158706759436288508592414789475908643261231979849965534702487191702171914608415010114726226046227191290999364523758938508347701371589170555818768106388488266815711398042071660355155793793586153099161676199825098912052010915574708021323765367817564325300283769190737342156098042628908045661150265453540068190984685904507607514589102194950002060761509920824898974154925354331187145152490753920044510913359119839210413584641836287667593129056422856874899465981273275353016446692830752233665599943930768306308382602841495763060577514416174133506881067561043613973499120631511394461696881150082161261295603124712993243417029947229837004230549666120852120861380379154762156003589965318487967818974638077536682870780100238078561991454738819242155262494313860512755337963304745004093106960653840612864784241197320534249469059126319886299205071768434114246426582329945737992207732790660400140934254362543621070006800869509583766162909708062759565173896471382422512824210967499205276400994534680011528248004757492997039859183650693951470147633359336088260441889894146685930200594661318642716775641396882899039579960604444008657994717445979309377516122326889605375827273279472454175465406250994310320144129854233706650106607835314276287704198993024607416332053569538912488058824886338975937132188069337304448239978812255846712778883597197097765016150166764102912914342201425991078921114622532129254503792674800512840743637447061346766077966373336579174197269060570555922632408896523000455470360032755936876219934873242899153887830262321538689717868950463305985355048304333117108360621616173068343043331932150056788353393295952964596902945925279957885903449006208258084796476494955516202247839100985495399332525768408829674812178823112712075135304614670706730836497487623679993641576274230214525370849540915756456471706108098650225398079971160442675307580166532234614961747281883621348429124370088529654222095203238088580349416163222555920826235639335661714625994891445550554258807225696056571903905691760502582615864402499868252417448503026355468526563712713362887393329629684833957024650174243683328620640190517856618009637476422743900836483033244198645412431495706266142057420216096933544212787074494895572914351960412823512435270339966556650243296807916788817147395733130529908541759048558901353860937197014885531925158973825710800442511775293074104928460409369685575116969158841740777983116501760109054428786385778585395507068952433133533907499464557108687483783359048401354815340208305190346202859787185246859053513651340956289662878040452521341098660477807026904116480121177365241909646876312687236365417833419568106820168280335479848949746622138768384272363283781233538559008343912744498159823002634645781975967543960280845884523634620349047268758319792759698000805834344558456441741679969124035554132555276384773362600699320001496837810334539506960109328016625102228996327895479537118029635166671576033851890546322523336529375833580970190580307029687803784298865574397933009408783551848254432088784236821084836572433278003367205258573267293737430656494138769521967998678304054835049368891632815380946760250427281896828997777660059635615747310533274669562461396532494172921636023356155356250636027740784539958142747558425820503457200849061068507132331396944003611683226398186203101652563479712053958590579239495225220738636140130259377149413026215241239231398695909019922004794830728364855667732862983457238668450181525312155678756026399818884103384955371002982292101050529962186482135672360833054502233969455609751049683366329493405515230750024492168177260530568533773882270426229469107818869113510434010775535400377151899851701270890674151862473980927333306195697337492332589981383906696865033219518774311826520078798770622531247152705972486730004907173208749881326336979230303722195938970102891690991773635812349065595458531589535507973774546503950147396881297925518467346778776368797974117827076185678459463680151230083447130911231943837942151529872296058750932205266784215438694757299485507103771791320477820494851699716630226178937964266408009914187307184799005307636125600525316759294680469609148498358114237563445258193318624785062205342579372144601830087639680741289339084746589422084322817551819762514421536318537762615544554208068422720188329371975527353236141986905185719187891048244542302423635454830479364042153000617949051460616728218854186982500251569314666550577954637042306888748617350611905641584800802405413382511815854026393614435050913353968358850159999332290754847527901065979414933769320581445251560057387305074862925011948855070082370098819631911259780486272512278544655243593305599655941913468132970920697869284017603965499446349332086126074023583885912021633192217161564919573461790392460984064859658508968057177417792500106677311481688843304568475226164967207163962699322984354614353437882199949529734162208650371895918196580356614893448390027203592796543562671847851624779392119690884339638430634430129121503805551152086823363026860912126980192566310289944975510117798610067285856665378682619924471972216384082293984722711049596253799319289109283475646892603636976396103130085185658272490417232755072705659743570017892453082440389875446723509303169444740514960297745902702044428364190614114063098347310324822614175099107723514718060329975031369324745045138724853832807786474905514120233402181736605259467156553576777475701975650868222584123306656943688261777135422088665923611410684243971934490021062905298741173300795412270468355046714974732719817440173191045555460482198850132265087516125888123508488160008654144073405287268963778436949441483744104880958225395889389161919266062398033716162298272377130184976050639200724482017882414427777880044266087232834993844387530308458517506172056643981957393819059971648093981562572572690217727868735850111189770060260587308889795460274037596985139339122141640180501136573979491435669719447526278253580780488956669025737926117279344103796690078163311757092848325645153301955845387145417323218553282561662242824223187434101696603947848233595553944915631547426290700117195565181550657118981883236408890323724140737518620062719607181917516264291767206740125577124986177347868713311133226921849061205285885427753694050648188005416760650055010370205883530189909062949945338778784152922405723204628982563667467314360254453081389703806274499077804175621057116867940245629915108956853463152842171925699514817959345480087479110279819051545004883649318903876288629687306593458372155605939443208013352762297059731047660783382008128857968849722786207759803702971507001348042579022815593190976148074377101211616998749250734608776612693518109333702056973397899028530027188076101046364216606836535464946251032901532884348412234605399309765515028110473260502072083003692092329904407465446880278248882704206716737097076438572641098682446542329810264833569902296516582464070644178531620407479519178567143108987966551976376784424788875711285139734288788952663458018364753938725995125979679644677801517976129096066446479954624987110239403435943910573562267082167761694606507662224000037621027577067947844917576144826190988203559766346996174402503268242106885867147359219128671069426558694574603736534022790252857381886051326630922093460776813440567267545006509476151903424375167996506228619130371827181245128351828930063931542801891604083460585796996807377926037095096638473114212562913684895820404229916296664896870188678986200863621629772684220389814641432295628696787971223887533688617036909137479721802617686588808852625386596695040538183084056021715046334724667235994115589020718670764234334149623676739555034504096628509794230689307538165418395753248181413154221570000455494189310298836648175656546784708803356848230419529922865014975033395710517251726172208713644690255710926883655220377475455202324653412719903149825733638013325273636181732708402518366248166415570318808843061720964130824339083002388586597424452068632779410536807381409561452067525329540636840862403759275445070389833307245739268379003097586446222238496679878780246597557591144556730674941868337528676087675968970172884342267995671029548015075231846190826771442550903685679197227918246187884408712360942266509649195681860320255628553712877539174219297157132716576159877792856958489859475152001037677054775557349220386926142494572130848374966452137310772208817395535206248790020218361739458845780752678886398441058144953737491793877222876823683436644667407966146493127547126519126853660316519208887755563168285357236070520173502720602284630834515839190359965762727382246577770066953744962010966373502900424613963984102955379187276816898540134226298139251078208963201594804647615080033966627164449948289788941641359954592181327347503216625429624848780497403708431341805114357994327396348330343866575493872092280712215508945028046624228273987560079163813306038876393747034389748587467049347950924933443086302181252585158919722374006232599087975953580098786939858084038066337137728676656977298740401475477864152067769666131894150438122748990701393802598338213137885592359508264534808984330647170297997487751860575095650335370100740120468815943888853103955150894910356947187875511935943960148118971758578812746068601891456341096829956267422157149632654296645019226395150024623830045559460411666093457398915437878633915159721542392455282396538120156983130044608762097162047226040655913375122202808119721061716292338808700583298205757021875887856646015989066826716775106041099845531238759533227297099514300734623447715258832822528218735333091393118416904392629733248860939959678099685063374833098216944253234939276074734338144034044135229383233408308237342478144850392413891653041836387855489104386478868394308090486220647388555954668785807518026187897449474095534046813832410467225171278823544422156532896965641897282174284940027390665828946513777565540077374047958800171115394778246269682017158870318105665789289306161766971157079672825697256661237059189648310791398640635583893237564501414967308416037978996097219250856351209389091747461679540374037237416286433188399220686836161168501039779702290427361866227882960586588996475518156517182798538776349954567390680681291671107651198364585982306150034973136645410747279639368815067704044219803303327413216407108581504317070513097337991657153779855166108956007877792392010843018382469150741772622654013863465607504471905357098849884275117866641106939369061868453754895843939844800349836836831811873434008381858961251427632512858033685817740276605412942348207853000164508418193209125245239418588597520925169836226961184046269159668298985270859925259077344586074547214190725911000547764205674732697366997652100636946758784513365706758498492764049058017084689066311672912186633869984708440532622493824664116500634273176652566763479767288205002798843149595868542632486325919134622441455258704177592686709740103153007193325734644904027607028780104413504849601990866891791614597535035779141573508430801119988830179511089720333027688480126100130735571527778819785773169507555650638338033454657546059877231495725488322309996266490748345014912668407815747757545277049038452261378316962151093564815498396705671426889671902488635722835207433456625938246053523883622392085498498740955176301572031103836438003681772567605729772049399347487973537658647487295360121769409457765840531439479409884104186608231238787267045762301535531035348248495642389647033485688139576606432248348457499811787921702350991578458717215564894653463233035984132964600027471908205129384703809371945661923902418600330717787625165039978051998187286799089665242852293001247805704152230260756899467405229049567045529477258530544365524011394413673829360325748447312543463327043214786790858885834668731267640756386132701497016213636389693578548963912677469398897048190448374290591039051552654608024378355682673197912786645854837918547449717835196186161707842982408181659254648224716042042203120707292893300465443266846596401336828221245488256982562716703246287393609530059659992891532864611161972504478950099746490376768823360446139666825245760685134458370878611781618664585466032188508221391200906949060449235315966674520456381870706976746058732670130088039298328609801758882985326006645781384496625421219449932676307831439215873446909535175506037270804641914164481665650759471155235449782831795626673664493509429104034755222113470663520854900171576292647893150181388831752474894107927459408820889960639361020952265222165203857716131858125761229596710181252953553098643446534032164293432088531268993013365513174062558541626652760865278748254656780002781083959752138311145542043499260997395829193984151621357458917439372180355059765403430133830989011965415097053134152541126849931457793126761042934251947347090682515089630237806452977878008424579857687790704383782401260488261559049243057351263726149003880767620133867501757978281068240325626131105850837218551435770625356667078344089468216054507399180554758520073841491994925134797499787191035539893647693060178134235409322658013570695830807356470379827905680391932717738448100207344722519281302938979997300977226097294637910047663998538490468632795555629981868090252617627676313842655925523087634198195541883247591298170829697940265203347803284506862049468016813755330608951092588326112893792567972477208401667976696963796994746806174240919043293414573258602732974809726717862220865106204349603499635194758229478890287474561739757993829878826044581034188511280129231591534549867164762902702563734932414871482514681814935988190581401479125574387446113353816885835586507164897934048673322140732753940270776661699975705069448457071999756547297003882396410526046699267268366851219793378301122456767099120320923603718934349693297779122859671870789510133698922641158261302871516742076690266498225703178484244788367311452695850017081124692285536750356672900278924216097983724870300473690591511109801199790237343875106540544919050950509744648377857493864870438677017288170476439003159054394023091135985309751468741937722597993450223530394869162005553680085036007806211704314977619217848393360279256028247823999732127033958243094053088159324648348116103470798363240446125355629146295974339570468997061373851839801449575657468352738629024792056433203250572181007420118049360381242806957090637990592960350455008924638561267924927733666448044000284678546503881578128304740360055488814931946755055580346191109288699512534403512714446507891540866970998402428572676881715651888889679018711349810559503103606615433286336987593233763193288150469759130260736127058354236471477919247512758143352192516571125434310171959747306774123453215641081920982932866219572891068306460594144221946604559472922022838226943707324064587701267274646308329063584098969095099989181676645910356667528601937741407634315645084245121402968641556026624721718256108688685688870659883418507708209157707403459808515270262707085436814581377417118163223686592962807150934474307695017743144505868224990311890330099721914557296236940444452823833159520108944846467558003867912963997189521658290322978563326387391157391762795394546618496027260423266837357590822506335052330480714329473345135057030810683105944432508018426543613973398837480116331956955648081879962672078103705361696192792582446180808037587625536644112123858821698611177390445976966508025609809073600692389827130644787468369159914557371643585388807548552791007677719452817529541854654332686755596733793729466213442589635820599339587962453036038154408631933648851241305681406998831877421992663445338803104742417179832230949785620370083087545656020165576904942035844271277720418417561069262971137367150613522429195673297761595792231938494565391243351193962910621118630257997186595177713525168810546235307914601146088475470929325752121045241145061926849392749338313772974509133335172087241750014587777938728541408880157571789336444987964753850040874654141169512781837931917673974760787433538172834265023848267988125704013349159170415074826011854779778032838871532414927723462349688564371783851034764371034098385753399130829538913459246137161145859609509012778878223476424840749182389253280700287692522477791305838115586959250858491053999457816492858182425105939166310283303979977246169875185005223739567094920721557529125379199728427841943811777046361680662504669123908722392495318493549615729926466248682770852055500309430584596493829000496697969646182535406427584309258029809157048772067908671664907636315396699158783933900795732933983647248103835739999861512276479608606460631024660454018064817768454436428413601268231563267075010282280344154190576075673793293332054248651070014883757025448485995350643465426504860073567220861837744533818945978640013882105228363315525843259623527886269365690447558144003197684956034741567967841180857380404251878759926962332552579235478011888455062967338709350976762578973560518365898524861087323975228142531957000690947277776015882278143054667469417242939120719379561820936088419518110722137848326343518750430998660129368731227554361935178765200721591243809500261060744902379032254479948683861367094554057628004345393237099429466582115320989746705673861488592278767562588069810383834736280587578312363332740285612312229788412945548225682383794676611836578598174863224393553592281278531521341069478939125763562801138615066954638698831940524655917682827540622303973716535592516615306353240689517269731140369874820806111186675435776065318801980700478896286216320349099740686786156185408883620253660683892559117229923784982112183298818440871333835139611593086219533321211886480771646793229616616028029854504056420510076507671776052800570870743965574716799752915243590191410085700551508546608761720087870875747370513044728815974868565538335403191520382806026179839481606429128881865385347019250398059839363675477272919494038182485064231467018804652742741236156021493260081195204818929451024580460480604498703253006553082554667101901615322035023337645370052698220149708571360547281749719901935421038219635519571180515486492000520595993180421605722291584762789568853484747740862035466613936594284832142887580531833940793323423989028114684363076713809313004435234646646855888071310891442983752890167576483852274518577083207013670740495555903637702821382461638697956108523589008918504640325674673220050067105235377032869784221452095405400130576007898215653162501889969935092402580517004460557275286103919940719146760536897460889660066194296482292505478166397773929417615106026790166470192930427052280951136052949829781215487575393324080301066123480249984732818318149932477854906785427642870603975816812427880836213819121072034360215324457796835702109519282701206362688823663171460279233184312642197563191648252823114003595934793877212245615349435819770070881289705266632815429920220355051120568704795721255796750999286822960167763040265672649978552389053172186990623988517131215746715860382983639164157696448679209702825150686137788871687934320901476300114723736592794902330647275890473981485080475203476667072874109445908053090052131738200439533919920827586653841010193498144939329298087721962162574595733509958357892955723487790750646043966927356178262166527248391776678035685502314991417324800972373151490846256421048581216004274977407780208555922548626922390685123375814558919424260485530541082724504176276904895052310228357666911263961675848081352272941416271430966503494013311107624960484731095678819472044780009906763223511187858509209259231188108775077768735041563607057121771635484501565588258903627000753268633680257244541063077357378680309288332673300505945364092041893140337418877622969548430871678425497657545948126735201404630336998539732316606829045339757541511745351555905066476276935211112145605879207782950380238450694497699680918928265587071423159075159136325669433554940155749107486201588367383007354768342789964953880657688445915338237764108915293205022102266310618751171039235308389767441557794330865446018576204605298439219049764972002435393085867902783763694287417653309450751329744311072372942688211799989430423627408350321013400106333255193131566895234426447417659215414970884289339018282935905771578845830501902509226094318088879115373376523837977950396631612212488119085613370780703109909554823102292578224090335224698458862128555534440408498863250077560825153998542093932324077425552656878459037117118027927785862165568690882631459822299642620340177606532379136187670792945904262862665988017073696872094334792131894537866714552463274558927060172097562791197747925605898304809843920479456843881622647282572136243820818649676574238031995327781298607291684404202183644841513905591848565364216883427307209413947776490518661492884051748816924219006693831732645295049312043717385044151549839461196195726809290671274773103423306127489074927529878691878139512874442379792491288607262746240467928892749610498367283902897855656946851647954946199824262674956732480837603965653670370047232844276857952078912445862783982356905710380896311061915681676830908927785461140962978250330473040132981235938494961418466551220687982769606053481799610036454415692325075720423263181803835087450583753586321456163702957628199931873584540746238196435469406620279651187477179231392441575087988978884731296632525061711766654925430538332567623200487803224233969086471203572509295684173235392870275486116400784832706832398439874917962390557203190553952808800584809965483230012597889034880289433159087386506964981163543819764711692027180260381387348874479836885613587489878095419204322761104944309520137987169335088856506619754627298730136773061056361237641719364048511770569278179685550693145075505911556583497938876000926924549740299728731159364199023652872236166383691195271792698582453312881955303324060998787032533282606316636997766666788500148799654429803021697123234350525052795965828982952360530723724869506844306308115522073792004127455600672973706490970086861102989911187622219750847295796155279350135733222741150119727274823012786191372309825654694163943454856570871700566975202773874362622280646955964653346713652278017845819717910932330339917779566970403397205073115308737423364997652275370571854981459881547797894048483297268088881300400672260541463794444148851616268126391320544083843807631278426605572869655679777927734454109404662150384520946129323032282039290522238353564913968403399984679407179424121618445293255734040587829372377185528294952581867004921412916240060712516119849055342416847793646552097702947824851962114474661712404165025001984309611796278253141910249029889947173692043309178403726618049255312282395083948076311639721217855710603926533394388237135237174451004652127188646920784556552916439269446534465006919116080520198862772278846612053858583590509632635207395837679010128285844701168841293096919233636567563748089700350832331433242748638358371943471843155256043947407693681722803742072234542110639736021757812414224460821124284193282525117992354572251977076401041936332569134597101129990340839591972451936584196337814648342707619816290703958573423847087390554245489320022215307618856268714164000605687441980941994151312437772292164813562377402847751355405767090569735198128185541744790425272416672934838610300621824396903351572400527208214946810477279440181327344975758020945079274768842239121217162985739401775056611214917773131020055304260882726334144344217619794352781159544614044676377828830379635430936599787938815443545180194929034463968296541868144096983056175842125953446811477330363868202658401392316322398668560103008517991355102945831952311892397332817117880128328813314494281041169093466622065345459732512149883541223968249113872451252317797348296079693377106624501422579033203803026913079222364269011684366932942482049418589733803124623045795282612710337107207570289356676265734047823351989984433421985522103396932503185988773364009825812988988969034545370710891596553454114155549335666052229289662595871332087461388823696997506483823262726400019012177364760007682749626430735164737618664714960020252056297338474957265700091142171811423545380158693908075364997382595378674194130668854376324938408256952742118172162828871370151995176225482706028710783580221015772495310748604152806488444019324480904320450211609951144365385760554574035453446989838263601983047876440445457233448091618748585514508061972004044487618480667753832940168103677746752428289338978760223563178683896251470921833183208241794243703323813060693951642506346090080319685849711003424243643411462051332108746484949959670100448647964539424517285428284169117349688881118784987183310803598502867490914553176375571739156171998771068757582585667399571573395614217008188927827282374553257709447960324781591372061533048166759695727323229539651504702687599109282276257038405168392310245309684749367256121849026850292416269841556995598272796377031350781266798554046313442746777648684541089239913228558817297177537244207279873673775486691277544462585875149981277705346552334755220185101701785118395852120849584861418581372926624807724737374743935902165097340230391228883792898250345982125567907546789133983396368231307036312666206035048965263364405054101698602050976364172630309062937385500510493504180324745182266926256015589953054787521992465287330820592944484385659035435588861012279069159390818048050694871692369078681947816940610618307399487793781982754965900740486243293233428933957434174474041267607960965251147479501990195412709256887785685707386891848124916731069697989755471519408876297344098494742672924701176266578217381942554413557651370670876635106916828506253697778353136917363896889708696535480131691131629251627628998938842443163042171562984551664160405013235598139322208067476542838161847418744427363635392271126752366384104499230574096392061224333412972748323349347181827795307631696417588546776230436961891281752626079858681893904119626695227879751474185674071937676381539557976452836170221814506404415463196049538602766293604958474215771139161607120000819534997699514159703472628700253625192231223073452734212885964002150759785140265230729356978552905028940261685884071443080101438944036547831392463278140845191119593576374981135682523033157948467056158793641110397811711979718344986728295730128321384777278337017222780583456001279874908970648936919825406780368027569835184497882616045488159855510552044698133885767878344190792750732629798230128213211205894018861192412515424714429300906756545984987957320146761090787282849795277037156759989155272473562156394026150142473369253122434429544490425358230606142312228521952524147039997450764108201374298935332307474073753551768624874965039632657665673897749233496271855851405796837168729340456435992996819777636929637333748004931941372902930481630183167333095015949020904814098867080448451427357632210541298651094525135292682273070127956043627949460268177294883391598471118581065276782926380233694404585521592295746127256297504542915714812987281357365608296854577202912312281990168060367994593990495497487278702381710222860437812314221417843033784684967411362664197333900230425160910855977576005162017045771636494338780296452805032415631706572118329993757361200183515066795049652310811712856644975562754915111772425464977337691671268944534160927438275551109542454328919375190746908114272096798739922941215783502734471849567065457636618126427303149779832420273317426648740514764562853745526885297630880507979168582622512064010521780438827675220160148218042995518385528048441074554365752807695699899560588824649820951994424801164466794804943538941413909095038968633994606952390914767619984023185273754945961958663292701376660355611454939977072539310866346831582399296459189211105905639146396792648068423062864773548081686629254613593162726707938308246200064558361343685037752562679586250179600567545682168849753178549864766616369980933487057683160499012333987757663614112795562017286350964264945423815324176442267145363412535663063539260219408758347126687787913422290832045330691693253722562064956843923694864593955635674261212686959979610346734649952993611654245087670816977964482280709620040910752508507320625000485405841655586828547720549818512357245290807916527815341070727282970979379357371076033761630596424086917660511786895680811269817277917258599693986218229029562758237619068022121153730264588747543680353959014008788258866745800733953026128346077491701514380203519198598077028240606163813039315807807604363699281197734918204878964578664951304232534174256698454661121440809369474335688531611698081871479617229512834650155560782526073359182139231139676949933421093592070828813953114753347461460410374032066119885536957522868497822489817228348247720580939630943947435712323808293455551959956604729832707058349687651742959770777363139905019011893682814267587656083190551717501253634181898699648556354884888167704974133981280114113693978896678564536894285346659832471073035603666309577375397457207053195818310696988632987886274680581694389584944723605763054306201723850131204997293707262579259486891501061880895576602905834227164035724032025271429053246015403509400322365561038928985633227618692605690710575081675550738538648885982989869505455761581554993342061494115125331854860264352825050434419695084508393606012841247883238516802414672611727496969176282756218513876809722484982453432158101643700650284229296411305014854283521050810929999116086111934151781911415904083243373243885678531363506963589457962821925741346286324515242953518281594678273019197816182820072041309908073685043323396849684491442896580586657088883091801569132426369294167716636487789007737181383996451569573175112481173224108426882091270000184893519099976385494017203080422540934588210616324153891911328876382786050252669137413953705046391586980130911826780140566334244611704951541080564556565583679007214322767693727415506714198474610144776588987346297133614501929225027398660488184947592903625535402995510886620143036647184667862726852994270298541480909353797133738396979177896485663254427816881497034732301640221503010272236036097317862766059170234351410635948778891417246121960157530066723299949939567442388410098929070238100285034640552582864378165613599943172960979324951574545561507682732547472636699744392746500583617404295737440213623410916344843976727596662681275109640584686729446627719454924120075992055432194370099716072605893551214359379514030896268071811027391942364872431470499210866510816380599688752482057049368082329506262698025650989609943123463979931221545475613782794330276178573380289315111085637176378356188995045771533906170439847297903628003822080051096887974654692112370310322769470196687396750396438044946135393227093779768869582581453122080860875970513986352984518999238978780861917206672213731315114458629147602942077110143775671285037171655662812233661980440596541261985780341096266147752858498323121374958246363827969433324059027761450703418677480763060663486003601010313980609048434873166947108811625535834112719393179360055252613052301605070689090020890122714095318679055179455755396608478745021567908651888122230757887370319977562285245267887032869083993248314282072687696916255858230134703469546543781860569587647724928760983851509996402388883542485252982757455502539341200398653482472494887400654827525688861433348832444924378846373780017771070419938000623051918473053429637436848441681105134828069089787153615354440401817675032892535155419847592020406698848642044095354669924758409139501668607725089742286742444377599762792297089993541050699338964899108158918538253093579387533410973671667224772561342652123482736008668098199106720477472710760004986075655809434143383037725194275847360010068284332237987030298589620766613524204105668076267623014610798661479625140940157290902699907517656501734686078205176483492844841195064741623103327160191390030120986651776793487977784202024930965642054807272000497226669331956163048609691562525948664515133344809084534872681965705560533528665867021210238042539263280264671791324187242601607141115986069238778963977205724376932720333209496962403640939739384329551243228044848124681140573037312456519563004257733298966645614386654634343000549200131470777143224518567532348280035126230043364489202529447332695983985210219464061503909374765854351369403813356818791260830686134064997366368411498084114848674138416306733455823642936650043904995046550017886956382318461823777640957062310013613537884253456566282152217760790077092692373309791203953080402402681538395533949504750232848019810648491334493511075321456813758530073065261752765454512152064560897331067550302239660388705575496950981010827908464466798928694939382947163632703655553936043091904936248512596074273558404477377622575699823887649456791382961147620355086468905025891069284342214974796738307973118597543141803128143911226318046074520766905664336486730757210792001763731343480485903755940276122266380677579864952161618415883258044640846031666412444490632855902142264256571149227470114050987804158182244662415580592756840060253966631562544229414967203186601831108530189002937993017146215381854690838542303482563145931667604516851471237170136491286433633578826314732799198294870530461017712154015634305288719383127062425968900478997968488330626453719607210232571391113304627854604530306618090194300704460362674449276336734511513315268840891979009550688200666044572641862907494867349672417097898048050975186328706905026354580957746182094622556815411579392739121588037127024919518014199304750707104854104758294857195192320342531157014898652326236622744308633050064539796034042460445807495284559785835101306604987097153613899661366707223684889259339413012671029928802728630950712990115717785848763192200457658652208575961544349749862203826155088280431563059120413756765745267784778234469987249320783767463591898543594579252197340114608054332653304560786875522561078439075228279153834158917053214380445090655041596067953270445512470022886964578549355242334351407917493754395526866174017969523866930689193681167880139896099193174976740144008831308612819533158332457290370305347013111997508704568990392708599310864986425475880735390695517494341005949633334836499191286999757390247692067805802129633884447850329082884271973935303763656375182813934015384879354414669106453111021864802753737539591266250623582428748284494930715343540047525225285639652883325379472032038552770743493266793490139987622097857106910296061335941074877804168834893955859717770232642840652713140828193939464435239461316658853544028865082541098672930710132670258533161368667232388433370016729274306679251570057318709045385106110315848590022256082836605381570078064597653553290163795649814715292600059051244639201975644209901253394380035124627374871982762364667550512208666594337183850065952181386622298273614736846863642698190074338726763684801784561303555733653336633011434868451517721066752105626428812700975757927613814853188890833002688357299476578851439883167589480487708655219691610964891960794422637255048172353219499984075486420339775224320918914631677250506945149741126517902332019530365479153447989899914910743298989956240953357029628081308619382093867966092231251781921613892440540569086778558155227531377021993619067912767778607738374386434064995546288945729775064667311490813341566399131936470689495637565605017952768115471563609958639969059023848935738513041519231678642173252505491639828630456480193451722075007294044934419837927491782014315428748428684492566316106667516234926263974066667817700204968612663346659531336424483641812554795979126989124228238924057324716422766270542532369417970194788452724624503938293644804888945881110462511707186506285175908299200319914964632337391220904909573427080401082134813901733899795638344303015973681743958736659992144220509942569111450073941610347289869084938573778535154645647512964735912836712331234505922701426810805310784472573834285127139675508108466500366717117567570381495776983729714252648814265033977365610770275815580741042362359244656852683652110620315177404357581253609290674420538914744159039900977956832541867466844271525240137242097665609876372974328052366847006196610650750581529309764953411986434660007923514946823375493459790517435589791816417663811346569749830661701468685839051830010562500104079854931651627340795289875284512314311695909987095772088009515069645620344294421233546933164658011658034947271786832808673453697142578550442836932562879361510589463775703543990764612284018193707443745336054957768363436701802857062278490827881467127936875074316233288264361205919461121461822037826949044537572435896578573605928273398549845697559452702564838287270239996049873710108734064261394777498389098126312999590265258791847212195682341841782061983928198189605324049430473975830510641910816350242063775455395103942529879786448251271010406689952428485427400187859453058685773286570140884572045808841210090144504128153237707609240296236487910371876050033356443586216700073378637590900827538389542794054685252942174466258678399221496862823827690383568029096444726886780062434174160272184451105642940279586332610838158422612065723434143859429103734487675587168452447028705088910886541075851418010217923716531447457830247643108720568442220797463975837205426615415172618064573773397902850320706576447568903252721532764698025099755103722191252494451460743325812080811592969311302136048456157967617369269592763764609996510361513378595680663644376257964654456264791226556413131313758778536766222220100201436722154168542884741285579198998577183405099855264355736403953808521207953436975611474798712191084984871738298882617405776195358377620813408581308557713559923684338629821431914289495007472848884352491898862002239858251522982509986001818862340554381127000711260144149259510567880393063033936059213001200625604399737876039430951069502082340069464940821974830478973883927537641784143067350346493194999419744343920271729824657448920918440441108258831550159517429816950711440409008212950753800685765751304950197469512972505180924753468174710239058265245952280382708694911735650605880256612578093293861356073589902414076584595445929485912088858021617550667075611257494748746723706460019357308543393512690130178490994275586198888656228879659783703413308637979088135664053052755115646954758485148675284642285320503727829173451981418458612904617740741817417073825030607290541240584633005297089533554727463134566708324925958174012511662540196575719330958495692877907870988674399913492443462164324430255758104825680384554321388276739087693708731072106254357687576742077965805380814606690825084124809871135578132948753678121155144002445775115168141483037759942022213255521970105236764088716267891877756249796492670874269229392222269548607191752671470617161568034521176762317392573531890555261101381794582497410383565968756911712655740463346504786081733574497040836931839632266612752035059685770915937025599699120801337593539505277834685138584696177498460534031253748562828243849666601311068324152658875457404927790683896486902259739950766355962287777059484298308442860752501178336308890462425485283582881984377259886338779150059107120206772841228332142855613454546686007437516583520080900205926926345684769030203794943319375773144549238385639504125319042026220356625002305195298118244624502704235686018389761831179014768116778640837577736601566964086433539862303396114306846136136424165396460668689330149707743361987163346243691017196177989496111073087238673305764614162105930164982014098956854733546169933116714961709500838513697407726768125551813823067758029127006273188171905184888170431661362619334666545468655448288343515547842859463005644341313345568030305275393581328912087692650665920667565559224218973687042465103932164515794971806555580950137124045526538044589502115516601199848402070676997450460585825456870509636837598897617886852780680737252884285423778437728151898905934915451351432687716539081872746837378935879097706686522704207514055043196935475369765017870762175303729517353057355976355790032485083635018019347855959934778323231779246126359412658959937617154210807555789682024658900184770106992462218210517390997086229524608439334314073921479292518684834902404566025227951241162226692189213719177408255374980451401369406748218608791781978944745279772769139199511409581780281360349958042456375914070555924442176910672437312165191572715943144508029822357809389512857032853504414615530851831040123177440519456577065336691249170589928361934341652048387770604546452959595246638083740361700778045194499562602935345465353567718168814855564004173221405899295228899650196805197021755313124277055511415850955218591953189929960079759756925293543473269395674786685781786421373243670722001224529351825514917797039928176235023738412103957835726247358270513381800618466309374279618797418290587389258246401234317095516722031619340742674569432066405334549620495762493737605812300497077895150045294398930113988697179037220180733169854221224860050025208556633158247571077000630133383281976007023423310315005032602588703184207053044325045250324052331132632739350597608676053999381904514970499516601983534910378827593679337452641690439128781186943271128544160571619313179900825285107472187806167540687936029389628995395159493415881450377776468688200394218277016967976868739497587064530434077398555746245401940517263881489110691770665114294749389060289108635396325979316014990197390967584823389596395629558008479400446053025408666872810852283442893450077589229004231521805629092820626963316190952313474234075936438733098668270097951662064827779198619933892964605253902130435837714811127678912042809244063461995451341305471559549308194179008360304396648157209174812661597768022948795920065015016974628970939973599017072425468496448302370164393770806839590022770391250116206976777133268120916756288080185257855418176673179250287665235178903166291551547689151228159564973182317580170985102484656458126788728741251721909537198579683906179800365940416466670360270998034769170229081831073798293640594107931317391515460542751260367204571415610408583438562314769345524948070770267725996938161436346096420570011737634487142000008995658718201433993895916088442959293674887852739325609289970299964365198263858093678318156856102867378698455688261986634224935570433594550055382035804809360447530083481874860676598936531173068341579264724262099292058898104523224044020188358138258486618293412917911149227072729099702833989930842707491617011541469950668033315565619924689153023111669008218845487415442622806182754477467970210270914416582231359110739480351163173537860666644739735994404785108891836879916136363491942623781429705833593066725151530416446799383881324081690862883901043484670538871543364287439433914991432024205206202877236990635548843979534244801077465561108057081277810713483254429637214214670951437392403126329061710313446317456915812473201265247143278787829508390153077554094571417997739340590620495910567360893954923443501891224415113643631059905124247675184391754630437818541181089792277958375100633503376376402440702773064837366677778008048456479333787773266457658052183706583926930128538200449863871503281633941043602527932038484499351640163249626798323214902913697242414839047061419436869584903400727923620354895869263631971222330001571393296102756183844464571835742527137129336114110514231048450216242998076632472364830704253775185025482541806854930726996572075212440697723676761025468573681382573953861528184161809497584996788512085636821264622481646204061006170554073725084218491057101830379700692568473313453041929523564319080928229691965915404603157104592648769907917406219801702229537174143491259449629689253556101014709065981692811475285549044759039309210554335923669154314991410201704349587025272330688396508101873198768119793304203559010725291442985029688534117238147652230948665178742939141232899462576627290557830954812914620526398217899830933187697069937185314267418250377029340334911530015151687731536234357813680077270316187268903157143992675962722843710157251530560008491113907023836712222239930568916382601962666500615318933129763556530131088155389702813311840427638488689844220784046773259988846535652486687366134045707117972714914674024844386035002126646724984447811876655243053440971485481223006745794314584211755876796327472831775903268766882189283703259471508836856794041204955881212254567841171307004533999428791027307485671564055937284545907790819145655430112844032328095484947659057743182278549126188453366086105566222221417165367868950984705161202763176609207881761738390371151485810509147726192368242223288933335427370745721623763978002835537611354791807485828582960754474026439096829440511497449907007062576452915311529806713982984710109580640325760364373233598434288329126329642033488238769152025163767317673087129907944918859811594457449167161763186525104567885872456716164179264075067221548750922395568610529340969745876910851471963617934823369950298356212125425855689816189800094390946495881546471469998057730037854205207262873833397994810269595022008296155527659246450385164029000476114142327536775116363685817197132671793193986394783479484135965767199996071768679515167347395074396970656349193106805528277449062451286053591206384636959696417642113272030915304155152621193723380131708217294079413022127097592183373472196959760223316118725979945446226793858999454741214576454775650837078415117287496939365784819172762773997320320559471327523843344055638327461285683865332908482820555407657775748074335769925212409640245681360933602629571001937842301742151630201778665433148933612198240639811947804430160193040693853074166509885351531968391004909310297367518903329006638447094120983324096430701074082645231141918057450975405419314289150207826146224019758236309795230399189476133457278333596105566042430674084560175985621558064629786002552665924609810027486078772629422187769492003274965466363489069004852872724155120407004882932341152233048320921499958649789875205539850829497311998289867968072398348977147551173986063929349404449184972905525770101350027142360688291105555374165198202783859445670485628457522899307838515347331639852184464512438218999205723086236380650841682388629480483007701621154470675843944591835608457085873568677030429580389178280818422455134179168134572283986752234844660756441515243257686679305380034453219753858800245322569375611055605565634069771268702345365238654400705505968803272253383440593363768929581354713937107733695264488895398841412358578431642452364697607799989388873850104854432937972059336465987485434043451132274491562754665353953322359138383581001660456471105473631341456144082820827385497391934963676718021758789686086010767162310378318352522816837655807514471963250222378038367949024984898701774624221651921402574104151422417957228154372476408597078455763480222547985953687624842618369469549974857296713775687769192551841480226896348379416301022972910381160078810125681062082717001225212324494663698353360813740531400678535055019399073760700873775550310724663637065037621960573673324258478295038773416915837282982395858331269896826268361108082497008967480190592178041652634540531712661801265559453653221023534675235663588081292837149246640946902409314562688952228649019380032075508955102229317985673585571486518470483885667390866775803611955141588464818549284857729039283938842511994792012323410690305993738906241502335424474206853114883140227605449163728807607956610631129110017677209383076090563145152671906934183719510681857484434250774639685994333096741302152986645171719519179711832536783784272790312538319807351090000518467022514736642583171460478479100612851750905688199178670851753796891655540027641379505809496422569812222302547759889401574054142881464144885134655340048217954070109630095637021442029364030494920238672614246543674492628624304394298323625641105746370332293519644899463734393330098173700559598483050511995091150582940951392102547569615550996525960197458507265442140569617568454831186135982648589543498027341359920365754513120879991192542437092999513123735855447909856944331724682947107887936285631192181585413850508025882850961541330290533120836613410767287242924756983399914694067456435860126058643899250931595215185468626574174395197582073125108414744628924341433236776658764114104442208622174242012131277299989337125711400680297174314867294851790458147222722085401635495344906793016139671598703068822655821956430002210849137983846773473850786704367458238614797794975999224147546435774832941251589097402602079700030794531109787925405595050161104493552569338760286474406007588520757508330232209529622221859882526585251836075774442438000448905917461130969449958820882748791067651010851199608087195647726349501958655443625546873147302057966338951008821015630124943794255529124309297390568434136757881999089006797053842301145998828240362255842391520025601088740228473062659810360865186644062110431906217879202642772826640280722333098731642106495748713117429292500768458347725546567548339104876584274204454010360280648297305382453496906468070558783135176228264146217974586358827875995057892524902610143208242043666436574743862898817213105705955548110124375242780466031861853973683452204653417051400679290368501536701574110028383023834918863853630500082266491506496287443192848744125207926367078413873121859559538126358543289352793945496151840244965436466558221857255801842007603853675294333704764826930897522526200403134387482307107906426543214538766448762722606686979321944169062001938169379194355508364532112073644039000103462100775739717758093271880774123816314213467727755655860347794398409131506594349495741560009194613782975863794987854062639462414526840358002618220323705938327062440825948899013405117593973845377173277431593082931295071171085367759660965383081097991790918876658413047848067284213831993807431877960845929111126006671981309112517791484143131529008392285672142433773447574745550162860907581085382747173522329237984632917120263318635494946362389126919202779397869454288156918812434601487479883571209916140010946430238534676868510458567230591329180322207912592402281775630189428013085197278327491387301067556064752200464321750631155204076892752645794374980878837290631194344572229782432100864814305170146641103180919985350570132429257657408979945766909454493623557774306245021445303574972486576788790327425347992275852320318977321672581816839392500890014140818957901016213580113490784919125174724451097461694670498031303552460804031969030840964103703418064940922337508653609138877053277866778559060205775124193978720866258806458219080952485755524661566024738185655959972242353643248679762093744950717039293999632132721680971758798890561551105517023175583658884049548366132758690709675211319004807022441046203913400642783289373112489936807781819833315549492511837190673854983848871079550495092106742418052288456807922656005671500374488378355554184999541431640164012821758915684493376340890003726400934115597930821683161799586359949986786187863010055445686707623827492263259276111743137883529859791498754705276071703005735588089597078109483534199939157351270989005970025936099140504309628553605940449302033879237910746398468778509506326664580809985291663628446626198689797671138170220486931587106531440938514304517643138780335179667939822012635375698573720318681280536060583180145778695970721010245700487173041275711973201799668635087378164471854928497105431836894285547985401870739260224905462135566557721671464638338362143312874993954547253261397855720745202683817922571363017267589916250017507675021040354967546308043259392736805791590441249574728002596482570194013825119347157396091855713092965858518886428503049860335178230351674018491105897312808831870585506385281966004628951796129398303551502396475838210386091409474156703749199637384681631877105717075467482525291470317480933800617402398786469134521176539593703126827193809406316659332800506861715037928817120028258263663217301682909623002059099327762367591299269704193172467466932530314602181644854472427937378314128507339383673924498670525062638970239164396606201046570407930932523482536287457515401506933908011790662531405920216556389058512634328456692032930219141489035286923169333241707837341871256305588971845433814826211575660002866575162735667343030087270158828745413742724996394654206460966096081832442385700272239997528734128650457950794585716668651877481126770272441242373778892262807273559857761354505275995034827988715116602178133910930833986722405416698007171319922892325138738530815296519287272479590241130665982529627919522819018907411685474958761215442080923334311398207427817087037552593544138783560248949678325909063604334356643022114823146147543620166281669134762968937894741307158869177287771263172565143044002635176767514473028116784986377099909020332043433425714582197079289897303845626548554318229501333814698892624656033335323924486200744646948828442185975691272409262498341349485320176612953453613259061805574430359520345405302243880662298983345248818594464928903335528356568705764032794712740572869355605391148888615240534514261403163938731936091278686083489068350526383506622870233901977454693795329835203885544374833115460041185962778504127453585241688545298062300536841632838715573248600329659787521772238723627910170009628660668175425059535101463489443414657173100425075390604506464879905496902176389175634817311646080808210961444420810295085893235390067187280018116702706188497168797614431773872445393473859550952686811353777035329253208591560664010357080218571605142253499017265420068811522566147974166551833179407681157003395132992045556094084872709856830304555395119508939469285659097094818090001092261312032251987290234527714413880172284882744923543496199161908375885213965189155349590052873547919873509094437697480862966149479725689571135190501713188020700063536588133835543742561161202786671238879167215355840717258193801733825602039545485768491720022763774042963845502296804777565415001014648187162594785301094322905611027472820639235376006695803371767130151333142319290101637830141520357089007096313863146834332803191959434476817913481160143485878475321451733635464453216239323974582158054964670713878821904889389013238956506501122174796859834637061370014109006897414387831950247555386394509751685308487255415237461214307240595905522941587267181018726444538941078122156807534820405628994316399454277843505599315067260723828427000895764421344930231556629255074541960688979016389052458072961361573305945993448341375423380418749661578405820071213429394697796339694999236271201494220374894081908858046011953116377946785383497014065341895555365668261388736752990322168507064734223613928537318704766597211681059365666925701237463201936176520938196366558260306706449575654333200031105018612892843565034321249366666359592000036341836283142493260309480184246650505042895275372110312382951844518224024538805387033011636978163808845082033890175606433566260124711190476969090001599938037074086133534198332176009637949763581602763656656523656666125138512036558694342939726979750716792480373428055536541223533696226957272431919160136986880983931440291787484214025024438446627318300492468507055965476358662452363927895218180107877094851402976158667132609212999773911730486591682730469497219061525868204234458252804646684552677908647907820668370401922596027699644816463490761603962106623275759985085797195586977739095530525580211974973281231758772686574339107349187441499537146613907609028446788235634165753530034930998772546385617535025610753810806752042793964246139287100047738783439327409064857132501782238624546957652410903745754743490237173152252214449345046913615722801316431880196761795826510051811102891372389165184912505604293215040762871901369906900249235308300437724793611569420017336489320353416621088321683246439708998626456393286049448473263591074586753710312132656636039209789758075121196222273310974637738231691373499285616320836907853865182841201201278973349736166157163021436605067872986320179366798411090407603972319258096024147865926865435360343149087504311582311039436174271024259360449011851137155708559570605518186840278432837482085659701704634078544892882508546256539006268015846814912410209615118110381467219612944838061109327504494837769164797911244701253217392270593117945785346718584634604077024459458511646718263173566608827508147674988848050712560700736813943453435672631831430759585170858526286613112547913832331475089409554106968996448491158969621272997559084121822352586025364845071629650828228807791608135315970996272176537027286018018704040353875999070223951070641669610092220928871205544188912212149495528999256785136373034789414807152920823915821206852949555139057588812652374619112570703532208688266358743082854881818284075048087594190117240491415347328187629375375148983668454858509748585180755562803471445074062080553071649802626511756969534443821121349710223825556557389029330914458555795385814302465588311569962003997410830006385362895120699033148497981748448544333265186364774566296890100586510246557361589030956398769052504496237682070683032476024324247537697327367992041662857163182397587090080791345343798393937229616220994137385130945177834062350867853376458737555635635040459618861922919246794849683380126734257860593644730662190248439092890897577696454310659531034256198810850331719408456606428477365772995932272320393367824815448878579174213137933511000339176510791419225728488150948362318452677221683516101237561346107507255933303047607915269210994562034957980039319393365057919724803270978976709442938839993986838690757108780293529833049292705406969597302831564180941661179486643796790511895310607543346641509313743941605719466214370735392328803476777151962712441156443921133912900282747995528816132582504457560452177925012212606876626242642032642070401758028910961386226286240227499027514196543363730818845266109768372918142044639562063174318023666304361542445268172991722600929795035221831924772458291788721158168747476327901773091891671101120696840671076494643680216727930034071358049976576689535734109965200883992653001624220445773765247627468465977209266151196769406748969622782976030270221576742746582504854025892799942335945078526236539935926552668056702202192763040113216601753566453291696768130500166980956526280308812917806765610057157599863112761724793705410967855115438674976479856387536668700952217284576930350902391352951471246164443632588720057141986215976890159318763809029400359503879669328080811831715019837269676101817184509678517059616562669984028940578056962590333779123207467152020601438091019183949544938523422521688326030621074909057702169920300399869576958252865967640588663602665199637424375457098537812530902473716219406584714271046481604457095673600596817994799443804894682272464743631508759638889338005822683589267909572270457197142925974448334358203952313785869640894866915999749478553034721329232373508303288671240934272730790571081276879690619945378427678032930760986560161744428941607051662736158079415218985481582671911643833307448994889311889965808243878749093026867698564840062857099476617161476199171403724631124411758771689990619837006220886385568151177086090685408674888123815512395429724615621365049038435239986313576498408782537965876980854252698983956395527929115681909972929858359874787068699187278555588248064242010854162447952743626464579963014230669948456841440006826290798714173486814798522936647450201261994112367631923829692592239936694649349136550179326305244717221957897527730089826450019719272083306983854950450658858611740897474357261065147899275188059076027514897366574776256362932986024590792767674587315748483263088810666504881699604352254419570818357862501088597433526753099584073619514950451796120432198105804029054958397968039238204836543651428400268971911414727405491621707843284523023651289261027304079262114300373453626496653026645292363800020335596626922270714295509676728348201607826941132531059451307919399687962469651494129659067636748229277517821638128039583780725799172683411728020699048038509301218738336313043099974502166097048992741231822792138682417256581568464183535275272861556676411966492993730540472440835083265129890996702851339377887658853569081945280135532909044575796086242777475726936873046406291326915469302463697458298579275239905273087444552016236764000420925156162249514849589058031488637651370086538236662820655923350004401221023392196894772343033406222948133070578440628614156776637059234892288978907822986390497809542383121623215258319980906128089497195866401557116116634172315682960117949623011170702260914777372055951418166915255541003750354737673978460272548353915909274830366615149083269648170959915101598482211539528919734019112782276529024941229474977484635514214098634589222153566901666458746748633721236700619976643483678440607878688075354957606198827211206909422740725480118818811139999927191194006353569959385053666486192376306270959197717572034504169329884490997202355894609312960963316777766626818181530397632122598687583281542799221418628168003747610254460517221336696111778143729442134879151960548509654885749924887933245714292762113924964261995695479722691225223024996333116619520309433136488269021277127033950880203854190257520634623401293309961657874264171979516787715758434478972324931709355949563985224771774760978789878652203963271306630169806787096125178050484460486069073244903876475533354665192848191863133283901289608487476889686397099103704936279043043599574528680859938194542581552648823891572395033576167932042027910538573623862148432399708880858033645953311592763485480885901343990945289348004472471333678712259130804979476810273253257835362741777902767012805754829605439923685663249924055035498008150178917046068192625622447858704243981244839839739428422230260543125171412437675976425722070286937575289597341801396993962592110663050968309028274527379067242862684837552549890129236521907400370268458846346404127885441047757639340769877102294804020747647612325871265194076237359510726134654240541378694445208013617494158297451586535681095007003001949992962464046065423905444805478239050979450149519251936525236948190556149906723050199962743470809390429846107336641283951880165529737468051518967215382977046953673141463121203193227900143916150580525834596501865981851299945892298047703682216630851515326792703568581800740140218462979945216800966487277199358611383411453085689330312805993819981581905696413311037631282785636902631310471030627051386391734557005412038963588991837937987497240385097057740343093078186660851996448036806164643282531583324667723945456204706918562105268375760340504173912130629112408875124459071843664045452939931439724580179643349960982093123117443937096578577405913147443384308273530901050780053831542943162822504702231404744280084079740221134133199795463851178353004207408256783495427787735130536214939619090592461848026979874356775659295708069208426183114646712714652207710518134916017739846370448707138736856106363483763276932567666163622736290253013890718018912300911840663092162785963124031359338376146858967724869398228611997550965433702753761316177290259837078985918142082264440094836682825419987761239561271545085096016785911304923495215037897848609114379808631634645011822758879281001956946718644637790725020784488345712119491476127653456397387073318278357910054727468002728634596400790408810388108309132234145819871088574670552152187469157620209715623183896634133388298786659597543820127514357790349375146083034792531460891601456410277286451699181468263070224660853431899175041021340442114539091449237485613994217096970841174033755243302955796946373797419369876967148386581146820421984107441202592692479898278406955722222285365242670254896736629326062886772493807783642303557705577351803031728857677050478272892138305238411788816874633017536954202061501448880973900774529642155113793662496802778454990470685238290773182269517451446882004695219946163716379426058566643685183880023089357813809528531598216949926560192329853530300011035652948384412219330925902103408513841986105874525255449398563997545553907123276602353121139215462796344777283564049278490804008888575247817227030321541631143095173036596833080679443648029226060295917236349782322379429532353070889162698286622115569381541965635761728045310099171853143850257689891878438923340930364187394366341500976718358381088344037112559124115361672796801802594424767378475043373679491341597875168943937167828137839936510273776240531262661893888033571709808657443089749603895551301348340479791301502120403868693355321209445437492886821829568231775971233311379311408477564156475768664345931982981922599798511974600228576851081940886523419828076357084996456076093201662888508685634481869709972836386137496187370099951933676244930533861274658957392535865623701438904541068184455467908135237553378257066565853432349758139006911958723595239525545875030239789861360110710047096199008560225430140437939059300451907299135722467132789722702962756422671898954775604896023544440933399392496945333673503491359229515160440490729979963468310344797736066826717561178639415362940100736880739763121963051413334205101755195684004590367519147982502064315309694094548641102132010274974865385478399923196864200996920867545775393158731788538487646655294004963939486265610335385654791471270107334765932687854882583150256548836539535484739813300595965990341766259824702925879403399764328340436303850088389943282891854425993471576071178800794919083015312013553254471292774025265321552837435120512461578831487154872776895141320863930841354695625002627357227214195378653004350873685217876866724685968249979775971762052820406722578471693719649295193080099040661220549831422476299287187942456781672016215994911024061522670331685990178780803038656165239384717755536634531894466156320327032545868240031121022156893734096257217242097173026283714061285709921563454680536986547972649713350725365287725538795270816238296380262616008500927982570708009952619131858790512985712815736698867238653540340008769513360164004397032735372513002621992276765831609523675351317991065399277335299819800118971951216408563987436073294303396230795317979202730016291191775642791648754935947494761380771743860576470545590808087804195602583635693616710585576548162863305392817487645804632237847737245840497578814656460673215058099561808450431869234583374228728749151908710551470064917552253777860421709251810266662826377303259332472179635410690770373376755017569078074012826442861351535400829320451733173751312479709332523253760989293025445073339090602716558154925572672552426118139891930617827248882274224162355606581358646477056020314252584371238370455855880888870530716020641415237456731059918178939667419594440619877715359967527823198266505662906517778901600445021007162750745543199183044843481435469740377170715478858056298884288925398900855955809411697574404166738724987379507398285775375046985642195444238162343962318091097920745580954340765768669618780658641234840358073591276879622132132999680712529651443425533624209616894887003418139361293605360495764063277186033479571932356676568649330656045962629008492082351338057024362947534093180029908341916067417080600038078374339955684771079264066456231043470076140501000062486130918792418070756408299392159301209578880473466605814921388325286697297042027334004620213343259581165374389483397765476149971313268202842326563872220999868093262511604433093766517466203107957796400884288065151453966193974593391054052226940199946981701503089273188722441657673412678894943809510887690820383335267406996637499568802301819225734993459660865448420233037579573450006913732284069975865243100213215266775737385978343451650074810677099294864566137321658537060473892345858931667660419886858787306108738856669992417557035111877788940871293130249868049296504409585654865437155883623331801726601137500325260874139064155722611282334712391706238859319538698224989497102890328911535671221496837113509373452611416450174345971926334742126826261220611645041059993804084329398618541315795454138608026127885273688755695425331992827069692617207065362368167535942979087281429636319428752857991469447396812801643064733401319114024441516390652053843423658752708708708974824992231628836985828427986127240456276149490320293598880027583575960117200573825386313477465404522909845693594398707536094018441748426483362629641500616722895588836892577233794640591114780780427157566265239282704936200866831419909021222707369606852336021686541166079220383829301734888232085162403443031754243454365281265951619215912485404391203743073514217005808307462397494805912319551717058132094397102677616573346813775141022795598199679386351228442871997305105078232604882556120557959676955860950873130777410918634921024018238737072713150908273249531731754705162077536008720376575962024159489330022470713878246287934398140025145553149156451028784405248469812174945460663508584650819080816577790586376728643831488923030569785103536274022634688479565302674314228615030234223834762136367977033368018979418007217124722661248332973378196574424860144030323824016524740415655713633103480846583676679401026334901998330207133275017983252473174888641934802109021101475231370454474534469642118488077230189543517755206721334087171065181925090616818193812535765332013435492412382140560996681246931877317324346650571502047803206254083608180647235885941688938720321477742789195787005643251498154116111205630605801184910429303809378858218807202942987200455555588469589583990977859189828592280917215665619818307640137015575803065486370450295519416438735446582496541944880944304834991853515476208707740122493432004556563256541593821551875493307105384962499021036217221971956541120267980545187955687312325532460895007498698047166579024456569761426023830952951615725855460057789800818716419379528870809230581036710814264859347634423521676429190389104937324562152830169784131941017460443818031326617898419111980205004884140136127826751799843667077379782295351707525578529061607299384029530692119356275145337781451430798118536207084103301911093677908438481635415048899146957030333082215422278339724654782954675839109214118637155819692225323479931945947636746151127817350357114919515898858737614931886909754397408154635691658891799653726527294965045502102891543622100917879929936307196217350945263687835211248520498227927469673729548330752359939734403960661829569739089268611039196882024800199898512176817926992505872986472153499381424288108978045657217045718142525239197822696906400336051139618800541008989724816188759982674476724842274827731561510251400115299617970665716817424626286294470434599135134571363494174496558193372103346602076890240721787029863750648231522641534167502607678441843490874818069970135620613617315883362256688852287735849398360596626008468183590417949501686637989205969637951716811487213391179805833846794774960773547671970152832966925138409952998967486618543736461167404615601429305799529556480003231087278883764399154951929170917160217073034085746964263788990127180492391260814423280196366111004943913649312534673737900335833806478628807347810454601373543317870478647155364542222916034847344092674506338532801934250219603653129766035938318951874284223019763311855876695825227940611226544319255878552289308123722451713271925684433941205643285010772174786797751064640150744440019230678299052695044592039553699179063282726745846133684607718089511643692806681576072275568391889939133128392168167568485482381899039858775686990325887241683525253761474503398313249309441364228254983720014370194754920810019634467394116898662406654653809431426521090195618206869833543734776399895686490993589790590218386993032289185208190061094537852865940058379084949306115673557077141996159545022804216292338881234708446575539168888282532181703408404719333867468380834165216553514857161603086617726213437233053507726471731586193508604439069079846324535856986236770280896044841458285782324388278579623016568944714410284411266991900572330113720002899085337470423689213115874211049821744236620081322267408931562886222826323027077762212793616841671376817483680572579911181163975508227396958473459663683332364613989451916955684202098554822317922489803955696737355378616126670836559679133985369704515760958225883556854082497488522195392035783114216371625049234179353141608698768537576713780512518745110567017506816946402488422374561056701864912968483575735734039909372122869070095931918750751687555810928789068461632154090057175264288013140354517919062025394564298470399978452617114744033793757984658784948160324362148315147665220272860345436207427123299442324117690518302890114117871834855616264178328808890474320908339614025089984556518562447427303308053106549151042334804182757352491247184337600051150903513261337354704884587351863943385512506464526593252381640400522190493925879299386193166702609939098449389517986766452712448210085750680390830848957506936491358164172248495164067173311471672627475518103929653416181253864619047863153038173570007475399509788631086372485216920258287228047637346076245541212179824694269281064759910130991722891841726276069600126503801458934648126900040021262242034006813637169943025233442909402646870678561444469598754067651812228081464057233140280549153757476112998454196657113239414224032601175326353955446036477202985443410871339270175958317383362089340191913836347642666425997828416531065180187994919433998044344494730563202490784280862825762766171742314380431115012242033458822951596432239633004052768800076420100110975941332005942968899801699666935473800035283623556564685554269436401708673843980498740354964692569415376506253176753838040869511837126754362518011304637444935170628301548028308654973015202535994601987141807401911863276451324245940026084575841646023267078821232000086902924533664888616785664969083900827096717300128733904003347058771349152348623906292404687468372891007746215670302623060931340877014622503559899714326655269630001275650744365613715505692685468016319287620994351072767031339902876149397026159042463345638971461685884819107636230614246513008867067736334066107855103353311415927370439488073980209403179294640569384613987169380830063125691996750302793569607776301381454791276082477878264292025759859206046128590618697400079100722636058017126263202847053725855684134984336765020112136796849448844402779789908985654101770500593742877562741510606424867287663961614280291373535956619475401430364873176029404185934631615628654406537327102594069309725184811060817988817476180501179304399226238362284013694870082494940375182728692201122075937687711753089327575357657895071949599685653404305705599062761989523251117516704676616490667299611648657034647853375875648403573197722880297444009090131349440196651645684215840307412419931107579723386609686160307264848524554254821956952396277550287768817633906264393136730448317347249498499718838002208201603877927791891374712410796482255915004473578696007074431338438804049734312014415753134921621603696491624807675343189406298564735802026505506621510442170646112446314056902757317675838910914338365284780324800634063384956843738544751299719232375294273696584857369909085002433045714450342284220444423352974881936501750865641075178509418330274784542794351434457780184074294587856755099998071608209611326317595918889630831301268881682875179152461605631927870668165381522453024318140855503679229812812059230999328617073245175342355813954000651042470217262771423193384331566613163109073131894478698460249356940405514331515061257219890778525537119598116618435871715677485670860040105567276529242995868162011172909045043206727562011131644688329888337144663104665321353235901167065733753772930091461102037613616017476755460426038645394200768266027379359992284062897530724195661437428878610501448931548369966345486625194584048293055396084361942171725453177128389767575858455422348553961221462074229835551327397953005472853480511560288037337725067966762999245587801672049949831707425439417436405880017700712729906252647518401654803233243383583764141052105304158672023846897216087260488420732635531442474940315480630725144183681315840267967827828782799589604370048059299643476540789182699086810228333826182270033395718554049757066931068277573915631426268942643159809459416122170744750278194677911963129486165745064727303734388075659339064687956705361598216745078538627469353271601569789283835308932305156388147738673063389927284287754635566228287614934810385171316809266330300482344016212896657441391257835916075697211074917830199260624161783378149519230010956492051265439799280365290343101958803964556240683926138372785923244156814732253761291505539993309155159963510852617046943115259207666923054446557256551042429629942948186758081936755723268944661335302044396619916764562643511401926559328684814383405029929761107482838585492301766143471205623708387354401442569216236484767144218474681259720378742365943214479794456358907640614358668664371580021092985823190987703112690043632949877658577768294714280163039023776071125216067076491618071356196273069865098844165061168084928073961831858043500132876446811626465388648433090081247177403636476901992146824526091464970375568212483800474751377642668783989430273155286010930816911560395916971822090422960506632036845556444144997206061933549039197381197990713332049664791336085617319122154499768520266890618893039511374991009934973556396357541643051267361623914209725165303552362056412337622603418014525615022006745912593330347528725829860759219652637703794809789219878761562864705594880885110687346987301644517602869178748326615422327885076031759414133601192123869460382571452564916919844171954766959595507040746507590832310380969136742635129961746102878254288407383896968506970458777953301572260641700898924165366524873713026669666078449349309536776976237077111843815785952423487362923929172255038806602329518024754556030742131552106530116009008031635998326796901715209975818780433568982788605627344922368978299007088671285502344582564758706996389541859874852794425719049103708798092154046193096508930140903634213289242183448895182126851094439418585729687189250541557676018733269164179461562013288213225275165783191401802048255851502005533395090006941223797298582113125939034050514922698642636561525684004655286680024534470709485512466104984266495888317826400108340405034632033090346806913520799281945119609775462289356371056427499847372081435452600714228879948262328314020115221255807641712121848892328669058298228515904410474384242301993156645072229454189678057474029479009893228043561478882744997206672378042228196770843400762761562137601676723307949523588658793333552847301484262915072624740369415525339165726330407553744641346069314108714027639520677503828990229418297353887646569173814930867757003861010978307586026080952283574122651008908032366565537275923290756962371839694983617935585442308219465078481141266855760019165956975177444037870900263074802369032447467816404650160715397633873914112822341944459175108393536679904755161455507971416877701170560121031767294587154365343525711679078198606135721933514852526413863530310947026499148343803760823651927888884853981988373834098354040762080046719900744545939304770016182960652900835360950375517626786442414146413732121803187473327937444375644183438082560269003676777116617291698421102305391236571611303150533947973723702147764637255647160336407627737449921000377087691982576520059331417151400234082736658451726396459815751198611722483301041755408940557833829046821433393766714324623245441346501851982487772590328563655673774182348337949835464905778842380976744108410448084742225847911751404891567030036679427997834797283108400706597645834111611492642833046055142127907633761268433815002756899160646600714640272762129309399253026581049026727854999933775324305224266654765252019728098389751353858724792452692030032371299065283384631868969479954611670322347974953816148037517181200587950090752889515460089758692239415518887891802723755756724526689547399999458541346926691683696880461104562854269325575519412396225050745398074252504739691856349187917956249985941410599679329676222955828734801195692847285842401886758931046846234634359569665901241724792443806591037055247254209678047045138118863436041903833797534728133571603554141152632012833327655632774002237161923920849861229943724437467405502559705811666585153536170973362658379310611739141688173437004576082131366062707400526283390279677985901722499396283105022640302931759412121133444149467306295914226234497478387277018908426232331384534427191833715062835520571309389320162351181740099059642902093001405368967899296562720413244976498100860697301861911275070015849584896801818380730036779586480842406440685656072300711012098018898001900805017798619985918074411978302621133053464917297466858589778008617813482684235445262579367100864127927493938741293516192164863949164079078971921332195780295688979315886457836723811663643365999124333253276777015071675956381031091979794712075098563969704304376834659680287379405386678000639272244114680015947874464447244694750378244014570384301486814076762136047012105349198976347644995231628334602373934706925277948308288378964218204791462066414595645074086008368241249962307476736264173310382981768253307820078724767467270113965393850762128077852844737019449432785587716794452320088435631767211605150757817727209496666201204967197572894032608868115686580979014517312770787203698851298176052575339711332253551812245229608120280186447175513280412295165431002491858789790711783947485408732572061458847282672745999773827502453251735051940888765796883601432572196907851835098806638626825552366557448851030341264305681751179244931438490404342706965344609210508119086830340014919797875793788952976468396457017122167513505807370512365627639660811973035393356908801324856327780295371710992421927069439282409597162001584158786768699465903166559400748359444338416689151901645632372946259202380958129268470511092872627708041925358007607794144902275155770593005518648557323905136713155481993227034119940991717332415260151621001935518053733579938978265292487938319282730006007385098956773058920166758388138822135212399839759695632795731753004904537245690515719290436704242099717958373660836170675321280485863098778753072765171373563395694030103359431823268566944686118498154063732155357889321000423765215913045621841193829652518306654586636839914765961258633309063412313119119084379255149984051950114969320172541079863608947668820838914692583986218482385210281597130981635192035303869267563979729909425063296688134395716057060338755199906016785578528364339314763070058559974338799311776688508754127591986632164686072860716716010697645977689118125552516406242406615801649938430987072453603364960825669514500876251386004152074385862168337182291066192427102670127277557827193258371534679735279730988924016909155373306959065067360624682689166244461843820821936801205804845508748669998708941965022428016851855213487301975149799209280041909209648351544126688117915486968388890826825916540286589730471321454519082269104418182416555176348763746596506042750583800393854222357702293405892998936124530647338620045167671330496055659235729329487588627784416751478173473292653639110877834749236264124998531742652475737588243858105513445166489836589682528703542297338055395336740011888645577635472477568898076595439207479466216952471382993238597355894702450317742100330802300056652635725425649738220942758103835081764080656759105727740964072637710498756490585306746415687272790674808929472545679060474159633658353018666127493824392687078572864944438333603485981695477493882182011399533688781439918178784985815918958732848591821546297463289663910052847771560224974866618755111437373873865974479744604719502579352276525022008675790207763737240979004390874027821822421812278949192428878691812126400768487526824569473177982370396650697438721087462223573963973789395746669557174765902484639188877702305887200602967698261868071801230547339209086059001232194199075457951899304119851167002152431710830446018376402721463190793499960874261571440212573491368535536878220600673565144386666730460942990972105149851881361730369149163495921867672060728827744965620049034076945213206145728224537140065298985548494466626024021252183988239122259824130758747372849922997926119005087040034138051774652568952777570979580963423543179139192299760689842696277335712602502118645114636296958465746690512868265324085537811046005474082712435941976673310726336784897622616761439564791326669949448088041940665171265308692797605294511000785087699459568948365323094607511152105798864538820581005351438058990500253070608256741447704487642552123593323020310060585269786184433075206101467163512294384578719365466634271586224231381128694771152837750038035465582440580082035289648881272783474019797910727723332020817230085091851242727008053373621458348972145766517535110068276986696988084798459221673034979623305232650108740269246359509067608900203247967976305825618087370227719627536056313506694982632066860506399366449523710851246055132517920603044511284337939613923901602769590785569753061662340158122203863148950084039149172836496837950529799255657988066472870558728262121024539297438141515216699644190619335509152677384896896303950837301048247740314226793604215792421366137230032503098077218157019673432451002561149603752742946885702169820521283838304154087121669471197684085971319538482312205906745419745698255572523444998790030257231199712339635581091952148313835268640714890737675062456090322211799429087740514837659141354626671495397981628627820188692705044489031928314242817778474484658459686112533563611473744242288713238186094096455663438485707877464093582091904712949764066373863092105823761216416361889351978102272066253525543061107882454620754236166975716185016568769505376678615789154095742332784565358797583928872772592663010164742273722647142649580650564943751933428212760451065196056990914027620567918257507249320894330209021541282705985532356034891584124603233893277131235422084162713599196777396379175134584827801255545399092922103988370295276889023023867501568699232446574741962795789797179452746929979856693796336326822190258732344311818032834510239302009142688571155685590638251101982386876066279005415191989923714458552106937719019288904489419424828361643365762718633600265719928182538014154909226383149574743457310374295947293850662269153718105022362180693836103148078819107977555552681721804222101541903987673008224395101640855776795515826325896776856988605453646645759159551270549997113613469367485060639364703571694090518990399060952869297484821837760605847268474639175402440683828127027318640319397436683553692461524551043427881547997793284374930722030318623246609509560269540448650215186097091557034303693858110828444428752887547349265687637057639381013524295871082949651230924439847976871393516196526903812466348598203141244708366264308031639688184847606525057465085151712994969644309188282068634586822517130739340030756085824168730122525538355467291282169240063910489214223108881367531864705522557048997534588871354145528391495354684169487721657930384376216944983452172721823329239311803086691753843922808160450226402338867494949845018982590807343503894221728379634813722688683857633428003102514561189851466123824823423377221471220104470978259614571892087697544595122941821054478770926778410491205459487342833832343799003876189048035548468330610760843168973101447205809501674967932280162170946183100749256555116270129878976239128093359521192652872609251023584706400025581372325797721559062993520150695008253123043636308937750069478761455657476728502244300184085190548089580791610721504215587515669845168459000898689832229039827569695932431097566357071957448204416084950786323263859920109024486943959104370638054216970730907138419165804310668870934750001889723246185730320763803927966252638178436678558093798972137786427478801551648127233655653948509078109300397914640033775478529077706195883570587394971995458981573609008678836470510041552299333732897340369403687012098909113929557463276645713828153396958808637214307235584006079445259798224036836094497569420904142349516945277878121639594106690479630615414358640774200052254097332423795460874763168247833316443631406886590876119912746001955604365919219521339455351340650351035134525664305676831359278168183825072754161863235425176410833964275707214486866448231530647190279181809841328985357153891813271959735790053866391760365999332879906572859945805313633983890101300936571385608244127144602028312866025804872540193686430683525466656055514038066724148767189644206735064381761595136557425876946068837054838298836396381626687783612245695930893752240993158889326573106818581846507929517802074306535277910952843839058508524298161855644600071839497120583350245440571926493025796878384065336073427802799420494166926192056149115025641118351026142346316579343082118779846930827048325951086077544176469831349196325385353644574417555412667117927959061588069832956606258052811699659269388348235206322239793642816657044833223082803641309290595692521663726531589347785038464744690932824723385075767145654354790442158433249639541344614443415691990385140355981628936568927186912486730669249290693623117208315325281646682446972800051546478371777897691601799589604766339239634791871774510513696885319351445371892097411943224214670923109843856755853546342920595039404788318048823592709885204215834206682588126774214335011917883773449038445376219726662999391188752583634575151050290518976237804983483289037481047294400108451854759775626056144007856829629949166898754790013159440450703765236828681558345132892733582775585207785059197951340043190446400610019038612683161913415656593338289048647493782643239787547873493310515689348396318873654305420354845812584832821212523233904656979568289941177454540628865284353839456879428272210188833931911754450501155015729819571221197168298832601377847642740532745386224246372565951053458380712766356428751183449309857911356821403587135574824290940499165980182348655945324834646565966810893092400286389892953342336026368357364809475295158766731622173627046151068746519352756889146714118014771051630772592255718860508389630038430327050159453845715217583651253376135168623480506348079945779268784114846141835796606984108498286601167039752012446942414768601451718235909800693856442441889025999469473100354883196493921306110372851601314441930259154673337267251473802605837476671228803219610051651416680007591679931753248980234422299232958248783973407999498266239604882220045778606038252623425782991112854350332097631267187380470349866962736942587846202783503140081747658632337474264793802408802187040222713907478416058909394059046260975811852864310773428349209563074383752522482591686574550109568401775700274236085440277964384735366924408724125328083595434856820490333345294462886770251568617968744668096399172702424393692694396515284335214400505479097351293555333119877759255166497172030120119997957779785803906090870986362255853125530524730674610579759860339944034477369570554524375523536036466199136348403603723286312699617602750968072590989052508504883483829824962733857191447817693145553434942671259604011700450633706624832942943991984451441323319733984242165107785173524267381534240054709370730385954558417819819588290312516136393813147470060152624329054117670066048792679959052193170070501192067675700800997203045856194652992770118012393318533018243510783219844808281388490500534048389432361682607477436293227210968633530514893887190872834074950400652287685114599709632174113040744553844015052800410781765127336488367667186951175027606267687423965672547082176901016461487070539946339756154893276516056826886707903520415599967273683604524500576018169998349750971891147496125624376708378916403168296075299548561978759101957106081007716005027810881898210593244473243590396815685557383115863021261594877680038665365757259115237778727848976801633504239127995382383728326253051624640712728273714632613788212864307185771031112646026543450245814768301258680534341535863550617276818036649543813861299806988831101833870276334710150124317352361705407730812811461045618705100193068803761202909518059900021380783311303234585883793141834937751395229681891604183012622803906157268573800054467320639403643717355954102974446089377811343397475932523844490049746733629348785569451265622138486275251172770286149698931677419050948478666164960445106160472107078209890723979600123494648975113337773457018179140096705317510468561635075382357217965739597775472896896225559630492758035587617305988294474369688949721670657606697833900982470654224950709916661384605242944873345199079406423899926958725854457673857411404797463872467369922963449446931621033780433400374490879812792870331710676094187898368808139909123339255558311967609152695893446499258623554149738001400936863488555663400070671024058753434898161177501698014466357627253717854723485759913776028403096945103807166309521998561749003787985104973207592296770825881571071203191945490923175516006493192179076635408961854952517521383156188838685825268106428007144711983225092945609981096959367468023727496137600104138542260631109844373739481917472386303034414632029323028618976713483732438309867192272653793249634542177378528643647419106297217208973658284818979211335861941966145438234571226846447983059282561368143954624014185718248619915938645662578051401797739206352489988191765421295814801043606347609169956237619816179775390580436399906011746721079007731021644257958035079515319886760277119907987302832079898618307821759178132067674675977771250010433007683857259116238125532352695861128990582563963409214662112390973369484469555504880614459856272663734390666107789620014359138236286491668407496532687482369508438638405402639135094574628422701017690199860981189787914470686228908817739660464376284697442030717614729716783383690045777646431439033458707374288352323937618516357220541050793642817327185093195125419153462898083174297107485750549956392545392411417420248664582804077556462740262569867557390032238379252600224486813678132920547397072263770689857320698192946072864355371014102014645656358253582523120978281307091576731180307691057138001786491470840810382745976811686808330370163455544302193968825928495090396608594399342043005260517427581165530612824213244538587624493353721181862983448235135329836619462371873143507280744323407693790042004630566088295691470874378846784444586346763372400678998612509853879744385648513896723514341090786411839711955191327821198985253004448657148453392241764403140769963377541257561590203026506934611229501384048672199533408074298514304075371729884812429424430940477151984050016625767956955012068937353039689540288868036363781157980366506412367940339113611666025658211002273134625419835683427605068158922442952501871922855181589262525327901542133689805419550694834647537974695507397701478593100709171409402681373313631736980364821413029884817126353475138204425960040329144212666714416255969272932587113010962267785751339715220476965674521432384769912877551031318999396383189765106805208552561808755471131574127743090547441748277475486808810972273239952108255475587137461829652077205686394269923821581785386924430755919317985546581979723693261650665812388087002494125674536070830908398329458466976129859506217321196562231525908289934722160067957844474107044990607116429248761506301360881100516180454410310105012238589988187661600541231433322109531857653440624778610906112185790138397417514688583451932171907080426257208383463261145720470693386827402902906761431422223843081318509256131082297809279749402938862830663587871454702570489864864501629130909445400330769487294515739800233951855176375587190866982995726364349633334350890170985338624770730154226470413322235571024995005885525195325476662423602312594409346962978375664944047128481632032685780020925322556597088032103652395649222172928713992598111223530139737399842755968656482620223927840216065779525733812361607928904868216657816807405858017703139952263696016265605260199723177312368455976436473451388670834456839084081930417594384638019210958181162767658818109152929114011859809603818253670858350065771125052536300962733642664290492997032988555588813795688668658985484954604340810605299047421034146638999357537193673839991749282380303466109882301347295010904824532927801203883861557348870087759041235503865336671209101520078550015999686452143196999776784210827425418169641654802767668493696808035698787139354595090015736631571410138790900039430325207843992273634294058789928827777348689788787655296684333470777024286101136380216228290324448999743650238069777883907437431847135049628321377581437917533029027004227361924333332838883489969423925844813645614611364859626867722992488816554226685248785636588972594302715399720572307743794273875689817031378806591795902927519439619270615582991197936453085948561994348844106622669763862971221607071257035656816365277246917657671023402658031393182181555754466716238767512628226647395673954255818693853503675074262191360485061319511313609644172560498027155450313589120323713985524863647946932080037016322394712294543424270339401467294958371031682818368156925358845100374147452365843500670348820742026704745813734080766489207918076916261700975587039417511935598869561685747418166141866789264241450675847359027783939981779577462047438120194378869582616887455500935891331512626128506126561068964719500039420265866789431225789407093272384972016134342834796786178698810632585758977208676880514448721070475129952451750920433629764669481422326289680374124464703538409848854091446477996465513189845937486860547715245341102985787480262742170939888026126154715125739484002985369105487093735523186197200260221262222880201375066792271880973594548026718508132264092684879957934053249104537710747001135878067352871459219409723977512513349475161362364893452790821870340077046064683659776230463929859092882612683581542347496934783152333629920956027044842019263378969265012104090061554608074782425208744705669479488509542154832659521410687150377321698753228001220773828701468000775126036380956330578213175009656650843371099186533398666002079036144205866541888885948662155537894346028385172474578060095375150686386013229066318374794837558884988582563607800457344904200241373132272906024508736555178226981819838331160118219697892619100727432046968675119198234137364360428628498684530491587533623413776524009555329056808147892003803038528298564835543897116160837810151650444481776089006372460322872940599421970312389885768426378750591298141693974784965735245833164661620433800695996238605981662613024065695627670453701122982015227660974479920035025940899616457008362935304037568617669569315526269947474422477065976277665361621251798533300713708628260828595211555154132233663884465309820441595449771903312989823195097881564746391678567611659244036669955148935898221180450238731703677692329028794268624093896867439914418952329432583513753266723976871082651413043221119866809971380253727102108706749273134258792128675782448676782109304726856809217699839296991955679716512948314476535120453400209214056638962419426097057109835802794799758302482318999558885614206054687151344633238941285946549608828404625948045200261287281152498002629891756342123255627410946051656466024047952411239882648061950205112010808541676786758280703590099230108859791909532081776567245803298236106612710313744124055221145907955459625342889709759462033633497953063825239282325999853065589434164099712790360422374834849017972000899086025775566907825691515551598046947806211636201289019256690862274009664523477871231399359124084429793126531246084440888299484742032741644332901605341187244621697772678036672564037096479932870609886479867525979133431736594209990368059377209879994215434172407614451643889759513278690291975321247247676405862076858089989866059395881486684668982907580611198523976734608650189515705529342130892104780642589315505909603524936886098263013873239831591554928074111284423943281204013750156472774324664722819160642829114525534661157830514144550237083404552522538450976560511569636755895127235550631882669079021792830210401936896949803929708049737109295697343705090020503801786913820319565860535461000442256815832791148255055702137741917257714480815223958576548875464395926532326273389421139375695274210864001994405827573593671669369235418716149579331956890450253651230839799246252088109106477395889595905272782598509799405265313526639735371642367202760324832329384688767292768686805795533574114565077936681317643572865595269666396469357144788882095735351131568405422796644290406821471697730912460794508764563921240550519587807267059079894905168035309039974388225301596417227448179958121429386676869669977763999915243046866221873516848851573380629345584599445667334880668706836769469435835499885881695714572662761698669197065638321492261525579027515658780350330897635984873042261064889860138751887400693765555589494339788765617569246221341766087980575704020778765393250203130680717041336296676062593851064048699477538961486731832530860061021301457646684948625491463455816632304042738878112393755761717481945741666827711398740257834344020443076455133772907561287178645083948046657189325093603569900134714788004198065527765105650865536253484041343388455217363123996287360444279395706052095259623785141096434938952194075934071889593616527313988532705975853236503092793208417155960988862176087558227300574843285161510596545129482678872388015619293766735113586735347568999416733608777233632045688275996280212152511362286775987223718932033557199009248101361778924147179474217329154562351007754341700322239173233186197121709848633943254105761308087827086031585132623568503240479665503978187118023651546834642040889454055678846331469690204357866442749956428412861204154847539973284428322707433817391196458514820489856281996075002610221216633296129953697096225294608438353223704282000498106739440097174732816820951796221708057733816287293157160074092135564328822122699085594357581575701250210963155300130977837609179438640256356412795549023932745892340948902095071939295913460782935412859117483237079165058358812968687462377690885431505640150915143338414440434634817797152739270121911070114571829286427024725593770341039845969916094740812693508225083688503691682097353702437772501320749201466277639254251169758495519601410500504220207914502815386045342562101435859632041078204966477625661819252518196314615543756241866408574515018886357369985791855301358311167825784363710234730181804156342024161961521841634438476685169699969780716255544301942655613453963176770927777264444155902386126494069026989576699316427489327265870507552261648869183903198077035464829239836407154513616328599750172355096249426221671790920552535805213552418741274760045924207223844544988772993809783859827524884074904771160196748560827768298902859739005785659073908172605157612544509313305696414687840741661591604501359630691246608713059181696545252075259971206563639388347813304638748754228196950857874166556880789089717749055246315827859640684513583391596136458361150488049585521242246139246462180108090549963387222513120033678048019828742882729407250672476033327772960382201041224991211161281821979460312623476605739263717092800313432778879225860743290895604841289211166529462066968987892318006325866278248034468067277458827658623314722854469390653223247095006825460770185618589560178797468781172552609440348212184673428618343381747681849738751659902543381642162930814074642844277124917947904928003549515069686293771793712243214254693668594830547058915430021806765135594116293525405403904876950329248683755612731154071026807053976323158128733836358608757091678353131431526280146211423516881667064239940617223715175537239277458822664018800743218059872056062458748973715473631736788769907786691395040551184492146333141051545189893251217168678683535847202227108113233997055104465388630536815331535916500819668500705319824347562569462846819621941082828667521225314816216754688741004814253858938322893924412012981195230908635128721197069909348302226760275975143249341037522752482296688380436068173005069011542158517126198056520797252247179453341358656714247932182067144816435268462758887421753615319724961631435724262544441275435362266794551154873257386311015272134656051326639457667943484784973282218092601839917105004960201889893689181384593205578192207045256031780178724931088009268545993884783581789705676832458378042081555154696993777405839275081639669174411466407468821729132932723718467197548835362067547431775528891235208598689564826220958096714160773183594385421889034261754692587307381760561282101618960656281742187748395159630540931896874876232153897685679324038459059511371437029585049914121854407073135389046160038816201669773050644568452097696396645295560103756613521854601851702779230825752728310207846083624362472026389317379277616419301858717118262404135317150078382167953710048467123930995894921016206079404703361573002135601667883222348153040662554826333399449563421330718025476915890473713617553385455368756332753856041109434192150413813373429552806996298876842393171487708227895703383244627633889725368979855771100531963774004391911979930121561844979852467471969448235425161178458268882760504428715388858099049685561742010595800345604470881911715434215554442991723302443058280008237012335251254461248820526146572688118893747164437851939061776518846619402144415856683783161430024008589713856574646250404716874272308016363806713878959759319952076523258525734018315382842044497000920812573927099880880816656485906845892996187591709430813213462405735135264176278448821313940672553297832080217233620438731822224088515816316594350996190734084545705917097938323019165120123021950512045298450311652436205889671067279790010377113059214398592267291187302952034654359725982126371442710340023354091998916286237261960734689759466672984603988422838399530308281502726324896315156758429214507979170734219022905261688950248550933564487693508524808776157016673911239782455910691413936862730255062814934033399600377702644263207673743460092120723601850303401351863305102225458066473327606066700715841170239525072795211545777965886999239748505834605551035907105732284678876288337641306757477365792758507945232411558390973797145937551857135803262702187907883334569339131691058187159184674475301603617995743759481064593992528680045256454277874651800267883459975633508400990284605533853005378909107013282687450886454020722593302790262261292123391993768223315010425928792366452209240433192719014634967519872999719917502332352860394834153886287095597061879732248837411009207777038595559835194352270842506271320956555045185847556469243191489507724612199302231105233562557823164395018916278933692503460070313240294009439957760485002398018758819064113609950086413172962395998997676689481170422873348308983963966867583471488359166755595714629585393147549811769037311118350116227711153450981110509340711765892828530554868395960945630440722296917502333499935305510255649346955665092319389998028335029253778906649824612315405989811561469676534549822622987475389193632205121112214469098321824244517250944269314825951380763472625769581113222321855415855970067753145502834431170947646144282469644946073681913044171505368801811772382339048966308751811784541848658674792482723542834382363296609473775803699971491548001447311156958077035607157642516755811217000375303711325868943223592672394436363590292496653785739591792422742576729052142654996208733264554386655397797561947588161677157480206608615223883149834117042875305358384831405447173411116402186974653944320922357629713622399087892736742882716201151858155391269073279555090772480936773233306919240007740606681582344482625009887824522889181487750346102889150964946327406062676159455239673327421285115243013783800061623931328202488719517285357541670460569576271047165575281132327295284268906268520393147332930729759556594093039540050016077842097180559647280735736408612093578262703125819608077851557159567149484564461406658819034893751888029119242419473123037606897257395920254051251260282258961945903871803119727084962329753292394403991758328375744251112279756099592671232174648841267492054870658705114992753733291100138891342816796001068821292423493403456919828944749123913081588437678535331535377762074233540890748471903761868656529236035610798158474065851444110559273218101610869686451289739909468730826222677909637062561197343177624446817729945202743873310368502513063370618359886341261165611855009436680719449867322240932227426655317627939811449318665342262518446395266764185680223695413095331106618315768010046467383403601016816744608284098257439887288423881783419973598560363074361792005798737062694709385925390146775042289191752525730460997186579782786665680782929986028408838473047982515683445415429432485157939291368293916995551106242642637599539224232512487549609319631296743352840954100916963157520610351599469204857592386374486761006028158766708645031461314792828701721777491325040044764662623963695043154024951111620882387960958734827360925781477328327468321949661267479967957624772490124133271384833321677961645344582120598389050308958477091767159863619185991193394235288201395878570243753072926192145520607135728107165318592048367736811715047863121098714740757229191039774841598151277488606856239504461592061135640848263441995930195566283163803052714272312839650839888268302941358586369396728166496133647400227571300832380904253212189216417581586081887940702365349808770094748876338760011809726106909397568099060773359707014255470128842237985734278977572375857235433065144881023646835227063209852065278221153396586124016162465833634271213461785062621338921490502582279544376297319904378856834562749318673870477446143484768202668908284244502859039885976500401401905394345695910843018409755789340350592558255940494004761512179186628359116011286450556959306447140334804537711830949583904900106107351616787498766952127887943308570562675363516385295493376700377879077149448994852956566349871202671014416105955058677579530220335989274929582674120306493055947454505427472644991630671996365005582839822905293387675865273688830693805941127411394387184553158135400161649631744778011035195847991186377739601431723708241965837250540016935150779407352838688519217105513270882085333154946929271640029977050619254248192808630201319299798398557897297924413516734027799766840967448688348822278640835187516820297765602488378855640796197553093653449002286656807108812062218692288965727685320705128413568148702542272397633296665153101437858147681153150568432824434144914507987338601625871042528433702127407856364339132342451335304079166310120741136467775122454116939225594343107057220645450269302894145189334576821230594214483952864890514802608505992756308091672898392700412571022544320372573415079999520701854590550291476668400786073517506939414554102736951886243539501179419948524324678494673205202823763226700217129948350724728499225837531336168097572454237472774428612970636871923739425600298952252582001146043858911644538178717189148112918510631269761395401320938398994150612752012764521461655470815902065746542158495812017990805210956254796961293227121758543559428772975041211449010786547982343414542809271254603360172803120571041939661501884380186401381991591623084537562040467659356105326667654776226540843431032498319053317438144385357159803557599356233836923522453592710199313401936627737518992595929639279667876715370282934243128944621524629111748658409695525601148233543609015172071731424351336358099310627541627307580810927955034513901875453394842779637814555910168286213547495967834561871841657543661581405119120509215752754643559258039531992050011963376376744598603927674940106546128597274408824079502145319576463491334572523842540642722196831362840739906315924032136631321808393264521572215967437242665509178162267636279784463783123050654382515753130673366496377805550519816934786461864741092412332801645810725200226723154997887363055166183737202137808942032026481395041232137381413378723615107307075375436370802869663402092875310960191006000152484619202190228583466324227633080162074792567468749034700412582302168621043874459354686100600291872777287784474018129339400790365948599567602143737959242940570007815056857950119995396422134950542868778251414516959694959240354472440247510757559452559444232703946969246944847358605552723837352955705349032000491403601853326778346829630863462962412002986884984716580937007001722312235965782007982703574609987446792854955440085046485935659156817439446718239629080602671642717540303704241938578601285923971787866868356412993587983928732329246315580654890976725669400294990514062905221516948217790392898178733075575914957565362424409951224983633213469942027414203980517592396281987212441261291751629771882392344525400365531243427790259660113535552635313036196904186883845396345145758705272242206420158943533153896787095640155676144042443498714217259239671252621427789960519845356705480075225290914348256883616351246628127552560295410811162467791184835039625426057363603356526884416572735908104842425852768534111667329811133522772351417348100044847270499303892140453819230570423689218508504400833788722323858401662969835316441552437348081497589345395721390034481113199219638042109302587388952691989572027267401963613187433789724898453347013900927066884076312082805542236360475497635806763849472057791264120102535961303180182593867921780752666989847350940846038816440311854208635664880901514687887114293512264111116987530713940433427686504948757266453322147971790134620267852724483592569166939226219553051089478947823894935793236686194415726067648881357668192204300722352158802388391047005976931025747580354141807474310771667718251898791933622369526441863657085582395411385858790455670804351379731153713701297034550269877879875053100331369422431244342639691644474197980227463916463287753016724077157881241553555065725352222166915550784929464212701666094238199320728593223678440546856666717467198848223575427832547609183104182888774429025434425485007688698967425486844290451227470320768538516415213029335508243388911615759843275734837537046165657915189957232012495755290894310961735099698558017145858722764054672987514643827114891976646030112925208970371798056395297976689393771216809521657979178555767346158385056633736886890938526799224701555676376147385096660504487498732799469817530845867345616900522032617896771333803844703803122472423286923523891997969572300664839479097393170609312738889818266652238941967219627850635838622426426639440465299701949134713190799364488889513219686587243339603814900830446926389365758858637967057301111432302002847128559227864423024195938760411745523810472094947267485039157231575346872992627315225850381336545746886023312489871695152114916964139905676154225515634991694684447440806394898213514819425088958188600985320290894723767805537282485448628030177306117054302153220888272857368963969623711304688915902130032194315047726182594801316958609330291293904440185309296212753003712938638103771294241637635728599144506453941160072592551486262632689986411974044586924638266461740001967298464730224840097021374823507362806617468820044296055945833924652687332455197320303216430261692932112434912477576827836483288289067296686640467194372469701894848445635676533171682806672821719832271220541359781787836494443218704822682520009697896944289085749378712995734653296291768250464845940707173106941260447729943142465503094856799098511013842218980169035420901349692424446827156069008506137204456274380730018583267949972721717753418499630708139697312901253364208230743280897464985785580348080744567545325813130470484019661374212464406713476746050716512428232763053898862492874200004857714114214326662179296551995651978890619615003702289982636300890237533397971001105580493654985055089142770155147942654715255224913118219476101992772442155243574633126597832547006061186269698420251068483482634334137258508042640350425923348337735757182135139581705991784473763549951944556577922492592980969995993011209869003586122802786249505399700345585794446154733332066883332318919299517104858317936382459844929416603359764719418773058868450590388116410517592652507350841871792248395081305456656654330039564639197508741006477615223607404162341968951984139634683078003809077641828871285414529477356136498620779039404062393981652520481584739529892387534390944991442895082406694335465999368241445011624931457876005287563465997874279846198263452042001074939634028132730619576593433855622329725540439714936490383085986375977236864104506752957071064015492039614182172111647787812617031352323678523049175652043849638809015112923883918439543676691514553092081301544585205423267152311882224821198389608858670970749668038230859790027364359281747527362277415740208735956093515098080409886827885924413804339170802178600699050109199791804699340528805576021934433877109729573941255476386855591631089870953152777764799734361402088394094875217265410561165935108840984000740442511548462834500199173442593620954561941935550909451523157081963814726885743937489107232030269825806041404918003422121770479608259897135038837130541782852445228931833326287535258445666516000691635911797040780314359576633790174674856560345225142764414784568927466567789891796777302352329399523811636321229798722351336864155105474520735079397951755385854784571828577241994078076304277540774440598241765143999658835620057890354612482278622310329920348880084899648971129373811462624071354774053948419011236291766111694897337502953926005463531301897352015640762639200630754698739203771816321444934826335768961571977322597906863988373430401525612887170749563487480552972900381657360026416746057938655970129506847291250634555601413971632729528339527356670768208567758699790141784770139429261958703148324475810932278440585351671248357131846560775016664271664055811687922971176553195065347571161438725213282200212140180635973663215967843047198349915844869381256938078160170884208293715250117434131394093401967087830621520783653050718953929990806301347350193347902162092345745219348093144809946493072260177850791097599152176064971700126411409519484616842373307374485538008829604748769336942856706162089109774974234997529508770671357404360651819291660072980247027444971995437456294391734169558827081294140883637645530639888004548693888533817816148211662507357582356435958287139426875180992241819476987813441898849267689497069992786301560878912533586332341792945303452372493388529189268603393768808660299914819104598565406727257006896529378058457815203248062254061246349420014770469867917554897412265821177435290959846645349942736855421644940817399863606042125917101934511678983571929808958475571444095473397293061916470826161287226333377730043816391017619261303859960985603799862731008170438366531914449725096961360141695210963706044632591617511888768909142503973813314477876156644492303656994920984433893648388839864330676756146214862982379458412671745010934557466771366557744519832976586228003795212795889782699874650877549796124239260345304775430053189342541550522160670439457222576993765021083680245229799716772206622898426074628222094113941963620100845876978342994215269091907543521902722555445677354234160190840186282289052790364047677024470254755110613254810132465673851298255820151182771152260823364239697600584716915017515049761828040764146615638612752806089803132515761443397712723786368976653227377540884558914831414870543158906124270363622898839002525261457355142800278363190978733287692928719297828366422648453586745197912540708548765023315798820321757824032608847596545498857296373743641597340082020629632904846601247562301587911080336762201633034036658061976257125087315921846177165745555471868609799779163316743942035736204629671544283817546354861341501708966684487594298650973878613143951526306791980939993899286137665800289450749203076653555739758231368504745381189625825422387004937081225370523405472715221948895882262276050130585857392734231562545776750935772951643007192153541736309243927344868474270725556544315153795270179152260096688993210471305112312252570728430865963683978789957968095367459148597960988889354360930661318240832513886294584330085464837990929128501620496576017878710325892418387906567668863705719484221768911718555473313192451145898569521054172293102540929017146998065875446777399361667621757522710074708927603732321177523988081969807130553692697025492041017549686190428734169523897096278556697211667707205768377287814160041725816105111606333312257410753382116840505507943342545098522673718378874754106796527698808637034587436217068151440848128277415871507847582112197357364564036928086700867538606516871061751022343705852712824699763218921601621890592557138112159586232519984558267252700719266506285167964115889735897989811161885922781688095061862596465042407537399075116012710783901202978581753594702404372437893015698434256700071640529138435577472630813509342901738328494312525904728355233674895095614835068670894804195787439362287596785621483268110149092142972648413133420469490981828958205560252542816620009032386269327571015293250279346831820248435202714529567747879858546082704025505855748221914846654673157043238143660199779661563062255197415871215448387778350752784414741845830383224230333675227293849834857114497399455895266255746429953818766759561080439965047797934875232442432995528207992144045000746207802466397290261680072723110507877424607478350761127036618345721201724455057800373446125077773317137606071368013442127547788552720046001247405686642484057087174420556740048435020730451640367128845604561412928512816846985751572308795137918413333165375054936265717899182345951013848015411114516772768749135578263374988582262458241703232131371881299493471230036385113188949475181860635822635152200057762978428515212727514924944265795296370421044034037309265438136339892501461759739403227468794980615925174864571843366019232579320899007385136825591254990936499416748621563724494221770734976292804965598432401152897925118128029739888156611167420946254526784681376679246245873900680344421788119101012291331413497621089883900178713023752157240861777619481199661525755701382723496887074583966172802546142105017976571256851778788181042728561252278273790411229367044720179431945845644498902932646341752818956580716659392217587321679267900607734682187929911793570671779228555658288043485861526426923772550845441030225480636478243839300828063946689011269060901395279670784769741214081024150710334829221956972611999144454707129111021297317756930512837038607486867508405307453980673606351178068068534810783052600645815476450433685594367387145423387983817190793469278640225773870193507615909580580959832898211420249335252526963857971148230346039010488718026709968767482424426777386631971535679267255891700744269841678664633741553965026151163644386741807002696447902932430237607810525792633925836995473783676185464551818646379548780625616159359103556449809275045191259416179648624060055252904885202749800885922842531615453966221729970338010544939539192638388881843012972034972011312224105360329402884891949542544000833999098799240988176516731486982991019912722597035285871939190541616288732277552958068559305209286030118243190049563516809356358682818211348376490271614241669076832475666255156558321215831832323016247061988223868547285026094480973905194712111208742443396174031158525060499774796995877393182325666231891752577632773961280459248387553089299975123705720023143888918053708419680180110234677007700811946611602813864243303889885955523463295643991529261293885623095393104405804426241532139273579025016031114982681340845659171087315913993120275933057015941702994828873430858637427243148188519616369310174254394323717194164360511300363475658287431532447597799754545993512622925053295852148097601991594661425075134810265314303560329650366618791172423976290858524135326666177813059709977626112514422570951370976964195906403433279575030268341495393392699020353282336133313294488074955970061219812476821134827299378703845426861426260082845608007084115822631252918640028462262905566591279036530593887864306658976491297470426447532800395479844984634094512446342893851992842298311181306387954819663469514892375076214927238710117123343389576152025644407381621006386669096719027423111242575859604557751278314760822177463526524820880711554364708760408919542788239959692746434098766238633289063426137432816412452227206547237792855192941632409839357192497406089834468691898746271743042335398641963369230617470610492455610824434885659962276565083175799768737236578039314969292301753103243231827585052773688290273489742835057231032079775835389500650044543014056061154594067311625015531432362502502055176749362594602089145319769369506523496761910074305299329743678264732444058431021012633859933952382724155006860387287361536190550211076388210922032489662125496145532490192256813302557293003880570724616208348008935365786099789305617987437452047995865148298033689508682128023967521144493007737877368168447402649424674725972071787842511848764620796588390355825203533532252179062215279820773655970968140021846879375952783817105452756765299990698922449144495021273011095706969801145865592355260587065417872450092816952802470346541144259891889903369014366396065939162347570306831082311106174904420743450583960442547858860026243767303829774369257531586150067158809357097984531221749166626806078378217379780661406364845264238125557895540516081366576708523245323172677777221400056057392743436429643029450911471992154779988358793616149019107670384803752945699574448882280643467030664957638544602299576969689084554467226966842062603415493033746623851414019668941020588335677458307798768729015825551027644170133035835912210520831722139743336995446100881809317309640398892381093865469263407554029123813160304934907149572221323822133085578293677845670473878808077091452143032593770862106388823024050246789768631445247597027619728812526455369138237789390425765533015881313270281073478782428967475455790247569264209658341584002228299959767298346907148130302306656186507980366584974401762639854435505566023045186222583098786662215135660014685091203514967216478240984968674591473147929338975557942176062327989438523540101890648103515526905450449338596430573513246187158442007982061816390381053817475328361515054298083764035696301188073491286069925894190040870359329325208575627081774665033379290643820607324540974529439810665939951560923669316984134986075359698762219571062660639141912899823306408487950613782156206787189467499125549156781742500217869489058246088418711636482193208396745289324481921799848413485604668483178337088286144748193237243459656547540688410859367699282044825613815289329329049068813250346418695881300778078712742523165231930456230660521555308826557739837487679497568654217712162741399272064811259755087933507074457785378344919019677381591082827030059919376581201254481538922782502839839599338779040885717192637915083111870863434320210786389457522201397801047221270946871994232142247456036229716925254241177608180721428428581802641355091180433882309784450148436650106475869027511315556173375442293938353576349746040091079036201019919159399627878078350360025615366839785402399812038777093770682269438193857363830235462510566716475922345660270262516165669480631346777607433131878738502075683113798658018329028998356822315146779267472291990816402951949509934001542186962615037975609516630387197482208786303776109399602620709019221576805606108123314796323727202859519135892177579689829851672075132139792374774360419335238013258123645002554705910407690366610507430115685882088062404103308454363603195977622193840657500517108338566180820523044766237921576956035221784306753317814642007759277216696317642088561115077343191212559484820719871497586340298883033312246409429522735311713254320126848712716971698102712604485267131325419461313440639745441847521785565770096937596012107048155080704987154144522924510803323789060211215851784262255662780802387610288958186081765193922466003062256370133987849781195464376881844817359500553918560917259590097093662529236870324263818971328948824226207391672169010589674532562293082229286096860252364386544373561714212323572203484646036348189856365588933045241975391658451667420654375861402122023987343259609309396637346767782184782990357898202448020126392702026763285741211507052791787313254567472819637458992496389617556236769482939688586430337026744535548276176175164805793610181396273700833383590508990528937582114674777893850436141673294306594305745130903265424332540621081247375716299250396458560856416627428693790567824818084543791599449518563507926740139071608799761538334194347045971905941182016583218481593223363886765116879193871142749829672730079329333796583728450707101776816941907634024067393008263022450226302013350190848332374363868270839458050748837350638458411191215846711268885198865949302764228745095513163532018697940330350236201512111126915983495815960773998148352212663511416363478421563974010152004494294627186072846804089314666139217317171548301717897564648568885894381546330335999279685031529343093802788622097329039419901525334868168648074135420271851405408155859211879807313102273484270193079247670472940156521899018568654588493447487981145059623279296433320808305070436110372487975773213610623696716024935060829997797872545334297790577493341863705983438131838040280282489063468008961352176103316345950706543023696555714478381165761169548424175033126029527820927164239609522508557254215860043593814520490422618971055169381298903587899510769399663875731049450506086234803651860611446441274610478797667214743309144477605637495890546719948640577520772101609437374047650001191776984492193075171230539716868501637833564665160961205201784889543590724844947022428605923389193986506392288637637125720387764921111287581073222553641777346990077797630897939929930527058954654236794244622354414546524099887245503469846879318646668156780263207207657404118060062073829560914342450955518579317386149152265323349069441863037618903205752089043447587395857886042792922646617918839618524031913375980429620053281257849666569843831594080953165320466208469321710676953677326425696404788798360040926177903320398479593643072776038451878149151494403525183430414409607395450574092520853500510216149052543908397672579758777972772727640299378771943720871890839180198020309805022240826853126985746921054796943172389575589237461186805520584860104446687757321852392270473580599231743640538681208486657510994718732961118374424397027759581992963445522549587241274992815254250397070056938033635295436764252289557035732299594503415488580057682612557029308979903743398913967556094917956968655349931455807515260097384822389564641539376546869304302770340107371114776098049155978978898646544821755934162708103387426684300994623191159789797557159388409174273621194024456931990210778273791477339424202675843588954808610301920823053362271247247247908766088432482149684940774539627034499387256193627913391305228873497944381285897133891586726994905230474960652045546794055787771317441142290709363892555055700099559298517527112376145129807994900934011839840523031940094480509614881959107958005174761931338882197496554050470617642429943895015746085602172080231555539843034537523176741155542991958280403070951514364899698855599468068835914537085763330416236657606475994350530147525971462950313191344646079056391152316272864033150923067418608110075641801031046152969895992957808808659416222378337339719497750093008160243961268678315362880709659574923637183507472913030335626743202258373469034803859973522897123770295918199830532823742852054147300597932232836203094541268872374304087981620199349393445731864635815124541339007151303007967297462342916357645901738295220957001146191049293425774954624373648171621904148282759368703635917665364455081342345109400694446756448575577179716825248848612299625303937186929151566825166068388694545560023627508738518629650785681627555457964460574267497340971293812082165649470107974455533535427651187044033214050347016526608409356122431285797025843987308885711146248779064146396954570187882451054818933848779971216736766592555417585407625025874040421448218290512275410668797003959967079093894393025557425446545849330074222054397936618246497929231933055162480991265432545384152561719331791760339501353929347564675219359523064290956721429707436771849877573111382657807827111551540257560637095598761012550473136926059403012197268200708875164092987547347039678733698654280716959089364184566827845524955920144289757803049886025721327467978542881207528927618511228010012997336671257569880455751401135164248756701963400088248891518561559241497343783647095211335475183194987449269204688462731555528286758407359937777577023170553452741754818321540984585999945448439639873076377809417806479855525535045724920804447602690877122658353228463565000897809654415783499485305988246447071239006644327967787673929599055619302501371880649747359955198196384355680416348658013931878160826164586154699432314751730702026128549744192611933477329247487045286282096773034065339128983189575248654819810850717372737204773337360030142495166805618450336839243705594452114433230030132628503090063824901404895067311783485188439291477548039418929568140373162884945461488364365811996189906556021594002301516603165179375039285892286337427240136262706867864479995063706410054577265138884514816719442965988064667843457697119166675967348222085283748729081814854124022806275495277025407891604203159039376180913862225548866963434536654580209563102882119822660465576569718118135010344393916545674917951524088624850636763046213162067146695922463927374819326262512333191828622042486191321954659773637393327603808676815554478356570722949156058244761509369645021654942933402389462458517168742633025985118620450989580117215125948028988620441789953739981006653773404224511966120352481389988271977536373436969781047045487581105862416875932369475782447901476363637728588869764641058794296057843800557843759363757745378698687781359060904808549810042710361020363391946960371920150444915772296528803011184071996607346219815617136001641137739487264692745990623292093919927702949667939570553727269785681273474375170477458878624820946803180144565333562620018911681658579597123035662400090704767326811943700119377464500361683768906974096250571716819306740784783053584035089391182766911241664504106833506731351462066391651281061140728965413294070616499208437467326249218544260794694722485245632369490243377660604976939998615360251748996839321764144610434706963357691436357401663426354220240112242742992849676401976825029011345177020053133296476604951972226707166450073266624681981998786900850196948681851446368098536489948450324970973484223222936688526145135420107898122328793149341959628980017506358345773063786784638746473185284753695997531949835227853710205963635714627575934322259359497763934857122826247597776334903887824642637612653373903635948213445357213943039045872708683605459529677911690689384197731317612316623339882692613833314022433502371246889091789240620931251474280516111194339043326272040328464543053438140460792652865049364001037955810499250240145148810967498394732571823444801864621994712423099042041785281068327654853612115541736009819509426503778676284940435457171653853402606434683058702223032238267383515947512104486094949065948920097474717033080171901547514907085135020206599084070744996725761595845867213246788859260461321676392351799144858939686953782796134967669245435305615196931209323761087056876650497220980035747779972674405271918828186344625866100850662969740972746271490092541312812153536324508969301893691617960901648506152837600550306551849801200542472490766467155990024156158919895347310746097820039727702525761614180031163395304726528875805003795527849239128036641290394222814496607097123397787086498532454607545660851816927096315986513949549170374990694281384327463926555339078378804578252992975964753892977208463388725825426712499944689070570540622941899479107178929948001992584407017247537354267866529054725057281068201752769402994363688311230172479930292613623696578815758367186644547801332627149067359350044504820234273454724657791948162507999930625155538352713896104184769714248733221471915865752515958361703019217477266902676152937129301570005684903123984465350091181411344047748229013756245250619687969574503033281157161369022374745993532552927670839758729397871173095919703005435923693508498993493768251689125525269153549716410763474584178050249174140834217501914935252971027571674788566501563988238423848312924765536558095871471715935806396844968574777388182863545933648060666037523873651421936253892967814805491389938160668492437680583905328975032236969731308425498280277407599361820252922014158443250213118687823076248067204377930791245308699121143351882711621160642866625047003457737171071996569897881235693151612930800885805022030156562546559862645374020951030916404769040926921021841046157471748625105339746114483860089264757360933212031262606886676533281316718342207116926190387593399827760343355513100305302671497012071538161177215041834876131060195899878542647072135086318744629788186152711110573646848325748325024310071997035510797497774043547567468330476806576293216996003273366623448700071230657984096993348131073283513594039389786647606046912745287880311972177767847802575954036620635421004352205207074491237262397025081708723910714205933251475783624802187554313585543025328920316225908812857369529095620716632798205595563358520823318906964540921413675298895397542886019876446023925685061321669304037267573967935540924878036546473324666779682511980187400642119869829590079946795177716879478292536664542890529725923811124095292368744322394323538125494179871920934922772648603014772029097899071874869043585642357839845686260485481522749386496905211103864644585196319815213945100021817930197299489692277167062574966875802923237729684334221455722490952633305179943758119277194364642229645055422185052864611339778646666671496958720826839399386504052841674107251197461776762582641132023703741987796714043139130871190080249964305908894851505876445215086003402060185482994650092603479128909294898619263240421742639992019691091392682601182113547804324343755567469380928710881480482170400360037794464046624894522745514467615903840365715841962144893813555916358335398822735017803525742348391070625516743371015382440445091406875552488588197543875999991481616643261815145755312570318497774695284348155049460025946652435393623374175023857586522541859599954908423492051959455910471051658135416367194623058260484406897616725474764453410462519559597083998975652060963409993399097419504315543818038348408921097005867311986680263130617871559722282155076085209413731285827939818807591117718887852092696672052014237916108146661008032525284900334923502258431923095050807639611325343823129826413834846621061652498433323004384152651453438660944736356225130812339180491208236271759285360938879702805175034131764391577638080490315162394556539696802056875923632382240674611843590107145176877132616408755765026136173712434483631220645822715200033649024051736055049379050819640669174644971997947705866103913014952383547490183108245300928791383895373048563971734198409968079044581274083824386884181170241226172125495542483848988768077715811677998689384736425666360030018944709471402494252000662940000081440823745316396720561346694362060023003272564046117617848787701800688564463781396662274313713187499853607037865517983543006045004593756819513502227885500432968547463751361077595099192554464736819957969252122088482597508043673726592294555277501555806658885879236724263458680086404570656419974457274609315949888487121064831173087045921900245870022065822238055835552751040134214607304129720017381362021542348335430468111648703242574821302596467254651014401018363993418885513499901464488195741356875238891027736805962653353444818932440672849611545362415337464776578788122375742181223394266756488208471926520004760567880161886204256614291188628289258168892548358624909011792812855958208938345079710535032086134201244200348615245942992085145290460546275710689545202010159949159670227580109624381383814894165915914163406940043697702164097453725018569935110461058531786277766868958949819728508964421750785065487688853560028302915239486076585932775777527592595445768243158822786731587088616750683158150130227042552109937059870091792988719232736509037541828625329682685406377149944264496875447485720205372054609403445134460768628961310505742251878831634544655037891206560260022853154154098341472357838613334801138090373640664206908322550549062245573971959885541764301818627793022724654179669547748445042699170578897404750598796085782021798423363232290715996075960483234802205709623262641650273770434827006194205395906791135304372153571581303905776379720969304056796317324652550716325313797218285061023800789549980607743646321159743104666139719994886821942068541893590548819865340788403702036387429599572751750914024128618052900826278457081048957257899823973624954003329772060873191039606259516520725029337667488600086706941150551521597051865495608003539128663731463860381861111285682884373639463423373995894742548365047164204925516736724209032093348844674934488939406075462051208877623838417779105349275651639212580470010660421066594855848931410057581191727819381621765410807950154368980025966575881014024206080046535271004937816175286382123311230385211207650258631275787047310218287663278787699503155621526608563910013535999606905463392106444944469731551208508189794703226496354970603768839218047950561340309845467767275732261721920715794073321133206849108285881544291708571938295518683954752367193121449281688222377090026331859135560543941329871450777717951291069683585939389344701242068258774765054902815180492669513654360584788816150887517964640434382213510228790004176797181796716744199335933255245540376861105987409549499548264487080133088252222282539353711820248605735038613968769366265481490708213198872170432566822193098886089785757646038572239732767517150816314959721605982638611936508766665402547175778171933100741067580415710288227115916160556816277788918962983882176145734948109707503046324609532037038330849462333024361026129982738190990216901654192813003846986047947060902400002233025993522461636035380209870978878726919506068532322166690453370944471822661329982583258852916429380843824437520838667405353317611848311106873322825771333347982640498068511388341541810451674231243017843951914374144074170924632710371436661945973326682979618770379007454307293808962397521102596990186927516491652173274874515089308172314928268315069550866064161031089872531995602182253852088874065861441089706977541787577821941503501655943439100820698956111038317787085013481469746741997366094581872338351822910037040048512237893236378966671805419063952107794177975776379339516935861063124894777183980928050147488059703653966086168770250652611064733899792128892608775334884811029731278812426793760374837772228225032524928990376150988607238729016370074941988302134674915606782014169081084652172281447226343190091436614156587423953041615214548863011228860831536640365078540931654154157227802927296309705033196465639248692521704773843358307422129621141041533817861120540547260818700154806210283132925927002958873427488285764242914004287905024340579784127469810535036068452263142837479752081822184463039991388606256558101661775588227031227457990095339491902003842870054009869680557884016677104024755194747333738735313411355444500255751202781171358055009718614864801881463345779337879582139235717857275314546147386390308931882136934154793258023285031748202163427438983180006072115895511038378090348504255721769663992315026350121149058578048070957642622931882554818798182435182042517250090447562898122707021595965651588311458546984296877365856691411746217179076099397752304632614559487473436612357016603138978132490423823046688170961212654853085859915336179426462178807894432152410267135906668366467486150156133057877803581357926749992559888300112478538177829101806004092595484855251665610077979294273875062562049741713058817490735948777363436061936616010262966358852056095401180586081700554470850856051496093454590961909061877462557348774732475487493442639965416691878432907265900786814744281156896223327827941872190962772767876139909041891984932275340190647582263548501776796517960148866403783792282795997365608054320377567216873376719343683273452025462241272150168288285328242842815081234304115042636874486243140619180288458432284941481883745012442035536275700518311924779902028193873963684143922955448721727406697842485118884630855640215760705328988999038724605656646389247006077390867009458828498937973862165608505650365483105244961166725944244198103820654671902805451622826899875086526892298918471908767630130154972132209471199799886772360668855185428870834129990555338756051008373970406530008971252017862925910603518902671686327681153746348216179183257668191108320523639098738884484859444119010645760238249812018133721794329219254873907907852989539370724870085106903840510742469572223110911473135942265567630606769028058905484528963644465832275593765525775057880614390203177152437559289178815392945178359767823958357036652585732923274971012112358197323389839800653752915731469052647704515415870706647916036142332220565730388448605972910233749603633426878668448651514898692155390653207894092061218885372455433315982894284089450427953452340170721152973968215944070549466432026520903499793065541143268798876731965491909758715673572597318552050516841163924752033888520535308110122815584327190813836209779785339700803866639827409952691649541919711263130680558320913184634835945968122822749979998477894028362762974838721732682531435612416983905179074232411734787124616957600270899254018863222044010882508131791146667196783625887706917907893344174626098415148129899541981860607560629138476154909958764467549722893407952684888233648409218812558577125924058544744090367057173315910290360028221816503481338887696139791987678657007621609247699585786568174225704452563777867361632818751215523098443773132786810153645073880755968406333087649945959646923160032175191294672626918935579189876334432281588721402826512698869248174197533123611826329832557629627818051983989272796371519402374370987255741532589808417900671882511767208124380804740291435560664447225631976904974164198433480724837367523902723220569820302371637280581664538963555135858479117128153410115421807607392121509477466663752172332608784362152150023766360770897574545180212397171817819590089079375409173992580815583920831060019972668098500216464751625321178172790429559428194166046458459133185430199568050346750207973264447227985892361721250800087253932493660151323313322463974015370154936456077110550845985368092023520566576432183189490210447100255081874826481710766537341587687926374203800367032035007253172808404020624882389609272295141283603461806770482985557601192193861445311236086117909726097505582287830979288621147186268085340540679110354464458794587375874341357271090660516736281983459196979055714205548211597102209161678723926166950537976211107327833165185125359856907507579735095869381436956952450055085489968844177328394865644685769084097406629736165400620166029255457088847251476672564443625890613482947416574171095670722879103746811206075355054850547556454068671030843440415986286865091768761008066434006564592016963431262813995698036178049312140067238832166783095592131903850472005183006013565560587454554519077605078400669545718349582197257387190368563448422566618779399481665606624899344472435589217997411678702509449763893465479997955371283775567062324928090622276660753995188083803916747782065945496719437970552366720231095044547422784681296393759382352045907937525192480056377642722383419439298701587905020229628808553614677324485147050322258928751333722491369649408434658458732600563016095744243252047451759767573718451215604459661327758672333376522555095894508969346803979989377735216864372023274112487919153497228112324961722000173394644538857838656469162514794213500052417184699047040339198904103091258203922070839214586241813549463662194444954515628322535276430265515991637182117286015792130935055755300937708925637976433331519807762095706908513159045331513111219046563880571657526411224464174765633833301038654419652037420853381295747113361127413359959186498871700369011335709021878420005177717471124407815247930504808968301293213147476791351974773147423014535781124526610236822215205211608177695795760710328406710987777362766308171122929677258643292407863339494110789667934728521895957393560877709798372207755059092914299652345180306418382080061871821098576807642418569202999399810369519429198168706314517794932386100987428619255113645722433211555576229050795456872279933896903269013353291613171597286490455878917950229852208849660051453041601742795140751218311411426644444649980504557805090547863146130832048706913294483201116408499801256564472653736069560259262394009274187195722553509675993407955985775294654081094159997336895962764774446466684354686244320586002517464586360462554034826393098076116386648005229307361742516511938915984500866336920702273538030862417333342858010889608686199436644450355083330987437964826994041018827877751852296576875616460411614542837749644299134887548981271077216615842971648468570309131061483103363570918364330282736629851909635163187043969797001563034903882418413255954087429173192284525434111166758466561476326250852174403373623193139854483922448735185705467516067685053923122349968609837841976891767079153943638267415396816873226238463027449998568168915264214275478969788772866221451176196136836263887915803055867416718898025902125057265822650341432769924225815565387699969422674727928295406385493066058227439328744718745789129780694423135595986412169353017812250743375631879822295584330069386764982337241606373136884871484603237737103397587528755483316060859952499917447038580862623531064358117368057986057485206126122220141241896991864287221385230280072008792686830145759992435417883465705012702344222937732175776793918280571719292710640825190267334270346106084210703680366201546545816157362140247386189417095905921513969916471549952504813661151063462849011244838540757091165378245400797182069433161378037335481004224441752130878248811226434453417256112369386976115034358954305736128109206218882338678764608307889458727562210336228673152604909892978427086268806206967438130223118607720831857256577206332899536273582168762601673645551203256019831171057178070500914735937977207932840726843803791593648812457200175805089217406190667037680280376206977585180666721602033209158137665395658431070005988607670105716657132462736100802480716640597168558601859924761231768258566365705138034694118141806397311814919002813428010726957385023693834047707442203852504758064346095092799992186837800478728992898261749528056388996573027232219693756160825061390640083398110421273377845133261001142798240032842861964108244969014381649379375876518773084043725444761709124836364281999186367636677034390815519551220607812669898822435005142187989071326932769881872414066926879978504388870280528916351236702167222335448935186359227659992665232403648884852233358440178973247548649937611572220962213786435957145134754344216315438752153704304054639658684144930239404861916359687689225173456755365781112062605807493056800072106459109387850179125063788877089935110793267530403409612159003158984642792833428051326665535208170631361089238329825301435743763943843566838592300133058476408916016580630188727894611802314766383911502286515531373648817664752476761196905265399258742873255427821969991973273145310965717212653529148866875045893127160085201810683719328788516055087945532755668483967593750540242104612643074546608141752059280449535645286027069708035493778723343552682446095381638861661669706909004776389120061334607758613676710064437524969814128934169209870506735951274027026263330194104758180001644639821810657353414529030850952593001281536937463996631090232379651730110083077897064721252878603794848192228154665454812719573946481634849166177265839431062320632153623958900376649095646522136566894136937675245283732234264323501125917569944480496053159335413597415513317474408988347794177501052636374653885309420566728364318912425163864039874516619996793135967452856515129601531493236684295481291690295983845407213689716822112022679551764979067245934716630083444447106547979714716999465873894235777307586298046385504284458568592738039021542208197372096673205095654902452534139074943315219225176563329846228533171272702654034049747870718641423994339139735828198100484272354734318107380022835158546041955613555762678589657803298602143586428311555739783292153757167148978722926069734036371301261851295877984657608327128024525538666706362267287537766066668706258580772\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 681,
        "task_id": 4238,
        "test_case_id": 7,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "2230341968273121731285689164619604412809896827071685189619974275617186753435315486004298044734704761821299382365266484341535960518230892612750356783950831747822154884416154916407463343268761732908181441383584056070116896210930497738598133140441212801137004929039077231988949038941148357992882693575676523655304953441710921778999355810563999087060272870412314023392657131190033308325889209078458381371729711205658243539048111334712680011612341875320426859485839712428412698458491521848306528341772963615294787839338948874233032257050378026998808038294451134669737488032129706421257394423277466688774456371976564429313064703535419341917657775744658375675996141402167090215913230760967469638936909423477045394898493168699949632488828224015132629734655365465201160181971933613859657371975310095420559564543933334837962312271505685193433369614769722936755305882822329700820840776662407808414564979640034487749620896631914432608184306509505882020757460307109995378135061234726468433296290016816778725846063361674481699714695118004111596809508959520894527422969907557468254306551657592536881871470500568854923837686442635473677122923792645008311124039049150056142407156295485006795264254568568194278163913425401192777820968182516995703284374791868132829404321919886477362772007811767772103381397848598079591690409953761997405348663072730824832252033659691865982908253262760693313846892251066693805846447445985690979252103427708559709903543692206780454116888569345637103345250992576062576053685875961562218667611893110907142597181806594584307746594880192009281614675469199408955561069020400284510208835700210153133271873827533741262948599011878513479756190119692683999779409779852015431549484430834749369047472157491108522126799879066302556884289374783621068891898286220780768918456179259953445911085892205750695986620955591746350763434979313414456950938413282129025021017449825816244980651890397395622832106025490423223503164492914974299157682234189361014446427556581334674357308331303803729431531931520461956688224076611898874427905399431658571378063200009219940287255567589215073578195025700312996093214587608356605230784832625856581093522234719348607985151458904088687488717879292899440030076362215553195532050541577235149415597687331320058250043513845002986536381308820268590585917695072542172506772608559161265941637199532869009587159196004236188675701168122128851503708270460769748818831434064240129638591544732448562313940403471219198764133468737063448551688508113354512861922530936612779039450358732873750646920565052898490985814339475641335235767699871592137128429460920144417185799420188950004727031558822524768210088421363035932492088946898108667619794635743084013214844889467683717607095308738683774699387326338954877483594607356897952057513481419871846481473410857008229437872257459616604663175633151199408784270428699834150202501115645515256820059204044288845990020436656687083320793516478718776097297025325306696767446504736388381422806743701122223369614832553058048953848640240923060466193905858698274501758097822820531295012246550111822105247125012901772742822799006394394985346045993964874096209022695382182751988562446988725324227791850834802474599345216846860938431368011920308426212513596526602197452658732573060313416020343835617711859535131997077379671986251310294142735575713573103405960658656146766873077765116344110816072515597488515146456697129516758988739163550290840551134588487607905266970851259420156524412938163810320908609841625424348773675331007899059703751652900435211880091506618455166884698582529357388255203389577399320666703985325153548625387134428458923716752927178914675655235946292730130918511033727638202318408503618335692824464776479775416733196838581794669097368804131683605092592094770910116234355570557230249930705019648244601542654382192206325274129482867439676611465412322411598714813607938634894214176240238003645754135343412998753428984173284477854828492909945367318462523867540799599449420841405843327630505000112961676805429690193740331970518495612172612060404721545542833757585433803668140582376230145772109378571235743274763424710328512910081906434697235384909394197503955520205605196601665434847094692513428611689930390817421735921391203467267914633800898069385395835755017910907484152801019980071583773380983544702631411642622134742671156076213502412840525787317097738604446925294201218544543216488396527999481952837032474452089125095263699848586411307611238654956572134120175976185389845712270271869203890987980195602285189684501796035182427764927935369098785847195987274799555559881449255266987096284681304919860593224892841960239883647793399116784538044625939033523571017936341040494029528559883942905325035265228512446837699554594842781612739073097894140254862966708489346946418923052649812107199200387616646557337157797039496935766650727373774242365615097188195677763771139111872878812007957498016930217507491789140470814941440163509256471680635291146382274258080334145516429122663264360871987571813462421691142738507052635257031471808751489070069707588161821822175083297726839242338434011214556836393336092058703294164846557583709737613958559127065994817093428055650623738549198261004994663200399849286050059462434193610616921531325218436466975223879919434945461351751138688221298583107041902523163174301529865149741384919081154672354205227557251083597549096107571116068637356713058057622307294770131983923514924252463423288926066029988171705867814563489521874953109024263365234193824968772700482853521066911111823959638180565832676412401981884616352911021110038781205710094259333623658724791170386607465057566811255468179412644072357455577801527942147090034131266042881941893206569340703310408678763136822617937778263206974673223797519604918483906179987661673652629421442383225727996851899472353995532924470971720077784589235865139687082291574019473517973446504013353127941548836037252050569663517536532041872651537911212018697821663237673530478921352394251643786754928769541649490866716350713749268481917184800272037818698485516970282701929864856953178836268419088405890756803424967184072692885406419175074978486004921411430179020321361161156014666066346495557888828974882693446492533474763774987781876405537262897439817836329150428550305913872950539004369856751428613327787859117949077739284076629174839989269710381772116987752293231428480844368486415596640380248301481319138238672351670066846864439250172526987179274401154461851560056174528414048115731430760054643074930873328385760196289585235970159982741271279972687568633210228030528541378415468042158392947679320522713944249384271498198484750779542845065044135281721325732254022875868398145404839715967563822343068011597305052097860191851725785826366381463291536822686412506828877435052254176488100640584342385938246692590850923871615926103028177058507536585056528459279593535155125001918309619280406491944673994849100009544569743953181033567310045482124178819205767348022014133993488076654318366499733189082674409640058702295171924232070063765716599094228717391095887522688604414129545171582180300098127528137771651040461096035448635738087893871269021825444976380682190725657124239929385806563989561102997489807297758098032441539318211385573963692151384369175085428623135199053136348166663611465648017962759851594284043924482983108216408536496271363076596163599050148847343577115171600852361854329834184125112873977013930395334721749585500403060376347642919815571334987305658165047108699071482440698392679675196984231437707177449847474811441006912401703249183307722544432539993133181582941131905219203672443414924225084890767210512874070364738547638466350785815524639101936780873921920469332500328061793660438705264572889152289882901140589982467182556100412450936701652612123720923845424121291659968789539219671284004370258920536981512370151477336224183017516593901666406477808109845841525128010097784243046522902143273046269827681334347294935246217005035321066574222034809967017670740314487288884309263118523245442516929085410159775260855171059312951309572206744597546962721493778754472792363576888790112110008472273566497399268537823427161919947070466801428992512283364700116759226760687324485236036083944626383324570311004412501272759605086354108751950978991243330593935731402771740216022048043343246230645359561557694749467102120082290815854049001812611787993190021630256445043240371983971376546057954898491637962010234694639026405178691956182214497692938181160385492418343354723372459439003063238415834432152689777127670116582768351648280812410193456722953706053995046260470961686590846986290423671821041692128634355937351911491275599147820548165642927800907181633838126688512149067065421807193506612207759441897949489994251403965582214538437911802232745758397790340036023683852327609852480785888437058820415896189133972711838819150271915498518534188053256723829605550257216812616781926843717344403182525433414042393438713600024347134720212608296944064599363230838621315043725697235023133629222189733589457711193801821622661521566751990234249465149407163624855265098459948891468247560992288290334848447006923498528174738168933119120910763765156831037647813051934604971375188983191415433054037364331997730637001344983796768084162828221765082737261001615831019290058501051206379255073665222276253199380185595550268378692109112686222645137611770457872039857703831292022393900049863197337559887048736586294047935436117907580945757701908867809524358808837078344176118654905468436799205841078978713079244650102172923552225320190189234923867902292982426902868706725099378004980229009598250952069306999769235279913799392285767007907612960765040785268487416239247539201981993105753311404449010582738190627548274869673162139639391956842302784724785808724799902415062441862107011685903869057238564538050352142616510908350210490056327552377022456884994404365056073509554657512122299247186481441066164027062730908406781312803620278091826095552689519769483591884062941795863961786721967244242920912319280024544194133585993464066141305587465239399525980937448848887066460040645339622358837020973534502442594946992404476266075517792899427920995118143663315494649358497475031869161517350115747271323982566091656576061250580457226068849811398012683161075694260694487361746767434358747394755641584518843220082655865338983667490984674465332044296964227602902107447239666945942976872811981892821978153125876391286245668391202909802404175984836142372376518499973249870452069177233102373574840482659492540803426167640643348006393375270584488321118610370266293517994488962293067464932118392057936600568122365021080637128160682207135754874566842922398537576802109093094995722352499273278473904189830086104017139516454555302782864046892002914635765511083615132184485111163638482929634065427838768034384437901015910124657292335698220663792889800778400722634124757287154398143847902688198998311612501695192784921519603835520209842639064295352890065161406031624609259881072439567564786053681804910095386293027984611654633046108593944095300677007529951164407985436422653285370833481769405637598979722939708406888480179451937150178293627260203701000805119041951729590529843919813281162526137410903437659006496801937768735672225360474030717365615230121080150662206015698063497798414130503672727319137688921738837680693451465649959284667357184273749566386106507455918038130120433186448478504925100504476481239655011478193953231318912946336078975924493068441416870012186639626273653943213288798119132502400578957956481070686836687117906235816189661904349868208084029546223286021649447750876080881677918924347251069074382257672068020865710259873808024025796287578096682145016368556260369716097672742419935907316287594983621629698254582432714797724324057221183525399633241922065949311442631635651155023889459422785913695089305416146215994794920646356618861055750060837608403711964789665857379375516864989646653814465809891810054028278429806789817437035777913962028401911964759462240486222075046180496169828312561609165781682443077990694450438564833210275356230281422475269725719719673516558483776522613391647211554657890730885410453809205513919690872457533343823489230003204472892861569060071959027242086246306543924491178163730136448650303519507107902976250360320620729199781783081924590600030427257811655215577336142838735040889583207884659932734630918768886566897944402229718181712223155890932942738853661402738702314272352300159565852911217185415558435444849059227576638216625352078181607161348243155765093877383527854648149403388997600933727048155625682262670215876199164451417120799343735453952846897829596796762831088917524578144679709885931155259218090406467592889427791735631067921835290774329377755910834652453835236819917684694486147120457533001731565096542150343719229247315346637359331420187028104948032985982006749074346202809953377550554163453112607119083552443391083682114681919948928204259975957715500245280952608298600889093851334116882154106328581767262176715721861629839231032161986259589475790188609787174071203448777990723227168438643047135929713371201824062841013936204211539386067341940533041481754882000144810909025293871293889283237990196422127614267515005672923470229343359663777416940738950053875328879884267662621884714915609200631963339741098911346389293125888681101762809564135722826198921151674009530622355081772016658086199611084862097617130341688191476794246269405347639808420360427071829033410418528428990614590535573301177209561529824623715316362079258968848623052275357354927587823758223625528808075987787019481365502952976122442576847183583781274845710297802287301502497419503341312463948684477979302878237213609505123616872732332376095756079643799276745151146794125199899698165834555624657773904508662936221158863300316803849323378118767923686052610706257499295182955119564117941588759456999866197871274023424439130680894750599922080719905229972794675597155601486907321118788565737474611101150740719843394769126184695339497364195725767484273505496369145502661845282437501798487168749648877447921536789158645675764432620282207256257410840575809076440595048866581198224612881248134243535779848262980907859457113938634712088409290225176093402414447470293218703115017658007832220036331607786482288674584151064237330374092424151952203140237375252487459355566010818195300722426520691803532939703913525892874165115900112115071265951410440670734238775769829116943214942746300495237599017555062926533070097733203295859169496598250304269886371894267475521246532535921710096480258678477371796171454767975054356315445444801246585155554545055263941558036526032893722083627624385015206657353720453150989588965481042437639054019767974895193469094568526468007358902091168607520948921013455058209050282300439661669477658976172390095503952025468204750355230686335983981377813109558917149021124107336430390323862534144280929327907607478218832401929479987764334611148781940851239819945334594765355066080951982562948616465284701992699954005885303623016763954247024043725985710815411664207299456281796311630322539934974159216621620841475934366116771087615992234909674746649944465207064762528112517663581215289742242098346359160316764762425544810906451733603189013271184554661911616326309755507438210807664183829719828561597498617844224373015569814521698275037155204969279588901235944614546396464174536417296160796884509845311325275886119601653200464791963957994370216147554040007163725842842131224066908784052727941547244757904897650284215868722806929467010494454035905536182542481209266531413349641081575282754647030047511063953012886715498994253481268185636697286021263019742549864020106509458798446721640474660834804081653290469650823750902852801156697261609611440627288576165676981180776177402343918372681624948634904071462430185723143425863550533253304125541604562714454852868280891964317125142142683329513205226013575997976207458670899064738494745634357812421604705379150532435127625849906656358565484809139296777772611288687031190747150902177274174604139435452579193079320080564479241112603245226839104455245771737331095659272864466878242565276217032818282898764111933239897730922305765540013715880711324614988557947897143165255497831504850483339869206465166515451115835368609982892334895191179134168675406584161311206361364787860484097429705808480225787885910832038912822921888298477238190144295942278856947193432980255148705951261769746580400344299537789287923419102112000072064744638842319409683613108318157988556092548393278647157273387730612918841318324863944634211640046958801401935693955526385037053328424960825095271926648952515558633613502935455012378236091368835431467947868780133668854254623851599949822588463481013625365960795085518732603065276679520378122397064665244765575208389347969947414634290118486845315594094139991249217835663633869150473804667226807949958990149130649357760835188443747477177126657253048570021504224246998454938342751727994127003405412847730632741345349504985862923436342016063120567722151577634568175038258614076357651647897588456493259517991273625123289558703670429899335549244744234438443645731656862740432617610530845611762905370859361894467493508535616049910786792861888489462564432468501571155035238095703878515794662268313177754032928327137136660609907958915674563894402897404503587579400595681227667624182313848064172880511519245187407976510045616717850413159239719309675968576510717692021365254570534615277517223370204570692856822791915667988467213985745222265653007181720955253397340997709318202355939571758725107288771814229095561424677087389916056802224582120082197782814417241401703148858377026923846256243395399618239394220515347726807498480268275474937479212029400422120762510628514051565722473071335463358750482479828964613636429123741674602086703199812770824870204192874476568296141264775054733595339110618529070107172032113922408266479222502076939147091462400014072861706649216754385111923294217431644469951355408552290624281359588296551495238680873619844856379002880462579454996334376578516374048943583519873172569293329948783689398754229292016577898210605023257607255970836553193057296716596489671929326156832290559743366740559462510144221174839752976828635607500398421557846498980621984826096333590708849128766568858193170998241256189111712574291046561221822976240350315302429819706342644998395852277577031968415756295037114268530291244258938097937644313720488067225893123200038320567281290569441973207941948209470240297543860602924179007318897167896719817141137787200377617560323210483555473107345932882696698802571825320959411943374774169329630057372752955391183177113097933067488740765985465796143911777037294345951586054055789465635591947113641088597758762864245852612455052013248649883855111891182428912224065753255661132347581435260809690042030882784153784338860623258383357351780069555654061908170100612481224415798979410616547555416137773773584190718420518474111826441013793005871110266477231601687511038733357237132518658808126455168152399241907845110023209717205961762016193520837909897920975449744599614590034799890981866096979640012405037335986425002194074994035060151441314882877710946173932579854825061714668451788782581569106885369671840755548193351352001943113109985895361417737778932156869773557632927930701522917541034082932516646593782303432066368632539126917057797167798615861764371687458917507158000559889055354946687228038979001167693363445236158949840060729037929317254027729394276887436105006262313234926649118883337788545436449927181159248345657675275718041399389748078017118727426122466203828168213085773004573385928423037376320353866764342779455508183400294634952220189946854980741296443073919807255737255306441621733770794633217249331402190717071633682397783175907206583403550296910476949330672434473145395115352224504310729270382854112866131640558166253139117925945326561219599008642220491025843769812311288695961310562417847229137277332484160194853708122328933267593462733401414770908628998247177212719971243651097597878152682718757495920975282289308826241500128224487665269802342065705485150722100041794940302365466648898335039251855387801249171847455921640845687733320886884973515629335363810466301994259423727177643134143233648282362244182999585572332387357334310097015922834274899622239902771223066777372882078851598288381385413266815611317191567503684728089804876637072839711442289775488813233147637240011233735924212451079888820092305305985237223997569440188721331490192461173194760757164835970077310657792037450958028043821010858454072721510594331911691964732093524470936481062603498405835227252511848962587301379441520857414511933191739304854459920872788019305585084258745630675078718570838627255868158117671830105692047884231829977385626572826600611763053022509911107159482886095583369048529077914128364159685736090139006785641169615013083096404135643249546486336261024299515401513291287352243708064350004791628906183464249855617057551384472197782456688843981049665418654762646860632479013249004443247149891973736340187278103330849532571840032329943929758766931262807373398709594860157780975104782885484546707582040444430055089542739443627499601074849917191851908895170955571522426246671739373246058736423961861773451810167774840114128176189331364630933913003428071354100156682189600444150126986645099465954596682983929933051723204064320202049141695047338682579713486826323984396338645766787789231162309088963107867425893921535884172014928971871564813725835385269922162744130309014168130033257103577621831185373131316813240405971694196889119034768576527348627757526727709990976440341158251191609401141052596160353049359251514269558133235462042098619108261350689979282606601043399998337302089307041298996030352099452011244442786905952942569530580702272977047246283737166452344144235074389418891325980063489182304745945880354674586834756144695007726706901339762077882999359525216437034168444457907958470135910733415619851245300085209046697641649421038647694667135550588106634722665019498451891649543042625534183056340906857920354415557368354616250784305150831898639880923044962664826184462628986875215405194306463807105714163051394243050223791123528796954316233784430668769556537768628991790839626098150973184849766370480971337230165361568900504383333454989272708930325067149342938306611301158301833877912526511615291901288952652398908569835448693296630747579296875739396428313309432347500290142728617893563670763603216246799250831112721643986879200169673589211603837202892695285165745097796783728399172135804941025659724734453633955867533166595975889051141984263565439474908258791114177627158050828913093127155832242661315330184567491640429999676817614084976602256249755617714918539859497102897556530663331108646587842442342602692020219767974240675363860820352255202718153157833817467084008896665142292684010494262163727861542783780031746386546384898197637454843153381431894503667795750122876862278588512989543334643425039464980031304701645838966395316500833733722631940972764381976045933122854156933261156763305851062441874261380630581381736754201234532852623530286098392888046785558130924053652816534902092971204528146552351479215537902367632318792619858266648720671391348937290132364714733862441913945151495562920340634054635823088665525088904695989706538104782899663859179950362097350658013696932404876396236411961933821448272112818764661700029072399600992934151181382916776170897687321173623900138738736194292990416728945667057898013706665708188796877418859592285058152610732985499283945118369539840712353043259463018720741548147070966683255650047104994849782939243391465985844500142249943735991685880973926644009497332981186089272772268344469493872692135679731458506721337157887191553174657410721988859910950575511847510065717314996971749211637045878357914428518047388940027508887979562656249475345227540893967803691332897537620755172916615912643721481509186090983517416111389419013790202117857298537576948480891523253181870567859245053169045761669777704567037976574845153474613719750056435149112370784378003725278706184788902799850248846479160529919336843439116950349040308662580598635168824539784555346650352859967448199064921714059127039644683949932562627858855508023341541830032186399759776837962830135207934117298912120061664927814898132241845658563642428923358195809387099126963797804733826588450062463751847412395969097552303879941521039337070770020447245626254851532946917088846190408433042952000969404382207057448900274752969046945478544696520162164043287618497934606346680279076919243940694412565173828738503724731321864909373593222542172841079052059738139535992264592934904422714039214738977218935222936412420245176391775050757608436307128947602748661116827796747615358933549981634060499683461639142392522469276085846164032888522026704998128193067863504192497167982243524507918689343008938412199408203628249559253134419891002134675629200824293606111126327982661394570467409165735321222006132214317587189124556141040755728838254332925469848678572934206929069714346615132392232554737491539152191527926686883951208903419699003920845056441164377994334021781494641003671999443539424552328127608509179865821596631246191751776233393672318788780261421550723365536505696260244648550549997759670149079208113874568462089676756277631411433078063067101988351841172723604233485858376960810623494751648840949514924497036415364467751740251651825486811927469918508286498774773720782604221896722136935207347633537906554519035788788844467874817561472988435459032774409007650522364826271108188927894243066141813118427790099768605479107101531983574658629779375873050680905946383180790291549550649469667301871127017509140434071387875546767808448610776004221344612744233279237880567841672859391480184924957741781526146973427367584118280523045130524442232076820355894828697682402303316407821174899552688971336387310793522459881206708784375842279300947991132152486283810546687514903706335408815591673827892181447834793751098808154059506423048669917022958264188986754718428580753665021912517003325126778965449072156931607392093634937733684303364281823455067968115055369874532033852604539115715937315965453092998449053495677477966997363466415068508651895860838313526887883574821009379256368835135243425511157085523910808160979114744725608010109248472892371348500911287278406364278062537647314622461311605098107625703700100064538403887610869665869024652525609240080436235627472144964952372411439267317762081540359437151843459778293735444927213135329971030414239339074696734525771635816598033121672904560456074729312485281394235750420850956983628992791994810977215792645531935254267925259131352993765328914927816857396802892334120955066969173258570947509634646582847478312959209279998003069983234928124656019616773593667680525061388096607884143389255991563974928020233235613539510489770790063870862018896525167611067210055496800284664635242089411949723798317712579368026045133079824381063591849678186070828502185541972470077581653749571436584666067708939465424423260135978526293925183236436238741605609499531617759348652994087311249076123374909146600821190805615439938770918966937761856352803793816399856426289840684374474435312451645266196788084907162830636701169229515220265886624258939568133632548315088446410475548965309629515788288133944534058314151021182580334609550516809338091015186400965761698610959445358956858925351692807459833348797506784459525506856170999820404056625342475970240368100254666803184225129672486174624888411645912049361588642613062646006074635745839302612081350833795188783056078085070354798250958833116487674643084083245456646280009710936865361634628049651450539739644480032643551292411800547155907165670452687490924246442962801819090904009687145358114117590215054693928474404047320107397180721228861143543548825325058896535054179071848698120505251068363363872840600627552085420728395248010292564378434345621105396307533757210637856960755097110307411962640230905886277402527109526500044788125589149255372676464475485174832408062537892788894138356204418745451636424032856460666239312930430342400159654919573675930090411271643944805920430720236437137791517421921366057810949015065148518175189704872737079084557354437658549314598088317645752297384759094587864447124081058442051040041244876314317418186288682150641965364791579595520599173365309375520093123947391300310357144892976102741359759895227481625548960264764247561355906125107936800710179350464205538774597871777500610151350566637806185056625575740155016919078240878534966934074399972610965354003855530646753663141212636454336075786031935508921480495213487221468562365502359540199630025092001245691061020451043810509437172956054468399017266466131985896940447548177703696141956574122937668637008442652917063539182609241239282955891258465801901687755838851880396083836688881036759256820514538039914511811657262349109526231972750678305825560737953612804584904598757873600079836251634188198519289947452259679314967094361089115612803401890005057556525601150693121074851954593098229767504947429249221930731600880685918367428072810736165648012456471136243368391067127727744871835720684717792811375094240843048089247728837246913156064150244039454945779715042417780922205734285952251439367187779925871612360455957437825856371134717984717338181640642532870651211023818781527139342868128868162482575324682670948979193468753288554741981339516741059389197681949254344421387533445105654658069465080207282754685444709156655046673877777658655970307144690601424317299946463999656809462358046479639519911680382916995516693370110052474360541069542144254720342545002985567673916373128130143779765091434545227996146151552402973543270908719439973377959363634188537882113865392418076302035180196444116421965127999274835622615016516498046694202992101948980624026657222511963193693062264695372574231948257073436693746913832213537300193308265069339385457174491880582255686658376692377487797634107606510028935160961933591946375768803922511474443361010421574107707823862958710944185697908240612762255938675732925588481037096018715269697331472949328737727996810766288963554039972127700936135667247156965564722677698112652666369335239404791991466744711436844471448073479443982193118159177269549797183076581015048824018160746095351003837961601001598725799486683987054918412904356468266897733654551270393910073621567603654663704307899852332113121790244349143798555143548382852549705231522273948801324233274648377672115053111718978806355140122615483357004092802731329798883558842027406302783336106458122144283789770190016991907742116017315206524895237475644414948681267686955171815658054553136583730265489470122221217443370671046468326617026337415292900251424529153948530635118849593664813580974049099256341839489212003807409875209578926745968850152733980794725198589143410392657184125129402003195768266868271174075328932749246787475800458709774616215617045886840630065206383604494916023641999754877096649823391671074391280607927760576657063260580053733681406686963933329336995070325533789068958273379604217075593231865310672268905485600193771732407210773631675205789271124101069753480197844956810188955932283783470187346901415816529386040676915217313446786105902305333233532495456132228210545614774144384815617664360057024718870394964614426922953492052835707438530757628939368117742731090170700460247771098935823720899274872811107192546415080563108997470259107168581336560904252093633660196551701625027062623849755998314860208270426830604842090759569545880304687056976720938073845693947185503522126553025611190450766796688508826663272952508889079284698890113972271612476178441815835032291624135988195154280805928839053208104754377493799045903860620580986435638290512886409623776751765687555790781720968550053247373502042976190435896010583776128302870327406254695844101829031593786444836181798990931043470720551035622340200668037184507319770342348546105603775978666163173484096626043516329292815850799121427953722404468287890906226887643562545785353208796140689011494270856625350239185005991983820913587329935419208647533559129532505186075972242625837104085693304110289583565544548200627736678652135496073927359122922313700193959873602753263040007274921665292459119953596679964142329327589407401646901404937809443570181027058315423326855282080218276516981211314576095988365792372155372771801083354193345176123287763100424074618763736706759939179810993910400856644571652053505930330214532100830243787461936127535342059587077100537168568207114122396823912880056755208096526138649664433554987724789240670792837078592329414494385948345664809365951848469766173592373473797756891587872785545852136697168162943095120712269071064973159505227001393508334018506169845750325733345988043927081372517052611429096265495105224994404174301985413816050718013411005301063380159221214582641185256981357668353992291470773562130840349343121742383650504419776332230370502316307218228451430987056857088153264824340637233091383605744176391377104582474106400324007772408558093483579042561327478598248039569698127825461478534139734154719786230393320716461030384939682146805769726971007117893963655723861962561240471843260552285660663133575017510654152725309086510701717316506680712075615877694834694982233004161190413755672234059721388963394782032310925704580971059272459415434875264890016824513727651982845952709887849084110505014308730642293331086001854749082558803908234322414046821498500687185333653679018039782811608608817082910169109729699894924046386043729831544445374288430033795227874521684153171609987008633711037471455844765790750754166258505401032585246450717697487491463458015336233935439099266895584867399250520333109882875703087995936677430084494357706283976306043686580829866266119652849846812501552547273060609634912703725056474503781285348017899402591826367213577377717046639546879880341505140972182246401849669420644482273009970204970368884413402310217004769524001844101694108572436682165553770128391175136655711749735496116287151451568189979497480877475738310198384541399798603116700960008054409525092519377607493293295492216107937544963031525044255820299916682895988752662157650785918380160647731416770603026412079745063010316111854947663331537247227628954184293949930840311047928211636519160673025961116405539250158792231810182283387580652201398754770272080943154434445796699389170984283173848134671949424308810500540421194015020061639366000788401524359701818839951691275809861401368532511205110939886487559411447793065123515941182349854261452501964194020706708543095918711458677358368187862344343472298079750855867909622764933277343803446034360516022769112850716520516635574893721707235425560881752620341149737917558693991860735294262869625225584848541110770669241678685066050278627851520464207500889237625484361555291690760929565432485480596514118409223398956257913164254167581995689031953590932150635490249088425780025941433968495420115796440042776050705092204029615474070631881996985569105803981941611150771005612628029331876933381093547108180139034278851448041555454102349211579942476924035618884792400567382141242600822539980819551911255023493255940988245201216820439143175527264917345026164323001446052883706392472095025694305538895327474517653785610101248139838868775186946003630511311141376843001493685517213610795428862680615672386605680961448045140628351235259528285901938514458144951157578038722825601038954230398455714842385760167046466833363726148040013791650913404164776774159486708717475338580377495069833597990983832866954817716934464399545443602450934629796807365136601998974280058275580770618057858009885036838053664075574716163613291816385430289681362809680185481862698048117921730796335020342623596312811578921822453110334733673335900109482895419792179056755543080699026509511067679973505585720687189862912253320655200766778872293085920051546273280099060863121645481517725065035643731589083635665069291371726083208448285558115877739087836239770344465306229057113805135333757548499111615093541346930840015454098659449027900766315050529758350494352103579934304166537706543433078825079176225159131756905319516044147473015292144875663515976801667097534892201734129108523852106674953152403758892238784119782660131655099923775020132778646912791794310306917760421017613331056220327493575156895200731488112979995612826218935710043893276458283732207615574307205062269064684626643260485424151668277236534404626444888307948339897418974711243068164258790837237610842003750862795835806142852874738884722673277192628010313925506121790833461665934490993034072721612150171723585525350354667402861549065622386603054919487423555080151495066993335674994722244557421144568222222119916128784740046579968528615777094366238276108832817885429006133034810656692801042547631978831136567232889059351514299200881078428651474126455907646593750807785567092851290498416415830660610443059104016905221759399342739498756053394387490767313721245055203501072715262276455683584459431435258435933657983706256044743030278887332512689399685411133672948182986633174385726994264623321351901563702361450981194894569495347709874408954840612253249052275079799314500184111264686167241581578958536613270568270188850665860541638307578436198632677322935895423628514588612440108062595729760291161369235965411258265935401946470099287386602582829783561328853069331897504986661886405662610529958077185224993066506802992760556155461663579178418539228013055204993055376788968609644419751992765039545214710189473314658542805366459007619897695542343005981241732173428347003275470298458476736624670906783924475019087183581252962952061775708103556386231208577768556760622347296749580622909056420466423529547025954107893555104774643158061113277902757205585506268604678772479799320829620900681024472345119875362156049542556506185425167996251777449824812215718363090489461849278179453954918353786550395212723893165674344829118967273176480648204643681616266175432702848893150941885282754869460500824884847057217879542643831254639206921428782317439612945110106785093403133061620394933279017396234524695504191567532353640920263489559583240518474345415601845867087596245709657904342394969549172801369842735221776695477207410275658208073877670109616579398862922962267288250828943702457289447979867093104812182011749356833589794081323519011865599076207233436384420569817457792287703268445614767766880020457573501018702941344374586182690908385900942924936683908239690699123926681201922284323034528822631391844034429893669734505432612066186988076397095183781396133531926914284107983452321386129658688161113786547074661336198216519391820903194804669720603436734569217051455728705119212438289360235232769908091471806201341414376442456157187161462333641865776005895977812843200403728982976909611036643739959762141003332584332382651555012304897539804006699365552415065746086821774097500116600549587067475943549152565184102853887629296468820616319690428557262118707843348883321711664671867824262649570175246668324746791671803893476701788608074675705891482888643299831447361781403840255896304296471601340334896130988703543035956032476002987733504004371197433845633053966290057376144345511616260651231797225573949074059983176946577071899385931846005474233591330747623218863794586524340053659595710715646267331754031395247195054681296344210306761419168869779869069021034582437930090128867616872847116963670885133840108169668428563004067939051386477406543720436922438850182679043801131115154933759202459752371398301580808691417896883897735771737289418438952984281271722897185440537472212395031730862269672135479145096451422330588510073188749668016442370307667600299506197269071975476314728855889911158014850909468956936202391566391401078211338436006313529343934685180120120279619351249934276129759486422106985350783117864804349037861798027484382783998334363347026037171375214739599401887215670495558371512790932508273375894657432341681646572503710421076182016905672173483480266440084567386070163605551191804391602271786537504376904760028781880788219127350554037467548548371195634020261351275490838933220428923911419989537214333024288935077099704740478801457978240023261368355117779874544366484338790937076962578866463607179309871849113688011387461081309949143312016139916616325086179068566947512948160546794429925929406851219213562424291682944608187472868376366843125799120680403662232752973125025781177888934401644019739120151370340991673334439019664921830676588001418173346966446640883135256785052947272932748897686081260036020070960944308533905796474767138207482048438786741456385108315881087575759618455001246272757049686968063589365231043727558013144169386562782774399436224200428968318342482949683545273147094957725317032987274275039874356812587699196496565802373448946014517646764795726472372179940029377416989532035304293983398506798320197948730274591871090098505017232766910927361716921027067\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 682,
        "task_id": 4238,
        "test_case_id": 9,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "50822265006092364412257275122907609938185473504995159312708063105598858982367519545934894857014347283612609244352411207392191933346910829296334941413329532005797709679978111415254314522979256273623909344256727752465688090567066339310715602779896151399046299905251801805827780402510909765714846768053608227377117942981279354971838535530253151820000345459779074623769601935346842663733295306370939261085683722001339033833032378113746619819135972206227147075139093203224447971414100927866411441784706929748271218587779091780686441901444031237391331189519807704896062130382625679952402812301539876329538976743677941259544876742845811366107066967155316063550995687397499785677222758441805892114291913249403246101254384007891878222996986875594397548157584883103198276999524171112122750983700870031633984358119667180057580934291368525384311655662019920239500594234844011758072923395942992627780950850112342065802411460859771311551288742400405461700996551918418779778244178604076243096556040362938817473244703490946928179525332044095866765950457323363484216366341056753887717791384361598144841505427270385256424044533676645500751706502132518088715138828279340652615277233294742687747485417760059511961275216819815983938346724106923400822104609241471001925046651526515774943567323035308579540704856962575201484485815599803688203130767153765754602451148987092758437278919171555970877930155574534974441341355396548885691054162514507477588989353171738689760902777113510009738805765339034529699023195636029340769893306862854085336485278132572907365213347865884251231360592072418604168390435770472840351724168922666170978562173078880568914658361251302621067875357085747918124003739966911192428017454398544004486867393098135968541792392360567107379321138119074502906700688062833955716866475260177157353553780531077565272393247636934292676579596188443101389963659142921748407167552951120118872004824302421627758423891502800152588243126947623790589502736318084608927361562226616990776129532519527567512090959742680714599399953699412453904827214085409199565036808276832233025365879437531270284618274590615021713547930180160106146882803853349482377336614536511582449681369265253175253320419931356849878269130680965425239027324316939605831209141889095686072345808726076348463708759956126734801169383574207165256174274635972240616586344072818767317236712037084355220876557264996773579727384385442839782182497268076466784289731900752621429095164919442457601299144896390888620764721947577316289754192686642562770076908943887256248202443143307768704949326826177941177630413106662778224692361071623474642734350028499984660880559214399457291187870671977694987013193512888466223863072784209158248358667174060172759027132444255235171962446000268499192953829357527533338586186241247773049015615212052375007868898978978322126763856451508494548023855532898849548510353482025690134415583510158468630688602970719999930720825779544806439994070033482112950461919371239721836198560300922992336346005847151838183552448952143058587152290462158040909239083847540984873726153114197992971045488112719904490042816985268453892108634773718216651772017422273757841478868987356269335262734845903345711862940111353300784221458357608329669191174798036964799375675756762918706149923431751881361283448460232226576474854737110848029059186107213991356543720660469278294312623554338493337188052818900358878857029041835997689798694814232549792605746733718878635540306254056603550857759546206671165542988394878052589903805225049964827140116246141618402253045454846964789696961404537980468697675939863110241172433469170132614081443230298731705507433946962504255464222639486818235644561804735002186165570999140065357501447240837977688476530689845120064808796379234052487297818082167786818801291422396081474053015902020326295222098298179740030165670698633132534153366234821338217676355382596016467856681198106251945153551392385186185135262958985595202791319856209113561378753087318622806131197871812300964402863161049911336189758809182393347914109502549614264168747510347537323680790615591393983695422715540883847327735448243936633328048905356724462219765149866075073513851306752601088296620258927149852208033669206906338842925391581247581880070334621014189675299017180304202586802137299424903322480136362966014165009765031138779422929358182016379483424436405169535569905900680649246945496060729229282576593372739832860669816942954496805527211563964055992730111810562733562284275142483634833454598959340100741780490605962264318323651091337730627411348899716431059470962340303572529533639360158314360501821027045546094805998351597645688343971880078810222782092041646614538635650243529427812793425073575036276274772769927127576076700810435807142673276813160742560698025625856242911977888215433897503332159854061542885156150254370923074027336113932478850847982948553330168107518629486529295206841047468145376751358980229073489048310744861941610949299734277112118131055437049808318032788932253933725693482255825891277350631925011726068758610722188839087970208129253692466018947905530595854358488597870086183784915931444904238721650303146184880557838366275256584897169219069513225423322305479689179674990000090582777406936946933139664494424605469507070807773576430254713913882957397275497347638094210515224477940383575722557033539092356787509567582270061657657354376577604968078994390000773241794703770848712840549791640163061762370755232907524173354116364075230919955213894789647599674355545959987571930906161732169716425635767398601348954132108113514531609250749278097089820731432665089150593277307873702113743878412872772794645084184057036636133477883121501573131386891248698811613796474648956579940208644043718305509308597889545070569068389736731032620287241968232154950851907003216779998400123660447926337154968487610287639400103623393860362387266820320833911453766174005936714353944213942710266280886548164721197177103551612347346905761999721277000228922380685693430098411360246539602411141259644414160250436186384708291983758844570115730077002902208726055574857941043384624000007895166317693810648135432835892151997124314676777331930876178487909565025935018353145724747029035582033167549656808583097104457272880554434877451555073340666072996892380257823777787513411105173400936174542059649642293823563879806527158284726810223923023516487415910211545364397755849958534824740806299630182380275951251998340100897933467860461980906231668562705243105146039744946338052711879282111909347332382060650177693592754940756850291620978881201392774701346839669657422773996517012402179038636092610105327703607957350088827967240608112108526138540776647106599198537518292663001056421910628071528659756090748826611546720971449756019577977809163825411824816441630792134927392229769274876018673810911870185297303176657030617864242105815620141161325189060160112784891369362906024000908576412752805492989730142668632959097547507576376406941715837341546347805738186273070663366030765356726855620145576267839229156139718711433147519074488400368389320432325462407555737484024283905877272220043537598434249462927436529391722535870892484377468392936732713271248315355487759248464976878750001085550563420561326002504822470960297001463884723356038521225085142168484374663935281585365111042002956475392964236290711334962752212615286346440411606834263117026682428825054616557060545750908012559944532634281901515355877015371644835781762992136496671105622195872935761156200684527780205715286238217770167773373780985886568929392951551295213685979801162210635188786206774041885771722391217782301912292858943551957038662747845739189513249547365055329074737646387442804024425923632503654209385082679995793786115457165606278942999739501701936079556961281014042290961302122975330800842771863523113956688635725080962367959384760919947484311317571628761225481221625685461717298490404126625830708892477870552003603778169107040123983750156388974348043567628644148705263663390180894059069327947004252899697204795025439118863722429047519560974815489910486337543859718691131383084643091990853295033589244869603510949830286043861582999416778153663933649226275938306437051713829406349968682146019744849706368225191423764131981849520800159028417551592590348894393923895658770723252558662334852891918545155520618953511653804774441760070923244388838460412511842904451016905152628360032434849999963121973028398037620126478881445070694581944445443448040494262640742844956737819810410198449894880068708383498026671749722672716340840496428952799064461255115196503341166169546757952790782660768657759663375930804908350047094858926919136545777103555057428877243531138121214028020257994806709392015467631345536357922669800725169658060543800200642871801627751863385066539734386284310388869955120328778918686565662648580609867527135237944891445626396030172401394318246718818413587606813964270728417662976611888941003521406121694115947442935963532164644499398135665925883966773624730207533348605815008661680341170794289551720837453850012077336078522391686071640088469392816888238632584054580006689225003114200464345652429830077444298749397867461799420615292109911271961688013406520600852205382338679800338783000652629513860334322063217714135741840330230340676336189885856115357650146052064367532238669749710729076791575066341417950043396260615276541172856278244391474928706362481534082818059989502009234991617137596777813964710426193286472011196102207837864373475619042540873076595981305067551894017907219052543312560280530188002182033794798684665665766364532464557867808928960313626212642818393834914041387265305694009183101528672228440081397655605830963855563465137464755243211744208202638096017038982046391331539920514196098505666113964476663017720932310248724287779037263582877871239664596064979824598107867699915805998804909084088534900746844387465739263866140631448915770059339710091855599756714174511215132450732403813891352407435239296931931301606524162766472576736404190320036973736716002079179917862822574248636525979832685540130274444156001292160353355095955811424876843841494688289047704960211309761566193380215882750931688603177381562007913472252168353708900680064292452337019576933507308105726282777130068311740164270528999766166224491563920362333997303010894892902592820234593099630480583209194800267273862631320689344845586643780165207533576712383789583161692049245240626164891607784831747861510939112967916324354925428935699416630224710679724347466240482228031727906457365435586478034737789470507524787621681183756364739809404762503236729932593988154288696139605355595188098306713270666830808535531124416612991456104481677835800534041165680555852372072940128550569551286170174851315425918739564626714206542530285936637931887153808551277696399712506166108060097909426299963193796232350970941941613733373125542160196155110138674322820405073232565498241772421222379983434230618245875622791994484647832021799244253202693411314335855494657719313149768996637840394990308572587170266068506031926807800028033531937162640020737523649750234596024382363672247777201279627250248615101200804178777900467475401133290517793025697213958700190067025357438654202182852575719417193758498940178869995846882335935012451443285152051670694782871834737012230758974502490482735227587091424740831364018902074978891251037007094927873621548148632846936362252808202649768117556888527649958042729657005850819370020691452636065623193450681906628754712490901661051464770006160207110607460184539951721966213190681976608935971938358664067002411392476578105069521425124181702137973219272801655012687835497905006958733110004475301413299168381458727328054299390392699819070632553249923035565421491582312897819274688877360791462200896749126529297391580070829365680669606946328784730655132730551700374712110707552543514828689457011907895796748325588384570296911736041216581255859966897829128804653029507927677834041140983584595618711275933115457773555211742940132423091718554638425870306669312905370226434857829647023924811363315858843440657397680267962115149661246853514637029573828420185478478695239839892088905634781271425250578814837005015946854249470948180645053042380946670997687769863819818322191104129725078802569764206465397868414727456877101435893500702676103454510927937648941500083872756899986719676926652128370944997785388956030496148003692457440483466379036190922297263940946802774448077002420774728290875912870722701495767226641826336207321399000562894468185177518804821837458344935390864705188529573203579349956840126285241646120324673708805025154646813535650935393039917503951740634847733560214511917647148731881228066960104992377199325976093363931903343157814452354695658277928639655019453709088762927918260838322321094772462203459341959901297683674434843990138904113491722639070370307499848443831700208011988439863099014469758086857301429680170863018658942975974363976053541296814283281514527029965176689399103429593335654665601813966707305205879925840357235055223682506966848837632325289847340125953993273502620099828945285895623006115994088494242146071613017561925780758931974290755871742854435629091435762750788282623813102429143748167401173163649307726616604538557901669725659356471174509402335847003862498879683685801182176810480730457843629285045723027943033294374960383564293354879019869944581166641332943265743641276582594892485472446911407404598744310981437852857656545673516782501998039401312617282396246918210595097297938432002060332911648851199378520289874891336563425139677152106907389220524402963097830064686792646066829562585012295342889809208460130447352446469889484076764362132323400405137667196411655152457550020477147314304890974693542678174160403386460751604665047120405112618578870055143056460125282072960706607171408744101828865439979128638708656107238744592328898314072370240235612946043403598200521922624449785904492287667815621734610729637611413477046123553359928611814004881552906629603478571439157015461340617711260497008619381827182856537080915410461322258328597990054281819594369966277752036090925523811408064227960055587662996427822325849617130197290505923023994716705230151539492281462978412720057452262771666779491921771990420314329800674188889698762218434104680149281713358530575503922423851664335333007551504151667715034155059178948517431703863678175278141655785615255079518558189562665377855159166945268138619343589838404755489618271466638715698642884939035029732164381980605000842265933603049299791887384703803624729208515665325977916283040862945824313727438075098551835370481390487212746823682632896181915300352372106657469655354725154915273363793473191679045879086936732859087740694253156637630683950678597603745042779972139552268906061928528191061964978955551982755046239892457178463061952958630682456317591289321864034234051881470311062679707743487258956333345065463939496394827271120643269343425602584044269062418891733730648571414580786312693954323956871464485023132256907154556588600710684551681457896339614422936134441364553628640885348660985467899815534170221856290283412743599335315083056022824549438964335622785851117938309825160182922784709554534472615266790025650179366338541841857907552109206579573472443213520563528699732248611966726530955322238710889275971507261444637437539532545231845688312472582440475223262762671055357374509124452189015162304149021158734541635055377522095071452527350311832188047730203744059916120210870462830245543152882824124785557678839854651227942410643156330992634988658142276853785928694304671216515373703885353578653301475362722166139898110529146482193459293426090816879015040994432455809753412358245497711963707353806503371144711177616409314530661542269135226685692687224837780778713895819224739944275438602621427995394729617918629476673004559102626760196729654996125402202363511427980093954357338842353287375273651063449115015804152576009860154654433867810198963685662990421580383266826311218657158516346952859062768058381025162509597008220608006608258960925421556784760726122835688816151944593215382182317349468657918198009916914006927895364842758558000084914078667379239828887277872555505074579367929428891871060596949319473761351424736083753712426332705876136410437853197409396592389912396114951743078198791951183528154501475453485625162148314686651338857666362600314304803960244151616566628614448705125584864103387223232464740109425986216143253653307907096263318118289344443599987829290119267824663781846728849598804802181156210388800229820694037465092905102469759581409231004337258622783223678838965199077934187667284356944489356752654965859253147500763404264718555892792437901152913858092526202450443231311706542522400463132285203192141333361507498032362312945928985393519997126755158900470630245402605648055959934406384793036578484576909217585331235458812283765984676164258422187071717152091424916113978159640403051324894076767329741234730794184608722688053523067536460178147410807490073359396403598184500241429227691620872325603378662163628709911754953799445703584401348798935429251319098279365189432274576402717772133913769600877466381431286973973363584499294010576040411171042477843507427082776831297281310265089534281722580239535470096121383228770061285529096640543114982342293666215897522032035127449680319133349338675184221933299451543173136075772454323957249531599928312405378478455317982331337979747168674962455523910225502840075072943763174921203821945447980007954721596531754912301395571714829469370696743737534382147626820591531367738240303586591232882272238909105712169011119157853996924305677158556652661083680649728947740699369537556017414604215670355170656018095376852901743648183068186311169851652322911072470129551751550421316371831648551189729893281527276914290805670280402105142389413226900069410746077577129412399708337216494813611939055250298830762263545915944712243189955751004161439529821463155383212386965991969903375731946869441903853773486327200448586889387128726136055912677909615329960264608824910270857324547298928954075027486234819985222180375668423184307030007683111068398825108297220725070397798451518125999788795154919505443644149239737719249350654611002420660039262280656690428479124852472446253441482619963841651236202282906916192976091495337615514452886493050010067117805420821133132429827802502462637967626049837744731298347994468677224783488981573343663493223927844463347274489594128201193404336834167729921663742855128820419498359506902594374737617094811062671442523516927950734388930199386794343230520807607789351620126517779646216787099194855844476143632861049055646913146155191349422710802037912990308791200926527312378454576606347924173283934141557918369444167513841405948009082306924791894030059922885243189492970497848600547735033879847826962973528763780783477227622996074763568184683892943018714660709558714983778184063234516641906852581960849822567152076677616158978598865208179933750023498737101129869494355507929588427710637080338652690871166120435391824449582802765311352537594558615902917848085135469997988125454822606175562651415592209198061146340854692484090580187477920808122772343668047262479668863698117553661365344724372149878494648255577833533095791468255913769271862668119844153285212296682667012380430002534410941877714672046118896307907778792757716553043976313098485906799182726228127146463418075587918355848760833794202305110115029311568728620640119071041664661988609003121565073814958695497963855059878517218856566049822479825456402658904721098394803213086461111244494363877826342262048428690581077220117068514829349729237500251227959621376034610424347184351708523889941757943377021036431415715933546973602478028722177555940607003920653182780701548299084587940206859804215774196866470962029126919439544739185429749048952448101436511067773640815234806468895268811390457468369352874345116069872458734777469063633630528471713145295326087582621050479798144581127266776760888969818417240436885709617353836209302427658279689464918714425650099497704163043767537872222726935048448133691642901579320335168924794075422463866060590272446298101072744371973589613077520420170566894938530869810800519516454161641127013201511171360422947006389420269324918818390541356837632348127061226010689751812856265886216259631503278250522073786439530653362965979226567464340426841801737446651231946916446799721533602214605178641599372159059034281891989815211594838889403561860658613667528244715239164362186775387413512332779642062144969725242449292201534318763893970964798609740739333413344791484546127457360339278844695207344881396080955568059481796382143654382372541390118558140756085255452677387463860859863478067232256783689102693896430735116626479577515546685702819625070397272948551587650203701526160314155179509130171278933183243912172844847382141394950642504527604179354812295287546318997839340048352119751890860096649248321856688632319289928288393502782246340958087561735412170573668642021134381826140306718652164211298578288137248151643907219468845390838525434053092784943058219739127886186626173213610035632448182603584185687593547098781429691857102346775439120957205701005439527713415284901929564218301465460597884671046897288325463075559732242365006112059184525363504658805015180597492019426341982012473450687837615983528900557021660054156792573350798482885823777795161159361953135709020056452775255572741883699005140130564290630452279413202532566845741239689913853393974983409837736764119189367282627522949787263734508960501788313404471244083317152679108920739673685840746046736238555779297653120987369847739710998081002032352480861234415813083164574804235997665603166185765656609411015945890957765968339092312180602815391949854065887848570701419842584175057371171748677274208203635297213032154820883555416082775345551118467430961500905040812514000457575799754945415735116710039878294802595429691794160121389941338821508652738688036193468490416404564171512400688014081878657526287313512766097394906419469518270836015095573912267181141480387186050426495699428057404868982755024578359718723670356785780668284423700495857094472452518574513016133644594516007238356549244976239980119199321701643892160885067900491450403663246809288318330083802618005036112454077957349723098207811260424420927628469759163593666989520898227801343421813967550490510025830662259504638580237626415611916267015263394081175369642175947631643596733160063852697250571301887724305265034165101210413650977752034460919574415842043428586620663908294167658034923805946259659216548297285192502957826024630556310420099063307817432116601098088634239750854752245826985702338781772524236353445999061616850788589945221762526752490956679262398565235170412789678604939420289362969808495805373256634418839056927651766265285183449613449852143179348723632327362119886317751877784188704850310293021488040055497767873737619110229515003724938668777070294729889573526634163054956998763427864607867024231927462479289318145055208555651996630497248512620740890740614194877698175322556975427514977956226602364423721601216234979681052602043475757685164162524787769389837788919492683146622509185924450235412481897907043058033659428522741320940961560519749903599408632104293356403212954994737829454549419023313328642955370505676179685714059743037521111198185817598878222122962145746615102153359340911481694890052786965017715839774852922477718461395329920220994945694793648648732010195322200984702562771050605403663655523092576921818371729442546794564716187124485564686722122175562491376608947893282050155386892134046867106725597141864611794069479150171653356997951080725598177905252267016508771370307005812494907169238836798413104188555422571214720886848848597706477906593092654459089479715776552578917335979946170061937409237151524379461382799670617932917270345457005743979234868845893626440881768428852400929267510442348039056400340971902542887221029293878002809754023891411313789170672361002684334348362942167723896086033458948072957722193320087797140815281777082763016201277671952688723021312775901766034190749825682143618396040864916356751045653560438889959204736499360785404437722754030065530068585463647742981233556496037963790881601429743913476643749774425182632203297156686913647960694317871363473215994667988357176546233995415534451488072981580488982748394572516839403646116827284739596642308954024910870802816291230741132307456897689117433837232504089646529964061817476591853098507505502807166978838137039682700890118599581419087357214001125467833661742083582258892348916295590463315658252286848205526224555008123553398996554893755236643443110374141316539941361936300433773978499114788758159476204368545073838432925990193481247825112756421427586268811305458678026970986488889001803386305312353194239316858766019300131642823593993829303894127597372344727147502754825236690852574676018584665642394327153332482107480476922232419059886725525102533172280309679414108006417761673322361375223559852651230931971995464453744688240968552140164073413312932145997946694040418711226018931039250978151783972059481143726136909012629740270963686328818345694195644741139828837253136983460606014863976770188732282904707204333711719588789251594511458957552439311642568786831358436843685525495420804449765655376778967409521205902205135070055212177731326036251057373386680763088115215449043442735815268382881033044766530342080829670923331843384887027715428472392917767687912843590092449992241803591141506271447121582583976510929187748133706089665070346142165452965750998453114193632130377767979228270021481224159035996445403962681212973586683843244746644271450999382342023240369628412959388735698020792582682836494033572670715823500091920755695623547726516235720617186139308559550038534554668456350548778800650778360310112320086851954351337992663042104428930589382603019738015370584064376428444828899168084368764296875405979304549583964578336857499024567276805047721847236282663035653608697658108105914740067738082206205656282041731236146786709077984590068081376112302467185712247692437072783631345606889192269909103691602891799426780180474060515025647373409044807289093860659118188324224585175698946002267106153044357003406684949959381800407594708549745736245976726269830110751918173731975918979798113622175304589621315717973399810817848106341023262538933871501261780586741511194041153404922959257361765427315257588924001599363486014073410067106392972887945046349345650341441880098496650465889576951570210954591233554745800712192228197064502579404048761823015519420910893299153177460283891217019191620679875782006927235169125095345564732730753428987141307585518355618768885502469812185178540060629500971350327557728183657364812115248463338036274309744783769381362389757127196386871707052196648888499204743223300227230743870464032976362110294749266115309748796497924788162523960062124252415529159492345181932625087116828356544860707479237691586203212095063157152690062292634237812365836847589872982098296345771241353383348392761546968444229459271048597939814798818601281861302581615981095501552977678549234483381207761122057480764916579861477701995475973448274473702258692742634526781796062390873103760332033315471378438498615184998842948637293536553316953725852001160478331006791255515245077087288376194428443787888997164122119026922269499437576733720028269078742694103421030744289705035794257146910706906726031476974050512443620771090572540767901183761423351565813414037164360590478058963275085534066091290203435106571440031825699199610143494695733298143195557734692294750285658528024853447196425194888540475048596898451757737743465382640291974713095598171327618668962811041932451881219614554690205724684574599309348465472161136978916989840988663829888031605242507854708238125071358487870702621339191713194198365953060381895951728867436772399401534971877557157392762506968639536364167542139094599837686742761854083453634140396808714117461822360100087783239740237800816263884531453798956424454151609587070586938398534550401354856106415857885032012609532418195222536485788708772585904547379100106901012107066047711639435358599721913698095342556372842798502831767051308074403184814489734650002784754028189718162941611333258388126403132210139912983830831971915522206818525453076893221619479565477818075499291009136053562325746638611154112253979272147055575166266931921534744338825674745925555431835961064702818210087460440453423599230496105678497834363939892220813230145530867681145020822357474209557512017596125687054362760924617638686769161930871528989810897724928735770070305867197569880634814717284396936445310540442789752713194611855441250900543558802866879050954807033847699948462107273982484557175386832861168332417133354061924433423137878810996564652270801476657477164158330901135937929646585155006355687054354837958232062599502594155759552061604975537633273286524730942909818453791567702250162919733756964144756418238756797988145235369980756451069585221859896058382425329141919816008259977242668728512964728671549706049011436806383355962324442790200632321984016887299822542324694400339556321364822609014354549592009437811699580188486465666739312602609522020332220985170525053309651650540255158026770558356589415768227361291798947341138089694181718604759039070991751630735594422948499502795856893527299107925495944376396864806623864048357904663682803292095337540742747916364444424420156149923669479712164475982416735022503383844364463959318183466186476981742919283853849706497650393149553621494718315722639062976146000969627451946912226681321549496377005443559460055266598727746085723779602670276843136899079817762944280798603901232840393375875058847494800759335476140150687976797477634689245074294599500622406105288660974918540503900427684663243225877526868705722747476516119463696081930145859905678347608332399195559331412631969690710420426713824731964059606451683499833957276157419584056403805920958273059888020743959530404326921589082917559414844980410804149268533131000364940895831529956366429759790334415022482468749675239319665801482123871843931910336026614984372824773548894372792614632610465587408085583494993426975611856821639099255265750272854933540926146671575124117211971038785979283213394874440493971576375743609420818152076202751003794317340662471620643697080920207380126973412901929873950125268233691319153178846563832545214383885479564557116151529737969273815851486834223747294843556757757561411876983278633480516536846048567144118731561686758579677552470212788570810881742833096073871633401462507953175119879887495715096398456362010763002456608903872743708964507825763038906821125652517020531855543068355675804431145089246091332288567076425926655528276869237027415002879689969480548545187014962343039601894890225432532799665699510112734428887320967607109637305365538179926861278317325337230402026194627450876671291424144313048614267605669096390484852036653509292309972084994018137276663966620708435678138561427928230268849052217303416056229123476850341559736006719994333989353253568865043775667883234733161728585785897926087965369588806742759068373976063172212639819197218748624012201749968019645243783172067688279086474768568295680807477681525714400189098121394692283309247173309163958839927575137578227159062904648042073050862704635957255554787654433243028426362310964690874986311015131362478126988032870261553093371943660777786946398357004364906728534444819546955527648960776129385691247616784189495349675528914538072656764532926367522471971452963181881849790484020166743332905023951402993798642840323832023380289462520030796214896581240947757511797774174157975072003805212429014081299470594903608605505218036012630277135664362259572032555050037580732477615828961304315392682785095309739581062782654850703092838108083674286770168628578187897535781396588795722751992741705307682714149814412255386536564544309277826277539088215065496514764023118321130028667075329000708820721842649711274528182675758493890138950231176090485455793498111131932830638660431055465159140184616875038457016020552810704557602950688879845342428763528222630801430507447367129005733373621521075033786550370814174577560685339959861819376590572720597823575113388390631049211127008025048282435078283914810658978938958964581810710449776598954478424740171395809277777328085504963635744006820411558777524554702130917078952386685793062214499593551930452683361848140079392527157235821073911455420294297805964864574967043781122369672666549716278078987147792750468365441583051528411489583678543038055640165284481240429045674313502021406894031708561182833241931258318191733337948473858213274901481696047034462890142716071112031099557295559792486654309001347586493084304252799665752533719342089683201887854461003371242374444090023410114053416456156985423124761543286127365205984300746181615709970602762245104469850986731079968117129084156691624414696825664618663709866089857386616008380954822935306033953470415134648045499314677031025099858028007007569116000249449985539277538640881651619816816357775815269938448202236824440040859712623302354265911927224807181247788806506202751539520370037267795169878657592384259126356730974471059315563155656195437061202510961540096187464116840826050179362588819876710506644566255035063438103185679765350659081520074208200912677703632412561686360073784008105842850063427890630594261451625104762179010566451387197654303738202612609570865610424007759046127487703783366511910872544380091590959885937524080482358389662252667434224259802249357312167420023895744943760862953793306461642792218241301943702913162205083469276030064155689002044211735342505262421241383337700603614956349777643300772336148577465818968607800357331742145315029444802868940601128195015536238995587884215595016946225670104418492701064525888975218575341442350763550762222213340476269148461406763621514615521141236659488289105365914383858179527005031572812135082630202974428757944724295054642510666658730212508797299683666790074083346751662352455860578924538041683335066973042198051871337844091894900248114037108712275012698995121719629799402222068629952179595745304532672648851070242497972251373271581878033514190615481461974145698310978868928493911869350764253682720563953072138503094265926040286550140650599940961981612361071193116669213700110468558198632451976208819999600777217021023089032775124341507064593426224121023635445600948414770996792985335730593947949445522969591206712264076506524701260392866934339494590663743731305688849127577184854542824306457393244530167252259649832066468880679828878204812616073702346624216179109461630192092929644974368082422233386978338004408035160675984704847674105289740241273544536983688391131877542277141436278410762727820987121591201842354035279053570570853882071695158480594998597954470610576265219992710653894745408575161385068405740306652337184082156648651399623076458153115973968603438400354346232874152540580082182256021876932356173139137824060613995209958644624446066358405280767430227921670095015630446070331546960728989246118700793704368638204312033215735370333961740439765808931574436597302954783588698504792676079937958742542519755896252030102478620766766677618602793770050624066845881897022591703835985128022141213133833853685566783025068089419919877478019283182862128836358138712759199503240509536802413438292466755703560565523080023828131428282079129219384897314583905801580774072025563821504585163689131412185590311050771722534006630794897964702784095184983032499895844293795412330977697810986867632013045752223931238243956632208800182196349395040536593209177615394531964002192279105521406916689117001303442351254291939198558564160222295584014815913150912617458352585767833795593786548528994556726177534882960203059860713398697959056509661767477598494675199644739751516683896005443662783035428607254165466828019977313543109016997744011316499306071310896467986299517885028488979977971599868058427382044982068250790933965124465183607687617438269705977238678298954516365459624951832979383228039451582910850409333349890857084744814635139497775554012820648030799566642913913846299297045150250059742862203428527494232114718754078012937567546047896186239952612305690164611617390811754561229363740174777482516446298486218603703938294842575693113012369773205236371656680259491084817465115840241361259958780657542881110857366104502269734332062000954911985256245910507162282034695452336684641068276354838930546341082487962321967935997295138075293652664257337125868518125288006630322133119389859234639564216213402488151211010938459235203907789428461188455657673872980011980574482673679828952151251831188059668420335177000106938132039455238548589583761504575904176673114389415971063387239356132321236189116062393191885028449324217942815469540678459677127187019670602922189600994396319869131115009315035267116347918023578132388454240777560644123163757428623119012433967348339533398094643053833961847813118784973459987687732451541019087246139112393289553011012088951438187297491082430250624371695346839249014204516077211183671726490539622988224864670364550588089374096108443190246425695706800320236223122639795570422869445858518717151344163386042630522891920358800788830968530903691550394560634748808189110857068226402709081532206713349946900007575948817424513378904212151939464584703117887066869662130217167335853731214928529857595065383938772635958168428985362769913256431301474361829209620514175730375196061001570924535514630736773830163186101822050803194188674333416261121371615168102242520104917993347354503839912569989714094002256409213777727232590453851360181620760751288858492289258378284175115448953103855447852092640112772986173053782337130878529481086020255743800959442419485665636530552904676544887660118470452778163725723362133239500658262409783358746841177075213752173299185595454039221615526347547270485187846625411051050036502322926451056339653003104375203675264590578379673707107297510408627351049003628704252609299128353982458893292874307031388838664297235039186930150024456192966259389730369443957727363554308076464070113349441185330212377106743094967224617806274472845421003721592693876930477664840145047939401969483008097262307882371110035692194597889960637572781823675951274906124856083278273358409815114788992268467110357878723494986910975754847432119843294731846323069784047947944952747809106049074433555878916061174090998466867991615513921368769639780026851097236066809512642045061244941873035034401553004576108082116403880001410436548584326779439965041604094492245730593634098639372089746892300431594415114964025338783984732856807270964514202654038513807050868003843058963568003074088962682160640012330900830302231125288508253702716852010710206094887161298721033825765510087859525142476629602383462354886925455211632898013587574379885671030461665508380700844080139423337675205868273095538436846959593993562074108144194685760783854305530364452685679173741904159090258431220747165030424277752525973926952264038515723011309087576365300821970934769175154359080249660918619342012014422575224990633917117730376536748680006144027254540116148186666707283399358170317981283297013044317398089399208745485311476777097836916578557640528619312438860815843714393538537404413082781522139197153329404514225063075538663073643270442440532073036242026233216491768506941924289232604724150983145822557886548301839794169206595605833912033213869648043462199555016255836993887542066722843244366661156252294751283523797461140507285576104279938919437746547126639169442075666908954002249184096231596915373689090794113622805264416594153228009569737980754131203992990581924502373286332958459212883845790842102122656151997276249860674890918837035647130093981186676034340713027707263510202856225099512403433455497092344340169108240031771326129333356698390574274370217966754426072248415251505345035568677375442355260499630371799486594978003748075628648041126387343841911211101094452872786833768963831635859249218483458105808762299261819823535394723003114902140504589554510850355400104316353739974934299058859747612306418333937898207004720586898093574780261088344372107126614539405231364551858784472331285374126277965641986818204072623464742861611315310574742953434163979908220205735771544185281011333122060893637381510789438966608794089831279992209134854490412269009178468281922027199110453690875143362292585798704751350131513670517069109729112104891478927985160916577934879362649948166186421571170855862012975013858044856334653239423714795119607915817520669535117959549457016823734588610719038240750455493980320444003089848283595066722936430255491688189552647832860724833153396786553346461179095406474122400806354781554116300458086269643007380647308511019480352131150451569520642570841026998302455273872904800489095390709166844702007928366121068901850867318123973397717960781016967231924101773480282264536207682165533232554468660104744873426438187381691773078322734970404855319954425920940208079155006161752538186202318750642767718840222061790969589783161509367302685891611336593961872535699809090213181386236940727392762742658818352832355544127193196534383569302830711679043364988105371215805045776803165606235388993983146600554015067308891154822789244837040208523113167024237467489800701955749982294925233511149984510085830652621306663787359428434797605020607381798748993138557062335700176759584061360596042921766735734445153682420456690119012244189461830670383696413758815215000476386200735494608607485136075984771290707530711879173698205396559403634368679170975857619764604368580201790233465398351033987547079412168593709907937711415159930331936098847483855212073745295313318750503035331088946135258614557799831196074647171181086602874584904754944918840832858979176139460863384066899178172251763855014910086432728268766665821339809788280210327279579515200433396300639623903482722452426959383950986781237952965395117137667363364847986761970062474197332076975782080156990012471578141919918199543364146081060975607367994495010677362894257152873819822907717004753496777425590295441334741762381534323492200567330046100238515953244292869520943524914623738815186626337963001931121192508834657548622151809409255435846215630576807179265751119100655671571419074337470399151145747726279595194341095701091845999014304823967528465577621034320603840389113069594531111811566192897607130858729335619902885134892957165088836280967712675278951078632989967252866805614175437592184091273728760498725876608481778103684071526033115283634566219873299712405292374794575326439553837240928719543814447882282456269842310459196481133879082452537745089374621023641596995449614640302707308285497486129805212100612113992018751116937688432873959963724534554235132449189534798776663377659115456823894477300163788709057564786904979073975575340681263365614723846923900829910487165066735131771491619043892797930606866286752438039030369134400579893581202192894095956919926221643168391045661625752091396083316032101309484863548051752367537312090398977154901168201521176373283376280297242666413245084626276070436845882299678655183049466697745825421490024022901172316150777070236895592492957456064090271571044484085751752495319650148065059966994033619950255347496758026621408829243733291341785415315765500958317626300308732208779203150296207713926642544137768261239252732206732557375531875850625282876488124538942371932680295936446930995892734822730353375400500590516426028927677435456134895135852241265273734907162851399381289133408719324733568191702318185766464696614128164162149895981305533196977809548119028105128270804418764238572850363598483423293657358295246732503953315337779284320999402529028971639238404905052942996569521966526038796023527110910125078782256428358819597874241382400020975276976607237199697396624240179497478063878951349845003198851500965190047472631612570758676786661536234299824661344418486395314815156912035102091822045148425534645283658664232714194515395842581115860522848237274650690764767480822422364530918454646656013472579139969209830569495720657725330464361271839899141669578488277359187691962861715287739023048070423861233828280648588176091429958490612976074968073779998135660119905951913060840662151171578242909962095254671758990381873100841521481963279153268763313592298028735167025906463256806041769641406472156275509966061671891590179018880469288022035456512853722281993172448441413667905744839467893812513661630249291270414496155479194227720121863790137606713414395830491649867823789250547245104534793419910294175879775395184594644655712125360411516769449927699268291511427617073509944485651340553798894855674121965025518271556111784619123316178840240146775268039988833554228648058879371523359666619452276949140769748372748972488089025857741469015945229682583798892426273379044989263806952165278904175817840690017467267293294005762501664123709640758039605623817759482356481393733456360590547206064195695544341759363978376974956431060616698064972494854894968616346433137165245006781800894332946916918019694888091343638105423068151687500711797841588342321683491162358364174649494841402200887820266267600974976895703860690819055965230957982630946019599071623569509706173444560449075947731864065977148736402949503115080437421788845933578967837255067621885299910501210583847789076431215409509446953017583850796335327081150556731612641340761163465814156280116980587479970328191311742447559094527633026169441246118597838969632818106285158924515165216279686158281078919476710896772286746558413019494397725257881971581350645690690313821104316713310433179407739356498177673686659070718541088327591523536433304704687732577831570524864235177549487010336240019132388796964205384404984219912195949787794118395042917149920097773488061858848881222246924460771215746428317472484025986118003183777112514714474822828108655664704826586168607615018079261479048959065623227660963156570902451793032178329614617735501860368004941687789877071722418610374627688759669472012367823993965288155751466595447349687037182893513808949901394051163459490974866430748479244905611497169704012587768366279728204183568060607011789907200374924789767882905738203867427107776132337517485692947965124958526668067680777319223170109141281109538226237551875590715841861226786180370054264431032229606199697801581485460978698779511767266953362504352901540884309560708335873930854640741724385848415080858149770403147123375017265569783306376091835112051861309149527708587508341663870670590142575688439005661782136184977564436561964965501612990697859545433974625567532896534618105663091001014761884270758506019621302259081352619536857810283607480455691159112836265193660406496571161057484234783164649262892738104763738177714521463079197556411755971742514989033868511727785999592253726215539383949957496916338872301139768803724655609042297284299153200984654971852871082335634274935786955134067957567708939124611690879691608527657772787399630198131986801730912929559967848084135210751256785692590610537052077854875399685072315763542093356700559591904564151695947965681748657632963629081067861914108642000553687075375966078911105705450483082645447388571460825199629753644961328355498047570249471500155436752208413839983402090346935226273413050982729249953999304339486325390055981352747189862432409214142521180452650145478082223897723576051258359409819912865312481080922640013114072589957636977787218159033894777550329364868030470604760955109869752664001302442134001144861254647820870112845288347583010887678725608543005467020292294148579740205468866738389530895642524585479938827961059401597214661257717750867841344072930344999343953599906009941527822047946590929187918983310265528382866477363137336363174646163691689894609648839788893509630575383511033098360000154010478971029785288676186234207208542443064667685365261998616859647724577211462835225279906059018049784701170440836428271336599748970516405780392818060028112683775627451048073121508452215031715454484823304303795611213067521674885399602784701183470078062547749744269690039741464191707528303189554513333143555235826264051554849252792558051668414546813623117369124479894582296212919712813712423761003256847055930418655728510469737357360177318907309867028238617941673879763810308828806687705217311574945010738267196585444846676183728790370158918906690493435007598419189212086576856381745608180458381934282009095101882594986199600011793248552192430828197010071127864482569523999223044828036967281529552079830797575067389394517225884648616584733098929020312916947944414276729885246028755481083838360816829876313504213188991020494379059495139871726746653599394796560067453049417025984999033782410496273616719298377613000966911236719285076406806383306004239408341864330138154081072498960131152245009661399299437601847532459639649186803696671761444284384500083998380604138602845055780436431788331764401371967857125553442150054601683289170622597607895911129980022874101880639521891409396022135534574410967632630527717514140207966155888032420051936461904809285443185928843801174018497543712039671429363636294123747916291760190929119798667499442250012558217203532779630567746912722067711519599377197054178749748032958390930175065751252284794469440776752422547953666678279760632675136323206975778498055513738655431580207827799507869018024383016482124363137649485992254940421626760669398017148868255916494141452415413003222825562878414966054034076602761614814282480724316470189425801703180778510493193486415089538717996856771168917712489254317759635156944148979716126501127635536358325522531692185487264362589473348450631344173968086963903458885143177380925572915304435517532704659272575579929593611063967654948995106820725367883512409411554769165491012582021264432789949314678757522010277690567261666902996585531518014043694873404368658681451698179975633143206482138954115955324073309544276128880126927497234534052784750942626426248376802854173637873965757981753826400631796318889290431152214985662388447829411257526580535696797815196141662648633889552674244494441351709428155635090348144501094272090399558171971402367980695370430301457727255068662097104632938751385983567863315496341742055732101316566602892886221380320133922378650407721824683499486322569857032019350046870880004387739267394303005332226480726579249479438471995606003533221982787781178451821047782655589924439780378353242603417438166563112811121566965413754744476794351269757047266191899068129741354046062900637642531548041049402160628459462291234508027728228004338013520697417020808178864404840188599018995008724075966533537607876966926098329941984927308915786454768638282676072168224664411305186675672764264696134563955738482486542471118926778201431971411858186784218545442080205268414196981004236699219767929559540158986913268344000699687097777223416268871671673228255856744705170987136950664345425012910887473036968460602091182818065805136642346729025986505256293073763859915358942594145649198191107476979828662107812608192845059415247086225603295493614737508564228336415382948606605114103260749945346604729692396564208346540662242333101100383800427398921579532153968742934976671082697804189262500577735991390897213084718143618312217663901153257486723790116483733962332303091349988887732237960355647796345858420491822432942626718862676246981141190167246206403722859273247155953717627719737233879197280795651679553005143753462565545403831751332558438296411689004227462217217335025631051140425389117560660819929305714735159884789111561688574643076386051351443712521558122406589761423500705137726763431182896339746867918491276726562387706575660313317427034860390332614818889825295641717843570768436148492410596816864378616589010991123122322825198176640429797414743000097645371454141275745967861374408796440202527750857959086672210794281934994908636655278879938784116825720036362886476547350584449105142555585352992712461859219066355541568763016099229135976388007243407143390798040130964718301827183152019232180992751907636321836651336582218098788058399949690279128739038146333325354524053439623218216698875329110222646877507856048748307565452686942546939308857667710019631015044332795200885777584513978964282274066814473480132849359144285384002956585293715394842593885646473720437324572919637273319252970967420351132734692181731343359281591709052202061344766338974492589853653711444669642027406445779000862905863971914821192623907273471111109292939637514477852743468619075510693298182568696414246274221746456603417746150888318573310762793705439086340098645934359086437972124898663186428134515591334069229325951304755345166580325663830055069480161667623854269095832971905713283347055315656392523898051783643911124847919072941047552357711771175894361481736021370095548508143808913449120403546875253471154320596666792947128164004382001567031005484202400312487359299174550024820595589764737844518994746575021776542713139405997080418653597296939980192645620338066141988723790277550989836661986649759621839155953625995008893465512126017870364451781217098436447327327665410151444420745484593902999943015444650752928521176632971134965877881333439726569008221877948977709631465941154050659901635405084536909762340809273332178209951392845041530386680156002538156617227357563911158277259153692749850392808644563289024937156832393090252477125073134806673456163182987047704062862511132543336543351128116673238890942859621018130969509339231340685899631387939617069022523231258571286117604611604730328029530767916591319525948665939489222990479512660302469155299542815720662274065483859109288723009042299017947768343311457881902717396207222536352978086761840034076869753132576326389777727057704610836503264674378871108950646603424952883116934507822956661675593241360359906495716466757061188850992963076738638148816834230794639541061691264747101755021747211147253890121948773423213476822897939468466046719724399407389230405010110026343459340782774390418260228304634847292060705362258493597908970102818613196956383776808635459823186312092441608997974658006645259133015365552769259571298867700551134466774731358314695760500621252614201319531386638167958992198217678155665052211978807996609944185487135546411058907059869852136309231086886125990157754443281653023037310315142154121108608505016741105245842194990063688998227362921387224900629883996702308975890523505538047337229391229936323789400266093556327958675802752980904511677789684598483451621716364979079063615561225844742516396623303159476056890468074259917583528248686380608500208264127159277490829642034107123407700138016117855495059629203150678599122125061786685868828830709323284254118480304107757108514744545548890156196104912601339629315120064459840754718885681505352771750437612426429825844116524541100648678811749319292415393523055067423586516071193804229169926156526103253567061062721038246506754641830470995511264244585095509305156616149269536518209800006022597003275511941665609465418299113504687039174228182060457987498162192587997452059597044826220658723640866094419069851877152803769602874778702168128257500115814279911836203911255039550930860413151339231745279682555700804052959204416357005942095271633021442622057928746725156780957637957407269395825931350330423174074626430767470674140773797133380171403283611277814054074249690225930874679547092270565918217486398228404344761309610571923146113243015707167593149910856475947175497547030695473864860168387831121429511991718527533304260982007794126315057105302701161488500013214011543831175888351438179649991485800095943289560259184024723396480901023106236600175925017469892288589728578941903016100367051841470882435873134684473847339325536599715502197412929297850569928733407447892373807148010932083951513818470099591083586363067812055141639911855804879618493921392940192832962612395218067964201109473076954766983524150976011236859843738090721484833072765635994821557766594583955443508809477677011485232561848719961786165523825907896744426130129474148536283916662281640518394973678659205747373319847424565468005200291726469366778073152485839838327988804319074169014634016103189511165549735886787955641144438183405376449264635615845910077338799452537410491627834008314458265386298602093553596157720947161653816023589075139927646661988372136350188946561246376847859524913376724142571657423433185268547389839409269958396764532112308372440302566807197436113646639907652658070481587414307463146664955370280212181872603128479468729004162088278127624491059174332554148113268778868642730801329091079258134389442287204631258517644899700448742757318434145896061155398817816688557712572796752409259147545163004509052874123256662323736118892334212982915164595994972372808755642859912141245977892846557454871775100176504680747771204291747864296263264492046669398184234000101895185098712606216949721253830168565655492871428714370885134081832191393731370866977424152663415431605141682420616218438828406802978215986825903864602996803300990663077064816265436121681504986649091757929225995135300917797497352585386273136993083093756136268112591365525983649275777384291189001080424586673010705973514414318730912984721633137607870977038286392660779360028533665186287930983097783445248819594765322252246704913074498381987316789850611353172674050829747680975451728847130695446194567779064312495297562057374709383580152783800277879682188455381929942308281631924748675506391615347466217170441506991290427208961409828239740738244018973442005800211067151494502757170138396690898433263969378453341558286613376134259556453255119493229050102890323437467940041025421878115743736542131327461814243885616926166393902770651052003605936175694296842307821542803495188765547801980799562733817272338477264839362025091611911799384973336689338922428036494631024665239787984452276362076848748728092795868640035844274998414607677752396583443819470108296623525549502612471581184739551602587455051192050559957767907522114786074260039062071670157480990621113502426289948325070706222836974562786938655945473831672293635438593523514896586660835914107959250711879863801596948728398088477114941621014593975202549026172100849182067273069252820468025393824739313378372094972717241808658230546264313233937090243533870047645256278240300859281986348936614981879780993456569534731414965458207994520623939607244290765359931871320218474392439974532729172426006086598509220492669098844039028427916174591642431037189380741845111399788707266630856565548547964535508425811663694088602119473601602004713996109398269423185383558285423914515769681312798092191551947470748061928397705742067773696254824985924255902015899340637167580486164131865148786356582450816186144574062575581309078118954143290744232491622416423472854848582625939091925369392865660219963160757969234480559725345996757737265436440154353389734365513256008714847013394672511993433015460877652869966955466790605021948502352617202777420992624978486451810254053519216230514631175298096514658894759559884416242268233385910515174652548351389282095604016177932431591913535686355554750337231867188404718740700174094077685229578783677301528101143435391189425687315843214710508850515704457913399561013575168825256156394309882192811333364834014171908380275781433641254541808161139960257328960381887591828261974976399079538467367308683303957387167029539608256718571754504647690739111506918881576621501399578724840365137724656736782120099520896751921092812244432006600084012884218423318660312581948428680208821299243392536503941798830441006743946170390386462255546661158714247602184963548245466118975926420949331293463815520134270619548965150782745014965745139431897659709960492224871698610841468874367116878433150281912358207373756523903680085510895083626806603999943229409624407319247262175534507824306705460504338870416447376322960128940270269436351722971561030144658593579380332420418326686538743866573098265737724671477070164918540368126178504806360078517026161050631757331087732785168131129296147437119294252158219894103730862900532857860936130112340597994391439462968087616988366071327502215796214131318761203067448533921077441504842277033373459699629670145219562923692999639014348827388262306936410902196113931149263809134064069632251619769523568376547000983446922632207034901419980365720904757223590914038821947800528069220641593419220797257816979058776728639514831062126716017484241286075253653284950495118137689446014048876000743617388171496641718243024683989089321776634619531544949194026798172669116139943463022250662579339189634979672309743692337986923002095420372096374596575883074275670653343356689892274398708984900147984088363265835240574934019459098161261108271159887693983622936863577483583046003218929237600669492102644606655039694053307230777331441526853582817932759603574873875604484446143306551917246638407224416822341419378797489900231269725663872273477966975514256480546991143894980814474452747150575941767771687367570349096135674125624451769874199366446402688216072144003992327680280759507872030023542036245064248208018910336393226414314322776083038081067754774385699189003854718491174636825107194938531580787286551241193871525956885208010293713430861924527818934270674618215768835036517203041107471857582835276603714655766732330458548714768846136556509874989157540409285800254208906445677420774816251110070537620545804155859522197499522415013798330639150126492998327204285416750773980655072428470761859444602086993151698745881611601541847260723005471867841607762631668776184333435646412615686089854169000808735954064128412710017565830386922207221268549372971033675583359175241100485411250187637809856584821053553427074986815161168741755558485059540668499020054127563418990138555229493972968308033022754163039084314554866655030367906622785151813834401330078091148830731792940434082697283641907414996722499737357405076899367229767466991592729806111358080462379673944112073046244833364351043188023437072836539013217341213041260332894410700624866383558384083796869107416471426871259596402752472622428031723994220469245049554758838118323019664424320913056954008220474954718895053216818606570547222184374239809908581301685639218157142346982267475575062063571912572030516995020788111563065675934542808350193514617777634764577815947061372752539639598626090766959139385278876928271101647209004794155511943130626039317968555118437154764890929802583687810973222615138830616494107804399964961646898560700417947474564071972847463030808063470408093554157800936221073422545448562749648734892455775517705139936404757701935903435204200530978740276979991715194856388541985086894579826333058409734706923932731508828890945954515654188196069925625102177261490204768025365292294000557047178630935736127567888576435799584768901256689749942847155207772696380179706926847515439411980691447849408534799198499342103297354828447021695765455550486027894930819306610805663413163349835490224575175138529911934458650770988757943973503723903642135778542530701854898683729415940030123228943850903334296486822062865635266949618295191938807536064715647351201509421422887650021842377415583184338055467823177774728062059112732726547332060463459372753413174587916262821174356319085262348618957544200690875243571551112523225826665945361156723605948682654453315432152653776440531698856073819035257726703553522303454249174409225633343825667643768837255816040792930353846022556049840807456988069361468697037917202664058804169541777614897837576469304498486533759867735325669576139108732312629638706903460670581775407026446280699514365876343678305507442172448618062102022561083405843375611562389695342454420464325847478301613029598476653553132962316656440767176452281864899253030194275295320311841813407449605701570364662640665465161266083850273894337290521393295914129892566158330343164303834139164783652285310087828525152007643755402121525339044275952529271364335008353251341489381403113001500369152736140905870330523809369499293785238890845563000070472411331162336323942103882324964050606737903810806780409015371730639169099033025223116938889995011789387965870671111099439680789892702899572613870401633900115174377829090030303702733659739507497446321433453522785055818902200057790262258464940865862133123726463585123610486126558324523226539508580344753350534285314842451144299671401886427498719951691388122553065389302726657507391629973456390977229519509483924920833394349292782293655122383560464766104471848540046040253326863716979551393427213374953008643208234729431805169975970750432751671032338607642482353438796153091299146465048668103150688134598652465372378538550617793204912244321178556436702125885365470776925628501066518690659417054338458732766577462643874928561761720055511590714928218121746663590284259597970943451346599987172573098433053878327318186002264028296630424443099507325417165699385807058294503371588345431413279813684887314175826811018643257842554453889629734768914002257716789288520488549976975095816987819414959781613534092555776250941484082902696338424196882298306902561338050121473279262116214338396583805173084283915049981834254531108610766875717549482585956955772503759304421030574119002071605498656233644077279541442843870680002899271677131827461148206130771871489219883475994653438350409932637319461580939932926131177693783254701584522701380208247302185629404730412093216070240737762444601361248836632818130649142286820336279201567248101333703917315827019920273215856294650270310509012051760474832437495338330460845747802640395764732781264955393793806096824396410956832489438212399300021713615462826406233699968147998195262852366201223541680867461739871409946719912836363762146998723871954742819013298764984890071934567122729482957003366749852327631007316381175147715707727490402391789915819244150362331827122883854634088444440315029657847210587147851165015351670516277464859485420861260662437937610363122322397041336559696405768232808688115541523909165237947580869590655993839527250839645677852470549388532102563512984561786592776972949266904679556973788173903034356865246532008349172831447595277655581973455126783593761640315639356954095334866931024261275006033313943680419087809349885413759747122946817973769140900027008853793723823845257498464403841980815379333499919913599880691300152097340402945575344503788577112135130648604194635469720224343835468072579620550872854291601604088982883456461623967536454160333656347710637177599692604378953467292894717110573203881747650762189408360651409940511077335916811026107057014927910135284335158985595891545721415818859585047380118592601896517282988445074540013155077526637521853395344047992949722140724376882415054754995228658627560026777197338834141997611385675111863157788086438785751721082992926113138040880793165174059631564164942730668539325105323655611514889381119195448404154341979349528986028711149838418582247108178896216514087705436519787916440880158984881163111337714151128554287486231438048125315068661498153987014791631634985514929114263452446709992832564658915931828959053942731143336747948895208388743035003359960548708810709670460141561088213230865995497914893194084572311245695778893399034037052390663643347370271615988510849316259481576672390633327926429152865778415229282209979601638315398693006332411441895670802766825500065793531757700854422240900916675613751229617955628473604601488785451260610815805109786072143636292093132537222287724434939445998198948061210814387875766933799314616397250848332148749810963602206491367280776039750274693857800875337862001330829641367349769012426590706707110461391112327745229947714711898414676870740802638242168545180712344865310219737276132338305114855156050481434491906122028383333144922244159610573198333606685176678925891463969659757375915843175075957691873644712395597836282363169854633294589932458397373175446552818657353111444551828538919727272383188597787028158458907758826687866991222963017695412576163172702582021365914617201249640032833665399447444859178238658886217679412277961068838057085894561314426768765575380598115436042397978419157064289547435414826060622991705093376614939035672852374911158175617167436490232020024203937917840229140053713331397710417989558923873780183875201609831177018840936914152763536256152640132913653998817249828860618622380337800505138446855256024730696120139034512897039602084650790518242223837479836997233910532373063611736200419079753171965503405756200343286164113576927448003605845344990923127171123264889645899025164157910515452674850892422806921390748237917209493415312444526710380521155785138081779999422923088539042854346907782372033477502705580736308549124449414940276205832222732231311238899286310316355408376983273825067977286265038858843869896911145855821560253326463639182679615977356932436340869752454245702625862432282377996453422102963954055388023924705336005871682826658052574797177060317631222664630233883296656908145400268404958770758410850774846275316193523669798448457280445050107508945646615897060665558682084695185211583565976363423339927452547319179804442844122941672402599684417420157668037275166153608481967193134686844620805957473764791576733739032458222966173724389901149441673560946227635617814858474747069534227658026927399267226738275811768840301053027390313617426067280820031835397995610660197592604245555829485700275817682137137741358701615212098216895095036602760777329074793640879656549416915463286437404076905720520772470223954075719299755211728960473699978863664803496184481565292061071531601205531407326423355942743084816953002737542613044714538531144654499753394298628523017782438904375971075027634255931925155096437054032150785577164998742124208469864877843423299737888400743370894787135937436790846848107803639264119439483591314841485812253825463324904303795766773807863801210195208950055731821289334676643809486157407311350286841372172054453863021458314960986144538644770677066296183260807324587628030010789898168035778448441143359940951060179201984159619085226302305243251554334965350452894023548246081562269665522090162273584694276719457770028373978946944841371586625413806920370866448099015163601824949943444494590265288165784415042501209701754284812227304265849873132461470361841601753419815176467882131263385259170635843224785482395692643514517979335690134294339306677216719762297533581028599752313815388375426444013735741125810050886068330122193539272157628138613958155458594890309224236658577690931710322259085571595954549702237556886368552533588824977225392028014595050428887538732526263921377787152639460360421886883232114787886287388360894233684430357374782914546087453488761670521547945750292848216806219929364832156860275878290685850100310301953239748472779496227815940188269402912539132330138686204188012549222678500100855611313491185468286501238291423462194727556372223599271237365454099174260083194228701207949857631172274270336087006194084255056761525559157664347132023799807327189670634618737676977349932059237894070362140764994289646757631751904146232939380847465268410801008128463453665983022190768561677548325159967621843231252116952315603210641401126370849789661198878854843060584127664031517104621983127576773219969844572408335259443497294903222935451713043087228332812037719218298193608306632929786426922742618357451991258422925188124095654006772927836305919403795617819129121984928013289410491227513734705300629742525529135243772165350020675261214016245546337208438549725620087496510739459741091462875921286838914291715940430609898749632194654684615185656641787854005994941700399302940714230789380371967851002845232819128259416451753364403222848940554347644913917845289219359140431973745745138587467661073548481134854937710413145977703093616514178976889288987105571271271944054869477293208011968739492999860031084010377384678162750897871525056196875771639272407587217779941383856308535783217318953716777595050072175692937484363178935262754075459214251311457980947032507641948388855305484380517471763778389516279316907403469655477022982650841943625695903740932514917935394845562885621945733207468053495932844846242551870134774053968970589616726858337215305288448706150641419055665534946121817575886494780200132037373236822309404567922214584131984254078522862050885531783756059266579473497554423932095808008466878674494117939934771789254338058974531170541104666236418626723501001861378244635542425798729144601814403461076610614085130559882893679351669124438062618425337489718140396464864628169312619921569262693509281381833557570413445871975379869275426536530906975141017994390658182949354067712750543684038907170867925066671405849369137769938846285693207692041902773112939789156919188417079670005324504689324558721586832575428656689400936780575228729715003930974871553906999019260054244261945052492469755761919014218287159126100000176016601168256414580596152485758470877087613563108893354996935290886083655561191835890839467265384837480102311033056110249366983720053755275747680297947865225269232738978902557113820806752308442279456038077290217464736077551455177409426968543462355482247196029117083418002267538878239582531443757795780994584105962087242327095895050335800194929249203045907419121458549398177421163489320604412905348614952178916980656017296285550972054682280890491625273080385836537674082061279945956930175015202038131725950132074980357292829547864594269252377016443524616557842109140315459111855701398975985606868498458794603058944004795791528644488798507123248402553773061628380638787074757312493987845444259984275675013877123342255113582115700444679241613266902991216900038952804434820827070889322120702212133007612706168770054006697020311162178994997920480639229997232883005233555294411223867704878804247708009684131340484440246547069217906290197834623035572837605648376575755903329937166803370316091095645663138942415783419376777220622890554666995342205669775250371355374652508896032135035939563985768113944154849825958098604259262926731374071707996616579243883636755119569262896982995718171560352554741336563017726098780084804066338929670549426154704461995533354417507154760629258017171796330199063395438988983808861678354214619577468446879700714795735688023910584058412937532414417396740433933517748472300380744982742502375189209624092284325414847087945437248100315478192944458178757473278839474824756580466610656526142377094289683320752334728801067763180435182567511864754064104999938277045344751420251918329351689351158726264303711641123749532746888928133096383820626700732033341419619782997786740689935270023121595922560236310688252065952648338892684357720756895312566198644451748023579715433412201639754727189295692921813660613261809353632577772249455731523902255468118863876582052649424827635948272261709612971420898261021462197110152931742033445904276027628128527821296794444706160442629422808852206413471321987845079082961680088438056585802089152158841035410248861626815657760866929537599076738590278774815151011034284656487771164593391048896891226943281410699111498173750775349540087526959119694907224888821931240234797483160923574559259336624740610710729446454964680244009584700331342758148295937238206497238402333518430451497226054344488418688308516931587738605528368617849895226777811282899867467996124823518681014801328415021388854924792584278709473534508497918597076224865719697560990128318091120439024317550268109902080364014735453666117558007521903069667513205616277582809982846440319405008207469216643872266042980368197862488412145060947263748421036991544324337100481741412777983570742069504612440469826936055465720619018320001668397582453078886509995831554160859827616229255012964781611953121818687644672955205480156353874583097797728652987757666175202061161450391689605688253767694672814284531066405061154114480125435745517939215501736297420819340247005913418286747162291509921962496405943617750756142375389041574161747236195498608295498866850087191099026642540152870415622837368708470294831948029640681295363833008114300596341848398378314807460064604557367344767078763772322753964057120569310040446829843287161854428233155177756659073429692102835754649828949158435875646850866939941546976823585567968217282493960297458384505735522531040874566006431692236020434508935768700494681522671759067515197087383395737057051659587937605277286109781935226785361125055151192568472098078621035217000495852249635977219848207337511544840819264221896315947286774679881240477804385234651715907119507984643464542169862022704334030683514718710419554043722091275188000557598916484353141601870473596474600242229467655921537835332192474352482671797626813358630661832233952458428483918114218899915770385823087696231682863657381741846476500317884880749506067772408770820190080714292748119913659876934356918727842306784260690449366132247774902317057779078373694857690582673965165403406017821916256720682068628043714790005534101976081207895550161212972810366108598973214435302120616278567070593417734051042403491128391317372241238839727062881026233755112449065893521254040189505922259066370506055163051847016250073638357786455699081179362195477592888051006034437268933007191566771166639549343659375458036618482463334366605914993513421819431690154909175197110558814899451777071021494446468967565634547046975208782451394765623227062541106493795208248361686995506665740049967337815947165407555393930356653627322071833410699078395806668610285174028904860441797179112600600639930568939485697284074876907882333764127928727028445570940884299039314282127384597541819975708101389559696679446786177185623200696403297777583571155029056855066573906484039597321087326548993409745649650801705873509083855251254881868473706778347104856283796265252807255283523327302765892325120916650485886673412081004642284530679955406278120939200072129988347489551848285907249286540999141066590424455637889676566141562033464472644959662582418233799970530685199064153226231153795233046202340049595029435272744590502332278338697119989783646387181242585909534106639237553884409158367589358270581630712869249999831427125161287895384936323592548789510099665787141888285558453540242849430558476161157536265404354108606920470212410899267595017239714235473653092119294139660808101501518941773450474110010295087635539264123852543705714801126530006849126916770187349862598076392217781695383517979941335155541756692653888701591037841484947098626333652197004001069342146702756047530333789226104081559522028954277112584504287195227168917786824038789827821321169927828254385830367368563495867245980181150441066989456292668765382098876607039546772184989963456231978214556143022436516622486177748001034769463552961743330418065630565015638577946458998408349873087514079365032809238815270411592912693025481672284101263348464160633963895292007540936250468895066869564822231030249241191461070672981170320220944479824776977328438249026410171935682002325921098633991444276572636557526915318393842830204986306410810241376800386795806429979763633711541533154515736209044373174483811379386592831784728486294636413059357950393803114911392552199783605891087763069598689103707783316942492218793880083414070507415486600327958991796545586521887848797851450059347934629569493872387362628509574202441590409544323125408713662241138102780079622507689270291315016999285394543647280940939416984150539466779730306593175921846502389956470116506749396140095923565948526018494842423383056306362776610775137347738420085946456944945900122057313680043264472449965327572194974673659331045495947396841285124305183192093054006404549330064358530212544731956126918734083280433015330560576149575887399212706819344788104665821124188382334039083286231845342324528744592926570301943235614670710609799045145560378698978862793658580714380527650877023886943064613388308837434699090749545447169038901931078270317825106997209120619806813663299541501915801462646259271740485711171458248585041935856524171785539672476716528050246478585741662040455060228244114650147025918046328504426431682333680840584942805810258831814120288537908537021521339627511088043912799618041055681154203019014222576828055180626588950624353087631607603194563084696706007070436084519708070674342666785113998489452083056181656891454207239441859040663147632846724797884052338288080190972609442382167988357267474901943367569722670973739590243785402828733636026506349833341731321946134627393348209704227334168954425073320259143444752609618473779083428183191610150883397229409872512143726206460150667554148631082902014904769197673723694392120555253018347879395389284580637843690227103442457148019721516113397660897214746043038840509674425429836044036762311133279619932312800565382017937382555158673746715789637143555474017925196942527093947658325954587961505935033858178828115309377716672146273467718174987008837326329449760467293145280424071125768719652634990826784006044735388988187957764776470122906414544253922794775717808142846454960451778527027141077363153048979826323474808182601601432779776011073470287966565555076993451905792337909533907548503520055897607184756269063571601185288797401875142134748697111857951224454624738052497106738431873395178215580267503425951006764517893605604643013353102174328841007067982109419984281550312300783613637392322302179989279086761116848762774762502012202888100027265719193802095149676470057229391696533201306824524375621890373453452488897402655506721927659525686297035840718897328606864954244852780947705775891468747823886169630113151571522909024446054329210219780252747357551034586598872258416436755615809425188673460103639778817014122169910739458324457171949680129570476356827797260843772250455495930885279826949333396322946823749779537452903540382271827296046045766108238403567791533094750007830367338856872122339457854141701553352407345989036975037365016682157028332861555834823423802047822530919022446274016335701043969405964132445488991671099863410683874247489510176003878425103495739374524991771821356565152836696813721617832310686653903345308241849625769544615243289906153389031406585373574516771300212379558695331561886711057228392646319388640389680146469916495611923767584657958841561488466144579153834747735862729483306655374244852073838147251494544042696339166536627377851751046435788575789183366760999903324259417020966819205843962545233434724762231446598278522428291923067159475258833025928818289694964198456397762406202204802285290634762373030412278238287984861055736831929758654273956746203915291200575237266638529578620477235642260675883266195961928404185169215758169835332914964647181744495236599961752777786651686337379408211478941453403843589139568337877074339299079219372729651419375312378039212785589122142578218439860627793661902250424817214648390826833787096846043280014338778466294370968345404256030566198467818949503172578327482951851662374228355510546147831160744864396900630280557824486094933229210244228366285201704347630738426991712748323144237561200652784123461652151367775618544762651610860939671081496709369396312270708468271475569813021138971213967263614442641488523559912014050200202115842384395210331776550503205656099896552010771393579390895715050409887864948682162485779577866674897703657862853832947352135101145805084738158801058025206676123537391825926837439715831922646785116227869034518312505417019270800098688825554786179284079298565444189843331379446919290894640908328523140883258706939046638100658593719859515562114154644936635079700189997523661318712309025659280297711631715938540843360836349142053799732330283381085619084047999960285906392502986453621727766391846122731428132658241111785047478536982817828928552769464016139478830609388089149970407667538702320659795354575447938000999705363538197515089151081856919340113577756897084115045023559934019373319594116229476887310159848558020867367812554913654304746134142374204573292935271117895236315771355622186775021230375939470698346666495557950957820278136635149244863227650176591252589939993567797052010981519817843488168364462176410932247372959711227161060443787013397425641083977249292996368832180458437596725383492891385625050755533757024957671309340013392536109706730569031621464985666628652394610165388874006929876447179716721239118695907221883141537987387643641474822118339992439482772997751564636107918120584557334307490678959130790937533774268522518189177528490522488038262318110656239663179001332587510330408284804815487029178896781232233289184124421409712946058839304080998038105622586155946633248330269766432545851357203311630575336635735093570904522094703117559542911825289302026662227500888809221264287318885883260001726762449318306301563404080270277619077247769531165779281606887967863444197902584644751917062506902014862487150760806187592673921252919028485984410748270371734342527548736140006150769846951492820139788455607870550732522558021754422805741011136430679415415185727083124847728252991230191459478217653936079256381250086766558199346074239351782685212505331801106641678981244786943562455394275951934526217682287353635854471364078030373473687675662018790613340175670319551436324038797186940538668148836474215383869601378040344134781659849384044096179943963760168496211314874150054981508964673823630952258806901458569639840656775211278317478242307215406338605818576066508654793249041369413257417060304653711597464723291552794366107231714314356682771247786097685607063950052645755522260714068830711737215373019845970095902682597920553910252527828808215572025109359660995680596618269669422685852434785554428074859274344086128061542086185211159322716198050877814763821468489333189791161733100665973550161108008095964419544569285226862547214441462639449274565939649226473621852952177479213519055566155419765008330419994674060810716882785665716939095700470087331460216791831728117556034000220813361306580202972286180376372965129899825169770569343747693509449210262502281544741666201818632105895226947502426179542065856307528014046440008063230543788211348837860750978505532605920157386593245889888614178415176652568576393716771320969463187135959130037368049802210875955372462366790863138276490516083940854738806221326061191017606005054060934617583794077994184572986475686810521653942777564641741864840041304207137407168216715027858951602989261415479564548307385832245113390323536460352284569603719418474356588695652648214765007962485464972565597987462556040125043582122033857262743201765556010328158591525888432871326208439583526252595990891116018657045708082586000857601046281258361874651599756385169332002099250685295835206181604659777685434526376583764375395930888894940296322288152297007211894955081367454058948720205248953163621206362847669369776101203254809976489911021598618717340212344034088666128779788409301154091648257154339304467646579882339719257521529848325136361945599065686920576764889481528192864413985978276416437712525359259497924024098250534948242561000353213230745111632675860510657373505958815568858850767592839183000269328118422333644297934263520733698032325258077414157895477616691468343763889576728342085766789208521425494906932621749001293791842065917151794664530223940921619503216453138129202574770014495879931770771899165411172928111819028606194234917233420850058322853173845609586334217611129534266617659373125606043682366450987822847895188970240471178472228878655828332755561633835900224662393852500412038615289232483105259220099782855720392185924668557845436763067343052236541067559734724416440291109361889381628670248378092984953970169896324963189954474057769192433184774100947572317561748058370778601436904302679906681380689504618342745597977804014704071425394256556192025660381972837183847144498978025685503620763909172114894239760980427417475279595835026666904777333710779174759795510122089427211709195894386509960992677690241027441821185568611638086138961902391949791977676702923973074413378912106202716058356564991078874678994897584461340604915999221530438279725306984678264439229435379721149756034774366137177419824362603639202082123245927388532813640069117922582538274758189880729103532725271794510273787415634282669311518107462504722457812123960076659703977117394085545284802925743141545079260680957705208633132375991026341492338816920007893884041571111917834507555913299883983241002095160783517676478130194379426112887239228465879542263405266830411373486400485606187821930022739957096207935098245562155223809483765391993268530394964258596803406483505586665500684698893304837851139470189473230732084606884394061141345263667635417217947895940633817466587097418784277407532817317516532384789016064508976247965662568108882108671659080322029488387655687847577118596103042587960268606058520288159938375524278772069428742132324983994375843471008905260643918883694825546809363913284767182335226171952744217914309182597235356224321887125633314786136894384127092534163265167655339401446051177805528664782218644042774241096589609814748532865129121072625908977454871908688889831431228649300154341147611864743884805085377263231820762298972219890917496261897384751940585867894618718584392870259209073209326037630389993241278589024499948000378258702809180133767023803261563676121550600340712568181766581614195916214509076538875186219759567730492018605217623964760684849747154145717561179222155524730215428617389223054564539978627658585293031278980920884968922665770584461924917838149188211709159883029904659642472605690687273203549255954879817120991015717880040098020190588969403299726929668848149711340994610454018312552365190273769268994244290932778449045529682981938328563245963766274238754476694594275570554535726809694683793826383479039071140145838961728573158420035393630109093368179209998943154155799018541759427884456458896138627778879599976837560961823409094472909339369913469832267351680599512518464039698143253120866435443419136666274410852433709466168764163934725853298989075938322610477454037232776622972842492434657534263379602238743980809033912229475442288798058335118548227735042103399077503759431951128296151299974507004703470819777490360143829432138109003835063954670213148835567232486222426099138445794453385065425562581717933011615237931315998293808739760769799330839720396673525241177677945890963368578571983200428761986266804392804023240430942313226478421567868434819558432862184564947941442886579824709747991178771261250966864411614672430010778525440649941670803611596499190642955934227788713302658981266525703579802852366375695918956025215098944902016327299824886019819037522943976009200571148891243930232700661954437825628511820036568144954870389517001643196739868580108516317327042950193228196087248369537662495144576647099367990741587355008152277597032843955745775823160847494576086016034215271615063704122077424588615113802690237488275867048681047581872139496503809908319329963963856006108492558688543183271923589072978776446754219241077365728296221075259936387522593143802554942581764194666932227005472439805315664355901489642804048996288297102090191197251475861957765804786171837058937075152938795438847197739803137096079095501644636652589141449854395271784126184571237802348996068625914907425206091438264442584946930434397413117867913027478463938675780282539999560332303034175599092898716396037400707803823015041849898208904491414379559862476544203072605847141146854194392675713826690723141418420443350967778294715760997949847905017317117146803734024480670075276096887101515893050717934629844629451564289679701969831677358331201742990398011498543406576801876708412809412347231562650399768289787933014188806267482597675894433804872830340611557571978634149759417503817779645757308212676865955401486542772321908404424952701339459890966532786974048977327669583491319318221005965535194428470788615985300782186471587902458020345522872071436066888741436991986196020962553580027291619798764177286379845220715600968751512594221722534518658553051414116792877374624308325856852418161058199631283191235969253837316573142449282542386233545393846160370202729059790804524582256600661325291736278024128052302287833934611721466253690828249469805933429095940196423516097307160798732411083332667936295912075153281279813226009215638455888223275410213093874048043591611939355620348072448099858352808521199241975898844877602240220823510268410218603825326191798618116190495851447561522650969006180538148981284860983583180825321698654797410222757646208026745844460137549290812616587156877844428977475292000358171266105249581230587776160404153444136750909360061555700236614445220815548922737966560882304585102203997414274480238311729836466680758213164673142388408236771110922088535092878910757222331098486361895695733015997351195855379251746099776614120957377937771147825904412030322360253219169530966990490210539357888915762218857127952112368713765978052622715318364465627701206376059835404352746272190303832106120205469007082104795895953229237293347779494748433215206853542474455906802212348727113728853865569199179588488563901389975548447185310060256363196156589398350451031499724054154576910933439521416482798068521014533632224220534491935856135378238343394465053188468771421805476910454116914732818319314393216089796765217862460207568850984178242163094709466287893656493621070762811118776013229112456094250576088678601469174991763296170397086986319608277054688212709569163554884723861108533719241602647203041503854989222170945418623601256539522331798912855694776254088860583323766273919905079667684322924514676523538189398731411381856981286592346332714665942612291457546965998717781193542063263530843063650449652834991628899421592338053627957327339269883087718813680292207705931471371471910127864578289035908037129595582521146780039273666282174904213318412455146290802783341131097394880280749650067676166581872408310765373283112637656638010241509233647873644104471729291238270398318930920591154987729229534874413641241836701746135088809303842909914437160261146549331583230525889933721692311555571667007695662301290628409706793868759604634247348813261629551995370764510084225937691581755411930145064892205362751007722787921837421680550880691435178794464169698535679671256180692404142328487162144612507414085478307519440345218000311391537199431038931344838589979756062561017697122197873183759173133436096270687313216470372095761659323182470096925460983185618017222497691942946052212682958507750063180847642104859561917095686845853584796903896437295099457440359827496425349148187465640313203039926699846992874679670956678955958270014307452124864155921187975035138353925441198619477048071238487910521150485624338425202735889888478839022670771676878763595929436636600713801657133418169443995133730864863212721345221780925765970381103665967923580751425918072394669207579613681399983654587597116402499578595854091440109276312339505189150964658485227828520222821760337909281274981005783434913329828223383036531644322772562446235969080153797049319254322345618834454267527860670950959003712894349223156836239357081818100157598160681045679144655697226197698864616337097137829185764787850476933246464269909699626343386325598842032323774220451939392667282754471889553757642136005544915145205653254409021402901269163998811619632177573314124054197982659902345635263119441804871170271671519713240120895755581327700456057636876165049975510194669890073317757816074213823445439835918050109798132273061120590566561183843290866912918715789824041133742824476235036652689570576608787989262014153152490008695428007450370285268569960438816627228011931056194602206309639458913804141503527334470020242902015711804406736828619282432151618303512169905258689311208877493497878385310684754149193052510715626989870191602291921103251379745035395066092203910295769489112923752970383714277851404866202524482217374422922644727061713110096876797498046026206031018110524743913458621754847897344210154166030242713957454164038627434378491184727708178245347497958171904945891059930447102433478048414140967574239846866936712905455162788935726889388871636952280154517562661621868331407761967594092628897620396303464679513749909464961868839133925832837204759835907567068746983205071794800068018140268271051674618178860500826126188529518202418958092963835897126763204793874947712167636768811211795359573901003352921897048648437146079176249342621526789909955503817301158687068920918291229389944680696559939224850618152108455755361264856603488438766453759166850676083701330517656866155559833641966882868616743187599740728902078101988159115417620043854491240875738647077859683001647440974124660798343631784239729945026169767709982355067425215714076232623179154899121795947452997560509993645086887119513673372942702445035223024655782539453374628247760824145540074466758696011181434932541793036588089985317171177664816987058721052160385176875357895130717558567105581742005002730747206519219735930949701812925429160879295662448072352031857912326077857523553423403430455629026194405303489521143326504696337775559507364947533589291201696227474528063800290527856310658832748994147692228996969479122477147710100855941508243174384962883739662870363008136203934427446969168941186041580532744834816358969672630543504105605080321635679100509751219015002246310652168378347550996939631114684907651978913527462804457468761085449769168216237306027646764168167295808843289863770581818159268873243231521288374468232209969693656324918829026004901687512327481024576921645092951595268295595453118737727358808960359328560389439192958012358149554460792532578480276277566219155646931405605387773129890420649008374172067366768918555028104027304027036272801126464381366916939028814327872757247600394764373394572135827354595593775608397986816068060243763880218487175363335034361081368742048494219876243465832833185933374421250476081403066595969995972324839154454477633124254854270059686847132837778900090217610738529148545412418701714725710471477429403216895690474974409551341618312588566531866824072270751414506575364415997828440472147082338448982878881475863229230566030531117373973635459557383286564565222185240909369491438366668798983283467009463935368096823913069675189249198293807567782098392871117224834923330119554322616805647832789045676848545424897256846859090301999110159856633532679353052190714348237456903601069794291634470234709380481737968403526563871458282777610919000020563334922692882694708880751145212050823555645529439477805737045844569791703091579577227607286463503986373354250463847167287521204835843672279742815824269964992802254372222269206923836346596176328397539342394725121754493293427857257938066593993302523517255415294693704759797518675041524767132704286742684641721282399483423895273217696450521091200157855611201840452653737522709533770682752096541118004204447173877990495498651073721095496046759582285609757151175005480590384238401153690331907542123179541586443845546798822019632922156316214987846258719821449858996735279884474302312521734421940790143216161849946010328648764260182189897334020988821229752458552485980919381897091399915338009963207305410546161026929444885492673007157041767515945711155280829814942556172203704856049651168533639351116646582788300729842168553960815686485222709495223361243217618766710834534348414716320396438434076925912319866874060918842123034435721730839574962473825926883229684142665684174540606965558867280458293820435172027119163667113282846949959629543346329163480268526794113648286900198591383115286208343769329809673195743162335002424801002426266403717462116097428553936984086372300536042216844059359558893869940553574747403177012487930891277855627907331954953505873187728380451830732223074320837028442009855590236287723619612420272881309948341816554545998579285540312881246888813469194367865676340618285376200434946227626324107421093848967148130236853565898423194139745092333606049026959062325844288197708432328190130118411579089472296201111497126553178046884053616526441422729228427144042919751890982202729170276712446099799752024786673405028756910994877516882508326145441442411762360884221151916274746820340574331776442569097290513102372295639430037100387878448904099335372032319108362840626218088118633347173441631312562047799763210620963032081681278166874920277509875574906255690337272828045310423448516600964412546193689516358369821728408578912317214761233778500987717807213582045462695842431950012401327244693868487219469292239161728506691469660514077720879401148099432071442568577700699764071229363375368085987430620293647154651807387867279570775324139362466264462733093739518356637423420663507688841979843995703392927849593615203540326799472383035653282416267393306373838061520032436553525093476383466134088486633236825837598832954129814105777151002361198877066433651667201133684047999142037701542328564787671350454710146655380846654946927782740072069273815255676939557431376138988318290953506433208647812254658106451460475897923011806152111138762480776755152201850608054825551582457652109029568921428660222647342649400865623223194434602825457356782161897025494544035014820066283712637671602808805550241714458866767678100974640767534455470142219379983772281190729683403810470180616978979968702691689103123131493283988643309755426679657215933047667493666947539259805725698504653192710526200730498863697398806433624061333586561083653531555776068921808671256823865415458654204872003024103899699833139975760444667155768579240882084086451480904634145680758907803325781642207895512074874236986653254619378418027420853481345131193079374736663130326459775607253556679076978283052433441881397173214050899513581827043496823808810498663507640857197063600442206348967548279958589970914206472385939589381562914276948142660101333187521469164794440890045039679859635751798760252597668645321861822015334994676150904040142613788462805950527176067353832736766112693029866358126758274778346139385430759275767079958057024641851665394698272825318054101227161948689553105471237569561234660923487588535046939763066713647602680630017256971922659615382335787915853190624255829950994306235084197184350708011565027317959277612632628027912481263793971675863103293270172725199735372652696457257414293117620274224927568039939027375947696922352101337029009511784653153537244545020368982818549968404389090988222249973337356558543631552029571603516687135261464554867157944720602291779917195944489828998688878220225093615330178220358508748305949442570717325249665435073630767586015709679992768061905372655665646551596321829160674087601733743397719065844264649637172026097935346081521960737063661112048022580658149649477653473201403039356130662109496409737225810149238245329955043557216560354334811057184251882085226861646994919061280895303595983094337140103879161880483127926081148713144288994167571432289192624537409574076292664313093482600413415718105422537074316004823023765875262228586209655249093032216764808392232312915531565191481969963080683591970540615074124622845036637153910923147687112007003968886477343107091803961704376330542860136461347949747234681172617628807781166017233509589356807988682859535924030899873607567149096630530518554897950699889953418381331904318965753675416121674971242415195328704248916087190001504374409247729796132183749446612090582695257853120333371124953325182795258375626539653430401260891378460610974995786886975725627110536279113919083242923541990764703355092815581572342319085392963368304891999639722737503787084277925890361165740885461802633181336461788907248833805147994709150063417946238460626805452615216864933045052660375088460309396262836845282538227333751466242524521251417319370030116066245252807972097022098481212253854569779095878221858624436975449700684084458988133648053390776856400533758289924237317090081455795384070816797764108044306491683716339769575505670872761131560530537251623357270802274158676957705847712189098906140964091495357217533226700191852817713829275633185272792814326209406155094267895707482192713925112070224894052091133794175498389395698992511005062883804523719194725679203349116290340456219968883821884369613042097573320215974147968369063860891633852075969754655539627276762706882649170368893700009360968507073057018449278604548257023487213210794936736071123154403886066738115058440355505503937057361192175509887744563736296110961226370364246727941729629294818210629987639189982358053960349382877831239967994396361399888802915108368108418283486163970877918847265565467018521510067466645129583974695831824427031038465156577832182513990952315258281442047419990326178737089091314252305430360067146281227448980364158135825781059441948200830984997180710906368069120658980635795865725431073728970083917612566501191703418014201848729203793084161791298015688044111419505676303618679453393464967255786507239364410906570888516514697030384736084925025133723673426173427095648464317367533756916676305192840689101301000482593002024944742818507583585280113584213452246835888586822187221896812658097165752704960287867824571059985001849593808116847294087977223771278864599010950457283808963832057206061087039542387882262764783218150028969440816262414046427655236443630887370164058429110873069843291664629846598323030121386154935202369732576627862928812920811600610327347303005643534935053980109521800368374430216244846415948571369188528263745993609422897595531556443656450051884190432925232311890289024763771378134015349045243380650738165880029971030551516259642669035556167970328339256532266719619298315359839522088904851681172623683848619180419281555351793439293292068220858086167250075896432420214982171711493475192366183749126855573808757584430146313189053507923419659619104070027319827020085968711215913697180245382074916051773991790322657884704709733604189764947640882295805985682408449109265978070256750440307022650693210776760833560290614727773616326653120385531885961786148488924291139941249529415564550082614602588614862337041441891702158177122732632726959092669113093961398236396647338506625788874079602266372487669911877173524347659851522866120401439879724008516797932473631148557233072334250293940871215645989804744737008218036027251737547626728469467497809347720755669972592009045670093988576122373842645868747131248985589507743610634854752228009157118854537535845233651825273061174435482023846269107356798169778643531146075948447763453119344271211000390883522266046790452516184173105352527207421496249996874787723109780703464381830368654029786903528179537076708791892072894212171015041019384898233693573331251801187663910349818685459799327008148270034467483337672862344672835876736481853386323938071525692643679720577436489312182956005468029604148498444527559177299878071545892151912266662379599714238166301353554282623721598173852787254888239022725383557008757683883289886146919088440550288317199081525267132790803270179038411315699913701417362154994979278225907658592590617271917023798208334092616644799719483166065073787765282283631023961980319631559982713127552808991339197976187585866553058487039543446277841769156414804800962926024553968654095449643705328474911466525408250849993797298273118666159387564485090088664839452911239814403086086166542332406714077983506675091779089338178668275048940851832241329785250624220363973836992222874282512416898740670949646977214593519915396258769032169538236791108448884213084168234559929699842464238834883164205438750145577107672651859604249935159462956418606823751388490131277472026471099202652197266662244911298796732796152930954248323187531857712727673903784989469176774027650670177050876043285853083877992678395913673814912152469653783762918012492777365148788571624334562627318871170776822651405900130069531002034782885182260430351514962667720982588670119938998081636569917596774653224341645868356288314971186249877922304820956939094039597491320633332091257178444978497288670956677555468113782886801005273585422058720583203870521407995805561740423432424499101464624928557809136635585616755213587937385640999095948929050243377457369901356868038490000577861344737493547534912565589294413994592119739549357739615971225222964103749829574785557377259096189377184090691327067639155501717629400971594728482689832034693610299402461281293395493582486378448603953673407732125729855084405078626878486106393300916660405410529571519788865137614069780754302452805686835912779676830167953052771917375922332538482176030375646641273739289293356646257231081641719070315171091512370614446566813764332111661563843170869825957665101544294595746671525031962713467904917638150070533410923240494153002034007413195780485404970094198213644359065378402617158166373954519892809647570464095700506107721700605545837622591140713153554265923119107129297545693119734136952405799739852987732723304995527630022756390848933980123634244706050393344335073735189750693209700319089874175161156404117007073716548269484412191845709417741823474136325484848321899529133210049365576658629234589668646957056740403378461975566161050027741365557606147833419471736481359743326036097138723008186264605006544239041977066553385184209233156368519228500366531095124929620476094776268523504254386123698447499997467671197097968861001513716558813819407539600132553473251280915587151305406125067532278974630963712216634097729397553716822724730307290568212938420719228932740675559535383747382341015951008400288091487625189438559046451747598926079047289575657118202746376815704560786773825759448155627836918700804518825539670779197825011819795254792222110351639908551864267366420425368748842821603881684328829901601374746702485594186766509602068436535295051077789001809391429255585620607049957540888488171773025979521652042185152673809765957087558563275246680164628960751905792578749753158370217079942298476253646031340137407488393992200414879376468307789475424437613319337729183408124885242616235270459119844289399004659259107837486431673399902436295635428044896381329709235823195107820148161733052776843997116904533962815774897398091358237090950068481205456410078434785574514117997297920910251968050134061444225632863653281098991628742987303797843184891850971197517555768470497346676966237545985242272703878233834318934038207295406790117819072909010665004851403795167006378644202611549013066327339129551260880691583567226765817996380302731643970630353680329629725831651409078824975249283788066754445206439313463975031463156685308224110848153208362387064209417453215199162238993742856020403503847405618012506426644876613879601822427267105655177318762367810783930241714757800412503165789792540955244287779790523570484913708975962142463848182523524828422892231609966155685005493823632283717915657324671170351137722406242295939313266692336281183245913419492705154604734704110507339764450195375061826293752544790826143206420136386380223613809190152462745589375095387848622924442045527891043118260557933064682929348936172647544369567033548987264989547287061453729579486318076708953299324071747677923621124906186376769412740574053417167755483659381959119390455044429951850716601999658580912307188223933944941103972574282901992451395601441149890956588573483915899596443594993633008026816413342083734643775628288285007731738799500285167209698774296114871854275860808368987356742941118928726612175685080865559142898328508457058303636891963382029063348588109327444178270146472352924453845960106901717180639446157955323656479874188800653543576078955736397695213699201388661007246217205283603016487234283137170722768616946801217472013077281343880463598541696726164073302934817917526532492674188947394251410411862765422546028066986482886582257439469772140049287349534105873532669850045335363168954194978079500694024729990375722424191972657062650718553120005782958486995939010703965766144744329931050367896188538185463705344774520031705914709499811572524313813453743282538434392328907217884211614814181117818255377992682595127098181326870504108039471525256725609878000795890299934707249528231286189457345235603415644450699827987129859130761786137194177280365883293542734899619377401159328933795665417329340281105435876948254755772533609530498880795451963733076484887359978188541039206423379476475858668190262436065371493536354339695231562097916954447179502660787086286564246810404451185512486033383682608176059682714975919297435845606028858069160252282292478822327945883926547524413346746148900612533053012841137329897416389645395350300410020812368530185905132801085051442144013520945803050740999556548217719744453328716746581914647939780830572959849572185783413684605054203142218921927594974281490570854027530028694594684602541572574544479270014118568612313082142766776113255655755386109052350732433434264026384851517722933890732304152711608063973109533899722582324056470651809406287749040108071921786572768988833609217775718548091714612699632536826212130812837727553885446218752894324867700669432151002114392715189960536938556657843947351289744116598112354456174496548329085211218473544401588184398873892099512003472112494776529813287361332703597262958331049673469232368127740767476184001879072649924336283326319001593463163802980746803905771331689220333782804081615750965946863894974862324241839810252551673355698928549531553485915795536039212945568011954536599795603932641915938536111743897013401414993530444778221104342023522423535726858025033725881320677347221231356651779468115330976097134249901641903720252705591612957521233299138606159617472335118966848017725815301636985455241673585205947261133742503853356774889711416213335512652411363158734524976889729894146186188902391672842024071568561935538443457732730783004102066182136251782882137346379306634778615961406511284541990851505477082841343972788223452857982201749323672618144357577574231586636791649538711056578142247002567290470136847865634709482028181532757821349493506181119002559886706670242009957027432395301455574549477783183477357612530886669869068876659132528171442244578420057640558600707426704825655600706290912943480789298582412588166366043065878633932824388088677098917043368810692921579628994581724331763688989715791426560198423615212819794919935916864952310766628338435274176351810311066950898464829910573313850557266098701142149662326007138263710389031770375703901036402637481863255386734968829894245244584292824788808566534566777849023964532059149548861186321930825129600536874539422807806601757215376833419682350635465084806633068751568129160489932958087207903979103028608798614731347143128396165484573364290656156183445222850992354608987847350340499996330858952379455719530153343728280023797224109093419883500629490443760573572154867769410209281897959485575482932362929600949331423289954679462979159174295597014110364328625605954725187152143812222444486932745117319632347859400517432720868263496394297611651411632669609923386595423798181620479867074952122692289032791062420905330906655036079368067131502815495265400893387685394504202038970737142166200045832180738559467567451793328590739671908102080827632479947234520297417272912461409210162920848853706366501292085608183677738849770639124687079989163133727550230045919997817014068789182923944552235161772803869861183295381439903762610095149473140347446224098956262265342674368031435851040907063450671953266346344773141507346304113049127700732840907423398762260018632426199094446291462420567332621809712457792226995758521770933946435443062326962519244077500761351756716228407632362641132921188339248033177695003478723023016175799270802136875928029080801557242130860122768512150066940539669625112197445303368196145061630118151421998095614177393064169768247605237265928179835987416156097252446973397313135719149817236132069033093297895948919907680291886926099277228250333980209843998089669559832926091533067647133559623581156808722591318180529482674187280212852931566380397805816866326896224535243796822483533069010141263789548186480956025227274643805227248652563841282006616857007814346126732376639875441391924067566311091391487273550897979448187437999343117234256819713252076152341519871636138273527652380328450418769178069667510235174804450330541624110359758894911231752801959731656469745839931176713181948574703098217378222238990708357822947357056590963569016086302609418510135221871318203825329256906728052853278975337027806529027906472043240301767233193307150388460415653873135734289956710645432660072478361327657087070853870602266880093608867873389307512171792551524648687933855222565065917263410146670022964729101590478851787631141753232722866847746319801006061468139938360833501347450650816381063407815739419913700470190661357427238741934769388408841370085695435514952770102771783638330483719452939070240865604422950096677318879461006950146646749344492018541505801793628643260088076535766179430326151802064810619384567923201957908486797908578492996137427720542150207590770809196893413148866743969278012139809594310034905713636881873271988159902946019341740896578917482464072623362899312842146320432040021524483183654466796040088891805330005723984820851846206682258833747073522216027172011315126343856050003610956118858530675752203438403860205809476204868441194390205565838262029655652537371202088650225973298677208161795743145892852463234360600480740223891096128449481947514772777112653454097726690246465506505771560385680621901547946225943472636539474933877020618720129251640341707498882484667730665244328997082070416562198298707863125972587531717014079474740599011130347295728080092341668475648787983346968646904923921589875356216244231265374472044680911098988656976130844050567691654264450090220040033730172252562082751894935795857316296251235249906269524214580854839373139157845905128075290185411607760510775105980870771013628591536819874323578778866359405596411502775470563000469924885050404457880821824816556391212768660860914265381164917591799528971517569187317584659585363739768738931308498536184901971579659041641401722960426708663181555580565363596268574795938444621710314597851937164870573974108277628761698009155188535256793630246654170540958058395336056703756605051930040315683505254816412318617342679133304543886611431863045246368587568733922137890649076807601295681480853243610341659516336012082157839280880531107818502427900519709230545390572100177402891268828294757669155320401863055046157493616207447761669333052431664174829078248405672937076482936532611952959679079660729949922071958952416369463584919719238446946986374397051260653090031818906914159801507232299655932943850965425797698267843674027693190749243998439525016257372759012281501564741045065681730339426644401138945604838412996327428892496653792823744313609161387740639693566888535538275197458684665288445421966291064917776206556040437652141197797460055360748603538847950873091729549911785031630302055917231885830997956977344773556383268442378418833073287438187925533980222980422708464779322400470380719379866951686978561903517556983479501317663567890928845967999667729038496269443486401608718443800583998055624279033177852051994149580810449242399093584405539238401648732648815457735533020360916731738231378938234412544127609748322412304706529066707149033996397104378521319741251878343445972100517574084759701098548735291977177379501016786593626739263976832412120239386194466376283969505951038879088677852596016062654488576149162302604068453628555721953471686044097774714691366655899234091142377632457971364337942669227379105055318479886546659064458550030539405517438161448116404535302545919739342397148009522737894827301012269754547769801088710950344723213124020876322835396833130967308405817850858955081075579496705962533325330092384666301534237312385186114539283443934701926162619490512616402707553435664555399624962593870602231426697213203500335512319757221529555941230589073640402098708546055353863615781461621932947737204429969418998456508354846222651933630951294511176071801745821632807968589657092534779507396880721301712139327168722298109969877126831566825768635872466191010377639331774594880793542980631085591288432008999307732205392848203488926921952704812720968029349774798854177923920914417779886582811033051666616704225641206913975635436898355198349356647829496144861493443358217480640906237442157051456988493026147191304158637352601193602419788778065615836721873061432223485201691489576942563306810598757384398501770545509896192019304327701622829557304048882459136095586554129008761233680832721396234677859689868028676023084123042012778801429979156279210647445319293472135660067383764714819481626766291515847284408987933925196955230383335965848352653717046079097937833481914834608145627260795131156621494113297435049725235746323089739026975246138670940559312607161858547100749617474303964846632599279191646902125940527155231716695230978448656947816716964980213673408980071424556678538940854064348599816074051949818972315266113506933762999090734502266207799294519049166473070236431125392906891484507762951838497523968761176388144450235499264396159143827283800641661717796736048060614480290420882032975541501680948663054314500730277607477529923169120766551463615558470586956420782848027416178762069655460876258535370017472090198641095299490075020591340551152880245764233673828366516919497917647101040888504100897098818994622829445594777523823759750383522504356237403333504646514970099636054787992582344616721686898299088165287413931322424496521372550731469490324931457826720482886077728365313372304584122767207115110046107773080610642601590327070855050175723209911726628826263272528824083683982987181195804730982867417416650052263574491743267959147802759509943197431802207759791943374783944879110820461213724063211900774809723541748104266603954638074995836075565391988744197362199771813220133863844067470501621818433951935196233720902569549923463007204129024571445209510789867038797083546819464628850434332141695770590875786581116350571130555229007558935349532987485387728886272690905552328533797351438175112028876642933056475569752994692172126650003909829150327957182857769499764373320568681710548536249330646076531406854366990827686033358105942347462256352037212516165276074529184507888009963959240221106331732159473391574433321630789343230510495344948183095768516405273062115597525281407117506758672188747885932707591783766001125865712917296477445296443273329482196200734585905251478678170411293669965805928797049654326449729052369353600519176291296797968558406945747961746981212562673532738850970306996343698246439892785614039686359446260582053679095901467908774355917508322050342682968023738842750475623975280369101290974204459347612541005449030536991778774553922690139184198227892340973800764083163764111661937077989633767849984107640239249428732207844201953931675136452332129563480392347117738124880590453051213072058250386075666327358457319216610091965386129990142218354547182508971491674855497256431886050696826351987897560043558967043483826370343678744334828473771480289210323420992403102218144670842285436986823563113671091472875924435420682679268756729527983273634360226102661961095768843134208656875935847818165686151959207949446219731013455871826323112310756722852901849492945888674357273229431485894255316633395215655404831124629591012506577761826299309645735734071678408036193504447754520063264500447248244717834249204694963512547677662447438318949985090078109541489566039015244359442341853771735131660253724213060707385162154702020863663283244400866693425730406376364208037046390671482783706025204587692506538096264585377532984777517714093555309793250590809757679544927513857826651655552392994944525151174483314180166864038069507830717115801071679073856850969519764181459563206057260657158224699180952020559096787714926308225715850718425646416231327223258958775678387005795713245425068794126879963574664155269124619294339728499043949538601755674392516831270546449567326858447516154714272846347758278249330499105312786005113224990075149824904818942184843952611828623273704800724667328759307274019351053673205847467964330395847194559428647319293867515041545517565980169430001276961964314622948582547455974353438093952784549204784963698454631514815063387006128379873143461044838188754026749138078550960714015116855345341017067564689374060185747577773556413175080333658888607065887960608561312710069607890603082892856669417766008269562805455269426709995699016926525125694601260174774172225823156530297535326212321183117025699519792538950673498665664425326081589055562895484755136820262970818121252220665017874694839429396507105527429103985433392137269456084243333874115925835101104708791034878073042403337852962127271119768078388693470084598824781524747080686246199768017775351677225439011184782625061898226275567371345604579169860768509805042616021926570678033201274161990471181238715431961216349602557896688179940500869814977711963132085403053243711075216997484226886433072164425882525462009906664753473473722087185170334616342795375956052304869445418910258152617770040587722305800422471143546142060073953290577664120392978313808182975013310108991273687099511930581092822390095138530600337381227808094156229930041745396801574590020816257706112630697872265083058870477044439990554989631875412145676801463986823482345685404696202359301334372173826966081732796291556149828617570978979079159580945460855619716513650533383484839846169757481477957505103966441749846316277522097886508338612619489964213146211484215846423369465069915963407895403917703205855261605835991560041068242629598355097393625634493512108405346229839955483731575939786059739693237905986576620253098018699845661506940933016141152718090338125995918944160511104329255852447015570661571735398789719336808927613055872722619029557910449667257938676881554589780503678700014117712647390610638364575986862535033073963173468734790868792359138132508935906443615819531292424365875577572891640739242534193919896062836319338265897418016461912225213154585689088267064666026221460669400993204037298996206028260028783102391259438550391865220506852738499073232228663710640751659002900650290158620704673411132800012759969388507598639061205314298335038498909618978953503961723714316223460403185869804786029450157887689171866511499448171117074912786640531441300506424280775336548184988448519722968699197452504814430566618637663827602951812814674458663264743015794611156367476063075957138073406067050668411458522073123686711356203709323038235038830232233458644418045493122210967225715771526595416758299318941692729991981663079669501074779600018497083788217875859478679317013127382814460729436298463512774023753627093953658500742520611190923366558880223949579561327106987818107732832589053943361890002554626050819025638411057119732522966373220664349607921736334792817812344832966636681482707270967314212932870617722953475461048152506610082508420573543782671323705833927455296045573489188872015065908824744063303305920237089975875102728647246203000450363310295305446139826966002794502374571249269357754452719264437631206131015514128180867606477179310525853123610398385619734438108009962433063253257077368965881747423376717868305049037236050290870552484614786743982217031603549581814566376601979326365374366015480757324532722820303430969120846965690288020289743705665310501699391140574467510623937013980397261107146662046614716677731168883442986283860090961959233728792083504336582701865161512079919809280472471978703856887685269236991437136178135526138537690321431361452746601378501299930242042062685269010468193210386862295514947669600318229608562482408623851293615906423013438615842929860948191237054789594764585035821953821006752555875633774256366239746719967370531620126807263133145000530652765659621625401201992243709231144560750343303314025721082159047198015699263638091618288635071298949296913310040326300861248436204181548299647667975427619944030122079149130437325734245363713015887755018203659834500026145833893578465749024409032187762222228879951765678526921162774726388658568721164102108378885140811296479985966607841906626581050928864839393642636641437641752165616834042188344852173813785145732339157380756222703547010947566505674060345133186549656247552554838591751288125796420861724289412974941457631499784549359636090827582093032501386619857062423987212394860090971501703826575843865578065231999692649080267980360510989251256249177353920983869116964136904097599616760017151086424611709590855487302206661194691542198662929143863239385545930705346100897681403494286484896937014402513442576369081702245329971622097487066404687732995228640162368193059849291296149360404414431749875622864205451835009125581429806615896704416833027348174290130146387149013730256694484781531760208573153651427473853582692837736780523773690082419675177845311763412277505134782915839271947757228841472015791734747803856001994506102966055073771734959086801719956211399069971434683272164476924743873346627399061669601076988271154834520803418216821778365278661977006148581860624769200229753679366097600305968232364638418940437889661979771950395577446079510531994947984408213295818623837777553599441818050350304667817724893925488175038210757015572664481274351659527018271202174762972613304141660610282932525829080855360737605619379210596164897225591732894418505840992778222755722153009872235390210480797723329318465766386922817673373407578074369791422406506723736941539420844349071645194041640500907936538961169688695331339458113753267883879614057736139154772336122255995016899056361887844756349372641052184296341458773649222442484486363128876383805931739002579028473184117988794120740004185004786011761554570431207908160977197270486621795097638498739866622367951057707795852975862604117033695784980298661291596604023049348557331915056360784200194752137296582934468825403173987895689155404673323661487565509565358076713176050943800379486760109592768368748910401703527242877057655720246673224768288369434882136964283329779580224841240292516715341663727319488518207062215599524939554522395873776699233084349854298362263092315160188284004645313452789636165692570504415620229666018244636766706186915565378418765538027426482012582787050961102999409225117993030891641646458553023848120845189129279025981970473766363562322908796517456020824240944510146664183643963411949490133581555830769016275879834730094149079952894501006371428366092739202920957540254730351788289915872543930891104057305174128314702977520154874331811698258927613292788392161565394541285466932324649267003359392493896198232304896014645242057330149822454886183159933289778707725164544535099020599109398318374145209155307949786694785298805731421703624981790695551431968167883450178691525937732547384258185785594418325723254086681771286043200894820568619370956262512552967888816231052610900813576436616239553055222337262807330445961720122264921013339305514698815782556114816281174533304515909491853362193790362910854801717876361698045101110258398204812450209746852084080285390642513617995739544507535855748460360825494501364998959915693229611929945633002326242253725097431929785730600142280812157446033033689826511277273633827537304091286672115077469676454540914325691698342494520639443025983703637803659896431148280769498256336576669351175293810623436590068737246621177755272325756477172131817147061701763890751816046046024469003068628761376756187974565776362949687474959958676701981543343308064197677580847587428165108639623366928779052031204047777836702236408294571015383523076909183811352381151209095515667092700608892609235624875268003074676498331481412301125546077607835271298180539162668573364934703807273156247614083739934560018911875557298157318224361891637304865940589209881904401941114364864349664602467321309553780340554248073019547502945564163991683549033626351203159742778875719874099999169354101458114292676992006428794894960786091603829541269022431718060422170560407641645015468730404888877683744132902216137350357313742385314687105561449625443213818987209194267469083327155679260284578562406217976255816140617919597724063802659229275443486785863495138002915387788480400861961714898557895142427874220728150104046744793703362116891191881838950690857296543393036885583785836496601805977492798230728653366736414165016929964199090111552997530576121226677374737985120415614271780336806109825406448080431562569562943878938749370383999767457889104667300964804102068641395387656956658617704779097107028116623068800037710936336116161790910828719489335385176709821542985989461418538675438610551630432130215473695298702232609591471150459914567213202120419206610311409766971561565994515381154254179332344879909139093287379202857382062741704843715352584025324344776382181193556574252601377770330410846980067775736764300767769642664948194407559331187573711937568465558051807998846890793752214750651599277519060840695449304550022858763126863657360891283449825902104422898068189600162758175829074611185072597449191115501622811473360365041815155253726526536343496010768418085768798879301575519069564292369709634775219304091519690757525198916741703003512768394855037082927079560254242383450643595543138269792165357198482935438718650418857222683969293891946805660578264873751137027490751903352589311342719536408841014339750520073290433711662804437590575223167932612830015028639952392974747703913626376573771186626891878953736558856802457310129249034426552497609887035402732185273756737884424811494606110979395977277792819204164823101604278751384206123015134947859989561250557650593822169684018955463450223677711966435763994491310713276510241502858698785768159992012430207454123266678772362605383026513343975203311042013059520949953087157565083143837224722950779603141132075288357429784179045897007530190006955428139209142702088155304769491531205944637405148127125804032868134042951373191716289662024456413023985753780569915722603768448108474963182883863944932316467810567823601973637960408578687473762557477030428567801658745716695397359461019745088253650676987614106406881150564657487717689083125526601397948428777248788190390710785624697692454739226357559816158744910153411349043625661652800681026894870176239418624731801757563477073232179045713665626781809398270064016795514672066279781291937473360208317841850503722772347177937155328957705357389969966475657311587282874118905443525058175883255315135140239841003333713184297300691815754309690394451710926055847270979086688180235948856581743961659692371032034682736715807764922382601865760797348982643333009405082625361585289170786805261544725272311888850816375132613875901880833175803371162282792947701284840200013394581191001617909945687419617137073505310567487243042482840191573146484336209373513391157289936939616707936694329748726723915501820213811615296931405279068239855143595601382924480067466294895562856571808425127262475285478677943899481761524662241657499428664501143701231761935011091168341799886449589339797314372144511084616328270293391630342040504528556495058770979394362004748567320974037737619949687847805284042498579892825935362165783979486458619694854533752175226191953104452940659122441476836514817007547918896578455416276932404501616443222921088655023933925065546435035651746497632785364342719566840767449004526703679316763108796685736464767378809529575719813269056666111043662550264760845466293539447126230056155401354608130016915626541700420003685497095711324237109322200069623700781045056658542280406097673273843263259442441113875130968737248001384688329878350212584661167760284155602088029936167918530335694746771176921414335135188446844050278109808873164267388271906627107912679180060596359795286884086844559189152633177237139585007408690851998210770396582565950012084587183123069861696566553408701286218375980760099647787732420832583524515433525144024548824285321795177127460437155468640515502388910829961902891157592317476127909803607661129763080498839370321255500245541232381015922742003942407678156434297685824119805357569331743134810481363333228308422143458864390923620945135586580731364532666199176038306463855140893572645724255295237758847605771351083084878143534249270077315327564725889177310317765647387021217814911950439250070480646144043346324507737342688214311427230717799185839860648014168989340699167902957597228706769029346346790052630751190011306542584305619964237247557966900935247002144966819988353793864080395859027049346724109095698030812659648493023328041218126488176058782401481476125090647135400646910971394679924653322912295945340586896616720701711073630351461007220710886084934008106174405892849598227469019149117084075979676252808357136862787582232875648200041769132102908470938580485657626502430918023342498766538533648023202174400904327773286987612148704997561147599886104031520978943151821188126698768059929246511875993915561877469299576805527433952869593150788651557657321558857984204641517592990561449860664291654859355761479960095825115893547813847092928463025073905255337892463364331795153896532065359228234013097730208691324197068889099509000280737633096280192991918759883706434266346468785813472300268198074027247120223413937432819274668969168490307038796536357681406029284483712350621099806425901243406565810011238379361312861879945220921554494866744497631913415653880068216063630968081836830401561993905972728266296989621388944877076973833048377549501512165445773088046975664090340552181303979261265075600302415060081129292938993173564054173266795500518732947045403499545213792955047785583065836058490693440780671725519316430603271338804986980801440164252200763986196366893434812907336616937334564160167789679035015302107482524754677606592360131063485620568294672306423315970060518592959437929952904053466077347968309745698982299527319166386986619803029335303281433566436861274598222274272483091365195121488836310256867961422271278769474973706337749167574370714854207148909609584371975476798646512414394311302171030393262485948765081260170857328805272958182288981875291989934343544225136548047255689515192221428383814103431241084407558561260156123448559834952419530672017221214958453990107104048987843714223189683951796082384026090491416502697599760784743377772061313550976331898124788369196008191245079557863110535398105183659419635840742870358591783987772005420145709502649758059389811786283342487273352201056475041705598501657027135381529242914709937956356101014457350941357213539415395361823255361011926874391617722257445103969409119967178012569472168338810023996524452057729998997898131827351630966924341509708816045002314720963130558857675095739935688374688322978977740902483769919400460046031369817479087996231650189656445017349798942088696831440503585308759498636947759128881032846495241719761420276980256138821690655378803629076480625424315732913205128495165187795802939281904622682049201843059555993219314721495041679853933296590826209801286854338140986351680283332484377692996880141620326943061605240133891380249583715528770825262241486977328335432093882628260214597665734914940227330146558587319159205768903593913560585902031497616877958701997075629876812911628155419478502803452713802338188041746380358579152335082606745322167440596691553895534391095114421581961244310834246714075856392683871544821000368077854097326430773586191295601373518893527584607042622374783421422991536953303023628797354210882873829828136063049078471031442379427469964329712916081913037871789064220581190133701909283728706130207504634259541981297840990212394629913947550724847312346940108969677679850059713500664451878264609541803441165087364631443111703757120542410070568879768682571088153384769424424153605269130631728915597192497274212318082346294383323369435708419872120962988794341356103416791231922334548130280025618312485233895439816465263909240151635081084208829825140783704876561255543268640789136577075011787142423297176355293225614259961820174700691000121637367460110225079928454716477383737305572577059318544224267625417800587856006619593554220042419634910142800279739164760452223070383237733803370720904607734403707545969796374807399356417196648461162167382634491763230865277022869204266909002174654816201657988749614658299045804289762217532637071613536824869702133729868182347917925885168544792003204648156026762053770208426824074908903332007039521862165351609966180275651997396736175574482577233467363722522357834807798381517497128480669415624653750680744591343839357317685612667847875149991190336554697718019280328157683864845740430835579661574555667499340508127879759118906863292413135479396617077294915030723178881650400860404413638787014762677250264793531171407550773018468741607713755037435568535121674452388226921671845001117962884203734679899793900608151818243267493351441289559412425537975796423416616832656294672057558966708049608692909020928134127544298075963639658463833411527183083389008459294646007065094038897909440720952615219472264180356532243390898771940815062456417559881344314611366407997692715786315713612862434133740356938951872088030895125616920888856635205718967701774437998294062755761600730199376096405479206809666771666671605866857354435007935258659028869396400171539307905882947315232716145747490301548829564722793965213773002567339714376425748635008547056003664320668923914263622758381853722409008340902857577611879350069104798069828788670832922769673448478816464402744408625424605189998530566301320836708200287025416708248133239082987305604086124045707172044450911371907435859283895681197941923288469888599578857971786007683384650380941403331169033931297756154042376877757107012526868280931148409633542370890539491141933200676421811018582089630020260202132038651132691470623553785284403189600435751225001981986865274060621622890451697738559082136492047346967508279725902203148546795250806357204365282950603160550223650633836065854925935698027755071923488068757129590255010271885594647540079311686252532468890681055327564215391802374376568744311126165823374200356662440437344782002342921606309206828094494639724688843890382216144572224507275370018855938006934587013112517416642794467024264728831289302972669721636000962213710863745024650933129719298805528985844505583612252985519118707866722001057382786899297585092967913738225098319764655126686996541895988148924869536723203489488671148400964319451666898905558775779783998937489540665738242568175165842474190867552594974405248774145515835252419172568377416112549235569004225147440847660397187960880492277865001786689994438023807245978608748262345732367542413496875492582217853613864902484462051314136256161878157032499798641398410935066848068102742750147644625937159971409127522989010447517268700436995885963384021444297398912891600990772192081342687510689121450054717514273720021016804409989641248289892479992672421228114221399968151719720114395519765369983552353702307144658574915760876154198963513319274227849223848581341968405981042105917127180266731557172646685942424321277110580099823502102247726672181261911356517576552840968016878364462252613665040315879271243579840732247941718642259533237684499738168949045533645824424002388729934793909351613623431886645799540407133269024349805771823246622595011045649135197474780544921625922628705730778540801076859706600430956286371068413606497826653205454479715989525013891693630906878490286041424336473424397296095989131341491101645503458043318716706140607500799069236468622086248335611684573278799242140585193076387617443694478491237923045332874063267212121217521777607986264765994499191957022309685716560200960821519359048764501358549004894916994089128691414863754721946547685467783853934205349580715974651563117424229184809243706219988779196099530007158110109135729201683862884555478448933017195946385563389013614557311773293687007765113705948761888642456570129096528431166870465317010142762706076998605979544064214164451532402116082512317161352970760313991397097429162978221363307429565691766220265464599602036884866779559711048660647557072419784141144229065690704413178270938018746428597274244681387191620470792419138169971532856174791927629568492453776542182421666385315950717795942389405960479336860667755912146396692839528556104323042950363158568523181367608380065512899012996801866175420761480765124954936572878107876190051881288744809501868982682064433821751144025098035704641058336874184399966842118928186854677356508697802421365940987672852716683300287866271124210687261153539633464557124899368009533373323904484418604751908541305434495278611845055665557774330328430132546690190339454281145399100008777692338195209250345659862364371141180598134300987136493272573410496595865726916358346088313823372248662965037665674577353066308011470268236287225423869986391723921371023163185529699943093742868090516731676753361289837421489382909119744038129690974795840378693246668576431453610178720295201239047598509912351153336531739592759623041786416355765344582418967064873743213302604722978618090239080555015976964018882775732026219085153852236220979366976219752068245816160764532392518520627834561694970630505788104116296979426960476385225022672192285267888967512059478612592121289179021035076508667219044668039336662507856928175070518353887442303670185325631156003273804438385346999489952987266561885965607597679449380928769260078728332266016661154969763202778653683800663768806994022841505048940993384329465478995816282652067180037473178245266724829677519524204850734503467397568801831401011752891315611780043222470272489867606951842898233368448539572543331138555751433935088322837197648923593130071447752816846485481641761357135651542559277511051611716364983500938142113020950572794795632009025671504002905843456567380806672557857579610710034540920857107521827598117046312709125052792828894571260466595068970616356768211586204115832034641920816720163263375941039186313658386526478613783430697435144257913074453995596526696894517863699856852771470221590196170434061467464222134329294874459241039797756519004464374823898678130452629591728426584025660170770737293273621101333944729570131026186154632112391841361404248834357824211619625494839157098053033442982049301793454811234753924759185838221596238676228346996494678013685728742481762376632672652251472611690778505129465213486115740376578657443831268693963094675610434341027588728218780863990236807541061123494134524756925272371303689619188510273500914683140865988103998352171100504608081301954464997711541660230524515589016459756555301223257878623824063678370388288287386044644295221036102391864476214646883988417762006430450280727827889109094800097118253386778397908731726280551057149864341944197844529903624019662025974200278633022271122109304344995298748205470044927841864891992209005618408478137777848321842123816129647963828981522967186648738527820630635746021073860888059011860724694674996097122789030556530112938803471315935486136742802857541246890618527950335990512057220371516804318284139274095402765730049574144433442321461755128146632751945815842353120386907015832912006824837282153034803562456825650458951923776581275818635343947278963357516162258249302309600752562249192641510333059719782265345454068503426834985286102107680225414655133729765731613402630198287153938831373021798293754945374595123205556571832872763970345632153816596794375721569059228093594779713047054401100373415614542603718638586794008525710140088845774552895123687215222652880068657116838694179792891083478498489454623356217455995306416084849636267199050780330169750317762613362674187240094822300989273159689709787202776856739303651929550797275770557914756276954227983700754835686148351746592580075580367154497632207739329753124681648653289641970451661185979731681718642550960731344076893729726308824365197378071612042322528194858961958262977097056418303909577434232251750143964472597660434219450016463484284290442544713379522281394905245281102735343217784192044874615144367039127527666885728263756078792181534948467545100273081172060660435884249430476952153905582894102300098721213111151776474762066627272323229758603034199999361290031805629469827233167944580516801960036927359087587096612731095527434249935718908270797221219606973348406537689603147135226589106030197997658232666136157735529052330098847728989424628196438063262976155515989231042745670775049081838657905989832734333977042530532985219149730565048899160233446131925484146982400940859413128660421249899378104130946910499266348873707525984541448549206964379899480503200134985513151656897193926179050171467205641554509561095028881772514712482344122376590883324764538257978121320050373175899073970627053995281331754148651381122431284451956088092380036446757883129536316732483735862998786268698057319581070557184450922110821555826449003123496985727096664661811514419684193769155322281350695994758710252691578730829527368250887308586970810167561096414643122453869856428025592960391501103807926914047042329434439665637938260466228600442721625436477143885205227624310222101159241530797283825999832288333767760299749966689272371682687307148404289302540833996558246450112581979236969559897478688750792281961837778995655390687528811713764403547494363580702734197112633163921435563187787511690149101537533095245983614716394812655481209906888999128718047264409705206095828263376561464882762041071617042289859650816366643209056479462905274530313477612924293927944273688619597250278965172632266435670801080899362084845093166965666486614828306794210307855420039199278096714427356166243070276126945653912959561078090889741842853343584987672554551217667694248403921930723948975873709110360141646428524894317577887825064024439964232035507257199895650140307867781653421459951911795463353125422328180672486030606997533582605247594705940845585456153057576716746708693235684301862782243490715359382552089987575101794068652553802160743077899816141963943220801808404171256813124449985058720450508579517304417901021468876094614390806301436037182087292883071117169793910693095624473447965552210957570506737691038586743146603391303193799434040516289672174241957517017626116704723904682973954284192879472474283986550116697522838219988479621062155594522981211014001364616857450366801051747461282998884756519842766551016214847399113811380513080871912790973219119904513728589491372873579735045140437384368997577425777151179495822103440757479766619660420556705875835703058632059872217068473921295725779905323857393151902296059144367673595961661854844247935715495740201011609516922244586781473213521278331131750171767281470395585962160294490224257667639462133213339528116760244974127173302520386599520589275036423852287007797276176583407574986745671351193140835501730396887393453674130217278343926702478722624407495489858932405882096547484591951432767739281952384106312939798518340546583446855879937803386675873353192463696597818054035975872301283831111277039197177808090855054593330225018646827042837451869605788137124533636715213646242882645304100933667874169061106756438862906153612225685378424271083216968670015910401744891846352681654921973788357521093931629979583133670092605270317957516299780104396828082426792688286782582642959608564960880316830620137498074572182800803669769927124358535534933700340640110708104655956650660215391764696878441622246119254280692753261792985835560846112241652085419933692296758871694086853836962455985628851310823380561251855412613824391226884798745357861065161387354394160334684354281413987611561745881529979665389032563826012871491536245041177318208985614935182958022527270582052630998647153245933175038849546004319369743489372621289897763102761306641277429794075169035173763014429815196836875488092403281609116900528111240010235090785968574648261293390130532270681627113405297845458398694665324169433669846890525016585320807439987763019743846214725780097402501659220410847877546708376565967789122250647797911184054921935437418858905319251255884837586578669760544588719223264791972462013602821415911941911585588113685176464059136873773625056760600661553648958315300651768893621640962520446723881238917428665285505874846010024194828634747917134453235001681907210500524684137714915732351376642353993810598200623790447196856168924222678783440100009700703816757508508083586387475057705961793705978635981372120651647351269426861271620050548973053703318883226753724465871563598497979061660486889318196816484839884436613631212736145980130793050376354185130106721808870826396412142082767609892109964038136206695730664129816772269020888066662729890712003536081324235853814939260392633598453788162566843035221191427454653617157093996670926330779915317405956864902405809359355282694839602177809849055886994821873066082552804513141726862581480457227578193823333430435256405184221430541398439598888792780462406716206799146112245051924503879764612760729389712454490790505206959351032175002891462256364197565463693672847149680625292562970664148053234773974102251428238100378696869161502076906372991867052697073154366021821574420443176596827031511603793427267360398048274646281304528082565076769687139575492754555640625709626161909786690540043319742563612419214770457919153240067674023076482635283762503703833580336321289494298802304031192304546094468362592573276540965086173446353328973425451154083030881604486610273712628318995007540845777091192686920833380457917703990532182276593818738751124160032819090466104370693604007958313461623461399874331589185718028869447679056268616180617967767214937387465388457061191954799483512649401014595045770142686132839848431346285755448598435983047254565825163037761785581065380238950748917490870242910890168690366903290697826738764325713564088177735919046853064730632729312965847395490386675031881089747179115415521790181399870435741126848075403675961128883661450607935964564352271265721118399026067349313150700266340098803454542084925398039020283995081248043449924819635114581167510428688851721016627483223520345446750307520241750207332479434910066833544147850140396925425872322599557454421222229918594520590922827646815449610013915832143234878554977205045512911641112451438430575677312718449893873484947234250647536644754640154421670492993335904041296487104559883295053246584618939825732162136685237006162712528492730577457029469196036640545509101357525706664810079955997239751079999577854600168187578153309038858134697069169608566904588790716847541862297858958059794133717121814812339565625937211858608679667479614851723025865853023790604536460293175980539867263592114052869222889768787551510712175087697216099151549926614044569722246834726796374017221708846171352878437289473410762890734191856509579659203572101783820680971313292348630076803783474770629483158191351353866330562628856336770338547382226015536708685531895715962874903839681656064703968422999131555763038375779545562578960706201770250137709207677411655186679026585164602545374028308942283047755988662064142038586599204851179765088513781282394417708542968932195319386633871450681093646906666130392648590640207405792449125133901092363505815002688448611006738192366166901109381990361392843389986858747723232005580917469931517093678850745060092271680970526492056806214041569964872840780014107324540197119675056962416716888020445036260015717037776029035406184292811074010975499986507982072528600393024181808716600390773724816192837582837377078241553638194037129959426012966972309397638895629216878969693858724530347717904526407337744954286476825486242859400149014544321654051806156114129684936297727867710646888989121186462930253294914503106072504822746593588985584454405077827707431149006905354071398410780381627855898073007625120769768158085765656959584709496366841590482817829472486574433198560142388396721672911404456235210678972830769051775667212305891041938263733518779423265060385568358816040206994173678111710959782271194619805568487996966363432639597624923816587945523612630848858832226519076662998035145098578663918511742122714627980243480187624103960132541113207367978897741353122442261028073050850108983956034904646294139194453247485807611653632933601992962059822085855059648184958740414539298854362730972661207231485609071221393651457112260329660331900016929963161350690145678572635733660683951349472745774871380791478919431971349438753526702469287427859644311209153339827310476544140105403238759354773560303026979306617939075286667385016163998468069528303315648209025625685738564610654890777670983583856145913676021061343069383231604835220803605427311622995584421034792200525793808385526806815243055773076828555520858151329318131387197358487093783975874946016589067195545076674768923659656548761346159087043576047770169046880440801395804999261736988922592296119193529103103515751133441582411792294537339689930291407590728137545130767016798059299758748804496512886242251248460984841272293504403866590546465047597807022674054890396340284633742438774535979017722763232224863347861629669499854548646718181248763995041113468433159860518613910841074924856910733582007612659521393235680789143832892603634103180046885547907198870399424906071992621506391869656064793083300900699326463450874055401214957126546917097324258612295839534302251891304859002708610793346889112433260785952913634396359366097249115163046371996579548378006509673408289483281587747182532094247962436289519904427009340685724308002306758365037989232586776079594798118963486870203879422694398127534514769071279028255629562329154196861802567321391412574695198166011498078198055220693684566129225560577148879378168780860688291848201738261413739365541920779550582256419985789415307179851033745806359191748779165267345596342241225090778324929037149130434070859905304676431628624197294160540007941280640012870431243857367131904755146167608357261314666417977118075072765613799961261255499029164434964782347364722763420230665365639793388661030680985208546578794287413079289197366803472532927006468791852591601673138871538126916727571797778664757420464489645765467642354111183705633393240926660749794204121996512121183775095320534291851885565074724275846303874643464345490141576061675774062932919963012424228562093145383441542269605670289597371973405870353341332721353742339512627045266395900324838435276376800486211618353505509436453454431466837956362510381311513024768974517557860649476887532718076234425736356285402216558841429907222028496325811332413868294477758406585525555498673928215528566893788854613959637482510475475461417329365275637247331488434632147463625098187055987584511743170967169333671970020182834618245318551584676659820014761751268258818441804442174125773469886298649294808961971023194766043949060224584320397344323590617066333285910990039015063720775440137809735467113588347169540206709761067128402721503289141181200682177165197939548678643084841501091002836195928577543624445700202688068335066821469200366576017577441231637023903364994918001692184852637818018108020894752736606992967067293129886295522266486658564822499974165241263476159887162264879321721028291071748258984374529892395236044493708839277898156200933156821207288940609778634239370032624818854938260959181843820067491952189440440651867334889530272864445611337238200091381445891817104217329268818785987771365535757751125351565958609519287218499555179799718586732043407092238663583354539490239841249033319302819534447007770791473274699310119669402695531814686184394142035469769166693092649451410103056636068520764762834071765131984929727916971987258285723744867136847663354006827670236395970007186310375517574264410930198913916262152599402067818733099270911051463903767590283895011895635969774345464851840072721873309442020273429511383275179821610771846741790864499900326961097241651857699863811539835761440553094365724246688796803054417622412325612908648309305601906363416265173419225128779027829449433084645842724377431758969217433506036091368821783208009694572190559440016728314613113906120844300586134909050764293656965600766189831530055951635603527011845624844216112910481559516341300780236894675441056179238973459309150561838164813296839237808358203061123970458959253358735730066784333460106387288321263655344489306331251409360577556113702740308315867722443806950515143771185979236742437208323790001772575934890994896001563142806893476449137265429754427888810912553709357224020858383462125030238105060031018773364755221309625823006936101902147520854249990503703669611231299818051399616318986133067069522540163810136879304688794908294577863996826952890791398501874388557792765697735131180544561904438963060020558031702417760663460116867566946759997533254299882260711927176359523133652108603400576633500758658576725542764231468641161537833088230927655103709149012421868414674860138232805434989020507630791320870925224013113759795163925633952887816351979820256721587756811743158911373795365881227648935941823277649312183518918245605856380618194745449906083709578850669663440231812195684598446162052401172937925384088749710695292785485141125769144817768589226754574458524968455108561130065362239423669743851427691751605481078709490244017392198137381115299936322733227105162045509648359474911664304675664146271328308485289708683859389627034735718947887422899166769791789654982175717517000640347470332500974818374559474992508392778552851702539203295426524135143744771336167256511595602045393231701401342834329097413712156135632021208144780498280662730235736766189412146390101497372968204970587431102836671238008247514580831117346757943858834325869201462916526065077875126395605898528793229683399348187650699777632668522949590825729906299903884665619567317700714554094189241299124266046378567146290952076175800285876193446663159517400122435805502139937362873048992295954920567381004142504230500754175443965323619773357050863437310025338692743724139180188601793409385779311140632885577332958758869481303445298340919531093422943241575331789021489128162101343793825654379457801544538875610256752508145862835657497736700260971736062685623123203820937297406494978928425419399045828405104660345815484106258594001003222384001953501257004602058563909299944614372718157087840286410245333182044451444827568027057725416977070756141880313962067781309309072355460835472571547833473580852341875980805958990303155138983539308263480919243552126935896571871036773225741326648622478204661379222276624850308155331863403099587468840820865705611274412519967402591026309374869297678687888615357523634085024501279667772834932851428734127733453950212709389739602190449305862809452810751605184622075097278705358650093950240372005389637646659071996488704764639706130992937427062489520273872946449331912976182058780623331176107809744271947516730742258234328303795000864023054844629725541683671444618686698050612315808405675621016321549998896168275541032117070343258629123959753939792720539214943720084009352607153862330880358052332775990563750375600724056677461166378316880289835191700209463297656629759174566829220966283870067393970809881606390519233129262693319341120536620884005830374751912454818009292976251393169528820725665700241973844947149520522926388293214642411658763754445336130380854336316112639564384703159803069022335939083114953154507675796270555964748842119155123771870098644967362568665178815147955424800970820816774063820491849685314145877694931543696800730197335531764827618761838109292036953403793903351615511230932998798246106419450524475589535597292176347216746578021363982482443631883783797858269787358575526522903489164582291448990504570338956072021019337355990578012195170785180349622705890206984649034563875863005050295092767882819478385376023336919638681570150444339056412444399748441892164017646795646586258978494512608176411092829829275230105261676550634762146096147925912832379903583566802273085832053672937611457523155000872501117039314146288261986078544306114114645869976844742498278894967300086580188719494301053366809166189394964653004847422576145749490273668742822676966517498544362039852522305037733904423913563117813536173840694211998016030325553037003673290393688813893437620801621314469559122859544108178751730307026684502071299084138016837857306856024392044523227606958222430770853873924425034903211302988035236613571837273564571893799997960615156861422642280534348803082539572991385416506796290248661209945280180103009330535931420747609462146946677136971571876823315063287167596863247801665922664999289375452285429327817016572814961883076797212997265709560362187487125887895446371578529273236854275780008023867899541278877192423331586448823474164031848874221262109368742301212861655737553151701303791598740456492366856724656574785927670400631418360120384362311338027848777342987936182597807100730352807055647399926449058339611515010463042924545850586385066018944483909800281509416535731675727847515465173783439611274085541210162986779423903601469658136628357996060798678563165282613725475782004056531470045486641054468471310145061488559162778149181348919122526814799330505371311502188382226570950457135025026340934726318542247586105409974003386206956293868229637046200780034723454857673498035115318857032392191049387962947147391444039791938032959347169105685176633153159881766158454797410662610820228910968651342308903781969327847216503728833549509520906467207397994496571733840679809698375400406422539903359267109421549530967325280475512080560759391531124102699096843828197541215152950810591772778448780774253060029523672097055083076362889233542980721875893983102447238653054155884178417478347874964774081214484270882454456345173666616268324931225853848518073918701785957355959840952588174121632090966050768608903623564777986776331550977539748466329052431095606912269420987554213907999357644616498814036340650657576027188802548474527900156748189349070679621235876861051872091081621661638591013906409828233484818525427774195041731836803360518862940986258264968091212220234379246308629269104085373044593376124115382846450577328918154474794742600452297693760684830655633736959160488250512514948721199190358035902862200100824426026151788695049326435773210446295492679420087622485571779627362334857959090108317345000137421923921146398359557439172967318394458463305037886985498609124446408721935001804798563981842827088590916494129497036957675988350899202726462663722197450746567212867248397844489274280582876070106149768678556299083085112325864319033318989837508688962099304416506880233154829634033697631829391704965687664395161794651971206622601781816668542058726664330608079397303070208874791823213646805335955486034621188540255213893863159264890430692582100801714858044444551955005812220474855619139068474701723259598699069329183281738878343826098429771797467633358410860620229862077865152911184947733018668791318945626874387048120309836087038283938927337270025165411385266220735848986611006478287492651120551051612362136026873495217101074765377694056771962349590002140803348689797267484970720621900408949168761403770556216425762504093625970825928334289723069942670413176283152265586190111594400556763044801326157685326376508521519653558431196646822060035943919539279407308384466974160444515706997176359438964337141548732090873701232907987942083624375772479125842756889249413518163567052786895400064861923428981975865059050905852199159548690199281182481565980904557984082975376481732150038490414541179481091490867790028609676498332818085000985703147561271737341133459452659487413318221380646187065281294689528285743578183988213891575236440651657357002527608261262957356681961414986974890182048648886132484320024768304371485482600729955658618981582747434207969446868242537445723126642082557624197627020058785074691882836171229909630449993952779240531696162306107425894025651837176038243326198930539341166752644554317166287767107317724942105924432711923708396769892085133839850864099027684905517604627104844757194058560343597195777880270962823783860940787363429226687846164874763509325513955732864884571976091366486044242201328430847056364471078164356998546046723179621487203030003741801371061426946209364136157155723775673286111898285719980507397627767851820325469368742979173387405641115138128904567862900483825242754962029595322162428068470434350001559252171619868689216553754578192211809290012460490777190798106954837006201626149149741307511159256267011726408572986906645757277083077610028474887554460604131612317882511369411858057665964304077656255869215074611716927279725792521379265168826721520353023047284153221630504758518608357378929167776512107462696908978451564819556148211582322828403207185871534089325314677532335587539080441744339039812845584853352079814003990122131939707107241222448119046982553373581304732343347299492915971953629883227723507243973140441224618114061353522913550709636055418131380560537592685715519908038584016416205058996802656181210626046779113175617638307171840333522111080531182320077666579796096682009553379119372848102833226289682284947969979673008037870616236536762431857798764104501385787892156427572145535090606736355081920546673357092946952041622986737350191775302342604846969171800263333130666750176219364762391248440458469270344763909325926926527733455662410943044513906523838387648338359366139129094279637025565776669924602346606948239635106564289374971192567615158494503916728282910350202314657352648011896719147628533084637326135627269842675903344606847965597076588091509851826244740552781722662090864787120547509049414860079027277255717172391320152312366248373715656863903210022484501463971599654930784931828582914446005158738367546178572413455696668279880572598936727404751003780420552134227541150318713864378802689537958403885385168994952787869091893057223951443108599765870773514279278977389705416547891748205319118212220657860137422332079462308532555075872734740485823236063785545994831591710891774710257947273320099941309680722809393604223455035954888435758780939493445937151768746498710339070674373709681592937834875128799894312274223759143772435512130742283710589454972730268124162247794957822734694902209984714155614117686389198267248428862505467707268293580725062099964440290359640683008728633088993315128824856856981765511511207091646462901408357809586067480743021107858199141707462589680269057780316882208025436497720209111071821288259535686598805937725668381515170665469033358016026054421324159051356373156963025634779778235259521768975505646865057665671712782193838529410836472401143933945311142450697965661535542129103376121473289234486104891987680169556128259453594511683682069227043591977633901274311587055611326984228382894731791834749380530713025692829003950202962944838505546005315794069511014158872526366805503147203990553261755962347214612822464377810249970860936256438181507181260323686870887946760545749433235679805138713066764840431895929060615316192371763556779215196546530014395621617472502879418822670970532506923061049206198343992318695685176616196029341787390779679650131320462495754492612885640326090155243539468742198520563032317826748222354310979685721944442729345022993891567450635115855257729424544248303539418671617700383911627252385010826970648504584038034297413108798381902354080629294273370433676014666178685438643939946372325347916479442351325892476519310345229440160814362731122272379185041324206271143514381034901441385755748010309170210325178627274215046873271405901078815420238388553356329124019988363386820435712139795475807012959084662376994102868299386268450636881492916554368693772445929640045380012446074388563487447065332591410036440566560633707394968566135162697602947246317186133141844631103033483724300092349481708264508387790056168444610454921059488450548685666045682204325165488729002337632245808931847984946165320686368895056349294332417453988894751615208522272869054405506627814732934746702157697521956630550522852813061647224240683350297574116212288732557308146625319739791284989801065160239281678323833323260320474557533237867956580586918249897096524628111341013939645788448389359610759438295341697688675183709439117729552006634425140335664502102847192861148595715591749523781842066063620098925467383445646283634455979129525593856678996798449593300651330467436613534969154552527527507938687808135382306220150293785551367758440512009211063579917371056403908494870995560232790414304606643928310744800824376104155603865075264216746229867127251214845570083625476353347410085732038557522130358290820852845515772784196709792879646809224676669242053384342929198419495516653465634615783282539129170571829857648559610806174021205128482859668788113505751378094529947332822272422903521196082631015531041189790453187127651649281390827507944774564212071188287423426543993552526634680362763366138114811564751631424384921463718819458031306480562616773168416354934538769489861833822800997393205491735560943927724983986335409340288968420394379475010139822175150021158228734147795176649989542013008172448242011667035634677352779274502762121242391287252194192512630304614145090205488956674910859939105432279927681463689255765964509598683843389313311145902912188379858383466561575750946632603069648368759921240434407425543075682941334698571827992365266589772639901628333236691268780004724812849004858195331785705047732341251915802406813351377263032476731717602484190751051743856543284209544696354719900077704546922962236897944440675482053917562318724519617844785077963287973101357178927754417431413989424138165251899205325591162379644099823201446691595908710428543938192988422107122336538679709395776817572395240439197977559650512728877523404763396164683708916957207422486056670228075550005023324180790392803239988632328409248755117567643937864439576718600707028648427147413103303060304844876036477884617683132170649383173502153439460243964898023307444918772743626006272375527613222645004839825429614481436788675727895173173177423074325474551683655112660028289342610449011172789506864423481824512424507213890779118107205743340042793311500699085860866533734441873941505242809305144607833164482062011141219033473259451251264630514971169517238387736594214122535619688587645477383645808108787384923797243477515927989055079086565932356079881265071378732858233106231696662513023535075246065162116259628973782469870040316420803497573452860576098496869217997637006981674995557231247184810966388895286053613914828907576498028051633587869935929914081733801305155240057065504629677407731344459758682006946347558300061858670902325830988339382716354028969242247514326862878655944155629390341431701354571518760057909912834907408359147772754591866201629064053308170077323532337657834950969801559813859171792339155327339728944230092972544399678997311701545092155370489885110900347939578359742546299553812060402149649867185047742020120129533161114024479400640355307966177870952365564208129802885882852035916271886668909610159119374420179749248916279076289466168865391077965061078935109237755939552277019602075229015942040961935528985395602041985100928953321471395101939015029468052649576473839926552926917420546193126710752847839130605774981592655164576835761677481419703252382267897944227062947517192288724237021433041162835944973428049513652075391279167820904557268869138674496550530860114341728495598611153571824534153716914545578961559757879877646551171109096771610952417314929280893093644235392638729260692001013572013101917992597003726356257766563651152593624437764121775694664580209475166392925912102327633294564648270363710579363882978937429046303654500226891167612268157288197776472963888178912317322654985503901555868915950312665423775236364478866008180076649522193100633116912020769979476675922072654235187514214908261047633062858552621618678309204169151100727553549738248184535557693081903344193106073217583965148055370793518168492188595069073847096173421225847938113575575262874471234329652489417606673544051494825311911736174532018361911304280884221746788110705439344887194915098083780142337565599882494815265714052270879106555508419706767077694264433006137767459911148149769751981813286075231709196619164264370684406712694404840144782568638006996920313810252608773050270012782860029253961745383152388380731142547518508244540955918422486675735920599576789060896351267922972597904333416769168008092628856097794939879476517793691667529756247285003524405138433126586659191480087005531888632958143166023149759333134396788074440160003089327621111980226355148465783992383384629749713316087483585508466261818314118143900175156740218038957187657482977395636073354089355427793003179209321299208620164927687247041218193279231577105594675027158481813000148046327046547966943413924414256754371124332429145659195315395178447603732441836029998754720845276905223569699459427406589940279233565307890345804784223968139710984837600264665376509908898799552119562822645116392148838787517234676039982373243277964252982938181903904121848451322308950402613620702605337346593705560773848976006057642635942078672908646141161949777132869839952827048664718366924721661250064804847865905328562686700358925719191816894345254133466979453342641270912710739896411980642155757470773602895572237534874442728850636192868626883409528536435502964523528969842573371529350225797051919594820206409579153922421291008770926999329143252397408471258493474975538801091157368502425733434431684032782442633856870824949140939079646614790117521798362048814402684550107122313666897919964624232378215859488136414536565534478948858314962964147118131564251649894633385798401130589172720732892454879076367418659087167938139108501954575759579461588820939347071668319129214215814596022175350098138711879020694711223313164124736723457496691988513729113226795897583182844807423910406795646939704664848502575791851976648972764327677645893629369649186860630290555298236571210898869011540342422399950681238650287385094165209194978682346332214854998108075645098827837036407728132872234131336889382673379716361441789270602061598799201057195417325723903908190622586986489704904500123642367206371755430276027632804901925001367140796508022399890721690070065354455627777730893467821610412173621369487100416700052406402852800824258405521526953258886144336957450921979660129802937134190415235633867376023222652179297712048653193229726869253253578048534473062655155585476196992034410872335103294729892655836762176794077236667712791092341147955230259721981178140299469617454016983786421945229616111389045711535066495932745678996065874638487101550989858548327060217385465137032544536241540476107952765168743140485027900770934369595214512037571697386698788545358417425103511924795796237995362123534536068598741327270207453759017160317407820871165132995523468228537157894290543562680373565029563880431028605608359189377839679969389510441993255882913994804292762284478262045208005172933200827178528446419883188015437333745583168904684483204318827886883845264412916140336038794263530498672452861819145141868133376369783274500593711092065482045696055298930153462782989308278229956234326763038419397010623335552447356019078618953462355378647611457762751058538747164282549664710685052392137873888563853225866173426647899800266658599851092621309243819870483299360834696471499503725379772072787259697221787804022278085553750693147095250835235748466753116599303574278290229485609104526286778140476049772976279674492065560109733915052481773401409921817004027455047403370397562902629013061292400598246363231346417077239312934095859477265164194195786592259411215635827657225638652148787105825554008192458619625145465355480901637643011070943368956793292131782431073506969124529896252930492723254644363747804192693442932017342193368192780074876424358719911328960299172002682129533674554444341097084850048921569261435321179963678254953771788711331513009143810136047119859471371164193040993539691017156545509368703279313248677048138070666176466737758047428303516568118627158942363393203355304899135475445535246116584574736249274975961217196945909717024077163123671151056442687192125152701230705164945398360334104159592054943997433224535989267539313429821378579491230611408594983856692678252671521080820865534836759777266529711211896384018606612815885992444435798439958689239489710568475904892775481570365548486352155052082705463970002712954165861018871515357609116865471766577437385679676406704852523265459202300109036122028676535013782356361330434153126499144038841024888931362129217350981371410327130310969331561011666000942706645841379032031920660811600607344853846092580850482927702898629637610766874381810887634214472826566387863739084450622485969615724176403041876351186831456910871790560834915731766614699464761527803919857737593866859451870842479645901293295925891788257801842808117075537383475764243210936092584418220539002335856501197891970156381606405988140321198637292888909286704676689424290446830897858811728722374275265350530686576054951268196928897289697560800744826139383753425701944057663384326000443320611332278916040399037000540514571590728826893001215796370974037412742055378085043257454146764889611899082452322155652023157895225239811561373959433916172660064377980498769967508996480387062314655117493882556787686980361515720355148813896634982452135362724739803188213555335285175183291272270020506597432112599854563062208020631650195773925076301366275567230402068763459061361365123727448308914916099368593432546887300949677650689880941091788428096111614649529287314066333916001905142144429576142575254086449235037354832428840185678495833368116549599370451057585356636440800327261770183490443527789057820784381814010888269992490018741820366278585595448577821932664583330192333936179263808997973943783662416390410756657647190197848788180756367198167174116805009572587912218766462801419680486950641876863729167162692144305887535142694258619598598954416437742136534695042872506315414244065865824231121224485702222474755480984911889915840631393472957459396269168188690010431708027736214773999213048446941090086515050598453120205553305126749274340125835593527288413823936608980466333742873266438896097679248210019764520719059148174138213018342921693837164153267967499995164230110022782147760392433545970165835463301804057975999395351512341523239880365701103709590059712902009904216823589544867079156448702557608968733943230425595560702315777300578551268630479791076072908621052106425003613952294631180703868858269400013742553248062131182743670326118130038602099020506385004988960902689854584508420647285902527654678239073247545344797918620310875501151540967955481377302434707537114937189847887193949427251294953347967611649350521272054643803876375608348915641933242287637618580693417599049651543399244151337743006994781357597097950170019250327645759842225879298699784812775329633030974729820618046365613691380923133488582734143214816001801527631551548506678584136443606984696796925913156133690026241787985731573608759839666765442005483252558329900327225349284888088263966002369990350111273773237376004048537581520812302979164569610087660818430358539467287970103972359561050282002114631304364462366277173030809118394965609887070102148747171729793518629097046315546363412377494132206664519086783505559099639814619758965091862953783075105288248120204211225005579641328348093452864258936083227678736384759308066504446487079330017507294879348822241261510094952124199994206255356237269477697328514470215082775453860171203163772642258358307487411322917019001238359921240309543976859796232007956194001215657524464087024590445715462436652283288026596648752761664293264626883144119848572112040063744084024887869732941558083462955229595376038345881460309293691403259843973422345628984002106343060226884993615028378981044620547949013579962240629068959365625504016997934554541281280787812608684838682307543698844524518537253253139425103069994805602600334456975718276124868932538916848352545281471125457587324221812232121702878712121244846442593620768230695782403221032871889818726934535494771357501269327876633769531854149798086081072504263344458110554232428230490370932145315027822067940139285866044879547698047039415664863076161109022083249466228683771211881010686097749491171903573807889165564152006352049096229609319131353960730736043181694763326712055053574712647033983340611713203521652351891202055180575807932493347216120468534442789006603100246184489693491969098604288477640938952217957559136619199570578135996261314196955176477257958801019814818751557785728180142356254860852808952555518854154999468071859377424884555279251303919138807459117854203340676325466311970819389637969464467033030239021275311043014339442921717864037944950585261027255003598465593538890706461701540142100612014390891776413581428127048526301564386685164923072781173675081060231105748026491996905232084112013796183256999077618619586627106062829831982713336822182905706257127783600746554704915929269146253266127062248549695789284415211825339893329107500650952190489113459663694522378455119783464830874015415503982423127609507476095659922536585441363711276767656720537965280960927646541593696544955049594109449717297941660552552098508344766359291166466244775650906885201493074304423281249935442710479922770936916007149170204611513689199123608008346644382374089502657113684439628223527210797919108443778656648113024759827325332556593734981329072269795325504323699757473712677335298124244291685881323128785416554115134044090282038002259532042461252657353704277704251270338753737674725558975982912967852028354913968130789285082582322202742875646544214513423982887585595763265711650134663202704813769996040377787808946011002687969391339922072853231517829391273461863830838708114492221214038638344274594963337011558451478777178123765652704739456091179204873938101274059305915195171390763058035904431762755823825616289392071422055268538594979589423320007749279681828007624257452136674460260483142073978593749302420485715451205918081927541081958851781067551514413772862368995554945575845724032069744025417663619900955109616140031864611956636917317118073578406718871725204796587062757070936344928897077412856301930204647610245513843797832932280367569605079980589935705456570455194591667072826658173407551236178853673384500971694570654441565811007686876791985324491571766076055507886001742627309948376813195277737360592919154381678189344808465014238469193768105996700380151472115108640530749819887414095008640829919329635363415317423722712964567228558898987185231635932317486830772397655310750438847298598923372463394028750043961204271321431787759913871006079150090461160971568467228095514379606551800860966094270531650087850234266794993699443871394372095443793982458265723341148045454648362926213955103505685251951698373202164987654462709526539209760848656689544091367543050843166674711918413863755200593986643356079002341769038921748325882140560945580931890850974663855451314459812155694576143217041914696310504408373358420642267973203956273698168616305746861816317687027747566366000441684980470704043657422102735311069381006786951389549251964068396572079021340748498629711728506600470115538177833189850117154548035863971780227365195149300317681882070126166833195579408581835121945964118943378818322135186279946215005612295795820710185278990076785703872338208221215181197526698852598678519101931601545479066685270145493672274685301184870823104855689259036801486656857161627427714321613671328619970295912099329211234626686331301639366570681185041263512195234841140634314215769029738712654333218670203087967582895437372106940324608920171913037802486423088045262640865819910716704474886127417810255645986365718134976534652437162765731827472477860656000620727297616868527780043281453113041385829693084569587343405942297934877979466000934287903304254693459185575728934562888412836083929201817846646928591655758588955311094754074857669788797776440419231247721263654115456072265692920069221184058164361531536424489490715017299762903298479789726232244060409332078999557058250234612106399175024478551724469884200719298587085361013952504957956404840064369058080206904914858536395166093638664503307827641404519403570324119772948239592514953123722280975577156911674756449353082480567194822525116657240576352556050466684111285209275345467732795356618639152435175745766639506588600367210108767607177931319223332070616516170962948542692564679186942535876742365455502998249780880821885299634525151471881976814779451059511671724702591677578993898744354550688267205050719058235139575527637773222241002697949401136315817823877818285666572524915612199176009930725958411532050206955870631202151648683639760209658259882544481171898158490144807673687101897872585429634196278128646312513544882976411333895921795715629710921614350181051245952232650385790297842149304897791936988388771710077287494296900911690197754958444956780795695381001940725684945534920255664413618796549561449035667925348398964992477380987874204594543632199104619533427383853530817446894370318192630781290683533691061437676035058389862069161632541681184257182666696403729561716524134479213993916854243054484214282551826433247988373764250916941453220841174503478166162347699893555477679952447291118073222181456653148232202316356233544593549196129914906716894342447340988473042302602377339101531885613012158328853858193737496602291081143561963843089076203184634317627775129603861334598216719450027697416358092651121345269901121469560645609608097192963392408537432928324542293636701434299042825119164440327054960073688318003834687424442781038486714339165909323043714685568480441766099030358370329185838484474082798725770040953046049867979302501434306411377924592900221977561149387766416511453871494829450700329450968661631147900945160741881511467171747341508045978682593701698617152322085318762519539861989226081853198406979878444348854646766860093985220740465658795258343144640987279274978921441696712524796087749946411906232129195195939340229134209144278958132277636266484908522524424062223364975226815636428609546097681742050556440922818163234879883800612177591458213733779001517734337769871884791341956252335369340829309537033239438436577775868139032078682605602390945699153386743929921187043612155750650307770362685586289375866869756057220899343454111830634444511381015844184201209110766589633033167838700935999986968382671092803152119466893366916803729491552805946576333868171581491077885547256222556530227084351271879607420216135867088735621116711678286559504695841572304230847296654828331087780048785592084416446998871552769027393561163140144104190031033784533291188022313323380373784970157954572432969624703830338815440030876854729713091325443317832410922416232387285647999023984930384694077747952506964809832659026052173281419630677449391683358314903744118806393224016356197773117623711146035569406042564520352408636375017848926709602928685483464747970688866514666725122304276191345103236290176541468564893035239288104357697227799176427018758197784383111315013853263167640526460756860118547332463744257513468208833003810921006604541127429087160737234398714366150796541119831944327444820557989093130527316976490671185465683104048555765078672549593194269878889967488293068218710010140660622299558005953593703528921567356458426588505240287376735972988295554704058050582542683442192859845269948587894917803734101611949792169816720293149686819336078826709653517398577862922545500773167707695304642440647183076044702030500246310260893161101396280158957439885892211315957463692404384523457247499685379068672956816302044467716132452228227533165419124418691671011188490017941377618813383524729115595436947648035483351637082077118524926087233288351840538777882119037626021229912699421009303048520521689005564025313693090523961327858787488762516480362410922362407800871372153251437526238666937615403155836944845775673671709931974290702083387171413109655998900421746036995380387177394574574086752702873449556645166256077009849306954205934243128005104080598306142177958906123586593338324705106180167953350602584626204953255103557526303229779498802356482529753726393951771190081199549141136176615422409729607287780926930612677501698351057627499052955711216630817532850389109008189399482171191393096991779628694907987321650625524119399846344703515647422171250350272747298483635977228593483849898899338448671561329170795900493455888899697377893834257578466969383357367806654725999713807966275162073019171703626809275391806501745423844535266945513290160946608142662628406740660746613188265127675208868666080430158275107783859215184166270843099089187907220468931800495907320238425401657424056685543597424045637356176658513089942948513021235107027272925819017774998154377453008928688574702960250686967451764388377148057149566235779305893612446853582178698882628437735632634874888437390610465579367070885223050481667584546362655769849605221404746638981973047519458729446369919791087160868521200645167872807756520455715820574396107463327001627069183682645862185318681454542115759550037545471669771498789018799338304105764592123057980603807120194605305909381865335389590734827666412145881204197411860113764707597789670656018885175630912457028882514115916912336218383414719825454503170110127642415262265289982781801521153133216616057162800252120736137215255627385214683470869842546616147490513021091661247754411981106720075610203804634224055976152061516334381378965325060139702918065427300556660436604590914934483920595347910032204902064144605874397881370704273524874884439034631013722960313931807013100003145102259323151432074404524489317111014301950543853496521713443012484934449766169769347398436384534942777415968496186943329467421443839208461854414372827707984998112761078291686535716418515636225902815190099474828234945816510288476987402808826332196180179878361917338059202935888353901756453582930310660428089899803131536446328214684942665452977105314859042574499096678906796931043931548102209227399232909602120186143657501991217091710417491381890783138781494666937236947335806002044406940941468493925452026863375014344720215260962418242444826181745349336002983121081722250940814097147985618717658632161148551364948457299381107999401816221198873758715619184870686348775530102899269676183782960966142393808516109554412451278194553488198328655582375263385924529863901268825943341654345455139888250014844582883046476578063184106311904741578649810863976355843356373020318559565946371987848165569078868270507901791600152122620301454778006288283957730907670270590019410470865854670590012896011842516261387043976178840148338400434541094266049313786803088983360939474923849864898498667615583198352173433153170055044634574729852592472583206670755572238381600739837241871339964432737082888796088541811650747305989578274951181405840990227583890936885909744084750909075222841857594590708297102720957626185915303824308888398634417472369529426359115770418308731478895676649133783418061553786086247936111007966792424240131025954057002018916706163596936397072756698621728388965022622061813723408619700035458500718202532511126427148122084808753013904086412418679905908165323098776088849005750143746066062109325368372598744506867185236845285306730257403017658294958961379063881004294937556400415757901326181185136047041557474678977141686243145515504539352523445970755456653149381530151902880125805799597218522723022191470496676087789997377679904086939319069177380577569064749670003272670383390266373548724784725058625131423654640983243644979274749062357944496030164200478982284577187910627708452378047650623447654461586164951535917275173984203151471971836934402689129743640701599999993164347063099490484163738825576924839301085497389331468086387231345158349289702417696879281778836508645408477438700566883332213720181177105275652005524757957261205632962897057488275392699320509285155805620257590354957040952670078087327795728153405850199966640292418953256959306462010345544177602548812234973473418776786223975957527075713182362167387083199011571053037290021337369489323232764966457252731200109430661216701253766900482484862872756421638982175955144655368889976031794617294690884656506272461796137057889300334290653911503246882773101125009431546824290571103390191749853728288831321309316434643460525157802022544172815139995541892492422097497831727050419264402182157954969124953966483194564168370992170519469679377861830986657988670832537458234636439248518958502263143769936668807524672046454101408013036828594177516044068964201873639536326776531368831080328289177132895577214611525135265345362878969801072486543271576252200040606573743894143214985091214209120424748263424661694454072055718731665432137248744222445856256901258518219746584979999327281502982487213508908030640970118103526734995407934874770630430253877945086684064494835458084478700510161312761877714951705630787427901501899281872901755223478188871566816801837724698459372841095897772220997765876553423952263174759636253098413518477265099347389649652905929236613850132513656104702857834006922724771357885161433203038089887826120641177238902409486852731335982139858956198250473105782255372339859497232182539350954598689690765882191988358702072771045739909158894948589095445990775931874310609218154719267050752561408482171166424760225000274243557033680077835690148881227925605216461519865683025359187720879906244719440734718418484854521113576173249689592655233429642799615972455718381363354451979094617069822937901434989604534193483019288269405800358001422624404557606095389197553534218717127352260674068163436596259675991107964349778552349144278688467174589103354514353826652262401875320247907526382219501587381960379318603720847417367124163681856011294149387018023618849508360714914325902381509627778628070565805073495808371517101165800587475680853348462151311929498717241371079187974362338136305813121842648406020540764442658137051694335232513278672562745859717009810150730974312286893741712220598388690338601920516096037783447124266159961450683668201277549558730905050176745557892391784907777964145852008401864705904067964666749289849837944725494330514867304941547705898417338828631358815690986101399480923448537377432681291707975527477175288252925529914068112678346924550226572371058246676300242400570190313594292257406261323758732636914674397162352945308695366715172075041913943001513190713410705419429487057222402233841074858863700562136762186869115208602079432802902368129388033806822847342752653896243095957015139570872191006756198326942146781925050322135004346982778119129524022879058022003313405369250865317139514842524645524303548782856960985719442493510938860226440978979067611129912060921664034213872060010031790752815429713708785037809283929834959303888778758945823662324351323051885416409712213683890323632734659949215195675991899638502667777493770158465945403534431222470768944440868629950054712430529255012737094773756763344972822514618268478628446799732745477881609130255743974984297864786460069531697673435632759077664493188191330931678506374650992542767055627723049495107601813263767347583698405288195523393203315216585586296245906809295306316057336350797437552133229833755498609796955369580513122869758000216354828993139218286556492053812436597137437449620373577617889022290486595537458898250178744204416291060955193152911711113110264151049586715844487017335605237405775143937344608821702756433442425612910686141158247102948748190236406087446290540890017217386769625330365493582153575754348463127734298722345315781776478273070581845098027686950497029570917533582992809650976181671125514643511749451174719013616938166913018617887983744692709172285062274769022753912779208117890911933480679105471007685647342860598961523334884342897642423357339588509655796157076551158815515048244343033753438085327647771942804445955455128538953827681847708423595477457896916313384019019775152826289185615111819225846685537276544543204217243562740345100293414989333499906420027781648473079953131769757481100456400590900883695194002458501517410925770976343035583215326416948803679904361200741917378441738357863119259107091828770809689274716895715001423446181032784269271878044734162817134577908351720247707374836917980991336504332103904050635455508936111487742837760118859128703520351011206675780873748374658022095536874529579706958443948370856354320689684671844451353119995226944826829441966130975316852115152842558208252269054172004360538239659088305276504360177727970626073286187174439307525282490300381450311863519377164585916380647521241410369694044242571090489188513322566794374444791352802877962076619871017474128045389485211168239955507637232091271943152166564540769806686166401425671203367668635348151194181521301873182995184908856100177285888465657335469424243534501537705198420811322107672958493056759173771914035578577532374372865701135512364809213876308550743231524947337797192405344320597959754881990627323933018527293429799292829188589657324286258249338003672392572743783657583821802671479380358898874220368596499196094668757940728766862736318500579292802504136830105695326461245419593029109938162229755768739536820475696574706220464405113878173124565936556524945727539721132535656728940584602622017975374482655844955993377935182799473987672971005812554290076577530320605945389167055340745164209307750133384910214264646122605861774445811380866978102807920783007318925566392176046244581369902062430356914341510579509341512816317984286394953735591697690695984229012229069171585838024672610073849785237273955472868614430190275827179921774542720344188204801635785688137916236952519782229469761861437173615908213175910663816267178226745661459847306952751201635425707467439000278547002584090760209528519736166172025741129376889327636770054837110406858102762652258567593238738857286711422610977208198575959903362583288439986560095024074680960241557588792607621837540995444051083611540878918408020562961985137936023112558080220784996210924345685054844600207909909584968987962608711305979256077900620936046678983095201876240932990246035544226482951074579893279345894231317816565097733178886802489827656760407918884990805756202374373449734080475073593902240226880657552919469795789557910380784263267795087639871610650995647222234374336580984987076495320616364209275336812025142550759466061078158473905790190640894688022558179551398360803317564068099392472475020972554443311335831341256514900306902516792362225685933058541172208716343270983754056684752862787857803285766940813528539910153956317283840758595706218406650527600653676964034971158074491332279066859773625692202741798609393064732845507129711628166951375504366845672393888907845915536152092748755355635916142532568187983613973083347467828202250000996296850533376240881419964901691757974169700440601610290372885730596439131508874452768756850855845627811531629176490276234329736666\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 683,
        "task_id": 4238,
        "test_case_id": 10,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "10696447576297317582202073385944780796834810129989263249285980043740376644321456206275443498648766167056307666331540208899637977467372683556419401974714096023001092018331981547291326760726697088086815042252471646763048357664144123312555104665175361267862279917644276516045087704448608736191238050821033610284945360490647855282376645456459039102060760435004090838975946496121674030251994750117126292287378437658131106516218867690843952102651765197355976103102185779066738323591820177779694465157963916135223974844222339735897698180326004423363249753116387590003704377547738549384521296006942585532349175741802110657153515965095420953340621047321199628605112633704466385714784266675701149242677813133833306358625426036642830927125652002253609404120734046101537181843367860652934441678725079495297946100206742480171657220923988084352722368676947441767459152337284563338706490393809028890281503977907105788046465686743856082969289666136711514595078224009210968718212281161039941720095994398159218964571184484657580241812813290112375960708385348452621100206550345415273735798801073742031936257493832904560147392503731277722336354124367861043661768274625538917373083824763373004698458240742216065424478194893092407585805494153807891579072070078914343785187316014500696015247966479490839122962782616845605454462399319428259819675585538131274601764047738556690378383852007372399574414098843788328379754900529594605062965259862601827082983192313950740247055265820918144485341252527413512819778574337619253603248372858706158859913501893240413841633699930671781075704062958630984168251641750488981275690086032127905370515876176666757814024925924773573226966474563270341140184460533034768297094120895367233263993609649584965879865993618198288238528533226712900753937226834840489025145216205337172216450351511448359355811873147012870418977682835726905757348153655993652376969363169986832267437055756354397628100878978310440579881736505314806716464163157404903607720574593692909120979130196380853032311153435412989061951238153581557781953558560327378501394609851565552245962994714788117774373425678363878057485222155690861025134939073323499584775385092014874910394247068926255430878339431845389369315597928633242278613499370094220596595104446646647534163585748191829765292701202745954399052446047083762614554552259121867250153570824561606881120955792964823254663011244761645377022768507028248160679115299986950263774356735744659566534402846866784908505995517149751212303108507767175567033226446902342605079632272853722822759808273145837020850144074054940962304879101534442178139950411840568202526877916275903403764640848621057928919433290084777052637094939951568370898131779352092336607101561203955436975943908541849295304813583107212462943839564039652228130672633895197819704024296958852928871087955763359091141177684736712788297845886297047101411046703798624520896803529465592009639190839969342599593805376558426324648031678144146819553071318962186653193427080449748102877244984585805787986013784166558430117091444951723989174106620438315457330152926576212059406992025689736378747944295845873864351552753016428791632832656850105181769605777950886023527042680378988560398502932601300135734173398476485887212849934028637744237530012346888239908388919443190235177515425907001697420670827878194994361314461109616258032671652551274921811767758419676655428688349255064141169363549804344516946077761164122648606948170052376465052743952522222098771835345347378114408569191655705708745263790780875232821728274987534502473820109570823039641312975914533255701551430204868520529760294181844843713173288620045145493650220809359314830241828345216781775326973434674602331226112390358399095064395913865533848842756612758849447150749408101944466768804098186437481681604107198056189849481588928480312463119847983563593688408932477790706814016937970162916012495244928840613242454089555040882264609430274315028785718380476553164994272403181577595673059917882257163982352134092235329042991810995743752828488161988801175620632615934545311331908929266942143974575177031679067517607920034459906300660794443021553942591293742729798610096507795771076884503825159921913283383143011541418975626169482006080201563214563090889705442235193539566157899187882654744311759507367352657136767007032220650385186540733938224624917203169313136284259169628360749791508748391727480979395751828925001243249249201243379238256262102269256966258497858138067825952907105844145961756596540314580081541846242340183209883958360436415009109181220214077017600759485673392803328025885775560378059203176444971521639790095739383404689819172097637857905028605643390941850444209041102599074712111009955481802677738546453619911063000545184622324455568447342308643355007564315369463146844151020233155376956968898513729433416132725096518622194094611512307713980816533535635284198623148850507020960292006096797688940073834525336264904070296643197725107559468138497664128492027089476294583586023483626200252242284786244512597877252818538601014240880368307416686091563180490990960262034268752375648209837715798565301184725164599750136960602188633391649719914062560370241812854904799370901535301775611408413065735710907656440822291912668985396031261279189774911586063002967109832282963022262004671089083995843909488775736920060714568467377966784112130888963600820108689241707973453180013047264992816372061552772468910698015721088673580872966871240934497888989803723446969072795103400111943130766028213778397861745845188779840550663973942243637684449800323154950663355724851075610438853376274102597480273204486047738012688496458542212142804443089049796288084147634827672857402632389171609463513004215036143737051909246495688708684210247522936251400710103828894867911264598928403655170179549202598074544856556125663252537319412186418680765396478461109756143254971557422387217516285932680295836709594674096884133492100946126867598826874275145504069096773251571992713617304130806939886050437576924447277864513097637068580275230533365109087517698255541295294965116386022594948262148631796798466005023382324714820373841202922966959022890486836599074990449743467961412643985323348818026200889199017065416169673343225337806377045457742084848070450637238542442535177313326312114690327284515540618867499746538916008526041333277605784291615819288732820993266992925623015771007774084525020806330108926264965047377643040788251280979334011711138435873555176130996313855312292930423617439518243413651616537957345462348762146434318732042596186232319572514084815155951868288776048818569331276069366918074284132027076366313517271933235484850641063012060007621300322415589941708319180297800374535884429533325926041335030896722531508162202428812098371697950175703782109762646733198066791544742012144373568368048279729528706373115947656670214526932242450573493456266947649316466821055040837742423340207582665928781041577790950943785507385474665441288004348895049120859729223170771736725552382754789226971619434492400394899942509028466626642053567762833781677124670236779549652725966723607067987796384157003406582165098367734135308514826850197485973113906416928953438228678804117955382416298555818564063613257266958269543206517078592678168924978963735600358392695359061976575380024914028782538401394091775081959200139493274539316388562340066035983846275189379170612794194983149099337933325562506154317112154636908406205697636529034469598445828791521896074636287439622751976486041634841533622691664619457114771057690015991777585722570875468754178186914345150002640584619382405668802097793135324484600131767287370472914228306725250645177049233841638844279569020644370915984621673623791432513113421419253576708516249227791292216082384436733177831997910690388592687357200864991975456655209023118093030832748051414913072090550796300652800757223741891060904053700658364696596899653435667098381473469982942290800912920814880444223360993910000567203778640729819663678499956424499610616065469317412409144420114514852941803071802734462504407932469284166559957385920295976245372086737197198576800665442275552676138903445521061140365388335573899414089015290003277259529826376151310620877909459895384321078949186674639712598051073672096911261581251729887815368172093611810048659906991086042434727968967093515924296841361268285842126328988372419378734937704936354570585316921914422409215473569297998968543522180192474759514469050149017875160697081300028673287329129817418421328949186733894155477911539615913755653926128952089051174910036689094544881338161338808232235865865625964457149739890221686413119404287124335505647402831912857229191204406947872438275893093858260507818705899401078598498453001013166892225452948102045631246180544298979481945807415078906775180921365016288725142682861993240254189414617301411059384540070747874358367739248169106001612574431504359834702098964910786511549504510670052308603872899448861600917632370742051249746780888596660473420484776984870253336496120547673905048629228312803781979044124694044929957556080083499412124759154420969306305399803991387938426108083225222186742011140861445372262499539876713957691573927799744010045179562232337977829164153089622064342764154775113507910099505755909387975256030956253874631344615017479099907620540321558448694742163458956404421233787937969299621836016803990332364193455588651498918147811602861095544848631122899881671894061718402273585289686110843870616346917956345730833727672298289205970989463707532269971581421771935276207281875728961583443299323488979477435205822942160822695016125827049544901771737815700686017680349203431607846113554420078464786035697453905943160934319510270533817126014231883411413588990542686221657168647761964507889197185207727940216086532371189407369011354233576785802359885045204694899083649267364356014882356239849443207623369863745213656190180943104097154631255863782767366087110149427187627636946198698669674844157405684752506578789279650679838165457734964301972819261950091288350486376630757673071978894864802354553288695935570166287612017156743647331457970360327185286780662745419496640842154466626869726765238457342249289244840992463952248823083642832300724570947268861579881310611411998451130620893509998140674956059384014970520067786420911828025485566061118894914278635541232864325622876986962205179246160767002663051773388074922870187856320758144212792494194880839038946445443116062509166242025541768452429025077469136694581659635415215804901559755580475438202803578380609269494737237131235605726233995226835064259105807702650333862155278067500652942951136476847433516949344437394838290569341019646066485728257961604772887262101821697118373658127781085574538927492155577214823466358474966677056822315000735819565333710244792741420258320801874302634092348480903403977174170917969584441031684533799207599560531689797232179899338300717631389863032395078163657743295635499954376543902423791493715360125840790819167761650020575023434631480016339490662022795237849396904781740841048060443735261445653513685548141263646545088177065781957738447220086147248593529498033670359439136645392689672586883404074030745557502518136900453269097172325556191693709351073599851603473088316536611829300618253796615254405716254115885767842199518333354608962243726940197089328318357333140797604051478477196481081578318852646010791975623169020078892053861076391002637147385801030536939767247803953072136209613946263263363821284544622489082034699955596442919434526700910239316943338659022081265150658183170518906204176260955083415212717410846396730427362337808622429126806103687615473550770883258414487236141575331177445816088040589092146957626307093933174547621526720342786769576110094073226936003210193968338945869017527332743288335917212087415784583708491396080639906322114997744212790003075959907889644237651951330583431043204792470780084833061648184077479799314747962850761491108348167427916518189493297137360811855658707718751616760887596405548899754980656074088474641169716606648744565119496035430039685362674261172334794476704670740274617589526096582837090313755767205991550833985011740584508171238536367948844133015891048212898211217022192610651405175494110287497937787549191888527553380959171494407152576061104261959420049494465602457542178993291679006957722613696642267643317516789673154669858899642111186804762996523896352503040228361131689742011954957938040715203395699495629409595275224750392465484994258051267234352181645868910265344169602220131890259598316762392417880368272565407580909555820200440046688690182923849310782786522960855226830971926733651728702339765260097152756423554578862365479122800756554824888310296807515297046445093254777165614797165187042679477444716525537039121931628714005331116608730967836930690435091353443790952387196112196111561270776353993149982790987291099845627342320138486055332897200366484716120807364404393814108220256486543301388402785761485492460348389667948296707293653123705670247116716607162009933787805836333283600067703886522067158460628121994898348608843444412813623654149368045531965681277608317818648585827092278345371859110785881468396704207358112650141233091103364587466846952331256310677383594515054030986006032245099773704908162606625312881607198105331329127256870728354529124541197795979562717372764654436429220241624295713372086164717272934402550563271969339871438678427761580696186612620149013571598871028316733352317860023259188258054107901329496392158140806766282293165065334468772325836823678293737112663598302500661463441277282690129261514468743208967933954351511605361568683988578935881695733296471367169298698354424179554139915929606413628307435826731351161300817216692172466691733402677461963245080592431231683710685223176623728904431177294890923147806774425863965276000365956168942033820473613582698611789621484193151945378877306425191815813509737158653158698985573883557719740536065952418411773120379913115349548056188019365774429380886635636163509956181063287325249384027336547916519936776583753153356603227596672789575132748323484806931797383356284543948331692480016030143569950169631155157053138304161035138510498209661048683908765562259727135394679230680439852971118278656857192678363381044747224140791185075236588973814096121799917518201356977251860717927725439869541458990032201250662644305944541295088524207850560299779389414575104975610418295059399453478614656148089907315702116847329771375688927633783845623511107014928305137149949113173308207009385077179262967408082704261545726982772899334813101037725582624006248354836293540769052306178413249802692635129268124359266881186763892225849919422912863524895282903070351316055118327375104933150353761081886365899971759667536012611066026640075404808678490082255704894638680077085280017145041459652628084708570996732437479731073910496044419872496061319025202827135512467447460788044897925288003031104191032581538244037646783286325595383869435869163086827561892067790546683555028518030769161343421962255388626879498371302344536394515437070637200613286703358507770792502172757166390727274982461647161759488148331531680656943099554295848430121450467423695066577304395975967004750266291596590342739608188545578194870510844587980779207934181199536903842585113687423302407842364588557472432855542065287985034116893026060525313057097625022522991964767982383879023882590054945380520225816343430910800585516970901574162463492316201742896161104063022945170476079432534356336827820153715196865472917189125601270193945327962209998851246314456492873126580655791480001182068769535358535994352059982771480887315889975308981094006642315382815211330607514461364788236032262292704743615180066346394963242227666673864249072155335669927980526752587016018448079197279959051517442271951181053686606555004175463652076244465054542056842550816361677970050248390610389345356772357372995821776119636841382973326568068309568489410871727176935248522859110206369118931049913780966420288337297607866083722069289183165497436314075673769675653614537270878940069806859223276844852384789698510401293808461773802030509011202920220426404896529093424717686718669947345855122697061135269110050838860323940753340967803941153703531269038871057357193788573422236204368931771780801829760613326306745780033882785984626895404015132116024450588483346155439780137525083301684938484341630197601397048471670482868411042671398479464143170276969576847814294916337869087453434106815171341835382827324483076899796184381167682354742804107896831440618085783257717876685360407412273049264370356401858817857366723287745919238806746517644068573271402527593582317940780714839626685840042134414268634987012722195553567811853546604530782212516112029092680999398810905447369059809713359104860321802325646201986336292778503116477670746323607468838403153294470203028052411417783094272764857928031334415160343135022769088302086065487111420471037562916822711589397840498025350201519512795631694685819903251013178652805881921620698453681168046175095362122322119121879958176919208846582325721420225458849990938383495532540156045982113791459740519062702907491328337092262473845784827390228919944219425190782901034920734143790152510342312489695858059521001408055641838485254616305425584837214472711376264831731351180447706833087418737830960755389250041345502964732775939129598751690753525081178930640841340941596150622540181208915750814651483942910111879168488378797157890646818665004109018482412939885926200557580582222742794083507559490332977880608607570929080502782772810168077214156244793068939883361037444287770898323052231492164303678471755303884504802735891894277494886340441382363441133183052765281451811582726591693568913883523881673927535879680949725924674109423284373268071282835000521829019993390208389606998033786967969342278609611308393432271222509348810077098269455415969788320777801828238716594733314114600289443393999347173783919117329024870414377853554563461099029726192546012814432215839226714180281925693063111835151794901223635932144593525121844647940385329829932300708767302731204099408085115112635740102517611627406908424778472355371251679704587901863573794796629446290152448081494235213805526998688231991007889182721523256267091271505674919127342939298130386688457391383418843089684334341637208100357075773315968053214480061415271217038794242065391672884513389557170285638721346989408296550620091753575530141039197792352479030610624539407213714108501949187314223582274790826232517204494294068746993172844642890207058659388445915392742637136940615861714894812431691779756241985161466147122690826013071240255228880706919822190599372785856598707962284886285180853639218896690772314135038197826778558861470316723608994297584313117345503285490748085483548833814609041686061046918170869800090205650318278013373921945476401639200466288167660605953189573222147900092807803589241435901912636576043010404431586258166239802655491956045839069716643755167262119747093029710357982889296435696599701649120567483850963547496059452159358618482177350277264405484566428047722672929456254305445586697895618304855883758722331604880614910936008899487323059676570421256066632479192878952225064147766350907118908274913483739441076012780361943889184522394272718451888558923015376032389298608597042227126181608655241533470472430091896785497944647867389463013405036167115780789634707164771026155937479902142344612170233283662460053037521455735015190281717269124578686397892874169685593542276125814992336949261844041049446255925660453409372909019068573017198454817606196002924474984470918051678373564558379201192977314884624726603323645038472993661038462689615533641122906544981305943457740315234203348806343983360056657278665071925601816477457660760905764144709502957769327779428254766657596689858734732977867058105295669797340086935798365272353867570411927079365373994905437336230402962762905788891182171733748993203632052674764969815535891554052962435118821735125722040514745034793408886930458111500404500328328771892603461405411341676398549030133189888364754580512969182643566260140102737124475570280325853682876555304858158462269128181739587020279938285695132557457718355179046921534959963678285054786799798389881274618743727252630972439762140157440977696166422202640917104613928599218874055445673755996314512759937591788178485171407893537564753267504771076491772915018567613843329735618824481435604428429988666856086527245358208342433638840162331900146647421483213296482609558603475877773969174692121286886158926108124505705078266451696584052553188935566225751522019249595266121238801813055990026181485512171501340290150303621882323898776282084376116931865413784070441331288592619122785866613584118612861354802321805825182307637376812433761716681647601787551032003567570425900032867897714860919043566856319851305033235792469584533554900257113451316699262414141144026726706354550172879461604138609082757930240344352044978016264816079092189574347810037681375211235854522689204305328465293434115057896187305566007740558630755031642726494138315345457003515214641183047671461142445568414494546996211158201331294298446464881500004373884363117912578336431351492401821338114947532753545763574308817511538039752526530317090202388189031836436327518717065889607592738863445902406815567878098444576362828841881403922569970377992499550614562871726135800425113153029963638361375138346185145520532009612234410592856014146823600352389935192802543660498922058017435000185527360737576648345033054940622275907879500185719005139816075210577715957642671566684266520156966380253253912970141913368272822650537260896157455670572193107936815889745106352703818809100412169804540454905250375062989739442831819978181640466494623512516784116888546743826119715959762909439992531638313714835519242540168259932834483245109615680248445925611790950723607389049104249591650037272997335902292653215153728406341666137217645223468799431660302089433682926774562286641050365337843504027285995082478310157105025776843350214425792047205795505948475023529706525318556563365182133966401405278968902747874583776710417538111450958393985551842434083809424919099390083203188881434991166005285402780284695256951108342629082165464258517584159692068392160002472610293552612111241940299520173873607301166374431782859328111584799158236552392444450318544954662438510948390314900408255538313359956829062708884316703146425097356299576344020978626008206079366082348500854655445351524149309560578996259031206703494609829929843810062209857097224471650940743958380481350464226885012680629913858142368361213142398240201530396108225149170465698617814705411129864065570201507787833846855135660388580636220797663887153687246401821055882293356188540426909559278908266403568599282531807668848187915189800865796368325929510249558108043492170193592713199795378179536717242915186143641597177795399898871640764569603420770591039501481744544729933310207377020142733417583143867531631722548469193727604236679072885140552970825123480307161414561263840496874832425423532119952438972917813332149008718350040793006784173486224741425233333088332617819933519428229035651691591402059699148840763057925961039545902592314997028345785569701970177038788885504821254567398302264803766977114761399506383679504296171200661530494070921122389305385902503359765932166699529272978648046251806325627748229838149636680298912184598692947440931921926150211142726900729580200304674433109915230163549736841645352268536982204123857833473980887256295443971756850848474050677216347290483743892104456050189175885937745186774561946560240661477471088535153052374058287241489166141077767655569512959854147898645169043749788059224526156137245475725317277937462418477386278430188012108385194008310815563126156257771811574078276417386310686562673617774935954157741610441522014353648931853937207899647800732196066661541608315366788179886960425673879334379586262207032584236183489814360689307699732213108196920788584093090150036992883622517850772548741521327569687955187833638691562926130678896583019003396228073478025497706997208675865459777656385094457999854181317531754878452738489496360860017243356089934642702091840338618213931191585009580006435932197815310133701056026722255063534297409631296550278667100446752735341322867818585796518714169644100823269608617089640365030780458349695792449838786645351979597352952989771224703251591746827634972717445534515257913531954988564726031396160363526737658955895606304985236809017894942714402738577869202962302847329097924293442232601608957079572396642634151621767414704756190112594489774634746893253403274414483376490757864510447724728552567126169799108762587234327820423159413497958357901957078895386932756688356580011945271324038223540090403394418864148938664103132524323259579490964542663916630313514705696219599595180420654345497098071687835431303455234079439657809974479148389928014039310574235911872541877139328684737787792344936807692389967913295651701842724090250427866882659827999632834983832211812189997854688297474983590669887901066024597450467957596259752781607450544300120097212222565965150233962183050479944168517730698541221995581028012894511824932354867732706846187950155718239615409274946983118442448475436598623635269675704808943859986640555515360670007748574659153530663568631461757650276370184692832045018279835528730756121575533541624905315440573809890316073510478846511188970995913536067200197933291255024766152366549658219595923162252100715537310300120136036050314195148347417329766576633845523623037296098188225301169717494208051133628622942310368960851707388645899218628385717762168008954020698389964414267235482520324490420777198321942266481094758183776201093097497946964064229064119978288489544482754666927396585657981431052782093732666372932374745693124827147439930161987738869638501116424779833812353779056537534444720677582919030293721291129927615542572918684086045286228111742285602401456031399348364987532508660822642114343523489077990362073368814953628905785424384063335370705824768494121786379601637609942873870511945391421274318957164215808916580426981467693964772244049101189236739609643195266057220998189168463943717248694056021598013477297326546482110025389694866517591235236265870208199571414766130283954133035432627827876874751106448288785286088932754766925962405288007645205639922020567768181872774155245296801370721071361018543086978773199937315090219143476914680668733484159966017860413085497499375010117035340234847607364596813251284660123751114662526727565840133159854664540012600729480393131820724780853619509992740247151570374259820284866165655257539481207064369291049955154998820434128130642117344094578194218890054889941466887309818377440133213252285619211017841790016254539906922566459919382397471797214907133803879592614208273137196973983283404074758634448511601778911326682073260645099264164029164966759236565981297776943662011293355715314860161694929094121641651526173374119963317383819073077680694807141892005978579793909477498723672659680770772886424961522994931569860192571817732216836548996212043588873870053877431841246101933715733831449677135632978096566494163284814082369690587320908729047945078124027965252155422733253149402199253284215909681242835336824909496405122271746074049033067613428255845389222922323527476544341295823236490647296570737601059952972970864285784921665369437903549510377180821850175345991018648028354049612630411073664140799280294221485645672718404438438491161432785378662374658577874843748684528475412172343485384658040267836471741030618241343430674541537778088519510513169733853384609645535287407894353569946945547817720463385385342620986373206771312201334818097651119230162242676269501784675009421307530205820057086850322766871204227895081503512682983230503976838643781803179527525390279163951551336441977882702282028837632824102857573871134149018879889464404524150928058412126137875913582630786584096898407991239713185860911700120974113246942708904552200615384511369068560936527725279623072124549655929291964794510670294764134522165168455557054527743627667352884060940941116749007753264737178246642109438685366423024520230750492214785806347977917391596378591333632863407238043416825657656710961888003587676672294272671135262560873356236571458693122538813039286947120931552280947219765931123060722078870123218850906427274206774584066178501673519563158922373726153972501767305044334527474650075780356726106329699460239719800859081056952320203554965138686007471585882962462943860227771212362108695996899898196958035910076465691133898793915574016238488497499025591746900610011696419656224370258140773288774208079821182224509768446852641236167007105329049571777081543259479728776514410170711700827919175027031954310196768357283137397364512451427493761264485466088071014209994416058716756174962927658178027558778318456866388931559209231773780487122903431786462444831330315564930946518337272590342861919826636493779119776432043169842168857392787357615265459531471264674237463946824114367023503348583070420529774058614367329530590404165267505275144071227127498105492257802363442485666001867872173762849882818057146707300273261177010314957355511760699052479030305465616645812642058966730217572093099353493371394226010323201549920671884740416133045990735931348483441203689470081829137824938086278229030732077618654532321447362709507486963987667966542360927691725572226744423180047810902971679948175781060130877460412418025486412647107260001651146492424964356642153968099793836477314482449613396293633485853478004469221583936246885467363153219574840663039873294270771337639221396600488896622448040635136249908956881913701228083905467786028986640593533980398899863337167098077556382413340554736596879811933169535432931017407602578783784254907620316826204036339124984017654730108266308635617445218385107857307954233607940230406028798633701836092147028968833342864387888258269609894892194221613829342762353432326299941111830567756686430001758049618448241997822747065707701560557736830526388815374573221175360826864572985664850269452606897668403977394125480249213308145946422159311904209880994434461943987322759168889467203674498666953603004426439731706767024063427765519128801474990943515809160916372548393803434728203808551171360587991021848842468928025982151013356458191149624657591292186605272740890290707208783882795636157583844170927538104064815144050629368025680349401770455707989470653440001767169136303052771781465433136638197842294404730208379182966213250224112688030954878560539619867440936218603106313222598257286110348194269049799040711226516439815155286897256162064778819186170491234012717941577683911080860824289770397111101906974012260491294428099152013155011709232857116598679061261550905494514510804148895977047598904875866568327797494516985434829166080206558706630115146741725290329815159756081639706772208758532658211336048479753622111275625063621850597322709169268537828262121641095845286368010796176590327595530733183585023746345513088374860814920580305882310206918975696718689743193361280687927375380452364668742879153808192963416091281636844822606871440472068256834833922986666876977727283236130634129268110940682600815548390174684008631562615144366867494503025344249479906994705668377955439388619703258892018588927228541327513645646314491615471352938693068637231750000758554379110234678138263671974538859018369440775527767046221108762290913726008916022057375047414458159911571940005878420576526210092954146700462540036027674336374713599351668662651733667358082084864428790225628749418625781836433699270608272795704722366307884192168719184906050260510291837731752377505704831949460751110278955502932305922236906730650433711936126326931513890032470566670024584102039030600395552674420082801689655606171541099383904828503675751437059441502729009242805437539051814457669502602100872556952910993951769484963378200633810678268175105728921327284443002979268006017785499120419958983725847940156896461741023784165129643977414183798997016179964932604056778255168102542071502529056253011404015593090314579633090906647050457021998665179658061172232864442766776541913282732353203597693910513162820736475545545204172421915203589246191058277559138754724960866411580290459357514110675016592525145437737333920588706950512180731332024988887693866315354053377654943887501215974858893751466971139556449418825681620967295462485698789822604459571575143301216951308273312815104437376232601704299399281802080975751913751680492225502648342488018110731965742649761481409691832223941199274854278150374325657006319078379965606015051722118632409957163878497866986470899391677957716270044606074393706086557539884857671849990490855122684469206309494412112178752674634371385566801478522453916218701854384055415918677152303269905184372171400518646012626830063727516290008131473777658745971821898195692800039879220831461397688289325435134506473504209354275180786944601758152886440712179345216021790525908426490253816596688085800818958018914782361408443124901185713375457116251671494800055737961282910325006248678946777573365655632095722016419686208773851272172679679661521787686807328279835639036142211542916440239897820516353657855742039884004315977202728758936451437672560781905961106151362176437358983835359603949439114590109292161918444753791005248201908411504455287166832057811961741493458448766907888378796399447753773245355035843718367556623116552508034826999342848363567593400265913698617365340155935570858405411493567483651334526515497729267118297727051041240997734953423195017650804739014509019299442292616444133073168679247292680118815691569851944698353440786044824894522794582209138470702245392240225619502224762496265140831939750642401209676918979153168763580804872308055784152068522210788110965451790336162698520284101552613860222688509043914862397927968126469535508411020335710160650353311882100905555463842665622374653905399095131650588705455537085563574312079316704826989924965191856279741610509029809044938551392919356625085978920917774450538737490965168789426870823538584430517218201787317657302766666100722157511169776547077974127769512238480038825471557781276172213273304905248342175288470276605650394626597793844739701671489694094664112914320579815700917996890987265442866817947600177848817223267834956990326278522001822758852298998941909369364155033740476824029145598942205199677813318793295781153810295823839504729345650421569020023493233478674980306726019670139071827960571203271620194714719237767183413314668825533849065066966810229257726177366074031296870705019388012868019813255900114730840012990926855929194347881513745367110980812022414939305089363990896993504305290769206215882616638223641263101998211030554271608064105869733287563003066293824189262115752411854730199203580897578121649299719890500704034849812835334885451596360976064809356117436321056144778197756407872777821836773444189287388045561168718749863384423650859753098556083398476532644227515871159105542763275128804419295070266261730080421027246929857293650641737020792540404736443468883038414926302706575439145625624294292001114577014038635990661362898908253594451994708045550725184758036441296966992204690018117249410828227645454127502061072048988006164446696594380236344091749244166493784990892470512660454805929492929899005723356427037165166632449404389688116668761039053812630073145970133441219032827487506564122888840131227117219041226857439592872828719515195780818744124954489120741030765994568216205671331781968133276834055084905945052028051578101791522150442052917567013321245978929508085716718101159518537228223048594697942632252020957046376053957731950758512764400066906649652906952388986862347009137558958937325623479273028773738621593662705629537434999859690930318797486564631190814246211265952551512759264455004763580937191357785864334065001053516667813487670244006510277892402864219858811768964309986065096240182970507929426315864924785839778583226331289491356613297465284261064179537692871678793083104864986601026162445732832472537443187115247302183049316106215178175859986965580651563240013026784312246407344074415334531793667278336933624067424696776973862601163111900912177409534318787560508779428938194695298207601558060526528290737339096241488016650730671259403972057545184898472504717861545409376026678805411738625499615897016164706727326002491131324183579132656554532476576037146930048896666451097527767473320279535404913048297638557793244378176247322011466628461328747349065593019745634056212540253500181817435071801630601616981420120637607673641315332321883714308924722789398118630179240144738357535136936057832457563632504210733313434861062906126632097558742625608900574325964416359285693908379450922696511289930104051363605968698082618209448984807657715574994902193476301197724800449993971386109881891977728484813697185770189810168824314607031235790089118456270414863083530024243702861313570479034619181926416105132366557796739157850191241187167350780615216363521520152335192615360849702182386647119334215202098975419098488296578673835847754177933629759873106629931913133769417674223110100012335052022110275839146382608089609804847753060382954472479455066905174425632662384475155796104533564067157639204674548428022532545936718528298048645889849748047704333259488130757594877787322646138209264316366095275018766600083475750947720202588623342146565828765016621178741737111935722347036169857924901157846488882758203804363751018378280262564344835846878981347835513610164932932880891999376821540948860817775244561776190784622976314866147796262480467112543529363549541741782089411293378931721470753631829678433347742490524327730580324432272170494395584543353970774389781124214335873641302968343957455681245392269589824095780159521900682754851285586671196662761684219020484981535789404273485441880527573345322632561653357763544734623638818249340847963711828650137625244683701172304797996573402799300156313322003542930282967980397170641717644426094058135818228907069214210109454617196819473626212740080379036862821265718411106151854947510315839119634883558175023434742619974759039619520200928908209978413203136179053129941475070920513761503355935693719332771370074227403479838495363019571516112947053733282322753472030175333051998014885597941224468274964700172720576480030034557196553602283300022833370194693325499272974424474182860900883201957405780844498369297973551246093138506073681747242948876202753723554308521095150543117711155225745366407300169192684894739554834351966088350316274651994307993138319161328300007444795409745970015638039540612451398697013804765999006111656333605794893849936723364989314341472644725556820928856753173288210465922743560352089938079906844171143221937547990924898893544600555443207677637268099258756601317449591135988057479731611418797618157759725121182815195198527675527613229571450726683783308225337089436764649622129337227750131535433540156219689510818347937495946241138814999725224818404181354239450311036438189307272686023492117811576380633633184540296549270400483710501460431788477977221612186453497875336867472572514771160079191479888920757167870207408220870487240332055112885957613080850115307009118843403067734353865454222566127348229015800547665832722492535990234719516779620814293973349766174954419330401329136310190825735435359258247632491522329368149297340120724153235333173744607665763438903882169706407570401181480737513717091477063498197332080804246970878833250169770804755815785220978892019716995128669489560175261681221578035558067356674969121088063708899514187715778658132511312769980641749158515229318608633244262491243222866676858470605820653236275947203400271183067021654824244385790372914933010690499512438513410242692433777462024649751716879157210966443275106396675059576877789692990288209048649041315253363329419995543122158357664764560710408715605732478247713782428988531188485859658332608136795755353431230661624878868500716706775532466059310808514579850158864978553399644728752398804442127679455654318637975418209429417370961702875513587861937888591926955784175946570743584628692072786188522725251103903995778137841748579844145368090688290368270590472567972683889615015958673888596363353337777937400580973882387642175215212206587410742174385709126980670552663387378178987034548094282750637175634021368684460735472792049873731219552208844557213456881610773147405661914815988785718661674451490918152850786847112250811606887124252060997198237592592039782671044407562881538407221234882690778758931535244787339066520824075472652418546745628206060168798134830646070871838373393929429218723879908633163158080367055239833723007198206653717545617386807375689179003006258825623255260240248964798637629138096050776870520673331198719240551101173517684260444937935374266945182073616633590390327873162601549221143873755888963593392836644931305447944247434046625583267426636396295189188627413653956533450262427046642653652714653348407157110268063837429127188655623455656151409258281095258838872357659378881926387083358513404779056595852893465267841523874345229906994951875354254977071157533780112268639310343360879776785847381817826877533643611257345300889839700773718478237058943763063376477936979926637167130576262080540191868693340677552668264014411911341977404279218438569700907900972380992200469425411509405031341281244961796698426077533486789409864356703672326755657824812271485043093614029744949082967541262512257869821215113640938605711397850522358707208408339097506923377703914958198532831880690452022710072832036968610528839971389807664325644898776744972792075010826871327010989629020197885586359935889162560521225639344590160332865410845806826881244242027842356714075769644472497417163456977146676162495539637007587107324153664342403631161371480225511126530828745769131848053043506409117338547897815827401005837350983698547403185894211415623329226975819161676376971923645990730159272267920709545689830350460950302363499992540913937560883551418325433086743807264732551818385474690940287758528311187692239824558023498553438352076934808706376895891058935145219465939707532843074290991089908750753556657111067979956254937639826033490778923608743735907754271340980263118191853394548642057559585443612776240891314362552524803360826522433196197163163794970157240315761742055739440083252220047064240168446939851726040975050084087904592649301395312932318274242680900059622522660744386607037058253485697842919847467063262965316990304695371076396969472671517785226124208383045985273435508494290776429866391429452850527607151941626573511404315883163261435564297519642545183316231781295072592088636522211606989895459707902418529988188091722660927748444807433167781480594142929167406769790261427623507776778173937045636385163100516762804849006559939649530183703443967392662433539853312735805627460766344996896264239458447006733435483185843606796294539377363664955508982770589386280541926948197277178290440501340387804833844632109798845123969753053487187103742752639479578017865107307169924307920749827012290994168113286037481689506178146711906430343542327587692578893497149017194083945978830372238543447275801430123882270318126699025162671669110497910655896445647482413419355990098645715226048454179729053444290721746287848612770120101774753316321881073353376499399377948534721675844593927969575752879526053915923725393410138796854363311968625744493009062013286895539224360210571898815280135898492531728375194283917781588115722815490813895266927031530367917074552779508083354752783537367886202511018777276349854374854993610457410893511047094719769708695370322933773700302571291903585249322439016123009441489243912948488442751669291713720696519701507216861460821425788331008049117689979800507384511892849598845095120959694116066093011167680470946119640615671234366927467159573566757440769712217987996547309242854605810782769522272832143230066243677901198697612113223695116809938047860388604437796256749117878973349070391679016777956387960224850850464546195185025774022227346000150223362467216429424672138041466145901836483030707286903441461020414430964557708001286442198905972619066182161499750009581413805117092025699535734407601568238556544399527117159986887567905444001780952707189576941398647322944804279521997996381910864947851845276025882873522071343274517361333051870944026178092094197869167486676922658009440304849824243845187687570814639061140373013026451003413980299616267386367136840412860431396973186392196861304950612288408572245315863631400435365186092039011333692068003928761131635633865581814269757408746125125014634024569143720269070293363204355981188525969950315571701779071028666693194429232150312453668258362691243171743928651434908252270191332071990687963047690469417952216451148996889171339360931534323923043864230611325059039183698984248666487763415171572921654170223956967800068430567346316178938190748496817073607750097363298408750830945343444180412567570246663813343046710322939260479717286718934032826755256039329282860703521111227460804258983285745194619034733911245903134975425466266650962539652327280112310523524654274785449242802191441225472968874007252173968253304395680078999091253539437306964231155196936124825097227631609328119851580438014491456315050759693868562597052751849072804446365964286675680325666914172778245836074100373730883689403377017811263085936897693685902465496051581680482340162201990900226518008045493182032477126751568623951985813121977246534616665605029134826519021437939147988440270301022699549231069136000513518398418947874630523115318942021704133620054006897570223320827805687181740463409532456413549338613471261367054014743329574219508576781917378849855422894256798453265518511436343568710744861599777199339575438510903962252354516136117669137670424552427624530336088509759008452459926292233332989022951772470897957954899217768647685575141067870628727678640368361775283649718674704861422760885330613300620299950412181472831675487228803904418694188276032814468509456410026888746534432307887427121182138594859995220217681736199972458931162535576865036913177839714364900517158980163749677370174567966357632947087620748787271504470015546393968684145909616629163771526529178137166633737358188271214711531347931457601981410542131104220589967807590845871976383323299478504825866632761945530874999928414675698963683024766776721353990090243294853660706076807857658351331699503228404192730551791784697363980670546608982523671232996610564710788806248248394006632151415053761375525133460842693978374201890657970096529822164649287253275982324771412911815370703660066833009194878086616425315507020755475658322906103636050632737114717953446107588091954610747431969017004404239540430576393565701367867757032925744811992181150182020670246483522166595980750012249927202869237004126505871072611970440212824248721173483170923463734406468766537447853052699553260029117003124189105392093843829504619929186899322776379264643213856788501134035985360127811594946652556779445399889824391611622189543714402444904279260551164001607200346088491280637494508841508420244756833724477671662064534862462466528731694597420966099346715571009496324162058923707980745580979720010920876666232098906288466417925944239418542864078798307757372600840142019350926570221231311611474504788610381286444885286090170545280650659635543325135384552360195842308866895283857359447478022055677431244657230184789558727516392042927289896392281431032906446444673308232803067996246188765669904727436835051701439197754540738725201718593505256919022248903618402390605413259285446041469475635454935100120288950035708384622407734945608987381386848567032152168686500384622666737149502307246649932567399758119548124972152871266075404989488780391735359732057215424518927632170877025349339433082383374576421179504570141851945904863152873548919843754141652848093022272564862152862638642381183390581068088869724811497643157191135089779799679697377880191637473591825569317064387725465819915334938250872219029066009040455411137487411099106443107939764822493901969796779935060709793903884376085476766877151269350905930180244569321083960165999920163077546438915728245176875492748944921104911008199713423458846592594412070229445495663553667718726430346896816392494820336854967432759101920744267750974068641153076303060671667777454581013129143869998460176620666987136433777688410070790625334916560410217870091510144578245182436188642074961572720481509306953723134354194661855275606933945124343012655647333374342061445227583352936066116982178765465723310839614948756195543894127694279578562876816766058317565030855388151216302971147798340677059845636612416211141978462882459785016600742565363472446768948355940075005776857019299882152397644263759328115170520820210668678615620370001553784641168662798389259335798886715287846293340413308374593693259959414996965406735952930654927313543517241793541876468081588308516732874905877051937864621842403842887795862608723267599952203772001921277251539581894159853316699218183626073073734631294540320236476280850665704838827057748976068970197752180791381011666128254041734597448677910326612209384626572973751930001665941713120371143124726907685812617827220367845623276263257296399183759087561251553634930765238039927627359328423531418743265352397111719577072385023912869514831704542983288953263306063144073031079958760354826132703708106840962641947013267666484202394289311235336192024688313501902935048912574104971203792100355915881733080810655391690139324714403680350604141588585590853550503058229986267931881499793977425371266895483330768457458566637163439832496089181901001896319868044167002359322713783097600656314348165316832999112925831829799279962565480007655346793721695641523336070031107417045840174163364720083417954794669975330407285558588648956666196510273069111727595154075079359832505294374246620927841800595714098151450250419701053716260651856503900147425524866606939532343378503395348534819012276906675643050710709387999419168669459493785113239621024985095418395882953440497668738100869750941592337575129942609173887822914695178640962409735295566079184464038003209875767026787645842493691549526527955831089560199152065606756994732026925020430292221191954578362181395187413908038496387406476932255564598642867004738843752978367268356445837977425106757782013734488551645746450594367854392270520038612070334617787241453680547969375805943093901073690161300757643453812444039931262204802751344779027149034065470578028763055140708794354676048444722850643492468701186654631977944756720830099510138367710608057235203168978296829488117578650242463633199895161170307637179852441102595392480574533192770057782502485650698063159795980414349150916516495814757281452851994221558823386143403973704457836789013629870156587837848488385132533598221867215203097772119782516587542860967850509547829622914192003824330607780963789686388845847772708188171430901941792645913609357287794767745482406471530107736479806174908720131631165488972449893485130724999653807457749623868524192176421905577854696814406870233997743944048822100224168028282367575051470061242092723709885746352236517059097255489865712632319784947065984285046666210747185822890736086544385759100512188705344032798330348370841335469533300464697886336730685241969730113356619418486201863240196764183544400012239525553458457559983817023249364556035511860209943948972902329277765687086747296626928174669692294315331882400185055183101396852129823754338481484668624993801073513187683421285030277335562249079992068522466213783050140532369531696277371608804684010929484826618491245253633790607529626232778382504702413584199438031373690263911099411758394222215937531233921693284595382608016371024430753667906639811037669822282273326708729934788159211575281845319825513538916403178032284656303274292784315153113742953843407235235674038074021892081978274899987814872943958093468712026424168561767096375187364139443251143527193301938674013723557055103418837055826864300927671181683755517112105593160882384429574362335817147966549923644106231616873547095311868179498951405117483824073523849968657984848545794844567001722216264957763099827298846385964316145125638304787813661030048459431194820811209773961954159591528197496907633478523728357069623870591209302094732247571799894832833155005924967223070811903233977637262617416873901130700932034146492371872267308685967417056918902543768932718017218031885776292989222295416547077912825591566558527919801164087457413091285894167664755783920541183821341496308824132101436140330625770042061422996776319610237203521719719027286327668201086637362243366974811398441255856381720020353258763496654898387723953943183311844503993629164038987843134443626231855407554839990135052573818439647478686758638087946036286279319598953366161941837438801563651931303628465506334332192164764365226114625477946155990984502571617861613587066549141899065623190912746334538500550004704966825317652335062093707054038010041107610505283766840995318286692925636683788077468905200908444014169882291255738790950944755426916280204772207505275293612378725842087604015694917468697304680920975912832581496823357714011256240739174510594958263695547163543804929250214123618820141598518892978498384717580597530978316062171202633556909289759470084715836019719962714724044927737480295303608276821002272848029796940852266107413589854934022250745987635458524129473494459022198592607332421894599713157756844959688596241635619609561884682472078056648800806792011586245985860422994629308790405217088696847298125865382964225273953503405915339526931313095916147984253192357229277936712402990911365327365225297393946813327663022448520877814789933194690398974956104121695913243830779450048958848999540028995863102449578361619341645240233972187960274408362557054810563101518745810437993750434892409529624331893540283570837446532161797068996235871904013192763181324578341080693015686528419383525942326681273108384419702937695121868053352867128331890669068787485024857548350804892553088629244873883315472964153358972574410014859203581756019905158648855734536691570071251719259823490964698581859847704645443869638975521738306577761667092669845210344968739704712699210401463110953298050040327429780289653982769763649706133548351679650118695860677520663613275175377744513378209992780482672838295888641099927962478810522692862780342856779622804439860018592630845217590598947845415236944058829727581926072255701128751359242543695015376896511331387123944538926816466457046493096171462354081379542044281566585296160620816394944542792617765813637650279897614915145554096122026451198149791836759459889643134342540338068477178729683076757933248949464778924081580685695881030620446085793082513939194916838978955863640456852586084117671513298043515890003247638058228922295085906908938252527411508575812129778597676503494887176388845173807224434981359373093588258812976697994378123936460424682710365624474441816646693666409356590997284057057123948127443157739768101628838452529380363166531520201433089454200842393079829624242379196705330281625187727136049209536957181889354318298353315345814780263368735527762841993258078822741168291706675015366653107182664704951863322346736568898034184564932288775329723018550314381052740096499062876889650858264740663597817383547916027242671307522113749632684175723107752593339681894846356599167712947719614268976205059318678359937053295068659056061144597266358463021500504792835644393242758686774002851698850419957654434312859519292074372270852579377084476028006095147790357516258140797505402891088616955996255133599579260513192576711075023780802730968126178212833261801798123097521180921989433197965469627971689452532742298779988613537911545033319908087832334994141840596031379366232692935582188239109839209492505422161555766651328340705863171840283516718739237716249107506607343377921983669799600692956333998126425830557159504570085312067787713350308442387995326072118326962451308470311581274272482816640848024632880856883534680154329980628486820483495049956736163709972050621684705728954574166442413142261950994883226982787104487602352151920424383573219625651168732212875504743318102101496749743911093871273925560272062873698032469686678943590270635358047552934489115530103509682445336079641642246249315389063065260227139849428191750303446908989620128930276076621316108984968580876221092331566751963618560294393191902996004650764426996309026353636601359786653255210542518700900386938160842306232539842785078839371133021798383102713741612967433995630834130013414121992228588732419662974932118982179976333611068102607878182548693941720491794836373738965001661686391167811847300664837873375493833201412121817526327098959031072160829924682708112618100978153151941869423776802629216453819567103126334743460367428582072867270341851348123766566715425718538490269167026588041626861973055040535699016517856778706233390495846346574015840001620019011057862950237550993245264630684236864543431326953276643350669482421181225585756432431751760541374808310538001358173963409024278082713955743258177810301909030915544741220899246778474958914717821670677212673369956441616210736144786380563980844923829673088118156435473098963841386471131023877767624396483371261785824843832909033202203254322866842419891692235727618771319801584453768079516175429336653839204428060569360575913268218041482612082505039398595025122271829909469056013033582311132858622704539365052546032830090503110711509769555441907558723616571454387604615525656935568284862868830494540067158101406688333189814672863562898281248288808638794554733440070532942778421852085223372332569295303883438174671510696247583110138335906969602395207199237323156401804694639793278403306183074310832890870437566031652777403063121675299504877898081970275924154170038784792960648332158985074547379386063809262010466360827055882350836011990230997008943826915415500713655784657231914938493972340438514347622641096154597908499610428216385853228288804537919814509067059061521429266901483259649269601120213068190986771811266858095680867830547468426179314684100032750873929632366764485621428725174799433233785555393467188085893478183635627436586821457533649650506453749144503519556269415920884417002034343781832370712175663817732562146019288110925633482750314206417616707988026369537075896249732298237922818795736782054826637467023501072378328899193931009874095323827587208133590587824131716266846331039188958051842840877148319007766041493876276951211415941437845228314454014962268868509396180825776643167076097248835673110024314456266226631301574046825043863312130092556509459280468588717094752022448014718130279693618038686798927024166756659601908969149223259670991304582980243613939640289551112556458930379848166579121827213570708460710311374493759674906117095769483350772913491594044038708977715145670690980853767265801488718793115121178828291711520195952655792344896501604929263254391020815310012896890501602535982949642454324960475189470748699972483889238808425038860031538191660550427075662963420724961624334690417735119181513710440937505573769413602826192952342636995933931754858506121349822850737888113836025196900749952997386464296103996957490704976847981865726999847856884560481161216250244199289998230371174929163082356479359146980365214467925508881713887576490104995908380241975697691946077049001282976335158275380563259118282049421419549899974482247890154459328418845801257969587459836828553973772907719350672452336944551787539947383961084515530322910127658056481967697188874761428707056307318258422268062063039266741254015977954881178466311645531881527427004621874483408773835703386550439229227119570324002033518758382549556482881077738339233338341932402463778112313665266928858979564080078857225591173996127689448669385789318987429348424858059971638710691378604731838630071231473457960529575340941892485154661625215581821863287102613239030024338192119446448734627280801078382005967200279675153026408232246367503319034479279550009300234048719195285735729443354111960198594409818340945020054943159885602688240431154583630161878929781240938244058862122820561241405089353615148189239962834226846749445074787837401554050651519190188590676266365936478669664411291018192093697346999863217063023623905332580660400463485363028867294831252539630383513435350727838180932938747722387276579562363038861554885408769558801627399028787127517806671732709431388515846175451565445325645997887366309772550524163810796581221545473071141890652005183028830034079591740358565160105620988788052286975189652264726885817795192213949655219069601934932209513235949701181492253131435015824963298128271752811810089613302515932557865492410589180375211593905675642385237293526341013014320420675396280252004300287006311767348283143945412806580958346325088713582782302573736592081934806895304273015281248647076371975415984784391649901340382479165335641793832130337803535385469724100037590789616540439071786323982888988124835824146422822615124627950971199957843071958997460269624456507459487903977936712278559891490770849006468537274556911039891900667660644909756400750716472403994516738378251137224510404185930350278562701443325216796305426909460752818837013236956696738102593002841678948181361908471579916398348238565708883754662819995736589257106739785192933218453877638509590908004206088292434462263851943141479945039909645658090147993564943671877275091240467332177066671256249695406350859481021372740530480217170565226762482107552117873834767035214155165455738612199514212521600086548638998644534444834104520183570216141451679842516094154990381803759044861191649741418090975548874504435153185402963514173772165175902423214178539600415869478212679620051039141402229212448422273635239955407803968888914577097621693007675932673676358865594097117227328739578542935153057947054567346920729102642827386167867000910894813890252426937122286423949828694472234578821726424828950231249785262901595703379531043015944075819816854838052796341290453946656458495039314716200049309444248391540554945068171117771400890428750212990278641092054753722441751699226804446635057926581730593222854100683865309662847089735077263184555930878909724328530907291332928635873470182940296655754365564983648313003566309256989833605730789199721993103921898266131589111239406130746511041548403052474862802204393025811221472309583413129813311434530077462675481448601842482617175830323184128779067976775038889184812202862935787965183729617549584429578899915671787232853625819494456581142594702109912908129544576716572909468942839150911388353709016950807064192422749510431667351233055561971431302925551907064193839590174299532462937220647899608613917589642295625621361285073593125784700077353123148326081004631795747021269657494048423445300213757719071331553313208257106798417300224189153724585302999938553992680486716615861162680785439682810573684376432098699803640662706421430409261545530258300395652145398257531755898080912137283610232937130915425285741276704187468124437843706575473735570495080527639834783714933684579756569915459569703097816659923401702350112069096535286148621694184679753251526491903699917308083732363128384324798882219654938793608674069908820937939736890305959213389419913085533166622676501119727866336564711930268466555589574439211740146966178084395547161767479853132687341935775662048514347153765382104866773143890472782089168330836876950009925438153187514226224514324881709955595594375320132847006299210826961353028885896751163850173073054949916903356841254202787196454346070137337820331457126999581350125322653882562769637449319500922542216969852264381109608831494845337299750033994020538771407653532879519232431470110087225927972637639166534647750033287190876538813969748247934647574233809808863535825014731976059484374499487073014048764887706463975191395746418864602366938299059395441013793042233026227242349859608814255823509984090101416872239374179844685340494795869994738504621094818587473104195711390092791436466176162925810381208422279901800394855332854855899888077313446605592003605147147389010828532384585990063595730329727229987114179052270070870704248078664184763544192942445552811799876756714147794297590098045812433324120824363111182328882755896377754733064049376676945253483109819119399191405171493935699097008518331333458804765905654495896549356610733153179262178274011957715266939268396199967210323102977121240530232965956404067824991460141097055876336961358780506643183930031427863464292277209577065286831174854856086233019432451129664610893241238387794660328505357702952115254864351174891311626889901837032820008284375965277936636933215250670372331594919477383094696634860464605777719426427126257559535115552093789310503437324145439885627891351670024332776754743794432350604596335279790619285484420678466728955884301558084875038006390232106775256136473417202466676114516202247617271658335271534716177661895574620413491935755763323249974406567002702795578743066225663247702558161369919125040883427871203524333752935036410870430688280923798348057575801231031150660504976940387371369394225315599080547024733064216760105962118875279966109902532740587160841258708654645012242934457931678877068156350999802914121477821483759064805838256409885432511987237469588035568427257982039891771336576230942821110650643128069260836408991996455208782525572035980265326901118281297804208058270714753719220533633224804016691449092072160305062482862714376598236890352088899912395727421790028477864085270765108723446015035262861552660486611727253929301754721441579309456301311751428886864924123656262719806617624119268233815164377204841347775992022842240467973031540593314357191296892448702577706909345507045033728348461013295632030494721023138261672482183933883204118417899362624127655661716133613082441080006237893911959058404513954046207593607623746273095448331733765134947493292658216015073052444302553725212931424635474527272333883080815086076783320908550872885732273177493799257984700851697158685888425412164207521656245855399665887539665700089995924565882658315020171160851820156538371300410017715374654066545877368410306717351497441230411719961753214239610634392949537986356708168884625480455069469411557248848963952876709335935018336264460501427897880777493209733138621285814833863427368500563715384117865043645210573420952017993605083732056829805406931269397736446261330334898695005825814550346904702772840774055406472707826083342989864690052365830308251738688867307397708973280719667944539079805822520705265455150154727570230258623186868043724063081708498124211908216072737697776482357134362708265313902065871080546358466664255435563469082369363846878914045888527960215220385261761158620452061948463685433514849072149867289711875055712245880791405763093536651087068581460533058661556713951119092516012331120699492155300071775905804779994319877784979248824491513769925652090046642772522371919694977286176617770357838152810307482894010711256331514984613061397551332725504417550464320998397124486155267512204278779252440447350134364205967333387914097826164485020823434772167808885742982850619268250775114362918942449015664903850741301969990274026496886891121760050778820851836896463274520350183157637342692193218065839724780263688934175794594312262044164232787400218342582675479595819387068008503276271803024798305394576649331097251527638035518046021914048983841989013055998498214714001266592282095818503947531397266363914067791063945549034630476399032551921716271291692612988760124970047424355657513926126610939322203427022894289240582807613261945826132722307277188927731183685401657434316552531221072045629544956801763607778612412809422344545442655377962883729745156577873561684796202395659265659894901268551859517207687842198058417735892670997206946476769746242342542810313431171896280165784922637838006518381858767739483957017235927743102586253207492439209755998327304207784105369151265596983136400699403290034023906533860474927941882629458754137479783693226033301608890956019939920414461016541254910038424413989212009505038207996367720739360148716216507346573101495862067050433164439410451733126825880426966352505444313731647807413317380051515547189330181605603057568465370492399534413387115549871838330192732461022363345515639275326852025277697664293562139254597204217046234777166238744530033631165636910257337639412643943455519783545830728171143459534311972971511658218591632373828781534373462912411671478057115831984969056301885740544695185488364753279509598183916479310781405463259831804768856867949045871125342916596939195552403962065465983317823820077871574480828682517092194790859722592585672102610951857327028222926398487257657021312742121235739602434144006794255739010626965024109184492942119526814072508800814469313327350831844955211659354221532475084640886290672210933111132175725054912690112313796567322206274098802141109281227310004413566621910147782609650665885490236272665110991068615433335041726694480214021575081116326330246080862143376459705561680613963605363811917354015249631199517841011666314956588373765857334598670720327518843974758789624090323754463365628671867007745919745910224409237247674667120719938371927556131946435475074885108164201104576507364476535026672821600756344979068301731041938358839513364799457482870424485107098076601373567515498030405755162700662394294045522214292526398732089394492279407097963500099170334953450266425015787553815432217283221966859444146575619216994041782387302015573277303420255145425087625632318918902737377684464556302640039472656237458293280578259397671175601200326381408797680065994205117643878604641714892879764357261999719724176986749188429606561257491292319020572547209487661185877563872347392755409169623164600054389906616118738770342692853074087154350070662040874233647055062705438531050048065897383118792351633404658539709578152854560573230649949822396287470777434085580632315284947946771277715017949310131761602246696816176447458384002973551366882482598347547628804395359609062948694927032377196019187829448299746095411099635905168811997980537982208059425095446546993652588476310406830240865058287584104380096751425292584322152298822075846395582196576933384244893663755094425805835595834475889445364852406227384087446775522826266286169423879782834955058245251956835403862976755575365109919120209918350819839201889334708219769275514939224828294318848555964047229113816919315138698524834018577491977169903508759584734087229598414820819802922151376477727572674979285629070713773761222030388333596397946736532981534141453164856144004246444956727816183400772722203377975996813705752968087472253333352114533427197010964725806083674370230257113860602073924938319137602083776366096652177790254677516742671355319786256322766100520366346733161625644412284785674405409701499462762115470796364834354715479494233890828716342662092494128182351214421441586790772160061807943120635124565539448196422922353958077083962353426873396103373821535754344402589179209949565390902668700331810347008668982532479109439013706399980124849517418447385555924324050130804490465752688774690046519146396851350188352668879542445579151279234869637794945589453016383835240635885007931030559956605875397583780617044154805212584014887242005455360690209101610535642450247847842599392996337980473649746016087220788983241298154408120984628405464460832864279073961325643035260149602064030052501042827176938463273252064281668895697522668161393173832778758456554097937251074602214021917168553373624430651204989487016279931636595918155923144269380993353692501848680645739602698539889748149936993835358406766894172987244218548080806865324328935368778584297157894220659452048733354830619035080298122064896064304752131583374487304386217005637406195211604471025021130900287978883472801926071221324850782390524018309877112704699558159818008883759093320732526990477388253884319352040783306262124856755617008719912889527763009201759403476091144005724222242313643420487681216823298860864388340953864040438761208929663524029430799926584591580403341490593389352344649742876408881022776875469926679674728843446153168039672486145151819730548851429078285237650562903455379381090429602670797085800938773218327659513364690305157428957048461321474995809041244299307436016816882315664263285370556648303099509773177871561130215422691940865229139050644549180871369907580210061765855976312526791545867716181365492713230868499492880810245117835406846162370870875626217928748450670079186641462403699501499428990144736923400770550992845026226048951141384361610541576508719366653924705358286624865407265723812424079999753590219635241498144271796427800965958017631666276024975305384976263523121504059066457742019492344769917566139842698764248855418478440898702139902704678087184459573827531393461345719513231633075541379401691804345547371448783143167091719530300276218054461871419062479614885477175439204081359313168022251288083290917163004712493029846671644301814459173789931549302207482922163442080928594878229758734138699790643720475811984260131396596864179141263274055358258044604849443015727953493150916070992868071713482275796430427232293918630686089156110672075717314385889065416675220061077903383248874300939808244923966269138402772622512444916854740731191835490176798130723280564348402654887926952001112700355655999836591210897436186071565589269824813823576034928022246202025574732645358345758869487811112965052374274104108156397810479968742892892147890395859730677200847871904737111930869236699707062885462831599196647647239901476080789983924255848170760877745213261216690297034717960615697209739302799073194828059040252071628573285959706593782415921327071519870658270626829992982827114979375641677019632318909795793152190432477499759499663430408464169567672765686399828982895112307043867080301968897155266220909066553706041186647921513655981341029593317516958071661564475817052051250955224084630667774648708824407593359776802862035730984775409411228838238303048379928321506965802881770120820039493732262707728791583499995148363103135034299826188713327021486296261259735543533317443416417662993324400253531121647586380597225101201876845721491549227033079694847620699548554561588414627712625674665693645381169740343054981788150238607664611890003224400800170899757086278724715046456945748129043713084401749003444108777989804736804613439069476940907168675286454066713088182672659537118572681151006599662257735397495428460302245931221413436108752186576498938411199781781688161341420105761710526857877917880689590325389530492367474752861429193871089987309823019342114541114148383158097441365309882689370255560260205696378252189133594069028176548088384890678074235025175619611112455677277472799276595640442123307956769753056650530236879845477331086501034343165150465502116282825764934974721103426198616512637363673107153391789393519347730870275826505331617629446387616440779272711220685003748704322992203390119365868966287771584266358455154366122203955685540135786642638163289689327181945084272941214549766303613665029124381776007024927616490662385160230854663013740376344745583272479556870336325028872534848648517348805076587201592125347596478001418789231656531584672534622163675069352273145830287276897298611330134059021203814802167087968260742615941013094089984790096088839240425522642851016221243775001496214901594324284148631062376977704014665682674199397860660541107834259371840892356032339122553572579440030404962188610296427996806506575886227113149895775123791992519556207888591750629499715562114417302186684094876673473151598511023754599998790951169645273669989021350885705787707738744272634995226089058258143451844228589574357532505542989605222535419618693167598667181875872783346884981912866803796883188785769868157462681172108948093808309087478811375036715469358725803242506975416724754997062159578544155331361822546163512658354902761750164695969343380342438012646025785214904540330838915571741198280261926272380329986326299517064049244016829325981310172150259277751225693343114267227742981725378899418446202569992860330198450326517338582354990821224871695312948914781395049535450706411588506548869067986588786914693401022415883504946788728590548556967767853814872938661779445369928996474976040739690700112768723412231469088347688431984542811210275692545945481127696361713456456715889366579201906417844251447851543349993689684082613673146861793177694088561447759072946157381377058492556542870206818383983444044293284684044192216747009510468388368620819466519424486520328207872250857230780260355566953047141131041935462483530117676667877267598681631830260376444033528882128356666979421833209065138385244414726245870878488937364496214702228123151550241274243694169472815272089497445079086025381698226508711422238394264828396370089402948127564791063870749507507907320614519317938429703626806999236420964187095705139101382332225359502083164865136184716445217986011545286532267098255351229008507113290592605755861223816916189748226466356287350988499046106494522187557017381674134328355299210741637597721088388219887854023509242639706499909198737393648419638300067476862949638607205412040694526197393859293516374864185928235577940555174253560333545495301353838615741956768907257347890769778161929385753035676976842957501993752210368277881730776349844897308383085386263831143262640897127580157072234110200100660008773544980389539960374258366340410988691346318313355866160644052746817176567281769299901753264773260985494628960689027692773912659831070641102189551450113017985914155747571367906123306851037847106912445021755627181886355603417748912380675593253793684654086572012617584376619275799312455946609925489993204982577017823868001039991320330744687209205384941855948085996778920929039473370906500739569077060565758804920778766542830422842584663885979931288499369270272413829513438571867544204122799041434151059052464055408237168549105897547662673035462772451180828288114624010728145501731679404301843404103030377795799566981640662416709878857182634983795153672366976478252832894711473067609962411664945015114895894962507572159898500075777989664547556654936025777464201198636299411976203877626745377190768988001165353935254143508924093029096022603342340094447387999571492312207290765376490296502599653898783983531916281107309858975699387858282771044590207593098683483240049204590355808228292654339905625785847768158047208757813477287018887652023261594358605032485343239115178746373337043374323572478836879749677894730006031541505780845205403309320691041847540759705095668381955312798199328490173512037359129046919237662134408577540628301668568461334611891783301560677198025143828460340179171854121357262167485128075134260032655874943893630180400076775180576825171059759048671324171149103588768153725742037871826184859847663540109457030340580875640390292906404657569267797895874011845708496623010926116276193942082646668266201698450704511238870018610681964483217936233783598678895950764889955099888733291884490765194068477413000226891687600555361966866787903011392329477332154306461525966691090377509398159922495244739971026699814167217229601921379128513215292959651031471752783299817979914974813652723167788988974630291806845991865946494888855616268976842675107898426085844876174770444230954186729022056432704792849078189107572336965062573635440734426959576164943835562302080398386834420395828602854571869278608820100009407384307836116884911992986141104851521088236328109685476955969193832502942837490004595851683270305123578136838302604055695527411047714551239343061838026845024503599318054670060044575828728399458593974914341609072635696538078115717753314653397852027041200942288580889777535402634877301693062477634789392131109363229886150996401092463644294301775375483304857613519473148228309714407427052514516901411439218448892260443390940599286055038769048187201311133446579816890002944784969148281050366957044030720896999977891753166990372480392077031144105197941885358714741645097206055911837313990148463188632707920271191798976023565465295286445575364441788792760928655869365942571000960937286132094661937545665436912366437060364930361600054111816256441168423149790285889730340968291337358377845356840915301907158953551269513421212913300775393376015860931649285313390413197371356976245614469138951204594408247923458596999650726982598580372240175090117095139697038595939971420968391283430911919658234940004293937112959666092116057941686629085454594593856727193517347531870610305139415603280506748620396098996085974191373401149000485747011975667449841537289470752386414724814015994187927672699367689436333779511864953219101728477974952501308132147295401080309044000696352892345724052422743014045955570745039936891587845889381799303565809041092608930935534453220110733393184852563110980764753376927098036579174994733199910408586790167199326816368840436400952770236471843733441954149912170648260208493861207374014185652257027542100643061330142838871900244358854701646920197380895222554267780050501471373223913412199778691139697132386968030323553919366193685441542268248881924046887265848007718245221242843100140481352548367707220864292471251251827309951547775465844643541685222371904306080157391282146302670604647530922642163158693949850559862263348414588450319798966163120150722808334745464355858484919968835827030590798326974683554426645341473972232477635453545145063164625186470979812159237658253411774055614125096886546592913504032437337522827438583193641768063676387082388163762477150275573338526017400425355699816093584016696739475681017224054116819328971838151179252788018315564742198820924416810217563887623350488128730987499021900640292353967983542128030271534296550436961582300611203016336258206323076747433420696177035290531856660107633404596883238554446140638917849285125235411851408926413353717288921035556512528905811594734510844535643586453041445067572070463177788642736860692977579233591073405932877720800137788779998056347608486019930243543915406357626714292825209242687010072983550242672855296106082560245168820141819131782374954216813454549001844825575787551341993366685931750145720046617726059164907427868228703218423880853225478125917863204617641670914111617875717631708199417321624158031114030686214152266181805734331875126436025571422076791439102717716630660280851963560948206338406940132194143967831061983198567903327891987845296488500483348767608629094298761631804101782224755306045636707164432608820240641650387140291366819462798534901194685986331900573229207624238330459736278980992511314315346387687163973151112257142267662670471179592260566592427336250214576487146412354262027762883191877886865298802574691767574237754502312162855688292105853762917382825907082484201362409115221922012119043456577044943225051851162102125721072447313358701172886592684141867995252856152980219618028018789681184069286534989373365824154086961009964744653839622767287981936814182930951721664090855104068893743724612155390613350896413227340426908888653605080487638921274877317552501327332248439838621093493046907826657557465076966570547360191733718046892940652586620158251889293818771287905672074724180409260757581283606342247869921312307881032007796609597425358452933326412108014820222502135160067305550851264855970731388669042753460559995435349321802161976903121355027202106532766027629388318086855987332252634293954549931453237782240058056956146862187486995293612723577274895240518495173945758277502498472781576473347226469126112466331240295776807768171812618929018855294517053897274237004709369403970500504483742541204329423056948912485783043019793464425751173594040374003968143239161898619910529426756772232479859397992797657341013134546351479828680194438715059228272658780237799087281146316895837361710286893099391723204667086944674323288487033946990248857518810802678831444976531507837813742822262917434722094216813263492081565657440275162239748334907522020771445070585005501094836503465171138506496008235125985689103842234460350032780991750961676908501729532470675921532673568716380761954599503142896792576807494722948091708449382203346632188745719119866216546859061358056136334689286709312075303203948072176085261127480167729738750898639122124225097471633157291864284708713155336359156115175914366225007453723577890162361124394857898821287601047929322837270864178387720515981353575096166341193838413338932386866732296336322159872058032736873188645502044995793241154256293585764960098044899001219973703305354038552500357959817266388483099440482181821761384170095642201171722748172070530121802723121590741417590112279189011276408021557770963400382784837256105584010253367379935930447929204866125509949329017060882357505822671730537735444187272750410142861891068065555331337254509775191057447761083642255980703797874636190776551448172469055822469079166649861044894473153464026847268745063914862553355212441357838403988797447425021163599737088714396188414992009062063589168669946206098479342055693777250547071818734242622286372227105121225047079275837323293566437039664969017436320099081714633555332194148389274206140110885703044162326286128411271206182463066547251487829333554778927488189706404288492362486153910759966634778869486744798780501516717865657680905280443570885636005906883727171202389104199660535710102811552967506131055116644983485509631150788714292964705410570947065347073155629640239197441768244186072688026738487416745221618968712869743565078227982755278677122048447873499486049320130369725213668785622207225197209237460568230534277016757692403453340557368321203494618332342534636071821071289564873878761953227298729464697948062974038924245146711305263067441305852321390264522798342709148529458533938430727690536433708813717565310052838069033849986746462023769734549399543733646313544798275628415965085474384377718669458503275257870560308206184762843390500287724973636769508679949559223067944079446636861838849635085145673972611611708159497919202804692468372784567663619548987284686121559346390070896050138534907152493943824136484296354154645027781864147378986581429703560232014394070014510819752936573104049454823557240323499855093380781818987144777370684499339252383497562315847536105572917591494727197649840872070212976421390439173736695526149241429214434305197345355663414647753086117972550662459252161015364424619087831776062074292458837303024308928561138983857474363675590322892055274695298958488118426458696617370207337640058789588843413576065493640886110056735536562663539686545795275547395831591384272511297514103824127690033335676124745621432356741661471227552238891728899967056060024402473332405190893301485487728325977333435817417719137138873680773946761377110059506792859141687759411321258701162138339105440828725908042040536048001082032300575642238243163868696059592478460524164963927642042153082529743377576995481410984468233838834834850310945446045349830641653174637336880173158643562595182674509040969763951042092366993655978750223853274906388032521857648648877651619584565358825662139162613825372650908447552277889240173682256144148774856705157201441112979208764300356957949220576993684376229886505339082099184798663675961518981963113846798659991678641319329399223326207812712468030452219813653229982548239068188451737660258619020639683600683267185496335898583445984595103785701872622546456554828163565231309981432530356240592619265211963706478463879077354507744911905240556100789984196468352821683016671863915282177509829006228680910626231906456191357431655003373361064788931611672197439170756759236403195391647151616419659527208838650127907081274133071926160728735491688982770204245390147805200457216402668326322712290777617533607931805874841916657364606179751900912929678177133276654952710855208305869441477483661238446162633812939397828614744605838649401123766632952930873911240632905147416802845736903570898739342717565481301877951519184023112866080898059256236087781171453052917552843040647235324009271321761439657736795443720112798251236965648396687296308474041492923811328032379940267761955456966202485204511493618811824496634324251391919354670783151453527833933687511304852892461535043644180374769980864228512901177871276966552966334422579345003763479991332045645529939594608818788439589728300562655103102296608545706098675014086606369294959322994282164393906401633673310122577062319467444531248304175972934283948590752052317495492712972275198022748767898458294789210111051047739835303675037150179904805206980100493963135802320198462589093338246180768878008267323219996898622364856328487215970415387280279058680269821083591203459786532605594417545506778594691685790285332633158695779461895473246047433236033420263019074497259494602687317099595115040502256628077894574880721153881179698600011648022260607932242032458045609966171516096930118091471021345346634145648322370544367042460169923320409945618878379236660351080242688325828462931141492496056381370693802262135253250640970335648545685567070549152582244177060756770503568861933524038472025240639560984179506568466344141108203711872012426432757789450222660152057122255346388822854597572968802139254014392195484971612602105617075331059317157593453579811328411712874960177535993113965481900056216762166851475501338964774876032153157282975700694495507934534322555309736872080393754942847067389802114635277648552142496976501834342386229021625604940379835117401033635587999616740453857408851788414473724084038940705791922611803589115559364088185587923155146601747732426674747196350323798132275411859722032134310974753499305498664314066789094957052422208956811995892999758416923138243051766002191825863636394070130134310674373316993030045352143213688848483584036908972404581216943408847475290057601016786457378718017687318252618052316282492447803110557785896792377820784753842491454000252905567149710404103223328911773809466441809665329898945048956729058265649250939940959138378637694192452402848507363562057799969251603022386726194474921352345132935455705654909264936548776918025984254095639946747392537743971188267689332687429818883858436373286071645336592619221995363115083289681998675686856089149951859137493950727442116021493522457103111926307560904437677624822998764031792898433920256228547945177411972848262943438249876182329656444590567777005574895830238032485343477221617028180017381895654834110594536306333712561769667198092697885801456927960375848025947042527514417962069308581731343078323869393565490997913191865863813882587434288241928711088137064810889766231269027739317916908114228687551615127777897510525404698869586773289546181523471047886554862875851596970480309216919613091854302032024300124441708946832941818483472389977408701838846355195957753097034935922614187199392404705295477386337079569579353513474256632463111010270154679367695929182216030749048327543814077842257631782944658232842910165796223180625862962455947553451248645497906118947270877839871233622511683678867727302161827244939481675544073622530830417290590076195794496258383030386824719729361935839772737941887714279073488451492247394765512485248734267048597049002698631006438115054638989375981098074442137421859731698725483717175538020865256545727003544547741392527965449985703928119421134658570687687157813645199725032781975350224673190393614491426565610518979767943772562830829483224560668649906953125485810567665781074911585024027347292979604188952766204479307240533713083911014326925018614032047967866630554335627332672945289516470433757445038962773396722061285099344273475046999454660096991653317641167766781894616197620422829745097088969346989736620030381138286493157356863084116419401993519062710803560133709441259898089067480741423721550275457856359155956500032117548671104747091687751867620475198491671717115046988871319323127386036013856814561283591938774241498219979135618072453243201275253738032983350910893041928958902509989605216602156556137167808061911544884410633010032669176112028147529208878511990878200697280003036712249068989148490252403448497319210950024042301695698311000327947365794416020280704651519042606952046235884690919650569970781123414603197268071453855472729372024552567175690754777848185694715242813981525897331387857335226854201318899161405332965992916521774813077046264884308688051534826184402969441997910690670355054226406228079432110126707115254609110201613188858332342274602333137078948214281078910657908763144394807767257796937160305017475796283504851492488496564743556015246422730950161617980522771528481100611632718006336333742287629802775841501587550014846079220372765022837979529903608949006657913143614097000315855149909888146945247093354042800430348648455019814678916846124664740308327976666056718436707811471380301828937414169974745474386637837751157993787863792103451246200415786857950663164689526567383311907035761312485406388376457849507308224818513597484690690998388697759385460412429284210128237757346212836263187594391238228191393835241902880226812767763319126988340478329146139999679408263492699446899316803091039089629485020118926286170785459704493329301282761787507524511809025213176432430489371532011745353905216993508525977483082865517519213790180586841035067046437960537459514682621702602181704894846990292075567090714583591010100825785757773111240470785296365816308947170431171259912711938545385949720041602372383060137079719776925761058369043942417257622422890994037097158504211613563393289407214637021264170627327643549901942384674373595771547920389511787655649478221692746807660070321856170678098364330989690042532181891582859329958906691981700487196702102007919082490589042574607398085804383184147384441160154500014898974141032490905386723263080101439291766385751611617264680532692928732767734356759611950666341037738117125244682673642983445227749904210037186209444720580189293402061867849154327816375020617685051901882996846876263509699254140758083460862909085990183027282734325461414751151828051115853316599925152042926755308340309059132598230130783354802150538178264218077308277933800771485463165519789670844805628578316881924960712771224926883186489270890443106048303502714795206230567018533487642136508537374354517687534917713573062391382616442466267705046856887757565951410321683362140868074853230005047478451761733198649298638805001826753925599350504095334830479019988696096012215200801532475374902896473232174147524165434254943550967390035693405801294813458234112205317943658592160522975084644094250397478322353720677153666406290305604574642100832483095243067632122870195513333711213079339921844946561604703004989741897014960682998341865021063009735140898285193427077769005132619449967368672150833577042492149372991776128018863649876561427874804523622877018624291870969991936757076873750437799272910372948097274729807209536471452654230521926601919346821906569019274684135834991864226141310520676684270780466317541856216665135403969033497845353223284943153349099531319667403266803189162737954878289821967849161822855481894815100055062867728332286476196440601226127058504330738106739597124310105349176077013829291277132800193579768961393697633470291922573955772293427126547936106448188086005903628999485207453415415830656767095404319015419267626232037139142901397776842998056525156442088663175051956499696257639707813470442173768087007153391773885464512148274843977416395945982787735701108803683726756684237296302190158012981880232359405429074350755273886212364112761792403348916545892325043784492706260944068506503839914286942881221158634192421508197389459033737131716407183869547658508787806307200465476635269157267381511581971393408261418704376152221782698869037182995891999950468120742346165828140131346259688869848167491065325223853436128190250178108656974944356818258652181592395884214208794688145478479101972013998306657665302881227882720445846956160460707558281828056233862417174425199981861779804602763793441143906901183684620168712997244824160790911709533044862527505525887471599145788359006464063660086466085377602716093080959370140622712908514480630600477335534675027724975752145607599454445556075417811229703195396717585017169346368491650732421834520277024088465857310670443321677656084454465587728703492734525190995267344974225664888875845178387027692764218605536204238764843626126301661671086361502138632857181456805792395705436715026407882917884561068688335568234102376576752215551487498436429979457740577114084620671214960247028103262447142284553117230306406583178230938462897979552460782031427408572390554099934886362180567887044013762988820225773578852348426166798137190626365877836551306912231855258415168945274262302277793318410799562922086408696840972875941911841877730946267739585470608923672027265692784258586813967259978580675278557098286683956007420710268960850322939663516730101665340200714594151858707453796760109371487695768045804657860255194616665347064851806645639283616615307722168213025668398613784211241902653098699808366791766657508095405721515106627147214620631627570097083701605099130975502135122844044862377875579196174237489402449589864069579645395121956349065799839829560128319238125873479048892465139982557294645568892856993147695018389842198866086637292045297172212918783634501515175806545990239044013435869861153406843755322257565902340144529839716270394326291564288892324967168922652443019853633678315557851116394788794816933122473242829652418090368479822891451963813228712331954340686578331738021254464074687719942231650527889502907600646280407788461884867625669976438062201631358768927679623018100671296284848081354217271604026645512801516012446365250184110208143798477218708837313967194023510507669005614096544894170557728764895007983741531833041168867903119642215439637595263285293484107353233481703632548037934392588006516474081833970080257464609137340363463613795315598666985660637476207021875830814646850663408147895633257575991924064447375966953088440022246895024362638349602512363245165141880883053198276856056766619850679592612065888473823507593715015316312285174344093753883819518053476158429894833483623177935694414271979309443827254067486214034281141248413597605488440264968549324073570101192134044212985997367983306976690528762448965151547147201186354220836241677655477417377752926834757048845303089662099516178854772584864904255542848045572747312005997476510188796071887460538944158674930588777787036171659583491530277888047433405598814218465314410767047509502465579981411237303589214406969461102337826933349286779005640084670051436511568013837928795505319075550204279465576570340877222993966972984875167843377353411274096644847794467283959937279449525615070318783515353392290012413257258811133284074288525924873331245559547032964514149515443005711302657513575406187206166140836169704444729078360868687377793556798727813796829795023718087711483004332681519746986660033979159533588245822352228634202881453439978956624790922520309321402130193903221481295073452787946693769417778506661503758271003680337790907003522854003089317503399317065662248263831112680873131122669507728733203429750224648346012169803479095251205469099550956068361634029117487694325476463541515229573214946196170899853984857666665268889228316571403402451527331143876139304945817969668405783982207902953742244312905751650267996268535605912854296606353411820084473219916507422153416554288261485329053064466120041497205211632898962686338692798139599927399243565121246269595974962057830740660829896497933718389721241118683043342088659347907819005341526974734948860910661981583569058069352497884067183120039053185349598863166262439311984696493239027587769452052178170354855394899687551458101335584330969339011076341874757866679197344982408956485798889362718267629987758578941945466034270148435451879580311117580735545942933630759844139619492201462457916284476996797102446353183641370390457711597063802327129990522783135652075349390908395009514701706120695995439342731367961260651147094387763704283643826013167934627946721002079289145112149796643853160270280040805074211654046551689810408957424248763314642658683240776263591197268028722325015039999396036790466483232823774851468650889272619036345595899214069674488090191883568060448698120733240479318594018060537978845302433971670205419737142834294915904380262942275687172773161919587258870707591724594515615001979230004614794690119761229596903254324346180071811919057357008586311692071535485219451367012932074928241442119690845275969404978773725176872608232258459191552359630781131070194375647622045006927373796947479649563552698702634893584267881860541833080015711382211952585304705243880277415470471963156417931809254964382884241594924031906649586962787893657850405612622586613449427051452778534556071501358409442280730971690242773947561191897129152557343605580583310892350345248994184400307963105463892258670681963295301724374495768365768297615093581914178183337026044137940140942250621804703376495798843087105285234561136287026489927549936499457248025819030209136159014540997974334131070445204629017518544992139867211936212525636362827764825287688708508572597485325459803120862058908915506732906740689122056542495939463503413037902954049979498500105137347476016441800749027115466385531296679024882315097341252509010071813913044527415186983691544016560934622316590273638944172266927661951709875822537229451824800351181391916316618701938006887563187408022137088280326904452327783745288113340473892406419284140886301423416830410231327932548746465483260119217983409487775228372823076005395463199450868531870732475025606345656239462803449219566525282446146961410174226127402478280258468623859258865894683918544296887574673683221459400463460536783096729746112193288929338592467880766074144879600212743349549609663738975633500983965402704732812812440284457744913501980524863723577281860257379351714645214632497222314258929630757812809668965557714930099181401425164038756369262023151494797532075680045217912923994948159852590806737011618377355499706460904451409950227003826075986099083973759139411475658460628016288941496699072010046278388199117451015138768761545126019173246351548274124379385233909585419413617360874601535601282407784319253139239186069142030518095717755390928255286108167591628161166109028486057845721646680483963623752098672574246723468014619890538588419508414058909157478524233522127375867327382344246726819137301205369491362594488236682780478246991025441417948930939180394878308917414661115257901794454312481370786625182412217626066516449863111811157744763851235706646582469653451102284958573378613217520577255458172472491580839691829927460526177428250272003299793583022386649247835801105584319881992774025643418099760990786153208041628921371862781349585923038632432512602469159190052515351865237011683051485352859868621268041721774994169398209753188035528681107453139166055497288576803168082840198698334982175703336789005683036249938858361723783920981448349254182476889124783122553777234544793470014090610137059009837788418835255137359819005705209178129078485033195549628582038438807001939854800928692859258376849051908925992011543816265275120591238621112504338243840885624902498466963377351871232833329076935956064480191579952814702949139170028483541972531274965876866251404989149733462917445447461002122157028648394222977155805383689596314005492915076855933459919745091900336916155418041905472914734233011513601712426338892630466755731285762805631987509000047673401505944395833919368199741554004797171779914129743242395838409897987644055481943956630848624326186606557540492433407025581360672351208527886232687317731652813598842331903504809690600466233876551899674803426006942728370066790015527548477493917621734174286813208506035214289985725674066022307539478574664636806372272278722214905808517276113179335590852709858943758876133922666628213404144696575307897202464672874805962829298358389157729490273031846023519513064576238066243197740014139879216868613891446694955622006026737038194372558156512718628743101159237754163439907928109807150552049896096571074432247423859427295196454775551453898916978845691989504952432012173321346748375280312984405130495736116426053287368954269595064232182423586882850997594922807366102180838915938796221698989799596518099082385421842130040716795560203297388742824396115218279915477502451392817271798806398433286654978617979820175942060085443011187868616344909807270905243915263545362087292626457329828044948715085976451947094173299725939103600717479128701872407179651589767174662674210848319867940711251123314154163763696617190970911979169759991057157803668360927781245770183717933413814345351166434833509089819559743153449680153390508026421830412435892851440401223251913491562840312606261935039469376529703639802863654200056862528193342998068625838165555797306625973494489704136700674005460419754775278438907333016593111137326770398226378630715244847215513449419116468613273041887911696777135679318358652828366439708154535649529001178427627579861383142050135346853365631380973609968719258352498171474343400430379460452089091371568087684136434978215448517825372226615510104559590919832249845312262695306942109521368847725457028133320757151914805189575541943613189011197936798332283717115072705976963160957509636064710772460159586341078628362294975348933033555345994297201304797821072733141534644539229411136524207684210171223387033123885854358947642246347699783179056885181550014245494961242282957074502245714485377186127296281189181759040147451051255970863559349784416411516921280584884089000582057409573080777343746685851730948339826500760351035124185468292814556440505762470784369896465255137201219517677926485087575990790617273667131464172959633275400175109739981060705847916292132276527974070692075745775155392884502178783474788258374222557406592300273395999789969144703017753280800666037283889523814933642271763918102439021243791213334640104370299966544364331021139604351683034950144862796665537298133959869417297957834952688156757439520931446625188286007566502624249001847062544425569465754362704085330508702901882006014535695037899705629847511049651189028821263993102804426917351629351767470484187198273843703937623576505813848628188260968739103190534163955136732077013364232690491002653108175825844551334686012833176440121901057046693459775137921165646140865646812075876255397420027571282417037987231288215297191528236051015820224056741947147631041331185044764381575210750243953930562731502633354831910831932239250972466449621018092672256701138118753171433560976615526856772263600247634687075067656951444960525583759641304873612355375711515726610411904432906291525385264470967452833832398390692463697620398573897654745810827628439427319505428138000868677383295802309915941359826860891185105600581679778102946559447374490337886903405521031879245214622759665843506468912003086211735083775493809952603386068170680713042102589606823499253617531320254913540076604023185285669418890182884208418873251487042889021527475135972588909070505750483334351084474369709307974328333044247739714181190842151162119722744223646768521366264222496815487566157245625051287232205511793893324637390597353528620002051597155064472730407121001733893870943538220514964736585155704214737777823646491396348938402367084808714364904623253409558310648567149195033389464408986044465189695209912440393531884026921344994138049380901303455182509660141327269887295329795880156034984551035140653387213187849128922188594101098944752695437101775485871125713973352657808689179856736043571032920590301948883531582969361516352866961534873353025887583654910368791681359055116041392577079026206418897160663950685997868240463047997992537308449161661096552692918891090811248042748367932180549776386906452797681666447119104252944964833830589450811967186405889302304309323846172096782212516906231425360122127193782853082711733185452239094566228475167956018119112735295019459245122407067868833683261003254623054845339776966140472148647257676635459601989044669336783890502342035928178019739568716290018586783770031894619422703448148480482142640844144817053883796904605609581154503495332683638649511565144112714510435186690840123352357548808931156657248038578731568463784398880595319892167105142582924141795892109410380314725845327766938986839961932981271257170160319051259545602734838994546745859822651814410743351258033357156406713143234781942078100766011451981010921287412686373096833910183083548853420147655389039065035828818259461149161271394905982975918913088987687839126334475835573441197106177797065239989566009769417492520258915774399023972838028755411767591472866821119198540327877066249137498899238468318688894025595293374970317097895980411778178845757906802767264004144084878840453587112640619741844080312259462330173999055873041084286016881904454628610472842561543221342309364259526542562704474193499610067157361055656365845511572186456408672102374727947190483225233826944235146149447056382555530944671159742851580938540583996487177368816752115861954943981097268241678089968210165149754374045098514870261774428692936660248327774936928453036430952906892953400322382334915095893579904185618538198653410480602944233513508539834772582596559644461153569399053906308142432014811805428661763464766895545724754108146451405433357596960695732258055030958626236378498079963979243406232372256588003900607078155044778374153909922510174552459287105515205900152756570538652714694142389867237012297508207700708970419016051376009074978890138323299049303176989999440152791065095081214346727748927638302663419052845762918421986797681775287343842746106661903739513065002715722082065273118729702027038736646526423231838270931295539636744947971557489599533992231618585504615954378753319641998845373978758373505897817003230539730644310267904104243740027377562076029239583669104437185641837312059951820375152936811192647385663967746850327917238355123437819914688555095894111332348204239341219981474349659463695989207701823775968147619576396089199632495571156838875563114514942514043503836744582782740173430640206435962583739738485031112378523286166886122576439584208995700795928094598493761462535488129136899307893408245105336526469896479724205567967850676106531775314059182616351823778711676716362285426987410672510685669436563208482105750797003905499104705711082953068782032866043557083256771705271118361271783947459113072316022641863080874471576540191688244116466431684572488327068726661439868126092578743600181854100658340584182663649434011156644342406617092999685344494872367555020730705560599509088321793171404186354265211816899336131191956820790518940066570015898774171412953606136412020065710559397618133264898949564143840902827132027758967037310913767329212228015821805055546732122287630281422562850200146686144970588513063201928510419589126445148389176445701408170096955084861426241919617176613671848112879803484004253008573946385124247512730041603129515109620662536010995383745128576741604551926092210570325043662650330570260129845738502499138990412114757875157710195367320684287133282961833077061526289410063584133136372843707676423443239151867113648912100985028903715063061158453844373319952695733898750304760629281312547567192125294688028288910765979737474503617200375496182440809634714075873473473458281047161566371069154347426673027212774522834465250159648466747552320675690657148827579708295693481084079523221932304048036378597522102804849814320790191443587477531540516599479140388808027898871329672946213275876370463849294142764008415540564749074487066149691118247952679926287077503309737389596670069379533015418684365702349522130051341192663085863969039185693787124678035121877142723806448632138606045320038744435673251088543869272217517462586326779903969568942759809561942314080967887950702866816214020357030080833004228183390283829594459770800575916589516533968295209608128582515246013148301171758158868827896700429110981706719062231911891445890567245012939139098826554813708265804685333664516208162920136314026962535883445358197863307742316781889672396777609976095478331751666729740443001899263184171899385810996839656042193179177571177707617214938041471453853235322919901604091280780471019842614397582809223718487841337878120873573409223133915605387994240386315974942389666232561826698452379966584313685474028704674888395405114846687199827232523063743122748242930645263230029601647662472785821824428478857029438368740318176077273445577726441546591877771007051538497759664185877759969155652818491977614892778385353215696318093383810704346290256983956827823398437196026054732161624150713532214191053396645719737056429523431953116955369300194349470475152404236796104135886701999098978389329230424702403094192315423473772601863969054762742670019074537513889486509881940094843066321107031133709550706240019091497759550663516592287294862472234509587617287690499830202026286851684027679301985518193990711304828265935093666761409131405096346676406900969303156434073947033541311694740248663348557223408603026171554582071729909094216854903063481255131655191180636118643511065412185156521128640465132847833853916152916940155587650732203393498391090442029488206756858033196637845400734324244147904698876589125685395886643802006894757964711898708375422642898659542789547425197568884571386178872352559669928106598285158914447338457613548646343723418650719063950954632507757014627259853326357122724299541984678994955882064694645566259752622780182092486467760629927838288934646204631607176807745728640813446660206672437785879384090421752451957762105834038483878734356814370271594087890029880003883858440000807958952483383258602865675876319375002620034845773454879200103513561983210678007838340226040140289275670706281469501990594777514013870655768458642869560145777180107446405705325368641909816298395874953655424498548107039826569909236842844081736865680782391468472252982572896343049325378549715559610239894568115819590927831504886056147220615884947385540962664964963185341897790858842213041176214468000755270786094556510846454907097652808298278264246293312756096704426953056159517633372816099211827146885146256504470471717179311221783980817630361831027500554957323704074991097402373390811898169156150004131687112679582577012129684047948607056008033040849220236712319072182860086536667761182575939139940177537905561555966697769729171344770199742018972182725535919299281443025944786424348683781157546521901590840512939956622469712114913617555140250775136980231688349618089395540353230159094842012736162114010951574012509958809433376642913461785458634076110453188035953586389888213299607687282182367768759986997438649274221443671687406013067614563037510776296460953255882280195743874900449508199747892363310150980931446215642804612797285397146649289095044793273616865429365063335492059088958685494268465418971470262972354477974751819031486563781182253794912414525009722735353236088944940716971857066435890215054942956175843727672653815954705614781681173294663249674067431950589089936013307472055974191894069523144725007643845336951062622061154149222834818956129668494698011114803528593063903989162853871766208379372493311092280401824607825746499082177592220312042075016963775373288211528364469996041716235251309189339565299056526635711231241832755710717728371932389620282392290875095807498181767711160208528848108682953322686896528133599808195882712725943157174365459541399405347834348687983379429123836654807485266265264970885648123594413088017057559874839570509302274427848351831388285399672681440954266433231531533084724136351336851112396052298560345223942360436920986501680945985693932979902172507511307413236547443950386357196808557505838526593233931995177785650180377666539689794858874962635702910002978229547923773658617840413652334670886478642534527764384686644233622195785533611080662015114914895906691291274655564931656033595784731940229281135123213972033646500237004092534010977223735036323620312004359380345733537906591504629342353212841785290205754541307241826336598302589093542622098322035774459990565582663495094696135207619551290383164733381370032524804743350035314541960118391029265370985942528893836590610666767379831004573959848900117498664651822279255027188915358911317089725779909454349893426488036180100877579421833763269681794523391088867589238932298964772482620257931812939494951374659081169401474601900321695650950739309336244529927732575303980124458165583035744095784207724899278428997436313479993590312660311104362275623551442838824555741974863314444007262162383914582096160940681783574138492331165122910251599068966899699473082434926681465662959531693478074317956363578043047034784849695049512813246420708417\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 684,
        "task_id": 4238,
        "test_case_id": 11,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "17123852265180856751992651041519606335162063152417626985765610361928345888320362929100735052210956029417077172277636759674958967819841910236350544068773978664408489115881738439898506256967384881072737261241323360104864209864702272180229893848786595955485589846508533927765673780466176952031289948960616601579366326448216199590911431923092757512368217423957946849323135101984355485684076966344239375775482549233509981122354925714678360951986079548677667210211191020570161056554096723387894316262801857543999308670694532498137307553285169433066623478385259092694869547704876461706237269611270205228658417983441809114723633813942299134857992057943419012426622973721837180152469563207469770159096823540870958411721687974756498375432818023401967700695697130302986128088960971595419846024203024825262020647257512378102272662761017038459001342747150176714552614279944389595423634213626050008642909451216262723940265463817197801705801617066969507589281348851372035531868604354247705568478211837741371588592308424272454061547403275246068346357833536746711379498932232055209720395572804873855641741063052975270094643834920629401706032586741539530844467452337451273342583010413725720632666666469172470197191816676230056780317397826434759346027066040137436905841107015772766953378804684422569610426026506336678136111188095454064945727203205640559047192184977714300635994136957369522826777571336319430770045735688402589312046101396431448776336150278208446737081049035789047956915316438677330435733145984277784320424127810988747605975137937421776018458334194782528588092142499708326595412346527295502954669324208667821411438587917039243338450133015871577473926980339495554133054180354378066647423054955290097157793789439593244209860859763625936397419625859092063026372184571618573798663550367392657754470208353272817828771486827477704483238857266920089113492150430966661239003349679098125663416716674564620552559922626772899535459361157139269172543076710389833225152650232763136677066527148813319912940768953556275829096832566933052155176578464738580137271923429382321840721914102439280297094372705345485211861941728998146536299164389256420572983834911508031917865185297396215664292312150952252123814647591413063413096637292727864001707852127289344257522028052887929149738748758455475997794854023876622456424979686077467546153388292354569855806623734163094564740985831291571677853798029437154277888727434633586054066936370679122371703554385558704112816164885946346091048766066955711109135689039614352140457490577135076848897061709549967403869298867382470351649713741605667530392470375472043619432958672439907745467985563287364803407664877592903312860995298126928320699812321836817240647599326284787290788635864572609270661260420967816680392779549121325203518609146262207104213812156970101947678682094848152705138844719026265849957708327092562831311120538906267373505367147508496793859015032649498766909430926603055125544569384187401575241997587321328261730488391769472459914326421712520553977683925664225095934886771858868564878260168466635929828544401632315052787324240563417214536109045052158902910685147964415548638729597395177948805594825348230176118899872228804968966700224806863168973840873070608205784693443106072356042702876783258019687686454959157210099337913621597134377381295602331765992036735725768807967917653411294812533359620953698458268049848192767837151108785145383945667632593914470701130962847162465931208421196071648477583012131070014844997781295802164867003390186761499291983676908735113120366782217836247738371042695706734607541895118801344934759428771541813419005785292800376718823266579631639861680814993003644735229330711658622517908817861332188252689298670028515029986464987952822010602512655910183845571525105388128186750295237528711657942046959781182911984796555398750476181262187232358613448678294658565917017527845173276038304814894907663229313049986558944456213101996928544661438415842436153205237092895665135485178152727362536842377642236150711177531429999126695387202208364180198006432755457464164385486966083465202525912822488390684341108142030931505321474250118587200740475479075420768155037445377774807876750957704965551179475833043969684148266132482310565158885940633779006242895401618561622246965947883625986759272370530320116552545913693522343442228115303439976189536314650899145865443548808339323070298567331790029876281363886833848836112054300426000877134245139737507782163963110852200504165824645110151792100099154740818616368128203882718211023081366185054351889718963217369738161654584619941860659954818462549477375790399602100507988551961703831546402088281129890262764036760828510246073989363714442174397697649450215197315041492642124925619607419203375444694158098308842205370516278006049551565253728252233277011128478297347999894093587384983179119416145208635427111699682237178382964203891882559486770797004539219224285605798437829085105622320123601285564869973055274729947941830745444546556442324414168164489666413754913635293928096022313219069777630360287353039857301799916418744885941575013163039798988861584458555924507357990792530624174944453009750607924478217809427508930809336265902887140268192368166171938528927962375978302329184344561959396468920048246159873125791566509209911050042934420165151340171333335794801977163909114910075220865569249485380120916210697369430779231803231010731191852698479750252523529004507371846119951997616575511460832927547125052623160973313286786509199407848759098398674527818427817177464951021429454635772842433369341554531142035693826031853559697054693532608725325593181888438543353359463300693306617251951187848087891395406145143403642793688745979298928180228168228228444324484106055708689147219660064824642612776079907923213497120942810403033625129701040848597860853925900654821861015488250403501179846809033956918236513401308900739669273963229230507231037714196716771679886582208332580762432462761095164362955708855747540651571925653276044653328398254622644215597894074832242679930496407113947674605667496641283126984382255721401429483860144254987333249939076949080505939539069546066921624645543098489758322497193042914978525225563449867001769062289682707996683696124377359332815903099683551210781452791378528785344334565493326867047166732285367521385041739127978970029466850163225468115699680355166989977567058634894205137850770077086008596731772534732492987678115287474743376374361208679000283043920181265129333935898096259144408470326530359039255645943216685418825880726430987632757245017669281714895505908962659258885860870664693752132805756734505976783321226359744150209687362710042076646314376336829908799961572018064526886520229078175869994362475706894002459830277453562322551959407039184065569104253705959052492084988247531755054343592547679618187317685298462752667146361765709932058948992964339697700452322563303243003065051424867056856712483505982370596305810411844717774214715618263386495532695010820872343816916246670901688860460930312364957016907319554073480919844195105930879562912372604622423053825731710424506692260362483278911567778057022172255058236524570915249597306768849661779892989024322944343851745779051611130035011705470547374783610246993276303333664248844002142747604217343290828289337478144522619620588214044088684903341125710886305129289764010146816837309581638537096638723566739968108859235129767957281650661376835590175039944430202922111594322093623412705364724966106135668914907756234853890796133242514764017542951687329322369649925866841521145298787899337200658610484500261660472534801902948979742783710649676069738595207974335604114191703126953341208767305094842818365169575484116780226561094792688686065975178185216434112459270814487878212516672418657486156623923407592958066986936488416329250684265351564603800969380375858961485626414290683017389176954515079917750437462052398589830716836529422236751538258321620315411627837115100090337284288776028743011436305185929910214715503065020138281587650156807361386444134121859440447211512398700415126982111004983999563668164602332038877656101147886559715134630144755452459434609919741672889399166682663578319609366770628460191443312837620838338988569978594393832378272461182506949444444827031983062233342631876146576822974191184225122944422200173819986860858436051901564503563234750402265287578903540262286949545544392796702980409705054063207364596217205613816032794349791069085262016757974062275119101968147943150603049151490492991183660663745359984513538743821392175832491921569798353568420581823535339432928107806793070298476605745171779055780480379573241519560135327266165034027238230741752002337522722386905652043357647696206941207684595058703446933704030654166246012744660557561738065786618170269450065887056821128786177551977273759300645339031113878534842687105107426121779995173940925241853438686169792841510902273569089671345973828620367673161314521803784213658891223178098326829826097016528966863332859348741513921453496265946573139007685434148073499224813396871124389065953885084417732910719042772650414201981717382335047470533540484678030993252939902226850509102353602304696872553831894756168689995759785697951724582503781603355093539257071472629137547209325674504704097438377826327410623410947093724564608602400098794441278708537137966875900649310071778819616676802272544298827538531493083560194074833133941208882577585743289277324624496377305394537363275300408835761361390698465680949131262606764110091355531743814498282699699013787654653046484546135796181942359784649134928986974390552155263471317247074144419322070632955054876434615648716394762205901789934262281104456488812309028059870060378577356420008748843631459972546538335968871088908681117194471777676815321713207981108478567069070666729217394076420422206955747638105612987853032843500842948825640249292898838893974393867094531084180444027854450109830334457106740975393121429328122825213720348434028970116565964976159407776872598278694239217509626086646832675854400498324576747798127473310715705896387623703787839003452103791223010308695562434645617520696059190047871053172248997165018339481732807330799452477610293314833685057543729643096161147836213016518531810726924233274606322380733711201323877403612867045406386801177650528885084238371915524797494118718892633509702215974913651633652146335116190554683096743822539706734106296775407379385594610766963091069396975933076152425658538397825692510981488408917784002304263262238261739237004475817072720609449907045452881975687803627395347540297704206777622356736870220436109377976559649089576235233609200133853356655556729747716439179054879087044779707696341680352131221433848407405248956245842428080119228453525399799994654173763576080616880385018538219813733189564305372372783380036060627774567143378736513620610644627231704409527506744635543767369522579598025762021477385384143685898459818503349892441054005542522394732947146329103683730064056929247291657440173193501725488129257002055966466319135789892713669315017541934308932334163031529868888204402524506866278373215078359056391292492924761297799625290390998590316666071387314866358968878312803544170618477505885586202539569038801282423457161518592363290730563337492379346149593106569612886823862967766287980862381647209091548789694370152287540107763501212275570822279910693434520943917682707446555311452645891187771969231117866454323903374422736012364988750006598953498846456366820622936358959932458275224829303952190416152850999162338705368015320777150057623553701041935956517030789031829061019060284673227474252007122986914102366469313846600271816844948562727706613620206069982172859634681859557031799310638359060790552560964524729125872540379424324162598551127562806655674248847793287727856469973915392448148065322147944180836544123757804637374532422448466736115625251301918406345640256635492480416255356172671221133542147837463269143076535785624934556301265604564795923655823610049938219421850701254194017769497711419757433038502861793091514758483583209972435808454942924422482067738670518694567839474719412153310709582930622394070224012606648739356745813689647950693185738746257260560008887573679875037234917039888873522577998533814908378658574108945031829367443635347461277269141369721852489888913301531445933272143902478685904889679380970255532916913891518191649479595010885718917967748739362289792248652330066715351492864110678495678018513775673689626993911811803208050486975773210834456758586260296677824715957354579377771314060991609380599040087039737627453207515727731144040623584536077682469890952864769154885348168706958890204483268694528652497233104105683710961011506311519738122621709370650744989935121318214093836167081294049224978697469370179133588958647612116907411921332285319309855170991099696150524777814037847965984258367578863804496349844173996593404137278513735284473149895641661003580464592183543352860388477420285733511340349853518593032975314259313888802565879757058221905865753586660263957417964118199067049601328405737093231896978133128275059119192628025589853573815667464221793076300361284213003780182527506659458907597473926480249341286633853711339161155825582250468350702883413958284876983951294161136756323433723859960076144625077500345246161555136481372357607717275769271644370043861074394473111689641264347634904485633218260914302675596357964591564681947998694399340133758582992785742876499873100178311623328675504176833122189940339275226493124293764154652662811190430941555722332261184158676310344289424697468075951919391866362606607843142114599736692157914428530220672407856574882926910239479420149276366322931789312042099840343578417549165462098188329812779083113351720183558342683747869094909218480202799816207946973742300354736080759556464633160072073817015818902401183283079364875359767439478811099901532900184340567428262164643225435065103600657546713172361505965873522573766120458300951003808281075117405686285156989555149570262091580749830978259816977915531572891112157110734718265561115530300469673878706156981037922781159159174625164560171133798461792085541755892981499649573494687968181853304666454623590801672730598183509695745269402657695580752094232822782194619796814826519164582926068398336186135818206942358030987239580627283259533085943794740687735382951396042439476572168440288249933650957542587596194308365389379965974311234720580320206668497313338664055006753595799919308917411383878353623430554232090519734760863785563127093580541566601387170551746194496442000788809887114823411106084970748843906983463392907988594918882868769185300688694734178545158351325129194018355908008778313593171435018899524625810201829515705034482032416679443105613073975212406294478354091689399185170744760764180664625253927284375110438598935104045429383885417171279162679375994263656849114806981207095427900398971005473083323065657240072341080924292784001348353954122332803105981312001741698512474657172822270122342036052701793094758271086999602016755466554191155909722103684857124364493242614862720065939542576063283815382391468211421655764056352644486584745181557752009312354802688560114856328585645054608422065981363942744521340628999549311452299744864916400218349813447692880952332648419742226628175076377039859545454239591018369637371734240006649209650528241178620752423794246550775223910646079071993582822662068437998555609953943735938706542265081777281859093852016151845202894192978104382723030497768830504681293130012423346776717002223818198855367970550020838688222314155175110548403775524220237778452619208590356427575135613169292574562360708172192122005821191436925576842116741276341354652420756400787273041643920560433504173514191130331265626178739328490460296701280671434500816771910410833330851200855953647074860901590861973682190643323903153262924177337180942447012971200521265511512372234704917733251714162794786727785071977287787601888068874864952072078557574220045419384787859377790507786486405058838992241990514613739704294490984556272239249865273313487798872836818387394887524191596212295140942230016623194411377528202219961900344594092618347589621261889188021762776426161838448011885458626966783278921248715982404651895955447336469990677405350716654685649230650951901507053342346160077882668857408696097280745462395424108589930533720629775981625802477551060656350443609106488820550517834234069439652688361948610047411660592809054851819388066760617842872032735960632525058438877934116591380294869330471238111700752278049098245578148879745191573710703568367115042558765315484111911832065975941110533645150842800715193275274708926400603103263119314907510063980333521972361964749496442984503932705197363826792851191991185475886153560287085347531440629518653528068763518368002097589103600653617395479740118643062234002418921905636826055469444740778042909191705647945442258732445030981437411899786188824546040595075882525788804998580568018183083183491538331606343174102672751009648296847543799983581386068449400963252044309827448152371316393670808289018306576494647529235749184893134316153438362355320462075502409418859450374313548924567782676825584264976523073257957538287415766419574279033454724522183934723993017522116914568505087685861340256803970393379047804163719448070470448568614225080878110455234807145869278379429657533096850834356545121183152098188896479041306491498019124304328012661627852640517579004231813677921394311416625300885190594810178505294803154979554474892845366306935334960723734007042365831048809609226105598773158546803833807620738726827703474561219532611916116317673055407060114458584372053379743891682099807895097132099381011182642776490508708831067932668505071416826234321789772377436136464597414280169324713739066986478523430347502946820931838946259056328253149291045731063007542949231263755692352864290504993686136904515997622416202609009901070447751378094634779779608951353819631163236672016333622475162189995902511635713674994365527501704472809077071930992197624320050350192400755483134129592260372082149135046961083142756175296525324117332956942633054775911239478121601937038737941199365773174142721556729356667075109972861360134756304799534135003010145478035829808755416045269134779699789059984399327494652894334556483488986819012270971855689767783771171168071020878653453758230626756515326026866609334165929920719483729278303880929598555652080647485144436736794011189803634575552006307482043702975938146881858843851600563623915028780909646882906831791697702150843318358335186093748170842824404104140347531119327115472341728743505517105233486682582560047637630872231306468571600017927675206094960890654542960524653369754486958193510251820302640780457136013345289564802482603431548195071230642331638853812911913162750412931115316876952247909507629537458173929568705421035520611525525078008581253520639658626534610051079777839168666218374256366057081959967717259187577000774352140879209684419241767853024141516448382238081989849770687093774811503948377753823772352462160482075858760984891759093910906182635711443488829582960459042928963823701146017102162516616579215644737167905190580824430395457998532322798270037604734645429572714743906813685015606991712551438680715676816010892149965909485331570804245745408262158744302138144358465342991912375976090841261872469736842855900695316670500860693166588799829592055797177683303065475420036881490778512165570681589058892492431434557636145619107778411430691268684585631840141583901923800566310506437521360342006280706116254774027056905990940482618131859101521914394280305179437327986163401158742299854845560636107398524697200303112621497823334979574571291749111850664668506105540878381864645757911480604683583093012244249377130490089426141474509599760193272894444971248398590376739257282711335203197680666536210350683069154143260581348880166468214324051085029844387978890909847803988142240190885953621747387555642848930291394144438272151570548732890639420502884611646852625537684824804281478470139200763330708298933520576630247147771391893617999684817523560972378894655385000357836579943112824624941900029779204698051730123917759724989460180761118759339673635025177621328636833306722244530267465595580153093948305774098634103917775072060345009133783113829125965471983056591468745644400626441961836943432629121044279375979900913095969448034308937171725125950451956907283812400414705344180391352422244753823947395136044411363866580705537360786177103666175397373866325061049447245069227739418696482926443472346434437476754865487992507387680703981912158546738988625507286280944141289803350362438015883761367484658011837484537849659936067100087803335380994253085530624355563053174671171947840267813992613259695967462201069976705054064245081566913698192599269551869400275390560479817779469680901544624748877360645368520049579467904933987805982248793400637531136534566296393549859078758309052112486556476017592967531340674573557495620592805960874721080780670426870797082708659850741318406988098656449953169307931222370677640728478285447218674927102487207246026250604804500662132955435458654572423670422620940301496220491169188050532124444490200976371240685439175534187961562389106711750974344082500051397807511136246142510401474870742577970327755507971695442895641937512167656088468639572864345750639605277921738377502829288729923018602105880028620099441889177607947042193758186268958782001913906166934394888389622464586025049941399877786873843482798874592067514118640958698057363860475508436346811066116077622941069929884147838937969448557385738524460035356537265509027788135864116621191144225215464689824565972718425951148699295814614233776032186379664633280620265574432824090672180078704420807089607530880860183838645092059028278521937841087353840459838305711859545204291482142600818847562358275248996143600612483355288332582205693510711529862732478548438132127601834393159670146658600963914070849169592363672533353046325497530265574484697636129972094236624337412946986700629194624650873103382249270953893357976797637520572004135802430417798148263035204351631435860906233812953907987869599496657581615678943370768008536168006100491194590042427867706924352420359223264986500171202452824618979076594069305809943498625901765168816044882445113037807656385631989465715848553043673704680686212630659676100646975191511962950718692363682537340054487271144358956440968049915857267788879275271688958224957202738527483637333423550448101006682754944122268927843913461448966291820375512251515710451093797198336978753091576812350201231059336027839631256711179741062760704700038758790608918704632799518110480219115119806606790424290107937836241704330430444592481098722539913475313471268034425647690664483621346120251167723168395502411606732117288461519141560607933216610160959144364600086674894393097310937321724749548442117558086957768722038980139328562488817363184926731933927212650630302976624672311095256428345605756404043693080413528405580061120647724749209133752730107325703181476065887404022706031083362837185009592315518141538720758561264511877432212806130831300703866082628268493989104657347039562014658519901856745580329487643909792764559405460528585436105776377388396862434157461919153164056740331056628652888953993326658414197454144667497497800350445923468777432916072148304592785951488974792819711405910935104644574082100754469950291137425715420951293278533956186324908888499941620073361991554654354536383383657155535927142586550719316130252904660441015670925030667970665420771761498872412643673604731576286683674027737068271804275271190511053890097911313909944334459822356390126918569578886482526077508641622082073579591786600840739147081570872990268906189210083775263233807078220491301488280590391328849479421719058593779247299851392740138047089559232098642744490333993857319536614742776861399022466531531676617001843356033296014106437612797474650398372724490660139423945051002300699186636984816352835499019429678565871641500700890686134984876268444861126597978066781265132684125819047414857738640871658894661067737670045788266592130658923283657848152002520801554001222384353513387580677116245134646535115192790022023228653510238910501827547641528723908717175437836607055670603291215103428194193994260851303415837508301258961708294853114336437233096654157441903015703465619762718611277818480417120335622602816709128905019753500270801125626421664548740160370451530798997568370954158181730167778468203037097161495976900363940102334836379712803498901295491702835029122808873481783561499056203904767386999216793475159393279937797073326722398625037514556070223818364061350301334406870293647489465942073707593454281824059113480665162975301003842033518637249399802024509270690091617491270402543012561073281076738632075029837726634083810706366061051402362140436111027949247675216508959542307525096404129780064809153028898947890879361055653988348876941278112347553208143768605810958251548173270500836108150188777969160174670258362661670277000865822173874150140637021708760086190886619480468512504474453130636300349079543862887202510823721573064588214804507513110482063059638908913756686943962383711685791501594042328029043440928940455384427883732246899135450159557033755165791124658865791126812719153847764571203648880548162570919191929134091\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 685,
        "task_id": 4238,
        "test_case_id": 12,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "33813819154164361588118768953262516554574111032083043031384286303065210509562262038973079975476396016546146039303789823110933080134565927492314604458575884820133400398416950126075966048913496870281342656762187821939147033106717650124502612019109078419691362651717290499399798948652832533487239630898917216407556594136456063243644622914327050214451441835135178175666600550863478876770272687715548446182481404116358337097693043743153328387932319266306356838572755661525866420694331228679417463036031737610611673682746027381599672297434931924913503694085394472672220564578274632215285368300425342734090212830431896253812310321387609613806393502952570651089637200097747654413696898507047562762896720647972410465745603961890390746310149654133567847479720732853124756229928883364129518996395162502628407349156804931599985264492748551785058255510995367021655414803620823010792324224625106028688699041416740137826630438466481508455562402694430466507881805785616682271354211568932957528757364606335035329044965940175448543383622035084627512822818437682297744161940304917692724489274262161263682419390283605612420878939777486909002523050549827149028329546761908844536705462298479144081873006224251053044924250414974411548765678732516130754061819775173206770924088851329088016018109554919758372819086951990806330628757698839020385550465194502419624765863953304568012971787675640193500328981055610350644428039282199010047500430047672656739929932945653618271945549698903375590180034427900961804338966089172205756573295335548089323432604127404612709406340143404067450435157147383937075622490374405773530671919403358897316565730751147469732539272490909570327676371056958392115507721657684657356373159247294843106977697836760409570832320536644785592980080645552334695147805291006632204486879370216656939530479221694836627636667178859497575740218842881612229539474944790561194171348493780632949448896620784505859599865981187408370032155761013789134557275932957110312692358485725986592475048946597708196120211344967352013694467355369973182845628615629021776479607507179357467990086194384777722216017349902720004925793776871870066924988756658549174620553097830070387389931254416671512165566036935844296095210614823640024878640344537991500241396303601823144511783211908992042238271742323655181563264483106609350038176765958328601905100879025918868884051440685474292392159707760832902528238527277397939198298128442221890589649534285272331935587656019089029425689813921968906332647388218527579427123836090113893349274681795176544252979085033666579146220977465627165793648327780256397533696436044372797359129612134216287748107084800918610601042530997317363451460925498733063883470297541721698796115137248778572989479365136949460897922897284799765226306928620702437235966080607807631774140738582750019246502813187145322929044147226964555455420727642730365713535874493351384195052317401061847190365109637662625958354738000720348534532841382704314831756109126058953195277417552825819977445335196586239589700011684255130488656700250644371209743158176990483775288534142680214653795723250157904296388998485719242081245581036527309854844621875310455406959185579166443196035516336396054897332398263301322876849186784354478721787298218003506253883636684261532140911501527643544514429644161898459443253538048024208660828121827090077901849009261420530820143935029136959245085335896000571105546259761100049210979004841545726400843546762219392998428232392723155092901373815454682998996245923017118753057136081786237731166265567236163724564594139730493381743677925545323139818523725971113819245367250934172232615889489786466319724178049242223929428673808805356123608464782081891615626225015670032146045669452293080963058954559099430104011165140697682215537852858549934894242811034225406495302800643291306985222446670662704950694505673828075917498478730245754562823830292702149075370791783058434285705642217503966525876714713413029074060827965938781388579475705152900121666842948072351577669483028404079142696255941879591617230148545829569219407035555579715421737363462380788652004252448531711380009845138921982609527230737671716570100960459659066121280728845672931577944372625345739581596082494739046302561251635452541765925284069846248731414491364683785456980818166397995104857303009626878070498396468987256653108221050205419539367355990475895260497601525514010139110340979057278726347960001377327777751018482316483870918607195157459064138184965100268337376440970071472430863944918194035724676079166875041688197992144945097830425364470051836584463297165601264396404318915642548719652096003537317835782911482899334596515451591964917100745691578039539339243966613744724333151087997593973695084763804135615364471282066376169831493301278676833052839028013189257785593781145055171511388018871960127471395941407416406643917153855520605019003312984684520183075879505696115911334999103261230517569564964232250008479005299488591257177966572342688154703715342582384193942587495494423656845861377696956783023792306143231133739964275327572552401399051698950279050907528380814324482889835061032712005280012509222339771492545757645958522348956917710710548924969060251437799229942679211993574669618799476472893757636569629037775815855319331462270673418115790829418688089220275835683685708913946555858995673420080060825760766119869012303047724356258406160757872401889110220817807074186656415730025908057826796667858341333780375183455175261515749539472890429454533917338455942120538440626248936002226388968842395840366368200136678866197272850552528842861425189789926990795732757100100622974546720635156896806437355922858656689806804557458400678973669350323019980882390605650867677575450858110659618420255416340233127242811776001742363851697618479666913682062730325995283281727509198754382190842598485673989693107507289585797429967012307620492611271958289067515176668965218157308758668149092944498634154641719225555517438887926040753747509085330681049815969386941722445613209714011929079159741070801851538018893626274009261445398520788393604014873830589922118286803259998798370872481009711209217405478976694085728929253841220294967874761326805815961901893107468058141328879642321259802252605071726746938163765585704232825937131320276921737275810278545733819073208673746512645786100128313083208139374088693064001411139303593961924519809398864833974013375041058566882461331488572351744699324471861046908300086769605256913026665267505430028054264998220410543153950073879267801989872706520884773376191354779156626191971810350026865198861338290768104448854765606562667140103878115586988285728161831655949587537729136479163752546815203311263428489299402476302935499929770063022975548205697749576613337005488626207730330432408019080054697411030752189166536355452118512501518104509602212440394254362642161625696901366076534024057938446389254196845808606000626909690598461176205722679439454555866736033150457940104788623299647953889238691655355419118874760312111353913267976460944085601951799662294495800793069041877688152087453044868752480591701168864369288619009950997063917098231632603586047696161938691358440536540424880150828713186914023433504187657160052380783381972410676130701604939993658317868837248052728551967809077694485563202287650746992006726615858179570744677644492164534832067343380256362316355443214013811974744821065798664049596536609871151403979885289986734228698446809362304222561474361423991933474110557048865981482527745322298524245111708723272611498956637975131880605490883238440071463968967941673342358509487216210040728035110160120030202948730111852540149686333846593784393283857558227810845226822436871796826930715605962481137831194022964039120259137901112318124012591458534333120124614651496846942518879486025592399465265285759814171549581916664425643895276042496328837105707254331305263720239227559134917443378661807290911407910368628376495020831700609573266354013327889492303207903053147523301221744474152906795896218608378278986458784529230451620554528309399382668191533179420411002972012909758749083517012360857615487863343357115293567318303595094671967722200413061055901182865843498823735146906798497867561556517246027123559570322868564498403656144204761374235240609139425084863805322099491352927725378044260691901214807643069940745282116545702223970885376213494750624653726505850784116981009070140351391694421244241956558340738526067604837885470857393214947816036936339649485570375649978875896872911491354954401671053642905894090821312622934446114849810856117937702201016281986719841075017828322450175805750328550267279620588330188854596179011625443134430004527985745199107962428412215917119095757699973373854806784985718599505870476996815805521004168306182956718285149024055678738037974957375989878830931945861171677096242651285877690653541243627213443552282758482093713508593461881176334056805482201500109399176974111001679216239931785588674066941988600076722396758233065388402171792470679801091450120294776591298547915415261956363165008082915775890188812492407109290974661845336115739939648594588266236556198776503966482837912928867737877799926292187291203494042961920646317173559749858535995709328718322904003576854319521881819871055182697408729700882123132286388786801063391366868068326618742111060257957505422791363064996417388746706774371199724237451474207479088780640136956020154628845245152841521333987296383703653080028406219204532350148348523301385710149392289549348290103305812203542359885395915453450212163200092095046510942078416460892483525988052864326850729708926733711651234346438998608448065832228891993011174449095220322050439218670575877368361382674582064395888307640736486350595724656958035300239531896629559076976635969719268096748530341131094437285636650167433838986578303939502120265179766912248674845226462233468345654944901076017866190958707640758057129205518402606583307986228530473270372927708670702208704317340505540896645833825923875725888349592291778014702927243435618859405641142165744530889165216515500587430368003958608237085056402578071134386506904952985898599424436631650256938852325031111463872541211667178883591334337827421024547382356830664040310119436577932715162857932879401328409130740929478699933844969250905389745034818048632030442159498640130839301070572229134915160728176645786803488147866145742794527719401165196893925773764622823888897496410120143990636548208294131316613041469405433053856311847192764637882881691053480568972306816957852296106998998481047675643667057425519073413152464723826151366230943725727712236509894596255359666065157701456545978695742515290731677339567236139386924645083429017800331869177979801150434748106349487050393594773766767622199300617577473400229367810303312020047346307317204463889645007578568690496052799872509103076561739058605883385449727095486899660029005249733040137964409450796444303377022983700684273225651977830046153162670519183796957983979374045497321731232708676383267937901414658342921411654102103768975225081358005198541664080264403955860391265710160706736434575533941581925535919777487584495554818755551881972891601332122935561314963296192097053196584608638336400486839264440300263418079142423800178380269821959809242018296670314524428299780010554173553833760125692688467947485809429477292764000178161648121193283777266877313244778679312085252760654974975924245074251761795877228387185850034845278329922242841543327738058375082562815790643748337645292622755087304588879148425014614815663212975762340993297380010014291091930700697217968637446708670799940249116855460769732719678776333748639649119989846719934911982390448941837086221683603141969382918052641308072083775164601407726645922548268966374545099507618962774819154356336925044418481873842676172145374774141293417224217063744905350938463440945783757654758251772946439454258934257042873068144327605382939302619118180120880288455228645552643051775901923148371396108894071789581297109537617239723202795119108795187001549170166047423438312588967251587156896258275101166416491282440919290966382221965286606876096651407493305791920115948181646937621538064853195916059416309215777305861879617885342294142106345180964329282498029989299771722241470062165462164372530405671275889577368241672952583680060175270733627033538039998304556509575973118224911666444887625543087824910995389725437313446948602109536464321172992381903193259164130637813481509456146413268763214447202365818709370645271394404912335727014044046320695129369049326063007850041935795793647894757901178767519322371978603885088913786728010015852314668606451456317767165610097812635004857150542536969197751060908134935357446401816449558118416852423518194401406230372261063907060404298169857938299262274811152208501109331632639906057526388279788098811353433484532851639283459743309637619041959642450692587625489476961617363768535105596149967177617916020386650810461370111706810059824090767757480212494649684246378367539665242472087494806745515401970364449323882482342186155324789170299824575249570774073877087142797048135081111683119986767383164804909167849746640505743243341341464644379721159935542810047202203169871864872571388773563008625368884422860153286269807408504396411915481875433487587764158370609412748678675818632522264256318572024972567081893921824853786264664656788086237770367049665850155645342864093521929244699251106470520174381630173456646079588613817034738262713334403445028542689916858079914054422096254374844197965829204425033336727680468673069796243770472082067619155812888097987003251279368295109824214341987791321193731753163919789138263599401076657557113131138788596045261832230283903794135292495609221491351944019314267245574959031050075736171823464013111238088560112324835285185764851816065693630523078874888104784160414875383393164125923976355901832003745964641352427683334226449474010931932441982578931973534224814316334117530642714937640225494359417474519473689165301532845857639817433927536589048439426232365619521068222431081959305659719281474793288165158266253304304143431087099671031843213995613527886757256183360840266756869458833068076107654188284325125227128789812203973691489588775625845841695808807884526177835398907073659182676633348867521840207674750910333824252762372671359902708606368706798705472700271298707266784741413730075375279403389237045068800872550510643197194723520902496678095047038175272591257143358567456944877016499255202514403621163512238119451734399556400364151262580541640347623417942047984553019881942977578919742962142331463726681828156117761177381555292362237082783936685574777392832110498805541168424675470261751001829130063600292972993167113088086272585664749236896527628035216375720733061387869405688916985568705920034407156189165061291613219870291779656932944179427481100120325470994839164806130100272355009554284334658533558321670780397336309219777399168762963528636103420808712499300835546427860594687164382773997755618839264480591983914751565139870542221626794413328512416170947160980035066681961999013820656185011709185303016261460236690246150058025418587462947454339942854927048295911791535343785459512007476975353688698389727518039941598533795533721061223248515103029233649776983958198209247250308654134903267348089965374252829069826037074319080350080962670261512335969320628369996075098347625769589701140837522329884778990656182766631384529938843328257203281983817461077577227821830709474002497530738513981133013918180373481743320827963206519050715848900079602306859508724403469788829899585423470171512385845040491128341997121878988515979355286620147430998788176412310777612110304950912550277588711403499440924533547724537598143838199519042243139073107803740816707013011716356995018229046566320878822206116411910724727690102992121019118162880534961035186254233894826083578546435113580795307876850903465845428938100269853691766995827692124353863461333906789072631931876402326347718445545588211747880829213127599564778994818785089231924440862130163344296754256191684603238971082849999771044922255085144351955328431060778631732364129921860146968692562794955229967901871953573074069613316247930210527940779160566869731247505377717964292269993374994930423887505445456708311111279446927243939997101845481984322303783511467030933055089346178297470012332542563206299217257750102048917974486241829581209062931839242276130368483071339621442843304280387819080502098538823227668144803391723657248462498785161893144898558354517265628248418407331748440059264605146009093903278591474516965440991708481387109549874397488053050155543699239786672321617380467756778163353710927739384605282975601312126511030919413456979407349920828848898688047935004852064270542119539007407837387682046626267103075814030511143042135026941776885879638441664477377923030281060549811207138470178213288554761199637558678125785993448196467303028861232432111449782064033853450785198836451334806930087301035604037479954284362160031582754370375089646449186851272548421351330110306274184667757930907685380013961576710560436634322987551062648205292426467121585481675866254486836834036993064663815881850787901532414984411709038113470721418421301155391131376140717074965184448689196807335824796666398418758175792341958139226560094477083362154976028223491539948463427675816009191374744421628168409050247577936807023428192575093127082079351323546330882600621690194131598292010609698774211913187768020365421908623771282149167942386328728657656688857232565732683912992962474336356596891764924327171821403640559317049396171792707677378294971920326028993375325715892212222745580728261534037907713284640132028674736001084613621807738163073090591583258060112173599173104001054741010967234096591483591921991673771410578534772282764833032162079925153971836314581654146394201547306844207439827569711814025369570191148304323207544900015628176186150334318232281813379993758790894933392521920763602561858606586203074303637003885258213010741800873678761118447172119432647332756482777656416884737148881674968659220773286908452550050592444574671494483225271634927687034114678362540456365987158096777589161988008835801256879694335895493727599804830367559853754128446009960672168722534594841463912426382012236038167744886704184711078165439508021906725176102259460467028978149785876817268528086094188711230168708499652946527693733700065379729915051570917226476015950876098129573033807457016791682873011055600629849732023399106419322326350997914101286882360475273206516052279051308674240154668323625442752680454730819095908487874583093104184493890893977851859320773057575519564639192223026006424332720803460391996791903898708150256446869609745648768905047792333199002589483064520540253930771153618801731807625369716809829605487942628919285551292087467387415872392252505827252131092953645749964902741045327289273288597316387235450276059980660463823875549678615556289359506842461818322879426256805462301942108105470065491551597177769967971576526450078968698384056390747361652888059674986120984104591198405642537744561194764559221522530754887253065759748029698913673577810027006366763890942925408232544861165024609761810373531853781449751849115369853879218843543298104182739823127245029272970686991774064576638963545020871103613548666098957832281462409238806893178549269602951766390501905984353300366692753514907175719948326708044990970859935443060366390728996706405720189447918267926268534497004603253648664360452705016899271018073755754639474790519223709100509709157446875391396496571761141729843118651319139429326956018591872626214080462936902253526184905965127169829438181306259903943962946823623517734632799351044037689458531226066420335167155263501481701376381329000259914206748977999117984906433874047088317983839198552816191518398200368712431288205965238257615601634568605411966720363455451929724423874293438533804390897678945418148394203830048452422092218587557422698828162197425493884336211934525749775579573282974720930589612052388234144208947843380795306576757758751377544242743638837077662750005086509198831129311779424672292496092364658411770409508260168478305926334960101743416459627497838287291450057809229689056737415704009884033400870369247374573843175212043184916244542348236044902255278466656399226962063485124867931240915194942399366602256111708512770874974560648234451053340002230615251930915926600638710934144901739972710675322246008560864840020353108413845548815173616420899270437086825486881579111869528772011939052328111387464159241521725908318353373693774329550176818401749673024585254221184646466327799423846334383749480441228590736838349479634595259306138893002788268261500971872302561498083848775642621050046782090030146327704678150619467061332583024539411710387813768402742259740250508860897512229610475491433001391728709461204337363914237159446688803167850066986272962666934622879991981238486416939245059288207377395668256643102968653659235425553048296274814562100281910290220626779595263210082854659851753466696963389297770693685385165649172018969486010263119117469877576498824668241668857421316591740547139474802197550301840892961488920983696443274847110527557016805785251303080008191642188093662418403810413342557211874386738026293859219989410161773014692313588785192802526847360007911823842150188047126024301366129263794394612669988504415647796427984790889705407744874097172083754669906312557354244916743220429122199601162578502149937079374673972680428444897943571757057603960900486954188086171786973172311670940157143520912094033781092929983922285022111534819961264116809887613536101307436526293688020825363086505995205095476589672557191926414173083506429383306306915908608915538063330732450690494749173261077818489198004085272494172430243606727761327981633111149351033234035463855132847944426787063641674685904629347772127160235455515250488235237353206507428081040517352249127014704592850782428668220958404342646366706959423820268565379612298567144967690683763600060828155661723706226882311026159607488858703678877402672913065747034461517192779086317894380580149807652867057615712670685982358576375745306778684910397780403581969373584380385966670993525500530589218861359615018660235229446905939288823342888153514690564121555179535606470900865765484326121545887848443882364690101121327355971316446048311556097368020440020843782458227074966615294580576110960682185515283087023874847525023933683024188685364512593155943737699400373890643599986187331825967055688147449500324137937985865829939754560724161064722867865402198704861355544128668264854252358481333632915219066027610995158772778659067870276044216777970798702374879608047624541943709121553911092021673304026152924148201531871009419436808494009514686406779014553082193107439870013261968348813014695647615694873950505071341590501731861520268121348399461427202511461690920518150620979550387743538734505626498546738857708617714586633724320022063269985293150083565374631736951343355264025384791697272465300099778499072087938328117937143961843448660331800380955977721148958109347415014713935135287049861541167289531166625204410138087151942519190547098459412533148984357370827533715360658360452270601096912624478121630040684135973555831498927731082799320395224971906964039480771598278268067119533339332004328657844485462604527965775275422255630498490358962815053976326908307769325618114805998965751876064596993407740986255991636546372267466166193550157713726786044026981517024887159572228334918011742522311426402238689212386907507167340306707753491420274345242759122783012921028198771580351521858815435445181532627582248728444104833295548386205970179150323437756450929732942008352512226712093138688611036159981828553820097346753489401406691529520460003709791410928639501879804460340156741786400694488585500105147847458682451061031697397572951182570314142484997971234681727410848220707263975135290110968131262584512442069510714143100196556251215412640497222770772992963262375885922222750532467187174772773488510824069573574445467349362196198147247655439079267959483942773905430779390877056915163741658169857142829155518836602655804997860518251068148332791013490378128687869278663501569750075113710453316116079903877322471367181228168441799264025431873738684813912102335071241955177906380094336177450454991563009596975052091904931230772296861997989334639310970708803996169252996952464900144409712771084776238384821100338737072375060389518869682600068929847565844815984169662631744442296375462829860742291420119917380646034650383361719375207031280688745602113601928805864569261187678793301901662387262483279122518082882643696673146441739059405664099357880310805557525646769533754861289879590838604450025324375671958739776969025434171932631833309364775925246049833029217192528593674745850870292463909973705115528030433361641973962721147370167091021418480386231563444505956586251439932399429264487085427739139259105850995321213279900702204568832131115416125708356313283094287201934864986362052905186269719338641793816932098126546429543589065318157241155144767076696844002511096247730404554470830365501743666369680694061588740547783855635459821930759246188628859831129004219158710177767756133833990706756298371889099438326835094228892130536162785423467448776521752172293845398878592641561789552995617474737560224031396890692283406986634711269977206302178582103676757006902646176978795049329100040167363428133039921256097593011239125840160266549195012871451560783911421614905634606156424380504870290631659768394149566930442641658631574639412812044718645416209573384550389563134675266393347674256513996387283426146476184173926418519161069580068079747730545854941001547397528656743530614147590023276235268615415601327490635288450768573794943182435584723380048439330733751859687238391866660136152524804697748220896614065050552150746211990629941866009346076408814506745285601465970791698298224506740619329770140304753188451022145886993980595747048253785057863326504036905861948800728385396298302844692094325817080218162829804467804262723785082107848733838407420553465188502763942200124651234547232314815695782234735497244924656469656683384603692938538548384973839141958414992388052079245689040000463512097596118458464194199520586667917135511648749067827128235205476569873765240780078379739013429912304508330681697214508602535981453379425906880303177656937612211907295426213349927217913541332828094487168975020522966807116629588559917779501567343884044661824638525841363229608645030655317923545511690854974798861793522497512649072473776589192594705305303572229842931322300446712871189553929758442992067851621193151333034007762436690797342632734818520808283346956364464840972140979863249473220832768427469747277056283554889823230957563070887536410995500198350296040410461195730128758385790693248663202018265280233360564901996411637314871449638431161460377329352975667271828599898446716027043908620431666528911163577710672101529916026252880165307532640455457519689749376491503525895865887950403587980758788030057740003681026725795974586430424524123306132170495166557017062560589823312075652077164242720214113148258576398314125663421851628480193753089219715568527969744923768577485906480788288198337435838759224353156485374486138563719712027747982215022574824448631829071676013954371038304742581842577267212934596790472902878123878005240190298990875953109238273763645661041835169948109576621049581595113503922552760557834521226969139552342278667667688362971701464612681823921673006965974294357465118385628549578433101608315630417024146202926892083248072959975105949287118329011151402826451597911887276436313511008684990739277385256707262441162856738511540279582348904102850695184488611448293131106356726917613286389217785003755525535790921510457059435929082750541617859463369353584911020057085007802099319320550668567134370508200587368792318271361117716259574399440897977173911632930980435961048721550786645566358753807864602818458466011956241883784980390938267439380254906841086155951549481755888495574312624705260646429981811721983040548420074656899862817029138372003167117740753471880887382856663303880798770567422008638551147271868885042055401487054047870986699927815117733193069692147494591861259390282666287126256867637950301964882669203248398660705231894797550523043523726480555139322835481804022771712245293141567264427309784843011120660848479769691057293471651015028034376995981193010909174152472106977057620369841671961683826982303162143197849855157169145273253662367938710819805861451770714092255180413094026179643993899606405984998675204179942669854246972242803611553232480554096836805875191493048185252197519073267128238502360813442873073152644543934630882491297941487757901712443377003901939626435849566625455049971140271194806400708563118522449234698940387032568535146732332648185886261532524064636817308793683156749255707930539314984857749932612925824933105334570579484623881646073382598077529952511879830516947427735039279135336753119187597308520698050938948395694793139963703010717174469683512300505197136379124568411919492220266343227023789203544400962507733925776064473640262353569326557216356501548080541606201642674051198815448008767212519157336068531949200594613054445462380481737411965005058711709293715793374011495822815825673968402321971546787535208869769728966139589499335383111239681048096447976255891960530144931682126179308358992861035954465552321372475120370415543493647651325416906421297368889280141997116002904059289211869320699742337264249737238093153853963628728151628081174658270132370240590183308897992219531533240538335532594547196321197335035017824159119365030975212178493510749804631059426839912896129086032605813772413149795392551425146558495966383833574575428879582389951890204700829815564570549934724721097858304442432903536175345020972175027662905294908800491501276080757208177956290925644570756513584096369707747157402917592574229267519038306256266042348658605366919562417178134880941771010873720050870471961732034126027425695642872394863450036349028789513368909995943916822386951555679821961340351968015217167581700657998735932124830988955247237605214555029029247598739117979842092495250347612601611806819502693032609753353976174176058341519182420800445320382732725291706409538753230267326944593783179028078459661512850216497522733944879962989691498006657648331983699115186383703537965833004055235781714071166488956040200398430468008104304544876268510942531050458404557012254612902220429273763965163132902544359302141732328400382317390068666015317506153170583666038937223780150911184337870367164686658268656097358199297032975739893403383754247823403766669514275382104671939080841481173422612358105984205187359119154592928036428744827267529267395588680951180249963110301160827967333956283283969344660281654194770385542797796326654092733329651642371775894051912667919067319609173045107877646484386767269605887418351255039339709156255689712601255204140640565064947984185679106490410776739106510267361079991959199510443065150269892007338170982065678505049145839673263804563166253219965925616349088946227980915350982615040028685554721782252113130111306026085794790748456147193616098215740377465071586278722552305303126563624873748122174464491664326405779180539985966555820138604213064811344434418722846563187387175156461035394861824662932124900543263496864688807623541508300644304938787353117418414523472353246915411140601816518792131870257562648575515814539228215918237334258600906256476176246820465669906356873982588785102525882991559725590061759251795778022244421351759548041811664756320731705523474153224833834059032717554003477755542540081951874653400696728288295210016004103960937097466054576757589318166482814066604974145924175802837915502802276314695013420512252934901938256304898130184120965518553320077067856059141538043190167914962910672270693216141814051481543398919748925710731515951863706484373721611046179745834839692516840995138272378117631006478391267315182388350303877056853746773949535640917679105120046083045156082973442331766642022166397193633958206918908301079045635447981421740442276234991498278719838872225073586522666779396089474432423963034561607750134624308194290496598124491081432425413436821902398210052357774025182099799978945843123874664487338177449055133491541127185900912042744340649746326320787480581082991959070070681230440709141467767908516986444553858587236838007912211649159358653607663870474771447525283364896120098464804818200486850643383908595274446348792353238905133820529268551538754837097475089732841666030993473554622277795401924483455677738880970899206499351347410154990232052078115981890765834215456722774534239272441174777476381369131892895345781930560237287651074056569982481729029270757985001395173804455572363852178683072258069981158367690744369408631907681539674768596085124490569950327568947704281401704738158129375632178219191417380610582929712251201947319540355118871575304383170516248554743127236007439375075380333287484415161150193769288446575919450636581924008717387647567246699448021464733329579273835503523774089959095486999152084836520644034644007200287934575666645950144662697889940857857379569307304106828241028398845460485429002454556366112056954287574834612814263275103761846999192161901276346935939030689804041874893214512137086524129740052861992294966989032693339476609157138401150273498012555444379372041495691544951810916565528628983082978241814594975011860129033887026959000201611844640614799031052425745685279632045473182854032271075523961353550634749213497021981400280474865153518871345213658237255322884979918939905396696678441869421386746802756128230047312176293676412269922925979179892069793423629149211802463079883083994517702528685279487410606972846141417326473877253310790459477651029748514771146716095499095279445853243216232104107303409738284154432499087705807139840905097081271658383948776993096599906297075726305584325858036194614581078684721941642170295442558819940573366176780496238260916779977388502277772464206189351698974002923693002032400129709225231581151327432012195597306393111535665765050712407597415257315380355862791759839477396361109146549493591002013200912436686918660137590441064727398780370083778508543991227191548453331677425131442554306394374407636319963071996141903137884477321369291157492024401976709936507454103362345190122558782117178490921133899482377327203177591087281174537859096875086310907672070034612279727200266269358058731371620749331433836344432048634679209336404097574897714027073043954724655782252551207174583362464576917434868321469934246154754547641810091591155609916481453302139033965213214480742852189207299028524741690980406638719677546330365194616713124411108454201824640375502167279338105315414305730718743113183637266280962780485661533654235942620059044465960493864858980296444983724818821479012342458309256067814078494604502785465733202496466689943613368532009289052515720455650790091990360472959315364456431482105527689937291935195008251817834406671007163853699985277900457647226060951271371367277968807696176472906694648331886953478707191091372738185824247986964147190431238886749206160070681260652482250291694051768182750659483576114828952232171482158500239887691508404308240175963579443169748679247380548682023126695794036596404911251220188738355316168022013623475318376356099290546257916063023811094944328207437815844812964371278487953277683815411747739315095390772828204311928418523309700134402165822150693377897820718565400380785137766335944671058232184870193566306331227562055731735867119783051476694666146931830332151892983460880868271218539155367256783528653563838640822161055083903381327107422142134312897724597854504885524501295670029422501879980664056979894867343087718806799914445343944744025938526791290666849219071310630220280747052279093544736541375158833419381514092266448583441590965212063505141439040906745092430080681754052812103664324034781355222351629330626927790958939796333667606533553789563062254716452130233647992755620306740916943312781116178809827994107370234748066003899462082594807652087907929520870988947641593384812454011590178358858039948170310035206890308571474264009481602857909424645724626454571866564751249179682631151470533013194461500304270838695506423138618993397491426042167872280157894152219942023133787186389632786505017177369460417641330086724084753166651020018254679851444058655562126193275920752958259474522545891615768517603907419957920434354464764567902572815109194705637063505402657175137737113130749125677448343589787521536837570108621120894029761382625853992484762751486126597325496821577502108739157304798995828872255793470614306883898100845087857752092051348985204898885602657720311868046197966127834148338112072200453608724361842320900346641456184544628025829920581890414655055269189164977534066358893383573764765715047735302890743939154331561065685513767649411416131929903633465592541438652825663452377606388959261577846265619272922677057573489833585519200171779923402950127995159439952334453434945463317626601475452633586098711745075638396927200896608103699233580761539240146716303670898045201143417515740722056788314861028102450338349971136199890208827905723971799080711479600389442627461838712147126761861363062802484469126060167532952979039315099774824880755347968274102559964127696281200218210914557485803912343956933967834644080978093720760424788415397250661174970589607061874182742585773909533798005235680313342305676599016318822602519482569101117893477898633750701633608751921251921806042524864015401205911425720508279612028658918025225058112302377986826928406621415550253945230631120668669223578418330740559550868057110697261659699522758676651640755451440353465147778680250150345221815142979855685878797909422581189372897916274487958730463411839928802007462376865139666032018403406822330600514589882893084622425162973804990552844809342000848401261934589534629060757081597574878763865088725431459487615601133482723246548204702385088284068739075442358363868804109103479953182208681262333107823340058995756930523449840505836866848054424925103232640588714119013815935069547447970461224062918036555370614140826570394936248134983689055345231125360447854296145768430372543000082422799246924274895940425803652057601270388990771656513573369669901278059565337050325176002229878926847900054532792434448070094314778929335669040861124331427862422233185014227697439464209096309149440489627002282241733897001490006211763051733905595201667301140192280996427896667645151795751100750114023729634781544930675255356332481297749304299779865587012711075442479386351401792215341698940488716466361642687300468728803653255107494642226497464958118255113391738699519312330717594267114534771310899497556665295698896135773363108724568770218640296600334557776078574177802857613555468680117211017783735176047293137890627520696501468793978011981059507484069033674297605259173803074799220169557468019584570347607843037005716887715970216768623325968526346232812790079576655305424587668548941180522241180183238301937871027880637101344866811750301078862778437734925496591833010693104645320242409019722739194002922189324271107703006980376162377765465582875626587262262743211347086013853007397419105987782214312130829357233067412904712035533743804292656099013747186889927427183054051435184378363247923955670567674566353529626948927020949953216942933881556789445335831923682918970292364904722775053722006640137474300229863077018142841029821131284798693784536514770065785918404455531629777149882604780422748776685764231531600211482287565896379799922609934872282315446337401941572112717732729961830869311505188323297931815316495799836522448053061069341760567232916911334004078660672066495112028469672295913524819962631870592991933212325792113386398527672808976777504330329069284344146628780691008980210111849942881301591381225913690916207240768493185352226555761846568657024807127571119164054217495755449177039441667838858780338612881898636250186270510183113635756037214351112527147698366515892439399860895950709498033569575133953374709038617706495748777641841434627718033264675624738534753587425942243583271207404269608099058918638862888645382893716339383184680283553897687134843781961685376459721627175332231196420182377174323575267722070481784845617465013986913969496124217848273536058351175136879976440794499729082372749442577694194986306677493230638949354060807672229735281397632518060943167041271548989511145834518477318793221074420236733001959236992019033922320577016338272041567253085044834319769182031533544412035167082223122289103746358693931259331728736733732327252927764866847412456407337326703152926724791610393304682552789833447230673426002283797561873125093919829700952904709044974076345523017019192199040810730395059752196058429078376987136229558442158861963220253785257543377151479602857736856005364597386265460239170159884119404060728832256971076845410650406314737475843215958554495449951306474243567165322825630422380944815115181329647039739478557466548503470622967708579065762208658669986891781145858227928430577394877205533484351342689778057628749329650323702583624188924325986175876872310881435493934879216919010538943097025570618914728264775712824846225155887536859094906610747144081858991041401509942564420449860982856940427457684180793117203963844364795307347057764224558316419205340344672889335748706682096175936377031903436755772340695865919728007125919345328395485480672942980497575337628305815583543328918107512076106393920617946631001038297119260398507036938612505583254772828603851763379146656298916672351729373443305631084263474189633476858027943384636423128699823071814803646670495361463481576909651233324453190273730073961859216648444711969271502138649987223465514955038607100278552251563283196532454593254290625409567924675471718168300968286904177719495408206267248665620686425077352318960238264703477290699403944763534976514390472235740105111445814837668490404460327213030660767928627669853773625785483259048347945905687900815152477773866662716221163164492699851709375902578304844096658823109863853866628728973099998104133773412314436631805702713310400017017661361263474379414652603636766669267568276168745573970888667658995433895342327278613921722238408068085156092513959610096238432708759577068214711344223466066935056361227501493152746339116062048660943410400844142152470312197328619270060701109889443826331487178768113918108817750112357161388880777119734137070310401193642228543152406307578877602932792738436624620135083487091343267378551794612055196235971567380259782904640989472788349209973757153867578678492756352166586526890126491760984191878924549011528132461344204045867817692103175459025772830951691659139655560904195839572313838502912796068061067270177294413351379925893151060047480015985245178175073827493278047264792308991096191354203932367738651118254040755092493820791004403259328227234653424302427517610352652160841235401921075858707665672732674944680538135508800518459191835109757733849154769610514307093667130452278169956479040525948653779956908946155796695287076234564579810799556518046598528719277943043926387226725998722697408617496318529121089699429983962712968110077786949092644538907010539542471711065169451732299442432952734952454983078045317095485819036419418707246801947872569867340455984884898607767541536366332233493157912450045054846410860539288475407948355584036156749279224861750929616766944309095291935619439358241211310013080169216837542274244938958253362795505996301998702514214180687542504839644362604971937187717029653274558360831094353711412446655627707125727667869630221904250315087771341647685976536278593650465631818736278015361987645181923623544865667644255978963172604775076140988144631072321478435684863133966806707236102215268576489050645844466703096604710757185503385287796829322080627348851834978738505127076822856242316361752280917666205867173104589834562813537122716526263595343189107980810195299875272261414126767298582269879923720925124309467137481177563125180083332262913961054857734306865912946975997267125248463619192228935638882542496880108606035187888740429670991450189126462125453658118707461632532540134829947984419526876789731531799966683352665346274794172835012066444524944746626020645964759228651056826203302293447766632134288122478523470459689226814753977876259993313267351754555181819228193567532054555921728069543159453253434272771371406953458076262661664936505457135160189327725505201256793950298523176184043560489937822009552259604253323258939898494204337123817000704247845734140965817279529014980777371304746168459050483730139824673708958269341019334227586370775682717303619459483983836644770754007608579817615263040494135803204113405138131632648991764875625518920496405456430666717441146406145392648276068730497558101407737987743166322568750011479746357019146248579925764337724316995310330252165206147498390091884670292036541517657945443571692696742876038925423289337427304592906298879345758560146809098013828674779667433812291829757081758114927548510666595442298792319155319025599124293189204624702580594464292973099444342903044788049629626107534802620338246505928500276571785927672210338561684720419671053460788975495625953734001632590955342701195397679439685961404502402374284792101972845724871335048420875265210905224042127749649287988531632930794504370934381913457784301204262177367639738909312196694039989067641162420931587670250701197998823432209505682839080618916252782806882015338027571399787366101941332652484706389842049592575958344459394128634436120106423280316819403041502743434139667778543499783178725692342811561422093338454488761273731758777246142105784731789589859984226044007129450224562472546480594680257361101150228176155653467254815531911047098060366905031645671201119864894136030144468221996956234804429397307215122474091611271308850815103191054237761788129195111214369222033487335079608471598506740601035842399408936735202911257662009209916635267485729424582561841461902867999819652569169903452903088302978406346058982182029680437358195873431562254446571693285373814344445515297057349539176618580443165911491585453176540643360898931722143397912912578224336168279443194869708414811821289160592621998007320205104228172768122577978960969946933776928921746506185731594862948622422599833325955508301225791096866518464781951786519193375556445393121945730198879462809107049083786940358494015369692997271683899618577953838694479736\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 686,
        "task_id": 4238,
        "test_case_id": 13,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998\n",
        "output": "No\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 687,
        "task_id": 4238,
        "test_case_id": 14,
        "question": "An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\nDetermine whether N is a multiple of 9.\n\n-----Constraints-----\n - 0 \\leq N < 10^{200000}\n - N is an integer.\n\n-----Input-----\nInput is given from Standard Input in the following format:\nN\n\n-----Output-----\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\n-----Sample Input-----\n123456789\n\n-----Sample Output-----\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.",
        "solutions": "[\"L=input()\\nr=0\\nfor l in L:\\n\\tr+=int(l)\\nprint('Yes' if r%9==0 else 'No')\", \"a=int(input())\\nb=str(a)\\nc=list(map(int,b))\\nd=sum(c)\\nif d%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\\n\", \"x=int(input())\\nif x%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\" if sum(N) % 9 == 0 else \\\"No\\\")\", \"N = input()\\nList = [N[i] for i in range(len(N))]\\nans = 0\\nfor i in range(len(List)):\\n    ans += int(List[i])\\n    ans %= 9\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N=input()\\nlist=[]\\nt=0\\nfor i in range(len(N)):\\n    list.append(N[i])\\nfor i in range(len(list)):\\n    t=t+int(list[i])\\nif t%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N=list(map(int,list(str(int(input())))))\\nif sum(N)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N=list(input())\\nsum=0\\n\\nfor i in range(len(N)):\\n  sum+=int(N[i])\\n\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\ns = 0\\n \\nfor i in range(len(n)):\\n  s += int(n[i]) \\n  \\nif s%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = input()\\nnum = 0\\nfor i in n:\\n  num += int(i)\\nif num % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\", \"n=input()\\nprint(\\\"Yes\\\") if sum(map(int,n))%9==0 else print(\\\"No\\\")\", \"num_list = [int(s) for s in list(input())]\\nprint('Yes' if sum(num_list)%9==0 else 'No')\", \"n = input()\\nL = len(n)\\ns = 0\\n\\nfor i in range(L):\\n  s += int(n[i])\\n\\nif s % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"nums = list(map(int, input()))\\nnum_len = len(nums)\\nsums = 0\\n\\nfor i in range(num_len):\\n    sums += nums[i]\\n\\nif sums % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int,input())\\nN = sum(n)\\nif  N % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nif sum(list(map(int, str(N))))%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = str(input())\\nN_list = list(N)\\nans = 0\\n\\nfor i in range(len(N_list)):\\n    N_list[i] = int(N_list[i])\\n    ans += N_list[i]\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n_l = list(str(input()))\\n\\nsum_num = 0\\nfor i in n_l:\\n    sum_num += int(i)\\n\\nif sum_num % 9 == 0 or sum_num == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"import sys\\ndef rs(): return sys.stdin.readline().rstrip()\\ndef ri(): return int(rs())\\ndef rs_(): return [_ for _ in rs().split()]\\ndef ri_(): return [int(_) for _ in rs().split()]\\n\\nN = [int(i) for i in rs()]\\nprint('Yes' if sum(N) % 9 == 0 else 'No')\", \"N=input()\\n\\ns=0\\n\\nfor i in range(0,len(N)):\\n\\n\\ts+=int(N[i])\\n\\nif s%9==0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\", \"def multiple_of_nine():\\n    # \\u5165\\u529b\\n    N = int(input())\\n    # \\u51e6\\u7406\\n    if N % 9 == 0:\\n        return 'Yes'\\n    else:\\n        return 'No'\\n\\nresult = multiple_of_nine()\\nprint(result)\\n\", \"n = int(input())\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = map(int, list(input()))\\nprint('Yes' if sum(n) % 9 == 0 else 'No')\", \"# coding: utf-8\\n# Your code here!\\ndef main():\\n    num = sum(list(map(lambda x:int(x), input())))\\n    if num % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"if int(input())%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s = input()\\n\\nsum = 0\\nfor c in s:\\n\\tsum += ord(c) - ord('0')\\n\\nif sum%9 == 0:\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"N = int(input())\\n\\nif N%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"nums =int(input())\\nif nums%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = map(int,list(input()))\\nprint(\\\"Yes\\\") if sum(N)%9==0 else print(\\\"No\\\")\", \"n=int(input())\\nif n%9==0:\\n    print('Yes')\\nelse:\\n    print('No')    \\n\", \"N = input()\\nN_digit_sum = sum(int(n) for n in N)\\nprint(\\\"Yes\\\" if N_digit_sum%9 == 0 else \\\"No\\\") # (\\u0e51\\u2022\\u0ac5\\u3141\\u2022\\u0e51)\", \"N = str(input())\\n\\ntmp = 0\\nfor n in N:\\n  tmp += int(n)\\n\\nif tmp % 9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import sys\\n\\nN = list(input())\\n\\nsum = 0\\nfor i in range(len(N)):\\n    sum += int(N[i])\\n\\nprint(\\\"Yes\\\" if sum%9 == 0 else \\\"No\\\")\", \"import sys\\n\\n\\ndef input():\\n    return sys.stdin.readline().strip()\\n\\n\\nsys.setrecursionlimit(20000000)\\n\\nMOD = 10 ** 9 + 7\\nINF = float(\\\"inf\\\")\\n\\n\\ndef main():\\n    N = int(input())\\n    if N % 9 == 0:\\n        print(\\\"Yes\\\")\\n    else:\\n        print(\\\"No\\\")\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = int(input())\\nif N%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"# -*- coding: utf-8 -*-\\nn=str(input())\\ns=len(n)\\nh=0\\nfor i in range(s):\\n  keta=int(n[i])\\n  h+=keta\\nif h%9==0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"numero = input()\\nsoma = 0\\n\\nfor n in numero:\\n    soma += int(n)\\n\\nprint(f\\\"{'Yes' if  soma%9 == 0 else 'No'}\\\")\", \"n = input()\\nwa=0\\nfor i in range(0,10):\\n    wa = wa + n.count(str(i))*i\\nprint('Yes' if wa%9==0 else 'No') \", \"N=int(input())\\n\\nif N%9 == 0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\\n\", \"n = input()\\nlength = len(n)\\nans=0\\n\\nfor i in range (length):\\n  ans +=int(n[i])\\n\\nif ans % 9 ==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N = int(input())\\nmy_str = str(N)\\nmy_sum = 0\\nfor i in my_str:\\n    my_sum += int(i)\\nprint(('Yes' if my_sum % 9 == 0 else 'No'))\", \"kazu = int(input())\\nif (kazu%9)==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = int(input())\\nif(n%9 == 0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = str(input())\\nnum = list(N)\\nnatural_num = list(map(int, num))\\nK = len(natural_num)\\nL_num = 0\\nfor i in range(K):\\n    L_num += natural_num[i]\\nans = L_num % 9\\nif ans == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"n=int(input())\\nif n%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nprint('Yes' if n%9==0 else 'No')\", \"n = int(input())\\n\\nprint(\\\"Yes\\\" if n % 9 == 0 else \\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = list(map(int,input().split()))\\nans = \\\"Yes\\\"\\nif sum(n)%9:\\n    ans = \\\"No\\\"\\nprint(ans)\", \"n = input()\\n\\nif(len(n) <= 7):\\n\\tif(int(n) % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\\nelse:\\n\\tsum = 0\\n\\tfor i in n:\\n\\t\\tsum = sum + int(i)\\n\\tif(sum % 9 == 0):\\n\\t\\tprint(\\\"Yes\\\")\\n\\telse:\\n\\t\\tprint(\\\"No\\\")\", \"p=input()\\nif p=='0':\\n  print('Yes')\\nelif len(p)==1 and p!='9':\\n  print('No')\\nelif len(p)==1 and p=='9':\\n  print('Yes')\\nelse:\\n  if sum([int(val) for val in p])%9==0:\\n    print('Yes')\\n  else:\\n    print('No')\\n\", \"n = input()\\nwa=0\\nfor i in n:\\n    wa = wa + int(i)\\nprint('Yes' if wa%9==0 else 'No') \", \"NL = list(map(int,list(input())))\\nif sum(NL)%9==0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\nresult = sum(list(map(int, str(N))))\\n\\nif result % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n=list(input())\\nans=0\\nfor i in range(len(n)):\\n  ans+=int(n[i])\\nif ans%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"import numpy as np\\na = np.array(list(map(int, list(input()))), dtype=np.int64).sum() % 9 == 0\\nif a:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N = int(input())\\nn = str(N)\\nNs = 0\\nfor i in range(len(n)):\\n    Ns += int(n[i:i+1])\\nif (Ns % 9) == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"line = input()\\nsum = 0\\nfor x in line:\\n    sum = sum + int(x)\\nif sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"N = input()\\nsum_N = 0\\n\\nfor i in range(len(N)):\\n    sum_N = (sum_N + int(N[i])) % 9\\n\\nif sum_N == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"s=input()\\nn=len(s)\\n\\nall=int(0)\\nfor i in range(n):\\n    all+=int(s[i])\\n\\nif all%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    result = 0\\n    for i in n:\\n        result += int(i)\\n\\n    return 'Yes' if result % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n = list(map(int,input().split()))\\nn9 = sum(n)\\nif n9 % 9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\\n\\n\", \"l=[int(x) for x in input()]\\nprint(\\\"Yes\\\" if sum(l)%9==0 else \\\"No\\\")\", \"N = input()\\nnums = []\\nlength = len(N)\\nfor i in range(1, length+1):\\n    value = int(N[-i])\\n#     print(value)\\n    nums.append(value)\\nsumOfNums = sum(nums)\\nif sumOfNums % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def b176(n):\\n\\n    intn = [int(i) for i in n]\\n\\n    return \\\"Yes\\\" if sum(intn) % 9 == 0 else \\\"No\\\"\\n\\n\\ndef main():\\n    n = list(str(input()))\\n    print(b176(n))\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"# -*- coding utf-8 -*-\\n\\nMOD = 10 ** 9 + 7\\n\\nN = input()\\n\\nans = 'Yes' if sum(map(int, N)) % 9 == 0 else 'No'\\n\\nprint(ans)\\n\", \"N=int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x=input()\\nx=list(x)\\nsum=0\\nfor i in x:\\n  sum+=int(i)\\nif sum%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"N=int(input())\\nM=str(N)\\na=[0]*len(M)\\nS=0\\nfor i in range(len(M)):\\n  a[i]=int(M[i])\\n  \\nfor j in a:\\n  S=S+j\\n  \\nif S%9==0:\\n  print(\\\"Yes\\\")\\nelse:\\n  print(\\\"No\\\")\", \"n = input()\\n\\nans = 0\\n\\nfor i in range(len(n)):\\n    ans += int(n[i])\\n\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"import re\\nimport sys\\n\\n#Lista de Entradas\\nlst = []\\nfor line in sys.stdin:\\n    lst.append(line.rstrip(\\\"\\\\n\\\"))\\n\\n\\nregex = [[int(r) for r in re.findall(\\\"(\\\\d+)\\\",line)]\\n            for line in lst]\\n\\nverifica = lambda x: \\\"Yes\\\" if x % 9 == 0 else \\\"No\\\" \\n\\n[print(verifica(r[0])) for r in regex]\", \"N=input()\\n\\ndef ans176(N:str):\\n    sum=0\\n    for i in range(len(str(N))):\\n        sum+=int(str(N)[i])\\n    if sum%9==0:\\n        return(\\\"Yes\\\")\\n    else:\\n        return(\\\"No\\\")\\n\\nprint(ans176(N))\", \"n = int(input())\\nif n % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"num_list = [int(s) for s in list(input())]\\nif(sum(num_list)%9==0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"x = input()\\n\\nsum = 0\\nfor i in x:\\n    sum = sum + int(i)\\n\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = list(input())\\nx = 0\\n\\nfor i in n:\\n    x += int(i)\\n\\nif x%9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"n = input()\\ns = 0\\nfor i in n:\\n    s += int(i)\\nif s % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"def answer(n: str) -> str:\\n    return 'Yes' if sum(map(int, n.split())) % 9 == 0 else 'No'\\n\\n\\ndef main():\\n    n = input()\\n    print((answer(n)))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"N = input()\\nresidue = 0\\nfor i in N:\\n    residue = (residue+int(i))%9\\nif residue == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"N = int(input())\\n\\nif N%9==0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"temp = input()\\ntemp = list(temp)\\nnum_list = [int(s) for s in temp]\\nsum = 0\\nfor i in range(len(num_list)):\\n  sum += num_list[i]\\nif(sum % 9 == 0):\\n  print('Yes')\\nelse:\\n  print('No')\", \"N = list(input())\\ntot = 0\\nfor i in N:\\n    tot += int(i)\\nif tot % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"def main():\\n    \\n    try:\\n        N = input()\\n            \\n        a = list(N)\\n        s = 0\\n        \\n        for i in range(len(a)):\\n            s += int(a[i])\\n        \\n        print(\\\"Yes\\\" if s % 9 == 0 else \\\"No\\\")\\n        \\n    except EOFError:\\n        print(\\\"No\\\")\\n    \\ndef __starting_point():\\n    main()\\n__starting_point()\", \"n = input()\\nsum = 0\\nfor i in range(len(n)):\\n    sum += int(n[i])\\nif sum % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"N=input()\\nn = len(N)\\nN_lis=list(N)\\nans=0\\nfor i in range(n):\\n    ans += int(N_lis[i])\\nif ans % 9 == 0:\\n    print(\\\"Yes\\\")   \\nelse:\\n    print(\\\"No\\\")    \", \"n = int(input())\\nif(n%9==0):\\n\\tprint(\\\"Yes\\\")\\nelse:\\n\\tprint(\\\"No\\\")\\n\", \"if int(input()) % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"N = input()\\n\\nn = list(map(int, N))\\n\\nif sum(n)%9 == 0:\\n  print('Yes')\\nelse:\\n  print('No')\", \"n = list(input())\\nnum = 0\\nfor i in range(len(n)):\\n    num += int(n[i])\\n\\nif num % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n = int(input())\\n\\nif n % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"print(\\\"YNeos\\\"[sum(map(int,input()))%9>0::2])\", \"n=input()\\ntotal=0\\nfor i in n:\\n  total+=int(i)\\nprint(\\\"Yes\\\" if total%9==0 else \\\"No\\\")\", \"N = input()\\nS = 0\\nfor i in N:\\n    S += int(i)\\nif S == 0:\\n    print('Yes')\\nelif S < 9:\\n    print('No')\\nelif S % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\\n\", \"N = input()\\nn = len(N)\\ntotal = 0\\n\\nfor i in range(n):\\n    total += int(N[i])\\n\\nif total % 9 == 0:\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\\n\", \"from sys import stdin\\nN = list(stdin.readline().rstrip())\\nd_sum = 0\\nfor n in N:\\n    d_sum += int(n)\\nif d_sum % 9 == 0:\\n    print('Yes')\\nelse:\\n    print('No')\", \"s=input()\\nsum=0\\nfor i in s:\\n    sum+=int(i)\\nif(sum%9==0):\\n    print(\\\"Yes\\\")\\nelse:\\n    print(\\\"No\\\")\", \"n=int(input())\\nif n%9:\\n  print('No')\\nelse :\\n  print('Yes')\"]",
        "difficulty": "introductory",
        "input": "99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n",
        "output": "Yes\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc176/tasks/abc176_b"
    },
    {
        "id": 688,
        "task_id": 4985,
        "test_case_id": 1,
        "question": "Young Mirko is a smart, but mischievous boy who often wanders around parks looking for new ideas. This time he’s come across pensioners playing the card game Belote. They’ve invited him to help them determine the total number of points in a game.\n\nEach card can be uniquely determined by its number and suit. A set of four cards is called a hand. At the beginning of a game one suit that “trumps” any other is chosen, and it is called the dominant suit. The number of points in a game is equal to the sum of values of each card from each hand in the game. Mirko has noticed that the pensioners have played $N$ hands and that suit $B$ was the dominant suit.\n\nThe value of each card depends on its number and whether its suit is dominant, and is given in Table 1.\n\nNumber\n\nValue \n\nDominant\n\nNot dominant\n\nA\n\n$11$\n\n$11$\n\nK\n\n$4$\n\n$4$\n\nQ\n\n$3$\n\n$3$\n\nJ\n\n$20$\n\n$2$\n\nT\n\n$10$\n\n$10$\n\n9\n\n$14$\n\n$0$\n\n8\n\n$0$\n\n$0$\n\n7\n\n$0$\n\n$0$Table 1: Scores \n\nWrite a programme that will determine and output the number of points in the game.\n\n-----Input-----\nThe first line contains the number of hands $N$ ($1 \\leq N \\leq 100$) and the value of suit $B$ (S, H, D, C) from the task. Each of the following $4N$ lines contains the description of a card (the first character is the number of the $i$-th card (A, K, Q, J, T, 9, 8, 7), and the second is the suit (S, H, D, C)).\n\n-----Output-----\nThe first and only line of output must contain the number of points from the task.\n\n-----Examples-----\nSample Input:\n2 S\nTH\n9C\nKS\nQS\nJS\nTD\nAD\nJH\nSample Output:\n60",
        "solutions": "",
        "difficulty": "introductory",
        "input": "2 S\nTH\n9C\nKS\nQS\nJS\nTD\nAD\nJH\n",
        "output": "60\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/bela"
    },
    {
        "id": 689,
        "task_id": 4985,
        "test_case_id": 2,
        "question": "Young Mirko is a smart, but mischievous boy who often wanders around parks looking for new ideas. This time he’s come across pensioners playing the card game Belote. They’ve invited him to help them determine the total number of points in a game.\n\nEach card can be uniquely determined by its number and suit. A set of four cards is called a hand. At the beginning of a game one suit that “trumps” any other is chosen, and it is called the dominant suit. The number of points in a game is equal to the sum of values of each card from each hand in the game. Mirko has noticed that the pensioners have played $N$ hands and that suit $B$ was the dominant suit.\n\nThe value of each card depends on its number and whether its suit is dominant, and is given in Table 1.\n\nNumber\n\nValue \n\nDominant\n\nNot dominant\n\nA\n\n$11$\n\n$11$\n\nK\n\n$4$\n\n$4$\n\nQ\n\n$3$\n\n$3$\n\nJ\n\n$20$\n\n$2$\n\nT\n\n$10$\n\n$10$\n\n9\n\n$14$\n\n$0$\n\n8\n\n$0$\n\n$0$\n\n7\n\n$0$\n\n$0$Table 1: Scores \n\nWrite a programme that will determine and output the number of points in the game.\n\n-----Input-----\nThe first line contains the number of hands $N$ ($1 \\leq N \\leq 100$) and the value of suit $B$ (S, H, D, C) from the task. Each of the following $4N$ lines contains the description of a card (the first character is the number of the $i$-th card (A, K, Q, J, T, 9, 8, 7), and the second is the suit (S, H, D, C)).\n\n-----Output-----\nThe first and only line of output must contain the number of points from the task.\n\n-----Examples-----\nSample Input:\n2 S\nTH\n9C\nKS\nQS\nJS\nTD\nAD\nJH\nSample Output:\n60",
        "solutions": "",
        "difficulty": "introductory",
        "input": "4 H\nAH\nKH\nQH\nJH\nTH\n9H\n8H\n7H\nAS\nKS\nQS\nJS\nTS\n9S\n8S\n7S\n",
        "output": "92\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/bela"
    },
    {
        "id": 690,
        "task_id": 2612,
        "test_case_id": 1,
        "question": "There are $n$ models in the shop numbered from $1$ to $n$, with sizes $s_1, s_2, \\ldots, s_n$.\n\nOrac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but not sizes).\n\nOrac thinks that the obtained arrangement is beatiful, if for any two adjacent models with indices $i_j$ and $i_{j+1}$ (note that $i_j < i_{j+1}$, because Orac arranged them properly), $i_{j+1}$ is divisible by $i_j$ and $s_{i_j} < s_{i_{j+1}}$.\n\nFor example, for $6$ models with sizes $\\{3, 6, 7, 7, 7, 7\\}$, he can buy models with indices $1$, $2$, and $6$, and the obtained arrangement will be beautiful. Also, note that the arrangement with exactly one model is also considered beautiful.\n\nOrac wants to know the maximum number of models that he can buy, and he may ask you these queries many times.\n\n\n-----Input-----\n\nThe first line contains one integer $t\\ (1 \\le t\\le 100)$: the number of queries.\n\nEach query contains two lines. The first line contains one integer $n\\ (1\\le n\\le 100\\,000)$: the number of models in the shop, and the second line contains $n$ integers $s_1,\\dots,s_n\\ (1\\le s_i\\le 10^9)$: the sizes of models.\n\nIt is guaranteed that the total sum of $n$ is at most $100\\,000$.\n\n\n-----Output-----\n\nPrint $t$ lines, the $i$-th of them should contain the maximum number of models that Orac can buy for the $i$-th query.\n\n\n-----Example-----\nInput\n4\n4\n5 3 4 6\n7\n1 4 2 3 6 4 9\n5\n5 4 3 2 1\n1\n9\n\nOutput\n2\n3\n1\n1\n\n\n\n-----Note-----\n\nIn the first query, for example, Orac can buy models with indices $2$ and $4$, the arrangement will be beautiful because $4$ is divisible by $2$ and $6$ is more than $3$. By enumerating, we can easily find that there are no beautiful arrangements with more than two models. \n\nIn the second query, Orac can buy models with indices $1$, $3$, and $6$. By enumerating, we can easily find that there are no beautiful arrangements with more than three models. \n\nIn the third query, there are no beautiful arrangements with more than one model.",
        "solutions": "[\"import sys\\n\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nns = lambda: readline().rstrip()\\nni = lambda: int(readline().rstrip())\\nnm = lambda: map(int, readline().split())\\nnl = lambda: list(map(int, readline().split()))\\nprn = lambda x: print(*x, sep='\\\\n')\\n\\n\\ndef solve():\\n    n = ni()\\n    s = nl()\\n    dp = [1]*(n+1)\\n    for i in range(n//2, 0, -1):\\n        for j in range(2*i, n+1, i):\\n            if s[i-1] < s[j-1]:\\n                dp[i] = max(dp[i], dp[j] + 1)\\n\\n    print(max(dp))\\n    return\\n\\n# solve()\\n\\nT = ni()\\nfor _ in range(T):\\n    solve()\\n\", \"from math import *\\n\\nfor zz in range(int(input())):\\n    n = int(input())\\n    a = [int(i) for i in input().split()]\\n    dp = [1] * (n + 1)\\n    for i in range(n - 1, 0, -1):\\n        j = 2*i\\n        while j <= n:\\n            if a[i-1] < a[j-1]:\\n                dp[i] = max(dp[i], dp[j] + 1)\\n            j += i\\n        \\n    print(max(dp))\\n\", \"for _ in range(int(input())):\\n    n = int(input())\\n    ar = [0] + list(map(int, input().split()))\\n    dp = [0] * (n+1)\\n    for i in range(1, n+1):\\n        dp[i] = max(1, dp[i])\\n        for j in range(i+i, n+1, i):\\n            if ar[j] > ar[i]:\\n                dp[j] = max(dp[j], dp[i] + 1)\\n    print(max(dp))\", \"t = int(input())\\nfor i in range(t):\\n    n = int(input())\\n    a = list(map(int,input().split()))\\n    ans = [0] * n\\n    for i in range(1, n + 1):\\n        ans[i - 1] = max(ans[i - 1], 1)\\n        for j in range(2, n // i + 1):\\n            if a[i * j - 1] > a[i - 1]:\\n                ans[i * j - 1] = max(ans[i * j - 1], ans[i - 1] + 1)\\n    print(max(ans))\\n\", \"import sys\\ninput=lambda: sys.stdin.readline().rstrip()\\nt=int(input())\\nfor _ in range(t):\\n  n=int(input())\\n  S=[int(i) for i in input().split()]\\n  A=[1]*(n+1)\\n  for i in range(1,n+1):\\n    mul=2\\n    while i*mul<=n:\\n      if S[i*mul-1]>S[i-1]:\\n        A[i*mul]=max(A[i*mul],A[i]+1)\\n      mul+=1\\n  print(max(A))\", \"import sys\\nreader = (s.rstrip() for s in sys.stdin)\\ninput = reader.__next__\\n\\ndef solve():\\n    n = int(input())\\n    s = list(map(int, input().split()))\\n    ans = [0]*n\\n    for i in range(1, n+1):\\n        ans[i-1] = max(ans[i-1], 1)\\n        for j in range(2*i, n+1, i):\\n            if s[i-1] < s[j-1]:\\n                ans[j-1] = max(ans[j-1], ans[i-1]+1)\\n    print(max(ans))\\n\\nt = int(input())\\nfor i in range(t):\\n    solve()\\n\\n\", \"for f in range(int(input())):\\n    n=int(input())\\n    s=list(map(int,input().split()))\\n    poss=[1]*(n+1)\\n    for i in range(1,n):\\n        j=2\\n        while j*i<=n:\\n            if s[j*i-1]>s[i-1]:\\n                poss[i*j]=max(poss[i*j],poss[i]+1)\\n            j+=1\\n    print(max(poss))\", \"\\\"\\\"\\\"T=int(input())\\nfor _ in range(0,T):\\n    n=int(input())\\n    a,b=map(int,input().split())\\n    s=input()\\n    s=[int(x) for x in input().split()]\\n    for i in range(0,len(s)):\\n        a,b=map(int,input().split())\\\"\\\"\\\"\\n\\n\\nT=int(input())\\nfor _ in range(0,T):\\n    n=int(input())\\n    s=[0]+[int(x) for x in input().split()]\\n    L=[1]*len(s)\\n    for i in range(1,len(L)):\\n        #tt=L[i]\\n        ptr=i+i\\n        while(ptr<=n):\\n            if(s[ptr]>s[i]):\\n                L[ptr]=max(L[ptr],L[i]+1)\\n            ptr+=i\\n    print(max(L))\\n            \\n    \\n\", \"t = int(input())\\n\\nfor _ in range(t):\\n    n = int(input())\\n    s = list(map(int, input().strip().split()))\\n\\n    result = [1] * len(s)\\n    for i in range(len(s)):\\n        indeks = i + 1\\n        start = 2*indeks\\n        while start <= n:\\n            if s[start-1] > s[i]:\\n                result[start-1] = max(result[start-1], result[i] + 1)\\n            start += indeks\\n    print(max(result))\", \"import sys\\nimport math\\nt=int(sys.stdin.readline())\\nfor _ in range(t):\\n    n=int(sys.stdin.readline())\\n    arr=list(map(int,sys.stdin.readline().split()))\\n    dp=[1 for  x in range(n+1)]\\n    for i in range(n-1,0,-1):\\n        j=i*2\\n        cnt=2\\n        cur=1\\n        while j<=n:\\n            y=dp[j]\\n            if arr[j-1]>arr[i-1]:\\n                cur=max(cur,1+y)\\n            cnt+=1\\n            j=i*cnt\\n        dp[i]=cur\\n    #print(dp,'dp')\\n    ans=max(dp)\\n    print(ans)\\n    \\n\"]",
        "difficulty": "interview",
        "input": "4\n4\n5 3 4 6\n7\n1 4 2 3 6 4 9\n5\n5 4 3 2 1\n1\n9\n",
        "output": "2\n3\n1\n1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1350/B"
    },
    {
        "id": 691,
        "task_id": 2612,
        "test_case_id": 2,
        "question": "There are $n$ models in the shop numbered from $1$ to $n$, with sizes $s_1, s_2, \\ldots, s_n$.\n\nOrac will buy some of the models and will arrange them in the order of increasing numbers (i.e. indices, but not sizes).\n\nOrac thinks that the obtained arrangement is beatiful, if for any two adjacent models with indices $i_j$ and $i_{j+1}$ (note that $i_j < i_{j+1}$, because Orac arranged them properly), $i_{j+1}$ is divisible by $i_j$ and $s_{i_j} < s_{i_{j+1}}$.\n\nFor example, for $6$ models with sizes $\\{3, 6, 7, 7, 7, 7\\}$, he can buy models with indices $1$, $2$, and $6$, and the obtained arrangement will be beautiful. Also, note that the arrangement with exactly one model is also considered beautiful.\n\nOrac wants to know the maximum number of models that he can buy, and he may ask you these queries many times.\n\n\n-----Input-----\n\nThe first line contains one integer $t\\ (1 \\le t\\le 100)$: the number of queries.\n\nEach query contains two lines. The first line contains one integer $n\\ (1\\le n\\le 100\\,000)$: the number of models in the shop, and the second line contains $n$ integers $s_1,\\dots,s_n\\ (1\\le s_i\\le 10^9)$: the sizes of models.\n\nIt is guaranteed that the total sum of $n$ is at most $100\\,000$.\n\n\n-----Output-----\n\nPrint $t$ lines, the $i$-th of them should contain the maximum number of models that Orac can buy for the $i$-th query.\n\n\n-----Example-----\nInput\n4\n4\n5 3 4 6\n7\n1 4 2 3 6 4 9\n5\n5 4 3 2 1\n1\n9\n\nOutput\n2\n3\n1\n1\n\n\n\n-----Note-----\n\nIn the first query, for example, Orac can buy models with indices $2$ and $4$, the arrangement will be beautiful because $4$ is divisible by $2$ and $6$ is more than $3$. By enumerating, we can easily find that there are no beautiful arrangements with more than two models. \n\nIn the second query, Orac can buy models with indices $1$, $3$, and $6$. By enumerating, we can easily find that there are no beautiful arrangements with more than three models. \n\nIn the third query, there are no beautiful arrangements with more than one model.",
        "solutions": "[\"import sys\\n\\nreadline = sys.stdin.readline\\nreadlines = sys.stdin.readlines\\nns = lambda: readline().rstrip()\\nni = lambda: int(readline().rstrip())\\nnm = lambda: map(int, readline().split())\\nnl = lambda: list(map(int, readline().split()))\\nprn = lambda x: print(*x, sep='\\\\n')\\n\\n\\ndef solve():\\n    n = ni()\\n    s = nl()\\n    dp = [1]*(n+1)\\n    for i in range(n//2, 0, -1):\\n        for j in range(2*i, n+1, i):\\n            if s[i-1] < s[j-1]:\\n                dp[i] = max(dp[i], dp[j] + 1)\\n\\n    print(max(dp))\\n    return\\n\\n# solve()\\n\\nT = ni()\\nfor _ in range(T):\\n    solve()\\n\", \"from math import *\\n\\nfor zz in range(int(input())):\\n    n = int(input())\\n    a = [int(i) for i in input().split()]\\n    dp = [1] * (n + 1)\\n    for i in range(n - 1, 0, -1):\\n        j = 2*i\\n        while j <= n:\\n            if a[i-1] < a[j-1]:\\n                dp[i] = max(dp[i], dp[j] + 1)\\n            j += i\\n        \\n    print(max(dp))\\n\", \"for _ in range(int(input())):\\n    n = int(input())\\n    ar = [0] + list(map(int, input().split()))\\n    dp = [0] * (n+1)\\n    for i in range(1, n+1):\\n        dp[i] = max(1, dp[i])\\n        for j in range(i+i, n+1, i):\\n            if ar[j] > ar[i]:\\n                dp[j] = max(dp[j], dp[i] + 1)\\n    print(max(dp))\", \"t = int(input())\\nfor i in range(t):\\n    n = int(input())\\n    a = list(map(int,input().split()))\\n    ans = [0] * n\\n    for i in range(1, n + 1):\\n        ans[i - 1] = max(ans[i - 1], 1)\\n        for j in range(2, n // i + 1):\\n            if a[i * j - 1] > a[i - 1]:\\n                ans[i * j - 1] = max(ans[i * j - 1], ans[i - 1] + 1)\\n    print(max(ans))\\n\", \"import sys\\ninput=lambda: sys.stdin.readline().rstrip()\\nt=int(input())\\nfor _ in range(t):\\n  n=int(input())\\n  S=[int(i) for i in input().split()]\\n  A=[1]*(n+1)\\n  for i in range(1,n+1):\\n    mul=2\\n    while i*mul<=n:\\n      if S[i*mul-1]>S[i-1]:\\n        A[i*mul]=max(A[i*mul],A[i]+1)\\n      mul+=1\\n  print(max(A))\", \"import sys\\nreader = (s.rstrip() for s in sys.stdin)\\ninput = reader.__next__\\n\\ndef solve():\\n    n = int(input())\\n    s = list(map(int, input().split()))\\n    ans = [0]*n\\n    for i in range(1, n+1):\\n        ans[i-1] = max(ans[i-1], 1)\\n        for j in range(2*i, n+1, i):\\n            if s[i-1] < s[j-1]:\\n                ans[j-1] = max(ans[j-1], ans[i-1]+1)\\n    print(max(ans))\\n\\nt = int(input())\\nfor i in range(t):\\n    solve()\\n\\n\", \"for f in range(int(input())):\\n    n=int(input())\\n    s=list(map(int,input().split()))\\n    poss=[1]*(n+1)\\n    for i in range(1,n):\\n        j=2\\n        while j*i<=n:\\n            if s[j*i-1]>s[i-1]:\\n                poss[i*j]=max(poss[i*j],poss[i]+1)\\n            j+=1\\n    print(max(poss))\", \"\\\"\\\"\\\"T=int(input())\\nfor _ in range(0,T):\\n    n=int(input())\\n    a,b=map(int,input().split())\\n    s=input()\\n    s=[int(x) for x in input().split()]\\n    for i in range(0,len(s)):\\n        a,b=map(int,input().split())\\\"\\\"\\\"\\n\\n\\nT=int(input())\\nfor _ in range(0,T):\\n    n=int(input())\\n    s=[0]+[int(x) for x in input().split()]\\n    L=[1]*len(s)\\n    for i in range(1,len(L)):\\n        #tt=L[i]\\n        ptr=i+i\\n        while(ptr<=n):\\n            if(s[ptr]>s[i]):\\n                L[ptr]=max(L[ptr],L[i]+1)\\n            ptr+=i\\n    print(max(L))\\n            \\n    \\n\", \"t = int(input())\\n\\nfor _ in range(t):\\n    n = int(input())\\n    s = list(map(int, input().strip().split()))\\n\\n    result = [1] * len(s)\\n    for i in range(len(s)):\\n        indeks = i + 1\\n        start = 2*indeks\\n        while start <= n:\\n            if s[start-1] > s[i]:\\n                result[start-1] = max(result[start-1], result[i] + 1)\\n            start += indeks\\n    print(max(result))\", \"import sys\\nimport math\\nt=int(sys.stdin.readline())\\nfor _ in range(t):\\n    n=int(sys.stdin.readline())\\n    arr=list(map(int,sys.stdin.readline().split()))\\n    dp=[1 for  x in range(n+1)]\\n    for i in range(n-1,0,-1):\\n        j=i*2\\n        cnt=2\\n        cur=1\\n        while j<=n:\\n            y=dp[j]\\n            if arr[j-1]>arr[i-1]:\\n                cur=max(cur,1+y)\\n            cnt+=1\\n            j=i*cnt\\n        dp[i]=cur\\n    #print(dp,'dp')\\n    ans=max(dp)\\n    print(ans)\\n    \\n\"]",
        "difficulty": "interview",
        "input": "4\n23\n3198 4895 1585 3881 2650 2366 876 2731 1052 126 2152 3621 2169 4103 1074 2594 2897 3983 3830 3460 729 576 3281\n1\n1000000000\n2\n1 1\n100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\n",
        "output": "3\n1\n1\n7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1350/B"
    },
    {
        "id": 692,
        "task_id": 1632,
        "test_case_id": 1,
        "question": "Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly without replacement from a jar containing n balls, each labeled with a distinct positive integer. Without looking, they hand their balls to Harry, who awards the point to the player with the larger number and returns the balls to the jar. The winner of the game is the one who wins at least two of the three rounds.\n\nAndrew wins rounds 1 and 2 while Jerry wins round 3, so Andrew wins the game. However, Jerry is unhappy with this system, claiming that he will often lose the match despite having the higher overall total. What is the probability that the sum of the three balls Jerry drew is strictly higher than the sum of the three balls Andrew drew?\n\n\n-----Input-----\n\nThe first line of input contains a single integer n (2 ≤ n ≤ 2000) — the number of balls in the jar.\n\nThe second line contains n integers a_{i} (1 ≤ a_{i} ≤ 5000) — the number written on the ith ball. It is guaranteed that no two balls have the same number.\n\n\n-----Output-----\n\nPrint a single real value — the probability that Jerry has a higher total, given that Andrew wins the first two rounds and Jerry wins the third. Your answer will be considered correct if its absolute or relative error does not exceed 10^{ - 6}. \n\nNamely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if $\\frac{|a - b|}{\\operatorname{max}(1, b)} \\leq 10^{-6}$.\n\n\n-----Examples-----\nInput\n2\n1 2\n\nOutput\n0.0000000000\n\nInput\n3\n1 2 10\n\nOutput\n0.0740740741\n\n\n\n-----Note-----\n\nIn the first case, there are only two balls. In the first two rounds, Andrew must have drawn the 2 and Jerry must have drawn the 1, and vice versa in the final round. Thus, Andrew's sum is 5 and Jerry's sum is 4, so Jerry never has a higher total.\n\nIn the second case, each game could've had three outcomes — 10 - 2, 10 - 1, or 2 - 1. Jerry has a higher total if and only if Andrew won 2 - 1 in both of the first two rounds, and Jerry drew the 10 in the last round. This has probability $\\frac{1}{3} \\cdot \\frac{1}{3} \\cdot \\frac{2}{3} = \\frac{2}{27}$.",
        "solutions": "[\"MAX_N = 5001\\n\\na = [0] * MAX_N;\\nraz = [0] * (MAX_N + 10);\\ns = [0] * (MAX_N + 10);\\n\\nn = int(input())\\n\\na = list(map(int, input().split()))\\n\\nfor i in range(n):\\n    for j in range(n):\\n        if a[i] - a[j] > 0:\\n            raz[a[i] - a[j]] += 1\\n\\n\\nfor i in range(1, MAX_N + 1):\\n     s[i] = s[i - 1] + raz[i]\\n     \\nans = 0;\\n\\nfor i in range(1, MAX_N):\\n    if raz[i] == 0:\\n        continue\\n    for j in range(1, MAX_N):\\n        if i + j > MAX_N:\\n            break\\n        if raz[j] == 0:\\n            continue\\n        ans += raz[i] * raz[j] * (s[MAX_N] - s[i + j])\\n\\nans = ans * 1.0\\nans /= s[MAX_N]\\nans /= s[MAX_N]\\nans /= s[MAX_N]\\n\\nprint(ans)\", \"import sys\\n\\n# sys.stdin = open(\\\"ivo.in\\\")\\n\\nn = int(sys.stdin.readline())\\n\\na = [int(s) for s in sys.stdin.readline().split()]\\n\\na.sort()\\n\\ndiffs1 = []\\n\\nfor i in range(5000):\\n    diffs1.append(0)\\n\\nfor i in range(n):\\n    for j in range(i + 1, n):\\n        diffs1[a[j] - a[i]] += 1\\n\\n# for i in range(1, n):\\n#    diffs1[i] += diffs1[i - 1]\\n\\ndiffs2 = []\\nfor i in range(10000):\\n    diffs2.append(0)\\n\\nfor i in range(len(diffs1)):\\n    for j in range(i, len(diffs1)):\\n        if i == j:\\n            diffs2[i + j] += diffs1[i] * diffs1[j]\\n        else:\\n            diffs2[i + j] += 2 * diffs1[i] * diffs1[j]\\n\\nfor i in range(1, len(diffs2)):\\n    diffs2[i] += diffs2[i - 1]\\n\\n\\ngood = 0\\nfor u in range(n - 1, 0, -1):\\n    for t in range(u - 1, -1, -1):\\n        good += diffs2[a[u] - a[t] - 1]\\n\\nall = (n * (n - 1)) // 2\\nall = all * all * all\\n\\nprint(float(good) / float(all))\", \"cnt = [0] * 5001\\nways = [0] * 5001\\ns_ways = [0] * 5001\\nn = int(input())\\na = list(map(int, input().split()))\\n\\nfor i in a:\\n\\tcnt[i] += 1\\n\\nfor diff in range(4999, 0, -1):\\n\\tfor i in a:\\n\\t\\tif i >= diff and cnt[i - diff] > 0:\\n\\t\\t\\tways[diff] += 1\\n\\tways[diff] /= (n * (n - 1) / 2)\\n\\ts_ways[diff] = s_ways[diff + 1] + ways[diff]\\n\\t\\nans = 0\\nfor diff1 in range(1, 5000):\\n\\tfor diff2 in range(1, 5000 - diff1):\\n\\t\\ttargetdiff = diff1 + diff2 + 1\\n\\t\\tans += ways[diff1] * ways[diff2] * s_ways[targetdiff]\\n\\nprint(ans)\", \"ways = [0] * 5001\\ns_ways = [0] * 5001\\nn = int(input())\\na = set(map(int, input().split()))\\n\\nfor diff in range(4999, 0, -1):\\n\\tfor i in a:\\n\\t\\tif i >= diff and (i - diff in a):\\n\\t\\t\\tways[diff] += 1\\n\\tways[diff] /= (n * (n - 1) / 2)\\n\\ts_ways[diff] = s_ways[diff + 1] + ways[diff]\\n\\nans = 0\\nfor diff1 in range(1, 5000):\\n\\tfor diff2 in range(1, 5000 - diff1):\\n\\t\\ttargetdiff = diff1 + diff2 + 1\\n\\t\\tans += ways[diff1] * ways[diff2] * s_ways[targetdiff]\\n\\nprint(ans)\", \"n = int(input())\\nt = sorted(map(int, input().split()))\\nm = 5001\\nd = [0, 0] * m\\nfor a in t:\\n    for b in t: d[b - a] += 1\\nfor i in range(m, 2 * m): d[i] = d[i - 1] + d[i]\\ns = 0\\nfor i in range(1, m):\\n    s += d[i] * sum(d[j] * d[-1 - i - j] for j in range(1, m - i))\\nprint(8 * s / (n * n - n) ** 3)\", \"n = int(input())\\nt = list(map(int, input().split()))\\n\\ns, k = 0, 5001\\nd = [0, 0] * k\\n\\nfor a in t:\\n    for b in t: d[b - a] += 1\\nfor i in range(k, 2 * k): d[i] += d[i - 1]\\n\\nfor i in range(1, k):\\n    s += d[i] * sum(d[j] * d[-1 - i - j] for j in range(1, k - i))\\n\\nprint(8 * s / (n * n - n) ** 3)\", \"n = int(input())\\nt = list(map(int, input().split()))\\n\\ns, k = 0, 5001\\nd = [0, 0] * k\\n\\nfor a in t:\\n    for b in t: d[b - a] += 1\\nfor i in range(k, 2 * k): d[i] += d[i - 1]\\n\\nfor i in range(1, k):\\n    s += d[i] * sum(d[j] * d[-1 - i - j] for j in range(1, k - i))\\n\\nprint(8 * s / (n * n - n) ** 3)\\n\", \"n = int(input())\\nt = list(map(int, input().split()))\\n\\ns, k = 0, 5001\\nd = [0, 0] * k\\n\\nfor a in t:\\n    for b in t: d[b - a] += 1\\nfor i in range(k, 2 * k): d[i] += d[i - 1]\\n\\nfor i in range(1, k):\\n    s += d[i] * sum(d[j] * d[-1 - i - j] for j in range(1, k - i))\\n\\nprint(8 * s / (n * n - n) ** 3)\\n\", \"from itertools import accumulate\\n\\nR = lambda: map(int, input().split())\\nn = int(input())\\narr = sorted(R())\\nones = [0] * 5005\\nfor i in range(n):\\n    for j in range(i):\\n        ones[abs(arr[i] - arr[j])] += 1\\ntwos = [0] * 10005\\nfor i in range(1, 5001):\\n    for j in range(1, 5001):\\n        if ones[i] and ones[j]:\\n            twos[i + j] += ones[i] * ones[j]\\nstwos = list(accumulate(twos))\\nsat, sm = 0, 0\\nfor i in range(1, 5001):\\n    if ones[i]:\\n        sat += ones[i] * stwos[i - 1]\\n        sm += ones[i] * stwos[-1]\\nprint(sat / max(1, sm))\"]",
        "difficulty": "interview",
        "input": "2\n1 2\n",
        "output": "0.0000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/626/D"
    },
    {
        "id": 693,
        "task_id": 2204,
        "test_case_id": 1,
        "question": "Vladimir would like to prepare a present for his wife: they have an anniversary! He decided to buy her exactly $n$ flowers.\n\nVladimir went to a flower shop, and he was amazed to see that there are $m$ types of flowers being sold there, and there is unlimited supply of flowers of each type. Vladimir wants to choose flowers to maximize the happiness of his wife. He knows that after receiving the first flower of the $i$-th type happiness of his wife increases by $a_i$ and after receiving each consecutive flower of this type her happiness increases by $b_i$. That is, if among the chosen flowers there are $x_i > 0$ flowers of type $i$, his wife gets $a_i + (x_i - 1) \\cdot b_i$ additional happiness (and if there are no flowers of type $i$, she gets nothing for this particular type).\n\nPlease help Vladimir to choose exactly $n$ flowers to maximize the total happiness of his wife.\n\n\n-----Input-----\n\nThe first line contains the only integer $t$ ($1 \\leq t \\leq 10\\,000$), the number of test cases. It is followed by $t$ descriptions of the test cases.\n\nEach test case description starts with two integers $n$ and $m$ ($1 \\le n \\le 10^9$, $1 \\le m \\le 100\\,000$), the number of flowers Vladimir needs to choose and the number of types of available flowers.\n\nThe following $m$ lines describe the types of flowers: each line contains integers $a_i$ and $b_i$ ($0 \\le a_i, b_i \\le 10^9$) for $i$-th available type of flowers.\n\nThe test cases are separated by a blank line. It is guaranteed that the sum of values $m$ among all test cases does not exceed $100\\,000$.\n\n\n-----Output-----\n\nFor each test case output a single integer: the maximum total happiness of Vladimir's wife after choosing exactly $n$ flowers optimally.\n\n\n-----Example-----\nInput\n2\n4 3\n5 0\n1 4\n2 2\n\n5 3\n5 2\n4 2\n3 1\n\nOutput\n14\n16\n\n\n\n-----Note-----\n\nIn the first example case Vladimir can pick 1 flower of the first type and 3 flowers of the second type, in this case the total happiness equals $5 + (1 + 2 \\cdot 4) = 14$.\n\nIn the second example Vladimir can pick 2 flowers of the first type, 2 flowers of the second type, and 1 flower of the third type, in this case the total happiness equals $(5 + 1 \\cdot 2) + (4 + 1 \\cdot 2) + 3 = 16$.",
        "solutions": "[\"import sys\\ninput = sys.stdin.readline\\n\\nt = int(input())\\nfor test in range(t):\\n    if test:\\n        input()\\n    n, m = list(map(int, input().split()))\\n    a = [-1] * m\\n    b = [-1] * m\\n\\n    for i in range(m):\\n        a[i], b[i] = list(map(int, input().split()))\\n\\n    l = [(a[i],0,i) for i in range(m)] + [(b[i],1,i) for i in range(m)]\\n    l.sort(reverse = True)\\n    \\n    count = 0\\n    tot = 0\\n    best = 0\\n    used = [False] * m\\n    for good, typ, ind in l:\\n        if typ == 0:\\n            count += 1\\n            tot += good\\n            used[ind] = True\\n            if count == n:\\n                best = max(best, tot)\\n                break\\n        else:\\n            curr = tot\\n            curr += good * (n - count)\\n            if not used[ind]:\\n                curr -= good\\n                curr += a[ind]\\n            best = max(curr,best)\\n    print(best)\\n\", \"import sys,heapq\\n\\ninput=sys.stdin.readline\\n\\nfor _ in range(int(input())):\\n    if _!=0:\\n        s=input()\\n    n,m=list(map(int,input().split()))\\n    flower=[]#b,a\\n    for i in range(m):\\n        a,b=list(map(int,input().split()))\\n        flower.append((b,a))\\n    flower.sort()\\n    S=0\\n    N=0\\n    ans=-1\\n    que=[]\\n    if n==1:\\n        ans=max(flower[i][1] for i in range(m))\\n        print(ans)\\n        continue\\n    for i in range(m):\\n        b,a=flower[i]\\n        while que and b>que[0]:\\n            A=heapq.heappop(que)\\n            S-=A\\n            N-=1\\n        temp=b*(n-1-N)+a+S\\n        ans=max(temp,ans)\\n        if N==n-1:\\n            if que[0]<a:\\n                S-=que[0]\\n                heapq.heappop(que)\\n                S+=a\\n                heapq.heappush(que,a)\\n        else:\\n            heapq.heappush(que,a)\\n            S+=a\\n            N+=1\\n\\n    print(ans)\\n\", \"import sys\\ninput = sys.stdin.readline\\nfor f in range(int(input())):\\n    n,m=map(int,input().split())\\n    a=[0]*m\\n    b=[0]*m\\n    acop=[0]*m\\n    bcop=[0]*m\\n    for i in range(m):\\n        a[i],b[i]=map(int,input().split())\\n        acop[i]=a[i]\\n        bcop[i]=[b[i],i]\\n    acop.sort(reverse=True)\\n    bcop.sort(reverse=True)\\n    mx=0\\n    i=0\\n    su=0\\n    for j in range(m):\\n        bi=bcop[j][0]\\n        ii=bcop[j][1]\\n        ai=a[ii]\\n        while i<m and acop[i]>bi:\\n            su+=acop[i]\\n            i+=1\\n        maxi=ai\\n        if i<n:\\n            maxi+=su\\n            if i+1<n:\\n                maxi+=(n-i-1)*bi\\n            if ai>bi:\\n                maxi+=bi\\n                maxi-=ai\\n            mx=max(maxi,mx)\\n    if n<=m:\\n        sun=0\\n        for i in range(n):\\n            sun+=acop[i]\\n        mx=max(mx,sun)\\n    print(mx)\\n    blank=input()\", \"import bisect\\nt = int(input())\\nfor _ in range(t):\\n    n, m = list(map(int, input().split()))\\n    flowers = []\\n    flowers_a = []\\n    max_b = 0\\n    for i in range(m):\\n        a, b = list(map(int, input().split()))\\n        flowers.append((a, b))\\n    \\n    flowers.sort()\\n    flowers_b = []\\n    for i in range(m):\\n        flowers_a.append(flowers[i][0])\\n        flowers_b.append(flowers[i][1])\\n    \\n    val = 0\\n    prefix_sum = [0]\\n    for x in flowers_a:\\n        prefix_sum.append(prefix_sum[-1] + x)\\n    for i in range(m):\\n        idx = bisect.bisect_left(flowers_a, flowers_b[i])\\n        options = m - idx\\n        if options >= n:\\n            temp = prefix_sum[-1] - prefix_sum[-n - 1]\\n            val = max(val, temp)\\n            continue\\n        else:\\n            temp = prefix_sum[-1] - prefix_sum[-options - 1]\\n            remaining = n - options\\n            if idx <= i:\\n                temp += flowers_b[i] * remaining\\n            else:\\n                temp += flowers_a[i] + flowers_b[i] * (remaining - 1)\\n            \\n            val = max(val, temp)\\n                \\n\\n    print(val)\\n    \\n    if _ != t - 1:\\n        blank_line = input()\\n\", \"from bisect import bisect_left\\n\\nt = int(input())\\n\\nfor case in range(t):\\n    n, m = list(map(int, input().split()))\\n    ab = [list(map(int, input().split())) for _ in range(m)]\\n\\n    aa = [e for e, _ in ab]\\n    aa.sort()\\n    acc = [0] * (m + 1)\\n    for i in range(m, 0, -1):\\n        acc[i-1] = acc[i] + aa[i-1]\\n\\n    if n > m:\\n        ans = 0\\n    else:\\n        ans = sum(aa[-n:])\\n\\n    for a, b in ab:\\n        i = bisect_left(aa, b)\\n        cnt = min(m - i, n)\\n        sm = acc[m - cnt]\\n        sm += b * (n - cnt)\\n        if a < b:\\n            sm -= b\\n            sm += a\\n\\n        ans = max(ans, sm)\\n\\n    print(ans)\\n\\n    if case != t - 1:\\n        input()\\n\", \"import sys\\n\\ndef input():\\n\\treturn sys.stdin.readline().rstrip()\\n\\ndef input_split():\\n\\treturn [int(i) for i in input().split()]\\n\\ntestCases = int(input())\\nanswers = []\\nfor test in range(testCases):\\n\\t#take input\\n\\tn, m = input_split()\\n\\tarr = []\\n\\tbarr = []\\n\\tfor _ in range(m):\\n\\t\\ta, b = input_split()\\n\\t\\tarr.append(a)\\n\\t\\tbarr.append(b)\\n\\n\\ttemp1 = [(arr[i], 1, i) for i in range(m)]\\n\\ttemp2 = [(barr[i], 2, i) for i in range(m)]\\n\\n\\tmixed = temp1 + temp2\\n\\tmixed.sort()\\n\\tmixed.reverse()\\n\\n\\tpointer = 0\\n\\tdone = 0\\n\\tmaxi = 0\\n\\tscore = 0\\n\\tunlocked = [False for i in range(m)]\\n\\twhile(done < n and pointer < 2*m):\\n\\t\\tval, typ, index = mixed[pointer]\\n\\t\\tif typ == 1:\\n\\t\\t\\tdone += 1\\n\\t\\t\\tscore += val\\n\\t\\t\\tunlocked[index] = True\\n\\t\\t\\tif done == n:\\n\\t\\t\\t\\tmaxi = max(score, maxi) \\n\\t\\telse:\\n\\t\\t\\tif not unlocked[index]:\\n\\t\\t\\t\\tpotential = score + (n - done - 1)*val + arr[index]\\n\\t\\t\\telse:\\n\\t\\t\\t\\tpotential = score + (n - done)*val \\n\\t\\t\\t\\t#can break here?\\n\\t\\t\\tmaxi = max(potential, maxi)\\n\\n\\t\\tpointer += 1\\n\\n\\tans = maxi\\n\\tanswers.append(ans)\\n\\n\\tif test != testCases - 1:\\n\\t\\tblank = input()\\n\\nprint(*answers, sep = '\\\\n')\\n\"]",
        "difficulty": "interview",
        "input": "2\n4 3\n5 0\n1 4\n2 2\n\n5 3\n5 2\n4 2\n3 1\n",
        "output": "14\n16\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1379/C"
    },
    {
        "id": 694,
        "task_id": 3862,
        "test_case_id": 9,
        "question": "Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration $\\frac{a_{i}}{1000}$. Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration $\\frac{n}{1000}$. The drink should also be tasty, so the glass can contain only integer number of liters of each Coke type (some types can be not presented in the glass). Also, they want to minimize the total volume of Coke in the glass.\n\nCarbon dioxide concentration is defined as the volume of carbone dioxide in the Coke divided by the total volume of Coke. When you mix two Cokes, the volume of carbon dioxide sums up, and the total volume of Coke sums up as well.\n\nHelp them, find the minimal natural number of liters needed to create a glass with carbon dioxide concentration $\\frac{n}{1000}$. Assume that the friends have unlimited amount of each Coke type.\n\n\n-----Input-----\n\nThe first line contains two integers n, k (0 ≤ n ≤ 1000, 1 ≤ k ≤ 10^6) — carbon dioxide concentration the friends want and the number of Coke types.\n\nThe second line contains k integers a_1, a_2, ..., a_{k} (0 ≤ a_{i} ≤ 1000) — carbon dioxide concentration of each type of Coke. Some Coke types can have same concentration.\n\n\n-----Output-----\n\nPrint the minimal natural number of liter needed to prepare a glass with carbon dioxide concentration $\\frac{n}{1000}$, or -1 if it is impossible.\n\n\n-----Examples-----\nInput\n400 4\n100 300 450 500\n\nOutput\n2\n\nInput\n50 2\n100 25\n\nOutput\n3\n\n\n\n-----Note-----\n\nIn the first sample case, we can achieve concentration $\\frac{400}{1000}$ using one liter of Coke of types $\\frac{300}{1000}$ and $\\frac{500}{1000}$: $\\frac{300 + 500}{1000 + 1000} = \\frac{400}{1000}$.\n\nIn the second case, we can achieve concentration $\\frac{50}{1000}$ using two liters of $\\frac{25}{1000}$ type and one liter of $\\frac{100}{1000}$ type: $\\frac{25 + 25 + 100}{3 \\cdot 1000} = \\frac{50}{1000}$.",
        "solutions": "[\"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\", \"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"from collections import deque\\n\\nMAX_A = 1000\\n     \\n     \\ndef main():\\n    n, k = map(int, input().split())\\n    a = set(int(x) - n for x in input().split())\\n     \\n    visited = [False] * (2 * MAX_A + 1)\\n    visited[n] = True\\n    Q = deque()\\n    Q.append((n, 0))\\n     \\n    result = None\\n    while Q:\\n        u, l = Q.popleft()\\n        l += 1\\n        for ai in a:\\n            v = u + ai\\n            if v == n:\\n                result = l\\n                break\\n            if 0 <= v < len(visited) and not visited[v]:\\n                visited[v] = True\\n                Q.append((v, l))\\n     \\n        if result is not None:\\n            break\\n     \\n    if result is None:\\n        result = -1\\n     \\n    print(result)\\n     \\n     \\ndef __starting_point():\\n    # import sys\\n    # sys.stdin = open(\\\"E.txt\\\")\\n    main()\\n__starting_point()\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nd = set(int(x)-n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for i in d:\\n    \\tif i + u == 0:\\n    \\t\\t\\n    \\t\\tans = dist[u] + 1\\n    \\t\\tfound = True\\n    \\t\\tbreak     \\n    \\tif i + u <= 1000 and i + u >= -1000 and not visited[i + u]:\\n    \\t\\tvisited[i + u] = True\\n    \\t\\tdist[i + u] = dist[u] + 1\\n    \\t\\tq.append(i + u)\\n    \\n    if found:\\n    \\tbreak\\n    \\nprint (ans)\\n\\n\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nconc = set(int(x) - n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for c in conc:\\n        v = c + u\\n        if v == 0:\\n            ans=dist[u]+1\\n            found=True\\n            break\\n        if v<=1000 and v>=-1000 and not visited[v]:\\n            visited[v]=True\\n            dist[v]=dist[u]+1\\n            q.append(v)\\n    if found:\\n    \\tbreak\\n    \\nprint(ans)\\n\\n\"]",
        "difficulty": "competition",
        "input": "0 1\n0\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/788/C"
    },
    {
        "id": 695,
        "task_id": 15,
        "test_case_id": 6,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "0 1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 696,
        "task_id": 15,
        "test_case_id": 33,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-2 -1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 697,
        "task_id": 15,
        "test_case_id": 38,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-2 0 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 698,
        "task_id": 15,
        "test_case_id": 43,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-2 1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 699,
        "task_id": 15,
        "test_case_id": 48,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-2 2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 700,
        "task_id": 15,
        "test_case_id": 63,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-1 0 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 701,
        "task_id": 15,
        "test_case_id": 68,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-1 1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 702,
        "task_id": 15,
        "test_case_id": 73,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-1 2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 703,
        "task_id": 15,
        "test_case_id": 93,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "0 1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 704,
        "task_id": 15,
        "test_case_id": 98,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "0 2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 705,
        "task_id": 15,
        "test_case_id": 123,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1 2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 706,
        "task_id": 15,
        "test_case_id": 173,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 3 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 707,
        "task_id": 692,
        "test_case_id": 1,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "1\n2\n0\n",
        "output": "0.500000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 708,
        "task_id": 692,
        "test_case_id": 2,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "2\n2 3\n1 0\n",
        "output": "0.666667\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 709,
        "task_id": 692,
        "test_case_id": 3,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "3\n2 4 4\n0 1 3\n",
        "output": "1.000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 710,
        "task_id": 692,
        "test_case_id": 5,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "16\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\n",
        "output": "1.000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 711,
        "task_id": 692,
        "test_case_id": 6,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "16\n5 6 9 13 13 15 9 10 2 6 10 11 12 7 4 8\n4 3 3 5 8 3 6 5 1 4 2 6 7 4 0 1\n",
        "output": "0.959707\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 712,
        "task_id": 692,
        "test_case_id": 7,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "8\n15 3 7 11 14 10 16 2\n0 2 1 4 0 0 13 1\n",
        "output": "0.826840\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 713,
        "task_id": 692,
        "test_case_id": 9,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "9\n6 12 3 10 15 14 6 9 3\n5 2 0 6 1 1 2 2 2\n",
        "output": "0.752381\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 714,
        "task_id": 692,
        "test_case_id": 10,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "3\n9 12 6\n0 5 0\n",
        "output": "0.305556\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 715,
        "task_id": 692,
        "test_case_id": 11,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "5\n3 3 13 5 10\n1 0 1 4 2\n",
        "output": "0.784615\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 716,
        "task_id": 692,
        "test_case_id": 12,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "7\n3 15 11 4 12 15 12\n2 9 3 0 9 13 6\n",
        "output": "0.757576\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 717,
        "task_id": 692,
        "test_case_id": 13,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "2\n13 3\n6 0\n",
        "output": "0.384615\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 718,
        "task_id": 692,
        "test_case_id": 14,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "9\n15 9 7 4 14 14 2 11 13\n2 6 2 3 11 12 0 3 3\n",
        "output": "0.876790\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 719,
        "task_id": 692,
        "test_case_id": 18,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "7\n15 9 9 2 6 8 3\n10 2 7 1 3 2 0\n",
        "output": "0.850000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 720,
        "task_id": 692,
        "test_case_id": 19,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "10\n9 8 7 7 16 3 10 13 5 6\n2 0 0 4 1 0 3 12 1 5\n",
        "output": "0.832418\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 721,
        "task_id": 692,
        "test_case_id": 20,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "4\n10 15 2 9\n8 14 0 0\n",
        "output": "0.588889\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 722,
        "task_id": 692,
        "test_case_id": 21,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "12\n5 16 12 3 10 15 11 14 2 3 4 11\n3 14 1 0 7 9 10 12 1 2 2 6\n",
        "output": "0.953247\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 723,
        "task_id": 692,
        "test_case_id": 22,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "5\n16 6 4 15 2\n13 3 0 13 0\n",
        "output": "0.737500\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 724,
        "task_id": 692,
        "test_case_id": 23,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "14\n12 11 7 12 2 4 14 10 7 4 15 3 5 16\n2 8 0 9 0 1 4 0 5 3 11 1 0 6\n",
        "output": "1.000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 725,
        "task_id": 692,
        "test_case_id": 24,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "12\n8 5 5 12 12 14 14 16 5 11 9 3\n1 4 0 11 10 0 2 3 1 8 8 2\n",
        "output": "0.859307\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 726,
        "task_id": 692,
        "test_case_id": 25,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "10\n3 16 16 9 5 16 9 7 8 2\n0 1 7 2 1 9 0 4 4 1\n",
        "output": "0.857143\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 727,
        "task_id": 692,
        "test_case_id": 26,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "9\n14 14 5 8 16 2 11 7 11\n9 7 0 2 7 1 10 2 4\n",
        "output": "0.789610\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 728,
        "task_id": 692,
        "test_case_id": 27,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "7\n13 12 4 2 7 13 8\n4 6 0 0 3 9 3\n",
        "output": "0.728022\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 729,
        "task_id": 692,
        "test_case_id": 30,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "7\n10 15 9 5 9 15 16\n2 7 2 4 0 12 13\n",
        "output": "0.543056\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 730,
        "task_id": 692,
        "test_case_id": 31,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "10\n16 10 16 15 12 5 4 9 3 10\n9 0 1 2 9 4 1 8 0 8\n",
        "output": "0.811111\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 731,
        "task_id": 692,
        "test_case_id": 32,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "14\n14 8 6 12 13 15 2 3 16 15 15 15 16 8\n10 0 5 6 1 7 0 2 1 4 2 11 14 2\n",
        "output": "0.784615\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 732,
        "task_id": 692,
        "test_case_id": 34,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "10\n2 15 15 4 3 10 8 14 12 12\n1 8 13 0 0 6 4 2 4 5\n",
        "output": "0.914286\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 733,
        "task_id": 692,
        "test_case_id": 35,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "3\n6 14 7\n4 2 0\n",
        "output": "0.333333\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 734,
        "task_id": 692,
        "test_case_id": 36,
        "question": "Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.\n\nYuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo. \n\n\n-----Input-----\n\nThe first line of input contains a single integer N (1 ≤ N ≤ 16).\n\nThe second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].\n\n\n-----Output-----\n\nOutput a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.\n\n\n-----Examples-----\nInput\n1\n2\n0\n\nOutput\n0.500000\n\nInput\n2\n2 3\n1 0\n\nOutput\n0.666667",
        "solutions": "[\"ct = 0\\nx = int(input())\\ny = list(map(int, input().split(' ')))\\nz = list(map(int, input().split(' ')))\\nfor i in range(1, 720721):\\n    for j in range(x):\\n        if i%y[j] == z[j]:\\n            ct+=1\\n            break\\nprint(ct/720720)\\n\", \"n = int(input())\\nmod = list(map(int, input().split()))\\nrem = list(map(int, input().split()))\\ncnt = 0\\nfor d in range(360360):\\n    we = False\\n    for r, m in zip(rem, mod):\\n        if d % m == r:\\n            we = True\\n            break\\n    if we:\\n        cnt += 1\\nprint(cnt / 360360)\", \"def gcd(a, b):\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\nn = int(input())\\n\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\nG = 1\\nfor m in M:\\n    G = (G * m) // gcd(G, m)\\n\\ncount = 0\\nfor d in range(G):\\n    for i in range(len(M)):\\n        if d % M[i] == R[i]:\\n            count += 1\\n            break\\n\\nprint(count / G)\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\nN = 720720\\nP = 0\\nfor x in range(N):\\n    if any(x % M[i] == R[i] for i in range(n)):\\n        P += 1\\n\\nprint(P * 1.0 / N)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\ncount = 0\\nN = 100000\\nfor D in range(N):\\n    for i in range(n):\\n        if D % m[i] == r[i]:\\n            count += 1\\n            break\\nprint(count / N)\", \"from fractions import gcd\\nn, m, r = int(input()), list(map(int, input().split())), list(map(int, input().split()))\\nlcm = m[0]\\nfor mi in m:\\n    lcm = lcm * mi // gcd(lcm, mi)\\nprint(sum(any(i % mj == rj for mj, rj in zip(m, r)) for i in range(lcm)) / lcm)\", \"n = int(input())\\nM = [int(s) for s in input().split()]\\nR = [int(s) for s in input().split()]\\nc = 0\\nfor i in range(100000):\\n    bool = False\\n    for j in range(n):\\n        if i % M[j] == R[j]:\\n            bool = True\\n            break\\n    if bool:\\n        c += 1\\nprint(c/100000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncnt = 0\\nfor i in range(720720):\\n\\tfor j in range(n):\\n\\t\\tif i % m[j] == r[j]:\\n\\t\\t \\tcnt += 1\\n\\t\\t \\tbreak\\n\\nprint(cnt / 720720)\", \"def gcd(a, b):\\n    if a == 0:\\n        return b\\n    if b == 0:\\n        return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a * b // gcd(a, b)\\n\\nn = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncap = 1\\nfor val in m:\\n    cap = lcm(cap, val)\\n\\nans = 0\\nfor day in range(cap):\\n    works = False\\n    for i in range(n):\\n        if day % m[i] == r[i]:\\n            works = True\\n            break\\n    if works:\\n        ans += 1\\n\\nprint(ans/cap)\\n\", \"N = int(input())\\nM = list(map(int,input().split()))\\nR = list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    return a if b == 0 else gcd(b, a % b)\\nlcm = 1\\nfor i in range(N):\\n    lcm = lcm * M[i] / gcd(lcm, M[i])\\nrec = set()\\nfor i in range(N):\\n    j = R[i]\\n    while j < lcm:\\n        rec.add(j)\\n        j += M[i]\\nprint(len(rec) / lcm)\\n\", \"def gcd(a, b):\\n    while b != 0:\\n        c = a % b\\n        a = b\\n        b = c\\n    return a\\n\\ninput()\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\nresult = 1\\nfor mod in m:\\n    result = result * mod // gcd(result, mod)\\ngood = 0\\nfor i in range(result):\\n    for mod, car in zip(m, r):\\n        if i % mod == car:\\n            good += 1\\n            break\\nprint(good / result)\\n\", \"a = 30030\\nn = int(input())\\nm = [int(_) for _ in input().split()]\\nr = [int(_) for _ in input().split()]\\nans = 0\\nfor i in range(a):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            ans += 1\\n            break\\nprint(ans / a)\\n\", \"from fractions import gcd\\n\\nn = int(input())\\nm = list(map(int,input().split()))\\nr = list(map(int,input().split()))\\ntot = 1\\nfor i in m:\\n    tot = tot*i//gcd(tot,i)\\nhas = [0]*tot\\nfor i in range(n):\\n    on = r[i]\\n    while on<tot:\\n        has[on] = 1\\n        on+=m[i]\\nprint(sum(has)/tot)\", \"N=int(input())\\nM=list(map(int, input().split()))\\nR=list(map(int, input().split()))\\n\\ndef gcd(a, b):\\n    if b == 0: return a\\n    return gcd(b, a % b)\\n\\ndef lcm(a, b):\\n    return a*b//gcd(a,b)\\n\\ns=1\\nfor m in M: s = lcm(s, m)\\nt=0\\nfor d in range(s):\\n    k = False\\n    for i, m in enumerate(M):\\n        r = R[i]\\n        if d % m == r:\\n            k = True\\n            break\\n    if k: t += 1\\n\\nprint(t/s)\\n\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nresult = 0\\nfor d in range(100000):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            result += 1\\n            break\\n\\nprint('%.6f' % (result / 100000))\\n\", \"def gcd(x, y):\\n    while x != 0 and y != 0:\\n        if x > y:\\n            x %= y\\n        else:\\n            y %= x\\n    return x + y\\n\\ndef lcm(x, y):\\n    return x * y / gcd(x, y)\\n\\nn = int(input())\\nm = [int(i) for i in input().split()]\\nr = [int(i) for i in input().split()]\\n\\nl = 1\\nfor i in range(n):\\n    l = lcm(l, m[i])\\ns = set()\\nfor i in range(n):\\n    t = int(l / m[i])\\n    for j in range(t):\\n        s.add(r[i] + m[i] * j)\\nprint(len(s) / l)\\n\\n\", \"3\\n\\nfrom fractions import gcd\\n\\ndef main():\\n    n = int(input())\\n    m = list(map(int, input().split()))\\n    r = list(map(int, input().split()))\\n\\n    k = 1\\n    for x in m:\\n        k = (x * k) // gcd(x, k)\\n\\n\\n    a = 0\\n    for i in range(k):\\n        f = 0\\n        for j in range(n):\\n            if i % m[j] == r[j]:\\n                f = 1\\n                break\\n        a += f\\n\\n    print(a / k)\\n\\nmain()\\n\", \"n = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ndef nod(x, y):\\n\\twhile x != 0 and y != 0:\\n\\t\\tif x > y:\\n\\t\\t\\tx = x % y\\n\\t\\telse:\\n\\t\\t\\ty = y % x\\n\\treturn x + y\\n\\nk = 1\\nfor i in M:\\n\\tk = k * i // nod(k, i)\\n\\nans = 0\\nfor D in range(k):\\n\\tfor i in range(n):\\n\\t\\tif D % M[i] == R[i]:\\n\\t\\t\\tans += 1\\n\\t\\t\\tbreak\\n\\nprint(ans / k)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\nk = 0\\nfor i in range(100000):\\n    for j in range(n):\\n        if i % m[j] == r[j]:\\n            k += 1\\n            break\\n\\nprint(k / 100000)\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport time\\n\\n\\ndef lcm(a, b):\\n    return(a*b//gcd(a,b))\\n\\n\\ndef gcd(a, b):\\n    while( b!= 0 ):\\n        while(a >= b):\\n            a -= b\\n        (a, b) = (b, a)\\n    return(a)\\n\\n\\n\\nn   = int(input())\\n\\nM   = [int(i) for i in input().split()]\\nR   = [int(i) for i in input().split()]\\n\\nstart = time.time()\\n\\nm  = 1\\n\\nfor i in range(n):\\n    m  = lcm(m, M[i])\\n\\na = [ 0 for i in range(m)]\\n\\nfor i in range(n):\\n    if R[i] >= M[i]:\\n        continue\\n\\n    now = R[i]-1\\n    if now < 0:\\n        now += M[i]\\n\\n    while (now < m):\\n        a[now] = 1\\n        now += M[i]\\n\\nprint(sum(a)/m)\\nfinish = time.time()\\n#print(finish - start)\\n\", \"n = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nans = 0\\nfor i in range(1000000):\\n    for j in range(n):\\n        if (i % a[j] == b[j]):\\n            ans += 1\\n            break\\nprint(ans / 1000000)\", \"n = int(input())\\nm = list(map(int, input().split()))\\nr = list(map(int, input().split()))\\n\\ncount = 0.0\\nfor i in range(100000):\\n    for j in range(len(m)):\\n        if i % m[j] == r[j]:\\n            count += 1\\n            break\\nprint(count / 100000.0)\\n\\n\", \"def nod(a, b):\\n    for i in range(min(a, b), 0, -1):\\n        if (a % i == 0 and b % i == 0):\\n            return i\\n\\ndef nok(a, b):\\n    return a * b // nod(a, b)\\n\\n\\nn = int(input())\\nm = [int(x) for x in input().split()]\\nr = [int(x) for x in input().split()]\\nans = 1\\nfor i in range(n):\\n    ans = nok(ans, m[i])\\n\\nx = 0\\nfor d in range(ans):\\n    for i in range(n):\\n        if d % m[i] == r[i]:\\n            x += 1\\n            break\\nprint(x / ans)\", \"k = int(input())\\nq1 = list(map(int,input().split()))\\nq2 = list(map(int,input().split()))\\nz = 100000\\nans = 0\\nfor i in range(1,z+1):\\n    for j in range(len(q1)):\\n        if i%q1[j] == q2[j]:\\n            ans+=1\\n            break\\nprint(ans/z)\", \"__author__ = \\\"runekri3\\\"\\n\\nN = int(input())\\nM = list(map(int, input().split()))\\nR = list(map(int, input().split()))\\n\\ntotal_days = 100000\\ndays_you_washed = 0\\n\\nfor D in range(total_days):\\n    for i in range(N):\\n        if D % M[i] == R[i]:\\n            days_you_washed += 1\\n            break\\n\\nprint(days_you_washed / total_days)\\n\"]",
        "difficulty": "interview",
        "input": "13\n3 4 16 11 12 13 12 12 3 16 8 13 4\n0 1 14 5 8 5 11 7 1 6 4 1 0\n",
        "output": "0.967949\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/656/B"
    },
    {
        "id": 735,
        "task_id": 2137,
        "test_case_id": 3,
        "question": "Ghosts live in harmony and peace, they travel the space without any purpose other than scare whoever stands in their way.\n\nThere are $n$ ghosts in the universe, they move in the $OXY$ plane, each one of them has its own velocity that does not change in time: $\\overrightarrow{V} = V_{x}\\overrightarrow{i} + V_{y}\\overrightarrow{j}$ where $V_{x}$ is its speed on the $x$-axis and $V_{y}$ is on the $y$-axis.\n\nA ghost $i$ has experience value $EX_i$, which represent how many ghosts tried to scare him in his past. Two ghosts scare each other if they were in the same cartesian point at a moment of time.\n\nAs the ghosts move with constant speed, after some moment of time there will be no further scaring (what a relief!) and the experience of ghost kind $GX = \\sum_{i=1}^{n} EX_i$ will never increase.\n\nTameem is a red giant, he took a picture of the cartesian plane at a certain moment of time $T$, and magically all the ghosts were aligned on a line of the form $y = a \\cdot x + b$. You have to compute what will be the experience index of the ghost kind $GX$ in the indefinite future, this is your task for today.\n\nNote that when Tameem took the picture, $GX$ may already be greater than $0$, because many ghosts may have scared one another at any moment between $[-\\infty, T]$.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $a$ and $b$ ($1 \\leq n \\leq 200000$, $1 \\leq |a| \\leq 10^9$, $0 \\le |b| \\le 10^9$) — the number of ghosts in the universe and the parameters of the straight line.\n\nEach of the next $n$ lines contains three integers $x_i$, $V_{xi}$, $V_{yi}$ ($-10^9 \\leq x_i \\leq 10^9$, $-10^9 \\leq V_{x i}, V_{y i} \\leq 10^9$), where $x_i$ is the current $x$-coordinate of the $i$-th ghost (and $y_i = a \\cdot x_i + b$).\n\nIt is guaranteed that no two ghosts share the same initial position, in other words, it is guaranteed that for all $(i,j)$ $x_i \\neq x_j$ for $i \\ne j$.\n\n\n-----Output-----\n\nOutput one line: experience index of the ghost kind $GX$ in the indefinite future.\n\n\n-----Examples-----\nInput\n4 1 1\n1 -1 -1\n2 1 1\n3 1 1\n4 -1 -1\n\nOutput\n8\n\nInput\n3 1 0\n-1 1 0\n0 0 -1\n1 -1 -2\n\nOutput\n6\n\nInput\n3 1 0\n0 0 0\n1 0 0\n2 0 0\n\nOutput\n0\n\n\n\n-----Note-----\n\nThere are four collisions $(1,2,T-0.5)$, $(1,3,T-1)$, $(2,4,T+1)$, $(3,4,T+0.5)$, where $(u,v,t)$ means a collision happened between ghosts $u$ and $v$ at moment $t$. At each collision, each ghost gained one experience point, this means that $GX = 4 \\cdot 2 = 8$.\n\nIn the second test, all points will collide when $t = T + 1$.  [Image] \n\nThe red arrow represents the 1-st ghost velocity, orange represents the 2-nd ghost velocity, and blue represents the 3-rd ghost velocity.",
        "solutions": "[\"n, A, C = list(map(int, input().split()))\\n\\ndef Ro(x, y):\\n    return A * x - y + C\\n \\nhuh = []\\n \\nfor i in range(n):\\n    z, x, y = list(map(int, input().split()))\\n    huh.append((Ro(x + z, z * A + y), x))\\nhuh = sorted(huh)\\nanss = 0\\nc1 = 0\\nc2 = 0\\nprev = (-9999999999999, -999999999999999)\\ng = []\\n\\nhuh.append((-9999999999999, -999999999999999))\\n#print(huh)\\nfor huhh in huh:\\n    if huhh[0] != prev[0]:\\n        g.append(c1)\\n        #print(g)\\n        for j in g:\\n            anss += (c2 - j) * j\\n        g = []\\n        c1 = 1\\n        c2 = 1\\n        prev = (huhh[0], huhh[1])\\n        continue\\n    c2 += 1\\n    if huhh[1] != prev[1]:\\n        g.append(c1)\\n        c1 = 0\\n        prev = (huhh[0], huhh[1])\\n    c1 += 1\\nprint(anss)\\n\", \"#!/usr/bin/env python3\\n\\n[n, a, b] = list(map(int, input().strip().split()))\\nbis = [tuple(map(int, input().strip().split())) for _ in range(n)]\\ndis = [(a * Vx - Vy, Vx) for x, Vx, Vy in bis]\\n\\ndis.sort()\\n\\nres = 0\\ndprev = dis[0][0] - 1\\nvprev = 0\\ndcount = 0\\nvcount = 0\\nfor di, vi in dis:\\n\\tif di != dprev:\\n\\t\\tres += dcount * (dcount - 1)\\n\\t\\tres -= vcount * (vcount - 1)\\n\\t\\tdcount = 1\\n\\t\\tvcount = 1\\n\\t\\tdprev = di\\n\\t\\tvprev = vi\\n\\telse:\\n\\t\\tdcount += 1\\n\\t\\tif vi != vprev:\\n\\t\\t\\tres -= vcount * (vcount - 1)\\n\\t\\t\\tvcount = 1\\n\\t\\t\\tvprev = vi\\n\\t\\telse:\\n\\t\\t\\tvcount += 1\\nres += dcount * (dcount - 1)\\nres -= vcount * (vcount - 1)\\n\\nprint (res)\\n\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n_OUTPUT_BUFFER = io.StringIO()\\nsys.stdout = _OUTPUT_BUFFER\\n\\n@atexit.register\\ndef write():\\n    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n    \\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a*x+b + vy\\n        dd = a*nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx,vy) not in dc[dd]:\\n            dc[dd][(vx,vy)] = 0\\n        dc[dd][(vx,vy)] += 1\\n    \\n    tot = 0\\n    for v,k in list(dc.items()):\\n        tt = 0\\n        pp =0\\n        for _,cc in list(k.items()):\\n            tt -= cc * (cc+1) // 2\\n            pp += cc\\n        tt += pp * (pp+1) // 2\\n        tot += tt*2\\n    print(tot)\\n        \\n\\n    \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n, a, b = map(int, input().split())\\nghosts = [(vx, vy) for x, vx, vy in (map(int, input().split()) for i in range(n))]\\nspeeds = {}\\nfor vx, vy in ghosts:\\n    vl = a * vx - vy\\n    k = vx + a * vy\\n    ss = speeds.setdefault(vl, {})\\n    ss[k] = ss.get(k, 0) + 1\\n\\nresult = 0\\nfor vl, ss in speeds.items():\\n    group_size = sum(ss.values())\\n    for sss in ss.values():\\n        result += sss * (group_size - sss)\\nprint(result)\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n_OUTPUT_BUFFER = io.StringIO()\\nsys.stdout = _OUTPUT_BUFFER\\n\\n\\n@atexit.register\\ndef write():\\n    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a * x + b + vy\\n        dd = a * nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx, vy) not in dc[dd]:\\n            dc[dd][(vx, vy)] = 0\\n        dc[dd][(vx, vy)] += 1\\n\\n    tot = 0\\n    for v, k in dc.items():\\n        tt = 0\\n        pp = 0\\n        for _, cc in k.items():\\n            tt -= cc * (cc + 1) // 2\\n            pp += cc\\n        tt += pp * (pp + 1) // 2\\n        tot += tt * 2\\n    print(tot)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a * x + b + vy\\n        dd = a * nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx, vy) not in dc[dd]:\\n            dc[dd][(vx, vy)] = 0\\n        dc[dd][(vx, vy)] += 1\\n\\n    tot = 0\\n    for v, k in dc.items():\\n        tt = 0\\n        pp = 0\\n        for _, cc in k.items():\\n            tt -= cc * (cc + 1) // 2\\n            pp += cc\\n        tt += pp * (pp + 1) // 2\\n        tot += tt * 2\\n    print(tot)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from sys import stdin\\nrd = lambda: list(map(int, input().split()))\\ng = lambda x, i: x.get(i, 0)\\nn, a, b = rd()\\nc, d = {}, {}\\nr = 0\\nfor z in range(n):\\n    _, x, y = rd()\\n    i, j = a * x - y, (x, y)\\n    r += g(c, i) - g(d, j)\\n    c[i] = g(c, i) + 1\\n    d[j] = g(d, j) + 1\\nprint(2 * r)\\n\", \"\\ndef main():\\n    n, a, b = [int(part) for part in input().split()]\\n    ghosts = []\\n    for i in range(n):\\n        ghosts.append([int(part) for part in input().split()])\\n\\n    cnt = dict()\\n    vcnt = dict()\\n    for (x, vx, vy) in ghosts:\\n        if (vx, vy) in vcnt:\\n            vcnt[(vx, vy)] += 1\\n        else:\\n            vcnt[(vx, vy)] = 1\\n\\n        tmp = vy - a * vx\\n        if tmp in cnt:\\n            cnt[tmp] += 1\\n        else:\\n            cnt[tmp] = 1\\n\\n    ans = 0\\n    for (x, vx, vy) in ghosts:\\n        tmp = vy - a * vx\\n        ans += cnt[tmp] - vcnt[(vx, vy)]\\n\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\nn,a,b=[int(_) for _ in input().split()]\\ns,s1=Counter(),Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=[int(_) for _ in input().split()]\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s1[(vx,vy)]\\n\\ts[tmp]+=1\\n\\ts1[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nn,a,b=map(int,input().split())\\ns,s1=Counter(),Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,input().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s1[(vx,vy)]\\n\\ts[tmp]+=1\\n\\ts1[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nn,a,b=map(int,input().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,input().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import defaultdict\\n\\nn, a, b = map(int, input().split())\\n\\nres = defaultdict(lambda :0)\\nt = defaultdict(lambda :0)\\n\\nans = 0\\n\\nfor _ in range(n):\\n    k, x, y = map(int, input().split())\\n    ans += res[a*x-y] - t[(x,y)]\\n    res[a*x-y]+=1\\n    t[(x,y)]+=1\\n\\nprint(ans*2)\", \"from collections import Counter\\nfrom sys import stdin\\nn,a,b=map(int,stdin.readline().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,stdin.readline().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nfrom sys import stdin\\nn,a,b=map(int,stdin.readline().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,stdin.readline().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"# http://codeforces.com/contest/975/problem/D\\nn, a, b = (int(x) for x in input().split())\\n\\nmarks = 0\\nk = {}\\nv = {}\\nfor i in range(0, n):\\n    x, v1, v2 = [int(x) for x in input().split()]\\n    ki = v2 - a * v1\\n    vi = (v1, v2)\\n\\n    if ki in k:\\n        k[ki] += 1\\n    else:\\n        k[ki] = 1\\n\\n    if vi in v:\\n        v[vi] += 1\\n    else:\\n        v[vi] = 1\\n\\n    marks += k[ki] - v[vi]\\n\\nprint(marks * 2)\", \"import bisect;\\nn, a, b = map(int, input().split(' '));\\nx=[0]*n;\\nvx=[0]*n;\\nvy=[0]*n;\\nfor i in range(n):\\n    x[i], vx[i], vy[i]=map(int, input().split(' '));\\n#y=ax y-ax=0 (x, y)* (-a, 1)=0 (-a, 1) - \\u0432\\u0435\\u043a\\u0442\\u043e\\u0440 \\u043d\\u043e\\u0440\\u043c\\u0430\\u043b\\u0438\\nntypes=dict();\\nfor i in range(n):\\n    ntype=-a*vx[i]+1*vy[i];\\n    currSet=ntypes.get(ntype, set());\\n    currSet.add(i);\\n    ntypes[ntype]=currSet;\\nresult=0;\\nfor key in ntypes.keys():\\n    currSet=ntypes[key];\\n    currLen=len(currSet);\\n    vtypes=dict();\\n    for i in currSet:\\n        vtype=vx[i]*1+vy[i]*a;\\n        vtypes[vtype]=vtypes.get(vtype, 0)+1;\\n    for key in vtypes.keys():\\n        curr=vtypes[key];\\n        result+=curr*(currLen-curr)\\nprint(result);\", \"#!/usr/bin/env python3\\n\\nfrom collections import Counter\\n\\n[n, a, b] = list(map(int, input().strip().split()))\\nbis = [tuple(map(int, input().strip().split())) for _ in range(n)]\\ndis = [(a * Vx - Vy, Vx) for x, Vx, Vy in bis]\\n\\ndis.sort()\\n\\ndef count(d):\\n\\treturn sum((v * k * (k - 1) for k, v in d))\\n\\ndef filt(it):\\n\\treturn list(Counter(list(Counter(it).values())).items())\\n\\nc_plus = count(filt((x for x, y in dis)))\\nc_minus = count(filt(dis))\\n\\nprint(c_plus - c_minus)\\n\", \"import sys\\nimport math\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\n\\nd = {}\\ns = {}\\nn, a, b = list(map(int,sys.stdin.readline().strip().split(' ')))\\nfor n0 in range(n):\\n\\tx,vxi,vyi = list(map(int,sys.stdin.readline().strip().split(' ')))\\n\\tcurr = a*vxi - vyi\\n\\tif curr in d:\\n\\t\\tif (vxi,vyi) in d[curr]:\\n\\t\\t\\td[curr][(vxi,vyi)] += 1\\n\\t\\telse:\\n\\t\\t\\td[curr][(vxi,vyi)] = 1\\n\\t\\ts[curr] += 1\\n\\telse:\\n\\t\\td[curr] = {(vxi,vyi):1}\\n\\t\\ts[curr] = 1\\n\\nans = 0\\nfor k,v in list(d.items()):\\n\\tfor vxy,q in list(v.items()):\\n\\t\\tans += (s[k] - q)*q\\nprint(ans)\\n\\n\\n\\t\\n\", \"3\\n\\nfrom sys import stdin\\nfrom itertools import groupby\\n\\n\\ndef f(line):\\n    t = line.split()\\n    return tuple(int(x) for x in t[1:])\\n\\n\\nn, a, b = [int(x) for x in stdin.readline().split()]\\npoints = sorted(f(line) for line in stdin.readlines()[:n])\\ngroups = [[k, len(tuple(g))] for k, g in groupby(points)]\\ntotal = {}\\nfor (x, y), cnt in groups:\\n    if y - x * a not in total:\\n        total[y - x * a] = 0\\n    total[y - x * a] += cnt\\nans = 0\\nfor (x, y), cnt in groups:\\n    if y - x * a not in total:\\n        continue\\n    ans += cnt * (total[y - x * a] - cnt)\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "3 1 0\n0 0 0\n1 0 0\n2 0 0\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/975/D"
    },
    {
        "id": 736,
        "task_id": 2733,
        "test_case_id": 4,
        "question": "In this problem, we are simulating the dynamics of moving objects. The objects are droplets that are modeled in two dimensions as circles of various sizes, each moving at a constant velocity. When two circles touch they combine (i.e., agglomerate) into a single circular droplet with an area equal to the sum of the areas of the two combining droplets. The newly formed droplet’s position is the area-weighted average position of the two droplets at the time of contact and its velocity is the area-weighted average velocity of the two circles. (See the following example.)The figure to the right illustrates the process of agglomeration. In the top panel of that figure, we see the leftmost droplet with radius $4$ centered at position $(-14,0)$ and with velocity $(1,0)$ moving toward a stationary droplet of radius $3$ centered at the origin. The two droplets make contact at time $t=7.0$ as shown in the middle panel of the figure. \n\nThe droplet with radius $4$ is centered at $(-7,0)$ at the time that the two droplets agglomerate into a single new droplet. The two original droplets have areas $16\\pi $ and $9\\pi $, respectively, and thus the new droplet has area $25\\pi $ and thus radius $5$. The $x$-coordinate of the aggolomerated droplet is equal to $\\frac{16}{25} \\cdot (-7.0) + \\frac{9}{25} \\cdot 0.0 = -4.48$. The $y$-coordinate is $\\frac{16}{25} \\cdot 0.0 + \\frac{9}{25} \\cdot 0.0 = 0.0$. By similar calculations, the velocity of the aggolomeration is $(0.64, 0)$.\n\nGiven an initial configuration of droplets, your goal is to simulate their motion until reaching the final time at which an agglomeration occurs (if any). All test sets have been crafted to assure that:\n - The original droplets do not touch each other.\n - When a new droplet is formed from an agglomeration, the new droplet will not immediately be touching any other droplets. (In fact, it will be at least $0.001$ away from any other droplets.)\n - No two droplets will ever pass each other with only a single point of intersection. (In fact, changing the radius of any drop by $\\pm 0.001$ will not effect whether it collides with another.)\n - No two pairs of droplets will ever collide at precisely the same time. (In fact, all agglomerations will be separated in time by at least $0.001$.)\n - No agglomerations will occur beyond time $t=10^9$.\n\n-----Input-----\nThe input consists of a description of the original configuration. The first line contains the original number of droplets, $2 \\leq N \\leq 100$. This is followed by $N$ lines of data, each containing five integers, $x$, $y$, $v_ x$, $v_ y$, $r$, respectively specifying the $x$-coordinate of the center, the $y$-coordinate of the center, the $x$-component of the velocity, the $y$-component of the velocity, and the radius. These quantities are bounded such that $-10000 \\leq x,y,v_ x,v_ y \\leq 10000$ and $1 \\leq r \\leq 100$.\n\n\n\n\n-----Output-----\nOutput a single line with two values $k$ and $t$, where $k$ is the number of droplets in the final configuration and $t$ is the time at which the final agglomeration occurred. If a data set results in no agglomerations, $k$ will be the original number of droplets and $0$ should be reported as the time. The value of time should be reported to have an absolute or relative error of no more than $10^{-3}$.\n\n-----Examples-----\nSample Input 1:\n2\n-2 0 2 0 1\n2 0 0 0 1\nSample Output 1:\n1 1.0\n\nSample Input 2:\n2\n-2 0 -2 0 1\n2 0 -2 1 1\nSample Output 2:\n2 0.0\n\nSample Input 3:\n4\n-8 0 2 -2 2\n0 -8 -2 2 2\n2 8 0 -4 3\n8 2 -4 0 3\nSample Output 3:\n1 2.0",
        "solutions": "",
        "difficulty": "interview",
        "input": "4\n-8 3 3 0 2\n-2 4 2 0 2\n2 -2 2 0 2\n8 -2 0 0 2\n",
        "output": "1 5.78474956\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/agglomerator"
    },
    {
        "id": 737,
        "task_id": 3474,
        "test_case_id": 1,
        "question": "You are in a game of laser tag, where the goal is to shoot and hit other players with the laser gun you are carrying. Running up to them and shooting sometimes works, but it leaves you more vulnerable to their counterattack than you would like. You have found that you can be sneakier if you bounce your shot off of a mirror before it hits them. This allows you to shoot around a corner, for example.\n\nTo practice your shots, you shoot at a wall (the target) by reflecting your shot off of a mirror. Write a program that tells you where on the target wall your laser would strike when shooting from different locations. The wall is considered to be infinitely long at $x=0$.\n\n-----Input-----\nInput consists of up to $1500$ test cases. Each test case consists of six space-separated real values, $x_1~ y_1~ x_2~ y_2~ x_3~ y_3$. The first four numbers represent the endpoints of the mirror, and the last two represent your position. You can be sure that $x_1 \\neq x_2$, or $y_1 \\neq y_2$, or both. You can also be sure that $x_1\\cdot x_2>0$. You are not standing on the mirror. All coordinates are in the range $[-100,100]$ with at most $5$ digits past the decimal point. Input ends at end of file.\n\n-----Output-----\nFor each test case, report the $y$-coordinates of the range of locations on the wall that you can hit if you shoot at the mirror. Hitting either side of the (infinitely thin) wall is considered a hit. Report the coordinates from least to greatest. If you can hit an infinitely-long section of the mirror, use the terms negative-infinity or positive-infinity as appropriate. Ignore any potential occlusions, such as the laser hitting you, or the laser hitting the wall before getting to the mirror. Numeric answers should be accurate to within $0.0001$ units. If you can’t hit the wall at all, output can't hit the wall.\n\n-----Examples-----\nSample Input:\n5 10 10 10 10 0\n5 10 10 5 10 0\n6 10 10 10 10 0\nSample Output:\nnegative-infinity 0\n5 12.5\nnegative-infinity -5",
        "solutions": "",
        "difficulty": "competition",
        "input": "5 10 10 10 10 0\n5 10 10 5 10 0\n6 10 10 10 10 0\n",
        "output": "negative-infinity 0\n5 12.5\nnegative-infinity -5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/sneakattack"
    },
    {
        "id": 738,
        "task_id": 3483,
        "test_case_id": 2,
        "question": "The Miniature Toy Association (or MTA for short) is releasing the latest edition of its brand of collectible figurines. MTA used to sell them individually, but now has decided to adopt a new business strategy that involves randomly choosing $4$ figurines from the entire collection to be packaged and sold together as a ‘$4$-pack’. Each figurine in a $4$-pack is chosen independently and randomly with uniform distribution. As such, it is possible that a $4$-pack may contain multiple copies of a particular figurine.\n\nEven though some figurines may be more valuable than others, every randomly assembled $4$-pack is sold at the same price. Customers buying a $4$-pack of figurines do not know ahead of time which figurines will be inside, and so it is a matter of chance whether they get the figurines that they want most. While the price is the same across all $4$-packs, the weight is not, as each figurine has a distinct integer weight in grams.\n\nBefore MTA releases its new line of figurines, its Chief Financial Officer (CFO) would like an executive summary with information about the proposed $4$-packs. Specifically, the CFO wants to know: the greatest possible weight of a $4$-pack, the smallest possible weight of a $4$-pack, the number of distinct weights that a $4$-pack could have, and the expected weight of a $4$-pack. Note that the expected weight is the average (mean) weight across all possible distinct $4$-packs, where two $4$-packs are distinct if and only if one $4$-pack has a different number of figurines of any particular weight than the other $4$-pack. So, for example, a $4$-pack with weights $\\{ 2,2,3,5\\} $ is distinct from a $4$-pack with weights $\\{ 2,3,3,4\\} $ (even though they both have the same total weight). Also, a $4$-pack with weights $\\{ 2,2,3,5\\} $ is distinct from a 4-pack with weights $\\{ 2,3,3,5\\} $.\n\n-----Input-----\nThe input consists of a single test case. The first line of the input contains a single integer $N$, the number of different figurines to be produced, where $1\\leq N\\leq 40000$. The next line contains $N$ space-separated integers representing the weight in grams of each of the figurines. Each weight, $k$, is an integer satisfying $1\\leq k\\leq 60000$, and all $N$ weights are distinct.\n\n-----Output-----\nThe output should consist of a single line with $4$ space-separated values. The first value should be an integer, the maximum weight of a $4$-pack in grams for the given set of figurines. The second value should be an integer, the minimum weight of a $4$-pack in grams for the given set of figurines. The third value should be an integer, the number of distinct weights that the $4$-packs can have for the given set of figurines. The fourth value should be a floating-point value, the expected weight of a $4$-pack in grams for the given set of figurines, with an absolute or relative error of at most $10^{-4}$.\n\n-----Examples-----\nSample Input:\n4\n1 2 4 7\nSample Output:\n28 4 21 14.0",
        "solutions": "",
        "difficulty": "competition",
        "input": "3\n2 5 4\n",
        "output": "20 8 12 14.66666667\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/figurinefigures"
    },
    {
        "id": 739,
        "task_id": 3573,
        "test_case_id": 1,
        "question": "Cesar and Raul like betting and good food, in no particular order. They want to try out a new fancy restaurant and they decided to make a bet – they are going to play a game and the loser pays for dinner.\n\nThey have a box with $N$ balls. Each ball contains a distinct number between $1$ and $N$. Then, the game proceeds with these steps:\n - Initially, each person picks $C$ distinct numbers between $1$ and $N$ and writes them down on a separate card.\n - In each round, $D$ balls are drawn from the box uniformly at random. Cesar and Raul mark the ball numbers that appear on their respective card. The $D$ balls are then returned to the box.\n - The game stops when a player has marked all the numbers he chose. That player is the winner. If both players finish at the same time, it is a draw and they will split the dinner.\n\nThey are quite eager to try out this new restaurant and they’re now wondering: how many rounds will the game last until at least one of the players has marked all his numbers?\n\n-----Task-----\nGiven the number $N$ of balls, the number $D$ of balls they draw from the box in each round, the amount $C$ of numbers in their cards and the numbers they wrote down, find the expected number of rounds the game will last.\n\n-----Input-----\nThe first line of the input consists of three space separated integers: $N$, $D$, and $C$. $N$ is the number of balls, $D$ is the number of balls drawn in each round, and $C$ is the cards’ size. Each of the following two lines contains $C$ space separated integers: the numbers Cesar and Raul wrote down, respectively.\n\n-----Constraints-----\n\n$1$\n\n$\\leq $\n\n$N$\n\n$\\leq $\n\n$50$\n\nNumber of balls in the box\n\n$1$\n\n$\\leq $\n\n$D$\n\n$\\leq $\n\n$\\min (10, N)$\n\nNumber of balls drawn in each round\n\n$1$\n\n$\\leq $\n\n$C$\n\n$\\leq $\n\n$\\min (10, N)$\n\nCards’ sizeOutput\n\nThe output is the expected number of rounds of the game.\n\nThe result will be considered correct as long as the absolute error does not exceed $10^{-3}$.\n\n-----Explanation for Sample Input 1-----\nThere are $2$ balls. Cesar picked number $1$ and Raul picked number $2$. In the first round, either number $1$ or $2$ will be drawn and so one of them wins right away.\n\n-----Examples-----\nSample Input:\n2 1 1\n1\n2\nSample Output:\n1.00000000",
        "solutions": "",
        "difficulty": "competition",
        "input": "2 1 1\n1\n2\n",
        "output": "1.00000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/dinnerbet"
    },
    {
        "id": 740,
        "task_id": 3803,
        "test_case_id": 21,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "11 1 1\n100 1 1\n100 1 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 741,
        "task_id": 3803,
        "test_case_id": 23,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "10 100 1\n1 100 100\n100 1 9\n",
        "output": "811\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 742,
        "task_id": 3803,
        "test_case_id": 28,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n1 1 1\n1 1 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 743,
        "task_id": 3803,
        "test_case_id": 29,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n1 1 1\n100 100 100\n",
        "output": "100\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 744,
        "task_id": 3803,
        "test_case_id": 32,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "100 100 100\n100 100 100\n100 100 100\n",
        "output": "100\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 745,
        "task_id": 3803,
        "test_case_id": 34,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "50 100 51\n100 100 100\n1 100 100\n",
        "output": "1384\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 746,
        "task_id": 3803,
        "test_case_id": 37,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 100 1\n100 100 100\n1 100 100\n",
        "output": "1990\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 747,
        "task_id": 3803,
        "test_case_id": 38,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "100 100 1\n100 100 100\n1 100 100\n",
        "output": "1891\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 748,
        "task_id": 3862,
        "test_case_id": 26,
        "question": "Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration $\\frac{a_{i}}{1000}$. Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration $\\frac{n}{1000}$. The drink should also be tasty, so the glass can contain only integer number of liters of each Coke type (some types can be not presented in the glass). Also, they want to minimize the total volume of Coke in the glass.\n\nCarbon dioxide concentration is defined as the volume of carbone dioxide in the Coke divided by the total volume of Coke. When you mix two Cokes, the volume of carbon dioxide sums up, and the total volume of Coke sums up as well.\n\nHelp them, find the minimal natural number of liters needed to create a glass with carbon dioxide concentration $\\frac{n}{1000}$. Assume that the friends have unlimited amount of each Coke type.\n\n\n-----Input-----\n\nThe first line contains two integers n, k (0 ≤ n ≤ 1000, 1 ≤ k ≤ 10^6) — carbon dioxide concentration the friends want and the number of Coke types.\n\nThe second line contains k integers a_1, a_2, ..., a_{k} (0 ≤ a_{i} ≤ 1000) — carbon dioxide concentration of each type of Coke. Some Coke types can have same concentration.\n\n\n-----Output-----\n\nPrint the minimal natural number of liter needed to prepare a glass with carbon dioxide concentration $\\frac{n}{1000}$, or -1 if it is impossible.\n\n\n-----Examples-----\nInput\n400 4\n100 300 450 500\n\nOutput\n2\n\nInput\n50 2\n100 25\n\nOutput\n3\n\n\n\n-----Note-----\n\nIn the first sample case, we can achieve concentration $\\frac{400}{1000}$ using one liter of Coke of types $\\frac{300}{1000}$ and $\\frac{500}{1000}$: $\\frac{300 + 500}{1000 + 1000} = \\frac{400}{1000}$.\n\nIn the second case, we can achieve concentration $\\frac{50}{1000}$ using two liters of $\\frac{25}{1000}$ type and one liter of $\\frac{100}{1000}$ type: $\\frac{25 + 25 + 100}{3 \\cdot 1000} = \\frac{50}{1000}$.",
        "solutions": "[\"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\", \"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"from collections import deque\\n\\nMAX_A = 1000\\n     \\n     \\ndef main():\\n    n, k = map(int, input().split())\\n    a = set(int(x) - n for x in input().split())\\n     \\n    visited = [False] * (2 * MAX_A + 1)\\n    visited[n] = True\\n    Q = deque()\\n    Q.append((n, 0))\\n     \\n    result = None\\n    while Q:\\n        u, l = Q.popleft()\\n        l += 1\\n        for ai in a:\\n            v = u + ai\\n            if v == n:\\n                result = l\\n                break\\n            if 0 <= v < len(visited) and not visited[v]:\\n                visited[v] = True\\n                Q.append((v, l))\\n     \\n        if result is not None:\\n            break\\n     \\n    if result is None:\\n        result = -1\\n     \\n    print(result)\\n     \\n     \\ndef __starting_point():\\n    # import sys\\n    # sys.stdin = open(\\\"E.txt\\\")\\n    main()\\n__starting_point()\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nd = set(int(x)-n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for i in d:\\n    \\tif i + u == 0:\\n    \\t\\t\\n    \\t\\tans = dist[u] + 1\\n    \\t\\tfound = True\\n    \\t\\tbreak     \\n    \\tif i + u <= 1000 and i + u >= -1000 and not visited[i + u]:\\n    \\t\\tvisited[i + u] = True\\n    \\t\\tdist[i + u] = dist[u] + 1\\n    \\t\\tq.append(i + u)\\n    \\n    if found:\\n    \\tbreak\\n    \\nprint (ans)\\n\\n\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nconc = set(int(x) - n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for c in conc:\\n        v = c + u\\n        if v == 0:\\n            ans=dist[u]+1\\n            found=True\\n            break\\n        if v<=1000 and v>=-1000 and not visited[v]:\\n            visited[v]=True\\n            dist[v]=dist[u]+1\\n            q.append(v)\\n    if found:\\n    \\tbreak\\n    \\nprint(ans)\\n\\n\"]",
        "difficulty": "competition",
        "input": "508 15\n0 998 997 1 1 2 997 1 997 1000 0 3 3 2 4\n",
        "output": "53\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/788/C"
    },
    {
        "id": 749,
        "task_id": 3862,
        "test_case_id": 34,
        "question": "Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration $\\frac{a_{i}}{1000}$. Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration $\\frac{n}{1000}$. The drink should also be tasty, so the glass can contain only integer number of liters of each Coke type (some types can be not presented in the glass). Also, they want to minimize the total volume of Coke in the glass.\n\nCarbon dioxide concentration is defined as the volume of carbone dioxide in the Coke divided by the total volume of Coke. When you mix two Cokes, the volume of carbon dioxide sums up, and the total volume of Coke sums up as well.\n\nHelp them, find the minimal natural number of liters needed to create a glass with carbon dioxide concentration $\\frac{n}{1000}$. Assume that the friends have unlimited amount of each Coke type.\n\n\n-----Input-----\n\nThe first line contains two integers n, k (0 ≤ n ≤ 1000, 1 ≤ k ≤ 10^6) — carbon dioxide concentration the friends want and the number of Coke types.\n\nThe second line contains k integers a_1, a_2, ..., a_{k} (0 ≤ a_{i} ≤ 1000) — carbon dioxide concentration of each type of Coke. Some Coke types can have same concentration.\n\n\n-----Output-----\n\nPrint the minimal natural number of liter needed to prepare a glass with carbon dioxide concentration $\\frac{n}{1000}$, or -1 if it is impossible.\n\n\n-----Examples-----\nInput\n400 4\n100 300 450 500\n\nOutput\n2\n\nInput\n50 2\n100 25\n\nOutput\n3\n\n\n\n-----Note-----\n\nIn the first sample case, we can achieve concentration $\\frac{400}{1000}$ using one liter of Coke of types $\\frac{300}{1000}$ and $\\frac{500}{1000}$: $\\frac{300 + 500}{1000 + 1000} = \\frac{400}{1000}$.\n\nIn the second case, we can achieve concentration $\\frac{50}{1000}$ using two liters of $\\frac{25}{1000}$ type and one liter of $\\frac{100}{1000}$ type: $\\frac{25 + 25 + 100}{3 \\cdot 1000} = \\frac{50}{1000}$.",
        "solutions": "[\"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\", \"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"from collections import deque\\n\\nMAX_A = 1000\\n     \\n     \\ndef main():\\n    n, k = map(int, input().split())\\n    a = set(int(x) - n for x in input().split())\\n     \\n    visited = [False] * (2 * MAX_A + 1)\\n    visited[n] = True\\n    Q = deque()\\n    Q.append((n, 0))\\n     \\n    result = None\\n    while Q:\\n        u, l = Q.popleft()\\n        l += 1\\n        for ai in a:\\n            v = u + ai\\n            if v == n:\\n                result = l\\n                break\\n            if 0 <= v < len(visited) and not visited[v]:\\n                visited[v] = True\\n                Q.append((v, l))\\n     \\n        if result is not None:\\n            break\\n     \\n    if result is None:\\n        result = -1\\n     \\n    print(result)\\n     \\n     \\ndef __starting_point():\\n    # import sys\\n    # sys.stdin = open(\\\"E.txt\\\")\\n    main()\\n__starting_point()\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nd = set(int(x)-n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for i in d:\\n    \\tif i + u == 0:\\n    \\t\\t\\n    \\t\\tans = dist[u] + 1\\n    \\t\\tfound = True\\n    \\t\\tbreak     \\n    \\tif i + u <= 1000 and i + u >= -1000 and not visited[i + u]:\\n    \\t\\tvisited[i + u] = True\\n    \\t\\tdist[i + u] = dist[u] + 1\\n    \\t\\tq.append(i + u)\\n    \\n    if found:\\n    \\tbreak\\n    \\nprint (ans)\\n\\n\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nconc = set(int(x) - n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for c in conc:\\n        v = c + u\\n        if v == 0:\\n            ans=dist[u]+1\\n            found=True\\n            break\\n        if v<=1000 and v>=-1000 and not visited[v]:\\n            visited[v]=True\\n            dist[v]=dist[u]+1\\n            q.append(v)\\n    if found:\\n    \\tbreak\\n    \\nprint(ans)\\n\\n\"]",
        "difficulty": "competition",
        "input": "1000 10\n0 1 2 3 4 5 6 7 8 9\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/788/C"
    },
    {
        "id": 750,
        "task_id": 4615,
        "test_case_id": 2,
        "question": "Snuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n - Operation 1: Pour 100A grams of water into the beaker.\n - Operation 2: Pour 100B grams of water into the beaker.\n - Operation 3: Put C grams of sugar into the beaker.\n - Operation 4: Put D grams of sugar into the beaker.\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\nSnuke will make sugar water with the highest possible density.\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\n-----Constraints-----\n - 1 \\leq A < B \\leq 30\n - 1 \\leq C < D \\leq 30\n - 1 \\leq E \\leq 100\n - 100A \\leq F \\leq 3 000\n - A, B, C, D, E and F are all integers.\n\n-----Inputs-----\nInput is given from Standard Input in the following format:\nA B C D E F\n\n-----Outputs-----\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\n-----Sample Input-----\n1 2 10 20 15 200\n\n-----Sample Output-----\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n - If we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n - If we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.",
        "solutions": "[\"a, b, c, d, e, f = map(int, input().split())\\ns = set()\\nfor i in range(30 // a + 1):\\n    for j in range(30 // b + 1):\\n        if 0 < (a * i + b * j) * 100 <= f:\\n            s = s | {a * i + b * j}\\ns2 = set()\\nfor i in range(3000 // c + 1):\\n    for j in range(3000 // d + 1):\\n        if c * i + d * j <= f:\\n            s2 = s2 | {c * i + d * j}\\nans = []\\nfor i in s:\\n    for j in s2:\\n        if i * 100 + j <= f and j <= i * e:\\n            ans.append([j / i * -1, i * 100 + j, j])\\nans.sort()\\nprint(ans[0][1], ans[0][2])\", \"A,B,C,D,E,F = map(int,input().split())\\n\\nconcentration = 0\\nans = [A*100,0]\\n\\nwater = []\\nfor a in range(F//(A*100) + 1):\\n  for b in range(((F-a*A*100)//(B*100))+1):\\n    water.append((a*A+b*B)*100)\\n    \\nwater = sorted(list(set(water)))\\n\\nsugar = []\\nfor c in range(F//C + 1):\\n  for d in range(((F - c*C)//D)+1):\\n    sugar.append(c*C+d*D)\\nsugar = sorted(list(set(sugar)))\\n\\n\\nfor wa in water:\\n  for su in sugar:\\n    if wa + su <= F:\\n      if su <= (wa/100)*E:\\n        if wa != 0:\\n          if concentration < su/(su+wa):\\n            concentration = su/(su+wa)\\n            ans = [su+wa,su]\\n\\nprint(\\\" \\\".join(map(str,ans)))\", \"A,B,C,D,E,F = map(int,input().split())\\nmx =- 1\\nS = set()\\nW = set()\\n\\nfor a in range(0,F+1,100*A):\\n  for b in range(0,F+1-a,100*B):\\n    W.add(a+b)\\n\\nfor c in range(0,F+1,C):\\n  for d in range(0,F+1-c,D):\\n    S.add(c+d)\\n\\nfor w in W:\\n  for s in S:\\n    if 0<w+s<=F and s<=w*E//100:\\n      if mx<s/(w+s):\\n        ans=w+s,s\\n        mx=s/(w+s)\\n\\nprint(ans[0],ans[1])\", \"a,b,c,d,e,f=map(int,input().split())\\nw=set()\\nfor i in range(0,f,100*a):\\n    for j in range(0,f,100*b):\\n        if i+j<=f:\\n            w.add(i+j)\\n        else:\\n            break\\ns=set()\\nfor i in range(0,f,c):\\n    for j in range(0,f,d):\\n        if i+j<=f:\\n            s.add(i+j)\\n        else:\\n            break\\nn=100*a\\nm=0\\nl=0\\nfor x in w:\\n    for t in s:\\n        if x+t!=0 and x+t<=f and 100*t<=e*x and t/(x+t)>l:\\n            n=x+t\\n            m=t\\n            l=t/(x+t)\\nprint(n,m)\", \"A,B,C,D,E,F = map(int,input().split())\\nmx =- 1\\nS = set()\\nW = set()\\n\\nfor a in range(0,F+1,100*A):\\n  for b in range(0,F+1-a,100*B):\\n    W.add(a+b)\\n\\nfor c in range(0,F+1,C):\\n  for d in range(0,F+1-c,D):\\n    S.add(c+d)\\n\\nfor w in W:\\n  for s in S:\\n    if 0<w+s<=F and s<=w*E//100:\\n      if mx<s/(w+s):\\n        ans=w+s,s\\n        mx=s/(w+s)\\n\\nprint(ans[0],ans[1])\", \"a, b, c, d, e, f = map(int, input().split())\\n\\nwater = [False] * (f//100 + 1)\\nfor i in range(0, len(water), a):\\n    water[i] = True\\nfor i in range(len(water) - b):\\n    if water[i]:\\n        water[i + b] = True\\n\\nsugar = [False] * ((f//100) * e + 1)\\nfor i in range(0, len(sugar), c):\\n    sugar[i] = True\\nfor i in range(len(sugar) - d):\\n    if sugar[i]:\\n        sugar[i + d] = True\\n\\n# denominator: \\u5206\\u6bcd, numerator: \\u5206\\u5b50\\ndeno = a * 100\\nnume = 0\\n\\nfor i in range(1, len(water)):\\n    if water[i]:\\n        j = min([i*e, f - 100*i])\\n        while not sugar[j]:\\n            j -= 1\\n        i = 100 * i + j\\n\\n        if nume * i < deno * j:\\n            deno = i\\n            nume = j\\n\\nprint(deno, nume)\", \"a, b, c, d, e, f = map(int, input().split())\\nW = set(); S = set()\\nsa = 0; wsa = a * 100\\nfor i in range(0, f + a * 100, a * 100):\\n    for j in range(0, f + b * 100, b * 100):\\n        w = i + j\\n        if w <= f:\\n            W.add(w)\\n        else:\\n            break\\nfor i in range(0, f // 2 + c, c):\\n    for j in range(0, f // 2 + d, d):\\n        s = i + j\\n        if s <= f // 2:\\n            S.add(s)\\n        else:\\n            break\\nS.remove(0)\\nfor i in W:\\n    for j in S:\\n        if e / (100 + e) >= j / (i + j) > sa / wsa and i + j <= f:\\n            sa, wsa = j, i + j\\nprint(wsa, sa)\", \"import bisect, heapq\\n\\na, b, c, d, e, f = map(int, input().split())\\n\\nw = set()\\ntemp = [a * i for i in range((30 - 1) // a + 2)]\\nfor i in temp:\\n    while i not in w and i <= 30:\\n        w.add(i)\\n        i += b\\nw = list(w)\\nw.remove(0)\\nw.sort()\\n\\ns = set()\\ntemp = [c * i for i in range((3000 - 1) // c + 2)]\\nfor i in temp:\\n    while i not in s and i <= 3000:\\n        s.add(i)\\n        i += d\\ns = list(s)\\ns.sort()\\n\\nqueue = []\\nheapq.heapify(queue)\\nfor i in w:\\n    if i * 100 > f:\\n        continue\\n    num = bisect.bisect(s, i * e)\\n    for j in range(num - 1, -1, -1):\\n        if i * 100 + s[j] > f:\\n            continue\\n        heapq.heappush(queue, [-s[j] / i, 100 * i + s[j], s[j]])\\n        break\\nprint(queue[0][1], queue[0][2])\", \"a, b, c, d, e, f = map(int, input().split())\\n\\nans = -1\\nans_water = -1\\nans_sugar = -1\\nfor ia in range(f//(a*100)+2):\\n    water = 100*a*ia\\n    if water > f or water == 0: continue\\n    for ib in range(f//(b*100)+2):\\n        if ib != 0: water += 100*b\\n        if water > f or water == 0: continue\\n        for ic in range(f//c+1):\\n            sugar = c*ic\\n            if sugar/(water//100) > e: continue\\n            for id in range(f//d+1):\\n                if id != 0: sugar+=d\\n                if sugar/(water//100) > e: continue\\n                if sugar + water > f: continue\\n                if (100*sugar)/(sugar+water) > ans:\\n                    ans = (100*sugar)/(sugar+water)\\n                    ans_water = water\\n                    ans_sugar = sugar\\nprint(ans_sugar+ans_water, ans_sugar)\", \"a,b,c,d,e,f=map(int,input().split())\\nans=[-1]*9999\\nans[a*100]=0\\nans[b*100]=0\\nfin=[a*100,0]\\np=0\\nfor i in range(1,f+1):\\n    if ans[i]==-1:\\n        continue\\n    if (ans[i]+c)/(i-ans[i])<=e*0.01:\\n        ans[i+c]=max(ans[i]+c,ans[i+c])\\n    if (ans[i]+d)/(i-ans[i])<=e*0.01:\\n        ans[i+d]=max(ans[i]+d,ans[i+d])\\n    ans[i+a*100]=max(ans[i+a*100],ans[i])\\n    ans[i+b*100]=max(ans[i+b*100],ans[i])\\n    if ans[i]/i>p:\\n        p=ans[i]/i\\n        fin=[i,ans[i]]\\nprint(*fin)\", \"a,b,c,d,e,f = map(int,input().split())\\nans = [-1]*10000\\n# ans[0] = 0\\nans[a*100] = 0\\nans[b*100] = 0\\nq1 = a*100\\nq2 = b*100\\np = 0\\nfin = [a*100,0]\\nfor i in range(1,f+1):\\n    if ans[i] == -1:\\n        continue\\n    if (ans[i]+c)/(i-ans[i]) <= e*0.01:\\n        ans[i+c] = max(ans[i]+c,ans[i+c])\\n    if (ans[i]+d)/(i-ans[i]) <= e*0.01:\\n        ans[i+d] = max(ans[i]+d,ans[i+d])\\n    ans[i+a*100] = max(ans[i+a*100],ans[i])\\n    ans[i+b*100] = max(ans[i+b*100],ans[i])\\n    if i != 0:\\n        if ans[i]/i > p:\\n            # print(p,i)\\n            p = ans[i]/i\\n            fin = [i,ans[i]]\\n# print(ans[190:210])\\nprint(*fin)\", \"A,B,C,D,E,F = (int(T) for T in input().split())\\nSugM = 0\\nWatM = 100*A\\nfor TC in range(0,F+1):\\n    for TD in range(0,F+1):\\n        Suger = C*TC+D*TD\\n        RestS = F-Suger\\n        if RestS>=0:\\n            for TA in range(0,(RestS//100)+1):\\n                for TB in range(0,(RestS//100)+1):\\n                    if TA==TB==0:\\n                        continue\\n                    else:\\n                        Water = TA*A*100+TB*B*100\\n                        RestW = RestS-Water\\n                        if RestW>=0 and Water>=(100*Suger)/E:\\n                            if SugM/(WatM+SugM)<Suger/(Water+Suger):\\n                                SugM = Suger\\n                                WatM = Water\\n                        else:\\n                            break\\n        else:\\n            break\\nprint('{} {}'.format(WatM+SugM,SugM))\", \"a,b,c,d,e,f=map(int,input().split())\\n\\nmax_s=0\\nmax_w=a\\nmax_conc=0\\n\\nwater_s=set()\\nsugar_s=set()\\nfor i in range(f//a//100+1):\\n  aa=a*i\\n  for j in range(f//b//100+1):\\n    bb=b*j\\n    if aa+bb <= f//100:\\n      water_s.add(aa+bb)\\n      \\nfor i in range(f//c+1):\\n  cc=c*i\\n  for j in range(f//d+1):\\n    dd=d*j\\n    if cc+dd <= f:\\n      sugar_s.add(cc+dd)\\n\\nfor w in water_s:\\n  for sg in sugar_s:\\n    if w*100+sg <= f and w*e >= sg and w+sg > 0:\\n      conc=(100*sg)/(100*w+sg)\\n      if max_conc < conc:\\n        max_conc=conc\\n        max_w=w\\n        max_s=sg\\nprint(max_w*100+max_s,max_s)\", \"a,b,c,d,e,f=map(int,input().split())\\ng=[-1]*9999\\ng[a*100]=0\\ng[b*100]=0\\nh=[a*100,0]\\np=0\\nfor i in range(1,f+1):\\n    if g[i]==-1:\\n        continue\\n    if (g[i]+c)/(i-g[i])<=e*0.01:\\n        g[i+c]=max(g[i]+c,g[i+c])\\n    if (g[i]+d)/(i-g[i])<=e*0.01:\\n        g[i+d]=max(g[i]+d,g[i+d])\\n    g[i+a*100]=max(g[i+a*100],g[i])\\n    g[i+b*100]=max(g[i+b*100],g[i])\\n    if g[i]/i>p:\\n        p=g[i]/i\\n        h=[i,g[i]]\\nprint(*h)\", \"import sys\\n\\nsys.setrecursionlimit(10 ** 7)\\ninput = sys.stdin.readline\\nf_inf = float('inf')\\nmod = 10 ** 9 + 7\\n\\n\\ndef resolve():\\n    A, B, C, D, E, F = list(map(int, input().split()))\\n\\n    water = set()\\n    for a in range(F // (A * 100) + 1):\\n        for b in range(F // (B * 100) + 1):\\n            if 0 < a * 100 * A + b * 100 * B <= F:\\n                water.add(a * 100 * A + b * 100 * B)\\n\\n    kouho = []\\n    for w in water:\\n        ma = (E * w) // 100\\n        for c in range(ma // C + 1):\\n            for d in range(ma // D + 1):\\n                sugar = c * C + d * D\\n                if 0 < sugar <= ma and w + sugar <= F:\\n                    kouho.append([w, sugar])\\n\\n    if len(kouho) == 0:\\n        print((list(water)[0], 0))\\n        return\\n\\n    max_noudo = 0\\n    res = []\\n    for w, sugar in kouho:\\n        noudo = sugar / (w + sugar)\\n        if max_noudo < noudo:\\n            max_noudo = noudo\\n            res = [w + sugar, sugar]\\n    print((*res))\\n\\n\\ndef __starting_point():\\n    resolve()\\n\\n__starting_point()\", \"a , b , c , d , e , f = map(int,input().split())\\nmidp = [-1 for i in range(f+1)]\\nmizu = []\\nmidp[0] = 0\\nfor i in range(f+1):\\n    if midp[i] != -1:\\n        if i + a*100 <= f and midp[i+a*100] != 0:\\n            midp[i+a*100] = 0\\n            mizu.append(i+a*100)\\n        if i + b*100 <= f and midp[i+b*100] != 0:\\n            midp[i+b*100] = 0\\n            mizu.append(i+b*100)\\nans = 0\\ncou = [a*100,0]\\nfor i in mizu:\\n    sai = i*e//100\\n    sadp = [-1 for f in range(sai+1)]\\n    sadp[0] = 0\\n    maxsa = 0\\n    for j in range(sai+1):\\n        if sadp[j] != -1:\\n            if j + c <= sai and i + j + c <= f and sadp[j+c] != 0:\\n                sadp[j+c] = 0\\n                maxsa = max(maxsa,j+c)\\n            if j + d <= sai and i + j + d <= f and sadp[j+d] != 0:\\n                sadp[j+d] = 0\\n                maxsa = max(maxsa,j+d)\\n    if ans < maxsa/(i+maxsa):\\n        ans = maxsa/(i+maxsa)\\n        cou = [i+maxsa,maxsa]\\n\\nprint(*cou)\", \"A,B,C,D,E,F = map(int,input().split())\\n\\nws = set()\\nfor a in range(0,F+1,100*A):\\n    for b in range(0,F+1,100*B):\\n        if a+b > F: break\\n        ws.add(a+b)\\nws.remove(0)\\n\\nss = set()\\nfor c in range(0,F+1,C):\\n    for d in range(0,F+1,D):\\n        if c+d > F: break\\n        ss.add(c+d)\\n\\nbest_s = -1\\nbest_w = 1\\nfor w in ws:\\n    for s in ss:\\n        if w+s > F: continue\\n        if E*w < s*100: continue\\n        if best_s * (s+w) < s * (best_s + best_w):\\n            best_s = s\\n            best_w = w\\nprint(best_s+best_w, best_s)\", \"a, b, c, d, e, f = map(int, input().split())\\nW = set(); S = set()\\nsa = 0; wsa = a * 100\\n\\nfor i in range(0, f + a * 100, a * 100):\\n    for j in range(0, f + b * 100, b * 100):\\n        w = i + j\\n        if w <= f:\\n            W.add(w)\\n        else:\\n            break\\nfor i in range(0, f // 2 + c, c):\\n    for j in range(0, f // 2 + d, d):\\n        s = i + j\\n        if s <= f // 2:\\n            S.add(s)\\n        else:\\n            break\\nS.remove(0)\\nfor i in W:\\n    for j in S:\\n        if e / (100 + e) >= j / (i + j) > sa / wsa and i + j <= f:\\n            sa, wsa = j, i + j\\nprint(wsa, sa)\", \"a,b,c,d,e,f=map(int,input().split())\\na=100*a\\nb=100*b\\ndp1=[0]*(f+1)\\ndp2=[0]*(f+1)\\nfor i in range(f+1):\\n    if i%a==0:\\n        if i+a<=f:\\n            dp1[i+a]=1\\nfor i in range(f+1):\\n    if i==0 or dp1[i]==1:\\n        if i+b<=f:\\n            dp1[i+b]=1\\nfor i in range(f+1):\\n    if i%c==0:\\n        if i+c<=f:\\n            dp2[i+c]=1\\nfor i in range(f+1):\\n    if i==0 or dp2[i]==1:\\n        if i+d<=f:\\n            dp2[i+d]=1\\n\\nans=[-1,-1,-1]\\nfor i in range(f+1):\\n    if dp1[i]==1:\\n        x=min(f-i,(i//100)*e)\\n        k=-1\\n        for j in range(x,-1,-1):\\n            if dp2[j]==1 or j==0:\\n                k=j\\n                if ans[0]<100*k/(i+k):\\n                    ans=[100*k/(i+k),i+k,k]\\n                break\\nprint(str(ans[1])+\\\" \\\"+str(ans[2]))\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    A, B, C, D, E, F = list(map(int, input().split()))\\n\\n    max_concentration = 0\\n    ans = (100 * A, 0)\\n    for a in range(0, F + 1, 100 * A):\\n        for b in range(0, F - a + 1, 100 * B):\\n            water = a + b\\n            if water == 0:\\n                break\\n            for c in range(0, F - water + 1, C):\\n                for d in range(0, F - water - c + 1, D):\\n                    sugar = c + d\\n                    if sugar > (water // 100) * E:\\n                        break\\n                    concentration = (100 * sugar) / (water + sugar)\\n                    if concentration > max_concentration:\\n                        max_concentration = concentration\\n                        ans = (water + sugar, sugar)\\n\\n    print((\\\" \\\".join(map(str, ans))))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A,B,C,D,E,F=map(int,input().split(' '))\\nwater = set()\\nfor a in range(0,F,100*A):\\n  for b in range(0,F,100*B):\\n    if a+b <= F:\\n      water.add(a+b)\\n    else:\\n      break\\nsugars = set()\\nfor c in range(0,F,C):\\n  for d in range(0,F,D):\\n    if c+d <= F:\\n      sugars.add(c+d)\\n    else:\\n      break\\ndensity = 0\\nsugar = 0\\ncontent = 100*A\\nfor x in water:\\n  for y in sugars:\\n    if x+y != 0 and x+y <= F and E*x >= 100*y and density < y/(x+y):\\n      density = y/(x+y)\\n      sugar = y\\n      content = x+y\\nprint(content,sugar)\", \"def main():\\n\\tA, B, C, D, E, F = map(int, input().split())\\n\\twater = set()\\n\\tsugar = set()\\n\\n\\tfor i in range(F // (100 * A) + 1):\\n\\t\\tfor j in range(F // (100 * B) + 1):\\n\\t\\t\\twater_amount = 100 * A * i + 100 * B * j\\n\\t\\t\\tif 0 < water_amount and water_amount <= F:\\n\\t\\t\\t\\twater.add(water_amount)\\n\\n\\tfor i in range(F // C + 1):\\n\\t\\tfor j in range(F // D + 1):\\n\\t\\t\\tsugar_amount = C * i + D * j\\n\\t\\t\\tif sugar_amount <= F:\\n\\t\\t\\t\\tsugar.add(sugar_amount)\\n\\n\\t# print(water)\\n\\t# print(sugar)\\n\\n\\tmax_c = -1\\n\\tmax_w = 0\\n\\tmax_s = 0\\n\\n\\tfor w in water:\\n\\t\\tfor s in sugar:\\n\\t\\t\\tif w + s <= F:\\n\\t\\t\\t\\tif s / w <= E / 100:\\n\\t\\t\\t\\t\\tif s * 100 / (w + s) > max_c:\\n\\t\\t\\t\\t\\t\\tmax_c = s * 100 / (w + s)\\n\\t\\t\\t\\t\\t\\tmax_w = w\\n\\t\\t\\t\\t\\t\\tmax_s = s\\n\\n\\tprint(max_w + max_s, max_s)\\n\\n \\ndef __starting_point():\\n  \\tmain()\\n__starting_point()\"]",
        "difficulty": "introductory",
        "input": "1 2 1 2 100 1000\n",
        "output": "200 100\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc074/tasks/arc083_a"
    },
    {
        "id": 751,
        "task_id": 4761,
        "test_case_id": 3,
        "question": "Your favorite uncle has passed away, leaving you a large estate. Bank account numbers, locations of safe deposit boxes, and GPS coordinates to buried treasures are all locked in an electronic safe in your uncle’s office behind a picture of dogs playing poker. One day he showed you the safe with its $9$ digit keypad (digits $1$ through $9$). He told you he wasn’t worried about anyone breaking into his safe because it’s equipped with a self-destruct mechanism that will destroy the contents if anyone attempts a forced entry.\n\nThe combination is a sequence of six decimal digits. If an incorrect combination is entered the safe enforces a thirty-second delay before accepting another combination. So a brute-force effort to try all six-digit combinations could take months.\n\nYour uncle had planned to give you, his sole heir, the combination one day, but due to an unfortunate hang-gliding accident in Kansas, you now must rely on your deductive and programming skills to access the key to your inheritance.\n\nHere’s what you know:\n - The combination $c$ is a sequence of six non-zero decimal digits.\n - Your mother recalls that she heard your uncle mention that all the digits are different.\n - You remember that your uncle once said that the six digit number was divisible by each of its individual digits.\n\nAn example satisfying these conditions is $123864$: all six digits differ, and you can check that $123864$ is divisible by each of $1$, $2$, $3$, $8$, $6$ and $4$.\n\nEven with the helpful data, it could take a while to get to open the safe, so the task is likely to be split into several sessions with separate ranges being tested. How many combinations are there to try in the range given?\n\n-----Input-----\nThe input is a line with two space-separated integers $L$ and $H$, where $123456 \\leq L < H \\leq 987654$\n\n-----Output-----\nPrint one integer, the total number of possible combinations to the safe, where each combination $c$ must satisfy the three constraints above, and lie in the range $L \\leq c \\leq H$.\n\n-----Examples-----\nSample Input 1:\n123864 123865\nSample Output 1:\n1\n\nSample Input 2:\n198765 198769\nSample Output 2:\n0",
        "solutions": "",
        "difficulty": "introductory",
        "input": "200000 300000\n",
        "output": "31\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/heirsdilemma"
    },
    {
        "id": 752,
        "task_id": 15,
        "test_case_id": 2,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "10 10 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 753,
        "task_id": 15,
        "test_case_id": 12,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1000000000 -1000000000 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 754,
        "task_id": 15,
        "test_case_id": 13,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1000000000 1000000000 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 755,
        "task_id": 15,
        "test_case_id": 28,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-2 -2 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 756,
        "task_id": 15,
        "test_case_id": 53,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-1 -2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 757,
        "task_id": 15,
        "test_case_id": 58,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "-1 -1 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 758,
        "task_id": 15,
        "test_case_id": 78,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "0 -2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 759,
        "task_id": 15,
        "test_case_id": 83,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "0 -1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 760,
        "task_id": 15,
        "test_case_id": 88,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "0 0 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 761,
        "task_id": 15,
        "test_case_id": 103,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1 -2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 762,
        "task_id": 15,
        "test_case_id": 108,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1 -1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 763,
        "task_id": 15,
        "test_case_id": 113,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1 0 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 764,
        "task_id": 15,
        "test_case_id": 118,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "1 1 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 765,
        "task_id": 15,
        "test_case_id": 128,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 -2 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 766,
        "task_id": 15,
        "test_case_id": 133,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 -1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 767,
        "task_id": 15,
        "test_case_id": 138,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 0 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 768,
        "task_id": 15,
        "test_case_id": 143,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 1 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 769,
        "task_id": 15,
        "test_case_id": 148,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 2 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 770,
        "task_id": 15,
        "test_case_id": 162,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "20 10 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 771,
        "task_id": 15,
        "test_case_id": 169,
        "question": "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.\n\n\n-----Input-----\n\nThe first line of the input contain three integers a, b and c ( - 10^9 ≤ a, b, c ≤ 10^9) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.\n\n\n-----Output-----\n\nIf b appears in the sequence s print \"YES\" (without quotes), otherwise print \"NO\" (without quotes).\n\n\n-----Examples-----\nInput\n1 7 3\n\nOutput\nYES\n\nInput\n10 10 0\n\nOutput\nYES\n\nInput\n1 -4 5\n\nOutput\nNO\n\nInput\n0 60 50\n\nOutput\nNO\n\n\n\n-----Note-----\n\nIn the first sample, the sequence starts from integers 1, 4, 7, so 7 is its element.\n\nIn the second sample, the favorite integer of Vasya is equal to the first element of the sequence.\n\nIn the third sample all elements of the sequence are greater than Vasya's favorite integer.\n\nIn the fourth sample, the sequence starts from 0, 50, 100, and all the following elements are greater than Vasya's favorite integer.",
        "solutions": "[\"import sys\\na,b,c=map(int,input().split())\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\n    return\\nif (b-a)%c==0 and (b-a)//c>=0:\\n    print('YES')\\nelse:\\n    print('NO')\", \"a, b, c = list(map(int, input().split()))\\nif c != 0:\\n    if c * (b - a) >= 0 and (b - a) % c == 0:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif c != 0:\\n    n = (b - a) // c\\nelse:\\n    n = 0\\nprint([\\\"NO\\\", \\\"YES\\\"][(a + n * c == b) and (n >= 0)])\\n\", \"# You lost the game.\\na,b,c = list(map(int, input().split()))\\nif (c == 0 and b == a):\\n    print(\\\"YES\\\")\\nelif (c == 0):\\n    print(\\\"NO\\\")\\nelif (b-a) % c == 0 and ((c >= 0 and b >= a) or (c <= 0 and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    if (b - a) % c == 0 and (b - a) // c >= 0:\\n        print('YES')\\n    else:\\n        print('NO')\\n\", \"a,b,c = map(int, input().split())\\n\\nif c == 0 :\\n    ans = (a == b)\\nelse :\\n    k = (b - a)//c\\n    ans = (k >= 0 and a + c*k == b)\\n\\nif ans :\\n    print(\\\"YES\\\")\\nelse :\\n    print(\\\"NO\\\")\", \"a, b, c= [int(i) for i in input().split()]\\nif (a < b and c<=0) or (a > b and c>=0):\\n\\tprint(\\\"NO\\\")\\nelse:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif c == 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tif (b-a)%c == 0:\\n\\t\\t\\t\\tprint(\\\"YES\\\")\\n\\t\\t\\telse:\\n\\t\\t\\t\\tprint(\\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\nimport math\\na, b ,c = list(map(int, input().split()))\\nif (b > a and c <= 0) or (b < a and c >= 0): print('NO')\\nelif b == a: print('YES')\\nelse :\\n    print('YES' if abs(b - a) % abs(c) == 0 else 'NO')\\n\", \"a,b,c=map(int,input().split())\\nif c==0: \\n    print('YES' if b==a else 'NO')\\nelse:\\n     if (b-a)%c==0 and (b-a)//c>=0: print('YES')\\n     else: print('NO')\", \"a,b,c=[int(x) for x in input().split()]\\nif c==0:\\n    if b!=a:\\n        print(\\\"NO\\\")\\n    else:\\n        print(\\\"YES\\\")\\nelse:\\n    if c<0:\\n        c=-c\\n        d=a\\n        a=b\\n        b=d\\n    if b>=a and (b-a)%c==0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0 and b == a or c != 0 and (b - a) % c == 0 and (b - a) // c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = list(map(int, input().split()))\\nif c > 0:\\n  if b >= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\nelif c == 0:\\n  if b == a:\\n    print('YES')\\n  else:\\n    print('NO')\\nelse:\\n  if b <= a and a % c == b % c:\\n    print('YES')\\n  else:\\n    print('NO')\\n\", \"a,b,c = list(map(int, input().split()))\\n \\nif b - a > 0 and c > 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif b - a < 0 and c < 0:\\n    if (b - a) % c == 0:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\nelif a - b == 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = list(map(int, input().split()))\\n\\nif((c == 0 and a == b) or (c > 0 and a % c == b % c and b >= a) or (c < 0 and\\n    a%c == b%c and b <= a)):\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\\n\", \"a, b, c = map(int, input().split())\\nif c == 0:\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\\nelse:\\n\\td, r = divmod(b - a, c)\\n\\tif a == b:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tif d < 1 or r != 0:\\n\\t\\t\\tprint(\\\"NO\\\")\\n\\t\\telse:\\n\\t\\t\\tprint(\\\"YES\\\")\", \"a,b,c = input().split()\\na = int(a)\\nb = int(b)\\nc = int(c)\\nif (a == b) or ((c > 0 and a < b or c < 0 and a > b) and a % c == b % c):\\n    print('YES')\\nelse:\\n    print('NO')\\n\", \"a,b,c=list(map(int,input().split()))\\n\\nif c==0:\\n    if a==b:\\n        print('YES')\\n    else:\\n        print('NO')\\nelse:\\n    k=(b-a)/c\\n    if int(k)-k==0.0 and k>=0:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\\n\", \"a, b, c = list(map(int, input().split()))\\nif c == 0:\\n    print(\\\"YES\\\" if a == b else \\\"NO\\\")\\nelse:\\n    print(\\\"YES\\\" if (b - a + c) % c == 0 and (b - a + c) // c > 0 else \\\"NO\\\")\\n\", \"#!/usr/bin/env python3\\n\\ndef main():\\n    a, b, c = [int(x) for x in input().split()]\\n    if a == b:\\n        print('YES')\\n    elif c == 0:\\n        print('YES' if (b == a) else 'NO')\\n    else:\\n        n = (b - a) // abs(c)\\n        x = (b - a) % abs(c)\\n        print('YES' if x == 0 and n * c > 0 else 'NO')\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n\\ntry:\\n    while True:\\n        a, b, c = list(map(int, input().split()))\\n        if c == 0:\\n            print(\\\"YES\\\" if a == b else \\\"NO\\\")\\n        elif c > 0:\\n            print(\\\"YES\\\" if b in range(a, int(1e10), c) else \\\"NO\\\")\\n        else:\\n            print(\\\"YES\\\" if b in range(a, int(-1e10), c) else \\\"NO\\\")\\n\\nexcept EOFError:\\n    pass\\n\", \"a,b,c = list(map(int,input().split()))\\nif c == 0:\\n    if b == a:\\n        print('YES')\\n    else:\\n        print('NO')\\nelif c > 0:\\n    if b < a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\nelse:\\n    if b > a:\\n        print('NO')\\n    else:\\n        if a%c == b%c:\\n            print('YES')\\n        else:\\n            print('NO')\\n\", \"a,b,c=map(int,input().split())\\nif c == 0:\\n    print(\\\"YES\\\" if b-a == c else \\\"NO\\\")\\nelif (b-a) % c == 0 and (b-a) / c >= 0:\\n    print(\\\"YES\\\")\\nelse:\\n    print(\\\"NO\\\")\", \"a, b, c = map(int, input().split())\\nif (c and not (a - b) % c and max(a + c, b) - min(b, a + c) < max(a, b) - min(a, b)) or (a == b):\\n    print('YES')\\nelse:\\n    print('NO')\", \"read = lambda: list(map(int, input().split()))\\na, b, c = read()\\nif c == 0 and (b == a): ans = 'YES'\\nelif c != 0 and (b - a) % c == 0:\\n    if c > 0 and b >= a: ans = 'YES'\\n    elif c < 0 and b <= a: ans = 'YES'\\n    else: ans = 'NO'\\nelse: ans = 'NO'\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "2 0 0\n",
        "output": "NO\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/675/A"
    },
    {
        "id": 772,
        "task_id": 83,
        "test_case_id": 1,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "5\n10 0 -7 2 6\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 773,
        "task_id": 83,
        "test_case_id": 2,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "7\n0 0 1 -1 0 0 2\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 774,
        "task_id": 83,
        "test_case_id": 3,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "5\n0 0 0 1 1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 775,
        "task_id": 83,
        "test_case_id": 5,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "2\n1 0\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 776,
        "task_id": 83,
        "test_case_id": 6,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39 39\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 777,
        "task_id": 83,
        "test_case_id": 8,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n621 862 494 -906 906 359 776 0 23 -868 863 -872 273 182 414 675 31 555 0 -423 468 517 577 892 117 664 292 11 105 589 173 455 711 358 229 -666 192 758 6 858 208 628 532 21 69 319 926 988 0 0 0 229 351 708 287 949 429 895 369 0 756 486 2 525 656 -906 742 284 174 510 747 227 274 103 50 -832 656 627 883 -603 927 989 797 463 615 798 832 535 562 517 194 697 661 176 814 -62 0 -886 239 221\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 778,
        "task_id": 83,
        "test_case_id": 10,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "20\n74 33 43 41 -83 -30 0 -20 84 99 83 0 64 0 57 46 0 18 94 82\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 779,
        "task_id": 83,
        "test_case_id": 13,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "50\n40 -84 25 0 21 44 96 2 -49 -15 -58 58 0 -49 4 8 13 28 -78 69 0 35 43 0 41 97 99 0 0 5 71 58 10 15 0 30 49 0 -66 15 64 -51 0 50 0 23 43 -43 15 6\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 780,
        "task_id": 83,
        "test_case_id": 16,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "50\n-335 775 108 -928 -539 408 390 500 867 951 301 -113 -711 827 -83 422 -465 -355 -891 -957 -261 -507 930 385 745 198 238 33 805 -956 154 627 812 -518 216 785 817 -965 -916 999 986 718 55 698 -864 512 322 442 188 771\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 781,
        "task_id": 83,
        "test_case_id": 18,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n41 95 -57 5 -37 -58 61 0 59 42 45 64 35 84 11 53 5 -73 99 0 59 68 82 32 50 0 92 0 17 0 -2 82 86 -63 96 -7 0 0 -6 -86 96 88 81 82 0 41 9 0 67 88 80 84 78 0 16 66 0 17 56 46 82 0 11 -79 53 0 -94 73 12 93 30 75 89 0 56 90 79 -39 45 -18 38 52 82 8 -30 0 69 50 22 0 41 0 0 33 17 8 97 79 30 59\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 782,
        "task_id": 83,
        "test_case_id": 20,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n-218 113 -746 -267 498 408 116 756 -793 0 -335 -213 593 -467 807 -342 -944 13 637 -82 -16 860 -333 -94 409 -149 -79 -431 -321 974 148 779 -860 -992 -598 0 -300 285 -187 404 -468 0 -586 875 0 0 -26 366 221 -759 -194 -353 -973 -968 -539 0 925 -223 -471 237 208 0 420 688 640 -711 964 661 708 -158 54 864 0 -697 -40 -313 -194 220 -211 108 596 534 148 -137 939 106 -730 -800 -266 433 421 -135 76 -51 -318 0 631 591 46 669\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 783,
        "task_id": 83,
        "test_case_id": 22,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 784,
        "task_id": 83,
        "test_case_id": 24,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "50\n9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 785,
        "task_id": 83,
        "test_case_id": 26,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 786,
        "task_id": 83,
        "test_case_id": 29,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "50\n-675 468 324 909 -621 918 954 846 369 -243 207 -756 225 -513 198 603 234 612 585 963 -396 801 -612 720 -432 -774 522 72 -747 -909 513 324 -27 846 -405 -252 -531 189 -36 -927 198 900 558 -711 702 -423 621 -945 -441 -783\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 787,
        "task_id": 83,
        "test_case_id": 31,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n-880 550 -605 -781 297 -748 209 385 429 748 -880 913 -924 -935 517 11 352 -99 -979 462 990 -495 -44 539 528 -22 -451 44 -781 451 792 275 -462 220 968 726 -88 385 55 77 341 715 275 -693 -880 616 440 -924 -451 -308 -770 -836 473 935 -660 957 418 -264 341 385 -55 -22 880 -539 539 -858 -121 165 -385 -198 99 -88 11 -231 -638 -440 814 -198 902 550 209 275 -319 -66 -176 -297 594 781 -33 -242 -385 -308 77 891 -781 0 -858 -22 825 -759\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 788,
        "task_id": 83,
        "test_case_id": 32,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n39 351 -39 663 -312 741 624 -39 -702 897 -234 -624 195 -897 -273 -624 39 -546 -858 390 390 -273 -741 156 -78 624 -117 390 -975 -234 390 897 936 -897 351 351 234 117 -663 -819 390 468 234 234 -78 -351 -897 702 -195 975 273 -429 624 -273 312 39 -117 -702 -507 195 -312 507 -858 -117 -117 858 468 858 546 702 -858 702 117 -702 663 -78 -702 -741 897 585 429 -741 897 546 195 975 -234 -936 78 -156 819 -897 507 -702 -858 975 -507 858 -390 -117\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 789,
        "task_id": 83,
        "test_case_id": 33,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n663 -408 -459 -255 204 -510 714 -561 -765 -510 765 -765 -357 -867 204 765 408 -153 255 459 306 -102 969 153 918 153 867 765 357 306 -663 918 408 357 714 561 0 459 255 204 867 -714 459 -51 102 -204 -816 -816 357 765 -459 -255 -357 153 408 510 -663 357 -714 408 867 -561 765 -153 969 663 612 51 867 -51 51 -663 204 153 969 663 -357 510 -714 714 -663 102 714 -255 -969 765 0 918 -612 -459 -204 0 306 102 663 -408 357 -510 -102 -510\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 790,
        "task_id": 83,
        "test_case_id": 35,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n0 1000 1000 1000 800 300 -500 900 400 -500 -900 400 400 -300 -300 -600 500 0 -500 600 -500 900 1000 -600 -200 300 -100 800 -800 0 200 400 0 -100 100 100 1000 -400 100 400 -900 -500 -900 400 -700 -400 800 -900 300 -300 -400 500 -900 1000 700 -200 500 400 -200 -300 -200 -600 -600 -800 300 -100 100 -1000 100 -800 -500 -800 0 100 900 -200 -100 -400 -500 0 -400 900 600 400 -200 100 400 800 -800 700 600 -200 1000 -400 -200 -200 100 -1000 700 -600\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 791,
        "task_id": 83,
        "test_case_id": 41,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "20\n0 0 0 -576 0 -207 0 -639 0 0 468 0 0 873 0 0 0 0 81 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 792,
        "task_id": 83,
        "test_case_id": 42,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "50\n-81 -405 630 0 0 0 0 0 891 0 0 0 0 0 -18 0 0 0 0 0 243 -216 0 702 0 -909 -972 0 0 0 -450 0 0 882 0 0 0 0 0 -972 0 0 0 0 -333 -261 945 -720 0 -882\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 793,
        "task_id": 83,
        "test_case_id": 43,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n-972 0 -747 0 0 -918 396 0 0 -144 0 0 0 0 774 0 0 0 0 0 0 0 0 0 0 0 387 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 855 0 603 0 0 0 675 -675 621 0 0 0 -45 612 -549 -153 0 0 0 0 0 -486 0 0 0 0 0 0 -594 0 0 0 -225 0 -54 693 0 0 0 0 0 0 0 873 0 0 -198 0 0 0 0 558 0 918\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 794,
        "task_id": 83,
        "test_case_id": 44,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n0 0 0 0 0 0 0 0 539 0 0 -957 0 0 0 -220 0 550 0 0 0 660 0 0 -33 0 0 -935 0 0 0 0 0 0 0 0 0 0 0 0 0 -55 297 0 0 0 0 0 836 0 -451 0 0 0 0 0 -176 0 0 0 0 0 0 792 -847 330 0 0 0 715 0 0 0 517 -682 0 0 0 0 0 0 0 0 506 484 0 -396 0 0 429 0 0 0 0 0 0 0 968 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 795,
        "task_id": 83,
        "test_case_id": 45,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n0 0 0 0 0 0 0 0 0 0 0 600 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 900 100 0 0 0 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 796,
        "task_id": 83,
        "test_case_id": 46,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n49 0 -87 -39 0 0 -39 73 1 88 45 0 87 0 0 0 90 54 59 0 0 0 -96 -68 9 -26 0 68 21 59 -21 90 64 0 -62 78 -53 0 0 72 0 0 0 14 -79 87 0 75 0 97 77 0 37 0 1 18 0 0 0 30 47 39 0 -69 0 0 0 71 0 0 0 -85 0 44 0 0 0 -36 0 30 0 0 0 0 0 9 40 0 0 61 -35 0 0 0 0 -32 0 28 0 -100\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 797,
        "task_id": 83,
        "test_case_id": 47,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n-801 -258 -829 0 -839 -920 0 0 979 -896 -581 -132 -945 -274 -538 117 0 27 0 469 129 0 -608 685 0 -915 273 -929 0 -418 -57 517 -230 -775 0 -839 475 -350 882 363 419 0 -120 0 -416 808 0 -726 286 0 0 -777 -80 -331 0 278 -328 0 -534 0 0 -581 -463 0 -244 0 -693 0 0 -754 120 -254 -237 0 -452 0 -478 -509 0 -688 0 911 -219 368 0 0 -598 0 -575 0 0 -897 0 0 0 0 373 0 490 950\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 798,
        "task_id": 83,
        "test_case_id": 48,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n303 599 954 131 507 906 227 111 187 395 959 509 891 669 677 246 430 582 326 235 331 395 550 224 410 278 385 371 -829 514 600 451 337 786 508 939 548 23 583 342 870 585 16 914 482 619 781 583 683 913 663 727 329 170 475 557 356 8 342 536 821 348 942 486 497 732 213 659 351 -727 471 593 399 582 608 799 922 618 752 861 206 530 513 259 185 435 437 15 451 919 42 549 14 25 599 454 407 53 382 -540\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 799,
        "task_id": 83,
        "test_case_id": 50,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n34 -601 426 -318 -52 -51 0 782 711 0 502 746 -450 1 695 -606 951 942 14 0 -695 806 -195 -643 445 -903 443 523 -940 634 -229 -244 -303 -970 -564 -755 344 469 0 -293 306 496 786 62 0 -110 640 339 630 -276 -286 838 137 -508 811 -385 -784 -834 937 -361 -799 534 368 -352 -702 353 -437 -440 213 56 637 -814 -169 -56 930 720 -100 -696 -749 463 -32 761 -137 181 428 -408 0 727 -78 963 -606 -131 -537 827 951 -753 58 -21 -261 636\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 800,
        "task_id": 83,
        "test_case_id": 52,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "100\n-48 842 18 424 -969 -357 -781 -517 -941 -957 -548 23 0 215 0 -649 -509 955 376 824 62 0 -5 674 890 263 -567 585 488 -862 66 961 75 205 838 756 514 -806 0 -884 692 0 301 -722 457 838 -649 -785 0 -775 449 -436 524 792 999 953 470 39 -61 0 860 65 420 382 0 11 0 117 767 171 0 577 185 385 387 -612 0 277 -738 -691 78 396 6 -766 155 119 -588 0 -724 228 580 200 -375 620 615 87 574 740 -398 698\n",
        "output": "1",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 801,
        "task_id": 83,
        "test_case_id": 59,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "7\n1 2 3 0 0 -1 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 802,
        "task_id": 83,
        "test_case_id": 63,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "5\n100 0 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 803,
        "task_id": 83,
        "test_case_id": 68,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "9\n0 0 0 1 1 1 1 -1 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 804,
        "task_id": 83,
        "test_case_id": 70,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "4\n0 0 -1 1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 805,
        "task_id": 83,
        "test_case_id": 71,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 1 0 0 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 806,
        "task_id": 83,
        "test_case_id": 72,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "4\n1 -1 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 807,
        "task_id": 83,
        "test_case_id": 78,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "8\n-1 -1 1 0 0 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 808,
        "task_id": 83,
        "test_case_id": 79,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "5\n0 0 1 1 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 809,
        "task_id": 83,
        "test_case_id": 92,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "6\n0 0 1 1 -1 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 810,
        "task_id": 83,
        "test_case_id": 94,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "6\n-2 -1 0 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 811,
        "task_id": 83,
        "test_case_id": 95,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "9\n1 1 1 0 0 0 -1 -1 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 812,
        "task_id": 83,
        "test_case_id": 98,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "6\n1 1 0 0 -1 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 813,
        "task_id": 83,
        "test_case_id": 100,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "9\n1 2 3 -1 -2 -3 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 814,
        "task_id": 83,
        "test_case_id": 102,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "5\n1 -1 0 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 815,
        "task_id": 83,
        "test_case_id": 103,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "6\n1 1 -1 -1 0 0\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 816,
        "task_id": 83,
        "test_case_id": 104,
        "question": "You are given an array of $n$ integers: $a_1, a_2, \\ldots, a_n$. Your task is to find some non-zero integer $d$ ($-10^3 \\leq d \\leq 10^3$) such that, after each number in the array is divided by $d$, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least $\\lceil\\frac{n}{2}\\rceil$). Note that those positive numbers do not need to be an integer (e.g., a $2.5$ counts as a positive number). If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\nRecall that $\\lceil x \\rceil$ represents the smallest integer that is not less than $x$ and that zero ($0$) is neither positive nor negative.\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 100$) — the number of elements in the array.\n\nThe second line contains $n$ space-separated integers $a_1, a_2, \\ldots, a_n$ ($-10^3 \\le a_i \\le 10^3$).\n\n\n-----Output-----\n\nPrint one integer $d$ ($-10^3 \\leq d \\leq 10^3$ and $d \\neq 0$) that satisfies the given condition. If there are multiple values of $d$ that satisfy the condition, you may print any of them. In case that there is no such $d$, print a single integer $0$.\n\n\n-----Examples-----\nInput\n5\n10 0 -7 2 6\nOutput\n4\nInput\n7\n0 0 1 -1 0 0 2\n\nOutput\n0\n\n\n-----Note-----\n\nIn the first sample, $n = 5$, so we need at least $\\lceil\\frac{5}{2}\\rceil = 3$ positive numbers after division. If $d = 4$, the array after division is $[2.5, 0, -1.75, 0.5, 1.5]$, in which there are $3$ positive numbers (namely: $2.5$, $0.5$, and $1.5$).\n\nIn the second sample, there is no valid $d$, so $0$ should be printed.",
        "solutions": "[\"n=int(input())\\nar=list(map(int,input().split()))\\npos=0\\nneg=0\\nfor a in ar:\\n    if(a>0):pos+=1\\n    elif a<0:neg+=1\\nif(pos*2>=n):\\n    print(1)\\nelif neg*2>=n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\np = o = 0\\nfor i in a:\\n    if i > 0:\\n        p += 1\\n    elif i < 0:\\n        o += 1\\nif 2 * p >= n:\\n    print(1)\\nelif 2 * o >= n:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(i) for i in input().split()]\\nminus = 0\\nplus = 0\\nfor el in a:\\n    if el > 0:\\n        minus += 1\\n    elif el < 0:\\n        plus += 1\\nif minus >= n // 2 + n % 2:\\n    print(1)\\nelif plus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import sys\\nfrom math import ceil\\n\\ninput = sys.stdin.readline\\n\\nn = int(input())\\na = map(int, input().split())\\n\\ncountPos = 0\\ncountNeg = 0\\n\\nfor i in a:\\n    if i > 0:\\n        countPos += 1\\n    if i < 0:\\n        countNeg += 1\\n\\nif countPos >= ceil(n/2):\\n    print(1)\\nelif countNeg >= ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = [int(v) for v in input().split()]\\n\\npos, neg, zero = 0, 0, 0\\nfor v in a:\\n    if v > 0:\\n        pos += 1\\n    elif  v <  0:\\n        neg +=  1\\n    else:\\n        zero += 1\\n\\nif  pos >= n / 2:\\n    print(1)\\nelif neg >= n / 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nq = (n + 2 - 1) // 2\\ns = list(map(int, input().split()))\\nf = 0\\nfor i in s:\\n    if(i > 0):\\n        q -= 1\\n    elif(i < 0):\\n        f += 1\\nif(q <= 0):\\n    print(1)\\nelif(f >= (n + 2 - 1) // 2):\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\ncl = list(map(int, input().split()))\\na = 0\\nb = 0\\nfor x in cl:\\n    if x>0:\\n        a+=1\\n    if x<0:\\n        b+=1\\n\\nif n%2==0:\\n    k = n//2\\nelse:\\n    k = n//2+1\\n\\nif a>=k:\\n    print(1)\\nelif b>=k:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nl = sorted([*list(map(int, input().split()))])\\n\\np = sum(1 for e in l if e > 0)\\nneg = sum(1 for e in l if e < 0)\\n\\nif p >= (n + 1)//2:\\n    res = 1\\nelif neg >= (n + 1) // 2:\\n    res = -1\\nelse:\\n    res = 0\\nprint(res)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\np = sum([1 for i in a if i > 0])\\nng = sum([1 for i in a if i < 0])\\n\\nif p >= n/2:\\n    print(1)\\nelif ng >= n/2:\\n    print(-1)\\nelse:\\n    print(0)\", \"n = int(input())\\na = list(map(int, input().split()))\\n\\npos = sum(x > 0 for x in a)\\nneg = sum(x < 0 for x in a)\\n\\nneeded = (n + 1) // 2\\nif pos >= needed:\\n    print(\\\"1\\\")\\nelif neg >= needed:\\n    print(\\\"-1\\\")\\nelse:\\n    print(0)\", \"n = int(input())\\nai = list(map(int,input().split()))\\nnum = 0\\nnum2 = 0\\nfor i  in range(n):\\n    if ai[i] > 0:\\n        num += 1\\n    elif ai[i] < 0:\\n        num2 += 1\\nn2 = n//2 + n % 2\\nif num >= n2:\\n    print(1)\\nelif num2 >= n2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\ncnt1, cnt2 = 0, 0\\nfor i in A:\\n    if i > 0:\\n        cnt1 += 1\\n    elif i < 0:\\n        cnt2 += 1\\nif cnt1 >= (n + 1) // 2:\\n    print(1)\\nelif cnt2 >= (n + 1) // 2:\\n    print(-1)\\nelse:print(0)\\n\", \"n = int(input())\\nli = list(map(int,input().split()))\\nplus = 0\\nminus = 0\\nfor i in li:\\n\\tif i>0:\\n\\t\\tplus += 1\\n\\tif i<0:\\n\\t\\tminus += 1\\nif plus >= (n+1)//2:\\n\\tprint(1)\\nelif minus >= (n+1)//2:\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\npos = 0\\nneg = 0\\nfor a in A:\\n    if a > 0:\\n        pos += 1\\n    elif a < 0:\\n        neg += 1\\n        \\nif pos >= (N+1)//2:\\n    print(1)\\nelif neg >= (N+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"import math\\ndef A():\\n    n = int(input())\\n    a  =  [int(x) for x in input().split()]\\n    pos , neg = 0 , 0\\n    for i in a:\\n        if(i>0): pos+=1\\n        if(i<0): neg+=1\\n\\n    if(pos>= math.ceil(n/2)):\\n        print(1)\\n        return\\n    if(neg>= math.ceil(n/2)):\\n        print(-1)\\n        return\\n    print(0)\\nA()\\n\", \"#!/bin/python3\\n\\nimport math\\nimport os\\nimport random\\nimport re\\nimport sys\\n\\nn=int(input())\\nl=list(map(int,input().split()))\\na,b=0,0\\nfor i in l:\\n    if i>0:\\n        a+=1\\n    elif i<0:\\n        b+=1\\nt=(n+1)//2\\nif a>=t:\\n    print(1)\\nelif b>=t:\\n    print(-1)\\nelse:\\n    print(0)\", \"n=int(input())\\na=list(map(int,input().split()))\\np=0\\nflag=True\\nm=0\\nfor i in range(len(a)):\\n    if a[i]<0:\\n        m+=1\\n    if a[i]>0:\\n        p+=1\\nif m>p:\\n    if n//2+n%2<=m:\\n        print(-1)\\n        flag=False\\nelse:\\n    if n//2+n%2<=p:\\n        print(1)\\n        flag=False\\nif flag:\\n    print(0)\\n\", \"import math\\nn=int(input())\\na=[int(x) for x in input().split()]\\nco1=co2=co3=0\\nfor item in a:\\n    if item>0:\\n        co1+=1\\n    elif item<0:\\n        co2+=1\\n    else:\\n        co3+=1\\nif co1>=math.ceil(n/2):\\n    print(1)\\nelif co2>=math.ceil(n/2):\\n    print(-1)\\nelse:\\n    print(0)\\n        \\n\", \"n = int(input())\\na = [int(s) for s in input().split()]\\npol = 0\\nneg = 0\\nnul = 0\\n\\nfor el in a:\\n    if el > 0:\\n        pol += 1\\n    elif el < 0:\\n        neg += 1\\n    else:\\n        nul += 1\\n\\npolov = n//2 + n%2\\nd = 0\\nif pol >= polov:\\n    d = 1\\nelif neg >= polov:\\n    d = -1\\nprint(d)\", \"import sys,math,string\\ninput=sys.stdin.readline\\nfrom collections import deque\\nL=lambda : list(map(int,input().split()))\\nLs=lambda : list(input().split())\\nM=lambda : list(map(int,input().split()))\\nn=int(input())\\nl=L()\\ncp=0\\ncn=0\\ncz=0\\nfor i in range(n):\\n    if(l[i]>0):\\n        cp+=1\\n    elif(l[i]<0):\\n        cn+=1\\n    else:\\n        cz+=1\\nif(cp>=(n//2 +(n%2))):\\n    print(1)\\nelif(cn>=(n//2 +(n%2))):\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nx1, x2 = len([q for q in a if q > 0]), a.count(0)\\nx3 = n-x1-x2\\nif x1 >= (n+1)//2:\\n    print(1)\\nelif x3 >= (n+1)//2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n = int(input())\\na = [int(t) for t in input().split(' ')]\\nplus = len([t for t in a if t > 0])\\nminus = len([t for t in a if t < 0])\\n\\nif plus >= n // 2 + n % 2:\\n    print(1)\\nelif minus >= n // 2 + n % 2:\\n    print(-1)\\nelse:\\n    print(0)\\n\", \"n=int(input())\\narr=list(map(int,input().split()))\\ncount1=0\\ncount2=0\\ncount3=0\\nfor i in range(n):\\n\\tif(arr[i]==0):\\n\\t\\tcount1+=1\\n\\telif(arr[i]>0):\\n\\t\\tcount2+=1\\n\\telse:\\n\\t\\tcount3+=1\\nif(count2>=count1+count3):\\n\\tprint(1)\\nelif(count3>=count1+count2):\\n\\tprint(-1)\\nelse:\\n\\tprint(0)\\n\"]",
        "difficulty": "interview",
        "input": "4\n0 1 0 -1\n",
        "output": "0",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1130/A"
    },
    {
        "id": 817,
        "task_id": 200,
        "test_case_id": 2,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "10 13\n1 1\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 818,
        "task_id": 200,
        "test_case_id": 6,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "999 1000\n1 1\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 819,
        "task_id": 200,
        "test_case_id": 10,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "500 509\n1 1\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 820,
        "task_id": 200,
        "test_case_id": 13,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "99990 100000\n1 1\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 821,
        "task_id": 200,
        "test_case_id": 18,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "1 9\n1 1\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 822,
        "task_id": 200,
        "test_case_id": 27,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "1 17\n2 2\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 823,
        "task_id": 200,
        "test_case_id": 36,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "1 16\n2 2\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 824,
        "task_id": 200,
        "test_case_id": 38,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "1 10\n2 2\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 825,
        "task_id": 200,
        "test_case_id": 71,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "3 100\n1 1\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 826,
        "task_id": 200,
        "test_case_id": 72,
        "question": "The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h_1 cm from the ground. On the height h_2 cm (h_2 > h_1) on the same tree hung an apple and the caterpillar was crawling to the apple.\n\nGabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.\n\nIn how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.\n\nNote that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.\n\n\n-----Input-----\n\nThe first line contains two integers h_1, h_2 (1 ≤ h_1 < h_2 ≤ 10^5) — the heights of the position of the caterpillar and the apple in centimeters.\n\nThe second line contains two integers a, b (1 ≤ a, b ≤ 10^5) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.\n\n\n-----Output-----\n\nPrint the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.\n\nIf the caterpillar can't get the apple print the only integer  - 1.\n\n\n-----Examples-----\nInput\n10 30\n2 1\n\nOutput\n1\n\nInput\n10 13\n1 1\n\nOutput\n0\n\nInput\n10 19\n1 2\n\nOutput\n-1\n\nInput\n1 50\n5 4\n\nOutput\n1\n\n\n\n-----Note-----\n\nIn the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.\n\nNote that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.",
        "solutions": "[\"from math import *\\n\\nh1, h2 = [int(i) for i in input().split()]\\na, b = [int(i) for i in input().split()]\\na *= 12\\nb *= 12\\nif a <= b and h2 - h1 > (a // 12 * 8):\\n    print(-1)\\n    return\\nh1 += (a // 12 * 8)\\nif h1 >= h2:\\n    print(0)\\n    return\\nday = int(ceil((h2 - h1) / (a - b)))\\nprint(day)\", \"def solve():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n\\n    h3 = h1 + a * 8\\n\\n    if h3 >= h2:\\n        print(0)\\n        return\\n\\n    if b >= a:\\n        print(-1)\\n        return\\n\\n    h4 = h2 - h3\\n\\n    c = (a - b) * 12\\n\\n    ans = int((h4 + (c - 1)) / c)\\n\\n    print(ans)\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"from math import ceil\\n\\nh1, h2 = list(map(int, input().split()))\\n\\na, b = list(map(int, input().split()))\\n\\nx = h2 - h1\\np = 0\\n\\nfor i in range(8):\\n    p += a\\n    if p >= x:\\n        print(0)\\n        return\\n\\nfor i in range(100000):\\n    for j in range(12):\\n        if i&1:\\n            p += a\\n        else:\\n            p -= b\\n        if p >= x:\\n            print(ceil(i/2))\\n            return\\n\\nprint(-1)\\n\", \"#! /usr/bin/env python3\\n'''\\n' Title:\\t\\n' Author:\\tCheng-Shih, Wong\\n' Date:\\t\\t\\n'''\\n\\nimport math\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\n\\nif h1+a*8 >= h2: print(0)\\nelif a <= b: print(-1)\\nelse:\\n\\tprint( math.ceil((h2-h1-8*a)/(12*(a-b))) )\\n\", \"#!/usr/bin/env python3\\n# -*- coding: utf-8 -*-\\n\\nimport itertools\\n\\n\\ndef divceil(a, b):\\n    return (a + b - 1) // b\\n\\n\\ndef solve(h1, h2, a, b):\\n    if a - b <= 0:\\n        return 0 if divceil(h2 - h1, a) <= 8 else -1\\n    h = h1\\n    h += a * 8\\n    if h >= h2:\\n        return 0\\n    h -= b * 12\\n    for i in itertools.count(1):\\n        h += a * 12\\n        if h >= h2:\\n            return i\\n        h -= b * 12\\n\\n\\ndef main():\\n    h1, h2 = list(map(int, input().split()))\\n    a, b = list(map(int, input().split()))\\n    print(solve(h1, h2, a, b))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"line = input().split()\\nh1 = int(line[0])\\nh2 = int(line[1])\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a <= b:\\n    if h1 + 8 * a >= h2:\\n        print(0)\\n    else:\\n        print(-1)\\nelse:\\n    slips = 0\\n    while True:\\n        if h1 + 8 * a + slips * 12 * (a - b) >= h2:\\n            print (slips)\\n            break\\n        slips += 1\\n\", \"import math\\n\\n\\nh1, h2 = list(map(int, input().split()))\\nday, night = list(map(int, input().split()))\\n\\nif h2 - h1 <= day * 8:\\n    print(0)\\nelif (h2 - h1) - day * 8 + night * 12 - day * 12 <= 0:\\n    print(1)\\nelif day - night <= 0:\\n    print(-1)\\nelse:\\n\\n    # (h2 - h1) <= k * (day - night) * 12 + day * 12 + day * 8 - night * 12\\n\\n    print((\\n        int(math.ceil(\\n            ((h2 - h1) - day * 20 + night * 12) / ((day - night) * 12)\\n        )) + 1\\n    ))\\n\", \"x=input().split()\\ny=input().split()\\ndif=int(x[1])-int(x[0])\\ncnt=0\\n\\n\\nif dif-int(y[0])*8<=0:\\n\\tprint(0)\\nelif int(y[0])-int(y[1])>0:\\n\\tdif=dif-int(y[0])*8+int(y[1])*12\\n\\twhile dif>0:\\n\\t\\tdif-=int(y[0])*12\\n\\t\\tif dif<=0:\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tbreak\\n\\t\\telse :\\n\\t\\t\\tcnt+=1\\n\\t\\t\\tdif+=int(y[1])*12\\n\\tprint(cnt)\\nelse: print(-1)\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\", \"'__author__'=='deepak Singh Mehta) '\\n\\nh1, h2 = list(map(int, input().split()))\\na, b = list(map(int, input().split()))\\nh1 += a * 8\\nif h1 >= h2:\\n    print(0)\\nelse:\\n    h1 -= b * 12\\n    if b >= a:\\n        print(-1)\\n    else:\\n        day = 0\\n        while True:\\n            day += 1\\n            h1 += a * 4\\n            '''if h1 > h2:\\n                print(-1)\\n                break'''\\n            h1 += a * 8\\n            if h1 >= h2:\\n                print(day)\\n                break\\n            h1 -= b * 12\\n\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        print(h // (12 * (a - b)) + (1 if h % (12 * (a - b)) else 0))\", \"h1, h2 = map(int, input().split(' '))\\nh = h2 - h1\\n\\na, b = map(int, input().split())\\nh -= a * 8\\n\\nif h <= 0:\\n        print (0)\\nelif a <= b:\\n        print(-1)\\nelse:\\n        h -= 1\\n        print(h // (12 * (a - b)) + 1)\", \"ch=input()\\nd=ch.split()\\nh1=int(d[0])\\nh2=int(d[1])\\nch=input()\\nd1=ch.split()\\na=int(d1[0])\\nb=int(d1[1])\\nS=2\\nD=0\\nif h1<h2:\\n    if b>a and 8*a<(h2-h1):\\n        print(-1)\\n    elif b==a and 8*a<(h2-h1):\\n        print(-1)\\n    else:\\n        if  h1<h2 :\\n            if 8*a>=(h2-h1):\\n                print(0)\\n            else:\\n                h1+=a*8\\n                h1-=b*12\\n                D+=1\\n            while h1<h2:\\n                if h1+a*12>=h2:\\n                    break\\n                h1+=(a-b)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\nelse:\\n    h1+8*a\\n    if a>b and 12*b<(h1-h2):\\n        print(-1)\\n    elif b==a and b*12<(8*a+h1-h2):\\n        print(-1)\\n    else:\\n        if  h1>h2 :\\n            \\n            if 12*b>=(h1-h2):\\n                print(0)\\n            else:\\n                h2+=a*12\\n                h2-=b*12\\n                D+=1\\n            while h1>h2:\\n                if h2-b*12>=h1:\\n                    break\\n                h2+=(b-a)*12\\n                D+=1\\n            if D!=0:\\n                print(D)\\n    \\n            \\n        \\n                \\n        \\n        \\n\", \"#http://codeforces.com/contest/652/problem/A\\n\\n\\n# h_cat, h_app, day_up, day_down = [map(int, input().split()), map(int,input().split())]\\n\\ndef dprint(str):\\n\\tpstatus = False\\n\\tif pstatus == True:\\n\\t\\tprint(str)\\n\\ndef check_cat():\\n\\tfrom math import ceil\\n\\tfrom operator import add\\n\\t# h_string = '10 30'\\n\\t# speed_string = '2 1'\\n\\t# h_string = '10 13'\\n\\t# speed_string = '1 1'\\n\\t# h_string = '1 50'\\n\\t# speed_string = '5 4'\\n\\t# h_string = '10 19'\\n\\t# speed_string = '1 2'\\n\\t# h_string = '1 1000'\\n\\t# speed_string = '2 1'\\n\\n\\n\\n\\th_string = input()\\n\\tspeed_string = input()\\n\\th_cat, h_app = list(map(int, h_string.split()))\\n\\tday_up, day_down = list(map(int, speed_string.split()))\\n\\tday_sub = [4*day_up, 8*day_up, -12*day_down]\\n\\tflag = False\\n\\tday_loc = [0, h_cat]\\n\\tcurrent_pos = day_loc[1]\\n\\tday_counter = 0\\n\\ti1 = 0\\n\\tif sum(day_sub) <=0: #overall negative or zero progress\\n\\t\\tif (h_cat + day_sub[1] >= h_app): #reach the apple in first day\\n\\t\\t\\treturn(0)\\n\\t\\telse:\\n\\t\\t\\treturn(-1)\\n\\twhile not flag:\\n\\t\\tif current_pos >= h_app:\\n\\t\\t\\tflag = True\\n\\t\\t\\tbreak\\n\\t\\telse:\\n\\t\\t\\ti1 += 1\\n\\t\\t\\tcurrent_pos += day_sub[i1%3]\\n\\t\\t\\tday_loc.append(current_pos)\\n\\tdprint(day_loc)\\n\\tday_counter = i1\\n\\tdprint(day_counter)\\n\\tdprint(day_counter%3)\\n\\n\\treturn(int(day_counter/3))\\n\\noutput = check_cat()\\nprint(output)\\n\\n\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    h = b - a\\n    a, b = list(map(int, input().split()))\\n    h -= a * 8\\n    if h <= 0:\\n        res = 0\\n    elif a <= b:\\n        res = -1\\n    else:\\n        a = (a - b) * 12\\n        res = (h + a - 1) // a\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"H1, H2 = list(map(int, input().split()))\\nA, B = list(map(int, input().split()))\\n\\nnum = H2-H1-8*A\\nden = 12*(A-B)\\nif den > 0:\\n\\tans = max(0, (num+den-1) // den)\\nelse:\\n\\tans = 0 if num <= 0 else -1\\nprint(ans)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    cnt = 0\\n    h1 += 8*a\\n    while h1 < h2:\\n        h1 += 12*(a-b)\\n        cnt += 1\\n    print(cnt)\\n\", \"h1, h2 = list(map(int, input().split(' ')))\\na, b = list(map(int, input().split(' ')))\\n\\nif h1+8*a >= h2:\\n    print(0)\\nelif a <= b:\\n    print(-1)\\nelse:\\n    dis = h2-h1-8*a\\n    inc = (a-b)*12\\n    print((dis+inc-1)//inc)\\n\", \"3\\n\\nclass StdReader:\\n\\tdef read_int(self):\\n\\t\\treturn int(self.read_string())\\n\\n\\tdef read_ints(self, sep=None):\\n\\t\\treturn [int(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_float(self):\\n\\t\\treturn float(self.read_string())\\n\\n\\tdef read_floats(self, sep=None):\\n\\t\\treturn [float(i) for i in self.read_strings(sep)]\\n\\n\\tdef read_string(self):\\n\\t\\treturn input()\\n\\n\\tdef read_strings(self, sep=None):\\n\\t\\treturn self.read_string().split(sep)\\n\\nreader = StdReader()\\n\\n\\ndef main():\\n\\th1, h2 = reader.read_ints()\\n\\ta, b = reader.read_ints()\\n\\n\\tif h1 + a * (22-14) >= h2:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\n\\tif a <= b:\\n\\t\\tprint(-1)\\n\\t\\treturn\\n\\n\\th1 = h1 + a*(22-14)\\n\\tdh = (a-b) * 12\\n\\t# print(h1, h2, dh)\\n\\n\\tdays = (h2-h1) // dh + ((h2-h1)%dh != 0)\\n\\n\\tprint(days)\\n\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd = 0\\nr = h1\\nwhile(True):\\n    h1 += 8 * a\\n    if h1 >= h2:\\n        print(d)\\n        return\\n    d += 1\\n    h1 = h1 - 12 * b + 4 * a\\n    if d > 1 and h1 <= r:\\n        print(\\\"-1\\\")\\n        return\", \"h1, h2 = map(int, input().split())\\na, b = map(int, input().split())\\nd, v = h2 - h1 - 8 * a, 12 * (a - b)\\nif d <= 0:\\n    print(0)\\nelif b >= a:\\n    print(-1)\\nelse:\\n    print((d + v - 1) // v)\", \"h1,h2 = list(map(int, input().split(\\\" \\\")))\\na,b = list(map(int, input().split(\\\" \\\")))\\n\\ndef caterpillar(a,b,h1,h2):\\n    if h1 + 8*a >= h2:\\n        print(0)\\n    else:\\n        h = h1 + 8*a\\n        if 12*(a-b) <= 0:\\n            print(-1)\\n        else:\\n            c = h2-h\\n            d = 12*(a-b)\\n            print( (c // d) + (c%d > 0)*1)\\n\\ncaterpillar(a,b,h1,h2)\\n\", \"h, g = [int(x) for x in input().split(' ')]\\na, b = [int(x) for x in input().split(' ')]\\nans = 0\\nh += 8 * a\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"h, g = map(int, input().split())\\na, b = map(int, input().split())\\nans = 0\\nh += a << 3\\nuph = h\\nwhile g > h:\\n    ans += 1\\n    h += 12 * (a - b)\\n    if h <= uph:\\n        ans = -1\\n        break\\n    uph = h\\nprint(ans)\", \"def pillar():\\n    temp=input().split()\\n    bugHeight=int(temp[0])\\n    appleHeight=int(temp[1])\\n    temp=input().split()\\n    dayRate=int(temp[0])\\n    nightRate=int(temp[1])\\n    if(dayRate*8+bugHeight>=appleHeight):\\n        return 0\\n    else:\\n        bugHeight+=dayRate*8-nightRate*12\\n        if(bugHeight+(dayRate*12)<appleHeight and nightRate>=dayRate):\\n            return -1\\n        if(appleHeight-(bugHeight+12*dayRate)<=0):\\n           return 1\\n        temp=((appleHeight-(bugHeight+12*dayRate))/(dayRate*12.0-12*nightRate))\\n        if(temp==int(temp)):\\n              return int(temp)+1\\n        return int(temp)+2\\n    \\nprint(pillar())\\n\"]",
        "difficulty": "interview",
        "input": "1 18\n2 2\n",
        "output": "-1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/652/A"
    },
    {
        "id": 827,
        "task_id": 372,
        "test_case_id": 21,
        "question": "You are given two circles. Find the area of their intersection.\n\n\n-----Input-----\n\nThe first line contains three integers x_1, y_1, r_1 ( - 10^9 ≤ x_1, y_1 ≤ 10^9, 1 ≤ r_1 ≤ 10^9) — the position of the center and the radius of the first circle.\n\nThe second line contains three integers x_2, y_2, r_2 ( - 10^9 ≤ x_2, y_2 ≤ 10^9, 1 ≤ r_2 ≤ 10^9) — the position of the center and the radius of the second circle.\n\n\n-----Output-----\n\nPrint the area of the intersection of the circles. The answer will be considered correct if the absolute or relative error doesn't exceed 10^{ - 6}.\n\n\n-----Examples-----\nInput\n0 0 4\n6 0 4\n\nOutput\n7.25298806364175601379\n\nInput\n0 0 5\n11 0 5\n\nOutput\n0.00000000000000000000",
        "solutions": "[\"#!/usr/bin/env python3\\n# 600D_circles.py - Codeforces.com/problemset/problem/600/D by Sergey 2015\\n\\nimport unittest\\nimport sys\\nimport math\\nimport decimal\\n\\n###############################################################################\\n# Circles Class (Main Program)\\n###############################################################################\\n\\n\\ndef sin(x):\\n    decimal.getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 1, 0, x, 1, x, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i-1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef cos(x):\\n    decimal.getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 0, 0, 1, 1, 1, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i-1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef pi():\\n    decimal.getcontext().prec += 2\\n    three = decimal.Decimal(3)\\n    lasts, t, s, n, na, d, da = 0, three, 3, 1, 0, 0, 24\\n    while s != lasts:\\n        lasts = s\\n        n, na = n+na, na+8\\n        d, da = d+da, da+32\\n        t = (t * n) / d\\n        s += t\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef asin(x):\\n    decimal.getcontext().prec += 2\\n    b, e = -pi()/2, pi()/2\\n    while True:\\n        mid = (b + e) / 2\\n        if e == mid or b == mid:\\n            break\\n        if sin(mid) <= x:\\n            b = mid\\n        else:\\n            e = mid\\n    decimal.getcontext().prec -= 2\\n    return +b\\n\\n\\ndef acos(x):\\n    return pi() / 2 - asin(x)\\n\\n\\nclass Circles:\\n    \\\"\\\"\\\" Circles representation \\\"\\\"\\\"\\n\\n    def __init__(self, test_inputs=None):\\n        \\\"\\\"\\\" Default constructor \\\"\\\"\\\"\\n\\n        it = iter(test_inputs.split(\\\"\\\\n\\\")) if test_inputs else None\\n\\n        def uinput():\\n            return next(it) if it else sys.stdin.readline().rstrip()\\n\\n        # Reading single elements\\n        [self.xa, self.ya, self.ra] = list(map(decimal.Decimal, uinput().split()))\\n        [self.xb, self.yb, self.rb] = list(map(decimal.Decimal, uinput().split()))\\n\\n        decimal.getcontext().prec = 40\\n\\n        self.l = ((self.xb - self.xa)**2 + (self.yb - self.ya)**2).sqrt()\\n        self.p = (self.ra + self.rb + self.l)/2\\n\\n        if self.l >= self.p:\\n            self.sa = 0\\n            self.sb = 0\\n        elif self.ra >= self.p:\\n            self.sa = 0\\n            self.sb = self.rb**2 * decimal.Decimal.from_float(math.pi)\\n        elif self.rb >= self.p:\\n            self.sa = self.ra**2 * decimal.Decimal.from_float(math.pi)\\n            self.sb = 0\\n        else:\\n            self.aa = 2 * acos(\\n                (self.ra**2 - self.rb**2 + self.l**2) /\\n                (2 * self.ra * self.l))\\n            self.ab = 2 * acos(\\n                (self.rb**2 - self.ra**2 + self.l**2) /\\n                (2 * self.rb * self.l))\\n            self.sa = self.ra**2 * (self.aa - sin(self.aa)) / 2\\n            self.sb = self.rb**2 * (self.ab - sin(self.ab)) / 2\\n\\n    def calculate(self):\\n        \\\"\\\"\\\" Main calcualtion function of the class \\\"\\\"\\\"\\n\\n        result = self.sa + self.sb\\n\\n        return str(result)\\n\\n###############################################################################\\n# Unit Tests\\n###############################################################################\\n\\n\\nclass unitTests(unittest.TestCase):\\n\\n    def test_single_test(self):\\n        \\\"\\\"\\\" Circles class testing \\\"\\\"\\\"\\n\\n        # Constructor test\\n        test = \\\"0 0 4\\\\n6 0 4\\\"\\n        d = Circles(test)\\n        self.assertEqual(d.l, 6)\\n\\n        # Sample test\\n        self.assertEqual(Circles(test).calculate()[:8], \\\"7.252988\\\")\\n\\n        # Sample test\\n        test = \\\"0 0 5\\\\n11 0 5\\\"\\n        self.assertEqual(Circles(test).calculate(), \\\"0\\\")\\n\\n        # Sample test\\n        test = \\\"44721 999999999 400000000\\\\n0 0 600000000\\\"\\n        self.assertEqual(Circles(test).calculate()[:9], \\\"0.0018834\\\")\\n\\n        # My tests\\n        test = \\\"\\\"\\n        # self.assertEqual(Circles(test).calculate(), \\\"0\\\")\\n\\n        # Time limit test\\n        # self.time_limit_test(5000)\\n\\n    def time_limit_test(self, nmax):\\n        \\\"\\\"\\\" Timelimit testing \\\"\\\"\\\"\\n        import random\\n        import timeit\\n\\n        # Random inputs\\n        test = str(nmax) + \\\" \\\" + str(nmax) + \\\"\\\\n\\\"\\n        numnums = [str(i) + \\\" \\\" + str(i+1) for i in range(nmax)]\\n        test += \\\"\\\\n\\\".join(numnums) + \\\"\\\\n\\\"\\n        nums = [random.randint(1, 10000) for i in range(nmax)]\\n        test += \\\" \\\".join(map(str, nums)) + \\\"\\\\n\\\"\\n\\n        # Run the test\\n        start = timeit.default_timer()\\n        d = Circles(test)\\n        calc = timeit.default_timer()\\n        d.calculate()\\n        stop = timeit.default_timer()\\n        print((\\\"\\\\nTimelimit Test: \\\" +\\n              \\\"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\\\".\\n              format(stop-start, calc-start, stop-calc)))\\n\\ndef __starting_point():\\n\\n    # Avoiding recursion limitaions\\n    sys.setrecursionlimit(100000)\\n\\n    if sys.argv[-1] == \\\"-ut\\\":\\n        unittest.main(argv=[\\\" \\\"])\\n\\n    # Print the result string\\n    sys.stdout.write(Circles().calculate())\\n\\n__starting_point()\", \"#!/usr/bin/env python3\\n# 600D_circles.py - Codeforces.com/problemset/problem/600/D by Sergey 2015\\n\\nimport unittest\\nimport sys\\nimport math\\nimport decimal\\n\\n###############################################################################\\n# Circles Class (Main Program)\\n###############################################################################\\n\\n\\ndef sin(x):\\n    decimal.getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 1, 0, x, 1, x, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i-1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef cos(x):\\n    decimal.getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 0, 0, 1, 1, 1, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i-1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef pi():\\n    decimal.getcontext().prec += 2\\n    three = decimal.Decimal(3)\\n    lasts, t, s, n, na, d, da = 0, three, 3, 1, 0, 0, 24\\n    while s != lasts:\\n        lasts = s\\n        n, na = n+na, na+8\\n        d, da = d+da, da+32\\n        t = (t * n) / d\\n        s += t\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef asin(x):\\n    decimal.getcontext().prec += 2\\n    b, e = -pi()/2, pi()/2\\n    while True:\\n        mid = (b + e) / 2\\n        if e == mid or b == mid:\\n            break\\n        if sin(mid) <= x:\\n            b = mid\\n        else:\\n            e = mid\\n    decimal.getcontext().prec -= 2\\n    return +b\\n\\n\\ndef acos(x):\\n    return pi() / 2 - asin(x)\\n\\n\\nclass Circles:\\n    \\\"\\\"\\\" Circles representation \\\"\\\"\\\"\\n\\n    def __init__(self, test_inputs=None):\\n        \\\"\\\"\\\" Default constructor \\\"\\\"\\\"\\n\\n        it = iter(test_inputs.split(\\\"\\\\n\\\")) if test_inputs else None\\n\\n        def uinput():\\n            return next(it) if it else sys.stdin.readline().rstrip()\\n\\n        # Reading single elements\\n        [self.xa, self.ya, self.ra] = list(map(decimal.Decimal, uinput().split()))\\n        [self.xb, self.yb, self.rb] = list(map(decimal.Decimal, uinput().split()))\\n\\n        decimal.getcontext().prec = 20\\n\\n        self.l = ((self.xb - self.xa)**2 + (self.yb - self.ya)**2).sqrt()\\n        self.p = (self.ra + self.rb + self.l)/2\\n\\n        if self.l >= self.p:\\n            self.sa = 0\\n            self.sb = 0\\n        elif self.ra >= self.p:\\n            self.sa = 0\\n            self.sb = self.rb**2 * decimal.Decimal.from_float(math.pi)\\n        elif self.rb >= self.p:\\n            self.sa = self.ra**2 * decimal.Decimal.from_float(math.pi)\\n            self.sb = 0\\n        else:\\n            self.aa = 2 * acos(\\n                (self.ra**2 - self.rb**2 + self.l**2) /\\n                (2 * self.ra * self.l))\\n            self.ab = 2 * acos(\\n                (self.rb**2 - self.ra**2 + self.l**2) /\\n                (2 * self.rb * self.l))\\n            self.sa = self.ra**2 * (self.aa - sin(self.aa)) / 2\\n            self.sb = self.rb**2 * (self.ab - sin(self.ab)) / 2\\n\\n    def calculate(self):\\n        \\\"\\\"\\\" Main calcualtion function of the class \\\"\\\"\\\"\\n\\n        result = self.sa + self.sb\\n\\n        return str(result)\\n\\n###############################################################################\\n# Unit Tests\\n###############################################################################\\n\\n\\nclass unitTests(unittest.TestCase):\\n\\n    def test_single_test(self):\\n        \\\"\\\"\\\" Circles class testing \\\"\\\"\\\"\\n\\n        # Constructor test\\n        test = \\\"0 0 4\\\\n6 0 4\\\"\\n        d = Circles(test)\\n        self.assertEqual(d.l, 6)\\n\\n        # Sample test\\n        self.assertEqual(Circles(test).calculate()[:8], \\\"7.252988\\\")\\n\\n        # Sample test\\n        test = \\\"0 0 5\\\\n11 0 5\\\"\\n        self.assertEqual(Circles(test).calculate(), \\\"0\\\")\\n\\n        # Sample test\\n        test = \\\"44721 999999999 400000000\\\\n0 0 600000000\\\"\\n        self.assertEqual(Circles(test).calculate()[:9], \\\"0.0018834\\\")\\n\\n        # My tests\\n        test = \\\"\\\"\\n        # self.assertEqual(Circles(test).calculate(), \\\"0\\\")\\n\\n        # Time limit test\\n        # self.time_limit_test(5000)\\n\\n    def time_limit_test(self, nmax):\\n        \\\"\\\"\\\" Timelimit testing \\\"\\\"\\\"\\n        import random\\n        import timeit\\n\\n        # Random inputs\\n        test = str(nmax) + \\\" \\\" + str(nmax) + \\\"\\\\n\\\"\\n        numnums = [str(i) + \\\" \\\" + str(i+1) for i in range(nmax)]\\n        test += \\\"\\\\n\\\".join(numnums) + \\\"\\\\n\\\"\\n        nums = [random.randint(1, 10000) for i in range(nmax)]\\n        test += \\\" \\\".join(map(str, nums)) + \\\"\\\\n\\\"\\n\\n        # Run the test\\n        start = timeit.default_timer()\\n        d = Circles(test)\\n        calc = timeit.default_timer()\\n        d.calculate()\\n        stop = timeit.default_timer()\\n        print((\\\"\\\\nTimelimit Test: \\\" +\\n              \\\"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\\\".\\n              format(stop-start, calc-start, stop-calc)))\\n\\ndef __starting_point():\\n\\n    # Avoiding recursion limitaions\\n    sys.setrecursionlimit(100000)\\n\\n    if sys.argv[-1] == \\\"-ut\\\":\\n        unittest.main(argv=[\\\" \\\"])\\n\\n    # Print the result string\\n    sys.stdout.write(Circles().calculate())\\n\\n__starting_point()\", \"\\\"\\\"\\\"\\nCodeforces Educational Round #2\\nProblem 600 D. Area of Two Circles' Intersection\\n\\n@author yamaton\\n@date 2015-11-30\\n      2015-12-02\\n\\\"\\\"\\\"\\n\\nimport sys\\nimport math\\nimport fractions\\n\\n\\ndef f(x):\\n    \\\"\\\"\\\"\\n    Compute  x - sin(x) cos(x)  without loss of significance\\n    \\\"\\\"\\\"\\n    if abs(x) < 0.01:\\n        return 2 * x**3 / 3 - 2 * x**5 / 15 + 4 * x**7 / 315\\n    return x - math.sin(x) * math.cos(x)\\n\\n\\ndef acos_sqrt(x, sgn):\\n    \\\"\\\"\\\"\\n    Compute acos(sqrt(x)) with accuracy even when |x| is close to 1.\\n    http://www.wolframalpha.com/input/?i=acos%28sqrt%281-y%29%29\\n    http://www.wolframalpha.com/input/?i=acos%28sqrt%28-1%2By%29%29\\n    \\\"\\\"\\\"\\n    assert isinstance(x, fractions.Fraction)\\n\\n    y = 1 - x\\n    if y < 0.01:\\n        pp('y < 0.01')\\n        numers = [1,  1,   3,   5,   35]\\n        denoms = [1,  6,  40, 112, 1152]\\n        ans = fractions.Fraction('0')\\n        for i, (n, d) in enumerate(zip(numers, denoms)):\\n            ans += y**i * n / d\\n        assert isinstance(y, fractions.Fraction)\\n        ans *= math.sqrt(y)\\n        if sgn >= 0:\\n            return ans\\n        else:\\n            return math.pi - ans\\n\\n    return math.acos(sgn * math.sqrt(x))\\n\\n\\ndef solve(r1, r2, d_squared):\\n    r1, r2 = min(r1, r2), max(r1, r2)\\n\\n    d = math.sqrt(d_squared)\\n    if d >= r1 + r2:  # circles are far apart\\n        return 0.0     \\n    if r2 >= d + r1:  # whole circle is contained in the other\\n        return math.pi * r1 ** 2\\n\\n    r1f, r2f, dsq = map(fractions.Fraction, [r1, r2, d_squared])\\n    r1sq, r2sq = map(lambda i: i * i, [r1f, r2f])\\n    numer1 = r1sq + dsq - r2sq\\n    cos_theta1_sq = numer1*numer1 / (4 * r1sq * dsq)\\n    numer2 = r2sq + dsq - r1sq\\n    cos_theta2_sq = numer2*numer2 / (4 * r2sq * dsq)\\n    theta1 = acos_sqrt(cos_theta1_sq, math.copysign(1, numer1))\\n    theta2 = acos_sqrt(cos_theta2_sq, math.copysign(1, numer2))\\n    result = r1 * r1 * f(theta1) + r2 * r2 * f(theta2)\\n\\n    pp(\\\"d = %.16e\\\" % d)\\n    pp(\\\"cos_theta1_sq = %.16e\\\" % cos_theta1_sq)\\n    pp(\\\"theta1 = %.16e\\\" % theta1)\\n    pp(\\\"theta2 = %.16e\\\" % theta2)\\n    pp(\\\"f(theta1) = %.16e\\\" % f(theta1))\\n    pp(\\\"f(theta2) = %.16e\\\" % f(theta2))\\n    pp(\\\"result = %.16e\\\" % result)\\n\\n    return result\\n\\n\\ndef pp(*args, **kwargs):\\n    return print(*args, file=sys.stderr, **kwargs)\\n\\n\\ndef main():\\n    x1, y1, r1 = map(int, input().split())\\n    x2, y2, r2 = map(int, input().split())\\n    d_squared = (x1-x2)**2 + (y1-y2)**2\\n    result = solve(r1, r2, d_squared)\\n    print(\\\"%.17f\\\" % result)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"\\\"\\\"\\\"\\nCodeforces Educational Round #2\\nProblem 600 D. Area of Two Circles' Intersection\\n\\n@author yamaton\\n@date 2015-11-30\\n      2015-12-02\\n\\\"\\\"\\\"\\n\\nimport sys\\nimport math\\nimport fractions\\n\\n\\ndef f(x):\\n    \\\"\\\"\\\"\\n    Compute  x - sin(x) cos(x)  without loss of significance\\n    \\\"\\\"\\\"\\n    if abs(x) < 0.01:\\n        return 2 * x**3 / 3 - 2 * x**5 / 15 + 4 * x**7 / 315\\n    return x - math.sin(x) * math.cos(x)\\n\\n\\ndef acos_sqrt(x, sgn):\\n    \\\"\\\"\\\"\\n    Compute acos(sgn * sqrt(x)) with accuracy even when |x| is close to 1.\\n    http://www.wolframalpha.com/input/?i=acos%28sqrt%281-y%29%29\\n    http://www.wolframalpha.com/input/?i=acos%28sqrt%28-1%2By%29%29\\n    \\\"\\\"\\\"\\n    assert isinstance(x, fractions.Fraction)\\n\\n    y = 1 - x\\n    if y < 0.01:\\n        pp('y < 0.01')\\n        numers = [1,  1,   3,   5,   35]\\n        denoms = [1,  6,  40, 112, 1152]\\n        ans = fractions.Fraction('0')\\n        for i, (n, d) in enumerate(zip(numers, denoms)):\\n            ans += y**i * n / d\\n        assert isinstance(y, fractions.Fraction)\\n        ans *= math.sqrt(y)\\n        if sgn >= 0:\\n            return ans\\n        else:\\n            return math.pi - ans\\n\\n    return math.acos(sgn * math.sqrt(x))\\n\\n\\ndef solve(r1, r2, d_squared):\\n    r1, r2 = min(r1, r2), max(r1, r2)\\n\\n    d = math.sqrt(d_squared)\\n    if d >= r1 + r2:  # circles are far apart\\n        return 0.0     \\n    if r2 >= d + r1:  # whole circle is contained in the other\\n        return math.pi * r1 ** 2\\n\\n    r1f, r2f, dsq = map(fractions.Fraction, [r1, r2, d_squared])\\n    r1sq, r2sq = map(lambda i: i * i, [r1f, r2f])\\n    numer1 = r1sq + dsq - r2sq\\n    cos_theta1_sq = numer1*numer1 / (4 * r1sq * dsq)\\n    numer2 = r2sq + dsq - r1sq\\n    cos_theta2_sq = numer2*numer2 / (4 * r2sq * dsq)\\n    theta1 = acos_sqrt(cos_theta1_sq, math.copysign(1, numer1))\\n    theta2 = acos_sqrt(cos_theta2_sq, math.copysign(1, numer2))\\n    result = r1 * r1 * f(theta1) + r2 * r2 * f(theta2)\\n\\n    # pp(\\\"d = %.16e\\\" % d)\\n    # pp(\\\"cos_theta1_sq = %.16e\\\" % cos_theta1_sq)\\n    # pp(\\\"theta1 = %.16e\\\" % theta1)\\n    # pp(\\\"theta2 = %.16e\\\" % theta2)\\n    # pp(\\\"f(theta1) = %.16e\\\" % f(theta1))\\n    # pp(\\\"f(theta2) = %.16e\\\" % f(theta2))\\n    # pp(\\\"result = %.16e\\\" % result)\\n\\n    return result\\n\\n\\ndef pp(*args, **kwargs):\\n    return print(*args, file=sys.stderr, **kwargs)\\n\\n\\ndef main():\\n    x1, y1, r1 = map(int, input().split())\\n    x2, y2, r2 = map(int, input().split())\\n    d_squared = (x1-x2)**2 + (y1-y2)**2\\n    result = solve(r1, r2, d_squared)\\n    print(\\\"%.17f\\\" % result)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"import math\\nimport decimal\\n\\ndef dec(n):\\n\\treturn decimal.Decimal(n)\\n\\ndef acos(x):\\n\\treturn dec(math.atan2((1-x**2).sqrt(),x))\\n\\ndef x_minus_sin_cos(x):\\n\\tif x<0.01:\\n\\t\\treturn 2*x**3/3-2*x**5/15+4*x**7/315\\n\\treturn x-dec(math.sin(x)*math.cos(x))\\n\\nx_1,y_1,r_1=map(int,input().split())\\nx_2,y_2,r_2=map(int,input().split())\\n\\npi=dec(31415926535897932384626433832795)/10**31\\nd_square=(x_1-x_2)**2+(y_1-y_2)**2\\nd=dec(d_square).sqrt()\\nr_min=min(r_1,r_2)\\nr_max=max(r_1,r_2)\\nif d+r_min<=r_max:\\n\\tprint(pi*r_min**2)\\nelif d>=r_1+r_2:\\n\\tprint(0)\\nelse:\\n\\tcos_1=(r_1**2+d_square-r_2**2)/(2*r_1*d)\\n\\tacos_1=acos(cos_1)\\n\\ts_1=(r_1**2)*x_minus_sin_cos(acos_1)\\n\\tcos_2=(r_2**2+d_square-r_1**2)/(2*r_2*d)\\n\\tacos_2=acos(cos_2)\\n\\ts_2=(r_2**2)*x_minus_sin_cos(acos_2)\\n\\tprint(s_1+s_2)\", \"from math import cos, sin\\nfrom decimal import Decimal, getcontext\\n\\ngetcontext().prec = 100\\n\\ndef sind(x):\\n    res = x\\n    xpow = x\\n    fact = 1\\n    i = 3\\n    while True:\\n        xpow *= -x * x\\n        fact *= i * (i-1)\\n        next_ = res + xpow / fact\\n        if res == next_: break\\n        res = next_\\n        i += 2\\n\\n    return res\\n\\ndef cosd(x):\\n    res = 1\\n    xpow = 1\\n    fact = 1\\n    i = 2\\n    while True:\\n        xpow *= -x * x\\n        fact *= i * (i-1)\\n        next_ = res + xpow / fact\\n        if res == next_: break\\n        res = next_\\n        i += 2\\n\\n    return res\\n\\ndef pi():\\n    lb, ub = Decimal('3.14'), Decimal('3.15')\\n    while True:\\n        mid = (lb + ub) / 2\\n        if mid in (lb, ub): break\\n        if sind(mid) < 0:\\n            ub = mid\\n        else:\\n            lb = mid\\n\\n    return lb\\n\\nPI = pi()\\n\\ndef acosd(x):\\n    lb, ub = Decimal(0), PI\\n    while True:\\n        mid = (lb + ub) / 2\\n        if mid in (lb, ub): break\\n        if cosd(mid) < x: ub = mid\\n        else: lb = mid\\n\\n    return lb\\n\\ndef asind(x):\\n    lb, ub = -PI/2, PI/2\\n    while True:\\n        mid = (lb + ub) / 2\\n        if mid in (lb, ub): break\\n        if sind(mid) < x: lb = mid\\n        else: ub = mid\\n\\n    return lb\\n\\ndef main():\\n    x1, y1, R = list(map(Decimal, input().split()))\\n    x2, y2, r = list(map(Decimal, input().split()))\\n\\n    if R > r:\\n        x1, x2 = x2, x1\\n        y1, y2 = y2, y1\\n        R, r = r, R\\n\\n    d = ((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1)).sqrt()\\n\\n    if R + r <= d:\\n        print(0)\\n        return\\n\\n    if d + R <= r:\\n        print(PI*R*R)\\n        return\\n\\n    res = Decimal(0)\\n    res += r*r*acosd((d*d+r*r-R*R)/(2*d*r))\\n    res += R*R*acosd((d*d+R*R-r*r)/(2*d*R))\\n    res -= ((-d+r+R)*(d+r-R)*(d-r+R)*(d+r+R)).sqrt() / 2\\n    print(res)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from math import pi\\nfrom decimal import *\\n\\ngetcontext().prec = 100\\n\\ndef cos(x):\\n    getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 0, 0, 1, 1, 1, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i-1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    getcontext().prec -= 2\\n    return +s\\n\\n\\ndef acos(x):\\n    mn, mx = Decimal(0), Decimal(pi)\\n    for i in range(1000):\\n        md = (mn+mx)/2\\n        if cos(md) <= x:\\n            mx = md\\n        else:\\n            mn = md\\n    return mx;\\n\\n\\ndef main():\\n    x1, y1, r1 = list(map(int, input().split()))\\n    x2, y2, r2 = list(map(int, input().split()))\\n\\n    x1, y1, r1 = Decimal(x1), Decimal(y1), Decimal(r1)\\n    x2, y2, r2 = Decimal(x2), Decimal(y2), Decimal(r2)\\n    \\n    \\n    dcx, dcy = x2-x1, y2-y1\\n    d = dcx**2 + dcy**2\\n\\n    if d >= (r1+r2)**2:\\n        print(\\\"0\\\")\\n        return\\n\\n    if d <= (r2-r1)**2:\\n        print(\\\"%.7f\\\"%(Decimal(pi)*r1.min(r2)**2))\\n        return\\n    \\n    d = d.sqrt()\\n    \\n    ans = r1*r1*acos((d*d+r1*r1-r2*r2)/(2*d*r1)) + r2*r2*acos((d*d+r2*r2-r1*r1)/(2*d*r2))\\n    ans = ans - Decimal((d + r1 + r2) * (-d + r1 + r2) * (d + r1 - r2) * (d + r2 - r1)).sqrt()/2\\n    \\n    print(\\\"%.7f\\\"%(ans))\\n\\nmain()\\n\", \"from math import acos\\nfrom decimal import *\\n\\neps = 2e-7\\npi = Decimal('3.141592653589793238462643383279502884197169399375105820974')\\n\\ndef _acos(x):\\n\\tif 1 - eps > abs(x) > eps:\\n\\t\\treturn Decimal(acos(x))\\n\\t\\n\\tif x < 0:\\n\\t\\treturn pi - _acos(-x)\\n\\n\\tif abs(x) < eps:\\n\\t\\treturn pi / 2 - x - x**3 / 6 - x**5 * 3 / 40 - x**7 * 5 / 112\\n\\telse:\\n\\t\\tt = Decimal(1) - x\\n\\t\\treturn (2*t).sqrt() * (1 + t / 12 + t**2 * 3 / 160 + t**3 * 5 / 448 / 2 + t**4 * 35 / 9216 / 2 + t**5 * 63 / 45056 / 2);\\n\\ngetcontext().prec = 40\\nO1 = [0, 0]\\nO2 = [0, 0]\\n\\nO1[0], O1[1], r1 = map(Decimal, input().split())\\nO2[0], O2[1], r2 = map(Decimal, input().split())\\n\\nd2 = (O1[0] - O2[0])**2 + (O1[1] - O2[1])**2\\nans = 0\\n\\nif d2 <= (r1 - r2)**2:  # d^2 <= |r1 - r2| -> a circle inside another one\\n\\tans = pi * (min(r1, r2) ** 2)\\n\\nelif (r1-r2)**2 < d2 < (r1+r2)**2:  # 2 circles cut\\n\\tkite = (-r1**4 - d2**2 - r2**4 + 2*(r1*r1*d2 + r2*r2*d2 + r1*r1*r2*r2)).sqrt()\\n\\td = d2.sqrt()\\n\\n\\talpha1 = _acos((r1**2 + d2 - r2**2) / (2 * r1 * d))\\n\\talpha2 = _acos((r2**2 + d2 - r1**2) / (2 * r2 * d))\\n\\n\\tans = r1**2 * alpha1 + r2**2 * alpha2 - kite / 2\\n\\nprint(\\\"%.9f\\\" % ans)\", \"from math import acos\\nfrom decimal import *\\n\\neps = 2e-7\\npi = Decimal('3.141592653589793238462643383279502884197169399375105820974')\\ngetcontext().prec = 40\\n\\ndef _acos(x):\\n\\tif 1 - eps > abs(x) > eps:\\n\\t\\treturn Decimal(acos(x))\\n\\t\\n\\tif x < 0:\\n\\t\\treturn pi - _acos(-x)\\n\\n\\tif abs(x) < eps:\\n\\t\\treturn pi / 2 - x - x**3 / 6 - x**5 * 3 / 40 - x**7 * 5 / 112\\n\\telse:\\n\\t\\tt = Decimal(1) - x\\n\\t\\treturn (2*t).sqrt() * (1 + t / 12 + t**2 * 3 / 160 + t**3 * 5 / 896 + t**4 * 35 / 18432 + t**5 * 63 / 90112);\\n\\nO1 = [0, 0]\\nO2 = [0, 0]\\n\\nO1[0], O1[1], r1 = map(Decimal, input().split())\\nO2[0], O2[1], r2 = map(Decimal, input().split())\\n\\nd2 = (O1[0] - O2[0])**2 + (O1[1] - O2[1])**2\\nans = 0\\n\\nif d2 <= (r1 - r2)**2:  # d^2 <= |r1 - r2| -> a circle inside another one\\n\\tans = pi * (min(r1, r2) ** 2)\\n\\nelif (r1-r2)**2 < d2 < (r1+r2)**2:  # 2 circles cut\\n\\tkite = (-r1**4 - d2**2 - r2**4 + 2*(r1*r1*d2 + r2*r2*d2 + r1*r1*r2*r2)).sqrt()\\n\\td = d2.sqrt()\\n\\n\\talpha1 = _acos((r1**2 + d2 - r2**2) / (2 * r1 * d))\\n\\talpha2 = _acos((r2**2 + d2 - r1**2) / (2 * r2 * d))\\n\\n\\tans = r1**2 * alpha1 + r2**2 * alpha2 - kite / 2\\n\\nprint(\\\"%.9f\\\" % ans)\", \"import math\\nfrom decimal import Decimal\\nfrom decimal import getcontext\\nfrom math import acos\\n\\n\\npi = Decimal('3.141592653589793238462643383279502884197169399375105820974')\\n\\ngetcontext().prec=5000\\n\\neps = 2e-7\\n\\ndef _acos(x):\\n    if 1 - eps > abs(x) > eps:\\n        return Decimal(acos(x))\\n\\n    if x < 0:\\n        return pi - _acos(-x)\\n\\n    if abs(x) < eps:\\n        return pi / 2 - x - x ** 3 / 6 - x ** 5 * 3 / 40 - x ** 7 * 5 / 112\\n    else:\\n        t = Decimal(1) - x\\n        return (2 * t).sqrt() * (\\n                    1 + t / 12 + t ** 2 * 3 / 160 + t ** 3 * 5 / 896 + t ** 4 * 35 / 18432 + t ** 5 * 63 / 90112);\\n\\n\\ndef Q(x):\\n    return x*x\\n\\ndef dist_four(x1,y1,x2,y2):\\n    return (Q(x1-x2)+Q(y1-y2)).sqrt()\\n\\nclass Point:\\n    def __init__(self,_x,_y):\\n        self.x=_x\\n        self.y=_y\\n    def __mul__(self, k):\\n        return Point(self.x*k,self.y*k)\\n\\n    def __truediv__(self, k):\\n        return Point(self.x/k,self.y/k)\\n\\n    def __add__(self, other):\\n        return Point(self.x+other.x,self.y+other.y)\\n\\n    def __sub__(self, other):\\n        return Point(self.x-other.x,self.y-other.y)\\n\\n    def len(self):\\n        return dist_four(0,0,self.x,self.y)\\n\\ndef dist(A,B):\\n    return dist_four(A.x,A.y,B.x,B.y)\\n\\n\\ndef get_square(a,b,c):\\n    return abs((a.x-c.x)*(b.y-c.y)-(b.x-c.x)*(a.y-c.y))/2\\n\\ndef get_square_r(r,q):\\n    cos_alpha=Q(q)/(-2*Q(r))+1\\n    alpha=Decimal(_acos(cos_alpha))\\n    sin_alpha=(1-cos_alpha*cos_alpha).sqrt()\\n    s=r*r/2*(alpha-sin_alpha)\\n    return s\\n\\ndef main():\\n    x1,y1,r1=map(Decimal,input().split())\\n    x2,y2,r2=map(Decimal,input().split())\\n    if x1==44721 and y1==999999999 and r1==400000000 and x2==0 and y2==0 and r2==600000000:\\n        print(0.00188343226909637451)\\n        return\\n\\n    d=dist_four(x1,y1,x2,y2)\\n    if d>=r1+r2:\\n        print(0)\\n        return\\n    if d+r1<=r2:\\n        print(\\\"%.9lf\\\"%(pi*r1*r1))\\n        return\\n    if d+r2<=r1:\\n        print(\\\"%.9lf\\\"%(pi*r2*r2))\\n        return\\n    x=(Q(r1)-Q(r2)+Q(d))/(2*d)\\n    O1=Point(x1,y1)\\n    O2=Point(x2,y2)\\n    O=O2-O1\\n    O=O/O.len()\\n    O=O*x\\n    O=O1+O\\n    p=(Q(r1)-Q(x)).sqrt()\\n    K=O-O1\\n    if((O-O1).len()==0):\\n        K=O-O2\\n    K_len=K.len()\\n    M=Point(K.y,-K.x)\\n    K=Point(-K.y,K.x)\\n    M=M*p\\n    K=K*p\\n    M=M/K_len\\n    K=K/K_len\\n    M=M+O\\n    K=K+O\\n    N=O2-O1\\n    N_len=N.len()\\n    N = N * r1\\n    N = N / N_len\\n    N = N + O1\\n    L=O1-O2\\n    L_len=L.len()\\n    L = L * r2\\n    L = L / L_len\\n    L = L + O2\\n    ans=get_square_r(r1,dist(M,N))+ get_square_r(r1,dist(N,K))+ get_square_r(r2,dist(M,L))+ get_square_r(r2,dist(L,K))+ get_square(M,N,K)+get_square(M,L,K)\\n    print(\\\"%.9lf\\\"%ans)\\n\\nmain()\", \"import math\\nfrom decimal import Decimal\\nfrom decimal import getcontext\\nfrom math import acos\\n\\n\\npi = Decimal('3.141592653589793238462643383279502884197169399375105820974')\\n\\ngetcontext().prec=100\\n\\neps = 2e-7\\n\\ndef _acos(x):\\n    if 1 - eps > abs(x) > eps:\\n        return Decimal(acos(x))\\n\\n    if x < 0:\\n        return pi - _acos(-x)\\n\\n    if abs(x) < eps:\\n        return pi / 2 - x - x ** 3 / 6 - x ** 5 * 3 / 40 - x ** 7 * 5 / 112\\n    else:\\n        t = Decimal(1) - x\\n        return (2 * t).sqrt() * (\\n                    1 + t / 12 + t ** 2 * 3 / 160 + t ** 3 * 5 / 896 + t ** 4 * 35 / 18432 + t ** 5 * 63 / 90112);\\n\\n\\ndef Q(x):\\n    return x*x\\n\\ndef dist_four(x1,y1,x2,y2):\\n    return (Q(x1-x2)+Q(y1-y2)).sqrt()\\n\\nclass Point:\\n    def __init__(self,_x,_y):\\n        self.x=_x\\n        self.y=_y\\n    def __mul__(self, k):\\n        return Point(self.x*k,self.y*k)\\n\\n    def __truediv__(self, k):\\n        return Point(self.x/k,self.y/k)\\n\\n    def __add__(self, other):\\n        return Point(self.x+other.x,self.y+other.y)\\n\\n    def __sub__(self, other):\\n        return Point(self.x-other.x,self.y-other.y)\\n\\n    def len(self):\\n        return dist_four(0,0,self.x,self.y)\\n\\ndef dist(A,B):\\n    return dist_four(A.x,A.y,B.x,B.y)\\n\\n\\ndef get_square(a,b,c):\\n    return abs((a.x-c.x)*(b.y-c.y)-(b.x-c.x)*(a.y-c.y))/2\\n\\ndef get_square_r(r,q):\\n    cos_alpha=Q(q)/(-2*Q(r))+1\\n    alpha=Decimal(_acos(cos_alpha))\\n    sin_alpha=(1-cos_alpha*cos_alpha).sqrt()\\n    s=r*r/2*(alpha-sin_alpha)\\n    return s\\n\\ndef main():\\n    x1,y1,r1=map(Decimal,input().split())\\n    x2,y2,r2=map(Decimal,input().split())\\n    if x1==44721 and y1==999999999 and r1==400000000 and x2==0 and y2==0 and r2==600000000:\\n        print(0.00188343226909637451)\\n        return\\n\\n    d=dist_four(x1,y1,x2,y2)\\n    if d>=r1+r2:\\n        print(0)\\n        return\\n    if d+r1<=r2:\\n        print(\\\"%.9lf\\\"%(pi*r1*r1))\\n        return\\n    if d+r2<=r1:\\n        print(\\\"%.9lf\\\"%(pi*r2*r2))\\n        return\\n    x=(Q(r1)-Q(r2)+Q(d))/(2*d)\\n    O1=Point(x1,y1)\\n    O2=Point(x2,y2)\\n    O=O2-O1\\n    O=O/O.len()\\n    O=O*x\\n    O=O1+O\\n    p=(Q(r1)-Q(x)).sqrt()\\n    K=O-O1\\n    if((O-O1).len()==0):\\n        K=O-O2\\n    K_len=K.len()\\n    M=Point(K.y,-K.x)\\n    K=Point(-K.y,K.x)\\n    M=M*p\\n    K=K*p\\n    M=M/K_len\\n    K=K/K_len\\n    M=M+O\\n    K=K+O\\n    N=O2-O1\\n    N_len=N.len()\\n    N = N * r1\\n    N = N / N_len\\n    N = N + O1\\n    L=O1-O2\\n    L_len=L.len()\\n    L = L * r2\\n    L = L / L_len\\n    L = L + O2\\n    ans=get_square_r(r1,dist(M,N))+ get_square_r(r1,dist(N,K))+ get_square_r(r2,dist(M,L))+ get_square_r(r2,dist(L,K))+ get_square(M,N,K)+get_square(M,L,K)\\n    print(\\\"%.9lf\\\"%ans)\\n\\nmain()\", \"import decimal\\nfrom decimal import Decimal\\n\\npi = Decimal('3.14159265358979323846264338327950288419716939937510')\\ndecimal.getcontext().prec = 40\\n\\n\\ndef cos(x):\\n    \\\"\\\"\\\"Return the cosine of x as measured in radians.\\n\\n    The Taylor series approximation works best for a small value of x.\\n    For larger values, first compute x = x % (2 * pi).\\n\\n    >>> print(cos(Decimal('0.5')))\\n    0.8775825618903727161162815826\\n    >>> print(cos(0.5))\\n    0.87758256189\\n    >>> print(cos(0.5+0j))\\n    (0.87758256189+0j)\\n\\n    \\\"\\\"\\\"\\n    decimal.getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 0, 0, 1, 1, 1, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i - 1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef sin(x):\\n    \\\"\\\"\\\"Return the sine of x as measured in radians.\\n\\n    The Taylor series approximation works best for a small value of x.\\n    For larger values, first compute x = x % (2 * pi).\\n\\n    >>> print(sin(Decimal('0.5')))\\n    0.4794255386042030002732879352\\n    >>> print(sin(0.5))\\n    0.479425538604\\n    >>> print(sin(0.5+0j))\\n    (0.479425538604+0j)\\n\\n    \\\"\\\"\\\"\\n    decimal.getcontext().prec += 2\\n    i, lasts, s, fact, num, sign = 1, 0, x, 1, x, 1\\n    while s != lasts:\\n        lasts = s\\n        i += 2\\n        fact *= i * (i - 1)\\n        num *= x * x\\n        sign *= -1\\n        s += num / fact * sign\\n    decimal.getcontext().prec -= 2\\n    return +s\\n\\n\\ndef acos(x):\\n    # binary search\\n    def f(xx):\\n        return cos(xx) - x\\n\\n    a = 0\\n    b = pi\\n    xx = (a + b) / 2\\n    fxx = f(xx)\\n    while abs(fxx) > Decimal('0.0000000000000000000001'):\\n        if fxx > 0:\\n            a = xx\\n        else:\\n            b = xx\\n        xx = (a + b) / 2\\n        fxx = f(xx)\\n        # print (xx, fxx)\\n    # print (f\\\"diff {xx-rel(x)}\\\")\\n    return xx\\n\\n\\ndef part(ra, rb, d2):\\n    d = Decimal(d2).sqrt()\\n    x = (ra ** 2 - rb ** 2 + d2) / (2 * d)\\n    a = Decimal(acos(x / ra))\\n    b = Decimal(acos((d - x) / rb))\\n    part_a = ra ** 2 * a - ra * ra * sin(a) * cos(a)\\n    part_b = rb ** 2 * b - rb * rb * sin(b) * cos(b)\\n    return part_a + part_b\\n\\nx1, y1, r1 = list(map(int, input().split()))\\nx2, y2, r2 = list(map(int, input().split()))\\ndist2 = (x1 - x2) ** 2 + (y1 - y2) ** 2\\n\\n\\n\\nif dist2 > (r1 + r2) ** 2:\\n    print(0)\\nelif dist2 <= (r1 - r2) ** 2:\\n    print(pi * min(r1, r2) ** 2)\\nelse:\\n    print(part(r1, r2, dist2))\\n\", \"from decimal import Decimal, getcontext\\n\\nclass Trigonometry():\\n    def __init__(self, precision):\\n        getcontext().prec = precision\\n        self.pi = self._pi_()\\n\\n    def _pi_(self):\\n        lo, hi = Decimal('3.14'), Decimal('3.15')\\n        while True:\\n            mid = (lo + hi) / 2\\n            if mid == lo or mid == hi:\\n                break\\n            if self.sin(mid) < 0:\\n                hi = mid\\n            else:\\n                lo = mid\\n        return lo\\n\\n    def sin(self, x):\\n        res = x\\n        xpow = x\\n        fact = Decimal(1)\\n        k = 3\\n        while True:\\n            xpow *= -x * x\\n            fact *= k * (k - 1)\\n            next = res + xpow / fact\\n            if res == next:\\n                break\\n            res = next\\n            k += 2\\n        return res\\n\\n    def cos(self, x):\\n        res = Decimal(1)\\n        xpow = Decimal(1)\\n        fact = Decimal(1)\\n        k = 2\\n        while True:\\n            xpow *= -x * x\\n            fact *= k * (k - 1)\\n            next = res + xpow / fact\\n            if res == next:\\n                break\\n            res = next\\n            k += 2\\n        return res\\n\\n    def exp(self, x):\\n        res = Decimal(1)\\n        xpow = Decimal(1)\\n        fact = Decimal(1)\\n        k = 1\\n        while True:\\n            xpow *= x\\n            fact *= k\\n            next = res + xpow / fact\\n            if res == next:\\n                break\\n            res = next\\n            k += 1\\n        return res\\n\\n    def acos(self, x):\\n        lo, hi = Decimal(0), self.pi\\n        while True:\\n            mid = (lo + hi) / 2\\n            if mid == lo or mid == hi:\\n                break\\n            if self.cos(mid) < x:\\n                hi = mid\\n            else:\\n                lo = mid\\n        return lo\\n\\n    def asin(self, x):\\n        lb, ub = -self.pi / 2, self.pi / 2\\n        while True:\\n            mid = (lo + hi) / 2\\n            if mid == lo or mid == hi:\\n                break\\n            if self.sin(mid) < x:\\n                lo = mid\\n            else:\\n                hi = mid\\n        return lo\\n\\nT = Trigonometry(100)\\n\\nx1, y1, r1 = map(Decimal, input().split())\\nx2, y2, r2 = map(Decimal, input().split())\\n\\nd = ((x1 - x2)**2 + (y1 - y2)**2).sqrt()\\n\\nif r1 + r2 <= d:\\n    s = 0\\n\\nelif abs(r1 - r2) < d < r1 + r2:\\n\\n    cos_ph1 = (d**2 + r1**2 - r2**2) / (2 * d * r1)\\n    cos_ph2 = (d**2 + r2**2 - r1**2) / (2 * d * r2)\\n    ph1 = T.acos(cos_ph1)\\n    ph2 = T.acos(cos_ph2)\\n    a = r1**2 * ph1 + r2**2 * ph2\\n    b = 4 * (d**2) * (r1**2) - (d**2 + r1**2 - r2**2)**2\\n    s = (4 * (a**2) - b) / (4 * a + 2 * (b.sqrt()))\\n\\nelse:\\n    s = min(r1**2 * T.pi, r2**2 * T.pi)\\n\\nprint(s)\", \"from decimal import Decimal, getcontext\\n \\nclass Trigonometry():\\n    def __init__(self, precision):\\n        getcontext().prec = precision\\n        self.pi = self._pi_()\\n \\n    def _pi_(self):\\n        lo, hi = Decimal('3.14'), Decimal('3.15')\\n        while True:\\n            mid = (lo + hi) / 2\\n            if mid == lo or mid == hi:\\n                break\\n            if self.sin(mid) < 0:\\n                hi = mid\\n            else:\\n                lo = mid\\n        return lo\\n \\n    def sin(self, x):\\n        res = x\\n        xpow = x\\n        fact = Decimal(1)\\n        k = 3\\n        while True:\\n            xpow *= -x * x\\n            fact *= k * (k - 1)\\n            next = res + xpow / fact\\n            if res == next:\\n                break\\n            res = next\\n            k += 2\\n        return res\\n \\n    def cos(self, x):\\n        res = Decimal(1)\\n        xpow = Decimal(1)\\n        fact = Decimal(1)\\n        k = 2\\n        while True:\\n            xpow *= -x * x\\n            fact *= k * (k - 1)\\n            next = res + xpow / fact\\n            if res == next:\\n                break\\n            res = next\\n            k += 2\\n        return res\\n \\n    def exp(self, x):\\n        res = Decimal(1)\\n        xpow = Decimal(1)\\n        fact = Decimal(1)\\n        k = 1\\n        while True:\\n            xpow *= x\\n            fact *= k\\n            next = res + xpow / fact\\n            if res == next:\\n                break\\n            res = next\\n            k += 1\\n        return res\\n \\n    def acos(self, x):\\n        lo, hi = Decimal(0), self.pi\\n        while True:\\n            mid = (lo + hi) / 2\\n            if mid == lo or mid == hi:\\n                break\\n            if self.cos(mid) < x:\\n                hi = mid\\n            else:\\n                lo = mid\\n        return lo\\n \\n    def asin(self, x):\\n        lb, ub = -self.pi / 2, self.pi / 2\\n        while True:\\n            mid = (lo + hi) / 2\\n            if mid == lo or mid == hi:\\n                break\\n            if self.sin(mid) < x:\\n                lo = mid\\n            else:\\n                hi = mid\\n        return lo\\n \\nT = Trigonometry(100)\\n \\nx1, y1, r1 = map(Decimal, input().split())\\nx2, y2, r2 = map(Decimal, input().split())\\n \\nd = ((x1 - x2)**2 + (y1 - y2)**2).sqrt()\\n \\nif r1 + r2 <= d:\\n    s = 0\\n \\nelif abs(r1 - r2) < d < r1 + r2:\\n \\n    cos_ph1 = (d**2 + r1**2 - r2**2) / (2 * d * r1)\\n    cos_ph2 = (d**2 + r2**2 - r1**2) / (2 * d * r2)\\n    ph1 = T.acos(cos_ph1)\\n    ph2 = T.acos(cos_ph2)\\n    a = r1**2 * ph1 + r2**2 * ph2\\n    b = 4 * (d**2) * (r1**2) - (d**2 + r1**2 - r2**2)**2\\n    s = (4 * (a**2) - b) / (4 * a + 2 * (b.sqrt()))\\n \\nelse:\\n    s = min(r1**2 * T.pi, r2**2 * T.pi)\\n \\nprint(s)\"]",
        "difficulty": "interview",
        "input": "567845488 379750385 112902105\n567845488 379750385 112902105\n",
        "output": "40045521256826535.57031250000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/600/D"
    },
    {
        "id": 828,
        "task_id": 474,
        "test_case_id": 1,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "5\n6 1 6 6 0\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 829,
        "task_id": 474,
        "test_case_id": 3,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "6\n1 1 0 1 1 1\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 830,
        "task_id": 474,
        "test_case_id": 5,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "6\n3 3 2 2 2 2\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 831,
        "task_id": 474,
        "test_case_id": 9,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "6\n2 2 2 2 1 5\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 832,
        "task_id": 474,
        "test_case_id": 13,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "11\n20 20 20 2 2 2 20 2 22 2 2\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 833,
        "task_id": 474,
        "test_case_id": 20,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "15\n2 2 1 2 2 2 2 1 2 2 2 1 2 2 3\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 834,
        "task_id": 474,
        "test_case_id": 29,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "7\n1 5 1 1 1 1 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 835,
        "task_id": 474,
        "test_case_id": 31,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "5\n1 1 1 0 2\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 836,
        "task_id": 474,
        "test_case_id": 34,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "5\n1 0 0 0 0\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 837,
        "task_id": 474,
        "test_case_id": 35,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "5\n6 6 6 4 7\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 838,
        "task_id": 474,
        "test_case_id": 36,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "6\n1 2 3 3 2 1\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 839,
        "task_id": 474,
        "test_case_id": 40,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "7\n1 1 1 0 1 2 2\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 840,
        "task_id": 474,
        "test_case_id": 41,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "3\n1 0 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 841,
        "task_id": 474,
        "test_case_id": 42,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "4\n2 2 1 3\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 842,
        "task_id": 474,
        "test_case_id": 44,
        "question": "You are given array $a_1, a_2, \\dots, a_n$. Find the subsegment $a_l, a_{l+1}, \\dots, a_r$ ($1 \\le l \\le r \\le n$) with maximum arithmetic mean $\\frac{1}{r - l + 1}\\sum\\limits_{i=l}^{r}{a_i}$ (in floating-point numbers, i.e. without any rounding).\n\nIf there are many such subsegments find the longest one.\n\n\n-----Input-----\n\nThe first line contains single integer $n$ ($1 \\le n \\le 10^5$) — length of the array $a$.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^9$) — the array $a$.\n\n\n-----Output-----\n\nPrint the single integer — the length of the longest subsegment with maximum possible arithmetic mean.\n\n\n-----Example-----\nInput\n5\n6 1 6 6 0\n\nOutput\n2\n\n\n\n-----Note-----\n\nThe subsegment $[3, 4]$ is the longest among all subsegments with maximum arithmetic mean.",
        "solutions": "[\"n = int(input())\\na = list(map(int,input().split()))\\nm = max(a)\\n\\ncurrent = 0\\nlongest = 0\\nfor x in a:\\n    if x == m:\\n        current +=1\\n    else:\\n        longest = max(current,longest)\\n        current = 0\\nlongest = max(current,longest)\\nprint (longest)\\n\\n\", \"ii = lambda: int(input())\\nmi = lambda: map(int, input().split())\\nli = lambda: list(mi())\\n\\nn = ii()\\na = li()\\nm = max(a)\\ni = 0\\nans = 1\\nwhile i < n:\\n    j = i + 1\\n    while j < n and a[i] == a[j]:\\n        j += 1\\n    if a[i] == m:\\n        ans = max(ans, j - i)\\n    i = j\\nprint(ans)\", \"n = int(input())\\na = list(map(int, input().split()))\\nq = max(a)\\ntmp = 0\\nnum = 0\\nfor i in range(n):\\n    if a[i] == q:\\n        tmp += 1\\n    else:\\n        num = max(num, tmp)\\n        tmp = 0\\nnum = max(num, tmp)\\nprint(num)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\nz = max(A)\\ncnt = 0\\nhop = 0\\nfor i in A:\\n    hop = max(hop, cnt)\\n    if i == z:\\n        cnt += 1\\n    else:\\n        cnt = 0\\nhop = max(hop, cnt)\\nprint(hop)\", \"#      \\nimport collections, atexit, math, sys, bisect \\n\\nsys.setrecursionlimit(1000000)\\ndef getIntList():\\n    return list(map(int, input().split()))    \\n\\nisdebug = False\\ntry :\\n    #raise ModuleNotFoundError\\n    import numpy\\n    def dprint(*args, **kwargs):\\n        #print(*args, **kwargs, file=sys.stderr)\\n        # in python 3.4 **kwargs is invalid???\\n        print(*args,  file=sys.stderr)\\n    dprint('debug mode')\\n    isdebug = True\\nexcept Exception:\\n    def dprint(*args, **kwargs):\\n        pass\\n\\n\\n\\ninId = 0\\noutId = 0\\nif not isdebug:\\n    inId = 0\\n    outId = 0\\nif inId>0:\\n    dprint('use input', inId)\\n    try:\\n        f = open('input'+ str(inId) + '.txt', 'r')\\n        sys.stdin = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid input file')\\nif outId>0:\\n    dprint('use output', outId)\\n    try:\\n        f = open('stdout'+ str(outId) + '.txt', 'w')\\n        sys.stdout = f #\\u6807\\u51c6\\u8f93\\u51fa\\u91cd\\u5b9a\\u5411\\u81f3\\u6587\\u4ef6\\n    except Exception:\\n        dprint('invalid output file')\\n        \\n    atexit.register(lambda :sys.stdout.close())     #idle \\u4e2d\\u4e0d\\u4f1a\\u6267\\u884c atexit\\n    \\nN, = getIntList()\\n#print(N)\\nza  = getIntList()\\nt = max(za)\\nl = 0\\nr = 0\\nfor x in za:\\n    if x==t:\\n        l+=1\\n    else:\\n        l=0\\n    r = max(r,l)\\nprint(r)\\n\\n\\n\\n\\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nk=max(a)\\n\\np=0\\nans = 1\\nfor i in range(n):\\n\\tif a[i]==k:\\n\\t\\tp+=1\\n\\telse:\\n\\t\\tans = max(ans,p)\\n\\t\\tp=0\\nans = max(ans,p)\\nprint(ans)\\n\", \"n = int(input())\\nA = list(map(int, input().split()))\\na = max(A)\\nacc = 0\\nans = 1\\nfor b in A:\\n  if b == a:\\n    acc += 1\\n  else:\\n    acc = 0\\n  ans = max(ans, acc)\\nprint(ans)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nc = max(a)\\nle = 0\\nans = -1\\nfor i in range(n):\\n    if c == a[i]:\\n        le += 1\\n    else:\\n        le = 0\\n    ans = max(ans, le)\\nprint(ans)\", \"n = int(input())\\ns = list(map(int, input().split()))\\nm = -1\\nrow = 0\\nmr = 0\\nfor i in s:\\n    if i == m:\\n        row += 1\\n    elif(i > m):\\n        m = i\\n        row = 1\\n        mr = 0\\n    else:\\n        row = 0\\n    mr = max(mr, row)\\nprint(mr)\", \"n=int(input())\\narr=list(map(int,input().split()))\\nmax1=max(arr)\\ni=0\\nans=1\\nwhile(i<n):\\n\\tif(arr[i]==max1):\\n\\t\\tcount=0\\n\\t\\twhile(i<n and arr[i]==max1):\\n\\t\\t\\tcount+=1\\n\\t\\t\\ti+=1\\n\\t\\tans=max(ans,count)\\n\\ti+=1\\nprint(ans)\", \"def mi():\\n    return list(map(int, input().split()))\\n'''\\n5\\n6 1 6 6 0\\n'''\\nn = int(input())\\na = list(mi())\\nt = max(a)\\n\\ncnt = 0\\ni = 0\\nwhile i<n:\\n    if a[i]==t:\\n        curcnt = 0\\n        while i<n and a[i]==t:\\n            curcnt+=1\\n            i+=1\\n        cnt = max(cnt, curcnt)\\n    i+=1\\nprint (cnt)\\n\", \"n = int(input())\\narr = list(map(int, input().split()))\\nm = max(arr)\\nc = 0\\ntemp = 0\\nfor x in arr:\\n    if x == m:\\n        c += 1\\n    else:\\n        if temp < c: temp = c\\n        c = 0\\nif temp < c: temp = c\\nprint(temp)\\n\", \"N = int(input())\\nA = [int(a) for a in input().split()]\\n\\nm = max(A)\\nma = 0\\nc = 0\\nfor i in range(N):\\n    if A[i] == m:\\n        c += 1\\n        ma = max(ma, c)\\n    else:\\n        c = 0\\nprint(ma)\", \"''' CODED WITH LOVE BY SATYAM KUMAR '''\\n\\n\\nfrom sys import stdin, stdout\\nimport cProfile, math\\nfrom collections import Counter\\nfrom bisect import bisect_left,bisect,bisect_right\\nimport itertools\\nfrom copy import deepcopy\\nfrom fractions import Fraction\\nimport sys, threading\\nimport operator as op\\nfrom functools import reduce\\nsys.setrecursionlimit(10**6) # max depth of recursion\\nthreading.stack_size(2**27)  # new thread will get stack of such size\\nfac_warmup = False\\nprintHeap = str()\\nmemory_constrained = False\\nP = 10**9+7\\nimport sys\\n\\nclass Operation:\\n    def __init__(self, name, function, function_on_equal, neutral_value=0):\\n        self.name = name\\n        self.f = function\\n        self.f_on_equal = function_on_equal\\ndef add_multiple(x, count):\\n    return x * count\\ndef min_multiple(x, count):\\n    return x\\ndef max_multiple(x, count):\\n    return x\\nsum_operation = Operation(\\\"sum\\\", sum, add_multiple, 0)\\nmin_operation = Operation(\\\"min\\\", min, min_multiple, 1e9)\\nmax_operation = Operation(\\\"max\\\", max, max_multiple, -1e9)\\nclass SegmentTree:\\n    def __init__(self,\\n                 array,\\n                 operations=[sum_operation, min_operation, max_operation]):\\n        self.array = array\\n        if type(operations) != list:\\n            raise TypeError(\\\"operations must be a list\\\")\\n        self.operations = {}\\n        for op in operations:\\n            self.operations[op.name] = op\\n        self.root = SegmentTreeNode(0, len(array) - 1, self)\\n    def query(self, start, end, operation_name):\\n        if self.operations.get(operation_name) == None:\\n            raise Exception(\\\"This operation is not available\\\")\\n        return self.root._query(start, end, self.operations[operation_name])\\n    def summary(self):\\n        return self.root.values\\n    def update(self, position, value):\\n        self.root._update(position, value)\\n    def update_range(self, start, end, value):\\n        self.root._update_range(start, end, value)\\n    def __repr__(self):\\n        return self.root.__repr__()\\nclass SegmentTreeNode:\\n    def __init__(self, start, end, segment_tree):\\n        self.range = (start, end)\\n        self.parent_tree = segment_tree\\n        self.range_value = None\\n        self.values = {}\\n        self.left = None\\n        self.right = None\\n        if start == end:\\n            self._sync()\\n            return\\n        self.left = SegmentTreeNode(start, start + (end - start) // 2,\\n                                    segment_tree)\\n        self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\\n                                     segment_tree)\\n        self._sync()\\n    def _query(self, start, end, operation):\\n        if end < self.range[0] or start > self.range[1]:\\n            return None\\n        if start <= self.range[0] and self.range[1] <= end:\\n            return self.values[operation.name]\\n        self._push()\\n        left_res = self.left._query(start, end,\\n                                    operation) if self.left else None\\n        right_res = self.right._query(start, end,\\n                                      operation) if self.right else None\\n        if left_res is None:\\n            return right_res\\n        if right_res is None:\\n            return left_res\\n        return operation.f([left_res, right_res])\\n    def _update(self, position, value):\\n        if position < self.range[0] or position > self.range[1]:\\n            return\\n        if position == self.range[0] and self.range[1] == position:\\n            self.parent_tree.array[position] = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update(position, value)\\n        self.right._update(position, value)\\n        self._sync()\\n    def _update_range(self, start, end, value):\\n        if end < self.range[0] or start > self.range[1]:\\n            return\\n        if start <= self.range[0] and self.range[1] <= end:\\n            self.range_value = value\\n            self._sync()\\n            return\\n        self._push()\\n        self.left._update_range(start, end, value)\\n        self.right._update_range(start, end, value)\\n        self._sync()\\n    def _sync(self):\\n        if self.range[0] == self.range[1]:\\n            for op in self.parent_tree.operations.values():\\n                current_value = self.parent_tree.array[self.range[0]]\\n                if self.range_value is not None:\\n                    current_value = self.range_value\\n                self.values[op.name] = op.f([current_value])\\n        else:\\n            for op in self.parent_tree.operations.values():\\n                result = op.f(\\n                    [self.left.values[op.name], self.right.values[op.name]])\\n                if self.range_value is not None:\\n                    bound_length = self.range[1] - self.range[0] + 1\\n                    result = op.f_on_equal(self.range_value, bound_length)\\n                self.values[op.name] = result\\n    def _push(self):\\n        if self.range_value is None:\\n            return\\n        if self.left:\\n            self.left.range_value = self.range_value\\n            self.right.range_value = self.range_value\\n            self.left._sync()\\n            self.right._sync()\\n            self.range_value = None\\n    def __repr__(self):\\n        ans = \\\"({}, {}): {}\\\\n\\\".format(self.range[0], self.range[1],\\n                                      self.values)\\n        if self.left:\\n            ans += self.left.__repr__()\\n        if self.right:\\n            ans += self.right.__repr__()\\n        return ans\\n\\ndef display(string_to_print):\\n    stdout.write(str(string_to_print) + \\\"\\\\n\\\")\\n\\ndef primeFactors(n): #n**0.5 complex \\n    factors = dict()\\n    for i in range(2,math.ceil(math.sqrt(n))+1):  \\n        while n % i== 0: \\n            if i in factors:\\n                factors[i]+=1\\n            else: factors[i]=1\\n            n = n // i \\n    if n>2:\\n        factors[n]=1\\n    return (factors)\\n\\ndef binary(n,digits = 20):\\n    b = bin(n)[2:]\\n    b = '0'*(20-len(b))+b\\n    return b\\n\\ndef isprime(n):\\n    \\\"\\\"\\\"Returns True if n is prime.\\\"\\\"\\\"\\n    if n < 4:\\n        return True\\n    if n % 2 == 0:\\n        return False\\n    if n % 3 == 0:\\n        return False\\n    i = 5\\n    w = 2\\n    while i * i <= n:\\n        if n % i == 0:\\n            return False\\n        i += w\\n        w = 6 - w\\n    return True\\nfactorial_modP = []\\ndef warm_up_fac(MOD):\\n    nonlocal factorial_modP,fac_warmup\\n    if fac_warmup: return\\n    factorial_modP= [1 for _ in range(fac_warmup_size+1)]\\n    for i in range(2,fac_warmup_size):\\n        factorial_modP[i]= (factorial_modP[i-1]*i) % MOD\\n    fac_warmup = True\\n\\ndef InverseEuler(n,MOD):\\n    return pow(n,MOD-2,MOD)\\n\\ndef nCr(n, r, MOD):\\n    nonlocal fac_warmup,factorial_modP\\n    if not fac_warmup:\\n        warm_up_fac(MOD)\\n        fac_warmup = True\\n    return (factorial_modP[n]*((pow(factorial_modP[r], MOD-2, MOD) * pow(factorial_modP[n-r], MOD-2, MOD)) % MOD)) % MOD\\n\\ndef test_print(*args):\\n    if testingMode:\\n        print(args)\\n\\ndef display_list(list1, sep=\\\" \\\"):\\n    stdout.write(sep.join(map(str, list1)) + \\\"\\\\n\\\")\\n\\ndef get_int():\\n    return int(stdin.readline().strip())\\n\\ndef get_tuple():\\n    return map(int, stdin.readline().split())\\n\\ndef get_list():\\n    return list(map(int, stdin.readline().split()))\\nimport heapq,itertools\\npq = []                         # list of entries arranged in a heap\\nentry_finder = {}               # mapping of tasks to entries\\nREMOVED = '<removed-task>' \\ndef add_task(task, priority=0):\\n    'Add a new task or update the priority of an existing task'\\n    if task in entry_finder:\\n        remove_task(task)\\n    count = next(counter)\\n    entry = [priority, count, task]\\n    entry_finder[task] = entry\\n    heapq.heappush(pq, entry)\\n\\ndef remove_task(task):\\n    'Mark an existing task as REMOVED.  Raise KeyError if not found.'\\n    entry = entry_finder.pop(task)\\n    entry[-1] = REMOVED\\n\\ndef pop_task():\\n    'Remove and return the lowest priority task. Raise KeyError if empty.'\\n    while pq:\\n        priority, count, task = heapq.heappop(pq)\\n        if task is not REMOVED:\\n            del entry_finder[task]\\n            return task\\n    raise KeyError('pop from an empty priority queue')\\nmemory = dict()\\ndef clear_cache():\\n    nonlocal memory\\n    memory = dict()\\ndef cached_fn(fn, *args):\\n    nonlocal memory\\n    if args in memory:\\n        return memory[args]\\n    else:\\n        result = fn(*args)\\n        memory[args] = result\\n        return result\\n\\n\\n# -------------------------------------------------------------- MAIN PROGRAM\\nTestCases = False\\ntestingMode = False\\nfac_warmup_size = 10**5+100\\noptimiseForReccursion = True #Can not be used clubbed with TestCases\\n\\ndef main():\\n    n = get_int()\\n    li = get_list()\\n    maxi = max(li)\\n    c=0\\n    res = 1\\n    for i in li:\\n        if i==maxi:\\n            c+=1\\n        else:\\n            res=max(c,res)\\n            c=0\\n    res=max(c,res)\\n    print(res)\\n\\n# --------------------------------------------------------------------- END=\\n\\n\\nif TestCases: \\n    for _ in range(get_int()): \\n        cProfile.run('main()') if testingMode else main() \\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()\", \"n=int(input())\\nA=list(map(int,input().split()))\\n\\nM=max(A)\\nANS=0\\ncount=0\\nfor a in A:\\n    if a==M:\\n        count+=1\\n        if ANS<count:\\n            ANS=count\\n    else:\\n        count=0\\nprint(ANS)\\n\", \"n = int(input())\\nA = [int(x) for x in input().split()]\\nmx = max(A)\\n\\nstreak = 0\\ncur = 0\\nfor a in A:\\n    if a == mx:\\n        cur += 1\\n        streak = max(streak, cur)\\n    else:\\n        cur = 0\\nprint(streak)\\n\", \"#\\t!/usr/bin/env python3\\n#\\tcoding: UTF-8\\n#\\tModified: <18/Feb/2019 09:13:07 PM>\\n\\n\\n#\\t\\u272a H4WK3yE\\u4e61\\n#\\tMohd. Farhan Tahir\\n#\\tIndian Institute Of Information Technology (IIIT),Gwalior\\n\\n#\\tQuestion Link\\n#\\n#\\n\\n# ///==========Libraries, Constants and Functions=============///\\n\\n\\nimport sys\\n\\ninf = float(\\\"inf\\\")\\nmod = 1000000007\\n\\n\\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef get_ints(): return list(map(int, sys.stdin.readline().split()))\\n\\n\\ndef input(): return sys.stdin.readline()\\n\\n# ///==========MAIN=============///\\n\\n\\ndef main():\\n    n = int(input())\\n    arr = get_array()\\n    #from collections import Counter\\n    maxi = max(arr)\\n    mx, curr = 0, 0\\n    for i in range(n):\\n        if arr[i] == maxi:\\n            curr += 1\\n            mx = max(mx, curr)\\n        else:\\n            curr = 0\\n    print(mx)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def inpl(): return list(map(int, input().split()))\\n\\nN = int(input())\\nA = inpl() + [-1]\\n\\nx = max(A)\\nctr = 0\\nans = 0\\nfor a in A:\\n    if a == x:\\n        ctr += 1\\n    else:\\n        ans = max(ans, ctr)\\n        ctr = 0\\nprint(ans)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\nimport sys  # {{{\\nimport os\\nimport time\\nimport re\\nfrom pydoc import help\\nimport string\\nimport math\\nfrom operator import itemgetter\\nfrom collections import Counter\\nfrom collections import deque\\nfrom collections import defaultdict as dd\\nimport fractions\\nfrom heapq import heappop, heappush, heapify\\nimport array\\nfrom bisect import bisect_left, bisect_right, insort_left, insort_right\\nfrom copy import deepcopy as dcopy\\nimport itertools\\n# }}}\\n\\n# pre-defined{{{\\nsys.setrecursionlimit(10**7)\\nINF = 10**20\\nGOSA = 1.0 / 10**10\\nMOD = 10**9+7\\nALPHABETS = [chr(i) for i in range(ord('a'), ord('z')+1)]  # can also use string module\\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\\ndef LS(): return sys.stdin.readline().split()\\ndef I(): return int(sys.stdin.readline())\\ndef F(): return float(sys.stdin.readline())\\ndef DP(N, M, first): return [[first] * M for n in range(N)]\\ndef DP3(N, M, L, first): return [[[first] * L for n in range(M)] for _ in range(N)]\\nfrom inspect import currentframe\\ndef dump(*args):\\n    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}\\n    print(', '.join(names.get(id(arg),'???')+' => '+repr(arg) for arg in args), file=sys.stderr)\\n# }}}\\n\\ndef local_input():# {{{\\n    from pcm.utils import set_stdin\\n    import sys\\n    from pathlib import Path\\n    parentdir = Path(os.path.dirname(__file__)).parent\\n    inputfile = parentdir.joinpath('test/sample-1.in')\\n    if len(sys.argv) == 1:\\n        set_stdin(inputfile)\\n# }}}\\n\\ndef solve():\\n    n = int(input())\\n    A = list(map(int, input().split()))\\n    m = max(A)\\n\\n    res = 0\\n    c = 0\\n    for a in A:\\n        if (a==m):\\n            c += 1\\n            res = max(res, c)\\n        else:\\n            c = 0\\n    print(res)\\n    return 0\\n\\ndef __starting_point():# {{{\\n    try:\\n        local_input()\\n    except:\\n        pass\\n    solve()\\n# vim: set foldmethod=marker:}}}\\n\\n__starting_point()\", \"n = int(input())\\n\\na = list(map(int, input().split()))\\n\\nmx = max(a)\\n\\nc = 0\\nmc = 0\\n\\nfor i in range(n):\\n    if a[i] == mx:\\n        c += 1\\n        mc = max(mc, c)\\n    else:\\n        mc = max(mc, c)\\n        c = 0\\nprint(mc)\", \"n=int(input())\\na=[int(s) for s in input().split()]\\na.append(-1)\\nmx=max(a)\\nans=1\\nk=0\\nfor i in range(n+1):\\n    if a[i]==mx:\\n        k+=1\\n    else:\\n        ans=max(ans,k)\\n        k=0\\nprint(ans)\\n    \\n\", \"n=int(input())\\na=list(map(int,input().split()))\\nmx=max(a)\\ncnt=0\\nans=0\\nfor i in range(n):\\n    if a[i]==mx:\\n        cnt+=1\\n    else:\\n        ans=max(ans,cnt)\\n        cnt=0\\nans=max(ans,cnt)\\nprint(ans)\\n\", \"\\nn = int(input())\\narr = [int(x) for x in input().split()]\\nmax_val = max(arr)\\n\\nmax_len = 0\\ncur_len = 0\\nfor a in arr:\\n    if a == max_val:\\n        cur_len += 1\\n        max_len = max(cur_len, max_len)\\n    else:\\n        cur_len = 0\\n\\nprint(max_len)\\n\", \"amount = int(input())\\narray = [int(s) for s in input().split()]\\nmax_ = max(array)\\ncounter = 0\\ncounter_max = 0\\nfor i in range(len(array)):\\n    if array[i] == max_:\\n        counter += 1\\n        if counter > counter_max:\\n            counter_max = counter\\n    else:\\n        counter = 0\\nprint(counter_max)\"]",
        "difficulty": "interview",
        "input": "3\n100 99 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1117/A"
    },
    {
        "id": 843,
        "task_id": 631,
        "test_case_id": 4,
        "question": "For a given array $a$ consisting of $n$ integers and a given integer $m$ find if it is possible to reorder elements of the array $a$ in such a way that $\\sum_{i=1}^{n}{\\sum_{j=i}^{n}{\\frac{a_j}{j}}}$ equals $m$? It is forbidden to delete elements as well as insert new elements. Please note that no rounding occurs during division, for example, $\\frac{5}{2}=2.5$.\n\n\n-----Input-----\n\nThe first line contains a single integer $t$ — the number of test cases ($1 \\le t \\le 100$). The test cases follow, each in two lines.\n\nThe first line of a test case contains two integers $n$ and $m$ ($1 \\le n \\le 100$, $0 \\le m \\le 10^6$). The second line contains integers $a_1, a_2, \\ldots, a_n$ ($0 \\le a_i \\le 10^6$) — the elements of the array.\n\n\n-----Output-----\n\nFor each test case print \"YES\", if it is possible to reorder the elements of the array in such a way that the given formula gives the given value, and \"NO\" otherwise.\n\n\n-----Example-----\nInput\n2\n3 8\n2 5 1\n4 4\n0 1 2 3\n\nOutput\nYES\nNO\n\n\n\n-----Note-----\n\nIn the first test case one of the reorders could be $[1, 2, 5]$. The sum is equal to $(\\frac{1}{1} + \\frac{2}{2} + \\frac{5}{3}) + (\\frac{2}{2} + \\frac{5}{3}) + (\\frac{5}{3}) = 8$. The brackets denote the inner sum $\\sum_{j=i}^{n}{\\frac{a_j}{j}}$, while the summation of brackets corresponds to the sum over $i$.",
        "solutions": "[\"import sys\\ninput=sys.stdin.readline\\n\\nT=int(input())\\nfor _ in range(T):\\n    n,m=list(map(int,input().split()))\\n    A=list(map(int,input().split()))\\n    s=sum(A)\\n    if (s==m):\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"for _ in range(int(input())):\\n    n,m = map(int,input().split())\\n    List = [int(x) for x in input().split()]\\n    if(sum(List) == m):\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\", \"t = int(input())\\nfor _ in range(t):\\n    n, m = list(map(int, input().split()))\\n    a = list(map(int, input().split()))\\n    if sum(a) == m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"from sys import stdin, stdout\\ninput = stdin.readline\\nfrom collections import defaultdict as dd\\nimport math\\ndef geti(): return list(map(int, input().strip().split()))\\ndef getl(): return list(map(int, input().strip().split()))\\ndef gets(): return input()\\ndef geta(): return int(input())\\ndef print_s(s): stdout.write(s+'\\\\n')\\n\\ndef solve():\\n    for _ in range(geta()):\\n        n,m=geti()\\n        a=getl()\\n        if sum(a)==m:\\n            print(\\\"YES\\\")\\n        else:\\n            print(\\\"NO\\\")\\n\\n\\ndef __starting_point():\\n    solve()\\n\\n__starting_point()\", \"import sys\\ninput = sys.stdin.readline\\nfor f in range(int(input())):\\n    n,m=map(int,input().split())\\n    a=list(map(int,input().split()))\\n    if sum(a)==m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\", \"#   ==========     //\\\\\\\\       //||     ||====//||\\n#       ||        //  \\\\\\\\        ||     ||   // ||\\n#       ||       //====\\\\\\\\       ||     ||  //  ||\\n#       ||      //      \\\\\\\\      ||     || //   ||\\n#   ========== //        \\\\\\\\  ========  ||//====|| \\n#  code\\n\\ndef solve():\\n    n, m = map(int, input().split())\\n    a = list(map(int, input().split()))\\n\\n    if sum(a) == m:\\n        print('YES')\\n    else:\\n        print('NO')\\n\\n\\n\\ndef main():\\n    t = 1\\n    t = int(input())\\n    for _ in range(t):\\n        solve()\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\nfor _ in range(int(input())):\\n    n,m = list(map(int,input().split()))\\n    a = list(map(int,input().split()))\\n    if m==sum(a):\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"for t in range(int(input())):\\n    n, m = list(map(int, input().split()))\\n    nums = list(map(int, input().split()))\\n    if sum(nums) ==m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"a=int(input())\\nfor i in range(a):\\n    x,y=list(map(int,input().split()))\\n    z=list(map(int,input().split()))\\n    if(sum(z)==y):\\n        print('YES')\\n    else:\\n        print('NO')\\n        \\n\", \"from sys import stdin, stdout\\nt=int(stdin.readline())\\nfor i in range(t):\\n\\tn,m=list(map(int,stdin.readline().split()))\\n\\tarr=list(map(int,stdin.readline().split()))\\n\\tif sum(arr)==m:\\n\\t\\tprint('YES')\\n\\telse:\\n\\t\\tprint('NO')\\n\", \"# map(int, input().split())\\ndef main():\\n    n, m = map(int, input().split())\\n    a = list(map(int, input().split()))\\n    if sum(a) == m:\\n        print('YES')\\n    else:\\n        print('NO')\\n\\n\\nrw = int(input())\\nfor wewq in range(rw):\\n    main()\", \"# Anything is possible when you are inner peace. Master Shifu (Kung Fun Panda)\\n# by : Blue Edge - Create some chaos\\n\\nfor _ in range(int(input())):\\n    n,m=list(map(int,input().split()))\\n    a=list(map(int,input().split()))\\n    print([\\\"YES\\\",\\\"NO\\\"][sum(a)!=m])\\n\", \"import sys\\nimport re\\nimport random\\nimport math\\nimport copy\\nfrom heapq import heappush, heappop, heapify\\nfrom functools import cmp_to_key\\nfrom bisect import bisect_left, bisect_right\\nfrom collections import defaultdict, deque, Counter\\n# sys.setrecursionlimit(1000000)\\n\\n# input aliases\\ninput = sys.stdin.readline\\ngetS = lambda: input().strip()\\ngetN = lambda: int(input())\\ngetList = lambda: list(map(int, input().split()))\\ngetZList = lambda: [int(x) - 1 for x in input().split()]\\n\\nINF = float(\\\"inf\\\")\\nMOD = 10**9 + 7\\ndivide = lambda x: pow(x, MOD-2, MOD)\\n\\n\\ndef calc(arr, idx):\\n    ret = 0\\n    for i in range(len(arr)):\\n        if idx == 0:\\n            break\\n        if idx & 1:\\n            ret += arr[i]\\n        idx >>= 1\\n\\n    return ret\\n\\ndef get_all_comb(arr):\\n    n = len(arr)\\n    ret = []\\n    for idx in range(1 << n):\\n        ret.append(calc(arr, idx))\\n\\n    return ret\\n\\ndef solve():\\n    n, m =getList()\\n    li = getList()\\n\\n    if sum(li) == m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n    return\\ndef main():\\n    n = getN()\\n    for _ in range(n):\\n        solve()\\n\\n    return\\ndef __starting_point():\\n    main()\\n    # solve()\\n\\n__starting_point()\", \"t = int(input())\\nfor _ in range(t):\\n\\tn, m = map(int, input().split())\\n\\tarr = [int(j) for j in input().split()]\\n\\tif sum(arr) == m:\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\", \"def __starting_point():\\n    t = int(input())\\n    while t:\\n        t -= 1\\n        n, m = map(int, input().split())\\n        a = [int(x) for x in input().split()]\\n        sum = 0\\n        for i in a:\\n            sum += i\\n        if sum == m:\\n            print('YES')\\n        else:\\n            print('NO')\\n__starting_point()\", \"def solve():\\n    n, m = list(map(int, input().split()))\\n    a = list(map(int, input().split()))\\n    if sum(a) == m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n    return\\n\\n\\ndef main():\\n    t = int(input())\\n    for i in range(t):\\n        solve()\\n    return\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"for t in range(int(input())):\\n\\tn,m=[int(x) for x in input().split(' ')]\\n\\ta=[int(x) for x in input().split(' ')]\\n\\tss=sum(a)\\n\\tif(ss==m):\\n\\t\\tprint(\\\"YES\\\")\\n\\telse:\\n\\t\\tprint(\\\"NO\\\")\", \"def solve(n,m):\\n    s=list(map(int,input().split()))\\n    if sum(s)==m :\\n        return 'YES'\\n    return 'NO'\\n\\nfor _ in range(int(input())):\\n    n,m=list(map(int,input().split()))\\n    print(solve(n,m))\\n\\n\", \"ans = []\\nfor _ in range(int(input())):\\n    n, m = map(int, input().split())\\n    u = list(map(int, input().split()))\\n    if sum(u) == m:\\n        ans.append('YES')\\n    else:\\n        ans.append('NO')\\nprint(*ans, sep='\\\\n')\\n\", \"for _ in range(int(input())):\\n    n,m=list(map(int,(input().split())))\\n    arr=list(map(int,input().split()))\\n    if sum(arr)==m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"import sys\\nimport math\\nimport itertools\\nimport functools\\nimport collections\\nimport operator\\nimport fileinput\\nimport copy\\nimport string\\n\\n\\nORDA = 97  # a\\ndef ii(): return int(input())\\ndef mi(): return map(int, input().split())\\ndef li(): return [int(i) for i in input().split()]\\ndef lcm(a, b): return abs(a * b) // math.gcd(a, b)\\ndef revn(n): return str(n)[::-1]\\ndef dd(): return collections.defaultdict(int)\\ndef ddl(): return collections.defaultdict(list)\\ndef sieve(n):\\n    if n < 2: return list()\\n    prime = [True for _ in range(n + 1)]\\n    p = 3\\n    while p * p <= n:\\n        if prime[p]:\\n            for i in range(p * 2, n + 1, p):\\n                prime[i] = False\\n        p += 2\\n    r = [2]\\n    for p in range(3, n + 1, 2):\\n        if prime[p]:\\n            r.append(p)\\n    return r\\ndef divs(n, start=2):\\n    r = []\\n    for i in range(start, int(math.sqrt(n) + 1)):\\n        if (n % i == 0):\\n            if (n / i == i):\\n                r.append(i)\\n            else:\\n                r.extend([i, n // i])\\n    return r\\ndef divn(n, primes):\\n    divs_number = 1\\n    for i in primes:\\n        if n == 1:\\n            return divs_number\\n        t = 1\\n        while n % i == 0:\\n            t += 1\\n            n //= i\\n        divs_number *= t\\ndef prime(n):\\n    if n == 2: return True\\n    if n % 2 == 0 or n <= 1: return False\\n    sqr = int(math.sqrt(n)) + 1\\n    for d in range(3, sqr, 2):\\n        if n % d == 0: return False\\n    return True\\ndef convn(number, base):\\n    new_number = 0\\n    while number > 0:\\n        new_number += number % base\\n        number //= base\\n    return new_number\\ndef cdiv(n, k): return n // k + (n % k != 0)\\ndef ispal(s):\\n    for i in range(len(s) // 2 + 1):\\n        if s[i] != s[-i - 1]:\\n            return False\\n    return True\\n\\n\\nfor _ in range(ii()):\\n    n, m = mi()\\n    a = li()\\n    if sum(a) == m:\\n        print(\\\"YES\\\")\\n    else:\\n        print('NO')\", \"for u in range(int(input())):\\n    n, m = map(int, input().split())\\n    x = [int(w) for w in input().split()]\\n    \\n    if(sum(x) == m):\\n        print(\\\"YES\\\")\\n        \\n    else:\\n        print(\\\"NO\\\")\", \"t = int(input())\\nfor _ in range(t):\\n    n,m = map(int, input().split())\\n    l=list(map(int, input().split()))\\n    if sum(l)==m:\\n        print('YES')\\n    else:\\n        print('NO')\", \"t=int(input())\\nfor i in range(t):\\n    n,m=list(map(int,input().split()))\\n    b=list(map(int,input().split()))\\n    if sum(b)==m:\\n        print(\\\"YES\\\")\\n    else:\\n        print(\\\"NO\\\")\\n\", \"t = int(input())\\n\\nfor i in range(t):\\n    n, m = list(map(int, input().split()))\\n    a = list(map(int, input().split()))\\n\\n    summ = 0\\n    for i in range(n):\\n        summ += a[i]\\n\\n    if summ == m:\\n        print('YES')\\n    else:\\n        print('NO')\"]",
        "difficulty": "interview",
        "input": "1\n3 0\n0 0 0\n",
        "output": "YES\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1436/A"
    },
    {
        "id": 844,
        "task_id": 670,
        "test_case_id": 27,
        "question": "In this problem we consider a very simplified model of Barcelona city.\n\nBarcelona can be represented as a plane with streets of kind $x = c$ and $y = c$ for every integer $c$ (that is, the rectangular grid). However, there is a detail which makes Barcelona different from Manhattan. There is an avenue called Avinguda Diagonal which can be represented as a the set of points $(x, y)$ for which $ax + by + c = 0$.\n\nOne can walk along streets, including the avenue. You are given two integer points $A$ and $B$ somewhere in Barcelona. Find the minimal possible distance one needs to travel to get to $B$ from $A$.\n\n\n-----Input-----\n\nThe first line contains three integers $a$, $b$ and $c$ ($-10^9\\leq a, b, c\\leq 10^9$, at least one of $a$ and $b$ is not zero) representing the Diagonal Avenue.\n\nThe next line contains four integers $x_1$, $y_1$, $x_2$ and $y_2$ ($-10^9\\leq x_1, y_1, x_2, y_2\\leq 10^9$) denoting the points $A = (x_1, y_1)$ and $B = (x_2, y_2)$.\n\n\n-----Output-----\n\nFind the minimum possible travel distance between $A$ and $B$. Your answer is considered correct if its absolute or relative error does not exceed $10^{-6}$.\n\nFormally, let your answer be $a$, and the jury's answer be $b$. Your answer is accepted if and only if $\\frac{|a - b|}{\\max{(1, |b|)}} \\le 10^{-6}$.\n\n\n-----Examples-----\nInput\n1 1 -3\n0 3 3 0\n\nOutput\n4.2426406871\n\nInput\n3 1 -9\n0 3 3 -1\n\nOutput\n6.1622776602\n\n\n\n-----Note-----\n\nThe first example is shown on the left picture while the second example us shown on the right picture below. The avenue is shown with blue, the origin is shown with the black dot. [Image]",
        "solutions": "[\"a, b, c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\nans0 = round(abs(x1 - x2) + abs(y1 - y2), 9)\\nif a * b ==0:\\n    print(ans0)\\n    raise SystemExit\\nx11 = (-c - b * y1) / a\\ny12 = (-c - a * x1) / b\\nx21 = (-c - b * y2) / a\\ny22 = (-c - a * x2) / b\\n\\nans1 = abs(x1 - x11) + abs(x21 - x2) + ((y2 - y1)**2 + (x21 - x11)**2)**0.5\\nans2 = abs(y1 - y12) + abs(x21 - x2) + ((y2 - y12)**2 + (x21 - x1)**2)**0.5\\nans3 = abs(y1 - y12) + abs(y2 - y22) + ((x1 - x2)**2 + (y12 - y22)**2)**0.5\\nans4 = abs(x1 - x11) + abs(y22 - y2) + ((x11 - x2)**2 + (y1 - y22)**2)**0.5\\n\\nans0 = min(ans0, ans1, ans2, ans3, ans4)\\n\\nprint(round(ans0, 10))\\n\", \"a,b,c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\nif a == 0 or b == 0:\\n    print(abs(x1 -x2) + abs(y1 - y2))\\nelse:\\n    a = a / (-b)\\n    c = c / (-b)\\n    if (x1 <= x2 and y1 <= y2) or (x1 >= x2 and y1 >= y2):\\n        y1 = -y1\\n        y2 = -y2\\n        a = -a\\n        c = -c\\n        x1, x2, y1, y2 = min(x1, x2), max(x1, x2), max(y1, y2), min(y1, y2)\\n    ax = a\\n    bx = c\\n    ay = 1 / a\\n    by = - c / a\\n    ans = abs(x1 -x2) + abs(y1 - y2)\\n    Ax = ay * y1 + by\\n    Ay = ax * x1 + bx\\n    Bx = ay * y2 + by\\n    By = ax * x2 + bx\\n    ans = min(ans, abs(x1 - Ax) + abs(x2 - Bx) + ((Bx - Ax) ** 2 + (y1 - y2) ** 2)**0.5)\\n    ans = min(ans, abs(y1 - Ay) + abs(y2 - By) + ((By - Ay) ** 2 + (x1 - x2) ** 2)**0.5)\\n    ans = min(ans, abs(x1 - Ax) + abs(y2 - By) + ((x2 - Ax) ** 2 + (y1 - By) ** 2)**0.5)\\n    ans = min(ans, abs(x2 - Bx) + abs(Ay - y1) + ((Bx - x1) ** 2 + (Ay - y2) ** 2)**0.5)\\n    print(ans)\", \"def left_is_not(fet, tip):\\n    s = 0\\n    fet += 1\\n    if tip == 0:\\n        fet = tip + 10\\n    return tip\\n\\na, b, c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\nl = []\\nl.append(abs(y1-y2) + abs(x1-x2))\\n\\nif a == 0 or b == 0:\\n    print(abs(y1-y2) + abs(x1-x2))\\nelse:\\n    xA = (-b*y1 - c)/a\\n    xB = (-b*y2 - c)/a\\n    yA = (-a*x1 - c)/b\\n    yB = (-a*x2 - c)/b\\n    \\n    l.append(((xA-xB)**2 + (y1-y2)**2)**0.5 + abs(x1-xA) + abs(x2-xB))\\n    \\n    l.append(((x1-x2)**2 + (yA-yB)**2)**0.5 + abs(y1-yA) + abs(y2-yB))\\n    \\n    l.append(((x1-xB)**2 + (yA-y2)**2)**0.5 + abs(yA-y1) + abs(x2-xB))\\n    \\n    l.append(((xA-x2)**2 + (y1-yB)**2)**0.5 + abs(x1-xA) + abs(y2-yB))\\n    #print(l[-1])\\n    #print(l)\\n    print(min(l))\\n    \\n    '''\\n    1 1 -3\\n    0 3 3 0\\n    \\n    3 1 -9\\n    0 3 3 -1\\n    '''\\n\", \"import math\\na,b,c=list(map(int,input().split()))\\nx1,y1,x2,y2=list(map(int,input().split()))\\ns=abs(x1-x2)+abs(y1-y2)\\nif a!=0:\\n    xk1=-1*(b*y1+c)/a\\n    xk2=-1*(b*y2+c)/a\\nelse:\\n    xk1=10**18\\n    xk2=10**18\\nif b!=0:\\n    yk1=-1*(a*x1+c)/b\\n    yk2=-1*(a*x2+c)/b\\nelse:\\n    yk1=10**18\\n    yk2=10**18\\nlx1=abs(y1-yk1)\\nlx2=abs(y2-yk2)\\nly1=abs(x1-xk1)\\nly2=abs(x2-xk2)\\ns1=math.sqrt((x1-x2)**2+(yk1-yk2)**2)\\ns2=math.sqrt((x1-xk1)**2+(yk1-y1)**2)\\ns3=math.sqrt((x1-xk2)**2+(yk1-y2)**2)\\ns4=math.sqrt((xk1-x2)**2+(y1-yk2)**2)\\ns5=math.sqrt((x2-xk2)**2+(y2-yk2)**2)\\ns6=math.sqrt((xk1-xk2)**2+(y1-y2)**2)\\ns=min(s,lx1+lx2+s1,lx1+s3+ly2,ly1+s4+lx2,ly1+s6+ly2)\\nprint(s)\\n\", \"a, b, c = map(int, input().split())\\nx1, y1, x2, y2 = map(int, input().split())\\np = []\\nif b != 0:\\n    p.append((x1, -(a * x1 + c) / b))\\n    p.append((x2, -(a * x2 + c) / b))\\nif a != 0:\\n    p.append((-(b * y1 + c) / a, y1))\\n    p.append((-(b * y2 + c) / a, y2))\\np2 = []\\nfor x, y in p:\\n    if min(x1, x2) - 0.0001 < x < max(x1, x2) + 0.0001 and min(y1, y2) - 0.0001 < y < max(y1, y2) + 0.0001:\\n        p2.append((x, y))\\np3 = []\\nfor x0, y0 in p2:\\n    for x, y in p3:\\n        if max(abs(x - x0), abs(y - y0)) < 0.0001:\\n            break\\n    else:\\n        p3.append((x0, y0))\\nif len(p3) < 2:\\n    print(abs(x1 - x2) + abs(y1 - y2))\\nelse:\\n    r0 = abs(x1 - x2) + abs(y1 - y2)\\n    (ax, ay), (bx, by) = p3\\n    d = ((ax - bx) ** 2 + (ay - by) ** 2) ** 0.5\\n    r1 = abs(x1 - ax) + abs(y1 - ay) + d + abs(bx - x2) + abs(by - y2)\\n    r2 = abs(x1 - bx) + abs(y1 - by) + d + abs(ax - x2) + abs(ay - y2)\\n    print(min(r0, r1, r2))\", \"import math\\n\\na,b,c = [float(i) for i in input().split()]\\nxy = [float(i) for i in input().split()]\\nA =[xy[0],xy[1]]\\nB =[xy[2],xy[3]]\\n\\ndistances = []\\n\\ndef get_distance(K, M):\\n    return math.sqrt((K[0]-M[0])*(K[0]-M[0]) + (K[1]- M[1])*(K[1] - M[1]))\\n\\ndef get_point_h(K):\\n    x = (-b*K[1]-c) / a\\n    point = (x, K[1])\\n    distance = get_distance(K, point)\\n    return point, distance\\n    \\ndef get_point_v(K):\\n    y = (-a*K[0]-c) / b\\n    point = (K[0], y)\\n    distance = get_distance(K, point)\\n    return point, distance\\n\\n\\nmanhatten_distance = abs(A[0] - B[0]) + abs(A[1] - B[1])\\n#print(manhatten_distance)\\n\\ndistances.append(manhatten_distance)\\n\\nif a != 0:\\n    p1, d1 = get_point_h(A)\\n    p3, d3 = get_point_h(B)\\n    distances.append(get_distance(p1, p3) + d1 + d3)\\n\\nif b != 0:\\n    p2, d2 = get_point_v(A)\\n    p4, d4 = get_point_v(B)\\n    distances.append(get_distance(p2, p4) + d2 + d4)\\n\\nif a != 0 and b != 0:\\n    distances.append(get_distance(p2, p3) + d2 + d3)\\n    distances.append(get_distance(p1, p4) + d1 + d4)\\n\\n#print(distances)\\nprint(min(distances))\\n\", \"from math import sqrt\\n\\ndef sqr(a):\\n        return a * a\\n\\na, b, c = [float(i) for i in input().split()]\\nx1, y1, x2, y2 = [float(i) for i in input().split()]\\n\\nif a == 0 or b == 0:\\n        print(abs(x1 - x2) + abs(y1 - y2))\\n        return\\n\\nc1_y = -(a * x1 + c) / b\\nc2_y = -(a * x2 + c) / b\\nc1_x = -(b * y1 + c) / a\\nc2_x = -(b * y2 + c) / a\\n\\nans = abs(x1 - x2) + abs(y1 - y2)\\n\\nnow = abs(c1_y - y1) + sqrt(sqr(x1 - c2_x) + sqr(c1_y - y2)) + abs(c2_x - x2);\\nans = min(ans, now);\\n\\nnow = abs(c1_y - y1) + sqrt(sqr(x1 - x2) + sqr(c1_y - c2_y)) + abs(c2_y - y2);\\nans = min(ans, now);\\n\\nnow = abs(c1_x - x1) + sqrt(sqr(c1_x - c2_x) + sqr(y1 - y2)) + abs(c2_x - x2);\\nans = min(ans, now);\\n\\nnow = abs(c1_x - x1) + sqrt(sqr(c1_x - x2) + sqr(y1 - c2_y)) + abs(c2_y - y2);\\nans = min(ans, now);\\n\\nprint(\\\"%.30f\\\" % ans)\\n\", \"import math\\ns = input().split()\\na = int(s[0])\\nb = int(s[1])\\nc = int(s[2])\\ns = input().split()\\nx1 = int(s[0])\\ny1 = int(s[1])\\nx2 = int(s[2])\\ny2 = int(s[3])\\n\\nif (x1 == x2):\\n    print(abs(y1 - y2))\\nelif (y1 == y2):\\n    print(abs(x1 - x2))\\nelse:\\n    if (a != 0 and b != 0):\\n        var1 = abs(x1 - x2) + abs(y1 - y2)\\n    \\n        var2 = 0\\n        x = x1\\n        y = (a * x + c) / b * (-1)\\n        var2 += abs(y1 - y)\\n        x3 = x2\\n        y3 = (a * x3 + c) / b * (-1)\\n        var2 += math.sqrt((x - x3) ** 2 + (y - y3) ** 2)\\n        var2 += abs(y3 - y2)\\n    \\n        var3 = 0\\n        x = x1\\n        y = (a * x + c) / b * (-1)\\n        var3 += abs(y1 - y)\\n        y3 = y2\\n        x3 = (b * y3 + c) / a * (-1)\\n        var3 += math.sqrt((x - x3) ** 2 + (y - y3) ** 2)\\n        var3 += abs(x3 - x2)\\n    \\n        var4 = 0\\n        y = y1\\n        x = (b * y + c) / a * (-1)\\n        var4 += abs(x1 - x)\\n        y3 = y2\\n        x3 = (b * y3 + c) / a * (-1)\\n        var4 += math.sqrt((x - x3) ** 2 + (y - y3) ** 2)\\n        var4 += abs(x3 - x2)\\n    \\n        var5 = 0\\n        y = y1\\n        x = (b * y + c) / a * (-1)\\n        var5 += abs(x1 - x)\\n        x3 = x2\\n        y3 = (a * x3 + c) / b * (-1)\\n        var5 += math.sqrt((x - x3) ** 2 + (y - y3) ** 2)\\n        var5 += abs(y3 - y2)\\n    \\n        print(min(var1, var2, var3, var4, var5))\\n    else:\\n        print(abs(x1 - x2) + abs(y1 - y2))\", \"from math import *\\n\\n\\na, b, c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\nm = -1\\nif a == 0 or b == 0:\\n    print(abs(x2 - x1) + abs(y2 - y1))\\nelse:\\n    tr = [[[x1, ((a * x1 + c) / -b)], [((b * y1 + c) / -a), y1]],\\n          [[x2, ((a * x2 + c) / -b)], [((b * y2 + c) / -a), y2]]]\\n\\n    for i in range(2):\\n        for j in range(2):\\n            sqr = sqrt((tr[0][i][0] - tr[1][j][0])*(tr[0][i][0] - tr[1][j][0]) + (tr[0][i][1] - tr[1][j][1])*(tr[0][i][1] - tr[1][j][1]))\\n            if m == -1:\\n                m = abs(x1 - tr[0][i][0]) + abs(y1 - tr[0][i][1]) + abs(x2 - tr[1][j][0]) + abs(y2 - tr[1][j][1]) + sqr\\n            else:\\n                m = min(abs(x1 - tr[0][i][0]) + abs(y1 - tr[0][i][1]) + abs(x2 - tr[1][j][0]) + abs(y2 - tr[1][j][1]) + sqr, m)\\n    print(min(m, abs(x2 - x1) + abs(y2 - y1)))\\n\", \"import math\\na, b, c = [int(i) for i in input().split()]\\nx1, y1, x2, y2 = [int(i) for i in input().split()]\\nl1 = abs(x1-x2) + abs(y1-y2)\\nif(a == 0 or b == 0):\\n    print(l1)\\n    return\\nxa = -(b*y1+c)/a\\nya = y1\\nxb = x1\\nyb = -(a*x1+c)/b\\nxc = -(b*y2+c)/a\\nyc = y2\\nxd = x2\\nyd = -(a*x2+c)/b\\nl2 = abs(x1-xa) + math.sqrt((xa-xc)**2 + (ya-yc)**2)+abs(xc-x2)\\nl3 = abs(x1-xa) + math.sqrt((xa-xd)**2 + (ya-yd)**2)+abs(yd-y2)\\nl4 = abs(y1-yb) + math.sqrt((xb-xc)**2 + (yb-yc)**2) + abs(xc-x2)\\nl5 = abs(y1-yb) + math.sqrt((xb-xd)**2 + (yb-yd)**2) + abs(yd-y2)\\nprint(min(l1, l2, l3, l4, l5))\", \"import math\\n\\ndef lll(a, b):\\n  return math.sqrt((b[0] - a[0])**2 + (b[1] - a[1])**2)\\ndef III(a, b):\\n  return abs(b[0] - a[0]) + abs(b[1] - a[1])\\n\\na, b, c = map(int, input().split())\\nx1, y1, x2, y2 = map(int, input().split())\\n\\ng = [[]] * 8\\nfor i in range(8):\\n  g[i] = [float('inf')] * 8\\n\\np = [\\n  (x1, y1),\\n  (x1, y2),\\n  (x2, y2),\\n  (x2, y1),\\n]\\n\\nl = []\\nif a != 0 and b != 0:\\n  l = [\\n    (x1, (-a*x1 - c) / b),\\n    ((-b*y1 - c) / a, y1),\\n    (x2, (-a*x2 - c) / b),\\n    ((-b*y2 - c) / a, y2),\\n  ]\\nelse:\\n  l = [\\n    (x1, y1),\\n    (x1, y1),\\n    (x1, y1),\\n    (x1, y1),\\n  ]\\nfor i in range(4):\\n  for j in range(4):\\n    g[i][4 + j] = g[4 + j][i] = III(p[i], l[j])\\n    if (i != j):\\n      g[i][j] = g[j][i] = III(p[i], p[j])\\n      g[4 + i][4 + j] = g[4 + j][4 + i] = lll(l[i], l[j])\\n\\nls = [float('inf')] * 8\\nls[0] = 0\\nqu = [0]\\nwhile len(qu) > 0:\\n  i = qu[0]\\n  qu = qu[1:]\\n  for j in range(8):\\n    if ls[i] + g[i][j] < ls[j]:\\n      ls[j] = ls[i] + g[i][j]\\n      if not j in qu:\\n        qu += [j]\\nprint(ls[2]) \", \"a,b,c=list(map(int,input().split()))\\nx1,y1,x2,y2=list(map(int,input().split()))\\nbRange=abs(y2-y1)+abs(x2-x1)\\nif a==0 or b==0:\\n    print(bRange)\\nelse:\\n    py1=(-b*y1-c)/a\\n    py2=(-b*y2-c)/a\\n    px1=(-a*x1-c)/b\\n    px2=(-a*x2-c)/b\\n    pRange1=((x2-py1)**2+(px2-y1)**2)**0.5+abs(y2-px2)+abs(py1-x1)\\n    pRange2=((py2-py1)**2+(y2-y1)**2)**0.5+abs(py1-x1)+abs(x2-py2)\\n    pRange3=((x2-x1)**2+(px2-px1)**2)**0.5+abs(px1-y1)+abs(y2-px2)\\n    pRange4=((py2-x1)**2+(y2-px1)**2)**0.5+abs(px1-y1)+abs(x2-py2)\\n    print(min(bRange,pRange1,pRange2,pRange3,pRange4))\\n\", \"import math\\n\\ndef rst(A,B):\\n    x1 = A[0]\\n    y1 = A[1]\\n    x2 = B[0]\\n    y2 = B[1]\\n    \\n    return math.sqrt((x1-x2)**2 + (y1-y2)**2)\\n\\na,b,c = list(map(float,input().split()))\\nx1,y1,x2,y2 = list(map(float,input().split()))\\n\\nl = []\\n\\nif a == 0 or b == 0:\\n    print(abs(x2-x1)+abs(y1-y2))\\nelse:\\n    st = (x1,y1)\\n    fn = (x2,y2)\\n    \\n    xa = x1\\n    ya = (-c - a*x1) / b\\n    A = (xa,ya)\\n    \\n    xb = x2\\n    yb = (-c - a*x2) / b\\n    B = (xb,yb)\\n    \\n    xc = (-c - b*y1)/a\\n    yc = y1\\n    C = (xc,yc)\\n    \\n    xd = (-c - b*y2)/a\\n    yd = y2\\n    \\n    D = (xd,yd)\\n    \\n    print(min(abs(x2-x1)+abs(y1-y2),rst(st,A) + rst(A,B) + rst(B,fn),rst(st,A) + rst(A,D) + rst(D,fn),rst(st,C) + rst(C,B) + rst(B,fn),rst(st,C) + rst(C,D) + rst(D,fn)))\\n\", \"a, b, c = map(int, input().split())\\nx1, y1, x2, y2 = map(int, input().split())\\nif a != 0 and b != 0:\\n    x1_ = ((-1) * (b * y1 + c)) / a\\n    y1_ = ((-1) * (a * x1 + c)) / b\\n    x2_ = ((-1) * (b * y2 + c)) / a\\n    y2_ = ((-1) * (a * x2 + c)) / b\\n    p1 = abs(x1 - x1_) + abs(y2 - y2_) + ((x1_ - x2) ** 2 + (y1 - y2_) ** 2) ** 0.5\\n    p2 = abs(x1 - x1_) + abs(x2 - x2_) + ((x1_ - x2_) ** 2 + (y1 - y2) ** 2) ** 0.5\\n    p3 = abs(y1 - y1_) + abs(y2 - y2_) + ((x1 - x2) ** 2 + (y1_ - y2_) ** 2) ** 0.5\\n    p4 = abs(y1 - y1_) + abs(x2 - x2_) + ((x1 - x2_) ** 2 + (y1_ - y2) ** 2) ** 0.5\\n    p5 = abs(y1 - y2) + abs(x2 - x1)\\n    sp = [p1, p2, p3, p4, p5]\\n    print(min(sp))\\nelse:\\n    print(abs(y1 - y2) + abs(x2 - x1))\", \"from math import sqrt\\na, b, c = list(map(float, input().split()))\\nx1, y1, x2, y2 = list(map(float, input().split()))\\n\\ndef main():\\n    nonlocal a, b, c, x1, y1, x2, y2\\n    if (b==0 or a==0):\\n        return (abs(x1-x2)+abs(y1-y2))\\n\\n    AD, AC, DB, CB = False, False, False, False\\n    y = lambda x0: -c/b -a/b*x0\\n    x = lambda y0: -c/a -b/a*y0\\n    r = lambda x1, y1, x2, y2 : sqrt((x1-x2)**2 + (y1-y2)**2)\\n    yes = lambda x1, x, x2: (min(x1, x2) <= x and x <= max(x1, x2))\\n\\n    '''print(x(y1), x(y2), y(x1), y(x2))'''\\n    if (yes(y1, y(x1), y2) and yes(y1, y(x2), y2)):\\n        '''print(1)'''\\n        e = abs(y(x1) - y1)\\n        f = abs(y(x2) - y2)\\n        g = r(x1, y(x1), x2, y(x2))\\n        '''print(e, f, g)'''\\n        return (e+f+g)\\n    \\n    if (yes(y1, y(x1), y2) and yes(x1, x(y2), x2)):\\n        '''print(2)'''\\n        e = abs(y(x1) - y1)\\n        f = abs(x(y2) - x2)\\n        g = r(x1, y(x1), x(y2), y2)\\n        '''print(e, f, g)'''\\n        return (e+f+g)\\n        \\n    if (yes(x1, x(y1), x2) and yes(x1, x(y2), x2)):\\n        '''print(3)'''\\n        e = abs(x(y1) - x1)\\n        f = abs(x(y2) - x2)\\n        g = r(x(y1), y1, x(y2), y2)\\n        '''print(e, f, g)'''\\n        return (e+f+g)\\n\\n    if (yes(x1, x(y1), x2) and yes(y1, y(x2), y2)):\\n        '''print(4)'''\\n        e = abs(x(y1) - x1)\\n        f = abs(y(x2) - y2)\\n        g = r(x(y1), y1, x2, y(x2))\\n        '''print(e, f, g)'''\\n        return (e+f+g)\\n\\n    '''print(\\\"none returned!\\\")'''\\n    return (abs(x1-x2)+abs(y1-y2))\\n\\nans = main()\\nstraight = abs(x1-x2) + abs(y1-y2)\\nprint(min(ans, straight))\\n\", \"#!/usr/bin/env python3\\n\\nfrom fractions import Fraction\\nfrom math import sqrt\\n\\ndef gety(a, b, c, x):\\n    return -Fraction(a * x + c, b)\\n\\ndef getx(a, b, c, y):\\n    return -Fraction(b * y + c, a)\\n\\ndef ds(x1, y1, x2, y2):\\n    return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\\n\\na, b, c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\n\\nsilly_dist = abs(x1 - x2) + abs(y1 - y2)\\nif a == 0 or b == 0:\\n    print(silly_dist)\\n    return\\n\\ndq = silly_dist\\n\\nmx = x1\\nmy = gety(a, b, c, mx)\\nny = y1\\nnx = getx(a, b, c, ny)\\n\\nkx = x2\\nky = gety(a, b, c, kx)\\nty = y2\\ntx = getx(a, b, c, ty)\\n\\ndq1 = ds(mx, my, kx, ky) + ds(mx, my, x1, y1) + ds(kx, ky, x2, y2)\\ndq2 = ds(nx, ny, kx, ky) + ds(nx, ny, x1, y1) + ds(kx, ky, x2, y2)\\ndq3 = ds(mx, my, tx, ty) + ds(mx, my, x1, y1) + ds(tx, ty, x2, y2)\\ndq4 = ds(nx, ny, tx, ty) + ds(nx, ny, x1, y1) + ds(tx, ty, x2, y2)\\n\\n#print([dq, dq1, dq2, dq3, dq4])\\ndqmin = min([dq, dq1, dq2, dq3, dq4])\\nprint(dqmin)\\n\", \"def dst1(x1, x2, y1, y2):\\n    return abs(x1 - x2) + abs(y1 - y2)\\n\\ndef dst2(x1, x2, y1, y2):\\n    return ((x1 - x2)**2 + (y1 - y2)**2)**0.5\\n\\ndef getx(y):\\n    return (-b*y-c)/a\\n\\ndef gety(x):\\n    return (-a*x-c)/b\\n\\na, b, c = map(int, input().split())\\nx1, y1, x2, y2 = map(int, input().split())\\n\\ndef sign(a):\\n    if a > 0:\\n        return 1\\n    elif a == 0:\\n        return 0\\n    else:\\n        return -1\\n    \\nif a == 0 or b == 0:\\n    print(dst1(x1, x2, y1, y2))\\nelse:\\n    s1 = dst1(x1, x2, y1, y2)\\n    \\n    \\n    p1x = x1\\n    p1y = gety(p1x)\\n    p3y = y1\\n    p3x = getx(p3y)\\n    \\n    p2x = x2\\n    p2y = gety(p2x)\\n    p4y = y2\\n    p4x = getx(p4y)\\n    \\n    \\n    \\n    s = 0\\n    s += dst1(x1, p1x, y1, p1y)\\n    s += dst2(p1x, p2x, p1y, p2y)\\n    s += dst1(p2x, x2, p2y, y2)\\n    s2 = s\\n    \\n    s = 0\\n    s += dst1(x1, p3x, y1, p3y)\\n    s += dst2(p3x, p2x, p3y, p2y)\\n    s += dst1(p2x, x2, p2y, y2)\\n    s3 = s\\n    \\n    s = 0\\n    s += dst1(x1, p1x, y1, p1y)\\n    s += dst2(p1x, p4x, p1y, p4y)\\n    s += dst1(p4x, x2, p4y, y2)\\n    s4 = s\\n    \\n    s = 0\\n    s += dst1(x1, p3x, y1, p3y)\\n    s += dst2(p3x, p4x, p3y, p4y)\\n    s += dst1(p4x, x2, p4y, y2)\\n    s5 = s\\n    \\n    print(min(s1, s2, s3, s4, s5))\", \"from math import sqrt\\n\\na, b, c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\nres1 = abs(x1 - x2) + abs(y1 - y2)\\n\\nres2 = 10 ** 10 + 7\\nres3 = 10 ** 10 + 7\\nres4 = 10 ** 10 + 7\\nres5 = 10 ** 10 + 7\\n\\nif b != 0 and a != 0:\\n    x = (-y1 * b - c) / a\\n    y = (-x2 * a - c) / b\\n    res2 = abs(x1 - x) + abs(y2 - y) + sqrt(abs(x - x2) ** 2 + abs(y1 - y) ** 2)\\n\\nif a != 0:\\n    x = (-y1 * b - c) / a\\n    xx = (-y2 * b - c) / a\\n    res4 = abs(x1 - x) + abs(x2 - xx) + sqrt(abs(x - xx) ** 2 + abs(y1 - y2) ** 2)\\n\\nif b != 0:\\n    y = (-x1 * a - c) / b\\n    yy = (-x2 * a - c) / b\\n    res5 = abs(y1 - y) + abs(y2 - yy) + sqrt(abs(y - yy) ** 2 + abs(x1 - x2) ** 2)\\n\\nif a != 0 and b != 0:\\n    x = (-y2 * b - c) / a\\n    y = (-x1 * a - c) / b\\n    res3 = abs(y1 - y) + abs(x2 - x) + sqrt(abs(x1 - x) ** 2 + abs(y2 - y) ** 2)\\n\\nprint(min(res1, res2, res3, res4, res5))\\n# print(res1, res2, res3, res4, res5)\\n\", \"import math\\na, b, c = list(map(int, input().split()))\\nax, ay, bx, by = list(map(int, input().split()))\\nif (a==0 or b==0):\\n    print(abs(ax - bx) + abs(ay - by))\\n    return\\noy = -(a*ax+c)/b\\nty = -(a*bx+c)/b\\nox = -(b*ay+c)/a\\ntx = -(b*by+c)/a\\nans = abs(ax - bx) + abs(ay - by)\\nans1 = abs(ay - oy) + abs(by - ty) + math.sqrt(abs(ax - bx)**2 + abs(oy - ty)**2)\\nans2 = abs(ax - ox) + abs(bx - tx) + math.sqrt(abs(ay - by)**2 + abs(ox - tx)**2)\\nans3 = abs(ax - ox) + abs(by - ty) + math.sqrt(abs(bx - ox)**2 + abs(ay - ty)**2)\\nans4 = abs(ay - oy) + abs(bx - tx) + math.sqrt(abs(by - oy)**2 + abs(ax - tx)**2)\\nprint(min(ans, ans1, ans2, ans3, ans4))\\n\", \"from math import *\\na, b, c = list(map(int, input().split()))\\nx1, y1, x2, y2 = list(map(int, input().split()))\\nd = abs(x1 - x2) + abs(y1 - y2)\\nif a != 0 and b != 0:\\n    dy1 = abs(x1 + (c + b * y1) / a)\\n    dx1 = abs(y1 + (c + a * x1) / b)\\n    yy1 = y1\\n    xy1 = -(c + b * y1) / a\\n    xx1 = x1\\n    yx1 = -(c + a * x1) / b\\n    dy2 = abs(x2 + (c + b * y2) / a)\\n    dx2 = abs(y2 + (c + a * x2) / b)\\n    yy2 = y2\\n    xy2 = -(c + b * y2) / a\\n    xx2 = x2\\n    yx2 = -(c + a * x2) / b\\n    d1 = dy1 + dy2 + sqrt((xy1 - xy2)**2 + (yy1 - yy2)**2)\\n    d2 = dx1 + dx2 + sqrt((xx1 - xx2)**2 + (yx1 - yx2)**2)\\n    d3 = dy1 + dx2 + sqrt((xy1 - xx2)**2 + (yy1 - yx2)**2)\\n    d4 = dx1 + dy2 + sqrt((xx1 - xy2)**2 + (yx1 - yy2)**2)\\n    print(min(d, d1, d2, d3, d4))\\nelse:\\n    print(d)\\n\", \"from math import *\\n\\ndef r(x1, y1, x2, y2):\\n    return (abs(x1 - x2) ** 2 + abs(y1 - y2) ** 2) ** 0.5\\n\\na, b, c = map(int,input().split())\\nx1, y1, x2, y2 = map(int,input().split())\\nr1 = abs(x1 - x2) + abs(y1 - y2)\\nif (a == 0 or b == 0):\\n    print(r1)\\nelse:\\n    k = - a / b\\n    b = - c / b\\n    x01 = x1\\n    y01 = k * x1 + b\\n    x02 = (y2 - b) / k\\n    y02 = y2\\n    x03 = x2\\n    y03 = k * x2 + b\\n    x04 = (y1 - b) / k\\n    y04 = y1\\n    r2 = r(x1, y1, x01, y01) + r(x01, y01, x02, y02) + r(x02, y02, x2, y2)\\n    r3 = r(x1, y1, x01, y01) + r(x01, y01, x03, y03) + r(x03, y03, x2, y2)\\n\\n    r12 = r(x1, y1, x04, y04) + r(x04, y04, x02, y02) + r(x02, y02, x2, y2)\\n    r13 = r(x1, y1, x04, y04) + r(x04, y04, x03, y03) + r(x03, y03, x2, y2)\\n\\n    print(min(r1, r2, r3, r12, r13))\", \"from math import sqrt\\n\\n\\ndef ro(x, y):\\n    return sqrt((x[0] - y[0])**2 + (x[1] - y[1])**2)\\n\\n\\na, b, c = list(map(int, input().split()))\\nA = [0, 0]\\nB = [0, 0]\\nA[0], A[1], B[0], B[1] = list(map(int, input().split()))\\nif a == 0 or b == 0:\\n    #print(1)\\n    print(float(abs(A[0] - B[0]) + abs(A[1] - B[1])))\\nelif ((-a*A[0] - c) / b > max(A[1], B[1]) and (-a*B[0] - c) / b > max(A[1], B[1])) or ((-a*A[0] - c) / b < min(A[1], B[1]) and (-a*B[0] - c) / b < min(A[1], B[1])):\\n    #print(2)\\n    print(float(abs(A[0] - B[0]) + abs(A[1] - B[1])))\\nelif ((B[0] - A[0]) / (B[1] - A[1])) * (-a / b) <= 0:\\n    #print(3)\\n    print(float(abs(A[0] - B[0]) + abs(A[1] - B[1])))\\nelse:\\n    ab = False\\n    bb = False\\n    cb = False\\n    db = False\\n    C = [0, 0]\\n    D = [0, 0]\\n    if min(A[1], B[1]) <= (-a*min(A[0], B[0]) - c) / b <= max(A[1], B[1]):\\n        ab = True\\n    if min(A[1], B[1]) <= (-a*max(A[0], B[0]) - c) / b <= max(A[1], B[1]):\\n        cb = True\\n    if min(A[0], B[0]) < (-b*max(A[1], B[1]) - c) / a < max(A[0], B[0]):\\n        bb = True\\n    if min(A[0], B[0]) < (-b*min(A[1], B[1]) - c) / a < max(A[0], B[0]):\\n        db = True\\n    k = -a/b\\n    r = abs(A[0] - B[0]) + abs(A[1] - B[1])\\n    if ab and bb:\\n        C[0] = min(A[0], B[0])\\n        C[1] = (-a*min(A[0], B[0]) - c) / b\\n        D[0] = (-b*max(A[1], B[1]) - c) / a\\n        D[1] = max(A[1], B[1])\\n        r = abs(C[1] - min(A[1], B[1])) + abs(max(A[0], B[0]) - D[0]) + ro(C, D)\\n    if ab and cb:\\n        C[0] = min(A[0], B[0])\\n        C[1] = (-a*min(A[0], B[0]) - c) / b\\n        D[0] = max(A[0], B[0])\\n        D[1] = (-a*max(A[0], B[0]) - c) / b\\n        if C[1] < D[1]:\\n            r = abs(C[1] - min(A[1], B[1])) + abs(max(A[1], B[1]) - D[1]) + ro(C, D)\\n        else:\\n            r = abs(D[1] - min(A[1], B[1])) + abs(max(A[1], B[1]) - C[1]) + ro(C, D)\\n    if ab and db:\\n        C[0] = min(A[0], B[0])\\n        C[1] = (-a*min(A[0], B[0]) - c) / b\\n        D[0] = (-b*min(A[1], B[1]) - c) / a\\n        D[1] = min(A[1], B[1])\\n        r = abs(max(A[1], B[1]) - C[1]) + abs(max(A[0], B[0]) - D[0]) + ro(C, D)\\n    if bb and cb:\\n        C[0] = (-b * max(A[1], B[1]) - c) / a\\n        C[1] = max(A[1], B[1])\\n        D[0] = max(A[0], B[0])\\n        D[1] = (-a * max(A[0], B[0]) - c) / b\\n        r = abs(C[0] - min(A[0], B[0])) + abs(D[1] - min(A[1], B[1])) + ro(C, D)\\n    if bb and db:\\n        C[0] = (-b * max(A[1], B[1]) - c) / a\\n        C[1] = max(A[1], B[1])\\n        D[0] = (-b * min(A[1], B[1]) - c) / a\\n        D[1] = min(A[1], B[1])\\n        if C[0] > D[0]:\\n            r = abs(D[0] - min(A[0], B[0])) + abs(max(A[0], B[0]) - C[0]) + ro(C, D)\\n        else:\\n            r = abs(C[0] - min(A[0], B[0])) + abs(max(A[0], B[0]) - D[0]) + ro(C, D)\\n    if cb and db:\\n        C[0] = max(A[0], B[0])\\n        C[1] = (-a * max(A[0], B[0]) - c) / b\\n        D[0] = (-b * min(A[1], B[1]) - c) / a\\n        D[1] = min(A[1], B[1])\\n        r = abs(D[0] - min(A[0], B[0])) + abs(max(A[1], B[1]) - C[1]) + ro(C, D)\\n    print(r)\\n\", \"from math import sqrt\\n\\n\\ndef ro(x, y):\\n    return sqrt((x[0] - y[0]) ** 2 + (x[1] - y[1]) ** 2)\\n\\n\\ndef make_y(k):\\n    return (-a * k - c) / b\\n\\n\\ndef make_x(k):\\n    return (-b * k - c) / a\\n\\n\\na, b, c = list(map(int, input().split()))\\nA = [0, 0]\\nB = [0, 0]\\nA[0], A[1], B[0], B[1] = list(map(int, input().split()))\\nif a == 0 or b == 0:\\n    print(abs(A[0] - B[0]) + abs(A[1] - B[1]))\\nelse:\\n    ans = [abs(A[0] - B[0]) + abs(A[1] - B[1]),\\n           abs(make_y(A[0]) - A[1]) + abs(make_y(B[0]) - B[1]) + ro([A[0], make_y(A[0])], [B[0], make_y(B[0])]),\\n           abs(make_x(A[1]) - A[0]) + abs(make_y(B[0]) - B[1]) + ro([make_x(A[1]), A[1]], [B[0], make_y(B[0])]),\\n           abs(make_y(A[0]) - A[1]) + abs(make_x(B[1]) - B[0]) + ro([A[0], make_y(A[0])], [make_x(B[1]), B[1]]),\\n           abs(make_x(A[1]) - A[0]) + abs(make_x(B[1]) - B[0]) + ro([make_x(A[1]), A[1]], [make_x(B[1]), B[1]])]\\n    print(min(ans))\\n\"]",
        "difficulty": "interview",
        "input": "0 1 429776186\n566556410 -800727742 -432459627 -189939420\n",
        "output": "1609804359.0000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1032/D"
    },
    {
        "id": 845,
        "task_id": 672,
        "test_case_id": 6,
        "question": "Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by $i \\operatorname{mod} j$. A Modular Equation, as Hamed's teacher described, is an equation of the form $a \\operatorname{mod} x = b$ in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which $a \\operatorname{mod} x = b$ a solution of our equation.\n\nHamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.\n\nNow he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation $a \\operatorname{mod} x = b$ has.\n\n\n-----Input-----\n\nIn the only line of the input two space-separated integers a and b (0 ≤ a, b ≤ 10^9) are given.\n\n\n-----Output-----\n\nIf there is an infinite number of answers to our equation, print \"infinity\" (without the quotes). Otherwise print the number of solutions of the Modular Equation $a \\operatorname{mod} x = b$.\n\n\n-----Examples-----\nInput\n21 5\n\nOutput\n2\n\nInput\n9435152 272\n\nOutput\n282\n\nInput\n10 10\n\nOutput\ninfinity\n\n\n\n-----Note-----\n\nIn the first sample the answers of the Modular Equation are 8 and 16 since $21 \\operatorname{mod} 8 = 21 \\operatorname{mod} 16 = 5$",
        "solutions": "[\"# fin = open(\\\"input.txt\\\")\\n# a, b = map(int, fin.readline().split())\\na, b = list(map(int, input().split()))\\na2 = a - b\\nif a2 == 0:\\n\\tprint(\\\"infinity\\\")\\nelse:\\n\\tCount = 0\\n\\ti = 1\\n\\twhile i ** 2 <= a2:\\n\\t\\tCount += (a2 % i == 0 and i > b) + (a2 % i == 0 and a2 // i > b and i != a2 // i)\\n\\t\\ti += 1\\n\\tprint(Count)\\n\", \"import math\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a == 0 and b == 0:\\n    print(\\\"infinity\\\")\\nelif a == 0:\\n    print(\\\"0\\\")\\nelif a== b:\\n    print(\\\"infinity\\\")\\nelif a < b:\\n    print(\\\"0\\\")\\nelse:\\n    c = a- b;\\n    out = 0\\n    cek = [1]\\n    dum = c\\n    if dum % 2 == 0:\\n        cek.append(2)\\n        while dum % 2 == 0:\\n            dum /= 2\\n            for i in range(len(cek)):\\n                cek.append(cek[i] * 2)\\n    cek = list(set(cek))\\n    border = int(math.sqrt(dum))\\n    for i in range(3,border+1,2):\\n        if dum % i == 0:\\n            cek.append(i)\\n            while dum % i == 0:\\n                dum /= i\\n                for j in range(len(cek)):\\n                    cek.append(cek[j] * i)\\n    dum = int(dum)\\n    if dum != 0:\\n        for j in range(len(cek)):\\n            cek.append(cek[j] * dum)\\n    cek = list(set(cek))\\n    cek.sort()\\n    for i in cek:\\n        if i == 0:\\n            continue\\n        if c % i == 0:\\n            result = c / i\\n            if result <= b:\\n                break\\n            out += 1\\n    print(out)\\n\", \"import math\\nimport collections\\n\\n\\ndef multipliers(x):\\n\\n    divisors = []\\n    divisor = 2\\n    stop = math.sqrt(x)\\n    while x != 1 and divisor <= stop:\\n\\n        if x % divisor == 0:\\n\\n            x //= divisor\\n            divisors.append(divisor)\\n\\n        else:\\n\\n            divisor += 1\\n\\n    if x != 1:\\n\\n        divisors.append(x)\\n\\n    return divisors\\n\\n\\ndef count(muls, bound, viewed = None, x=1):\\n\\n    viewed = viewed or set()\\n    for i, mul in enumerate(muls):\\n\\n        nx = x * mul\\n        if nx not in viewed:\\n\\n            viewed.add(nx)\\n            if nx > bound:\\n\\n                yield 1\\n\\n            yield from count(muls[:i] + muls[i + 1:], bound, viewed, nx)\\n\\n\\na, b = list(map(int, input().split()))\\n# a, b = 4, 0\\nif a == b:\\n\\n    print(\\\"infinity\\\")\\n\\nelif b > a or a == 0:\\n\\n    print(0)\\n\\nelif (a, b) == (1, 0):\\n\\n    print(1)\\n\\nelse:\\n\\n    muls = multipliers(a - b)\\n    r = sum(count(muls, b))\\n    print(r if b else r + 1)\\n\", \"import itertools\\nimport math\\n\\ndef main():\\n\\ta, b = list(map(int, input().split()))\\n\\n\\tif a == b:\\n\\t\\tprint(\\\"infinity\\\")\\n\\t\\treturn\\n\\tif a < b:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\ta -= b\\n\\n\\tn = 0\\n\\n\\tfor i in range(1, math.ceil(math.sqrt(a))):\\n\\t\\tif (a % i == 0):\\n\\t\\t\\tn += (i > b) + (a // i > b)\\n\\n\\tif math.sqrt(a) % 1 == 0 and math.sqrt(a) > b:\\n\\t\\tn += 1\\n\\n\\tprint(n)\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"import math\\n\\na, b= [int(i) for i in input().split()]\\n\\nif a<b: print (0)\\nelse: \\n    if a== b: print(\\\"infinity\\\")\\n    else:               #>b and divisors of a\\n        def FindAllDivisors(x, b):\\n            y = 1\\n            ans= []\\n            while y <= int(math.sqrt(x)):\\n                #print(y)\\n                if x % y == 0:\\n                    #print(x, int(x/y))\\n                    if y!= int(x/y) :\\n                        if y>b:\\n                            ans.append(y)\\n                        if int(x/y)>b:\\n                            ans.append(int(x/y))\\n                    elif y== int(x/y) and y>b:\\n                        ans.append(y)\\n                y += 1\\n            return len(ans)\\n        print(FindAllDivisors(a-b, b))\", \"a, b = [int(i) for i in input().split()]\\no = a - b\\nsum = 0\\nl = 1\\nif o > 0:\\n    for i in range(1, int(o ** 0.5) + l):\\n        if o % i == 0:\\n            if o // i > b and i > b:\\n                sum += 2\\n                if i == o // i:\\n                    sum -= 1\\n            if (o // i > b and i <= b) or (o // i <= b and i > b):\\n                sum += 1\\n\\nif o == 0:\\n    print('infinity')\\nelse:\\n    print(sum)\", \"from math import *\\n\\na, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\n    return\\n\\nt = a - b\\n\\ndef primes_sieve(limit):\\n    limitn = limit+1\\n    not_prime = [False] * limitn\\n    primes = []\\n\\n    for i in range(2, limitn):\\n        if not_prime[i]:\\n            continue\\n        for f in range(i*2, limitn, i):\\n            not_prime[f] = True\\n\\n        primes.append(i)\\n\\n    return primes\\n\\nlst = primes_sieve(trunc(sqrt(10**10+7)))\\n\\ndef factorize(n, primes):\\n    factors = []\\n    for p in primes:\\n        if p*p > n: break\\n        i = 0\\n        while n % p == 0:\\n            n //= p\\n            i+=1\\n        if i > 0:\\n            factors.append((p, i));\\n    if n > 1: factors.append((n, 1))\\n\\n    return factors\\n    \\ndef divisors(factors):\\n    div = [1]\\n    for (p, r) in factors:\\n        div = [d * p**e for d in div for e in range(r + 1)]\\n    return div\\n\\n\\ndv = divisors(factorize(t, lst))\\nc = 0\\nfor x in dv:\\n    if x > b:\\n        c+=1\\nprint(c)\\n#print(dv)\\n\", \"# -*- coding: utf-8 -*-\\nimport random\\n\\na, b = list(map(int, input().split()))\\n\\ndef sums(s, l, b):\\n    if s > b:\\n        p = 1\\n        for x in l:\\n            p *= (x[1]+1)\\n        #print(\\\"ok, s=\\\",s,p)\\n        return p\\n\\n    if not l:\\n        #print(\\\"malo: \\\", s)\\n        return 0\\n    #print(s, end=\\\" \\\")\\n\\n    p = 0\\n    for i in range(l[0][1]+1):\\n        p += sums(s * (l[0][0]**i), l[1:], b)\\n    return p\\n\\n\\ndef naive(a,b):\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        if a < b:\\n            return 0\\n        else:\\n            count = 0\\n            for x in range(1, a+1):\\n                if a % x == b:\\n                    count += 1\\n            return count\\n\\n\\ndef wise(a, b):\\n    if a == 1 and b == 0:\\n        return 1\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        d = a-b\\n        factors = {}\\n        i = 2\\n        while i*i <= d:\\n            if d % i == 0:\\n                factors.setdefault(i, 0)\\n                factors[i] += 1\\n                d //= i\\n            else:\\n                i += 1\\n        factors.setdefault(d, 0)\\n        factors[d] += 1\\n\\n        return sums(1, list(factors.items()), b)\\n            \\n#for i in range(10000):\\n    ##print(i)\\n    #a, b = map(int, input().split())\\n    ##a = random.randint(0,100000)\\n    ##b = random.randint(0,100000)\\n    #if wise(a, b) != naive(a, b):\\n        #print(\\\"!!!\\\")\\n    #print(a, b, wise(a, b), naive(a, b))\\n\\nprint(wise(a, b))\\n        \\n\", \"inp = input().split(' ')\\na = int(inp[0])\\nb = int(inp[1])\\ndiff = a-b\\nif a == b:\\n    print('infinity')\\nelif diff < 0:\\n    print(0)\\nelse:\\n    l = []\\n    out = 1\\n    for x in range(2,int(diff**(1/2))+1):\\n        num = 0\\n        y = diff/x\\n        while y == int(y):\\n            num += 1\\n            diff /= x\\n            y /= x\\n        if num != 0:\\n            l.append([x,num])\\n            out *= (num + 1)\\n        if diff < x:\\n            break\\n    if diff != 1:\\n        l.append([int(diff),1])\\n        out *= 2\\n    if b == 0:\\n        print(out)\\n    else:\\n        flessb = [1]\\n        for pair in l:\\n            newl = []\\n            for x in flessb:\\n                y = x\\n                for exp in range(pair[1]+1):\\n                    if y<=b:\\n                        newl.append(y)\\n                        y *= pair[0]\\n                    else:\\n                        break\\n            flessb = set(newl)\\n        print(int(out-len(flessb)))\\n\\n\", \"a=input().split(\\\" \\\")\\nx1=int(a[0]);\\ny1=int(a[1]);\\na1=x1-y1;\\nif x1==y1:\\n print (\\\"infinity\\\");\\nelse:\\n i=1;\\n counter=0;\\n while i**2<=a1:\\n  counter+=(a1 % i == 0 and i > y1)+(a1 % i == 0 and a1 // i > y1 and i != a1 // i);\\n  i+=1;\\n print(counter);\\n\", \"a, b = map(int, input().split(' '))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\", \"a, b = list(map(int, input().split(' ')))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\\n\", \"from math import floor, sqrt\\n\\n\\ndef main():\\n    a, b = list(map(int, input().split()))\\n    if a == b:\\n        print('infinity')\\n    elif a < b:\\n        print(0)\\n    else:\\n        res, ab = 0, a - b\\n        for x in range(1, floor(sqrt(ab)) + 1):\\n            if not ab % x:\\n                if x > b:\\n                    res += 1\\n                if b * x < ab != x * x:\\n                    res += 1\\n        print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main2(a,b):\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx=[1]\\n    loop=2\\n    while loop<=x:\\n        if x % loop == 0:\\n            x //= loop\\n            xx.extend([loop*j for j in xx if loop*j not in xx])\\n        else:\\n            loop += 1\\n        print(loop,x,xx)\\n    xx = [k for k in xx if k > b]\\n    print(len(xx))\\n\\ndef main3(a,b):\\n    from math import ceil, sqrt\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx = []\\n    for i in range(b+1,ceil(sqrt(x))):\\n        if x % i == 0: xx.append(i)\\n    print(len(xx))\\ndef main(a,b,Test=False):\\n    from math import ceil, sqrt, floor\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    if b>a:\\n        print(\\\"0\\\")\\n        return\\n    x = a-b\\n    ans = 0\\n    for i in range(1,floor(sqrt(x))+1):\\n        if x%i == 0:\\n            if i*i==x:\\n                ans += i>b\\n            else:\\n                ans += (i>b)+(x//i>b)\\n                if Test: print(i,x//i,ans)\\n    print(ans)\\n\\ndef test():\\n    from mxn.timer import Timer, timer\\n    print()\\n    main(21,5)\\n    main(10,10)\\n    main(0,1000)\\n    with Timer() as tm:\\n        main(9435152,272)\\n    with Timer() as tm:\\n        main(325508499, 119510657)\\n    with Timer() as tm:\\n        main(1000000000, 6)\\n    main(11,2,Test=0)\\n    main(15,3,Test=1)\\n#test()\\n\\ndef main_input():\\n    a,b = list(map(int,input().split()))\\n    main(a,b)\\n\\ndef __starting_point():\\n    main_input()\\n\\n__starting_point()\", \"tmp = input().split()\\na = int(tmp[0])\\nb = int(tmp[1])\\na -= b\\nif a == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    ans = 0\\n    i = 1\\n    while i * i < a:\\n        if a % i == 0:\\n            if i > b:\\n                ans += 1\\n            if a/i > b:\\n                ans += 1\\n        i += 1\\n    if i * i == a and i > b:\\n        ans += 1\\n    print(ans)\\n\", \"import math, time\\n\\na, b= [int(i) for i in input().split()]\\nif a<b: print(0)\\nelif a==b: print(\\\"infinity\\\")\\nelse:\\n    def FindRequiredDivisors(x, b):\\n        y= 1\\n        ans= 0\\n        while y <= int(math.sqrt(x)):\\n            if x % y == 0:\\n                if y!= int(x/y) :\\n                    if y>b:\\n                        ans+= 1\\n                    if int(x/y)>b:\\n                        ans+= 1\\n                elif y== int(x/y) and y>b:\\n                    ans+= 1\\n            y+= 1\\n        return ans\\n    print(FindRequiredDivisors(a-b, b))        \", \"a,b=map(int,input().split());\\ndis=a-b;\\nif dis==0:\\n\\tprint(\\\"infinity\\\");\\nelse :\\n\\tres=0;\\n\\tx=1;\\n\\twhile x**2<=dis:\\n\\t\\tif dis%x==0 and x>b:\\n\\t\\t\\tres+=1;\\n\\t\\tif dis%x==0 and dis//x>b and x**2!=dis:\\n\\t\\t\\tres+=1;\\n\\t\\tx+=1;\\n\\tprint(res);\", \"import sys\\n\\na, b = list(map(int, input().split()))\\ndis = a - b\\nif dis == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    res = 0\\n    x = 1\\n    while x ** 2 <= dis:\\n        if dis % x == 0 and x > b:\\n            res += 1\\n        if dis % x == 0 and dis // x > b and x ** 2 != dis:\\n            res += 1\\n        x += 1\\n    print(res)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x in range(b + 1, a - b + 1))\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x > b)\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nk, val = 1, 0\\nwhile k * k <= a - b:\\n    if (a - b) % k == 0:\\n        val += sum(1 for x in {k, (a - b) // k} if x > b)\\n    k += 1\\nprint('infinity' if a == b else val)\\n\", \"import sys\\na, b = map(int, sys.stdin.readline().split())\\nif a < b:\\n  print(0)\\nelif a == b:\\n  print('infinity')\\nelse:\\n  n = a - b\\n  if n <= b:\\n    print(0)\\n  else:\\n    ans = 0\\n    i = 1\\n    while i * i <= n:\\n      if n % i == 0:\\n        if i > b: ans += 1\\n        if n // i > b and n // i != i: ans += 1\\n      i += 1\\n    print(ans)\", \"x,y=list(map(int,input().split()))\\n\\nn=x-y\\nj=n\\nc=0\\nif j<0:\\n    print(c)\\nelif j==0:\\n    print(\\\"infinity\\\")\\nelse:\\n    result_set = set()\\n    sqrtn = int(n**0.5)\\n    for i in range(1,sqrtn+1):\\n        q, r = n/i, n%i\\n        if r == 0:\\n            if(q>y):\\n                result_set.add(q)\\n            if(i>y):\\n                result_set.add(i)\\n            \\n    print( len(result_set))\\n    \\n\", \"x = input(\\\"\\\").split(\\\" \\\")\\na = int(x[0])\\nb = int(x[1])\\nlist = []\\nanswer = 0\\nif a == b:\\n    print(\\\"infinity\\\")\\nelse:\\n    value = 1\\n    while value**2 <= a-b:\\n        if (a-b)%value == 0:\\n            list.append(value)\\n            if (value != (a-b)/value):\\n                list.append((a-b)/value)\\n        value = value + 1\\n    for value in list:\\n        if value > b:\\n            answer = answer + 1\\n    \\n    print(answer)\", \"#!/usr/bin/env python3\\nimport math\\n\\na, b = list(map(int,input().split()))\\ndiff = a - b\\nif diff < 0:\\n    print(0)\\nelif diff == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    cnt = 0\\n    for i in range(1, 1 + int(math.sqrt(diff))):\\n        if diff % i == 0 and i > b:\\n            cnt += 1\\n        if diff % i == 0 and diff // i > b and i * i != diff:\\n            cnt += 1\\n    print(cnt)\\n\"]",
        "difficulty": "interview",
        "input": "1 0\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/495/B"
    },
    {
        "id": 846,
        "task_id": 672,
        "test_case_id": 8,
        "question": "Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by $i \\operatorname{mod} j$. A Modular Equation, as Hamed's teacher described, is an equation of the form $a \\operatorname{mod} x = b$ in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which $a \\operatorname{mod} x = b$ a solution of our equation.\n\nHamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.\n\nNow he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation $a \\operatorname{mod} x = b$ has.\n\n\n-----Input-----\n\nIn the only line of the input two space-separated integers a and b (0 ≤ a, b ≤ 10^9) are given.\n\n\n-----Output-----\n\nIf there is an infinite number of answers to our equation, print \"infinity\" (without the quotes). Otherwise print the number of solutions of the Modular Equation $a \\operatorname{mod} x = b$.\n\n\n-----Examples-----\nInput\n21 5\n\nOutput\n2\n\nInput\n9435152 272\n\nOutput\n282\n\nInput\n10 10\n\nOutput\ninfinity\n\n\n\n-----Note-----\n\nIn the first sample the answers of the Modular Equation are 8 and 16 since $21 \\operatorname{mod} 8 = 21 \\operatorname{mod} 16 = 5$",
        "solutions": "[\"# fin = open(\\\"input.txt\\\")\\n# a, b = map(int, fin.readline().split())\\na, b = list(map(int, input().split()))\\na2 = a - b\\nif a2 == 0:\\n\\tprint(\\\"infinity\\\")\\nelse:\\n\\tCount = 0\\n\\ti = 1\\n\\twhile i ** 2 <= a2:\\n\\t\\tCount += (a2 % i == 0 and i > b) + (a2 % i == 0 and a2 // i > b and i != a2 // i)\\n\\t\\ti += 1\\n\\tprint(Count)\\n\", \"import math\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a == 0 and b == 0:\\n    print(\\\"infinity\\\")\\nelif a == 0:\\n    print(\\\"0\\\")\\nelif a== b:\\n    print(\\\"infinity\\\")\\nelif a < b:\\n    print(\\\"0\\\")\\nelse:\\n    c = a- b;\\n    out = 0\\n    cek = [1]\\n    dum = c\\n    if dum % 2 == 0:\\n        cek.append(2)\\n        while dum % 2 == 0:\\n            dum /= 2\\n            for i in range(len(cek)):\\n                cek.append(cek[i] * 2)\\n    cek = list(set(cek))\\n    border = int(math.sqrt(dum))\\n    for i in range(3,border+1,2):\\n        if dum % i == 0:\\n            cek.append(i)\\n            while dum % i == 0:\\n                dum /= i\\n                for j in range(len(cek)):\\n                    cek.append(cek[j] * i)\\n    dum = int(dum)\\n    if dum != 0:\\n        for j in range(len(cek)):\\n            cek.append(cek[j] * dum)\\n    cek = list(set(cek))\\n    cek.sort()\\n    for i in cek:\\n        if i == 0:\\n            continue\\n        if c % i == 0:\\n            result = c / i\\n            if result <= b:\\n                break\\n            out += 1\\n    print(out)\\n\", \"import math\\nimport collections\\n\\n\\ndef multipliers(x):\\n\\n    divisors = []\\n    divisor = 2\\n    stop = math.sqrt(x)\\n    while x != 1 and divisor <= stop:\\n\\n        if x % divisor == 0:\\n\\n            x //= divisor\\n            divisors.append(divisor)\\n\\n        else:\\n\\n            divisor += 1\\n\\n    if x != 1:\\n\\n        divisors.append(x)\\n\\n    return divisors\\n\\n\\ndef count(muls, bound, viewed = None, x=1):\\n\\n    viewed = viewed or set()\\n    for i, mul in enumerate(muls):\\n\\n        nx = x * mul\\n        if nx not in viewed:\\n\\n            viewed.add(nx)\\n            if nx > bound:\\n\\n                yield 1\\n\\n            yield from count(muls[:i] + muls[i + 1:], bound, viewed, nx)\\n\\n\\na, b = list(map(int, input().split()))\\n# a, b = 4, 0\\nif a == b:\\n\\n    print(\\\"infinity\\\")\\n\\nelif b > a or a == 0:\\n\\n    print(0)\\n\\nelif (a, b) == (1, 0):\\n\\n    print(1)\\n\\nelse:\\n\\n    muls = multipliers(a - b)\\n    r = sum(count(muls, b))\\n    print(r if b else r + 1)\\n\", \"import itertools\\nimport math\\n\\ndef main():\\n\\ta, b = list(map(int, input().split()))\\n\\n\\tif a == b:\\n\\t\\tprint(\\\"infinity\\\")\\n\\t\\treturn\\n\\tif a < b:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\ta -= b\\n\\n\\tn = 0\\n\\n\\tfor i in range(1, math.ceil(math.sqrt(a))):\\n\\t\\tif (a % i == 0):\\n\\t\\t\\tn += (i > b) + (a // i > b)\\n\\n\\tif math.sqrt(a) % 1 == 0 and math.sqrt(a) > b:\\n\\t\\tn += 1\\n\\n\\tprint(n)\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"import math\\n\\na, b= [int(i) for i in input().split()]\\n\\nif a<b: print (0)\\nelse: \\n    if a== b: print(\\\"infinity\\\")\\n    else:               #>b and divisors of a\\n        def FindAllDivisors(x, b):\\n            y = 1\\n            ans= []\\n            while y <= int(math.sqrt(x)):\\n                #print(y)\\n                if x % y == 0:\\n                    #print(x, int(x/y))\\n                    if y!= int(x/y) :\\n                        if y>b:\\n                            ans.append(y)\\n                        if int(x/y)>b:\\n                            ans.append(int(x/y))\\n                    elif y== int(x/y) and y>b:\\n                        ans.append(y)\\n                y += 1\\n            return len(ans)\\n        print(FindAllDivisors(a-b, b))\", \"a, b = [int(i) for i in input().split()]\\no = a - b\\nsum = 0\\nl = 1\\nif o > 0:\\n    for i in range(1, int(o ** 0.5) + l):\\n        if o % i == 0:\\n            if o // i > b and i > b:\\n                sum += 2\\n                if i == o // i:\\n                    sum -= 1\\n            if (o // i > b and i <= b) or (o // i <= b and i > b):\\n                sum += 1\\n\\nif o == 0:\\n    print('infinity')\\nelse:\\n    print(sum)\", \"from math import *\\n\\na, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\n    return\\n\\nt = a - b\\n\\ndef primes_sieve(limit):\\n    limitn = limit+1\\n    not_prime = [False] * limitn\\n    primes = []\\n\\n    for i in range(2, limitn):\\n        if not_prime[i]:\\n            continue\\n        for f in range(i*2, limitn, i):\\n            not_prime[f] = True\\n\\n        primes.append(i)\\n\\n    return primes\\n\\nlst = primes_sieve(trunc(sqrt(10**10+7)))\\n\\ndef factorize(n, primes):\\n    factors = []\\n    for p in primes:\\n        if p*p > n: break\\n        i = 0\\n        while n % p == 0:\\n            n //= p\\n            i+=1\\n        if i > 0:\\n            factors.append((p, i));\\n    if n > 1: factors.append((n, 1))\\n\\n    return factors\\n    \\ndef divisors(factors):\\n    div = [1]\\n    for (p, r) in factors:\\n        div = [d * p**e for d in div for e in range(r + 1)]\\n    return div\\n\\n\\ndv = divisors(factorize(t, lst))\\nc = 0\\nfor x in dv:\\n    if x > b:\\n        c+=1\\nprint(c)\\n#print(dv)\\n\", \"# -*- coding: utf-8 -*-\\nimport random\\n\\na, b = list(map(int, input().split()))\\n\\ndef sums(s, l, b):\\n    if s > b:\\n        p = 1\\n        for x in l:\\n            p *= (x[1]+1)\\n        #print(\\\"ok, s=\\\",s,p)\\n        return p\\n\\n    if not l:\\n        #print(\\\"malo: \\\", s)\\n        return 0\\n    #print(s, end=\\\" \\\")\\n\\n    p = 0\\n    for i in range(l[0][1]+1):\\n        p += sums(s * (l[0][0]**i), l[1:], b)\\n    return p\\n\\n\\ndef naive(a,b):\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        if a < b:\\n            return 0\\n        else:\\n            count = 0\\n            for x in range(1, a+1):\\n                if a % x == b:\\n                    count += 1\\n            return count\\n\\n\\ndef wise(a, b):\\n    if a == 1 and b == 0:\\n        return 1\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        d = a-b\\n        factors = {}\\n        i = 2\\n        while i*i <= d:\\n            if d % i == 0:\\n                factors.setdefault(i, 0)\\n                factors[i] += 1\\n                d //= i\\n            else:\\n                i += 1\\n        factors.setdefault(d, 0)\\n        factors[d] += 1\\n\\n        return sums(1, list(factors.items()), b)\\n            \\n#for i in range(10000):\\n    ##print(i)\\n    #a, b = map(int, input().split())\\n    ##a = random.randint(0,100000)\\n    ##b = random.randint(0,100000)\\n    #if wise(a, b) != naive(a, b):\\n        #print(\\\"!!!\\\")\\n    #print(a, b, wise(a, b), naive(a, b))\\n\\nprint(wise(a, b))\\n        \\n\", \"inp = input().split(' ')\\na = int(inp[0])\\nb = int(inp[1])\\ndiff = a-b\\nif a == b:\\n    print('infinity')\\nelif diff < 0:\\n    print(0)\\nelse:\\n    l = []\\n    out = 1\\n    for x in range(2,int(diff**(1/2))+1):\\n        num = 0\\n        y = diff/x\\n        while y == int(y):\\n            num += 1\\n            diff /= x\\n            y /= x\\n        if num != 0:\\n            l.append([x,num])\\n            out *= (num + 1)\\n        if diff < x:\\n            break\\n    if diff != 1:\\n        l.append([int(diff),1])\\n        out *= 2\\n    if b == 0:\\n        print(out)\\n    else:\\n        flessb = [1]\\n        for pair in l:\\n            newl = []\\n            for x in flessb:\\n                y = x\\n                for exp in range(pair[1]+1):\\n                    if y<=b:\\n                        newl.append(y)\\n                        y *= pair[0]\\n                    else:\\n                        break\\n            flessb = set(newl)\\n        print(int(out-len(flessb)))\\n\\n\", \"a=input().split(\\\" \\\")\\nx1=int(a[0]);\\ny1=int(a[1]);\\na1=x1-y1;\\nif x1==y1:\\n print (\\\"infinity\\\");\\nelse:\\n i=1;\\n counter=0;\\n while i**2<=a1:\\n  counter+=(a1 % i == 0 and i > y1)+(a1 % i == 0 and a1 // i > y1 and i != a1 // i);\\n  i+=1;\\n print(counter);\\n\", \"a, b = map(int, input().split(' '))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\", \"a, b = list(map(int, input().split(' ')))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\\n\", \"from math import floor, sqrt\\n\\n\\ndef main():\\n    a, b = list(map(int, input().split()))\\n    if a == b:\\n        print('infinity')\\n    elif a < b:\\n        print(0)\\n    else:\\n        res, ab = 0, a - b\\n        for x in range(1, floor(sqrt(ab)) + 1):\\n            if not ab % x:\\n                if x > b:\\n                    res += 1\\n                if b * x < ab != x * x:\\n                    res += 1\\n        print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main2(a,b):\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx=[1]\\n    loop=2\\n    while loop<=x:\\n        if x % loop == 0:\\n            x //= loop\\n            xx.extend([loop*j for j in xx if loop*j not in xx])\\n        else:\\n            loop += 1\\n        print(loop,x,xx)\\n    xx = [k for k in xx if k > b]\\n    print(len(xx))\\n\\ndef main3(a,b):\\n    from math import ceil, sqrt\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx = []\\n    for i in range(b+1,ceil(sqrt(x))):\\n        if x % i == 0: xx.append(i)\\n    print(len(xx))\\ndef main(a,b,Test=False):\\n    from math import ceil, sqrt, floor\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    if b>a:\\n        print(\\\"0\\\")\\n        return\\n    x = a-b\\n    ans = 0\\n    for i in range(1,floor(sqrt(x))+1):\\n        if x%i == 0:\\n            if i*i==x:\\n                ans += i>b\\n            else:\\n                ans += (i>b)+(x//i>b)\\n                if Test: print(i,x//i,ans)\\n    print(ans)\\n\\ndef test():\\n    from mxn.timer import Timer, timer\\n    print()\\n    main(21,5)\\n    main(10,10)\\n    main(0,1000)\\n    with Timer() as tm:\\n        main(9435152,272)\\n    with Timer() as tm:\\n        main(325508499, 119510657)\\n    with Timer() as tm:\\n        main(1000000000, 6)\\n    main(11,2,Test=0)\\n    main(15,3,Test=1)\\n#test()\\n\\ndef main_input():\\n    a,b = list(map(int,input().split()))\\n    main(a,b)\\n\\ndef __starting_point():\\n    main_input()\\n\\n__starting_point()\", \"tmp = input().split()\\na = int(tmp[0])\\nb = int(tmp[1])\\na -= b\\nif a == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    ans = 0\\n    i = 1\\n    while i * i < a:\\n        if a % i == 0:\\n            if i > b:\\n                ans += 1\\n            if a/i > b:\\n                ans += 1\\n        i += 1\\n    if i * i == a and i > b:\\n        ans += 1\\n    print(ans)\\n\", \"import math, time\\n\\na, b= [int(i) for i in input().split()]\\nif a<b: print(0)\\nelif a==b: print(\\\"infinity\\\")\\nelse:\\n    def FindRequiredDivisors(x, b):\\n        y= 1\\n        ans= 0\\n        while y <= int(math.sqrt(x)):\\n            if x % y == 0:\\n                if y!= int(x/y) :\\n                    if y>b:\\n                        ans+= 1\\n                    if int(x/y)>b:\\n                        ans+= 1\\n                elif y== int(x/y) and y>b:\\n                    ans+= 1\\n            y+= 1\\n        return ans\\n    print(FindRequiredDivisors(a-b, b))        \", \"a,b=map(int,input().split());\\ndis=a-b;\\nif dis==0:\\n\\tprint(\\\"infinity\\\");\\nelse :\\n\\tres=0;\\n\\tx=1;\\n\\twhile x**2<=dis:\\n\\t\\tif dis%x==0 and x>b:\\n\\t\\t\\tres+=1;\\n\\t\\tif dis%x==0 and dis//x>b and x**2!=dis:\\n\\t\\t\\tres+=1;\\n\\t\\tx+=1;\\n\\tprint(res);\", \"import sys\\n\\na, b = list(map(int, input().split()))\\ndis = a - b\\nif dis == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    res = 0\\n    x = 1\\n    while x ** 2 <= dis:\\n        if dis % x == 0 and x > b:\\n            res += 1\\n        if dis % x == 0 and dis // x > b and x ** 2 != dis:\\n            res += 1\\n        x += 1\\n    print(res)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x in range(b + 1, a - b + 1))\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x > b)\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nk, val = 1, 0\\nwhile k * k <= a - b:\\n    if (a - b) % k == 0:\\n        val += sum(1 for x in {k, (a - b) // k} if x > b)\\n    k += 1\\nprint('infinity' if a == b else val)\\n\", \"import sys\\na, b = map(int, sys.stdin.readline().split())\\nif a < b:\\n  print(0)\\nelif a == b:\\n  print('infinity')\\nelse:\\n  n = a - b\\n  if n <= b:\\n    print(0)\\n  else:\\n    ans = 0\\n    i = 1\\n    while i * i <= n:\\n      if n % i == 0:\\n        if i > b: ans += 1\\n        if n // i > b and n // i != i: ans += 1\\n      i += 1\\n    print(ans)\", \"x,y=list(map(int,input().split()))\\n\\nn=x-y\\nj=n\\nc=0\\nif j<0:\\n    print(c)\\nelif j==0:\\n    print(\\\"infinity\\\")\\nelse:\\n    result_set = set()\\n    sqrtn = int(n**0.5)\\n    for i in range(1,sqrtn+1):\\n        q, r = n/i, n%i\\n        if r == 0:\\n            if(q>y):\\n                result_set.add(q)\\n            if(i>y):\\n                result_set.add(i)\\n            \\n    print( len(result_set))\\n    \\n\", \"x = input(\\\"\\\").split(\\\" \\\")\\na = int(x[0])\\nb = int(x[1])\\nlist = []\\nanswer = 0\\nif a == b:\\n    print(\\\"infinity\\\")\\nelse:\\n    value = 1\\n    while value**2 <= a-b:\\n        if (a-b)%value == 0:\\n            list.append(value)\\n            if (value != (a-b)/value):\\n                list.append((a-b)/value)\\n        value = value + 1\\n    for value in list:\\n        if value > b:\\n            answer = answer + 1\\n    \\n    print(answer)\", \"#!/usr/bin/env python3\\nimport math\\n\\na, b = list(map(int,input().split()))\\ndiff = a - b\\nif diff < 0:\\n    print(0)\\nelif diff == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    cnt = 0\\n    for i in range(1, 1 + int(math.sqrt(diff))):\\n        if diff % i == 0 and i > b:\\n            cnt += 1\\n        if diff % i == 0 and diff // i > b and i * i != diff:\\n            cnt += 1\\n    print(cnt)\\n\"]",
        "difficulty": "interview",
        "input": "121 0\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/495/B"
    },
    {
        "id": 847,
        "task_id": 672,
        "test_case_id": 17,
        "question": "Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by $i \\operatorname{mod} j$. A Modular Equation, as Hamed's teacher described, is an equation of the form $a \\operatorname{mod} x = b$ in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which $a \\operatorname{mod} x = b$ a solution of our equation.\n\nHamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.\n\nNow he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation $a \\operatorname{mod} x = b$ has.\n\n\n-----Input-----\n\nIn the only line of the input two space-separated integers a and b (0 ≤ a, b ≤ 10^9) are given.\n\n\n-----Output-----\n\nIf there is an infinite number of answers to our equation, print \"infinity\" (without the quotes). Otherwise print the number of solutions of the Modular Equation $a \\operatorname{mod} x = b$.\n\n\n-----Examples-----\nInput\n21 5\n\nOutput\n2\n\nInput\n9435152 272\n\nOutput\n282\n\nInput\n10 10\n\nOutput\ninfinity\n\n\n\n-----Note-----\n\nIn the first sample the answers of the Modular Equation are 8 and 16 since $21 \\operatorname{mod} 8 = 21 \\operatorname{mod} 16 = 5$",
        "solutions": "[\"# fin = open(\\\"input.txt\\\")\\n# a, b = map(int, fin.readline().split())\\na, b = list(map(int, input().split()))\\na2 = a - b\\nif a2 == 0:\\n\\tprint(\\\"infinity\\\")\\nelse:\\n\\tCount = 0\\n\\ti = 1\\n\\twhile i ** 2 <= a2:\\n\\t\\tCount += (a2 % i == 0 and i > b) + (a2 % i == 0 and a2 // i > b and i != a2 // i)\\n\\t\\ti += 1\\n\\tprint(Count)\\n\", \"import math\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a == 0 and b == 0:\\n    print(\\\"infinity\\\")\\nelif a == 0:\\n    print(\\\"0\\\")\\nelif a== b:\\n    print(\\\"infinity\\\")\\nelif a < b:\\n    print(\\\"0\\\")\\nelse:\\n    c = a- b;\\n    out = 0\\n    cek = [1]\\n    dum = c\\n    if dum % 2 == 0:\\n        cek.append(2)\\n        while dum % 2 == 0:\\n            dum /= 2\\n            for i in range(len(cek)):\\n                cek.append(cek[i] * 2)\\n    cek = list(set(cek))\\n    border = int(math.sqrt(dum))\\n    for i in range(3,border+1,2):\\n        if dum % i == 0:\\n            cek.append(i)\\n            while dum % i == 0:\\n                dum /= i\\n                for j in range(len(cek)):\\n                    cek.append(cek[j] * i)\\n    dum = int(dum)\\n    if dum != 0:\\n        for j in range(len(cek)):\\n            cek.append(cek[j] * dum)\\n    cek = list(set(cek))\\n    cek.sort()\\n    for i in cek:\\n        if i == 0:\\n            continue\\n        if c % i == 0:\\n            result = c / i\\n            if result <= b:\\n                break\\n            out += 1\\n    print(out)\\n\", \"import math\\nimport collections\\n\\n\\ndef multipliers(x):\\n\\n    divisors = []\\n    divisor = 2\\n    stop = math.sqrt(x)\\n    while x != 1 and divisor <= stop:\\n\\n        if x % divisor == 0:\\n\\n            x //= divisor\\n            divisors.append(divisor)\\n\\n        else:\\n\\n            divisor += 1\\n\\n    if x != 1:\\n\\n        divisors.append(x)\\n\\n    return divisors\\n\\n\\ndef count(muls, bound, viewed = None, x=1):\\n\\n    viewed = viewed or set()\\n    for i, mul in enumerate(muls):\\n\\n        nx = x * mul\\n        if nx not in viewed:\\n\\n            viewed.add(nx)\\n            if nx > bound:\\n\\n                yield 1\\n\\n            yield from count(muls[:i] + muls[i + 1:], bound, viewed, nx)\\n\\n\\na, b = list(map(int, input().split()))\\n# a, b = 4, 0\\nif a == b:\\n\\n    print(\\\"infinity\\\")\\n\\nelif b > a or a == 0:\\n\\n    print(0)\\n\\nelif (a, b) == (1, 0):\\n\\n    print(1)\\n\\nelse:\\n\\n    muls = multipliers(a - b)\\n    r = sum(count(muls, b))\\n    print(r if b else r + 1)\\n\", \"import itertools\\nimport math\\n\\ndef main():\\n\\ta, b = list(map(int, input().split()))\\n\\n\\tif a == b:\\n\\t\\tprint(\\\"infinity\\\")\\n\\t\\treturn\\n\\tif a < b:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\ta -= b\\n\\n\\tn = 0\\n\\n\\tfor i in range(1, math.ceil(math.sqrt(a))):\\n\\t\\tif (a % i == 0):\\n\\t\\t\\tn += (i > b) + (a // i > b)\\n\\n\\tif math.sqrt(a) % 1 == 0 and math.sqrt(a) > b:\\n\\t\\tn += 1\\n\\n\\tprint(n)\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"import math\\n\\na, b= [int(i) for i in input().split()]\\n\\nif a<b: print (0)\\nelse: \\n    if a== b: print(\\\"infinity\\\")\\n    else:               #>b and divisors of a\\n        def FindAllDivisors(x, b):\\n            y = 1\\n            ans= []\\n            while y <= int(math.sqrt(x)):\\n                #print(y)\\n                if x % y == 0:\\n                    #print(x, int(x/y))\\n                    if y!= int(x/y) :\\n                        if y>b:\\n                            ans.append(y)\\n                        if int(x/y)>b:\\n                            ans.append(int(x/y))\\n                    elif y== int(x/y) and y>b:\\n                        ans.append(y)\\n                y += 1\\n            return len(ans)\\n        print(FindAllDivisors(a-b, b))\", \"a, b = [int(i) for i in input().split()]\\no = a - b\\nsum = 0\\nl = 1\\nif o > 0:\\n    for i in range(1, int(o ** 0.5) + l):\\n        if o % i == 0:\\n            if o // i > b and i > b:\\n                sum += 2\\n                if i == o // i:\\n                    sum -= 1\\n            if (o // i > b and i <= b) or (o // i <= b and i > b):\\n                sum += 1\\n\\nif o == 0:\\n    print('infinity')\\nelse:\\n    print(sum)\", \"from math import *\\n\\na, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\n    return\\n\\nt = a - b\\n\\ndef primes_sieve(limit):\\n    limitn = limit+1\\n    not_prime = [False] * limitn\\n    primes = []\\n\\n    for i in range(2, limitn):\\n        if not_prime[i]:\\n            continue\\n        for f in range(i*2, limitn, i):\\n            not_prime[f] = True\\n\\n        primes.append(i)\\n\\n    return primes\\n\\nlst = primes_sieve(trunc(sqrt(10**10+7)))\\n\\ndef factorize(n, primes):\\n    factors = []\\n    for p in primes:\\n        if p*p > n: break\\n        i = 0\\n        while n % p == 0:\\n            n //= p\\n            i+=1\\n        if i > 0:\\n            factors.append((p, i));\\n    if n > 1: factors.append((n, 1))\\n\\n    return factors\\n    \\ndef divisors(factors):\\n    div = [1]\\n    for (p, r) in factors:\\n        div = [d * p**e for d in div for e in range(r + 1)]\\n    return div\\n\\n\\ndv = divisors(factorize(t, lst))\\nc = 0\\nfor x in dv:\\n    if x > b:\\n        c+=1\\nprint(c)\\n#print(dv)\\n\", \"# -*- coding: utf-8 -*-\\nimport random\\n\\na, b = list(map(int, input().split()))\\n\\ndef sums(s, l, b):\\n    if s > b:\\n        p = 1\\n        for x in l:\\n            p *= (x[1]+1)\\n        #print(\\\"ok, s=\\\",s,p)\\n        return p\\n\\n    if not l:\\n        #print(\\\"malo: \\\", s)\\n        return 0\\n    #print(s, end=\\\" \\\")\\n\\n    p = 0\\n    for i in range(l[0][1]+1):\\n        p += sums(s * (l[0][0]**i), l[1:], b)\\n    return p\\n\\n\\ndef naive(a,b):\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        if a < b:\\n            return 0\\n        else:\\n            count = 0\\n            for x in range(1, a+1):\\n                if a % x == b:\\n                    count += 1\\n            return count\\n\\n\\ndef wise(a, b):\\n    if a == 1 and b == 0:\\n        return 1\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        d = a-b\\n        factors = {}\\n        i = 2\\n        while i*i <= d:\\n            if d % i == 0:\\n                factors.setdefault(i, 0)\\n                factors[i] += 1\\n                d //= i\\n            else:\\n                i += 1\\n        factors.setdefault(d, 0)\\n        factors[d] += 1\\n\\n        return sums(1, list(factors.items()), b)\\n            \\n#for i in range(10000):\\n    ##print(i)\\n    #a, b = map(int, input().split())\\n    ##a = random.randint(0,100000)\\n    ##b = random.randint(0,100000)\\n    #if wise(a, b) != naive(a, b):\\n        #print(\\\"!!!\\\")\\n    #print(a, b, wise(a, b), naive(a, b))\\n\\nprint(wise(a, b))\\n        \\n\", \"inp = input().split(' ')\\na = int(inp[0])\\nb = int(inp[1])\\ndiff = a-b\\nif a == b:\\n    print('infinity')\\nelif diff < 0:\\n    print(0)\\nelse:\\n    l = []\\n    out = 1\\n    for x in range(2,int(diff**(1/2))+1):\\n        num = 0\\n        y = diff/x\\n        while y == int(y):\\n            num += 1\\n            diff /= x\\n            y /= x\\n        if num != 0:\\n            l.append([x,num])\\n            out *= (num + 1)\\n        if diff < x:\\n            break\\n    if diff != 1:\\n        l.append([int(diff),1])\\n        out *= 2\\n    if b == 0:\\n        print(out)\\n    else:\\n        flessb = [1]\\n        for pair in l:\\n            newl = []\\n            for x in flessb:\\n                y = x\\n                for exp in range(pair[1]+1):\\n                    if y<=b:\\n                        newl.append(y)\\n                        y *= pair[0]\\n                    else:\\n                        break\\n            flessb = set(newl)\\n        print(int(out-len(flessb)))\\n\\n\", \"a=input().split(\\\" \\\")\\nx1=int(a[0]);\\ny1=int(a[1]);\\na1=x1-y1;\\nif x1==y1:\\n print (\\\"infinity\\\");\\nelse:\\n i=1;\\n counter=0;\\n while i**2<=a1:\\n  counter+=(a1 % i == 0 and i > y1)+(a1 % i == 0 and a1 // i > y1 and i != a1 // i);\\n  i+=1;\\n print(counter);\\n\", \"a, b = map(int, input().split(' '))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\", \"a, b = list(map(int, input().split(' ')))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\\n\", \"from math import floor, sqrt\\n\\n\\ndef main():\\n    a, b = list(map(int, input().split()))\\n    if a == b:\\n        print('infinity')\\n    elif a < b:\\n        print(0)\\n    else:\\n        res, ab = 0, a - b\\n        for x in range(1, floor(sqrt(ab)) + 1):\\n            if not ab % x:\\n                if x > b:\\n                    res += 1\\n                if b * x < ab != x * x:\\n                    res += 1\\n        print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main2(a,b):\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx=[1]\\n    loop=2\\n    while loop<=x:\\n        if x % loop == 0:\\n            x //= loop\\n            xx.extend([loop*j for j in xx if loop*j not in xx])\\n        else:\\n            loop += 1\\n        print(loop,x,xx)\\n    xx = [k for k in xx if k > b]\\n    print(len(xx))\\n\\ndef main3(a,b):\\n    from math import ceil, sqrt\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx = []\\n    for i in range(b+1,ceil(sqrt(x))):\\n        if x % i == 0: xx.append(i)\\n    print(len(xx))\\ndef main(a,b,Test=False):\\n    from math import ceil, sqrt, floor\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    if b>a:\\n        print(\\\"0\\\")\\n        return\\n    x = a-b\\n    ans = 0\\n    for i in range(1,floor(sqrt(x))+1):\\n        if x%i == 0:\\n            if i*i==x:\\n                ans += i>b\\n            else:\\n                ans += (i>b)+(x//i>b)\\n                if Test: print(i,x//i,ans)\\n    print(ans)\\n\\ndef test():\\n    from mxn.timer import Timer, timer\\n    print()\\n    main(21,5)\\n    main(10,10)\\n    main(0,1000)\\n    with Timer() as tm:\\n        main(9435152,272)\\n    with Timer() as tm:\\n        main(325508499, 119510657)\\n    with Timer() as tm:\\n        main(1000000000, 6)\\n    main(11,2,Test=0)\\n    main(15,3,Test=1)\\n#test()\\n\\ndef main_input():\\n    a,b = list(map(int,input().split()))\\n    main(a,b)\\n\\ndef __starting_point():\\n    main_input()\\n\\n__starting_point()\", \"tmp = input().split()\\na = int(tmp[0])\\nb = int(tmp[1])\\na -= b\\nif a == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    ans = 0\\n    i = 1\\n    while i * i < a:\\n        if a % i == 0:\\n            if i > b:\\n                ans += 1\\n            if a/i > b:\\n                ans += 1\\n        i += 1\\n    if i * i == a and i > b:\\n        ans += 1\\n    print(ans)\\n\", \"import math, time\\n\\na, b= [int(i) for i in input().split()]\\nif a<b: print(0)\\nelif a==b: print(\\\"infinity\\\")\\nelse:\\n    def FindRequiredDivisors(x, b):\\n        y= 1\\n        ans= 0\\n        while y <= int(math.sqrt(x)):\\n            if x % y == 0:\\n                if y!= int(x/y) :\\n                    if y>b:\\n                        ans+= 1\\n                    if int(x/y)>b:\\n                        ans+= 1\\n                elif y== int(x/y) and y>b:\\n                    ans+= 1\\n            y+= 1\\n        return ans\\n    print(FindRequiredDivisors(a-b, b))        \", \"a,b=map(int,input().split());\\ndis=a-b;\\nif dis==0:\\n\\tprint(\\\"infinity\\\");\\nelse :\\n\\tres=0;\\n\\tx=1;\\n\\twhile x**2<=dis:\\n\\t\\tif dis%x==0 and x>b:\\n\\t\\t\\tres+=1;\\n\\t\\tif dis%x==0 and dis//x>b and x**2!=dis:\\n\\t\\t\\tres+=1;\\n\\t\\tx+=1;\\n\\tprint(res);\", \"import sys\\n\\na, b = list(map(int, input().split()))\\ndis = a - b\\nif dis == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    res = 0\\n    x = 1\\n    while x ** 2 <= dis:\\n        if dis % x == 0 and x > b:\\n            res += 1\\n        if dis % x == 0 and dis // x > b and x ** 2 != dis:\\n            res += 1\\n        x += 1\\n    print(res)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x in range(b + 1, a - b + 1))\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x > b)\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nk, val = 1, 0\\nwhile k * k <= a - b:\\n    if (a - b) % k == 0:\\n        val += sum(1 for x in {k, (a - b) // k} if x > b)\\n    k += 1\\nprint('infinity' if a == b else val)\\n\", \"import sys\\na, b = map(int, sys.stdin.readline().split())\\nif a < b:\\n  print(0)\\nelif a == b:\\n  print('infinity')\\nelse:\\n  n = a - b\\n  if n <= b:\\n    print(0)\\n  else:\\n    ans = 0\\n    i = 1\\n    while i * i <= n:\\n      if n % i == 0:\\n        if i > b: ans += 1\\n        if n // i > b and n // i != i: ans += 1\\n      i += 1\\n    print(ans)\", \"x,y=list(map(int,input().split()))\\n\\nn=x-y\\nj=n\\nc=0\\nif j<0:\\n    print(c)\\nelif j==0:\\n    print(\\\"infinity\\\")\\nelse:\\n    result_set = set()\\n    sqrtn = int(n**0.5)\\n    for i in range(1,sqrtn+1):\\n        q, r = n/i, n%i\\n        if r == 0:\\n            if(q>y):\\n                result_set.add(q)\\n            if(i>y):\\n                result_set.add(i)\\n            \\n    print( len(result_set))\\n    \\n\", \"x = input(\\\"\\\").split(\\\" \\\")\\na = int(x[0])\\nb = int(x[1])\\nlist = []\\nanswer = 0\\nif a == b:\\n    print(\\\"infinity\\\")\\nelse:\\n    value = 1\\n    while value**2 <= a-b:\\n        if (a-b)%value == 0:\\n            list.append(value)\\n            if (value != (a-b)/value):\\n                list.append((a-b)/value)\\n        value = value + 1\\n    for value in list:\\n        if value > b:\\n            answer = answer + 1\\n    \\n    print(answer)\", \"#!/usr/bin/env python3\\nimport math\\n\\na, b = list(map(int,input().split()))\\ndiff = a - b\\nif diff < 0:\\n    print(0)\\nelif diff == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    cnt = 0\\n    for i in range(1, 1 + int(math.sqrt(diff))):\\n        if diff % i == 0 and i > b:\\n            cnt += 1\\n        if diff % i == 0 and diff // i > b and i * i != diff:\\n            cnt += 1\\n    print(cnt)\\n\"]",
        "difficulty": "interview",
        "input": "997920 0\n",
        "output": "240\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/495/B"
    },
    {
        "id": 848,
        "task_id": 672,
        "test_case_id": 35,
        "question": "Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by $i \\operatorname{mod} j$. A Modular Equation, as Hamed's teacher described, is an equation of the form $a \\operatorname{mod} x = b$ in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which $a \\operatorname{mod} x = b$ a solution of our equation.\n\nHamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.\n\nNow he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation $a \\operatorname{mod} x = b$ has.\n\n\n-----Input-----\n\nIn the only line of the input two space-separated integers a and b (0 ≤ a, b ≤ 10^9) are given.\n\n\n-----Output-----\n\nIf there is an infinite number of answers to our equation, print \"infinity\" (without the quotes). Otherwise print the number of solutions of the Modular Equation $a \\operatorname{mod} x = b$.\n\n\n-----Examples-----\nInput\n21 5\n\nOutput\n2\n\nInput\n9435152 272\n\nOutput\n282\n\nInput\n10 10\n\nOutput\ninfinity\n\n\n\n-----Note-----\n\nIn the first sample the answers of the Modular Equation are 8 and 16 since $21 \\operatorname{mod} 8 = 21 \\operatorname{mod} 16 = 5$",
        "solutions": "[\"# fin = open(\\\"input.txt\\\")\\n# a, b = map(int, fin.readline().split())\\na, b = list(map(int, input().split()))\\na2 = a - b\\nif a2 == 0:\\n\\tprint(\\\"infinity\\\")\\nelse:\\n\\tCount = 0\\n\\ti = 1\\n\\twhile i ** 2 <= a2:\\n\\t\\tCount += (a2 % i == 0 and i > b) + (a2 % i == 0 and a2 // i > b and i != a2 // i)\\n\\t\\ti += 1\\n\\tprint(Count)\\n\", \"import math\\nline = input().split()\\na = int(line[0])\\nb = int(line[1])\\nif a == 0 and b == 0:\\n    print(\\\"infinity\\\")\\nelif a == 0:\\n    print(\\\"0\\\")\\nelif a== b:\\n    print(\\\"infinity\\\")\\nelif a < b:\\n    print(\\\"0\\\")\\nelse:\\n    c = a- b;\\n    out = 0\\n    cek = [1]\\n    dum = c\\n    if dum % 2 == 0:\\n        cek.append(2)\\n        while dum % 2 == 0:\\n            dum /= 2\\n            for i in range(len(cek)):\\n                cek.append(cek[i] * 2)\\n    cek = list(set(cek))\\n    border = int(math.sqrt(dum))\\n    for i in range(3,border+1,2):\\n        if dum % i == 0:\\n            cek.append(i)\\n            while dum % i == 0:\\n                dum /= i\\n                for j in range(len(cek)):\\n                    cek.append(cek[j] * i)\\n    dum = int(dum)\\n    if dum != 0:\\n        for j in range(len(cek)):\\n            cek.append(cek[j] * dum)\\n    cek = list(set(cek))\\n    cek.sort()\\n    for i in cek:\\n        if i == 0:\\n            continue\\n        if c % i == 0:\\n            result = c / i\\n            if result <= b:\\n                break\\n            out += 1\\n    print(out)\\n\", \"import math\\nimport collections\\n\\n\\ndef multipliers(x):\\n\\n    divisors = []\\n    divisor = 2\\n    stop = math.sqrt(x)\\n    while x != 1 and divisor <= stop:\\n\\n        if x % divisor == 0:\\n\\n            x //= divisor\\n            divisors.append(divisor)\\n\\n        else:\\n\\n            divisor += 1\\n\\n    if x != 1:\\n\\n        divisors.append(x)\\n\\n    return divisors\\n\\n\\ndef count(muls, bound, viewed = None, x=1):\\n\\n    viewed = viewed or set()\\n    for i, mul in enumerate(muls):\\n\\n        nx = x * mul\\n        if nx not in viewed:\\n\\n            viewed.add(nx)\\n            if nx > bound:\\n\\n                yield 1\\n\\n            yield from count(muls[:i] + muls[i + 1:], bound, viewed, nx)\\n\\n\\na, b = list(map(int, input().split()))\\n# a, b = 4, 0\\nif a == b:\\n\\n    print(\\\"infinity\\\")\\n\\nelif b > a or a == 0:\\n\\n    print(0)\\n\\nelif (a, b) == (1, 0):\\n\\n    print(1)\\n\\nelse:\\n\\n    muls = multipliers(a - b)\\n    r = sum(count(muls, b))\\n    print(r if b else r + 1)\\n\", \"import itertools\\nimport math\\n\\ndef main():\\n\\ta, b = list(map(int, input().split()))\\n\\n\\tif a == b:\\n\\t\\tprint(\\\"infinity\\\")\\n\\t\\treturn\\n\\tif a < b:\\n\\t\\tprint(0)\\n\\t\\treturn\\n\\ta -= b\\n\\n\\tn = 0\\n\\n\\tfor i in range(1, math.ceil(math.sqrt(a))):\\n\\t\\tif (a % i == 0):\\n\\t\\t\\tn += (i > b) + (a // i > b)\\n\\n\\tif math.sqrt(a) % 1 == 0 and math.sqrt(a) > b:\\n\\t\\tn += 1\\n\\n\\tprint(n)\\n\\ndef __starting_point():\\n\\tmain()\\n\\n__starting_point()\", \"import math\\n\\na, b= [int(i) for i in input().split()]\\n\\nif a<b: print (0)\\nelse: \\n    if a== b: print(\\\"infinity\\\")\\n    else:               #>b and divisors of a\\n        def FindAllDivisors(x, b):\\n            y = 1\\n            ans= []\\n            while y <= int(math.sqrt(x)):\\n                #print(y)\\n                if x % y == 0:\\n                    #print(x, int(x/y))\\n                    if y!= int(x/y) :\\n                        if y>b:\\n                            ans.append(y)\\n                        if int(x/y)>b:\\n                            ans.append(int(x/y))\\n                    elif y== int(x/y) and y>b:\\n                        ans.append(y)\\n                y += 1\\n            return len(ans)\\n        print(FindAllDivisors(a-b, b))\", \"a, b = [int(i) for i in input().split()]\\no = a - b\\nsum = 0\\nl = 1\\nif o > 0:\\n    for i in range(1, int(o ** 0.5) + l):\\n        if o % i == 0:\\n            if o // i > b and i > b:\\n                sum += 2\\n                if i == o // i:\\n                    sum -= 1\\n            if (o // i > b and i <= b) or (o // i <= b and i > b):\\n                sum += 1\\n\\nif o == 0:\\n    print('infinity')\\nelse:\\n    print(sum)\", \"from math import *\\n\\na, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\n    return\\n\\nt = a - b\\n\\ndef primes_sieve(limit):\\n    limitn = limit+1\\n    not_prime = [False] * limitn\\n    primes = []\\n\\n    for i in range(2, limitn):\\n        if not_prime[i]:\\n            continue\\n        for f in range(i*2, limitn, i):\\n            not_prime[f] = True\\n\\n        primes.append(i)\\n\\n    return primes\\n\\nlst = primes_sieve(trunc(sqrt(10**10+7)))\\n\\ndef factorize(n, primes):\\n    factors = []\\n    for p in primes:\\n        if p*p > n: break\\n        i = 0\\n        while n % p == 0:\\n            n //= p\\n            i+=1\\n        if i > 0:\\n            factors.append((p, i));\\n    if n > 1: factors.append((n, 1))\\n\\n    return factors\\n    \\ndef divisors(factors):\\n    div = [1]\\n    for (p, r) in factors:\\n        div = [d * p**e for d in div for e in range(r + 1)]\\n    return div\\n\\n\\ndv = divisors(factorize(t, lst))\\nc = 0\\nfor x in dv:\\n    if x > b:\\n        c+=1\\nprint(c)\\n#print(dv)\\n\", \"# -*- coding: utf-8 -*-\\nimport random\\n\\na, b = list(map(int, input().split()))\\n\\ndef sums(s, l, b):\\n    if s > b:\\n        p = 1\\n        for x in l:\\n            p *= (x[1]+1)\\n        #print(\\\"ok, s=\\\",s,p)\\n        return p\\n\\n    if not l:\\n        #print(\\\"malo: \\\", s)\\n        return 0\\n    #print(s, end=\\\" \\\")\\n\\n    p = 0\\n    for i in range(l[0][1]+1):\\n        p += sums(s * (l[0][0]**i), l[1:], b)\\n    return p\\n\\n\\ndef naive(a,b):\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        if a < b:\\n            return 0\\n        else:\\n            count = 0\\n            for x in range(1, a+1):\\n                if a % x == b:\\n                    count += 1\\n            return count\\n\\n\\ndef wise(a, b):\\n    if a == 1 and b == 0:\\n        return 1\\n    if a == b:\\n        return \\\"infinity\\\"\\n    else:\\n        d = a-b\\n        factors = {}\\n        i = 2\\n        while i*i <= d:\\n            if d % i == 0:\\n                factors.setdefault(i, 0)\\n                factors[i] += 1\\n                d //= i\\n            else:\\n                i += 1\\n        factors.setdefault(d, 0)\\n        factors[d] += 1\\n\\n        return sums(1, list(factors.items()), b)\\n            \\n#for i in range(10000):\\n    ##print(i)\\n    #a, b = map(int, input().split())\\n    ##a = random.randint(0,100000)\\n    ##b = random.randint(0,100000)\\n    #if wise(a, b) != naive(a, b):\\n        #print(\\\"!!!\\\")\\n    #print(a, b, wise(a, b), naive(a, b))\\n\\nprint(wise(a, b))\\n        \\n\", \"inp = input().split(' ')\\na = int(inp[0])\\nb = int(inp[1])\\ndiff = a-b\\nif a == b:\\n    print('infinity')\\nelif diff < 0:\\n    print(0)\\nelse:\\n    l = []\\n    out = 1\\n    for x in range(2,int(diff**(1/2))+1):\\n        num = 0\\n        y = diff/x\\n        while y == int(y):\\n            num += 1\\n            diff /= x\\n            y /= x\\n        if num != 0:\\n            l.append([x,num])\\n            out *= (num + 1)\\n        if diff < x:\\n            break\\n    if diff != 1:\\n        l.append([int(diff),1])\\n        out *= 2\\n    if b == 0:\\n        print(out)\\n    else:\\n        flessb = [1]\\n        for pair in l:\\n            newl = []\\n            for x in flessb:\\n                y = x\\n                for exp in range(pair[1]+1):\\n                    if y<=b:\\n                        newl.append(y)\\n                        y *= pair[0]\\n                    else:\\n                        break\\n            flessb = set(newl)\\n        print(int(out-len(flessb)))\\n\\n\", \"a=input().split(\\\" \\\")\\nx1=int(a[0]);\\ny1=int(a[1]);\\na1=x1-y1;\\nif x1==y1:\\n print (\\\"infinity\\\");\\nelse:\\n i=1;\\n counter=0;\\n while i**2<=a1:\\n  counter+=(a1 % i == 0 and i > y1)+(a1 % i == 0 and a1 // i > y1 and i != a1 // i);\\n  i+=1;\\n print(counter);\\n\", \"a, b = map(int, input().split(' '))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\", \"a, b = list(map(int, input().split(' ')))\\ndiff = a-b\\nif a == 0 or b == 0 or diff == 0 or b > a:\\n    if b > a:\\n        print(0)\\n    elif a == 0 and b == 0:\\n        print(\\\"infinity\\\")\\n    elif a == 0:\\n        print(0)\\n    elif b == 0:\\n        factors = []\\n        for i in range(1, int(diff ** 0.5) + 1):\\n            if diff % i == 0:\\n                factors.append(i)\\n                factors.append(int(diff/i))\\n        factors = list(set(factors))\\n        facts = [i for i in factors if i > b]\\n        print(len(facts))\\n    else:\\n        print(\\\"infinity\\\")\\n\\nelse:\\n    b = b % a\\n    diff = a-b\\n    factors = []\\n    for i in range(1, int(diff ** 0.5) + 1):\\n        if diff % i == 0:\\n            factors.append(i)\\n            factors.append(int(diff/i))\\n    factors = list(set(factors))\\n    facts = [i for i in factors if i > b]\\n    print(len(facts))\\n\", \"from math import floor, sqrt\\n\\n\\ndef main():\\n    a, b = list(map(int, input().split()))\\n    if a == b:\\n        print('infinity')\\n    elif a < b:\\n        print(0)\\n    else:\\n        res, ab = 0, a - b\\n        for x in range(1, floor(sqrt(ab)) + 1):\\n            if not ab % x:\\n                if x > b:\\n                    res += 1\\n                if b * x < ab != x * x:\\n                    res += 1\\n        print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"def main2(a,b):\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx=[1]\\n    loop=2\\n    while loop<=x:\\n        if x % loop == 0:\\n            x //= loop\\n            xx.extend([loop*j for j in xx if loop*j not in xx])\\n        else:\\n            loop += 1\\n        print(loop,x,xx)\\n    xx = [k for k in xx if k > b]\\n    print(len(xx))\\n\\ndef main3(a,b):\\n    from math import ceil, sqrt\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    x = a-b\\n    if b != 0:\\n        if x//b == 1:\\n            print(x//b)\\n            return\\n        if x//b <= 0:\\n            print(0)\\n            return\\n    xx = []\\n    for i in range(b+1,ceil(sqrt(x))):\\n        if x % i == 0: xx.append(i)\\n    print(len(xx))\\ndef main(a,b,Test=False):\\n    from math import ceil, sqrt, floor\\n    if a==b:\\n        print(\\\"infinity\\\")\\n        return\\n    if b>a:\\n        print(\\\"0\\\")\\n        return\\n    x = a-b\\n    ans = 0\\n    for i in range(1,floor(sqrt(x))+1):\\n        if x%i == 0:\\n            if i*i==x:\\n                ans += i>b\\n            else:\\n                ans += (i>b)+(x//i>b)\\n                if Test: print(i,x//i,ans)\\n    print(ans)\\n\\ndef test():\\n    from mxn.timer import Timer, timer\\n    print()\\n    main(21,5)\\n    main(10,10)\\n    main(0,1000)\\n    with Timer() as tm:\\n        main(9435152,272)\\n    with Timer() as tm:\\n        main(325508499, 119510657)\\n    with Timer() as tm:\\n        main(1000000000, 6)\\n    main(11,2,Test=0)\\n    main(15,3,Test=1)\\n#test()\\n\\ndef main_input():\\n    a,b = list(map(int,input().split()))\\n    main(a,b)\\n\\ndef __starting_point():\\n    main_input()\\n\\n__starting_point()\", \"tmp = input().split()\\na = int(tmp[0])\\nb = int(tmp[1])\\na -= b\\nif a == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    ans = 0\\n    i = 1\\n    while i * i < a:\\n        if a % i == 0:\\n            if i > b:\\n                ans += 1\\n            if a/i > b:\\n                ans += 1\\n        i += 1\\n    if i * i == a and i > b:\\n        ans += 1\\n    print(ans)\\n\", \"import math, time\\n\\na, b= [int(i) for i in input().split()]\\nif a<b: print(0)\\nelif a==b: print(\\\"infinity\\\")\\nelse:\\n    def FindRequiredDivisors(x, b):\\n        y= 1\\n        ans= 0\\n        while y <= int(math.sqrt(x)):\\n            if x % y == 0:\\n                if y!= int(x/y) :\\n                    if y>b:\\n                        ans+= 1\\n                    if int(x/y)>b:\\n                        ans+= 1\\n                elif y== int(x/y) and y>b:\\n                    ans+= 1\\n            y+= 1\\n        return ans\\n    print(FindRequiredDivisors(a-b, b))        \", \"a,b=map(int,input().split());\\ndis=a-b;\\nif dis==0:\\n\\tprint(\\\"infinity\\\");\\nelse :\\n\\tres=0;\\n\\tx=1;\\n\\twhile x**2<=dis:\\n\\t\\tif dis%x==0 and x>b:\\n\\t\\t\\tres+=1;\\n\\t\\tif dis%x==0 and dis//x>b and x**2!=dis:\\n\\t\\t\\tres+=1;\\n\\t\\tx+=1;\\n\\tprint(res);\", \"import sys\\n\\na, b = list(map(int, input().split()))\\ndis = a - b\\nif dis == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    res = 0\\n    x = 1\\n    while x ** 2 <= dis:\\n        if dis % x == 0 and x > b:\\n            res += 1\\n        if dis % x == 0 and dis // x > b and x ** 2 != dis:\\n            res += 1\\n        x += 1\\n    print(res)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x in range(b + 1, a - b + 1))\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nif a == b:\\n    print('infinity')\\nelse:\\n    k, val = 1, 0\\n    while k * k <= a - b:\\n        if (a - b) % k == 0:\\n            val += sum(1 for x in {k, (a - b) // k} if x > b)\\n        k += 1\\n    print(val)\\n\", \"a, b = list(map(int, input().split()))\\nk, val = 1, 0\\nwhile k * k <= a - b:\\n    if (a - b) % k == 0:\\n        val += sum(1 for x in {k, (a - b) // k} if x > b)\\n    k += 1\\nprint('infinity' if a == b else val)\\n\", \"import sys\\na, b = map(int, sys.stdin.readline().split())\\nif a < b:\\n  print(0)\\nelif a == b:\\n  print('infinity')\\nelse:\\n  n = a - b\\n  if n <= b:\\n    print(0)\\n  else:\\n    ans = 0\\n    i = 1\\n    while i * i <= n:\\n      if n % i == 0:\\n        if i > b: ans += 1\\n        if n // i > b and n // i != i: ans += 1\\n      i += 1\\n    print(ans)\", \"x,y=list(map(int,input().split()))\\n\\nn=x-y\\nj=n\\nc=0\\nif j<0:\\n    print(c)\\nelif j==0:\\n    print(\\\"infinity\\\")\\nelse:\\n    result_set = set()\\n    sqrtn = int(n**0.5)\\n    for i in range(1,sqrtn+1):\\n        q, r = n/i, n%i\\n        if r == 0:\\n            if(q>y):\\n                result_set.add(q)\\n            if(i>y):\\n                result_set.add(i)\\n            \\n    print( len(result_set))\\n    \\n\", \"x = input(\\\"\\\").split(\\\" \\\")\\na = int(x[0])\\nb = int(x[1])\\nlist = []\\nanswer = 0\\nif a == b:\\n    print(\\\"infinity\\\")\\nelse:\\n    value = 1\\n    while value**2 <= a-b:\\n        if (a-b)%value == 0:\\n            list.append(value)\\n            if (value != (a-b)/value):\\n                list.append((a-b)/value)\\n        value = value + 1\\n    for value in list:\\n        if value > b:\\n            answer = answer + 1\\n    \\n    print(answer)\", \"#!/usr/bin/env python3\\nimport math\\n\\na, b = list(map(int,input().split()))\\ndiff = a - b\\nif diff < 0:\\n    print(0)\\nelif diff == 0:\\n    print(\\\"infinity\\\")\\nelse:\\n    cnt = 0\\n    for i in range(1, 1 + int(math.sqrt(diff))):\\n        if diff % i == 0 and i > b:\\n            cnt += 1\\n        if diff % i == 0 and diff // i > b and i * i != diff:\\n            cnt += 1\\n    print(cnt)\\n\"]",
        "difficulty": "interview",
        "input": "2 0\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/495/B"
    },
    {
        "id": 849,
        "task_id": 1447,
        "test_case_id": 7,
        "question": "Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and performs the trick with those. The resulting deck looks like a normal deck, but may have duplicates of some cards.\n\nThe trick itself is performed as follows: first Alex allows you to choose a random card from the deck. You memorize the card and put it back in the deck. Then Alex shuffles the deck, and pulls out a card. If the card matches the one you memorized, the trick is successful.\n\nYou don't think Alex is a very good magician, and that he just pulls a card randomly from the deck. Determine the probability of the trick being successful if this is the case.\n\n\n-----Input-----\n\nFirst line of the input consists of two integers n and m (1 ≤ n, m ≤ 1000), separated by space — number of cards in each deck, and number of decks.\n\n\n-----Output-----\n\nOn the only line of the output print one floating point number – probability of Alex successfully performing the trick. Relative or absolute error of your answer should not be higher than 10^{ - 6}.\n\n\n-----Examples-----\nInput\n2 2\n\nOutput\n0.6666666666666666\n\nInput\n4 4\n\nOutput\n0.4000000000000000\n\nInput\n1 2\n\nOutput\n1.0000000000000000\n\n\n\n-----Note-----\n\nIn the first sample, with probability $\\frac{1}{3}$ Alex will perform the trick with two cards with the same value from two different decks. In this case the trick is guaranteed to succeed.\n\nWith the remaining $\\frac{2}{3}$ probability he took two different cards, and the probability of pulling off the trick is $\\frac{1}{2}$.\n\nThe resulting probability is $\\frac{1}{3} \\times 1 + \\frac{2}{3} \\times \\frac{1}{2} = \\frac{2}{3}$",
        "solutions": "[\"n, m = map(int, input().split())\\n\\nif n == 1:\\n    print(1)\\nelse:\\n    print('{:9}'.format((n-1)/n * (m - 1) / (n*m - 1) + 1 / n))\", \"F=[1,1]\\nfor i in range(2,1001):\\n    F.append(F[-1]*i)\\ndef ncr(x,y):\\n    return F[x]//(F[y]*F[x-y])\\n\\nn,m=list(map(int,input().split()))\\nP=[0]*2000\\n\\nfor j in range(1,min(m,n)+1):\\n    mine=m\\n    total=n*m\\n    p=1\\n    for x in range(j):\\n        p*=mine/total\\n        mine-=1\\n        total-=1\\n    for x in range(n-j):\\n        p*=(total-mine)/total\\n        total-=1\\n    p*=n\\n    p*=ncr(n,j)\\n    P[j]=p\\n\\nans=0\\n\\nfor j in range(1,min(m,n)+1):\\n    # What is the probability that the deck will contain j cards of type i\\n    p=P[j]\\n    ans+=P[j]*(j*j)/(n*n)\\nprint(ans)\\n\", \"from math import *\\n\\n# logger[n] = log(n!)\\nlogger = []\\nfor n in range(1000111):\\n    if n == 0:\\n        logger.append(log(factorial(0)))\\n    else:\\n        logger.append(logger[n - 1] + log(n))\\n\\ndef binomial(n, k):\\n    if k < 0:\\n        return 0\\n    tmp = logger[n] - logger[k] - logger[n - k]\\n    return tmp\\n\\ndef main():\\n    n, m = [int(x) for x in input().split()]\\n    ans = 0\\n    for i in range(n):\\n        tmp = binomial((n-1)*m, n-1-i) + binomial(m-1, i) + log(i + 1)\\n        tmp -= (log(n) + binomial(n*m - 1, n - 1))\\n        ans += exp(tmp)\\n    print('%.12lf' % ans)\\n\\nmain()\", \"# -- code beginning\\nimport sys\\nn, m = list(map(int, sys.stdin.read().split()))\\nif m * n == 1: print(1)\\nelse: print(1-((m*(n-1)**2)/((m*n-1)*n)))\\n\", \"n, m = map(int, input().split())\\nif n == 1 and m == 1:\\n    print(1)\\nelse:\\n    print(1 / n + ((n - 1) / n) * (m - 1) / (n * m - 1))\", \"n, m=(int(x) for x in input().split(' '))\\nif n!=1 or m!=1:\\n    print(1/n+(n-1)/n*(m-1)/(m*n-1))\\nelse:\\n    print(1)\\n\", \"n, m = list(map(int, input().split()))\\nprint('{:.9}'.format((1 + (n - 1) * (m - 1) / (n * m - 1)) / n if n > 1 or m > 1 else 1.0))\\n\", \"n, m = list(map(int, input().split()))\\nprint('{:.9}'.format((1 + (n - 1) * (m - 1) / (n * m - 1)) / n) if n > 1 or m > 1 else 1)\\n\", \"n,m=map(int,input().split())\\nif n*m==1:\\n    print(1)\\nelse:\\n    print(1/n+(n-1)*(m-1)/(n*(n*m-1)))\", \"n, m = map(int, input().split())\\nt = m * n\\nprint(1 if t == 1 else (2 * t - (m + n)) / (n * (t - 1)))\", \"n, m = map(float, input().split())\\nif n == 1 and m == 1 :\\n    print(1)\\nelse :\\n    print(1 / n + (n - 1) * (m - 1) / n / (n * m - 1))\", \"n,m=list(map(int,input().split()))\\nprint(1.0 if n==m==1 else 1/n*((n-1)*(m-1)/(n*m-1)+1))\\n\", \"import itertools\\nimport math\\n\\n\\nS = 1000000\\n\\n\\ndef __starting_point():\\n    fact = list(itertools.accumulate(list(range(S + 1)), lambda x, y: x + math.log(y)))\\n    n, m = [int(x) for x in input().split()]\\n    res = 0.0\\n    for i in range(1, min(n, m) + 1):\\n        res += math.exp(\\n                math.log(n) + (fact[m] - fact[i] - fact[m - i]) +\\\\\\n                        (fact[(n - 1) * m] - fact[n - i] - fact[(n - 1) * m - n + i]) -\\\\\\n                        (fact[n * m] - fact[n] - fact[n * m - n]) +\\\\\\n                        math.log((1.0 * i / n) ** 2))\\n    print(res)\\n\\n__starting_point()\", \"m, n = map(int, input().split())\\n\\nif m == 1:\\n    print(1)\\nelse:\\n    print(1 / m + (n - 1) * (m - 1) / (m * (m * n - 1)))\", \"n,m=map(int,input().split())\\nprint(1.0 if n==m==1 else ((n*m-n-m+1)/(n*m-1)+1)/n)\", \"import sys\\nimport os\\n\\nn,m = map(float, sys.stdin.readline().split())\\n\\nres = 0\\nif (n == 1):\\n    res = 1\\nelse:\\n    res = (1+(n-1)*(m-1)/(n*m-1))/n\\nprint(res)\", \"def main():\\n    n, m = list(map(int, input().split()))\\n    if n == 1 == m:\\n        res = 1.\\n    else:\\n        res = (2 * n * m - n - m) / (n * m - 1) / n\\n\\n    print('{:.16f}'.format(res))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n,m = map(float, input().split())\\nif n==1:print(1)\\nelse:print((1+(n-1)*(m-1)/(n*m-1))/n)\", \"import math\\nimport decimal\\nimport functools\\n\\n\\n@functools.lru_cache(maxsize=None)\\ndef factorial(n):\\n    return math.factorial(n)\\n\\n\\n@functools.lru_cache(maxsize=None)\\ndef binomial(k, n):\\n    if k > n // 2:\\n        return product(list(range(k + 1, n + 1))) / factorial(n - k)\\n    else:\\n        return product(list(range(n - k + 1, n + 1))) / factorial(k)\\n\\n\\ndef P(k, n, m):\\n    return k ** 2 / n * binomial(k, n) * product((m - i) / (m * n - i) for i in range(k)) * product(\\n        (m * n - i - (m - k)) / (m * n - i) for i in range(k, n))\\n\\n\\ndef product(iterable):\\n    res = 1\\n    for e in iterable:\\n        res *= e\\n    return res\\n\\n\\ndef solve(n, m):\\n    return sum(P(k, n, m) for k in range(1, min(n, m) + 1))\\n\\n\\ndef __starting_point():\\n    n, m = list(map(int, input().split()))\\n    print(solve(n, m))\\n\\n__starting_point()\", \"S=str(input())\\nl=list(map(int, S.split(' ')))\\nn,m=l[0],l[1]\\nS=0\\nt=1/n\\nl=m*n-m-n\\ny=min(n,m)\\nz=max(n,m)\\nfor i in range(1,y+1):\\n    if i>1:\\n        t=t*i*(m+1-i)*(m*n-z-i+2)*(n+1-i)/((i-1)*(i-1)*(l+i)*(n*m-i+1))\\n    S=S*(m*n-z-i+2)/(n*m-i+1)+t\\nprint(S)\", \"var=input(\\\"\\\")\\nvar=var.split(\\\" \\\")\\nx=int(var[0])\\ny=int(var[1])\\nif x==1 and y==1:\\n    print( \\\"1\\\")\\nelse:\\n    p1=(y-1)/(x*y-1)\\n    p2=(1-p1)*(1/x)\\n    print(p1+p2)\\n    \\n\", \"n, m = map(int, input().split())\\n\\nprint(1 if n*m == 1 else 1/n + (n-1) / n * (m-1) / (n*m - 1))\", \"n, m = list(map(int, input().split()))\\nif 1 == n:\\n    print(1)\\nelse:\\n    print(1 / n + (n - 1) * (m - 1) / (n * (n * m - 1)))\\n\", \"m, n = map(int, input().split())\\nif m == 1:\\n    print(1)\\nelse:\\n  print(1/m + (m-1)/m*(n-1)/(n*m-1))\", \"n,m=list(map(int,input().split()))\\n\\nprint(1.0 if n==m==1 else 1/n*((n-1)*(m-1)/(n*m-1)+1))\\n\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "interview",
        "input": "1 1\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/452/C"
    },
    {
        "id": 850,
        "task_id": 1535,
        "test_case_id": 2,
        "question": "There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x_0, y_0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x_0, y_0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\n\n-----Input-----\n\nThe first line contains three integers n, x_0 и y_0 (1 ≤ n ≤ 1000,  - 10^4 ≤ x_0, y_0 ≤ 10^4) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each x_{i}, y_{i} ( - 10^4 ≤ x_{i}, y_{i} ≤ 10^4) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\n\n-----Output-----\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\n\n-----Examples-----\nInput\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\nOutput\n2\n\nInput\n2 1 2\n1 1\n1 0\n\nOutput\n1\n\n\n\n-----Note-----\n\nExplanation to the first and second samples from the statement, respectively:  [Image]",
        "solutions": "[\"\\\"\\\"\\\"\\nCodeforces Contest 291 Div 2 Problem B\\n\\nAuthor  : chaotic_iak\\nLanguage: Python 3.4.2\\n\\\"\\\"\\\"\\n\\n################################################### SOLUTION\\n\\ndef gcd(a,b):\\n    if a < 0: a = -a\\n    if b < 0: b = -b\\n    if a == 0: return b\\n    if b == 0: return a\\n    return gcd(b, a%b)\\n\\ndef main():\\n    n, x0, y0 = read()\\n    lines = set()\\n    for i in range(n):\\n        x, y = read()\\n        x -= x0\\n        y -= y0\\n        if x < 0 or (x == 0 and y < 0): x,y = -x,-y\\n        g = gcd(x,y)\\n        x //= g\\n        y //= g\\n        lines.add((x,y))\\n    return len(lines)\\n\\n\\n\\n#################################################### HELPERS\\n\\n\\n\\ndef read(mode=2):\\n    # 0: String\\n    # 1: List of strings\\n    # 2: List of integers\\n    inputs = input().strip()\\n    if mode == 0: return inputs\\n    if mode == 1: return inputs.split()\\n    if mode == 2: return list(map(int, inputs.split()))\\n\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\n\\nwrite(main())\", \"from fractions import gcd\\nn,x,y = list(map(int,input().split()))\\nL={}\\nfor i in range(n):\\n    a,b = list(map(int,input().split()))\\n    dy = y-b\\n    dx = x-a\\n    if(dx<0):\\n        dy = -dy\\n        dx = -dx\\n    g = gcd(dy,dx)\\n    dy//=g\\n    dx//=g\\n    L[(dy,dx)]=1\\nprint(len(L))\\n\", \"def isequal(a, b):\\n    return abs(a-b) <= 0.00000001\\na, b, c = list(map(int, input().split(' ')))\\nslopes = []\\nfor i in range(a):\\n    x, y = list(map(int, input().split(' ')))\\n    if x == b:\\n        slopes.append(90001)\\n    else:\\n        slopes.append((y-c)/(x-b))\\nprint(len(set(slopes)))\\n\", \"n,x,y = list(map(int, input().split()))\\nS = set()\\nfor i in range(n) :\\n    a, b = list(map(int, input().split()))\\n    S.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(S))\\n\", \"n,x0,y0 = list(map(int,input().split()))\\ntr = []\\nfor i in range(n):\\n\\ttr.append(list(map(int,input().split())))\\n\\na = []\\nans = 0\\nfor i in range(n):\\n\\tif tr[i][1]-y0 == 0:\\n\\t\\tang = \\\"inf\\\"\\n\\telse:\\n\\t\\tang = (tr[i][0]-x0)/(tr[i][1]-y0)\\n\\tif not ang in a:\\n\\t\\ta.append(ang)\\n\\t\\tans += 1\\n\\nprint(ans)\\n\\n\", \"def prin_pram(x,y):\\n    nonlocal A\\n    nonlocal B\\n    nonlocal C\\n    if A*x + B*y+C==0:\\n        return 1\\n    else:\\n        return 0\\nn, x0, y0 = list(map(int, input().split()))\\nxyi = [list(map(int, input().split())) for i in range(n)]\\nnumber = 0\\ni = 0\\nA = 0\\nB = 0\\nC = 0\\nz = 0 \\nwhile number < n:\\n    i = 0\\n    A = xyi[0][1] - y0\\n    B = x0 - xyi[0][0]\\n    C = x0 * (y0 - xyi[0][1]) + y0 * (xyi[0][0] - x0)\\n    for j in range(n - number):\\n        temp = prin_pram(xyi[j][0],xyi[j][1])\\n        if temp == 1:\\n            number += 1\\n        else:\\n            xyi[i][0] = xyi[j][0]\\n            xyi[i][1] = xyi[j][1]\\n            i += 1\\n    z += 1\\nprint(z)\\n\", \"n, x, y = map(int, input().split())\\nA = [list(map(int, input().split())) for i in range(n)]\\nS = set()\\nB = []\\nfor elem in A:\\n    i = 0\\n    while i < len(B) and B[i][0] * elem[0] + B[i][1] * elem[1] + B[i][2] != 0:\\n        i += 1\\n    if i == len(B):\\n        a = elem[1] - y\\n        b = x - elem[0]\\n        c = -(a * x + b * y)\\n        B.append((a, b, c))\\nprint(len(B))\", \"import sys\\nf = sys.stdin\\n\\nn, x0, y0 = map(int, f.readline().strip().split())\\n\\nxy = []\\nfor i in range(n):\\n    xy.append( list(map(int, f.readline().strip().split())) )\\n\\nused = [0]*n\\nv = 0\\nfor i in range(n):\\n    if used[i]==0:\\n        v += 1\\n        used[i] = 1\\n        kx = x0 - xy[i][0]\\n        ky = y0 - xy[i][1]\\n        if kx<0:\\n            kx *= -1\\n            ky *= -1\\n        if kx==0 and ky<0:\\n            ky *= -1\\n        for j in range(i,n):\\n            if used[j]==0:    \\n                kxj = x0 - xy[j][0]\\n                kyj = y0 - xy[j][1]                \\n                if kxj<0:\\n                    kxj *= -1\\n                    kyj *= -1\\n                if kxj==0 and kyj<0:\\n                    kyj *= -1\\n                if kx*kyj==ky*kxj:\\n                    used[j] = 1\\nprint(v)\", \"def coeff(x1, y1, x2, y2):\\n    a = y2 - y1;\\n    b = x1 - x2;\\n    c = -a * x1 - b * y1; \\n    return (a, b, c)\\n    \\ndef PointOnLine(x, y, a, b, c):\\n    if a * x + b * y + c == 0:\\n        return True\\n    else:\\n        return False\\n\\nn, x0, y0 = map(int, input().split())\\ns = set()\\nx = []\\ny = []\\nans = 0\\nfor i in range(n):\\n    a, b = map(int, input().split())\\n    x.append(a)\\n    y.append(b)\\nfor i in range(n):\\n    if (x[i], y[i]) not in s:\\n        a, b, c = coeff(x0, y0, x[i], y[i])\\n        for i in range(n):\\n            if PointOnLine(x[i], y[i], a, b, c):\\n                s.add((x[i], y[i]))\\n        ans += 1\\nprint(ans)\", \"def ans():\\n    n, x0, y0= [int(i) for i in input().split()]\\n    ans= []\\n    for i in range(n):\\n        x, y= [int(i) for i in input().split()]\\n        if x== x0:\\n            ans.append(\\\"s\\\")\\n        else:\\n            ans.append(float(y-y0)/float(x-x0))\\n        \\n    print(len(set(ans)))\\n    \\n    return\\nans()\", \"import math\\nn, x0, y0 = list(map(int, input().split()))\\nslope = []\\nfor i in range(n):\\n    x1, y1 = list(map(int, input().split()))\\n    if x1==x0:\\n        slp = 999\\n    else:\\n        slp = (y1-y0)/(x1-x0)\\n    slope.append(slp)\\nslope.sort()\\ncount = 1\\npoint = slope[0]\\nfor i in range(1,len(slope)):\\n    if slope[i] == point:\\n        continue\\n    else:\\n        count += 1\\n        point = slope[i]\\nprint (count)\\n    \\n\\n    \\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.0000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"from math import *\\nn, x0, y0 = list(map(int, input().split()))\\na = []\\nfor i in range(n):\\n    x, y = list(map(int, input().split()))\\n    a.append([x, y])\\ncnt = 0\\nfor i in range(n):\\n    if a[i] == -1:\\n        continue\\n    A = a[i][1] - y0\\n    B = x0 - a[i][0]\\n    C = -x0 * A + y0 * (a[i][0] - x0)\\n    for j in range(n):\\n        if a[j] == -1:\\n            continue\\n        if A * a[j][0] + B * a[j][1] + C == 0:\\n            a[j] = -1\\n    cnt += 1\\nprint(cnt)\\n\", \"\\ndef main():\\n\\tn, x0, y0 = map(int, input().split())\\n\\tc = set()\\n\\tfor i in range(n):\\n\\t\\tx, y = map(int, input().split())\\n\\t\\tif x - x0 == 0:\\n\\t\\t\\tc.add('inf')\\n\\t\\telse:\\n\\t\\t\\tc.add((y-y0)/(x-x0))\\n\\tprint(len(c))\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"n, x0, y0 = map(int, input().split())\\n\\nps = [list(map(int, input().split())) for i in range(n)]\\n\\nshut = [False for i in range(n)]\\n\\nans=i=0\\n\\nfor x,y in ps:\\n    if not shut[i]:\\n        ans+=1\\n        j=0\\n        for x2, y2 in ps:\\n            if (x-x0)*(y2-y0) == (x2-x0)*(y-y0):\\n                shut[j]=True\\n            j+=1\\n    i+=1\\n\\nprint(ans)\", \"#normalize\\n#slope\\n#set and count\\n\\nn,x,y=list(map(int,input().split()))\\n'''s_x=[]\\ns_y=[]'''\\nshots = set()\\nfor _ in range(n):\\n    '''s_x[i],s_y[i] = map(int,input().split())\\n    s_x[i] -= x\\n    s_y[i] -= y'''\\n\\n    a,b = list(map(int,input().split()))\\n    a -= x\\n    b -= y\\n    shots.add('INF' if a == 0 else b/a)\\nprint(len(shots))\\n\\n\\n\\n\\n\", \"inStr=input()\\nn=int(inStr.split()[0])\\nx0=int(inStr.split()[1])\\ny0=int(inStr.split()[2])\\n\\ns=set()\\ninf=10e18\\nfor i in range(n):\\n    inStr=input()\\n    x=int(inStr.split()[0])\\n    y=int(inStr.split()[1])\\n    #k and b will be in a denominator form, (k,b) is the line equation\\n    if (x==x0):\\n        #k=(y-y0, 0)\\n        k=inf\\n        b=x0\\n    else:\\n        k = ((y-y0), (x-x0))\\n        k= k[0]/k[1]\\n        b = y0 - k*x0\\n        #b = (y, k[0], k[1])\\n    s.add((k, b))\\n\\n#print(s)\\nprint(len(s))\", \"n,x,y=input().split(' ')\\ntroops=[]\\nfor i in range(int(n)):\\n    a,b=input().split(' ')\\n    troops.append([int(a)-int(x),int(b)-int(y)])\\ns=set()\\nfor troop in troops:\\n    if troop[0]!=0:\\n        s.add(troop[1]/troop[0])\\n    else:\\n        s.add(1000000)\\nprint(len(s))\", \"n, x0, y0 = map(int, input().split())\\nk = [[None]*2 for i in range(n)]\\nfor i in range(n):\\n    k[i][0], k[i][1] = map(int, input().split())\\n    \\ns = 0\\nused = [0]*n\\n\\nfor i in range(n):\\n    f = 0\\n    x = k[i][0]\\n    y = k[i][1]\\n    koef1 = y0-y\\n    koef2 = x-x0\\n    koef3 = x0*y-x*y0\\n    \\n    if not used[i]:\\n        f = 1\\n        used[i] = 1\\n        \\n    for j in range(n):\\n        if not used[j]:\\n            if koef1*k[j][0] + koef2*k[j][1] + koef3 == 0:\\n                used[j] = 1\\n                \\n    s += f\\n                \\nprint(s)\", \"def solo_mid(n, x0, y0, sturms=[]):\\n    if n == 0:\\n        return 0\\n    \\n    res = {}\\n    for i in range(n):\\n        for_shot = sturms[:]\\n        first_sturm = for_shot[0]\\n        sturms.remove(first_sturm)\\n        line_x = y0 - first_sturm[1]\\n        line_y = -(x0 - first_sturm[0])\\n        line_c = -first_sturm[0] * line_x + first_sturm[1] * (-line_y)\\n        res[first_sturm] = 1\\n        for xi, yi in for_shot[1:]:\\n            is_in_line = line_x * xi + line_y * yi + line_c\\n            if is_in_line == 0:\\n                res[first_sturm] += 1\\n                sturms.remove((xi, yi))\\n\\n        if not sturms:\\n            break\\n\\n    return len(res)\\ntry:\\n    first = input()\\n    if len(first.split()) != 3:\\n        print(0)\\n    else:\\n        in_f = [int(i) for i in first.split()]\\n        n = in_f[0]\\n        sturms = []\\n        for i in range(n):\\n            s = input()\\n            if len(s.split()) != 2:\\n                print(0)\\n                break\\n            else:\\n                try: s_l = tuple([int(i) for i in s.split()])\\n                except: break\\n                sturms.append(s_l)\\n        else:\\n            print(solo_mid(n, in_f[1], in_f[2], sturms))\\nexcept:\\n    print(0)\\n\\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.00001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"n, x0, y0 = (int(x) for x in input().split())\\nguys = []\\nfor i in range(n):\\n    x, y = (int(cur) for  cur in input().split())\\n    guys.append((x - x0, y - y0))\\n\\nanswer = 0\\n\\nwhile guys:\\n    cur_x, cur_y = guys[0]\\n    k = 0\\n    to_remove = []\\n    for i in range(len(guys)):\\n        x, y = guys[i]\\n        if x * cur_y == y * cur_x:\\n            to_remove.append(i - k)\\n            k += 1\\n    for index in to_remove:\\n        del guys[index]\\n    answer += 1\\n\\nprint(answer)\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    s.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(s))\\n\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nk=0\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    if b-y!=0:\\n        s.add((x-a)/(y-b))\\n    else:\\n        k=1\\nprint(len(s)+k)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 1 2\n1 1\n1 0\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/514/B"
    },
    {
        "id": 851,
        "task_id": 1535,
        "test_case_id": 6,
        "question": "There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x_0, y_0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x_0, y_0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\n\n-----Input-----\n\nThe first line contains three integers n, x_0 и y_0 (1 ≤ n ≤ 1000,  - 10^4 ≤ x_0, y_0 ≤ 10^4) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each x_{i}, y_{i} ( - 10^4 ≤ x_{i}, y_{i} ≤ 10^4) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\n\n-----Output-----\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\n\n-----Examples-----\nInput\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\nOutput\n2\n\nInput\n2 1 2\n1 1\n1 0\n\nOutput\n1\n\n\n\n-----Note-----\n\nExplanation to the first and second samples from the statement, respectively:  [Image]",
        "solutions": "[\"\\\"\\\"\\\"\\nCodeforces Contest 291 Div 2 Problem B\\n\\nAuthor  : chaotic_iak\\nLanguage: Python 3.4.2\\n\\\"\\\"\\\"\\n\\n################################################### SOLUTION\\n\\ndef gcd(a,b):\\n    if a < 0: a = -a\\n    if b < 0: b = -b\\n    if a == 0: return b\\n    if b == 0: return a\\n    return gcd(b, a%b)\\n\\ndef main():\\n    n, x0, y0 = read()\\n    lines = set()\\n    for i in range(n):\\n        x, y = read()\\n        x -= x0\\n        y -= y0\\n        if x < 0 or (x == 0 and y < 0): x,y = -x,-y\\n        g = gcd(x,y)\\n        x //= g\\n        y //= g\\n        lines.add((x,y))\\n    return len(lines)\\n\\n\\n\\n#################################################### HELPERS\\n\\n\\n\\ndef read(mode=2):\\n    # 0: String\\n    # 1: List of strings\\n    # 2: List of integers\\n    inputs = input().strip()\\n    if mode == 0: return inputs\\n    if mode == 1: return inputs.split()\\n    if mode == 2: return list(map(int, inputs.split()))\\n\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\n\\nwrite(main())\", \"from fractions import gcd\\nn,x,y = list(map(int,input().split()))\\nL={}\\nfor i in range(n):\\n    a,b = list(map(int,input().split()))\\n    dy = y-b\\n    dx = x-a\\n    if(dx<0):\\n        dy = -dy\\n        dx = -dx\\n    g = gcd(dy,dx)\\n    dy//=g\\n    dx//=g\\n    L[(dy,dx)]=1\\nprint(len(L))\\n\", \"def isequal(a, b):\\n    return abs(a-b) <= 0.00000001\\na, b, c = list(map(int, input().split(' ')))\\nslopes = []\\nfor i in range(a):\\n    x, y = list(map(int, input().split(' ')))\\n    if x == b:\\n        slopes.append(90001)\\n    else:\\n        slopes.append((y-c)/(x-b))\\nprint(len(set(slopes)))\\n\", \"n,x,y = list(map(int, input().split()))\\nS = set()\\nfor i in range(n) :\\n    a, b = list(map(int, input().split()))\\n    S.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(S))\\n\", \"n,x0,y0 = list(map(int,input().split()))\\ntr = []\\nfor i in range(n):\\n\\ttr.append(list(map(int,input().split())))\\n\\na = []\\nans = 0\\nfor i in range(n):\\n\\tif tr[i][1]-y0 == 0:\\n\\t\\tang = \\\"inf\\\"\\n\\telse:\\n\\t\\tang = (tr[i][0]-x0)/(tr[i][1]-y0)\\n\\tif not ang in a:\\n\\t\\ta.append(ang)\\n\\t\\tans += 1\\n\\nprint(ans)\\n\\n\", \"def prin_pram(x,y):\\n    nonlocal A\\n    nonlocal B\\n    nonlocal C\\n    if A*x + B*y+C==0:\\n        return 1\\n    else:\\n        return 0\\nn, x0, y0 = list(map(int, input().split()))\\nxyi = [list(map(int, input().split())) for i in range(n)]\\nnumber = 0\\ni = 0\\nA = 0\\nB = 0\\nC = 0\\nz = 0 \\nwhile number < n:\\n    i = 0\\n    A = xyi[0][1] - y0\\n    B = x0 - xyi[0][0]\\n    C = x0 * (y0 - xyi[0][1]) + y0 * (xyi[0][0] - x0)\\n    for j in range(n - number):\\n        temp = prin_pram(xyi[j][0],xyi[j][1])\\n        if temp == 1:\\n            number += 1\\n        else:\\n            xyi[i][0] = xyi[j][0]\\n            xyi[i][1] = xyi[j][1]\\n            i += 1\\n    z += 1\\nprint(z)\\n\", \"n, x, y = map(int, input().split())\\nA = [list(map(int, input().split())) for i in range(n)]\\nS = set()\\nB = []\\nfor elem in A:\\n    i = 0\\n    while i < len(B) and B[i][0] * elem[0] + B[i][1] * elem[1] + B[i][2] != 0:\\n        i += 1\\n    if i == len(B):\\n        a = elem[1] - y\\n        b = x - elem[0]\\n        c = -(a * x + b * y)\\n        B.append((a, b, c))\\nprint(len(B))\", \"import sys\\nf = sys.stdin\\n\\nn, x0, y0 = map(int, f.readline().strip().split())\\n\\nxy = []\\nfor i in range(n):\\n    xy.append( list(map(int, f.readline().strip().split())) )\\n\\nused = [0]*n\\nv = 0\\nfor i in range(n):\\n    if used[i]==0:\\n        v += 1\\n        used[i] = 1\\n        kx = x0 - xy[i][0]\\n        ky = y0 - xy[i][1]\\n        if kx<0:\\n            kx *= -1\\n            ky *= -1\\n        if kx==0 and ky<0:\\n            ky *= -1\\n        for j in range(i,n):\\n            if used[j]==0:    \\n                kxj = x0 - xy[j][0]\\n                kyj = y0 - xy[j][1]                \\n                if kxj<0:\\n                    kxj *= -1\\n                    kyj *= -1\\n                if kxj==0 and kyj<0:\\n                    kyj *= -1\\n                if kx*kyj==ky*kxj:\\n                    used[j] = 1\\nprint(v)\", \"def coeff(x1, y1, x2, y2):\\n    a = y2 - y1;\\n    b = x1 - x2;\\n    c = -a * x1 - b * y1; \\n    return (a, b, c)\\n    \\ndef PointOnLine(x, y, a, b, c):\\n    if a * x + b * y + c == 0:\\n        return True\\n    else:\\n        return False\\n\\nn, x0, y0 = map(int, input().split())\\ns = set()\\nx = []\\ny = []\\nans = 0\\nfor i in range(n):\\n    a, b = map(int, input().split())\\n    x.append(a)\\n    y.append(b)\\nfor i in range(n):\\n    if (x[i], y[i]) not in s:\\n        a, b, c = coeff(x0, y0, x[i], y[i])\\n        for i in range(n):\\n            if PointOnLine(x[i], y[i], a, b, c):\\n                s.add((x[i], y[i]))\\n        ans += 1\\nprint(ans)\", \"def ans():\\n    n, x0, y0= [int(i) for i in input().split()]\\n    ans= []\\n    for i in range(n):\\n        x, y= [int(i) for i in input().split()]\\n        if x== x0:\\n            ans.append(\\\"s\\\")\\n        else:\\n            ans.append(float(y-y0)/float(x-x0))\\n        \\n    print(len(set(ans)))\\n    \\n    return\\nans()\", \"import math\\nn, x0, y0 = list(map(int, input().split()))\\nslope = []\\nfor i in range(n):\\n    x1, y1 = list(map(int, input().split()))\\n    if x1==x0:\\n        slp = 999\\n    else:\\n        slp = (y1-y0)/(x1-x0)\\n    slope.append(slp)\\nslope.sort()\\ncount = 1\\npoint = slope[0]\\nfor i in range(1,len(slope)):\\n    if slope[i] == point:\\n        continue\\n    else:\\n        count += 1\\n        point = slope[i]\\nprint (count)\\n    \\n\\n    \\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.0000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"from math import *\\nn, x0, y0 = list(map(int, input().split()))\\na = []\\nfor i in range(n):\\n    x, y = list(map(int, input().split()))\\n    a.append([x, y])\\ncnt = 0\\nfor i in range(n):\\n    if a[i] == -1:\\n        continue\\n    A = a[i][1] - y0\\n    B = x0 - a[i][0]\\n    C = -x0 * A + y0 * (a[i][0] - x0)\\n    for j in range(n):\\n        if a[j] == -1:\\n            continue\\n        if A * a[j][0] + B * a[j][1] + C == 0:\\n            a[j] = -1\\n    cnt += 1\\nprint(cnt)\\n\", \"\\ndef main():\\n\\tn, x0, y0 = map(int, input().split())\\n\\tc = set()\\n\\tfor i in range(n):\\n\\t\\tx, y = map(int, input().split())\\n\\t\\tif x - x0 == 0:\\n\\t\\t\\tc.add('inf')\\n\\t\\telse:\\n\\t\\t\\tc.add((y-y0)/(x-x0))\\n\\tprint(len(c))\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"n, x0, y0 = map(int, input().split())\\n\\nps = [list(map(int, input().split())) for i in range(n)]\\n\\nshut = [False for i in range(n)]\\n\\nans=i=0\\n\\nfor x,y in ps:\\n    if not shut[i]:\\n        ans+=1\\n        j=0\\n        for x2, y2 in ps:\\n            if (x-x0)*(y2-y0) == (x2-x0)*(y-y0):\\n                shut[j]=True\\n            j+=1\\n    i+=1\\n\\nprint(ans)\", \"#normalize\\n#slope\\n#set and count\\n\\nn,x,y=list(map(int,input().split()))\\n'''s_x=[]\\ns_y=[]'''\\nshots = set()\\nfor _ in range(n):\\n    '''s_x[i],s_y[i] = map(int,input().split())\\n    s_x[i] -= x\\n    s_y[i] -= y'''\\n\\n    a,b = list(map(int,input().split()))\\n    a -= x\\n    b -= y\\n    shots.add('INF' if a == 0 else b/a)\\nprint(len(shots))\\n\\n\\n\\n\\n\", \"inStr=input()\\nn=int(inStr.split()[0])\\nx0=int(inStr.split()[1])\\ny0=int(inStr.split()[2])\\n\\ns=set()\\ninf=10e18\\nfor i in range(n):\\n    inStr=input()\\n    x=int(inStr.split()[0])\\n    y=int(inStr.split()[1])\\n    #k and b will be in a denominator form, (k,b) is the line equation\\n    if (x==x0):\\n        #k=(y-y0, 0)\\n        k=inf\\n        b=x0\\n    else:\\n        k = ((y-y0), (x-x0))\\n        k= k[0]/k[1]\\n        b = y0 - k*x0\\n        #b = (y, k[0], k[1])\\n    s.add((k, b))\\n\\n#print(s)\\nprint(len(s))\", \"n,x,y=input().split(' ')\\ntroops=[]\\nfor i in range(int(n)):\\n    a,b=input().split(' ')\\n    troops.append([int(a)-int(x),int(b)-int(y)])\\ns=set()\\nfor troop in troops:\\n    if troop[0]!=0:\\n        s.add(troop[1]/troop[0])\\n    else:\\n        s.add(1000000)\\nprint(len(s))\", \"n, x0, y0 = map(int, input().split())\\nk = [[None]*2 for i in range(n)]\\nfor i in range(n):\\n    k[i][0], k[i][1] = map(int, input().split())\\n    \\ns = 0\\nused = [0]*n\\n\\nfor i in range(n):\\n    f = 0\\n    x = k[i][0]\\n    y = k[i][1]\\n    koef1 = y0-y\\n    koef2 = x-x0\\n    koef3 = x0*y-x*y0\\n    \\n    if not used[i]:\\n        f = 1\\n        used[i] = 1\\n        \\n    for j in range(n):\\n        if not used[j]:\\n            if koef1*k[j][0] + koef2*k[j][1] + koef3 == 0:\\n                used[j] = 1\\n                \\n    s += f\\n                \\nprint(s)\", \"def solo_mid(n, x0, y0, sturms=[]):\\n    if n == 0:\\n        return 0\\n    \\n    res = {}\\n    for i in range(n):\\n        for_shot = sturms[:]\\n        first_sturm = for_shot[0]\\n        sturms.remove(first_sturm)\\n        line_x = y0 - first_sturm[1]\\n        line_y = -(x0 - first_sturm[0])\\n        line_c = -first_sturm[0] * line_x + first_sturm[1] * (-line_y)\\n        res[first_sturm] = 1\\n        for xi, yi in for_shot[1:]:\\n            is_in_line = line_x * xi + line_y * yi + line_c\\n            if is_in_line == 0:\\n                res[first_sturm] += 1\\n                sturms.remove((xi, yi))\\n\\n        if not sturms:\\n            break\\n\\n    return len(res)\\ntry:\\n    first = input()\\n    if len(first.split()) != 3:\\n        print(0)\\n    else:\\n        in_f = [int(i) for i in first.split()]\\n        n = in_f[0]\\n        sturms = []\\n        for i in range(n):\\n            s = input()\\n            if len(s.split()) != 2:\\n                print(0)\\n                break\\n            else:\\n                try: s_l = tuple([int(i) for i in s.split()])\\n                except: break\\n                sturms.append(s_l)\\n        else:\\n            print(solo_mid(n, in_f[1], in_f[2], sturms))\\nexcept:\\n    print(0)\\n\\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.00001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"n, x0, y0 = (int(x) for x in input().split())\\nguys = []\\nfor i in range(n):\\n    x, y = (int(cur) for  cur in input().split())\\n    guys.append((x - x0, y - y0))\\n\\nanswer = 0\\n\\nwhile guys:\\n    cur_x, cur_y = guys[0]\\n    k = 0\\n    to_remove = []\\n    for i in range(len(guys)):\\n        x, y = guys[i]\\n        if x * cur_y == y * cur_x:\\n            to_remove.append(i - k)\\n            k += 1\\n    for index in to_remove:\\n        del guys[index]\\n    answer += 1\\n\\nprint(answer)\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    s.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(s))\\n\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nk=0\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    if b-y!=0:\\n        s.add((x-a)/(y-b))\\n    else:\\n        k=1\\nprint(len(s)+k)\\n\\n\"]",
        "difficulty": "interview",
        "input": "10 -4 -4\n2 -4\n2 0\n-4 2\n5 -4\n-3 -5\n1 4\n-4 2\n-3 5\n0 -3\n2 4\n",
        "output": "8\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/514/B"
    },
    {
        "id": 852,
        "task_id": 1535,
        "test_case_id": 11,
        "question": "There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x_0, y_0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x_0, y_0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\n\n-----Input-----\n\nThe first line contains three integers n, x_0 и y_0 (1 ≤ n ≤ 1000,  - 10^4 ≤ x_0, y_0 ≤ 10^4) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each x_{i}, y_{i} ( - 10^4 ≤ x_{i}, y_{i} ≤ 10^4) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\n\n-----Output-----\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\n\n-----Examples-----\nInput\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\nOutput\n2\n\nInput\n2 1 2\n1 1\n1 0\n\nOutput\n1\n\n\n\n-----Note-----\n\nExplanation to the first and second samples from the statement, respectively:  [Image]",
        "solutions": "[\"\\\"\\\"\\\"\\nCodeforces Contest 291 Div 2 Problem B\\n\\nAuthor  : chaotic_iak\\nLanguage: Python 3.4.2\\n\\\"\\\"\\\"\\n\\n################################################### SOLUTION\\n\\ndef gcd(a,b):\\n    if a < 0: a = -a\\n    if b < 0: b = -b\\n    if a == 0: return b\\n    if b == 0: return a\\n    return gcd(b, a%b)\\n\\ndef main():\\n    n, x0, y0 = read()\\n    lines = set()\\n    for i in range(n):\\n        x, y = read()\\n        x -= x0\\n        y -= y0\\n        if x < 0 or (x == 0 and y < 0): x,y = -x,-y\\n        g = gcd(x,y)\\n        x //= g\\n        y //= g\\n        lines.add((x,y))\\n    return len(lines)\\n\\n\\n\\n#################################################### HELPERS\\n\\n\\n\\ndef read(mode=2):\\n    # 0: String\\n    # 1: List of strings\\n    # 2: List of integers\\n    inputs = input().strip()\\n    if mode == 0: return inputs\\n    if mode == 1: return inputs.split()\\n    if mode == 2: return list(map(int, inputs.split()))\\n\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\n\\nwrite(main())\", \"from fractions import gcd\\nn,x,y = list(map(int,input().split()))\\nL={}\\nfor i in range(n):\\n    a,b = list(map(int,input().split()))\\n    dy = y-b\\n    dx = x-a\\n    if(dx<0):\\n        dy = -dy\\n        dx = -dx\\n    g = gcd(dy,dx)\\n    dy//=g\\n    dx//=g\\n    L[(dy,dx)]=1\\nprint(len(L))\\n\", \"def isequal(a, b):\\n    return abs(a-b) <= 0.00000001\\na, b, c = list(map(int, input().split(' ')))\\nslopes = []\\nfor i in range(a):\\n    x, y = list(map(int, input().split(' ')))\\n    if x == b:\\n        slopes.append(90001)\\n    else:\\n        slopes.append((y-c)/(x-b))\\nprint(len(set(slopes)))\\n\", \"n,x,y = list(map(int, input().split()))\\nS = set()\\nfor i in range(n) :\\n    a, b = list(map(int, input().split()))\\n    S.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(S))\\n\", \"n,x0,y0 = list(map(int,input().split()))\\ntr = []\\nfor i in range(n):\\n\\ttr.append(list(map(int,input().split())))\\n\\na = []\\nans = 0\\nfor i in range(n):\\n\\tif tr[i][1]-y0 == 0:\\n\\t\\tang = \\\"inf\\\"\\n\\telse:\\n\\t\\tang = (tr[i][0]-x0)/(tr[i][1]-y0)\\n\\tif not ang in a:\\n\\t\\ta.append(ang)\\n\\t\\tans += 1\\n\\nprint(ans)\\n\\n\", \"def prin_pram(x,y):\\n    nonlocal A\\n    nonlocal B\\n    nonlocal C\\n    if A*x + B*y+C==0:\\n        return 1\\n    else:\\n        return 0\\nn, x0, y0 = list(map(int, input().split()))\\nxyi = [list(map(int, input().split())) for i in range(n)]\\nnumber = 0\\ni = 0\\nA = 0\\nB = 0\\nC = 0\\nz = 0 \\nwhile number < n:\\n    i = 0\\n    A = xyi[0][1] - y0\\n    B = x0 - xyi[0][0]\\n    C = x0 * (y0 - xyi[0][1]) + y0 * (xyi[0][0] - x0)\\n    for j in range(n - number):\\n        temp = prin_pram(xyi[j][0],xyi[j][1])\\n        if temp == 1:\\n            number += 1\\n        else:\\n            xyi[i][0] = xyi[j][0]\\n            xyi[i][1] = xyi[j][1]\\n            i += 1\\n    z += 1\\nprint(z)\\n\", \"n, x, y = map(int, input().split())\\nA = [list(map(int, input().split())) for i in range(n)]\\nS = set()\\nB = []\\nfor elem in A:\\n    i = 0\\n    while i < len(B) and B[i][0] * elem[0] + B[i][1] * elem[1] + B[i][2] != 0:\\n        i += 1\\n    if i == len(B):\\n        a = elem[1] - y\\n        b = x - elem[0]\\n        c = -(a * x + b * y)\\n        B.append((a, b, c))\\nprint(len(B))\", \"import sys\\nf = sys.stdin\\n\\nn, x0, y0 = map(int, f.readline().strip().split())\\n\\nxy = []\\nfor i in range(n):\\n    xy.append( list(map(int, f.readline().strip().split())) )\\n\\nused = [0]*n\\nv = 0\\nfor i in range(n):\\n    if used[i]==0:\\n        v += 1\\n        used[i] = 1\\n        kx = x0 - xy[i][0]\\n        ky = y0 - xy[i][1]\\n        if kx<0:\\n            kx *= -1\\n            ky *= -1\\n        if kx==0 and ky<0:\\n            ky *= -1\\n        for j in range(i,n):\\n            if used[j]==0:    \\n                kxj = x0 - xy[j][0]\\n                kyj = y0 - xy[j][1]                \\n                if kxj<0:\\n                    kxj *= -1\\n                    kyj *= -1\\n                if kxj==0 and kyj<0:\\n                    kyj *= -1\\n                if kx*kyj==ky*kxj:\\n                    used[j] = 1\\nprint(v)\", \"def coeff(x1, y1, x2, y2):\\n    a = y2 - y1;\\n    b = x1 - x2;\\n    c = -a * x1 - b * y1; \\n    return (a, b, c)\\n    \\ndef PointOnLine(x, y, a, b, c):\\n    if a * x + b * y + c == 0:\\n        return True\\n    else:\\n        return False\\n\\nn, x0, y0 = map(int, input().split())\\ns = set()\\nx = []\\ny = []\\nans = 0\\nfor i in range(n):\\n    a, b = map(int, input().split())\\n    x.append(a)\\n    y.append(b)\\nfor i in range(n):\\n    if (x[i], y[i]) not in s:\\n        a, b, c = coeff(x0, y0, x[i], y[i])\\n        for i in range(n):\\n            if PointOnLine(x[i], y[i], a, b, c):\\n                s.add((x[i], y[i]))\\n        ans += 1\\nprint(ans)\", \"def ans():\\n    n, x0, y0= [int(i) for i in input().split()]\\n    ans= []\\n    for i in range(n):\\n        x, y= [int(i) for i in input().split()]\\n        if x== x0:\\n            ans.append(\\\"s\\\")\\n        else:\\n            ans.append(float(y-y0)/float(x-x0))\\n        \\n    print(len(set(ans)))\\n    \\n    return\\nans()\", \"import math\\nn, x0, y0 = list(map(int, input().split()))\\nslope = []\\nfor i in range(n):\\n    x1, y1 = list(map(int, input().split()))\\n    if x1==x0:\\n        slp = 999\\n    else:\\n        slp = (y1-y0)/(x1-x0)\\n    slope.append(slp)\\nslope.sort()\\ncount = 1\\npoint = slope[0]\\nfor i in range(1,len(slope)):\\n    if slope[i] == point:\\n        continue\\n    else:\\n        count += 1\\n        point = slope[i]\\nprint (count)\\n    \\n\\n    \\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.0000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"from math import *\\nn, x0, y0 = list(map(int, input().split()))\\na = []\\nfor i in range(n):\\n    x, y = list(map(int, input().split()))\\n    a.append([x, y])\\ncnt = 0\\nfor i in range(n):\\n    if a[i] == -1:\\n        continue\\n    A = a[i][1] - y0\\n    B = x0 - a[i][0]\\n    C = -x0 * A + y0 * (a[i][0] - x0)\\n    for j in range(n):\\n        if a[j] == -1:\\n            continue\\n        if A * a[j][0] + B * a[j][1] + C == 0:\\n            a[j] = -1\\n    cnt += 1\\nprint(cnt)\\n\", \"\\ndef main():\\n\\tn, x0, y0 = map(int, input().split())\\n\\tc = set()\\n\\tfor i in range(n):\\n\\t\\tx, y = map(int, input().split())\\n\\t\\tif x - x0 == 0:\\n\\t\\t\\tc.add('inf')\\n\\t\\telse:\\n\\t\\t\\tc.add((y-y0)/(x-x0))\\n\\tprint(len(c))\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"n, x0, y0 = map(int, input().split())\\n\\nps = [list(map(int, input().split())) for i in range(n)]\\n\\nshut = [False for i in range(n)]\\n\\nans=i=0\\n\\nfor x,y in ps:\\n    if not shut[i]:\\n        ans+=1\\n        j=0\\n        for x2, y2 in ps:\\n            if (x-x0)*(y2-y0) == (x2-x0)*(y-y0):\\n                shut[j]=True\\n            j+=1\\n    i+=1\\n\\nprint(ans)\", \"#normalize\\n#slope\\n#set and count\\n\\nn,x,y=list(map(int,input().split()))\\n'''s_x=[]\\ns_y=[]'''\\nshots = set()\\nfor _ in range(n):\\n    '''s_x[i],s_y[i] = map(int,input().split())\\n    s_x[i] -= x\\n    s_y[i] -= y'''\\n\\n    a,b = list(map(int,input().split()))\\n    a -= x\\n    b -= y\\n    shots.add('INF' if a == 0 else b/a)\\nprint(len(shots))\\n\\n\\n\\n\\n\", \"inStr=input()\\nn=int(inStr.split()[0])\\nx0=int(inStr.split()[1])\\ny0=int(inStr.split()[2])\\n\\ns=set()\\ninf=10e18\\nfor i in range(n):\\n    inStr=input()\\n    x=int(inStr.split()[0])\\n    y=int(inStr.split()[1])\\n    #k and b will be in a denominator form, (k,b) is the line equation\\n    if (x==x0):\\n        #k=(y-y0, 0)\\n        k=inf\\n        b=x0\\n    else:\\n        k = ((y-y0), (x-x0))\\n        k= k[0]/k[1]\\n        b = y0 - k*x0\\n        #b = (y, k[0], k[1])\\n    s.add((k, b))\\n\\n#print(s)\\nprint(len(s))\", \"n,x,y=input().split(' ')\\ntroops=[]\\nfor i in range(int(n)):\\n    a,b=input().split(' ')\\n    troops.append([int(a)-int(x),int(b)-int(y)])\\ns=set()\\nfor troop in troops:\\n    if troop[0]!=0:\\n        s.add(troop[1]/troop[0])\\n    else:\\n        s.add(1000000)\\nprint(len(s))\", \"n, x0, y0 = map(int, input().split())\\nk = [[None]*2 for i in range(n)]\\nfor i in range(n):\\n    k[i][0], k[i][1] = map(int, input().split())\\n    \\ns = 0\\nused = [0]*n\\n\\nfor i in range(n):\\n    f = 0\\n    x = k[i][0]\\n    y = k[i][1]\\n    koef1 = y0-y\\n    koef2 = x-x0\\n    koef3 = x0*y-x*y0\\n    \\n    if not used[i]:\\n        f = 1\\n        used[i] = 1\\n        \\n    for j in range(n):\\n        if not used[j]:\\n            if koef1*k[j][0] + koef2*k[j][1] + koef3 == 0:\\n                used[j] = 1\\n                \\n    s += f\\n                \\nprint(s)\", \"def solo_mid(n, x0, y0, sturms=[]):\\n    if n == 0:\\n        return 0\\n    \\n    res = {}\\n    for i in range(n):\\n        for_shot = sturms[:]\\n        first_sturm = for_shot[0]\\n        sturms.remove(first_sturm)\\n        line_x = y0 - first_sturm[1]\\n        line_y = -(x0 - first_sturm[0])\\n        line_c = -first_sturm[0] * line_x + first_sturm[1] * (-line_y)\\n        res[first_sturm] = 1\\n        for xi, yi in for_shot[1:]:\\n            is_in_line = line_x * xi + line_y * yi + line_c\\n            if is_in_line == 0:\\n                res[first_sturm] += 1\\n                sturms.remove((xi, yi))\\n\\n        if not sturms:\\n            break\\n\\n    return len(res)\\ntry:\\n    first = input()\\n    if len(first.split()) != 3:\\n        print(0)\\n    else:\\n        in_f = [int(i) for i in first.split()]\\n        n = in_f[0]\\n        sturms = []\\n        for i in range(n):\\n            s = input()\\n            if len(s.split()) != 2:\\n                print(0)\\n                break\\n            else:\\n                try: s_l = tuple([int(i) for i in s.split()])\\n                except: break\\n                sturms.append(s_l)\\n        else:\\n            print(solo_mid(n, in_f[1], in_f[2], sturms))\\nexcept:\\n    print(0)\\n\\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.00001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"n, x0, y0 = (int(x) for x in input().split())\\nguys = []\\nfor i in range(n):\\n    x, y = (int(cur) for  cur in input().split())\\n    guys.append((x - x0, y - y0))\\n\\nanswer = 0\\n\\nwhile guys:\\n    cur_x, cur_y = guys[0]\\n    k = 0\\n    to_remove = []\\n    for i in range(len(guys)):\\n        x, y = guys[i]\\n        if x * cur_y == y * cur_x:\\n            to_remove.append(i - k)\\n            k += 1\\n    for index in to_remove:\\n        del guys[index]\\n    answer += 1\\n\\nprint(answer)\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    s.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(s))\\n\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nk=0\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    if b-y!=0:\\n        s.add((x-a)/(y-b))\\n    else:\\n        k=1\\nprint(len(s)+k)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 0 0\n0 1337\n3 9000\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/514/B"
    },
    {
        "id": 853,
        "task_id": 1535,
        "test_case_id": 12,
        "question": "There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x_0, y_0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x_0, y_0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\n\n-----Input-----\n\nThe first line contains three integers n, x_0 и y_0 (1 ≤ n ≤ 1000,  - 10^4 ≤ x_0, y_0 ≤ 10^4) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each x_{i}, y_{i} ( - 10^4 ≤ x_{i}, y_{i} ≤ 10^4) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\n\n-----Output-----\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\n\n-----Examples-----\nInput\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\nOutput\n2\n\nInput\n2 1 2\n1 1\n1 0\n\nOutput\n1\n\n\n\n-----Note-----\n\nExplanation to the first and second samples from the statement, respectively:  [Image]",
        "solutions": "[\"\\\"\\\"\\\"\\nCodeforces Contest 291 Div 2 Problem B\\n\\nAuthor  : chaotic_iak\\nLanguage: Python 3.4.2\\n\\\"\\\"\\\"\\n\\n################################################### SOLUTION\\n\\ndef gcd(a,b):\\n    if a < 0: a = -a\\n    if b < 0: b = -b\\n    if a == 0: return b\\n    if b == 0: return a\\n    return gcd(b, a%b)\\n\\ndef main():\\n    n, x0, y0 = read()\\n    lines = set()\\n    for i in range(n):\\n        x, y = read()\\n        x -= x0\\n        y -= y0\\n        if x < 0 or (x == 0 and y < 0): x,y = -x,-y\\n        g = gcd(x,y)\\n        x //= g\\n        y //= g\\n        lines.add((x,y))\\n    return len(lines)\\n\\n\\n\\n#################################################### HELPERS\\n\\n\\n\\ndef read(mode=2):\\n    # 0: String\\n    # 1: List of strings\\n    # 2: List of integers\\n    inputs = input().strip()\\n    if mode == 0: return inputs\\n    if mode == 1: return inputs.split()\\n    if mode == 2: return list(map(int, inputs.split()))\\n\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\n\\nwrite(main())\", \"from fractions import gcd\\nn,x,y = list(map(int,input().split()))\\nL={}\\nfor i in range(n):\\n    a,b = list(map(int,input().split()))\\n    dy = y-b\\n    dx = x-a\\n    if(dx<0):\\n        dy = -dy\\n        dx = -dx\\n    g = gcd(dy,dx)\\n    dy//=g\\n    dx//=g\\n    L[(dy,dx)]=1\\nprint(len(L))\\n\", \"def isequal(a, b):\\n    return abs(a-b) <= 0.00000001\\na, b, c = list(map(int, input().split(' ')))\\nslopes = []\\nfor i in range(a):\\n    x, y = list(map(int, input().split(' ')))\\n    if x == b:\\n        slopes.append(90001)\\n    else:\\n        slopes.append((y-c)/(x-b))\\nprint(len(set(slopes)))\\n\", \"n,x,y = list(map(int, input().split()))\\nS = set()\\nfor i in range(n) :\\n    a, b = list(map(int, input().split()))\\n    S.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(S))\\n\", \"n,x0,y0 = list(map(int,input().split()))\\ntr = []\\nfor i in range(n):\\n\\ttr.append(list(map(int,input().split())))\\n\\na = []\\nans = 0\\nfor i in range(n):\\n\\tif tr[i][1]-y0 == 0:\\n\\t\\tang = \\\"inf\\\"\\n\\telse:\\n\\t\\tang = (tr[i][0]-x0)/(tr[i][1]-y0)\\n\\tif not ang in a:\\n\\t\\ta.append(ang)\\n\\t\\tans += 1\\n\\nprint(ans)\\n\\n\", \"def prin_pram(x,y):\\n    nonlocal A\\n    nonlocal B\\n    nonlocal C\\n    if A*x + B*y+C==0:\\n        return 1\\n    else:\\n        return 0\\nn, x0, y0 = list(map(int, input().split()))\\nxyi = [list(map(int, input().split())) for i in range(n)]\\nnumber = 0\\ni = 0\\nA = 0\\nB = 0\\nC = 0\\nz = 0 \\nwhile number < n:\\n    i = 0\\n    A = xyi[0][1] - y0\\n    B = x0 - xyi[0][0]\\n    C = x0 * (y0 - xyi[0][1]) + y0 * (xyi[0][0] - x0)\\n    for j in range(n - number):\\n        temp = prin_pram(xyi[j][0],xyi[j][1])\\n        if temp == 1:\\n            number += 1\\n        else:\\n            xyi[i][0] = xyi[j][0]\\n            xyi[i][1] = xyi[j][1]\\n            i += 1\\n    z += 1\\nprint(z)\\n\", \"n, x, y = map(int, input().split())\\nA = [list(map(int, input().split())) for i in range(n)]\\nS = set()\\nB = []\\nfor elem in A:\\n    i = 0\\n    while i < len(B) and B[i][0] * elem[0] + B[i][1] * elem[1] + B[i][2] != 0:\\n        i += 1\\n    if i == len(B):\\n        a = elem[1] - y\\n        b = x - elem[0]\\n        c = -(a * x + b * y)\\n        B.append((a, b, c))\\nprint(len(B))\", \"import sys\\nf = sys.stdin\\n\\nn, x0, y0 = map(int, f.readline().strip().split())\\n\\nxy = []\\nfor i in range(n):\\n    xy.append( list(map(int, f.readline().strip().split())) )\\n\\nused = [0]*n\\nv = 0\\nfor i in range(n):\\n    if used[i]==0:\\n        v += 1\\n        used[i] = 1\\n        kx = x0 - xy[i][0]\\n        ky = y0 - xy[i][1]\\n        if kx<0:\\n            kx *= -1\\n            ky *= -1\\n        if kx==0 and ky<0:\\n            ky *= -1\\n        for j in range(i,n):\\n            if used[j]==0:    \\n                kxj = x0 - xy[j][0]\\n                kyj = y0 - xy[j][1]                \\n                if kxj<0:\\n                    kxj *= -1\\n                    kyj *= -1\\n                if kxj==0 and kyj<0:\\n                    kyj *= -1\\n                if kx*kyj==ky*kxj:\\n                    used[j] = 1\\nprint(v)\", \"def coeff(x1, y1, x2, y2):\\n    a = y2 - y1;\\n    b = x1 - x2;\\n    c = -a * x1 - b * y1; \\n    return (a, b, c)\\n    \\ndef PointOnLine(x, y, a, b, c):\\n    if a * x + b * y + c == 0:\\n        return True\\n    else:\\n        return False\\n\\nn, x0, y0 = map(int, input().split())\\ns = set()\\nx = []\\ny = []\\nans = 0\\nfor i in range(n):\\n    a, b = map(int, input().split())\\n    x.append(a)\\n    y.append(b)\\nfor i in range(n):\\n    if (x[i], y[i]) not in s:\\n        a, b, c = coeff(x0, y0, x[i], y[i])\\n        for i in range(n):\\n            if PointOnLine(x[i], y[i], a, b, c):\\n                s.add((x[i], y[i]))\\n        ans += 1\\nprint(ans)\", \"def ans():\\n    n, x0, y0= [int(i) for i in input().split()]\\n    ans= []\\n    for i in range(n):\\n        x, y= [int(i) for i in input().split()]\\n        if x== x0:\\n            ans.append(\\\"s\\\")\\n        else:\\n            ans.append(float(y-y0)/float(x-x0))\\n        \\n    print(len(set(ans)))\\n    \\n    return\\nans()\", \"import math\\nn, x0, y0 = list(map(int, input().split()))\\nslope = []\\nfor i in range(n):\\n    x1, y1 = list(map(int, input().split()))\\n    if x1==x0:\\n        slp = 999\\n    else:\\n        slp = (y1-y0)/(x1-x0)\\n    slope.append(slp)\\nslope.sort()\\ncount = 1\\npoint = slope[0]\\nfor i in range(1,len(slope)):\\n    if slope[i] == point:\\n        continue\\n    else:\\n        count += 1\\n        point = slope[i]\\nprint (count)\\n    \\n\\n    \\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.0000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"from math import *\\nn, x0, y0 = list(map(int, input().split()))\\na = []\\nfor i in range(n):\\n    x, y = list(map(int, input().split()))\\n    a.append([x, y])\\ncnt = 0\\nfor i in range(n):\\n    if a[i] == -1:\\n        continue\\n    A = a[i][1] - y0\\n    B = x0 - a[i][0]\\n    C = -x0 * A + y0 * (a[i][0] - x0)\\n    for j in range(n):\\n        if a[j] == -1:\\n            continue\\n        if A * a[j][0] + B * a[j][1] + C == 0:\\n            a[j] = -1\\n    cnt += 1\\nprint(cnt)\\n\", \"\\ndef main():\\n\\tn, x0, y0 = map(int, input().split())\\n\\tc = set()\\n\\tfor i in range(n):\\n\\t\\tx, y = map(int, input().split())\\n\\t\\tif x - x0 == 0:\\n\\t\\t\\tc.add('inf')\\n\\t\\telse:\\n\\t\\t\\tc.add((y-y0)/(x-x0))\\n\\tprint(len(c))\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"n, x0, y0 = map(int, input().split())\\n\\nps = [list(map(int, input().split())) for i in range(n)]\\n\\nshut = [False for i in range(n)]\\n\\nans=i=0\\n\\nfor x,y in ps:\\n    if not shut[i]:\\n        ans+=1\\n        j=0\\n        for x2, y2 in ps:\\n            if (x-x0)*(y2-y0) == (x2-x0)*(y-y0):\\n                shut[j]=True\\n            j+=1\\n    i+=1\\n\\nprint(ans)\", \"#normalize\\n#slope\\n#set and count\\n\\nn,x,y=list(map(int,input().split()))\\n'''s_x=[]\\ns_y=[]'''\\nshots = set()\\nfor _ in range(n):\\n    '''s_x[i],s_y[i] = map(int,input().split())\\n    s_x[i] -= x\\n    s_y[i] -= y'''\\n\\n    a,b = list(map(int,input().split()))\\n    a -= x\\n    b -= y\\n    shots.add('INF' if a == 0 else b/a)\\nprint(len(shots))\\n\\n\\n\\n\\n\", \"inStr=input()\\nn=int(inStr.split()[0])\\nx0=int(inStr.split()[1])\\ny0=int(inStr.split()[2])\\n\\ns=set()\\ninf=10e18\\nfor i in range(n):\\n    inStr=input()\\n    x=int(inStr.split()[0])\\n    y=int(inStr.split()[1])\\n    #k and b will be in a denominator form, (k,b) is the line equation\\n    if (x==x0):\\n        #k=(y-y0, 0)\\n        k=inf\\n        b=x0\\n    else:\\n        k = ((y-y0), (x-x0))\\n        k= k[0]/k[1]\\n        b = y0 - k*x0\\n        #b = (y, k[0], k[1])\\n    s.add((k, b))\\n\\n#print(s)\\nprint(len(s))\", \"n,x,y=input().split(' ')\\ntroops=[]\\nfor i in range(int(n)):\\n    a,b=input().split(' ')\\n    troops.append([int(a)-int(x),int(b)-int(y)])\\ns=set()\\nfor troop in troops:\\n    if troop[0]!=0:\\n        s.add(troop[1]/troop[0])\\n    else:\\n        s.add(1000000)\\nprint(len(s))\", \"n, x0, y0 = map(int, input().split())\\nk = [[None]*2 for i in range(n)]\\nfor i in range(n):\\n    k[i][0], k[i][1] = map(int, input().split())\\n    \\ns = 0\\nused = [0]*n\\n\\nfor i in range(n):\\n    f = 0\\n    x = k[i][0]\\n    y = k[i][1]\\n    koef1 = y0-y\\n    koef2 = x-x0\\n    koef3 = x0*y-x*y0\\n    \\n    if not used[i]:\\n        f = 1\\n        used[i] = 1\\n        \\n    for j in range(n):\\n        if not used[j]:\\n            if koef1*k[j][0] + koef2*k[j][1] + koef3 == 0:\\n                used[j] = 1\\n                \\n    s += f\\n                \\nprint(s)\", \"def solo_mid(n, x0, y0, sturms=[]):\\n    if n == 0:\\n        return 0\\n    \\n    res = {}\\n    for i in range(n):\\n        for_shot = sturms[:]\\n        first_sturm = for_shot[0]\\n        sturms.remove(first_sturm)\\n        line_x = y0 - first_sturm[1]\\n        line_y = -(x0 - first_sturm[0])\\n        line_c = -first_sturm[0] * line_x + first_sturm[1] * (-line_y)\\n        res[first_sturm] = 1\\n        for xi, yi in for_shot[1:]:\\n            is_in_line = line_x * xi + line_y * yi + line_c\\n            if is_in_line == 0:\\n                res[first_sturm] += 1\\n                sturms.remove((xi, yi))\\n\\n        if not sturms:\\n            break\\n\\n    return len(res)\\ntry:\\n    first = input()\\n    if len(first.split()) != 3:\\n        print(0)\\n    else:\\n        in_f = [int(i) for i in first.split()]\\n        n = in_f[0]\\n        sturms = []\\n        for i in range(n):\\n            s = input()\\n            if len(s.split()) != 2:\\n                print(0)\\n                break\\n            else:\\n                try: s_l = tuple([int(i) for i in s.split()])\\n                except: break\\n                sturms.append(s_l)\\n        else:\\n            print(solo_mid(n, in_f[1], in_f[2], sturms))\\nexcept:\\n    print(0)\\n\\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.00001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"n, x0, y0 = (int(x) for x in input().split())\\nguys = []\\nfor i in range(n):\\n    x, y = (int(cur) for  cur in input().split())\\n    guys.append((x - x0, y - y0))\\n\\nanswer = 0\\n\\nwhile guys:\\n    cur_x, cur_y = guys[0]\\n    k = 0\\n    to_remove = []\\n    for i in range(len(guys)):\\n        x, y = guys[i]\\n        if x * cur_y == y * cur_x:\\n            to_remove.append(i - k)\\n            k += 1\\n    for index in to_remove:\\n        del guys[index]\\n    answer += 1\\n\\nprint(answer)\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    s.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(s))\\n\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nk=0\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    if b-y!=0:\\n        s.add((x-a)/(y-b))\\n    else:\\n        k=1\\nprint(len(s)+k)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 0 -1\n0 1\n1 10000\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/514/B"
    },
    {
        "id": 854,
        "task_id": 1535,
        "test_case_id": 13,
        "question": "There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x_0, y_0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x_0, y_0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\n\n-----Input-----\n\nThe first line contains three integers n, x_0 и y_0 (1 ≤ n ≤ 1000,  - 10^4 ≤ x_0, y_0 ≤ 10^4) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each x_{i}, y_{i} ( - 10^4 ≤ x_{i}, y_{i} ≤ 10^4) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\n\n-----Output-----\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\n\n-----Examples-----\nInput\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\nOutput\n2\n\nInput\n2 1 2\n1 1\n1 0\n\nOutput\n1\n\n\n\n-----Note-----\n\nExplanation to the first and second samples from the statement, respectively:  [Image]",
        "solutions": "[\"\\\"\\\"\\\"\\nCodeforces Contest 291 Div 2 Problem B\\n\\nAuthor  : chaotic_iak\\nLanguage: Python 3.4.2\\n\\\"\\\"\\\"\\n\\n################################################### SOLUTION\\n\\ndef gcd(a,b):\\n    if a < 0: a = -a\\n    if b < 0: b = -b\\n    if a == 0: return b\\n    if b == 0: return a\\n    return gcd(b, a%b)\\n\\ndef main():\\n    n, x0, y0 = read()\\n    lines = set()\\n    for i in range(n):\\n        x, y = read()\\n        x -= x0\\n        y -= y0\\n        if x < 0 or (x == 0 and y < 0): x,y = -x,-y\\n        g = gcd(x,y)\\n        x //= g\\n        y //= g\\n        lines.add((x,y))\\n    return len(lines)\\n\\n\\n\\n#################################################### HELPERS\\n\\n\\n\\ndef read(mode=2):\\n    # 0: String\\n    # 1: List of strings\\n    # 2: List of integers\\n    inputs = input().strip()\\n    if mode == 0: return inputs\\n    if mode == 1: return inputs.split()\\n    if mode == 2: return list(map(int, inputs.split()))\\n\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\n\\nwrite(main())\", \"from fractions import gcd\\nn,x,y = list(map(int,input().split()))\\nL={}\\nfor i in range(n):\\n    a,b = list(map(int,input().split()))\\n    dy = y-b\\n    dx = x-a\\n    if(dx<0):\\n        dy = -dy\\n        dx = -dx\\n    g = gcd(dy,dx)\\n    dy//=g\\n    dx//=g\\n    L[(dy,dx)]=1\\nprint(len(L))\\n\", \"def isequal(a, b):\\n    return abs(a-b) <= 0.00000001\\na, b, c = list(map(int, input().split(' ')))\\nslopes = []\\nfor i in range(a):\\n    x, y = list(map(int, input().split(' ')))\\n    if x == b:\\n        slopes.append(90001)\\n    else:\\n        slopes.append((y-c)/(x-b))\\nprint(len(set(slopes)))\\n\", \"n,x,y = list(map(int, input().split()))\\nS = set()\\nfor i in range(n) :\\n    a, b = list(map(int, input().split()))\\n    S.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(S))\\n\", \"n,x0,y0 = list(map(int,input().split()))\\ntr = []\\nfor i in range(n):\\n\\ttr.append(list(map(int,input().split())))\\n\\na = []\\nans = 0\\nfor i in range(n):\\n\\tif tr[i][1]-y0 == 0:\\n\\t\\tang = \\\"inf\\\"\\n\\telse:\\n\\t\\tang = (tr[i][0]-x0)/(tr[i][1]-y0)\\n\\tif not ang in a:\\n\\t\\ta.append(ang)\\n\\t\\tans += 1\\n\\nprint(ans)\\n\\n\", \"def prin_pram(x,y):\\n    nonlocal A\\n    nonlocal B\\n    nonlocal C\\n    if A*x + B*y+C==0:\\n        return 1\\n    else:\\n        return 0\\nn, x0, y0 = list(map(int, input().split()))\\nxyi = [list(map(int, input().split())) for i in range(n)]\\nnumber = 0\\ni = 0\\nA = 0\\nB = 0\\nC = 0\\nz = 0 \\nwhile number < n:\\n    i = 0\\n    A = xyi[0][1] - y0\\n    B = x0 - xyi[0][0]\\n    C = x0 * (y0 - xyi[0][1]) + y0 * (xyi[0][0] - x0)\\n    for j in range(n - number):\\n        temp = prin_pram(xyi[j][0],xyi[j][1])\\n        if temp == 1:\\n            number += 1\\n        else:\\n            xyi[i][0] = xyi[j][0]\\n            xyi[i][1] = xyi[j][1]\\n            i += 1\\n    z += 1\\nprint(z)\\n\", \"n, x, y = map(int, input().split())\\nA = [list(map(int, input().split())) for i in range(n)]\\nS = set()\\nB = []\\nfor elem in A:\\n    i = 0\\n    while i < len(B) and B[i][0] * elem[0] + B[i][1] * elem[1] + B[i][2] != 0:\\n        i += 1\\n    if i == len(B):\\n        a = elem[1] - y\\n        b = x - elem[0]\\n        c = -(a * x + b * y)\\n        B.append((a, b, c))\\nprint(len(B))\", \"import sys\\nf = sys.stdin\\n\\nn, x0, y0 = map(int, f.readline().strip().split())\\n\\nxy = []\\nfor i in range(n):\\n    xy.append( list(map(int, f.readline().strip().split())) )\\n\\nused = [0]*n\\nv = 0\\nfor i in range(n):\\n    if used[i]==0:\\n        v += 1\\n        used[i] = 1\\n        kx = x0 - xy[i][0]\\n        ky = y0 - xy[i][1]\\n        if kx<0:\\n            kx *= -1\\n            ky *= -1\\n        if kx==0 and ky<0:\\n            ky *= -1\\n        for j in range(i,n):\\n            if used[j]==0:    \\n                kxj = x0 - xy[j][0]\\n                kyj = y0 - xy[j][1]                \\n                if kxj<0:\\n                    kxj *= -1\\n                    kyj *= -1\\n                if kxj==0 and kyj<0:\\n                    kyj *= -1\\n                if kx*kyj==ky*kxj:\\n                    used[j] = 1\\nprint(v)\", \"def coeff(x1, y1, x2, y2):\\n    a = y2 - y1;\\n    b = x1 - x2;\\n    c = -a * x1 - b * y1; \\n    return (a, b, c)\\n    \\ndef PointOnLine(x, y, a, b, c):\\n    if a * x + b * y + c == 0:\\n        return True\\n    else:\\n        return False\\n\\nn, x0, y0 = map(int, input().split())\\ns = set()\\nx = []\\ny = []\\nans = 0\\nfor i in range(n):\\n    a, b = map(int, input().split())\\n    x.append(a)\\n    y.append(b)\\nfor i in range(n):\\n    if (x[i], y[i]) not in s:\\n        a, b, c = coeff(x0, y0, x[i], y[i])\\n        for i in range(n):\\n            if PointOnLine(x[i], y[i], a, b, c):\\n                s.add((x[i], y[i]))\\n        ans += 1\\nprint(ans)\", \"def ans():\\n    n, x0, y0= [int(i) for i in input().split()]\\n    ans= []\\n    for i in range(n):\\n        x, y= [int(i) for i in input().split()]\\n        if x== x0:\\n            ans.append(\\\"s\\\")\\n        else:\\n            ans.append(float(y-y0)/float(x-x0))\\n        \\n    print(len(set(ans)))\\n    \\n    return\\nans()\", \"import math\\nn, x0, y0 = list(map(int, input().split()))\\nslope = []\\nfor i in range(n):\\n    x1, y1 = list(map(int, input().split()))\\n    if x1==x0:\\n        slp = 999\\n    else:\\n        slp = (y1-y0)/(x1-x0)\\n    slope.append(slp)\\nslope.sort()\\ncount = 1\\npoint = slope[0]\\nfor i in range(1,len(slope)):\\n    if slope[i] == point:\\n        continue\\n    else:\\n        count += 1\\n        point = slope[i]\\nprint (count)\\n    \\n\\n    \\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.0000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"from math import *\\nn, x0, y0 = list(map(int, input().split()))\\na = []\\nfor i in range(n):\\n    x, y = list(map(int, input().split()))\\n    a.append([x, y])\\ncnt = 0\\nfor i in range(n):\\n    if a[i] == -1:\\n        continue\\n    A = a[i][1] - y0\\n    B = x0 - a[i][0]\\n    C = -x0 * A + y0 * (a[i][0] - x0)\\n    for j in range(n):\\n        if a[j] == -1:\\n            continue\\n        if A * a[j][0] + B * a[j][1] + C == 0:\\n            a[j] = -1\\n    cnt += 1\\nprint(cnt)\\n\", \"\\ndef main():\\n\\tn, x0, y0 = map(int, input().split())\\n\\tc = set()\\n\\tfor i in range(n):\\n\\t\\tx, y = map(int, input().split())\\n\\t\\tif x - x0 == 0:\\n\\t\\t\\tc.add('inf')\\n\\t\\telse:\\n\\t\\t\\tc.add((y-y0)/(x-x0))\\n\\tprint(len(c))\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"n, x0, y0 = map(int, input().split())\\n\\nps = [list(map(int, input().split())) for i in range(n)]\\n\\nshut = [False for i in range(n)]\\n\\nans=i=0\\n\\nfor x,y in ps:\\n    if not shut[i]:\\n        ans+=1\\n        j=0\\n        for x2, y2 in ps:\\n            if (x-x0)*(y2-y0) == (x2-x0)*(y-y0):\\n                shut[j]=True\\n            j+=1\\n    i+=1\\n\\nprint(ans)\", \"#normalize\\n#slope\\n#set and count\\n\\nn,x,y=list(map(int,input().split()))\\n'''s_x=[]\\ns_y=[]'''\\nshots = set()\\nfor _ in range(n):\\n    '''s_x[i],s_y[i] = map(int,input().split())\\n    s_x[i] -= x\\n    s_y[i] -= y'''\\n\\n    a,b = list(map(int,input().split()))\\n    a -= x\\n    b -= y\\n    shots.add('INF' if a == 0 else b/a)\\nprint(len(shots))\\n\\n\\n\\n\\n\", \"inStr=input()\\nn=int(inStr.split()[0])\\nx0=int(inStr.split()[1])\\ny0=int(inStr.split()[2])\\n\\ns=set()\\ninf=10e18\\nfor i in range(n):\\n    inStr=input()\\n    x=int(inStr.split()[0])\\n    y=int(inStr.split()[1])\\n    #k and b will be in a denominator form, (k,b) is the line equation\\n    if (x==x0):\\n        #k=(y-y0, 0)\\n        k=inf\\n        b=x0\\n    else:\\n        k = ((y-y0), (x-x0))\\n        k= k[0]/k[1]\\n        b = y0 - k*x0\\n        #b = (y, k[0], k[1])\\n    s.add((k, b))\\n\\n#print(s)\\nprint(len(s))\", \"n,x,y=input().split(' ')\\ntroops=[]\\nfor i in range(int(n)):\\n    a,b=input().split(' ')\\n    troops.append([int(a)-int(x),int(b)-int(y)])\\ns=set()\\nfor troop in troops:\\n    if troop[0]!=0:\\n        s.add(troop[1]/troop[0])\\n    else:\\n        s.add(1000000)\\nprint(len(s))\", \"n, x0, y0 = map(int, input().split())\\nk = [[None]*2 for i in range(n)]\\nfor i in range(n):\\n    k[i][0], k[i][1] = map(int, input().split())\\n    \\ns = 0\\nused = [0]*n\\n\\nfor i in range(n):\\n    f = 0\\n    x = k[i][0]\\n    y = k[i][1]\\n    koef1 = y0-y\\n    koef2 = x-x0\\n    koef3 = x0*y-x*y0\\n    \\n    if not used[i]:\\n        f = 1\\n        used[i] = 1\\n        \\n    for j in range(n):\\n        if not used[j]:\\n            if koef1*k[j][0] + koef2*k[j][1] + koef3 == 0:\\n                used[j] = 1\\n                \\n    s += f\\n                \\nprint(s)\", \"def solo_mid(n, x0, y0, sturms=[]):\\n    if n == 0:\\n        return 0\\n    \\n    res = {}\\n    for i in range(n):\\n        for_shot = sturms[:]\\n        first_sturm = for_shot[0]\\n        sturms.remove(first_sturm)\\n        line_x = y0 - first_sturm[1]\\n        line_y = -(x0 - first_sturm[0])\\n        line_c = -first_sturm[0] * line_x + first_sturm[1] * (-line_y)\\n        res[first_sturm] = 1\\n        for xi, yi in for_shot[1:]:\\n            is_in_line = line_x * xi + line_y * yi + line_c\\n            if is_in_line == 0:\\n                res[first_sturm] += 1\\n                sturms.remove((xi, yi))\\n\\n        if not sturms:\\n            break\\n\\n    return len(res)\\ntry:\\n    first = input()\\n    if len(first.split()) != 3:\\n        print(0)\\n    else:\\n        in_f = [int(i) for i in first.split()]\\n        n = in_f[0]\\n        sturms = []\\n        for i in range(n):\\n            s = input()\\n            if len(s.split()) != 2:\\n                print(0)\\n                break\\n            else:\\n                try: s_l = tuple([int(i) for i in s.split()])\\n                except: break\\n                sturms.append(s_l)\\n        else:\\n            print(solo_mid(n, in_f[1], in_f[2], sturms))\\nexcept:\\n    print(0)\\n\\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.00001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"n, x0, y0 = (int(x) for x in input().split())\\nguys = []\\nfor i in range(n):\\n    x, y = (int(cur) for  cur in input().split())\\n    guys.append((x - x0, y - y0))\\n\\nanswer = 0\\n\\nwhile guys:\\n    cur_x, cur_y = guys[0]\\n    k = 0\\n    to_remove = []\\n    for i in range(len(guys)):\\n        x, y = guys[i]\\n        if x * cur_y == y * cur_x:\\n            to_remove.append(i - k)\\n            k += 1\\n    for index in to_remove:\\n        del guys[index]\\n    answer += 1\\n\\nprint(answer)\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    s.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(s))\\n\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nk=0\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    if b-y!=0:\\n        s.add((x-a)/(y-b))\\n    else:\\n        k=1\\nprint(len(s)+k)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 0 0\n0 10\n1 2000\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/514/B"
    },
    {
        "id": 855,
        "task_id": 1535,
        "test_case_id": 14,
        "question": "There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x_0, y_0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x_0, y_0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\n\n-----Input-----\n\nThe first line contains three integers n, x_0 и y_0 (1 ≤ n ≤ 1000,  - 10^4 ≤ x_0, y_0 ≤ 10^4) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each x_{i}, y_{i} ( - 10^4 ≤ x_{i}, y_{i} ≤ 10^4) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\n\n-----Output-----\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\n\n-----Examples-----\nInput\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\nOutput\n2\n\nInput\n2 1 2\n1 1\n1 0\n\nOutput\n1\n\n\n\n-----Note-----\n\nExplanation to the first and second samples from the statement, respectively:  [Image]",
        "solutions": "[\"\\\"\\\"\\\"\\nCodeforces Contest 291 Div 2 Problem B\\n\\nAuthor  : chaotic_iak\\nLanguage: Python 3.4.2\\n\\\"\\\"\\\"\\n\\n################################################### SOLUTION\\n\\ndef gcd(a,b):\\n    if a < 0: a = -a\\n    if b < 0: b = -b\\n    if a == 0: return b\\n    if b == 0: return a\\n    return gcd(b, a%b)\\n\\ndef main():\\n    n, x0, y0 = read()\\n    lines = set()\\n    for i in range(n):\\n        x, y = read()\\n        x -= x0\\n        y -= y0\\n        if x < 0 or (x == 0 and y < 0): x,y = -x,-y\\n        g = gcd(x,y)\\n        x //= g\\n        y //= g\\n        lines.add((x,y))\\n    return len(lines)\\n\\n\\n\\n#################################################### HELPERS\\n\\n\\n\\ndef read(mode=2):\\n    # 0: String\\n    # 1: List of strings\\n    # 2: List of integers\\n    inputs = input().strip()\\n    if mode == 0: return inputs\\n    if mode == 1: return inputs.split()\\n    if mode == 2: return list(map(int, inputs.split()))\\n\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\n\\nwrite(main())\", \"from fractions import gcd\\nn,x,y = list(map(int,input().split()))\\nL={}\\nfor i in range(n):\\n    a,b = list(map(int,input().split()))\\n    dy = y-b\\n    dx = x-a\\n    if(dx<0):\\n        dy = -dy\\n        dx = -dx\\n    g = gcd(dy,dx)\\n    dy//=g\\n    dx//=g\\n    L[(dy,dx)]=1\\nprint(len(L))\\n\", \"def isequal(a, b):\\n    return abs(a-b) <= 0.00000001\\na, b, c = list(map(int, input().split(' ')))\\nslopes = []\\nfor i in range(a):\\n    x, y = list(map(int, input().split(' ')))\\n    if x == b:\\n        slopes.append(90001)\\n    else:\\n        slopes.append((y-c)/(x-b))\\nprint(len(set(slopes)))\\n\", \"n,x,y = list(map(int, input().split()))\\nS = set()\\nfor i in range(n) :\\n    a, b = list(map(int, input().split()))\\n    S.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(S))\\n\", \"n,x0,y0 = list(map(int,input().split()))\\ntr = []\\nfor i in range(n):\\n\\ttr.append(list(map(int,input().split())))\\n\\na = []\\nans = 0\\nfor i in range(n):\\n\\tif tr[i][1]-y0 == 0:\\n\\t\\tang = \\\"inf\\\"\\n\\telse:\\n\\t\\tang = (tr[i][0]-x0)/(tr[i][1]-y0)\\n\\tif not ang in a:\\n\\t\\ta.append(ang)\\n\\t\\tans += 1\\n\\nprint(ans)\\n\\n\", \"def prin_pram(x,y):\\n    nonlocal A\\n    nonlocal B\\n    nonlocal C\\n    if A*x + B*y+C==0:\\n        return 1\\n    else:\\n        return 0\\nn, x0, y0 = list(map(int, input().split()))\\nxyi = [list(map(int, input().split())) for i in range(n)]\\nnumber = 0\\ni = 0\\nA = 0\\nB = 0\\nC = 0\\nz = 0 \\nwhile number < n:\\n    i = 0\\n    A = xyi[0][1] - y0\\n    B = x0 - xyi[0][0]\\n    C = x0 * (y0 - xyi[0][1]) + y0 * (xyi[0][0] - x0)\\n    for j in range(n - number):\\n        temp = prin_pram(xyi[j][0],xyi[j][1])\\n        if temp == 1:\\n            number += 1\\n        else:\\n            xyi[i][0] = xyi[j][0]\\n            xyi[i][1] = xyi[j][1]\\n            i += 1\\n    z += 1\\nprint(z)\\n\", \"n, x, y = map(int, input().split())\\nA = [list(map(int, input().split())) for i in range(n)]\\nS = set()\\nB = []\\nfor elem in A:\\n    i = 0\\n    while i < len(B) and B[i][0] * elem[0] + B[i][1] * elem[1] + B[i][2] != 0:\\n        i += 1\\n    if i == len(B):\\n        a = elem[1] - y\\n        b = x - elem[0]\\n        c = -(a * x + b * y)\\n        B.append((a, b, c))\\nprint(len(B))\", \"import sys\\nf = sys.stdin\\n\\nn, x0, y0 = map(int, f.readline().strip().split())\\n\\nxy = []\\nfor i in range(n):\\n    xy.append( list(map(int, f.readline().strip().split())) )\\n\\nused = [0]*n\\nv = 0\\nfor i in range(n):\\n    if used[i]==0:\\n        v += 1\\n        used[i] = 1\\n        kx = x0 - xy[i][0]\\n        ky = y0 - xy[i][1]\\n        if kx<0:\\n            kx *= -1\\n            ky *= -1\\n        if kx==0 and ky<0:\\n            ky *= -1\\n        for j in range(i,n):\\n            if used[j]==0:    \\n                kxj = x0 - xy[j][0]\\n                kyj = y0 - xy[j][1]                \\n                if kxj<0:\\n                    kxj *= -1\\n                    kyj *= -1\\n                if kxj==0 and kyj<0:\\n                    kyj *= -1\\n                if kx*kyj==ky*kxj:\\n                    used[j] = 1\\nprint(v)\", \"def coeff(x1, y1, x2, y2):\\n    a = y2 - y1;\\n    b = x1 - x2;\\n    c = -a * x1 - b * y1; \\n    return (a, b, c)\\n    \\ndef PointOnLine(x, y, a, b, c):\\n    if a * x + b * y + c == 0:\\n        return True\\n    else:\\n        return False\\n\\nn, x0, y0 = map(int, input().split())\\ns = set()\\nx = []\\ny = []\\nans = 0\\nfor i in range(n):\\n    a, b = map(int, input().split())\\n    x.append(a)\\n    y.append(b)\\nfor i in range(n):\\n    if (x[i], y[i]) not in s:\\n        a, b, c = coeff(x0, y0, x[i], y[i])\\n        for i in range(n):\\n            if PointOnLine(x[i], y[i], a, b, c):\\n                s.add((x[i], y[i]))\\n        ans += 1\\nprint(ans)\", \"def ans():\\n    n, x0, y0= [int(i) for i in input().split()]\\n    ans= []\\n    for i in range(n):\\n        x, y= [int(i) for i in input().split()]\\n        if x== x0:\\n            ans.append(\\\"s\\\")\\n        else:\\n            ans.append(float(y-y0)/float(x-x0))\\n        \\n    print(len(set(ans)))\\n    \\n    return\\nans()\", \"import math\\nn, x0, y0 = list(map(int, input().split()))\\nslope = []\\nfor i in range(n):\\n    x1, y1 = list(map(int, input().split()))\\n    if x1==x0:\\n        slp = 999\\n    else:\\n        slp = (y1-y0)/(x1-x0)\\n    slope.append(slp)\\nslope.sort()\\ncount = 1\\npoint = slope[0]\\nfor i in range(1,len(slope)):\\n    if slope[i] == point:\\n        continue\\n    else:\\n        count += 1\\n        point = slope[i]\\nprint (count)\\n    \\n\\n    \\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.0000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"from math import *\\nn, x0, y0 = list(map(int, input().split()))\\na = []\\nfor i in range(n):\\n    x, y = list(map(int, input().split()))\\n    a.append([x, y])\\ncnt = 0\\nfor i in range(n):\\n    if a[i] == -1:\\n        continue\\n    A = a[i][1] - y0\\n    B = x0 - a[i][0]\\n    C = -x0 * A + y0 * (a[i][0] - x0)\\n    for j in range(n):\\n        if a[j] == -1:\\n            continue\\n        if A * a[j][0] + B * a[j][1] + C == 0:\\n            a[j] = -1\\n    cnt += 1\\nprint(cnt)\\n\", \"\\ndef main():\\n\\tn, x0, y0 = map(int, input().split())\\n\\tc = set()\\n\\tfor i in range(n):\\n\\t\\tx, y = map(int, input().split())\\n\\t\\tif x - x0 == 0:\\n\\t\\t\\tc.add('inf')\\n\\t\\telse:\\n\\t\\t\\tc.add((y-y0)/(x-x0))\\n\\tprint(len(c))\\n\\ndef __starting_point():\\n\\tmain()\\n__starting_point()\", \"n, x0, y0 = map(int, input().split())\\n\\nps = [list(map(int, input().split())) for i in range(n)]\\n\\nshut = [False for i in range(n)]\\n\\nans=i=0\\n\\nfor x,y in ps:\\n    if not shut[i]:\\n        ans+=1\\n        j=0\\n        for x2, y2 in ps:\\n            if (x-x0)*(y2-y0) == (x2-x0)*(y-y0):\\n                shut[j]=True\\n            j+=1\\n    i+=1\\n\\nprint(ans)\", \"#normalize\\n#slope\\n#set and count\\n\\nn,x,y=list(map(int,input().split()))\\n'''s_x=[]\\ns_y=[]'''\\nshots = set()\\nfor _ in range(n):\\n    '''s_x[i],s_y[i] = map(int,input().split())\\n    s_x[i] -= x\\n    s_y[i] -= y'''\\n\\n    a,b = list(map(int,input().split()))\\n    a -= x\\n    b -= y\\n    shots.add('INF' if a == 0 else b/a)\\nprint(len(shots))\\n\\n\\n\\n\\n\", \"inStr=input()\\nn=int(inStr.split()[0])\\nx0=int(inStr.split()[1])\\ny0=int(inStr.split()[2])\\n\\ns=set()\\ninf=10e18\\nfor i in range(n):\\n    inStr=input()\\n    x=int(inStr.split()[0])\\n    y=int(inStr.split()[1])\\n    #k and b will be in a denominator form, (k,b) is the line equation\\n    if (x==x0):\\n        #k=(y-y0, 0)\\n        k=inf\\n        b=x0\\n    else:\\n        k = ((y-y0), (x-x0))\\n        k= k[0]/k[1]\\n        b = y0 - k*x0\\n        #b = (y, k[0], k[1])\\n    s.add((k, b))\\n\\n#print(s)\\nprint(len(s))\", \"n,x,y=input().split(' ')\\ntroops=[]\\nfor i in range(int(n)):\\n    a,b=input().split(' ')\\n    troops.append([int(a)-int(x),int(b)-int(y)])\\ns=set()\\nfor troop in troops:\\n    if troop[0]!=0:\\n        s.add(troop[1]/troop[0])\\n    else:\\n        s.add(1000000)\\nprint(len(s))\", \"n, x0, y0 = map(int, input().split())\\nk = [[None]*2 for i in range(n)]\\nfor i in range(n):\\n    k[i][0], k[i][1] = map(int, input().split())\\n    \\ns = 0\\nused = [0]*n\\n\\nfor i in range(n):\\n    f = 0\\n    x = k[i][0]\\n    y = k[i][1]\\n    koef1 = y0-y\\n    koef2 = x-x0\\n    koef3 = x0*y-x*y0\\n    \\n    if not used[i]:\\n        f = 1\\n        used[i] = 1\\n        \\n    for j in range(n):\\n        if not used[j]:\\n            if koef1*k[j][0] + koef2*k[j][1] + koef3 == 0:\\n                used[j] = 1\\n                \\n    s += f\\n                \\nprint(s)\", \"def solo_mid(n, x0, y0, sturms=[]):\\n    if n == 0:\\n        return 0\\n    \\n    res = {}\\n    for i in range(n):\\n        for_shot = sturms[:]\\n        first_sturm = for_shot[0]\\n        sturms.remove(first_sturm)\\n        line_x = y0 - first_sturm[1]\\n        line_y = -(x0 - first_sturm[0])\\n        line_c = -first_sturm[0] * line_x + first_sturm[1] * (-line_y)\\n        res[first_sturm] = 1\\n        for xi, yi in for_shot[1:]:\\n            is_in_line = line_x * xi + line_y * yi + line_c\\n            if is_in_line == 0:\\n                res[first_sturm] += 1\\n                sturms.remove((xi, yi))\\n\\n        if not sturms:\\n            break\\n\\n    return len(res)\\ntry:\\n    first = input()\\n    if len(first.split()) != 3:\\n        print(0)\\n    else:\\n        in_f = [int(i) for i in first.split()]\\n        n = in_f[0]\\n        sturms = []\\n        for i in range(n):\\n            s = input()\\n            if len(s.split()) != 2:\\n                print(0)\\n                break\\n            else:\\n                try: s_l = tuple([int(i) for i in s.split()])\\n                except: break\\n                sturms.append(s_l)\\n        else:\\n            print(solo_mid(n, in_f[1], in_f[2], sturms))\\nexcept:\\n    print(0)\\n\\n\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.000001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"import sys\\n\\ndef solve():\\n    n, x0, y0 = read()\\n    stormtroopers = list()\\n    for i in range(n):\\n        xi, yi = read()\\n        temp = (xi, yi)\\n        stormtroopers.append(temp)\\n    shots = 0\\n    while len(stormtroopers) > 0:\\n        cur = stormtroopers.pop()\\n        shots+=1\\n        if cur[0] - x0 == 0:\\n            remstormtroopers = [point for point in stormtroopers if point[0] != x0]\\n        else:\\n            slope = (cur[1]-y0)/(cur[0]-x0)\\n            remstormtroopers = [point for point in stormtroopers if abs(point[1] - y0 - slope*(point[0]- x0)) > 0.00001]\\n        stormtroopers = remstormtroopers\\n    return shots\\n    \\ndef read(mode=2):\\n    inputs = input().strip()\\n    if mode == 0: return inputs  # String\\n    if mode == 1: return inputs.split()  # List of strings\\n    if mode == 2: return list(map(int, inputs.split()))  # List of integers\\ndef write(s=\\\"\\\\n\\\"):\\n    if s is None: s = \\\"\\\"\\n    if isinstance(s, list): s = \\\" \\\".join(map(str, s))\\n    if isinstance(s, tuple): s = \\\" \\\".join(map(str, s))\\n    s = str(s)\\n    print(s, end=\\\"\\\")\\ndef run():\\n    if sys.hexversion == 50594544 : sys.stdin = open(\\\"test.txt\\\")\\n    res = solve()\\n    write(res)\\nrun()\", \"n, x0, y0 = (int(x) for x in input().split())\\nguys = []\\nfor i in range(n):\\n    x, y = (int(cur) for  cur in input().split())\\n    guys.append((x - x0, y - y0))\\n\\nanswer = 0\\n\\nwhile guys:\\n    cur_x, cur_y = guys[0]\\n    k = 0\\n    to_remove = []\\n    for i in range(len(guys)):\\n        x, y = guys[i]\\n        if x * cur_y == y * cur_x:\\n            to_remove.append(i - k)\\n            k += 1\\n    for index in to_remove:\\n        del guys[index]\\n    answer += 1\\n\\nprint(answer)\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    s.add((a-x)/(b-y) if b-y!=0 else float(\\\"INF\\\"))\\nprint(len(s))\\n\\n\", \"n,x,y=list(map(int,input().split()))\\ns=set()\\nk=0\\nfor i in range(n):\\n    a,b=list(map(int,input().split()))\\n    if b-y!=0:\\n        s.add((x-a)/(y-b))\\n    else:\\n        k=1\\nprint(len(s)+k)\\n\\n\"]",
        "difficulty": "interview",
        "input": "2 0 0\n0 2\n1 90\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/514/B"
    },
    {
        "id": 856,
        "task_id": 2137,
        "test_case_id": 1,
        "question": "Ghosts live in harmony and peace, they travel the space without any purpose other than scare whoever stands in their way.\n\nThere are $n$ ghosts in the universe, they move in the $OXY$ plane, each one of them has its own velocity that does not change in time: $\\overrightarrow{V} = V_{x}\\overrightarrow{i} + V_{y}\\overrightarrow{j}$ where $V_{x}$ is its speed on the $x$-axis and $V_{y}$ is on the $y$-axis.\n\nA ghost $i$ has experience value $EX_i$, which represent how many ghosts tried to scare him in his past. Two ghosts scare each other if they were in the same cartesian point at a moment of time.\n\nAs the ghosts move with constant speed, after some moment of time there will be no further scaring (what a relief!) and the experience of ghost kind $GX = \\sum_{i=1}^{n} EX_i$ will never increase.\n\nTameem is a red giant, he took a picture of the cartesian plane at a certain moment of time $T$, and magically all the ghosts were aligned on a line of the form $y = a \\cdot x + b$. You have to compute what will be the experience index of the ghost kind $GX$ in the indefinite future, this is your task for today.\n\nNote that when Tameem took the picture, $GX$ may already be greater than $0$, because many ghosts may have scared one another at any moment between $[-\\infty, T]$.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $a$ and $b$ ($1 \\leq n \\leq 200000$, $1 \\leq |a| \\leq 10^9$, $0 \\le |b| \\le 10^9$) — the number of ghosts in the universe and the parameters of the straight line.\n\nEach of the next $n$ lines contains three integers $x_i$, $V_{xi}$, $V_{yi}$ ($-10^9 \\leq x_i \\leq 10^9$, $-10^9 \\leq V_{x i}, V_{y i} \\leq 10^9$), where $x_i$ is the current $x$-coordinate of the $i$-th ghost (and $y_i = a \\cdot x_i + b$).\n\nIt is guaranteed that no two ghosts share the same initial position, in other words, it is guaranteed that for all $(i,j)$ $x_i \\neq x_j$ for $i \\ne j$.\n\n\n-----Output-----\n\nOutput one line: experience index of the ghost kind $GX$ in the indefinite future.\n\n\n-----Examples-----\nInput\n4 1 1\n1 -1 -1\n2 1 1\n3 1 1\n4 -1 -1\n\nOutput\n8\n\nInput\n3 1 0\n-1 1 0\n0 0 -1\n1 -1 -2\n\nOutput\n6\n\nInput\n3 1 0\n0 0 0\n1 0 0\n2 0 0\n\nOutput\n0\n\n\n\n-----Note-----\n\nThere are four collisions $(1,2,T-0.5)$, $(1,3,T-1)$, $(2,4,T+1)$, $(3,4,T+0.5)$, where $(u,v,t)$ means a collision happened between ghosts $u$ and $v$ at moment $t$. At each collision, each ghost gained one experience point, this means that $GX = 4 \\cdot 2 = 8$.\n\nIn the second test, all points will collide when $t = T + 1$.  [Image] \n\nThe red arrow represents the 1-st ghost velocity, orange represents the 2-nd ghost velocity, and blue represents the 3-rd ghost velocity.",
        "solutions": "[\"n, A, C = list(map(int, input().split()))\\n\\ndef Ro(x, y):\\n    return A * x - y + C\\n \\nhuh = []\\n \\nfor i in range(n):\\n    z, x, y = list(map(int, input().split()))\\n    huh.append((Ro(x + z, z * A + y), x))\\nhuh = sorted(huh)\\nanss = 0\\nc1 = 0\\nc2 = 0\\nprev = (-9999999999999, -999999999999999)\\ng = []\\n\\nhuh.append((-9999999999999, -999999999999999))\\n#print(huh)\\nfor huhh in huh:\\n    if huhh[0] != prev[0]:\\n        g.append(c1)\\n        #print(g)\\n        for j in g:\\n            anss += (c2 - j) * j\\n        g = []\\n        c1 = 1\\n        c2 = 1\\n        prev = (huhh[0], huhh[1])\\n        continue\\n    c2 += 1\\n    if huhh[1] != prev[1]:\\n        g.append(c1)\\n        c1 = 0\\n        prev = (huhh[0], huhh[1])\\n    c1 += 1\\nprint(anss)\\n\", \"#!/usr/bin/env python3\\n\\n[n, a, b] = list(map(int, input().strip().split()))\\nbis = [tuple(map(int, input().strip().split())) for _ in range(n)]\\ndis = [(a * Vx - Vy, Vx) for x, Vx, Vy in bis]\\n\\ndis.sort()\\n\\nres = 0\\ndprev = dis[0][0] - 1\\nvprev = 0\\ndcount = 0\\nvcount = 0\\nfor di, vi in dis:\\n\\tif di != dprev:\\n\\t\\tres += dcount * (dcount - 1)\\n\\t\\tres -= vcount * (vcount - 1)\\n\\t\\tdcount = 1\\n\\t\\tvcount = 1\\n\\t\\tdprev = di\\n\\t\\tvprev = vi\\n\\telse:\\n\\t\\tdcount += 1\\n\\t\\tif vi != vprev:\\n\\t\\t\\tres -= vcount * (vcount - 1)\\n\\t\\t\\tvcount = 1\\n\\t\\t\\tvprev = vi\\n\\t\\telse:\\n\\t\\t\\tvcount += 1\\nres += dcount * (dcount - 1)\\nres -= vcount * (vcount - 1)\\n\\nprint (res)\\n\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n_OUTPUT_BUFFER = io.StringIO()\\nsys.stdout = _OUTPUT_BUFFER\\n\\n@atexit.register\\ndef write():\\n    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n    \\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a*x+b + vy\\n        dd = a*nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx,vy) not in dc[dd]:\\n            dc[dd][(vx,vy)] = 0\\n        dc[dd][(vx,vy)] += 1\\n    \\n    tot = 0\\n    for v,k in list(dc.items()):\\n        tt = 0\\n        pp =0\\n        for _,cc in list(k.items()):\\n            tt -= cc * (cc+1) // 2\\n            pp += cc\\n        tt += pp * (pp+1) // 2\\n        tot += tt*2\\n    print(tot)\\n        \\n\\n    \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n, a, b = map(int, input().split())\\nghosts = [(vx, vy) for x, vx, vy in (map(int, input().split()) for i in range(n))]\\nspeeds = {}\\nfor vx, vy in ghosts:\\n    vl = a * vx - vy\\n    k = vx + a * vy\\n    ss = speeds.setdefault(vl, {})\\n    ss[k] = ss.get(k, 0) + 1\\n\\nresult = 0\\nfor vl, ss in speeds.items():\\n    group_size = sum(ss.values())\\n    for sss in ss.values():\\n        result += sss * (group_size - sss)\\nprint(result)\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n_OUTPUT_BUFFER = io.StringIO()\\nsys.stdout = _OUTPUT_BUFFER\\n\\n\\n@atexit.register\\ndef write():\\n    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a * x + b + vy\\n        dd = a * nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx, vy) not in dc[dd]:\\n            dc[dd][(vx, vy)] = 0\\n        dc[dd][(vx, vy)] += 1\\n\\n    tot = 0\\n    for v, k in dc.items():\\n        tt = 0\\n        pp = 0\\n        for _, cc in k.items():\\n            tt -= cc * (cc + 1) // 2\\n            pp += cc\\n        tt += pp * (pp + 1) // 2\\n        tot += tt * 2\\n    print(tot)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a * x + b + vy\\n        dd = a * nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx, vy) not in dc[dd]:\\n            dc[dd][(vx, vy)] = 0\\n        dc[dd][(vx, vy)] += 1\\n\\n    tot = 0\\n    for v, k in dc.items():\\n        tt = 0\\n        pp = 0\\n        for _, cc in k.items():\\n            tt -= cc * (cc + 1) // 2\\n            pp += cc\\n        tt += pp * (pp + 1) // 2\\n        tot += tt * 2\\n    print(tot)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from sys import stdin\\nrd = lambda: list(map(int, input().split()))\\ng = lambda x, i: x.get(i, 0)\\nn, a, b = rd()\\nc, d = {}, {}\\nr = 0\\nfor z in range(n):\\n    _, x, y = rd()\\n    i, j = a * x - y, (x, y)\\n    r += g(c, i) - g(d, j)\\n    c[i] = g(c, i) + 1\\n    d[j] = g(d, j) + 1\\nprint(2 * r)\\n\", \"\\ndef main():\\n    n, a, b = [int(part) for part in input().split()]\\n    ghosts = []\\n    for i in range(n):\\n        ghosts.append([int(part) for part in input().split()])\\n\\n    cnt = dict()\\n    vcnt = dict()\\n    for (x, vx, vy) in ghosts:\\n        if (vx, vy) in vcnt:\\n            vcnt[(vx, vy)] += 1\\n        else:\\n            vcnt[(vx, vy)] = 1\\n\\n        tmp = vy - a * vx\\n        if tmp in cnt:\\n            cnt[tmp] += 1\\n        else:\\n            cnt[tmp] = 1\\n\\n    ans = 0\\n    for (x, vx, vy) in ghosts:\\n        tmp = vy - a * vx\\n        ans += cnt[tmp] - vcnt[(vx, vy)]\\n\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\nn,a,b=[int(_) for _ in input().split()]\\ns,s1=Counter(),Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=[int(_) for _ in input().split()]\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s1[(vx,vy)]\\n\\ts[tmp]+=1\\n\\ts1[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nn,a,b=map(int,input().split())\\ns,s1=Counter(),Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,input().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s1[(vx,vy)]\\n\\ts[tmp]+=1\\n\\ts1[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nn,a,b=map(int,input().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,input().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import defaultdict\\n\\nn, a, b = map(int, input().split())\\n\\nres = defaultdict(lambda :0)\\nt = defaultdict(lambda :0)\\n\\nans = 0\\n\\nfor _ in range(n):\\n    k, x, y = map(int, input().split())\\n    ans += res[a*x-y] - t[(x,y)]\\n    res[a*x-y]+=1\\n    t[(x,y)]+=1\\n\\nprint(ans*2)\", \"from collections import Counter\\nfrom sys import stdin\\nn,a,b=map(int,stdin.readline().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,stdin.readline().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nfrom sys import stdin\\nn,a,b=map(int,stdin.readline().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,stdin.readline().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"# http://codeforces.com/contest/975/problem/D\\nn, a, b = (int(x) for x in input().split())\\n\\nmarks = 0\\nk = {}\\nv = {}\\nfor i in range(0, n):\\n    x, v1, v2 = [int(x) for x in input().split()]\\n    ki = v2 - a * v1\\n    vi = (v1, v2)\\n\\n    if ki in k:\\n        k[ki] += 1\\n    else:\\n        k[ki] = 1\\n\\n    if vi in v:\\n        v[vi] += 1\\n    else:\\n        v[vi] = 1\\n\\n    marks += k[ki] - v[vi]\\n\\nprint(marks * 2)\", \"import bisect;\\nn, a, b = map(int, input().split(' '));\\nx=[0]*n;\\nvx=[0]*n;\\nvy=[0]*n;\\nfor i in range(n):\\n    x[i], vx[i], vy[i]=map(int, input().split(' '));\\n#y=ax y-ax=0 (x, y)* (-a, 1)=0 (-a, 1) - \\u0432\\u0435\\u043a\\u0442\\u043e\\u0440 \\u043d\\u043e\\u0440\\u043c\\u0430\\u043b\\u0438\\nntypes=dict();\\nfor i in range(n):\\n    ntype=-a*vx[i]+1*vy[i];\\n    currSet=ntypes.get(ntype, set());\\n    currSet.add(i);\\n    ntypes[ntype]=currSet;\\nresult=0;\\nfor key in ntypes.keys():\\n    currSet=ntypes[key];\\n    currLen=len(currSet);\\n    vtypes=dict();\\n    for i in currSet:\\n        vtype=vx[i]*1+vy[i]*a;\\n        vtypes[vtype]=vtypes.get(vtype, 0)+1;\\n    for key in vtypes.keys():\\n        curr=vtypes[key];\\n        result+=curr*(currLen-curr)\\nprint(result);\", \"#!/usr/bin/env python3\\n\\nfrom collections import Counter\\n\\n[n, a, b] = list(map(int, input().strip().split()))\\nbis = [tuple(map(int, input().strip().split())) for _ in range(n)]\\ndis = [(a * Vx - Vy, Vx) for x, Vx, Vy in bis]\\n\\ndis.sort()\\n\\ndef count(d):\\n\\treturn sum((v * k * (k - 1) for k, v in d))\\n\\ndef filt(it):\\n\\treturn list(Counter(list(Counter(it).values())).items())\\n\\nc_plus = count(filt((x for x, y in dis)))\\nc_minus = count(filt(dis))\\n\\nprint(c_plus - c_minus)\\n\", \"import sys\\nimport math\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\n\\nd = {}\\ns = {}\\nn, a, b = list(map(int,sys.stdin.readline().strip().split(' ')))\\nfor n0 in range(n):\\n\\tx,vxi,vyi = list(map(int,sys.stdin.readline().strip().split(' ')))\\n\\tcurr = a*vxi - vyi\\n\\tif curr in d:\\n\\t\\tif (vxi,vyi) in d[curr]:\\n\\t\\t\\td[curr][(vxi,vyi)] += 1\\n\\t\\telse:\\n\\t\\t\\td[curr][(vxi,vyi)] = 1\\n\\t\\ts[curr] += 1\\n\\telse:\\n\\t\\td[curr] = {(vxi,vyi):1}\\n\\t\\ts[curr] = 1\\n\\nans = 0\\nfor k,v in list(d.items()):\\n\\tfor vxy,q in list(v.items()):\\n\\t\\tans += (s[k] - q)*q\\nprint(ans)\\n\\n\\n\\t\\n\", \"3\\n\\nfrom sys import stdin\\nfrom itertools import groupby\\n\\n\\ndef f(line):\\n    t = line.split()\\n    return tuple(int(x) for x in t[1:])\\n\\n\\nn, a, b = [int(x) for x in stdin.readline().split()]\\npoints = sorted(f(line) for line in stdin.readlines()[:n])\\ngroups = [[k, len(tuple(g))] for k, g in groupby(points)]\\ntotal = {}\\nfor (x, y), cnt in groups:\\n    if y - x * a not in total:\\n        total[y - x * a] = 0\\n    total[y - x * a] += cnt\\nans = 0\\nfor (x, y), cnt in groups:\\n    if y - x * a not in total:\\n        continue\\n    ans += cnt * (total[y - x * a] - cnt)\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "4 1 1\n1 -1 -1\n2 1 1\n3 1 1\n4 -1 -1\n",
        "output": "8\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/975/D"
    },
    {
        "id": 857,
        "task_id": 2137,
        "test_case_id": 5,
        "question": "Ghosts live in harmony and peace, they travel the space without any purpose other than scare whoever stands in their way.\n\nThere are $n$ ghosts in the universe, they move in the $OXY$ plane, each one of them has its own velocity that does not change in time: $\\overrightarrow{V} = V_{x}\\overrightarrow{i} + V_{y}\\overrightarrow{j}$ where $V_{x}$ is its speed on the $x$-axis and $V_{y}$ is on the $y$-axis.\n\nA ghost $i$ has experience value $EX_i$, which represent how many ghosts tried to scare him in his past. Two ghosts scare each other if they were in the same cartesian point at a moment of time.\n\nAs the ghosts move with constant speed, after some moment of time there will be no further scaring (what a relief!) and the experience of ghost kind $GX = \\sum_{i=1}^{n} EX_i$ will never increase.\n\nTameem is a red giant, he took a picture of the cartesian plane at a certain moment of time $T$, and magically all the ghosts were aligned on a line of the form $y = a \\cdot x + b$. You have to compute what will be the experience index of the ghost kind $GX$ in the indefinite future, this is your task for today.\n\nNote that when Tameem took the picture, $GX$ may already be greater than $0$, because many ghosts may have scared one another at any moment between $[-\\infty, T]$.\n\n\n-----Input-----\n\nThe first line contains three integers $n$, $a$ and $b$ ($1 \\leq n \\leq 200000$, $1 \\leq |a| \\leq 10^9$, $0 \\le |b| \\le 10^9$) — the number of ghosts in the universe and the parameters of the straight line.\n\nEach of the next $n$ lines contains three integers $x_i$, $V_{xi}$, $V_{yi}$ ($-10^9 \\leq x_i \\leq 10^9$, $-10^9 \\leq V_{x i}, V_{y i} \\leq 10^9$), where $x_i$ is the current $x$-coordinate of the $i$-th ghost (and $y_i = a \\cdot x_i + b$).\n\nIt is guaranteed that no two ghosts share the same initial position, in other words, it is guaranteed that for all $(i,j)$ $x_i \\neq x_j$ for $i \\ne j$.\n\n\n-----Output-----\n\nOutput one line: experience index of the ghost kind $GX$ in the indefinite future.\n\n\n-----Examples-----\nInput\n4 1 1\n1 -1 -1\n2 1 1\n3 1 1\n4 -1 -1\n\nOutput\n8\n\nInput\n3 1 0\n-1 1 0\n0 0 -1\n1 -1 -2\n\nOutput\n6\n\nInput\n3 1 0\n0 0 0\n1 0 0\n2 0 0\n\nOutput\n0\n\n\n\n-----Note-----\n\nThere are four collisions $(1,2,T-0.5)$, $(1,3,T-1)$, $(2,4,T+1)$, $(3,4,T+0.5)$, where $(u,v,t)$ means a collision happened between ghosts $u$ and $v$ at moment $t$. At each collision, each ghost gained one experience point, this means that $GX = 4 \\cdot 2 = 8$.\n\nIn the second test, all points will collide when $t = T + 1$.  [Image] \n\nThe red arrow represents the 1-st ghost velocity, orange represents the 2-nd ghost velocity, and blue represents the 3-rd ghost velocity.",
        "solutions": "[\"n, A, C = list(map(int, input().split()))\\n\\ndef Ro(x, y):\\n    return A * x - y + C\\n \\nhuh = []\\n \\nfor i in range(n):\\n    z, x, y = list(map(int, input().split()))\\n    huh.append((Ro(x + z, z * A + y), x))\\nhuh = sorted(huh)\\nanss = 0\\nc1 = 0\\nc2 = 0\\nprev = (-9999999999999, -999999999999999)\\ng = []\\n\\nhuh.append((-9999999999999, -999999999999999))\\n#print(huh)\\nfor huhh in huh:\\n    if huhh[0] != prev[0]:\\n        g.append(c1)\\n        #print(g)\\n        for j in g:\\n            anss += (c2 - j) * j\\n        g = []\\n        c1 = 1\\n        c2 = 1\\n        prev = (huhh[0], huhh[1])\\n        continue\\n    c2 += 1\\n    if huhh[1] != prev[1]:\\n        g.append(c1)\\n        c1 = 0\\n        prev = (huhh[0], huhh[1])\\n    c1 += 1\\nprint(anss)\\n\", \"#!/usr/bin/env python3\\n\\n[n, a, b] = list(map(int, input().strip().split()))\\nbis = [tuple(map(int, input().strip().split())) for _ in range(n)]\\ndis = [(a * Vx - Vy, Vx) for x, Vx, Vy in bis]\\n\\ndis.sort()\\n\\nres = 0\\ndprev = dis[0][0] - 1\\nvprev = 0\\ndcount = 0\\nvcount = 0\\nfor di, vi in dis:\\n\\tif di != dprev:\\n\\t\\tres += dcount * (dcount - 1)\\n\\t\\tres -= vcount * (vcount - 1)\\n\\t\\tdcount = 1\\n\\t\\tvcount = 1\\n\\t\\tdprev = di\\n\\t\\tvprev = vi\\n\\telse:\\n\\t\\tdcount += 1\\n\\t\\tif vi != vprev:\\n\\t\\t\\tres -= vcount * (vcount - 1)\\n\\t\\t\\tvcount = 1\\n\\t\\t\\tvprev = vi\\n\\t\\telse:\\n\\t\\t\\tvcount += 1\\nres += dcount * (dcount - 1)\\nres -= vcount * (vcount - 1)\\n\\nprint (res)\\n\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n_OUTPUT_BUFFER = io.StringIO()\\nsys.stdout = _OUTPUT_BUFFER\\n\\n@atexit.register\\ndef write():\\n    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n    \\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a*x+b + vy\\n        dd = a*nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx,vy) not in dc[dd]:\\n            dc[dd][(vx,vy)] = 0\\n        dc[dd][(vx,vy)] += 1\\n    \\n    tot = 0\\n    for v,k in list(dc.items()):\\n        tt = 0\\n        pp =0\\n        for _,cc in list(k.items()):\\n            tt -= cc * (cc+1) // 2\\n            pp += cc\\n        tt += pp * (pp+1) // 2\\n        tot += tt*2\\n    print(tot)\\n        \\n\\n    \\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"n, a, b = map(int, input().split())\\nghosts = [(vx, vy) for x, vx, vy in (map(int, input().split()) for i in range(n))]\\nspeeds = {}\\nfor vx, vy in ghosts:\\n    vl = a * vx - vy\\n    k = vx + a * vy\\n    ss = speeds.setdefault(vl, {})\\n    ss[k] = ss.get(k, 0) + 1\\n\\nresult = 0\\nfor vl, ss in speeds.items():\\n    group_size = sum(ss.values())\\n    for sss in ss.values():\\n        result += sss * (group_size - sss)\\nprint(result)\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n_OUTPUT_BUFFER = io.StringIO()\\nsys.stdout = _OUTPUT_BUFFER\\n\\n\\n@atexit.register\\ndef write():\\n    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\\n\\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a * x + b + vy\\n        dd = a * nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx, vy) not in dc[dd]:\\n            dc[dd][(vx, vy)] = 0\\n        dc[dd][(vx, vy)] += 1\\n\\n    tot = 0\\n    for v, k in dc.items():\\n        tt = 0\\n        pp = 0\\n        for _, cc in k.items():\\n            tt -= cc * (cc + 1) // 2\\n            pp += cc\\n        tt += pp * (pp + 1) // 2\\n        tot += tt * 2\\n    print(tot)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"import atexit\\nimport io\\nimport sys\\n\\n# Buffering IO\\n_INPUT_LINES = sys.stdin.read().splitlines()\\ninput = iter(_INPUT_LINES).__next__\\n\\ndef main():\\n    n, a, b = [int(x) for x in input().split()]\\n    dc = {}\\n    for i in range(n):\\n        x, vx, vy = [int(x) for x in input().split()]\\n        nx = x + vx\\n        ny = a * x + b + vy\\n        dd = a * nx - ny + b\\n        if dd not in dc:\\n            dc[dd] = {}\\n        if (vx, vy) not in dc[dd]:\\n            dc[dd][(vx, vy)] = 0\\n        dc[dd][(vx, vy)] += 1\\n\\n    tot = 0\\n    for v, k in dc.items():\\n        tt = 0\\n        pp = 0\\n        for _, cc in k.items():\\n            tt -= cc * (cc + 1) // 2\\n            pp += cc\\n        tt += pp * (pp + 1) // 2\\n        tot += tt * 2\\n    print(tot)\\n\\n\\ndef __starting_point():\\n    main()\\n__starting_point()\", \"from sys import stdin\\nrd = lambda: list(map(int, input().split()))\\ng = lambda x, i: x.get(i, 0)\\nn, a, b = rd()\\nc, d = {}, {}\\nr = 0\\nfor z in range(n):\\n    _, x, y = rd()\\n    i, j = a * x - y, (x, y)\\n    r += g(c, i) - g(d, j)\\n    c[i] = g(c, i) + 1\\n    d[j] = g(d, j) + 1\\nprint(2 * r)\\n\", \"\\ndef main():\\n    n, a, b = [int(part) for part in input().split()]\\n    ghosts = []\\n    for i in range(n):\\n        ghosts.append([int(part) for part in input().split()])\\n\\n    cnt = dict()\\n    vcnt = dict()\\n    for (x, vx, vy) in ghosts:\\n        if (vx, vy) in vcnt:\\n            vcnt[(vx, vy)] += 1\\n        else:\\n            vcnt[(vx, vy)] = 1\\n\\n        tmp = vy - a * vx\\n        if tmp in cnt:\\n            cnt[tmp] += 1\\n        else:\\n            cnt[tmp] = 1\\n\\n    ans = 0\\n    for (x, vx, vy) in ghosts:\\n        tmp = vy - a * vx\\n        ans += cnt[tmp] - vcnt[(vx, vy)]\\n\\n    print(ans)\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from collections import Counter\\nn,a,b=[int(_) for _ in input().split()]\\ns,s1=Counter(),Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=[int(_) for _ in input().split()]\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s1[(vx,vy)]\\n\\ts[tmp]+=1\\n\\ts1[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nn,a,b=map(int,input().split())\\ns,s1=Counter(),Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,input().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s1[(vx,vy)]\\n\\ts[tmp]+=1\\n\\ts1[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nn,a,b=map(int,input().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,input().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import defaultdict\\n\\nn, a, b = map(int, input().split())\\n\\nres = defaultdict(lambda :0)\\nt = defaultdict(lambda :0)\\n\\nans = 0\\n\\nfor _ in range(n):\\n    k, x, y = map(int, input().split())\\n    ans += res[a*x-y] - t[(x,y)]\\n    res[a*x-y]+=1\\n    t[(x,y)]+=1\\n\\nprint(ans*2)\", \"from collections import Counter\\nfrom sys import stdin\\nn,a,b=map(int,stdin.readline().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,stdin.readline().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"from collections import Counter\\nfrom sys import stdin\\nn,a,b=map(int,stdin.readline().split())\\ns=Counter();ans=0\\nfor i in range(n):\\n\\tx,vx,vy=map(int,stdin.readline().split())\\n\\ttmp=vy-a*vx\\n\\tans+=s[tmp]-s[(vx,vy)]\\n\\ts[tmp]+=1;s[(vx,vy)]+=1\\nprint(ans*2)\", \"# http://codeforces.com/contest/975/problem/D\\nn, a, b = (int(x) for x in input().split())\\n\\nmarks = 0\\nk = {}\\nv = {}\\nfor i in range(0, n):\\n    x, v1, v2 = [int(x) for x in input().split()]\\n    ki = v2 - a * v1\\n    vi = (v1, v2)\\n\\n    if ki in k:\\n        k[ki] += 1\\n    else:\\n        k[ki] = 1\\n\\n    if vi in v:\\n        v[vi] += 1\\n    else:\\n        v[vi] = 1\\n\\n    marks += k[ki] - v[vi]\\n\\nprint(marks * 2)\", \"import bisect;\\nn, a, b = map(int, input().split(' '));\\nx=[0]*n;\\nvx=[0]*n;\\nvy=[0]*n;\\nfor i in range(n):\\n    x[i], vx[i], vy[i]=map(int, input().split(' '));\\n#y=ax y-ax=0 (x, y)* (-a, 1)=0 (-a, 1) - \\u0432\\u0435\\u043a\\u0442\\u043e\\u0440 \\u043d\\u043e\\u0440\\u043c\\u0430\\u043b\\u0438\\nntypes=dict();\\nfor i in range(n):\\n    ntype=-a*vx[i]+1*vy[i];\\n    currSet=ntypes.get(ntype, set());\\n    currSet.add(i);\\n    ntypes[ntype]=currSet;\\nresult=0;\\nfor key in ntypes.keys():\\n    currSet=ntypes[key];\\n    currLen=len(currSet);\\n    vtypes=dict();\\n    for i in currSet:\\n        vtype=vx[i]*1+vy[i]*a;\\n        vtypes[vtype]=vtypes.get(vtype, 0)+1;\\n    for key in vtypes.keys():\\n        curr=vtypes[key];\\n        result+=curr*(currLen-curr)\\nprint(result);\", \"#!/usr/bin/env python3\\n\\nfrom collections import Counter\\n\\n[n, a, b] = list(map(int, input().strip().split()))\\nbis = [tuple(map(int, input().strip().split())) for _ in range(n)]\\ndis = [(a * Vx - Vy, Vx) for x, Vx, Vy in bis]\\n\\ndis.sort()\\n\\ndef count(d):\\n\\treturn sum((v * k * (k - 1) for k, v in d))\\n\\ndef filt(it):\\n\\treturn list(Counter(list(Counter(it).values())).items())\\n\\nc_plus = count(filt((x for x, y in dis)))\\nc_minus = count(filt(dis))\\n\\nprint(c_plus - c_minus)\\n\", \"import sys\\nimport math\\nimport bisect\\nimport itertools\\nfrom collections import Counter\\n\\nd = {}\\ns = {}\\nn, a, b = list(map(int,sys.stdin.readline().strip().split(' ')))\\nfor n0 in range(n):\\n\\tx,vxi,vyi = list(map(int,sys.stdin.readline().strip().split(' ')))\\n\\tcurr = a*vxi - vyi\\n\\tif curr in d:\\n\\t\\tif (vxi,vyi) in d[curr]:\\n\\t\\t\\td[curr][(vxi,vyi)] += 1\\n\\t\\telse:\\n\\t\\t\\td[curr][(vxi,vyi)] = 1\\n\\t\\ts[curr] += 1\\n\\telse:\\n\\t\\td[curr] = {(vxi,vyi):1}\\n\\t\\ts[curr] = 1\\n\\nans = 0\\nfor k,v in list(d.items()):\\n\\tfor vxy,q in list(v.items()):\\n\\t\\tans += (s[k] - q)*q\\nprint(ans)\\n\\n\\n\\t\\n\", \"3\\n\\nfrom sys import stdin\\nfrom itertools import groupby\\n\\n\\ndef f(line):\\n    t = line.split()\\n    return tuple(int(x) for x in t[1:])\\n\\n\\nn, a, b = [int(x) for x in stdin.readline().split()]\\npoints = sorted(f(line) for line in stdin.readlines()[:n])\\ngroups = [[k, len(tuple(g))] for k, g in groupby(points)]\\ntotal = {}\\nfor (x, y), cnt in groups:\\n    if y - x * a not in total:\\n        total[y - x * a] = 0\\n    total[y - x * a] += cnt\\nans = 0\\nfor (x, y), cnt in groups:\\n    if y - x * a not in total:\\n        continue\\n    ans += cnt * (total[y - x * a] - cnt)\\nprint(ans)\\n\"]",
        "difficulty": "interview",
        "input": "10 65536 0\n1 0 0\n2 0 0\n3 65536 0\n4 -65536 0\n5 -65536 0\n6 65536 0\n7 -65536 0\n8 65536 0\n9 -65536 0\n10 -65536 0\n",
        "output": "0\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/975/D"
    },
    {
        "id": 858,
        "task_id": 2780,
        "test_case_id": 2,
        "question": "Prof. Peter decided to surprise his class by organizing a new lottery with a very peculiar system.\n\nHe starts by announcing a small positive number $M$. Afterwards, each student is going to secretly write an integer from the set $\\{ 1, ..., M\\} $ on a slip of paper that is then folded. After everyone has selected a number, they reveal all choices and whoever wrote down the lowest unique number is the winner! For instance, if there are only three students in the class, two of them select number $2$ and the other selects number $5$, then the student who chose number $5$ is the winner.\n\nThe lottery was a success, but Prof. Peter is now wondering what strategy his students should have used. If everyone follows the same optimal randomized strategy, with which probability should each number be chosen so that they maximize their chances of winning? A strategy is optimal if, when everyone is following it, then no individual student can improve his winning probability by selecting a different strategy. Can you help Prof. Peter?\n\n-----Task-----\nGiven $N$, the number of students in the class, and $M$, the largest number they can write down, determine the optimal randomized strategy (followed by all students). That is, determine the probability of selecting each number between $1$ and $M$.\n\n-----Input-----\nThere is one line with two integers: $N$, which is the number of students in the class, and $M$, which is the largest integer each student can choose.\n\n-----Constraints-----\n\n$3$\n\n$\\leq $\n\n$N$\n\n$\\leq $\n\n$7$\n\nNumber of students in the class\n\n$1$\n\n$\\leq $\n\n$M$\n\n$\\leq $\n\n$N+1$\n\nMaximum number that can be selected\n\n-----Output-----\nThe output consists of $M$ lines. Line $k$ should have the probability of selecting number $k$.\n\nThe result will be considered correct as long as the absolute error does not exceed $10^{-3}$.\n\n-----Examples-----\nSample Input 1:\n3 3\nSample Output 1:\n0.46410\n0.26795\n0.26795\n\nSample Input 2:\n7 1\nSample Output 2:\n1.00000",
        "solutions": "",
        "difficulty": "interview",
        "input": "7 1\n",
        "output": "1.00000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/riskylottery"
    },
    {
        "id": 859,
        "task_id": 3118,
        "test_case_id": 2,
        "question": "Alice and Bob love playing Don’tminion, which typically involves a lot of shuffling of decks of different sizes. Because they play so often, they are not only very quick at shuffling, but also very consistent. Each time Alice shuffles her deck, her cards get permuted in the same way, just like Bob always permutes his cards the same way when he shuffles them. This isn’t good for playing games, but raises an interesting question.\n\nThey know that if they take turns shuffling, then at some point the deck will end up ordered in the same way as when they started. Alice shuffles once first, then Bob shuffles once, then Alice shuffles again, et cetera. They start with a sorted deck. What they do not know, however, is how many shuffles it will take before the deck is sorted again.\n\nCan you help them compute how many shuffles it will take? As Alice and Bob can only do $10^{12}$ shuffles in the limited time they have, any number strictly larger than this should be returned as huge instead.\n\n-----Input-----\n - The first line contains a single integer $1\\leq n\\leq 10^5$, the number of cards in the deck.\n - The second line contains $n$ distinct integers $1\\leq a_1, a_2, \\dotsc , a_ n \\leq n$, where $a_ i$ is the new position of the card previously at position $i$ when Alice shuffles the deck.\n - The third line contains $n$ distinct integers $1\\leq b_1,b_2,\\dotsc , b_ n\\leq n$, where $b_ i$ is the new position of the card previously at position $i$ when Bob shuffles the deck.\n\n-----Output-----\n - Output a single positive integer $m > 0$, the minimal number of shuffles required to sort the deck, or huge when this number is strictly larger than $10^{12}$.\n\n-----Examples-----\nSample Input 1:\n3\n2 3 1\n3 1 2\nSample Output 1:\n2\n\nSample Input 2:\n6\n5 1 6 3 2 4\n4 6 5 1 3 2\nSample Output 2:\n5",
        "solutions": "",
        "difficulty": "competition",
        "input": "6\n5 1 6 3 2 4\n4 6 5 1 3 2\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/deckrandomisation"
    },
    {
        "id": 860,
        "task_id": 3387,
        "test_case_id": 1,
        "question": "Dreaming of revolutionizing the tech industry and making the world a better place, Ging has recently moved to Silicon Valley to found his own startup, Katbook.\n\nKatbook allows users to download cat pictures. Katbook is capable of transferring $t$ bits per second.\n\nThere are $n$ species of cats, numbered from $1$ to $n$. There is a demand ratio $d_ i$ for the pictures of the $i$-th species. This means, if there is no further restrictions, the $i$-th cat species should have a ‘fair share’ of $\\frac{d_ i}{\\sum _{j=1}^{n} d_ j}$ fraction of the total bandwidth $t$.\n\nHowever, because of infrastructure limitations, the bandwidth for the $i$-th species must be between $a_ i$ and $b_ i$.\n\nYou are newly hired by Ging as a network engineer at Katbook. Your first task is to find the most ‘fair’ bandwidth allocation satisfying the above constraints. More formally, let $x_ i$ be the bandwidth allocated for downloading pictures of the $i$-th species. You must find $x_ i$ such that:\n - $a_ i \\le x_ i \\le b_ i$,\n - $\\sum _{i=1}^{n} x_ i = t$,\n - Let $y_ i = t \\cdot \\frac{d_ i}{\\sum _{j=1}^{n} d_ j}$ ($y_ i$ is the ‘fair share’ bandwidth, if there was no constraints regarding $a_ i$ and $b_ i$), the value $\\sum _{i=1}^{n} \\frac{(x_ i - y_ i)^2}{y_ i}$ should be as small as possible.\n\n-----Input-----\nThe first line of input contains $2$ integers $n$ and $t$ $(1 \\le n \\le 10^5, 1 \\le t \\le 10^6)$.\n\nIn the next $n$ lines, the $i$-th line contains $3$ integers $a_ i$, $b_ i$ and $d_ i$ $(0 \\le a_ i \\le b_ i \\le 10^6, 0 < b_ i, 1 \\le d_ i \\le 10^6)$.\n\nIt is guaranteed that there exists at least one valid solution.\n\nIt can be shown that under these constraints, the solution is unique.\n\n-----Output-----\nOutput $n$ lines, each line contains the allocation for downloading pictures of the $i$-th species. The answer will be accepted if and only if its relative or absolute error to the optimal solution is at most $10^{-6}$.\n\nFormally, for each line, let your answer be $a$, and the jury’s answer be $b$. Your answer is accepted if and only if $\\frac{|a - b|}{\\max {(1, |b|)}} \\le 10^{-6}$.\n\n-----Explanation of Sample input-----\nIn the first sample, each cat species has its ‘fair share’ of $\\frac{1}{3}$ of the whole bandwidth.\n\nIn the second sample, note that the cat species $1$ has much more demand and could get almost all of the available bandwidth if not for its maximum to be capped at $1$. The rest is divided with ratio $2:1$, hence the cat species $2$ gets $6$ bits per second and the cat species $3$ gets $3$ bits per second.\n\n-----Examples-----\nSample Input:\n3 10\n0 10 1\n0 10 1\n0 10 1\nSample Output:\n3.33333333\n3.33333333\n3.33333333",
        "solutions": "",
        "difficulty": "competition",
        "input": "3 10\n0 10 1\n0 10 1\n0 10 1\n",
        "output": "3.33333333\n3.33333333\n3.33333333\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/fairbandwidthsharing"
    },
    {
        "id": 861,
        "task_id": 3772,
        "test_case_id": 2,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "3 2\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 862,
        "task_id": 3772,
        "test_case_id": 3,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "199 200\n",
        "output": "200\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 863,
        "task_id": 3772,
        "test_case_id": 4,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "1 1000000000000000000\n",
        "output": "1000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 864,
        "task_id": 3772,
        "test_case_id": 5,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "3 1\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 865,
        "task_id": 3772,
        "test_case_id": 6,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "21 8\n",
        "output": "7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 866,
        "task_id": 3772,
        "test_case_id": 7,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "18 55\n",
        "output": "21\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 867,
        "task_id": 3772,
        "test_case_id": 8,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "1 2\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 868,
        "task_id": 3772,
        "test_case_id": 9,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "2 1\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 869,
        "task_id": 3772,
        "test_case_id": 10,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "1 3\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 870,
        "task_id": 3772,
        "test_case_id": 11,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "2 3\n",
        "output": "3\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 871,
        "task_id": 3772,
        "test_case_id": 12,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "1 4\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 872,
        "task_id": 3772,
        "test_case_id": 13,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "5 2\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 873,
        "task_id": 3772,
        "test_case_id": 14,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "2 5\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 874,
        "task_id": 3772,
        "test_case_id": 15,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "4 5\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 875,
        "task_id": 3772,
        "test_case_id": 16,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "3 5\n",
        "output": "4\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 876,
        "task_id": 3772,
        "test_case_id": 17,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "13 4\n",
        "output": "7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 877,
        "task_id": 3772,
        "test_case_id": 18,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "21 17\n",
        "output": "9\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 878,
        "task_id": 3772,
        "test_case_id": 19,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "5 8\n",
        "output": "5\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 879,
        "task_id": 3772,
        "test_case_id": 20,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "13 21\n",
        "output": "7\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 880,
        "task_id": 3772,
        "test_case_id": 21,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "74 99\n",
        "output": "28\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 881,
        "task_id": 3772,
        "test_case_id": 22,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "2377 1055\n",
        "output": "33\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 882,
        "task_id": 3772,
        "test_case_id": 23,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "645597 134285\n",
        "output": "87\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 883,
        "task_id": 3772,
        "test_case_id": 24,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "29906716 35911991\n",
        "output": "92\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 884,
        "task_id": 3772,
        "test_case_id": 25,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "3052460231 856218974\n",
        "output": "82\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 885,
        "task_id": 3772,
        "test_case_id": 26,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "288565475053 662099878640\n",
        "output": "88\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 886,
        "task_id": 3772,
        "test_case_id": 27,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "11504415412768 12754036168327\n",
        "output": "163\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 887,
        "task_id": 3772,
        "test_case_id": 28,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "9958408561221547 4644682781404278\n",
        "output": "196\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 888,
        "task_id": 3772,
        "test_case_id": 29,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "60236007668635342 110624799949034113\n",
        "output": "179\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 889,
        "task_id": 3772,
        "test_case_id": 30,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "4 43470202936783249\n",
        "output": "10867550734195816\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 890,
        "task_id": 3772,
        "test_case_id": 31,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "16 310139055712567491\n",
        "output": "19383690982035476\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 891,
        "task_id": 3772,
        "test_case_id": 32,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "15 110897893734203629\n",
        "output": "7393192915613582\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 892,
        "task_id": 3772,
        "test_case_id": 33,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "439910263967866789 38\n",
        "output": "11576585893891241\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 893,
        "task_id": 3772,
        "test_case_id": 34,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "36 316049483082136289\n",
        "output": "8779152307837131\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 894,
        "task_id": 3772,
        "test_case_id": 35,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "752278442523506295 52\n",
        "output": "14466893125452056\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 895,
        "task_id": 3772,
        "test_case_id": 36,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "4052739537881 6557470319842\n",
        "output": "62\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 896,
        "task_id": 3772,
        "test_case_id": 37,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "44945570212853 72723460248141\n",
        "output": "67\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 897,
        "task_id": 3772,
        "test_case_id": 38,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "498454011879264 806515533049393\n",
        "output": "72\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 898,
        "task_id": 3772,
        "test_case_id": 39,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "8944394323791464 5527939700884757\n",
        "output": "77\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 899,
        "task_id": 3772,
        "test_case_id": 40,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "679891637638612258 420196140727489673\n",
        "output": "86\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 900,
        "task_id": 3772,
        "test_case_id": 41,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "1 923438\n",
        "output": "923438\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 901,
        "task_id": 3772,
        "test_case_id": 42,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "3945894354376 1\n",
        "output": "3945894354376\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 902,
        "task_id": 3772,
        "test_case_id": 43,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "999999999999999999 5\n",
        "output": "200000000000000004\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 903,
        "task_id": 3772,
        "test_case_id": 44,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "999999999999999999 1000000000000000000\n",
        "output": "1000000000000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 904,
        "task_id": 3772,
        "test_case_id": 45,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "999999999999999991 1000000000000000000\n",
        "output": "111111111111111120\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 905,
        "task_id": 3772,
        "test_case_id": 46,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "999999999999999993 999999999999999991\n",
        "output": "499999999999999998\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 906,
        "task_id": 3772,
        "test_case_id": 47,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "3 1000000000000000000\n",
        "output": "333333333333333336\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 907,
        "task_id": 3772,
        "test_case_id": 48,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "1000000000000000000 3\n",
        "output": "333333333333333336\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 908,
        "task_id": 3772,
        "test_case_id": 49,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "10000000000 1000000001\n",
        "output": "100000019\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 909,
        "task_id": 3772,
        "test_case_id": 50,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "2 999999999999999999\n",
        "output": "500000000000000001\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 910,
        "task_id": 3772,
        "test_case_id": 51,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "999999999999999999 2\n",
        "output": "500000000000000001\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 911,
        "task_id": 3772,
        "test_case_id": 52,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "2 1000000001\n",
        "output": "500000002\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 912,
        "task_id": 3772,
        "test_case_id": 53,
        "question": "Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.\n\nHowever, all Mike has is lots of identical resistors with unit resistance R_0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:   one resistor;  an element and one resistor plugged in sequence;  an element and one resistor plugged in parallel.  [Image] \n\nWith the consecutive connection the resistance of the new element equals R = R_{e} + R_0. With the parallel connection the resistance of the new element equals $R = \\frac{1}{\\frac{1}{R_{e}} + \\frac{1}{R_{0}}}$. In this case R_{e} equals the resistance of the element being connected.\n\nMike needs to assemble an element with a resistance equal to the fraction $\\frac{a}{b}$. Determine the smallest possible number of resistors he needs to make such an element.\n\n\n-----Input-----\n\nThe single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 10^18). It is guaranteed that the fraction $\\frac{a}{b}$ is irreducible. It is guaranteed that a solution always exists.\n\n\n-----Output-----\n\nPrint a single number — the answer to the problem.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the %I64d specifier.\n\n\n-----Examples-----\nInput\n1 1\n\nOutput\n1\n\nInput\n3 2\n\nOutput\n3\n\nInput\n199 200\n\nOutput\n200\n\n\n\n-----Note-----\n\nIn the first sample, one resistor is enough.\n\nIn the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance $\\frac{1}{\\frac{1}{1} + \\frac{1}{1}} + 1 = \\frac{3}{2}$. We cannot make this element using two resistors.",
        "solutions": "[\"a, b = list(map(int, input().split()))\\nres = 0\\n\\nwhile b != 0:\\n    res += a // b\\n    a %= b\\n    a, b = b, a\\nprint(res)\\n\", \"a,b = list(map(int,input().split()))\\nn = 0\\nwhile not (a == 0 or b == 0):\\n    if a > b:\\n        n += a // b\\n        a = a % b\\n    else:\\n        n += b // a\\n        b = b % a\\nprint(n)\\n\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = list(map(int, input().split()))\\n\\nprint(f(a, b))\\n\", \"a,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = [int(x) for x in input().split()]\\nans = 0\\nwhile (a != 1 and b != 1):\\n  if (a > b):\\n    ans += a // b\\n    a %= b\\n  a, b = b, a\\nans += a+b-1\\nprint(ans)\\n\", \"a=0\\na,b=list(map(int,input().split()))\\n\\n\\n\\ndef Solve(a,b):\\n    if(a==(a//b)*b):\\n        return a//b\\n    if(a>b):\\n        ans=0\\n        ans+=a//b\\n        a%=b\\n        if(a==1):\\n            ans+=b\\n            return ans\\n        else:\\n            ans+=Solve(b,a)\\n            return ans\\n    else:\\n        return Solve(b,a)\\n\\nprint(Solve(a,b))\\n\", \"a, b = map(int, input().split())\\ns = 0\\nwhile b:\\n    s += a // b\\n    a, b = b, a % b\\nprint(s)\", \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\n\\na, b = list(map(int, input().split()))\\ncount = 0\\nwhile a > 0 and b > 0:\\n    if a > b:\\n        count += (a // b)\\n        a = a % b\\n    elif a < b:\\n        count += (b // a)\\n        b = (b % a)\\n    else:\\n        count += a\\n        a = b = 0\\nprint(count)\\n\", \"a, b=list(map(int, input().split(' ')))\\n\\ndef perform(a, b):\\n    steps=0\\n    while a!=0 and b!=0:\\n        if a>=b:\\n            steps+=a//b\\n        else:\\n            a, b=b, a\\n            steps+=a//b\\n        a, b=b, a%b\\n    return steps\\n\\nprint(perform(a, b))\\n\", \"a=[0]+[int(i)for i in input().split()]\\nwhile a[1]*a[2]!=0:\\n a=[a[0]+a[1]//a[2],a[2],a[1]%a[2]]\\nprint(a[0])\", \"import fractions\\n\\ndef resistance():\\n    #  print(\\\"Input the two values\\\")\\n    _a, _b = input().split()\\n    a = int(_a)\\n    b = int(_b)\\n    answer = 1\\n    f = fractions.Fraction(a,b)\\n    one = fractions.Fraction(1,1)\\n\\n    while (f != one):\\n        n = f.numerator\\n        d = f.denominator\\n\\n        #  If either the num or denom are one, go straight up the line and finish\\n        if (n == 1) and (d == 1):\\n            print(answer)\\n            return\\n        if (n == 1 ):\\n            print(answer + d - 1)\\n            return\\n        if (d == 1):\\n            print(answer + n - 1)\\n            return\\n\\n        if (f > 1):\\n            q = n//d\\n            n = n - q*d\\n            f = fractions.Fraction(n,d)\\n            answer = answer + q\\n        else:\\n            nbound = (1-f)/f\\n            n = nbound.numerator\\n            d = nbound.denominator\\n            then = n//d + 1\\n            answer = answer + then\\n            f = f / (1-then*f)\\n            \\n    print(answer)\\n\\nresistance()\\n\", \"a, b = map(int, input().split())\\nval = 0\\nwhile b > 0:\\n    a, b, val = b, a % b, val + a // b\\nprint(val)\", \"a, b = (int(x) for x in input().split())\\nans = 0\\nwhile b:\\n\\tans += a // b\\n\\ta %= b\\n\\ta, b = b, a\\nprint(ans)\\n\", \"def main():\\n    a, b = list(map(int, input().split()))\\n    res = 0\\n    while b:\\n        res += a // b\\n        a, b = b, a % b\\n    print(res)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"a,b=map(int,input().split())\\no=0\\nwhile(a and b):\\n\\to=o+max(a,b)//min(a,b)\\n\\tif(a>b):a=a%b\\n\\telse:b=b%a\\nprint(o)\", \"def f(a, b):\\n    if a < b:\\n        return f(b, a)\\n    elif b == 1:\\n        return a\\n    else:\\n        return f(b, a%b) + a//b\\n\\n(a, b) = map(int, input().split())\\n\\nprint(f(a, b))\", \"#!/usr/bin/env python3\\ndef solve(a,b):\\n    assert 1 <= a and 1 <= b\\n    if a == 1 and b == 1:\\n        return 1\\n    else:\\n        a, b = max(a, b), min(a, b)\\n        p, q = a // b, a % b\\n        if q == 0:\\n            p, q = p-1, 1\\n        return p + solve(q, b)\\na, b = list(map(int,input().split()))\\nprint(solve(a,b))\\n\", \"from functools import reduce\\nfrom operator import *\\nfrom math import *\\nfrom sys import *\\nfrom string import *\\nsetrecursionlimit(10**7)\\nRI=lambda: list(map(int,input().split()))\\nRS=lambda: input().rstrip().split()\\n#################################################\\nn,m=RI()\\nans=0\\nwhile m:\\n    ans+=n//m\\n    n,m= m,n%m\\nprint(ans)\\n\\n\", \"a,b = map(int,input().split())\\n\\ndef res(a,b):\\n    if a == 1 :\\n        return b;\\n    if b == 1 :\\n        return a;\\n    q = b//a\\n    b = b%a\\n    q += a//b\\n    return q+res(a%b,b)\\n\\nprint(res(a,b))\", \"a, b = map(int, input().split())\\nm=max(a,b)\\nmm=min(a,b)\\nans=0\\nwhile(mm!=1):\\n    ans=ans+m//mm\\n    i=m%mm\\n    if(i>mm):\\n        m=i\\n    else:\\n        m=mm\\n        mm=i\\nans=ans+m\\nprint(round(ans))\", \"n,m=map(int,input().split())\\na=0\\nwhile m:a+=n//m;n,m=m,n%m\\nprint(a)\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n\\t \\t  \\t  \\t\\t\\t \\t\\t\\t\\t\\t    \\t\\t\\t      \\t\", \"s=input()\\n[a,b]=(s.split())\\na=int(a)\\nb=int(b)\\nif b>a: a,b=b,a\\nans=0\\nwhile b!=0:\\n    c=a%b\\n    ans+=(a//b)\\n    a=b\\n    b=c\\nprint(ans,end=\\\"\\\\n\\\")\\n\\n \\t\\t \\t \\t\\t  \\t    \\t\\t  \\t\\t\\t \\t \\t\\t\\t\"]",
        "difficulty": "competition",
        "input": "123 1000000000000000000\n",
        "output": "8130081300813023\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/343/A"
    },
    {
        "id": 913,
        "task_id": 3780,
        "test_case_id": 14,
        "question": "A team of furry rescue rangers was sitting idle in their hollow tree when suddenly they received a signal of distress. In a few moments they were ready, and the dirigible of the rescue chipmunks hit the road.\n\nWe assume that the action takes place on a Cartesian plane. The headquarters of the rescuers is located at point (x_1, y_1), and the distress signal came from the point (x_2, y_2).\n\nDue to Gadget's engineering talent, the rescuers' dirigible can instantly change its current velocity and direction of movement at any moment and as many times as needed. The only limitation is: the speed of the aircraft relative to the air can not exceed $v_{\\operatorname{max}}$ meters per second.\n\nOf course, Gadget is a true rescuer and wants to reach the destination as soon as possible. The matter is complicated by the fact that the wind is blowing in the air and it affects the movement of the dirigible. According to the weather forecast, the wind will be defined by the vector (v_{x}, v_{y}) for the nearest t seconds, and then will change to (w_{x}, w_{y}). These vectors give both the direction and velocity of the wind. Formally, if a dirigible is located at the point (x, y), while its own velocity relative to the air is equal to zero and the wind (u_{x}, u_{y}) is blowing, then after $T$ seconds the new position of the dirigible will be $(x + \\tau \\cdot u_{x}, y + \\tau \\cdot u_{y})$.\n\nGadget is busy piloting the aircraft, so she asked Chip to calculate how long will it take them to reach the destination if they fly optimally. He coped with the task easily, but Dale is convinced that Chip has given the random value, aiming only not to lose the face in front of Gadget. Dale has asked you to find the right answer.\n\nIt is guaranteed that the speed of the wind at any moment of time is strictly less than the maximum possible speed of the airship relative to the air.\n\n\n-----Input-----\n\nThe first line of the input contains four integers x_1, y_1, x_2, y_2 (|x_1|,  |y_1|,  |x_2|,  |y_2| ≤ 10 000) — the coordinates of the rescuers' headquarters and the point, where signal of the distress came from, respectively. \n\nThe second line contains two integers $v_{\\operatorname{max}}$ and t (0 < v, t ≤ 1000), which are denoting the maximum speed of the chipmunk dirigible relative to the air and the moment of time when the wind changes according to the weather forecast, respectively. \n\nNext follow one per line two pairs of integer (v_{x}, v_{y}) and (w_{x}, w_{y}), describing the wind for the first t seconds and the wind that will blow at all the remaining time, respectively. It is guaranteed that $v_{x}^{2} + v_{y}^{2} < v_{\\operatorname{max}}^{2}$ and $w_{x}^{2} + w_{y}^{2} < v_{\\operatorname{max}}^{2}$.\n\n\n-----Output-----\n\nPrint a single real value — the minimum time the rescuers need to get to point (x_2, y_2). You answer will be considered correct if its absolute or relative error does not exceed 10^{ - 6}. \n\nNamely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if $\\frac{|a - b|}{\\operatorname{max}(1, b)} \\leq 10^{-6}$.\n\n\n-----Examples-----\nInput\n0 0 5 5\n3 2\n-1 -1\n-1 0\n\nOutput\n3.729935587093555327\n\nInput\n0 0 0 1000\n100 1000\n-50 0\n50 0\n\nOutput\n11.547005383792516398",
        "solutions": "[\"import math\\nx1, y1, x2, y2 = list(map(int, input().split(' ')[:4]))\\nu_max, tau = list(map(int, input().split(' ')[:2]))\\nvx, vy = list(map(int, input().split(' ')[:2]))\\nwx, wy = list(map(int, input().split(' ')[:2]))\\n\\nA = (x2 - x1, y2 - y1)\\nv = (-vx, -vy)\\nw = (-wx, -wy)\\n\\nB = (A[0] + tau * v[0], A[1] + tau * v[1])\\n\\n\\ndef solve_sqr_eq(a, b, c):\\n    d = b**2 - 4*a*c\\n    if d >= 0:\\n        return ((-b + math.sqrt(d)) / (2*a), (-b - math.sqrt(d)) / (2*a))\\n    else:\\n        return None\\n\\n\\na = v[0]**2 + v[1]**2 - u_max**2\\nb = 2 * A[0] * v[0] + 2 * A[1] * v[1]\\nc = A[0]**2 + A[1]**2\\nr = solve_sqr_eq(a, b, c)\\n\\nif r is not None:\\n    t1, t2 = r\\n    t_min = min(t1, t2)\\n    t_max = max(t1, t2)\\n    if 0 <= t_min <= tau:\\n        print(t_min)\\n        return\\n    if 0 <= t_max <= tau:\\n        print(t_max)\\n        return\\n\\n\\na = w[0]**2 + w[1]**2 - u_max**2\\nb = 2 * B[0] * w[0] + 2 * B[1] * w[1] - u_max**2 * 2 * tau\\nc = B[0]**2 + B[1]**2 - u_max**2 * tau**2\\nr = solve_sqr_eq(a, b, c)\\n\\nif r is not None:\\n    t1, t2 = r\\n    t_min = min(t1, t2)\\n    t_max = max(t1, t2)\\n    if 0 <= t_min :\\n        print(t_min + tau)\\n        return\\n    if 0 <= t_max:\\n        print(t_max + tau)\\n        return\\n\", \"import sys\\nimport math\\nread = lambda: list(map(int, sys.stdin.readline().split()))\\n\\nx1, y1, x2, y2 = read()\\nvmax, t1 = read()\\nvx, vy = read()\\nwx, wy = read()\\n\\n# Translate and scale\\nx2, y2 = (x2-x1)/vmax, (y2-y1)/vmax\\nvx, vy, wx, wy = vx/vmax, vy/vmax, wx/vmax, wy/vmax\\n\\nlo, up = 0, 10**9\\nfor _ in range(100):\\n   t = (lo + up)/2\\n   x = x2 - min(t,t1)*vx - max(t-t1,0)*wx\\n   y = y2 - min(t,t1)*vy - max(t-t1,0)*wy\\n   if x**2 + y**2 <= t**2:\\n      up = t\\n   else: lo = t\\n\\nprint(up)\\n\\n\", \"x, y, a, b = map(int, input().split())\\na -= x\\nb -= y\\nv, t = map(int, input().split())\\nvx, vy = map(int, input().split())\\nux, uy = map(int, input().split())\\n\\n\\ndef ok(T):\\n    U = max(0, T-t)\\n    V = min(t, T)\\n    X = a - U * ux - V * vx\\n    Y = b - U * uy - V * vy\\n    return X*X + Y*Y <= ((U+V)*v)**2\\n\\nl = 0\\nr = 1e9\\nwhile r-l > 1e-6:\\n    m = (l+r)/2\\n    if ok(m): r = m\\n    else: l = m\\nprint(r)\", \"def f(T):\\n    t1 = min(t, T)\\n    t2 = max(T - t, 0)\\n    u = [v[0] * t1 + w[0] * t2, v[1] * t1 + w[1] * t2]\\n    C = [A[0] + u[0], A[1] + u[1]]\\n    dist = ((C[0] - B[0]) ** 2 + (C[1] - B[1]) ** 2) ** 0.5\\n    dist2 = Vmax * T\\n    return dist2 >= dist\\n\\nread = lambda: list(map(int, input().split()))\\nA, B, v, w = [[0, 0] for i in range(4)]\\nA[0], A[1], B[0], B[1] = read()\\nVmax, t = read()\\nv[0], v[1] = read()\\nw[0], w[1] = read()\\nL, R = 0, 1e12\\nfor i in range(100):\\n    M = (L + R) / 2\\n    if f(M): R = M\\n    else: L = M\\nans = R\\nprint(ans)\\n\", \"scan=lambda:map(int,input().split())\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\", \"f = lambda: list(map(int, input().split()))\\n\\nabs = lambda q: q[0] * q[0] + q[1] * q[1]\\ndot = lambda: v[0] * d[0] + v[1] * d[1]\\nget = lambda a, b, c: (b - (b * b - a * c) ** 0.5) / a\\n\\np = f()\\nd = [p[k + 2] - p[k] for k in [0, 1]]\\nv, t = f()\\ns = v * v\\n\\nv = f()\\ni = get(abs(v) - s, dot(), abs(d))\\nd = [d[k] - t * v[k] for k in (0, 1)]\\n\\nv = f()\\nj = get(abs(v) - s, dot() + t * s, abs(d) - t * t * s)\\n\\nprint(i if i < t else t + j)\", \"f = lambda: map(int, input().split())\\na, b, c, d = f()\\ns, t = f()\\nvx, vy = f()\\nux, uy = f()\\ndef g(m):\\n    vt = min(t, m)\\n    ut = max(0, m - t)\\n    x = c - a - ut * ux - vt * vx\\n    y = d - b - ut * uy - vt * vy\\n    return x * x + y * y > (m * s) ** 2\\nl, r = 0, 1e9\\nwhile r - l > 1e-6:\\n    m = (l + r) / 2\\n    if g(m): l = m\\n    else: r = m\\nprint(r)\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"f = lambda: list(map(int, input().split()))\\n\\n\\n\\nabs = lambda q: q[0] * q[0] + q[1] * q[1]\\n\\ndot = lambda: v[0] * d[0] + v[1] * d[1]\\n\\nget = lambda a, b, c: (b - (b * b - a * c) ** 0.5) / a\\n\\n\\n\\np = f()\\n\\nd = [p[k + 2] - p[k] for k in [0, 1]]\\n\\nv, t = f()\\n\\ns = v * v\\n\\n\\n\\nv = f()\\n\\ni = get(abs(v) - s, dot(), abs(d))\\n\\nd = [d[k] - t * v[k] for k in (0, 1)]\\n\\n\\n\\nv = f()\\n\\nj = get(abs(v) - s, dot() + t * s, abs(d) - t * t * s)\\n\\n\\n\\nprint(i if i < t else t + j)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "competition",
        "input": "-1 -1 1 1\n1 1\n0 0\n0 0\n",
        "output": "2.8284271247461898469\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/590/B"
    },
    {
        "id": 914,
        "task_id": 3780,
        "test_case_id": 25,
        "question": "A team of furry rescue rangers was sitting idle in their hollow tree when suddenly they received a signal of distress. In a few moments they were ready, and the dirigible of the rescue chipmunks hit the road.\n\nWe assume that the action takes place on a Cartesian plane. The headquarters of the rescuers is located at point (x_1, y_1), and the distress signal came from the point (x_2, y_2).\n\nDue to Gadget's engineering talent, the rescuers' dirigible can instantly change its current velocity and direction of movement at any moment and as many times as needed. The only limitation is: the speed of the aircraft relative to the air can not exceed $v_{\\operatorname{max}}$ meters per second.\n\nOf course, Gadget is a true rescuer and wants to reach the destination as soon as possible. The matter is complicated by the fact that the wind is blowing in the air and it affects the movement of the dirigible. According to the weather forecast, the wind will be defined by the vector (v_{x}, v_{y}) for the nearest t seconds, and then will change to (w_{x}, w_{y}). These vectors give both the direction and velocity of the wind. Formally, if a dirigible is located at the point (x, y), while its own velocity relative to the air is equal to zero and the wind (u_{x}, u_{y}) is blowing, then after $T$ seconds the new position of the dirigible will be $(x + \\tau \\cdot u_{x}, y + \\tau \\cdot u_{y})$.\n\nGadget is busy piloting the aircraft, so she asked Chip to calculate how long will it take them to reach the destination if they fly optimally. He coped with the task easily, but Dale is convinced that Chip has given the random value, aiming only not to lose the face in front of Gadget. Dale has asked you to find the right answer.\n\nIt is guaranteed that the speed of the wind at any moment of time is strictly less than the maximum possible speed of the airship relative to the air.\n\n\n-----Input-----\n\nThe first line of the input contains four integers x_1, y_1, x_2, y_2 (|x_1|,  |y_1|,  |x_2|,  |y_2| ≤ 10 000) — the coordinates of the rescuers' headquarters and the point, where signal of the distress came from, respectively. \n\nThe second line contains two integers $v_{\\operatorname{max}}$ and t (0 < v, t ≤ 1000), which are denoting the maximum speed of the chipmunk dirigible relative to the air and the moment of time when the wind changes according to the weather forecast, respectively. \n\nNext follow one per line two pairs of integer (v_{x}, v_{y}) and (w_{x}, w_{y}), describing the wind for the first t seconds and the wind that will blow at all the remaining time, respectively. It is guaranteed that $v_{x}^{2} + v_{y}^{2} < v_{\\operatorname{max}}^{2}$ and $w_{x}^{2} + w_{y}^{2} < v_{\\operatorname{max}}^{2}$.\n\n\n-----Output-----\n\nPrint a single real value — the minimum time the rescuers need to get to point (x_2, y_2). You answer will be considered correct if its absolute or relative error does not exceed 10^{ - 6}. \n\nNamely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if $\\frac{|a - b|}{\\operatorname{max}(1, b)} \\leq 10^{-6}$.\n\n\n-----Examples-----\nInput\n0 0 5 5\n3 2\n-1 -1\n-1 0\n\nOutput\n3.729935587093555327\n\nInput\n0 0 0 1000\n100 1000\n-50 0\n50 0\n\nOutput\n11.547005383792516398",
        "solutions": "[\"import math\\nx1, y1, x2, y2 = list(map(int, input().split(' ')[:4]))\\nu_max, tau = list(map(int, input().split(' ')[:2]))\\nvx, vy = list(map(int, input().split(' ')[:2]))\\nwx, wy = list(map(int, input().split(' ')[:2]))\\n\\nA = (x2 - x1, y2 - y1)\\nv = (-vx, -vy)\\nw = (-wx, -wy)\\n\\nB = (A[0] + tau * v[0], A[1] + tau * v[1])\\n\\n\\ndef solve_sqr_eq(a, b, c):\\n    d = b**2 - 4*a*c\\n    if d >= 0:\\n        return ((-b + math.sqrt(d)) / (2*a), (-b - math.sqrt(d)) / (2*a))\\n    else:\\n        return None\\n\\n\\na = v[0]**2 + v[1]**2 - u_max**2\\nb = 2 * A[0] * v[0] + 2 * A[1] * v[1]\\nc = A[0]**2 + A[1]**2\\nr = solve_sqr_eq(a, b, c)\\n\\nif r is not None:\\n    t1, t2 = r\\n    t_min = min(t1, t2)\\n    t_max = max(t1, t2)\\n    if 0 <= t_min <= tau:\\n        print(t_min)\\n        return\\n    if 0 <= t_max <= tau:\\n        print(t_max)\\n        return\\n\\n\\na = w[0]**2 + w[1]**2 - u_max**2\\nb = 2 * B[0] * w[0] + 2 * B[1] * w[1] - u_max**2 * 2 * tau\\nc = B[0]**2 + B[1]**2 - u_max**2 * tau**2\\nr = solve_sqr_eq(a, b, c)\\n\\nif r is not None:\\n    t1, t2 = r\\n    t_min = min(t1, t2)\\n    t_max = max(t1, t2)\\n    if 0 <= t_min :\\n        print(t_min + tau)\\n        return\\n    if 0 <= t_max:\\n        print(t_max + tau)\\n        return\\n\", \"import sys\\nimport math\\nread = lambda: list(map(int, sys.stdin.readline().split()))\\n\\nx1, y1, x2, y2 = read()\\nvmax, t1 = read()\\nvx, vy = read()\\nwx, wy = read()\\n\\n# Translate and scale\\nx2, y2 = (x2-x1)/vmax, (y2-y1)/vmax\\nvx, vy, wx, wy = vx/vmax, vy/vmax, wx/vmax, wy/vmax\\n\\nlo, up = 0, 10**9\\nfor _ in range(100):\\n   t = (lo + up)/2\\n   x = x2 - min(t,t1)*vx - max(t-t1,0)*wx\\n   y = y2 - min(t,t1)*vy - max(t-t1,0)*wy\\n   if x**2 + y**2 <= t**2:\\n      up = t\\n   else: lo = t\\n\\nprint(up)\\n\\n\", \"x, y, a, b = map(int, input().split())\\na -= x\\nb -= y\\nv, t = map(int, input().split())\\nvx, vy = map(int, input().split())\\nux, uy = map(int, input().split())\\n\\n\\ndef ok(T):\\n    U = max(0, T-t)\\n    V = min(t, T)\\n    X = a - U * ux - V * vx\\n    Y = b - U * uy - V * vy\\n    return X*X + Y*Y <= ((U+V)*v)**2\\n\\nl = 0\\nr = 1e9\\nwhile r-l > 1e-6:\\n    m = (l+r)/2\\n    if ok(m): r = m\\n    else: l = m\\nprint(r)\", \"def f(T):\\n    t1 = min(t, T)\\n    t2 = max(T - t, 0)\\n    u = [v[0] * t1 + w[0] * t2, v[1] * t1 + w[1] * t2]\\n    C = [A[0] + u[0], A[1] + u[1]]\\n    dist = ((C[0] - B[0]) ** 2 + (C[1] - B[1]) ** 2) ** 0.5\\n    dist2 = Vmax * T\\n    return dist2 >= dist\\n\\nread = lambda: list(map(int, input().split()))\\nA, B, v, w = [[0, 0] for i in range(4)]\\nA[0], A[1], B[0], B[1] = read()\\nVmax, t = read()\\nv[0], v[1] = read()\\nw[0], w[1] = read()\\nL, R = 0, 1e12\\nfor i in range(100):\\n    M = (L + R) / 2\\n    if f(M): R = M\\n    else: L = M\\nans = R\\nprint(ans)\\n\", \"scan=lambda:map(int,input().split())\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\", \"f = lambda: list(map(int, input().split()))\\n\\nabs = lambda q: q[0] * q[0] + q[1] * q[1]\\ndot = lambda: v[0] * d[0] + v[1] * d[1]\\nget = lambda a, b, c: (b - (b * b - a * c) ** 0.5) / a\\n\\np = f()\\nd = [p[k + 2] - p[k] for k in [0, 1]]\\nv, t = f()\\ns = v * v\\n\\nv = f()\\ni = get(abs(v) - s, dot(), abs(d))\\nd = [d[k] - t * v[k] for k in (0, 1)]\\n\\nv = f()\\nj = get(abs(v) - s, dot() + t * s, abs(d) - t * t * s)\\n\\nprint(i if i < t else t + j)\", \"f = lambda: map(int, input().split())\\na, b, c, d = f()\\ns, t = f()\\nvx, vy = f()\\nux, uy = f()\\ndef g(m):\\n    vt = min(t, m)\\n    ut = max(0, m - t)\\n    x = c - a - ut * ux - vt * vx\\n    y = d - b - ut * uy - vt * vy\\n    return x * x + y * y > (m * s) ** 2\\nl, r = 0, 1e9\\nwhile r - l > 1e-6:\\n    m = (l + r) / 2\\n    if g(m): l = m\\n    else: r = m\\nprint(r)\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"scan=lambda:list(map(int,input().split()))\\nx1,y1,x2,y2=scan()\\nvmx,t=scan()\\nvx,vy=scan()\\nwx,wy=scan()\\nlb,ub,EPS=0,1e15,1e-8\\nwhile ub-lb>EPS:\\n\\tmid=(lb+ub)/2\\n\\txx,yy=(vx*mid,vy*mid) if t-mid>EPS else (vx*t+wx*(mid-t),vy*t+wy*(mid-t))\\n\\tif vmx*mid-((x2-x1-xx)**2+(y2-y1-yy)**2)**.5>EPS:ub=mid\\n\\telse:lb=mid\\nprint(\\\"%.8f\\\"%ub)\\n\", \"f = lambda: list(map(int, input().split()))\\n\\n\\n\\nabs = lambda q: q[0] * q[0] + q[1] * q[1]\\n\\ndot = lambda: v[0] * d[0] + v[1] * d[1]\\n\\nget = lambda a, b, c: (b - (b * b - a * c) ** 0.5) / a\\n\\n\\n\\np = f()\\n\\nd = [p[k + 2] - p[k] for k in [0, 1]]\\n\\nv, t = f()\\n\\ns = v * v\\n\\n\\n\\nv = f()\\n\\ni = get(abs(v) - s, dot(), abs(d))\\n\\nd = [d[k] - t * v[k] for k in (0, 1)]\\n\\n\\n\\nv = f()\\n\\nj = get(abs(v) - s, dot() + t * s, abs(d) - t * t * s)\\n\\n\\n\\nprint(i if i < t else t + j)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\"]",
        "difficulty": "competition",
        "input": "0 0 0 0\n1000 1\n0 0\n0 0\n",
        "output": "3.9443045261050590271e-019\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/590/B"
    },
    {
        "id": 915,
        "task_id": 3803,
        "test_case_id": 8,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "74 89 5\n32 76 99\n62 95 36\n",
        "output": "3529\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 916,
        "task_id": 3803,
        "test_case_id": 11,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "65 6 5\n70 78 51\n88 55 78\n",
        "output": "7027\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 917,
        "task_id": 3803,
        "test_case_id": 13,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 28 47\n31 60 38\n14 51 77\n",
        "output": "1562\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 918,
        "task_id": 3803,
        "test_case_id": 14,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "99 32 20\n89 72 74\n1 100 39\n",
        "output": "5478\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 919,
        "task_id": 3803,
        "test_case_id": 16,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 100\n1 1 1\n100 1 100\n",
        "output": "1\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 920,
        "task_id": 3803,
        "test_case_id": 17,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "79 1 1\n1 1 10\n1 1 100\n",
        "output": "10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 921,
        "task_id": 3803,
        "test_case_id": 18,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "10 10 100\n1 100 100\n10 100 90\n",
        "output": "9100\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 922,
        "task_id": 3803,
        "test_case_id": 25,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "11 1 1\n10 1 10\n100 50 1\n",
        "output": "500\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 923,
        "task_id": 3803,
        "test_case_id": 27,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 10 10\n1 10 100\n1 1 61\n",
        "output": "91\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 924,
        "task_id": 3803,
        "test_case_id": 30,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n100 100 100\n100 100 100\n",
        "output": "19900\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 925,
        "task_id": 3803,
        "test_case_id": 33,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n1 1 100\n100 100 1\n",
        "output": "10000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 926,
        "task_id": 3803,
        "test_case_id": 35,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n100 100 100\n1 2 3\n",
        "output": "496\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 927,
        "task_id": 3803,
        "test_case_id": 36,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "100 1 1\n100 100 100\n100 1 100\n",
        "output": "199\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 928,
        "task_id": 3803,
        "test_case_id": 39,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n100 100 100\n1 100 100\n",
        "output": "11890\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 929,
        "task_id": 3803,
        "test_case_id": 40,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "20 1 1\n100 100 100\n1 100 100\n",
        "output": "11871\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 930,
        "task_id": 3803,
        "test_case_id": 41,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "25 38 49\n84 96 42\n3 51 92\n",
        "output": "1692\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 931,
        "task_id": 3803,
        "test_case_id": 42,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "2 1 1\n100 2 100\n100 1 100\n",
        "output": "199\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 932,
        "task_id": 3803,
        "test_case_id": 43,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 97 1\n100 99 98\n1 51 52\n",
        "output": "1498\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 933,
        "task_id": 3803,
        "test_case_id": 44,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "1 1 1\n100 100 100\n1 1 100\n",
        "output": "298\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 934,
        "task_id": 3803,
        "test_case_id": 46,
        "question": "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).\n\nDuring the battle, every second the monster's HP decrease by max(0, ATK_{Y} - DEF_{M}), while Yang's HP decreases by max(0, ATK_{M} - DEF_{Y}), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.\n\nMaster Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.\n\nNow Master Yang wants to know the minimum number of bitcoins he can spend in order to win.\n\n\n-----Input-----\n\nThe first line contains three integers HP_{Y}, ATK_{Y}, DEF_{Y}, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.\n\nThe second line contains three integers HP_{M}, ATK_{M}, DEF_{M}, separated by a space, denoting the HP, ATK and DEF of the monster.\n\nThe third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.\n\nAll numbers in input are integer and lie between 1 and 100 inclusively.\n\n\n-----Output-----\n\nThe only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.\n\n\n-----Examples-----\nInput\n1 2 1\n1 100 1\n1 100 100\n\nOutput\n99\n\nInput\n100 100 100\n1 1 1\n1 1 1\n\nOutput\n0\n\n\n\n-----Note-----\n\nFor the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.\n\nFor the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.",
        "solutions": "[\"H_y,A_y,D_y = list(map(int,input().split()))\\nH_m,A_m,D_m = list(map(int,input().split()))\\nh,a,d = list(map(int,input().split()))\\nans = 10**20\\nfor A_buy in range(max(0,H_m+D_m-A_y)+1):\\n  for D_buy in range(max(0,A_m-D_y)+1):\\n    damage = A_y + A_buy - D_m\\n    cost = A_buy * a + D_buy * d\\n    if damage > 0 and cost < ans:\\n      time = (H_m+damage-1)//damage\\n      H_left = H_y - time * max(0, A_m - D_y - D_buy)\\n      if H_left <= 0: cost += h * (1-H_left)\\n      if cost < ans: \\n        ans = cost\\nprint(ans)\\n\", \"R=lambda:list(map(int,input().split()))\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\\n\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"R=lambda:map(int,input().split())\\nyH,yA,yD=R()\\nmH,mA,mD=R()\\nh,a,d=R()\\nQ=10**20\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n for D in range(max(0,mA-yD)+1):\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\nprint(Q)\", \"from operator import itemgetter\\n\\ndef bin_search(lo, hi, key):\\n    while (lo < hi):\\n        md = (hi + lo) // 2\\n        if (md >= key(md)):\\n            hi = md\\n            #print(\\\"new hi:\\\", hi)\\n        else:\\n            lo = md + 1\\n            #print(\\\"new lo:\\\", lo)\\n    return lo   #or hi, they're equal at this point\\n\\ndef key_func(budget, prices):\\n    for k in range(1 + budget//prices[2]):\\n        budget2 = budget - k*prices[2]\\n        for j in range(1 + budget2//prices[1]):\\n            budget3 = budget2 - j*prices[1]\\n            i = budget3//prices[0]\\n            if survive(i, j, k):\\n                return budget - 1\\n    return budget + 1\\n\\ndef survive(i, j, k):\\n    #nonlocal y, m, p, penumsorted\\n    toadd = [i, j, k]\\n    newy = list(y)\\n    newmhp = m[0]\\n    for i, item in enumerate(penumsorted):\\n        newy[item[0]] = y[item[0]] + toadd[i]\\n    #print(vars())\\n    while newy[0] > 0 and newmhp > 0:\\n        oldmhp = newmhp;\\n        newy[0] -= max(0, m[1] - newy[2])\\n        newmhp -= max(0, newy[1] - m[2])\\n        if oldmhp == newmhp:\\n            newy[0] = 0\\n    if newmhp <= 0 and newy[0] > 0:\\n        return True\\n    else:\\n        return False\\n\\ny = list(map(int, input().split()))\\nm = list(map(int, input().split()))\\np = list(map(int, input().split()))\\npsorted = sorted(p)\\npenum = list(enumerate(p))\\npenumsorted = sorted(penum, key=itemgetter(1))\\nprint(bin_search(0, 20000, lambda x: key_func(x, psorted)))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"I=lambda:list(map(int,input().split()))\\nR=list(range(999))\\nq,w,e=I()\\nr,t,y=I()\\na,b,c=I()\\nprint(min(i*b+j*c+max(0,(r//(w+i-y)+bool(r%(w+i-y)))*(t-e-j)-q+1)*a for i in R for j in R if w+i>y))\\n\", \"import math\\nhpy, atky, defy = list(map(int, input().split()))\\nhpm, atkm, defm = list(map(int, input().split()))\\nh,a,d = list(map(int, input().split()))\\n\\n\\nans = math.inf\\nfor i in range(defy, 101):\\n    for j in range(max(atky, defm+1), 201):\\n        xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))\\n        hh = max(xx+1, hpy)\\n        ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)\\n\\nif ans >= math.inf:\\n    print(0)\\nelse:\\n    print(ans)\\n        \\n\\n\", \"R=lambda:list(map(int,input().split()))\\n\\nyH,yA,yD=R()\\n\\nmH,mA,mD=R()\\n\\nh,a,d=R()\\n\\nQ=10**20\\n\\nfor A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):\\n\\n for D in range(max(0,mA-yD)+1):\\n\\n  H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)\\n\\n  Q=min(A*a+D*d+max(0,h*(1-H)),Q)\\n\\nprint(Q)\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"import math\\nimport sys\\nfrom bisect import bisect_right, bisect_left\\nfrom collections import Counter, defaultdict\\nfrom heapq import heappop, heappush\\nfrom itertools import accumulate\\nfrom sys import stdout\\n\\nR = lambda: map(int, input().split())\\nhy, ay, dy = R()\\nhm, am, dm = R()\\nch, ca, cd = R()\\nres = math.inf\\nfor ayp in range(1000):\\n    if ay + ayp > dm:\\n        k = (hm + ay + ayp - dm - 1) // (ay + ayp - dm)\\n        for dyp in range(1000):\\n            hyp = max(0, k * max(0, am - dy - dyp) - hy + 1)\\n            res = min(res, hyp * ch + dyp * cd + ayp * ca)\\nprint(res)\", \"hy, ay, dy = map(int, input().split())\\nhm, am, dm = map(int, input().split())\\nh, a, d = map(int, input().split())\\ns = 1 << 30\\nfor da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):\\n    for dd in range(max(0, am - dy) + 1):\\n        dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))\\n        s = min(s, h * dh + a * da + d * dd)\\nprint(s)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\", \"import math\\nx, y, z = map(int, input().split())\\na, b, c = map(int, input().split())\\ns, rs, ls = map(int, input().split())\\ndef rec(ss):\\n    for i in range(0, 205, 1):\\n        for j in range(0, 105, 1):\\n            if(i * rs + j * ls <= ss):\\n                q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))\\n                an1 = 1000000000000.0;an2 = 1000000000000.0\\n                if(b - p > 0):\\n                    an1 = math.ceil(((float) (pq)) / ((float)(b - p)))\\n                if(q - c > 0):\\n                    an2 = math.ceil(((float) (a)) / ((float)(q - c)))\\n                if(q > c and p >= b or an1 > an2):\\n                    return True\\n    return False\\nst = 0; en = 100000; mid = 0\\nwhile(st <= en):\\n    mid = (int)((st + en) / 2)\\n    if(rec(mid) == True):\\n        en = mid - 1\\n    else:\\n        st = mid + 1\\nprint(en + 1)\"]",
        "difficulty": "competition",
        "input": "100 1 1\n100 100 100\n1 100 100\n",
        "output": "11791\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/487/A"
    },
    {
        "id": 935,
        "task_id": 3862,
        "test_case_id": 33,
        "question": "Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration $\\frac{a_{i}}{1000}$. Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration $\\frac{n}{1000}$. The drink should also be tasty, so the glass can contain only integer number of liters of each Coke type (some types can be not presented in the glass). Also, they want to minimize the total volume of Coke in the glass.\n\nCarbon dioxide concentration is defined as the volume of carbone dioxide in the Coke divided by the total volume of Coke. When you mix two Cokes, the volume of carbon dioxide sums up, and the total volume of Coke sums up as well.\n\nHelp them, find the minimal natural number of liters needed to create a glass with carbon dioxide concentration $\\frac{n}{1000}$. Assume that the friends have unlimited amount of each Coke type.\n\n\n-----Input-----\n\nThe first line contains two integers n, k (0 ≤ n ≤ 1000, 1 ≤ k ≤ 10^6) — carbon dioxide concentration the friends want and the number of Coke types.\n\nThe second line contains k integers a_1, a_2, ..., a_{k} (0 ≤ a_{i} ≤ 1000) — carbon dioxide concentration of each type of Coke. Some Coke types can have same concentration.\n\n\n-----Output-----\n\nPrint the minimal natural number of liter needed to prepare a glass with carbon dioxide concentration $\\frac{n}{1000}$, or -1 if it is impossible.\n\n\n-----Examples-----\nInput\n400 4\n100 300 450 500\n\nOutput\n2\n\nInput\n50 2\n100 25\n\nOutput\n3\n\n\n\n-----Note-----\n\nIn the first sample case, we can achieve concentration $\\frac{400}{1000}$ using one liter of Coke of types $\\frac{300}{1000}$ and $\\frac{500}{1000}$: $\\frac{300 + 500}{1000 + 1000} = \\frac{400}{1000}$.\n\nIn the second case, we can achieve concentration $\\frac{50}{1000}$ using two liters of $\\frac{25}{1000}$ type and one liter of $\\frac{100}{1000}$ type: $\\frac{25 + 25 + 100}{3 \\cdot 1000} = \\frac{50}{1000}$.",
        "solutions": "[\"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\", \"##\\n##\\n##\\nimport sys\\ndef line():\\n    return sys.stdin.readline()\\n\\ndef numbers():\\n    return list(map(int, line().split()))\\n\\ndef number():\\n    return int(line())\\n\\nadjlist = {}\\nn, k = 0, 0\\nmark = [False]*2010\\nedges = [False]*1010\\n\\n# bfs for \\\"ssph\\\"\\ndef bfs(s):\\n    \\n    i = 0\\n    frontier = [s]\\n    while frontier:\\n\\n        if mark[s]:\\n            break;\\n\\n        next_frontier = []\\n        for u in frontier:\\n\\n            # check next state\\n            for v, isState in enumerate(edges):\\n                if isState:\\n                    # check new node\\n                    state = u + (n - 1000) - v\\n\\n                    if state >= 0 and state <= 2000 and not mark[state]:\\n                        mark[state] = True\\n                        next_frontier.append(state)\\n\\n        frontier = next_frontier\\n        i += 1\\n\\n    if mark[s]:\\n        return i\\n    else:\\n        return -1\\n\\n# main program\\n[n, k] = numbers()\\nconcentrations = numbers()\\n\\n# reading edges\\nfor x in concentrations:\\n    edges[x] = True\\n\\nn = n + 1000\\nans = bfs(1000)\\nprint(ans)\\n\\n# 1496438704903\\n\\n\\n\\n\\n# Made By Mostafa_Khaled\\n\", \"from collections import deque\\n\\nMAX_A = 1000\\n     \\n     \\ndef main():\\n    n, k = map(int, input().split())\\n    a = set(int(x) - n for x in input().split())\\n     \\n    visited = [False] * (2 * MAX_A + 1)\\n    visited[n] = True\\n    Q = deque()\\n    Q.append((n, 0))\\n     \\n    result = None\\n    while Q:\\n        u, l = Q.popleft()\\n        l += 1\\n        for ai in a:\\n            v = u + ai\\n            if v == n:\\n                result = l\\n                break\\n            if 0 <= v < len(visited) and not visited[v]:\\n                visited[v] = True\\n                Q.append((v, l))\\n     \\n        if result is not None:\\n            break\\n     \\n    if result is None:\\n        result = -1\\n     \\n    print(result)\\n     \\n     \\ndef __starting_point():\\n    # import sys\\n    # sys.stdin = open(\\\"E.txt\\\")\\n    main()\\n__starting_point()\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nd = set(int(x)-n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for i in d:\\n    \\tif i + u == 0:\\n    \\t\\t\\n    \\t\\tans = dist[u] + 1\\n    \\t\\tfound = True\\n    \\t\\tbreak     \\n    \\tif i + u <= 1000 and i + u >= -1000 and not visited[i + u]:\\n    \\t\\tvisited[i + u] = True\\n    \\t\\tdist[i + u] = dist[u] + 1\\n    \\t\\tq.append(i + u)\\n    \\n    if found:\\n    \\tbreak\\n    \\nprint (ans)\\n\\n\", \"from collections import deque\\nn, k = list(map(int, input().split()))\\nconc = set(int(x) - n for x in input().split())\\n     \\nq = deque()\\nq.append(0)\\n     \\nvisited = {i : False for i in range(-1000, 1001)}\\ndist = {i : 0 for i in range(-1000, 1001)}\\n        \\nans = -1\\nvisited[0] = True\\nfound = False\\nwhile q:\\n    u = q.popleft()\\n    for c in conc:\\n        v = c + u\\n        if v == 0:\\n            ans=dist[u]+1\\n            found=True\\n            break\\n        if v<=1000 and v>=-1000 and not visited[v]:\\n            visited[v]=True\\n            dist[v]=dist[u]+1\\n            q.append(v)\\n    if found:\\n    \\tbreak\\n    \\nprint(ans)\\n\\n\"]",
        "difficulty": "competition",
        "input": "499 2\n0 1000\n",
        "output": "1000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/788/C"
    },
    {
        "id": 936,
        "task_id": 4207,
        "test_case_id": 6,
        "question": "You are given two arrays $a$ and $b$, each contains $n$ integers.\n\nYou want to create a new array $c$ as follows: choose some real (i.e. not necessarily integer) number $d$, and then for every $i \\in [1, n]$ let $c_i := d \\cdot a_i + b_i$.\n\nYour goal is to maximize the number of zeroes in array $c$. What is the largest possible answer, if you choose $d$ optimally?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of elements in both arrays.\n\nThe second line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ ($-10^9 \\le a_i \\le 10^9$).\n\nThe third line contains $n$ integers $b_1$, $b_2$, ..., $b_n$ ($-10^9 \\le b_i \\le 10^9$).\n\n\n-----Output-----\n\nPrint one integer — the maximum number of zeroes in array $c$, if you choose $d$ optimally.\n\n\n-----Examples-----\nInput\n5\n1 2 3 4 5\n2 4 7 11 3\n\nOutput\n2\n\nInput\n3\n13 37 39\n1 2 3\n\nOutput\n2\n\nInput\n4\n0 0 0 0\n1 2 3 4\n\nOutput\n0\n\nInput\n3\n1 2 -1\n-6 -12 6\n\nOutput\n3\n\n\n\n-----Note-----\n\nIn the first example, we may choose $d = -2$.\n\nIn the second example, we may choose $d = -\\frac{1}{13}$.\n\nIn the third example, we cannot obtain any zero in array $c$, no matter which $d$ we choose.\n\nIn the fourth example, we may choose $d = 6$.",
        "solutions": "[\"import collections\\nimport math\\ninput()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\ncounts = collections.defaultdict(int)\\narbitrary = 0\\nfor ai, bi in zip(a, b):\\n    if ai == 0:\\n        if bi == 0:\\n            arbitrary += 1\\n    else:\\n        if bi == 0:\\n            counts[(0, 0)] += 1\\n        else:\\n            if (ai < 0 and bi < 0) or (ai >= 0 and bi < 0):\\n                ai = -ai\\n                bi = -bi\\n\\n            g = math.gcd(-bi, ai)\\n            counts[(-bi // g, ai // g)] += 1\\n\\nif counts:\\n    print(max(counts.values()) + arbitrary)\\nelse:\\n    print(arbitrary)\\n\", \"import collections\\nimport math\\n\\nn = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\n\\narb = 0\\n\\ncounts = collections.defaultdict(int)\\n\\nfor x, y in zip(a, b):\\n    if x==0:\\n        if y==0:\\n            arb+=1\\n    else:\\n        if y==0:\\n            counts[(0, 0)] += 1\\n        else:\\n            if x<0 and y<0:\\n                x=-x\\n                y=-y\\n            elif x<0 and y>=0:\\n                x=-x\\n                y=-y\\n            g = math.gcd(x, -y)\\n            counts[(-y//g, x//g)] += 1\\n\\nif counts:\\n    print(max(counts.values()) + arb)\\nelse:\\n    print(arb)\", \"#!/usr/bin/pypy\\n# -*- coding: utf-8 -*-\\n\\nfrom collections import defaultdict\\n\\n\\ndef gcd(a, b):\\n    if a % b == 0:\\n        return b\\n    return gcd(b, a % b)\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(map(int, input().split()))\\n    b = list(map(int, input().split()))\\n\\n    e = defaultdict(int)\\n    cnt = 0\\n\\n    for i in range(n):\\n        if a[i] == 0:\\n            if b[i] == 0:\\n                cnt += 1\\n            continue\\n        if b[i] == 0:\\n            e[(0, 0)] += 1\\n            continue\\n        w = gcd(a[i], b[i])\\n        wa = a[i] / w\\n        wb = b[i] / w\\n        e[(wa, wb)] += 1\\n\\n    ans = 0\\n    for i in list(e.values()):\\n        ans = max(ans, i)\\n\\n    print(cnt + ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from math import gcd\\n\\n\\nn = int(input())\\n\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\n\\nd = {}\\nw = 0\\nfor i in range(n):\\n\\tif a[i] != 0:\\n\\t\\tc = gcd(abs(a[i]), abs(b[i]))\\n\\t\\tz = 1\\n\\t\\tif a[i] * b[i] < 0:\\n\\t\\t\\tz = -1\\n\\t\\td[(abs(b[i]) // c, abs(a[i]) // c, z)] = d.get((abs(b[i]) // c, abs(a[i]) // c, z), 0) + 1\\n\\telse:\\n\\t\\tif b[i] == 0:\\n\\t\\t\\tw += 1\\nmx = 0\\n#print(d)\\nfor c in d:\\n\\tx = d[c]\\n\\t\\n\\tif x > mx:\\n\\t\\tmx = x\\nprint(int(mx) + w)\\n\", \"n=int(input())\\nA=list(map(int,input().split()))\\nB=list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    while b:\\n        a, b = b, a % b\\n    return a\\n\\nD=[]\\nANS=0\\nfor i in range(n):\\n    if A[i]==0 and B[i]==0:\\n        ANS+=1\\n    elif A[i]==0 and B[i]!=0:\\n        continue\\n    elif A[i]!=0 and B[i]==0:\\n        D.append(0)\\n    else:\\n        D.append((A[i]//gcd(A[i],B[i]),B[i]//gcd(A[i],B[i])))\\n\\nfrom collections import Counter\\nC=Counter(D)\\n\\nif len(C)==0:\\n    print(ANS)\\nelse:\\n    print(ANS+max(C.values()))\\n    \\n\", \"from decimal import Decimal as mag, getcontext\\n\\ngetcontext().prec = 100\\n\\ndef main():\\n    n = int(input())\\n    arr = list(map(mag, input().split()))\\n    brr = list(map(mag, input().split()))\\n    mp = dict()\\n    mp[0] = 0\\n    pl = 0\\n    for i in range(n):\\n        if (arr[i] == 0 and brr[i] == 0):\\n            pl += 1\\n        if arr[i] == 0:\\n            continue\\n        k = - brr[i] / arr[i]\\n        mp[k] = mp.get(k, 0) + 1\\n    print(pl + max(mp.values()))\\n\\n\\nmain()\\n\", \"import math\\n\\nn = int(input())\\n\\nA = [int(x) for x in input().split()]\\n\\nB = [int(x) for x in input().split()]\\n\\nD = {0:0}\\nfree = 0\\n\\nfor i in range(n):\\n    if A[i] == 0:\\n        if B[i] == 0:\\n            free += 1\\n    elif B[i] == 0:\\n        D[0] += 1\\n    else:\\n        t = math.gcd(A[i],B[i])\\n        a = A[i]//t\\n        b = B[i]//t\\n        if a < 0 and b < 0: \\n            if (-a,-b) in D:\\n                D[(-a,-b)] += 1\\n            else:\\n                D[(-a,-b)] = 1\\n        elif a > 0 and b <0:\\n            if (a,b) in D:\\n                D[(a,b)] += 1\\n            else:\\n                D[(a,b)] = 1\\n        elif a < 0 and b > 0:\\n            if (-a,-b) in D:\\n                D[(-a,-b)] += 1\\n            else:\\n                D[(-a,-b)] = 1\\n        else:\\n            if (a,b) in D:\\n                D[(a,b)] += 1\\n            else:\\n                D[(a,b)] = 1\\n            \\n            \\nprint(max(D.values())+free)\\n\", \"import math\\n\\nn=int(input())\\nx=[*map(int,input().split())]\\ny=[*map(int,input().split())]\\ncnt=dict()\\nfixcnt=0\\nzeroToCnt=0\\n\\nfor i in range(n):\\n    if x[i]==0:\\n        if y[i]==0: fixcnt+=1\\n        continue\\n    if y[i]==0:\\n        zeroToCnt+=1\\n        continue\\n    gc=math.gcd(x[i],y[i])\\n    tx,ty=x[i]//gc,y[i]//gc\\n    if tx*ty>=0: si=True\\n    else: si=False\\n    cnt[(abs(tx),abs(ty),si)]=cnt.get((abs(tx),abs(ty),si),0)+1\\n\\ncntRes=max(zeroToCnt,max(cnt.values() if cnt else [0]))\\nprint(cntRes+fixcnt)\", \"import math\\n\\ndef reduce_fraction(n,m):\\n    k = math.gcd(n,m)\\n    if (n > 0 and m < 0) or (n < 0 and m < 0):\\n        n = -n\\n        m = -m\\n\\n    if n == 0 and m < 0:\\n        m *= -1\\n        \\n    return (n//k, m//k)\\n\\nn = int(input())\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nd = {}\\n\\ns = 0\\n\\nfor i in range(n):\\n    if a[i] != 0:\\n        x = reduce_fraction(b[i],a[i])\\n\\n        if x in d:\\n            d[x] += 1\\n        else:\\n            d[x] = 1\\n            \\n    else:\\n        if b[i] == 0:\\n            s += 1\\n            \\nmaxs = 0\\n\\nfor i in d:\\n    maxs = max(maxs,d[i])\\n\\nprint(maxs + s)\\n\", \"n=int(input().strip())\\nfrom fractions import gcd\\na=list(map(int,input().strip().split(\\\" \\\")))\\nb=list(map(int,input().strip().split(\\\" \\\")))\\nd={}\\nt=0\\nfor i in range(0,len(a)):\\n    if( b[i]==0 and a[i]!=0):\\n        if(\\\"x\\\" not in d.keys()):\\n            d[\\\"x\\\"]=1\\n        else:\\n            d[\\\"x\\\"]+=1\\n    elif (a[i] == 0  and b[i]==0 ):\\n        d[\\\"m\\\"]=0\\n        t+=1\\n    elif(a[i]==0 and b[i]!=0):\\n        d[\\\"y\\\"]=0\\n    else:\\n        p=gcd(a[i],b[i])\\n        x=a[i]//p\\n        y=b[i]//p\\n        if(y<0):\\n            y=-y\\n            x=-x\\n        if ((x,y) not in d.keys()):\\n            d[(x,y)] = 1\\n        else:\\n            d[(x,y)] += 1\\nprint(max(d.values())+t)\", \"from collections import defaultdict\\nfrom math import gcd\\nn=int(input())\\na=list(map(int,input().split()))\\nb=list(map(int,input().split()))\\nl=defaultdict(int)\\nan=0\\nfor i in range(n):\\n    if a[i]==0 and b[i]==0:an+=1\\n    elif a[i]!=0:\\n        x,y=(-b[i]//gcd(-b[i],a[i]),a[i]//gcd(-b[i],a[i]))\\n        if x<0:\\n            x*=-1;y*=-1\\n        if x==0:\\n            y=0\\n\\n        l[(x,y)]+=1\\n#print(l)\\nprint((sorted(l.values())[-1] if len(l)>0 else 0)+an)\\n\", \"import math\\nimport collections\\n\\nn= int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nz = list(zip(a,b))\\nzz = []\\ndoublezeros = 0\\nfor idx, t in enumerate(z):\\n    if t[0] == 0 and t[1] != 0:\\n        continue\\n    if t[0] == 0 and t[1] == 0:\\n        doublezeros += 1\\n        continue\\n    if t[0] != 0 and t[1] == 0:\\n        zz.append((1,0))\\n        continue\\n    gcd = math.gcd(t[0], t[1])\\n    f = 1 if t[0] > 0 else -1\\n    zz.append((t[0] // gcd * f,    t[1] // gcd*f))\\nd = collections.defaultdict(int)\\nfor t in zz:\\n    d[t] += 1\\nr = max(d.values()) if len(d) > 0 else 0\\nprint(r+doublezeros)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\n\\ncands = {}\\naux = 0\\nzero = 0\\n\\ndef gcd(x, y):\\n    if x % y == 0:\\n        return y\\n    return gcd(y, x % y)\\n\\nfor i in range(n):\\n    if b[i] == 0 and a[i] == 0:\\n        aux += 1\\n    elif a[i] != 0:\\n\\n        if a[i] < 0:\\n            a_semn = -1\\n            a[i] = -a[i]\\n        else:\\n            a_semn = +1\\n\\n        if b[i] < 0:\\n            b_semn = -1\\n            b[i] = -b[i]\\n        else:\\n            b_semn = +1\\n\\n        if b[i] != 0:\\n            cmmdc = gcd(a[i], b[i])\\n            a_redus = a[i] // cmmdc\\n            b_redus = b[i] // cmmdc\\n        else:\\n            a_redus = a[i]\\n            b_redus = b[i]\\n            zero += 1\\n\\n        c_semn = a_semn * b_semn\\n\\n        cands[(a_redus, b_redus, c_semn)] = cands.get((a_redus, b_redus, c_semn), 0) + 1\\n\\ncmax = 0\\nfor i in cands:\\n    if cands[i] > cmax:\\n        cmax = cands[i]\\n\\nprint(aux + max(cmax, zero))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/3/7 23:32\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Zero Quantity Maximization.py\\n\\nimport math\\nfrom collections import Counter\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(map(int, input().split()))\\n    b = list(map(int, input().split()))\\n\\n    counter = Counter()\\n    zero = 0\\n    for i in range(n):\\n        if a[i] == 0 and b[i] == 0:\\n                zero += 1\\n        elif a[i] != 0 and b[i] == 0:\\n            counter[0] += 1\\n        elif a[i] != 0 and b[i] != 0:\\n            g = math.gcd(a[i], b[i])\\n            x, y = a[i] // g, b[i] // g,\\n            mask = (x * y) > 0\\n            counter[(mask, abs(x), abs(y))] += 1\\n\\n    ret = 0\\n    for k, v in list(counter.items()):\\n        ret = max(ret, v)\\n    print(ret + zero)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"'''input\\n3\\n1 2 -1\\n-6 -12 6\\n'''\\nimport sys\\nfrom collections import defaultdict as dd\\nfrom itertools import  permutations as pp\\nfrom itertools import combinations as cc\\nfrom collections import Counter as ccd\\nfrom random import randint as rd\\nfrom bisect import bisect_left as bl\\nimport heapq\\nmod=10**9+7\\n\\ndef ri(flag=0):\\n\\tif flag==0:\\n\\t\\treturn [int(i) for i in sys.stdin.readline().split()]\\n\\telse:\\n\\t\\treturn int(sys.stdin.readline())\\n\\n\\nn=ri(1)\\na=ri()\\nb=ri()\\n\\nk=dd(int)\\n\\nfrom math import gcd\\n\\n# for i in range(n):\\n# \\tif a[i]!=0:\\n# \\t\\ttemp=(b[i]*pow(a[i],mod-2,mod))%mod\\n# \\t\\tk[temp]+=1\\n# \\tif a[i]==0 and b[i]==0:\\n# \\t\\tk[0]+=1\\n\\n\\nk[0,0,0]=0\\nfor i in range(n):\\n\\tok=gcd(a[i],b[i])\\n\\tf=0\\n\\tif a[i]!=0 and b[i]!=0:\\n\\t\\tone=a[i]//ok\\n\\t\\ttwo=b[i]//ok\\n\\t\\tf=f^(one<0)\\n\\t\\tf=f^(two<0)\\n\\t\\tone=abs(one)\\n\\t\\ttwo=abs(two)\\n\\t\\tif one!=0:\\n\\t\\t\\tk[one,two,f]+=1\\n\\tif a[i]!=0 and b[i]==0:\\n\\t\\tpass\\n\\tif a[i]==0 and b[i]==0:\\n\\t\\tk[0,0,0]+=1\\n\\nans=b.count(0)\\n\\n\\nfor i in k:\\n\\tif i==(0,0,0):\\n\\t\\tans=max(ans,k[i])\\n\\telse:\\n\\t\\tans=max(ans,k[0,0,0]+k[i])\\nprint(ans)\", \"from collections import defaultdict\\n\\n\\ndef gcd(a, b):\\n  while b:\\n    a, b = b, a % b\\n  return a\\n\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\nx = defaultdict(int)\\np = 0\\nfor i in range(n):\\n    if a[i] == 0 and b[i] == 0:\\n        p += 1\\n    elif a[i] != 0:\\n        if a[i] * b[i] < 0:\\n            z = 0\\n        else:\\n            z = 1\\n        v = gcd(abs(a[i]), abs(b[i]))\\n        x[(z, abs(a[i]) // v, abs(b[i]) // v)] += 1\\nif len(x) > 0:\\n    print(max(x.values()) + p)\\nelse:\\n    print(p)\\n\", \"def gcd(a, b):\\n    while b:\\n        a, b = b, a % b\\n    return a\\n\\n\\nn = int(input())\\na = [int(item) for item in input().split()]\\nb = [int(item) for item in input().split()]\\n\\npre = 0\\nfor ai, bi in zip(a, b):\\n    if (ai, bi) == (0, 0):\\n        pre += 1\\n\\nfracs = [(-bi // gcd(ai, bi), ai // gcd(ai, bi)) if ai\\n         != 0 else float('inf') for ai, bi in zip(a, b)]\\n\\ncnt = {item: 0 for item in fracs}\\n\\nfor x in fracs:\\n    if x != float('inf'):\\n        cnt[x] += 1\\n\\nprint(max(cnt.values()) + pre)\\n\", \"from fractions import Fraction\\n\\nn = int(input())\\na = list(map(int, input().strip().split()))\\nb = list(map(int, input().strip().split()))\\n\\nextra_count = 0\\ncounts_map = dict()\\n# counts_map_2 = dict()\\nfor ai, bi in zip(a, b):\\n    # print(ai, bi)\\n    if ai != 0:\\n        fi = Fraction(-1 * bi, ai)\\n        # print(fi)\\n\\n        num_i = fi.numerator\\n        den_i = fi.denominator\\n\\n        # print(num_i, den_i)\\n\\n        curr_str = str(num_i) + '#' + str(den_i)\\n\\n        if curr_str in counts_map:\\n            counts_map[curr_str] += 1\\n        else:\\n            counts_map[curr_str] = 1\\n\\n        # print('\\\\n')\\n    else:\\n        if bi == 0:\\n            extra_count += 1\\n        else:\\n            pass\\n\\n\\n# print(counts_map)\\n\\nmax = 0\\nfor key in counts_map:\\n    curr_count = counts_map[key]\\n\\n    if curr_count > max:\\n        max = curr_count\\n\\nprint(max + extra_count)\", \"from decimal import *\\ngetcontext().prec = 50\\nn = int(input())\\ninputs= list(map(int,input().split()))\\ninputs1= list(map(int,input().split()))\\ndic={\\n}\\ntemp=0\\nfor i in range(len(inputs)):\\n    if inputs[i]==0 and inputs1[i]!=0:\\n        continue\\n    elif inputs[i]==0 and inputs1[i]==0:\\n        temp+=1\\n        continue\\n\\n    c=-Decimal(inputs1[i])/Decimal(inputs[i])\\n    if c in list(dic.keys()):\\n        dic[c]+=1\\n    else:\\n        dic[c]=1\\nif len(dic)>0:\\n    print(max(dic.values())+temp)\\nelse:\\n    print(0+temp)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nd = []\\ndef gsd(p, q):\\n    if q == 0:\\n        return p\\n    return gsd(q, p % q)\\nans0 = 0\\nfor i in range(n):\\n    if a[i] == 0:\\n        if b[i] == 0:\\n            ans0 += 1\\n        n -= 1\\n        i -= 1\\n        continue\\n    g = gsd(abs(a[i]), abs(b[i]))\\n    if a[i] * b[i] < 0:\\n        h = 1\\n    else:\\n        h = 0\\n    d.append([abs(b[i]) // g, abs(a[i]) // g, h])\\nd.sort()\\nbk = 0; k = 1\\nfor i in range(1, n):\\n    if d[i] == d[i - 1]:\\n        k += 1\\n    else:\\n        bk = max(k, bk)\\n        k = 1\\nif n != 0:\\n    bk = max(bk, k)\\nprint(bk + ans0)\\n#print(d)\\n\", \"from fractions import Fraction\\nimport collections\\nn = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nc = []\\nabzero = 0\\nbzero = 0\\nfor i in range(n):\\n    if a[i] == 0:\\n        if b[i] == 0:\\n            abzero += 1\\n    elif b[i] == 0:\\n        bzero += 1\\n    else:\\n        c.append(Fraction(a[i], b[i]).limit_denominator(1000000000))\\nc = collections.Counter(c)\\ntry:\\n    ma = c.most_common()[0][1]\\nexcept IndexError:\\n    ma = 0\\nprint(max(ma+abzero, abzero+bzero))\", \"from fractions import gcd\\nN=int(input())\\nA=list(map(int,input().split()))\\nB=list(map(int,input().split()))\\nc={}\\nq=0\\nfor i in range(N):\\n\\tif A[i]!=0:\\n\\t\\tif B[i]!=0:\\n\\t\\t\\tg=gcd(B[i],A[i])\\n\\t\\t\\tk=(B[i]//g,A[i]//g)\\n\\t\\telse:k=(0,0)\\n\\t\\tif k in c:c[k]+=1\\n\\t\\telse:c[k]=1\\n\\telse:\\n\\t\\tif B[i]==0:q+=1\\nif c:print(max(c.values())+q)\\nelse:print(q)\", \"from collections import Counter\\nfrom fractions import Fraction\\n\\nn = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\n\\nc = Counter()\\n\\nr = 0\\nfor i in range(n):\\n    if a[i] == 0 == b[i]:\\n        r+=1\\n        continue\\n\\n    if a[i]==0:\\n        continue\\n\\n    c[Fraction(b[i], a[i])] += 1\\n\\n#print(c)\\n\\nr += c.most_common(1)[0][1] if len(c) > 0 else 0\\n\\nprint(r)\"]",
        "difficulty": "introductory",
        "input": "2\n0 0\n0 0\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1133/D"
    },
    {
        "id": 937,
        "task_id": 4207,
        "test_case_id": 13,
        "question": "You are given two arrays $a$ and $b$, each contains $n$ integers.\n\nYou want to create a new array $c$ as follows: choose some real (i.e. not necessarily integer) number $d$, and then for every $i \\in [1, n]$ let $c_i := d \\cdot a_i + b_i$.\n\nYour goal is to maximize the number of zeroes in array $c$. What is the largest possible answer, if you choose $d$ optimally?\n\n\n-----Input-----\n\nThe first line contains one integer $n$ ($1 \\le n \\le 2 \\cdot 10^5$) — the number of elements in both arrays.\n\nThe second line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ ($-10^9 \\le a_i \\le 10^9$).\n\nThe third line contains $n$ integers $b_1$, $b_2$, ..., $b_n$ ($-10^9 \\le b_i \\le 10^9$).\n\n\n-----Output-----\n\nPrint one integer — the maximum number of zeroes in array $c$, if you choose $d$ optimally.\n\n\n-----Examples-----\nInput\n5\n1 2 3 4 5\n2 4 7 11 3\n\nOutput\n2\n\nInput\n3\n13 37 39\n1 2 3\n\nOutput\n2\n\nInput\n4\n0 0 0 0\n1 2 3 4\n\nOutput\n0\n\nInput\n3\n1 2 -1\n-6 -12 6\n\nOutput\n3\n\n\n\n-----Note-----\n\nIn the first example, we may choose $d = -2$.\n\nIn the second example, we may choose $d = -\\frac{1}{13}$.\n\nIn the third example, we cannot obtain any zero in array $c$, no matter which $d$ we choose.\n\nIn the fourth example, we may choose $d = 6$.",
        "solutions": "[\"import collections\\nimport math\\ninput()\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\ncounts = collections.defaultdict(int)\\narbitrary = 0\\nfor ai, bi in zip(a, b):\\n    if ai == 0:\\n        if bi == 0:\\n            arbitrary += 1\\n    else:\\n        if bi == 0:\\n            counts[(0, 0)] += 1\\n        else:\\n            if (ai < 0 and bi < 0) or (ai >= 0 and bi < 0):\\n                ai = -ai\\n                bi = -bi\\n\\n            g = math.gcd(-bi, ai)\\n            counts[(-bi // g, ai // g)] += 1\\n\\nif counts:\\n    print(max(counts.values()) + arbitrary)\\nelse:\\n    print(arbitrary)\\n\", \"import collections\\nimport math\\n\\nn = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\n\\narb = 0\\n\\ncounts = collections.defaultdict(int)\\n\\nfor x, y in zip(a, b):\\n    if x==0:\\n        if y==0:\\n            arb+=1\\n    else:\\n        if y==0:\\n            counts[(0, 0)] += 1\\n        else:\\n            if x<0 and y<0:\\n                x=-x\\n                y=-y\\n            elif x<0 and y>=0:\\n                x=-x\\n                y=-y\\n            g = math.gcd(x, -y)\\n            counts[(-y//g, x//g)] += 1\\n\\nif counts:\\n    print(max(counts.values()) + arb)\\nelse:\\n    print(arb)\", \"#!/usr/bin/pypy\\n# -*- coding: utf-8 -*-\\n\\nfrom collections import defaultdict\\n\\n\\ndef gcd(a, b):\\n    if a % b == 0:\\n        return b\\n    return gcd(b, a % b)\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(map(int, input().split()))\\n    b = list(map(int, input().split()))\\n\\n    e = defaultdict(int)\\n    cnt = 0\\n\\n    for i in range(n):\\n        if a[i] == 0:\\n            if b[i] == 0:\\n                cnt += 1\\n            continue\\n        if b[i] == 0:\\n            e[(0, 0)] += 1\\n            continue\\n        w = gcd(a[i], b[i])\\n        wa = a[i] / w\\n        wb = b[i] / w\\n        e[(wa, wb)] += 1\\n\\n    ans = 0\\n    for i in list(e.values()):\\n        ans = max(ans, i)\\n\\n    print(cnt + ans)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"from math import gcd\\n\\n\\nn = int(input())\\n\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\n\\nd = {}\\nw = 0\\nfor i in range(n):\\n\\tif a[i] != 0:\\n\\t\\tc = gcd(abs(a[i]), abs(b[i]))\\n\\t\\tz = 1\\n\\t\\tif a[i] * b[i] < 0:\\n\\t\\t\\tz = -1\\n\\t\\td[(abs(b[i]) // c, abs(a[i]) // c, z)] = d.get((abs(b[i]) // c, abs(a[i]) // c, z), 0) + 1\\n\\telse:\\n\\t\\tif b[i] == 0:\\n\\t\\t\\tw += 1\\nmx = 0\\n#print(d)\\nfor c in d:\\n\\tx = d[c]\\n\\t\\n\\tif x > mx:\\n\\t\\tmx = x\\nprint(int(mx) + w)\\n\", \"n=int(input())\\nA=list(map(int,input().split()))\\nB=list(map(int,input().split()))\\n\\ndef gcd(a, b):\\n    while b:\\n        a, b = b, a % b\\n    return a\\n\\nD=[]\\nANS=0\\nfor i in range(n):\\n    if A[i]==0 and B[i]==0:\\n        ANS+=1\\n    elif A[i]==0 and B[i]!=0:\\n        continue\\n    elif A[i]!=0 and B[i]==0:\\n        D.append(0)\\n    else:\\n        D.append((A[i]//gcd(A[i],B[i]),B[i]//gcd(A[i],B[i])))\\n\\nfrom collections import Counter\\nC=Counter(D)\\n\\nif len(C)==0:\\n    print(ANS)\\nelse:\\n    print(ANS+max(C.values()))\\n    \\n\", \"from decimal import Decimal as mag, getcontext\\n\\ngetcontext().prec = 100\\n\\ndef main():\\n    n = int(input())\\n    arr = list(map(mag, input().split()))\\n    brr = list(map(mag, input().split()))\\n    mp = dict()\\n    mp[0] = 0\\n    pl = 0\\n    for i in range(n):\\n        if (arr[i] == 0 and brr[i] == 0):\\n            pl += 1\\n        if arr[i] == 0:\\n            continue\\n        k = - brr[i] / arr[i]\\n        mp[k] = mp.get(k, 0) + 1\\n    print(pl + max(mp.values()))\\n\\n\\nmain()\\n\", \"import math\\n\\nn = int(input())\\n\\nA = [int(x) for x in input().split()]\\n\\nB = [int(x) for x in input().split()]\\n\\nD = {0:0}\\nfree = 0\\n\\nfor i in range(n):\\n    if A[i] == 0:\\n        if B[i] == 0:\\n            free += 1\\n    elif B[i] == 0:\\n        D[0] += 1\\n    else:\\n        t = math.gcd(A[i],B[i])\\n        a = A[i]//t\\n        b = B[i]//t\\n        if a < 0 and b < 0: \\n            if (-a,-b) in D:\\n                D[(-a,-b)] += 1\\n            else:\\n                D[(-a,-b)] = 1\\n        elif a > 0 and b <0:\\n            if (a,b) in D:\\n                D[(a,b)] += 1\\n            else:\\n                D[(a,b)] = 1\\n        elif a < 0 and b > 0:\\n            if (-a,-b) in D:\\n                D[(-a,-b)] += 1\\n            else:\\n                D[(-a,-b)] = 1\\n        else:\\n            if (a,b) in D:\\n                D[(a,b)] += 1\\n            else:\\n                D[(a,b)] = 1\\n            \\n            \\nprint(max(D.values())+free)\\n\", \"import math\\n\\nn=int(input())\\nx=[*map(int,input().split())]\\ny=[*map(int,input().split())]\\ncnt=dict()\\nfixcnt=0\\nzeroToCnt=0\\n\\nfor i in range(n):\\n    if x[i]==0:\\n        if y[i]==0: fixcnt+=1\\n        continue\\n    if y[i]==0:\\n        zeroToCnt+=1\\n        continue\\n    gc=math.gcd(x[i],y[i])\\n    tx,ty=x[i]//gc,y[i]//gc\\n    if tx*ty>=0: si=True\\n    else: si=False\\n    cnt[(abs(tx),abs(ty),si)]=cnt.get((abs(tx),abs(ty),si),0)+1\\n\\ncntRes=max(zeroToCnt,max(cnt.values() if cnt else [0]))\\nprint(cntRes+fixcnt)\", \"import math\\n\\ndef reduce_fraction(n,m):\\n    k = math.gcd(n,m)\\n    if (n > 0 and m < 0) or (n < 0 and m < 0):\\n        n = -n\\n        m = -m\\n\\n    if n == 0 and m < 0:\\n        m *= -1\\n        \\n    return (n//k, m//k)\\n\\nn = int(input())\\n\\na = list(map(int,input().split()))\\nb = list(map(int,input().split()))\\n\\nd = {}\\n\\ns = 0\\n\\nfor i in range(n):\\n    if a[i] != 0:\\n        x = reduce_fraction(b[i],a[i])\\n\\n        if x in d:\\n            d[x] += 1\\n        else:\\n            d[x] = 1\\n            \\n    else:\\n        if b[i] == 0:\\n            s += 1\\n            \\nmaxs = 0\\n\\nfor i in d:\\n    maxs = max(maxs,d[i])\\n\\nprint(maxs + s)\\n\", \"n=int(input().strip())\\nfrom fractions import gcd\\na=list(map(int,input().strip().split(\\\" \\\")))\\nb=list(map(int,input().strip().split(\\\" \\\")))\\nd={}\\nt=0\\nfor i in range(0,len(a)):\\n    if( b[i]==0 and a[i]!=0):\\n        if(\\\"x\\\" not in d.keys()):\\n            d[\\\"x\\\"]=1\\n        else:\\n            d[\\\"x\\\"]+=1\\n    elif (a[i] == 0  and b[i]==0 ):\\n        d[\\\"m\\\"]=0\\n        t+=1\\n    elif(a[i]==0 and b[i]!=0):\\n        d[\\\"y\\\"]=0\\n    else:\\n        p=gcd(a[i],b[i])\\n        x=a[i]//p\\n        y=b[i]//p\\n        if(y<0):\\n            y=-y\\n            x=-x\\n        if ((x,y) not in d.keys()):\\n            d[(x,y)] = 1\\n        else:\\n            d[(x,y)] += 1\\nprint(max(d.values())+t)\", \"from collections import defaultdict\\nfrom math import gcd\\nn=int(input())\\na=list(map(int,input().split()))\\nb=list(map(int,input().split()))\\nl=defaultdict(int)\\nan=0\\nfor i in range(n):\\n    if a[i]==0 and b[i]==0:an+=1\\n    elif a[i]!=0:\\n        x,y=(-b[i]//gcd(-b[i],a[i]),a[i]//gcd(-b[i],a[i]))\\n        if x<0:\\n            x*=-1;y*=-1\\n        if x==0:\\n            y=0\\n\\n        l[(x,y)]+=1\\n#print(l)\\nprint((sorted(l.values())[-1] if len(l)>0 else 0)+an)\\n\", \"import math\\nimport collections\\n\\nn= int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\nz = list(zip(a,b))\\nzz = []\\ndoublezeros = 0\\nfor idx, t in enumerate(z):\\n    if t[0] == 0 and t[1] != 0:\\n        continue\\n    if t[0] == 0 and t[1] == 0:\\n        doublezeros += 1\\n        continue\\n    if t[0] != 0 and t[1] == 0:\\n        zz.append((1,0))\\n        continue\\n    gcd = math.gcd(t[0], t[1])\\n    f = 1 if t[0] > 0 else -1\\n    zz.append((t[0] // gcd * f,    t[1] // gcd*f))\\nd = collections.defaultdict(int)\\nfor t in zz:\\n    d[t] += 1\\nr = max(d.values()) if len(d) > 0 else 0\\nprint(r+doublezeros)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\n\\ncands = {}\\naux = 0\\nzero = 0\\n\\ndef gcd(x, y):\\n    if x % y == 0:\\n        return y\\n    return gcd(y, x % y)\\n\\nfor i in range(n):\\n    if b[i] == 0 and a[i] == 0:\\n        aux += 1\\n    elif a[i] != 0:\\n\\n        if a[i] < 0:\\n            a_semn = -1\\n            a[i] = -a[i]\\n        else:\\n            a_semn = +1\\n\\n        if b[i] < 0:\\n            b_semn = -1\\n            b[i] = -b[i]\\n        else:\\n            b_semn = +1\\n\\n        if b[i] != 0:\\n            cmmdc = gcd(a[i], b[i])\\n            a_redus = a[i] // cmmdc\\n            b_redus = b[i] // cmmdc\\n        else:\\n            a_redus = a[i]\\n            b_redus = b[i]\\n            zero += 1\\n\\n        c_semn = a_semn * b_semn\\n\\n        cands[(a_redus, b_redus, c_semn)] = cands.get((a_redus, b_redus, c_semn), 0) + 1\\n\\ncmax = 0\\nfor i in cands:\\n    if cands[i] > cmax:\\n        cmax = cands[i]\\n\\nprint(aux + max(cmax, zero))\\n\", \"# -*- coding: utf-8 -*-\\n# @Time    : 2019/3/7 23:32\\n# @Author  : LunaFire\\n# @Email   : gilgemesh2012@gmail.com\\n# @File    : D. Zero Quantity Maximization.py\\n\\nimport math\\nfrom collections import Counter\\n\\n\\ndef main():\\n    n = int(input())\\n    a = list(map(int, input().split()))\\n    b = list(map(int, input().split()))\\n\\n    counter = Counter()\\n    zero = 0\\n    for i in range(n):\\n        if a[i] == 0 and b[i] == 0:\\n                zero += 1\\n        elif a[i] != 0 and b[i] == 0:\\n            counter[0] += 1\\n        elif a[i] != 0 and b[i] != 0:\\n            g = math.gcd(a[i], b[i])\\n            x, y = a[i] // g, b[i] // g,\\n            mask = (x * y) > 0\\n            counter[(mask, abs(x), abs(y))] += 1\\n\\n    ret = 0\\n    for k, v in list(counter.items()):\\n        ret = max(ret, v)\\n    print(ret + zero)\\n\\n\\ndef __starting_point():\\n    main()\\n\\n\\n__starting_point()\", \"'''input\\n3\\n1 2 -1\\n-6 -12 6\\n'''\\nimport sys\\nfrom collections import defaultdict as dd\\nfrom itertools import  permutations as pp\\nfrom itertools import combinations as cc\\nfrom collections import Counter as ccd\\nfrom random import randint as rd\\nfrom bisect import bisect_left as bl\\nimport heapq\\nmod=10**9+7\\n\\ndef ri(flag=0):\\n\\tif flag==0:\\n\\t\\treturn [int(i) for i in sys.stdin.readline().split()]\\n\\telse:\\n\\t\\treturn int(sys.stdin.readline())\\n\\n\\nn=ri(1)\\na=ri()\\nb=ri()\\n\\nk=dd(int)\\n\\nfrom math import gcd\\n\\n# for i in range(n):\\n# \\tif a[i]!=0:\\n# \\t\\ttemp=(b[i]*pow(a[i],mod-2,mod))%mod\\n# \\t\\tk[temp]+=1\\n# \\tif a[i]==0 and b[i]==0:\\n# \\t\\tk[0]+=1\\n\\n\\nk[0,0,0]=0\\nfor i in range(n):\\n\\tok=gcd(a[i],b[i])\\n\\tf=0\\n\\tif a[i]!=0 and b[i]!=0:\\n\\t\\tone=a[i]//ok\\n\\t\\ttwo=b[i]//ok\\n\\t\\tf=f^(one<0)\\n\\t\\tf=f^(two<0)\\n\\t\\tone=abs(one)\\n\\t\\ttwo=abs(two)\\n\\t\\tif one!=0:\\n\\t\\t\\tk[one,two,f]+=1\\n\\tif a[i]!=0 and b[i]==0:\\n\\t\\tpass\\n\\tif a[i]==0 and b[i]==0:\\n\\t\\tk[0,0,0]+=1\\n\\nans=b.count(0)\\n\\n\\nfor i in k:\\n\\tif i==(0,0,0):\\n\\t\\tans=max(ans,k[i])\\n\\telse:\\n\\t\\tans=max(ans,k[0,0,0]+k[i])\\nprint(ans)\", \"from collections import defaultdict\\n\\n\\ndef gcd(a, b):\\n  while b:\\n    a, b = b, a % b\\n  return a\\n\\n\\nn = int(input())\\na = [int(i) for i in input().split()]\\nb = [int(i) for i in input().split()]\\nx = defaultdict(int)\\np = 0\\nfor i in range(n):\\n    if a[i] == 0 and b[i] == 0:\\n        p += 1\\n    elif a[i] != 0:\\n        if a[i] * b[i] < 0:\\n            z = 0\\n        else:\\n            z = 1\\n        v = gcd(abs(a[i]), abs(b[i]))\\n        x[(z, abs(a[i]) // v, abs(b[i]) // v)] += 1\\nif len(x) > 0:\\n    print(max(x.values()) + p)\\nelse:\\n    print(p)\\n\", \"def gcd(a, b):\\n    while b:\\n        a, b = b, a % b\\n    return a\\n\\n\\nn = int(input())\\na = [int(item) for item in input().split()]\\nb = [int(item) for item in input().split()]\\n\\npre = 0\\nfor ai, bi in zip(a, b):\\n    if (ai, bi) == (0, 0):\\n        pre += 1\\n\\nfracs = [(-bi // gcd(ai, bi), ai // gcd(ai, bi)) if ai\\n         != 0 else float('inf') for ai, bi in zip(a, b)]\\n\\ncnt = {item: 0 for item in fracs}\\n\\nfor x in fracs:\\n    if x != float('inf'):\\n        cnt[x] += 1\\n\\nprint(max(cnt.values()) + pre)\\n\", \"from fractions import Fraction\\n\\nn = int(input())\\na = list(map(int, input().strip().split()))\\nb = list(map(int, input().strip().split()))\\n\\nextra_count = 0\\ncounts_map = dict()\\n# counts_map_2 = dict()\\nfor ai, bi in zip(a, b):\\n    # print(ai, bi)\\n    if ai != 0:\\n        fi = Fraction(-1 * bi, ai)\\n        # print(fi)\\n\\n        num_i = fi.numerator\\n        den_i = fi.denominator\\n\\n        # print(num_i, den_i)\\n\\n        curr_str = str(num_i) + '#' + str(den_i)\\n\\n        if curr_str in counts_map:\\n            counts_map[curr_str] += 1\\n        else:\\n            counts_map[curr_str] = 1\\n\\n        # print('\\\\n')\\n    else:\\n        if bi == 0:\\n            extra_count += 1\\n        else:\\n            pass\\n\\n\\n# print(counts_map)\\n\\nmax = 0\\nfor key in counts_map:\\n    curr_count = counts_map[key]\\n\\n    if curr_count > max:\\n        max = curr_count\\n\\nprint(max + extra_count)\", \"from decimal import *\\ngetcontext().prec = 50\\nn = int(input())\\ninputs= list(map(int,input().split()))\\ninputs1= list(map(int,input().split()))\\ndic={\\n}\\ntemp=0\\nfor i in range(len(inputs)):\\n    if inputs[i]==0 and inputs1[i]!=0:\\n        continue\\n    elif inputs[i]==0 and inputs1[i]==0:\\n        temp+=1\\n        continue\\n\\n    c=-Decimal(inputs1[i])/Decimal(inputs[i])\\n    if c in list(dic.keys()):\\n        dic[c]+=1\\n    else:\\n        dic[c]=1\\nif len(dic)>0:\\n    print(max(dic.values())+temp)\\nelse:\\n    print(0+temp)\\n\", \"n = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nd = []\\ndef gsd(p, q):\\n    if q == 0:\\n        return p\\n    return gsd(q, p % q)\\nans0 = 0\\nfor i in range(n):\\n    if a[i] == 0:\\n        if b[i] == 0:\\n            ans0 += 1\\n        n -= 1\\n        i -= 1\\n        continue\\n    g = gsd(abs(a[i]), abs(b[i]))\\n    if a[i] * b[i] < 0:\\n        h = 1\\n    else:\\n        h = 0\\n    d.append([abs(b[i]) // g, abs(a[i]) // g, h])\\nd.sort()\\nbk = 0; k = 1\\nfor i in range(1, n):\\n    if d[i] == d[i - 1]:\\n        k += 1\\n    else:\\n        bk = max(k, bk)\\n        k = 1\\nif n != 0:\\n    bk = max(bk, k)\\nprint(bk + ans0)\\n#print(d)\\n\", \"from fractions import Fraction\\nimport collections\\nn = int(input())\\na = list(map(int, input().split()))\\nb = list(map(int, input().split()))\\nc = []\\nabzero = 0\\nbzero = 0\\nfor i in range(n):\\n    if a[i] == 0:\\n        if b[i] == 0:\\n            abzero += 1\\n    elif b[i] == 0:\\n        bzero += 1\\n    else:\\n        c.append(Fraction(a[i], b[i]).limit_denominator(1000000000))\\nc = collections.Counter(c)\\ntry:\\n    ma = c.most_common()[0][1]\\nexcept IndexError:\\n    ma = 0\\nprint(max(ma+abzero, abzero+bzero))\", \"from fractions import gcd\\nN=int(input())\\nA=list(map(int,input().split()))\\nB=list(map(int,input().split()))\\nc={}\\nq=0\\nfor i in range(N):\\n\\tif A[i]!=0:\\n\\t\\tif B[i]!=0:\\n\\t\\t\\tg=gcd(B[i],A[i])\\n\\t\\t\\tk=(B[i]//g,A[i]//g)\\n\\t\\telse:k=(0,0)\\n\\t\\tif k in c:c[k]+=1\\n\\t\\telse:c[k]=1\\n\\telse:\\n\\t\\tif B[i]==0:q+=1\\nif c:print(max(c.values())+q)\\nelse:print(q)\", \"from collections import Counter\\nfrom fractions import Fraction\\n\\nn = int(input())\\na = [int(x) for x in input().split()]\\nb = [int(x) for x in input().split()]\\n\\nc = Counter()\\n\\nr = 0\\nfor i in range(n):\\n    if a[i] == 0 == b[i]:\\n        r+=1\\n        continue\\n\\n    if a[i]==0:\\n        continue\\n\\n    c[Fraction(b[i], a[i])] += 1\\n\\n#print(c)\\n\\nr += c.most_common(1)[0][1] if len(c) > 0 else 0\\n\\nprint(r)\"]",
        "difficulty": "introductory",
        "input": "2\n0 1000000000\n0 0\n",
        "output": "2\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1133/D"
    },
    {
        "id": 938,
        "task_id": 4521,
        "test_case_id": 2,
        "question": "There are $n$ points on a coordinate axis $OX$. The $i$-th point is located at the integer point $x_i$ and has a speed $v_i$. It is guaranteed that no two points occupy the same coordinate. All $n$ points move with the constant speed, the coordinate of the $i$-th point at the moment $t$ ($t$ can be non-integer) is calculated as $x_i + t \\cdot v_i$.\n\nConsider two points $i$ and $j$. Let $d(i, j)$ be the minimum possible distance between these two points over any possible moments of time (even non-integer). It means that if two points $i$ and $j$ coincide at some moment, the value $d(i, j)$ will be $0$.\n\nYour task is to calculate the value $\\sum\\limits_{1 \\le i < j \\le n}$ $d(i, j)$ (the sum of minimum distances over all pairs of points).\n\n\n-----Input-----\n\nThe first line of the input contains one integer $n$ ($2 \\le n \\le 2 \\cdot 10^5$) — the number of points.\n\nThe second line of the input contains $n$ integers $x_1, x_2, \\dots, x_n$ ($1 \\le x_i \\le 10^8$), where $x_i$ is the initial coordinate of the $i$-th point. It is guaranteed that all $x_i$ are distinct.\n\nThe third line of the input contains $n$ integers $v_1, v_2, \\dots, v_n$ ($-10^8 \\le v_i \\le 10^8$), where $v_i$ is the speed of the $i$-th point.\n\n\n-----Output-----\n\nPrint one integer — the value $\\sum\\limits_{1 \\le i < j \\le n}$ $d(i, j)$ (the sum of minimum distances over all pairs of points).\n\n\n-----Examples-----\nInput\n3\n1 3 2\n-100 2 3\n\nOutput\n3\n\nInput\n5\n2 1 4 3 5\n2 2 2 3 4\n\nOutput\n19\n\nInput\n2\n2 1\n-3 0\n\nOutput\n0",
        "solutions": "[\"\\ndef bitadd(a,w,bit):\\n \\n    x = a\\n    while x <= (len(bit)-1):\\n        bit[x] += w\\n        x += x & (-1 * x)\\n \\ndef bitsum(a,bit):\\n \\n    ret = 0\\n    x = a\\n    while x > 0:\\n        ret += bit[x]\\n        x -= x & (-1 * x)\\n    return ret\\n\\n\\nn = int(input())\\n\\nx = list(map(int,input().split()))\\nv = list(map(int,input().split()))\\n\\nvlis = []\\nfor i in v:\\n    vlis.append(i)\\nvlis.sort()\\nvdic = {}\\n\\nfor i in range(n):\\n    vdic[vlis[i]] = i+1\\n#print (vdic)\\n\\n\\n\\nxv = []\\nfor i in range(n):\\n    xv.append([x[i],v[i]])\\nxv.sort()\\n\\nans = 0\\nBIT = [0] * (n+1)\\nBIT2 = [0] * (n+1)\\nfor i in range(n):\\n\\n    x,v = xv[i]\\n\\n    ans += x * bitsum(vdic[v],BIT2) - bitsum(vdic[v],BIT)\\n    bitadd(vdic[v] , x , BIT)\\n    bitadd(vdic[v] , 1 , BIT2)\\n\\nprint (ans)\", \"\\nimport math\\nimport bisect\\n\\nclass Fenwick:\\n    def __init__(self, n):\\n        self.data = [[0,0] for i in range(n)] \\n    \\n    def update(self, pos, dist):\\n        while pos<len(self.data):\\n            self.data[pos][0] += 1\\n            self.data[pos][1] += dist\\n            pos = pos | (pos+1)\\n    \\n    def query(self, pos):\\n        ans = [0,0]\\n        while pos > 0:\\n            ans[0] += self.data[pos-1][0]\\n            ans[1] += self.data[pos-1][1]\\n            pos = pos & (pos-1)\\n        return ans\\n\\n\\ndef rints():\\n    return list(map(int,input().split()))\\n\\n\\nn = int(input())\\n\\nx = rints()\\nv = rints()\\n\\nascDist = list(range(n))\\nascDist.sort(key=lambda i: x[i])\\n\\nuniqueSpeeds = sorted(list(set(v)))\\n\\ntree = Fenwick(len(uniqueSpeeds))\\n\\n\\nans = 0\\nfor i in ascDist:\\n    speedId = bisect.bisect_left(uniqueSpeeds, v[i])\\n    count, dsum = tree.query(speedId+1)\\n    ans += count*x[i] - dsum\\n    tree.update(speedId, x[i])\\n\\nprint(ans)\\n\\n\", \"import sys\\ninput = sys.stdin.readline\\n\\nn=int(input())\\nX=list(map(int,input().split()))\\nV=list(map(int,input().split()))\\n\\nXV=[(X[i],V[i]) for i in range(n)]\\n\\n#compression_dict_x={a: ind for ind, a in enumerate(sorted(set(X)))}\\ncompression_dict_v={a: ind+2 for ind, a in enumerate(sorted(set(V)))}\\n\\nXV=[(XV[i][0], compression_dict_v[XV[i][1]]) for i in range(n)]\\nXV.sort(reverse=True)\\n\\nLEN=len(compression_dict_v)+3\\n\\nBIT1=[0]*(LEN+1)\\n\\ndef update1(v,w):\\n    while v<=LEN:\\n        BIT1[v]+=w\\n        v+=(v&(-v))\\n\\ndef getvalue1(v):\\n    ANS=0\\n    while v!=0:\\n        ANS+=BIT1[v]\\n        v-=(v&(-v))\\n    return ANS\\n\\nBIT2=[0]*(LEN+1)\\n\\ndef update2(v,w):\\n    while v<=LEN:\\n        BIT2[v]+=w\\n        v+=(v&(-v))\\n\\ndef getvalue2(v):\\n    ANS=0\\n    while v!=0:\\n        ANS+=BIT2[v]\\n        v-=(v&(-v))\\n    return ANS\\n\\nANS=0\\nfor x,v in XV:\\n    ANS+=(getvalue2(LEN)-getvalue2(v-1))-(getvalue1(LEN)-getvalue1(v-1))*x\\n    #print(getvalue2(LEN),getvalue2(v-1),getvalue1(LEN),getvalue1(v-1))\\n    #print(x,v,ANS)\\n\\n    update1(v,1)\\n    update2(v,x)\\n\\nprint(ANS)\\n\"]",
        "difficulty": "introductory",
        "input": "5\n2 1 4 3 5\n2 2 2 3 4\n",
        "output": "19\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://codeforces.com/problemset/problem/1311/F"
    },
    {
        "id": 939,
        "task_id": 4615,
        "test_case_id": 1,
        "question": "Snuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n - Operation 1: Pour 100A grams of water into the beaker.\n - Operation 2: Pour 100B grams of water into the beaker.\n - Operation 3: Put C grams of sugar into the beaker.\n - Operation 4: Put D grams of sugar into the beaker.\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\nSnuke will make sugar water with the highest possible density.\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\n-----Constraints-----\n - 1 \\leq A < B \\leq 30\n - 1 \\leq C < D \\leq 30\n - 1 \\leq E \\leq 100\n - 100A \\leq F \\leq 3 000\n - A, B, C, D, E and F are all integers.\n\n-----Inputs-----\nInput is given from Standard Input in the following format:\nA B C D E F\n\n-----Outputs-----\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\n-----Sample Input-----\n1 2 10 20 15 200\n\n-----Sample Output-----\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n - If we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n - If we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.",
        "solutions": "[\"a, b, c, d, e, f = map(int, input().split())\\ns = set()\\nfor i in range(30 // a + 1):\\n    for j in range(30 // b + 1):\\n        if 0 < (a * i + b * j) * 100 <= f:\\n            s = s | {a * i + b * j}\\ns2 = set()\\nfor i in range(3000 // c + 1):\\n    for j in range(3000 // d + 1):\\n        if c * i + d * j <= f:\\n            s2 = s2 | {c * i + d * j}\\nans = []\\nfor i in s:\\n    for j in s2:\\n        if i * 100 + j <= f and j <= i * e:\\n            ans.append([j / i * -1, i * 100 + j, j])\\nans.sort()\\nprint(ans[0][1], ans[0][2])\", \"A,B,C,D,E,F = map(int,input().split())\\n\\nconcentration = 0\\nans = [A*100,0]\\n\\nwater = []\\nfor a in range(F//(A*100) + 1):\\n  for b in range(((F-a*A*100)//(B*100))+1):\\n    water.append((a*A+b*B)*100)\\n    \\nwater = sorted(list(set(water)))\\n\\nsugar = []\\nfor c in range(F//C + 1):\\n  for d in range(((F - c*C)//D)+1):\\n    sugar.append(c*C+d*D)\\nsugar = sorted(list(set(sugar)))\\n\\n\\nfor wa in water:\\n  for su in sugar:\\n    if wa + su <= F:\\n      if su <= (wa/100)*E:\\n        if wa != 0:\\n          if concentration < su/(su+wa):\\n            concentration = su/(su+wa)\\n            ans = [su+wa,su]\\n\\nprint(\\\" \\\".join(map(str,ans)))\", \"A,B,C,D,E,F = map(int,input().split())\\nmx =- 1\\nS = set()\\nW = set()\\n\\nfor a in range(0,F+1,100*A):\\n  for b in range(0,F+1-a,100*B):\\n    W.add(a+b)\\n\\nfor c in range(0,F+1,C):\\n  for d in range(0,F+1-c,D):\\n    S.add(c+d)\\n\\nfor w in W:\\n  for s in S:\\n    if 0<w+s<=F and s<=w*E//100:\\n      if mx<s/(w+s):\\n        ans=w+s,s\\n        mx=s/(w+s)\\n\\nprint(ans[0],ans[1])\", \"a,b,c,d,e,f=map(int,input().split())\\nw=set()\\nfor i in range(0,f,100*a):\\n    for j in range(0,f,100*b):\\n        if i+j<=f:\\n            w.add(i+j)\\n        else:\\n            break\\ns=set()\\nfor i in range(0,f,c):\\n    for j in range(0,f,d):\\n        if i+j<=f:\\n            s.add(i+j)\\n        else:\\n            break\\nn=100*a\\nm=0\\nl=0\\nfor x in w:\\n    for t in s:\\n        if x+t!=0 and x+t<=f and 100*t<=e*x and t/(x+t)>l:\\n            n=x+t\\n            m=t\\n            l=t/(x+t)\\nprint(n,m)\", \"A,B,C,D,E,F = map(int,input().split())\\nmx =- 1\\nS = set()\\nW = set()\\n\\nfor a in range(0,F+1,100*A):\\n  for b in range(0,F+1-a,100*B):\\n    W.add(a+b)\\n\\nfor c in range(0,F+1,C):\\n  for d in range(0,F+1-c,D):\\n    S.add(c+d)\\n\\nfor w in W:\\n  for s in S:\\n    if 0<w+s<=F and s<=w*E//100:\\n      if mx<s/(w+s):\\n        ans=w+s,s\\n        mx=s/(w+s)\\n\\nprint(ans[0],ans[1])\", \"a, b, c, d, e, f = map(int, input().split())\\n\\nwater = [False] * (f//100 + 1)\\nfor i in range(0, len(water), a):\\n    water[i] = True\\nfor i in range(len(water) - b):\\n    if water[i]:\\n        water[i + b] = True\\n\\nsugar = [False] * ((f//100) * e + 1)\\nfor i in range(0, len(sugar), c):\\n    sugar[i] = True\\nfor i in range(len(sugar) - d):\\n    if sugar[i]:\\n        sugar[i + d] = True\\n\\n# denominator: \\u5206\\u6bcd, numerator: \\u5206\\u5b50\\ndeno = a * 100\\nnume = 0\\n\\nfor i in range(1, len(water)):\\n    if water[i]:\\n        j = min([i*e, f - 100*i])\\n        while not sugar[j]:\\n            j -= 1\\n        i = 100 * i + j\\n\\n        if nume * i < deno * j:\\n            deno = i\\n            nume = j\\n\\nprint(deno, nume)\", \"a, b, c, d, e, f = map(int, input().split())\\nW = set(); S = set()\\nsa = 0; wsa = a * 100\\nfor i in range(0, f + a * 100, a * 100):\\n    for j in range(0, f + b * 100, b * 100):\\n        w = i + j\\n        if w <= f:\\n            W.add(w)\\n        else:\\n            break\\nfor i in range(0, f // 2 + c, c):\\n    for j in range(0, f // 2 + d, d):\\n        s = i + j\\n        if s <= f // 2:\\n            S.add(s)\\n        else:\\n            break\\nS.remove(0)\\nfor i in W:\\n    for j in S:\\n        if e / (100 + e) >= j / (i + j) > sa / wsa and i + j <= f:\\n            sa, wsa = j, i + j\\nprint(wsa, sa)\", \"import bisect, heapq\\n\\na, b, c, d, e, f = map(int, input().split())\\n\\nw = set()\\ntemp = [a * i for i in range((30 - 1) // a + 2)]\\nfor i in temp:\\n    while i not in w and i <= 30:\\n        w.add(i)\\n        i += b\\nw = list(w)\\nw.remove(0)\\nw.sort()\\n\\ns = set()\\ntemp = [c * i for i in range((3000 - 1) // c + 2)]\\nfor i in temp:\\n    while i not in s and i <= 3000:\\n        s.add(i)\\n        i += d\\ns = list(s)\\ns.sort()\\n\\nqueue = []\\nheapq.heapify(queue)\\nfor i in w:\\n    if i * 100 > f:\\n        continue\\n    num = bisect.bisect(s, i * e)\\n    for j in range(num - 1, -1, -1):\\n        if i * 100 + s[j] > f:\\n            continue\\n        heapq.heappush(queue, [-s[j] / i, 100 * i + s[j], s[j]])\\n        break\\nprint(queue[0][1], queue[0][2])\", \"a, b, c, d, e, f = map(int, input().split())\\n\\nans = -1\\nans_water = -1\\nans_sugar = -1\\nfor ia in range(f//(a*100)+2):\\n    water = 100*a*ia\\n    if water > f or water == 0: continue\\n    for ib in range(f//(b*100)+2):\\n        if ib != 0: water += 100*b\\n        if water > f or water == 0: continue\\n        for ic in range(f//c+1):\\n            sugar = c*ic\\n            if sugar/(water//100) > e: continue\\n            for id in range(f//d+1):\\n                if id != 0: sugar+=d\\n                if sugar/(water//100) > e: continue\\n                if sugar + water > f: continue\\n                if (100*sugar)/(sugar+water) > ans:\\n                    ans = (100*sugar)/(sugar+water)\\n                    ans_water = water\\n                    ans_sugar = sugar\\nprint(ans_sugar+ans_water, ans_sugar)\", \"a,b,c,d,e,f=map(int,input().split())\\nans=[-1]*9999\\nans[a*100]=0\\nans[b*100]=0\\nfin=[a*100,0]\\np=0\\nfor i in range(1,f+1):\\n    if ans[i]==-1:\\n        continue\\n    if (ans[i]+c)/(i-ans[i])<=e*0.01:\\n        ans[i+c]=max(ans[i]+c,ans[i+c])\\n    if (ans[i]+d)/(i-ans[i])<=e*0.01:\\n        ans[i+d]=max(ans[i]+d,ans[i+d])\\n    ans[i+a*100]=max(ans[i+a*100],ans[i])\\n    ans[i+b*100]=max(ans[i+b*100],ans[i])\\n    if ans[i]/i>p:\\n        p=ans[i]/i\\n        fin=[i,ans[i]]\\nprint(*fin)\", \"a,b,c,d,e,f = map(int,input().split())\\nans = [-1]*10000\\n# ans[0] = 0\\nans[a*100] = 0\\nans[b*100] = 0\\nq1 = a*100\\nq2 = b*100\\np = 0\\nfin = [a*100,0]\\nfor i in range(1,f+1):\\n    if ans[i] == -1:\\n        continue\\n    if (ans[i]+c)/(i-ans[i]) <= e*0.01:\\n        ans[i+c] = max(ans[i]+c,ans[i+c])\\n    if (ans[i]+d)/(i-ans[i]) <= e*0.01:\\n        ans[i+d] = max(ans[i]+d,ans[i+d])\\n    ans[i+a*100] = max(ans[i+a*100],ans[i])\\n    ans[i+b*100] = max(ans[i+b*100],ans[i])\\n    if i != 0:\\n        if ans[i]/i > p:\\n            # print(p,i)\\n            p = ans[i]/i\\n            fin = [i,ans[i]]\\n# print(ans[190:210])\\nprint(*fin)\", \"A,B,C,D,E,F = (int(T) for T in input().split())\\nSugM = 0\\nWatM = 100*A\\nfor TC in range(0,F+1):\\n    for TD in range(0,F+1):\\n        Suger = C*TC+D*TD\\n        RestS = F-Suger\\n        if RestS>=0:\\n            for TA in range(0,(RestS//100)+1):\\n                for TB in range(0,(RestS//100)+1):\\n                    if TA==TB==0:\\n                        continue\\n                    else:\\n                        Water = TA*A*100+TB*B*100\\n                        RestW = RestS-Water\\n                        if RestW>=0 and Water>=(100*Suger)/E:\\n                            if SugM/(WatM+SugM)<Suger/(Water+Suger):\\n                                SugM = Suger\\n                                WatM = Water\\n                        else:\\n                            break\\n        else:\\n            break\\nprint('{} {}'.format(WatM+SugM,SugM))\", \"a,b,c,d,e,f=map(int,input().split())\\n\\nmax_s=0\\nmax_w=a\\nmax_conc=0\\n\\nwater_s=set()\\nsugar_s=set()\\nfor i in range(f//a//100+1):\\n  aa=a*i\\n  for j in range(f//b//100+1):\\n    bb=b*j\\n    if aa+bb <= f//100:\\n      water_s.add(aa+bb)\\n      \\nfor i in range(f//c+1):\\n  cc=c*i\\n  for j in range(f//d+1):\\n    dd=d*j\\n    if cc+dd <= f:\\n      sugar_s.add(cc+dd)\\n\\nfor w in water_s:\\n  for sg in sugar_s:\\n    if w*100+sg <= f and w*e >= sg and w+sg > 0:\\n      conc=(100*sg)/(100*w+sg)\\n      if max_conc < conc:\\n        max_conc=conc\\n        max_w=w\\n        max_s=sg\\nprint(max_w*100+max_s,max_s)\", \"a,b,c,d,e,f=map(int,input().split())\\ng=[-1]*9999\\ng[a*100]=0\\ng[b*100]=0\\nh=[a*100,0]\\np=0\\nfor i in range(1,f+1):\\n    if g[i]==-1:\\n        continue\\n    if (g[i]+c)/(i-g[i])<=e*0.01:\\n        g[i+c]=max(g[i]+c,g[i+c])\\n    if (g[i]+d)/(i-g[i])<=e*0.01:\\n        g[i+d]=max(g[i]+d,g[i+d])\\n    g[i+a*100]=max(g[i+a*100],g[i])\\n    g[i+b*100]=max(g[i+b*100],g[i])\\n    if g[i]/i>p:\\n        p=g[i]/i\\n        h=[i,g[i]]\\nprint(*h)\", \"import sys\\n\\nsys.setrecursionlimit(10 ** 7)\\ninput = sys.stdin.readline\\nf_inf = float('inf')\\nmod = 10 ** 9 + 7\\n\\n\\ndef resolve():\\n    A, B, C, D, E, F = list(map(int, input().split()))\\n\\n    water = set()\\n    for a in range(F // (A * 100) + 1):\\n        for b in range(F // (B * 100) + 1):\\n            if 0 < a * 100 * A + b * 100 * B <= F:\\n                water.add(a * 100 * A + b * 100 * B)\\n\\n    kouho = []\\n    for w in water:\\n        ma = (E * w) // 100\\n        for c in range(ma // C + 1):\\n            for d in range(ma // D + 1):\\n                sugar = c * C + d * D\\n                if 0 < sugar <= ma and w + sugar <= F:\\n                    kouho.append([w, sugar])\\n\\n    if len(kouho) == 0:\\n        print((list(water)[0], 0))\\n        return\\n\\n    max_noudo = 0\\n    res = []\\n    for w, sugar in kouho:\\n        noudo = sugar / (w + sugar)\\n        if max_noudo < noudo:\\n            max_noudo = noudo\\n            res = [w + sugar, sugar]\\n    print((*res))\\n\\n\\ndef __starting_point():\\n    resolve()\\n\\n__starting_point()\", \"a , b , c , d , e , f = map(int,input().split())\\nmidp = [-1 for i in range(f+1)]\\nmizu = []\\nmidp[0] = 0\\nfor i in range(f+1):\\n    if midp[i] != -1:\\n        if i + a*100 <= f and midp[i+a*100] != 0:\\n            midp[i+a*100] = 0\\n            mizu.append(i+a*100)\\n        if i + b*100 <= f and midp[i+b*100] != 0:\\n            midp[i+b*100] = 0\\n            mizu.append(i+b*100)\\nans = 0\\ncou = [a*100,0]\\nfor i in mizu:\\n    sai = i*e//100\\n    sadp = [-1 for f in range(sai+1)]\\n    sadp[0] = 0\\n    maxsa = 0\\n    for j in range(sai+1):\\n        if sadp[j] != -1:\\n            if j + c <= sai and i + j + c <= f and sadp[j+c] != 0:\\n                sadp[j+c] = 0\\n                maxsa = max(maxsa,j+c)\\n            if j + d <= sai and i + j + d <= f and sadp[j+d] != 0:\\n                sadp[j+d] = 0\\n                maxsa = max(maxsa,j+d)\\n    if ans < maxsa/(i+maxsa):\\n        ans = maxsa/(i+maxsa)\\n        cou = [i+maxsa,maxsa]\\n\\nprint(*cou)\", \"A,B,C,D,E,F = map(int,input().split())\\n\\nws = set()\\nfor a in range(0,F+1,100*A):\\n    for b in range(0,F+1,100*B):\\n        if a+b > F: break\\n        ws.add(a+b)\\nws.remove(0)\\n\\nss = set()\\nfor c in range(0,F+1,C):\\n    for d in range(0,F+1,D):\\n        if c+d > F: break\\n        ss.add(c+d)\\n\\nbest_s = -1\\nbest_w = 1\\nfor w in ws:\\n    for s in ss:\\n        if w+s > F: continue\\n        if E*w < s*100: continue\\n        if best_s * (s+w) < s * (best_s + best_w):\\n            best_s = s\\n            best_w = w\\nprint(best_s+best_w, best_s)\", \"a, b, c, d, e, f = map(int, input().split())\\nW = set(); S = set()\\nsa = 0; wsa = a * 100\\n\\nfor i in range(0, f + a * 100, a * 100):\\n    for j in range(0, f + b * 100, b * 100):\\n        w = i + j\\n        if w <= f:\\n            W.add(w)\\n        else:\\n            break\\nfor i in range(0, f // 2 + c, c):\\n    for j in range(0, f // 2 + d, d):\\n        s = i + j\\n        if s <= f // 2:\\n            S.add(s)\\n        else:\\n            break\\nS.remove(0)\\nfor i in W:\\n    for j in S:\\n        if e / (100 + e) >= j / (i + j) > sa / wsa and i + j <= f:\\n            sa, wsa = j, i + j\\nprint(wsa, sa)\", \"a,b,c,d,e,f=map(int,input().split())\\na=100*a\\nb=100*b\\ndp1=[0]*(f+1)\\ndp2=[0]*(f+1)\\nfor i in range(f+1):\\n    if i%a==0:\\n        if i+a<=f:\\n            dp1[i+a]=1\\nfor i in range(f+1):\\n    if i==0 or dp1[i]==1:\\n        if i+b<=f:\\n            dp1[i+b]=1\\nfor i in range(f+1):\\n    if i%c==0:\\n        if i+c<=f:\\n            dp2[i+c]=1\\nfor i in range(f+1):\\n    if i==0 or dp2[i]==1:\\n        if i+d<=f:\\n            dp2[i+d]=1\\n\\nans=[-1,-1,-1]\\nfor i in range(f+1):\\n    if dp1[i]==1:\\n        x=min(f-i,(i//100)*e)\\n        k=-1\\n        for j in range(x,-1,-1):\\n            if dp2[j]==1 or j==0:\\n                k=j\\n                if ans[0]<100*k/(i+k):\\n                    ans=[100*k/(i+k),i+k,k]\\n                break\\nprint(str(ans[1])+\\\" \\\"+str(ans[2]))\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    A, B, C, D, E, F = list(map(int, input().split()))\\n\\n    max_concentration = 0\\n    ans = (100 * A, 0)\\n    for a in range(0, F + 1, 100 * A):\\n        for b in range(0, F - a + 1, 100 * B):\\n            water = a + b\\n            if water == 0:\\n                break\\n            for c in range(0, F - water + 1, C):\\n                for d in range(0, F - water - c + 1, D):\\n                    sugar = c + d\\n                    if sugar > (water // 100) * E:\\n                        break\\n                    concentration = (100 * sugar) / (water + sugar)\\n                    if concentration > max_concentration:\\n                        max_concentration = concentration\\n                        ans = (water + sugar, sugar)\\n\\n    print((\\\" \\\".join(map(str, ans))))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A,B,C,D,E,F=map(int,input().split(' '))\\nwater = set()\\nfor a in range(0,F,100*A):\\n  for b in range(0,F,100*B):\\n    if a+b <= F:\\n      water.add(a+b)\\n    else:\\n      break\\nsugars = set()\\nfor c in range(0,F,C):\\n  for d in range(0,F,D):\\n    if c+d <= F:\\n      sugars.add(c+d)\\n    else:\\n      break\\ndensity = 0\\nsugar = 0\\ncontent = 100*A\\nfor x in water:\\n  for y in sugars:\\n    if x+y != 0 and x+y <= F and E*x >= 100*y and density < y/(x+y):\\n      density = y/(x+y)\\n      sugar = y\\n      content = x+y\\nprint(content,sugar)\", \"def main():\\n\\tA, B, C, D, E, F = map(int, input().split())\\n\\twater = set()\\n\\tsugar = set()\\n\\n\\tfor i in range(F // (100 * A) + 1):\\n\\t\\tfor j in range(F // (100 * B) + 1):\\n\\t\\t\\twater_amount = 100 * A * i + 100 * B * j\\n\\t\\t\\tif 0 < water_amount and water_amount <= F:\\n\\t\\t\\t\\twater.add(water_amount)\\n\\n\\tfor i in range(F // C + 1):\\n\\t\\tfor j in range(F // D + 1):\\n\\t\\t\\tsugar_amount = C * i + D * j\\n\\t\\t\\tif sugar_amount <= F:\\n\\t\\t\\t\\tsugar.add(sugar_amount)\\n\\n\\t# print(water)\\n\\t# print(sugar)\\n\\n\\tmax_c = -1\\n\\tmax_w = 0\\n\\tmax_s = 0\\n\\n\\tfor w in water:\\n\\t\\tfor s in sugar:\\n\\t\\t\\tif w + s <= F:\\n\\t\\t\\t\\tif s / w <= E / 100:\\n\\t\\t\\t\\t\\tif s * 100 / (w + s) > max_c:\\n\\t\\t\\t\\t\\t\\tmax_c = s * 100 / (w + s)\\n\\t\\t\\t\\t\\t\\tmax_w = w\\n\\t\\t\\t\\t\\t\\tmax_s = s\\n\\n\\tprint(max_w + max_s, max_s)\\n\\n \\ndef __starting_point():\\n  \\tmain()\\n__starting_point()\"]",
        "difficulty": "introductory",
        "input": "1 2 10 20 15 200\n",
        "output": "110 10\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc074/tasks/arc083_a"
    },
    {
        "id": 940,
        "task_id": 4615,
        "test_case_id": 3,
        "question": "Snuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n - Operation 1: Pour 100A grams of water into the beaker.\n - Operation 2: Pour 100B grams of water into the beaker.\n - Operation 3: Put C grams of sugar into the beaker.\n - Operation 4: Put D grams of sugar into the beaker.\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\nSnuke will make sugar water with the highest possible density.\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\n-----Constraints-----\n - 1 \\leq A < B \\leq 30\n - 1 \\leq C < D \\leq 30\n - 1 \\leq E \\leq 100\n - 100A \\leq F \\leq 3 000\n - A, B, C, D, E and F are all integers.\n\n-----Inputs-----\nInput is given from Standard Input in the following format:\nA B C D E F\n\n-----Outputs-----\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\n-----Sample Input-----\n1 2 10 20 15 200\n\n-----Sample Output-----\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n - If we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n - If we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.",
        "solutions": "[\"a, b, c, d, e, f = map(int, input().split())\\ns = set()\\nfor i in range(30 // a + 1):\\n    for j in range(30 // b + 1):\\n        if 0 < (a * i + b * j) * 100 <= f:\\n            s = s | {a * i + b * j}\\ns2 = set()\\nfor i in range(3000 // c + 1):\\n    for j in range(3000 // d + 1):\\n        if c * i + d * j <= f:\\n            s2 = s2 | {c * i + d * j}\\nans = []\\nfor i in s:\\n    for j in s2:\\n        if i * 100 + j <= f and j <= i * e:\\n            ans.append([j / i * -1, i * 100 + j, j])\\nans.sort()\\nprint(ans[0][1], ans[0][2])\", \"A,B,C,D,E,F = map(int,input().split())\\n\\nconcentration = 0\\nans = [A*100,0]\\n\\nwater = []\\nfor a in range(F//(A*100) + 1):\\n  for b in range(((F-a*A*100)//(B*100))+1):\\n    water.append((a*A+b*B)*100)\\n    \\nwater = sorted(list(set(water)))\\n\\nsugar = []\\nfor c in range(F//C + 1):\\n  for d in range(((F - c*C)//D)+1):\\n    sugar.append(c*C+d*D)\\nsugar = sorted(list(set(sugar)))\\n\\n\\nfor wa in water:\\n  for su in sugar:\\n    if wa + su <= F:\\n      if su <= (wa/100)*E:\\n        if wa != 0:\\n          if concentration < su/(su+wa):\\n            concentration = su/(su+wa)\\n            ans = [su+wa,su]\\n\\nprint(\\\" \\\".join(map(str,ans)))\", \"A,B,C,D,E,F = map(int,input().split())\\nmx =- 1\\nS = set()\\nW = set()\\n\\nfor a in range(0,F+1,100*A):\\n  for b in range(0,F+1-a,100*B):\\n    W.add(a+b)\\n\\nfor c in range(0,F+1,C):\\n  for d in range(0,F+1-c,D):\\n    S.add(c+d)\\n\\nfor w in W:\\n  for s in S:\\n    if 0<w+s<=F and s<=w*E//100:\\n      if mx<s/(w+s):\\n        ans=w+s,s\\n        mx=s/(w+s)\\n\\nprint(ans[0],ans[1])\", \"a,b,c,d,e,f=map(int,input().split())\\nw=set()\\nfor i in range(0,f,100*a):\\n    for j in range(0,f,100*b):\\n        if i+j<=f:\\n            w.add(i+j)\\n        else:\\n            break\\ns=set()\\nfor i in range(0,f,c):\\n    for j in range(0,f,d):\\n        if i+j<=f:\\n            s.add(i+j)\\n        else:\\n            break\\nn=100*a\\nm=0\\nl=0\\nfor x in w:\\n    for t in s:\\n        if x+t!=0 and x+t<=f and 100*t<=e*x and t/(x+t)>l:\\n            n=x+t\\n            m=t\\n            l=t/(x+t)\\nprint(n,m)\", \"A,B,C,D,E,F = map(int,input().split())\\nmx =- 1\\nS = set()\\nW = set()\\n\\nfor a in range(0,F+1,100*A):\\n  for b in range(0,F+1-a,100*B):\\n    W.add(a+b)\\n\\nfor c in range(0,F+1,C):\\n  for d in range(0,F+1-c,D):\\n    S.add(c+d)\\n\\nfor w in W:\\n  for s in S:\\n    if 0<w+s<=F and s<=w*E//100:\\n      if mx<s/(w+s):\\n        ans=w+s,s\\n        mx=s/(w+s)\\n\\nprint(ans[0],ans[1])\", \"a, b, c, d, e, f = map(int, input().split())\\n\\nwater = [False] * (f//100 + 1)\\nfor i in range(0, len(water), a):\\n    water[i] = True\\nfor i in range(len(water) - b):\\n    if water[i]:\\n        water[i + b] = True\\n\\nsugar = [False] * ((f//100) * e + 1)\\nfor i in range(0, len(sugar), c):\\n    sugar[i] = True\\nfor i in range(len(sugar) - d):\\n    if sugar[i]:\\n        sugar[i + d] = True\\n\\n# denominator: \\u5206\\u6bcd, numerator: \\u5206\\u5b50\\ndeno = a * 100\\nnume = 0\\n\\nfor i in range(1, len(water)):\\n    if water[i]:\\n        j = min([i*e, f - 100*i])\\n        while not sugar[j]:\\n            j -= 1\\n        i = 100 * i + j\\n\\n        if nume * i < deno * j:\\n            deno = i\\n            nume = j\\n\\nprint(deno, nume)\", \"a, b, c, d, e, f = map(int, input().split())\\nW = set(); S = set()\\nsa = 0; wsa = a * 100\\nfor i in range(0, f + a * 100, a * 100):\\n    for j in range(0, f + b * 100, b * 100):\\n        w = i + j\\n        if w <= f:\\n            W.add(w)\\n        else:\\n            break\\nfor i in range(0, f // 2 + c, c):\\n    for j in range(0, f // 2 + d, d):\\n        s = i + j\\n        if s <= f // 2:\\n            S.add(s)\\n        else:\\n            break\\nS.remove(0)\\nfor i in W:\\n    for j in S:\\n        if e / (100 + e) >= j / (i + j) > sa / wsa and i + j <= f:\\n            sa, wsa = j, i + j\\nprint(wsa, sa)\", \"import bisect, heapq\\n\\na, b, c, d, e, f = map(int, input().split())\\n\\nw = set()\\ntemp = [a * i for i in range((30 - 1) // a + 2)]\\nfor i in temp:\\n    while i not in w and i <= 30:\\n        w.add(i)\\n        i += b\\nw = list(w)\\nw.remove(0)\\nw.sort()\\n\\ns = set()\\ntemp = [c * i for i in range((3000 - 1) // c + 2)]\\nfor i in temp:\\n    while i not in s and i <= 3000:\\n        s.add(i)\\n        i += d\\ns = list(s)\\ns.sort()\\n\\nqueue = []\\nheapq.heapify(queue)\\nfor i in w:\\n    if i * 100 > f:\\n        continue\\n    num = bisect.bisect(s, i * e)\\n    for j in range(num - 1, -1, -1):\\n        if i * 100 + s[j] > f:\\n            continue\\n        heapq.heappush(queue, [-s[j] / i, 100 * i + s[j], s[j]])\\n        break\\nprint(queue[0][1], queue[0][2])\", \"a, b, c, d, e, f = map(int, input().split())\\n\\nans = -1\\nans_water = -1\\nans_sugar = -1\\nfor ia in range(f//(a*100)+2):\\n    water = 100*a*ia\\n    if water > f or water == 0: continue\\n    for ib in range(f//(b*100)+2):\\n        if ib != 0: water += 100*b\\n        if water > f or water == 0: continue\\n        for ic in range(f//c+1):\\n            sugar = c*ic\\n            if sugar/(water//100) > e: continue\\n            for id in range(f//d+1):\\n                if id != 0: sugar+=d\\n                if sugar/(water//100) > e: continue\\n                if sugar + water > f: continue\\n                if (100*sugar)/(sugar+water) > ans:\\n                    ans = (100*sugar)/(sugar+water)\\n                    ans_water = water\\n                    ans_sugar = sugar\\nprint(ans_sugar+ans_water, ans_sugar)\", \"a,b,c,d,e,f=map(int,input().split())\\nans=[-1]*9999\\nans[a*100]=0\\nans[b*100]=0\\nfin=[a*100,0]\\np=0\\nfor i in range(1,f+1):\\n    if ans[i]==-1:\\n        continue\\n    if (ans[i]+c)/(i-ans[i])<=e*0.01:\\n        ans[i+c]=max(ans[i]+c,ans[i+c])\\n    if (ans[i]+d)/(i-ans[i])<=e*0.01:\\n        ans[i+d]=max(ans[i]+d,ans[i+d])\\n    ans[i+a*100]=max(ans[i+a*100],ans[i])\\n    ans[i+b*100]=max(ans[i+b*100],ans[i])\\n    if ans[i]/i>p:\\n        p=ans[i]/i\\n        fin=[i,ans[i]]\\nprint(*fin)\", \"a,b,c,d,e,f = map(int,input().split())\\nans = [-1]*10000\\n# ans[0] = 0\\nans[a*100] = 0\\nans[b*100] = 0\\nq1 = a*100\\nq2 = b*100\\np = 0\\nfin = [a*100,0]\\nfor i in range(1,f+1):\\n    if ans[i] == -1:\\n        continue\\n    if (ans[i]+c)/(i-ans[i]) <= e*0.01:\\n        ans[i+c] = max(ans[i]+c,ans[i+c])\\n    if (ans[i]+d)/(i-ans[i]) <= e*0.01:\\n        ans[i+d] = max(ans[i]+d,ans[i+d])\\n    ans[i+a*100] = max(ans[i+a*100],ans[i])\\n    ans[i+b*100] = max(ans[i+b*100],ans[i])\\n    if i != 0:\\n        if ans[i]/i > p:\\n            # print(p,i)\\n            p = ans[i]/i\\n            fin = [i,ans[i]]\\n# print(ans[190:210])\\nprint(*fin)\", \"A,B,C,D,E,F = (int(T) for T in input().split())\\nSugM = 0\\nWatM = 100*A\\nfor TC in range(0,F+1):\\n    for TD in range(0,F+1):\\n        Suger = C*TC+D*TD\\n        RestS = F-Suger\\n        if RestS>=0:\\n            for TA in range(0,(RestS//100)+1):\\n                for TB in range(0,(RestS//100)+1):\\n                    if TA==TB==0:\\n                        continue\\n                    else:\\n                        Water = TA*A*100+TB*B*100\\n                        RestW = RestS-Water\\n                        if RestW>=0 and Water>=(100*Suger)/E:\\n                            if SugM/(WatM+SugM)<Suger/(Water+Suger):\\n                                SugM = Suger\\n                                WatM = Water\\n                        else:\\n                            break\\n        else:\\n            break\\nprint('{} {}'.format(WatM+SugM,SugM))\", \"a,b,c,d,e,f=map(int,input().split())\\n\\nmax_s=0\\nmax_w=a\\nmax_conc=0\\n\\nwater_s=set()\\nsugar_s=set()\\nfor i in range(f//a//100+1):\\n  aa=a*i\\n  for j in range(f//b//100+1):\\n    bb=b*j\\n    if aa+bb <= f//100:\\n      water_s.add(aa+bb)\\n      \\nfor i in range(f//c+1):\\n  cc=c*i\\n  for j in range(f//d+1):\\n    dd=d*j\\n    if cc+dd <= f:\\n      sugar_s.add(cc+dd)\\n\\nfor w in water_s:\\n  for sg in sugar_s:\\n    if w*100+sg <= f and w*e >= sg and w+sg > 0:\\n      conc=(100*sg)/(100*w+sg)\\n      if max_conc < conc:\\n        max_conc=conc\\n        max_w=w\\n        max_s=sg\\nprint(max_w*100+max_s,max_s)\", \"a,b,c,d,e,f=map(int,input().split())\\ng=[-1]*9999\\ng[a*100]=0\\ng[b*100]=0\\nh=[a*100,0]\\np=0\\nfor i in range(1,f+1):\\n    if g[i]==-1:\\n        continue\\n    if (g[i]+c)/(i-g[i])<=e*0.01:\\n        g[i+c]=max(g[i]+c,g[i+c])\\n    if (g[i]+d)/(i-g[i])<=e*0.01:\\n        g[i+d]=max(g[i]+d,g[i+d])\\n    g[i+a*100]=max(g[i+a*100],g[i])\\n    g[i+b*100]=max(g[i+b*100],g[i])\\n    if g[i]/i>p:\\n        p=g[i]/i\\n        h=[i,g[i]]\\nprint(*h)\", \"import sys\\n\\nsys.setrecursionlimit(10 ** 7)\\ninput = sys.stdin.readline\\nf_inf = float('inf')\\nmod = 10 ** 9 + 7\\n\\n\\ndef resolve():\\n    A, B, C, D, E, F = list(map(int, input().split()))\\n\\n    water = set()\\n    for a in range(F // (A * 100) + 1):\\n        for b in range(F // (B * 100) + 1):\\n            if 0 < a * 100 * A + b * 100 * B <= F:\\n                water.add(a * 100 * A + b * 100 * B)\\n\\n    kouho = []\\n    for w in water:\\n        ma = (E * w) // 100\\n        for c in range(ma // C + 1):\\n            for d in range(ma // D + 1):\\n                sugar = c * C + d * D\\n                if 0 < sugar <= ma and w + sugar <= F:\\n                    kouho.append([w, sugar])\\n\\n    if len(kouho) == 0:\\n        print((list(water)[0], 0))\\n        return\\n\\n    max_noudo = 0\\n    res = []\\n    for w, sugar in kouho:\\n        noudo = sugar / (w + sugar)\\n        if max_noudo < noudo:\\n            max_noudo = noudo\\n            res = [w + sugar, sugar]\\n    print((*res))\\n\\n\\ndef __starting_point():\\n    resolve()\\n\\n__starting_point()\", \"a , b , c , d , e , f = map(int,input().split())\\nmidp = [-1 for i in range(f+1)]\\nmizu = []\\nmidp[0] = 0\\nfor i in range(f+1):\\n    if midp[i] != -1:\\n        if i + a*100 <= f and midp[i+a*100] != 0:\\n            midp[i+a*100] = 0\\n            mizu.append(i+a*100)\\n        if i + b*100 <= f and midp[i+b*100] != 0:\\n            midp[i+b*100] = 0\\n            mizu.append(i+b*100)\\nans = 0\\ncou = [a*100,0]\\nfor i in mizu:\\n    sai = i*e//100\\n    sadp = [-1 for f in range(sai+1)]\\n    sadp[0] = 0\\n    maxsa = 0\\n    for j in range(sai+1):\\n        if sadp[j] != -1:\\n            if j + c <= sai and i + j + c <= f and sadp[j+c] != 0:\\n                sadp[j+c] = 0\\n                maxsa = max(maxsa,j+c)\\n            if j + d <= sai and i + j + d <= f and sadp[j+d] != 0:\\n                sadp[j+d] = 0\\n                maxsa = max(maxsa,j+d)\\n    if ans < maxsa/(i+maxsa):\\n        ans = maxsa/(i+maxsa)\\n        cou = [i+maxsa,maxsa]\\n\\nprint(*cou)\", \"A,B,C,D,E,F = map(int,input().split())\\n\\nws = set()\\nfor a in range(0,F+1,100*A):\\n    for b in range(0,F+1,100*B):\\n        if a+b > F: break\\n        ws.add(a+b)\\nws.remove(0)\\n\\nss = set()\\nfor c in range(0,F+1,C):\\n    for d in range(0,F+1,D):\\n        if c+d > F: break\\n        ss.add(c+d)\\n\\nbest_s = -1\\nbest_w = 1\\nfor w in ws:\\n    for s in ss:\\n        if w+s > F: continue\\n        if E*w < s*100: continue\\n        if best_s * (s+w) < s * (best_s + best_w):\\n            best_s = s\\n            best_w = w\\nprint(best_s+best_w, best_s)\", \"a, b, c, d, e, f = map(int, input().split())\\nW = set(); S = set()\\nsa = 0; wsa = a * 100\\n\\nfor i in range(0, f + a * 100, a * 100):\\n    for j in range(0, f + b * 100, b * 100):\\n        w = i + j\\n        if w <= f:\\n            W.add(w)\\n        else:\\n            break\\nfor i in range(0, f // 2 + c, c):\\n    for j in range(0, f // 2 + d, d):\\n        s = i + j\\n        if s <= f // 2:\\n            S.add(s)\\n        else:\\n            break\\nS.remove(0)\\nfor i in W:\\n    for j in S:\\n        if e / (100 + e) >= j / (i + j) > sa / wsa and i + j <= f:\\n            sa, wsa = j, i + j\\nprint(wsa, sa)\", \"a,b,c,d,e,f=map(int,input().split())\\na=100*a\\nb=100*b\\ndp1=[0]*(f+1)\\ndp2=[0]*(f+1)\\nfor i in range(f+1):\\n    if i%a==0:\\n        if i+a<=f:\\n            dp1[i+a]=1\\nfor i in range(f+1):\\n    if i==0 or dp1[i]==1:\\n        if i+b<=f:\\n            dp1[i+b]=1\\nfor i in range(f+1):\\n    if i%c==0:\\n        if i+c<=f:\\n            dp2[i+c]=1\\nfor i in range(f+1):\\n    if i==0 or dp2[i]==1:\\n        if i+d<=f:\\n            dp2[i+d]=1\\n\\nans=[-1,-1,-1]\\nfor i in range(f+1):\\n    if dp1[i]==1:\\n        x=min(f-i,(i//100)*e)\\n        k=-1\\n        for j in range(x,-1,-1):\\n            if dp2[j]==1 or j==0:\\n                k=j\\n                if ans[0]<100*k/(i+k):\\n                    ans=[100*k/(i+k),i+k,k]\\n                break\\nprint(str(ans[1])+\\\" \\\"+str(ans[2]))\", \"import sys\\n\\ninput = sys.stdin.readline\\n\\n\\ndef main():\\n    A, B, C, D, E, F = list(map(int, input().split()))\\n\\n    max_concentration = 0\\n    ans = (100 * A, 0)\\n    for a in range(0, F + 1, 100 * A):\\n        for b in range(0, F - a + 1, 100 * B):\\n            water = a + b\\n            if water == 0:\\n                break\\n            for c in range(0, F - water + 1, C):\\n                for d in range(0, F - water - c + 1, D):\\n                    sugar = c + d\\n                    if sugar > (water // 100) * E:\\n                        break\\n                    concentration = (100 * sugar) / (water + sugar)\\n                    if concentration > max_concentration:\\n                        max_concentration = concentration\\n                        ans = (water + sugar, sugar)\\n\\n    print((\\\" \\\".join(map(str, ans))))\\n\\n\\ndef __starting_point():\\n    main()\\n\\n__starting_point()\", \"A,B,C,D,E,F=map(int,input().split(' '))\\nwater = set()\\nfor a in range(0,F,100*A):\\n  for b in range(0,F,100*B):\\n    if a+b <= F:\\n      water.add(a+b)\\n    else:\\n      break\\nsugars = set()\\nfor c in range(0,F,C):\\n  for d in range(0,F,D):\\n    if c+d <= F:\\n      sugars.add(c+d)\\n    else:\\n      break\\ndensity = 0\\nsugar = 0\\ncontent = 100*A\\nfor x in water:\\n  for y in sugars:\\n    if x+y != 0 and x+y <= F and E*x >= 100*y and density < y/(x+y):\\n      density = y/(x+y)\\n      sugar = y\\n      content = x+y\\nprint(content,sugar)\", \"def main():\\n\\tA, B, C, D, E, F = map(int, input().split())\\n\\twater = set()\\n\\tsugar = set()\\n\\n\\tfor i in range(F // (100 * A) + 1):\\n\\t\\tfor j in range(F // (100 * B) + 1):\\n\\t\\t\\twater_amount = 100 * A * i + 100 * B * j\\n\\t\\t\\tif 0 < water_amount and water_amount <= F:\\n\\t\\t\\t\\twater.add(water_amount)\\n\\n\\tfor i in range(F // C + 1):\\n\\t\\tfor j in range(F // D + 1):\\n\\t\\t\\tsugar_amount = C * i + D * j\\n\\t\\t\\tif sugar_amount <= F:\\n\\t\\t\\t\\tsugar.add(sugar_amount)\\n\\n\\t# print(water)\\n\\t# print(sugar)\\n\\n\\tmax_c = -1\\n\\tmax_w = 0\\n\\tmax_s = 0\\n\\n\\tfor w in water:\\n\\t\\tfor s in sugar:\\n\\t\\t\\tif w + s <= F:\\n\\t\\t\\t\\tif s / w <= E / 100:\\n\\t\\t\\t\\t\\tif s * 100 / (w + s) > max_c:\\n\\t\\t\\t\\t\\t\\tmax_c = s * 100 / (w + s)\\n\\t\\t\\t\\t\\t\\tmax_w = w\\n\\t\\t\\t\\t\\t\\tmax_s = s\\n\\n\\tprint(max_w + max_s, max_s)\\n\\n \\ndef __starting_point():\\n  \\tmain()\\n__starting_point()\"]",
        "difficulty": "introductory",
        "input": "17 19 22 26 55 2802\n",
        "output": "2634 934\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://atcoder.jp/contests/abc074/tasks/arc083_a"
    },
    {
        "id": 941,
        "task_id": 4948,
        "test_case_id": 1,
        "question": "Of course you have all heard of the International Cheese Processing Company. Their machine for cutting a piece of cheese into slices of exactly the same thickness is a classic. Recently they produced a machine able to cut a spherical cheese (such as Edam) into slices – no, not all of the same thickness, but all of the same weight! But new challenges lie ahead: cutting Swiss cheese. \n\nSwiss cheese such as Emmentaler has holes in it, and the holes may have different sizes. A slice with holes contains less cheese and has a lower weight than a slice without holes. So here is the challenge: cut a cheese with holes in it into slices of equal weight.\n\nBy smart sonar techniques (the same techniques used to scan unborn babies and oil fields), it is possible to locate the holes in the cheese up to micrometer precision. For the present problem you may assume that the holes are perfect spheres.\n\nEach uncut block has size $100 \\times 100 \\times 100$ where each dimension is measured in millimeters. Your task is to cut it into $s$ slices of equal weight. The slices will be $100$ mm wide and $100$ mm high, and your job is to determine the thickness of each slice.\n\n-----Input-----\nThe first line of the input contains two integers $n$ and $s$, where $0 \\leq n \\leq 10000$ is the number of holes in the cheese, and $1 \\le s \\le 100$ is the number of slices to cut. The next $n$ lines each contain four positive integers $r$, $x$, $y$, and $z$ that describe a hole, where $r$ is the radius and $x$, $y$, and $z$ are the coordinates of the center, all in micrometers.\n\nThe cheese block occupies the points $(x,y,z)$ where $0 \\le x,y,z \\le 100000$, except for the points that are part of some hole. The cuts are made perpendicular to the $z$ axis.\n\nYou may assume that holes do not overlap but may touch, and that the holes are fully contained in the cheese but may touch its boundary.\n\n-----Output-----\nDisplay the $s$ slice thicknesses in millimeters, starting from the end of the cheese with $z=0$. Your output should have an absolute or relative error of at most $10^{-6}$.\n\n-----Examples-----\nSample Input:\n0 4\nSample Output:\n25.000000000\n25.000000000\n25.000000000\n25.000000000",
        "solutions": "",
        "difficulty": "introductory",
        "input": "0 4\n",
        "output": "25.000000000\n25.000000000\n25.000000000\n25.000000000\n",
        "halu_type": "Data Compliance Hallucination",
        "fn_name": null,
        "starter_code": "",
        "url": "https://open.kattis.com/problems/cheese"
    }
]